From a7bccf7d0117d07aaf0d7b4a758996cc4d89d0f7 Mon Sep 17 00:00:00 2001
From: realstealthninja <realstealthninja@users.noreply.github.com>
Date: Mon, 4 Nov 2024 12:43:05 +0000
Subject: [PATCH] Documentation for 8b1eab204b83e2516366d4b3aec97fe76c600099

---
 annotated.html                                |   47 +-
 annotated_dup.js                              |    2 +-
 classes.html                                  |   37 +-
 d0/d01/smallest__circle_8cpp.html             |  213 +-
 ...283886819c7c140a023582b7269e2d0_cgraph.map |   24 -
 ...283886819c7c140a023582b7269e2d0_cgraph.md5 |    1 -
 ...283886819c7c140a023582b7269e2d0_cgraph.svg |  293 --
 ...86819c7c140a023582b7269e2d0_cgraph_org.svg |  210 --
 ...b0676df8e4da7a08c7ccaecea344903_cgraph.map |   19 -
 ...b0676df8e4da7a08c7ccaecea344903_cgraph.md5 |    1 -
 ...b0676df8e4da7a08c7ccaecea344903_cgraph.svg |  191 --
 ...6df8e4da7a08c7ccaecea344903_cgraph_org.svg |  165 -
 ...cbebd6f4d2cdf227663c67fe41ba12a_cgraph.map |    5 -
 ...cbebd6f4d2cdf227663c67fe41ba12a_cgraph.md5 |    1 -
 ...cbebd6f4d2cdf227663c67fe41ba12a_cgraph.svg |   65 -
 ...d6f4d2cdf227663c67fe41ba12a_cgraph_org.svg |   39 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.map |   24 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.md5 |    1 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.svg |  293 --
 ...5dd5c30adda100e95f0423c786e_cgraph_org.svg |  210 --
 ...4682a4a70d5906857ca09de5b9fb2cc_cgraph.map |    8 -
 ...4682a4a70d5906857ca09de5b9fb2cc_cgraph.md5 |    1 -
 ...4682a4a70d5906857ca09de5b9fb2cc_cgraph.svg |   92 -
 ...a4a70d5906857ca09de5b9fb2cc_cgraph_org.svg |   66 -
 ...1a3968e7947464bee7714f6d43b7002_cgraph.map |   24 -
 ...1a3968e7947464bee7714f6d43b7002_cgraph.md5 |    1 -
 ...1a3968e7947464bee7714f6d43b7002_cgraph.svg |  293 --
 ...68e7947464bee7714f6d43b7002_cgraph_org.svg |  210 --
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   37 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  410 ---
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  327 --
 ...e6d48762c1dfb9f14627927f0c16fad_cgraph.map |    9 -
 ...e6d48762c1dfb9f14627927f0c16fad_cgraph.md5 |    1 -
 ...e6d48762c1dfb9f14627927f0c16fad_cgraph.svg |  101 -
 ...8762c1dfb9f14627927f0c16fad_cgraph_org.svg |   75 -
 d0/d01/smallest__circle_8cpp_source.html      |  306 ++
 d0/d08/realtime__stats_8cpp.html              |  116 +-
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map |   37 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 |    1 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg |  416 ---
 ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg |  333 --
 ...54c915581fcc495489175a4386d59fd_cgraph.map |   26 -
 ...54c915581fcc495489175a4386d59fd_cgraph.md5 |    1 -
 ...54c915581fcc495489175a4386d59fd_cgraph.svg |  260 --
 ...15581fcc495489175a4386d59fd_cgraph_org.svg |  234 --
 d0/d08/realtime__stats_8cpp_source.html       |  317 ++
 d0/d0d/structmst-members.html                 |   35 +-
 ...round__to__ground__projectile__motion.html |   35 +-
 ...lassgraph_1_1_rooted_tree__coll__graph.map |    6 +-
 ...lassgraph_1_1_rooted_tree__coll__graph.md5 |    2 +-
 ...lassgraph_1_1_rooted_tree__coll__graph.svg |    6 +-
 ...graph_1_1_rooted_tree__coll__graph_org.svg |    6 +-
 d0/d2b/namespacequick__sort.html              |   35 +-
 d0/d2e/namespaceneural__network.html          |   35 +-
 d0/d3e/classdata__structures_1_1trie.html     |  226 +-
 ...ab94bc6417e3f59fab33cea5b64d546_cgraph.map |    9 -
 ...ab94bc6417e3f59fab33cea5b64d546_cgraph.md5 |    1 -
 ...ab94bc6417e3f59fab33cea5b64d546_cgraph.svg |  104 -
 ...bc6417e3f59fab33cea5b64d546_cgraph_org.svg |   78 -
 ...99f87fd833203ef9492b4870aa6d42d_cgraph.map |    9 -
 ...99f87fd833203ef9492b4870aa6d42d_cgraph.md5 |    1 -
 ...99f87fd833203ef9492b4870aa6d42d_cgraph.svg |  103 -
 ...7fd833203ef9492b4870aa6d42d_cgraph_org.svg |   77 -
 ...61eb5d576d2420f2036009154397c63_cgraph.map |    9 -
 ...61eb5d576d2420f2036009154397c63_cgraph.md5 |    1 -
 ...61eb5d576d2420f2036009154397c63_cgraph.svg |  103 -
 ...5d576d2420f2036009154397c63_cgraph_org.svg |   77 -
 ...b373beb3f618b90922528c68797d988_cgraph.map |    5 -
 ...b373beb3f618b90922528c68797d988_cgraph.md5 |    1 -
 ...b373beb3f618b90922528c68797d988_cgraph.svg |   66 -
 ...beb3f618b90922528c68797d988_cgraph_org.svg |   40 -
 ...ac27cfd397d2dd3f2f519efffafeeab_cgraph.map |   10 -
 ...ac27cfd397d2dd3f2f519efffafeeab_cgraph.md5 |    1 -
 ...ac27cfd397d2dd3f2f519efffafeeab_cgraph.svg |  112 -
 ...cfd397d2dd3f2f519efffafeeab_cgraph_org.svg |   86 -
 ...umber__of__digits__in__a__number_8cpp.html |   80 +-
 ...4c15b7f1aedd4419a65cd49562cc300_cgraph.map |    5 -
 ...4c15b7f1aedd4419a65cd49562cc300_cgraph.md5 |    1 -
 ...4c15b7f1aedd4419a65cd49562cc300_cgraph.svg |   66 -
 ...b7f1aedd4419a65cd49562cc300_cgraph_org.svg |   40 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   84 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   58 -
 ...of__digits__in__a__number_8cpp_source.html |  213 ++
 d0/d51/approximate__pi_8cpp.html              |   80 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |   11 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |  119 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   93 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   13 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  137 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  111 -
 d0/d51/approximate__pi_8cpp_source.html       |  193 ++
 d0/d52/namespacewiggle__sort.html             |   35 +-
 d0/d55/classcll-members.html                  |   35 +-
 d0/d58/classgraph_1_1_rooted_tree.html        |  175 +-
 ...cdeecac857623e9fbfe92590f3c504d_cgraph.map |   17 -
 ...cdeecac857623e9fbfe92590f3c504d_cgraph.md5 |    1 -
 ...cdeecac857623e9fbfe92590f3c504d_cgraph.svg |  233 --
 ...cac857623e9fbfe92590f3c504d_cgraph_org.svg |  150 -
 ...6928f3ebd491541e9570e746b877c1e_cgraph.map |   15 -
 ...6928f3ebd491541e9570e746b877c1e_cgraph.md5 |    1 -
 ...6928f3ebd491541e9570e746b877c1e_cgraph.svg |  157 -
 ...f3ebd491541e9570e746b877c1e_cgraph_org.svg |  131 -
 d0/d5a/skip__list_8cpp.html                   |   77 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   26 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  257 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  231 --
 d0/d5a/skip__list_8cpp_source.html            |  342 ++
 ...uctures_1_1trie__operations_1_1_tnode.html |  353 ++-
 ...97913c4badec2b60d50a171ecc299fe_cgraph.map |    6 -
 ...97913c4badec2b60d50a171ecc299fe_cgraph.md5 |    1 -
 ...97913c4badec2b60d50a171ecc299fe_cgraph.svg |   76 -
 ...3c4badec2b60d50a171ecc299fe_cgraph_org.svg |   50 -
 ...8b70172ca4fb2811dbfb9a86e48b34c_cgraph.map |    9 -
 ...8b70172ca4fb2811dbfb9a86e48b34c_cgraph.md5 |    1 -
 ...8b70172ca4fb2811dbfb9a86e48b34c_cgraph.svg |  105 -
 ...172ca4fb2811dbfb9a86e48b34c_cgraph_org.svg |   79 -
 ...c5ab271d8042540f64ef16d259d1503_cgraph.map |   13 -
 ...c5ab271d8042540f64ef16d259d1503_cgraph.md5 |    1 -
 ...c5ab271d8042540f64ef16d259d1503_cgraph.svg |  143 -
 ...271d8042540f64ef16d259d1503_cgraph_org.svg |  117 -
 ...e556f52c837190ecf4265b1f05cfe9c_cgraph.map |    6 -
 ...e556f52c837190ecf4265b1f05cfe9c_cgraph.md5 |    1 -
 ...e556f52c837190ecf4265b1f05cfe9c_cgraph.svg |   76 -
 ...f52c837190ecf4265b1f05cfe9c_cgraph_org.svg |   50 -
 ...cafb8c9f3ebac7ac6c01d9645bb67b6_cgraph.map |    5 -
 ...cafb8c9f3ebac7ac6c01d9645bb67b6_cgraph.md5 |    1 -
 ...cafb8c9f3ebac7ac6c01d9645bb67b6_cgraph.svg |   67 -
 ...8c9f3ebac7ac6c01d9645bb67b6_cgraph_org.svg |   41 -
 ...ef6940391f981ab86767775176b7169_cgraph.map |    6 -
 ...ef6940391f981ab86767775176b7169_cgraph.md5 |    1 -
 ...ef6940391f981ab86767775176b7169_cgraph.svg |   76 -
 ...40391f981ab86767775176b7169_cgraph_org.svg |   50 -
 ...fd24626ac47277431c9b8604e064340_cgraph.map |   15 -
 ...fd24626ac47277431c9b8604e064340_cgraph.md5 |    1 -
 ...fd24626ac47277431c9b8604e064340_cgraph.svg |  161 -
 ...626ac47277431c9b8604e064340_cgraph_org.svg |  135 -
 ...ca808362c13273ca8c8ae7d58e8eee0_cgraph.map |    5 -
 ...ca808362c13273ca8c8ae7d58e8eee0_cgraph.md5 |    1 -
 ...ca808362c13273ca8c8ae7d58e8eee0_cgraph.svg |   67 -
 ...8362c13273ca8c8ae7d58e8eee0_cgraph_org.svg |   41 -
 d0/d61/knapsack_8cpp_source.html              |  219 ++
 d0/d62/struct_queue-members.html              |   35 +-
 d0/d65/namespacedouble__hashing.html          |  332 +-
 ...e901418c759627557eff359b8db38cd_cgraph.map |    5 -
 ...e901418c759627557eff359b8db38cd_cgraph.md5 |    1 -
 ...e901418c759627557eff359b8db38cd_cgraph.svg |   65 -
 ...418c759627557eff359b8db38cd_cgraph_org.svg |   39 -
 ...8083ecac6eb94b643281875c8665931_cgraph.map |   16 -
 ...8083ecac6eb94b643281875c8665931_cgraph.md5 |    1 -
 ...8083ecac6eb94b643281875c8665931_cgraph.svg |  165 -
 ...ecac6eb94b643281875c8665931_cgraph_org.svg |  139 -
 ...d06e4598569526294f10104875f6824_cgraph.map |   23 -
 ...d06e4598569526294f10104875f6824_cgraph.md5 |    1 -
 ...d06e4598569526294f10104875f6824_cgraph.svg |  285 --
 ...4598569526294f10104875f6824_cgraph_org.svg |  202 --
 ...9a9c914a6c68275b3640303d7faad8a_cgraph.map |   19 -
 ...9a9c914a6c68275b3640303d7faad8a_cgraph.md5 |    1 -
 ...9a9c914a6c68275b3640303d7faad8a_cgraph.svg |  192 --
 ...914a6c68275b3640303d7faad8a_cgraph_org.svg |  166 -
 ...f8ff4fb018e1bb32d67d8a1885d3200_cgraph.map |   13 -
 ...f8ff4fb018e1bb32d67d8a1885d3200_cgraph.md5 |    1 -
 ...f8ff4fb018e1bb32d67d8a1885d3200_cgraph.svg |  138 -
 ...4fb018e1bb32d67d8a1885d3200_cgraph_org.svg |  112 -
 ...c652b2e467e5d250dfe3bed83b12560_cgraph.map |   26 -
 ...c652b2e467e5d250dfe3bed83b12560_cgraph.md5 |    1 -
 ...c652b2e467e5d250dfe3bed83b12560_cgraph.svg |  312 --
 ...b2e467e5d250dfe3bed83b12560_cgraph_org.svg |  229 --
 ...4981819aae8bc7e7beeaef02615e30d_cgraph.map |   19 -
 ...4981819aae8bc7e7beeaef02615e30d_cgraph.md5 |    1 -
 ...4981819aae8bc7e7beeaef02615e30d_cgraph.svg |  249 --
 ...819aae8bc7e7beeaef02615e30d_cgraph_org.svg |  166 -
 d0/d6d/modular__exponentiation_8cpp.html      |   75 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    7 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   83 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   57 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  101 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   75 -
 .../modular__exponentiation_8cpp_source.html  |  196 ++
 d0/d6f/namespaceothers.html                   |   46 +-
 ...ongest__palindromic__subsequence_8cpp.html |   65 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    7 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   83 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   57 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  101 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   75 -
 ..._palindromic__subsequence_8cpp_source.html |  215 ++
 ...tatistics_1_1stats__computer1-members.html |   35 +-
 ...everse__binary__tree_1_1_node-members.html |   35 +-
 .../number__of__positive__divisors_8cpp.html  |   76 +-
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.map |    5 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 |    1 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.svg |   66 -
 ...ad42717780d6caaff9d3d6977f9_cgraph_org.svg |   40 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   10 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  111 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   85 -
 ...r__of__positive__divisors_8cpp_source.html |  204 ++
 d0/da4/namespacemonte__carlo.html             |   35 +-
 d0/db6/non__recursive__merge__sort_8cpp.html  |   57 +-
 ...n__recursive__merge__sort_8cpp_source.html |  229 ++
 d0/dbc/namespacestrings_1_1boyer__moore.html  |  138 +-
 ...b165af1dc341289fd705be4c67728f8_cgraph.map |   14 -
 ...b165af1dc341289fd705be4c67728f8_cgraph.md5 |    1 -
 ...b165af1dc341289fd705be4c67728f8_cgraph.svg |  149 -
 ...af1dc341289fd705be4c67728f8_cgraph_org.svg |  123 -
 ...5703b553faed0d28202c10808cf9738_cgraph.map |   10 -
 ...5703b553faed0d28202c10808cf9738_cgraph.md5 |    1 -
 ...5703b553faed0d28202c10808cf9738_cgraph.svg |  111 -
 ...b553faed0d28202c10808cf9738_cgraph_org.svg |   85 -
 ...f6688c9bb3e692297a3aa09cebc1c00_cgraph.map |    7 -
 ...f6688c9bb3e692297a3aa09cebc1c00_cgraph.md5 |    1 -
 ...f6688c9bb3e692297a3aa09cebc1c00_cgraph.svg |   84 -
 ...8c9bb3e692297a3aa09cebc1c00_cgraph_org.svg |   58 -
 ...709cf7fca02b7d3e1888423d5f739a1_cgraph.map |    8 -
 ...709cf7fca02b7d3e1888423d5f739a1_cgraph.md5 |    1 -
 ...709cf7fca02b7d3e1888423d5f739a1_cgraph.svg |   93 -
 ...f7fca02b7d3e1888423d5f739a1_cgraph_org.svg |   67 -
 d0/dc4/struct_point-members.html              |   35 +-
 ...nge__queries_1_1fenwick__tree-members.html |   35 +-
 d0/dcb/classdsu-members.html                  |   35 +-
 d0/dd2/treap_8cpp.html                        |   85 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   34 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  395 ---
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  312 --
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   36 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  413 ---
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  330 --
 d0/dd2/treap_8cpp_source.html                 |  348 +++
 .../classciphers_1_1_hill_cipher-members.html |   35 +-
 d0/dd5/namespacebubble__sort.html             |   35 +-
 d0/dda/namespacesaddleback.html               |   35 +-
 d0/de2/gaussian__elimination_8cpp.html        |   79 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 d0/de2/gaussian__elimination_8cpp_source.html |  212 ++
 ...n__matrix__multiplication_8cpp_source.html |  530 ++++
 ...k__using__queue_1_1_stack__coll__graph.map |    8 +-
 ...k__using__queue_1_1_stack__coll__graph.md5 |    2 +-
 ...k__using__queue_1_1_stack__coll__graph.svg |   27 +-
 ...sing__queue_1_1_stack__coll__graph_org.svg |   27 +-
 d0/df8/namespaceabbreviation.html             |   35 +-
 ...__search_1_1_eight_puzzle__coll__graph.map |   16 +-
 ...__search_1_1_eight_puzzle__coll__graph.md5 |    2 +-
 ...__search_1_1_eight_puzzle__coll__graph.svg |  133 +-
 ...arch_1_1_eight_puzzle__coll__graph_org.svg |   72 +-
 d0/dff/structlinkedlist.html                  |   79 +-
 d1/d07/class_solution-members.html            |   35 +-
 d1/d11/gcd__of__n__numbers_8cpp.html          |  126 +-
 ...161713c662a14c2d5e33504f4324532_cgraph.map |   13 -
 ...161713c662a14c2d5e33504f4324532_cgraph.md5 |    1 -
 ...161713c662a14c2d5e33504f4324532_cgraph.svg |  139 -
 ...13c662a14c2d5e33504f4324532_cgraph_org.svg |  113 -
 ...09a35e11ed1e17a9e00dd56320a4181_cgraph.map |    4 -
 ...09a35e11ed1e17a9e00dd56320a4181_cgraph.md5 |    1 -
 ...09a35e11ed1e17a9e00dd56320a4181_cgraph.svg |   57 -
 ...5e11ed1e17a9e00dd56320a4181_cgraph_org.svg |   31 -
 ...1b9357c7a722f8208499d9ba573297a_cgraph.map |    6 -
 ...1b9357c7a722f8208499d9ba573297a_cgraph.md5 |    1 -
 ...1b9357c7a722f8208499d9ba573297a_cgraph.svg |   75 -
 ...57c7a722f8208499d9ba573297a_cgraph_org.svg |   49 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 d1/d11/gcd__of__n__numbers_8cpp_source.html   |  223 ++
 d1/d12/tree_8cpp_source.html                  |  259 ++
 ...s_1_1linked__list_1_1list__coll__graph.map |    2 +-
 ...s_1_1linked__list_1_1list__coll__graph.md5 |    2 +-
 ...s_1_1linked__list_1_1list__coll__graph.svg |    2 +-
 ...1linked__list_1_1list__coll__graph_org.svg |    2 +-
 ...al__sort__by__kahns__algo_8cpp_source.html |  207 ++
 d1/d1c/base64__encoding_8cpp_source.html      |  289 ++
 d1/d1d/class_graph-members.html               |   35 +-
 ...1_1trie__operations_1_1_tnode-members.html |   35 +-
 d1/d21/quick__sort_8cpp.html                  |  222 +-
 ...b2a2cc2d319240f3b65c5b2f479ed82_cgraph.map |    5 -
 ...b2a2cc2d319240f3b65c5b2f479ed82_cgraph.md5 |    1 -
 ...b2a2cc2d319240f3b65c5b2f479ed82_cgraph.svg |   66 -
 ...cc2d319240f3b65c5b2f479ed82_cgraph_org.svg |   40 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |   13 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |  137 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |  111 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   19 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  191 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  165 -
 d1/d21/quick__sort_8cpp_source.html           |  311 ++
 d1/d2a/knight__tour_8cpp.html                 |   91 +-
 ...a47356d98676cf5315d978f741e29c9_cgraph.map |    6 -
 ...a47356d98676cf5315d978f741e29c9_cgraph.md5 |    1 -
 ...a47356d98676cf5315d978f741e29c9_cgraph.svg |   75 -
 ...56d98676cf5315d978f741e29c9_cgraph_org.svg |   49 -
 ...27031fbff093ffd625f64010d98aab2_cgraph.map |    4 -
 ...27031fbff093ffd625f64010d98aab2_cgraph.md5 |    1 -
 ...27031fbff093ffd625f64010d98aab2_cgraph.svg |   57 -
 ...1fbff093ffd625f64010d98aab2_cgraph_org.svg |   31 -
 d1/d2a/knight__tour_8cpp_source.html          |  217 ++
 ...ers_1_1_cache_1_1_l_r_u_cache-members.html |   35 +-
 d1/d35/namespaceexponential__dist.html        |   35 +-
 d1/d40/counting__sort_8cpp_source.html        |  202 ++
 ...d__median_1_1_windowed_median-members.html |   35 +-
 ...1heavy__light__decomposition_1_1_tree.html |  464 ++-
 ...4cd96efaba147b19d3afc769b90ff70_cgraph.map |    5 -
 ...4cd96efaba147b19d3afc769b90ff70_cgraph.md5 |    1 -
 ...4cd96efaba147b19d3afc769b90ff70_cgraph.svg |   67 -
 ...6efaba147b19d3afc769b90ff70_cgraph_org.svg |   41 -
 ...9ab4601c4a95c0902ac04e779e5f54d_cgraph.map |    5 -
 ...9ab4601c4a95c0902ac04e779e5f54d_cgraph.md5 |    1 -
 ...9ab4601c4a95c0902ac04e779e5f54d_cgraph.svg |   67 -
 ...601c4a95c0902ac04e779e5f54d_cgraph_org.svg |   41 -
 ...35fb2bbb27307b8cacad9b287968bc1_cgraph.map |    7 -
 ...35fb2bbb27307b8cacad9b287968bc1_cgraph.md5 |    1 -
 ...35fb2bbb27307b8cacad9b287968bc1_cgraph.svg |   85 -
 ...2bbb27307b8cacad9b287968bc1_cgraph_org.svg |   59 -
 ...f7bca1746d40f21ad832fcea59aa6c6_cgraph.map |    5 -
 ...f7bca1746d40f21ad832fcea59aa6c6_cgraph.md5 |    1 -
 ...f7bca1746d40f21ad832fcea59aa6c6_cgraph.svg |   69 -
 ...a1746d40f21ad832fcea59aa6c6_cgraph_org.svg |   43 -
 ...339c31ec74cd86a4842a8b09653d460_cgraph.map |    4 -
 ...339c31ec74cd86a4842a8b09653d460_cgraph.md5 |    1 -
 ...339c31ec74cd86a4842a8b09653d460_cgraph.svg |   58 -
 ...31ec74cd86a4842a8b09653d460_cgraph_org.svg |   32 -
 ...22d760a5a33545a70e7ea5e1786c8dc_cgraph.map |    9 -
 ...22d760a5a33545a70e7ea5e1786c8dc_cgraph.md5 |    1 -
 ...22d760a5a33545a70e7ea5e1786c8dc_cgraph.svg |  107 -
 ...60a5a33545a70e7ea5e1786c8dc_cgraph_org.svg |   81 -
 ...2b407e64aaf9878fbee7ee6efe9c7d4_cgraph.map |    5 -
 ...2b407e64aaf9878fbee7ee6efe9c7d4_cgraph.md5 |    1 -
 ...2b407e64aaf9878fbee7ee6efe9c7d4_cgraph.svg |   69 -
 ...7e64aaf9878fbee7ee6efe9c7d4_cgraph_org.svg |   43 -
 ...8de7aefcb6635d3dacdd174cd4890c4_cgraph.map |    4 -
 ...8de7aefcb6635d3dacdd174cd4890c4_cgraph.md5 |    1 -
 ...8de7aefcb6635d3dacdd174cd4890c4_cgraph.svg |   58 -
 ...aefcb6635d3dacdd174cd4890c4_cgraph_org.svg |   32 -
 ...ic_3_01uint256__t_01_4__inherit__graph.map |    2 +-
 ...ic_3_01uint256__t_01_4__inherit__graph.md5 |    2 +-
 ...ic_3_01uint256__t_01_4__inherit__graph.svg |    2 +-
 ..._01uint256__t_01_4__inherit__graph_org.svg |    2 +-
 d1/d64/namespaceinterpolation__search.html    |   35 +-
 d1/d64/namespacemodular__division.html        |   35 +-
 ...ht__decomposition_1_1_s_g__coll__graph.map |    2 +-
 ...ht__decomposition_1_1_s_g__coll__graph.md5 |    2 +-
 ...ht__decomposition_1_1_s_g__coll__graph.svg |    2 +-
 ...decomposition_1_1_s_g__coll__graph_org.svg |    2 +-
 d1/d70/cll_8cpp_source.html                   |  250 ++
 ..._1_lowest_common_ancestor__coll__graph.map |    6 +-
 ..._1_lowest_common_ancestor__coll__graph.md5 |    2 +-
 ..._1_lowest_common_ancestor__coll__graph.svg |    6 +-
 ...owest_common_ancestor__coll__graph_org.svg |    6 +-
 d1/d76/buzz__number_8cpp.html                 |   61 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 d1/d76/buzz__number_8cpp_source.html          |  155 +
 d1/d77/structmst.html                         |   98 +-
 d1/d7c/fibonacci__bottom__up_8cpp_source.html |  160 +
 d1/d83/classuint256__t.html                   |  338 +-
 ...33d66c965e8d1fbc5bafb59ad60e163_cgraph.map |    5 -
 ...33d66c965e8d1fbc5bafb59ad60e163_cgraph.md5 |    1 -
 ...33d66c965e8d1fbc5bafb59ad60e163_cgraph.svg |   65 -
 ...6c965e8d1fbc5bafb59ad60e163_cgraph_org.svg |   39 -
 ...fa3d95584d071add9b46597d3747b39_cgraph.map |    7 -
 ...fa3d95584d071add9b46597d3747b39_cgraph.md5 |    1 -
 ...fa3d95584d071add9b46597d3747b39_cgraph.svg |   84 -
 ...95584d071add9b46597d3747b39_cgraph_org.svg |   58 -
 ...cd43a4a92dc825a010a17578b3bdedb_cgraph.map |    9 -
 ...cd43a4a92dc825a010a17578b3bdedb_cgraph.md5 |    1 -
 ...cd43a4a92dc825a010a17578b3bdedb_cgraph.svg |  101 -
 ...a4a92dc825a010a17578b3bdedb_cgraph_org.svg |   75 -
 ...645040fe68ff01d83400f173fd2bb21_cgraph.map |    7 -
 ...645040fe68ff01d83400f173fd2bb21_cgraph.md5 |    1 -
 ...645040fe68ff01d83400f173fd2bb21_cgraph.svg |   83 -
 ...40fe68ff01d83400f173fd2bb21_cgraph_org.svg |   57 -
 ...fdeb4d4bf8cca4ee99b8487e59831df_cgraph.map |    9 -
 ...fdeb4d4bf8cca4ee99b8487e59831df_cgraph.md5 |    1 -
 ...fdeb4d4bf8cca4ee99b8487e59831df_cgraph.svg |  101 -
 ...4d4bf8cca4ee99b8487e59831df_cgraph_org.svg |   75 -
 ...161d52d369e525f4e61129376adfcf1_cgraph.map |    7 -
 ...161d52d369e525f4e61129376adfcf1_cgraph.md5 |    1 -
 ...161d52d369e525f4e61129376adfcf1_cgraph.svg |   83 -
 ...52d369e525f4e61129376adfcf1_cgraph_org.svg |   57 -
 ...6aab081bb7db2771e4a4f30c3eed8e2_cgraph.map |    7 -
 ...6aab081bb7db2771e4a4f30c3eed8e2_cgraph.md5 |    1 -
 ...6aab081bb7db2771e4a4f30c3eed8e2_cgraph.svg |   84 -
 ...081bb7db2771e4a4f30c3eed8e2_cgraph_org.svg |   58 -
 ...ddd133cee83f3a2ab6ed60a7ccbc250_cgraph.map |    5 -
 ...ddd133cee83f3a2ab6ed60a7ccbc250_cgraph.md5 |    1 -
 ...ddd133cee83f3a2ab6ed60a7ccbc250_cgraph.svg |   65 -
 ...33cee83f3a2ab6ed60a7ccbc250_cgraph_org.svg |   39 -
 ...9e585b186e71d7cbe9c1d7387c38967_cgraph.map |    7 -
 ...9e585b186e71d7cbe9c1d7387c38967_cgraph.md5 |    1 -
 ...9e585b186e71d7cbe9c1d7387c38967_cgraph.svg |   83 -
 ...5b186e71d7cbe9c1d7387c38967_cgraph_org.svg |   57 -
 ...1b36e64de42f3622e7d6ec5efa273d4_cgraph.map |    9 -
 ...1b36e64de42f3622e7d6ec5efa273d4_cgraph.md5 |    1 -
 ...1b36e64de42f3622e7d6ec5efa273d4_cgraph.svg |  101 -
 ...e64de42f3622e7d6ec5efa273d4_cgraph_org.svg |   75 -
 ...4928175eaaaa2b559bc945affe63ad2_cgraph.map |    9 -
 ...4928175eaaaa2b559bc945affe63ad2_cgraph.md5 |    1 -
 ...4928175eaaaa2b559bc945affe63ad2_cgraph.svg |  101 -
 ...175eaaaa2b559bc945affe63ad2_cgraph_org.svg |   75 -
 ...ee82fa5052e9d8c946b9205b943cec4_cgraph.map |    5 -
 ...ee82fa5052e9d8c946b9205b943cec4_cgraph.md5 |    1 -
 ...ee82fa5052e9d8c946b9205b943cec4_cgraph.svg |   66 -
 ...fa5052e9d8c946b9205b943cec4_cgraph_org.svg |   40 -
 ...classdata__structures_1_1trie-members.html |   35 +-
 d1/d9a/hopcroft__karp_8cpp.html               |   73 +-
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.map |   17 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 |    1 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.svg |  174 --
 ...ad42717780d6caaff9d3d6977f9_cgraph_org.svg |  148 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   19 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  249 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  166 -
 d1/d9a/hopcroft__karp_8cpp_source.html        |  403 +++
 d1/d9e/prefix__sum__array_8cpp.html           |   97 +-
 ...36151479ad37d53ef9fcb60a274b1d9_cgraph.map |    8 -
 ...36151479ad37d53ef9fcb60a274b1d9_cgraph.md5 |    1 -
 ...36151479ad37d53ef9fcb60a274b1d9_cgraph.svg |   93 -
 ...1479ad37d53ef9fcb60a274b1d9_cgraph_org.svg |   67 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 d1/d9e/prefix__sum__array_8cpp_source.html    |  188 ++
 d1/da6/rungekutta_8cpp.html                   |   91 +-
 ...b9f40c7b5e9749cc550f19be3dc8856_cgraph.map |    8 -
 ...b9f40c7b5e9749cc550f19be3dc8856_cgraph.md5 |    1 -
 ...b9f40c7b5e9749cc550f19be3dc8856_cgraph.svg |   93 -
 ...0c7b5e9749cc550f19be3dc8856_cgraph_org.svg |   67 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 d1/da6/rungekutta_8cpp_source.html            |  228 ++
 d1/da7/armstrong__number__templated_8cpp.html |   66 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |    7 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |   84 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   58 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  102 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   76 -
 ...strong__number__templated_8cpp_source.html |  202 ++
 d1/daa/random__pivot__quick__sort_8cpp.html   |  192 +-
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.map |   27 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 |    1 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg |  320 --
 ...224851353fc92bfbff6f499fa97_cgraph_org.svg |  237 --
 ...d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph.map |    7 -
 ...d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph.md5 |    1 -
 ...d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph.svg |   84 -
 ...9e1ff42c04fb8ec0c0b9411cd3e_cgraph_org.svg |   58 -
 ...0675d2eb960c71ca31ec475ba90120d_cgraph.map |    4 -
 ...0675d2eb960c71ca31ec475ba90120d_cgraph.md5 |    1 -
 ...0675d2eb960c71ca31ec475ba90120d_cgraph.svg |   58 -
 ...d2eb960c71ca31ec475ba90120d_cgraph_org.svg |   32 -
 ...d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph.map |   13 -
 ...d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph.md5 |    1 -
 ...d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph.svg |  139 -
 ...465e7b5d54c2de6d5e9db1ea6a5_cgraph_org.svg |  113 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   22 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  275 --
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  192 --
 ...c5657b4fe2251cd21073f44233f6ea5_cgraph.map |    4 -
 ...c5657b4fe2251cd21073f44233f6ea5_cgraph.md5 |    1 -
 ...c5657b4fe2251cd21073f44233f6ea5_cgraph.svg |   57 -
 ...7b4fe2251cd21073f44233f6ea5_cgraph_org.svg |   31 -
 ...3281dc34a9cfd7beb332419b8a0aa10_cgraph.map |    8 -
 ...3281dc34a9cfd7beb332419b8a0aa10_cgraph.md5 |    1 -
 ...3281dc34a9cfd7beb332419b8a0aa10_cgraph.svg |   93 -
 ...dc34a9cfd7beb332419b8a0aa10_cgraph_org.svg |   67 -
 ...andom__pivot__quick__sort_8cpp_source.html |  388 +++
 ...egral_3_01uint128__t_01_4__coll__graph.map |    2 +-
 ...egral_3_01uint128__t_01_4__coll__graph.md5 |    2 +-
 ...egral_3_01uint128__t_01_4__coll__graph.svg |    2 +-
 ...l_3_01uint128__t_01_4__coll__graph_org.svg |    2 +-
 d1/db3/structcompare.html                     |   46 +-
 d1/db6/namespaceknight__tour.html             |   35 +-
 ...1_1_cache_1_1_l_r_u_cache__coll__graph.map |   18 +-
 ...1_1_cache_1_1_l_r_u_cache__coll__graph.md5 |    2 +-
 ...1_1_cache_1_1_l_r_u_cache__coll__graph.svg |  103 +-
 ...cache_1_1_l_r_u_cache__coll__graph_org.svg |  105 +-
 d1/dbb/n__choose__r_8cpp.html                 |   73 +-
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.map |    9 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 |    1 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg |  101 -
 ...224851353fc92bfbff6f499fa97_cgraph_org.svg |   75 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    7 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   83 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   57 -
 d1/dbb/n__choose__r_8cpp_source.html          |  192 ++
 d1/dbe/lu__decomposition_8h.html              |   84 +-
 ...108d43bd32c6fb3b3c158476c51ba7f_cgraph.map |    8 -
 ...108d43bd32c6fb3b3c158476c51ba7f_cgraph.md5 |    1 -
 ...108d43bd32c6fb3b3c158476c51ba7f_cgraph.svg |   92 -
 ...43bd32c6fb3b3c158476c51ba7f_cgraph_org.svg |   66 -
 ...5b8a228c6419ecda6077255d6d60509_cgraph.map |    5 -
 ...5b8a228c6419ecda6077255d6d60509_cgraph.md5 |    1 -
 ...5b8a228c6419ecda6077255d6d60509_cgraph.svg |   65 -
 ...228c6419ecda6077255d6d60509_cgraph_org.svg |   39 -
 d1/dbe/lu__decomposition_8h_source.html       |   93 +-
 ...__traversal__of__bst_1_1_node-members.html |   35 +-
 d1/dc2/class_graph__coll__graph.map           |   18 +-
 d1/dc2/class_graph__coll__graph.md5           |    2 +-
 d1/dc2/class_graph__coll__graph.svg           |   42 +-
 d1/dc2/class_graph__coll__graph_org.svg       |   42 +-
 d1/dc2/classstack.html                        |  169 +-
 ...bce109630118a34faae717f72986033_cgraph.map |    7 -
 ...bce109630118a34faae717f72986033_cgraph.md5 |    1 -
 ...bce109630118a34faae717f72986033_cgraph.svg |   83 -
 ...09630118a34faae717f72986033_cgraph_org.svg |   57 -
 ...0df277532c23519aa7ac3c08ed90a1d_cgraph.map |    5 -
 ...0df277532c23519aa7ac3c08ed90a1d_cgraph.md5 |    1 -
 ...0df277532c23519aa7ac3c08ed90a1d_cgraph.svg |   65 -
 ...77532c23519aa7ac3c08ed90a1d_cgraph_org.svg |   39 -
 d1/dc5/classlarge__number__coll__graph.map    |    2 +-
 d1/dc5/classlarge__number__coll__graph.md5    |    2 +-
 d1/dc5/classlarge__number__coll__graph.svg    |    2 +-
 .../classlarge__number__coll__graph_org.svg   |    2 +-
 d1/dc7/linear__probing__hash__table_8cpp.html |  136 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  429 ---
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  346 ---
 ...ear__probing__hash__table_8cpp_source.html |  395 +++
 d1/dcc/wiggle__sort_8cpp.html                 |   71 +-
 ...9eeded693ac073717282fae365957a1_cgraph.map |    8 -
 ...9eeded693ac073717282fae365957a1_cgraph.md5 |    1 -
 ...9eeded693ac073717282fae365957a1_cgraph.svg |   93 -
 ...ed693ac073717282fae365957a1_cgraph_org.svg |   67 -
 d1/dcc/wiggle__sort_8cpp_source.html          |  227 ++
 ...hashmap_1_1_trie_1_1_node__coll__graph.map |    4 +-
 ...hashmap_1_1_trie_1_1_node__coll__graph.md5 |    2 +-
 ...hashmap_1_1_trie_1_1_node__coll__graph.svg |    4 +-
 ...map_1_1_trie_1_1_node__coll__graph_org.svg |    4 +-
 d1/de0/namespacenumerical__methods.html       |  182 +-
 ...58fd271b9a53e8f3f60b08b18857150_cgraph.map |    4 -
 ...58fd271b9a53e8f3f60b08b18857150_cgraph.md5 |    1 -
 ...58fd271b9a53e8f3f60b08b18857150_cgraph.svg |   57 -
 ...271b9a53e8f3f60b08b18857150_cgraph_org.svg |   31 -
 ...8e67885f8606564cc8335f483f63309_cgraph.map |    7 -
 ...8e67885f8606564cc8335f483f63309_cgraph.md5 |    1 -
 ...8e67885f8606564cc8335f483f63309_cgraph.svg |   84 -
 ...885f8606564cc8335f483f63309_cgraph_org.svg |   58 -
 ...e56dc85997b8cd42bad71a5d6bd2d93_cgraph.map |    8 -
 ...e56dc85997b8cd42bad71a5d6bd2d93_cgraph.md5 |    1 -
 ...e56dc85997b8cd42bad71a5d6bd2d93_cgraph.svg |   93 -
 ...c85997b8cd42bad71a5d6bd2d93_cgraph_org.svg |   67 -
 ...etry_1_1jarvis_1_1_convexhull-members.html |   35 +-
 d1/de9/integral__approximation_8cpp.html      |  140 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 .../integral__approximation_8cpp_source.html  |  239 ++
 ...ng__hashmap_1_1_trie_1_1_node-members.html |   35 +-
 d1/ded/windowed__median_8cpp.html             |  171 +-
 ...dc652a36ea42ba262c4e4236e3e6601_cgraph.map |   35 -
 ...dc652a36ea42ba262c4e4236e3e6601_cgraph.md5 |    1 -
 ...dc652a36ea42ba262c4e4236e3e6601_cgraph.svg |  402 ---
 ...2a36ea42ba262c4e4236e3e6601_cgraph_org.svg |  319 --
 ...0f2228420376f4db7e1274f2b41667c_cgraph.map |   26 -
 ...0f2228420376f4db7e1274f2b41667c_cgraph.md5 |    1 -
 ...0f2228420376f4db7e1274f2b41667c_cgraph.svg |  313 --
 ...28420376f4db7e1274f2b41667c_cgraph_org.svg |  230 --
 d1/ded/windowed__median_8cpp_source.html      |  299 ++
 ...a__structures_1_1linked__list_1_1list.html |  277 +-
 ...09b19ac8cca40f2e4daa2e5989fa4f3_cgraph.map |    7 -
 ...09b19ac8cca40f2e4daa2e5989fa4f3_cgraph.md5 |    1 -
 ...09b19ac8cca40f2e4daa2e5989fa4f3_cgraph.svg |   85 -
 ...9ac8cca40f2e4daa2e5989fa4f3_cgraph_org.svg |   59 -
 ...313837c0e9ec67fd9fbd17987e2d615_cgraph.map |    5 -
 ...313837c0e9ec67fd9fbd17987e2d615_cgraph.md5 |    1 -
 ...313837c0e9ec67fd9fbd17987e2d615_cgraph.svg |   67 -
 ...37c0e9ec67fd9fbd17987e2d615_cgraph_org.svg |   41 -
 ...32b965afd9d6bea8d3246673acd52c7_cgraph.map |    7 -
 ...32b965afd9d6bea8d3246673acd52c7_cgraph.md5 |    1 -
 ...32b965afd9d6bea8d3246673acd52c7_cgraph.svg |   85 -
 ...65afd9d6bea8d3246673acd52c7_cgraph_org.svg |   59 -
 ...0e209b55b83622254177050945e7826_cgraph.map |    5 -
 ...0e209b55b83622254177050945e7826_cgraph.md5 |    1 -
 ...0e209b55b83622254177050945e7826_cgraph.svg |   66 -
 ...9b55b83622254177050945e7826_cgraph_org.svg |   40 -
 ...e9859d1a0755fb51e41904d20c95496_cgraph.map |    7 -
 ...e9859d1a0755fb51e41904d20c95496_cgraph.md5 |    1 -
 ...e9859d1a0755fb51e41904d20c95496_cgraph.svg |   85 -
 ...9d1a0755fb51e41904d20c95496_cgraph_org.svg |   59 -
 ...785d1478e59f5a90288b2928a7094d6_cgraph.map |    5 -
 ...785d1478e59f5a90288b2928a7094d6_cgraph.md5 |    1 -
 ...785d1478e59f5a90288b2928a7094d6_cgraph.svg |   67 -
 ...1478e59f5a90288b2928a7094d6_cgraph_org.svg |   41 -
 ...69707af46eb6d410eb3a54ee58e1ed1_cgraph.map |    7 -
 ...69707af46eb6d410eb3a54ee58e1ed1_cgraph.md5 |    1 -
 ...69707af46eb6d410eb3a54ee58e1ed1_cgraph.svg |   85 -
 ...7af46eb6d410eb3a54ee58e1ed1_cgraph_org.svg |   59 -
 ...3423f7518671351340932db3c24959a_cgraph.map |    5 -
 ...3423f7518671351340932db3c24959a_cgraph.md5 |    1 -
 ...3423f7518671351340932db3c24959a_cgraph.svg |   67 -
 ...f7518671351340932db3c24959a_cgraph_org.svg |   41 -
 ...b04f732911fcfd30f7177b367c6af41_cgraph.map |    5 -
 ...b04f732911fcfd30f7177b367c6af41_cgraph.md5 |    1 -
 ...b04f732911fcfd30f7177b367c6af41_cgraph.svg |   67 -
 ...732911fcfd30f7177b367c6af41_cgraph_org.svg |   41 -
 d1/df2/structnode-members.html                |   35 +-
 d1/df3/hash__search_8cpp.html                 |  190 +-
 ...6ea13c16028f18ef2d5ff47f3fda7a2_cgraph.map |    5 -
 ...6ea13c16028f18ef2d5ff47f3fda7a2_cgraph.md5 |    1 -
 ...6ea13c16028f18ef2d5ff47f3fda7a2_cgraph.svg |   65 -
 ...3c16028f18ef2d5ff47f3fda7a2_cgraph_org.svg |   39 -
 ...0831425f1389166a9518f422d0c6ec5_cgraph.map |    5 -
 ...0831425f1389166a9518f422d0c6ec5_cgraph.md5 |    1 -
 ...0831425f1389166a9518f422d0c6ec5_cgraph.svg |   65 -
 ...425f1389166a9518f422d0c6ec5_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   12 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  128 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  102 -
 d1/df3/hash__search_8cpp_source.html          |  259 ++
 ..._1_1generate__parentheses__coll__graph.map |    6 +-
 ..._1_1generate__parentheses__coll__graph.md5 |    2 +-
 ..._1_1generate__parentheses__coll__graph.svg |    6 +-
 ...generate__parentheses__coll__graph_org.svg |    6 +-
 d1/df6/class_easter_year_month_day.html       |  117 +-
 d2/d05/class_min_heap.html                    |  220 +-
 ...7ac126eabb0c3ce04047172abccca29_cgraph.map |   17 -
 ...7ac126eabb0c3ce04047172abccca29_cgraph.md5 |    1 -
 ...7ac126eabb0c3ce04047172abccca29_cgraph.svg |  230 --
 ...26eabb0c3ce04047172abccca29_cgraph_org.svg |  147 -
 ...014f1edaed0bd7db0c0d2ca53228980_cgraph.map |   12 -
 ...014f1edaed0bd7db0c0d2ca53228980_cgraph.md5 |    1 -
 ...014f1edaed0bd7db0c0d2ca53228980_cgraph.svg |  128 -
 ...1edaed0bd7db0c0d2ca53228980_cgraph_org.svg |  102 -
 ...7f726cc6327955d22871592227432f5_cgraph.map |    5 -
 ...7f726cc6327955d22871592227432f5_cgraph.md5 |    1 -
 ...7f726cc6327955d22871592227432f5_cgraph.svg |   65 -
 ...6cc6327955d22871592227432f5_cgraph_org.svg |   39 -
 ...ef438c1056492cb62c4a4d9035b5cad_cgraph.map |   10 -
 ...ef438c1056492cb62c4a4d9035b5cad_cgraph.md5 |    1 -
 ...ef438c1056492cb62c4a4d9035b5cad_cgraph.svg |  110 -
 ...8c1056492cb62c4a4d9035b5cad_cgraph_org.svg |   84 -
 ...f78f3384f5a0ae880ad0883d2d44b82_cgraph.map |    5 -
 ...f78f3384f5a0ae880ad0883d2d44b82_cgraph.md5 |    1 -
 ...f78f3384f5a0ae880ad0883d2d44b82_cgraph.svg |   65 -
 ...3384f5a0ae880ad0883d2d44b82_cgraph_org.svg |   39 -
 d2/d0b/fast__power_8cpp.html                  |  110 +-
 ...d4e3f0099a6975b74a314a35bd0f94d_cgraph.map |    4 -
 ...d4e3f0099a6975b74a314a35bd0f94d_cgraph.md5 |    1 -
 ...d4e3f0099a6975b74a314a35bd0f94d_cgraph.svg |   56 -
 ...f0099a6975b74a314a35bd0f94d_cgraph_org.svg |   30 -
 ...399b847626e5bba983cab7c7918b445_cgraph.map |    4 -
 ...399b847626e5bba983cab7c7918b445_cgraph.md5 |    1 -
 ...399b847626e5bba983cab7c7918b445_cgraph.svg |   56 -
 ...847626e5bba983cab7c7918b445_cgraph_org.svg |   30 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   21 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  210 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  184 --
 d2/d0b/fast__power_8cpp_source.html           |  216 ++
 d2/d21/gnome__sort_8cpp.html                  |  115 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   19 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  191 --
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  165 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   21 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  209 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  183 --
 d2/d21/gnome__sort_8cpp_source.html           |  242 ++
 d2/d22/jump__search_8cpp.html                 |   76 +-
 ...49fd8f401bfc71f63b74711390cccf0_cgraph.map |    7 -
 ...49fd8f401bfc71f63b74711390cccf0_cgraph.md5 |    1 -
 ...49fd8f401bfc71f63b74711390cccf0_cgraph.svg |   83 -
 ...8f401bfc71f63b74711390cccf0_cgraph_org.svg |   57 -
 d2/d22/jump__search_8cpp_source.html          |  190 ++
 d2/d26/count__inversions_8cpp.html            |  144 +-
 ...332498eabf6579ef059c0d0e9f4ec80_cgraph.map |   13 -
 ...332498eabf6579ef059c0d0e9f4ec80_cgraph.md5 |    1 -
 ...332498eabf6579ef059c0d0e9f4ec80_cgraph.svg |  139 -
 ...98eabf6579ef059c0d0e9f4ec80_cgraph_org.svg |  113 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    7 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   83 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   57 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  101 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   75 -
 ...97a486e14101c4822ea8dc47f0d1661_cgraph.map |    4 -
 ...97a486e14101c4822ea8dc47f0d1661_cgraph.md5 |    1 -
 ...97a486e14101c4822ea8dc47f0d1661_cgraph.svg |   57 -
 ...86e14101c4822ea8dc47f0d1661_cgraph_org.svg |   31 -
 d2/d26/count__inversions_8cpp_source.html     |  316 ++
 d2/d2c/structtower.html                       |   88 +-
 ...mespacegreedy__algorithms_1_1dijkstra.html |   72 +-
 ...915876d0ca33cc71a6a6191a8cd3ccd_cgraph.map |    7 -
 ...915876d0ca33cc71a6a6191a8cd3ccd_cgraph.md5 |    1 -
 ...915876d0ca33cc71a6a6191a8cd3ccd_cgraph.svg |   86 -
 ...76d0ca33cc71a6a6191a8cd3ccd_cgraph_org.svg |   60 -
 ...tgeometry_1_1jarvis_1_1_point-members.html |   35 +-
 d2/d3b/namespaceqr__algorithm.html            |  223 +-
 ...57425cb2365359da51c6fe6741834d8_cgraph.map |   11 -
 ...57425cb2365359da51c6fe6741834d8_cgraph.md5 |    1 -
 ...57425cb2365359da51c6fe6741834d8_cgraph.svg |  119 -
 ...5cb2365359da51c6fe6741834d8_cgraph_org.svg |   93 -
 ...8e2fa3e803abaea6c568dc45d69d8cc_cgraph.map |   16 -
 ...8e2fa3e803abaea6c568dc45d69d8cc_cgraph.md5 |    1 -
 ...8e2fa3e803abaea6c568dc45d69d8cc_cgraph.svg |  222 --
 ...a3e803abaea6c568dc45d69d8cc_cgraph_org.svg |  139 -
 ...d3c7dce1f142141f509d09f6c0e25dc_cgraph.map |    5 -
 ...d3c7dce1f142141f509d09f6c0e25dc_cgraph.md5 |    1 -
 ...d3c7dce1f142141f509d09f6c0e25dc_cgraph.svg |   65 -
 ...dce1f142141f509d09f6c0e25dc_cgraph_org.svg |   39 -
 ...3ce637634fc49e1d10d190eb388ebf1_cgraph.map |   12 -
 ...3ce637634fc49e1d10d190eb388ebf1_cgraph.md5 |    1 -
 ...3ce637634fc49e1d10d190eb388ebf1_cgraph.svg |  128 -
 ...37634fc49e1d10d190eb388ebf1_cgraph_org.svg |  102 -
 ...16da2183db22378435042f26af43d5f_cgraph.map |    7 -
 ...16da2183db22378435042f26af43d5f_cgraph.md5 |    1 -
 ...16da2183db22378435042f26af43d5f_cgraph.svg |   83 -
 ...2183db22378435042f26af43d5f_cgraph_org.svg |   57 -
 ...fbdf47277c8cfee229b05b72f1f7834_cgraph.map |   13 -
 ...fbdf47277c8cfee229b05b72f1f7834_cgraph.md5 |    1 -
 ...fbdf47277c8cfee229b05b72f1f7834_cgraph.svg |  137 -
 ...47277c8cfee229b05b72f1f7834_cgraph_org.svg |  111 -
 d2/d45/segtree_8cpp.html                      |  162 +-
 ...23a97ea0c7ea6e33b5844a6858d902d_cgraph.map |    4 -
 ...23a97ea0c7ea6e33b5844a6858d902d_cgraph.md5 |    1 -
 ...23a97ea0c7ea6e33b5844a6858d902d_cgraph.svg |   56 -
 ...7ea0c7ea6e33b5844a6858d902d_cgraph_org.svg |   30 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   12 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  128 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  102 -
 ...d3e818681fb2e29cf08f4f60f82c8e0_cgraph.map |    4 -
 ...d3e818681fb2e29cf08f4f60f82c8e0_cgraph.md5 |    1 -
 ...d3e818681fb2e29cf08f4f60f82c8e0_cgraph.svg |   56 -
 ...18681fb2e29cf08f4f60f82c8e0_cgraph_org.svg |   30 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   17 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  173 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  147 -
 ...752659b7c1719d68fdb2ca538a93696_cgraph.map |    4 -
 ...752659b7c1719d68fdb2ca538a93696_cgraph.md5 |    1 -
 ...752659b7c1719d68fdb2ca538a93696_cgraph.svg |   56 -
 ...59b7c1719d68fdb2ca538a93696_cgraph_org.svg |   30 -
 d2/d45/segtree_8cpp_source.html               |  306 ++
 ...__and__edmond__karp__algo_8cpp_source.html |  258 ++
 d2/d52/heap__sort_8cpp.html                   |   85 +-
 ...1a3968e7947464bee7714f6d43b7002_cgraph.map |   11 -
 ...1a3968e7947464bee7714f6d43b7002_cgraph.md5 |    1 -
 ...1a3968e7947464bee7714f6d43b7002_cgraph.svg |  119 -
 ...68e7947464bee7714f6d43b7002_cgraph_org.svg |   93 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   13 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  137 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  111 -
 d2/d52/heap__sort_8cpp_source.html            |  213 ++
 d2/d58/neural__network_8cpp.html              |  145 +-
 ...3aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.map |    6 -
 ...3aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.md5 |    1 -
 ...3aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.svg |   76 -
 ...d32bcbcd65cfc85f0a41e2afadc_cgraph_org.svg |   50 -
 ...a5e874b9774aa5362dbcf288828b95c_cgraph.map |    4 -
 ...a5e874b9774aa5362dbcf288828b95c_cgraph.md5 |    1 -
 ...a5e874b9774aa5362dbcf288828b95c_cgraph.svg |   57 -
 ...74b9774aa5362dbcf288828b95c_cgraph_org.svg |   31 -
 ...2c00da08f2cf641dd336270f6e3c407_cgraph.map |    4 -
 ...2c00da08f2cf641dd336270f6e3c407_cgraph.md5 |    1 -
 ...2c00da08f2cf641dd336270f6e3c407_cgraph.svg |   58 -
 ...da08f2cf641dd336270f6e3c407_cgraph_org.svg |   32 -
 ...71aa7dd5d5add0143d1756bb0a1b32f_cgraph.map |    5 -
 ...71aa7dd5d5add0143d1756bb0a1b32f_cgraph.md5 |    1 -
 ...71aa7dd5d5add0143d1756bb0a1b32f_cgraph.svg |   66 -
 ...7dd5d5add0143d1756bb0a1b32f_cgraph_org.svg |   40 -
 ...5d3e30406712ada3d9713ece3c1b153_cgraph.map |    4 -
 ...5d3e30406712ada3d9713ece3c1b153_cgraph.md5 |    1 -
 ...5d3e30406712ada3d9713ece3c1b153_cgraph.svg |   58 -
 ...30406712ada3d9713ece3c1b153_cgraph_org.svg |   32 -
 ...6eb66212d577f948a457b6e29d87c46_cgraph.map |    4 -
 ...6eb66212d577f948a457b6e29d87c46_cgraph.md5 |    1 -
 ...6eb66212d577f948a457b6e29d87c46_cgraph.svg |   58 -
 ...6212d577f948a457b6e29d87c46_cgraph_org.svg |   32 -
 ...69e95a34054d7989bf446f96b2ffaf9_cgraph.map |    4 -
 ...69e95a34054d7989bf446f96b2ffaf9_cgraph.md5 |    1 -
 ...69e95a34054d7989bf446f96b2ffaf9_cgraph.svg |   57 -
 ...5a34054d7989bf446f96b2ffaf9_cgraph_org.svg |   31 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |  125 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg | 1223 --------
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg | 1140 -------
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |  127 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 1241 --------
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg | 1158 -------
 ...8f264600754602b6a9ea19cc690e50e_cgraph.map |    6 -
 ...8f264600754602b6a9ea19cc690e50e_cgraph.md5 |    1 -
 ...8f264600754602b6a9ea19cc690e50e_cgraph.svg |   75 -
 ...4600754602b6a9ea19cc690e50e_cgraph_org.svg |   49 -
 d2/d58/neural__network_8cpp_source.html       |  800 +++++
 d2/d5a/subset__sum_8cpp.html                  |  115 +-
 ...cb50d36a59427a33f64a266dac83d99_cgraph.map |    6 -
 ...cb50d36a59427a33f64a266dac83d99_cgraph.md5 |    1 -
 ...cb50d36a59427a33f64a266dac83d99_cgraph.svg |   75 -
 ...d36a59427a33f64a266dac83d99_cgraph_org.svg |   49 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 d2/d5a/subset__sum_8cpp_source.html           |  222 ++
 ...__minimum__spanning__tree_8cpp_source.html |  206 ++
 d2/d7d/egg__dropping__puzzle_8cpp_source.html |  189 ++
 ...st_1_1geometric__distribution-members.html |   35 +-
 ...heavy__light__decomposition_1_1_h_l_d.html |  305 +-
 ...579062b384e54b611b80c6337c7f2c8_cgraph.map |    4 -
 ...579062b384e54b611b80c6337c7f2c8_cgraph.md5 |    1 -
 ...579062b384e54b611b80c6337c7f2c8_cgraph.svg |   58 -
 ...62b384e54b611b80c6337c7f2c8_cgraph_org.svg |   32 -
 ...dfbda148aad0bfaba2ebfda9ebc915a_cgraph.map |    4 -
 ...dfbda148aad0bfaba2ebfda9ebc915a_cgraph.md5 |    1 -
 ...dfbda148aad0bfaba2ebfda9ebc915a_cgraph.svg |   58 -
 ...a148aad0bfaba2ebfda9ebc915a_cgraph_org.svg |   32 -
 ...dfbf5d9df825eeb63b294c6849bdcab_cgraph.map |   13 -
 ...dfbf5d9df825eeb63b294c6849bdcab_cgraph.md5 |    1 -
 ...dfbf5d9df825eeb63b294c6849bdcab_cgraph.svg |  147 -
 ...5d9df825eeb63b294c6849bdcab_cgraph_org.svg |  121 -
 ...d5b40c076347a6aabfb37a0590f2f24_cgraph.map |    7 -
 ...d5b40c076347a6aabfb37a0590f2f24_cgraph.md5 |    1 -
 ...d5b40c076347a6aabfb37a0590f2f24_cgraph.svg |   87 -
 ...0c076347a6aabfb37a0590f2f24_cgraph_org.svg |   61 -
 ...f1cb54ed09fde931bf3220d75ee4c57_cgraph.map |    5 -
 ...f1cb54ed09fde931bf3220d75ee4c57_cgraph.md5 |    1 -
 ...f1cb54ed09fde931bf3220d75ee4c57_cgraph.svg |   69 -
 ...54ed09fde931bf3220d75ee4c57_cgraph_org.svg |   43 -
 ...9e979edd69678b85665c01e2ee97828_cgraph.map |   22 -
 ...9e979edd69678b85665c01e2ee97828_cgraph.md5 |    1 -
 ...9e979edd69678b85665c01e2ee97828_cgraph.svg |  234 --
 ...9edd69678b85665c01e2ee97828_cgraph_org.svg |  208 --
 ...64848d6630c39d0f09ce2359cc7c4f8_cgraph.map |    4 -
 ...64848d6630c39d0f09ce2359cc7c4f8_cgraph.md5 |    1 -
 ...64848d6630c39d0f09ce2359cc7c4f8_cgraph.svg |   58 -
 ...8d6630c39d0f09ce2359cc7c4f8_cgraph_org.svg |   32 -
 d2/d90/namespacegreedy__algorithms.html       |   74 +-
 ...3e3819aa9ffec0e380383c52603b502_cgraph.map |    5 -
 ...3e3819aa9ffec0e380383c52603b502_cgraph.md5 |    1 -
 ...3e3819aa9ffec0e380383c52603b502_cgraph.svg |   66 -
 ...19aa9ffec0e380383c52603b502_cgraph_org.svg |   40 -
 ...edian_1_1_windowed_median__coll__graph.map |    4 +-
 ...edian_1_1_windowed_median__coll__graph.md5 |    2 +-
 ...edian_1_1_windowed_median__coll__graph.svg |    4 +-
 ...n_1_1_windowed_median__coll__graph_org.svg |    4 +-
 ...se__table__range__queries_8cpp_source.html |  199 ++
 ...1iterative__tree__traversals_1_1_node.html |   70 +-
 ...ix__chain__multiplication_8cpp_source.html |  201 ++
 ...amespacefind__non__repeating__integer.html |   35 +-
 ...edy__algorithms_1_1dijkstra_1_1_graph.html |   73 +-
 d2/db0/namespacesieve__of__eratosthenes.html  |   35 +-
 ...ctures_1_1treap_1_1_treap__coll__graph.map |    4 +-
 ...ctures_1_1treap_1_1_treap__coll__graph.md5 |    2 +-
 ...ctures_1_1treap_1_1_treap__coll__graph.svg |    4 +-
 ...es_1_1treap_1_1_treap__coll__graph_org.svg |    4 +-
 d2/dc4/classstack__linked_list.html           |   98 +-
 d2/dc8/classdata__structures_1_1_stack.html   |  209 +-
 ...ac469fcc2229d273450e429139d90e6_cgraph.map |    5 -
 ...ac469fcc2229d273450e429139d90e6_cgraph.md5 |    1 -
 ...ac469fcc2229d273450e429139d90e6_cgraph.svg |   67 -
 ...9fcc2229d273450e429139d90e6_cgraph_org.svg |   41 -
 ...1dc70e128ee64c9684f03a4c04818b0_cgraph.map |    5 -
 ...1dc70e128ee64c9684f03a4c04818b0_cgraph.md5 |    1 -
 ...1dc70e128ee64c9684f03a4c04818b0_cgraph.svg |   67 -
 ...0e128ee64c9684f03a4c04818b0_cgraph_org.svg |   41 -
 ...9f9b087e9e7c00628e1289f0f1de3b2_cgraph.map |    5 -
 ...9f9b087e9e7c00628e1289f0f1de3b2_cgraph.md5 |    1 -
 ...9f9b087e9e7c00628e1289f0f1de3b2_cgraph.svg |   67 -
 ...087e9e7c00628e1289f0f1de3b2_cgraph_org.svg |   41 -
 ...46842bdd9c655d84f865fa3a03da19b_cgraph.map |    5 -
 ...46842bdd9c655d84f865fa3a03da19b_cgraph.md5 |    1 -
 ...46842bdd9c655d84f865fa3a03da19b_cgraph.svg |   66 -
 ...2bdd9c655d84f865fa3a03da19b_cgraph_org.svg |   40 -
 ...e__traversals_1_1_binary_tree-members.html |   35 +-
 d2/dcf/namespacestatistics.html               |   35 +-
 ...d_1_1is__integral_3_01uint128__t_01_4.html |   42 +-
 d2/ddb/namespacegcd__of__n__numbers.html      |   35 +-
 d2/de1/namespacehouse__robber.html            |   35 +-
 ...ructlinear__probing_1_1_entry-members.html |   35 +-
 d2/de7/namespacerunge__kutta.html             |   35 +-
 d2/de9/heavy__light__decomposition_8cpp.html  |  145 +-
 ...4b8683a2b429de5cce57e6d733ec817_cgraph.map |   49 -
 ...4b8683a2b429de5cce57e6d733ec817_cgraph.md5 |    1 -
 ...4b8683a2b429de5cce57e6d733ec817_cgraph.svg |  550 ----
 ...83a2b429de5cce57e6d733ec817_cgraph_org.svg |  467 ---
 ...58410412185a5f09199deaff7157a8d_cgraph.map |   49 -
 ...58410412185a5f09199deaff7157a8d_cgraph.md5 |    1 -
 ...58410412185a5f09199deaff7157a8d_cgraph.svg |  550 ----
 ...0412185a5f09199deaff7157a8d_cgraph_org.svg |  467 ---
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   69 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  730 -----
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  647 ----
 ...31ec5409537703d9c8a47350386b32a_cgraph.map |   49 -
 ...31ec5409537703d9c8a47350386b32a_cgraph.md5 |    1 -
 ...31ec5409537703d9c8a47350386b32a_cgraph.svg |  550 ----
 ...5409537703d9c8a47350386b32a_cgraph_org.svg |  467 ---
 ...avy__light__decomposition_8cpp_source.html |  634 ++++
 ...1_1is__arithmetic_3_01uint128__t_01_4.html |   42 +-
 d3/d05/classbinary__search__tree-members.html |   35 +-
 d3/d05/sudoku__solver_8cpp.html               |  180 +-
 ...7dc6acffd0500de9bdbf16b3ade94b0_cgraph.map |    4 -
 ...7dc6acffd0500de9bdbf16b3ade94b0_cgraph.md5 |    1 -
 ...7dc6acffd0500de9bdbf16b3ade94b0_cgraph.svg |   57 -
 ...acffd0500de9bdbf16b3ade94b0_cgraph_org.svg |   31 -
 ...040a12d7684cd85fb3684f4211ea5ac_cgraph.map |    6 -
 ...040a12d7684cd85fb3684f4211ea5ac_cgraph.md5 |    1 -
 ...040a12d7684cd85fb3684f4211ea5ac_cgraph.svg |   75 -
 ...12d7684cd85fb3684f4211ea5ac_cgraph_org.svg |   49 -
 ...911c8bca8556206ff64461b2424866b_cgraph.map |    4 -
 ...911c8bca8556206ff64461b2424866b_cgraph.md5 |    1 -
 ...911c8bca8556206ff64461b2424866b_cgraph.svg |   57 -
 ...8bca8556206ff64461b2424866b_cgraph_org.svg |   31 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 d3/d05/sudoku__solver_8cpp_source.html        |  252 ++
 d3/d06/ode__semi__implicit__euler_8cpp.html   |  134 +-
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.map |   33 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 |    1 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg |  317 --
 ...224851353fc92bfbff6f499fa97_cgraph_org.svg |  291 --
 ...13517b8e5de1b75592052db7f7e237f_cgraph.map |   17 -
 ...13517b8e5de1b75592052db7f7e237f_cgraph.md5 |    1 -
 ...13517b8e5de1b75592052db7f7e237f_cgraph.svg |  173 --
 ...7b8e5de1b75592052db7f7e237f_cgraph_org.svg |  147 -
 ...3adf7b092a87868917ee5fb4255192b_cgraph.map |    7 -
 ...3adf7b092a87868917ee5fb4255192b_cgraph.md5 |    1 -
 ...3adf7b092a87868917ee5fb4255192b_cgraph.svg |   83 -
 ...7b092a87868917ee5fb4255192b_cgraph_org.svg |   57 -
 ...de__semi__implicit__euler_8cpp_source.html |  281 ++
 d3/d09/node_8hpp.html                         |   65 +-
 d3/d09/node_8hpp_source.html                  |   73 +-
 ...ata__structures_1_1_stack__coll__graph.map |    2 +-
 ...ata__structures_1_1_stack__coll__graph.md5 |    2 +-
 ...ata__structures_1_1_stack__coll__graph.svg |    2 +-
 ..._structures_1_1_stack__coll__graph_org.svg |    2 +-
 d3/d17/namespaceutil__functions.html          |   35 +-
 d3/d19/sparse__matrix_8cpp.html               |   63 +-
 d3/d19/sparse__matrix_8cpp_source.html        |  183 ++
 ...ctures_1_1list__array_1_1list-members.html |   35 +-
 ...h_1_1sublist__search_1_1_node-members.html |   35 +-
 d3/d22/quick__sort__iterative_8cpp.html       |  112 +-
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.map |   25 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 |    1 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.svg |  245 --
 ...ad42717780d6caaff9d3d6977f9_cgraph_org.svg |  219 --
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   27 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  320 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  237 --
 .../quick__sort__iterative_8cpp_source.html   |  246 ++
 d3/d22/saddleback__search_8cpp.html           |  125 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...1e0ca34797d88490747c08eca70a2e6_cgraph.map |    7 -
 ...1e0ca34797d88490747c08eca70a2e6_cgraph.md5 |    1 -
 ...1e0ca34797d88490747c08eca70a2e6_cgraph.svg |   84 -
 ...a34797d88490747c08eca70a2e6_cgraph_org.svg |   58 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 d3/d22/saddleback__search_8cpp_source.html    |  225 ++
 d3/d24/qr__decomposition_8cpp.html            |   87 +-
 ...40291bc02cba5474a4cb46a9b9566fe_cgraph.map |    5 -
 ...40291bc02cba5474a4cb46a9b9566fe_cgraph.md5 |    1 -
 ...40291bc02cba5474a4cb46a9b9566fe_cgraph.svg |   65 -
 ...1bc02cba5474a4cb46a9b9566fe_cgraph_org.svg |   39 -
 d3/d24/qr__decomposition_8cpp_source.html     |  190 ++
 ...assdata__structures_1_1_stack-members.html |   35 +-
 d3/d26/binary__search__tree_8cpp.html         |  117 +-
 d3/d26/binary__search__tree_8cpp_source.html  |  314 ++
 ...ures_1_1trie__using__hashmap_1_1_trie.html |  175 +-
 ...bbe538c8015e8ce158e7ed43f605ebd_cgraph.map |    8 -
 ...bbe538c8015e8ce158e7ed43f605ebd_cgraph.md5 |    1 -
 ...bbe538c8015e8ce158e7ed43f605ebd_cgraph.svg |   94 -
 ...38c8015e8ce158e7ed43f605ebd_cgraph_org.svg |   68 -
 ...cae0a4456e7f583ce716e3ef466dfd2_cgraph.map |    5 -
 ...cae0a4456e7f583ce716e3ef466dfd2_cgraph.md5 |    1 -
 ...cae0a4456e7f583ce716e3ef466dfd2_cgraph.svg |   67 -
 ...a4456e7f583ce716e3ef466dfd2_cgraph_org.svg |   41 -
 ...0bf3d6791cba144b3f539835d835e75_cgraph.map |   13 -
 ...0bf3d6791cba144b3f539835d835e75_cgraph.md5 |    1 -
 ...0bf3d6791cba144b3f539835d835e75_cgraph.svg |  139 -
 ...d6791cba144b3f539835d835e75_cgraph_org.svg |  113 -
 ...15fdc7f2b5023992d87a711d78566c4_cgraph.map |   10 -
 ...15fdc7f2b5023992d87a711d78566c4_cgraph.md5 |    1 -
 ...15fdc7f2b5023992d87a711d78566c4_cgraph.svg |  114 -
 ...c7f2b5023992d87a711d78566c4_cgraph_org.svg |   88 -
 ...y_star_search_1_1comparison__operator.html |   47 +-
 d3/d36/digit__separation_8cpp.html            |   79 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |   10 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |  114 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   88 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   12 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  132 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  106 -
 d3/d36/digit__separation_8cpp_source.html     |  249 ++
 d3/d39/manacher__algorithm_8cpp.html          |  110 +-
 ...5e6a2976bb2f332898f373941d52098_cgraph.map |    7 -
 ...5e6a2976bb2f332898f373941d52098_cgraph.md5 |    1 -
 ...5e6a2976bb2f332898f373941d52098_cgraph.svg |   84 -
 ...2976bb2f332898f373941d52098_cgraph_org.svg |   58 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 d3/d39/manacher__algorithm_8cpp_source.html   |  287 ++
 d3/d40/graph__coloring_8cpp.html              |  108 +-
 ...0337efc5dad761096489bf2c5b1c80c_cgraph.map |    4 -
 ...0337efc5dad761096489bf2c5b1c80c_cgraph.md5 |    1 -
 ...0337efc5dad761096489bf2c5b1c80c_cgraph.svg |   57 -
 ...efc5dad761096489bf2c5b1c80c_cgraph_org.svg |   31 -
 ...c47fa37fb6eeeb781b2ec1b05af6b07_cgraph.map |    4 -
 ...c47fa37fb6eeeb781b2ec1b05af6b07_cgraph.md5 |    1 -
 ...c47fa37fb6eeeb781b2ec1b05af6b07_cgraph.svg |   57 -
 ...a37fb6eeeb781b2ec1b05af6b07_cgraph_org.svg |   31 -
 ...76efe049deb042bf1f02612e181ab1d_cgraph.map |    4 -
 ...76efe049deb042bf1f02612e181ab1d_cgraph.md5 |    1 -
 ...76efe049deb042bf1f02612e181ab1d_cgraph.svg |   57 -
 ...e049deb042bf1f02612e181ab1d_cgraph_org.svg |   31 -
 d3/d40/graph__coloring_8cpp_source.html       |  225 ++
 d3/d4c/quick__sort__3_8cpp.html               |  128 +-
 ...7e5c62de28aeddea986890ce7ac1bda_cgraph.map |   14 -
 ...7e5c62de28aeddea986890ce7ac1bda_cgraph.md5 |    1 -
 ...7e5c62de28aeddea986890ce7ac1bda_cgraph.svg |  146 -
 ...62de28aeddea986890ce7ac1bda_cgraph_org.svg |  120 -
 ...635b04ad943fa28b7bbf8d1e6479792_cgraph.map |   14 -
 ...635b04ad943fa28b7bbf8d1e6479792_cgraph.md5 |    1 -
 ...635b04ad943fa28b7bbf8d1e6479792_cgraph.svg |  146 -
 ...04ad943fa28b7bbf8d1e6479792_cgraph_org.svg |  120 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   27 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  263 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  237 --
 d3/d4c/quick__sort__3_8cpp_source.html        |  293 ++
 d3/d4c/xor__cipher_8cpp.html                  |  112 +-
 ...1a3968e7947464bee7714f6d43b7002_cgraph.map |    5 -
 ...1a3968e7947464bee7714f6d43b7002_cgraph.md5 |    1 -
 ...1a3968e7947464bee7714f6d43b7002_cgraph.svg |   65 -
 ...68e7947464bee7714f6d43b7002_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 d3/d4c/xor__cipher_8cpp_source.html           |  199 ++
 d3/d53/mo_8cpp_source.html                    |  212 ++
 d3/d61/vector__important__functions_8cpp.html |   91 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   11 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  119 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   93 -
 ...tor__important__functions_8cpp_source.html |  179 ++
 ...1_1layers_1_1_dense_layer__coll__graph.map |    8 +-
 ...1_1layers_1_1_dense_layer__coll__graph.md5 |    2 +-
 ...1_1layers_1_1_dense_layer__coll__graph.svg |    8 +-
 ...ayers_1_1_dense_layer__coll__graph_org.svg |    8 +-
 d3/d6d/namespacesimpson__method.html          |   35 +-
 .../brute__force__string__searching_8cpp.html |   68 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 ..._force__string__searching_8cpp_source.html |  195 ++
 d3/d80/z__function_8cpp.html                  |  134 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   14 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  146 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  120 -
 ...044c4794349a8cff6256b99950d5773_cgraph.map |    7 -
 ...044c4794349a8cff6256b99950d5773_cgraph.md5 |    1 -
 ...044c4794349a8cff6256b99950d5773_cgraph.svg |   83 -
 ...4794349a8cff6256b99950d5773_cgraph_org.svg |   57 -
 ...186ca3ac3a69b5e52543bb13fe46db8_cgraph.map |   12 -
 ...186ca3ac3a69b5e52543bb13fe46db8_cgraph.md5 |    1 -
 ...186ca3ac3a69b5e52543bb13fe46db8_cgraph.svg |  128 -
 ...a3ac3a69b5e52543bb13fe46db8_cgraph_org.svg |  102 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   16 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  221 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  138 -
 d3/d80/z__function_8cpp_source.html           |  215 ++
 d3/d84/word__break_8cpp.html                  |  164 +-
 ...cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.map |    8 -
 ...cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.md5 |    1 -
 ...cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.svg |   94 -
 ...d6e6190d10a010fdcdfe7a21a81_cgraph_org.svg |   68 -
 ...72b0f5cdb4e41fd6dee4538b808c06a_cgraph.map |   13 -
 ...72b0f5cdb4e41fd6dee4538b808c06a_cgraph.md5 |    1 -
 ...72b0f5cdb4e41fd6dee4538b808c06a_cgraph.svg |  140 -
 ...f5cdb4e41fd6dee4538b808c06a_cgraph_org.svg |  114 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    8 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   92 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   66 -
 ...e4dcd6fd5282e535685361cba645d7c_cgraph.map |   19 -
 ...e4dcd6fd5282e535685361cba645d7c_cgraph.md5 |    1 -
 ...e4dcd6fd5282e535685361cba645d7c_cgraph.svg |  253 --
 ...d6fd5282e535685361cba645d7c_cgraph_org.svg |  170 -
 d3/d84/word__break_8cpp_source.html           |  258 ++
 .../namespacestrassens__multiplication.html   |   35 +-
 d3/d92/pancake__sort_8cpp.html                |  135 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   11 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  119 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   93 -
 ...ff90bc0f54e4f8ea5f0330471781bd5_cgraph.map |    4 -
 ...ff90bc0f54e4f8ea5f0330471781bd5_cgraph.md5 |    1 -
 ...ff90bc0f54e4f8ea5f0330471781bd5_cgraph.svg |   57 -
 ...bc0f54e4f8ea5f0330471781bd5_cgraph_org.svg |   31 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   13 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  137 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  111 -
 d3/d92/pancake__sort_8cpp_source.html         |  233 ++
 ...__structures_1_1tree__234_1_1_tree234.html |  333 +-
 ...2df91964915ca97609d35f847faff5f_cgraph.map |   39 -
 ...2df91964915ca97609d35f847faff5f_cgraph.md5 |    1 -
 ...2df91964915ca97609d35f847faff5f_cgraph.svg |  443 ---
 ...1964915ca97609d35f847faff5f_cgraph_org.svg |  360 ---
 ...7811b3c564a3a443b106c9aa717629d_cgraph.map |   20 -
 ...7811b3c564a3a443b106c9aa717629d_cgraph.md5 |    1 -
 ...7811b3c564a3a443b106c9aa717629d_cgraph.svg |  265 --
 ...b3c564a3a443b106c9aa717629d_cgraph_org.svg |  182 --
 ...1f0d016dff7f7e62b3dddb9fdf47805_cgraph.map |   23 -
 ...1f0d016dff7f7e62b3dddb9fdf47805_cgraph.md5 |    1 -
 ...1f0d016dff7f7e62b3dddb9fdf47805_cgraph.svg |  294 --
 ...016dff7f7e62b3dddb9fdf47805_cgraph_org.svg |  211 --
 ...73511e84a5243ffffe81be28bd24855_cgraph.map |    8 -
 ...73511e84a5243ffffe81be28bd24855_cgraph.md5 |    1 -
 ...73511e84a5243ffffe81be28bd24855_cgraph.svg |   95 -
 ...1e84a5243ffffe81be28bd24855_cgraph_org.svg |   69 -
 ...e9a9db7792cf5383f4c4cc418255165_cgraph.map |   11 -
 ...e9a9db7792cf5383f4c4cc418255165_cgraph.md5 |    1 -
 ...e9a9db7792cf5383f4c4cc418255165_cgraph.svg |  121 -
 ...db7792cf5383f4c4cc418255165_cgraph_org.svg |   95 -
 ...6f4d5f603f7edb7db7c73fb53ba14e9_cgraph.map |   15 -
 ...6f4d5f603f7edb7db7c73fb53ba14e9_cgraph.md5 |    1 -
 ...6f4d5f603f7edb7db7c73fb53ba14e9_cgraph.svg |  162 -
 ...5f603f7edb7db7c73fb53ba14e9_cgraph_org.svg |  136 -
 ...da1be3f5b5d967ebb36a201f3ebad11_cgraph.map |   46 -
 ...da1be3f5b5d967ebb36a201f3ebad11_cgraph.md5 |    1 -
 ...da1be3f5b5d967ebb36a201f3ebad11_cgraph.svg |  511 ---
 ...e3f5b5d967ebb36a201f3ebad11_cgraph_org.svg |  428 ---
 ...1dd051a74e5f36c8dc03dae8dca6ef4_cgraph.map |   44 -
 ...1dd051a74e5f36c8dc03dae8dca6ef4_cgraph.md5 |    1 -
 ...1dd051a74e5f36c8dc03dae8dca6ef4_cgraph.svg |  492 ---
 ...51a74e5f36c8dc03dae8dca6ef4_cgraph_org.svg |  409 ---
 ...5a1235659356166a3e9b451c64fcc36_cgraph.map |    7 -
 ...5a1235659356166a3e9b451c64fcc36_cgraph.md5 |    1 -
 ...5a1235659356166a3e9b451c64fcc36_cgraph.svg |   86 -
 ...35659356166a3e9b451c64fcc36_cgraph_org.svg |   60 -
 ...749ebb40710c9752a2771eda03c6b3e_cgraph.map |   22 -
 ...749ebb40710c9752a2771eda03c6b3e_cgraph.md5 |    1 -
 ...749ebb40710c9752a2771eda03c6b3e_cgraph.svg |  284 --
 ...bb40710c9752a2771eda03c6b3e_cgraph_org.svg |  201 --
 ...4ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.map |    6 -
 ...4ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.md5 |    1 -
 ...4ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.svg |   75 -
 ...b4fe7442b5e2eeed8c050bb86bd_cgraph_org.svg |   49 -
 ...36bb546e6a94d8b9d35b30ee1bb291a_cgraph.map |    8 -
 ...36bb546e6a94d8b9d35b30ee1bb291a_cgraph.md5 |    1 -
 ...36bb546e6a94d8b9d35b30ee1bb291a_cgraph.svg |   94 -
 ...546e6a94d8b9d35b30ee1bb291a_cgraph_org.svg |   68 -
 ...7e5e00033f38006a224f30bdbf3f703_cgraph.map |   24 -
 ...7e5e00033f38006a224f30bdbf3f703_cgraph.md5 |    1 -
 ...7e5e00033f38006a224f30bdbf3f703_cgraph.svg |  303 --
 ...00033f38006a224f30bdbf3f703_cgraph_org.svg |  220 --
 ...5361479dd996eb331759f33808657d9_cgraph.map |    7 -
 ...5361479dd996eb331759f33808657d9_cgraph.md5 |    1 -
 ...5361479dd996eb331759f33808657d9_cgraph.svg |   86 -
 ...479dd996eb331759f33808657d9_cgraph_org.svg |   60 -
 ...85ba5abfd6d34dcd908b2afe6464657_cgraph.map |    7 -
 ...85ba5abfd6d34dcd908b2afe6464657_cgraph.md5 |    1 -
 ...85ba5abfd6d34dcd908b2afe6464657_cgraph.svg |   86 -
 ...5abfd6d34dcd908b2afe6464657_cgraph_org.svg |   60 -
 ...37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.map |   14 -
 ...37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.md5 |    1 -
 ...37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.svg |  209 --
 ...9e2a4a6cc0eb65cbd5595e1da95_cgraph_org.svg |  126 -
 ...c0642d1d151521ca7c70ea85cdb15d3_cgraph.map |    7 -
 ...c0642d1d151521ca7c70ea85cdb15d3_cgraph.md5 |    1 -
 ...c0642d1d151521ca7c70ea85cdb15d3_cgraph.svg |   86 -
 ...2d1d151521ca7c70ea85cdb15d3_cgraph_org.svg |   60 -
 ...ork_1_1layers_1_1_dense_layer-members.html |   35 +-
 d3/d9c/class_longest___substring-members.html |   35 +-
 ...postfix__expression_1_1_stack-members.html |   35 +-
 d3/da1/namespacen__queens.html                |   35 +-
 ...tatistics_1_1stats__computer2-members.html |   35 +-
 ...metry_1_1grahamscan_1_1_point-members.html |   35 +-
 ...classbinary__search__tree__coll__graph.map |   18 +-
 ...classbinary__search__tree__coll__graph.md5 |    2 +-
 ...classbinary__search__tree__coll__graph.svg |   71 +-
 ...sbinary__search__tree__coll__graph_org.svg |   71 +-
 ...__table_1_1_sparse__table__coll__graph.map |   14 +-
 ...__table_1_1_sparse__table__coll__graph.md5 |    2 +-
 ...__table_1_1_sparse__table__coll__graph.svg |   51 +-
 ...ble_1_1_sparse__table__coll__graph_org.svg |   51 +-
 d3/dae/dsu__path__compression_8cpp.html       |   98 +-
 ...5d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.map |   28 -
 ...5d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.md5 |    1 -
 ...5d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg |  272 --
 ...ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg |  246 --
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   34 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  326 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  300 --
 ...7880ce913f3058a35ff106d5be9e243_cgraph.map |   28 -
 ...7880ce913f3058a35ff106d5be9e243_cgraph.md5 |    1 -
 ...7880ce913f3058a35ff106d5be9e243_cgraph.svg |  272 --
 ...ce913f3058a35ff106d5be9e243_cgraph_org.svg |  246 --
 .../dsu__path__compression_8cpp_source.html   |  292 ++
 d3/db0/namespacelinked__list.html             |   35 +-
 d3/db2/boyer__moore_8cpp.html                 |  116 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |   36 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |  406 ---
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |  323 --
 ...8fac0dd4b19973da103a434143a16d2_cgraph.map |   28 -
 ...8fac0dd4b19973da103a434143a16d2_cgraph.md5 |    1 -
 ...8fac0dd4b19973da103a434143a16d2_cgraph.svg |  277 --
 ...0dd4b19973da103a434143a16d2_cgraph_org.svg |  251 --
 ...b8f69e7901ee7459d98bd4b9dda79d9_cgraph.map |   28 -
 ...b8f69e7901ee7459d98bd4b9dda79d9_cgraph.md5 |    1 -
 ...b8f69e7901ee7459d98bd4b9dda79d9_cgraph.svg |  277 --
 ...9e7901ee7459d98bd4b9dda79d9_cgraph_org.svg |  251 --
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   38 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  424 ---
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  341 --
 d3/db2/boyer__moore_8cpp_source.html          |  334 ++
 d3/db3/lru__cache_8cpp.html                   |  143 +-
 ...1ec21fc91ddafd964ae2035ba7892c0_cgraph.map |   28 -
 ...1ec21fc91ddafd964ae2035ba7892c0_cgraph.md5 |    1 -
 ...1ec21fc91ddafd964ae2035ba7892c0_cgraph.svg |  277 --
 ...1fc91ddafd964ae2035ba7892c0_cgraph_org.svg |  251 --
 ...4d21a345ed06f7fba6919718cf3e058_cgraph.map |    5 -
 ...4d21a345ed06f7fba6919718cf3e058_cgraph.md5 |    1 -
 ...4d21a345ed06f7fba6919718cf3e058_cgraph.svg |   65 -
 ...a345ed06f7fba6919718cf3e058_cgraph_org.svg |   39 -
 ...b02e288a407876a8d6024f98a2a25ec_cgraph.map |   28 -
 ...b02e288a407876a8d6024f98a2a25ec_cgraph.md5 |    1 -
 ...b02e288a407876a8d6024f98a2a25ec_cgraph.svg |  277 --
 ...288a407876a8d6024f98a2a25ec_cgraph_org.svg |  251 --
 ...401e8f2d41d8cc9cd0e52ab381608d4_cgraph.map |   28 -
 ...401e8f2d41d8cc9cd0e52ab381608d4_cgraph.md5 |    1 -
 ...401e8f2d41d8cc9cd0e52ab381608d4_cgraph.svg |  277 --
 ...8f2d41d8cc9cd0e52ab381608d4_cgraph_org.svg |  251 --
 ...a3be6d8871b1f5dc03688da8f3ee9e6_cgraph.map |   43 -
 ...a3be6d8871b1f5dc03688da8f3ee9e6_cgraph.md5 |    1 -
 ...a3be6d8871b1f5dc03688da8f3ee9e6_cgraph.svg |  469 ---
 ...6d8871b1f5dc03688da8f3ee9e6_cgraph_org.svg |  386 ---
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   32 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  314 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  288 --
 d3/db3/lru__cache_8cpp_source.html            |  331 ++
 d3/dbb/class_cycle_check.html                 |  113 +-
 ...f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.map |    8 -
 ...f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.md5 |    1 -
 ...f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.svg |   92 -
 ...5c08b45e7a21a2e86f9c3f01d8b_cgraph_org.svg |   66 -
 ...99292a33edf87499daa52b51315aca5_cgraph.map |   11 -
 ...99292a33edf87499daa52b51315aca5_cgraph.md5 |    1 -
 ...99292a33edf87499daa52b51315aca5_cgraph.svg |  119 -
 ...2a33edf87499daa52b51315aca5_cgraph_org.svg |   93 -
 ...9a270ffba3a68539b92272c702e3474_cgraph.map |   10 -
 ...9a270ffba3a68539b92272c702e3474_cgraph.md5 |    1 -
 ...9a270ffba3a68539b92272c702e3474_cgraph.svg |  110 -
 ...0ffba3a68539b92272c702e3474_cgraph_org.svg |   84 -
 ...asshashing_1_1sha256_1_1_hash-members.html |   35 +-
 d3/dc1/bucket__sort_8cpp_source.html          |  174 ++
 d3/dc9/namespacefibonacci__sum.html           |   35 +-
 ...edlist__implentation__usingarray_8cpp.html |  168 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  101 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   75 -
 ...cb07da7984e20b3207934696791f5df_cgraph.map |    5 -
 ...cb07da7984e20b3207934696791f5df_cgraph.md5 |    1 -
 ...cb07da7984e20b3207934696791f5df_cgraph.svg |   65 -
 ...da7984e20b3207934696791f5df_cgraph_org.svg |   39 -
 ..._implentation__usingarray_8cpp_source.html |  248 ++
 d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html |   35 +-
 ..._light__decomposition_1_1_s_g-members.html |   35 +-
 ...tack__using__linked__list_8cpp_source.html |  206 ++
 ...espaceshortest__common__supersequence.html |   35 +-
 ...e__check__directed__graph_8cpp_source.html |  385 +++
 d3/df9/recursive__bubble__sort_8cpp.html      |  120 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   18 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  183 --
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  157 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   20 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  201 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  175 --
 .../recursive__bubble__sort_8cpp_source.html  |  223 ++
 ...ular__queue__using__array_8cpp_source.html |  197 ++
 d3/dfe/horspool_8cpp.html                     |  130 +-
 ...a9c3aa55ccc79d0f47d50c580997336_cgraph.map |   16 -
 ...a9c3aa55ccc79d0f47d50c580997336_cgraph.md5 |    1 -
 ...a9c3aa55ccc79d0f47d50c580997336_cgraph.svg |  168 -
 ...aa55ccc79d0f47d50c580997336_cgraph_org.svg |  142 -
 ...884bca75ce39c116697ea2574adb37d_cgraph.map |   21 -
 ...884bca75ce39c116697ea2574adb37d_cgraph.md5 |    1 -
 ...884bca75ce39c116697ea2574adb37d_cgraph.svg |  214 --
 ...ca75ce39c116697ea2574adb37d_cgraph_org.svg |  188 --
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 d3/dfe/horspool_8cpp_source.html              |  239 ++
 d3/dfe/perimeter_8cpp.html                    |  210 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   28 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  276 --
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  250 --
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   30 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  294 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  268 --
 d3/dfe/perimeter_8cpp_source.html             |  382 +++
 d4/d08/sha256_8cpp.html                       |  203 +-
 ...8c1c6724dc6bcf91a39818699bbec27_cgraph.map |    4 -
 ...8c1c6724dc6bcf91a39818699bbec27_cgraph.md5 |    1 -
 ...8c1c6724dc6bcf91a39818699bbec27_cgraph.svg |   57 -
 ...6724dc6bcf91a39818699bbec27_cgraph_org.svg |   31 -
 ...25531b3939ed44fbf01674e21931b3a_cgraph.map |   15 -
 ...25531b3939ed44fbf01674e21931b3a_cgraph.md5 |    1 -
 ...25531b3939ed44fbf01674e21931b3a_cgraph.svg |  158 -
 ...1b3939ed44fbf01674e21931b3a_cgraph_org.svg |  132 -
 ...5475649a2bb7aae15de0716a217f43a_cgraph.map |   32 -
 ...5475649a2bb7aae15de0716a217f43a_cgraph.md5 |    1 -
 ...5475649a2bb7aae15de0716a217f43a_cgraph.svg |  369 ---
 ...649a2bb7aae15de0716a217f43a_cgraph_org.svg |  286 --
 ...e98c180d32b04aab6f767cb0c13e1da_cgraph.map |    9 -
 ...e98c180d32b04aab6f767cb0c13e1da_cgraph.md5 |    1 -
 ...e98c180d32b04aab6f767cb0c13e1da_cgraph.svg |  102 -
 ...180d32b04aab6f767cb0c13e1da_cgraph_org.svg |   76 -
 ...bcd504103c342a4da718f8fce6ff06c_cgraph.map |    4 -
 ...bcd504103c342a4da718f8fce6ff06c_cgraph.md5 |    1 -
 ...bcd504103c342a4da718f8fce6ff06c_cgraph.svg |   57 -
 ...04103c342a4da718f8fce6ff06c_cgraph_org.svg |   31 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 ...ea411191ec5281f43e91ea327984627_cgraph.map |    4 -
 ...ea411191ec5281f43e91ea327984627_cgraph.md5 |    1 -
 ...ea411191ec5281f43e91ea327984627_cgraph.svg |   56 -
 ...1191ec5281f43e91ea327984627_cgraph_org.svg |   30 -
 d4/d08/sha256_8cpp_source.html                |  425 +++
 ...__structures_1_1linked__list_1_1_node.html |   84 +-
 d4/d0f/namespacegram__schmidt.html            |   35 +-
 d4/d12/namespace_minimum.html                 |   35 +-
 d4/d13/namespacebidirectional__dijkstra.html  |   35 +-
 d4/d18/composite__simpson__rule_8cpp.html     |  183 +-
 ...b74d828b33760094906797042b89442_cgraph.map |    8 -
 ...b74d828b33760094906797042b89442_cgraph.md5 |    1 -
 ...b74d828b33760094906797042b89442_cgraph.svg |   93 -
 ...828b33760094906797042b89442_cgraph_org.svg |   67 -
 ...ae48a41e43dc6ab11b962742349646e_cgraph.map |    7 -
 ...ae48a41e43dc6ab11b962742349646e_cgraph.md5 |    1 -
 ...ae48a41e43dc6ab11b962742349646e_cgraph.svg |   83 -
 ...a41e43dc6ab11b962742349646e_cgraph_org.svg |   57 -
 ...f67508d5f392b0321772169342c98ad_cgraph.map |    8 -
 ...f67508d5f392b0321772169342c98ad_cgraph.md5 |    1 -
 ...f67508d5f392b0321772169342c98ad_cgraph.svg |   93 -
 ...08d5f392b0321772169342c98ad_cgraph_org.svg |   67 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map |   24 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 |    1 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg |  295 --
 ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg |  212 --
 ...251b4df4748a0b9c43a48f61bdd2397_cgraph.map |    8 -
 ...251b4df4748a0b9c43a48f61bdd2397_cgraph.md5 |    1 -
 ...251b4df4748a0b9c43a48f61bdd2397_cgraph.svg |   93 -
 ...4df4748a0b9c43a48f61bdd2397_cgraph_org.svg |   67 -
 ...d8df83a6f26ce24a75d3b358b7f5b8a_cgraph.map |    6 -
 ...d8df83a6f26ce24a75d3b358b7f5b8a_cgraph.md5 |    1 -
 ...d8df83a6f26ce24a75d3b358b7f5b8a_cgraph.svg |   75 -
 ...83a6f26ce24a75d3b358b7f5b8a_cgraph_org.svg |   49 -
 .../composite__simpson__rule_8cpp_source.html |  277 ++
 d4/d1c/namespacehamming__distance.html        |   35 +-
 d4/d1e/class_r_btree-members.html             |   35 +-
 d4/d1f/class_min_heap-members.html            |   35 +-
 d4/d21/least__common__multiple_8cpp.html      |   97 +-
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.map |   10 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 |    1 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.svg |  110 -
 ...ad42717780d6caaff9d3d6977f9_cgraph_org.svg |   84 -
 ...ba1fc66e4134ab25b2602b323150563_cgraph.map |    4 -
 ...ba1fc66e4134ab25b2602b323150563_cgraph.md5 |    1 -
 ...ba1fc66e4134ab25b2602b323150563_cgraph.svg |   56 -
 ...c66e4134ab25b2602b323150563_cgraph_org.svg |   30 -
 ...8d0e241db517813725e721a152e3a25_cgraph.map |    6 -
 ...8d0e241db517813725e721a152e3a25_cgraph.md5 |    1 -
 ...8d0e241db517813725e721a152e3a25_cgraph.svg |   74 -
 ...241db517813725e721a152e3a25_cgraph_org.svg |   48 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   12 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  128 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  102 -
 .../least__common__multiple_8cpp_source.html  |  208 ++
 ...struct_trie_1_1_trie_node__coll__graph.map |    2 +-
 ...struct_trie_1_1_trie_node__coll__graph.md5 |    2 +-
 ...struct_trie_1_1_trie_node__coll__graph.svg |    2 +-
 ...ct_trie_1_1_trie_node__coll__graph_org.svg |    2 +-
 d4/d32/fibonacci__fast_8cpp.html              |   62 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 d4/d32/fibonacci__fast_8cpp_source.html       |  177 ++
 d4/d32/inorder__successor__of__bst_8cpp.html  |  220 +-
 ...5fe8a029e155c43e4efa598d4d089d9_cgraph.map |    4 -
 ...5fe8a029e155c43e4efa598d4d089d9_cgraph.md5 |    1 -
 ...5fe8a029e155c43e4efa598d4d089d9_cgraph.svg |   58 -
 ...a029e155c43e4efa598d4d089d9_cgraph_org.svg |   32 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.map |   25 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 |    1 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg |  302 --
 ...224851353fc92bfbff6f499fa97_cgraph_org.svg |  219 --
 ...923fb22b46e085376703cae0b44d690_cgraph.map |   10 -
 ...923fb22b46e085376703cae0b44d690_cgraph.md5 |    1 -
 ...923fb22b46e085376703cae0b44d690_cgraph.svg |  116 -
 ...b22b46e085376703cae0b44d690_cgraph_org.svg |   90 -
 ...ae0bea4123fd2ce155108e88f2ef78c_cgraph.map |    6 -
 ...ae0bea4123fd2ce155108e88f2ef78c_cgraph.md5 |    1 -
 ...ae0bea4123fd2ce155108e88f2ef78c_cgraph.svg |   78 -
 ...ea4123fd2ce155108e88f2ef78c_cgraph_org.svg |   52 -
 ...d7266b934ca50c4f53e4f1e725d89a4_cgraph.map |    4 -
 ...d7266b934ca50c4f53e4f1e725d89a4_cgraph.md5 |    1 -
 ...d7266b934ca50c4f53e4f1e725d89a4_cgraph.svg |   58 -
 ...6b934ca50c4f53e4f1e725d89a4_cgraph_org.svg |   32 -
 ...2483e3f6933e004a8d86371e8a990db_cgraph.map |    4 -
 ...2483e3f6933e004a8d86371e8a990db_cgraph.md5 |    1 -
 ...2483e3f6933e004a8d86371e8a990db_cgraph.svg |   58 -
 ...e3f6933e004a8d86371e8a990db_cgraph_org.svg |   32 -
 ...b20eb99272665c1777949e26ab59589_cgraph.map |    4 -
 ...b20eb99272665c1777949e26ab59589_cgraph.md5 |    1 -
 ...b20eb99272665c1777949e26ab59589_cgraph.svg |   58 -
 ...b99272665c1777949e26ab59589_cgraph_org.svg |   32 -
 ...f6f73a33beec448c27cc1d70b220702_cgraph.map |    4 -
 ...f6f73a33beec448c27cc1d70b220702_cgraph.md5 |    1 -
 ...f6f73a33beec448c27cc1d70b220702_cgraph.svg |   58 -
 ...3a33beec448c27cc1d70b220702_cgraph_org.svg |   32 -
 ...24cbf1814854824cf05f062eea07b95_cgraph.map |    4 -
 ...24cbf1814854824cf05f062eea07b95_cgraph.md5 |    1 -
 ...24cbf1814854824cf05f062eea07b95_cgraph.svg |   58 -
 ...f1814854824cf05f062eea07b95_cgraph_org.svg |   32 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   22 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  275 --
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  192 --
 ...order__successor__of__bst_8cpp_source.html |  479 +++
 d4/d38/namespacecount__bits__flip.html        |   35 +-
 d4/d38/power__of__two_8cpp.html               |  118 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...fd6be45be425ae28c62ce3bfb4b40dc_cgraph.map |    7 -
 ...fd6be45be425ae28c62ce3bfb4b40dc_cgraph.md5 |    1 -
 ...fd6be45be425ae28c62ce3bfb4b40dc_cgraph.svg |   83 -
 ...e45be425ae28c62ce3bfb4b40dc_cgraph_org.svg |   57 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 d4/d38/power__of__two_8cpp_source.html        |  206 ++
 d4/d39/group__open__addressing.html           |   35 +-
 d4/d3e/k__nearest__neighbors_8cpp.html        |  148 +-
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.map |    7 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 |    1 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg |   83 -
 ...224851353fc92bfbff6f499fa97_cgraph_org.svg |   57 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...6ae16e50bb153ebaa7251d0aaa97b69_cgraph.map |   18 -
 ...6ae16e50bb153ebaa7251d0aaa97b69_cgraph.md5 |    1 -
 ...6ae16e50bb153ebaa7251d0aaa97b69_cgraph.svg |  185 --
 ...6e50bb153ebaa7251d0aaa97b69_cgraph_org.svg |  159 -
 d4/d3e/k__nearest__neighbors_8cpp_source.html |  289 ++
 d4/d3e/n__queens_8cpp.html                    |   82 +-
 ...dbd7af47d87f0b956609fe9e3288ecb_cgraph.map |    4 -
 ...dbd7af47d87f0b956609fe9e3288ecb_cgraph.md5 |    1 -
 ...dbd7af47d87f0b956609fe9e3288ecb_cgraph.svg |   57 -
 ...af47d87f0b956609fe9e3288ecb_cgraph_org.svg |   31 -
 d4/d3e/n__queens_8cpp_source.html             |  228 ++
 d4/d45/gcd__recursive__euclidean_8cpp.html    |   78 +-
 ...48807fa2b7000afae599e67f327545e_cgraph.map |    4 -
 ...48807fa2b7000afae599e67f327545e_cgraph.md5 |    1 -
 ...48807fa2b7000afae599e67f327545e_cgraph.svg |   56 -
 ...7fa2b7000afae599e67f327545e_cgraph_org.svg |   30 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    8 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   92 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   66 -
 ...gcd__recursive__euclidean_8cpp_source.html |  182 ++
 d4/d48/hamming__distance_8cpp.html            |  100 +-
 ...0ba9fe8b5df5c268f0c7d677ff2fe80_cgraph.map |    5 -
 ...0ba9fe8b5df5c268f0c7d677ff2fe80_cgraph.md5 |    1 -
 ...0ba9fe8b5df5c268f0c7d677ff2fe80_cgraph.svg |   66 -
 ...fe8b5df5c268f0c7d677ff2fe80_cgraph_org.svg |   40 -
 ...5d845df3fecff7087a2126c7b72030b_cgraph.map |    4 -
 ...5d845df3fecff7087a2126c7b72030b_cgraph.md5 |    1 -
 ...5d845df3fecff7087a2126c7b72030b_cgraph.svg |   57 -
 ...5df3fecff7087a2126c7b72030b_cgraph_org.svg |   31 -
 ...fe6fbb2f3460a2623c96f283178a07a_cgraph.map |    6 -
 ...fe6fbb2f3460a2623c96f283178a07a_cgraph.md5 |    1 -
 ...fe6fbb2f3460a2623c96f283178a07a_cgraph.svg |   76 -
 ...bb2f3460a2623c96f283178a07a_cgraph_org.svg |   50 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 d4/d48/hamming__distance_8cpp_source.html     |  211 ++
 d4/d4f/stooge__sort_8cpp.html                 |  135 +-
 ...283886819c7c140a023582b7269e2d0_cgraph.map |   16 -
 ...283886819c7c140a023582b7269e2d0_cgraph.md5 |    1 -
 ...283886819c7c140a023582b7269e2d0_cgraph.svg |  164 -
 ...86819c7c140a023582b7269e2d0_cgraph_org.svg |  138 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.map |   16 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 |    1 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg |  164 -
 ...7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg |  138 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.map |   16 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.md5 |    1 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.svg |  164 -
 ...5dd5c30adda100e95f0423c786e_cgraph_org.svg |  138 -
 ...23852832437dc68327efe9b1da2d91b_cgraph.map |    6 -
 ...23852832437dc68327efe9b1da2d91b_cgraph.md5 |    1 -
 ...23852832437dc68327efe9b1da2d91b_cgraph.svg |   74 -
 ...2832437dc68327efe9b1da2d91b_cgraph_org.svg |   48 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   32 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  308 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  282 --
 d4/d4f/stooge__sort_8cpp_source.html          |  199 ++
 ...1_1_cache_1_1_l_f_u_cache__coll__graph.map |    8 +-
 ...1_1_cache_1_1_l_f_u_cache__coll__graph.md5 |    2 +-
 ...1_1_cache_1_1_l_f_u_cache__coll__graph.svg |    8 +-
 ...cache_1_1_l_f_u_cache__coll__graph_org.svg |    8 +-
 d4/d68/qr__decompose_8h.html                  |   49 +-
 d4/d68/qr__decompose_8h_source.html           |  186 +-
 ...oruvkas__minimum__spanning__tree_8cpp.html |  146 +-
 ...311b22324cf09926726e4ce1309af8b_cgraph.map |    6 -
 ...311b22324cf09926726e4ce1309af8b_cgraph.md5 |    1 -
 ...311b22324cf09926726e4ce1309af8b_cgraph.svg |   76 -
 ...22324cf09926726e4ce1309af8b_cgraph_org.svg |   50 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |    5 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |   65 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   39 -
 ...4c615fc66b72e0adbcbcb99aabb1a59_cgraph.map |   11 -
 ...4c615fc66b72e0adbcbcb99aabb1a59_cgraph.md5 |    1 -
 ...4c615fc66b72e0adbcbcb99aabb1a59_cgraph.svg |  123 -
 ...5fc66b72e0adbcbcb99aabb1a59_cgraph_org.svg |   97 -
 ...5de0f5e70e83164dbd1b4c515565e84_cgraph.map |    4 -
 ...5de0f5e70e83164dbd1b4c515565e84_cgraph.md5 |    1 -
 ...5de0f5e70e83164dbd1b4c515565e84_cgraph.svg |   58 -
 ...f5e70e83164dbd1b4c515565e84_cgraph_org.svg |   32 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 ...__minimum__spanning__tree_8cpp_source.html |  326 ++
 d4/d7a/shell__sort2_8cpp.html                 |  192 +-
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.map |   34 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 |    1 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg |  326 --
 ...224851353fc92bfbff6f499fa97_cgraph_org.svg |  300 --
 ...2ea0d1f7943ebb4371d31e44b465b6d_cgraph.map |    9 -
 ...2ea0d1f7943ebb4371d31e44b465b6d_cgraph.md5 |    1 -
 ...2ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg |  101 -
 ...d1f7943ebb4371d31e44b465b6d_cgraph_org.svg |   75 -
 ...3aaff7cabfa3da2da8b9477b5fad9d6_cgraph.map |    7 -
 ...3aaff7cabfa3da2da8b9477b5fad9d6_cgraph.md5 |    1 -
 ...3aaff7cabfa3da2da8b9477b5fad9d6_cgraph.svg |   83 -
 ...f7cabfa3da2da8b9477b5fad9d6_cgraph_org.svg |   57 -
 ...95b313cb2671e8f712040460325573e_cgraph.map |    9 -
 ...95b313cb2671e8f712040460325573e_cgraph.md5 |    1 -
 ...95b313cb2671e8f712040460325573e_cgraph.svg |  101 -
 ...13cb2671e8f712040460325573e_cgraph_org.svg |   75 -
 ...51127aea9d7e1e53ea9ae0868633246_cgraph.map |    5 -
 ...51127aea9d7e1e53ea9ae0868633246_cgraph.md5 |    1 -
 ...51127aea9d7e1e53ea9ae0868633246_cgraph.svg |   65 -
 ...7aea9d7e1e53ea9ae0868633246_cgraph_org.svg |   39 -
 d4/d7a/shell__sort2_8cpp_source.html          |  362 +++
 d4/d83/sum__of__digits_8cpp.html              |   93 +-
 ...283886819c7c140a023582b7269e2d0_cgraph.map |    5 -
 ...283886819c7c140a023582b7269e2d0_cgraph.md5 |    1 -
 ...283886819c7c140a023582b7269e2d0_cgraph.svg |   65 -
 ...86819c7c140a023582b7269e2d0_cgraph_org.svg |   39 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.map |    5 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 |    1 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg |   65 -
 ...7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg |   39 -
 ...1a3968e7947464bee7714f6d43b7002_cgraph.map |   10 -
 ...1a3968e7947464bee7714f6d43b7002_cgraph.md5 |    1 -
 ...1a3968e7947464bee7714f6d43b7002_cgraph.svg |  110 -
 ...68e7947464bee7714f6d43b7002_cgraph_org.svg |   84 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   14 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  146 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  120 -
 d4/d83/sum__of__digits_8cpp_source.html       |  191 ++
 d4/d86/large__number_8h.html                  |   37 +-
 d4/d86/large__number_8h_source.html           |  247 +-
 d4/d8b/gray__code_8cpp_source.html            |  220 ++
 d4/d8d/jarvis__algorithm_8cpp.html            |   78 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   11 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  121 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   95 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   13 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  139 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  113 -
 d4/d8d/jarvis__algorithm_8cpp_source.html     |  266 ++
 ...lesman__using__bit__manipulation_8cpp.html |  121 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...08f082be02c3437c2fe89cb035fcee1_cgraph.map |    6 -
 ...08f082be02c3437c2fe89cb035fcee1_cgraph.md5 |    1 -
 ...08f082be02c3437c2fe89cb035fcee1_cgraph.svg |   77 -
 ...82be02c3437c2fe89cb035fcee1_cgraph_org.svg |   51 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 ..._using__bit__manipulation_8cpp_source.html |  240 ++
 .../classdata__structures_1_1_skip_list.html  |  221 +-
 ...0a4042bdf0b6683b5f21ae7854de8a9_cgraph.map |   16 -
 ...0a4042bdf0b6683b5f21ae7854de8a9_cgraph.md5 |    1 -
 ...0a4042bdf0b6683b5f21ae7854de8a9_cgraph.svg |  166 -
 ...42bdf0b6683b5f21ae7854de8a9_cgraph_org.svg |  140 -
 ...ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.map |    5 -
 ...ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.md5 |    1 -
 ...ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.svg |   66 -
 ...688725b9d1ec6e5bb881a6e2ae4_cgraph_org.svg |   40 -
 ...12611f80b8079268dbb19cc4e9bee5c_cgraph.map |    5 -
 ...12611f80b8079268dbb19cc4e9bee5c_cgraph.md5 |    1 -
 ...12611f80b8079268dbb19cc4e9bee5c_cgraph.svg |   66 -
 ...1f80b8079268dbb19cc4e9bee5c_cgraph_org.svg |   40 -
 ...6925c53e139cc6c3f7df1e9003bb0b0_cgraph.map |   10 -
 ...6925c53e139cc6c3f7df1e9003bb0b0_cgraph.md5 |    1 -
 ...6925c53e139cc6c3f7df1e9003bb0b0_cgraph.svg |  111 -
 ...c53e139cc6c3f7df1e9003bb0b0_cgraph_org.svg |   85 -
 ...3f3813e9896792fc86b296547689ba4_cgraph.map |    5 -
 ...3f3813e9896792fc86b296547689ba4_cgraph.md5 |    1 -
 ...3f3813e9896792fc86b296547689ba4_cgraph.svg |   66 -
 ...13e9896792fc86b296547689ba4_cgraph_org.svg |   40 -
 ...2f3d4e15b1f47afac849c2e08a730f4_cgraph.map |    5 -
 ...2f3d4e15b1f47afac849c2e08a730f4_cgraph.md5 |    1 -
 ...2f3d4e15b1f47afac849c2e08a730f4_cgraph.svg |   66 -
 ...4e15b1f47afac849c2e08a730f4_cgraph_org.svg |   40 -
 d4/d91/namespacevector__cross.html            |   35 +-
 ...ta__structures_1_1_bitset__coll__graph.map |    9 +-
 ...ta__structures_1_1_bitset__coll__graph.md5 |    2 +-
 ...ta__structures_1_1_bitset__coll__graph.svg |   51 +-
 ...structures_1_1_bitset__coll__graph_org.svg |   51 +-
 d4/d9c/primes__up__to__billion_8cpp.html      |   69 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 .../primes__up__to__billion_8cpp_source.html  |  173 ++
 .../sum__of__binomial__coefficient_8cpp.html  |   75 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    7 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   83 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   57 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  101 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   75 -
 ...of__binomial__coefficient_8cpp_source.html |  186 ++
 d4/d9f/selection__sort__recursive_8cpp.html   |  137 +-
 ...454eeb691725ccac0f59df1e133f834_cgraph.map |    6 -
 ...454eeb691725ccac0f59df1e133f834_cgraph.md5 |    1 -
 ...454eeb691725ccac0f59df1e133f834_cgraph.svg |   75 -
 ...eb691725ccac0f59df1e133f834_cgraph_org.svg |   49 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   11 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  119 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   93 -
 ...6f7b33a070e376e1f4374e534435e89_cgraph.map |    8 -
 ...6f7b33a070e376e1f4374e534435e89_cgraph.md5 |    1 -
 ...6f7b33a070e376e1f4374e534435e89_cgraph.svg |   94 -
 ...33a070e376e1f4374e534435e89_cgraph_org.svg |   68 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   13 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  137 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  111 -
 ...election__sort__recursive_8cpp_source.html |  224 ++
 d4/da0/gcd__iterative__euclidean_8cpp.html    |   71 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 ...gcd__iterative__euclidean_8cpp_source.html |  188 ++
 d4/da0/kadane_8cpp.html                       |   74 +-
 ...3029007a422a914a85c0b0122f1c7b4_cgraph.map |    6 -
 ...3029007a422a914a85c0b0122f1c7b4_cgraph.md5 |    1 -
 ...3029007a422a914a85c0b0122f1c7b4_cgraph.svg |   75 -
 ...007a422a914a85c0b0122f1c7b4_cgraph_org.svg |   49 -
 d4/da0/kadane_8cpp_source.html                |  181 ++
 d4/db4/struct_segment_intersection.html       |   68 +-
 ...08941b2272866c64cdaf959afa939bf_cgraph.map |    7 -
 ...08941b2272866c64cdaf959afa939bf_cgraph.md5 |    1 -
 ...08941b2272866c64cdaf959afa939bf_cgraph.svg |   84 -
 ...1b2272866c64cdaf959afa939bf_cgraph_org.svg |   58 -
 d4/db6/reverse__binary__tree_8cpp.html        |   77 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    9 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  101 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   75 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   11 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  119 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   93 -
 d4/db6/reverse__binary__tree_8cpp_source.html |  359 +++
 d4/db6/struct_min_heap_node-members.html      |   35 +-
 ...__without__repeating__characters_8cpp.html |   69 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |   16 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |  165 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |  139 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   18 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  183 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  157 -
 ...ut__repeating__characters_8cpp_source.html |  217 ++
 d4/db9/namespacencr__modulo__p.html           |   35 +-
 d4/dcb/classstack__coll__graph.map            |   24 +-
 d4/dcb/classstack__coll__graph.md5            |    2 +-
 d4/dcb/classstack__coll__graph.svg            |   87 +-
 d4/dcb/classstack__coll__graph_org.svg        |   87 +-
 d4/dcd/namespacecircular__linked__list.html   |   35 +-
 d4/dd2/namespacequadratic__probing.html       |  308 +-
 ...0ebcc6d39653eccc26f8432efbfc8d9_cgraph.map |   21 -
 ...0ebcc6d39653eccc26f8432efbfc8d9_cgraph.md5 |    1 -
 ...0ebcc6d39653eccc26f8432efbfc8d9_cgraph.svg |  214 --
 ...c6d39653eccc26f8432efbfc8d9_cgraph_org.svg |  188 --
 ...7a0467b24102260fbb6b554c453c20a_cgraph.map |   18 -
 ...7a0467b24102260fbb6b554c453c20a_cgraph.md5 |    1 -
 ...7a0467b24102260fbb6b554c453c20a_cgraph.svg |  187 --
 ...67b24102260fbb6b554c453c20a_cgraph_org.svg |  161 -
 ...12143ed316d48978084c025ff8d9768_cgraph.map |   28 -
 ...12143ed316d48978084c025ff8d9768_cgraph.md5 |    1 -
 ...12143ed316d48978084c025ff8d9768_cgraph.svg |  336 --
 ...3ed316d48978084c025ff8d9768_cgraph_org.svg |  253 --
 ...0d617ebf4d6ba21bcda8d8d1faa2357_cgraph.map |    5 -
 ...0d617ebf4d6ba21bcda8d8d1faa2357_cgraph.md5 |    1 -
 ...0d617ebf4d6ba21bcda8d8d1faa2357_cgraph.svg |   66 -
 ...7ebf4d6ba21bcda8d8d1faa2357_cgraph_org.svg |   40 -
 ...ceee4128d92ca4412040b7104d1299d_cgraph.map |   17 -
 ...ceee4128d92ca4412040b7104d1299d_cgraph.md5 |    1 -
 ...ceee4128d92ca4412040b7104d1299d_cgraph.svg |  177 --
 ...4128d92ca4412040b7104d1299d_cgraph_org.svg |  151 -
 ...9fe1f7c36fe004ba83eef2ca82e7e30_cgraph.map |   25 -
 ...9fe1f7c36fe004ba83eef2ca82e7e30_cgraph.md5 |    1 -
 ...9fe1f7c36fe004ba83eef2ca82e7e30_cgraph.svg |  309 --
 ...f7c36fe004ba83eef2ca82e7e30_cgraph_org.svg |  226 --
 ...431981b54c0bae1b2956f716aee1dcf_cgraph.map |   15 -
 ...431981b54c0bae1b2956f716aee1dcf_cgraph.md5 |    1 -
 ...431981b54c0bae1b2956f716aee1dcf_cgraph.svg |  159 -
 ...81b54c0bae1b2956f716aee1dcf_cgraph_org.svg |  133 -
 ...a6f1f44f7e83b0094fbcbe170788486_cgraph.map |   21 -
 ...a6f1f44f7e83b0094fbcbe170788486_cgraph.md5 |    1 -
 ...a6f1f44f7e83b0094fbcbe170788486_cgraph.svg |  271 --
 ...f44f7e83b0094fbcbe170788486_cgraph_org.svg |  188 --
 ...lassgeometry_1_1jarvis_1_1_convexhull.html |  132 +-
 ...306e48040a8570e164c58d1c530f870_cgraph.map |    5 -
 ...306e48040a8570e164c58d1c530f870_cgraph.md5 |    1 -
 ...306e48040a8570e164c58d1c530f870_cgraph.svg |   66 -
 ...48040a8570e164c58d1c530f870_cgraph_org.svg |   40 -
 ...ec46e86786ddd461464b07a77c4d5f1_cgraph.map |    7 -
 ...ec46e86786ddd461464b07a77c4d5f1_cgraph.md5 |    1 -
 ...ec46e86786ddd461464b07a77c4d5f1_cgraph.svg |   85 -
 ...e86786ddd461464b07a77c4d5f1_cgraph_org.svg |   59 -
 d4/de6/namespacepostfix__expression.html      |   35 +-
 ...ashing_1_1sha256_1_1_hash__coll__graph.map |    8 +-
 ...ashing_1_1sha256_1_1_hash__coll__graph.md5 |    2 +-
 ...ashing_1_1sha256_1_1_hash__coll__graph.svg |   27 +-
 ...ng_1_1sha256_1_1_hash__coll__graph_org.svg |   27 +-
 d4/ded/namespaceprobability.html              |   39 +-
 d4/def/kohonen__som__topology_8cpp.html       |  268 +-
 ...283886819c7c140a023582b7269e2d0_cgraph.map |   23 -
 ...283886819c7c140a023582b7269e2d0_cgraph.md5 |    1 -
 ...283886819c7c140a023582b7269e2d0_cgraph.svg |  227 --
 ...86819c7c140a023582b7269e2d0_cgraph_org.svg |  201 --
 ...302662a56ebf67a21249270b017297e_cgraph.map |    8 -
 ...302662a56ebf67a21249270b017297e_cgraph.md5 |    1 -
 ...302662a56ebf67a21249270b017297e_cgraph.svg |   92 -
 ...62a56ebf67a21249270b017297e_cgraph_org.svg |   66 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.map |   23 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 |    1 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg |  227 --
 ...7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg |  201 --
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map |   51 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 |    1 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg |  536 ----
 ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg |  453 ---
 ...8efb079040c7aaa3a4917a0e486cba9_cgraph.map |    8 -
 ...8efb079040c7aaa3a4917a0e486cba9_cgraph.md5 |    1 -
 ...8efb079040c7aaa3a4917a0e486cba9_cgraph.svg |   92 -
 ...079040c7aaa3a4917a0e486cba9_cgraph_org.svg |   66 -
 ...b7ab643f6a5002f991837de46f70653_cgraph.map |    8 -
 ...b7ab643f6a5002f991837de46f70653_cgraph.md5 |    1 -
 ...b7ab643f6a5002f991837de46f70653_cgraph.svg |   92 -
 ...643f6a5002f991837de46f70653_cgraph_org.svg |   66 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.map |   23 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.md5 |    1 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.svg |  227 --
 ...5dd5c30adda100e95f0423c786e_cgraph_org.svg |  201 --
 .../kohonen__som__topology_8cpp_source.html   |  651 ++++
 ...gest__common__subsequence_8cpp_source.html |  204 ++
 ...1_1neural__network_1_1_neural_network.html |  601 ++--
 ...be1b52bb9f57486f9a436f35c9089c0_cgraph.map |   77 -
 ...be1b52bb9f57486f9a436f35c9089c0_cgraph.md5 |    1 -
 ...be1b52bb9f57486f9a436f35c9089c0_cgraph.svg |  780 -----
 ...52bb9f57486f9a436f35c9089c0_cgraph_org.svg |  697 -----
 ...61a45f3c3d8347d79103bf182d0570b_cgraph.map |   21 -
 ...61a45f3c3d8347d79103bf182d0570b_cgraph.md5 |    1 -
 ...61a45f3c3d8347d79103bf182d0570b_cgraph.svg |  270 --
 ...5f3c3d8347d79103bf182d0570b_cgraph_org.svg |  187 --
 ...6494e26ff36d6e15c1022bb9a1ee848_cgraph.map |   82 -
 ...6494e26ff36d6e15c1022bb9a1ee848_cgraph.md5 |    1 -
 ...6494e26ff36d6e15c1022bb9a1ee848_cgraph.svg |  830 -----
 ...e26ff36d6e15c1022bb9a1ee848_cgraph_org.svg |  747 -----
 ...b9eac1824d365dce715fb17c33cb96f_cgraph.map |   23 -
 ...b9eac1824d365dce715fb17c33cb96f_cgraph.md5 |    1 -
 ...b9eac1824d365dce715fb17c33cb96f_cgraph.svg |  290 --
 ...c1824d365dce715fb17c33cb96f_cgraph_org.svg |  207 --
 ...c4c6f63ab965317f9471518ee931b89_cgraph.map |    7 -
 ...c4c6f63ab965317f9471518ee931b89_cgraph.md5 |    1 -
 ...c4c6f63ab965317f9471518ee931b89_cgraph.svg |   85 -
 ...f63ab965317f9471518ee931b89_cgraph_org.svg |   59 -
 ...f14e473bb0722c6490b9dc8da5982aa_cgraph.map |   23 -
 ...f14e473bb0722c6490b9dc8da5982aa_cgraph.md5 |    1 -
 ...f14e473bb0722c6490b9dc8da5982aa_cgraph.svg |  230 --
 ...473bb0722c6490b9dc8da5982aa_cgraph_org.svg |  204 --
 ...172a6791b9bd24f4232bab8d6b81fff_cgraph.map |  115 -
 ...172a6791b9bd24f4232bab8d6b81fff_cgraph.md5 |    1 -
 ...172a6791b9bd24f4232bab8d6b81fff_cgraph.svg | 1129 -------
 ...6791b9bd24f4232bab8d6b81fff_cgraph_org.svg | 1046 -------
 ...8ed20abf6ce3744535bd8b5bb9e741b_cgraph.map |   21 -
 ...8ed20abf6ce3744535bd8b5bb9e741b_cgraph.md5 |    1 -
 ...8ed20abf6ce3744535bd8b5bb9e741b_cgraph.svg |  213 --
 ...0abf6ce3744535bd8b5bb9e741b_cgraph_org.svg |  187 --
 ...1d30113d13304c664057118b92a5931_cgraph.map |   12 -
 ...1d30113d13304c664057118b92a5931_cgraph.md5 |    1 -
 ...1d30113d13304c664057118b92a5931_cgraph.svg |  131 -
 ...113d13304c664057118b92a5931_cgraph_org.svg |  105 -
 ...2151b0398a2536be60d950e10ffe9a8_cgraph.map |    7 -
 ...2151b0398a2536be60d950e10ffe9a8_cgraph.md5 |    1 -
 ...2151b0398a2536be60d950e10ffe9a8_cgraph.svg |   85 -
 ...b0398a2536be60d950e10ffe9a8_cgraph_org.svg |   59 -
 ...50c677fd6512665741ddd9b7983275d_cgraph.map |   47 -
 ...50c677fd6512665741ddd9b7983275d_cgraph.md5 |    1 -
 ...50c677fd6512665741ddd9b7983275d_cgraph.svg |  506 ---
 ...77fd6512665741ddd9b7983275d_cgraph_org.svg |  423 ---
 ...8bf9023ab3d4cdb61cf707c7cdfc86b_cgraph.map |   25 -
 ...8bf9023ab3d4cdb61cf707c7cdfc86b_cgraph.md5 |    1 -
 ...8bf9023ab3d4cdb61cf707c7cdfc86b_cgraph.svg |  310 --
 ...023ab3d4cdb61cf707c7cdfc86b_cgraph_org.svg |  227 --
 ...c648ea4f40bd71123b5f907a681dd8e_cgraph.map |   42 -
 ...c648ea4f40bd71123b5f907a681dd8e_cgraph.md5 |    1 -
 ...c648ea4f40bd71123b5f907a681dd8e_cgraph.svg |  463 ---
 ...ea4f40bd71123b5f907a681dd8e_cgraph_org.svg |  380 ---
 d4/dfb/namespacecycle__sort.html              |   35 +-
 d5/d02/namespacehorspool.html                 |   35 +-
 d5/d08/classgraph_1_1_graph__coll__graph.map  |    4 +-
 d5/d08/classgraph_1_1_graph__coll__graph.md5  |    2 +-
 d5/d08/classgraph_1_1_graph__coll__graph.svg  |    4 +-
 .../classgraph_1_1_graph__coll__graph_org.svg |    4 +-
 ...rie__using__hashmap_1_1_trie_1_1_node.html |   68 +-
 d5/d15/classcll.html                          |  136 +-
 ...ith__same__number__of__set__bits_8cpp.html |   67 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    7 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   84 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   58 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  102 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   76 -
 ...me__number__of__set__bits_8cpp_source.html |  215 ++
 d5/d1e/tim__sort_8cpp_source.html             |  266 ++
 ...asing__subsequence__nlogn_8cpp_source.html |  183 ++
 d5/d25/bead__sort_8cpp_source.html            |  195 ++
 ...d_1_1is__unsigned_3_01uint128__t_01_4.html |   42 +-
 d5/d29/struct_min_heap_node.html              |  121 +-
 d5/d2c/namespacelayers.html                   |   35 +-
 d5/d33/gram__schmidt_8cpp.html                |  239 +-
 ...837468e1a653ed056e2cce3c914afa5_cgraph.map |    9 -
 ...837468e1a653ed056e2cce3c914afa5_cgraph.md5 |    1 -
 ...837468e1a653ed056e2cce3c914afa5_cgraph.svg |  104 -
 ...68e1a653ed056e2cce3c914afa5_cgraph_org.svg |   78 -
 ...eeaafdde8b56f459aadc6013cf078bc_cgraph.map |    7 -
 ...eeaafdde8b56f459aadc6013cf078bc_cgraph.md5 |    1 -
 ...eeaafdde8b56f459aadc6013cf078bc_cgraph.svg |   85 -
 ...fdde8b56f459aadc6013cf078bc_cgraph_org.svg |   59 -
 ...4a4504924ecc9f12a2ebd80788ec01d_cgraph.map |    4 -
 ...4a4504924ecc9f12a2ebd80788ec01d_cgraph.md5 |    1 -
 ...4a4504924ecc9f12a2ebd80788ec01d_cgraph.svg |   57 -
 ...04924ecc9f12a2ebd80788ec01d_cgraph_org.svg |   31 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 d5/d33/gram__schmidt_8cpp_source.html         |  354 +++
 d5/d39/namespaceactivations.html              |   35 +-
 d5/d3c/namespacedata__structures.html         |  159 +-
 d5/d45/sublist__search_8cpp.html              |  192 +-
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.map |   25 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 |    1 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg |  302 --
 ...224851353fc92bfbff6f499fa97_cgraph_org.svg |  219 --
 ...faee403e2758aaab682ed6622ae218c_cgraph.map |    4 -
 ...faee403e2758aaab682ed6622ae218c_cgraph.md5 |    1 -
 ...faee403e2758aaab682ed6622ae218c_cgraph.svg |   57 -
 ...403e2758aaab682ed6622ae218c_cgraph_org.svg |   31 -
 ...0ca8d0267008e09cfa50b4e2ddfbe53_cgraph.map |    4 -
 ...0ca8d0267008e09cfa50b4e2ddfbe53_cgraph.md5 |    1 -
 ...0ca8d0267008e09cfa50b4e2ddfbe53_cgraph.svg |   57 -
 ...d0267008e09cfa50b4e2ddfbe53_cgraph_org.svg |   31 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   22 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  275 --
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  192 --
 ...1028bc215281d62e344af99da57fab2_cgraph.map |    6 -
 ...1028bc215281d62e344af99da57fab2_cgraph.md5 |    1 -
 ...1028bc215281d62e344af99da57fab2_cgraph.svg |   75 -
 ...bc215281d62e344af99da57fab2_cgraph_org.svg |   49 -
 d5/d45/sublist__search_8cpp_source.html       |  456 +++
 ...trie__using__hashmap_1_1_trie-members.html |   35 +-
 d5/d4c/group__sorting.html                    |  149 +-
 ...35e4c638e3bcf548bd122b5f49a3e72_cgraph.map |    7 -
 ...35e4c638e3bcf548bd122b5f49a3e72_cgraph.md5 |    1 -
 ...35e4c638e3bcf548bd122b5f49a3e72_cgraph.svg |   83 -
 ...c638e3bcf548bd122b5f49a3e72_cgraph_org.svg |   57 -
 ...9d28b140174dbdde7c9f5157758435f_cgraph.map |    5 -
 ...9d28b140174dbdde7c9f5157758435f_cgraph.md5 |    1 -
 ...9d28b140174dbdde7c9f5157758435f_cgraph.svg |   65 -
 ...b140174dbdde7c9f5157758435f_cgraph_org.svg |   39 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   16 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  164 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  138 -
 ...6b14fea48d9841e29b9fc26be6e05d7_cgraph.map |    6 -
 ...6b14fea48d9841e29b9fc26be6e05d7_cgraph.md5 |    1 -
 ...6b14fea48d9841e29b9fc26be6e05d7_cgraph.svg |   74 -
 ...fea48d9841e29b9fc26be6e05d7_cgraph_org.svg |   48 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    8 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   92 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   66 -
 ...urve__key__exchange_1_1_point-members.html |   35 +-
 .../classgraph_1_1_rooted_tree-members.html   |   35 +-
 d5/d58/class_test_cases.html                  |  378 +--
 ...3aa3d5bf666f327ee8e2d11d397b06e_cgraph.map |    5 -
 ...3aa3d5bf666f327ee8e2d11d397b06e_cgraph.md5 |    1 -
 ...3aa3d5bf666f327ee8e2d11d397b06e_cgraph.svg |   65 -
 ...d5bf666f327ee8e2d11d397b06e_cgraph_org.svg |   39 -
 ...ae0148985f159b582a385cf399254e3_cgraph.map |   11 -
 ...ae0148985f159b582a385cf399254e3_cgraph.md5 |    1 -
 ...ae0148985f159b582a385cf399254e3_cgraph.svg |  119 -
 ...48985f159b582a385cf399254e3_cgraph_org.svg |   93 -
 ...2636e8b5b9e053374c45bfcf0603008_cgraph.map |   11 -
 ...2636e8b5b9e053374c45bfcf0603008_cgraph.md5 |    1 -
 ...2636e8b5b9e053374c45bfcf0603008_cgraph.svg |  119 -
 ...e8b5b9e053374c45bfcf0603008_cgraph_org.svg |   93 -
 ...9f95c09931625b41e3be1f88d1e28c5_cgraph.map |   11 -
 ...9f95c09931625b41e3be1f88d1e28c5_cgraph.md5 |    1 -
 ...9f95c09931625b41e3be1f88d1e28c5_cgraph.svg |  119 -
 ...c09931625b41e3be1f88d1e28c5_cgraph_org.svg |   93 -
 ...abea90c02f9159e4a784bbf736e1e23_cgraph.map |   20 -
 ...abea90c02f9159e4a784bbf736e1e23_cgraph.md5 |    1 -
 ...abea90c02f9159e4a784bbf736e1e23_cgraph.svg |  200 --
 ...90c02f9159e4a784bbf736e1e23_cgraph_org.svg |  174 --
 ...ersistent__seg__tree__lazy__prop_8cpp.html |  116 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   27 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  326 --
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  243 --
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   29 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  344 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  261 --
 ...nt__seg__tree__lazy__prop_8cpp_source.html |  371 +++
 d5/d5f/namespacegeometry.html                 |   41 +-
 ...nge__queries_1_1per_seg_tree_1_1_node.html |  125 +-
 d5/d67/bayes__theorem_8cpp.html               |   64 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  101 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   75 -
 d5/d67/bayes__theorem_8cpp_source.html        |  166 +
 d5/d67/complex__numbers_8cpp.html             |  152 +-
 ...4d5f25b573e870accdf26fd32b8484d_cgraph.map |    7 -
 ...4d5f25b573e870accdf26fd32b8484d_cgraph.md5 |    1 -
 ...4d5f25b573e870accdf26fd32b8484d_cgraph.svg |   83 -
 ...25b573e870accdf26fd32b8484d_cgraph_org.svg |   57 -
 ...a73e9d4e68af8cedb95bd0864054b89_cgraph.map |    7 -
 ...a73e9d4e68af8cedb95bd0864054b89_cgraph.md5 |    1 -
 ...a73e9d4e68af8cedb95bd0864054b89_cgraph.svg |   83 -
 ...9d4e68af8cedb95bd0864054b89_cgraph_org.svg |   57 -
 ...d4d5b8250b50703de888514c8e7a7a0_cgraph.map |    5 -
 ...d4d5b8250b50703de888514c8e7a7a0_cgraph.md5 |    1 -
 ...d4d5b8250b50703de888514c8e7a7a0_cgraph.svg |   65 -
 ...b8250b50703de888514c8e7a7a0_cgraph_org.svg |   39 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.map |   17 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 |    1 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.svg |  173 --
 ...ad42717780d6caaff9d3d6977f9_cgraph_org.svg |  147 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   19 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  191 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  165 -
 d5/d67/complex__numbers_8cpp_source.html      |  340 ++
 d5/d6e/classcatalan__numbers__coll__graph.map |    8 +-
 d5/d6e/classcatalan__numbers__coll__graph.md5 |    2 +-
 d5/d6e/classcatalan__numbers__coll__graph.svg |   42 +-
 ...classcatalan__numbers__coll__graph_org.svg |   42 +-
 d5/d7a/largest__power_8cpp.html               |   75 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    7 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   83 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   57 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  101 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   75 -
 d5/d7a/largest__power_8cpp_source.html        |  193 ++
 d5/d82/edit__distance_8cpp_source.html        |  226 ++
 d5/d83/lcm__sum_8cpp.html                     |   81 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   73 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  766 -----
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  683 ----
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   75 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  784 -----
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  701 -----
 d5/d83/lcm__sum_8cpp_source.html              |  219 ++
 d5/d88/md__d_i_r_e_c_t_o_r_y.html             |   35 +-
 d5/d89/namespacepalindrome__partitioning.html |   35 +-
 ...hers_1_1postfix__expression_1_1_stack.html |   70 +-
 d5/d8a/trie__using__hashmap_8cpp.html         |  126 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   35 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  347 ---
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  321 --
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   37 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  422 ---
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  339 --
 d5/d8a/trie__using__hashmap_8cpp_source.html  |  445 +++
 ...ve__tree__traversals_1_1_node-members.html |   35 +-
 d5/d8e/huffman_8cpp_source.html               |  253 ++
 d5/d90/palindrome__partitioning_8cpp.html     |   96 +-
 ...2ee22882858d2b1cf04293f02ed839a_cgraph.map |    8 -
 ...2ee22882858d2b1cf04293f02ed839a_cgraph.md5 |    1 -
 ...2ee22882858d2b1cf04293f02ed839a_cgraph.svg |   94 -
 ...2882858d2b1cf04293f02ed839a_cgraph_org.svg |   68 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 .../palindrome__partitioning_8cpp_source.html |  238 ++
 d5/d91/namespacesorting.html                  |  415 ++-
 ...34d8b276518a902962e87d3158b64fd_cgraph.map |    4 -
 ...34d8b276518a902962e87d3158b64fd_cgraph.md5 |    1 -
 ...34d8b276518a902962e87d3158b64fd_cgraph.svg |   56 -
 ...b276518a902962e87d3158b64fd_cgraph_org.svg |   30 -
 ...e9e1b21a1684585e9e50f9afe4d53a3_cgraph.map |   11 -
 ...e9e1b21a1684585e9e50f9afe4d53a3_cgraph.md5 |    1 -
 ...e9e1b21a1684585e9e50f9afe4d53a3_cgraph.svg |  119 -
 ...b21a1684585e9e50f9afe4d53a3_cgraph_org.svg |   93 -
 ...40d913e42fb94176a0b2c8b29a80420_cgraph.map |    7 -
 ...40d913e42fb94176a0b2c8b29a80420_cgraph.md5 |    1 -
 ...40d913e42fb94176a0b2c8b29a80420_cgraph.svg |   84 -
 ...13e42fb94176a0b2c8b29a80420_cgraph_org.svg |   58 -
 ...63595fd9a0163b5b997b89fab3a0dc5_cgraph.map |   17 -
 ...63595fd9a0163b5b997b89fab3a0dc5_cgraph.md5 |    1 -
 ...63595fd9a0163b5b997b89fab3a0dc5_cgraph.svg |  173 --
 ...5fd9a0163b5b997b89fab3a0dc5_cgraph_org.svg |  147 -
 ...7236b8d3df3832e1f1225576a122534_cgraph.map |    9 -
 ...7236b8d3df3832e1f1225576a122534_cgraph.md5 |    1 -
 ...7236b8d3df3832e1f1225576a122534_cgraph.svg |  103 -
 ...b8d3df3832e1f1225576a122534_cgraph_org.svg |   77 -
 ...f8bc626eb57acae24a94636a23af6a1_cgraph.map |    5 -
 ...f8bc626eb57acae24a94636a23af6a1_cgraph.md5 |    1 -
 ...f8bc626eb57acae24a94636a23af6a1_cgraph.svg |   65 -
 ...626eb57acae24a94636a23af6a1_cgraph_org.svg |   39 -
 ...d76603c54d3dc56146e92d10a043924_cgraph.map |    5 -
 ...d76603c54d3dc56146e92d10a043924_cgraph.md5 |    1 -
 ...d76603c54d3dc56146e92d10a043924_cgraph.svg |   65 -
 ...03c54d3dc56146e92d10a043924_cgraph_org.svg |   39 -
 ...f4bc75cca6dd8294af2d0e328006c68_cgraph.map |    8 -
 ...f4bc75cca6dd8294af2d0e328006c68_cgraph.md5 |    1 -
 ...f4bc75cca6dd8294af2d0e328006c68_cgraph.svg |   93 -
 ...75cca6dd8294af2d0e328006c68_cgraph_org.svg |   67 -
 ...eb67c2f91c98cf4464f75b5882022de_cgraph.map |    6 -
 ...eb67c2f91c98cf4464f75b5882022de_cgraph.md5 |    1 -
 ...eb67c2f91c98cf4464f75b5882022de_cgraph.svg |   74 -
 ...c2f91c98cf4464f75b5882022de_cgraph_org.svg |   48 -
 ...bfe11bd4703eacd1dab93f25ec639c5_cgraph.map |    7 -
 ...bfe11bd4703eacd1dab93f25ec639c5_cgraph.md5 |    1 -
 ...bfe11bd4703eacd1dab93f25ec639c5_cgraph.svg |   83 -
 ...1bd4703eacd1dab93f25ec639c5_cgraph_org.svg |   57 -
 ...fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph.map |    5 -
 ...fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph.md5 |    1 -
 ...fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph.svg |   65 -
 ...ac9e03f58abcc2ce26ef3de1b5f_cgraph_org.svg |   39 -
 ...f59fe72dacc1f1218ef3c303d843168_cgraph.map |    4 -
 ...f59fe72dacc1f1218ef3c303d843168_cgraph.md5 |    1 -
 ...f59fe72dacc1f1218ef3c303d843168_cgraph.svg |   56 -
 ...e72dacc1f1218ef3c303d843168_cgraph_org.svg |   30 -
 ...26de383227859210f14dcf12201a079_cgraph.map |    5 -
 ...26de383227859210f14dcf12201a079_cgraph.md5 |    1 -
 ...26de383227859210f14dcf12201a079_cgraph.svg |   65 -
 ...383227859210f14dcf12201a079_cgraph_org.svg |   39 -
 ...3677f87b5b4756bc77e9e34c5f27935_cgraph.map |    5 -
 ...3677f87b5b4756bc77e9e34c5f27935_cgraph.md5 |    1 -
 ...3677f87b5b4756bc77e9e34c5f27935_cgraph.svg |   65 -
 ...f87b5b4756bc77e9e34c5f27935_cgraph_org.svg |   39 -
 ...c8f44b28b4aa96444383030b28f8b34_cgraph.map |    5 -
 ...c8f44b28b4aa96444383030b28f8b34_cgraph.md5 |    1 -
 ...c8f44b28b4aa96444383030b28f8b34_cgraph.svg |   65 -
 ...4b28b4aa96444383030b28f8b34_cgraph_org.svg |   39 -
 ...3a775d99dbbb94c130a973df0cfddcf_cgraph.map |    6 -
 ...3a775d99dbbb94c130a973df0cfddcf_cgraph.md5 |    1 -
 ...3a775d99dbbb94c130a973df0cfddcf_cgraph.svg |   75 -
 ...5d99dbbb94c130a973df0cfddcf_cgraph_org.svg |   49 -
 ...97f4dd815654c4682f564afd718e824_cgraph.map |    9 -
 ...97f4dd815654c4682f564afd718e824_cgraph.md5 |    1 -
 ...97f4dd815654c4682f564afd718e824_cgraph.svg |  103 -
 ...dd815654c4682f564afd718e824_cgraph_org.svg |   77 -
 ...2c5b92cbfe73f63f6074c61b0a45331_cgraph.map |    9 -
 ...2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5 |    1 -
 ...2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg |  101 -
 ...92cbfe73f63f6074c61b0a45331_cgraph_org.svg |   75 -
 ...fc6ee160142cd017f8c4b213437d0fd_cgraph.map |   11 -
 ...fc6ee160142cd017f8c4b213437d0fd_cgraph.md5 |    1 -
 ...fc6ee160142cd017f8c4b213437d0fd_cgraph.svg |  120 -
 ...e160142cd017f8c4b213437d0fd_cgraph_org.svg |   94 -
 ...ctdata__structures_1_1treap_1_1_treap.html |  249 +-
 ...e884d2686aff501ef589b0d1185492f_cgraph.map |   11 -
 ...e884d2686aff501ef589b0d1185492f_cgraph.md5 |    1 -
 ...e884d2686aff501ef589b0d1185492f_cgraph.svg |  180 --
 ...d2686aff501ef589b0d1185492f_cgraph_org.svg |   97 -
 ...a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.map |    9 -
 ...a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.md5 |    1 -
 ...a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.svg |  104 -
 ...a4f0c42fb8ed5b3368fba1a5f2c_cgraph_org.svg |   78 -
 ...5a48584a6560de20484fbba6229fd29_cgraph.map |    5 -
 ...5a48584a6560de20484fbba6229fd29_cgraph.md5 |    1 -
 ...5a48584a6560de20484fbba6229fd29_cgraph.svg |   67 -
 ...584a6560de20484fbba6229fd29_cgraph_org.svg |   41 -
 ...a77d22f97add119123108211c6655ec_cgraph.map |    4 -
 ...a77d22f97add119123108211c6655ec_cgraph.md5 |    1 -
 ...a77d22f97add119123108211c6655ec_cgraph.svg |   57 -
 ...22f97add119123108211c6655ec_cgraph_org.svg |   31 -
 ...ea2becd904e2e7d22f23a001b444469_cgraph.map |   11 -
 ...ea2becd904e2e7d22f23a001b444469_cgraph.md5 |    1 -
 ...ea2becd904e2e7d22f23a001b444469_cgraph.svg |  180 --
 ...ecd904e2e7d22f23a001b444469_cgraph_org.svg |   97 -
 ...2db3ad3aecc240011e0c8b8604d2c69_cgraph.map |    6 -
 ...2db3ad3aecc240011e0c8b8604d2c69_cgraph.md5 |    1 -
 ...2db3ad3aecc240011e0c8b8604d2c69_cgraph.svg |   76 -
 ...ad3aecc240011e0c8b8604d2c69_cgraph_org.svg |   50 -
 ...94e9d69305940f6d8804031455af039_cgraph.map |    6 -
 ...94e9d69305940f6d8804031455af039_cgraph.md5 |    1 -
 ...94e9d69305940f6d8804031455af039_cgraph.svg |   76 -
 ...d69305940f6d8804031455af039_cgraph_org.svg |   50 -
 ...08520c0617eb8dcfcbfa90d258aa6b2_cgraph.map |    4 -
 ...08520c0617eb8dcfcbfa90d258aa6b2_cgraph.md5 |    1 -
 ...08520c0617eb8dcfcbfa90d258aa6b2_cgraph.svg |   57 -
 ...0c0617eb8dcfcbfa90d258aa6b2_cgraph_org.svg |   31 -
 ...b4bb0db68c7c04ef9498c88c3777887_cgraph.map |    9 -
 ...b4bb0db68c7c04ef9498c88c3777887_cgraph.md5 |    1 -
 ...b4bb0db68c7c04ef9498c88c3777887_cgraph.svg |  104 -
 ...0db68c7c04ef9498c88c3777887_cgraph_org.svg |   78 -
 d5/d96/md5_8cpp.html                          |  261 +-
 ...341431cef7fcfc33794326e1deb2425_cgraph.map |   21 -
 ...341431cef7fcfc33794326e1deb2425_cgraph.md5 |    1 -
 ...341431cef7fcfc33794326e1deb2425_cgraph.svg |  209 --
 ...31cef7fcfc33794326e1deb2425_cgraph_org.svg |  183 --
 ...94712c9665051ba52b686387b87a689_cgraph.map |    7 -
 ...94712c9665051ba52b686387b87a689_cgraph.md5 |    1 -
 ...94712c9665051ba52b686387b87a689_cgraph.svg |   83 -
 ...2c9665051ba52b686387b87a689_cgraph_org.svg |   57 -
 ...be48c1e6e742f9bd329f501d61dcaef_cgraph.map |    7 -
 ...be48c1e6e742f9bd329f501d61dcaef_cgraph.md5 |    1 -
 ...be48c1e6e742f9bd329f501d61dcaef_cgraph.svg |   83 -
 ...c1e6e742f9bd329f501d61dcaef_cgraph_org.svg |   57 -
 ...8705fab5f92adf3427b4cf76ff33edb_cgraph.map |   26 -
 ...8705fab5f92adf3427b4cf76ff33edb_cgraph.md5 |    1 -
 ...8705fab5f92adf3427b4cf76ff33edb_cgraph.svg |  311 --
 ...fab5f92adf3427b4cf76ff33edb_cgraph_org.svg |  228 --
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    7 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   83 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   57 -
 ...ee69c6136a841043f956de32116e348_cgraph.map |    4 -
 ...ee69c6136a841043f956de32116e348_cgraph.md5 |    1 -
 ...ee69c6136a841043f956de32116e348_cgraph.svg |   56 -
 ...c6136a841043f956de32116e348_cgraph_org.svg |   30 -
 ...9e1a11f44135b890dd10a00e73b5661_cgraph.map |    9 -
 ...9e1a11f44135b890dd10a00e73b5661_cgraph.md5 |    1 -
 ...9e1a11f44135b890dd10a00e73b5661_cgraph.svg |  101 -
 ...11f44135b890dd10a00e73b5661_cgraph_org.svg |   75 -
 ...d2bf982d5dd64a45d13cba52c2b371d_cgraph.map |    4 -
 ...d2bf982d5dd64a45d13cba52c2b371d_cgraph.md5 |    1 -
 ...d2bf982d5dd64a45d13cba52c2b371d_cgraph.svg |   56 -
 ...982d5dd64a45d13cba52c2b371d_cgraph_org.svg |   30 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   16 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  164 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  138 -
 ...8e96bde0183c4b0a7ff04668f11e446_cgraph.map |    4 -
 ...8e96bde0183c4b0a7ff04668f11e446_cgraph.md5 |    1 -
 ...8e96bde0183c4b0a7ff04668f11e446_cgraph.svg |   56 -
 ...bde0183c4b0a7ff04668f11e446_cgraph_org.svg |   30 -
 d5/d96/md5_8cpp_source.html                   |  443 +++
 d5/da1/structnode.html                        |  274 +-
 d5/da7/namespacejarvis.html                   |   35 +-
 ...ta__structures_1_1list__array_1_1list.html |  153 +-
 ...33635ad53bd89e3947ca02448819180_cgraph.map |    5 -
 ...33635ad53bd89e3947ca02448819180_cgraph.md5 |    1 -
 ...33635ad53bd89e3947ca02448819180_cgraph.svg |   66 -
 ...5ad53bd89e3947ca02448819180_cgraph_org.svg |   40 -
 ...12bdb3910181f3c384d86aee7e217cf_cgraph.map |    4 -
 ...12bdb3910181f3c384d86aee7e217cf_cgraph.md5 |    1 -
 ...12bdb3910181f3c384d86aee7e217cf_cgraph.svg |   57 -
 ...b3910181f3c384d86aee7e217cf_cgraph_org.svg |   31 -
 d5/db0/adaline__learning_8cpp.html            |  188 +-
 ...79f7488a305f2571f2932b319931f82_cgraph.map |   29 -
 ...79f7488a305f2571f2932b319931f82_cgraph.md5 |    1 -
 ...79f7488a305f2571f2932b319931f82_cgraph.svg |  341 --
 ...488a305f2571f2932b319931f82_cgraph_org.svg |  258 --
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map |   50 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 |    1 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg |  527 ----
 ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg |  444 ---
 ...2053d88ea1bcbbed9aca67ab4eeb499_cgraph.map |   27 -
 ...2053d88ea1bcbbed9aca67ab4eeb499_cgraph.md5 |    1 -
 ...2053d88ea1bcbbed9aca67ab4eeb499_cgraph.svg |  323 --
 ...d88ea1bcbbed9aca67ab4eeb499_cgraph_org.svg |  240 --
 ...92bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.map |   29 -
 ...92bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.md5 |    1 -
 ...92bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.svg |  341 --
 ...f1fdb0b9d414bcf7981d2d87aa9_cgraph_org.svg |  258 --
 d5/db0/adaline__learning_8cpp_source.html     |  449 +++
 ...1inorder__traversal__of__bst_1_1_node.html |  111 +-
 d5/db5/set__kth__bit_8cpp.html                |   75 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 d5/db5/set__kth__bit_8cpp_source.html         |  184 ++
 d5/db8/namespacemincoins__topdown.html        |   35 +-
 ...data__structures_1_1_node__coll__graph.map |    4 +-
 ...data__structures_1_1_node__coll__graph.md5 |    2 +-
 ...data__structures_1_1_node__coll__graph.svg |    4 +-
 ...__structures_1_1_node__coll__graph_org.svg |    4 +-
 d5/dc5/morrisinorder_8cpp_source.html         |  244 ++
 ...ries_1_1per_seg_tree_1_1_node-members.html |   35 +-
 d5/dd0/namespacephysics.html                  |   37 +-
 d5/ddb/bogo__sort_8cpp.html                   |  102 +-
 ...1a3968e7947464bee7714f6d43b7002_cgraph.map |   20 -
 ...1a3968e7947464bee7714f6d43b7002_cgraph.md5 |    1 -
 ...1a3968e7947464bee7714f6d43b7002_cgraph.svg |  201 --
 ...68e7947464bee7714f6d43b7002_cgraph_org.svg |  175 --
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   24 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  237 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  211 --
 d5/ddb/bogo__sort_8cpp_source.html            |  228 ++
 ...others_1_1_cache_1_1_d___node-members.html |   35 +-
 d5/ddf/struct_btree-members.html              |   35 +-
 d5/de0/classuint128__t-members.html           |   35 +-
 d5/de2/structtower-members.html               |   35 +-
 ...lgorithms_1_1_binary_addition-members.html |   35 +-
 ...sgraph_1_1topological__sort_1_1_graph.html |  114 +-
 ...7036210706a45b9363563252393a345_cgraph.map |    5 -
 ...7036210706a45b9363563252393a345_cgraph.md5 |    1 -
 ...7036210706a45b9363563252393a345_cgraph.svg |   66 -
 ...210706a45b9363563252393a345_cgraph_org.svg |   40 -
 d5/def/stairs__pattern_8cpp.html              |   65 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 d5/def/stairs__pattern_8cpp_source.html       |  162 +
 ...multiplication_1_1_matrix__coll__graph.map |    2 +-
 ...multiplication_1_1_matrix__coll__graph.md5 |    2 +-
 ...multiplication_1_1_matrix__coll__graph.svg |    2 +-
 ...iplication_1_1_matrix__coll__graph_org.svg |    2 +-
 d5/df4/merge__sort_8cpp.html                  |   41 +-
 d5/df4/merge__sort_8cpp_source.html           |  208 ++
 d5/df6/check__amicable__pair_8cpp.html        |   67 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |    9 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |  101 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   75 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   11 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  119 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   93 -
 d5/df6/check__amicable__pair_8cpp_source.html |  194 ++
 d6/d02/file__linter_8py_source.html           |  176 ++
 ...queue__using__array_1_1_queue___array.html |  109 +-
 ...aaf88c9954ef3ab686f8e4bfbd87622_cgraph.map |    5 -
 ...aaf88c9954ef3ab686f8e4bfbd87622_cgraph.md5 |    1 -
 ...aaf88c9954ef3ab686f8e4bfbd87622_cgraph.svg |   67 -
 ...8c9954ef3ab686f8e4bfbd87622_cgraph_org.svg |   41 -
 ...dc64488c36f84d927365fa8d1933663_cgraph.map |    5 -
 ...dc64488c36f84d927365fa8d1933663_cgraph.md5 |    1 -
 ...dc64488c36f84d927365fa8d1933663_cgraph.svg |   67 -
 ...488c36f84d927365fa8d1933663_cgraph_org.svg |   41 -
 ...88b7ea064739ea9fa66bf64bf4ae631_cgraph.map |    5 -
 ...88b7ea064739ea9fa66bf64bf4ae631_cgraph.md5 |    1 -
 ...88b7ea064739ea9fa66bf64bf4ae631_cgraph.svg |   67 -
 ...ea064739ea9fa66bf64bf4ae631_cgraph_org.svg |   41 -
 d6/d05/reverse__a__linked__list_8cpp.html     |   96 +-
 ...f80d9712cc7d77399dcacb4c2917511_cgraph.map |    4 -
 ...f80d9712cc7d77399dcacb4c2917511_cgraph.md5 |    1 -
 ...f80d9712cc7d77399dcacb4c2917511_cgraph.svg |   57 -
 ...9712cc7d77399dcacb4c2917511_cgraph_org.svg |   31 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   18 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  187 --
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  161 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   20 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  205 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  179 --
 .../reverse__a__linked__list_8cpp_source.html |  400 +++
 d6/d0c/namespacehashing.html                  |   43 +-
 d6/d10/cut__rod_8cpp.html                     |  100 +-
 ...cc523a30c18c63eac58220c3c494cfa_cgraph.map |    6 -
 ...cc523a30c18c63eac58220c3c494cfa_cgraph.md5 |    1 -
 ...cc523a30c18c63eac58220c3c494cfa_cgraph.svg |   75 -
 ...3a30c18c63eac58220c3c494cfa_cgraph_org.svg |   49 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 d6/d10/cut__rod_8cpp_source.html              |  220 ++
 d6/d1a/dnf__sort_8cpp.html                    |  131 +-
 ...21767fe711db64fe57a2ac4987b11f0_cgraph.map |    8 -
 ...21767fe711db64fe57a2ac4987b11f0_cgraph.md5 |    1 -
 ...21767fe711db64fe57a2ac4987b11f0_cgraph.svg |   93 -
 ...7fe711db64fe57a2ac4987b11f0_cgraph_org.svg |   67 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   11 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  119 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   93 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   13 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  137 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  111 -
 d6/d1a/dnf__sort_8cpp_source.html             |  224 ++
 d6/d1f/class_complex-members.html             |   35 +-
 d6/d26/classciphers_1_1_hill_cipher.html      |  281 +-
 ...eb58750b978a93ac5e6eb29e3e570b7_cgraph.map |    7 -
 ...eb58750b978a93ac5e6eb29e3e570b7_cgraph.md5 |    1 -
 ...eb58750b978a93ac5e6eb29e3e570b7_cgraph.svg |   84 -
 ...750b978a93ac5e6eb29e3e570b7_cgraph_org.svg |   58 -
 ...05b0a28d66a61239d3565d5256f9cb5_cgraph.map |   40 -
 ...05b0a28d66a61239d3565d5256f9cb5_cgraph.md5 |    1 -
 ...05b0a28d66a61239d3565d5256f9cb5_cgraph.svg |  442 ---
 ...a28d66a61239d3565d5256f9cb5_cgraph_org.svg |  359 ---
 ...27acfac1dbff3f48a2b071d449d965b_cgraph.map |   17 -
 ...27acfac1dbff3f48a2b071d449d965b_cgraph.md5 |    1 -
 ...27acfac1dbff3f48a2b071d449d965b_cgraph.svg |  177 --
 ...fac1dbff3f48a2b071d449d965b_cgraph_org.svg |  151 -
 ...29be41c1ab78850963e4ce14e1d11d9_cgraph.map |    5 -
 ...29be41c1ab78850963e4ce14e1d11d9_cgraph.md5 |    1 -
 ...29be41c1ab78850963e4ce14e1d11d9_cgraph.svg |   66 -
 ...41c1ab78850963e4ce14e1d11d9_cgraph_org.svg |   40 -
 ...42f70fb54cb50b00fb6df7c3f2b120e_cgraph.map |   15 -
 ...42f70fb54cb50b00fb6df7c3f2b120e_cgraph.md5 |    1 -
 ...42f70fb54cb50b00fb6df7c3f2b120e_cgraph.svg |  157 -
 ...0fb54cb50b00fb6df7c3f2b120e_cgraph_org.svg |  131 -
 ...16d0313141499d16f57c0c107f04395_cgraph.map |   14 -
 ...16d0313141499d16f57c0c107f04395_cgraph.md5 |    1 -
 ...16d0313141499d16f57c0c107f04395_cgraph.svg |  148 -
 ...313141499d16f57c0c107f04395_cgraph_org.svg |  122 -
 ...760f3665651a0a37937c79c62f219c0_cgraph.map |    5 -
 ...760f3665651a0a37937c79c62f219c0_cgraph.md5 |    1 -
 ...760f3665651a0a37937c79c62f219c0_cgraph.svg |   65 -
 ...3665651a0a37937c79c62f219c0_cgraph_org.svg |   39 -
 ...8bbb6e4a5749f6008b06602d5103917_cgraph.map |   17 -
 ...8bbb6e4a5749f6008b06602d5103917_cgraph.md5 |    1 -
 ...8bbb6e4a5749f6008b06602d5103917_cgraph.svg |  177 --
 ...6e4a5749f6008b06602d5103917_cgraph_org.svg |  151 -
 ...02c7563889bf1e363deb8e21967b706_cgraph.map |   22 -
 ...02c7563889bf1e363deb8e21967b706_cgraph.md5 |    1 -
 ...02c7563889bf1e363deb8e21967b706_cgraph.svg |  277 --
 ...563889bf1e363deb8e21967b706_cgraph_org.svg |  194 --
 ...36cbcc7a458b3f3a2af0c4aa1126590_cgraph.map |    7 -
 ...36cbcc7a458b3f3a2af0c4aa1126590_cgraph.md5 |    1 -
 ...36cbcc7a458b3f3a2af0c4aa1126590_cgraph.svg |   84 -
 ...cc7a458b3f3a2af0c4aa1126590_cgraph_org.svg |   58 -
 ...667fa0860977f6d6d443fa1dbcd80aa_cgraph.map |   15 -
 ...667fa0860977f6d6d443fa1dbcd80aa_cgraph.md5 |    1 -
 ...667fa0860977f6d6d443fa1dbcd80aa_cgraph.svg |  158 -
 ...a0860977f6d6d443fa1dbcd80aa_cgraph_org.svg |  132 -
 ...77cad522fa44b8c985779a7188d2f41_cgraph.map |    5 -
 ...77cad522fa44b8c985779a7188d2f41_cgraph.md5 |    1 -
 ...77cad522fa44b8c985779a7188d2f41_cgraph.svg |   66 -
 ...d522fa44b8c985779a7188d2f41_cgraph_org.svg |   40 -
 d6/d26/house__robber_8cpp.html                |  119 +-
 ...e497c3e3f169afe5baaae6a5d40cbc8_cgraph.map |    6 -
 ...e497c3e3f169afe5baaae6a5d40cbc8_cgraph.md5 |    1 -
 ...e497c3e3f169afe5baaae6a5d40cbc8_cgraph.svg |   75 -
 ...c3e3f169afe5baaae6a5d40cbc8_cgraph_org.svg |   49 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    7 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   83 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   57 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  101 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   75 -
 d6/d26/house__robber_8cpp_source.html         |  227 ++
 ...search__tree_1_1bst__node__coll__graph.map |    2 +-
 ...search__tree_1_1bst__node__coll__graph.md5 |    2 +-
 ...search__tree_1_1bst__node__coll__graph.svg |    2 +-
 ...ch__tree_1_1bst__node__coll__graph_org.svg |    2 +-
 d6/d2c/caesar__cipher_8cpp.html               |  114 +-
 ...1a3968e7947464bee7714f6d43b7002_cgraph.map |    5 -
 ...1a3968e7947464bee7714f6d43b7002_cgraph.md5 |    1 -
 ...1a3968e7947464bee7714f6d43b7002_cgraph.svg |   65 -
 ...68e7947464bee7714f6d43b7002_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 d6/d2c/caesar__cipher_8cpp_source.html        |  219 ++
 d6/d2d/modular__inverse__simple_8cpp.html     |   80 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 .../modular__inverse__simple_8cpp_source.html |  184 ++
 d6/d2e/fenwick__tree_8cpp.html                |   71 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |   12 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |  189 --
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |  106 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   14 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  207 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  124 -
 d6/d2e/fenwick__tree_8cpp_source.html         |  228 ++
 d6/d30/classmachine__learning_1_1adaline.html |  274 +-
 ...acbe32aaab897e7939e5b0454035b8c_cgraph.map |    7 -
 ...acbe32aaab897e7939e5b0454035b8c_cgraph.md5 |    1 -
 ...acbe32aaab897e7939e5b0454035b8c_cgraph.svg |   84 -
 ...32aaab897e7939e5b0454035b8c_cgraph_org.svg |   58 -
 ...4e3c6c037b67895014414c5d75465e5_cgraph.map |   23 -
 ...4e3c6c037b67895014414c5d75465e5_cgraph.md5 |    1 -
 ...4e3c6c037b67895014414c5d75465e5_cgraph.svg |  287 --
 ...6c037b67895014414c5d75465e5_cgraph_org.svg |  204 --
 ...d61f9ed872eef26bca39388cbda6a91_cgraph.map |   26 -
 ...d61f9ed872eef26bca39388cbda6a91_cgraph.md5 |    1 -
 ...d61f9ed872eef26bca39388cbda6a91_cgraph.svg |  314 --
 ...9ed872eef26bca39388cbda6a91_cgraph_org.svg |  231 --
 ...11242d9ad5b03a75911e29b04f78fd3_cgraph.map |   19 -
 ...11242d9ad5b03a75911e29b04f78fd3_cgraph.md5 |    1 -
 ...11242d9ad5b03a75911e29b04f78fd3_cgraph.svg |  194 --
 ...2d9ad5b03a75911e29b04f78fd3_cgraph_org.svg |  168 -
 ...8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.map |    7 -
 ...8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.md5 |    1 -
 ...8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.svg |   84 -
 ...2aaaa63b0f27ea176857e1e7d56_cgraph_org.svg |   58 -
 d6/d38/find__non__repeating__number_8cpp.html |   78 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 ...d__non__repeating__number_8cpp_source.html |  196 ++
 d6/d42/miller__rabin_8cpp.html                |  145 +-
 ...f9c31c1047aa3191676d64571d4c506_cgraph.map |   17 -
 ...f9c31c1047aa3191676d64571d4c506_cgraph.md5 |    1 -
 ...f9c31c1047aa3191676d64571d4c506_cgraph.svg |  173 --
 ...1c1047aa3191676d64571d4c506_cgraph_org.svg |  147 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.map |   23 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 |    1 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.svg |  284 --
 ...ad42717780d6caaff9d3d6977f9_cgraph_org.svg |  201 --
 ...01288288ef5ebe8e97414cc30797cce_cgraph.map |   19 -
 ...01288288ef5ebe8e97414cc30797cce_cgraph.md5 |    1 -
 ...01288288ef5ebe8e97414cc30797cce_cgraph.svg |  248 --
 ...8288ef5ebe8e97414cc30797cce_cgraph_org.svg |  165 -
 ...6c2c67ea416d0e80003a88623f98b29_cgraph.map |    9 -
 ...6c2c67ea416d0e80003a88623f98b29_cgraph.md5 |    1 -
 ...6c2c67ea416d0e80003a88623f98b29_cgraph.svg |  101 -
 ...67ea416d0e80003a88623f98b29_cgraph_org.svg |   75 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   25 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  302 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  219 --
 d6/d42/miller__rabin_8cpp_source.html         |  283 ++
 ...iptic__curve__key__exchange_1_1_point.html |   90 +-
 ...__queries_1_1per_seg_tree__coll__graph.map |   22 +-
 ...__queries_1_1per_seg_tree__coll__graph.md5 |    2 +-
 ...__queries_1_1per_seg_tree__coll__graph.svg |   91 +-
 ...eries_1_1per_seg_tree__coll__graph_org.svg |   93 +-
 d6/d4a/addition__rule_8cpp.html               |   68 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  101 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   75 -
 d6/d4a/addition__rule_8cpp_source.html        |  170 +
 d6/d4e/easter_8cpp_source.html                |  251 ++
 d6/d4e/namespaceciphers.html                  |   45 +-
 ...ath_2iterative_factorial_8cpp-example.html |  127 +-
 d6/d53/namespaceword__break.html              |   35 +-
 d6/d57/array__right__rotation_8cpp.html       |   77 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   15 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  155 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  129 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   17 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  173 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  147 -
 .../array__right__rotation_8cpp_source.html   |  265 ++
 d6/d60/group__ode.html                        |  208 +-
 ...95d23bbdfcb80e83c9cda45c9ad5723_cgraph.map |    5 -
 ...95d23bbdfcb80e83c9cda45c9ad5723_cgraph.md5 |    1 -
 ...95d23bbdfcb80e83c9cda45c9ad5723_cgraph.svg |   65 -
 ...3bbdfcb80e83c9cda45c9ad5723_cgraph_org.svg |   39 -
 ...6ff0710861ca39d957046c0b09b2985_cgraph.map |   17 -
 ...6ff0710861ca39d957046c0b09b2985_cgraph.md5 |    1 -
 ...6ff0710861ca39d957046c0b09b2985_cgraph.svg |  173 --
 ...710861ca39d957046c0b09b2985_cgraph_org.svg |  147 -
 ...874d294ab00fe9ce8731c5b7991a089_cgraph.map |   17 -
 ...874d294ab00fe9ce8731c5b7991a089_cgraph.md5 |    1 -
 ...874d294ab00fe9ce8731c5b7991a089_cgraph.svg |  173 --
 ...294ab00fe9ce8731c5b7991a089_cgraph_org.svg |  147 -
 ...27bf009831ddc477c5fa8891d5cb35f_cgraph.map |    5 -
 ...27bf009831ddc477c5fa8891d5cb35f_cgraph.md5 |    1 -
 ...27bf009831ddc477c5fa8891d5cb35f_cgraph.svg |   65 -
 ...009831ddc477c5fa8891d5cb35f_cgraph_org.svg |   39 -
 ...c319db420c3d97a83e9dcca803b6812_cgraph.map |    5 -
 ...c319db420c3d97a83e9dcca803b6812_cgraph.md5 |    1 -
 ...c319db420c3d97a83e9dcca803b6812_cgraph.svg |   65 -
 ...db420c3d97a83e9dcca803b6812_cgraph_org.svg |   39 -
 ...0509f8843e2bc42de2abbd00a14b7b9_cgraph.map |   17 -
 ...0509f8843e2bc42de2abbd00a14b7b9_cgraph.md5 |    1 -
 ...0509f8843e2bc42de2abbd00a14b7b9_cgraph.svg |  173 --
 ...f8843e2bc42de2abbd00a14b7b9_cgraph_org.svg |  147 -
 d6/d74/library__sort_8cpp_source.html         |  232 ++
 d6/d74/namespacekadane.html                   |   35 +-
 d6/d7a/golden__search__extrema_8cpp.html      |  194 +-
 ...283886819c7c140a023582b7269e2d0_cgraph.map |   13 -
 ...283886819c7c140a023582b7269e2d0_cgraph.md5 |    1 -
 ...283886819c7c140a023582b7269e2d0_cgraph.svg |  138 -
 ...86819c7c140a023582b7269e2d0_cgraph_org.svg |  112 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.map |   11 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 |    1 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg |  120 -
 ...7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg |   94 -
 ...aa76a6d5fd4d333f9072beff1dc486b_cgraph.map |    9 -
 ...aa76a6d5fd4d333f9072beff1dc486b_cgraph.md5 |    1 -
 ...aa76a6d5fd4d333f9072beff1dc486b_cgraph.svg |  102 -
 ...a6d5fd4d333f9072beff1dc486b_cgraph_org.svg |   76 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.map |   13 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.md5 |    1 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.svg |  138 -
 ...5dd5c30adda100e95f0423c786e_cgraph_org.svg |  112 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   23 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  228 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  202 --
 .../golden__search__extrema_8cpp_source.html  |  267 ++
 d6/d80/double__hash__hash__table_8cpp.html    |  139 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   41 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  447 ---
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  364 ---
 ...double__hash__hash__table_8cpp_source.html |  412 +++
 d6/d84/classhashing_1_1sha256_1_1_hash.html   |  105 +-
 ...896c27ac39c780e0ee62417fdd0b9d3_cgraph.map |    8 -
 ...896c27ac39c780e0ee62417fdd0b9d3_cgraph.md5 |    1 -
 ...896c27ac39c780e0ee62417fdd0b9d3_cgraph.svg |   94 -
 ...27ac39c780e0ee62417fdd0b9d3_cgraph_org.svg |   68 -
 ...581f503a263d8e928e5716d54477e08_cgraph.map |   11 -
 ...581f503a263d8e928e5716d54477e08_cgraph.md5 |    1 -
 ...581f503a263d8e928e5716d54477e08_cgraph.svg |  120 -
 ...503a263d8e928e5716d54477e08_cgraph_org.svg |   94 -
 d6/d84/namespaceutils.html                    |   35 +-
 d6/d8d/namespacemorse.html                    |   35 +-
 d6/d9d/large__factorial_8cpp.html             |  132 +-
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.map |   15 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 |    1 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg |  155 -
 ...224851353fc92bfbff6f499fa97_cgraph_org.svg |  129 -
 ...f93b60e229b6683e24c4754a7106ee8_cgraph.map |    5 -
 ...f93b60e229b6683e24c4754a7106ee8_cgraph.md5 |    1 -
 ...f93b60e229b6683e24c4754a7106ee8_cgraph.svg |   65 -
 ...60e229b6683e24c4754a7106ee8_cgraph_org.svg |   39 -
 ...6aae4778fbe89a3d59fd61fbc050cfa_cgraph.map |    5 -
 ...6aae4778fbe89a3d59fd61fbc050cfa_cgraph.md5 |    1 -
 ...6aae4778fbe89a3d59fd61fbc050cfa_cgraph.svg |   65 -
 ...4778fbe89a3d59fd61fbc050cfa_cgraph_org.svg |   39 -
 d6/d9d/large__factorial_8cpp_source.html      |  246 ++
 ...1_ay_star_search_1_1_info__coll__graph.map |    2 +-
 ...1_ay_star_search_1_1_info__coll__graph.md5 |    2 +-
 ...1_ay_star_search_1_1_info__coll__graph.svg |    2 +-
 ..._star_search_1_1_info__coll__graph_org.svg |    2 +-
 d6/da2/namespacevigenere.html                 |   35 +-
 d6/da9/odd__even__sort_8cpp_source.html       |  191 ++
 d6/dab/namespacetree__234.html                |   35 +-
 ...sothers_1_1lru__cache_1_1_l_r_u_cache.html |  204 +-
 ...dbf04bf7e1472c48639694f0b110602_cgraph.map |   21 -
 ...dbf04bf7e1472c48639694f0b110602_cgraph.md5 |    1 -
 ...dbf04bf7e1472c48639694f0b110602_cgraph.svg |  212 --
 ...4bf7e1472c48639694f0b110602_cgraph_org.svg |  186 --
 ...d506b1c1a3cd5b93cc7e497626bfb53_cgraph.map |    5 -
 ...d506b1c1a3cd5b93cc7e497626bfb53_cgraph.md5 |    1 -
 ...d506b1c1a3cd5b93cc7e497626bfb53_cgraph.svg |   66 -
 ...b1c1a3cd5b93cc7e497626bfb53_cgraph_org.svg |   40 -
 d6/db0/binomial__dist_8cpp.html               |  130 +-
 ...9ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.map |    7 -
 ...9ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.md5 |    1 -
 ...9ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.svg |   83 -
 ...a6a2bd200fd1eb0e31b2bf4cc76_cgraph_org.svg |   57 -
 ...6ed6ce71415fb400b65f0656cef3d25_cgraph.map |    7 -
 ...6ed6ce71415fb400b65f0656cef3d25_cgraph.md5 |    1 -
 ...6ed6ce71415fb400b65f0656cef3d25_cgraph.svg |   83 -
 ...ce71415fb400b65f0656cef3d25_cgraph_org.svg |   57 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   24 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  236 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  210 --
 ...09e51f513cee647d41192ab0a872cdc_cgraph.map |    7 -
 ...09e51f513cee647d41192ab0a872cdc_cgraph.md5 |    1 -
 ...09e51f513cee647d41192ab0a872cdc_cgraph.svg |   83 -
 ...1f513cee647d41192ab0a872cdc_cgraph_org.svg |   57 -
 d6/db0/binomial__dist_8cpp_source.html        |  212 ++
 ...ata__structures_1_1_skip_list-members.html |   35 +-
 d6/db8/inv__sqrt_8cpp.html                    |  121 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    9 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  101 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   75 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   15 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  155 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  129 -
 d6/db8/inv__sqrt_8cpp_source.html             |  215 ++
 d6/dba/jump__game_8cpp.html                   |   83 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    7 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   84 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   58 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  102 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   76 -
 d6/dba/jump__game_8cpp_source.html            |  178 ++
 ..._queries_1_1fenwick__tree__coll__graph.map |    2 +-
 ..._queries_1_1fenwick__tree__coll__graph.md5 |    2 +-
 ..._queries_1_1fenwick__tree__coll__graph.svg |    2 +-
 ...ries_1_1fenwick__tree__coll__graph_org.svg |    2 +-
 ..._1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html |  117 +-
 d6/dc9/classcatalan__numbers-members.html     |   35 +-
 d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html       |   35 +-
 ..._1topological__sort_1_1_graph-members.html |   35 +-
 d6/dce/rabin__karp_8cpp.html                  |   77 +-
 d6/dce/rabin__karp_8cpp_source.html           |  226 ++
 d6/dd3/ode__midpoint__euler_8cpp.html         |  134 +-
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.map |   33 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 |    1 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg |  317 --
 ...224851353fc92bfbff6f499fa97_cgraph_org.svg |  291 --
 ...13517b8e5de1b75592052db7f7e237f_cgraph.map |   17 -
 ...13517b8e5de1b75592052db7f7e237f_cgraph.md5 |    1 -
 ...13517b8e5de1b75592052db7f7e237f_cgraph.svg |  173 --
 ...7b8e5de1b75592052db7f7e237f_cgraph_org.svg |  147 -
 ...3adf7b092a87868917ee5fb4255192b_cgraph.map |    7 -
 ...3adf7b092a87868917ee5fb4255192b_cgraph.md5 |    1 -
 ...3adf7b092a87868917ee5fb4255192b_cgraph.svg |   83 -
 ...7b092a87868917ee5fb4255192b_cgraph_org.svg |   57 -
 d6/dd3/ode__midpoint__euler_8cpp_source.html  |  281 ++
 d6/dd6/namespacestring.html                   |   41 +-
 d6/dd8/is__graph__bipartite_8cpp.html         |   89 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    9 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  103 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   77 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   11 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  121 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   95 -
 d6/dd8/is__graph__bipartite_8cpp_source.html  |  250 ++
 ...al_3_01uint128__t_01_4__inherit__graph.map |    2 +-
 ...al_3_01uint128__t_01_4__inherit__graph.md5 |    2 +-
 ...al_3_01uint128__t_01_4__inherit__graph.svg |    2 +-
 ..._01uint128__t_01_4__inherit__graph_org.svg |    2 +-
 ...ssdata__structures_1_1_bitset-members.html |   35 +-
 d7/d00/list__array_8cpp.html                  |   71 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   13 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  141 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  115 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   15 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  159 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  133 -
 d7/d00/list__array_8cpp_source.html           |  364 +++
 d7/d07/bidirectional__dijkstra_8cpp.html      |  334 +-
 ...b2df3d52a403ad46523ab90d3a723c1_cgraph.map |   11 -
 ...b2df3d52a403ad46523ab90d3a723c1_cgraph.md5 |    1 -
 ...b2df3d52a403ad46523ab90d3a723c1_cgraph.svg |  122 -
 ...3d52a403ad46523ab90d3a723c1_cgraph_org.svg |   96 -
 ...2f1b7277e1dd4190f25014b48487ce6_cgraph.map |    4 -
 ...2f1b7277e1dd4190f25014b48487ce6_cgraph.md5 |    1 -
 ...2f1b7277e1dd4190f25014b48487ce6_cgraph.svg |   58 -
 ...7277e1dd4190f25014b48487ce6_cgraph_org.svg |   32 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |    5 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |   65 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   39 -
 ...9172365aebde9be1997157f6f80e0cf_cgraph.map |    6 -
 ...9172365aebde9be1997157f6f80e0cf_cgraph.md5 |    1 -
 ...9172365aebde9be1997157f6f80e0cf_cgraph.svg |   75 -
 ...365aebde9be1997157f6f80e0cf_cgraph_org.svg |   49 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    8 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   92 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   66 -
 .../bidirectional__dijkstra_8cpp_source.html  |  359 +++
 d7/d08/namespacegraph__coloring.html          |   35 +-
 d7/d0a/namespacetrie__using__hashmap.html     |   35 +-
 ..._structures_1_1_skip_list__coll__graph.map |    4 +-
 ..._structures_1_1_skip_list__coll__graph.md5 |    2 +-
 ..._structures_1_1_skip_list__coll__graph.svg |    4 +-
 ...uctures_1_1_skip_list__coll__graph_org.svg |    4 +-
 d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html     |   35 +-
 d7/d21/classstack__linked_list-members.html   |   35 +-
 .../nqueen__print__all__solutions_8cpp.html   |  102 +-
 ...bd5e11fab6dab282efccfb61beb0bd9_cgraph.map |    5 -
 ...bd5e11fab6dab282efccfb61beb0bd9_cgraph.md5 |    1 -
 ...bd5e11fab6dab282efccfb61beb0bd9_cgraph.svg |   66 -
 ...11fab6dab282efccfb61beb0bd9_cgraph_org.svg |   40 -
 ...en__print__all__solutions_8cpp_source.html |  209 ++
 d7/d31/classqueue__coll__graph.map            |   10 +-
 d7/d31/classqueue__coll__graph.md5            |    2 +-
 d7/d31/classqueue__coll__graph.svg            |   39 +-
 d7/d31/classqueue__coll__graph_org.svg        |   39 +-
 d7/d35/matrix__exponentiation_8cpp.html       |  168 +-
 ...02a9fc90e79b05b863cc4efa26ae2ec_cgraph.map |    6 -
 ...02a9fc90e79b05b863cc4efa26ae2ec_cgraph.md5 |    1 -
 ...02a9fc90e79b05b863cc4efa26ae2ec_cgraph.svg |   74 -
 ...fc90e79b05b863cc4efa26ae2ec_cgraph_org.svg |   48 -
 ...8389ed58fd0ec66df248014775ad1fa_cgraph.map |    8 -
 ...8389ed58fd0ec66df248014775ad1fa_cgraph.md5 |    1 -
 ...8389ed58fd0ec66df248014775ad1fa_cgraph.svg |   92 -
 ...ed58fd0ec66df248014775ad1fa_cgraph_org.svg |   66 -
 .../matrix__exponentiation_8cpp_source.html   |  251 ++
 d7/d37/magic__sequence_8cpp_source.html       |  237 ++
 ...__with__tarjan__algorithm_8cpp_source.html |  224 ++
 ...etravelling_salesman__bitmanipulation.html |   35 +-
 d7/d40/class_solution__coll__graph.map        |    6 +-
 d7/d40/class_solution__coll__graph.md5        |    2 +-
 d7/d40/class_solution__coll__graph.svg        |    6 +-
 d7/d40/class_solution__coll__graph_org.svg    |    6 +-
 d7/d43/stack__using__queue_8cpp_source.html   |  222 ++
 d7/d47/namespace_x_o_r.html                   |   35 +-
 ...d_1_1is__integral_3_01uint256__t_01_4.html |   42 +-
 ...tructgeometry_1_1grahamscan_1_1_point.html |   77 +-
 d7/d4c/namespacek__nearest__neighbors.html    |   35 +-
 d7/d50/namespacemodular__inverse__fermat.html |   35 +-
 d7/d56/count__bits__flip_8cpp.html            |   82 +-
 ...548486b6c3b80101e768562e687ef7b_cgraph.map |    4 -
 ...548486b6c3b80101e768562e687ef7b_cgraph.md5 |    1 -
 ...548486b6c3b80101e768562e687ef7b_cgraph.svg |   57 -
 ...86b6c3b80101e768562e687ef7b_cgraph_org.svg |   31 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 d7/d56/count__bits__flip_8cpp_source.html     |  193 ++
 ...longest__increasing__subsequence_8cpp.html |   91 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    9 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  101 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   75 -
 ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.map |   13 -
 ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5 |    1 -
 ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg |  137 -
 ...b7e6f15df4b525a2e7705ba3089_cgraph_org.svg |  111 -
 ...__increasing__subsequence_8cpp_source.html |  205 ++
 ...etwork_1_1_neural_network__coll__graph.map |   10 +-
 ...etwork_1_1_neural_network__coll__graph.md5 |    2 +-
 ...etwork_1_1_neural_network__coll__graph.svg |   10 +-
 ...rk_1_1_neural_network__coll__graph_org.svg |   10 +-
 ...ures_1_1linked__list_1_1_node-members.html |   35 +-
 ...uctures_1_1tree__234_1_1_node-members.html |   35 +-
 .../shortest__common__supersequence_8cpp.html |  127 +-
 ...2ee8d7e67da9f6eb85146b08dad95e6_cgraph.map |   16 -
 ...2ee8d7e67da9f6eb85146b08dad95e6_cgraph.md5 |    1 -
 ...2ee8d7e67da9f6eb85146b08dad95e6_cgraph.svg |  165 -
 ...d7e67da9f6eb85146b08dad95e6_cgraph_org.svg |  139 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 ...st__common__supersequence_8cpp_source.html |  293 ++
 d7/d6a/bisection__method_8cpp.html            |  107 +-
 ...003b5b2dcfff0769b957ab5c968b03d_cgraph.map |    5 -
 ...003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 |    1 -
 ...003b5b2dcfff0769b957ab5c968b03d_cgraph.svg |   65 -
 ...5b2dcfff0769b957ab5c968b03d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   11 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  119 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   93 -
 d7/d6a/bisection__method_8cpp_source.html     |  204 ++
 d7/d73/abbreviation_8cpp.html                 |  154 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...d60b8858720bf217df22d992d0fefaa_cgraph.map |    8 -
 ...d60b8858720bf217df22d992d0fefaa_cgraph.md5 |    1 -
 ...d60b8858720bf217df22d992d0fefaa_cgraph.svg |   94 -
 ...8858720bf217df22d992d0fefaa_cgraph_org.svg |   68 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 ...53b2f647bee9c5b75ef8dd9ef685dc8_cgraph.map |    7 -
 ...53b2f647bee9c5b75ef8dd9ef685dc8_cgraph.md5 |    1 -
 ...53b2f647bee9c5b75ef8dd9ef685dc8_cgraph.svg |   84 -
 ...f647bee9c5b75ef8dd9ef685dc8_cgraph_org.svg |   58 -
 d7/d73/abbreviation_8cpp_source.html          |  263 ++
 d7/d75/postfix__evaluation_8cpp.html          |  148 +-
 ...c27f949c9d6659be9f5bd2ccbe1360a_cgraph.map |   11 -
 ...c27f949c9d6659be9f5bd2ccbe1360a_cgraph.md5 |    1 -
 ...c27f949c9d6659be9f5bd2ccbe1360a_cgraph.svg |  120 -
 ...949c9d6659be9f5bd2ccbe1360a_cgraph_org.svg |   94 -
 ...9fd597e0ea394abe027ced4d2ea3338_cgraph.map |    8 -
 ...9fd597e0ea394abe027ced4d2ea3338_cgraph.md5 |    1 -
 ...9fd597e0ea394abe027ced4d2ea3338_cgraph.svg |   94 -
 ...97e0ea394abe027ced4d2ea3338_cgraph_org.svg |   68 -
 ...38bd3a177a6d61da3859a281233bbe1_cgraph.map |   13 -
 ...38bd3a177a6d61da3859a281233bbe1_cgraph.md5 |    1 -
 ...38bd3a177a6d61da3859a281233bbe1_cgraph.svg |  140 -
 ...3a177a6d61da3859a281233bbe1_cgraph_org.svg |  114 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 d7/d75/postfix__evaluation_8cpp_source.html   |  279 ++
 ...igned_3_01uint256__t_01_4__coll__graph.map |    2 +-
 ...igned_3_01uint256__t_01_4__coll__graph.md5 |    2 +-
 ...igned_3_01uint256__t_01_4__coll__graph.svg |    2 +-
 ...d_3_01uint256__t_01_4__coll__graph_org.svg |    2 +-
 d7/d77/class_edge.html                        |  139 +-
 d7/d7a/namespacebinomial.html                 |   35 +-
 .../classstatistics_1_1stats__computer1.html  |  186 +-
 ...57e942d49f4fd70f059f224b4ac07e1_cgraph.map |    7 -
 ...57e942d49f4fd70f059f224b4ac07e1_cgraph.md5 |    1 -
 ...57e942d49f4fd70f059f224b4ac07e1_cgraph.svg |   84 -
 ...42d49f4fd70f059f224b4ac07e1_cgraph_org.svg |   58 -
 d7/d7f/section.html                           |   35 +-
 d7/d81/namespacebit__manipulation.html        |   41 +-
 d7/d83/trie__tree_8cpp.html                   |   65 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 d7/d83/trie__tree_8cpp_source.html            |  318 ++
 d7/d85/doubly__linked__list_8cpp_source.html  |  280 ++
 d7/d88/namespaceprefix__sum__array.html       |   35 +-
 d7/d89/double__factorial_8cpp.html            |  112 +-
 ...8ba20fed2ce427f6469c7689437829d_cgraph.map |    4 -
 ...8ba20fed2ce427f6469c7689437829d_cgraph.md5 |    1 -
 ...8ba20fed2ce427f6469c7689437829d_cgraph.svg |   56 -
 ...0fed2ce427f6469c7689437829d_cgraph_org.svg |   30 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.map |   16 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 |    1 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.svg |  223 --
 ...ad42717780d6caaff9d3d6977f9_cgraph_org.svg |  140 -
 ...bbcebf3a2d0c67f4c3cfb5511a97981_cgraph.map |    8 -
 ...bbcebf3a2d0c67f4c3cfb5511a97981_cgraph.md5 |    1 -
 ...bbcebf3a2d0c67f4c3cfb5511a97981_cgraph.svg |   92 -
 ...bf3a2d0c67f4c3cfb5511a97981_cgraph_org.svg |   66 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   18 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  241 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  158 -
 d7/d89/double__factorial_8cpp_source.html     |  196 ++
 d7/da4/struct_list_node.html                  |  122 +-
 d7/da6/eratosthenes_8cpp.html                 |  102 +-
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.map |   26 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 |    1 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg |  255 --
 ...224851353fc92bfbff6f499fa97_cgraph_org.svg |  229 --
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   11 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  119 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   93 -
 d7/da6/eratosthenes_8cpp_source.html          |  230 ++
 ...t__size__of__linked__list_8cpp_source.html |  191 ++
 ...gs_1_1boyer__moore_1_1pattern-members.html |   35 +-
 ...al_3_01uint256__t_01_4__inherit__graph.map |    2 +-
 ...al_3_01uint256__t_01_4__inherit__graph.md5 |    2 +-
 ...al_3_01uint256__t_01_4__inherit__graph.svg |    2 +-
 ..._01uint256__t_01_4__inherit__graph_org.svg |    2 +-
 d7/daf/namespace_knapsack.html                |   35 +-
 ...search_1_1_ay_star_search__coll__graph.map |    4 +-
 ...search_1_1_ay_star_search__coll__graph.md5 |    2 +-
 ...search_1_1_ay_star_search__coll__graph.svg |    4 +-
 ...ch_1_1_ay_star_search__coll__graph_org.svg |    4 +-
 ...res_1_1tree__234_1_1_node__coll__graph.map |   14 +-
 ...res_1_1tree__234_1_1_node__coll__graph.md5 |    2 +-
 ...res_1_1tree__234_1_1_node__coll__graph.svg |   51 +-
 ...1_1tree__234_1_1_node__coll__graph_org.svg |   51 +-
 d7/db9/hill__cipher_8cpp.html                 |  182 +-
 ...4391124480d2a49f2dec900237b0712_cgraph.map |   66 -
 ...4391124480d2a49f2dec900237b0712_cgraph.md5 |    1 -
 ...4391124480d2a49f2dec900237b0712_cgraph.svg |  681 ----
 ...124480d2a49f2dec900237b0712_cgraph_org.svg |  598 ----
 ...147ad576f8a94a2a6b66948672b452b_cgraph.map |   63 -
 ...147ad576f8a94a2a6b66948672b452b_cgraph.md5 |    1 -
 ...147ad576f8a94a2a6b66948672b452b_cgraph.svg |  654 ----
 ...d576f8a94a2a6b66948672b452b_cgraph_org.svg |  571 ----
 ...4bfcd756610834acac501f9eea1e2eb_cgraph.map |   13 -
 ...4bfcd756610834acac501f9eea1e2eb_cgraph.md5 |    1 -
 ...4bfcd756610834acac501f9eea1e2eb_cgraph.svg |  137 -
 ...d756610834acac501f9eea1e2eb_cgraph_org.svg |  111 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   40 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  380 ---
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  354 ---
 d7/db9/hill__cipher_8cpp_source.html          |  567 ++++
 d7/dba/cll_8h_source.html                     |   39 +-
 ...k__nearest__neighbors_1_1_knn-members.html |   35 +-
 ...metic_3_01uint128__t_01_4__coll__graph.map |    2 +-
 ...metic_3_01uint128__t_01_4__coll__graph.md5 |    2 +-
 ...metic_3_01uint128__t_01_4__coll__graph.svg |    2 +-
 ...c_3_01uint128__t_01_4__coll__graph_org.svg |    2 +-
 d7/ded/queue_8hpp_source.html                 |  136 +-
 d7/def/trie__multiple__search_8cpp.html       |   80 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.map |    7 -
 ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5 |    1 -
 ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg |   83 -
 ...b7e6f15df4b525a2e7705ba3089_cgraph_org.svg |   57 -
 .../trie__multiple__search_8cpp_source.html   |  545 ++++
 ...ve__tree__traversals_1_1_node-members.html |   35 +-
 d8/d01/struct_item-members.html               |   35 +-
 d8/d10/structlist.html                        |   88 +-
 d8/d13/bubble__sort_8cpp.html                 |  146 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    9 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  101 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   75 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   11 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  119 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   93 -
 ...3b12930a83915712461d53fe9659686_cgraph.map |    7 -
 ...3b12930a83915712461d53fe9659686_cgraph.md5 |    1 -
 ...3b12930a83915712461d53fe9659686_cgraph.svg |   84 -
 ...930a83915712461d53fe9659686_cgraph_org.svg |   58 -
 d8/d13/bubble__sort_8cpp_source.html          |  213 ++
 d8/d14/namespacen__queens__optimized.html     |   35 +-
 d8/d1d/namespacestrand.html                   |   35 +-
 d8/d20/classuint256__t-members.html           |   35 +-
 ...l__network_1_1_neural_network-members.html |   35 +-
 .../classrange__queries_1_1per_seg_tree.html  |  243 +-
 ...cec4b77d264521717cf9b0482c45817_cgraph.map |    5 -
 ...cec4b77d264521717cf9b0482c45817_cgraph.md5 |    1 -
 ...cec4b77d264521717cf9b0482c45817_cgraph.svg |   66 -
 ...b77d264521717cf9b0482c45817_cgraph_org.svg |   40 -
 ...fe4e431f3e09c274ecd7d2d58dcb865_cgraph.map |    5 -
 ...fe4e431f3e09c274ecd7d2d58dcb865_cgraph.md5 |    1 -
 ...fe4e431f3e09c274ecd7d2d58dcb865_cgraph.svg |   66 -
 ...431f3e09c274ecd7d2d58dcb865_cgraph_org.svg |   40 -
 ...4487eda25123bc4d112e8430821a6c6_cgraph.map |   12 -
 ...4487eda25123bc4d112e8430821a6c6_cgraph.md5 |    1 -
 ...4487eda25123bc4d112e8430821a6c6_cgraph.svg |  188 --
 ...eda25123bc4d112e8430821a6c6_cgraph_org.svg |  105 -
 ...d3f2465a7c5803a1ff16c5378bcc5e4_cgraph.map |    6 -
 ...d3f2465a7c5803a1ff16c5378bcc5e4_cgraph.md5 |    1 -
 ...d3f2465a7c5803a1ff16c5378bcc5e4_cgraph.svg |   75 -
 ...465a7c5803a1ff16c5378bcc5e4_cgraph_org.svg |   49 -
 ...83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph.map |   14 -
 ...83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph.md5 |    1 -
 ...83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph.svg |  148 -
 ...abf5a8db8b0d8d156a4c1bcd4c3_cgraph_org.svg |  122 -
 ...e7f57935b3bb9446f11c239fd89ae79_cgraph.map |    7 -
 ...e7f57935b3bb9446f11c239fd89ae79_cgraph.md5 |    1 -
 ...e7f57935b3bb9446f11c239fd89ae79_cgraph.svg |   85 -
 ...7935b3bb9446f11c239fd89ae79_cgraph_org.svg |   59 -
 ...484002bcb701820d55f32ea5d525571_cgraph.map |   12 -
 ...484002bcb701820d55f32ea5d525571_cgraph.md5 |    1 -
 ...484002bcb701820d55f32ea5d525571_cgraph.svg |  189 --
 ...02bcb701820d55f32ea5d525571_cgraph_org.svg |  106 -
 ...8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.map |   10 -
 ...8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.md5 |    1 -
 ...8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.svg |  170 -
 ...b1835e5e8aec32f68c5059ed4d4_cgraph_org.svg |   87 -
 ...87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.map |   18 -
 ...87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.md5 |    1 -
 ...87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.svg |  243 --
 ...4e6cf012d28c4f5b9d1c15f9c5d_cgraph_org.svg |  160 -
 d8/d2a/namespacea1z26.html                    |   35 +-
 ...classothers_1_1_cache_1_1_l_r_u_cache.html |  244 +-
 ...ee34fcee480f21bb6f68a34f0f69b45_cgraph.map |   10 -
 ...ee34fcee480f21bb6f68a34f0f69b45_cgraph.md5 |    1 -
 ...ee34fcee480f21bb6f68a34f0f69b45_cgraph.svg |  113 -
 ...fcee480f21bb6f68a34f0f69b45_cgraph_org.svg |   87 -
 ...1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.map |    7 -
 ...1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.md5 |    1 -
 ...1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.svg |   85 -
 ...357ecc7c34144f3d9a63c6cb3ea_cgraph_org.svg |   59 -
 ...022d494b40f82417340b113445e79a4_cgraph.map |    5 -
 ...022d494b40f82417340b113445e79a4_cgraph.md5 |    1 -
 ...022d494b40f82417340b113445e79a4_cgraph.svg |   67 -
 ...494b40f82417340b113445e79a4_cgraph_org.svg |   41 -
 ...ed__list__using__recusion_8cpp_source.html |  204 ++
 d8/d36/namespacecut__rod.html                 |   35 +-
 d8/d38/structquery-members.html               |   35 +-
 ...ructures_1_1_bloom_filter__coll__graph.map |   21 +-
 ...ructures_1_1_bloom_filter__coll__graph.md5 |    2 +-
 ...ructures_1_1_bloom_filter__coll__graph.svg |  103 +-
 ...ures_1_1_bloom_filter__coll__graph_org.svg |  103 +-
 d8/d41/namespacegames_1_1memory__game.html    |  191 +-
 ...ceeea62d8fa6c563e2c66359fd73413_cgraph.map |   30 -
 ...ceeea62d8fa6c563e2c66359fd73413_cgraph.md5 |    1 -
 ...ceeea62d8fa6c563e2c66359fd73413_cgraph.svg |  297 --
 ...a62d8fa6c563e2c66359fd73413_cgraph_org.svg |  271 --
 ...714d97649c0edd57b4fb449799676a3_cgraph.map |   10 -
 ...714d97649c0edd57b4fb449799676a3_cgraph.md5 |    1 -
 ...714d97649c0edd57b4fb449799676a3_cgraph.svg |  114 -
 ...97649c0edd57b4fb449799676a3_cgraph_org.svg |   88 -
 ...573c8ae66ab66156d03e5e81bbba214_cgraph.map |   13 -
 ...573c8ae66ab66156d03e5e81bbba214_cgraph.md5 |    1 -
 ...573c8ae66ab66156d03e5e81bbba214_cgraph.svg |  138 -
 ...8ae66ab66156d03e5e81bbba214_cgraph_org.svg |  112 -
 ...c62ebb75853446656e24932bdc6dd6b_cgraph.map |   10 -
 ...c62ebb75853446656e24932bdc6dd6b_cgraph.md5 |    1 -
 ...c62ebb75853446656e24932bdc6dd6b_cgraph.svg |  114 -
 ...bb75853446656e24932bdc6dd6b_cgraph_org.svg |   88 -
 ...inverse__fermat__little__theorem_8cpp.html |  112 +-
 ...c62a87e79f29b98d8fe5b12eacdd928_cgraph.map |    6 -
 ...c62a87e79f29b98d8fe5b12eacdd928_cgraph.md5 |    1 -
 ...c62a87e79f29b98d8fe5b12eacdd928_cgraph.svg |   75 -
 ...87e79f29b98d8fe5b12eacdd928_cgraph_org.svg |   49 -
 ...a4929409fee35c3cb559e962a544b3e_cgraph.map |    4 -
 ...a4929409fee35c3cb559e962a544b3e_cgraph.md5 |    1 -
 ...a4929409fee35c3cb559e962a544b3e_cgraph.svg |   57 -
 ...9409fee35c3cb559e962a544b3e_cgraph_org.svg |   31 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 ...7e807e02c65c6fffd6162b4c66290c2_cgraph.map |   10 -
 ...7e807e02c65c6fffd6162b4c66290c2_cgraph.md5 |    1 -
 ...7e807e02c65c6fffd6162b4c66290c2_cgraph.svg |  112 -
 ...7e02c65c6fffd6162b4c66290c2_cgraph_org.svg |   86 -
 ...__fermat__little__theorem_8cpp_source.html |  215 ++
 d8/d55/class_cycle_check-members.html         |   35 +-
 d8/d61/class_trie__coll__graph.map            |    2 +-
 d8/d61/class_trie__coll__graph.md5            |    2 +-
 d8/d61/class_trie__coll__graph.svg            |    2 +-
 d8/d61/class_trie__coll__graph_org.svg        |    2 +-
 d8/d61/radix__sort2_8cpp.html                 |  130 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |    9 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |  101 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   75 -
 ...8ead7d43b11505398daf9a894f122f9_cgraph.map |    6 -
 ...8ead7d43b11505398daf9a894f122f9_cgraph.md5 |    1 -
 ...8ead7d43b11505398daf9a894f122f9_cgraph.svg |   75 -
 ...7d43b11505398daf9a894f122f9_cgraph_org.svg |   49 -
 ...0cfd94fa3765b53d4ec7893ffaee5f8_cgraph.map |   13 -
 ...0cfd94fa3765b53d4ec7893ffaee5f8_cgraph.md5 |    1 -
 ...0cfd94fa3765b53d4ec7893ffaee5f8_cgraph.svg |  139 -
 ...94fa3765b53d4ec7893ffaee5f8_cgraph_org.svg |  113 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   11 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  119 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   93 -
 d8/d61/radix__sort2_8cpp_source.html          |  218 ++
 ...paceboruvkas__minimum__spanning__tree.html |   35 +-
 d8/d68/dijkstra_8cpp.html                     |  142 +-
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.map |   21 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 |    1 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.svg |  211 --
 ...ad42717780d6caaff9d3d6977f9_cgraph_org.svg |  185 --
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   26 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  256 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  230 --
 d8/d68/dijkstra_8cpp_source.html              |  270 ++
 d8/d69/classgraph_1_1_h_k_graph.html          |  254 +-
 ...b49011c09cf90a116ab53bef61cd95a_cgraph.map |    5 -
 ...b49011c09cf90a116ab53bef61cd95a_cgraph.md5 |    1 -
 ...b49011c09cf90a116ab53bef61cd95a_cgraph.svg |   65 -
 ...11c09cf90a116ab53bef61cd95a_cgraph_org.svg |   39 -
 ...491add14d9fc04f679114ca6d6f0f93_cgraph.map |    5 -
 ...491add14d9fc04f679114ca6d6f0f93_cgraph.md5 |    1 -
 ...491add14d9fc04f679114ca6d6f0f93_cgraph.svg |   65 -
 ...dd14d9fc04f679114ca6d6f0f93_cgraph_org.svg |   39 -
 ...dbda80d02bdc26c3e8ff7330c9be75d_cgraph.map |   11 -
 ...dbda80d02bdc26c3e8ff7330c9be75d_cgraph.md5 |    1 -
 ...dbda80d02bdc26c3e8ff7330c9be75d_cgraph.svg |  120 -
 ...80d02bdc26c3e8ff7330c9be75d_cgraph_org.svg |   94 -
 ...794950cb3407b6b47d3dc986cf714c0_cgraph.map |    6 -
 ...794950cb3407b6b47d3dc986cf714c0_cgraph.md5 |    1 -
 ...794950cb3407b6b47d3dc986cf714c0_cgraph.svg |   74 -
 ...50cb3407b6b47d3dc986cf714c0_cgraph_org.svg |   48 -
 d8/d6c/line__segment__intersection_8cpp.html  |   72 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 ...ne__segment__intersection_8cpp_source.html |  228 ++
 d8/d72/class_r_btree.html                     |  225 +-
 d8/d76/morse__code_8cpp.html                  |  182 +-
 ...242e458904de8a242fcdaffe9e3ba1a_cgraph.map |   10 -
 ...242e458904de8a242fcdaffe9e3ba1a_cgraph.md5 |    1 -
 ...242e458904de8a242fcdaffe9e3ba1a_cgraph.svg |  111 -
 ...458904de8a242fcdaffe9e3ba1a_cgraph_org.svg |   85 -
 ...5c66ec8cf4cef0a35c50cbab86965dc_cgraph.map |   16 -
 ...5c66ec8cf4cef0a35c50cbab86965dc_cgraph.md5 |    1 -
 ...5c66ec8cf4cef0a35c50cbab86965dc_cgraph.svg |  165 -
 ...ec8cf4cef0a35c50cbab86965dc_cgraph_org.svg |  139 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...31773fd11555d21f70d6914138d9535_cgraph.map |    8 -
 ...31773fd11555d21f70d6914138d9535_cgraph.md5 |    1 -
 ...31773fd11555d21f70d6914138d9535_cgraph.svg |   93 -
 ...3fd11555d21f70d6914138d9535_cgraph_org.svg |   67 -
 ...9f294b0dec08a4a11d477a32f9bd829_cgraph.map |    8 -
 ...9f294b0dec08a4a11d477a32f9bd829_cgraph.md5 |    1 -
 ...9f294b0dec08a4a11d477a32f9bd829_cgraph.svg |   93 -
 ...4b0dec08a4a11d477a32f9bd829_cgraph_org.svg |   67 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 d8/d76/morse__code_8cpp_source.html           |  380 +++
 d8/d76/namespacetopological__sort.html        |   35 +-
 d8/d77/namespacemachine__learning.html        |  683 ++--
 ...42f435bca0839e721fc1574a61e8da3_cgraph.map |   25 -
 ...42f435bca0839e721fc1574a61e8da3_cgraph.md5 |    1 -
 ...42f435bca0839e721fc1574a61e8da3_cgraph.svg |  304 --
 ...35bca0839e721fc1574a61e8da3_cgraph_org.svg |  221 --
 ...cc29566568e0383dd7d374068cbe6b3_cgraph.map |   15 -
 ...cc29566568e0383dd7d374068cbe6b3_cgraph.md5 |    1 -
 ...cc29566568e0383dd7d374068cbe6b3_cgraph.svg |  156 -
 ...566568e0383dd7d374068cbe6b3_cgraph_org.svg |  130 -
 ...466857dab977a49f117029835b3b6d2_cgraph.map |   15 -
 ...466857dab977a49f117029835b3b6d2_cgraph.md5 |    1 -
 ...466857dab977a49f117029835b3b6d2_cgraph.svg |  156 -
 ...57dab977a49f117029835b3b6d2_cgraph_org.svg |  130 -
 ...0480fccfb39de20ca47f1bf51ecb6ec_cgraph.map |   21 -
 ...0480fccfb39de20ca47f1bf51ecb6ec_cgraph.md5 |    1 -
 ...0480fccfb39de20ca47f1bf51ecb6ec_cgraph.svg |  210 --
 ...fccfb39de20ca47f1bf51ecb6ec_cgraph_org.svg |  184 --
 ...342906d42b80fc6b6b3ad17bf00fcb9_cgraph.map |   15 -
 ...342906d42b80fc6b6b3ad17bf00fcb9_cgraph.md5 |    1 -
 ...342906d42b80fc6b6b3ad17bf00fcb9_cgraph.svg |  156 -
 ...06d42b80fc6b6b3ad17bf00fcb9_cgraph_org.svg |  130 -
 ...4bf1f3c43271a5fc93101f6ae2e6269_cgraph.map |    7 -
 ...4bf1f3c43271a5fc93101f6ae2e6269_cgraph.md5 |    1 -
 ...4bf1f3c43271a5fc93101f6ae2e6269_cgraph.svg |   83 -
 ...f3c43271a5fc93101f6ae2e6269_cgraph_org.svg |   57 -
 ...4260cb1be9b63d6e38107000ac4b7e7_cgraph.map |    7 -
 ...4260cb1be9b63d6e38107000ac4b7e7_cgraph.md5 |    1 -
 ...4260cb1be9b63d6e38107000ac4b7e7_cgraph.svg |   83 -
 ...cb1be9b63d6e38107000ac4b7e7_cgraph_org.svg |   57 -
 ...9fde571b38f9483576594f66572958a_cgraph.map |   13 -
 ...9fde571b38f9483576594f66572958a_cgraph.md5 |    1 -
 ...9fde571b38f9483576594f66572958a_cgraph.svg |  138 -
 ...571b38f9483576594f66572958a_cgraph_org.svg |  112 -
 ...4bbf61e65f8cd297255fa94b983d078_cgraph.map |    9 -
 ...4bbf61e65f8cd297255fa94b983d078_cgraph.md5 |    1 -
 ...4bbf61e65f8cd297255fa94b983d078_cgraph.svg |  102 -
 ...61e65f8cd297255fa94b983d078_cgraph_org.svg |   76 -
 ...6aac06ccf128b0a9c55c9ee1a8e5631_cgraph.map |   17 -
 ...6aac06ccf128b0a9c55c9ee1a8e5631_cgraph.md5 |    1 -
 ...6aac06ccf128b0a9c55c9ee1a8e5631_cgraph.svg |  174 --
 ...06ccf128b0a9c55c9ee1a8e5631_cgraph_org.svg |  148 -
 ...72a53c88203fde278f1fe6c3afe5b07_cgraph.map |   17 -
 ...72a53c88203fde278f1fe6c3afe5b07_cgraph.md5 |    1 -
 ...72a53c88203fde278f1fe6c3afe5b07_cgraph.svg |  174 --
 ...3c88203fde278f1fe6c3afe5b07_cgraph_org.svg |  148 -
 ...ee7b35403af3612222d3b7a53074905_cgraph.map |    5 -
 ...ee7b35403af3612222d3b7a53074905_cgraph.md5 |    1 -
 ...ee7b35403af3612222d3b7a53074905_cgraph.svg |   67 -
 ...35403af3612222d3b7a53074905_cgraph_org.svg |   41 -
 ...332d152078e96311e43ac5e7183ea26_cgraph.map |   19 -
 ...332d152078e96311e43ac5e7183ea26_cgraph.md5 |    1 -
 ...332d152078e96311e43ac5e7183ea26_cgraph.svg |  193 --
 ...152078e96311e43ac5e7183ea26_cgraph_org.svg |  167 -
 ...43d294e21a0c4fa33c53757df054576_cgraph.map |   25 -
 ...43d294e21a0c4fa33c53757df054576_cgraph.md5 |    1 -
 ...43d294e21a0c4fa33c53757df054576_cgraph.svg |  303 --
 ...94e21a0c4fa33c53757df054576_cgraph_org.svg |  220 --
 ...afa3e62b686aebdbad81c4f89913f43_cgraph.map |   15 -
 ...afa3e62b686aebdbad81c4f89913f43_cgraph.md5 |    1 -
 ...afa3e62b686aebdbad81c4f89913f43_cgraph.svg |  157 -
 ...e62b686aebdbad81c4f89913f43_cgraph_org.svg |  131 -
 ...868ad43698a1d69ba46ea3827d7d2c3_cgraph.map |   23 -
 ...868ad43698a1d69ba46ea3827d7d2c3_cgraph.md5 |    1 -
 ...868ad43698a1d69ba46ea3827d7d2c3_cgraph.svg |  228 --
 ...d43698a1d69ba46ea3827d7d2c3_cgraph_org.svg |  202 --
 ...4986b23760039711848155739c31b35_cgraph.map |    5 -
 ...4986b23760039711848155739c31b35_cgraph.md5 |    1 -
 ...4986b23760039711848155739c31b35_cgraph.svg |   65 -
 ...b23760039711848155739c31b35_cgraph_org.svg |   39 -
 ...801bf30591ca6b2c38ff4fed0ded23f_cgraph.map |   15 -
 ...801bf30591ca6b2c38ff4fed0ded23f_cgraph.md5 |    1 -
 ...801bf30591ca6b2c38ff4fed0ded23f_cgraph.svg |  157 -
 ...f30591ca6b2c38ff4fed0ded23f_cgraph_org.svg |  131 -
 d8/d7a/sha1_8cpp.html                         |  192 +-
 ...397f2444a05e4d1487c67e215410d3c_cgraph.map |    5 -
 ...397f2444a05e4d1487c67e215410d3c_cgraph.md5 |    1 -
 ...397f2444a05e4d1487c67e215410d3c_cgraph.svg |   65 -
 ...2444a05e4d1487c67e215410d3c_cgraph_org.svg |   39 -
 ...be3471f7e489d7d0df42b97a48bf141_cgraph.map |    7 -
 ...be3471f7e489d7d0df42b97a48bf141_cgraph.md5 |    1 -
 ...be3471f7e489d7d0df42b97a48bf141_cgraph.svg |   83 -
 ...71f7e489d7d0df42b97a48bf141_cgraph_org.svg |   57 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    7 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   83 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   57 -
 ...9e1a11f44135b890dd10a00e73b5661_cgraph.map |    9 -
 ...9e1a11f44135b890dd10a00e73b5661_cgraph.md5 |    1 -
 ...9e1a11f44135b890dd10a00e73b5661_cgraph.svg |  101 -
 ...11f44135b890dd10a00e73b5661_cgraph_org.svg |   75 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   16 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  164 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  138 -
 d8/d7a/sha1_8cpp_source.html                  |  389 +++
 ...linked__list_1_1_circular_linked_list.html |  236 +-
 ...3a896b34d27fda69049827e0c4dab42_cgraph.map |    5 -
 ...3a896b34d27fda69049827e0c4dab42_cgraph.md5 |    1 -
 ...3a896b34d27fda69049827e0c4dab42_cgraph.svg |   67 -
 ...6b34d27fda69049827e0c4dab42_cgraph_org.svg |   41 -
 ...42fa439b102c6f86341f421ddcfe0a1_cgraph.map |   11 -
 ...42fa439b102c6f86341f421ddcfe0a1_cgraph.md5 |    1 -
 ...42fa439b102c6f86341f421ddcfe0a1_cgraph.svg |  184 --
 ...439b102c6f86341f421ddcfe0a1_cgraph_org.svg |  101 -
 ...b7bbb0918c261bc216aef9e6dd39aa4_cgraph.map |    9 -
 ...b7bbb0918c261bc216aef9e6dd39aa4_cgraph.md5 |    1 -
 ...b7bbb0918c261bc216aef9e6dd39aa4_cgraph.svg |  164 -
 ...b0918c261bc216aef9e6dd39aa4_cgraph_org.svg |   81 -
 ...6195fcf11b636064c7172cb74b55dd0_cgraph.map |    5 -
 ...6195fcf11b636064c7172cb74b55dd0_cgraph.md5 |    1 -
 ...6195fcf11b636064c7172cb74b55dd0_cgraph.svg |   69 -
 ...fcf11b636064c7172cb74b55dd0_cgraph_org.svg |   43 -
 ...3611ec1fef92eeeb875aea1bde1e4de_cgraph.map |    4 -
 ...3611ec1fef92eeeb875aea1bde1e4de_cgraph.md5 |    1 -
 ...3611ec1fef92eeeb875aea1bde1e4de_cgraph.svg |   58 -
 ...ec1fef92eeeb875aea1bde1e4de_cgraph_org.svg |   32 -
 ...cc37166f2f73763df39894b675f89c9_cgraph.map |   11 -
 ...cc37166f2f73763df39894b675f89c9_cgraph.md5 |    1 -
 ...cc37166f2f73763df39894b675f89c9_cgraph.svg |  184 --
 ...166f2f73763df39894b675f89c9_cgraph_org.svg |  101 -
 ...341901e926b3fa3a796c64ca572f592_cgraph.map |    4 -
 ...341901e926b3fa3a796c64ca572f592_cgraph.md5 |    1 -
 ...341901e926b3fa3a796c64ca572f592_cgraph.svg |   58 -
 ...01e926b3fa3a796c64ca572f592_cgraph_org.svg |   32 -
 ...38565472a07d07f63ec0d2fd8a69d4d_cgraph.map |    7 -
 ...38565472a07d07f63ec0d2fd8a69d4d_cgraph.md5 |    1 -
 ...38565472a07d07f63ec0d2fd8a69d4d_cgraph.svg |   87 -
 ...5472a07d07f63ec0d2fd8a69d4d_cgraph_org.svg |   61 -
 d8/d7c/radix__sort_8cpp_source.html           |  197 ++
 ...ruskals__minimum__spanning__tree_8cpp.html |  130 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    7 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   84 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   58 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  102 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   76 -
 ...__minimum__spanning__tree_8cpp_source.html |  292 ++
 d8/d88/namespaceset_kth_bit.html              |   35 +-
 d8/d89/namespacelinear__probing.html          |  293 +-
 ...6680b8a37d442c2f208faa286e33908_cgraph.map |   24 -
 ...6680b8a37d442c2f208faa286e33908_cgraph.md5 |    1 -
 ...6680b8a37d442c2f208faa286e33908_cgraph.svg |  294 --
 ...b8a37d442c2f208faa286e33908_cgraph_org.svg |  211 --
 ...6d34fd3511626a83ab00665d7bc34d1_cgraph.map |   17 -
 ...6d34fd3511626a83ab00665d7bc34d1_cgraph.md5 |    1 -
 ...6d34fd3511626a83ab00665d7bc34d1_cgraph.svg |  174 --
 ...fd3511626a83ab00665d7bc34d1_cgraph_org.svg |  148 -
 ...322209aaa91b7bbf16f96e1cc52b746_cgraph.map |   11 -
 ...322209aaa91b7bbf16f96e1cc52b746_cgraph.md5 |    1 -
 ...322209aaa91b7bbf16f96e1cc52b746_cgraph.svg |  120 -
 ...09aaa91b7bbf16f96e1cc52b746_cgraph_org.svg |   94 -
 ...a082dc1426a79f866cee6b370df37b0_cgraph.map |   17 -
 ...a082dc1426a79f866cee6b370df37b0_cgraph.md5 |    1 -
 ...a082dc1426a79f866cee6b370df37b0_cgraph.svg |  231 --
 ...dc1426a79f866cee6b370df37b0_cgraph_org.svg |  148 -
 ...5854f5aa216e61219154c62167ce8f0_cgraph.map |   21 -
 ...5854f5aa216e61219154c62167ce8f0_cgraph.md5 |    1 -
 ...5854f5aa216e61219154c62167ce8f0_cgraph.svg |  267 --
 ...f5aa216e61219154c62167ce8f0_cgraph_org.svg |  184 --
 ...cf8d033f8115f39f3c93cfb6cee0b28_cgraph.map |   14 -
 ...cf8d033f8115f39f3c93cfb6cee0b28_cgraph.md5 |    1 -
 ...cf8d033f8115f39f3c93cfb6cee0b28_cgraph.svg |  147 -
 ...033f8115f39f3c93cfb6cee0b28_cgraph_org.svg |  121 -
 ...87b71d810901fab69c4ad9d4d0fa635_cgraph.map |    5 -
 ...87b71d810901fab69c4ad9d4d0fa635_cgraph.md5 |    1 -
 ...87b71d810901fab69c4ad9d4d0fa635_cgraph.svg |   65 -
 ...1d810901fab69c4ad9d4d0fa635_cgraph_org.svg |   39 -
 d8/d8a/exponential__search_8cpp.html          |   75 +-
 ...06cedad209456eae95d37b7cd66acae_cgraph.map |    5 -
 ...06cedad209456eae95d37b7cd66acae_cgraph.md5 |    1 -
 ...06cedad209456eae95d37b7cd66acae_cgraph.svg |   65 -
 ...dad209456eae95d37b7cd66acae_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  101 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   75 -
 ...421bf4b7b95f20ac86c233adfdb9208_cgraph.map |    7 -
 ...421bf4b7b95f20ac86c233adfdb9208_cgraph.md5 |    1 -
 ...421bf4b7b95f20ac86c233adfdb9208_cgraph.svg |   83 -
 ...f4b7b95f20ac86c233adfdb9208_cgraph_org.svg |   57 -
 d8/d8a/exponential__search_8cpp_source.html   |  200 ++
 d8/d8e/struct_node-members.html               |   35 +-
 d8/d8f/bitonic__sort_8cpp_source.html         |  204 ++
 d8/d90/iterative__tree__traversals_8cpp.html  |  231 +-
 ...38b236fe900f7bb7e57164f5bed66c2_cgraph.map |   15 -
 ...38b236fe900f7bb7e57164f5bed66c2_cgraph.md5 |    1 -
 ...38b236fe900f7bb7e57164f5bed66c2_cgraph.svg |  157 -
 ...36fe900f7bb7e57164f5bed66c2_cgraph_org.svg |  131 -
 ...1d922dbb5905993960c6a7f0ba71ac0_cgraph.map |   15 -
 ...1d922dbb5905993960c6a7f0ba71ac0_cgraph.md5 |    1 -
 ...1d922dbb5905993960c6a7f0ba71ac0_cgraph.svg |  157 -
 ...2dbb5905993960c6a7f0ba71ac0_cgraph_org.svg |  131 -
 ...25c4c8520991999ee6dbe13d99b87f4_cgraph.map |   15 -
 ...25c4c8520991999ee6dbe13d99b87f4_cgraph.md5 |    1 -
 ...25c4c8520991999ee6dbe13d99b87f4_cgraph.svg |  157 -
 ...c8520991999ee6dbe13d99b87f4_cgraph_org.svg |  131 -
 ...9ef334cd7eb607f4eb8732566ea00b8_cgraph.map |   15 -
 ...9ef334cd7eb607f4eb8732566ea00b8_cgraph.md5 |    1 -
 ...9ef334cd7eb607f4eb8732566ea00b8_cgraph.svg |  157 -
 ...34cd7eb607f4eb8732566ea00b8_cgraph_org.svg |  131 -
 ...35ae2868441f8a11c965b87b2494f21_cgraph.map |   15 -
 ...35ae2868441f8a11c965b87b2494f21_cgraph.md5 |    1 -
 ...35ae2868441f8a11c965b87b2494f21_cgraph.svg |  157 -
 ...2868441f8a11c965b87b2494f21_cgraph_org.svg |  131 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   77 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  778 -----
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  695 -----
 ...727f920064f2b8f484b589b60d49b89_cgraph.map |   15 -
 ...727f920064f2b8f484b589b60d49b89_cgraph.md5 |    1 -
 ...727f920064f2b8f484b589b60d49b89_cgraph.svg |  157 -
 ...920064f2b8f484b589b60d49b89_cgraph_org.svg |  131 -
 ...erative__tree__traversals_8cpp_source.html |  493 +++
 d8/d93/namespacemagic__sequence.html          |   35 +-
 d8/d95/vector__ops_8hpp.html                  |   81 +-
 d8/d95/vector__ops_8hpp_source.html           |  523 ++--
 d8/d96/stack__using__array_8cpp_source.html   |  291 ++
 ..._tree__traversals_1_1_b_t__coll__graph.map |    8 +-
 ..._tree__traversals_1_1_b_t__coll__graph.md5 |    2 +-
 ..._tree__traversals_1_1_b_t__coll__graph.svg |   27 +-
 ...e__traversals_1_1_b_t__coll__graph_org.svg |   27 +-
 ...connected__components__with__dsu_8cpp.html |  157 +-
 ...69384d8a4197a9b24482ce7c321a85e_cgraph.map |    4 -
 ...69384d8a4197a9b24482ce7c321a85e_cgraph.md5 |    1 -
 ...69384d8a4197a9b24482ce7c321a85e_cgraph.svg |   57 -
 ...4d8a4197a9b24482ce7c321a85e_cgraph_org.svg |   31 -
 ...7cb7472f310a798f555fe45cdf50145_cgraph.map |    9 -
 ...7cb7472f310a798f555fe45cdf50145_cgraph.md5 |    1 -
 ...7cb7472f310a798f555fe45cdf50145_cgraph.svg |  103 -
 ...472f310a798f555fe45cdf50145_cgraph_org.svg |   77 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...2d6698b71384a352ec4b81b31b13141_cgraph.map |   11 -
 ...2d6698b71384a352ec4b81b31b13141_cgraph.md5 |    1 -
 ...2d6698b71384a352ec4b81b31b13141_cgraph.svg |  121 -
 ...98b71384a352ec4b81b31b13141_cgraph_org.svg |   95 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 ...91ed94113c56191b75fe45f688d6e62_cgraph.map |    4 -
 ...91ed94113c56191b75fe45f688d6e62_cgraph.md5 |    1 -
 ...91ed94113c56191b75fe45f688d6e62_cgraph.svg |   57 -
 ...94113c56191b75fe45f688d6e62_cgraph_org.svg |   31 -
 ...ed__components__with__dsu_8cpp_source.html |  224 ++
 d8/d9a/fast__fourier__transform_8cpp.html     |  114 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   10 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  111 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   85 -
 ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.map |   12 -
 ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5 |    1 -
 ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg |  129 -
 ...b7e6f15df4b525a2e7705ba3089_cgraph_org.svg |  103 -
 .../fast__fourier__transform_8cpp_source.html |  265 ++
 d8/d9c/union__of__two__arrays_8cpp.html       |   81 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   23 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  227 --
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  201 --
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   25 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  245 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  219 --
 .../union__of__two__arrays_8cpp_source.html   |  306 ++
 d8/d9f/namespacesudoku__solver.html           |   35 +-
 ...ru__cache_1_1_l_r_u_cache__coll__graph.map |   15 +-
 ...ru__cache_1_1_l_r_u_cache__coll__graph.md5 |    2 +-
 ...ru__cache_1_1_l_r_u_cache__coll__graph.svg |  150 +-
 ...cache_1_1_l_r_u_cache__coll__graph_org.svg |   91 +-
 d8/da7/namespacedepth__first__search.html     |   35 +-
 .../classstatistics_1_1stats__computer2.html  |  186 +-
 ...f2e84df4fc386bb3295016ef8fd156e_cgraph.map |    7 -
 ...f2e84df4fc386bb3295016ef8fd156e_cgraph.md5 |    1 -
 ...f2e84df4fc386bb3295016ef8fd156e_cgraph.svg |   84 -
 ...4df4fc386bb3295016ef8fd156e_cgraph_org.svg |   58 -
 d8/dab/sparse__table_8cpp.html                |  126 +-
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.map |   13 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 |    1 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg |  137 -
 ...224851353fc92bfbff6f499fa97_cgraph_org.svg |  111 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   11 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  119 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   93 -
 d8/dab/sparse__table_8cpp_source.html         |  242 ++
 d8/db1/binomial__calculate_8cpp.html          |   91 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |    5 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |   65 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   39 -
 ...e407a2a13362c4c64fbe509ff325978_cgraph.map |    4 -
 ...e407a2a13362c4c64fbe509ff325978_cgraph.md5 |    1 -
 ...e407a2a13362c4c64fbe509ff325978_cgraph.svg |   56 -
 ...a2a13362c4c64fbe509ff325978_cgraph_org.svg |   30 -
 ...0f2228420376f4db7e1274f2b41667c_cgraph.map |    8 -
 ...0f2228420376f4db7e1274f2b41667c_cgraph.md5 |    1 -
 ...0f2228420376f4db7e1274f2b41667c_cgraph.svg |   92 -
 ...28420376f4db7e1274f2b41667c_cgraph_org.svg |   66 -
 d8/db1/binomial__calculate_8cpp_source.html   |  207 ++
 ...ueue__using__linked__list_8cpp_source.html |  210 ++
 d8/db9/structcompare-members.html             |   35 +-
 d8/db9/topological__sort_8cpp.html            |  161 +-
 ...4dc5d7914958dbd24dda2fd862dc41b_cgraph.map |   10 -
 ...4dc5d7914958dbd24dda2fd862dc41b_cgraph.md5 |    1 -
 ...4dc5d7914958dbd24dda2fd862dc41b_cgraph.svg |  111 -
 ...d7914958dbd24dda2fd862dc41b_cgraph_org.svg |   85 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    9 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  103 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   77 -
 ...cbcaa2bb70af0a11d0c090ea1796aea_cgraph.map |    5 -
 ...cbcaa2bb70af0a11d0c090ea1796aea_cgraph.md5 |    1 -
 ...cbcaa2bb70af0a11d0c090ea1796aea_cgraph.svg |   66 -
 ...a2bb70af0a11d0c090ea1796aea_cgraph_org.svg |   40 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   11 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  121 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   95 -
 d8/db9/topological__sort_8cpp_source.html     |  285 ++
 ...sing__array_1_1_queue___array-members.html |   35 +-
 d8/dc6/namespacemanacher.html                 |   35 +-
 d8/dc8/class_compare-members.html             |   35 +-
 d8/dc8/struct_point.html                      |   95 +-
 d8/dcc/binary__insertion__sort_8cpp.html      |  105 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   18 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  183 --
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  157 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   20 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  201 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  175 --
 .../binary__insertion__sort_8cpp_source.html  |  229 ++
 d8/dcc/namespacestd.html                      | 2757 -----------------
 d8/dcc/namespacestd.js                        |  552 ----
 d8/dcd/namespacelru__cache.html               |   35 +-
 d8/dce/test__queue_8cpp_source.html           |  238 ++
 d8/dd5/check__factorial_8cpp.html             |   67 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |    7 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |   83 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   57 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  101 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   75 -
 d8/dd5/check__factorial_8cpp_source.html      |  183 ++
 d8/ddf/sieve__of__eratosthenes_8cpp.html      |  107 +-
 ...2be949d160b26361f7e323310f7fa0c_cgraph.map |    9 -
 ...2be949d160b26361f7e323310f7fa0c_cgraph.md5 |    1 -
 ...2be949d160b26361f7e323310f7fa0c_cgraph.svg |  102 -
 ...49d160b26361f7e323310f7fa0c_cgraph_org.svg |   76 -
 ...5bc4a221e584d33b79b322432ecc0f3_cgraph.map |    7 -
 ...5bc4a221e584d33b79b322432ecc0f3_cgraph.md5 |    1 -
 ...5bc4a221e584d33b79b322432ecc0f3_cgraph.svg |   84 -
 ...a221e584d33b79b322432ecc0f3_cgraph_org.svg |   58 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 .../sieve__of__eratosthenes_8cpp_source.html  |  223 ++
 d8/dee/avltree_8cpp.html                      |  164 +-
 ...473fe7416332495b2678ebe89652e4b_cgraph.map |   17 -
 ...473fe7416332495b2678ebe89652e4b_cgraph.md5 |    1 -
 ...473fe7416332495b2678ebe89652e4b_cgraph.svg |  173 --
 ...e7416332495b2678ebe89652e4b_cgraph_org.svg |  147 -
 ...fa160a678a34dd51c0aea1c0c00ed5e_cgraph.map |    4 -
 ...fa160a678a34dd51c0aea1c0c00ed5e_cgraph.md5 |    1 -
 ...fa160a678a34dd51c0aea1c0c00ed5e_cgraph.svg |   56 -
 ...0a678a34dd51c0aea1c0c00ed5e_cgraph_org.svg |   30 -
 ...2659e9e223e520cf91d7e55c4a3f88c_cgraph.map |    4 -
 ...2659e9e223e520cf91d7e55c4a3f88c_cgraph.md5 |    1 -
 ...2659e9e223e520cf91d7e55c4a3f88c_cgraph.svg |   56 -
 ...e9e223e520cf91d7e55c4a3f88c_cgraph_org.svg |   30 -
 ...29a7fdc2db1784f5a6e25025ff7cbf5_cgraph.map |    7 -
 ...29a7fdc2db1784f5a6e25025ff7cbf5_cgraph.md5 |    1 -
 ...29a7fdc2db1784f5a6e25025ff7cbf5_cgraph.svg |   83 -
 ...fdc2db1784f5a6e25025ff7cbf5_cgraph_org.svg |   57 -
 ...a457ffec24c9643f2768e7a65e96546_cgraph.map |    8 -
 ...a457ffec24c9643f2768e7a65e96546_cgraph.md5 |    1 -
 ...a457ffec24c9643f2768e7a65e96546_cgraph.svg |   92 -
 ...ffec24c9643f2768e7a65e96546_cgraph_org.svg |   66 -
 ...4a66d8b0c2b0d626aea45977e358c83_cgraph.map |    6 -
 ...4a66d8b0c2b0d626aea45977e358c83_cgraph.md5 |    1 -
 ...4a66d8b0c2b0d626aea45977e358c83_cgraph.svg |   74 -
 ...d8b0c2b0d626aea45977e358c83_cgraph_org.svg |   48 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   30 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  290 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  264 --
 d8/dee/avltree_8cpp_source.html               |  315 ++
 d8/df0/queue__using__array_8cpp.html          |   93 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   14 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  152 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  126 -
 d8/df0/queue__using__array_8cpp_source.html   |  249 ++
 d8/df9/stack_8hpp__dep__incl.map              |    7 +
 d8/df9/stack_8hpp__dep__incl.md5              |    1 +
 d8/df9/stack_8hpp__dep__incl.svg              |   85 +
 d8/df9/stack_8hpp__dep__incl_org.svg          |   59 +
 d8/dfa/median__search2_8cpp.html              |   80 +-
 ...fefe132a0c3ee780ebc703f37ebce6a_cgraph.map |    4 -
 ...fefe132a0c3ee780ebc703f37ebce6a_cgraph.md5 |    1 -
 ...fefe132a0c3ee780ebc703f37ebce6a_cgraph.svg |   57 -
 ...132a0c3ee780ebc703f37ebce6a_cgraph_org.svg |   31 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 d8/dfa/median__search2_8cpp_source.html       |  251 ++
 ...res_1_1reverse__binary__tree_1_1_node.html |  121 +-
 d9/d00/factorial_8cpp.html                    |   66 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |    6 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |   74 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   48 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    8 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   92 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   66 -
 d9/d00/factorial_8cpp_source.html             |  177 ++
 d9/d02/linear__search_8cpp.html               |   95 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |    5 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |   65 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    8 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   92 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   66 -
 d9/d02/linear__search_8cpp_source.html        |  228 ++
 d9/d03/namespacestring__search.html           |  164 +-
 ...e37af2f023495129cb57338c801209e_cgraph.map |   10 -
 ...e37af2f023495129cb57338c801209e_cgraph.md5 |    1 -
 ...e37af2f023495129cb57338c801209e_cgraph.svg |  111 -
 ...f2f023495129cb57338c801209e_cgraph_org.svg |   85 -
 ...1c673d56cbf67b1d2ee4d869185b7d9_cgraph.map |   11 -
 ...1c673d56cbf67b1d2ee4d869185b7d9_cgraph.md5 |    1 -
 ...1c673d56cbf67b1d2ee4d869185b7d9_cgraph.svg |  120 -
 ...3d56cbf67b1d2ee4d869185b7d9_cgraph_org.svg |   94 -
 ...3c72ff237cdf623e42d4295e0029bf9_cgraph.map |    5 -
 ...3c72ff237cdf623e42d4295e0029bf9_cgraph.md5 |    1 -
 ...3c72ff237cdf623e42d4295e0029bf9_cgraph.svg |   66 -
 ...ff237cdf623e42d4295e0029bf9_cgraph_org.svg |   40 -
 ...b2cd81064717aedd62bfb096b1a73d8_cgraph.map |    7 -
 ...b2cd81064717aedd62bfb096b1a73d8_cgraph.md5 |    1 -
 ...b2cd81064717aedd62bfb096b1a73d8_cgraph.svg |   84 -
 ...81064717aedd62bfb096b1a73d8_cgraph_org.svg |   58 -
 ...ive__tree__traversals_1_1_binary_tree.html |  123 +-
 ...c33f2c1a3a3deb486a1c33ee5239499_cgraph.map |   11 -
 ...c33f2c1a3a3deb486a1c33ee5239499_cgraph.md5 |    1 -
 ...c33f2c1a3a3deb486a1c33ee5239499_cgraph.svg |  121 -
 ...2c1a3a3deb486a1c33ee5239499_cgraph_org.svg |   95 -
 ...36a07c90b7f312bb86d2ec104efca25_cgraph.map |   11 -
 ...36a07c90b7f312bb86d2ec104efca25_cgraph.md5 |    1 -
 ...36a07c90b7f312bb86d2ec104efca25_cgraph.svg |  121 -
 ...7c90b7f312bb86d2ec104efca25_cgraph_org.svg |   95 -
 ...4c6a8e67fb8267a65439b035666b5ae_cgraph.map |   11 -
 ...4c6a8e67fb8267a65439b035666b5ae_cgraph.md5 |    1 -
 ...4c6a8e67fb8267a65439b035666b5ae_cgraph.svg |  121 -
 ...8e67fb8267a65439b035666b5ae_cgraph_org.svg |   95 -
 d9/d13/namespaceinversion.html                |   35 +-
 d9/d14/array__left__rotation_8cpp.html        |   77 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   15 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  155 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  129 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   17 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  173 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  147 -
 d9/d14/array__left__rotation_8cpp_source.html |  277 ++
 d9/d1c/kruskal_8cpp_source.html               |  203 ++
 d9/d1f/binary__addition_8cpp.html             |   67 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |   19 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |  251 --
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |  168 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   21 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  269 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  186 --
 d9/d1f/binary__addition_8cpp_source.html      |  231 ++
 ...smachine__learning_1_1adaline-members.html |   35 +-
 d9/d21/namespacewave__sort.html               |   35 +-
 ...classgraph_1_1_lowest_common_ancestor.html |  126 +-
 ...2589cc39d6bbff6c997152f1b96e356_cgraph.map |   11 -
 ...2589cc39d6bbff6c997152f1b96e356_cgraph.md5 |    1 -
 ...2589cc39d6bbff6c997152f1b96e356_cgraph.svg |  121 -
 ...cc39d6bbff6c997152f1b96e356_cgraph_org.svg |   95 -
 ...0151e19512b48cc0b14ea121df00488_cgraph.map |    5 -
 ...0151e19512b48cc0b14ea121df00488_cgraph.md5 |    1 -
 ...0151e19512b48cc0b14ea121df00488_cgraph.svg |   66 -
 ...e19512b48cc0b14ea121df00488_cgraph_org.svg |   40 -
 ...0825a4fd4c41860b689d253dd2c8e93_cgraph.map |   13 -
 ...0825a4fd4c41860b689d253dd2c8e93_cgraph.md5 |    1 -
 ...0825a4fd4c41860b689d253dd2c8e93_cgraph.svg |  197 --
 ...a4fd4c41860b689d253dd2c8e93_cgraph_org.svg |  114 -
 d9/d24/poisson__dist_8cpp.html                |  111 +-
 ...9a136b32707bdc7950fb9057b5fa1e1_cgraph.map |    9 -
 ...9a136b32707bdc7950fb9057b5fa1e1_cgraph.md5 |    1 -
 ...9a136b32707bdc7950fb9057b5fa1e1_cgraph.svg |  101 -
 ...6b32707bdc7950fb9057b5fa1e1_cgraph_org.svg |   75 -
 ...9c9e74079278ca10e3b97a8d5391c9a_cgraph.map |   15 -
 ...9c9e74079278ca10e3b97a8d5391c9a_cgraph.md5 |    1 -
 ...9c9e74079278ca10e3b97a8d5391c9a_cgraph.svg |  155 -
 ...74079278ca10e3b97a8d5391c9a_cgraph_org.svg |  129 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   24 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  236 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  210 --
 d9/d24/poisson__dist_8cpp_source.html         |  204 ++
 d9/d27/namespacelist__array.html              |   35 +-
 ...__to__ground__projectile__motion_8cpp.html |  190 +-
 ...0362eb607d7882bac3a0688504b00ff_cgraph.map |    9 -
 ...0362eb607d7882bac3a0688504b00ff_cgraph.md5 |    1 -
 ...0362eb607d7882bac3a0688504b00ff_cgraph.svg |  105 -
 ...eb607d7882bac3a0688504b00ff_cgraph_org.svg |   79 -
 ...63e066975fed1b84750a0a47c3cbb37_cgraph.map |    9 -
 ...63e066975fed1b84750a0a47c3cbb37_cgraph.md5 |    1 -
 ...63e066975fed1b84750a0a47c3cbb37_cgraph.svg |  105 -
 ...66975fed1b84750a0a47c3cbb37_cgraph_org.svg |   79 -
 ...554429def63077ab7a550c0affbfefa_cgraph.map |   11 -
 ...554429def63077ab7a550c0affbfefa_cgraph.md5 |    1 -
 ...554429def63077ab7a550c0affbfefa_cgraph.svg |  123 -
 ...29def63077ab7a550c0affbfefa_cgraph_org.svg |   97 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    7 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   83 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   57 -
 ...00e9785fb2670f7af99d6f3d636f87c_cgraph.map |    4 -
 ...00e9785fb2670f7af99d6f3d636f87c_cgraph.md5 |    1 -
 ...00e9785fb2670f7af99d6f3d636f87c_cgraph.svg |   58 -
 ...785fb2670f7af99d6f3d636f87c_cgraph_org.svg |   32 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  101 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   75 -
 ...round__projectile__motion_8cpp_source.html |  245 ++
 d9/d2c/class_test_cases-members.html          |   35 +-
 d9/d31/coin__change__topdown_8cpp.html        |   95 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    9 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  101 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   75 -
 ...816a4ae8a29c156b90377041000929a_cgraph.map |    6 -
 ...816a4ae8a29c156b90377041000929a_cgraph.md5 |    1 -
 ...816a4ae8a29c156b90377041000929a_cgraph.svg |   76 -
 ...4ae8a29c156b90377041000929a_cgraph_org.svg |   50 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   11 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  119 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   93 -
 d9/d31/coin__change__topdown_8cpp_source.html |  199 ++
 ..._1heavy__light__decomposition_1_1_s_g.html |  180 +-
 ...fda852e6e522707fd97f61cdb0a2591_cgraph.map |    5 -
 ...fda852e6e522707fd97f61cdb0a2591_cgraph.md5 |    1 -
 ...fda852e6e522707fd97f61cdb0a2591_cgraph.svg |   69 -
 ...52e6e522707fd97f61cdb0a2591_cgraph_org.svg |   43 -
 ...ba5c1225ba04c0025c7786c09ff28f1_cgraph.map |    5 -
 ...ba5c1225ba04c0025c7786c09ff28f1_cgraph.md5 |    1 -
 ...ba5c1225ba04c0025c7786c09ff28f1_cgraph.svg |   67 -
 ...1225ba04c0025c7786c09ff28f1_cgraph_org.svg |   41 -
 ...nverse__fast__fourier__transform_8cpp.html |   96 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   10 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  111 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   85 -
 ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.map |   12 -
 ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5 |    1 -
 ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg |  129 -
 ...b7e6f15df4b525a2e7705ba3089_cgraph_org.svg |  103 -
 ..._fast__fourier__transform_8cpp_source.html |  267 ++
 d9/d44/magic__number_8cpp.html                |  104 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |    5 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |   65 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 d9/d44/magic__number_8cpp_source.html         |  194 ++
 d9/d49/kohonen__som__trace_8cpp.html          |  242 +-
 ...283886819c7c140a023582b7269e2d0_cgraph.map |   20 -
 ...283886819c7c140a023582b7269e2d0_cgraph.md5 |    1 -
 ...283886819c7c140a023582b7269e2d0_cgraph.svg |  200 --
 ...86819c7c140a023582b7269e2d0_cgraph_org.svg |  174 --
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.map |   20 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 |    1 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg |  200 --
 ...7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg |  174 --
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map |   47 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 |    1 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg |  500 ---
 ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg |  417 ---
 ...3082f2e5bacec40266499da4547309a_cgraph.map |    7 -
 ...3082f2e5bacec40266499da4547309a_cgraph.md5 |    1 -
 ...3082f2e5bacec40266499da4547309a_cgraph.svg |   83 -
 ...f2e5bacec40266499da4547309a_cgraph_org.svg |   57 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.map |   21 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.md5 |    1 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.svg |  209 --
 ...5dd5c30adda100e95f0423c786e_cgraph_org.svg |  183 --
 ...154fe319e6033485a8a6cd6f0d8932d_cgraph.map |    8 -
 ...154fe319e6033485a8a6cd6f0d8932d_cgraph.md5 |    1 -
 ...154fe319e6033485a8a6cd6f0d8932d_cgraph.svg |   92 -
 ...e319e6033485a8a6cd6f0d8932d_cgraph_org.svg |   66 -
 ...571600aa42a81bc14a4a602ea5ff00d_cgraph.map |    7 -
 ...571600aa42a81bc14a4a602ea5ff00d_cgraph.md5 |    1 -
 ...571600aa42a81bc14a4a602ea5ff00d_cgraph.svg |   83 -
 ...00aa42a81bc14a4a602ea5ff00d_cgraph_org.svg |   57 -
 d9/d49/kohonen__som__trace_8cpp_source.html   |  497 +++
 d9/d49/structdata__structures_1_1_node.html   |  123 +-
 ...4a6777e72b639c3ee6446a541db8e78_cgraph.map |    5 -
 ...4a6777e72b639c3ee6446a541db8e78_cgraph.md5 |    1 -
 ...4a6777e72b639c3ee6446a541db8e78_cgraph.svg |   66 -
 ...77e72b639c3ee6446a541db8e78_cgraph_org.svg |   40 -
 ...light__decomposition_1_1_tree-members.html |   35 +-
 d9/d55/namespacesparse__table.html            |   35 +-
 ...tures_1_1linked__list_1_1list-members.html |   35 +-
 .../structgeometry_1_1jarvis_1_1_point.html   |   80 +-
 d9/d5d/extended__euclid__algorithm_8cpp.html  |   92 +-
 ...792ac7c33aaf26b860ab55f5652ab25_cgraph.map |    7 -
 ...792ac7c33aaf26b860ab55f5652ab25_cgraph.md5 |    1 -
 ...792ac7c33aaf26b860ab55f5652ab25_cgraph.svg |   83 -
 ...c7c33aaf26b860ab55f5652ab25_cgraph_org.svg |   57 -
 ...ba15ca55b3e7dcb91f3c65d72ba052d_cgraph.map |    6 -
 ...ba15ca55b3e7dcb91f3c65d72ba052d_cgraph.md5 |    1 -
 ...ba15ca55b3e7dcb91f3c65d72ba052d_cgraph.svg |   74 -
 ...ca55b3e7dcb91f3c65d72ba052d_cgraph_org.svg |   48 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   17 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  173 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  147 -
 ...tended__euclid__algorithm_8cpp_source.html |  209 ++
 ...bsequence__using__binary__search_8cpp.html |  117 +-
 ...13539d9a97fc6e121ce496873ba892e_cgraph.map |    9 -
 ...13539d9a97fc6e121ce496873ba892e_cgraph.md5 |    1 -
 ...13539d9a97fc6e121ce496873ba892e_cgraph.svg |  103 -
 ...9d9a97fc6e121ce496873ba892e_cgraph_org.svg |   77 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |   11 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |  121 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   95 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   13 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  139 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  113 -
 ...ce__using__binary__search_8cpp_source.html |  199 ++
 d9/d60/namespacerat__maze.html                |   35 +-
 d9/d65/lfu__cache_8cpp.html                   |   71 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   21 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  271 --
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  188 --
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   23 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  289 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  206 --
 d9/d65/lfu__cache_8cpp_source.html            |  392 +++
 d9/d66/group__machine__learning.html          |  171 +-
 ...0f9186ccb682724a8792a2bf81e9b9e_cgraph.map |   11 -
 ...0f9186ccb682724a8792a2bf81e9b9e_cgraph.md5 |    1 -
 ...0f9186ccb682724a8792a2bf81e9b9e_cgraph.svg |  119 -
 ...86ccb682724a8792a2bf81e9b9e_cgraph_org.svg |   93 -
 ...c90175770bf0d5853c466e14993a08c_cgraph.map |   11 -
 ...c90175770bf0d5853c466e14993a08c_cgraph.md5 |    1 -
 ...c90175770bf0d5853c466e14993a08c_cgraph.svg |  119 -
 ...75770bf0d5853c466e14993a08c_cgraph_org.svg |   93 -
 ...0208548f8b393528e5db01717e88e67_cgraph.map |    9 -
 ...0208548f8b393528e5db01717e88e67_cgraph.md5 |    1 -
 ...0208548f8b393528e5db01717e88e67_cgraph.svg |  101 -
 ...548f8b393528e5db01717e88e67_cgraph_org.svg |   75 -
 ...5ce14f026d6d231bef29161bac2b485_cgraph.map |    5 -
 ...5ce14f026d6d231bef29161bac2b485_cgraph.md5 |    1 -
 ...5ce14f026d6d231bef29161bac2b485_cgraph.svg |   65 -
 ...4f026d6d231bef29161bac2b485_cgraph_org.svg |   39 -
 d9/d69/median__search_8cpp.html               |  142 +-
 ...68847218f694e78bf433a0ff7648bae_cgraph.map |   16 -
 ...68847218f694e78bf433a0ff7648bae_cgraph.md5 |    1 -
 ...68847218f694e78bf433a0ff7648bae_cgraph.svg |  165 -
 ...7218f694e78bf433a0ff7648bae_cgraph_org.svg |  139 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 d9/d69/median__search_8cpp_source.html        |  245 ++
 d9/d6b/coin__change_8cpp_source.html          |  189 ++
 d9/d70/namespacequeue__using__array.html      |   35 +-
 d9/d75/namespacednf__sort.html                |   35 +-
 d9/d80/trapped__rainwater_8cpp.html           |   86 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   11 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  120 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   94 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   13 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  138 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  112 -
 d9/d80/trapped__rainwater_8cpp_source.html    |  229 ++
 ...election__sort__iterative_8cpp_source.html |  267 ++
 ...ed_3_01uint128__t_01_4__inherit__graph.map |    2 +-
 ...ed_3_01uint128__t_01_4__inherit__graph.md5 |    2 +-
 ...ed_3_01uint128__t_01_4__inherit__graph.svg |    2 +-
 ..._01uint128__t_01_4__inherit__graph_org.svg |    2 +-
 d9/d89/fibonacci_8cpp.html                    |   59 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 d9/d89/fibonacci_8cpp_source.html             |  182 ++
 d9/d90/struct_btree.html                      |   98 +-
 d9/d92/chaining_8cpp.html                     |   95 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   19 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  191 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  165 -
 d9/d92/chaining_8cpp_source.html              |  303 ++
 d9/da2/exponential__dist_8cpp.html            |  135 +-
 ...c8b6e787f72a209ef96c096eedf7afc_cgraph.map |    4 -
 ...c8b6e787f72a209ef96c096eedf7afc_cgraph.md5 |    1 -
 ...c8b6e787f72a209ef96c096eedf7afc_cgraph.svg |   57 -
 ...e787f72a209ef96c096eedf7afc_cgraph_org.svg |   31 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   66 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   40 -
 ...7b0091e17479d47438a281fefc2549a_cgraph.map |    4 -
 ...7b0091e17479d47438a281fefc2549a_cgraph.md5 |    1 -
 ...7b0091e17479d47438a281fefc2549a_cgraph.svg |   57 -
 ...91e17479d47438a281fefc2549a_cgraph_org.svg |   31 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   84 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   58 -
 ...435dbeb43a05c8c7785f53bf4ce1df1_cgraph.map |    4 -
 ...435dbeb43a05c8c7785f53bf4ce1df1_cgraph.md5 |    1 -
 ...435dbeb43a05c8c7785f53bf4ce1df1_cgraph.svg |   57 -
 ...beb43a05c8c7785f53bf4ce1df1_cgraph_org.svg |   31 -
 d9/da2/exponential__dist_8cpp_source.html     |  262 ++
 d9/daa/namespacemidpoint__rule.html           |   35 +-
 d9/dab/bloom__filter_8cpp.html                |  117 +-
 ...0edc0d2bb59c185baec81d69d20ed3b_cgraph.map |    7 -
 ...0edc0d2bb59c185baec81d69d20ed3b_cgraph.md5 |    1 -
 ...0edc0d2bb59c185baec81d69d20ed3b_cgraph.svg |   83 -
 ...0d2bb59c185baec81d69d20ed3b_cgraph_org.svg |   57 -
 ...e509afe40db07681f676ad8da4fb905_cgraph.map |   12 -
 ...e509afe40db07681f676ad8da4fb905_cgraph.md5 |    1 -
 ...e509afe40db07681f676ad8da4fb905_cgraph.svg |  129 -
 ...afe40db07681f676ad8da4fb905_cgraph_org.svg |  103 -
 ...1f57bf262fe55db928b19dc124cc0d8_cgraph.map |    7 -
 ...1f57bf262fe55db928b19dc124cc0d8_cgraph.md5 |    1 -
 ...1f57bf262fe55db928b19dc124cc0d8_cgraph.svg |   83 -
 ...bf262fe55db928b19dc124cc0d8_cgraph_org.svg |   57 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   26 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  312 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  229 --
 d9/dab/bloom__filter_8cpp_source.html         |  356 +++
 d9/dad/rb__tree_8cpp_source.html              |  651 ++++
 d9/dae/classdata__structures_1_1_bitset.html  |  142 +-
 ...7dbe1b1d559302312e8091f82f7499c_cgraph.map |    7 -
 ...7dbe1b1d559302312e8091f82f7499c_cgraph.md5 |    1 -
 ...7dbe1b1d559302312e8091f82f7499c_cgraph.svg |   83 -
 ...1b1d559302312e8091f82f7499c_cgraph_org.svg |   57 -
 ...f1f44d6a12b0de4aaf242872b1c7b54_cgraph.map |    5 -
 ...f1f44d6a12b0de4aaf242872b1c7b54_cgraph.md5 |    1 -
 ...f1f44d6a12b0de4aaf242872b1c7b54_cgraph.svg |   66 -
 ...4d6a12b0de4aaf242872b1c7b54_cgraph_org.svg |   40 -
 ...ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph.map |    5 -
 ...ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph.md5 |    1 -
 ...ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph.svg |   66 -
 ...c7c3f6494b36ead3ae2e5cf43ac_cgraph_org.svg |   40 -
 ...orithms_1_1dijkstra_1_1_graph-members.html |   35 +-
 d9/dbf/test__stack_8cpp_source.html           |  348 +++
 d9/dc9/namespacebase64__encoding.html         |   35 +-
 d9/dca/namespacesearch.html                   |   43 +-
 .../selectionsortlinkedlist_8cpp_source.html  |  315 ++
 .../namespacelinear__recurrence__matrix.html  |   35 +-
 ...cocktail__selection__sort_8cpp_source.html |  240 ++
 d9/dd7/interpolation__search_8cpp_source.html |  265 ++
 d9/dde/classbinary__search__tree.html         |  306 +-
 ...f23830316204664514f396a4eb5275a_cgraph.map |    6 -
 ...f23830316204664514f396a4eb5275a_cgraph.md5 |    1 -
 ...f23830316204664514f396a4eb5275a_cgraph.svg |   76 -
 ...30316204664514f396a4eb5275a_cgraph_org.svg |   50 -
 ...fcf37549bd002c174a45b0b4203c2bd_cgraph.map |    4 -
 ...fcf37549bd002c174a45b0b4203c2bd_cgraph.md5 |    1 -
 ...fcf37549bd002c174a45b0b4203c2bd_cgraph.svg |   57 -
 ...7549bd002c174a45b0b4203c2bd_cgraph_org.svg |   31 -
 ...2b16f26928b5e994925100594a167a0_cgraph.map |    4 -
 ...2b16f26928b5e994925100594a167a0_cgraph.md5 |    1 -
 ...2b16f26928b5e994925100594a167a0_cgraph.svg |   57 -
 ...f26928b5e994925100594a167a0_cgraph_org.svg |   31 -
 ...764c1cf848f84a5b77462036a6d8c13_cgraph.map |    6 -
 ...764c1cf848f84a5b77462036a6d8c13_cgraph.md5 |    1 -
 ...764c1cf848f84a5b77462036a6d8c13_cgraph.svg |   76 -
 ...1cf848f84a5b77462036a6d8c13_cgraph_org.svg |   50 -
 ...c011e1b0863d79c3a7c11a0426bdcff_cgraph.map |    6 -
 ...c011e1b0863d79c3a7c11a0426bdcff_cgraph.md5 |    1 -
 ...c011e1b0863d79c3a7c11a0426bdcff_cgraph.svg |   76 -
 ...e1b0863d79c3a7c11a0426bdcff_cgraph_org.svg |   50 -
 ...bf5b410299df2320ddf2709dda61f63_cgraph.map |    4 -
 ...bf5b410299df2320ddf2709dda61f63_cgraph.md5 |    1 -
 ...bf5b410299df2320ddf2709dda61f63_cgraph.svg |   57 -
 ...410299df2320ddf2709dda61f63_cgraph_org.svg |   31 -
 ...5f897af6aa732a9901454401c869bcb_cgraph.map |    4 -
 ...5f897af6aa732a9901454401c869bcb_cgraph.md5 |    1 -
 ...5f897af6aa732a9901454401c869bcb_cgraph.svg |   57 -
 ...7af6aa732a9901454401c869bcb_cgraph_org.svg |   31 -
 ...168edf29316f2b436eac1fc416c52e0_cgraph.map |    6 -
 ...168edf29316f2b436eac1fc416c52e0_cgraph.md5 |    1 -
 ...168edf29316f2b436eac1fc416c52e0_cgraph.svg |   76 -
 ...df29316f2b436eac1fc416c52e0_cgraph_org.svg |   50 -
 ...7c0a35845d27e0f6fc1f4eaa0333362_cgraph.map |    4 -
 ...7c0a35845d27e0f6fc1f4eaa0333362_cgraph.md5 |    1 -
 ...7c0a35845d27e0f6fc1f4eaa0333362_cgraph.svg |   57 -
 ...35845d27e0f6fc1f4eaa0333362_cgraph_org.svg |   31 -
 ...9771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.map |   11 -
 ...9771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.md5 |    1 -
 ...9771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.svg |  122 -
 ...c2e1353e8ddfd4bb9d30b7a98fb_cgraph_org.svg |   96 -
 ...d1e7e10efa74d741bf48cf032df3778_cgraph.map |    4 -
 ...d1e7e10efa74d741bf48cf032df3778_cgraph.md5 |    1 -
 ...d1e7e10efa74d741bf48cf032df3778_cgraph.svg |   57 -
 ...e10efa74d741bf48cf032df3778_cgraph_org.svg |   31 -
 ...4f84b2eec9b9201af1840868ddb5fb2_cgraph.map |    4 -
 ...4f84b2eec9b9201af1840868ddb5fb2_cgraph.md5 |    1 -
 ...4f84b2eec9b9201af1840868ddb5fb2_cgraph.svg |   57 -
 ...b2eec9b9201af1840868ddb5fb2_cgraph_org.svg |   31 -
 ...81edd415324d372632c42dc7dbcb9e1_cgraph.map |    4 -
 ...81edd415324d372632c42dc7dbcb9e1_cgraph.md5 |    1 -
 ...81edd415324d372632c42dc7dbcb9e1_cgraph.svg |   57 -
 ...d415324d372632c42dc7dbcb9e1_cgraph_org.svg |   31 -
 ...9912e8574538e86f9bd2c38e7e63d03_cgraph.map |    4 -
 ...9912e8574538e86f9bd2c38e7e63d03_cgraph.md5 |    1 -
 ...9912e8574538e86f9bd2c38e7e63d03_cgraph.svg |   57 -
 ...e8574538e86f9bd2c38e7e63d03_cgraph_org.svg |   31 -
 ...4a865ce5244608819b169fc78a41153_cgraph.map |    9 -
 ...4a865ce5244608819b169fc78a41153_cgraph.md5 |    1 -
 ...4a865ce5244608819b169fc78a41153_cgraph.svg |  103 -
 ...5ce5244608819b169fc78a41153_cgraph_org.svg |   77 -
 ...9a2c7c187a7ca3142c77ce342ef3153_cgraph.map |    4 -
 ...9a2c7c187a7ca3142c77ce342ef3153_cgraph.md5 |    1 -
 ...9a2c7c187a7ca3142c77ce342ef3153_cgraph.svg |   57 -
 ...7c187a7ca3142c77ce342ef3153_cgraph_org.svg |   31 -
 d9/dde/structdouble__hashing_1_1_entry.html   |  100 +-
 d9/dec/unbounded__0__1__knapsack_8cpp.html    |  172 +-
 ...bcff7f76de48fa7f629480f8f18b5ef_cgraph.map |    9 -
 ...bcff7f76de48fa7f629480f8f18b5ef_cgraph.md5 |    1 -
 ...bcff7f76de48fa7f629480f8f18b5ef_cgraph.svg |  105 -
 ...7f76de48fa7f629480f8f18b5ef_cgraph_org.svg |   79 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |    5 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |   65 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 ...e447a5979582174908695952c8a079c_cgraph.map |    6 -
 ...e447a5979582174908695952c8a079c_cgraph.md5 |    1 -
 ...e447a5979582174908695952c8a079c_cgraph.svg |   76 -
 ...a5979582174908695952c8a079c_cgraph_org.svg |   50 -
 ...unbounded__0__1__knapsack_8cpp_source.html |  260 ++
 d9/dee/classdouble__linked__list.html         |   67 +-
 d9/def/namespacesublist__search.html          |   35 +-
 d9/df0/fast__integer__input_8cpp.html         |   72 +-
 ...e097ac8509b717bdc8ab09ecd86ae82_cgraph.map |    5 -
 ...e097ac8509b717bdc8ab09ecd86ae82_cgraph.md5 |    1 -
 ...e097ac8509b717bdc8ab09ecd86ae82_cgraph.svg |   65 -
 ...ac8509b717bdc8ab09ecd86ae82_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  101 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   75 -
 d9/df0/fast__integer__input_8cpp_source.html  |  179 ++
 d9/df4/namespacetests.html                    |  185 +-
 ...b9769e44683dcb67fe1083ad91e134d_cgraph.map |    5 -
 ...b9769e44683dcb67fe1083ad91e134d_cgraph.md5 |    1 -
 ...b9769e44683dcb67fe1083ad91e134d_cgraph.svg |   65 -
 ...9e44683dcb67fe1083ad91e134d_cgraph_org.svg |   39 -
 ...cafde185abd8670abee51157f273dc2_cgraph.map |    9 -
 ...cafde185abd8670abee51157f273dc2_cgraph.md5 |    1 -
 ...cafde185abd8670abee51157f273dc2_cgraph.svg |  101 -
 ...e185abd8670abee51157f273dc2_cgraph_org.svg |   75 -
 ...1recursive__tree__traversals_1_1_node.html |   72 +-
 ...ueue__using__linked__list_8cpp_source.html |  223 ++
 d9/dfd/comb__sort_8cpp.html                   |  156 +-
 ...f4e7569090083fb53d5cdeaf0e2974f_cgraph.map |    9 -
 ...f4e7569090083fb53d5cdeaf0e2974f_cgraph.md5 |    1 -
 ...f4e7569090083fb53d5cdeaf0e2974f_cgraph.svg |  101 -
 ...569090083fb53d5cdeaf0e2974f_cgraph_org.svg |   75 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.map |   13 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 |    1 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.svg |  137 -
 ...ad42717780d6caaff9d3d6977f9_cgraph_org.svg |  111 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   16 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  164 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  138 -
 ...de08143e63105faba10e9ee8e745fd5_cgraph.map |    5 -
 ...de08143e63105faba10e9ee8e745fd5_cgraph.md5 |    1 -
 ...de08143e63105faba10e9ee8e745fd5_cgraph.svg |   65 -
 ...143e63105faba10e9ee8e745fd5_cgraph_org.svg |   39 -
 d9/dfd/comb__sort_8cpp_source.html            |  203 ++
 ..._1_1aystar__search_1_1_ay_star_search.html |  181 +-
 ...a26aa9ad3d73707370d9fe83707aca4_cgraph.map |    7 -
 ...a26aa9ad3d73707370d9fe83707aca4_cgraph.md5 |    1 -
 ...a26aa9ad3d73707370d9fe83707aca4_cgraph.svg |   85 -
 ...a9ad3d73707370d9fe83707aca4_cgraph_org.svg |   59 -
 ...8284e156fdd48fd0c41008c7e48f201_cgraph.map |   26 -
 ...8284e156fdd48fd0c41008c7e48f201_cgraph.md5 |    1 -
 ...8284e156fdd48fd0c41008c7e48f201_cgraph.svg |  258 --
 ...e156fdd48fd0c41008c7e48f201_cgraph_org.svg |  232 --
 ...aff2ea6d309e1133fd95bbd1e39946e_cgraph.map |    5 -
 ...aff2ea6d309e1133fd95bbd1e39946e_cgraph.md5 |    1 -
 ...aff2ea6d309e1133fd95bbd1e39946e_cgraph.svg |   67 -
 ...ea6d309e1133fd95bbd1e39946e_cgraph_org.svg |   41 -
 da/d0d/longest__common__string_8cpp.html      |  171 +-
 ...3ab67b0d9600697695fc8679462d8fe_cgraph.map |   15 -
 ...3ab67b0d9600697695fc8679462d8fe_cgraph.md5 |    1 -
 ...3ab67b0d9600697695fc8679462d8fe_cgraph.svg |  158 -
 ...7b0d9600697695fc8679462d8fe_cgraph_org.svg |  132 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |   25 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |  307 --
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |  224 --
 ...b229daad982a186a4d8d90aa8f38561_cgraph.map |    9 -
 ...b229daad982a186a4d8d90aa8f38561_cgraph.md5 |    1 -
 ...b229daad982a186a4d8d90aa8f38561_cgraph.svg |  103 -
 ...daad982a186a4d8d90aa8f38561_cgraph_org.svg |   77 -
 ...38b6b17bc5d46ed88acdd8414e18fa5_cgraph.map |    7 -
 ...38b6b17bc5d46ed88acdd8414e18fa5_cgraph.md5 |    1 -
 ...38b6b17bc5d46ed88acdd8414e18fa5_cgraph.svg |   84 -
 ...b17bc5d46ed88acdd8414e18fa5_cgraph_org.svg |   58 -
 ...b03dbbcee6d607db471021168be8541_cgraph.map |    7 -
 ...b03dbbcee6d607db471021168be8541_cgraph.md5 |    1 -
 ...b03dbbcee6d607db471021168be8541_cgraph.svg |   83 -
 ...bbcee6d607db471021168be8541_cgraph_org.svg |   57 -
 ...1e613c1b85cc04ed931b6c745fec155_cgraph.map |    9 -
 ...1e613c1b85cc04ed931b6c745fec155_cgraph.md5 |    1 -
 ...1e613c1b85cc04ed931b6c745fec155_cgraph.svg |  103 -
 ...3c1b85cc04ed931b6c745fec155_cgraph_org.svg |   77 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   27 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  325 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  242 --
 .../longest__common__string_8cpp_source.html  |  267 ++
 ...pological__sort_1_1_graph__coll__graph.map |    2 +-
 ...pological__sort_1_1_graph__coll__graph.md5 |    2 +-
 ...pological__sort_1_1_graph__coll__graph.svg |    2 +-
 ...gical__sort_1_1_graph__coll__graph_org.svg |    2 +-
 ...es_1_1circular__linked__list_1_1_node.html |  102 +-
 ...tic__equations__complex__numbers_8cpp.html |  142 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   13 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  137 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  111 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   15 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  155 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  129 -
 ...7a6d4e3dc85a6288c8f1f7094830c5a_cgraph.map |    7 -
 ...7a6d4e3dc85a6288c8f1f7094830c5a_cgraph.md5 |    1 -
 ...7a6d4e3dc85a6288c8f1f7094830c5a_cgraph.svg |   83 -
 ...4e3dc85a6288c8f1f7094830c5a_cgraph_org.svg |   57 -
 ...uations__complex__numbers_8cpp_source.html |  283 ++
 ...tric__dist_1_1geometric__distribution.html |  163 +-
 ...8328dc7d62188427111f176b56a105a_cgraph.map |    5 -
 ...8328dc7d62188427111f176b56a105a_cgraph.md5 |    1 -
 ...8328dc7d62188427111f176b56a105a_cgraph.svg |   67 -
 ...dc7d62188427111f176b56a105a_cgraph_org.svg |   41 -
 ...a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph.map |    7 -
 ...a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph.md5 |    1 -
 ...a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph.svg |   87 -
 ...512e13dd3a052e1c6d7f4d6f0f2_cgraph_org.svg |   61 -
 ...620163a196709484225774d87de6d69_cgraph.map |    9 -
 ...620163a196709484225774d87de6d69_cgraph.md5 |    1 -
 ...620163a196709484225774d87de6d69_cgraph.svg |  105 -
 ...63a196709484225774d87de6d69_cgraph_org.svg |   79 -
 ...aae1cebcf42ed2332f1c7217c401aa3_cgraph.map |   10 -
 ...aae1cebcf42ed2332f1c7217c401aa3_cgraph.md5 |    1 -
 ...aae1cebcf42ed2332f1c7217c401aa3_cgraph.svg |  115 -
 ...cebcf42ed2332f1c7217c401aa3_cgraph_org.svg |   89 -
 ...f762e88c66918d7afda4234f28a7ddf_cgraph.map |    5 -
 ...f762e88c66918d7afda4234f28a7ddf_cgraph.md5 |    1 -
 ...f762e88c66918d7afda4234f28a7ddf_cgraph.svg |   67 -
 ...e88c66918d7afda4234f28a7ddf_cgraph_org.svg |   41 -
 ...e973db9f0435e0cb4cc70f8eb3447a1_cgraph.map |    5 -
 ...e973db9f0435e0cb4cc70f8eb3447a1_cgraph.md5 |    1 -
 ...e973db9f0435e0cb4cc70f8eb3447a1_cgraph.svg |   67 -
 ...db9f0435e0cb4cc70f8eb3447a1_cgraph_org.svg |   41 -
 da/d21/class_longest___substring.html         |   77 +-
 ...8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.map |   12 -
 ...8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.md5 |    1 -
 ...8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.svg |  129 -
 ...72bc8d95e7da4f9a45e5e2e387d_cgraph_org.svg |  103 -
 da/d23/eulers__totient__function_8cpp.html    |   66 +-
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.map |    7 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 |    1 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg |   83 -
 ...224851353fc92bfbff6f499fa97_cgraph_org.svg |   57 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...eulers__totient__function_8cpp_source.html |  185 ++
 da/d24/sqrt__double_8cpp.html                 |   72 +-
 ...662282ad0740d2063ac404ca3bd74fc_cgraph.map |    4 -
 ...662282ad0740d2063ac404ca3bd74fc_cgraph.md5 |    1 -
 ...662282ad0740d2063ac404ca3bd74fc_cgraph.svg |   56 -
 ...82ad0740d2063ac404ca3bd74fc_cgraph_org.svg |   30 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    8 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   92 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   66 -
 da/d24/sqrt__double_8cpp_source.html          |  180 ++
 da/d27/prim_8cpp_source.html                  |  196 ++
 ...__using__hashmap_1_1_trie__coll__graph.map |    4 +-
 ...__using__hashmap_1_1_trie__coll__graph.md5 |    2 +-
 ...__using__hashmap_1_1_trie__coll__graph.svg |    4 +-
 ...ing__hashmap_1_1_trie__coll__graph_org.svg |    4 +-
 ...es_1_1sparse__table_1_1_sparse__table.html |  120 +-
 da/d39/volume_8cpp.html                       |  163 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   33 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  318 --
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  292 --
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   35 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  336 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  310 --
 da/d39/volume_8cpp_source.html                |  332 ++
 da/d41/uint128__t_8hpp.html                   |  116 +-
 ...ff77262ffd6743df5b808d41382a6f3_cgraph.map |   13 -
 ...ff77262ffd6743df5b808d41382a6f3_cgraph.md5 |    1 -
 ...ff77262ffd6743df5b808d41382a6f3_cgraph.svg |  137 -
 ...262ffd6743df5b808d41382a6f3_cgraph_org.svg |  111 -
 da/d41/uint128__t_8hpp_source.html            | 1040 ++-----
 ...eedy__algorithms_1_1_digit_separation.html |   76 +-
 ...809ae6828223999374bde5b197a59c8_cgraph.map |    7 -
 ...809ae6828223999374bde5b197a59c8_cgraph.md5 |    1 -
 ...809ae6828223999374bde5b197a59c8_cgraph.svg |   87 -
 ...e6828223999374bde5b197a59c8_cgraph_org.svg |   61 -
 ...epth__first__search__with__stack_8cpp.html |  298 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |    5 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |   65 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   39 -
 ...738da9f508f6a9e87f123c9fb6f2ea9_cgraph.map |   14 -
 ...738da9f508f6a9e87f123c9fb6f2ea9_cgraph.md5 |    1 -
 ...738da9f508f6a9e87f123c9fb6f2ea9_cgraph.svg |  147 -
 ...a9f508f6a9e87f123c9fb6f2ea9_cgraph_org.svg |  121 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    8 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   92 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   66 -
 ...irst__search__with__stack_8cpp_source.html |  287 ++
 ...iling__ciphers__in__factorial__n_8cpp.html |   94 +-
 ...d5e1d651d0d30bd682f176d8f2b83d0_cgraph.map |    4 -
 ...d5e1d651d0d30bd682f176d8f2b83d0_cgraph.md5 |    1 -
 ...d5e1d651d0d30bd682f176d8f2b83d0_cgraph.svg |   59 -
 ...d651d0d30bd682f176d8f2b83d0_cgraph_org.svg |   33 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 ...ciphers__in__factorial__n_8cpp_source.html |  206 ++
 da/d52/minimum__edit__distance_8cpp.html      |  158 +-
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.map |    9 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 |    1 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg |  101 -
 ...224851353fc92bfbff6f499fa97_cgraph_org.svg |   75 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    7 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   83 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   57 -
 .../minimum__edit__distance_8cpp_source.html  |  234 ++
 da/d5a/class_complex.html                     |  178 +-
 ...cfc522c782726f49ee20af17b77f867_cgraph.map |    7 -
 ...cfc522c782726f49ee20af17b77f867_cgraph.md5 |    1 -
 ...cfc522c782726f49ee20af17b77f867_cgraph.svg |   83 -
 ...22c782726f49ee20af17b77f867_cgraph_org.svg |   57 -
 ...ac9f529d54cacf2969f2c7179b4c4ac_cgraph.map |    7 -
 ...ac9f529d54cacf2969f2c7179b4c4ac_cgraph.md5 |    1 -
 ...ac9f529d54cacf2969f2c7179b4c4ac_cgraph.svg |   83 -
 ...529d54cacf2969f2c7179b4c4ac_cgraph_org.svg |   57 -
 ...38437c10eb798f176c384a695171b90_cgraph.map |   13 -
 ...38437c10eb798f176c384a695171b90_cgraph.md5 |    1 -
 ...38437c10eb798f176c384a695171b90_cgraph.svg |  137 -
 ...7c10eb798f176c384a695171b90_cgraph_org.svg |  111 -
 ...1e03712837450549e0c9b4017533a41_cgraph.map |    5 -
 ...1e03712837450549e0c9b4017533a41_cgraph.md5 |    1 -
 ...1e03712837450549e0c9b4017533a41_cgraph.svg |   65 -
 ...712837450549e0c9b4017533a41_cgraph_org.svg |   39 -
 ...5b51b749ea4964104b9527af9d8f556_cgraph.map |    5 -
 ...5b51b749ea4964104b9527af9d8f556_cgraph.md5 |    1 -
 ...5b51b749ea4964104b9527af9d8f556_cgraph.svg |   65 -
 ...b749ea4964104b9527af9d8f556_cgraph_org.svg |   39 -
 ...uctsearch_1_1sublist__search_1_1_node.html |   66 +-
 ...ange__queries_1_1per_seg_tree-members.html |   35 +-
 ...ement__in__dynamic__array_8cpp_source.html |  218 ++
 ...mespaceoperations__on__datastructures.html |  241 +-
 ...bfb8711f49e591eb168ccaa3df6fb86_cgraph.map |    5 -
 ...bfb8711f49e591eb168ccaa3df6fb86_cgraph.md5 |    1 -
 ...bfb8711f49e591eb168ccaa3df6fb86_cgraph.svg |   66 -
 ...711f49e591eb168ccaa3df6fb86_cgraph_org.svg |   40 -
 ...b8ff06a84b041457873840bf82e2d74_cgraph.map |    9 -
 ...b8ff06a84b041457873840bf82e2d74_cgraph.md5 |    1 -
 ...b8ff06a84b041457873840bf82e2d74_cgraph.svg |  102 -
 ...06a84b041457873840bf82e2d74_cgraph_org.svg |   76 -
 ...af9a06f0c236c2d95c97e441ea2d12e_cgraph.map |    9 -
 ...af9a06f0c236c2d95c97e441ea2d12e_cgraph.md5 |    1 -
 ...af9a06f0c236c2d95c97e441ea2d12e_cgraph.svg |  102 -
 ...06f0c236c2d95c97e441ea2d12e_cgraph_org.svg |   76 -
 ...ce39cf843989a39811a49ebe29dd6d8_cgraph.map |    5 -
 ...ce39cf843989a39811a49ebe29dd6d8_cgraph.md5 |    1 -
 ...ce39cf843989a39811a49ebe29dd6d8_cgraph.svg |   66 -
 ...cf843989a39811a49ebe29dd6d8_cgraph_org.svg |   40 -
 ...r__search_1_1_ay_star_search_1_1_info.html |  150 +-
 ...3993dbca9c5b3ef9ac361dc7f62ce57_cgraph.map |    5 -
 ...3993dbca9c5b3ef9ac361dc7f62ce57_cgraph.md5 |    1 -
 ...3993dbca9c5b3ef9ac361dc7f62ce57_cgraph.svg |   67 -
 ...dbca9c5b3ef9ac361dc7f62ce57_cgraph_org.svg |   41 -
 ...ph_1_1_lowest_common_ancestor-members.html |   35 +-
 ..._1boyer__moore_1_1pattern__coll__graph.map |   16 +-
 ..._1boyer__moore_1_1pattern__coll__graph.md5 |    2 +-
 ..._1boyer__moore_1_1pattern__coll__graph.svg |   61 +-
 ...yer__moore_1_1pattern__coll__graph_org.svg |   61 +-
 da/d77/spirograph_8cpp.html                   |   58 +-
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map |   13 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 |    1 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg |  137 -
 ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg |  111 -
 da/d77/spirograph_8cpp_source.html            |  355 +++
 da/d7b/primality__test_8cpp.html              |   67 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 da/d7b/primality__test_8cpp_source.html       |  170 +
 da/d82/namespacecycle__detection.html         |   35 +-
 da/d83/kosaraju_8cpp_source.html              |  238 ++
 ..._1_1tree__234_1_1_tree234__coll__graph.map |   18 +-
 ..._1_1tree__234_1_1_tree234__coll__graph.md5 |    2 +-
 ..._1_1tree__234_1_1_tree234__coll__graph.svg |   51 +-
 ...tree__234_1_1_tree234__coll__graph_org.svg |   51 +-
 da/d86/struct_test_case.html                  |  114 +-
 da/d8d/depth__first__search_8cpp.html         |   93 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 da/d8d/depth__first__search_8cpp_source.html  |  210 ++
 ...ning_1_1k__nearest__neighbors_1_1_knn.html |  119 +-
 ...2e152db014cd4de675fa906e5ef2861_cgraph.map |   32 -
 ...2e152db014cd4de675fa906e5ef2861_cgraph.md5 |    1 -
 ...2e152db014cd4de675fa906e5ef2861_cgraph.svg |  313 --
 ...2db014cd4de675fa906e5ef2861_cgraph_org.svg |  287 --
 da/d9a/class_graph.html                       |  561 +++-
 da/d9a/palindrome__of__number_8cpp.html       |   73 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   11 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  119 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   93 -
 .../palindrome__of__number_8cpp_source.html   |  168 +
 da/d9c/namespacegames.html                    |   35 +-
 da/da2/node_8hpp__dep__incl.map               |   10 +-
 da/da2/node_8hpp__dep__incl.md5               |    2 +-
 da/da2/node_8hpp__dep__incl.svg               |   93 +-
 da/da2/node_8hpp__dep__incl_org.svg           |   93 +-
 da/da3/uint256__t_8hpp.html                   |   79 +-
 da/da3/uint256__t_8hpp_source.html            | 1040 ++-----
 ...rcular__linked__list_1_1_node-members.html |   35 +-
 ...__structures_1_1_segment_tree-members.html |   35 +-
 ...queens__all__solution__optimised_8cpp.html |  116 +-
 ...4090463be4942a69ea91fe7386da905_cgraph.map |    6 -
 ...4090463be4942a69ea91fe7386da905_cgraph.md5 |    1 -
 ...4090463be4942a69ea91fe7386da905_cgraph.svg |   75 -
 ...463be4942a69ea91fe7386da905_cgraph_org.svg |   49 -
 ...3c0547e4fd1708e6fb643b08327a60f_cgraph.map |    4 -
 ...3c0547e4fd1708e6fb643b08327a60f_cgraph.md5 |    1 -
 ...3c0547e4fd1708e6fb643b08327a60f_cgraph.svg |   57 -
 ...47e4fd1708e6fb643b08327a60f_cgraph_org.svg |   31 -
 ...e48455584a4faa33e83dd1891efd9b9_cgraph.map |    4 -
 ...e48455584a4faa33e83dd1891efd9b9_cgraph.md5 |    1 -
 ...e48455584a4faa33e83dd1891efd9b9_cgraph.svg |   57 -
 ...55584a4faa33e83dd1891efd9b9_cgraph_org.svg |   31 -
 ..._all__solution__optimised_8cpp_source.html |  238 ++
 da/db8/count__of__set__bits_8cpp.html         |   62 +-
 ...6c98dc299e4db28b73e08309d977e62_cgraph.map |    4 -
 ...6c98dc299e4db28b73e08309d977e62_cgraph.md5 |    1 -
 ...6c98dc299e4db28b73e08309d977e62_cgraph.svg |   57 -
 ...dc299e4db28b73e08309d977e62_cgraph_org.svg |   31 -
 da/db8/count__of__set__bits_8cpp_source.html  |  193 ++
 ...igned_3_01uint128__t_01_4__coll__graph.map |    2 +-
 ...igned_3_01uint128__t_01_4__coll__graph.md5 |    2 +-
 ...igned_3_01uint128__t_01_4__coll__graph.svg |    2 +-
 ...d_3_01uint128__t_01_4__coll__graph_org.svg |    2 +-
 da/dc3/linked__list_8cpp.html                 |  124 +-
 ...1a372fe1e605bc0e0987dcdd7361180_cgraph.map |    4 -
 ...1a372fe1e605bc0e0987dcdd7361180_cgraph.md5 |    1 -
 ...1a372fe1e605bc0e0987dcdd7361180_cgraph.svg |   57 -
 ...2fe1e605bc0e0987dcdd7361180_cgraph_org.svg |   31 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 da/dc3/linked__list_8cpp_source.html          |  378 +++
 ...ibonacci__matrix__exponentiation_8cpp.html |  109 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   10 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  110 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   84 -
 ...i__matrix__exponentiation_8cpp_source.html |  238 ++
 .../structquadratic__probing_1_1_entry.html   |  100 +-
 ...hine__learning_1_1adaline__coll__graph.map |    2 +-
 ...hine__learning_1_1adaline__coll__graph.md5 |    2 +-
 ...hine__learning_1_1adaline__coll__graph.svg |    2 +-
 ...__learning_1_1adaline__coll__graph_org.svg |    2 +-
 ...rithm__for__fast__multiplication_8cpp.html |  183 +-
 ...a890d2f26855ada3b9f1d43aec70a86_cgraph.map |   20 -
 ...a890d2f26855ada3b9f1d43aec70a86_cgraph.md5 |    1 -
 ...a890d2f26855ada3b9f1d43aec70a86_cgraph.svg |  206 --
 ...d2f26855ada3b9f1d43aec70a86_cgraph_org.svg |  180 --
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...d9e3edfe156b59fc06a5585403fe0d6_cgraph.map |    8 -
 ...d9e3edfe156b59fc06a5585403fe0d6_cgraph.md5 |    1 -
 ...d9e3edfe156b59fc06a5585403fe0d6_cgraph.svg |   94 -
 ...edfe156b59fc06a5585403fe0d6_cgraph_org.svg |   68 -
 ...76f5cac3ef8dc034f6abb99b64c2b20_cgraph.map |   10 -
 ...76f5cac3ef8dc034f6abb99b64c2b20_cgraph.md5 |    1 -
 ...76f5cac3ef8dc034f6abb99b64c2b20_cgraph.svg |  112 -
 ...cac3ef8dc034f6abb99b64c2b20_cgraph_org.svg |   86 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 ...for__fast__multiplication_8cpp_source.html |  285 ++
 da/dd3/namespacespirograph.html               |   84 +-
 ...e83a64e8443fff1e5ffdc1c299c1e99_cgraph.map |   11 -
 ...e83a64e8443fff1e5ffdc1c299c1e99_cgraph.md5 |    1 -
 ...e83a64e8443fff1e5ffdc1c299c1e99_cgraph.svg |  119 -
 ...64e8443fff1e5ffdc1c299c1e99_cgraph_org.svg |   93 -
 ...ca22dbe4563358960e907a40cd3e1ac_cgraph.map |    7 -
 ...ca22dbe4563358960e907a40cd3e1ac_cgraph.md5 |    1 -
 ...ca22dbe4563358960e907a40cd3e1ac_cgraph.svg |   83 -
 ...dbe4563358960e907a40cd3e1ac_cgraph_org.svg |   57 -
 da/dd4/namespacemedian__search.html           |   35 +-
 da/dda/namespaceradix__sort.html              |   35 +-
 da/de7/decimal__to__hexadecimal_8cpp.html     |   65 +-
 ...40291bc02cba5474a4cb46a9b9566fe_cgraph.map |    5 -
 ...40291bc02cba5474a4cb46a9b9566fe_cgraph.md5 |    1 -
 ...40291bc02cba5474a4cb46a9b9566fe_cgraph.svg |   65 -
 ...1bc02cba5474a4cb46a9b9566fe_cgraph_org.svg |   39 -
 .../decimal__to__hexadecimal_8cpp_source.html |  167 +
 da/de8/dijkstra__greedy_8cpp.html             |   63 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 da/de8/dijkstra__greedy_8cpp_source.html      |  294 ++
 da/df2/durand__kerner__roots_8cpp.html        |  253 +-
 ...283886819c7c140a023582b7269e2d0_cgraph.map |   35 -
 ...283886819c7c140a023582b7269e2d0_cgraph.md5 |    1 -
 ...283886819c7c140a023582b7269e2d0_cgraph.svg |  335 --
 ...86819c7c140a023582b7269e2d0_cgraph_org.svg |  309 --
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.map |   35 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 |    1 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg |  335 --
 ...7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg |  309 --
 ...c35b320ace8677f9b331faf94f8b2fd_cgraph.map |   31 -
 ...c35b320ace8677f9b331faf94f8b2fd_cgraph.md5 |    1 -
 ...c35b320ace8677f9b331faf94f8b2fd_cgraph.svg |  299 --
 ...320ace8677f9b331faf94f8b2fd_cgraph_org.svg |  273 --
 ...0219e35062007d1f1b68e9af071ab5c_cgraph.map |    9 -
 ...0219e35062007d1f1b68e9af071ab5c_cgraph.md5 |    1 -
 ...0219e35062007d1f1b68e9af071ab5c_cgraph.svg |  101 -
 ...e35062007d1f1b68e9af071ab5c_cgraph_org.svg |   75 -
 ...2ab49ba1969d7a5988f9bc2c8924569_cgraph.map |    9 -
 ...2ab49ba1969d7a5988f9bc2c8924569_cgraph.md5 |    1 -
 ...2ab49ba1969d7a5988f9bc2c8924569_cgraph.svg |  101 -
 ...9ba1969d7a5988f9bc2c8924569_cgraph_org.svg |   75 -
 da/df2/durand__kerner__roots_8cpp_source.html |  432 +++
 ...ar__search_1_1_ay_star_search-members.html |   35 +-
 ...ry__search__tree_1_1bst__node-members.html |   35 +-
 db/d01/brent__method__extrema_8cpp.html       |  178 +-
 ...283886819c7c140a023582b7269e2d0_cgraph.map |   11 -
 ...283886819c7c140a023582b7269e2d0_cgraph.md5 |    1 -
 ...283886819c7c140a023582b7269e2d0_cgraph.svg |  119 -
 ...86819c7c140a023582b7269e2d0_cgraph_org.svg |   93 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.map |    9 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 |    1 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg |  101 -
 ...7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg |   75 -
 ...aa76a6d5fd4d333f9072beff1dc486b_cgraph.map |    7 -
 ...aa76a6d5fd4d333f9072beff1dc486b_cgraph.md5 |    1 -
 ...aa76a6d5fd4d333f9072beff1dc486b_cgraph.svg |   83 -
 ...a6d5fd4d333f9072beff1dc486b_cgraph_org.svg |   57 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.map |   11 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.md5 |    1 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.svg |  119 -
 ...5dd5c30adda100e95f0423c786e_cgraph_org.svg |   93 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   21 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  209 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  183 --
 .../brent__method__extrema_8cpp_source.html   |  330 ++
 db/d03/_s_t-example.html                      |   35 +-
 db/d03/namespacewildcard__matching.html       |   35 +-
 db/d07/spiral__print_8cpp.html                |  102 +-
 ...fff36db81326fb990a643ab198ee8a5_cgraph.map |    5 -
 ...fff36db81326fb990a643ab198ee8a5_cgraph.md5 |    1 -
 ...fff36db81326fb990a643ab198ee8a5_cgraph.svg |   65 -
 ...6db81326fb990a643ab198ee8a5_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  101 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   75 -
 db/d07/spiral__print_8cpp_source.html         |  209 ++
 db/d09/duval_8cpp.html                        |   87 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 db/d09/duval_8cpp_source.html                 |  222 ++
 db/d0d/prime__factorization_8cpp.html         |  114 +-
 ...ece0145fb29a5cf48378c23dde2da46_cgraph.map |    5 -
 ...ece0145fb29a5cf48378c23dde2da46_cgraph.md5 |    1 -
 ...ece0145fb29a5cf48378c23dde2da46_cgraph.svg |   65 -
 ...145fb29a5cf48378c23dde2da46_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   13 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  137 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  111 -
 ...fe577b9bce8f604f5e2f861c63c7099_cgraph.map |    5 -
 ...fe577b9bce8f604f5e2f861c63c7099_cgraph.md5 |    1 -
 ...fe577b9bce8f604f5e2f861c63c7099_cgraph.svg |   65 -
 ...7b9bce8f604f5e2f861c63c7099_cgraph_org.svg |   39 -
 db/d0d/prime__factorization_8cpp_source.html  |  215 ++
 ...__array_1_1_queue___array__coll__graph.map |    8 +-
 ...__array_1_1_queue___array__coll__graph.md5 |    2 +-
 ...__array_1_1_queue___array__coll__graph.svg |   27 +-
 ...ray_1_1_queue___array__coll__graph_org.svg |   27 +-
 db/d10/classdsu__coll__graph.map              |    7 -
 db/d10/classdsu__coll__graph.md5              |    1 -
 db/d10/classdsu__coll__graph.svg              |   89 -
 db/d10/classdsu__coll__graph_org.svg          |   63 -
 db/d16/0__1__knapsack_8cpp.html               |  105 +-
 ...5edf30f336885e5b851f6b7199c6cd1_cgraph.map |    6 -
 ...5edf30f336885e5b851f6b7199c6cd1_cgraph.md5 |    1 -
 ...5edf30f336885e5b851f6b7199c6cd1_cgraph.svg |   75 -
 ...30f336885e5b851f6b7199c6cd1_cgraph_org.svg |   49 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 db/d16/0__1__knapsack_8cpp_source.html        |  228 ++
 db/d19/structlinear__probing_1_1_entry.html   |  100 +-
 db/d1e/classgraph_1_1_graph-members.html      |   35 +-
 db/d27/n__bonacci_8cpp.html                   |  102 +-
 ...849b68f760be628d5975ab3eddec63d_cgraph.map |    4 -
 ...849b68f760be628d5975ab3eddec63d_cgraph.md5 |    1 -
 ...849b68f760be628d5975ab3eddec63d_cgraph.svg |   57 -
 ...68f760be628d5975ab3eddec63d_cgraph_org.svg |   31 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 db/d27/n__bonacci_8cpp_source.html            |  215 ++
 ..._1_1jarvis_1_1_convexhull__coll__graph.map |    2 +-
 ..._1_1jarvis_1_1_convexhull__coll__graph.md5 |    2 +-
 ..._1_1jarvis_1_1_convexhull__coll__graph.svg |    2 +-
 ...jarvis_1_1_convexhull__coll__graph_org.svg |    2 +-
 ...arse__table_1_1_sparse__table-members.html |   35 +-
 ...ers_1_1_cache_1_1_l_f_u_cache-members.html |   35 +-
 db/d3c/tower__of__hanoi_8cpp.html             |   91 +-
 ...037f72a5eac476535a6cfbbcb965417_cgraph.map |    6 -
 ...037f72a5eac476535a6cfbbcb965417_cgraph.md5 |    1 -
 ...037f72a5eac476535a6cfbbcb965417_cgraph.svg |   74 -
 ...72a5eac476535a6cfbbcb965417_cgraph_org.svg |   48 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    8 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   92 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   66 -
 db/d3c/tower__of__hanoi_8cpp_source.html      |  216 ++
 db/d3f/wave__sort_8cpp.html                   |  129 +-
 ...d4f243b9dc13ace4ef77e30dbc56f12_cgraph.map |   12 -
 ...d4f243b9dc13ace4ef77e30dbc56f12_cgraph.md5 |    1 -
 ...d4f243b9dc13ace4ef77e30dbc56f12_cgraph.svg |  129 -
 ...43b9dc13ace4ef77e30dbc56f12_cgraph_org.svg |  103 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 db/d3f/wave__sort_8cpp_source.html            |  210 ++
 db/d40/integral__approximation2_8cpp.html     |  198 +-
 ...1249ee535f16f8ed2e9cc8f0199a2cf_cgraph.map |   10 -
 ...1249ee535f16f8ed2e9cc8f0199a2cf_cgraph.md5 |    1 -
 ...1249ee535f16f8ed2e9cc8f0199a2cf_cgraph.svg |  111 -
 ...ee535f16f8ed2e9cc8f0199a2cf_cgraph_org.svg |   85 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   11 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  119 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   93 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   13 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  137 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  111 -
 ...7da9ba8932f1f48b9bbc2d80471af51_cgraph.map |   15 -
 ...7da9ba8932f1f48b9bbc2d80471af51_cgraph.md5 |    1 -
 ...7da9ba8932f1f48b9bbc2d80471af51_cgraph.svg |  157 -
 ...ba8932f1f48b9bbc2d80471af51_cgraph_org.svg |  131 -
 .../integral__approximation2_8cpp_source.html |  300 ++
 ...ures_1_1stack__using__queue_1_1_stack.html |  147 +-
 ...540434e1b41245205eee86f664906f7_cgraph.map |    5 -
 ...540434e1b41245205eee86f664906f7_cgraph.md5 |    1 -
 ...540434e1b41245205eee86f664906f7_cgraph.svg |   66 -
 ...34e1b41245205eee86f664906f7_cgraph_org.svg |   40 -
 ...dd461689df4983a3ad3b05d853cf5eb_cgraph.map |    7 -
 ...dd461689df4983a3ad3b05d853cf5eb_cgraph.md5 |    1 -
 ...dd461689df4983a3ad3b05d853cf5eb_cgraph.svg |   84 -
 ...1689df4983a3ad3b05d853cf5eb_cgraph_org.svg |   58 -
 ...04a8f3536a52d8c9916086b656eefc2_cgraph.map |   11 -
 ...04a8f3536a52d8c9916086b656eefc2_cgraph.md5 |    1 -
 ...04a8f3536a52d8c9916086b656eefc2_cgraph.svg |  120 -
 ...f3536a52d8c9916086b656eefc2_cgraph_org.svg |   94 -
 .../class_easter_year_month_day-members.html  |   35 +-
 ...ulo__p_1_1_n_c_r_modulo_p__coll__graph.map |    8 +-
 ...ulo__p_1_1_n_c_r_modulo_p__coll__graph.md5 |    2 +-
 ...ulo__p_1_1_n_c_r_modulo_p__coll__graph.svg |   27 +-
 ..._p_1_1_n_c_r_modulo_p__coll__graph_org.svg |   27 +-
 db/d66/struct_item.html                       |   79 +-
 ...tree__traversals_1_1_node__coll__graph.map |    6 +-
 ...tree__traversals_1_1_node__coll__graph.md5 |    2 +-
 ...tree__traversals_1_1_node__coll__graph.svg |   33 +-
 ...__traversals_1_1_node__coll__graph_org.svg |   33 +-
 db/d6b/kelvin__to__celsius_8cpp.html          |   68 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |    7 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |   84 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   58 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  102 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   76 -
 db/d6b/kelvin__to__celsius_8cpp_source.html   |  185 ++
 ...ed_3_01uint256__t_01_4__inherit__graph.map |    2 +-
 ...ed_3_01uint256__t_01_4__inherit__graph.md5 |    2 +-
 ...ed_3_01uint256__t_01_4__inherit__graph.svg |    2 +-
 ..._01uint256__t_01_4__inherit__graph_org.svg |    2 +-
 .../namespaceheavy__light__decomposition.html |   35 +-
 .../quadratic__probing__hash__table_8cpp.html |  134 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   43 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  473 ---
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  390 ---
 ...tic__probing__hash__table_8cpp_source.html |  415 +++
 ...ic_3_01uint128__t_01_4__inherit__graph.map |    2 +-
 ...ic_3_01uint128__t_01_4__inherit__graph.md5 |    2 +-
 ...ic_3_01uint128__t_01_4__inherit__graph.svg |    2 +-
 ..._01uint128__t_01_4__inherit__graph_org.svg |    2 +-
 db/d80/gale__shapley_8cpp.html                |   78 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |    7 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |   85 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   59 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  103 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   77 -
 db/d80/gale__shapley_8cpp_source.html         |  259 ++
 db/d82/classlarge__number.html                |  226 +-
 ...0119a83839e65962621b73df46a5337_cgraph.map |    5 -
 ...0119a83839e65962621b73df46a5337_cgraph.md5 |    1 -
 ...0119a83839e65962621b73df46a5337_cgraph.svg |   66 -
 ...a83839e65962621b73df46a5337_cgraph_org.svg |   40 -
 ...f5571e66305cf68bb8283e4aeda58bc_cgraph.map |   11 -
 ...f5571e66305cf68bb8283e4aeda58bc_cgraph.md5 |    1 -
 ...f5571e66305cf68bb8283e4aeda58bc_cgraph.svg |  119 -
 ...1e66305cf68bb8283e4aeda58bc_cgraph_org.svg |   93 -
 ...0c436d1a1c5e3795d6177d3815ad615_cgraph.map |    5 -
 ...0c436d1a1c5e3795d6177d3815ad615_cgraph.md5 |    1 -
 ...0c436d1a1c5e3795d6177d3815ad615_cgraph.svg |   65 -
 ...6d1a1c5e3795d6177d3815ad615_cgraph_org.svg |   39 -
 ...71e9b28cfddf1ad94668566e396e350_cgraph.map |   13 -
 ...71e9b28cfddf1ad94668566e396e350_cgraph.md5 |    1 -
 ...71e9b28cfddf1ad94668566e396e350_cgraph.svg |  194 --
 ...b28cfddf1ad94668566e396e350_cgraph_org.svg |  111 -
 ...59c5c1a982949bbf98e1ea0f9afe6a9_cgraph.map |    9 -
 ...59c5c1a982949bbf98e1ea0f9afe6a9_cgraph.md5 |    1 -
 ...59c5c1a982949bbf98e1ea0f9afe6a9_cgraph.svg |  102 -
 ...c1a982949bbf98e1ea0f9afe6a9_cgraph_org.svg |   76 -
 ...b5644405094740e34983cedfecb36cf_cgraph.map |   13 -
 ...b5644405094740e34983cedfecb36cf_cgraph.md5 |    1 -
 ...b5644405094740e34983cedfecb36cf_cgraph.svg |  137 -
 ...4405094740e34983cedfecb36cf_cgraph_org.svg |  111 -
 ...09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph.map |    5 -
 ...09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph.md5 |    1 -
 ...09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph.svg |   65 -
 ...5ec4aafb4d9e0b4440d6f0e2a93_cgraph_org.svg |   39 -
 ...35a55607cf52c0b0d485f2129bd39ac_cgraph.map |    7 -
 ...35a55607cf52c0b0d485f2129bd39ac_cgraph.md5 |    1 -
 ...35a55607cf52c0b0d485f2129bd39ac_cgraph.svg |   83 -
 ...5607cf52c0b0d485f2129bd39ac_cgraph_org.svg |   57 -
 ...4598f1f2794b5e17e10c25e0501e41a_cgraph.map |    7 -
 ...4598f1f2794b5e17e10c25e0501e41a_cgraph.md5 |    1 -
 ...4598f1f2794b5e17e10c25e0501e41a_cgraph.svg |   84 -
 ...f1f2794b5e17e10c25e0501e41a_cgraph_org.svg |   58 -
 db/d8b/struct_node.html                       |  167 +-
 db/d93/check__prime_8cpp.html                 |   67 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |    7 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |   83 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   57 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  101 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   75 -
 db/d93/check__prime_8cpp_source.html          |  189 ++
 db/d9a/classuint128__t.html                   |  293 +-
 ...b6612186d8f678452e011d08ee1f5ac_cgraph.map |    7 -
 ...b6612186d8f678452e011d08ee1f5ac_cgraph.md5 |    1 -
 ...b6612186d8f678452e011d08ee1f5ac_cgraph.svg |   84 -
 ...2186d8f678452e011d08ee1f5ac_cgraph_org.svg |   58 -
 ...79209a184db20a7ffc8e687fdb05be2_cgraph.map |    7 -
 ...79209a184db20a7ffc8e687fdb05be2_cgraph.md5 |    1 -
 ...79209a184db20a7ffc8e687fdb05be2_cgraph.svg |   83 -
 ...9a184db20a7ffc8e687fdb05be2_cgraph_org.svg |   57 -
 ...00ed88fe2054788cc6e0b6a8fdf66db_cgraph.map |    7 -
 ...00ed88fe2054788cc6e0b6a8fdf66db_cgraph.md5 |    1 -
 ...00ed88fe2054788cc6e0b6a8fdf66db_cgraph.svg |   83 -
 ...88fe2054788cc6e0b6a8fdf66db_cgraph_org.svg |   57 -
 ...072a7e43da3600c345c81bc80c957ee_cgraph.map |    7 -
 ...072a7e43da3600c345c81bc80c957ee_cgraph.md5 |    1 -
 ...072a7e43da3600c345c81bc80c957ee_cgraph.svg |   83 -
 ...7e43da3600c345c81bc80c957ee_cgraph_org.svg |   57 -
 ...57a3c69c1e775a1bd3935c2bfbb02df_cgraph.map |    5 -
 ...57a3c69c1e775a1bd3935c2bfbb02df_cgraph.md5 |    1 -
 ...57a3c69c1e775a1bd3935c2bfbb02df_cgraph.svg |   66 -
 ...c69c1e775a1bd3935c2bfbb02df_cgraph_org.svg |   40 -
 ...bf81f7f5f5c98f197822ec88e106c6c_cgraph.map |    5 -
 ...bf81f7f5f5c98f197822ec88e106c6c_cgraph.md5 |    1 -
 ...bf81f7f5f5c98f197822ec88e106c6c_cgraph.svg |   65 -
 ...f7f5f5c98f197822ec88e106c6c_cgraph_org.svg |   39 -
 ...ae08ef3c1d6dc512edd68ca68327f74_cgraph.map |    7 -
 ...ae08ef3c1d6dc512edd68ca68327f74_cgraph.md5 |    1 -
 ...ae08ef3c1d6dc512edd68ca68327f74_cgraph.svg |   84 -
 ...ef3c1d6dc512edd68ca68327f74_cgraph_org.svg |   58 -
 ...fc6a8765039cacc829a5cd386b5a066_cgraph.map |    7 -
 ...fc6a8765039cacc829a5cd386b5a066_cgraph.md5 |    1 -
 ...fc6a8765039cacc829a5cd386b5a066_cgraph.svg |   83 -
 ...8765039cacc829a5cd386b5a066_cgraph_org.svg |   57 -
 db/d9f/iterative__factorial_8cpp.html         |   81 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 db/d9f/iterative__factorial_8cpp_source.html  |  224 ++
 db/da9/classqueue.html                        |  222 +-
 ...5e231798bc706b8b0773a07f78713e7_cgraph.map |    7 -
 ...5e231798bc706b8b0773a07f78713e7_cgraph.md5 |    1 -
 ...5e231798bc706b8b0773a07f78713e7_cgraph.svg |   83 -
 ...1798bc706b8b0773a07f78713e7_cgraph_org.svg |   57 -
 ...08ebdd38cb4ad74fc0a3f51888da604_cgraph.map |    5 -
 ...08ebdd38cb4ad74fc0a3f51888da604_cgraph.md5 |    1 -
 ...08ebdd38cb4ad74fc0a3f51888da604_cgraph.svg |   65 -
 ...dd38cb4ad74fc0a3f51888da604_cgraph_org.svg |   39 -
 ...a88d0c1f34946d66386b7a11bee4e4d_cgraph.map |    7 -
 ...a88d0c1f34946d66386b7a11bee4e4d_cgraph.md5 |    1 -
 ...a88d0c1f34946d66386b7a11bee4e4d_cgraph.svg |   83 -
 ...0c1f34946d66386b7a11bee4e4d_cgraph_org.svg |   57 -
 ...27dbb72fb63f58f817a88550d7faa85_cgraph.map |    7 -
 ...27dbb72fb63f58f817a88550d7faa85_cgraph.md5 |    1 -
 ...27dbb72fb63f58f817a88550d7faa85_cgraph.svg |   83 -
 ...b72fb63f58f817a88550d7faa85_cgraph_org.svg |   57 -
 .../counting__sort__string_8cpp_source.html   |  171 +
 db/db5/slow__sort_8cpp_source.html            |  194 ++
 db/dbc/tree__234_8cpp.html                    |   91 +-
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.map |  109 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 |    1 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg | 1088 -------
 ...224851353fc92bfbff6f499fa97_cgraph_org.svg | 1005 ------
 ...7880ce913f3058a35ff106d5be9e243_cgraph.map |   78 -
 ...7880ce913f3058a35ff106d5be9e243_cgraph.md5 |    1 -
 ...7880ce913f3058a35ff106d5be9e243_cgraph.svg |  809 -----
 ...ce913f3058a35ff106d5be9e243_cgraph_org.svg |  726 -----
 ...1ac73779b0fcfbbdce3976c0ca57342_cgraph.map |   40 -
 ...1ac73779b0fcfbbdce3976c0ca57342_cgraph.md5 |    1 -
 ...1ac73779b0fcfbbdce3976c0ca57342_cgraph.svg |  449 ---
 ...3779b0fcfbbdce3976c0ca57342_cgraph_org.svg |  366 ---
 db/dbc/tree__234_8cpp_source.html             | 1077 +++++++
 db/dbd/test__stack__students_8cpp_source.html |  198 ++
 db/dc0/namespacebacktracking.html             |   70 +-
 ...8540bcb5ef3473b2348cbc34748ec50_cgraph.map |   12 -
 ...8540bcb5ef3473b2348cbc34748ec50_cgraph.md5 |    1 -
 ...8540bcb5ef3473b2348cbc34748ec50_cgraph.svg |  128 -
 ...bcb5ef3473b2348cbc34748ec50_cgraph_org.svg |  102 -
 .../floyd__cycle__detection__algo_8cpp.html   |  102 +-
 ...1ffc7a2c6bf530c8a496864e7a3ad88_cgraph.map |    4 -
 ...1ffc7a2c6bf530c8a496864e7a3ad88_cgraph.md5 |    1 -
 ...1ffc7a2c6bf530c8a496864e7a3ad88_cgraph.svg |   57 -
 ...7a2c6bf530c8a496864e7a3ad88_cgraph_org.svg |   31 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    7 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   83 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   57 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  101 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   75 -
 ...d__cycle__detection__algo_8cpp_source.html |  210 ++
 db/dd3/ode__forward__euler_8cpp.html          |  134 +-
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.map |   33 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 |    1 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg |  317 --
 ...224851353fc92bfbff6f499fa97_cgraph_org.svg |  291 --
 ...13517b8e5de1b75592052db7f7e237f_cgraph.map |   17 -
 ...13517b8e5de1b75592052db7f7e237f_cgraph.md5 |    1 -
 ...13517b8e5de1b75592052db7f7e237f_cgraph.svg |  173 --
 ...7b8e5de1b75592052db7f7e237f_cgraph_org.svg |  147 -
 ...3adf7b092a87868917ee5fb4255192b_cgraph.map |    7 -
 ...3adf7b092a87868917ee5fb4255192b_cgraph.md5 |    1 -
 ...3adf7b092a87868917ee5fb4255192b_cgraph.svg |   83 -
 ...7b092a87868917ee5fb4255192b_cgraph_org.svg |   57 -
 db/dd3/ode__forward__euler_8cpp_source.html   |  277 ++
 db/ddb/classhash__chain__coll__graph.map      |    6 +-
 db/ddb/classhash__chain__coll__graph.md5      |    2 +-
 db/ddb/classhash__chain__coll__graph.svg      |    6 +-
 db/ddb/classhash__chain__coll__graph_org.svg  |    6 +-
 db/ddc/namespaceaystar__search.html           |   35 +-
 db/dde/namespaceothers_1_1_cache.html         |   61 +-
 db/de3/numeric__string__sort_8cpp_source.html |  193 ++
 ...star__search_1_1_eight_puzzle-members.html |   35 +-
 db/df3/happy__number_8cpp.html                |   65 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 db/df3/happy__number_8cpp_source.html         |  172 +
 db/dfb/maximum__circular__subarray_8cpp.html  |   71 +-
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.map |   13 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 |    1 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg |  138 -
 ...224851353fc92bfbff6f499fa97_cgraph_org.svg |  112 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   11 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  120 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   94 -
 ...ximum__circular__subarray_8cpp_source.html |  209 ++
 ...ures_1_1tree__234_1_1_tree234-members.html |   35 +-
 ...1strassens__multiplication_1_1_matrix.html |  314 +-
 ...1f3a05cf5abdc5d63999ef1bf9f9256_cgraph.map |    9 -
 ...1f3a05cf5abdc5d63999ef1bf9f9256_cgraph.md5 |    1 -
 ...1f3a05cf5abdc5d63999ef1bf9f9256_cgraph.svg |  105 -
 ...05cf5abdc5d63999ef1bf9f9256_cgraph_org.svg |   79 -
 ...fcb7db9bdeabd874712ec4f00483d17_cgraph.map |   12 -
 ...fcb7db9bdeabd874712ec4f00483d17_cgraph.md5 |    1 -
 ...fcb7db9bdeabd874712ec4f00483d17_cgraph.svg |  191 --
 ...db9bdeabd874712ec4f00483d17_cgraph_org.svg |  108 -
 ...2c986fb57b74fe1b7c5953cb1922c3d_cgraph.map |    8 -
 ...2c986fb57b74fe1b7c5953cb1922c3d_cgraph.md5 |    1 -
 ...2c986fb57b74fe1b7c5953cb1922c3d_cgraph.svg |   96 -
 ...6fb57b74fe1b7c5953cb1922c3d_cgraph_org.svg |   70 -
 ...aa49765cce39ce48b9241e993e0cfb9_cgraph.map |    5 -
 ...aa49765cce39ce48b9241e993e0cfb9_cgraph.md5 |    1 -
 ...aa49765cce39ce48b9241e993e0cfb9_cgraph.svg |   67 -
 ...765cce39ce48b9241e993e0cfb9_cgraph_org.svg |   41 -
 ...62faa16a4b4ed5d4804823c56f99c9c_cgraph.map |    5 -
 ...62faa16a4b4ed5d4804823c56f99c9c_cgraph.md5 |    1 -
 ...62faa16a4b4ed5d4804823c56f99c9c_cgraph.svg |   67 -
 ...a16a4b4ed5d4804823c56f99c9c_cgraph_org.svg |   41 -
 ...d8eb669b37a27224376b08515b4ee50_cgraph.map |   12 -
 ...d8eb669b37a27224376b08515b4ee50_cgraph.md5 |    1 -
 ...d8eb669b37a27224376b08515b4ee50_cgraph.svg |  191 --
 ...669b37a27224376b08515b4ee50_cgraph_org.svg |  108 -
 ...0599668b56001cef4bb59d4cb5c6c6c_cgraph.map |   16 -
 ...0599668b56001cef4bb59d4cb5c6c6c_cgraph.md5 |    1 -
 ...0599668b56001cef4bb59d4cb5c6c6c_cgraph.svg |  229 --
 ...668b56001cef4bb59d4cb5c6c6c_cgraph_org.svg |  146 -
 ...78681c9f6266a8219bd6bee6972d70e_cgraph.map |   13 -
 ...78681c9f6266a8219bd6bee6972d70e_cgraph.md5 |    1 -
 ...78681c9f6266a8219bd6bee6972d70e_cgraph.svg |  200 --
 ...1c9f6266a8219bd6bee6972d70e_cgraph_org.svg |  117 -
 ...7c2ed8f19bda2ad21ee4cbed32c394a_cgraph.map |   33 -
 ...7c2ed8f19bda2ad21ee4cbed32c394a_cgraph.md5 |    1 -
 ...7c2ed8f19bda2ad21ee4cbed32c394a_cgraph.svg |  388 ---
 ...d8f19bda2ad21ee4cbed32c394a_cgraph_org.svg |  305 --
 ...6534125643a02c114bd4cddba9bc17f_cgraph.map |    7 -
 ...6534125643a02c114bd4cddba9bc17f_cgraph.md5 |    1 -
 ...6534125643a02c114bd4cddba9bc17f_cgraph.svg |   85 -
 ...125643a02c114bd4cddba9bc17f_cgraph_org.svg |   59 -
 ...36ec1f1a97298e49de605384e5f8211_cgraph.map |   13 -
 ...36ec1f1a97298e49de605384e5f8211_cgraph.md5 |    1 -
 ...36ec1f1a97298e49de605384e5f8211_cgraph.svg |  200 --
 ...1f1a97298e49de605384e5f8211_cgraph_org.svg |  117 -
 ...190115f8d4d31e47d7290e0b6871391_cgraph.map |    8 -
 ...190115f8d4d31e47d7290e0b6871391_cgraph.md5 |    1 -
 ...190115f8d4d31e47d7290e0b6871391_cgraph.svg |   96 -
 ...15f8d4d31e47d7290e0b6871391_cgraph_org.svg |   70 -
 ...4e183ec8eab778cb243e4ae0b22a0f1_cgraph.map |    5 -
 ...4e183ec8eab778cb243e4ae0b22a0f1_cgraph.md5 |    1 -
 ...4e183ec8eab778cb243e4ae0b22a0f1_cgraph.svg |   67 -
 ...3ec8eab778cb243e4ae0b22a0f1_cgraph_org.svg |   41 -
 ...dbe01e48a96fefa0b393ec577b0f19e_cgraph.map |   12 -
 ...dbe01e48a96fefa0b393ec577b0f19e_cgraph.md5 |    1 -
 ...dbe01e48a96fefa0b393ec577b0f19e_cgraph.svg |  191 --
 ...1e48a96fefa0b393ec577b0f19e_cgraph_org.svg |  108 -
 ...09566a6a59d30875434c140e18e0a12_cgraph.map |    5 -
 ...09566a6a59d30875434c140e18e0a12_cgraph.md5 |    1 -
 ...09566a6a59d30875434c140e18e0a12_cgraph.svg |   67 -
 ...6a6a59d30875434c140e18e0a12_cgraph_org.svg |   41 -
 ...12ceffdc07cc87eca8a4a8ac87d60fe_cgraph.map |   12 -
 ...12ceffdc07cc87eca8a4a8ac87d60fe_cgraph.md5 |    1 -
 ...12ceffdc07cc87eca8a4a8ac87d60fe_cgraph.svg |  132 -
 ...ffdc07cc87eca8a4a8ac87d60fe_cgraph_org.svg |  106 -
 dc/d14/wildcard__matching_8cpp.html           |  208 +-
 dc/d14/wildcard__matching_8cpp.js             |    4 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 dc/d14/wildcard__matching_8cpp_source.html    |  264 ++
 dc/d1a/pascal__triangle_8cpp.html             |   82 +-
 ...7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.map |    7 -
 ...7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.md5 |    1 -
 ...7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.svg |   83 -
 ...d9cb2818d21b1ba12aead7f4c5c_cgraph_org.svg |   57 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   12 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  128 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  102 -
 dc/d1a/pascal__triangle_8cpp_source.html      |  204 ++
 dc/d1f/classcatalan__numbers.html             |  101 +-
 ...ructdata__structures_1_1_node-members.html |   35 +-
 ...__trailing__ciphers__in__factorial__n.html |   35 +-
 ...inary__least__squares__regressor_8cpp.html |  468 ++-
 ...1e6c7bf2b09272578b9c5819ce0f36f_cgraph.map |    7 -
 ...1e6c7bf2b09272578b9c5819ce0f36f_cgraph.md5 |    1 -
 ...1e6c7bf2b09272578b9c5819ce0f36f_cgraph.svg |   83 -
 ...7bf2b09272578b9c5819ce0f36f_cgraph_org.svg |   57 -
 ...07b3a99fd5974d3117e0b0ac0aad234_cgraph.map |    5 -
 ...07b3a99fd5974d3117e0b0ac0aad234_cgraph.md5 |    1 -
 ...07b3a99fd5974d3117e0b0ac0aad234_cgraph.svg |   65 -
 ...a99fd5974d3117e0b0ac0aad234_cgraph_org.svg |   39 -
 ...2535e20e97d85aa61271e0894cc0359_cgraph.map |    5 -
 ...2535e20e97d85aa61271e0894cc0359_cgraph.md5 |    1 -
 ...2535e20e97d85aa61271e0894cc0359_cgraph.svg |   65 -
 ...e20e97d85aa61271e0894cc0359_cgraph_org.svg |   39 -
 ...261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.map |   21 -
 ...261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.md5 |    1 -
 ...261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.svg |  209 --
 ...3c3c3dfdb86f3004eb8aaffea8d_cgraph_org.svg |  183 --
 ...a6a560dbdd0177633783b72db37dc19_cgraph.map |    7 -
 ...a6a560dbdd0177633783b72db37dc19_cgraph.md5 |    1 -
 ...a6a560dbdd0177633783b72db37dc19_cgraph.svg |   83 -
 ...60dbdd0177633783b72db37dc19_cgraph_org.svg |   57 -
 ...075a0fccad9b2d79be0275bfe8948d4_cgraph.map |   11 -
 ...075a0fccad9b2d79be0275bfe8948d4_cgraph.md5 |    1 -
 ...075a0fccad9b2d79be0275bfe8948d4_cgraph.svg |  119 -
 ...0fccad9b2d79be0275bfe8948d4_cgraph_org.svg |   93 -
 ...65e8d26a01962cc93aca66e71346f37_cgraph.map |    7 -
 ...65e8d26a01962cc93aca66e71346f37_cgraph.md5 |    1 -
 ...65e8d26a01962cc93aca66e71346f37_cgraph.svg |   83 -
 ...d26a01962cc93aca66e71346f37_cgraph_org.svg |   57 -
 ...ddc683af581b51351e1023d2a01ef3b_cgraph.map |   15 -
 ...ddc683af581b51351e1023d2a01ef3b_cgraph.md5 |    1 -
 ...ddc683af581b51351e1023d2a01ef3b_cgraph.svg |  155 -
 ...83af581b51351e1023d2a01ef3b_cgraph_org.svg |  129 -
 ...1ad727903d7817c2758d25bcb52cbc8_cgraph.map |   11 -
 ...1ad727903d7817c2758d25bcb52cbc8_cgraph.md5 |    1 -
 ...1ad727903d7817c2758d25bcb52cbc8_cgraph.svg |  119 -
 ...27903d7817c2758d25bcb52cbc8_cgraph_org.svg |   93 -
 ...2edd40354a1ca7aeaee3d1e3589e713_cgraph.map |    7 -
 ...2edd40354a1ca7aeaee3d1e3589e713_cgraph.md5 |    1 -
 ...2edd40354a1ca7aeaee3d1e3589e713_cgraph.svg |   83 -
 ...40354a1ca7aeaee3d1e3589e713_cgraph_org.svg |   57 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   26 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  311 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  228 --
 ...7243bdc6ae3c7169f01b85bb226e66a_cgraph.map |    7 -
 ...7243bdc6ae3c7169f01b85bb226e66a_cgraph.md5 |    1 -
 ...7243bdc6ae3c7169f01b85bb226e66a_cgraph.svg |   83 -
 ...bdc6ae3c7169f01b85bb226e66a_cgraph_org.svg |   57 -
 ...least__squares__regressor_8cpp_source.html |  577 ++++
 dc/d3a/namespacesubset__sum.html              |   35 +-
 ...inear__recurrence__matrix_8cpp_source.html |  409 +++
 ...egral_3_01uint256__t_01_4__coll__graph.map |    2 +-
 ...egral_3_01uint256__t_01_4__coll__graph.md5 |    2 +-
 ...egral_3_01uint256__t_01_4__coll__graph.svg |    2 +-
 ...l_3_01uint256__t_01_4__coll__graph_org.svg |    2 +-
 dc/d5a/rat__maze_8cpp.html                    |   86 +-
 ...99107bfb4c6934cd4691868c66c0aa3_cgraph.map |    6 -
 ...99107bfb4c6934cd4691868c66c0aa3_cgraph.md5 |    1 -
 ...99107bfb4c6934cd4691868c66c0aa3_cgraph.svg |   75 -
 ...7bfb4c6934cd4691868c66c0aa3_cgraph_org.svg |   49 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 dc/d5a/rat__maze_8cpp_source.html             |  217 ++
 ...h_1_1_ay_star_search_1_1_info-members.html |   35 +-
 ...ive__tree__traversals_1_1_b_t-members.html |   35 +-
 dc/d61/classgraph_1_1_graph.html              |  186 +-
 ...755ec9e6a842238c7f4aac10b661981_cgraph.map |   11 -
 ...755ec9e6a842238c7f4aac10b661981_cgraph.md5 |    1 -
 ...755ec9e6a842238c7f4aac10b661981_cgraph.svg |  120 -
 ...c9e6a842238c7f4aac10b661981_cgraph_org.svg |   94 -
 ...839fa14bff19d2deab4a618447c13e5_cgraph.map |    7 -
 ...839fa14bff19d2deab4a618447c13e5_cgraph.md5 |    1 -
 ...839fa14bff19d2deab4a618447c13e5_cgraph.svg |   83 -
 ...a14bff19d2deab4a618447c13e5_cgraph_org.svg |   57 -
 ...930d1470d132b19e430d1c71f94c904_cgraph.map |    5 -
 ...930d1470d132b19e430d1c71f94c904_cgraph.md5 |    1 -
 ...930d1470d132b19e430d1c71f94c904_cgraph.svg |   66 -
 ...1470d132b19e430d1c71f94c904_cgraph_org.svg |   40 -
 dc/d64/md__coding_guidelines.html             |   35 +-
 ...s__graph__bipartite_1_1_graph-members.html |   35 +-
 dc/d67/subset__sum__dynamic_8cpp.html         |  113 +-
 ...80fcfb2f6fe49a31c4da572e7032607_cgraph.map |    6 -
 ...80fcfb2f6fe49a31c4da572e7032607_cgraph.md5 |    1 -
 ...80fcfb2f6fe49a31c4da572e7032607_cgraph.svg |   76 -
 ...fb2f6fe49a31c4da572e7032607_cgraph_org.svg |   50 -
 ...94e6c0dee11278ac0a5491f1b9a4a50_cgraph.map |   10 -
 ...94e6c0dee11278ac0a5491f1b9a4a50_cgraph.md5 |    1 -
 ...94e6c0dee11278ac0a5491f1b9a4a50_cgraph.svg |  114 -
 ...c0dee11278ac0a5491f1b9a4a50_cgraph_org.svg |   88 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 dc/d67/subset__sum__dynamic_8cpp_source.html  |  229 ++
 dc/d6d/power__of__2_8cpp.html                 |   67 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    7 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   84 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   58 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  102 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   76 -
 dc/d6d/power__of__2_8cpp_source.html          |  189 ++
 ...1_1is__arithmetic_3_01uint256__t_01_4.html |   42 +-
 dc/d82/area_8cpp.html                         |  220 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   30 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  290 --
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  264 --
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   32 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  308 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  282 --
 dc/d82/area_8cpp_source.html                  |  397 +++
 ...al__network_1_1layers_1_1_dense_layer.html |  188 +-
 ...1046825be0b6dbb73fbe834aa49200e_cgraph.map |   13 -
 ...1046825be0b6dbb73fbe834aa49200e_cgraph.md5 |    1 -
 ...1046825be0b6dbb73fbe834aa49200e_cgraph.svg |  142 -
 ...825be0b6dbb73fbe834aa49200e_cgraph_org.svg |  116 -
 ...136ec31dbd35b1be2eb9a057677c704_cgraph.map |    7 -
 ...136ec31dbd35b1be2eb9a057677c704_cgraph.md5 |    1 -
 ...136ec31dbd35b1be2eb9a057677c704_cgraph.svg |   85 -
 ...c31dbd35b1be2eb9a057677c704_cgraph_org.svg |   59 -
 dc/d93/trie__modern_8cpp.html                 |   59 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  101 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   75 -
 dc/d93/trie__modern_8cpp_source.html          |  276 ++
 dc/d9c/babylonian__method_8cpp.html           |  100 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   11 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  120 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   94 -
 ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.map |   13 -
 ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5 |    1 -
 ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg |  138 -
 ...b7e6f15df4b525a2e7705ba3089_cgraph_org.svg |  112 -
 dc/d9c/babylonian__method_8cpp_source.html    |  206 ++
 ...list_1_1_circular_linked_list-members.html |   35 +-
 dc/daa/lru__cache2_8cpp.html                  |   73 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   23 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  291 --
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  208 --
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   25 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  309 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  226 --
 dc/daa/lru__cache2_8cpp_source.html           |  371 +++
 dc/db5/struct_queue.html                      |  175 +-
 dc/db5/text__search_8cpp.html                 |  159 +-
 ...f8975d227cd0e58f298b380c5dac0d9_cgraph.map |    5 -
 ...f8975d227cd0e58f298b380c5dac0d9_cgraph.md5 |    1 -
 ...f8975d227cd0e58f298b380c5dac0d9_cgraph.svg |   65 -
 ...5d227cd0e58f298b380c5dac0d9_cgraph_org.svg |   39 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    9 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  101 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   75 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   21 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  209 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  183 --
 dc/db5/text__search_8cpp_source.html          |  229 ++
 ...ical_methods_2rungekutta_8cpp-example.html |  140 +-
 dc/dc5/namespacereverse__binary__tree.html    |   35 +-
 dc/dc5/paranthesis__matching_8cpp.html        |  103 +-
 dc/dc5/paranthesis__matching_8cpp_source.html |  206 ++
 ...king_1_1generate__parentheses-members.html |   35 +-
 ...lassdata__structures_1_1_bloom_filter.html |  150 +-
 ...76db259488dbfb67624a9652a5ab08b_cgraph.map |   10 -
 ...76db259488dbfb67624a9652a5ab08b_cgraph.md5 |    1 -
 ...76db259488dbfb67624a9652a5ab08b_cgraph.svg |  113 -
 ...259488dbfb67624a9652a5ab08b_cgraph_org.svg |   87 -
 ...7bed8ef62fcb1f33b6c72df47dcf840_cgraph.map |   12 -
 ...7bed8ef62fcb1f33b6c72df47dcf840_cgraph.md5 |    1 -
 ...7bed8ef62fcb1f33b6c72df47dcf840_cgraph.svg |  129 -
 ...8ef62fcb1f33b6c72df47dcf840_cgraph_org.svg |  103 -
 ...earch_1_1comparison__operator-members.html |   35 +-
 ...__decomposition_1_1_h_l_d__coll__graph.map |   10 +-
 ...__decomposition_1_1_h_l_d__coll__graph.md5 |    2 +-
 ...__decomposition_1_1_h_l_d__coll__graph.svg |   10 +-
 ...composition_1_1_h_l_d__coll__graph_org.svg |   10 +-
 dc/dd9/strand__sort_8cpp.html                 |  114 +-
 ...bea2fe5dd38ed63610fdeaddf5785cd_cgraph.map |   22 -
 ...bea2fe5dd38ed63610fdeaddf5785cd_cgraph.md5 |    1 -
 ...bea2fe5dd38ed63610fdeaddf5785cd_cgraph.svg |  218 --
 ...fe5dd38ed63610fdeaddf5785cd_cgraph_org.svg |  192 --
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 dc/dd9/strand__sort_8cpp_source.html          |  199 ++
 ...stack__using__queue_1_1_stack-members.html |   35 +-
 dc/de1/recursive__tree__traversal_8cpp.html   |  233 +-
 ...283886819c7c140a023582b7269e2d0_cgraph.map |   15 -
 ...283886819c7c140a023582b7269e2d0_cgraph.md5 |    1 -
 ...283886819c7c140a023582b7269e2d0_cgraph.svg |  158 -
 ...86819c7c140a023582b7269e2d0_cgraph_org.svg |  132 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.map |   15 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 |    1 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg |  158 -
 ...7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg |  132 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |   30 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |  293 --
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |  267 --
 ...d0455dd5c30adda100e95f0423c786e_cgraph.map |   15 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.md5 |    1 -
 ...d0455dd5c30adda100e95f0423c786e_cgraph.svg |  158 -
 ...5dd5c30adda100e95f0423c786e_cgraph_org.svg |  132 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   32 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  368 ---
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  285 --
 ...ecursive__tree__traversal_8cpp_source.html |  453 +++
 dc/dea/classgraph_1_1_h_k_graph-members.html  |   35 +-
 dc/dec/struct_list_node-members.html          |   35 +-
 ...rie__operations_1_1_tnode__coll__graph.map |    2 +-
 ...rie__operations_1_1_tnode__coll__graph.md5 |    2 +-
 ...rie__operations_1_1_tnode__coll__graph.svg |    2 +-
 ..._operations_1_1_tnode__coll__graph_org.svg |    2 +-
 dc/dfb/atbash__cipher_8cpp.html               |  111 +-
 ...f7dd4dcd3df7c512c20482afc2dbb9d_cgraph.map |    4 -
 ...f7dd4dcd3df7c512c20482afc2dbb9d_cgraph.md5 |    1 -
 ...f7dd4dcd3df7c512c20482afc2dbb9d_cgraph.svg |   57 -
 ...4dcd3df7c512c20482afc2dbb9d_cgraph_org.svg |   31 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 dc/dfb/atbash__cipher_8cpp_source.html        |  199 ++
 dc/dfe/ternary__search_8cpp.html              |  140 +-
 ...3d0099db95022f1eb90ddfd68f73ead_cgraph.map |    4 -
 ...3d0099db95022f1eb90ddfd68f73ead_cgraph.md5 |    1 -
 ...3d0099db95022f1eb90ddfd68f73ead_cgraph.svg |   56 -
 ...99db95022f1eb90ddfd68f73ead_cgraph_org.svg |   30 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   14 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  146 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  120 -
 ...f655a27eb82efa299bf9d0becf6e9c8_cgraph.map |   10 -
 ...f655a27eb82efa299bf9d0becf6e9c8_cgraph.md5 |    1 -
 ...f655a27eb82efa299bf9d0becf6e9c8_cgraph.svg |  110 -
 ...a27eb82efa299bf9d0becf6e9c8_cgraph_org.svg |   84 -
 dc/dfe/ternary__search_8cpp_source.html       |  236 ++
 ..._binary__tree_1_1_binary_tree-members.html |   35 +-
 dd/d0c/hamiltons__cycle_8cpp.html             |  158 +-
 ...cc94918b6831f308d4fe4fa27f08299_cgraph.map |   12 -
 ...cc94918b6831f308d4fe4fa27f08299_cgraph.md5 |    1 -
 ...cc94918b6831f308d4fe4fa27f08299_cgraph.svg |  128 -
 ...918b6831f308d4fe4fa27f08299_cgraph_org.svg |  102 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map |   20 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 |    1 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg |  200 --
 ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg |  174 --
 ...5d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.map |   12 -
 ...5d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.md5 |    1 -
 ...5d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg |  128 -
 ...ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg |  102 -
 ...cf824e347eecfeeb69ea0280f34f3e4_cgraph.map |   10 -
 ...cf824e347eecfeeb69ea0280f34f3e4_cgraph.md5 |    1 -
 ...cf824e347eecfeeb69ea0280f34f3e4_cgraph.svg |  110 -
 ...4e347eecfeeb69ea0280f34f3e4_cgraph_org.svg |   84 -
 ...7880ce913f3058a35ff106d5be9e243_cgraph.map |   12 -
 ...7880ce913f3058a35ff106d5be9e243_cgraph.md5 |    1 -
 ...7880ce913f3058a35ff106d5be9e243_cgraph.svg |  128 -
 ...ce913f3058a35ff106d5be9e243_cgraph_org.svg |  102 -
 dd/d0c/hamiltons__cycle_8cpp_source.html      |  252 ++
 dd/d0d/insertion__sort_8cpp.html              |  150 +-
 ...9914553f24088342c139645a02a8a49_cgraph.map |    5 -
 ...9914553f24088342c139645a02a8a49_cgraph.md5 |    1 -
 ...9914553f24088342c139645a02a8a49_cgraph.svg |   65 -
 ...553f24088342c139645a02a8a49_cgraph_org.svg |   39 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.map |   17 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 |    1 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.svg |  173 --
 ...ad42717780d6caaff9d3d6977f9_cgraph_org.svg |  147 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   21 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  209 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  183 --
 dd/d0d/insertion__sort_8cpp_source.html       |  265 ++
 dd/d12/vigenere__cipher_8cpp.html             |  137 +-
 ...cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.map |    5 -
 ...cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.md5 |    1 -
 ...cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.svg |   66 -
 ...f9b20a0f230a2fcefd31dc6848e_cgraph_org.svg |   40 -
 ...bd3880ea6820c232c1eddf47553c257_cgraph.map |    5 -
 ...bd3880ea6820c232c1eddf47553c257_cgraph.md5 |    1 -
 ...bd3880ea6820c232c1eddf47553c257_cgraph.svg |   66 -
 ...80ea6820c232c1eddf47553c257_cgraph_org.svg |   40 -
 ...1a3968e7947464bee7714f6d43b7002_cgraph.map |    5 -
 ...1a3968e7947464bee7714f6d43b7002_cgraph.md5 |    1 -
 ...1a3968e7947464bee7714f6d43b7002_cgraph.svg |   65 -
 ...68e7947464bee7714f6d43b7002_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 dd/d12/vigenere__cipher_8cpp_source.html      |  222 ++
 dd/d1b/structquery.html                       |   98 +-
 dd/d1c/classhash__chain.html                  |  193 +-
 ...5aa5c6753cb8853152d469c375d946a_cgraph.map |    7 -
 ...5aa5c6753cb8853152d469c375d946a_cgraph.md5 |    1 -
 ...5aa5c6753cb8853152d469c375d946a_cgraph.svg |   83 -
 ...c6753cb8853152d469c375d946a_cgraph_org.svg |   57 -
 ...b4b4de1a8c96f98a63a77f650a9dcff_cgraph.map |    5 -
 ...b4b4de1a8c96f98a63a77f650a9dcff_cgraph.md5 |    1 -
 ...b4b4de1a8c96f98a63a77f650a9dcff_cgraph.svg |   65 -
 ...de1a8c96f98a63a77f650a9dcff_cgraph_org.svg |   39 -
 ...06964ad13587fc9a8b3fe8381d410ed_cgraph.map |    5 -
 ...06964ad13587fc9a8b3fe8381d410ed_cgraph.md5 |    1 -
 ...06964ad13587fc9a8b3fe8381d410ed_cgraph.svg |   65 -
 ...4ad13587fc9a8b3fe8381d410ed_cgraph_org.svg |   39 -
 ...0c8b902a15b4fd062ed727ecf8f3595_cgraph.map |    5 -
 ...0c8b902a15b4fd062ed727ecf8f3595_cgraph.md5 |    1 -
 ...0c8b902a15b4fd062ed727ecf8f3595_cgraph.svg |   65 -
 ...902a15b4fd062ed727ecf8f3595_cgraph_org.svg |   39 -
 dd/d1e/generate__parentheses_8cpp.html        |   75 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   14 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  205 --
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  122 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   16 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  223 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  140 -
 dd/d1e/generate__parentheses_8cpp_source.html |  225 ++
 dd/d1f/classdsu.html                          |  419 ++-
 ...ce2672c570f4235eafddb0c9a58115a_cgraph.map |   14 -
 ...ce2672c570f4235eafddb0c9a58115a_cgraph.md5 |    1 -
 ...ce2672c570f4235eafddb0c9a58115a_cgraph.svg |  146 -
 ...72c570f4235eafddb0c9a58115a_cgraph_org.svg |  120 -
 ...6851f78fe390fc1430905c83d6a2f1c_cgraph.map |    4 -
 ...6851f78fe390fc1430905c83d6a2f1c_cgraph.md5 |    1 -
 ...6851f78fe390fc1430905c83d6a2f1c_cgraph.svg |   56 -
 ...f78fe390fc1430905c83d6a2f1c_cgraph_org.svg |   30 -
 ...c24228b0f2f49220133fb8c3566a55c_cgraph.map |    6 -
 ...c24228b0f2f49220133fb8c3566a55c_cgraph.md5 |    1 -
 ...c24228b0f2f49220133fb8c3566a55c_cgraph.svg |   74 -
 ...28b0f2f49220133fb8c3566a55c_cgraph_org.svg |   48 -
 ...4d25c5986742f7c234ed449b2ff7303_cgraph.map |    6 -
 ...4d25c5986742f7c234ed449b2ff7303_cgraph.md5 |    1 -
 ...4d25c5986742f7c234ed449b2ff7303_cgraph.svg |   74 -
 ...c5986742f7c234ed449b2ff7303_cgraph_org.svg |   48 -
 ...96141b8b092466767f4bfe1c5e46cde_cgraph.map |    6 -
 ...96141b8b092466767f4bfe1c5e46cde_cgraph.md5 |    1 -
 ...96141b8b092466767f4bfe1c5e46cde_cgraph.svg |   74 -
 ...1b8b092466767f4bfe1c5e46cde_cgraph_org.svg |   48 -
 ...ac30c07abca2aaa3b291504c25c3559_cgraph.map |   15 -
 ...ac30c07abca2aaa3b291504c25c3559_cgraph.md5 |    1 -
 ...ac30c07abca2aaa3b291504c25c3559_cgraph.svg |  155 -
 ...c07abca2aaa3b291504c25c3559_cgraph_org.svg |  129 -
 ...1897528bdb53fd5e796d75d7dbc430f_cgraph.map |   11 -
 ...1897528bdb53fd5e796d75d7dbc430f_cgraph.md5 |    1 -
 ...1897528bdb53fd5e796d75d7dbc430f_cgraph.svg |  119 -
 ...528bdb53fd5e796d75d7dbc430f_cgraph_org.svg |   93 -
 ...713a5b496d0405c82e2808a85e58415_cgraph.map |    6 -
 ...713a5b496d0405c82e2808a85e58415_cgraph.md5 |    1 -
 ...713a5b496d0405c82e2808a85e58415_cgraph.svg |   74 -
 ...5b496d0405c82e2808a85e58415_cgraph_org.svg |   48 -
 dd/d21/namespacewindowed__median.html         |   35 +-
 dd/d24/namespacedynamic__programming.html     |  171 +-
 ...66e0e739e7c276eee6e61d5b4d37ce8_cgraph.map |    9 -
 ...66e0e739e7c276eee6e61d5b4d37ce8_cgraph.md5 |    1 -
 ...66e0e739e7c276eee6e61d5b4d37ce8_cgraph.svg |  102 -
 ...e739e7c276eee6e61d5b4d37ce8_cgraph_org.svg |   76 -
 ...a2215194e58786c34db1ccaf8031079_cgraph.map |    5 -
 ...a2215194e58786c34db1ccaf8031079_cgraph.md5 |    1 -
 ...a2215194e58786c34db1ccaf8031079_cgraph.svg |   65 -
 ...5194e58786c34db1ccaf8031079_cgraph_org.svg |   39 -
 ...239174fa0d987f2c67edc1f2af82beb_cgraph.map |    9 -
 ...239174fa0d987f2c67edc1f2af82beb_cgraph.md5 |    1 -
 ...239174fa0d987f2c67edc1f2af82beb_cgraph.svg |  102 -
 ...74fa0d987f2c67edc1f2af82beb_cgraph_org.svg |   76 -
 ...046365a8d77a1267acc082f86135a26_cgraph.map |    5 -
 ...046365a8d77a1267acc082f86135a26_cgraph.md5 |    1 -
 ...046365a8d77a1267acc082f86135a26_cgraph.svg |   66 -
 ...65a8d77a1267acc082f86135a26_cgraph_org.svg |   40 -
 ...e9f45b6e30ee187509da2d1d0093412_cgraph.map |    5 -
 ...e9f45b6e30ee187509da2d1d0093412_cgraph.md5 |    1 -
 ...e9f45b6e30ee187509da2d1d0093412_cgraph.svg |   65 -
 ...5b6e30ee187509da2d1d0093412_cgraph_org.svg |   39 -
 dd/d29/false__position_8cpp.html              |   88 +-
 ...d69b49dc37da1c02b3ab8c7fe783494_cgraph.map |    7 -
 ...d69b49dc37da1c02b3ab8c7fe783494_cgraph.md5 |    1 -
 ...d69b49dc37da1c02b3ab8c7fe783494_cgraph.svg |   85 -
 ...49dc37da1c02b3ab8c7fe783494_cgraph_org.svg |   59 -
 ...5a6ec58b5064d63d4f0df3854496713_cgraph.map |    4 -
 ...5a6ec58b5064d63d4f0df3854496713_cgraph.md5 |    1 -
 ...5a6ec58b5064d63d4f0df3854496713_cgraph.svg |   57 -
 ...c58b5064d63d4f0df3854496713_cgraph_org.svg |   31 -
 ...5cb7bfb90abc898e042d624372c5345_cgraph.map |    6 -
 ...5cb7bfb90abc898e042d624372c5345_cgraph.md5 |    1 -
 ...5cb7bfb90abc898e042d624372c5345_cgraph.svg |   75 -
 ...bfb90abc898e042d624372c5345_cgraph_org.svg |   49 -
 dd/d29/false__position_8cpp_source.html       |  226 ++
 .../namespacedata__structures_1_1treap.html   |   61 +-
 dd/d2f/class_trie.html                        |  163 +-
 ...6941759ecf94d67a27d4a610bc0f63d_cgraph.map |   10 -
 ...6941759ecf94d67a27d4a610bc0f63d_cgraph.md5 |    1 -
 ...6941759ecf94d67a27d4a610bc0f63d_cgraph.svg |  110 -
 ...759ecf94d67a27d4a610bc0f63d_cgraph_org.svg |   84 -
 ...d8b79959009b554e98ea7128b2886f2_cgraph.map |    5 -
 ...d8b79959009b554e98ea7128b2886f2_cgraph.md5 |    1 -
 ...d8b79959009b554e98ea7128b2886f2_cgraph.svg |   65 -
 ...9959009b554e98ea7128b2886f2_cgraph_org.svg |   39 -
 ...ata__structures_1_1tree__234_1_1_node.html |  204 +-
 ...e809ae85ae00e937f67ddb76951b6bb_cgraph.map |    9 -
 ...e809ae85ae00e937f67ddb76951b6bb_cgraph.md5 |    1 -
 ...e809ae85ae00e937f67ddb76951b6bb_cgraph.svg |  105 -
 ...ae85ae00e937f67ddb76951b6bb_cgraph_org.svg |   79 -
 dd/d43/namespace_m_d5.html                    |   35 +-
 dd/d47/namespacemath.html                     |  435 ++-
 ...efb235330ff48e14fd31faaccbcebb3_cgraph.map |    8 -
 ...efb235330ff48e14fd31faaccbcebb3_cgraph.md5 |    1 -
 ...efb235330ff48e14fd31faaccbcebb3_cgraph.svg |   93 -
 ...35330ff48e14fd31faaccbcebb3_cgraph_org.svg |   67 -
 ...d4df7a4e43a2eac1acc0ac610487c73_cgraph.map |    8 -
 ...d4df7a4e43a2eac1acc0ac610487c73_cgraph.md5 |    1 -
 ...d4df7a4e43a2eac1acc0ac610487c73_cgraph.svg |   93 -
 ...7a4e43a2eac1acc0ac610487c73_cgraph_org.svg |   67 -
 ...d704a7b72a6b2db8b76c8581b577b2c_cgraph.map |    8 -
 ...d704a7b72a6b2db8b76c8581b577b2c_cgraph.md5 |    1 -
 ...d704a7b72a6b2db8b76c8581b577b2c_cgraph.svg |   93 -
 ...a7b72a6b2db8b76c8581b577b2c_cgraph_org.svg |   67 -
 ...4d66a77c19ce9b8b3a3d14352b34551_cgraph.map |    5 -
 ...4d66a77c19ce9b8b3a3d14352b34551_cgraph.md5 |    1 -
 ...4d66a77c19ce9b8b3a3d14352b34551_cgraph.svg |   65 -
 ...a77c19ce9b8b3a3d14352b34551_cgraph_org.svg |   39 -
 ...d1e4db743b189f309327572663415f3_cgraph.map |    8 -
 ...d1e4db743b189f309327572663415f3_cgraph.md5 |    1 -
 ...d1e4db743b189f309327572663415f3_cgraph.svg |   92 -
 ...db743b189f309327572663415f3_cgraph_org.svg |   66 -
 ...fdc74c24697ec5bb5c3698c96117c12_cgraph.map |    8 -
 ...fdc74c24697ec5bb5c3698c96117c12_cgraph.md5 |    1 -
 ...fdc74c24697ec5bb5c3698c96117c12_cgraph.svg |   92 -
 ...4c24697ec5bb5c3698c96117c12_cgraph_org.svg |   66 -
 ...fe35440c27758ecc2287e08217d63a7_cgraph.map |   10 -
 ...fe35440c27758ecc2287e08217d63a7_cgraph.md5 |    1 -
 ...fe35440c27758ecc2287e08217d63a7_cgraph.svg |  110 -
 ...440c27758ecc2287e08217d63a7_cgraph_org.svg |   84 -
 ...de184925e68658f15415dd53954df4f_cgraph.map |    8 -
 ...de184925e68658f15415dd53954df4f_cgraph.md5 |    1 -
 ...de184925e68658f15415dd53954df4f_cgraph.svg |   92 -
 ...4925e68658f15415dd53954df4f_cgraph_org.svg |   66 -
 ...e78996673df791014cfe540b183456a_cgraph.map |    4 -
 ...e78996673df791014cfe540b183456a_cgraph.md5 |    1 -
 ...e78996673df791014cfe540b183456a_cgraph.svg |   56 -
 ...96673df791014cfe540b183456a_cgraph_org.svg |   30 -
 ...e6eede206201db0d1dbb618fa969bec_cgraph.map |    5 -
 ...e6eede206201db0d1dbb618fa969bec_cgraph.md5 |    1 -
 ...e6eede206201db0d1dbb618fa969bec_cgraph.svg |   65 -
 ...de206201db0d1dbb618fa969bec_cgraph_org.svg |   39 -
 ...1366864111e1fac29722ca45e02ea8f_cgraph.map |    5 -
 ...1366864111e1fac29722ca45e02ea8f_cgraph.md5 |    1 -
 ...1366864111e1fac29722ca45e02ea8f_cgraph.svg |   65 -
 ...864111e1fac29722ca45e02ea8f_cgraph_org.svg |   39 -
 ...4db02b3c9e55a69ac1696f30e2f761c_cgraph.map |    8 -
 ...4db02b3c9e55a69ac1696f30e2f761c_cgraph.md5 |    1 -
 ...4db02b3c9e55a69ac1696f30e2f761c_cgraph.svg |   92 -
 ...2b3c9e55a69ac1696f30e2f761c_cgraph_org.svg |   66 -
 ...cb1411ef2029e81f249c21e17c96fdb_cgraph.map |    5 -
 ...cb1411ef2029e81f249c21e17c96fdb_cgraph.md5 |    1 -
 ...cb1411ef2029e81f249c21e17c96fdb_cgraph.svg |   65 -
 ...11ef2029e81f249c21e17c96fdb_cgraph_org.svg |   39 -
 ...3b920cc56442abd92279ba23b50f4dc_cgraph.map |    8 -
 ...3b920cc56442abd92279ba23b50f4dc_cgraph.md5 |    1 -
 ...3b920cc56442abd92279ba23b50f4dc_cgraph.svg |   92 -
 ...0cc56442abd92279ba23b50f4dc_cgraph_org.svg |   66 -
 ...de24398be43538c62e4a496968e60ca_cgraph.map |   10 -
 ...de24398be43538c62e4a496968e60ca_cgraph.md5 |    1 -
 ...de24398be43538c62e4a496968e60ca_cgraph.svg |  110 -
 ...398be43538c62e4a496968e60ca_cgraph_org.svg |   84 -
 ...f7f2a6d91f1ca6c89698792aea3f188_cgraph.map |    5 -
 ...f7f2a6d91f1ca6c89698792aea3f188_cgraph.md5 |    1 -
 ...f7f2a6d91f1ca6c89698792aea3f188_cgraph.svg |   65 -
 ...a6d91f1ca6c89698792aea3f188_cgraph_org.svg |   39 -
 ...5803413618fcfb922cb32c6db0fc864_cgraph.map |    8 -
 ...5803413618fcfb922cb32c6db0fc864_cgraph.md5 |    1 -
 ...5803413618fcfb922cb32c6db0fc864_cgraph.svg |   92 -
 ...413618fcfb922cb32c6db0fc864_cgraph_org.svg |   66 -
 ...09d59850865012a6fd95d89954c82e4_cgraph.map |   11 -
 ...09d59850865012a6fd95d89954c82e4_cgraph.md5 |    1 -
 ...09d59850865012a6fd95d89954c82e4_cgraph.svg |  119 -
 ...9850865012a6fd95d89954c82e4_cgraph_org.svg |   93 -
 ...413098478fa38acaac887b7654f0725_cgraph.map |    5 -
 ...413098478fa38acaac887b7654f0725_cgraph.md5 |    1 -
 ...413098478fa38acaac887b7654f0725_cgraph.svg |   65 -
 ...98478fa38acaac887b7654f0725_cgraph_org.svg |   39 -
 dd/d4f/class_solution.html                    |  231 +-
 dd/d51/classstack-members.html                |   35 +-
 ...ructdouble__hashing_1_1_entry-members.html |   35 +-
 ...earest__neighbors_1_1_knn__coll__graph.map |    6 +-
 ...earest__neighbors_1_1_knn__coll__graph.md5 |    2 +-
 ...earest__neighbors_1_1_knn__coll__graph.svg |    6 +-
 ...st__neighbors_1_1_knn__coll__graph_org.svg |    6 +-
 ...uctstrings_1_1boyer__moore_1_1pattern.html |   72 +-
 dd/d65/lu__decompose_8cpp.html                |  167 +-
 ...283886819c7c140a023582b7269e2d0_cgraph.map |   10 -
 ...283886819c7c140a023582b7269e2d0_cgraph.md5 |    1 -
 ...283886819c7c140a023582b7269e2d0_cgraph.svg |  110 -
 ...86819c7c140a023582b7269e2d0_cgraph_org.svg |   84 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.map |   11 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 |    1 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg |  119 -
 ...7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg |   93 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map |   23 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 |    1 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg |  284 --
 ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg |  201 --
 ...75c989afcc78e875031cd4273e62a3e_cgraph.map |   13 -
 ...75c989afcc78e875031cd4273e62a3e_cgraph.md5 |    1 -
 ...75c989afcc78e875031cd4273e62a3e_cgraph.svg |  137 -
 ...89afcc78e875031cd4273e62a3e_cgraph_org.svg |  111 -
 dd/d65/lu__decompose_8cpp_source.html         |  228 ++
 dd/d69/namespacerange__queries.html           |   41 +-
 .../namespaceiterative__tree__traversals.html |   35 +-
 .../namespaceinorder__successor__of__bst.html |   35 +-
 dd/d7a/classdouble__linked__list-members.html |   35 +-
 dd/d81/namespacecaesar.html                   |   35 +-
 dd/d89/insertion__sort__recursive_8cpp.html   |  127 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |   17 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |  173 --
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |  147 -
 ...9914553f24088342c139645a02a8a49_cgraph.map |    5 -
 ...9914553f24088342c139645a02a8a49_cgraph.md5 |    1 -
 ...9914553f24088342c139645a02a8a49_cgraph.svg |   65 -
 ...553f24088342c139645a02a8a49_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   19 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  191 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  165 -
 ...nsertion__sort__recursive_8cpp_source.html |  238 ++
 dd/d8a/namespacegeometric__dist.html          |   35 +-
 dd/d92/memory__game_8cpp.html                 |  114 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  378 ---
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  352 ---
 dd/d92/memory__game_8cpp_source.html          |  479 +++
 ...lassdata__structures_1_1_segment_tree.html |  197 +-
 ...c5331b509d9b55bedfadf979b30dd5b_cgraph.map |   14 -
 ...c5331b509d9b55bedfadf979b30dd5b_cgraph.md5 |    1 -
 ...c5331b509d9b55bedfadf979b30dd5b_cgraph.svg |  150 -
 ...1b509d9b55bedfadf979b30dd5b_cgraph_org.svg |  124 -
 ...a04f1832c5ce86def50c3021b2ab6b1_cgraph.map |    8 -
 ...a04f1832c5ce86def50c3021b2ab6b1_cgraph.md5 |    1 -
 ...a04f1832c5ce86def50c3021b2ab6b1_cgraph.svg |   95 -
 ...1832c5ce86def50c3021b2ab6b1_cgraph_org.svg |   69 -
 ...fecc48e8e3f6f5f6e728495a4282e52_cgraph.map |   12 -
 ...fecc48e8e3f6f5f6e728495a4282e52_cgraph.md5 |    1 -
 ...fecc48e8e3f6f5f6e728495a4282e52_cgraph.svg |  131 -
 ...48e8e3f6f5f6e728495a4282e52_cgraph_org.svg |  105 -
 ...0e78179ab979ae2bc4304bdc181db17_cgraph.map |   10 -
 ...0e78179ab979ae2bc4304bdc181db17_cgraph.md5 |    1 -
 ...0e78179ab979ae2bc4304bdc181db17_cgraph.svg |  114 -
 ...179ab979ae2bc4304bdc181db17_cgraph_org.svg |   88 -
 ...reedy__algorithms_1_1stable__matching.html |   80 +-
 ...d7e84df47dcf19e88f95f8f9040306c_cgraph.map |    5 -
 ...d7e84df47dcf19e88f95f8f9040306c_cgraph.md5 |    1 -
 ...d7e84df47dcf19e88f95f8f9040306c_cgraph.svg |   67 -
 ...4df47dcf19e88f95f8f9040306c_cgraph_org.svg |   41 -
 ...ng_1_1aystar__search_1_1_eight_puzzle.html |  201 +-
 ...802cf6197a255055cb734d626abc101_cgraph.map |    5 -
 ...802cf6197a255055cb734d626abc101_cgraph.md5 |    1 -
 ...802cf6197a255055cb734d626abc101_cgraph.svg |   66 -
 ...f6197a255055cb734d626abc101_cgraph_org.svg |   40 -
 ...6a976171392d257ca0f814ed73e0658_cgraph.map |   11 -
 ...6a976171392d257ca0f814ed73e0658_cgraph.md5 |    1 -
 ...6a976171392d257ca0f814ed73e0658_cgraph.svg |  123 -
 ...6171392d257ca0f814ed73e0658_cgraph_org.svg |   97 -
 ...5c0486c7f29f323a2aced2ab33af420_cgraph.map |    5 -
 ...5c0486c7f29f323a2aced2ab33af420_cgraph.md5 |    1 -
 ...5c0486c7f29f323a2aced2ab33af420_cgraph.svg |   67 -
 ...86c7f29f323a2aced2ab33af420_cgraph_org.svg |   41 -
 ...es_1_1list__array_1_1list__coll__graph.map |    8 +-
 ...es_1_1list__array_1_1list__coll__graph.md5 |    2 +-
 ...es_1_1list__array_1_1list__coll__graph.svg |   27 +-
 ..._1list__array_1_1list__coll__graph_org.svg |   27 +-
 dd/da0/todo.html                              |   37 +-
 dd/da8/pigeonhole__sort_8cpp.html             |  119 +-
 ...4b8683a2b429de5cce57e6d733ec817_cgraph.map |   19 -
 ...4b8683a2b429de5cce57e6d733ec817_cgraph.md5 |    1 -
 ...4b8683a2b429de5cce57e6d733ec817_cgraph.svg |  191 --
 ...83a2b429de5cce57e6d733ec817_cgraph_org.svg |  165 -
 ...58410412185a5f09199deaff7157a8d_cgraph.map |   19 -
 ...58410412185a5f09199deaff7157a8d_cgraph.md5 |    1 -
 ...58410412185a5f09199deaff7157a8d_cgraph.svg |  191 --
 ...0412185a5f09199deaff7157a8d_cgraph_org.svg |  165 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   35 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  335 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  309 --
 ...31ec5409537703d9c8a47350386b32a_cgraph.map |   19 -
 ...31ec5409537703d9c8a47350386b32a_cgraph.md5 |    1 -
 ...31ec5409537703d9c8a47350386b32a_cgraph.svg |  191 --
 ...5409537703d9c8a47350386b32a_cgraph_org.svg |  165 -
 dd/da8/pigeonhole__sort_8cpp_source.html      |  244 ++
 .../struct_segment_intersection-members.html  |   35 +-
 dd/dae/namespacecount__of__set__bits.html     |   35 +-
 ...tquadratic__probing_1_1_entry-members.html |   35 +-
 ...us_2sorting_2wiggle_sort_8cpp-example.html |  160 +-
 ...ns__multiplication_1_1_matrix-members.html |   35 +-
 ...ructbinary__search__tree_1_1bst__node.html |   59 +-
 dd/dba/namespacedivide__and__conquer.html     |   41 +-
 dd/dbb/struct_test_case-members.html          |   35 +-
 dd/dc3/is__graph__bipartite2_8cpp_source.html |  214 ++
 dd/dca/class_f_c_f_s.html                     |  167 +-
 ...fbfe4d85f7576b4a7aade07d29fbd69_cgraph.map |    9 -
 ...fbfe4d85f7576b4a7aade07d29fbd69_cgraph.md5 |    1 -
 ...fbfe4d85f7576b4a7aade07d29fbd69_cgraph.svg |  103 -
 ...4d85f7576b4a7aade07d29fbd69_cgraph_org.svg |   77 -
 ...b361a612b18bb189aa6d3c49288b793_cgraph.map |    9 -
 ...b361a612b18bb189aa6d3c49288b793_cgraph.md5 |    1 -
 ...b361a612b18bb189aa6d3c49288b793_cgraph.svg |  101 -
 ...a612b18bb189aa6d3c49288b793_cgraph_org.svg |   75 -
 dd/dd5/swap__sort_8cpp_source.html            |  206 ++
 ..._1recursive__tree__traversals_1_1_b_t.html |  145 +-
 ...397b78ceec18cb1959a1d159e134da5_cgraph.map |    6 -
 ...397b78ceec18cb1959a1d159e134da5_cgraph.md5 |    1 -
 ...397b78ceec18cb1959a1d159e134da5_cgraph.svg |   75 -
 ...78ceec18cb1959a1d159e134da5_cgraph_org.svg |   49 -
 ...9404b65f407f631915515fa2e08a40c_cgraph.map |    4 -
 ...9404b65f407f631915515fa2e08a40c_cgraph.md5 |    1 -
 ...9404b65f407f631915515fa2e08a40c_cgraph.svg |   57 -
 ...b65f407f631915515fa2e08a40c_cgraph_org.svg |   31 -
 dd/dec/a__star__search_8cpp_source.html       |  719 +++++
 ...ight__decomposition_1_1_h_l_d-members.html |   35 +-
 ...aph_1_1is__graph__bipartite_1_1_graph.html |  181 +-
 ...aef65b40347c4606662cad4dd2e14d3_cgraph.map |    5 -
 ...aef65b40347c4606662cad4dd2e14d3_cgraph.md5 |    1 -
 ...aef65b40347c4606662cad4dd2e14d3_cgraph.svg |   66 -
 ...5b40347c4606662cad4dd2e14d3_cgraph_org.svg |   40 -
 ...16cda7e563198f778fd32e03992763b_cgraph.map |    5 -
 ...16cda7e563198f778fd32e03992763b_cgraph.md5 |    1 -
 ...16cda7e563198f778fd32e03992763b_cgraph.svg |   66 -
 ...a7e563198f778fd32e03992763b_cgraph_org.svg |   40 -
 de/d07/cycle__sort_8cpp.html                  |  131 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   11 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  119 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   93 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   13 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  137 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  111 -
 ...79a9d247691fce0d655fce75f1c04fa_cgraph.map |    8 -
 ...79a9d247691fce0d655fce75f1c04fa_cgraph.md5 |    1 -
 ...79a9d247691fce0d655fce75f1c04fa_cgraph.svg |   93 -
 ...d247691fce0d655fce75f1c04fa_cgraph_org.svg |   67 -
 de/d07/cycle__sort_8cpp_source.html           |  244 ++
 de/d0a/namespacemerge__insertion.html         |   35 +-
 .../classrange__queries_1_1fenwick__tree.html |  145 +-
 ...914a4b1401a7c427de91c92885724fe_cgraph.map |    7 -
 ...914a4b1401a7c427de91c92885724fe_cgraph.md5 |    1 -
 ...914a4b1401a7c427de91c92885724fe_cgraph.svg |   86 -
 ...4b1401a7c427de91c92885724fe_cgraph_org.svg |   60 -
 ...9dea5e88bbd7683a719030623315de9_cgraph.map |    5 -
 ...9dea5e88bbd7683a719030623315de9_cgraph.md5 |    1 -
 ...9dea5e88bbd7683a719030623315de9_cgraph.svg |   67 -
 ...5e88bbd7683a719030623315de9_cgraph_org.svg |   41 -
 ...fa0559d987fde0044761b17b35f5abd_cgraph.map |    5 -
 ...fa0559d987fde0044761b17b35f5abd_cgraph.md5 |    1 -
 ...fa0559d987fde0044761b17b35f5abd_cgraph.svg |   67 -
 ...59d987fde0044761b17b35f5abd_cgraph_org.svg |   41 -
 ...ea37183524553bbf2234a36a44a4b9a_cgraph.map |    9 -
 ...ea37183524553bbf2234a36a44a4b9a_cgraph.md5 |    1 -
 ...ea37183524553bbf2234a36a44a4b9a_cgraph.svg |  104 -
 ...183524553bbf2234a36a44a4b9a_cgraph_org.svg |   78 -
 ...f7ba885b91af093e9e514358fa0f36c_cgraph.map |    5 -
 ...f7ba885b91af093e9e514358fa0f36c_cgraph.md5 |    1 -
 ...f7ba885b91af093e9e514358fa0f36c_cgraph.svg |   66 -
 ...885b91af093e9e514358fa0f36c_cgraph_org.svg |   40 -
 de/d0d/fibonacci__search_8cpp.html            |  150 +-
 ...bc61b3903d9a53061bf31e5d110fe61_cgraph.map |    9 -
 ...bc61b3903d9a53061bf31e5d110fe61_cgraph.md5 |    1 -
 ...bc61b3903d9a53061bf31e5d110fe61_cgraph.svg |  101 -
 ...b3903d9a53061bf31e5d110fe61_cgraph_org.svg |   75 -
 ...aa09bef74ee063c1331de0883af4f4f_cgraph.map |   25 -
 ...aa09bef74ee063c1331de0883af4f4f_cgraph.md5 |    1 -
 ...aa09bef74ee063c1331de0883af4f4f_cgraph.svg |  245 --
 ...bef74ee063c1331de0883af4f4f_cgraph_org.svg |  219 --
 ...e144326104e57a3808aed7eb098db0d_cgraph.map |   25 -
 ...e144326104e57a3808aed7eb098db0d_cgraph.md5 |    1 -
 ...e144326104e57a3808aed7eb098db0d_cgraph.svg |  245 --
 ...326104e57a3808aed7eb098db0d_cgraph_org.svg |  219 --
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   38 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  362 ---
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  336 --
 de/d0d/fibonacci__search_8cpp_source.html     |  253 ++
 de/d1e/armstrong__number_8cpp_source.html     |  196 ++
 ..._modulo__p_1_1_n_c_r_modulo_p-members.html |   35 +-
 .../classothers_1_1_cache_1_1_d___node.html   |  127 +-
 de/d23/disjoint__set_8cpp.html                |  140 +-
 ...fb0a7cd26a477e2d48ba7e0118bc985_cgraph.map |    6 -
 ...fb0a7cd26a477e2d48ba7e0118bc985_cgraph.md5 |    1 -
 ...fb0a7cd26a477e2d48ba7e0118bc985_cgraph.svg |   74 -
 ...7cd26a477e2d48ba7e0118bc985_cgraph_org.svg |   48 -
 ...4b9ead0608e676d9ae5188672427cc8_cgraph.map |    4 -
 ...4b9ead0608e676d9ae5188672427cc8_cgraph.md5 |    1 -
 ...4b9ead0608e676d9ae5188672427cc8_cgraph.svg |   56 -
 ...ad0608e676d9ae5188672427cc8_cgraph_org.svg |   30 -
 ...4481bb75386fbb0f958a388d4b9f757_cgraph.map |    6 -
 ...4481bb75386fbb0f958a388d4b9f757_cgraph.md5 |    1 -
 ...4481bb75386fbb0f958a388d4b9f757_cgraph.svg |   74 -
 ...bb75386fbb0f958a388d4b9f757_cgraph_org.svg |   48 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   13 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  137 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  111 -
 de/d23/disjoint__set_8cpp_source.html         |  214 ++
 de/d33/circular__linked__list_8cpp.html       |   73 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   15 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  155 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  129 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   17 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  173 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  147 -
 .../circular__linked__list_8cpp_source.html   |  413 +++
 ...s_1_1linked__list_1_1link__coll__graph.map |    2 +-
 ...s_1_1linked__list_1_1link__coll__graph.md5 |    2 +-
 ...s_1_1linked__list_1_1link__coll__graph.svg |    2 +-
 ...1linked__list_1_1link__coll__graph_org.svg |    2 +-
 ...__structures_1_1_bloom_filter-members.html |   35 +-
 de/d36/namespacen__bonacci.html               |   35 +-
 de/d40/shell__sort_8cpp_source.html           |  176 ++
 de/d41/namespacekaratsuba__algorithm.html     |   35 +-
 de/d47/string__fibonacci_8cpp.html            |  111 +-
 ...8052eee05d43c2ebc5147c52bd50c35_cgraph.map |    7 -
 ...8052eee05d43c2ebc5147c52bd50c35_cgraph.md5 |    1 -
 ...8052eee05d43c2ebc5147c52bd50c35_cgraph.svg |   83 -
 ...eee05d43c2ebc5147c52bd50c35_cgraph_org.svg |   57 -
 ...8055ee368a5d5b24de01bdde6bf8fca_cgraph.map |    9 -
 ...8055ee368a5d5b24de01bdde6bf8fca_cgraph.md5 |    1 -
 ...8055ee368a5d5b24de01bdde6bf8fca_cgraph.svg |  101 -
 ...ee368a5d5b24de01bdde6bf8fca_cgraph_org.svg |   75 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   11 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  119 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   93 -
 de/d47/string__fibonacci_8cpp_source.html     |  217 ++
 de/d48/struct_trie_1_1_trie_node.html         |   47 +-
 de/d4a/class_compare.html                     |   47 +-
 ...t__decomposition_1_1_tree__coll__graph.map |   10 +-
 ...t__decomposition_1_1_tree__coll__graph.md5 |    2 +-
 ...t__decomposition_1_1_tree__coll__graph.svg |   10 +-
 ...ecomposition_1_1_tree__coll__graph_org.svg |   10 +-
 de/d57/struct_test_case__coll__graph.map      |   10 +-
 de/d57/struct_test_case__coll__graph.md5      |    2 +-
 de/d57/struct_test_case__coll__graph.svg      |   39 +-
 de/d57/struct_test_case__coll__graph_org.svg  |   39 +-
 .../queue__using__linkedlist_8cpp_source.html |  231 ++
 ..._1_1per_seg_tree_1_1_node__coll__graph.map |    2 +-
 ..._1_1per_seg_tree_1_1_node__coll__graph.md5 |    2 +-
 ..._1_1per_seg_tree_1_1_node__coll__graph.svg |    2 +-
 ...per_seg_tree_1_1_node__coll__graph_org.svg |    2 +-
 de/d6a/knuth__morris__pratt_8cpp.html         |   54 +-
 de/d6a/knuth__morris__pratt_8cpp_source.html  |  211 ++
 .../namespacerandom__pivot__quick__sort.html  |   35 +-
 de/d72/geometric__dist_8cpp.html              |  120 +-
 ...0fd1cc5c3a2813f28683dc75dcd65b6_cgraph.map |   20 -
 ...0fd1cc5c3a2813f28683dc75dcd65b6_cgraph.md5 |    1 -
 ...0fd1cc5c3a2813f28683dc75dcd65b6_cgraph.svg |  266 --
 ...cc5c3a2813f28683dc75dcd65b6_cgraph_org.svg |  183 --
 ...2964ca6180507deb5fafc71050012ba_cgraph.map |    4 -
 ...2964ca6180507deb5fafc71050012ba_cgraph.md5 |    1 -
 ...2964ca6180507deb5fafc71050012ba_cgraph.svg |   57 -
 ...ca6180507deb5fafc71050012ba_cgraph_org.svg |   31 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   43 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  481 ---
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  398 ---
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   45 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  499 ---
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  416 ---
 de/d72/geometric__dist_8cpp_source.html       |  323 ++
 de/d75/qr__eigen__values_8cpp.html            |  185 +-
 ...283886819c7c140a023582b7269e2d0_cgraph.map |   20 -
 ...283886819c7c140a023582b7269e2d0_cgraph.md5 |    1 -
 ...283886819c7c140a023582b7269e2d0_cgraph.svg |  258 --
 ...86819c7c140a023582b7269e2d0_cgraph_org.svg |  175 --
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.map |   20 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 |    1 -
 ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg |  258 --
 ...7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg |  175 --
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map |   35 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 |    1 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg |  393 ---
 ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg |  310 --
 ...bbf469d5525a816b0d6ca812119093d_cgraph.map |    5 -
 ...bbf469d5525a816b0d6ca812119093d_cgraph.md5 |    1 -
 ...bbf469d5525a816b0d6ca812119093d_cgraph.svg |   65 -
 ...69d5525a816b0d6ca812119093d_cgraph_org.svg |   39 -
 de/d75/qr__eigen__values_8cpp_source.html     |  379 +++
 ...metic_3_01uint256__t_01_4__coll__graph.map |    2 +-
 ...metic_3_01uint256__t_01_4__coll__graph.md5 |    2 +-
 ...metic_3_01uint256__t_01_4__coll__graph.svg |    2 +-
 ...c_3_01uint256__t_01_4__coll__graph_org.svg |    2 +-
 de/d77/tree__height_8cpp_source.html          |  210 ++
 .../graham__scan__algorithm_8cpp_source.html  |  215 ++
 de/d7b/merge__insertion__sort_8cpp.html       |  153 +-
 ...cba4fbf287ab8cb978ed7f8fef886b1_cgraph.map |    6 -
 ...cba4fbf287ab8cb978ed7f8fef886b1_cgraph.md5 |    1 -
 ...cba4fbf287ab8cb978ed7f8fef886b1_cgraph.svg |   75 -
 ...fbf287ab8cb978ed7f8fef886b1_cgraph_org.svg |   49 -
 ...161278f18e83b671c6454b139cc5674_cgraph.map |    8 -
 ...161278f18e83b671c6454b139cc5674_cgraph.md5 |    1 -
 ...161278f18e83b671c6454b139cc5674_cgraph.svg |   94 -
 ...78f18e83b671c6454b139cc5674_cgraph_org.svg |   68 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   13 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  137 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  111 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   19 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  191 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  165 -
 ...4de4067a9a866ffd985c5b5055ccedf_cgraph.map |    5 -
 ...4de4067a9a866ffd985c5b5055ccedf_cgraph.md5 |    1 -
 ...4de4067a9a866ffd985c5b5055ccedf_cgraph.svg |   66 -
 ...067a9a866ffd985c5b5055ccedf_cgraph_org.svg |   40 -
 .../merge__insertion__sort_8cpp_source.html   |  260 ++
 de/d7c/struct_trie_1_1_trie_node-members.html |   35 +-
 de/d83/namespaceis__graph__bipartite.html     |   35 +-
 de/d85/decimal__to__roman__numeral_8cpp.html  |  115 +-
 ...03fb4e1b08279fe4cd50fbbc2782c2d_cgraph.map |    6 -
 ...03fb4e1b08279fe4cd50fbbc2782c2d_cgraph.md5 |    1 -
 ...03fb4e1b08279fe4cd50fbbc2782c2d_cgraph.svg |   74 -
 ...4e1b08279fe4cd50fbbc2782c2d_cgraph_org.svg |   48 -
 ...14743638eff1336f835310049aef979_cgraph.map |    6 -
 ...14743638eff1336f835310049aef979_cgraph.md5 |    1 -
 ...14743638eff1336f835310049aef979_cgraph.svg |   74 -
 ...3638eff1336f835310049aef979_cgraph_org.svg |   48 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   12 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  128 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  102 -
 ...cimal__to__roman__numeral_8cpp_source.html |  232 ++
 .../travelling__salesman__problem_8cpp.html   |   97 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |   17 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |  174 --
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |  148 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   22 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  219 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  193 --
 ...elling__salesman__problem_8cpp_source.html |  215 ++
 .../graham__scan__functions_8hpp_source.html  |  111 +-
 de/d8a/class_trie-members.html                |   35 +-
 de/d8c/partition__problem_8cpp_source.html    |  248 ++
 de/d8d/class_f_c_f_s-members.html             |   35 +-
 ...fix__expression_1_1_stack__coll__graph.map |    2 +-
 ...fix__expression_1_1_stack__coll__graph.md5 |    2 +-
 ...fix__expression_1_1_stack__coll__graph.svg |    2 +-
 ..._expression_1_1_stack__coll__graph_org.svg |    2 +-
 ...gorithms_1_1_digit_separation-members.html |   35 +-
 de/d91/structlist-members.html                |   35 +-
 de/d95/namespace_subsets.html                 |   35 +-
 de/d99/aliquot__sum_8cpp.html                 |   66 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 de/d99/aliquot__sum_8cpp_source.html          |  188 ++
 de/d9b/namespacegray__code.html               |   35 +-
 de/d9b/prime__numbers_8cpp.html               |   95 +-
 ...575f3a51eeb8a57d657b3db6a4b441a_cgraph.map |    5 -
 ...575f3a51eeb8a57d657b3db6a4b441a_cgraph.md5 |    1 -
 ...575f3a51eeb8a57d657b3db6a4b441a_cgraph.svg |   65 -
 ...3a51eeb8a57d657b3db6a4b441a_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  101 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   75 -
 de/d9b/prime__numbers_8cpp_source.html        |  176 ++
 ...a__structures_1_1linked__list_1_1link.html |  116 +-
 de/dab/ncr__modulo__p_8cpp.html               |   96 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |    5 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |   66 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   40 -
 ...c7bfe3bdaa086d32261a5c5584d0fa9_cgraph.map |    9 -
 ...c7bfe3bdaa086d32261a5c5584d0fa9_cgraph.md5 |    1 -
 ...c7bfe3bdaa086d32261a5c5584d0fa9_cgraph.svg |  103 -
 ...e3bdaa086d32261a5c5584d0fa9_cgraph_org.svg |   77 -
 ...010ad5669d31449c3bf3271ab5ebc86_cgraph.map |    6 -
 ...010ad5669d31449c3bf3271ab5ebc86_cgraph.md5 |    1 -
 ...010ad5669d31449c3bf3271ab5ebc86_cgraph.svg |   75 -
 ...d5669d31449c3bf3271ab5ebc86_cgraph_org.svg |   49 -
 de/dab/ncr__modulo__p_8cpp_source.html        |  297 ++
 de/db3/namespaceatbash.html                   |   35 +-
 de/db4/namespacedisjoint__union.html          |   35 +-
 de/db5/class_edge-members.html                |   35 +-
 de/db6/a1z26__cipher_8cpp.html                |  187 +-
 ...a78954e96c862430904ee3e64623c38_cgraph.map |   10 -
 ...a78954e96c862430904ee3e64623c38_cgraph.md5 |    1 -
 ...a78954e96c862430904ee3e64623c38_cgraph.svg |  110 -
 ...54e96c862430904ee3e64623c38_cgraph_org.svg |   84 -
 ...7a6b827a0b9c7aca2d705811459d744_cgraph.map |   14 -
 ...7a6b827a0b9c7aca2d705811459d744_cgraph.md5 |    1 -
 ...7a6b827a0b9c7aca2d705811459d744_cgraph.svg |  146 -
 ...827a0b9c7aca2d705811459d744_cgraph_org.svg |  120 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 de/db6/a1z26__cipher_8cpp_source.html         |  274 ++
 de/dc3/binaryheap_8cpp.html                   |   54 +-
 de/dc3/binaryheap_8cpp_source.html            |  284 ++
 de/dc3/fibonacci__sum_8cpp.html               |  166 +-
 ...93fbaa7a94e3b7ca573111237bb3742_cgraph.map |   10 -
 ...93fbaa7a94e3b7ca573111237bb3742_cgraph.md5 |    1 -
 ...93fbaa7a94e3b7ca573111237bb3742_cgraph.svg |  113 -
 ...aa7a94e3b7ca573111237bb3742_cgraph_org.svg |   87 -
 ...cf5feaf168b88e74544da59ed830311_cgraph.map |    4 -
 ...cf5feaf168b88e74544da59ed830311_cgraph.md5 |    1 -
 ...cf5feaf168b88e74544da59ed830311_cgraph.svg |   57 -
 ...eaf168b88e74544da59ed830311_cgraph_org.svg |   31 -
 ...c83cca09a3e4ff2a25c816a9303448e_cgraph.map |    9 -
 ...c83cca09a3e4ff2a25c816a9303448e_cgraph.md5 |    1 -
 ...c83cca09a3e4ff2a25c816a9303448e_cgraph.svg |  104 -
 ...ca09a3e4ff2a25c816a9303448e_cgraph_org.svg |   78 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   71 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  748 -----
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  665 ----
 ...db40ac4c74a7efc0680b83eeee138aa_cgraph.map |    7 -
 ...db40ac4c74a7efc0680b83eeee138aa_cgraph.md5 |    1 -
 ...db40ac4c74a7efc0680b83eeee138aa_cgraph.svg |   85 -
 ...ac4c74a7efc0680b83eeee138aa_cgraph_org.svg |   59 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   73 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  766 -----
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  683 ----
 de/dc3/fibonacci__sum_8cpp_source.html        |  246 ++
 .../intersection__of__two__arrays_8cpp.html   |   81 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   23 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  227 --
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  201 --
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   25 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  245 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  219 --
 ...rsection__of__two__arrays_8cpp_source.html |  291 ++
 de/dc8/classlarge__number-members.html        |   35 +-
 de/dcd/kadanes3_8cpp.html                     |   83 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 de/dcd/kadanes3_8cpp_source.html              |  203 ++
 de/dcf/binary__exponent_8cpp.html             |   96 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    8 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   92 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   66 -
 ...b48dce0725e63d19147944f41843c73_cgraph.map |    4 -
 ...b48dce0725e63d19147944f41843c73_cgraph.md5 |    1 -
 ...b48dce0725e63d19147944f41843c73_cgraph.svg |   56 -
 ...ce0725e63d19147944f41843c73_cgraph_org.svg |   30 -
 de/dcf/binary__exponent_8cpp_source.html      |  186 ++
 ...reverse__binary__tree_1_1_binary_tree.html |  207 +-
 ...c0d27198372b36ef71bc58af8336b9c_cgraph.map |    6 -
 ...c0d27198372b36ef71bc58af8336b9c_cgraph.md5 |    1 -
 ...c0d27198372b36ef71bc58af8336b9c_cgraph.svg |   78 -
 ...7198372b36ef71bc58af8336b9c_cgraph_org.svg |   52 -
 ...e683b271d8d5cd63e0d09cf8aaa325c_cgraph.map |   11 -
 ...e683b271d8d5cd63e0d09cf8aaa325c_cgraph.md5 |    1 -
 ...e683b271d8d5cd63e0d09cf8aaa325c_cgraph.svg |  121 -
 ...b271d8d5cd63e0d09cf8aaa325c_cgraph_org.svg |   95 -
 ...34645d1aabdf1a7e5897c85376f173d_cgraph.map |    6 -
 ...34645d1aabdf1a7e5897c85376f173d_cgraph.md5 |    1 -
 ...34645d1aabdf1a7e5897c85376f173d_cgraph.svg |   77 -
 ...5d1aabdf1a7e5897c85376f173d_cgraph_org.svg |   51 -
 ...cf972a2c994a4fa1a89fc77bd5ad503_cgraph.map |   13 -
 ...cf972a2c994a4fa1a89fc77bd5ad503_cgraph.md5 |    1 -
 ...cf972a2c994a4fa1a89fc77bd5ad503_cgraph.svg |  197 --
 ...2a2c994a4fa1a89fc77bd5ad503_cgraph_org.svg |  114 -
 ...b2b6be741b0500ee75d89b6d06b5d50_cgraph.map |    4 -
 ...b2b6be741b0500ee75d89b6d06b5d50_cgraph.md5 |    1 -
 ...b2b6be741b0500ee75d89b6d06b5d50_cgraph.svg |   58 -
 ...be741b0500ee75d89b6d06b5d50_cgraph_org.svg |   32 -
 ...6f974381f523fdb981fc2d843bbf4a1_cgraph.map |    4 -
 ...6f974381f523fdb981fc2d843bbf4a1_cgraph.md5 |    1 -
 ...6f974381f523fdb981fc2d843bbf4a1_cgraph.svg |   58 -
 ...4381f523fdb981fc2d843bbf4a1_cgraph_org.svg |   32 -
 de/dd1/segment__tree_8cpp.html                |   66 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   19 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  195 --
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  169 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   21 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  213 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  187 --
 de/dd1/segment__tree_8cpp_source.html         |  236 ++
 de/dd3/namespace_s_h_a.html                   |   35 +-
 de/dd3/newton__raphson__method_8cpp.html      |  157 +-
 ...003b5b2dcfff0769b957ab5c968b03d_cgraph.map |    5 -
 ...003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 |    1 -
 ...003b5b2dcfff0769b957ab5c968b03d_cgraph.svg |   65 -
 ...5b2dcfff0769b957ab5c968b03d_cgraph_org.svg |   39 -
 ...d3f7f41977394680af6ebbed96f3386_cgraph.map |    5 -
 ...d3f7f41977394680af6ebbed96f3386_cgraph.md5 |    1 -
 ...d3f7f41977394680af6ebbed96f3386_cgraph.svg |   65 -
 ...f41977394680af6ebbed96f3386_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   18 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  182 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  156 -
 .../newton__raphson__method_8cpp_source.html  |  190 ++
 de/dd9/catalan__numbers_8cpp.html             |   51 +-
 de/dd9/catalan__numbers_8cpp_source.html      |  209 ++
 de/dde/lowest__common__ancestor_8cpp.html     |   79 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |    7 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |   84 -
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |   58 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    9 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  102 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   76 -
 .../lowest__common__ancestor_8cpp_source.html |  315 ++
 de/de4/fibonacci__large_8cpp.html             |   87 +-
 de/de4/fibonacci__large_8cpp_source.html      |  214 ++
 ...reedy__algorithms_1_1_binary_addition.html |   92 +-
 ...cfb595ba80795a9efae0e3f6f5c34d2_cgraph.map |    9 -
 ...cfb595ba80795a9efae0e3f6f5c34d2_cgraph.md5 |    1 -
 ...cfb595ba80795a9efae0e3f6f5c34d2_cgraph.svg |  103 -
 ...95ba80795a9efae0e3f6f5c34d2_cgraph_org.svg |   77 -
 ...01fd1ec5cda76b0bb82cbf23ed4d527_cgraph.map |   17 -
 ...01fd1ec5cda76b0bb82cbf23ed4d527_cgraph.md5 |    1 -
 ...01fd1ec5cda76b0bb82cbf23ed4d527_cgraph.svg |  176 --
 ...1ec5cda76b0bb82cbf23ed4d527_cgraph_org.svg |  150 -
 df/d06/decimal__to__binary_8cpp.html          |   87 +-
 ...0df57491019f0ac39b492740fb388f7_cgraph.map |    5 -
 ...0df57491019f0ac39b492740fb388f7_cgraph.md5 |    1 -
 ...0df57491019f0ac39b492740fb388f7_cgraph.svg |   65 -
 ...7491019f0ac39b492740fb388f7_cgraph_org.svg |   39 -
 ...240f2e79074a2a248395258aebbfa11_cgraph.map |    5 -
 ...240f2e79074a2a248395258aebbfa11_cgraph.md5 |    1 -
 ...240f2e79074a2a248395258aebbfa11_cgraph.svg |   65 -
 ...2e79074a2a248395258aebbfa11_cgraph_org.svg |   39 -
 df/d06/decimal__to__binary_8cpp_source.html   |  188 ++
 df/d10/namespacepancake__sort.html            |   35 +-
 ...tures_1_1linked__list_1_1link-members.html |   35 +-
 df/d11/midpoint__integral__method_8cpp.html   |  188 +-
 ...ae48a41e43dc6ab11b962742349646e_cgraph.map |    7 -
 ...ae48a41e43dc6ab11b962742349646e_cgraph.md5 |    1 -
 ...ae48a41e43dc6ab11b962742349646e_cgraph.svg |   83 -
 ...a41e43dc6ab11b962742349646e_cgraph_org.svg |   57 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map |   24 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 |    1 -
 ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg |  295 --
 ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg |  212 --
 ...072493d1f0f8a91b2a71d4cc456c09c_cgraph.map |   12 -
 ...072493d1f0f8a91b2a71d4cc456c09c_cgraph.md5 |    1 -
 ...072493d1f0f8a91b2a71d4cc456c09c_cgraph.svg |  129 -
 ...93d1f0f8a91b2a71d4cc456c09c_cgraph_org.svg |  103 -
 ...ee8e824ef3e138a9a21883b26d97226_cgraph.map |    7 -
 ...ee8e824ef3e138a9a21883b26d97226_cgraph.md5 |    1 -
 ...ee8e824ef3e138a9a21883b26d97226_cgraph.svg |   84 -
 ...824ef3e138a9a21883b26d97226_cgraph_org.svg |   58 -
 ...53616fb4fa6880ae876bcba53365c51_cgraph.map |    5 -
 ...53616fb4fa6880ae876bcba53365c51_cgraph.md5 |    1 -
 ...53616fb4fa6880ae876bcba53365c51_cgraph.svg |   66 -
 ...6fb4fa6880ae876bcba53365c51_cgraph_org.svg |   40 -
 ...682ee71af44b1e9e884849cc6a6b040_cgraph.map |    7 -
 ...682ee71af44b1e9e884849cc6a6b040_cgraph.md5 |    1 -
 ...682ee71af44b1e9e884849cc6a6b040_cgraph.svg |   84 -
 ...e71af44b1e9e884849cc6a6b040_cgraph_org.svg |   58 -
 ...9f66040f8e0ba73c1c741261c22a52a_cgraph.map |    7 -
 ...9f66040f8e0ba73c1c741261c22a52a_cgraph.md5 |    1 -
 ...9f66040f8e0ba73c1c741261c22a52a_cgraph.svg |   84 -
 ...040f8e0ba73c1c741261c22a52a_cgraph_org.svg |   58 -
 ...idpoint__integral__method_8cpp_source.html |  270 ++
 df/d14/bellman__ford_8cpp_source.html         |  264 ++
 df/d1c/namespacestack__using__queue.html      |   35 +-
 df/d28/dsu__union__rank_8cpp.html             |  103 +-
 ...5d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.map |   15 -
 ...5d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.md5 |    1 -
 ...5d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg |  155 -
 ...ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg |  129 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   21 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  209 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  183 --
 ...7880ce913f3058a35ff106d5be9e243_cgraph.map |   15 -
 ...7880ce913f3058a35ff106d5be9e243_cgraph.md5 |    1 -
 ...7880ce913f3058a35ff106d5be9e243_cgraph.svg |  155 -
 ...ce913f3058a35ff106d5be9e243_cgraph_org.svg |  129 -
 df/d28/dsu__union__rank_8cpp_source.html      |  277 ++
 .../elliptic__curve__key__exchange_8cpp.html  |   97 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    7 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   83 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   57 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   13 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  137 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  111 -
 ...tic__curve__key__exchange_8cpp_source.html |  388 +++
 df/d31/floyd__warshall_8cpp_source.html       |  252 ++
 ...1windowed__median_1_1_windowed_median.html |  263 +-
 ...a7f57679e9cd6c9f042dfd0612b2b24_cgraph.map |    9 -
 ...a7f57679e9cd6c9f042dfd0612b2b24_cgraph.md5 |    1 -
 ...a7f57679e9cd6c9f042dfd0612b2b24_cgraph.svg |  103 -
 ...7679e9cd6c9f042dfd0612b2b24_cgraph_org.svg |   77 -
 ...1804988fcb1a6caf640f8291979aaa6_cgraph.map |    5 -
 ...1804988fcb1a6caf640f8291979aaa6_cgraph.md5 |    1 -
 ...1804988fcb1a6caf640f8291979aaa6_cgraph.svg |   67 -
 ...988fcb1a6caf640f8291979aaa6_cgraph_org.svg |   41 -
 ...b52b7851750f28d53508e63c52a69f7_cgraph.map |   26 -
 ...b52b7851750f28d53508e63c52a69f7_cgraph.md5 |    1 -
 ...b52b7851750f28d53508e63c52a69f7_cgraph.svg |  260 --
 ...7851750f28d53508e63c52a69f7_cgraph_org.svg |  234 --
 ...38cafbdf70dc01e86e9bb12d29ec65d_cgraph.map |    5 -
 ...38cafbdf70dc01e86e9bb12d29ec65d_cgraph.md5 |    1 -
 ...38cafbdf70dc01e86e9bb12d29ec65d_cgraph.svg |   67 -
 ...fbdf70dc01e86e9bb12d29ec65d_cgraph_org.svg |   41 -
 ...544e271ea19a6fd69a6b3ed6816453e_cgraph.map |    9 -
 ...544e271ea19a6fd69a6b3ed6816453e_cgraph.md5 |    1 -
 ...544e271ea19a6fd69a6b3ed6816453e_cgraph.svg |  103 -
 ...271ea19a6fd69a6b3ed6816453e_cgraph_org.svg |   77 -
 df/d39/interpolation__search2_8cpp.html       |   65 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 .../interpolation__search2_8cpp_source.html   |  176 ++
 df/d42/binary__search__tree2_8cpp.html        |  208 +-
 ...6f35064850e891d6fda0093c0d9ee6e_cgraph.map |   13 -
 ...6f35064850e891d6fda0093c0d9ee6e_cgraph.md5 |    1 -
 ...6f35064850e891d6fda0093c0d9ee6e_cgraph.svg |  140 -
 ...064850e891d6fda0093c0d9ee6e_cgraph_org.svg |  114 -
 ...d42876440ac5346e2850a32497385c3_cgraph.map |   11 -
 ...d42876440ac5346e2850a32497385c3_cgraph.md5 |    1 -
 ...d42876440ac5346e2850a32497385c3_cgraph.svg |  121 -
 ...76440ac5346e2850a32497385c3_cgraph_org.svg |   95 -
 ...c882f43e1e52948a7841a8bfb091350_cgraph.map |   16 -
 ...c882f43e1e52948a7841a8bfb091350_cgraph.md5 |    1 -
 ...c882f43e1e52948a7841a8bfb091350_cgraph.svg |  168 -
 ...f43e1e52948a7841a8bfb091350_cgraph_org.svg |  142 -
 ...4b76f781fcbe1ad0e3397ace6bb1965_cgraph.map |   13 -
 ...4b76f781fcbe1ad0e3397ace6bb1965_cgraph.md5 |    1 -
 ...4b76f781fcbe1ad0e3397ace6bb1965_cgraph.svg |  140 -
 ...f781fcbe1ad0e3397ace6bb1965_cgraph_org.svg |  114 -
 ...856b68e2cba50d2e26a1cbe374e0365_cgraph.map |   11 -
 ...856b68e2cba50d2e26a1cbe374e0365_cgraph.md5 |    1 -
 ...856b68e2cba50d2e26a1cbe374e0365_cgraph.svg |  121 -
 ...68e2cba50d2e26a1cbe374e0365_cgraph_org.svg |   95 -
 ...00b8d0f21aeb5fbddb6decf3bcb640a_cgraph.map |   13 -
 ...00b8d0f21aeb5fbddb6decf3bcb640a_cgraph.md5 |    1 -
 ...00b8d0f21aeb5fbddb6decf3bcb640a_cgraph.svg |  140 -
 ...d0f21aeb5fbddb6decf3bcb640a_cgraph_org.svg |  114 -
 ...1333c3ea06dcad896ee204bbd407c4e_cgraph.map |   25 -
 ...1333c3ea06dcad896ee204bbd407c4e_cgraph.md5 |    1 -
 ...1333c3ea06dcad896ee204bbd407c4e_cgraph.svg |  251 --
 ...c3ea06dcad896ee204bbd407c4e_cgraph_org.svg |  225 --
 ...2847a901160fd45b4044550e9921cb4_cgraph.map |   11 -
 ...2847a901160fd45b4044550e9921cb4_cgraph.md5 |    1 -
 ...2847a901160fd45b4044550e9921cb4_cgraph.svg |  121 -
 ...a901160fd45b4044550e9921cb4_cgraph_org.svg |   95 -
 df/d42/binary__search__tree2_8cpp_source.html |  609 ++++
 .../namespacen__queens__all__solutions.html   |   35 +-
 df/d47/fcfs__scheduling_8cpp.html             |  123 +-
 ...f2b90cb64d63a7080965e66a05ccf86_cgraph.map |    5 -
 ...f2b90cb64d63a7080965e66a05ccf86_cgraph.md5 |    1 -
 ...f2b90cb64d63a7080965e66a05ccf86_cgraph.svg |   65 -
 ...0cb64d63a7080965e66a05ccf86_cgraph_org.svg |   39 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |   17 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |  175 --
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |  149 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   19 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  193 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  167 -
 df/d47/fcfs__scheduling_8cpp_source.html      |  358 +++
 df/d47/stack_8hpp.html                        |   44 +-
 df/d47/stack_8hpp_source.html                 |  118 +-
 .../namespaceselection__sort__recursive.html  |   35 +-
 ...1_1lru__cache_1_1_l_r_u_cache-members.html |   35 +-
 df/d66/vector__cross__product_8cpp.html       |  147 +-
 ...25732399c5c076976eae5b180a9f8c9_cgraph.map |    4 -
 ...25732399c5c076976eae5b180a9f8c9_cgraph.md5 |    1 -
 ...25732399c5c076976eae5b180a9f8c9_cgraph.svg |   57 -
 ...2399c5c076976eae5b180a9f8c9_cgraph_org.svg |   31 -
 ...b2a9757a87c18e1642d72410ecfaba8_cgraph.map |    4 -
 ...b2a9757a87c18e1642d72410ecfaba8_cgraph.md5 |    1 -
 ...b2a9757a87c18e1642d72410ecfaba8_cgraph.svg |   56 -
 ...757a87c18e1642d72410ecfaba8_cgraph_org.svg |   30 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 .../vector__cross__product_8cpp_source.html   |  202 ++
 ...ers_1_1elliptic__curve__key__exchange.html |   96 +-
 ...7f3d667241b88115a95282cdd719cb2_cgraph.map |   11 -
 ...7f3d667241b88115a95282cdd719cb2_cgraph.md5 |    1 -
 ...7f3d667241b88115a95282cdd719cb2_cgraph.svg |  179 --
 ...667241b88115a95282cdd719cb2_cgraph_org.svg |   96 -
 ...00616a4e40d3cd5cfb4da87d9ff9af0_cgraph.map |    7 -
 ...00616a4e40d3cd5cfb4da87d9ff9af0_cgraph.md5 |    1 -
 ...00616a4e40d3cd5cfb4da87d9ff9af0_cgraph.svg |   84 -
 ...6a4e40d3cd5cfb4da87d9ff9af0_cgraph_org.svg |   58 -
 ...c5fe9c2032fb7582c38a20d1fa69bcf_cgraph.map |    9 -
 ...c5fe9c2032fb7582c38a20d1fa69bcf_cgraph.md5 |    1 -
 ...c5fe9c2032fb7582c38a20d1fa69bcf_cgraph.svg |  103 -
 ...9c2032fb7582c38a20d1fa69bcf_cgraph_org.svg |   77 -
 df/d72/modular__division_8cpp.html            |  110 +-
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.map |    7 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 |    1 -
 ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg |   83 -
 ...224851353fc92bfbff6f499fa97_cgraph_org.svg |   57 -
 ...05e368ae121beb7e7ea35349ddcdac7_cgraph.map |    4 -
 ...05e368ae121beb7e7ea35349ddcdac7_cgraph.md5 |    1 -
 ...05e368ae121beb7e7ea35349ddcdac7_cgraph.svg |   57 -
 ...68ae121beb7e7ea35349ddcdac7_cgraph_org.svg |   31 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 df/d72/modular__division_8cpp_source.html     |  204 ++
 df/d74/namespacesubarray__sum.html            |   35 +-
 df/d76/namespacefibonacci.html                |   35 +-
 df/d82/breadth__first__search_8cpp.html       |  112 +-
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.map |   17 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 |    1 -
 ...83bb8ccf42aaf7375a83e91490eda1e_cgraph.svg |  174 --
 ...8ccf42aaf7375a83e91490eda1e_cgraph_org.svg |  148 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   20 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  201 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  175 --
 .../breadth__first__search_8cpp_source.html   |  273 ++
 .../classgraph_1_1_h_k_graph__coll__graph.map |    6 +-
 .../classgraph_1_1_h_k_graph__coll__graph.md5 |    2 +-
 .../classgraph_1_1_h_k_graph__coll__graph.svg |    6 +-
 ...ssgraph_1_1_h_k_graph__coll__graph_org.svg |    6 +-
 df/d88/namespacedp.html                       |   41 +-
 df/d8e/namespacetrie__operations.html         |   35 +-
 ...classothers_1_1_cache_1_1_l_f_u_cache.html |  259 +-
 ...6a25c102554c5653721a5112ef676c9_cgraph.map |    5 -
 ...6a25c102554c5653721a5112ef676c9_cgraph.md5 |    1 -
 ...6a25c102554c5653721a5112ef676c9_cgraph.svg |   67 -
 ...c102554c5653721a5112ef676c9_cgraph_org.svg |   41 -
 ...8e37d3713f28d36abbb8cdf6c432781_cgraph.map |    7 -
 ...8e37d3713f28d36abbb8cdf6c432781_cgraph.md5 |    1 -
 ...8e37d3713f28d36abbb8cdf6c432781_cgraph.svg |   85 -
 ...d3713f28d36abbb8cdf6c432781_cgraph_org.svg |   59 -
 ...6f8e5a66a45436b490dfe015ff8866e_cgraph.map |   10 -
 ...6f8e5a66a45436b490dfe015ff8866e_cgraph.md5 |    1 -
 ...6f8e5a66a45436b490dfe015ff8866e_cgraph.svg |  169 -
 ...5a66a45436b490dfe015ff8866e_cgraph_org.svg |   86 -
 df/d94/classhash__chain-members.html          |   35 +-
 df/d94/subarray__sum_8cpp.html                |  119 +-
 ...8dca7b867074164d5f45b0f3851269d_cgraph.map |    5 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.md5 |    1 -
 ...8dca7b867074164d5f45b0f3851269d_cgraph.svg |   65 -
 ...7b867074164d5f45b0f3851269d_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 ...5687bbd9faf927fbd363c71e0baba5e_cgraph.map |    9 -
 ...5687bbd9faf927fbd363c71e0baba5e_cgraph.md5 |    1 -
 ...5687bbd9faf927fbd363c71e0baba5e_cgraph.svg |  103 -
 ...bbd9faf927fbd363c71e0baba5e_cgraph_org.svg |   77 -
 df/d94/subarray__sum_8cpp_source.html         |  228 ++
 df/d97/main__cll_8cpp_source.html             |  183 ++
 ...d_1_1is__unsigned_3_01uint256__t_01_4.html |   42 +-
 df/da7/queue__using__array2_8cpp_source.html  |  195 ++
 ...raph__bipartite_1_1_graph__coll__graph.map |    4 +-
 ...raph__bipartite_1_1_graph__coll__graph.md5 |    2 +-
 ...raph__bipartite_1_1_graph__coll__graph.svg |    4 +-
 ...__bipartite_1_1_graph__coll__graph_org.svg |    4 +-
 df/dbb/class_f_c_f_s__coll__graph.map         |   12 -
 df/dbb/class_f_c_f_s__coll__graph.md5         |    1 -
 df/dbb/class_f_c_f_s__coll__graph.svg         |  140 -
 df/dbb/class_f_c_f_s__coll__graph_org.svg     |  114 -
 df/dc8/successive__approximation_8cpp.html    |   79 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 ...successive__approximation_8cpp_source.html |  171 +
 df/dcb/namespacestrings.html                  |   37 +-
 ...quations_complex_numbers_8cpp-example.html |  216 +-
 ...hms_1_1dijkstra_1_1_graph__coll__graph.map |    2 +-
 ...hms_1_1dijkstra_1_1_graph__coll__graph.md5 |    2 +-
 ...hms_1_1dijkstra_1_1_graph__coll__graph.svg |    2 +-
 ...1_1dijkstra_1_1_graph__coll__graph_org.svg |    2 +-
 df/dce/namespacegraph.html                    |  329 +-
 ...e30e0dca68cb6e4f671440819b35b6a_cgraph.map |    5 -
 ...e30e0dca68cb6e4f671440819b35b6a_cgraph.md5 |    1 -
 ...e30e0dca68cb6e4f671440819b35b6a_cgraph.svg |   65 -
 ...0dca68cb6e4f671440819b35b6a_cgraph_org.svg |   39 -
 ...ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.map |    4 -
 ...ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.md5 |    1 -
 ...ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.svg |   56 -
 ...bc4c6a79d041b4f3a6589eb7fb8_cgraph_org.svg |   30 -
 ...4c1db5aad7502c6f08e4652f6edd463_cgraph.map |    6 -
 ...4c1db5aad7502c6f08e4652f6edd463_cgraph.md5 |    1 -
 ...4c1db5aad7502c6f08e4652f6edd463_cgraph.svg |   74 -
 ...b5aad7502c6f08e4652f6edd463_cgraph_org.svg |   48 -
 ...3ab16e96cec644109a58dfc9329bc2b_cgraph.map |    8 -
 ...3ab16e96cec644109a58dfc9329bc2b_cgraph.md5 |    1 -
 ...3ab16e96cec644109a58dfc9329bc2b_cgraph.svg |   92 -
 ...6e96cec644109a58dfc9329bc2b_cgraph_org.svg |   66 -
 ...4b0551489c613a681cc83b34450da4b_cgraph.map |    5 -
 ...4b0551489c613a681cc83b34450da4b_cgraph.md5 |    1 -
 ...4b0551489c613a681cc83b34450da4b_cgraph.svg |   65 -
 ...51489c613a681cc83b34450da4b_cgraph_org.svg |   39 -
 ...5428a3519267a28bba4b4310cfbb6ae_cgraph.map |    8 -
 ...5428a3519267a28bba4b4310cfbb6ae_cgraph.md5 |    1 -
 ...5428a3519267a28bba4b4310cfbb6ae_cgraph.svg |   93 -
 ...a3519267a28bba4b4310cfbb6ae_cgraph_org.svg |   67 -
 ...7706341d006e20d1ae58274187a3346_cgraph.map |   11 -
 ...7706341d006e20d1ae58274187a3346_cgraph.md5 |    1 -
 ...7706341d006e20d1ae58274187a3346_cgraph.svg |  120 -
 ...341d006e20d1ae58274187a3346_cgraph_org.svg |   94 -
 ...c68cbc8ba09eb1142265935c0d45b84_cgraph.map |   15 -
 ...c68cbc8ba09eb1142265935c0d45b84_cgraph.md5 |    1 -
 ...c68cbc8ba09eb1142265935c0d45b84_cgraph.svg |  157 -
 ...bc8ba09eb1142265935c0d45b84_cgraph_org.svg |  131 -
 df/dd0/queue__using__two__stacks_8cpp.html    |   67 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    5 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   65 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   39 -
 ...queue__using__two__stacks_8cpp_source.html |  242 ++
 df/dd5/binary__search_8cpp_source.html        |  294 ++
 df/dd7/structlinkedlist-members.html          |   35 +-
 ...structures_1_1treap_1_1_treap-members.html |   35 +-
 df/ddc/struct_node__coll__graph.map           |    2 +-
 df/ddc/struct_node__coll__graph.md5           |    2 +-
 df/ddc/struct_node__coll__graph.svg           |    2 +-
 df/ddc/struct_node__coll__graph_org.svg       |    2 +-
 df/ddd/connected__components_8cpp.html        |  110 +-
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.map |   14 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 |    1 -
 ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.svg |  146 -
 ...ad42717780d6caaff9d3d6977f9_cgraph_org.svg |  120 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   19 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  191 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  165 -
 df/ddd/connected__components_8cpp_source.html |  244 ++
 df/de3/classqueue-members.html                |   35 +-
 ...backtracking_1_1generate__parentheses.html |  111 +-
 ...1489edd65374f22fe04851051f0a2ec_cgraph.map |    8 -
 ...1489edd65374f22fe04851051f0a2ec_cgraph.md5 |    1 -
 ...1489edd65374f22fe04851051f0a2ec_cgraph.svg |   93 -
 ...edd65374f22fe04851051f0a2ec_cgraph_org.svg |   67 -
 ...39c03d80ce0ba9fbf659b420980d160_cgraph.map |   12 -
 ...39c03d80ce0ba9fbf659b420980d160_cgraph.md5 |    1 -
 ...39c03d80ce0ba9fbf659b420980d160_cgraph.svg |  130 -
 ...3d80ce0ba9fbf659b420980d160_cgraph_org.svg |  104 -
 df/dea/namespacefalse__position.html          |   35 +-
 df/def/power__for__huge__numbers_8cpp.html    |   85 +-
 ...249a2af508aa94266023ce8aa81426f_cgraph.map |    5 -
 ...249a2af508aa94266023ce8aa81426f_cgraph.md5 |    1 -
 ...249a2af508aa94266023ce8aa81426f_cgraph.svg |   65 -
 ...2af508aa94266023ce8aa81426f_cgraph_org.svg |   39 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |    7 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |   83 -
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |   57 -
 ...power__for__huge__numbers_8cpp_source.html |  213 ++
 df/dfb/minimax_8cpp.html                      |   68 +-
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map |   19 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 |    1 -
 ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg |  191 --
 ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg |  165 -
 df/dfb/minimax_8cpp_source.html               |  174 ++
 dir_000002_000016.html                        |   35 +-
 dir_074119ce3a874b57120c49a0cc4bb5ad.html     |   49 +-
 dir_074119ce3a874b57120c49a0cc4bb5ad.js       |    4 +-
 dir_0eaa691bd54ab0922ca7f50599de6d22.html     |   55 +-
 dir_0eaa691bd54ab0922ca7f50599de6d22.js       |    5 +-
 dir_12552d7fa429bf94a2e32e5cf39f7e69.html     |   77 +-
 dir_12552d7fa429bf94a2e32e5cf39f7e69.js       |    8 +
 dir_19b2bf9199a15c634a08b1ede1dd896a.html     |   67 +-
 dir_19b2bf9199a15c634a08b1ede1dd896a.js       |    2 +
 dir_296d53ceaeaa7e099814a6def439fe8a.html     |  153 +-
 dir_296d53ceaeaa7e099814a6def439fe8a.js       |    2 +
 dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html     |  107 +-
 dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js       |   14 +
 dir_3343723ae086de42ee4ca9774da3a13f.html     |   49 +-
 dir_3343723ae086de42ee4ca9774da3a13f.js       |    1 +
 dir_35422be6552f1b3672c1b6c4aba2da64.html     |   59 +-
 dir_35422be6552f1b3672c1b6c4aba2da64.js       |    4 +
 dir_4b6f782e158b0b98da980a0e11a23a15.html     |   37 +-
 dir_4d6e05837bf820fb089a8a8cdf2f42b7.html     |   53 +-
 dir_4d6e05837bf820fb089a8a8cdf2f42b7.js       |    1 +
 dir_53e6fa9553ac22a5646d2a2b2d7b97a1.html     |  143 +
 dir_53e6fa9553ac22a5646d2a2b2d7b97a1.js       |    4 +
 dir_59dc24c326e2a72d1164f014b22de83d.html     |   37 +-
 dir_73a3cc5065b223eb41b02873c0e19f0e.html     |   51 +-
 dir_82e494173a87936756866de2fa774307.html     |   49 +-
 dir_8a20dd5bfd5341a725342bf72b6b686f.html     |   97 +-
 dir_8a20dd5bfd5341a725342bf72b6b686f.js       |   12 +
 dir_93bc990c5cceb745f78af6949e9ef947.html     |   39 +-
 dir_93bc990c5cceb745f78af6949e9ef947.js       |    3 +-
 dir_9510827d0b234b3cc54b29892f217477.html     |   91 +-
 dir_9510827d0b234b3cc54b29892f217477.js       |    1 +
 dir_9c6faab82c22511b50177aa2e38e2780.html     |   77 +-
 dir_bb1b521853a9c46347182a9d10420771.html     |  121 +-
 dir_bb1b521853a9c46347182a9d10420771.js       |   15 +
 dir_c11585dfcef32a26e29098facab6c144.html     |   61 +-
 dir_c11585dfcef32a26e29098facab6c144.js       |    1 +
 dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html     |   37 +-
 dir_e3380d2178455503f266746fb14246a5.html     |   41 +-
 dir_e3380d2178455503f266746fb14246a5.js       |    1 +
 dir_e79632891301b850df87e9c0030293fa.html     |   37 +-
 dir_ece9b94c107bbaa1dd68197a8c9983b9.html     |   49 +-
 dir_f1797d0c2a0a12033e7d74efffeb14e1.html     |   39 +-
 dir_f1797d0c2a0a12033e7d74efffeb14e1.js       |    4 +-
 dir_f3c4fbc4e901afa0a54d0623c5574aa7.html     |   55 +-
 dir_f3c4fbc4e901afa0a54d0623c5574aa7.js       |    1 +
 doxygen-awesome.css                           | 2681 ++++++++++++++++
 doxygen.css                                   |  788 ++---
 doxygen_crawl.html                            |  436 ++-
 dynsections.js                                |   13 +-
 examples.html                                 |   35 +-
 favicon.svg                                   |    5 +
 files.html                                    |  700 +++--
 files_dup.js                                  |    1 +
 functions.html                                |   35 +-
 functions_a.html                              |   35 +-
 functions_b.html                              |   35 +-
 functions_c.html                              |   35 +-
 functions_d.html                              |   35 +-
 functions_e.html                              |   35 +-
 functions_f.html                              |   35 +-
 functions_func.html                           |   35 +-
 functions_func_a.html                         |   35 +-
 functions_func_b.html                         |   35 +-
 functions_func_c.html                         |   35 +-
 functions_func_d.html                         |   35 +-
 functions_func_e.html                         |   35 +-
 functions_func_f.html                         |   35 +-
 functions_func_g.html                         |   35 +-
 functions_func_h.html                         |   35 +-
 functions_func_i.html                         |   35 +-
 functions_func_k.html                         |   35 +-
 functions_func_l.html                         |   35 +-
 functions_func_m.html                         |   35 +-
 functions_func_n.html                         |   35 +-
 functions_func_o.html                         |   35 +-
 functions_func_p.html                         |   35 +-
 functions_func_q.html                         |   35 +-
 functions_func_r.html                         |   35 +-
 functions_func_s.html                         |   35 +-
 functions_func_t.html                         |   35 +-
 functions_func_u.html                         |   35 +-
 functions_func_v.html                         |   35 +-
 functions_func_w.html                         |   35 +-
 functions_func_~.html                         |   35 +-
 functions_g.html                              |   35 +-
 functions_h.html                              |   35 +-
 functions_i.html                              |   35 +-
 functions_k.html                              |   35 +-
 functions_l.html                              |   35 +-
 functions_m.html                              |   35 +-
 functions_n.html                              |   35 +-
 functions_o.html                              |   35 +-
 functions_p.html                              |   35 +-
 functions_q.html                              |   35 +-
 functions_r.html                              |   35 +-
 functions_rela.html                           |   35 +-
 functions_s.html                              |   35 +-
 functions_t.html                              |   35 +-
 functions_type.html                           |   35 +-
 functions_u.html                              |   35 +-
 functions_v.html                              |   35 +-
 functions_vars.html                           |   35 +-
 functions_w.html                              |   35 +-
 functions_x.html                              |   35 +-
 functions_y.html                              |   35 +-
 functions_~.html                              |   35 +-
 globals.html                                  |   35 +-
 globals_a.html                                |   35 +-
 globals_b.html                                |   35 +-
 globals_c.html                                |   35 +-
 globals_d.html                                |   35 +-
 globals_defs.html                             |   35 +-
 globals_e.html                                |   35 +-
 globals_f.html                                |   35 +-
 globals_func.html                             |   35 +-
 globals_func_a.html                           |   35 +-
 globals_func_b.html                           |   35 +-
 globals_func_c.html                           |   35 +-
 globals_func_d.html                           |   35 +-
 globals_func_e.html                           |   35 +-
 globals_func_f.html                           |   35 +-
 globals_func_g.html                           |   35 +-
 globals_func_h.html                           |   35 +-
 globals_func_i.html                           |   35 +-
 globals_func_j.html                           |   35 +-
 globals_func_l.html                           |   35 +-
 globals_func_m.html                           |   35 +-
 globals_func_n.html                           |   35 +-
 globals_func_o.html                           |   35 +-
 globals_func_p.html                           |   35 +-
 globals_func_q.html                           |   35 +-
 globals_func_r.html                           |   35 +-
 globals_func_s.html                           |   35 +-
 globals_func_t.html                           |   35 +-
 globals_func_u.html                           |   35 +-
 globals_func_z.html                           |   35 +-
 globals_g.html                                |   35 +-
 globals_h.html                                |   35 +-
 globals_i.html                                |   35 +-
 globals_j.html                                |   35 +-
 globals_l.html                                |   35 +-
 globals_m.html                                |   35 +-
 globals_n.html                                |   35 +-
 globals_o.html                                |   35 +-
 globals_p.html                                |   35 +-
 globals_q.html                                |   35 +-
 globals_r.html                                |   35 +-
 globals_s.html                                |   35 +-
 globals_t.html                                |   35 +-
 globals_type.html                             |   35 +-
 globals_u.html                                |   35 +-
 globals_vars.html                             |   35 +-
 globals_w.html                                |   35 +-
 globals_z.html                                |   35 +-
 graph_legend.html                             |   35 +-
 hierarchy.html                                |   39 +-
 hierarchy.js                                  |    2 +-
 index.html                                    |   35 +-
 inherit_graph_109.map                         |    2 +-
 inherit_graph_109.md5                         |    2 +-
 inherit_graph_109.svg                         |    4 +-
 inherits.html                                 |   35 +-
 namespacemembers.html                         |   35 +-
 namespacemembers_b.html                       |   35 +-
 namespacemembers_c.html                       |   35 +-
 namespacemembers_d.html                       |   35 +-
 namespacemembers_e.html                       |   35 +-
 namespacemembers_f.html                       |   35 +-
 namespacemembers_func.html                    |   35 +-
 namespacemembers_func_b.html                  |   35 +-
 namespacemembers_func_c.html                  |   35 +-
 namespacemembers_func_d.html                  |   35 +-
 namespacemembers_func_e.html                  |   35 +-
 namespacemembers_func_f.html                  |   35 +-
 namespacemembers_func_g.html                  |   35 +-
 namespacemembers_func_h.html                  |   35 +-
 namespacemembers_func_i.html                  |   35 +-
 namespacemembers_func_k.html                  |   35 +-
 namespacemembers_func_l.html                  |   35 +-
 namespacemembers_func_m.html                  |   35 +-
 namespacemembers_func_n.html                  |   35 +-
 namespacemembers_func_o.html                  |   35 +-
 namespacemembers_func_p.html                  |   35 +-
 namespacemembers_func_q.html                  |   35 +-
 namespacemembers_func_r.html                  |   35 +-
 namespacemembers_func_s.html                  |   35 +-
 namespacemembers_func_t.html                  |   35 +-
 namespacemembers_func_u.html                  |   35 +-
 namespacemembers_func_v.html                  |   35 +-
 namespacemembers_func_z.html                  |   35 +-
 namespacemembers_g.html                       |   35 +-
 namespacemembers_h.html                       |   35 +-
 namespacemembers_i.html                       |   35 +-
 namespacemembers_k.html                       |   35 +-
 namespacemembers_l.html                       |   35 +-
 namespacemembers_m.html                       |   35 +-
 namespacemembers_n.html                       |   35 +-
 namespacemembers_o.html                       |   35 +-
 namespacemembers_p.html                       |   35 +-
 namespacemembers_q.html                       |   35 +-
 namespacemembers_r.html                       |   35 +-
 namespacemembers_s.html                       |   35 +-
 namespacemembers_t.html                       |   35 +-
 namespacemembers_type.html                    |   35 +-
 namespacemembers_u.html                       |   35 +-
 namespacemembers_v.html                       |   35 +-
 namespacemembers_vars.html                    |   35 +-
 namespacemembers_z.html                       |   35 +-
 namespaces.html                               |  100 +-
 namespaces_dup.js                             |    1 -
 navtree.css                                   |   14 +-
 navtreedata.js                                |   31 +-
 navtreeindex0.js                              |  496 +--
 navtreeindex1.js                              |  500 +--
 navtreeindex10.js                             |  500 +--
 navtreeindex11.js                             |  500 +--
 navtreeindex12.js                             |  500 +--
 navtreeindex13.js                             |  478 +--
 navtreeindex14.js                             |  411 ++-
 navtreeindex15.js                             |  168 -
 navtreeindex2.js                              |  500 +--
 navtreeindex3.js                              |  500 +--
 navtreeindex4.js                              |  500 +--
 navtreeindex5.js                              |  500 +--
 navtreeindex6.js                              |  500 +--
 navtreeindex7.js                              |  500 +--
 navtreeindex8.js                              |  500 +--
 navtreeindex9.js                              |  500 +--
 pages.html                                    |   35 +-
 project_logo.png                              |  Bin 0 -> 7452 bytes
 search/all_10.js                              |   33 +-
 search/all_11.js                              |  183 +-
 search/all_12.js                              |  282 +-
 search/all_13.js                              |  135 +-
 search/all_14.js                              |  151 +-
 search/all_15.js                              |  281 +-
 search/all_16.js                              |   48 +-
 search/all_17.js                              |  211 +-
 search/all_18.js                              |  514 ++-
 search/all_19.js                              |  290 +-
 search/all_1a.js                              |  116 +-
 search/all_1b.js                              |   79 +-
 search/all_1c.js                              |  120 +-
 search/all_1d.js                              |    7 +-
 search/all_1e.js                              |    5 +-
 search/all_1f.js                              |    4 +-
 search/all_20.js                              |  111 +-
 search/all_5.js                               |   27 +-
 search/all_6.js                               |  243 +-
 search/all_7.js                               |  221 +-
 search/all_8.js                               |  324 +-
 search/all_9.js                               |  237 +-
 search/all_a.js                               |  146 +-
 search/all_b.js                               |  233 +-
 search/all_c.js                               |  262 +-
 search/all_d.js                               |   97 +-
 search/all_e.js                               |  353 +--
 search/all_f.js                               |    9 +-
 search/classes_0.js                           |   30 +-
 search/classes_1.js                           |   76 +-
 search/classes_10.js                          |   16 +-
 search/classes_11.js                          |   51 +-
 search/classes_12.js                          |   56 +-
 search/classes_13.js                          |   30 +-
 search/classes_2.js                           |   47 +-
 search/classes_3.js                           |   22 +-
 search/classes_4.js                           |   17 +-
 search/classes_5.js                           |   20 +-
 search/classes_6.js                           |   10 +-
 search/classes_7.js                           |   15 +-
 search/classes_8.js                           |  113 +-
 search/classes_9.js                           |    2 +-
 search/classes_a.js                           |   12 +-
 search/classes_b.js                           |   27 +-
 search/classes_c.js                           |   45 +-
 search/classes_d.js                           |   23 +-
 search/classes_e.js                           |   16 +-
 search/classes_f.js                           |   24 +-
 search/functions_0.js                         |   13 +-
 search/functions_1.js                         |  129 +-
 search/functions_10.js                        |  157 +-
 search/functions_11.js                        |   18 +-
 search/functions_12.js                        |  136 +-
 search/functions_13.js                        |  319 +-
 search/functions_14.js                        |  201 +-
 search/functions_15.js                        |   68 +-
 search/functions_16.js                        |   28 +-
 search/functions_17.js                        |   81 +-
 search/functions_18.js                        |    5 +-
 search/functions_19.js                        |   11 +-
 search/functions_2.js                         |  102 +-
 search/functions_3.js                         |  165 +-
 search/functions_4.js                         |  162 +-
 search/functions_5.js                         |  102 +-
 search/functions_6.js                         |  165 +-
 search/functions_7.js                         |  191 +-
 search/functions_8.js                         |   46 +-
 search/functions_9.js                         |  194 +-
 search/functions_a.js                         |    4 +-
 search/functions_b.js                         |   18 +-
 search/functions_c.js                         |   95 +-
 search/functions_d.js                         |  161 +-
 search/functions_e.js                         |   84 +-
 search/functions_f.js                         |  109 +-
 search/namespaces_12.js                       |   28 +-
 search/search.css                             |   50 +-
 search/searchdata.js                          |    4 +-
 search/variables_4.js                         |    3 +-
 tabs.css                                      |    2 +-
 topics.html                                   |   35 +-
 6732 files changed, 153919 insertions(+), 365711 deletions(-)
 delete mode 100644 d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
 delete mode 100644 d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
 delete mode 100644 d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
 delete mode 100644 d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
 delete mode 100644 d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.map
 delete mode 100644 d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.md5
 delete mode 100644 d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.svg
 delete mode 100644 d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph_org.svg
 delete mode 100644 d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.map
 delete mode 100644 d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.md5
 delete mode 100644 d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.svg
 delete mode 100644 d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph_org.svg
 delete mode 100644 d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
 delete mode 100644 d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
 delete mode 100644 d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
 delete mode 100644 d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
 delete mode 100644 d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.map
 delete mode 100644 d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.md5
 delete mode 100644 d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.svg
 delete mode 100644 d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph_org.svg
 delete mode 100644 d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
 delete mode 100644 d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
 delete mode 100644 d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
 delete mode 100644 d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
 delete mode 100644 d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.map
 delete mode 100644 d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.md5
 delete mode 100644 d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.svg
 delete mode 100644 d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph_org.svg
 create mode 100644 d0/d01/smallest__circle_8cpp_source.html
 delete mode 100644 d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
 delete mode 100644 d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
 delete mode 100644 d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
 delete mode 100644 d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
 delete mode 100644 d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.map
 delete mode 100644 d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.md5
 delete mode 100644 d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.svg
 delete mode 100644 d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph_org.svg
 create mode 100644 d0/d08/realtime__stats_8cpp_source.html
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_a0ab94bc6417e3f59fab33cea5b64d546_cgraph.map
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_a0ab94bc6417e3f59fab33cea5b64d546_cgraph.md5
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_a0ab94bc6417e3f59fab33cea5b64d546_cgraph.svg
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_a0ab94bc6417e3f59fab33cea5b64d546_cgraph_org.svg
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.map
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.md5
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.svg
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph_org.svg
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_a961eb5d576d2420f2036009154397c63_cgraph.map
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_a961eb5d576d2420f2036009154397c63_cgraph.md5
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_a961eb5d576d2420f2036009154397c63_cgraph.svg
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_a961eb5d576d2420f2036009154397c63_cgraph_org.svg
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.map
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.md5
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.svg
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph_org.svg
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.map
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.md5
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.svg
 delete mode 100644 d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph_org.svg
 delete mode 100644 d0/d46/finding__number__of__digits__in__a__number_8cpp_ab4c15b7f1aedd4419a65cd49562cc300_cgraph.map
 delete mode 100644 d0/d46/finding__number__of__digits__in__a__number_8cpp_ab4c15b7f1aedd4419a65cd49562cc300_cgraph.md5
 delete mode 100644 d0/d46/finding__number__of__digits__in__a__number_8cpp_ab4c15b7f1aedd4419a65cd49562cc300_cgraph.svg
 delete mode 100644 d0/d46/finding__number__of__digits__in__a__number_8cpp_ab4c15b7f1aedd4419a65cd49562cc300_cgraph_org.svg
 delete mode 100644 d0/d46/finding__number__of__digits__in__a__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d0/d46/finding__number__of__digits__in__a__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d0/d46/finding__number__of__digits__in__a__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d0/d46/finding__number__of__digits__in__a__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html
 delete mode 100644 d0/d51/approximate__pi_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 d0/d51/approximate__pi_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 d0/d51/approximate__pi_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 d0/d51/approximate__pi_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 d0/d51/approximate__pi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d0/d51/approximate__pi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d0/d51/approximate__pi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d0/d51/approximate__pi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d0/d51/approximate__pi_8cpp_source.html
 delete mode 100644 d0/d58/classgraph_1_1_rooted_tree_aacdeecac857623e9fbfe92590f3c504d_cgraph.map
 delete mode 100644 d0/d58/classgraph_1_1_rooted_tree_aacdeecac857623e9fbfe92590f3c504d_cgraph.md5
 delete mode 100644 d0/d58/classgraph_1_1_rooted_tree_aacdeecac857623e9fbfe92590f3c504d_cgraph.svg
 delete mode 100644 d0/d58/classgraph_1_1_rooted_tree_aacdeecac857623e9fbfe92590f3c504d_cgraph_org.svg
 delete mode 100644 d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph.map
 delete mode 100644 d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph.md5
 delete mode 100644 d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph.svg
 delete mode 100644 d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph_org.svg
 delete mode 100644 d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d0/d5a/skip__list_8cpp_source.html
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a097913c4badec2b60d50a171ecc299fe_cgraph.map
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a097913c4badec2b60d50a171ecc299fe_cgraph.md5
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a097913c4badec2b60d50a171ecc299fe_cgraph.svg
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a097913c4badec2b60d50a171ecc299fe_cgraph_org.svg
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a18b70172ca4fb2811dbfb9a86e48b34c_cgraph.map
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a18b70172ca4fb2811dbfb9a86e48b34c_cgraph.md5
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a18b70172ca4fb2811dbfb9a86e48b34c_cgraph.svg
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a18b70172ca4fb2811dbfb9a86e48b34c_cgraph_org.svg
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a7c5ab271d8042540f64ef16d259d1503_cgraph.map
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a7c5ab271d8042540f64ef16d259d1503_cgraph.md5
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a7c5ab271d8042540f64ef16d259d1503_cgraph.svg
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a7c5ab271d8042540f64ef16d259d1503_cgraph_org.svg
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a9e556f52c837190ecf4265b1f05cfe9c_cgraph.map
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a9e556f52c837190ecf4265b1f05cfe9c_cgraph.md5
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a9e556f52c837190ecf4265b1f05cfe9c_cgraph.svg
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a9e556f52c837190ecf4265b1f05cfe9c_cgraph_org.svg
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aacafb8c9f3ebac7ac6c01d9645bb67b6_cgraph.map
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aacafb8c9f3ebac7ac6c01d9645bb67b6_cgraph.md5
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aacafb8c9f3ebac7ac6c01d9645bb67b6_cgraph.svg
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aacafb8c9f3ebac7ac6c01d9645bb67b6_cgraph_org.svg
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_adef6940391f981ab86767775176b7169_cgraph.map
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_adef6940391f981ab86767775176b7169_cgraph.md5
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_adef6940391f981ab86767775176b7169_cgraph.svg
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_adef6940391f981ab86767775176b7169_cgraph_org.svg
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aefd24626ac47277431c9b8604e064340_cgraph.map
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aefd24626ac47277431c9b8604e064340_cgraph.md5
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aefd24626ac47277431c9b8604e064340_cgraph.svg
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aefd24626ac47277431c9b8604e064340_cgraph_org.svg
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_afca808362c13273ca8c8ae7d58e8eee0_cgraph.map
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_afca808362c13273ca8c8ae7d58e8eee0_cgraph.md5
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_afca808362c13273ca8c8ae7d58e8eee0_cgraph.svg
 delete mode 100644 d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_afca808362c13273ca8c8ae7d58e8eee0_cgraph_org.svg
 create mode 100644 d0/d61/knapsack_8cpp_source.html
 delete mode 100644 d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.map
 delete mode 100644 d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.md5
 delete mode 100644 d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.svg
 delete mode 100644 d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph_org.svg
 delete mode 100644 d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.map
 delete mode 100644 d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.md5
 delete mode 100644 d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.svg
 delete mode 100644 d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph_org.svg
 delete mode 100644 d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.map
 delete mode 100644 d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.md5
 delete mode 100644 d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.svg
 delete mode 100644 d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph_org.svg
 delete mode 100644 d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.map
 delete mode 100644 d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.md5
 delete mode 100644 d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.svg
 delete mode 100644 d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph_org.svg
 delete mode 100644 d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.map
 delete mode 100644 d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.md5
 delete mode 100644 d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.svg
 delete mode 100644 d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph_org.svg
 delete mode 100644 d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.map
 delete mode 100644 d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.md5
 delete mode 100644 d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.svg
 delete mode 100644 d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph_org.svg
 delete mode 100644 d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.map
 delete mode 100644 d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.md5
 delete mode 100644 d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.svg
 delete mode 100644 d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph_org.svg
 delete mode 100644 d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d0/d6d/modular__exponentiation_8cpp_source.html
 delete mode 100644 d0/d77/longest__palindromic__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d0/d77/longest__palindromic__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d0/d77/longest__palindromic__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d0/d77/longest__palindromic__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d0/d77/longest__palindromic__subsequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d0/d77/longest__palindromic__subsequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d0/d77/longest__palindromic__subsequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d0/d77/longest__palindromic__subsequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d0/d77/longest__palindromic__subsequence_8cpp_source.html
 delete mode 100644 d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
 delete mode 100644 d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
 delete mode 100644 d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
 delete mode 100644 d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
 delete mode 100644 d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d0/da2/number__of__positive__divisors_8cpp_source.html
 create mode 100644 d0/db6/non__recursive__merge__sort_8cpp_source.html
 delete mode 100644 d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph.map
 delete mode 100644 d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph.md5
 delete mode 100644 d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph.svg
 delete mode 100644 d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph_org.svg
 delete mode 100644 d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.map
 delete mode 100644 d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.md5
 delete mode 100644 d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.svg
 delete mode 100644 d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph_org.svg
 delete mode 100644 d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.map
 delete mode 100644 d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.md5
 delete mode 100644 d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.svg
 delete mode 100644 d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph_org.svg
 delete mode 100644 d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.map
 delete mode 100644 d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.md5
 delete mode 100644 d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.svg
 delete mode 100644 d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph_org.svg
 delete mode 100644 d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d0/dd2/treap_8cpp_source.html
 delete mode 100644 d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d0/de2/gaussian__elimination_8cpp_source.html
 create mode 100644 d0/dea/strassen__matrix__multiplication_8cpp_source.html
 delete mode 100644 d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph.map
 delete mode 100644 d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph.md5
 delete mode 100644 d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph.svg
 delete mode 100644 d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph_org.svg
 delete mode 100644 d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph.map
 delete mode 100644 d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph.md5
 delete mode 100644 d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph.svg
 delete mode 100644 d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph_org.svg
 delete mode 100644 d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph.map
 delete mode 100644 d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph.md5
 delete mode 100644 d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph.svg
 delete mode 100644 d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph_org.svg
 delete mode 100644 d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d1/d11/gcd__of__n__numbers_8cpp_source.html
 create mode 100644 d1/d12/tree_8cpp_source.html
 create mode 100644 d1/d1b/topological__sort__by__kahns__algo_8cpp_source.html
 create mode 100644 d1/d1c/base64__encoding_8cpp_source.html
 delete mode 100644 d1/d21/quick__sort_8cpp_a1b2a2cc2d319240f3b65c5b2f479ed82_cgraph.map
 delete mode 100644 d1/d21/quick__sort_8cpp_a1b2a2cc2d319240f3b65c5b2f479ed82_cgraph.md5
 delete mode 100644 d1/d21/quick__sort_8cpp_a1b2a2cc2d319240f3b65c5b2f479ed82_cgraph.svg
 delete mode 100644 d1/d21/quick__sort_8cpp_a1b2a2cc2d319240f3b65c5b2f479ed82_cgraph_org.svg
 delete mode 100644 d1/d21/quick__sort_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 d1/d21/quick__sort_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 d1/d21/quick__sort_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 d1/d21/quick__sort_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d1/d21/quick__sort_8cpp_source.html
 delete mode 100644 d1/d2a/knight__tour_8cpp_aaa47356d98676cf5315d978f741e29c9_cgraph.map
 delete mode 100644 d1/d2a/knight__tour_8cpp_aaa47356d98676cf5315d978f741e29c9_cgraph.md5
 delete mode 100644 d1/d2a/knight__tour_8cpp_aaa47356d98676cf5315d978f741e29c9_cgraph.svg
 delete mode 100644 d1/d2a/knight__tour_8cpp_aaa47356d98676cf5315d978f741e29c9_cgraph_org.svg
 delete mode 100644 d1/d2a/knight__tour_8cpp_af27031fbff093ffd625f64010d98aab2_cgraph.map
 delete mode 100644 d1/d2a/knight__tour_8cpp_af27031fbff093ffd625f64010d98aab2_cgraph.md5
 delete mode 100644 d1/d2a/knight__tour_8cpp_af27031fbff093ffd625f64010d98aab2_cgraph.svg
 delete mode 100644 d1/d2a/knight__tour_8cpp_af27031fbff093ffd625f64010d98aab2_cgraph_org.svg
 create mode 100644 d1/d2a/knight__tour_8cpp_source.html
 create mode 100644 d1/d40/counting__sort_8cpp_source.html
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph.map
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph.md5
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph.svg
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph_org.svg
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph.map
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph.md5
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph.svg
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph_org.svg
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph.map
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph.md5
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph.svg
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph_org.svg
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a8f7bca1746d40f21ad832fcea59aa6c6_cgraph.map
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a8f7bca1746d40f21ad832fcea59aa6c6_cgraph.md5
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a8f7bca1746d40f21ad832fcea59aa6c6_cgraph.svg
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a8f7bca1746d40f21ad832fcea59aa6c6_cgraph_org.svg
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_aa339c31ec74cd86a4842a8b09653d460_cgraph.map
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_aa339c31ec74cd86a4842a8b09653d460_cgraph.md5
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_aa339c31ec74cd86a4842a8b09653d460_cgraph.svg
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_aa339c31ec74cd86a4842a8b09653d460_cgraph_org.svg
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ad22d760a5a33545a70e7ea5e1786c8dc_cgraph.map
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ad22d760a5a33545a70e7ea5e1786c8dc_cgraph.md5
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ad22d760a5a33545a70e7ea5e1786c8dc_cgraph.svg
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ad22d760a5a33545a70e7ea5e1786c8dc_cgraph_org.svg
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae2b407e64aaf9878fbee7ee6efe9c7d4_cgraph.map
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae2b407e64aaf9878fbee7ee6efe9c7d4_cgraph.md5
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae2b407e64aaf9878fbee7ee6efe9c7d4_cgraph.svg
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae2b407e64aaf9878fbee7ee6efe9c7d4_cgraph_org.svg
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae8de7aefcb6635d3dacdd174cd4890c4_cgraph.map
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae8de7aefcb6635d3dacdd174cd4890c4_cgraph.md5
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae8de7aefcb6635d3dacdd174cd4890c4_cgraph.svg
 delete mode 100644 d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae8de7aefcb6635d3dacdd174cd4890c4_cgraph_org.svg
 create mode 100644 d1/d70/cll_8cpp_source.html
 delete mode 100644 d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d1/d76/buzz__number_8cpp_source.html
 create mode 100644 d1/d7c/fibonacci__bottom__up_8cpp_source.html
 delete mode 100644 d1/d83/classuint256__t_a033d66c965e8d1fbc5bafb59ad60e163_cgraph.map
 delete mode 100644 d1/d83/classuint256__t_a033d66c965e8d1fbc5bafb59ad60e163_cgraph.md5
 delete mode 100644 d1/d83/classuint256__t_a033d66c965e8d1fbc5bafb59ad60e163_cgraph.svg
 delete mode 100644 d1/d83/classuint256__t_a033d66c965e8d1fbc5bafb59ad60e163_cgraph_org.svg
 delete mode 100644 d1/d83/classuint256__t_a1fa3d95584d071add9b46597d3747b39_cgraph.map
 delete mode 100644 d1/d83/classuint256__t_a1fa3d95584d071add9b46597d3747b39_cgraph.md5
 delete mode 100644 d1/d83/classuint256__t_a1fa3d95584d071add9b46597d3747b39_cgraph.svg
 delete mode 100644 d1/d83/classuint256__t_a1fa3d95584d071add9b46597d3747b39_cgraph_org.svg
 delete mode 100644 d1/d83/classuint256__t_a2cd43a4a92dc825a010a17578b3bdedb_cgraph.map
 delete mode 100644 d1/d83/classuint256__t_a2cd43a4a92dc825a010a17578b3bdedb_cgraph.md5
 delete mode 100644 d1/d83/classuint256__t_a2cd43a4a92dc825a010a17578b3bdedb_cgraph.svg
 delete mode 100644 d1/d83/classuint256__t_a2cd43a4a92dc825a010a17578b3bdedb_cgraph_org.svg
 delete mode 100644 d1/d83/classuint256__t_a4645040fe68ff01d83400f173fd2bb21_cgraph.map
 delete mode 100644 d1/d83/classuint256__t_a4645040fe68ff01d83400f173fd2bb21_cgraph.md5
 delete mode 100644 d1/d83/classuint256__t_a4645040fe68ff01d83400f173fd2bb21_cgraph.svg
 delete mode 100644 d1/d83/classuint256__t_a4645040fe68ff01d83400f173fd2bb21_cgraph_org.svg
 delete mode 100644 d1/d83/classuint256__t_a4fdeb4d4bf8cca4ee99b8487e59831df_cgraph.map
 delete mode 100644 d1/d83/classuint256__t_a4fdeb4d4bf8cca4ee99b8487e59831df_cgraph.md5
 delete mode 100644 d1/d83/classuint256__t_a4fdeb4d4bf8cca4ee99b8487e59831df_cgraph.svg
 delete mode 100644 d1/d83/classuint256__t_a4fdeb4d4bf8cca4ee99b8487e59831df_cgraph_org.svg
 delete mode 100644 d1/d83/classuint256__t_a8161d52d369e525f4e61129376adfcf1_cgraph.map
 delete mode 100644 d1/d83/classuint256__t_a8161d52d369e525f4e61129376adfcf1_cgraph.md5
 delete mode 100644 d1/d83/classuint256__t_a8161d52d369e525f4e61129376adfcf1_cgraph.svg
 delete mode 100644 d1/d83/classuint256__t_a8161d52d369e525f4e61129376adfcf1_cgraph_org.svg
 delete mode 100644 d1/d83/classuint256__t_a86aab081bb7db2771e4a4f30c3eed8e2_cgraph.map
 delete mode 100644 d1/d83/classuint256__t_a86aab081bb7db2771e4a4f30c3eed8e2_cgraph.md5
 delete mode 100644 d1/d83/classuint256__t_a86aab081bb7db2771e4a4f30c3eed8e2_cgraph.svg
 delete mode 100644 d1/d83/classuint256__t_a86aab081bb7db2771e4a4f30c3eed8e2_cgraph_org.svg
 delete mode 100644 d1/d83/classuint256__t_a9ddd133cee83f3a2ab6ed60a7ccbc250_cgraph.map
 delete mode 100644 d1/d83/classuint256__t_a9ddd133cee83f3a2ab6ed60a7ccbc250_cgraph.md5
 delete mode 100644 d1/d83/classuint256__t_a9ddd133cee83f3a2ab6ed60a7ccbc250_cgraph.svg
 delete mode 100644 d1/d83/classuint256__t_a9ddd133cee83f3a2ab6ed60a7ccbc250_cgraph_org.svg
 delete mode 100644 d1/d83/classuint256__t_aa9e585b186e71d7cbe9c1d7387c38967_cgraph.map
 delete mode 100644 d1/d83/classuint256__t_aa9e585b186e71d7cbe9c1d7387c38967_cgraph.md5
 delete mode 100644 d1/d83/classuint256__t_aa9e585b186e71d7cbe9c1d7387c38967_cgraph.svg
 delete mode 100644 d1/d83/classuint256__t_aa9e585b186e71d7cbe9c1d7387c38967_cgraph_org.svg
 delete mode 100644 d1/d83/classuint256__t_ac1b36e64de42f3622e7d6ec5efa273d4_cgraph.map
 delete mode 100644 d1/d83/classuint256__t_ac1b36e64de42f3622e7d6ec5efa273d4_cgraph.md5
 delete mode 100644 d1/d83/classuint256__t_ac1b36e64de42f3622e7d6ec5efa273d4_cgraph.svg
 delete mode 100644 d1/d83/classuint256__t_ac1b36e64de42f3622e7d6ec5efa273d4_cgraph_org.svg
 delete mode 100644 d1/d83/classuint256__t_ad4928175eaaaa2b559bc945affe63ad2_cgraph.map
 delete mode 100644 d1/d83/classuint256__t_ad4928175eaaaa2b559bc945affe63ad2_cgraph.md5
 delete mode 100644 d1/d83/classuint256__t_ad4928175eaaaa2b559bc945affe63ad2_cgraph.svg
 delete mode 100644 d1/d83/classuint256__t_ad4928175eaaaa2b559bc945affe63ad2_cgraph_org.svg
 delete mode 100644 d1/d83/classuint256__t_afee82fa5052e9d8c946b9205b943cec4_cgraph.map
 delete mode 100644 d1/d83/classuint256__t_afee82fa5052e9d8c946b9205b943cec4_cgraph.md5
 delete mode 100644 d1/d83/classuint256__t_afee82fa5052e9d8c946b9205b943cec4_cgraph.svg
 delete mode 100644 d1/d83/classuint256__t_afee82fa5052e9d8c946b9205b943cec4_cgraph_org.svg
 delete mode 100644 d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
 delete mode 100644 d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
 delete mode 100644 d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
 delete mode 100644 d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
 delete mode 100644 d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d1/d9a/hopcroft__karp_8cpp_source.html
 delete mode 100644 d1/d9e/prefix__sum__array_8cpp_ab36151479ad37d53ef9fcb60a274b1d9_cgraph.map
 delete mode 100644 d1/d9e/prefix__sum__array_8cpp_ab36151479ad37d53ef9fcb60a274b1d9_cgraph.md5
 delete mode 100644 d1/d9e/prefix__sum__array_8cpp_ab36151479ad37d53ef9fcb60a274b1d9_cgraph.svg
 delete mode 100644 d1/d9e/prefix__sum__array_8cpp_ab36151479ad37d53ef9fcb60a274b1d9_cgraph_org.svg
 delete mode 100644 d1/d9e/prefix__sum__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d1/d9e/prefix__sum__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d1/d9e/prefix__sum__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d1/d9e/prefix__sum__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d1/d9e/prefix__sum__array_8cpp_source.html
 delete mode 100644 d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph.map
 delete mode 100644 d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph.md5
 delete mode 100644 d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph.svg
 delete mode 100644 d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph_org.svg
 delete mode 100644 d1/da6/rungekutta_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d1/da6/rungekutta_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d1/da6/rungekutta_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d1/da6/rungekutta_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d1/da6/rungekutta_8cpp_source.html
 delete mode 100644 d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d1/da7/armstrong__number__templated_8cpp_source.html
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_a3d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph.map
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_a3d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph.md5
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_a3d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph.svg
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_a3d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph_org.svg
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_a40675d2eb960c71ca31ec475ba90120d_cgraph.map
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_a40675d2eb960c71ca31ec475ba90120d_cgraph.md5
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_a40675d2eb960c71ca31ec475ba90120d_cgraph.svg
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_a40675d2eb960c71ca31ec475ba90120d_cgraph_org.svg
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_a7d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph.map
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_a7d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph.md5
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_a7d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph.svg
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_a7d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph_org.svg
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_aac5657b4fe2251cd21073f44233f6ea5_cgraph.map
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_aac5657b4fe2251cd21073f44233f6ea5_cgraph.md5
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_aac5657b4fe2251cd21073f44233f6ea5_cgraph.svg
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_aac5657b4fe2251cd21073f44233f6ea5_cgraph_org.svg
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_ac3281dc34a9cfd7beb332419b8a0aa10_cgraph.map
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_ac3281dc34a9cfd7beb332419b8a0aa10_cgraph.md5
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_ac3281dc34a9cfd7beb332419b8a0aa10_cgraph.svg
 delete mode 100644 d1/daa/random__pivot__quick__sort_8cpp_ac3281dc34a9cfd7beb332419b8a0aa10_cgraph_org.svg
 create mode 100644 d1/daa/random__pivot__quick__sort_8cpp_source.html
 delete mode 100644 d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
 delete mode 100644 d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
 delete mode 100644 d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
 delete mode 100644 d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
 delete mode 100644 d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 create mode 100644 d1/dbb/n__choose__r_8cpp_source.html
 delete mode 100644 d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.map
 delete mode 100644 d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.md5
 delete mode 100644 d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.svg
 delete mode 100644 d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph_org.svg
 delete mode 100644 d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.map
 delete mode 100644 d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.md5
 delete mode 100644 d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.svg
 delete mode 100644 d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph_org.svg
 delete mode 100644 d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.map
 delete mode 100644 d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.md5
 delete mode 100644 d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.svg
 delete mode 100644 d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph_org.svg
 delete mode 100644 d1/dc2/classstack_a90df277532c23519aa7ac3c08ed90a1d_cgraph.map
 delete mode 100644 d1/dc2/classstack_a90df277532c23519aa7ac3c08ed90a1d_cgraph.md5
 delete mode 100644 d1/dc2/classstack_a90df277532c23519aa7ac3c08ed90a1d_cgraph.svg
 delete mode 100644 d1/dc2/classstack_a90df277532c23519aa7ac3c08ed90a1d_cgraph_org.svg
 delete mode 100644 d1/dc7/linear__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d1/dc7/linear__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d1/dc7/linear__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d1/dc7/linear__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d1/dc7/linear__probing__hash__table_8cpp_source.html
 delete mode 100644 d1/dcc/wiggle__sort_8cpp_a99eeded693ac073717282fae365957a1_cgraph.map
 delete mode 100644 d1/dcc/wiggle__sort_8cpp_a99eeded693ac073717282fae365957a1_cgraph.md5
 delete mode 100644 d1/dcc/wiggle__sort_8cpp_a99eeded693ac073717282fae365957a1_cgraph.svg
 delete mode 100644 d1/dcc/wiggle__sort_8cpp_a99eeded693ac073717282fae365957a1_cgraph_org.svg
 create mode 100644 d1/dcc/wiggle__sort_8cpp_source.html
 delete mode 100644 d1/de0/namespacenumerical__methods_a158fd271b9a53e8f3f60b08b18857150_cgraph.map
 delete mode 100644 d1/de0/namespacenumerical__methods_a158fd271b9a53e8f3f60b08b18857150_cgraph.md5
 delete mode 100644 d1/de0/namespacenumerical__methods_a158fd271b9a53e8f3f60b08b18857150_cgraph.svg
 delete mode 100644 d1/de0/namespacenumerical__methods_a158fd271b9a53e8f3f60b08b18857150_cgraph_org.svg
 delete mode 100644 d1/de0/namespacenumerical__methods_a28e67885f8606564cc8335f483f63309_cgraph.map
 delete mode 100644 d1/de0/namespacenumerical__methods_a28e67885f8606564cc8335f483f63309_cgraph.md5
 delete mode 100644 d1/de0/namespacenumerical__methods_a28e67885f8606564cc8335f483f63309_cgraph.svg
 delete mode 100644 d1/de0/namespacenumerical__methods_a28e67885f8606564cc8335f483f63309_cgraph_org.svg
 delete mode 100644 d1/de0/namespacenumerical__methods_aee56dc85997b8cd42bad71a5d6bd2d93_cgraph.map
 delete mode 100644 d1/de0/namespacenumerical__methods_aee56dc85997b8cd42bad71a5d6bd2d93_cgraph.md5
 delete mode 100644 d1/de0/namespacenumerical__methods_aee56dc85997b8cd42bad71a5d6bd2d93_cgraph.svg
 delete mode 100644 d1/de0/namespacenumerical__methods_aee56dc85997b8cd42bad71a5d6bd2d93_cgraph_org.svg
 delete mode 100644 d1/de9/integral__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d1/de9/integral__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d1/de9/integral__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d1/de9/integral__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d1/de9/integral__approximation_8cpp_source.html
 delete mode 100644 d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph.map
 delete mode 100644 d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph.md5
 delete mode 100644 d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph.svg
 delete mode 100644 d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph_org.svg
 delete mode 100644 d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.map
 delete mode 100644 d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.md5
 delete mode 100644 d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.svg
 delete mode 100644 d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph_org.svg
 create mode 100644 d1/ded/windowed__median_8cpp_source.html
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a009b19ac8cca40f2e4daa2e5989fa4f3_cgraph.map
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a009b19ac8cca40f2e4daa2e5989fa4f3_cgraph.md5
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a009b19ac8cca40f2e4daa2e5989fa4f3_cgraph.svg
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a009b19ac8cca40f2e4daa2e5989fa4f3_cgraph_org.svg
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a1313837c0e9ec67fd9fbd17987e2d615_cgraph.map
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a1313837c0e9ec67fd9fbd17987e2d615_cgraph.md5
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a1313837c0e9ec67fd9fbd17987e2d615_cgraph.svg
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a1313837c0e9ec67fd9fbd17987e2d615_cgraph_org.svg
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph.map
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph.md5
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph.svg
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph_org.svg
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.map
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.md5
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.svg
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph_org.svg
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph.map
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph.md5
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph.svg
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph_org.svg
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.map
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.md5
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.svg
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph_org.svg
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.map
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.md5
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.svg
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph_org.svg
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_ad3423f7518671351340932db3c24959a_cgraph.map
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_ad3423f7518671351340932db3c24959a_cgraph.md5
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_ad3423f7518671351340932db3c24959a_cgraph.svg
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_ad3423f7518671351340932db3c24959a_cgraph_org.svg
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_adb04f732911fcfd30f7177b367c6af41_cgraph.map
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_adb04f732911fcfd30f7177b367c6af41_cgraph.md5
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_adb04f732911fcfd30f7177b367c6af41_cgraph.svg
 delete mode 100644 d1/def/classdata__structures_1_1linked__list_1_1list_adb04f732911fcfd30f7177b367c6af41_cgraph_org.svg
 delete mode 100644 d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.map
 delete mode 100644 d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.md5
 delete mode 100644 d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.svg
 delete mode 100644 d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph_org.svg
 delete mode 100644 d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.map
 delete mode 100644 d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.md5
 delete mode 100644 d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.svg
 delete mode 100644 d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph_org.svg
 delete mode 100644 d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d1/df3/hash__search_8cpp_source.html
 delete mode 100644 d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.map
 delete mode 100644 d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.md5
 delete mode 100644 d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.svg
 delete mode 100644 d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph_org.svg
 delete mode 100644 d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.map
 delete mode 100644 d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.md5
 delete mode 100644 d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.svg
 delete mode 100644 d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph_org.svg
 delete mode 100644 d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.map
 delete mode 100644 d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.md5
 delete mode 100644 d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.svg
 delete mode 100644 d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph_org.svg
 delete mode 100644 d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.map
 delete mode 100644 d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.md5
 delete mode 100644 d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.svg
 delete mode 100644 d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph_org.svg
 delete mode 100644 d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.map
 delete mode 100644 d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.md5
 delete mode 100644 d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.svg
 delete mode 100644 d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph_org.svg
 delete mode 100644 d2/d0b/fast__power_8cpp_a0d4e3f0099a6975b74a314a35bd0f94d_cgraph.map
 delete mode 100644 d2/d0b/fast__power_8cpp_a0d4e3f0099a6975b74a314a35bd0f94d_cgraph.md5
 delete mode 100644 d2/d0b/fast__power_8cpp_a0d4e3f0099a6975b74a314a35bd0f94d_cgraph.svg
 delete mode 100644 d2/d0b/fast__power_8cpp_a0d4e3f0099a6975b74a314a35bd0f94d_cgraph_org.svg
 delete mode 100644 d2/d0b/fast__power_8cpp_a8399b847626e5bba983cab7c7918b445_cgraph.map
 delete mode 100644 d2/d0b/fast__power_8cpp_a8399b847626e5bba983cab7c7918b445_cgraph.md5
 delete mode 100644 d2/d0b/fast__power_8cpp_a8399b847626e5bba983cab7c7918b445_cgraph.svg
 delete mode 100644 d2/d0b/fast__power_8cpp_a8399b847626e5bba983cab7c7918b445_cgraph_org.svg
 delete mode 100644 d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d2/d0b/fast__power_8cpp_source.html
 delete mode 100644 d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d2/d21/gnome__sort_8cpp_source.html
 delete mode 100644 d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.map
 delete mode 100644 d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.md5
 delete mode 100644 d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.svg
 delete mode 100644 d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph_org.svg
 create mode 100644 d2/d22/jump__search_8cpp_source.html
 delete mode 100644 d2/d26/count__inversions_8cpp_a3332498eabf6579ef059c0d0e9f4ec80_cgraph.map
 delete mode 100644 d2/d26/count__inversions_8cpp_a3332498eabf6579ef059c0d0e9f4ec80_cgraph.md5
 delete mode 100644 d2/d26/count__inversions_8cpp_a3332498eabf6579ef059c0d0e9f4ec80_cgraph.svg
 delete mode 100644 d2/d26/count__inversions_8cpp_a3332498eabf6579ef059c0d0e9f4ec80_cgraph_org.svg
 delete mode 100644 d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph.map
 delete mode 100644 d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph.md5
 delete mode 100644 d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph.svg
 delete mode 100644 d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph_org.svg
 create mode 100644 d2/d26/count__inversions_8cpp_source.html
 delete mode 100644 d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.map
 delete mode 100644 d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.md5
 delete mode 100644 d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.svg
 delete mode 100644 d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph_org.svg
 delete mode 100644 d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.map
 delete mode 100644 d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.md5
 delete mode 100644 d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.svg
 delete mode 100644 d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph_org.svg
 delete mode 100644 d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.map
 delete mode 100644 d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.md5
 delete mode 100644 d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.svg
 delete mode 100644 d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph_org.svg
 delete mode 100644 d2/d3b/namespaceqr__algorithm_a6d3c7dce1f142141f509d09f6c0e25dc_cgraph.map
 delete mode 100644 d2/d3b/namespaceqr__algorithm_a6d3c7dce1f142141f509d09f6c0e25dc_cgraph.md5
 delete mode 100644 d2/d3b/namespaceqr__algorithm_a6d3c7dce1f142141f509d09f6c0e25dc_cgraph.svg
 delete mode 100644 d2/d3b/namespaceqr__algorithm_a6d3c7dce1f142141f509d09f6c0e25dc_cgraph_org.svg
 delete mode 100644 d2/d3b/namespaceqr__algorithm_a73ce637634fc49e1d10d190eb388ebf1_cgraph.map
 delete mode 100644 d2/d3b/namespaceqr__algorithm_a73ce637634fc49e1d10d190eb388ebf1_cgraph.md5
 delete mode 100644 d2/d3b/namespaceqr__algorithm_a73ce637634fc49e1d10d190eb388ebf1_cgraph.svg
 delete mode 100644 d2/d3b/namespaceqr__algorithm_a73ce637634fc49e1d10d190eb388ebf1_cgraph_org.svg
 delete mode 100644 d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.map
 delete mode 100644 d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.md5
 delete mode 100644 d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.svg
 delete mode 100644 d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph_org.svg
 delete mode 100644 d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph.map
 delete mode 100644 d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph.md5
 delete mode 100644 d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph.svg
 delete mode 100644 d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph_org.svg
 delete mode 100644 d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.map
 delete mode 100644 d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.md5
 delete mode 100644 d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.svg
 delete mode 100644 d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph_org.svg
 delete mode 100644 d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d2/d45/segtree_8cpp_abd3e818681fb2e29cf08f4f60f82c8e0_cgraph.map
 delete mode 100644 d2/d45/segtree_8cpp_abd3e818681fb2e29cf08f4f60f82c8e0_cgraph.md5
 delete mode 100644 d2/d45/segtree_8cpp_abd3e818681fb2e29cf08f4f60f82c8e0_cgraph.svg
 delete mode 100644 d2/d45/segtree_8cpp_abd3e818681fb2e29cf08f4f60f82c8e0_cgraph_org.svg
 delete mode 100644 d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d2/d45/segtree_8cpp_ae752659b7c1719d68fdb2ca538a93696_cgraph.map
 delete mode 100644 d2/d45/segtree_8cpp_ae752659b7c1719d68fdb2ca538a93696_cgraph.md5
 delete mode 100644 d2/d45/segtree_8cpp_ae752659b7c1719d68fdb2ca538a93696_cgraph.svg
 delete mode 100644 d2/d45/segtree_8cpp_ae752659b7c1719d68fdb2ca538a93696_cgraph_org.svg
 create mode 100644 d2/d45/segtree_8cpp_source.html
 create mode 100644 d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html
 delete mode 100644 d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
 delete mode 100644 d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
 delete mode 100644 d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
 delete mode 100644 d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
 delete mode 100644 d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d2/d52/heap__sort_8cpp_source.html
 delete mode 100644 d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.map
 delete mode 100644 d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.md5
 delete mode 100644 d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.svg
 delete mode 100644 d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph_org.svg
 delete mode 100644 d2/d58/neural__network_8cpp_a2a5e874b9774aa5362dbcf288828b95c_cgraph.map
 delete mode 100644 d2/d58/neural__network_8cpp_a2a5e874b9774aa5362dbcf288828b95c_cgraph.md5
 delete mode 100644 d2/d58/neural__network_8cpp_a2a5e874b9774aa5362dbcf288828b95c_cgraph.svg
 delete mode 100644 d2/d58/neural__network_8cpp_a2a5e874b9774aa5362dbcf288828b95c_cgraph_org.svg
 delete mode 100644 d2/d58/neural__network_8cpp_a32c00da08f2cf641dd336270f6e3c407_cgraph.map
 delete mode 100644 d2/d58/neural__network_8cpp_a32c00da08f2cf641dd336270f6e3c407_cgraph.md5
 delete mode 100644 d2/d58/neural__network_8cpp_a32c00da08f2cf641dd336270f6e3c407_cgraph.svg
 delete mode 100644 d2/d58/neural__network_8cpp_a32c00da08f2cf641dd336270f6e3c407_cgraph_org.svg
 delete mode 100644 d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph.map
 delete mode 100644 d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph.md5
 delete mode 100644 d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph.svg
 delete mode 100644 d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph_org.svg
 delete mode 100644 d2/d58/neural__network_8cpp_a45d3e30406712ada3d9713ece3c1b153_cgraph.map
 delete mode 100644 d2/d58/neural__network_8cpp_a45d3e30406712ada3d9713ece3c1b153_cgraph.md5
 delete mode 100644 d2/d58/neural__network_8cpp_a45d3e30406712ada3d9713ece3c1b153_cgraph.svg
 delete mode 100644 d2/d58/neural__network_8cpp_a45d3e30406712ada3d9713ece3c1b153_cgraph_org.svg
 delete mode 100644 d2/d58/neural__network_8cpp_a76eb66212d577f948a457b6e29d87c46_cgraph.map
 delete mode 100644 d2/d58/neural__network_8cpp_a76eb66212d577f948a457b6e29d87c46_cgraph.md5
 delete mode 100644 d2/d58/neural__network_8cpp_a76eb66212d577f948a457b6e29d87c46_cgraph.svg
 delete mode 100644 d2/d58/neural__network_8cpp_a76eb66212d577f948a457b6e29d87c46_cgraph_org.svg
 delete mode 100644 d2/d58/neural__network_8cpp_aa69e95a34054d7989bf446f96b2ffaf9_cgraph.map
 delete mode 100644 d2/d58/neural__network_8cpp_aa69e95a34054d7989bf446f96b2ffaf9_cgraph.md5
 delete mode 100644 d2/d58/neural__network_8cpp_aa69e95a34054d7989bf446f96b2ffaf9_cgraph.svg
 delete mode 100644 d2/d58/neural__network_8cpp_aa69e95a34054d7989bf446f96b2ffaf9_cgraph_org.svg
 delete mode 100644 d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph.map
 delete mode 100644 d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph.md5
 delete mode 100644 d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph.svg
 delete mode 100644 d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph_org.svg
 create mode 100644 d2/d58/neural__network_8cpp_source.html
 delete mode 100644 d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.map
 delete mode 100644 d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.md5
 delete mode 100644 d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.svg
 delete mode 100644 d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph_org.svg
 delete mode 100644 d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d2/d5a/subset__sum_8cpp_source.html
 create mode 100644 d2/d64/prims__minimum__spanning__tree_8cpp_source.html
 create mode 100644 d2/d7d/egg__dropping__puzzle_8cpp_source.html
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a0579062b384e54b611b80c6337c7f2c8_cgraph.map
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a0579062b384e54b611b80c6337c7f2c8_cgraph.md5
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a0579062b384e54b611b80c6337c7f2c8_cgraph.svg
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a0579062b384e54b611b80c6337c7f2c8_cgraph_org.svg
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a2dfbda148aad0bfaba2ebfda9ebc915a_cgraph.map
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a2dfbda148aad0bfaba2ebfda9ebc915a_cgraph.md5
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a2dfbda148aad0bfaba2ebfda9ebc915a_cgraph.svg
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a2dfbda148aad0bfaba2ebfda9ebc915a_cgraph_org.svg
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.map
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.md5
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.svg
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph_org.svg
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.map
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.md5
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.svg
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph_org.svg
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a9f1cb54ed09fde931bf3220d75ee4c57_cgraph.map
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a9f1cb54ed09fde931bf3220d75ee4c57_cgraph.md5
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a9f1cb54ed09fde931bf3220d75ee4c57_cgraph.svg
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a9f1cb54ed09fde931bf3220d75ee4c57_cgraph_org.svg
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_ae9e979edd69678b85665c01e2ee97828_cgraph.map
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_ae9e979edd69678b85665c01e2ee97828_cgraph.md5
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_ae9e979edd69678b85665c01e2ee97828_cgraph.svg
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_ae9e979edd69678b85665c01e2ee97828_cgraph_org.svg
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_af64848d6630c39d0f09ce2359cc7c4f8_cgraph.map
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_af64848d6630c39d0f09ce2359cc7c4f8_cgraph.md5
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_af64848d6630c39d0f09ce2359cc7c4f8_cgraph.svg
 delete mode 100644 d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_af64848d6630c39d0f09ce2359cc7c4f8_cgraph_org.svg
 delete mode 100644 d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.map
 delete mode 100644 d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.md5
 delete mode 100644 d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.svg
 delete mode 100644 d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph_org.svg
 create mode 100644 d2/d96/sparse__table__range__queries_8cpp_source.html
 create mode 100644 d2/da2/matrix__chain__multiplication_8cpp_source.html
 delete mode 100644 d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph.map
 delete mode 100644 d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph.md5
 delete mode 100644 d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph.svg
 delete mode 100644 d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph_org.svg
 delete mode 100644 d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph.map
 delete mode 100644 d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph.md5
 delete mode 100644 d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph.svg
 delete mode 100644 d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph_org.svg
 delete mode 100644 d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph.map
 delete mode 100644 d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph.md5
 delete mode 100644 d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph.svg
 delete mode 100644 d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph_org.svg
 delete mode 100644 d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph.map
 delete mode 100644 d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph.md5
 delete mode 100644 d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph.svg
 delete mode 100644 d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph_org.svg
 delete mode 100644 d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.map
 delete mode 100644 d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.md5
 delete mode 100644 d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg
 delete mode 100644 d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph_org.svg
 delete mode 100644 d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.map
 delete mode 100644 d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.md5
 delete mode 100644 d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg
 delete mode 100644 d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph_org.svg
 delete mode 100644 d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.map
 delete mode 100644 d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.md5
 delete mode 100644 d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg
 delete mode 100644 d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph_org.svg
 create mode 100644 d2/de9/heavy__light__decomposition_8cpp_source.html
 delete mode 100644 d3/d05/sudoku__solver_8cpp_a07dc6acffd0500de9bdbf16b3ade94b0_cgraph.map
 delete mode 100644 d3/d05/sudoku__solver_8cpp_a07dc6acffd0500de9bdbf16b3ade94b0_cgraph.md5
 delete mode 100644 d3/d05/sudoku__solver_8cpp_a07dc6acffd0500de9bdbf16b3ade94b0_cgraph.svg
 delete mode 100644 d3/d05/sudoku__solver_8cpp_a07dc6acffd0500de9bdbf16b3ade94b0_cgraph_org.svg
 delete mode 100644 d3/d05/sudoku__solver_8cpp_ab040a12d7684cd85fb3684f4211ea5ac_cgraph.map
 delete mode 100644 d3/d05/sudoku__solver_8cpp_ab040a12d7684cd85fb3684f4211ea5ac_cgraph.md5
 delete mode 100644 d3/d05/sudoku__solver_8cpp_ab040a12d7684cd85fb3684f4211ea5ac_cgraph.svg
 delete mode 100644 d3/d05/sudoku__solver_8cpp_ab040a12d7684cd85fb3684f4211ea5ac_cgraph_org.svg
 delete mode 100644 d3/d05/sudoku__solver_8cpp_ac911c8bca8556206ff64461b2424866b_cgraph.map
 delete mode 100644 d3/d05/sudoku__solver_8cpp_ac911c8bca8556206ff64461b2424866b_cgraph.md5
 delete mode 100644 d3/d05/sudoku__solver_8cpp_ac911c8bca8556206ff64461b2424866b_cgraph.svg
 delete mode 100644 d3/d05/sudoku__solver_8cpp_ac911c8bca8556206ff64461b2424866b_cgraph_org.svg
 delete mode 100644 d3/d05/sudoku__solver_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d3/d05/sudoku__solver_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d3/d05/sudoku__solver_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d3/d05/sudoku__solver_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d3/d05/sudoku__solver_8cpp_source.html
 delete mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
 delete mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
 delete mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
 delete mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
 delete mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map
 delete mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5
 delete mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg
 delete mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph_org.svg
 delete mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map
 delete mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5
 delete mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg
 delete mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph_org.svg
 create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_source.html
 create mode 100644 d3/d19/sparse__matrix_8cpp_source.html
 delete mode 100644 d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
 delete mode 100644 d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
 delete mode 100644 d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
 delete mode 100644 d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
 delete mode 100644 d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d3/d22/quick__sort__iterative_8cpp_source.html
 delete mode 100644 d3/d22/saddleback__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d3/d22/saddleback__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d3/d22/saddleback__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d3/d22/saddleback__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d3/d22/saddleback__search_8cpp_ad1e0ca34797d88490747c08eca70a2e6_cgraph.map
 delete mode 100644 d3/d22/saddleback__search_8cpp_ad1e0ca34797d88490747c08eca70a2e6_cgraph.md5
 delete mode 100644 d3/d22/saddleback__search_8cpp_ad1e0ca34797d88490747c08eca70a2e6_cgraph.svg
 delete mode 100644 d3/d22/saddleback__search_8cpp_ad1e0ca34797d88490747c08eca70a2e6_cgraph_org.svg
 delete mode 100644 d3/d22/saddleback__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d3/d22/saddleback__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d3/d22/saddleback__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d3/d22/saddleback__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d3/d22/saddleback__search_8cpp_source.html
 delete mode 100644 d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map
 delete mode 100644 d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5
 delete mode 100644 d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg
 delete mode 100644 d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg
 create mode 100644 d3/d24/qr__decomposition_8cpp_source.html
 create mode 100644 d3/d26/binary__search__tree_8cpp_source.html
 delete mode 100644 d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph.map
 delete mode 100644 d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph.md5
 delete mode 100644 d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph.svg
 delete mode 100644 d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph_org.svg
 delete mode 100644 d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph.map
 delete mode 100644 d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph.md5
 delete mode 100644 d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph.svg
 delete mode 100644 d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph_org.svg
 delete mode 100644 d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.map
 delete mode 100644 d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.md5
 delete mode 100644 d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.svg
 delete mode 100644 d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph_org.svg
 delete mode 100644 d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph.map
 delete mode 100644 d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph.md5
 delete mode 100644 d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph.svg
 delete mode 100644 d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph_org.svg
 delete mode 100644 d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d3/d36/digit__separation_8cpp_source.html
 delete mode 100644 d3/d39/manacher__algorithm_8cpp_a95e6a2976bb2f332898f373941d52098_cgraph.map
 delete mode 100644 d3/d39/manacher__algorithm_8cpp_a95e6a2976bb2f332898f373941d52098_cgraph.md5
 delete mode 100644 d3/d39/manacher__algorithm_8cpp_a95e6a2976bb2f332898f373941d52098_cgraph.svg
 delete mode 100644 d3/d39/manacher__algorithm_8cpp_a95e6a2976bb2f332898f373941d52098_cgraph_org.svg
 delete mode 100644 d3/d39/manacher__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d3/d39/manacher__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d3/d39/manacher__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d3/d39/manacher__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d3/d39/manacher__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d3/d39/manacher__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d3/d39/manacher__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d3/d39/manacher__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d3/d39/manacher__algorithm_8cpp_source.html
 delete mode 100644 d3/d40/graph__coloring_8cpp_a40337efc5dad761096489bf2c5b1c80c_cgraph.map
 delete mode 100644 d3/d40/graph__coloring_8cpp_a40337efc5dad761096489bf2c5b1c80c_cgraph.md5
 delete mode 100644 d3/d40/graph__coloring_8cpp_a40337efc5dad761096489bf2c5b1c80c_cgraph.svg
 delete mode 100644 d3/d40/graph__coloring_8cpp_a40337efc5dad761096489bf2c5b1c80c_cgraph_org.svg
 delete mode 100644 d3/d40/graph__coloring_8cpp_a8c47fa37fb6eeeb781b2ec1b05af6b07_cgraph.map
 delete mode 100644 d3/d40/graph__coloring_8cpp_a8c47fa37fb6eeeb781b2ec1b05af6b07_cgraph.md5
 delete mode 100644 d3/d40/graph__coloring_8cpp_a8c47fa37fb6eeeb781b2ec1b05af6b07_cgraph.svg
 delete mode 100644 d3/d40/graph__coloring_8cpp_a8c47fa37fb6eeeb781b2ec1b05af6b07_cgraph_org.svg
 delete mode 100644 d3/d40/graph__coloring_8cpp_a976efe049deb042bf1f02612e181ab1d_cgraph.map
 delete mode 100644 d3/d40/graph__coloring_8cpp_a976efe049deb042bf1f02612e181ab1d_cgraph.md5
 delete mode 100644 d3/d40/graph__coloring_8cpp_a976efe049deb042bf1f02612e181ab1d_cgraph.svg
 delete mode 100644 d3/d40/graph__coloring_8cpp_a976efe049deb042bf1f02612e181ab1d_cgraph_org.svg
 create mode 100644 d3/d40/graph__coloring_8cpp_source.html
 delete mode 100644 d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.map
 delete mode 100644 d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.md5
 delete mode 100644 d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.svg
 delete mode 100644 d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph_org.svg
 delete mode 100644 d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.map
 delete mode 100644 d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.md5
 delete mode 100644 d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.svg
 delete mode 100644 d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph_org.svg
 delete mode 100644 d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d3/d4c/quick__sort__3_8cpp_source.html
 delete mode 100644 d3/d4c/xor__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
 delete mode 100644 d3/d4c/xor__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
 delete mode 100644 d3/d4c/xor__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
 delete mode 100644 d3/d4c/xor__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
 delete mode 100644 d3/d4c/xor__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d3/d4c/xor__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d3/d4c/xor__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d3/d4c/xor__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d3/d4c/xor__cipher_8cpp_source.html
 create mode 100644 d3/d53/mo_8cpp_source.html
 delete mode 100644 d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d3/d61/vector__important__functions_8cpp_source.html
 delete mode 100644 d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d3/d7d/brute__force__string__searching_8cpp_source.html
 delete mode 100644 d3/d80/z__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d3/d80/z__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d3/d80/z__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d3/d80/z__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d3/d80/z__function_8cpp_ac044c4794349a8cff6256b99950d5773_cgraph.map
 delete mode 100644 d3/d80/z__function_8cpp_ac044c4794349a8cff6256b99950d5773_cgraph.md5
 delete mode 100644 d3/d80/z__function_8cpp_ac044c4794349a8cff6256b99950d5773_cgraph.svg
 delete mode 100644 d3/d80/z__function_8cpp_ac044c4794349a8cff6256b99950d5773_cgraph_org.svg
 delete mode 100644 d3/d80/z__function_8cpp_ac186ca3ac3a69b5e52543bb13fe46db8_cgraph.map
 delete mode 100644 d3/d80/z__function_8cpp_ac186ca3ac3a69b5e52543bb13fe46db8_cgraph.md5
 delete mode 100644 d3/d80/z__function_8cpp_ac186ca3ac3a69b5e52543bb13fe46db8_cgraph.svg
 delete mode 100644 d3/d80/z__function_8cpp_ac186ca3ac3a69b5e52543bb13fe46db8_cgraph_org.svg
 delete mode 100644 d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d3/d80/z__function_8cpp_source.html
 delete mode 100644 d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.map
 delete mode 100644 d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.md5
 delete mode 100644 d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.svg
 delete mode 100644 d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph_org.svg
 delete mode 100644 d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.map
 delete mode 100644 d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.md5
 delete mode 100644 d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.svg
 delete mode 100644 d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph_org.svg
 delete mode 100644 d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.map
 delete mode 100644 d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.md5
 delete mode 100644 d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.svg
 delete mode 100644 d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph_org.svg
 create mode 100644 d3/d84/word__break_8cpp_source.html
 delete mode 100644 d3/d92/pancake__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d3/d92/pancake__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d3/d92/pancake__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d3/d92/pancake__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d3/d92/pancake__sort_8cpp_abff90bc0f54e4f8ea5f0330471781bd5_cgraph.map
 delete mode 100644 d3/d92/pancake__sort_8cpp_abff90bc0f54e4f8ea5f0330471781bd5_cgraph.md5
 delete mode 100644 d3/d92/pancake__sort_8cpp_abff90bc0f54e4f8ea5f0330471781bd5_cgraph.svg
 delete mode 100644 d3/d92/pancake__sort_8cpp_abff90bc0f54e4f8ea5f0330471781bd5_cgraph_org.svg
 delete mode 100644 d3/d92/pancake__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d3/d92/pancake__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d3/d92/pancake__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d3/d92/pancake__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d3/d92/pancake__sort_8cpp_source.html
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.map
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.md5
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph_org.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.map
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.md5
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph_org.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.map
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.md5
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph_org.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.map
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.md5
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph_org.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.map
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.md5
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph_org.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.map
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.md5
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph_org.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.map
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.md5
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph_org.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.map
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.md5
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph_org.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.map
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.md5
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph_org.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.map
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.md5
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph_org.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.map
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.md5
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph_org.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.map
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.md5
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph_org.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.map
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.md5
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph_org.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.map
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.md5
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph_org.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.map
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.md5
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph_org.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.map
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.md5
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph_org.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.map
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.md5
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.svg
 delete mode 100644 d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph_org.svg
 delete mode 100644 d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.map
 delete mode 100644 d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.md5
 delete mode 100644 d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg
 delete mode 100644 d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg
 delete mode 100644 d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map
 delete mode 100644 d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5
 delete mode 100644 d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg
 delete mode 100644 d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg
 create mode 100644 d3/dae/dsu__path__compression_8cpp_source.html
 delete mode 100644 d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.map
 delete mode 100644 d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.md5
 delete mode 100644 d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.svg
 delete mode 100644 d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph_org.svg
 delete mode 100644 d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.map
 delete mode 100644 d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.md5
 delete mode 100644 d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.svg
 delete mode 100644 d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph_org.svg
 delete mode 100644 d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d3/db2/boyer__moore_8cpp_source.html
 delete mode 100644 d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.map
 delete mode 100644 d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.md5
 delete mode 100644 d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.svg
 delete mode 100644 d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph_org.svg
 delete mode 100644 d3/db3/lru__cache_8cpp_a24d21a345ed06f7fba6919718cf3e058_cgraph.map
 delete mode 100644 d3/db3/lru__cache_8cpp_a24d21a345ed06f7fba6919718cf3e058_cgraph.md5
 delete mode 100644 d3/db3/lru__cache_8cpp_a24d21a345ed06f7fba6919718cf3e058_cgraph.svg
 delete mode 100644 d3/db3/lru__cache_8cpp_a24d21a345ed06f7fba6919718cf3e058_cgraph_org.svg
 delete mode 100644 d3/db3/lru__cache_8cpp_a4b02e288a407876a8d6024f98a2a25ec_cgraph.map
 delete mode 100644 d3/db3/lru__cache_8cpp_a4b02e288a407876a8d6024f98a2a25ec_cgraph.md5
 delete mode 100644 d3/db3/lru__cache_8cpp_a4b02e288a407876a8d6024f98a2a25ec_cgraph.svg
 delete mode 100644 d3/db3/lru__cache_8cpp_a4b02e288a407876a8d6024f98a2a25ec_cgraph_org.svg
 delete mode 100644 d3/db3/lru__cache_8cpp_a6401e8f2d41d8cc9cd0e52ab381608d4_cgraph.map
 delete mode 100644 d3/db3/lru__cache_8cpp_a6401e8f2d41d8cc9cd0e52ab381608d4_cgraph.md5
 delete mode 100644 d3/db3/lru__cache_8cpp_a6401e8f2d41d8cc9cd0e52ab381608d4_cgraph.svg
 delete mode 100644 d3/db3/lru__cache_8cpp_a6401e8f2d41d8cc9cd0e52ab381608d4_cgraph_org.svg
 delete mode 100644 d3/db3/lru__cache_8cpp_a6a3be6d8871b1f5dc03688da8f3ee9e6_cgraph.map
 delete mode 100644 d3/db3/lru__cache_8cpp_a6a3be6d8871b1f5dc03688da8f3ee9e6_cgraph.md5
 delete mode 100644 d3/db3/lru__cache_8cpp_a6a3be6d8871b1f5dc03688da8f3ee9e6_cgraph.svg
 delete mode 100644 d3/db3/lru__cache_8cpp_a6a3be6d8871b1f5dc03688da8f3ee9e6_cgraph_org.svg
 delete mode 100644 d3/db3/lru__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d3/db3/lru__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d3/db3/lru__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d3/db3/lru__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d3/db3/lru__cache_8cpp_source.html
 delete mode 100644 d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.map
 delete mode 100644 d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.md5
 delete mode 100644 d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.svg
 delete mode 100644 d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph_org.svg
 delete mode 100644 d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.map
 delete mode 100644 d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.md5
 delete mode 100644 d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.svg
 delete mode 100644 d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph_org.svg
 delete mode 100644 d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.map
 delete mode 100644 d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.md5
 delete mode 100644 d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.svg
 delete mode 100644 d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph_org.svg
 create mode 100644 d3/dc1/bucket__sort_8cpp_source.html
 delete mode 100644 d3/dce/linkedlist__implentation__usingarray_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d3/dce/linkedlist__implentation__usingarray_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d3/dce/linkedlist__implentation__usingarray_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d3/dce/linkedlist__implentation__usingarray_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.map
 delete mode 100644 d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.md5
 delete mode 100644 d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.svg
 delete mode 100644 d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph_org.svg
 create mode 100644 d3/dce/linkedlist__implentation__usingarray_8cpp_source.html
 create mode 100644 d3/dea/stack__using__linked__list_8cpp_source.html
 create mode 100644 d3/dec/cycle__check__directed__graph_8cpp_source.html
 delete mode 100644 d3/df9/recursive__bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d3/df9/recursive__bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d3/df9/recursive__bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d3/df9/recursive__bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d3/df9/recursive__bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d3/df9/recursive__bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d3/df9/recursive__bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d3/df9/recursive__bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d3/df9/recursive__bubble__sort_8cpp_source.html
 create mode 100644 d3/dfb/circular__queue__using__array_8cpp_source.html
 delete mode 100644 d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph.map
 delete mode 100644 d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph.md5
 delete mode 100644 d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph.svg
 delete mode 100644 d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph_org.svg
 delete mode 100644 d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.map
 delete mode 100644 d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.md5
 delete mode 100644 d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.svg
 delete mode 100644 d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph_org.svg
 delete mode 100644 d3/dfe/horspool_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d3/dfe/horspool_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d3/dfe/horspool_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d3/dfe/horspool_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d3/dfe/horspool_8cpp_source.html
 delete mode 100644 d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d3/dfe/perimeter_8cpp_source.html
 delete mode 100644 d4/d08/sha256_8cpp_a28c1c6724dc6bcf91a39818699bbec27_cgraph.map
 delete mode 100644 d4/d08/sha256_8cpp_a28c1c6724dc6bcf91a39818699bbec27_cgraph.md5
 delete mode 100644 d4/d08/sha256_8cpp_a28c1c6724dc6bcf91a39818699bbec27_cgraph.svg
 delete mode 100644 d4/d08/sha256_8cpp_a28c1c6724dc6bcf91a39818699bbec27_cgraph_org.svg
 delete mode 100644 d4/d08/sha256_8cpp_a525531b3939ed44fbf01674e21931b3a_cgraph.map
 delete mode 100644 d4/d08/sha256_8cpp_a525531b3939ed44fbf01674e21931b3a_cgraph.md5
 delete mode 100644 d4/d08/sha256_8cpp_a525531b3939ed44fbf01674e21931b3a_cgraph.svg
 delete mode 100644 d4/d08/sha256_8cpp_a525531b3939ed44fbf01674e21931b3a_cgraph_org.svg
 delete mode 100644 d4/d08/sha256_8cpp_a55475649a2bb7aae15de0716a217f43a_cgraph.map
 delete mode 100644 d4/d08/sha256_8cpp_a55475649a2bb7aae15de0716a217f43a_cgraph.md5
 delete mode 100644 d4/d08/sha256_8cpp_a55475649a2bb7aae15de0716a217f43a_cgraph.svg
 delete mode 100644 d4/d08/sha256_8cpp_a55475649a2bb7aae15de0716a217f43a_cgraph_org.svg
 delete mode 100644 d4/d08/sha256_8cpp_a9e98c180d32b04aab6f767cb0c13e1da_cgraph.map
 delete mode 100644 d4/d08/sha256_8cpp_a9e98c180d32b04aab6f767cb0c13e1da_cgraph.md5
 delete mode 100644 d4/d08/sha256_8cpp_a9e98c180d32b04aab6f767cb0c13e1da_cgraph.svg
 delete mode 100644 d4/d08/sha256_8cpp_a9e98c180d32b04aab6f767cb0c13e1da_cgraph_org.svg
 delete mode 100644 d4/d08/sha256_8cpp_adbcd504103c342a4da718f8fce6ff06c_cgraph.map
 delete mode 100644 d4/d08/sha256_8cpp_adbcd504103c342a4da718f8fce6ff06c_cgraph.md5
 delete mode 100644 d4/d08/sha256_8cpp_adbcd504103c342a4da718f8fce6ff06c_cgraph.svg
 delete mode 100644 d4/d08/sha256_8cpp_adbcd504103c342a4da718f8fce6ff06c_cgraph_org.svg
 delete mode 100644 d4/d08/sha256_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d4/d08/sha256_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d4/d08/sha256_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d4/d08/sha256_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d4/d08/sha256_8cpp_afea411191ec5281f43e91ea327984627_cgraph.map
 delete mode 100644 d4/d08/sha256_8cpp_afea411191ec5281f43e91ea327984627_cgraph.md5
 delete mode 100644 d4/d08/sha256_8cpp_afea411191ec5281f43e91ea327984627_cgraph.svg
 delete mode 100644 d4/d08/sha256_8cpp_afea411191ec5281f43e91ea327984627_cgraph_org.svg
 create mode 100644 d4/d08/sha256_8cpp_source.html
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a1b74d828b33760094906797042b89442_cgraph.map
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a1b74d828b33760094906797042b89442_cgraph.md5
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a1b74d828b33760094906797042b89442_cgraph.svg
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a1b74d828b33760094906797042b89442_cgraph_org.svg
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.map
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.md5
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.svg
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph_org.svg
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a2f67508d5f392b0321772169342c98ad_cgraph.map
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a2f67508d5f392b0321772169342c98ad_cgraph.md5
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a2f67508d5f392b0321772169342c98ad_cgraph.svg
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a2f67508d5f392b0321772169342c98ad_cgraph_org.svg
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a4251b4df4748a0b9c43a48f61bdd2397_cgraph.map
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a4251b4df4748a0b9c43a48f61bdd2397_cgraph.md5
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a4251b4df4748a0b9c43a48f61bdd2397_cgraph.svg
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a4251b4df4748a0b9c43a48f61bdd2397_cgraph_org.svg
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a6d8df83a6f26ce24a75d3b358b7f5b8a_cgraph.map
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a6d8df83a6f26ce24a75d3b358b7f5b8a_cgraph.md5
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a6d8df83a6f26ce24a75d3b358b7f5b8a_cgraph.svg
 delete mode 100644 d4/d18/composite__simpson__rule_8cpp_a6d8df83a6f26ce24a75d3b358b7f5b8a_cgraph_org.svg
 create mode 100644 d4/d18/composite__simpson__rule_8cpp_source.html
 delete mode 100644 d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
 delete mode 100644 d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
 delete mode 100644 d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
 delete mode 100644 d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
 delete mode 100644 d4/d21/least__common__multiple_8cpp_a8ba1fc66e4134ab25b2602b323150563_cgraph.map
 delete mode 100644 d4/d21/least__common__multiple_8cpp_a8ba1fc66e4134ab25b2602b323150563_cgraph.md5
 delete mode 100644 d4/d21/least__common__multiple_8cpp_a8ba1fc66e4134ab25b2602b323150563_cgraph.svg
 delete mode 100644 d4/d21/least__common__multiple_8cpp_a8ba1fc66e4134ab25b2602b323150563_cgraph_org.svg
 delete mode 100644 d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.map
 delete mode 100644 d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.md5
 delete mode 100644 d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.svg
 delete mode 100644 d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph_org.svg
 delete mode 100644 d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d4/d21/least__common__multiple_8cpp_source.html
 delete mode 100644 d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d4/d32/fibonacci__fast_8cpp_source.html
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a05fe8a029e155c43e4efa598d4d089d9_cgraph.map
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a05fe8a029e155c43e4efa598d4d089d9_cgraph.md5
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a05fe8a029e155c43e4efa598d4d089d9_cgraph.svg
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a05fe8a029e155c43e4efa598d4d089d9_cgraph_org.svg
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a3923fb22b46e085376703cae0b44d690_cgraph.map
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a3923fb22b46e085376703cae0b44d690_cgraph.md5
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a3923fb22b46e085376703cae0b44d690_cgraph.svg
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a3923fb22b46e085376703cae0b44d690_cgraph_org.svg
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a3ae0bea4123fd2ce155108e88f2ef78c_cgraph.map
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a3ae0bea4123fd2ce155108e88f2ef78c_cgraph.md5
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a3ae0bea4123fd2ce155108e88f2ef78c_cgraph.svg
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a3ae0bea4123fd2ce155108e88f2ef78c_cgraph_org.svg
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.map
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.md5
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.svg
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph_org.svg
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a72483e3f6933e004a8d86371e8a990db_cgraph.map
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a72483e3f6933e004a8d86371e8a990db_cgraph.md5
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a72483e3f6933e004a8d86371e8a990db_cgraph.svg
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a72483e3f6933e004a8d86371e8a990db_cgraph_org.svg
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.map
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.md5
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.svg
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph_org.svg
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a7f6f73a33beec448c27cc1d70b220702_cgraph.map
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a7f6f73a33beec448c27cc1d70b220702_cgraph.md5
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a7f6f73a33beec448c27cc1d70b220702_cgraph.svg
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a7f6f73a33beec448c27cc1d70b220702_cgraph_org.svg
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a824cbf1814854824cf05f062eea07b95_cgraph.map
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a824cbf1814854824cf05f062eea07b95_cgraph.md5
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a824cbf1814854824cf05f062eea07b95_cgraph.svg
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a824cbf1814854824cf05f062eea07b95_cgraph_org.svg
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_source.html
 delete mode 100644 d4/d38/power__of__two_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d4/d38/power__of__two_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d4/d38/power__of__two_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d4/d38/power__of__two_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d4/d38/power__of__two_8cpp_adfd6be45be425ae28c62ce3bfb4b40dc_cgraph.map
 delete mode 100644 d4/d38/power__of__two_8cpp_adfd6be45be425ae28c62ce3bfb4b40dc_cgraph.md5
 delete mode 100644 d4/d38/power__of__two_8cpp_adfd6be45be425ae28c62ce3bfb4b40dc_cgraph.svg
 delete mode 100644 d4/d38/power__of__two_8cpp_adfd6be45be425ae28c62ce3bfb4b40dc_cgraph_org.svg
 delete mode 100644 d4/d38/power__of__two_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d4/d38/power__of__two_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d4/d38/power__of__two_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d4/d38/power__of__two_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d4/d38/power__of__two_8cpp_source.html
 delete mode 100644 d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
 delete mode 100644 d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
 delete mode 100644 d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
 delete mode 100644 d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
 delete mode 100644 d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph.map
 delete mode 100644 d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph.md5
 delete mode 100644 d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph.svg
 delete mode 100644 d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph_org.svg
 create mode 100644 d4/d3e/k__nearest__neighbors_8cpp_source.html
 delete mode 100644 d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph.map
 delete mode 100644 d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph.md5
 delete mode 100644 d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph.svg
 delete mode 100644 d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph_org.svg
 create mode 100644 d4/d3e/n__queens_8cpp_source.html
 delete mode 100644 d4/d45/gcd__recursive__euclidean_8cpp_ae48807fa2b7000afae599e67f327545e_cgraph.map
 delete mode 100644 d4/d45/gcd__recursive__euclidean_8cpp_ae48807fa2b7000afae599e67f327545e_cgraph.md5
 delete mode 100644 d4/d45/gcd__recursive__euclidean_8cpp_ae48807fa2b7000afae599e67f327545e_cgraph.svg
 delete mode 100644 d4/d45/gcd__recursive__euclidean_8cpp_ae48807fa2b7000afae599e67f327545e_cgraph_org.svg
 delete mode 100644 d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d4/d45/gcd__recursive__euclidean_8cpp_source.html
 delete mode 100644 d4/d48/hamming__distance_8cpp_a40ba9fe8b5df5c268f0c7d677ff2fe80_cgraph.map
 delete mode 100644 d4/d48/hamming__distance_8cpp_a40ba9fe8b5df5c268f0c7d677ff2fe80_cgraph.md5
 delete mode 100644 d4/d48/hamming__distance_8cpp_a40ba9fe8b5df5c268f0c7d677ff2fe80_cgraph.svg
 delete mode 100644 d4/d48/hamming__distance_8cpp_a40ba9fe8b5df5c268f0c7d677ff2fe80_cgraph_org.svg
 delete mode 100644 d4/d48/hamming__distance_8cpp_a65d845df3fecff7087a2126c7b72030b_cgraph.map
 delete mode 100644 d4/d48/hamming__distance_8cpp_a65d845df3fecff7087a2126c7b72030b_cgraph.md5
 delete mode 100644 d4/d48/hamming__distance_8cpp_a65d845df3fecff7087a2126c7b72030b_cgraph.svg
 delete mode 100644 d4/d48/hamming__distance_8cpp_a65d845df3fecff7087a2126c7b72030b_cgraph_org.svg
 delete mode 100644 d4/d48/hamming__distance_8cpp_abfe6fbb2f3460a2623c96f283178a07a_cgraph.map
 delete mode 100644 d4/d48/hamming__distance_8cpp_abfe6fbb2f3460a2623c96f283178a07a_cgraph.md5
 delete mode 100644 d4/d48/hamming__distance_8cpp_abfe6fbb2f3460a2623c96f283178a07a_cgraph.svg
 delete mode 100644 d4/d48/hamming__distance_8cpp_abfe6fbb2f3460a2623c96f283178a07a_cgraph_org.svg
 delete mode 100644 d4/d48/hamming__distance_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d4/d48/hamming__distance_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d4/d48/hamming__distance_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d4/d48/hamming__distance_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d4/d48/hamming__distance_8cpp_source.html
 delete mode 100644 d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
 delete mode 100644 d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
 delete mode 100644 d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
 delete mode 100644 d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
 delete mode 100644 d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
 delete mode 100644 d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
 delete mode 100644 d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
 delete mode 100644 d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
 delete mode 100644 d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
 delete mode 100644 d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
 delete mode 100644 d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
 delete mode 100644 d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
 delete mode 100644 d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.map
 delete mode 100644 d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.md5
 delete mode 100644 d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.svg
 delete mode 100644 d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph_org.svg
 delete mode 100644 d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d4/d4f/stooge__sort_8cpp_source.html
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_cgraph.map
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_cgraph.md5
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_cgraph.svg
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_cgraph_org.svg
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_cgraph.map
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_cgraph.md5
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_cgraph.svg
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_cgraph_org.svg
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_cgraph.map
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_cgraph.md5
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_cgraph.svg
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_cgraph_org.svg
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.map
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.md5
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph_org.svg
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.map
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.md5
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.svg
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph_org.svg
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.map
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.md5
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph_org.svg
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.map
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.md5
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.svg
 delete mode 100644 d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph_org.svg
 create mode 100644 d4/d7a/shell__sort2_8cpp_source.html
 delete mode 100644 d4/d83/sum__of__digits_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
 delete mode 100644 d4/d83/sum__of__digits_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
 delete mode 100644 d4/d83/sum__of__digits_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
 delete mode 100644 d4/d83/sum__of__digits_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
 delete mode 100644 d4/d83/sum__of__digits_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
 delete mode 100644 d4/d83/sum__of__digits_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
 delete mode 100644 d4/d83/sum__of__digits_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
 delete mode 100644 d4/d83/sum__of__digits_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
 delete mode 100644 d4/d83/sum__of__digits_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
 delete mode 100644 d4/d83/sum__of__digits_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
 delete mode 100644 d4/d83/sum__of__digits_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
 delete mode 100644 d4/d83/sum__of__digits_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
 delete mode 100644 d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d4/d83/sum__of__digits_8cpp_source.html
 create mode 100644 d4/d8b/gray__code_8cpp_source.html
 delete mode 100644 d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d4/d8d/jarvis__algorithm_8cpp_source.html
 delete mode 100644 d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ad08f082be02c3437c2fe89cb035fcee1_cgraph.map
 delete mode 100644 d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ad08f082be02c3437c2fe89cb035fcee1_cgraph.md5
 delete mode 100644 d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ad08f082be02c3437c2fe89cb035fcee1_cgraph.svg
 delete mode 100644 d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ad08f082be02c3437c2fe89cb035fcee1_cgraph_org.svg
 delete mode 100644 d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.map
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.md5
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.svg
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph_org.svg
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.map
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.md5
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.svg
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph_org.svg
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.map
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.md5
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.svg
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph_org.svg
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.map
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.md5
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.svg
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph_org.svg
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.map
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.md5
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.svg
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph_org.svg
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_af2f3d4e15b1f47afac849c2e08a730f4_cgraph.map
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_af2f3d4e15b1f47afac849c2e08a730f4_cgraph.md5
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_af2f3d4e15b1f47afac849c2e08a730f4_cgraph.svg
 delete mode 100644 d4/d90/classdata__structures_1_1_skip_list_af2f3d4e15b1f47afac849c2e08a730f4_cgraph_org.svg
 delete mode 100644 d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d4/d9c/primes__up__to__billion_8cpp_source.html
 delete mode 100644 d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d4/d9d/sum__of__binomial__coefficient_8cpp_source.html
 delete mode 100644 d4/d9f/selection__sort__recursive_8cpp_a5454eeb691725ccac0f59df1e133f834_cgraph.map
 delete mode 100644 d4/d9f/selection__sort__recursive_8cpp_a5454eeb691725ccac0f59df1e133f834_cgraph.md5
 delete mode 100644 d4/d9f/selection__sort__recursive_8cpp_a5454eeb691725ccac0f59df1e133f834_cgraph.svg
 delete mode 100644 d4/d9f/selection__sort__recursive_8cpp_a5454eeb691725ccac0f59df1e133f834_cgraph_org.svg
 delete mode 100644 d4/d9f/selection__sort__recursive_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d4/d9f/selection__sort__recursive_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d4/d9f/selection__sort__recursive_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d4/d9f/selection__sort__recursive_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d4/d9f/selection__sort__recursive_8cpp_ab6f7b33a070e376e1f4374e534435e89_cgraph.map
 delete mode 100644 d4/d9f/selection__sort__recursive_8cpp_ab6f7b33a070e376e1f4374e534435e89_cgraph.md5
 delete mode 100644 d4/d9f/selection__sort__recursive_8cpp_ab6f7b33a070e376e1f4374e534435e89_cgraph.svg
 delete mode 100644 d4/d9f/selection__sort__recursive_8cpp_ab6f7b33a070e376e1f4374e534435e89_cgraph_org.svg
 delete mode 100644 d4/d9f/selection__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d4/d9f/selection__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d4/d9f/selection__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d4/d9f/selection__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d4/d9f/selection__sort__recursive_8cpp_source.html
 delete mode 100644 d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d4/da0/gcd__iterative__euclidean_8cpp_source.html
 delete mode 100644 d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.map
 delete mode 100644 d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.md5
 delete mode 100644 d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.svg
 delete mode 100644 d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph_org.svg
 create mode 100644 d4/da0/kadane_8cpp_source.html
 delete mode 100644 d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.map
 delete mode 100644 d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.md5
 delete mode 100644 d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.svg
 delete mode 100644 d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph_org.svg
 delete mode 100644 d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d4/db6/reverse__binary__tree_8cpp_source.html
 delete mode 100644 d4/db8/longest__substring__without__repeating__characters_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 d4/db8/longest__substring__without__repeating__characters_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 d4/db8/longest__substring__without__repeating__characters_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 d4/db8/longest__substring__without__repeating__characters_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 d4/db8/longest__substring__without__repeating__characters_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d4/db8/longest__substring__without__repeating__characters_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d4/db8/longest__substring__without__repeating__characters_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d4/db8/longest__substring__without__repeating__characters_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d4/db8/longest__substring__without__repeating__characters_8cpp_source.html
 delete mode 100644 d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.map
 delete mode 100644 d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.md5
 delete mode 100644 d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.svg
 delete mode 100644 d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph_org.svg
 delete mode 100644 d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph.map
 delete mode 100644 d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph.md5
 delete mode 100644 d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph.svg
 delete mode 100644 d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph_org.svg
 delete mode 100644 d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph.map
 delete mode 100644 d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph.md5
 delete mode 100644 d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph.svg
 delete mode 100644 d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph_org.svg
 delete mode 100644 d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph.map
 delete mode 100644 d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph.md5
 delete mode 100644 d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph.svg
 delete mode 100644 d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph_org.svg
 delete mode 100644 d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph.map
 delete mode 100644 d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph.md5
 delete mode 100644 d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph.svg
 delete mode 100644 d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph_org.svg
 delete mode 100644 d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph.map
 delete mode 100644 d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph.md5
 delete mode 100644 d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph.svg
 delete mode 100644 d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph_org.svg
 delete mode 100644 d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph.map
 delete mode 100644 d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph.md5
 delete mode 100644 d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph.svg
 delete mode 100644 d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph_org.svg
 delete mode 100644 d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph.map
 delete mode 100644 d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph.md5
 delete mode 100644 d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph.svg
 delete mode 100644 d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph_org.svg
 delete mode 100644 d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph.map
 delete mode 100644 d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph.md5
 delete mode 100644 d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph.svg
 delete mode 100644 d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph_org.svg
 delete mode 100644 d4/dde/classgeometry_1_1jarvis_1_1_convexhull_aeec46e86786ddd461464b07a77c4d5f1_cgraph.map
 delete mode 100644 d4/dde/classgeometry_1_1jarvis_1_1_convexhull_aeec46e86786ddd461464b07a77c4d5f1_cgraph.md5
 delete mode 100644 d4/dde/classgeometry_1_1jarvis_1_1_convexhull_aeec46e86786ddd461464b07a77c4d5f1_cgraph.svg
 delete mode 100644 d4/dde/classgeometry_1_1jarvis_1_1_convexhull_aeec46e86786ddd461464b07a77c4d5f1_cgraph_org.svg
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a1302662a56ebf67a21249270b017297e_cgraph.map
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a1302662a56ebf67a21249270b017297e_cgraph.md5
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a1302662a56ebf67a21249270b017297e_cgraph.svg
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a1302662a56ebf67a21249270b017297e_cgraph_org.svg
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a48efb079040c7aaa3a4917a0e486cba9_cgraph.map
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a48efb079040c7aaa3a4917a0e486cba9_cgraph.md5
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a48efb079040c7aaa3a4917a0e486cba9_cgraph.svg
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a48efb079040c7aaa3a4917a0e486cba9_cgraph_org.svg
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a4b7ab643f6a5002f991837de46f70653_cgraph.map
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a4b7ab643f6a5002f991837de46f70653_cgraph.md5
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a4b7ab643f6a5002f991837de46f70653_cgraph.svg
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a4b7ab643f6a5002f991837de46f70653_cgraph_org.svg
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
 delete mode 100644 d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
 create mode 100644 d4/def/kohonen__som__topology_8cpp_source.html
 create mode 100644 d4/def/longest__common__subsequence_8cpp_source.html
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph.map
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph.md5
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph_org.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a361a45f3c3d8347d79103bf182d0570b_cgraph.map
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a361a45f3c3d8347d79103bf182d0570b_cgraph.md5
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a361a45f3c3d8347d79103bf182d0570b_cgraph.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a361a45f3c3d8347d79103bf182d0570b_cgraph_org.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph.map
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph.md5
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph_org.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph.map
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph.md5
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph_org.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4c6f63ab965317f9471518ee931b89_cgraph.map
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4c6f63ab965317f9471518ee931b89_cgraph.md5
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4c6f63ab965317f9471518ee931b89_cgraph.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4c6f63ab965317f9471518ee931b89_cgraph_org.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph.map
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph.md5
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph_org.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph.map
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph.md5
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph_org.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph.map
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph.md5
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph_org.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph.map
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph.md5
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph_org.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a62151b0398a2536be60d950e10ffe9a8_cgraph.map
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a62151b0398a2536be60d950e10ffe9a8_cgraph.md5
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a62151b0398a2536be60d950e10ffe9a8_cgraph.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a62151b0398a2536be60d950e10ffe9a8_cgraph_org.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph.map
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph.md5
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph_org.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph.map
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph.md5
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph_org.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph.map
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph.md5
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph.svg
 delete mode 100644 d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph_org.svg
 delete mode 100644 d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html
 create mode 100644 d5/d1e/tim__sort_8cpp_source.html
 create mode 100644 d5/d21/longest__increasing__subsequence__nlogn_8cpp_source.html
 create mode 100644 d5/d25/bead__sort_8cpp_source.html
 delete mode 100644 d5/d33/gram__schmidt_8cpp_a0837468e1a653ed056e2cce3c914afa5_cgraph.map
 delete mode 100644 d5/d33/gram__schmidt_8cpp_a0837468e1a653ed056e2cce3c914afa5_cgraph.md5
 delete mode 100644 d5/d33/gram__schmidt_8cpp_a0837468e1a653ed056e2cce3c914afa5_cgraph.svg
 delete mode 100644 d5/d33/gram__schmidt_8cpp_a0837468e1a653ed056e2cce3c914afa5_cgraph_org.svg
 delete mode 100644 d5/d33/gram__schmidt_8cpp_a8eeaafdde8b56f459aadc6013cf078bc_cgraph.map
 delete mode 100644 d5/d33/gram__schmidt_8cpp_a8eeaafdde8b56f459aadc6013cf078bc_cgraph.md5
 delete mode 100644 d5/d33/gram__schmidt_8cpp_a8eeaafdde8b56f459aadc6013cf078bc_cgraph.svg
 delete mode 100644 d5/d33/gram__schmidt_8cpp_a8eeaafdde8b56f459aadc6013cf078bc_cgraph_org.svg
 delete mode 100644 d5/d33/gram__schmidt_8cpp_ac4a4504924ecc9f12a2ebd80788ec01d_cgraph.map
 delete mode 100644 d5/d33/gram__schmidt_8cpp_ac4a4504924ecc9f12a2ebd80788ec01d_cgraph.md5
 delete mode 100644 d5/d33/gram__schmidt_8cpp_ac4a4504924ecc9f12a2ebd80788ec01d_cgraph.svg
 delete mode 100644 d5/d33/gram__schmidt_8cpp_ac4a4504924ecc9f12a2ebd80788ec01d_cgraph_org.svg
 delete mode 100644 d5/d33/gram__schmidt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d5/d33/gram__schmidt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d5/d33/gram__schmidt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d5/d33/gram__schmidt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d5/d33/gram__schmidt_8cpp_source.html
 delete mode 100644 d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
 delete mode 100644 d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
 delete mode 100644 d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
 delete mode 100644 d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
 delete mode 100644 d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.map
 delete mode 100644 d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.md5
 delete mode 100644 d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.svg
 delete mode 100644 d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph_org.svg
 delete mode 100644 d5/d45/sublist__search_8cpp_a70ca8d0267008e09cfa50b4e2ddfbe53_cgraph.map
 delete mode 100644 d5/d45/sublist__search_8cpp_a70ca8d0267008e09cfa50b4e2ddfbe53_cgraph.md5
 delete mode 100644 d5/d45/sublist__search_8cpp_a70ca8d0267008e09cfa50b4e2ddfbe53_cgraph.svg
 delete mode 100644 d5/d45/sublist__search_8cpp_a70ca8d0267008e09cfa50b4e2ddfbe53_cgraph_org.svg
 delete mode 100644 d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.map
 delete mode 100644 d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.md5
 delete mode 100644 d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.svg
 delete mode 100644 d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph_org.svg
 create mode 100644 d5/d45/sublist__search_8cpp_source.html
 delete mode 100644 d5/d4c/group__sorting_ga135e4c638e3bcf548bd122b5f49a3e72_cgraph.map
 delete mode 100644 d5/d4c/group__sorting_ga135e4c638e3bcf548bd122b5f49a3e72_cgraph.md5
 delete mode 100644 d5/d4c/group__sorting_ga135e4c638e3bcf548bd122b5f49a3e72_cgraph.svg
 delete mode 100644 d5/d4c/group__sorting_ga135e4c638e3bcf548bd122b5f49a3e72_cgraph_org.svg
 delete mode 100644 d5/d4c/group__sorting_ga29d28b140174dbdde7c9f5157758435f_cgraph.map
 delete mode 100644 d5/d4c/group__sorting_ga29d28b140174dbdde7c9f5157758435f_cgraph.md5
 delete mode 100644 d5/d4c/group__sorting_ga29d28b140174dbdde7c9f5157758435f_cgraph.svg
 delete mode 100644 d5/d4c/group__sorting_ga29d28b140174dbdde7c9f5157758435f_cgraph_org.svg
 delete mode 100644 d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d5/d4c/group__sorting_gab6b14fea48d9841e29b9fc26be6e05d7_cgraph.map
 delete mode 100644 d5/d4c/group__sorting_gab6b14fea48d9841e29b9fc26be6e05d7_cgraph.md5
 delete mode 100644 d5/d4c/group__sorting_gab6b14fea48d9841e29b9fc26be6e05d7_cgraph.svg
 delete mode 100644 d5/d4c/group__sorting_gab6b14fea48d9841e29b9fc26be6e05d7_cgraph_org.svg
 delete mode 100644 d5/d4c/group__sorting_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d5/d4c/group__sorting_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d5/d4c/group__sorting_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d5/d4c/group__sorting_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.map
 delete mode 100644 d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.md5
 delete mode 100644 d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.svg
 delete mode 100644 d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph_org.svg
 delete mode 100644 d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.map
 delete mode 100644 d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.md5
 delete mode 100644 d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.svg
 delete mode 100644 d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph_org.svg
 delete mode 100644 d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.map
 delete mode 100644 d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.md5
 delete mode 100644 d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg
 delete mode 100644 d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph_org.svg
 delete mode 100644 d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.map
 delete mode 100644 d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.md5
 delete mode 100644 d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.svg
 delete mode 100644 d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph_org.svg
 delete mode 100644 d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.map
 delete mode 100644 d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.md5
 delete mode 100644 d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg
 delete mode 100644 d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph_org.svg
 delete mode 100644 d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html
 delete mode 100644 d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d5/d67/bayes__theorem_8cpp_source.html
 delete mode 100644 d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph.map
 delete mode 100644 d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph.md5
 delete mode 100644 d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph.svg
 delete mode 100644 d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph_org.svg
 delete mode 100644 d5/d67/complex__numbers_8cpp_a5a73e9d4e68af8cedb95bd0864054b89_cgraph.map
 delete mode 100644 d5/d67/complex__numbers_8cpp_a5a73e9d4e68af8cedb95bd0864054b89_cgraph.md5
 delete mode 100644 d5/d67/complex__numbers_8cpp_a5a73e9d4e68af8cedb95bd0864054b89_cgraph.svg
 delete mode 100644 d5/d67/complex__numbers_8cpp_a5a73e9d4e68af8cedb95bd0864054b89_cgraph_org.svg
 delete mode 100644 d5/d67/complex__numbers_8cpp_a5d4d5b8250b50703de888514c8e7a7a0_cgraph.map
 delete mode 100644 d5/d67/complex__numbers_8cpp_a5d4d5b8250b50703de888514c8e7a7a0_cgraph.md5
 delete mode 100644 d5/d67/complex__numbers_8cpp_a5d4d5b8250b50703de888514c8e7a7a0_cgraph.svg
 delete mode 100644 d5/d67/complex__numbers_8cpp_a5d4d5b8250b50703de888514c8e7a7a0_cgraph_org.svg
 delete mode 100644 d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
 delete mode 100644 d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
 delete mode 100644 d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
 delete mode 100644 d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
 delete mode 100644 d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d5/d67/complex__numbers_8cpp_source.html
 delete mode 100644 d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d5/d7a/largest__power_8cpp_source.html
 create mode 100644 d5/d82/edit__distance_8cpp_source.html
 delete mode 100644 d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d5/d83/lcm__sum_8cpp_source.html
 delete mode 100644 d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d5/d8a/trie__using__hashmap_8cpp_source.html
 create mode 100644 d5/d8e/huffman_8cpp_source.html
 delete mode 100644 d5/d90/palindrome__partitioning_8cpp_a52ee22882858d2b1cf04293f02ed839a_cgraph.map
 delete mode 100644 d5/d90/palindrome__partitioning_8cpp_a52ee22882858d2b1cf04293f02ed839a_cgraph.md5
 delete mode 100644 d5/d90/palindrome__partitioning_8cpp_a52ee22882858d2b1cf04293f02ed839a_cgraph.svg
 delete mode 100644 d5/d90/palindrome__partitioning_8cpp_a52ee22882858d2b1cf04293f02ed839a_cgraph_org.svg
 delete mode 100644 d5/d90/palindrome__partitioning_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d5/d90/palindrome__partitioning_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d5/d90/palindrome__partitioning_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d5/d90/palindrome__partitioning_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d5/d90/palindrome__partitioning_8cpp_source.html
 delete mode 100644 d5/d91/namespacesorting_a034d8b276518a902962e87d3158b64fd_cgraph.map
 delete mode 100644 d5/d91/namespacesorting_a034d8b276518a902962e87d3158b64fd_cgraph.md5
 delete mode 100644 d5/d91/namespacesorting_a034d8b276518a902962e87d3158b64fd_cgraph.svg
 delete mode 100644 d5/d91/namespacesorting_a034d8b276518a902962e87d3158b64fd_cgraph_org.svg
 delete mode 100644 d5/d91/namespacesorting_a0e9e1b21a1684585e9e50f9afe4d53a3_cgraph.map
 delete mode 100644 d5/d91/namespacesorting_a0e9e1b21a1684585e9e50f9afe4d53a3_cgraph.md5
 delete mode 100644 d5/d91/namespacesorting_a0e9e1b21a1684585e9e50f9afe4d53a3_cgraph.svg
 delete mode 100644 d5/d91/namespacesorting_a0e9e1b21a1684585e9e50f9afe4d53a3_cgraph_org.svg
 delete mode 100644 d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.map
 delete mode 100644 d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.md5
 delete mode 100644 d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg
 delete mode 100644 d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph_org.svg
 delete mode 100644 d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph.map
 delete mode 100644 d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph.md5
 delete mode 100644 d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph.svg
 delete mode 100644 d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph_org.svg
 delete mode 100644 d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.map
 delete mode 100644 d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.md5
 delete mode 100644 d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg
 delete mode 100644 d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph_org.svg
 delete mode 100644 d5/d91/namespacesorting_a2f8bc626eb57acae24a94636a23af6a1_cgraph.map
 delete mode 100644 d5/d91/namespacesorting_a2f8bc626eb57acae24a94636a23af6a1_cgraph.md5
 delete mode 100644 d5/d91/namespacesorting_a2f8bc626eb57acae24a94636a23af6a1_cgraph.svg
 delete mode 100644 d5/d91/namespacesorting_a2f8bc626eb57acae24a94636a23af6a1_cgraph_org.svg
 delete mode 100644 d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.map
 delete mode 100644 d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.md5
 delete mode 100644 d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg
 delete mode 100644 d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph_org.svg
 delete mode 100644 d5/d91/namespacesorting_a5f4bc75cca6dd8294af2d0e328006c68_cgraph.map
 delete mode 100644 d5/d91/namespacesorting_a5f4bc75cca6dd8294af2d0e328006c68_cgraph.md5
 delete mode 100644 d5/d91/namespacesorting_a5f4bc75cca6dd8294af2d0e328006c68_cgraph.svg
 delete mode 100644 d5/d91/namespacesorting_a5f4bc75cca6dd8294af2d0e328006c68_cgraph_org.svg
 delete mode 100644 d5/d91/namespacesorting_a6eb67c2f91c98cf4464f75b5882022de_cgraph.map
 delete mode 100644 d5/d91/namespacesorting_a6eb67c2f91c98cf4464f75b5882022de_cgraph.md5
 delete mode 100644 d5/d91/namespacesorting_a6eb67c2f91c98cf4464f75b5882022de_cgraph.svg
 delete mode 100644 d5/d91/namespacesorting_a6eb67c2f91c98cf4464f75b5882022de_cgraph_org.svg
 delete mode 100644 d5/d91/namespacesorting_a7bfe11bd4703eacd1dab93f25ec639c5_cgraph.map
 delete mode 100644 d5/d91/namespacesorting_a7bfe11bd4703eacd1dab93f25ec639c5_cgraph.md5
 delete mode 100644 d5/d91/namespacesorting_a7bfe11bd4703eacd1dab93f25ec639c5_cgraph.svg
 delete mode 100644 d5/d91/namespacesorting_a7bfe11bd4703eacd1dab93f25ec639c5_cgraph_org.svg
 delete mode 100644 d5/d91/namespacesorting_a8fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph.map
 delete mode 100644 d5/d91/namespacesorting_a8fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph.md5
 delete mode 100644 d5/d91/namespacesorting_a8fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph.svg
 delete mode 100644 d5/d91/namespacesorting_a8fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph_org.svg
 delete mode 100644 d5/d91/namespacesorting_a9f59fe72dacc1f1218ef3c303d843168_cgraph.map
 delete mode 100644 d5/d91/namespacesorting_a9f59fe72dacc1f1218ef3c303d843168_cgraph.md5
 delete mode 100644 d5/d91/namespacesorting_a9f59fe72dacc1f1218ef3c303d843168_cgraph.svg
 delete mode 100644 d5/d91/namespacesorting_a9f59fe72dacc1f1218ef3c303d843168_cgraph_org.svg
 delete mode 100644 d5/d91/namespacesorting_aa26de383227859210f14dcf12201a079_cgraph.map
 delete mode 100644 d5/d91/namespacesorting_aa26de383227859210f14dcf12201a079_cgraph.md5
 delete mode 100644 d5/d91/namespacesorting_aa26de383227859210f14dcf12201a079_cgraph.svg
 delete mode 100644 d5/d91/namespacesorting_aa26de383227859210f14dcf12201a079_cgraph_org.svg
 delete mode 100644 d5/d91/namespacesorting_aa3677f87b5b4756bc77e9e34c5f27935_cgraph.map
 delete mode 100644 d5/d91/namespacesorting_aa3677f87b5b4756bc77e9e34c5f27935_cgraph.md5
 delete mode 100644 d5/d91/namespacesorting_aa3677f87b5b4756bc77e9e34c5f27935_cgraph.svg
 delete mode 100644 d5/d91/namespacesorting_aa3677f87b5b4756bc77e9e34c5f27935_cgraph_org.svg
 delete mode 100644 d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.map
 delete mode 100644 d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.md5
 delete mode 100644 d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.svg
 delete mode 100644 d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph_org.svg
 delete mode 100644 d5/d91/namespacesorting_ae3a775d99dbbb94c130a973df0cfddcf_cgraph.map
 delete mode 100644 d5/d91/namespacesorting_ae3a775d99dbbb94c130a973df0cfddcf_cgraph.md5
 delete mode 100644 d5/d91/namespacesorting_ae3a775d99dbbb94c130a973df0cfddcf_cgraph.svg
 delete mode 100644 d5/d91/namespacesorting_ae3a775d99dbbb94c130a973df0cfddcf_cgraph_org.svg
 delete mode 100644 d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.map
 delete mode 100644 d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.md5
 delete mode 100644 d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg
 delete mode 100644 d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph_org.svg
 delete mode 100644 d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.map
 delete mode 100644 d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5
 delete mode 100644 d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg
 delete mode 100644 d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph_org.svg
 delete mode 100644 d5/d91/namespacesorting_affc6ee160142cd017f8c4b213437d0fd_cgraph.map
 delete mode 100644 d5/d91/namespacesorting_affc6ee160142cd017f8c4b213437d0fd_cgraph.md5
 delete mode 100644 d5/d91/namespacesorting_affc6ee160142cd017f8c4b213437d0fd_cgraph.svg
 delete mode 100644 d5/d91/namespacesorting_affc6ee160142cd017f8c4b213437d0fd_cgraph_org.svg
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.map
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.md5
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.svg
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph_org.svg
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.map
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.md5
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.svg
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph_org.svg
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.map
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.md5
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.svg
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph_org.svg
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.map
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.md5
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.svg
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph_org.svg
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.map
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.md5
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.svg
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph_org.svg
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.map
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.md5
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.svg
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph_org.svg
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.map
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.md5
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.svg
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph_org.svg
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.map
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.md5
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.svg
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph_org.svg
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.map
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.md5
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.svg
 delete mode 100644 d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph_org.svg
 delete mode 100644 d5/d96/md5_8cpp_a5341431cef7fcfc33794326e1deb2425_cgraph.map
 delete mode 100644 d5/d96/md5_8cpp_a5341431cef7fcfc33794326e1deb2425_cgraph.md5
 delete mode 100644 d5/d96/md5_8cpp_a5341431cef7fcfc33794326e1deb2425_cgraph.svg
 delete mode 100644 d5/d96/md5_8cpp_a5341431cef7fcfc33794326e1deb2425_cgraph_org.svg
 delete mode 100644 d5/d96/md5_8cpp_a694712c9665051ba52b686387b87a689_cgraph.map
 delete mode 100644 d5/d96/md5_8cpp_a694712c9665051ba52b686387b87a689_cgraph.md5
 delete mode 100644 d5/d96/md5_8cpp_a694712c9665051ba52b686387b87a689_cgraph.svg
 delete mode 100644 d5/d96/md5_8cpp_a694712c9665051ba52b686387b87a689_cgraph_org.svg
 delete mode 100644 d5/d96/md5_8cpp_a6be48c1e6e742f9bd329f501d61dcaef_cgraph.map
 delete mode 100644 d5/d96/md5_8cpp_a6be48c1e6e742f9bd329f501d61dcaef_cgraph.md5
 delete mode 100644 d5/d96/md5_8cpp_a6be48c1e6e742f9bd329f501d61dcaef_cgraph.svg
 delete mode 100644 d5/d96/md5_8cpp_a6be48c1e6e742f9bd329f501d61dcaef_cgraph_org.svg
 delete mode 100644 d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph.map
 delete mode 100644 d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph.md5
 delete mode 100644 d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph.svg
 delete mode 100644 d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph_org.svg
 delete mode 100644 d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d5/d96/md5_8cpp_aaee69c6136a841043f956de32116e348_cgraph.map
 delete mode 100644 d5/d96/md5_8cpp_aaee69c6136a841043f956de32116e348_cgraph.md5
 delete mode 100644 d5/d96/md5_8cpp_aaee69c6136a841043f956de32116e348_cgraph.svg
 delete mode 100644 d5/d96/md5_8cpp_aaee69c6136a841043f956de32116e348_cgraph_org.svg
 delete mode 100644 d5/d96/md5_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.map
 delete mode 100644 d5/d96/md5_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.md5
 delete mode 100644 d5/d96/md5_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.svg
 delete mode 100644 d5/d96/md5_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph_org.svg
 delete mode 100644 d5/d96/md5_8cpp_add2bf982d5dd64a45d13cba52c2b371d_cgraph.map
 delete mode 100644 d5/d96/md5_8cpp_add2bf982d5dd64a45d13cba52c2b371d_cgraph.md5
 delete mode 100644 d5/d96/md5_8cpp_add2bf982d5dd64a45d13cba52c2b371d_cgraph.svg
 delete mode 100644 d5/d96/md5_8cpp_add2bf982d5dd64a45d13cba52c2b371d_cgraph_org.svg
 delete mode 100644 d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d5/d96/md5_8cpp_af8e96bde0183c4b0a7ff04668f11e446_cgraph.map
 delete mode 100644 d5/d96/md5_8cpp_af8e96bde0183c4b0a7ff04668f11e446_cgraph.md5
 delete mode 100644 d5/d96/md5_8cpp_af8e96bde0183c4b0a7ff04668f11e446_cgraph.svg
 delete mode 100644 d5/d96/md5_8cpp_af8e96bde0183c4b0a7ff04668f11e446_cgraph_org.svg
 create mode 100644 d5/d96/md5_8cpp_source.html
 delete mode 100644 d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph.map
 delete mode 100644 d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph.md5
 delete mode 100644 d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph.svg
 delete mode 100644 d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph_org.svg
 delete mode 100644 d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph.map
 delete mode 100644 d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph.md5
 delete mode 100644 d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph.svg
 delete mode 100644 d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph_org.svg
 delete mode 100644 d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.map
 delete mode 100644 d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.md5
 delete mode 100644 d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.svg
 delete mode 100644 d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph_org.svg
 delete mode 100644 d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
 delete mode 100644 d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
 delete mode 100644 d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
 delete mode 100644 d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
 delete mode 100644 d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.map
 delete mode 100644 d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.md5
 delete mode 100644 d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.svg
 delete mode 100644 d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph_org.svg
 delete mode 100644 d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.map
 delete mode 100644 d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.md5
 delete mode 100644 d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.svg
 delete mode 100644 d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph_org.svg
 create mode 100644 d5/db0/adaline__learning_8cpp_source.html
 delete mode 100644 d5/db5/set__kth__bit_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d5/db5/set__kth__bit_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d5/db5/set__kth__bit_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d5/db5/set__kth__bit_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d5/db5/set__kth__bit_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d5/db5/set__kth__bit_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d5/db5/set__kth__bit_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d5/db5/set__kth__bit_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d5/db5/set__kth__bit_8cpp_source.html
 create mode 100644 d5/dc5/morrisinorder_8cpp_source.html
 delete mode 100644 d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
 delete mode 100644 d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
 delete mode 100644 d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
 delete mode 100644 d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
 delete mode 100644 d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d5/ddb/bogo__sort_8cpp_source.html
 delete mode 100644 d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.map
 delete mode 100644 d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.md5
 delete mode 100644 d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.svg
 delete mode 100644 d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph_org.svg
 delete mode 100644 d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d5/def/stairs__pattern_8cpp_source.html
 create mode 100644 d5/df4/merge__sort_8cpp_source.html
 delete mode 100644 d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d5/df6/check__amicable__pair_8cpp_source.html
 create mode 100644 d6/d02/file__linter_8py_source.html
 delete mode 100644 d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph.map
 delete mode 100644 d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph.md5
 delete mode 100644 d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph.svg
 delete mode 100644 d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph_org.svg
 delete mode 100644 d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph.map
 delete mode 100644 d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph.md5
 delete mode 100644 d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph.svg
 delete mode 100644 d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph_org.svg
 delete mode 100644 d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph.map
 delete mode 100644 d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph.md5
 delete mode 100644 d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph.svg
 delete mode 100644 d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph_org.svg
 delete mode 100644 d6/d05/reverse__a__linked__list_8cpp_a7f80d9712cc7d77399dcacb4c2917511_cgraph.map
 delete mode 100644 d6/d05/reverse__a__linked__list_8cpp_a7f80d9712cc7d77399dcacb4c2917511_cgraph.md5
 delete mode 100644 d6/d05/reverse__a__linked__list_8cpp_a7f80d9712cc7d77399dcacb4c2917511_cgraph.svg
 delete mode 100644 d6/d05/reverse__a__linked__list_8cpp_a7f80d9712cc7d77399dcacb4c2917511_cgraph_org.svg
 delete mode 100644 d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d6/d05/reverse__a__linked__list_8cpp_source.html
 delete mode 100644 d6/d10/cut__rod_8cpp_a1cc523a30c18c63eac58220c3c494cfa_cgraph.map
 delete mode 100644 d6/d10/cut__rod_8cpp_a1cc523a30c18c63eac58220c3c494cfa_cgraph.md5
 delete mode 100644 d6/d10/cut__rod_8cpp_a1cc523a30c18c63eac58220c3c494cfa_cgraph.svg
 delete mode 100644 d6/d10/cut__rod_8cpp_a1cc523a30c18c63eac58220c3c494cfa_cgraph_org.svg
 delete mode 100644 d6/d10/cut__rod_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d6/d10/cut__rod_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d6/d10/cut__rod_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d6/d10/cut__rod_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d6/d10/cut__rod_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d6/d10/cut__rod_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d6/d10/cut__rod_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d6/d10/cut__rod_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d6/d10/cut__rod_8cpp_source.html
 delete mode 100644 d6/d1a/dnf__sort_8cpp_a621767fe711db64fe57a2ac4987b11f0_cgraph.map
 delete mode 100644 d6/d1a/dnf__sort_8cpp_a621767fe711db64fe57a2ac4987b11f0_cgraph.md5
 delete mode 100644 d6/d1a/dnf__sort_8cpp_a621767fe711db64fe57a2ac4987b11f0_cgraph.svg
 delete mode 100644 d6/d1a/dnf__sort_8cpp_a621767fe711db64fe57a2ac4987b11f0_cgraph_org.svg
 delete mode 100644 d6/d1a/dnf__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d6/d1a/dnf__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d6/d1a/dnf__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d6/d1a/dnf__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d6/d1a/dnf__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d6/d1a/dnf__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d6/d1a/dnf__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d6/d1a/dnf__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d6/d1a/dnf__sort_8cpp_source.html
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a2eb58750b978a93ac5e6eb29e3e570b7_cgraph.map
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a2eb58750b978a93ac5e6eb29e3e570b7_cgraph.md5
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a2eb58750b978a93ac5e6eb29e3e570b7_cgraph.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a2eb58750b978a93ac5e6eb29e3e570b7_cgraph_org.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a405b0a28d66a61239d3565d5256f9cb5_cgraph.map
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a405b0a28d66a61239d3565d5256f9cb5_cgraph.md5
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a405b0a28d66a61239d3565d5256f9cb5_cgraph.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a405b0a28d66a61239d3565d5256f9cb5_cgraph_org.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a427acfac1dbff3f48a2b071d449d965b_cgraph.map
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a427acfac1dbff3f48a2b071d449d965b_cgraph.md5
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a427acfac1dbff3f48a2b071d449d965b_cgraph.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a427acfac1dbff3f48a2b071d449d965b_cgraph_org.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a629be41c1ab78850963e4ce14e1d11d9_cgraph.map
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a629be41c1ab78850963e4ce14e1d11d9_cgraph.md5
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a629be41c1ab78850963e4ce14e1d11d9_cgraph.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a629be41c1ab78850963e4ce14e1d11d9_cgraph_org.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a642f70fb54cb50b00fb6df7c3f2b120e_cgraph.map
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a642f70fb54cb50b00fb6df7c3f2b120e_cgraph.md5
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a642f70fb54cb50b00fb6df7c3f2b120e_cgraph.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a642f70fb54cb50b00fb6df7c3f2b120e_cgraph_org.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph.map
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph.md5
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph_org.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph.map
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph.md5
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph_org.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_aa8bbb6e4a5749f6008b06602d5103917_cgraph.map
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_aa8bbb6e4a5749f6008b06602d5103917_cgraph.md5
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_aa8bbb6e4a5749f6008b06602d5103917_cgraph.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_aa8bbb6e4a5749f6008b06602d5103917_cgraph_org.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_ab02c7563889bf1e363deb8e21967b706_cgraph.map
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_ab02c7563889bf1e363deb8e21967b706_cgraph.md5
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_ab02c7563889bf1e363deb8e21967b706_cgraph.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_ab02c7563889bf1e363deb8e21967b706_cgraph_org.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_ad36cbcc7a458b3f3a2af0c4aa1126590_cgraph.map
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_ad36cbcc7a458b3f3a2af0c4aa1126590_cgraph.md5
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_ad36cbcc7a458b3f3a2af0c4aa1126590_cgraph.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_ad36cbcc7a458b3f3a2af0c4aa1126590_cgraph_org.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_ad667fa0860977f6d6d443fa1dbcd80aa_cgraph.map
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_ad667fa0860977f6d6d443fa1dbcd80aa_cgraph.md5
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_ad667fa0860977f6d6d443fa1dbcd80aa_cgraph.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_ad667fa0860977f6d6d443fa1dbcd80aa_cgraph_org.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_ae77cad522fa44b8c985779a7188d2f41_cgraph.map
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_ae77cad522fa44b8c985779a7188d2f41_cgraph.md5
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_ae77cad522fa44b8c985779a7188d2f41_cgraph.svg
 delete mode 100644 d6/d26/classciphers_1_1_hill_cipher_ae77cad522fa44b8c985779a7188d2f41_cgraph_org.svg
 delete mode 100644 d6/d26/house__robber_8cpp_a1e497c3e3f169afe5baaae6a5d40cbc8_cgraph.map
 delete mode 100644 d6/d26/house__robber_8cpp_a1e497c3e3f169afe5baaae6a5d40cbc8_cgraph.md5
 delete mode 100644 d6/d26/house__robber_8cpp_a1e497c3e3f169afe5baaae6a5d40cbc8_cgraph.svg
 delete mode 100644 d6/d26/house__robber_8cpp_a1e497c3e3f169afe5baaae6a5d40cbc8_cgraph_org.svg
 delete mode 100644 d6/d26/house__robber_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d6/d26/house__robber_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d6/d26/house__robber_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d6/d26/house__robber_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d6/d26/house__robber_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d6/d26/house__robber_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d6/d26/house__robber_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d6/d26/house__robber_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d6/d26/house__robber_8cpp_source.html
 delete mode 100644 d6/d2c/caesar__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
 delete mode 100644 d6/d2c/caesar__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
 delete mode 100644 d6/d2c/caesar__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
 delete mode 100644 d6/d2c/caesar__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
 delete mode 100644 d6/d2c/caesar__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d6/d2c/caesar__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d6/d2c/caesar__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d6/d2c/caesar__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d6/d2c/caesar__cipher_8cpp_source.html
 delete mode 100644 d6/d2d/modular__inverse__simple_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d6/d2d/modular__inverse__simple_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d6/d2d/modular__inverse__simple_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d6/d2d/modular__inverse__simple_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d6/d2d/modular__inverse__simple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d6/d2d/modular__inverse__simple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d6/d2d/modular__inverse__simple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d6/d2d/modular__inverse__simple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d6/d2d/modular__inverse__simple_8cpp_source.html
 delete mode 100644 d6/d2e/fenwick__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 d6/d2e/fenwick__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 d6/d2e/fenwick__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 d6/d2e/fenwick__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 d6/d2e/fenwick__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d6/d2e/fenwick__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d6/d2e/fenwick__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d6/d2e/fenwick__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d6/d2e/fenwick__tree_8cpp_source.html
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.map
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.md5
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.svg
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph_org.svg
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.map
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.md5
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.svg
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph_org.svg
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph.map
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph.md5
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph.svg
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph_org.svg
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.map
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.md5
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.svg
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph_org.svg
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.map
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.md5
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.svg
 delete mode 100644 d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph_org.svg
 delete mode 100644 d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d6/d38/find__non__repeating__number_8cpp_source.html
 delete mode 100644 d6/d42/miller__rabin_8cpp_a6f9c31c1047aa3191676d64571d4c506_cgraph.map
 delete mode 100644 d6/d42/miller__rabin_8cpp_a6f9c31c1047aa3191676d64571d4c506_cgraph.md5
 delete mode 100644 d6/d42/miller__rabin_8cpp_a6f9c31c1047aa3191676d64571d4c506_cgraph.svg
 delete mode 100644 d6/d42/miller__rabin_8cpp_a6f9c31c1047aa3191676d64571d4c506_cgraph_org.svg
 delete mode 100644 d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
 delete mode 100644 d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
 delete mode 100644 d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
 delete mode 100644 d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
 delete mode 100644 d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph.map
 delete mode 100644 d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph.md5
 delete mode 100644 d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph.svg
 delete mode 100644 d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph_org.svg
 delete mode 100644 d6/d42/miller__rabin_8cpp_ad6c2c67ea416d0e80003a88623f98b29_cgraph.map
 delete mode 100644 d6/d42/miller__rabin_8cpp_ad6c2c67ea416d0e80003a88623f98b29_cgraph.md5
 delete mode 100644 d6/d42/miller__rabin_8cpp_ad6c2c67ea416d0e80003a88623f98b29_cgraph.svg
 delete mode 100644 d6/d42/miller__rabin_8cpp_ad6c2c67ea416d0e80003a88623f98b29_cgraph_org.svg
 delete mode 100644 d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d6/d42/miller__rabin_8cpp_source.html
 delete mode 100644 d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d6/d4a/addition__rule_8cpp_source.html
 create mode 100644 d6/d4e/easter_8cpp_source.html
 delete mode 100644 d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d6/d57/array__right__rotation_8cpp_source.html
 delete mode 100644 d6/d60/group__ode_ga195d23bbdfcb80e83c9cda45c9ad5723_cgraph.map
 delete mode 100644 d6/d60/group__ode_ga195d23bbdfcb80e83c9cda45c9ad5723_cgraph.md5
 delete mode 100644 d6/d60/group__ode_ga195d23bbdfcb80e83c9cda45c9ad5723_cgraph.svg
 delete mode 100644 d6/d60/group__ode_ga195d23bbdfcb80e83c9cda45c9ad5723_cgraph_org.svg
 delete mode 100644 d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.map
 delete mode 100644 d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.md5
 delete mode 100644 d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.svg
 delete mode 100644 d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph_org.svg
 delete mode 100644 d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.map
 delete mode 100644 d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.md5
 delete mode 100644 d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.svg
 delete mode 100644 d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph_org.svg
 delete mode 100644 d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.map
 delete mode 100644 d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.md5
 delete mode 100644 d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.svg
 delete mode 100644 d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph_org.svg
 delete mode 100644 d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.map
 delete mode 100644 d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.md5
 delete mode 100644 d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.svg
 delete mode 100644 d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph_org.svg
 delete mode 100644 d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.map
 delete mode 100644 d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.md5
 delete mode 100644 d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.svg
 delete mode 100644 d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph_org.svg
 create mode 100644 d6/d74/library__sort_8cpp_source.html
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.map
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.md5
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.svg
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph_org.svg
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d6/d7a/golden__search__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d6/d7a/golden__search__extrema_8cpp_source.html
 delete mode 100644 d6/d80/double__hash__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d6/d80/double__hash__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d6/d80/double__hash__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d6/d80/double__hash__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d6/d80/double__hash__hash__table_8cpp_source.html
 delete mode 100644 d6/d84/classhashing_1_1sha256_1_1_hash_a0896c27ac39c780e0ee62417fdd0b9d3_cgraph.map
 delete mode 100644 d6/d84/classhashing_1_1sha256_1_1_hash_a0896c27ac39c780e0ee62417fdd0b9d3_cgraph.md5
 delete mode 100644 d6/d84/classhashing_1_1sha256_1_1_hash_a0896c27ac39c780e0ee62417fdd0b9d3_cgraph.svg
 delete mode 100644 d6/d84/classhashing_1_1sha256_1_1_hash_a0896c27ac39c780e0ee62417fdd0b9d3_cgraph_org.svg
 delete mode 100644 d6/d84/classhashing_1_1sha256_1_1_hash_a4581f503a263d8e928e5716d54477e08_cgraph.map
 delete mode 100644 d6/d84/classhashing_1_1sha256_1_1_hash_a4581f503a263d8e928e5716d54477e08_cgraph.md5
 delete mode 100644 d6/d84/classhashing_1_1sha256_1_1_hash_a4581f503a263d8e928e5716d54477e08_cgraph.svg
 delete mode 100644 d6/d84/classhashing_1_1sha256_1_1_hash_a4581f503a263d8e928e5716d54477e08_cgraph_org.svg
 delete mode 100644 d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
 delete mode 100644 d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
 delete mode 100644 d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
 delete mode 100644 d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
 delete mode 100644 d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.map
 delete mode 100644 d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.md5
 delete mode 100644 d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.svg
 delete mode 100644 d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph_org.svg
 delete mode 100644 d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.map
 delete mode 100644 d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.md5
 delete mode 100644 d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.svg
 delete mode 100644 d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph_org.svg
 create mode 100644 d6/d9d/large__factorial_8cpp_source.html
 create mode 100644 d6/da9/odd__even__sort_8cpp_source.html
 delete mode 100644 d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_a7dbf04bf7e1472c48639694f0b110602_cgraph.map
 delete mode 100644 d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_a7dbf04bf7e1472c48639694f0b110602_cgraph.md5
 delete mode 100644 d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_a7dbf04bf7e1472c48639694f0b110602_cgraph.svg
 delete mode 100644 d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_a7dbf04bf7e1472c48639694f0b110602_cgraph_org.svg
 delete mode 100644 d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_aad506b1c1a3cd5b93cc7e497626bfb53_cgraph.map
 delete mode 100644 d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_aad506b1c1a3cd5b93cc7e497626bfb53_cgraph.md5
 delete mode 100644 d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_aad506b1c1a3cd5b93cc7e497626bfb53_cgraph.svg
 delete mode 100644 d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_aad506b1c1a3cd5b93cc7e497626bfb53_cgraph_org.svg
 delete mode 100644 d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.map
 delete mode 100644 d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.md5
 delete mode 100644 d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.svg
 delete mode 100644 d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph_org.svg
 delete mode 100644 d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.map
 delete mode 100644 d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.md5
 delete mode 100644 d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.svg
 delete mode 100644 d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph_org.svg
 delete mode 100644 d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.map
 delete mode 100644 d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.md5
 delete mode 100644 d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.svg
 delete mode 100644 d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph_org.svg
 create mode 100644 d6/db0/binomial__dist_8cpp_source.html
 delete mode 100644 d6/db8/inv__sqrt_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d6/db8/inv__sqrt_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d6/db8/inv__sqrt_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d6/db8/inv__sqrt_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d6/db8/inv__sqrt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d6/db8/inv__sqrt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d6/db8/inv__sqrt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d6/db8/inv__sqrt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d6/db8/inv__sqrt_8cpp_source.html
 delete mode 100644 d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d6/dba/jump__game_8cpp_source.html
 create mode 100644 d6/dce/rabin__karp_8cpp_source.html
 delete mode 100644 d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
 delete mode 100644 d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
 delete mode 100644 d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
 delete mode 100644 d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
 delete mode 100644 d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map
 delete mode 100644 d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5
 delete mode 100644 d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg
 delete mode 100644 d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph_org.svg
 delete mode 100644 d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map
 delete mode 100644 d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5
 delete mode 100644 d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg
 delete mode 100644 d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph_org.svg
 create mode 100644 d6/dd3/ode__midpoint__euler_8cpp_source.html
 delete mode 100644 d6/dd8/is__graph__bipartite_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d6/dd8/is__graph__bipartite_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d6/dd8/is__graph__bipartite_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d6/dd8/is__graph__bipartite_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d6/dd8/is__graph__bipartite_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d6/dd8/is__graph__bipartite_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d6/dd8/is__graph__bipartite_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d6/dd8/is__graph__bipartite_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d6/dd8/is__graph__bipartite_8cpp_source.html
 delete mode 100644 d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d7/d00/list__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d7/d00/list__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d7/d00/list__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d7/d00/list__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d7/d00/list__array_8cpp_source.html
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph.map
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph.md5
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph.svg
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph_org.svg
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph.map
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph.md5
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph.svg
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph_org.svg
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph.map
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph.md5
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph.svg
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph_org.svg
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d7/d07/bidirectional__dijkstra_8cpp_source.html
 delete mode 100644 d7/d24/nqueen__print__all__solutions_8cpp_aebd5e11fab6dab282efccfb61beb0bd9_cgraph.map
 delete mode 100644 d7/d24/nqueen__print__all__solutions_8cpp_aebd5e11fab6dab282efccfb61beb0bd9_cgraph.md5
 delete mode 100644 d7/d24/nqueen__print__all__solutions_8cpp_aebd5e11fab6dab282efccfb61beb0bd9_cgraph.svg
 delete mode 100644 d7/d24/nqueen__print__all__solutions_8cpp_aebd5e11fab6dab282efccfb61beb0bd9_cgraph_org.svg
 create mode 100644 d7/d24/nqueen__print__all__solutions_8cpp_source.html
 delete mode 100644 d7/d35/matrix__exponentiation_8cpp_a702a9fc90e79b05b863cc4efa26ae2ec_cgraph.map
 delete mode 100644 d7/d35/matrix__exponentiation_8cpp_a702a9fc90e79b05b863cc4efa26ae2ec_cgraph.md5
 delete mode 100644 d7/d35/matrix__exponentiation_8cpp_a702a9fc90e79b05b863cc4efa26ae2ec_cgraph.svg
 delete mode 100644 d7/d35/matrix__exponentiation_8cpp_a702a9fc90e79b05b863cc4efa26ae2ec_cgraph_org.svg
 delete mode 100644 d7/d35/matrix__exponentiation_8cpp_ad8389ed58fd0ec66df248014775ad1fa_cgraph.map
 delete mode 100644 d7/d35/matrix__exponentiation_8cpp_ad8389ed58fd0ec66df248014775ad1fa_cgraph.md5
 delete mode 100644 d7/d35/matrix__exponentiation_8cpp_ad8389ed58fd0ec66df248014775ad1fa_cgraph.svg
 delete mode 100644 d7/d35/matrix__exponentiation_8cpp_ad8389ed58fd0ec66df248014775ad1fa_cgraph_org.svg
 create mode 100644 d7/d35/matrix__exponentiation_8cpp_source.html
 create mode 100644 d7/d37/magic__sequence_8cpp_source.html
 create mode 100644 d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html
 create mode 100644 d7/d43/stack__using__queue_8cpp_source.html
 delete mode 100644 d7/d56/count__bits__flip_8cpp_a2548486b6c3b80101e768562e687ef7b_cgraph.map
 delete mode 100644 d7/d56/count__bits__flip_8cpp_a2548486b6c3b80101e768562e687ef7b_cgraph.md5
 delete mode 100644 d7/d56/count__bits__flip_8cpp_a2548486b6c3b80101e768562e687ef7b_cgraph.svg
 delete mode 100644 d7/d56/count__bits__flip_8cpp_a2548486b6c3b80101e768562e687ef7b_cgraph_org.svg
 delete mode 100644 d7/d56/count__bits__flip_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d7/d56/count__bits__flip_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d7/d56/count__bits__flip_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d7/d56/count__bits__flip_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d7/d56/count__bits__flip_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d7/d56/count__bits__flip_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d7/d56/count__bits__flip_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d7/d56/count__bits__flip_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d7/d56/count__bits__flip_8cpp_source.html
 delete mode 100644 d7/d57/longest__increasing__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d7/d57/longest__increasing__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d7/d57/longest__increasing__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d7/d57/longest__increasing__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d7/d57/longest__increasing__subsequence_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map
 delete mode 100644 d7/d57/longest__increasing__subsequence_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
 delete mode 100644 d7/d57/longest__increasing__subsequence_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
 delete mode 100644 d7/d57/longest__increasing__subsequence_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg
 create mode 100644 d7/d57/longest__increasing__subsequence_8cpp_source.html
 delete mode 100644 d7/d65/shortest__common__supersequence_8cpp_ad2ee8d7e67da9f6eb85146b08dad95e6_cgraph.map
 delete mode 100644 d7/d65/shortest__common__supersequence_8cpp_ad2ee8d7e67da9f6eb85146b08dad95e6_cgraph.md5
 delete mode 100644 d7/d65/shortest__common__supersequence_8cpp_ad2ee8d7e67da9f6eb85146b08dad95e6_cgraph.svg
 delete mode 100644 d7/d65/shortest__common__supersequence_8cpp_ad2ee8d7e67da9f6eb85146b08dad95e6_cgraph_org.svg
 delete mode 100644 d7/d65/shortest__common__supersequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d7/d65/shortest__common__supersequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d7/d65/shortest__common__supersequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d7/d65/shortest__common__supersequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d7/d65/shortest__common__supersequence_8cpp_source.html
 delete mode 100644 d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map
 delete mode 100644 d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5
 delete mode 100644 d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg
 delete mode 100644 d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph_org.svg
 delete mode 100644 d7/d6a/bisection__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d7/d6a/bisection__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d7/d6a/bisection__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d7/d6a/bisection__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d7/d6a/bisection__method_8cpp_source.html
 delete mode 100644 d7/d73/abbreviation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d7/d73/abbreviation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d7/d73/abbreviation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d7/d73/abbreviation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d7/d73/abbreviation_8cpp_add60b8858720bf217df22d992d0fefaa_cgraph.map
 delete mode 100644 d7/d73/abbreviation_8cpp_add60b8858720bf217df22d992d0fefaa_cgraph.md5
 delete mode 100644 d7/d73/abbreviation_8cpp_add60b8858720bf217df22d992d0fefaa_cgraph.svg
 delete mode 100644 d7/d73/abbreviation_8cpp_add60b8858720bf217df22d992d0fefaa_cgraph_org.svg
 delete mode 100644 d7/d73/abbreviation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d7/d73/abbreviation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d7/d73/abbreviation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d7/d73/abbreviation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d7/d73/abbreviation_8cpp_af53b2f647bee9c5b75ef8dd9ef685dc8_cgraph.map
 delete mode 100644 d7/d73/abbreviation_8cpp_af53b2f647bee9c5b75ef8dd9ef685dc8_cgraph.md5
 delete mode 100644 d7/d73/abbreviation_8cpp_af53b2f647bee9c5b75ef8dd9ef685dc8_cgraph.svg
 delete mode 100644 d7/d73/abbreviation_8cpp_af53b2f647bee9c5b75ef8dd9ef685dc8_cgraph_org.svg
 create mode 100644 d7/d73/abbreviation_8cpp_source.html
 delete mode 100644 d7/d75/postfix__evaluation_8cpp_a4c27f949c9d6659be9f5bd2ccbe1360a_cgraph.map
 delete mode 100644 d7/d75/postfix__evaluation_8cpp_a4c27f949c9d6659be9f5bd2ccbe1360a_cgraph.md5
 delete mode 100644 d7/d75/postfix__evaluation_8cpp_a4c27f949c9d6659be9f5bd2ccbe1360a_cgraph.svg
 delete mode 100644 d7/d75/postfix__evaluation_8cpp_a4c27f949c9d6659be9f5bd2ccbe1360a_cgraph_org.svg
 delete mode 100644 d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.map
 delete mode 100644 d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.md5
 delete mode 100644 d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.svg
 delete mode 100644 d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph_org.svg
 delete mode 100644 d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.map
 delete mode 100644 d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.md5
 delete mode 100644 d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.svg
 delete mode 100644 d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph_org.svg
 delete mode 100644 d7/d75/postfix__evaluation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d7/d75/postfix__evaluation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d7/d75/postfix__evaluation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d7/d75/postfix__evaluation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d7/d75/postfix__evaluation_8cpp_source.html
 delete mode 100644 d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.map
 delete mode 100644 d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.md5
 delete mode 100644 d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.svg
 delete mode 100644 d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph_org.svg
 delete mode 100644 d7/d83/trie__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d7/d83/trie__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d7/d83/trie__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d7/d83/trie__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d7/d83/trie__tree_8cpp_source.html
 create mode 100644 d7/d85/doubly__linked__list_8cpp_source.html
 delete mode 100644 d7/d89/double__factorial_8cpp_a68ba20fed2ce427f6469c7689437829d_cgraph.map
 delete mode 100644 d7/d89/double__factorial_8cpp_a68ba20fed2ce427f6469c7689437829d_cgraph.md5
 delete mode 100644 d7/d89/double__factorial_8cpp_a68ba20fed2ce427f6469c7689437829d_cgraph.svg
 delete mode 100644 d7/d89/double__factorial_8cpp_a68ba20fed2ce427f6469c7689437829d_cgraph_org.svg
 delete mode 100644 d7/d89/double__factorial_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
 delete mode 100644 d7/d89/double__factorial_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
 delete mode 100644 d7/d89/double__factorial_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
 delete mode 100644 d7/d89/double__factorial_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
 delete mode 100644 d7/d89/double__factorial_8cpp_abbbcebf3a2d0c67f4c3cfb5511a97981_cgraph.map
 delete mode 100644 d7/d89/double__factorial_8cpp_abbbcebf3a2d0c67f4c3cfb5511a97981_cgraph.md5
 delete mode 100644 d7/d89/double__factorial_8cpp_abbbcebf3a2d0c67f4c3cfb5511a97981_cgraph.svg
 delete mode 100644 d7/d89/double__factorial_8cpp_abbbcebf3a2d0c67f4c3cfb5511a97981_cgraph_org.svg
 delete mode 100644 d7/d89/double__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d7/d89/double__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d7/d89/double__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d7/d89/double__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d7/d89/double__factorial_8cpp_source.html
 delete mode 100644 d7/da6/eratosthenes_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
 delete mode 100644 d7/da6/eratosthenes_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
 delete mode 100644 d7/da6/eratosthenes_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
 delete mode 100644 d7/da6/eratosthenes_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
 delete mode 100644 d7/da6/eratosthenes_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d7/da6/eratosthenes_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d7/da6/eratosthenes_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d7/da6/eratosthenes_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 create mode 100644 d7/da6/eratosthenes_8cpp_source.html
 create mode 100644 d7/dab/get__size__of__linked__list_8cpp_source.html
 delete mode 100644 d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph.map
 delete mode 100644 d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph.md5
 delete mode 100644 d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph.svg
 delete mode 100644 d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph_org.svg
 delete mode 100644 d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph.map
 delete mode 100644 d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph.md5
 delete mode 100644 d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph.svg
 delete mode 100644 d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph_org.svg
 delete mode 100644 d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.map
 delete mode 100644 d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.md5
 delete mode 100644 d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.svg
 delete mode 100644 d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph_org.svg
 delete mode 100644 d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d7/db9/hill__cipher_8cpp_source.html
 delete mode 100644 d7/def/trie__multiple__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d7/def/trie__multiple__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d7/def/trie__multiple__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d7/def/trie__multiple__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d7/def/trie__multiple__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map
 delete mode 100644 d7/def/trie__multiple__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
 delete mode 100644 d7/def/trie__multiple__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
 delete mode 100644 d7/def/trie__multiple__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg
 create mode 100644 d7/def/trie__multiple__search_8cpp_source.html
 delete mode 100644 d8/d13/bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d8/d13/bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d8/d13/bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d8/d13/bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d8/d13/bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d8/d13/bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d8/d13/bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d8/d13/bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d8/d13/bubble__sort_8cpp_af3b12930a83915712461d53fe9659686_cgraph.map
 delete mode 100644 d8/d13/bubble__sort_8cpp_af3b12930a83915712461d53fe9659686_cgraph.md5
 delete mode 100644 d8/d13/bubble__sort_8cpp_af3b12930a83915712461d53fe9659686_cgraph.svg
 delete mode 100644 d8/d13/bubble__sort_8cpp_af3b12930a83915712461d53fe9659686_cgraph_org.svg
 create mode 100644 d8/d13/bubble__sort_8cpp_source.html
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph.map
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph.md5
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph.svg
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph_org.svg
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.map
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.md5
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.svg
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph_org.svg
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_a24487eda25123bc4d112e8430821a6c6_cgraph.map
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_a24487eda25123bc4d112e8430821a6c6_cgraph.md5
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_a24487eda25123bc4d112e8430821a6c6_cgraph.svg
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_a24487eda25123bc4d112e8430821a6c6_cgraph_org.svg
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_a6d3f2465a7c5803a1ff16c5378bcc5e4_cgraph.map
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_a6d3f2465a7c5803a1ff16c5378bcc5e4_cgraph.md5
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_a6d3f2465a7c5803a1ff16c5378bcc5e4_cgraph.svg
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_a6d3f2465a7c5803a1ff16c5378bcc5e4_cgraph_org.svg
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_ac83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph.map
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_ac83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph.md5
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_ac83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph.svg
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_ac83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph_org.svg
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_ace7f57935b3bb9446f11c239fd89ae79_cgraph.map
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_ace7f57935b3bb9446f11c239fd89ae79_cgraph.md5
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_ace7f57935b3bb9446f11c239fd89ae79_cgraph.svg
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_ace7f57935b3bb9446f11c239fd89ae79_cgraph_org.svg
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.map
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.md5
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.svg
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph_org.svg
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.map
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.md5
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.svg
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph_org.svg
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.map
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.md5
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.svg
 delete mode 100644 d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph_org.svg
 delete mode 100644 d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph.map
 delete mode 100644 d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph.md5
 delete mode 100644 d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph.svg
 delete mode 100644 d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph_org.svg
 delete mode 100644 d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.map
 delete mode 100644 d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.md5
 delete mode 100644 d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.svg
 delete mode 100644 d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph_org.svg
 delete mode 100644 d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph.map
 delete mode 100644 d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph.md5
 delete mode 100644 d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph.svg
 delete mode 100644 d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph_org.svg
 create mode 100644 d8/d30/reverse__a__linked__list__using__recusion_8cpp_source.html
 delete mode 100644 d8/d41/namespacegames_1_1memory__game_a3ceeea62d8fa6c563e2c66359fd73413_cgraph.map
 delete mode 100644 d8/d41/namespacegames_1_1memory__game_a3ceeea62d8fa6c563e2c66359fd73413_cgraph.md5
 delete mode 100644 d8/d41/namespacegames_1_1memory__game_a3ceeea62d8fa6c563e2c66359fd73413_cgraph.svg
 delete mode 100644 d8/d41/namespacegames_1_1memory__game_a3ceeea62d8fa6c563e2c66359fd73413_cgraph_org.svg
 delete mode 100644 d8/d41/namespacegames_1_1memory__game_a5714d97649c0edd57b4fb449799676a3_cgraph.map
 delete mode 100644 d8/d41/namespacegames_1_1memory__game_a5714d97649c0edd57b4fb449799676a3_cgraph.md5
 delete mode 100644 d8/d41/namespacegames_1_1memory__game_a5714d97649c0edd57b4fb449799676a3_cgraph.svg
 delete mode 100644 d8/d41/namespacegames_1_1memory__game_a5714d97649c0edd57b4fb449799676a3_cgraph_org.svg
 delete mode 100644 d8/d41/namespacegames_1_1memory__game_ad573c8ae66ab66156d03e5e81bbba214_cgraph.map
 delete mode 100644 d8/d41/namespacegames_1_1memory__game_ad573c8ae66ab66156d03e5e81bbba214_cgraph.md5
 delete mode 100644 d8/d41/namespacegames_1_1memory__game_ad573c8ae66ab66156d03e5e81bbba214_cgraph.svg
 delete mode 100644 d8/d41/namespacegames_1_1memory__game_ad573c8ae66ab66156d03e5e81bbba214_cgraph_org.svg
 delete mode 100644 d8/d41/namespacegames_1_1memory__game_adc62ebb75853446656e24932bdc6dd6b_cgraph.map
 delete mode 100644 d8/d41/namespacegames_1_1memory__game_adc62ebb75853446656e24932bdc6dd6b_cgraph.md5
 delete mode 100644 d8/d41/namespacegames_1_1memory__game_adc62ebb75853446656e24932bdc6dd6b_cgraph.svg
 delete mode 100644 d8/d41/namespacegames_1_1memory__game_adc62ebb75853446656e24932bdc6dd6b_cgraph_org.svg
 delete mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_a1c62a87e79f29b98d8fe5b12eacdd928_cgraph.map
 delete mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_a1c62a87e79f29b98d8fe5b12eacdd928_cgraph.md5
 delete mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_a1c62a87e79f29b98d8fe5b12eacdd928_cgraph.svg
 delete mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_a1c62a87e79f29b98d8fe5b12eacdd928_cgraph_org.svg
 delete mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_aba4929409fee35c3cb559e962a544b3e_cgraph.map
 delete mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_aba4929409fee35c3cb559e962a544b3e_cgraph.md5
 delete mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_aba4929409fee35c3cb559e962a544b3e_cgraph.svg
 delete mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_aba4929409fee35c3cb559e962a544b3e_cgraph_org.svg
 delete mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae7e807e02c65c6fffd6162b4c66290c2_cgraph.map
 delete mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae7e807e02c65c6fffd6162b4c66290c2_cgraph.md5
 delete mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae7e807e02c65c6fffd6162b4c66290c2_cgraph.svg
 delete mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae7e807e02c65c6fffd6162b4c66290c2_cgraph_org.svg
 create mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html
 delete mode 100644 d8/d61/radix__sort2_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 d8/d61/radix__sort2_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 d8/d61/radix__sort2_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 d8/d61/radix__sort2_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 d8/d61/radix__sort2_8cpp_a98ead7d43b11505398daf9a894f122f9_cgraph.map
 delete mode 100644 d8/d61/radix__sort2_8cpp_a98ead7d43b11505398daf9a894f122f9_cgraph.md5
 delete mode 100644 d8/d61/radix__sort2_8cpp_a98ead7d43b11505398daf9a894f122f9_cgraph.svg
 delete mode 100644 d8/d61/radix__sort2_8cpp_a98ead7d43b11505398daf9a894f122f9_cgraph_org.svg
 delete mode 100644 d8/d61/radix__sort2_8cpp_ae0cfd94fa3765b53d4ec7893ffaee5f8_cgraph.map
 delete mode 100644 d8/d61/radix__sort2_8cpp_ae0cfd94fa3765b53d4ec7893ffaee5f8_cgraph.md5
 delete mode 100644 d8/d61/radix__sort2_8cpp_ae0cfd94fa3765b53d4ec7893ffaee5f8_cgraph.svg
 delete mode 100644 d8/d61/radix__sort2_8cpp_ae0cfd94fa3765b53d4ec7893ffaee5f8_cgraph_org.svg
 delete mode 100644 d8/d61/radix__sort2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d8/d61/radix__sort2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d8/d61/radix__sort2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d8/d61/radix__sort2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d8/d61/radix__sort2_8cpp_source.html
 delete mode 100644 d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
 delete mode 100644 d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
 delete mode 100644 d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
 delete mode 100644 d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
 delete mode 100644 d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d8/d68/dijkstra_8cpp_source.html
 delete mode 100644 d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.map
 delete mode 100644 d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.md5
 delete mode 100644 d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.svg
 delete mode 100644 d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph_org.svg
 delete mode 100644 d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.map
 delete mode 100644 d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.md5
 delete mode 100644 d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.svg
 delete mode 100644 d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph_org.svg
 delete mode 100644 d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.map
 delete mode 100644 d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.md5
 delete mode 100644 d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.svg
 delete mode 100644 d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph_org.svg
 delete mode 100644 d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.map
 delete mode 100644 d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.md5
 delete mode 100644 d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.svg
 delete mode 100644 d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph_org.svg
 delete mode 100644 d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d8/d6c/line__segment__intersection_8cpp_source.html
 delete mode 100644 d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.map
 delete mode 100644 d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.md5
 delete mode 100644 d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.svg
 delete mode 100644 d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph_org.svg
 delete mode 100644 d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.map
 delete mode 100644 d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.md5
 delete mode 100644 d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.svg
 delete mode 100644 d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph_org.svg
 delete mode 100644 d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.map
 delete mode 100644 d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.md5
 delete mode 100644 d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.svg
 delete mode 100644 d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph_org.svg
 delete mode 100644 d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.map
 delete mode 100644 d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.md5
 delete mode 100644 d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.svg
 delete mode 100644 d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph_org.svg
 delete mode 100644 d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d8/d76/morse__code_8cpp_source.html
 delete mode 100644 d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.map
 delete mode 100644 d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.md5
 delete mode 100644 d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.svg
 delete mode 100644 d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph_org.svg
 delete mode 100644 d8/d77/namespacemachine__learning_a0cc29566568e0383dd7d374068cbe6b3_cgraph.map
 delete mode 100644 d8/d77/namespacemachine__learning_a0cc29566568e0383dd7d374068cbe6b3_cgraph.md5
 delete mode 100644 d8/d77/namespacemachine__learning_a0cc29566568e0383dd7d374068cbe6b3_cgraph.svg
 delete mode 100644 d8/d77/namespacemachine__learning_a0cc29566568e0383dd7d374068cbe6b3_cgraph_org.svg
 delete mode 100644 d8/d77/namespacemachine__learning_a2466857dab977a49f117029835b3b6d2_cgraph.map
 delete mode 100644 d8/d77/namespacemachine__learning_a2466857dab977a49f117029835b3b6d2_cgraph.md5
 delete mode 100644 d8/d77/namespacemachine__learning_a2466857dab977a49f117029835b3b6d2_cgraph.svg
 delete mode 100644 d8/d77/namespacemachine__learning_a2466857dab977a49f117029835b3b6d2_cgraph_org.svg
 delete mode 100644 d8/d77/namespacemachine__learning_a50480fccfb39de20ca47f1bf51ecb6ec_cgraph.map
 delete mode 100644 d8/d77/namespacemachine__learning_a50480fccfb39de20ca47f1bf51ecb6ec_cgraph.md5
 delete mode 100644 d8/d77/namespacemachine__learning_a50480fccfb39de20ca47f1bf51ecb6ec_cgraph.svg
 delete mode 100644 d8/d77/namespacemachine__learning_a50480fccfb39de20ca47f1bf51ecb6ec_cgraph_org.svg
 delete mode 100644 d8/d77/namespacemachine__learning_a5342906d42b80fc6b6b3ad17bf00fcb9_cgraph.map
 delete mode 100644 d8/d77/namespacemachine__learning_a5342906d42b80fc6b6b3ad17bf00fcb9_cgraph.md5
 delete mode 100644 d8/d77/namespacemachine__learning_a5342906d42b80fc6b6b3ad17bf00fcb9_cgraph.svg
 delete mode 100644 d8/d77/namespacemachine__learning_a5342906d42b80fc6b6b3ad17bf00fcb9_cgraph_org.svg
 delete mode 100644 d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.map
 delete mode 100644 d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.md5
 delete mode 100644 d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.svg
 delete mode 100644 d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph_org.svg
 delete mode 100644 d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.map
 delete mode 100644 d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.md5
 delete mode 100644 d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.svg
 delete mode 100644 d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph_org.svg
 delete mode 100644 d8/d77/namespacemachine__learning_a89fde571b38f9483576594f66572958a_cgraph.map
 delete mode 100644 d8/d77/namespacemachine__learning_a89fde571b38f9483576594f66572958a_cgraph.md5
 delete mode 100644 d8/d77/namespacemachine__learning_a89fde571b38f9483576594f66572958a_cgraph.svg
 delete mode 100644 d8/d77/namespacemachine__learning_a89fde571b38f9483576594f66572958a_cgraph_org.svg
 delete mode 100644 d8/d77/namespacemachine__learning_aa4bbf61e65f8cd297255fa94b983d078_cgraph.map
 delete mode 100644 d8/d77/namespacemachine__learning_aa4bbf61e65f8cd297255fa94b983d078_cgraph.md5
 delete mode 100644 d8/d77/namespacemachine__learning_aa4bbf61e65f8cd297255fa94b983d078_cgraph.svg
 delete mode 100644 d8/d77/namespacemachine__learning_aa4bbf61e65f8cd297255fa94b983d078_cgraph_org.svg
 delete mode 100644 d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph.map
 delete mode 100644 d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph.md5
 delete mode 100644 d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph.svg
 delete mode 100644 d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph_org.svg
 delete mode 100644 d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.map
 delete mode 100644 d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.md5
 delete mode 100644 d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.svg
 delete mode 100644 d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph_org.svg
 delete mode 100644 d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph.map
 delete mode 100644 d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph.md5
 delete mode 100644 d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph.svg
 delete mode 100644 d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph_org.svg
 delete mode 100644 d8/d77/namespacemachine__learning_ac332d152078e96311e43ac5e7183ea26_cgraph.map
 delete mode 100644 d8/d77/namespacemachine__learning_ac332d152078e96311e43ac5e7183ea26_cgraph.md5
 delete mode 100644 d8/d77/namespacemachine__learning_ac332d152078e96311e43ac5e7183ea26_cgraph.svg
 delete mode 100644 d8/d77/namespacemachine__learning_ac332d152078e96311e43ac5e7183ea26_cgraph_org.svg
 delete mode 100644 d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.map
 delete mode 100644 d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.md5
 delete mode 100644 d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.svg
 delete mode 100644 d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph_org.svg
 delete mode 100644 d8/d77/namespacemachine__learning_acafa3e62b686aebdbad81c4f89913f43_cgraph.map
 delete mode 100644 d8/d77/namespacemachine__learning_acafa3e62b686aebdbad81c4f89913f43_cgraph.md5
 delete mode 100644 d8/d77/namespacemachine__learning_acafa3e62b686aebdbad81c4f89913f43_cgraph.svg
 delete mode 100644 d8/d77/namespacemachine__learning_acafa3e62b686aebdbad81c4f89913f43_cgraph_org.svg
 delete mode 100644 d8/d77/namespacemachine__learning_ae868ad43698a1d69ba46ea3827d7d2c3_cgraph.map
 delete mode 100644 d8/d77/namespacemachine__learning_ae868ad43698a1d69ba46ea3827d7d2c3_cgraph.md5
 delete mode 100644 d8/d77/namespacemachine__learning_ae868ad43698a1d69ba46ea3827d7d2c3_cgraph.svg
 delete mode 100644 d8/d77/namespacemachine__learning_ae868ad43698a1d69ba46ea3827d7d2c3_cgraph_org.svg
 delete mode 100644 d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.map
 delete mode 100644 d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.md5
 delete mode 100644 d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.svg
 delete mode 100644 d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph_org.svg
 delete mode 100644 d8/d77/namespacemachine__learning_af801bf30591ca6b2c38ff4fed0ded23f_cgraph.map
 delete mode 100644 d8/d77/namespacemachine__learning_af801bf30591ca6b2c38ff4fed0ded23f_cgraph.md5
 delete mode 100644 d8/d77/namespacemachine__learning_af801bf30591ca6b2c38ff4fed0ded23f_cgraph.svg
 delete mode 100644 d8/d77/namespacemachine__learning_af801bf30591ca6b2c38ff4fed0ded23f_cgraph_org.svg
 delete mode 100644 d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.map
 delete mode 100644 d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.md5
 delete mode 100644 d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.svg
 delete mode 100644 d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph_org.svg
 delete mode 100644 d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.map
 delete mode 100644 d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.md5
 delete mode 100644 d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.svg
 delete mode 100644 d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph_org.svg
 delete mode 100644 d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.map
 delete mode 100644 d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.md5
 delete mode 100644 d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.svg
 delete mode 100644 d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph_org.svg
 delete mode 100644 d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d8/d7a/sha1_8cpp_source.html
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.map
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.md5
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.svg
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph_org.svg
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.map
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.md5
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.svg
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph_org.svg
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.map
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.md5
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.svg
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph_org.svg
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.map
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.md5
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.svg
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph_org.svg
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.map
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.md5
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.svg
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph_org.svg
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.map
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.md5
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.svg
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph_org.svg
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.map
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.md5
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.svg
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph_org.svg
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.map
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.md5
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.svg
 delete mode 100644 d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph_org.svg
 create mode 100644 d8/d7c/radix__sort_8cpp_source.html
 delete mode 100644 d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html
 delete mode 100644 d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph.map
 delete mode 100644 d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph.md5
 delete mode 100644 d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph.svg
 delete mode 100644 d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph_org.svg
 delete mode 100644 d8/d89/namespacelinear__probing_a16d34fd3511626a83ab00665d7bc34d1_cgraph.map
 delete mode 100644 d8/d89/namespacelinear__probing_a16d34fd3511626a83ab00665d7bc34d1_cgraph.md5
 delete mode 100644 d8/d89/namespacelinear__probing_a16d34fd3511626a83ab00665d7bc34d1_cgraph.svg
 delete mode 100644 d8/d89/namespacelinear__probing_a16d34fd3511626a83ab00665d7bc34d1_cgraph_org.svg
 delete mode 100644 d8/d89/namespacelinear__probing_a6322209aaa91b7bbf16f96e1cc52b746_cgraph.map
 delete mode 100644 d8/d89/namespacelinear__probing_a6322209aaa91b7bbf16f96e1cc52b746_cgraph.md5
 delete mode 100644 d8/d89/namespacelinear__probing_a6322209aaa91b7bbf16f96e1cc52b746_cgraph.svg
 delete mode 100644 d8/d89/namespacelinear__probing_a6322209aaa91b7bbf16f96e1cc52b746_cgraph_org.svg
 delete mode 100644 d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph.map
 delete mode 100644 d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph.md5
 delete mode 100644 d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph.svg
 delete mode 100644 d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph_org.svg
 delete mode 100644 d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph.map
 delete mode 100644 d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph.md5
 delete mode 100644 d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph.svg
 delete mode 100644 d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph_org.svg
 delete mode 100644 d8/d89/namespacelinear__probing_abcf8d033f8115f39f3c93cfb6cee0b28_cgraph.map
 delete mode 100644 d8/d89/namespacelinear__probing_abcf8d033f8115f39f3c93cfb6cee0b28_cgraph.md5
 delete mode 100644 d8/d89/namespacelinear__probing_abcf8d033f8115f39f3c93cfb6cee0b28_cgraph.svg
 delete mode 100644 d8/d89/namespacelinear__probing_abcf8d033f8115f39f3c93cfb6cee0b28_cgraph_org.svg
 delete mode 100644 d8/d89/namespacelinear__probing_ad87b71d810901fab69c4ad9d4d0fa635_cgraph.map
 delete mode 100644 d8/d89/namespacelinear__probing_ad87b71d810901fab69c4ad9d4d0fa635_cgraph.md5
 delete mode 100644 d8/d89/namespacelinear__probing_ad87b71d810901fab69c4ad9d4d0fa635_cgraph.svg
 delete mode 100644 d8/d89/namespacelinear__probing_ad87b71d810901fab69c4ad9d4d0fa635_cgraph_org.svg
 delete mode 100644 d8/d8a/exponential__search_8cpp_ab06cedad209456eae95d37b7cd66acae_cgraph.map
 delete mode 100644 d8/d8a/exponential__search_8cpp_ab06cedad209456eae95d37b7cd66acae_cgraph.md5
 delete mode 100644 d8/d8a/exponential__search_8cpp_ab06cedad209456eae95d37b7cd66acae_cgraph.svg
 delete mode 100644 d8/d8a/exponential__search_8cpp_ab06cedad209456eae95d37b7cd66acae_cgraph_org.svg
 delete mode 100644 d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.map
 delete mode 100644 d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.md5
 delete mode 100644 d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.svg
 delete mode 100644 d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph_org.svg
 create mode 100644 d8/d8a/exponential__search_8cpp_source.html
 create mode 100644 d8/d8f/bitonic__sort_8cpp_source.html
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.map
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.md5
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.svg
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph_org.svg
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.map
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.md5
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.svg
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph_org.svg
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.map
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.md5
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.svg
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph_org.svg
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.map
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.md5
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.svg
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph_org.svg
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.map
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.md5
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.svg
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph_org.svg
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_af727f920064f2b8f484b589b60d49b89_cgraph.map
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_af727f920064f2b8f484b589b60d49b89_cgraph.md5
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_af727f920064f2b8f484b589b60d49b89_cgraph.svg
 delete mode 100644 d8/d90/iterative__tree__traversals_8cpp_af727f920064f2b8f484b589b60d49b89_cgraph_org.svg
 create mode 100644 d8/d90/iterative__tree__traversals_8cpp_source.html
 create mode 100644 d8/d96/stack__using__array_8cpp_source.html
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_a469384d8a4197a9b24482ce7c321a85e_cgraph.map
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_a469384d8a4197a9b24482ce7c321a85e_cgraph.md5
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_a469384d8a4197a9b24482ce7c321a85e_cgraph.svg
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_a469384d8a4197a9b24482ce7c321a85e_cgraph_org.svg
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_a67cb7472f310a798f555fe45cdf50145_cgraph.map
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_a67cb7472f310a798f555fe45cdf50145_cgraph.md5
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_a67cb7472f310a798f555fe45cdf50145_cgraph.svg
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_a67cb7472f310a798f555fe45cdf50145_cgraph_org.svg
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_ac2d6698b71384a352ec4b81b31b13141_cgraph.map
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_ac2d6698b71384a352ec4b81b31b13141_cgraph.md5
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_ac2d6698b71384a352ec4b81b31b13141_cgraph.svg
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_ac2d6698b71384a352ec4b81b31b13141_cgraph_org.svg
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_ae91ed94113c56191b75fe45f688d6e62_cgraph.map
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_ae91ed94113c56191b75fe45f688d6e62_cgraph.md5
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_ae91ed94113c56191b75fe45f688d6e62_cgraph.svg
 delete mode 100644 d8/d99/connected__components__with__dsu_8cpp_ae91ed94113c56191b75fe45f688d6e62_cgraph_org.svg
 create mode 100644 d8/d99/connected__components__with__dsu_8cpp_source.html
 delete mode 100644 d8/d9a/fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d8/d9a/fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d8/d9a/fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d8/d9a/fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d8/d9a/fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map
 delete mode 100644 d8/d9a/fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
 delete mode 100644 d8/d9a/fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
 delete mode 100644 d8/d9a/fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg
 create mode 100644 d8/d9a/fast__fourier__transform_8cpp_source.html
 delete mode 100644 d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d8/d9c/union__of__two__arrays_8cpp_source.html
 delete mode 100644 d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.map
 delete mode 100644 d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.md5
 delete mode 100644 d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.svg
 delete mode 100644 d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph_org.svg
 delete mode 100644 d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
 delete mode 100644 d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
 delete mode 100644 d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
 delete mode 100644 d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
 delete mode 100644 d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 create mode 100644 d8/dab/sparse__table_8cpp_source.html
 delete mode 100644 d8/db1/binomial__calculate_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 d8/db1/binomial__calculate_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 d8/db1/binomial__calculate_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 d8/db1/binomial__calculate_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 d8/db1/binomial__calculate_8cpp_aae407a2a13362c4c64fbe509ff325978_cgraph.map
 delete mode 100644 d8/db1/binomial__calculate_8cpp_aae407a2a13362c4c64fbe509ff325978_cgraph.md5
 delete mode 100644 d8/db1/binomial__calculate_8cpp_aae407a2a13362c4c64fbe509ff325978_cgraph.svg
 delete mode 100644 d8/db1/binomial__calculate_8cpp_aae407a2a13362c4c64fbe509ff325978_cgraph_org.svg
 delete mode 100644 d8/db1/binomial__calculate_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.map
 delete mode 100644 d8/db1/binomial__calculate_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.md5
 delete mode 100644 d8/db1/binomial__calculate_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.svg
 delete mode 100644 d8/db1/binomial__calculate_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph_org.svg
 create mode 100644 d8/db1/binomial__calculate_8cpp_source.html
 create mode 100644 d8/db7/queue__using__linked__list_8cpp_source.html
 delete mode 100644 d8/db9/topological__sort_8cpp_a54dc5d7914958dbd24dda2fd862dc41b_cgraph.map
 delete mode 100644 d8/db9/topological__sort_8cpp_a54dc5d7914958dbd24dda2fd862dc41b_cgraph.md5
 delete mode 100644 d8/db9/topological__sort_8cpp_a54dc5d7914958dbd24dda2fd862dc41b_cgraph.svg
 delete mode 100644 d8/db9/topological__sort_8cpp_a54dc5d7914958dbd24dda2fd862dc41b_cgraph_org.svg
 delete mode 100644 d8/db9/topological__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d8/db9/topological__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d8/db9/topological__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d8/db9/topological__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d8/db9/topological__sort_8cpp_abcbcaa2bb70af0a11d0c090ea1796aea_cgraph.map
 delete mode 100644 d8/db9/topological__sort_8cpp_abcbcaa2bb70af0a11d0c090ea1796aea_cgraph.md5
 delete mode 100644 d8/db9/topological__sort_8cpp_abcbcaa2bb70af0a11d0c090ea1796aea_cgraph.svg
 delete mode 100644 d8/db9/topological__sort_8cpp_abcbcaa2bb70af0a11d0c090ea1796aea_cgraph_org.svg
 delete mode 100644 d8/db9/topological__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d8/db9/topological__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d8/db9/topological__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d8/db9/topological__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d8/db9/topological__sort_8cpp_source.html
 delete mode 100644 d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d8/dcc/binary__insertion__sort_8cpp_source.html
 delete mode 100644 d8/dcc/namespacestd.html
 delete mode 100644 d8/dcc/namespacestd.js
 create mode 100644 d8/dce/test__queue_8cpp_source.html
 delete mode 100644 d8/dd5/check__factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 d8/dd5/check__factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 d8/dd5/check__factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 d8/dd5/check__factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 d8/dd5/check__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d8/dd5/check__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d8/dd5/check__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d8/dd5/check__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d8/dd5/check__factorial_8cpp_source.html
 delete mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_a22be949d160b26361f7e323310f7fa0c_cgraph.map
 delete mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_a22be949d160b26361f7e323310f7fa0c_cgraph.md5
 delete mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_a22be949d160b26361f7e323310f7fa0c_cgraph.svg
 delete mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_a22be949d160b26361f7e323310f7fa0c_cgraph_org.svg
 delete mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_a55bc4a221e584d33b79b322432ecc0f3_cgraph.map
 delete mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_a55bc4a221e584d33b79b322432ecc0f3_cgraph.md5
 delete mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_a55bc4a221e584d33b79b322432ecc0f3_cgraph.svg
 delete mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_a55bc4a221e584d33b79b322432ecc0f3_cgraph_org.svg
 delete mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_source.html
 delete mode 100644 d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.map
 delete mode 100644 d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.md5
 delete mode 100644 d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.svg
 delete mode 100644 d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph_org.svg
 delete mode 100644 d8/dee/avltree_8cpp_a5fa160a678a34dd51c0aea1c0c00ed5e_cgraph.map
 delete mode 100644 d8/dee/avltree_8cpp_a5fa160a678a34dd51c0aea1c0c00ed5e_cgraph.md5
 delete mode 100644 d8/dee/avltree_8cpp_a5fa160a678a34dd51c0aea1c0c00ed5e_cgraph.svg
 delete mode 100644 d8/dee/avltree_8cpp_a5fa160a678a34dd51c0aea1c0c00ed5e_cgraph_org.svg
 delete mode 100644 d8/dee/avltree_8cpp_a82659e9e223e520cf91d7e55c4a3f88c_cgraph.map
 delete mode 100644 d8/dee/avltree_8cpp_a82659e9e223e520cf91d7e55c4a3f88c_cgraph.md5
 delete mode 100644 d8/dee/avltree_8cpp_a82659e9e223e520cf91d7e55c4a3f88c_cgraph.svg
 delete mode 100644 d8/dee/avltree_8cpp_a82659e9e223e520cf91d7e55c4a3f88c_cgraph_org.svg
 delete mode 100644 d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph.map
 delete mode 100644 d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph.md5
 delete mode 100644 d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph.svg
 delete mode 100644 d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph_org.svg
 delete mode 100644 d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.map
 delete mode 100644 d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.md5
 delete mode 100644 d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.svg
 delete mode 100644 d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph_org.svg
 delete mode 100644 d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.map
 delete mode 100644 d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.md5
 delete mode 100644 d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.svg
 delete mode 100644 d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph_org.svg
 delete mode 100644 d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d8/dee/avltree_8cpp_source.html
 delete mode 100644 d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d8/df0/queue__using__array_8cpp_source.html
 create mode 100644 d8/df9/stack_8hpp__dep__incl.map
 create mode 100644 d8/df9/stack_8hpp__dep__incl.md5
 create mode 100644 d8/df9/stack_8hpp__dep__incl.svg
 create mode 100644 d8/df9/stack_8hpp__dep__incl_org.svg
 delete mode 100644 d8/dfa/median__search2_8cpp_a5fefe132a0c3ee780ebc703f37ebce6a_cgraph.map
 delete mode 100644 d8/dfa/median__search2_8cpp_a5fefe132a0c3ee780ebc703f37ebce6a_cgraph.md5
 delete mode 100644 d8/dfa/median__search2_8cpp_a5fefe132a0c3ee780ebc703f37ebce6a_cgraph.svg
 delete mode 100644 d8/dfa/median__search2_8cpp_a5fefe132a0c3ee780ebc703f37ebce6a_cgraph_org.svg
 delete mode 100644 d8/dfa/median__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d8/dfa/median__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d8/dfa/median__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d8/dfa/median__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d8/dfa/median__search2_8cpp_source.html
 delete mode 100644 d9/d00/factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 d9/d00/factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 d9/d00/factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 d9/d00/factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d9/d00/factorial_8cpp_source.html
 delete mode 100644 d9/d02/linear__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 d9/d02/linear__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 d9/d02/linear__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 d9/d02/linear__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d9/d02/linear__search_8cpp_source.html
 delete mode 100644 d9/d03/namespacestring__search_a1e37af2f023495129cb57338c801209e_cgraph.map
 delete mode 100644 d9/d03/namespacestring__search_a1e37af2f023495129cb57338c801209e_cgraph.md5
 delete mode 100644 d9/d03/namespacestring__search_a1e37af2f023495129cb57338c801209e_cgraph.svg
 delete mode 100644 d9/d03/namespacestring__search_a1e37af2f023495129cb57338c801209e_cgraph_org.svg
 delete mode 100644 d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.map
 delete mode 100644 d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.md5
 delete mode 100644 d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.svg
 delete mode 100644 d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph_org.svg
 delete mode 100644 d9/d03/namespacestring__search_a83c72ff237cdf623e42d4295e0029bf9_cgraph.map
 delete mode 100644 d9/d03/namespacestring__search_a83c72ff237cdf623e42d4295e0029bf9_cgraph.md5
 delete mode 100644 d9/d03/namespacestring__search_a83c72ff237cdf623e42d4295e0029bf9_cgraph.svg
 delete mode 100644 d9/d03/namespacestring__search_a83c72ff237cdf623e42d4295e0029bf9_cgraph_org.svg
 delete mode 100644 d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.map
 delete mode 100644 d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.md5
 delete mode 100644 d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.svg
 delete mode 100644 d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph_org.svg
 delete mode 100644 d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a0c33f2c1a3a3deb486a1c33ee5239499_cgraph.map
 delete mode 100644 d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a0c33f2c1a3a3deb486a1c33ee5239499_cgraph.md5
 delete mode 100644 d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a0c33f2c1a3a3deb486a1c33ee5239499_cgraph.svg
 delete mode 100644 d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a0c33f2c1a3a3deb486a1c33ee5239499_cgraph_org.svg
 delete mode 100644 d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a636a07c90b7f312bb86d2ec104efca25_cgraph.map
 delete mode 100644 d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a636a07c90b7f312bb86d2ec104efca25_cgraph.md5
 delete mode 100644 d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a636a07c90b7f312bb86d2ec104efca25_cgraph.svg
 delete mode 100644 d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a636a07c90b7f312bb86d2ec104efca25_cgraph_org.svg
 delete mode 100644 d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_ad4c6a8e67fb8267a65439b035666b5ae_cgraph.map
 delete mode 100644 d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_ad4c6a8e67fb8267a65439b035666b5ae_cgraph.md5
 delete mode 100644 d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_ad4c6a8e67fb8267a65439b035666b5ae_cgraph.svg
 delete mode 100644 d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_ad4c6a8e67fb8267a65439b035666b5ae_cgraph_org.svg
 delete mode 100644 d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d9/d14/array__left__rotation_8cpp_source.html
 create mode 100644 d9/d1c/kruskal_8cpp_source.html
 delete mode 100644 d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d9/d1f/binary__addition_8cpp_source.html
 delete mode 100644 d9/d23/classgraph_1_1_lowest_common_ancestor_a42589cc39d6bbff6c997152f1b96e356_cgraph.map
 delete mode 100644 d9/d23/classgraph_1_1_lowest_common_ancestor_a42589cc39d6bbff6c997152f1b96e356_cgraph.md5
 delete mode 100644 d9/d23/classgraph_1_1_lowest_common_ancestor_a42589cc39d6bbff6c997152f1b96e356_cgraph.svg
 delete mode 100644 d9/d23/classgraph_1_1_lowest_common_ancestor_a42589cc39d6bbff6c997152f1b96e356_cgraph_org.svg
 delete mode 100644 d9/d23/classgraph_1_1_lowest_common_ancestor_a60151e19512b48cc0b14ea121df00488_cgraph.map
 delete mode 100644 d9/d23/classgraph_1_1_lowest_common_ancestor_a60151e19512b48cc0b14ea121df00488_cgraph.md5
 delete mode 100644 d9/d23/classgraph_1_1_lowest_common_ancestor_a60151e19512b48cc0b14ea121df00488_cgraph.svg
 delete mode 100644 d9/d23/classgraph_1_1_lowest_common_ancestor_a60151e19512b48cc0b14ea121df00488_cgraph_org.svg
 delete mode 100644 d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph.map
 delete mode 100644 d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph.md5
 delete mode 100644 d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph.svg
 delete mode 100644 d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph_org.svg
 delete mode 100644 d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.map
 delete mode 100644 d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.md5
 delete mode 100644 d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.svg
 delete mode 100644 d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph_org.svg
 delete mode 100644 d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.map
 delete mode 100644 d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.md5
 delete mode 100644 d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.svg
 delete mode 100644 d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph_org.svg
 delete mode 100644 d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d9/d24/poisson__dist_8cpp_source.html
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_a10362eb607d7882bac3a0688504b00ff_cgraph.map
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_a10362eb607d7882bac3a0688504b00ff_cgraph.md5
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_a10362eb607d7882bac3a0688504b00ff_cgraph.svg
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_a10362eb607d7882bac3a0688504b00ff_cgraph_org.svg
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_a563e066975fed1b84750a0a47c3cbb37_cgraph.map
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_a563e066975fed1b84750a0a47c3cbb37_cgraph.md5
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_a563e066975fed1b84750a0a47c3cbb37_cgraph.svg
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_a563e066975fed1b84750a0a47c3cbb37_cgraph_org.svg
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_aa554429def63077ab7a550c0affbfefa_cgraph.map
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_aa554429def63077ab7a550c0affbfefa_cgraph.md5
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_aa554429def63077ab7a550c0affbfefa_cgraph.svg
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_aa554429def63077ab7a550c0affbfefa_cgraph_org.svg
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_ab00e9785fb2670f7af99d6f3d636f87c_cgraph.map
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_ab00e9785fb2670f7af99d6f3d636f87c_cgraph.md5
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_ab00e9785fb2670f7af99d6f3d636f87c_cgraph.svg
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_ab00e9785fb2670f7af99d6f3d636f87c_cgraph_org.svg
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d9/d29/ground__to__ground__projectile__motion_8cpp_source.html
 delete mode 100644 d9/d31/coin__change__topdown_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d9/d31/coin__change__topdown_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d9/d31/coin__change__topdown_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d9/d31/coin__change__topdown_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d9/d31/coin__change__topdown_8cpp_ac816a4ae8a29c156b90377041000929a_cgraph.map
 delete mode 100644 d9/d31/coin__change__topdown_8cpp_ac816a4ae8a29c156b90377041000929a_cgraph.md5
 delete mode 100644 d9/d31/coin__change__topdown_8cpp_ac816a4ae8a29c156b90377041000929a_cgraph.svg
 delete mode 100644 d9/d31/coin__change__topdown_8cpp_ac816a4ae8a29c156b90377041000929a_cgraph_org.svg
 delete mode 100644 d9/d31/coin__change__topdown_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/d31/coin__change__topdown_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/d31/coin__change__topdown_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/d31/coin__change__topdown_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d9/d31/coin__change__topdown_8cpp_source.html
 delete mode 100644 d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_a1fda852e6e522707fd97f61cdb0a2591_cgraph.map
 delete mode 100644 d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_a1fda852e6e522707fd97f61cdb0a2591_cgraph.md5
 delete mode 100644 d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_a1fda852e6e522707fd97f61cdb0a2591_cgraph.svg
 delete mode 100644 d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_a1fda852e6e522707fd97f61cdb0a2591_cgraph_org.svg
 delete mode 100644 d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_afba5c1225ba04c0025c7786c09ff28f1_cgraph.map
 delete mode 100644 d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_afba5c1225ba04c0025c7786c09ff28f1_cgraph.md5
 delete mode 100644 d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_afba5c1225ba04c0025c7786c09ff28f1_cgraph.svg
 delete mode 100644 d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_afba5c1225ba04c0025c7786c09ff28f1_cgraph_org.svg
 delete mode 100644 d9/d37/inverse__fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d9/d37/inverse__fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d9/d37/inverse__fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d9/d37/inverse__fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d9/d37/inverse__fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map
 delete mode 100644 d9/d37/inverse__fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
 delete mode 100644 d9/d37/inverse__fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
 delete mode 100644 d9/d37/inverse__fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg
 create mode 100644 d9/d37/inverse__fast__fourier__transform_8cpp_source.html
 delete mode 100644 d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d9/d44/magic__number_8cpp_source.html
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a53082f2e5bacec40266499da4547309a_cgraph.map
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a53082f2e5bacec40266499da4547309a_cgraph.md5
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a53082f2e5bacec40266499da4547309a_cgraph.svg
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a53082f2e5bacec40266499da4547309a_cgraph_org.svg
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a7154fe319e6033485a8a6cd6f0d8932d_cgraph.map
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a7154fe319e6033485a8a6cd6f0d8932d_cgraph.md5
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a7154fe319e6033485a8a6cd6f0d8932d_cgraph.svg
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_a7154fe319e6033485a8a6cd6f0d8932d_cgraph_org.svg
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_ae571600aa42a81bc14a4a602ea5ff00d_cgraph.map
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_ae571600aa42a81bc14a4a602ea5ff00d_cgraph.md5
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_ae571600aa42a81bc14a4a602ea5ff00d_cgraph.svg
 delete mode 100644 d9/d49/kohonen__som__trace_8cpp_ae571600aa42a81bc14a4a602ea5ff00d_cgraph_org.svg
 create mode 100644 d9/d49/kohonen__som__trace_8cpp_source.html
 delete mode 100644 d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.map
 delete mode 100644 d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.md5
 delete mode 100644 d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.svg
 delete mode 100644 d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph_org.svg
 delete mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.map
 delete mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.md5
 delete mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.svg
 delete mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph_org.svg
 delete mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.map
 delete mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.md5
 delete mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.svg
 delete mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph_org.svg
 delete mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_source.html
 delete mode 100644 d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.map
 delete mode 100644 d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.md5
 delete mode 100644 d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.svg
 delete mode 100644 d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph_org.svg
 delete mode 100644 d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html
 delete mode 100644 d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d9/d65/lfu__cache_8cpp_source.html
 delete mode 100644 d9/d66/group__machine__learning_ga60f9186ccb682724a8792a2bf81e9b9e_cgraph.map
 delete mode 100644 d9/d66/group__machine__learning_ga60f9186ccb682724a8792a2bf81e9b9e_cgraph.md5
 delete mode 100644 d9/d66/group__machine__learning_ga60f9186ccb682724a8792a2bf81e9b9e_cgraph.svg
 delete mode 100644 d9/d66/group__machine__learning_ga60f9186ccb682724a8792a2bf81e9b9e_cgraph_org.svg
 delete mode 100644 d9/d66/group__machine__learning_gabc90175770bf0d5853c466e14993a08c_cgraph.map
 delete mode 100644 d9/d66/group__machine__learning_gabc90175770bf0d5853c466e14993a08c_cgraph.md5
 delete mode 100644 d9/d66/group__machine__learning_gabc90175770bf0d5853c466e14993a08c_cgraph.svg
 delete mode 100644 d9/d66/group__machine__learning_gabc90175770bf0d5853c466e14993a08c_cgraph_org.svg
 delete mode 100644 d9/d66/group__machine__learning_gae0208548f8b393528e5db01717e88e67_cgraph.map
 delete mode 100644 d9/d66/group__machine__learning_gae0208548f8b393528e5db01717e88e67_cgraph.md5
 delete mode 100644 d9/d66/group__machine__learning_gae0208548f8b393528e5db01717e88e67_cgraph.svg
 delete mode 100644 d9/d66/group__machine__learning_gae0208548f8b393528e5db01717e88e67_cgraph_org.svg
 delete mode 100644 d9/d66/group__machine__learning_gaf5ce14f026d6d231bef29161bac2b485_cgraph.map
 delete mode 100644 d9/d66/group__machine__learning_gaf5ce14f026d6d231bef29161bac2b485_cgraph.md5
 delete mode 100644 d9/d66/group__machine__learning_gaf5ce14f026d6d231bef29161bac2b485_cgraph.svg
 delete mode 100644 d9/d66/group__machine__learning_gaf5ce14f026d6d231bef29161bac2b485_cgraph_org.svg
 delete mode 100644 d9/d69/median__search_8cpp_a868847218f694e78bf433a0ff7648bae_cgraph.map
 delete mode 100644 d9/d69/median__search_8cpp_a868847218f694e78bf433a0ff7648bae_cgraph.md5
 delete mode 100644 d9/d69/median__search_8cpp_a868847218f694e78bf433a0ff7648bae_cgraph.svg
 delete mode 100644 d9/d69/median__search_8cpp_a868847218f694e78bf433a0ff7648bae_cgraph_org.svg
 delete mode 100644 d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d9/d69/median__search_8cpp_source.html
 create mode 100644 d9/d6b/coin__change_8cpp_source.html
 delete mode 100644 d9/d80/trapped__rainwater_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d9/d80/trapped__rainwater_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d9/d80/trapped__rainwater_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d9/d80/trapped__rainwater_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d9/d80/trapped__rainwater_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/d80/trapped__rainwater_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/d80/trapped__rainwater_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/d80/trapped__rainwater_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d9/d80/trapped__rainwater_8cpp_source.html
 create mode 100644 d9/d85/selection__sort__iterative_8cpp_source.html
 delete mode 100644 d9/d89/fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/d89/fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/d89/fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/d89/fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d9/d89/fibonacci_8cpp_source.html
 delete mode 100644 d9/d92/chaining_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/d92/chaining_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/d92/chaining_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/d92/chaining_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d9/d92/chaining_8cpp_source.html
 delete mode 100644 d9/da2/exponential__dist_8cpp_a1c8b6e787f72a209ef96c096eedf7afc_cgraph.map
 delete mode 100644 d9/da2/exponential__dist_8cpp_a1c8b6e787f72a209ef96c096eedf7afc_cgraph.md5
 delete mode 100644 d9/da2/exponential__dist_8cpp_a1c8b6e787f72a209ef96c096eedf7afc_cgraph.svg
 delete mode 100644 d9/da2/exponential__dist_8cpp_a1c8b6e787f72a209ef96c096eedf7afc_cgraph_org.svg
 delete mode 100644 d9/da2/exponential__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 d9/da2/exponential__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 d9/da2/exponential__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 d9/da2/exponential__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 d9/da2/exponential__dist_8cpp_ac7b0091e17479d47438a281fefc2549a_cgraph.map
 delete mode 100644 d9/da2/exponential__dist_8cpp_ac7b0091e17479d47438a281fefc2549a_cgraph.md5
 delete mode 100644 d9/da2/exponential__dist_8cpp_ac7b0091e17479d47438a281fefc2549a_cgraph.svg
 delete mode 100644 d9/da2/exponential__dist_8cpp_ac7b0091e17479d47438a281fefc2549a_cgraph_org.svg
 delete mode 100644 d9/da2/exponential__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/da2/exponential__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/da2/exponential__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/da2/exponential__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d9/da2/exponential__dist_8cpp_af435dbeb43a05c8c7785f53bf4ce1df1_cgraph.map
 delete mode 100644 d9/da2/exponential__dist_8cpp_af435dbeb43a05c8c7785f53bf4ce1df1_cgraph.md5
 delete mode 100644 d9/da2/exponential__dist_8cpp_af435dbeb43a05c8c7785f53bf4ce1df1_cgraph.svg
 delete mode 100644 d9/da2/exponential__dist_8cpp_af435dbeb43a05c8c7785f53bf4ce1df1_cgraph_org.svg
 create mode 100644 d9/da2/exponential__dist_8cpp_source.html
 delete mode 100644 d9/dab/bloom__filter_8cpp_a30edc0d2bb59c185baec81d69d20ed3b_cgraph.map
 delete mode 100644 d9/dab/bloom__filter_8cpp_a30edc0d2bb59c185baec81d69d20ed3b_cgraph.md5
 delete mode 100644 d9/dab/bloom__filter_8cpp_a30edc0d2bb59c185baec81d69d20ed3b_cgraph.svg
 delete mode 100644 d9/dab/bloom__filter_8cpp_a30edc0d2bb59c185baec81d69d20ed3b_cgraph_org.svg
 delete mode 100644 d9/dab/bloom__filter_8cpp_a6e509afe40db07681f676ad8da4fb905_cgraph.map
 delete mode 100644 d9/dab/bloom__filter_8cpp_a6e509afe40db07681f676ad8da4fb905_cgraph.md5
 delete mode 100644 d9/dab/bloom__filter_8cpp_a6e509afe40db07681f676ad8da4fb905_cgraph.svg
 delete mode 100644 d9/dab/bloom__filter_8cpp_a6e509afe40db07681f676ad8da4fb905_cgraph_org.svg
 delete mode 100644 d9/dab/bloom__filter_8cpp_a71f57bf262fe55db928b19dc124cc0d8_cgraph.map
 delete mode 100644 d9/dab/bloom__filter_8cpp_a71f57bf262fe55db928b19dc124cc0d8_cgraph.md5
 delete mode 100644 d9/dab/bloom__filter_8cpp_a71f57bf262fe55db928b19dc124cc0d8_cgraph.svg
 delete mode 100644 d9/dab/bloom__filter_8cpp_a71f57bf262fe55db928b19dc124cc0d8_cgraph_org.svg
 delete mode 100644 d9/dab/bloom__filter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/dab/bloom__filter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/dab/bloom__filter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/dab/bloom__filter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d9/dab/bloom__filter_8cpp_source.html
 create mode 100644 d9/dad/rb__tree_8cpp_source.html
 delete mode 100644 d9/dae/classdata__structures_1_1_bitset_a17dbe1b1d559302312e8091f82f7499c_cgraph.map
 delete mode 100644 d9/dae/classdata__structures_1_1_bitset_a17dbe1b1d559302312e8091f82f7499c_cgraph.md5
 delete mode 100644 d9/dae/classdata__structures_1_1_bitset_a17dbe1b1d559302312e8091f82f7499c_cgraph.svg
 delete mode 100644 d9/dae/classdata__structures_1_1_bitset_a17dbe1b1d559302312e8091f82f7499c_cgraph_org.svg
 delete mode 100644 d9/dae/classdata__structures_1_1_bitset_a2f1f44d6a12b0de4aaf242872b1c7b54_cgraph.map
 delete mode 100644 d9/dae/classdata__structures_1_1_bitset_a2f1f44d6a12b0de4aaf242872b1c7b54_cgraph.md5
 delete mode 100644 d9/dae/classdata__structures_1_1_bitset_a2f1f44d6a12b0de4aaf242872b1c7b54_cgraph.svg
 delete mode 100644 d9/dae/classdata__structures_1_1_bitset_a2f1f44d6a12b0de4aaf242872b1c7b54_cgraph_org.svg
 delete mode 100644 d9/dae/classdata__structures_1_1_bitset_a9ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph.map
 delete mode 100644 d9/dae/classdata__structures_1_1_bitset_a9ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph.md5
 delete mode 100644 d9/dae/classdata__structures_1_1_bitset_a9ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph.svg
 delete mode 100644 d9/dae/classdata__structures_1_1_bitset_a9ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph_org.svg
 create mode 100644 d9/dbf/test__stack_8cpp_source.html
 create mode 100644 d9/dcc/selectionsortlinkedlist_8cpp_source.html
 create mode 100644 d9/dd2/cocktail__selection__sort_8cpp_source.html
 create mode 100644 d9/dd7/interpolation__search_8cpp_source.html
 delete mode 100644 d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph.map
 delete mode 100644 d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph.md5
 delete mode 100644 d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph_org.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph.map
 delete mode 100644 d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph.md5
 delete mode 100644 d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph_org.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph.map
 delete mode 100644 d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph.md5
 delete mode 100644 d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph_org.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph.map
 delete mode 100644 d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph.md5
 delete mode 100644 d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph_org.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph.map
 delete mode 100644 d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph.md5
 delete mode 100644 d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph_org.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph.map
 delete mode 100644 d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph.md5
 delete mode 100644 d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph_org.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph.map
 delete mode 100644 d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph.md5
 delete mode 100644 d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph_org.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph.map
 delete mode 100644 d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph.md5
 delete mode 100644 d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph_org.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph.map
 delete mode 100644 d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph.md5
 delete mode 100644 d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph_org.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.map
 delete mode 100644 d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.md5
 delete mode 100644 d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph_org.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph.map
 delete mode 100644 d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph.md5
 delete mode 100644 d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph.svg
 delete mode 100644 d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph_org.svg
 delete mode 100644 d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph.map
 delete mode 100644 d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph.md5
 delete mode 100644 d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph.svg
 delete mode 100644 d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph_org.svg
 delete mode 100644 d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph.map
 delete mode 100644 d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph.md5
 delete mode 100644 d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph.svg
 delete mode 100644 d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph_org.svg
 delete mode 100644 d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph.map
 delete mode 100644 d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph.md5
 delete mode 100644 d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph.svg
 delete mode 100644 d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph_org.svg
 delete mode 100644 d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph.map
 delete mode 100644 d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph.md5
 delete mode 100644 d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph.svg
 delete mode 100644 d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph_org.svg
 delete mode 100644 d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph.map
 delete mode 100644 d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph.md5
 delete mode 100644 d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph.svg
 delete mode 100644 d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph_org.svg
 delete mode 100644 d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.map
 delete mode 100644 d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.md5
 delete mode 100644 d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.svg
 delete mode 100644 d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph_org.svg
 delete mode 100644 d9/dec/unbounded__0__1__knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 d9/dec/unbounded__0__1__knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 d9/dec/unbounded__0__1__knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 d9/dec/unbounded__0__1__knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d9/dec/unbounded__0__1__knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.map
 delete mode 100644 d9/dec/unbounded__0__1__knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.md5
 delete mode 100644 d9/dec/unbounded__0__1__knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.svg
 delete mode 100644 d9/dec/unbounded__0__1__knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph_org.svg
 create mode 100644 d9/dec/unbounded__0__1__knapsack_8cpp_source.html
 delete mode 100644 d9/df0/fast__integer__input_8cpp_a4e097ac8509b717bdc8ab09ecd86ae82_cgraph.map
 delete mode 100644 d9/df0/fast__integer__input_8cpp_a4e097ac8509b717bdc8ab09ecd86ae82_cgraph.md5
 delete mode 100644 d9/df0/fast__integer__input_8cpp_a4e097ac8509b717bdc8ab09ecd86ae82_cgraph.svg
 delete mode 100644 d9/df0/fast__integer__input_8cpp_a4e097ac8509b717bdc8ab09ecd86ae82_cgraph_org.svg
 delete mode 100644 d9/df0/fast__integer__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/df0/fast__integer__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/df0/fast__integer__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/df0/fast__integer__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 d9/df0/fast__integer__input_8cpp_source.html
 delete mode 100644 d9/df4/namespacetests_a2b9769e44683dcb67fe1083ad91e134d_cgraph.map
 delete mode 100644 d9/df4/namespacetests_a2b9769e44683dcb67fe1083ad91e134d_cgraph.md5
 delete mode 100644 d9/df4/namespacetests_a2b9769e44683dcb67fe1083ad91e134d_cgraph.svg
 delete mode 100644 d9/df4/namespacetests_a2b9769e44683dcb67fe1083ad91e134d_cgraph_org.svg
 delete mode 100644 d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.map
 delete mode 100644 d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.md5
 delete mode 100644 d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.svg
 delete mode 100644 d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph_org.svg
 create mode 100644 d9/dfd/circular__queue__using__linked__list_8cpp_source.html
 delete mode 100644 d9/dfd/comb__sort_8cpp_a0f4e7569090083fb53d5cdeaf0e2974f_cgraph.map
 delete mode 100644 d9/dfd/comb__sort_8cpp_a0f4e7569090083fb53d5cdeaf0e2974f_cgraph.md5
 delete mode 100644 d9/dfd/comb__sort_8cpp_a0f4e7569090083fb53d5cdeaf0e2974f_cgraph.svg
 delete mode 100644 d9/dfd/comb__sort_8cpp_a0f4e7569090083fb53d5cdeaf0e2974f_cgraph_org.svg
 delete mode 100644 d9/dfd/comb__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
 delete mode 100644 d9/dfd/comb__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
 delete mode 100644 d9/dfd/comb__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
 delete mode 100644 d9/dfd/comb__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
 delete mode 100644 d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph.map
 delete mode 100644 d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph.md5
 delete mode 100644 d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph.svg
 delete mode 100644 d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph_org.svg
 create mode 100644 d9/dfd/comb__sort_8cpp_source.html
 delete mode 100644 da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a0a26aa9ad3d73707370d9fe83707aca4_cgraph.map
 delete mode 100644 da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a0a26aa9ad3d73707370d9fe83707aca4_cgraph.md5
 delete mode 100644 da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a0a26aa9ad3d73707370d9fe83707aca4_cgraph.svg
 delete mode 100644 da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a0a26aa9ad3d73707370d9fe83707aca4_cgraph_org.svg
 delete mode 100644 da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.map
 delete mode 100644 da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.md5
 delete mode 100644 da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.svg
 delete mode 100644 da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph_org.svg
 delete mode 100644 da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.map
 delete mode 100644 da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.md5
 delete mode 100644 da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.svg
 delete mode 100644 da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph_org.svg
 delete mode 100644 da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.map
 delete mode 100644 da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.md5
 delete mode 100644 da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.svg
 delete mode 100644 da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph_org.svg
 delete mode 100644 da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph.map
 delete mode 100644 da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph.md5
 delete mode 100644 da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph.svg
 delete mode 100644 da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph_org.svg
 delete mode 100644 da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph.map
 delete mode 100644 da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph.md5
 delete mode 100644 da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph.svg
 delete mode 100644 da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph_org.svg
 delete mode 100644 da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph.map
 delete mode 100644 da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph.md5
 delete mode 100644 da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph.svg
 delete mode 100644 da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph_org.svg
 delete mode 100644 da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph.map
 delete mode 100644 da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph.md5
 delete mode 100644 da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph.svg
 delete mode 100644 da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph_org.svg
 delete mode 100644 da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 da/d0d/longest__common__string_8cpp_source.html
 delete mode 100644 da/d18/quadratic__equations__complex__numbers_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 da/d18/quadratic__equations__complex__numbers_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 da/d18/quadratic__equations__complex__numbers_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 da/d18/quadratic__equations__complex__numbers_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 da/d18/quadratic__equations__complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 da/d18/quadratic__equations__complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 da/d18/quadratic__equations__complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 da/d18/quadratic__equations__complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 da/d18/quadratic__equations__complex__numbers_8cpp_af7a6d4e3dc85a6288c8f1f7094830c5a_cgraph.map
 delete mode 100644 da/d18/quadratic__equations__complex__numbers_8cpp_af7a6d4e3dc85a6288c8f1f7094830c5a_cgraph.md5
 delete mode 100644 da/d18/quadratic__equations__complex__numbers_8cpp_af7a6d4e3dc85a6288c8f1f7094830c5a_cgraph.svg
 delete mode 100644 da/d18/quadratic__equations__complex__numbers_8cpp_af7a6d4e3dc85a6288c8f1f7094830c5a_cgraph_org.svg
 create mode 100644 da/d18/quadratic__equations__complex__numbers_8cpp_source.html
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph.map
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph.md5
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph.svg
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph_org.svg
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a0a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph.map
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a0a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph.md5
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a0a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph.svg
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a0a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph_org.svg
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a4620163a196709484225774d87de6d69_cgraph.map
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a4620163a196709484225774d87de6d69_cgraph.md5
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a4620163a196709484225774d87de6d69_cgraph.svg
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a4620163a196709484225774d87de6d69_cgraph_org.svg
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a8aae1cebcf42ed2332f1c7217c401aa3_cgraph.map
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a8aae1cebcf42ed2332f1c7217c401aa3_cgraph.md5
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a8aae1cebcf42ed2332f1c7217c401aa3_cgraph.svg
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a8aae1cebcf42ed2332f1c7217c401aa3_cgraph_org.svg
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aaf762e88c66918d7afda4234f28a7ddf_cgraph.map
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aaf762e88c66918d7afda4234f28a7ddf_cgraph.md5
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aaf762e88c66918d7afda4234f28a7ddf_cgraph.svg
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aaf762e88c66918d7afda4234f28a7ddf_cgraph_org.svg
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aee973db9f0435e0cb4cc70f8eb3447a1_cgraph.map
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aee973db9f0435e0cb4cc70f8eb3447a1_cgraph.md5
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aee973db9f0435e0cb4cc70f8eb3447a1_cgraph.svg
 delete mode 100644 da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aee973db9f0435e0cb4cc70f8eb3447a1_cgraph_org.svg
 delete mode 100644 da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.map
 delete mode 100644 da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.md5
 delete mode 100644 da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.svg
 delete mode 100644 da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph_org.svg
 delete mode 100644 da/d23/eulers__totient__function_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
 delete mode 100644 da/d23/eulers__totient__function_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
 delete mode 100644 da/d23/eulers__totient__function_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
 delete mode 100644 da/d23/eulers__totient__function_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
 delete mode 100644 da/d23/eulers__totient__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 da/d23/eulers__totient__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 da/d23/eulers__totient__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 da/d23/eulers__totient__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 create mode 100644 da/d23/eulers__totient__function_8cpp_source.html
 delete mode 100644 da/d24/sqrt__double_8cpp_ae662282ad0740d2063ac404ca3bd74fc_cgraph.map
 delete mode 100644 da/d24/sqrt__double_8cpp_ae662282ad0740d2063ac404ca3bd74fc_cgraph.md5
 delete mode 100644 da/d24/sqrt__double_8cpp_ae662282ad0740d2063ac404ca3bd74fc_cgraph.svg
 delete mode 100644 da/d24/sqrt__double_8cpp_ae662282ad0740d2063ac404ca3bd74fc_cgraph_org.svg
 delete mode 100644 da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 da/d24/sqrt__double_8cpp_source.html
 create mode 100644 da/d27/prim_8cpp_source.html
 delete mode 100644 da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 da/d39/volume_8cpp_source.html
 delete mode 100644 da/d41/uint128__t_8hpp_a3ff77262ffd6743df5b808d41382a6f3_cgraph.map
 delete mode 100644 da/d41/uint128__t_8hpp_a3ff77262ffd6743df5b808d41382a6f3_cgraph.md5
 delete mode 100644 da/d41/uint128__t_8hpp_a3ff77262ffd6743df5b808d41382a6f3_cgraph.svg
 delete mode 100644 da/d41/uint128__t_8hpp_a3ff77262ffd6743df5b808d41382a6f3_cgraph_org.svg
 delete mode 100644 da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph.map
 delete mode 100644 da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph.md5
 delete mode 100644 da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph.svg
 delete mode 100644 da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph_org.svg
 delete mode 100644 da/d4b/depth__first__search__with__stack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 da/d4b/depth__first__search__with__stack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 da/d4b/depth__first__search__with__stack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 da/d4b/depth__first__search__with__stack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 da/d4b/depth__first__search__with__stack_8cpp_a5738da9f508f6a9e87f123c9fb6f2ea9_cgraph.map
 delete mode 100644 da/d4b/depth__first__search__with__stack_8cpp_a5738da9f508f6a9e87f123c9fb6f2ea9_cgraph.md5
 delete mode 100644 da/d4b/depth__first__search__with__stack_8cpp_a5738da9f508f6a9e87f123c9fb6f2ea9_cgraph.svg
 delete mode 100644 da/d4b/depth__first__search__with__stack_8cpp_a5738da9f508f6a9e87f123c9fb6f2ea9_cgraph_org.svg
 delete mode 100644 da/d4b/depth__first__search__with__stack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 da/d4b/depth__first__search__with__stack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 da/d4b/depth__first__search__with__stack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 da/d4b/depth__first__search__with__stack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 da/d4b/depth__first__search__with__stack_8cpp_source.html
 delete mode 100644 da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_a0d5e1d651d0d30bd682f176d8f2b83d0_cgraph.map
 delete mode 100644 da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_a0d5e1d651d0d30bd682f176d8f2b83d0_cgraph.md5
 delete mode 100644 da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_a0d5e1d651d0d30bd682f176d8f2b83d0_cgraph.svg
 delete mode 100644 da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_a0d5e1d651d0d30bd682f176d8f2b83d0_cgraph_org.svg
 delete mode 100644 da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html
 delete mode 100644 da/d52/minimum__edit__distance_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
 delete mode 100644 da/d52/minimum__edit__distance_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
 delete mode 100644 da/d52/minimum__edit__distance_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
 delete mode 100644 da/d52/minimum__edit__distance_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
 delete mode 100644 da/d52/minimum__edit__distance_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 da/d52/minimum__edit__distance_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 da/d52/minimum__edit__distance_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 da/d52/minimum__edit__distance_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 create mode 100644 da/d52/minimum__edit__distance_8cpp_source.html
 delete mode 100644 da/d5a/class_complex_a3cfc522c782726f49ee20af17b77f867_cgraph.map
 delete mode 100644 da/d5a/class_complex_a3cfc522c782726f49ee20af17b77f867_cgraph.md5
 delete mode 100644 da/d5a/class_complex_a3cfc522c782726f49ee20af17b77f867_cgraph.svg
 delete mode 100644 da/d5a/class_complex_a3cfc522c782726f49ee20af17b77f867_cgraph_org.svg
 delete mode 100644 da/d5a/class_complex_a4ac9f529d54cacf2969f2c7179b4c4ac_cgraph.map
 delete mode 100644 da/d5a/class_complex_a4ac9f529d54cacf2969f2c7179b4c4ac_cgraph.md5
 delete mode 100644 da/d5a/class_complex_a4ac9f529d54cacf2969f2c7179b4c4ac_cgraph.svg
 delete mode 100644 da/d5a/class_complex_a4ac9f529d54cacf2969f2c7179b4c4ac_cgraph_org.svg
 delete mode 100644 da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.map
 delete mode 100644 da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.md5
 delete mode 100644 da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.svg
 delete mode 100644 da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph_org.svg
 delete mode 100644 da/d5a/class_complex_ae1e03712837450549e0c9b4017533a41_cgraph.map
 delete mode 100644 da/d5a/class_complex_ae1e03712837450549e0c9b4017533a41_cgraph.md5
 delete mode 100644 da/d5a/class_complex_ae1e03712837450549e0c9b4017533a41_cgraph.svg
 delete mode 100644 da/d5a/class_complex_ae1e03712837450549e0c9b4017533a41_cgraph_org.svg
 delete mode 100644 da/d5a/class_complex_ae5b51b749ea4964104b9527af9d8f556_cgraph.map
 delete mode 100644 da/d5a/class_complex_ae5b51b749ea4964104b9527af9d8f556_cgraph.md5
 delete mode 100644 da/d5a/class_complex_ae5b51b749ea4964104b9527af9d8f556_cgraph.svg
 delete mode 100644 da/d5a/class_complex_ae5b51b749ea4964104b9527af9d8f556_cgraph_org.svg
 create mode 100644 da/d68/searching__of__element__in__dynamic__array_8cpp_source.html
 delete mode 100644 da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.map
 delete mode 100644 da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.md5
 delete mode 100644 da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.svg
 delete mode 100644 da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph_org.svg
 delete mode 100644 da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.map
 delete mode 100644 da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.md5
 delete mode 100644 da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.svg
 delete mode 100644 da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph_org.svg
 delete mode 100644 da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.map
 delete mode 100644 da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.md5
 delete mode 100644 da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.svg
 delete mode 100644 da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph_org.svg
 delete mode 100644 da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.map
 delete mode 100644 da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.md5
 delete mode 100644 da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.svg
 delete mode 100644 da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph_org.svg
 delete mode 100644 da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_ad3993dbca9c5b3ef9ac361dc7f62ce57_cgraph.map
 delete mode 100644 da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_ad3993dbca9c5b3ef9ac361dc7f62ce57_cgraph.md5
 delete mode 100644 da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_ad3993dbca9c5b3ef9ac361dc7f62ce57_cgraph.svg
 delete mode 100644 da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_ad3993dbca9c5b3ef9ac361dc7f62ce57_cgraph_org.svg
 delete mode 100644 da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
 delete mode 100644 da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
 delete mode 100644 da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
 delete mode 100644 da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
 create mode 100644 da/d77/spirograph_8cpp_source.html
 delete mode 100644 da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 da/d7b/primality__test_8cpp_source.html
 create mode 100644 da/d83/kosaraju_8cpp_source.html
 delete mode 100644 da/d8d/depth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 da/d8d/depth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 da/d8d/depth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 da/d8d/depth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 da/d8d/depth__first__search_8cpp_source.html
 delete mode 100644 da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn_a62e152db014cd4de675fa906e5ef2861_cgraph.map
 delete mode 100644 da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn_a62e152db014cd4de675fa906e5ef2861_cgraph.md5
 delete mode 100644 da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn_a62e152db014cd4de675fa906e5ef2861_cgraph.svg
 delete mode 100644 da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn_a62e152db014cd4de675fa906e5ef2861_cgraph_org.svg
 delete mode 100644 da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 da/d9a/palindrome__of__number_8cpp_source.html
 delete mode 100644 da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph.map
 delete mode 100644 da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph.md5
 delete mode 100644 da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph.svg
 delete mode 100644 da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph_org.svg
 delete mode 100644 da/dac/n__queens__all__solution__optimised_8cpp_a23c0547e4fd1708e6fb643b08327a60f_cgraph.map
 delete mode 100644 da/dac/n__queens__all__solution__optimised_8cpp_a23c0547e4fd1708e6fb643b08327a60f_cgraph.md5
 delete mode 100644 da/dac/n__queens__all__solution__optimised_8cpp_a23c0547e4fd1708e6fb643b08327a60f_cgraph.svg
 delete mode 100644 da/dac/n__queens__all__solution__optimised_8cpp_a23c0547e4fd1708e6fb643b08327a60f_cgraph_org.svg
 delete mode 100644 da/dac/n__queens__all__solution__optimised_8cpp_a9e48455584a4faa33e83dd1891efd9b9_cgraph.map
 delete mode 100644 da/dac/n__queens__all__solution__optimised_8cpp_a9e48455584a4faa33e83dd1891efd9b9_cgraph.md5
 delete mode 100644 da/dac/n__queens__all__solution__optimised_8cpp_a9e48455584a4faa33e83dd1891efd9b9_cgraph.svg
 delete mode 100644 da/dac/n__queens__all__solution__optimised_8cpp_a9e48455584a4faa33e83dd1891efd9b9_cgraph_org.svg
 create mode 100644 da/dac/n__queens__all__solution__optimised_8cpp_source.html
 delete mode 100644 da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph.map
 delete mode 100644 da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph.md5
 delete mode 100644 da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph.svg
 delete mode 100644 da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph_org.svg
 create mode 100644 da/db8/count__of__set__bits_8cpp_source.html
 delete mode 100644 da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.map
 delete mode 100644 da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.md5
 delete mode 100644 da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.svg
 delete mode 100644 da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph_org.svg
 delete mode 100644 da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 da/dc3/linked__list_8cpp_source.html
 delete mode 100644 da/dc9/fibonacci__matrix__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 da/dc9/fibonacci__matrix__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 da/dc9/fibonacci__matrix__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 da/dc9/fibonacci__matrix__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 da/dc9/fibonacci__matrix__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 da/dc9/fibonacci__matrix__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 da/dc9/fibonacci__matrix__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 da/dc9/fibonacci__matrix__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_a7a890d2f26855ada3b9f1d43aec70a86_cgraph.map
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_a7a890d2f26855ada3b9f1d43aec70a86_cgraph.md5
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_a7a890d2f26855ada3b9f1d43aec70a86_cgraph.svg
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_a7a890d2f26855ada3b9f1d43aec70a86_cgraph_org.svg
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aad9e3edfe156b59fc06a5585403fe0d6_cgraph.map
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aad9e3edfe156b59fc06a5585403fe0d6_cgraph.md5
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aad9e3edfe156b59fc06a5585403fe0d6_cgraph.svg
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aad9e3edfe156b59fc06a5585403fe0d6_cgraph_org.svg
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ad76f5cac3ef8dc034f6abb99b64c2b20_cgraph.map
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ad76f5cac3ef8dc034f6abb99b64c2b20_cgraph.md5
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ad76f5cac3ef8dc034f6abb99b64c2b20_cgraph.svg
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ad76f5cac3ef8dc034f6abb99b64c2b20_cgraph_org.svg
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html
 delete mode 100644 da/dd3/namespacespirograph_a8e83a64e8443fff1e5ffdc1c299c1e99_cgraph.map
 delete mode 100644 da/dd3/namespacespirograph_a8e83a64e8443fff1e5ffdc1c299c1e99_cgraph.md5
 delete mode 100644 da/dd3/namespacespirograph_a8e83a64e8443fff1e5ffdc1c299c1e99_cgraph.svg
 delete mode 100644 da/dd3/namespacespirograph_a8e83a64e8443fff1e5ffdc1c299c1e99_cgraph_org.svg
 delete mode 100644 da/dd3/namespacespirograph_aeca22dbe4563358960e907a40cd3e1ac_cgraph.map
 delete mode 100644 da/dd3/namespacespirograph_aeca22dbe4563358960e907a40cd3e1ac_cgraph.md5
 delete mode 100644 da/dd3/namespacespirograph_aeca22dbe4563358960e907a40cd3e1ac_cgraph.svg
 delete mode 100644 da/dd3/namespacespirograph_aeca22dbe4563358960e907a40cd3e1ac_cgraph_org.svg
 delete mode 100644 da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map
 delete mode 100644 da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5
 delete mode 100644 da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg
 delete mode 100644 da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg
 create mode 100644 da/de7/decimal__to__hexadecimal_8cpp_source.html
 delete mode 100644 da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 da/de8/dijkstra__greedy_8cpp_source.html
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_a2c35b320ace8677f9b331faf94f8b2fd_cgraph.map
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_a2c35b320ace8677f9b331faf94f8b2fd_cgraph.md5
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_a2c35b320ace8677f9b331faf94f8b2fd_cgraph.svg
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_a2c35b320ace8677f9b331faf94f8b2fd_cgraph_org.svg
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_a90219e35062007d1f1b68e9af071ab5c_cgraph.map
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_a90219e35062007d1f1b68e9af071ab5c_cgraph.md5
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_a90219e35062007d1f1b68e9af071ab5c_cgraph.svg
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_a90219e35062007d1f1b68e9af071ab5c_cgraph_org.svg
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_ae2ab49ba1969d7a5988f9bc2c8924569_cgraph.map
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_ae2ab49ba1969d7a5988f9bc2c8924569_cgraph.md5
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_ae2ab49ba1969d7a5988f9bc2c8924569_cgraph.svg
 delete mode 100644 da/df2/durand__kerner__roots_8cpp_ae2ab49ba1969d7a5988f9bc2c8924569_cgraph_org.svg
 create mode 100644 da/df2/durand__kerner__roots_8cpp_source.html
 delete mode 100644 db/d01/brent__method__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
 delete mode 100644 db/d01/brent__method__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
 delete mode 100644 db/d01/brent__method__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
 delete mode 100644 db/d01/brent__method__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
 delete mode 100644 db/d01/brent__method__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
 delete mode 100644 db/d01/brent__method__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
 delete mode 100644 db/d01/brent__method__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
 delete mode 100644 db/d01/brent__method__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
 delete mode 100644 db/d01/brent__method__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.map
 delete mode 100644 db/d01/brent__method__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.md5
 delete mode 100644 db/d01/brent__method__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.svg
 delete mode 100644 db/d01/brent__method__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph_org.svg
 delete mode 100644 db/d01/brent__method__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
 delete mode 100644 db/d01/brent__method__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
 delete mode 100644 db/d01/brent__method__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
 delete mode 100644 db/d01/brent__method__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
 delete mode 100644 db/d01/brent__method__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 db/d01/brent__method__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 db/d01/brent__method__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 db/d01/brent__method__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 db/d01/brent__method__extrema_8cpp_source.html
 delete mode 100644 db/d07/spiral__print_8cpp_acfff36db81326fb990a643ab198ee8a5_cgraph.map
 delete mode 100644 db/d07/spiral__print_8cpp_acfff36db81326fb990a643ab198ee8a5_cgraph.md5
 delete mode 100644 db/d07/spiral__print_8cpp_acfff36db81326fb990a643ab198ee8a5_cgraph.svg
 delete mode 100644 db/d07/spiral__print_8cpp_acfff36db81326fb990a643ab198ee8a5_cgraph_org.svg
 delete mode 100644 db/d07/spiral__print_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 db/d07/spiral__print_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 db/d07/spiral__print_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 db/d07/spiral__print_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 db/d07/spiral__print_8cpp_source.html
 delete mode 100644 db/d09/duval_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 db/d09/duval_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 db/d09/duval_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 db/d09/duval_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 db/d09/duval_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 db/d09/duval_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 db/d09/duval_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 db/d09/duval_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 db/d09/duval_8cpp_source.html
 delete mode 100644 db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.map
 delete mode 100644 db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.md5
 delete mode 100644 db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.svg
 delete mode 100644 db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph_org.svg
 delete mode 100644 db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.map
 delete mode 100644 db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.md5
 delete mode 100644 db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.svg
 delete mode 100644 db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph_org.svg
 create mode 100644 db/d0d/prime__factorization_8cpp_source.html
 delete mode 100644 db/d10/classdsu__coll__graph.map
 delete mode 100644 db/d10/classdsu__coll__graph.md5
 delete mode 100644 db/d10/classdsu__coll__graph.svg
 delete mode 100644 db/d10/classdsu__coll__graph_org.svg
 delete mode 100644 db/d16/0__1__knapsack_8cpp_a15edf30f336885e5b851f6b7199c6cd1_cgraph.map
 delete mode 100644 db/d16/0__1__knapsack_8cpp_a15edf30f336885e5b851f6b7199c6cd1_cgraph.md5
 delete mode 100644 db/d16/0__1__knapsack_8cpp_a15edf30f336885e5b851f6b7199c6cd1_cgraph.svg
 delete mode 100644 db/d16/0__1__knapsack_8cpp_a15edf30f336885e5b851f6b7199c6cd1_cgraph_org.svg
 delete mode 100644 db/d16/0__1__knapsack_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 db/d16/0__1__knapsack_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 db/d16/0__1__knapsack_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 db/d16/0__1__knapsack_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 db/d16/0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 db/d16/0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 db/d16/0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 db/d16/0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 db/d16/0__1__knapsack_8cpp_source.html
 delete mode 100644 db/d27/n__bonacci_8cpp_a6849b68f760be628d5975ab3eddec63d_cgraph.map
 delete mode 100644 db/d27/n__bonacci_8cpp_a6849b68f760be628d5975ab3eddec63d_cgraph.md5
 delete mode 100644 db/d27/n__bonacci_8cpp_a6849b68f760be628d5975ab3eddec63d_cgraph.svg
 delete mode 100644 db/d27/n__bonacci_8cpp_a6849b68f760be628d5975ab3eddec63d_cgraph_org.svg
 delete mode 100644 db/d27/n__bonacci_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 db/d27/n__bonacci_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 db/d27/n__bonacci_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 db/d27/n__bonacci_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 db/d27/n__bonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 db/d27/n__bonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 db/d27/n__bonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 db/d27/n__bonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 db/d27/n__bonacci_8cpp_source.html
 delete mode 100644 db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.map
 delete mode 100644 db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.md5
 delete mode 100644 db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.svg
 delete mode 100644 db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph_org.svg
 delete mode 100644 db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 db/d3c/tower__of__hanoi_8cpp_source.html
 delete mode 100644 db/d3f/wave__sort_8cpp_a7d4f243b9dc13ace4ef77e30dbc56f12_cgraph.map
 delete mode 100644 db/d3f/wave__sort_8cpp_a7d4f243b9dc13ace4ef77e30dbc56f12_cgraph.md5
 delete mode 100644 db/d3f/wave__sort_8cpp_a7d4f243b9dc13ace4ef77e30dbc56f12_cgraph.svg
 delete mode 100644 db/d3f/wave__sort_8cpp_a7d4f243b9dc13ace4ef77e30dbc56f12_cgraph_org.svg
 delete mode 100644 db/d3f/wave__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 db/d3f/wave__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 db/d3f/wave__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 db/d3f/wave__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 db/d3f/wave__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 db/d3f/wave__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 db/d3f/wave__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 db/d3f/wave__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 db/d3f/wave__sort_8cpp_source.html
 delete mode 100644 db/d40/integral__approximation2_8cpp_a71249ee535f16f8ed2e9cc8f0199a2cf_cgraph.map
 delete mode 100644 db/d40/integral__approximation2_8cpp_a71249ee535f16f8ed2e9cc8f0199a2cf_cgraph.md5
 delete mode 100644 db/d40/integral__approximation2_8cpp_a71249ee535f16f8ed2e9cc8f0199a2cf_cgraph.svg
 delete mode 100644 db/d40/integral__approximation2_8cpp_a71249ee535f16f8ed2e9cc8f0199a2cf_cgraph_org.svg
 delete mode 100644 db/d40/integral__approximation2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 db/d40/integral__approximation2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 db/d40/integral__approximation2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 db/d40/integral__approximation2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 db/d40/integral__approximation2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 db/d40/integral__approximation2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 db/d40/integral__approximation2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 db/d40/integral__approximation2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 db/d40/integral__approximation2_8cpp_af7da9ba8932f1f48b9bbc2d80471af51_cgraph.map
 delete mode 100644 db/d40/integral__approximation2_8cpp_af7da9ba8932f1f48b9bbc2d80471af51_cgraph.md5
 delete mode 100644 db/d40/integral__approximation2_8cpp_af7da9ba8932f1f48b9bbc2d80471af51_cgraph.svg
 delete mode 100644 db/d40/integral__approximation2_8cpp_af7da9ba8932f1f48b9bbc2d80471af51_cgraph_org.svg
 create mode 100644 db/d40/integral__approximation2_8cpp_source.html
 delete mode 100644 db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_a5540434e1b41245205eee86f664906f7_cgraph.map
 delete mode 100644 db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_a5540434e1b41245205eee86f664906f7_cgraph.md5
 delete mode 100644 db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_a5540434e1b41245205eee86f664906f7_cgraph.svg
 delete mode 100644 db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_a5540434e1b41245205eee86f664906f7_cgraph_org.svg
 delete mode 100644 db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_abdd461689df4983a3ad3b05d853cf5eb_cgraph.map
 delete mode 100644 db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_abdd461689df4983a3ad3b05d853cf5eb_cgraph.md5
 delete mode 100644 db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_abdd461689df4983a3ad3b05d853cf5eb_cgraph.svg
 delete mode 100644 db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_abdd461689df4983a3ad3b05d853cf5eb_cgraph_org.svg
 delete mode 100644 db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_af04a8f3536a52d8c9916086b656eefc2_cgraph.map
 delete mode 100644 db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_af04a8f3536a52d8c9916086b656eefc2_cgraph.md5
 delete mode 100644 db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_af04a8f3536a52d8c9916086b656eefc2_cgraph.svg
 delete mode 100644 db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_af04a8f3536a52d8c9916086b656eefc2_cgraph_org.svg
 delete mode 100644 db/d6b/kelvin__to__celsius_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 db/d6b/kelvin__to__celsius_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 db/d6b/kelvin__to__celsius_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 db/d6b/kelvin__to__celsius_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 db/d6b/kelvin__to__celsius_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 db/d6b/kelvin__to__celsius_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 db/d6b/kelvin__to__celsius_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 db/d6b/kelvin__to__celsius_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 db/d6b/kelvin__to__celsius_8cpp_source.html
 delete mode 100644 db/d71/quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 db/d71/quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 db/d71/quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 db/d71/quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 db/d71/quadratic__probing__hash__table_8cpp_source.html
 delete mode 100644 db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 db/d80/gale__shapley_8cpp_source.html
 delete mode 100644 db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.map
 delete mode 100644 db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.md5
 delete mode 100644 db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.svg
 delete mode 100644 db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph_org.svg
 delete mode 100644 db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.map
 delete mode 100644 db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.md5
 delete mode 100644 db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.svg
 delete mode 100644 db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph_org.svg
 delete mode 100644 db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.map
 delete mode 100644 db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.md5
 delete mode 100644 db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.svg
 delete mode 100644 db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph_org.svg
 delete mode 100644 db/d82/classlarge__number_a771e9b28cfddf1ad94668566e396e350_cgraph.map
 delete mode 100644 db/d82/classlarge__number_a771e9b28cfddf1ad94668566e396e350_cgraph.md5
 delete mode 100644 db/d82/classlarge__number_a771e9b28cfddf1ad94668566e396e350_cgraph.svg
 delete mode 100644 db/d82/classlarge__number_a771e9b28cfddf1ad94668566e396e350_cgraph_org.svg
 delete mode 100644 db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.map
 delete mode 100644 db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.md5
 delete mode 100644 db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.svg
 delete mode 100644 db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph_org.svg
 delete mode 100644 db/d82/classlarge__number_aab5644405094740e34983cedfecb36cf_cgraph.map
 delete mode 100644 db/d82/classlarge__number_aab5644405094740e34983cedfecb36cf_cgraph.md5
 delete mode 100644 db/d82/classlarge__number_aab5644405094740e34983cedfecb36cf_cgraph.svg
 delete mode 100644 db/d82/classlarge__number_aab5644405094740e34983cedfecb36cf_cgraph_org.svg
 delete mode 100644 db/d82/classlarge__number_ac09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph.map
 delete mode 100644 db/d82/classlarge__number_ac09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph.md5
 delete mode 100644 db/d82/classlarge__number_ac09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph.svg
 delete mode 100644 db/d82/classlarge__number_ac09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph_org.svg
 delete mode 100644 db/d82/classlarge__number_ae35a55607cf52c0b0d485f2129bd39ac_cgraph.map
 delete mode 100644 db/d82/classlarge__number_ae35a55607cf52c0b0d485f2129bd39ac_cgraph.md5
 delete mode 100644 db/d82/classlarge__number_ae35a55607cf52c0b0d485f2129bd39ac_cgraph.svg
 delete mode 100644 db/d82/classlarge__number_ae35a55607cf52c0b0d485f2129bd39ac_cgraph_org.svg
 delete mode 100644 db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.map
 delete mode 100644 db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.md5
 delete mode 100644 db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.svg
 delete mode 100644 db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph_org.svg
 delete mode 100644 db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 db/d93/check__prime_8cpp_source.html
 delete mode 100644 db/d9a/classuint128__t_a0b6612186d8f678452e011d08ee1f5ac_cgraph.map
 delete mode 100644 db/d9a/classuint128__t_a0b6612186d8f678452e011d08ee1f5ac_cgraph.md5
 delete mode 100644 db/d9a/classuint128__t_a0b6612186d8f678452e011d08ee1f5ac_cgraph.svg
 delete mode 100644 db/d9a/classuint128__t_a0b6612186d8f678452e011d08ee1f5ac_cgraph_org.svg
 delete mode 100644 db/d9a/classuint128__t_a279209a184db20a7ffc8e687fdb05be2_cgraph.map
 delete mode 100644 db/d9a/classuint128__t_a279209a184db20a7ffc8e687fdb05be2_cgraph.md5
 delete mode 100644 db/d9a/classuint128__t_a279209a184db20a7ffc8e687fdb05be2_cgraph.svg
 delete mode 100644 db/d9a/classuint128__t_a279209a184db20a7ffc8e687fdb05be2_cgraph_org.svg
 delete mode 100644 db/d9a/classuint128__t_a300ed88fe2054788cc6e0b6a8fdf66db_cgraph.map
 delete mode 100644 db/d9a/classuint128__t_a300ed88fe2054788cc6e0b6a8fdf66db_cgraph.md5
 delete mode 100644 db/d9a/classuint128__t_a300ed88fe2054788cc6e0b6a8fdf66db_cgraph.svg
 delete mode 100644 db/d9a/classuint128__t_a300ed88fe2054788cc6e0b6a8fdf66db_cgraph_org.svg
 delete mode 100644 db/d9a/classuint128__t_a3072a7e43da3600c345c81bc80c957ee_cgraph.map
 delete mode 100644 db/d9a/classuint128__t_a3072a7e43da3600c345c81bc80c957ee_cgraph.md5
 delete mode 100644 db/d9a/classuint128__t_a3072a7e43da3600c345c81bc80c957ee_cgraph.svg
 delete mode 100644 db/d9a/classuint128__t_a3072a7e43da3600c345c81bc80c957ee_cgraph_org.svg
 delete mode 100644 db/d9a/classuint128__t_a857a3c69c1e775a1bd3935c2bfbb02df_cgraph.map
 delete mode 100644 db/d9a/classuint128__t_a857a3c69c1e775a1bd3935c2bfbb02df_cgraph.md5
 delete mode 100644 db/d9a/classuint128__t_a857a3c69c1e775a1bd3935c2bfbb02df_cgraph.svg
 delete mode 100644 db/d9a/classuint128__t_a857a3c69c1e775a1bd3935c2bfbb02df_cgraph_org.svg
 delete mode 100644 db/d9a/classuint128__t_a8bf81f7f5f5c98f197822ec88e106c6c_cgraph.map
 delete mode 100644 db/d9a/classuint128__t_a8bf81f7f5f5c98f197822ec88e106c6c_cgraph.md5
 delete mode 100644 db/d9a/classuint128__t_a8bf81f7f5f5c98f197822ec88e106c6c_cgraph.svg
 delete mode 100644 db/d9a/classuint128__t_a8bf81f7f5f5c98f197822ec88e106c6c_cgraph_org.svg
 delete mode 100644 db/d9a/classuint128__t_abae08ef3c1d6dc512edd68ca68327f74_cgraph.map
 delete mode 100644 db/d9a/classuint128__t_abae08ef3c1d6dc512edd68ca68327f74_cgraph.md5
 delete mode 100644 db/d9a/classuint128__t_abae08ef3c1d6dc512edd68ca68327f74_cgraph.svg
 delete mode 100644 db/d9a/classuint128__t_abae08ef3c1d6dc512edd68ca68327f74_cgraph_org.svg
 delete mode 100644 db/d9a/classuint128__t_abfc6a8765039cacc829a5cd386b5a066_cgraph.map
 delete mode 100644 db/d9a/classuint128__t_abfc6a8765039cacc829a5cd386b5a066_cgraph.md5
 delete mode 100644 db/d9a/classuint128__t_abfc6a8765039cacc829a5cd386b5a066_cgraph.svg
 delete mode 100644 db/d9a/classuint128__t_abfc6a8765039cacc829a5cd386b5a066_cgraph_org.svg
 delete mode 100644 db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 db/d9f/iterative__factorial_8cpp_source.html
 delete mode 100644 db/da9/classqueue_a75e231798bc706b8b0773a07f78713e7_cgraph.map
 delete mode 100644 db/da9/classqueue_a75e231798bc706b8b0773a07f78713e7_cgraph.md5
 delete mode 100644 db/da9/classqueue_a75e231798bc706b8b0773a07f78713e7_cgraph.svg
 delete mode 100644 db/da9/classqueue_a75e231798bc706b8b0773a07f78713e7_cgraph_org.svg
 delete mode 100644 db/da9/classqueue_ac08ebdd38cb4ad74fc0a3f51888da604_cgraph.map
 delete mode 100644 db/da9/classqueue_ac08ebdd38cb4ad74fc0a3f51888da604_cgraph.md5
 delete mode 100644 db/da9/classqueue_ac08ebdd38cb4ad74fc0a3f51888da604_cgraph.svg
 delete mode 100644 db/da9/classqueue_ac08ebdd38cb4ad74fc0a3f51888da604_cgraph_org.svg
 delete mode 100644 db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph.map
 delete mode 100644 db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph.md5
 delete mode 100644 db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph.svg
 delete mode 100644 db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph_org.svg
 delete mode 100644 db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph.map
 delete mode 100644 db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph.md5
 delete mode 100644 db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph.svg
 delete mode 100644 db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph_org.svg
 create mode 100644 db/db2/counting__sort__string_8cpp_source.html
 create mode 100644 db/db5/slow__sort_8cpp_source.html
 delete mode 100644 db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
 delete mode 100644 db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
 delete mode 100644 db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
 delete mode 100644 db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
 delete mode 100644 db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map
 delete mode 100644 db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5
 delete mode 100644 db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg
 delete mode 100644 db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg
 delete mode 100644 db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.map
 delete mode 100644 db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.md5
 delete mode 100644 db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.svg
 delete mode 100644 db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph_org.svg
 create mode 100644 db/dbc/tree__234_8cpp_source.html
 create mode 100644 db/dbd/test__stack__students_8cpp_source.html
 delete mode 100644 db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.map
 delete mode 100644 db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.md5
 delete mode 100644 db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.svg
 delete mode 100644 db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph_org.svg
 delete mode 100644 db/dc4/floyd__cycle__detection__algo_8cpp_a81ffc7a2c6bf530c8a496864e7a3ad88_cgraph.map
 delete mode 100644 db/dc4/floyd__cycle__detection__algo_8cpp_a81ffc7a2c6bf530c8a496864e7a3ad88_cgraph.md5
 delete mode 100644 db/dc4/floyd__cycle__detection__algo_8cpp_a81ffc7a2c6bf530c8a496864e7a3ad88_cgraph.svg
 delete mode 100644 db/dc4/floyd__cycle__detection__algo_8cpp_a81ffc7a2c6bf530c8a496864e7a3ad88_cgraph_org.svg
 delete mode 100644 db/dc4/floyd__cycle__detection__algo_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 db/dc4/floyd__cycle__detection__algo_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 db/dc4/floyd__cycle__detection__algo_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 db/dc4/floyd__cycle__detection__algo_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 db/dc4/floyd__cycle__detection__algo_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 db/dc4/floyd__cycle__detection__algo_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 db/dc4/floyd__cycle__detection__algo_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 db/dc4/floyd__cycle__detection__algo_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 db/dc4/floyd__cycle__detection__algo_8cpp_source.html
 delete mode 100644 db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
 delete mode 100644 db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
 delete mode 100644 db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
 delete mode 100644 db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
 delete mode 100644 db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map
 delete mode 100644 db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5
 delete mode 100644 db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg
 delete mode 100644 db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph_org.svg
 delete mode 100644 db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map
 delete mode 100644 db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5
 delete mode 100644 db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg
 delete mode 100644 db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph_org.svg
 create mode 100644 db/dd3/ode__forward__euler_8cpp_source.html
 create mode 100644 db/de3/numeric__string__sort_8cpp_source.html
 delete mode 100644 db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 db/df3/happy__number_8cpp_source.html
 delete mode 100644 db/dfb/maximum__circular__subarray_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
 delete mode 100644 db/dfb/maximum__circular__subarray_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
 delete mode 100644 db/dfb/maximum__circular__subarray_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
 delete mode 100644 db/dfb/maximum__circular__subarray_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
 delete mode 100644 db/dfb/maximum__circular__subarray_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 db/dfb/maximum__circular__subarray_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 db/dfb/maximum__circular__subarray_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 db/dfb/maximum__circular__subarray_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 create mode 100644 db/dfb/maximum__circular__subarray_8cpp_source.html
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a01f3a05cf5abdc5d63999ef1bf9f9256_cgraph.map
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a01f3a05cf5abdc5d63999ef1bf9f9256_cgraph.md5
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a01f3a05cf5abdc5d63999ef1bf9f9256_cgraph.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a01f3a05cf5abdc5d63999ef1bf9f9256_cgraph_org.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a1fcb7db9bdeabd874712ec4f00483d17_cgraph.map
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a1fcb7db9bdeabd874712ec4f00483d17_cgraph.md5
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a1fcb7db9bdeabd874712ec4f00483d17_cgraph.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a1fcb7db9bdeabd874712ec4f00483d17_cgraph_org.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a42c986fb57b74fe1b7c5953cb1922c3d_cgraph.map
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a42c986fb57b74fe1b7c5953cb1922c3d_cgraph.md5
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a42c986fb57b74fe1b7c5953cb1922c3d_cgraph.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a42c986fb57b74fe1b7c5953cb1922c3d_cgraph_org.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a4aa49765cce39ce48b9241e993e0cfb9_cgraph.map
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a4aa49765cce39ce48b9241e993e0cfb9_cgraph.md5
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a4aa49765cce39ce48b9241e993e0cfb9_cgraph.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a4aa49765cce39ce48b9241e993e0cfb9_cgraph_org.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a562faa16a4b4ed5d4804823c56f99c9c_cgraph.map
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a562faa16a4b4ed5d4804823c56f99c9c_cgraph.md5
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a562faa16a4b4ed5d4804823c56f99c9c_cgraph.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a562faa16a4b4ed5d4804823c56f99c9c_cgraph_org.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a5d8eb669b37a27224376b08515b4ee50_cgraph.map
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a5d8eb669b37a27224376b08515b4ee50_cgraph.md5
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a5d8eb669b37a27224376b08515b4ee50_cgraph.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a5d8eb669b37a27224376b08515b4ee50_cgraph_org.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a60599668b56001cef4bb59d4cb5c6c6c_cgraph.map
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a60599668b56001cef4bb59d4cb5c6c6c_cgraph.md5
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a60599668b56001cef4bb59d4cb5c6c6c_cgraph.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a60599668b56001cef4bb59d4cb5c6c6c_cgraph_org.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a678681c9f6266a8219bd6bee6972d70e_cgraph.map
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a678681c9f6266a8219bd6bee6972d70e_cgraph.md5
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a678681c9f6266a8219bd6bee6972d70e_cgraph.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a678681c9f6266a8219bd6bee6972d70e_cgraph_org.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a87c2ed8f19bda2ad21ee4cbed32c394a_cgraph.map
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a87c2ed8f19bda2ad21ee4cbed32c394a_cgraph.md5
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a87c2ed8f19bda2ad21ee4cbed32c394a_cgraph.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a87c2ed8f19bda2ad21ee4cbed32c394a_cgraph_org.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ab6534125643a02c114bd4cddba9bc17f_cgraph.map
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ab6534125643a02c114bd4cddba9bc17f_cgraph.md5
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ab6534125643a02c114bd4cddba9bc17f_cgraph.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ab6534125643a02c114bd4cddba9bc17f_cgraph_org.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ad36ec1f1a97298e49de605384e5f8211_cgraph.map
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ad36ec1f1a97298e49de605384e5f8211_cgraph.md5
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ad36ec1f1a97298e49de605384e5f8211_cgraph.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ad36ec1f1a97298e49de605384e5f8211_cgraph_org.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae190115f8d4d31e47d7290e0b6871391_cgraph.map
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae190115f8d4d31e47d7290e0b6871391_cgraph.md5
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae190115f8d4d31e47d7290e0b6871391_cgraph.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae190115f8d4d31e47d7290e0b6871391_cgraph_org.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae4e183ec8eab778cb243e4ae0b22a0f1_cgraph.map
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae4e183ec8eab778cb243e4ae0b22a0f1_cgraph.md5
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae4e183ec8eab778cb243e4ae0b22a0f1_cgraph.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae4e183ec8eab778cb243e4ae0b22a0f1_cgraph_org.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_aedbe01e48a96fefa0b393ec577b0f19e_cgraph.map
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_aedbe01e48a96fefa0b393ec577b0f19e_cgraph.md5
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_aedbe01e48a96fefa0b393ec577b0f19e_cgraph.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_aedbe01e48a96fefa0b393ec577b0f19e_cgraph_org.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af09566a6a59d30875434c140e18e0a12_cgraph.map
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af09566a6a59d30875434c140e18e0a12_cgraph.md5
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af09566a6a59d30875434c140e18e0a12_cgraph.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af09566a6a59d30875434c140e18e0a12_cgraph_org.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af12ceffdc07cc87eca8a4a8ac87d60fe_cgraph.map
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af12ceffdc07cc87eca8a4a8ac87d60fe_cgraph.md5
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af12ceffdc07cc87eca8a4a8ac87d60fe_cgraph.svg
 delete mode 100644 dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af12ceffdc07cc87eca8a4a8ac87d60fe_cgraph_org.svg
 delete mode 100644 dc/d14/wildcard__matching_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 dc/d14/wildcard__matching_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 dc/d14/wildcard__matching_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 dc/d14/wildcard__matching_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 dc/d14/wildcard__matching_8cpp_source.html
 delete mode 100644 dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.map
 delete mode 100644 dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.md5
 delete mode 100644 dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.svg
 delete mode 100644 dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph_org.svg
 delete mode 100644 dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 dc/d1a/pascal__triangle_8cpp_source.html
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a01e6c7bf2b09272578b9c5819ce0f36f_cgraph.map
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a01e6c7bf2b09272578b9c5819ce0f36f_cgraph.md5
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a01e6c7bf2b09272578b9c5819ce0f36f_cgraph.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a01e6c7bf2b09272578b9c5819ce0f36f_cgraph_org.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a207b3a99fd5974d3117e0b0ac0aad234_cgraph.map
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a207b3a99fd5974d3117e0b0ac0aad234_cgraph.md5
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a207b3a99fd5974d3117e0b0ac0aad234_cgraph.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a207b3a99fd5974d3117e0b0ac0aad234_cgraph_org.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a42535e20e97d85aa61271e0894cc0359_cgraph.map
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a42535e20e97d85aa61271e0894cc0359_cgraph.md5
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a42535e20e97d85aa61271e0894cc0359_cgraph.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a42535e20e97d85aa61271e0894cc0359_cgraph_org.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.map
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.md5
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph_org.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a4a6a560dbdd0177633783b72db37dc19_cgraph.map
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a4a6a560dbdd0177633783b72db37dc19_cgraph.md5
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a4a6a560dbdd0177633783b72db37dc19_cgraph.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a4a6a560dbdd0177633783b72db37dc19_cgraph_org.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.map
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.md5
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph_org.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a865e8d26a01962cc93aca66e71346f37_cgraph.map
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a865e8d26a01962cc93aca66e71346f37_cgraph.md5
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a865e8d26a01962cc93aca66e71346f37_cgraph.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a865e8d26a01962cc93aca66e71346f37_cgraph_org.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_aaddc683af581b51351e1023d2a01ef3b_cgraph.map
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_aaddc683af581b51351e1023d2a01ef3b_cgraph.md5
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_aaddc683af581b51351e1023d2a01ef3b_cgraph.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_aaddc683af581b51351e1023d2a01ef3b_cgraph_org.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.map
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.md5
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph_org.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ae2edd40354a1ca7aeaee3d1e3589e713_cgraph.map
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ae2edd40354a1ca7aeaee3d1e3589e713_cgraph.md5
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ae2edd40354a1ca7aeaee3d1e3589e713_cgraph.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ae2edd40354a1ca7aeaee3d1e3589e713_cgraph_org.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_af7243bdc6ae3c7169f01b85bb226e66a_cgraph.map
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_af7243bdc6ae3c7169f01b85bb226e66a_cgraph.md5
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_af7243bdc6ae3c7169f01b85bb226e66a_cgraph.svg
 delete mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_af7243bdc6ae3c7169f01b85bb226e66a_cgraph_org.svg
 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_source.html
 create mode 100644 dc/d52/linear__recurrence__matrix_8cpp_source.html
 delete mode 100644 dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.map
 delete mode 100644 dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.md5
 delete mode 100644 dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.svg
 delete mode 100644 dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph_org.svg
 delete mode 100644 dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 dc/d5a/rat__maze_8cpp_source.html
 delete mode 100644 dc/d61/classgraph_1_1_graph_a3755ec9e6a842238c7f4aac10b661981_cgraph.map
 delete mode 100644 dc/d61/classgraph_1_1_graph_a3755ec9e6a842238c7f4aac10b661981_cgraph.md5
 delete mode 100644 dc/d61/classgraph_1_1_graph_a3755ec9e6a842238c7f4aac10b661981_cgraph.svg
 delete mode 100644 dc/d61/classgraph_1_1_graph_a3755ec9e6a842238c7f4aac10b661981_cgraph_org.svg
 delete mode 100644 dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph.map
 delete mode 100644 dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph.md5
 delete mode 100644 dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph.svg
 delete mode 100644 dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph_org.svg
 delete mode 100644 dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph.map
 delete mode 100644 dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph.md5
 delete mode 100644 dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph.svg
 delete mode 100644 dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph_org.svg
 delete mode 100644 dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.map
 delete mode 100644 dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.md5
 delete mode 100644 dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.svg
 delete mode 100644 dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph_org.svg
 delete mode 100644 dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.map
 delete mode 100644 dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.md5
 delete mode 100644 dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.svg
 delete mode 100644 dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph_org.svg
 delete mode 100644 dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 dc/d67/subset__sum__dynamic_8cpp_source.html
 delete mode 100644 dc/d6d/power__of__2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 dc/d6d/power__of__2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 dc/d6d/power__of__2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 dc/d6d/power__of__2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 dc/d6d/power__of__2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dc/d6d/power__of__2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dc/d6d/power__of__2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dc/d6d/power__of__2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 dc/d6d/power__of__2_8cpp_source.html
 delete mode 100644 dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 dc/d82/area_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dc/d82/area_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dc/d82/area_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dc/d82/area_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 dc/d82/area_8cpp_source.html
 delete mode 100644 dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph.map
 delete mode 100644 dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph.md5
 delete mode 100644 dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph.svg
 delete mode 100644 dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph_org.svg
 delete mode 100644 dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_af136ec31dbd35b1be2eb9a057677c704_cgraph.map
 delete mode 100644 dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_af136ec31dbd35b1be2eb9a057677c704_cgraph.md5
 delete mode 100644 dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_af136ec31dbd35b1be2eb9a057677c704_cgraph.svg
 delete mode 100644 dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_af136ec31dbd35b1be2eb9a057677c704_cgraph_org.svg
 delete mode 100644 dc/d93/trie__modern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dc/d93/trie__modern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dc/d93/trie__modern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dc/d93/trie__modern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 dc/d93/trie__modern_8cpp_source.html
 delete mode 100644 dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map
 delete mode 100644 dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
 delete mode 100644 dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
 delete mode 100644 dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg
 create mode 100644 dc/d9c/babylonian__method_8cpp_source.html
 delete mode 100644 dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 dc/daa/lru__cache2_8cpp_source.html
 delete mode 100644 dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph.map
 delete mode 100644 dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph.md5
 delete mode 100644 dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph.svg
 delete mode 100644 dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph_org.svg
 delete mode 100644 dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 dc/db5/text__search_8cpp_source.html
 create mode 100644 dc/dc5/paranthesis__matching_8cpp_source.html
 delete mode 100644 dc/dd4/classdata__structures_1_1_bloom_filter_a576db259488dbfb67624a9652a5ab08b_cgraph.map
 delete mode 100644 dc/dd4/classdata__structures_1_1_bloom_filter_a576db259488dbfb67624a9652a5ab08b_cgraph.md5
 delete mode 100644 dc/dd4/classdata__structures_1_1_bloom_filter_a576db259488dbfb67624a9652a5ab08b_cgraph.svg
 delete mode 100644 dc/dd4/classdata__structures_1_1_bloom_filter_a576db259488dbfb67624a9652a5ab08b_cgraph_org.svg
 delete mode 100644 dc/dd4/classdata__structures_1_1_bloom_filter_a67bed8ef62fcb1f33b6c72df47dcf840_cgraph.map
 delete mode 100644 dc/dd4/classdata__structures_1_1_bloom_filter_a67bed8ef62fcb1f33b6c72df47dcf840_cgraph.md5
 delete mode 100644 dc/dd4/classdata__structures_1_1_bloom_filter_a67bed8ef62fcb1f33b6c72df47dcf840_cgraph.svg
 delete mode 100644 dc/dd4/classdata__structures_1_1_bloom_filter_a67bed8ef62fcb1f33b6c72df47dcf840_cgraph_org.svg
 delete mode 100644 dc/dd9/strand__sort_8cpp_a2bea2fe5dd38ed63610fdeaddf5785cd_cgraph.map
 delete mode 100644 dc/dd9/strand__sort_8cpp_a2bea2fe5dd38ed63610fdeaddf5785cd_cgraph.md5
 delete mode 100644 dc/dd9/strand__sort_8cpp_a2bea2fe5dd38ed63610fdeaddf5785cd_cgraph.svg
 delete mode 100644 dc/dd9/strand__sort_8cpp_a2bea2fe5dd38ed63610fdeaddf5785cd_cgraph_org.svg
 delete mode 100644 dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 dc/dd9/strand__sort_8cpp_source.html
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 dc/de1/recursive__tree__traversal_8cpp_source.html
 delete mode 100644 dc/dfb/atbash__cipher_8cpp_a8f7dd4dcd3df7c512c20482afc2dbb9d_cgraph.map
 delete mode 100644 dc/dfb/atbash__cipher_8cpp_a8f7dd4dcd3df7c512c20482afc2dbb9d_cgraph.md5
 delete mode 100644 dc/dfb/atbash__cipher_8cpp_a8f7dd4dcd3df7c512c20482afc2dbb9d_cgraph.svg
 delete mode 100644 dc/dfb/atbash__cipher_8cpp_a8f7dd4dcd3df7c512c20482afc2dbb9d_cgraph_org.svg
 delete mode 100644 dc/dfb/atbash__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 dc/dfb/atbash__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 dc/dfb/atbash__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 dc/dfb/atbash__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 dc/dfb/atbash__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dc/dfb/atbash__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dc/dfb/atbash__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dc/dfb/atbash__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 dc/dfb/atbash__cipher_8cpp_source.html
 delete mode 100644 dc/dfe/ternary__search_8cpp_a93d0099db95022f1eb90ddfd68f73ead_cgraph.map
 delete mode 100644 dc/dfe/ternary__search_8cpp_a93d0099db95022f1eb90ddfd68f73ead_cgraph.md5
 delete mode 100644 dc/dfe/ternary__search_8cpp_a93d0099db95022f1eb90ddfd68f73ead_cgraph.svg
 delete mode 100644 dc/dfe/ternary__search_8cpp_a93d0099db95022f1eb90ddfd68f73ead_cgraph_org.svg
 delete mode 100644 dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.map
 delete mode 100644 dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.md5
 delete mode 100644 dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.svg
 delete mode 100644 dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph_org.svg
 create mode 100644 dc/dfe/ternary__search_8cpp_source.html
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.map
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.md5
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.svg
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph_org.svg
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.map
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.md5
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.map
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.md5
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.svg
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph_org.svg
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg
 delete mode 100644 dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg
 create mode 100644 dd/d0c/hamiltons__cycle_8cpp_source.html
 delete mode 100644 dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph.map
 delete mode 100644 dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph.md5
 delete mode 100644 dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph.svg
 delete mode 100644 dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph_org.svg
 delete mode 100644 dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
 delete mode 100644 dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
 delete mode 100644 dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
 delete mode 100644 dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
 delete mode 100644 dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 dd/d0d/insertion__sort_8cpp_source.html
 delete mode 100644 dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.map
 delete mode 100644 dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.md5
 delete mode 100644 dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.svg
 delete mode 100644 dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph_org.svg
 delete mode 100644 dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph.map
 delete mode 100644 dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph.md5
 delete mode 100644 dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph.svg
 delete mode 100644 dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph_org.svg
 delete mode 100644 dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
 delete mode 100644 dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
 delete mode 100644 dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
 delete mode 100644 dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
 delete mode 100644 dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 dd/d12/vigenere__cipher_8cpp_source.html
 delete mode 100644 dd/d1c/classhash__chain_a55aa5c6753cb8853152d469c375d946a_cgraph.map
 delete mode 100644 dd/d1c/classhash__chain_a55aa5c6753cb8853152d469c375d946a_cgraph.md5
 delete mode 100644 dd/d1c/classhash__chain_a55aa5c6753cb8853152d469c375d946a_cgraph.svg
 delete mode 100644 dd/d1c/classhash__chain_a55aa5c6753cb8853152d469c375d946a_cgraph_org.svg
 delete mode 100644 dd/d1c/classhash__chain_a6b4b4de1a8c96f98a63a77f650a9dcff_cgraph.map
 delete mode 100644 dd/d1c/classhash__chain_a6b4b4de1a8c96f98a63a77f650a9dcff_cgraph.md5
 delete mode 100644 dd/d1c/classhash__chain_a6b4b4de1a8c96f98a63a77f650a9dcff_cgraph.svg
 delete mode 100644 dd/d1c/classhash__chain_a6b4b4de1a8c96f98a63a77f650a9dcff_cgraph_org.svg
 delete mode 100644 dd/d1c/classhash__chain_a706964ad13587fc9a8b3fe8381d410ed_cgraph.map
 delete mode 100644 dd/d1c/classhash__chain_a706964ad13587fc9a8b3fe8381d410ed_cgraph.md5
 delete mode 100644 dd/d1c/classhash__chain_a706964ad13587fc9a8b3fe8381d410ed_cgraph.svg
 delete mode 100644 dd/d1c/classhash__chain_a706964ad13587fc9a8b3fe8381d410ed_cgraph_org.svg
 delete mode 100644 dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph.map
 delete mode 100644 dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph.md5
 delete mode 100644 dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph.svg
 delete mode 100644 dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph_org.svg
 delete mode 100644 dd/d1e/generate__parentheses_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 dd/d1e/generate__parentheses_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 dd/d1e/generate__parentheses_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 dd/d1e/generate__parentheses_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 dd/d1e/generate__parentheses_8cpp_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dd/d1e/generate__parentheses_8cpp_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dd/d1e/generate__parentheses_8cpp_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dd/d1e/generate__parentheses_8cpp_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 dd/d1e/generate__parentheses_8cpp_source.html
 delete mode 100644 dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph.map
 delete mode 100644 dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph.md5
 delete mode 100644 dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph.svg
 delete mode 100644 dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph_org.svg
 delete mode 100644 dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph.map
 delete mode 100644 dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph.md5
 delete mode 100644 dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph.svg
 delete mode 100644 dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph_org.svg
 delete mode 100644 dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph.map
 delete mode 100644 dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph.md5
 delete mode 100644 dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph.svg
 delete mode 100644 dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph_org.svg
 delete mode 100644 dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph.map
 delete mode 100644 dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph.md5
 delete mode 100644 dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph.svg
 delete mode 100644 dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph_org.svg
 delete mode 100644 dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph.map
 delete mode 100644 dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph.md5
 delete mode 100644 dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph.svg
 delete mode 100644 dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph_org.svg
 delete mode 100644 dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph.map
 delete mode 100644 dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph.md5
 delete mode 100644 dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph.svg
 delete mode 100644 dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph_org.svg
 delete mode 100644 dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph.map
 delete mode 100644 dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph.md5
 delete mode 100644 dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph.svg
 delete mode 100644 dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph_org.svg
 delete mode 100644 dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph.map
 delete mode 100644 dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph.md5
 delete mode 100644 dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph.svg
 delete mode 100644 dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph_org.svg
 delete mode 100644 dd/d24/namespacedynamic__programming_a066e0e739e7c276eee6e61d5b4d37ce8_cgraph.map
 delete mode 100644 dd/d24/namespacedynamic__programming_a066e0e739e7c276eee6e61d5b4d37ce8_cgraph.md5
 delete mode 100644 dd/d24/namespacedynamic__programming_a066e0e739e7c276eee6e61d5b4d37ce8_cgraph.svg
 delete mode 100644 dd/d24/namespacedynamic__programming_a066e0e739e7c276eee6e61d5b4d37ce8_cgraph_org.svg
 delete mode 100644 dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph.map
 delete mode 100644 dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph.md5
 delete mode 100644 dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph.svg
 delete mode 100644 dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph_org.svg
 delete mode 100644 dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph.map
 delete mode 100644 dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph.md5
 delete mode 100644 dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph.svg
 delete mode 100644 dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph_org.svg
 delete mode 100644 dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.map
 delete mode 100644 dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.md5
 delete mode 100644 dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.svg
 delete mode 100644 dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph_org.svg
 delete mode 100644 dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph.map
 delete mode 100644 dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph.md5
 delete mode 100644 dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph.svg
 delete mode 100644 dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph_org.svg
 delete mode 100644 dd/d29/false__position_8cpp_a7d69b49dc37da1c02b3ab8c7fe783494_cgraph.map
 delete mode 100644 dd/d29/false__position_8cpp_a7d69b49dc37da1c02b3ab8c7fe783494_cgraph.md5
 delete mode 100644 dd/d29/false__position_8cpp_a7d69b49dc37da1c02b3ab8c7fe783494_cgraph.svg
 delete mode 100644 dd/d29/false__position_8cpp_a7d69b49dc37da1c02b3ab8c7fe783494_cgraph_org.svg
 delete mode 100644 dd/d29/false__position_8cpp_a85a6ec58b5064d63d4f0df3854496713_cgraph.map
 delete mode 100644 dd/d29/false__position_8cpp_a85a6ec58b5064d63d4f0df3854496713_cgraph.md5
 delete mode 100644 dd/d29/false__position_8cpp_a85a6ec58b5064d63d4f0df3854496713_cgraph.svg
 delete mode 100644 dd/d29/false__position_8cpp_a85a6ec58b5064d63d4f0df3854496713_cgraph_org.svg
 delete mode 100644 dd/d29/false__position_8cpp_a85cb7bfb90abc898e042d624372c5345_cgraph.map
 delete mode 100644 dd/d29/false__position_8cpp_a85cb7bfb90abc898e042d624372c5345_cgraph.md5
 delete mode 100644 dd/d29/false__position_8cpp_a85cb7bfb90abc898e042d624372c5345_cgraph.svg
 delete mode 100644 dd/d29/false__position_8cpp_a85cb7bfb90abc898e042d624372c5345_cgraph_org.svg
 create mode 100644 dd/d29/false__position_8cpp_source.html
 delete mode 100644 dd/d2f/class_trie_a26941759ecf94d67a27d4a610bc0f63d_cgraph.map
 delete mode 100644 dd/d2f/class_trie_a26941759ecf94d67a27d4a610bc0f63d_cgraph.md5
 delete mode 100644 dd/d2f/class_trie_a26941759ecf94d67a27d4a610bc0f63d_cgraph.svg
 delete mode 100644 dd/d2f/class_trie_a26941759ecf94d67a27d4a610bc0f63d_cgraph_org.svg
 delete mode 100644 dd/d2f/class_trie_afd8b79959009b554e98ea7128b2886f2_cgraph.map
 delete mode 100644 dd/d2f/class_trie_afd8b79959009b554e98ea7128b2886f2_cgraph.md5
 delete mode 100644 dd/d2f/class_trie_afd8b79959009b554e98ea7128b2886f2_cgraph.svg
 delete mode 100644 dd/d2f/class_trie_afd8b79959009b554e98ea7128b2886f2_cgraph_org.svg
 delete mode 100644 dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.map
 delete mode 100644 dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.md5
 delete mode 100644 dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.svg
 delete mode 100644 dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph_org.svg
 delete mode 100644 dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.map
 delete mode 100644 dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.md5
 delete mode 100644 dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.svg
 delete mode 100644 dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph_org.svg
 delete mode 100644 dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.map
 delete mode 100644 dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.md5
 delete mode 100644 dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.svg
 delete mode 100644 dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph_org.svg
 delete mode 100644 dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.map
 delete mode 100644 dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.md5
 delete mode 100644 dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.svg
 delete mode 100644 dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph_org.svg
 delete mode 100644 dd/d47/namespacemath_a34d66a77c19ce9b8b3a3d14352b34551_cgraph.map
 delete mode 100644 dd/d47/namespacemath_a34d66a77c19ce9b8b3a3d14352b34551_cgraph.md5
 delete mode 100644 dd/d47/namespacemath_a34d66a77c19ce9b8b3a3d14352b34551_cgraph.svg
 delete mode 100644 dd/d47/namespacemath_a34d66a77c19ce9b8b3a3d14352b34551_cgraph_org.svg
 delete mode 100644 dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.map
 delete mode 100644 dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.md5
 delete mode 100644 dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.svg
 delete mode 100644 dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph_org.svg
 delete mode 100644 dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.map
 delete mode 100644 dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.md5
 delete mode 100644 dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.svg
 delete mode 100644 dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph_org.svg
 delete mode 100644 dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.map
 delete mode 100644 dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.md5
 delete mode 100644 dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.svg
 delete mode 100644 dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph_org.svg
 delete mode 100644 dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.map
 delete mode 100644 dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.md5
 delete mode 100644 dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.svg
 delete mode 100644 dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph_org.svg
 delete mode 100644 dd/d47/namespacemath_a7e78996673df791014cfe540b183456a_cgraph.map
 delete mode 100644 dd/d47/namespacemath_a7e78996673df791014cfe540b183456a_cgraph.md5
 delete mode 100644 dd/d47/namespacemath_a7e78996673df791014cfe540b183456a_cgraph.svg
 delete mode 100644 dd/d47/namespacemath_a7e78996673df791014cfe540b183456a_cgraph_org.svg
 delete mode 100644 dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph.map
 delete mode 100644 dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph.md5
 delete mode 100644 dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph.svg
 delete mode 100644 dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph_org.svg
 delete mode 100644 dd/d47/namespacemath_a91366864111e1fac29722ca45e02ea8f_cgraph.map
 delete mode 100644 dd/d47/namespacemath_a91366864111e1fac29722ca45e02ea8f_cgraph.md5
 delete mode 100644 dd/d47/namespacemath_a91366864111e1fac29722ca45e02ea8f_cgraph.svg
 delete mode 100644 dd/d47/namespacemath_a91366864111e1fac29722ca45e02ea8f_cgraph_org.svg
 delete mode 100644 dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.map
 delete mode 100644 dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.md5
 delete mode 100644 dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.svg
 delete mode 100644 dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph_org.svg
 delete mode 100644 dd/d47/namespacemath_aacb1411ef2029e81f249c21e17c96fdb_cgraph.map
 delete mode 100644 dd/d47/namespacemath_aacb1411ef2029e81f249c21e17c96fdb_cgraph.md5
 delete mode 100644 dd/d47/namespacemath_aacb1411ef2029e81f249c21e17c96fdb_cgraph.svg
 delete mode 100644 dd/d47/namespacemath_aacb1411ef2029e81f249c21e17c96fdb_cgraph_org.svg
 delete mode 100644 dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.map
 delete mode 100644 dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.md5
 delete mode 100644 dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.svg
 delete mode 100644 dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph_org.svg
 delete mode 100644 dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.map
 delete mode 100644 dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.md5
 delete mode 100644 dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.svg
 delete mode 100644 dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph_org.svg
 delete mode 100644 dd/d47/namespacemath_abf7f2a6d91f1ca6c89698792aea3f188_cgraph.map
 delete mode 100644 dd/d47/namespacemath_abf7f2a6d91f1ca6c89698792aea3f188_cgraph.md5
 delete mode 100644 dd/d47/namespacemath_abf7f2a6d91f1ca6c89698792aea3f188_cgraph.svg
 delete mode 100644 dd/d47/namespacemath_abf7f2a6d91f1ca6c89698792aea3f188_cgraph_org.svg
 delete mode 100644 dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.map
 delete mode 100644 dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.md5
 delete mode 100644 dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.svg
 delete mode 100644 dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph_org.svg
 delete mode 100644 dd/d47/namespacemath_ad09d59850865012a6fd95d89954c82e4_cgraph.map
 delete mode 100644 dd/d47/namespacemath_ad09d59850865012a6fd95d89954c82e4_cgraph.md5
 delete mode 100644 dd/d47/namespacemath_ad09d59850865012a6fd95d89954c82e4_cgraph.svg
 delete mode 100644 dd/d47/namespacemath_ad09d59850865012a6fd95d89954c82e4_cgraph_org.svg
 delete mode 100644 dd/d47/namespacemath_ae413098478fa38acaac887b7654f0725_cgraph.map
 delete mode 100644 dd/d47/namespacemath_ae413098478fa38acaac887b7654f0725_cgraph.md5
 delete mode 100644 dd/d47/namespacemath_ae413098478fa38acaac887b7654f0725_cgraph.svg
 delete mode 100644 dd/d47/namespacemath_ae413098478fa38acaac887b7654f0725_cgraph_org.svg
 delete mode 100644 dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
 delete mode 100644 dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
 delete mode 100644 dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
 delete mode 100644 dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
 delete mode 100644 dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
 delete mode 100644 dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
 delete mode 100644 dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
 delete mode 100644 dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
 delete mode 100644 dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
 delete mode 100644 dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
 delete mode 100644 dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
 delete mode 100644 dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
 delete mode 100644 dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.map
 delete mode 100644 dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.md5
 delete mode 100644 dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.svg
 delete mode 100644 dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph_org.svg
 create mode 100644 dd/d65/lu__decompose_8cpp_source.html
 delete mode 100644 dd/d89/insertion__sort__recursive_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 dd/d89/insertion__sort__recursive_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 dd/d89/insertion__sort__recursive_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 dd/d89/insertion__sort__recursive_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 dd/d89/insertion__sort__recursive_8cpp_a59914553f24088342c139645a02a8a49_cgraph.map
 delete mode 100644 dd/d89/insertion__sort__recursive_8cpp_a59914553f24088342c139645a02a8a49_cgraph.md5
 delete mode 100644 dd/d89/insertion__sort__recursive_8cpp_a59914553f24088342c139645a02a8a49_cgraph.svg
 delete mode 100644 dd/d89/insertion__sort__recursive_8cpp_a59914553f24088342c139645a02a8a49_cgraph_org.svg
 delete mode 100644 dd/d89/insertion__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dd/d89/insertion__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dd/d89/insertion__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dd/d89/insertion__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 dd/d89/insertion__sort__recursive_8cpp_source.html
 delete mode 100644 dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 dd/d92/memory__game_8cpp_source.html
 delete mode 100644 dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.map
 delete mode 100644 dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.md5
 delete mode 100644 dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.svg
 delete mode 100644 dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph_org.svg
 delete mode 100644 dd/d95/classdata__structures_1_1_segment_tree_a2a04f1832c5ce86def50c3021b2ab6b1_cgraph.map
 delete mode 100644 dd/d95/classdata__structures_1_1_segment_tree_a2a04f1832c5ce86def50c3021b2ab6b1_cgraph.md5
 delete mode 100644 dd/d95/classdata__structures_1_1_segment_tree_a2a04f1832c5ce86def50c3021b2ab6b1_cgraph.svg
 delete mode 100644 dd/d95/classdata__structures_1_1_segment_tree_a2a04f1832c5ce86def50c3021b2ab6b1_cgraph_org.svg
 delete mode 100644 dd/d95/classdata__structures_1_1_segment_tree_a8fecc48e8e3f6f5f6e728495a4282e52_cgraph.map
 delete mode 100644 dd/d95/classdata__structures_1_1_segment_tree_a8fecc48e8e3f6f5f6e728495a4282e52_cgraph.md5
 delete mode 100644 dd/d95/classdata__structures_1_1_segment_tree_a8fecc48e8e3f6f5f6e728495a4282e52_cgraph.svg
 delete mode 100644 dd/d95/classdata__structures_1_1_segment_tree_a8fecc48e8e3f6f5f6e728495a4282e52_cgraph_org.svg
 delete mode 100644 dd/d95/classdata__structures_1_1_segment_tree_ad0e78179ab979ae2bc4304bdc181db17_cgraph.map
 delete mode 100644 dd/d95/classdata__structures_1_1_segment_tree_ad0e78179ab979ae2bc4304bdc181db17_cgraph.md5
 delete mode 100644 dd/d95/classdata__structures_1_1_segment_tree_ad0e78179ab979ae2bc4304bdc181db17_cgraph.svg
 delete mode 100644 dd/d95/classdata__structures_1_1_segment_tree_ad0e78179ab979ae2bc4304bdc181db17_cgraph_org.svg
 delete mode 100644 dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph.map
 delete mode 100644 dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph.md5
 delete mode 100644 dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph.svg
 delete mode 100644 dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph_org.svg
 delete mode 100644 dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph.map
 delete mode 100644 dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph.md5
 delete mode 100644 dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph.svg
 delete mode 100644 dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph_org.svg
 delete mode 100644 dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph.map
 delete mode 100644 dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph.md5
 delete mode 100644 dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph.svg
 delete mode 100644 dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph_org.svg
 delete mode 100644 dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph.map
 delete mode 100644 dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph.md5
 delete mode 100644 dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph.svg
 delete mode 100644 dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph_org.svg
 delete mode 100644 dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.map
 delete mode 100644 dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.md5
 delete mode 100644 dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg
 delete mode 100644 dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph_org.svg
 delete mode 100644 dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.map
 delete mode 100644 dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.md5
 delete mode 100644 dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg
 delete mode 100644 dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph_org.svg
 delete mode 100644 dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.map
 delete mode 100644 dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.md5
 delete mode 100644 dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg
 delete mode 100644 dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph_org.svg
 create mode 100644 dd/da8/pigeonhole__sort_8cpp_source.html
 create mode 100644 dd/dc3/is__graph__bipartite2_8cpp_source.html
 delete mode 100644 dd/dca/class_f_c_f_s_a8fbfe4d85f7576b4a7aade07d29fbd69_cgraph.map
 delete mode 100644 dd/dca/class_f_c_f_s_a8fbfe4d85f7576b4a7aade07d29fbd69_cgraph.md5
 delete mode 100644 dd/dca/class_f_c_f_s_a8fbfe4d85f7576b4a7aade07d29fbd69_cgraph.svg
 delete mode 100644 dd/dca/class_f_c_f_s_a8fbfe4d85f7576b4a7aade07d29fbd69_cgraph_org.svg
 delete mode 100644 dd/dca/class_f_c_f_s_abb361a612b18bb189aa6d3c49288b793_cgraph.map
 delete mode 100644 dd/dca/class_f_c_f_s_abb361a612b18bb189aa6d3c49288b793_cgraph.md5
 delete mode 100644 dd/dca/class_f_c_f_s_abb361a612b18bb189aa6d3c49288b793_cgraph.svg
 delete mode 100644 dd/dca/class_f_c_f_s_abb361a612b18bb189aa6d3c49288b793_cgraph_org.svg
 create mode 100644 dd/dd5/swap__sort_8cpp_source.html
 delete mode 100644 dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.map
 delete mode 100644 dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.md5
 delete mode 100644 dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.svg
 delete mode 100644 dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph_org.svg
 delete mode 100644 dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.map
 delete mode 100644 dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.md5
 delete mode 100644 dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.svg
 delete mode 100644 dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph_org.svg
 create mode 100644 dd/dec/a__star__search_8cpp_source.html
 delete mode 100644 de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_cgraph.map
 delete mode 100644 de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_cgraph.md5
 delete mode 100644 de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_cgraph.svg
 delete mode 100644 de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_cgraph_org.svg
 delete mode 100644 de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a816cda7e563198f778fd32e03992763b_cgraph.map
 delete mode 100644 de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a816cda7e563198f778fd32e03992763b_cgraph.md5
 delete mode 100644 de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a816cda7e563198f778fd32e03992763b_cgraph.svg
 delete mode 100644 de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a816cda7e563198f778fd32e03992763b_cgraph_org.svg
 delete mode 100644 de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 de/d07/cycle__sort_8cpp_ae79a9d247691fce0d655fce75f1c04fa_cgraph.map
 delete mode 100644 de/d07/cycle__sort_8cpp_ae79a9d247691fce0d655fce75f1c04fa_cgraph.md5
 delete mode 100644 de/d07/cycle__sort_8cpp_ae79a9d247691fce0d655fce75f1c04fa_cgraph.svg
 delete mode 100644 de/d07/cycle__sort_8cpp_ae79a9d247691fce0d655fce75f1c04fa_cgraph_org.svg
 create mode 100644 de/d07/cycle__sort_8cpp_source.html
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_a0914a4b1401a7c427de91c92885724fe_cgraph.map
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_a0914a4b1401a7c427de91c92885724fe_cgraph.md5
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_a0914a4b1401a7c427de91c92885724fe_cgraph.svg
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_a0914a4b1401a7c427de91c92885724fe_cgraph_org.svg
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_a19dea5e88bbd7683a719030623315de9_cgraph.map
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_a19dea5e88bbd7683a719030623315de9_cgraph.md5
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_a19dea5e88bbd7683a719030623315de9_cgraph.svg
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_a19dea5e88bbd7683a719030623315de9_cgraph_org.svg
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_a1fa0559d987fde0044761b17b35f5abd_cgraph.map
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_a1fa0559d987fde0044761b17b35f5abd_cgraph.md5
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_a1fa0559d987fde0044761b17b35f5abd_cgraph.svg
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_a1fa0559d987fde0044761b17b35f5abd_cgraph_org.svg
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_a5ea37183524553bbf2234a36a44a4b9a_cgraph.map
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_a5ea37183524553bbf2234a36a44a4b9a_cgraph.md5
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_a5ea37183524553bbf2234a36a44a4b9a_cgraph.svg
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_a5ea37183524553bbf2234a36a44a4b9a_cgraph_org.svg
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_aef7ba885b91af093e9e514358fa0f36c_cgraph.map
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_aef7ba885b91af093e9e514358fa0f36c_cgraph.md5
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_aef7ba885b91af093e9e514358fa0f36c_cgraph.svg
 delete mode 100644 de/d0d/classrange__queries_1_1fenwick__tree_aef7ba885b91af093e9e514358fa0f36c_cgraph_org.svg
 delete mode 100644 de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph.map
 delete mode 100644 de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph.md5
 delete mode 100644 de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph.svg
 delete mode 100644 de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph_org.svg
 delete mode 100644 de/d0d/fibonacci__search_8cpp_a2aa09bef74ee063c1331de0883af4f4f_cgraph.map
 delete mode 100644 de/d0d/fibonacci__search_8cpp_a2aa09bef74ee063c1331de0883af4f4f_cgraph.md5
 delete mode 100644 de/d0d/fibonacci__search_8cpp_a2aa09bef74ee063c1331de0883af4f4f_cgraph.svg
 delete mode 100644 de/d0d/fibonacci__search_8cpp_a2aa09bef74ee063c1331de0883af4f4f_cgraph_org.svg
 delete mode 100644 de/d0d/fibonacci__search_8cpp_a5e144326104e57a3808aed7eb098db0d_cgraph.map
 delete mode 100644 de/d0d/fibonacci__search_8cpp_a5e144326104e57a3808aed7eb098db0d_cgraph.md5
 delete mode 100644 de/d0d/fibonacci__search_8cpp_a5e144326104e57a3808aed7eb098db0d_cgraph.svg
 delete mode 100644 de/d0d/fibonacci__search_8cpp_a5e144326104e57a3808aed7eb098db0d_cgraph_org.svg
 delete mode 100644 de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 de/d0d/fibonacci__search_8cpp_source.html
 create mode 100644 de/d1e/armstrong__number_8cpp_source.html
 delete mode 100644 de/d23/disjoint__set_8cpp_a2fb0a7cd26a477e2d48ba7e0118bc985_cgraph.map
 delete mode 100644 de/d23/disjoint__set_8cpp_a2fb0a7cd26a477e2d48ba7e0118bc985_cgraph.md5
 delete mode 100644 de/d23/disjoint__set_8cpp_a2fb0a7cd26a477e2d48ba7e0118bc985_cgraph.svg
 delete mode 100644 de/d23/disjoint__set_8cpp_a2fb0a7cd26a477e2d48ba7e0118bc985_cgraph_org.svg
 delete mode 100644 de/d23/disjoint__set_8cpp_a34b9ead0608e676d9ae5188672427cc8_cgraph.map
 delete mode 100644 de/d23/disjoint__set_8cpp_a34b9ead0608e676d9ae5188672427cc8_cgraph.md5
 delete mode 100644 de/d23/disjoint__set_8cpp_a34b9ead0608e676d9ae5188672427cc8_cgraph.svg
 delete mode 100644 de/d23/disjoint__set_8cpp_a34b9ead0608e676d9ae5188672427cc8_cgraph_org.svg
 delete mode 100644 de/d23/disjoint__set_8cpp_a44481bb75386fbb0f958a388d4b9f757_cgraph.map
 delete mode 100644 de/d23/disjoint__set_8cpp_a44481bb75386fbb0f958a388d4b9f757_cgraph.md5
 delete mode 100644 de/d23/disjoint__set_8cpp_a44481bb75386fbb0f958a388d4b9f757_cgraph.svg
 delete mode 100644 de/d23/disjoint__set_8cpp_a44481bb75386fbb0f958a388d4b9f757_cgraph_org.svg
 delete mode 100644 de/d23/disjoint__set_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 de/d23/disjoint__set_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 de/d23/disjoint__set_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 de/d23/disjoint__set_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 de/d23/disjoint__set_8cpp_source.html
 delete mode 100644 de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 de/d33/circular__linked__list_8cpp_source.html
 create mode 100644 de/d40/shell__sort_8cpp_source.html
 delete mode 100644 de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph.map
 delete mode 100644 de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph.md5
 delete mode 100644 de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph.svg
 delete mode 100644 de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph_org.svg
 delete mode 100644 de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.map
 delete mode 100644 de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.md5
 delete mode 100644 de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.svg
 delete mode 100644 de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph_org.svg
 delete mode 100644 de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 de/d47/string__fibonacci_8cpp_source.html
 create mode 100644 de/d5b/queue__using__linkedlist_8cpp_source.html
 create mode 100644 de/d6a/knuth__morris__pratt_8cpp_source.html
 delete mode 100644 de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph.map
 delete mode 100644 de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph.md5
 delete mode 100644 de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph.svg
 delete mode 100644 de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph_org.svg
 delete mode 100644 de/d72/geometric__dist_8cpp_a82964ca6180507deb5fafc71050012ba_cgraph.map
 delete mode 100644 de/d72/geometric__dist_8cpp_a82964ca6180507deb5fafc71050012ba_cgraph.md5
 delete mode 100644 de/d72/geometric__dist_8cpp_a82964ca6180507deb5fafc71050012ba_cgraph.svg
 delete mode 100644 de/d72/geometric__dist_8cpp_a82964ca6180507deb5fafc71050012ba_cgraph_org.svg
 delete mode 100644 de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 de/d72/geometric__dist_8cpp_source.html
 delete mode 100644 de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
 delete mode 100644 de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
 delete mode 100644 de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
 delete mode 100644 de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
 delete mode 100644 de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
 delete mode 100644 de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
 delete mode 100644 de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
 delete mode 100644 de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
 delete mode 100644 de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
 delete mode 100644 de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
 delete mode 100644 de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
 delete mode 100644 de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
 delete mode 100644 de/d75/qr__eigen__values_8cpp_a9bbf469d5525a816b0d6ca812119093d_cgraph.map
 delete mode 100644 de/d75/qr__eigen__values_8cpp_a9bbf469d5525a816b0d6ca812119093d_cgraph.md5
 delete mode 100644 de/d75/qr__eigen__values_8cpp_a9bbf469d5525a816b0d6ca812119093d_cgraph.svg
 delete mode 100644 de/d75/qr__eigen__values_8cpp_a9bbf469d5525a816b0d6ca812119093d_cgraph_org.svg
 create mode 100644 de/d75/qr__eigen__values_8cpp_source.html
 create mode 100644 de/d77/tree__height_8cpp_source.html
 create mode 100644 de/d79/graham__scan__algorithm_8cpp_source.html
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.map
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.md5
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.svg
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph_org.svg
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.map
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.md5
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.svg
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph_org.svg
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.map
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.md5
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.svg
 delete mode 100644 de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph_org.svg
 create mode 100644 de/d7b/merge__insertion__sort_8cpp_source.html
 delete mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.map
 delete mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.md5
 delete mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.svg
 delete mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph_org.svg
 delete mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.map
 delete mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.md5
 delete mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.svg
 delete mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph_org.svg
 delete mode 100644 de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 de/d85/decimal__to__roman__numeral_8cpp_source.html
 delete mode 100644 de/d88/travelling__salesman__problem_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 de/d88/travelling__salesman__problem_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 de/d88/travelling__salesman__problem_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 de/d88/travelling__salesman__problem_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 de/d88/travelling__salesman__problem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 de/d88/travelling__salesman__problem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 de/d88/travelling__salesman__problem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 de/d88/travelling__salesman__problem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 de/d88/travelling__salesman__problem_8cpp_source.html
 create mode 100644 de/d8c/partition__problem_8cpp_source.html
 delete mode 100644 de/d99/aliquot__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 de/d99/aliquot__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 de/d99/aliquot__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 de/d99/aliquot__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 de/d99/aliquot__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 de/d99/aliquot__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 de/d99/aliquot__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 de/d99/aliquot__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 de/d99/aliquot__sum_8cpp_source.html
 delete mode 100644 de/d9b/prime__numbers_8cpp_a9575f3a51eeb8a57d657b3db6a4b441a_cgraph.map
 delete mode 100644 de/d9b/prime__numbers_8cpp_a9575f3a51eeb8a57d657b3db6a4b441a_cgraph.md5
 delete mode 100644 de/d9b/prime__numbers_8cpp_a9575f3a51eeb8a57d657b3db6a4b441a_cgraph.svg
 delete mode 100644 de/d9b/prime__numbers_8cpp_a9575f3a51eeb8a57d657b3db6a4b441a_cgraph_org.svg
 delete mode 100644 de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 de/d9b/prime__numbers_8cpp_source.html
 delete mode 100644 de/dab/ncr__modulo__p_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 de/dab/ncr__modulo__p_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 de/dab/ncr__modulo__p_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 de/dab/ncr__modulo__p_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 de/dab/ncr__modulo__p_8cpp_a6c7bfe3bdaa086d32261a5c5584d0fa9_cgraph.map
 delete mode 100644 de/dab/ncr__modulo__p_8cpp_a6c7bfe3bdaa086d32261a5c5584d0fa9_cgraph.md5
 delete mode 100644 de/dab/ncr__modulo__p_8cpp_a6c7bfe3bdaa086d32261a5c5584d0fa9_cgraph.svg
 delete mode 100644 de/dab/ncr__modulo__p_8cpp_a6c7bfe3bdaa086d32261a5c5584d0fa9_cgraph_org.svg
 delete mode 100644 de/dab/ncr__modulo__p_8cpp_a9010ad5669d31449c3bf3271ab5ebc86_cgraph.map
 delete mode 100644 de/dab/ncr__modulo__p_8cpp_a9010ad5669d31449c3bf3271ab5ebc86_cgraph.md5
 delete mode 100644 de/dab/ncr__modulo__p_8cpp_a9010ad5669d31449c3bf3271ab5ebc86_cgraph.svg
 delete mode 100644 de/dab/ncr__modulo__p_8cpp_a9010ad5669d31449c3bf3271ab5ebc86_cgraph_org.svg
 create mode 100644 de/dab/ncr__modulo__p_8cpp_source.html
 delete mode 100644 de/db6/a1z26__cipher_8cpp_a0a78954e96c862430904ee3e64623c38_cgraph.map
 delete mode 100644 de/db6/a1z26__cipher_8cpp_a0a78954e96c862430904ee3e64623c38_cgraph.md5
 delete mode 100644 de/db6/a1z26__cipher_8cpp_a0a78954e96c862430904ee3e64623c38_cgraph.svg
 delete mode 100644 de/db6/a1z26__cipher_8cpp_a0a78954e96c862430904ee3e64623c38_cgraph_org.svg
 delete mode 100644 de/db6/a1z26__cipher_8cpp_a77a6b827a0b9c7aca2d705811459d744_cgraph.map
 delete mode 100644 de/db6/a1z26__cipher_8cpp_a77a6b827a0b9c7aca2d705811459d744_cgraph.md5
 delete mode 100644 de/db6/a1z26__cipher_8cpp_a77a6b827a0b9c7aca2d705811459d744_cgraph.svg
 delete mode 100644 de/db6/a1z26__cipher_8cpp_a77a6b827a0b9c7aca2d705811459d744_cgraph_org.svg
 delete mode 100644 de/db6/a1z26__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 de/db6/a1z26__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 de/db6/a1z26__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 de/db6/a1z26__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 de/db6/a1z26__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 de/db6/a1z26__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 de/db6/a1z26__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 de/db6/a1z26__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 de/db6/a1z26__cipher_8cpp_source.html
 create mode 100644 de/dc3/binaryheap_8cpp_source.html
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_a493fbaa7a94e3b7ca573111237bb3742_cgraph.map
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_a493fbaa7a94e3b7ca573111237bb3742_cgraph.md5
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_a493fbaa7a94e3b7ca573111237bb3742_cgraph.svg
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_a493fbaa7a94e3b7ca573111237bb3742_cgraph_org.svg
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_a7cf5feaf168b88e74544da59ed830311_cgraph.map
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_a7cf5feaf168b88e74544da59ed830311_cgraph.md5
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_a7cf5feaf168b88e74544da59ed830311_cgraph.svg
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_a7cf5feaf168b88e74544da59ed830311_cgraph_org.svg
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_a9c83cca09a3e4ff2a25c816a9303448e_cgraph.map
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_a9c83cca09a3e4ff2a25c816a9303448e_cgraph.md5
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_a9c83cca09a3e4ff2a25c816a9303448e_cgraph.svg
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_a9c83cca09a3e4ff2a25c816a9303448e_cgraph_org.svg
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_aadb40ac4c74a7efc0680b83eeee138aa_cgraph.map
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_aadb40ac4c74a7efc0680b83eeee138aa_cgraph.md5
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_aadb40ac4c74a7efc0680b83eeee138aa_cgraph.svg
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_aadb40ac4c74a7efc0680b83eeee138aa_cgraph_org.svg
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 de/dc3/fibonacci__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 de/dc3/fibonacci__sum_8cpp_source.html
 delete mode 100644 de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 de/dc5/intersection__of__two__arrays_8cpp_source.html
 delete mode 100644 de/dcd/kadanes3_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 de/dcd/kadanes3_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 de/dcd/kadanes3_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 de/dcd/kadanes3_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 de/dcd/kadanes3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 de/dcd/kadanes3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 de/dcd/kadanes3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 de/dcd/kadanes3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 de/dcd/kadanes3_8cpp_source.html
 delete mode 100644 de/dcf/binary__exponent_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 de/dcf/binary__exponent_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 de/dcf/binary__exponent_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 de/dcf/binary__exponent_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 de/dcf/binary__exponent_8cpp_aeb48dce0725e63d19147944f41843c73_cgraph.map
 delete mode 100644 de/dcf/binary__exponent_8cpp_aeb48dce0725e63d19147944f41843c73_cgraph.md5
 delete mode 100644 de/dcf/binary__exponent_8cpp_aeb48dce0725e63d19147944f41843c73_cgraph.svg
 delete mode 100644 de/dcf/binary__exponent_8cpp_aeb48dce0725e63d19147944f41843c73_cgraph_org.svg
 create mode 100644 de/dcf/binary__exponent_8cpp_source.html
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a1c0d27198372b36ef71bc58af8336b9c_cgraph.map
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a1c0d27198372b36ef71bc58af8336b9c_cgraph.md5
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a1c0d27198372b36ef71bc58af8336b9c_cgraph.svg
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a1c0d27198372b36ef71bc58af8336b9c_cgraph_org.svg
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a2e683b271d8d5cd63e0d09cf8aaa325c_cgraph.map
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a2e683b271d8d5cd63e0d09cf8aaa325c_cgraph.md5
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a2e683b271d8d5cd63e0d09cf8aaa325c_cgraph.svg
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a2e683b271d8d5cd63e0d09cf8aaa325c_cgraph_org.svg
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a534645d1aabdf1a7e5897c85376f173d_cgraph.map
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a534645d1aabdf1a7e5897c85376f173d_cgraph.md5
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a534645d1aabdf1a7e5897c85376f173d_cgraph.svg
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a534645d1aabdf1a7e5897c85376f173d_cgraph_org.svg
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph.map
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph.md5
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph.svg
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph_org.svg
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_adb2b6be741b0500ee75d89b6d06b5d50_cgraph.map
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_adb2b6be741b0500ee75d89b6d06b5d50_cgraph.md5
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_adb2b6be741b0500ee75d89b6d06b5d50_cgraph.svg
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_adb2b6be741b0500ee75d89b6d06b5d50_cgraph_org.svg
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_af6f974381f523fdb981fc2d843bbf4a1_cgraph.map
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_af6f974381f523fdb981fc2d843bbf4a1_cgraph.md5
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_af6f974381f523fdb981fc2d843bbf4a1_cgraph.svg
 delete mode 100644 de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_af6f974381f523fdb981fc2d843bbf4a1_cgraph_org.svg
 delete mode 100644 de/dd1/segment__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 de/dd1/segment__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 de/dd1/segment__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 de/dd1/segment__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 de/dd1/segment__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 de/dd1/segment__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 de/dd1/segment__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 de/dd1/segment__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 de/dd1/segment__tree_8cpp_source.html
 delete mode 100644 de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map
 delete mode 100644 de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5
 delete mode 100644 de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg
 delete mode 100644 de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph_org.svg
 delete mode 100644 de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.map
 delete mode 100644 de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.md5
 delete mode 100644 de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.svg
 delete mode 100644 de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph_org.svg
 delete mode 100644 de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 de/dd3/newton__raphson__method_8cpp_source.html
 create mode 100644 de/dd9/catalan__numbers_8cpp_source.html
 delete mode 100644 de/dde/lowest__common__ancestor_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 de/dde/lowest__common__ancestor_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 de/dde/lowest__common__ancestor_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 de/dde/lowest__common__ancestor_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 de/dde/lowest__common__ancestor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 de/dde/lowest__common__ancestor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 de/dde/lowest__common__ancestor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 de/dde/lowest__common__ancestor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 de/dde/lowest__common__ancestor_8cpp_source.html
 create mode 100644 de/de4/fibonacci__large_8cpp_source.html
 delete mode 100644 de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph.map
 delete mode 100644 de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph.md5
 delete mode 100644 de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph.svg
 delete mode 100644 de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph_org.svg
 delete mode 100644 de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph.map
 delete mode 100644 de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph.md5
 delete mode 100644 de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph.svg
 delete mode 100644 de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph_org.svg
 delete mode 100644 df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.map
 delete mode 100644 df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.md5
 delete mode 100644 df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.svg
 delete mode 100644 df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph_org.svg
 delete mode 100644 df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.map
 delete mode 100644 df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.md5
 delete mode 100644 df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.svg
 delete mode 100644 df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph_org.svg
 create mode 100644 df/d06/decimal__to__binary_8cpp_source.html
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.map
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.md5
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.svg
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph_org.svg
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_a7072493d1f0f8a91b2a71d4cc456c09c_cgraph.map
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_a7072493d1f0f8a91b2a71d4cc456c09c_cgraph.md5
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_a7072493d1f0f8a91b2a71d4cc456c09c_cgraph.svg
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_a7072493d1f0f8a91b2a71d4cc456c09c_cgraph_org.svg
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_a7ee8e824ef3e138a9a21883b26d97226_cgraph.map
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_a7ee8e824ef3e138a9a21883b26d97226_cgraph.md5
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_a7ee8e824ef3e138a9a21883b26d97226_cgraph.svg
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_a7ee8e824ef3e138a9a21883b26d97226_cgraph_org.svg
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_ad53616fb4fa6880ae876bcba53365c51_cgraph.map
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_ad53616fb4fa6880ae876bcba53365c51_cgraph.md5
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_ad53616fb4fa6880ae876bcba53365c51_cgraph.svg
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_ad53616fb4fa6880ae876bcba53365c51_cgraph_org.svg
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_ae682ee71af44b1e9e884849cc6a6b040_cgraph.map
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_ae682ee71af44b1e9e884849cc6a6b040_cgraph.md5
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_ae682ee71af44b1e9e884849cc6a6b040_cgraph.svg
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_ae682ee71af44b1e9e884849cc6a6b040_cgraph_org.svg
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_ae9f66040f8e0ba73c1c741261c22a52a_cgraph.map
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_ae9f66040f8e0ba73c1c741261c22a52a_cgraph.md5
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_ae9f66040f8e0ba73c1c741261c22a52a_cgraph.svg
 delete mode 100644 df/d11/midpoint__integral__method_8cpp_ae9f66040f8e0ba73c1c741261c22a52a_cgraph_org.svg
 create mode 100644 df/d11/midpoint__integral__method_8cpp_source.html
 create mode 100644 df/d14/bellman__ford_8cpp_source.html
 delete mode 100644 df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.map
 delete mode 100644 df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.md5
 delete mode 100644 df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg
 delete mode 100644 df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg
 delete mode 100644 df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map
 delete mode 100644 df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5
 delete mode 100644 df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg
 delete mode 100644 df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg
 create mode 100644 df/d28/dsu__union__rank_8cpp_source.html
 delete mode 100644 df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 df/d2c/elliptic__curve__key__exchange_8cpp_source.html
 create mode 100644 df/d31/floyd__warshall_8cpp_source.html
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a3a7f57679e9cd6c9f042dfd0612b2b24_cgraph.map
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a3a7f57679e9cd6c9f042dfd0612b2b24_cgraph.md5
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a3a7f57679e9cd6c9f042dfd0612b2b24_cgraph.svg
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a3a7f57679e9cd6c9f042dfd0612b2b24_cgraph_org.svg
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph.map
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph.md5
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph.svg
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph_org.svg
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph.map
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph.md5
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph.svg
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph_org.svg
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a938cafbdf70dc01e86e9bb12d29ec65d_cgraph.map
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a938cafbdf70dc01e86e9bb12d29ec65d_cgraph.md5
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a938cafbdf70dc01e86e9bb12d29ec65d_cgraph.svg
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a938cafbdf70dc01e86e9bb12d29ec65d_cgraph_org.svg
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_af544e271ea19a6fd69a6b3ed6816453e_cgraph.map
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_af544e271ea19a6fd69a6b3ed6816453e_cgraph.md5
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_af544e271ea19a6fd69a6b3ed6816453e_cgraph.svg
 delete mode 100644 df/d34/classprobability_1_1windowed__median_1_1_windowed_median_af544e271ea19a6fd69a6b3ed6816453e_cgraph_org.svg
 delete mode 100644 df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 df/d39/interpolation__search2_8cpp_source.html
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a06f35064850e891d6fda0093c0d9ee6e_cgraph.map
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a06f35064850e891d6fda0093c0d9ee6e_cgraph.md5
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a06f35064850e891d6fda0093c0d9ee6e_cgraph.svg
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a06f35064850e891d6fda0093c0d9ee6e_cgraph_org.svg
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a1d42876440ac5346e2850a32497385c3_cgraph.map
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a1d42876440ac5346e2850a32497385c3_cgraph.md5
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a1d42876440ac5346e2850a32497385c3_cgraph.svg
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a1d42876440ac5346e2850a32497385c3_cgraph_org.svg
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a8c882f43e1e52948a7841a8bfb091350_cgraph.map
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a8c882f43e1e52948a7841a8bfb091350_cgraph.md5
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a8c882f43e1e52948a7841a8bfb091350_cgraph.svg
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a8c882f43e1e52948a7841a8bfb091350_cgraph_org.svg
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a94b76f781fcbe1ad0e3397ace6bb1965_cgraph.map
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a94b76f781fcbe1ad0e3397ace6bb1965_cgraph.md5
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a94b76f781fcbe1ad0e3397ace6bb1965_cgraph.svg
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a94b76f781fcbe1ad0e3397ace6bb1965_cgraph_org.svg
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a9856b68e2cba50d2e26a1cbe374e0365_cgraph.map
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a9856b68e2cba50d2e26a1cbe374e0365_cgraph.md5
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a9856b68e2cba50d2e26a1cbe374e0365_cgraph.svg
 delete mode 100644 df/d42/binary__search__tree2_8cpp_a9856b68e2cba50d2e26a1cbe374e0365_cgraph_org.svg
 delete mode 100644 df/d42/binary__search__tree2_8cpp_ab00b8d0f21aeb5fbddb6decf3bcb640a_cgraph.map
 delete mode 100644 df/d42/binary__search__tree2_8cpp_ab00b8d0f21aeb5fbddb6decf3bcb640a_cgraph.md5
 delete mode 100644 df/d42/binary__search__tree2_8cpp_ab00b8d0f21aeb5fbddb6decf3bcb640a_cgraph.svg
 delete mode 100644 df/d42/binary__search__tree2_8cpp_ab00b8d0f21aeb5fbddb6decf3bcb640a_cgraph_org.svg
 delete mode 100644 df/d42/binary__search__tree2_8cpp_ab1333c3ea06dcad896ee204bbd407c4e_cgraph.map
 delete mode 100644 df/d42/binary__search__tree2_8cpp_ab1333c3ea06dcad896ee204bbd407c4e_cgraph.md5
 delete mode 100644 df/d42/binary__search__tree2_8cpp_ab1333c3ea06dcad896ee204bbd407c4e_cgraph.svg
 delete mode 100644 df/d42/binary__search__tree2_8cpp_ab1333c3ea06dcad896ee204bbd407c4e_cgraph_org.svg
 delete mode 100644 df/d42/binary__search__tree2_8cpp_af2847a901160fd45b4044550e9921cb4_cgraph.map
 delete mode 100644 df/d42/binary__search__tree2_8cpp_af2847a901160fd45b4044550e9921cb4_cgraph.md5
 delete mode 100644 df/d42/binary__search__tree2_8cpp_af2847a901160fd45b4044550e9921cb4_cgraph.svg
 delete mode 100644 df/d42/binary__search__tree2_8cpp_af2847a901160fd45b4044550e9921cb4_cgraph_org.svg
 create mode 100644 df/d42/binary__search__tree2_8cpp_source.html
 delete mode 100644 df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph.map
 delete mode 100644 df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph.md5
 delete mode 100644 df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph.svg
 delete mode 100644 df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph_org.svg
 delete mode 100644 df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 df/d47/fcfs__scheduling_8cpp_source.html
 delete mode 100644 df/d66/vector__cross__product_8cpp_a225732399c5c076976eae5b180a9f8c9_cgraph.map
 delete mode 100644 df/d66/vector__cross__product_8cpp_a225732399c5c076976eae5b180a9f8c9_cgraph.md5
 delete mode 100644 df/d66/vector__cross__product_8cpp_a225732399c5c076976eae5b180a9f8c9_cgraph.svg
 delete mode 100644 df/d66/vector__cross__product_8cpp_a225732399c5c076976eae5b180a9f8c9_cgraph_org.svg
 delete mode 100644 df/d66/vector__cross__product_8cpp_a4b2a9757a87c18e1642d72410ecfaba8_cgraph.map
 delete mode 100644 df/d66/vector__cross__product_8cpp_a4b2a9757a87c18e1642d72410ecfaba8_cgraph.md5
 delete mode 100644 df/d66/vector__cross__product_8cpp_a4b2a9757a87c18e1642d72410ecfaba8_cgraph.svg
 delete mode 100644 df/d66/vector__cross__product_8cpp_a4b2a9757a87c18e1642d72410ecfaba8_cgraph_org.svg
 delete mode 100644 df/d66/vector__cross__product_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 df/d66/vector__cross__product_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 df/d66/vector__cross__product_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 df/d66/vector__cross__product_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 df/d66/vector__cross__product_8cpp_source.html
 delete mode 100644 df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph.map
 delete mode 100644 df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph.md5
 delete mode 100644 df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph.svg
 delete mode 100644 df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph_org.svg
 delete mode 100644 df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_ac00616a4e40d3cd5cfb4da87d9ff9af0_cgraph.map
 delete mode 100644 df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_ac00616a4e40d3cd5cfb4da87d9ff9af0_cgraph.md5
 delete mode 100644 df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_ac00616a4e40d3cd5cfb4da87d9ff9af0_cgraph.svg
 delete mode 100644 df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_ac00616a4e40d3cd5cfb4da87d9ff9af0_cgraph_org.svg
 delete mode 100644 df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_acc5fe9c2032fb7582c38a20d1fa69bcf_cgraph.map
 delete mode 100644 df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_acc5fe9c2032fb7582c38a20d1fa69bcf_cgraph.md5
 delete mode 100644 df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_acc5fe9c2032fb7582c38a20d1fa69bcf_cgraph.svg
 delete mode 100644 df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_acc5fe9c2032fb7582c38a20d1fa69bcf_cgraph_org.svg
 delete mode 100644 df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
 delete mode 100644 df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
 delete mode 100644 df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
 delete mode 100644 df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
 delete mode 100644 df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.map
 delete mode 100644 df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.md5
 delete mode 100644 df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.svg
 delete mode 100644 df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph_org.svg
 delete mode 100644 df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 create mode 100644 df/d72/modular__division_8cpp_source.html
 delete mode 100644 df/d82/breadth__first__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
 delete mode 100644 df/d82/breadth__first__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
 delete mode 100644 df/d82/breadth__first__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
 delete mode 100644 df/d82/breadth__first__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
 delete mode 100644 df/d82/breadth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 df/d82/breadth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 df/d82/breadth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 df/d82/breadth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 df/d82/breadth__first__search_8cpp_source.html
 delete mode 100644 df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph.map
 delete mode 100644 df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph.md5
 delete mode 100644 df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph.svg
 delete mode 100644 df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph_org.svg
 delete mode 100644 df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph.map
 delete mode 100644 df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph.md5
 delete mode 100644 df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph.svg
 delete mode 100644 df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph_org.svg
 delete mode 100644 df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph.map
 delete mode 100644 df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph.md5
 delete mode 100644 df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph.svg
 delete mode 100644 df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph_org.svg
 delete mode 100644 df/d94/subarray__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
 delete mode 100644 df/d94/subarray__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
 delete mode 100644 df/d94/subarray__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
 delete mode 100644 df/d94/subarray__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
 delete mode 100644 df/d94/subarray__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 df/d94/subarray__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 df/d94/subarray__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 df/d94/subarray__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 delete mode 100644 df/d94/subarray__sum_8cpp_af5687bbd9faf927fbd363c71e0baba5e_cgraph.map
 delete mode 100644 df/d94/subarray__sum_8cpp_af5687bbd9faf927fbd363c71e0baba5e_cgraph.md5
 delete mode 100644 df/d94/subarray__sum_8cpp_af5687bbd9faf927fbd363c71e0baba5e_cgraph.svg
 delete mode 100644 df/d94/subarray__sum_8cpp_af5687bbd9faf927fbd363c71e0baba5e_cgraph_org.svg
 create mode 100644 df/d94/subarray__sum_8cpp_source.html
 create mode 100644 df/d97/main__cll_8cpp_source.html
 create mode 100644 df/da7/queue__using__array2_8cpp_source.html
 delete mode 100644 df/dbb/class_f_c_f_s__coll__graph.map
 delete mode 100644 df/dbb/class_f_c_f_s__coll__graph.md5
 delete mode 100644 df/dbb/class_f_c_f_s__coll__graph.svg
 delete mode 100644 df/dbb/class_f_c_f_s__coll__graph_org.svg
 delete mode 100644 df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 df/dc8/successive__approximation_8cpp_source.html
 delete mode 100644 df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph.map
 delete mode 100644 df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph.md5
 delete mode 100644 df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph.svg
 delete mode 100644 df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph_org.svg
 delete mode 100644 df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.map
 delete mode 100644 df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.md5
 delete mode 100644 df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.svg
 delete mode 100644 df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph_org.svg
 delete mode 100644 df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph.map
 delete mode 100644 df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph.md5
 delete mode 100644 df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph.svg
 delete mode 100644 df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph_org.svg
 delete mode 100644 df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph.map
 delete mode 100644 df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph.md5
 delete mode 100644 df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph.svg
 delete mode 100644 df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph_org.svg
 delete mode 100644 df/dce/namespacegraph_a84b0551489c613a681cc83b34450da4b_cgraph.map
 delete mode 100644 df/dce/namespacegraph_a84b0551489c613a681cc83b34450da4b_cgraph.md5
 delete mode 100644 df/dce/namespacegraph_a84b0551489c613a681cc83b34450da4b_cgraph.svg
 delete mode 100644 df/dce/namespacegraph_a84b0551489c613a681cc83b34450da4b_cgraph_org.svg
 delete mode 100644 df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph.map
 delete mode 100644 df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph.md5
 delete mode 100644 df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph.svg
 delete mode 100644 df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph_org.svg
 delete mode 100644 df/dce/namespacegraph_ab7706341d006e20d1ae58274187a3346_cgraph.map
 delete mode 100644 df/dce/namespacegraph_ab7706341d006e20d1ae58274187a3346_cgraph.md5
 delete mode 100644 df/dce/namespacegraph_ab7706341d006e20d1ae58274187a3346_cgraph.svg
 delete mode 100644 df/dce/namespacegraph_ab7706341d006e20d1ae58274187a3346_cgraph_org.svg
 delete mode 100644 df/dce/namespacegraph_adc68cbc8ba09eb1142265935c0d45b84_cgraph.map
 delete mode 100644 df/dce/namespacegraph_adc68cbc8ba09eb1142265935c0d45b84_cgraph.md5
 delete mode 100644 df/dce/namespacegraph_adc68cbc8ba09eb1142265935c0d45b84_cgraph.svg
 delete mode 100644 df/dce/namespacegraph_adc68cbc8ba09eb1142265935c0d45b84_cgraph_org.svg
 delete mode 100644 df/dd0/queue__using__two__stacks_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 df/dd0/queue__using__two__stacks_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 df/dd0/queue__using__two__stacks_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 df/dd0/queue__using__two__stacks_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 df/dd0/queue__using__two__stacks_8cpp_source.html
 create mode 100644 df/dd5/binary__search_8cpp_source.html
 delete mode 100644 df/ddd/connected__components_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
 delete mode 100644 df/ddd/connected__components_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
 delete mode 100644 df/ddd/connected__components_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
 delete mode 100644 df/ddd/connected__components_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
 delete mode 100644 df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 df/ddd/connected__components_8cpp_source.html
 delete mode 100644 df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.map
 delete mode 100644 df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.md5
 delete mode 100644 df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.svg
 delete mode 100644 df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph_org.svg
 delete mode 100644 df/de5/classbacktracking_1_1generate__parentheses_af39c03d80ce0ba9fbf659b420980d160_cgraph.map
 delete mode 100644 df/de5/classbacktracking_1_1generate__parentheses_af39c03d80ce0ba9fbf659b420980d160_cgraph.md5
 delete mode 100644 df/de5/classbacktracking_1_1generate__parentheses_af39c03d80ce0ba9fbf659b420980d160_cgraph.svg
 delete mode 100644 df/de5/classbacktracking_1_1generate__parentheses_af39c03d80ce0ba9fbf659b420980d160_cgraph_org.svg
 delete mode 100644 df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.map
 delete mode 100644 df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.md5
 delete mode 100644 df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.svg
 delete mode 100644 df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph_org.svg
 delete mode 100644 df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 df/def/power__for__huge__numbers_8cpp_source.html
 delete mode 100644 df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
 delete mode 100644 df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
 delete mode 100644 df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
 delete mode 100644 df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
 create mode 100644 df/dfb/minimax_8cpp_source.html
 create mode 100644 dir_53e6fa9553ac22a5646d2a2b2d7b97a1.html
 create mode 100644 dir_53e6fa9553ac22a5646d2a2b2d7b97a1.js
 create mode 100644 doxygen-awesome.css
 create mode 100644 favicon.svg
 delete mode 100644 navtreeindex15.js
 create mode 100644 project_logo.png

diff --git a/annotated.html b/annotated.html
index bc026981d..224eeeee5 100644
--- a/annotated.html
+++ b/annotated.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class List</title>
+<title>TheAlgorithms/C++: Class List</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -143,12 +160,12 @@ $(function(){initNavTree('annotated.html',''); initResizable(true); });
 <tr id="row_2_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">SkipList</a></td><td class="desc"></td></tr>
 <tr id="row_2_13_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc8/classdata__structures_1_1_stack.html" target="_self">Stack</a></td><td class="desc">Class representation of a stack </td></tr>
 <tr id="row_2_14_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d3e/classdata__structures_1_1trie.html" target="_self">trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
-<tr id="row_3_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_3_" class="arrow" onclick="dynsection.toggleFolder('3_')">&#9658;</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_3_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_3_" class="arrow" onclick="dynsection.toggleFolder('3_')">&#9658;</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 std::vector </td></tr>
 <tr id="row_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_0_" class="arrow" onclick="dynsection.toggleFolder('3_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>strassens_multiplication</b></td><td class="desc"></td></tr>
 <tr id="row_3_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="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_4_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_4_" class="arrow" onclick="dynsection.toggleFolder('4_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d65/namespacedouble__hashing.html" target="_self">double_hashing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Double_hashing" target="_blank">double hashing</a> algorithm </td></tr>
 <tr id="row_4_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dde/structdouble__hashing_1_1_entry.html" target="_self">Entry</a></td><td class="desc"></td></tr>
-<tr id="row_5_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_5_" class="arrow" onclick="dynsection.toggleFolder('5_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d5f/namespacegeometry.html" target="_self">geometry</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a> </td></tr>
+<tr id="row_5_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_5_" class="arrow" onclick="dynsection.toggleFolder('5_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d5f/namespacegeometry.html" target="_self">geometry</a></td><td class="desc">For std::swap </td></tr>
 <tr id="row_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_5_0_" class="arrow" onclick="dynsection.toggleFolder('5_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>grahamscan</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;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d48/structgeometry_1_1grahamscan_1_1_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
 <tr id="row_5_1_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_5_1_" class="arrow" onclick="dynsection.toggleFolder('5_1_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>jarvis</b></td><td class="desc"></td></tr>
@@ -189,7 +206,7 @@ $(function(){initNavTree('annotated.html',''); initResizable(true); });
 <tr id="row_11_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_11_" class="arrow" onclick="dynsection.toggleFolder('11_')">&#9658;</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 assert </td></tr>
 <tr id="row_11_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_11_0_" class="arrow" onclick="dynsection.toggleFolder('11_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>ncr_modulo_p</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;">&#160;</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_12_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_12_" class="arrow" onclick="dynsection.toggleFolder('12_')">&#9658;</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_12_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_12_" class="arrow" onclick="dynsection.toggleFolder('12_')">&#9658;</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 std::vector </td></tr>
 <tr id="row_12_0_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_12_0_" class="arrow" onclick="dynsection.toggleFolder('12_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>circular_linked_list</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;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" target="_self">CircularLinkedList</a></td><td class="desc">A class that implements a Circular Linked List </td></tr>
 <tr id="row_12_0_1_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="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>
@@ -222,7 +239,7 @@ $(function(){initNavTree('annotated.html',''); initResizable(true); });
 <tr id="row_14_1_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="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_15_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_15_" class="arrow" onclick="dynsection.toggleFolder('15_')">&#9658;</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_15_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html" target="_self">Entry</a></td><td class="desc"></td></tr>
-<tr id="row_16_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_16_" class="arrow" onclick="dynsection.toggleFolder('16_')">&#9658;</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">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
+<tr id="row_16_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_16_" class="arrow" onclick="dynsection.toggleFolder('16_')">&#9658;</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">For std::vector </td></tr>
 <tr id="row_16_0_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_16_0_" class="arrow" onclick="dynsection.toggleFolder('16_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>heavy_light_decomposition</b></td><td class="desc"></td></tr>
 <tr id="row_16_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="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_16_0_1_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/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>
@@ -236,7 +253,7 @@ $(function(){initNavTree('annotated.html',''); initResizable(true); });
 <tr id="row_18_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_18_" class="arrow" onclick="dynsection.toggleFolder('18_')">&#9658;</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_18_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">stats_computer1</a></td><td class="desc"></td></tr>
 <tr id="row_18_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">stats_computer2</a></td><td class="desc"></td></tr>
-<tr id="row_19_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_19_" class="arrow" onclick="dynsection.toggleFolder('19_')">&#9658;</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_19_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_19_" class="arrow" onclick="dynsection.toggleFolder('19_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>std</b></td><td class="desc">STL namespace </td></tr>
 <tr id="row_19_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">is_arithmetic&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
 <tr id="row_19_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">is_arithmetic&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
 <tr id="row_19_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">is_integral&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
@@ -280,7 +297,7 @@ $(function(){initNavTree('annotated.html',''); initResizable(true); });
 <tr id="row_51_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
 <tr id="row_52_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
 <tr id="row_53_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
-<tr id="row_54_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a> </td></tr>
+<tr id="row_54_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack</a></td><td class="desc">For std::invalid_argument </td></tr>
 <tr id="row_55_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
 <tr id="row_56_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d86/struct_test_case.html" target="_self">TestCase</a></td><td class="desc">Single example inputs and expected output of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> </td></tr>
 <tr id="row_57_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
diff --git a/annotated_dup.js b/annotated_dup.js
index db81bb2fa..b1f9f695c 100644
--- a/annotated_dup.js
+++ b/annotated_dup.js
@@ -176,7 +176,7 @@ var annotated_dup =
       [ "stats_computer1", "d7/d7c/classstatistics_1_1stats__computer1.html", "d7/d7c/classstatistics_1_1stats__computer1" ],
       [ "stats_computer2", "d8/dab/classstatistics_1_1stats__computer2.html", "d8/dab/classstatistics_1_1stats__computer2" ]
     ] ],
-    [ "std", "d8/dcc/namespacestd.html", [
+    [ "std", null, [
       [ "is_arithmetic< uint128_t >", "d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html", null ],
       [ "is_arithmetic< uint256_t >", "dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html", null ],
       [ "is_integral< uint128_t >", "d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html", null ],
diff --git a/classes.html b/classes.html
index 963a5231d..9bbbc3651 100644
--- a/classes.html
+++ b/classes.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Index</title>
+<title>TheAlgorithms/C++: Class Index</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -135,7 +152,7 @@ $(function(){initNavTree('classes.html',''); initResizable(true); });
 <dd><a class="el" href="d6/d84/classhashing_1_1sha256_1_1_hash.html">Hash</a> (hashing::sha256)</dd><dd><a class="el" href="dd/d1c/classhash__chain.html">hash_chain</a></dd><dd><a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html">HillCipher</a> (<a class="el" href="d6/d4e/namespaceciphers.html">ciphers</a>)</dd><dd><a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html">HKGraph</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)</dd><dd><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">HLD</a> (range_queries::heavy_light_decomposition)</dd></dl>
 <dl class="classindex even">
 <dt class="alphachar"><a id="letter_I" name="letter_I">I</a></dt>
-<dd><a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">AyStarSearch::Info</a> (machine_learning::aystar_search)</dd><dd><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html">is_arithmetic&lt; uint128_t &gt;</a> (<a class="el" href="d8/dcc/namespacestd.html">std</a>)</dd><dd><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html">is_arithmetic&lt; uint256_t &gt;</a> (<a class="el" href="d8/dcc/namespacestd.html">std</a>)</dd><dd><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html">is_integral&lt; uint128_t &gt;</a> (<a class="el" href="d8/dcc/namespacestd.html">std</a>)</dd><dd><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html">is_integral&lt; uint256_t &gt;</a> (<a class="el" href="d8/dcc/namespacestd.html">std</a>)</dd><dd><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html">is_unsigned&lt; uint128_t &gt;</a> (<a class="el" href="d8/dcc/namespacestd.html">std</a>)</dd><dd><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html">is_unsigned&lt; uint256_t &gt;</a> (<a class="el" href="d8/dcc/namespacestd.html">std</a>)</dd><dd><a class="el" href="db/d66/struct_item.html">Item</a></dd></dl>
+<dd><a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">AyStarSearch::Info</a> (machine_learning::aystar_search)</dd><dd><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html">is_arithmetic&lt; uint128_t &gt;</a> (std)</dd><dd><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html">is_arithmetic&lt; uint256_t &gt;</a> (std)</dd><dd><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html">is_integral&lt; uint128_t &gt;</a> (std)</dd><dd><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html">is_integral&lt; uint256_t &gt;</a> (std)</dd><dd><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html">is_unsigned&lt; uint128_t &gt;</a> (std)</dd><dd><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html">is_unsigned&lt; uint256_t &gt;</a> (std)</dd><dd><a class="el" href="db/d66/struct_item.html">Item</a></dd></dl>
 <dl class="classindex odd">
 <dt class="alphachar"><a id="letter_K" name="letter_K">K</a></dt>
 <dd><a class="el" href="da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">Knn</a> (machine_learning::k_nearest_neighbors)</dd></dl>
diff --git a/d0/d01/smallest__circle_8cpp.html b/d0/d01/smallest__circle_8cpp.html
index 766df13ca..7830ca4e2 100644
--- a/d0/d01/smallest__circle_8cpp.html
+++ b/d0/d01/smallest__circle_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/smallest_circle.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/smallest_circle.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for smallest_circle.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/db7/smallest__circle_8cpp__incl.svg" width="244" height="111"><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">
+</div>
+<p><a href="../../d0/d01/smallest__circle_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/dc8/struct_point.html">Point</a></td></tr>
@@ -133,9 +152,9 @@ Functions</h2></td></tr>
 <tr class="separator:a3cbebd6f4d2cdf227663c67fe41ba12a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a94682a4a70d5906857ca09de5b9fb2cc" id="r_a94682a4a70d5906857ca09de5b9fb2cc"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a94682a4a70d5906857ca09de5b9fb2cc">TriangleArea</a> (const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;A, const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;B, const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;C)</td></tr>
 <tr class="separator:a94682a4a70d5906857ca09de5b9fb2cc"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aee6d48762c1dfb9f14627927f0c16fad" id="r_aee6d48762c1dfb9f14627927f0c16fad"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aee6d48762c1dfb9f14627927f0c16fad">PointInCircle</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &gt; &amp;P, const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;Center, double R)</td></tr>
+<tr class="memitem:aee6d48762c1dfb9f14627927f0c16fad" id="r_aee6d48762c1dfb9f14627927f0c16fad"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aee6d48762c1dfb9f14627927f0c16fad">PointInCircle</a> (const std::vector&lt; <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &gt; &amp;P, const <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &amp;Center, double R)</td></tr>
 <tr class="separator:aee6d48762c1dfb9f14627927f0c16fad"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0b0676df8e4da7a08c7ccaecea344903" id="r_a0b0676df8e4da7a08c7ccaecea344903"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0b0676df8e4da7a08c7ccaecea344903">circle</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &gt; &amp;P)</td></tr>
+<tr class="memitem:a0b0676df8e4da7a08c7ccaecea344903" id="r_a0b0676df8e4da7a08c7ccaecea344903"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0b0676df8e4da7a08c7ccaecea344903">circle</a> (const std::vector&lt; <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &gt; &amp;P)</td></tr>
 <tr class="separator:a0b0676df8e4da7a08c7ccaecea344903"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae1a3968e7947464bee7714f6d43b7002" id="r_ae1a3968e7947464bee7714f6d43b7002"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae1a3968e7947464bee7714f6d43b7002">test</a> ()</td></tr>
 <tr class="separator:ae1a3968e7947464bee7714f6d43b7002"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -149,6 +168,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Get centre and radius of the <a href="https://en.wikipedia.org/wiki/Smallest-circle_problem" target="_blank">smallest circle</a> that circumscribes given set of points. </p>
 <dl class="section see"><dt>See also</dt><dd><a href="https://www.nayuki.io/page/smallest-enclosing-circle" target="_blank">other implementation</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html">smallest_circle.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a0b0676df8e4da7a08c7ccaecea344903" name="a0b0676df8e4da7a08c7ccaecea344903"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0b0676df8e4da7a08c7ccaecea344903">&#9670;&#160;</a></span>circle()</h2>
@@ -159,7 +180,7 @@ Functions</h2></td></tr>
         <tr>
           <td class="memname">double circle </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>P</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>P</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -172,6 +193,8 @@ The function returns the radius of the circle and prints the coordinated of the
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>radius of the circle </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html#l00087">87</a> of file <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html">smallest_circle.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   87</span>                                         {</div>
 <div class="line"><span class="lineno">   88</span>    <span class="keywordtype">double</span> minR = INFINITY;</div>
 <div class="line"><span class="lineno">   89</span>    <span class="keywordtype">double</span> R;</div>
@@ -180,11 +203,11 @@ The function returns the radius of the circle and prints the coordinated of the
 <div class="line"><span class="lineno">   92</span> </div>
 <div class="line"><span class="lineno">   93</span>    <span class="comment">/* This code is invalid and does not give correct result for TEST 3 */</span></div>
 <div class="line"><span class="lineno">   94</span>    <span class="comment">// for each point in the list</span></div>
-<div class="line"><span class="lineno">   95</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; P.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() - 2; i++)</div>
+<div class="line"><span class="lineno">   95</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; P.size() - 2; i++)</div>
 <div class="line"><span class="lineno">   96</span>        <span class="comment">// for every subsequent point in the list</span></div>
-<div class="line"><span class="lineno">   97</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = i + 1; j &lt; P.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); j++)</div>
+<div class="line"><span class="lineno">   97</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = i + 1; j &lt; P.size(); j++)</div>
 <div class="line"><span class="lineno">   98</span>            <span class="comment">// for every subsequent point in the list</span></div>
-<div class="line"><span class="lineno">   99</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> k = j + 1; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> &lt; P.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++) {</div>
+<div class="line"><span class="lineno">   99</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> k = j + 1; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> &lt; P.size(); <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++) {</div>
 <div class="line"><span class="lineno">  100</span>                <span class="comment">// here, we now have picked three points from the given set of</span></div>
 <div class="line"><span class="lineno">  101</span>                <span class="comment">// points that we can use</span></div>
 <div class="line"><span class="lineno">  102</span>                <span class="comment">// viz., P[i], P[j] and P[k]</span></div>
@@ -219,9 +242,9 @@ The function returns the radius of the circle and prints the coordinated of the
 <div class="line"><span class="lineno">  131</span>            }</div>
 <div class="line"><span class="lineno">  132</span> </div>
 <div class="line"><span class="lineno">  133</span>    <span class="comment">// for each point in the list</span></div>
-<div class="line"><span class="lineno">  134</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; P.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() - 1; i++)</div>
+<div class="line"><span class="lineno">  134</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; P.size() - 1; i++)</div>
 <div class="line"><span class="lineno">  135</span>        <span class="comment">// for every subsequent point in the list</span></div>
-<div class="line"><span class="lineno">  136</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = i + 1; j &lt; P.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); j++) {</div>
+<div class="line"><span class="lineno">  136</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = i + 1; j &lt; P.size(); j++) {</div>
 <div class="line"><span class="lineno">  137</span>            <span class="comment">// check for diameterically opposite points</span></div>
 <div class="line"><span class="lineno">  138</span>            C.x = (P[i].x + P[j].x) / 2;</div>
 <div class="line"><span class="lineno">  139</span>            C.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> = (P[i].y + P[j].y) / 2;</div>
@@ -234,24 +257,16 @@ The function returns the radius of the circle and prints the coordinated of the
 <div class="line"><span class="lineno">  146</span>                minC = C;</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>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; minC.x &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; minC.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> &lt;&lt; <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">  149</span>    std::cout &lt;&lt; minC.x &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; minC.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  150</span>    <span class="keywordflow">return</span> minR;</div>
 <div class="line"><span class="lineno">  151</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="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</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="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="asmallest__circle_8cpp_html_a3cbebd6f4d2cdf227663c67fe41ba12a"><div class="ttname"><a href="#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a></div><div class="ttdeci">double LenghtLine(const Point &amp;A, const Point &amp;B)</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:37</div></div>
-<div class="ttc" id="asmallest__circle_8cpp_html_a94682a4a70d5906857ca09de5b9fb2cc"><div class="ttname"><a href="#a94682a4a70d5906857ca09de5b9fb2cc">TriangleArea</a></div><div class="ttdeci">double TriangleArea(const Point &amp;A, const Point &amp;B, const Point &amp;C)</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:54</div></div>
-<div class="ttc" id="asmallest__circle_8cpp_html_aee6d48762c1dfb9f14627927f0c16fad"><div class="ttname"><a href="#aee6d48762c1dfb9f14627927f0c16fad">PointInCircle</a></div><div class="ttdeci">bool PointInCircle(const std::vector&lt; Point &gt; &amp;P, const Point &amp;Center, double R)</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:72</div></div>
-<div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:12</div></div>
-<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:14</div></div>
-</div><!-- 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="../../d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.svg" width="488" height="216"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="asmallest__circle_8cpp_html_a3cbebd6f4d2cdf227663c67fe41ba12a"><div class="ttname"><a href="#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a></div><div class="ttdeci">double LenghtLine(const Point &amp;A, const Point &amp;B)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d01/smallest__circle_8cpp_source.html#l00037">smallest_circle.cpp:37</a></div></div>
+<div class="ttc" id="asmallest__circle_8cpp_html_a94682a4a70d5906857ca09de5b9fb2cc"><div class="ttname"><a href="#a94682a4a70d5906857ca09de5b9fb2cc">TriangleArea</a></div><div class="ttdeci">double TriangleArea(const Point &amp;A, const Point &amp;B, const Point &amp;C)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d01/smallest__circle_8cpp_source.html#l00054">smallest_circle.cpp:54</a></div></div>
+<div class="ttc" id="asmallest__circle_8cpp_html_aee6d48762c1dfb9f14627927f0c16fad"><div class="ttname"><a href="#aee6d48762c1dfb9f14627927f0c16fad">PointInCircle</a></div><div class="ttdeci">bool PointInCircle(const std::vector&lt; Point &gt; &amp;P, const Point &amp;Center, double R)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d01/smallest__circle_8cpp_source.html#l00072">smallest_circle.cpp:72</a></div></div>
+<div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition</b> <a href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00012">line_segment_intersection.cpp:12</a></div></div>
+<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00014">line_segment_intersection.cpp:14</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a3cbebd6f4d2cdf227663c67fe41ba12a" name="a3cbebd6f4d2cdf227663c67fe41ba12a"></a>
@@ -283,18 +298,14 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>ditance </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html">smallest_circle.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   37</span>                                                  {</div>
 <div class="line"><span class="lineno">   38</span>    <span class="keywordtype">double</span> dx = B.x - A.x;</div>
 <div class="line"><span class="lineno">   39</span>    <span class="keywordtype">double</span> dy = B.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> - A.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>;</div>
-<div class="line"><span class="lineno">   40</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>((dx * dx) + (dy * dy));</div>
+<div class="line"><span class="lineno">   40</span>    <span class="keywordflow">return</span> std::sqrt((dx * dx) + (dy * dy));</div>
 <div class="line"><span class="lineno">   41</span>}</div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.svg" width="212" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -312,23 +323,20 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Main program </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html#l00198">198</a> of file <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html">smallest_circle.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  198</span>           {</div>
 <div class="line"><span class="lineno">  199</span>    <a class="code hl_function" href="#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
-<div class="line"><span class="lineno">  200</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  200</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  201</span>    <a class="code hl_function" href="#a0283886819c7c140a023582b7269e2d0">test2</a>();</div>
-<div class="line"><span class="lineno">  202</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  203</span>    <a class="code hl_function" href="#a6d0455dd5c30adda100e95f0423c786e">test3</a>();</div>
 <div class="line"><span class="lineno">  204</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  205</span>}</div>
-<div class="ttc" id="asmallest__circle_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:173</div></div>
-<div class="ttc" id="asmallest__circle_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:188</div></div>
-<div class="ttc" id="asmallest__circle_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:158</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="544"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="asmallest__circle_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d01/smallest__circle_8cpp_source.html#l00173">smallest_circle.cpp:173</a></div></div>
+<div class="ttc" id="asmallest__circle_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d01/smallest__circle_8cpp_source.html#l00188">smallest_circle.cpp:188</a></div></div>
+<div class="ttc" id="asmallest__circle_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d01/smallest__circle_8cpp_source.html#l00158">smallest_circle.cpp:158</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aee6d48762c1dfb9f14627927f0c16fad" name="aee6d48762c1dfb9f14627927f0c16fad"></a>
@@ -340,7 +348,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool PointInCircle </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>P</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>P</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -365,19 +373,16 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>True if P lies on or within the circle </dd>
 <dd>
 False if P lies outside the circle </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html#l00072">72</a> of file <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html">smallest_circle.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   72</span>                                                                             {</div>
-<div class="line"><span class="lineno">   73</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; P.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
+<div class="line"><span class="lineno">   73</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; P.size(); i++) {</div>
 <div class="line"><span class="lineno">   74</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(P[i], Center) &gt; R)</div>
 <div class="line"><span class="lineno">   75</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   76</span>    }</div>
 <div class="line"><span class="lineno">   77</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   78</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.svg" width="388" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae1a3968e7947464bee7714f6d43b7002" name="ae1a3968e7947464bee7714f6d43b7002"></a>
@@ -398,24 +403,19 @@ Here is the call graph for this function:</div>
  Circle with <br  />
  radius 3.318493136080724 <br  />
  centre at (3.0454545454545454, 1.3181818181818181) </p>
-<div class="fragment"><div class="line"><span class="lineno">  158</span>            {</div>
-<div class="line"><span class="lineno">  159</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Point&gt;</a> Pv;</div>
-<div class="line"><span class="lineno">  160</span>    Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(0, 0));</div>
-<div class="line"><span class="lineno">  161</span>    Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(5, 4));</div>
-<div class="line"><span class="lineno">  162</span>    Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(1, 3));</div>
-<div class="line"><span class="lineno">  163</span>    Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(4, 1));</div>
-<div class="line"><span class="lineno">  164</span>    Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(3, -2));</div>
-<div class="line"><span class="lineno">  165</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#a0b0676df8e4da7a08c7ccaecea344903">circle</a>(Pv) &lt;&lt; <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">  166</span>}</div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="asmallest__circle_8cpp_html_a0b0676df8e4da7a08c7ccaecea344903"><div class="ttname"><a href="#a0b0676df8e4da7a08c7ccaecea344903">circle</a></div><div class="ttdeci">double circle(const std::vector&lt; Point &gt; &amp;P)</div><div class="ttdef"><b>Definition</b> smallest_circle.cpp:87</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>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg" width="100%" height="464"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html#l00158">158</a> of file <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html">smallest_circle.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  158</span>            {</div>
+<div class="line"><span class="lineno">  159</span>    std::vector&lt;Point&gt; Pv;</div>
+<div class="line"><span class="lineno">  160</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(0, 0));</div>
+<div class="line"><span class="lineno">  161</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(5, 4));</div>
+<div class="line"><span class="lineno">  162</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(1, 3));</div>
+<div class="line"><span class="lineno">  163</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(4, 1));</div>
+<div class="line"><span class="lineno">  164</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(3, -2));</div>
+<div class="line"><span class="lineno">  165</span>    std::cout &lt;&lt; <a class="code hl_function" href="#a0b0676df8e4da7a08c7ccaecea344903">circle</a>(Pv) &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  166</span>}</div>
+<div class="ttc" id="asmallest__circle_8cpp_html_a0b0676df8e4da7a08c7ccaecea344903"><div class="ttname"><a href="#a0b0676df8e4da7a08c7ccaecea344903">circle</a></div><div class="ttdeci">double circle(const std::vector&lt; Point &gt; &amp;P)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d01/smallest__circle_8cpp_source.html#l00087">smallest_circle.cpp:87</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0283886819c7c140a023582b7269e2d0" name="a0283886819c7c140a023582b7269e2d0"></a>
@@ -436,20 +436,17 @@ Here is the call graph for this function:</div>
  Circle with <br  />
  radius 1.4142135623730951 <br  />
  centre at (1.0, 1.0) </p>
-<div class="fragment"><div class="line"><span class="lineno">  173</span>             {</div>
-<div class="line"><span class="lineno">  174</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Point&gt;</a> Pv;</div>
-<div class="line"><span class="lineno">  175</span>    Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(0, 0));</div>
-<div class="line"><span class="lineno">  176</span>    Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(0, 2));</div>
-<div class="line"><span class="lineno">  177</span>    Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(2, 2));</div>
-<div class="line"><span class="lineno">  178</span>    Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(2, 0));</div>
-<div class="line"><span class="lineno">  179</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#a0b0676df8e4da7a08c7ccaecea344903">circle</a>(Pv) &lt;&lt; <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">  180</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg" width="100%" height="464"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html#l00173">173</a> of file <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html">smallest_circle.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  173</span>             {</div>
+<div class="line"><span class="lineno">  174</span>    std::vector&lt;Point&gt; Pv;</div>
+<div class="line"><span class="lineno">  175</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(0, 0));</div>
+<div class="line"><span class="lineno">  176</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(0, 2));</div>
+<div class="line"><span class="lineno">  177</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(2, 2));</div>
+<div class="line"><span class="lineno">  178</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(2, 0));</div>
+<div class="line"><span class="lineno">  179</span>    std::cout &lt;&lt; <a class="code hl_function" href="#a0b0676df8e4da7a08c7ccaecea344903">circle</a>(Pv) &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  180</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6d0455dd5c30adda100e95f0423c786e" name="a6d0455dd5c30adda100e95f0423c786e"></a>
@@ -470,20 +467,17 @@ Here is the call graph for this function:</div>
  Circle with <br  />
  radius 1.821078397711709 <br  />
  centre at (2.142857142857143, 1.7857142857142856) </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000010">Todo</a></b></dt><dd>This test fails </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  188</span>             {</div>
-<div class="line"><span class="lineno">  189</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Point&gt;</a> Pv;</div>
-<div class="line"><span class="lineno">  190</span>    Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(0.5, 1));</div>
-<div class="line"><span class="lineno">  191</span>    Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(3.5, 3));</div>
-<div class="line"><span class="lineno">  192</span>    Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(2.5, 0));</div>
-<div class="line"><span class="lineno">  193</span>    Pv.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(2, 1.5));</div>
-<div class="line"><span class="lineno">  194</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#a0b0676df8e4da7a08c7ccaecea344903">circle</a>(Pv) &lt;&lt; <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">  195</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg" width="100%" height="464"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html#l00188">188</a> of file <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html">smallest_circle.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  188</span>             {</div>
+<div class="line"><span class="lineno">  189</span>    std::vector&lt;Point&gt; Pv;</div>
+<div class="line"><span class="lineno">  190</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(0.5, 1));</div>
+<div class="line"><span class="lineno">  191</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(3.5, 3));</div>
+<div class="line"><span class="lineno">  192</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(2.5, 0));</div>
+<div class="line"><span class="lineno">  193</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(2, 1.5));</div>
+<div class="line"><span class="lineno">  194</span>    std::cout &lt;&lt; <a class="code hl_function" href="#a0b0676df8e4da7a08c7ccaecea344903">circle</a>(Pv) &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  195</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a94682a4a70d5906857ca09de5b9fb2cc" name="a94682a4a70d5906857ca09de5b9fb2cc"></a>
@@ -521,19 +515,16 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>area of triangle </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html#l00054">54</a> of file <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html">smallest_circle.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   54</span>                                                                    {</div>
 <div class="line"><span class="lineno">   55</span>    <span class="keywordtype">double</span> a = <a class="code hl_function" href="#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(A, B);</div>
 <div class="line"><span class="lineno">   56</span>    <span class="keywordtype">double</span> b = <a class="code hl_function" href="#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(B, C);</div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordtype">double</span> c = <a class="code hl_function" href="#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(C, A);</div>
 <div class="line"><span class="lineno">   58</span>    <span class="keywordtype">double</span> p = (a + b + c) / 2;</div>
-<div class="line"><span class="lineno">   59</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(p * (p - a) * (p - b) * (p - c));</div>
+<div class="line"><span class="lineno">   59</span>    <span class="keywordflow">return</span> std::sqrt(p * (p - a) * (p - b) * (p - c));</div>
 <div class="line"><span class="lineno">   60</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.svg" width="355" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
deleted file mode 100644
index 5e0d145f7..000000000
--- a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
+++ /dev/null
@@ -1,24 +0,0 @@
-<map id="test2" name="test2">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,93,56,119"/>
-<area shape="rect" id="Node000002" href="$d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903" title=" " alt="" coords="155,93,207,119"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,104,139,104,139,109,56,109"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="318,5,390,31"/>
-<area shape="poly" id="edge12_Node000001_Node000003" title=" " alt="" coords="55,94,103,78,210,49,303,27,304,32,211,54,104,83,57,99"/>
-<area shape="rect" id="Node000009" 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="104,143,258,168"/>
-<area shape="poly" id="edge13_Node000001_Node000009" title=" " alt="" coords="57,112,105,129,123,135,121,140,103,134,55,117"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="206,91,305,40,312,36,314,41,307,45,209,96"/>
-<area shape="rect" id="Node000004" href="$d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" title=" " alt="" coords="466,105,550,131"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="208,104,450,113,450,119,208,110"/>
-<area shape="rect" id="Node000006" href="$d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad" title=" " alt="" coords="306,156,402,182"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="208,111,259,128,309,147,307,152,257,133,207,116"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="450,181,566,207"/>
-<area shape="poly" id="edge8_Node000002_Node000007" title=" " alt="" coords="208,108,234,115,260,128,275,145,283,163,291,179,307,192,338,203,371,208,435,207,435,212,370,214,337,208,305,196,287,182,279,165,271,148,256,132,232,120,207,113"/>
-<area shape="rect" id="Node000008" href="$d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc" title=" " alt="" coords="307,55,401,80"/>
-<area shape="poly" id="edge9_Node000002_Node000008" title=" " alt="" coords="207,98,291,79,292,84,208,103"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="614,80,683,106"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="550,108,598,99,599,104,551,113"/>
-<area shape="poly" id="edge6_Node000006_Node000004" title=" " alt="" coords="395,153,452,134,453,139,396,158"/>
-<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="403,174,435,179,434,185,402,179"/>
-<area shape="poly" id="edge10_Node000008_Node000004" title=" " alt="" coords="396,78,453,97,452,102,395,83"/>
-<area shape="poly" id="edge11_Node000008_Node000005" title=" " alt="" coords="402,69,598,86,598,91,401,74"/>
-</map>
diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
deleted file mode 100644
index 0e39a5cc1..000000000
--- a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-196b06354bde39a1f0e7c814ded9d059
\ No newline at end of file
diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
deleted file mode 100644
index 306f696c0..000000000
--- a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
+++ /dev/null
@@ -1,293 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<!--zoomable 164 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 516;
-var viewHeight = 164;
-var sectionId = 'dynsection-6';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-89.64 0,-89.64 0,-70.39 37.75,-70.39 37.75,-89.64"/>
-<text text-anchor="middle" x="18.88" y="-76.14" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.25,-89.64 112,-89.64 112,-70.39 151.25,-70.39 151.25,-89.64"/>
-<text text-anchor="middle" x="131.62" y="-76.14" font-family="Helvetica,sans-Serif" font-size="10.00">circle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.16,-80.01C55.03,-80.01 80.4,-80.01 100.3,-80.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.05,-83.51 110.05,-80.01 100.05,-76.51 100.05,-83.51"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="288.38,-155.64 234.88,-155.64 234.88,-136.39 288.38,-136.39 288.38,-155.64"/>
-<text text-anchor="middle" x="261.62" y="-142.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge12_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge12_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-86.95C48.55,-90.75 61.79,-95.41 73.75,-99.01 125.13,-114.5 185.49,-129.03 223.41,-137.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.41,-141.09 232.94,-139.89 223.97,-134.26 222.41,-141.09"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.5,-52.64 73.75,-52.64 73.75,-33.39 189.5,-33.39 189.5,-52.64"/>
-<text text-anchor="middle" x="131.62" y="-39.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge13_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge13_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.78,-73.53C48.24,-69.79 61.71,-65.04 73.75,-61.01 78.17,-59.53 82.79,-58.02 87.41,-56.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.18,-59.95 96.64,-53.57 86.05,-53.29 88.18,-59.95"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.47,-89.78C170.23,-99.49 199.84,-114.81 225.5,-128.01 227.22,-128.9 228.98,-129.8 230.76,-130.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.09,-133.79 239.58,-135.24 232.28,-127.56 229.09,-133.79"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408.62,-80.64 345.38,-80.64 345.38,-61.39 408.62,-61.39 408.62,-80.64"/>
-<text text-anchor="middle" x="377" y="-67.14" font-family="Helvetica,sans-Serif" font-size="10.00">LenghtLine</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.72,-79.31C190.68,-77.87 280.16,-74.56 333.57,-72.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.66,-76.08 343.52,-72.21 333.4,-69.09 333.66,-76.08"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="297.75,-42.64 225.5,-42.64 225.5,-23.39 297.75,-23.39 297.75,-42.64"/>
-<text text-anchor="middle" x="261.62" y="-29.14" font-family="Helvetica,sans-Serif" font-size="10.00">PointInCircle</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.71,-74.39C162.81,-71.02 177.03,-66.52 189.5,-62.01 201.89,-57.54 215.3,-52.2 227.11,-47.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.14,-50.69 236.03,-43.61 225.45,-44.23 228.14,-50.69"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="420.25,-23.64 333.75,-23.64 333.75,-4.39 420.25,-4.39 420.25,-23.64"/>
-<text text-anchor="middle" x="377" y="-10.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge8_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge8_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.62,-77.06C163.35,-74.53 178.26,-69.98 189.5,-62.01 211.25,-46.59 201.65,-25.94 225.5,-14.01 255.13,0.8 292.33,0.94 322.34,-2.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="321.56,-6.12 331.95,-4.04 322.53,0.82 321.56,-6.12"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="297,-118.64 226.25,-118.64 226.25,-99.39 297,-99.39 297,-118.64"/>
-<text text-anchor="middle" x="261.62" y="-105.14" font-family="Helvetica,sans-Serif" font-size="10.00">TriangleArea</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge9_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge9_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.51,-84.29C168.15,-88.06 193.07,-93.71 214.9,-98.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.97,-102.03 224.49,-100.83 215.51,-95.2 213.97,-102.03"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="508.25,-99.64 456.25,-99.64 456.25,-80.39 508.25,-80.39 508.25,-99.64"/>
-<text text-anchor="middle" x="482.25" y="-86.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M408.98,-76.71C420.21,-78.78 432.99,-81.13 444.66,-83.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="443.89,-86.7 454.36,-85.06 445.16,-79.81 443.89,-86.7"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge6_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge6_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.71,-43.1C305.75,-47.47 321.23,-52.65 335.28,-57.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.14,-60.67 344.73,-60.53 336.36,-54.04 334.14,-60.67"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M298.19,-27.05C305.78,-25.78 313.96,-24.41 322.07,-23.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.63,-26.51 331.92,-21.4 321.47,-19.6 322.63,-26.51"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge10_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge10_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.71,-98.93C305.75,-94.56 321.23,-89.37 335.28,-84.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.36,-87.99 344.73,-81.49 334.14,-81.35 336.36,-87.99"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge11_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge11_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.27,-106C337.48,-102.51 403.53,-96.77 444.59,-93.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="444.8,-96.69 454.46,-92.34 444.2,-89.72 444.8,-96.69"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
deleted file mode 100644
index 06429ba56..000000000
--- a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
+++ /dev/null
@@ -1,210 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="516pt" height="164pt"
- viewBox="0.00 0.00 516.25 163.64" 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 159.64)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-89.64 0,-89.64 0,-70.39 37.75,-70.39 37.75,-89.64"/>
-<text text-anchor="middle" x="18.88" y="-76.14" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.25,-89.64 112,-89.64 112,-70.39 151.25,-70.39 151.25,-89.64"/>
-<text text-anchor="middle" x="131.62" y="-76.14" font-family="Helvetica,sans-Serif" font-size="10.00">circle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.16,-80.01C55.03,-80.01 80.4,-80.01 100.3,-80.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.05,-83.51 110.05,-80.01 100.05,-76.51 100.05,-83.51"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="288.38,-155.64 234.88,-155.64 234.88,-136.39 288.38,-136.39 288.38,-155.64"/>
-<text text-anchor="middle" x="261.62" y="-142.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge12_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge12_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-86.95C48.55,-90.75 61.79,-95.41 73.75,-99.01 125.13,-114.5 185.49,-129.03 223.41,-137.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.41,-141.09 232.94,-139.89 223.97,-134.26 222.41,-141.09"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.5,-52.64 73.75,-52.64 73.75,-33.39 189.5,-33.39 189.5,-52.64"/>
-<text text-anchor="middle" x="131.62" y="-39.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge13_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge13_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.78,-73.53C48.24,-69.79 61.71,-65.04 73.75,-61.01 78.17,-59.53 82.79,-58.02 87.41,-56.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.18,-59.95 96.64,-53.57 86.05,-53.29 88.18,-59.95"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.47,-89.78C170.23,-99.49 199.84,-114.81 225.5,-128.01 227.22,-128.9 228.98,-129.8 230.76,-130.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.09,-133.79 239.58,-135.24 232.28,-127.56 229.09,-133.79"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408.62,-80.64 345.38,-80.64 345.38,-61.39 408.62,-61.39 408.62,-80.64"/>
-<text text-anchor="middle" x="377" y="-67.14" font-family="Helvetica,sans-Serif" font-size="10.00">LenghtLine</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.72,-79.31C190.68,-77.87 280.16,-74.56 333.57,-72.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.66,-76.08 343.52,-72.21 333.4,-69.09 333.66,-76.08"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="297.75,-42.64 225.5,-42.64 225.5,-23.39 297.75,-23.39 297.75,-42.64"/>
-<text text-anchor="middle" x="261.62" y="-29.14" font-family="Helvetica,sans-Serif" font-size="10.00">PointInCircle</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.71,-74.39C162.81,-71.02 177.03,-66.52 189.5,-62.01 201.89,-57.54 215.3,-52.2 227.11,-47.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.14,-50.69 236.03,-43.61 225.45,-44.23 228.14,-50.69"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="420.25,-23.64 333.75,-23.64 333.75,-4.39 420.25,-4.39 420.25,-23.64"/>
-<text text-anchor="middle" x="377" y="-10.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge8_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge8_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.62,-77.06C163.35,-74.53 178.26,-69.98 189.5,-62.01 211.25,-46.59 201.65,-25.94 225.5,-14.01 255.13,0.8 292.33,0.94 322.34,-2.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="321.56,-6.12 331.95,-4.04 322.53,0.82 321.56,-6.12"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="297,-118.64 226.25,-118.64 226.25,-99.39 297,-99.39 297,-118.64"/>
-<text text-anchor="middle" x="261.62" y="-105.14" font-family="Helvetica,sans-Serif" font-size="10.00">TriangleArea</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge9_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge9_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.51,-84.29C168.15,-88.06 193.07,-93.71 214.9,-98.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.97,-102.03 224.49,-100.83 215.51,-95.2 213.97,-102.03"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="508.25,-99.64 456.25,-99.64 456.25,-80.39 508.25,-80.39 508.25,-99.64"/>
-<text text-anchor="middle" x="482.25" y="-86.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M408.98,-76.71C420.21,-78.78 432.99,-81.13 444.66,-83.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="443.89,-86.7 454.36,-85.06 445.16,-79.81 443.89,-86.7"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge6_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge6_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.71,-43.1C305.75,-47.47 321.23,-52.65 335.28,-57.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.14,-60.67 344.73,-60.53 336.36,-54.04 334.14,-60.67"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M298.19,-27.05C305.78,-25.78 313.96,-24.41 322.07,-23.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.63,-26.51 331.92,-21.4 321.47,-19.6 322.63,-26.51"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge10_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge10_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.71,-98.93C305.75,-94.56 321.23,-89.37 335.28,-84.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.36,-87.99 344.73,-81.49 334.14,-81.35 336.36,-87.99"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge11_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge11_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.27,-106C337.48,-102.51 403.53,-96.77 444.59,-93.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="444.8,-96.69 454.46,-92.34 444.2,-89.72 444.8,-96.69"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.map b/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.map
deleted file mode 100644
index af190fe5d..000000000
--- a/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="circle" name="circle">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,105,58,131"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="118,5,190,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="41,103,68,73,104,40,108,37,111,41,107,44,72,76,45,107"/>
-<area shape="rect" id="Node000003" href="$d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" title=" " alt="" coords="266,105,350,131"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="58,116,250,116,250,121,58,121"/>
-<area shape="rect" id="Node000005" href="$d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad" title=" " alt="" coords="106,156,202,182"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="59,126,108,147,106,152,57,131"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="250,181,365,207"/>
-<area shape="poly" id="edge7_Node000001_Node000006" title=" " alt="" coords="43,130,68,163,86,179,107,192,138,201,170,206,234,205,234,210,170,211,137,207,105,197,83,184,64,167,39,133"/>
-<area shape="rect" id="Node000007" href="$d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc" title=" " alt="" coords="107,55,201,80"/>
-<area shape="poly" id="edge8_Node000001_Node000007" title=" " alt="" coords="57,105,106,84,108,89,59,110"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="413,80,483,106"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="350,108,397,99,398,104,351,113"/>
-<area shape="poly" id="edge5_Node000005_Node000003" title=" " alt="" coords="194,153,251,134,253,139,196,158"/>
-<area shape="poly" id="edge6_Node000005_Node000006" title=" " alt="" coords="203,174,235,179,234,185,202,179"/>
-<area shape="poly" id="edge9_Node000007_Node000003" title=" " alt="" coords="196,78,253,97,251,102,194,83"/>
-<area shape="poly" id="edge10_Node000007_Node000004" title=" " alt="" coords="202,69,398,86,398,91,201,74"/>
-</map>
diff --git a/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.md5 b/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.md5
deleted file mode 100644
index b26fd610a..000000000
--- a/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ef17bca7ed6a95d16d1ab1b5eb3a8311
\ No newline at end of file
diff --git a/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.svg b/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.svg
deleted file mode 100644
index 9229a07eb..000000000
--- a/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.svg
+++ /dev/null
@@ -1,191 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: circle Pages: 1 -->
-<svg width="366pt" height="162pt"
- viewBox="0.00 0.00 366.00 161.91" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 157.91)">
-<title>circle</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="39.25,-78.91 0,-78.91 0,-59.66 39.25,-59.66 39.25,-78.91"/>
-<text text-anchor="middle" x="19.62" y="-65.41" font-family="Helvetica,sans-Serif" font-size="10.00">circle</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.12,-153.91 84.62,-153.91 84.62,-134.66 138.12,-134.66 138.12,-153.91"/>
-<text text-anchor="middle" x="111.38" y="-140.41" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.3,-79.12C38.18,-91.31 56.34,-112.2 75.25,-126.29 76.24,-127.02 77.26,-127.74 78.31,-128.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.47,-131.43 86.86,-133.55 80.06,-125.42 76.47,-131.43"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.38,-78.91 195.12,-78.91 195.12,-59.66 258.38,-59.66 258.38,-78.91"/>
-<text text-anchor="middle" x="226.75" y="-65.41" font-family="Helvetica,sans-Serif" font-size="10.00">LenghtLine</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.55,-69.29C72.15,-69.29 139.61,-69.29 183.75,-69.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.47,-72.79 193.47,-69.29 183.47,-65.79 183.47,-72.79"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="147.5,-40.91 75.25,-40.91 75.25,-21.66 147.5,-21.66 147.5,-40.91"/>
-<text text-anchor="middle" x="111.38" y="-27.41" font-family="Helvetica,sans-Serif" font-size="10.00">PointInCircle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.66,-61.23C50.24,-56.74 63.74,-51.03 76.1,-45.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.33,-49.08 85.17,-41.96 74.6,-42.63 77.33,-49.08"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270,-21.91 183.5,-21.91 183.5,-2.66 270,-2.66 270,-21.91"/>
-<text text-anchor="middle" x="226.75" y="-8.41" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.5,-59.3C35.17,-45.68 52.81,-21.86 75.25,-12.29 105.38,0.57 142.09,0.84 171.71,-2.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.25,-5.71 181.6,-3.44 172.09,1.24 171.25,-5.71"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146.75,-116.91 76,-116.91 76,-97.66 146.75,-97.66 146.75,-116.91"/>
-<text text-anchor="middle" x="111.38" y="-103.41" font-family="Helvetica,sans-Serif" font-size="10.00">TriangleArea</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge8_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.66,-77.34C50.24,-81.83 63.74,-87.54 76.1,-92.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.6,-95.94 85.17,-96.61 77.33,-89.49 74.6,-95.94"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358,-97.91 306,-97.91 306,-78.66 358,-78.66 358,-97.91"/>
-<text text-anchor="middle" x="332" y="-84.41" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.73,-74.99C269.96,-77.05 282.74,-79.4 294.41,-81.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.64,-84.97 304.11,-83.34 294.91,-78.08 293.64,-84.97"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge5_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge5_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.46,-41.37C155.5,-45.74 170.98,-50.93 185.03,-55.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.89,-58.95 194.48,-58.81 186.11,-52.31 183.89,-58.95"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.94,-25.33C155.53,-24.05 163.71,-22.68 171.82,-21.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.38,-24.78 181.67,-19.67 171.22,-17.87 172.38,-24.78"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge9_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge9_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.46,-97.2C155.5,-92.83 170.98,-87.64 185.03,-82.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="186.11,-86.26 194.48,-79.77 183.89,-79.62 186.11,-86.26"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge10_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge10_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.02,-104.27C187.23,-100.78 253.28,-95.04 294.34,-91.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.55,-94.97 304.21,-90.61 293.95,-87.99 294.55,-94.97"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph_org.svg
deleted file mode 100644
index 59cbec4e8..000000000
--- a/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph_org.svg
+++ /dev/null
@@ -1,165 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: circle Pages: 1 -->
-<svg width="366pt" height="162pt"
- viewBox="0.00 0.00 366.00 161.91" 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 157.91)">
-<title>circle</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="39.25,-78.91 0,-78.91 0,-59.66 39.25,-59.66 39.25,-78.91"/>
-<text text-anchor="middle" x="19.62" y="-65.41" font-family="Helvetica,sans-Serif" font-size="10.00">circle</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.12,-153.91 84.62,-153.91 84.62,-134.66 138.12,-134.66 138.12,-153.91"/>
-<text text-anchor="middle" x="111.38" y="-140.41" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.3,-79.12C38.18,-91.31 56.34,-112.2 75.25,-126.29 76.24,-127.02 77.26,-127.74 78.31,-128.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.47,-131.43 86.86,-133.55 80.06,-125.42 76.47,-131.43"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.38,-78.91 195.12,-78.91 195.12,-59.66 258.38,-59.66 258.38,-78.91"/>
-<text text-anchor="middle" x="226.75" y="-65.41" font-family="Helvetica,sans-Serif" font-size="10.00">LenghtLine</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.55,-69.29C72.15,-69.29 139.61,-69.29 183.75,-69.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.47,-72.79 193.47,-69.29 183.47,-65.79 183.47,-72.79"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="147.5,-40.91 75.25,-40.91 75.25,-21.66 147.5,-21.66 147.5,-40.91"/>
-<text text-anchor="middle" x="111.38" y="-27.41" font-family="Helvetica,sans-Serif" font-size="10.00">PointInCircle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.66,-61.23C50.24,-56.74 63.74,-51.03 76.1,-45.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.33,-49.08 85.17,-41.96 74.6,-42.63 77.33,-49.08"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270,-21.91 183.5,-21.91 183.5,-2.66 270,-2.66 270,-21.91"/>
-<text text-anchor="middle" x="226.75" y="-8.41" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.5,-59.3C35.17,-45.68 52.81,-21.86 75.25,-12.29 105.38,0.57 142.09,0.84 171.71,-2.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.25,-5.71 181.6,-3.44 172.09,1.24 171.25,-5.71"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146.75,-116.91 76,-116.91 76,-97.66 146.75,-97.66 146.75,-116.91"/>
-<text text-anchor="middle" x="111.38" y="-103.41" font-family="Helvetica,sans-Serif" font-size="10.00">TriangleArea</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge8_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.66,-77.34C50.24,-81.83 63.74,-87.54 76.1,-92.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.6,-95.94 85.17,-96.61 77.33,-89.49 74.6,-95.94"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358,-97.91 306,-97.91 306,-78.66 358,-78.66 358,-97.91"/>
-<text text-anchor="middle" x="332" y="-84.41" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.73,-74.99C269.96,-77.05 282.74,-79.4 294.41,-81.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.64,-84.97 304.11,-83.34 294.91,-78.08 293.64,-84.97"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge5_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge5_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.46,-41.37C155.5,-45.74 170.98,-50.93 185.03,-55.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.89,-58.95 194.48,-58.81 186.11,-52.31 183.89,-58.95"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.94,-25.33C155.53,-24.05 163.71,-22.68 171.82,-21.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.38,-24.78 181.67,-19.67 171.22,-17.87 172.38,-24.78"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge9_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge9_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.46,-97.2C155.5,-92.83 170.98,-87.64 185.03,-82.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="186.11,-86.26 194.48,-79.77 183.89,-79.62 186.11,-86.26"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge10_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge10_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.02,-104.27C187.23,-100.78 253.28,-95.04 294.34,-91.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.55,-94.97 304.21,-90.61 293.95,-87.99 294.55,-94.97"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.map b/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.map
deleted file mode 100644
index ddc7d05b7..000000000
--- a/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="LenghtLine" name="LenghtLine">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,90,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="138,5,207,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="90,16,122,16,122,21,90,21"/>
-</map>
diff --git a/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.md5 b/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.md5
deleted file mode 100644
index e2842119a..000000000
--- a/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f3de04d111811ab00b16e23018f142cd
\ No newline at end of file
diff --git a/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.svg b/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.svg
deleted file mode 100644
index 648334807..000000000
--- a/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: LenghtLine Pages: 1 -->
-<svg width="159pt" height="27pt"
- viewBox="0.00 0.00 159.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>LenghtLine</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="63.25,-19.25 0,-19.25 0,0 63.25,0 63.25,-19.25"/>
-<text text-anchor="middle" x="31.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LenghtLine</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.25,-19.25 99.25,-19.25 99.25,0 151.25,0 151.25,-19.25"/>
-<text text-anchor="middle" x="125.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.65,-9.62C71.39,-9.62 79.76,-9.62 87.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.53,-13.13 97.53,-9.63 87.53,-6.13 87.53,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph_org.svg
deleted file mode 100644
index c563ecfd1..000000000
--- a/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: LenghtLine Pages: 1 -->
-<svg width="159pt" height="27pt"
- viewBox="0.00 0.00 159.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>LenghtLine</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="63.25,-19.25 0,-19.25 0,0 63.25,0 63.25,-19.25"/>
-<text text-anchor="middle" x="31.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LenghtLine</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.25,-19.25 99.25,-19.25 99.25,0 151.25,0 151.25,-19.25"/>
-<text text-anchor="middle" x="125.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.65,-9.62C71.39,-9.62 79.76,-9.62 87.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.53,-13.13 97.53,-9.63 87.53,-6.13 87.53,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
deleted file mode 100644
index 6de0552b9..000000000
--- a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
+++ /dev/null
@@ -1,24 +0,0 @@
-<map id="test3" name="test3">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,93,56,119"/>
-<area shape="rect" id="Node000002" href="$d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903" title=" " alt="" coords="155,93,207,119"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,104,139,104,139,109,56,109"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="318,5,390,31"/>
-<area shape="poly" id="edge12_Node000001_Node000003" title=" " alt="" coords="55,94,103,78,210,49,303,27,304,32,211,54,104,83,57,99"/>
-<area shape="rect" id="Node000009" 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="104,143,258,168"/>
-<area shape="poly" id="edge13_Node000001_Node000009" title=" " alt="" coords="57,112,105,129,123,135,121,140,103,134,55,117"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="206,91,305,40,312,36,314,41,307,45,209,96"/>
-<area shape="rect" id="Node000004" href="$d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" title=" " alt="" coords="466,105,550,131"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="208,104,450,113,450,119,208,110"/>
-<area shape="rect" id="Node000006" href="$d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad" title=" " alt="" coords="306,156,402,182"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="208,111,259,128,309,147,307,152,257,133,207,116"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="450,181,566,207"/>
-<area shape="poly" id="edge8_Node000002_Node000007" title=" " alt="" coords="208,108,234,115,260,128,275,145,283,163,291,179,307,192,338,203,371,208,435,207,435,212,370,214,337,208,305,196,287,182,279,165,271,148,256,132,232,120,207,113"/>
-<area shape="rect" id="Node000008" href="$d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc" title=" " alt="" coords="307,55,401,80"/>
-<area shape="poly" id="edge9_Node000002_Node000008" title=" " alt="" coords="207,98,291,79,292,84,208,103"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="614,80,683,106"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="550,108,598,99,599,104,551,113"/>
-<area shape="poly" id="edge6_Node000006_Node000004" title=" " alt="" coords="395,153,452,134,453,139,396,158"/>
-<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="403,174,435,179,434,185,402,179"/>
-<area shape="poly" id="edge10_Node000008_Node000004" title=" " alt="" coords="396,78,453,97,452,102,395,83"/>
-<area shape="poly" id="edge11_Node000008_Node000005" title=" " alt="" coords="402,69,598,86,598,91,401,74"/>
-</map>
diff --git a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
deleted file mode 100644
index b26c41b72..000000000
--- a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8a0020290281957776e7f9d21cbb615d
\ No newline at end of file
diff --git a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
deleted file mode 100644
index afda87b47..000000000
--- a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
+++ /dev/null
@@ -1,293 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<!--zoomable 164 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 516;
-var viewHeight = 164;
-var sectionId = 'dynsection-7';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-89.64 0,-89.64 0,-70.39 37.75,-70.39 37.75,-89.64"/>
-<text text-anchor="middle" x="18.88" y="-76.14" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.25,-89.64 112,-89.64 112,-70.39 151.25,-70.39 151.25,-89.64"/>
-<text text-anchor="middle" x="131.62" y="-76.14" font-family="Helvetica,sans-Serif" font-size="10.00">circle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.16,-80.01C55.03,-80.01 80.4,-80.01 100.3,-80.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.05,-83.51 110.05,-80.01 100.05,-76.51 100.05,-83.51"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="288.38,-155.64 234.88,-155.64 234.88,-136.39 288.38,-136.39 288.38,-155.64"/>
-<text text-anchor="middle" x="261.62" y="-142.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge12_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge12_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-86.95C48.55,-90.75 61.79,-95.41 73.75,-99.01 125.13,-114.5 185.49,-129.03 223.41,-137.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.41,-141.09 232.94,-139.89 223.97,-134.26 222.41,-141.09"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.5,-52.64 73.75,-52.64 73.75,-33.39 189.5,-33.39 189.5,-52.64"/>
-<text text-anchor="middle" x="131.62" y="-39.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge13_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge13_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.78,-73.53C48.24,-69.79 61.71,-65.04 73.75,-61.01 78.17,-59.53 82.79,-58.02 87.41,-56.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.18,-59.95 96.64,-53.57 86.05,-53.29 88.18,-59.95"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.47,-89.78C170.23,-99.49 199.84,-114.81 225.5,-128.01 227.22,-128.9 228.98,-129.8 230.76,-130.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.09,-133.79 239.58,-135.24 232.28,-127.56 229.09,-133.79"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408.62,-80.64 345.38,-80.64 345.38,-61.39 408.62,-61.39 408.62,-80.64"/>
-<text text-anchor="middle" x="377" y="-67.14" font-family="Helvetica,sans-Serif" font-size="10.00">LenghtLine</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.72,-79.31C190.68,-77.87 280.16,-74.56 333.57,-72.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.66,-76.08 343.52,-72.21 333.4,-69.09 333.66,-76.08"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="297.75,-42.64 225.5,-42.64 225.5,-23.39 297.75,-23.39 297.75,-42.64"/>
-<text text-anchor="middle" x="261.62" y="-29.14" font-family="Helvetica,sans-Serif" font-size="10.00">PointInCircle</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.71,-74.39C162.81,-71.02 177.03,-66.52 189.5,-62.01 201.89,-57.54 215.3,-52.2 227.11,-47.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.14,-50.69 236.03,-43.61 225.45,-44.23 228.14,-50.69"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="420.25,-23.64 333.75,-23.64 333.75,-4.39 420.25,-4.39 420.25,-23.64"/>
-<text text-anchor="middle" x="377" y="-10.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge8_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge8_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.62,-77.06C163.35,-74.53 178.26,-69.98 189.5,-62.01 211.25,-46.59 201.65,-25.94 225.5,-14.01 255.13,0.8 292.33,0.94 322.34,-2.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="321.56,-6.12 331.95,-4.04 322.53,0.82 321.56,-6.12"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="297,-118.64 226.25,-118.64 226.25,-99.39 297,-99.39 297,-118.64"/>
-<text text-anchor="middle" x="261.62" y="-105.14" font-family="Helvetica,sans-Serif" font-size="10.00">TriangleArea</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge9_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge9_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.51,-84.29C168.15,-88.06 193.07,-93.71 214.9,-98.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.97,-102.03 224.49,-100.83 215.51,-95.2 213.97,-102.03"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="508.25,-99.64 456.25,-99.64 456.25,-80.39 508.25,-80.39 508.25,-99.64"/>
-<text text-anchor="middle" x="482.25" y="-86.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M408.98,-76.71C420.21,-78.78 432.99,-81.13 444.66,-83.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="443.89,-86.7 454.36,-85.06 445.16,-79.81 443.89,-86.7"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge6_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge6_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.71,-43.1C305.75,-47.47 321.23,-52.65 335.28,-57.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.14,-60.67 344.73,-60.53 336.36,-54.04 334.14,-60.67"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M298.19,-27.05C305.78,-25.78 313.96,-24.41 322.07,-23.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.63,-26.51 331.92,-21.4 321.47,-19.6 322.63,-26.51"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge10_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge10_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.71,-98.93C305.75,-94.56 321.23,-89.37 335.28,-84.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.36,-87.99 344.73,-81.49 334.14,-81.35 336.36,-87.99"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge11_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge11_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.27,-106C337.48,-102.51 403.53,-96.77 444.59,-93.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="444.8,-96.69 454.46,-92.34 444.2,-89.72 444.8,-96.69"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
deleted file mode 100644
index df99b27f4..000000000
--- a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
+++ /dev/null
@@ -1,210 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<svg width="516pt" height="164pt"
- viewBox="0.00 0.00 516.25 163.64" 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 159.64)">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-89.64 0,-89.64 0,-70.39 37.75,-70.39 37.75,-89.64"/>
-<text text-anchor="middle" x="18.88" y="-76.14" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.25,-89.64 112,-89.64 112,-70.39 151.25,-70.39 151.25,-89.64"/>
-<text text-anchor="middle" x="131.62" y="-76.14" font-family="Helvetica,sans-Serif" font-size="10.00">circle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.16,-80.01C55.03,-80.01 80.4,-80.01 100.3,-80.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.05,-83.51 110.05,-80.01 100.05,-76.51 100.05,-83.51"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="288.38,-155.64 234.88,-155.64 234.88,-136.39 288.38,-136.39 288.38,-155.64"/>
-<text text-anchor="middle" x="261.62" y="-142.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge12_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge12_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-86.95C48.55,-90.75 61.79,-95.41 73.75,-99.01 125.13,-114.5 185.49,-129.03 223.41,-137.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.41,-141.09 232.94,-139.89 223.97,-134.26 222.41,-141.09"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.5,-52.64 73.75,-52.64 73.75,-33.39 189.5,-33.39 189.5,-52.64"/>
-<text text-anchor="middle" x="131.62" y="-39.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge13_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge13_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.78,-73.53C48.24,-69.79 61.71,-65.04 73.75,-61.01 78.17,-59.53 82.79,-58.02 87.41,-56.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.18,-59.95 96.64,-53.57 86.05,-53.29 88.18,-59.95"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.47,-89.78C170.23,-99.49 199.84,-114.81 225.5,-128.01 227.22,-128.9 228.98,-129.8 230.76,-130.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.09,-133.79 239.58,-135.24 232.28,-127.56 229.09,-133.79"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408.62,-80.64 345.38,-80.64 345.38,-61.39 408.62,-61.39 408.62,-80.64"/>
-<text text-anchor="middle" x="377" y="-67.14" font-family="Helvetica,sans-Serif" font-size="10.00">LenghtLine</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.72,-79.31C190.68,-77.87 280.16,-74.56 333.57,-72.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.66,-76.08 343.52,-72.21 333.4,-69.09 333.66,-76.08"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="297.75,-42.64 225.5,-42.64 225.5,-23.39 297.75,-23.39 297.75,-42.64"/>
-<text text-anchor="middle" x="261.62" y="-29.14" font-family="Helvetica,sans-Serif" font-size="10.00">PointInCircle</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.71,-74.39C162.81,-71.02 177.03,-66.52 189.5,-62.01 201.89,-57.54 215.3,-52.2 227.11,-47.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.14,-50.69 236.03,-43.61 225.45,-44.23 228.14,-50.69"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="420.25,-23.64 333.75,-23.64 333.75,-4.39 420.25,-4.39 420.25,-23.64"/>
-<text text-anchor="middle" x="377" y="-10.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge8_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge8_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.62,-77.06C163.35,-74.53 178.26,-69.98 189.5,-62.01 211.25,-46.59 201.65,-25.94 225.5,-14.01 255.13,0.8 292.33,0.94 322.34,-2.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="321.56,-6.12 331.95,-4.04 322.53,0.82 321.56,-6.12"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="297,-118.64 226.25,-118.64 226.25,-99.39 297,-99.39 297,-118.64"/>
-<text text-anchor="middle" x="261.62" y="-105.14" font-family="Helvetica,sans-Serif" font-size="10.00">TriangleArea</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge9_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge9_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.51,-84.29C168.15,-88.06 193.07,-93.71 214.9,-98.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.97,-102.03 224.49,-100.83 215.51,-95.2 213.97,-102.03"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="508.25,-99.64 456.25,-99.64 456.25,-80.39 508.25,-80.39 508.25,-99.64"/>
-<text text-anchor="middle" x="482.25" y="-86.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M408.98,-76.71C420.21,-78.78 432.99,-81.13 444.66,-83.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="443.89,-86.7 454.36,-85.06 445.16,-79.81 443.89,-86.7"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge6_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge6_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.71,-43.1C305.75,-47.47 321.23,-52.65 335.28,-57.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.14,-60.67 344.73,-60.53 336.36,-54.04 334.14,-60.67"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M298.19,-27.05C305.78,-25.78 313.96,-24.41 322.07,-23.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.63,-26.51 331.92,-21.4 321.47,-19.6 322.63,-26.51"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge10_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge10_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.71,-98.93C305.75,-94.56 321.23,-89.37 335.28,-84.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.36,-87.99 344.73,-81.49 334.14,-81.35 336.36,-87.99"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge11_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge11_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.27,-106C337.48,-102.51 403.53,-96.77 444.59,-93.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="444.8,-96.69 454.46,-92.34 444.2,-89.72 444.8,-96.69"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.map b/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.map
deleted file mode 100644
index 34d3268e8..000000000
--- a/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="TriangleArea" name="TriangleArea">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,100,56"/>
-<area shape="rect" id="Node000002" href="$d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" title=" " alt="" coords="148,5,232,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="100,32,132,26,133,31,101,37"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="280,31,349,56"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="100,41,265,41,265,46,100,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="233,24,266,31,264,36,232,29"/>
-</map>
diff --git a/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.md5 b/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.md5
deleted file mode 100644
index 85d9783ba..000000000
--- a/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a0b5e2fab902e6d13c549d780fa12999
\ No newline at end of file
diff --git a/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.svg b/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.svg
deleted file mode 100644
index f23fc923e..000000000
--- a/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: TriangleArea Pages: 1 -->
-<svg width="266pt" height="46pt"
- viewBox="0.00 0.00 266.00 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>TriangleArea</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="70.75,-19.25 0,-19.25 0,0 70.75,0 70.75,-19.25"/>
-<text text-anchor="middle" x="35.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TriangleArea</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170,-38.25 106.75,-38.25 106.75,-19 170,-19 170,-38.25"/>
-<text text-anchor="middle" x="138.38" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">LenghtLine</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.13,-16.16C78.89,-17.62 87.2,-19.19 95.22,-20.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.31,-24.09 104.79,-22.49 95.61,-17.21 94.31,-24.09"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258,-19.25 206,-19.25 206,0 258,0 258,-19.25"/>
-<text text-anchor="middle" x="232" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.17,-9.62C105.94,-9.62 159.19,-9.62 194.54,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.28,-13.13 204.28,-9.63 194.28,-6.13 194.28,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.4,-22.19C178.23,-20.57 186.71,-18.81 194.77,-17.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.23,-20.62 204.31,-15.16 193.8,-13.76 195.23,-20.62"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph_org.svg
deleted file mode 100644
index 8de192e9c..000000000
--- a/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: TriangleArea Pages: 1 -->
-<svg width="266pt" height="46pt"
- viewBox="0.00 0.00 266.00 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>TriangleArea</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="70.75,-19.25 0,-19.25 0,0 70.75,0 70.75,-19.25"/>
-<text text-anchor="middle" x="35.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TriangleArea</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170,-38.25 106.75,-38.25 106.75,-19 170,-19 170,-38.25"/>
-<text text-anchor="middle" x="138.38" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">LenghtLine</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.13,-16.16C78.89,-17.62 87.2,-19.19 95.22,-20.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.31,-24.09 104.79,-22.49 95.61,-17.21 94.31,-24.09"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258,-19.25 206,-19.25 206,0 258,0 258,-19.25"/>
-<text text-anchor="middle" x="232" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.17,-9.62C105.94,-9.62 159.19,-9.62 194.54,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.28,-13.13 204.28,-9.63 194.28,-6.13 194.28,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.4,-22.19C178.23,-20.57 186.71,-18.81 194.77,-17.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.23,-20.62 204.31,-15.16 193.8,-13.76 195.23,-20.62"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
deleted file mode 100644
index 2bffcb8fd..000000000
--- a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
+++ /dev/null
@@ -1,24 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,93,49,119"/>
-<area shape="rect" id="Node000002" href="$d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903" title=" " alt="" coords="148,93,200,119"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,104,132,104,132,109,49,109"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="312,5,383,31"/>
-<area shape="poly" id="edge12_Node000001_Node000003" title=" " alt="" coords="48,95,96,78,202,49,296,26,297,32,204,54,97,83,50,100"/>
-<area shape="rect" id="Node000009" 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="97,143,251,168"/>
-<area shape="poly" id="edge13_Node000001_Node000009" title=" " alt="" coords="50,112,98,129,115,135,113,140,96,134,48,117"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="199,91,298,40,305,36,307,41,300,45,202,96"/>
-<area shape="rect" id="Node000004" href="$d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" title=" " alt="" coords="459,105,543,131"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="201,104,443,113,443,119,201,110"/>
-<area shape="rect" id="Node000006" href="$d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad" title=" " alt="" coords="299,156,395,182"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="201,111,252,128,302,147,300,152,250,133,200,116"/>
-<area shape="rect" id="Node000007" 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,181,559,207"/>
-<area shape="poly" id="edge8_Node000002_Node000007" title=" " alt="" coords="201,108,227,115,253,128,268,145,276,163,284,179,300,192,331,203,364,208,428,207,428,212,363,214,330,208,298,196,280,182,272,165,264,148,249,132,225,120,200,113"/>
-<area shape="rect" id="Node000008" href="$d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc" title=" " alt="" coords="300,55,394,80"/>
-<area shape="poly" id="edge9_Node000002_Node000008" title=" " alt="" coords="200,98,284,79,285,84,201,103"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="607,80,676,106"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="543,108,591,99,592,104,544,113"/>
-<area shape="poly" id="edge6_Node000006_Node000004" title=" " alt="" coords="388,153,445,134,446,139,389,158"/>
-<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="396,174,428,179,427,185,395,179"/>
-<area shape="poly" id="edge10_Node000008_Node000004" title=" " alt="" coords="389,78,446,97,445,102,388,83"/>
-<area shape="poly" id="edge11_Node000008_Node000005" title=" " alt="" coords="395,69,591,86,591,91,394,74"/>
-</map>
diff --git a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5 b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
deleted file mode 100644
index addb0daff..000000000
--- a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ee2d992305f2e2b6ff47e9e17c780e16
\ No newline at end of file
diff --git a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
deleted file mode 100644
index 1ffe20ca9..000000000
--- a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
+++ /dev/null
@@ -1,293 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<!--zoomable 164 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 511;
-var viewHeight = 164;
-var sectionId = 'dynsection-5';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-89.64 0,-89.64 0,-70.39 32.5,-70.39 32.5,-89.64"/>
-<text text-anchor="middle" x="16.25" y="-76.14" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146,-89.64 106.75,-89.64 106.75,-70.39 146,-70.39 146,-89.64"/>
-<text text-anchor="middle" x="126.38" y="-76.14" font-family="Helvetica,sans-Serif" font-size="10.00">circle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.74,-80.01C48.87,-80.01 74.56,-80.01 94.8,-80.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.75,-83.51 104.75,-80.01 94.75,-76.51 94.75,-83.51"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.12,-155.64 229.62,-155.64 229.62,-136.39 283.12,-136.39 283.12,-155.64"/>
-<text text-anchor="middle" x="256.38" y="-142.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge12_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge12_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.8,-86.28C42.88,-90.22 56.35,-95.25 68.5,-99.01 119.75,-114.91 180.15,-129.34 218.1,-137.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.13,-141.26 227.65,-140.03 218.65,-134.43 217.13,-141.26"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="184.25,-52.64 68.5,-52.64 68.5,-33.39 184.25,-33.39 184.25,-52.64"/>
-<text text-anchor="middle" x="126.38" y="-39.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge13_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge13_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.88,-73.99C43,-70.15 56.47,-65.14 68.5,-61.01 72.73,-59.56 77.16,-58.08 81.59,-56.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.62,-59.98 91.06,-53.58 80.47,-53.32 82.62,-59.98"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.22,-89.78C164.98,-99.49 194.59,-114.81 220.25,-128.01 221.97,-128.9 223.73,-129.8 225.51,-130.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="223.84,-133.79 234.33,-135.24 227.03,-127.56 223.84,-133.79"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="403.38,-80.64 340.12,-80.64 340.12,-61.39 403.38,-61.39 403.38,-80.64"/>
-<text text-anchor="middle" x="371.75" y="-67.14" font-family="Helvetica,sans-Serif" font-size="10.00">LenghtLine</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.47,-79.31C185.43,-77.87 274.91,-74.56 328.32,-72.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.41,-76.08 338.27,-72.21 328.15,-69.09 328.41,-76.08"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.5,-42.64 220.25,-42.64 220.25,-23.39 292.5,-23.39 292.5,-42.64"/>
-<text text-anchor="middle" x="256.38" y="-29.14" font-family="Helvetica,sans-Serif" font-size="10.00">PointInCircle</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.46,-74.39C157.56,-71.02 171.78,-66.52 184.25,-62.01 196.64,-57.54 210.05,-52.2 221.86,-47.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.89,-50.69 230.78,-43.61 220.2,-44.23 222.89,-50.69"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415,-23.64 328.5,-23.64 328.5,-4.39 415,-4.39 415,-23.64"/>
-<text text-anchor="middle" x="371.75" y="-10.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge8_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge8_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.37,-77.06C158.1,-74.53 173.01,-69.98 184.25,-62.01 206,-46.59 196.4,-25.94 220.25,-14.01 249.88,0.8 287.08,0.94 317.09,-2.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.31,-6.12 326.7,-4.04 317.28,0.82 316.31,-6.12"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.75,-118.64 221,-118.64 221,-99.39 291.75,-99.39 291.75,-118.64"/>
-<text text-anchor="middle" x="256.38" y="-105.14" font-family="Helvetica,sans-Serif" font-size="10.00">TriangleArea</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge9_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge9_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.26,-84.29C162.9,-88.06 187.82,-93.71 209.65,-98.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.72,-102.03 219.24,-100.83 210.26,-95.2 208.72,-102.03"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="503,-99.64 451,-99.64 451,-80.39 503,-80.39 503,-99.64"/>
-<text text-anchor="middle" x="477" y="-86.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M403.73,-76.71C414.96,-78.78 427.74,-81.13 439.41,-83.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="438.64,-86.7 449.11,-85.06 439.91,-79.81 438.64,-86.7"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge6_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge6_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M287.46,-43.1C300.5,-47.47 315.98,-52.65 330.03,-57.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.89,-60.67 339.48,-60.53 331.11,-54.04 328.89,-60.67"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.94,-27.05C300.53,-25.78 308.71,-24.41 316.82,-23.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.38,-26.51 326.67,-21.4 316.22,-19.6 317.38,-26.51"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge10_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge10_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M287.46,-98.93C300.5,-94.56 315.98,-89.37 330.03,-84.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.11,-87.99 339.48,-81.49 328.89,-81.35 331.11,-87.99"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge11_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge11_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.02,-106C332.23,-102.51 398.28,-96.77 439.34,-93.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="439.55,-96.69 449.21,-92.34 438.95,-89.72 439.55,-96.69"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
deleted file mode 100644
index bf4dfc27f..000000000
--- a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
+++ /dev/null
@@ -1,210 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="511pt" height="164pt"
- viewBox="0.00 0.00 511.00 163.64" 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 159.64)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-89.64 0,-89.64 0,-70.39 32.5,-70.39 32.5,-89.64"/>
-<text text-anchor="middle" x="16.25" y="-76.14" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146,-89.64 106.75,-89.64 106.75,-70.39 146,-70.39 146,-89.64"/>
-<text text-anchor="middle" x="126.38" y="-76.14" font-family="Helvetica,sans-Serif" font-size="10.00">circle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.74,-80.01C48.87,-80.01 74.56,-80.01 94.8,-80.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.75,-83.51 104.75,-80.01 94.75,-76.51 94.75,-83.51"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.12,-155.64 229.62,-155.64 229.62,-136.39 283.12,-136.39 283.12,-155.64"/>
-<text text-anchor="middle" x="256.38" y="-142.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge12_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge12_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.8,-86.28C42.88,-90.22 56.35,-95.25 68.5,-99.01 119.75,-114.91 180.15,-129.34 218.1,-137.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.13,-141.26 227.65,-140.03 218.65,-134.43 217.13,-141.26"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="184.25,-52.64 68.5,-52.64 68.5,-33.39 184.25,-33.39 184.25,-52.64"/>
-<text text-anchor="middle" x="126.38" y="-39.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge13_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge13_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.88,-73.99C43,-70.15 56.47,-65.14 68.5,-61.01 72.73,-59.56 77.16,-58.08 81.59,-56.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.62,-59.98 91.06,-53.58 80.47,-53.32 82.62,-59.98"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.22,-89.78C164.98,-99.49 194.59,-114.81 220.25,-128.01 221.97,-128.9 223.73,-129.8 225.51,-130.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="223.84,-133.79 234.33,-135.24 227.03,-127.56 223.84,-133.79"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="403.38,-80.64 340.12,-80.64 340.12,-61.39 403.38,-61.39 403.38,-80.64"/>
-<text text-anchor="middle" x="371.75" y="-67.14" font-family="Helvetica,sans-Serif" font-size="10.00">LenghtLine</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.47,-79.31C185.43,-77.87 274.91,-74.56 328.32,-72.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.41,-76.08 338.27,-72.21 328.15,-69.09 328.41,-76.08"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.5,-42.64 220.25,-42.64 220.25,-23.39 292.5,-23.39 292.5,-42.64"/>
-<text text-anchor="middle" x="256.38" y="-29.14" font-family="Helvetica,sans-Serif" font-size="10.00">PointInCircle</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.46,-74.39C157.56,-71.02 171.78,-66.52 184.25,-62.01 196.64,-57.54 210.05,-52.2 221.86,-47.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.89,-50.69 230.78,-43.61 220.2,-44.23 222.89,-50.69"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415,-23.64 328.5,-23.64 328.5,-4.39 415,-4.39 415,-23.64"/>
-<text text-anchor="middle" x="371.75" y="-10.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge8_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge8_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.37,-77.06C158.1,-74.53 173.01,-69.98 184.25,-62.01 206,-46.59 196.4,-25.94 220.25,-14.01 249.88,0.8 287.08,0.94 317.09,-2.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.31,-6.12 326.7,-4.04 317.28,0.82 316.31,-6.12"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.75,-118.64 221,-118.64 221,-99.39 291.75,-99.39 291.75,-118.64"/>
-<text text-anchor="middle" x="256.38" y="-105.14" font-family="Helvetica,sans-Serif" font-size="10.00">TriangleArea</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge9_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge9_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.26,-84.29C162.9,-88.06 187.82,-93.71 209.65,-98.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.72,-102.03 219.24,-100.83 210.26,-95.2 208.72,-102.03"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="503,-99.64 451,-99.64 451,-80.39 503,-80.39 503,-99.64"/>
-<text text-anchor="middle" x="477" y="-86.14" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M403.73,-76.71C414.96,-78.78 427.74,-81.13 439.41,-83.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="438.64,-86.7 449.11,-85.06 439.91,-79.81 438.64,-86.7"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge6_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge6_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M287.46,-43.1C300.5,-47.47 315.98,-52.65 330.03,-57.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.89,-60.67 339.48,-60.53 331.11,-54.04 328.89,-60.67"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.94,-27.05C300.53,-25.78 308.71,-24.41 316.82,-23.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.38,-26.51 326.67,-21.4 316.22,-19.6 317.38,-26.51"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge10_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge10_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M287.46,-98.93C300.5,-94.56 315.98,-89.37 330.03,-84.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.11,-87.99 339.48,-81.49 328.89,-81.35 331.11,-87.99"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge11_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge11_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.02,-106C332.23,-102.51 398.28,-96.77 439.34,-93.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="439.55,-96.69 449.21,-92.34 438.95,-89.72 439.55,-96.69"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 510751d69..000000000
--- a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,37 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,93,55,118"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="416,118,487,144"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="45,90,71,71,101,53,170,22,228,5,257,3,287,5,320,13,356,27,382,42,404,62,437,103,433,106,400,65,379,46,354,32,318,18,286,11,257,8,229,10,172,27,104,57,73,75,48,94"/>
-<area shape="rect" id="Node000003" href="$d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" title=" " alt="" coords="106,118,150,144"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,109,92,119,91,124,54,114"/>
-<area shape="rect" id="Node000011" href="$d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0" title=" " alt="" coords="103,167,153,193"/>
-<area shape="poly" id="edge16_Node000001_Node000011" title=" " alt="" coords="50,117,99,156,96,160,47,121"/>
-<area shape="rect" id="Node000012" href="$d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" title=" " alt="" coords="103,67,153,93"/>
-<area shape="poly" id="edge20_Node000001_Node000012" title=" " alt="" coords="54,97,87,88,89,93,56,102"/>
-<area shape="poly" id="edge14_Node000003_Node000002" title=" " alt="" coords="150,128,400,128,400,134,150,134"/>
-<area shape="rect" id="Node000004" href="$d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903" title=" " alt="" coords="252,219,304,245"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="150,142,247,208,244,213,147,146"/>
-<area shape="rect" id="Node000010" 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="201,67,355,93"/>
-<area shape="poly" id="edge15_Node000003_Node000010" title=" " alt="" coords="149,121,222,96,224,101,151,126"/>
-<area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="304,222,354,198,378,176,402,153,406,150,409,154,405,157,381,180,357,202,306,227"/>
-<area shape="rect" id="Node000005" href="$d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" title=" " alt="" coords="563,218,648,244"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="305,230,547,229,547,234,305,235"/>
-<area shape="rect" id="Node000007" href="$d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad" title=" " alt="" coords="403,269,500,294"/>
-<area shape="poly" id="edge7_Node000004_Node000007" title=" " alt="" coords="305,237,390,261,388,266,304,242"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="548,294,663,320"/>
-<area shape="poly" id="edge10_Node000004_Node000008" title=" " alt="" coords="297,243,343,276,372,292,404,304,469,314,532,314,532,319,469,320,403,310,370,297,340,281,293,248"/>
-<area shape="rect" id="Node000009" href="$d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc" title=" " alt="" coords="404,167,499,193"/>
-<area shape="poly" id="edge11_Node000004_Node000009" title=" " alt="" coords="304,222,391,196,392,201,305,227"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="711,193,780,218"/>
-<area shape="poly" id="edge6_Node000005_Node000006" title=" " alt="" coords="647,221,695,212,696,217,648,226"/>
-<area shape="poly" id="edge8_Node000007_Node000005" title=" " alt="" coords="492,266,549,247,551,252,494,271"/>
-<area shape="poly" id="edge9_Node000007_Node000008" title=" " alt="" coords="501,287,533,292,532,298,500,292"/>
-<area shape="poly" id="edge12_Node000009_Node000005" title=" " alt="" coords="494,191,551,210,549,215,492,196"/>
-<area shape="poly" id="edge13_Node000009_Node000006" title=" " alt="" coords="499,182,696,199,695,204,499,187"/>
-<area shape="poly" id="edge18_Node000011_Node000002" title=" " alt="" coords="153,174,400,136,401,141,154,179"/>
-<area shape="poly" id="edge17_Node000011_Node000004" title=" " alt="" coords="154,186,238,216,236,221,153,191"/>
-<area shape="poly" id="edge19_Node000011_Node000010" title=" " alt="" coords="148,165,243,100,246,104,151,169"/>
-<area shape="poly" id="edge22_Node000012_Node000002" title=" " alt="" coords="152,67,200,52,279,39,314,41,356,52,398,76,431,105,427,109,395,80,354,57,313,46,279,45,202,58,154,72"/>
-<area shape="poly" id="edge21_Node000012_Node000004" title=" " alt="" coords="144,92,255,206,252,210,140,96"/>
-<area shape="poly" id="edge23_Node000012_Node000010" title=" " alt="" coords="154,78,186,78,186,83,154,83"/>
-</map>
diff --git a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 3d22deb90..000000000
--- a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e4dead63527972ad4766b1ba7051a051
\ No newline at end of file
diff --git a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 13c117590..000000000
--- a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,410 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 244 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 589;
-var viewHeight = 244;
-var sectionId = 'dynsection-3';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-170.25 0,-170.25 0,-151 37,-151 37,-170.25"/>
-<text text-anchor="middle" x="18.5" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="361.38,-151.25 307.88,-151.25 307.88,-132 361.38,-132 361.38,-151.25"/>
-<text text-anchor="middle" x="334.62" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.04,-170.73C41.38,-179.3 57.29,-191.33 73,-198.62 149.77,-234.28 184.85,-251.31 262.5,-217.62 288.82,-206.21 309.84,-179.73 322.02,-161.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="324.85,-163.34 327.19,-153.01 318.92,-159.62 324.85,-163.34"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="108.12,-151.25 75.62,-151.25 75.62,-132 108.12,-132 108.12,-151.25"/>
-<text text-anchor="middle" x="91.88" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-155.93C45.39,-153.73 55.37,-151.08 64.49,-148.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.15,-152.1 73.91,-146.14 63.35,-145.33 65.15,-152.1"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-114.25 73,-114.25 73,-95 110.75,-95 110.75,-114.25"/>
-<text text-anchor="middle" x="91.88" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge16_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge16_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.26,-150.61C42.51,-142.57 57.14,-131.09 69.22,-121.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.33,-124.41 77.03,-115.48 67.01,-118.9 71.33,-124.41"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-189.25 73,-189.25 73,-170 110.75,-170 110.75,-189.25"/>
-<text text-anchor="middle" x="91.88" y="-175.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge20_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge20_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-165.32C44.64,-167.32 53.57,-169.69 61.98,-171.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.91,-175.27 71.48,-174.46 62.71,-168.51 60.91,-175.27"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge14_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge14_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.3,-141.62C145.74,-141.62 242.27,-141.62 296.04,-141.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.95,-145.13 305.95,-141.63 295.95,-138.13 295.95,-145.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224.25,-75.25 185,-75.25 185,-56 224.25,-56 224.25,-75.25"/>
-<text text-anchor="middle" x="204.62" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">circle</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.35,-131.69C125.76,-119.06 157.79,-97.08 179.81,-81.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.63,-84.96 187.89,-76.42 177.67,-79.19 181.63,-84.96"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.5,-189.25 146.75,-189.25 146.75,-170 262.5,-170 262.5,-189.25"/>
-<text text-anchor="middle" x="204.62" y="-175.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node10 -->
-<g id="edge15_Node000003_Node000010" class="edge">
-<title>Node3&#45;&gt;Node10</title>
-<g id="a_edge15_Node000003_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.27,-146.91C122.48,-151.78 144.21,-159.24 163.34,-165.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.2,-169.11 172.8,-169.05 164.47,-162.49 162.2,-169.11"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.65,-71.72C236.12,-75.85 250.74,-81.95 262.5,-89.62 280.93,-101.65 280.53,-110.92 298.5,-123.62 299.51,-124.34 300.55,-125.04 301.61,-125.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.81,-128.73 310.21,-130.75 303.34,-122.68 299.81,-128.73"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="481.62,-76.25 418.38,-76.25 418.38,-57 481.62,-57 481.62,-76.25"/>
-<text text-anchor="middle" x="450" y="-62.75" font-family="Helvetica,sans-Serif" font-size="10.00">LenghtLine</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.72,-65.7C263.68,-65.86 353.16,-66.23 406.57,-66.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="406.51,-69.95 416.52,-66.49 406.54,-62.95 406.51,-69.95"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="370.75,-38.25 298.5,-38.25 298.5,-19 370.75,-19 370.75,-38.25"/>
-<text text-anchor="middle" x="334.62" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">PointInCircle</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge7_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge7_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.51,-60.17C241.09,-55.37 265.89,-48.2 287.66,-41.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.62,-45.28 297.26,-39.14 286.68,-38.55 288.62,-45.28"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="493.25,-19.25 406.75,-19.25 406.75,0 493.25,0 493.25,-19.25"/>
-<text text-anchor="middle" x="450" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge10_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge10_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M217.24,-55.7C233.92,-42.17 266.21,-18.61 298.5,-9.62 329.72,-0.94 366.02,-0.67 395.15,-2.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="394.58,-6.17 404.83,-3.49 395.15,0.81 394.58,-6.17"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="370,-114.25 299.25,-114.25 299.25,-95 370,-95 370,-114.25"/>
-<text text-anchor="middle" x="334.62" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">TriangleArea</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge11_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge11_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.51,-71.38C241.59,-76.58 267.38,-84.44 289.6,-91.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.46,-94.52 299.04,-94.09 290.5,-87.83 288.46,-94.52"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="581.25,-95.25 529.25,-95.25 529.25,-76 581.25,-76 581.25,-95.25"/>
-<text text-anchor="middle" x="555.25" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M481.98,-72.33C493.21,-74.39 505.99,-76.74 517.66,-78.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="516.89,-82.31 527.36,-80.68 518.16,-75.42 516.89,-82.31"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge8_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge8_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M365.71,-38.71C378.75,-43.08 394.23,-48.27 408.28,-52.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="407.14,-56.29 417.73,-56.15 409.36,-49.65 407.14,-56.29"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge9_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M371.19,-22.67C378.78,-21.39 386.96,-20.02 395.07,-18.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="395.63,-22.12 404.92,-17.01 394.47,-15.21 395.63,-22.12"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge12_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge12_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M365.71,-94.54C378.75,-90.17 394.23,-84.98 408.28,-80.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="409.36,-83.6 417.73,-77.1 407.14,-76.96 409.36,-83.6"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node6 -->
-<g id="edge13_Node000009_Node000006" class="edge">
-<title>Node9&#45;&gt;Node6</title>
-<g id="a_edge13_Node000009_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M370.27,-101.61C410.48,-98.12 476.53,-92.38 517.59,-88.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="517.8,-92.31 527.46,-87.95 517.2,-85.33 517.8,-92.31"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node2 -->
-<g id="edge18_Node000011_Node000002" class="edge">
-<title>Node11&#45;&gt;Node2</title>
-<g id="a_edge18_Node000011_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.97,-107.41C150.21,-113.44 243.83,-127.82 296.32,-135.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.57,-139.32 305.98,-137.38 296.63,-132.4 295.57,-139.32"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node4 -->
-<g id="edge17_Node000011_Node000004" class="edge">
-<title>Node11&#45;&gt;Node4</title>
-<g id="a_edge17_Node000011_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.16,-98.18C128.19,-92.19 153.88,-83.14 173.86,-76.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.87,-79.46 183.14,-72.84 172.54,-72.86 174.87,-79.46"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node10 -->
-<g id="edge19_Node000011_Node000010" class="edge">
-<title>Node11&#45;&gt;Node10</title>
-<g id="a_edge19_Node000011_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.81,-114.74C126.24,-127.22 157.82,-148.61 179.66,-163.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.43,-166.11 187.67,-168.82 181.35,-160.32 177.43,-166.11"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node2 -->
-<g id="edge22_Node000012_Node000002" class="edge">
-<title>Node12&#45;&gt;Node2</title>
-<g id="a_edge22_Node000012_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.91,-187.72C121.19,-191.88 134.43,-196.52 146.75,-198.62 197.46,-207.3 213.96,-215.67 262.5,-198.62 284.3,-190.97 304.37,-173.5 317.59,-159.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="319.97,-162.49 324.21,-152.78 314.84,-157.73 319.97,-162.49"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node4 -->
-<g id="edge21_Node000012_Node000004" class="edge">
-<title>Node12&#45;&gt;Node4</title>
-<g id="a_edge21_Node000012_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.7,-169.51C121.47,-150.19 162.62,-107.83 186.17,-83.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.46,-86.25 192.92,-76.64 183.44,-81.38 188.46,-86.25"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node10 -->
-<g id="edge23_Node000012_Node000010" class="edge">
-<title>Node12&#45;&gt;Node10</title>
-<g id="a_edge23_Node000012_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.16,-179.62C118.07,-179.62 126.41,-179.62 135.22,-179.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.03,-183.13 145.03,-179.63 135.03,-176.13 135.03,-183.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index a22c9366b..000000000
--- a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,327 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="589pt" height="244pt"
- viewBox="0.00 0.00 589.25 243.84" 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 239.84)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-170.25 0,-170.25 0,-151 37,-151 37,-170.25"/>
-<text text-anchor="middle" x="18.5" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="361.38,-151.25 307.88,-151.25 307.88,-132 361.38,-132 361.38,-151.25"/>
-<text text-anchor="middle" x="334.62" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.04,-170.73C41.38,-179.3 57.29,-191.33 73,-198.62 149.77,-234.28 184.85,-251.31 262.5,-217.62 288.82,-206.21 309.84,-179.73 322.02,-161.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="324.85,-163.34 327.19,-153.01 318.92,-159.62 324.85,-163.34"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="108.12,-151.25 75.62,-151.25 75.62,-132 108.12,-132 108.12,-151.25"/>
-<text text-anchor="middle" x="91.88" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-155.93C45.39,-153.73 55.37,-151.08 64.49,-148.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.15,-152.1 73.91,-146.14 63.35,-145.33 65.15,-152.1"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-114.25 73,-114.25 73,-95 110.75,-95 110.75,-114.25"/>
-<text text-anchor="middle" x="91.88" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge16_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge16_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.26,-150.61C42.51,-142.57 57.14,-131.09 69.22,-121.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.33,-124.41 77.03,-115.48 67.01,-118.9 71.33,-124.41"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-189.25 73,-189.25 73,-170 110.75,-170 110.75,-189.25"/>
-<text text-anchor="middle" x="91.88" y="-175.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge20_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge20_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-165.32C44.64,-167.32 53.57,-169.69 61.98,-171.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.91,-175.27 71.48,-174.46 62.71,-168.51 60.91,-175.27"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge14_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge14_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.3,-141.62C145.74,-141.62 242.27,-141.62 296.04,-141.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.95,-145.13 305.95,-141.63 295.95,-138.13 295.95,-145.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224.25,-75.25 185,-75.25 185,-56 224.25,-56 224.25,-75.25"/>
-<text text-anchor="middle" x="204.62" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">circle</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.35,-131.69C125.76,-119.06 157.79,-97.08 179.81,-81.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.63,-84.96 187.89,-76.42 177.67,-79.19 181.63,-84.96"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.5,-189.25 146.75,-189.25 146.75,-170 262.5,-170 262.5,-189.25"/>
-<text text-anchor="middle" x="204.62" y="-175.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node10 -->
-<g id="edge15_Node000003_Node000010" class="edge">
-<title>Node3&#45;&gt;Node10</title>
-<g id="a_edge15_Node000003_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.27,-146.91C122.48,-151.78 144.21,-159.24 163.34,-165.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.2,-169.11 172.8,-169.05 164.47,-162.49 162.2,-169.11"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.65,-71.72C236.12,-75.85 250.74,-81.95 262.5,-89.62 280.93,-101.65 280.53,-110.92 298.5,-123.62 299.51,-124.34 300.55,-125.04 301.61,-125.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.81,-128.73 310.21,-130.75 303.34,-122.68 299.81,-128.73"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="481.62,-76.25 418.38,-76.25 418.38,-57 481.62,-57 481.62,-76.25"/>
-<text text-anchor="middle" x="450" y="-62.75" font-family="Helvetica,sans-Serif" font-size="10.00">LenghtLine</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.72,-65.7C263.68,-65.86 353.16,-66.23 406.57,-66.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="406.51,-69.95 416.52,-66.49 406.54,-62.95 406.51,-69.95"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="370.75,-38.25 298.5,-38.25 298.5,-19 370.75,-19 370.75,-38.25"/>
-<text text-anchor="middle" x="334.62" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">PointInCircle</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge7_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge7_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.51,-60.17C241.09,-55.37 265.89,-48.2 287.66,-41.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.62,-45.28 297.26,-39.14 286.68,-38.55 288.62,-45.28"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="493.25,-19.25 406.75,-19.25 406.75,0 493.25,0 493.25,-19.25"/>
-<text text-anchor="middle" x="450" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge10_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge10_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M217.24,-55.7C233.92,-42.17 266.21,-18.61 298.5,-9.62 329.72,-0.94 366.02,-0.67 395.15,-2.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="394.58,-6.17 404.83,-3.49 395.15,0.81 394.58,-6.17"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="370,-114.25 299.25,-114.25 299.25,-95 370,-95 370,-114.25"/>
-<text text-anchor="middle" x="334.62" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">TriangleArea</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge11_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge11_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.51,-71.38C241.59,-76.58 267.38,-84.44 289.6,-91.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.46,-94.52 299.04,-94.09 290.5,-87.83 288.46,-94.52"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="581.25,-95.25 529.25,-95.25 529.25,-76 581.25,-76 581.25,-95.25"/>
-<text text-anchor="middle" x="555.25" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M481.98,-72.33C493.21,-74.39 505.99,-76.74 517.66,-78.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="516.89,-82.31 527.36,-80.68 518.16,-75.42 516.89,-82.31"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge8_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge8_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M365.71,-38.71C378.75,-43.08 394.23,-48.27 408.28,-52.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="407.14,-56.29 417.73,-56.15 409.36,-49.65 407.14,-56.29"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge9_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M371.19,-22.67C378.78,-21.39 386.96,-20.02 395.07,-18.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="395.63,-22.12 404.92,-17.01 394.47,-15.21 395.63,-22.12"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge12_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge12_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M365.71,-94.54C378.75,-90.17 394.23,-84.98 408.28,-80.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="409.36,-83.6 417.73,-77.1 407.14,-76.96 409.36,-83.6"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node6 -->
-<g id="edge13_Node000009_Node000006" class="edge">
-<title>Node9&#45;&gt;Node6</title>
-<g id="a_edge13_Node000009_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M370.27,-101.61C410.48,-98.12 476.53,-92.38 517.59,-88.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="517.8,-92.31 527.46,-87.95 517.2,-85.33 517.8,-92.31"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node2 -->
-<g id="edge18_Node000011_Node000002" class="edge">
-<title>Node11&#45;&gt;Node2</title>
-<g id="a_edge18_Node000011_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.97,-107.41C150.21,-113.44 243.83,-127.82 296.32,-135.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.57,-139.32 305.98,-137.38 296.63,-132.4 295.57,-139.32"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node4 -->
-<g id="edge17_Node000011_Node000004" class="edge">
-<title>Node11&#45;&gt;Node4</title>
-<g id="a_edge17_Node000011_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.16,-98.18C128.19,-92.19 153.88,-83.14 173.86,-76.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.87,-79.46 183.14,-72.84 172.54,-72.86 174.87,-79.46"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node10 -->
-<g id="edge19_Node000011_Node000010" class="edge">
-<title>Node11&#45;&gt;Node10</title>
-<g id="a_edge19_Node000011_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.81,-114.74C126.24,-127.22 157.82,-148.61 179.66,-163.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.43,-166.11 187.67,-168.82 181.35,-160.32 177.43,-166.11"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node2 -->
-<g id="edge22_Node000012_Node000002" class="edge">
-<title>Node12&#45;&gt;Node2</title>
-<g id="a_edge22_Node000012_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.91,-187.72C121.19,-191.88 134.43,-196.52 146.75,-198.62 197.46,-207.3 213.96,-215.67 262.5,-198.62 284.3,-190.97 304.37,-173.5 317.59,-159.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="319.97,-162.49 324.21,-152.78 314.84,-157.73 319.97,-162.49"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node4 -->
-<g id="edge21_Node000012_Node000004" class="edge">
-<title>Node12&#45;&gt;Node4</title>
-<g id="a_edge21_Node000012_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.7,-169.51C121.47,-150.19 162.62,-107.83 186.17,-83.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.46,-86.25 192.92,-76.64 183.44,-81.38 188.46,-86.25"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node10 -->
-<g id="edge23_Node000012_Node000010" class="edge">
-<title>Node12&#45;&gt;Node10</title>
-<g id="a_edge23_Node000012_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.16,-179.62C118.07,-179.62 126.41,-179.62 135.22,-179.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.03,-183.13 145.03,-179.63 135.03,-176.13 135.03,-183.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.map b/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.map
deleted file mode 100644
index c5a867246..000000000
--- a/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="PointInCircle" name="PointInCircle">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,102,56"/>
-<area shape="rect" id="Node000002" href="$d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" title=" " alt="" coords="165,5,250,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="102,33,149,25,150,30,103,38"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="150,55,265,80"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="103,48,135,53,134,59,102,54"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="313,5,382,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="250,16,298,16,298,21,250,21"/>
-</map>
diff --git a/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.md5 b/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.md5
deleted file mode 100644
index 074588fcd..000000000
--- a/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-26086eaef0265b1a1ee0a69415b35104
\ No newline at end of file
diff --git a/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.svg b/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.svg
deleted file mode 100644
index 43943abbd..000000000
--- a/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: PointInCircle Pages: 1 -->
-<svg width="291pt" height="64pt"
- viewBox="0.00 0.00 290.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>PointInCircle</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="72.25,-37.25 0,-37.25 0,-18 72.25,-18 72.25,-37.25"/>
-<text text-anchor="middle" x="36.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">PointInCircle</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="183.12,-56.25 119.88,-56.25 119.88,-37 183.12,-37 183.12,-56.25"/>
-<text text-anchor="middle" x="151.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">LenghtLine</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.69,-33.58C83.99,-35.48 96.59,-37.59 108.31,-39.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="107.72,-43 118.16,-41.21 108.88,-36.1 107.72,-43"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194.75,-19.25 108.25,-19.25 108.25,0 194.75,0 194.75,-19.25"/>
-<text text-anchor="middle" x="151.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.69,-21.98C80.28,-20.77 88.46,-19.47 96.57,-18.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.09,-21.65 106.41,-16.62 95.99,-14.74 97.09,-21.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282.75,-56.25 230.75,-56.25 230.75,-37 282.75,-37 282.75,-56.25"/>
-<text text-anchor="middle" x="256.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.48,-46.62C194.71,-46.62 207.49,-46.62 219.16,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.83,-50.13 228.83,-46.63 218.83,-43.13 218.83,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph_org.svg
deleted file mode 100644
index 88b6cb06a..000000000
--- a/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: PointInCircle Pages: 1 -->
-<svg width="291pt" height="64pt"
- viewBox="0.00 0.00 290.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>PointInCircle</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="72.25,-37.25 0,-37.25 0,-18 72.25,-18 72.25,-37.25"/>
-<text text-anchor="middle" x="36.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">PointInCircle</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="183.12,-56.25 119.88,-56.25 119.88,-37 183.12,-37 183.12,-56.25"/>
-<text text-anchor="middle" x="151.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">LenghtLine</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.69,-33.58C83.99,-35.48 96.59,-37.59 108.31,-39.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="107.72,-43 118.16,-41.21 108.88,-36.1 107.72,-43"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194.75,-19.25 108.25,-19.25 108.25,0 194.75,0 194.75,-19.25"/>
-<text text-anchor="middle" x="151.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.69,-21.98C80.28,-20.77 88.46,-19.47 96.57,-18.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.09,-21.65 106.41,-16.62 95.99,-14.74 97.09,-21.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282.75,-56.25 230.75,-56.25 230.75,-37 282.75,-37 282.75,-56.25"/>
-<text text-anchor="middle" x="256.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.48,-46.62C194.71,-46.62 207.49,-46.62 219.16,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.83,-50.13 228.83,-46.63 218.83,-43.13 218.83,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d01/smallest__circle_8cpp_source.html b/d0/d01/smallest__circle_8cpp_source.html
new file mode 100644
index 000000000..10632eb41
--- /dev/null
+++ b/d0/d01/smallest__circle_8cpp_source.html
@@ -0,0 +1,306 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/smallest_circle.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d0/d01/smallest__circle_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">smallest_circle.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d0/d01/smallest__circle_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="keyword">struct </span><a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> {</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"><a class="line" href="../../d8/dc8/struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7">   16</a></span>    <span class="keywordtype">double</span> <a class="code hl_variable" href="../../d8/dc8/struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7">x</a>, </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"><a class="line" href="../../d8/dc8/struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8">   17</a></span>        <a class="code hl_variable" href="../../d8/dc8/struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8">y</a>;    </div>
+<div class="foldopen" id="foldopen00023" data-start="{" data-end="}">
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"><a class="line" href="../../d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a">   23</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a">Point</a>(<span class="keywordtype">double</span> a = 0.f, <span class="keywordtype">double</span> b = 0.f) {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        x = a;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        <a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> = b;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    }</div>
+</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>};</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="}">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">   37</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> &amp;A, <span class="keyword">const</span> <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> &amp;B) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordtype">double</span> dx = B.x - A.x;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordtype">double</span> dy = B.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> - A.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">return</span> std::sqrt((dx * dx) + (dy * dy));</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>}</div>
+</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="foldopen" id="foldopen00054" data-start="{" data-end="}">
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="../../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc">   54</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc">TriangleArea</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> &amp;A, <span class="keyword">const</span> <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> &amp;B, <span class="keyword">const</span> <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> &amp;C) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordtype">double</span> a = <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(A, B);</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordtype">double</span> b = <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(B, C);</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordtype">double</span> c = <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(C, A);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordtype">double</span> p = (a + b + c) / 2;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">return</span> std::sqrt(p * (p - a) * (p - b) * (p - c));</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>}</div>
+</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="foldopen" id="foldopen00072" data-start="{" data-end="}">
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"><a class="line" href="../../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad">   72</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad">PointInCircle</a>(<span class="keyword">const</span> std::vector&lt;Point&gt; &amp;P, <span class="keyword">const</span> <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> &amp;Center, <span class="keywordtype">double</span> R) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; P.size(); i++) {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(P[i], Center) &gt; R)</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    }</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>}</div>
+</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="foldopen" id="foldopen00087" data-start="{" data-end="}">
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"><a class="line" href="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903">   87</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903">circle</a>(<span class="keyword">const</span> std::vector&lt;Point&gt; &amp;P) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keywordtype">double</span> minR = INFINITY;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keywordtype">double</span> R;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> C;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> minC;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="comment">/* This code is invalid and does not give correct result for TEST 3 */</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="comment">// for each point in the list</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; P.size() - 2; i++)</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        <span class="comment">// for every subsequent point in the list</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = i + 1; j &lt; P.size(); j++)</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>            <span class="comment">// for every subsequent point in the list</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> k = j + 1; k &lt; P.size(); k++) {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>                <span class="comment">// here, we now have picked three points from the given set of</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>                <span class="comment">// points that we can use</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>                <span class="comment">// viz., P[i], P[j] and P[k]</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>                C.x = -0.5 * ((P[i].y * (P[j].x * P[j].x + P[j].y * P[j].y -</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>                                         P[k].x * P[k].x - P[k].y * P[k].y) +</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>                               P[j].y * (P[k].x * P[k].x + P[k].y * P[k].y -</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>                                         P[i].x * P[i].x - P[i].y * P[i].y) +</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>                               P[k].y * (P[i].x * P[i].x + P[i].y * P[i].y -</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>                                         P[j].x * P[j].x - P[j].y * P[j].y)) /</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>                              (P[i].x * (P[j].y - P[k].y) +</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>                               P[j].x * (P[k].y - P[i].y) +</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>                               P[k].x * (P[i].y - P[j].y)));</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>                C.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> = 0.5 * ((P[i].x * (P[j].x * P[j].x + P[j].y * P[j].y -</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>                                        P[k].x * P[k].x - P[k].y * P[k].y) +</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>                              P[j].x * (P[k].x * P[k].x + P[k].y * P[k].y -</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>                                        P[i].x * P[i].x - P[i].y * P[i].y) +</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>                              P[k].x * (P[i].x * P[i].x + P[i].y * P[i].y -</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>                                        P[j].x * P[j].x - P[j].y * P[j].y)) /</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>                             (P[i].x * (P[j].y - P[k].y) +</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>                              P[j].x * (P[k].y - P[i].y) +</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>                              P[k].x * (P[i].y - P[j].y)));</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>                R = (<a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(P[i], P[j]) * <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(P[j], P[k]) *</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>                     <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(P[k], P[i])) /</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>                    (4 * <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc">TriangleArea</a>(P[i], P[j], P[k]));</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>                <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad">PointInCircle</a>(P, C, R)) {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>                    <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>                }</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>                <span class="keywordflow">if</span> (R &lt;= minR) {</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>                    minR = R;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>                    minC = C;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>                }</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>            }</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <span class="comment">// for each point in the list</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; P.size() - 1; i++)</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>        <span class="comment">// for every subsequent point in the list</span></div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = i + 1; j &lt; P.size(); j++) {</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>            <span class="comment">// check for diameterically opposite points</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>            C.x = (P[i].x + P[j].x) / 2;</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>            C.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> = (P[i].y + P[j].y) / 2;</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>            R = <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a>(C, P[i]);</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>            <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad">PointInCircle</a>(P, C, R)) {</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>                <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>            }</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>            <span class="keywordflow">if</span> (R &lt;= minR) {</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>                minR = R;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>                minC = C;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>            }</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        }</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    std::cout &lt;&lt; minC.x &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; minC.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    <span class="keywordflow">return</span> minR;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>}</div>
+</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span> </div>
+<div class="foldopen" id="foldopen00158" data-start="{" data-end="}">
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"><a class="line" href="../../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">  158</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    std::vector&lt;Point&gt; Pv;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(0, 0));</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(5, 4));</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(1, 3));</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(4, 1));</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(3, -2));</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    std::cout &lt;&lt; <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903">circle</a>(Pv) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>}</div>
+</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span> </div>
+<div class="foldopen" id="foldopen00173" data-start="{" data-end="}">
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"><a class="line" href="../../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0">  173</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>() {</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    std::vector&lt;Point&gt; Pv;</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(0, 0));</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(0, 2));</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(2, 2));</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(2, 0));</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    std::cout &lt;&lt; <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903">circle</a>(Pv) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>}</div>
+</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span> </div>
+<div class="foldopen" id="foldopen00188" data-start="{" data-end="}">
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"><a class="line" href="../../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">  188</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a>() {</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    std::vector&lt;Point&gt; Pv;</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(0.5, 1));</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(3.5, 3));</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(2.5, 0));</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    Pv.push_back(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>(2, 1.5));</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    std::cout &lt;&lt; <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903">circle</a>(Pv) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>}</div>
+</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span> </div>
+<div class="foldopen" id="foldopen00198" data-start="{" data-end="}">
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"><a class="line" href="../../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  198</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>();</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    <a class="code hl_function" href="../../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a>();</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>}</div>
+</div>
+<div class="ttc" id="asmallest__circle_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> <a href="#l00173">smallest_circle.cpp:173</a></div></div>
+<div class="ttc" id="asmallest__circle_8cpp_html_a0b0676df8e4da7a08c7ccaecea344903"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903">circle</a></div><div class="ttdeci">double circle(const std::vector&lt; Point &gt; &amp;P)</div><div class="ttdef"><b>Definition</b> <a href="#l00087">smallest_circle.cpp:87</a></div></div>
+<div class="ttc" id="asmallest__circle_8cpp_html_a3cbebd6f4d2cdf227663c67fe41ba12a"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">LenghtLine</a></div><div class="ttdeci">double LenghtLine(const Point &amp;A, const Point &amp;B)</div><div class="ttdef"><b>Definition</b> <a href="#l00037">smallest_circle.cpp:37</a></div></div>
+<div class="ttc" id="asmallest__circle_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition</b> <a href="#l00188">smallest_circle.cpp:188</a></div></div>
+<div class="ttc" id="asmallest__circle_8cpp_html_a94682a4a70d5906857ca09de5b9fb2cc"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc">TriangleArea</a></div><div class="ttdeci">double TriangleArea(const Point &amp;A, const Point &amp;B, const Point &amp;C)</div><div class="ttdef"><b>Definition</b> <a href="#l00054">smallest_circle.cpp:54</a></div></div>
+<div class="ttc" id="asmallest__circle_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00158">smallest_circle.cpp:158</a></div></div>
+<div class="ttc" id="asmallest__circle_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00198">smallest_circle.cpp:198</a></div></div>
+<div class="ttc" id="asmallest__circle_8cpp_html_aee6d48762c1dfb9f14627927f0c16fad"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad">PointInCircle</a></div><div class="ttdeci">bool PointInCircle(const std::vector&lt; Point &gt; &amp;P, const Point &amp;Center, double R)</div><div class="ttdef"><b>Definition</b> <a href="#l00072">smallest_circle.cpp:72</a></div></div>
+<div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition</b> <a href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00012">line_segment_intersection.cpp:12</a></div></div>
+<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00014">line_segment_intersection.cpp:14</a></div></div>
+<div class="ttc" id="astruct_point_html_ab99c56589bc8ad5fa5071387110a5bc7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7">Point::x</a></div><div class="ttdeci">double x</div><div class="ttdef"><b>Definition</b> <a href="#l00016">smallest_circle.cpp:16</a></div></div>
+<div class="ttc" id="astruct_point_html_ae2d6fb1b3fd3a96169d963d62e37130a"><div class="ttname"><a href="../../d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a">Point::Point</a></div><div class="ttdeci">Point(double a=0.f, double b=0.f)</div><div class="ttdef"><b>Definition</b> <a href="#l00023">smallest_circle.cpp:23</a></div></div>
+<div class="ttc" id="astruct_point_html_afa38be143ae800e6ad69ce8ed4df62d8"><div class="ttname"><a href="../../d8/dc8/struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8">Point::y</a></div><div class="ttdeci">double y</div><div class="ttdef"><b>Definition</b> <a href="#l00017">smallest_circle.cpp:17</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../d0/d01/smallest__circle_8cpp.html">smallest_circle.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d0/d08/realtime__stats_8cpp.html b/d0/d08/realtime__stats_8cpp.html
index a23569933..cf047d562 100644
--- a/d0/d08/realtime__stats_8cpp.html
+++ b/d0/d08/realtime__stats_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/realtime_stats.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/realtime_stats.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for realtime_stats.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d1f/realtime__stats_8cpp__incl.svg" width="252" height="111"><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">
+</div>
+<p><a href="../../d0/d08/realtime__stats_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d7c/classstatistics_1_1stats__computer1.html">statistics::stats_computer1&lt; T &gt;</a></td></tr>
@@ -146,6 +165,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Compute statistics for data entered in rreal-time. </p>
 <p>This algorithm is really beneficial to compute statistics on data read in realtime. For example, devices reading biometrics data. The algorithm is simple enough to be easily implemented in an embedded system. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a3c04138a5bfe5d72780bb7e82a18e627" name="a3c04138a5bfe5d72780bb7e82a18e627"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a3c04138a5bfe5d72780bb7e82a18e627">&#9670;&#160;</a></span>main()</h2>
@@ -166,62 +187,56 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00158">158</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  158</span>                                {</div>
 <div class="line"><span class="lineno">  159</span>    <span class="keyword">const</span> <span class="keywordtype">float</span> test_data1[] = {3, 4, 5, -1.4, -3.6, 1.9, 1.};</div>
 <div class="line"><span class="lineno">  160</span>    <a class="code hl_function" href="#aa54c915581fcc495489175a4386d59fd">test_function</a>(test_data1, <span class="keyword">sizeof</span>(test_data1) / <span class="keyword">sizeof</span>(test_data1[0]));</div>
 <div class="line"><span class="lineno">  161</span> </div>
-<div class="line"><span class="lineno">  162</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div>
+<div class="line"><span class="lineno">  162</span>    std::cout</div>
 <div class="line"><span class="lineno">  163</span>        &lt;&lt; <span class="stringliteral">&quot;Enter data. Any non-numeric data will terminate the data input.&quot;</span></div>
-<div class="line"><span class="lineno">  164</span>        &lt;&lt; <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">  164</span>        &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  165</span> </div>
 <div class="line"><span class="lineno">  166</span>    <a class="code hl_class" href="../../d7/d7c/classstatistics_1_1stats__computer1.html">stats_computer1&lt;float&gt;</a> stats1;</div>
 <div class="line"><span class="lineno">  167</span>    <a class="code hl_class" href="../../d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2&lt;float&gt;</a> stats2;</div>
 <div class="line"><span class="lineno">  168</span> </div>
 <div class="line"><span class="lineno">  169</span>    <span class="keywordflow">while</span> (1) {</div>
 <div class="line"><span class="lineno">  170</span>        <span class="keywordtype">double</span> val;</div>
-<div class="line"><span class="lineno">  171</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter number: &quot;</span>;</div>
-<div class="line"><span class="lineno">  172</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; val;</div>
+<div class="line"><span class="lineno">  171</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter number: &quot;</span>;</div>
+<div class="line"><span class="lineno">  172</span>        std::cin &gt;&gt; val;</div>
 <div class="line"><span class="lineno">  173</span> </div>
 <div class="line"><span class="lineno">  174</span>        <span class="comment">// check for failure to read input. Happens for</span></div>
 <div class="line"><span class="lineno">  175</span>        <span class="comment">// non-numeric data</span></div>
-<div class="line"><span class="lineno">  176</span>        <span class="keywordflow">if</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a>.fail())</div>
+<div class="line"><span class="lineno">  176</span>        <span class="keywordflow">if</span> (std::cin.fail())</div>
 <div class="line"><span class="lineno">  177</span>            <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  178</span> </div>
 <div class="line"><span class="lineno">  179</span>        stats1.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2">new_val</a>(val);</div>
 <div class="line"><span class="lineno">  180</span>        stats2.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534">new_val</a>(val);</div>
 <div class="line"><span class="lineno">  181</span> </div>
-<div class="line"><span class="lineno">  182</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tMethod 1:&quot;</span></div>
+<div class="line"><span class="lineno">  182</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\tMethod 1:&quot;</span></div>
 <div class="line"><span class="lineno">  183</span>                  &lt;&lt; <span class="stringliteral">&quot;\tMean: &quot;</span> &lt;&lt; stats1.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b">mean</a>()</div>
 <div class="line"><span class="lineno">  184</span>                  &lt;&lt; <span class="stringliteral">&quot;\t Variance: &quot;</span> &lt;&lt; stats1.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92">variance</a>()</div>
-<div class="line"><span class="lineno">  185</span>                  &lt;&lt; <span class="stringliteral">&quot;\t Std: &quot;</span> &lt;&lt; stats1.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1">std</a>() &lt;&lt; <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">  186</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tMethod 2:&quot;</span></div>
+<div class="line"><span class="lineno">  185</span>                  &lt;&lt; <span class="stringliteral">&quot;\t Std: &quot;</span> &lt;&lt; stats1.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1">std</a>() &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  186</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\tMethod 2:&quot;</span></div>
 <div class="line"><span class="lineno">  187</span>                  &lt;&lt; <span class="stringliteral">&quot;\tMean: &quot;</span> &lt;&lt; stats2.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e">mean</a>()</div>
 <div class="line"><span class="lineno">  188</span>                  &lt;&lt; <span class="stringliteral">&quot;\t Variance: &quot;</span> &lt;&lt; stats2.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">variance</a>()</div>
-<div class="line"><span class="lineno">  189</span>                  &lt;&lt; <span class="stringliteral">&quot;\t Std: &quot;</span> &lt;&lt; stats2.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e">std</a>() &lt;&lt; <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">  189</span>                  &lt;&lt; <span class="stringliteral">&quot;\t Std: &quot;</span> &lt;&lt; stats2.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e">std</a>() &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  190</span>    }</div>
 <div class="line"><span class="lineno">  191</span> </div>
 <div class="line"><span class="lineno">  192</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  193</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="aclassstatistics_1_1stats__computer1_html"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html">statistics::stats_computer1</a></div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:27</div></div>
-<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_a27f0a03e2fd2254f1c81fe668226bd92"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92">statistics::stats_computer1::variance</a></div><div class="ttdeci">double variance() const</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:45</div></div>
-<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_a390697dcee210b91823ceff04b25081b"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b">statistics::stats_computer1::mean</a></div><div class="ttdeci">double mean() const</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:42</div></div>
-<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_aa13bf7c38de112f71921a5525d71a2f2"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2">statistics::stats_computer1::new_val</a></div><div class="ttdeci">void new_val(T x)</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:32</div></div>
-<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_af57e942d49f4fd70f059f224b4ac07e1"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1">statistics::stats_computer1::std</a></div><div class="ttdeci">double std() const</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:48</div></div>
-<div class="ttc" id="aclassstatistics_1_1stats__computer2_html"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html">statistics::stats_computer2</a></div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:72</div></div>
-<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_a8290966ad468f2a8c266d008bc60720e"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e">statistics::stats_computer2::mean</a></div><div class="ttdeci">double mean() const</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:86</div></div>
-<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_acf2e84df4fc386bb3295016ef8fd156e"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e">statistics::stats_computer2::std</a></div><div class="ttdeci">double std() const</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:92</div></div>
-<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_ade6de704deea24fdc88077b3d9a0d534"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534">statistics::stats_computer2::new_val</a></div><div class="ttdeci">void new_val(T x)</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:77</div></div>
-<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_af6198817084276113b3c064e87ce0555"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">statistics::stats_computer2::variance</a></div><div class="ttdeci">double variance() const</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:89</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="arealtime__stats_8cpp_html_aa54c915581fcc495489175a4386d59fd"><div class="ttname"><a href="#aa54c915581fcc495489175a4386d59fd">test_function</a></div><div class="ttdeci">void test_function(const float *test_data, const int number_of_samples)</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:118</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassstatistics_1_1stats__computer1_html"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html">statistics::stats_computer1</a></div><div class="ttdef"><b>Definition</b> <a href="../../d0/d08/realtime__stats_8cpp_source.html#l00027">realtime_stats.cpp:27</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_a27f0a03e2fd2254f1c81fe668226bd92"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92">statistics::stats_computer1::variance</a></div><div class="ttdeci">double variance() const</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d08/realtime__stats_8cpp_source.html#l00045">realtime_stats.cpp:45</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_a390697dcee210b91823ceff04b25081b"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b">statistics::stats_computer1::mean</a></div><div class="ttdeci">double mean() const</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d08/realtime__stats_8cpp_source.html#l00042">realtime_stats.cpp:42</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_aa13bf7c38de112f71921a5525d71a2f2"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2">statistics::stats_computer1::new_val</a></div><div class="ttdeci">void new_val(T x)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d08/realtime__stats_8cpp_source.html#l00032">realtime_stats.cpp:32</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_af57e942d49f4fd70f059f224b4ac07e1"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1">statistics::stats_computer1::std</a></div><div class="ttdeci">double std() const</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d08/realtime__stats_8cpp_source.html#l00048">realtime_stats.cpp:48</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer2_html"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html">statistics::stats_computer2</a></div><div class="ttdef"><b>Definition</b> <a href="../../d0/d08/realtime__stats_8cpp_source.html#l00072">realtime_stats.cpp:72</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_a8290966ad468f2a8c266d008bc60720e"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e">statistics::stats_computer2::mean</a></div><div class="ttdeci">double mean() const</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d08/realtime__stats_8cpp_source.html#l00086">realtime_stats.cpp:86</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_acf2e84df4fc386bb3295016ef8fd156e"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e">statistics::stats_computer2::std</a></div><div class="ttdeci">double std() const</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d08/realtime__stats_8cpp_source.html#l00092">realtime_stats.cpp:92</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_ade6de704deea24fdc88077b3d9a0d534"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534">statistics::stats_computer2::new_val</a></div><div class="ttdeci">void new_val(T x)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d08/realtime__stats_8cpp_source.html#l00077">realtime_stats.cpp:77</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_af6198817084276113b3c064e87ce0555"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">statistics::stats_computer2::variance</a></div><div class="ttdeci">double variance() const</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d08/realtime__stats_8cpp_source.html#l00089">realtime_stats.cpp:89</a></div></div>
+<div class="ttc" id="arealtime__stats_8cpp_html_aa54c915581fcc495489175a4386d59fd"><div class="ttname"><a href="#aa54c915581fcc495489175a4386d59fd">test_function</a></div><div class="ttdeci">void test_function(const float *test_data, const int number_of_samples)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d08/realtime__stats_8cpp_source.html#l00118">realtime_stats.cpp:118</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa54c915581fcc495489175a4386d59fd" name="aa54c915581fcc495489175a4386d59fd"></a>
@@ -248,6 +263,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00118">118</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  118</span>                                                                        {</div>
 <div class="line"><span class="lineno">  119</span>    <span class="keywordtype">float</span> mean = 0.f, variance = 0.f;</div>
 <div class="line"><span class="lineno">  120</span> </div>
@@ -268,30 +285,25 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  135</span>    }</div>
 <div class="line"><span class="lineno">  136</span>    variance /= number_of_samples;</div>
 <div class="line"><span class="lineno">  137</span> </div>
-<div class="line"><span class="lineno">  138</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt; Test Function &gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&quot;</span> &lt;&lt; <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">  138</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt; Test Function &gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&quot;</span> &lt;&lt; std::endl</div>
 <div class="line"><span class="lineno">  139</span>              &lt;&lt; <span class="stringliteral">&quot;Expected: Mean: &quot;</span> &lt;&lt; mean &lt;&lt; <span class="stringliteral">&quot;\t Variance: &quot;</span> &lt;&lt; variance</div>
-<div class="line"><span class="lineno">  140</span>              &lt;&lt; <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">  141</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tMethod 1:&quot;</span></div>
+<div class="line"><span class="lineno">  140</span>              &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  141</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tMethod 1:&quot;</span></div>
 <div class="line"><span class="lineno">  142</span>              &lt;&lt; <span class="stringliteral">&quot;\tMean: &quot;</span> &lt;&lt; stats01.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b">mean</a>()</div>
 <div class="line"><span class="lineno">  143</span>              &lt;&lt; <span class="stringliteral">&quot;\t Variance: &quot;</span> &lt;&lt; stats01.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92">variance</a>()</div>
-<div class="line"><span class="lineno">  144</span>              &lt;&lt; <span class="stringliteral">&quot;\t Std: &quot;</span> &lt;&lt; stats01.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1">std</a>() &lt;&lt; <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">  145</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tMethod 2:&quot;</span></div>
+<div class="line"><span class="lineno">  144</span>              &lt;&lt; <span class="stringliteral">&quot;\t Std: &quot;</span> &lt;&lt; stats01.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1">std</a>() &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  145</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tMethod 2:&quot;</span></div>
 <div class="line"><span class="lineno">  146</span>              &lt;&lt; <span class="stringliteral">&quot;\tMean: &quot;</span> &lt;&lt; stats02.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e">mean</a>()</div>
 <div class="line"><span class="lineno">  147</span>              &lt;&lt; <span class="stringliteral">&quot;\t Variance: &quot;</span> &lt;&lt; stats02.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">variance</a>()</div>
-<div class="line"><span class="lineno">  148</span>              &lt;&lt; <span class="stringliteral">&quot;\t Std: &quot;</span> &lt;&lt; stats02.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e">std</a>() &lt;&lt; <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">  148</span>              &lt;&lt; <span class="stringliteral">&quot;\t Std: &quot;</span> &lt;&lt; stats02.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e">std</a>() &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  149</span> </div>
 <div class="line"><span class="lineno">  150</span>    assert(std::abs(stats01.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b">mean</a>() - mean) &lt; 0.01);</div>
 <div class="line"><span class="lineno">  151</span>    assert(std::abs(stats02.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e">mean</a>() - mean) &lt; 0.01);</div>
 <div class="line"><span class="lineno">  152</span>    assert(std::abs(stats02.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">variance</a>() - variance) &lt; 0.01);</div>
 <div class="line"><span class="lineno">  153</span> </div>
-<div class="line"><span class="lineno">  154</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;(Tests passed)&quot;</span> &lt;&lt; <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">  154</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;(Tests passed)&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  155</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.svg" width="588" height="498"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
deleted file mode 100644
index ccef86dbb..000000000
--- a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
+++ /dev/null
@@ -1,37 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,276,55,301"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="314,60,385,85"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="36,274,62,231,101,184,137,152,168,131,246,95,298,79,300,84,248,100,171,136,140,157,105,188,66,235,40,277"/>
-<area shape="rect" id="Node000003" href="$d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b" title=" " alt="" coords="260,110,439,150"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="42,274,68,250,101,225,181,183,261,153,262,158,183,188,104,230,72,254,46,278"/>
-<area shape="rect" id="Node000004" href="$d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e" title=" " alt="" coords="260,175,439,216"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="54,276,102,257,244,216,245,222,104,262,56,280"/>
-<area shape="rect" id="Node000005" href="$d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2" title=" " alt="" coords="260,240,439,281"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="55,284,244,267,245,272,55,289"/>
-<area shape="rect" id="Node000006" href="$d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534" title=" " alt="" coords="260,507,439,548"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="37,301,59,363,78,400,105,432,136,457,172,477,246,505,244,510,169,482,133,461,101,436,74,403,54,365,32,303"/>
-<area shape="rect" id="Node000007" href="$d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1" title=" " alt="" coords="247,356,452,381"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="46,300,71,321,104,339,167,357,232,366,231,371,166,363,102,344,68,325,42,304"/>
-<area shape="rect" id="Node000009" href="$d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92" title=" " alt="" coords="500,298,680,338"/>
-<area shape="poly" id="edge22_Node000001_Node000009" title=" " alt="" coords="32,275,54,209,74,169,101,132,141,91,182,56,223,30,266,12,310,4,356,6,404,19,454,45,484,68,509,96,530,127,547,160,572,227,585,282,580,283,567,228,542,163,525,130,505,99,480,72,451,50,402,24,355,11,310,9,267,17,226,34,185,60,145,94,105,136,79,172,59,211,37,276"/>
-<area shape="rect" id="Node000010" href="$d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e" title=" " alt="" coords="247,457,452,483"/>
-<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="43,300,69,333,104,368,141,395,172,414,248,445,263,450,261,455,246,450,169,418,138,400,101,372,65,337,39,304"/>
-<area shape="rect" id="Node000011" href="$d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555" title=" " alt="" coords="500,450,680,490"/>
-<area shape="poly" id="edge23_Node000001_Node000011" title=" " alt="" coords="35,302,40,339,51,390,72,445,87,470,105,493,137,523,168,539,203,548,248,557,305,568,350,573,396,570,452,557,480,546,507,531,553,498,556,503,509,536,482,551,453,562,396,576,350,579,304,574,246,562,202,553,166,544,134,527,101,497,82,473,67,447,46,391,35,340,30,302"/>
-<area shape="rect" id="Node000012" href="$d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd" title=" " alt="" coords="103,304,199,329"/>
-<area shape="poly" id="edge12_Node000001_Node000012" title=" " alt="" coords="56,292,88,299,87,304,55,297"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="555,381,625,407"/>
-<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="453,377,540,386,539,391,453,382"/>
-<area shape="poly" id="edge8_Node000007_Node000009" title=" " alt="" coords="414,353,484,337,485,343,415,358"/>
-<area shape="poly" id="edge10_Node000010_Node000008" title=" " alt="" coords="392,454,540,407,541,412,394,459"/>
-<area shape="poly" id="edge11_Node000010_Node000011" title=" " alt="" coords="453,467,485,467,485,473,453,473"/>
-<area shape="poly" id="edge13_Node000012_Node000002" title=" " alt="" coords="151,303,159,262,175,206,203,147,222,120,245,96,270,81,297,73,299,79,272,86,249,100,226,123,208,150,180,208,164,264,156,304"/>
-<area shape="poly" id="edge14_Node000012_Node000003" title=" " alt="" coords="154,302,185,235,212,196,245,161,253,156,256,160,249,165,216,199,190,238,159,304"/>
-<area shape="poly" id="edge15_Node000012_Node000004" title=" " alt="" coords="161,302,196,265,246,226,257,220,260,225,248,231,200,268,165,305"/>
-<area shape="poly" id="edge16_Node000012_Node000005" title=" " alt="" coords="198,301,260,283,261,288,200,306"/>
-<area shape="poly" id="edge17_Node000012_Node000006" title=" " alt="" coords="158,329,168,362,186,407,213,453,249,493,253,496,249,500,245,497,209,456,182,409,163,364,153,331"/>
-<area shape="poly" id="edge18_Node000012_Node000007" title=" " alt="" coords="200,327,284,349,282,354,199,332"/>
-<area shape="poly" id="edge20_Node000012_Node000009" title=" " alt="" coords="199,314,485,315,485,320,199,319"/>
-<area shape="poly" id="edge19_Node000012_Node000010" title=" " alt="" coords="161,329,194,381,219,410,249,436,273,449,270,454,245,440,215,414,190,384,157,331"/>
-<area shape="poly" id="edge21_Node000012_Node000011" title=" " alt="" coords="166,328,201,360,248,391,340,416,486,447,485,452,339,421,246,396,198,364,162,332"/>
-</map>
diff --git a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
deleted file mode 100644
index 79447e506..000000000
--- a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-260a03c71eca6f0d94159d4954a752cd
\ No newline at end of file
diff --git a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
deleted file mode 100644
index 5e36e7962..000000000
--- a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
+++ /dev/null
@@ -1,416 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 436 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 514;
-var viewHeight = 436;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-225.62 0,-225.62 0,-206.37 37,-206.37 37,-225.62"/>
-<text text-anchor="middle" x="18.5" y="-212.12" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285,-387.62 231.5,-387.62 231.5,-368.37 285,-368.37 285,-387.62"/>
-<text text-anchor="middle" x="258.25" y="-374.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.64,-225.97C33.1,-241.66 51.2,-272.46 73,-292.99 114.02,-331.63 129.27,-337.25 181.25,-358.99 193.55,-364.14 207.57,-368.13 220.19,-371.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.3,-374.48 229.82,-373.21 220.8,-367.65 219.3,-374.48"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.5,-350.24 191,-350.24 191,-319.74 325.5,-319.74 325.5,-350.24"/>
-<text text-anchor="start" x="199" y="-336.74" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1</text>
-<text text-anchor="middle" x="258.25" y="-325.49" font-family="Helvetica,sans-Serif" font-size="10.00">::mean</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.06,-225.76C39.26,-235.79 56.23,-251.39 73,-261.99 109.93,-285.34 155.55,-303.48 192.15,-315.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.68,-319.05 201.28,-318.86 192.88,-312.4 190.68,-319.05"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.5,-301.24 191,-301.24 191,-270.74 325.5,-270.74 325.5,-301.24"/>
-<text text-anchor="start" x="199" y="-287.74" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2</text>
-<text text-anchor="middle" x="258.25" y="-276.49" font-family="Helvetica,sans-Serif" font-size="10.00">::mean</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.11,-223.94C47.43,-228.42 60.81,-233.92 73,-237.99 107.5,-249.52 146.4,-260.01 179.52,-268.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.51,-271.58 189.05,-270.56 180.17,-264.78 178.51,-271.58"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.5,-252.24 191,-252.24 191,-221.74 325.5,-221.74 325.5,-252.24"/>
-<text text-anchor="start" x="199" y="-238.74" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1</text>
-<text text-anchor="middle" x="258.25" y="-227.49" font-family="Helvetica,sans-Serif" font-size="10.00">::new_val</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.37,-217.57C67.24,-220.21 129,-225.67 179.48,-230.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.95,-233.59 189.22,-230.99 179.56,-226.62 178.95,-233.59"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.5,-52.24 191,-52.24 191,-21.74 325.5,-21.74 325.5,-52.24"/>
-<text text-anchor="start" x="199" y="-38.74" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2</text>
-<text text-anchor="middle" x="258.25" y="-27.49" font-family="Helvetica,sans-Serif" font-size="10.00">::new_val</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.83,-206.16C27.26,-185.2 42.69,-135.69 73,-106.99 102.27,-79.28 143.62,-62.24 179.74,-51.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.56,-55.34 189.3,-49.34 178.73,-48.58 180.56,-55.34"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="335.25,-165.62 181.25,-165.62 181.25,-146.37 335.25,-146.37 335.25,-165.62"/>
-<text text-anchor="middle" x="258.25" y="-152.12" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1::std</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.14,-206.21C39.15,-196.72 55.73,-182.79 73,-175.99 103.26,-164.08 138.36,-158.46 169.74,-156.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.87,-159.51 179.61,-155.35 169.4,-152.53 169.87,-159.51"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="505.75,-209.24 371.25,-209.24 371.25,-178.74 505.75,-178.74 505.75,-209.24"/>
-<text text-anchor="start" x="379.25" y="-195.74" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1</text>
-<text text-anchor="middle" x="438.5" y="-184.49" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge22_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge22_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.89,-225.8C27.55,-247.27 43.53,-299.14 73,-331.99 153.18,-421.39 233.01,-459.97 335.25,-396.99 398.63,-357.95 424.12,-266.22 433.15,-220.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="436.54,-221.57 434.92,-211.1 429.66,-220.3 436.54,-221.57"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="335.25,-89.62 181.25,-89.62 181.25,-70.37 335.25,-70.37 335.25,-89.62"/>
-<text text-anchor="middle" x="258.25" y="-76.12" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2::std</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.54,-205.92C35.99,-192.94 53.81,-170.24 73,-154.99 115.74,-121.04 130.09,-116.02 181.25,-96.99 184.91,-95.63 188.71,-94.36 192.57,-93.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="193.43,-96.58 202.11,-90.49 191.53,-89.84 193.43,-96.58"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="505.75,-95.24 371.25,-95.24 371.25,-64.74 505.75,-64.74 505.75,-95.24"/>
-<text text-anchor="start" x="379.25" y="-81.74" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2</text>
-<text text-anchor="middle" x="438.5" y="-70.49" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge23_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge23_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.25,-205.9C22.76,-178.95 33.14,-104.4 73,-60.99 108.6,-22.23 129.76,-23.9 181.25,-12.99 248.21,1.19 269.66,6.58 335.25,-12.99 364.09,-21.6 392.35,-41.23 411.83,-57.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="409.57,-59.7 419.48,-63.44 414.06,-54.34 409.57,-59.7"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="145.25,-204.62 73,-204.62 73,-185.37 145.25,-185.37 145.25,-204.62"/>
-<text text-anchor="middle" x="109.12" y="-191.12" font-family="Helvetica,sans-Serif" font-size="10.00">test_function</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge12_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge12_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.43,-211.75C44.47,-210.08 52.9,-208.08 61.44,-206.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.24,-209.46 71.16,-203.75 60.63,-202.65 62.24,-209.46"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="464.5,-146.62 412.5,-146.62 412.5,-127.37 464.5,-127.37 464.5,-146.62"/>
-<text text-anchor="middle" x="438.5" y="-133.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M335.62,-147.85C358.21,-145.45 381.91,-142.92 400.76,-140.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="401.03,-144.4 410.6,-139.86 400.28,-137.44 401.03,-144.4"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M306.55,-166.08C322.86,-169.56 341.6,-173.55 359.69,-177.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="358.86,-180.81 369.37,-179.47 360.32,-173.96 358.86,-180.81"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node8 -->
-<g id="edge10_Node000010_Node000008" class="edge">
-<title>Node10&#45;&gt;Node8</title>
-<g id="a_edge10_Node000010_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.71,-90.05C321.64,-99.95 368.82,-115.03 401.3,-125.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="400.09,-128.71 410.68,-128.42 402.22,-122.04 400.09,-128.71"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge11_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge11_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M335.62,-79.99C343.49,-79.99 351.5,-79.99 359.39,-79.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="359.33,-83.49 369.33,-79.99 359.33,-76.49 359.33,-83.49"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node2 -->
-<g id="edge13_Node000012_Node000002" class="edge">
-<title>Node12&#45;&gt;Node2</title>
-<g id="a_edge13_Node000012_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.37,-204.89C115.53,-233.49 131.54,-316.85 181.25,-358.99 191.92,-368.04 206.29,-372.89 219.66,-375.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.12,-378.9 229.53,-376.93 220.16,-371.98 219.12,-378.9"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node3 -->
-<g id="edge14_Node000012_Node000003" class="edge">
-<title>Node12&#45;&gt;Node3</title>
-<g id="a_edge14_Node000012_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.55,-204.92C121.7,-227.09 144.37,-280.94 181.25,-309.99 182.97,-311.35 184.76,-312.63 186.62,-313.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.58,-316.71 195.01,-318.61 188.04,-310.63 184.58,-316.71"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node4 -->
-<g id="edge15_Node000012_Node000004" class="edge">
-<title>Node12&#45;&gt;Node4</title>
-<g id="a_edge15_Node000012_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.3,-204.92C130.58,-219.22 155.13,-245.59 181.25,-260.99 184.05,-262.65 186.98,-264.21 189.99,-265.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.49,-268.85 199.05,-269.72 191.34,-262.45 188.49,-268.85"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node5 -->
-<g id="edge16_Node000012_Node000005" class="edge">
-<title>Node12&#45;&gt;Node5</title>
-<g id="a_edge16_Node000012_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.37,-205.05C159.18,-209 175.5,-213.66 191.33,-218.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.15,-221.48 200.73,-220.86 192.07,-214.75 190.15,-221.48"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node6 -->
-<g id="edge17_Node000012_Node000006" class="edge">
-<title>Node12&#45;&gt;Node6</title>
-<g id="a_edge17_Node000012_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.63,-184.91C119.31,-160.05 139.96,-95.38 181.25,-60.99 182.21,-60.2 183.19,-59.43 184.2,-58.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.93,-61.73 192.54,-53.45 182.21,-55.8 185.93,-61.73"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node7 -->
-<g id="edge18_Node000012_Node000007" class="edge">
-<title>Node12&#45;&gt;Node7</title>
-<g id="a_edge18_Node000012_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.74,-185.55C164.47,-180.59 187.71,-174.43 208.13,-169.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.9,-172.43 217.67,-166.49 207.11,-165.67 208.9,-172.43"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node9 -->
-<g id="edge20_Node000012_Node000009" class="edge">
-<title>Node12&#45;&gt;Node9</title>
-<g id="a_edge20_Node000012_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.47,-194.89C196.34,-194.73 291.54,-194.44 359.42,-194.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="359.4,-197.73 369.39,-194.2 359.38,-190.73 359.4,-197.73"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node10 -->
-<g id="edge19_Node000012_Node000010" class="edge">
-<title>Node12&#45;&gt;Node10</title>
-<g id="a_edge19_Node000012_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.31,-184.89C125.43,-166.16 149.62,-125.94 181.25,-103.99 186.92,-100.06 193.26,-96.75 199.81,-93.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.67,-97.38 208.77,-90.55 198.18,-90.84 200.67,-97.38"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node11 -->
-<g id="edge21_Node000012_Node000011" class="edge">
-<title>Node12&#45;&gt;Node11</title>
-<g id="a_edge21_Node000012_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.23,-185.13C131.86,-172.06 156.02,-149.23 181.25,-136.99 197.4,-129.16 290.75,-109.38 360.15,-95.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="360.47,-98.83 369.58,-93.42 359.09,-91.96 360.47,-98.83"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
deleted file mode 100644
index 40015651f..000000000
--- a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
+++ /dev/null
@@ -1,333 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="514pt" height="436pt"
- viewBox="0.00 0.00 513.75 436.43" 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 432.43)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-225.62 0,-225.62 0,-206.37 37,-206.37 37,-225.62"/>
-<text text-anchor="middle" x="18.5" y="-212.12" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285,-387.62 231.5,-387.62 231.5,-368.37 285,-368.37 285,-387.62"/>
-<text text-anchor="middle" x="258.25" y="-374.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.64,-225.97C33.1,-241.66 51.2,-272.46 73,-292.99 114.02,-331.63 129.27,-337.25 181.25,-358.99 193.55,-364.14 207.57,-368.13 220.19,-371.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.3,-374.48 229.82,-373.21 220.8,-367.65 219.3,-374.48"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.5,-350.24 191,-350.24 191,-319.74 325.5,-319.74 325.5,-350.24"/>
-<text text-anchor="start" x="199" y="-336.74" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1</text>
-<text text-anchor="middle" x="258.25" y="-325.49" font-family="Helvetica,sans-Serif" font-size="10.00">::mean</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.06,-225.76C39.26,-235.79 56.23,-251.39 73,-261.99 109.93,-285.34 155.55,-303.48 192.15,-315.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.68,-319.05 201.28,-318.86 192.88,-312.4 190.68,-319.05"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.5,-301.24 191,-301.24 191,-270.74 325.5,-270.74 325.5,-301.24"/>
-<text text-anchor="start" x="199" y="-287.74" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2</text>
-<text text-anchor="middle" x="258.25" y="-276.49" font-family="Helvetica,sans-Serif" font-size="10.00">::mean</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.11,-223.94C47.43,-228.42 60.81,-233.92 73,-237.99 107.5,-249.52 146.4,-260.01 179.52,-268.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.51,-271.58 189.05,-270.56 180.17,-264.78 178.51,-271.58"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.5,-252.24 191,-252.24 191,-221.74 325.5,-221.74 325.5,-252.24"/>
-<text text-anchor="start" x="199" y="-238.74" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1</text>
-<text text-anchor="middle" x="258.25" y="-227.49" font-family="Helvetica,sans-Serif" font-size="10.00">::new_val</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.37,-217.57C67.24,-220.21 129,-225.67 179.48,-230.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.95,-233.59 189.22,-230.99 179.56,-226.62 178.95,-233.59"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.5,-52.24 191,-52.24 191,-21.74 325.5,-21.74 325.5,-52.24"/>
-<text text-anchor="start" x="199" y="-38.74" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2</text>
-<text text-anchor="middle" x="258.25" y="-27.49" font-family="Helvetica,sans-Serif" font-size="10.00">::new_val</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.83,-206.16C27.26,-185.2 42.69,-135.69 73,-106.99 102.27,-79.28 143.62,-62.24 179.74,-51.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.56,-55.34 189.3,-49.34 178.73,-48.58 180.56,-55.34"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="335.25,-165.62 181.25,-165.62 181.25,-146.37 335.25,-146.37 335.25,-165.62"/>
-<text text-anchor="middle" x="258.25" y="-152.12" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1::std</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.14,-206.21C39.15,-196.72 55.73,-182.79 73,-175.99 103.26,-164.08 138.36,-158.46 169.74,-156.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.87,-159.51 179.61,-155.35 169.4,-152.53 169.87,-159.51"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="505.75,-209.24 371.25,-209.24 371.25,-178.74 505.75,-178.74 505.75,-209.24"/>
-<text text-anchor="start" x="379.25" y="-195.74" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1</text>
-<text text-anchor="middle" x="438.5" y="-184.49" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge22_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge22_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.89,-225.8C27.55,-247.27 43.53,-299.14 73,-331.99 153.18,-421.39 233.01,-459.97 335.25,-396.99 398.63,-357.95 424.12,-266.22 433.15,-220.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="436.54,-221.57 434.92,-211.1 429.66,-220.3 436.54,-221.57"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="335.25,-89.62 181.25,-89.62 181.25,-70.37 335.25,-70.37 335.25,-89.62"/>
-<text text-anchor="middle" x="258.25" y="-76.12" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2::std</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.54,-205.92C35.99,-192.94 53.81,-170.24 73,-154.99 115.74,-121.04 130.09,-116.02 181.25,-96.99 184.91,-95.63 188.71,-94.36 192.57,-93.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="193.43,-96.58 202.11,-90.49 191.53,-89.84 193.43,-96.58"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="505.75,-95.24 371.25,-95.24 371.25,-64.74 505.75,-64.74 505.75,-95.24"/>
-<text text-anchor="start" x="379.25" y="-81.74" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2</text>
-<text text-anchor="middle" x="438.5" y="-70.49" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge23_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge23_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.25,-205.9C22.76,-178.95 33.14,-104.4 73,-60.99 108.6,-22.23 129.76,-23.9 181.25,-12.99 248.21,1.19 269.66,6.58 335.25,-12.99 364.09,-21.6 392.35,-41.23 411.83,-57.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="409.57,-59.7 419.48,-63.44 414.06,-54.34 409.57,-59.7"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="145.25,-204.62 73,-204.62 73,-185.37 145.25,-185.37 145.25,-204.62"/>
-<text text-anchor="middle" x="109.12" y="-191.12" font-family="Helvetica,sans-Serif" font-size="10.00">test_function</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge12_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge12_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.43,-211.75C44.47,-210.08 52.9,-208.08 61.44,-206.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.24,-209.46 71.16,-203.75 60.63,-202.65 62.24,-209.46"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="464.5,-146.62 412.5,-146.62 412.5,-127.37 464.5,-127.37 464.5,-146.62"/>
-<text text-anchor="middle" x="438.5" y="-133.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M335.62,-147.85C358.21,-145.45 381.91,-142.92 400.76,-140.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="401.03,-144.4 410.6,-139.86 400.28,-137.44 401.03,-144.4"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M306.55,-166.08C322.86,-169.56 341.6,-173.55 359.69,-177.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="358.86,-180.81 369.37,-179.47 360.32,-173.96 358.86,-180.81"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node8 -->
-<g id="edge10_Node000010_Node000008" class="edge">
-<title>Node10&#45;&gt;Node8</title>
-<g id="a_edge10_Node000010_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.71,-90.05C321.64,-99.95 368.82,-115.03 401.3,-125.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="400.09,-128.71 410.68,-128.42 402.22,-122.04 400.09,-128.71"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge11_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge11_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M335.62,-79.99C343.49,-79.99 351.5,-79.99 359.39,-79.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="359.33,-83.49 369.33,-79.99 359.33,-76.49 359.33,-83.49"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node2 -->
-<g id="edge13_Node000012_Node000002" class="edge">
-<title>Node12&#45;&gt;Node2</title>
-<g id="a_edge13_Node000012_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.37,-204.89C115.53,-233.49 131.54,-316.85 181.25,-358.99 191.92,-368.04 206.29,-372.89 219.66,-375.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.12,-378.9 229.53,-376.93 220.16,-371.98 219.12,-378.9"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node3 -->
-<g id="edge14_Node000012_Node000003" class="edge">
-<title>Node12&#45;&gt;Node3</title>
-<g id="a_edge14_Node000012_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.55,-204.92C121.7,-227.09 144.37,-280.94 181.25,-309.99 182.97,-311.35 184.76,-312.63 186.62,-313.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.58,-316.71 195.01,-318.61 188.04,-310.63 184.58,-316.71"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node4 -->
-<g id="edge15_Node000012_Node000004" class="edge">
-<title>Node12&#45;&gt;Node4</title>
-<g id="a_edge15_Node000012_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.3,-204.92C130.58,-219.22 155.13,-245.59 181.25,-260.99 184.05,-262.65 186.98,-264.21 189.99,-265.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.49,-268.85 199.05,-269.72 191.34,-262.45 188.49,-268.85"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node5 -->
-<g id="edge16_Node000012_Node000005" class="edge">
-<title>Node12&#45;&gt;Node5</title>
-<g id="a_edge16_Node000012_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.37,-205.05C159.18,-209 175.5,-213.66 191.33,-218.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.15,-221.48 200.73,-220.86 192.07,-214.75 190.15,-221.48"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node6 -->
-<g id="edge17_Node000012_Node000006" class="edge">
-<title>Node12&#45;&gt;Node6</title>
-<g id="a_edge17_Node000012_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.63,-184.91C119.31,-160.05 139.96,-95.38 181.25,-60.99 182.21,-60.2 183.19,-59.43 184.2,-58.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.93,-61.73 192.54,-53.45 182.21,-55.8 185.93,-61.73"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node7 -->
-<g id="edge18_Node000012_Node000007" class="edge">
-<title>Node12&#45;&gt;Node7</title>
-<g id="a_edge18_Node000012_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.74,-185.55C164.47,-180.59 187.71,-174.43 208.13,-169.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.9,-172.43 217.67,-166.49 207.11,-165.67 208.9,-172.43"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node9 -->
-<g id="edge20_Node000012_Node000009" class="edge">
-<title>Node12&#45;&gt;Node9</title>
-<g id="a_edge20_Node000012_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.47,-194.89C196.34,-194.73 291.54,-194.44 359.42,-194.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="359.4,-197.73 369.39,-194.2 359.38,-190.73 359.4,-197.73"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node10 -->
-<g id="edge19_Node000012_Node000010" class="edge">
-<title>Node12&#45;&gt;Node10</title>
-<g id="a_edge19_Node000012_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.31,-184.89C125.43,-166.16 149.62,-125.94 181.25,-103.99 186.92,-100.06 193.26,-96.75 199.81,-93.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.67,-97.38 208.77,-90.55 198.18,-90.84 200.67,-97.38"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node11 -->
-<g id="edge21_Node000012_Node000011" class="edge">
-<title>Node12&#45;&gt;Node11</title>
-<g id="a_edge21_Node000012_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.23,-185.13C131.86,-172.06 156.02,-149.23 181.25,-136.99 197.4,-129.16 290.75,-109.38 360.15,-95.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="360.47,-98.83 369.58,-93.42 359.09,-91.96 360.47,-98.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.map b/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.map
deleted file mode 100644
index a35a063a8..000000000
--- a/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.map
+++ /dev/null
@@ -1,26 +0,0 @@
-<map id="test_function" name="test_function">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,259,102,284"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="217,5,288,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,258,61,216,77,157,105,95,124,66,148,41,173,27,201,19,202,24,175,31,151,46,128,70,109,98,82,159,66,217,59,259"/>
-<area shape="rect" id="Node000003" href="$d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b" title=" " alt="" coords="163,55,342,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,257,68,227,86,186,113,144,148,107,154,102,158,106,151,111,117,147,91,189,73,229,61,259"/>
-<area shape="rect" id="Node000004" href="$d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e" title=" " alt="" coords="163,120,342,161"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="62,256,97,215,121,192,148,172,159,166,162,170,151,176,125,196,101,219,66,260"/>
-<area shape="rect" id="Node000005" href="$d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2" title=" " alt="" coords="163,186,342,226"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="94,256,149,237,172,229,174,234,151,242,95,261"/>
-<area shape="rect" id="Node000006" href="$d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534" title=" " alt="" coords="163,251,342,292"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="102,269,147,269,147,274,102,274"/>
-<area shape="rect" id="Node000007" href="$d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1" title=" " alt="" coords="150,367,355,392"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="70,283,105,314,151,345,183,359,181,364,148,350,101,318,66,287"/>
-<area shape="rect" id="Node000009" href="$d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92" title=" " alt="" coords="403,314,582,354"/>
-<area shape="poly" id="edge12_Node000001_Node000009" title=" " alt="" coords="89,282,150,301,273,320,387,329,387,334,272,325,149,306,87,287"/>
-<area shape="rect" id="Node000010" href="$d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e" title=" " alt="" coords="150,416,355,442"/>
-<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="63,284,94,342,120,375,151,403,158,407,155,411,148,407,116,379,90,345,58,286"/>
-<area shape="rect" id="Node000011" href="$d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555" title=" " alt="" coords="403,442,582,482"/>
-<area shape="poly" id="edge13_Node000001_Node000011" title=" " alt="" coords="60,284,68,320,85,367,112,415,130,435,151,452,178,466,208,477,269,488,331,489,389,483,390,488,332,494,269,493,206,482,176,471,148,456,126,439,107,418,80,369,63,321,54,285"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="458,383,527,408"/>
-<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="356,384,443,390,442,395,355,389"/>
-<area shape="poly" id="edge8_Node000007_Node000009" title=" " alt="" coords="324,363,387,351,388,357,325,369"/>
-<area shape="poly" id="edge10_Node000010_Node000008" title=" " alt="" coords="349,413,443,400,443,405,350,418"/>
-<area shape="poly" id="edge11_Node000010_Node000011" title=" " alt="" coords="350,440,388,445,387,450,349,445"/>
-</map>
diff --git a/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.md5 b/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.md5
deleted file mode 100644
index a8eb3a67d..000000000
--- a/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a41be49ee9ef41e9956269c6434158b2
\ No newline at end of file
diff --git a/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.svg b/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.svg
deleted file mode 100644
index 8a359deb1..000000000
--- a/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.svg
+++ /dev/null
@@ -1,260 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_function Pages: 1 -->
-<svg width="441pt" height="373pt"
- viewBox="0.00 0.00 440.75 373.35" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 369.35)">
-<title>test_function</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="72.25,-175.35 0,-175.35 0,-156.1 72.25,-156.1 72.25,-175.35"/>
-<text text-anchor="middle" x="36.12" y="-161.85" font-family="Helvetica,sans-Serif" font-size="10.00">test_function</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="212,-365.35 158.5,-365.35 158.5,-346.1 212,-346.1 212,-365.35"/>
-<text text-anchor="middle" x="185.25" y="-351.85" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.18,-175.62C41.86,-205 56.84,-292.46 108.25,-336.73 119.04,-346.02 133.71,-350.89 147.29,-353.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.43,-356.81 156.83,-354.78 147.44,-349.88 146.43,-356.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.5,-327.98 118,-327.98 118,-297.48 252.5,-297.48 252.5,-327.98"/>
-<text text-anchor="start" x="126" y="-314.48" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1</text>
-<text text-anchor="middle" x="185.25" y="-303.23" font-family="Helvetica,sans-Serif" font-size="10.00">::mean</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.15,-175.56C47.73,-198.62 69.75,-256.57 108.25,-287.73 109.77,-288.96 111.36,-290.13 112.99,-291.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.14,-294.22 121.54,-296.26 114.68,-288.18 111.14,-294.22"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.5,-278.98 118,-278.98 118,-248.48 252.5,-248.48 252.5,-278.98"/>
-<text text-anchor="start" x="126" y="-265.48" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2</text>
-<text text-anchor="middle" x="185.25" y="-254.23" font-family="Helvetica,sans-Serif" font-size="10.00">::mean</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44.28,-175.71C55.97,-191.32 80.63,-221.49 108.25,-238.73 110.81,-240.33 113.49,-241.84 116.24,-243.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="114.55,-246.33 125.09,-247.39 117.51,-239.99 114.55,-246.33"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.5,-229.98 118,-229.98 118,-199.48 252.5,-199.48 252.5,-229.98"/>
-<text text-anchor="start" x="126" y="-216.48" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1</text>
-<text text-anchor="middle" x="185.25" y="-205.23" font-family="Helvetica,sans-Serif" font-size="10.00">::new_val</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.87,-175.82C79.61,-180.13 94.65,-185.2 108.25,-189.73 113.93,-191.62 119.86,-193.59 125.78,-195.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.36,-198.76 134.96,-198.57 126.56,-192.11 124.36,-198.76"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.5,-180.98 118,-180.98 118,-150.48 252.5,-150.48 252.5,-180.98"/>
-<text text-anchor="start" x="126" y="-167.48" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2</text>
-<text text-anchor="middle" x="185.25" y="-156.23" font-family="Helvetica,sans-Serif" font-size="10.00">::new_val</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.74,-165.73C82.99,-165.73 94.59,-165.73 106.34,-165.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.09,-169.23 116.09,-165.73 106.09,-162.23 106.09,-169.23"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.25,-94.35 108.25,-94.35 108.25,-75.1 262.25,-75.1 262.25,-94.35"/>
-<text text-anchor="middle" x="185.25" y="-80.85" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1::std</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M46.87,-155.92C59.83,-143.37 83.97,-121.7 108.25,-108.73 115.72,-104.74 123.96,-101.28 132.17,-98.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.08,-101.72 141.46,-95.23 130.86,-95.08 133.08,-101.72"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="432.75,-133.98 298.25,-133.98 298.25,-103.48 432.75,-103.48 432.75,-133.98"/>
-<text text-anchor="start" x="306.25" y="-120.48" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1</text>
-<text text-anchor="middle" x="365.5" y="-109.23" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge12_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge12_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.07,-155.7C75.53,-150.7 92.56,-145.03 108.25,-141.73 167.27,-129.3 235.33,-123.59 286.46,-120.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.43,-124.46 296.25,-120.49 286.1,-117.47 286.43,-124.46"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.25,-57.35 108.25,-57.35 108.25,-38.1 262.25,-38.1 262.25,-57.35"/>
-<text text-anchor="middle" x="185.25" y="-43.85" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2::std</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M41.31,-155.67C50.32,-135.28 73.61,-89.05 108.25,-65.73 109.87,-64.63 111.56,-63.61 113.29,-62.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="114.7,-65.84 122.25,-58.41 111.71,-59.51 114.7,-65.84"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="432.75,-37.98 298.25,-37.98 298.25,-7.48 432.75,-7.48 432.75,-37.98"/>
-<text text-anchor="start" x="306.25" y="-24.48" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2</text>
-<text text-anchor="middle" x="365.5" y="-13.23" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge13_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge13_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.77,-155.82C43.73,-129.54 61.18,-58.08 108.25,-28.73 161.48,4.47 233.79,2.93 288.03,-5.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.39,-8.61 297.82,-6.74 288.5,-1.7 287.39,-8.61"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="391.5,-82.35 339.5,-82.35 339.5,-63.1 391.5,-63.1 391.5,-82.35"/>
-<text text-anchor="middle" x="365.5" y="-68.85" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.62,-79.59C285.21,-78.07 308.91,-76.47 327.76,-75.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.85,-78.7 337.59,-74.54 327.38,-71.72 327.85,-78.7"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M239.25,-94.84C254.17,-97.68 270.73,-100.84 286.78,-103.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.82,-107.28 296.3,-105.72 287.13,-100.41 285.82,-107.28"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node8 -->
-<g id="edge10_Node000010_Node000008" class="edge">
-<title>Node10&#45;&gt;Node8</title>
-<g id="a_edge10_Node000010_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.24,-57.82C282.31,-61.2 308.11,-64.82 328.26,-67.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.53,-71.08 337.92,-69 328.5,-64.14 327.53,-71.08"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge11_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge11_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.24,-37.63C267.58,-36.32 277.18,-34.97 286.62,-33.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.09,-37.12 296.51,-32.26 286.12,-30.19 287.09,-37.12"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph_org.svg b/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph_org.svg
deleted file mode 100644
index 664373d97..000000000
--- a/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph_org.svg
+++ /dev/null
@@ -1,234 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_function Pages: 1 -->
-<svg width="441pt" height="373pt"
- viewBox="0.00 0.00 440.75 373.35" 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 369.35)">
-<title>test_function</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="72.25,-175.35 0,-175.35 0,-156.1 72.25,-156.1 72.25,-175.35"/>
-<text text-anchor="middle" x="36.12" y="-161.85" font-family="Helvetica,sans-Serif" font-size="10.00">test_function</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="212,-365.35 158.5,-365.35 158.5,-346.1 212,-346.1 212,-365.35"/>
-<text text-anchor="middle" x="185.25" y="-351.85" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.18,-175.62C41.86,-205 56.84,-292.46 108.25,-336.73 119.04,-346.02 133.71,-350.89 147.29,-353.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.43,-356.81 156.83,-354.78 147.44,-349.88 146.43,-356.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.5,-327.98 118,-327.98 118,-297.48 252.5,-297.48 252.5,-327.98"/>
-<text text-anchor="start" x="126" y="-314.48" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1</text>
-<text text-anchor="middle" x="185.25" y="-303.23" font-family="Helvetica,sans-Serif" font-size="10.00">::mean</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.15,-175.56C47.73,-198.62 69.75,-256.57 108.25,-287.73 109.77,-288.96 111.36,-290.13 112.99,-291.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.14,-294.22 121.54,-296.26 114.68,-288.18 111.14,-294.22"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.5,-278.98 118,-278.98 118,-248.48 252.5,-248.48 252.5,-278.98"/>
-<text text-anchor="start" x="126" y="-265.48" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2</text>
-<text text-anchor="middle" x="185.25" y="-254.23" font-family="Helvetica,sans-Serif" font-size="10.00">::mean</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44.28,-175.71C55.97,-191.32 80.63,-221.49 108.25,-238.73 110.81,-240.33 113.49,-241.84 116.24,-243.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="114.55,-246.33 125.09,-247.39 117.51,-239.99 114.55,-246.33"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.5,-229.98 118,-229.98 118,-199.48 252.5,-199.48 252.5,-229.98"/>
-<text text-anchor="start" x="126" y="-216.48" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1</text>
-<text text-anchor="middle" x="185.25" y="-205.23" font-family="Helvetica,sans-Serif" font-size="10.00">::new_val</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.87,-175.82C79.61,-180.13 94.65,-185.2 108.25,-189.73 113.93,-191.62 119.86,-193.59 125.78,-195.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.36,-198.76 134.96,-198.57 126.56,-192.11 124.36,-198.76"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.5,-180.98 118,-180.98 118,-150.48 252.5,-150.48 252.5,-180.98"/>
-<text text-anchor="start" x="126" y="-167.48" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2</text>
-<text text-anchor="middle" x="185.25" y="-156.23" font-family="Helvetica,sans-Serif" font-size="10.00">::new_val</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.74,-165.73C82.99,-165.73 94.59,-165.73 106.34,-165.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.09,-169.23 116.09,-165.73 106.09,-162.23 106.09,-169.23"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.25,-94.35 108.25,-94.35 108.25,-75.1 262.25,-75.1 262.25,-94.35"/>
-<text text-anchor="middle" x="185.25" y="-80.85" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1::std</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M46.87,-155.92C59.83,-143.37 83.97,-121.7 108.25,-108.73 115.72,-104.74 123.96,-101.28 132.17,-98.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.08,-101.72 141.46,-95.23 130.86,-95.08 133.08,-101.72"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="432.75,-133.98 298.25,-133.98 298.25,-103.48 432.75,-103.48 432.75,-133.98"/>
-<text text-anchor="start" x="306.25" y="-120.48" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1</text>
-<text text-anchor="middle" x="365.5" y="-109.23" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge12_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge12_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.07,-155.7C75.53,-150.7 92.56,-145.03 108.25,-141.73 167.27,-129.3 235.33,-123.59 286.46,-120.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.43,-124.46 296.25,-120.49 286.1,-117.47 286.43,-124.46"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.25,-57.35 108.25,-57.35 108.25,-38.1 262.25,-38.1 262.25,-57.35"/>
-<text text-anchor="middle" x="185.25" y="-43.85" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2::std</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M41.31,-155.67C50.32,-135.28 73.61,-89.05 108.25,-65.73 109.87,-64.63 111.56,-63.61 113.29,-62.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="114.7,-65.84 122.25,-58.41 111.71,-59.51 114.7,-65.84"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="432.75,-37.98 298.25,-37.98 298.25,-7.48 432.75,-7.48 432.75,-37.98"/>
-<text text-anchor="start" x="306.25" y="-24.48" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2</text>
-<text text-anchor="middle" x="365.5" y="-13.23" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge13_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge13_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.77,-155.82C43.73,-129.54 61.18,-58.08 108.25,-28.73 161.48,4.47 233.79,2.93 288.03,-5.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.39,-8.61 297.82,-6.74 288.5,-1.7 287.39,-8.61"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="391.5,-82.35 339.5,-82.35 339.5,-63.1 391.5,-63.1 391.5,-82.35"/>
-<text text-anchor="middle" x="365.5" y="-68.85" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.62,-79.59C285.21,-78.07 308.91,-76.47 327.76,-75.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.85,-78.7 337.59,-74.54 327.38,-71.72 327.85,-78.7"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M239.25,-94.84C254.17,-97.68 270.73,-100.84 286.78,-103.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.82,-107.28 296.3,-105.72 287.13,-100.41 285.82,-107.28"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node8 -->
-<g id="edge10_Node000010_Node000008" class="edge">
-<title>Node10&#45;&gt;Node8</title>
-<g id="a_edge10_Node000010_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.24,-57.82C282.31,-61.2 308.11,-64.82 328.26,-67.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.53,-71.08 337.92,-69 328.5,-64.14 327.53,-71.08"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge11_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge11_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.24,-37.63C267.58,-36.32 277.18,-34.97 286.62,-33.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.09,-37.12 296.51,-32.26 286.12,-30.19 287.09,-37.12"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d08/realtime__stats_8cpp_source.html b/d0/d08/realtime__stats_8cpp_source.html
new file mode 100644
index 000000000..bf2c23a70
--- /dev/null
+++ b/d0/d08/realtime__stats_8cpp_source.html
@@ -0,0 +1,317 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/realtime_stats.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d0/d08/realtime__stats_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">realtime_stats.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d0/d08/realtime__stats_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/dcf/namespacestatistics.html">statistics</a> {</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00027" data-start="{" data-end="};">
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../d7/d7c/classstatistics_1_1stats__computer1.html">   27</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d7/d7c/classstatistics_1_1stats__computer1.html">stats_computer1</a> {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00032" data-start="{" data-end="}">
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2">   32</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2">new_val</a>(T x) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        <span class="keywordflow">if</span> (n == 0)</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>            K = x;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        n++;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        T tmp = x - K;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        Ex += tmp;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        Ex2 += <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(tmp) * tmp;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    }</div>
+</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b">   42</a></span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b">mean</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> K + Ex / n; }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92">   45</a></span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92">variance</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (Ex2 - (Ex * Ex) / n) / (n - 1); }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1">   48</a></span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1">std</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> std::sqrt(this-&gt;<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92">variance</a>()); }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="foldopen" id="foldopen00053" data-start="{" data-end="};">
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a350bf6c429691d3578c4dfc6679a0797">   53</a></span>    <span class="keyword">friend</span> std::istream &amp;<a class="code hl_friend" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a350bf6c429691d3578c4dfc6679a0797">operator&gt;&gt;</a>(std::istream &amp;input,</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>                                    <a class="code hl_class" href="../../d7/d7c/classstatistics_1_1stats__computer1.html">stats_computer1</a> &amp;stat) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        T val;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        input &gt;&gt; val;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        stat.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2">new_val</a>(val);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordflow">return</span> input;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    }</div>
+</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n = 0;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordtype">double</span> Ex, Ex2;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    T K;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>};</div>
+</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00072" data-start="{" data-end="};">
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"><a class="line" href="../../d8/dab/classstatistics_1_1stats__computer2.html">   72</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a> {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00077" data-start="{" data-end="}">
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534">   77</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534">new_val</a>(T x) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        n++;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        <span class="keywordtype">double</span> delta = x - mu;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        mu += delta / n;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <span class="keywordtype">double</span> delta2 = x - mu;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        M += delta * delta2;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    }</div>
+</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="../../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e">   86</a></span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e">mean</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> mu; }</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"><a class="line" href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">   89</a></span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">variance</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> M / n; }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="../../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e">   92</a></span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e">std</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> std::sqrt(this-&gt;<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">variance</a>()); }</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="foldopen" id="foldopen00097" data-start="{" data-end="};">
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"><a class="line" href="../../d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a">   97</a></span>    <span class="keyword">friend</span> std::istream &amp;<a class="code hl_friend" href="../../d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a">operator&gt;&gt;</a>(std::istream &amp;input,</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>                                    <a class="code hl_class" href="../../d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a> &amp;stat) {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        T val;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        input &gt;&gt; val;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        stat.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534">new_val</a>(val);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        <span class="keywordflow">return</span> input;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    }</div>
+</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> n = 0;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <span class="keywordtype">double</span> mu = 0, var = 0, M = 0;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>};</div>
+</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>}  <span class="comment">// namespace statistics</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span><span class="keyword">using </span><a class="code hl_class" href="../../d7/d7c/classstatistics_1_1stats__computer1.html">statistics::stats_computer1</a>;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span><span class="keyword">using </span><a class="code hl_class" href="../../d8/dab/classstatistics_1_1stats__computer2.html">statistics::stats_computer2</a>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="foldopen" id="foldopen00118" data-start="{" data-end="}">
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"><a class="line" href="../../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd">  118</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd">test_function</a>(<span class="keyword">const</span> <span class="keywordtype">float</span> *test_data, <span class="keyword">const</span> <span class="keywordtype">int</span> number_of_samples) {</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <span class="keywordtype">float</span> mean = 0.f, variance = 0.f;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <a class="code hl_class" href="../../d7/d7c/classstatistics_1_1stats__computer1.html">stats_computer1&lt;float&gt;</a> stats01;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <a class="code hl_class" href="../../d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2&lt;float&gt;</a> stats02;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; number_of_samples; i++) {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        stats01.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2">new_val</a>(test_data[i]);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        stats02.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534">new_val</a>(test_data[i]);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        mean += test_data[i];</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    }</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    mean /= number_of_samples;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; number_of_samples; i++) {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        <span class="keywordtype">float</span> temp = test_data[i] - mean;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>        variance += temp * temp;</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    }</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    variance /= number_of_samples;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span> </div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;&lt;&lt;&lt;&lt;&lt;&lt;&lt;&lt; Test Function &gt;&gt;&gt;&gt;&gt;&gt;&gt;&gt;&quot;</span> &lt;&lt; std::endl</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>              &lt;&lt; <span class="stringliteral">&quot;Expected: Mean: &quot;</span> &lt;&lt; mean &lt;&lt; <span class="stringliteral">&quot;\t Variance: &quot;</span> &lt;&lt; variance</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tMethod 1:&quot;</span></div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>              &lt;&lt; <span class="stringliteral">&quot;\tMean: &quot;</span> &lt;&lt; stats01.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b">mean</a>()</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>              &lt;&lt; <span class="stringliteral">&quot;\t Variance: &quot;</span> &lt;&lt; stats01.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92">variance</a>()</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>              &lt;&lt; <span class="stringliteral">&quot;\t Std: &quot;</span> &lt;&lt; stats01.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1">std</a>() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tMethod 2:&quot;</span></div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>              &lt;&lt; <span class="stringliteral">&quot;\tMean: &quot;</span> &lt;&lt; stats02.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e">mean</a>()</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>              &lt;&lt; <span class="stringliteral">&quot;\t Variance: &quot;</span> &lt;&lt; stats02.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">variance</a>()</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>              &lt;&lt; <span class="stringliteral">&quot;\t Std: &quot;</span> &lt;&lt; stats02.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e">std</a>() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span> </div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    assert(std::abs(stats01.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b">mean</a>() - mean) &lt; 0.01);</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    assert(std::abs(stats02.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e">mean</a>() - mean) &lt; 0.01);</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    assert(std::abs(stats02.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">variance</a>() - variance) &lt; 0.01);</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span> </div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;(Tests passed)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>}</div>
+</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span> </div>
+<div class="foldopen" id="foldopen00158" data-start="{" data-end="}">
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"><a class="line" href="../../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">  158</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> **argv) {</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    <span class="keyword">const</span> <span class="keywordtype">float</span> test_data1[] = {3, 4, 5, -1.4, -3.6, 1.9, 1.};</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    <a class="code hl_function" href="../../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd">test_function</a>(test_data1, <span class="keyword">sizeof</span>(test_data1) / <span class="keyword">sizeof</span>(test_data1[0]));</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span> </div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    std::cout</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        &lt;&lt; <span class="stringliteral">&quot;Enter data. Any non-numeric data will terminate the data input.&quot;</span></div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>        &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span> </div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    <a class="code hl_class" href="../../d7/d7c/classstatistics_1_1stats__computer1.html">stats_computer1&lt;float&gt;</a> stats1;</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    <a class="code hl_class" href="../../d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2&lt;float&gt;</a> stats2;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span> </div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    <span class="keywordflow">while</span> (1) {</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        <span class="keywordtype">double</span> val;</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter number: &quot;</span>;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>        std::cin &gt;&gt; val;</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span> </div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        <span class="comment">// check for failure to read input. Happens for</span></div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        <span class="comment">// non-numeric data</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        <span class="keywordflow">if</span> (std::cin.fail())</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        stats1.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2">new_val</a>(val);</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        stats2.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534">new_val</a>(val);</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span> </div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\tMethod 1:&quot;</span></div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>                  &lt;&lt; <span class="stringliteral">&quot;\tMean: &quot;</span> &lt;&lt; stats1.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b">mean</a>()</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>                  &lt;&lt; <span class="stringliteral">&quot;\t Variance: &quot;</span> &lt;&lt; stats1.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92">variance</a>()</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>                  &lt;&lt; <span class="stringliteral">&quot;\t Std: &quot;</span> &lt;&lt; stats1.<a class="code hl_function" href="../../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1">std</a>() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\tMethod 2:&quot;</span></div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>                  &lt;&lt; <span class="stringliteral">&quot;\tMean: &quot;</span> &lt;&lt; stats2.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e">mean</a>()</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>                  &lt;&lt; <span class="stringliteral">&quot;\t Variance: &quot;</span> &lt;&lt; stats2.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">variance</a>()</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>                  &lt;&lt; <span class="stringliteral">&quot;\t Std: &quot;</span> &lt;&lt; stats2.<a class="code hl_function" href="../../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e">std</a>() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    }</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span> </div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>}</div>
+</div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer1_html"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html">statistics::stats_computer1</a></div><div class="ttdef"><b>Definition</b> <a href="#l00027">realtime_stats.cpp:27</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_a27f0a03e2fd2254f1c81fe668226bd92"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92">statistics::stats_computer1::variance</a></div><div class="ttdeci">double variance() const</div><div class="ttdef"><b>Definition</b> <a href="#l00045">realtime_stats.cpp:45</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_a350bf6c429691d3578c4dfc6679a0797"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a350bf6c429691d3578c4dfc6679a0797">statistics::stats_computer1::operator&gt;&gt;</a></div><div class="ttdeci">friend std::istream &amp; operator&gt;&gt;(std::istream &amp;input, stats_computer1 &amp;stat)</div><div class="ttdef"><b>Definition</b> <a href="#l00053">realtime_stats.cpp:53</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_a390697dcee210b91823ceff04b25081b"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b">statistics::stats_computer1::mean</a></div><div class="ttdeci">double mean() const</div><div class="ttdef"><b>Definition</b> <a href="#l00042">realtime_stats.cpp:42</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_aa13bf7c38de112f71921a5525d71a2f2"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2">statistics::stats_computer1::new_val</a></div><div class="ttdeci">void new_val(T x)</div><div class="ttdef"><b>Definition</b> <a href="#l00032">realtime_stats.cpp:32</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_af57e942d49f4fd70f059f224b4ac07e1"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1">statistics::stats_computer1::std</a></div><div class="ttdeci">double std() const</div><div class="ttdef"><b>Definition</b> <a href="#l00048">realtime_stats.cpp:48</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer2_html"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html">statistics::stats_computer2</a></div><div class="ttdef"><b>Definition</b> <a href="#l00072">realtime_stats.cpp:72</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_a8290966ad468f2a8c266d008bc60720e"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e">statistics::stats_computer2::mean</a></div><div class="ttdeci">double mean() const</div><div class="ttdef"><b>Definition</b> <a href="#l00086">realtime_stats.cpp:86</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_ab444d485c9e7db35bdc2ff6b7775291a"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a">statistics::stats_computer2::operator&gt;&gt;</a></div><div class="ttdeci">friend std::istream &amp; operator&gt;&gt;(std::istream &amp;input, stats_computer2 &amp;stat)</div><div class="ttdef"><b>Definition</b> <a href="#l00097">realtime_stats.cpp:97</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_acf2e84df4fc386bb3295016ef8fd156e"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e">statistics::stats_computer2::std</a></div><div class="ttdeci">double std() const</div><div class="ttdef"><b>Definition</b> <a href="#l00092">realtime_stats.cpp:92</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_ade6de704deea24fdc88077b3d9a0d534"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534">statistics::stats_computer2::new_val</a></div><div class="ttdeci">void new_val(T x)</div><div class="ttdef"><b>Definition</b> <a href="#l00077">realtime_stats.cpp:77</a></div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_af6198817084276113b3c064e87ce0555"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">statistics::stats_computer2::variance</a></div><div class="ttdeci">double variance() const</div><div class="ttdef"><b>Definition</b> <a href="#l00089">realtime_stats.cpp:89</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacestatistics_html"><div class="ttname"><a href="../../d2/dcf/namespacestatistics.html">statistics</a></div><div class="ttdoc">Statistical algorithms.</div></div>
+<div class="ttc" id="arealtime__stats_8cpp_html_aa54c915581fcc495489175a4386d59fd"><div class="ttname"><a href="../../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd">test_function</a></div><div class="ttdeci">void test_function(const float *test_data, const int number_of_samples)</div><div class="ttdef"><b>Definition</b> <a href="#l00118">realtime_stats.cpp:118</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d0/d08/realtime__stats_8cpp.html">realtime_stats.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d0/d0d/structmst-members.html b/d0/d0d/structmst-members.html
index 4d25dedec..041626370 100644
--- a/d0/d0d/structmst-members.html
+++ b/d0/d0d/structmst-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d0/d20/namespaceground__to__ground__projectile__motion.html b/d0/d20/namespaceground__to__ground__projectile__motion.html
index aeb3f8fbf..fb7331072 100644
--- a/d0/d20/namespaceground__to__ground__projectile__motion.html
+++ b/d0/d20/namespaceground__to__ground__projectile__motion.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ground_to_ground_projectile_motion Namespace Reference</title>
+<title>TheAlgorithms/C++: ground_to_ground_projectile_motion Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.map b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.map
index a14da6a01..d92f3c6ee 100644
--- a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.map
+++ b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.map
@@ -2,12 +2,12 @@
 <area shape="rect" id="Node000001" title=" " alt="" coords="173,316,302,342"/>
 <area shape="rect" id="Node000002" href="$dc/d61/classgraph_1_1_graph.html" title=" " alt="" coords="98,213,227,238"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="183,249,231,314,226,317,178,252"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/map.html" title=" " alt="" coords="5,109,147,150"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="5,109,147,150"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="106,159,154,211,150,214,102,163"/>
 <area shape="rect" id="Node000004" title=" " alt="" coords="57,5,95,31"/>
 <area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="79,47,79,109,73,109,73,47"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="171,109,328,150"/>
+<area shape="rect" id="Node000005" title=" " alt="" coords="171,109,328,150"/>
 <area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="239,165,222,191,190,214,187,210,218,187,234,163"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="251,213,373,238"/>
+<area shape="rect" id="Node000006" title=" " alt="" coords="251,213,373,238"/>
 <area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="296,252,248,317,244,314,292,249"/>
 </map>
diff --git a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.md5 b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.md5
index 5de27528d..af82efb6c 100644
--- a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.md5
+++ b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.md5
@@ -1 +1 @@
-c3f294eaa860a6b1bc98890ece84713d
\ No newline at end of file
+f832bf466ff54737b2b22c9eacebd2f3
\ No newline at end of file
diff --git a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg
index c7624b10b..aa11ae6de 100644
--- a/d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg
+++ b/d0/d24/classgraph_1_1_rooted_tree__coll__graph.svg
@@ -49,7 +49,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="106,-174.75 0,-174.75 0,-144.25 106,-144.25 106,-174.75"/>
 <text text-anchor="start" x="8" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::map&lt; T, std::list</text>
 <text text-anchor="middle" x="53" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; T &gt; &gt;</text>
@@ -89,7 +89,7 @@
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000005"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="242,-174.75 124,-174.75 124,-144.25 242,-144.25 242,-174.75"/>
 <text text-anchor="start" x="132" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="183" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -109,7 +109,7 @@
 <!-- Node6 -->
 <g id="Node000006" class="node">
 <title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000006"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="275.5,-97 184.5,-97 184.5,-77.75 275.5,-77.75 275.5,-97"/>
 <text text-anchor="middle" x="230" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
diff --git a/d0/d24/classgraph_1_1_rooted_tree__coll__graph_org.svg b/d0/d24/classgraph_1_1_rooted_tree__coll__graph_org.svg
index 471cd44eb..fd1426b92 100644
--- a/d0/d24/classgraph_1_1_rooted_tree__coll__graph_org.svg
+++ b/d0/d24/classgraph_1_1_rooted_tree__coll__graph_org.svg
@@ -38,7 +38,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="106,-174.75 0,-174.75 0,-144.25 106,-144.25 106,-174.75"/>
 <text text-anchor="start" x="8" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::map&lt; T, std::list</text>
 <text text-anchor="middle" x="53" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; T &gt; &gt;</text>
@@ -78,7 +78,7 @@
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000005"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="242,-174.75 124,-174.75 124,-144.25 242,-144.25 242,-174.75"/>
 <text text-anchor="start" x="132" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="183" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -98,7 +98,7 @@
 <!-- Node6 -->
 <g id="Node000006" class="node">
 <title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000006"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="275.5,-97 184.5,-97 184.5,-77.75 275.5,-77.75 275.5,-97"/>
 <text text-anchor="middle" x="230" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
diff --git a/d0/d2b/namespacequick__sort.html b/d0/d2b/namespacequick__sort.html
index 5409587f0..d4be4d964 100644
--- a/d0/d2b/namespacequick__sort.html
+++ b/d0/d2b/namespacequick__sort.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: quick_sort Namespace Reference</title>
+<title>TheAlgorithms/C++: quick_sort Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d0/d2e/namespaceneural__network.html b/d0/d2e/namespaceneural__network.html
index 09ec20754..6e092ffd0 100644
--- a/d0/d2e/namespaceneural__network.html
+++ b/d0/d2e/namespaceneural__network.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: neural_network Namespace Reference</title>
+<title>TheAlgorithms/C++: neural_network Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d0/d3e/classdata__structures_1_1trie.html b/d0/d3e/classdata__structures_1_1trie.html
index 87e68ad33..a5804dde1 100644
--- a/d0/d3e/classdata__structures_1_1trie.html
+++ b/d0/d3e/classdata__structures_1_1trie.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::trie Class Reference</title>
+<title>TheAlgorithms/C++: data_structures::trie Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,11 +140,11 @@ Public Member Functions</h2></td></tr>
 &#160;</td><td class="memItemRight" valign="bottom"><b>trie</b> ()=default</td></tr>
 <tr class="memdesc:a87d8bf99aea936f9381141753f1e90a8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Class default constructor. <br /></td></tr>
 <tr class="separator:a87d8bf99aea936f9381141753f1e90a8"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0ab94bc6417e3f59fab33cea5b64d546" id="r_a0ab94bc6417e3f59fab33cea5b64d546"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0ab94bc6417e3f59fab33cea5b64d546">insert</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str)</td></tr>
+<tr class="memitem:a0ab94bc6417e3f59fab33cea5b64d546" id="r_a0ab94bc6417e3f59fab33cea5b64d546"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0ab94bc6417e3f59fab33cea5b64d546">insert</a> (const std::string &amp;str)</td></tr>
 <tr class="separator:a0ab94bc6417e3f59fab33cea5b64d546"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a499f87fd833203ef9492b4870aa6d42d" id="r_a499f87fd833203ef9492b4870aa6d42d"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a499f87fd833203ef9492b4870aa6d42d">search</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, int index)</td></tr>
+<tr class="memitem:a499f87fd833203ef9492b4870aa6d42d" id="r_a499f87fd833203ef9492b4870aa6d42d"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a499f87fd833203ef9492b4870aa6d42d">search</a> (const std::string &amp;str, int index)</td></tr>
 <tr class="separator:a499f87fd833203ef9492b4870aa6d42d"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aeac27cfd397d2dd3f2f519efffafeeab" id="r_aeac27cfd397d2dd3f2f519efffafeeab"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aeac27cfd397d2dd3f2f519efffafeeab">deleteString</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, int index)</td></tr>
+<tr class="memitem:aeac27cfd397d2dd3f2f519efffafeeab" id="r_aeac27cfd397d2dd3f2f519efffafeeab"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aeac27cfd397d2dd3f2f519efffafeeab">deleteString</a> (const std::string &amp;str, int index)</td></tr>
 <tr class="separator:aeac27cfd397d2dd3f2f519efffafeeab"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
@@ -135,29 +152,28 @@ Private Member Functions</h2></td></tr>
 <tr class="memitem:aab373beb3f618b90922528c68797d988" id="r_aab373beb3f618b90922528c68797d988"><td class="memItemLeft" align="right" valign="top">uint8_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aab373beb3f618b90922528c68797d988">char_to_int</a> (const char &amp;ch) const</td></tr>
 <tr class="memdesc:aab373beb3f618b90922528c68797d988"><td class="mdescLeft">&#160;</td><td class="mdescRight">Convert a character to integer for indexing.  <br /></td></tr>
 <tr class="separator:aab373beb3f618b90922528c68797d988"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a961eb5d576d2420f2036009154397c63" id="r_a961eb5d576d2420f2036009154397c63"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a961eb5d576d2420f2036009154397c63">search</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html">trie</a> &gt; &amp;root, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, int index)</td></tr>
+<tr class="memitem:a961eb5d576d2420f2036009154397c63" id="r_a961eb5d576d2420f2036009154397c63"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a961eb5d576d2420f2036009154397c63">search</a> (const std::shared_ptr&lt; <a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html">trie</a> &gt; &amp;root, const std::string &amp;str, int index)</td></tr>
 <tr class="separator:a961eb5d576d2420f2036009154397c63"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a362dd78748a1f01ab019e55fd6098a8b" id="r_a362dd78748a1f01ab019e55fd6098a8b"><td class="memItemLeft" align="right" valign="top"><a id="a362dd78748a1f01ab019e55fd6098a8b" name="a362dd78748a1f01ab019e55fd6098a8b"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html">trie</a> &gt;, <a class="el" href="#a4bfac4be6ed1a34c7159eddb42469191">NUM_CHARS</a>&lt;&lt; 1 &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>arr</b></td></tr>
-<tr class="memdesc:a362dd78748a1f01ab019e55fd6098a8b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive tree nodes as an array of shared-pointers. <br /></td></tr>
+<tr class="memitem:a362dd78748a1f01ab019e55fd6098a8b" id="r_a362dd78748a1f01ab019e55fd6098a8b"><td class="memItemLeft" align="right" valign="top">std::array&lt; std::shared_ptr&lt; <a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html">trie</a> &gt;, <a class="el" href="#a4bfac4be6ed1a34c7159eddb42469191">NUM_CHARS</a>&lt;&lt; 1 &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a362dd78748a1f01ab019e55fd6098a8b">arr</a></td></tr>
+<tr class="memdesc:a362dd78748a1f01ab019e55fd6098a8b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive tree nodes as an array of shared-pointers.  <br /></td></tr>
 <tr class="separator:a362dd78748a1f01ab019e55fd6098a8b"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a4cb0f775b5a4bc14a6d39b5c93883eb6" id="r_a4cb0f775b5a4bc14a6d39b5c93883eb6"><td class="memItemLeft" align="right" valign="top"><a id="a4cb0f775b5a4bc14a6d39b5c93883eb6" name="a4cb0f775b5a4bc14a6d39b5c93883eb6"></a>
-bool&#160;</td><td class="memItemRight" valign="bottom"><b>isEndofWord</b> = false</td></tr>
-<tr class="memdesc:a4cb0f775b5a4bc14a6d39b5c93883eb6"><td class="mdescLeft">&#160;</td><td class="mdescRight">identifier if a node is terminal node <br /></td></tr>
+<tr class="memitem:a4cb0f775b5a4bc14a6d39b5c93883eb6" id="r_a4cb0f775b5a4bc14a6d39b5c93883eb6"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4cb0f775b5a4bc14a6d39b5c93883eb6">isEndofWord</a> = false</td></tr>
+<tr class="memdesc:a4cb0f775b5a4bc14a6d39b5c93883eb6"><td class="mdescLeft">&#160;</td><td class="mdescRight">identifier if a node is terminal node  <br /></td></tr>
 <tr class="separator:a4cb0f775b5a4bc14a6d39b5c93883eb6"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-static-attribs" name="pri-static-attribs"></a>
 Static Private Attributes</h2></td></tr>
-<tr class="memitem:a4bfac4be6ed1a34c7159eddb42469191" id="r_a4bfac4be6ed1a34c7159eddb42469191"><td class="memItemLeft" align="right" valign="top"><a id="a4bfac4be6ed1a34c7159eddb42469191" name="a4bfac4be6ed1a34c7159eddb42469191"></a>
-static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>NUM_CHARS</b> = 26</td></tr>
-<tr class="memdesc:a4bfac4be6ed1a34c7159eddb42469191"><td class="mdescLeft">&#160;</td><td class="mdescRight">Number of alphabets. <br /></td></tr>
+<tr class="memitem:a4bfac4be6ed1a34c7159eddb42469191" id="r_a4bfac4be6ed1a34c7159eddb42469191"><td class="memItemLeft" align="right" valign="top">static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4bfac4be6ed1a34c7159eddb42469191">NUM_CHARS</a> = 26</td></tr>
+<tr class="memdesc:a4bfac4be6ed1a34c7159eddb42469191"><td class="mdescLeft">&#160;</td><td class="mdescRight">Number of alphabets.  <br /></td></tr>
 <tr class="separator:a4bfac4be6ed1a34c7159eddb42469191"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code> </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html#l00025">25</a> of file <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html">trie_tree.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="aab373beb3f618b90922528c68797d988" name="aab373beb3f618b90922528c68797d988"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aab373beb3f618b90922528c68797d988">&#9670;&#160;</a></span>char_to_int()</h2>
@@ -190,6 +206,8 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>N
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>unsigned integer index </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html">trie_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   38</span>                                              {</div>
 <div class="line"><span class="lineno">   39</span>        <span class="keywordflow">if</span> (ch &gt;= <span class="charliteral">&#39;A&#39;</span> &amp;&amp; ch &lt;= <span class="charliteral">&#39;Z&#39;</span>) {</div>
 <div class="line"><span class="lineno">   40</span>            <span class="keywordflow">return</span> ch - <span class="charliteral">&#39;A&#39;</span>;</div>
@@ -197,19 +215,12 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>N
 <div class="line"><span class="lineno">   42</span>            <span class="keywordflow">return</span> ch - <span class="charliteral">&#39;a&#39;</span> + <a class="code hl_variable" href="#a4bfac4be6ed1a34c7159eddb42469191">NUM_CHARS</a>;</div>
 <div class="line"><span class="lineno">   43</span>        }</div>
 <div class="line"><span class="lineno">   44</span> </div>
-<div class="line"><span class="lineno">   45</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Invalid character present. Exiting...&quot;</span>;</div>
-<div class="line"><span class="lineno">   46</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">   45</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Invalid character present. Exiting...&quot;</span>;</div>
+<div class="line"><span class="lineno">   46</span>        std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">   47</span>        <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   48</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::cerr</a></div></div>
-<div class="ttc" id="aclassdata__structures_1_1trie_html_a4bfac4be6ed1a34c7159eddb42469191"><div class="ttname"><a href="#a4bfac4be6ed1a34c7159eddb42469191">data_structures::trie::NUM_CHARS</a></div><div class="ttdeci">static constexpr uint8_t NUM_CHARS</div><div class="ttdoc">Number of alphabets.</div><div class="ttdef"><b>Definition</b> trie_tree.cpp:27</div></div>
-<div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.svg" width="264" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1trie_html_a4bfac4be6ed1a34c7159eddb42469191"><div class="ttname"><a href="#a4bfac4be6ed1a34c7159eddb42469191">data_structures::trie::NUM_CHARS</a></div><div class="ttdeci">static constexpr uint8_t NUM_CHARS</div><div class="ttdoc">Number of alphabets.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d83/trie__tree_8cpp_source.html#l00027">trie_tree.cpp:27</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aeac27cfd397d2dd3f2f519efffafeeab" name="aeac27cfd397d2dd3f2f519efffafeeab"></a>
@@ -224,7 +235,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool data_structures::trie::deleteString </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -250,8 +261,10 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if successful </dd>
 <dd>
 <code>false</code> if unsuccessful </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html#l00134">134</a> of file <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html">trie_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  134</span>                                                       {</div>
-<div class="line"><span class="lineno">  135</span>        <span class="keywordflow">if</span> (index == str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>()) {</div>
+<div class="line"><span class="lineno">  135</span>        <span class="keywordflow">if</span> (index == str.length()) {</div>
 <div class="line"><span class="lineno">  136</span>            <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#a4cb0f775b5a4bc14a6d39b5c93883eb6">isEndofWord</a>) {</div>
 <div class="line"><span class="lineno">  137</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  138</span>            }</div>
@@ -283,21 +296,15 @@ Here is the call graph for this function:</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>        <span class="comment">/* should not return here */</span></div>
-<div class="line"><span class="lineno">  167</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;:&quot;</span> &lt;&lt; __LINE__</div>
+<div class="line"><span class="lineno">  167</span>        std::cout &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;:&quot;</span> &lt;&lt; __LINE__</div>
 <div class="line"><span class="lineno">  168</span>                  &lt;&lt; <span class="stringliteral">&quot;Should not reach this line\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  169</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  170</span>    }</div>
-<div class="ttc" id="aclassdata__structures_1_1trie_html_a362dd78748a1f01ab019e55fd6098a8b"><div class="ttname"><a href="#a362dd78748a1f01ab019e55fd6098a8b">data_structures::trie::arr</a></div><div class="ttdeci">std::array&lt; std::shared_ptr&lt; trie &gt;, NUM_CHARS&lt;&lt; 1 &gt; arr</div><div class="ttdoc">Recursive tree nodes as an array of shared-pointers.</div><div class="ttdef"><b>Definition</b> trie_tree.cpp:29</div></div>
-<div class="ttc" id="aclassdata__structures_1_1trie_html_a4cb0f775b5a4bc14a6d39b5c93883eb6"><div class="ttname"><a href="#a4cb0f775b5a4bc14a6d39b5c93883eb6">data_structures::trie::isEndofWord</a></div><div class="ttdeci">bool isEndofWord</div><div class="ttdoc">identifier if a node is terminal node</div><div class="ttdef"><b>Definition</b> trie_tree.cpp:30</div></div>
-<div class="ttc" id="aclassdata__structures_1_1trie_html_aab373beb3f618b90922528c68797d988"><div class="ttname"><a href="#aab373beb3f618b90922528c68797d988">data_structures::trie::char_to_int</a></div><div class="ttdeci">uint8_t char_to_int(const char &amp;ch) const</div><div class="ttdoc">Convert a character to integer for indexing.</div><div class="ttdef"><b>Definition</b> trie_tree.cpp:38</div></div>
-<div class="ttc" id="aclassdata__structures_1_1trie_html_aeac27cfd397d2dd3f2f519efffafeeab"><div class="ttname"><a href="#aeac27cfd397d2dd3f2f519efffafeeab">data_structures::trie::deleteString</a></div><div class="ttdeci">bool deleteString(const std::string &amp;str, int index)</div><div class="ttdef"><b>Definition</b> trie_tree.cpp:134</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::length</a></div><div class="ttdeci">T length(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.svg" width="450" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1trie_html_a362dd78748a1f01ab019e55fd6098a8b"><div class="ttname"><a href="#a362dd78748a1f01ab019e55fd6098a8b">data_structures::trie::arr</a></div><div class="ttdeci">std::array&lt; std::shared_ptr&lt; trie &gt;, NUM_CHARS&lt;&lt; 1 &gt; arr</div><div class="ttdoc">Recursive tree nodes as an array of shared-pointers.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d83/trie__tree_8cpp_source.html#l00029">trie_tree.cpp:29</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie_html_a4cb0f775b5a4bc14a6d39b5c93883eb6"><div class="ttname"><a href="#a4cb0f775b5a4bc14a6d39b5c93883eb6">data_structures::trie::isEndofWord</a></div><div class="ttdeci">bool isEndofWord</div><div class="ttdoc">identifier if a node is terminal node</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d83/trie__tree_8cpp_source.html#l00030">trie_tree.cpp:30</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie_html_aab373beb3f618b90922528c68797d988"><div class="ttname"><a href="#aab373beb3f618b90922528c68797d988">data_structures::trie::char_to_int</a></div><div class="ttdeci">uint8_t char_to_int(const char &amp;ch) const</div><div class="ttdoc">Convert a character to integer for indexing.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d83/trie__tree_8cpp_source.html#l00038">trie_tree.cpp:38</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie_html_aeac27cfd397d2dd3f2f519efffafeeab"><div class="ttname"><a href="#aeac27cfd397d2dd3f2f519efffafeeab">data_structures::trie::deleteString</a></div><div class="ttdeci">bool deleteString(const std::string &amp;str, int index)</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d83/trie__tree_8cpp_source.html#l00134">trie_tree.cpp:134</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0ab94bc6417e3f59fab33cea5b64d546" name="a0ab94bc6417e3f59fab33cea5b64d546"></a>
@@ -312,7 +319,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void data_structures::trie::insert </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -328,8 +335,10 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html">trie_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   77</span>                                      {</div>
-<div class="line"><span class="lineno">   78</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;trie&gt;</a> root(<span class="keyword">nullptr</span>);</div>
+<div class="line"><span class="lineno">   78</span>        std::shared_ptr&lt;trie&gt; root(<span class="keyword">nullptr</span>);</div>
 <div class="line"><span class="lineno">   79</span> </div>
 <div class="line"><span class="lineno">   80</span>        <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">char</span>&amp; ch : str) {</div>
 <div class="line"><span class="lineno">   81</span>            <span class="keywordtype">int</span> j = <a class="code hl_function" href="#aab373beb3f618b90922528c68797d988">char_to_int</a>(ch);</div>
@@ -337,14 +346,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   83</span>                <span class="keywordflow">if</span> (root-&gt;arr[j]) {</div>
 <div class="line"><span class="lineno">   84</span>                    root = root-&gt;arr[j];</div>
 <div class="line"><span class="lineno">   85</span>                } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   86</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;trie&gt;</a> temp(<span class="keyword">new</span> <a class="code hl_function" href="#a87d8bf99aea936f9381141753f1e90a8">trie</a>());</div>
+<div class="line"><span class="lineno">   86</span>                    std::shared_ptr&lt;trie&gt; temp(<span class="keyword">new</span> <a class="code hl_function" href="#a87d8bf99aea936f9381141753f1e90a8">trie</a>());</div>
 <div class="line"><span class="lineno">   87</span>                    root-&gt;arr[j] = temp;</div>
 <div class="line"><span class="lineno">   88</span>                    root = temp;</div>
 <div class="line"><span class="lineno">   89</span>                }</div>
 <div class="line"><span class="lineno">   90</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j]) {</div>
 <div class="line"><span class="lineno">   91</span>                root = <a class="code hl_variable" href="#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j];</div>
 <div class="line"><span class="lineno">   92</span>            } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   93</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;trie&gt;</a> temp(<span class="keyword">new</span> <a class="code hl_function" href="#a87d8bf99aea936f9381141753f1e90a8">trie</a>());</div>
+<div class="line"><span class="lineno">   93</span>                std::shared_ptr&lt;trie&gt; temp(<span class="keyword">new</span> <a class="code hl_function" href="#a87d8bf99aea936f9381141753f1e90a8">trie</a>());</div>
 <div class="line"><span class="lineno">   94</span>                <a class="code hl_variable" href="#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j] = temp;</div>
 <div class="line"><span class="lineno">   95</span>                root = temp;</div>
 <div class="line"><span class="lineno">   96</span>            }</div>
@@ -352,13 +361,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   98</span>        root-&gt;isEndofWord = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   99</span>    }</div>
 <div class="ttc" id="aclassdata__structures_1_1trie_html_a87d8bf99aea936f9381141753f1e90a8"><div class="ttname"><a href="#a87d8bf99aea936f9381141753f1e90a8">data_structures::trie::trie</a></div><div class="ttdeci">trie()=default</div><div class="ttdoc">Class default constructor.</div></div>
-<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d3e/classdata__structures_1_1trie_a0ab94bc6417e3f59fab33cea5b64d546_cgraph.svg" width="450" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a961eb5d576d2420f2036009154397c63" name="a961eb5d576d2420f2036009154397c63"></a>
@@ -373,12 +376,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool data_structures::trie::search </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html">trie</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>root</em></span>, </td>
+          <td class="paramtype">const std::shared_ptr&lt; <a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html">trie</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>root</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -402,8 +405,10 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if found </dd>
 <dd>
 <code>false</code> if not found </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html#l00056">56</a> of file <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html">trie_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   57</span>                           {</div>
-<div class="line"><span class="lineno">   58</span>        <span class="keywordflow">if</span> (index == str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>()) {</div>
+<div class="line"><span class="lineno">   58</span>        <span class="keywordflow">if</span> (index == str.length()) {</div>
 <div class="line"><span class="lineno">   59</span>            <span class="keywordflow">if</span> (!root-&gt;isEndofWord) {</div>
 <div class="line"><span class="lineno">   60</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   61</span>            }</div>
@@ -415,13 +420,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   67</span>        }</div>
 <div class="line"><span class="lineno">   68</span>        <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>(root-&gt;arr[j], str, index + 1);</div>
 <div class="line"><span class="lineno">   69</span>    }</div>
-<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> binary_search.cpp:47</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d3e/classdata__structures_1_1trie_a961eb5d576d2420f2036009154397c63_cgraph.svg" width="450" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> <a href="../../df/dd5/binary__search_8cpp_source.html#l00047">binary_search.cpp:47</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a499f87fd833203ef9492b4870aa6d42d" name="a499f87fd833203ef9492b4870aa6d42d"></a>
@@ -436,7 +436,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool data_structures::trie::search </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -460,8 +460,10 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if found </dd>
 <dd>
 <code>false</code> if not found </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html">trie_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  107</span>                                                 {</div>
-<div class="line"><span class="lineno">  108</span>        <span class="keywordflow">if</span> (index == str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>()) {</div>
+<div class="line"><span class="lineno">  108</span>        <span class="keywordflow">if</span> (index == str.length()) {</div>
 <div class="line"><span class="lineno">  109</span>            <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#a4cb0f775b5a4bc14a6d39b5c93883eb6">isEndofWord</a>) {</div>
 <div class="line"><span class="lineno">  110</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  111</span>            }</div>
@@ -473,16 +475,90 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  117</span>        }</div>
 <div class="line"><span class="lineno">  118</span>        <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>(<a class="code hl_variable" href="#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j], str, index + 1);</div>
 <div class="line"><span class="lineno">  119</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.svg" width="450" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a362dd78748a1f01ab019e55fd6098a8b" name="a362dd78748a1f01ab019e55fd6098a8b"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a362dd78748a1f01ab019e55fd6098a8b">&#9670;&#160;</a></span>arr</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::array&lt;std::shared_ptr&lt;<a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html">trie</a>&gt;, <a class="el" href="#a4bfac4be6ed1a34c7159eddb42469191">NUM_CHARS</a> &lt;&lt; 1&gt; data_structures::trie::arr</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Recursive tree nodes as an array of shared-pointers. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html">trie_tree.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a4cb0f775b5a4bc14a6d39b5c93883eb6" name="a4cb0f775b5a4bc14a6d39b5c93883eb6"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a4cb0f775b5a4bc14a6d39b5c93883eb6">&#9670;&#160;</a></span>isEndofWord</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">bool data_structures::trie::isEndofWord = false</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>identifier if a node is terminal node </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html#l00030">30</a> of file <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html">trie_tree.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a4bfac4be6ed1a34c7159eddb42469191" name="a4bfac4be6ed1a34c7159eddb42469191"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a4bfac4be6ed1a34c7159eddb42469191">&#9670;&#160;</a></span>NUM_CHARS</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">uint8_t data_structures::trie::NUM_CHARS = 26</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">static</span><span class="mlabel">constexpr</span><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Number of alphabets. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html#l00027">27</a> of file <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html">trie_tree.cpp</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../d7/d83/trie__tree_8cpp.html">trie_tree.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d7/d83/trie__tree_8cpp_source.html">trie_tree.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d0/d3e/classdata__structures_1_1trie_a0ab94bc6417e3f59fab33cea5b64d546_cgraph.map b/d0/d3e/classdata__structures_1_1trie_a0ab94bc6417e3f59fab33cea5b64d546_cgraph.map
deleted file mode 100644
index 1cedd2b5e..000000000
--- a/d0/d3e/classdata__structures_1_1trie_a0ab94bc6417e3f59fab33cea5b64d546_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="data_structures::trie::insert" name="data_structures::trie::insert">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,39,143,79"/>
-<area shape="rect" id="Node000002" href="$d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988" title="Convert a character to integer for indexing." alt="" coords="191,5,328,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="142,44,175,38,176,43,143,49"/>
-<area shape="rect" id="Node000004" href="$d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8" title="Class default constructor." alt="" coords="191,71,328,111"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="143,68,176,74,175,79,142,73"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="376,13,444,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="328,23,361,23,361,28,328,28"/>
-</map>
diff --git a/d0/d3e/classdata__structures_1_1trie_a0ab94bc6417e3f59fab33cea5b64d546_cgraph.md5 b/d0/d3e/classdata__structures_1_1trie_a0ab94bc6417e3f59fab33cea5b64d546_cgraph.md5
deleted file mode 100644
index 738a4c981..000000000
--- a/d0/d3e/classdata__structures_1_1trie_a0ab94bc6417e3f59fab33cea5b64d546_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-83f66359bb4ca43365398f5827b2bec7
\ No newline at end of file
diff --git a/d0/d3e/classdata__structures_1_1trie_a0ab94bc6417e3f59fab33cea5b64d546_cgraph.svg b/d0/d3e/classdata__structures_1_1trie_a0ab94bc6417e3f59fab33cea5b64d546_cgraph.svg
deleted file mode 100644
index 9bc8dbe17..000000000
--- a/d0/d3e/classdata__structures_1_1trie_a0ab94bc6417e3f59fab33cea5b64d546_cgraph.svg
+++ /dev/null
@@ -1,104 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::trie::insert Pages: 1 -->
-<svg width="337pt" height="88pt"
- viewBox="0.00 0.00 337.25 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>data_structures::trie::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="103,-54.5 0,-54.5 0,-24 103,-24 103,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="51.5" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988" target="_top" xlink:title="Convert a character to integer for indexing.">
-<polygon fill="white" stroke="#666666" points="242,-79.5 139,-79.5 139,-49 242,-49 242,-79.5"/>
-<text text-anchor="start" x="147" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="190.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::char_to_int</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-48.49C111,-49.93 119.21,-51.42 127.31,-52.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.67,-56.34 137.14,-54.69 127.93,-49.46 126.67,-56.34"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8" target="_top" xlink:title="Class default constructor.">
-<polygon fill="white" stroke="#666666" points="242,-30.5 139,-30.5 139,0 242,0 242,-30.5"/>
-<text text-anchor="start" x="147" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="190.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::trie</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-30.38C111,-29 119.21,-27.56 127.31,-26.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.89,-29.6 137.14,-24.42 126.68,-22.7 127.89,-29.6"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="329.25,-73.88 278,-73.88 278,-54.62 329.25,-54.62 329.25,-73.88"/>
-<text text-anchor="middle" x="303.62" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.18,-64.25C250.4,-64.25 258.75,-64.25 266.52,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.26,-67.75 276.26,-64.25 266.26,-60.75 266.26,-67.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d3e/classdata__structures_1_1trie_a0ab94bc6417e3f59fab33cea5b64d546_cgraph_org.svg b/d0/d3e/classdata__structures_1_1trie_a0ab94bc6417e3f59fab33cea5b64d546_cgraph_org.svg
deleted file mode 100644
index 8a54fe585..000000000
--- a/d0/d3e/classdata__structures_1_1trie_a0ab94bc6417e3f59fab33cea5b64d546_cgraph_org.svg
+++ /dev/null
@@ -1,78 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::trie::insert Pages: 1 -->
-<svg width="337pt" height="88pt"
- viewBox="0.00 0.00 337.25 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>data_structures::trie::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="103,-54.5 0,-54.5 0,-24 103,-24 103,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="51.5" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988" target="_top" xlink:title="Convert a character to integer for indexing.">
-<polygon fill="white" stroke="#666666" points="242,-79.5 139,-79.5 139,-49 242,-49 242,-79.5"/>
-<text text-anchor="start" x="147" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="190.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::char_to_int</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-48.49C111,-49.93 119.21,-51.42 127.31,-52.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.67,-56.34 137.14,-54.69 127.93,-49.46 126.67,-56.34"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8" target="_top" xlink:title="Class default constructor.">
-<polygon fill="white" stroke="#666666" points="242,-30.5 139,-30.5 139,0 242,0 242,-30.5"/>
-<text text-anchor="start" x="147" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="190.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::trie</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-30.38C111,-29 119.21,-27.56 127.31,-26.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.89,-29.6 137.14,-24.42 126.68,-22.7 127.89,-29.6"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="329.25,-73.88 278,-73.88 278,-54.62 329.25,-54.62 329.25,-73.88"/>
-<text text-anchor="middle" x="303.62" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.18,-64.25C250.4,-64.25 258.75,-64.25 266.52,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.26,-67.75 276.26,-64.25 266.26,-60.75 266.26,-67.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.map b/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.map
deleted file mode 100644
index 08e9a24ca..000000000
--- a/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="data_structures::trie::search" name="data_structures::trie::search">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,35,143,75"/>
-<area shape="rect" id="Node000002" href="$d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988" title="Convert a character to integer for indexing." alt="" coords="191,5,328,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="142,42,175,36,176,42,143,47"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="198,70,320,96"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="143,63,184,69,183,74,142,68"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="376,13,444,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="328,23,361,23,361,28,328,28"/>
-</map>
diff --git a/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.md5 b/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.md5
deleted file mode 100644
index 8881e5ec5..000000000
--- a/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0f676e3556c01c3ab8d66b946e0745ea
\ No newline at end of file
diff --git a/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.svg b/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.svg
deleted file mode 100644
index f076723ee..000000000
--- a/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::trie::search Pages: 1 -->
-<svg width="337pt" height="76pt"
- viewBox="0.00 0.00 337.25 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>data_structures::trie::search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="103,-45.88 0,-45.88 0,-15.37 103,-15.37 103,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="51.5" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988" target="_top" xlink:title="Convert a character to integer for indexing.">
-<polygon fill="white" stroke="#666666" points="242,-67.88 139,-67.88 139,-37.38 242,-37.38 242,-67.88"/>
-<text text-anchor="start" x="147" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="190.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::char_to_int</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-38.75C111,-40.02 119.21,-41.34 127.31,-42.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.7,-46.09 137.13,-44.22 127.81,-39.17 126.7,-46.09"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.38,-19.25 144.62,-19.25 144.62,0 236.38,0 236.38,-19.25"/>
-<text text-anchor="middle" x="190.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-22.87C112.98,-21.35 123.37,-19.76 133.39,-18.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.66,-21.73 143.01,-16.75 132.6,-14.81 133.66,-21.73"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="329.25,-62.25 278,-62.25 278,-43 329.25,-43 329.25,-62.25"/>
-<text text-anchor="middle" x="303.62" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.18,-52.62C250.4,-52.62 258.75,-52.62 266.52,-52.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.26,-56.13 276.26,-52.63 266.26,-49.13 266.26,-56.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph_org.svg b/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph_org.svg
deleted file mode 100644
index 609662301..000000000
--- a/d0/d3e/classdata__structures_1_1trie_a499f87fd833203ef9492b4870aa6d42d_cgraph_org.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::trie::search Pages: 1 -->
-<svg width="337pt" height="76pt"
- viewBox="0.00 0.00 337.25 75.88" 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 71.88)">
-<title>data_structures::trie::search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="103,-45.88 0,-45.88 0,-15.37 103,-15.37 103,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="51.5" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988" target="_top" xlink:title="Convert a character to integer for indexing.">
-<polygon fill="white" stroke="#666666" points="242,-67.88 139,-67.88 139,-37.38 242,-37.38 242,-67.88"/>
-<text text-anchor="start" x="147" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="190.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::char_to_int</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-38.75C111,-40.02 119.21,-41.34 127.31,-42.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.7,-46.09 137.13,-44.22 127.81,-39.17 126.7,-46.09"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.38,-19.25 144.62,-19.25 144.62,0 236.38,0 236.38,-19.25"/>
-<text text-anchor="middle" x="190.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-22.87C112.98,-21.35 123.37,-19.76 133.39,-18.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.66,-21.73 143.01,-16.75 132.6,-14.81 133.66,-21.73"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="329.25,-62.25 278,-62.25 278,-43 329.25,-43 329.25,-62.25"/>
-<text text-anchor="middle" x="303.62" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.18,-52.62C250.4,-52.62 258.75,-52.62 266.52,-52.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.26,-56.13 276.26,-52.63 266.26,-49.13 266.26,-56.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d3e/classdata__structures_1_1trie_a961eb5d576d2420f2036009154397c63_cgraph.map b/d0/d3e/classdata__structures_1_1trie_a961eb5d576d2420f2036009154397c63_cgraph.map
deleted file mode 100644
index 08e9a24ca..000000000
--- a/d0/d3e/classdata__structures_1_1trie_a961eb5d576d2420f2036009154397c63_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="data_structures::trie::search" name="data_structures::trie::search">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,35,143,75"/>
-<area shape="rect" id="Node000002" href="$d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988" title="Convert a character to integer for indexing." alt="" coords="191,5,328,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="142,42,175,36,176,42,143,47"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="198,70,320,96"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="143,63,184,69,183,74,142,68"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="376,13,444,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="328,23,361,23,361,28,328,28"/>
-</map>
diff --git a/d0/d3e/classdata__structures_1_1trie_a961eb5d576d2420f2036009154397c63_cgraph.md5 b/d0/d3e/classdata__structures_1_1trie_a961eb5d576d2420f2036009154397c63_cgraph.md5
deleted file mode 100644
index 8881e5ec5..000000000
--- a/d0/d3e/classdata__structures_1_1trie_a961eb5d576d2420f2036009154397c63_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0f676e3556c01c3ab8d66b946e0745ea
\ No newline at end of file
diff --git a/d0/d3e/classdata__structures_1_1trie_a961eb5d576d2420f2036009154397c63_cgraph.svg b/d0/d3e/classdata__structures_1_1trie_a961eb5d576d2420f2036009154397c63_cgraph.svg
deleted file mode 100644
index f076723ee..000000000
--- a/d0/d3e/classdata__structures_1_1trie_a961eb5d576d2420f2036009154397c63_cgraph.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::trie::search Pages: 1 -->
-<svg width="337pt" height="76pt"
- viewBox="0.00 0.00 337.25 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>data_structures::trie::search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="103,-45.88 0,-45.88 0,-15.37 103,-15.37 103,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="51.5" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988" target="_top" xlink:title="Convert a character to integer for indexing.">
-<polygon fill="white" stroke="#666666" points="242,-67.88 139,-67.88 139,-37.38 242,-37.38 242,-67.88"/>
-<text text-anchor="start" x="147" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="190.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::char_to_int</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-38.75C111,-40.02 119.21,-41.34 127.31,-42.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.7,-46.09 137.13,-44.22 127.81,-39.17 126.7,-46.09"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.38,-19.25 144.62,-19.25 144.62,0 236.38,0 236.38,-19.25"/>
-<text text-anchor="middle" x="190.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-22.87C112.98,-21.35 123.37,-19.76 133.39,-18.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.66,-21.73 143.01,-16.75 132.6,-14.81 133.66,-21.73"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="329.25,-62.25 278,-62.25 278,-43 329.25,-43 329.25,-62.25"/>
-<text text-anchor="middle" x="303.62" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.18,-52.62C250.4,-52.62 258.75,-52.62 266.52,-52.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.26,-56.13 276.26,-52.63 266.26,-49.13 266.26,-56.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d3e/classdata__structures_1_1trie_a961eb5d576d2420f2036009154397c63_cgraph_org.svg b/d0/d3e/classdata__structures_1_1trie_a961eb5d576d2420f2036009154397c63_cgraph_org.svg
deleted file mode 100644
index 609662301..000000000
--- a/d0/d3e/classdata__structures_1_1trie_a961eb5d576d2420f2036009154397c63_cgraph_org.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::trie::search Pages: 1 -->
-<svg width="337pt" height="76pt"
- viewBox="0.00 0.00 337.25 75.88" 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 71.88)">
-<title>data_structures::trie::search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="103,-45.88 0,-45.88 0,-15.37 103,-15.37 103,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="51.5" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988" target="_top" xlink:title="Convert a character to integer for indexing.">
-<polygon fill="white" stroke="#666666" points="242,-67.88 139,-67.88 139,-37.38 242,-37.38 242,-67.88"/>
-<text text-anchor="start" x="147" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="190.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::char_to_int</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-38.75C111,-40.02 119.21,-41.34 127.31,-42.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.7,-46.09 137.13,-44.22 127.81,-39.17 126.7,-46.09"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.38,-19.25 144.62,-19.25 144.62,0 236.38,0 236.38,-19.25"/>
-<text text-anchor="middle" x="190.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-22.87C112.98,-21.35 123.37,-19.76 133.39,-18.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.66,-21.73 143.01,-16.75 132.6,-14.81 133.66,-21.73"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="329.25,-62.25 278,-62.25 278,-43 329.25,-43 329.25,-62.25"/>
-<text text-anchor="middle" x="303.62" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.18,-52.62C250.4,-52.62 258.75,-52.62 266.52,-52.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.26,-56.13 276.26,-52.63 266.26,-49.13 266.26,-56.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.map b/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.map
deleted file mode 100644
index 8f2791eab..000000000
--- a/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::trie::char_to_int" name="data_structures::trie::char_to_int">
-<area shape="rect" id="Node000001" title="Convert a character to integer for indexing." alt="" coords="5,5,143,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="191,13,259,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="143,23,175,23,175,28,143,28"/>
-</map>
diff --git a/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.md5 b/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.md5
deleted file mode 100644
index c11a2101d..000000000
--- a/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-28043d462ac8f6fdb703c0e6afdc4c25
\ No newline at end of file
diff --git a/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.svg b/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.svg
deleted file mode 100644
index ed1df5128..000000000
--- a/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::trie::char_to_int Pages: 1 -->
-<svg width="198pt" height="39pt"
- viewBox="0.00 0.00 198.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::trie::char_to_int</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Convert a character to integer for indexing.">
-<polygon fill="#999999" stroke="#666666" points="103,-30.5 0,-30.5 0,0 103,0 103,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="51.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::char_to_int</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="190.25,-24.88 139,-24.88 139,-5.63 190.25,-5.63 190.25,-24.88"/>
-<text text-anchor="middle" x="164.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.18,-15.25C111.4,-15.25 119.75,-15.25 127.52,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.26,-18.75 137.26,-15.25 127.26,-11.75 127.26,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph_org.svg b/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph_org.svg
deleted file mode 100644
index 301adfa33..000000000
--- a/d0/d3e/classdata__structures_1_1trie_aab373beb3f618b90922528c68797d988_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::trie::char_to_int Pages: 1 -->
-<svg width="198pt" height="39pt"
- viewBox="0.00 0.00 198.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::trie::char_to_int</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Convert a character to integer for indexing.">
-<polygon fill="#999999" stroke="#666666" points="103,-30.5 0,-30.5 0,0 103,0 103,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="51.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::char_to_int</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="190.25,-24.88 139,-24.88 139,-5.63 190.25,-5.63 190.25,-24.88"/>
-<text text-anchor="middle" x="164.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.18,-15.25C111.4,-15.25 119.75,-15.25 127.52,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.26,-18.75 137.26,-15.25 127.26,-11.75 127.26,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.map b/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.map
deleted file mode 100644
index 70f2c716e..000000000
--- a/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="data_structures::trie::deleteString" name="data_structures::trie::deleteString">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,35,143,75"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="39,35,37,25,43,16,55,10,74,8,94,10,106,17,104,21,93,16,74,13,57,15,46,20,42,26,44,34"/>
-<area shape="rect" id="Node000002" href="$d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988" title="Convert a character to integer for indexing." alt="" coords="191,5,328,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="142,42,175,36,176,42,143,47"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="198,70,320,96"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="143,63,184,69,183,74,142,68"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="376,13,444,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="328,23,361,23,361,28,328,28"/>
-</map>
diff --git a/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.md5 b/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.md5
deleted file mode 100644
index 2c5bb1765..000000000
--- a/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c2a3f455763bf31fa28450e5fb302367
\ No newline at end of file
diff --git a/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.svg b/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.svg
deleted file mode 100644
index 1ebcdadc1..000000000
--- a/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph.svg
+++ /dev/null
@@ -1,112 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::trie::deleteString Pages: 1 -->
-<svg width="337pt" height="76pt"
- viewBox="0.00 0.00 337.25 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>data_structures::trie::deleteString</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="103,-45.88 0,-45.88 0,-15.37 103,-15.37 103,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="51.5" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::deleteString</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.87,-46.36C21.84,-55.43 30.05,-63.88 51.5,-63.88 63.23,-63.88 71,-61.35 74.81,-57.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.26,-58.2 75.95,-47.86 71.31,-57.39 78.26,-58.2"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988" target="_top" xlink:title="Convert a character to integer for indexing.">
-<polygon fill="white" stroke="#666666" points="242,-67.88 139,-67.88 139,-37.38 242,-37.38 242,-67.88"/>
-<text text-anchor="start" x="147" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="190.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::char_to_int</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-38.75C111,-40.02 119.21,-41.34 127.31,-42.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.7,-46.09 137.13,-44.22 127.81,-39.17 126.7,-46.09"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.38,-19.25 144.62,-19.25 144.62,0 236.38,0 236.38,-19.25"/>
-<text text-anchor="middle" x="190.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-22.87C112.98,-21.35 123.37,-19.76 133.39,-18.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.66,-21.73 143.01,-16.75 132.6,-14.81 133.66,-21.73"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="329.25,-62.25 278,-62.25 278,-43 329.25,-43 329.25,-62.25"/>
-<text text-anchor="middle" x="303.62" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.18,-52.62C250.4,-52.62 258.75,-52.62 266.52,-52.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.26,-56.13 276.26,-52.63 266.26,-49.13 266.26,-56.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph_org.svg b/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph_org.svg
deleted file mode 100644
index 89e88421a..000000000
--- a/d0/d3e/classdata__structures_1_1trie_aeac27cfd397d2dd3f2f519efffafeeab_cgraph_org.svg
+++ /dev/null
@@ -1,86 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::trie::deleteString Pages: 1 -->
-<svg width="337pt" height="76pt"
- viewBox="0.00 0.00 337.25 75.88" 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 71.88)">
-<title>data_structures::trie::deleteString</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="103,-45.88 0,-45.88 0,-15.37 103,-15.37 103,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="51.5" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::deleteString</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.87,-46.36C21.84,-55.43 30.05,-63.88 51.5,-63.88 63.23,-63.88 71,-61.35 74.81,-57.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.26,-58.2 75.95,-47.86 71.31,-57.39 78.26,-58.2"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988" target="_top" xlink:title="Convert a character to integer for indexing.">
-<polygon fill="white" stroke="#666666" points="242,-67.88 139,-67.88 139,-37.38 242,-37.38 242,-67.88"/>
-<text text-anchor="start" x="147" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="middle" x="190.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::char_to_int</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-38.75C111,-40.02 119.21,-41.34 127.31,-42.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.7,-46.09 137.13,-44.22 127.81,-39.17 126.7,-46.09"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.38,-19.25 144.62,-19.25 144.62,0 236.38,0 236.38,-19.25"/>
-<text text-anchor="middle" x="190.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-22.87C112.98,-21.35 123.37,-19.76 133.39,-18.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.66,-21.73 143.01,-16.75 132.6,-14.81 133.66,-21.73"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="329.25,-62.25 278,-62.25 278,-43 329.25,-43 329.25,-62.25"/>
-<text text-anchor="middle" x="303.62" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.18,-52.62C250.4,-52.62 258.75,-52.62 266.52,-52.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.26,-56.13 276.26,-52.63 266.26,-49.13 266.26,-56.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d46/finding__number__of__digits__in__a__number_8cpp.html b/d0/d46/finding__number__of__digits__in__a__number_8cpp.html
index 2a7ecb041..572fa2bdb 100644
--- a/d0/d46/finding__number__of__digits__in__a__number_8cpp.html
+++ b/d0/d46/finding__number__of__digits__in__a__number_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/finding_number_of_digits_in_a_number.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/finding_number_of_digits_in_a_number.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for finding_number_of_digits_in_a_number.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d4a/finding__number__of__digits__in__a__number_8cpp__incl.svg" width="336" height="126"><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">
+</div>
+<p><a href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a8a3b522a675ab4cdec2d275f6f7798a1" id="r_a8a3b522a675ab4cdec2d275f6f7798a1"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a> (uint64_t n)</td></tr>
@@ -144,6 +163,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/amino19" target="_blank">aminos 🇮🇳</a></dd></dl>
 <p>It is a very basic math of finding number of digits in a given number i.e, we can use it by inputting values whether it can be a positive/negative value, let's say: an integer. There is also a second method: by using "K = floor(log10(N) + 1)", but it's only applicable for numbers (not integers). The code for that is also included (finding_number_of_digits_in_a_number_using_log). For more details, refer to the <a href="https://github.com/TheAlgorithms/Algorithms-Explanation/blob/master/en/Basic%20Math/Finding
 the number of digits in a number.md" target="_blank">Algorithms-Explanation</a> repository. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html">finding_number_of_digits_in_a_number.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a8a3b522a675ab4cdec2d275f6f7798a1" name="a8a3b522a675ab4cdec2d275f6f7798a1"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a8a3b522a675ab4cdec2d275f6f7798a1">&#9670;&#160;</a></span>finding_number_of_digits_in_a_number()</h2>
@@ -170,8 +191,10 @@ the number of digits in a number.md" target="_blank">Algorithms-Explanation</a>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the digits count </dd></dl>
 <p>&lt; the variable used for the digits count</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html">finding_number_of_digits_in_a_number.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   31</span>                                                          {</div>
-<div class="line"><span class="lineno">   32</span>    uint64_t count = 0;  <span class="comment">///&lt; the variable used for the digits count</span></div>
+<div class="line"><span class="lineno">   32</span>    uint64_t count = 0;  </div>
 <div class="line"><span class="lineno">   33</span> </div>
 <div class="line"><span class="lineno">   34</span>    <span class="comment">// iterate until `n` becomes 0</span></div>
 <div class="line"><span class="lineno">   35</span>    <span class="comment">// remove last digit from `n` in each iteration</span></div>
@@ -211,6 +234,8 @@ the number of digits in a number.md" target="_blank">Algorithms-Explanation</a>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the digits count </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html#l00054">54</a> of file <a class="el" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html">finding_number_of_digits_in_a_number.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   54</span>                                                                {</div>
 <div class="line"><span class="lineno">   55</span>    <span class="comment">// log(0) is undefined</span></div>
 <div class="line"><span class="lineno">   56</span>    <span class="keywordflow">if</span> (n == 0) {</div>
@@ -222,12 +247,10 @@ the number of digits in a number.md" target="_blank">Algorithms-Explanation</a>
 <div class="line"><span class="lineno">   62</span>        n = -n;</div>
 <div class="line"><span class="lineno">   63</span>    }</div>
 <div class="line"><span class="lineno">   64</span> </div>
-<div class="line"><span class="lineno">   65</span>    <span class="keywordtype">double</span> count = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/floor.html">floor</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log10.html">log10</a>(n) + 1);</div>
+<div class="line"><span class="lineno">   65</span>    <span class="keywordtype">double</span> count = floor(log10(n) + 1);</div>
 <div class="line"><span class="lineno">   66</span> </div>
 <div class="line"><span class="lineno">   67</span>    <span class="keywordflow">return</span> count;</div>
 <div class="line"><span class="lineno">   68</span>}</div>
-<div class="ttc" id="afloor_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/floor.html">std::floor</a></div><div class="ttdeci">T floor(T... args)</div></div>
-<div class="ttc" id="alog10_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/log10.html">std::log10</a></div><div class="ttdeci">T log10(T... args)</div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -256,6 +279,8 @@ the number of digits in a number.md" target="_blank">Algorithms-Explanation</a>
 
 <p>Self-test implementations. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html#l00074">74</a> of file <a class="el" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html">finding_number_of_digits_in_a_number.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   74</span>                         {</div>
 <div class="line"><span class="lineno">   75</span>    assert(<a class="code hl_function" href="#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(5492) == 4);</div>
 <div class="line"><span class="lineno">   76</span>    assert(<a class="code hl_function" href="#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(-0) == 0);</div>
@@ -265,13 +290,8 @@ the number of digits in a number.md" target="_blank">Algorithms-Explanation</a>
 <div class="line"><span class="lineno">   80</span>    assert(<a class="code hl_function" href="#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(13) == 2);</div>
 <div class="line"><span class="lineno">   81</span>    assert(<a class="code hl_function" href="#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(564) == 3);</div>
 <div class="line"><span class="lineno">   82</span>}</div>
-<div class="ttc" id="afinding__number__of__digits__in__a__number_8cpp_html_a8a3b522a675ab4cdec2d275f6f7798a1"><div class="ttname"><a href="#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a></div><div class="ttdeci">uint64_t finding_number_of_digits_in_a_number(uint64_t n)</div><div class="ttdoc">for log calculation</div><div class="ttdef"><b>Definition</b> finding_number_of_digits_in_a_number.cpp:31</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d46/finding__number__of__digits__in__a__number_8cpp_ab4c15b7f1aedd4419a65cd49562cc300_cgraph.svg" width="296" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afinding__number__of__digits__in__a__number_8cpp_html_a8a3b522a675ab4cdec2d275f6f7798a1"><div class="ttname"><a href="#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a></div><div class="ttdeci">uint64_t finding_number_of_digits_in_a_number(uint64_t n)</div><div class="ttdoc">for log calculation</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html#l00031">finding_number_of_digits_in_a_number.cpp:31</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -291,21 +311,17 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html#l00097">97</a> of file <a class="el" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html">finding_number_of_digits_in_a_number.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   97</span>           {</div>
 <div class="line"><span class="lineno">   98</span>    <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   99</span>    <a class="code hl_function" href="#ab4c15b7f1aedd4419a65cd49562cc300">first_test</a>();</div>
 <div class="line"><span class="lineno">  100</span>    second_test();</div>
-<div class="line"><span class="lineno">  101</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  102</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  103</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="afinding__number__of__digits__in__a__number_8cpp_html_ab4c15b7f1aedd4419a65cd49562cc300"><div class="ttname"><a href="#ab4c15b7f1aedd4419a65cd49562cc300">first_test</a></div><div class="ttdeci">static void first_test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> finding_number_of_digits_in_a_number.cpp:74</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d46/finding__number__of__digits__in__a__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="394" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afinding__number__of__digits__in__a__number_8cpp_html_ab4c15b7f1aedd4419a65cd49562cc300"><div class="ttname"><a href="#ab4c15b7f1aedd4419a65cd49562cc300">first_test</a></div><div class="ttdeci">static void first_test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html#l00074">finding_number_of_digits_in_a_number.cpp:74</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a8b222ea7f3e6e3128e67d546b654d3a9" name="a8b222ea7f3e6e3128e67d546b654d3a9"></a>
@@ -330,6 +346,8 @@ Here is the call graph for this function:</div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html#l00084">84</a> of file <a class="el" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html">finding_number_of_digits_in_a_number.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   84</span>                          {</div>
 <div class="line"><span class="lineno">   85</span>    assert(<a class="code hl_function" href="#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(5492) == 4);</div>
 <div class="line"><span class="lineno">   86</span>    assert(<a class="code hl_function" href="#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(-0) == 0);</div>
@@ -339,7 +357,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   90</span>    assert(<a class="code hl_function" href="#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(13) == 2);</div>
 <div class="line"><span class="lineno">   91</span>    assert(<a class="code hl_function" href="#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(564) == 3);</div>
 <div class="line"><span class="lineno">   92</span>}</div>
-<div class="ttc" id="afinding__number__of__digits__in__a__number_8cpp_html_ac0862b67cf73651707ece04673e1ae49"><div class="ttname"><a href="#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a></div><div class="ttdeci">double finding_number_of_digits_in_a_number_using_log(double n)</div><div class="ttdoc">This function finds the number of digits in constant time using logarithmic function TC: O(1)</div><div class="ttdef"><b>Definition</b> finding_number_of_digits_in_a_number.cpp:54</div></div>
+<div class="ttc" id="afinding__number__of__digits__in__a__number_8cpp_html_ac0862b67cf73651707ece04673e1ae49"><div class="ttname"><a href="#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a></div><div class="ttdeci">double finding_number_of_digits_in_a_number_using_log(double n)</div><div class="ttdoc">This function finds the number of digits in constant time using logarithmic function TC: O(1)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html#l00054">finding_number_of_digits_in_a_number.cpp:54</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/d0/d46/finding__number__of__digits__in__a__number_8cpp_ab4c15b7f1aedd4419a65cd49562cc300_cgraph.map b/d0/d46/finding__number__of__digits__in__a__number_8cpp_ab4c15b7f1aedd4419a65cd49562cc300_cgraph.map
deleted file mode 100644
index 42f293293..000000000
--- a/d0/d46/finding__number__of__digits__in__a__number_8cpp_ab4c15b7f1aedd4419a65cd49562cc300_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="first_test" name="first_test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,13,78,38"/>
-<area shape="rect" id="Node000002" href="$d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1" title="for log calculation" alt="" coords="126,5,291,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="78,23,110,23,110,28,78,28"/>
-</map>
diff --git a/d0/d46/finding__number__of__digits__in__a__number_8cpp_ab4c15b7f1aedd4419a65cd49562cc300_cgraph.md5 b/d0/d46/finding__number__of__digits__in__a__number_8cpp_ab4c15b7f1aedd4419a65cd49562cc300_cgraph.md5
deleted file mode 100644
index 3a1236cb1..000000000
--- a/d0/d46/finding__number__of__digits__in__a__number_8cpp_ab4c15b7f1aedd4419a65cd49562cc300_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5ad9fc7e13e0f0dc5673de02235e03df
\ No newline at end of file
diff --git a/d0/d46/finding__number__of__digits__in__a__number_8cpp_ab4c15b7f1aedd4419a65cd49562cc300_cgraph.svg b/d0/d46/finding__number__of__digits__in__a__number_8cpp_ab4c15b7f1aedd4419a65cd49562cc300_cgraph.svg
deleted file mode 100644
index 6099ad2c9..000000000
--- a/d0/d46/finding__number__of__digits__in__a__number_8cpp_ab4c15b7f1aedd4419a65cd49562cc300_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: first_test Pages: 1 -->
-<svg width="222pt" height="39pt"
- viewBox="0.00 0.00 222.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>first_test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="54.25,-24.88 0,-24.88 0,-5.63 54.25,-5.63 54.25,-24.88"/>
-<text text-anchor="middle" x="27.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">first_test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1" target="_top" xlink:title="for log calculation">
-<polygon fill="white" stroke="#666666" points="214.25,-30.5 90.25,-30.5 90.25,0 214.25,0 214.25,-30.5"/>
-<text text-anchor="start" x="98.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">finding_number_of_digits</text>
-<text text-anchor="middle" x="152.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_in_a_number</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M54.54,-15.25C61.81,-15.25 70.07,-15.25 78.61,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.45,-18.75 88.45,-15.25 78.45,-11.75 78.45,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d46/finding__number__of__digits__in__a__number_8cpp_ab4c15b7f1aedd4419a65cd49562cc300_cgraph_org.svg b/d0/d46/finding__number__of__digits__in__a__number_8cpp_ab4c15b7f1aedd4419a65cd49562cc300_cgraph_org.svg
deleted file mode 100644
index 22b1eb3be..000000000
--- a/d0/d46/finding__number__of__digits__in__a__number_8cpp_ab4c15b7f1aedd4419a65cd49562cc300_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: first_test Pages: 1 -->
-<svg width="222pt" height="39pt"
- viewBox="0.00 0.00 222.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>first_test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="54.25,-24.88 0,-24.88 0,-5.63 54.25,-5.63 54.25,-24.88"/>
-<text text-anchor="middle" x="27.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">first_test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1" target="_top" xlink:title="for log calculation">
-<polygon fill="white" stroke="#666666" points="214.25,-30.5 90.25,-30.5 90.25,0 214.25,0 214.25,-30.5"/>
-<text text-anchor="start" x="98.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">finding_number_of_digits</text>
-<text text-anchor="middle" x="152.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_in_a_number</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M54.54,-15.25C61.81,-15.25 70.07,-15.25 78.61,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.45,-18.75 88.45,-15.25 78.45,-11.75 78.45,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d46/finding__number__of__digits__in__a__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d0/d46/finding__number__of__digits__in__a__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 755e15691..000000000
--- a/d0/d46/finding__number__of__digits__in__a__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,13,55,38"/>
-<area shape="rect" id="Node000002" href="$d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300" title="Self&#45;test implementations." alt="" coords="103,13,175,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,23,87,23,87,28,55,28"/>
-<area shape="rect" id="Node000003" href="$d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1" title="for log calculation" alt="" coords="223,5,388,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="175,23,207,23,207,28,175,28"/>
-</map>
diff --git a/d0/d46/finding__number__of__digits__in__a__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d0/d46/finding__number__of__digits__in__a__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index bf4c3bf86..000000000
--- a/d0/d46/finding__number__of__digits__in__a__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cf8cf0ca556d01b11a9915d07f3e320f
\ No newline at end of file
diff --git a/d0/d46/finding__number__of__digits__in__a__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d0/d46/finding__number__of__digits__in__a__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 4a72e4779..000000000
--- a/d0/d46/finding__number__of__digits__in__a__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="295pt" height="39pt"
- viewBox="0.00 0.00 295.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-24.88 0,-24.88 0,-5.63 37,-5.63 37,-24.88"/>
-<text text-anchor="middle" x="18.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="127.25,-24.88 73,-24.88 73,-5.63 127.25,-5.63 127.25,-24.88"/>
-<text text-anchor="middle" x="100.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">first_test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.17,-15.25C44.35,-15.25 52.94,-15.25 61.41,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.22,-18.75 71.21,-15.25 61.21,-11.75 61.22,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1" target="_top" xlink:title="for log calculation">
-<polygon fill="white" stroke="#666666" points="287.25,-30.5 163.25,-30.5 163.25,0 287.25,0 287.25,-30.5"/>
-<text text-anchor="start" x="171.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">finding_number_of_digits</text>
-<text text-anchor="middle" x="225.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_in_a_number</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.54,-15.25C134.81,-15.25 143.07,-15.25 151.61,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.45,-18.75 161.45,-15.25 151.45,-11.75 151.45,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d46/finding__number__of__digits__in__a__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d0/d46/finding__number__of__digits__in__a__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 3234a8788..000000000
--- a/d0/d46/finding__number__of__digits__in__a__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="295pt" height="39pt"
- viewBox="0.00 0.00 295.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-24.88 0,-24.88 0,-5.63 37,-5.63 37,-24.88"/>
-<text text-anchor="middle" x="18.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="127.25,-24.88 73,-24.88 73,-5.63 127.25,-5.63 127.25,-24.88"/>
-<text text-anchor="middle" x="100.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">first_test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.17,-15.25C44.35,-15.25 52.94,-15.25 61.41,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.22,-18.75 71.21,-15.25 61.21,-11.75 61.22,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1" target="_top" xlink:title="for log calculation">
-<polygon fill="white" stroke="#666666" points="287.25,-30.5 163.25,-30.5 163.25,0 287.25,0 287.25,-30.5"/>
-<text text-anchor="start" x="171.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">finding_number_of_digits</text>
-<text text-anchor="middle" x="225.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_in_a_number</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.54,-15.25C134.81,-15.25 143.07,-15.25 151.61,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.45,-18.75 161.45,-15.25 151.45,-11.75 151.45,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html b/d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html
new file mode 100644
index 000000000..7f605d8b2
--- /dev/null
+++ b/d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html
@@ -0,0 +1,213 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/finding_number_of_digits_in_a_number.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">finding_number_of_digits_in_a_number.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cmath&gt;</span>     </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="foldopen" id="foldopen00031" data-start="{" data-end="}">
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1">   31</a></span>uint64_t <a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(uint64_t n) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    uint64_t count = 0;  </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="comment">// iterate until `n` becomes 0</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="comment">// remove last digit from `n` in each iteration</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="comment">// increase `count` by 1 in each iteration</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">while</span> (n != 0) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <span class="comment">// we can also use `n = n / 10`</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        n /= 10;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <span class="comment">// each time the loop is running, `count` will be incremented by 1.</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        ++count;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">return</span> count;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>}</div>
+</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="foldopen" id="foldopen00054" data-start="{" data-end="}">
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49">   54</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(<span class="keywordtype">double</span> n) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="comment">// log(0) is undefined</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">if</span> (n == 0) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="comment">// to handle the negative numbers</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">if</span> (n &lt; 0) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        n = -n;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordtype">double</span> count = floor(log10(n) + 1);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">return</span> count;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>}</div>
+</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="foldopen" id="foldopen00074" data-start="{" data-end="}">
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300">   74</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300">first_test</a>() {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(5492) == 4);</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(-0) == 0);</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(10000) == 5);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(9) == 1);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(100000) == 6);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(13) == 2);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a>(564) == 3);</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>}</div>
+</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span><span class="keyword">static</span> <span class="keywordtype">void</span> second_test() {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(5492) == 4);</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(-0) == 0);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(10000) == 5);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(9) == 1);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(100000) == 6);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(13) == 2);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    assert(<a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a>(564) == 3);</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>}</div>
+<div class="foldopen" id="foldopen00097" data-start="{" data-end="}">
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"><a class="line" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   97</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <a class="code hl_function" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300">first_test</a>();</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    second_test();</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>}</div>
+</div>
+<div class="ttc" id="afinding__number__of__digits__in__a__number_8cpp_html_a8a3b522a675ab4cdec2d275f6f7798a1"><div class="ttname"><a href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1">finding_number_of_digits_in_a_number</a></div><div class="ttdeci">uint64_t finding_number_of_digits_in_a_number(uint64_t n)</div><div class="ttdoc">for log calculation</div><div class="ttdef"><b>Definition</b> <a href="#l00031">finding_number_of_digits_in_a_number.cpp:31</a></div></div>
+<div class="ttc" id="afinding__number__of__digits__in__a__number_8cpp_html_ab4c15b7f1aedd4419a65cd49562cc300"><div class="ttname"><a href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300">first_test</a></div><div class="ttdeci">static void first_test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="#l00074">finding_number_of_digits_in_a_number.cpp:74</a></div></div>
+<div class="ttc" id="afinding__number__of__digits__in__a__number_8cpp_html_ac0862b67cf73651707ece04673e1ae49"><div class="ttname"><a href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49">finding_number_of_digits_in_a_number_using_log</a></div><div class="ttdeci">double finding_number_of_digits_in_a_number_using_log(double n)</div><div class="ttdoc">This function finds the number of digits in constant time using logarithmic function TC: O(1)</div><div class="ttdef"><b>Definition</b> <a href="#l00054">finding_number_of_digits_in_a_number.cpp:54</a></div></div>
+<div class="ttc" id="afinding__number__of__digits__in__a__number_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00097">finding_number_of_digits_in_a_number.cpp:97</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d0/d46/finding__number__of__digits__in__a__number_8cpp.html">finding_number_of_digits_in_a_number.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d0/d51/approximate__pi_8cpp.html b/d0/d51/approximate__pi_8cpp.html
index 3febc347e..c9f7a9840 100644
--- a/d0/d51/approximate__pi_8cpp.html
+++ b/d0/d51/approximate__pi_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/approximate_pi.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/approximate_pi.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for approximate_pi.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d27/approximate__pi_8cpp__incl.svg" width="335" height="111"><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">
+</div>
+<p><a href="../../d0/d51/approximate__pi_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -138,7 +157,7 @@ Typedefs</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:abf7f2a6d91f1ca6c89698792aea3f188" id="r_abf7f2a6d91f1ca6c89698792aea3f188"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math::approximate_pi</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85">Point</a> &gt; &amp;pts)</td></tr>
+<tr class="memitem:abf7f2a6d91f1ca6c89698792aea3f188" id="r_abf7f2a6d91f1ca6c89698792aea3f188"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math::approximate_pi</a> (const std::vector&lt; <a class="el" href="../../dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85">Point</a> &gt; &amp;pts)</td></tr>
 <tr class="memdesc:abf7f2a6d91f1ca6c89698792aea3f188"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function uses the points in a given vector 'pts' (drawn at random) to return an approximation of the number π.  <br /></td></tr>
 <tr class="separator:abf7f2a6d91f1ca6c89698792aea3f188"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
@@ -152,6 +171,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Implementation to calculate an estimate of the <a href="https://en.wikipedia.org/wiki/File:Pi_30K.gif" target="_blank">number π (Pi)</a>. </p>
 <p>We take a random point P with coordinates (x, y) such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1. If x² + y² ≤ 1, then the point is inside the quarter disk of radius 1, else the point is outside. We know that the probability of the point being inside the quarter disk is equal to π/4 double approx(vector&lt;Point&gt; &amp;pts) which will use the points pts (drawn at random) to return an estimate of the number π </p><dl class="section note"><dt>Note</dt><dd>This implementation is better than naive recursive or iterative approach.</dd></dl>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Qannaf" target="_blank">Qannaf AL-SAHMI</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d0/d51/approximate__pi_8cpp_source.html">approximate_pi.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -170,17 +191,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d51/approximate__pi_8cpp_source.html#l00080">80</a> of file <a class="el" href="../../d0/d51/approximate__pi_8cpp_source.html">approximate_pi.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   80</span>           {</div>
 <div class="line"><span class="lineno">   81</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   82</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   83</span>}</div>
-<div class="ttc" id="aapproximate__pi_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> approximate_pi.cpp:62</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d51/approximate__pi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="524" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aapproximate__pi_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d51/approximate__pi_8cpp_source.html#l00062">approximate_pi.cpp:62</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -208,32 +226,24 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d51/approximate__pi_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../d0/d51/approximate__pi_8cpp_source.html">approximate_pi.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>                    {</div>
-<div class="line"><span class="lineno">   63</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;math::Point&gt;</a> rands;</div>
-<div class="line"><span class="lineno">   64</span>    <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> i = 0; i &lt; 100000; i++) {</div>
+<div class="line"><span class="lineno">   63</span>    std::vector&lt;math::Point&gt; rands;</div>
+<div class="line"><span class="lineno">   64</span>    <span class="keywordflow">for</span> (std::size_t i = 0; i &lt; 100000; i++) {</div>
 <div class="line"><span class="lineno">   65</span>        <a class="code hl_typedef" href="../../dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85">math::Point</a> p;</div>
 <div class="line"><span class="lineno">   66</span>        p.x = rand() / <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(RAND_MAX);  <span class="comment">// 0 &lt;= x &lt;= 1</span></div>
 <div class="line"><span class="lineno">   67</span>        p.y = rand() / <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(RAND_MAX);  <span class="comment">// 0 &lt;= y &lt;= 1</span></div>
-<div class="line"><span class="lineno">   68</span>        rands.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(p);</div>
+<div class="line"><span class="lineno">   68</span>        rands.push_back(p);</div>
 <div class="line"><span class="lineno">   69</span>    }</div>
 <div class="line"><span class="lineno">   70</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math::approximate_pi</a>(rands) &gt; 3.135);</div>
 <div class="line"><span class="lineno">   71</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math::approximate_pi</a>(rands) &lt; 3.145);</div>
 <div class="line"><span class="lineno">   72</span> </div>
-<div class="line"><span class="lineno">   73</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!&quot;</span> &lt;&lt; <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">   73</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   74</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="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="anamespacemath_html_a006c8ebd11bb1e035815dc835a1a7a85"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85">math::Point</a></div><div class="ttdeci">struct { double x; double y;} Point</div><div class="ttdoc">structure of points containing two numbers, x and y, such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1.</div><div class="ttdef"><b>Definition</b> approximate_pi.cpp:35</div></div>
-<div class="ttc" id="anamespacemath_html_abf7f2a6d91f1ca6c89698792aea3f188"><div class="ttname"><a href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math::approximate_pi</a></div><div class="ttdeci">double approximate_pi(const std::vector&lt; Point &gt; &amp;pts)</div><div class="ttdoc">This function uses the points in a given vector 'pts' (drawn at random) to return an approximation of...</div><div class="ttdef"><b>Definition</b> approximate_pi.cpp:47</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d51/approximate__pi_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="427" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemath_html_a006c8ebd11bb1e035815dc835a1a7a85"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85">math::Point</a></div><div class="ttdeci">struct { double x; double y;} Point</div><div class="ttdoc">structure of points containing two numbers, x and y, such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d51/approximate__pi_8cpp_source.html#l00035">approximate_pi.cpp:35</a></div></div>
+<div class="ttc" id="anamespacemath_html_abf7f2a6d91f1ca6c89698792aea3f188"><div class="ttname"><a href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math::approximate_pi</a></div><div class="ttdeci">double approximate_pi(const std::vector&lt; Point &gt; &amp;pts)</div><div class="ttdoc">This function uses the points in a given vector 'pts' (drawn at random) to return an approximation of...</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d51/approximate__pi_8cpp_source.html#l00047">approximate_pi.cpp:47</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d0/d51/approximate__pi_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d0/d51/approximate__pi_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index e6de5bc8b..000000000
--- a/d0/d51/approximate__pi_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,55,56,80"/>
-<area shape="rect" id="Node000002" href="$dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188" title="This function uses the points in a given vector &#39;pts&#39; (drawn at random) to return an approximation of..." alt="" coords="108,5,254,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,56,103,40,121,34,123,39,105,45,57,61"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="145,55,216,80"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,65,129,65,129,70,56,70"/>
-<area shape="rect" id="Node000005" 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="104,104,258,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="57,74,105,90,123,96,121,101,103,95,55,79"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="306,5,421,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="254,16,290,16,290,21,254,21"/>
-</map>
diff --git a/d0/d51/approximate__pi_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d0/d51/approximate__pi_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index e4c54be20..000000000
--- a/d0/d51/approximate__pi_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b5dab79a48fcf8352434c9ccc43e128f
\ No newline at end of file
diff --git a/d0/d51/approximate__pi_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d0/d51/approximate__pi_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index 5e7e131e7..000000000
--- a/d0/d51/approximate__pi_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="320pt" height="101pt"
- viewBox="0.00 0.00 320.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-56.25 0,-56.25 0,-37 37.75,-37 37.75,-56.25"/>
-<text text-anchor="middle" x="18.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188" target="_top" xlink:title="This function uses the points in a given vector &#39;pts&#39; (drawn at random) to return an approximation of...">
-<polygon fill="white" stroke="#666666" points="186.5,-93.25 76.75,-93.25 76.75,-74 186.5,-74 186.5,-93.25"/>
-<text text-anchor="middle" x="131.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::approximate_pi</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.78,-53.1C48.24,-56.85 61.71,-61.6 73.75,-65.62 78.17,-67.1 82.79,-68.62 87.41,-70.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.05,-73.35 96.64,-73.07 88.18,-66.68 86.05,-73.35"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158.38,-56.25 104.88,-56.25 104.88,-37 158.38,-37 158.38,-56.25"/>
-<text text-anchor="middle" x="131.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.16,-46.62C53.05,-46.62 74.56,-46.62 93.08,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.92,-50.13 102.92,-46.63 92.92,-43.13 92.92,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.5,-19.25 73.75,-19.25 73.75,0 189.5,0 189.5,-19.25"/>
-<text text-anchor="middle" x="131.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.78,-40.15C48.24,-36.4 61.71,-31.65 73.75,-27.62 78.17,-26.15 82.79,-24.63 87.41,-23.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.18,-26.57 96.64,-20.18 86.05,-19.9 88.18,-26.57"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312,-93.25 225.5,-93.25 225.5,-74 312,-74 312,-93.25"/>
-<text text-anchor="middle" x="268.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.81,-83.62C195.69,-83.62 204.89,-83.62 213.77,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.69,-87.13 223.69,-83.63 213.69,-80.13 213.69,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d51/approximate__pi_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d0/d51/approximate__pi_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index 1d9d70a3d..000000000
--- a/d0/d51/approximate__pi_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="320pt" height="101pt"
- viewBox="0.00 0.00 320.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-56.25 0,-56.25 0,-37 37.75,-37 37.75,-56.25"/>
-<text text-anchor="middle" x="18.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188" target="_top" xlink:title="This function uses the points in a given vector &#39;pts&#39; (drawn at random) to return an approximation of...">
-<polygon fill="white" stroke="#666666" points="186.5,-93.25 76.75,-93.25 76.75,-74 186.5,-74 186.5,-93.25"/>
-<text text-anchor="middle" x="131.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::approximate_pi</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.78,-53.1C48.24,-56.85 61.71,-61.6 73.75,-65.62 78.17,-67.1 82.79,-68.62 87.41,-70.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.05,-73.35 96.64,-73.07 88.18,-66.68 86.05,-73.35"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158.38,-56.25 104.88,-56.25 104.88,-37 158.38,-37 158.38,-56.25"/>
-<text text-anchor="middle" x="131.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.16,-46.62C53.05,-46.62 74.56,-46.62 93.08,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.92,-50.13 102.92,-46.63 92.92,-43.13 92.92,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.5,-19.25 73.75,-19.25 73.75,0 189.5,0 189.5,-19.25"/>
-<text text-anchor="middle" x="131.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.78,-40.15C48.24,-36.4 61.71,-31.65 73.75,-27.62 78.17,-26.15 82.79,-24.63 87.41,-23.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.18,-26.57 96.64,-20.18 86.05,-19.9 88.18,-26.57"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312,-93.25 225.5,-93.25 225.5,-74 312,-74 312,-93.25"/>
-<text text-anchor="middle" x="268.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.81,-83.62C195.69,-83.62 204.89,-83.62 213.77,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.69,-87.13 223.69,-83.63 213.69,-80.13 213.69,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d51/approximate__pi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d0/d51/approximate__pi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 388fbd758..000000000
--- a/d0/d51/approximate__pi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,55,55,80"/>
-<area shape="rect" id="Node000002" href="$d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,55,153,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,65,88,65,88,70,55,70"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188" title="This function uses the points in a given vector &#39;pts&#39; (drawn at random) to return an approximation of..." alt="" coords="205,5,351,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="152,56,200,40,218,34,220,39,202,45,154,61"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="242,55,314,80"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="154,65,227,65,227,70,154,70"/>
-<area shape="rect" id="Node000006" 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="201,104,355,130"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="154,74,202,90,220,96,218,101,200,95,152,79"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="403,5,519,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="352,16,388,16,388,21,352,21"/>
-</map>
diff --git a/d0/d51/approximate__pi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d0/d51/approximate__pi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 6e62b1494..000000000
--- a/d0/d51/approximate__pi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c076621c43cb27eb5c06b4723ab2b1fd
\ No newline at end of file
diff --git a/d0/d51/approximate__pi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d0/d51/approximate__pi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index c72980867..000000000
--- a/d0/d51/approximate__pi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="393pt" height="101pt"
- viewBox="0.00 0.00 393.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-56.25 73,-56.25 73,-37 110.75,-37 110.75,-56.25"/>
-<text text-anchor="middle" x="91.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-46.62C44.55,-46.62 53.37,-46.62 61.69,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-50.13 71.43,-46.63 61.43,-43.13 61.43,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188" target="_top" xlink:title="This function uses the points in a given vector &#39;pts&#39; (drawn at random) to return an approximation of...">
-<polygon fill="white" stroke="#666666" points="259.5,-93.25 149.75,-93.25 149.75,-74 259.5,-74 259.5,-93.25"/>
-<text text-anchor="middle" x="204.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::approximate_pi</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.78,-53.1C121.24,-56.85 134.71,-61.6 146.75,-65.62 151.17,-67.1 155.79,-68.62 160.41,-70.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.05,-73.35 169.64,-73.07 161.18,-66.68 159.05,-73.35"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.38,-56.25 177.88,-56.25 177.88,-37 231.38,-37 231.38,-56.25"/>
-<text text-anchor="middle" x="204.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.16,-46.62C126.05,-46.62 147.56,-46.62 166.08,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.92,-50.13 175.92,-46.63 165.92,-43.13 165.92,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.5,-19.25 146.75,-19.25 146.75,0 262.5,0 262.5,-19.25"/>
-<text text-anchor="middle" x="204.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.78,-40.15C121.24,-36.4 134.71,-31.65 146.75,-27.62 151.17,-26.15 155.79,-24.63 160.41,-23.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.18,-26.57 169.64,-20.18 159.05,-19.9 161.18,-26.57"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385,-93.25 298.5,-93.25 298.5,-74 385,-74 385,-93.25"/>
-<text text-anchor="middle" x="341.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.81,-83.62C268.69,-83.62 277.89,-83.62 286.77,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.69,-87.13 296.69,-83.63 286.69,-80.13 286.69,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d51/approximate__pi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d0/d51/approximate__pi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 532be1ab8..000000000
--- a/d0/d51/approximate__pi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="393pt" height="101pt"
- viewBox="0.00 0.00 393.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-56.25 73,-56.25 73,-37 110.75,-37 110.75,-56.25"/>
-<text text-anchor="middle" x="91.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-46.62C44.55,-46.62 53.37,-46.62 61.69,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-50.13 71.43,-46.63 61.43,-43.13 61.43,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188" target="_top" xlink:title="This function uses the points in a given vector &#39;pts&#39; (drawn at random) to return an approximation of...">
-<polygon fill="white" stroke="#666666" points="259.5,-93.25 149.75,-93.25 149.75,-74 259.5,-74 259.5,-93.25"/>
-<text text-anchor="middle" x="204.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::approximate_pi</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.78,-53.1C121.24,-56.85 134.71,-61.6 146.75,-65.62 151.17,-67.1 155.79,-68.62 160.41,-70.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.05,-73.35 169.64,-73.07 161.18,-66.68 159.05,-73.35"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.38,-56.25 177.88,-56.25 177.88,-37 231.38,-37 231.38,-56.25"/>
-<text text-anchor="middle" x="204.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.16,-46.62C126.05,-46.62 147.56,-46.62 166.08,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.92,-50.13 175.92,-46.63 165.92,-43.13 165.92,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.5,-19.25 146.75,-19.25 146.75,0 262.5,0 262.5,-19.25"/>
-<text text-anchor="middle" x="204.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.78,-40.15C121.24,-36.4 134.71,-31.65 146.75,-27.62 151.17,-26.15 155.79,-24.63 160.41,-23.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.18,-26.57 169.64,-20.18 159.05,-19.9 161.18,-26.57"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385,-93.25 298.5,-93.25 298.5,-74 385,-74 385,-93.25"/>
-<text text-anchor="middle" x="341.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.81,-83.62C268.69,-83.62 277.89,-83.62 286.77,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.69,-87.13 296.69,-83.63 286.69,-80.13 286.69,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d51/approximate__pi_8cpp_source.html b/d0/d51/approximate__pi_8cpp_source.html
new file mode 100644
index 000000000..0741ddb8a
--- /dev/null
+++ b/d0/d51/approximate__pi_8cpp_source.html
@@ -0,0 +1,193 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/approximate_pi.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d0/d51/approximate__pi_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">approximate_pi.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d0/d51/approximate__pi_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cstdlib&gt;</span>   </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="foldopen" id="foldopen00035" data-start="{" data-end="};">
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85">   35</a></span><span class="keyword">using </span><a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> = <span class="keyword">struct </span>{</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordtype">double</span> x;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordtype">double</span> y;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>};</div>
+</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="foldopen" id="foldopen00047" data-start="{" data-end="}">
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">   47</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">approximate_pi</a>(<span class="keyword">const</span> std::vector&lt;Point&gt; &amp;pts) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordtype">double</span> count = 0;  <span class="comment">// Points in circle</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">for</span> (<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> p : pts) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordflow">if</span> ((p.x * p.x) + (p.y * p.y) &lt;= 1) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>            count++;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        }</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    }</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">return</span> 4.0 * count / <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(pts.size());</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>}</div>
+</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">   62</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    std::vector&lt;math::Point&gt; rands;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="keywordflow">for</span> (std::size_t i = 0; i &lt; 100000; i++) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <a class="code hl_typedef" href="../../dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85">math::Point</a> p;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        p.x = rand() / <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(RAND_MAX);  <span class="comment">// 0 &lt;= x &lt;= 1</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        p.y = rand() / <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(RAND_MAX);  <span class="comment">// 0 &lt;= y &lt;= 1</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        rands.push_back(p);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math::approximate_pi</a>(rands) &gt; 3.135);</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math::approximate_pi</a>(rands) &lt; 3.145);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>}</div>
+</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="foldopen" id="foldopen00080" data-start="{" data-end="}">
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="../../d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   80</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <a class="code hl_function" href="../../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>}</div>
+</div>
+<div class="ttc" id="aapproximate__pi_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d0/d51/approximate__pi_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> <a href="#l00062">approximate_pi.cpp:62</a></div></div>
+<div class="ttc" id="aapproximate__pi_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00080">approximate_pi.cpp:80</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_a006c8ebd11bb1e035815dc835a1a7a85"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85">math::Point</a></div><div class="ttdeci">struct { double x; double y;} Point</div><div class="ttdoc">structure of points containing two numbers, x and y, such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1.</div><div class="ttdef"><b>Definition</b> <a href="#l00035">approximate_pi.cpp:35</a></div></div>
+<div class="ttc" id="anamespacemath_html_abf7f2a6d91f1ca6c89698792aea3f188"><div class="ttname"><a href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math::approximate_pi</a></div><div class="ttdeci">double approximate_pi(const std::vector&lt; Point &gt; &amp;pts)</div><div class="ttdoc">This function uses the points in a given vector 'pts' (drawn at random) to return an approximation of...</div><div class="ttdef"><b>Definition</b> <a href="#l00047">approximate_pi.cpp:47</a></div></div>
+<div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition</b> <a href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00012">line_segment_intersection.cpp:12</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d0/d51/approximate__pi_8cpp.html">approximate_pi.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d0/d52/namespacewiggle__sort.html b/d0/d52/namespacewiggle__sort.html
index 238ba8fa2..da7c9b7b9 100644
--- a/d0/d52/namespacewiggle__sort.html
+++ b/d0/d52/namespacewiggle__sort.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: wiggle_sort Namespace Reference</title>
+<title>TheAlgorithms/C++: wiggle_sort Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d0/d55/classcll-members.html b/d0/d55/classcll-members.html
index c4ef4946b..3dcba323c 100644
--- a/d0/d55/classcll-members.html
+++ b/d0/d55/classcll-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d0/d58/classgraph_1_1_rooted_tree.html b/d0/d58/classgraph_1_1_rooted_tree.html
index 38c2b47cc..10e9ecbac 100644
--- a/d0/d58/classgraph_1_1_rooted_tree.html
+++ b/d0/d58/classgraph_1_1_rooted_tree.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph::RootedTree Class Reference</title>
+<title>TheAlgorithms/C++: graph::RootedTree Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -125,15 +142,15 @@ Collaboration diagram for graph::RootedTree:</div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:aacdeecac857623e9fbfe92590f3c504d" id="r_aacdeecac857623e9fbfe92590f3c504d"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aacdeecac857623e9fbfe92590f3c504d">RootedTree</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &amp;undirected_edges, int root_)</td></tr>
+<tr class="memitem:aacdeecac857623e9fbfe92590f3c504d" id="r_aacdeecac857623e9fbfe92590f3c504d"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aacdeecac857623e9fbfe92590f3c504d">RootedTree</a> (const std::vector&lt; std::pair&lt; int, int &gt; &gt; &amp;undirected_edges, int root_)</td></tr>
 <tr class="memdesc:aacdeecac857623e9fbfe92590f3c504d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructs the tree by calculating parent for every vertex. Assumes a valid description of a tree is provided.  <br /></td></tr>
 <tr class="separator:aacdeecac857623e9fbfe92590f3c504d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="inherit_header pub_methods_classgraph_1_1_graph"><td colspan="2" onclick="javascript:dynsection.toggleInherit('pub_methods_classgraph_1_1_graph')"><img src="../../closed.png" alt="-"/>&#160;Public Member Functions inherited from <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td></tr>
 <tr class="memitem:a877b2cba40d8d46dde6fb4209effed19 inherit pub_methods_classgraph_1_1_graph" id="r_a877b2cba40d8d46dde6fb4209effed19"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a> (T u, T v, bool bidir=true)</td></tr>
 <tr class="separator:a877b2cba40d8d46dde6fb4209effed19 inherit pub_methods_classgraph_1_1_graph"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a3755ec9e6a842238c7f4aac10b661981 inherit pub_methods_classgraph_1_1_graph" id="r_a3755ec9e6a842238c7f4aac10b661981"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt; T, bool &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981">breadth_first_search</a> (T src)</td></tr>
+<tr class="memitem:a3755ec9e6a842238c7f4aac10b661981 inherit pub_methods_classgraph_1_1_graph" id="r_a3755ec9e6a842238c7f4aac10b661981"><td class="memItemLeft" align="right" valign="top">std::map&lt; T, bool &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981">breadth_first_search</a> (T src)</td></tr>
 <tr class="separator:a3755ec9e6a842238c7f4aac10b661981 inherit pub_methods_classgraph_1_1_graph"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8839fa14bff19d2deab4a618447c13e5 inherit pub_methods_classgraph_1_1_graph" id="r_a8839fa14bff19d2deab4a618447c13e5"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5">Graph</a> (size_t N, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &amp;undirected_edges)</td></tr>
+<tr class="memitem:a8839fa14bff19d2deab4a618447c13e5 inherit pub_methods_classgraph_1_1_graph" id="r_a8839fa14bff19d2deab4a618447c13e5"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5">Graph</a> (size_t N, const std::vector&lt; std::pair&lt; int, int &gt; &gt; &amp;undirected_edges)</td></tr>
 <tr class="memdesc:a8839fa14bff19d2deab4a618447c13e5 inherit pub_methods_classgraph_1_1_graph"><td class="mdescLeft">&#160;</td><td class="mdescRight">Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid vertex indices.  <br /></td></tr>
 <tr class="separator:a8839fa14bff19d2deab4a618447c13e5 inherit pub_methods_classgraph_1_1_graph"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a8930d1470d132b19e430d1c71f94c904 inherit pub_methods_classgraph_1_1_graph" id="r_a8930d1470d132b19e430d1c71f94c904"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a> () const</td></tr>
@@ -141,22 +158,18 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a3831583a91914988897a4cc8748fda43" id="r_a3831583a91914988897a4cc8748fda43"><td class="memItemLeft" align="right" valign="top"><a id="a3831583a91914988897a4cc8748fda43" name="a3831583a91914988897a4cc8748fda43"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>parent</b></td></tr>
-<tr class="memdesc:a3831583a91914988897a4cc8748fda43"><td class="mdescLeft">&#160;</td><td class="mdescRight">Stores parent of every vertex and for root its own index. The root is technically not its own parent, but it's very practical for the lowest common ancestor algorithm. <br /></td></tr>
+<tr class="memitem:a3831583a91914988897a4cc8748fda43" id="r_a3831583a91914988897a4cc8748fda43"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3831583a91914988897a4cc8748fda43">parent</a></td></tr>
+<tr class="memdesc:a3831583a91914988897a4cc8748fda43"><td class="mdescLeft">&#160;</td><td class="mdescRight">Stores parent of every vertex and for root its own index. The root is technically not its own parent, but it's very practical for the lowest common ancestor algorithm.  <br /></td></tr>
 <tr class="separator:a3831583a91914988897a4cc8748fda43"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2ee3ad1161ac2532da30c3e22c265ad3" id="r_a2ee3ad1161ac2532da30c3e22c265ad3"><td class="memItemLeft" align="right" valign="top"><a id="a2ee3ad1161ac2532da30c3e22c265ad3" name="a2ee3ad1161ac2532da30c3e22c265ad3"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>level</b></td></tr>
-<tr class="memdesc:a2ee3ad1161ac2532da30c3e22c265ad3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Stores the distance from the root. <br /></td></tr>
+<tr class="memitem:a2ee3ad1161ac2532da30c3e22c265ad3" id="r_a2ee3ad1161ac2532da30c3e22c265ad3"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2ee3ad1161ac2532da30c3e22c265ad3">level</a></td></tr>
+<tr class="memdesc:a2ee3ad1161ac2532da30c3e22c265ad3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Stores the distance from the root.  <br /></td></tr>
 <tr class="separator:a2ee3ad1161ac2532da30c3e22c265ad3"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ab22a97bf6209a085fc2d788c3c0dacbe" id="r_ab22a97bf6209a085fc2d788c3c0dacbe"><td class="memItemLeft" align="right" valign="top"><a id="ab22a97bf6209a085fc2d788c3c0dacbe" name="ab22a97bf6209a085fc2d788c3c0dacbe"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>root</b></td></tr>
-<tr class="memdesc:ab22a97bf6209a085fc2d788c3c0dacbe"><td class="mdescLeft">&#160;</td><td class="mdescRight">Index of the root vertex. <br /></td></tr>
+<tr class="memitem:ab22a97bf6209a085fc2d788c3c0dacbe" id="r_ab22a97bf6209a085fc2d788c3c0dacbe"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab22a97bf6209a085fc2d788c3c0dacbe">root</a></td></tr>
+<tr class="memdesc:ab22a97bf6209a085fc2d788c3c0dacbe"><td class="mdescLeft">&#160;</td><td class="mdescRight">Index of the root vertex.  <br /></td></tr>
 <tr class="separator:ab22a97bf6209a085fc2d788c3c0dacbe"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="inherit_header pub_attribs_classgraph_1_1_graph"><td colspan="2" onclick="javascript:dynsection.toggleInherit('pub_attribs_classgraph_1_1_graph')"><img src="../../closed.png" alt="-"/>&#160;Public Attributes inherited from <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td></tr>
-<tr class="memitem:a59940c462861f2fcf4951d1b6c084e6a inherit pub_attribs_classgraph_1_1_graph" id="r_a59940c462861f2fcf4951d1b6c084e6a"><td class="memItemLeft" align="right" valign="top">
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>neighbors</b></td></tr>
-<tr class="memdesc:a59940c462861f2fcf4951d1b6c084e6a inherit pub_attribs_classgraph_1_1_graph"><td class="mdescLeft">&#160;</td><td class="mdescRight">for each vertex it stores a list indicies of its neighbors <br /></td></tr>
+<tr class="memitem:a59940c462861f2fcf4951d1b6c084e6a inherit pub_attribs_classgraph_1_1_graph" id="r_a59940c462861f2fcf4951d1b6c084e6a"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a></td></tr>
+<tr class="memdesc:a59940c462861f2fcf4951d1b6c084e6a inherit pub_attribs_classgraph_1_1_graph"><td class="mdescLeft">&#160;</td><td class="mdescRight">for each vertex it stores a list indicies of its neighbors  <br /></td></tr>
 <tr class="separator:a59940c462861f2fcf4951d1b6c084e6a inherit pub_attribs_classgraph_1_1_graph"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pro-methods" name="pro-methods"></a>
@@ -167,6 +180,8 @@ Protected Member Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Representation of a rooted tree. For every vertex its parent is precalculated. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00084">84</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="aacdeecac857623e9fbfe92590f3c504d" name="aacdeecac857623e9fbfe92590f3c504d"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aacdeecac857623e9fbfe92590f3c504d">&#9670;&#160;</a></span>RootedTree()</h2>
@@ -180,7 +195,7 @@ Protected Member Functions</h2></td></tr>
         <tr>
           <td class="memname">graph::RootedTree::RootedTree </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>undirected_edges</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::pair&lt; int, int &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>undirected_edges</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -203,19 +218,15 @@ Protected Member Functions</h2></td></tr>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">   95</span>        : <a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a>(undirected_edges.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() + 1, undirected_edges), <a class="code hl_variable" href="#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>(root_) {</div>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00093">93</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   95</span>        : <a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a>(undirected_edges.size() + 1, undirected_edges), <a class="code hl_variable" href="#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>(root_) {</div>
 <div class="line"><span class="lineno">   96</span>        <a class="code hl_function" href="#ae6928f3ebd491541e9570e746b877c1e">populate_parents</a>();</div>
 <div class="line"><span class="lineno">   97</span>    }</div>
-<div class="ttc" id="aclass_graph_html"><div class="ttname"><a href="../../da/d9a/class_graph.html">Graph</a></div><div class="ttdef"><b>Definition</b> bellman_ford.cpp:14</div></div>
-<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_ab22a97bf6209a085fc2d788c3c0dacbe"><div class="ttname"><a href="#ab22a97bf6209a085fc2d788c3c0dacbe">graph::RootedTree::root</a></div><div class="ttdeci">int root</div><div class="ttdoc">Index of the root vertex.</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:108</div></div>
-<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_ae6928f3ebd491541e9570e746b877c1e"><div class="ttname"><a href="#ae6928f3ebd491541e9570e746b877c1e">graph::RootedTree::populate_parents</a></div><div class="ttdeci">void populate_parents()</div><div class="ttdoc">Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm...</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:117</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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d0/d58/classgraph_1_1_rooted_tree_aacdeecac857623e9fbfe92590f3c504d_cgraph.svg" width="100%" height="487"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclass_graph_html"><div class="ttname"><a href="../../da/d9a/class_graph.html">Graph</a></div><div class="ttdef"><b>Definition</b> <a href="../../df/d14/bellman__ford_8cpp_source.html#l00014">bellman_ford.cpp:14</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_ab22a97bf6209a085fc2d788c3c0dacbe"><div class="ttname"><a href="#ab22a97bf6209a085fc2d788c3c0dacbe">graph::RootedTree::root</a></div><div class="ttdeci">int root</div><div class="ttdoc">Index of the root vertex.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00108">lowest_common_ancestor.cpp:108</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_ae6928f3ebd491541e9570e746b877c1e"><div class="ttname"><a href="#ae6928f3ebd491541e9570e746b877c1e">graph::RootedTree::populate_parents</a></div><div class="ttdeci">void populate_parents()</div><div class="ttdoc">Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm...</div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00117">lowest_common_ancestor.cpp:117</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Function Documentation</h2>
@@ -244,48 +255,94 @@ Here is the call graph for this function:</div>
 
 <p>Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm starting from the root vertex searching the entire tree and labeling parents for all vertices. </p>
 <dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00117">117</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  117</span>                            {</div>
 <div class="line"><span class="lineno">  118</span>        <span class="comment">// Initialize the vector with -1 which indicates the vertex</span></div>
 <div class="line"><span class="lineno">  119</span>        <span class="comment">// wasn&#39;t yet visited.</span></div>
-<div class="line"><span class="lineno">  120</span>        <a class="code hl_variable" href="#a3831583a91914988897a4cc8748fda43">parent</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>(), -1);</div>
-<div class="line"><span class="lineno">  121</span>        <a class="code hl_variable" href="#a2ee3ad1161ac2532da30c3e22c265ad3">level</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>());</div>
+<div class="line"><span class="lineno">  120</span>        <a class="code hl_variable" href="#a3831583a91914988897a4cc8748fda43">parent</a> = std::vector&lt;int&gt;(<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>(), -1);</div>
+<div class="line"><span class="lineno">  121</span>        <a class="code hl_variable" href="#a2ee3ad1161ac2532da30c3e22c265ad3">level</a> = std::vector&lt;int&gt;(<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>());</div>
 <div class="line"><span class="lineno">  122</span>        <a class="code hl_variable" href="#a3831583a91914988897a4cc8748fda43">parent</a>[<a class="code hl_variable" href="#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>] = <a class="code hl_variable" href="#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>;</div>
 <div class="line"><span class="lineno">  123</span>        <a class="code hl_variable" href="#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[<a class="code hl_variable" href="#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>] = 0;</div>
-<div class="line"><span class="lineno">  124</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue&lt;int&gt;</a> queue_of_vertices;</div>
-<div class="line"><span class="lineno">  125</span>        queue_of_vertices.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(<a class="code hl_variable" href="#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>);</div>
-<div class="line"><span class="lineno">  126</span>        <span class="keywordflow">while</span> (!queue_of_vertices.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/empty.html">empty</a>()) {</div>
-<div class="line"><span class="lineno">  127</span>            <span class="keywordtype">int</span> vertex = queue_of_vertices.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/front.html">front</a>();</div>
-<div class="line"><span class="lineno">  128</span>            queue_of_vertices.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/pop.html">pop</a>();</div>
+<div class="line"><span class="lineno">  124</span>        std::queue&lt;int&gt; queue_of_vertices;</div>
+<div class="line"><span class="lineno">  125</span>        queue_of_vertices.push(<a class="code hl_variable" href="#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>);</div>
+<div class="line"><span class="lineno">  126</span>        <span class="keywordflow">while</span> (!queue_of_vertices.empty()) {</div>
+<div class="line"><span class="lineno">  127</span>            <span class="keywordtype">int</span> vertex = queue_of_vertices.front();</div>
+<div class="line"><span class="lineno">  128</span>            queue_of_vertices.pop();</div>
 <div class="line"><span class="lineno">  129</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> neighbor : <a class="code hl_variable" href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>[vertex]) {</div>
 <div class="line"><span class="lineno">  130</span>                <span class="comment">// As long as the vertex was not yet visited.</span></div>
 <div class="line"><span class="lineno">  131</span>                <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a3831583a91914988897a4cc8748fda43">parent</a>[neighbor] == -1) {</div>
 <div class="line"><span class="lineno">  132</span>                    <a class="code hl_variable" href="#a3831583a91914988897a4cc8748fda43">parent</a>[neighbor] = vertex;</div>
 <div class="line"><span class="lineno">  133</span>                    <a class="code hl_variable" href="#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[neighbor] = <a class="code hl_variable" href="#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[vertex] + 1;</div>
-<div class="line"><span class="lineno">  134</span>                    queue_of_vertices.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(neighbor);</div>
+<div class="line"><span class="lineno">  134</span>                    queue_of_vertices.push(neighbor);</div>
 <div class="line"><span class="lineno">  135</span>                }</div>
 <div class="line"><span class="lineno">  136</span>            }</div>
 <div class="line"><span class="lineno">  137</span>        }</div>
 <div class="line"><span class="lineno">  138</span>    }</div>
-<div class="ttc" id="aclassgraph_1_1_graph_html_a59940c462861f2fcf4951d1b6c084e6a"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">graph::Graph::neighbors</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; neighbors</div><div class="ttdoc">for each vertex it stores a list indicies of its neighbors</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:77</div></div>
-<div class="ttc" id="aclassgraph_1_1_graph_html_a8930d1470d132b19e430d1c71f94c904"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">graph::Graph::number_of_vertices</a></div><div class="ttdeci">int number_of_vertices() const</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:74</div></div>
-<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a2ee3ad1161ac2532da30c3e22c265ad3"><div class="ttname"><a href="#a2ee3ad1161ac2532da30c3e22c265ad3">graph::RootedTree::level</a></div><div class="ttdeci">std::vector&lt; int &gt; level</div><div class="ttdoc">Stores the distance from the root.</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:106</div></div>
-<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a3831583a91914988897a4cc8748fda43"><div class="ttname"><a href="#a3831583a91914988897a4cc8748fda43">graph::RootedTree::parent</a></div><div class="ttdeci">std::vector&lt; int &gt; parent</div><div class="ttdoc">Stores parent of every vertex and for root its own index. The root is technically not its own parent,...</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:104</div></div>
-<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/empty.html">std::queue::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
-<div class="ttc" id="afront_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/front.html">std::queue::front</a></div><div class="ttdeci">T front(T... args)</div></div>
-<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/pop.html">std::queue::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
-<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/push.html">std::queue::push</a></div><div class="ttdeci">T push(T... args)</div></div>
-<div class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph.svg" width="507" height="250"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="ttc" id="aclassgraph_1_1_graph_html_a59940c462861f2fcf4951d1b6c084e6a"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">graph::Graph::neighbors</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; neighbors</div><div class="ttdoc">for each vertex it stores a list indicies of its neighbors</div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00077">lowest_common_ancestor.cpp:77</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_graph_html_a8930d1470d132b19e430d1c71f94c904"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">graph::Graph::number_of_vertices</a></div><div class="ttdeci">int number_of_vertices() const</div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00074">lowest_common_ancestor.cpp:74</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a2ee3ad1161ac2532da30c3e22c265ad3"><div class="ttname"><a href="#a2ee3ad1161ac2532da30c3e22c265ad3">graph::RootedTree::level</a></div><div class="ttdeci">std::vector&lt; int &gt; level</div><div class="ttdoc">Stores the distance from the root.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00106">lowest_common_ancestor.cpp:106</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a3831583a91914988897a4cc8748fda43"><div class="ttname"><a href="#a3831583a91914988897a4cc8748fda43">graph::RootedTree::parent</a></div><div class="ttdeci">std::vector&lt; int &gt; parent</div><div class="ttdoc">Stores parent of every vertex and for root its own index. The root is technically not its own parent,...</div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00104">lowest_common_ancestor.cpp:104</a></div></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a2ee3ad1161ac2532da30c3e22c265ad3" name="a2ee3ad1161ac2532da30c3e22c265ad3"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a2ee3ad1161ac2532da30c3e22c265ad3">&#9670;&#160;</a></span>level</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;int&gt; graph::RootedTree::level</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Stores the distance from the root. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00106">106</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a3831583a91914988897a4cc8748fda43" name="a3831583a91914988897a4cc8748fda43"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a3831583a91914988897a4cc8748fda43">&#9670;&#160;</a></span>parent</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;int&gt; graph::RootedTree::parent</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Stores parent of every vertex and for root its own index. The root is technically not its own parent, but it's very practical for the lowest common ancestor algorithm. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00104">104</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ab22a97bf6209a085fc2d788c3c0dacbe" name="ab22a97bf6209a085fc2d788c3c0dacbe"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ab22a97bf6209a085fc2d788c3c0dacbe">&#9670;&#160;</a></span>root</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int graph::RootedTree::root</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Index of the root vertex. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00108">108</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>graph/<a class="el" href="../../de/dde/lowest__common__ancestor_8cpp.html">lowest_common_ancestor.cpp</a></li>
+<li>graph/<a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d0/d58/classgraph_1_1_rooted_tree_aacdeecac857623e9fbfe92590f3c504d_cgraph.map b/d0/d58/classgraph_1_1_rooted_tree_aacdeecac857623e9fbfe92590f3c504d_cgraph.map
deleted file mode 100644
index b456377b8..000000000
--- a/d0/d58/classgraph_1_1_rooted_tree_aacdeecac857623e9fbfe92590f3c504d_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="graph::RootedTree::RootedTree" name="graph::RootedTree::RootedTree">
-<area shape="rect" id="Node000001" title="Constructs the tree by calculating parent for every vertex. Assumes a valid description of a tree is ..." alt="" coords="5,104,143,145"/>
-<area shape="rect" id="Node000002" href="$d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e" title="Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm..." alt="" coords="191,104,328,145"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="143,122,175,122,175,128,143,128"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/empty.html#" title=" " alt="" coords="386,5,513,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="283,102,325,71,375,40,385,35,388,40,377,45,328,75,287,106"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/front.html#" title=" " alt="" coords="392,55,508,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="328,102,389,83,391,88,329,107"/>
-<area shape="rect" id="Node000005" href="$dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904" title=" " alt="" coords="376,104,523,145"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="328,122,361,122,361,128,328,128"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/pop.html#" title=" " alt="" coords="394,169,505,195"/>
-<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="329,143,391,162,389,167,328,148"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/push.html#" title=" " alt="" coords="390,219,509,244"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="287,143,328,175,377,205,388,210,385,215,375,210,325,179,283,148"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="571,112,687,138"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="524,122,556,122,556,128,524,128"/>
-</map>
diff --git a/d0/d58/classgraph_1_1_rooted_tree_aacdeecac857623e9fbfe92590f3c504d_cgraph.md5 b/d0/d58/classgraph_1_1_rooted_tree_aacdeecac857623e9fbfe92590f3c504d_cgraph.md5
deleted file mode 100644
index def371102..000000000
--- a/d0/d58/classgraph_1_1_rooted_tree_aacdeecac857623e9fbfe92590f3c504d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-64b975f46b6c19040666ca00b5eb9862
\ No newline at end of file
diff --git a/d0/d58/classgraph_1_1_rooted_tree_aacdeecac857623e9fbfe92590f3c504d_cgraph.svg b/d0/d58/classgraph_1_1_rooted_tree_aacdeecac857623e9fbfe92590f3c504d_cgraph.svg
deleted file mode 100644
index 45044e8e3..000000000
--- a/d0/d58/classgraph_1_1_rooted_tree_aacdeecac857623e9fbfe92590f3c504d_cgraph.svg
+++ /dev/null
@@ -1,233 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::RootedTree::RootedTree Pages: 1 -->
-<!--zoomable 187 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 519;
-var viewHeight = 187;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>graph::RootedTree::RootedTree</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Constructs the tree by calculating parent for every vertex. Assumes a valid description of a tree is ...">
-<polygon fill="#999999" stroke="#666666" points="103,-104.88 0,-104.88 0,-74.38 103,-74.38 103,-104.88"/>
-<text text-anchor="start" x="8" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::RootedTree::</text>
-<text text-anchor="middle" x="51.5" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">RootedTree</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e" target="_top" xlink:title="Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm...">
-<polygon fill="white" stroke="#666666" points="242,-104.88 139,-104.88 139,-74.38 242,-74.38 242,-104.88"/>
-<text text-anchor="start" x="147" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::RootedTree::</text>
-<text text-anchor="middle" x="190.5" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">populate_parents</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-89.62C111,-89.62 119.21,-89.62 127.31,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.11,-93.13 137.11,-89.63 127.11,-86.13 127.11,-93.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="380.62,-179.25 285.88,-179.25 285.88,-160 380.62,-160 380.62,-179.25"/>
-<text text-anchor="middle" x="333.25" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.68,-105.16C226.49,-118.9 252.65,-138.71 278,-151.62 280.55,-152.93 283.22,-154.16 285.94,-155.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.61,-158.57 295.19,-158.96 287.16,-152.05 284.61,-158.57"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="376.88,-142.25 289.62,-142.25 289.62,-123 376.88,-123 376.88,-142.25"/>
-<text text-anchor="middle" x="333.25" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.31,-105.15C257.5,-109.79 274,-114.83 288.68,-119.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.46,-122.6 298.05,-122.18 289.51,-115.91 287.46,-122.6"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="388.5,-104.88 278,-104.88 278,-74.38 388.5,-74.38 388.5,-104.88"/>
-<text text-anchor="start" x="286" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::number</text>
-<text text-anchor="middle" x="333.25" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_of_vertices</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.31,-89.62C250.13,-89.62 258.29,-89.62 266.38,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.19,-93.13 276.19,-89.63 266.19,-86.13 266.19,-93.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="375,-56.25 291.5,-56.25 291.5,-37 375,-37 375,-56.25"/>
-<text text-anchor="middle" x="333.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.31,-74.1C257.5,-69.46 274,-64.42 288.68,-59.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.51,-63.34 298.05,-57.07 287.46,-56.65 289.51,-63.34"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="377.62,-19.25 288.88,-19.25 288.88,0 377.62,0 377.62,-19.25"/>
-<text text-anchor="middle" x="333.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.68,-74.09C226.49,-60.35 252.65,-40.54 278,-27.62 280.55,-26.32 283.22,-25.09 285.94,-23.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.16,-27.2 295.19,-20.29 284.61,-20.68 287.16,-27.2"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="511,-99.25 424.5,-99.25 424.5,-80 511,-80 511,-99.25"/>
-<text text-anchor="middle" x="467.75" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M388.91,-89.62C396.86,-89.62 405.04,-89.62 412.97,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="412.85,-93.13 422.85,-89.63 412.85,-86.13 412.85,-93.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classgraph_1_1_rooted_tree_aacdeecac857623e9fbfe92590f3c504d_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d58/classgraph_1_1_rooted_tree_aacdeecac857623e9fbfe92590f3c504d_cgraph_org.svg b/d0/d58/classgraph_1_1_rooted_tree_aacdeecac857623e9fbfe92590f3c504d_cgraph_org.svg
deleted file mode 100644
index 2ba1fc3c4..000000000
--- a/d0/d58/classgraph_1_1_rooted_tree_aacdeecac857623e9fbfe92590f3c504d_cgraph_org.svg
+++ /dev/null
@@ -1,150 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::RootedTree::RootedTree Pages: 1 -->
-<svg width="519pt" height="187pt"
- viewBox="0.00 0.00 519.00 187.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 183.25)">
-<title>graph::RootedTree::RootedTree</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Constructs the tree by calculating parent for every vertex. Assumes a valid description of a tree is ...">
-<polygon fill="#999999" stroke="#666666" points="103,-104.88 0,-104.88 0,-74.38 103,-74.38 103,-104.88"/>
-<text text-anchor="start" x="8" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::RootedTree::</text>
-<text text-anchor="middle" x="51.5" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">RootedTree</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e" target="_top" xlink:title="Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm...">
-<polygon fill="white" stroke="#666666" points="242,-104.88 139,-104.88 139,-74.38 242,-74.38 242,-104.88"/>
-<text text-anchor="start" x="147" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::RootedTree::</text>
-<text text-anchor="middle" x="190.5" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">populate_parents</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-89.62C111,-89.62 119.21,-89.62 127.31,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.11,-93.13 137.11,-89.63 127.11,-86.13 127.11,-93.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="380.62,-179.25 285.88,-179.25 285.88,-160 380.62,-160 380.62,-179.25"/>
-<text text-anchor="middle" x="333.25" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.68,-105.16C226.49,-118.9 252.65,-138.71 278,-151.62 280.55,-152.93 283.22,-154.16 285.94,-155.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.61,-158.57 295.19,-158.96 287.16,-152.05 284.61,-158.57"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="376.88,-142.25 289.62,-142.25 289.62,-123 376.88,-123 376.88,-142.25"/>
-<text text-anchor="middle" x="333.25" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.31,-105.15C257.5,-109.79 274,-114.83 288.68,-119.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.46,-122.6 298.05,-122.18 289.51,-115.91 287.46,-122.6"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="388.5,-104.88 278,-104.88 278,-74.38 388.5,-74.38 388.5,-104.88"/>
-<text text-anchor="start" x="286" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::number</text>
-<text text-anchor="middle" x="333.25" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_of_vertices</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.31,-89.62C250.13,-89.62 258.29,-89.62 266.38,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.19,-93.13 276.19,-89.63 266.19,-86.13 266.19,-93.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="375,-56.25 291.5,-56.25 291.5,-37 375,-37 375,-56.25"/>
-<text text-anchor="middle" x="333.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.31,-74.1C257.5,-69.46 274,-64.42 288.68,-59.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.51,-63.34 298.05,-57.07 287.46,-56.65 289.51,-63.34"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="377.62,-19.25 288.88,-19.25 288.88,0 377.62,0 377.62,-19.25"/>
-<text text-anchor="middle" x="333.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.68,-74.09C226.49,-60.35 252.65,-40.54 278,-27.62 280.55,-26.32 283.22,-25.09 285.94,-23.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.16,-27.2 295.19,-20.29 284.61,-20.68 287.16,-27.2"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="511,-99.25 424.5,-99.25 424.5,-80 511,-80 511,-99.25"/>
-<text text-anchor="middle" x="467.75" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M388.91,-89.62C396.86,-89.62 405.04,-89.62 412.97,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="412.85,-93.13 422.85,-89.63 412.85,-86.13 412.85,-93.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph.map b/d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph.map
deleted file mode 100644
index 4ed63001c..000000000
--- a/d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="graph::RootedTree::populate_parents" name="graph::RootedTree::populate_parents">
-<area shape="rect" id="Node000001" title="Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm..." alt="" coords="5,104,143,145"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/empty.html#" title=" " alt="" coords="201,5,328,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="98,102,139,71,189,40,200,35,202,40,192,45,142,75,101,106"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/front.html#" title=" " alt="" coords="206,55,322,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="142,102,204,83,206,88,144,107"/>
-<area shape="rect" id="Node000004" href="$dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904" title=" " alt="" coords="191,104,338,145"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="143,122,175,122,175,128,143,128"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/pop.html#" title=" " alt="" coords="209,169,320,195"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="144,143,206,162,204,167,142,148"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/push.html#" title=" " alt="" coords="205,219,324,244"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="101,143,142,175,192,205,202,210,200,215,189,210,139,179,98,148"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="386,112,501,138"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="339,122,371,122,371,128,339,128"/>
-</map>
diff --git a/d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph.md5 b/d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph.md5
deleted file mode 100644
index b6e48eac3..000000000
--- a/d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ab03c451aeab03b3c2a8941db5979584
\ No newline at end of file
diff --git a/d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph.svg b/d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph.svg
deleted file mode 100644
index d240a204b..000000000
--- a/d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph.svg
+++ /dev/null
@@ -1,157 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::RootedTree::populate_parents Pages: 1 -->
-<svg width="380pt" height="187pt"
- viewBox="0.00 0.00 380.00 187.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 183.25)">
-<title>graph::RootedTree::populate_parents</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm...">
-<polygon fill="#999999" stroke="#666666" points="103,-104.88 0,-104.88 0,-74.38 103,-74.38 103,-104.88"/>
-<text text-anchor="start" x="8" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::RootedTree::</text>
-<text text-anchor="middle" x="51.5" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">populate_parents</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="241.62,-179.25 146.88,-179.25 146.88,-160 241.62,-160 241.62,-179.25"/>
-<text text-anchor="middle" x="194.25" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.68,-105.16C87.49,-118.9 113.65,-138.71 139,-151.62 141.55,-152.93 144.22,-154.16 146.94,-155.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.61,-158.57 156.19,-158.96 148.16,-152.05 145.61,-158.57"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.88,-142.25 150.62,-142.25 150.62,-123 237.88,-123 237.88,-142.25"/>
-<text text-anchor="middle" x="194.25" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.31,-105.15C118.5,-109.79 135,-114.83 149.68,-119.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.46,-122.6 159.05,-122.18 150.51,-115.91 148.46,-122.6"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-104.88 139,-104.88 139,-74.38 249.5,-74.38 249.5,-104.88"/>
-<text text-anchor="start" x="147" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::number</text>
-<text text-anchor="middle" x="194.25" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_of_vertices</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.31,-89.62C111.13,-89.62 119.29,-89.62 127.38,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.19,-93.13 137.19,-89.63 127.19,-86.13 127.19,-93.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236,-56.25 152.5,-56.25 152.5,-37 236,-37 236,-56.25"/>
-<text text-anchor="middle" x="194.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.31,-74.1C118.5,-69.46 135,-64.42 149.68,-59.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.51,-63.34 159.05,-57.07 148.46,-56.65 150.51,-63.34"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.62,-19.25 149.88,-19.25 149.88,0 238.62,0 238.62,-19.25"/>
-<text text-anchor="middle" x="194.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.68,-74.09C87.49,-60.35 113.65,-40.54 139,-27.62 141.55,-26.32 144.22,-25.09 146.94,-23.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.16,-27.2 156.19,-20.29 145.61,-20.68 148.16,-27.2"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="372,-99.25 285.5,-99.25 285.5,-80 372,-80 372,-99.25"/>
-<text text-anchor="middle" x="328.75" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.91,-89.62C257.86,-89.62 266.04,-89.62 273.97,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.85,-93.13 283.85,-89.63 273.85,-86.13 273.85,-93.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph_org.svg b/d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph_org.svg
deleted file mode 100644
index 0b7a473be..000000000
--- a/d0/d58/classgraph_1_1_rooted_tree_ae6928f3ebd491541e9570e746b877c1e_cgraph_org.svg
+++ /dev/null
@@ -1,131 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::RootedTree::populate_parents Pages: 1 -->
-<svg width="380pt" height="187pt"
- viewBox="0.00 0.00 380.00 187.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 183.25)">
-<title>graph::RootedTree::populate_parents</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm...">
-<polygon fill="#999999" stroke="#666666" points="103,-104.88 0,-104.88 0,-74.38 103,-74.38 103,-104.88"/>
-<text text-anchor="start" x="8" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::RootedTree::</text>
-<text text-anchor="middle" x="51.5" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">populate_parents</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="241.62,-179.25 146.88,-179.25 146.88,-160 241.62,-160 241.62,-179.25"/>
-<text text-anchor="middle" x="194.25" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.68,-105.16C87.49,-118.9 113.65,-138.71 139,-151.62 141.55,-152.93 144.22,-154.16 146.94,-155.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.61,-158.57 156.19,-158.96 148.16,-152.05 145.61,-158.57"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.88,-142.25 150.62,-142.25 150.62,-123 237.88,-123 237.88,-142.25"/>
-<text text-anchor="middle" x="194.25" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.31,-105.15C118.5,-109.79 135,-114.83 149.68,-119.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.46,-122.6 159.05,-122.18 150.51,-115.91 148.46,-122.6"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-104.88 139,-104.88 139,-74.38 249.5,-74.38 249.5,-104.88"/>
-<text text-anchor="start" x="147" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::number</text>
-<text text-anchor="middle" x="194.25" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_of_vertices</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.31,-89.62C111.13,-89.62 119.29,-89.62 127.38,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.19,-93.13 137.19,-89.63 127.19,-86.13 127.19,-93.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236,-56.25 152.5,-56.25 152.5,-37 236,-37 236,-56.25"/>
-<text text-anchor="middle" x="194.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.31,-74.1C118.5,-69.46 135,-64.42 149.68,-59.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.51,-63.34 159.05,-57.07 148.46,-56.65 150.51,-63.34"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.62,-19.25 149.88,-19.25 149.88,0 238.62,0 238.62,-19.25"/>
-<text text-anchor="middle" x="194.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.68,-74.09C87.49,-60.35 113.65,-40.54 139,-27.62 141.55,-26.32 144.22,-25.09 146.94,-23.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.16,-27.2 156.19,-20.29 145.61,-20.68 148.16,-27.2"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="372,-99.25 285.5,-99.25 285.5,-80 372,-80 372,-99.25"/>
-<text text-anchor="middle" x="328.75" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.91,-89.62C257.86,-89.62 266.04,-89.62 273.97,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.85,-93.13 283.85,-89.63 273.85,-86.13 273.85,-93.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d5a/skip__list_8cpp.html b/d0/d5a/skip__list_8cpp.html
index d31800209..594949ac4 100644
--- a/d0/d5a/skip__list_8cpp.html
+++ b/d0/d5a/skip__list_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/skip_list.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/skip_list.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -126,7 +143,9 @@ Include dependency graph for skip_list.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d75/skip__list_8cpp__incl.svg" width="492" height="126"><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">
+</div>
+<p><a href="../../d0/d5a/skip__list_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d49/structdata__structures_1_1_node.html">data_structures::Node</a></td></tr>
@@ -147,13 +166,11 @@ Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:ac0d7e0be24da9f41bcb19745873c436a" id="r_ac0d7e0be24da9f41bcb19745873c436a"><td class="memItemLeft" align="right" valign="top"><a id="ac0d7e0be24da9f41bcb19745873c436a" name="ac0d7e0be24da9f41bcb19745873c436a"></a>
-constexpr int&#160;</td><td class="memItemRight" valign="bottom"><b>data_structures::MAX_LEVEL</b> = 2</td></tr>
-<tr class="memdesc:ac0d7e0be24da9f41bcb19745873c436a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Maximum level of skip list. <br /></td></tr>
+<tr class="memitem:ac0d7e0be24da9f41bcb19745873c436a" id="r_ac0d7e0be24da9f41bcb19745873c436a"><td class="memItemLeft" align="right" valign="top">constexpr int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">data_structures::MAX_LEVEL</a> = 2</td></tr>
+<tr class="memdesc:ac0d7e0be24da9f41bcb19745873c436a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Maximum level of skip list.  <br /></td></tr>
 <tr class="separator:ac0d7e0be24da9f41bcb19745873c436a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a903639d8e6f955dd8d5c263781455d61" id="r_a903639d8e6f955dd8d5c263781455d61"><td class="memItemLeft" align="right" valign="top"><a id="a903639d8e6f955dd8d5c263781455d61" name="a903639d8e6f955dd8d5c263781455d61"></a>
-constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>data_structures::PROBABILITY</b> = 0.5</td></tr>
-<tr class="memdesc:a903639d8e6f955dd8d5c263781455d61"><td class="mdescLeft">&#160;</td><td class="mdescRight">Current probability for "coin toss". <br /></td></tr>
+<tr class="memitem:a903639d8e6f955dd8d5c263781455d61" id="r_a903639d8e6f955dd8d5c263781455d61"><td class="memItemLeft" align="right" valign="top">constexpr float&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61">data_structures::PROBABILITY</a> = 0.5</td></tr>
+<tr class="memdesc:a903639d8e6f955dd8d5c263781455d61"><td class="mdescLeft">&#160;</td><td class="mdescRight">Current probability for "coin toss".  <br /></td></tr>
 <tr class="separator:a903639d8e6f955dd8d5c263781455d61"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -162,6 +179,8 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>data_struc
 <p>References used: <a href="https://www.geeksforgeeks.org/skip-list/" target="_blank">GeeksForGeek</a>, <a href="https://iq.opengenus.org/skip-list" target="_blank">OpenGenus</a> for PseudoCode and Code </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/enqidu" target="_blank">enqidu</a> </dd>
 <dd>
 <a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -178,13 +197,15 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>data_struc
       </table>
 </div><div class="memdoc">
 <p>Main function: Creates and inserts random 2^[number of levels] elements into the skip lists and than displays it </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html#l00212">212</a> of file <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  212</span>           {</div>
-<div class="line"><span class="lineno">  213</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>));</div>
+<div class="line"><span class="lineno">  213</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
 <div class="line"><span class="lineno">  214</span> </div>
 <div class="line"><span class="lineno">  215</span>    <a class="code hl_class" href="../../d4/d90/classdata__structures_1_1_skip_list.html">data_structures::SkipList</a> lst;</div>
 <div class="line"><span class="lineno">  216</span> </div>
 <div class="line"><span class="lineno">  217</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; (1 &lt;&lt; (<a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">data_structures::MAX_LEVEL</a> + 1)); j++) {</div>
-<div class="line"><span class="lineno">  218</span>        <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % (1 &lt;&lt; (<a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">data_structures::MAX_LEVEL</a> + 2)) + 1);</div>
+<div class="line"><span class="lineno">  218</span>        <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = (std::rand() % (1 &lt;&lt; (<a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">data_structures::MAX_LEVEL</a> + 2)) + 1);</div>
 <div class="line"><span class="lineno">  219</span>        lst.<a class="code hl_function" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9">insertElement</a>(k, &amp;j);</div>
 <div class="line"><span class="lineno">  220</span>    }</div>
 <div class="line"><span class="lineno">  221</span> </div>
@@ -192,20 +213,12 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>data_struc
 <div class="line"><span class="lineno">  223</span> </div>
 <div class="line"><span class="lineno">  224</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  225</span>}</div>
-<div class="ttc" id="aclassdata__structures_1_1_skip_list_html"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html">data_structures::SkipList</a></div><div class="ttdef"><b>Definition</b> skip_list.cpp:55</div></div>
-<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a40a4042bdf0b6683b5f21ae7854de8a9"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9">data_structures::SkipList::insertElement</a></div><div class="ttdeci">void insertElement(int key, void *value)</div><div class="ttdef"><b>Definition</b> skip_list.cpp:90</div></div>
-<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a812611f80b8079268dbb19cc4e9bee5c"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c">data_structures::SkipList::displayList</a></div><div class="ttdeci">void displayList()</div><div class="ttdef"><b>Definition</b> skip_list.cpp:191</div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-<div class="ttc" id="anamespacedata__structures_html_ac0d7e0be24da9f41bcb19745873c436a"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">data_structures::MAX_LEVEL</a></div><div class="ttdeci">constexpr int MAX_LEVEL</div><div class="ttdoc">Maximum level of skip list.</div><div class="ttdef"><b>Definition</b> skip_list.cpp:27</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="610" height="424"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1_skip_list_html"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html">data_structures::SkipList</a></div><div class="ttdef"><b>Definition</b> <a href="../../d0/d5a/skip__list_8cpp_source.html#l00055">skip_list.cpp:55</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a40a4042bdf0b6683b5f21ae7854de8a9"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9">data_structures::SkipList::insertElement</a></div><div class="ttdeci">void insertElement(int key, void *value)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d5a/skip__list_8cpp_source.html#l00090">skip_list.cpp:90</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a812611f80b8079268dbb19cc4e9bee5c"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c">data_structures::SkipList::displayList</a></div><div class="ttdeci">void displayList()</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d5a/skip__list_8cpp_source.html#l00191">skip_list.cpp:191</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html_ac0d7e0be24da9f41bcb19745873c436a"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">data_structures::MAX_LEVEL</a></div><div class="ttdeci">constexpr int MAX_LEVEL</div><div class="ttdoc">Maximum level of skip list.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d5a/skip__list_8cpp_source.html#l00027">skip_list.cpp:27</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 01539e224..000000000
--- a/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,26 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,293,55,319"/>
-<area shape="rect" id="Node000002" href="$d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c" title=" " alt="" coords="103,20,269,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="32,292,54,215,74,166,100,118,121,92,144,70,147,74,125,96,105,121,79,168,59,217,37,294"/>
-<area shape="rect" id="Node000004" href="$d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9" title=" " alt="" coords="103,131,269,172"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="42,291,151,181,155,185,46,295"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="531,228,604,254"/>
-<area shape="poly" id="edge11_Node000001_Node000008" title=" " alt="" coords="55,305,128,309,235,309,358,300,421,291,483,278,530,259,532,264,484,283,422,297,359,306,235,314,128,314,55,311"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="146,344,226,370"/>
-<area shape="poly" id="edge12_Node000001_Node000010" title=" " alt="" coords="56,312,132,337,131,342,54,317"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="150,393,222,419"/>
-<area shape="poly" id="edge13_Node000001_Node000011" title=" " alt="" coords="42,318,68,349,104,380,136,394,134,399,101,384,64,353,38,321"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="364,5,436,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="269,29,348,21,349,26,270,35"/>
-<area shape="poly" id="edge4_Node000004_Node000003" title=" " alt="" coords="205,129,252,84,283,60,316,40,348,27,350,32,318,45,286,65,256,88,208,133"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/fill.html#" title=" " alt="" coords="352,55,449,80"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="227,128,316,89,336,82,337,87,318,94,229,133"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="338,104,463,130"/>
-<area shape="poly" id="edge6_Node000004_Node000006" title=" " alt="" coords="269,135,322,127,323,132,270,141"/>
-<area shape="rect" id="Node000007" href="$d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4" title=" " alt="" coords="317,154,483,194"/>
-<area shape="poly" id="edge7_Node000004_Node000007" title=" " alt="" coords="270,158,302,161,301,166,269,163"/>
-<area shape="rect" id="Node000009" href="$d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0" title="Updates a range of the segment tree." alt="" coords="370,243,430,268"/>
-<area shape="poly" id="edge9_Node000004_Node000009" title=" " alt="" coords="231,170,359,233,356,238,228,175"/>
-<area shape="poly" id="edge8_Node000007_Node000008" title=" " alt="" coords="457,193,484,204,522,219,520,224,482,209,455,198"/>
-<area shape="poly" id="edge10_Node000009_Node000009" title=" " alt="" coords="372,244,366,234,370,224,381,218,400,216,421,219,431,225,428,230,419,224,400,221,383,223,374,228,372,233,376,241"/>
-</map>
diff --git a/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 1e392ba28..000000000
--- a/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-149d96a2f678abfb27247c436834ddfb
\ No newline at end of file
diff --git a/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 77db5b1a6..000000000
--- a/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,257 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="457pt" height="318pt"
- viewBox="0.00 0.00 456.75 318.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 314.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-94.25 0,-94.25 0,-75 37,-75 37,-94.25"/>
-<text text-anchor="middle" x="18.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.75,-298.88 73,-298.88 73,-268.38 197.75,-268.38 197.75,-298.88"/>
-<text text-anchor="start" x="81" y="-285.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="135.38" y="-274.12" font-family="Helvetica,sans-Serif" font-size="10.00">::displayList</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.68,-94.48C27.28,-118.36 43.83,-180.59 73,-224.62 81.76,-237.85 93.96,-250.35 105.18,-260.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.88,-263.06 112.73,-266.94 107.45,-257.76 102.88,-263.06"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.75,-215.88 73,-215.88 73,-185.38 197.75,-185.38 197.75,-215.88"/>
-<text text-anchor="start" x="81" y="-202.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="135.38" y="-191.12" font-family="Helvetica,sans-Serif" font-size="10.00">::insertElement</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.29,-94.52C47.23,-112.63 85.82,-151.6 110.91,-176.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.26,-179.23 117.79,-183.88 113.24,-174.31 108.26,-179.23"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="448.75,-143.25 394.5,-143.25 394.5,-124 448.75,-124 448.75,-143.25"/>
-<text text-anchor="middle" x="421.62" y="-129.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge11_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge11_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.16,-83.22C88.03,-79.67 238.94,-72.72 358.5,-103.62 370.85,-106.82 383.68,-112.55 394.45,-118.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="392.65,-121.16 403.11,-122.88 396.01,-115.01 392.65,-121.16"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.12,-56.25 105.62,-56.25 105.62,-37 165.12,-37 165.12,-56.25"/>
-<text text-anchor="middle" x="135.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge12_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge12_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.45,-78.69C52.71,-73.64 75.19,-66.2 94.65,-59.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.56,-63.15 103.95,-56.69 93.36,-56.51 95.56,-63.15"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="162.5,-19.25 108.25,-19.25 108.25,0 162.5,0 162.5,-19.25"/>
-<text text-anchor="middle" x="135.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge13_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge13_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.26,-74.63C35.4,-61.88 52.88,-39.99 73,-27.62 80.28,-23.15 88.74,-19.73 97,-17.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.85,-20.55 106.56,-14.52 95.99,-13.8 97.85,-20.55"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="322.88,-310.25 269.38,-310.25 269.38,-291 322.88,-291 322.88,-310.25"/>
-<text text-anchor="middle" x="296.12" y="-296.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M198.21,-290.25C218.25,-292.39 239.86,-294.71 257.58,-296.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.06,-300.07 267.38,-297.65 257.81,-293.11 257.06,-300.07"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.75,-216.15C168.57,-234.53 200.64,-264.86 233.75,-282.62 241.28,-286.67 249.84,-289.91 258.12,-292.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.08,-295.81 267.66,-295.12 258.97,-289.06 257.08,-295.81"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/fill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="332.62,-273.25 259.62,-273.25 259.62,-254 332.62,-254 332.62,-273.25"/>
-<text text-anchor="middle" x="296.12" y="-259.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::fill</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.01,-216.2C185.95,-225.47 210.91,-237.05 233.75,-245.62 238.44,-247.38 243.38,-249.08 248.34,-250.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="247.1,-253.97 257.69,-253.59 249.17,-247.28 247.1,-253.97"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="343.12,-236.25 249.12,-236.25 249.12,-217 343.12,-217 343.12,-236.25"/>
-<text text-anchor="middle" x="296.12" y="-222.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge6_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge6_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M198.21,-210.75C211.27,-212.89 225,-215.14 237.88,-217.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.02,-220.66 247.46,-218.82 238.15,-213.75 237.02,-220.66"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.5,-198.88 233.75,-198.88 233.75,-168.38 358.5,-168.38 358.5,-198.88"/>
-<text text-anchor="start" x="241.75" y="-185.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="296.12" y="-174.12" font-family="Helvetica,sans-Serif" font-size="10.00">::randomLevel</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge7_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge7_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M198.21,-194C206.08,-193.16 214.19,-192.29 222.21,-191.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.39,-194.93 231.96,-190.39 221.64,-187.97 222.39,-194.93"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0" target="_top" xlink:title="Updates a range of the segment tree.">
-<polygon fill="white" stroke="#666666" points="318.75,-132.25 273.5,-132.25 273.5,-113 318.75,-113 318.75,-132.25"/>
-<text text-anchor="middle" x="296.12" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">update</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge9_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge9_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M168.12,-185.03C196.08,-171.29 236.55,-151.41 264.24,-137.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.75,-140.96 273.18,-133.41 262.66,-134.68 265.75,-140.96"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge8_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M337.79,-167.88C344.71,-165.16 351.82,-162.33 358.5,-159.62 367.59,-155.95 377.4,-151.89 386.47,-148.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="387.82,-151.32 395.68,-144.22 385.11,-144.87 387.82,-151.32"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node9 -->
-<g id="edge10_Node000009_Node000009" class="edge">
-<title>Node9&#45;&gt;Node9</title>
-<g id="a_edge10_Node000009_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M276.48,-132.54C267.52,-141.15 274.06,-150.25 296.12,-150.25 308.19,-150.25 315.61,-147.53 318.4,-143.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="321.83,-142.94 316.12,-134.01 315.02,-144.55 321.83,-142.94"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 166605627..000000000
--- a/d0/d5a/skip__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,231 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="457pt" height="318pt"
- viewBox="0.00 0.00 456.75 318.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 314.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-94.25 0,-94.25 0,-75 37,-75 37,-94.25"/>
-<text text-anchor="middle" x="18.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.75,-298.88 73,-298.88 73,-268.38 197.75,-268.38 197.75,-298.88"/>
-<text text-anchor="start" x="81" y="-285.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="135.38" y="-274.12" font-family="Helvetica,sans-Serif" font-size="10.00">::displayList</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.68,-94.48C27.28,-118.36 43.83,-180.59 73,-224.62 81.76,-237.85 93.96,-250.35 105.18,-260.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.88,-263.06 112.73,-266.94 107.45,-257.76 102.88,-263.06"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.75,-215.88 73,-215.88 73,-185.38 197.75,-185.38 197.75,-215.88"/>
-<text text-anchor="start" x="81" y="-202.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="135.38" y="-191.12" font-family="Helvetica,sans-Serif" font-size="10.00">::insertElement</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.29,-94.52C47.23,-112.63 85.82,-151.6 110.91,-176.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.26,-179.23 117.79,-183.88 113.24,-174.31 108.26,-179.23"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="448.75,-143.25 394.5,-143.25 394.5,-124 448.75,-124 448.75,-143.25"/>
-<text text-anchor="middle" x="421.62" y="-129.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge11_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge11_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.16,-83.22C88.03,-79.67 238.94,-72.72 358.5,-103.62 370.85,-106.82 383.68,-112.55 394.45,-118.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="392.65,-121.16 403.11,-122.88 396.01,-115.01 392.65,-121.16"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.12,-56.25 105.62,-56.25 105.62,-37 165.12,-37 165.12,-56.25"/>
-<text text-anchor="middle" x="135.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge12_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge12_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.45,-78.69C52.71,-73.64 75.19,-66.2 94.65,-59.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.56,-63.15 103.95,-56.69 93.36,-56.51 95.56,-63.15"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="162.5,-19.25 108.25,-19.25 108.25,0 162.5,0 162.5,-19.25"/>
-<text text-anchor="middle" x="135.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge13_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge13_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.26,-74.63C35.4,-61.88 52.88,-39.99 73,-27.62 80.28,-23.15 88.74,-19.73 97,-17.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.85,-20.55 106.56,-14.52 95.99,-13.8 97.85,-20.55"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="322.88,-310.25 269.38,-310.25 269.38,-291 322.88,-291 322.88,-310.25"/>
-<text text-anchor="middle" x="296.12" y="-296.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M198.21,-290.25C218.25,-292.39 239.86,-294.71 257.58,-296.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.06,-300.07 267.38,-297.65 257.81,-293.11 257.06,-300.07"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.75,-216.15C168.57,-234.53 200.64,-264.86 233.75,-282.62 241.28,-286.67 249.84,-289.91 258.12,-292.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.08,-295.81 267.66,-295.12 258.97,-289.06 257.08,-295.81"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/fill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="332.62,-273.25 259.62,-273.25 259.62,-254 332.62,-254 332.62,-273.25"/>
-<text text-anchor="middle" x="296.12" y="-259.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::fill</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.01,-216.2C185.95,-225.47 210.91,-237.05 233.75,-245.62 238.44,-247.38 243.38,-249.08 248.34,-250.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="247.1,-253.97 257.69,-253.59 249.17,-247.28 247.1,-253.97"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="343.12,-236.25 249.12,-236.25 249.12,-217 343.12,-217 343.12,-236.25"/>
-<text text-anchor="middle" x="296.12" y="-222.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge6_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge6_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M198.21,-210.75C211.27,-212.89 225,-215.14 237.88,-217.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.02,-220.66 247.46,-218.82 238.15,-213.75 237.02,-220.66"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.5,-198.88 233.75,-198.88 233.75,-168.38 358.5,-168.38 358.5,-198.88"/>
-<text text-anchor="start" x="241.75" y="-185.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="296.12" y="-174.12" font-family="Helvetica,sans-Serif" font-size="10.00">::randomLevel</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge7_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge7_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M198.21,-194C206.08,-193.16 214.19,-192.29 222.21,-191.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.39,-194.93 231.96,-190.39 221.64,-187.97 222.39,-194.93"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0" target="_top" xlink:title="Updates a range of the segment tree.">
-<polygon fill="white" stroke="#666666" points="318.75,-132.25 273.5,-132.25 273.5,-113 318.75,-113 318.75,-132.25"/>
-<text text-anchor="middle" x="296.12" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">update</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge9_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge9_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M168.12,-185.03C196.08,-171.29 236.55,-151.41 264.24,-137.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.75,-140.96 273.18,-133.41 262.66,-134.68 265.75,-140.96"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge8_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M337.79,-167.88C344.71,-165.16 351.82,-162.33 358.5,-159.62 367.59,-155.95 377.4,-151.89 386.47,-148.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="387.82,-151.32 395.68,-144.22 385.11,-144.87 387.82,-151.32"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node9 -->
-<g id="edge10_Node000009_Node000009" class="edge">
-<title>Node9&#45;&gt;Node9</title>
-<g id="a_edge10_Node000009_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M276.48,-132.54C267.52,-141.15 274.06,-150.25 296.12,-150.25 308.19,-150.25 315.61,-147.53 318.4,-143.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="321.83,-142.94 316.12,-134.01 315.02,-144.55 321.83,-142.94"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d5a/skip__list_8cpp_source.html b/d0/d5a/skip__list_8cpp_source.html
new file mode 100644
index 000000000..40244ff6c
--- /dev/null
+++ b/d0/d5a/skip__list_8cpp_source.html
@@ -0,0 +1,342 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/skip_list.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d0/d5a/skip__list_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">skip_list.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d0/d5a/skip__list_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;array&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;memory&gt;</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d3c/namespacedata__structures.html">data_structures</a> {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">   27</a></span><span class="keyword">constexpr</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">MAX_LEVEL</a> = 2;        </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"><a class="line" href="../../d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61">   28</a></span><span class="keyword">constexpr</span> <span class="keywordtype">float</span> <a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61">PROBABILITY</a> = 0.5;  </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="foldopen" id="foldopen00033" data-start="{" data-end="};">
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../d9/d49/structdata__structures_1_1_node.html">   33</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../d9/d49/structdata__structures_1_1_node.html">Node</a> {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68">   34</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68">key</a>;      </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731">   35</a></span>    <span class="keywordtype">void</span>* <a class="code hl_variable" href="../../d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731">value</a>;  </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    std::vector&lt;std::shared_ptr&lt;Node&gt;&gt;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e">   37</a></span>        <a class="code hl_variable" href="../../d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e">forward</a>;  </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="foldopen" id="foldopen00044" data-start="{" data-end="}">
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="../../d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78">   44</a></span>    <a class="code hl_function" href="../../d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78">Node</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="../../d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68">key</a>, <span class="keywordtype">int</span> level, <span class="keywordtype">void</span>* <a class="code hl_variable" href="../../d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731">value</a> = <span class="keyword">nullptr</span>) : <a class="code hl_variable" href="../../d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68">key</a>(<a class="code hl_variable" href="../../d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68">key</a>), <a class="code hl_variable" href="../../d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731">value</a>(<a class="code hl_variable" href="../../d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731">value</a>) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="comment">// Initialization of forward vector</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; (level + 1); i++) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            <a class="code hl_variable" href="../../d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e">forward</a>.push_back(<span class="keyword">nullptr</span>);</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    }</div>
+</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>};</div>
+</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="foldopen" id="foldopen00055" data-start="{" data-end="};">
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../d4/d90/classdata__structures_1_1_skip_list.html">   55</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d4/d90/classdata__structures_1_1_skip_list.html">SkipList</a> {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650">   56</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a>;                     </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="../../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16">   57</a></span>    std::shared_ptr&lt;Node&gt; <a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16">header</a>;  </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00064" data-start="{" data-end="}">
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4">   64</a></span>    <a class="code hl_function" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4">SkipList</a>() {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a> = 0;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="comment">// Header initialization</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16">header</a> = std::make_shared&lt;Node&gt;(-1, <a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">MAX_LEVEL</a>);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    }</div>
+</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="foldopen" id="foldopen00075" data-start="{" data-end="}">
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="../../d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4">   75</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4">randomLevel</a>() {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="keywordtype">int</span> lvl = 0;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        <span class="keywordflow">while</span> (<span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(std::rand()) / RAND_MAX &lt; <a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61">PROBABILITY</a> &amp;&amp;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>               lvl &lt; <a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">MAX_LEVEL</a>) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            lvl++;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        }</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <span class="keywordflow">return</span> lvl;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    }</div>
+</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="foldopen" id="foldopen00090" data-start="{" data-end="}">
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9">   90</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9">insertElement</a>(<span class="keywordtype">int</span> key, <span class="keywordtype">void</span>* value) {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Inserting&quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot;...&quot;</span>;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        std::shared_ptr&lt;Node&gt; x = <a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16">header</a>;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        std::array&lt;std::shared_ptr&lt;Node&gt;, <a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">MAX_LEVEL</a> + 1&gt; <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>.fill(<span class="keyword">nullptr</span>);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = <a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a>; i &gt;= 0; i--) {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            <span class="keywordflow">while</span> (x-&gt;forward[i] != <span class="keyword">nullptr</span> &amp;&amp; x-&gt;forward[i]-&gt;key &lt; key) {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>                x = x-&gt;forward[i];</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>            }</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>            <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>[i] = x;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        }</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        x = x-&gt;forward[0];</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        <span class="keywordtype">bool</span> doesnt_exist = (x == <span class="keyword">nullptr</span> || x-&gt;key != key);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="keywordflow">if</span> (doesnt_exist) {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>            <span class="keywordtype">int</span> rlevel = <a class="code hl_function" href="../../d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4">randomLevel</a>();</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            <span class="keywordflow">if</span> (rlevel &gt; <a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a>) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = <a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a> + 1; i &lt; rlevel + 1; i++) <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>[i] = <a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16">header</a>;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>                <span class="comment">// Update current level</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>                <a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a> = rlevel;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>            }</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>            std::shared_ptr&lt;Node&gt; n =</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>                std::make_shared&lt;Node&gt;(key, rlevel, value);</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= rlevel; i++) {</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>                n-&gt;forward[i] = <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>[i]-&gt;forward[i];</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>                <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>[i]-&gt;forward[i] = n;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>            }</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Inserted&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Exists&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        }</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    }</div>
+</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
+<div class="foldopen" id="foldopen00133" data-start="{" data-end="}">
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"><a class="line" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0">  133</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0">deleteElement</a>(<span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>        std::shared_ptr&lt;Node&gt; x = <a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16">header</a>;</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span> </div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        std::array&lt;std::shared_ptr&lt;Node&gt;, <a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">MAX_LEVEL</a> + 1&gt; <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>.fill(<span class="keyword">nullptr</span>);</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = <a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a>; i &gt;= 0; i--) {</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>            <span class="keywordflow">while</span> (x-&gt;forward[i] != <span class="keyword">nullptr</span> &amp;&amp; x-&gt;forward[i]-&gt;key &lt; key) {</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>                x = x-&gt;forward[i];</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>            }</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>            <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>[i] = x;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        }</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span> </div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        x = x-&gt;forward[0];</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span> </div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        <span class="keywordtype">bool</span> doesnt_exist = (x == <span class="keyword">nullptr</span> || x-&gt;key != key);</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span> </div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>        <span class="keywordflow">if</span> (!doesnt_exist) {</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= <a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a>; i++) {</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>                <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>[i]-&gt;forward[i] != x) {</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>                    <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>                }</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>                <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>[i]-&gt;forward[i] = x-&gt;forward[i];</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>            }</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>            <span class="comment">/* Remove empty levels*/</span></div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>            <span class="keywordflow">while</span> (<a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a> &gt; 0 &amp;&amp; <a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16">header</a>-&gt;forward[<a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a>] == <span class="keyword">nullptr</span>) <a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a>--;</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Deleted&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Doesn&#39;t exist&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        }</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    }</div>
+</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span> </div>
+<div class="foldopen" id="foldopen00170" data-start="{" data-end="}">
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"><a class="line" href="../../d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4">  170</a></span>    <span class="keywordtype">void</span>* <a class="code hl_function" href="../../d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4">searchElement</a>(<span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>        std::shared_ptr&lt;Node&gt; x = <a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16">header</a>;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Searching for &quot;</span> &lt;&lt; key &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span> </div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = <a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a>; i &gt;= 0; i--) {</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>            <span class="keywordflow">while</span> (x-&gt;forward[i] &amp;&amp; x-&gt;forward[i]-&gt;key &lt; key) x = x-&gt;forward[i];</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        }</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span> </div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        x = x-&gt;forward[0];</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        <span class="keywordflow">if</span> (x &amp;&amp; x-&gt;key == key) {</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Found&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>            <span class="keywordflow">return</span> x-&gt;value;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Not Found&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>            <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        }</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    }</div>
+</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span> </div>
+<div class="foldopen" id="foldopen00191" data-start="{" data-end="}">
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"><a class="line" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c">  191</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c">displayList</a>() {</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Displaying list:\n&quot;</span>;</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= <a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a>; i++) {</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>            std::shared_ptr&lt;Node&gt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_variable" href="../../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16">header</a>-&gt;forward[i];</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Level &quot;</span> &lt;&lt; (i) &lt;&lt; <span class="stringliteral">&quot;: &quot;</span>;</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>            <span class="keywordflow">while</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>                std::cout &lt;&lt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;key &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>                <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;forward[i];</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>            }</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>            std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>        }</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    }</div>
+</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>};</div>
+</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span> </div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>}  <span class="comment">// namespace data_structures</span></div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span> </div>
+<div class="foldopen" id="foldopen00212" data-start="{" data-end="}">
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"><a class="line" href="../../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  212</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span> </div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    <a class="code hl_class" href="../../d4/d90/classdata__structures_1_1_skip_list.html">data_structures::SkipList</a> lst;</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span> </div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; (1 &lt;&lt; (<a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">data_structures::MAX_LEVEL</a> + 1)); j++) {</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>        <span class="keywordtype">int</span> k = (std::rand() % (1 &lt;&lt; (<a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">data_structures::MAX_LEVEL</a> + 2)) + 1);</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>        lst.<a class="code hl_function" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9">insertElement</a>(k, &amp;j);</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    }</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span> </div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    lst.<a class="code hl_function" href="../../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c">displayList</a>();</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span> </div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>}</div>
+</div>
+<div class="ttc" id="aclassdata__structures_1_1_skip_list_html"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html">data_structures::SkipList</a></div><div class="ttdef"><b>Definition</b> <a href="#l00055">skip_list.cpp:55</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a3e249c2c35a8b7f5ffd2d77fee60d650"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650">data_structures::SkipList::level</a></div><div class="ttdeci">int level</div><div class="ttdoc">Maximum level of the skiplist.</div><div class="ttdef"><b>Definition</b> <a href="#l00056">skip_list.cpp:56</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a40a4042bdf0b6683b5f21ae7854de8a9"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9">data_structures::SkipList::insertElement</a></div><div class="ttdeci">void insertElement(int key, void *value)</div><div class="ttdef"><b>Definition</b> <a href="#l00090">skip_list.cpp:90</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a7ffc3688725b9d1ec6e5bb881a6e2ae4"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4">data_structures::SkipList::SkipList</a></div><div class="ttdeci">SkipList()</div><div class="ttdef"><b>Definition</b> <a href="#l00064">skip_list.cpp:64</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a812611f80b8079268dbb19cc4e9bee5c"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c">data_structures::SkipList::displayList</a></div><div class="ttdeci">void displayList()</div><div class="ttdef"><b>Definition</b> <a href="#l00191">skip_list.cpp:191</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a86925c53e139cc6c3f7df1e9003bb0b0"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0">data_structures::SkipList::deleteElement</a></div><div class="ttdeci">void deleteElement(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00133">skip_list.cpp:133</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_aa3f3813e9896792fc86b296547689ba4"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4">data_structures::SkipList::randomLevel</a></div><div class="ttdeci">int randomLevel()</div><div class="ttdef"><b>Definition</b> <a href="#l00075">skip_list.cpp:75</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_ad7e392386d7db622185d6f7c718e4f16"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16">data_structures::SkipList::header</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; header</div><div class="ttdoc">Pointer to the header node.</div><div class="ttdef"><b>Definition</b> <a href="#l00057">skip_list.cpp:57</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_af2f3d4e15b1f47afac849c2e08a730f4"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4">data_structures::SkipList::searchElement</a></div><div class="ttdeci">void * searchElement(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00170">skip_list.cpp:170</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html">data_structures</a></div><div class="ttdoc">for IO operations</div></div>
+<div class="ttc" id="anamespacedata__structures_html_a903639d8e6f955dd8d5c263781455d61"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61">data_structures::PROBABILITY</a></div><div class="ttdeci">constexpr float PROBABILITY</div><div class="ttdoc">Current probability for &quot;coin toss&quot;.</div><div class="ttdef"><b>Definition</b> <a href="#l00028">skip_list.cpp:28</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html_ac0d7e0be24da9f41bcb19745873c436a"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">data_structures::MAX_LEVEL</a></div><div class="ttdeci">constexpr int MAX_LEVEL</div><div class="ttdoc">Maximum level of skip list.</div><div class="ttdef"><b>Definition</b> <a href="#l00027">skip_list.cpp:27</a></div></div>
+<div class="ttc" id="asegtree_8cpp_html_abd3e818681fb2e29cf08f4f60f82c8e0"><div class="ttname"><a href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a></div><div class="ttdeci">void update(std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos)</div><div class="ttdoc">Updates a range of the segment tree.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d45/segtree_8cpp_source.html#l00103">segtree.cpp:103</a></div></div>
+<div class="ttc" id="askip__list_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00212">skip_list.cpp:212</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1_node_html"><div class="ttname"><a href="../../d9/d49/structdata__structures_1_1_node.html">data_structures::Node</a></div><div class="ttdef"><b>Definition</b> <a href="#l00033">skip_list.cpp:33</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1_node_html_a54a6777e72b639c3ee6446a541db8e78"><div class="ttname"><a href="../../d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78">data_structures::Node::Node</a></div><div class="ttdeci">Node(int key, int level, void *value=nullptr)</div><div class="ttdef"><b>Definition</b> <a href="#l00044">skip_list.cpp:44</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1_node_html_a6b973b0bded99b0c0bd84e887bf8c731"><div class="ttname"><a href="../../d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731">data_structures::Node::value</a></div><div class="ttdeci">void * value</div><div class="ttdoc">pointer of value</div><div class="ttdef"><b>Definition</b> <a href="#l00035">skip_list.cpp:35</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1_node_html_ac75aa86a598357c5c882ec6a1174aa68"><div class="ttname"><a href="../../d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68">data_structures::Node::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key integer</div><div class="ttdef"><b>Definition</b> <a href="#l00034">skip_list.cpp:34</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1_node_html_ac916d833aad2b9c41f01a92db2f8c48e"><div class="ttname"><a href="../../d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e">data_structures::Node::forward</a></div><div class="ttdeci">std::vector&lt; std::shared_ptr&lt; Node &gt; &gt; forward</div><div class="ttdoc">nodes of the given one in all levels</div><div class="ttdef"><b>Definition</b> <a href="#l00037">skip_list.cpp:37</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d0/d5a/skip__list_8cpp.html">skip_list.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html
index 06c73c6dd..c7433e21b 100644
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html
+++ b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: operations_on_datastructures::trie_operations::Tnode Class Reference</title>
+<title>TheAlgorithms/C++: operations_on_datastructures::trie_operations::Tnode Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -137,54 +154,52 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:afca808362c13273ca8c8ae7d58e8eee0" id="r_afca808362c13273ca8c8ae7d58e8eee0"><td class="memItemLeft" align="right" valign="top">uint8_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afca808362c13273ca8c8ae7d58e8eee0">numberOfChildren</a> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
 <tr class="memdesc:afca808362c13273ca8c8ae7d58e8eee0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to count the number of children a node in the trie has.  <br /></td></tr>
 <tr class="separator:afca808362c13273ca8c8ae7d58e8eee0"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a7ecb75b985b1ffc575a880274f855b1c" id="r_a7ecb75b985b1ffc575a880274f855b1c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7ecb75b985b1ffc575a880274f855b1c">Insert</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;entry)</td></tr>
+<tr class="memitem:a7ecb75b985b1ffc575a880274f855b1c" id="r_a7ecb75b985b1ffc575a880274f855b1c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7ecb75b985b1ffc575a880274f855b1c">Insert</a> (const std::string &amp;entry)</td></tr>
 <tr class="memdesc:a7ecb75b985b1ffc575a880274f855b1c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to insert a word in the trie.  <br /></td></tr>
 <tr class="separator:a7ecb75b985b1ffc575a880274f855b1c"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aefd24626ac47277431c9b8604e064340" id="r_aefd24626ac47277431c9b8604e064340"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aefd24626ac47277431c9b8604e064340">Delete</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> entry)</td></tr>
+<tr class="memitem:aefd24626ac47277431c9b8604e064340" id="r_aefd24626ac47277431c9b8604e064340"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aefd24626ac47277431c9b8604e064340">Delete</a> (std::string entry)</td></tr>
 <tr class="memdesc:aefd24626ac47277431c9b8604e064340"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to verify presence and hence delete an entry from the trie.  <br /></td></tr>
 <tr class="separator:aefd24626ac47277431c9b8604e064340"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:adef6940391f981ab86767775176b7169" id="r_adef6940391f981ab86767775176b7169"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adef6940391f981ab86767775176b7169">DeleteFrom</a> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *delete_from, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> delete_string, int remove_index)</td></tr>
+<tr class="memitem:adef6940391f981ab86767775176b7169" id="r_adef6940391f981ab86767775176b7169"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adef6940391f981ab86767775176b7169">DeleteFrom</a> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *delete_from, std::string delete_string, int remove_index)</td></tr>
 <tr class="memdesc:adef6940391f981ab86767775176b7169"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function recursively deletes the substring character by character iterating through the string to be deleted. It traverses till the end of word in a recursive fashion, from there it deletes characters one by one till it reaches back to the initial call.  <br /></td></tr>
 <tr class="separator:adef6940391f981ab86767775176b7169"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a4a624fcdf3c3beb2025d69f2cfda8023" id="r_a4a624fcdf3c3beb2025d69f2cfda8023"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4a624fcdf3c3beb2025d69f2cfda8023">SearchPresence</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;key)</td></tr>
+<tr class="memitem:a4a624fcdf3c3beb2025d69f2cfda8023" id="r_a4a624fcdf3c3beb2025d69f2cfda8023"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4a624fcdf3c3beb2025d69f2cfda8023">SearchPresence</a> (const std::string &amp;key)</td></tr>
 <tr class="memdesc:a4a624fcdf3c3beb2025d69f2cfda8023"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to check a word's presence in the trie (Basic)  <br /></td></tr>
 <tr class="separator:a4a624fcdf3c3beb2025d69f2cfda8023"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a097913c4badec2b60d50a171ecc299fe" id="r_a097913c4badec2b60d50a171ecc299fe"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a097913c4badec2b60d50a171ecc299fe">SuggestAutocomplete</a> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *new_root, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;prefix)</td></tr>
+<tr class="memitem:a097913c4badec2b60d50a171ecc299fe" id="r_a097913c4badec2b60d50a171ecc299fe"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a097913c4badec2b60d50a171ecc299fe">SuggestAutocomplete</a> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *new_root, const std::string &amp;prefix)</td></tr>
 <tr class="memdesc:a097913c4badec2b60d50a171ecc299fe"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to suggest all the entries of trie which have a given common prefix.  <br /></td></tr>
 <tr class="separator:a097913c4badec2b60d50a171ecc299fe"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a18b70172ca4fb2811dbfb9a86e48b34c" id="r_a18b70172ca4fb2811dbfb9a86e48b34c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a18b70172ca4fb2811dbfb9a86e48b34c">SearchSuggestions</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;key)</td></tr>
+<tr class="memitem:a18b70172ca4fb2811dbfb9a86e48b34c" id="r_a18b70172ca4fb2811dbfb9a86e48b34c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a18b70172ca4fb2811dbfb9a86e48b34c">SearchSuggestions</a> (const std::string &amp;key)</td></tr>
 <tr class="memdesc:a18b70172ca4fb2811dbfb9a86e48b34c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Lists out all the words in trie with the longest prefix of the search key that is present in the trie. For example - if trie contains "abc", "abcde", "abcdefg", "abcddef" and if the search key is "abcdezz", then the longest common prefix is "abcde" and hence search results will be "abcde", "abcdefg".  <br /></td></tr>
 <tr class="separator:a18b70172ca4fb2811dbfb9a86e48b34c"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a9e556f52c837190ecf4265b1f05cfe9c" id="r_a9e556f52c837190ecf4265b1f05cfe9c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9e556f52c837190ecf4265b1f05cfe9c">SuggestFreqAutocomplete</a> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *new_root, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;prefix, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &gt; *suggestions)</td></tr>
+<tr class="memitem:a9e556f52c837190ecf4265b1f05cfe9c" id="r_a9e556f52c837190ecf4265b1f05cfe9c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9e556f52c837190ecf4265b1f05cfe9c">SuggestFreqAutocomplete</a> (<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *new_root, const std::string &amp;prefix, std::priority_queue&lt; std::pair&lt; int, std::string &gt; &gt; *suggestions)</td></tr>
 <tr class="memdesc:a9e556f52c837190ecf4265b1f05cfe9c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to suggest most frequently searched entries of trie which have a given common prefix.  <br /></td></tr>
 <tr class="separator:a9e556f52c837190ecf4265b1f05cfe9c"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a7c5ab271d8042540f64ef16d259d1503" id="r_a7c5ab271d8042540f64ef16d259d1503"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7c5ab271d8042540f64ef16d259d1503">SearchFreqSuggestions</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;key)</td></tr>
+<tr class="memitem:a7c5ab271d8042540f64ef16d259d1503" id="r_a7c5ab271d8042540f64ef16d259d1503"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7c5ab271d8042540f64ef16d259d1503">SearchFreqSuggestions</a> (const std::string &amp;key)</td></tr>
 <tr class="memdesc:a7c5ab271d8042540f64ef16d259d1503"><td class="mdescLeft">&#160;</td><td class="mdescRight">Lists out the most frequent words in trie with the longest prefix of the search key that is present in the trie. For example - if trie contains "abc", "abcde", "abcdefg", "abcddef" and they have been previously searched for 3, 1, 2, 4 times respectively, if the search key is "ab", then the longest common prefix is "ab" and only the top 3 frequencies among the matches would be displayed viz. "abcddef", "abc", "abcdefg".  <br /></td></tr>
 <tr class="separator:a7c5ab271d8042540f64ef16d259d1503"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aacafb8c9f3ebac7ac6c01d9645bb67b6" id="r_aacafb8c9f3ebac7ac6c01d9645bb67b6"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aacafb8c9f3ebac7ac6c01d9645bb67b6">SelectionTop_3</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &gt; *suggestions)</td></tr>
+<tr class="memitem:aacafb8c9f3ebac7ac6c01d9645bb67b6" id="r_aacafb8c9f3ebac7ac6c01d9645bb67b6"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aacafb8c9f3ebac7ac6c01d9645bb67b6">SelectionTop_3</a> (std::priority_queue&lt; std::pair&lt; int, std::string &gt; &gt; *suggestions)</td></tr>
 <tr class="memdesc:aacafb8c9f3ebac7ac6c01d9645bb67b6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to display the 3 suggestions with highest frequency of search hits.  <br /></td></tr>
 <tr class="separator:aacafb8c9f3ebac7ac6c01d9645bb67b6"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:aa4aac1c6bed58a84472906b63f20da83" id="r_aa4aac1c6bed58a84472906b63f20da83"><td class="memItemLeft" align="right" valign="top"><a id="aa4aac1c6bed58a84472906b63f20da83" name="aa4aac1c6bed58a84472906b63f20da83"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> * &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>english</b></td></tr>
+<tr class="memitem:aa4aac1c6bed58a84472906b63f20da83" id="r_aa4aac1c6bed58a84472906b63f20da83"><td class="memItemLeft" align="right" valign="top">std::vector&lt; <a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> * &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa4aac1c6bed58a84472906b63f20da83">english</a></td></tr>
 <tr class="separator:aa4aac1c6bed58a84472906b63f20da83"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:afa9dab736046a4140e94bb9104074cd6" id="r_afa9dab736046a4140e94bb9104074cd6"><td class="memItemLeft" align="right" valign="top"><a id="afa9dab736046a4140e94bb9104074cd6" name="afa9dab736046a4140e94bb9104074cd6"></a>
-bool&#160;</td><td class="memItemRight" valign="bottom"><b>endOfWord</b></td></tr>
+<tr class="memitem:afa9dab736046a4140e94bb9104074cd6" id="r_afa9dab736046a4140e94bb9104074cd6"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afa9dab736046a4140e94bb9104074cd6">endOfWord</a></td></tr>
 <tr class="separator:afa9dab736046a4140e94bb9104074cd6"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a7bab9bb47215cd674471c94b0b448014" id="r_a7bab9bb47215cd674471c94b0b448014"><td class="memItemLeft" align="right" valign="top"><a id="a7bab9bb47215cd674471c94b0b448014" name="a7bab9bb47215cd674471c94b0b448014"></a>
-uint32_t&#160;</td><td class="memItemRight" valign="bottom"><b>frequency</b></td></tr>
+<tr class="memitem:a7bab9bb47215cd674471c94b0b448014" id="r_a7bab9bb47215cd674471c94b0b448014"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7bab9bb47215cd674471c94b0b448014">frequency</a></td></tr>
 <tr class="separator:a7bab9bb47215cd674471c94b0b448014"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-static-attribs" name="pri-static-attribs"></a>
 Static Private Attributes</h2></td></tr>
-<tr class="memitem:a0f310c3d4d7b82e5ee1036771cade702" id="r_a0f310c3d4d7b82e5ee1036771cade702"><td class="memItemLeft" align="right" valign="top"><a id="a0f310c3d4d7b82e5ee1036771cade702" name="a0f310c3d4d7b82e5ee1036771cade702"></a>
-static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>ENGLISH_ALPHABET_SIZE</b> = 26</td></tr>
+<tr class="memitem:a0f310c3d4d7b82e5ee1036771cade702" id="r_a0f310c3d4d7b82e5ee1036771cade702"><td class="memItemLeft" align="right" valign="top">static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0f310c3d4d7b82e5ee1036771cade702">ENGLISH_ALPHABET_SIZE</a> = 26</td></tr>
 <tr class="separator:a0f310c3d4d7b82e5ee1036771cade702"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Class defining the structure of trie node and containing the methods to perform operations on them. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="aef1ef6608e5876312d9ae7f36f469ba7" name="aef1ef6608e5876312d9ae7f36f469ba7"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aef1ef6608e5876312d9ae7f36f469ba7">&#9670;&#160;</a></span>Tnode() <span class="overload">[1/2]</span></h2>
@@ -208,6 +223,8 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>E
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00050">50</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   50</span>            {</div>
 <div class="line"><span class="lineno">   51</span>        english.resize(ENGLISH_ALPHABET_SIZE, <span class="keyword">nullptr</span>);</div>
 <div class="line"><span class="lineno">   52</span>        endOfWord = <span class="keyword">false</span>;</div>
@@ -238,12 +255,14 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>E
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00056">56</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   56</span>                             {</div>
 <div class="line"><span class="lineno">   57</span>        english = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>.english;</div>
 <div class="line"><span class="lineno">   58</span>        endOfWord = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>.endOfWord;</div>
 <div class="line"><span class="lineno">   59</span>        frequency = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>.frequency;</div>
 <div class="line"><span class="lineno">   60</span>    }</div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -269,6 +288,8 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>E
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00093">93</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   93</span>             {</div>
 <div class="line"><span class="lineno">   94</span>        <span class="keywordtype">int</span> i = 0;</div>
 <div class="line"><span class="lineno">   95</span>        <span class="keywordflow">for</span> (i = 0; i &lt; ENGLISH_ALPHABET_SIZE; i++) {</div>
@@ -290,7 +311,7 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>E
         <tr>
           <td class="memname">void operations_on_datastructures::trie_operations::Tnode::Delete </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>entry</em></span></td><td>)</td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>entry</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -303,18 +324,20 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>E
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00153">153</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  153</span>                                  {</div>
 <div class="line"><span class="lineno">  154</span>    Tnode *cur_pos = <span class="keyword">this</span>,</div>
 <div class="line"><span class="lineno">  155</span>          *delete_from = <span class="keyword">this</span>;  <span class="comment">// Current pointer pointing to root</span></div>
-<div class="line"><span class="lineno">  156</span>    <span class="keywordtype">int</span> letter_index = 0, delete_from_index = 0, i = 0, n = entry.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
+<div class="line"><span class="lineno">  156</span>    <span class="keywordtype">int</span> letter_index = 0, delete_from_index = 0, i = 0, n = entry.size();</div>
 <div class="line"><span class="lineno">  157</span> </div>
 <div class="line"><span class="lineno">  158</span>    <span class="keywordflow">for</span> (i = 0; i &lt; n; i++) {</div>
 <div class="line"><span class="lineno">  159</span>        <span class="comment">// To ignore case</span></div>
-<div class="line"><span class="lineno">  160</span>        letter_index = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/tolower.html">tolower</a>(entry[i]) - 97;</div>
+<div class="line"><span class="lineno">  160</span>        letter_index = tolower(entry[i]) - 97;</div>
 <div class="line"><span class="lineno">  161</span> </div>
 <div class="line"><span class="lineno">  162</span>        <span class="comment">// Display error message when given entry is not present in the tree</span></div>
 <div class="line"><span class="lineno">  163</span>        <span class="keywordflow">if</span> (cur_pos-&gt;english[letter_index] == <span class="keyword">nullptr</span>) {</div>
-<div class="line"><span class="lineno">  164</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Entry not Found&quot;</span> &lt;&lt; <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">  164</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Entry not Found&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  165</span>            <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  166</span>        }</div>
 <div class="line"><span class="lineno">  167</span>        <span class="comment">// If the current node is end of word for the current prefix or if it</span></div>
@@ -334,7 +357,7 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>E
 <div class="line"><span class="lineno">  181</span>    <span class="comment">// cur_pos now points to the last char of entry. Display message if that</span></div>
 <div class="line"><span class="lineno">  182</span>    <span class="comment">// entry does not exist</span></div>
 <div class="line"><span class="lineno">  183</span>    <span class="keywordflow">if</span> (!cur_pos-&gt;endOfWord) {</div>
-<div class="line"><span class="lineno">  184</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Entry not Found&quot;</span> &lt;&lt; <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">  184</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Entry not Found&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  185</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  186</span>    }</div>
 <div class="line"><span class="lineno">  187</span> </div>
@@ -347,7 +370,7 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>E
 <div class="line"><span class="lineno">  194</span>    }</div>
 <div class="line"><span class="lineno">  195</span> </div>
 <div class="line"><span class="lineno">  196</span>    <span class="comment">// The first character of the suffix to be deleted</span></div>
-<div class="line"><span class="lineno">  197</span>    letter_index = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/tolower.html">tolower</a>(entry[delete_from_index + 1]) - 97;</div>
+<div class="line"><span class="lineno">  197</span>    letter_index = tolower(entry[delete_from_index + 1]) - 97;</div>
 <div class="line"><span class="lineno">  198</span>    <span class="comment">// Point cur_pos to the next node</span></div>
 <div class="line"><span class="lineno">  199</span>    cur_pos = delete_from-&gt;english[letter_index];</div>
 <div class="line"><span class="lineno">  200</span>    <span class="comment">// Sever the connection from the main trie</span></div>
@@ -363,18 +386,9 @@ static constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>E
 <div class="line"><span class="lineno">  210</span>        <span class="keyword">delete</span> cur_pos;</div>
 <div class="line"><span class="lineno">  211</span>    }</div>
 <div class="line"><span class="lineno">  212</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="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_adef6940391f981ab86767775176b7169"><div class="ttname"><a href="#adef6940391f981ab86767775176b7169">operations_on_datastructures::trie_operations::Tnode::DeleteFrom</a></div><div class="ttdeci">void DeleteFrom(Tnode *delete_from, std::string delete_string, int remove_index)</div><div class="ttdoc">Function recursively deletes the substring character by character iterating through the string to be ...</div><div class="ttdef"><b>Definition</b> trie_multiple_search.cpp:137</div></div>
-<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_afca808362c13273ca8c8ae7d58e8eee0"><div class="ttname"><a href="#afca808362c13273ca8c8ae7d58e8eee0">operations_on_datastructures::trie_operations::Tnode::numberOfChildren</a></div><div class="ttdeci">uint8_t numberOfChildren(Tnode *node)</div><div class="ttdoc">Function to count the number of children a node in the trie has.</div><div class="ttdef"><b>Definition</b> trie_multiple_search.cpp:72</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="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-<div class="ttc" id="atolower_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/tolower.html">std::tolower</a></div><div class="ttdeci">T tolower(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aefd24626ac47277431c9b8604e064340_cgraph.svg" width="603" height="272"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_adef6940391f981ab86767775176b7169"><div class="ttname"><a href="#adef6940391f981ab86767775176b7169">operations_on_datastructures::trie_operations::Tnode::DeleteFrom</a></div><div class="ttdeci">void DeleteFrom(Tnode *delete_from, std::string delete_string, int remove_index)</div><div class="ttdoc">Function recursively deletes the substring character by character iterating through the string to be ...</div><div class="ttdef"><b>Definition</b> <a href="../../d7/def/trie__multiple__search_8cpp_source.html#l00137">trie_multiple_search.cpp:137</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_afca808362c13273ca8c8ae7d58e8eee0"><div class="ttname"><a href="#afca808362c13273ca8c8ae7d58e8eee0">operations_on_datastructures::trie_operations::Tnode::numberOfChildren</a></div><div class="ttdeci">uint8_t numberOfChildren(Tnode *node)</div><div class="ttdoc">Function to count the number of children a node in the trie has.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/def/trie__multiple__search_8cpp_source.html#l00072">trie_multiple_search.cpp:72</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="adef6940391f981ab86767775176b7169" name="adef6940391f981ab86767775176b7169"></a>
@@ -391,7 +405,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>delete_string</em></span>, </td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>delete_string</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -410,9 +424,11 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00137">137</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  138</span>                                         {</div>
-<div class="line"><span class="lineno">  139</span>    <span class="keywordflow">if</span> (delete_string.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() == remove_index) {</div>
-<div class="line"><span class="lineno">  140</span>        <span class="keywordtype">int</span> letter_index = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/tolower.html">tolower</a>(delete_string[remove_index]) - 97;</div>
+<div class="line"><span class="lineno">  139</span>    <span class="keywordflow">if</span> (delete_string.size() == remove_index) {</div>
+<div class="line"><span class="lineno">  140</span>        <span class="keywordtype">int</span> letter_index = tolower(delete_string[remove_index]) - 97;</div>
 <div class="line"><span class="lineno">  141</span> </div>
 <div class="line"><span class="lineno">  142</span>        <a class="code hl_function" href="#adef6940391f981ab86767775176b7169">DeleteFrom</a>(delete_from-&gt;english[letter_index], delete_string,</div>
 <div class="line"><span class="lineno">  143</span>                   remove_index + 1);</div>
@@ -420,12 +436,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  145</span>        <span class="keyword">delete</span> delete_from;</div>
 <div class="line"><span class="lineno">  146</span>    }</div>
 <div class="line"><span class="lineno">  147</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_adef6940391f981ab86767775176b7169_cgraph.svg" width="363" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7ecb75b985b1ffc575a880274f855b1c" name="a7ecb75b985b1ffc575a880274f855b1c"></a>
@@ -437,7 +448,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void operations_on_datastructures::trie_operations::Tnode::Insert </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>entry</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>entry</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -450,13 +461,15 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  107</span>                                         {</div>
 <div class="line"><span class="lineno">  108</span>    Tnode *cur_pos = <span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  109</span>    <span class="keywordtype">int</span> letter_index = 0;</div>
 <div class="line"><span class="lineno">  110</span> </div>
 <div class="line"><span class="lineno">  111</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;i : entry) {</div>
 <div class="line"><span class="lineno">  112</span>        <span class="comment">// To ignore case</span></div>
-<div class="line"><span class="lineno">  113</span>        letter_index = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/tolower.html">tolower</a>(i) - 97;</div>
+<div class="line"><span class="lineno">  113</span>        letter_index = tolower(i) - 97;</div>
 <div class="line"><span class="lineno">  114</span> </div>
 <div class="line"><span class="lineno">  115</span>        <span class="comment">// Allocate a node for each character of entry if not present in the</span></div>
 <div class="line"><span class="lineno">  116</span>        <span class="comment">// trie</span></div>
@@ -503,17 +516,13 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>count of the number of children of the given node (max 26) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00072">72</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   72</span>                                                 {</div>
 <div class="line"><span class="lineno">   73</span>        <span class="keywordflow">return</span> ENGLISH_ALPHABET_SIZE -</div>
-<div class="line"><span class="lineno">   74</span>               <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/count.html">std::count</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;english.begin(), <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;english.end(), <span class="keyword">nullptr</span>);</div>
+<div class="line"><span class="lineno">   74</span>               std::count(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;english.begin(), <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;english.end(), <span class="keyword">nullptr</span>);</div>
 <div class="line"><span class="lineno">   75</span>    }</div>
-<div class="ttc" id="acount_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/count.html">std::count</a></div><div class="ttdeci">T count(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_afca808362c13273ca8c8ae7d58e8eee0_cgraph.svg" width="331" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7c5ab271d8042540f64ef16d259d1503" name="a7c5ab271d8042540f64ef16d259d1503"></a>
@@ -525,7 +534,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void operations_on_datastructures::trie_operations::Tnode::SearchFreqSuggestions </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>key</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>key</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -538,21 +547,23 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00368">368</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  368</span>                                                      {</div>
 <div class="line"><span class="lineno">  369</span>    Tnode *cur_pos = <span class="keyword">nullptr</span>, *prev_pos = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  370</span>    cur_pos = prev_pos = <span class="keyword">this</span>;  <span class="comment">// maintaining 2 pointers, initialized to root</span></div>
 <div class="line"><span class="lineno">  371</span>    <span class="keywordtype">int</span> letter_index = 0;</div>
-<div class="line"><span class="lineno">  372</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> prefix =</div>
+<div class="line"><span class="lineno">  372</span>    std::string prefix =</div>
 <div class="line"><span class="lineno">  373</span>        <span class="stringliteral">&quot;&quot;</span>;  <span class="comment">// variable storing the updated value of longest common prefix</span></div>
-<div class="line"><span class="lineno">  374</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue&lt;std::pair&lt;int, std::string&gt;</a> &gt;</div>
+<div class="line"><span class="lineno">  374</span>    std::priority_queue&lt;std::pair&lt;int, std::string&gt; &gt;</div>
 <div class="line"><span class="lineno">  375</span>        suggestions;  <span class="comment">// max heap to store (frequency, word) in descending order</span></div>
 <div class="line"><span class="lineno">  376</span>                      <span class="comment">// of freq</span></div>
 <div class="line"><span class="lineno">  377</span> </div>
-<div class="line"><span class="lineno">  378</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue&lt;std::pair&lt;int, std::string&gt;</a> &gt; *Suggestions =</div>
+<div class="line"><span class="lineno">  378</span>    std::priority_queue&lt;std::pair&lt;int, std::string&gt; &gt; *Suggestions =</div>
 <div class="line"><span class="lineno">  379</span>        &amp;suggestions;</div>
 <div class="line"><span class="lineno">  380</span> </div>
 <div class="line"><span class="lineno">  381</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;i : key) {</div>
-<div class="line"><span class="lineno">  382</span>        letter_index = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/tolower.html">tolower</a>(i) - 97;</div>
+<div class="line"><span class="lineno">  382</span>        letter_index = tolower(i) - 97;</div>
 <div class="line"><span class="lineno">  383</span>        prev_pos = cur_pos;  <span class="comment">// Previous pointer updated to point to the last</span></div>
 <div class="line"><span class="lineno">  384</span>                             <span class="comment">// char of the longest common prefix</span></div>
 <div class="line"><span class="lineno">  385</span> </div>
@@ -562,18 +573,18 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  389</span>            <a class="code hl_function" href="#a9e556f52c837190ecf4265b1f05cfe9c">SuggestFreqAutocomplete</a>(prev_pos, prefix, Suggestions);</div>
 <div class="line"><span class="lineno">  390</span>            <span class="comment">// To display the top 3 results</span></div>
 <div class="line"><span class="lineno">  391</span>            <a class="code hl_function" href="#aacafb8c9f3ebac7ac6c01d9645bb67b6">SelectionTop_3</a>(Suggestions);</div>
-<div class="line"><span class="lineno">  392</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;- - - - - - - - - - - - - - - - - - - - - - - - - - &quot;</span></div>
-<div class="line"><span class="lineno">  393</span>                      &lt;&lt; <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">  392</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;- - - - - - - - - - - - - - - - - - - - - - - - - - &quot;</span></div>
+<div class="line"><span class="lineno">  393</span>                      &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  394</span>            <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  395</span>        }</div>
 <div class="line"><span class="lineno">  396</span>        <span class="comment">// Updating the longest common prefix</span></div>
-<div class="line"><span class="lineno">  397</span>        prefix += char(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/tolower.html">tolower</a>(i));</div>
+<div class="line"><span class="lineno">  397</span>        prefix += char(tolower(i));</div>
 <div class="line"><span class="lineno">  398</span>        cur_pos = cur_pos-&gt;english[letter_index];</div>
 <div class="line"><span class="lineno">  399</span>    }</div>
 <div class="line"><span class="lineno">  400</span>    <span class="comment">// If the key is a valid entry of trie, display it @ top of the suggestions</span></div>
 <div class="line"><span class="lineno">  401</span>    <span class="keywordflow">if</span> (cur_pos-&gt;endOfWord) {</div>
 <div class="line"><span class="lineno">  402</span>        (cur_pos-&gt;frequency)++;</div>
-<div class="line"><span class="lineno">  403</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; key &lt;&lt; <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">  403</span>        std::cout &lt;&lt; key &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  404</span>    }</div>
 <div class="line"><span class="lineno">  405</span> </div>
 <div class="line"><span class="lineno">  406</span>    (void)prev_pos;  <span class="comment">// Idiom to ignore previous pointer</span></div>
@@ -584,20 +595,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  411</span>    <span class="comment">// Display the top 3 results</span></div>
 <div class="line"><span class="lineno">  412</span>    <a class="code hl_function" href="#aacafb8c9f3ebac7ac6c01d9645bb67b6">SelectionTop_3</a>(Suggestions);</div>
 <div class="line"><span class="lineno">  413</span> </div>
-<div class="line"><span class="lineno">  414</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;- - - - - - - - - - - - - - - - - - - - - - - - - - &quot;</span></div>
-<div class="line"><span class="lineno">  415</span>              &lt;&lt; <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">  414</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;- - - - - - - - - - - - - - - - - - - - - - - - - - &quot;</span></div>
+<div class="line"><span class="lineno">  415</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  416</span>    <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  417</span>}</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_a9e556f52c837190ecf4265b1f05cfe9c"><div class="ttname"><a href="#a9e556f52c837190ecf4265b1f05cfe9c">operations_on_datastructures::trie_operations::Tnode::SuggestFreqAutocomplete</a></div><div class="ttdeci">void SuggestFreqAutocomplete(Tnode *new_root, const std::string &amp;prefix, std::priority_queue&lt; std::pair&lt; int, std::string &gt; &gt; *suggestions)</div><div class="ttdoc">Recursive function to suggest most frequently searched entries of trie which have a given common pref...</div><div class="ttdef"><b>Definition</b> trie_multiple_search.cpp:340</div></div>
-<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_aacafb8c9f3ebac7ac6c01d9645bb67b6"><div class="ttname"><a href="#aacafb8c9f3ebac7ac6c01d9645bb67b6">operations_on_datastructures::trie_operations::Tnode::SelectionTop_3</a></div><div class="ttdeci">void SelectionTop_3(std::priority_queue&lt; std::pair&lt; int, std::string &gt; &gt; *suggestions)</div><div class="ttdoc">Function to display the 3 suggestions with highest frequency of search hits.</div><div class="ttdef"><b>Definition</b> trie_multiple_search.cpp:320</div></div>
-<div class="ttc" id="apriority_queue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a></div></div>
-</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="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a7c5ab271d8042540f64ef16d259d1503_cgraph.svg" width="599" height="190"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_a9e556f52c837190ecf4265b1f05cfe9c"><div class="ttname"><a href="#a9e556f52c837190ecf4265b1f05cfe9c">operations_on_datastructures::trie_operations::Tnode::SuggestFreqAutocomplete</a></div><div class="ttdeci">void SuggestFreqAutocomplete(Tnode *new_root, const std::string &amp;prefix, std::priority_queue&lt; std::pair&lt; int, std::string &gt; &gt; *suggestions)</div><div class="ttdoc">Recursive function to suggest most frequently searched entries of trie which have a given common pref...</div><div class="ttdef"><b>Definition</b> <a href="../../d7/def/trie__multiple__search_8cpp_source.html#l00340">trie_multiple_search.cpp:340</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_aacafb8c9f3ebac7ac6c01d9645bb67b6"><div class="ttname"><a href="#aacafb8c9f3ebac7ac6c01d9645bb67b6">operations_on_datastructures::trie_operations::Tnode::SelectionTop_3</a></div><div class="ttdeci">void SelectionTop_3(std::priority_queue&lt; std::pair&lt; int, std::string &gt; &gt; *suggestions)</div><div class="ttdoc">Function to display the 3 suggestions with highest frequency of search hits.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/def/trie__multiple__search_8cpp_source.html#l00320">trie_multiple_search.cpp:320</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4a624fcdf3c3beb2025d69f2cfda8023" name="a4a624fcdf3c3beb2025d69f2cfda8023"></a>
@@ -609,7 +613,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool operations_on_datastructures::trie_operations::Tnode::SearchPresence </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>key</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>key</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -625,12 +629,14 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>true if the key is found </dd>
 <dd>
 false if the key is not found </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00220">220</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  220</span>                                               {</div>
 <div class="line"><span class="lineno">  221</span>    Tnode *cur_pos = <span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  222</span>    <span class="keywordtype">int</span> letter_index = 0;</div>
 <div class="line"><span class="lineno">  223</span> </div>
 <div class="line"><span class="lineno">  224</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;i : key) {</div>
-<div class="line"><span class="lineno">  225</span>        letter_index = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/tolower.html">tolower</a>(i) - 97;</div>
+<div class="line"><span class="lineno">  225</span>        letter_index = tolower(i) - 97;</div>
 <div class="line"><span class="lineno">  226</span>        <span class="comment">// If any character in the order of the key is absent, word not found!</span></div>
 <div class="line"><span class="lineno">  227</span>        <span class="keywordflow">if</span> (cur_pos-&gt;english[letter_index] == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">  228</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
@@ -658,7 +664,7 @@ false if the key is not found </dd></dl>
         <tr>
           <td class="memname">void operations_on_datastructures::trie_operations::Tnode::SearchSuggestions </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>key</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>key</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -671,15 +677,17 @@ false if the key is not found </dd></dl>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00274">274</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  274</span>                                                  {</div>
 <div class="line"><span class="lineno">  275</span>    Tnode *cur_pos = <span class="keyword">nullptr</span>, *prev_pos = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  276</span>    cur_pos = prev_pos = <span class="keyword">this</span>;  <span class="comment">// maintaining 2 pointers, initialized to root</span></div>
 <div class="line"><span class="lineno">  277</span>    <span class="keywordtype">int</span> letter_index = 0;</div>
-<div class="line"><span class="lineno">  278</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> prefix =</div>
+<div class="line"><span class="lineno">  278</span>    std::string prefix =</div>
 <div class="line"><span class="lineno">  279</span>        <span class="stringliteral">&quot;&quot;</span>;  <span class="comment">// variable storing the updated value of longest common prefix</span></div>
 <div class="line"><span class="lineno">  280</span> </div>
 <div class="line"><span class="lineno">  281</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;i : key) {</div>
-<div class="line"><span class="lineno">  282</span>        letter_index = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/tolower.html">tolower</a>(i) - 97;</div>
+<div class="line"><span class="lineno">  282</span>        letter_index = tolower(i) - 97;</div>
 <div class="line"><span class="lineno">  283</span>        prev_pos = cur_pos;  <span class="comment">// Previous pointer updated to point to the last</span></div>
 <div class="line"><span class="lineno">  284</span>                             <span class="comment">// char of the longest common prefix</span></div>
 <div class="line"><span class="lineno">  285</span> </div>
@@ -687,17 +695,17 @@ false if the key is not found </dd></dl>
 <div class="line"><span class="lineno">  287</span>        <span class="comment">// been determined and SuggestAutocomplete is called</span></div>
 <div class="line"><span class="lineno">  288</span>        <span class="keywordflow">if</span> (cur_pos-&gt;english[letter_index] == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">  289</span>            <a class="code hl_function" href="#a097913c4badec2b60d50a171ecc299fe">SuggestAutocomplete</a>(prev_pos, prefix);</div>
-<div class="line"><span class="lineno">  290</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;- - - - - - - - - - - - - - - - - - - - - - - - - - &quot;</span></div>
-<div class="line"><span class="lineno">  291</span>                      &lt;&lt; <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">  290</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;- - - - - - - - - - - - - - - - - - - - - - - - - - &quot;</span></div>
+<div class="line"><span class="lineno">  291</span>                      &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  292</span>            <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  293</span>        }</div>
 <div class="line"><span class="lineno">  294</span>        <span class="comment">// Updating the longest common prefix</span></div>
-<div class="line"><span class="lineno">  295</span>        prefix += char(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/tolower.html">tolower</a>(i));</div>
+<div class="line"><span class="lineno">  295</span>        prefix += char(tolower(i));</div>
 <div class="line"><span class="lineno">  296</span>        cur_pos = cur_pos-&gt;english[letter_index];</div>
 <div class="line"><span class="lineno">  297</span>    }</div>
 <div class="line"><span class="lineno">  298</span>    <span class="comment">// If the key is a valid entry of trie, display it @ top of the suggestions</span></div>
 <div class="line"><span class="lineno">  299</span>    <span class="keywordflow">if</span> (cur_pos-&gt;endOfWord) {</div>
-<div class="line"><span class="lineno">  300</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; key &lt;&lt; <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">  300</span>        std::cout &lt;&lt; key &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  301</span>        (cur_pos-&gt;frequency)++;</div>
 <div class="line"><span class="lineno">  302</span>    }</div>
 <div class="line"><span class="lineno">  303</span> </div>
@@ -706,17 +714,12 @@ false if the key is not found </dd></dl>
 <div class="line"><span class="lineno">  306</span>    <span class="comment">// Call for suggestions when the search key is present as an entry/a prefix</span></div>
 <div class="line"><span class="lineno">  307</span>    <span class="comment">// in the trie</span></div>
 <div class="line"><span class="lineno">  308</span>    <a class="code hl_function" href="#a097913c4badec2b60d50a171ecc299fe">SuggestAutocomplete</a>(cur_pos, prefix);</div>
-<div class="line"><span class="lineno">  309</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;- - - - - - - - - - - - - - - - - - - - - - - - - - &quot;</span></div>
-<div class="line"><span class="lineno">  310</span>              &lt;&lt; <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">  309</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;- - - - - - - - - - - - - - - - - - - - - - - - - - &quot;</span></div>
+<div class="line"><span class="lineno">  310</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  311</span>    <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  312</span>}</div>
-<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_a097913c4badec2b60d50a171ecc299fe"><div class="ttname"><a href="#a097913c4badec2b60d50a171ecc299fe">operations_on_datastructures::trie_operations::Tnode::SuggestAutocomplete</a></div><div class="ttdeci">void SuggestAutocomplete(Tnode *new_root, const std::string &amp;prefix)</div><div class="ttdoc">Recursive function to suggest all the entries of trie which have a given common prefix.</div><div class="ttdef"><b>Definition</b> trie_multiple_search.cpp:249</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a18b70172ca4fb2811dbfb9a86e48b34c_cgraph.svg" width="563" height="111"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_a097913c4badec2b60d50a171ecc299fe"><div class="ttname"><a href="#a097913c4badec2b60d50a171ecc299fe">operations_on_datastructures::trie_operations::Tnode::SuggestAutocomplete</a></div><div class="ttdeci">void SuggestAutocomplete(Tnode *new_root, const std::string &amp;prefix)</div><div class="ttdoc">Recursive function to suggest all the entries of trie which have a given common prefix.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/def/trie__multiple__search_8cpp_source.html#l00249">trie_multiple_search.cpp:249</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aacafb8c9f3ebac7ac6c01d9645bb67b6" name="aacafb8c9f3ebac7ac6c01d9645bb67b6"></a>
@@ -728,7 +731,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void operations_on_datastructures::trie_operations::Tnode::SelectionTop_3 </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>suggestions</em></span></td><td>)</td>
+          <td class="paramtype">std::priority_queue&lt; std::pair&lt; int, std::string &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>suggestions</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -741,23 +744,18 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00320">320</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  321</span>                                                              {</div>
 <div class="line"><span class="lineno">  322</span>    <span class="comment">// Display Either top 3 or total number of suggestions, whichever is smaller</span></div>
-<div class="line"><span class="lineno">  323</span>    <span class="keywordtype">int</span> n = suggestions-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/size.html">size</a>(), Top = 0;</div>
+<div class="line"><span class="lineno">  323</span>    <span class="keywordtype">int</span> n = suggestions-&gt;size(), Top = 0;</div>
 <div class="line"><span class="lineno">  324</span>    Top = n &lt; 3 ? n : 3;</div>
 <div class="line"><span class="lineno">  325</span>    <span class="keywordflow">while</span> (Top--) {</div>
-<div class="line"><span class="lineno">  326</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; suggestions-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html">top</a>().second &lt;&lt; <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">  327</span>        suggestions-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/pop.html">pop</a>();</div>
+<div class="line"><span class="lineno">  326</span>        std::cout &lt;&lt; suggestions-&gt;top().second &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  327</span>        suggestions-&gt;pop();</div>
 <div class="line"><span class="lineno">  328</span>    }</div>
 <div class="line"><span class="lineno">  329</span>}</div>
-<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue/pop.html">std::priority_queue::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
-<div class="ttc" id="atop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html">std::priority_queue::top</a></div><div class="ttdeci">T top(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aacafb8c9f3ebac7ac6c01d9645bb67b6_cgraph.svg" width="323" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a097913c4badec2b60d50a171ecc299fe" name="a097913c4badec2b60d50a171ecc299fe"></a>
@@ -774,7 +772,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>prefix</em></span>&#160;)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>prefix</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -787,6 +785,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00249">249</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  249</span>                                                                        {</div>
 <div class="line"><span class="lineno">  250</span>    <span class="comment">// Iterate through all 26 nodes as we have to print all strings with the</span></div>
 <div class="line"><span class="lineno">  251</span>    <span class="comment">// given prefix</span></div>
@@ -796,19 +796,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  255</span>            <span class="comment">// Print the sugestion only if it&#39;s a valid complete entry and not</span></div>
 <div class="line"><span class="lineno">  256</span>            <span class="comment">// just a prefix</span></div>
 <div class="line"><span class="lineno">  257</span>            <span class="keywordflow">if</span> (new_root-&gt;english[i]-&gt;endOfWord) {</div>
-<div class="line"><span class="lineno">  258</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; prefix + char(i + 97) &lt;&lt; <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">  258</span>                std::cout &lt;&lt; prefix + char(i + 97) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  259</span>            }</div>
 <div class="line"><span class="lineno">  260</span> </div>
 <div class="line"><span class="lineno">  261</span>            <a class="code hl_function" href="#a097913c4badec2b60d50a171ecc299fe">SuggestAutocomplete</a>(new_root-&gt;english[i], prefix + <span class="keywordtype">char</span>(i + 97));</div>
 <div class="line"><span class="lineno">  262</span>        }</div>
 <div class="line"><span class="lineno">  263</span>    }</div>
 <div class="line"><span class="lineno">  264</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a097913c4badec2b60d50a171ecc299fe_cgraph.svg" width="323" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a9e556f52c837190ecf4265b1f05cfe9c" name="a9e556f52c837190ecf4265b1f05cfe9c"></a>
@@ -825,12 +820,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>prefix</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>prefix</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>suggestions</em></span>&#160;)</td>
+          <td class="paramtype">std::priority_queue&lt; std::pair&lt; int, std::string &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>suggestions</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -844,6 +839,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00340">340</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  342</span>                                                              {</div>
 <div class="line"><span class="lineno">  343</span>    <span class="keywordtype">int</span> i = 0;</div>
 <div class="line"><span class="lineno">  344</span>    <span class="keywordflow">for</span> (i = 0; i &lt; ENGLISH_ALPHABET_SIZE; i++) {</div>
@@ -851,7 +848,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  346</span>            <span class="comment">// Add to sugestions only if it&#39;s a valid complete entry and not</span></div>
 <div class="line"><span class="lineno">  347</span>            <span class="comment">// just a prefix</span></div>
 <div class="line"><span class="lineno">  348</span>            <span class="keywordflow">if</span> (new_root-&gt;english[i]-&gt;endOfWord) {</div>
-<div class="line"><span class="lineno">  349</span>                suggestions-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html">push</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
+<div class="line"><span class="lineno">  349</span>                suggestions-&gt;push(std::make_pair(</div>
 <div class="line"><span class="lineno">  350</span>                    new_root-&gt;english[i]-&gt;frequency, prefix + <span class="keywordtype">char</span>(i + 97)));</div>
 <div class="line"><span class="lineno">  351</span>            }</div>
 <div class="line"><span class="lineno">  352</span> </div>
@@ -860,18 +857,108 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  355</span>        }</div>
 <div class="line"><span class="lineno">  356</span>    }</div>
 <div class="line"><span class="lineno">  357</span>}</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="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html">std::priority_queue::push</a></div><div class="ttdeci">T push(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a9e556f52c837190ecf4265b1f05cfe9c_cgraph.svg" width="359" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="afa9dab736046a4140e94bb9104074cd6" name="afa9dab736046a4140e94bb9104074cd6"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#afa9dab736046a4140e94bb9104074cd6">&#9670;&#160;</a></span>endOfWord</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">bool operations_on_datastructures::trie_operations::Tnode::endOfWord</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
+
+</div>
+</div>
+<a id="aa4aac1c6bed58a84472906b63f20da83" name="aa4aac1c6bed58a84472906b63f20da83"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aa4aac1c6bed58a84472906b63f20da83">&#9670;&#160;</a></span>english</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;<a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *&gt; operations_on_datastructures::trie_operations::Tnode::english</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a0f310c3d4d7b82e5ee1036771cade702" name="a0f310c3d4d7b82e5ee1036771cade702"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a0f310c3d4d7b82e5ee1036771cade702">&#9670;&#160;</a></span>ENGLISH_ALPHABET_SIZE</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">uint8_t operations_on_datastructures::trie_operations::Tnode::ENGLISH_ALPHABET_SIZE = 26</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">static</span><span class="mlabel">constexpr</span><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a7bab9bb47215cd674471c94b0b448014" name="a7bab9bb47215cd674471c94b0b448014"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a7bab9bb47215cd674471c94b0b448014">&#9670;&#160;</a></span>frequency</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">uint32_t operations_on_datastructures::trie_operations::Tnode::frequency</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>operations_on_datastructures/<a class="el" href="../../d7/def/trie__multiple__search_8cpp.html">trie_multiple_search.cpp</a></li>
+<li>operations_on_datastructures/<a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a097913c4badec2b60d50a171ecc299fe_cgraph.map b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a097913c4badec2b60d50a171ecc299fe_cgraph.map
deleted file mode 100644
index 30be018ec..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a097913c4badec2b60d50a171ecc299fe_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="operations_on_datastructures::trie_operations::Tnode::SuggestAutocomplete" name="operations_on_datastructures::trie_operations::Tnode::SuggestAutocomplete">
-<area shape="rect" id="Node000001" title="Recursive function to suggest all the entries of trie which have a given common prefix." alt="" coords="5,29,198,85"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="66,29,66,19,73,10,84,5,102,3,121,5,132,12,130,17,119,10,101,8,86,10,76,14,71,21,71,29"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="246,44,317,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="198,54,230,54,230,60,198,60"/>
-</map>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a097913c4badec2b60d50a171ecc299fe_cgraph.md5 b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a097913c4badec2b60d50a171ecc299fe_cgraph.md5
deleted file mode 100644
index c0ecf18ae..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a097913c4badec2b60d50a171ecc299fe_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e846a0099cc09521d807890d78f1b890
\ No newline at end of file
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a097913c4badec2b60d50a171ecc299fe_cgraph.svg b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a097913c4badec2b60d50a171ecc299fe_cgraph.svg
deleted file mode 100644
index 33259fa6e..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a097913c4badec2b60d50a171ecc299fe_cgraph.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::trie_operations::Tnode::SuggestAutocomplete Pages: 1 -->
-<svg width="242pt" height="68pt"
- viewBox="0.00 0.00 241.75 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>operations_on_datastructures::trie_operations::Tnode::SuggestAutocomplete</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to suggest all the entries of trie which have a given common prefix.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SuggestAutocomplete</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47.23,-42.07C44.86,-51.55 53.16,-59.75 72.12,-59.75 83.09,-59.75 90.49,-57.01 94.32,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.63,-54.09 96.65,-43.54 90.83,-52.39 97.63,-54.09"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.75,-30.5 180.25,-30.5 180.25,-11.25 233.75,-11.25 233.75,-30.5"/>
-<text text-anchor="middle" x="207" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.62,-20.88C152.92,-20.88 161.12,-20.88 168.69,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.48,-24.38 178.48,-20.88 168.48,-17.38 168.48,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a097913c4badec2b60d50a171ecc299fe_cgraph_org.svg b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a097913c4badec2b60d50a171ecc299fe_cgraph_org.svg
deleted file mode 100644
index e1b050b30..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a097913c4badec2b60d50a171ecc299fe_cgraph_org.svg
+++ /dev/null
@@ -1,50 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::trie_operations::Tnode::SuggestAutocomplete Pages: 1 -->
-<svg width="242pt" height="68pt"
- viewBox="0.00 0.00 241.75 67.75" 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 63.75)">
-<title>operations_on_datastructures::trie_operations::Tnode::SuggestAutocomplete</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to suggest all the entries of trie which have a given common prefix.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SuggestAutocomplete</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47.23,-42.07C44.86,-51.55 53.16,-59.75 72.12,-59.75 83.09,-59.75 90.49,-57.01 94.32,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.63,-54.09 96.65,-43.54 90.83,-52.39 97.63,-54.09"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.75,-30.5 180.25,-30.5 180.25,-11.25 233.75,-11.25 233.75,-30.5"/>
-<text text-anchor="middle" x="207" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.62,-20.88C152.92,-20.88 161.12,-20.88 168.69,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.48,-24.38 178.48,-20.88 168.48,-17.38 168.48,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a18b70172ca4fb2811dbfb9a86e48b34c_cgraph.map b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a18b70172ca4fb2811dbfb9a86e48b34c_cgraph.map
deleted file mode 100644
index a8d43e174..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a18b70172ca4fb2811dbfb9a86e48b34c_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="operations_on_datastructures::trie_operations::Tnode::SearchSuggestions" name="operations_on_datastructures::trie_operations::Tnode::SearchSuggestions">
-<area shape="rect" id="Node000001" title="Lists out all the words in trie with the longest prefix of the search key that is present in the trie..." alt="" coords="5,5,198,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="486,20,557,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="198,15,245,11,342,4,438,11,471,16,470,22,438,16,342,10,246,16,199,21"/>
-<area shape="rect" id="Node000003" href="$d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe" title="Recursive function to suggest all the entries of trie which have a given common prefix." alt="" coords="246,49,438,105"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="199,48,231,54,230,59,198,53"/>
-<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="438,51,470,43,472,48,439,56"/>
-<area shape="poly" id="edge4_Node000003_Node000003" title=" " alt="" coords="306,49,306,39,313,30,325,25,342,23,361,25,373,32,370,37,359,30,342,28,326,30,316,34,311,41,311,49"/>
-</map>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a18b70172ca4fb2811dbfb9a86e48b34c_cgraph.md5 b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a18b70172ca4fb2811dbfb9a86e48b34c_cgraph.md5
deleted file mode 100644
index 83dba592f..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a18b70172ca4fb2811dbfb9a86e48b34c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2eac0ae3ca6e1ef8ef566f68728e7800
\ No newline at end of file
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a18b70172ca4fb2811dbfb9a86e48b34c_cgraph.svg b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a18b70172ca4fb2811dbfb9a86e48b34c_cgraph.svg
deleted file mode 100644
index 9abfc6604..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a18b70172ca4fb2811dbfb9a86e48b34c_cgraph.svg
+++ /dev/null
@@ -1,105 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::trie_operations::Tnode::SearchSuggestions Pages: 1 -->
-<svg width="422pt" height="83pt"
- viewBox="0.00 0.00 422.00 82.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.75)">
-<title>operations_on_datastructures::trie_operations::Tnode::SearchSuggestions</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Lists out all the words in trie with the longest prefix of the search key that is present in the trie...">
-<polygon fill="#999999" stroke="#666666" points="144.25,-74.75 0,-74.75 0,-33 144.25,-33 144.25,-74.75"/>
-<text text-anchor="start" x="8" y="-61.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-50" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="72.12" y="-38.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SearchSuggestions</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="414,-63.5 360.5,-63.5 360.5,-44.25 414,-44.25 414,-63.5"/>
-<text text-anchor="middle" x="387.25" y="-50" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.72,-65.3C156.56,-66.79 168.73,-68.07 180.25,-68.88 244.21,-73.33 260.84,-76.5 324.5,-68.88 332.54,-67.91 341.05,-66.27 349.09,-64.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="349.72,-67.86 358.59,-62.06 348.04,-61.07 349.72,-67.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe" target="_top" xlink:title="Recursive function to suggest all the entries of trie which have a given common prefix.">
-<polygon fill="white" stroke="#666666" points="324.5,-41.75 180.25,-41.75 180.25,0 324.5,0 324.5,-41.75"/>
-<text text-anchor="start" x="188.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SuggestAutocomplete</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-40.64C152.5,-39.18 160.59,-37.68 168.61,-36.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.2,-39.65 178.4,-34.39 167.93,-32.76 169.2,-39.65"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.87,-38.63C333.27,-40.72 341.57,-42.78 349.21,-44.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.22,-48.04 358.77,-47.05 349.91,-41.24 348.22,-48.04"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M227.48,-42.07C225.11,-51.55 233.41,-59.75 252.38,-59.75 263.34,-59.75 270.74,-57.01 274.57,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.88,-54.09 276.9,-43.54 271.08,-52.39 277.88,-54.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a18b70172ca4fb2811dbfb9a86e48b34c_cgraph_org.svg b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a18b70172ca4fb2811dbfb9a86e48b34c_cgraph_org.svg
deleted file mode 100644
index b0a34c6f5..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a18b70172ca4fb2811dbfb9a86e48b34c_cgraph_org.svg
+++ /dev/null
@@ -1,79 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::trie_operations::Tnode::SearchSuggestions Pages: 1 -->
-<svg width="422pt" height="83pt"
- viewBox="0.00 0.00 422.00 82.75" 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 78.75)">
-<title>operations_on_datastructures::trie_operations::Tnode::SearchSuggestions</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Lists out all the words in trie with the longest prefix of the search key that is present in the trie...">
-<polygon fill="#999999" stroke="#666666" points="144.25,-74.75 0,-74.75 0,-33 144.25,-33 144.25,-74.75"/>
-<text text-anchor="start" x="8" y="-61.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-50" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="72.12" y="-38.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SearchSuggestions</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="414,-63.5 360.5,-63.5 360.5,-44.25 414,-44.25 414,-63.5"/>
-<text text-anchor="middle" x="387.25" y="-50" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.72,-65.3C156.56,-66.79 168.73,-68.07 180.25,-68.88 244.21,-73.33 260.84,-76.5 324.5,-68.88 332.54,-67.91 341.05,-66.27 349.09,-64.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="349.72,-67.86 358.59,-62.06 348.04,-61.07 349.72,-67.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe" target="_top" xlink:title="Recursive function to suggest all the entries of trie which have a given common prefix.">
-<polygon fill="white" stroke="#666666" points="324.5,-41.75 180.25,-41.75 180.25,0 324.5,0 324.5,-41.75"/>
-<text text-anchor="start" x="188.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SuggestAutocomplete</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-40.64C152.5,-39.18 160.59,-37.68 168.61,-36.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.2,-39.65 178.4,-34.39 167.93,-32.76 169.2,-39.65"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.87,-38.63C333.27,-40.72 341.57,-42.78 349.21,-44.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.22,-48.04 358.77,-47.05 349.91,-41.24 348.22,-48.04"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M227.48,-42.07C225.11,-51.55 233.41,-59.75 252.38,-59.75 263.34,-59.75 270.74,-57.01 274.57,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.88,-54.09 276.9,-43.54 271.08,-52.39 277.88,-54.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a7c5ab271d8042540f64ef16d259d1503_cgraph.map b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a7c5ab271d8042540f64ef16d259d1503_cgraph.map
deleted file mode 100644
index 1caffe4ce..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a7c5ab271d8042540f64ef16d259d1503_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="operations_on_datastructures::trie_operations::Tnode::SearchFreqSuggestions" name="operations_on_datastructures::trie_operations::Tnode::SearchFreqSuggestions">
-<area shape="rect" id="Node000001" title="Lists out the most frequent words in trie with the longest prefix of the search key that is present i..." alt="" coords="5,24,198,79"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="504,7,575,32"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="189,20,245,9,299,3,342,3,438,9,489,12,489,17,438,14,341,9,300,9,246,14,191,26"/>
-<area shape="rect" id="Node000003" href="$d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6" title="Function to display the 3 suggestions with highest frequency of search hits." alt="" coords="246,24,438,79"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="198,49,230,49,230,54,198,54"/>
-<area shape="rect" id="Node000004" href="$d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c" title="Recursive function to suggest most frequently searched entries of trie which have a given common pref..." alt="" coords="246,128,438,183"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="169,78,263,119,261,124,167,82"/>
-<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="438,33,488,25,489,30,439,39"/>
-<area shape="poly" id="edge6_Node000004_Node000004" title=" " alt="" coords="303,127,303,117,310,109,323,103,342,101,363,104,376,111,373,115,361,109,342,106,325,108,313,113,308,119,308,127"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="486,143,593,168"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="438,153,470,153,470,158,438,158"/>
-</map>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a7c5ab271d8042540f64ef16d259d1503_cgraph.md5 b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a7c5ab271d8042540f64ef16d259d1503_cgraph.md5
deleted file mode 100644
index 803e7c0ee..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a7c5ab271d8042540f64ef16d259d1503_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3a22a970b23ca4cdbae137d2ff04bad9
\ No newline at end of file
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a7c5ab271d8042540f64ef16d259d1503_cgraph.svg b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a7c5ab271d8042540f64ef16d259d1503_cgraph.svg
deleted file mode 100644
index c68a83f6c..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a7c5ab271d8042540f64ef16d259d1503_cgraph.svg
+++ /dev/null
@@ -1,143 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::trie_operations::Tnode::SearchFreqSuggestions Pages: 1 -->
-<svg width="449pt" height="142pt"
- viewBox="0.00 0.00 449.00 141.52" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 137.52)">
-<title>operations_on_datastructures::trie_operations::Tnode::SearchFreqSuggestions</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Lists out the most frequent words in trie with the longest prefix of the search key that is present i...">
-<polygon fill="#999999" stroke="#666666" points="144.25,-119.75 0,-119.75 0,-78 144.25,-78 144.25,-119.75"/>
-<text text-anchor="start" x="8" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="72.12" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SearchFreqSuggestions</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="427.5,-132.5 374,-132.5 374,-113.25 427.5,-113.25 427.5,-132.5"/>
-<text text-anchor="middle" x="400.75" y="-119" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.53,-120.23C152.17,-123.83 166.57,-127 180.25,-128.88 243.76,-137.6 260.44,-131.42 324.5,-128.88 336.9,-128.38 350.43,-127.43 362.55,-126.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="362.49,-129.95 372.15,-125.6 361.89,-122.98 362.49,-129.95"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6" target="_top" xlink:title="Function to display the 3 suggestions with highest frequency of search hits.">
-<polygon fill="white" stroke="#666666" points="324.5,-119.75 180.25,-119.75 180.25,-78 324.5,-78 324.5,-119.75"/>
-<text text-anchor="start" x="188.25" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="252.38" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SelectionTop_3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-98.88C152.5,-98.88 160.59,-98.88 168.61,-98.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.37,-102.38 178.37,-98.88 168.37,-95.38 168.37,-102.38"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c" target="_top" xlink:title="Recursive function to suggest most frequently searched entries of trie which have a given common pref...">
-<polygon fill="white" stroke="#666666" points="324.5,-41.75 180.25,-41.75 180.25,0 324.5,0 324.5,-41.75"/>
-<text text-anchor="start" x="188.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SuggestFreqAutocomplete</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.83,-77.56C143.64,-68.02 169.55,-56.68 192.45,-46.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="193.58,-49.99 201.34,-42.77 190.78,-43.57 193.58,-49.99"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.85,-110.59C337.77,-112.71 350.77,-114.84 362.23,-116.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="361.61,-120.17 372.05,-118.33 362.74,-113.26 361.61,-120.17"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge6_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge6_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.99,-42.07C222.38,-51.55 231.51,-59.75 252.38,-59.75 264.44,-59.75 272.58,-57.01 276.79,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="280.09,-54.1 279.36,-43.53 273.34,-52.24 280.09,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441,-30.5 360.5,-30.5 360.5,-11.25 441,-11.25 441,-30.5"/>
-<text text-anchor="middle" x="400.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.85,-20.88C332.94,-20.88 341.07,-20.88 348.82,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.75,-24.38 358.75,-20.88 348.75,-17.38 348.75,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a7c5ab271d8042540f64ef16d259d1503_cgraph_org.svg b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a7c5ab271d8042540f64ef16d259d1503_cgraph_org.svg
deleted file mode 100644
index 2d29bd6f5..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a7c5ab271d8042540f64ef16d259d1503_cgraph_org.svg
+++ /dev/null
@@ -1,117 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::trie_operations::Tnode::SearchFreqSuggestions Pages: 1 -->
-<svg width="449pt" height="142pt"
- viewBox="0.00 0.00 449.00 141.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 137.52)">
-<title>operations_on_datastructures::trie_operations::Tnode::SearchFreqSuggestions</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Lists out the most frequent words in trie with the longest prefix of the search key that is present i...">
-<polygon fill="#999999" stroke="#666666" points="144.25,-119.75 0,-119.75 0,-78 144.25,-78 144.25,-119.75"/>
-<text text-anchor="start" x="8" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="72.12" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SearchFreqSuggestions</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="427.5,-132.5 374,-132.5 374,-113.25 427.5,-113.25 427.5,-132.5"/>
-<text text-anchor="middle" x="400.75" y="-119" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.53,-120.23C152.17,-123.83 166.57,-127 180.25,-128.88 243.76,-137.6 260.44,-131.42 324.5,-128.88 336.9,-128.38 350.43,-127.43 362.55,-126.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="362.49,-129.95 372.15,-125.6 361.89,-122.98 362.49,-129.95"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6" target="_top" xlink:title="Function to display the 3 suggestions with highest frequency of search hits.">
-<polygon fill="white" stroke="#666666" points="324.5,-119.75 180.25,-119.75 180.25,-78 324.5,-78 324.5,-119.75"/>
-<text text-anchor="start" x="188.25" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="252.38" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SelectionTop_3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-98.88C152.5,-98.88 160.59,-98.88 168.61,-98.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.37,-102.38 178.37,-98.88 168.37,-95.38 168.37,-102.38"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c" target="_top" xlink:title="Recursive function to suggest most frequently searched entries of trie which have a given common pref...">
-<polygon fill="white" stroke="#666666" points="324.5,-41.75 180.25,-41.75 180.25,0 324.5,0 324.5,-41.75"/>
-<text text-anchor="start" x="188.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SuggestFreqAutocomplete</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.83,-77.56C143.64,-68.02 169.55,-56.68 192.45,-46.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="193.58,-49.99 201.34,-42.77 190.78,-43.57 193.58,-49.99"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.85,-110.59C337.77,-112.71 350.77,-114.84 362.23,-116.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="361.61,-120.17 372.05,-118.33 362.74,-113.26 361.61,-120.17"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge6_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge6_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.99,-42.07C222.38,-51.55 231.51,-59.75 252.38,-59.75 264.44,-59.75 272.58,-57.01 276.79,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="280.09,-54.1 279.36,-43.53 273.34,-52.24 280.09,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441,-30.5 360.5,-30.5 360.5,-11.25 441,-11.25 441,-30.5"/>
-<text text-anchor="middle" x="400.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.85,-20.88C332.94,-20.88 341.07,-20.88 348.82,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.75,-24.38 358.75,-20.88 348.75,-17.38 348.75,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a9e556f52c837190ecf4265b1f05cfe9c_cgraph.map b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a9e556f52c837190ecf4265b1f05cfe9c_cgraph.map
deleted file mode 100644
index c1c5f7ed9..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a9e556f52c837190ecf4265b1f05cfe9c_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="operations_on_datastructures::trie_operations::Tnode::SuggestFreqAutocomplete" name="operations_on_datastructures::trie_operations::Tnode::SuggestFreqAutocomplete">
-<area shape="rect" id="Node000001" title="Recursive function to suggest most frequently searched entries of trie which have a given common pref..." alt="" coords="5,29,198,85"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="62,29,63,19,70,10,83,5,102,3,123,5,135,12,133,17,121,10,101,8,84,10,73,15,68,21,68,29"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="246,44,353,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="198,54,230,54,230,60,198,60"/>
-</map>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a9e556f52c837190ecf4265b1f05cfe9c_cgraph.md5 b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a9e556f52c837190ecf4265b1f05cfe9c_cgraph.md5
deleted file mode 100644
index 0d19689cd..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a9e556f52c837190ecf4265b1f05cfe9c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1c248829316869cbdcf46c31c58ddcc1
\ No newline at end of file
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a9e556f52c837190ecf4265b1f05cfe9c_cgraph.svg b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a9e556f52c837190ecf4265b1f05cfe9c_cgraph.svg
deleted file mode 100644
index 9bb980362..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a9e556f52c837190ecf4265b1f05cfe9c_cgraph.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::trie_operations::Tnode::SuggestFreqAutocomplete Pages: 1 -->
-<svg width="269pt" height="68pt"
- viewBox="0.00 0.00 268.75 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>operations_on_datastructures::trie_operations::Tnode::SuggestFreqAutocomplete</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to suggest most frequently searched entries of trie which have a given common pref...">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SuggestFreqAutocomplete</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44.74,-42.07C42.13,-51.55 51.26,-59.75 72.12,-59.75 84.19,-59.75 92.33,-57.01 96.54,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.84,-54.1 99.11,-43.53 93.09,-52.24 99.84,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.75,-30.5 180.25,-30.5 180.25,-11.25 260.75,-11.25 260.75,-30.5"/>
-<text text-anchor="middle" x="220.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-20.88C152.69,-20.88 160.82,-20.88 168.57,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.5,-24.38 178.5,-20.88 168.5,-17.38 168.5,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a9e556f52c837190ecf4265b1f05cfe9c_cgraph_org.svg b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a9e556f52c837190ecf4265b1f05cfe9c_cgraph_org.svg
deleted file mode 100644
index 2bf860cc1..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_a9e556f52c837190ecf4265b1f05cfe9c_cgraph_org.svg
+++ /dev/null
@@ -1,50 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::trie_operations::Tnode::SuggestFreqAutocomplete Pages: 1 -->
-<svg width="269pt" height="68pt"
- viewBox="0.00 0.00 268.75 67.75" 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 63.75)">
-<title>operations_on_datastructures::trie_operations::Tnode::SuggestFreqAutocomplete</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to suggest most frequently searched entries of trie which have a given common pref...">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SuggestFreqAutocomplete</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44.74,-42.07C42.13,-51.55 51.26,-59.75 72.12,-59.75 84.19,-59.75 92.33,-57.01 96.54,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.84,-54.1 99.11,-43.53 93.09,-52.24 99.84,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.75,-30.5 180.25,-30.5 180.25,-11.25 260.75,-11.25 260.75,-30.5"/>
-<text text-anchor="middle" x="220.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-20.88C152.69,-20.88 160.82,-20.88 168.57,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.5,-24.38 178.5,-20.88 168.5,-17.38 168.5,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aacafb8c9f3ebac7ac6c01d9645bb67b6_cgraph.map b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aacafb8c9f3ebac7ac6c01d9645bb67b6_cgraph.map
deleted file mode 100644
index b71d06218..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aacafb8c9f3ebac7ac6c01d9645bb67b6_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="operations_on_datastructures::trie_operations::Tnode::SelectionTop_3" name="operations_on_datastructures::trie_operations::Tnode::SelectionTop_3">
-<area shape="rect" id="Node000001" title="Function to display the 3 suggestions with highest frequency of search hits." alt="" coords="5,5,198,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="246,20,317,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="198,30,230,30,230,36,198,36"/>
-</map>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aacafb8c9f3ebac7ac6c01d9645bb67b6_cgraph.md5 b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aacafb8c9f3ebac7ac6c01d9645bb67b6_cgraph.md5
deleted file mode 100644
index 9f1b32ce5..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aacafb8c9f3ebac7ac6c01d9645bb67b6_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c808fde6c81ce18a693f47fb938efdae
\ No newline at end of file
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aacafb8c9f3ebac7ac6c01d9645bb67b6_cgraph.svg b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aacafb8c9f3ebac7ac6c01d9645bb67b6_cgraph.svg
deleted file mode 100644
index db5468ef4..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aacafb8c9f3ebac7ac6c01d9645bb67b6_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::trie_operations::Tnode::SelectionTop_3 Pages: 1 -->
-<svg width="242pt" height="50pt"
- viewBox="0.00 0.00 241.75 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>operations_on_datastructures::trie_operations::Tnode::SelectionTop_3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to display the 3 suggestions with highest frequency of search hits.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SelectionTop_3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.75,-30.5 180.25,-30.5 180.25,-11.25 233.75,-11.25 233.75,-30.5"/>
-<text text-anchor="middle" x="207" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.62,-20.88C152.92,-20.88 161.12,-20.88 168.69,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.48,-24.38 178.48,-20.88 168.48,-17.38 168.48,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aacafb8c9f3ebac7ac6c01d9645bb67b6_cgraph_org.svg b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aacafb8c9f3ebac7ac6c01d9645bb67b6_cgraph_org.svg
deleted file mode 100644
index f6ceffba8..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aacafb8c9f3ebac7ac6c01d9645bb67b6_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::trie_operations::Tnode::SelectionTop_3 Pages: 1 -->
-<svg width="242pt" height="50pt"
- viewBox="0.00 0.00 241.75 49.75" 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.75)">
-<title>operations_on_datastructures::trie_operations::Tnode::SelectionTop_3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to display the 3 suggestions with highest frequency of search hits.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SelectionTop_3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.75,-30.5 180.25,-30.5 180.25,-11.25 233.75,-11.25 233.75,-30.5"/>
-<text text-anchor="middle" x="207" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.62,-20.88C152.92,-20.88 161.12,-20.88 168.69,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.48,-24.38 178.48,-20.88 168.48,-17.38 168.48,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_adef6940391f981ab86767775176b7169_cgraph.map b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_adef6940391f981ab86767775176b7169_cgraph.map
deleted file mode 100644
index 03ca81ec8..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_adef6940391f981ab86767775176b7169_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="operations_on_datastructures::trie_operations::Tnode::DeleteFrom" name="operations_on_datastructures::trie_operations::Tnode::DeleteFrom">
-<area shape="rect" id="Node000001" title="Function recursively deletes the substring character by character iterating through the string to be ..." alt="" coords="5,29,198,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="62,29,62,19,70,10,83,5,102,3,123,5,136,12,133,17,121,10,101,8,84,10,73,15,67,21,67,29"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="246,44,357,70"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="198,54,230,54,230,60,198,60"/>
-</map>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_adef6940391f981ab86767775176b7169_cgraph.md5 b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_adef6940391f981ab86767775176b7169_cgraph.md5
deleted file mode 100644
index afa8d7c5f..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_adef6940391f981ab86767775176b7169_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8d8c3f8d8d6e2fe5519c29cfdede2379
\ No newline at end of file
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_adef6940391f981ab86767775176b7169_cgraph.svg b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_adef6940391f981ab86767775176b7169_cgraph.svg
deleted file mode 100644
index 35222dd56..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_adef6940391f981ab86767775176b7169_cgraph.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::trie_operations::Tnode::DeleteFrom Pages: 1 -->
-<svg width="272pt" height="68pt"
- viewBox="0.00 0.00 271.75 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>operations_on_datastructures::trie_operations::Tnode::DeleteFrom</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function recursively deletes the substring character by character iterating through the string to be ...">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::DeleteFrom</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44.46,-42.07C41.83,-51.55 51.05,-59.75 72.12,-59.75 84.31,-59.75 92.53,-57.01 96.79,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.08,-54.1 99.38,-43.53 93.34,-52.23 100.08,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263.75,-30.5 180.25,-30.5 180.25,-11.25 263.75,-11.25 263.75,-30.5"/>
-<text text-anchor="middle" x="222" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.46,-20.88C152.51,-20.88 160.59,-20.88 168.34,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.26,-24.38 178.26,-20.88 168.26,-17.38 168.26,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_adef6940391f981ab86767775176b7169_cgraph_org.svg b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_adef6940391f981ab86767775176b7169_cgraph_org.svg
deleted file mode 100644
index cc7c53cf8..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_adef6940391f981ab86767775176b7169_cgraph_org.svg
+++ /dev/null
@@ -1,50 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::trie_operations::Tnode::DeleteFrom Pages: 1 -->
-<svg width="272pt" height="68pt"
- viewBox="0.00 0.00 271.75 67.75" 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 63.75)">
-<title>operations_on_datastructures::trie_operations::Tnode::DeleteFrom</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function recursively deletes the substring character by character iterating through the string to be ...">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::DeleteFrom</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44.46,-42.07C41.83,-51.55 51.05,-59.75 72.12,-59.75 84.31,-59.75 92.53,-57.01 96.79,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.08,-54.1 99.38,-43.53 93.34,-52.23 100.08,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263.75,-30.5 180.25,-30.5 180.25,-11.25 263.75,-11.25 263.75,-30.5"/>
-<text text-anchor="middle" x="222" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.46,-20.88C152.51,-20.88 160.59,-20.88 168.34,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.26,-24.38 178.26,-20.88 168.26,-17.38 168.26,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aefd24626ac47277431c9b8604e064340_cgraph.map b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aefd24626ac47277431c9b8604e064340_cgraph.map
deleted file mode 100644
index 69242bee6..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aefd24626ac47277431c9b8604e064340_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="operations_on_datastructures::trie_operations::Tnode::Delete" name="operations_on_datastructures::trie_operations::Tnode::Delete">
-<area shape="rect" id="Node000001" title="Function to verify presence and hence delete an entry from the trie." alt="" coords="5,120,198,176"/>
-<area shape="rect" id="Node000002" href="$d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169" title="Function recursively deletes the substring character by character iterating through the string to be ..." alt="" coords="246,29,438,85"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="176,117,251,89,253,94,178,122"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="486,78,597,103"/>
-<area shape="poly" id="edge7_Node000001_Node000003" title=" " alt="" coords="198,133,470,97,471,102,199,138"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="306,160,378,186"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="198,155,291,165,291,171,198,161"/>
-<area shape="rect" id="Node000005" href="$d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0" title="Function to count the number of children a node in the trie has." alt="" coords="246,211,438,266"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="178,174,253,202,251,207,176,179"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="302,29,303,19,310,10,323,5,342,3,363,5,376,12,373,17,361,10,342,8,324,10,313,15,308,21,308,29"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="439,71,471,76,470,81,438,76"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/count.html#" title=" " alt="" coords="502,226,581,251"/>
-<area shape="poly" id="edge6_Node000005_Node000006" title=" " alt="" coords="438,236,487,236,487,241,438,241"/>
-</map>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aefd24626ac47277431c9b8604e064340_cgraph.md5 b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aefd24626ac47277431c9b8604e064340_cgraph.md5
deleted file mode 100644
index c4e78db68..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aefd24626ac47277431c9b8604e064340_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a837b5f4b29e5e2b368f04b3e2a638fc
\ No newline at end of file
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aefd24626ac47277431c9b8604e064340_cgraph.svg b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aefd24626ac47277431c9b8604e064340_cgraph.svg
deleted file mode 100644
index f2a03255d..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aefd24626ac47277431c9b8604e064340_cgraph.svg
+++ /dev/null
@@ -1,161 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::trie_operations::Tnode::Delete Pages: 1 -->
-<svg width="452pt" height="204pt"
- viewBox="0.00 0.00 452.00 203.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 199.75)">
-<title>operations_on_datastructures::trie_operations::Tnode::Delete</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to verify presence and hence delete an entry from the trie.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-109.75 0,-109.75 0,-68 144.25,-68 144.25,-109.75"/>
-<text text-anchor="start" x="8" y="-96.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-85" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="72.12" y="-73.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Delete</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169" target="_top" xlink:title="Function recursively deletes the substring character by character iterating through the string to be ...">
-<polygon fill="white" stroke="#666666" points="324.5,-177.75 180.25,-177.75 180.25,-136 324.5,-136 324.5,-177.75"/>
-<text text-anchor="start" x="188.25" y="-164.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-153" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="252.38" y="-141.75" font-family="Helvetica,sans-Serif" font-size="10.00">::DeleteFrom</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.04,-110.2C146.7,-116.94 166.4,-124.46 184.74,-131.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.35,-134.67 193.94,-134.97 185.85,-128.13 183.35,-134.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="444,-141.5 360.5,-141.5 360.5,-122.25 444,-122.25 444,-141.5"/>
-<text text-anchor="middle" x="402.25" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge7_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge7_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.73,-98.26C206.34,-106.33 293.79,-117.79 349.01,-125.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.41,-128.48 358.78,-126.31 349.32,-121.54 348.41,-128.48"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279.12,-79.5 225.62,-79.5 225.62,-60.25 279.12,-60.25 279.12,-79.5"/>
-<text text-anchor="middle" x="252.38" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-81.26C168.4,-78.72 193.96,-76 214.1,-73.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.2,-77.36 223.77,-72.82 213.45,-70.4 214.2,-77.36"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0" target="_top" xlink:title="Function to count the number of children a node in the trie has.">
-<polygon fill="white" stroke="#666666" points="324.5,-41.75 180.25,-41.75 180.25,0 324.5,0 324.5,-41.75"/>
-<text text-anchor="start" x="188.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::numberOfChildren</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.04,-67.55C146.7,-60.81 166.4,-53.29 184.74,-46.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.85,-49.62 193.94,-42.78 183.35,-43.08 185.85,-49.62"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.71,-178.07C222.08,-187.55 231.3,-195.75 252.38,-195.75 264.56,-195.75 272.78,-193.01 277.04,-188.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="280.33,-190.1 279.63,-179.53 273.59,-188.23 280.33,-190.1"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.71,-144.81C332.85,-143.44 341.03,-142.06 348.86,-140.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="349.26,-144.21 358.54,-139.1 348.09,-137.31 349.26,-144.21"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/count.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="432,-30.5 372.5,-30.5 372.5,-11.25 432,-11.25 432,-30.5"/>
-<text text-anchor="middle" x="402.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::count</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.71,-20.88C337.21,-20.88 349.81,-20.88 361.07,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="360.76,-24.38 370.76,-20.88 360.76,-17.38 360.76,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aefd24626ac47277431c9b8604e064340_cgraph_org.svg b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aefd24626ac47277431c9b8604e064340_cgraph_org.svg
deleted file mode 100644
index c744d585a..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_aefd24626ac47277431c9b8604e064340_cgraph_org.svg
+++ /dev/null
@@ -1,135 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::trie_operations::Tnode::Delete Pages: 1 -->
-<svg width="452pt" height="204pt"
- viewBox="0.00 0.00 452.00 203.75" 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 199.75)">
-<title>operations_on_datastructures::trie_operations::Tnode::Delete</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to verify presence and hence delete an entry from the trie.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-109.75 0,-109.75 0,-68 144.25,-68 144.25,-109.75"/>
-<text text-anchor="start" x="8" y="-96.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-85" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="72.12" y="-73.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Delete</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169" target="_top" xlink:title="Function recursively deletes the substring character by character iterating through the string to be ...">
-<polygon fill="white" stroke="#666666" points="324.5,-177.75 180.25,-177.75 180.25,-136 324.5,-136 324.5,-177.75"/>
-<text text-anchor="start" x="188.25" y="-164.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-153" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="252.38" y="-141.75" font-family="Helvetica,sans-Serif" font-size="10.00">::DeleteFrom</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.04,-110.2C146.7,-116.94 166.4,-124.46 184.74,-131.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.35,-134.67 193.94,-134.97 185.85,-128.13 183.35,-134.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="444,-141.5 360.5,-141.5 360.5,-122.25 444,-122.25 444,-141.5"/>
-<text text-anchor="middle" x="402.25" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge7_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge7_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.73,-98.26C206.34,-106.33 293.79,-117.79 349.01,-125.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.41,-128.48 358.78,-126.31 349.32,-121.54 348.41,-128.48"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279.12,-79.5 225.62,-79.5 225.62,-60.25 279.12,-60.25 279.12,-79.5"/>
-<text text-anchor="middle" x="252.38" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-81.26C168.4,-78.72 193.96,-76 214.1,-73.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.2,-77.36 223.77,-72.82 213.45,-70.4 214.2,-77.36"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0" target="_top" xlink:title="Function to count the number of children a node in the trie has.">
-<polygon fill="white" stroke="#666666" points="324.5,-41.75 180.25,-41.75 180.25,0 324.5,0 324.5,-41.75"/>
-<text text-anchor="start" x="188.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::numberOfChildren</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.04,-67.55C146.7,-60.81 166.4,-53.29 184.74,-46.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.85,-49.62 193.94,-42.78 183.35,-43.08 185.85,-49.62"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.71,-178.07C222.08,-187.55 231.3,-195.75 252.38,-195.75 264.56,-195.75 272.78,-193.01 277.04,-188.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="280.33,-190.1 279.63,-179.53 273.59,-188.23 280.33,-190.1"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.71,-144.81C332.85,-143.44 341.03,-142.06 348.86,-140.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="349.26,-144.21 358.54,-139.1 348.09,-137.31 349.26,-144.21"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/count.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="432,-30.5 372.5,-30.5 372.5,-11.25 432,-11.25 432,-30.5"/>
-<text text-anchor="middle" x="402.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::count</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.71,-20.88C337.21,-20.88 349.81,-20.88 361.07,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="360.76,-24.38 370.76,-20.88 360.76,-17.38 360.76,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_afca808362c13273ca8c8ae7d58e8eee0_cgraph.map b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_afca808362c13273ca8c8ae7d58e8eee0_cgraph.map
deleted file mode 100644
index bcc04ff95..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_afca808362c13273ca8c8ae7d58e8eee0_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="operations_on_datastructures::trie_operations::Tnode::numberOfChildren" name="operations_on_datastructures::trie_operations::Tnode::numberOfChildren">
-<area shape="rect" id="Node000001" title="Function to count the number of children a node in the trie has." alt="" coords="5,5,198,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/count.html#" title=" " alt="" coords="246,20,325,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="198,30,230,30,230,36,198,36"/>
-</map>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_afca808362c13273ca8c8ae7d58e8eee0_cgraph.md5 b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_afca808362c13273ca8c8ae7d58e8eee0_cgraph.md5
deleted file mode 100644
index 396ce2a62..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_afca808362c13273ca8c8ae7d58e8eee0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-def5f7e3dfe39e99ecdb23ef92ae195c
\ No newline at end of file
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_afca808362c13273ca8c8ae7d58e8eee0_cgraph.svg b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_afca808362c13273ca8c8ae7d58e8eee0_cgraph.svg
deleted file mode 100644
index d527c0e87..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_afca808362c13273ca8c8ae7d58e8eee0_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::trie_operations::Tnode::numberOfChildren Pages: 1 -->
-<svg width="248pt" height="50pt"
- viewBox="0.00 0.00 247.75 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>operations_on_datastructures::trie_operations::Tnode::numberOfChildren</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to count the number of children a node in the trie has.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::numberOfChildren</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/count.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="239.75,-30.5 180.25,-30.5 180.25,-11.25 239.75,-11.25 239.75,-30.5"/>
-<text text-anchor="middle" x="210" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::count</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.64,-20.88C152.87,-20.88 161.02,-20.88 168.62,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.52,-24.38 178.52,-20.88 168.52,-17.38 168.52,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_afca808362c13273ca8c8ae7d58e8eee0_cgraph_org.svg b/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_afca808362c13273ca8c8ae7d58e8eee0_cgraph_org.svg
deleted file mode 100644
index ca3a1425f..000000000
--- a/d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode_afca808362c13273ca8c8ae7d58e8eee0_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::trie_operations::Tnode::numberOfChildren Pages: 1 -->
-<svg width="248pt" height="50pt"
- viewBox="0.00 0.00 247.75 49.75" 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.75)">
-<title>operations_on_datastructures::trie_operations::Tnode::numberOfChildren</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to count the number of children a node in the trie has.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::numberOfChildren</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/count.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="239.75,-30.5 180.25,-30.5 180.25,-11.25 239.75,-11.25 239.75,-30.5"/>
-<text text-anchor="middle" x="210" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::count</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.64,-20.88C152.87,-20.88 161.02,-20.88 168.62,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.52,-24.38 178.52,-20.88 168.52,-17.38 168.52,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d61/knapsack_8cpp_source.html b/d0/d61/knapsack_8cpp_source.html
new file mode 100644
index 000000000..f72cf676b
--- /dev/null
+++ b/d0/d61/knapsack_8cpp_source.html
@@ -0,0 +1,219 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: greedy_algorithms/knapsack.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d0/d61/knapsack_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">knapsack.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="foldopen" id="foldopen00004" data-start="{" data-end="};">
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"><a class="line" href="../../db/d66/struct_item.html">    4</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../db/d66/struct_item.html">Item</a> {</div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span>    <span class="keywordtype">int</span> weight;</div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span>    <span class="keywordtype">int</span> profit;</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span>};</div>
+</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="keywordtype">float</span> profitPerUnit(<a class="code hl_struct" href="../../db/d66/struct_item.html">Item</a> x) { <span class="keywordflow">return</span> (<span class="keywordtype">float</span>)x.profit / (float)x.weight; }</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="keywordtype">int</span> partition(<a class="code hl_struct" href="../../db/d66/struct_item.html">Item</a> arr[], <span class="keywordtype">int</span> low, <span class="keywordtype">int</span> high) {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <a class="code hl_struct" href="../../db/d66/struct_item.html">Item</a> pivot = arr[high];  <span class="comment">// pivot</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <span class="keywordtype">int</span> i = (low - 1);       <span class="comment">// Index of smaller element</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = low; j &lt; high; j++) {</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>        <span class="comment">// If current element is smaller than or</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>        <span class="comment">// equal to pivot</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        <span class="keywordflow">if</span> (profitPerUnit(arr[j]) &lt;= profitPerUnit(pivot)) {</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>            i++;  <span class="comment">// increment index of smaller element</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>            <a class="code hl_struct" href="../../db/d66/struct_item.html">Item</a> temp = arr[i];</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>            arr[i] = arr[j];</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>            arr[j] = temp;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        }</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    }</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <a class="code hl_struct" href="../../db/d66/struct_item.html">Item</a> temp = arr[i + 1];</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    arr[i + 1] = arr[high];</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    arr[high] = temp;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="keywordflow">return</span> (i + 1);</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>}</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keywordtype">void</span> quickSort(<a class="code hl_struct" href="../../db/d66/struct_item.html">Item</a> arr[], <span class="keywordtype">int</span> low, <span class="keywordtype">int</span> high) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordflow">if</span> (low &lt; high) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        <span class="keywordtype">int</span> p = partition(arr, low, high);</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        quickSort(arr, low, p - 1);</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        quickSort(arr, p + 1, high);</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    }</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>}</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the capacity of the knapsack : &quot;</span>;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordtype">float</span> capacity;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    cin &gt;&gt; capacity;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    cout &lt;&lt; <span class="stringliteral">&quot;\n Enter the number of Items : &quot;</span>;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordtype">int</span> n;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    cin &gt;&gt; n;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <a class="code hl_struct" href="../../db/d66/struct_item.html">Item</a> *itemArray = <span class="keyword">new</span> <a class="code hl_struct" href="../../db/d66/struct_item.html">Item</a>[n];</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the weight and profit of item &quot;</span> &lt;&lt; i + 1 &lt;&lt; <span class="stringliteral">&quot; : &quot;</span>;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        cin &gt;&gt; itemArray[i].weight;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        cin &gt;&gt; itemArray[i].profit;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    }</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    quickSort(itemArray, 0, n - 1);</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="comment">// show(itemArray, n);</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordtype">float</span> maxProfit = 0;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordtype">int</span> i = n;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">while</span> (capacity &gt; 0 &amp;&amp; --i &gt;= 0) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="keywordflow">if</span> (capacity &gt;= itemArray[i].weight) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            maxProfit += itemArray[i].profit;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            capacity -= itemArray[i].weight;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n\t&quot;</span> &lt;&lt; itemArray[i].weight &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>                 &lt;&lt; itemArray[i].profit;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            maxProfit += profitPerUnit(itemArray[i]) * capacity;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n\t&quot;</span> &lt;&lt; capacity &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>                 &lt;&lt; profitPerUnit(itemArray[i]) * capacity;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            capacity = 0;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        }</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    }</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    cout &lt;&lt; <span class="stringliteral">&quot;\nMax Profit : &quot;</span> &lt;&lt; maxProfit;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keyword">delete</span>[] itemArray;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="astruct_item_html"><div class="ttname"><a href="../../db/d66/struct_item.html">Item</a></div><div class="ttdef"><b>Definition</b> <a href="#l00004">knapsack.cpp:4</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_0eaa691bd54ab0922ca7f50599de6d22.html">greedy_algorithms</a></li><li class="navelem"><b>knapsack.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d0/d62/struct_queue-members.html b/d0/d62/struct_queue-members.html
index 2d4d2c05a..ff37ebf25 100644
--- a/d0/d62/struct_queue-members.html
+++ b/d0/d62/struct_queue-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d0/d65/namespacedouble__hashing.html b/d0/d65/namespacedouble__hashing.html
index c546fc7e8..be80b1222 100644
--- a/d0/d65/namespacedouble__hashing.html
+++ b/d0/d65/namespacedouble__hashing.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: double_hashing Namespace Reference</title>
+<title>TheAlgorithms/C++: double_hashing Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,8 +140,7 @@ Classes</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="typedef-members" name="typedef-members"></a>
 Typedefs</h2></td></tr>
-<tr class="memitem:a92054ec26cd6907c163fb00a596bebdd" id="r_a92054ec26cd6907c163fb00a596bebdd"><td class="memItemLeft" align="right" valign="top"><a id="a92054ec26cd6907c163fb00a596bebdd" name="a92054ec26cd6907c163fb00a596bebdd"></a>
-using&#160;</td><td class="memItemRight" valign="bottom"><b>Entry</b> = struct Entry</td></tr>
+<tr class="memitem:a92054ec26cd6907c163fb00a596bebdd" id="r_a92054ec26cd6907c163fb00a596bebdd"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a92054ec26cd6907c163fb00a596bebdd">Entry</a> = struct Entry</td></tr>
 <tr class="separator:a92054ec26cd6907c163fb00a596bebdd"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
@@ -136,7 +152,7 @@ Functions</h2></td></tr>
 <tr class="memitem:a79a9c914a6c68275b3640303d7faad8a" id="r_a79a9c914a6c68275b3640303d7faad8a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a79a9c914a6c68275b3640303d7faad8a">add</a> (int key)</td></tr>
 <tr class="separator:a79a9c914a6c68275b3640303d7faad8a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a0d90726ed1de7b3d2ae261baed048003" id="r_a0d90726ed1de7b3d2ae261baed048003"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a> (int key)</td></tr>
-<tr class="memdesc:a0d90726ed1de7b3d2ae261baed048003"><td class="mdescLeft">&#160;</td><td class="mdescRight">Hash a key. Uses the STL library's <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash()</a></code> function.  <br /></td></tr>
+<tr class="memdesc:a0d90726ed1de7b3d2ae261baed048003"><td class="mdescLeft">&#160;</td><td class="mdescRight">Hash a key. Uses the STL library's <code>std::hash()</code> function.  <br /></td></tr>
 <tr class="separator:a0d90726ed1de7b3d2ae261baed048003"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a33968a1178289ab61445dd4000df7082" id="r_a33968a1178289ab61445dd4000df7082"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a33968a1178289ab61445dd4000df7082">otherHashFxn</a> (int key)</td></tr>
 <tr class="memdesc:a33968a1178289ab61445dd4000df7082"><td class="mdescLeft">&#160;</td><td class="mdescRight">Used for second hash function.  <br /></td></tr>
@@ -157,28 +173,39 @@ Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:a77d33a0c49294b9ec22ad86eeff79585" id="r_a77d33a0c49294b9ec22ad86eeff79585"><td class="memItemLeft" align="right" valign="top"><a id="a77d33a0c49294b9ec22ad86eeff79585" name="a77d33a0c49294b9ec22ad86eeff79585"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>notPresent</b></td></tr>
+<tr class="memitem:a77d33a0c49294b9ec22ad86eeff79585" id="r_a77d33a0c49294b9ec22ad86eeff79585"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a77d33a0c49294b9ec22ad86eeff79585">notPresent</a></td></tr>
 <tr class="separator:a77d33a0c49294b9ec22ad86eeff79585"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0e2ff0f9cfc7b54e60a6561f792d8b26" id="r_a0e2ff0f9cfc7b54e60a6561f792d8b26"><td class="memItemLeft" align="right" valign="top"><a id="a0e2ff0f9cfc7b54e60a6561f792d8b26" name="a0e2ff0f9cfc7b54e60a6561f792d8b26"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>table</b></td></tr>
+<tr class="memitem:a0e2ff0f9cfc7b54e60a6561f792d8b26" id="r_a0e2ff0f9cfc7b54e60a6561f792d8b26"><td class="memItemLeft" align="right" valign="top">std::vector&lt; <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0e2ff0f9cfc7b54e60a6561f792d8b26">table</a></td></tr>
 <tr class="separator:a0e2ff0f9cfc7b54e60a6561f792d8b26"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a60a52265027518b25655d730f960013a" id="r_a60a52265027518b25655d730f960013a"><td class="memItemLeft" align="right" valign="top"><a id="a60a52265027518b25655d730f960013a" name="a60a52265027518b25655d730f960013a"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>totalSize</b></td></tr>
+<tr class="memitem:a60a52265027518b25655d730f960013a" id="r_a60a52265027518b25655d730f960013a"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a60a52265027518b25655d730f960013a">totalSize</a></td></tr>
 <tr class="separator:a60a52265027518b25655d730f960013a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a4e9a7219d34e781e4e73d74a968b26c1" id="r_a4e9a7219d34e781e4e73d74a968b26c1"><td class="memItemLeft" align="right" valign="top"><a id="a4e9a7219d34e781e4e73d74a968b26c1" name="a4e9a7219d34e781e4e73d74a968b26c1"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>tomb</b> = -1</td></tr>
+<tr class="memitem:a4e9a7219d34e781e4e73d74a968b26c1" id="r_a4e9a7219d34e781e4e73d74a968b26c1"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4e9a7219d34e781e4e73d74a968b26c1">tomb</a> = -1</td></tr>
 <tr class="separator:a4e9a7219d34e781e4e73d74a968b26c1"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a5f5323b52037218cf5ae888778b7f980" id="r_a5f5323b52037218cf5ae888778b7f980"><td class="memItemLeft" align="right" valign="top"><a id="a5f5323b52037218cf5ae888778b7f980" name="a5f5323b52037218cf5ae888778b7f980"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>size</b></td></tr>
+<tr class="memitem:a5f5323b52037218cf5ae888778b7f980" id="r_a5f5323b52037218cf5ae888778b7f980"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5f5323b52037218cf5ae888778b7f980">size</a></td></tr>
 <tr class="separator:a5f5323b52037218cf5ae888778b7f980"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae5d042a7f6038a2ec9e5718d0c7fb31f" id="r_ae5d042a7f6038a2ec9e5718d0c7fb31f"><td class="memItemLeft" align="right" valign="top"><a id="ae5d042a7f6038a2ec9e5718d0c7fb31f" name="ae5d042a7f6038a2ec9e5718d0c7fb31f"></a>
-bool&#160;</td><td class="memItemRight" valign="bottom"><b>rehashing</b></td></tr>
+<tr class="memitem:ae5d042a7f6038a2ec9e5718d0c7fb31f" id="r_ae5d042a7f6038a2ec9e5718d0c7fb31f"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae5d042a7f6038a2ec9e5718d0c7fb31f">rehashing</a></td></tr>
 <tr class="separator:ae5d042a7f6038a2ec9e5718d0c7fb31f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Double_hashing" target="_blank">double hashing</a> algorithm. </p>
-</div><h2 class="groupheader">Function Documentation</h2>
+</div><h2 class="groupheader">Typedef Documentation</h2>
+<a id="a92054ec26cd6907c163fb00a596bebdd" name="a92054ec26cd6907c163fb00a596bebdd"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a92054ec26cd6907c163fb00a596bebdd">&#9670;&#160;</a></span>Entry</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">using double_hashing::Entry = struct Entry</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00022">22</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<h2 class="groupheader">Function Documentation</h2>
 <a id="a79a9c914a6c68275b3640303d7faad8a" name="a79a9c914a6c68275b3640303d7faad8a"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a79a9c914a6c68275b3640303d7faad8a">&#9670;&#160;</a></span>add()</h2>
 
@@ -199,6 +226,8 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>rehashing</b></td></t
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00185">185</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  185</span>                  {</div>
 <div class="line"><span class="lineno">  186</span>    <span class="comment">// auto* entry = new Entry();</span></div>
 <div class="line"><span class="lineno">  187</span>    <span class="comment">// entry-&gt;key = key;</span></div>
@@ -209,14 +238,9 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>rehashing</b></td></t
 <div class="line"><span class="lineno">  192</span>        <a class="code hl_function" href="#af4981819aae8bc7e7beeaef02615e30d">rehash</a>();</div>
 <div class="line"><span class="lineno">  193</span>    }</div>
 <div class="line"><span class="lineno">  194</span>}</div>
-<div class="ttc" id="anamespacedouble__hashing_html_a8f8ff4fb018e1bb32d67d8a1885d3200"><div class="ttname"><a href="#a8f8ff4fb018e1bb32d67d8a1885d3200">double_hashing::doubleHash</a></div><div class="ttdeci">int doubleHash(int key, bool searching)</div><div class="ttdoc">Performs double hashing to resolve collisions.</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:71</div></div>
-<div class="ttc" id="anamespacedouble__hashing_html_af4981819aae8bc7e7beeaef02615e30d"><div class="ttname"><a href="#af4981819aae8bc7e7beeaef02615e30d">double_hashing::rehash</a></div><div class="ttdeci">void rehash()</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:161</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.svg" width="638" height="250"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacedouble__hashing_html_a8f8ff4fb018e1bb32d67d8a1885d3200"><div class="ttname"><a href="#a8f8ff4fb018e1bb32d67d8a1885d3200">double_hashing::doubleHash</a></div><div class="ttdeci">int doubleHash(int key, bool searching)</div><div class="ttdoc">Performs double hashing to resolve collisions.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00071">double_hash_hash_table.cpp:71</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_af4981819aae8bc7e7beeaef02615e30d"><div class="ttname"><a href="#af4981819aae8bc7e7beeaef02615e30d">double_hashing::rehash</a></div><div class="ttdeci">void rehash()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00161">double_hash_hash_table.cpp:161</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a9c652b2e467e5d250dfe3bed83b12560" name="a9c652b2e467e5d250dfe3bed83b12560"></a>
@@ -239,27 +263,22 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00212">212</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  212</span>                      {</div>
-<div class="line"><span class="lineno">  213</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initial table: &quot;</span>;</div>
+<div class="line"><span class="lineno">  213</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initial table: &quot;</span>;</div>
 <div class="line"><span class="lineno">  214</span>    display();</div>
-<div class="line"><span class="lineno">  215</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  216</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;hash of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; <a class="code hl_function" href="#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
+<div class="line"><span class="lineno">  215</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  216</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;hash of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; <a class="code hl_function" href="#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
 <div class="line"><span class="lineno">  217</span>              &lt;&lt; totalSize &lt;&lt; <span class="stringliteral">&quot; == &quot;</span> &lt;&lt; <a class="code hl_function" href="#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) % totalSize;</div>
-<div class="line"><span class="lineno">  218</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  219</span>    <a class="code hl_function" href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a>(key);</div>
-<div class="line"><span class="lineno">  220</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;New table: &quot;</span>;</div>
+<div class="line"><span class="lineno">  220</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;New table: &quot;</span>;</div>
 <div class="line"><span class="lineno">  221</span>    display();</div>
 <div class="line"><span class="lineno">  222</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="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="anamespacedouble__hashing_html_a0d90726ed1de7b3d2ae261baed048003"><div class="ttname"><a href="#a0d90726ed1de7b3d2ae261baed048003">double_hashing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdoc">Hash a key. Uses the STL library's std::hash() function.</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:47</div></div>
-<div class="ttc" id="auint128__t_8hpp_html_a3ff77262ffd6743df5b808d41382a6f3"><div class="ttname"><a href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a></div><div class="ttdeci">std::string add(const std::string &amp;first, const std::string &amp;second)</div><div class="ttdoc">Adding two string.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:38</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.svg" width="100%" height="514"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="anamespacedouble__hashing_html_a0d90726ed1de7b3d2ae261baed048003"><div class="ttname"><a href="#a0d90726ed1de7b3d2ae261baed048003">double_hashing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdoc">Hash a key. Uses the STL library's std::hash() function.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00047">double_hash_hash_table.cpp:47</a></div></div>
+<div class="ttc" id="auint128__t_8hpp_html_a3ff77262ffd6743df5b808d41382a6f3"><div class="ttname"><a href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a></div><div class="ttdeci">std::string add(const std::string &amp;first, const std::string &amp;second)</div><div class="ttdoc">Adding two string.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00038">uint128_t.hpp:38</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1e901418c759627557eff359b8db38cd" name="a1e901418c759627557eff359b8db38cd"></a>
@@ -277,26 +296,23 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Displays the table </p><dl class="section return"><dt>Returns</dt><dd>None </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00143">143</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  143</span>               {</div>
 <div class="line"><span class="lineno">  144</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; totalSize; i++) {</div>
 <div class="line"><span class="lineno">  145</span>        <span class="keywordflow">if</span> (table[i].key == notPresent) {</div>
-<div class="line"><span class="lineno">  146</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; Empty &quot;</span>;</div>
+<div class="line"><span class="lineno">  146</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; Empty &quot;</span>;</div>
 <div class="line"><span class="lineno">  147</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (table[i].key == tomb) {</div>
-<div class="line"><span class="lineno">  148</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; Tomb &quot;</span>;</div>
+<div class="line"><span class="lineno">  148</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; Tomb &quot;</span>;</div>
 <div class="line"><span class="lineno">  149</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  150</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
-<div class="line"><span class="lineno">  151</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; table[i].key;</div>
-<div class="line"><span class="lineno">  152</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  150</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  151</span>            std::cout &lt;&lt; table[i].key;</div>
+<div class="line"><span class="lineno">  152</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">  153</span>        }</div>
 <div class="line"><span class="lineno">  154</span>    }</div>
-<div class="line"><span class="lineno">  155</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  155</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  156</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.svg" width="291" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a8f8ff4fb018e1bb32d67d8a1885d3200" name="a8f8ff4fb018e1bb32d67d8a1885d3200"></a>
@@ -329,6 +345,8 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>Index of key when found </dd>
 <dd>
 new hash if no conflicts present </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00071">71</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   71</span>                                        {</div>
 <div class="line"><span class="lineno">   72</span>    <span class="keywordtype">int</span> hash = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(<a class="code hl_function" href="#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key));</div>
 <div class="line"><span class="lineno">   73</span>    <span class="keywordtype">int</span> i = 0;</div>
@@ -342,46 +360,41 @@ new hash if no conflicts present </dd></dl>
 <div class="line"><span class="lineno">   81</span>                <span class="keywordflow">return</span> notPresent;</div>
 <div class="line"><span class="lineno">   82</span>            }</div>
 <div class="line"><span class="lineno">   83</span>            <span class="keywordflow">if</span> (searchingProber(entry, key)) {</div>
-<div class="line"><span class="lineno">   84</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Found key!&quot;</span> &lt;&lt; <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">   84</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Found key!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   85</span>                <span class="keywordflow">return</span> index;</div>
 <div class="line"><span class="lineno">   86</span>            }</div>
-<div class="line"><span class="lineno">   87</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Found tombstone or equal hash, checking next&quot;</span></div>
-<div class="line"><span class="lineno">   88</span>                      &lt;&lt; <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">   87</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Found tombstone or equal hash, checking next&quot;</span></div>
+<div class="line"><span class="lineno">   88</span>                      &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   89</span>            i++;</div>
 <div class="line"><span class="lineno">   90</span>        } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">   91</span>            <span class="keywordflow">if</span> (<a class="code hl_function" href="#ac2adfce49ac57f6dbd1778d2c1ce0d2b">putProber</a>(entry, key)) {</div>
 <div class="line"><span class="lineno">   92</span>                <span class="keywordflow">if</span> (!rehashing) {</div>
-<div class="line"><span class="lineno">   93</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Spot found!&quot;</span> &lt;&lt; <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">   93</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;Spot found!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   94</span>                }</div>
 <div class="line"><span class="lineno">   95</span>                <span class="keywordflow">return</span> index;</div>
 <div class="line"><span class="lineno">   96</span>            }</div>
 <div class="line"><span class="lineno">   97</span>            <span class="keywordflow">if</span> (!rehashing) {</div>
-<div class="line"><span class="lineno">   98</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Spot taken, looking at next (next index:&quot;</span></div>
+<div class="line"><span class="lineno">   98</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Spot taken, looking at next (next index:&quot;</span></div>
 <div class="line"><span class="lineno">   99</span>                          &lt;&lt; <span class="stringliteral">&quot; &quot;</span></div>
 <div class="line"><span class="lineno">  100</span>                          &lt;&lt; <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(<a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hash</a> + (i * <a class="code hl_function" href="#a33968a1178289ab61445dd4000df7082">otherHashFxn</a>(key))) %</div>
 <div class="line"><span class="lineno">  101</span>                                 totalSize</div>
-<div class="line"><span class="lineno">  102</span>                          &lt;&lt; <span class="stringliteral">&quot;)&quot;</span> &lt;&lt; <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">  102</span>                          &lt;&lt; <span class="stringliteral">&quot;)&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  103</span>            }</div>
 <div class="line"><span class="lineno">  104</span>            i++;</div>
 <div class="line"><span class="lineno">  105</span>        }</div>
 <div class="line"><span class="lineno">  106</span>        <span class="keywordflow">if</span> (i == totalSize * 100) {</div>
-<div class="line"><span class="lineno">  107</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;DoubleHash probe failed&quot;</span> &lt;&lt; <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">  107</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;DoubleHash probe failed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  108</span>            <span class="keywordflow">return</span> notPresent;</div>
 <div class="line"><span class="lineno">  109</span>        }</div>
 <div class="line"><span class="lineno">  110</span>    } <span class="keywordflow">while</span> (entry.<a class="code hl_variable" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a> != notPresent);</div>
 <div class="line"><span class="lineno">  111</span>    <span class="keywordflow">return</span> notPresent;</div>
 <div class="line"><span class="lineno">  112</span>}</div>
-<div class="ttc" id="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> md5.cpp:288</div></div>
-<div class="ttc" id="anamespacedouble__hashing_html_a33968a1178289ab61445dd4000df7082"><div class="ttname"><a href="#a33968a1178289ab61445dd4000df7082">double_hashing::otherHashFxn</a></div><div class="ttdeci">size_t otherHashFxn(int key)</div><div class="ttdoc">Used for second hash function.</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:58</div></div>
-<div class="ttc" id="anamespacedouble__hashing_html_ac2adfce49ac57f6dbd1778d2c1ce0d2b"><div class="ttname"><a href="#ac2adfce49ac57f6dbd1778d2c1ce0d2b">double_hashing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:120</div></div>
-<div class="ttc" id="astructdouble__hashing_1_1_entry_html"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html">double_hashing::Entry</a></div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:36</div></div>
-<div class="ttc" id="astructdouble__hashing_1_1_entry_html_ae114967c89dbba3b754dc4976bba3248"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">double_hashing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:38</div></div>
-</div><!-- 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="../../d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.svg" width="448" height="250"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d96/md5_8cpp_source.html#l00288">md5.cpp:288</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_a33968a1178289ab61445dd4000df7082"><div class="ttname"><a href="#a33968a1178289ab61445dd4000df7082">double_hashing::otherHashFxn</a></div><div class="ttdeci">size_t otherHashFxn(int key)</div><div class="ttdoc">Used for second hash function.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00058">double_hash_hash_table.cpp:58</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_ac2adfce49ac57f6dbd1778d2c1ce0d2b"><div class="ttname"><a href="#ac2adfce49ac57f6dbd1778d2c1ce0d2b">double_hashing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00120">double_hash_hash_table.cpp:120</a></div></div>
+<div class="ttc" id="astructdouble__hashing_1_1_entry_html"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html">double_hashing::Entry</a></div><div class="ttdef"><b>Definition</b> <a href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00036">double_hash_hash_table.cpp:36</a></div></div>
+<div class="ttc" id="astructdouble__hashing_1_1_entry_html_ae114967c89dbba3b754dc4976bba3248"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">double_hashing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00038">double_hash_hash_table.cpp:38</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0d90726ed1de7b3d2ae261baed048003" name="a0d90726ed1de7b3d2ae261baed048003"></a>
@@ -399,7 +412,7 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 
-<p>Hash a key. Uses the STL library's <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash()</a></code> function. </p>
+<p>Hash a key. Uses the STL library's <code>std::hash()</code> function. </p>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramname">key</td><td>value to hash </td></tr>
@@ -407,11 +420,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>hash value of the key </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   47</span>                        {</div>
-<div class="line"><span class="lineno">   48</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash&lt;int&gt;</a> hash;</div>
+<div class="line"><span class="lineno">   48</span>    std::hash&lt;int&gt; hash;</div>
 <div class="line"><span class="lineno">   49</span>    <span class="keywordflow">return</span> hash(key);</div>
 <div class="line"><span class="lineno">   50</span>}</div>
-<div class="ttc" id="ahash_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -438,8 +452,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>hash value of the key </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   58</span>                             {</div>
-<div class="line"><span class="lineno">   59</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash&lt;int&gt;</a> hash;</div>
+<div class="line"><span class="lineno">   59</span>    std::hash&lt;int&gt; hash;</div>
 <div class="line"><span class="lineno">   60</span>    <span class="keywordflow">return</span> 1 + (7 - (hash(key) % 7));</div>
 <div class="line"><span class="lineno">   61</span>}</div>
 </div><!-- fragment -->
@@ -473,6 +489,8 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if key is not present or is a <code>toumb</code> </dd>
 <dd>
 <code>false</code> is already occupied </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00120">120</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  120</span>                                            {</div>
 <div class="line"><span class="lineno">  121</span>    <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a> == notPresent || entry.<a class="code hl_variable" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a> == tomb) {</div>
 <div class="line"><span class="lineno">  122</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
@@ -497,13 +515,15 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Rehashes the table into a bigger table </p><dl class="section return"><dt>Returns</dt><dd>None </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00161">161</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  161</span>              {</div>
 <div class="line"><span class="lineno">  162</span>    <span class="comment">// Necessary so wall of add info isn&#39;t printed all at once</span></div>
 <div class="line"><span class="lineno">  163</span>    rehashing = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  164</span>    <span class="keywordtype">int</span> oldSize = totalSize;</div>
-<div class="line"><span class="lineno">  165</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Entry&gt;</a> oldTable(table);</div>
+<div class="line"><span class="lineno">  165</span>    std::vector&lt;Entry&gt; oldTable(table);</div>
 <div class="line"><span class="lineno">  166</span>    <span class="comment">// Really this should use the next prime number greater than totalSize * 2</span></div>
-<div class="line"><span class="lineno">  167</span>    table = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Entry&gt;</a>(totalSize * 2);</div>
+<div class="line"><span class="lineno">  167</span>    table = std::vector&lt;Entry&gt;(totalSize * 2);</div>
 <div class="line"><span class="lineno">  168</span>    totalSize *= 2;</div>
 <div class="line"><span class="lineno">  169</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; oldSize; i++) {</div>
 <div class="line"><span class="lineno">  170</span>        <span class="keywordflow">if</span> (oldTable[i].key != -1 &amp;&amp; oldTable[i].key != notPresent) {</div>
@@ -515,15 +535,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  176</span>    <span class="comment">// oldTable.reset();</span></div>
 <div class="line"><span class="lineno">  177</span> </div>
 <div class="line"><span class="lineno">  178</span>    rehashing = <span class="keyword">false</span>;</div>
-<div class="line"><span class="lineno">  179</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Table was rehashed, new size is: &quot;</span> &lt;&lt; totalSize &lt;&lt; <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">  179</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Table was rehashed, new size is: &quot;</span> &lt;&lt; totalSize &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  180</span>}</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>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.svg" width="100%" height="487"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5d06e4598569526294f10104875f6824" name="a5d06e4598569526294f10104875f6824"></a>
@@ -546,23 +560,21 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00227">227</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  227</span>                          {</div>
-<div class="line"><span class="lineno">  228</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initial table: &quot;</span>;</div>
+<div class="line"><span class="lineno">  228</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initial table: &quot;</span>;</div>
 <div class="line"><span class="lineno">  229</span>    display();</div>
-<div class="line"><span class="lineno">  230</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  231</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;hash of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; <a class="code hl_function" href="#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
+<div class="line"><span class="lineno">  230</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  231</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;hash of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; <a class="code hl_function" href="#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
 <div class="line"><span class="lineno">  232</span>              &lt;&lt; totalSize &lt;&lt; <span class="stringliteral">&quot; == &quot;</span> &lt;&lt; <a class="code hl_function" href="#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) % totalSize;</div>
-<div class="line"><span class="lineno">  233</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  234</span>    remove(key);</div>
-<div class="line"><span class="lineno">  235</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;New table: &quot;</span>;</div>
+<div class="line"><span class="lineno">  233</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  234</span>    <a class="code hl_function" href="#a28083ecac6eb94b643281875c8665931">remove</a>(key);</div>
+<div class="line"><span class="lineno">  235</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;New table: &quot;</span>;</div>
 <div class="line"><span class="lineno">  236</span>    display();</div>
 <div class="line"><span class="lineno">  237</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.svg" width="100%" height="498"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="anamespacedouble__hashing_html_a28083ecac6eb94b643281875c8665931"><div class="ttname"><a href="#a28083ecac6eb94b643281875c8665931">double_hashing::remove</a></div><div class="ttdeci">void remove(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00199">double_hash_hash_table.cpp:199</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a28083ecac6eb94b643281875c8665931" name="a28083ecac6eb94b643281875c8665931"></a>
@@ -585,21 +597,18 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00199">199</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  199</span>                     {</div>
 <div class="line"><span class="lineno">  200</span>    <span class="keywordtype">int</span> index = <a class="code hl_function" href="#a8f8ff4fb018e1bb32d67d8a1885d3200">doubleHash</a>(key, <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">  201</span>    <span class="keywordflow">if</span> (index == notPresent) {</div>
-<div class="line"><span class="lineno">  202</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;key not found&quot;</span> &lt;&lt; <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>        std::cout &lt;&lt; <span class="stringliteral">&quot;key not found&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  203</span>    }</div>
 <div class="line"><span class="lineno">  204</span>    table[index].key = tomb;</div>
-<div class="line"><span class="lineno">  205</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Removal successful, leaving tombstone&quot;</span> &lt;&lt; <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">  205</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Removal successful, leaving tombstone&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  206</span>    size--;</div>
 <div class="line"><span class="lineno">  207</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.svg" width="659" height="250"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a29f543e2626bad58907661e1e45028a6" name="a29f543e2626bad58907661e1e45028a6"></a>
@@ -630,6 +639,8 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if found </dd>
 <dd>
 <code>false</code> if not found </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00133">133</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  133</span>                                                  {</div>
 <div class="line"><span class="lineno">  134</span>    <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a> == key) {</div>
 <div class="line"><span class="lineno">  135</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
@@ -637,6 +648,103 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  137</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  138</span>}</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Variable Documentation</h2>
+<a id="a77d33a0c49294b9ec22ad86eeff79585" name="a77d33a0c49294b9ec22ad86eeff79585"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a77d33a0c49294b9ec22ad86eeff79585">&#9670;&#160;</a></span>notPresent</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int double_hashing::notPresent</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ae5d042a7f6038a2ec9e5718d0c7fb31f" name="ae5d042a7f6038a2ec9e5718d0c7fb31f"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ae5d042a7f6038a2ec9e5718d0c7fb31f">&#9670;&#160;</a></span>rehashing</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">bool double_hashing::rehashing</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a5f5323b52037218cf5ae888778b7f980" name="a5f5323b52037218cf5ae888778b7f980"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a5f5323b52037218cf5ae888778b7f980">&#9670;&#160;</a></span>size</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int double_hashing::size</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a0e2ff0f9cfc7b54e60a6561f792d8b26" name="a0e2ff0f9cfc7b54e60a6561f792d8b26"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a0e2ff0f9cfc7b54e60a6561f792d8b26">&#9670;&#160;</a></span>table</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;<a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a>&gt; double_hashing::table</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a4e9a7219d34e781e4e73d74a968b26c1" name="a4e9a7219d34e781e4e73d74a968b26c1"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a4e9a7219d34e781e4e73d74a968b26c1">&#9670;&#160;</a></span>tomb</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int double_hashing::tomb = -1</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a60a52265027518b25655d730f960013a" name="a60a52265027518b25655d730f960013a"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a60a52265027518b25655d730f960013a">&#9670;&#160;</a></span>totalSize</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int double_hashing::totalSize</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00030">30</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
+
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.map b/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.map
deleted file mode 100644
index 5071e2253..000000000
--- a/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="double_hashing::display" name="double_hashing::display">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,166,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="214,5,285,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="166,16,198,16,198,21,166,21"/>
-</map>
diff --git a/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.md5 b/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.md5
deleted file mode 100644
index bd95d4fdb..000000000
--- a/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-97794c183a1a96bd849dfeec8a5420f4
\ No newline at end of file
diff --git a/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.svg b/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.svg
deleted file mode 100644
index 440709d11..000000000
--- a/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: double_hashing::display Pages: 1 -->
-<svg width="218pt" height="27pt"
- viewBox="0.00 0.00 217.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>double_hashing::display</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="120.25,-19.25 0,-19.25 0,0 120.25,0 120.25,-19.25"/>
-<text text-anchor="middle" x="60.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::display</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209.75,-19.25 156.25,-19.25 156.25,0 209.75,0 209.75,-19.25"/>
-<text text-anchor="middle" x="183" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.5,-9.62C128.65,-9.62 136.83,-9.62 144.43,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.32,-13.13 154.32,-9.63 144.32,-6.13 144.32,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph_org.svg b/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph_org.svg
deleted file mode 100644
index 25e12a765..000000000
--- a/d0/d65/namespacedouble__hashing_a1e901418c759627557eff359b8db38cd_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: double_hashing::display Pages: 1 -->
-<svg width="218pt" height="27pt"
- viewBox="0.00 0.00 217.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>double_hashing::display</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="120.25,-19.25 0,-19.25 0,0 120.25,0 120.25,-19.25"/>
-<text text-anchor="middle" x="60.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::display</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209.75,-19.25 156.25,-19.25 156.25,0 209.75,0 209.75,-19.25"/>
-<text text-anchor="middle" x="183" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.5,-9.62C128.65,-9.62 136.83,-9.62 144.43,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.32,-13.13 154.32,-9.63 144.32,-6.13 144.32,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.map b/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.map
deleted file mode 100644
index 18257db83..000000000
--- a/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="double_hashing::remove" name="double_hashing::remove">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,168,80"/>
-<area shape="rect" id="Node000002" href="$d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200" title="Performs double hashing to resolve collisions." alt="" coords="216,80,404,106"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="168,74,200,78,200,83,168,79"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="517,5,588,31"/>
-<area shape="poly" id="edge7_Node000001_Node000003" title=" " alt="" coords="168,56,501,21,502,26,168,62"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="344,77,451,40,501,26,503,32,453,45,346,82"/>
-<area shape="rect" id="Node000004" href="$d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" title="Hash a key. Uses the STL library&#39;s std::hash() function." alt="" coords="468,55,637,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="404,80,452,75,453,81,405,86"/>
-<area shape="rect" id="Node000005" href="$d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" title="Used for second hash function." alt="" coords="452,104,653,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="405,99,437,103,436,108,404,105"/>
-<area shape="rect" id="Node000006" href="$d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" title=" " alt="" coords="465,153,640,179"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="347,104,453,140,478,147,477,152,451,145,345,109"/>
-<area shape="rect" id="Node000007" href="$d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" title=" " alt="" coords="465,203,640,244"/>
-<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="328,104,382,145,453,189,465,195,463,199,451,194,379,150,325,108"/>
-</map>
diff --git a/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.md5 b/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.md5
deleted file mode 100644
index 8a0912a8d..000000000
--- a/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-61afd8a25fb724e20d31348c8b166991
\ No newline at end of file
diff --git a/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.svg b/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.svg
deleted file mode 100644
index 974c728bc..000000000
--- a/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph.svg
+++ /dev/null
@@ -1,165 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: double_hashing::remove Pages: 1 -->
-<svg width="494pt" height="187pt"
- viewBox="0.00 0.00 494.00 186.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 182.88)">
-<title>double_hashing::remove</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="121.75,-141.88 0,-141.88 0,-122.62 121.75,-122.62 121.75,-141.88"/>
-<text text-anchor="middle" x="60.88" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::remove</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200" target="_top" xlink:title="Performs double hashing to resolve collisions.">
-<polygon fill="white" stroke="#666666" points="299,-122.88 157.75,-122.88 157.75,-103.62 299,-103.62 299,-122.88"/>
-<text text-anchor="middle" x="228.38" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::doubleHash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.09,-125.34C129.88,-124.44 137.96,-123.52 146.02,-122.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.33,-126.08 155.87,-121.46 145.53,-119.12 146.33,-126.08"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="437.25,-178.88 383.75,-178.88 383.75,-159.62 437.25,-159.62 437.25,-178.88"/>
-<text text-anchor="middle" x="410.5" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge7_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge7_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.03,-138.65C193.99,-146.31 312.24,-158.9 372.17,-165.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="371.53,-168.73 381.85,-166.31 372.27,-161.77 371.53,-168.73"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.73,-123.25C275.97,-131.41 307.18,-142.91 335,-151.25 347.07,-154.87 360.41,-158.27 372.43,-161.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="371.45,-164.49 381.98,-163.34 373.03,-157.68 371.45,-164.49"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="474,-141.88 347,-141.88 347,-122.62 474,-122.62 474,-141.88"/>
-<text text-anchor="middle" x="410.5" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.27,-120.62C311.11,-121.87 323.45,-123.17 335.39,-124.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.88,-127.9 345.19,-125.47 335.61,-120.94 334.88,-127.9"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" target="_top" xlink:title="Used for second hash function.">
-<polygon fill="white" stroke="#666666" points="486,-104.88 335,-104.88 335,-85.62 486,-85.62 486,-104.88"/>
-<text text-anchor="middle" x="410.5" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::otherHashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.27,-106.26C307.14,-105.48 315.22,-104.67 323.26,-103.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="323.46,-107.37 333.06,-102.89 322.77,-100.4 323.46,-107.37"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="476.25,-67.88 344.75,-67.88 344.75,-48.62 476.25,-48.62 476.25,-67.88"/>
-<text text-anchor="middle" x="410.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.62,-103.24C276.84,-95.34 307.61,-84.34 335,-76.25 341.13,-74.44 347.59,-72.68 354.03,-71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="354.49,-74.5 363.32,-68.65 352.77,-67.71 354.49,-74.5"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="476.25,-30.5 344.75,-30.5 344.75,0 476.25,0 476.25,-30.5"/>
-<text text-anchor="start" x="352.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::searching</text>
-<text text-anchor="middle" x="410.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M240.99,-103.33C259.68,-87.8 298.11,-57.59 335,-39.25 337.85,-37.83 340.81,-36.47 343.82,-35.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.86,-38.53 352.83,-31.55 342.25,-32.03 344.86,-38.53"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph_org.svg b/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph_org.svg
deleted file mode 100644
index d38df60f6..000000000
--- a/d0/d65/namespacedouble__hashing_a28083ecac6eb94b643281875c8665931_cgraph_org.svg
+++ /dev/null
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: double_hashing::remove Pages: 1 -->
-<svg width="494pt" height="187pt"
- viewBox="0.00 0.00 494.00 186.88" 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 182.88)">
-<title>double_hashing::remove</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="121.75,-141.88 0,-141.88 0,-122.62 121.75,-122.62 121.75,-141.88"/>
-<text text-anchor="middle" x="60.88" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::remove</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200" target="_top" xlink:title="Performs double hashing to resolve collisions.">
-<polygon fill="white" stroke="#666666" points="299,-122.88 157.75,-122.88 157.75,-103.62 299,-103.62 299,-122.88"/>
-<text text-anchor="middle" x="228.38" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::doubleHash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.09,-125.34C129.88,-124.44 137.96,-123.52 146.02,-122.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.33,-126.08 155.87,-121.46 145.53,-119.12 146.33,-126.08"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="437.25,-178.88 383.75,-178.88 383.75,-159.62 437.25,-159.62 437.25,-178.88"/>
-<text text-anchor="middle" x="410.5" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge7_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge7_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.03,-138.65C193.99,-146.31 312.24,-158.9 372.17,-165.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="371.53,-168.73 381.85,-166.31 372.27,-161.77 371.53,-168.73"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.73,-123.25C275.97,-131.41 307.18,-142.91 335,-151.25 347.07,-154.87 360.41,-158.27 372.43,-161.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="371.45,-164.49 381.98,-163.34 373.03,-157.68 371.45,-164.49"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="474,-141.88 347,-141.88 347,-122.62 474,-122.62 474,-141.88"/>
-<text text-anchor="middle" x="410.5" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.27,-120.62C311.11,-121.87 323.45,-123.17 335.39,-124.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.88,-127.9 345.19,-125.47 335.61,-120.94 334.88,-127.9"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" target="_top" xlink:title="Used for second hash function.">
-<polygon fill="white" stroke="#666666" points="486,-104.88 335,-104.88 335,-85.62 486,-85.62 486,-104.88"/>
-<text text-anchor="middle" x="410.5" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::otherHashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.27,-106.26C307.14,-105.48 315.22,-104.67 323.26,-103.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="323.46,-107.37 333.06,-102.89 322.77,-100.4 323.46,-107.37"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="476.25,-67.88 344.75,-67.88 344.75,-48.62 476.25,-48.62 476.25,-67.88"/>
-<text text-anchor="middle" x="410.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.62,-103.24C276.84,-95.34 307.61,-84.34 335,-76.25 341.13,-74.44 347.59,-72.68 354.03,-71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="354.49,-74.5 363.32,-68.65 352.77,-67.71 354.49,-74.5"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="476.25,-30.5 344.75,-30.5 344.75,0 476.25,0 476.25,-30.5"/>
-<text text-anchor="start" x="352.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::searching</text>
-<text text-anchor="middle" x="410.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M240.99,-103.33C259.68,-87.8 298.11,-57.59 335,-39.25 337.85,-37.83 340.81,-36.47 343.82,-35.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.86,-38.53 352.83,-31.55 342.25,-32.03 344.86,-38.53"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.map b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.map
deleted file mode 100644
index 0ec07ed3f..000000000
--- a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.map
+++ /dev/null
@@ -1,23 +0,0 @@
-<map id="double_hashing::removalInfo" name="double_hashing::removalInfo">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,50,193,76"/>
-<area shape="rect" id="Node000002" href="$d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd" title=" " alt="" coords="465,25,625,50"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="193,55,449,40,449,46,193,60"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="752,19,824,45"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="151,47,240,28,352,12,439,4,527,4,640,10,737,21,736,26,639,15,527,9,439,9,352,17,241,34,152,52"/>
-<area shape="rect" id="Node000004" href="$d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" title="Hash a key. Uses the STL library&#39;s std::hash() function." alt="" coords="703,233,873,258"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="135,74,241,111,368,147,495,179,707,227,706,232,494,184,367,152,240,116,133,79"/>
-<area shape="rect" id="Node000005" href="$d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931" title=" " alt="" coords="241,75,403,101"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="193,71,225,75,225,80,193,76"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="626,33,736,31,737,36,626,39"/>
-<area shape="poly" id="edge12_Node000005_Node000003" title=" " alt="" coords="403,82,515,74,639,60,736,42,737,47,640,66,516,79,404,87"/>
-<area shape="rect" id="Node000006" href="$d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200" title="Performs double hashing to resolve collisions." alt="" coords="451,126,639,152"/>
-<area shape="poly" id="edge6_Node000005_Node000006" title=" " alt="" coords="382,99,471,120,470,125,381,104"/>
-<area shape="poly" id="edge7_Node000006_Node000003" title=" " alt="" coords="598,123,638,105,652,92,661,80,670,67,686,54,711,43,736,36,738,41,713,48,689,59,674,70,665,83,656,96,641,109,601,128"/>
-<area shape="poly" id="edge8_Node000006_Node000004" title=" " alt="" coords="567,150,620,184,688,219,706,226,704,231,686,224,617,189,564,155"/>
-<area shape="rect" id="Node000007" href="$d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" title="Used for second hash function." alt="" coords="687,183,889,209"/>
-<area shape="poly" id="edge9_Node000006_Node000007" title=" " alt="" coords="603,150,716,177,715,182,602,155"/>
-<area shape="rect" id="Node000008" href="$d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" title=" " alt="" coords="700,69,876,94"/>
-<area shape="poly" id="edge10_Node000006_Node000008" title=" " alt="" coords="602,123,715,96,716,101,603,128"/>
-<area shape="rect" id="Node000009" href="$d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" title=" " alt="" coords="700,119,876,159"/>
-<area shape="poly" id="edge11_Node000006_Node000009" title=" " alt="" coords="640,136,684,136,684,142,640,142"/>
-</map>
diff --git a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.md5 b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.md5
deleted file mode 100644
index c2fb263dd..000000000
--- a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e06fa8daa8be601509dba14947d9bfb6
\ No newline at end of file
diff --git a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.svg b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.svg
deleted file mode 100644
index 423622ad0..000000000
--- a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph.svg
+++ /dev/null
@@ -1,285 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: double_hashing::removalInfo Pages: 1 -->
-<!--zoomable 198 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 671;
-var viewHeight = 198;
-var sectionId = 'dynsection-5';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>double_hashing::removalInfo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="140.5,-156.25 0,-156.25 0,-137 140.5,-137 140.5,-156.25"/>
-<text text-anchor="middle" x="70.25" y="-142.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::removalInfo</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="465,-175.25 344.75,-175.25 344.75,-156 465,-156 465,-175.25"/>
-<text text-anchor="middle" x="404.88" y="-161.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.98,-150.61C197.3,-153.82 276.23,-158.33 332.88,-161.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="332.56,-165.06 342.75,-162.13 332.96,-158.07 332.56,-165.06"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="613.75,-179.25 560.25,-179.25 560.25,-160 613.75,-160 613.75,-179.25"/>
-<text text-anchor="middle" x="587" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.5,-156.66C129.36,-161.54 154.1,-167.09 176.5,-170.62 307.91,-191.34 342.77,-193.59 475.5,-184.62 499.95,-182.97 527.23,-179.29 548.57,-175.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="548.94,-179.47 558.26,-174.44 547.84,-172.56 548.94,-179.47"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="650.5,-19.25 523.5,-19.25 523.5,0 650.5,0 650.5,-19.25"/>
-<text text-anchor="middle" x="587" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.51,-136.62C117.67,-128.46 148.78,-116.95 176.5,-108.62 299.1,-71.79 445.46,-39.05 525.8,-22.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="526.14,-25.52 535.2,-20.04 524.7,-18.68 526.14,-25.52"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="298.25,-137.25 176.5,-137.25 176.5,-118 298.25,-118 298.25,-137.25"/>
-<text text-anchor="middle" x="237.38" y="-123.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::remove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.8,-138.62C148.77,-137.71 156.9,-136.77 164.89,-135.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.03,-139.36 174.56,-134.74 164.23,-132.4 165.03,-139.36"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M465.35,-166.95C492.7,-167.55 524.33,-168.26 548.33,-168.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="548.2,-172.29 558.28,-169.01 548.36,-165.29 548.2,-172.29"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge12_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge12_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M298.54,-130.36C346.61,-133.05 415.61,-138.03 475.5,-146.62 500.05,-150.15 527.33,-155.81 548.65,-160.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="547.81,-164.03 558.34,-162.87 549.39,-157.21 547.81,-164.03"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200" target="_top" xlink:title="Performs double hashing to resolve collisions.">
-<polygon fill="white" stroke="#666666" points="475.5,-99.25 334.25,-99.25 334.25,-80 475.5,-80 475.5,-99.25"/>
-<text text-anchor="middle" x="404.88" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::doubleHash</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.29,-117.54C302.76,-112.84 327.33,-107.2 349.01,-102.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="349.6,-105.68 358.57,-100.03 348.04,-98.86 349.6,-105.68"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge7_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge7_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M445.7,-99.69C455.87,-103.23 466.47,-107.81 475.5,-113.62 495.06,-126.22 491.37,-139.97 511.5,-151.62 522.79,-158.16 536.35,-162.33 548.79,-164.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="547.85,-168.37 558.32,-166.75 549.12,-161.49 547.85,-168.37"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge8_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M419.87,-79.58C439.47,-65.96 476.6,-41.72 511.5,-27.62 515.8,-25.89 520.32,-24.29 524.9,-22.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="525.62,-26.26 534.22,-20.07 523.64,-19.55 525.62,-26.26"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" target="_top" xlink:title="Used for second hash function.">
-<polygon fill="white" stroke="#666666" points="662.5,-56.25 511.5,-56.25 511.5,-37 662.5,-37 662.5,-56.25"/>
-<text text-anchor="middle" x="587" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::otherHashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge9_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge9_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M448.11,-79.54C473.42,-73.5 505.84,-65.76 532.88,-59.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.34,-62.8 542.25,-57.07 531.71,-55.99 533.34,-62.8"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="652.75,-142.25 521.25,-142.25 521.25,-123 652.75,-123 652.75,-142.25"/>
-<text text-anchor="middle" x="587" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge10_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge10_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M448.11,-99.71C473.42,-105.75 505.84,-113.49 532.88,-119.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="531.71,-123.26 542.25,-122.18 533.34,-116.45 531.71,-123.26"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="652.75,-104.88 521.25,-104.88 521.25,-74.38 652.75,-74.38 652.75,-104.88"/>
-<text text-anchor="start" x="529.25" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::searching</text>
-<text text-anchor="middle" x="587" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge11_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge11_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M475.77,-89.62C486.78,-89.62 498.22,-89.62 509.37,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="509.34,-93.13 519.34,-89.63 509.34,-86.13 509.34,-93.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="namespacedouble__hashing_a5d06e4598569526294f10104875f6824_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph_org.svg b/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph_org.svg
deleted file mode 100644
index 8e5dd4de9..000000000
--- a/d0/d65/namespacedouble__hashing_a5d06e4598569526294f10104875f6824_cgraph_org.svg
+++ /dev/null
@@ -1,202 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: double_hashing::removalInfo Pages: 1 -->
-<svg width="671pt" height="198pt"
- viewBox="0.00 0.00 670.50 197.86" 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 193.86)">
-<title>double_hashing::removalInfo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="140.5,-156.25 0,-156.25 0,-137 140.5,-137 140.5,-156.25"/>
-<text text-anchor="middle" x="70.25" y="-142.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::removalInfo</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="465,-175.25 344.75,-175.25 344.75,-156 465,-156 465,-175.25"/>
-<text text-anchor="middle" x="404.88" y="-161.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.98,-150.61C197.3,-153.82 276.23,-158.33 332.88,-161.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="332.56,-165.06 342.75,-162.13 332.96,-158.07 332.56,-165.06"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="613.75,-179.25 560.25,-179.25 560.25,-160 613.75,-160 613.75,-179.25"/>
-<text text-anchor="middle" x="587" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.5,-156.66C129.36,-161.54 154.1,-167.09 176.5,-170.62 307.91,-191.34 342.77,-193.59 475.5,-184.62 499.95,-182.97 527.23,-179.29 548.57,-175.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="548.94,-179.47 558.26,-174.44 547.84,-172.56 548.94,-179.47"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="650.5,-19.25 523.5,-19.25 523.5,0 650.5,0 650.5,-19.25"/>
-<text text-anchor="middle" x="587" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.51,-136.62C117.67,-128.46 148.78,-116.95 176.5,-108.62 299.1,-71.79 445.46,-39.05 525.8,-22.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="526.14,-25.52 535.2,-20.04 524.7,-18.68 526.14,-25.52"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="298.25,-137.25 176.5,-137.25 176.5,-118 298.25,-118 298.25,-137.25"/>
-<text text-anchor="middle" x="237.38" y="-123.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::remove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.8,-138.62C148.77,-137.71 156.9,-136.77 164.89,-135.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.03,-139.36 174.56,-134.74 164.23,-132.4 165.03,-139.36"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M465.35,-166.95C492.7,-167.55 524.33,-168.26 548.33,-168.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="548.2,-172.29 558.28,-169.01 548.36,-165.29 548.2,-172.29"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge12_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge12_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M298.54,-130.36C346.61,-133.05 415.61,-138.03 475.5,-146.62 500.05,-150.15 527.33,-155.81 548.65,-160.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="547.81,-164.03 558.34,-162.87 549.39,-157.21 547.81,-164.03"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200" target="_top" xlink:title="Performs double hashing to resolve collisions.">
-<polygon fill="white" stroke="#666666" points="475.5,-99.25 334.25,-99.25 334.25,-80 475.5,-80 475.5,-99.25"/>
-<text text-anchor="middle" x="404.88" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::doubleHash</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.29,-117.54C302.76,-112.84 327.33,-107.2 349.01,-102.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="349.6,-105.68 358.57,-100.03 348.04,-98.86 349.6,-105.68"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge7_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge7_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M445.7,-99.69C455.87,-103.23 466.47,-107.81 475.5,-113.62 495.06,-126.22 491.37,-139.97 511.5,-151.62 522.79,-158.16 536.35,-162.33 548.79,-164.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="547.85,-168.37 558.32,-166.75 549.12,-161.49 547.85,-168.37"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge8_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M419.87,-79.58C439.47,-65.96 476.6,-41.72 511.5,-27.62 515.8,-25.89 520.32,-24.29 524.9,-22.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="525.62,-26.26 534.22,-20.07 523.64,-19.55 525.62,-26.26"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" target="_top" xlink:title="Used for second hash function.">
-<polygon fill="white" stroke="#666666" points="662.5,-56.25 511.5,-56.25 511.5,-37 662.5,-37 662.5,-56.25"/>
-<text text-anchor="middle" x="587" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::otherHashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge9_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge9_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M448.11,-79.54C473.42,-73.5 505.84,-65.76 532.88,-59.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.34,-62.8 542.25,-57.07 531.71,-55.99 533.34,-62.8"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="652.75,-142.25 521.25,-142.25 521.25,-123 652.75,-123 652.75,-142.25"/>
-<text text-anchor="middle" x="587" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge10_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge10_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M448.11,-99.71C473.42,-105.75 505.84,-113.49 532.88,-119.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="531.71,-123.26 542.25,-122.18 533.34,-116.45 531.71,-123.26"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="652.75,-104.88 521.25,-104.88 521.25,-74.38 652.75,-74.38 652.75,-104.88"/>
-<text text-anchor="start" x="529.25" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::searching</text>
-<text text-anchor="middle" x="587" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge11_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge11_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M475.77,-89.62C486.78,-89.62 498.22,-89.62 509.37,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="509.34,-93.13 519.34,-89.63 509.34,-86.13 509.34,-93.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.map b/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.map
deleted file mode 100644
index a9d5aa77b..000000000
--- a/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="double_hashing::add" name="double_hashing::add">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,19,146,44"/>
-<area shape="rect" id="Node000002" href="$d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200" title="Performs double hashing to resolve collisions." alt="" coords="194,80,382,106"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="124,42,227,73,225,78,122,48"/>
-<area shape="rect" id="Node000008" href="$d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d" title=" " alt="" coords="209,19,367,44"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="146,37,193,38,193,43,146,43"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="495,5,566,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="322,77,429,40,479,26,481,32,431,45,324,82"/>
-<area shape="rect" id="Node000004" href="$d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" title="Hash a key. Uses the STL library&#39;s std::hash() function." alt="" coords="446,55,615,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="382,80,430,75,431,81,383,86"/>
-<area shape="rect" id="Node000005" href="$d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" title="Used for second hash function." alt="" coords="430,104,631,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="383,99,415,103,414,108,382,105"/>
-<area shape="rect" id="Node000006" href="$d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" title=" " alt="" coords="443,153,618,179"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="325,104,431,140,456,147,455,152,429,145,323,109"/>
-<area shape="rect" id="Node000007" href="$d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" title=" " alt="" coords="443,203,618,244"/>
-<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="306,104,360,145,431,189,443,195,441,199,429,194,357,150,303,108"/>
-<area shape="poly" id="edge8_Node000008_Node000001" title=" " alt="" coords="208,25,161,25,161,20,208,20"/>
-<area shape="poly" id="edge9_Node000008_Node000003" title=" " alt="" coords="367,25,479,18,480,24,367,30"/>
-</map>
diff --git a/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.md5 b/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.md5
deleted file mode 100644
index 464a71ef1..000000000
--- a/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-dd5772442b12e80e9c4e82e78012a2ff
\ No newline at end of file
diff --git a/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.svg b/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.svg
deleted file mode 100644
index 32ac64392..000000000
--- a/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph.svg
+++ /dev/null
@@ -1,192 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: double_hashing::add Pages: 1 -->
-<svg width="478pt" height="187pt"
- viewBox="0.00 0.00 477.50 186.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 182.88)">
-<title>double_hashing::add</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="105.25,-168.88 0,-168.88 0,-149.62 105.25,-149.62 105.25,-168.88"/>
-<text text-anchor="middle" x="52.62" y="-155.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::add</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200" target="_top" xlink:title="Performs double hashing to resolve collisions.">
-<polygon fill="white" stroke="#666666" points="282.5,-122.88 141.25,-122.88 141.25,-103.62 282.5,-103.62 282.5,-122.88"/>
-<text text-anchor="middle" x="211.88" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::doubleHash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.13,-149.16C110.87,-142.5 140.88,-133.72 165.54,-126.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.38,-129.91 174.99,-123.75 164.41,-123.19 166.38,-129.91"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.25,-168.88 152.5,-168.88 152.5,-149.62 271.25,-149.62 271.25,-168.88"/>
-<text text-anchor="middle" x="211.88" y="-155.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::rehash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.55,-152.86C116.87,-152.54 129.03,-152.44 140.92,-152.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.64,-156.03 150.69,-152.68 140.74,-149.03 140.64,-156.03"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="420.75,-178.88 367.25,-178.88 367.25,-159.62 420.75,-159.62 420.75,-178.88"/>
-<text text-anchor="middle" x="394" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M238.23,-123.25C259.47,-131.41 290.68,-142.91 318.5,-151.25 330.57,-154.87 343.91,-158.27 355.93,-161.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="354.95,-164.49 365.48,-163.34 356.53,-157.68 354.95,-164.49"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="457.5,-141.88 330.5,-141.88 330.5,-122.62 457.5,-122.62 457.5,-141.88"/>
-<text text-anchor="middle" x="394" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.77,-120.62C294.61,-121.87 306.95,-123.17 318.89,-124.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.38,-127.9 328.69,-125.47 319.11,-120.94 318.38,-127.9"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" target="_top" xlink:title="Used for second hash function.">
-<polygon fill="white" stroke="#666666" points="469.5,-104.88 318.5,-104.88 318.5,-85.62 469.5,-85.62 469.5,-104.88"/>
-<text text-anchor="middle" x="394" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::otherHashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.77,-106.26C290.64,-105.48 298.72,-104.67 306.76,-103.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="306.96,-107.37 316.56,-102.89 306.27,-100.4 306.96,-107.37"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="459.75,-67.88 328.25,-67.88 328.25,-48.62 459.75,-48.62 459.75,-67.88"/>
-<text text-anchor="middle" x="394" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M239.12,-103.24C260.34,-95.34 291.11,-84.34 318.5,-76.25 324.63,-74.44 331.09,-72.68 337.53,-71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="337.99,-74.5 346.82,-68.65 336.27,-67.71 337.99,-74.5"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="459.75,-30.5 328.25,-30.5 328.25,0 459.75,0 459.75,-30.5"/>
-<text text-anchor="start" x="336.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::searching</text>
-<text text-anchor="middle" x="394" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.49,-103.33C243.18,-87.8 281.61,-57.59 318.5,-39.25 321.35,-37.83 324.31,-36.47 327.32,-35.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.36,-38.53 336.33,-31.55 325.75,-32.03 328.36,-38.53"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node1 -->
-<g id="edge8_Node000008_Node000001" class="edge">
-<title>Node8&#45;&gt;Node1</title>
-<g id="a_edge8_Node000008_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.21,-165.8C140.72,-166.03 128.62,-166.06 116.99,-165.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="117.14,-162.39 107.06,-165.67 116.99,-169.39 117.14,-162.39"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node3 -->
-<g id="edge9_Node000008_Node000003" class="edge">
-<title>Node8&#45;&gt;Node3</title>
-<g id="a_edge9_Node000008_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M271.36,-162.5C299.08,-164.04 331.37,-165.83 355.71,-167.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.28,-170.66 365.45,-167.72 355.66,-163.67 355.28,-170.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph_org.svg b/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph_org.svg
deleted file mode 100644
index 5e7151d73..000000000
--- a/d0/d65/namespacedouble__hashing_a79a9c914a6c68275b3640303d7faad8a_cgraph_org.svg
+++ /dev/null
@@ -1,166 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: double_hashing::add Pages: 1 -->
-<svg width="478pt" height="187pt"
- viewBox="0.00 0.00 477.50 186.88" 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 182.88)">
-<title>double_hashing::add</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="105.25,-168.88 0,-168.88 0,-149.62 105.25,-149.62 105.25,-168.88"/>
-<text text-anchor="middle" x="52.62" y="-155.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::add</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200" target="_top" xlink:title="Performs double hashing to resolve collisions.">
-<polygon fill="white" stroke="#666666" points="282.5,-122.88 141.25,-122.88 141.25,-103.62 282.5,-103.62 282.5,-122.88"/>
-<text text-anchor="middle" x="211.88" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::doubleHash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.13,-149.16C110.87,-142.5 140.88,-133.72 165.54,-126.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.38,-129.91 174.99,-123.75 164.41,-123.19 166.38,-129.91"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.25,-168.88 152.5,-168.88 152.5,-149.62 271.25,-149.62 271.25,-168.88"/>
-<text text-anchor="middle" x="211.88" y="-155.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::rehash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.55,-152.86C116.87,-152.54 129.03,-152.44 140.92,-152.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.64,-156.03 150.69,-152.68 140.74,-149.03 140.64,-156.03"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="420.75,-178.88 367.25,-178.88 367.25,-159.62 420.75,-159.62 420.75,-178.88"/>
-<text text-anchor="middle" x="394" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M238.23,-123.25C259.47,-131.41 290.68,-142.91 318.5,-151.25 330.57,-154.87 343.91,-158.27 355.93,-161.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="354.95,-164.49 365.48,-163.34 356.53,-157.68 354.95,-164.49"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="457.5,-141.88 330.5,-141.88 330.5,-122.62 457.5,-122.62 457.5,-141.88"/>
-<text text-anchor="middle" x="394" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.77,-120.62C294.61,-121.87 306.95,-123.17 318.89,-124.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.38,-127.9 328.69,-125.47 319.11,-120.94 318.38,-127.9"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" target="_top" xlink:title="Used for second hash function.">
-<polygon fill="white" stroke="#666666" points="469.5,-104.88 318.5,-104.88 318.5,-85.62 469.5,-85.62 469.5,-104.88"/>
-<text text-anchor="middle" x="394" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::otherHashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.77,-106.26C290.64,-105.48 298.72,-104.67 306.76,-103.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="306.96,-107.37 316.56,-102.89 306.27,-100.4 306.96,-107.37"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="459.75,-67.88 328.25,-67.88 328.25,-48.62 459.75,-48.62 459.75,-67.88"/>
-<text text-anchor="middle" x="394" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M239.12,-103.24C260.34,-95.34 291.11,-84.34 318.5,-76.25 324.63,-74.44 331.09,-72.68 337.53,-71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="337.99,-74.5 346.82,-68.65 336.27,-67.71 337.99,-74.5"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="459.75,-30.5 328.25,-30.5 328.25,0 459.75,0 459.75,-30.5"/>
-<text text-anchor="start" x="336.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::searching</text>
-<text text-anchor="middle" x="394" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.49,-103.33C243.18,-87.8 281.61,-57.59 318.5,-39.25 321.35,-37.83 324.31,-36.47 327.32,-35.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.36,-38.53 336.33,-31.55 325.75,-32.03 328.36,-38.53"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node1 -->
-<g id="edge8_Node000008_Node000001" class="edge">
-<title>Node8&#45;&gt;Node1</title>
-<g id="a_edge8_Node000008_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.21,-165.8C140.72,-166.03 128.62,-166.06 116.99,-165.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="117.14,-162.39 107.06,-165.67 116.99,-169.39 117.14,-162.39"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node3 -->
-<g id="edge9_Node000008_Node000003" class="edge">
-<title>Node8&#45;&gt;Node3</title>
-<g id="a_edge9_Node000008_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M271.36,-162.5C299.08,-164.04 331.37,-165.83 355.71,-167.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.28,-170.66 365.45,-167.72 355.66,-163.67 355.28,-170.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.map b/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.map
deleted file mode 100644
index 6e9434ced..000000000
--- a/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="double_hashing::doubleHash" name="double_hashing::doubleHash">
-<area shape="rect" id="Node000001" title="Performs double hashing to resolve collisions." alt="" coords="5,104,194,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="307,5,378,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="121,101,174,71,241,40,291,25,292,30,243,45,176,75,123,106"/>
-<area shape="rect" id="Node000003" href="$d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" title="Hash a key. Uses the STL library&#39;s std::hash() function." alt="" coords="258,55,427,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="166,101,260,81,261,87,167,106"/>
-<area shape="rect" id="Node000004" href="$d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" title="Used for second hash function." alt="" coords="242,104,443,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="194,114,226,114,226,120,194,120"/>
-<area shape="rect" id="Node000005" href="$d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" title=" " alt="" coords="255,153,430,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="167,128,261,147,260,152,166,133"/>
-<area shape="rect" id="Node000006" href="$d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" title=" " alt="" coords="255,203,430,244"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="124,128,178,158,243,189,258,195,256,200,241,194,175,162,122,133"/>
-</map>
diff --git a/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.md5 b/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.md5
deleted file mode 100644
index ae34accb9..000000000
--- a/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-15d7d83c986987a70013716a341866af
\ No newline at end of file
diff --git a/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.svg b/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.svg
deleted file mode 100644
index fa5fe0be6..000000000
--- a/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph.svg
+++ /dev/null
@@ -1,138 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: double_hashing::doubleHash Pages: 1 -->
-<svg width="336pt" height="187pt"
- viewBox="0.00 0.00 336.25 186.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 182.88)">
-<title>double_hashing::doubleHash</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Performs double hashing to resolve collisions.">
-<polygon fill="#999999" stroke="#666666" points="141.25,-104.88 0,-104.88 0,-85.62 141.25,-85.62 141.25,-104.88"/>
-<text text-anchor="middle" x="70.62" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::doubleHash</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279.5,-178.88 226,-178.88 226,-159.62 279.5,-159.62 279.5,-178.88"/>
-<text text-anchor="middle" x="252.75" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.5,-105.29C107.66,-117.67 143.87,-138.6 177.25,-151.25 189.13,-155.75 202.51,-159.4 214.62,-162.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.76,-165.6 224.28,-164.31 215.25,-158.76 213.76,-165.6"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="316.25,-141.88 189.25,-141.88 189.25,-122.62 316.25,-122.62 316.25,-141.88"/>
-<text text-anchor="middle" x="252.75" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.84,-105.36C142.69,-109.85 168.59,-115.17 191.57,-119.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.61,-123.26 201.11,-121.85 192.02,-116.41 190.61,-123.26"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" target="_top" xlink:title="Used for second hash function.">
-<polygon fill="white" stroke="#666666" points="328.25,-104.88 177.25,-104.88 177.25,-85.62 328.25,-85.62 328.25,-104.88"/>
-<text text-anchor="middle" x="252.75" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::otherHashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.52,-95.25C149.39,-95.25 157.47,-95.25 165.51,-95.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.31,-98.75 175.31,-95.25 165.31,-91.75 165.31,-98.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="318.5,-67.88 187,-67.88 187,-48.62 318.5,-48.62 318.5,-67.88"/>
-<text text-anchor="middle" x="252.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.84,-85.14C142.69,-80.65 168.59,-75.33 191.57,-70.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.02,-74.09 201.11,-68.65 190.61,-67.24 192.02,-74.09"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="318.5,-30.5 187,-30.5 187,0 318.5,0 318.5,-30.5"/>
-<text text-anchor="start" x="195" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::searching</text>
-<text text-anchor="middle" x="252.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.37,-85.18C108.83,-73.17 144.75,-52.98 177.25,-39.25 180.86,-37.72 184.61,-36.24 188.42,-34.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.59,-38.1 197.8,-31.4 187.2,-31.51 189.59,-38.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph_org.svg b/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph_org.svg
deleted file mode 100644
index 6649df2a9..000000000
--- a/d0/d65/namespacedouble__hashing_a8f8ff4fb018e1bb32d67d8a1885d3200_cgraph_org.svg
+++ /dev/null
@@ -1,112 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: double_hashing::doubleHash Pages: 1 -->
-<svg width="336pt" height="187pt"
- viewBox="0.00 0.00 336.25 186.88" 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 182.88)">
-<title>double_hashing::doubleHash</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Performs double hashing to resolve collisions.">
-<polygon fill="#999999" stroke="#666666" points="141.25,-104.88 0,-104.88 0,-85.62 141.25,-85.62 141.25,-104.88"/>
-<text text-anchor="middle" x="70.62" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::doubleHash</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279.5,-178.88 226,-178.88 226,-159.62 279.5,-159.62 279.5,-178.88"/>
-<text text-anchor="middle" x="252.75" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.5,-105.29C107.66,-117.67 143.87,-138.6 177.25,-151.25 189.13,-155.75 202.51,-159.4 214.62,-162.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.76,-165.6 224.28,-164.31 215.25,-158.76 213.76,-165.6"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="316.25,-141.88 189.25,-141.88 189.25,-122.62 316.25,-122.62 316.25,-141.88"/>
-<text text-anchor="middle" x="252.75" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.84,-105.36C142.69,-109.85 168.59,-115.17 191.57,-119.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.61,-123.26 201.11,-121.85 192.02,-116.41 190.61,-123.26"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" target="_top" xlink:title="Used for second hash function.">
-<polygon fill="white" stroke="#666666" points="328.25,-104.88 177.25,-104.88 177.25,-85.62 328.25,-85.62 328.25,-104.88"/>
-<text text-anchor="middle" x="252.75" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::otherHashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.52,-95.25C149.39,-95.25 157.47,-95.25 165.51,-95.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.31,-98.75 175.31,-95.25 165.31,-91.75 165.31,-98.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="318.5,-67.88 187,-67.88 187,-48.62 318.5,-48.62 318.5,-67.88"/>
-<text text-anchor="middle" x="252.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.84,-85.14C142.69,-80.65 168.59,-75.33 191.57,-70.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.02,-74.09 201.11,-68.65 190.61,-67.24 192.02,-74.09"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="318.5,-30.5 187,-30.5 187,0 318.5,0 318.5,-30.5"/>
-<text text-anchor="start" x="195" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::searching</text>
-<text text-anchor="middle" x="252.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.37,-85.18C108.83,-73.17 144.75,-52.98 177.25,-39.25 180.86,-37.72 184.61,-36.24 188.42,-34.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.59,-38.1 197.8,-31.4 187.2,-31.51 189.59,-38.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.map b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.map
deleted file mode 100644
index 9e5e4de61..000000000
--- a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.map
+++ /dev/null
@@ -1,26 +0,0 @@
-<map id="double_hashing::addInfo" name="double_hashing::addInfo">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,81,168,107"/>
-<area shape="rect" id="Node000002" href="$d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a" title=" " alt="" coords="226,107,366,132"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="169,101,211,107,210,112,168,107"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="725,41,797,67"/>
-<area shape="poly" id="edge13_Node000001_Node000004" title=" " alt="" coords="168,87,710,54,710,60,168,92"/>
-<area shape="rect" id="Node000005" href="$d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" title="Hash a key. Uses the STL library&#39;s std::hash() function." alt="" coords="676,255,846,280"/>
-<area shape="poly" id="edge14_Node000001_Node000005" title=" " alt="" coords="119,105,217,142,337,177,459,206,667,249,666,254,458,211,335,182,215,147,117,110"/>
-<area shape="rect" id="Node000010" href="$d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd" title=" " alt="" coords="216,5,376,31"/>
-<area shape="poly" id="edge11_Node000001_Node000010" title=" " alt="" coords="123,78,243,34,245,39,125,83"/>
-<area shape="rect" id="Node000003" href="$d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200" title="Performs double hashing to resolve collisions." alt="" coords="424,156,612,182"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="358,130,442,149,441,155,357,136"/>
-<area shape="rect" id="Node000009" href="$d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d" title=" " alt="" coords="439,107,597,132"/>
-<area shape="poly" id="edge8_Node000002_Node000009" title=" " alt="" coords="366,125,423,126,423,131,366,131"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="591,153,611,143,626,127,634,111,642,94,659,77,683,65,709,57,711,62,685,70,662,82,647,97,639,113,630,130,614,147,593,158"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="542,180,595,210,661,241,680,247,679,252,659,246,593,215,539,185"/>
-<area shape="rect" id="Node000006" href="$d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" title="Used for second hash function." alt="" coords="660,156,862,182"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="613,166,645,166,645,172,613,172"/>
-<area shape="rect" id="Node000007" href="$d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" title=" " alt="" coords="673,205,849,231"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="586,180,680,199,679,204,585,185"/>
-<area shape="rect" id="Node000008" href="$d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" title=" " alt="" coords="673,91,849,132"/>
-<area shape="poly" id="edge7_Node000003_Node000008" title=" " alt="" coords="575,153,657,133,659,138,576,158"/>
-<area shape="poly" id="edge9_Node000009_Node000002" title=" " alt="" coords="439,114,381,113,381,108,439,108"/>
-<area shape="poly" id="edge10_Node000009_Node000004" title=" " alt="" coords="565,103,660,77,709,64,711,69,661,82,566,109"/>
-<area shape="poly" id="edge12_Node000010_Node000004" title=" " alt="" coords="376,22,710,48,710,53,376,27"/>
-</map>
diff --git a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.md5 b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.md5
deleted file mode 100644
index 7c5f72745..000000000
--- a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1f73cc937ca8cbcfec637939c1afec7b
\ No newline at end of file
diff --git a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.svg b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.svg
deleted file mode 100644
index 6882fff34..000000000
--- a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph.svg
+++ /dev/null
@@ -1,312 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: double_hashing::addInfo Pages: 1 -->
-<!--zoomable 214 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 650;
-var viewHeight = 214;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>double_hashing::addInfo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="121.75,-149.25 0,-149.25 0,-130 121.75,-130 121.75,-149.25"/>
-<text text-anchor="middle" x="60.88" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::addInfo</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.5,-130.25 165.25,-130.25 165.25,-111 270.5,-111 270.5,-130.25"/>
-<text text-anchor="middle" x="217.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.25,-132.22C132.61,-130.95 143.4,-129.63 153.83,-128.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.97,-131.86 163.47,-127.17 153.12,-124.91 153.97,-131.86"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="593.5,-179.25 540,-179.25 540,-160 593.5,-160 593.5,-179.25"/>
-<text text-anchor="middle" x="566.75" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge13_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge13_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.15,-143.21C227.44,-149.48 441.85,-162.25 528.34,-167.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="527.97,-170.88 538.16,-167.98 528.38,-163.89 527.97,-170.88"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="630.25,-19.25 503.25,-19.25 503.25,0 630.25,0 630.25,-19.25"/>
-<text text-anchor="middle" x="566.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge14_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge14_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.4,-129.62C103.62,-121.35 132.13,-109.69 157.75,-101.62 274.17,-64.98 413.61,-36.79 495.65,-21.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="496.13,-25.23 505.35,-19.99 494.88,-18.34 496.13,-25.23"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278,-206.25 157.75,-206.25 157.75,-187 278,-187 278,-206.25"/>
-<text text-anchor="middle" x="217.88" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge11_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.23,-149.68C114.16,-158.85 151.24,-172.49 179.01,-182.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.52,-185.88 188.11,-186.05 179.94,-179.31 177.52,-185.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200" target="_top" xlink:title="Performs double hashing to resolve collisions.">
-<polygon fill="white" stroke="#666666" points="455.25,-93.25 314,-93.25 314,-74 455.25,-74 455.25,-93.25"/>
-<text text-anchor="middle" x="384.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::doubleHash</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.89,-110.51C283.51,-106.11 306.71,-100.9 327.44,-96.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.19,-99.66 337.18,-94.05 326.66,-92.83 328.19,-99.66"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="444,-130.25 325.25,-130.25 325.25,-111 444,-111 444,-130.25"/>
-<text text-anchor="middle" x="384.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::rehash</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.55,-114.31C284.18,-113.91 299.11,-113.78 313.53,-113.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.38,-117.44 323.44,-114.1 313.5,-110.44 313.38,-117.44"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M440.07,-93.73C445.43,-95.88 450.6,-98.48 455.25,-101.62 477.63,-116.77 468.85,-135.51 491.25,-150.62 502.26,-158.05 515.98,-162.58 528.62,-165.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="527.87,-168.75 538.34,-167.13 529.14,-161.87 527.87,-168.75"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M401.5,-73.58C421.66,-61.21 457.87,-40.28 491.25,-27.62 495.85,-25.88 500.68,-24.26 505.58,-22.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="506.21,-26.23 514.87,-20.13 504.3,-19.5 506.21,-26.23"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" target="_top" xlink:title="Used for second hash function.">
-<polygon fill="white" stroke="#666666" points="642.25,-93.25 491.25,-93.25 491.25,-74 642.25,-74 642.25,-93.25"/>
-<text text-anchor="middle" x="566.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::otherHashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M455.52,-83.62C463.39,-83.62 471.47,-83.62 479.51,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="479.31,-87.13 489.31,-83.63 479.31,-80.13 479.31,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="632.5,-56.25 501,-56.25 501,-37 632.5,-37 632.5,-56.25"/>
-<text text-anchor="middle" x="566.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M434.84,-73.51C456.69,-69.03 482.59,-63.71 505.57,-58.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="506.02,-62.47 515.11,-57.03 504.61,-55.61 506.02,-62.47"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="632.5,-141.88 501,-141.88 501,-111.38 632.5,-111.38 632.5,-141.88"/>
-<text text-anchor="start" x="509" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::searching</text>
-<text text-anchor="middle" x="566.75" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M427.86,-93.71C446.27,-98.1 468.45,-103.4 489.58,-108.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="488.5,-111.78 499.04,-110.7 490.13,-104.97 488.5,-111.78"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node2 -->
-<g id="edge9_Node000009_Node000002" class="edge">
-<title>Node9&#45;&gt;Node2</title>
-<g id="a_edge9_Node000009_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.95,-127.12C310.94,-127.43 295.92,-127.46 281.72,-127.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.14,-123.71 272.06,-126.98 281.98,-130.71 282.14,-123.71"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node4 -->
-<g id="edge10_Node000009_Node000004" class="edge">
-<title>Node9&#45;&gt;Node4</title>
-<g id="a_edge10_Node000009_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M420.29,-130.73C440.87,-136.66 467.51,-144.23 491.25,-150.62 503.36,-153.89 516.62,-157.32 528.55,-160.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="527.48,-163.69 538.03,-162.74 529.2,-156.9 527.48,-163.69"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node4 -->
-<g id="edge12_Node000010_Node000004" class="edge">
-<title>Node10&#45;&gt;Node4</title>
-<g id="a_edge12_Node000010_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.11,-192.01C349.77,-186.44 468.24,-177.22 528.32,-172.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="528.32,-176.05 538.02,-171.78 527.78,-169.07 528.32,-176.05"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph_org.svg b/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph_org.svg
deleted file mode 100644
index 75379c2bd..000000000
--- a/d0/d65/namespacedouble__hashing_a9c652b2e467e5d250dfe3bed83b12560_cgraph_org.svg
+++ /dev/null
@@ -1,229 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: double_hashing::addInfo Pages: 1 -->
-<svg width="650pt" height="214pt"
- viewBox="0.00 0.00 650.25 214.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 210.25)">
-<title>double_hashing::addInfo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="121.75,-149.25 0,-149.25 0,-130 121.75,-130 121.75,-149.25"/>
-<text text-anchor="middle" x="60.88" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::addInfo</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.5,-130.25 165.25,-130.25 165.25,-111 270.5,-111 270.5,-130.25"/>
-<text text-anchor="middle" x="217.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.25,-132.22C132.61,-130.95 143.4,-129.63 153.83,-128.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.97,-131.86 163.47,-127.17 153.12,-124.91 153.97,-131.86"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="593.5,-179.25 540,-179.25 540,-160 593.5,-160 593.5,-179.25"/>
-<text text-anchor="middle" x="566.75" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge13_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge13_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.15,-143.21C227.44,-149.48 441.85,-162.25 528.34,-167.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="527.97,-170.88 538.16,-167.98 528.38,-163.89 527.97,-170.88"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="630.25,-19.25 503.25,-19.25 503.25,0 630.25,0 630.25,-19.25"/>
-<text text-anchor="middle" x="566.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge14_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge14_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.4,-129.62C103.62,-121.35 132.13,-109.69 157.75,-101.62 274.17,-64.98 413.61,-36.79 495.65,-21.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="496.13,-25.23 505.35,-19.99 494.88,-18.34 496.13,-25.23"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278,-206.25 157.75,-206.25 157.75,-187 278,-187 278,-206.25"/>
-<text text-anchor="middle" x="217.88" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge11_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.23,-149.68C114.16,-158.85 151.24,-172.49 179.01,-182.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.52,-185.88 188.11,-186.05 179.94,-179.31 177.52,-185.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200" target="_top" xlink:title="Performs double hashing to resolve collisions.">
-<polygon fill="white" stroke="#666666" points="455.25,-93.25 314,-93.25 314,-74 455.25,-74 455.25,-93.25"/>
-<text text-anchor="middle" x="384.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::doubleHash</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.89,-110.51C283.51,-106.11 306.71,-100.9 327.44,-96.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.19,-99.66 337.18,-94.05 326.66,-92.83 328.19,-99.66"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="444,-130.25 325.25,-130.25 325.25,-111 444,-111 444,-130.25"/>
-<text text-anchor="middle" x="384.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::rehash</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.55,-114.31C284.18,-113.91 299.11,-113.78 313.53,-113.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.38,-117.44 323.44,-114.1 313.5,-110.44 313.38,-117.44"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M440.07,-93.73C445.43,-95.88 450.6,-98.48 455.25,-101.62 477.63,-116.77 468.85,-135.51 491.25,-150.62 502.26,-158.05 515.98,-162.58 528.62,-165.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="527.87,-168.75 538.34,-167.13 529.14,-161.87 527.87,-168.75"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M401.5,-73.58C421.66,-61.21 457.87,-40.28 491.25,-27.62 495.85,-25.88 500.68,-24.26 505.58,-22.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="506.21,-26.23 514.87,-20.13 504.3,-19.5 506.21,-26.23"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" target="_top" xlink:title="Used for second hash function.">
-<polygon fill="white" stroke="#666666" points="642.25,-93.25 491.25,-93.25 491.25,-74 642.25,-74 642.25,-93.25"/>
-<text text-anchor="middle" x="566.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::otherHashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M455.52,-83.62C463.39,-83.62 471.47,-83.62 479.51,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="479.31,-87.13 489.31,-83.63 479.31,-80.13 479.31,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="632.5,-56.25 501,-56.25 501,-37 632.5,-37 632.5,-56.25"/>
-<text text-anchor="middle" x="566.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M434.84,-73.51C456.69,-69.03 482.59,-63.71 505.57,-58.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="506.02,-62.47 515.11,-57.03 504.61,-55.61 506.02,-62.47"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="632.5,-141.88 501,-141.88 501,-111.38 632.5,-111.38 632.5,-141.88"/>
-<text text-anchor="start" x="509" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::searching</text>
-<text text-anchor="middle" x="566.75" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M427.86,-93.71C446.27,-98.1 468.45,-103.4 489.58,-108.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="488.5,-111.78 499.04,-110.7 490.13,-104.97 488.5,-111.78"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node2 -->
-<g id="edge9_Node000009_Node000002" class="edge">
-<title>Node9&#45;&gt;Node2</title>
-<g id="a_edge9_Node000009_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.95,-127.12C310.94,-127.43 295.92,-127.46 281.72,-127.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.14,-123.71 272.06,-126.98 281.98,-130.71 282.14,-123.71"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node4 -->
-<g id="edge10_Node000009_Node000004" class="edge">
-<title>Node9&#45;&gt;Node4</title>
-<g id="a_edge10_Node000009_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M420.29,-130.73C440.87,-136.66 467.51,-144.23 491.25,-150.62 503.36,-153.89 516.62,-157.32 528.55,-160.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="527.48,-163.69 538.03,-162.74 529.2,-156.9 527.48,-163.69"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node4 -->
-<g id="edge12_Node000010_Node000004" class="edge">
-<title>Node10&#45;&gt;Node4</title>
-<g id="a_edge12_Node000010_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.11,-192.01C349.77,-186.44 468.24,-177.22 528.32,-172.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="528.32,-176.05 538.02,-171.78 527.78,-169.07 528.32,-176.05"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.map b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.map
deleted file mode 100644
index 7da9d065f..000000000
--- a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="double_hashing::rehash" name="double_hashing::rehash">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,68,164,94"/>
-<area shape="rect" id="Node000002" href="$d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a" title=" " alt="" coords="212,68,352,94"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="164,87,196,87,196,92,164,92"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="701,5,773,31"/>
-<area shape="poly" id="edge9_Node000001_Node000004" title=" " alt="" coords="144,65,211,53,346,38,479,27,686,17,686,22,479,33,346,43,212,58,145,70"/>
-<area shape="poly" id="edge8_Node000002_Node000001" title=" " alt="" coords="211,75,179,75,179,69,211,70"/>
-<area shape="rect" id="Node000003" href="$d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200" title="Performs double hashing to resolve collisions." alt="" coords="400,80,588,106"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="353,82,384,84,384,89,352,87"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="528,77,636,40,686,26,687,32,637,45,530,82"/>
-<area shape="rect" id="Node000005" href="$d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" title="Hash a key. Uses the STL library&#39;s std::hash() function." alt="" coords="652,55,822,80"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="588,80,637,75,637,81,589,86"/>
-<area shape="rect" id="Node000006" href="$d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" title="Used for second hash function." alt="" coords="636,104,838,130"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="589,99,621,103,620,108,588,105"/>
-<area shape="rect" id="Node000007" href="$d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" title=" " alt="" coords="649,153,825,179"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="531,104,637,140,662,147,661,152,636,145,530,109"/>
-<area shape="rect" id="Node000008" href="$d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" title=" " alt="" coords="649,203,825,244"/>
-<area shape="poly" id="edge7_Node000003_Node000008" title=" " alt="" coords="513,104,566,145,638,189,649,195,647,199,635,194,563,150,509,108"/>
-</map>
diff --git a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.md5 b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.md5
deleted file mode 100644
index b35b2d114..000000000
--- a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ac5a0476f7b57aa6864f23dd8cf83e61
\ No newline at end of file
diff --git a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.svg b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.svg
deleted file mode 100644
index 416755398..000000000
--- a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph.svg
+++ /dev/null
@@ -1,249 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: double_hashing::rehash Pages: 1 -->
-<!--zoomable 187 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 632;
-var viewHeight = 187;
-var sectionId = 'dynsection-4';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>double_hashing::rehash</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="118.75,-131.88 0,-131.88 0,-112.62 118.75,-112.62 118.75,-131.88"/>
-<text text-anchor="middle" x="59.38" y="-118.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::rehash</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260,-131.88 154.75,-131.88 154.75,-112.62 260,-112.62 260,-131.88"/>
-<text text-anchor="middle" x="207.38" y="-118.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.92,-115.62C126.9,-115.49 135.12,-115.46 143.18,-115.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.84,-119.05 152.91,-115.73 142.97,-112.05 142.84,-119.05"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="575.5,-178.88 522,-178.88 522,-159.62 575.5,-159.62 575.5,-178.88"/>
-<text text-anchor="middle" x="548.75" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge9_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge9_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.35,-132.31C120.17,-135.61 138.19,-139 154.75,-141.25 284.82,-158.9 440.72,-165.82 510.63,-168.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="510.26,-171.67 520.37,-168.5 510.49,-164.68 510.26,-171.67"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node1 -->
-<g id="edge8_Node000002_Node000001" class="edge">
-<title>Node2&#45;&gt;Node1</title>
-<g id="a_edge8_Node000002_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.42,-128.74C146.6,-128.94 138.44,-129.02 130.32,-128.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.47,-125.5 120.43,-128.9 130.4,-132.5 130.47,-125.5"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200" target="_top" xlink:title="Performs double hashing to resolve collisions.">
-<polygon fill="white" stroke="#666666" points="437.25,-122.88 296,-122.88 296,-103.62 437.25,-103.62 437.25,-122.88"/>
-<text text-anchor="middle" x="366.62" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::doubleHash</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.3,-119.28C267.96,-118.84 276.01,-118.38 284.09,-117.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.22,-121.41 294.01,-117.35 283.82,-114.43 284.22,-121.41"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M392.98,-123.25C414.22,-131.41 445.43,-142.91 473.25,-151.25 485.32,-154.87 498.66,-158.27 510.68,-161.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="509.7,-164.49 520.23,-163.34 511.28,-157.68 509.7,-164.49"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="612.25,-141.88 485.25,-141.88 485.25,-122.62 612.25,-122.62 612.25,-141.88"/>
-<text text-anchor="middle" x="548.75" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M437.52,-120.62C449.36,-121.87 461.7,-123.17 473.64,-124.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="473.13,-127.9 483.44,-125.47 473.86,-120.94 473.13,-127.9"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" target="_top" xlink:title="Used for second hash function.">
-<polygon fill="white" stroke="#666666" points="624.25,-104.88 473.25,-104.88 473.25,-85.62 624.25,-85.62 624.25,-104.88"/>
-<text text-anchor="middle" x="548.75" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::otherHashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M437.52,-106.26C445.39,-105.48 453.47,-104.67 461.51,-103.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="461.71,-107.37 471.31,-102.89 461.02,-100.4 461.71,-107.37"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="614.5,-67.88 483,-67.88 483,-48.62 614.5,-48.62 614.5,-67.88"/>
-<text text-anchor="middle" x="548.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M393.87,-103.24C415.09,-95.34 445.86,-84.34 473.25,-76.25 479.38,-74.44 485.84,-72.68 492.28,-71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="492.74,-74.5 501.57,-68.65 491.02,-67.71 492.74,-74.5"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="614.5,-30.5 483,-30.5 483,0 614.5,0 614.5,-30.5"/>
-<text text-anchor="start" x="491" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::searching</text>
-<text text-anchor="middle" x="548.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M379.24,-103.33C397.93,-87.8 436.36,-57.59 473.25,-39.25 476.1,-37.83 479.06,-36.47 482.07,-35.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="483.11,-38.53 491.08,-31.55 480.5,-32.03 483.11,-38.53"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph_org.svg b/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph_org.svg
deleted file mode 100644
index d0e2e997e..000000000
--- a/d0/d65/namespacedouble__hashing_af4981819aae8bc7e7beeaef02615e30d_cgraph_org.svg
+++ /dev/null
@@ -1,166 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: double_hashing::rehash Pages: 1 -->
-<svg width="632pt" height="187pt"
- viewBox="0.00 0.00 632.25 186.88" 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 182.88)">
-<title>double_hashing::rehash</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="118.75,-131.88 0,-131.88 0,-112.62 118.75,-112.62 118.75,-131.88"/>
-<text text-anchor="middle" x="59.38" y="-118.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::rehash</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260,-131.88 154.75,-131.88 154.75,-112.62 260,-112.62 260,-131.88"/>
-<text text-anchor="middle" x="207.38" y="-118.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.92,-115.62C126.9,-115.49 135.12,-115.46 143.18,-115.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.84,-119.05 152.91,-115.73 142.97,-112.05 142.84,-119.05"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="575.5,-178.88 522,-178.88 522,-159.62 575.5,-159.62 575.5,-178.88"/>
-<text text-anchor="middle" x="548.75" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge9_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge9_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.35,-132.31C120.17,-135.61 138.19,-139 154.75,-141.25 284.82,-158.9 440.72,-165.82 510.63,-168.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="510.26,-171.67 520.37,-168.5 510.49,-164.68 510.26,-171.67"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node1 -->
-<g id="edge8_Node000002_Node000001" class="edge">
-<title>Node2&#45;&gt;Node1</title>
-<g id="a_edge8_Node000002_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.42,-128.74C146.6,-128.94 138.44,-129.02 130.32,-128.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.47,-125.5 120.43,-128.9 130.4,-132.5 130.47,-125.5"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200" target="_top" xlink:title="Performs double hashing to resolve collisions.">
-<polygon fill="white" stroke="#666666" points="437.25,-122.88 296,-122.88 296,-103.62 437.25,-103.62 437.25,-122.88"/>
-<text text-anchor="middle" x="366.62" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::doubleHash</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.3,-119.28C267.96,-118.84 276.01,-118.38 284.09,-117.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.22,-121.41 294.01,-117.35 283.82,-114.43 284.22,-121.41"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M392.98,-123.25C414.22,-131.41 445.43,-142.91 473.25,-151.25 485.32,-154.87 498.66,-158.27 510.68,-161.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="509.7,-164.49 520.23,-163.34 511.28,-157.68 509.7,-164.49"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="612.25,-141.88 485.25,-141.88 485.25,-122.62 612.25,-122.62 612.25,-141.88"/>
-<text text-anchor="middle" x="548.75" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M437.52,-120.62C449.36,-121.87 461.7,-123.17 473.64,-124.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="473.13,-127.9 483.44,-125.47 473.86,-120.94 473.13,-127.9"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" target="_top" xlink:title="Used for second hash function.">
-<polygon fill="white" stroke="#666666" points="624.25,-104.88 473.25,-104.88 473.25,-85.62 624.25,-85.62 624.25,-104.88"/>
-<text text-anchor="middle" x="548.75" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::otherHashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M437.52,-106.26C445.39,-105.48 453.47,-104.67 461.51,-103.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="461.71,-107.37 471.31,-102.89 461.02,-100.4 461.71,-107.37"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="614.5,-67.88 483,-67.88 483,-48.62 614.5,-48.62 614.5,-67.88"/>
-<text text-anchor="middle" x="548.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M393.87,-103.24C415.09,-95.34 445.86,-84.34 473.25,-76.25 479.38,-74.44 485.84,-72.68 492.28,-71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="492.74,-74.5 501.57,-68.65 491.02,-67.71 492.74,-74.5"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="614.5,-30.5 483,-30.5 483,0 614.5,0 614.5,-30.5"/>
-<text text-anchor="start" x="491" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::searching</text>
-<text text-anchor="middle" x="548.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M379.24,-103.33C397.93,-87.8 436.36,-57.59 473.25,-39.25 476.1,-37.83 479.06,-36.47 482.07,-35.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="483.11,-38.53 491.08,-31.55 480.5,-32.03 483.11,-38.53"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d6d/modular__exponentiation_8cpp.html b/d0/d6d/modular__exponentiation_8cpp.html
index db31bec30..20d8c83e4 100644
--- a/d0/d6d/modular__exponentiation_8cpp.html
+++ b/d0/d6d/modular__exponentiation_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/modular_exponentiation.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/modular_exponentiation.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for modular_exponentiation.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/dd3/modular__exponentiation_8cpp__incl.svg" width="255" height="111"><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">
+</div>
+<p><a href="../../d0/d6d/modular__exponentiation_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -144,6 +163,8 @@ Functions</h2></td></tr>
 <p>The task is to calculate the value of an integer a raised to an integer exponent b under modulo c. </p><dl class="section note"><dt>Note</dt><dd>The time complexity of this approach is O(log b).</dd></dl>
 <p>Example: (4^3) % 5 (where ^ stands for exponentiation and % for modulo) (4*4*4) % 5 (4 % 5) * ( (4*4) % 5 ) 4 * (16 % 5) 4 * 1 4 We can also verify the result as 4^3 is 64 and 64 modulo 5 is 4</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Shri2206" target="_blank">Shri2206</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d0/d6d/modular__exponentiation_8cpp_source.html">modular_exponentiation.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -162,17 +183,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d6d/modular__exponentiation_8cpp_source.html#l00086">86</a> of file <a class="el" href="../../d0/d6d/modular__exponentiation_8cpp_source.html">modular_exponentiation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   86</span>           {</div>
 <div class="line"><span class="lineno">   87</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the tests</span></div>
 <div class="line"><span class="lineno">   88</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   89</span>}</div>
-<div class="ttc" id="amodular__exponentiation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> modular_exponentiation.cpp:60</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="294" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amodular__exponentiation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d6d/modular__exponentiation_8cpp_source.html#l00060">modular_exponentiation.cpp:60</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -198,36 +216,31 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Function for testing power function. test cases and assert statement. </p><dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d6d/modular__exponentiation_8cpp_source.html#l00060">60</a> of file <a class="el" href="../../d0/d6d/modular__exponentiation_8cpp_source.html">modular_exponentiation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   60</span>                   {</div>
 <div class="line"><span class="lineno">   61</span>    uint32_t test_case_1 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">math::power</a>(2, 5, 13);</div>
 <div class="line"><span class="lineno">   62</span>    assert(test_case_1 == 6);</div>
-<div class="line"><span class="lineno">   63</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed!&quot;</span> &lt;&lt; <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">   63</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   64</span> </div>
 <div class="line"><span class="lineno">   65</span>    uint32_t test_case_2 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">math::power</a>(14, 7, 15);</div>
 <div class="line"><span class="lineno">   66</span>    assert(test_case_2 == 14);</div>
-<div class="line"><span class="lineno">   67</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed!&quot;</span> &lt;&lt; <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">   67</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   68</span> </div>
 <div class="line"><span class="lineno">   69</span>    uint64_t test_case_3 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">math::power</a>(8, 15, 41);</div>
 <div class="line"><span class="lineno">   70</span>    assert(test_case_3 == 32);</div>
-<div class="line"><span class="lineno">   71</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed!&quot;</span> &lt;&lt; <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">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   72</span> </div>
 <div class="line"><span class="lineno">   73</span>    uint64_t test_case_4 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">math::power</a>(27, 2, 5);</div>
 <div class="line"><span class="lineno">   74</span>    assert(test_case_4 == 4);</div>
-<div class="line"><span class="lineno">   75</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 4 Passed!&quot;</span> &lt;&lt; <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">   75</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   76</span> </div>
 <div class="line"><span class="lineno">   77</span>    uint16_t test_case_5 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">math::power</a>(7, 3, 6);</div>
 <div class="line"><span class="lineno">   78</span>    assert(test_case_5 == 1);</div>
-<div class="line"><span class="lineno">   79</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 5 Passed!&quot;</span> &lt;&lt; <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">   79</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 5 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   80</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="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="anamespacemath_html_afcd07701d73ed65cd616bcba02737f3d"><div class="ttname"><a href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">math::power</a></div><div class="ttdeci">uint64_t power(uint64_t a, uint64_t b, uint64_t c)</div><div class="ttdoc">This function calculates a raised to exponent b under modulo c using modular exponentiation.</div><div class="ttdef"><b>Definition</b> modular_exponentiation.cpp:35</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="196" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemath_html_afcd07701d73ed65cd616bcba02737f3d"><div class="ttname"><a href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">math::power</a></div><div class="ttdeci">uint64_t power(uint64_t a, uint64_t b, uint64_t c)</div><div class="ttdoc">This function calculates a raised to exponent b under modulo c using modular exponentiation.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d6d/modular__exponentiation_8cpp_source.html#l00035">modular_exponentiation.cpp:35</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 552e455b3..000000000
--- a/d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,49,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="108,5,179,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,36,92,27,93,32,50,41"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d" title="This function calculates a raised to exponent b under modulo c using modular exponentiation." alt="" coords="97,55,190,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="50,45,82,52,81,57,49,51"/>
-</map>
diff --git a/d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 8f195de6a..000000000
--- a/d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7251ae859ad0305c763cd4840f279c9d
\ No newline at end of file
diff --git a/d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 89c4273dc..000000000
--- a/d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="147pt" height="64pt"
- viewBox="0.00 0.00 146.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="130.25,-56.25 76.75,-56.25 76.75,-37 130.25,-37 130.25,-56.25"/>
-<text text-anchor="middle" x="103.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.89,-31.11C42.04,-33.15 54.02,-35.82 65.46,-38.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.59,-41.76 75.11,-40.52 66.11,-34.93 64.59,-41.76"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d" target="_top" xlink:title="This function calculates a raised to exponent b under modulo c using modular exponentiation.">
-<polygon fill="white" stroke="#666666" points="138.5,-19.25 68.5,-19.25 68.5,0 138.5,0 138.5,-19.25"/>
-<text text-anchor="middle" x="103.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::power</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.89,-24.32C39.85,-22.85 48.44,-21.04 57.19,-19.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.69,-22.66 66.76,-17.17 56.25,-15.81 57.69,-22.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1f20011be..000000000
--- a/d0/d6d/modular__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="147pt" height="64pt"
- viewBox="0.00 0.00 146.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="130.25,-56.25 76.75,-56.25 76.75,-37 130.25,-37 130.25,-56.25"/>
-<text text-anchor="middle" x="103.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.89,-31.11C42.04,-33.15 54.02,-35.82 65.46,-38.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.59,-41.76 75.11,-40.52 66.11,-34.93 64.59,-41.76"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d" target="_top" xlink:title="This function calculates a raised to exponent b under modulo c using modular exponentiation.">
-<polygon fill="white" stroke="#666666" points="138.5,-19.25 68.5,-19.25 68.5,0 138.5,0 138.5,-19.25"/>
-<text text-anchor="middle" x="103.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::power</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.89,-24.32C39.85,-22.85 48.44,-21.04 57.19,-19.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.69,-22.66 66.76,-17.17 56.25,-15.81 57.69,-22.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 7b8f19a48..000000000
--- a/d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title=" " alt="" coords="103,31,146,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,41,87,41,87,46,55,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="205,5,276,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,36,189,27,191,32,147,41"/>
-<area shape="rect" id="Node000004" href="$dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d" title="This function calculates a raised to exponent b under modulo c using modular exponentiation." alt="" coords="194,55,287,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="147,45,179,52,178,57,146,51"/>
-</map>
diff --git a/d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index d45a9ecbd..000000000
--- a/d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-97ac56c51b855eab2d628c38e8e0fa43
\ No newline at end of file
diff --git a/d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 7d5d3b230..000000000
--- a/d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="220pt" height="64pt"
- viewBox="0.00 0.00 219.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203.25,-56.25 149.75,-56.25 149.75,-37 203.25,-37 203.25,-56.25"/>
-<text text-anchor="middle" x="176.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.89,-31.11C115.04,-33.15 127.02,-35.82 138.46,-38.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.59,-41.76 148.11,-40.52 139.11,-34.93 137.59,-41.76"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d" target="_top" xlink:title="This function calculates a raised to exponent b under modulo c using modular exponentiation.">
-<polygon fill="white" stroke="#666666" points="211.5,-19.25 141.5,-19.25 141.5,0 211.5,0 211.5,-19.25"/>
-<text text-anchor="middle" x="176.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::power</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.89,-24.32C112.85,-22.85 121.44,-21.04 130.19,-19.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.69,-22.66 139.76,-17.17 129.25,-15.81 130.69,-22.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 8cd567ed7..000000000
--- a/d0/d6d/modular__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="220pt" height="64pt"
- viewBox="0.00 0.00 219.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203.25,-56.25 149.75,-56.25 149.75,-37 203.25,-37 203.25,-56.25"/>
-<text text-anchor="middle" x="176.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.89,-31.11C115.04,-33.15 127.02,-35.82 138.46,-38.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.59,-41.76 148.11,-40.52 139.11,-34.93 137.59,-41.76"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d" target="_top" xlink:title="This function calculates a raised to exponent b under modulo c using modular exponentiation.">
-<polygon fill="white" stroke="#666666" points="211.5,-19.25 141.5,-19.25 141.5,0 211.5,0 211.5,-19.25"/>
-<text text-anchor="middle" x="176.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::power</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.89,-24.32C112.85,-22.85 121.44,-21.04 130.19,-19.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.69,-22.66 139.76,-17.17 129.25,-15.81 130.69,-22.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d6d/modular__exponentiation_8cpp_source.html b/d0/d6d/modular__exponentiation_8cpp_source.html
new file mode 100644
index 000000000..42bba8848
--- /dev/null
+++ b/d0/d6d/modular__exponentiation_8cpp_source.html
@@ -0,0 +1,196 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/modular_exponentiation.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d0/d6d/modular__exponentiation_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">modular_exponentiation.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d0/d6d/modular__exponentiation_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="foldopen" id="foldopen00035" data-start="{" data-end="}">
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">   35</a></span>uint64_t <a class="code hl_function" href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">power</a>(uint64_t a, uint64_t b, uint64_t c) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    uint64_t ans = 1;  </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    a = a % c;         </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">if</span> (a == 0) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        <span class="keywordflow">return</span> 0;  </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    }</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">while</span> (b &gt; 0) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="keywordflow">if</span> (b &amp; 1) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>            ans = ((ans % c) * (a % c)) % c;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        }</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        b = b &gt;&gt; 1;  </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        a = ((a % c) * (a % c)) % c;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordflow">return</span> ans;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>}</div>
+</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="foldopen" id="foldopen00060" data-start="{" data-end="}">
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"><a class="line" href="../../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   60</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    uint32_t test_case_1 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">math::power</a>(2, 5, 13);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    assert(test_case_1 == 6);</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    uint32_t test_case_2 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">math::power</a>(14, 7, 15);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    assert(test_case_2 == 14);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    uint64_t test_case_3 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">math::power</a>(8, 15, 41);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    assert(test_case_3 == 32);</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    uint64_t test_case_4 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">math::power</a>(27, 2, 5);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    assert(test_case_4 == 4);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    uint16_t test_case_5 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">math::power</a>(7, 3, 6);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    assert(test_case_5 == 1);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 5 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>}</div>
+</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="foldopen" id="foldopen00086" data-start="{" data-end="}">
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="../../d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   86</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <a class="code hl_function" href="../../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the tests</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>}</div>
+</div>
+<div class="ttc" id="amodular__exponentiation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00060">modular_exponentiation.cpp:60</a></div></div>
+<div class="ttc" id="amodular__exponentiation_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00086">modular_exponentiation.cpp:86</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_afcd07701d73ed65cd616bcba02737f3d"><div class="ttname"><a href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">math::power</a></div><div class="ttdeci">uint64_t power(uint64_t a, uint64_t b, uint64_t c)</div><div class="ttdoc">This function calculates a raised to exponent b under modulo c using modular exponentiation.</div><div class="ttdef"><b>Definition</b> <a href="#l00035">modular_exponentiation.cpp:35</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d0/d6d/modular__exponentiation_8cpp.html">modular_exponentiation.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d0/d6f/namespaceothers.html b/d0/d6f/namespaceothers.html
index f0522f0cf..ebe1cde90 100644
--- a/d0/d6f/namespaceothers.html
+++ b/d0/d6f/namespaceothers.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others Namespace Reference</title>
+<title>TheAlgorithms/C++: others Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -139,9 +156,9 @@ Functions</h2></td></tr>
 <p>Other algorithms</p>
 <p>for assert for std::abs</p>
 <p>Other algorithms</p>
-<p>for IO Operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a></p>
+<p>for IO Operations for std::list for std::unordered_map</p>
 <p>Other algorithms</p>
-<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> for I/O operations</p>
+<p>for assert for std::uint64_t for I/O operations</p>
 <p>Other algorithms </p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="aa17dc6d061dff34f6b9a610bc5e26703" name="aa17dc6d061dff34f6b9a610bc5e26703"></a>
@@ -180,6 +197,8 @@ Functions</h2></td></tr>
 <dl class="section return"><dt>Returns</dt><dd>true if the numbers ARE equal within the given tolerance </dd>
 <dd>
 false if the numbers are NOT equal within the given tolerance otherwise </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d6b/kelvin__to__celsius_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../db/d6b/kelvin__to__celsius_8cpp_source.html">kelvin_to_celsius.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   40</span>                                                                              {</div>
 <div class="line"><span class="lineno">   41</span>    <span class="keywordflow">return</span> std::abs(a - b) &lt; absolute_tolerance;</div>
 <div class="line"><span class="lineno">   42</span>}</div>
@@ -209,14 +228,15 @@ false if the numbers are NOT equal within the given tolerance otherwise </dd></d
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the Kelvin number converted to Celsius </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d6b/kelvin__to__celsius_8cpp_source.html#l00049">49</a> of file <a class="el" href="../../db/d6b/kelvin__to__celsius_8cpp_source.html">kelvin_to_celsius.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   49</span>                                                  {</div>
 <div class="line"><span class="lineno">   50</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> absolute_zero_in_c = -273.15;</div>
 <div class="line"><span class="lineno">   51</span>    <span class="keywordflow">if</span> (temperature_in_k &lt; absolute_zero_in_c) {</div>
-<div class="line"><span class="lineno">   52</span>        <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>(<span class="stringliteral">&quot;input temperature below absolute zero&quot;</span>);</div>
+<div class="line"><span class="lineno">   52</span>        <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;input temperature below absolute zero&quot;</span>);</div>
 <div class="line"><span class="lineno">   53</span>    }</div>
 <div class="line"><span class="lineno">   54</span>    <span class="keywordflow">return</span> temperature_in_k + absolute_zero_in_c;</div>
 <div class="line"><span class="lineno">   55</span>}</div>
-<div class="ttc" id="ainvalid_argument_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/d0/d77/longest__palindromic__subsequence_8cpp.html b/d0/d77/longest__palindromic__subsequence_8cpp.html
index f9b9facfb..60e8189d9 100644
--- a/d0/d77/longest__palindromic__subsequence_8cpp.html
+++ b/d0/d77/longest__palindromic__subsequence_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/longest_palindromic_subsequence.cpp File Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming/longest_palindromic_subsequence.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for longest_palindromic_subsequence.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dc1/longest__palindromic__subsequence_8cpp__incl.svg" width="235" height="140"><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">
+</div>
+<p><a href="../../d0/d77/longest__palindromic__subsequence_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
@@ -130,7 +149,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:afe9f45b6e30ee187509da2d1d0093412" id="r_afe9f45b6e30ee187509da2d1d0093412"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;a)</td></tr>
+<tr class="memitem:afe9f45b6e30ee187509da2d1d0093412" id="r_afe9f45b6e30ee187509da2d1d0093412"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a> (const std::string &amp;a)</td></tr>
 <tr class="memdesc:afe9f45b6e30ee187509da2d1d0093412"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that returns the longest palindromic subsequence of a string.  <br /></td></tr>
 <tr class="separator:afe9f45b6e30ee187509da2d1d0093412"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -144,6 +163,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Program to find the <a href="https://www.geeksforgeeks.org/longest-palindromic-subsequence-dp-12/" target="_blank">Longest Palindormic Subsequence</a> of a string. </p>
 <p><a href="https://en.wikipedia.org/wiki/Palindrome" target="_blank">Palindrome</a> string sequence of characters which reads the same backward as forward <a href="https://en.wikipedia.org/wiki/Subsequence" target="_blank">Subsequence</a> is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/anjali1903" target="_blank">Anjali Jha</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d0/d77/longest__palindromic__subsequence_8cpp_source.html">longest_palindromic_subsequence.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -162,17 +183,14 @@ Functions</h2></td></tr>
 
 <p>Main Function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d77/longest__palindromic__subsequence_8cpp_source.html#l00097">97</a> of file <a class="el" href="../../d0/d77/longest__palindromic__subsequence_8cpp_source.html">longest_palindromic_subsequence.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   97</span>           {</div>
 <div class="line"><span class="lineno">   98</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the tests</span></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="alongest__palindromic__subsequence_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> longest_palindromic_subsequence.cpp:86</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d77/longest__palindromic__subsequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="498" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="alongest__palindromic__subsequence_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d77/longest__palindromic__subsequence_8cpp_source.html#l00086">longest_palindromic_subsequence.cpp:86</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -200,19 +218,16 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d77/longest__palindromic__subsequence_8cpp_source.html#l00086">86</a> of file <a class="el" href="../../d0/d77/longest__palindromic__subsequence_8cpp_source.html">longest_palindromic_subsequence.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   86</span>                   {</div>
 <div class="line"><span class="lineno">   87</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a>(<span class="stringliteral">&quot;radar&quot;</span>) == <span class="stringliteral">&quot;radar&quot;</span>);</div>
 <div class="line"><span class="lineno">   88</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a>(<span class="stringliteral">&quot;abbcbaa&quot;</span>) == <span class="stringliteral">&quot;abcba&quot;</span>);</div>
 <div class="line"><span class="lineno">   89</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a>(<span class="stringliteral">&quot;bbbab&quot;</span>) == <span class="stringliteral">&quot;bbbb&quot;</span>);</div>
 <div class="line"><span class="lineno">   90</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a>(<span class="stringliteral">&quot;&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
 <div class="line"><span class="lineno">   91</span>}</div>
-<div class="ttc" id="anamespacedynamic__programming_html_afe9f45b6e30ee187509da2d1d0093412"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a></div><div class="ttdeci">std::string lps(const std::string &amp;a)</div><div class="ttdoc">Function that returns the longest palindromic subsequence of a string.</div><div class="ttdef"><b>Definition</b> longest_palindromic_subsequence.cpp:31</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d77/longest__palindromic__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="400" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacedynamic__programming_html_afe9f45b6e30ee187509da2d1d0093412"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a></div><div class="ttdeci">std::string lps(const std::string &amp;a)</div><div class="ttdoc">Function that returns the longest palindromic subsequence of a string.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d77/longest__palindromic__subsequence_8cpp_source.html#l00031">longest_palindromic_subsequence.cpp:31</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d0/d77/longest__palindromic__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d0/d77/longest__palindromic__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 2a6c0619b..000000000
--- a/d0/d77/longest__palindromic__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="$dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412" title="Function that returns the longest palindromic subsequence of a string." alt="" coords="97,5,274,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="322,5,394,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="274,16,306,16,306,21,274,21"/>
-</map>
diff --git a/d0/d77/longest__palindromic__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d0/d77/longest__palindromic__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 05140b19f..000000000
--- a/d0/d77/longest__palindromic__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-15137a1a5cea025c8bf468702bd170d3
\ No newline at end of file
diff --git a/d0/d77/longest__palindromic__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d0/d77/longest__palindromic__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 1d9263fc6..000000000
--- a/d0/d77/longest__palindromic__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="300pt" height="27pt"
- viewBox="0.00 0.00 299.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412" target="_top" xlink:title="Function that returns the longest palindromic subsequence of a string.">
-<polygon fill="white" stroke="#666666" points="201.5,-19.25 68.5,-19.25 68.5,0 201.5,0 201.5,-19.25"/>
-<text text-anchor="middle" x="135" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming::lps</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33,-9.62C39.6,-9.62 47.81,-9.62 56.68,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.67,-13.13 66.67,-9.63 56.67,-6.13 56.67,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.75,-19.25 237.5,-19.25 237.5,0 291.75,0 291.75,-19.25"/>
-<text text-anchor="middle" x="264.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.68,-9.62C209.94,-9.62 218.15,-9.62 225.77,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.66,-13.13 235.66,-9.63 225.66,-6.13 225.66,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d77/longest__palindromic__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d0/d77/longest__palindromic__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 9ffce9a96..000000000
--- a/d0/d77/longest__palindromic__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="300pt" height="27pt"
- viewBox="0.00 0.00 299.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412" target="_top" xlink:title="Function that returns the longest palindromic subsequence of a string.">
-<polygon fill="white" stroke="#666666" points="201.5,-19.25 68.5,-19.25 68.5,0 201.5,0 201.5,-19.25"/>
-<text text-anchor="middle" x="135" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming::lps</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33,-9.62C39.6,-9.62 47.81,-9.62 56.68,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.67,-13.13 66.67,-9.63 56.67,-6.13 56.67,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.75,-19.25 237.5,-19.25 237.5,0 291.75,0 291.75,-19.25"/>
-<text text-anchor="middle" x="264.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.68,-9.62C209.94,-9.62 218.15,-9.62 225.77,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.66,-13.13 235.66,-9.63 225.66,-6.13 225.66,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d77/longest__palindromic__subsequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d0/d77/longest__palindromic__subsequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 0c6d73bae..000000000
--- a/d0/d77/longest__palindromic__subsequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main Function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="$dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412" title="Function that returns the longest palindromic subsequence of a string." alt="" coords="194,5,371,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="147,16,178,16,178,21,147,21"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="419,5,492,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="372,16,404,16,404,21,372,21"/>
-</map>
diff --git a/d0/d77/longest__palindromic__subsequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d0/d77/longest__palindromic__subsequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index b6578420a..000000000
--- a/d0/d77/longest__palindromic__subsequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e7a174500f775092bdf662173d0e5fd1
\ No newline at end of file
diff --git a/d0/d77/longest__palindromic__subsequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d0/d77/longest__palindromic__subsequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index cd3b38986..000000000
--- a/d0/d77/longest__palindromic__subsequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="373pt" height="27pt"
- viewBox="0.00 0.00 372.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main Function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412" target="_top" xlink:title="Function that returns the longest palindromic subsequence of a string.">
-<polygon fill="white" stroke="#666666" points="274.5,-19.25 141.5,-19.25 141.5,0 274.5,0 274.5,-19.25"/>
-<text text-anchor="middle" x="208" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming::lps</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106,-9.62C112.6,-9.62 120.81,-9.62 129.68,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.67,-13.13 139.67,-9.63 129.67,-6.13 129.67,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="364.75,-19.25 310.5,-19.25 310.5,0 364.75,0 364.75,-19.25"/>
-<text text-anchor="middle" x="337.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.68,-9.62C282.94,-9.62 291.15,-9.62 298.77,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.66,-13.13 308.66,-9.63 298.66,-6.13 298.66,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/d77/longest__palindromic__subsequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d0/d77/longest__palindromic__subsequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 6f480fc61..000000000
--- a/d0/d77/longest__palindromic__subsequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="373pt" height="27pt"
- viewBox="0.00 0.00 372.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main Function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412" target="_top" xlink:title="Function that returns the longest palindromic subsequence of a string.">
-<polygon fill="white" stroke="#666666" points="274.5,-19.25 141.5,-19.25 141.5,0 274.5,0 274.5,-19.25"/>
-<text text-anchor="middle" x="208" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming::lps</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106,-9.62C112.6,-9.62 120.81,-9.62 129.68,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.67,-13.13 139.67,-9.63 129.67,-6.13 129.67,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="364.75,-19.25 310.5,-19.25 310.5,0 364.75,0 364.75,-19.25"/>
-<text text-anchor="middle" x="337.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.68,-9.62C282.94,-9.62 291.15,-9.62 298.77,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.66,-13.13 308.66,-9.63 298.66,-6.13 298.66,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/d77/longest__palindromic__subsequence_8cpp_source.html b/d0/d77/longest__palindromic__subsequence_8cpp_source.html
new file mode 100644
index 000000000..4b6a81c7f
--- /dev/null
+++ b/d0/d77/longest__palindromic__subsequence_8cpp_source.html
@@ -0,0 +1,215 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/longest_palindromic_subsequence.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d0/d77/longest__palindromic__subsequence_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">longest_palindromic_subsequence.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d0/d77/longest__palindromic__subsequence_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cassert&gt;</span>  </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;string&gt;</span>   </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;vector&gt;</span>   </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a> {</div>
+<div class="foldopen" id="foldopen00031" data-start="{" data-end="}">
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">   31</a></span>std::string <a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">lps</a>(<span class="keyword">const</span> std::string&amp; a) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keyword">const</span> <span class="keyword">auto</span> b = std::string(a.rbegin(), a.rend());</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keyword">const</span> <span class="keyword">auto</span> m = a.length();</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keyword">using </span>ind_type = std::string::size_type;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    std::vector&lt;std::vector&lt;ind_type&gt; &gt; res(m + 1,</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>                                            std::vector&lt;ind_type&gt;(m + 1));</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="comment">// Finding the length of the longest</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="comment">// palindromic subsequence and storing</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="comment">// in a 2D array in bottoms-up manner</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">for</span> (ind_type i = 0; i &lt;= m; i++) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        <span class="keywordflow">for</span> (ind_type j = 0; j &lt;= m; j++) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>            <span class="keywordflow">if</span> (i == 0 || j == 0) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>                res[i][j] = 0;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (a[i - 1] == b[j - 1]) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>                res[i][j] = res[i - 1][j - 1] + 1;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>                res[i][j] = std::max(res[i - 1][j], res[i][j - 1]);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="comment">// Length of longest palindromic subsequence</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keyword">auto</span> idx = res[m][m];</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="comment">// Creating string of index+1 length</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    std::string ans(idx, <span class="charliteral">&#39;\0&#39;</span>);</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    ind_type i = m, j = m;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="comment">// starting from right-most bottom-most corner</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="comment">// and storing them one by one in ans</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">while</span> (i &gt; 0 &amp;&amp; j &gt; 0) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="comment">// if current characters in a and b are same</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="comment">// then it is a part of the ans</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">if</span> (a[i - 1] == b[j - 1]) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            ans[idx - 1] = a[i - 1];</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            i--;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            j--;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            idx--;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        <span class="comment">// If they are not same, find the larger of the</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        <span class="comment">// two and move in that direction</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (res[i - 1][j] &gt; res[i][j - 1]) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            i--;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            j--;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        }</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    }</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordflow">return</span> ans;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>}</div>
+</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>}  <span class="comment">// namespace dynamic_programming</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="foldopen" id="foldopen00086" data-start="{" data-end="}">
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   86</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a>(<span class="stringliteral">&quot;radar&quot;</span>) == <span class="stringliteral">&quot;radar&quot;</span>);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a>(<span class="stringliteral">&quot;abbcbaa&quot;</span>) == <span class="stringliteral">&quot;abcba&quot;</span>);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a>(<span class="stringliteral">&quot;bbbab&quot;</span>) == <span class="stringliteral">&quot;bbbb&quot;</span>);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a>(<span class="stringliteral">&quot;&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>}</div>
+</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="foldopen" id="foldopen00097" data-start="{" data-end="}">
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"><a class="line" href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   97</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <a class="code hl_function" href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the tests</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>}</div>
+</div>
+<div class="ttc" id="alongest__palindromic__subsequence_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d0/d77/longest__palindromic__subsequence_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> <a href="#l00086">longest_palindromic_subsequence.cpp:86</a></div></div>
+<div class="ttc" id="alongest__palindromic__subsequence_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main Function.</div><div class="ttdef"><b>Definition</b> <a href="#l00097">longest_palindromic_subsequence.cpp:97</a></div></div>
+<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
+<div class="ttc" id="anamespacedynamic__programming_html_afe9f45b6e30ee187509da2d1d0093412"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412">dynamic_programming::lps</a></div><div class="ttdeci">std::string lps(const std::string &amp;a)</div><div class="ttdoc">Function that returns the longest palindromic subsequence of a string.</div><div class="ttdef"><b>Definition</b> <a href="#l00031">longest_palindromic_subsequence.cpp:31</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../d0/d77/longest__palindromic__subsequence_8cpp.html">longest_palindromic_subsequence.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d0/d78/classstatistics_1_1stats__computer1-members.html b/d0/d78/classstatistics_1_1stats__computer1-members.html
index 30bae5c4f..9fda6cbdd 100644
--- a/d0/d78/classstatistics_1_1stats__computer1-members.html
+++ b/d0/d78/classstatistics_1_1stats__computer1-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d0/d8b/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node-members.html b/d0/d8b/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node-members.html
index 6788501b5..0b67f0ba2 100644
--- a/d0/d8b/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node-members.html
+++ b/d0/d8b/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d0/da2/number__of__positive__divisors_8cpp.html b/d0/da2/number__of__positive__divisors_8cpp.html
index 4851beb4f..6b80a1f6d 100644
--- a/d0/da2/number__of__positive__divisors_8cpp.html
+++ b/d0/da2/number__of__positive__divisors_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/number_of_positive_divisors.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/number_of_positive_divisors.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,7 +136,9 @@ Include dependency graph for number_of_positive_divisors.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/da4/number__of__positive__divisors_8cpp__incl.svg" width="179" height="126"><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">
+</div>
+<p><a href="../../d0/da2/number__of__positive__divisors_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ad89ccced8504b5116046cfa03066ffeb" id="r_ad89ccced8504b5116046cfa03066ffeb"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a> (int n)</td></tr>
@@ -140,6 +159,8 @@ Finally, there are \((e_1+1) \times (e_2+1)\times\cdots\times (e_k+1)\) positive
  \(\mbox{number_of_positive_divisors}(36) = (2+1) \cdot (2+1) = 9\). <br  />
 list of positive divisors of 36 = 1, 2, 3, 4, 6, 9, 12, 18, 36.</p>
 <p>Similarly, for N = -36 the number of positive divisors remain same. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d0/da2/number__of__positive__divisors_8cpp_source.html">number_of_positive_divisors.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -156,29 +177,23 @@ list of positive divisors of 36 = 1, 2, 3, 4, 6, 9, 12, 18, 36.</p>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/da2/number__of__positive__divisors_8cpp_source.html#l00081">81</a> of file <a class="el" href="../../d0/da2/number__of__positive__divisors_8cpp_source.html">number_of_positive_divisors.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   81</span>           {</div>
 <div class="line"><span class="lineno">   82</span>    <a class="code hl_function" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
 <div class="line"><span class="lineno">   83</span>    <span class="keywordtype">int</span> n;</div>
-<div class="line"><span class="lineno">   84</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;</div>
+<div class="line"><span class="lineno">   84</span>    std::cin &gt;&gt; n;</div>
 <div class="line"><span class="lineno">   85</span>    <span class="keywordflow">if</span> (n == 0) {</div>
-<div class="line"><span class="lineno">   86</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All non-zero numbers are divisors of 0 !&quot;</span> &lt;&lt; <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">   86</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;All non-zero numbers are divisors of 0 !&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   87</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   88</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Number of positive divisors is : &quot;</span>;</div>
-<div class="line"><span class="lineno">   89</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(n) &lt;&lt; <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">   88</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Number of positive divisors is : &quot;</span>;</div>
+<div class="line"><span class="lineno">   89</span>        std::cout &lt;&lt; <a class="code hl_function" href="#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(n) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   90</span>    }</div>
 <div class="line"><span class="lineno">   91</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   92</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="anumber__of__positive__divisors_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> number_of_positive_divisors.cpp:70</div></div>
-<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_ad89ccced8504b5116046cfa03066ffeb"><div class="ttname"><a href="#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a></div><div class="ttdeci">int number_of_positive_divisors(int n)</div><div class="ttdef"><b>Definition</b> number_of_positive_divisors.cpp:33</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="362" height="138"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="../../d0/da2/number__of__positive__divisors_8cpp_source.html#l00070">number_of_positive_divisors.cpp:70</a></div></div>
+<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_ad89ccced8504b5116046cfa03066ffeb"><div class="ttname"><a href="#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a></div><div class="ttdeci">int number_of_positive_divisors(int n)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/da2/number__of__positive__divisors_8cpp_source.html#l00033">number_of_positive_divisors.cpp:33</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad89ccced8504b5116046cfa03066ffeb" name="ad89ccced8504b5116046cfa03066ffeb"></a>
@@ -202,6 +217,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>number of positive divisors of n (or 1 if n = 0) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/da2/number__of__positive__divisors_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../d0/da2/number__of__positive__divisors_8cpp_source.html">number_of_positive_divisors.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   33</span>                                       {</div>
 <div class="line"><span class="lineno">   34</span>    <span class="keywordflow">if</span> (n &lt; 0) {</div>
 <div class="line"><span class="lineno">   35</span>        n = -n; <span class="comment">// take the absolute value of n</span></div>
@@ -253,6 +270,8 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Test implementations </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/da2/number__of__positive__divisors_8cpp_source.html#l00070">70</a> of file <a class="el" href="../../d0/da2/number__of__positive__divisors_8cpp_source.html">number_of_positive_divisors.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   70</span>             {</div>
 <div class="line"><span class="lineno">   71</span>    assert(<a class="code hl_function" href="#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(36) == 9);</div>
 <div class="line"><span class="lineno">   72</span>    assert(<a class="code hl_function" href="#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(-36) == 9);</div>
@@ -260,12 +279,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   74</span>    assert(<a class="code hl_function" href="#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(2011) == 2); <span class="comment">// 2011 is a prime</span></div>
 <div class="line"><span class="lineno">   75</span>    assert(<a class="code hl_function" href="#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(756) == 24); <span class="comment">// 756 = 2^2 * 3^3 * 7</span></div>
 <div class="line"><span class="lineno">   76</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg" width="244" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map b/d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
deleted file mode 100644
index e1f4c0fbc..000000000
--- a/d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,13,56,38"/>
-<area shape="rect" id="Node000002" href="$d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb" title=" " alt="" coords="104,5,238,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,23,88,23,88,28,56,28"/>
-</map>
diff --git a/d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 b/d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
deleted file mode 100644
index b279032ac..000000000
--- a/d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6c7d543302b2c1a16d3ffd0a139986e8
\ No newline at end of file
diff --git a/d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg b/d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
deleted file mode 100644
index c661635e4..000000000
--- a/d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="183pt" height="39pt"
- viewBox="0.00 0.00 182.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-24.88 0,-24.88 0,-5.63 37.75,-5.63 37.75,-24.88"/>
-<text text-anchor="middle" x="18.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="174.5,-30.5 73.75,-30.5 73.75,0 174.5,0 174.5,-30.5"/>
-<text text-anchor="start" x="81.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">number_of_positive</text>
-<text text-anchor="middle" x="124.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_divisors</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.86,-15.25C44.85,-15.25 53.29,-15.25 62.11,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.9,-18.75 71.9,-15.25 61.9,-11.75 61.9,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg b/d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
deleted file mode 100644
index 5ea606d97..000000000
--- a/d0/da2/number__of__positive__divisors_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="183pt" height="39pt"
- viewBox="0.00 0.00 182.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-24.88 0,-24.88 0,-5.63 37.75,-5.63 37.75,-24.88"/>
-<text text-anchor="middle" x="18.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="174.5,-30.5 73.75,-30.5 73.75,0 174.5,0 174.5,-30.5"/>
-<text text-anchor="start" x="81.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">number_of_positive</text>
-<text text-anchor="middle" x="124.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_divisors</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.86,-15.25C44.85,-15.25 53.29,-15.25 62.11,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.9,-18.75 71.9,-15.25 61.9,-11.75 61.9,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index b2c4bb40e..000000000
--- a/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,56,55,82"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,55,94,36,97,41,56,60"/>
-<area shape="rect" id="Node000003" href="$d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb" title=" " alt="" coords="222,74,356,114"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,69,206,83,206,89,55,74"/>
-<area shape="rect" id="Node000004" href="$d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" title=" " alt="" coords="113,107,164,132"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,78,100,99,98,104,54,83"/>
-<area shape="poly" id="edge4_Node000004_Node000003" title=" " alt="" coords="164,113,206,105,207,111,165,118"/>
-</map>
diff --git a/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 0062a1bb7..000000000
--- a/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a72686c8fb9c1f90e9f80fa4caf94f43
\ No newline at end of file
diff --git a/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 61b059cdb..000000000
--- a/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="271pt" height="103pt"
- viewBox="0.00 0.00 271.25 103.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 99.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-57.25 0,-57.25 0,-38 37,-38 37,-57.25"/>
-<text text-anchor="middle" x="18.5" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-95.25 73,-95.25 73,-76 126.5,-76 126.5,-95.25"/>
-<text text-anchor="middle" x="99.75" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-56.25C46.36,-60.51 57.34,-65.77 67.53,-70.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.86,-73.73 76.39,-74.9 68.88,-67.42 65.86,-73.73"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263.25,-43.88 162.5,-43.88 162.5,-13.37 263.25,-13.37 263.25,-43.88"/>
-<text text-anchor="start" x="170.5" y="-30.38" font-family="Helvetica,sans-Serif" font-size="10.00">number_of_positive</text>
-<text text-anchor="middle" x="212.88" y="-19.12" font-family="Helvetica,sans-Serif" font-size="10.00">_divisors</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.25,-45.87C62.82,-43.35 111.26,-38.56 150.65,-34.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.91,-38.16 160.51,-33.7 150.22,-31.2 150.91,-38.16"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="118.62,-19.25 80.88,-19.25 80.88,0 118.62,0 118.62,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-39C47.14,-34.37 59.28,-28.55 70.19,-23.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.7,-26.48 79.2,-19 68.67,-20.17 71.7,-26.48"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.1,-12.76C128.07,-14.3 139.43,-16.24 151.11,-18.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.39,-21.66 160.83,-19.9 151.57,-14.76 150.39,-21.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 1b19b2c2b..000000000
--- a/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="271pt" height="103pt"
- viewBox="0.00 0.00 271.25 103.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 99.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-57.25 0,-57.25 0,-38 37,-38 37,-57.25"/>
-<text text-anchor="middle" x="18.5" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-95.25 73,-95.25 73,-76 126.5,-76 126.5,-95.25"/>
-<text text-anchor="middle" x="99.75" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-56.25C46.36,-60.51 57.34,-65.77 67.53,-70.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.86,-73.73 76.39,-74.9 68.88,-67.42 65.86,-73.73"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263.25,-43.88 162.5,-43.88 162.5,-13.37 263.25,-13.37 263.25,-43.88"/>
-<text text-anchor="start" x="170.5" y="-30.38" font-family="Helvetica,sans-Serif" font-size="10.00">number_of_positive</text>
-<text text-anchor="middle" x="212.88" y="-19.12" font-family="Helvetica,sans-Serif" font-size="10.00">_divisors</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.25,-45.87C62.82,-43.35 111.26,-38.56 150.65,-34.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.91,-38.16 160.51,-33.7 150.22,-31.2 150.91,-38.16"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="118.62,-19.25 80.88,-19.25 80.88,0 118.62,0 118.62,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-39C47.14,-34.37 59.28,-28.55 70.19,-23.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.7,-26.48 79.2,-19 68.67,-20.17 71.7,-26.48"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.1,-12.76C128.07,-14.3 139.43,-16.24 151.11,-18.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.39,-21.66 160.83,-19.9 151.57,-14.76 150.39,-21.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/da2/number__of__positive__divisors_8cpp_source.html b/d0/da2/number__of__positive__divisors_8cpp_source.html
new file mode 100644
index 000000000..1f599c24e
--- /dev/null
+++ b/d0/da2/number__of__positive__divisors_8cpp_source.html
@@ -0,0 +1,204 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/number_of_positive_divisors.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d0/da2/number__of__positive__divisors_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">number_of_positive_divisors.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d0/da2/number__of__positive__divisors_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="foldopen" id="foldopen00033" data-start="{" data-end="}">
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">   33</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(<span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">if</span> (n &lt; 0) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        n = -n; <span class="comment">// take the absolute value of n</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    }</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordtype">int</span> number_of_divisors = 1;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i * i &lt;= n; i++) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        <span class="comment">// This part is doing the prime factorization.</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        <span class="comment">// Note that we cannot find a composite divisor of n unless we would</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="comment">// already previously find the corresponding prime divisor and dvided</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="comment">// n by that prime. Therefore, all the divisors found here will</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="comment">// actually be primes.</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="comment">// The loop terminates early when it is left with a number n which</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="comment">// does not have a divisor smaller or equal to sqrt(n) - that means</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="comment">// the remaining number is a prime itself.</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        <span class="keywordtype">int</span> prime_exponent = 0;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordflow">while</span> (n % i == 0) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>            <span class="comment">// Repeatedly divide n by the prime divisor n to compute</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            <span class="comment">// the exponent (e_i in the algorithm description).</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            prime_exponent++;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            n /= i;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        number_of_divisors *= prime_exponent + 1;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    }</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordflow">if</span> (n &gt; 1) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <span class="comment">// In case the remaining number n is a prime number itself</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        <span class="comment">// (essentially p_k^1) the final answer is also multiplied by (e_k+1).</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        number_of_divisors *= 2;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    }</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="keywordflow">return</span> number_of_divisors;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>}</div>
+</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="foldopen" id="foldopen00070" data-start="{" data-end="}">
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"><a class="line" href="../../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">   70</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>() {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    assert(<a class="code hl_function" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(36) == 9);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    assert(<a class="code hl_function" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(-36) == 9);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    assert(<a class="code hl_function" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(1) == 1);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    assert(<a class="code hl_function" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(2011) == 2); <span class="comment">// 2011 is a prime</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    assert(<a class="code hl_function" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(756) == 24); <span class="comment">// 756 = 2^2 * 3^3 * 7</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>}</div>
+</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="foldopen" id="foldopen00081" data-start="{" data-end="}">
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   81</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <a class="code hl_function" href="../../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordtype">int</span> n;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keywordflow">if</span> (n == 0) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;All non-zero numbers are divisors of 0 !&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Number of positive divisors is : &quot;</span>;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        std::cout &lt;&lt; <a class="code hl_function" href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a>(n) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>}</div>
+</div>
+<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="#l00070">number_of_positive_divisors.cpp:70</a></div></div>
+<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_ad89ccced8504b5116046cfa03066ffeb"><div class="ttname"><a href="../../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb">number_of_positive_divisors</a></div><div class="ttdeci">int number_of_positive_divisors(int n)</div><div class="ttdef"><b>Definition</b> <a href="#l00033">number_of_positive_divisors.cpp:33</a></div></div>
+<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00081">number_of_positive_divisors.cpp:81</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d0/da2/number__of__positive__divisors_8cpp.html">number_of_positive_divisors.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d0/da4/namespacemonte__carlo.html b/d0/da4/namespacemonte__carlo.html
index 552197a31..eff7d866e 100644
--- a/d0/da4/namespacemonte__carlo.html
+++ b/d0/da4/namespacemonte__carlo.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: monte_carlo Namespace Reference</title>
+<title>TheAlgorithms/C++: monte_carlo Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d0/db6/non__recursive__merge__sort_8cpp.html b/d0/db6/non__recursive__merge__sort_8cpp.html
index 4178da64b..7c4c74f14 100644
--- a/d0/db6/non__recursive__merge__sort_8cpp.html
+++ b/d0/db6/non__recursive__merge__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/non_recursive_merge_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/non_recursive_merge_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,7 +135,9 @@ Include dependency graph for non_recursive_merge_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d5d/non__recursive__merge__sort_8cpp__incl.svg" width="247" height="126"><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">
+</div>
+<p><a href="../../d0/db6/non__recursive__merge__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -149,6 +168,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Copyright 2020 </p><dl class="section author"><dt>Author</dt><dd>Albirair</dd></dl>
 <p>A generic implementation of non-recursive merge sort. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d0/db6/non__recursive__merge__sort_8cpp_source.html">non_recursive_merge_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a3c04138a5bfe5d72780bb7e82a18e627" name="a3c04138a5bfe5d72780bb7e82a18e627"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a3c04138a5bfe5d72780bb7e82a18e627">&#9670;&#160;</a></span>main()</h2>
@@ -168,24 +189,24 @@ Functions</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d0/db6/non__recursive__merge__sort_8cpp_source.html#l00094">94</a> of file <a class="el" href="../../d0/db6/non__recursive__merge__sort_8cpp_source.html">non_recursive_merge_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   94</span>                                {</div>
 <div class="line"><span class="lineno">   95</span>    <span class="keywordtype">int</span> size;</div>
-<div class="line"><span class="lineno">   96</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the number of elements : &quot;</span>;</div>
-<div class="line"><span class="lineno">   97</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; size;</div>
+<div class="line"><span class="lineno">   96</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of elements : &quot;</span>;</div>
+<div class="line"><span class="lineno">   97</span>    std::cin &gt;&gt; size;</div>
 <div class="line"><span class="lineno">   98</span>    <span class="keywordtype">int</span>* arr = <span class="keyword">new</span> <span class="keywordtype">int</span>[size];</div>
 <div class="line"><span class="lineno">   99</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
-<div class="line"><span class="lineno">  100</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;arr[&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;] = &quot;</span>;</div>
-<div class="line"><span class="lineno">  101</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; arr[i];</div>
+<div class="line"><span class="lineno">  100</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;arr[&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;] = &quot;</span>;</div>
+<div class="line"><span class="lineno">  101</span>        std::cin &gt;&gt; arr[i];</div>
 <div class="line"><span class="lineno">  102</span>    }</div>
 <div class="line"><span class="lineno">  103</span>    non_recursive_merge_sort(arr, size);</div>
-<div class="line"><span class="lineno">  104</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Sorted array\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  104</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted array\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  105</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i)</div>
-<div class="line"><span class="lineno">  106</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;arr[&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;] = &quot;</span> &lt;&lt; arr[i] &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><span class="lineno">  106</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;arr[&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;] = &quot;</span> &lt;&lt; arr[i] &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
 <div class="line"><span class="lineno">  107</span>    <span class="keyword">delete</span>[] arr;</div>
 <div class="line"><span class="lineno">  108</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  109</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/d0/db6/non__recursive__merge__sort_8cpp_source.html b/d0/db6/non__recursive__merge__sort_8cpp_source.html
new file mode 100644
index 000000000..441d65a21
--- /dev/null
+++ b/d0/db6/non__recursive__merge__sort_8cpp_source.html
@@ -0,0 +1,229 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/non_recursive_merge_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d0/db6/non__recursive__merge__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">non_recursive_merge_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d0/db6/non__recursive__merge__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;cstddef&gt;</span>  <span class="comment">// for size_t</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;utility&gt;</span>  <span class="comment">// for std::move &amp; std::remove_reference_t</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> Iterator&gt;</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079">merge</a>(Iterator, Iterator, <span class="keyword">const</span> Iterator, <span class="keywordtype">char</span>[]);</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> Iterator&gt;</div>
+<div class="foldopen" id="foldopen00025" data-start="{" data-end="}">
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420">   25</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420">non_recursive_merge_sort</a>(<span class="keyword">const</span> Iterator first, <span class="keyword">const</span> Iterator last,</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>                              <span class="keyword">const</span> <span class="keywordtype">size_t</span> n) {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="comment">// create a buffer large enough to store all elements</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="comment">// dynamically allocated to comply with cpplint</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordtype">char</span>* buffer = <span class="keyword">new</span> <span class="keywordtype">char</span>[n * <span class="keyword">sizeof</span>(*first)];</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="comment">// buffer size can be optimized to largest power of 2 less than n</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="comment">// elements divide the container into equally-sized segments whose</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="comment">// length start at 1 and keeps increasing by factors of 2</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> length(1); length &lt; n; length &lt;&lt;= 1) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        <span class="comment">// merge adjacent segments whose number is n / (length * 2)</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        Iterator left(first);</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> counter(n / (length &lt;&lt; 1)); counter; --counter) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>            Iterator right(left + length), end(right + length);</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>            <a class="code hl_function" href="../../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079">merge</a>(left, right, end, buffer);</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            left = end;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        }</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        <span class="comment">// if the number of remaining elements (n * 2 % length) is longer</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        <span class="comment">// than a segment, merge the remaining elements</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="keywordflow">if</span> ((n &amp; ((length &lt;&lt; 1) - 1)) &gt; length)</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>            <a class="code hl_function" href="../../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079">merge</a>(left, left + length, last, buffer);</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keyword">delete</span>[] buffer;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>}</div>
+</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> Iterator&gt;</div>
+<div class="foldopen" id="foldopen00057" data-start="{" data-end="}">
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079">   57</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079">merge</a>(Iterator l, Iterator r, <span class="keyword">const</span> Iterator e, <span class="keywordtype">char</span> b[]) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="comment">// create 2 pointers to point at the buffer</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keyword">auto</span> p(<span class="keyword">reinterpret_cast&lt;</span>std::remove_reference_t&lt;decltype(*l)<span class="keyword">&gt;</span>*&gt;(b)), c(p);</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="comment">// move the left part of the segment</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">for</span> (Iterator t(l); r != t; ++t) *p++ = std::move(*t);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="comment">// while neither the buffer nor the right part has been exhausted</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="comment">// move the smallest element of the two back to the container</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="keywordflow">while</span> (e != r &amp;&amp; c != p) *l++ = std::move(*r &lt; *c ? *r++ : *c++);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="comment">// notice only one of the two following loops will be executed</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="comment">// while the right part hasn&#39;t bee exhausted, move it back</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">while</span> (e != r) *l++ = std::move(*r++);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="comment">// while the buffer hasn&#39;t bee exhausted, move it back</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordflow">while</span> (c != p) *l++ = std::move(*c++);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>}</div>
+</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> Iterator&gt;</div>
+<div class="foldopen" id="foldopen00077" data-start="{" data-end="}">
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#a27236b8d3df3832e1f1225576a122534">   77</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420">non_recursive_merge_sort</a>(<span class="keyword">const</span> Iterator first, <span class="keyword">const</span> <span class="keywordtype">size_t</span> n) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420">non_recursive_merge_sort</a>(first, first + n, n);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>}</div>
+</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> Iterator&gt;</div>
+<div class="foldopen" id="foldopen00086" data-start="{" data-end="}">
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#ae97f4dd815654c4682f564afd718e824">   86</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420">non_recursive_merge_sort</a>(<span class="keyword">const</span> Iterator first, <span class="keyword">const</span> Iterator last) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420">non_recursive_merge_sort</a>(first, last, last - first);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>}</div>
+</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span><span class="keyword">using </span><a class="code hl_function" href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420">sorting::non_recursive_merge_sort</a>;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span>** argv) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keywordtype">int</span> size;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of elements : &quot;</span>;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    std::cin &gt;&gt; size;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keywordtype">int</span>* arr = <span class="keyword">new</span> <span class="keywordtype">int</span>[size];</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;arr[&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;] = &quot;</span>;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        std::cin &gt;&gt; arr[i];</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    }</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    non_recursive_merge_sort(arr, size);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted array\n&quot;</span>;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i)</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;arr[&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;] = &quot;</span> &lt;&lt; arr[i] &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <span class="keyword">delete</span>[] arr;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+<div class="ttc" id="anamespacesorting_html_a140d913e42fb94176a0b2c8b29a80420"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420">sorting::non_recursive_merge_sort</a></div><div class="ttdeci">void non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)</div><div class="ttdoc">bottom-up merge sort which sorts elements in a non-decreasing order</div><div class="ttdef"><b>Definition</b> <a href="#l00025">non_recursive_merge_sort.cpp:25</a></div></div>
+<div class="ttc" id="anamespacesorting_html_aa26de383227859210f14dcf12201a079"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079">sorting::merge</a></div><div class="ttdeci">void merge(Iterator, Iterator, const Iterator, char[])</div><div class="ttdoc">merges 2 sorted adjacent segments into a larger sorted segment</div><div class="ttdef"><b>Definition</b> <a href="#l00057">non_recursive_merge_sort.cpp:57</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d0/db6/non__recursive__merge__sort_8cpp.html">non_recursive_merge_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d0/dbc/namespacestrings_1_1boyer__moore.html b/d0/dbc/namespacestrings_1_1boyer__moore.html
index 653dfd49c..da954c086 100644
--- a/d0/dbc/namespacestrings_1_1boyer__moore.html
+++ b/d0/dbc/namespacestrings_1_1boyer__moore.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: strings::boyer_moore Namespace Reference</title>
+<title>TheAlgorithms/C++: strings::boyer_moore Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,16 +139,16 @@ Classes</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:aa709cf7fca02b7d3e1888423d5f739a1" id="r_aa709cf7fca02b7d3e1888423d5f739a1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa709cf7fca02b7d3e1888423d5f739a1">init_good_suffix</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &amp;arg)</td></tr>
+<tr class="memitem:aa709cf7fca02b7d3e1888423d5f739a1" id="r_aa709cf7fca02b7d3e1888423d5f739a1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa709cf7fca02b7d3e1888423d5f739a1">init_good_suffix</a> (const std::string &amp;str, std::vector&lt; size_t &gt; &amp;arg)</td></tr>
 <tr class="memdesc:aa709cf7fca02b7d3e1888423d5f739a1"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function that preprocess the good suffix thable.  <br /></td></tr>
 <tr class="separator:aa709cf7fca02b7d3e1888423d5f739a1"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2f6688c9bb3e692297a3aa09cebc1c00" id="r_a2f6688c9bb3e692297a3aa09cebc1c00"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2f6688c9bb3e692297a3aa09cebc1c00">init_bad_char</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &amp;arg)</td></tr>
+<tr class="memitem:a2f6688c9bb3e692297a3aa09cebc1c00" id="r_a2f6688c9bb3e692297a3aa09cebc1c00"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2f6688c9bb3e692297a3aa09cebc1c00">init_bad_char</a> (const std::string &amp;str, std::vector&lt; size_t &gt; &amp;arg)</td></tr>
 <tr class="memdesc:a2f6688c9bb3e692297a3aa09cebc1c00"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function that preprocess the bad char table.  <br /></td></tr>
 <tr class="separator:a2f6688c9bb3e692297a3aa09cebc1c00"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0b165af1dc341289fd705be4c67728f8" id="r_a0b165af1dc341289fd705be4c67728f8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0b165af1dc341289fd705be4c67728f8">init_pattern</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, <a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">pattern</a> &amp;arg)</td></tr>
+<tr class="memitem:a0b165af1dc341289fd705be4c67728f8" id="r_a0b165af1dc341289fd705be4c67728f8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0b165af1dc341289fd705be4c67728f8">init_pattern</a> (const std::string &amp;str, <a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">pattern</a> &amp;arg)</td></tr>
 <tr class="memdesc:a0b165af1dc341289fd705be4c67728f8"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function that initializes pattern.  <br /></td></tr>
 <tr class="separator:a0b165af1dc341289fd705be4c67728f8"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a15703b553faed0d28202c10808cf9738" id="r_a15703b553faed0d28202c10808cf9738"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a15703b553faed0d28202c10808cf9738">search</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, const <a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">pattern</a> &amp;arg)</td></tr>
+<tr class="memitem:a15703b553faed0d28202c10808cf9738" id="r_a15703b553faed0d28202c10808cf9738"><td class="memItemLeft" align="right" valign="top">std::vector&lt; size_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a15703b553faed0d28202c10808cf9738">search</a> (const std::string &amp;str, const <a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">pattern</a> &amp;arg)</td></tr>
 <tr class="memdesc:a15703b553faed0d28202c10808cf9738"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function that implements Boyer-Moore's algorithm.  <br /></td></tr>
 <tr class="separator:a15703b553faed0d28202c10808cf9738"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a056122c8fe8fb0f5fca6428d3f7b5c3a" id="r_a056122c8fe8fb0f5fca6428d3f7b5c3a"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a056122c8fe8fb0f5fca6428d3f7b5c3a">is_prefix</a> (const char *str, const char *pat, size_t len)</td></tr>
@@ -150,12 +167,12 @@ Functions</h2></td></tr>
         <tr>
           <td class="memname">void strings::boyer_moore::init_bad_char </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arg</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; size_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arg</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -169,22 +186,17 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html#l00138">138</a> of file <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html">boyer_moore.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  138</span>                                                                 {</div>
-<div class="line"><span class="lineno">  139</span>    arg.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/resize.html">resize</a>(<a class="code hl_define" href="../../d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd">APLHABET_SIZE</a>, str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>());</div>
+<div class="line"><span class="lineno">  139</span>    arg.resize(<a class="code hl_define" href="../../d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd">APLHABET_SIZE</a>, str.length());</div>
 <div class="line"><span class="lineno">  140</span> </div>
-<div class="line"><span class="lineno">  141</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>(); i++) {</div>
+<div class="line"><span class="lineno">  141</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; str.length(); i++) {</div>
 <div class="line"><span class="lineno">  142</span>        arg[str[i]] = str.length() - i - 1;</div>
 <div class="line"><span class="lineno">  143</span>    }</div>
 <div class="line"><span class="lineno">  144</span>}</div>
-<div class="ttc" id="aboyer__moore_8cpp_html_a77c872c08612d7b8861ba13bc9881cbd"><div class="ttname"><a href="../../d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd">APLHABET_SIZE</a></div><div class="ttdeci">#define APLHABET_SIZE</div><div class="ttdoc">number of symbols in the alphabet we use</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:52</div></div>
-<div class="ttc" id="aresize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/resize.html">std::vector::resize</a></div><div class="ttdeci">T resize(T... args)</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::length</a></div><div class="ttdeci">T length(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.svg" width="328" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aboyer__moore_8cpp_html_a77c872c08612d7b8861ba13bc9881cbd"><div class="ttname"><a href="../../d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd">APLHABET_SIZE</a></div><div class="ttdeci">#define APLHABET_SIZE</div><div class="ttdoc">number of symbols in the alphabet we use</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db2/boyer__moore_8cpp_source.html#l00052">boyer_moore.cpp:52</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa709cf7fca02b7d3e1888423d5f739a1" name="aa709cf7fca02b7d3e1888423d5f739a1"></a>
@@ -196,12 +208,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void strings::boyer_moore::init_good_suffix </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arg</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; size_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arg</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -215,21 +227,23 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html#l00089">89</a> of file <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html">boyer_moore.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   89</span>                                                                    {</div>
-<div class="line"><span class="lineno">   90</span>    arg.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/resize.html">resize</a>(str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() + 1, 0);</div>
+<div class="line"><span class="lineno">   90</span>    arg.resize(str.size() + 1, 0);</div>
 <div class="line"><span class="lineno">   91</span> </div>
 <div class="line"><span class="lineno">   92</span>    <span class="comment">// border_pos[i] - the index of the longest proper suffix of str[i..] which</span></div>
 <div class="line"><span class="lineno">   93</span>    <span class="comment">// is also a proper prefix.</span></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&lt;size_t&gt;</a> border_pos(str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() + 1, 0);</div>
+<div class="line"><span class="lineno">   94</span>    std::vector&lt;size_t&gt; border_pos(str.size() + 1, 0);</div>
 <div class="line"><span class="lineno">   95</span> </div>
-<div class="line"><span class="lineno">   96</span>    <span class="keywordtype">size_t</span> current_char = str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>();</div>
+<div class="line"><span class="lineno">   96</span>    <span class="keywordtype">size_t</span> current_char = str.length();</div>
 <div class="line"><span class="lineno">   97</span> </div>
-<div class="line"><span class="lineno">   98</span>    <span class="keywordtype">size_t</span> border_index = str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>() + 1;</div>
+<div class="line"><span class="lineno">   98</span>    <span class="keywordtype">size_t</span> border_index = str.length() + 1;</div>
 <div class="line"><span class="lineno">   99</span> </div>
 <div class="line"><span class="lineno">  100</span>    border_pos[current_char] = border_index;</div>
 <div class="line"><span class="lineno">  101</span> </div>
 <div class="line"><span class="lineno">  102</span>    <span class="keywordflow">while</span> (current_char &gt; 0) {</div>
-<div class="line"><span class="lineno">  103</span>        <span class="keywordflow">while</span> (border_index &lt;= str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>() &amp;&amp;</div>
+<div class="line"><span class="lineno">  103</span>        <span class="keywordflow">while</span> (border_index &lt;= str.length() &amp;&amp;</div>
 <div class="line"><span class="lineno">  104</span>               str[current_char - 1] != str[border_index - 1]) {</div>
 <div class="line"><span class="lineno">  105</span>            <span class="keywordflow">if</span> (arg[border_index] == 0) {</div>
 <div class="line"><span class="lineno">  106</span>                arg[border_index] = border_index - current_char;</div>
@@ -245,7 +259,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  116</span> </div>
 <div class="line"><span class="lineno">  117</span>    <span class="keywordtype">size_t</span> largest_border_index = border_pos[0];</div>
 <div class="line"><span class="lineno">  118</span> </div>
-<div class="line"><span class="lineno">  119</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>(); i++) {</div>
+<div class="line"><span class="lineno">  119</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; str.size(); i++) {</div>
 <div class="line"><span class="lineno">  120</span>        <span class="keywordflow">if</span> (arg[i] == 0) {</div>
 <div class="line"><span class="lineno">  121</span>            arg[i] = largest_border_index;</div>
 <div class="line"><span class="lineno">  122</span>        }</div>
@@ -256,13 +270,7 @@ Here is the call graph for this function:</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>}</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.svg" width="328" height="94"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0b165af1dc341289fd705be4c67728f8" name="a0b165af1dc341289fd705be4c67728f8"></a>
@@ -274,7 +282,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void strings::boyer_moore::init_pattern </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -293,21 +301,18 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html#l00153">153</a> of file <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html">boyer_moore.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  153</span>                                                      {</div>
 <div class="line"><span class="lineno">  154</span>    arg.pat = str;</div>
 <div class="line"><span class="lineno">  155</span>    <a class="code hl_function" href="#a2f6688c9bb3e692297a3aa09cebc1c00">init_bad_char</a>(str, arg.<a class="code hl_variable" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645">bad_char</a>);</div>
 <div class="line"><span class="lineno">  156</span>    <a class="code hl_function" href="#aa709cf7fca02b7d3e1888423d5f739a1">init_good_suffix</a>(str, arg.<a class="code hl_variable" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e">good_suffix</a>);</div>
 <div class="line"><span class="lineno">  157</span>}</div>
-<div class="ttc" id="anamespacestrings_1_1boyer__moore_html_a2f6688c9bb3e692297a3aa09cebc1c00"><div class="ttname"><a href="#a2f6688c9bb3e692297a3aa09cebc1c00">strings::boyer_moore::init_bad_char</a></div><div class="ttdeci">void init_bad_char(const std::string &amp;str, std::vector&lt; size_t &gt; &amp;arg)</div><div class="ttdoc">A function that preprocess the bad char table.</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:138</div></div>
-<div class="ttc" id="anamespacestrings_1_1boyer__moore_html_aa709cf7fca02b7d3e1888423d5f739a1"><div class="ttname"><a href="#aa709cf7fca02b7d3e1888423d5f739a1">strings::boyer_moore::init_good_suffix</a></div><div class="ttdeci">void init_good_suffix(const std::string &amp;str, std::vector&lt; size_t &gt; &amp;arg)</div><div class="ttdoc">A function that preprocess the good suffix thable.</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:89</div></div>
-<div class="ttc" id="astructstrings_1_1boyer__moore_1_1pattern_html_a3d62f615a0171a5d77e7018f704f3a7e"><div class="ttname"><a href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e">strings::boyer_moore::pattern::good_suffix</a></div><div class="ttdeci">std::vector&lt; size_t &gt; good_suffix</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:78</div></div>
-<div class="ttc" id="astructstrings_1_1boyer__moore_1_1pattern_html_ae5ca7abf15e939eddc80542131de3645"><div class="ttname"><a href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645">strings::boyer_moore::pattern::bad_char</a></div><div class="ttdeci">std::vector&lt; size_t &gt; bad_char</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:74</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph.svg" width="520" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacestrings_1_1boyer__moore_html_a2f6688c9bb3e692297a3aa09cebc1c00"><div class="ttname"><a href="#a2f6688c9bb3e692297a3aa09cebc1c00">strings::boyer_moore::init_bad_char</a></div><div class="ttdeci">void init_bad_char(const std::string &amp;str, std::vector&lt; size_t &gt; &amp;arg)</div><div class="ttdoc">A function that preprocess the bad char table.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db2/boyer__moore_8cpp_source.html#l00138">boyer_moore.cpp:138</a></div></div>
+<div class="ttc" id="anamespacestrings_1_1boyer__moore_html_aa709cf7fca02b7d3e1888423d5f739a1"><div class="ttname"><a href="#aa709cf7fca02b7d3e1888423d5f739a1">strings::boyer_moore::init_good_suffix</a></div><div class="ttdeci">void init_good_suffix(const std::string &amp;str, std::vector&lt; size_t &gt; &amp;arg)</div><div class="ttdoc">A function that preprocess the good suffix thable.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db2/boyer__moore_8cpp_source.html#l00089">boyer_moore.cpp:89</a></div></div>
+<div class="ttc" id="astructstrings_1_1boyer__moore_1_1pattern_html_a3d62f615a0171a5d77e7018f704f3a7e"><div class="ttname"><a href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e">strings::boyer_moore::pattern::good_suffix</a></div><div class="ttdeci">std::vector&lt; size_t &gt; good_suffix</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db2/boyer__moore_8cpp_source.html#l00078">boyer_moore.cpp:78</a></div></div>
+<div class="ttc" id="astructstrings_1_1boyer__moore_1_1pattern_html_ae5ca7abf15e939eddc80542131de3645"><div class="ttname"><a href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645">strings::boyer_moore::pattern::bad_char</a></div><div class="ttdeci">std::vector&lt; size_t &gt; bad_char</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db2/boyer__moore_8cpp_source.html#l00074">boyer_moore.cpp:74</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a056122c8fe8fb0f5fca6428d3f7b5c3a" name="a056122c8fe8fb0f5fca6428d3f7b5c3a"></a>
@@ -346,6 +351,8 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if pat IS prefix of str. </dd>
 <dd>
 <code>false</code> if pat is NOT a prefix of str. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html#l00200">200</a> of file <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html">boyer_moore.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  200</span>                                                             {</div>
 <div class="line"><span class="lineno">  201</span>    <span class="keywordflow">if</span> (strlen(str) &lt; len) {</div>
 <div class="line"><span class="lineno">  202</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
@@ -369,9 +376,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; strings::boyer_moore::search </td>
+          <td class="memname">std::vector&lt; size_t &gt; strings::boyer_moore::search </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -390,13 +397,15 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Vector of indexes of the occurrences of pattern in text </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html#l00165">165</a> of file <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html">boyer_moore.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  165</span>                                                                   {</div>
-<div class="line"><span class="lineno">  166</span>    <span class="keywordtype">size_t</span> index_position = arg.pat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1;</div>
-<div class="line"><span class="lineno">  167</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;size_t&gt;</a> index_storage;</div>
+<div class="line"><span class="lineno">  166</span>    <span class="keywordtype">size_t</span> index_position = arg.pat.size() - 1;</div>
+<div class="line"><span class="lineno">  167</span>    std::vector&lt;size_t&gt; index_storage;</div>
 <div class="line"><span class="lineno">  168</span> </div>
-<div class="line"><span class="lineno">  169</span>    <span class="keywordflow">while</span> (index_position &lt; str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>()) {</div>
+<div class="line"><span class="lineno">  169</span>    <span class="keywordflow">while</span> (index_position &lt; str.length()) {</div>
 <div class="line"><span class="lineno">  170</span>        <span class="keywordtype">size_t</span> index_string = index_position;</div>
-<div class="line"><span class="lineno">  171</span>        <span class="keywordtype">int</span> index_pattern = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(arg.pat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) - 1;</div>
+<div class="line"><span class="lineno">  171</span>        <span class="keywordtype">int</span> index_pattern = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(arg.pat.size()) - 1;</div>
 <div class="line"><span class="lineno">  172</span> </div>
 <div class="line"><span class="lineno">  173</span>        <span class="keywordflow">while</span> (index_pattern &gt;= 0 &amp;&amp;</div>
 <div class="line"><span class="lineno">  174</span>               str[index_string] == arg.pat[index_pattern]) {</div>
@@ -405,24 +414,17 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  177</span>        }</div>
 <div class="line"><span class="lineno">  178</span> </div>
 <div class="line"><span class="lineno">  179</span>        <span class="keywordflow">if</span> (index_pattern &lt; 0) {</div>
-<div class="line"><span class="lineno">  180</span>            index_storage.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(index_position - arg.pat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>() + 1);</div>
+<div class="line"><span class="lineno">  180</span>            index_storage.push_back(index_position - arg.pat.length() + 1);</div>
 <div class="line"><span class="lineno">  181</span>            index_position += arg.<a class="code hl_variable" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e">good_suffix</a>[0];</div>
 <div class="line"><span class="lineno">  182</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  183</span>            index_position += <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(arg.<a class="code hl_variable" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645">bad_char</a>[str[index_string]],</div>
+<div class="line"><span class="lineno">  183</span>            index_position += std::max(arg.<a class="code hl_variable" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645">bad_char</a>[str[index_string]],</div>
 <div class="line"><span class="lineno">  184</span>                                       arg.<a class="code hl_variable" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e">good_suffix</a>[index_pattern + 1]);</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> </div>
 <div class="line"><span class="lineno">  188</span>    <span class="keywordflow">return</span> index_storage;</div>
 <div class="line"><span class="lineno">  189</span>}</div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-</div><!-- 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="../../d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.svg" width="356" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph.map b/d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph.map
deleted file mode 100644
index 965a52829..000000000
--- a/d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph.map
+++ /dev/null
@@ -1,14 +0,0 @@
-<map id="strings::boyer_moore::init_pattern" name="strings::boyer_moore::init_pattern">
-<area shape="rect" id="Node000001" title="A function that initializes pattern." alt="" coords="5,39,149,79"/>
-<area shape="rect" id="Node000002" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00" title="A function that preprocess the bad char table." alt="" coords="197,71,340,111"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="150,68,182,74,181,79,149,74"/>
-<area shape="rect" id="Node000005" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1" title="A function that preprocess the good suffix thable." alt="" coords="197,5,340,46"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="149,44,181,38,182,43,150,49"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="390,13,512,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="326,68,398,42,400,47,328,73"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="388,70,514,96"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="340,85,372,84,372,89,340,91"/>
-<area shape="poly" id="edge5_Node000005_Node000003" title=" " alt="" coords="340,32,375,32,375,37,340,37"/>
-<area shape="poly" id="edge7_Node000005_Node000003" title=" " alt="" coords="340,14,375,14,375,19,340,20"/>
-<area shape="poly" id="edge6_Node000005_Node000004" title=" " alt="" coords="336,44,394,62,393,68,334,49"/>
-</map>
diff --git a/d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph.md5 b/d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph.md5
deleted file mode 100644
index bcbdd9d0e..000000000
--- a/d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1087c3651203c21335f7f16791989eb2
\ No newline at end of file
diff --git a/d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph.svg b/d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph.svg
deleted file mode 100644
index 1fa8b8f8b..000000000
--- a/d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph.svg
+++ /dev/null
@@ -1,149 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: strings::boyer_moore::init_pattern Pages: 1 -->
-<svg width="390pt" height="88pt"
- viewBox="0.00 0.00 389.75 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>strings::boyer_moore::init_pattern</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function that initializes pattern.">
-<polygon fill="#999999" stroke="#666666" points="107.5,-54.5 0,-54.5 0,-24 107.5,-24 107.5,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="53.75" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::init_pattern</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00" target="_top" xlink:title="A function that preprocess the bad char table.">
-<polygon fill="white" stroke="#666666" points="251,-30.5 143.5,-30.5 143.5,0 251,0 251,-30.5"/>
-<text text-anchor="start" x="151.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="197.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::init_bad_char</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.84,-30.25C115.73,-28.91 123.93,-27.52 132.02,-26.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.56,-29.6 141.84,-24.48 131.39,-22.7 132.56,-29.6"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1" target="_top" xlink:title="A function that preprocess the good suffix thable.">
-<polygon fill="white" stroke="#666666" points="251,-79.5 143.5,-79.5 143.5,-49 251,-49 251,-79.5"/>
-<text text-anchor="start" x="151.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="197.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::init_good_suffix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.84,-48.63C115.73,-50.02 123.93,-51.47 132.02,-52.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.38,-56.34 141.84,-54.64 132.6,-49.45 131.38,-56.34"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="380.25,-73.88 288.5,-73.88 288.5,-54.62 380.25,-54.62 380.25,-73.88"/>
-<text text-anchor="middle" x="334.38" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M241.38,-30.89C258.61,-37.14 278.29,-44.28 295.02,-50.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.51,-53.52 304.11,-53.64 295.9,-46.94 293.51,-53.52"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="381.75,-30.88 287,-30.88 287,-11.62 381.75,-11.62 381.75,-30.88"/>
-<text text-anchor="middle" x="334.38" y="-17.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.27,-17.6C259.12,-17.95 267.24,-18.31 275.19,-18.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="274.99,-22.16 285.14,-19.11 275.31,-15.17 274.99,-22.16"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge5_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge5_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.27,-57.64C259.71,-57.48 268.46,-57.46 276.97,-57.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="276.79,-61.08 286.87,-57.81 276.95,-54.08 276.79,-61.08"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge7_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge7_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.27,-70.86C259.71,-71.02 268.46,-71.04 276.97,-70.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="276.95,-74.42 286.87,-70.69 276.79,-67.42 276.95,-74.42"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge6_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M247.42,-48.6C261.71,-44.06 277.18,-39.13 291.02,-34.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.79,-38.15 300.26,-31.79 289.67,-31.48 291.79,-38.15"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph_org.svg b/d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph_org.svg
deleted file mode 100644
index f96908db4..000000000
--- a/d0/dbc/namespacestrings_1_1boyer__moore_a0b165af1dc341289fd705be4c67728f8_cgraph_org.svg
+++ /dev/null
@@ -1,123 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: strings::boyer_moore::init_pattern Pages: 1 -->
-<svg width="390pt" height="88pt"
- viewBox="0.00 0.00 389.75 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>strings::boyer_moore::init_pattern</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function that initializes pattern.">
-<polygon fill="#999999" stroke="#666666" points="107.5,-54.5 0,-54.5 0,-24 107.5,-24 107.5,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="53.75" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::init_pattern</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00" target="_top" xlink:title="A function that preprocess the bad char table.">
-<polygon fill="white" stroke="#666666" points="251,-30.5 143.5,-30.5 143.5,0 251,0 251,-30.5"/>
-<text text-anchor="start" x="151.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="197.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::init_bad_char</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.84,-30.25C115.73,-28.91 123.93,-27.52 132.02,-26.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.56,-29.6 141.84,-24.48 131.39,-22.7 132.56,-29.6"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1" target="_top" xlink:title="A function that preprocess the good suffix thable.">
-<polygon fill="white" stroke="#666666" points="251,-79.5 143.5,-79.5 143.5,-49 251,-49 251,-79.5"/>
-<text text-anchor="start" x="151.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="197.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::init_good_suffix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.84,-48.63C115.73,-50.02 123.93,-51.47 132.02,-52.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.38,-56.34 141.84,-54.64 132.6,-49.45 131.38,-56.34"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="380.25,-73.88 288.5,-73.88 288.5,-54.62 380.25,-54.62 380.25,-73.88"/>
-<text text-anchor="middle" x="334.38" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M241.38,-30.89C258.61,-37.14 278.29,-44.28 295.02,-50.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.51,-53.52 304.11,-53.64 295.9,-46.94 293.51,-53.52"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="381.75,-30.88 287,-30.88 287,-11.62 381.75,-11.62 381.75,-30.88"/>
-<text text-anchor="middle" x="334.38" y="-17.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.27,-17.6C259.12,-17.95 267.24,-18.31 275.19,-18.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="274.99,-22.16 285.14,-19.11 275.31,-15.17 274.99,-22.16"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge5_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge5_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.27,-57.64C259.71,-57.48 268.46,-57.46 276.97,-57.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="276.79,-61.08 286.87,-57.81 276.95,-54.08 276.79,-61.08"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge7_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge7_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.27,-70.86C259.71,-71.02 268.46,-71.04 276.97,-70.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="276.95,-74.42 286.87,-70.69 276.79,-67.42 276.95,-74.42"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge6_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M247.42,-48.6C261.71,-44.06 277.18,-39.13 291.02,-34.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.79,-38.15 300.26,-31.79 289.67,-31.48 291.79,-38.15"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.map b/d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.map
deleted file mode 100644
index d827bd94d..000000000
--- a/d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="strings::boyer_moore::search" name="strings::boyer_moore::search">
-<area shape="rect" id="Node000001" title="A function that implements Boyer&#45;Moore&#39;s algorithm." alt="" coords="5,23,149,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="213,5,335,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="149,40,213,32,214,37,149,46"/>
-<area shape="poly" id="edge4_Node000001_Node000002" title=" " alt="" coords="149,23,197,17,198,22,149,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="238,55,310,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="149,50,223,59,222,64,149,55"/>
-<area shape="rect" id="Node000004" 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="197,104,351,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="127,62,198,90,214,96,213,101,196,95,125,67"/>
-</map>
diff --git a/d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.md5 b/d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.md5
deleted file mode 100644
index 3088d7dc3..000000000
--- a/d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5b5eb95061452a40148727ff87187858
\ No newline at end of file
diff --git a/d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.svg b/d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.svg
deleted file mode 100644
index 04279dc7f..000000000
--- a/d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: strings::boyer_moore::search Pages: 1 -->
-<svg width="267pt" height="101pt"
- viewBox="0.00 0.00 267.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>strings::boyer_moore::search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function that implements Boyer&#45;Moore&#39;s algorithm.">
-<polygon fill="#999999" stroke="#666666" points="107.5,-79.88 0,-79.88 0,-49.38 107.5,-49.38 107.5,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="53.75" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.25,-93.25 155.5,-93.25 155.5,-74 247.25,-74 247.25,-93.25"/>
-<text text-anchor="middle" x="201.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.74,-65.02C123.55,-66.71 140.71,-69.03 155.92,-71.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.17,-74.97 165.62,-73.25 156.37,-68.08 155.17,-74.97"/>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge4_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge4_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.74,-78.06C119.57,-79.88 132.16,-81.55 144.12,-82.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.53,-86.34 153.84,-83.89 144.25,-79.37 143.53,-86.34"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.5,-56.25 174.25,-56.25 174.25,-37 228.5,-37 228.5,-56.25"/>
-<text text-anchor="middle" x="201.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.74,-58.08C125.97,-55.82 146.01,-53.35 162.76,-51.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.78,-54.8 172.28,-50.1 161.92,-47.85 162.78,-54.8"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.25,-19.25 143.5,-19.25 143.5,0 259.25,0 259.25,-19.25"/>
-<text text-anchor="middle" x="201.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.31,-48.96C106.42,-42.08 125.78,-34.11 143.5,-27.62 147.6,-26.13 151.88,-24.63 156.19,-23.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.97,-26.61 165.39,-20.17 154.79,-19.96 156.97,-26.61"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph_org.svg b/d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph_org.svg
deleted file mode 100644
index e23a04d4b..000000000
--- a/d0/dbc/namespacestrings_1_1boyer__moore_a15703b553faed0d28202c10808cf9738_cgraph_org.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: strings::boyer_moore::search Pages: 1 -->
-<svg width="267pt" height="101pt"
- viewBox="0.00 0.00 267.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>strings::boyer_moore::search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function that implements Boyer&#45;Moore&#39;s algorithm.">
-<polygon fill="#999999" stroke="#666666" points="107.5,-79.88 0,-79.88 0,-49.38 107.5,-49.38 107.5,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="53.75" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.25,-93.25 155.5,-93.25 155.5,-74 247.25,-74 247.25,-93.25"/>
-<text text-anchor="middle" x="201.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.74,-65.02C123.55,-66.71 140.71,-69.03 155.92,-71.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.17,-74.97 165.62,-73.25 156.37,-68.08 155.17,-74.97"/>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge4_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge4_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.74,-78.06C119.57,-79.88 132.16,-81.55 144.12,-82.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.53,-86.34 153.84,-83.89 144.25,-79.37 143.53,-86.34"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.5,-56.25 174.25,-56.25 174.25,-37 228.5,-37 228.5,-56.25"/>
-<text text-anchor="middle" x="201.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.74,-58.08C125.97,-55.82 146.01,-53.35 162.76,-51.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.78,-54.8 172.28,-50.1 161.92,-47.85 162.78,-54.8"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.25,-19.25 143.5,-19.25 143.5,0 259.25,0 259.25,-19.25"/>
-<text text-anchor="middle" x="201.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.31,-48.96C106.42,-42.08 125.78,-34.11 143.5,-27.62 147.6,-26.13 151.88,-24.63 156.19,-23.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.97,-26.61 165.39,-20.17 154.79,-19.96 156.97,-26.61"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.map b/d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.map
deleted file mode 100644
index 8e2fb9e9d..000000000
--- a/d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="strings::boyer_moore::init_bad_char" name="strings::boyer_moore::init_bad_char">
-<area shape="rect" id="Node000001" title="A function that preprocess the bad char table." alt="" coords="5,23,149,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="199,5,321,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="149,31,183,26,184,31,149,36"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="197,55,323,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="149,50,182,55,181,60,149,56"/>
-</map>
diff --git a/d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.md5 b/d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.md5
deleted file mode 100644
index 5ff9a9219..000000000
--- a/d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-13a2c74e40e8ce1b4f6096ad05a7c48b
\ No newline at end of file
diff --git a/d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.svg b/d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.svg
deleted file mode 100644
index 4d109fed8..000000000
--- a/d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: strings::boyer_moore::init_bad_char Pages: 1 -->
-<svg width="246pt" height="64pt"
- viewBox="0.00 0.00 246.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>strings::boyer_moore::init_bad_char</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function that preprocess the bad char table.">
-<polygon fill="#999999" stroke="#666666" points="107.5,-42.88 0,-42.88 0,-12.37 107.5,-12.37 107.5,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="53.75" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_bad_char</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-56.25 145,-56.25 145,-37 236.75,-37 236.75,-56.25"/>
-<text text-anchor="middle" x="190.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.77,-35.08C116.3,-36.28 125.16,-37.53 133.76,-38.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.99,-42.16 143.38,-40.09 133.96,-35.23 132.99,-42.16"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.25,-19.25 143.5,-19.25 143.5,0 238.25,0 238.25,-19.25"/>
-<text text-anchor="middle" x="190.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.77,-20.56C115.71,-19.5 123.93,-18.41 131.96,-17.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.2,-20.84 141.65,-16.05 131.28,-13.9 132.2,-20.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph_org.svg b/d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph_org.svg
deleted file mode 100644
index a93be3a19..000000000
--- a/d0/dbc/namespacestrings_1_1boyer__moore_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: strings::boyer_moore::init_bad_char Pages: 1 -->
-<svg width="246pt" height="64pt"
- viewBox="0.00 0.00 246.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>strings::boyer_moore::init_bad_char</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function that preprocess the bad char table.">
-<polygon fill="#999999" stroke="#666666" points="107.5,-42.88 0,-42.88 0,-12.37 107.5,-12.37 107.5,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="53.75" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_bad_char</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-56.25 145,-56.25 145,-37 236.75,-37 236.75,-56.25"/>
-<text text-anchor="middle" x="190.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.77,-35.08C116.3,-36.28 125.16,-37.53 133.76,-38.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.99,-42.16 143.38,-40.09 133.96,-35.23 132.99,-42.16"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.25,-19.25 143.5,-19.25 143.5,0 238.25,0 238.25,-19.25"/>
-<text text-anchor="middle" x="190.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.77,-20.56C115.71,-19.5 123.93,-18.41 131.96,-17.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.2,-20.84 141.65,-16.05 131.28,-13.9 132.2,-20.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.map b/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.map
deleted file mode 100644
index 5a0d69f51..000000000
--- a/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="strings::boyer_moore::init_good_suffix" name="strings::boyer_moore::init_good_suffix">
-<area shape="rect" id="Node000001" title="A function that preprocess the good suffix thable." alt="" coords="5,5,149,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="199,13,321,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="149,32,183,32,183,37,149,37"/>
-<area shape="poly" id="edge3_Node000001_Node000002" title=" " alt="" coords="149,14,183,14,183,19,149,20"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="197,62,323,88"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="150,42,196,55,194,60,148,48"/>
-</map>
diff --git a/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.md5 b/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.md5
deleted file mode 100644
index b0018e7a8..000000000
--- a/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bb4541f9b08a8fc985c38a6e1af4e126
\ No newline at end of file
diff --git a/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.svg b/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.svg
deleted file mode 100644
index 51a6092ac..000000000
--- a/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: strings::boyer_moore::init_good_suffix Pages: 1 -->
-<svg width="246pt" height="70pt"
- viewBox="0.00 0.00 246.25 69.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 65.88)">
-<title>strings::boyer_moore::init_good_suffix</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function that preprocess the good suffix thable.">
-<polygon fill="#999999" stroke="#666666" points="107.5,-61.88 0,-61.88 0,-31.38 107.5,-31.38 107.5,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="53.75" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_good_suffix</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-56.25 145,-56.25 145,-37 236.75,-37 236.75,-56.25"/>
-<text text-anchor="middle" x="190.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.77,-40.02C116.21,-39.85 124.96,-39.83 133.47,-39.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.29,-43.45 143.37,-40.19 133.45,-36.46 133.29,-43.45"/>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge3_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge3_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.77,-53.23C116.21,-53.4 124.96,-53.42 133.47,-53.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.45,-56.79 143.37,-53.06 133.29,-49.8 133.45,-56.79"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.25,-19.25 143.5,-19.25 143.5,0 238.25,0 238.25,-19.25"/>
-<text text-anchor="middle" x="190.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.77,-32.11C119.19,-28.98 131.2,-25.69 142.39,-22.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.09,-26.07 151.81,-20.05 141.24,-19.31 143.09,-26.07"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph_org.svg b/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph_org.svg
deleted file mode 100644
index 989242f73..000000000
--- a/d0/dbc/namespacestrings_1_1boyer__moore_aa709cf7fca02b7d3e1888423d5f739a1_cgraph_org.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: strings::boyer_moore::init_good_suffix Pages: 1 -->
-<svg width="246pt" height="70pt"
- viewBox="0.00 0.00 246.25 69.88" 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 65.88)">
-<title>strings::boyer_moore::init_good_suffix</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function that preprocess the good suffix thable.">
-<polygon fill="#999999" stroke="#666666" points="107.5,-61.88 0,-61.88 0,-31.38 107.5,-31.38 107.5,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="53.75" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_good_suffix</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-56.25 145,-56.25 145,-37 236.75,-37 236.75,-56.25"/>
-<text text-anchor="middle" x="190.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.77,-40.02C116.21,-39.85 124.96,-39.83 133.47,-39.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.29,-43.45 143.37,-40.19 133.45,-36.46 133.29,-43.45"/>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge3_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge3_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.77,-53.23C116.21,-53.4 124.96,-53.42 133.47,-53.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.45,-56.79 143.37,-53.06 133.29,-49.8 133.45,-56.79"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.25,-19.25 143.5,-19.25 143.5,0 238.25,0 238.25,-19.25"/>
-<text text-anchor="middle" x="190.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.77,-32.11C119.19,-28.98 131.2,-25.69 142.39,-22.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.09,-26.07 151.81,-20.05 141.24,-19.31 143.09,-26.07"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/dc4/struct_point-members.html b/d0/dc4/struct_point-members.html
index 967b36811..570a760d4 100644
--- a/d0/dc4/struct_point-members.html
+++ b/d0/dc4/struct_point-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d0/dc9/classrange__queries_1_1fenwick__tree-members.html b/d0/dc9/classrange__queries_1_1fenwick__tree-members.html
index 1389fe47c..1dd5020b5 100644
--- a/d0/dc9/classrange__queries_1_1fenwick__tree-members.html
+++ b/d0/dc9/classrange__queries_1_1fenwick__tree-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d0/dcb/classdsu-members.html b/d0/dcb/classdsu-members.html
index 33c9a8d89..73266ba4c 100644
--- a/d0/dcb/classdsu-members.html
+++ b/d0/dcb/classdsu-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d0/dd2/treap_8cpp.html b/d0/dd2/treap_8cpp.html
index 9dd329021..ef0b55f9a 100644
--- a/d0/dd2/treap_8cpp.html
+++ b/d0/dd2/treap_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/treap.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/treap.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for treap.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../da/de6/treap_8cpp__incl.svg" width="330" height="111"><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">
+</div>
+<p><a href="../../d0/dd2/treap_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html">data_structures::treap::Treap</a></td></tr>
@@ -151,9 +170,8 @@ Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:ad939ec178d0069aeea14b7d6d7d12099" id="r_ad939ec178d0069aeea14b7d6d7d12099"><td class="memItemLeft" align="right" valign="top"><a id="ad939ec178d0069aeea14b7d6d7d12099" name="ad939ec178d0069aeea14b7d6d7d12099"></a>
-const int&#160;</td><td class="memItemRight" valign="bottom"><b>data_structures::treap::maxNode</b> = 1e5 + 5</td></tr>
-<tr class="memdesc:ad939ec178d0069aeea14b7d6d7d12099"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum number of nodes <br /></td></tr>
+<tr class="memitem:ad939ec178d0069aeea14b7d6d7d12099" id="r_ad939ec178d0069aeea14b7d6d7d12099"><td class="memItemLeft" align="right" valign="top">const int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">data_structures::treap::maxNode</a> = 1e5 + 5</td></tr>
+<tr class="memdesc:ad939ec178d0069aeea14b7d6d7d12099"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum number of nodes  <br /></td></tr>
 <tr class="separator:ad939ec178d0069aeea14b7d6d7d12099"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -162,6 +180,8 @@ const int&#160;</td><td class="memItemRight" valign="bottom"><b>data_structures:
 <p>Support operations including insert, erase, and query (the rank of specified element or the element ranked x) as the same as BST</p>
 <p>But these operations take O(log N) time, since treap keeps property of heap using rotate operation, and the desired depth of the tree is O(log N). There's very little chance that it will degenerate into a chain like BST</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/fgmn" target="_blank">Kairao ZHENG</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -180,17 +200,14 @@ const int&#160;</td><td class="memItemRight" valign="bottom"><b>data_structures:
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00255">255</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  255</span>           {</div>
 <div class="line"><span class="lineno">  256</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  257</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  258</span>}</div>
-<div class="ttc" id="atreap_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> treap.cpp:229</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="591"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="atreap_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00229">treap.cpp:229</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -219,8 +236,10 @@ 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>
 <p>&lt; Treap object instance</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00229">229</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  229</span>                   {</div>
-<div class="line"><span class="lineno">  230</span>    <a class="code hl_struct" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html">data_structures::treap::Treap</a> mTreap;  <span class="comment">///&lt; Treap object instance</span></div>
+<div class="line"><span class="lineno">  230</span>    <a class="code hl_struct" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html">data_structures::treap::Treap</a> mTreap;  </div>
 <div class="line"><span class="lineno">  231</span> </div>
 <div class="line"><span class="lineno">  232</span>    mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a>(1);</div>
 <div class="line"><span class="lineno">  233</span>    mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a>(2);</div>
@@ -239,22 +258,16 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  246</span>    assert(mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039">get_rank</a>(10) == 7);</div>
 <div class="line"><span class="lineno">  247</span>    assert(mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126">get_predecessor</a>(10) == 7);</div>
 <div class="line"><span class="lineno">  248</span> </div>
-<div class="line"><span class="lineno">  249</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  249</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  250</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="astructdata__structures_1_1treap_1_1_treap_html"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html">data_structures::treap::Treap</a></div><div class="ttdoc">Struct representation of the treap.</div><div class="ttdef"><b>Definition</b> treap.cpp:40</div></div>
-<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a5e884d2686aff501ef589b0d1185492f"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">data_structures::treap::Treap::insert</a></div><div class="ttdeci">void insert(int k)</div><div class="ttdoc">Insert element (External method)</div><div class="ttdef"><b>Definition</b> treap.cpp:203</div></div>
-<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a767b28f9911fc32b8462862be058a4a4"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4">data_structures::treap::Treap::get_next</a></div><div class="ttdeci">int get_next(int k)</div><div class="ttdoc">Get the successor node of element k.</div><div class="ttdef"><b>Definition</b> treap.cpp:188</div></div>
-<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a9ea2becd904e2e7d22f23a001b444469"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469">data_structures::treap::Treap::erase</a></div><div class="ttdeci">void erase(int k)</div><div class="ttdoc">Erase element (External method)</div><div class="ttdef"><b>Definition</b> treap.cpp:208</div></div>
-<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ab2db3ad3aecc240011e0c8b8604d2c69"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69">data_structures::treap::Treap::get_k_th</a></div><div class="ttdeci">int get_k_th(int k)</div><div class="ttdoc">Get the KTH largest value (External method)</div><div class="ttdef"><b>Definition</b> treap.cpp:214</div></div>
-<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ab8b9899f22070cfa01db5bf874296126"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126">data_structures::treap::Treap::get_predecessor</a></div><div class="ttdeci">int get_predecessor(int k)</div><div class="ttdoc">Get the predecessor node of element k.</div><div class="ttdef"><b>Definition</b> treap.cpp:172</div></div>
-<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ac94e9d69305940f6d8804031455af039"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039">data_structures::treap::Treap::get_rank</a></div><div class="ttdeci">int get_rank(int k)</div><div class="ttdoc">Get the rank of specified element (External method)</div><div class="ttdef"><b>Definition</b> treap.cpp:220</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="591"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html">data_structures::treap::Treap</a></div><div class="ttdoc">Struct representation of the treap.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00040">treap.cpp:40</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a5e884d2686aff501ef589b0d1185492f"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">data_structures::treap::Treap::insert</a></div><div class="ttdeci">void insert(int k)</div><div class="ttdoc">Insert element (External method)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00203">treap.cpp:203</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a767b28f9911fc32b8462862be058a4a4"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4">data_structures::treap::Treap::get_next</a></div><div class="ttdeci">int get_next(int k)</div><div class="ttdoc">Get the successor node of element k.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00188">treap.cpp:188</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a9ea2becd904e2e7d22f23a001b444469"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469">data_structures::treap::Treap::erase</a></div><div class="ttdeci">void erase(int k)</div><div class="ttdoc">Erase element (External method)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00208">treap.cpp:208</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ab2db3ad3aecc240011e0c8b8604d2c69"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69">data_structures::treap::Treap::get_k_th</a></div><div class="ttdeci">int get_k_th(int k)</div><div class="ttdoc">Get the KTH largest value (External method)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00214">treap.cpp:214</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ab8b9899f22070cfa01db5bf874296126"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126">data_structures::treap::Treap::get_predecessor</a></div><div class="ttdeci">int get_predecessor(int k)</div><div class="ttdoc">Get the predecessor node of element k.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00172">treap.cpp:172</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ac94e9d69305940f6d8804031455af039"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039">data_structures::treap::Treap::get_rank</a></div><div class="ttdeci">int get_rank(int k)</div><div class="ttdoc">Get the rank of specified element (External method)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00220">treap.cpp:220</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 34a0c5b08..000000000
--- a/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,34 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,186,49,212"/>
-<area shape="rect" id="Node000002" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469" title="Erase element (External method)" alt="" coords="106,15,254,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="29,185,51,129,70,96,95,66,100,62,103,66,99,70,74,99,56,131,34,187"/>
-<area shape="rect" id="Node000006" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69" title="Get the KTH largest value (External method)" alt="" coords="106,80,254,121"/>
-<area shape="poly" id="edge7_Node000001_Node000006" title=" " alt="" coords="37,184,62,158,95,131,105,126,107,130,98,136,66,162,41,188"/>
-<area shape="rect" id="Node000008" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4" title="Get the successor node of element k." alt="" coords="106,145,254,186"/>
-<area shape="poly" id="edge10_Node000001_Node000008" title=" " alt="" coords="49,192,90,183,91,188,50,197"/>
-<area shape="rect" id="Node000009" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126" title="Get the predecessor node of element k." alt="" coords="97,211,263,251"/>
-<area shape="poly" id="edge11_Node000001_Node000009" title=" " alt="" coords="50,201,82,208,81,213,49,206"/>
-<area shape="rect" id="Node000010" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039" title="Get the rank of specified element (External method)" alt="" coords="106,276,254,317"/>
-<area shape="poly" id="edge12_Node000001_Node000010" title=" " alt="" coords="42,210,66,236,98,261,107,266,105,271,95,265,63,240,38,214"/>
-<area shape="rect" id="Node000012" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f" title="Insert element (External method)" alt="" coords="106,341,254,382"/>
-<area shape="poly" id="edge15_Node000001_Node000012" title=" " alt="" coords="34,211,56,266,74,298,99,326,103,331,100,335,95,330,70,301,51,269,30,213"/>
-<area shape="rect" id="Node000003" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887" title="Erase a value from the specified subtree (internal method)" alt="" coords="311,29,459,70"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="255,38,295,41,295,46,254,43"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="348,29,346,19,352,10,365,5,385,3,407,5,419,11,417,16,405,10,385,8,367,10,355,15,351,20,353,28"/>
-<area shape="rect" id="Node000004" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29" title="Rotate without breaking the property of BST." alt="" coords="507,140,656,181"/>
-<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="436,68,461,81,539,129,536,133,458,85,434,73"/>
-<area shape="rect" id="Node000005" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" title="Update the subtree size of the node." alt="" coords="704,140,852,181"/>
-<area shape="poly" id="edge6_Node000003_Node000005" title=" " alt="" coords="461,68,689,133,688,138,459,73"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="656,158,688,158,688,163,656,163"/>
-<area shape="rect" id="Node000007" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2" title="Find the KTH largest value (internal method)" alt="" coords="311,119,459,159"/>
-<area shape="poly" id="edge8_Node000006_Node000007" title=" " alt="" coords="255,112,296,120,295,125,254,117"/>
-<area shape="poly" id="edge9_Node000007_Node000007" title=" " alt="" coords="348,119,346,109,352,100,365,94,385,92,407,94,419,101,417,105,405,100,385,97,367,99,355,104,351,110,353,117"/>
-<area shape="rect" id="Node000011" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec" title="Query the rank of specified element (internal method)" alt="" coords="311,223,459,263"/>
-<area shape="poly" id="edge13_Node000010_Node000011" title=" " alt="" coords="254,274,295,264,296,269,255,280"/>
-<area shape="poly" id="edge14_Node000011_Node000011" title=" " alt="" coords="348,223,346,213,352,204,365,198,385,196,407,198,419,205,417,209,405,204,385,201,367,203,355,208,351,214,353,221"/>
-<area shape="rect" id="Node000013" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c" title="Insert a value into the specified subtree (internal method)" alt="" coords="311,312,459,353"/>
-<area shape="poly" id="edge16_Node000012_Node000013" title=" " alt="" coords="254,348,295,342,296,348,255,354"/>
-<area shape="poly" id="edge18_Node000013_Node000004" title=" " alt="" coords="413,309,458,273,547,190,550,194,461,277,416,313"/>
-<area shape="poly" id="edge19_Node000013_Node000005" title=" " alt="" coords="433,309,714,185,717,190,435,314"/>
-<area shape="poly" id="edge17_Node000013_Node000013" title=" " alt="" coords="348,312,346,302,352,293,365,287,385,285,407,288,419,294,417,299,405,293,385,291,367,293,355,297,351,303,353,311"/>
-</map>
diff --git a/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 4f6ebba9d..000000000
--- a/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-215c477708f08d0eb072d13ea138579a
\ No newline at end of file
diff --git a/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 972b22b52..000000000
--- a/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,395 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<!--zoomable 291 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 643;
-var viewHeight = 291;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-146.88 0,-146.88 0,-127.62 32.5,-127.62 32.5,-146.88"/>
-<text text-anchor="middle" x="16.25" y="-133.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469" target="_top" xlink:title="Erase element (External method)">
-<polygon fill="white" stroke="#666666" points="186.5,-275.5 75.25,-275.5 75.25,-245 186.5,-245 186.5,-275.5"/>
-<text text-anchor="start" x="83.25" y="-262" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="130.88" y="-250.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M19.96,-147.3C25.72,-166.83 40.94,-210.19 68.5,-235.25 69.72,-236.36 71,-237.43 72.33,-238.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.09,-241.17 80.37,-243.74 73.94,-235.32 70.09,-241.17"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69" target="_top" xlink:title="Get the KTH largest value (External method)">
-<polygon fill="white" stroke="#666666" points="186.5,-226.5 75.25,-226.5 75.25,-196 186.5,-196 186.5,-226.5"/>
-<text text-anchor="start" x="83.25" y="-213" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="130.88" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_k_th</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.44,-147.04C34.89,-157.83 51.35,-175.14 68.5,-186.25 70.74,-187.7 73.08,-189.1 75.48,-190.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.75,-193.48 84.25,-194.89 76.93,-187.24 73.75,-193.48"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4" target="_top" xlink:title="Get the successor node of element k.">
-<polygon fill="white" stroke="#666666" points="186.5,-177.5 75.25,-177.5 75.25,-147 186.5,-147 186.5,-177.5"/>
-<text text-anchor="start" x="83.25" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="130.88" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_next</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge10_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge10_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.91,-140.73C41.29,-142.59 52.25,-145.02 63.77,-147.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.92,-150.97 73.44,-149.72 64.44,-144.14 62.92,-150.97"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126" target="_top" xlink:title="Get the predecessor node of element k.">
-<polygon fill="white" stroke="#666666" points="193.25,-128.5 68.5,-128.5 68.5,-98 193.25,-98 193.25,-128.5"/>
-<text text-anchor="start" x="76.5" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="130.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_predecessor</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge11_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge11_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.91,-133.91C39.61,-132.48 47.96,-130.71 56.93,-128.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.57,-132.24 66.62,-126.73 56.12,-125.39 57.57,-132.24"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039" target="_top" xlink:title="Get the rank of specified element (External method)">
-<polygon fill="white" stroke="#666666" points="186.5,-79.5 75.25,-79.5 75.25,-49 186.5,-49 186.5,-79.5"/>
-<text text-anchor="start" x="83.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="130.88" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_rank</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge12_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge12_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.83,-127.29C35.37,-116.7 51.67,-100.03 68.5,-89.25 70.75,-87.81 73.09,-86.43 75.5,-85.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.94,-88.29 84.29,-80.65 73.78,-82.04 76.94,-88.29"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f" target="_top" xlink:title="Insert element (External method)">
-<polygon fill="white" stroke="#666666" points="186.5,-30.5 75.25,-30.5 75.25,0 186.5,0 186.5,-30.5"/>
-<text text-anchor="start" x="83.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="130.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge15_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge15_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M19.99,-127.3C25.8,-107.97 41.11,-65.05 68.5,-40.25 69.73,-39.14 71.01,-38.08 72.34,-37.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.94,-40.19 80.39,-31.78 70.11,-34.33 73.94,-40.19"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887" target="_top" xlink:title="Erase a value from the specified subtree (internal method)">
-<polygon fill="white" stroke="#666666" points="340.5,-264.5 229.25,-264.5 229.25,-234 340.5,-234 340.5,-264.5"/>
-<text text-anchor="start" x="237.25" y="-251" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="284.88" y="-239.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_erase</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.75,-256.28C196.7,-255.56 207.17,-254.8 217.41,-254.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.59,-257.56 227.32,-253.34 217.09,-250.57 217.59,-257.56"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.78,-264.99C253.46,-274.06 262.15,-282.5 284.88,-282.5 297.3,-282.5 305.53,-279.97 309.57,-276.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.02,-276.84 310.78,-266.49 306.07,-275.98 313.02,-276.84"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29" target="_top" xlink:title="Rotate without breaking the property of BST.">
-<polygon fill="white" stroke="#666666" points="487.75,-181.5 376.5,-181.5 376.5,-151 487.75,-151 487.75,-181.5"/>
-<text text-anchor="start" x="384.5" y="-168" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="432.12" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::rotate</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M322.08,-233.55C328.3,-230.61 334.64,-227.45 340.5,-224.25 360.52,-213.33 382.04,-199.64 399.09,-188.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="400.96,-191.27 407.31,-182.78 397.06,-185.46 400.96,-191.27"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" target="_top" xlink:title="Update the subtree size of the node.">
-<polygon fill="white" stroke="#666666" points="635,-181.5 523.75,-181.5 523.75,-151 635,-151 635,-181.5"/>
-<text text-anchor="start" x="531.75" y="-168" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="579.38" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::update</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge6_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge6_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.89,-233.64C389.61,-219.81 460.82,-199.61 512.55,-184.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="513.48,-188.3 522.15,-182.2 511.57,-181.57 513.48,-188.3"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M488.04,-166.25C495.9,-166.25 504.06,-166.25 512.11,-166.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="511.87,-169.75 521.87,-166.25 511.87,-162.75 511.87,-169.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2" target="_top" xlink:title="Find the KTH largest value (internal method)">
-<polygon fill="white" stroke="#666666" points="340.5,-197.5 229.25,-197.5 229.25,-167 340.5,-167 340.5,-197.5"/>
-<text text-anchor="start" x="237.25" y="-184" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="284.88" y="-172.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_get_k_th</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge8_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge8_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.75,-200.78C196.8,-198.86 207.39,-196.84 217.74,-194.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.17,-198.35 227.34,-193.04 216.86,-191.47 218.17,-198.35"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge9_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge9_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.78,-197.99C253.46,-207.06 262.15,-215.5 284.88,-215.5 297.3,-215.5 305.53,-212.97 309.57,-209.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.02,-209.84 310.78,-199.49 306.07,-208.98 313.02,-209.84"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec" target="_top" xlink:title="Query the rank of specified element (internal method)">
-<polygon fill="white" stroke="#666666" points="340.5,-119.5 229.25,-119.5 229.25,-89 340.5,-89 340.5,-119.5"/>
-<text text-anchor="start" x="237.25" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="284.88" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_get_rank</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge13_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge13_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.75,-78.69C196.8,-81.34 207.39,-84.12 217.74,-86.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="216.8,-90.22 227.36,-89.38 218.58,-83.45 216.8,-90.22"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node11 -->
-<g id="edge14_Node000011_Node000011" class="edge">
-<title>Node11&#45;&gt;Node11</title>
-<g id="a_edge14_Node000011_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.78,-119.99C253.46,-129.06 262.15,-137.5 284.88,-137.5 297.3,-137.5 305.53,-134.97 309.57,-131.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.02,-131.84 310.78,-121.49 306.07,-130.98 313.02,-131.84"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c" target="_top" xlink:title="Insert a value into the specified subtree (internal method)">
-<polygon fill="white" stroke="#666666" points="340.5,-52.5 229.25,-52.5 229.25,-22 340.5,-22 340.5,-52.5"/>
-<text text-anchor="start" x="237.25" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="284.88" y="-27.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_insert</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge16_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge16_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.75,-23.19C196.8,-24.65 207.39,-26.18 217.74,-27.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="216.93,-31.1 227.33,-29.07 217.93,-24.17 216.93,-31.1"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node4 -->
-<g id="edge18_Node000013_Node000004" class="edge">
-<title>Node13&#45;&gt;Node4</title>
-<g id="a_edge18_Node000013_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M306.73,-52.94C317.07,-60.9 329.64,-70.85 340.5,-80.25 363.9,-100.49 389.37,-124.88 407.32,-142.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.84,-144.97 414.42,-149.51 409.76,-139.99 404.84,-144.97"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node5 -->
-<g id="edge19_Node000013_Node000005" class="edge">
-<title>Node13&#45;&gt;Node5</title>
-<g id="a_edge19_Node000013_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.45,-52.94C374.48,-76.33 474.27,-120.34 532.65,-146.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="531.1,-149.23 541.66,-150.06 533.93,-142.82 531.1,-149.23"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node13 -->
-<g id="edge17_Node000013_Node000013" class="edge">
-<title>Node13&#45;&gt;Node13</title>
-<g id="a_edge17_Node000013_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.78,-52.99C253.46,-62.06 262.15,-70.5 284.88,-70.5 297.3,-70.5 305.53,-67.97 309.57,-64.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.02,-64.84 310.78,-54.49 306.07,-63.98 313.02,-64.84"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1afad3c67..000000000
--- a/d0/dd2/treap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,312 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="643pt" height="291pt"
- viewBox="0.00 0.00 643.00 290.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 286.5)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-146.88 0,-146.88 0,-127.62 32.5,-127.62 32.5,-146.88"/>
-<text text-anchor="middle" x="16.25" y="-133.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469" target="_top" xlink:title="Erase element (External method)">
-<polygon fill="white" stroke="#666666" points="186.5,-275.5 75.25,-275.5 75.25,-245 186.5,-245 186.5,-275.5"/>
-<text text-anchor="start" x="83.25" y="-262" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="130.88" y="-250.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M19.96,-147.3C25.72,-166.83 40.94,-210.19 68.5,-235.25 69.72,-236.36 71,-237.43 72.33,-238.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.09,-241.17 80.37,-243.74 73.94,-235.32 70.09,-241.17"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69" target="_top" xlink:title="Get the KTH largest value (External method)">
-<polygon fill="white" stroke="#666666" points="186.5,-226.5 75.25,-226.5 75.25,-196 186.5,-196 186.5,-226.5"/>
-<text text-anchor="start" x="83.25" y="-213" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="130.88" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_k_th</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.44,-147.04C34.89,-157.83 51.35,-175.14 68.5,-186.25 70.74,-187.7 73.08,-189.1 75.48,-190.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.75,-193.48 84.25,-194.89 76.93,-187.24 73.75,-193.48"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4" target="_top" xlink:title="Get the successor node of element k.">
-<polygon fill="white" stroke="#666666" points="186.5,-177.5 75.25,-177.5 75.25,-147 186.5,-147 186.5,-177.5"/>
-<text text-anchor="start" x="83.25" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="130.88" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_next</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge10_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge10_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.91,-140.73C41.29,-142.59 52.25,-145.02 63.77,-147.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.92,-150.97 73.44,-149.72 64.44,-144.14 62.92,-150.97"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126" target="_top" xlink:title="Get the predecessor node of element k.">
-<polygon fill="white" stroke="#666666" points="193.25,-128.5 68.5,-128.5 68.5,-98 193.25,-98 193.25,-128.5"/>
-<text text-anchor="start" x="76.5" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="130.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_predecessor</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge11_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge11_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.91,-133.91C39.61,-132.48 47.96,-130.71 56.93,-128.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.57,-132.24 66.62,-126.73 56.12,-125.39 57.57,-132.24"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039" target="_top" xlink:title="Get the rank of specified element (External method)">
-<polygon fill="white" stroke="#666666" points="186.5,-79.5 75.25,-79.5 75.25,-49 186.5,-49 186.5,-79.5"/>
-<text text-anchor="start" x="83.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="130.88" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_rank</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge12_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge12_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.83,-127.29C35.37,-116.7 51.67,-100.03 68.5,-89.25 70.75,-87.81 73.09,-86.43 75.5,-85.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.94,-88.29 84.29,-80.65 73.78,-82.04 76.94,-88.29"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f" target="_top" xlink:title="Insert element (External method)">
-<polygon fill="white" stroke="#666666" points="186.5,-30.5 75.25,-30.5 75.25,0 186.5,0 186.5,-30.5"/>
-<text text-anchor="start" x="83.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="130.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge15_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge15_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M19.99,-127.3C25.8,-107.97 41.11,-65.05 68.5,-40.25 69.73,-39.14 71.01,-38.08 72.34,-37.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.94,-40.19 80.39,-31.78 70.11,-34.33 73.94,-40.19"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887" target="_top" xlink:title="Erase a value from the specified subtree (internal method)">
-<polygon fill="white" stroke="#666666" points="340.5,-264.5 229.25,-264.5 229.25,-234 340.5,-234 340.5,-264.5"/>
-<text text-anchor="start" x="237.25" y="-251" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="284.88" y="-239.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_erase</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.75,-256.28C196.7,-255.56 207.17,-254.8 217.41,-254.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.59,-257.56 227.32,-253.34 217.09,-250.57 217.59,-257.56"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.78,-264.99C253.46,-274.06 262.15,-282.5 284.88,-282.5 297.3,-282.5 305.53,-279.97 309.57,-276.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.02,-276.84 310.78,-266.49 306.07,-275.98 313.02,-276.84"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29" target="_top" xlink:title="Rotate without breaking the property of BST.">
-<polygon fill="white" stroke="#666666" points="487.75,-181.5 376.5,-181.5 376.5,-151 487.75,-151 487.75,-181.5"/>
-<text text-anchor="start" x="384.5" y="-168" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="432.12" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::rotate</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M322.08,-233.55C328.3,-230.61 334.64,-227.45 340.5,-224.25 360.52,-213.33 382.04,-199.64 399.09,-188.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="400.96,-191.27 407.31,-182.78 397.06,-185.46 400.96,-191.27"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" target="_top" xlink:title="Update the subtree size of the node.">
-<polygon fill="white" stroke="#666666" points="635,-181.5 523.75,-181.5 523.75,-151 635,-151 635,-181.5"/>
-<text text-anchor="start" x="531.75" y="-168" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="579.38" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::update</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge6_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge6_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.89,-233.64C389.61,-219.81 460.82,-199.61 512.55,-184.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="513.48,-188.3 522.15,-182.2 511.57,-181.57 513.48,-188.3"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M488.04,-166.25C495.9,-166.25 504.06,-166.25 512.11,-166.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="511.87,-169.75 521.87,-166.25 511.87,-162.75 511.87,-169.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2" target="_top" xlink:title="Find the KTH largest value (internal method)">
-<polygon fill="white" stroke="#666666" points="340.5,-197.5 229.25,-197.5 229.25,-167 340.5,-167 340.5,-197.5"/>
-<text text-anchor="start" x="237.25" y="-184" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="284.88" y="-172.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_get_k_th</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge8_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge8_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.75,-200.78C196.8,-198.86 207.39,-196.84 217.74,-194.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.17,-198.35 227.34,-193.04 216.86,-191.47 218.17,-198.35"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge9_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge9_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.78,-197.99C253.46,-207.06 262.15,-215.5 284.88,-215.5 297.3,-215.5 305.53,-212.97 309.57,-209.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.02,-209.84 310.78,-199.49 306.07,-208.98 313.02,-209.84"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec" target="_top" xlink:title="Query the rank of specified element (internal method)">
-<polygon fill="white" stroke="#666666" points="340.5,-119.5 229.25,-119.5 229.25,-89 340.5,-89 340.5,-119.5"/>
-<text text-anchor="start" x="237.25" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="284.88" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_get_rank</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge13_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge13_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.75,-78.69C196.8,-81.34 207.39,-84.12 217.74,-86.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="216.8,-90.22 227.36,-89.38 218.58,-83.45 216.8,-90.22"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node11 -->
-<g id="edge14_Node000011_Node000011" class="edge">
-<title>Node11&#45;&gt;Node11</title>
-<g id="a_edge14_Node000011_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.78,-119.99C253.46,-129.06 262.15,-137.5 284.88,-137.5 297.3,-137.5 305.53,-134.97 309.57,-131.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.02,-131.84 310.78,-121.49 306.07,-130.98 313.02,-131.84"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c" target="_top" xlink:title="Insert a value into the specified subtree (internal method)">
-<polygon fill="white" stroke="#666666" points="340.5,-52.5 229.25,-52.5 229.25,-22 340.5,-22 340.5,-52.5"/>
-<text text-anchor="start" x="237.25" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="284.88" y="-27.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_insert</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge16_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge16_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.75,-23.19C196.8,-24.65 207.39,-26.18 217.74,-27.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="216.93,-31.1 227.33,-29.07 217.93,-24.17 216.93,-31.1"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node4 -->
-<g id="edge18_Node000013_Node000004" class="edge">
-<title>Node13&#45;&gt;Node4</title>
-<g id="a_edge18_Node000013_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M306.73,-52.94C317.07,-60.9 329.64,-70.85 340.5,-80.25 363.9,-100.49 389.37,-124.88 407.32,-142.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.84,-144.97 414.42,-149.51 409.76,-139.99 404.84,-144.97"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node5 -->
-<g id="edge19_Node000013_Node000005" class="edge">
-<title>Node13&#45;&gt;Node5</title>
-<g id="a_edge19_Node000013_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.45,-52.94C374.48,-76.33 474.27,-120.34 532.65,-146.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="531.1,-149.23 541.66,-150.06 533.93,-142.82 531.1,-149.23"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node13 -->
-<g id="edge17_Node000013_Node000013" class="edge">
-<title>Node13&#45;&gt;Node13</title>
-<g id="a_edge17_Node000013_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.78,-52.99C253.46,-62.06 262.15,-70.5 284.88,-70.5 297.3,-70.5 305.53,-67.97 309.57,-64.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.02,-64.84 310.78,-54.49 306.07,-63.98 313.02,-64.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index cd5746e96..000000000
--- a/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,36 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,186,55,212"/>
-<area shape="rect" id="Node000002" href="$d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,186,146,212"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,196,87,196,87,202,55,202"/>
-<area shape="rect" id="Node000003" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469" title="Erase element (External method)" alt="" coords="203,15,351,55"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="127,185,148,129,167,96,192,66,197,62,201,66,196,70,172,99,153,131,132,187"/>
-<area shape="rect" id="Node000007" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69" title="Get the KTH largest value (External method)" alt="" coords="203,80,351,121"/>
-<area shape="poly" id="edge8_Node000002_Node000007" title=" " alt="" coords="135,184,160,158,192,131,202,126,205,130,196,136,163,162,139,188"/>
-<area shape="rect" id="Node000009" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4" title="Get the successor node of element k." alt="" coords="203,145,351,186"/>
-<area shape="poly" id="edge11_Node000002_Node000009" title=" " alt="" coords="146,192,187,183,188,188,147,197"/>
-<area shape="rect" id="Node000010" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126" title="Get the predecessor node of element k." alt="" coords="194,211,360,251"/>
-<area shape="poly" id="edge12_Node000002_Node000010" title=" " alt="" coords="147,201,179,208,178,213,146,206"/>
-<area shape="rect" id="Node000011" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039" title="Get the rank of specified element (External method)" alt="" coords="203,276,351,317"/>
-<area shape="poly" id="edge13_Node000002_Node000011" title=" " alt="" coords="139,210,164,236,196,261,205,266,202,271,192,265,160,240,135,214"/>
-<area shape="rect" id="Node000013" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f" title="Insert element (External method)" alt="" coords="203,341,351,382"/>
-<area shape="poly" id="edge16_Node000002_Node000013" title=" " alt="" coords="132,211,153,266,172,298,196,326,201,331,197,335,192,330,167,301,148,269,127,213"/>
-<area shape="rect" id="Node000004" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887" title="Erase a value from the specified subtree (internal method)" alt="" coords="408,29,557,70"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="352,38,393,41,392,46,351,43"/>
-<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="445,29,443,19,449,10,463,5,483,3,504,5,517,11,514,16,502,10,482,8,464,10,453,15,449,20,450,28"/>
-<area shape="rect" id="Node000005" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29" title="Rotate without breaking the property of BST." alt="" coords="605,140,753,181"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="533,68,558,81,636,129,633,133,555,85,531,73"/>
-<area shape="rect" id="Node000006" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" title="Update the subtree size of the node." alt="" coords="801,140,949,181"/>
-<area shape="poly" id="edge7_Node000004_Node000006" title=" " alt="" coords="558,68,787,133,785,138,556,73"/>
-<area shape="poly" id="edge6_Node000005_Node000006" title=" " alt="" coords="753,158,785,158,785,163,753,163"/>
-<area shape="rect" id="Node000008" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2" title="Find the KTH largest value (internal method)" alt="" coords="408,119,557,159"/>
-<area shape="poly" id="edge9_Node000007_Node000008" title=" " alt="" coords="352,112,393,120,392,125,351,117"/>
-<area shape="poly" id="edge10_Node000008_Node000008" title=" " alt="" coords="445,119,443,109,449,100,463,94,483,92,504,94,517,101,514,105,502,100,482,97,464,99,453,104,449,110,450,117"/>
-<area shape="rect" id="Node000012" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec" title="Query the rank of specified element (internal method)" alt="" coords="408,223,557,263"/>
-<area shape="poly" id="edge14_Node000011_Node000012" title=" " alt="" coords="351,274,392,264,394,269,352,280"/>
-<area shape="poly" id="edge15_Node000012_Node000012" title=" " alt="" coords="445,223,443,213,449,204,463,198,483,196,504,198,517,205,514,209,502,204,482,201,464,203,453,208,449,214,450,221"/>
-<area shape="rect" id="Node000014" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c" title="Insert a value into the specified subtree (internal method)" alt="" coords="408,312,557,353"/>
-<area shape="poly" id="edge17_Node000013_Node000014" title=" " alt="" coords="351,348,393,342,393,348,352,354"/>
-<area shape="poly" id="edge19_Node000014_Node000005" title=" " alt="" coords="510,309,555,273,644,190,648,194,558,277,513,313"/>
-<area shape="poly" id="edge20_Node000014_Node000006" title=" " alt="" coords="530,309,812,185,814,190,532,314"/>
-<area shape="poly" id="edge18_Node000014_Node000014" title=" " alt="" coords="445,312,443,302,449,293,463,287,483,285,504,288,517,294,514,299,502,293,482,291,464,293,453,297,449,303,450,311"/>
-</map>
diff --git a/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 976c69548..000000000
--- a/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-003a4a7d1c5118f92ce5198573ce0e5f
\ No newline at end of file
diff --git a/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 8ac998df7..000000000
--- a/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,413 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 291 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 716;
-var viewHeight = 291;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-146.88 0,-146.88 0,-127.62 37,-127.62 37,-146.88"/>
-<text text-anchor="middle" x="18.5" y="-133.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-146.88 73,-146.88 73,-127.62 105.5,-127.62 105.5,-146.88"/>
-<text text-anchor="middle" x="89.25" y="-133.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-137.25C44.58,-137.25 53.31,-137.25 61.45,-137.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-140.75 71.2,-137.25 61.2,-133.75 61.2,-140.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469" target="_top" xlink:title="Erase element (External method)">
-<polygon fill="white" stroke="#666666" points="259.5,-275.5 148.25,-275.5 148.25,-245 259.5,-245 259.5,-275.5"/>
-<text text-anchor="start" x="156.25" y="-262" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="203.88" y="-250.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::erase</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.96,-147.3C98.72,-166.83 113.94,-210.19 141.5,-235.25 142.72,-236.36 144,-237.43 145.33,-238.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.09,-241.17 153.37,-243.74 146.94,-235.32 143.09,-241.17"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69" target="_top" xlink:title="Get the KTH largest value (External method)">
-<polygon fill="white" stroke="#666666" points="259.5,-226.5 148.25,-226.5 148.25,-196 259.5,-196 259.5,-226.5"/>
-<text text-anchor="start" x="156.25" y="-213" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="203.88" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_k_th</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge8_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge8_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.44,-147.04C107.89,-157.83 124.35,-175.14 141.5,-186.25 143.74,-187.7 146.08,-189.1 148.48,-190.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.75,-193.48 157.25,-194.89 149.93,-187.24 146.75,-193.48"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4" target="_top" xlink:title="Get the successor node of element k.">
-<polygon fill="white" stroke="#666666" points="259.5,-177.5 148.25,-177.5 148.25,-147 259.5,-147 259.5,-177.5"/>
-<text text-anchor="start" x="156.25" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="203.88" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_next</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge11_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge11_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.91,-140.73C114.29,-142.59 125.25,-145.02 136.77,-147.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.92,-150.97 146.44,-149.72 137.44,-144.14 135.92,-150.97"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126" target="_top" xlink:title="Get the predecessor node of element k.">
-<polygon fill="white" stroke="#666666" points="266.25,-128.5 141.5,-128.5 141.5,-98 266.25,-98 266.25,-128.5"/>
-<text text-anchor="start" x="149.5" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="203.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_predecessor</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge12_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge12_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.91,-133.91C112.61,-132.48 120.96,-130.71 129.93,-128.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.57,-132.24 139.62,-126.73 129.12,-125.39 130.57,-132.24"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039" target="_top" xlink:title="Get the rank of specified element (External method)">
-<polygon fill="white" stroke="#666666" points="259.5,-79.5 148.25,-79.5 148.25,-49 259.5,-49 259.5,-79.5"/>
-<text text-anchor="start" x="156.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="203.88" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_rank</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge13_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge13_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.83,-127.29C108.37,-116.7 124.67,-100.03 141.5,-89.25 143.75,-87.81 146.09,-86.43 148.5,-85.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.94,-88.29 157.29,-80.65 146.78,-82.04 149.94,-88.29"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f" target="_top" xlink:title="Insert element (External method)">
-<polygon fill="white" stroke="#666666" points="259.5,-30.5 148.25,-30.5 148.25,0 259.5,0 259.5,-30.5"/>
-<text text-anchor="start" x="156.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="203.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node13 -->
-<g id="edge16_Node000002_Node000013" class="edge">
-<title>Node2&#45;&gt;Node13</title>
-<g id="a_edge16_Node000002_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.99,-127.3C98.8,-107.97 114.11,-65.05 141.5,-40.25 142.73,-39.14 144.01,-38.08 145.34,-37.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.94,-40.19 153.39,-31.78 143.11,-34.33 146.94,-40.19"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887" target="_top" xlink:title="Erase a value from the specified subtree (internal method)">
-<polygon fill="white" stroke="#666666" points="413.5,-264.5 302.25,-264.5 302.25,-234 413.5,-234 413.5,-264.5"/>
-<text text-anchor="start" x="310.25" y="-251" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="357.88" y="-239.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_erase</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.75,-256.28C269.7,-255.56 280.17,-254.8 290.41,-254.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="290.59,-257.56 300.32,-253.34 290.09,-250.57 290.59,-257.56"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M331.78,-264.99C326.46,-274.06 335.15,-282.5 357.88,-282.5 370.3,-282.5 378.53,-279.97 382.57,-276.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="386.02,-276.84 383.78,-266.49 379.07,-275.98 386.02,-276.84"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29" target="_top" xlink:title="Rotate without breaking the property of BST.">
-<polygon fill="white" stroke="#666666" points="560.75,-181.5 449.5,-181.5 449.5,-151 560.75,-151 560.75,-181.5"/>
-<text text-anchor="start" x="457.5" y="-168" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="505.12" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::rotate</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M395.08,-233.55C401.3,-230.61 407.64,-227.45 413.5,-224.25 433.52,-213.33 455.04,-199.64 472.09,-188.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="473.96,-191.27 480.31,-182.78 470.06,-185.46 473.96,-191.27"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" target="_top" xlink:title="Update the subtree size of the node.">
-<polygon fill="white" stroke="#666666" points="708,-181.5 596.75,-181.5 596.75,-151 708,-151 708,-181.5"/>
-<text text-anchor="start" x="604.75" y="-168" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="652.38" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::update</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge7_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge7_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M413.89,-233.64C462.61,-219.81 533.82,-199.61 585.55,-184.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="586.48,-188.3 595.15,-182.2 584.57,-181.57 586.48,-188.3"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M561.04,-166.25C568.9,-166.25 577.06,-166.25 585.11,-166.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="584.87,-169.75 594.87,-166.25 584.87,-162.75 584.87,-169.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2" target="_top" xlink:title="Find the KTH largest value (internal method)">
-<polygon fill="white" stroke="#666666" points="413.5,-197.5 302.25,-197.5 302.25,-167 413.5,-167 413.5,-197.5"/>
-<text text-anchor="start" x="310.25" y="-184" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="357.88" y="-172.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_get_k_th</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge9_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.75,-200.78C269.8,-198.86 280.39,-196.84 290.74,-194.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.17,-198.35 300.34,-193.04 289.86,-191.47 291.17,-198.35"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge10_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge10_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M331.78,-197.99C326.46,-207.06 335.15,-215.5 357.88,-215.5 370.3,-215.5 378.53,-212.97 382.57,-209.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="386.02,-209.84 383.78,-199.49 379.07,-208.98 386.02,-209.84"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec" target="_top" xlink:title="Query the rank of specified element (internal method)">
-<polygon fill="white" stroke="#666666" points="413.5,-119.5 302.25,-119.5 302.25,-89 413.5,-89 413.5,-119.5"/>
-<text text-anchor="start" x="310.25" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="357.88" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_get_rank</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge14_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge14_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.75,-78.69C269.8,-81.34 280.39,-84.12 290.74,-86.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.8,-90.22 300.36,-89.38 291.58,-83.45 289.8,-90.22"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node12 -->
-<g id="edge15_Node000012_Node000012" class="edge">
-<title>Node12&#45;&gt;Node12</title>
-<g id="a_edge15_Node000012_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M331.78,-119.99C326.46,-129.06 335.15,-137.5 357.88,-137.5 370.3,-137.5 378.53,-134.97 382.57,-131.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="386.02,-131.84 383.78,-121.49 379.07,-130.98 386.02,-131.84"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c" target="_top" xlink:title="Insert a value into the specified subtree (internal method)">
-<polygon fill="white" stroke="#666666" points="413.5,-52.5 302.25,-52.5 302.25,-22 413.5,-22 413.5,-52.5"/>
-<text text-anchor="start" x="310.25" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="357.88" y="-27.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_insert</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge17_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge17_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.75,-23.19C269.8,-24.65 280.39,-26.18 290.74,-27.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.93,-31.1 300.33,-29.07 290.93,-24.17 289.93,-31.1"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node5 -->
-<g id="edge19_Node000014_Node000005" class="edge">
-<title>Node14&#45;&gt;Node5</title>
-<g id="a_edge19_Node000014_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M379.73,-52.94C390.07,-60.9 402.64,-70.85 413.5,-80.25 436.9,-100.49 462.37,-124.88 480.32,-142.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="477.84,-144.97 487.42,-149.51 482.76,-139.99 477.84,-144.97"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node6 -->
-<g id="edge20_Node000014_Node000006" class="edge">
-<title>Node14&#45;&gt;Node6</title>
-<g id="a_edge20_Node000014_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M394.45,-52.94C447.48,-76.33 547.27,-120.34 605.65,-146.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="604.1,-149.23 614.66,-150.06 606.93,-142.82 604.1,-149.23"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node14 -->
-<g id="edge18_Node000014_Node000014" class="edge">
-<title>Node14&#45;&gt;Node14</title>
-<g id="a_edge18_Node000014_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M331.78,-52.99C326.46,-62.06 335.15,-70.5 357.88,-70.5 370.3,-70.5 378.53,-67.97 382.57,-64.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="386.02,-64.84 383.78,-54.49 379.07,-63.98 386.02,-64.84"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index a61c304b4..000000000
--- a/d0/dd2/treap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,330 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="716pt" height="291pt"
- viewBox="0.00 0.00 716.00 290.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 286.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-146.88 0,-146.88 0,-127.62 37,-127.62 37,-146.88"/>
-<text text-anchor="middle" x="18.5" y="-133.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-146.88 73,-146.88 73,-127.62 105.5,-127.62 105.5,-146.88"/>
-<text text-anchor="middle" x="89.25" y="-133.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-137.25C44.58,-137.25 53.31,-137.25 61.45,-137.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-140.75 71.2,-137.25 61.2,-133.75 61.2,-140.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469" target="_top" xlink:title="Erase element (External method)">
-<polygon fill="white" stroke="#666666" points="259.5,-275.5 148.25,-275.5 148.25,-245 259.5,-245 259.5,-275.5"/>
-<text text-anchor="start" x="156.25" y="-262" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="203.88" y="-250.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::erase</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.96,-147.3C98.72,-166.83 113.94,-210.19 141.5,-235.25 142.72,-236.36 144,-237.43 145.33,-238.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.09,-241.17 153.37,-243.74 146.94,-235.32 143.09,-241.17"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69" target="_top" xlink:title="Get the KTH largest value (External method)">
-<polygon fill="white" stroke="#666666" points="259.5,-226.5 148.25,-226.5 148.25,-196 259.5,-196 259.5,-226.5"/>
-<text text-anchor="start" x="156.25" y="-213" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="203.88" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_k_th</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge8_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge8_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.44,-147.04C107.89,-157.83 124.35,-175.14 141.5,-186.25 143.74,-187.7 146.08,-189.1 148.48,-190.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.75,-193.48 157.25,-194.89 149.93,-187.24 146.75,-193.48"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4" target="_top" xlink:title="Get the successor node of element k.">
-<polygon fill="white" stroke="#666666" points="259.5,-177.5 148.25,-177.5 148.25,-147 259.5,-147 259.5,-177.5"/>
-<text text-anchor="start" x="156.25" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="203.88" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_next</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge11_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge11_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.91,-140.73C114.29,-142.59 125.25,-145.02 136.77,-147.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.92,-150.97 146.44,-149.72 137.44,-144.14 135.92,-150.97"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126" target="_top" xlink:title="Get the predecessor node of element k.">
-<polygon fill="white" stroke="#666666" points="266.25,-128.5 141.5,-128.5 141.5,-98 266.25,-98 266.25,-128.5"/>
-<text text-anchor="start" x="149.5" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="203.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_predecessor</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge12_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge12_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.91,-133.91C112.61,-132.48 120.96,-130.71 129.93,-128.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.57,-132.24 139.62,-126.73 129.12,-125.39 130.57,-132.24"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039" target="_top" xlink:title="Get the rank of specified element (External method)">
-<polygon fill="white" stroke="#666666" points="259.5,-79.5 148.25,-79.5 148.25,-49 259.5,-49 259.5,-79.5"/>
-<text text-anchor="start" x="156.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="203.88" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_rank</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge13_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge13_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.83,-127.29C108.37,-116.7 124.67,-100.03 141.5,-89.25 143.75,-87.81 146.09,-86.43 148.5,-85.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.94,-88.29 157.29,-80.65 146.78,-82.04 149.94,-88.29"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f" target="_top" xlink:title="Insert element (External method)">
-<polygon fill="white" stroke="#666666" points="259.5,-30.5 148.25,-30.5 148.25,0 259.5,0 259.5,-30.5"/>
-<text text-anchor="start" x="156.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="203.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node13 -->
-<g id="edge16_Node000002_Node000013" class="edge">
-<title>Node2&#45;&gt;Node13</title>
-<g id="a_edge16_Node000002_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.99,-127.3C98.8,-107.97 114.11,-65.05 141.5,-40.25 142.73,-39.14 144.01,-38.08 145.34,-37.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.94,-40.19 153.39,-31.78 143.11,-34.33 146.94,-40.19"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887" target="_top" xlink:title="Erase a value from the specified subtree (internal method)">
-<polygon fill="white" stroke="#666666" points="413.5,-264.5 302.25,-264.5 302.25,-234 413.5,-234 413.5,-264.5"/>
-<text text-anchor="start" x="310.25" y="-251" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="357.88" y="-239.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_erase</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.75,-256.28C269.7,-255.56 280.17,-254.8 290.41,-254.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="290.59,-257.56 300.32,-253.34 290.09,-250.57 290.59,-257.56"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M331.78,-264.99C326.46,-274.06 335.15,-282.5 357.88,-282.5 370.3,-282.5 378.53,-279.97 382.57,-276.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="386.02,-276.84 383.78,-266.49 379.07,-275.98 386.02,-276.84"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29" target="_top" xlink:title="Rotate without breaking the property of BST.">
-<polygon fill="white" stroke="#666666" points="560.75,-181.5 449.5,-181.5 449.5,-151 560.75,-151 560.75,-181.5"/>
-<text text-anchor="start" x="457.5" y="-168" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="505.12" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::rotate</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M395.08,-233.55C401.3,-230.61 407.64,-227.45 413.5,-224.25 433.52,-213.33 455.04,-199.64 472.09,-188.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="473.96,-191.27 480.31,-182.78 470.06,-185.46 473.96,-191.27"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" target="_top" xlink:title="Update the subtree size of the node.">
-<polygon fill="white" stroke="#666666" points="708,-181.5 596.75,-181.5 596.75,-151 708,-151 708,-181.5"/>
-<text text-anchor="start" x="604.75" y="-168" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="652.38" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::update</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge7_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge7_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M413.89,-233.64C462.61,-219.81 533.82,-199.61 585.55,-184.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="586.48,-188.3 595.15,-182.2 584.57,-181.57 586.48,-188.3"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M561.04,-166.25C568.9,-166.25 577.06,-166.25 585.11,-166.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="584.87,-169.75 594.87,-166.25 584.87,-162.75 584.87,-169.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2" target="_top" xlink:title="Find the KTH largest value (internal method)">
-<polygon fill="white" stroke="#666666" points="413.5,-197.5 302.25,-197.5 302.25,-167 413.5,-167 413.5,-197.5"/>
-<text text-anchor="start" x="310.25" y="-184" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="357.88" y="-172.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_get_k_th</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge9_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.75,-200.78C269.8,-198.86 280.39,-196.84 290.74,-194.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.17,-198.35 300.34,-193.04 289.86,-191.47 291.17,-198.35"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge10_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge10_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M331.78,-197.99C326.46,-207.06 335.15,-215.5 357.88,-215.5 370.3,-215.5 378.53,-212.97 382.57,-209.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="386.02,-209.84 383.78,-199.49 379.07,-208.98 386.02,-209.84"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec" target="_top" xlink:title="Query the rank of specified element (internal method)">
-<polygon fill="white" stroke="#666666" points="413.5,-119.5 302.25,-119.5 302.25,-89 413.5,-89 413.5,-119.5"/>
-<text text-anchor="start" x="310.25" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="357.88" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_get_rank</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge14_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge14_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.75,-78.69C269.8,-81.34 280.39,-84.12 290.74,-86.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.8,-90.22 300.36,-89.38 291.58,-83.45 289.8,-90.22"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node12 -->
-<g id="edge15_Node000012_Node000012" class="edge">
-<title>Node12&#45;&gt;Node12</title>
-<g id="a_edge15_Node000012_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M331.78,-119.99C326.46,-129.06 335.15,-137.5 357.88,-137.5 370.3,-137.5 378.53,-134.97 382.57,-131.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="386.02,-131.84 383.78,-121.49 379.07,-130.98 386.02,-131.84"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c" target="_top" xlink:title="Insert a value into the specified subtree (internal method)">
-<polygon fill="white" stroke="#666666" points="413.5,-52.5 302.25,-52.5 302.25,-22 413.5,-22 413.5,-52.5"/>
-<text text-anchor="start" x="310.25" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="357.88" y="-27.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_insert</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge17_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge17_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.75,-23.19C269.8,-24.65 280.39,-26.18 290.74,-27.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.93,-31.1 300.33,-29.07 290.93,-24.17 289.93,-31.1"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node5 -->
-<g id="edge19_Node000014_Node000005" class="edge">
-<title>Node14&#45;&gt;Node5</title>
-<g id="a_edge19_Node000014_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M379.73,-52.94C390.07,-60.9 402.64,-70.85 413.5,-80.25 436.9,-100.49 462.37,-124.88 480.32,-142.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="477.84,-144.97 487.42,-149.51 482.76,-139.99 477.84,-144.97"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node6 -->
-<g id="edge20_Node000014_Node000006" class="edge">
-<title>Node14&#45;&gt;Node6</title>
-<g id="a_edge20_Node000014_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M394.45,-52.94C447.48,-76.33 547.27,-120.34 605.65,-146.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="604.1,-149.23 614.66,-150.06 606.93,-142.82 604.1,-149.23"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node14 -->
-<g id="edge18_Node000014_Node000014" class="edge">
-<title>Node14&#45;&gt;Node14</title>
-<g id="a_edge18_Node000014_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M331.78,-52.99C326.46,-62.06 335.15,-70.5 357.88,-70.5 370.3,-70.5 378.53,-67.97 382.57,-64.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="386.02,-64.84 383.78,-54.49 379.07,-63.98 386.02,-64.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/dd2/treap_8cpp_source.html b/d0/dd2/treap_8cpp_source.html
new file mode 100644
index 000000000..78c62983b
--- /dev/null
+++ b/d0/dd2/treap_8cpp_source.html
@@ -0,0 +1,348 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/treap.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d0/dd2/treap_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">treap.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d0/dd2/treap_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;array&gt;</span>     </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d3c/namespacedata__structures.html">data_structures</a> {</div>
+<div class="foldopen" id="foldopen00035" data-start="{" data-end="}">
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../dd/d2e/namespacedata__structures_1_1treap.html">   35</a></span><span class="keyword">namespace </span>treap {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">   36</a></span><span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> = 1e5 + 5;  </div>
+<div class="foldopen" id="foldopen00040" data-start="{" data-end="};">
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html">   40</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html">Treap</a> {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c">   41</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c">root</a> = 0;      </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425">   42</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425">treapCnt</a> = 0;  </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">   43</a></span>    std::array&lt;int, maxNode&gt; <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a> = {};       </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723">   44</a></span>    std::array&lt;int, maxNode&gt; <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723">priority</a> = {};  </div>
+<div class="foldopen" id="foldopen00045" data-start="{" data-end="};">
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">   45</a></span>    std::array&lt;std::array&lt;int, 2&gt;, <a class="code hl_variable" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a>&gt; <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a> = {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        {}};  </div>
+</div>
+<div class="foldopen" id="foldopen00049" data-start="{" data-end="};">
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919">   49</a></span>    std::array&lt;int, maxNode&gt; <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919">cnt</a> =</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        {};  </div>
+</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">   51</a></span>    std::array&lt;int, maxNode&gt; <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">size</a> = {};  </div>
+<div class="foldopen" id="foldopen00055" data-start="{" data-end="}">
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683">   55</a></span>    <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683">Treap</a>() : <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425">treapCnt</a>(1) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723">priority</a>[0] = INT32_MAX;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">size</a>[0] = 0;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00063" data-start="{" data-end="}">
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7">   63</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7">update</a>(<span class="keywordtype">int</span> x) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">size</a>[x] = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]] + <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x] + <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1]];</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00071" data-start="{" data-end="}">
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29">   71</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29">rotate</a>(<span class="keywordtype">int</span> &amp;x, <span class="keywordtype">int</span> t) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        <span class="keywordtype">int</span> y = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][t];</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][t] = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[y][1 - t];</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[y][1 - t] = x;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        <span class="comment">// The rotation will only change itself and its son nodes</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7">update</a>(x);</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7">update</a>(y);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        x = y;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00085" data-start="{" data-end="}">
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c">   85</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c">_insert</a>(<span class="keywordtype">int</span> &amp;x, <span class="keywordtype">int</span> k) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        <span class="keywordflow">if</span> (x) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] == k) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>                <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x]++;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>            }  <span class="comment">// If the node already exists, the number of copies is ++</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>            <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>                <span class="keywordtype">int</span> t = (<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] &lt; k);  <span class="comment">// Insert according to BST properties</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>                <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c">_insert</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][t], k);</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>                <span class="comment">// After insertion, the heap properties are retained by rotation</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>                <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723">priority</a>[<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][t]] &lt; <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723">priority</a>[x]) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>                    <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29">rotate</a>(x, t);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>                }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            }</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        } <span class="keywordflow">else</span> {  <span class="comment">// Create a new node</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>            x = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425">treapCnt</a>++;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>            <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] = k;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>            <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x] = 1;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>            <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723">priority</a>[x] = rand();  <span class="comment">// Random priority</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>            <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0] = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1] = 0;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        }</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7">update</a>(x);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00112" data-start="{" data-end="}">
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887">  112</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887">_erase</a>(<span class="keywordtype">int</span> &amp;x, <span class="keywordtype">int</span> k) {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] == k) {</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x] &gt; 1) {</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>                <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x]--;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>            }  <span class="comment">// If the node has more than one copy, the number of copies --</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>            <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>                <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0] == 0 &amp;&amp; <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1] == 0) {</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>                    x = 0;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>                    <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>                }  <span class="comment">// If there are no children, delete and return</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>                <span class="comment">// Otherwise, we need to rotate the sons and delete them</span></div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>                <span class="comment">// recursively</span></div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>                <span class="keywordtype">int</span> t = (<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723">priority</a>[<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]] &gt; <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723">priority</a>[<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1]]);</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>                <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29">rotate</a>(x, t);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>                <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887">_erase</a>(x, k);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>            }</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        } <span class="keywordflow">else</span> {  <span class="comment">// Find the target value based on BST properties</span></div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>            <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887">_erase</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] &lt; k], k);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        }</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7">update</a>(x);</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00139" data-start="{" data-end="}">
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2">  139</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2">_get_k_th</a>(<span class="keywordtype">int</span> &amp;x, <span class="keywordtype">int</span> k) {</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        <span class="keywordflow">if</span> (k &lt;= <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]]) {</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2">_get_k_th</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0], k);</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        }</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        k -= <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]] + <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x];</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        <span class="keywordflow">if</span> (k &lt;= 0) {</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>            <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x];</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        }</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2">_get_k_th</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1], k);</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00155" data-start="{" data-end="}">
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec">  155</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec">_get_rank</a>(<span class="keywordtype">int</span> x, <span class="keywordtype">int</span> k) {</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>        <span class="keywordflow">if</span> (!x) {</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>            <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>        }</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        <span class="keywordflow">if</span> (k == <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x]) {</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>            <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]] + 1;</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (k &lt; <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x]) {</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec">_get_rank</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0], k);</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>            <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]] + <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x] + <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec">_get_rank</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1], k);</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>        }</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00172" data-start="{" data-end="}">
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126">  172</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126">get_predecessor</a>(<span class="keywordtype">int</span> k) {</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>        <span class="keywordtype">int</span> x = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, pre = -1;</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        <span class="keywordflow">while</span> (x) {</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] &lt; k) {</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>                pre = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x], x = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1];</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>                x = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0];</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>            }</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        }</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>        <span class="keywordflow">return</span> pre;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00188" data-start="{" data-end="}">
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4">  188</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4">get_next</a>(<span class="keywordtype">int</span> k) {</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        <span class="keywordtype">int</span> x = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, next = -1;</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>        <span class="keywordflow">while</span> (x) {</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] &gt; k) {</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>                next = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x], x = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0];</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>                x = <a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1];</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>            }</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>        }</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>        <span class="keywordflow">return</span> next;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    }</div>
+</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">  203</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a>(<span class="keywordtype">int</span> k) { <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c">_insert</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469">  208</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469">erase</a>(<span class="keywordtype">int</span> k) { <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887">_erase</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69">  214</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69">get_k_th</a>(<span class="keywordtype">int</span> k) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2">_get_k_th</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"><a class="line" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039">  220</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039">get_rank</a>(<span class="keywordtype">int</span> k) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec">_get_rank</a>(<a class="code hl_variable" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>};</div>
+</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>}  <span class="comment">// namespace treap</span></div>
+</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>}  <span class="comment">// namespace data_structures</span></div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span> </div>
+<div class="foldopen" id="foldopen00229" data-start="{" data-end="}">
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"><a class="line" href="../../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  229</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    <a class="code hl_struct" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html">data_structures::treap::Treap</a> mTreap;  </div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span> </div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a>(1);</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a>(2);</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a>(3);</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    assert(mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69">get_k_th</a>(2) == 2);</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a>(4);</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a>(5);</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a>(6);</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    assert(mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4">get_next</a>(4) == 5);</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a>(7);</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    assert(mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126">get_predecessor</a>(7) == 6);</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469">erase</a>(4);</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    assert(mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69">get_k_th</a>(4) == 5);</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    assert(mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039">get_rank</a>(5) == 4);</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a>(10);</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    assert(mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039">get_rank</a>(10) == 7);</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    assert(mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126">get_predecessor</a>(10) == 7);</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span> </div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00255" data-start="{" data-end="}">
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"><a class="line" href="../../d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  255</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    <a class="code hl_function" href="../../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>}</div>
+</div>
+<div class="ttc" id="anamespacedata__structures_1_1treap_html_ad939ec178d0069aeea14b7d6d7d12099"><div class="ttname"><a href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">data_structures::treap::maxNode</a></div><div class="ttdeci">const int maxNode</div><div class="ttdoc">maximum number of nodes</div><div class="ttdef"><b>Definition</b> <a href="#l00036">treap.cpp:36</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html">data_structures</a></div><div class="ttdoc">for IO operations</div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html">data_structures::treap::Treap</a></div><div class="ttdoc">Struct representation of the treap.</div><div class="ttdef"><b>Definition</b> <a href="#l00040">treap.cpp:40</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a1ab082fe0aa95a238bbbc68ab6a72425"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425">data_structures::treap::Treap::treapCnt</a></div><div class="ttdeci">int treapCnt</div><div class="ttdoc">Total number of current nodes in the treap.</div><div class="ttdef"><b>Definition</b> <a href="#l00042">treap.cpp:42</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a3081969b2714a8101f7df28b1ce5ed2c"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c">data_structures::treap::Treap::root</a></div><div class="ttdeci">int root</div><div class="ttdoc">root of the treap</div><div class="ttdef"><b>Definition</b> <a href="#l00041">treap.cpp:41</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a32db3ba3b2630943faacd27b2ecd1b04"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04">data_structures::treap::Treap::key</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; key</div><div class="ttdoc">Node identifier.</div><div class="ttdef"><b>Definition</b> <a href="#l00043">treap.cpp:43</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a5d200493aeaa02a269f6b6deda39a683"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683">data_structures::treap::Treap::Treap</a></div><div class="ttdeci">Treap()</div><div class="ttdoc">Initialization.</div><div class="ttdef"><b>Definition</b> <a href="#l00055">treap.cpp:55</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a5e884d2686aff501ef589b0d1185492f"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">data_structures::treap::Treap::insert</a></div><div class="ttdeci">void insert(int k)</div><div class="ttdoc">Insert element (External method)</div><div class="ttdef"><b>Definition</b> <a href="#l00203">treap.cpp:203</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a6a023a4f0c42fb8ed5b3368fba1a5f2c"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c">data_structures::treap::Treap::_insert</a></div><div class="ttdeci">void _insert(int &amp;x, int k)</div><div class="ttdoc">Insert a value into the specified subtree (internal method)</div><div class="ttdef"><b>Definition</b> <a href="#l00085">treap.cpp:85</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a75a48584a6560de20484fbba6229fd29"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29">data_structures::treap::Treap::rotate</a></div><div class="ttdeci">void rotate(int &amp;x, int t)</div><div class="ttdoc">Rotate without breaking the property of BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00071">treap.cpp:71</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a767b28f9911fc32b8462862be058a4a4"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4">data_structures::treap::Treap::get_next</a></div><div class="ttdeci">int get_next(int k)</div><div class="ttdoc">Get the successor node of element k.</div><div class="ttdef"><b>Definition</b> <a href="#l00188">treap.cpp:188</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a8be70f0a25e53e870e97d8d23968d723"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723">data_structures::treap::Treap::priority</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; priority</div><div class="ttdoc">Random priority.</div><div class="ttdef"><b>Definition</b> <a href="#l00044">treap.cpp:44</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a9a77d22f97add119123108211c6655ec"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec">data_structures::treap::Treap::_get_rank</a></div><div class="ttdeci">int _get_rank(int x, int k)</div><div class="ttdoc">Query the rank of specified element (internal method)</div><div class="ttdef"><b>Definition</b> <a href="#l00155">treap.cpp:155</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a9ea2becd904e2e7d22f23a001b444469"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469">data_structures::treap::Treap::erase</a></div><div class="ttdeci">void erase(int k)</div><div class="ttdoc">Erase element (External method)</div><div class="ttdef"><b>Definition</b> <a href="#l00208">treap.cpp:208</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_aae9facaede462ad924856c4d707646d7"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7">data_structures::treap::Treap::update</a></div><div class="ttdeci">void update(int x)</div><div class="ttdoc">Update the subtree size of the node.</div><div class="ttdef"><b>Definition</b> <a href="#l00063">treap.cpp:63</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ab2db3ad3aecc240011e0c8b8604d2c69"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69">data_structures::treap::Treap::get_k_th</a></div><div class="ttdeci">int get_k_th(int k)</div><div class="ttdoc">Get the KTH largest value (External method)</div><div class="ttdef"><b>Definition</b> <a href="#l00214">treap.cpp:214</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ab8b9899f22070cfa01db5bf874296126"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126">data_structures::treap::Treap::get_predecessor</a></div><div class="ttdeci">int get_predecessor(int k)</div><div class="ttdoc">Get the predecessor node of element k.</div><div class="ttdef"><b>Definition</b> <a href="#l00172">treap.cpp:172</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ab99f68b79e1c4ff0f1cd6f2f0b6a545f"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">data_structures::treap::Treap::childs</a></div><div class="ttdeci">std::array&lt; std::array&lt; int, 2 &gt;, maxNode &gt; childs</div><div class="ttdef"><b>Definition</b> <a href="#l00045">treap.cpp:45</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ac94e9d69305940f6d8804031455af039"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039">data_structures::treap::Treap::get_rank</a></div><div class="ttdeci">int get_rank(int k)</div><div class="ttdoc">Get the rank of specified element (External method)</div><div class="ttdef"><b>Definition</b> <a href="#l00220">treap.cpp:220</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ad08520c0617eb8dcfcbfa90d258aa6b2"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2">data_structures::treap::Treap::_get_k_th</a></div><div class="ttdeci">int _get_k_th(int &amp;x, int k)</div><div class="ttdoc">Find the KTH largest value (internal method)</div><div class="ttdef"><b>Definition</b> <a href="#l00139">treap.cpp:139</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_aeb4bb0db68c7c04ef9498c88c3777887"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887">data_structures::treap::Treap::_erase</a></div><div class="ttdeci">void _erase(int &amp;x, int k)</div><div class="ttdoc">Erase a value from the specified subtree (internal method)</div><div class="ttdef"><b>Definition</b> <a href="#l00112">treap.cpp:112</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_af5f0b8263339485989f8a02ae026114c"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">data_structures::treap::Treap::size</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; size</div><div class="ttdoc">The number of copies per node.</div><div class="ttdef"><b>Definition</b> <a href="#l00051">treap.cpp:51</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_af7e6c6620ab32bc96633d101245fa919"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919">data_structures::treap::Treap::cnt</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; cnt</div><div class="ttdoc">Maintains the subtree size for ranking query.</div><div class="ttdef"><b>Definition</b> <a href="#l00049">treap.cpp:49</a></div></div>
+<div class="ttc" id="atreap_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d0/dd2/treap_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> <a href="#l00229">treap.cpp:229</a></div></div>
+<div class="ttc" id="atreap_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00255">treap.cpp:255</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d0/dd2/treap_8cpp.html">treap.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d0/dd5/classciphers_1_1_hill_cipher-members.html b/d0/dd5/classciphers_1_1_hill_cipher-members.html
index eadefd665..c94773682 100644
--- a/d0/dd5/classciphers_1_1_hill_cipher-members.html
+++ b/d0/dd5/classciphers_1_1_hill_cipher-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d0/dd5/namespacebubble__sort.html b/d0/dd5/namespacebubble__sort.html
index 0761fd825..70b9629f6 100644
--- a/d0/dd5/namespacebubble__sort.html
+++ b/d0/dd5/namespacebubble__sort.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: bubble_sort Namespace Reference</title>
+<title>TheAlgorithms/C++: bubble_sort Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d0/dda/namespacesaddleback.html b/d0/dda/namespacesaddleback.html
index cd3f17e10..814d4dca1 100644
--- a/d0/dda/namespacesaddleback.html
+++ b/d0/dda/namespacesaddleback.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: saddleback Namespace Reference</title>
+<title>TheAlgorithms/C++: saddleback Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d0/de2/gaussian__elimination_8cpp.html b/d0/de2/gaussian__elimination_8cpp.html
index 10479a5db..e311bb3ea 100644
--- a/d0/de2/gaussian__elimination_8cpp.html
+++ b/d0/de2/gaussian__elimination_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/gaussian_elimination.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/gaussian_elimination.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,7 +135,9 @@ Include dependency graph for gaussian_elimination.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/ddd/gaussian__elimination_8cpp__incl.svg" width="202" height="126"><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">
+</div>
+<p><a href="../../d0/de2/gaussian__elimination_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
@@ -126,6 +145,8 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Gaussian_elimination" target="_blank">Gaussian elimination method</a> </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d0/de2/gaussian__elimination_8cpp_source.html">gaussian_elimination.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -142,11 +163,13 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/de2/gaussian__elimination_8cpp_source.html#l00009">9</a> of file <a class="el" href="../../d0/de2/gaussian__elimination_8cpp_source.html">gaussian_elimination.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">    9</span>           {</div>
 <div class="line"><span class="lineno">   10</span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>, i, j, step;</div>
 <div class="line"><span class="lineno">   11</span> </div>
-<div class="line"><span class="lineno">   12</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Matrix size: &quot;</span>;</div>
-<div class="line"><span class="lineno">   13</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>;</div>
+<div class="line"><span class="lineno">   12</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Matrix size: &quot;</span>;</div>
+<div class="line"><span class="lineno">   13</span>    std::cin &gt;&gt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>;</div>
 <div class="line"><span class="lineno">   14</span> </div>
 <div class="line"><span class="lineno">   15</span>    <span class="comment">// create a 2D matrix by dynamic memory allocation</span></div>
 <div class="line"><span class="lineno">   16</span>    <span class="keywordtype">double</span> **mat = <span class="keyword">new</span> <span class="keywordtype">double</span> *[<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> + 1], **x = <span class="keyword">new</span> <span class="keywordtype">double</span> *[<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>];</div>
@@ -157,10 +180,10 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   21</span>    }</div>
 <div class="line"><span class="lineno">   22</span> </div>
 <div class="line"><span class="lineno">   23</span>    <span class="comment">// get the matrix elements from user</span></div>
-<div class="line"><span class="lineno">   24</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <span class="stringliteral">&quot;Enter value of the matrix: &quot;</span> &lt;&lt; <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">   24</span>    std::cout &lt;&lt; std::endl &lt;&lt; <span class="stringliteral">&quot;Enter value of the matrix: &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   25</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) {</div>
 <div class="line"><span class="lineno">   26</span>        <span class="keywordflow">for</span> (j = 0; j &lt;= <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; j++) {</div>
-<div class="line"><span class="lineno">   27</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt;</div>
+<div class="line"><span class="lineno">   27</span>            std::cin &gt;&gt;</div>
 <div class="line"><span class="lineno">   28</span>                mat[i][j];  <span class="comment">// Enter (mat_size*mat_size) value of the matrix.</span></div>
 <div class="line"><span class="lineno">   29</span>        }</div>
 <div class="line"><span class="lineno">   30</span>    }</div>
@@ -175,17 +198,17 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   39</span>        }</div>
 <div class="line"><span class="lineno">   40</span>    }</div>
 <div class="line"><span class="lineno">   41</span> </div>
-<div class="line"><span class="lineno">   42</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   43</span>              &lt;&lt; <span class="stringliteral">&quot;Matrix using Gaussian Elimination method: &quot;</span> &lt;&lt; <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">   42</span>    std::cout &lt;&lt; std::endl</div>
+<div class="line"><span class="lineno">   43</span>              &lt;&lt; <span class="stringliteral">&quot;Matrix using Gaussian Elimination method: &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   44</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) {</div>
 <div class="line"><span class="lineno">   45</span>        <span class="keywordflow">for</span> (j = 0; j &lt;= <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; j++) {</div>
 <div class="line"><span class="lineno">   46</span>            x[i][j] = mat[i][j];</div>
-<div class="line"><span class="lineno">   47</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; mat[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   47</span>            std::cout &lt;&lt; mat[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   48</span>        }</div>
-<div class="line"><span class="lineno">   49</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   49</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   50</span>    }</div>
-<div class="line"><span class="lineno">   51</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   52</span>              &lt;&lt; <span class="stringliteral">&quot;Value of the Gaussian Elimination method: &quot;</span> &lt;&lt; <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">   51</span>    std::cout &lt;&lt; std::endl</div>
+<div class="line"><span class="lineno">   52</span>              &lt;&lt; <span class="stringliteral">&quot;Value of the Gaussian Elimination method: &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   53</span>    <span class="keywordflow">for</span> (i = <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> - 1; i &gt;= 0; i--) {</div>
 <div class="line"><span class="lineno">   54</span>        <span class="keywordtype">double</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> = 0;</div>
 <div class="line"><span class="lineno">   55</span>        <span class="keywordflow">for</span> (j = <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> - 1; j &gt; i; j--) {</div>
@@ -197,7 +220,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   61</span>        <span class="keywordflow">else</span></div>
 <div class="line"><span class="lineno">   62</span>            x[i][i] = (x[i][<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>] - <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a>) / (x[i][i]);</div>
 <div class="line"><span class="lineno">   63</span> </div>
-<div class="line"><span class="lineno">   64</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;x&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;= &quot;</span> &lt;&lt; x[i][i] &lt;&lt; <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">   64</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;x&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;= &quot;</span> &lt;&lt; x[i][i] &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   65</span>    }</div>
 <div class="line"><span class="lineno">   66</span> </div>
 <div class="line"><span class="lineno">   67</span>    <span class="keywordflow">for</span> (i = 0; i &lt;= <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) {</div>
@@ -210,17 +233,9 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   74</span> </div>
 <div class="line"><span class="lineno">   75</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   76</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="amatrix__exponentiation_8cpp_html_a9977ad12548c4a49dee9dc3f0685aa54"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a></div><div class="ttdeci">ll mat_size</div><div class="ttdef"><b>Definition</b> matrix_exponentiation.cpp:45</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="180" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a9977ad12548c4a49dee9dc3f0685aa54"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a></div><div class="ttdeci">ll mat_size</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00045">matrix_exponentiation.cpp:45</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00232">vector_ops.hpp:232</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 490da38cb..000000000
--- a/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 2f2fe09b6..000000000
--- a/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fa87532068062fd8189cade55ca11658
\ No newline at end of file
diff --git a/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 5c76e5177..000000000
--- a/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 134.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-9.62C44.56,-9.62 52.97,-9.62 61.25,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.21,-13.13 71.21,-9.63 61.21,-6.13 61.21,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 575e4300e..000000000
--- a/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 134.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-9.62C44.56,-9.62 52.97,-9.62 61.25,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.21,-13.13 71.21,-9.63 61.21,-6.13 61.21,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d0/de2/gaussian__elimination_8cpp_source.html b/d0/de2/gaussian__elimination_8cpp_source.html
new file mode 100644
index 000000000..137f8de59
--- /dev/null
+++ b/d0/de2/gaussian__elimination_8cpp_source.html
@@ -0,0 +1,212 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/gaussian_elimination.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d0/de2/gaussian__elimination_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">gaussian_elimination.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d0/de2/gaussian__elimination_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="foldopen" id="foldopen00009" data-start="{" data-end="}">
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"><a class="line" href="../../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">    9</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>, i, j, step;</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Matrix size: &quot;</span>;</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    std::cin &gt;&gt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>;</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="comment">// create a 2D matrix by dynamic memory allocation</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <span class="keywordtype">double</span> **mat = <span class="keyword">new</span> <span class="keywordtype">double</span> *[<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> + 1], **x = <span class="keyword">new</span> <span class="keywordtype">double</span> *[<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>];</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="keywordflow">for</span> (i = 0; i &lt;= <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        mat[i] = <span class="keyword">new</span> <span class="keywordtype">double</span>[<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> + 1];</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        <span class="keywordflow">if</span> (i &lt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>)</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>            x[i] = <span class="keyword">new</span> <span class="keywordtype">double</span>[<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> + 1];</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    }</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    <span class="comment">// get the matrix elements from user</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    std::cout &lt;&lt; std::endl &lt;&lt; <span class="stringliteral">&quot;Enter value of the matrix: &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        <span class="keywordflow">for</span> (j = 0; j &lt;= <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; j++) {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>            std::cin &gt;&gt;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>                mat[i][j];  <span class="comment">// Enter (mat_size*mat_size) value of the matrix.</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>        }</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    }</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="comment">// perform Gaussian elimination</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordflow">for</span> (step = 0; step &lt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> - 1; step++) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        <span class="keywordflow">for</span> (i = step; i &lt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> - 1; i++) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>            <span class="keywordtype">double</span> a = (mat[i + 1][step] / mat[step][step]);</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>            <span class="keywordflow">for</span> (j = step; j &lt;= <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; j++)</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>                mat[i + 1][j] = mat[i + 1][j] - (a * mat[step][j]);</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        }</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    }</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    std::cout &lt;&lt; std::endl</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>              &lt;&lt; <span class="stringliteral">&quot;Matrix using Gaussian Elimination method: &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="keywordflow">for</span> (j = 0; j &lt;= <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; j++) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            x[i][j] = mat[i][j];</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            std::cout &lt;&lt; mat[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    std::cout &lt;&lt; std::endl</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>              &lt;&lt; <span class="stringliteral">&quot;Value of the Gaussian Elimination method: &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">for</span> (i = <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> - 1; i &gt;= 0; i--) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <span class="keywordtype">double</span> sum = 0;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="keywordflow">for</span> (j = <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> - 1; j &gt; i; j--) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            x[i][j] = x[j][j] * x[i][j];</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            sum = x[i][j] + sum;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <span class="keywordflow">if</span> (x[i][i] == 0)</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            x[i][i] = 0;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            x[i][i] = (x[i][<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>] - sum) / (x[i][i]);</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;x&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;= &quot;</span> &lt;&lt; x[i][i] &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">for</span> (i = 0; i &lt;= <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        <span class="keyword">delete</span>[] mat[i];</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        <span class="keywordflow">if</span> (i &lt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>)</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            <span class="keyword">delete</span>[] x[i];</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keyword">delete</span>[] mat;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keyword">delete</span>[] x;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>}</div>
+</div>
+<div class="ttc" id="agaussian__elimination_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00009">gaussian_elimination.cpp:9</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a9977ad12548c4a49dee9dc3f0685aa54"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a></div><div class="ttdeci">ll mat_size</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00045">matrix_exponentiation.cpp:45</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../d0/de2/gaussian__elimination_8cpp.html">gaussian_elimination.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d0/dea/strassen__matrix__multiplication_8cpp_source.html b/d0/dea/strassen__matrix__multiplication_8cpp_source.html
new file mode 100644
index 000000000..7fca341d5
--- /dev/null
+++ b/d0/dea/strassen__matrix__multiplication_8cpp_source.html
@@ -0,0 +1,530 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: divide_and_conquer/strassen_matrix_multiplication.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d0/dea/strassen__matrix__multiplication_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">strassen_matrix_multiplication.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;chrono&gt;</span>    </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;tuple&gt;</span>     </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/dba/namespacedivide__and__conquer.html">divide_and_conquer</a> {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d3/d91/namespacestrassens__multiplication.html">strassens_multiplication</a> {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> MAX_SIZE = ~0ULL;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T,</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>          <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>              std::is_integral&lt;T&gt;::value || std::is_floating_point&lt;T&gt;::value,</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>              <span class="keywordtype">bool</span>&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00040" data-start="{" data-end="};">
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">   40</a></span><span class="keyword">class </span><a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    std::vector&lt;std::vector&lt;T&gt;&gt; _mat;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Integer,</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>              <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>                  std::is_integral&lt;Integer&gt;::value, Integer&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00053" data-start="{" data-end="}">
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256">   53</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix</a>(<span class="keyword">const</span> Integer <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>; ++i) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            _mat.emplace_back(std::vector&lt;T&gt;(<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>, 0));</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    }</div>
+</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Integer,</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>              <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                  std::is_integral&lt;Integer&gt;::value, Integer&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00069" data-start="{" data-end="}">
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a4aa49765cce39ce48b9241e993e0cfb9">   69</a></span>    <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a4aa49765cce39ce48b9241e993e0cfb9">Matrix</a>(<span class="keyword">const</span> Integer rows, <span class="keyword">const</span> Integer cols) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; rows; ++i) {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>            _mat.emplace_back(std::vector&lt;T&gt;(cols, 0));</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        }</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    }</div>
+</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="foldopen" id="foldopen00079" data-start="{" data-end="}">
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">   79</a></span>    <span class="keyword">inline</span> std::pair&lt;size_t, size_t&gt; <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="keywordflow">return</span> {_mat.size(), _mat[0].size()};</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    }</div>
+</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Integer,</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>              <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>                  std::is_integral&lt;Integer&gt;::value, Integer&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00093" data-start="{" data-end="}">
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"><a class="line" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ac4c64e5723fa12a043fd0a7f5ed5bb37">   93</a></span>    <span class="keyword">inline</span> std::vector&lt;T&gt; &amp;<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ac4c64e5723fa12a043fd0a7f5ed5bb37">operator[]</a>(<span class="keyword">const</span> Integer index) {</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="keywordflow">return</span> _mat[index];</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    }</div>
+</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="foldopen" id="foldopen00106" data-start="{" data-end="}">
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"><a class="line" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17">  106</a></span>    <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17">slice</a>(<span class="keyword">const</span> <span class="keywordtype">size_t</span> row_start, <span class="keyword">const</span> <span class="keywordtype">size_t</span> row_end = MAX_SIZE,</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>                 <span class="keyword">const</span> <span class="keywordtype">size_t</span> col_start = MAX_SIZE,</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>                 <span class="keyword">const</span> <span class="keywordtype">size_t</span> col_end = MAX_SIZE)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        <span class="keyword">const</span> <span class="keywordtype">size_t</span> h_size =</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>            (row_end != MAX_SIZE ? row_end : _mat.size()) - row_start;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        <span class="keyword">const</span> <span class="keywordtype">size_t</span> v_size = (col_end != MAX_SIZE ? col_end : _mat[0].size()) -</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>                              (col_start != MAX_SIZE ? col_start : 0);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> result = <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix&lt;T&gt;</a>(h_size, v_size);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        <span class="keyword">const</span> <span class="keywordtype">size_t</span> v_start = (col_start != MAX_SIZE ? col_start : 0);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; h_size; ++i) {</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; v_size; ++j) {</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>                result._mat[i][j] = _mat[i + row_start][j + v_start];</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>            }</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        }</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    }</div>
+</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Number, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>                                   std::is_integral&lt;Number&gt;::value ||</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>                                       std::is_floating_point&lt;Number&gt;::value,</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>                                   Number&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00134" data-start="{" data-end="}">
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"><a class="line" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ab6534125643a02c114bd4cddba9bc17f">  134</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ab6534125643a02c114bd4cddba9bc17f">h_stack</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix&lt;Number&gt;</a> &amp;other) {</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>        assert(_mat.size() == other._mat.size());</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; other._mat.size(); ++i) {</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; other._mat[i].size(); ++j) {</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>                _mat[i].push_back(other._mat[i][j]);</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>            }</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        }</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    }</div>
+</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span> </div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Number, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>                                   std::is_integral&lt;Number&gt;::value ||</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>                                       std::is_floating_point&lt;Number&gt;::value,</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>                                   Number&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00153" data-start="{" data-end="}">
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"><a class="line" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af12ceffdc07cc87eca8a4a8ac87d60fe">  153</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af12ceffdc07cc87eca8a4a8ac87d60fe">v_stack</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix&lt;Number&gt;</a> &amp;other) {</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        assert(_mat[0].<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>() == other._mat[0].size());</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; other._mat.size(); ++i) {</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>            _mat.emplace_back(std::vector&lt;T&gt;(other._mat[i].size()));</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; other._mat[i].size(); ++j) {</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>                _mat.back()[j] = other._mat[i][j];</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>            }</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>        }</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    }</div>
+</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span> </div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Number, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>                                   std::is_integral&lt;Number&gt;::value ||</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>                                       std::is_floating_point&lt;Number&gt;::value,</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>                                   <span class="keywordtype">bool</span>&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00173" data-start="{" data-end="}">
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"><a class="line" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211">  173</a></span>    <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211">operator+</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix&lt;Number&gt;</a> &amp;other)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        assert(this-&gt;<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>() == other.<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>());</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> C = <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix&lt;Number&gt;</a>(_mat.size(), _mat[0].size());</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.size(); ++i) {</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].size(); ++j) {</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>                C._mat[i][j] = _mat[i][j] + other._mat[i][j];</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>            }</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        }</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>        <span class="keywordflow">return</span> C;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    }</div>
+</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span> </div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Number, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>                                   std::is_integral&lt;Number&gt;::value ||</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>                                       std::is_floating_point&lt;Number&gt;::value,</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>                                   <span class="keywordtype">bool</span>&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00194" data-start="{" data-end="}">
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"><a class="line" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae190115f8d4d31e47d7290e0b6871391">  194</a></span>    <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> &amp;<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae190115f8d4d31e47d7290e0b6871391">operator+=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix&lt;Number&gt;</a> &amp;other)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>        assert(this-&gt;<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>() == other.<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>());</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.size(); ++i) {</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].size(); ++j) {</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>                _mat[i][j] += other._mat[i][j];</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>            }</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>        }</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>        <span class="keywordflow">return</span> <span class="keyword">this</span>;</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    }</div>
+</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span> </div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Number, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>                                   std::is_integral&lt;Number&gt;::value ||</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>                                       std::is_floating_point&lt;Number&gt;::value,</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>                                   <span class="keywordtype">bool</span>&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00214" data-start="{" data-end="}">
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"><a class="line" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a678681c9f6266a8219bd6bee6972d70e">  214</a></span>    <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a678681c9f6266a8219bd6bee6972d70e">operator-</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix&lt;Number&gt;</a> &amp;other)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>        assert(this-&gt;<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>() == other.<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>());</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>        <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> C = <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix&lt;Number&gt;</a>(_mat.size(), _mat[0].size());</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.size(); ++i) {</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].size(); ++j) {</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>                C._mat[i][j] = _mat[i][j] - other._mat[i][j];</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>            }</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>        }</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>        <span class="keywordflow">return</span> C;</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    }</div>
+</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span> </div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Number, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>                                   std::is_integral&lt;Number&gt;::value ||</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>                                       std::is_floating_point&lt;Number&gt;::value,</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>                                   <span class="keywordtype">bool</span>&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00235" data-start="{" data-end="}">
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"><a class="line" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a42c986fb57b74fe1b7c5953cb1922c3d">  235</a></span>    <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> &amp;<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a42c986fb57b74fe1b7c5953cb1922c3d">operator-=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix&lt;Number&gt;</a> &amp;other)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>        assert(this-&gt;<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>() == other.<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>());</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.size(); ++i) {</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].size(); ++j) {</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>                _mat[i][j] -= other._mat[i][j];</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>            }</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>        }</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>        <span class="keywordflow">return</span> <span class="keyword">this</span>;</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    }</div>
+</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span> </div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Number, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>                                   std::is_integral&lt;Number&gt;::value ||</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>                                       std::is_floating_point&lt;Number&gt;::value,</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>                                   <span class="keywordtype">bool</span>&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00255" data-start="{" data-end="}">
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"><a class="line" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c">  255</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c">operator*</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix&lt;Number&gt;</a> &amp;other)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>        assert(_mat[0].<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>() == other._mat.size());</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>        <span class="keyword">auto</span> <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> = this-&gt;<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>();</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>        <span class="keyword">const</span> <span class="keywordtype">size_t</span> row = <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>.first, col = <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>.second;</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>        <span class="comment">// Main condition for applying strassen&#39;s method:</span></div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>        <span class="comment">// 1: matrix should be a square matrix</span></div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>        <span class="comment">// 2: matrix should be of even size (mat.size() % 2 == 0)</span></div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>        <span class="keywordflow">return</span> (row == col &amp;&amp; (row &amp; 1) == 0)</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>                   ? this-&gt;<a class="code hl_namespace" href="../../d3/d91/namespacestrassens__multiplication.html">strassens_multiplication</a>(other)</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>                   : this-&gt;<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50">naive_multiplication</a>(other);</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>    }</div>
+</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span> </div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Number, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>                                   std::is_integral&lt;Number&gt;::value ||</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>                                       std::is_floating_point&lt;Number&gt;::value,</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>                                   <span class="keywordtype">bool</span>&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00277" data-start="{" data-end="}">
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"><a class="line" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e">  277</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e">operator*</a>(<span class="keyword">const</span> Number other)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>        <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> C = <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix&lt;Number&gt;</a>(_mat.size(), _mat[0].size());</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.size(); ++i) {</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].size(); ++j) {</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>                C._mat[i][j] = _mat[i][j] * other;</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>            }</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>        }</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>        <span class="keywordflow">return</span> C;</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>    }</div>
+</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span> </div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Number, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>                                   std::is_integral&lt;Number&gt;::value ||</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>                                       std::is_floating_point&lt;Number&gt;::value,</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>                                   <span class="keywordtype">bool</span>&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00297" data-start="{" data-end="}">
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"><a class="line" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12">  297</a></span>    <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> &amp;<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12">operator*=</a>(<span class="keyword">const</span> Number other)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.size(); ++i) {</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].size(); ++j) {</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>                _mat[i][j] *= other;</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>            }</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>        }</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>        <span class="keywordflow">return</span> <span class="keyword">this</span>;</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>    }</div>
+</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span> </div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Number, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>                                   std::is_integral&lt;Number&gt;::value ||</div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>                                       std::is_floating_point&lt;Number&gt;::value,</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>                                   <span class="keywordtype">bool</span>&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00316" data-start="{" data-end="}">
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"><a class="line" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50">  316</a></span>    <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50">naive_multiplication</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix&lt;Number&gt;</a> &amp;other)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>        <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> C = <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix&lt;Number&gt;</a>(_mat.size(), other._mat[0].size());</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span> </div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.size(); ++i) {</div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> k = 0; k &lt; _mat[0].size(); ++k) {</div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>                <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; other._mat[0].size(); ++j) {</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>                    C._mat[i][j] += _mat[i][k] * other._mat[k][j];</div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>                }</div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>            }</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>        }</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>        <span class="keywordflow">return</span> C;</div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>    }</div>
+</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span> </div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Number, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>                                   std::is_integral&lt;Number&gt;::value ||</div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>                                       std::is_floating_point&lt;Number&gt;::value,</div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>                                   <span class="keywordtype">bool</span>&gt;::type&gt;</div>
+<div class="foldopen" id="foldopen00340" data-start="{" data-end="}">
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"><a class="line" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a">  340</a></span>    <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a">strassens_multiplication</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix&lt;Number&gt;</a> &amp;other)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>        <span class="keyword">const</span> <span class="keywordtype">size_t</span> <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> = _mat.size();</div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>        <span class="comment">// Base case: when a matrix is small enough for faster naive</span></div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>        <span class="comment">// multiplication, or the matrix is of odd size, then go with the naive</span></div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>        <span class="comment">// multiplication route;</span></div>
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span>        <span class="comment">// else; go with the strassen&#39;s method.</span></div>
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> &lt;= 64ULL || (<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> &amp; 1ULL)) {</div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>            <span class="keywordflow">return</span> this-&gt;<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50">naive_multiplication</a>(other);</div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>            <span class="keyword">const</span> <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix&lt;Number&gt;</a></div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>                A = this-&gt;<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17">slice</a>(0ULL, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> &gt;&gt; 1, 0ULL, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> &gt;&gt; 1),</div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>                B = this-&gt;<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17">slice</a>(0ULL, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> &gt;&gt; 1, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> &gt;&gt; 1, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>),</div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>                C = this-&gt;<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17">slice</a>(size &gt;&gt; 1, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>, 0ULL, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> &gt;&gt; 1),</div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>                D = this-&gt;<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17">slice</a>(size &gt;&gt; 1, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> &gt;&gt; 1, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>),</div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>                E = other.<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17">slice</a>(0ULL, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> &gt;&gt; 1, 0ULL, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> &gt;&gt; 1),</div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>                F = other.<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17">slice</a>(0ULL, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> &gt;&gt; 1, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> &gt;&gt; 1, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>),</div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>                G = other.<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17">slice</a>(<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> &gt;&gt; 1, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>, 0ULL, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> &gt;&gt; 1),</div>
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>                H = other.<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17">slice</a>(<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> &gt;&gt; 1, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> &gt;&gt; 1, <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>);</div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span> </div>
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>            <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> P1 = A.<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a">strassens_multiplication</a>(F - H);</div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>            <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> P2 = (A + B).<a class="code hl_namespace" href="../../d3/d91/namespacestrassens__multiplication.html">strassens_multiplication</a>(H);</div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>            <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> P3 = (C + D).<a class="code hl_namespace" href="../../d3/d91/namespacestrassens__multiplication.html">strassens_multiplication</a>(E);</div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>            <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> P4 = D.<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a">strassens_multiplication</a>(G - E);</div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>            <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> P5 = (A + D).<a class="code hl_namespace" href="../../d3/d91/namespacestrassens__multiplication.html">strassens_multiplication</a>(E + H);</div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>            <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> P6 = (B - D).<a class="code hl_namespace" href="../../d3/d91/namespacestrassens__multiplication.html">strassens_multiplication</a>(G + H);</div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>            <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> P7 = (A - C).<a class="code hl_namespace" href="../../d3/d91/namespacestrassens__multiplication.html">strassens_multiplication</a>(E + F);</div>
+<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span> </div>
+<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>            <span class="comment">// Building final matrix C11 would be</span></div>
+<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>            <span class="comment">//     [      |      ]</span></div>
+<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>            <span class="comment">//     [ C11  |  C12 ]</span></div>
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>            <span class="comment">// C = [ ____ | ____ ]</span></div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>            <span class="comment">//     [      |      ]</span></div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>            <span class="comment">//     [ C21  |  C22 ]</span></div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>            <span class="comment">//     [      |      ]</span></div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span> </div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>            <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> C11 = P5 + P4 - P2 + P6;</div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>            <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> C12 = P1 + P2;</div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>            <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> C21 = P3 + P4;</div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>            <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> C22 = P1 + P5 - P3 - P7;</div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span> </div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>            C21.<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ab6534125643a02c114bd4cddba9bc17f">h_stack</a>(C22);</div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>            C11.<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ab6534125643a02c114bd4cddba9bc17f">h_stack</a>(C12);</div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>            C11.<a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af12ceffdc07cc87eca8a4a8ac87d60fe">v_stack</a>(C21);</div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span> </div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>            <span class="keywordflow">return</span> C11;</div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>        }</div>
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>    }</div>
+</div>
+<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span> </div>
+<div class="foldopen" id="foldopen00393" data-start="{" data-end="}">
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"><a class="line" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c">  393</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c">operator==</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix&lt;T&gt;</a> &amp;other)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>        <span class="keywordflow">if</span> (_mat.size() != other._mat.size() ||</div>
+<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>            _mat[0].size() != other._mat[0].size()) {</div>
+<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>        }</div>
+<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.size(); ++i) {</div>
+<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].size(); ++j) {</div>
+<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span>                <span class="keywordflow">if</span> (_mat[i][j] != other._mat[i][j]) {</div>
+<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>                    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>                }</div>
+<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>            }</div>
+<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>        }</div>
+<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>    }</div>
+</div>
+<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span> </div>
+<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>    <span class="keyword">friend</span> std::ostream &amp;operator&lt;&lt;(std::ostream &amp;out, <span class="keyword">const</span> <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix&lt;T&gt;</a> &amp;mat) {</div>
+<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;row : mat._mat) {</div>
+<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;elem : row) {</div>
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>                out &lt;&lt; elem &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>            }</div>
+<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>            out &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>        }</div>
+<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>        <span class="keywordflow">return</span> out &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>    }</div>
+<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>};</div>
+</div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span> </div>
+<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>}  <span class="comment">// namespace strassens_multiplication</span></div>
+<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span> </div>
+<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>}  <span class="comment">// namespace divide_and_conquer</span></div>
+<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span> </div>
+<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
+<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> s = 512;</div>
+<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span>    <span class="keyword">auto</span> matrix_demo =</div>
+<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>        <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix&lt;size_t&gt;</a>(s, s);</div>
+<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span> </div>
+<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; s; ++i) {</div>
+<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; s; ++j) {</div>
+<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>            matrix_demo[i][j] = i + j;</div>
+<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>        }</div>
+<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>    }</div>
+<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span> </div>
+<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>    <span class="keyword">auto</span> matrix_demo2 =</div>
+<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>        <a class="code hl_class" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix&lt;size_t&gt;</a>(s, s);</div>
+<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; s; ++i) {</div>
+<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; s; ++j) {</div>
+<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>            matrix_demo2[i][j] = 2 + i + j;</div>
+<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>        }</div>
+<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span>    }</div>
+<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span> </div>
+<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span>    <span class="keyword">auto</span> start = std::chrono::system_clock::now();</div>
+<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span>    <span class="keyword">auto</span> Mat3 = matrix_demo2 * matrix_demo;</div>
+<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span>    <span class="keyword">auto</span> end = std::chrono::system_clock::now();</div>
+<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span> </div>
+<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span>    std::chrono::duration&lt;double&gt; time = (end - start);</div>
+<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Strassen time: &quot;</span> &lt;&lt; time.count() &lt;&lt; <span class="stringliteral">&quot;s&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span> </div>
+<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>    start = std::chrono::system_clock::now();</div>
+<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>    <span class="keyword">auto</span> conf = matrix_demo2.naive_multiplication(matrix_demo);</div>
+<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>    end = std::chrono::system_clock::now();</div>
+<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span> </div>
+<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>    time = end - start;</div>
+<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Normal time: &quot;</span> &lt;&lt; time.count() &lt;&lt; <span class="stringliteral">&quot;s&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span> </div>
+<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span>    <span class="comment">// std::cout &lt;&lt; Mat3 &lt;&lt; conf &lt;&lt; std::endl;</span></div>
+<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>    assert(Mat3 == conf);</div>
+<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>}</div>
+<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span> </div>
+<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span>    <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();  <span class="comment">// run self-test implementation</span></div>
+<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span>}</div>
+<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00100">caesar_cipher.cpp:100</a></div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html"><div class="ttname"><a href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix</a></div><div class="ttdoc">Matrix class.</div><div class="ttdef"><b>Definition</b> <a href="#l00040">strassen_matrix_multiplication.cpp:40</a></div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_a01f3a05cf5abdc5d63999ef1bf9f9256"><div class="ttname"><a href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256">divide_and_conquer::strassens_multiplication::Matrix::Matrix</a></div><div class="ttdeci">Matrix(const Integer size)</div><div class="ttdoc">Constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00053">strassen_matrix_multiplication.cpp:53</a></div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_a1fcb7db9bdeabd874712ec4f00483d17"><div class="ttname"><a href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17">divide_and_conquer::strassens_multiplication::Matrix::slice</a></div><div class="ttdeci">Matrix slice(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</div><div class="ttdoc">Creates a new matrix and returns a part of it.</div><div class="ttdef"><b>Definition</b> <a href="#l00106">strassen_matrix_multiplication.cpp:106</a></div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_a42c986fb57b74fe1b7c5953cb1922c3d"><div class="ttname"><a href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a42c986fb57b74fe1b7c5953cb1922c3d">divide_and_conquer::strassens_multiplication::Matrix::operator-=</a></div><div class="ttdeci">Matrix &amp; operator-=(const Matrix&lt; Number &gt; &amp;other) const</div><div class="ttdoc">Subtract another matrices to current matrix.</div><div class="ttdef"><b>Definition</b> <a href="#l00235">strassen_matrix_multiplication.cpp:235</a></div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_a4aa49765cce39ce48b9241e993e0cfb9"><div class="ttname"><a href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a4aa49765cce39ce48b9241e993e0cfb9">divide_and_conquer::strassens_multiplication::Matrix::Matrix</a></div><div class="ttdeci">Matrix(const Integer rows, const Integer cols)</div><div class="ttdoc">Constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00069">strassen_matrix_multiplication.cpp:69</a></div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_a562faa16a4b4ed5d4804823c56f99c9c"><div class="ttname"><a href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c">divide_and_conquer::strassens_multiplication::Matrix::operator==</a></div><div class="ttdeci">bool operator==(const Matrix&lt; T &gt; &amp;other) const</div><div class="ttdoc">Compares two matrices if each of them are equal or not.</div><div class="ttdef"><b>Definition</b> <a href="#l00393">strassen_matrix_multiplication.cpp:393</a></div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_a5d8eb669b37a27224376b08515b4ee50"><div class="ttname"><a href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50">divide_and_conquer::strassens_multiplication::Matrix::naive_multiplication</a></div><div class="ttdeci">Matrix naive_multiplication(const Matrix&lt; Number &gt; &amp;other) const</div><div class="ttdoc">Naive multiplication performed on this.</div><div class="ttdef"><b>Definition</b> <a href="#l00316">strassen_matrix_multiplication.cpp:316</a></div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_a60599668b56001cef4bb59d4cb5c6c6c"><div class="ttname"><a href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c">divide_and_conquer::strassens_multiplication::Matrix::operator*</a></div><div class="ttdeci">Matrix operator*(const Matrix&lt; Number &gt; &amp;other) const</div><div class="ttdoc">Multiply two matrices and returns a new matrix.</div><div class="ttdef"><b>Definition</b> <a href="#l00255">strassen_matrix_multiplication.cpp:255</a></div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_a678681c9f6266a8219bd6bee6972d70e"><div class="ttname"><a href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a678681c9f6266a8219bd6bee6972d70e">divide_and_conquer::strassens_multiplication::Matrix::operator-</a></div><div class="ttdeci">Matrix operator-(const Matrix&lt; Number &gt; &amp;other) const</div><div class="ttdoc">Subtract two matrices and returns a new matrix.</div><div class="ttdef"><b>Definition</b> <a href="#l00214">strassen_matrix_multiplication.cpp:214</a></div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_a87c2ed8f19bda2ad21ee4cbed32c394a"><div class="ttname"><a href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a">divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication</a></div><div class="ttdeci">Matrix strassens_multiplication(const Matrix&lt; Number &gt; &amp;other) const</div><div class="ttdoc">Strassens method of multiplying two matrices References: https://en.wikipedia.org/wiki/Strassen_algor...</div><div class="ttdef"><b>Definition</b> <a href="#l00340">strassen_matrix_multiplication.cpp:340</a></div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_ab6534125643a02c114bd4cddba9bc17f"><div class="ttname"><a href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ab6534125643a02c114bd4cddba9bc17f">divide_and_conquer::strassens_multiplication::Matrix::h_stack</a></div><div class="ttdeci">void h_stack(const Matrix&lt; Number &gt; &amp;other)</div><div class="ttdoc">Horizontally stack the matrix (one after the other)</div><div class="ttdef"><b>Definition</b> <a href="#l00134">strassen_matrix_multiplication.cpp:134</a></div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_ac4c64e5723fa12a043fd0a7f5ed5bb37"><div class="ttname"><a href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ac4c64e5723fa12a043fd0a7f5ed5bb37">divide_and_conquer::strassens_multiplication::Matrix::operator[]</a></div><div class="ttdeci">std::vector&lt; T &gt; &amp; operator[](const Integer index)</div><div class="ttdoc">returns the address of the element at ith place (here ith row of the matrix)</div><div class="ttdef"><b>Definition</b> <a href="#l00093">strassen_matrix_multiplication.cpp:93</a></div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_ad36ec1f1a97298e49de605384e5f8211"><div class="ttname"><a href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211">divide_and_conquer::strassens_multiplication::Matrix::operator+</a></div><div class="ttdeci">Matrix operator+(const Matrix&lt; Number &gt; &amp;other) const</div><div class="ttdoc">Add two matrices and returns a new matrix.</div><div class="ttdef"><b>Definition</b> <a href="#l00173">strassen_matrix_multiplication.cpp:173</a></div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_ae190115f8d4d31e47d7290e0b6871391"><div class="ttname"><a href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae190115f8d4d31e47d7290e0b6871391">divide_and_conquer::strassens_multiplication::Matrix::operator+=</a></div><div class="ttdeci">Matrix &amp; operator+=(const Matrix&lt; Number &gt; &amp;other) const</div><div class="ttdoc">Add another matrices to current matrix.</div><div class="ttdef"><b>Definition</b> <a href="#l00194">strassen_matrix_multiplication.cpp:194</a></div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_ae4e183ec8eab778cb243e4ae0b22a0f1"><div class="ttname"><a href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">divide_and_conquer::strassens_multiplication::Matrix::size</a></div><div class="ttdeci">std::pair&lt; size_t, size_t &gt; size() const</div><div class="ttdoc">Get the matrix shape.</div><div class="ttdef"><b>Definition</b> <a href="#l00079">strassen_matrix_multiplication.cpp:79</a></div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_aedbe01e48a96fefa0b393ec577b0f19e"><div class="ttname"><a href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e">divide_and_conquer::strassens_multiplication::Matrix::operator*</a></div><div class="ttdeci">Matrix operator*(const Number other) const</div><div class="ttdoc">Multiply matrix with a number and returns a new matrix.</div><div class="ttdef"><b>Definition</b> <a href="#l00277">strassen_matrix_multiplication.cpp:277</a></div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_af09566a6a59d30875434c140e18e0a12"><div class="ttname"><a href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12">divide_and_conquer::strassens_multiplication::Matrix::operator*=</a></div><div class="ttdeci">Matrix &amp; operator*=(const Number other) const</div><div class="ttdoc">Multiply a number to current matrix.</div><div class="ttdef"><b>Definition</b> <a href="#l00297">strassen_matrix_multiplication.cpp:297</a></div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_af12ceffdc07cc87eca8a4a8ac87d60fe"><div class="ttname"><a href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af12ceffdc07cc87eca8a4a8ac87d60fe">divide_and_conquer::strassens_multiplication::Matrix::v_stack</a></div><div class="ttdeci">void v_stack(const Matrix&lt; Number &gt; &amp;other)</div><div class="ttdoc">Horizontally stack the matrix (current matrix above the other)</div><div class="ttdef"><b>Definition</b> <a href="#l00153">strassen_matrix_multiplication.cpp:153</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacedivide__and__conquer_html"><div class="ttname"><a href="../../dd/dba/namespacedivide__and__conquer.html">divide_and_conquer</a></div><div class="ttdoc">for std::vector</div></div>
+<div class="ttc" id="anamespacestrassens__multiplication_html"><div class="ttname"><a href="../../d3/d91/namespacestrassens__multiplication.html">strassens_multiplication</a></div><div class="ttdoc">Namespace for performing strassen's multiplication.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_93bc990c5cceb745f78af6949e9ef947.html">divide_and_conquer</a></li><li class="navelem"><b>strassen_matrix_multiplication.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.map b/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.map
index ba2ec2310..326da70bc 100644
--- a/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.map
+++ b/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.map
@@ -1,7 +1,5 @@
 <map id="data_structures::stack_using_queue::Stack" name="data_structures::stack_using_queue::Stack">
-<area shape="rect" id="Node000001" title="Stack Class implementation for basic methods of Stack Data Structure." alt="" coords="5,198,157,238"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue.html" title=" " alt="" coords="8,94,154,120"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="84,135,84,197,78,197,78,135"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="38,5,124,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="84,47,84,94,78,94,78,47"/>
+<area shape="rect" id="Node000001" title="Stack Class implementation for basic methods of Stack Data Structure." alt="" coords="5,109,157,150"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="8,5,154,31"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="84,47,84,109,78,109,78,47"/>
 </map>
diff --git a/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.md5 b/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.md5
index 3f22e779d..69a54c558 100644
--- a/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.md5
+++ b/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.md5
@@ -1 +1 @@
-ea3d74234586e9e25aeff435e2dc7b02
\ No newline at end of file
+f23956ab070d32544ff06d60628e9507
\ No newline at end of file
diff --git a/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.svg b/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.svg
index 3dcf09f83..ddf866c30 100644
--- a/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.svg
+++ b/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.svg
@@ -4,8 +4,8 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: data_structures::stack_using_queue::Stack Pages: 1 -->
-<svg width="122pt" height="183pt"
- viewBox="0.00 0.00 121.50 182.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="122pt" height="116pt"
+ viewBox="0.00 0.00 121.50 116.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
 <svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
@@ -17,7 +17,7 @@
 ]]></style>
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
 <svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 178.75)">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 112.25)">
 <title>data_structures::stack_using_queue::Stack</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="111.25,-108.25 2.25,-108.25 2.25,-89 111.25,-89 111.25,-108.25"/>
 <text text-anchor="middle" x="56.75" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue&lt; int64_t &gt;</text>
 </a>
@@ -49,25 +49,6 @@
 <text text-anchor="middle" x="81.5" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> auxiliary_q</text>
 <text text-anchor="middle" x="81.5" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">main_q</text>
 </g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="89.12,-174.75 24.38,-174.75 24.38,-155.5 89.12,-155.5 89.12,-174.75"/>
-<text text-anchor="middle" x="56.75" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::int64_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M56.75,-143.65C56.75,-131.82 56.75,-117.54 56.75,-108.52"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="53.25,-143.64 56.75,-153.64 60.25,-143.64 53.25,-143.64"/>
-</a>
-</g>
-<text text-anchor="middle" x="78.12" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
 </g>
 </svg>
 </svg>
diff --git a/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph_org.svg b/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph_org.svg
index 129935f59..8d929d0ae 100644
--- a/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph_org.svg
+++ b/d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph_org.svg
@@ -4,9 +4,9 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: data_structures::stack_using_queue::Stack Pages: 1 -->
-<svg width="122pt" height="183pt"
- viewBox="0.00 0.00 121.50 182.75" 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 178.75)">
+<svg width="122pt" height="116pt"
+ viewBox="0.00 0.00 121.50 116.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 112.25)">
 <title>data_structures::stack_using_queue::Stack</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="111.25,-108.25 2.25,-108.25 2.25,-89 111.25,-89 111.25,-108.25"/>
 <text text-anchor="middle" x="56.75" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue&lt; int64_t &gt;</text>
 </a>
@@ -38,24 +38,5 @@
 <text text-anchor="middle" x="81.5" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> auxiliary_q</text>
 <text text-anchor="middle" x="81.5" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">main_q</text>
 </g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="89.12,-174.75 24.38,-174.75 24.38,-155.5 89.12,-155.5 89.12,-174.75"/>
-<text text-anchor="middle" x="56.75" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::int64_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M56.75,-143.65C56.75,-131.82 56.75,-117.54 56.75,-108.52"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="53.25,-143.64 56.75,-153.64 60.25,-143.64 53.25,-143.64"/>
-</a>
-</g>
-<text text-anchor="middle" x="78.12" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
 </g>
 </svg>
diff --git a/d0/df8/namespaceabbreviation.html b/d0/df8/namespaceabbreviation.html
index 46b502599..3d2867cbf 100644
--- a/d0/df8/namespaceabbreviation.html
+++ b/d0/df8/namespaceabbreviation.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: abbreviation Namespace Reference</title>
+<title>TheAlgorithms/C++: abbreviation Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.map b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.map
index f3864cd51..d64dc6940 100644
--- a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.map
+++ b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.map
@@ -1,11 +1,9 @@
 <map id="machine_learning::aystar_search::EightPuzzle&lt; N &gt;" name="machine_learning::aystar_search::EightPuzzle&lt; N &gt;">
-<area shape="rect" id="Node000001" title="A class defining EightPuzzle/15&#45;Puzzle game." alt="" coords="662,37,842,78"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array.html" title=" " alt="" coords="428,5,571,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="587,34,662,44,661,49,587,39"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="428,71,571,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="586,77,661,67,662,72,586,82"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair.html" title=" " alt="" coords="207,71,323,111"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="339,88,428,88,428,94,339,94"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="5,78,85,104"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="100,88,206,88,206,94,100,94"/>
+<area shape="rect" id="Node000001" title="A class defining EightPuzzle/15&#45;Puzzle game." alt="" coords="461,37,640,78"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="227,5,370,46"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="386,34,461,44,460,49,385,39"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="227,71,370,111"/>
+<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="384,77,460,67,461,72,385,82"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="5,71,122,111"/>
+<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="138,88,227,88,227,94,138,94"/>
 </map>
diff --git a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.md5 b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.md5
index ab70a89fe..e22bc1bbe 100644
--- a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.md5
+++ b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.md5
@@ -1 +1 @@
-b610af580288d32f551d2dbb9542c0b1
\ No newline at end of file
+7e9853f4c00333f00da73b7b2db6223c
\ No newline at end of file
diff --git a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.svg b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.svg
index cb07a19da..46bfd41f3 100644
--- a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.svg
+++ b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.svg
@@ -4,9 +4,10 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: machine_learning::aystar_search::EightPuzzle&lt; N &gt; Pages: 1 -->
-<!--zoomable 88 -->
+<svg width="484pt" height="88pt"
+ viewBox="0.00 0.00 484.25 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
+<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
 <style type="text/css"><![CDATA[
 .node, .edge {opacity: 0.7;}
@@ -14,64 +15,27 @@
 .edge:hover path { stroke: red; }
 .edge:hover polygon { stroke: red; fill: red; }
 ]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 635;
-var viewHeight = 88;
-var sectionId = 'dynsection-0';
-</script>
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
 <svg id="graph" class="graph">
-<g id="viewport">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
 <title>machine_learning::aystar_search::EightPuzzle&lt; N &gt;</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="A class defining EightPuzzle/15&#45;Puzzle game.">
-<polygon fill="#999999" stroke="#666666" points="627.25,-55.5 492.75,-55.5 492.75,-25 627.25,-25 627.25,-55.5"/>
-<text text-anchor="start" x="500.75" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="middle" x="560" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle&lt; N &gt;</text>
+<polygon fill="#999999" stroke="#666666" points="476.25,-55.5 341.75,-55.5 341.75,-25 476.25,-25 476.25,-55.5"/>
+<text text-anchor="start" x="349.75" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
+<text text-anchor="middle" x="409" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle&lt; N &gt;</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424.5,-79.5 317,-79.5 317,-49 424.5,-49 424.5,-79.5"/>
-<text text-anchor="start" x="325" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; std::array</text>
-<text text-anchor="middle" x="370.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint32_t, 3 &gt;, 3 &gt;</text>
+<g id="a_Node000002"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="273.5,-79.5 166,-79.5 166,-49 273.5,-49 273.5,-79.5"/>
+<text text-anchor="start" x="174" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; std::array</text>
+<text text-anchor="middle" x="219.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint32_t, 3 &gt;, 3 &gt;</text>
 </a>
 </g>
 </g>
@@ -79,19 +43,19 @@ var sectionId = 'dynsection-0';
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M436.25,-55.98C454.37,-53.66 474.11,-51.13 492.35,-48.79"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="435.88,-52.5 426.41,-57.24 436.77,-59.44 435.88,-52.5"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M285.25,-55.98C303.37,-53.66 323.11,-51.13 341.35,-48.79"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="284.88,-52.5 275.41,-57.24 285.77,-59.44 284.88,-52.5"/>
 </a>
 </g>
-<text text-anchor="middle" x="458.62" y="-56.86" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> board</text>
+<text text-anchor="middle" x="307.62" y="-56.86" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> board</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424.12,-30.5 317.38,-30.5 317.38,0 424.12,0 424.12,-30.5"/>
-<text text-anchor="start" x="325.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::pair</text>
-<text text-anchor="middle" x="370.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int8_t, int8_t &gt; &gt;</text>
+<g id="a_Node000003"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="273.12,-30.5 166.38,-30.5 166.38,0 273.12,0 273.12,-30.5"/>
+<text text-anchor="start" x="174.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::pair</text>
+<text text-anchor="middle" x="219.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int8_t, int8_t &gt; &gt;</text>
 </a>
 </g>
 </g>
@@ -99,19 +63,19 @@ var sectionId = 'dynsection-0';
 <g id="edge2_Node000001_Node000003" class="edge">
 <title>Node3&#45;&gt;Node1</title>
 <g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M435.56,-23.77C453.87,-26.21 473.89,-28.89 492.36,-31.35"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="436.28,-20.33 425.91,-22.48 435.36,-27.27 436.28,-20.33"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M284.56,-23.77C302.87,-26.21 322.89,-28.89 341.36,-31.35"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="285.28,-20.33 274.91,-22.48 284.36,-27.27 285.28,-20.33"/>
 </a>
 </g>
-<text text-anchor="middle" x="458.62" y="-30.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> moves</text>
+<text text-anchor="middle" x="307.62" y="-30.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> moves</text>
 </g>
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.25,-30.5 151,-30.5 151,0 238.25,0 238.25,-30.5"/>
-<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::pair&lt; int8_t,</text>
-<text text-anchor="middle" x="194.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00"> int8_t &gt;</text>
+<g id="a_Node000004"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="87.25,-30.5 0,-30.5 0,0 87.25,0 87.25,-30.5"/>
+<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::pair&lt; int8_t,</text>
+<text text-anchor="middle" x="43.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00"> int8_t &gt;</text>
 </a>
 </g>
 </g>
@@ -119,55 +83,14 @@ var sectionId = 'dynsection-0';
 <g id="edge3_Node000003_Node000004" class="edge">
 <title>Node4&#45;&gt;Node3</title>
 <g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M250.15,-15.25C271.46,-15.25 295.8,-15.25 316.94,-15.25"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="250.18,-11.75 240.18,-15.25 250.18,-18.75 250.18,-11.75"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M99.15,-15.25C120.46,-15.25 144.8,-15.25 165.94,-15.25"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="99.18,-11.75 89.18,-15.25 99.18,-18.75 99.18,-11.75"/>
 </a>
 </g>
-<text text-anchor="middle" x="277.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="59.5,-24.88 0,-24.88 0,-5.63 59.5,-5.63 59.5,-24.88"/>
-<text text-anchor="middle" x="29.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::int8_t</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M71.16,-15.25C95.34,-15.25 126.05,-15.25 150.67,-15.25"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="71.38,-11.75 61.38,-15.25 71.38,-18.75 71.38,-11.75"/>
-</a>
-</g>
-<text text-anchor="middle" x="105.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> first_type</text>
-<text text-anchor="middle" x="105.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">second_type</text>
+<text text-anchor="middle" x="126.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
 </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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph_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>
 
 <style type='text/css'>
diff --git a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph_org.svg b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph_org.svg
index 9e5c83aa5..390ae291f 100644
--- a/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph_org.svg
+++ b/d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph_org.svg
@@ -4,27 +4,27 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: machine_learning::aystar_search::EightPuzzle&lt; N &gt; Pages: 1 -->
-<svg width="635pt" height="88pt"
- viewBox="0.00 0.00 635.25 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="484pt" height="88pt"
+ viewBox="0.00 0.00 484.25 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 <g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
 <title>machine_learning::aystar_search::EightPuzzle&lt; N &gt;</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="A class defining EightPuzzle/15&#45;Puzzle game.">
-<polygon fill="#999999" stroke="#666666" points="627.25,-55.5 492.75,-55.5 492.75,-25 627.25,-25 627.25,-55.5"/>
-<text text-anchor="start" x="500.75" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="middle" x="560" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle&lt; N &gt;</text>
+<polygon fill="#999999" stroke="#666666" points="476.25,-55.5 341.75,-55.5 341.75,-25 476.25,-25 476.25,-55.5"/>
+<text text-anchor="start" x="349.75" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
+<text text-anchor="middle" x="409" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle&lt; N &gt;</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424.5,-79.5 317,-79.5 317,-49 424.5,-49 424.5,-79.5"/>
-<text text-anchor="start" x="325" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; std::array</text>
-<text text-anchor="middle" x="370.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint32_t, 3 &gt;, 3 &gt;</text>
+<g id="a_Node000002"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="273.5,-79.5 166,-79.5 166,-49 273.5,-49 273.5,-79.5"/>
+<text text-anchor="start" x="174" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; std::array</text>
+<text text-anchor="middle" x="219.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint32_t, 3 &gt;, 3 &gt;</text>
 </a>
 </g>
 </g>
@@ -32,19 +32,19 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M436.25,-55.98C454.37,-53.66 474.11,-51.13 492.35,-48.79"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="435.88,-52.5 426.41,-57.24 436.77,-59.44 435.88,-52.5"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M285.25,-55.98C303.37,-53.66 323.11,-51.13 341.35,-48.79"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="284.88,-52.5 275.41,-57.24 285.77,-59.44 284.88,-52.5"/>
 </a>
 </g>
-<text text-anchor="middle" x="458.62" y="-56.86" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> board</text>
+<text text-anchor="middle" x="307.62" y="-56.86" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> board</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424.12,-30.5 317.38,-30.5 317.38,0 424.12,0 424.12,-30.5"/>
-<text text-anchor="start" x="325.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::pair</text>
-<text text-anchor="middle" x="370.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int8_t, int8_t &gt; &gt;</text>
+<g id="a_Node000003"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="273.12,-30.5 166.38,-30.5 166.38,0 273.12,0 273.12,-30.5"/>
+<text text-anchor="start" x="174.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::pair</text>
+<text text-anchor="middle" x="219.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int8_t, int8_t &gt; &gt;</text>
 </a>
 </g>
 </g>
@@ -52,19 +52,19 @@
 <g id="edge2_Node000001_Node000003" class="edge">
 <title>Node3&#45;&gt;Node1</title>
 <g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M435.56,-23.77C453.87,-26.21 473.89,-28.89 492.36,-31.35"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="436.28,-20.33 425.91,-22.48 435.36,-27.27 436.28,-20.33"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M284.56,-23.77C302.87,-26.21 322.89,-28.89 341.36,-31.35"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="285.28,-20.33 274.91,-22.48 284.36,-27.27 285.28,-20.33"/>
 </a>
 </g>
-<text text-anchor="middle" x="458.62" y="-30.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> moves</text>
+<text text-anchor="middle" x="307.62" y="-30.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> moves</text>
 </g>
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.25,-30.5 151,-30.5 151,0 238.25,0 238.25,-30.5"/>
-<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::pair&lt; int8_t,</text>
-<text text-anchor="middle" x="194.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00"> int8_t &gt;</text>
+<g id="a_Node000004"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="87.25,-30.5 0,-30.5 0,0 87.25,0 87.25,-30.5"/>
+<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::pair&lt; int8_t,</text>
+<text text-anchor="middle" x="43.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00"> int8_t &gt;</text>
 </a>
 </g>
 </g>
@@ -72,31 +72,11 @@
 <g id="edge3_Node000003_Node000004" class="edge">
 <title>Node4&#45;&gt;Node3</title>
 <g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M250.15,-15.25C271.46,-15.25 295.8,-15.25 316.94,-15.25"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="250.18,-11.75 240.18,-15.25 250.18,-18.75 250.18,-11.75"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M99.15,-15.25C120.46,-15.25 144.8,-15.25 165.94,-15.25"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="99.18,-11.75 89.18,-15.25 99.18,-18.75 99.18,-11.75"/>
 </a>
 </g>
-<text text-anchor="middle" x="277.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="59.5,-24.88 0,-24.88 0,-5.63 59.5,-5.63 59.5,-24.88"/>
-<text text-anchor="middle" x="29.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::int8_t</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M71.16,-15.25C95.34,-15.25 126.05,-15.25 150.67,-15.25"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="71.38,-11.75 61.38,-15.25 71.38,-18.75 71.38,-11.75"/>
-</a>
-</g>
-<text text-anchor="middle" x="105.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> first_type</text>
-<text text-anchor="middle" x="105.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">second_type</text>
+<text text-anchor="middle" x="126.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
 </g>
 </g>
 </svg>
diff --git a/d0/dff/structlinkedlist.html b/d0/dff/structlinkedlist.html
index 8d6dde136..2eb777c6b 100644
--- a/d0/dff/structlinkedlist.html
+++ b/d0/dff/structlinkedlist.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: linkedlist Struct Reference</title>
+<title>TheAlgorithms/C++: linkedlist Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,15 +135,49 @@ Collaboration diagram for linkedlist:</div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a4e025f2bca6ab3ae7b0408a416d53d93" id="r_a4e025f2bca6ab3ae7b0408a416d53d93"><td class="memItemLeft" align="right" valign="top"><a id="a4e025f2bca6ab3ae7b0408a416d53d93" name="a4e025f2bca6ab3ae7b0408a416d53d93"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
+<tr class="memitem:a4e025f2bca6ab3ae7b0408a416d53d93" id="r_a4e025f2bca6ab3ae7b0408a416d53d93"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4e025f2bca6ab3ae7b0408a416d53d93">data</a></td></tr>
 <tr class="separator:a4e025f2bca6ab3ae7b0408a416d53d93"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a698c32a2f4e48b98bb540f518d2937a0" id="r_a698c32a2f4e48b98bb540f518d2937a0"><td class="memItemLeft" align="right" valign="top"><a id="a698c32a2f4e48b98bb540f518d2937a0" name="a698c32a2f4e48b98bb540f518d2937a0"></a>
-<a class="el" href="../../d0/dff/structlinkedlist.html">linkedlist</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>next</b></td></tr>
+<tr class="memitem:a698c32a2f4e48b98bb540f518d2937a0" id="r_a698c32a2f4e48b98bb540f518d2937a0"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d0/dff/structlinkedlist.html">linkedlist</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a698c32a2f4e48b98bb540f518d2937a0">next</a></td></tr>
 <tr class="separator:a698c32a2f4e48b98bb540f518d2937a0"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html#l00006">6</a> of file <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html">queue_using_linkedlist.cpp</a>.</p>
+</div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="a4e025f2bca6ab3ae7b0408a416d53d93" name="a4e025f2bca6ab3ae7b0408a416d53d93"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a4e025f2bca6ab3ae7b0408a416d53d93">&#9670;&#160;</a></span>data</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int linkedlist::data</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html#l00007">7</a> of file <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html">queue_using_linkedlist.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a698c32a2f4e48b98bb540f518d2937a0" name="a698c32a2f4e48b98bb540f518d2937a0"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a698c32a2f4e48b98bb540f518d2937a0">&#9670;&#160;</a></span>next</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d0/dff/structlinkedlist.html">linkedlist</a>* linkedlist::next</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html#l00008">8</a> of file <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html">queue_using_linkedlist.cpp</a>.</p>
+
+</div>
+</div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>data_structures/<b>queue_using_linkedlist.cpp</b></li>
+<li>data_structures/<a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html">queue_using_linkedlist.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d1/d07/class_solution-members.html b/d1/d07/class_solution-members.html
index 92df33660..cf67eb5b0 100644
--- a/d1/d07/class_solution-members.html
+++ b/d1/d07/class_solution-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d1/d11/gcd__of__n__numbers_8cpp.html b/d1/d11/gcd__of__n__numbers_8cpp.html
index 9e101f4de..69fdd7200 100644
--- a/d1/d11/gcd__of__n__numbers_8cpp.html
+++ b/d1/d11/gcd__of__n__numbers_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/gcd_of_n_numbers.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/gcd_of_n_numbers.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for gcd_of_n_numbers.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d7d/gcd__of__n__numbers_8cpp__incl.svg" width="344" height="111"><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">
+</div>
+<p><a href="../../d1/d11/gcd__of__n__numbers_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -137,12 +156,12 @@ Functions</h2></td></tr>
 <tr class="memitem:a509a35e11ed1e17a9e00dd56320a4181" id="r_a509a35e11ed1e17a9e00dd56320a4181"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a509a35e11ed1e17a9e00dd56320a4181">math::gcd_of_n_numbers::gcd_two</a> (int x, int y)</td></tr>
 <tr class="memdesc:a509a35e11ed1e17a9e00dd56320a4181"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to compute GCD of 2 numbers x and y.  <br /></td></tr>
 <tr class="separator:a509a35e11ed1e17a9e00dd56320a4181"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a71b9357c7a722f8208499d9ba573297a" id="r_a71b9357c7a722f8208499d9ba573297a"><td class="memTemplParams" colspan="2">template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> n&gt; </td></tr>
-<tr class="memitem:a71b9357c7a722f8208499d9ba573297a"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a71b9357c7a722f8208499d9ba573297a">math::gcd_of_n_numbers::check_all_zeros</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt; &amp;a)</td></tr>
+<tr class="memitem:a71b9357c7a722f8208499d9ba573297a" id="r_a71b9357c7a722f8208499d9ba573297a"><td class="memTemplParams" colspan="2">template&lt;std::size_t n&gt; </td></tr>
+<tr class="memitem:a71b9357c7a722f8208499d9ba573297a"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a71b9357c7a722f8208499d9ba573297a">math::gcd_of_n_numbers::check_all_zeros</a> (const std::array&lt; int, n &gt; &amp;a)</td></tr>
 <tr class="memdesc:a71b9357c7a722f8208499d9ba573297a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to check if all elements in the array are 0.  <br /></td></tr>
 <tr class="separator:a71b9357c7a722f8208499d9ba573297a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a1161713c662a14c2d5e33504f4324532" id="r_a1161713c662a14c2d5e33504f4324532"><td class="memTemplParams" colspan="2">template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> n&gt; </td></tr>
-<tr class="memitem:a1161713c662a14c2d5e33504f4324532"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt; &amp;a)</td></tr>
+<tr class="memitem:a1161713c662a14c2d5e33504f4324532" id="r_a1161713c662a14c2d5e33504f4324532"><td class="memTemplParams" colspan="2">template&lt;std::size_t n&gt; </td></tr>
+<tr class="memitem:a1161713c662a14c2d5e33504f4324532"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a1161713c662a14c2d5e33504f4324532">math::gcd_of_n_numbers::gcd</a> (const std::array&lt; int, n &gt; &amp;a)</td></tr>
 <tr class="memdesc:a1161713c662a14c2d5e33504f4324532"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main program to compute GCD using the Euclidean algorithm.  <br /></td></tr>
 <tr class="separator:a1161713c662a14c2d5e33504f4324532"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -156,6 +175,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>This program aims at calculating the GCD of n numbers. </p>
 <p>The GCD of n numbers can be calculated by repeatedly calculating the GCDs of pairs of numbers i.e. \(\gcd(a, b, c)\) = \(\gcd(\gcd(a, b), c)\) Euclidean algorithm helps calculate the GCD of each pair of numbers efficiently</p>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html" title="Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm">gcd_iterative_euclidean.cpp</a>, <a class="el" href="../../d4/d45/gcd__recursive__euclidean_8cpp.html" title="Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm">gcd_recursive_euclidean.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d1/d11/gcd__of__n__numbers_8cpp_source.html">gcd_of_n_numbers.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a71b9357c7a722f8208499d9ba573297a" name="a71b9357c7a722f8208499d9ba573297a"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a71b9357c7a722f8208499d9ba573297a">&#9670;&#160;</a></span>check_all_zeros()</h2>
@@ -163,12 +184,12 @@ Functions</h2></td></tr>
 <div class="memitem">
 <div class="memproto">
 <div class="memtemplate">
-template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> n&gt; </div>
+template&lt;std::size_t n&gt; </div>
       <table class="memname">
         <tr>
           <td class="memname">bool math::gcd_of_n_numbers::check_all_zeros </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span></td><td>)</td>
+          <td class="paramtype">const std::array&lt; int, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -184,17 +205,13 @@ template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/
 <dl class="section return"><dt>Returns</dt><dd>'True' if all elements are 0 </dd>
 <dd>
 'False' if not all elements are 0 </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d11/gcd__of__n__numbers_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../d1/d11/gcd__of__n__numbers_8cpp_source.html">gcd_of_n_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   53</span>                                                {</div>
 <div class="line"><span class="lineno">   54</span>  <span class="comment">// Use std::all_of to simplify zero-checking</span></div>
-<div class="line"><span class="lineno">   55</span>  <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html">std::all_of</a>(a.begin(), a.end(), [](<span class="keywordtype">int</span> x) { return x == 0; });</div>
+<div class="line"><span class="lineno">   55</span>  <span class="keywordflow">return</span> std::all_of(a.begin(), a.end(), [](<span class="keywordtype">int</span> x) { return x == 0; });</div>
 <div class="line"><span class="lineno">   56</span>}</div>
-<div class="ttc" id="aall_any_none_of_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html">std::all_of</a></div><div class="ttdeci">T all_of(T... args)</div></div>
-</div><!-- 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="../../d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph.svg" width="306" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1161713c662a14c2d5e33504f4324532" name="a1161713c662a14c2d5e33504f4324532"></a>
@@ -203,12 +220,12 @@ Here is the call graph for this function:</div>
 <div class="memitem">
 <div class="memproto">
 <div class="memtemplate">
-template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> n&gt; </div>
+template&lt;std::size_t n&gt; </div>
       <table class="memname">
         <tr>
           <td class="memname">int math::gcd_of_n_numbers::gcd </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span></td><td>)</td>
+          <td class="paramtype">const std::array&lt; int, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -222,6 +239,8 @@ template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>GCD of the numbers in the array or std::nullopt if undefined </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d11/gcd__of__n__numbers_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../d1/d11/gcd__of__n__numbers_8cpp_source.html">gcd_of_n_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   64</span>                                   {</div>
 <div class="line"><span class="lineno">   65</span>  <span class="comment">// GCD is undefined if all elements in the array are 0</span></div>
 <div class="line"><span class="lineno">   66</span>  <span class="keywordflow">if</span> (<a class="code hl_function" href="#a71b9357c7a722f8208499d9ba573297a">check_all_zeros</a>(a)) {</div>
@@ -230,7 +249,7 @@ template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/
 <div class="line"><span class="lineno">   69</span> </div>
 <div class="line"><span class="lineno">   70</span>  <span class="comment">// divisors can be negative, we only want the positive value</span></div>
 <div class="line"><span class="lineno">   71</span>  <span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = std::abs(a[0]);</div>
-<div class="line"><span class="lineno">   72</span>  <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> i = 1; i &lt; n; ++i) {</div>
+<div class="line"><span class="lineno">   72</span>  <span class="keywordflow">for</span> (std::size_t i = 1; i &lt; n; ++i) {</div>
 <div class="line"><span class="lineno">   73</span>    <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="#a509a35e11ed1e17a9e00dd56320a4181">gcd_two</a>(result, std::abs(a[i]));</div>
 <div class="line"><span class="lineno">   74</span>    <span class="keywordflow">if</span> (result == 1) {</div>
 <div class="line"><span class="lineno">   75</span>      <span class="keywordflow">break</span>; <span class="comment">// Further computations still result in gcd of 1</span></div>
@@ -238,16 +257,10 @@ template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/
 <div class="line"><span class="lineno">   77</span>  }</div>
 <div class="line"><span class="lineno">   78</span>  <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   79</span>}</div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-<div class="ttc" id="agcd__of__n__numbers_8cpp_html_a509a35e11ed1e17a9e00dd56320a4181"><div class="ttname"><a href="#a509a35e11ed1e17a9e00dd56320a4181">math::gcd_of_n_numbers::gcd_two</a></div><div class="ttdeci">int gcd_two(int x, int y)</div><div class="ttdoc">Function to compute GCD of 2 numbers x and y.</div><div class="ttdef"><b>Definition</b> gcd_of_n_numbers.cpp:35</div></div>
-<div class="ttc" id="agcd__of__n__numbers_8cpp_html_a71b9357c7a722f8208499d9ba573297a"><div class="ttname"><a href="#a71b9357c7a722f8208499d9ba573297a">math::gcd_of_n_numbers::check_all_zeros</a></div><div class="ttdeci">bool check_all_zeros(const std::array&lt; int, n &gt; &amp;a)</div><div class="ttdoc">Function to check if all elements in the array are 0.</div><div class="ttdef"><b>Definition</b> gcd_of_n_numbers.cpp:53</div></div>
-<div class="ttc" id="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph.svg" width="551" height="215"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+<div class="ttc" id="agcd__of__n__numbers_8cpp_html_a509a35e11ed1e17a9e00dd56320a4181"><div class="ttname"><a href="#a509a35e11ed1e17a9e00dd56320a4181">math::gcd_of_n_numbers::gcd_two</a></div><div class="ttdeci">int gcd_two(int x, int y)</div><div class="ttdoc">Function to compute GCD of 2 numbers x and y.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d11/gcd__of__n__numbers_8cpp_source.html#l00035">gcd_of_n_numbers.cpp:35</a></div></div>
+<div class="ttc" id="agcd__of__n__numbers_8cpp_html_a71b9357c7a722f8208499d9ba573297a"><div class="ttname"><a href="#a71b9357c7a722f8208499d9ba573297a">math::gcd_of_n_numbers::check_all_zeros</a></div><div class="ttdeci">bool check_all_zeros(const std::array&lt; int, n &gt; &amp;a)</div><div class="ttdoc">Function to check if all elements in the array are 0.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d11/gcd__of__n__numbers_8cpp_source.html#l00053">gcd_of_n_numbers.cpp:53</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a509a35e11ed1e17a9e00dd56320a4181" name="a509a35e11ed1e17a9e00dd56320a4181"></a>
@@ -278,6 +291,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>GCD of x and y via recursion </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d11/gcd__of__n__numbers_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../d1/d11/gcd__of__n__numbers_8cpp_source.html">gcd_of_n_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   35</span>                          {</div>
 <div class="line"><span class="lineno">   36</span>  <span class="comment">// base cases</span></div>
 <div class="line"><span class="lineno">   37</span>  <span class="keywordflow">if</span> (y == 0) {</div>
@@ -288,12 +303,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   42</span>  }</div>
 <div class="line"><span class="lineno">   43</span>  <span class="keywordflow">return</span> <a class="code hl_function" href="#a509a35e11ed1e17a9e00dd56320a4181">gcd_two</a>(y, x % y); <span class="comment">// Euclidean method</span></div>
 <div class="line"><span class="lineno">   44</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph.svg" width="179" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -313,17 +323,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d11/gcd__of__n__numbers_8cpp_source.html#l00111">111</a> of file <a class="el" href="../../d1/d11/gcd__of__n__numbers_8cpp_source.html">gcd_of_n_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  111</span>           {</div>
 <div class="line"><span class="lineno">  112</span>  <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementation</span></div>
 <div class="line"><span class="lineno">  113</span>  <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  114</span>}</div>
-<div class="ttc" id="agcd__of__n__numbers_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> gcd_of_n_numbers.cpp:87</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agcd__of__n__numbers_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d11/gcd__of__n__numbers_8cpp_source.html#l00087">gcd_of_n_numbers.cpp:87</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -351,15 +358,17 @@ Here is the call graph for this function:</div>
 
 <p>Self-test implementation. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d11/gcd__of__n__numbers_8cpp_source.html#l00087">87</a> of file <a class="el" href="../../d1/d11/gcd__of__n__numbers_8cpp_source.html">gcd_of_n_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   87</span>                   {</div>
-<div class="line"><span class="lineno">   88</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, 1&gt;</a> array_1 = {0};</div>
-<div class="line"><span class="lineno">   89</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, 1&gt;</a> array_2 = {1};</div>
-<div class="line"><span class="lineno">   90</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, 2&gt;</a> array_3 = {0, 2};</div>
-<div class="line"><span class="lineno">   91</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, 3&gt;</a> array_4 = {-60, 24, 18};</div>
-<div class="line"><span class="lineno">   92</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, 4&gt;</a> array_5 = {100, -100, -100, 200};</div>
-<div class="line"><span class="lineno">   93</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, 5&gt;</a> array_6 = {0, 0, 0, 0, 0};</div>
-<div class="line"><span class="lineno">   94</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, 7&gt;</a> array_7 = {10350, -24150, 0, 17250, 37950, -127650, 51750};</div>
-<div class="line"><span class="lineno">   95</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, 7&gt;</a> array_8 = {9500000, -12121200, 0, 4444, 0, 0, 123456789};</div>
+<div class="line"><span class="lineno">   88</span>  std::array&lt;int, 1&gt; array_1 = {0};</div>
+<div class="line"><span class="lineno">   89</span>  std::array&lt;int, 1&gt; array_2 = {1};</div>
+<div class="line"><span class="lineno">   90</span>  std::array&lt;int, 2&gt; array_3 = {0, 2};</div>
+<div class="line"><span class="lineno">   91</span>  std::array&lt;int, 3&gt; array_4 = {-60, 24, 18};</div>
+<div class="line"><span class="lineno">   92</span>  std::array&lt;int, 4&gt; array_5 = {100, -100, -100, 200};</div>
+<div class="line"><span class="lineno">   93</span>  std::array&lt;int, 5&gt; array_6 = {0, 0, 0, 0, 0};</div>
+<div class="line"><span class="lineno">   94</span>  std::array&lt;int, 7&gt; array_7 = {10350, -24150, 0, 17250, 37950, -127650, 51750};</div>
+<div class="line"><span class="lineno">   95</span>  std::array&lt;int, 7&gt; array_8 = {9500000, -12121200, 0, 4444, 0, 0, 123456789};</div>
 <div class="line"><span class="lineno">   96</span> </div>
 <div class="line"><span class="lineno">   97</span>  assert(math::gcd_of_n_numbers::gcd(array_1) == -1);</div>
 <div class="line"><span class="lineno">   98</span>  assert(math::gcd_of_n_numbers::gcd(array_2) == 1);</div>
@@ -370,7 +379,6 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  103</span>  assert(math::gcd_of_n_numbers::gcd(array_7) == 3450);</div>
 <div class="line"><span class="lineno">  104</span>  assert(math::gcd_of_n_numbers::gcd(array_8) == 1);</div>
 <div class="line"><span class="lineno">  105</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph.map b/d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph.map
deleted file mode 100644
index 40848346e..000000000
--- a/d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="math::gcd_of_n_numbers::gcd" name="math::gcd_of_n_numbers::gcd">
-<area shape="rect" id="Node000001" title="Main program to compute GCD using the Euclidean algorithm." alt="" coords="5,94,203,120"/>
-<area shape="rect" id="Node000002" href="$d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a" title="Function to check if all elements in the array are 0." alt="" coords="251,29,419,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="158,91,235,72,237,77,159,96"/>
-<area shape="rect" id="Node000004" href="$d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" title=" " alt="" coords="314,94,356,120"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="203,104,298,104,298,110,203,110"/>
-<area shape="rect" id="Node000005" href="$d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181" title="Function to compute GCD of 2 numbers x and y." alt="" coords="251,168,419,209"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="144,118,262,160,260,165,142,123"/>
-<area shape="poly" id="edge3_Node000002_Node000002" title=" " alt="" coords="302,29,300,19,306,11,317,5,335,3,354,5,365,11,362,16,352,10,335,8,319,10,309,14,306,20,307,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/all_any_none_of.html#" title=" " alt="" coords="467,37,545,62"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="420,47,451,47,451,52,420,52"/>
-<area shape="poly" id="edge6_Node000005_Node000005" title=" " alt="" coords="302,168,300,158,306,149,317,143,335,141,354,144,365,150,362,155,352,149,335,147,319,149,309,153,306,159,307,167"/>
-</map>
diff --git a/d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph.md5 b/d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph.md5
deleted file mode 100644
index cc9bd2735..000000000
--- a/d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e454534349e06eb6e0e4fdb784b4affd
\ No newline at end of file
diff --git a/d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph.svg b/d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph.svg
deleted file mode 100644
index f363334aa..000000000
--- a/d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph.svg
+++ /dev/null
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::gcd_of_n_numbers::gcd Pages: 1 -->
-<svg width="413pt" height="161pt"
- viewBox="0.00 0.00 413.00 160.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 156.5)">
-<title>math::gcd_of_n_numbers::gcd</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main program to compute GCD using the Euclidean algorithm.">
-<polygon fill="#999999" stroke="#666666" points="148,-85.88 0,-85.88 0,-66.62 148,-66.62 148,-85.88"/>
-<text text-anchor="middle" x="74" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers::gcd</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a" target="_top" xlink:title="Function to check if all elements in the array are 0.">
-<polygon fill="white" stroke="#666666" points="310.25,-134.5 184,-134.5 184,-104 310.25,-104 310.25,-134.5"/>
-<text text-anchor="start" x="192" y="-121" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers</text>
-<text text-anchor="middle" x="247.12" y="-109.75" font-family="Helvetica,sans-Serif" font-size="10.00">::check_all_zeros</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.12,-86.33C132.38,-90.67 153.1,-95.88 172.92,-100.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.8,-104.18 182.35,-103.22 173.5,-97.39 171.8,-104.18"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263,-85.88 231.25,-85.88 231.25,-66.62 263,-66.62 263,-85.88"/>
-<text text-anchor="middle" x="247.12" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.07,-76.25C173.41,-76.25 200.24,-76.25 219.41,-76.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.31,-79.75 229.31,-76.25 219.31,-72.75 219.31,-79.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181" target="_top" xlink:title="Function to compute GCD of 2 numbers x and y.">
-<polygon fill="white" stroke="#666666" points="310.25,-30.5 184,-30.5 184,0 310.25,0 310.25,-30.5"/>
-<text text-anchor="start" x="192" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers</text>
-<text text-anchor="middle" x="247.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::gcd_two</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.26,-66.18C127.18,-57.65 162.18,-45.17 191.54,-34.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.4,-38.12 200.65,-31.46 190.05,-31.52 192.4,-38.12"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.35,-134.99C219.71,-144.06 227.3,-152.5 247.12,-152.5 257.97,-152.5 265.15,-149.97 268.67,-146.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.13,-146.81 269.73,-136.49 265.17,-146.05 272.13,-146.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="405,-128.88 346.25,-128.88 346.25,-109.62 405,-109.62 405,-128.88"/>
-<text text-anchor="middle" x="375.62" y="-115.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M310.63,-119.25C318.72,-119.25 326.83,-119.25 334.42,-119.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.33,-122.75 344.33,-119.25 334.33,-115.75 334.33,-122.75"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.35,-30.99C219.71,-40.06 227.3,-48.5 247.12,-48.5 257.97,-48.5 265.15,-45.97 268.67,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.13,-42.81 269.73,-32.49 265.17,-42.05 272.13,-42.81"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph_org.svg b/d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph_org.svg
deleted file mode 100644
index 0471e3581..000000000
--- a/d1/d11/gcd__of__n__numbers_8cpp_a1161713c662a14c2d5e33504f4324532_cgraph_org.svg
+++ /dev/null
@@ -1,113 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::gcd_of_n_numbers::gcd Pages: 1 -->
-<svg width="413pt" height="161pt"
- viewBox="0.00 0.00 413.00 160.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 156.5)">
-<title>math::gcd_of_n_numbers::gcd</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main program to compute GCD using the Euclidean algorithm.">
-<polygon fill="#999999" stroke="#666666" points="148,-85.88 0,-85.88 0,-66.62 148,-66.62 148,-85.88"/>
-<text text-anchor="middle" x="74" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers::gcd</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a" target="_top" xlink:title="Function to check if all elements in the array are 0.">
-<polygon fill="white" stroke="#666666" points="310.25,-134.5 184,-134.5 184,-104 310.25,-104 310.25,-134.5"/>
-<text text-anchor="start" x="192" y="-121" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers</text>
-<text text-anchor="middle" x="247.12" y="-109.75" font-family="Helvetica,sans-Serif" font-size="10.00">::check_all_zeros</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.12,-86.33C132.38,-90.67 153.1,-95.88 172.92,-100.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.8,-104.18 182.35,-103.22 173.5,-97.39 171.8,-104.18"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263,-85.88 231.25,-85.88 231.25,-66.62 263,-66.62 263,-85.88"/>
-<text text-anchor="middle" x="247.12" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.07,-76.25C173.41,-76.25 200.24,-76.25 219.41,-76.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.31,-79.75 229.31,-76.25 219.31,-72.75 219.31,-79.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181" target="_top" xlink:title="Function to compute GCD of 2 numbers x and y.">
-<polygon fill="white" stroke="#666666" points="310.25,-30.5 184,-30.5 184,0 310.25,0 310.25,-30.5"/>
-<text text-anchor="start" x="192" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers</text>
-<text text-anchor="middle" x="247.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::gcd_two</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.26,-66.18C127.18,-57.65 162.18,-45.17 191.54,-34.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.4,-38.12 200.65,-31.46 190.05,-31.52 192.4,-38.12"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.35,-134.99C219.71,-144.06 227.3,-152.5 247.12,-152.5 257.97,-152.5 265.15,-149.97 268.67,-146.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.13,-146.81 269.73,-136.49 265.17,-146.05 272.13,-146.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="405,-128.88 346.25,-128.88 346.25,-109.62 405,-109.62 405,-128.88"/>
-<text text-anchor="middle" x="375.62" y="-115.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M310.63,-119.25C318.72,-119.25 326.83,-119.25 334.42,-119.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.33,-122.75 344.33,-119.25 334.33,-115.75 334.33,-122.75"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.35,-30.99C219.71,-40.06 227.3,-48.5 247.12,-48.5 257.97,-48.5 265.15,-45.97 268.67,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.13,-42.81 269.73,-32.49 265.17,-42.05 272.13,-42.81"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph.map b/d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph.map
deleted file mode 100644
index 09a120fda..000000000
--- a/d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="math::gcd_of_n_numbers::gcd_two" name="math::gcd_of_n_numbers::gcd_two">
-<area shape="rect" id="Node000001" title="Function to compute GCD of 2 numbers x and y." alt="" coords="5,29,174,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="57,29,55,19,61,11,72,5,90,3,108,5,119,11,116,16,106,10,89,8,74,10,64,14,61,20,62,28"/>
-</map>
diff --git a/d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph.md5 b/d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph.md5
deleted file mode 100644
index 48c251a1f..000000000
--- a/d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cba8ff70dc5185b7faf5895b4158a1de
\ No newline at end of file
diff --git a/d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph.svg b/d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph.svg
deleted file mode 100644
index 961f758d5..000000000
--- a/d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::gcd_of_n_numbers::gcd_two Pages: 1 -->
-<svg width="134pt" height="57pt"
- viewBox="0.00 0.00 134.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::gcd_of_n_numbers::gcd_two</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to compute GCD of 2 numbers x and y.">
-<polygon fill="#999999" stroke="#666666" points="126.25,-30.5 0,-30.5 0,0 126.25,0 126.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers</text>
-<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::gcd_two</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.75,-30.99C36.19,-40.06 43.65,-48.5 63.12,-48.5 73.78,-48.5 80.84,-45.97 84.3,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.75,-42.81 85.34,-32.49 80.79,-42.06 87.75,-42.81"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph_org.svg b/d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph_org.svg
deleted file mode 100644
index 3a4c20776..000000000
--- a/d1/d11/gcd__of__n__numbers_8cpp_a509a35e11ed1e17a9e00dd56320a4181_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::gcd_of_n_numbers::gcd_two Pages: 1 -->
-<svg width="134pt" height="57pt"
- viewBox="0.00 0.00 134.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::gcd_of_n_numbers::gcd_two</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to compute GCD of 2 numbers x and y.">
-<polygon fill="#999999" stroke="#666666" points="126.25,-30.5 0,-30.5 0,0 126.25,0 126.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers</text>
-<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::gcd_two</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.75,-30.99C36.19,-40.06 43.65,-48.5 63.12,-48.5 73.78,-48.5 80.84,-45.97 84.3,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.75,-42.81 85.34,-32.49 80.79,-42.06 87.75,-42.81"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph.map b/d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph.map
deleted file mode 100644
index 83d873b0c..000000000
--- a/d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="math::gcd_of_n_numbers::check_all_zeros" name="math::gcd_of_n_numbers::check_all_zeros">
-<area shape="rect" id="Node000001" title="Function to check if all elements in the array are 0." alt="" coords="5,29,174,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="57,29,55,19,60,11,72,5,90,3,108,5,120,11,117,16,107,10,89,8,73,10,64,14,60,20,62,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/all_any_none_of.html#" title=" " alt="" coords="222,37,300,62"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="174,47,206,47,206,52,174,52"/>
-</map>
diff --git a/d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph.md5 b/d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph.md5
deleted file mode 100644
index c75b9fa5e..000000000
--- a/d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-390c2e580c1cd1e67189e4c5eb8d042a
\ No newline at end of file
diff --git a/d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph.svg b/d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph.svg
deleted file mode 100644
index ad135262c..000000000
--- a/d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::gcd_of_n_numbers::check_all_zeros Pages: 1 -->
-<svg width="229pt" height="57pt"
- viewBox="0.00 0.00 229.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::gcd_of_n_numbers::check_all_zeros</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to check if all elements in the array are 0.">
-<polygon fill="#999999" stroke="#666666" points="126.25,-30.5 0,-30.5 0,0 126.25,0 126.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers</text>
-<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::check_all_zeros</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.35,-30.99C35.71,-40.06 43.3,-48.5 63.12,-48.5 73.97,-48.5 81.15,-45.97 84.67,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.13,-42.81 85.73,-32.49 81.17,-42.05 88.13,-42.81"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221,-24.88 162.25,-24.88 162.25,-5.63 221,-5.63 221,-24.88"/>
-<text text-anchor="middle" x="191.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.63,-15.25C134.72,-15.25 142.83,-15.25 150.42,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.33,-18.75 160.33,-15.25 150.33,-11.75 150.33,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph_org.svg b/d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph_org.svg
deleted file mode 100644
index 51acb214a..000000000
--- a/d1/d11/gcd__of__n__numbers_8cpp_a71b9357c7a722f8208499d9ba573297a_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::gcd_of_n_numbers::check_all_zeros Pages: 1 -->
-<svg width="229pt" height="57pt"
- viewBox="0.00 0.00 229.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::gcd_of_n_numbers::check_all_zeros</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to check if all elements in the array are 0.">
-<polygon fill="#999999" stroke="#666666" points="126.25,-30.5 0,-30.5 0,0 126.25,0 126.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::gcd_of_n_numbers</text>
-<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::check_all_zeros</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.35,-30.99C35.71,-40.06 43.3,-48.5 63.12,-48.5 73.97,-48.5 81.15,-45.97 84.67,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.13,-42.81 85.73,-32.49 81.17,-42.05 88.13,-42.81"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221,-24.88 162.25,-24.88 162.25,-5.63 221,-5.63 221,-24.88"/>
-<text text-anchor="middle" x="191.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.63,-15.25C134.72,-15.25 142.83,-15.25 150.42,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.33,-18.75 160.33,-15.25 150.33,-11.75 150.33,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 91d45385f..000000000
--- a/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementation." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index fbe70326c..000000000
--- a/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c6e7f6d13bdecb1abd6b393342788302
\ No newline at end of file
diff --git a/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index f5bb0c19e..000000000
--- a/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementation.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 6bcb3b7f5..000000000
--- a/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementation.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d11/gcd__of__n__numbers_8cpp_source.html b/d1/d11/gcd__of__n__numbers_8cpp_source.html
new file mode 100644
index 000000000..ac552ca52
--- /dev/null
+++ b/d1/d11/gcd__of__n__numbers_8cpp_source.html
@@ -0,0 +1,223 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/gcd_of_n_numbers.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/d11/gcd__of__n__numbers_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">gcd_of_n_numbers.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d1/d11/gcd__of__n__numbers_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;algorithm&gt;</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;array&gt;</span>     </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/ddb/namespacegcd__of__n__numbers.html">gcd_of_n_numbers</a> {</div>
+<div class="foldopen" id="foldopen00035" data-start="{" data-end="}">
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181">   35</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181">gcd_two</a>(<span class="keywordtype">int</span> x, <span class="keywordtype">int</span> y) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>  <span class="comment">// base cases</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>  <span class="keywordflow">if</span> (y == 0) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">return</span> x;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>  }</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>  <span class="keywordflow">if</span> (x == 0) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">return</span> y;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>  }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>  <span class="keywordflow">return</span> <a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181">gcd_two</a>(y, x % y); <span class="comment">// Euclidean method</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>}</div>
+</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="keyword">template</span> &lt;std::<span class="keywordtype">size_t</span> n&gt;</div>
+<div class="foldopen" id="foldopen00053" data-start="{" data-end="}">
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a">   53</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a">check_all_zeros</a>(<span class="keyword">const</span> std::array&lt;int, n&gt; &amp;a) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>  <span class="comment">// Use std::all_of to simplify zero-checking</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>  <span class="keywordflow">return</span> std::all_of(a.begin(), a.end(), [](<span class="keywordtype">int</span> x) { return x == 0; });</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>}</div>
+</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="keyword">template</span> &lt;std::<span class="keywordtype">size_t</span> n&gt;</div>
+<div class="foldopen" id="foldopen00064" data-start="{" data-end="}">
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532">   64</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>(<span class="keyword">const</span> std::array&lt;int, n&gt; &amp;a) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>  <span class="comment">// GCD is undefined if all elements in the array are 0</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>  <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a">check_all_zeros</a>(a)) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">return</span> -1; <span class="comment">// Use std::optional to represent undefined GCD</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>  }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>  <span class="comment">// divisors can be negative, we only want the positive value</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>  <span class="keywordtype">int</span> result = std::abs(a[0]);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>  <span class="keywordflow">for</span> (std::size_t i = 1; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    result = <a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181">gcd_two</a>(result, std::abs(a[i]));</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keywordflow">if</span> (result == 1) {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>      <span class="keywordflow">break</span>; <span class="comment">// Further computations still result in gcd of 1</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    }</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>  }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>  <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>}</div>
+</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>} <span class="comment">// namespace gcd_of_n_numbers</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>} <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="foldopen" id="foldopen00087" data-start="{" data-end="}">
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"><a class="line" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   87</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>  std::array&lt;int, 1&gt; array_1 = {0};</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>  std::array&lt;int, 1&gt; array_2 = {1};</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>  std::array&lt;int, 2&gt; array_3 = {0, 2};</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>  std::array&lt;int, 3&gt; array_4 = {-60, 24, 18};</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>  std::array&lt;int, 4&gt; array_5 = {100, -100, -100, 200};</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>  std::array&lt;int, 5&gt; array_6 = {0, 0, 0, 0, 0};</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>  std::array&lt;int, 7&gt; array_7 = {10350, -24150, 0, 17250, 37950, -127650, 51750};</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>  std::array&lt;int, 7&gt; array_8 = {9500000, -12121200, 0, 4444, 0, 0, 123456789};</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>  assert(math::gcd_of_n_numbers::gcd(array_1) == -1);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>  assert(math::gcd_of_n_numbers::gcd(array_2) == 1);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>  assert(math::gcd_of_n_numbers::gcd(array_3) == 2);</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>  assert(math::gcd_of_n_numbers::gcd(array_4) == 6);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>  assert(math::gcd_of_n_numbers::gcd(array_5) == 100);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>  assert(math::gcd_of_n_numbers::gcd(array_6) == -1);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>  assert(math::gcd_of_n_numbers::gcd(array_7) == 3450);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>  assert(math::gcd_of_n_numbers::gcd(array_8) == 1);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>}</div>
+</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="foldopen" id="foldopen00111" data-start="{" data-end="}">
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"><a class="line" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  111</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>  <a class="code hl_function" href="../../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementation</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>  <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>}</div>
+</div>
+<div class="ttc" id="agcd__iterative__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/da0/gcd__iterative__euclidean_8cpp_source.html#l00015">gcd_iterative_euclidean.cpp:15</a></div></div>
+<div class="ttc" id="agcd__of__n__numbers_8cpp_html_a509a35e11ed1e17a9e00dd56320a4181"><div class="ttname"><a href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181">math::gcd_of_n_numbers::gcd_two</a></div><div class="ttdeci">int gcd_two(int x, int y)</div><div class="ttdoc">Function to compute GCD of 2 numbers x and y.</div><div class="ttdef"><b>Definition</b> <a href="#l00035">gcd_of_n_numbers.cpp:35</a></div></div>
+<div class="ttc" id="agcd__of__n__numbers_8cpp_html_a71b9357c7a722f8208499d9ba573297a"><div class="ttname"><a href="../../d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a">math::gcd_of_n_numbers::check_all_zeros</a></div><div class="ttdeci">bool check_all_zeros(const std::array&lt; int, n &gt; &amp;a)</div><div class="ttdoc">Function to check if all elements in the array are 0.</div><div class="ttdef"><b>Definition</b> <a href="#l00053">gcd_of_n_numbers.cpp:53</a></div></div>
+<div class="ttc" id="agcd__of__n__numbers_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> <a href="#l00087">gcd_of_n_numbers.cpp:87</a></div></div>
+<div class="ttc" id="agcd__of__n__numbers_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00111">gcd_of_n_numbers.cpp:111</a></div></div>
+<div class="ttc" id="anamespacegcd__of__n__numbers_html"><div class="ttname"><a href="../../d2/ddb/namespacegcd__of__n__numbers.html">gcd_of_n_numbers</a></div><div class="ttdoc">Compute GCD of numbers in an array.</div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d1/d11/gcd__of__n__numbers_8cpp.html">gcd_of_n_numbers.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/d12/tree_8cpp_source.html b/d1/d12/tree_8cpp_source.html
new file mode 100644
index 000000000..26581468a
--- /dev/null
+++ b/d1/d12/tree_8cpp_source.html
@@ -0,0 +1,259 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/tree.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/d12/tree_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">tree.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;list&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> {</div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span>    <span class="keywordtype">int</span> val;</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *left;</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *right;</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>};</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="keywordtype">void</span> CreateTree(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *curr, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n, <span class="keywordtype">int</span> x, <span class="keywordtype">char</span> pos) {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="keywordflow">if</span> (n != NULL) {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>        <span class="keywordtype">char</span> ch;</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nLeft or Right of &quot;</span> &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot; : &quot;</span>;</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>        cin &gt;&gt; ch;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>        <span class="keywordflow">if</span> (ch == <span class="charliteral">&#39;l&#39;</span>)</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>            CreateTree(n, n-&gt;left, x, ch);</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ch == <span class="charliteral">&#39;r&#39;</span>)</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>            CreateTree(n, n-&gt;right, x, ch);</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        t-&gt;val = x;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        t-&gt;left = NULL;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        t-&gt;right = NULL;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        <span class="keywordflow">if</span> (pos == <span class="charliteral">&#39;l&#39;</span>) {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>            curr-&gt;left = t;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (pos == <span class="charliteral">&#39;r&#39;</span>) {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>            curr-&gt;right = t;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>        }</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    }</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>}</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keywordtype">void</span> BFT(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    list&lt;node *&gt; queue;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    queue.push_back(n);</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">while</span> (!queue.empty()) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        n = queue.front();</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        queue.pop_front();</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="keywordflow">if</span> (n-&gt;left != NULL)</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>            queue.push_back(n-&gt;left);</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="keywordflow">if</span> (n-&gt;right != NULL)</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            queue.push_back(n-&gt;right);</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>}</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="keywordtype">void</span> Pre(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordflow">if</span> (n != NULL) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        Pre(n-&gt;left);</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        Pre(n-&gt;right);</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>}</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="keywordtype">void</span> In(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">if</span> (n != NULL) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        In(n-&gt;left);</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        In(n-&gt;right);</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>}</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="keywordtype">void</span> Post(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">if</span> (n != NULL) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        Post(n-&gt;left);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        Post(n-&gt;right);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>}</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="keywordtype">int</span> value;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keywordtype">int</span> ch;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *root = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the value of root node :&quot;</span>;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    cin &gt;&gt; value;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    root-&gt;val = value;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    root-&gt;left = NULL;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    root-&gt;right = NULL;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n1. Insert&quot;</span>;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n2. Breadth First&quot;</span>;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n3. Preorder Depth First&quot;</span>;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n4. Inorder Depth First&quot;</span>;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n5. Postorder Depth First&quot;</span>;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nEnter Your Choice : &quot;</span>;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        cin &gt;&gt; ch;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        <span class="keywordflow">switch</span> (ch) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        <span class="keywordflow">case</span> 1:</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>            <span class="keywordtype">int</span> x;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>            <span class="keywordtype">char</span> pos;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the value to be Inserted : &quot;</span>;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            cin &gt;&gt; x;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>            cout &lt;&lt; <span class="stringliteral">&quot;\nLeft or Right of Root : &quot;</span>;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>            cin &gt;&gt; pos;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>            <span class="keywordflow">if</span> (pos == <span class="charliteral">&#39;l&#39;</span>)</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>                CreateTree(root, root-&gt;left, x, pos);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (pos == <span class="charliteral">&#39;r&#39;</span>)</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>                CreateTree(root, root-&gt;right, x, pos);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        <span class="keywordflow">case</span> 2:</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>            BFT(root);</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <span class="keywordflow">case</span> 3:</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            Pre(root);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        <span class="keywordflow">case</span> 4:</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>            In(root);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        <span class="keywordflow">case</span> 5:</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>            Post(root);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        }</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    } <span class="keywordflow">while</span> (ch != 0);</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>}</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><b>tree.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.map b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.map
index 24d6af31d..cc8f995f8 100644
--- a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.map
+++ b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.map
@@ -1,6 +1,6 @@
 <map id="data_structures::linked_list::list" name="data_structures::linked_list::list">
 <area shape="rect" id="Node000001" title=" " alt="" coords="246,91,399,131"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="6,8,158,64"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="6,8,158,64"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="167,67,183,73,246,91,244,96,182,78,165,72"/>
 <area shape="rect" id="Node000003" href="$de/d9d/classdata__structures_1_1linked__list_1_1link.html" title=" " alt="" coords="246,5,399,46"/>
 <area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="174,38,222,37,245,35,245,40,222,42,174,43"/>
diff --git a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.md5 b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.md5
index 54bff9c2a..1f4cfa6a7 100644
--- a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.md5
+++ b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.md5
@@ -1 +1 @@
-128effd11a49ab28934b9dd590c0e24a
\ No newline at end of file
+cca7b544b540dc73d15c503e2e631eff
\ No newline at end of file
diff --git a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.svg b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.svg
index 3e4e1c396..225990541 100644
--- a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.svg
+++ b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph.svg
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="114.62,-119.12 0.37,-119.12 0.37,-77.38 114.62,-77.38 114.62,-119.12"/>
 <text text-anchor="start" x="8.38" y="-105.62" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; data</text>
 <text text-anchor="start" x="8.38" y="-94.38" font-family="Helvetica,sans-Serif" font-size="10.00">_structures::linked_list</text>
diff --git a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph_org.svg b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph_org.svg
index ca3be96fb..bd1524235 100644
--- a/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph_org.svg
+++ b/d1/d15/classdata__structures_1_1linked__list_1_1list__coll__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="114.62,-119.12 0.37,-119.12 0.37,-77.38 114.62,-77.38 114.62,-119.12"/>
 <text text-anchor="start" x="8.38" y="-105.62" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; data</text>
 <text text-anchor="start" x="8.38" y="-94.38" font-family="Helvetica,sans-Serif" font-size="10.00">_structures::linked_list</text>
diff --git a/d1/d1b/topological__sort__by__kahns__algo_8cpp_source.html b/d1/d1b/topological__sort__by__kahns__algo_8cpp_source.html
new file mode 100644
index 000000000..6f597b867
--- /dev/null
+++ b/d1/d1b/topological__sort__by__kahns__algo_8cpp_source.html
@@ -0,0 +1,207 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/topological_sort_by_kahns_algo.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/d1b/topological__sort__by__kahns__algo_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">topological_sort_by_kahns_algo.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;cstdio&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include &lt;queue&gt;</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span> </div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span>std::vector&lt;int&gt; topoSortKahn(<span class="keywordtype">int</span> N, <span class="keyword">const</span> std::vector&lt;std::vector&lt;int&gt; &gt; &amp;adj);</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    <span class="keywordtype">int</span> nodes = 0, edges = 0;</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    std::cin &gt;&gt; edges &gt;&gt; nodes;</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="keywordflow">if</span> (edges == 0 || nodes == 0) {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    }</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="keywordtype">int</span> u = 0, v = 0;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    std::vector&lt;std::vector&lt;int&gt; &gt; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>(nodes);</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="comment">// create graph</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    <span class="comment">// example</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="comment">// 6 6</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="comment">// 5 0 5 2 2 3 4 0 4 1 1 3</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; edges; i++) {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        std::cin &gt;&gt; u &gt;&gt; v;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[u].push_back(v);</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    }</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    std::vector&lt;int&gt; topo = topoSortKahn(nodes, <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>);</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="comment">// topologically sorted nodes</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; nodes; i++) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        std::cout &lt;&lt; topo[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    }</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>}</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>std::vector&lt;int&gt; topoSortKahn(<span class="keywordtype">int</span> V,</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>                              <span class="keyword">const</span> std::vector&lt;std::vector&lt;int&gt; &gt; &amp;adj) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    std::vector&lt;bool&gt; vis(V + 1, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    std::vector&lt;int&gt; deg(V + 1, 0);</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j : adj[i]) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>            deg[j]++;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    std::queue&lt;int&gt; q;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">if</span> (deg[i] == 0) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            q.push(i);</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            vis[i] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    std::vector&lt;int&gt; arr(V + 1, 0);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordtype">int</span> count = 0;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">while</span> (!q.empty()) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <span class="keywordtype">int</span> cur = q.front();</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        q.pop();</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        arr[count++] = cur;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : adj[cur]) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>            <span class="keywordflow">if</span> (!vis[i]) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>                deg[i]--;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>                <span class="keywordflow">if</span> (deg[i] == 0) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>                    q.push(i);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>                    vis[i] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>                }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">return</span> arr;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></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><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><b>topological_sort_by_kahns_algo.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/d1c/base64__encoding_8cpp_source.html b/d1/d1c/base64__encoding_8cpp_source.html
new file mode 100644
index 000000000..2489bc869
--- /dev/null
+++ b/d1/d1c/base64__encoding_8cpp_source.html
@@ -0,0 +1,289 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: ciphers/base64_encoding.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/d1c/base64__encoding_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">base64_encoding.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;array&gt;</span>     </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/d4e/namespaceciphers.html">ciphers</a> {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/dc9/namespacebase64__encoding.html">base64_encoding</a> {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment">// chars denoting the format for encoding and decoding array.</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="comment">// This array is already decided by</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="comment">// [RFC4648](https://tools.ietf.org/html/rfc4648#section-4) standard</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">const</span> std::string chars =</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="stringliteral">&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/&quot;</span>;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>std::string base64_encode(<span class="keyword">const</span> std::string &amp;input) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    std::string base64_string;  </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="comment">// base64 deals with 6-bit chars encoded as per chars, so</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="comment">// we will always filter 6-bits from input.</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; input.size(); i += 3) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordtype">char</span> first_byte = input[i];  </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="comment">// Take first six bits of first character.</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="comment">// Encode the first six bits with character defined in string `chars`</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        base64_string.push_back(chars[first_byte &gt;&gt; 2]);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        <span class="keywordflow">if</span> (i + 1 &lt; input.size()) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            <span class="keywordtype">char</span> second_byte = input[i + 1];  </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            <span class="comment">// Take remaining two bits of first character, and four first bits</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            <span class="comment">// from second character Combine two numbers as 6-bit digits and</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            <span class="comment">// encode by array chars (first two bits of first byte and next four</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            <span class="comment">// of second byte)</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            base64_string.push_back(</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>                chars[(((first_byte &amp; 3) &lt;&lt; 4) | ((second_byte &amp; 0xF0) &gt;&gt; 4))]);</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            <span class="keywordflow">if</span> (i + 2 &lt; input.size()) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>                <span class="keywordtype">char</span> third_byte = input[i + 2];  </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>                <span class="comment">// Take remaining four bits of second character, and first two</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>                <span class="comment">// bits from third character Combine two numbers as 6-bit digits</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>                <span class="comment">// and encode by array chars (remaining four bits of second byte</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>                <span class="comment">// and first two of third byte)</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>                base64_string.push_back(chars[((third_byte &amp; 0xC0) &gt;&gt; 6) |</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>                                              ((second_byte &amp; 0x0F) &lt;&lt; 2)]);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                <span class="comment">// Encode remaining 6-bit of third byte by array chars</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>                base64_string.push_back(chars[(third_byte &amp; 0x3F)]);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>                <span class="comment">// Take remaining four bits of second character as 6-bit number</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>                base64_string.push_back(chars[((second_byte &amp; 0x0F) &lt;&lt; 2)]);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>                base64_string.push_back(<span class="charliteral">&#39;=&#39;</span>);  <span class="comment">// padding characters</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            }</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>            <span class="comment">// Take remaining two bits of first character as 6-bit number</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            base64_string.push_back(chars[((first_byte &amp; 3) &lt;&lt; 4)]);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            base64_string.push_back(<span class="charliteral">&#39;=&#39;</span>);  <span class="comment">// padding characters</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            base64_string.push_back(<span class="charliteral">&#39;=&#39;</span>);  <span class="comment">// padding characters</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        }</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    }</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">return</span> base64_string;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>}</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>uint8_t find_idx(<span class="keyword">const</span> <span class="keywordtype">char</span> c) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keywordflow">if</span> (c &gt;= <span class="charliteral">&#39;A&#39;</span> &amp;&amp; c &lt;= <span class="charliteral">&#39;Z&#39;</span>) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        <span class="keywordflow">return</span> c - <span class="charliteral">&#39;A&#39;</span>;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c &gt;= <span class="charliteral">&#39;a&#39;</span> &amp;&amp; c &lt;= <span class="charliteral">&#39;z&#39;</span>) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        <span class="keywordflow">return</span> c - <span class="charliteral">&#39;a&#39;</span> + 26;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c &gt;= <span class="charliteral">&#39;0&#39;</span> &amp;&amp; c &lt;= <span class="charliteral">&#39;9&#39;</span>) {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        <span class="keywordflow">return</span> c - <span class="charliteral">&#39;0&#39;</span> + 52;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c == <span class="charliteral">&#39;+&#39;</span>) {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        <span class="keywordflow">return</span> 62;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (c == <span class="charliteral">&#39;/&#39;</span>) {</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        <span class="keywordflow">return</span> 63;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    }</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>}</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>std::string base64_decode(<span class="keyword">const</span> std::string &amp;base64_str) {</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    std::string</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        base64_decoded;  </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; base64_str.size(); i += 4) {</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        <span class="keywordtype">char</span> first_byte = base64_str[i];</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        <span class="keywordtype">char</span> second_byte = base64_str[i + 1];</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>        <span class="comment">// Actual str characters are of 8 bits (or 1 byte):</span></div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        <span class="comment">// :: 8 bits are decode by taking 6 bits from 1st byte of base64 string</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        <span class="comment">// and first 2 bits from 2nd byte of base64 string.</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        <span class="keywordtype">char</span> first_actual_byte = <span class="keyword">static_cast&lt;</span><span class="keywordtype">char</span><span class="keyword">&gt;</span>(</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>            (find_idx(first_byte) &lt;&lt; 2) | ((find_idx(second_byte)) &gt;&gt; 4));</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        base64_decoded.push_back(first_actual_byte);</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        <span class="keywordflow">if</span> (i + 2 &lt; base64_str.size() &amp;&amp; base64_str[i + 2] != <span class="charliteral">&#39;=&#39;</span>) {</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>            <span class="keywordtype">char</span> third_byte = base64_str[i + 2];</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>            <span class="comment">// :: Next 8 bits are decode by taking remaining 4 bits from 2nd</span></div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>            <span class="comment">// byte of base64 string and first 4 bits from 3rd byte of base64</span></div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>            <span class="comment">// string.</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>            <span class="keywordtype">char</span> second_actual_byte =</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>                <span class="keyword">static_cast&lt;</span><span class="keywordtype">char</span><span class="keyword">&gt;</span>(((find_idx(second_byte) &amp; 0x0F) &lt;&lt; 4) |</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>                                  (find_idx(third_byte) &gt;&gt; 2));</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>            base64_decoded.push_back(second_actual_byte);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span> </div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>            <span class="keywordflow">if</span> (i + 3 &lt; base64_str.size() &amp;&amp; base64_str[i + 3] != <span class="charliteral">&#39;=&#39;</span>) {</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>                <span class="keywordtype">char</span> fourth_byte = base64_str[i + 3];</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>                <span class="comment">// :: Taking remaining 2 bits from 3rd byte of base64 string</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>                <span class="comment">// and all 6 bits from 4th byte of base64 string.</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>                <span class="keywordtype">char</span> third_actual_byte =</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>                    <span class="keyword">static_cast&lt;</span><span class="keywordtype">char</span><span class="keyword">&gt;</span>(((find_idx(third_byte) &amp; 0x03) &lt;&lt; 6) |</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>                                      find_idx(fourth_byte));</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>                base64_decoded.push_back(third_actual_byte);</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>            }</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        }</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    }</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    <span class="keywordflow">return</span> base64_decoded;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>}</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>}  <span class="comment">// namespace base64_encoding</span></div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>}  <span class="comment">// namespace ciphers</span></div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span> </div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span><span class="keyword">static</span> <span class="keywordtype">void</span> test() {</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    <span class="comment">// 1st Test</span></div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    std::string str =</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>        <span class="stringliteral">&quot;To err is human, but to really foul things up you need a computer.&quot;</span>;</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    std::string base64_str = ciphers::base64_encoding::base64_encode(str);</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    std::string verify =</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        <span class="stringliteral">&quot;VG8gZXJyIGlzIGh1bWFuLCBidXQgdG8gcmVhbGx5IGZvdWwgdGhpbmdzIHVwIHlvdSBuZW&quot;</span></div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>        <span class="stringliteral">&quot;VkIGEgY29tcHV0ZXIu&quot;</span>;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    <span class="comment">// verify encoding</span></div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    assert(base64_str == verify);</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    std::string original_str =</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        ciphers::base64_encoding::base64_decode(base64_str);</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    <span class="comment">// verify decoding</span></div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    assert(original_str == str);</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span> </div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <span class="comment">// 2nd Test from [Wikipedia](https://en.wikipedia.org/wiki/Base64)</span></div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    str =</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        <span class="stringliteral">&quot;Man is distinguished, not only by his reason, but by this singular &quot;</span></div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        <span class="stringliteral">&quot;passion from other animals, which is a lust of the mind, that by a &quot;</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        <span class="stringliteral">&quot;perseverance of delight in the continued and indefatigable generation &quot;</span></div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        <span class="stringliteral">&quot;of knowledge, exceeds the short vehemence of any carnal pleasure.&quot;</span>;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    base64_str = ciphers::base64_encoding::base64_encode(str);</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    verify =</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>        <span class="stringliteral">&quot;TWFuIGlzIGRpc3Rpbmd1aXNoZWQsIG5vdCBvbmx5IGJ5IGhpcyByZWFzb24sIGJ1dCBieS&quot;</span></div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>        <span class="stringliteral">&quot;B0aGlzIHNpbmd1bGFyIHBhc3Npb24gZnJvbSBvdGhlciBhbmltYWxzLCB3aGljaCBpcyBh&quot;</span></div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>        <span class="stringliteral">&quot;IGx1c3Qgb2YgdGhlIG1pbmQsIHRoYXQgYnkgYSBwZXJzZXZlcmFuY2Ugb2YgZGVsaWdodC&quot;</span></div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>        <span class="stringliteral">&quot;BpbiB0aGUgY29udGludWVkIGFuZCBpbmRlZmF0aWdhYmxlIGdlbmVyYXRpb24gb2Yga25v&quot;</span></div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        <span class="stringliteral">&quot;d2xlZGdlLCBleGNlZWRzIHRoZSBzaG9ydCB2ZWhlbWVuY2Ugb2YgYW55IGNhcm5hbCBwbG&quot;</span></div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        <span class="stringliteral">&quot;Vhc3VyZS4=&quot;</span>;</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    <span class="comment">// verify encoding</span></div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    assert(base64_str == verify);</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    original_str = ciphers::base64_encoding::base64_decode(base64_str);</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    <span class="comment">// verify decoding</span></div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    assert(original_str == str);</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>}</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span> </div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    test();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacebase64__encoding_html"><div class="ttname"><a href="../../d9/dc9/namespacebase64__encoding.html">base64_encoding</a></div><div class="ttdoc">Functions for Base64 Encoding and Decoding implementation.</div></div>
+<div class="ttc" id="anamespaceciphers_html"><div class="ttname"><a href="../../d6/d4e/namespaceciphers.html">ciphers</a></div><div class="ttdoc">Algorithms for encryption and decryption.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_4d6e05837bf820fb089a8a8cdf2f42b7.html">ciphers</a></li><li class="navelem"><b>base64_encoding.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/d1d/class_graph-members.html b/d1/d1d/class_graph-members.html
index 3f24de465..3324ca027 100644
--- a/d1/d1d/class_graph-members.html
+++ b/d1/d1d/class_graph-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d1/d1e/classoperations__on__datastructures_1_1trie__operations_1_1_tnode-members.html b/d1/d1e/classoperations__on__datastructures_1_1trie__operations_1_1_tnode-members.html
index 303a5355f..e88bce5f3 100644
--- a/d1/d1e/classoperations__on__datastructures_1_1trie__operations_1_1_tnode-members.html
+++ b/d1/d1e/classoperations__on__datastructures_1_1trie__operations_1_1_tnode-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d1/d21/quick__sort_8cpp.html b/d1/d21/quick__sort_8cpp.html
index d9498c525..ceac6e54a 100644
--- a/d1/d21/quick__sort_8cpp.html
+++ b/d1/d21/quick__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/quick_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/quick_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for quick_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../de/db2/quick__sort_8cpp__incl.svg" width="512" height="111"><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">
+</div>
+<p><a href="../../d1/d21/quick__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -137,19 +156,19 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a1b2a2cc2d319240f3b65c5b2f479ed82" id="r_a1b2a2cc2d319240f3b65c5b2f479ed82"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a1b2a2cc2d319240f3b65c5b2f479ed82"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a1b2a2cc2d319240f3b65c5b2f479ed82">sorting::quick_sort::partition</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *arr, const int &amp;low, const int &amp;high)</td></tr>
+<tr class="memitem:a1b2a2cc2d319240f3b65c5b2f479ed82"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a1b2a2cc2d319240f3b65c5b2f479ed82">sorting::quick_sort::partition</a> (std::vector&lt; T &gt; *arr, const int &amp;low, const int &amp;high)</td></tr>
 <tr class="memdesc:a1b2a2cc2d319240f3b65c5b2f479ed82"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sorts the array taking the last element as pivot.  <br /></td></tr>
 <tr class="separator:a1b2a2cc2d319240f3b65c5b2f479ed82"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a5e6213e8008356ac6eda9427f3f4b394" id="r_a5e6213e8008356ac6eda9427f3f4b394"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a5e6213e8008356ac6eda9427f3f4b394"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *arr, const int &amp;low, const int &amp;high)</td></tr>
+<tr class="memitem:a5e6213e8008356ac6eda9427f3f4b394"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a> (std::vector&lt; T &gt; *arr, const int &amp;low, const int &amp;high)</td></tr>
 <tr class="memdesc:a5e6213e8008356ac6eda9427f3f4b394"><td class="mdescLeft">&#160;</td><td class="mdescRight">the main function that implements Quick Sort.  <br /></td></tr>
 <tr class="separator:a5e6213e8008356ac6eda9427f3f4b394"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a53adad7e4d83e1495df25fe8dbb4cc05" id="r_a53adad7e4d83e1495df25fe8dbb4cc05"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a53adad7e4d83e1495df25fe8dbb4cc05"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a53adad7e4d83e1495df25fe8dbb4cc05">sorting::quick_sort::quick_sort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; arr, const int &amp;low, const int &amp;high)</td></tr>
+<tr class="memitem:a53adad7e4d83e1495df25fe8dbb4cc05"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a53adad7e4d83e1495df25fe8dbb4cc05">sorting::quick_sort::quick_sort</a> (std::vector&lt; T &gt; arr, const int &amp;low, const int &amp;high)</td></tr>
 <tr class="memdesc:a53adad7e4d83e1495df25fe8dbb4cc05"><td class="mdescLeft">&#160;</td><td class="mdescRight">the main function that implements Quick Sort.  <br /></td></tr>
 <tr class="separator:a53adad7e4d83e1495df25fe8dbb4cc05"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aeccefcf6fcca62c54939c5ec9a93109b" id="r_aeccefcf6fcca62c54939c5ec9a93109b"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:aeccefcf6fcca62c54939c5ec9a93109b"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;arr, const int &amp;size)</td></tr>
+<tr class="memitem:aeccefcf6fcca62c54939c5ec9a93109b"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a> (const std::vector&lt; T &gt; &amp;arr, const int &amp;size)</td></tr>
 <tr class="memdesc:aeccefcf6fcca62c54939c5ec9a93109b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to print the array contents.  <br /></td></tr>
 <tr class="separator:aeccefcf6fcca62c54939c5ec9a93109b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
@@ -174,6 +193,8 @@ Functions</h2></td></tr>
 </pre><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd>
 <dd>
 <a href="https://github.com/popoapp" target="_blank">popoapp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html">quick_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -192,58 +213,50 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html#l00202">202</a> of file <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html">quick_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  202</span>           {</div>
 <div class="line"><span class="lineno">  203</span>    <span class="keywordtype">int</span> choice = 0;</div>
 <div class="line"><span class="lineno">  204</span> </div>
-<div class="line"><span class="lineno">  205</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tAvailable modes\t\n\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  206</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1. Self-tests mode\n2. Interactive mode&quot;</span>;</div>
+<div class="line"><span class="lineno">  205</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tAvailable modes\t\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  206</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1. Self-tests mode\n2. Interactive mode&quot;</span>;</div>
 <div class="line"><span class="lineno">  207</span> </div>
-<div class="line"><span class="lineno">  208</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nChoose a mode: &quot;</span>;</div>
-<div class="line"><span class="lineno">  209</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; choice;</div>
-<div class="line"><span class="lineno">  210</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  208</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nChoose a mode: &quot;</span>;</div>
+<div class="line"><span class="lineno">  209</span>    std::cin &gt;&gt; choice;</div>
+<div class="line"><span class="lineno">  210</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  211</span> </div>
 <div class="line"><span class="lineno">  212</span>    <span class="keywordflow">while</span> ((choice != 1) &amp;&amp; (choice != 2)) {</div>
-<div class="line"><span class="lineno">  213</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Invalid option. Choose between the valid modes: &quot;</span>;</div>
-<div class="line"><span class="lineno">  214</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; choice;</div>
+<div class="line"><span class="lineno">  213</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Invalid option. Choose between the valid modes: &quot;</span>;</div>
+<div class="line"><span class="lineno">  214</span>        std::cin &gt;&gt; choice;</div>
 <div class="line"><span class="lineno">  215</span>    }</div>
 <div class="line"><span class="lineno">  216</span> </div>
 <div class="line"><span class="lineno">  217</span>    <span class="keywordflow">if</span> (choice == 1) {</div>
-<div class="line"><span class="lineno">  218</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>));</div>
+<div class="line"><span class="lineno">  218</span>        std::srand(std::time(<span class="keyword">nullptr</span>));</div>
 <div class="line"><span class="lineno">  219</span>        <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  220</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (choice == 2) {</div>
 <div class="line"><span class="lineno">  221</span>        <span class="keywordtype">int</span> size = 0;</div>
-<div class="line"><span class="lineno">  222</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter the number of elements: &quot;</span>;</div>
+<div class="line"><span class="lineno">  222</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the number of elements: &quot;</span>;</div>
 <div class="line"><span class="lineno">  223</span> </div>
-<div class="line"><span class="lineno">  224</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; size;</div>
-<div class="line"><span class="lineno">  225</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> arr(size);</div>
+<div class="line"><span class="lineno">  224</span>        std::cin &gt;&gt; size;</div>
+<div class="line"><span class="lineno">  225</span>        std::vector&lt;float&gt; arr(size);</div>
 <div class="line"><span class="lineno">  226</span> </div>
-<div class="line"><span class="lineno">  227</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div>
+<div class="line"><span class="lineno">  227</span>        std::cout</div>
 <div class="line"><span class="lineno">  228</span>            &lt;&lt; <span class="stringliteral">&quot;\nEnter the unsorted elements (can be negative/decimal): &quot;</span>;</div>
 <div class="line"><span class="lineno">  229</span> </div>
 <div class="line"><span class="lineno">  230</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
-<div class="line"><span class="lineno">  231</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  232</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; arr[i];</div>
+<div class="line"><span class="lineno">  231</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  232</span>            std::cin &gt;&gt; arr[i];</div>
 <div class="line"><span class="lineno">  233</span>        }</div>
 <div class="line"><span class="lineno">  234</span>        <a class="code hl_function" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a>(&amp;arr, 0, size - 1);</div>
-<div class="line"><span class="lineno">  235</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nSorted array: \n&quot;</span>;</div>
+<div class="line"><span class="lineno">  235</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nSorted array: \n&quot;</span>;</div>
 <div class="line"><span class="lineno">  236</span>        <a class="code hl_function" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a>(arr, size);</div>
 <div class="line"><span class="lineno">  237</span>    }</div>
 <div class="line"><span class="lineno">  238</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  239</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="aquick__sort_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> quick_sort.cpp:136</div></div>
-<div class="ttc" id="aquick__sort_8cpp_html_a5e6213e8008356ac6eda9427f3f4b394"><div class="ttname"><a href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a></div><div class="ttdeci">void quick_sort(std::vector&lt; T &gt; *arr, const int &amp;low, const int &amp;high)</div><div class="ttdoc">the main function that implements Quick Sort.</div><div class="ttdef"><b>Definition</b> quick_sort.cpp:87</div></div>
-<div class="ttc" id="aquick__sort_8cpp_html_aeccefcf6fcca62c54939c5ec9a93109b"><div class="ttname"><a href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a></div><div class="ttdeci">void show(const std::vector&lt; T &gt; &amp;arr, const int &amp;size)</div><div class="ttdoc">Utility function to print the array contents.</div><div class="ttdef"><b>Definition</b> quick_sort.cpp:124</div></div>
-<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="336" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aquick__sort_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d21/quick__sort_8cpp_source.html#l00136">quick_sort.cpp:136</a></div></div>
+<div class="ttc" id="aquick__sort_8cpp_html_a5e6213e8008356ac6eda9427f3f4b394"><div class="ttname"><a href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a></div><div class="ttdeci">void quick_sort(std::vector&lt; T &gt; *arr, const int &amp;low, const int &amp;high)</div><div class="ttdoc">the main function that implements Quick Sort.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d21/quick__sort_8cpp_source.html#l00087">quick_sort.cpp:87</a></div></div>
+<div class="ttc" id="aquick__sort_8cpp_html_aeccefcf6fcca62c54939c5ec9a93109b"><div class="ttname"><a href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a></div><div class="ttdeci">void show(const std::vector&lt; T &gt; &amp;arr, const int &amp;size)</div><div class="ttdoc">Utility function to print the array contents.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d21/quick__sort_8cpp_source.html#l00124">quick_sort.cpp:124</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1b2a2cc2d319240f3b65c5b2f479ed82" name="a1b2a2cc2d319240f3b65c5b2f479ed82"></a>
@@ -257,7 +270,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">int sorting::quick_sort::partition </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
+          <td class="paramtype">std::vector&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -288,6 +301,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>index of the smaller element </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html">quick_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   59</span>                                                                  {</div>
 <div class="line"><span class="lineno">   60</span>    T pivot = (*arr)[high];  <span class="comment">// taking the last element as pivot</span></div>
 <div class="line"><span class="lineno">   61</span>    <span class="keywordtype">int</span> i = (low - 1);       <span class="comment">// Index of smaller element</span></div>
@@ -297,20 +312,14 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   65</span>        <span class="comment">// equal to pivot</span></div>
 <div class="line"><span class="lineno">   66</span>        <span class="keywordflow">if</span> ((*arr)[j] &lt;= pivot) {</div>
 <div class="line"><span class="lineno">   67</span>            i++;  <span class="comment">// increment index of smaller element</span></div>
-<div class="line"><span class="lineno">   68</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>((*arr)[i], (*arr)[j]);</div>
+<div class="line"><span class="lineno">   68</span>            std::swap((*arr)[i], (*arr)[j]);</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>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>((*arr)[i + 1], (*arr)[high]);</div>
+<div class="line"><span class="lineno">   72</span>    std::swap((*arr)[i + 1], (*arr)[high]);</div>
 <div class="line"><span class="lineno">   73</span>    <span class="keywordflow">return</span> (i + 1);</div>
 <div class="line"><span class="lineno">   74</span>}</div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- 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="../../d1/d21/quick__sort_8cpp_a1b2a2cc2d319240f3b65c5b2f479ed82_cgraph.svg" width="266" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5e6213e8008356ac6eda9427f3f4b394" name="a5e6213e8008356ac6eda9427f3f4b394"></a>
@@ -324,7 +333,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void sorting::quick_sort::quick_sort </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
+          <td class="paramtype">std::vector&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -354,16 +363,17 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html#l00087">87</a> of file <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html">quick_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   87</span>                                                                    {</div>
 <div class="line"><span class="lineno">   88</span>    <span class="keywordflow">if</span> (low &lt; high) {</div>
-<div class="line"><span class="lineno">   89</span>        <span class="keywordtype">int</span> p = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/partition.html">partition</a>(arr, low, high);</div>
+<div class="line"><span class="lineno">   89</span>        <span class="keywordtype">int</span> p = partition(arr, low, high);</div>
 <div class="line"><span class="lineno">   90</span> </div>
 <div class="line"><span class="lineno">   91</span>        <a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a>(arr, low, p - 1);</div>
 <div class="line"><span class="lineno">   92</span>        <a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a>(arr, p + 1, high);</div>
 <div class="line"><span class="lineno">   93</span>    }</div>
 <div class="line"><span class="lineno">   94</span>}</div>
 <div class="ttc" id="anamespacequick__sort_html"><div class="ttname"><a href="../../d0/d2b/namespacequick__sort.html">quick_sort</a></div><div class="ttdoc">Functions for the Quick sort implementation in C++.</div></div>
-<div class="ttc" id="apartition_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/partition.html">std::partition</a></div><div class="ttdeci">T partition(T... args)</div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -376,9 +386,9 @@ template&lt;typename T &gt; </div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; sorting::quick_sort::quick_sort </td>
+          <td class="memname">std::vector&lt; T &gt; sorting::quick_sort::quick_sort </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
+          <td class="paramtype">std::vector&lt; T &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -408,9 +418,11 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html">quick_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  107</span>                                                                           {</div>
 <div class="line"><span class="lineno">  108</span>    <span class="keywordflow">if</span> (low &lt; high) {</div>
-<div class="line"><span class="lineno">  109</span>        <span class="keywordtype">int</span> p = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/partition.html">partition</a>(&amp;arr, low, high);</div>
+<div class="line"><span class="lineno">  109</span>        <span class="keywordtype">int</span> p = partition(&amp;arr, low, high);</div>
 <div class="line"><span class="lineno">  110</span> </div>
 <div class="line"><span class="lineno">  111</span>        <a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a>(&amp;arr, low, p - 1);</div>
 <div class="line"><span class="lineno">  112</span>        <a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a>(&amp;arr, p + 1, high);</div>
@@ -431,7 +443,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void sorting::quick_sort::show </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -450,9 +462,11 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html#l00124">124</a> of file <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html">quick_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  124</span>                                                    {</div>
-<div class="line"><span class="lineno">  125</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
-<div class="line"><span class="lineno">  126</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  125</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  126</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  127</span>}</div>
 </div><!-- fragment -->
 </div>
@@ -482,78 +496,70 @@ template&lt;typename T &gt; </div>
 
 <p>Self-test implementations. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html#l00136">136</a> of file <a class="el" href="../../d1/d21/quick__sort_8cpp_source.html">quick_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  136</span>                    {</div>
 <div class="line"><span class="lineno">  137</span>    <span class="comment">// 1st test (normal numbers)</span></div>
-<div class="line"><span class="lineno">  138</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> arr = {5, 3, 8, 12, 14, 16, 28, 96, 2, 5977};</div>
-<div class="line"><span class="lineno">  139</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> arr_sorted = <a class="code hl_function" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a>(</div>
-<div class="line"><span class="lineno">  140</span>        arr, 0, <span class="keywordtype">int</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr)) - 1);</div>
+<div class="line"><span class="lineno">  138</span>    std::vector&lt;uint64_t&gt; arr = {5, 3, 8, 12, 14, 16, 28, 96, 2, 5977};</div>
+<div class="line"><span class="lineno">  139</span>    std::vector&lt;uint64_t&gt; arr_sorted = <a class="code hl_function" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a>(</div>
+<div class="line"><span class="lineno">  140</span>        arr, 0, <span class="keywordtype">int</span>(std::end(arr) - std::begin(arr)) - 1);</div>
 <div class="line"><span class="lineno">  141</span> </div>
-<div class="line"><span class="lineno">  142</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr_sorted), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr_sorted)));</div>
-<div class="line"><span class="lineno">  143</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n1st test: passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  142</span>    assert(std::is_sorted(std::begin(arr_sorted), std::end(arr_sorted)));</div>
+<div class="line"><span class="lineno">  143</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n1st test: passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  144</span> </div>
 <div class="line"><span class="lineno">  145</span>    <span class="comment">// 2nd test (normal and negative numbers)</span></div>
-<div class="line"><span class="lineno">  146</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> arr2 = {9,    15,   28,   96,  500, -4, -58,</div>
+<div class="line"><span class="lineno">  146</span>    std::vector&lt;int64_t&gt; arr2 = {9,    15,   28,   96,  500, -4, -58,</div>
 <div class="line"><span class="lineno">  147</span>                                 -977, -238, -800, -21, -53, -55};</div>
-<div class="line"><span class="lineno">  148</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> arr_sorted2 = <a class="code hl_function" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a>(</div>
-<div class="line"><span class="lineno">  149</span>        arr2, 0, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr2) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr2));</div>
+<div class="line"><span class="lineno">  148</span>    std::vector&lt;int64_t&gt; arr_sorted2 = <a class="code hl_function" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a>(</div>
+<div class="line"><span class="lineno">  149</span>        arr2, 0, std::end(arr2) - std::begin(arr2));</div>
 <div class="line"><span class="lineno">  150</span> </div>
-<div class="line"><span class="lineno">  151</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr_sorted2), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr_sorted2)));</div>
-<div class="line"><span class="lineno">  152</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2nd test: passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  151</span>    assert(std::is_sorted(std::begin(arr_sorted2), std::end(arr_sorted2)));</div>
+<div class="line"><span class="lineno">  152</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test: passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  153</span> </div>
 <div class="line"><span class="lineno">  154</span>    <span class="comment">// 3rd test (decimal and normal numbers)</span></div>
-<div class="line"><span class="lineno">  155</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> arr3 = {29,  36,   1100, 0,      77,     1,</div>
+<div class="line"><span class="lineno">  155</span>    std::vector&lt;double&gt; arr3 = {29,  36,   1100, 0,      77,     1,</div>
 <div class="line"><span class="lineno">  156</span>                                6.7, 8.97, 1.74, 950.10, -329.65};</div>
-<div class="line"><span class="lineno">  157</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> arr_sorted3 = <a class="code hl_function" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a>(</div>
-<div class="line"><span class="lineno">  158</span>        arr3, 0, <span class="keywordtype">int</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr3) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr3)) - 1);</div>
+<div class="line"><span class="lineno">  157</span>    std::vector&lt;double&gt; arr_sorted3 = <a class="code hl_function" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a>(</div>
+<div class="line"><span class="lineno">  158</span>        arr3, 0, <span class="keywordtype">int</span>(std::end(arr3) - std::begin(arr3)) - 1);</div>
 <div class="line"><span class="lineno">  159</span> </div>
-<div class="line"><span class="lineno">  160</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr_sorted3), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr_sorted3)));</div>
-<div class="line"><span class="lineno">  161</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;3rd test: passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  160</span>    assert(std::is_sorted(std::begin(arr_sorted3), std::end(arr_sorted3)));</div>
+<div class="line"><span class="lineno">  161</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test: passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  162</span> </div>
 <div class="line"><span class="lineno">  163</span>    <span class="comment">// 4th test (random decimal and negative numbers)</span></div>
-<div class="line"><span class="lineno">  164</span>    <span class="keywordtype">size_t</span> size = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 750 + 100;</div>
+<div class="line"><span class="lineno">  164</span>    <span class="keywordtype">size_t</span> size = std::rand() % 750 + 100;</div>
 <div class="line"><span class="lineno">  165</span> </div>
-<div class="line"><span class="lineno">  166</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> arr4(size);</div>
+<div class="line"><span class="lineno">  166</span>    std::vector&lt;float&gt; arr4(size);</div>
 <div class="line"><span class="lineno">  167</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; size; i++) {</div>
-<div class="line"><span class="lineno">  168</span>        arr4[i] = <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>()) /</div>
+<div class="line"><span class="lineno">  168</span>        arr4[i] = <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(std::rand()) /</div>
 <div class="line"><span class="lineno">  169</span>                      <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(RAND_MAX / 999.99 - 0.99) -</div>
 <div class="line"><span class="lineno">  170</span>                  250;</div>
 <div class="line"><span class="lineno">  171</span>    }</div>
 <div class="line"><span class="lineno">  172</span> </div>
-<div class="line"><span class="lineno">  173</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> arr4_sorted = <a class="code hl_function" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a>(</div>
-<div class="line"><span class="lineno">  174</span>        arr4, 0, <span class="keywordtype">int</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr4) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr4)) - 1);</div>
-<div class="line"><span class="lineno">  175</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr4_sorted), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr4_sorted)));</div>
+<div class="line"><span class="lineno">  173</span>    std::vector&lt;float&gt; arr4_sorted = <a class="code hl_function" href="#a5e6213e8008356ac6eda9427f3f4b394">sorting::quick_sort::quick_sort</a>(</div>
+<div class="line"><span class="lineno">  174</span>        arr4, 0, <span class="keywordtype">int</span>(std::end(arr4) - std::begin(arr4)) - 1);</div>
+<div class="line"><span class="lineno">  175</span>    assert(std::is_sorted(std::begin(arr4_sorted), std::end(arr4_sorted)));</div>
 <div class="line"><span class="lineno">  176</span> </div>
-<div class="line"><span class="lineno">  177</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;4th test: passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  177</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;4th test: passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  178</span> </div>
 <div class="line"><span class="lineno">  179</span>    <span class="comment">// Printing all sorted arrays</span></div>
-<div class="line"><span class="lineno">  180</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n\tPrinting all sorted arrays:\t\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  180</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n\tPrinting all sorted arrays:\t\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  181</span> </div>
-<div class="line"><span class="lineno">  182</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1st array:\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  183</span>    <a class="code hl_function" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a>(arr_sorted, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr));</div>
-<div class="line"><span class="lineno">  184</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  185</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2nd array:\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  186</span>    <a class="code hl_function" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a>(arr_sorted2, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr2) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr2));</div>
-<div class="line"><span class="lineno">  187</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  188</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;3rd array:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  182</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st array:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  183</span>    <a class="code hl_function" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a>(arr_sorted, std::end(arr) - std::begin(arr));</div>
+<div class="line"><span class="lineno">  184</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  185</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd array:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  186</span>    <a class="code hl_function" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a>(arr_sorted2, std::end(arr2) - std::begin(arr2));</div>
+<div class="line"><span class="lineno">  187</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  188</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd array:\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  189</span>    <a class="code hl_function" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a>(arr_sorted3,</div>
-<div class="line"><span class="lineno">  190</span>                              <span class="keywordtype">int</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr3) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr3)) - 1);</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> &lt;&lt; <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">  192</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Start: 4th array:\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  190</span>                              <span class="keywordtype">int</span>(std::end(arr3) - std::begin(arr3)) - 1);</div>
+<div class="line"><span class="lineno">  191</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  192</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Start: 4th array:\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  193</span>    <a class="code hl_function" href="#aeccefcf6fcca62c54939c5ec9a93109b">sorting::quick_sort::show</a>(</div>
-<div class="line"><span class="lineno">  194</span>        arr4_sorted, <span class="keywordtype">int</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr4_sorted) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr4_sorted)) - 1);</div>
-<div class="line"><span class="lineno">  195</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnd: 4th array.\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  194</span>        arr4_sorted, <span class="keywordtype">int</span>(std::end(arr4_sorted) - std::begin(arr4_sorted)) - 1);</div>
+<div class="line"><span class="lineno">  195</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnd: 4th array.\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  196</span>}</div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</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="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-</div><!-- 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="../../d1/d21/quick__sort_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="210" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d1/d21/quick__sort_8cpp_a1b2a2cc2d319240f3b65c5b2f479ed82_cgraph.map b/d1/d21/quick__sort_8cpp_a1b2a2cc2d319240f3b65c5b2f479ed82_cgraph.map
deleted file mode 100644
index c16636a29..000000000
--- a/d1/d21/quick__sort_8cpp_a1b2a2cc2d319240f3b65c5b2f479ed82_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="sorting::quick_sort::partition" name="sorting::quick_sort::partition">
-<area shape="rect" id="Node000001" title="Sorts the array taking the last element as pivot." alt="" coords="5,5,134,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="182,13,260,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="134,23,166,23,166,28,134,28"/>
-</map>
diff --git a/d1/d21/quick__sort_8cpp_a1b2a2cc2d319240f3b65c5b2f479ed82_cgraph.md5 b/d1/d21/quick__sort_8cpp_a1b2a2cc2d319240f3b65c5b2f479ed82_cgraph.md5
deleted file mode 100644
index 20fcbf862..000000000
--- a/d1/d21/quick__sort_8cpp_a1b2a2cc2d319240f3b65c5b2f479ed82_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-dc417699b503db87c136ad56498e5fc8
\ No newline at end of file
diff --git a/d1/d21/quick__sort_8cpp_a1b2a2cc2d319240f3b65c5b2f479ed82_cgraph.svg b/d1/d21/quick__sort_8cpp_a1b2a2cc2d319240f3b65c5b2f479ed82_cgraph.svg
deleted file mode 100644
index fbfd83e62..000000000
--- a/d1/d21/quick__sort_8cpp_a1b2a2cc2d319240f3b65c5b2f479ed82_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::quick_sort::partition Pages: 1 -->
-<svg width="199pt" height="39pt"
- viewBox="0.00 0.00 199.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>sorting::quick_sort::partition</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Sorts the array taking the last element as pivot.">
-<polygon fill="#999999" stroke="#666666" points="96.25,-30.5 0,-30.5 0,0 96.25,0 96.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::quick_sort</text>
-<text text-anchor="middle" x="48.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::partition</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191,-24.88 132.25,-24.88 132.25,-5.63 191,-5.63 191,-24.88"/>
-<text text-anchor="middle" x="161.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.73,-15.25C104.67,-15.25 112.84,-15.25 120.57,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.36,-18.75 130.36,-15.25 120.36,-11.75 120.36,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d21/quick__sort_8cpp_a1b2a2cc2d319240f3b65c5b2f479ed82_cgraph_org.svg b/d1/d21/quick__sort_8cpp_a1b2a2cc2d319240f3b65c5b2f479ed82_cgraph_org.svg
deleted file mode 100644
index 6cf9c12e7..000000000
--- a/d1/d21/quick__sort_8cpp_a1b2a2cc2d319240f3b65c5b2f479ed82_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::quick_sort::partition Pages: 1 -->
-<svg width="199pt" height="39pt"
- viewBox="0.00 0.00 199.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>sorting::quick_sort::partition</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Sorts the array taking the last element as pivot.">
-<polygon fill="#999999" stroke="#666666" points="96.25,-30.5 0,-30.5 0,0 96.25,0 96.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::quick_sort</text>
-<text text-anchor="middle" x="48.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::partition</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191,-24.88 132.25,-24.88 132.25,-5.63 191,-5.63 191,-24.88"/>
-<text text-anchor="middle" x="161.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.73,-15.25C104.67,-15.25 112.84,-15.25 120.57,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.36,-18.75 130.36,-15.25 120.36,-11.75 120.36,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d21/quick__sort_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d1/d21/quick__sort_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index 8fc700554..000000000
--- a/d1/d21/quick__sort_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,104,56,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="115,5,193,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="40,102,66,72,102,40,107,37,110,41,105,44,70,76,44,106"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="120,55,188,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,104,105,84,107,89,57,109"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="118,104,190,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,114,103,114,103,120,56,120"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="104,153,204,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="57,124,107,145,105,150,55,129"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="118,203,190,228"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="44,128,70,158,105,189,110,193,107,197,102,194,66,162,40,132"/>
-</map>
diff --git a/d1/d21/quick__sort_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d1/d21/quick__sort_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 4895fb04f..000000000
--- a/d1/d21/quick__sort_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5bd82f93bd95e9e39e635e72b9f31601
\ No newline at end of file
diff --git a/d1/d21/quick__sort_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d1/d21/quick__sort_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index 5ce6967c7..000000000
--- a/d1/d21/quick__sort_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="157pt" height="175pt"
- viewBox="0.00 0.00 157.00 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-93.25 0,-93.25 0,-74 37.75,-74 37.75,-93.25"/>
-<text text-anchor="middle" x="18.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="140.75,-167.25 82,-167.25 82,-148 140.75,-148 140.75,-167.25"/>
-<text text-anchor="middle" x="111.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.42,-93.34C37.13,-105.36 55.01,-125.94 73.75,-139.62 74.88,-140.45 76.05,-141.25 77.25,-142.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.09,-144.83 85.5,-146.8 78.59,-138.77 75.09,-144.83"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="137,-130.25 85.75,-130.25 85.75,-111 137,-111 137,-130.25"/>
-<text text-anchor="middle" x="111.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-91.11C48.92,-95.5 62.83,-101.19 75.58,-106.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.93,-109.51 84.51,-110.05 76.58,-103.03 73.93,-109.51"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.12,-93.25 84.62,-93.25 84.62,-74 138.12,-74 138.12,-93.25"/>
-<text text-anchor="middle" x="111.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-83.62C48.21,-83.62 61,-83.62 73.02,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.69,-87.13 82.69,-83.63 72.69,-80.13 72.69,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149,-56.25 73.75,-56.25 73.75,-37 149,-37 149,-56.25"/>
-<text text-anchor="middle" x="111.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-76.14C48.92,-71.75 62.83,-66.06 75.58,-60.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.58,-64.22 84.51,-57.2 73.93,-57.74 76.58,-64.22"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.5,-19.25 84.25,-19.25 84.25,0 138.5,0 138.5,-19.25"/>
-<text text-anchor="middle" x="111.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.42,-73.91C37.13,-61.89 55.01,-41.31 73.75,-27.62 74.88,-26.8 76.05,-26 77.25,-25.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.59,-28.48 85.5,-20.45 75.09,-22.42 78.59,-28.48"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d21/quick__sort_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d1/d21/quick__sort_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index 0e26730be..000000000
--- a/d1/d21/quick__sort_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="157pt" height="175pt"
- viewBox="0.00 0.00 157.00 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-93.25 0,-93.25 0,-74 37.75,-74 37.75,-93.25"/>
-<text text-anchor="middle" x="18.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="140.75,-167.25 82,-167.25 82,-148 140.75,-148 140.75,-167.25"/>
-<text text-anchor="middle" x="111.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.42,-93.34C37.13,-105.36 55.01,-125.94 73.75,-139.62 74.88,-140.45 76.05,-141.25 77.25,-142.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.09,-144.83 85.5,-146.8 78.59,-138.77 75.09,-144.83"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="137,-130.25 85.75,-130.25 85.75,-111 137,-111 137,-130.25"/>
-<text text-anchor="middle" x="111.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-91.11C48.92,-95.5 62.83,-101.19 75.58,-106.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.93,-109.51 84.51,-110.05 76.58,-103.03 73.93,-109.51"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.12,-93.25 84.62,-93.25 84.62,-74 138.12,-74 138.12,-93.25"/>
-<text text-anchor="middle" x="111.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-83.62C48.21,-83.62 61,-83.62 73.02,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.69,-87.13 82.69,-83.63 72.69,-80.13 72.69,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149,-56.25 73.75,-56.25 73.75,-37 149,-37 149,-56.25"/>
-<text text-anchor="middle" x="111.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-76.14C48.92,-71.75 62.83,-66.06 75.58,-60.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.58,-64.22 84.51,-57.2 73.93,-57.74 76.58,-64.22"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.5,-19.25 84.25,-19.25 84.25,0 138.5,0 138.5,-19.25"/>
-<text text-anchor="middle" x="111.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.42,-73.91C37.13,-61.89 55.01,-41.31 73.75,-27.62 74.88,-26.8 76.05,-26 77.25,-25.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.59,-28.48 85.5,-20.45 75.09,-22.42 78.59,-28.48"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 47be37347..000000000
--- a/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,104,55,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="103,55,182,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,104,96,85,99,90,56,109"/>
-<area shape="rect" id="Node000003" href="$d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="117,104,168,130"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,114,102,114,102,120,55,120"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="106,153,178,179"/>
-<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="56,125,99,144,96,149,54,130"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="241,5,319,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="165,101,180,91,204,65,228,40,233,37,236,41,232,44,208,69,184,95,169,106"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="246,55,314,80"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="167,106,231,82,232,87,169,111"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="244,104,316,130"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="168,114,229,114,229,120,168,120"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="230,153,330,179"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="169,123,229,145,227,150,167,128"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="244,203,316,228"/>
-<area shape="poly" id="edge7_Node000003_Node000008" title=" " alt="" coords="169,128,184,139,208,165,232,189,236,193,233,197,228,194,204,168,180,143,165,132"/>
-</map>
diff --git a/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 0ba4b796a..000000000
--- a/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f9e3b940f8f33ec6262a5b1d6b9b627c
\ No newline at end of file
diff --git a/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index c663c85e6..000000000
--- a/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,191 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="252pt" height="175pt"
- viewBox="0.00 0.00 251.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-93.25 0,-93.25 0,-74 37,-74 37,-93.25"/>
-<text text-anchor="middle" x="18.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-130.25 73,-130.25 73,-111 132.5,-111 132.5,-130.25"/>
-<text text-anchor="middle" x="102.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-91.65C46.63,-95.83 58.28,-101.07 69.1,-105.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.6,-109.1 78.15,-110.01 70.47,-102.72 67.6,-109.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="121.62,-93.25 83.88,-93.25 83.88,-74 121.62,-74 121.62,-93.25"/>
-<text text-anchor="middle" x="102.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-83.62C47.52,-83.62 60.52,-83.62 72.17,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.14,-87.13 82.14,-83.63 72.14,-80.13 72.14,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-56.25 75.62,-56.25 75.62,-37 129.88,-37 129.88,-56.25"/>
-<text text-anchor="middle" x="102.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-75.6C46.63,-71.42 58.28,-66.18 69.1,-61.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.47,-64.53 78.15,-57.24 67.6,-58.15 70.47,-64.53"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235.5,-167.25 176.75,-167.25 176.75,-148 235.5,-148 235.5,-167.25"/>
-<text text-anchor="middle" x="206.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.27,-93.6C125.1,-96.05 129.04,-98.79 132.5,-101.62 150.5,-116.36 149.77,-125.83 168.5,-139.62 169.62,-140.45 170.79,-141.26 171.99,-142.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.83,-144.83 180.23,-146.82 173.34,-138.78 169.83,-144.83"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.75,-130.25 180.5,-130.25 180.5,-111 231.75,-111 231.75,-130.25"/>
-<text text-anchor="middle" x="206.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.87,-90.24C135.11,-95.07 153.48,-101.77 169.6,-107.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.29,-110.91 178.88,-111.05 170.69,-104.33 168.29,-110.91"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.88,-93.25 179.38,-93.25 179.38,-74 232.88,-74 232.88,-93.25"/>
-<text text-anchor="middle" x="206.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.87,-83.62C134.58,-83.62 152.02,-83.62 167.66,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.64,-87.13 177.64,-83.63 167.64,-80.13 167.64,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.75,-56.25 168.5,-56.25 168.5,-37 243.75,-37 243.75,-56.25"/>
-<text text-anchor="middle" x="206.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.87,-77.01C134.46,-72.42 151.69,-66.13 167.21,-60.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.99,-63.9 176.19,-57.19 165.59,-57.33 167.99,-63.9"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.25,-19.25 179,-19.25 179,0 233.25,0 233.25,-19.25"/>
-<text text-anchor="middle" x="206.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.27,-73.65C125.1,-71.2 129.04,-68.46 132.5,-65.62 150.5,-50.89 149.77,-41.42 168.5,-27.62 169.62,-26.8 170.79,-25.99 171.99,-25.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.34,-28.47 180.23,-20.43 169.83,-22.42 173.34,-28.47"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 6be23337c..000000000
--- a/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,165 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="252pt" height="175pt"
- viewBox="0.00 0.00 251.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-93.25 0,-93.25 0,-74 37,-74 37,-93.25"/>
-<text text-anchor="middle" x="18.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-130.25 73,-130.25 73,-111 132.5,-111 132.5,-130.25"/>
-<text text-anchor="middle" x="102.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-91.65C46.63,-95.83 58.28,-101.07 69.1,-105.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.6,-109.1 78.15,-110.01 70.47,-102.72 67.6,-109.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="121.62,-93.25 83.88,-93.25 83.88,-74 121.62,-74 121.62,-93.25"/>
-<text text-anchor="middle" x="102.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-83.62C47.52,-83.62 60.52,-83.62 72.17,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.14,-87.13 82.14,-83.63 72.14,-80.13 72.14,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-56.25 75.62,-56.25 75.62,-37 129.88,-37 129.88,-56.25"/>
-<text text-anchor="middle" x="102.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-75.6C46.63,-71.42 58.28,-66.18 69.1,-61.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.47,-64.53 78.15,-57.24 67.6,-58.15 70.47,-64.53"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235.5,-167.25 176.75,-167.25 176.75,-148 235.5,-148 235.5,-167.25"/>
-<text text-anchor="middle" x="206.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.27,-93.6C125.1,-96.05 129.04,-98.79 132.5,-101.62 150.5,-116.36 149.77,-125.83 168.5,-139.62 169.62,-140.45 170.79,-141.26 171.99,-142.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.83,-144.83 180.23,-146.82 173.34,-138.78 169.83,-144.83"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.75,-130.25 180.5,-130.25 180.5,-111 231.75,-111 231.75,-130.25"/>
-<text text-anchor="middle" x="206.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.87,-90.24C135.11,-95.07 153.48,-101.77 169.6,-107.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.29,-110.91 178.88,-111.05 170.69,-104.33 168.29,-110.91"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.88,-93.25 179.38,-93.25 179.38,-74 232.88,-74 232.88,-93.25"/>
-<text text-anchor="middle" x="206.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.87,-83.62C134.58,-83.62 152.02,-83.62 167.66,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.64,-87.13 177.64,-83.63 167.64,-80.13 167.64,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.75,-56.25 168.5,-56.25 168.5,-37 243.75,-37 243.75,-56.25"/>
-<text text-anchor="middle" x="206.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.87,-77.01C134.46,-72.42 151.69,-66.13 167.21,-60.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.99,-63.9 176.19,-57.19 165.59,-57.33 167.99,-63.9"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.25,-19.25 179,-19.25 179,0 233.25,0 233.25,-19.25"/>
-<text text-anchor="middle" x="206.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.27,-73.65C125.1,-71.2 129.04,-68.46 132.5,-65.62 150.5,-50.89 149.77,-41.42 168.5,-27.62 169.62,-26.8 170.79,-25.99 171.99,-25.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.34,-28.47 180.23,-20.43 169.83,-22.42 173.34,-28.47"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d21/quick__sort_8cpp_source.html b/d1/d21/quick__sort_8cpp_source.html
new file mode 100644
index 000000000..8a933819c
--- /dev/null
+++ b/d1/d21/quick__sort_8cpp_source.html
@@ -0,0 +1,311 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/quick_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/d21/quick__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">quick_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d1/d21/quick__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;ctime&gt;</span>      </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a> {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00059" data-start="{" data-end="}">
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d1/d21/quick__sort_8cpp.html#a1b2a2cc2d319240f3b65c5b2f479ed82">   59</a></span><span class="keywordtype">int</span> partition(std::vector&lt;T&gt; *arr, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;low, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;high) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    T pivot = (*arr)[high];  <span class="comment">// taking the last element as pivot</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordtype">int</span> i = (low - 1);       <span class="comment">// Index of smaller element</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = low; j &lt; high; j++) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        <span class="comment">// If current element is smaller than or</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <span class="comment">// equal to pivot</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="keywordflow">if</span> ((*arr)[j] &lt;= pivot) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            i++;  <span class="comment">// increment index of smaller element</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            std::swap((*arr)[i], (*arr)[j]);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    }</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    std::swap((*arr)[i + 1], (*arr)[high]);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">return</span> (i + 1);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>}</div>
+</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00087" data-start="{" data-end="}">
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"><a class="line" href="../../d1/d21/quick__sort_8cpp.html#a5e6213e8008356ac6eda9427f3f4b394">   87</a></span><span class="keywordtype">void</span> <a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a>(std::vector&lt;T&gt; *arr, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;low, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;high) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keywordflow">if</span> (low &lt; high) {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        <span class="keywordtype">int</span> p = partition(arr, low, high);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        <a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a>(arr, low, p - 1);</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        <a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a>(arr, p + 1, high);</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    }</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>}</div>
+</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00107" data-start="{" data-end="}">
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"><a class="line" href="../../d1/d21/quick__sort_8cpp.html#a53adad7e4d83e1495df25fe8dbb4cc05">  107</a></span>std::vector&lt;T&gt; <a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a>(std::vector&lt;T&gt; arr, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;low, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;high) {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="keywordflow">if</span> (low &lt; high) {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        <span class="keywordtype">int</span> p = partition(&amp;arr, low, high);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span> </div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        <a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a>(&amp;arr, low, p - 1);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        <a class="code hl_namespace" href="../../d0/d2b/namespacequick__sort.html">quick_sort</a>(&amp;arr, p + 1, high);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    }</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="keywordflow">return</span> arr;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>}</div>
+</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00124" data-start="{" data-end="}">
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"><a class="line" href="../../d1/d21/quick__sort_8cpp.html#aeccefcf6fcca62c54939c5ec9a93109b">  124</a></span><span class="keywordtype">void</span> show(<span class="keyword">const</span> std::vector&lt;T&gt; &amp;arr, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;size) {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>}</div>
+</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>}  <span class="comment">// namespace quick_sort</span></div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
+<div class="foldopen" id="foldopen00136" data-start="{" data-end="}">
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"><a class="line" href="../../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">  136</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <span class="comment">// 1st test (normal numbers)</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    std::vector&lt;uint64_t&gt; arr = {5, 3, 8, 12, 14, 16, 28, 96, 2, 5977};</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    std::vector&lt;uint64_t&gt; arr_sorted = sorting::quick_sort::quick_sort(</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        arr, 0, <span class="keywordtype">int</span>(std::end(arr) - std::begin(arr)) - 1);</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    assert(std::is_sorted(std::begin(arr_sorted), std::end(arr_sorted)));</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n1st test: passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span> </div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <span class="comment">// 2nd test (normal and negative numbers)</span></div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    std::vector&lt;int64_t&gt; arr2 = {9,    15,   28,   96,  500, -4, -58,</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>                                 -977, -238, -800, -21, -53, -55};</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    std::vector&lt;int64_t&gt; arr_sorted2 = sorting::quick_sort::quick_sort(</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        arr2, 0, std::end(arr2) - std::begin(arr2));</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    assert(std::is_sorted(std::begin(arr_sorted2), std::end(arr_sorted2)));</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test: passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span> </div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <span class="comment">// 3rd test (decimal and normal numbers)</span></div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    std::vector&lt;double&gt; arr3 = {29,  36,   1100, 0,      77,     1,</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>                                6.7, 8.97, 1.74, 950.10, -329.65};</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    std::vector&lt;double&gt; arr_sorted3 = sorting::quick_sort::quick_sort(</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>        arr3, 0, <span class="keywordtype">int</span>(std::end(arr3) - std::begin(arr3)) - 1);</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span> </div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    assert(std::is_sorted(std::begin(arr_sorted3), std::end(arr_sorted3)));</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test: passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span> </div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    <span class="comment">// 4th test (random decimal and negative numbers)</span></div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    <span class="keywordtype">size_t</span> size = std::rand() % 750 + 100;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span> </div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    std::vector&lt;float&gt; arr4(size);</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; size; i++) {</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        arr4[i] = <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(std::rand()) /</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>                      <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(RAND_MAX / 999.99 - 0.99) -</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>                  250;</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    }</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span> </div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    std::vector&lt;float&gt; arr4_sorted = sorting::quick_sort::quick_sort(</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        arr4, 0, <span class="keywordtype">int</span>(std::end(arr4) - std::begin(arr4)) - 1);</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    assert(std::is_sorted(std::begin(arr4_sorted), std::end(arr4_sorted)));</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;4th test: passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    <span class="comment">// Printing all sorted arrays</span></div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n\tPrinting all sorted arrays:\t\n&quot;</span>;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span> </div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st array:\n&quot;</span>;</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    sorting::quick_sort::show(arr_sorted, std::end(arr) - std::begin(arr));</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd array:\n&quot;</span>;</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    sorting::quick_sort::show(arr_sorted2, std::end(arr2) - std::begin(arr2));</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd array:\n&quot;</span>;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    sorting::quick_sort::show(arr_sorted3,</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>                              <span class="keywordtype">int</span>(std::end(arr3) - std::begin(arr3)) - 1);</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Start: 4th array:\n\n&quot;</span>;</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    sorting::quick_sort::show(</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>        arr4_sorted, <span class="keywordtype">int</span>(std::end(arr4_sorted) - std::begin(arr4_sorted)) - 1);</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnd: 4th array.\n&quot;</span>;</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>}</div>
+</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span> </div>
+<div class="foldopen" id="foldopen00202" data-start="{" data-end="}">
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"><a class="line" href="../../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  202</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    <span class="keywordtype">int</span> choice = 0;</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span> </div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tAvailable modes\t\n\n&quot;</span>;</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1. Self-tests mode\n2. Interactive mode&quot;</span>;</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span> </div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nChoose a mode: &quot;</span>;</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    std::cin &gt;&gt; choice;</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span> </div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    <span class="keywordflow">while</span> ((choice != 1) &amp;&amp; (choice != 2)) {</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Invalid option. Choose between the valid modes: &quot;</span>;</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>        std::cin &gt;&gt; choice;</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    }</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span> </div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    <span class="keywordflow">if</span> (choice == 1) {</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>        std::srand(std::time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>        <a class="code hl_function" href="../../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (choice == 2) {</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>        <span class="keywordtype">int</span> size = 0;</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the number of elements: &quot;</span>;</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span> </div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>        std::cin &gt;&gt; size;</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>        std::vector&lt;float&gt; arr(size);</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span> </div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>        std::cout</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>            &lt;&lt; <span class="stringliteral">&quot;\nEnter the unsorted elements (can be negative/decimal): &quot;</span>;</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span> </div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>            std::cin &gt;&gt; arr[i];</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>        }</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>        sorting::quick_sort::quick_sort(&amp;arr, 0, size - 1);</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nSorted array: \n&quot;</span>;</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>        sorting::quick_sort::show(arr, size);</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    }</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>}</div>
+</div>
+<div class="ttc" id="anamespacequick__sort_html"><div class="ttname"><a href="../../d0/d2b/namespacequick__sort.html">quick_sort</a></div><div class="ttdoc">Functions for the Quick sort implementation in C++.</div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+<div class="ttc" id="aquick__sort_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d1/d21/quick__sort_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> <a href="#l00136">quick_sort.cpp:136</a></div></div>
+<div class="ttc" id="aquick__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00202">quick_sort.cpp:202</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d1/d21/quick__sort_8cpp.html">quick_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/d2a/knight__tour_8cpp.html b/d1/d2a/knight__tour_8cpp.html
index 3a8e72e4b..d3f028c4f 100644
--- a/d1/d2a/knight__tour_8cpp.html
+++ b/d1/d2a/knight__tour_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: backtracking/knight_tour.cpp File Reference</title>
+<title>TheAlgorithms/C++: backtracking/knight_tour.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for knight_tour.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d02/knight__tour_8cpp__incl.svg" width="158" height="126"><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">
+</div>
+<p><a href="../../d1/d2a/knight__tour_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html">backtracking</a></td></tr>
@@ -133,10 +152,10 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:af27031fbff093ffd625f64010d98aab2" id="r_af27031fbff093ffd625f64010d98aab2"><td class="memTemplParams" colspan="2">template&lt;size_t V&gt; </td></tr>
-<tr class="memitem:af27031fbff093ffd625f64010d98aab2"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af27031fbff093ffd625f64010d98aab2">backtracking::knight_tour::issafe</a> (int x, int y, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;sol)</td></tr>
+<tr class="memitem:af27031fbff093ffd625f64010d98aab2"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af27031fbff093ffd625f64010d98aab2">backtracking::knight_tour::issafe</a> (int x, int y, const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;sol)</td></tr>
 <tr class="separator:af27031fbff093ffd625f64010d98aab2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aaa47356d98676cf5315d978f741e29c9" id="r_aaa47356d98676cf5315d978f741e29c9"><td class="memTemplParams" colspan="2">template&lt;size_t V&gt; </td></tr>
-<tr class="memitem:aaa47356d98676cf5315d978f741e29c9"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aaa47356d98676cf5315d978f741e29c9">backtracking::knight_tour::solve</a> (int x, int y, int <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;sol, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt; &amp;xmov, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt; &amp;ymov)</td></tr>
+<tr class="memitem:aaa47356d98676cf5315d978f741e29c9"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aaa47356d98676cf5315d978f741e29c9">backtracking::knight_tour::solve</a> (int x, int y, int <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a>, std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;sol, const std::array&lt; int, V &gt; &amp;xmov, std::array&lt; int, V &gt; &amp;ymov)</td></tr>
 <tr class="separator:aaa47356d98676cf5315d978f741e29c9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
 <tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function.  <br /></td></tr>
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/nikhilarora068" target="_blank">Nikhil Arora</a> </dd>
 <dd>
 <a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d1/d2a/knight__tour_8cpp_source.html">knight_tour.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="af27031fbff093ffd625f64010d98aab2" name="af27031fbff093ffd625f64010d98aab2"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#af27031fbff093ffd625f64010d98aab2">&#9670;&#160;</a></span>issafe()</h2>
@@ -170,7 +191,7 @@ template&lt;size_t V&gt; </div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>sol</em></span>&#160;)</td>
+          <td class="paramtype">const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>sol</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -191,15 +212,12 @@ template&lt;size_t V&gt; </div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if .... </dd>
 <dd>
 <code>false</code> if .... </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d2a/knight__tour_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../d1/d2a/knight__tour_8cpp_source.html">knight_tour.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   40</span>                                                                    {</div>
 <div class="line"><span class="lineno">   41</span>    <span class="keywordflow">return</span> (x &lt; V &amp;&amp; x &gt;= 0 &amp;&amp; y &lt; V &amp;&amp; y &gt;= 0 &amp;&amp; sol[x][y] == -1);</div>
 <div class="line"><span class="lineno">   42</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d2a/knight__tour_8cpp_af27031fbff093ffd625f64010d98aab2_cgraph.svg" width="150" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -219,9 +237,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>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d2a/knight__tour_8cpp_source.html#l00088">88</a> of file <a class="el" href="../../d1/d2a/knight__tour_8cpp_source.html">knight_tour.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   88</span>           {</div>
 <div class="line"><span class="lineno">   89</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> n = 8;</div>
-<div class="line"><span class="lineno">   90</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;int, n&gt;</a>, n&gt; sol = {0};</div>
+<div class="line"><span class="lineno">   90</span>    std::array&lt;std::array&lt;int, n&gt;, n&gt; sol = {0};</div>
 <div class="line"><span class="lineno">   91</span> </div>
 <div class="line"><span class="lineno">   92</span>    <span class="keywordtype">int</span> i = 0, j = 0;</div>
 <div class="line"><span class="lineno">   93</span>    <span class="keywordflow">for</span> (i = 0; i &lt; n; i++) {</div>
@@ -230,26 +250,24 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   96</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>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n&gt;</a> xmov = {2, 1, -1, -2, -2, -1, 1, 2};</div>
-<div class="line"><span class="lineno">  100</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n&gt;</a> ymov = {1, 2, 2, 1, -1, -2, -2, -1};</div>
+<div class="line"><span class="lineno">   99</span>    std::array&lt;int, n&gt; xmov = {2, 1, -1, -2, -2, -1, 1, 2};</div>
+<div class="line"><span class="lineno">  100</span>    std::array&lt;int, n&gt; ymov = {1, 2, 2, 1, -1, -2, -2, -1};</div>
 <div class="line"><span class="lineno">  101</span> </div>
 <div class="line"><span class="lineno">  102</span>    sol[0][0] = 0;</div>
 <div class="line"><span class="lineno">  103</span> </div>
 <div class="line"><span class="lineno">  104</span>    <span class="keywordtype">bool</span> flag = backtracking::knight_tour::solve&lt;n&gt;(0, 0, 1, sol, xmov, ymov);</div>
 <div class="line"><span class="lineno">  105</span>    <span class="keywordflow">if</span> (flag == <span class="keyword">false</span>) {</div>
-<div class="line"><span class="lineno">  106</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Error: Solution does not exist\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  106</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Error: Solution does not exist\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  107</span>    } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">  108</span>        <span class="keywordflow">for</span> (i = 0; i &lt; n; i++) {</div>
 <div class="line"><span class="lineno">  109</span>            <span class="keywordflow">for</span> (j = 0; j &lt; n; j++) {</div>
-<div class="line"><span class="lineno">  110</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; sol[i][j] &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><span class="lineno">  110</span>                std::cout &lt;&lt; sol[i][j] &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
 <div class="line"><span class="lineno">  111</span>            }</div>
-<div class="line"><span class="lineno">  112</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  112</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</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>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  116</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -279,17 +297,17 @@ template&lt;size_t V&gt; </div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>sol</em></span>, </td>
+          <td class="paramtype">std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>sol</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>xmov</em></span>, </td>
+          <td class="paramtype">const std::array&lt; int, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>xmov</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>ymov</em></span>&#160;)</td>
+          <td class="paramtype">std::array&lt; int, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>ymov</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -313,6 +331,8 @@ template&lt;size_t V&gt; </div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if solution exists </dd>
 <dd>
 <code>false</code> if solution does not exist </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d2a/knight__tour_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../d1/d2a/knight__tour_8cpp_source.html">knight_tour.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   58</span>                                                                 {</div>
 <div class="line"><span class="lineno">   59</span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = 0, xnext = 0, ynext = 0;</div>
 <div class="line"><span class="lineno">   60</span> </div>
@@ -336,14 +356,9 @@ template&lt;size_t V&gt; </div>
 <div class="line"><span class="lineno">   78</span>    }</div>
 <div class="line"><span class="lineno">   79</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   80</span>}</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-<div class="ttc" id="atower__of__hanoi_8cpp_html_af4cfc41e546f1f8d25f01e0804e8b61d"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a></div><div class="ttdeci">void mov(tower *From, tower *To)</div><div class="ttdef"><b>Definition</b> tower_of_hanoi.cpp:39</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d2a/knight__tour_8cpp_aaa47356d98676cf5315d978f741e29c9_cgraph.svg" width="244" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="atower__of__hanoi_8cpp_html_af4cfc41e546f1f8d25f01e0804e8b61d"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a></div><div class="ttdeci">void mov(tower *From, tower *To)</div><div class="ttdef"><b>Definition</b> <a href="../../db/d3c/tower__of__hanoi_8cpp_source.html#l00039">tower_of_hanoi.cpp:39</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d1/d2a/knight__tour_8cpp_aaa47356d98676cf5315d978f741e29c9_cgraph.map b/d1/d2a/knight__tour_8cpp_aaa47356d98676cf5315d978f741e29c9_cgraph.map
deleted file mode 100644
index b937873ee..000000000
--- a/d1/d2a/knight__tour_8cpp_aaa47356d98676cf5315d978f741e29c9_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="backtracking::knight_tour::solve" name="backtracking::knight_tour::solve">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,144,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="47,29,46,20,50,11,60,5,75,3,90,5,100,12,97,16,88,10,74,8,62,10,54,14,51,20,52,28"/>
-<area shape="rect" id="Node000002" href="$db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d" title=" " alt="" coords="192,37,238,62"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="144,47,176,47,176,52,144,52"/>
-</map>
diff --git a/d1/d2a/knight__tour_8cpp_aaa47356d98676cf5315d978f741e29c9_cgraph.md5 b/d1/d2a/knight__tour_8cpp_aaa47356d98676cf5315d978f741e29c9_cgraph.md5
deleted file mode 100644
index 51dac42b2..000000000
--- a/d1/d2a/knight__tour_8cpp_aaa47356d98676cf5315d978f741e29c9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6b910f1a1562d6c2a476d698d46a2aba
\ No newline at end of file
diff --git a/d1/d2a/knight__tour_8cpp_aaa47356d98676cf5315d978f741e29c9_cgraph.svg b/d1/d2a/knight__tour_8cpp_aaa47356d98676cf5315d978f741e29c9_cgraph.svg
deleted file mode 100644
index e7a26228e..000000000
--- a/d1/d2a/knight__tour_8cpp_aaa47356d98676cf5315d978f741e29c9_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::knight_tour::solve Pages: 1 -->
-<svg width="183pt" height="57pt"
- viewBox="0.00 0.00 182.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::knight_tour::solve</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="103.75,-30.5 0,-30.5 0,0 103.75,0 103.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::knight</text>
-<text text-anchor="middle" x="51.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tour::solve</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.22,-30.99C29.42,-40.06 35.64,-48.5 51.88,-48.5 60.76,-48.5 66.64,-45.97 69.53,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.99,-42.76 70.39,-32.49 66.02,-42.14 72.99,-42.76"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="174.5,-24.88 139.75,-24.88 139.75,-5.63 174.5,-5.63 174.5,-24.88"/>
-<text text-anchor="middle" x="157.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">mov</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.2,-15.25C112.37,-15.25 120.55,-15.25 127.92,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.91,-18.75 137.91,-15.25 127.91,-11.75 127.91,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d2a/knight__tour_8cpp_aaa47356d98676cf5315d978f741e29c9_cgraph_org.svg b/d1/d2a/knight__tour_8cpp_aaa47356d98676cf5315d978f741e29c9_cgraph_org.svg
deleted file mode 100644
index f156674d9..000000000
--- a/d1/d2a/knight__tour_8cpp_aaa47356d98676cf5315d978f741e29c9_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::knight_tour::solve Pages: 1 -->
-<svg width="183pt" height="57pt"
- viewBox="0.00 0.00 182.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::knight_tour::solve</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="103.75,-30.5 0,-30.5 0,0 103.75,0 103.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::knight</text>
-<text text-anchor="middle" x="51.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tour::solve</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.22,-30.99C29.42,-40.06 35.64,-48.5 51.88,-48.5 60.76,-48.5 66.64,-45.97 69.53,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.99,-42.76 70.39,-32.49 66.02,-42.14 72.99,-42.76"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="174.5,-24.88 139.75,-24.88 139.75,-5.63 174.5,-5.63 174.5,-24.88"/>
-<text text-anchor="middle" x="157.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">mov</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.2,-15.25C112.37,-15.25 120.55,-15.25 127.92,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.91,-18.75 137.91,-15.25 127.91,-11.75 127.91,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d2a/knight__tour_8cpp_af27031fbff093ffd625f64010d98aab2_cgraph.map b/d1/d2a/knight__tour_8cpp_af27031fbff093ffd625f64010d98aab2_cgraph.map
deleted file mode 100644
index fd7245fee..000000000
--- a/d1/d2a/knight__tour_8cpp_af27031fbff093ffd625f64010d98aab2_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="backtracking::knight_tour::issafe" name="backtracking::knight_tour::issafe">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,144,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="47,29,46,20,50,11,60,5,75,3,90,5,99,12,96,16,88,10,74,8,62,10,54,14,51,20,53,28"/>
-</map>
diff --git a/d1/d2a/knight__tour_8cpp_af27031fbff093ffd625f64010d98aab2_cgraph.md5 b/d1/d2a/knight__tour_8cpp_af27031fbff093ffd625f64010d98aab2_cgraph.md5
deleted file mode 100644
index ee20e527b..000000000
--- a/d1/d2a/knight__tour_8cpp_af27031fbff093ffd625f64010d98aab2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a79f94597d72a3e920666cf57253edee
\ No newline at end of file
diff --git a/d1/d2a/knight__tour_8cpp_af27031fbff093ffd625f64010d98aab2_cgraph.svg b/d1/d2a/knight__tour_8cpp_af27031fbff093ffd625f64010d98aab2_cgraph.svg
deleted file mode 100644
index 67f1e7bdf..000000000
--- a/d1/d2a/knight__tour_8cpp_af27031fbff093ffd625f64010d98aab2_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::knight_tour::issafe Pages: 1 -->
-<svg width="112pt" height="57pt"
- viewBox="0.00 0.00 111.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::knight_tour::issafe</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="103.75,-30.5 0,-30.5 0,0 103.75,0 103.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::knight</text>
-<text text-anchor="middle" x="51.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tour::issafe</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.49,-30.99C29.74,-40.06 35.87,-48.5 51.88,-48.5 60.63,-48.5 66.43,-45.97 69.27,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.74,-42.76 70.13,-32.49 65.77,-42.15 72.74,-42.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d2a/knight__tour_8cpp_af27031fbff093ffd625f64010d98aab2_cgraph_org.svg b/d1/d2a/knight__tour_8cpp_af27031fbff093ffd625f64010d98aab2_cgraph_org.svg
deleted file mode 100644
index 1854f14a2..000000000
--- a/d1/d2a/knight__tour_8cpp_af27031fbff093ffd625f64010d98aab2_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::knight_tour::issafe Pages: 1 -->
-<svg width="112pt" height="57pt"
- viewBox="0.00 0.00 111.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::knight_tour::issafe</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="103.75,-30.5 0,-30.5 0,0 103.75,0 103.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::knight</text>
-<text text-anchor="middle" x="51.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tour::issafe</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.49,-30.99C29.74,-40.06 35.87,-48.5 51.88,-48.5 60.63,-48.5 66.43,-45.97 69.27,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.74,-42.76 70.13,-32.49 65.77,-42.15 72.74,-42.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d2a/knight__tour_8cpp_source.html b/d1/d2a/knight__tour_8cpp_source.html
new file mode 100644
index 000000000..45eb683a6
--- /dev/null
+++ b/d1/d2a/knight__tour_8cpp_source.html
@@ -0,0 +1,217 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: backtracking/knight_tour.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/d2a/knight__tour_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">knight_tour.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d1/d2a/knight__tour_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;array&gt;</span>     </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../db/dc0/namespacebacktracking.html">backtracking</a> {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d1/db6/namespaceknight__tour.html">knight_tour</a> {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> V&gt;</div>
+<div class="foldopen" id="foldopen00040" data-start="{" data-end="}">
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2">   40</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2">issafe</a>(<span class="keywordtype">int</span> x, <span class="keywordtype">int</span> y, <span class="keyword">const</span> std::array&lt;std::array&lt;int, V&gt;, V&gt; &amp;sol) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">return</span> (x &lt; V &amp;&amp; x &gt;= 0 &amp;&amp; y &lt; V &amp;&amp; y &gt;= 0 &amp;&amp; sol[x][y] == -1);</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>}</div>
+</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> V&gt;</div>
+<div class="foldopen" id="foldopen00057" data-start="{" data-end="}">
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="../../d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9">   57</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9">solve</a>(<span class="keywordtype">int</span> x, <span class="keywordtype">int</span> y, <span class="keywordtype">int</span> <a class="code hl_function" href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a>, std::array&lt;std::array&lt;int, V&gt;, V&gt; &amp;sol,</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>           <span class="keyword">const</span> std::array&lt;int, V&gt; &amp;xmov, std::array&lt;int, V&gt; &amp;ymov) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordtype">int</span> k = 0, xnext = 0, ynext = 0;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a> == V * V) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordflow">for</span> (k = 0; k &lt; V; k++) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        xnext = x + xmov[k];</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        ynext = y + ymov[k];</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        <span class="keywordflow">if</span> (issafe&lt;V&gt;(xnext, ynext, sol)) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            sol[xnext][ynext] = <a class="code hl_function" href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            <span class="keywordflow">if</span> (solve&lt;V&gt;(xnext, ynext, <a class="code hl_function" href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a> + 1, sol, xmov, ymov) == <span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>                sol[xnext][ynext] = -1;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>            }</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    }</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>}</div>
+</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>}  <span class="comment">// namespace knight_tour</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>}  <span class="comment">// namespace backtracking</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="foldopen" id="foldopen00088" data-start="{" data-end="}">
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"><a class="line" href="../../d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   88</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> n = 8;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    std::array&lt;std::array&lt;int, n&gt;, n&gt; sol = {0};</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keywordtype">int</span> i = 0, j = 0;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="keywordflow">for</span> (i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="keywordflow">for</span> (j = 0; j &lt; n; j++) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>            sol[i][j] = -1;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    }</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span> </div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    std::array&lt;int, n&gt; xmov = {2, 1, -1, -2, -2, -1, 1, 2};</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    std::array&lt;int, n&gt; ymov = {1, 2, 2, 1, -1, -2, -2, -1};</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    sol[0][0] = 0;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="keywordtype">bool</span> flag = backtracking::knight_tour::solve&lt;n&gt;(0, 0, 1, sol, xmov, ymov);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="keywordflow">if</span> (flag == <span class="keyword">false</span>) {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Error: Solution does not exist\n&quot;</span>;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <span class="keywordflow">for</span> (i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            <span class="keywordflow">for</span> (j = 0; j &lt; n; j++) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>                std::cout &lt;&lt; sol[i][j] &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>            }</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        }</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    }</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>}</div>
+</div>
+<div class="ttc" id="aknight__tour_8cpp_html_aaa47356d98676cf5315d978f741e29c9"><div class="ttname"><a href="../../d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9">backtracking::knight_tour::solve</a></div><div class="ttdeci">bool solve(int x, int y, int mov, std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;sol, const std::array&lt; int, V &gt; &amp;xmov, std::array&lt; int, V &gt; &amp;ymov)</div><div class="ttdef"><b>Definition</b> <a href="#l00057">knight_tour.cpp:57</a></div></div>
+<div class="ttc" id="aknight__tour_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00088">knight_tour.cpp:88</a></div></div>
+<div class="ttc" id="aknight__tour_8cpp_html_af27031fbff093ffd625f64010d98aab2"><div class="ttname"><a href="../../d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2">backtracking::knight_tour::issafe</a></div><div class="ttdeci">bool issafe(int x, int y, const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;sol)</div><div class="ttdef"><b>Definition</b> <a href="#l00040">knight_tour.cpp:40</a></div></div>
+<div class="ttc" id="anamespacebacktracking_html"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html">backtracking</a></div><div class="ttdoc">for vector container</div></div>
+<div class="ttc" id="anamespaceknight__tour_html"><div class="ttname"><a href="../../d1/db6/namespaceknight__tour.html">knight_tour</a></div><div class="ttdoc">Functions for the Knight's tour algorithm.</div></div>
+<div class="ttc" id="atower__of__hanoi_8cpp_html_af4cfc41e546f1f8d25f01e0804e8b61d"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a></div><div class="ttdeci">void mov(tower *From, tower *To)</div><div class="ttdef"><b>Definition</b> <a href="../../db/d3c/tower__of__hanoi_8cpp_source.html#l00039">tower_of_hanoi.cpp:39</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a class="el" href="../../d1/d2a/knight__tour_8cpp.html">knight_tour.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/d35/classothers_1_1_cache_1_1_l_r_u_cache-members.html b/d1/d35/classothers_1_1_cache_1_1_l_r_u_cache-members.html
index 737c0c237..1b3a15228 100644
--- a/d1/d35/classothers_1_1_cache_1_1_l_r_u_cache-members.html
+++ b/d1/d35/classothers_1_1_cache_1_1_l_r_u_cache-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d1/d35/namespaceexponential__dist.html b/d1/d35/namespaceexponential__dist.html
index 9f2cfd375..6c3fed1a1 100644
--- a/d1/d35/namespaceexponential__dist.html
+++ b/d1/d35/namespaceexponential__dist.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: exponential_dist Namespace Reference</title>
+<title>TheAlgorithms/C++: exponential_dist Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d1/d40/counting__sort_8cpp_source.html b/d1/d40/counting__sort_8cpp_source.html
new file mode 100644
index 000000000..bb52da11f
--- /dev/null
+++ b/d1/d40/counting__sort_8cpp_source.html
@@ -0,0 +1,202 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/counting_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/d40/counting__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">counting_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="keywordtype">int</span> Max(<span class="keywordtype">int</span> Arr[], <span class="keywordtype">int</span> N) {</div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span>    <span class="keywordtype">int</span> max = Arr[0];</div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++)</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span>        <span class="keywordflow">if</span> (Arr[i] &gt; max)</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>            max = Arr[i];</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    <span class="keywordflow">return</span> max;</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>}</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="keywordtype">int</span> Min(<span class="keywordtype">int</span> Arr[], <span class="keywordtype">int</span> N) {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <span class="keywordtype">int</span> min = Arr[0];</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++)</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>        <span class="keywordflow">if</span> (Arr[i] &lt; min)</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>            min = Arr[i];</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="keywordflow">return</span> min;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>}</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="keywordtype">void</span> Print(<span class="keywordtype">int</span> Arr[], <span class="keywordtype">int</span> N) {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) cout &lt;&lt; Arr[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>}</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keywordtype">int</span> *Counting_Sort(<span class="keywordtype">int</span> Arr[], <span class="keywordtype">int</span> N) {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="keywordtype">int</span> max = Max(Arr, N);</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="keywordtype">int</span> min = Min(Arr, N);</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordtype">int</span> *Sorted_Arr = <span class="keyword">new</span> <span class="keywordtype">int</span>[<a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>];</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordtype">int</span> *Count = <span class="keyword">new</span> <span class="keywordtype">int</span>[max - min + 1];</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; max - min + 1; ++i) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        Count[i] = 0;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    }</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) Count[Arr[i] - min]++;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; (max - min + 1); i++) Count[i] += Count[i - 1];</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = N - 1; i &gt;= 0; i--) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        Sorted_Arr[Count[Arr[i] - min] - 1] = Arr[i];</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        Count[Arr[i] - min]--;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    }</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keyword">delete</span>[] Count;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">return</span> Sorted_Arr;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>}</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordtype">int</span> Arr[] = {47, 65, 20, 66, 25, 53, 64, 69, 72, 22,</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>                 74, 25, 53, 15, 42, 36, 4,  69, 86, 19},</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 20;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordtype">int</span> *Sorted_Arr;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    cout &lt;&lt; <span class="stringliteral">&quot;\n\tOrignal Array = &quot;</span>;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    Print(Arr, N);</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    Sorted_Arr = Counting_Sort(Arr, N);</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    cout &lt;&lt; <span class="stringliteral">&quot;\n\t Sorted Array = &quot;</span>;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    Print(Sorted_Arr, N);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keyword">delete</span>[] Sorted_Arr;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    cout &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><b>counting_sort.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/d47/classprobability_1_1windowed__median_1_1_windowed_median-members.html b/d1/d47/classprobability_1_1windowed__median_1_1_windowed_median-members.html
index 987c14f04..10afaebf0 100644
--- a/d1/d47/classprobability_1_1windowed__median_1_1_windowed_median-members.html
+++ b/d1/d47/classprobability_1_1windowed__median_1_1_windowed_median-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html
index 05d2547eb..17723c32e 100644
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html
+++ b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: range_queries::heavy_light_decomposition::Tree&lt; X &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: range_queries::heavy_light_decomposition::Tree&lt; X &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -138,7 +155,7 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:ab916d554afa8ca5230b4310c2c69fae0" id="r_ab916d554afa8ca5230b4310c2c69fae0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab916d554afa8ca5230b4310c2c69fae0">change_root</a> (int new_root)</td></tr>
 <tr class="memdesc:ab916d554afa8ca5230b4310c2c69fae0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Set the root for the tree.  <br /></td></tr>
 <tr class="separator:ab916d554afa8ca5230b4310c2c69fae0"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a04cd96efaba147b19d3afc769b90ff70" id="r_a04cd96efaba147b19d3afc769b90ff70"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a04cd96efaba147b19d3afc769b90ff70">set_node_val</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; X &gt; &amp;node_val)</td></tr>
+<tr class="memitem:a04cd96efaba147b19d3afc769b90ff70" id="r_a04cd96efaba147b19d3afc769b90ff70"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a04cd96efaba147b19d3afc769b90ff70">set_node_val</a> (const std::vector&lt; X &gt; &amp;node_val)</td></tr>
 <tr class="memdesc:a04cd96efaba147b19d3afc769b90ff70"><td class="mdescLeft">&#160;</td><td class="mdescRight">Set the values for all the nodes.  <br /></td></tr>
 <tr class="separator:a04cd96efaba147b19d3afc769b90ff70"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ad22d760a5a33545a70e7ea5e1786c8dc" id="r_ad22d760a5a33545a70e7ea5e1786c8dc"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad22d760a5a33545a70e7ea5e1786c8dc">init</a> ()</td></tr>
@@ -165,44 +182,35 @@ Private Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:ab1aeaefa1bd97b867c652ba916fbdb43" id="r_ab1aeaefa1bd97b867c652ba916fbdb43"><td class="memItemLeft" align="right" valign="top"><a id="ab1aeaefa1bd97b867c652ba916fbdb43" name="ab1aeaefa1bd97b867c652ba916fbdb43"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>t_adj</b></td></tr>
-<tr class="memdesc:ab1aeaefa1bd97b867c652ba916fbdb43"><td class="mdescLeft">&#160;</td><td class="mdescRight">an adjacency list to stores the tree edges <br /></td></tr>
+<tr class="memitem:ab1aeaefa1bd97b867c652ba916fbdb43" id="r_ab1aeaefa1bd97b867c652ba916fbdb43"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::list&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab1aeaefa1bd97b867c652ba916fbdb43">t_adj</a></td></tr>
+<tr class="memdesc:ab1aeaefa1bd97b867c652ba916fbdb43"><td class="mdescLeft">&#160;</td><td class="mdescRight">an adjacency list to stores the tree edges  <br /></td></tr>
 <tr class="separator:ab1aeaefa1bd97b867c652ba916fbdb43"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae4630fa70a80a1dc65a875488a67178a" id="r_ae4630fa70a80a1dc65a875488a67178a"><td class="memItemLeft" align="right" valign="top"><a id="ae4630fa70a80a1dc65a875488a67178a" name="ae4630fa70a80a1dc65a875488a67178a"></a>
-const int&#160;</td><td class="memItemRight" valign="bottom"><b>t_nodes</b></td></tr>
-<tr class="memdesc:ae4630fa70a80a1dc65a875488a67178a"><td class="mdescLeft">&#160;</td><td class="mdescRight">number of nodes <br /></td></tr>
+<tr class="memitem:ae4630fa70a80a1dc65a875488a67178a" id="r_ae4630fa70a80a1dc65a875488a67178a"><td class="memItemLeft" align="right" valign="top">const int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a></td></tr>
+<tr class="memdesc:ae4630fa70a80a1dc65a875488a67178a"><td class="mdescLeft">&#160;</td><td class="mdescRight">number of nodes  <br /></td></tr>
 <tr class="separator:ae4630fa70a80a1dc65a875488a67178a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ab2ab020f798d00be2613ecf63074b7c1" id="r_ab2ab020f798d00be2613ecf63074b7c1"><td class="memItemLeft" align="right" valign="top"><a id="ab2ab020f798d00be2613ecf63074b7c1" name="ab2ab020f798d00be2613ecf63074b7c1"></a>
-const int&#160;</td><td class="memItemRight" valign="bottom"><b>t_maxlift</b></td></tr>
-<tr class="memdesc:ab2ab020f798d00be2613ecf63074b7c1"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum possible height of the tree <br /></td></tr>
+<tr class="memitem:ab2ab020f798d00be2613ecf63074b7c1" id="r_ab2ab020f798d00be2613ecf63074b7c1"><td class="memItemLeft" align="right" valign="top">const int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab2ab020f798d00be2613ecf63074b7c1">t_maxlift</a></td></tr>
+<tr class="memdesc:ab2ab020f798d00be2613ecf63074b7c1"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum possible height of the tree  <br /></td></tr>
 <tr class="separator:ab2ab020f798d00be2613ecf63074b7c1"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a350157a5fb79f76fceae33fc84171203" id="r_a350157a5fb79f76fceae33fc84171203"><td class="memItemLeft" align="right" valign="top"><a id="a350157a5fb79f76fceae33fc84171203" name="a350157a5fb79f76fceae33fc84171203"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>t_par</b></td></tr>
-<tr class="memdesc:a350157a5fb79f76fceae33fc84171203"><td class="mdescLeft">&#160;</td><td class="mdescRight">a matrix to store every node's 2^kth parent <br /></td></tr>
+<tr class="memitem:a350157a5fb79f76fceae33fc84171203" id="r_a350157a5fb79f76fceae33fc84171203"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a350157a5fb79f76fceae33fc84171203">t_par</a></td></tr>
+<tr class="memdesc:a350157a5fb79f76fceae33fc84171203"><td class="mdescLeft">&#160;</td><td class="mdescRight">a matrix to store every node's 2^kth parent  <br /></td></tr>
 <tr class="separator:a350157a5fb79f76fceae33fc84171203"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0efd0b9c564092f443ca97030d866ef1" id="r_a0efd0b9c564092f443ca97030d866ef1"><td class="memItemLeft" align="right" valign="top"><a id="a0efd0b9c564092f443ca97030d866ef1" name="a0efd0b9c564092f443ca97030d866ef1"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>t_depth</b></td></tr>
-<tr class="memdesc:a0efd0b9c564092f443ca97030d866ef1"><td class="mdescLeft">&#160;</td><td class="mdescRight">a vector to store the depth of a node, <br /></td></tr>
+<tr class="memitem:a0efd0b9c564092f443ca97030d866ef1" id="r_a0efd0b9c564092f443ca97030d866ef1"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0efd0b9c564092f443ca97030d866ef1">t_depth</a></td></tr>
+<tr class="memdesc:a0efd0b9c564092f443ca97030d866ef1"><td class="mdescLeft">&#160;</td><td class="mdescRight">a vector to store the depth of a node,  <br /></td></tr>
 <tr class="separator:a0efd0b9c564092f443ca97030d866ef1"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ada1494fccbc7f1f07b2f9be9f7e07ad5" id="r_ada1494fccbc7f1f07b2f9be9f7e07ad5"><td class="memItemLeft" align="right" valign="top"><a id="ada1494fccbc7f1f07b2f9be9f7e07ad5" name="ada1494fccbc7f1f07b2f9be9f7e07ad5"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>t_size</b></td></tr>
-<tr class="memdesc:ada1494fccbc7f1f07b2f9be9f7e07ad5"><td class="mdescLeft">&#160;</td><td class="mdescRight">a vector to store the subtree size rooted at node <br /></td></tr>
+<tr class="memitem:ada1494fccbc7f1f07b2f9be9f7e07ad5" id="r_ada1494fccbc7f1f07b2f9be9f7e07ad5"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ada1494fccbc7f1f07b2f9be9f7e07ad5">t_size</a></td></tr>
+<tr class="memdesc:ada1494fccbc7f1f07b2f9be9f7e07ad5"><td class="mdescLeft">&#160;</td><td class="mdescRight">a vector to store the subtree size rooted at node  <br /></td></tr>
 <tr class="separator:ada1494fccbc7f1f07b2f9be9f7e07ad5"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa6c37e840355b9fb2105181c578694e8" id="r_aa6c37e840355b9fb2105181c578694e8"><td class="memItemLeft" align="right" valign="top"><a id="aa6c37e840355b9fb2105181c578694e8" name="aa6c37e840355b9fb2105181c578694e8"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>t_root</b></td></tr>
-<tr class="memdesc:aa6c37e840355b9fb2105181c578694e8"><td class="mdescLeft">&#160;</td><td class="mdescRight">the root of the tree <br /></td></tr>
+<tr class="memitem:aa6c37e840355b9fb2105181c578694e8" id="r_aa6c37e840355b9fb2105181c578694e8"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa6c37e840355b9fb2105181c578694e8">t_root</a></td></tr>
+<tr class="memdesc:aa6c37e840355b9fb2105181c578694e8"><td class="mdescLeft">&#160;</td><td class="mdescRight">the root of the tree  <br /></td></tr>
 <tr class="separator:aa6c37e840355b9fb2105181c578694e8"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a135b7952593c9b1aae38fcaf1cc1abf7" id="r_a135b7952593c9b1aae38fcaf1cc1abf7"><td class="memItemLeft" align="right" valign="top"><a id="a135b7952593c9b1aae38fcaf1cc1abf7" name="a135b7952593c9b1aae38fcaf1cc1abf7"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; X &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>t_val</b></td></tr>
-<tr class="memdesc:a135b7952593c9b1aae38fcaf1cc1abf7"><td class="mdescLeft">&#160;</td><td class="mdescRight">values of nodes <br /></td></tr>
+<tr class="memitem:a135b7952593c9b1aae38fcaf1cc1abf7" id="r_a135b7952593c9b1aae38fcaf1cc1abf7"><td class="memItemLeft" align="right" valign="top">std::vector&lt; X &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a135b7952593c9b1aae38fcaf1cc1abf7">t_val</a></td></tr>
+<tr class="memdesc:a135b7952593c9b1aae38fcaf1cc1abf7"><td class="mdescLeft">&#160;</td><td class="mdescRight">values of nodes  <br /></td></tr>
 <tr class="separator:a135b7952593c9b1aae38fcaf1cc1abf7"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="friends" name="friends"></a>
 Friends</h2></td></tr>
-<tr class="memitem:afcdadbdea1e2391cebbb17d2c1ae2f0b" id="r_afcdadbdea1e2391cebbb17d2c1ae2f0b"><td class="memTemplParams" colspan="2"><a id="afcdadbdea1e2391cebbb17d2c1ae2f0b" name="afcdadbdea1e2391cebbb17d2c1ae2f0b"></a>
-template&lt;typename T &gt; </td></tr>
-<tr class="memitem:afcdadbdea1e2391cebbb17d2c1ae2f0b"><td class="memTemplItemLeft" align="right" valign="top">class&#160;</td><td class="memTemplItemRight" valign="bottom"><b>HLD</b></td></tr>
+<tr class="memitem:afcdadbdea1e2391cebbb17d2c1ae2f0b" id="r_afcdadbdea1e2391cebbb17d2c1ae2f0b"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
+<tr class="memitem:afcdadbdea1e2391cebbb17d2c1ae2f0b"><td class="memTemplItemLeft" align="right" valign="top">class&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#afcdadbdea1e2391cebbb17d2c1ae2f0b">HLD</a></td></tr>
 <tr class="separator:afcdadbdea1e2391cebbb17d2c1ae2f0b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -215,6 +223,8 @@ class range_queries::heavy_light_decomposition::Tree&lt; X &gt;</div><p>A Basic
   </dd>
 </dl>
 <p>Deleting the default constructor An instance can only be created with the number of nodes Defaults: t_node indexing are zero based t_root is 0 depth of root_node is 0 Supports: lift :- lift a node k units up the tree kth_ancestor :- returns the kth ancestor lca :- returns the least common ancestor </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00078">78</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a835fb2bbb27307b8cacad9b287968bc1" name="a835fb2bbb27307b8cacad9b287968bc1"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a835fb2bbb27307b8cacad9b287968bc1">&#9670;&#160;</a></span>Tree()</h2>
@@ -248,33 +258,26 @@ template&lt;typename X &gt; </div>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">  141</span>      : <a class="code hl_variable" href="#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>(nodes), <a class="code hl_variable" href="#ab2ab020f798d00be2613ecf63074b7c1">t_maxlift</a>(<span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/floor.html">floor</a>(log2(nodes))) + 1) {</div>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00140">140</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  141</span>      : <a class="code hl_variable" href="#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>(nodes), <a class="code hl_variable" href="#ab2ab020f798d00be2613ecf63074b7c1">t_maxlift</a>(<span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(floor(log2(nodes))) + 1) {</div>
 <div class="line"><span class="lineno">  142</span>    <span class="comment">/* Initialize and resize all the vectors */</span></div>
 <div class="line"><span class="lineno">  143</span>    <a class="code hl_variable" href="#aa6c37e840355b9fb2105181c578694e8">t_root</a> = 0; <span class="comment">/* Default */</span></div>
-<div class="line"><span class="lineno">  144</span>    <a class="code hl_variable" href="#ab1aeaefa1bd97b867c652ba916fbdb43">t_adj</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/resize.html">resize</a>(<a class="code hl_variable" href="#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>);</div>
-<div class="line"><span class="lineno">  145</span>    <a class="code hl_variable" href="#a350157a5fb79f76fceae33fc84171203">t_par</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/assign.html">assign</a>(<a class="code hl_variable" href="#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(<a class="code hl_variable" href="#ab2ab020f798d00be2613ecf63074b7c1">t_maxlift</a>, -1));</div>
-<div class="line"><span class="lineno">  146</span>    <a class="code hl_variable" href="#a0efd0b9c564092f443ca97030d866ef1">t_depth</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/assign.html">assign</a>(<a class="code hl_variable" href="#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>, 0);</div>
-<div class="line"><span class="lineno">  147</span>    <a class="code hl_variable" href="#ada1494fccbc7f1f07b2f9be9f7e07ad5">t_size</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/assign.html">assign</a>(<a class="code hl_variable" href="#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>, 1);</div>
-<div class="line"><span class="lineno">  148</span>    <a class="code hl_variable" href="#a135b7952593c9b1aae38fcaf1cc1abf7">t_val</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/resize.html">resize</a>(<a class="code hl_variable" href="#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>);</div>
+<div class="line"><span class="lineno">  144</span>    <a class="code hl_variable" href="#ab1aeaefa1bd97b867c652ba916fbdb43">t_adj</a>.resize(<a class="code hl_variable" href="#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>);</div>
+<div class="line"><span class="lineno">  145</span>    <a class="code hl_variable" href="#a350157a5fb79f76fceae33fc84171203">t_par</a>.assign(<a class="code hl_variable" href="#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>, std::vector&lt;int&gt;(<a class="code hl_variable" href="#ab2ab020f798d00be2613ecf63074b7c1">t_maxlift</a>, -1));</div>
+<div class="line"><span class="lineno">  146</span>    <a class="code hl_variable" href="#a0efd0b9c564092f443ca97030d866ef1">t_depth</a>.assign(<a class="code hl_variable" href="#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>, 0);</div>
+<div class="line"><span class="lineno">  147</span>    <a class="code hl_variable" href="#ada1494fccbc7f1f07b2f9be9f7e07ad5">t_size</a>.assign(<a class="code hl_variable" href="#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>, 1);</div>
+<div class="line"><span class="lineno">  148</span>    <a class="code hl_variable" href="#a135b7952593c9b1aae38fcaf1cc1abf7">t_val</a>.resize(<a class="code hl_variable" href="#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>);</div>
 <div class="line"><span class="lineno">  149</span>  }</div>
-<div class="ttc" id="aassign_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/assign.html">std::vector::assign</a></div><div class="ttdeci">T assign(T... args)</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a0efd0b9c564092f443ca97030d866ef1"><div class="ttname"><a href="#a0efd0b9c564092f443ca97030d866ef1">range_queries::heavy_light_decomposition::Tree::t_depth</a></div><div class="ttdeci">std::vector&lt; int &gt; t_depth</div><div class="ttdoc">a vector to store the depth of a node,</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:88</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a135b7952593c9b1aae38fcaf1cc1abf7"><div class="ttname"><a href="#a135b7952593c9b1aae38fcaf1cc1abf7">range_queries::heavy_light_decomposition::Tree::t_val</a></div><div class="ttdeci">std::vector&lt; X &gt; t_val</div><div class="ttdoc">values of nodes</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:92</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a350157a5fb79f76fceae33fc84171203"><div class="ttname"><a href="#a350157a5fb79f76fceae33fc84171203">range_queries::heavy_light_decomposition::Tree::t_par</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; t_par</div><div class="ttdoc">a matrix to store every node's 2^kth parent</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:87</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_aa6c37e840355b9fb2105181c578694e8"><div class="ttname"><a href="#aa6c37e840355b9fb2105181c578694e8">range_queries::heavy_light_decomposition::Tree::t_root</a></div><div class="ttdeci">int t_root</div><div class="ttdoc">the root of the tree</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:91</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ab1aeaefa1bd97b867c652ba916fbdb43"><div class="ttname"><a href="#ab1aeaefa1bd97b867c652ba916fbdb43">range_queries::heavy_light_decomposition::Tree::t_adj</a></div><div class="ttdeci">std::vector&lt; std::list&lt; int &gt; &gt; t_adj</div><div class="ttdoc">an adjacency list to stores the tree edges</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:83</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ab2ab020f798d00be2613ecf63074b7c1"><div class="ttname"><a href="#ab2ab020f798d00be2613ecf63074b7c1">range_queries::heavy_light_decomposition::Tree::t_maxlift</a></div><div class="ttdeci">const int t_maxlift</div><div class="ttdoc">maximum possible height of the tree</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:85</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ada1494fccbc7f1f07b2f9be9f7e07ad5"><div class="ttname"><a href="#ada1494fccbc7f1f07b2f9be9f7e07ad5">range_queries::heavy_light_decomposition::Tree::t_size</a></div><div class="ttdeci">std::vector&lt; int &gt; t_size</div><div class="ttdoc">a vector to store the subtree size rooted at node</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:89</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ae4630fa70a80a1dc65a875488a67178a"><div class="ttname"><a href="#ae4630fa70a80a1dc65a875488a67178a">range_queries::heavy_light_decomposition::Tree::t_nodes</a></div><div class="ttdeci">const int t_nodes</div><div class="ttdoc">number of nodes</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:84</div></div>
-<div class="ttc" id="afloor_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/floor.html">std::floor</a></div><div class="ttdeci">T floor(T... args)</div></div>
-<div class="ttc" id="aresize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/resize.html">std::vector::resize</a></div><div class="ttdeci">T resize(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph.svg" width="334" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a0efd0b9c564092f443ca97030d866ef1"><div class="ttname"><a href="#a0efd0b9c564092f443ca97030d866ef1">range_queries::heavy_light_decomposition::Tree::t_depth</a></div><div class="ttdeci">std::vector&lt; int &gt; t_depth</div><div class="ttdoc">a vector to store the depth of a node,</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00088">heavy_light_decomposition.cpp:88</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a135b7952593c9b1aae38fcaf1cc1abf7"><div class="ttname"><a href="#a135b7952593c9b1aae38fcaf1cc1abf7">range_queries::heavy_light_decomposition::Tree::t_val</a></div><div class="ttdeci">std::vector&lt; X &gt; t_val</div><div class="ttdoc">values of nodes</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00092">heavy_light_decomposition.cpp:92</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a350157a5fb79f76fceae33fc84171203"><div class="ttname"><a href="#a350157a5fb79f76fceae33fc84171203">range_queries::heavy_light_decomposition::Tree::t_par</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; t_par</div><div class="ttdoc">a matrix to store every node's 2^kth parent</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00087">heavy_light_decomposition.cpp:87</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_aa6c37e840355b9fb2105181c578694e8"><div class="ttname"><a href="#aa6c37e840355b9fb2105181c578694e8">range_queries::heavy_light_decomposition::Tree::t_root</a></div><div class="ttdeci">int t_root</div><div class="ttdoc">the root of the tree</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00091">heavy_light_decomposition.cpp:91</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ab1aeaefa1bd97b867c652ba916fbdb43"><div class="ttname"><a href="#ab1aeaefa1bd97b867c652ba916fbdb43">range_queries::heavy_light_decomposition::Tree::t_adj</a></div><div class="ttdeci">std::vector&lt; std::list&lt; int &gt; &gt; t_adj</div><div class="ttdoc">an adjacency list to stores the tree edges</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00083">heavy_light_decomposition.cpp:83</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ab2ab020f798d00be2613ecf63074b7c1"><div class="ttname"><a href="#ab2ab020f798d00be2613ecf63074b7c1">range_queries::heavy_light_decomposition::Tree::t_maxlift</a></div><div class="ttdeci">const int t_maxlift</div><div class="ttdoc">maximum possible height of the tree</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00085">heavy_light_decomposition.cpp:85</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ada1494fccbc7f1f07b2f9be9f7e07ad5"><div class="ttname"><a href="#ada1494fccbc7f1f07b2f9be9f7e07ad5">range_queries::heavy_light_decomposition::Tree::t_size</a></div><div class="ttdeci">std::vector&lt; int &gt; t_size</div><div class="ttdoc">a vector to store the subtree size rooted at node</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00089">heavy_light_decomposition.cpp:89</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ae4630fa70a80a1dc65a875488a67178a"><div class="ttname"><a href="#ae4630fa70a80a1dc65a875488a67178a">range_queries::heavy_light_decomposition::Tree::t_nodes</a></div><div class="ttdeci">const int t_nodes</div><div class="ttdoc">number of nodes</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00084">heavy_light_decomposition.cpp:84</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Function Documentation</h2>
@@ -316,17 +319,13 @@ template&lt;typename X &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  157</span>                                          {</div>
-<div class="line"><span class="lineno">  158</span>    <a class="code hl_variable" href="#ab1aeaefa1bd97b867c652ba916fbdb43">t_adj</a>[u].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(v);</div>
-<div class="line"><span class="lineno">  159</span>    <a class="code hl_variable" href="#ab1aeaefa1bd97b867c652ba916fbdb43">t_adj</a>[v].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(u);</div>
-<div class="line"><span class="lineno">  160</span>  }</div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-</div><!-- 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="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph.svg" width="359" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00157">157</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  157</span>                                          {</div>
+<div class="line"><span class="lineno">  158</span>    <a class="code hl_variable" href="#ab1aeaefa1bd97b867c652ba916fbdb43">t_adj</a>[u].push_back(v);</div>
+<div class="line"><span class="lineno">  159</span>    <a class="code hl_variable" href="#ab1aeaefa1bd97b867c652ba916fbdb43">t_adj</a>[v].push_back(u);</div>
+<div class="line"><span class="lineno">  160</span>  }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ab916d554afa8ca5230b4310c2c69fae0" name="ab916d554afa8ca5230b4310c2c69fae0"></a>
@@ -362,6 +361,8 @@ template&lt;typename X &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00167">167</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  167</span>{ <a class="code hl_variable" href="#aa6c37e840355b9fb2105181c578694e8">t_root</a> = new_root; }</div>
 </div><!-- fragment -->
 </div>
@@ -404,6 +405,8 @@ template&lt;typename X &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00116">116</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  116</span>                                  {</div>
 <div class="line"><span class="lineno">  117</span>    <a class="code hl_variable" href="#a350157a5fb79f76fceae33fc84171203">t_par</a>[u][0] = p;</div>
 <div class="line"><span class="lineno">  118</span>    <span class="keywordflow">if</span> (p != -1) {</div>
@@ -421,14 +424,9 @@ template&lt;typename X &gt; </div>
 <div class="line"><span class="lineno">  130</span>      }</div>
 <div class="line"><span class="lineno">  131</span>    }</div>
 <div class="line"><span class="lineno">  132</span>  }</div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ae8de7aefcb6635d3dacdd174cd4890c4"><div class="ttname"><a href="#ae8de7aefcb6635d3dacdd174cd4890c4">range_queries::heavy_light_decomposition::Tree::dfs_lca</a></div><div class="ttdeci">void dfs_lca(int u, int p=-1)</div><div class="ttdoc">Utility function to populate the t_par vector.</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:116</div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae8de7aefcb6635d3dacdd174cd4890c4_cgraph.svg" width="156" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ae8de7aefcb6635d3dacdd174cd4890c4"><div class="ttname"><a href="#ae8de7aefcb6635d3dacdd174cd4890c4">range_queries::heavy_light_decomposition::Tree::dfs_lca</a></div><div class="ttdeci">void dfs_lca(int u, int p=-1)</div><div class="ttdoc">Utility function to populate the t_par vector.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00116">heavy_light_decomposition.cpp:116</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa339c31ec74cd86a4842a8b09653d460" name="aa339c31ec74cd86a4842a8b09653d460"></a>
@@ -470,6 +468,8 @@ template&lt;typename X &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00101">101</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  101</span>                                   {</div>
 <div class="line"><span class="lineno">  102</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> &amp;v : <a class="code hl_variable" href="#ab1aeaefa1bd97b867c652ba916fbdb43">t_adj</a>[u]) {</div>
 <div class="line"><span class="lineno">  103</span>      <span class="keywordflow">if</span> (v ^ p) {</div>
@@ -478,13 +478,8 @@ template&lt;typename X &gt; </div>
 <div class="line"><span class="lineno">  106</span>      }</div>
 <div class="line"><span class="lineno">  107</span>    }</div>
 <div class="line"><span class="lineno">  108</span>  }</div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_aa339c31ec74cd86a4842a8b09653d460"><div class="ttname"><a href="#aa339c31ec74cd86a4842a8b09653d460">range_queries::heavy_light_decomposition::Tree::dfs_size</a></div><div class="ttdeci">void dfs_size(int u, int p=-1)</div><div class="ttdoc">Utility function to compute sub-tree sizes.</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:101</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_aa339c31ec74cd86a4842a8b09653d460_cgraph.svg" width="156" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_aa339c31ec74cd86a4842a8b09653d460"><div class="ttname"><a href="#aa339c31ec74cd86a4842a8b09653d460">range_queries::heavy_light_decomposition::Tree::dfs_size</a></div><div class="ttdeci">void dfs_size(int u, int p=-1)</div><div class="ttdoc">Utility function to compute sub-tree sizes.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00101">heavy_light_decomposition.cpp:101</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad22d760a5a33545a70e7ea5e1786c8dc" name="ad22d760a5a33545a70e7ea5e1786c8dc"></a>
@@ -514,17 +509,14 @@ template&lt;typename X &gt; </div>
 
 <p>This function must be called after the tree adjacency list and node values are populated The function initializes the required parameters, and populates the segment tree. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00186">186</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  186</span>              {</div>
 <div class="line"><span class="lineno">  187</span>    assert(<a class="code hl_variable" href="#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a> &gt; 0);</div>
 <div class="line"><span class="lineno">  188</span>    <a class="code hl_function" href="#aa339c31ec74cd86a4842a8b09653d460">dfs_size</a>(<a class="code hl_variable" href="#aa6c37e840355b9fb2105181c578694e8">t_root</a>);</div>
 <div class="line"><span class="lineno">  189</span>    <a class="code hl_function" href="#ae8de7aefcb6635d3dacdd174cd4890c4">dfs_lca</a>(<a class="code hl_variable" href="#aa6c37e840355b9fb2105181c578694e8">t_root</a>);</div>
 <div class="line"><span class="lineno">  190</span>  }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ad22d760a5a33545a70e7ea5e1786c8dc_cgraph.svg" width="350" height="195"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a8f7bca1746d40f21ad832fcea59aa6c6" name="a8f7bca1746d40f21ad832fcea59aa6c6"></a>
@@ -565,17 +557,14 @@ template&lt;typename X &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the kth ancestor of node </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00218">218</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  218</span>                                           {</div>
 <div class="line"><span class="lineno">  219</span>    <a class="code hl_function" href="#ac7761255f2ba06b398b9aae5e4dce5f3">lift</a>(&amp;p, dist);</div>
 <div class="line"><span class="lineno">  220</span>    <span class="keywordflow">return</span> p;</div>
 <div class="line"><span class="lineno">  221</span>  }</div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ac7761255f2ba06b398b9aae5e4dce5f3"><div class="ttname"><a href="#ac7761255f2ba06b398b9aae5e4dce5f3">range_queries::heavy_light_decomposition::Tree::lift</a></div><div class="ttdeci">void lift(int *const p, int dist)</div><div class="ttdoc">The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:200</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a8f7bca1746d40f21ad832fcea59aa6c6_cgraph.svg" width="350" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ac7761255f2ba06b398b9aae5e4dce5f3"><div class="ttname"><a href="#ac7761255f2ba06b398b9aae5e4dce5f3">range_queries::heavy_light_decomposition::Tree::lift</a></div><div class="ttdeci">void lift(int *const p, int dist)</div><div class="ttdoc">The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00200">heavy_light_decomposition.cpp:200</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae2b407e64aaf9878fbee7ee6efe9c7d4" name="ae2b407e64aaf9878fbee7ee6efe9c7d4"></a>
@@ -616,6 +605,8 @@ template&lt;typename X &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the least common ancestor of node a, and node b </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00229">229</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  229</span>                        {</div>
 <div class="line"><span class="lineno">  230</span>    assert(a &gt;= 0 and b &gt;= 0 and a &lt; <a class="code hl_variable" href="#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a> and b &lt; <a class="code hl_variable" href="#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>);</div>
 <div class="line"><span class="lineno">  231</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a0efd0b9c564092f443ca97030d866ef1">t_depth</a>[a] &gt; <a class="code hl_variable" href="#a0efd0b9c564092f443ca97030d866ef1">t_depth</a>[b]) {</div>
@@ -635,12 +626,7 @@ template&lt;typename X &gt; </div>
 <div class="line"><span class="lineno">  245</span>    }</div>
 <div class="line"><span class="lineno">  246</span>    <span class="keywordflow">return</span> <a class="code hl_variable" href="#a350157a5fb79f76fceae33fc84171203">t_par</a>[a][0];</div>
 <div class="line"><span class="lineno">  247</span>  }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae2b407e64aaf9878fbee7ee6efe9c7d4_cgraph.svg" width="350" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac7761255f2ba06b398b9aae5e4dce5f3" name="ac7761255f2ba06b398b9aae5e4dce5f3"></a>
@@ -681,6 +667,8 @@ template&lt;typename X &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00200">200</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  200</span>                                    {</div>
 <div class="line"><span class="lineno">  201</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> &lt; <a class="code hl_variable" href="#ab2ab020f798d00be2613ecf63074b7c1">t_maxlift</a>; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++) {</div>
 <div class="line"><span class="lineno">  202</span>      <span class="keywordflow">if</span> (*p == -1) {</div>
@@ -709,7 +697,7 @@ template&lt;typename X &gt; </div>
         <tr>
           <td class="memname">void <a class="el" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">range_queries::heavy_light_decomposition::Tree</a>&lt; X &gt;::set_node_val </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; X &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>node_val</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; X &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>node_val</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -728,21 +716,271 @@ template&lt;typename X &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00175">175</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  175</span>                                                  {</div>
-<div class="line"><span class="lineno">  176</span>    assert(<span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(node_val.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()) == <a class="code hl_variable" href="#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>);</div>
+<div class="line"><span class="lineno">  176</span>    assert(<span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(node_val.size()) == <a class="code hl_variable" href="#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>);</div>
 <div class="line"><span class="lineno">  177</span>    <a class="code hl_variable" href="#a135b7952593c9b1aae38fcaf1cc1abf7">t_val</a> = node_val;</div>
 <div class="line"><span class="lineno">  178</span>  }</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><!-- 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="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph.svg" width="320" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Friends And Related Symbol Documentation</h2>
+<a id="afcdadbdea1e2391cebbb17d2c1ae2f0b" name="afcdadbdea1e2391cebbb17d2c1ae2f0b"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#afcdadbdea1e2391cebbb17d2c1ae2f0b">&#9670;&#160;</a></span>HLD</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename X &gt; </div>
+<div class="memtemplate">
+template&lt;typename T &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">friend class <a class="el" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">HLD</a></td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">friend</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00093">93</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
+
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="ab1aeaefa1bd97b867c652ba916fbdb43" name="ab1aeaefa1bd97b867c652ba916fbdb43"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ab1aeaefa1bd97b867c652ba916fbdb43">&#9670;&#160;</a></span>t_adj</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename X &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::list&lt;int&gt; &gt; <a class="el" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">range_queries::heavy_light_decomposition::Tree</a>&lt; X &gt;::t_adj</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>an adjacency list to stores the tree edges </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00083">83</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a0efd0b9c564092f443ca97030d866ef1" name="a0efd0b9c564092f443ca97030d866ef1"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a0efd0b9c564092f443ca97030d866ef1">&#9670;&#160;</a></span>t_depth</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename X &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;int&gt; <a class="el" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">range_queries::heavy_light_decomposition::Tree</a>&lt; X &gt;::t_depth</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>a vector to store the depth of a node, </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00088">88</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ab2ab020f798d00be2613ecf63074b7c1" name="ab2ab020f798d00be2613ecf63074b7c1"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ab2ab020f798d00be2613ecf63074b7c1">&#9670;&#160;</a></span>t_maxlift</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename X &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">const int <a class="el" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">range_queries::heavy_light_decomposition::Tree</a>&lt; X &gt;::t_maxlift</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>maximum possible height of the tree </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00085">85</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ae4630fa70a80a1dc65a875488a67178a" name="ae4630fa70a80a1dc65a875488a67178a"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ae4630fa70a80a1dc65a875488a67178a">&#9670;&#160;</a></span>t_nodes</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename X &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">const int <a class="el" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">range_queries::heavy_light_decomposition::Tree</a>&lt; X &gt;::t_nodes</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>number of nodes </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00084">84</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a350157a5fb79f76fceae33fc84171203" name="a350157a5fb79f76fceae33fc84171203"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a350157a5fb79f76fceae33fc84171203">&#9670;&#160;</a></span>t_par</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename X &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::vector&lt;int&gt; &gt; <a class="el" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">range_queries::heavy_light_decomposition::Tree</a>&lt; X &gt;::t_par</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>a matrix to store every node's 2^kth parent </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00087">87</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
+
+</div>
+</div>
+<a id="aa6c37e840355b9fb2105181c578694e8" name="aa6c37e840355b9fb2105181c578694e8"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aa6c37e840355b9fb2105181c578694e8">&#9670;&#160;</a></span>t_root</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename X &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int <a class="el" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">range_queries::heavy_light_decomposition::Tree</a>&lt; X &gt;::t_root</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>the root of the tree </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00091">91</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ada1494fccbc7f1f07b2f9be9f7e07ad5" name="ada1494fccbc7f1f07b2f9be9f7e07ad5"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ada1494fccbc7f1f07b2f9be9f7e07ad5">&#9670;&#160;</a></span>t_size</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename X &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;int&gt; <a class="el" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">range_queries::heavy_light_decomposition::Tree</a>&lt; X &gt;::t_size</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>a vector to store the subtree size rooted at node </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00089">89</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a135b7952593c9b1aae38fcaf1cc1abf7" name="a135b7952593c9b1aae38fcaf1cc1abf7"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a135b7952593c9b1aae38fcaf1cc1abf7">&#9670;&#160;</a></span>t_val</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename X &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;X&gt; <a class="el" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">range_queries::heavy_light_decomposition::Tree</a>&lt; X &gt;::t_val</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>values of nodes </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00092">92</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>range_queries/<a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp.html">heavy_light_decomposition.cpp</a></li>
+<li>range_queries/<a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph.map b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph.map
deleted file mode 100644
index f1996b57b..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="range_queries::heavy_light_decomposition::Tree::set_node_val" name="range_queries::heavy_light_decomposition::Tree::set_node_val">
-<area shape="rect" id="Node000001" title="Set the values for all the nodes." alt="" coords="5,5,151,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="199,20,314,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="151,30,183,30,183,36,151,36"/>
-</map>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph.md5 b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph.md5
deleted file mode 100644
index 0a60f3b70..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-54f8dbe3fe49e60c8535682668e39af6
\ No newline at end of file
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph.svg b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph.svg
deleted file mode 100644
index 30bb46bdf..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::Tree::set_node_val Pages: 1 -->
-<svg width="240pt" height="50pt"
- viewBox="0.00 0.00 239.50 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>range_queries::heavy_light_decomposition::Tree::set_node_val</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Set the values for all the nodes.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::set_node_val</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.5,-30.5 145,-30.5 145,-11.25 231.5,-11.25 231.5,-30.5"/>
-<text text-anchor="middle" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.47,-20.88C117.39,-20.88 125.56,-20.88 133.48,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.34,-24.38 143.34,-20.88 133.34,-17.38 133.34,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph_org.svg b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph_org.svg
deleted file mode 100644
index 282282de9..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a04cd96efaba147b19d3afc769b90ff70_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::Tree::set_node_val Pages: 1 -->
-<svg width="240pt" height="50pt"
- viewBox="0.00 0.00 239.50 49.75" 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.75)">
-<title>range_queries::heavy_light_decomposition::Tree::set_node_val</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Set the values for all the nodes.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::set_node_val</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.5,-30.5 145,-30.5 145,-11.25 231.5,-11.25 231.5,-30.5"/>
-<text text-anchor="middle" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.47,-20.88C117.39,-20.88 125.56,-20.88 133.48,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.34,-24.38 143.34,-20.88 133.34,-17.38 133.34,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph.map b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph.map
deleted file mode 100644
index 955a9834d..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="range_queries::heavy_light_decomposition::Tree::add_edge" name="range_queries::heavy_light_decomposition::Tree::add_edge">
-<area shape="rect" id="Node000001" title="Adds an undirected edge from node u to node v in the tree." alt="" coords="5,5,151,61"/>
-<area shape="rect" id="Node000002" 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="199,20,353,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="151,30,183,30,183,36,151,36"/>
-</map>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph.md5 b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph.md5
deleted file mode 100644
index 16092a568..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b79aa303a4141b8a1f0846c9a1e57900
\ No newline at end of file
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph.svg b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph.svg
deleted file mode 100644
index 231039367..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::Tree::add_edge Pages: 1 -->
-<svg width="269pt" height="50pt"
- viewBox="0.00 0.00 268.75 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>range_queries::heavy_light_decomposition::Tree::add_edge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Adds an undirected edge from node u to node v in the tree.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.75,-30.5 145,-30.5 145,-11.25 260.75,-11.25 260.75,-30.5"/>
-<text text-anchor="middle" x="202.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.17,-20.88C117.05,-20.88 125.25,-20.88 133.37,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.25,-24.38 143.25,-20.88 133.25,-17.38 133.25,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph_org.svg b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph_org.svg
deleted file mode 100644
index e4880be68..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a79ab4601c4a95c0902ac04e779e5f54d_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::Tree::add_edge Pages: 1 -->
-<svg width="269pt" height="50pt"
- viewBox="0.00 0.00 268.75 49.75" 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.75)">
-<title>range_queries::heavy_light_decomposition::Tree::add_edge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Adds an undirected edge from node u to node v in the tree.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.75,-30.5 145,-30.5 145,-11.25 260.75,-11.25 260.75,-30.5"/>
-<text text-anchor="middle" x="202.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.17,-20.88C117.05,-20.88 125.25,-20.88 133.37,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.25,-24.38 143.25,-20.88 133.25,-17.38 133.25,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph.map b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph.map
deleted file mode 100644
index 4abd0976d..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="range_queries::heavy_light_decomposition::Tree::Tree" name="range_queries::heavy_light_decomposition::Tree::Tree">
-<area shape="rect" id="Node000001" title="Class parameterized constructor, resizes the and initializes the data members." alt="" coords="5,16,151,71"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/assign.html#" title=" " alt="" coords="199,5,328,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="151,31,183,26,184,32,151,36"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="200,55,326,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="151,50,185,55,185,60,151,56"/>
-</map>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph.md5 b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph.md5
deleted file mode 100644
index b405d8fe6..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fab3ab37596d36e063e33dbb1f5b1797
\ No newline at end of file
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph.svg b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph.svg
deleted file mode 100644
index 379b14539..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::Tree::Tree Pages: 1 -->
-<svg width="250pt" height="64pt"
- viewBox="0.00 0.00 250.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>range_queries::heavy_light_decomposition::Tree::Tree</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Class parameterized constructor, resizes the and initializes the data members.">
-<polygon fill="#999999" stroke="#666666" points="109,-48.5 0,-48.5 0,-6.75 109,-6.75 109,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::Tree</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/assign.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242,-56.25 145,-56.25 145,-37 242,-37 242,-56.25"/>
-<text text-anchor="middle" x="193.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::assign</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.25,-35.08C117.2,-36.18 125.43,-37.32 133.48,-38.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.8,-41.88 143.19,-39.79 133.77,-34.95 132.8,-41.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="240.88,-19.25 146.12,-19.25 146.12,0 240.88,0 240.88,-19.25"/>
-<text text-anchor="middle" x="193.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.25,-20.56C117.6,-19.47 126.26,-18.33 134.69,-17.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.05,-20.7 144.51,-15.93 134.13,-13.76 135.05,-20.7"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph_org.svg b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph_org.svg
deleted file mode 100644
index 9dc5e335e..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a835fb2bbb27307b8cacad9b287968bc1_cgraph_org.svg
+++ /dev/null
@@ -1,59 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::Tree::Tree Pages: 1 -->
-<svg width="250pt" height="64pt"
- viewBox="0.00 0.00 250.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>range_queries::heavy_light_decomposition::Tree::Tree</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Class parameterized constructor, resizes the and initializes the data members.">
-<polygon fill="#999999" stroke="#666666" points="109,-48.5 0,-48.5 0,-6.75 109,-6.75 109,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::Tree</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/assign.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242,-56.25 145,-56.25 145,-37 242,-37 242,-56.25"/>
-<text text-anchor="middle" x="193.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::assign</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.25,-35.08C117.2,-36.18 125.43,-37.32 133.48,-38.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.8,-41.88 143.19,-39.79 133.77,-34.95 132.8,-41.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="240.88,-19.25 146.12,-19.25 146.12,0 240.88,0 240.88,-19.25"/>
-<text text-anchor="middle" x="193.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.25,-20.56C117.6,-19.47 126.26,-18.33 134.69,-17.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.05,-20.7 144.51,-15.93 134.13,-13.76 135.05,-20.7"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a8f7bca1746d40f21ad832fcea59aa6c6_cgraph.map b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a8f7bca1746d40f21ad832fcea59aa6c6_cgraph.map
deleted file mode 100644
index 9d99851d6..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a8f7bca1746d40f21ad832fcea59aa6c6_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="range_queries::heavy_light_decomposition::Tree::kth_ancestor" name="range_queries::heavy_light_decomposition::Tree::kth_ancestor">
-<area shape="rect" id="Node000001" title="The function returns the kth ancestor of a node." alt="" coords="5,5,151,61"/>
-<area shape="rect" id="Node000002" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store..." alt="" coords="199,5,344,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="151,30,183,30,183,36,151,36"/>
-</map>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a8f7bca1746d40f21ad832fcea59aa6c6_cgraph.md5 b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a8f7bca1746d40f21ad832fcea59aa6c6_cgraph.md5
deleted file mode 100644
index 56e3d853e..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a8f7bca1746d40f21ad832fcea59aa6c6_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-093b14b9a27dc86f50fa4a806ce6bbe3
\ No newline at end of file
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a8f7bca1746d40f21ad832fcea59aa6c6_cgraph.svg b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a8f7bca1746d40f21ad832fcea59aa6c6_cgraph.svg
deleted file mode 100644
index 615de9780..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a8f7bca1746d40f21ad832fcea59aa6c6_cgraph.svg
+++ /dev/null
@@ -1,69 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::Tree::kth_ancestor Pages: 1 -->
-<svg width="262pt" height="50pt"
- viewBox="0.00 0.00 262.00 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>range_queries::heavy_light_decomposition::Tree::kth_ancestor</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The function returns the kth ancestor of a node.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::kth_ancestor</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="254,-41.75 145,-41.75 145,0 254,0 254,-41.75"/>
-<text text-anchor="start" x="153" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-20.88C117.02,-20.88 125.19,-20.88 133.26,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.03,-24.38 143.03,-20.88 133.03,-17.38 133.03,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a8f7bca1746d40f21ad832fcea59aa6c6_cgraph_org.svg b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a8f7bca1746d40f21ad832fcea59aa6c6_cgraph_org.svg
deleted file mode 100644
index 3ff1b1129..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_a8f7bca1746d40f21ad832fcea59aa6c6_cgraph_org.svg
+++ /dev/null
@@ -1,43 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::Tree::kth_ancestor Pages: 1 -->
-<svg width="262pt" height="50pt"
- viewBox="0.00 0.00 262.00 49.75" 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.75)">
-<title>range_queries::heavy_light_decomposition::Tree::kth_ancestor</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The function returns the kth ancestor of a node.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::kth_ancestor</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="254,-41.75 145,-41.75 145,0 254,0 254,-41.75"/>
-<text text-anchor="start" x="153" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-20.88C117.02,-20.88 125.19,-20.88 133.26,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.03,-24.38 143.03,-20.88 133.03,-17.38 133.03,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_aa339c31ec74cd86a4842a8b09653d460_cgraph.map b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_aa339c31ec74cd86a4842a8b09653d460_cgraph.map
deleted file mode 100644
index 53cb0d607..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_aa339c31ec74cd86a4842a8b09653d460_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="range_queries::heavy_light_decomposition::Tree::dfs_size" name="range_queries::heavy_light_decomposition::Tree::dfs_size">
-<area shape="rect" id="Node000001" title="Utility function to compute sub&#45;tree sizes." alt="" coords="5,29,151,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="49,29,49,19,54,10,64,5,78,3,94,5,103,12,100,16,92,10,78,8,66,10,58,14,54,21,54,29"/>
-</map>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_aa339c31ec74cd86a4842a8b09653d460_cgraph.md5 b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_aa339c31ec74cd86a4842a8b09653d460_cgraph.md5
deleted file mode 100644
index f84ac416e..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_aa339c31ec74cd86a4842a8b09653d460_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-745737504e7e3aa878530af74b0b67b6
\ No newline at end of file
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_aa339c31ec74cd86a4842a8b09653d460_cgraph.svg b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_aa339c31ec74cd86a4842a8b09653d460_cgraph.svg
deleted file mode 100644
index af6357a65..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_aa339c31ec74cd86a4842a8b09653d460_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::Tree::dfs_size Pages: 1 -->
-<svg width="117pt" height="68pt"
- viewBox="0.00 0.00 117.00 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>range_queries::heavy_light_decomposition::Tree::dfs_size</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.38,-42.07C32.47,-51.55 39.17,-59.75 54.5,-59.75 63.12,-59.75 69.02,-57.16 72.18,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.58,-54.06 74.29,-43.55 68.74,-52.57 75.58,-54.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_aa339c31ec74cd86a4842a8b09653d460_cgraph_org.svg b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_aa339c31ec74cd86a4842a8b09653d460_cgraph_org.svg
deleted file mode 100644
index ebf74251a..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_aa339c31ec74cd86a4842a8b09653d460_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::Tree::dfs_size Pages: 1 -->
-<svg width="117pt" height="68pt"
- viewBox="0.00 0.00 117.00 67.75" 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 63.75)">
-<title>range_queries::heavy_light_decomposition::Tree::dfs_size</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.38,-42.07C32.47,-51.55 39.17,-59.75 54.5,-59.75 63.12,-59.75 69.02,-57.16 72.18,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.58,-54.06 74.29,-43.55 68.74,-52.57 75.58,-54.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ad22d760a5a33545a70e7ea5e1786c8dc_cgraph.map b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ad22d760a5a33545a70e7ea5e1786c8dc_cgraph.map
deleted file mode 100644
index 8873b48dc..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ad22d760a5a33545a70e7ea5e1786c8dc_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="range_queries::heavy_light_decomposition::Tree::init" name="range_queries::heavy_light_decomposition::Tree::init">
-<area shape="rect" id="Node000001" title="This function must be called after the tree adjacency list and node values are populated The function..." alt="" coords="5,81,151,137"/>
-<area shape="rect" id="Node000002" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" title="Utility function to populate the t_par vector." alt="" coords="199,29,344,85"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="150,87,183,78,184,83,152,92"/>
-<area shape="rect" id="Node000003" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" title="Utility function to compute sub&#45;tree sizes." alt="" coords="199,133,344,189"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="152,126,184,135,183,140,150,131"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="233,29,233,19,240,10,253,5,271,3,292,5,304,12,302,17,290,10,271,8,254,10,244,15,238,21,238,29"/>
-<area shape="poly" id="edge4_Node000003_Node000003" title=" " alt="" coords="233,133,233,123,240,114,253,109,271,107,292,109,304,116,302,121,290,114,271,112,254,114,244,119,238,125,238,133"/>
-</map>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ad22d760a5a33545a70e7ea5e1786c8dc_cgraph.md5 b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ad22d760a5a33545a70e7ea5e1786c8dc_cgraph.md5
deleted file mode 100644
index 88ed04bc5..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ad22d760a5a33545a70e7ea5e1786c8dc_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a523e4f829d5617dffb0db014ca3075a
\ No newline at end of file
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ad22d760a5a33545a70e7ea5e1786c8dc_cgraph.svg b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ad22d760a5a33545a70e7ea5e1786c8dc_cgraph.svg
deleted file mode 100644
index 6b333207d..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ad22d760a5a33545a70e7ea5e1786c8dc_cgraph.svg
+++ /dev/null
@@ -1,107 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::Tree::init Pages: 1 -->
-<svg width="262pt" height="146pt"
- viewBox="0.00 0.00 262.00 145.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 141.75)">
-<title>range_queries::heavy_light_decomposition::Tree::init</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="#999999" stroke="#666666" points="109,-80.75 0,-80.75 0,-39 109,-39 109,-80.75"/>
-<text text-anchor="start" x="8" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="254,-119.75 145,-119.75 145,-78 254,-78 254,-119.75"/>
-<text text-anchor="start" x="153" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-74.51C117.11,-76.68 125.38,-78.93 133.53,-81.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.52,-84.51 143.08,-83.76 134.36,-77.75 132.52,-84.51"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="254,-41.75 145,-41.75 145,0 254,0 254,-41.75"/>
-<text text-anchor="start" x="153" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-45.24C117.11,-43.07 125.38,-40.82 133.53,-38.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.36,-42 143.08,-35.99 132.52,-35.24 134.36,-42"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.74,-120.07C170.19,-129.55 179.11,-137.75 199.5,-137.75 211.29,-137.75 219.24,-135.01 223.36,-130.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.66,-132.1 225.87,-121.53 219.9,-130.28 226.66,-132.1"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.74,-42.07C170.19,-51.55 179.11,-59.75 199.5,-59.75 211.29,-59.75 219.24,-57.01 223.36,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.66,-54.1 225.87,-43.53 219.9,-52.28 226.66,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ad22d760a5a33545a70e7ea5e1786c8dc_cgraph_org.svg b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ad22d760a5a33545a70e7ea5e1786c8dc_cgraph_org.svg
deleted file mode 100644
index 7ba847644..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ad22d760a5a33545a70e7ea5e1786c8dc_cgraph_org.svg
+++ /dev/null
@@ -1,81 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::Tree::init Pages: 1 -->
-<svg width="262pt" height="146pt"
- viewBox="0.00 0.00 262.00 145.75" 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 141.75)">
-<title>range_queries::heavy_light_decomposition::Tree::init</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="#999999" stroke="#666666" points="109,-80.75 0,-80.75 0,-39 109,-39 109,-80.75"/>
-<text text-anchor="start" x="8" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="254,-119.75 145,-119.75 145,-78 254,-78 254,-119.75"/>
-<text text-anchor="start" x="153" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-74.51C117.11,-76.68 125.38,-78.93 133.53,-81.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.52,-84.51 143.08,-83.76 134.36,-77.75 132.52,-84.51"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="254,-41.75 145,-41.75 145,0 254,0 254,-41.75"/>
-<text text-anchor="start" x="153" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-45.24C117.11,-43.07 125.38,-40.82 133.53,-38.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.36,-42 143.08,-35.99 132.52,-35.24 134.36,-42"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.74,-120.07C170.19,-129.55 179.11,-137.75 199.5,-137.75 211.29,-137.75 219.24,-135.01 223.36,-130.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.66,-132.1 225.87,-121.53 219.9,-130.28 226.66,-132.1"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.74,-42.07C170.19,-51.55 179.11,-59.75 199.5,-59.75 211.29,-59.75 219.24,-57.01 223.36,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.66,-54.1 225.87,-43.53 219.9,-52.28 226.66,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae2b407e64aaf9878fbee7ee6efe9c7d4_cgraph.map b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae2b407e64aaf9878fbee7ee6efe9c7d4_cgraph.map
deleted file mode 100644
index 8d61add4c..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae2b407e64aaf9878fbee7ee6efe9c7d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="range_queries::heavy_light_decomposition::Tree::lca" name="range_queries::heavy_light_decomposition::Tree::lca">
-<area shape="rect" id="Node000001" title="The function returns the least common ancestor of two nodes." alt="" coords="5,5,151,61"/>
-<area shape="rect" id="Node000002" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store..." alt="" coords="199,5,344,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="151,30,183,30,183,36,151,36"/>
-</map>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae2b407e64aaf9878fbee7ee6efe9c7d4_cgraph.md5 b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae2b407e64aaf9878fbee7ee6efe9c7d4_cgraph.md5
deleted file mode 100644
index e711ade9d..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae2b407e64aaf9878fbee7ee6efe9c7d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-442019a35b96d133c15dc0d249487ea4
\ No newline at end of file
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae2b407e64aaf9878fbee7ee6efe9c7d4_cgraph.svg b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae2b407e64aaf9878fbee7ee6efe9c7d4_cgraph.svg
deleted file mode 100644
index c841f0d9c..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae2b407e64aaf9878fbee7ee6efe9c7d4_cgraph.svg
+++ /dev/null
@@ -1,69 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::Tree::lca Pages: 1 -->
-<svg width="262pt" height="50pt"
- viewBox="0.00 0.00 262.00 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>range_queries::heavy_light_decomposition::Tree::lca</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="254,-41.75 145,-41.75 145,0 254,0 254,-41.75"/>
-<text text-anchor="start" x="153" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-20.88C117.02,-20.88 125.19,-20.88 133.26,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.03,-24.38 143.03,-20.88 133.03,-17.38 133.03,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae2b407e64aaf9878fbee7ee6efe9c7d4_cgraph_org.svg b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae2b407e64aaf9878fbee7ee6efe9c7d4_cgraph_org.svg
deleted file mode 100644
index 4b1ca139a..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae2b407e64aaf9878fbee7ee6efe9c7d4_cgraph_org.svg
+++ /dev/null
@@ -1,43 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::Tree::lca Pages: 1 -->
-<svg width="262pt" height="50pt"
- viewBox="0.00 0.00 262.00 49.75" 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.75)">
-<title>range_queries::heavy_light_decomposition::Tree::lca</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="254,-41.75 145,-41.75 145,0 254,0 254,-41.75"/>
-<text text-anchor="start" x="153" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-20.88C117.02,-20.88 125.19,-20.88 133.26,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.03,-24.38 143.03,-20.88 133.03,-17.38 133.03,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae8de7aefcb6635d3dacdd174cd4890c4_cgraph.map b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae8de7aefcb6635d3dacdd174cd4890c4_cgraph.map
deleted file mode 100644
index 47934fc53..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae8de7aefcb6635d3dacdd174cd4890c4_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="range_queries::heavy_light_decomposition::Tree::dfs_lca" name="range_queries::heavy_light_decomposition::Tree::dfs_lca">
-<area shape="rect" id="Node000001" title="Utility function to populate the t_par vector." alt="" coords="5,29,151,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="49,29,49,19,54,10,64,5,78,3,94,5,103,12,100,16,92,10,78,8,66,10,58,14,54,21,54,29"/>
-</map>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae8de7aefcb6635d3dacdd174cd4890c4_cgraph.md5 b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae8de7aefcb6635d3dacdd174cd4890c4_cgraph.md5
deleted file mode 100644
index 976a0d231..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae8de7aefcb6635d3dacdd174cd4890c4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9c3ed63ca77cff5b7dbda0e8af0c5c0b
\ No newline at end of file
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae8de7aefcb6635d3dacdd174cd4890c4_cgraph.svg b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae8de7aefcb6635d3dacdd174cd4890c4_cgraph.svg
deleted file mode 100644
index 1dc3f3ff6..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae8de7aefcb6635d3dacdd174cd4890c4_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::Tree::dfs_lca Pages: 1 -->
-<svg width="117pt" height="68pt"
- viewBox="0.00 0.00 117.00 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>range_queries::heavy_light_decomposition::Tree::dfs_lca</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.38,-42.07C32.47,-51.55 39.17,-59.75 54.5,-59.75 63.12,-59.75 69.02,-57.16 72.18,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.58,-54.06 74.29,-43.55 68.74,-52.57 75.58,-54.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae8de7aefcb6635d3dacdd174cd4890c4_cgraph_org.svg b/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae8de7aefcb6635d3dacdd174cd4890c4_cgraph_org.svg
deleted file mode 100644
index b7bb2bdf7..000000000
--- a/d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree_ae8de7aefcb6635d3dacdd174cd4890c4_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::Tree::dfs_lca Pages: 1 -->
-<svg width="117pt" height="68pt"
- viewBox="0.00 0.00 117.00 67.75" 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 63.75)">
-<title>range_queries::heavy_light_decomposition::Tree::dfs_lca</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.38,-42.07C32.47,-51.55 39.17,-59.75 54.5,-59.75 63.12,-59.75 69.02,-57.16 72.18,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.58,-54.06 74.29,-43.55 68.74,-52.57 75.58,-54.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.map b/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.map
index 7b6b3d202..81abd7652 100644
--- a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.map
+++ b/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.map
@@ -1,5 +1,5 @@
 <map id="std::is_arithmetic&lt; uint256_t &gt;" name="std::is_arithmetic&lt; uint256_t &gt;">
 <area shape="rect" id="Node000001" title=" " alt="" coords="5,79,127,120"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integral_constant.html" title=" " alt="" coords="15,5,117,31"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="15,5,117,31"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="69,46,69,79,63,79,63,46"/>
 </map>
diff --git a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.md5 b/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.md5
index 377edbd7f..7da104bd8 100644
--- a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.md5
+++ b/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.md5
@@ -1 +1 @@
-c9aab933efc274d7816093a446310403
\ No newline at end of file
+38418cdb629a508d14caedeb9b71e651
\ No newline at end of file
diff --git a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.svg b/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.svg
index 06ff62757..244d7089f 100644
--- a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.svg
+++ b/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph.svg
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="83.5,-85.75 7.5,-85.75 7.5,-66.5 83.5,-66.5 83.5,-85.75"/>
 <text text-anchor="middle" x="45.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph_org.svg b/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph_org.svg
index bea7c50aa..73e84e2ad 100644
--- a/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph_org.svg
+++ b/d1/d5d/structstd_1_1is__arithmetic_3_01uint256__t_01_4__inherit__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="83.5,-85.75 7.5,-85.75 7.5,-66.5 83.5,-66.5 83.5,-85.75"/>
 <text text-anchor="middle" x="45.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/d1/d64/namespaceinterpolation__search.html b/d1/d64/namespaceinterpolation__search.html
index 9a35e709d..fe722e5d6 100644
--- a/d1/d64/namespaceinterpolation__search.html
+++ b/d1/d64/namespaceinterpolation__search.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: interpolation_search Namespace Reference</title>
+<title>TheAlgorithms/C++: interpolation_search Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d1/d64/namespacemodular__division.html b/d1/d64/namespacemodular__division.html
index 23f95a327..7c168ecc7 100644
--- a/d1/d64/namespacemodular__division.html
+++ b/d1/d64/namespacemodular__division.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: modular_division Namespace Reference</title>
+<title>TheAlgorithms/C++: modular_division Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.map b/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.map
index 9926b8a56..e81b44e15 100644
--- a/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.map
+++ b/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.map
@@ -1,5 +1,5 @@
 <map id="range_queries::heavy_light_decomposition::SG&lt; X &gt;" name="range_queries::heavy_light_decomposition::SG&lt; X &gt;">
 <area shape="rect" id="Node000001" title="Segment Tree, to store heavy chains." alt="" coords="5,94,151,150"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="20,5,136,31"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="20,5,136,31"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="81,47,81,93,75,93,75,47"/>
 </map>
diff --git a/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.md5 b/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.md5
index ea3915d14..2b54b5f4a 100644
--- a/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.md5
+++ b/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.md5
@@ -1 +1 @@
-875dee2e692f80f98cdfccb1dfb059c8
\ No newline at end of file
+0e29585bfac0bb6ce53c2925c93612fe
\ No newline at end of file
diff --git a/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.svg b/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.svg
index 7cedd0f42..8ea6a0174 100644
--- a/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.svg
+++ b/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph.svg
@@ -33,7 +33,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="98.12,-108.25 10.88,-108.25 10.88,-89 98.12,-89 98.12,-108.25"/>
 <text text-anchor="middle" x="54.5" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; X &gt;</text>
 </a>
diff --git a/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph_org.svg b/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph_org.svg
index 164c1197a..8708c96e6 100644
--- a/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph_org.svg
+++ b/d1/d67/classrange__queries_1_1heavy__light__decomposition_1_1_s_g__coll__graph_org.svg
@@ -22,7 +22,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="98.12,-108.25 10.88,-108.25 10.88,-89 98.12,-89 98.12,-108.25"/>
 <text text-anchor="middle" x="54.5" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; X &gt;</text>
 </a>
diff --git a/d1/d70/cll_8cpp_source.html b/d1/d70/cll_8cpp_source.html
new file mode 100644
index 000000000..3828caf62
--- /dev/null
+++ b/d1/d70/cll_8cpp_source.html
@@ -0,0 +1,250 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/cll/cll.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/d70/cll_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">cll.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment">    A simple class for Cicular Linear Linked List</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment">*/</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include &quot;cll.h&quot;</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span> </div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment">/* Constructor */</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>cll::cll() {</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    head = NULL;</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    total = 0;</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>}</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>cll::~cll() { <span class="comment">/* Desstructure, no need to fill */</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>}</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment">/* Display a list. and total element */</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="keywordtype">void</span> cll::display() {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="keywordflow">if</span> (head == NULL)</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        cout &lt;&lt; <span class="stringliteral">&quot;List is empty !&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        cout &lt;&lt; <span class="stringliteral">&quot;CLL list: &quot;</span>;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *current = head;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; total; i++) {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>            cout &lt;&lt; current-&gt;data &lt;&lt; <span class="stringliteral">&quot; -&gt; &quot;</span>;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>            current = current-&gt;next;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        }</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        cout &lt;&lt; head-&gt;data &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        cout &lt;&lt; <span class="stringliteral">&quot;Total element: &quot;</span> &lt;&lt; total &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    }</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>}</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="comment">/* List insert a new value at head in list */</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keywordtype">void</span> cll::insert_front(<span class="keywordtype">int</span> new_data) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *newNode;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    newNode = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    newNode-&gt;data = new_data;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    newNode-&gt;next = NULL;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">if</span> (head == NULL) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        head = newNode;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        head-&gt;next = head;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *current = head;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="keywordflow">while</span> (current-&gt;next != head) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>            current = current-&gt;next;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        newNode-&gt;next = head;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        current-&gt;next = newNode;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        head = newNode;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    total++;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>}</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="comment">/* List insert a new value at head in list */</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="keywordtype">void</span> cll::insert_tail(<span class="keywordtype">int</span> new_data) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *newNode;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    newNode = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    newNode-&gt;data = new_data;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    newNode-&gt;next = NULL;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">if</span> (head == NULL) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        head = newNode;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        head-&gt;next = head;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *current = head;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        <span class="keywordflow">while</span> (current-&gt;next != head) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            current = current-&gt;next;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        current-&gt;next = newNode;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        newNode-&gt;next = head;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    total++;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>}</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span><span class="comment">/* Get total element in list */</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="keywordtype">int</span> cll::get_size() { <span class="keywordflow">return</span> total; }</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="comment">/* Return true if the requested item (sent in as an argument)</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span><span class="comment">is in the list, otherwise return false */</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span><span class="keywordtype">bool</span> cll::find_item(<span class="keywordtype">int</span> item_to_find) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keywordflow">if</span> (head == NULL) {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        cout &lt;&lt; <span class="stringliteral">&quot;List is empty !&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *current = head;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        <span class="keywordflow">while</span> (current-&gt;next != head) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>            <span class="keywordflow">if</span> (current-&gt;data == item_to_find)</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            current = current-&gt;next;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>}</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span><span class="comment">/* Overloading method*/</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span><span class="keywordtype">int</span> cll::operator*() { <span class="keywordflow">return</span> head-&gt;data; }</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span><span class="comment">/* Overload the pre-increment operator.</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span><span class="comment">   The iterator is advanced to the next node. */</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span><span class="keywordtype">void</span> cll::operator++() {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="keywordflow">if</span> (head == NULL) {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        cout &lt;&lt; <span class="stringliteral">&quot;List is empty !&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *current = head;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        <span class="keywordflow">while</span> (current-&gt;next != head) {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>            current = current-&gt;next;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        }</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        current-&gt;next = head-&gt;next;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        head = head-&gt;next;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    }</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    total--;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>}</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../dir_f1797d0c2a0a12033e7d74efffeb14e1.html">cll</a></li><li class="navelem"><b>cll.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.map b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.map
index d44df0032..c30ea60d0 100644
--- a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.map
+++ b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.map
@@ -4,13 +4,13 @@
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="160,356,121,406,117,403,156,353"/>
 <area shape="rect" id="Node000003" href="$dc/d61/classgraph_1_1_graph.html" title=" " alt="" coords="257,213,386,238"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="293,250,195,318,192,314,290,245"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/map.html" title=" " alt="" coords="251,109,392,150"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="251,109,392,150"/>
 <area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="324,165,324,212,319,212,319,165"/>
 <area shape="rect" id="Node000005" title=" " alt="" coords="302,5,341,31"/>
 <area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="324,47,324,109,319,109,319,47"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="32,109,190,150"/>
+<area shape="rect" id="Node000006" title=" " alt="" coords="32,109,190,150"/>
 <area shape="poly" id="edge7_Node000001_Node000006" title=" " alt="" coords="107,166,101,213,98,277,101,342,110,404,105,405,96,342,93,277,96,212,102,165"/>
 <area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="170,154,295,210,293,214,168,159"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="112,213,233,238"/>
+<area shape="rect" id="Node000007" title=" " alt="" coords="112,213,233,238"/>
 <area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="176,254,178,316,173,316,171,254"/>
 </map>
diff --git a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.md5 b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.md5
index 512699606..d7c098bff 100644
--- a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.md5
+++ b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.md5
@@ -1 +1 @@
-dcc9b37a10516be7cfc90a73f44223f4
\ No newline at end of file
+73295c328d064ad6b84e0f23544a3678
\ No newline at end of file
diff --git a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.svg b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.svg
index 58da5d6fb..08f1a962c 100644
--- a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.svg
+++ b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph.svg
@@ -68,7 +68,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="290.12,-241.25 184.12,-241.25 184.12,-210.75 290.12,-210.75 290.12,-241.25"/>
 <text text-anchor="start" x="192.12" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::map&lt; T, std::list</text>
 <text text-anchor="middle" x="237.12" y="-216.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; T &gt; &gt;</text>
@@ -108,7 +108,7 @@
 <!-- Node6 -->
 <g id="Node000006" class="node">
 <title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000006"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="138.12,-241.25 20.12,-241.25 20.12,-210.75 138.12,-210.75 138.12,-241.25"/>
 <text text-anchor="start" x="28.12" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="79.12" y="-216.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -138,7 +138,7 @@
 <!-- Node7 -->
 <g id="Node000007" class="node">
 <title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000007"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="170.62,-163.5 79.62,-163.5 79.62,-144.25 170.62,-144.25 170.62,-163.5"/>
 <text text-anchor="middle" x="125.12" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
diff --git a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph_org.svg b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph_org.svg
index a9fb46e27..234b78f3f 100644
--- a/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph_org.svg
+++ b/d1/d71/classgraph_1_1_lowest_common_ancestor__coll__graph_org.svg
@@ -57,7 +57,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="290.12,-241.25 184.12,-241.25 184.12,-210.75 290.12,-210.75 290.12,-241.25"/>
 <text text-anchor="start" x="192.12" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::map&lt; T, std::list</text>
 <text text-anchor="middle" x="237.12" y="-216.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; T &gt; &gt;</text>
@@ -97,7 +97,7 @@
 <!-- Node6 -->
 <g id="Node000006" class="node">
 <title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000006"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="138.12,-241.25 20.12,-241.25 20.12,-210.75 138.12,-210.75 138.12,-241.25"/>
 <text text-anchor="start" x="28.12" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="79.12" y="-216.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -127,7 +127,7 @@
 <!-- Node7 -->
 <g id="Node000007" class="node">
 <title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000007"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="170.62,-163.5 79.62,-163.5 79.62,-144.25 170.62,-144.25 170.62,-163.5"/>
 <text text-anchor="middle" x="125.12" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
diff --git a/d1/d76/buzz__number_8cpp.html b/d1/d76/buzz__number_8cpp.html
index 0fc2c48e1..9c8690a21 100644
--- a/d1/d76/buzz__number_8cpp.html
+++ b/d1/d76/buzz__number_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/buzz_number.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/buzz_number.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,7 +135,9 @@ Include dependency graph for buzz_number.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dfd/buzz__number_8cpp__incl.svg" width="175" height="111"><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">
+</div>
+<p><a href="../../d1/d76/buzz__number_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
@@ -126,6 +145,8 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A buzz number is a number that is either divisible by 7 or has last digit as 7. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d1/d76/buzz__number_8cpp_source.html">buzz_number.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -142,27 +163,21 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d76/buzz__number_8cpp_source.html#l00009">9</a> of file <a class="el" href="../../d1/d76/buzz__number_8cpp_source.html">buzz_number.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">    9</span>           {</div>
 <div class="line"><span class="lineno">   10</span>    <span class="keywordtype">int</span> n, t;</div>
-<div class="line"><span class="lineno">   11</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; t;</div>
+<div class="line"><span class="lineno">   11</span>    std::cin &gt;&gt; t;</div>
 <div class="line"><span class="lineno">   12</span>    <span class="keywordflow">while</span> (t--) {</div>
-<div class="line"><span class="lineno">   13</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;</div>
+<div class="line"><span class="lineno">   13</span>        std::cin &gt;&gt; n;</div>
 <div class="line"><span class="lineno">   14</span>        <span class="keywordflow">if</span> ((n % 7 == 0) || (n % 10 == 7))</div>
-<div class="line"><span class="lineno">   15</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is a buzz number&quot;</span> &lt;&lt; <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">   15</span>            std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is a buzz number&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   16</span>        <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">   17</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is not a buzz number&quot;</span> &lt;&lt; <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">   17</span>            std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is not a buzz number&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   18</span>    }</div>
 <div class="line"><span class="lineno">   19</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   20</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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><!-- 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="../../d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="180" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 490da38cb..000000000
--- a/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 2f2fe09b6..000000000
--- a/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fa87532068062fd8189cade55ca11658
\ No newline at end of file
diff --git a/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 5c76e5177..000000000
--- a/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 134.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-9.62C44.56,-9.62 52.97,-9.62 61.25,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.21,-13.13 71.21,-9.63 61.21,-6.13 61.21,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 575e4300e..000000000
--- a/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 134.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-9.62C44.56,-9.62 52.97,-9.62 61.25,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.21,-13.13 71.21,-9.63 61.21,-6.13 61.21,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d76/buzz__number_8cpp_source.html b/d1/d76/buzz__number_8cpp_source.html
new file mode 100644
index 000000000..f93c1f2db
--- /dev/null
+++ b/d1/d76/buzz__number_8cpp_source.html
@@ -0,0 +1,155 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/buzz_number.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/d76/buzz__number_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">buzz_number.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d1/d76/buzz__number_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="foldopen" id="foldopen00009" data-start="{" data-end="}">
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"><a class="line" href="../../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">    9</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    <span class="keywordtype">int</span> n, t;</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    std::cin &gt;&gt; t;</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="keywordflow">while</span> (t--) {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>        std::cin &gt;&gt; n;</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>        <span class="keywordflow">if</span> ((n % 7 == 0) || (n % 10 == 7))</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>            std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is a buzz number&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>            std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is not a buzz number&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    }</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>}</div>
+</div>
+<div class="ttc" id="abuzz__number_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00009">buzz_number.cpp:9</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../d1/d76/buzz__number_8cpp.html">buzz_number.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/d77/structmst.html b/d1/d77/structmst.html
index 0e909333d..e8ffddddc 100644
--- a/d1/d77/structmst.html
+++ b/d1/d77/structmst.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: mst Struct Reference</title>
+<title>TheAlgorithms/C++: mst Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -113,18 +130,67 @@ $(function(){initNavTree('d1/d77/structmst.html','../../'); initResizable(true);
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a53e13cb8fe7481d6173bfa72ac509590" id="r_a53e13cb8fe7481d6173bfa72ac509590"><td class="memItemLeft" align="right" valign="top"><a id="a53e13cb8fe7481d6173bfa72ac509590" name="a53e13cb8fe7481d6173bfa72ac509590"></a>
-bool&#160;</td><td class="memItemRight" valign="bottom"><b>visited</b></td></tr>
+<tr class="memitem:a53e13cb8fe7481d6173bfa72ac509590" id="r_a53e13cb8fe7481d6173bfa72ac509590"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a53e13cb8fe7481d6173bfa72ac509590">visited</a></td></tr>
 <tr class="separator:a53e13cb8fe7481d6173bfa72ac509590"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a59feb15588a49aac1c243bf649b97c72" id="r_a59feb15588a49aac1c243bf649b97c72"><td class="memItemLeft" align="right" valign="top"><a id="a59feb15588a49aac1c243bf649b97c72" name="a59feb15588a49aac1c243bf649b97c72"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>key</b></td></tr>
+<tr class="memitem:a59feb15588a49aac1c243bf649b97c72" id="r_a59feb15588a49aac1c243bf649b97c72"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a59feb15588a49aac1c243bf649b97c72">key</a></td></tr>
 <tr class="separator:a59feb15588a49aac1c243bf649b97c72"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2ce945d2bf94acc77bde387c30d02af1" id="r_a2ce945d2bf94acc77bde387c30d02af1"><td class="memItemLeft" align="right" valign="top"><a id="a2ce945d2bf94acc77bde387c30d02af1" name="a2ce945d2bf94acc77bde387c30d02af1"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>near</b></td></tr>
+<tr class="memitem:a2ce945d2bf94acc77bde387c30d02af1" id="r_a2ce945d2bf94acc77bde387c30d02af1"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2ce945d2bf94acc77bde387c30d02af1">near</a></td></tr>
 <tr class="separator:a2ce945d2bf94acc77bde387c30d02af1"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../d2/d64/prims__minimum__spanning__tree_8cpp_source.html#l00009">9</a> of file <a class="el" href="../../d2/d64/prims__minimum__spanning__tree_8cpp_source.html">prims_minimum_spanning_tree.cpp</a>.</p>
+</div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="a59feb15588a49aac1c243bf649b97c72" name="a59feb15588a49aac1c243bf649b97c72"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a59feb15588a49aac1c243bf649b97c72">&#9670;&#160;</a></span>key</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int mst::key</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d64/prims__minimum__spanning__tree_8cpp_source.html#l00011">11</a> of file <a class="el" href="../../d2/d64/prims__minimum__spanning__tree_8cpp_source.html">prims_minimum_spanning_tree.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a2ce945d2bf94acc77bde387c30d02af1" name="a2ce945d2bf94acc77bde387c30d02af1"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a2ce945d2bf94acc77bde387c30d02af1">&#9670;&#160;</a></span>near</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int mst::near</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d64/prims__minimum__spanning__tree_8cpp_source.html#l00012">12</a> of file <a class="el" href="../../d2/d64/prims__minimum__spanning__tree_8cpp_source.html">prims_minimum_spanning_tree.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a53e13cb8fe7481d6173bfa72ac509590" name="a53e13cb8fe7481d6173bfa72ac509590"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a53e13cb8fe7481d6173bfa72ac509590">&#9670;&#160;</a></span>visited</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">bool mst::visited</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d64/prims__minimum__spanning__tree_8cpp_source.html#l00010">10</a> of file <a class="el" href="../../d2/d64/prims__minimum__spanning__tree_8cpp_source.html">prims_minimum_spanning_tree.cpp</a>.</p>
+
+</div>
+</div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>greedy_algorithms/<b>prims_minimum_spanning_tree.cpp</b></li>
+<li>greedy_algorithms/<a class="el" href="../../d2/d64/prims__minimum__spanning__tree_8cpp_source.html">prims_minimum_spanning_tree.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d1/d7c/fibonacci__bottom__up_8cpp_source.html b/d1/d7c/fibonacci__bottom__up_8cpp_source.html
new file mode 100644
index 000000000..1fa1f79f7
--- /dev/null
+++ b/d1/d7c/fibonacci__bottom__up_8cpp_source.html
@@ -0,0 +1,160 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/fibonacci_bottom_up.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/d7c/fibonacci__bottom__up_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">fibonacci_bottom_up.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="keywordtype">int</span> fib(<span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span>    <span class="keywordtype">int</span> res[3];</div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span>    res[0] = 0;</div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span>    res[1] = 1;</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i &lt;= n; i++) {</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>        res[2] = res[1] + res[0];</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>        res[0] = res[1];</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>        res[1] = res[2];</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    }</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="keywordflow">return</span> res[1];</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>}</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> <span class="keyword">const</span> *argv[]) {</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="keywordtype">int</span> n;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    cout &lt;&lt; <span class="stringliteral">&quot;Enter n: &quot;</span>;</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    cin &gt;&gt; n;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    cout &lt;&lt; <span class="stringliteral">&quot;Fibonacci number is &quot;</span>;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    cout &lt;&lt; fib(n) &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><b>fibonacci_bottom_up.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/d83/classuint256__t.html b/d1/d83/classuint256__t.html
index 354ec40da..ce7d736eb 100644
--- a/d1/d83/classuint256__t.html
+++ b/d1/d83/classuint256__t.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: uint256_t Class Reference</title>
+<title>TheAlgorithms/C++: uint256_t Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -130,7 +147,7 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:aed0f8c3d5be23644c4bcb2fd2551e1dc"><td class="memTemplItemLeft" align="right" valign="top">&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aed0f8c3d5be23644c4bcb2fd2551e1dc">uint256_t</a> (T low)</td></tr>
 <tr class="memdesc:aed0f8c3d5be23644c4bcb2fd2551e1dc"><td class="mdescLeft">&#160;</td><td class="mdescRight">Parameterized constructor.  <br /></td></tr>
 <tr class="separator:aed0f8c3d5be23644c4bcb2fd2551e1dc"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a1fa3d95584d071add9b46597d3747b39" id="r_a1fa3d95584d071add9b46597d3747b39"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1fa3d95584d071add9b46597d3747b39">uint256_t</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str)</td></tr>
+<tr class="memitem:a1fa3d95584d071add9b46597d3747b39" id="r_a1fa3d95584d071add9b46597d3747b39"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1fa3d95584d071add9b46597d3747b39">uint256_t</a> (const std::string &amp;str)</td></tr>
 <tr class="memdesc:a1fa3d95584d071add9b46597d3747b39"><td class="mdescLeft">&#160;</td><td class="mdescRight">Parameterized constructor.  <br /></td></tr>
 <tr class="separator:a1fa3d95584d071add9b46597d3747b39"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a42bf7490b31d8c750a67fd9bb6f2df2e" id="r_a42bf7490b31d8c750a67fd9bb6f2df2e"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a42bf7490b31d8c750a67fd9bb6f2df2e">uint256_t</a> (const <a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;num)=default</td></tr>
@@ -178,7 +195,7 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:addff5645f6005e7b50a6ad0731e4f19c"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#addff5645f6005e7b50a6ad0731e4f19c">operator=</a> (const T &amp;p)</td></tr>
 <tr class="memdesc:addff5645f6005e7b50a6ad0731e4f19c"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator = for other types  <br /></td></tr>
 <tr class="separator:addff5645f6005e7b50a6ad0731e4f19c"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a86aab081bb7db2771e4a4f30c3eed8e2" id="r_a86aab081bb7db2771e4a4f30c3eed8e2"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a86aab081bb7db2771e4a4f30c3eed8e2">operator=</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;p)</td></tr>
+<tr class="memitem:a86aab081bb7db2771e4a4f30c3eed8e2" id="r_a86aab081bb7db2771e4a4f30c3eed8e2"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a86aab081bb7db2771e4a4f30c3eed8e2">operator=</a> (const std::string &amp;p)</td></tr>
 <tr class="memdesc:a86aab081bb7db2771e4a4f30c3eed8e2"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator = for type string  <br /></td></tr>
 <tr class="separator:a86aab081bb7db2771e4a4f30c3eed8e2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a6c5e025f901f6af4b748f98013350638" id="r_a6c5e025f901f6af4b748f98013350638"><td class="memItemLeft" align="right" valign="top"><a id="a6c5e025f901f6af4b748f98013350638" name="a6c5e025f901f6af4b748f98013350638"></a>
@@ -242,7 +259,7 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:a4645040fe68ff01d83400f173fd2bb21" id="r_a4645040fe68ff01d83400f173fd2bb21"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4645040fe68ff01d83400f173fd2bb21">operator*=</a> (const <a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p)</td></tr>
 <tr class="memdesc:a4645040fe68ff01d83400f173fd2bb21"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator *= for <a class="el" href="../../d1/d83/classuint256__t.html" title="class for 256-bit unsigned integer">uint256_t</a> and other integer types.  <br /></td></tr>
 <tr class="separator:a4645040fe68ff01d83400f173fd2bb21"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8161d52d369e525f4e61129376adfcf1" id="r_a8161d52d369e525f4e61129376adfcf1"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; <a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a>, <a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8161d52d369e525f4e61129376adfcf1">divide</a> (const <a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p)</td></tr>
+<tr class="memitem:a8161d52d369e525f4e61129376adfcf1" id="r_a8161d52d369e525f4e61129376adfcf1"><td class="memItemLeft" align="right" valign="top">std::pair&lt; <a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a>, <a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8161d52d369e525f4e61129376adfcf1">divide</a> (const <a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p)</td></tr>
 <tr class="memdesc:a8161d52d369e525f4e61129376adfcf1"><td class="mdescLeft">&#160;</td><td class="mdescRight">divide function for <a class="el" href="../../d1/d83/classuint256__t.html" title="class for 256-bit unsigned integer">uint256_t</a> and other integer types.  <br /></td></tr>
 <tr class="separator:a8161d52d369e525f4e61129376adfcf1"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:acac9901ab133caa57d058a377d873bf6" id="r_acac9901ab133caa57d058a377d873bf6"><td class="memTemplParams" colspan="2">template&lt;typename T , typename  = typename std::enable_if&lt;                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
@@ -399,7 +416,7 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
 Private Member Functions</h2></td></tr>
-<tr class="memitem:afee82fa5052e9d8c946b9205b943cec4" id="r_afee82fa5052e9d8c946b9205b943cec4"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afee82fa5052e9d8c946b9205b943cec4">__get_integer_from_string</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str)</td></tr>
+<tr class="memitem:afee82fa5052e9d8c946b9205b943cec4" id="r_afee82fa5052e9d8c946b9205b943cec4"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afee82fa5052e9d8c946b9205b943cec4">__get_integer_from_string</a> (const std::string &amp;str)</td></tr>
 <tr class="memdesc:afee82fa5052e9d8c946b9205b943cec4"><td class="mdescLeft">&#160;</td><td class="mdescRight">First and second half of 256 bit number.  <br /></td></tr>
 <tr class="separator:afee82fa5052e9d8c946b9205b943cec4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
@@ -412,12 +429,14 @@ Private Attributes</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="friends" name="friends"></a>
 Friends</h2></td></tr>
-<tr class="memitem:a91badfd31be84b12cbb6d85ebc04d13a" id="r_a91badfd31be84b12cbb6d85ebc04d13a"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a91badfd31be84b12cbb6d85ebc04d13a">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;op, <a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a> p)</td></tr>
+<tr class="memitem:a91badfd31be84b12cbb6d85ebc04d13a" id="r_a91badfd31be84b12cbb6d85ebc04d13a"><td class="memItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a91badfd31be84b12cbb6d85ebc04d13a">operator&lt;&lt;</a> (std::ostream &amp;op, <a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a> p)</td></tr>
 <tr class="memdesc:a91badfd31be84b12cbb6d85ebc04d13a"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &lt;&lt; for printing <a class="el" href="../../d1/d83/classuint256__t.html" title="class for 256-bit unsigned integer">uint256_t</a> integer  <br /></td></tr>
 <tr class="separator:a91badfd31be84b12cbb6d85ebc04d13a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>class for 256-bit unsigned integer </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00033">33</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="aed0f8c3d5be23644c4bcb2fd2551e1dc" name="aed0f8c3d5be23644c4bcb2fd2551e1dc"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aed0f8c3d5be23644c4bcb2fd2551e1dc">&#9670;&#160;</a></span>uint256_t() <span class="overload">[1/6]</span></h2>
@@ -457,6 +476,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00075">75</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   75</span>: s(low), f(0) {}</div>
 </div><!-- fragment -->
 </div>
@@ -473,7 +494,7 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
         <tr>
           <td class="memname">uint256_t::uint256_t </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -491,16 +512,13 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00081">81</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   81</span>                                             {</div>
 <div class="line"><span class="lineno">   82</span>        <a class="code hl_function" href="#afee82fa5052e9d8c946b9205b943cec4">__get_integer_from_string</a>(str);</div>
 <div class="line"><span class="lineno">   83</span>    }</div>
-<div class="ttc" id="aclassuint256__t_html_afee82fa5052e9d8c946b9205b943cec4"><div class="ttname"><a href="#afee82fa5052e9d8c946b9205b943cec4">uint256_t::__get_integer_from_string</a></div><div class="ttdeci">void __get_integer_from_string(const std::string &amp;str)</div><div class="ttdoc">First and second half of 256 bit number.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:43</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d83/classuint256__t_a1fa3d95584d071add9b46597d3747b39_cgraph.svg" width="514" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassuint256__t_html_afee82fa5052e9d8c946b9205b943cec4"><div class="ttname"><a href="#afee82fa5052e9d8c946b9205b943cec4">uint256_t::__get_integer_from_string</a></div><div class="ttdeci">void __get_integer_from_string(const std::string &amp;str)</div><div class="ttdoc">First and second half of 256 bit number.</div><div class="ttdef"><b>Definition</b> <a href="../../da/da3/uint256__t_8hpp_source.html#l00043">uint256_t.hpp:43</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a42bf7490b31d8c750a67fd9bb6f2df2e" name="a42bf7490b31d8c750a67fd9bb6f2df2e"></a>
@@ -566,8 +584,9 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">   96</span>        : f(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(num.f)), s(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(num.s)) {}</div>
-<div class="ttc" id="amove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></div><div class="ttdeci">T move(T... args)</div></div>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00095">95</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   96</span>        : f(std::move(num.f)), s(std::move(num.s)) {}</div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -606,7 +625,9 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">  104</span>        : f(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(high)), s(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(low)) {}</div>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00103">103</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  104</span>        : f(std::move(high)), s(std::move(low)) {}</div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -645,6 +666,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00111">111</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  111</span>: f(high), s(low) {}</div>
 </div><!-- fragment -->
 </div>
@@ -662,7 +685,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void uint256_t::__get_integer_from_string </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -682,10 +705,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00043">43</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   43</span>                                                         {</div>
 <div class="line"><span class="lineno">   44</span>        this-&gt;f = this-&gt;s = <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(0);</div>
-<div class="line"><span class="lineno">   45</span>        <span class="keywordflow">if</span> (str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() &gt; 1 &amp;&amp; str[1] == <span class="charliteral">&#39;x&#39;</span>) {</div>
-<div class="line"><span class="lineno">   46</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 2; i &lt; str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>(); ++i) {</div>
+<div class="line"><span class="lineno">   45</span>        <span class="keywordflow">if</span> (str.size() &gt; 1 &amp;&amp; str[1] == <span class="charliteral">&#39;x&#39;</span>) {</div>
+<div class="line"><span class="lineno">   46</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 2; i &lt; str.size(); ++i) {</div>
 <div class="line"><span class="lineno">   47</span>                *<span class="keyword">this</span> *= 16LL;</div>
 <div class="line"><span class="lineno">   48</span>                <span class="keywordflow">if</span> (str[i] &gt;= <span class="charliteral">&#39;0&#39;</span> &amp;&amp; str[i] &lt;= <span class="charliteral">&#39;9&#39;</span>) {</div>
 <div class="line"><span class="lineno">   49</span>                    *<span class="keyword">this</span> += (str[i] - <span class="charliteral">&#39;0&#39;</span>);</div>
@@ -702,14 +727,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   60</span>            }</div>
 <div class="line"><span class="lineno">   61</span>        }</div>
 <div class="line"><span class="lineno">   62</span>    }</div>
-<div class="ttc" id="aclassuint128__t_html"><div class="ttname"><a href="../../db/d9a/classuint128__t.html">uint128_t</a></div><div class="ttdoc">class for 128-bit unsigned integer</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:60</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d83/classuint256__t_afee82fa5052e9d8c946b9205b943cec4_cgraph.svg" width="331" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassuint128__t_html"><div class="ttname"><a href="../../db/d9a/classuint128__t.html">uint128_t</a></div><div class="ttdoc">class for 128-bit unsigned integer</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00060">uint128_t.hpp:60</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a033d66c965e8d1fbc5bafb59ad60e163" name="a033d66c965e8d1fbc5bafb59ad60e163"></a>
@@ -737,19 +756,16 @@ Here is the call graph for this function:</div>
 
 <p>Leading zeroes in binary. </p>
 <p>Calculates leading zeros in 256-bit integer </p><dl class="section return"><dt>Returns</dt><dd>Integer denoting leading zeroes </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00123">123</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  123</span>                           {</div>
 <div class="line"><span class="lineno">  124</span>        <span class="keywordflow">if</span> (f) {</div>
 <div class="line"><span class="lineno">  125</span>            <span class="keywordflow">return</span> f.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2">_lez</a>();</div>
 <div class="line"><span class="lineno">  126</span>        }</div>
 <div class="line"><span class="lineno">  127</span>        <span class="keywordflow">return</span> 128 + s.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2">_lez</a>();</div>
 <div class="line"><span class="lineno">  128</span>    }</div>
-<div class="ttc" id="aclassuint128__t_html_af139bb6e630f1a61919f180978611cd2"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2">uint128_t::_lez</a></div><div class="ttdeci">uint32_t _lez()</div><div class="ttdoc">Leading zeroes in binary.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:140</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d83/classuint256__t_a033d66c965e8d1fbc5bafb59ad60e163_cgraph.svg" width="272" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassuint128__t_html_af139bb6e630f1a61919f180978611cd2"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2">uint128_t::_lez</a></div><div class="ttdeci">uint32_t _lez()</div><div class="ttdoc">Leading zeroes in binary.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00140">uint128_t.hpp:140</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a9ddd133cee83f3a2ab6ed60a7ccbc250" name="a9ddd133cee83f3a2ab6ed60a7ccbc250"></a>
@@ -777,19 +793,16 @@ Here is the call graph for this function:</div>
 
 <p>Trailing zeroes in binary. </p>
 <p>Calculates leading zeros in 256-bit integer </p><dl class="section return"><dt>Returns</dt><dd>Integer denoting Trailing zeroes </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00135">135</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  135</span>                           {</div>
 <div class="line"><span class="lineno">  136</span>        <span class="keywordflow">if</span> (s) {</div>
 <div class="line"><span class="lineno">  137</span>            <span class="keywordflow">return</span> s.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e">_trz</a>();</div>
 <div class="line"><span class="lineno">  138</span>        }</div>
 <div class="line"><span class="lineno">  139</span>        <span class="keywordflow">return</span> 128 + f.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e">_trz</a>();</div>
 <div class="line"><span class="lineno">  140</span>    }</div>
-<div class="ttc" id="aclassuint128__t_html_a7d2285a8a6e20b77f82f1f0351afe76e"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e">uint128_t::_trz</a></div><div class="ttdeci">uint32_t _trz()</div><div class="ttdoc">Trailing zeroes in binary.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:163</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d83/classuint256__t_a9ddd133cee83f3a2ab6ed60a7ccbc250_cgraph.svg" width="268" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassuint128__t_html_a7d2285a8a6e20b77f82f1f0351afe76e"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e">uint128_t::_trz</a></div><div class="ttdeci">uint32_t _trz()</div><div class="ttdoc">Trailing zeroes in binary.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00163">uint128_t.hpp:163</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a8161d52d369e525f4e61129376adfcf1" name="a8161d52d369e525f4e61129376adfcf1"></a>
@@ -802,7 +815,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; <a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a>, <a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a> &gt; uint256_t::divide </td>
+          <td class="memname">std::pair&lt; <a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a>, <a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a> &gt; uint256_t::divide </td>
           <td>(</td>
           <td class="paramtype">const <a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>p</em></span></td><td>)</td>
           <td></td>
@@ -823,6 +836,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>pair denoting quotient and remainder. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00421">421</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  421</span>                                                             {</div>
 <div class="line"><span class="lineno">  422</span>        <span class="keywordflow">if</span> (*<span class="keyword">this</span> &lt; p) {  <span class="comment">// if this is less than divisor</span></div>
 <div class="line"><span class="lineno">  423</span>            <span class="keywordflow">return</span> {<a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(0), *<span class="keyword">this</span>};</div>
@@ -851,14 +866,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  446</span>        }</div>
 <div class="line"><span class="lineno">  447</span>        <span class="keywordflow">return</span> {quotient &lt;&lt; left, tmp2};</div>
 <div class="line"><span class="lineno">  448</span>    }</div>
-<div class="ttc" id="aclassuint256__t_html"><div class="ttname"><a href="../../d1/d83/classuint256__t.html">uint256_t</a></div><div class="ttdoc">class for 256-bit unsigned integer</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:33</div></div>
-<div class="ttc" id="aclassuint256__t_html_a033d66c965e8d1fbc5bafb59ad60e163"><div class="ttname"><a href="#a033d66c965e8d1fbc5bafb59ad60e163">uint256_t::_lez</a></div><div class="ttdeci">uint32_t _lez()</div><div class="ttdoc">Leading zeroes in binary.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:123</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d83/classuint256__t_a8161d52d369e525f4e61129376adfcf1_cgraph.svg" width="436" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassuint256__t_html"><div class="ttname"><a href="../../d1/d83/classuint256__t.html">uint256_t</a></div><div class="ttdoc">class for 256-bit unsigned integer</div><div class="ttdef"><b>Definition</b> <a href="../../da/da3/uint256__t_8hpp_source.html#l00033">uint256_t.hpp:33</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a033d66c965e8d1fbc5bafb59ad60e163"><div class="ttname"><a href="#a033d66c965e8d1fbc5bafb59ad60e163">uint256_t::_lez</a></div><div class="ttdeci">uint32_t _lez()</div><div class="ttdoc">Leading zeroes in binary.</div><div class="ttdef"><b>Definition</b> <a href="../../da/da3/uint256__t_8hpp_source.html#l00123">uint256_t.hpp:123</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa4cf08fa6a33f17594b5a842866f39a1" name="aa4cf08fa6a33f17594b5a842866f39a1"></a>
@@ -886,6 +896,8 @@ Here is the call graph for this function:</div>
 
 <p>returns lower 128-bit integer part </p>
 <dl class="section return"><dt>Returns</dt><dd>returns lower 128-bit integer part </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00169">169</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  169</span>{ <span class="keywordflow">return</span> s; }</div>
 </div><!-- fragment -->
 </div>
@@ -915,6 +927,8 @@ Here is the call graph for this function:</div>
 
 <p>casting operator to boolean value </p>
 <dl class="section return"><dt>Returns</dt><dd>true if value of this is non-zero, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00146">146</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  146</span>{ <span class="keywordflow">return</span> f || s; }</div>
 </div><!-- fragment -->
 </div>
@@ -952,6 +966,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>integer value casted to mentioned type </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00155">155</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  155</span>                                       {</div>
 <div class="line"><span class="lineno">  156</span>        <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>T<span class="keyword">&gt;</span>(s);</div>
 <div class="line"><span class="lineno">  157</span>    }</div>
@@ -983,6 +999,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 
 <p>casting operator to <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> </p>
 <dl class="section return"><dt>Returns</dt><dd>returns lower 128-bit integer part </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00163">163</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  163</span>{ <span class="keywordflow">return</span> s; }</div>
 </div><!-- fragment -->
 </div>
@@ -1012,6 +1030,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 
 <p>operator ! for <a class="el" href="../../d1/d83/classuint256__t.html" title="class for 256-bit unsigned integer">uint256_t</a> </p>
 <dl class="section return"><dt>Returns</dt><dd>true if this has zero value, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00596">596</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  596</span>{ <span class="keywordflow">return</span> !f &amp;&amp; !s; }</div>
 </div><!-- fragment -->
 </div>
@@ -1055,6 +1075,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is not equal to other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00690">690</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  690</span>                                    {</div>
 <div class="line"><span class="lineno">  691</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> != <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(other);</div>
 <div class="line"><span class="lineno">  692</span>    }</div>
@@ -1092,6 +1114,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is not equal than other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00588">588</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  588</span>                                                   {</div>
 <div class="line"><span class="lineno">  589</span>        <span class="keywordflow">return</span> !((*this) == other);</div>
 <div class="line"><span class="lineno">  590</span>    }</div>
@@ -1137,6 +1161,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>unsigned 256-bit remainder. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00509">509</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  509</span>                                           {</div>
 <div class="line"><span class="lineno">  510</span>        <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> tmp = *<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  511</span>        tmp %= <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p);</div>
@@ -1176,14 +1202,11 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>unsigned 256-bit remainder. </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  499</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a8161d52d369e525f4e61129376adfcf1">divide</a>(p).second; }</div>
-<div class="ttc" id="aclassuint256__t_html_a8161d52d369e525f4e61129376adfcf1"><div class="ttname"><a href="#a8161d52d369e525f4e61129376adfcf1">uint256_t::divide</a></div><div class="ttdeci">std::pair&lt; uint256_t, uint256_t &gt; divide(const uint256_t &amp;p)</div><div class="ttdoc">divide function for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:421</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d83/classuint256__t_ad4928175eaaaa2b559bc945affe63ad2_cgraph.svg" width="626" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00499">499</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  499</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a8161d52d369e525f4e61129376adfcf1">divide</a>(p).second; }</div>
+<div class="ttc" id="aclassuint256__t_html_a8161d52d369e525f4e61129376adfcf1"><div class="ttname"><a href="#a8161d52d369e525f4e61129376adfcf1">uint256_t::divide</a></div><div class="ttdeci">std::pair&lt; uint256_t, uint256_t &gt; divide(const uint256_t &amp;p)</div><div class="ttdoc">divide function for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="../../da/da3/uint256__t_8hpp_source.html#l00421">uint256_t.hpp:421</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a76914bc727eab927a3941ef71275327d" name="a76914bc727eab927a3941ef71275327d"></a>
@@ -1225,6 +1248,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this set as unsigned 256-bit remainder. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00533">533</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  533</span>                                             {</div>
 <div class="line"><span class="lineno">  534</span>        *<span class="keyword">this</span> %= <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p);</div>
 <div class="line"><span class="lineno">  535</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -1263,16 +1288,13 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this set as unsigned 256-bit remainder. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00520">520</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  520</span>                                                     {</div>
 <div class="line"><span class="lineno">  521</span>        *<span class="keyword">this</span> = <a class="code hl_function" href="#a8161d52d369e525f4e61129376adfcf1">divide</a>(p).second;</div>
 <div class="line"><span class="lineno">  522</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  523</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d83/classuint256__t_a2cd43a4a92dc825a010a17578b3bdedb_cgraph.svg" width="634" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6eadaa829087e07eebafca3981566bb8" name="a6eadaa829087e07eebafca3981566bb8"></a>
@@ -1314,6 +1336,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>value of this &amp; p (&amp; is bit-wise operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00811">811</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  811</span>                                           {</div>
 <div class="line"><span class="lineno">  812</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> &amp; <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p);</div>
 <div class="line"><span class="lineno">  813</span>    }</div>
@@ -1351,6 +1375,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>value of this &amp; p (&amp; is bit-wise operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00820">820</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  820</span>                                                   {</div>
 <div class="line"><span class="lineno">  821</span>        <span class="keywordflow">return</span> {f &amp; p.f, s &amp; p.s};</div>
 <div class="line"><span class="lineno">  822</span>    }</div>
@@ -1396,6 +1422,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is both values are non-zero, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00702">702</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  702</span>                                       {</div>
 <div class="line"><span class="lineno">  703</span>        <span class="keywordflow">return</span> (s || f) &amp;&amp; (b);</div>
 <div class="line"><span class="lineno">  704</span>    }</div>
@@ -1433,6 +1461,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if both of the values are not zero, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00603">603</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  603</span>                                               {</div>
 <div class="line"><span class="lineno">  604</span>        <span class="keywordflow">return</span> (s || f) &amp;&amp; (b.s || b.f);</div>
 <div class="line"><span class="lineno">  605</span>    }</div>
@@ -1478,6 +1508,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this = this &amp; p (&amp; is bit-wise operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00843">843</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  843</span>                                            {</div>
 <div class="line"><span class="lineno">  844</span>        s &amp;= p.s;</div>
 <div class="line"><span class="lineno">  845</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -1516,6 +1548,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this = this &amp; p (&amp; is bit-wise operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00829">829</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  829</span>                                                     {</div>
 <div class="line"><span class="lineno">  830</span>        f &amp;= p.f;</div>
 <div class="line"><span class="lineno">  831</span>        s &amp;= p.s;</div>
@@ -1549,6 +1583,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 
 <p>operator () for <a class="el" href="../../d1/d83/classuint256__t.html" title="class for 256-bit unsigned integer">uint256_t</a> </p>
 <dl class="section return"><dt>Returns</dt><dd>true if this value is non-zero, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00620">620</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  620</span>{ <span class="keywordflow">return</span> s || f; }</div>
 </div><!-- fragment -->
 </div>
@@ -1592,6 +1628,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>multiplication of this and p, returning <a class="el" href="../../d1/d83/classuint256__t.html" title="class for 256-bit unsigned integer">uint256_t</a> integer </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00362">362</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  362</span>                                           {</div>
 <div class="line"><span class="lineno">  363</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> * <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p);</div>
 <div class="line"><span class="lineno">  364</span>    }</div>
@@ -1629,6 +1667,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>multiplication of this and p, returning <a class="el" href="../../d1/d83/classuint256__t.html" title="class for 256-bit unsigned integer">uint256_t</a> integer </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00371">371</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  371</span>                                            {</div>
 <div class="line"><span class="lineno">  372</span>        <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> f_first(s.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">upper</a>()), f_second(s.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd">lower</a>()), s_first(p.s.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">upper</a>()),</div>
 <div class="line"><span class="lineno">  373</span>            s_second(p.s.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd">lower</a>());</div>
@@ -1641,14 +1681,9 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 <div class="line"><span class="lineno">  380</span>        <span class="keywordflow">return</span> {f * p.s + s * p.f + fi + se.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">upper</a>() + th.upper() + cc,</div>
 <div class="line"><span class="lineno">  381</span>                tmp + fo};</div>
 <div class="line"><span class="lineno">  382</span>    }</div>
-<div class="ttc" id="aclassuint128__t_html_a1ee2f1ffbd9984faad34883eb45e9705"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">uint128_t::upper</a></div><div class="ttdeci">uint64_t upper() const</div><div class="ttdoc">returns upper 64-bit integer part</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:208</div></div>
-<div class="ttc" id="aclassuint128__t_html_aa69e1064c0b0b1df1c61acd2ea04fabd"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd">uint128_t::lower</a></div><div class="ttdeci">uint64_t lower() const</div><div class="ttdoc">returns lower 64-bit integer part</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:202</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d83/classuint256__t_aa9e585b186e71d7cbe9c1d7387c38967_cgraph.svg" width="308" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassuint128__t_html_a1ee2f1ffbd9984faad34883eb45e9705"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">uint128_t::upper</a></div><div class="ttdeci">uint64_t upper() const</div><div class="ttdoc">returns upper 64-bit integer part</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00208">uint128_t.hpp:208</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_aa69e1064c0b0b1df1c61acd2ea04fabd"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd">uint128_t::lower</a></div><div class="ttdeci">uint64_t lower() const</div><div class="ttdoc">returns lower 64-bit integer part</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00202">uint128_t.hpp:202</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af2193ff0d0e93143fb71f4847df16028" name="af2193ff0d0e93143fb71f4847df16028"></a>
@@ -1690,6 +1725,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>multiplication of this and p, returning this </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00392">392</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  392</span>                                             {</div>
 <div class="line"><span class="lineno">  393</span>        <span class="keywordflow">return</span> (*<span class="keyword">this</span> *= <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p));</div>
 <div class="line"><span class="lineno">  394</span>    }</div>
@@ -1727,6 +1764,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>multiplication of this and p, returning this </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00401">401</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  401</span>                                              {</div>
 <div class="line"><span class="lineno">  402</span>        <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> f_first(s.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">upper</a>()), f_second(s.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd">lower</a>()), s_first(p.s.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">upper</a>()),</div>
 <div class="line"><span class="lineno">  403</span>            s_second(p.s.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd">lower</a>());</div>
@@ -1740,12 +1779,7 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 <div class="line"><span class="lineno">  411</span>        s = tmp + fo;</div>
 <div class="line"><span class="lineno">  412</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  413</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d83/classuint256__t_a4645040fe68ff01d83400f173fd2bb21_cgraph.svg" width="316" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a20dc3a017b1a740c4bafd3f146a90b0f" name="a20dc3a017b1a740c4bafd3f146a90b0f"></a>
@@ -1787,6 +1821,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>addition of this and p, returning <a class="el" href="../../d1/d83/classuint256__t.html" title="class for 256-bit unsigned integer">uint256_t</a> integer </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00220">220</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  220</span>                                           {</div>
 <div class="line"><span class="lineno">  221</span>        <span class="keywordtype">bool</span> app = s + p &lt; s;</div>
 <div class="line"><span class="lineno">  222</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(f + app, s + p);</div>
@@ -1825,6 +1861,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>addition of this and p, returning <a class="el" href="../../d1/d83/classuint256__t.html" title="class for 256-bit unsigned integer">uint256_t</a> integer </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00230">230</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  230</span>                                                   {</div>
 <div class="line"><span class="lineno">  231</span>        <span class="keywordtype">bool</span> app = (s + p.s &lt; s);</div>
 <div class="line"><span class="lineno">  232</span>        <span class="keywordflow">return</span> {f + app + p.f, s + p.s};</div>
@@ -1857,6 +1895,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 
 <p>pre-increment operator </p>
 <dl class="section return"><dt>Returns</dt><dd>incremented value of this. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00266">266</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  266</span>                                   {</div>
 <div class="line"><span class="lineno">  267</span>        *<span class="keyword">this</span> += 1;</div>
 <div class="line"><span class="lineno">  268</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -1889,6 +1929,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 
 <p>post-increment operator </p>
 <dl class="section return"><dt>Returns</dt><dd>incremented value of this. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00275">275</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  275</span>                                     {</div>
 <div class="line"><span class="lineno">  276</span>        ++*<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  277</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -1935,6 +1977,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>addition of this and p, returning this </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00243">243</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  243</span>                                             {</div>
 <div class="line"><span class="lineno">  244</span>        <span class="keywordtype">bool</span> app = (p + s &lt; s);</div>
 <div class="line"><span class="lineno">  245</span>        this-&gt;f += app;</div>
@@ -1975,6 +2019,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>addition of this and p, returning this </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00255">255</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  255</span>                                                     {</div>
 <div class="line"><span class="lineno">  256</span>        <span class="keywordtype">bool</span> app = (s + p.s &lt; s);</div>
 <div class="line"><span class="lineno">  257</span>        f = f + app + p.f;</div>
@@ -2009,6 +2055,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 
 <p>operator - using twos complement </p>
 <dl class="section return"><dt>Returns</dt><dd>2's complement of this. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00307">307</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  307</span>{ <span class="keywordflow">return</span> ~*<span class="keyword">this</span> + <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(1); }</div>
 </div><!-- fragment -->
 </div>
@@ -2052,6 +2100,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>subtraction of this and p, returning <a class="el" href="../../d1/d83/classuint256__t.html" title="class for 256-bit unsigned integer">uint256_t</a> integer </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00288">288</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  288</span>                                           {</div>
 <div class="line"><span class="lineno">  289</span>        <span class="keywordtype">bool</span> app = (p &gt; s);</div>
 <div class="line"><span class="lineno">  290</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(f - app, s - p);</div>
@@ -2090,6 +2140,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>subtraction of this and p, returning <a class="el" href="../../d1/d83/classuint256__t.html" title="class for 256-bit unsigned integer">uint256_t</a> integer </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00298">298</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  298</span>                                                   {</div>
 <div class="line"><span class="lineno">  299</span>        <span class="keywordtype">bool</span> app = s &lt; p.s;</div>
 <div class="line"><span class="lineno">  300</span>        <span class="keywordflow">return</span> {f - p.f - app, s - p.s};</div>
@@ -2122,6 +2174,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 
 <p>operator &ndash; (pre-decrement) </p>
 <dl class="section return"><dt>Returns</dt><dd>decremented value of this </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00313">313</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  313</span>                                   {</div>
 <div class="line"><span class="lineno">  314</span>        *<span class="keyword">this</span> -= 1;</div>
 <div class="line"><span class="lineno">  315</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -2154,6 +2208,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 
 <p>operator &ndash; (post-decrement) </p>
 <dl class="section return"><dt>Returns</dt><dd>decremented value of this </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00322">322</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  322</span>                                       {</div>
 <div class="line"><span class="lineno">  323</span>        --*<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  324</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -2200,6 +2256,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>subtraction of this and p, returning this </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00335">335</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  335</span>                                           {</div>
 <div class="line"><span class="lineno">  336</span>        <span class="keywordtype">bool</span> app = (p &gt; s);</div>
 <div class="line"><span class="lineno">  337</span>        f = f - app;</div>
@@ -2240,6 +2298,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>subtraction of this and p, returning this </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00347">347</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  347</span>                                                     {</div>
 <div class="line"><span class="lineno">  348</span>        <span class="keywordtype">bool</span> app = s &lt; p.s;</div>
 <div class="line"><span class="lineno">  349</span>        f = f - app - p.f;</div>
@@ -2288,6 +2348,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>unsigned 256-bit quotient. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00458">458</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  458</span>                                           {</div>
 <div class="line"><span class="lineno">  459</span>        <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> tmp = *<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  460</span>        tmp /= <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p);</div>
@@ -2327,13 +2389,10 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>unsigned 256-bit quotient. </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  469</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a8161d52d369e525f4e61129376adfcf1">divide</a>(p).first; }</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="../../d1/d83/classuint256__t_a4fdeb4d4bf8cca4ee99b8487e59831df_cgraph.svg" width="618" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00469">469</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  469</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a8161d52d369e525f4e61129376adfcf1">divide</a>(p).first; }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abc793979ec70bb8e5cf177d83649a259" name="abc793979ec70bb8e5cf177d83649a259"></a>
@@ -2375,6 +2434,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this set as unsigned 256-bit quotient. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00489">489</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  489</span>                                             {</div>
 <div class="line"><span class="lineno">  490</span>        *<span class="keyword">this</span> /= <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p);</div>
 <div class="line"><span class="lineno">  491</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -2413,16 +2474,13 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this set as unsigned 256-bit quotient. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00476">476</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  476</span>                                                     {</div>
 <div class="line"><span class="lineno">  477</span>        *<span class="keyword">this</span> = <a class="code hl_function" href="#a8161d52d369e525f4e61129376adfcf1">divide</a>(p).first;</div>
 <div class="line"><span class="lineno">  478</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  479</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d83/classuint256__t_ac1b36e64de42f3622e7d6ec5efa273d4_cgraph.svg" width="626" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac6bdcf64653af8173987bf7217e99056" name="ac6bdcf64653af8173987bf7217e99056"></a>
@@ -2464,6 +2522,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is less than other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00630">630</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  630</span>                                   {</div>
 <div class="line"><span class="lineno">  631</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> &lt; <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(other);</div>
 <div class="line"><span class="lineno">  632</span>    }</div>
@@ -2501,6 +2561,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is less than other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00543">543</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  543</span>                                                  {</div>
 <div class="line"><span class="lineno">  544</span>        <span class="keywordflow">return</span> f &lt; other.f || (f == other.f &amp;&amp; s &lt; other.s);</div>
 <div class="line"><span class="lineno">  545</span>    }</div>
@@ -2546,6 +2608,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>value of this shifted by p to left </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00733">733</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  733</span>                                     {</div>
 <div class="line"><span class="lineno">  734</span>        <span class="keywordflow">if</span> (!p) {</div>
 <div class="line"><span class="lineno">  735</span>            <span class="keywordflow">return</span> {this-&gt;f, this-&gt;s};</div>
@@ -2597,6 +2661,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this shifted by p to left </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00751">751</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  751</span>                                       {</div>
 <div class="line"><span class="lineno">  752</span>        <span class="keywordflow">if</span> (p) {</div>
 <div class="line"><span class="lineno">  753</span>            <span class="keywordflow">if</span> (p &gt;= 128) {</div>
@@ -2651,6 +2717,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is less than or equal to other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00642">642</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  642</span>                                    {</div>
 <div class="line"><span class="lineno">  643</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> &lt;= <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(other);</div>
 <div class="line"><span class="lineno">  644</span>    }</div>
@@ -2688,6 +2756,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is less than or equal to other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00552">552</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  552</span>                                                   {</div>
 <div class="line"><span class="lineno">  553</span>        <span class="keywordflow">return</span> f &lt; other.f || (f == other.f &amp;&amp; s &lt;= other.s);</div>
 <div class="line"><span class="lineno">  554</span>    }</div>
@@ -2706,7 +2776,7 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
         <tr>
           <td class="memname"><a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp; uint256_t::operator= </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>p</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>p</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -2725,16 +2795,13 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this pointer with it's value equal to <code>p</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00202">202</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  202</span>                                                    {</div>
 <div class="line"><span class="lineno">  203</span>        <a class="code hl_function" href="#afee82fa5052e9d8c946b9205b943cec4">__get_integer_from_string</a>(p);</div>
 <div class="line"><span class="lineno">  204</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  205</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d83/classuint256__t_a86aab081bb7db2771e4a4f30c3eed8e2_cgraph.svg" width="516" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="addff5645f6005e7b50a6ad0731e4f19c" name="addff5645f6005e7b50a6ad0731e4f19c"></a>
@@ -2776,6 +2843,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this pointer with it's value equal to <code>p</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00192">192</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  192</span>                                            {</div>
 <div class="line"><span class="lineno">  193</span>        this-&gt;s = p;</div>
 <div class="line"><span class="lineno">  194</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -2856,6 +2925,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is equal to other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00678">678</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  678</span>                                    {</div>
 <div class="line"><span class="lineno">  679</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> == <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(other);</div>
 <div class="line"><span class="lineno">  680</span>    }</div>
@@ -2893,6 +2964,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is equal than other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00579">579</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  579</span>                                                   {</div>
 <div class="line"><span class="lineno">  580</span>        <span class="keywordflow">return</span> f == other.f &amp;&amp; s == other.s;</div>
 <div class="line"><span class="lineno">  581</span>    }</div>
@@ -2938,6 +3011,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is greater than other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00654">654</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  654</span>                                   {</div>
 <div class="line"><span class="lineno">  655</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> &gt; <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(other);</div>
 <div class="line"><span class="lineno">  656</span>    }</div>
@@ -2975,6 +3050,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is greater than other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00561">561</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  561</span>                                                  {</div>
 <div class="line"><span class="lineno">  562</span>        <span class="keywordflow">return</span> f &gt; other.f || (f == other.f &amp;&amp; s &gt; other.s);</div>
 <div class="line"><span class="lineno">  563</span>    }</div>
@@ -3020,6 +3097,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is greater than or equal other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00666">666</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  666</span>                                    {</div>
 <div class="line"><span class="lineno">  667</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> &gt;= <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(other);</div>
 <div class="line"><span class="lineno">  668</span>    }</div>
@@ -3057,6 +3136,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is greater than or equal than other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00570">570</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  570</span>                                                   {</div>
 <div class="line"><span class="lineno">  571</span>        <span class="keywordflow">return</span> (f &gt; other.f) || (f == other.f &amp;&amp; s &gt;= other.s);</div>
 <div class="line"><span class="lineno">  572</span>    }</div>
@@ -3102,6 +3183,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>value of this shifted by p to right </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00772">772</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  772</span>                                     {</div>
 <div class="line"><span class="lineno">  773</span>        <span class="keywordflow">if</span> (!p) {</div>
 <div class="line"><span class="lineno">  774</span>            <span class="keywordflow">return</span> {this-&gt;f, this-&gt;s};</div>
@@ -3153,6 +3236,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this shifted by p to right </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00790">790</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  790</span>                                       {</div>
 <div class="line"><span class="lineno">  791</span>        <span class="keywordflow">if</span> (p) {</div>
 <div class="line"><span class="lineno">  792</span>            <span class="keywordflow">if</span> (p &gt;= 128) {</div>
@@ -3207,6 +3292,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>value of this ^ p (^ is bit-wise <a class="el" href="../../d7/d47/namespace_x_o_r.html" title="Functions for XOR cipher algorithm.">XOR</a> operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00901">901</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  901</span>                                           {</div>
 <div class="line"><span class="lineno">  902</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(f, s ^ p);</div>
 <div class="line"><span class="lineno">  903</span>    }</div>
@@ -3244,6 +3331,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>value of this ^ p (^ is bit-wise <a class="el" href="../../d7/d47/namespace_x_o_r.html" title="Functions for XOR cipher algorithm.">XOR</a> operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00910">910</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  910</span>                                                   {</div>
 <div class="line"><span class="lineno">  911</span>        <span class="keywordflow">return</span> {this-&gt;f ^ p.f, this-&gt;s ^ p.s};</div>
 <div class="line"><span class="lineno">  912</span>    }</div>
@@ -3289,6 +3378,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this = this ^ p (^ is bit-wise <a class="el" href="../../d7/d47/namespace_x_o_r.html" title="Functions for XOR cipher algorithm.">XOR</a> operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00933">933</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  933</span>                                             {</div>
 <div class="line"><span class="lineno">  934</span>        s ^= p;</div>
 <div class="line"><span class="lineno">  935</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -3327,6 +3418,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this = this ^ p (^ is bit-wise <a class="el" href="../../d7/d47/namespace_x_o_r.html" title="Functions for XOR cipher algorithm.">XOR</a> operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00919">919</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  919</span>                                                     {</div>
 <div class="line"><span class="lineno">  920</span>        f ^= p.f;</div>
 <div class="line"><span class="lineno">  921</span>        s ^= p.s;</div>
@@ -3374,6 +3467,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>value of this | p (| is bit-wise operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00856">856</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  856</span>                                           {</div>
 <div class="line"><span class="lineno">  857</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> | <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p);</div>
 <div class="line"><span class="lineno">  858</span>    }</div>
@@ -3411,6 +3506,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>value of this | p (| is bit-wise OR operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00865">865</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  865</span>                                                   {</div>
 <div class="line"><span class="lineno">  866</span>        <span class="keywordflow">return</span> {this-&gt;f | p.f, this-&gt;s | p.s};</div>
 <div class="line"><span class="lineno">  867</span>    }</div>
@@ -3456,6 +3553,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this = this | p (| is bit-wise OR operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00877">877</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  877</span>                                             {</div>
 <div class="line"><span class="lineno">  878</span>        s |= p;</div>
 <div class="line"><span class="lineno">  879</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -3494,6 +3593,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this = this | p (| is bit-wise OR operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00887">887</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  887</span>                                                     {</div>
 <div class="line"><span class="lineno">  888</span>        f |= p.f;</div>
 <div class="line"><span class="lineno">  889</span>        s |= p.s;</div>
@@ -3541,6 +3642,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is either one of the values are non-zero, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00715">715</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  715</span>                                       {</div>
 <div class="line"><span class="lineno">  716</span>        <span class="keywordflow">return</span> (s || f) || (b);</div>
 <div class="line"><span class="lineno">  717</span>    }</div>
@@ -3578,6 +3681,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if one of the values are not zero, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00612">612</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  612</span>                                               {</div>
 <div class="line"><span class="lineno">  613</span>        <span class="keywordflow">return</span> (s || f) || (b.s || b.f);</div>
 <div class="line"><span class="lineno">  614</span>    }</div>
@@ -3609,6 +3714,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 
 <p>operator ~ for <a class="el" href="../../d1/d83/classuint256__t.html" title="class for 256-bit unsigned integer">uint256_t</a> </p>
 <dl class="section return"><dt>Returns</dt><dd>1's complement of this number </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00723">723</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  723</span>{ <span class="keywordflow">return</span> {~f, ~s}; }</div>
 </div><!-- fragment -->
 </div>
@@ -3638,6 +3745,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 
 <p>returns upper 128-bit integer part </p>
 <dl class="section return"><dt>Returns</dt><dd>returns upper 128-bit integer part </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00175">175</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  175</span>{ <span class="keywordflow">return</span> f; }</div>
 </div><!-- fragment -->
 </div>
@@ -3653,9 +3762,9 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; operator&lt;&lt; </td>
+          <td class="memname">std::ostream &amp; operator&lt;&lt; </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>op</em></span>, </td>
+          <td class="paramtype">std::ostream &amp;</td>          <td class="paramname"><span class="paramname"><em>op</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -3680,11 +3789,13 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>op, ostream object. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00947">947</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  947</span>                                                               {</div>
 <div class="line"><span class="lineno">  948</span>        <span class="keywordflow">if</span> (!p.f) {</div>
 <div class="line"><span class="lineno">  949</span>            op &lt;&lt; p.s;</div>
 <div class="line"><span class="lineno">  950</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  951</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> out = <span class="stringliteral">&quot;0&quot;</span>, p_2 = <span class="stringliteral">&quot;1&quot;</span>;</div>
+<div class="line"><span class="lineno">  951</span>            std::string out = <span class="stringliteral">&quot;0&quot;</span>, p_2 = <span class="stringliteral">&quot;1&quot;</span>;</div>
 <div class="line"><span class="lineno">  952</span>            <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> L(1);</div>
 <div class="line"><span class="lineno">  953</span>            <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; 128; ++i) {</div>
 <div class="line"><span class="lineno">  954</span>                <span class="keywordflow">if</span> ((p.s &amp; L)) {</div>
@@ -3705,8 +3816,7 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 <div class="line"><span class="lineno">  969</span>        }</div>
 <div class="line"><span class="lineno">  970</span>        <span class="keywordflow">return</span> op;</div>
 <div class="line"><span class="lineno">  971</span>    }</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="auint128__t_8hpp_html_a3ff77262ffd6743df5b808d41382a6f3"><div class="ttname"><a href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a></div><div class="ttdeci">std::string add(const std::string &amp;first, const std::string &amp;second)</div><div class="ttdoc">Adding two string.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:38</div></div>
+<div class="ttc" id="auint128__t_8hpp_html_a3ff77262ffd6743df5b808d41382a6f3"><div class="ttname"><a href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a></div><div class="ttdeci">std::string add(const std::string &amp;first, const std::string &amp;second)</div><div class="ttdoc">Adding two string.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00038">uint128_t.hpp:38</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -3730,7 +3840,9 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
-<div class="fragment"><div class="line"><span class="lineno">   34</span>{}, s{};  <span class="comment">/// First and second half of 256 bit number</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00034">34</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   34</span>{}, s{};  </div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -3753,7 +3865,9 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
-<div class="fragment"><div class="line"><span class="lineno">   34</span>{}, s{};  <span class="comment">/// First and second half of 256 bit number</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00034">34</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   34</span>{}, s{};  </div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/d1/d83/classuint256__t_a033d66c965e8d1fbc5bafb59ad60e163_cgraph.map b/d1/d83/classuint256__t_a033d66c965e8d1fbc5bafb59ad60e163_cgraph.map
deleted file mode 100644
index 50e802fd3..000000000
--- a/d1/d83/classuint256__t_a033d66c965e8d1fbc5bafb59ad60e163_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="uint256_t::_lez" name="uint256_t::_lez">
-<area shape="rect" id="Node000001" title="Leading zeroes in binary." alt="" coords="5,5,112,31"/>
-<area shape="rect" id="Node000002" href="$db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" title="Leading zeroes in binary." alt="" coords="160,5,266,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="112,16,144,16,144,21,112,21"/>
-</map>
diff --git a/d1/d83/classuint256__t_a033d66c965e8d1fbc5bafb59ad60e163_cgraph.md5 b/d1/d83/classuint256__t_a033d66c965e8d1fbc5bafb59ad60e163_cgraph.md5
deleted file mode 100644
index 7b6c1d011..000000000
--- a/d1/d83/classuint256__t_a033d66c965e8d1fbc5bafb59ad60e163_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a6306bdf6deee90d0e3f227492d92bd1
\ No newline at end of file
diff --git a/d1/d83/classuint256__t_a033d66c965e8d1fbc5bafb59ad60e163_cgraph.svg b/d1/d83/classuint256__t_a033d66c965e8d1fbc5bafb59ad60e163_cgraph.svg
deleted file mode 100644
index 9a025be16..000000000
--- a/d1/d83/classuint256__t_a033d66c965e8d1fbc5bafb59ad60e163_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::_lez Pages: 1 -->
-<svg width="204pt" height="27pt"
- viewBox="0.00 0.00 203.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint256_t::_lez</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Leading zeroes in binary.">
-<polygon fill="#999999" stroke="#666666" points="79.75,-19.25 0,-19.25 0,0 79.75,0 79.75,-19.25"/>
-<text text-anchor="middle" x="39.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="195.5,-19.25 115.75,-19.25 115.75,0 195.5,0 195.5,-19.25"/>
-<text text-anchor="middle" x="155.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.02,-9.62C87.8,-9.62 96.06,-9.62 104.15,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.89,-13.13 113.89,-9.63 103.89,-6.13 103.89,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d83/classuint256__t_a033d66c965e8d1fbc5bafb59ad60e163_cgraph_org.svg b/d1/d83/classuint256__t_a033d66c965e8d1fbc5bafb59ad60e163_cgraph_org.svg
deleted file mode 100644
index ea22e3f37..000000000
--- a/d1/d83/classuint256__t_a033d66c965e8d1fbc5bafb59ad60e163_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::_lez Pages: 1 -->
-<svg width="204pt" height="27pt"
- viewBox="0.00 0.00 203.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint256_t::_lez</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Leading zeroes in binary.">
-<polygon fill="#999999" stroke="#666666" points="79.75,-19.25 0,-19.25 0,0 79.75,0 79.75,-19.25"/>
-<text text-anchor="middle" x="39.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="195.5,-19.25 115.75,-19.25 115.75,0 195.5,0 195.5,-19.25"/>
-<text text-anchor="middle" x="155.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.02,-9.62C87.8,-9.62 96.06,-9.62 104.15,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.89,-13.13 113.89,-9.63 103.89,-6.13 103.89,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d83/classuint256__t_a1fa3d95584d071add9b46597d3747b39_cgraph.map b/d1/d83/classuint256__t_a1fa3d95584d071add9b46597d3747b39_cgraph.map
deleted file mode 100644
index 44cafcb78..000000000
--- a/d1/d83/classuint256__t_a1fa3d95584d071add9b46597d3747b39_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="uint256_t::uint256_t" name="uint256_t::uint256_t">
-<area shape="rect" id="Node000001" title="Parameterized constructor." alt="" coords="5,13,141,38"/>
-<area shape="rect" id="Node000002" href="$d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4" title="First and second half of 256 bit number." alt="" coords="189,5,349,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="141,23,173,23,173,28,141,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="397,13,508,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="350,23,381,23,381,28,350,28"/>
-</map>
diff --git a/d1/d83/classuint256__t_a1fa3d95584d071add9b46597d3747b39_cgraph.md5 b/d1/d83/classuint256__t_a1fa3d95584d071add9b46597d3747b39_cgraph.md5
deleted file mode 100644
index 09ab20b23..000000000
--- a/d1/d83/classuint256__t_a1fa3d95584d071add9b46597d3747b39_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-82287d363db4656a67d586b9cb86334c
\ No newline at end of file
diff --git a/d1/d83/classuint256__t_a1fa3d95584d071add9b46597d3747b39_cgraph.svg b/d1/d83/classuint256__t_a1fa3d95584d071add9b46597d3747b39_cgraph.svg
deleted file mode 100644
index c5ef33ff8..000000000
--- a/d1/d83/classuint256__t_a1fa3d95584d071add9b46597d3747b39_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::uint256_t Pages: 1 -->
-<svg width="385pt" height="39pt"
- viewBox="0.00 0.00 385.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>uint256_t::uint256_t</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Parameterized constructor.">
-<polygon fill="#999999" stroke="#666666" points="101.5,-24.88 0,-24.88 0,-5.63 101.5,-5.63 101.5,-24.88"/>
-<text text-anchor="middle" x="50.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::uint256_t</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4" target="_top" xlink:title="First and second half of 256 bit number.">
-<polygon fill="white" stroke="#666666" points="257.75,-30.5 137.5,-30.5 137.5,0 257.75,0 257.75,-30.5"/>
-<text text-anchor="start" x="145.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::__get_integer</text>
-<text text-anchor="middle" x="197.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_from_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.61,-15.25C109.4,-15.25 117.57,-15.25 125.72,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.67,-18.75 135.67,-15.25 125.67,-11.75 125.67,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="377.25,-24.88 293.75,-24.88 293.75,-5.63 377.25,-5.63 377.25,-24.88"/>
-<text text-anchor="middle" x="335.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.22,-15.25C266.08,-15.25 274.09,-15.25 281.83,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.78,-18.75 291.78,-15.25 281.78,-11.75 281.78,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d83/classuint256__t_a1fa3d95584d071add9b46597d3747b39_cgraph_org.svg b/d1/d83/classuint256__t_a1fa3d95584d071add9b46597d3747b39_cgraph_org.svg
deleted file mode 100644
index e00b45da3..000000000
--- a/d1/d83/classuint256__t_a1fa3d95584d071add9b46597d3747b39_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::uint256_t Pages: 1 -->
-<svg width="385pt" height="39pt"
- viewBox="0.00 0.00 385.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>uint256_t::uint256_t</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Parameterized constructor.">
-<polygon fill="#999999" stroke="#666666" points="101.5,-24.88 0,-24.88 0,-5.63 101.5,-5.63 101.5,-24.88"/>
-<text text-anchor="middle" x="50.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::uint256_t</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4" target="_top" xlink:title="First and second half of 256 bit number.">
-<polygon fill="white" stroke="#666666" points="257.75,-30.5 137.5,-30.5 137.5,0 257.75,0 257.75,-30.5"/>
-<text text-anchor="start" x="145.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::__get_integer</text>
-<text text-anchor="middle" x="197.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_from_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.61,-15.25C109.4,-15.25 117.57,-15.25 125.72,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.67,-18.75 135.67,-15.25 125.67,-11.75 125.67,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="377.25,-24.88 293.75,-24.88 293.75,-5.63 377.25,-5.63 377.25,-24.88"/>
-<text text-anchor="middle" x="335.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.22,-15.25C266.08,-15.25 274.09,-15.25 281.83,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.78,-18.75 291.78,-15.25 281.78,-11.75 281.78,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d83/classuint256__t_a2cd43a4a92dc825a010a17578b3bdedb_cgraph.map b/d1/d83/classuint256__t_a2cd43a4a92dc825a010a17578b3bdedb_cgraph.map
deleted file mode 100644
index b16b13163..000000000
--- a/d1/d83/classuint256__t_a2cd43a4a92dc825a010a17578b3bdedb_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="uint256_t::operator%=" name="uint256_t::operator%=">
-<area shape="rect" id="Node000001" title="operator %= for uint256_t" alt="" coords="5,5,155,31"/>
-<area shape="rect" id="Node000002" href="$d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1" title="divide function for uint256_t and other integer types." alt="" coords="203,5,319,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,16,187,16,187,21,155,21"/>
-<area shape="rect" id="Node000003" href="$d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163" title="Leading zeroes in binary." alt="" coords="367,5,473,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="320,16,351,16,351,21,320,21"/>
-<area shape="rect" id="Node000004" href="$db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" title="Leading zeroes in binary." alt="" coords="521,5,628,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="474,16,506,16,506,21,474,21"/>
-</map>
diff --git a/d1/d83/classuint256__t_a2cd43a4a92dc825a010a17578b3bdedb_cgraph.md5 b/d1/d83/classuint256__t_a2cd43a4a92dc825a010a17578b3bdedb_cgraph.md5
deleted file mode 100644
index 8f08c73c4..000000000
--- a/d1/d83/classuint256__t_a2cd43a4a92dc825a010a17578b3bdedb_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7a987e761f35480973c839c21a12edb4
\ No newline at end of file
diff --git a/d1/d83/classuint256__t_a2cd43a4a92dc825a010a17578b3bdedb_cgraph.svg b/d1/d83/classuint256__t_a2cd43a4a92dc825a010a17578b3bdedb_cgraph.svg
deleted file mode 100644
index 65ea4a69c..000000000
--- a/d1/d83/classuint256__t_a2cd43a4a92dc825a010a17578b3bdedb_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::operator%= Pages: 1 -->
-<svg width="475pt" height="27pt"
- viewBox="0.00 0.00 474.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint256_t::operator%=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator %= for uint256_t">
-<polygon fill="#999999" stroke="#666666" points="112,-19.25 0,-19.25 0,0 112,0 112,-19.25"/>
-<text text-anchor="middle" x="56" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::operator%=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1" target="_top" xlink:title="divide function for uint256_t and other integer types.">
-<polygon fill="white" stroke="#666666" points="235.25,-19.25 148,-19.25 148,0 235.25,0 235.25,-19.25"/>
-<text text-anchor="middle" x="191.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.12,-9.62C120.14,-9.62 128.39,-9.62 136.39,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.36,-13.13 146.36,-9.63 136.36,-6.13 136.36,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="351,-19.25 271.25,-19.25 271.25,0 351,0 351,-19.25"/>
-<text text-anchor="middle" x="311.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.71,-9.62C243.46,-9.62 251.59,-9.62 259.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="259.42,-13.13 269.42,-9.63 259.42,-6.13 259.42,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="466.75,-19.25 387,-19.25 387,0 466.75,0 466.75,-19.25"/>
-<text text-anchor="middle" x="426.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M351.27,-9.62C359.05,-9.62 367.31,-9.62 375.4,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="375.14,-13.13 385.14,-9.63 375.14,-6.13 375.14,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d83/classuint256__t_a2cd43a4a92dc825a010a17578b3bdedb_cgraph_org.svg b/d1/d83/classuint256__t_a2cd43a4a92dc825a010a17578b3bdedb_cgraph_org.svg
deleted file mode 100644
index 4f1910a29..000000000
--- a/d1/d83/classuint256__t_a2cd43a4a92dc825a010a17578b3bdedb_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::operator%= Pages: 1 -->
-<svg width="475pt" height="27pt"
- viewBox="0.00 0.00 474.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint256_t::operator%=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator %= for uint256_t">
-<polygon fill="#999999" stroke="#666666" points="112,-19.25 0,-19.25 0,0 112,0 112,-19.25"/>
-<text text-anchor="middle" x="56" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::operator%=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1" target="_top" xlink:title="divide function for uint256_t and other integer types.">
-<polygon fill="white" stroke="#666666" points="235.25,-19.25 148,-19.25 148,0 235.25,0 235.25,-19.25"/>
-<text text-anchor="middle" x="191.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.12,-9.62C120.14,-9.62 128.39,-9.62 136.39,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.36,-13.13 146.36,-9.63 136.36,-6.13 136.36,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="351,-19.25 271.25,-19.25 271.25,0 351,0 351,-19.25"/>
-<text text-anchor="middle" x="311.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.71,-9.62C243.46,-9.62 251.59,-9.62 259.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="259.42,-13.13 269.42,-9.63 259.42,-6.13 259.42,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="466.75,-19.25 387,-19.25 387,0 466.75,0 466.75,-19.25"/>
-<text text-anchor="middle" x="426.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M351.27,-9.62C359.05,-9.62 367.31,-9.62 375.4,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="375.14,-13.13 385.14,-9.63 375.14,-6.13 375.14,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d83/classuint256__t_a4645040fe68ff01d83400f173fd2bb21_cgraph.map b/d1/d83/classuint256__t_a4645040fe68ff01d83400f173fd2bb21_cgraph.map
deleted file mode 100644
index e4bf52f30..000000000
--- a/d1/d83/classuint256__t_a4645040fe68ff01d83400f173fd2bb21_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="uint256_t::operator*=" name="uint256_t::operator*=">
-<area shape="rect" id="Node000001" title="operator *= for uint256_t and other integer types." alt="" coords="5,31,148,56"/>
-<area shape="rect" id="Node000002" href="$db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd" title="returns lower 64&#45;bit integer part" alt="" coords="196,5,310,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="148,31,180,26,181,31,148,36"/>
-<area shape="rect" id="Node000003" href="$db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705" title="returns upper 64&#45;bit integer part" alt="" coords="196,55,310,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="148,51,181,55,180,60,148,56"/>
-</map>
diff --git a/d1/d83/classuint256__t_a4645040fe68ff01d83400f173fd2bb21_cgraph.md5 b/d1/d83/classuint256__t_a4645040fe68ff01d83400f173fd2bb21_cgraph.md5
deleted file mode 100644
index 60ea0effa..000000000
--- a/d1/d83/classuint256__t_a4645040fe68ff01d83400f173fd2bb21_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bf89c6a6c37380003cda6d77ede3db5b
\ No newline at end of file
diff --git a/d1/d83/classuint256__t_a4645040fe68ff01d83400f173fd2bb21_cgraph.svg b/d1/d83/classuint256__t_a4645040fe68ff01d83400f173fd2bb21_cgraph.svg
deleted file mode 100644
index d256a1bf7..000000000
--- a/d1/d83/classuint256__t_a4645040fe68ff01d83400f173fd2bb21_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::operator*= Pages: 1 -->
-<svg width="237pt" height="64pt"
- viewBox="0.00 0.00 236.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>uint256_t::operator*=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator *= for uint256_t and other integer types.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-37.25 0,-37.25 0,-18 106.75,-18 106.75,-37.25"/>
-<text text-anchor="middle" x="53.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::operator*=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd" target="_top" xlink:title="returns lower 64&#45;bit integer part">
-<polygon fill="white" stroke="#666666" points="228.12,-56.25 143.12,-56.25 143.12,-37 228.12,-37 228.12,-56.25"/>
-<text text-anchor="middle" x="185.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::lower</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.98,-35.3C115.04,-36.47 123.37,-37.69 131.44,-38.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.74,-42.3 141.14,-40.28 131.75,-35.37 130.74,-42.3"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705" target="_top" xlink:title="returns upper 64&#45;bit integer part">
-<polygon fill="white" stroke="#666666" points="228.5,-19.25 142.75,-19.25 142.75,0 228.5,0 228.5,-19.25"/>
-<text text-anchor="middle" x="185.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::upper</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.98,-20.36C115.04,-19.24 123.37,-18.09 131.44,-16.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.71,-20.47 141.14,-15.64 130.75,-13.54 131.71,-20.47"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d83/classuint256__t_a4645040fe68ff01d83400f173fd2bb21_cgraph_org.svg b/d1/d83/classuint256__t_a4645040fe68ff01d83400f173fd2bb21_cgraph_org.svg
deleted file mode 100644
index 17cb3f7b7..000000000
--- a/d1/d83/classuint256__t_a4645040fe68ff01d83400f173fd2bb21_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::operator*= Pages: 1 -->
-<svg width="237pt" height="64pt"
- viewBox="0.00 0.00 236.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>uint256_t::operator*=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator *= for uint256_t and other integer types.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-37.25 0,-37.25 0,-18 106.75,-18 106.75,-37.25"/>
-<text text-anchor="middle" x="53.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::operator*=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd" target="_top" xlink:title="returns lower 64&#45;bit integer part">
-<polygon fill="white" stroke="#666666" points="228.12,-56.25 143.12,-56.25 143.12,-37 228.12,-37 228.12,-56.25"/>
-<text text-anchor="middle" x="185.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::lower</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.98,-35.3C115.04,-36.47 123.37,-37.69 131.44,-38.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.74,-42.3 141.14,-40.28 131.75,-35.37 130.74,-42.3"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705" target="_top" xlink:title="returns upper 64&#45;bit integer part">
-<polygon fill="white" stroke="#666666" points="228.5,-19.25 142.75,-19.25 142.75,0 228.5,0 228.5,-19.25"/>
-<text text-anchor="middle" x="185.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::upper</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.98,-20.36C115.04,-19.24 123.37,-18.09 131.44,-16.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.71,-20.47 141.14,-15.64 130.75,-13.54 131.71,-20.47"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d83/classuint256__t_a4fdeb4d4bf8cca4ee99b8487e59831df_cgraph.map b/d1/d83/classuint256__t_a4fdeb4d4bf8cca4ee99b8487e59831df_cgraph.map
deleted file mode 100644
index a51c7d69c..000000000
--- a/d1/d83/classuint256__t_a4fdeb4d4bf8cca4ee99b8487e59831df_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="uint256_t::operator/" name="uint256_t::operator/">
-<area shape="rect" id="Node000001" title="operator / for uint256_t and other integer types." alt="" coords="5,5,139,31"/>
-<area shape="rect" id="Node000002" href="$d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1" title="divide function for uint256_t and other integer types." alt="" coords="187,5,303,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="139,16,171,16,171,21,139,21"/>
-<area shape="rect" id="Node000003" href="$d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163" title="Leading zeroes in binary." alt="" coords="351,5,457,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="304,16,335,16,335,21,304,21"/>
-<area shape="rect" id="Node000004" href="$db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" title="Leading zeroes in binary." alt="" coords="505,5,612,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="458,16,490,16,490,21,458,21"/>
-</map>
diff --git a/d1/d83/classuint256__t_a4fdeb4d4bf8cca4ee99b8487e59831df_cgraph.md5 b/d1/d83/classuint256__t_a4fdeb4d4bf8cca4ee99b8487e59831df_cgraph.md5
deleted file mode 100644
index 8841b9b2c..000000000
--- a/d1/d83/classuint256__t_a4fdeb4d4bf8cca4ee99b8487e59831df_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e4bb2c47829d0e4f5d95765538ac8f58
\ No newline at end of file
diff --git a/d1/d83/classuint256__t_a4fdeb4d4bf8cca4ee99b8487e59831df_cgraph.svg b/d1/d83/classuint256__t_a4fdeb4d4bf8cca4ee99b8487e59831df_cgraph.svg
deleted file mode 100644
index f40e3d7ca..000000000
--- a/d1/d83/classuint256__t_a4fdeb4d4bf8cca4ee99b8487e59831df_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::operator/ Pages: 1 -->
-<svg width="463pt" height="27pt"
- viewBox="0.00 0.00 462.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint256_t::operator/</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator / for uint256_t and other integer types.">
-<polygon fill="#999999" stroke="#666666" points="100,-19.25 0,-19.25 0,0 100,0 100,-19.25"/>
-<text text-anchor="middle" x="50" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::operator/</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1" target="_top" xlink:title="divide function for uint256_t and other integer types.">
-<polygon fill="white" stroke="#666666" points="223.25,-19.25 136,-19.25 136,0 223.25,0 223.25,-19.25"/>
-<text text-anchor="middle" x="179.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.34,-9.62C108.17,-9.62 116.3,-9.62 124.23,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.13,-13.13 134.13,-9.63 124.13,-6.13 124.13,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="339,-19.25 259.25,-19.25 259.25,0 339,0 339,-19.25"/>
-<text text-anchor="middle" x="299.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M223.71,-9.62C231.46,-9.62 239.59,-9.62 247.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="247.42,-13.13 257.42,-9.63 247.42,-6.13 247.42,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="454.75,-19.25 375,-19.25 375,0 454.75,0 454.75,-19.25"/>
-<text text-anchor="middle" x="414.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M339.27,-9.62C347.05,-9.62 355.31,-9.62 363.4,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="363.14,-13.13 373.14,-9.63 363.14,-6.13 363.14,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d83/classuint256__t_a4fdeb4d4bf8cca4ee99b8487e59831df_cgraph_org.svg b/d1/d83/classuint256__t_a4fdeb4d4bf8cca4ee99b8487e59831df_cgraph_org.svg
deleted file mode 100644
index 3445504de..000000000
--- a/d1/d83/classuint256__t_a4fdeb4d4bf8cca4ee99b8487e59831df_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::operator/ Pages: 1 -->
-<svg width="463pt" height="27pt"
- viewBox="0.00 0.00 462.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint256_t::operator/</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator / for uint256_t and other integer types.">
-<polygon fill="#999999" stroke="#666666" points="100,-19.25 0,-19.25 0,0 100,0 100,-19.25"/>
-<text text-anchor="middle" x="50" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::operator/</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1" target="_top" xlink:title="divide function for uint256_t and other integer types.">
-<polygon fill="white" stroke="#666666" points="223.25,-19.25 136,-19.25 136,0 223.25,0 223.25,-19.25"/>
-<text text-anchor="middle" x="179.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.34,-9.62C108.17,-9.62 116.3,-9.62 124.23,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.13,-13.13 134.13,-9.63 124.13,-6.13 124.13,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="339,-19.25 259.25,-19.25 259.25,0 339,0 339,-19.25"/>
-<text text-anchor="middle" x="299.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M223.71,-9.62C231.46,-9.62 239.59,-9.62 247.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="247.42,-13.13 257.42,-9.63 247.42,-6.13 247.42,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="454.75,-19.25 375,-19.25 375,0 454.75,0 454.75,-19.25"/>
-<text text-anchor="middle" x="414.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M339.27,-9.62C347.05,-9.62 355.31,-9.62 363.4,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="363.14,-13.13 373.14,-9.63 363.14,-6.13 363.14,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d83/classuint256__t_a8161d52d369e525f4e61129376adfcf1_cgraph.map b/d1/d83/classuint256__t_a8161d52d369e525f4e61129376adfcf1_cgraph.map
deleted file mode 100644
index b2ffb5a11..000000000
--- a/d1/d83/classuint256__t_a8161d52d369e525f4e61129376adfcf1_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="uint256_t::divide" name="uint256_t::divide">
-<area shape="rect" id="Node000001" title="divide function for uint256_t and other integer types." alt="" coords="5,5,122,31"/>
-<area shape="rect" id="Node000002" href="$d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163" title="Leading zeroes in binary." alt="" coords="170,5,276,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="122,16,154,16,154,21,122,21"/>
-<area shape="rect" id="Node000003" href="$db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" title="Leading zeroes in binary." alt="" coords="324,5,430,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="276,16,309,16,309,21,276,21"/>
-</map>
diff --git a/d1/d83/classuint256__t_a8161d52d369e525f4e61129376adfcf1_cgraph.md5 b/d1/d83/classuint256__t_a8161d52d369e525f4e61129376adfcf1_cgraph.md5
deleted file mode 100644
index c3e76ac11..000000000
--- a/d1/d83/classuint256__t_a8161d52d369e525f4e61129376adfcf1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-768b1aa81fcf7d0b24ef285a7b3ec874
\ No newline at end of file
diff --git a/d1/d83/classuint256__t_a8161d52d369e525f4e61129376adfcf1_cgraph.svg b/d1/d83/classuint256__t_a8161d52d369e525f4e61129376adfcf1_cgraph.svg
deleted file mode 100644
index 2d6302247..000000000
--- a/d1/d83/classuint256__t_a8161d52d369e525f4e61129376adfcf1_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::divide Pages: 1 -->
-<svg width="327pt" height="27pt"
- viewBox="0.00 0.00 326.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint256_t::divide</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="divide function for uint256_t and other integer types.">
-<polygon fill="#999999" stroke="#666666" points="87.25,-19.25 0,-19.25 0,0 87.25,0 87.25,-19.25"/>
-<text text-anchor="middle" x="43.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="203,-19.25 123.25,-19.25 123.25,0 203,0 203,-19.25"/>
-<text text-anchor="middle" x="163.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.71,-9.62C95.46,-9.62 103.59,-9.62 111.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.42,-13.13 121.42,-9.63 111.42,-6.13 111.42,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="318.75,-19.25 239,-19.25 239,0 318.75,0 318.75,-19.25"/>
-<text text-anchor="middle" x="278.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.27,-9.62C211.05,-9.62 219.31,-9.62 227.4,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.14,-13.13 237.14,-9.63 227.14,-6.13 227.14,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d83/classuint256__t_a8161d52d369e525f4e61129376adfcf1_cgraph_org.svg b/d1/d83/classuint256__t_a8161d52d369e525f4e61129376adfcf1_cgraph_org.svg
deleted file mode 100644
index b5481dacb..000000000
--- a/d1/d83/classuint256__t_a8161d52d369e525f4e61129376adfcf1_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::divide Pages: 1 -->
-<svg width="327pt" height="27pt"
- viewBox="0.00 0.00 326.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint256_t::divide</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="divide function for uint256_t and other integer types.">
-<polygon fill="#999999" stroke="#666666" points="87.25,-19.25 0,-19.25 0,0 87.25,0 87.25,-19.25"/>
-<text text-anchor="middle" x="43.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="203,-19.25 123.25,-19.25 123.25,0 203,0 203,-19.25"/>
-<text text-anchor="middle" x="163.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.71,-9.62C95.46,-9.62 103.59,-9.62 111.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.42,-13.13 121.42,-9.63 111.42,-6.13 111.42,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="318.75,-19.25 239,-19.25 239,0 318.75,0 318.75,-19.25"/>
-<text text-anchor="middle" x="278.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.27,-9.62C211.05,-9.62 219.31,-9.62 227.4,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.14,-13.13 237.14,-9.63 227.14,-6.13 227.14,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d83/classuint256__t_a86aab081bb7db2771e4a4f30c3eed8e2_cgraph.map b/d1/d83/classuint256__t_a86aab081bb7db2771e4a4f30c3eed8e2_cgraph.map
deleted file mode 100644
index f0e1b84a7..000000000
--- a/d1/d83/classuint256__t_a86aab081bb7db2771e4a4f30c3eed8e2_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="uint256_t::operator=" name="uint256_t::operator=">
-<area shape="rect" id="Node000001" title="operator = for type string" alt="" coords="5,13,143,38"/>
-<area shape="rect" id="Node000002" href="$d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4" title="First and second half of 256 bit number." alt="" coords="191,5,351,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="143,23,175,23,175,28,143,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="399,13,510,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="352,23,383,23,383,28,352,28"/>
-</map>
diff --git a/d1/d83/classuint256__t_a86aab081bb7db2771e4a4f30c3eed8e2_cgraph.md5 b/d1/d83/classuint256__t_a86aab081bb7db2771e4a4f30c3eed8e2_cgraph.md5
deleted file mode 100644
index 1fd755ab5..000000000
--- a/d1/d83/classuint256__t_a86aab081bb7db2771e4a4f30c3eed8e2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3a991d0a858be06f3481667a7a905481
\ No newline at end of file
diff --git a/d1/d83/classuint256__t_a86aab081bb7db2771e4a4f30c3eed8e2_cgraph.svg b/d1/d83/classuint256__t_a86aab081bb7db2771e4a4f30c3eed8e2_cgraph.svg
deleted file mode 100644
index fca365550..000000000
--- a/d1/d83/classuint256__t_a86aab081bb7db2771e4a4f30c3eed8e2_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::operator= Pages: 1 -->
-<svg width="387pt" height="39pt"
- viewBox="0.00 0.00 386.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>uint256_t::operator=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator = for type string">
-<polygon fill="#999999" stroke="#666666" points="103,-24.88 0,-24.88 0,-5.63 103,-5.63 103,-24.88"/>
-<text text-anchor="middle" x="51.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::operator=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4" target="_top" xlink:title="First and second half of 256 bit number.">
-<polygon fill="white" stroke="#666666" points="259.25,-30.5 139,-30.5 139,0 259.25,0 259.25,-30.5"/>
-<text text-anchor="start" x="147" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::__get_integer</text>
-<text text-anchor="middle" x="199.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_from_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.43,-15.25C111.18,-15.25 119.29,-15.25 127.37,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.22,-18.75 137.22,-15.25 127.22,-11.75 127.22,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="378.75,-24.88 295.25,-24.88 295.25,-5.63 378.75,-5.63 378.75,-24.88"/>
-<text text-anchor="middle" x="337" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.72,-15.25C267.58,-15.25 275.59,-15.25 283.33,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="283.28,-18.75 293.28,-15.25 283.28,-11.75 283.28,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d83/classuint256__t_a86aab081bb7db2771e4a4f30c3eed8e2_cgraph_org.svg b/d1/d83/classuint256__t_a86aab081bb7db2771e4a4f30c3eed8e2_cgraph_org.svg
deleted file mode 100644
index 5440f1c0a..000000000
--- a/d1/d83/classuint256__t_a86aab081bb7db2771e4a4f30c3eed8e2_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::operator= Pages: 1 -->
-<svg width="387pt" height="39pt"
- viewBox="0.00 0.00 386.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>uint256_t::operator=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator = for type string">
-<polygon fill="#999999" stroke="#666666" points="103,-24.88 0,-24.88 0,-5.63 103,-5.63 103,-24.88"/>
-<text text-anchor="middle" x="51.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::operator=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4" target="_top" xlink:title="First and second half of 256 bit number.">
-<polygon fill="white" stroke="#666666" points="259.25,-30.5 139,-30.5 139,0 259.25,0 259.25,-30.5"/>
-<text text-anchor="start" x="147" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::__get_integer</text>
-<text text-anchor="middle" x="199.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_from_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.43,-15.25C111.18,-15.25 119.29,-15.25 127.37,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.22,-18.75 137.22,-15.25 127.22,-11.75 127.22,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="378.75,-24.88 295.25,-24.88 295.25,-5.63 378.75,-5.63 378.75,-24.88"/>
-<text text-anchor="middle" x="337" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.72,-15.25C267.58,-15.25 275.59,-15.25 283.33,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="283.28,-18.75 293.28,-15.25 283.28,-11.75 283.28,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d83/classuint256__t_a9ddd133cee83f3a2ab6ed60a7ccbc250_cgraph.map b/d1/d83/classuint256__t_a9ddd133cee83f3a2ab6ed60a7ccbc250_cgraph.map
deleted file mode 100644
index da80a7f9d..000000000
--- a/d1/d83/classuint256__t_a9ddd133cee83f3a2ab6ed60a7ccbc250_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="uint256_t::_trz" name="uint256_t::_trz">
-<area shape="rect" id="Node000001" title="Trailing zeroes in binary." alt="" coords="5,5,110,31"/>
-<area shape="rect" id="Node000002" href="$db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e" title="Trailing zeroes in binary." alt="" coords="158,5,262,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="110,16,142,16,142,21,110,21"/>
-</map>
diff --git a/d1/d83/classuint256__t_a9ddd133cee83f3a2ab6ed60a7ccbc250_cgraph.md5 b/d1/d83/classuint256__t_a9ddd133cee83f3a2ab6ed60a7ccbc250_cgraph.md5
deleted file mode 100644
index 09fc63044..000000000
--- a/d1/d83/classuint256__t_a9ddd133cee83f3a2ab6ed60a7ccbc250_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-80cf2759504ea0eeba25360dbd0cff84
\ No newline at end of file
diff --git a/d1/d83/classuint256__t_a9ddd133cee83f3a2ab6ed60a7ccbc250_cgraph.svg b/d1/d83/classuint256__t_a9ddd133cee83f3a2ab6ed60a7ccbc250_cgraph.svg
deleted file mode 100644
index 56b58dbc4..000000000
--- a/d1/d83/classuint256__t_a9ddd133cee83f3a2ab6ed60a7ccbc250_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::_trz Pages: 1 -->
-<svg width="201pt" height="27pt"
- viewBox="0.00 0.00 200.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint256_t::_trz</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Trailing zeroes in binary.">
-<polygon fill="#999999" stroke="#666666" points="78.25,-19.25 0,-19.25 0,0 78.25,0 78.25,-19.25"/>
-<text text-anchor="middle" x="39.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::_trz</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e" target="_top" xlink:title="Trailing zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="192.5,-19.25 114.25,-19.25 114.25,0 192.5,0 192.5,-19.25"/>
-<text text-anchor="middle" x="153.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_trz</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M78.44,-9.62C86.21,-9.62 94.49,-9.62 102.59,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.34,-13.13 112.34,-9.63 102.34,-6.13 102.34,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d83/classuint256__t_a9ddd133cee83f3a2ab6ed60a7ccbc250_cgraph_org.svg b/d1/d83/classuint256__t_a9ddd133cee83f3a2ab6ed60a7ccbc250_cgraph_org.svg
deleted file mode 100644
index 36f2d2f87..000000000
--- a/d1/d83/classuint256__t_a9ddd133cee83f3a2ab6ed60a7ccbc250_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::_trz Pages: 1 -->
-<svg width="201pt" height="27pt"
- viewBox="0.00 0.00 200.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint256_t::_trz</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Trailing zeroes in binary.">
-<polygon fill="#999999" stroke="#666666" points="78.25,-19.25 0,-19.25 0,0 78.25,0 78.25,-19.25"/>
-<text text-anchor="middle" x="39.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::_trz</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e" target="_top" xlink:title="Trailing zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="192.5,-19.25 114.25,-19.25 114.25,0 192.5,0 192.5,-19.25"/>
-<text text-anchor="middle" x="153.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_trz</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M78.44,-9.62C86.21,-9.62 94.49,-9.62 102.59,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.34,-13.13 112.34,-9.63 102.34,-6.13 102.34,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d83/classuint256__t_aa9e585b186e71d7cbe9c1d7387c38967_cgraph.map b/d1/d83/classuint256__t_aa9e585b186e71d7cbe9c1d7387c38967_cgraph.map
deleted file mode 100644
index 1c9eae786..000000000
--- a/d1/d83/classuint256__t_aa9e585b186e71d7cbe9c1d7387c38967_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="uint256_t::operator*" name="uint256_t::operator*">
-<area shape="rect" id="Node000001" title="operator * for uint256_t and other integer types." alt="" coords="5,31,140,56"/>
-<area shape="rect" id="Node000002" href="$db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd" title="returns lower 64&#45;bit integer part" alt="" coords="188,5,302,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="140,31,172,26,173,31,140,36"/>
-<area shape="rect" id="Node000003" href="$db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705" title="returns upper 64&#45;bit integer part" alt="" coords="188,55,302,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="140,50,173,55,172,60,140,55"/>
-</map>
diff --git a/d1/d83/classuint256__t_aa9e585b186e71d7cbe9c1d7387c38967_cgraph.md5 b/d1/d83/classuint256__t_aa9e585b186e71d7cbe9c1d7387c38967_cgraph.md5
deleted file mode 100644
index e53c6d0b8..000000000
--- a/d1/d83/classuint256__t_aa9e585b186e71d7cbe9c1d7387c38967_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f1570da2ddfc346f81c4084c655f62a7
\ No newline at end of file
diff --git a/d1/d83/classuint256__t_aa9e585b186e71d7cbe9c1d7387c38967_cgraph.svg b/d1/d83/classuint256__t_aa9e585b186e71d7cbe9c1d7387c38967_cgraph.svg
deleted file mode 100644
index 796b9caeb..000000000
--- a/d1/d83/classuint256__t_aa9e585b186e71d7cbe9c1d7387c38967_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::operator* Pages: 1 -->
-<svg width="231pt" height="64pt"
- viewBox="0.00 0.00 230.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>uint256_t::operator*</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator * for uint256_t and other integer types.">
-<polygon fill="#999999" stroke="#666666" points="100.75,-37.25 0,-37.25 0,-18 100.75,-18 100.75,-37.25"/>
-<text text-anchor="middle" x="50.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::operator*</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd" target="_top" xlink:title="returns lower 64&#45;bit integer part">
-<polygon fill="white" stroke="#666666" points="222.12,-56.25 137.12,-56.25 137.12,-37 222.12,-37 222.12,-56.25"/>
-<text text-anchor="middle" x="179.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::lower</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.94,-35.03C109,-36.23 117.38,-37.48 125.53,-38.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.92,-42.14 135.33,-40.16 125.95,-35.22 124.92,-42.14"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705" target="_top" xlink:title="returns upper 64&#45;bit integer part">
-<polygon fill="white" stroke="#666666" points="222.5,-19.25 136.75,-19.25 136.75,0 222.5,0 222.5,-19.25"/>
-<text text-anchor="middle" x="179.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::upper</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.94,-20.61C108.91,-19.49 117.18,-18.32 125.24,-17.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.51,-20.67 134.92,-15.81 124.53,-13.74 125.51,-20.67"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d83/classuint256__t_aa9e585b186e71d7cbe9c1d7387c38967_cgraph_org.svg b/d1/d83/classuint256__t_aa9e585b186e71d7cbe9c1d7387c38967_cgraph_org.svg
deleted file mode 100644
index 6e757169b..000000000
--- a/d1/d83/classuint256__t_aa9e585b186e71d7cbe9c1d7387c38967_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::operator* Pages: 1 -->
-<svg width="231pt" height="64pt"
- viewBox="0.00 0.00 230.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>uint256_t::operator*</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator * for uint256_t and other integer types.">
-<polygon fill="#999999" stroke="#666666" points="100.75,-37.25 0,-37.25 0,-18 100.75,-18 100.75,-37.25"/>
-<text text-anchor="middle" x="50.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::operator*</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd" target="_top" xlink:title="returns lower 64&#45;bit integer part">
-<polygon fill="white" stroke="#666666" points="222.12,-56.25 137.12,-56.25 137.12,-37 222.12,-37 222.12,-56.25"/>
-<text text-anchor="middle" x="179.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::lower</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.94,-35.03C109,-36.23 117.38,-37.48 125.53,-38.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.92,-42.14 135.33,-40.16 125.95,-35.22 124.92,-42.14"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705" target="_top" xlink:title="returns upper 64&#45;bit integer part">
-<polygon fill="white" stroke="#666666" points="222.5,-19.25 136.75,-19.25 136.75,0 222.5,0 222.5,-19.25"/>
-<text text-anchor="middle" x="179.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::upper</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.94,-20.61C108.91,-19.49 117.18,-18.32 125.24,-17.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.51,-20.67 134.92,-15.81 124.53,-13.74 125.51,-20.67"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d83/classuint256__t_ac1b36e64de42f3622e7d6ec5efa273d4_cgraph.map b/d1/d83/classuint256__t_ac1b36e64de42f3622e7d6ec5efa273d4_cgraph.map
deleted file mode 100644
index 9d36ed420..000000000
--- a/d1/d83/classuint256__t_ac1b36e64de42f3622e7d6ec5efa273d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="uint256_t::operator/=" name="uint256_t::operator/=">
-<area shape="rect" id="Node000001" title="operator /= for uint256_t" alt="" coords="5,5,147,31"/>
-<area shape="rect" id="Node000002" href="$d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1" title="divide function for uint256_t and other integer types." alt="" coords="195,5,311,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="147,16,179,16,179,21,147,21"/>
-<area shape="rect" id="Node000003" href="$d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163" title="Leading zeroes in binary." alt="" coords="359,5,465,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="312,16,343,16,343,21,312,21"/>
-<area shape="rect" id="Node000004" href="$db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" title="Leading zeroes in binary." alt="" coords="513,5,620,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="466,16,498,16,498,21,466,21"/>
-</map>
diff --git a/d1/d83/classuint256__t_ac1b36e64de42f3622e7d6ec5efa273d4_cgraph.md5 b/d1/d83/classuint256__t_ac1b36e64de42f3622e7d6ec5efa273d4_cgraph.md5
deleted file mode 100644
index af4727512..000000000
--- a/d1/d83/classuint256__t_ac1b36e64de42f3622e7d6ec5efa273d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c10efc5fa2738f7bbc6150ac81c51deb
\ No newline at end of file
diff --git a/d1/d83/classuint256__t_ac1b36e64de42f3622e7d6ec5efa273d4_cgraph.svg b/d1/d83/classuint256__t_ac1b36e64de42f3622e7d6ec5efa273d4_cgraph.svg
deleted file mode 100644
index ef54538e4..000000000
--- a/d1/d83/classuint256__t_ac1b36e64de42f3622e7d6ec5efa273d4_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::operator/= Pages: 1 -->
-<svg width="469pt" height="27pt"
- viewBox="0.00 0.00 468.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint256_t::operator/=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator /= for uint256_t">
-<polygon fill="#999999" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
-<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::operator/=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1" target="_top" xlink:title="divide function for uint256_t and other integer types.">
-<polygon fill="white" stroke="#666666" points="229.25,-19.25 142,-19.25 142,0 229.25,0 229.25,-19.25"/>
-<text text-anchor="middle" x="185.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.38,-9.62C114.29,-9.62 122.47,-9.62 130.43,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.35,-13.13 140.35,-9.63 130.35,-6.13 130.35,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="345,-19.25 265.25,-19.25 265.25,0 345,0 345,-19.25"/>
-<text text-anchor="middle" x="305.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.71,-9.62C237.46,-9.62 245.59,-9.62 253.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.42,-13.13 263.42,-9.63 253.42,-6.13 253.42,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="460.75,-19.25 381,-19.25 381,0 460.75,0 460.75,-19.25"/>
-<text text-anchor="middle" x="420.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M345.27,-9.62C353.05,-9.62 361.31,-9.62 369.4,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="369.14,-13.13 379.14,-9.63 369.14,-6.13 369.14,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d83/classuint256__t_ac1b36e64de42f3622e7d6ec5efa273d4_cgraph_org.svg b/d1/d83/classuint256__t_ac1b36e64de42f3622e7d6ec5efa273d4_cgraph_org.svg
deleted file mode 100644
index cf7c3bfda..000000000
--- a/d1/d83/classuint256__t_ac1b36e64de42f3622e7d6ec5efa273d4_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::operator/= Pages: 1 -->
-<svg width="469pt" height="27pt"
- viewBox="0.00 0.00 468.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint256_t::operator/=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator /= for uint256_t">
-<polygon fill="#999999" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
-<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::operator/=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1" target="_top" xlink:title="divide function for uint256_t and other integer types.">
-<polygon fill="white" stroke="#666666" points="229.25,-19.25 142,-19.25 142,0 229.25,0 229.25,-19.25"/>
-<text text-anchor="middle" x="185.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.38,-9.62C114.29,-9.62 122.47,-9.62 130.43,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.35,-13.13 140.35,-9.63 130.35,-6.13 130.35,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="345,-19.25 265.25,-19.25 265.25,0 345,0 345,-19.25"/>
-<text text-anchor="middle" x="305.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.71,-9.62C237.46,-9.62 245.59,-9.62 253.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.42,-13.13 263.42,-9.63 253.42,-6.13 253.42,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="460.75,-19.25 381,-19.25 381,0 460.75,0 460.75,-19.25"/>
-<text text-anchor="middle" x="420.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M345.27,-9.62C353.05,-9.62 361.31,-9.62 369.4,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="369.14,-13.13 379.14,-9.63 369.14,-6.13 369.14,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d83/classuint256__t_ad4928175eaaaa2b559bc945affe63ad2_cgraph.map b/d1/d83/classuint256__t_ad4928175eaaaa2b559bc945affe63ad2_cgraph.map
deleted file mode 100644
index 4b4bf5b98..000000000
--- a/d1/d83/classuint256__t_ad4928175eaaaa2b559bc945affe63ad2_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="uint256_t::operator%" name="uint256_t::operator%">
-<area shape="rect" id="Node000001" title="operator % for uint256_t" alt="" coords="5,5,147,31"/>
-<area shape="rect" id="Node000002" href="$d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1" title="divide function for uint256_t and other integer types." alt="" coords="195,5,311,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="147,16,179,16,179,21,147,21"/>
-<area shape="rect" id="Node000003" href="$d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163" title="Leading zeroes in binary." alt="" coords="359,5,465,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="312,16,343,16,343,21,312,21"/>
-<area shape="rect" id="Node000004" href="$db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" title="Leading zeroes in binary." alt="" coords="513,5,620,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="466,16,498,16,498,21,466,21"/>
-</map>
diff --git a/d1/d83/classuint256__t_ad4928175eaaaa2b559bc945affe63ad2_cgraph.md5 b/d1/d83/classuint256__t_ad4928175eaaaa2b559bc945affe63ad2_cgraph.md5
deleted file mode 100644
index 2608db9b3..000000000
--- a/d1/d83/classuint256__t_ad4928175eaaaa2b559bc945affe63ad2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-17c740d91c829e469449e942cadc89a0
\ No newline at end of file
diff --git a/d1/d83/classuint256__t_ad4928175eaaaa2b559bc945affe63ad2_cgraph.svg b/d1/d83/classuint256__t_ad4928175eaaaa2b559bc945affe63ad2_cgraph.svg
deleted file mode 100644
index 8b10a4ded..000000000
--- a/d1/d83/classuint256__t_ad4928175eaaaa2b559bc945affe63ad2_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::operator% Pages: 1 -->
-<svg width="469pt" height="27pt"
- viewBox="0.00 0.00 468.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint256_t::operator%</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator % for uint256_t">
-<polygon fill="#999999" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
-<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::operator%</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1" target="_top" xlink:title="divide function for uint256_t and other integer types.">
-<polygon fill="white" stroke="#666666" points="229.25,-19.25 142,-19.25 142,0 229.25,0 229.25,-19.25"/>
-<text text-anchor="middle" x="185.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.38,-9.62C114.29,-9.62 122.47,-9.62 130.43,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.35,-13.13 140.35,-9.63 130.35,-6.13 130.35,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="345,-19.25 265.25,-19.25 265.25,0 345,0 345,-19.25"/>
-<text text-anchor="middle" x="305.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.71,-9.62C237.46,-9.62 245.59,-9.62 253.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.42,-13.13 263.42,-9.63 253.42,-6.13 253.42,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="460.75,-19.25 381,-19.25 381,0 460.75,0 460.75,-19.25"/>
-<text text-anchor="middle" x="420.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M345.27,-9.62C353.05,-9.62 361.31,-9.62 369.4,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="369.14,-13.13 379.14,-9.63 369.14,-6.13 369.14,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d83/classuint256__t_ad4928175eaaaa2b559bc945affe63ad2_cgraph_org.svg b/d1/d83/classuint256__t_ad4928175eaaaa2b559bc945affe63ad2_cgraph_org.svg
deleted file mode 100644
index e79a6e90b..000000000
--- a/d1/d83/classuint256__t_ad4928175eaaaa2b559bc945affe63ad2_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::operator% Pages: 1 -->
-<svg width="469pt" height="27pt"
- viewBox="0.00 0.00 468.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint256_t::operator%</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator % for uint256_t">
-<polygon fill="#999999" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
-<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::operator%</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1" target="_top" xlink:title="divide function for uint256_t and other integer types.">
-<polygon fill="white" stroke="#666666" points="229.25,-19.25 142,-19.25 142,0 229.25,0 229.25,-19.25"/>
-<text text-anchor="middle" x="185.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.38,-9.62C114.29,-9.62 122.47,-9.62 130.43,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.35,-13.13 140.35,-9.63 130.35,-6.13 130.35,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="345,-19.25 265.25,-19.25 265.25,0 345,0 345,-19.25"/>
-<text text-anchor="middle" x="305.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.71,-9.62C237.46,-9.62 245.59,-9.62 253.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.42,-13.13 263.42,-9.63 253.42,-6.13 253.42,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="460.75,-19.25 381,-19.25 381,0 460.75,0 460.75,-19.25"/>
-<text text-anchor="middle" x="420.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M345.27,-9.62C353.05,-9.62 361.31,-9.62 369.4,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="369.14,-13.13 379.14,-9.63 369.14,-6.13 369.14,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d83/classuint256__t_afee82fa5052e9d8c946b9205b943cec4_cgraph.map b/d1/d83/classuint256__t_afee82fa5052e9d8c946b9205b943cec4_cgraph.map
deleted file mode 100644
index e9b23a4e7..000000000
--- a/d1/d83/classuint256__t_afee82fa5052e9d8c946b9205b943cec4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="uint256_t::__get_integer_from_string" name="uint256_t::__get_integer_from_string">
-<area shape="rect" id="Node000001" title="First and second half of 256 bit number." alt="" coords="5,5,166,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="214,13,325,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="166,23,198,23,198,28,166,28"/>
-</map>
diff --git a/d1/d83/classuint256__t_afee82fa5052e9d8c946b9205b943cec4_cgraph.md5 b/d1/d83/classuint256__t_afee82fa5052e9d8c946b9205b943cec4_cgraph.md5
deleted file mode 100644
index 3a216cefb..000000000
--- a/d1/d83/classuint256__t_afee82fa5052e9d8c946b9205b943cec4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d132b30f17b98ef01ba7cc970013eae6
\ No newline at end of file
diff --git a/d1/d83/classuint256__t_afee82fa5052e9d8c946b9205b943cec4_cgraph.svg b/d1/d83/classuint256__t_afee82fa5052e9d8c946b9205b943cec4_cgraph.svg
deleted file mode 100644
index cf9dff62c..000000000
--- a/d1/d83/classuint256__t_afee82fa5052e9d8c946b9205b943cec4_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::__get_integer_from_string Pages: 1 -->
-<svg width="248pt" height="39pt"
- viewBox="0.00 0.00 247.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>uint256_t::__get_integer_from_string</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="First and second half of 256 bit number.">
-<polygon fill="#999999" stroke="#666666" points="120.25,-30.5 0,-30.5 0,0 120.25,0 120.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::__get_integer</text>
-<text text-anchor="middle" x="60.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_from_string</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="239.75,-24.88 156.25,-24.88 156.25,-5.63 239.75,-5.63 239.75,-24.88"/>
-<text text-anchor="middle" x="198" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.72,-15.25C128.58,-15.25 136.59,-15.25 144.33,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.28,-18.75 154.28,-15.25 144.28,-11.75 144.28,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d83/classuint256__t_afee82fa5052e9d8c946b9205b943cec4_cgraph_org.svg b/d1/d83/classuint256__t_afee82fa5052e9d8c946b9205b943cec4_cgraph_org.svg
deleted file mode 100644
index 82c205a56..000000000
--- a/d1/d83/classuint256__t_afee82fa5052e9d8c946b9205b943cec4_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint256_t::__get_integer_from_string Pages: 1 -->
-<svg width="248pt" height="39pt"
- viewBox="0.00 0.00 247.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>uint256_t::__get_integer_from_string</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="First and second half of 256 bit number.">
-<polygon fill="#999999" stroke="#666666" points="120.25,-30.5 0,-30.5 0,0 120.25,0 120.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t::__get_integer</text>
-<text text-anchor="middle" x="60.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_from_string</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="239.75,-24.88 156.25,-24.88 156.25,-5.63 239.75,-5.63 239.75,-24.88"/>
-<text text-anchor="middle" x="198" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.72,-15.25C128.58,-15.25 136.59,-15.25 144.33,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.28,-18.75 154.28,-15.25 144.28,-11.75 144.28,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d90/classdata__structures_1_1trie-members.html b/d1/d90/classdata__structures_1_1trie-members.html
index 04b43a69b..e02151a20 100644
--- a/d1/d90/classdata__structures_1_1trie-members.html
+++ b/d1/d90/classdata__structures_1_1trie-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d1/d9a/hopcroft__karp_8cpp.html b/d1/d9a/hopcroft__karp_8cpp.html
index a31e02c9f..d33ac7b8b 100644
--- a/d1/d9a/hopcroft__karp_8cpp.html
+++ b/d1/d9a/hopcroft__karp_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph/hopcroft_karp.cpp File Reference</title>
+<title>TheAlgorithms/C++: graph/hopcroft_karp.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -126,7 +143,9 @@ Include dependency graph for hopcroft_karp.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d43/hopcroft__karp_8cpp__incl.svg" width="574" height="111"><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">
+</div>
+<p><a href="../../d1/d9a/hopcroft__karp_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d69/classgraph_1_1_h_k_graph.html">graph::HKGraph</a></td></tr>
@@ -169,6 +188,8 @@ Concept</h3>
 Algorithm</h3>
 <p>1) Initialize the Maximal Matching M as empty. 2) While there exists an Augmenting Path P Remove matching edges of P from M and add not-matching edges of P to M (This increases size of M by 1 as P starts and ends with a free vertex i.e. a node that is not part of matching.) 3) Return M.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Krishnapal4050" target="_blank">Krishna Pal Deora</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html">hopcroft_karp.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -187,36 +208,31 @@ Algorithm</h3>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00306">306</a> of file <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html">hopcroft_karp.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  307</span>{</div>
 <div class="line"><span class="lineno">  308</span>    <a class="code hl_function" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();  <span class="comment">// perform self-tests</span></div>
 <div class="line"><span class="lineno">  309</span> </div>
 <div class="line"><span class="lineno">  310</span>    <span class="keywordtype">int</span> v1 = 0, v2 = 0, e = 0;</div>
-<div class="line"><span class="lineno">  311</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; v1 &gt;&gt; v2 &gt;&gt; e; <span class="comment">// vertices of left side, right side and edges</span></div>
+<div class="line"><span class="lineno">  311</span>    std::cin &gt;&gt; v1 &gt;&gt; v2 &gt;&gt; e; <span class="comment">// vertices of left side, right side and edges</span></div>
 <div class="line"><span class="lineno">  312</span>    <a class="code hl_class" href="../../d8/d69/classgraph_1_1_h_k_graph.html">HKGraph</a> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>(v1, v2);  </div>
 <div class="line"><span class="lineno">  313</span>    <span class="keywordtype">int</span> u = 0, v = 0;</div>
 <div class="line"><span class="lineno">  314</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; e; ++i)</div>
 <div class="line"><span class="lineno">  315</span>    {</div>
-<div class="line"><span class="lineno">  316</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; u &gt;&gt; v;</div>
+<div class="line"><span class="lineno">  316</span>        std::cin &gt;&gt; u &gt;&gt; v;</div>
 <div class="line"><span class="lineno">  317</span>        <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.addEdge(u, v);</div>
 <div class="line"><span class="lineno">  318</span>    }</div>
 <div class="line"><span class="lineno">  319</span>  </div>
 <div class="line"><span class="lineno">  320</span>    <span class="keywordtype">int</span> res = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.hopcroftKarpAlgorithm();</div>
-<div class="line"><span class="lineno">  321</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Maximum matching is &quot;</span> &lt;&lt; res &lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  321</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum matching is &quot;</span> &lt;&lt; res &lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  322</span> </div>
 <div class="line"><span class="lineno">  323</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  324</span> </div>
 <div class="line"><span class="lineno">  325</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="aclassgraph_1_1_h_k_graph_html"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html">graph::HKGraph</a></div><div class="ttdoc">Represents Bipartite graph for Hopcroft Karp implementation.</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:67</div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:115</div></div>
-<div class="ttc" id="ahopcroft__karp_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:255</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="422"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html">graph::HKGraph</a></div><div class="ttdoc">Represents Bipartite graph for Hopcroft Karp implementation.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00066">hopcroft_karp.cpp:67</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00115">composite_simpson_rule.cpp:115</a></div></div>
+<div class="ttc" id="ahopcroft__karp_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00255">hopcroft_karp.cpp:255</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a88ec9ad42717780d6caaff9d3d6977f9" name="a88ec9ad42717780d6caaff9d3d6977f9"></a>
@@ -234,6 +250,8 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Self-test implementation </p><dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00255">255</a> of file <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html">hopcroft_karp.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  255</span>            {</div>
 <div class="line"><span class="lineno">  256</span>     <span class="comment">// Sample test case 1</span></div>
 <div class="line"><span class="lineno">  257</span>         <span class="keywordtype">int</span> v1a = 3, v1b = 5, e1 = 2;  <span class="comment">// vertices of left side, right side and edges</span></div>
@@ -280,12 +298,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  298</span>    </div>
 <div class="line"><span class="lineno">  299</span>        </div>
 <div class="line"><span class="lineno">  300</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg" width="647" height="163"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map b/d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
deleted file mode 100644
index 3a47a0b68..000000000
--- a/d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,35,56,60"/>
-<area shape="rect" id="Node000002" href="$d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a" title="function to add edge from u to v" alt="" coords="104,5,278,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,40,102,32,103,37,57,46"/>
-<area shape="rect" id="Node000004" href="$d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d" title="This function counts the number of augmenting paths between left and right sides of the Bipartite gra..." alt="" coords="106,55,276,96"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="57,49,91,55,90,60,56,54"/>
-<area shape="rect" id="Node000003" 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="326,5,480,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="279,16,310,16,310,21,279,21"/>
-<area shape="rect" id="Node000005" href="$d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93" title="This function checks for the possibility of augmented path availability." alt="" coords="332,59,474,84"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="276,71,317,70,317,76,276,77"/>
-<area shape="rect" id="Node000007" href="$d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0" title="This functions checks whether an augmenting path is available exists beginning with free vertex u." alt="" coords="332,132,474,158"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="256,94,347,124,346,129,255,99"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="528,96,641,122"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="470,82,514,92,513,97,468,88"/>
-<area shape="poly" id="edge8_Node000007_Node000006" title=" " alt="" coords="471,129,512,120,514,126,472,134"/>
-<area shape="poly" id="edge7_Node000007_Node000007" title=" " alt="" coords="373,133,367,123,370,114,383,108,403,105,425,108,437,114,434,119,423,113,403,111,384,113,374,117,372,123,377,130"/>
-</map>
diff --git a/d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 b/d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
deleted file mode 100644
index abbe33126..000000000
--- a/d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-02d11a939c25e266269cbd473cba1bec
\ No newline at end of file
diff --git a/d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg b/d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
deleted file mode 100644
index 907a6d945..000000000
--- a/d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
+++ /dev/null
@@ -1,174 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="485pt" height="122pt"
- viewBox="0.00 0.00 484.50 122.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 118.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-92.25 0,-92.25 0,-73 37.75,-73 37.75,-92.25"/>
-<text text-anchor="middle" x="18.88" y="-78.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a" target="_top" xlink:title="function to add edge from u to v">
-<polygon fill="white" stroke="#666666" points="204.5,-114.25 73.75,-114.25 73.75,-95 204.5,-95 204.5,-114.25"/>
-<text text-anchor="middle" x="139.12" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.09,-86.01C47.61,-87.79 59.91,-90.07 72.6,-92.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.84,-95.85 82.31,-94.24 73.12,-88.97 71.84,-95.85"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d" target="_top" xlink:title="This function counts the number of augmenting paths between left and right sides of the Bipartite gra...">
-<polygon fill="white" stroke="#666666" points="203,-76.88 75.25,-76.88 75.25,-46.38 203,-46.38 203,-76.88"/>
-<text text-anchor="start" x="83.25" y="-63.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::hopcroft</text>
-<text text-anchor="middle" x="139.12" y="-52.12" font-family="Helvetica,sans-Serif" font-size="10.00">KarpAlgorithm</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.09,-79.39C45.36,-78.1 54.24,-76.52 63.68,-74.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.23,-78.3 73.46,-73.11 63,-71.41 64.23,-78.3"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="356.25,-114.25 240.5,-114.25 240.5,-95 356.25,-95 356.25,-114.25"/>
-<text text-anchor="middle" x="298.38" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.99,-104.62C212.84,-104.62 220.87,-104.62 228.77,-104.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.68,-108.13 238.68,-104.63 228.68,-101.13 228.68,-108.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93" target="_top" xlink:title="This function checks for the possibility of augmented path availability.">
-<polygon fill="white" stroke="#666666" points="351.38,-74.25 245.38,-74.25 245.38,-55 351.38,-55 351.38,-74.25"/>
-<text text-anchor="middle" x="298.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::bfs</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.18,-62.83C213.24,-63.02 223.65,-63.22 233.72,-63.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.33,-66.9 243.39,-63.6 233.46,-59.9 233.33,-66.9"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0" target="_top" xlink:title="This functions checks whether an augmenting path is available exists beginning with free vertex u.">
-<polygon fill="white" stroke="#666666" points="351.38,-19.25 245.38,-19.25 245.38,0 351.38,0 351.38,-19.25"/>
-<text text-anchor="middle" x="298.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::dfs</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.73,-45.88C209.49,-38.69 235.03,-30.24 255.98,-23.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="256.95,-26.68 265.35,-20.22 254.75,-20.03 256.95,-26.68"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="476.5,-46.25 392.25,-46.25 392.25,-27 476.5,-27 476.5,-46.25"/>
-<text text-anchor="middle" x="434.38" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M347.75,-54.52C358.55,-52.26 370.04,-49.86 380.99,-47.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="381.59,-51.02 390.66,-45.55 380.16,-44.17 381.59,-51.02"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge8_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge8_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M349.27,-19.68C359.54,-21.75 370.39,-23.93 380.76,-26.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.79,-29.4 390.28,-27.94 381.17,-22.54 379.79,-29.4"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M277.08,-19.54C267.37,-28.15 274.47,-37.25 298.38,-37.25 311.45,-37.25 319.5,-34.53 322.51,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.92,-29.82 320.04,-21 319.13,-31.56 325.92,-29.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg b/d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
deleted file mode 100644
index c451c677f..000000000
--- a/d1/d9a/hopcroft__karp_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
+++ /dev/null
@@ -1,148 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="485pt" height="122pt"
- viewBox="0.00 0.00 484.50 122.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 118.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-92.25 0,-92.25 0,-73 37.75,-73 37.75,-92.25"/>
-<text text-anchor="middle" x="18.88" y="-78.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a" target="_top" xlink:title="function to add edge from u to v">
-<polygon fill="white" stroke="#666666" points="204.5,-114.25 73.75,-114.25 73.75,-95 204.5,-95 204.5,-114.25"/>
-<text text-anchor="middle" x="139.12" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.09,-86.01C47.61,-87.79 59.91,-90.07 72.6,-92.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.84,-95.85 82.31,-94.24 73.12,-88.97 71.84,-95.85"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d" target="_top" xlink:title="This function counts the number of augmenting paths between left and right sides of the Bipartite gra...">
-<polygon fill="white" stroke="#666666" points="203,-76.88 75.25,-76.88 75.25,-46.38 203,-46.38 203,-76.88"/>
-<text text-anchor="start" x="83.25" y="-63.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::hopcroft</text>
-<text text-anchor="middle" x="139.12" y="-52.12" font-family="Helvetica,sans-Serif" font-size="10.00">KarpAlgorithm</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.09,-79.39C45.36,-78.1 54.24,-76.52 63.68,-74.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.23,-78.3 73.46,-73.11 63,-71.41 64.23,-78.3"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="356.25,-114.25 240.5,-114.25 240.5,-95 356.25,-95 356.25,-114.25"/>
-<text text-anchor="middle" x="298.38" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.99,-104.62C212.84,-104.62 220.87,-104.62 228.77,-104.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.68,-108.13 238.68,-104.63 228.68,-101.13 228.68,-108.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93" target="_top" xlink:title="This function checks for the possibility of augmented path availability.">
-<polygon fill="white" stroke="#666666" points="351.38,-74.25 245.38,-74.25 245.38,-55 351.38,-55 351.38,-74.25"/>
-<text text-anchor="middle" x="298.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::bfs</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.18,-62.83C213.24,-63.02 223.65,-63.22 233.72,-63.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.33,-66.9 243.39,-63.6 233.46,-59.9 233.33,-66.9"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0" target="_top" xlink:title="This functions checks whether an augmenting path is available exists beginning with free vertex u.">
-<polygon fill="white" stroke="#666666" points="351.38,-19.25 245.38,-19.25 245.38,0 351.38,0 351.38,-19.25"/>
-<text text-anchor="middle" x="298.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::dfs</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.73,-45.88C209.49,-38.69 235.03,-30.24 255.98,-23.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="256.95,-26.68 265.35,-20.22 254.75,-20.03 256.95,-26.68"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="476.5,-46.25 392.25,-46.25 392.25,-27 476.5,-27 476.5,-46.25"/>
-<text text-anchor="middle" x="434.38" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M347.75,-54.52C358.55,-52.26 370.04,-49.86 380.99,-47.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="381.59,-51.02 390.66,-45.55 380.16,-44.17 381.59,-51.02"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge8_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge8_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M349.27,-19.68C359.54,-21.75 370.39,-23.93 380.76,-26.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.79,-29.4 390.28,-27.94 381.17,-22.54 379.79,-29.4"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M277.08,-19.54C267.37,-28.15 274.47,-37.25 298.38,-37.25 311.45,-37.25 319.5,-34.53 322.51,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.92,-29.82 320.04,-21 319.13,-31.56 325.92,-29.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 69f49c8c2..000000000
--- a/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,35,55,60"/>
-<area shape="rect" id="Node000002" href="$d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" title=" " alt="" coords="103,35,153,60"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,45,88,45,88,50,55,50"/>
-<area shape="rect" id="Node000003" href="$d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a" title="function to add edge from u to v" alt="" coords="201,5,375,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,40,199,32,200,37,154,46"/>
-<area shape="rect" id="Node000005" href="$d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d" title="This function counts the number of augmenting paths between left and right sides of the Bipartite gra..." alt="" coords="203,55,373,96"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="154,49,188,55,187,60,153,54"/>
-<area shape="rect" id="Node000004" 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="423,5,578,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="376,16,408,16,408,21,376,21"/>
-<area shape="rect" id="Node000006" href="$d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93" title="This function checks for the possibility of augmented path availability." alt="" coords="430,59,571,84"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="374,71,414,70,414,76,374,77"/>
-<area shape="rect" id="Node000008" href="$d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0" title="This functions checks whether an augmenting path is available exists beginning with free vertex u." alt="" coords="430,132,571,158"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="354,94,445,124,443,129,352,99"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="626,96,738,122"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="567,82,611,92,610,97,566,88"/>
-<area shape="poly" id="edge9_Node000008_Node000007" title=" " alt="" coords="568,129,610,120,611,126,569,134"/>
-<area shape="poly" id="edge8_Node000008_Node000008" title=" " alt="" coords="470,133,464,123,468,114,480,108,501,105,522,108,534,114,531,119,521,113,500,111,482,113,471,117,469,123,474,130"/>
-</map>
diff --git a/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 9192214ef..000000000
--- a/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d29cfd2b882bdebdef630602658b9976
\ No newline at end of file
diff --git a/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 70ca72dde..000000000
--- a/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,249 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 122 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 558;
-var viewHeight = 122;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-92.25 0,-92.25 0,-73 37,-73 37,-92.25"/>
-<text text-anchor="middle" x="18.5" y="-78.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-92.25 73,-92.25 73,-73 110.75,-73 110.75,-92.25"/>
-<text text-anchor="middle" x="91.88" y="-78.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-82.62C44.55,-82.62 53.37,-82.62 61.69,-82.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-86.13 71.43,-82.63 61.43,-79.13 61.43,-86.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a" target="_top" xlink:title="function to add edge from u to v">
-<polygon fill="white" stroke="#666666" points="277.5,-114.25 146.75,-114.25 146.75,-95 277.5,-95 277.5,-114.25"/>
-<text text-anchor="middle" x="212.12" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.09,-86.01C120.61,-87.79 132.91,-90.07 145.6,-92.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.84,-95.85 155.31,-94.24 146.12,-88.97 144.84,-95.85"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d" target="_top" xlink:title="This function counts the number of augmenting paths between left and right sides of the Bipartite gra...">
-<polygon fill="white" stroke="#666666" points="276,-76.88 148.25,-76.88 148.25,-46.38 276,-46.38 276,-76.88"/>
-<text text-anchor="start" x="156.25" y="-63.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::hopcroft</text>
-<text text-anchor="middle" x="212.12" y="-52.12" font-family="Helvetica,sans-Serif" font-size="10.00">KarpAlgorithm</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.09,-79.39C118.36,-78.1 127.24,-76.52 136.68,-74.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.23,-78.3 146.46,-73.11 136,-71.41 137.23,-78.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="429.25,-114.25 313.5,-114.25 313.5,-95 429.25,-95 429.25,-114.25"/>
-<text text-anchor="middle" x="371.38" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M277.99,-104.62C285.84,-104.62 293.87,-104.62 301.77,-104.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="301.68,-108.13 311.68,-104.63 301.68,-101.13 301.68,-108.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93" target="_top" xlink:title="This function checks for the possibility of augmented path availability.">
-<polygon fill="white" stroke="#666666" points="424.38,-74.25 318.38,-74.25 318.38,-55 424.38,-55 424.38,-74.25"/>
-<text text-anchor="middle" x="371.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::bfs</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M276.18,-62.83C286.24,-63.02 296.65,-63.22 306.72,-63.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="306.33,-66.9 316.39,-63.6 306.46,-59.9 306.33,-66.9"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0" target="_top" xlink:title="This functions checks whether an augmenting path is available exists beginning with free vertex u.">
-<polygon fill="white" stroke="#666666" points="424.38,-19.25 318.38,-19.25 318.38,0 424.38,0 424.38,-19.25"/>
-<text text-anchor="middle" x="371.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::dfs</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.73,-45.88C282.49,-38.69 308.03,-30.24 328.98,-23.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.95,-26.68 338.35,-20.22 327.75,-20.03 329.95,-26.68"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="549.5,-46.25 465.25,-46.25 465.25,-27 549.5,-27 549.5,-46.25"/>
-<text text-anchor="middle" x="507.38" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M420.75,-54.52C431.55,-52.26 443.04,-49.86 453.99,-47.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="454.59,-51.02 463.66,-45.55 453.16,-44.17 454.59,-51.02"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge9_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge9_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M422.27,-19.68C432.54,-21.75 443.39,-23.93 453.76,-26.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="452.79,-29.4 463.28,-27.94 454.17,-22.54 452.79,-29.4"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge8_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge8_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M350.08,-19.54C340.37,-28.15 347.47,-37.25 371.38,-37.25 384.45,-37.25 392.5,-34.53 395.51,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="398.92,-29.82 393.04,-21 392.13,-31.56 398.92,-29.82"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index ed0c11f88..000000000
--- a/d1/d9a/hopcroft__karp_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,166 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="558pt" height="122pt"
- viewBox="0.00 0.00 557.50 122.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 118.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-92.25 0,-92.25 0,-73 37,-73 37,-92.25"/>
-<text text-anchor="middle" x="18.5" y="-78.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-92.25 73,-92.25 73,-73 110.75,-73 110.75,-92.25"/>
-<text text-anchor="middle" x="91.88" y="-78.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-82.62C44.55,-82.62 53.37,-82.62 61.69,-82.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-86.13 71.43,-82.63 61.43,-79.13 61.43,-86.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a" target="_top" xlink:title="function to add edge from u to v">
-<polygon fill="white" stroke="#666666" points="277.5,-114.25 146.75,-114.25 146.75,-95 277.5,-95 277.5,-114.25"/>
-<text text-anchor="middle" x="212.12" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.09,-86.01C120.61,-87.79 132.91,-90.07 145.6,-92.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.84,-95.85 155.31,-94.24 146.12,-88.97 144.84,-95.85"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d" target="_top" xlink:title="This function counts the number of augmenting paths between left and right sides of the Bipartite gra...">
-<polygon fill="white" stroke="#666666" points="276,-76.88 148.25,-76.88 148.25,-46.38 276,-46.38 276,-76.88"/>
-<text text-anchor="start" x="156.25" y="-63.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::hopcroft</text>
-<text text-anchor="middle" x="212.12" y="-52.12" font-family="Helvetica,sans-Serif" font-size="10.00">KarpAlgorithm</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.09,-79.39C118.36,-78.1 127.24,-76.52 136.68,-74.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.23,-78.3 146.46,-73.11 136,-71.41 137.23,-78.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="429.25,-114.25 313.5,-114.25 313.5,-95 429.25,-95 429.25,-114.25"/>
-<text text-anchor="middle" x="371.38" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M277.99,-104.62C285.84,-104.62 293.87,-104.62 301.77,-104.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="301.68,-108.13 311.68,-104.63 301.68,-101.13 301.68,-108.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93" target="_top" xlink:title="This function checks for the possibility of augmented path availability.">
-<polygon fill="white" stroke="#666666" points="424.38,-74.25 318.38,-74.25 318.38,-55 424.38,-55 424.38,-74.25"/>
-<text text-anchor="middle" x="371.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::bfs</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M276.18,-62.83C286.24,-63.02 296.65,-63.22 306.72,-63.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="306.33,-66.9 316.39,-63.6 306.46,-59.9 306.33,-66.9"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0" target="_top" xlink:title="This functions checks whether an augmenting path is available exists beginning with free vertex u.">
-<polygon fill="white" stroke="#666666" points="424.38,-19.25 318.38,-19.25 318.38,0 424.38,0 424.38,-19.25"/>
-<text text-anchor="middle" x="371.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::dfs</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.73,-45.88C282.49,-38.69 308.03,-30.24 328.98,-23.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.95,-26.68 338.35,-20.22 327.75,-20.03 329.95,-26.68"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="549.5,-46.25 465.25,-46.25 465.25,-27 549.5,-27 549.5,-46.25"/>
-<text text-anchor="middle" x="507.38" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M420.75,-54.52C431.55,-52.26 443.04,-49.86 453.99,-47.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="454.59,-51.02 463.66,-45.55 453.16,-44.17 454.59,-51.02"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge9_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge9_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M422.27,-19.68C432.54,-21.75 443.39,-23.93 453.76,-26.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="452.79,-29.4 463.28,-27.94 454.17,-22.54 452.79,-29.4"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge8_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge8_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M350.08,-19.54C340.37,-28.15 347.47,-37.25 371.38,-37.25 384.45,-37.25 392.5,-34.53 395.51,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="398.92,-29.82 393.04,-21 392.13,-31.56 398.92,-29.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d9a/hopcroft__karp_8cpp_source.html b/d1/d9a/hopcroft__karp_8cpp_source.html
new file mode 100644
index 000000000..3f0d87d41
--- /dev/null
+++ b/d1/d9a/hopcroft__karp_8cpp_source.html
@@ -0,0 +1,403 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/hopcroft_karp.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/d9a/hopcroft__karp_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">hopcroft_karp.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d1/d9a/hopcroft__karp_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="preprocessor">#include &lt;cstdlib&gt;</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="preprocessor">#include &lt;queue&gt;</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="preprocessor">#include &lt;list&gt;</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="preprocessor">#include &lt;climits&gt;</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="preprocessor">#include &lt;memory&gt;</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> <span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> { </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="foldopen" id="foldopen00066" data-start="{" data-end="};">
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"><a class="line" href="../../d8/d69/classgraph_1_1_h_k_graph.html">   66</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d8/d69/classgraph_1_1_h_k_graph.html">HKGraph</a></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>{</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"><a class="line" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">   68</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a>{};  </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">   69</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a>{};  </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> NIL{0};</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> INF{INT_MAX};</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"><a class="line" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f">   73</a></span>    std::vector&lt;std::list&lt;int&gt; &gt;<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f">adj</a>;  </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b">   75</a></span>    std::vector&lt;int&gt; <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b">pair_u</a>; </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"><a class="line" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">   76</a></span>    std::vector&lt;int&gt; <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">pair_v</a>; </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">   77</a></span>    std::vector&lt;int&gt; <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>;   </div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span><span class="keyword">public</span>:</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="../../d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9">   80</a></span>    <a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9">HKGraph</a>();             <span class="comment">// Default Constructor</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9">HKGraph</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a>, <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a>);     <span class="comment">// Constructor</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a>(<span class="keywordtype">int</span> u, <span class="keywordtype">int</span> v); <span class="comment">// To add edge</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93">bfs</a>(); <span class="comment">// Returns true if there is an augmenting path    </span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0">dfs</a>(<span class="keywordtype">int</span> u); <span class="comment">// Adds augmenting path if there is one beginning with u  </span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d">hopcroftKarpAlgorithm</a>();  <span class="comment">// Returns size of maximum matching</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>};</div>
+</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="foldopen" id="foldopen00095" data-start="{" data-end="}">
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d">   95</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d">HKGraph::hopcroftKarpAlgorithm</a>()</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>{</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="comment">// pair_u[u] stores pair of u in matching on left side of Bipartite Graph.</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="comment">// If u doesn&#39;t have any pair, then pair_u[u] is NIL</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b">pair_u</a> = std::vector&lt;int&gt;(<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a> + 1,NIL); </div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="comment">// pair_v[v] stores pair of v in matching on right side of Biparite Graph.</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="comment">// If v doesn&#39;t have any pair, then pair_u[v] is NIL</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">pair_v</a> = std::vector&lt;int&gt;(<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a> + 1,NIL); </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a> = std::vector&lt;int&gt;(<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a> + 1);  <span class="comment">// dist[u] stores distance of left side vertices</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="keywordtype">int</span> result = 0;  <span class="comment">// Initialize result</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="comment">// Keep updating the result while there is an augmenting path possible.</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <span class="keywordflow">while</span> (<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93">bfs</a>())</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        <span class="comment">// Find a free vertex to check for a matching</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> u = 1; u &lt;= <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a>; u++){</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>            <span class="comment">// If current vertex is free and there is</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>            <span class="comment">// an augmenting path from current vertex</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>            <span class="comment">// then increment the result</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b">pair_u</a>[u] == NIL &amp;&amp; <a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0">dfs</a>(u)){</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>                result++;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        }</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    }</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    }</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>}</div>
+</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span> </div>
+<div class="foldopen" id="foldopen00133" data-start="{" data-end="}">
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"><a class="line" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93">  133</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93">HKGraph::bfs</a>()</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>{</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    std::queue&lt;int&gt; q; <span class="comment">// an integer queue for bfs</span></div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span> </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <span class="comment">// First layer of vertices (set distance as 0)</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> u = 1; u &lt;= <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a>; u++)</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    {</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        <span class="comment">// If this is a free vertex, add it to queue</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b">pair_u</a>[u] == NIL){</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>            </div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>            <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[u] = 0; <span class="comment">// u is not matched so distance is 0</span></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>            q.push(u);</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        }</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span> </div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        <span class="keywordflow">else</span>{</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>            <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[u] = INF; <span class="comment">// set distance as infinite so that this vertex is considered next time for availibility</span></div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    }</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    }</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    </div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[NIL] = INF; <span class="comment">// Initialize distance to NIL as infinite</span></div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span> </div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    <span class="comment">// q is going to contain vertices of left side only.</span></div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    <span class="keywordflow">while</span> (!q.empty())</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    {</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>        <span class="keywordtype">int</span> u = q.front();  <span class="comment">// dequeue a vertex</span></div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        q.pop();</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span> </div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        <span class="comment">// If this node is not NIL and can provide a shorter path to NIL then</span></div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[u] &lt; <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[NIL])</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        {</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>            <span class="comment">// Get all the adjacent vertices of the dequeued vertex u</span></div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>            std::list&lt;int&gt;::iterator it;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>            <span class="keywordflow">for</span> (it = <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f">adj</a>[u].begin(); it != <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f">adj</a>[u].end(); ++it)</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>            {</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>                <span class="keywordtype">int</span> v = *it;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span> </div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>                <span class="comment">// If pair of v is not considered so far i.e. (v, pair_v[v]) is not yet explored edge.</span></div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>                <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">pair_v</a>[v]] == INF)</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>                {</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>                    <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">pair_v</a>[v]] = <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[u] + 1; </div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>                    q.push(<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">pair_v</a>[v]);    <span class="comment">// Consider the pair and push it to queue</span></div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>                }</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>            }</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        }</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    }</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span> </div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>   </div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>   </div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    <span class="keywordflow">return</span> (<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[NIL] != INF);   <span class="comment">// If we could come back to NIL using alternating path of distinct vertices then there is an augmenting path available</span></div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>}</div>
+</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span> </div>
+<div class="foldopen" id="foldopen00191" data-start="{" data-end="}">
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"><a class="line" href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0">  191</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0">HKGraph::dfs</a>(<span class="keywordtype">int</span> u)</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>{</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    <span class="keywordflow">if</span> (u != NIL)</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    {</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>        std::list&lt;int&gt;::iterator it;</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>        <span class="keywordflow">for</span> (it = <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f">adj</a>[u].begin(); it != <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f">adj</a>[u].end(); ++it)</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>        {</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>            </div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>            <span class="keywordtype">int</span> v = *it; <span class="comment">// Adjacent vertex of u</span></div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span> </div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>            <span class="comment">// Follow the distances set by BFS search</span></div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">pair_v</a>[v]] == <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[u] + 1)</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>            {</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>                <span class="comment">// If dfs for pair of v also return true then new matching possible, store the matching</span></div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>                <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0">dfs</a>(<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">pair_v</a>[v]) == <span class="keyword">true</span>)</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>                {   </div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>                    <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">pair_v</a>[v] = u;</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>                    <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b">pair_u</a>[u] = v;</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>                    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>                }</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>            }</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>        }</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span> </div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>        </div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>        <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">dist</a>[u] = INF; <span class="comment">// If there is no augmenting path beginning with u then set distance to infinite.</span></div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    }</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>}</div>
+</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span> </div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span><a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9">HKGraph::HKGraph</a>() = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span> </div>
+<div class="foldopen" id="foldopen00231" data-start="{" data-end="}">
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"><a class="line" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64">  231</a></span><a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9">HKGraph::HKGraph</a>(<span class="keywordtype">int</span> m, <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    this-&gt;m = <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a>;</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    this-&gt;n = <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a>;</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f">adj</a> = std::vector&lt;std::list&lt;int&gt; &gt;(<a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">m</a> + 1);</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>}</div>
+</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span> </div>
+<div class="foldopen" id="foldopen00242" data-start="{" data-end="}">
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"><a class="line" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">  242</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">HKGraph::addEdge</a>(<span class="keywordtype">int</span> u, <span class="keywordtype">int</span> v)</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>{</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    <a class="code hl_variable" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f">adj</a>[u].push_back(v); <span class="comment">// Add v to u’s list.</span></div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>}</div>
+</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span> </div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>} <span class="comment">// namespace graph</span></div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span> </div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span><span class="keyword">using </span><a class="code hl_class" href="../../d8/d69/classgraph_1_1_h_k_graph.html">graph::HKGraph</a>;</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span> </div>
+<div class="foldopen" id="foldopen00255" data-start="{" data-end="}">
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"><a class="line" href="../../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">  255</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>(){</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>     <span class="comment">// Sample test case 1</span></div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>         <span class="keywordtype">int</span> v1a = 3, v1b = 5, e1 = 2;  <span class="comment">// vertices of left side, right side and edges</span></div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>         <a class="code hl_class" href="../../d8/d69/classgraph_1_1_h_k_graph.html">HKGraph</a> g1(v1a, v1b); <span class="comment">// execute the algorithm </span></div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span> </div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>         g1.<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a>(0,1);</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>         g1.<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a>(1,4);</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span> </div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>         <span class="keywordtype">int</span> expected_res1 = 0; <span class="comment">// for the above sample data, this is the expected output</span></div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>         <span class="keywordtype">int</span> res1 = g1.<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d">hopcroftKarpAlgorithm</a>();</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span> </div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>         assert(res1 == expected_res1); <span class="comment">// assert check to ensure that the algorithm executed correctly for test 1</span></div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>    </div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>     <span class="comment">// Sample test case 2</span></div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>             <span class="keywordtype">int</span> v2a = 4, v2b = 4, e2 = 6;  <span class="comment">// vertices of left side, right side and edges</span></div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>         <a class="code hl_class" href="../../d8/d69/classgraph_1_1_h_k_graph.html">HKGraph</a> g2(v2a, v2b); <span class="comment">// execute the algorithm </span></div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span> </div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>             g2.<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a>(1,1);</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>         g2.<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a>(1,3);</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>         g2.<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a>(2,3);</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>         g2.<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a>(3,4);</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>         g2.<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a>(4,3);</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>             g2.<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a>(4,2);</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>    </div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>         <span class="keywordtype">int</span> expected_res2 = 0; <span class="comment">// for the above sample data, this is the expected output</span></div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>         <span class="keywordtype">int</span> res2 = g2.<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d">hopcroftKarpAlgorithm</a>();</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span> </div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>         assert(res2 == expected_res2); <span class="comment">// assert check to ensure that the algorithm executed correctly for test 2</span></div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    </div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>      <span class="comment">// Sample test case 3</span></div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>             <span class="keywordtype">int</span> v3a = 6, v3b = 6, e3 = 4;  <span class="comment">// vertices of left side, right side and edges</span></div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>         <a class="code hl_class" href="../../d8/d69/classgraph_1_1_h_k_graph.html">HKGraph</a> g3(v3a, v3b); <span class="comment">// execute the algorithm </span></div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span> </div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>             g3.<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a>(0,1);</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>         g3.<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a>(1,4);</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>         g3.<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a>(1,5);</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>         g3.<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">addEdge</a>(5,0);</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span> </div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>         <span class="keywordtype">int</span> expected_res3 = 0; <span class="comment">// for the above sample data, this is the expected output</span></div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>         <span class="keywordtype">int</span> res3 = g3.<a class="code hl_function" href="../../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d">hopcroftKarpAlgorithm</a>();</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span> </div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>         assert(res3 == expected_res3); <span class="comment">// assert check to ensure that the algorithm executed correctly for test 3</span></div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>    </div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>    </div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>        </div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>}</div>
+</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span> </div>
+<div class="foldopen" id="foldopen00306" data-start="{" data-end="}">
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"><a class="line" href="../../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  306</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>()</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>{</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>    <a class="code hl_function" href="../../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();  <span class="comment">// perform self-tests</span></div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span> </div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>    <span class="keywordtype">int</span> v1 = 0, v2 = 0, e = 0;</div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>    std::cin &gt;&gt; v1 &gt;&gt; v2 &gt;&gt; e; <span class="comment">// vertices of left side, right side and edges</span></div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>    <a class="code hl_class" href="../../d8/d69/classgraph_1_1_h_k_graph.html">HKGraph</a> g(v1, v2);  </div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>    <span class="keywordtype">int</span> u = 0, v = 0;</div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; e; ++i)</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>    {</div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>        std::cin &gt;&gt; u &gt;&gt; v;</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>        g.addEdge(u, v);</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>    }</div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>  </div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>    <span class="keywordtype">int</span> res = g.hopcroftKarpAlgorithm();</div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum matching is &quot;</span> &lt;&lt; res &lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span> </div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span> </div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>}</div>
+</div>
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html">graph::HKGraph</a></div><div class="ttdoc">Represents Bipartite graph for Hopcroft Karp implementation.</div><div class="ttdef"><b>Definition</b> <a href="#l00066">hopcroft_karp.cpp:67</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a35893def7a1c5cd60907b4893117796f"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f">graph::HKGraph::adj</a></div><div class="ttdeci">std::vector&lt; std::list&lt; int &gt; &gt; adj</div><div class="ttdoc">adj[u] stores adjacents of left side and 0 is used for dummy vertex</div><div class="ttdef"><b>Definition</b> <a href="#l00073">hopcroft_karp.cpp:73</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a3b49011c09cf90a116ab53bef61cd95a"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">graph::HKGraph::addEdge</a></div><div class="ttdeci">void addEdge(int u, int v)</div><div class="ttdoc">function to add edge from u to v</div><div class="ttdef"><b>Definition</b> <a href="#l00242">hopcroft_karp.cpp:242</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a3d9101e3b4598159005fd028b9b0ff74"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74">graph::HKGraph::m</a></div><div class="ttdeci">int m</div><div class="ttdoc">m is the number of vertices on left side of Bipartite Graph</div><div class="ttdef"><b>Definition</b> <a href="#l00068">hopcroft_karp.cpp:68</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a6a0228bbba3818447fcf6b56128b552a"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a">graph::HKGraph::dist</a></div><div class="ttdeci">std::vector&lt; int &gt; dist</div><div class="ttdoc">dist represents the distance between vertex 'u' and vertex 'v'</div><div class="ttdef"><b>Definition</b> <a href="#l00077">hopcroft_karp.cpp:77</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a6f5a9fdbb83ef731d739ba6707e21c3c"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">graph::HKGraph::n</a></div><div class="ttdeci">int n</div><div class="ttdoc">n is the number of vertices on right side of Bipartite Graph</div><div class="ttdef"><b>Definition</b> <a href="#l00069">hopcroft_karp.cpp:69</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a7491add14d9fc04f679114ca6d6f0f93"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93">graph::HKGraph::bfs</a></div><div class="ttdeci">bool bfs()</div><div class="ttdoc">This function checks for the possibility of augmented path availability.</div><div class="ttdef"><b>Definition</b> <a href="#l00133">hopcroft_karp.cpp:133</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a86ebff8a70cbfedd05281993d5d1987b"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b">graph::HKGraph::pair_u</a></div><div class="ttdeci">std::vector&lt; int &gt; pair_u</div><div class="ttdoc">value of vertex 'u' ranges from 1 to m</div><div class="ttdef"><b>Definition</b> <a href="#l00075">hopcroft_karp.cpp:75</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a976ee239402cc2726a280e781c706d77"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">graph::HKGraph::pair_v</a></div><div class="ttdeci">std::vector&lt; int &gt; pair_v</div><div class="ttdoc">value of vertex 'v' ranges from 1 to n</div><div class="ttdef"><b>Definition</b> <a href="#l00076">hopcroft_karp.cpp:76</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a9dbda80d02bdc26c3e8ff7330c9be75d"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d">graph::HKGraph::hopcroftKarpAlgorithm</a></div><div class="ttdeci">int hopcroftKarpAlgorithm()</div><div class="ttdoc">This function counts the number of augmenting paths between left and right sides of the Bipartite gra...</div><div class="ttdef"><b>Definition</b> <a href="#l00095">hopcroft_karp.cpp:95</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_ae794950cb3407b6b47d3dc986cf714c0"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0">graph::HKGraph::dfs</a></div><div class="ttdeci">bool dfs(int u)</div><div class="ttdoc">This functions checks whether an augmenting path is available exists beginning with free vertex u.</div><div class="ttdef"><b>Definition</b> <a href="#l00191">hopcroft_karp.cpp:191</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_af02b0c83911070ac6d95fc9905e58aa9"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9">graph::HKGraph::HKGraph</a></div><div class="ttdeci">HKGraph()</div><div class="ttdoc">Default Constructor for initialization.</div></div>
+<div class="ttc" id="ahopcroft__karp_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="#l00255">hopcroft_karp.cpp:255</a></div></div>
+<div class="ttc" id="ahopcroft__karp_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00306">hopcroft_karp.cpp:306</a></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><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a class="el" href="../../d1/d9a/hopcroft__karp_8cpp.html">hopcroft_karp.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/d9e/prefix__sum__array_8cpp.html b/d1/d9e/prefix__sum__array_8cpp.html
index df038a2d2..425fe6bfd 100644
--- a/d1/d9e/prefix__sum__array_8cpp.html
+++ b/d1/d9e/prefix__sum__array_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: range_queries/prefix_sum_array.cpp File Reference</title>
+<title>TheAlgorithms/C++: range_queries/prefix_sum_array.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -106,8 +123,7 @@ $(function(){initNavTree('d1/d9e/prefix__sum__array_8cpp.html','../../'); initRe
 <div class="header">
   <div class="summary">
 <a href="#namespaces">Namespaces</a> &#124;
-<a href="#func-members">Functions</a> &#124;
-<a href="#var-members">Variables</a>  </div>
+<a href="#func-members">Functions</a>  </div>
   <div class="headertitle"><div class="title">prefix_sum_array.cpp File Reference</div></div>
 </div><!--header-->
 <div class="contents">
@@ -122,11 +138,13 @@ Include dependency graph for prefix_sum_array.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d76/prefix__sum__array_8cpp__incl.svg" width="252" height="126"><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">
+</div>
+<p><a href="../../d1/d9e/prefix__sum__array_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d69/namespacerange__queries.html">range_queries</a></td></tr>
-<tr class="memdesc:dd/d69/namespacerange__queries"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
+<tr class="memdesc:dd/d69/namespacerange__queries"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::vector <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d88/namespaceprefix__sum__array.html">prefix_sum_array</a></td></tr>
 <tr class="memdesc:d7/d88/namespaceprefix__sum__array"><td class="mdescLeft">&#160;</td><td class="mdescRight">Range sum queries using prefix-sum-array. <br /></td></tr>
@@ -134,7 +152,10 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:ab36151479ad37d53ef9fcb60a274b1d9" id="r_ab36151479ad37d53ef9fcb60a274b1d9"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab36151479ad37d53ef9fcb60a274b1d9">range_queries::prefix_sum_array::build</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; original_array)</td></tr>
+<tr class="memitem:adae5ede93421c239b4a15a3689320ac1" id="r_adae5ede93421c239b4a15a3689320ac1"><td class="memItemLeft" align="right" valign="top"><a id="adae5ede93421c239b4a15a3689320ac1" name="adae5ede93421c239b4a15a3689320ac1"></a>
+std::vector&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>range_queries::prefix_sum_array::PSA</b> (1, 0)</td></tr>
+<tr class="separator:adae5ede93421c239b4a15a3689320ac1"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:ab36151479ad37d53ef9fcb60a274b1d9" id="r_ab36151479ad37d53ef9fcb60a274b1d9"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab36151479ad37d53ef9fcb60a274b1d9">range_queries::prefix_sum_array::build</a> (std::vector&lt; int64_t &gt; original_array)</td></tr>
 <tr class="memdesc:ab36151479ad37d53ef9fcb60a274b1d9"><td class="mdescLeft">&#160;</td><td class="mdescRight">function that builds the PSA  <br /></td></tr>
 <tr class="separator:ab36151479ad37d53ef9fcb60a274b1d9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a7c8fd967c36dbba5fdf9c71faed604cf" id="r_a7c8fd967c36dbba5fdf9c71faed604cf"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7c8fd967c36dbba5fdf9c71faed604cf">range_queries::prefix_sum_array::query</a> (int64_t beg, int64_t end)</td></tr>
@@ -146,12 +167,6 @@ Functions</h2></td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
 <tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function.  <br /></td></tr>
 <tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
-</table><table class="memberdecls">
-<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
-Variables</h2></td></tr>
-<tr class="memitem:aed6103aaebcbf1a8978d1e038d22e001" id="r_aed6103aaebcbf1a8978d1e038d22e001"><td class="memItemLeft" align="right" valign="top"><a id="aed6103aaebcbf1a8978d1e038d22e001" name="aed6103aaebcbf1a8978d1e038d22e001"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>range_queries::prefix_sum_array::PSA</b> (1, 0)</td></tr>
-<tr class="separator:aed6103aaebcbf1a8978d1e038d22e001"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Prefix_sum" target="_blank">Prefix Sum Array</a> data structure implementation. </p>
@@ -165,6 +180,8 @@ Variables</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/PauloVLB" target="_blank">Paulo Vitor Lima Borges</a> </dd></dl>
 </li>
 </ul>
+
+<p class="definition">Definition in file <a class="el" href="../../d1/d9e/prefix__sum__array_8cpp_source.html">prefix_sum_array.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ab36151479ad37d53ef9fcb60a274b1d9" name="ab36151479ad37d53ef9fcb60a274b1d9"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ab36151479ad37d53ef9fcb60a274b1d9">&#9670;&#160;</a></span>build()</h2>
@@ -175,7 +192,7 @@ Variables</h2></td></tr>
         <tr>
           <td class="memname">void range_queries::prefix_sum_array::build </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;</td>          <td class="paramname"><span class="paramname"><em>original_array</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; int64_t &gt;</td>          <td class="paramname"><span class="paramname"><em>original_array</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -189,19 +206,14 @@ Variables</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d9e/prefix__sum__array_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../d1/d9e/prefix__sum__array_8cpp_source.html">prefix_sum_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   41</span>                                              {</div>
-<div class="line"><span class="lineno">   42</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= static_cast&lt;int&gt;(original_array.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()); i++) {</div>
-<div class="line"><span class="lineno">   43</span>        PSA.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(PSA[i - 1] + original_array[i]);</div>
+<div class="line"><span class="lineno">   42</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= static_cast&lt;int&gt;(original_array.size()); i++) {</div>
+<div class="line"><span class="lineno">   43</span>        PSA.push_back(PSA[i - 1] + original_array[i]);</div>
 <div class="line"><span class="lineno">   44</span>    }</div>
 <div class="line"><span class="lineno">   45</span>}</div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="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><!-- 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="../../d1/d9e/prefix__sum__array_8cpp_ab36151479ad37d53ef9fcb60a274b1d9_cgraph.svg" width="356" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -221,17 +233,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d9e/prefix__sum__array_8cpp_source.html#l00080">80</a> of file <a class="el" href="../../d1/d9e/prefix__sum__array_8cpp_source.html">prefix_sum_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   80</span>           {</div>
 <div class="line"><span class="lineno">   81</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   82</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   83</span>}</div>
-<div class="ttc" id="aprefix__sum__array_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> prefix_sum_array.cpp:61</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d9e/prefix__sum__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aprefix__sum__array_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d9e/prefix__sum__array_8cpp_source.html#l00061">prefix_sum_array.cpp:61</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7c8fd967c36dbba5fdf9c71faed604cf" name="a7c8fd967c36dbba5fdf9c71faed604cf"></a>
@@ -262,8 +271,9 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>sum of the range [beg, end] </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   52</span>{ <span class="keywordflow">return</span> PSA[<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a>] - PSA[beg - 1]; }</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>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d9e/prefix__sum__array_8cpp_source.html#l00052">52</a> of file <a class="el" href="../../d1/d9e/prefix__sum__array_8cpp_source.html">prefix_sum_array.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   52</span>{ <span class="keywordflow">return</span> PSA[end] - PSA[beg - 1]; }</div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -292,8 +302,10 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d9e/prefix__sum__array_8cpp_source.html#l00061">61</a> of file <a class="el" href="../../d1/d9e/prefix__sum__array_8cpp_source.html">prefix_sum_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   61</span>                   {</div>
-<div class="line"><span class="lineno">   62</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> values{0,  123, 0,  2,  -2, 5,</div>
+<div class="line"><span class="lineno">   62</span>    std::vector&lt;int64_t&gt; values{0,  123, 0,  2,  -2, 5,</div>
 <div class="line"><span class="lineno">   63</span>                                24, 0,   23, -1, -1};  <span class="comment">// original array</span></div>
 <div class="line"><span class="lineno">   64</span> </div>
 <div class="line"><span class="lineno">   65</span>    <a class="code hl_function" href="#ab36151479ad37d53ef9fcb60a274b1d9">range_queries::prefix_sum_array::build</a>(values);</div>
@@ -306,8 +318,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   72</span>    assert(range_queries::prefix_sum_array::query(5, 9) ==</div>
 <div class="line"><span class="lineno">   73</span>           51);  <span class="comment">// the sum of the interval [5, 9]</span></div>
 <div class="line"><span class="lineno">   74</span>}</div>
-<div class="ttc" id="aprefix__sum__array_8cpp_html_ab36151479ad37d53ef9fcb60a274b1d9"><div class="ttname"><a href="#ab36151479ad37d53ef9fcb60a274b1d9">range_queries::prefix_sum_array::build</a></div><div class="ttdeci">void build(std::vector&lt; int64_t &gt; original_array)</div><div class="ttdoc">function that builds the PSA</div><div class="ttdef"><b>Definition</b> prefix_sum_array.cpp:41</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 class="ttc" id="aprefix__sum__array_8cpp_html_ab36151479ad37d53ef9fcb60a274b1d9"><div class="ttname"><a href="#ab36151479ad37d53ef9fcb60a274b1d9">range_queries::prefix_sum_array::build</a></div><div class="ttdeci">void build(std::vector&lt; int64_t &gt; original_array)</div><div class="ttdoc">function that builds the PSA</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d9e/prefix__sum__array_8cpp_source.html#l00041">prefix_sum_array.cpp:41</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/d1/d9e/prefix__sum__array_8cpp_ab36151479ad37d53ef9fcb60a274b1d9_cgraph.map b/d1/d9e/prefix__sum__array_8cpp_ab36151479ad37d53ef9fcb60a274b1d9_cgraph.map
deleted file mode 100644
index 36996e00c..000000000
--- a/d1/d9e/prefix__sum__array_8cpp_ab36151479ad37d53ef9fcb60a274b1d9_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="range_queries::prefix_sum_array::build" name="range_queries::prefix_sum_array::build">
-<area shape="rect" id="Node000001" title="function that builds the PSA" alt="" coords="5,29,148,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="39,29,37,19,43,10,57,5,77,3,98,5,111,11,108,16,96,10,76,8,58,10,47,15,43,20,44,28"/>
-<area shape="rect" id="Node000002" 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="196,12,350,37"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="148,38,180,34,181,39,149,43"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="215,61,330,86"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="149,56,200,62,199,67,148,61"/>
-</map>
diff --git a/d1/d9e/prefix__sum__array_8cpp_ab36151479ad37d53ef9fcb60a274b1d9_cgraph.md5 b/d1/d9e/prefix__sum__array_8cpp_ab36151479ad37d53ef9fcb60a274b1d9_cgraph.md5
deleted file mode 100644
index 96c392c17..000000000
--- a/d1/d9e/prefix__sum__array_8cpp_ab36151479ad37d53ef9fcb60a274b1d9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8fba4c4d80fa30d94099a480af9f4fbc
\ No newline at end of file
diff --git a/d1/d9e/prefix__sum__array_8cpp_ab36151479ad37d53ef9fcb60a274b1d9_cgraph.svg b/d1/d9e/prefix__sum__array_8cpp_ab36151479ad37d53ef9fcb60a274b1d9_cgraph.svg
deleted file mode 100644
index 0d31fb3d0..000000000
--- a/d1/d9e/prefix__sum__array_8cpp_ab36151479ad37d53ef9fcb60a274b1d9_cgraph.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::prefix_sum_array::build Pages: 1 -->
-<svg width="267pt" height="69pt"
- viewBox="0.00 0.00 266.50 68.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64.88)">
-<title>range_queries::prefix_sum_array::build</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="function that builds the PSA">
-<polygon fill="#999999" stroke="#666666" points="106.75,-42.88 0,-42.88 0,-12.37 106.75,-12.37 106.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::prefix</text>
-<text text-anchor="middle" x="53.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_sum_array::build</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.28,-43.36C21.96,-52.43 30.65,-60.88 53.38,-60.88 65.8,-60.88 74.03,-58.35 78.07,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.52,-55.22 79.28,-44.86 74.57,-54.35 81.52,-55.22"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.5,-56.25 142.75,-56.25 142.75,-37 258.5,-37 258.5,-56.25"/>
-<text text-anchor="middle" x="200.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.22,-34.54C115.05,-35.56 123.21,-36.63 131.3,-37.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.78,-41.15 141.15,-38.98 131.69,-34.21 130.78,-41.15"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.88,-19.25 157.38,-19.25 157.38,0 243.88,0 243.88,-19.25"/>
-<text text-anchor="middle" x="200.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.22,-21.08C119.77,-19.52 133.17,-17.86 145.76,-16.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.05,-19.79 155.54,-15.09 145.19,-12.84 146.05,-19.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d9e/prefix__sum__array_8cpp_ab36151479ad37d53ef9fcb60a274b1d9_cgraph_org.svg b/d1/d9e/prefix__sum__array_8cpp_ab36151479ad37d53ef9fcb60a274b1d9_cgraph_org.svg
deleted file mode 100644
index 8635a6193..000000000
--- a/d1/d9e/prefix__sum__array_8cpp_ab36151479ad37d53ef9fcb60a274b1d9_cgraph_org.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::prefix_sum_array::build Pages: 1 -->
-<svg width="267pt" height="69pt"
- viewBox="0.00 0.00 266.50 68.88" 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 64.88)">
-<title>range_queries::prefix_sum_array::build</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="function that builds the PSA">
-<polygon fill="#999999" stroke="#666666" points="106.75,-42.88 0,-42.88 0,-12.37 106.75,-12.37 106.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::prefix</text>
-<text text-anchor="middle" x="53.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_sum_array::build</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.28,-43.36C21.96,-52.43 30.65,-60.88 53.38,-60.88 65.8,-60.88 74.03,-58.35 78.07,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.52,-55.22 79.28,-44.86 74.57,-54.35 81.52,-55.22"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.5,-56.25 142.75,-56.25 142.75,-37 258.5,-37 258.5,-56.25"/>
-<text text-anchor="middle" x="200.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.22,-34.54C115.05,-35.56 123.21,-36.63 131.3,-37.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.78,-41.15 141.15,-38.98 131.69,-34.21 130.78,-41.15"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.88,-19.25 157.38,-19.25 157.38,0 243.88,0 243.88,-19.25"/>
-<text text-anchor="middle" x="200.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.22,-21.08C119.77,-19.52 133.17,-17.86 145.76,-16.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.05,-19.79 155.54,-15.09 145.19,-12.84 146.05,-19.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d9e/prefix__sum__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d1/d9e/prefix__sum__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index a548cd42a..000000000
--- a/d1/d9e/prefix__sum__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d1/d9e/prefix__sum__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/d9e/prefix__sum__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 27b9c2213..000000000
--- a/d1/d9e/prefix__sum__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9be9bb4469c289fd6092a1a2397556bb
\ No newline at end of file
diff --git a/d1/d9e/prefix__sum__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/d9e/prefix__sum__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 1e257882a..000000000
--- a/d1/d9e/prefix__sum__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/d9e/prefix__sum__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d1/d9e/prefix__sum__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index c3c00cb78..000000000
--- a/d1/d9e/prefix__sum__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/d9e/prefix__sum__array_8cpp_source.html b/d1/d9e/prefix__sum__array_8cpp_source.html
new file mode 100644
index 000000000..3b3f99a70
--- /dev/null
+++ b/d1/d9e/prefix__sum__array_8cpp_source.html
@@ -0,0 +1,188 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: range_queries/prefix_sum_array.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/d9e/prefix__sum__array_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">prefix_sum_array.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d1/d9e/prefix__sum__array_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d69/namespacerange__queries.html">range_queries</a> {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d88/namespaceprefix__sum__array.html">prefix_sum_array</a> {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>std::vector&lt;int64_t&gt; PSA(1, 0);</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="foldopen" id="foldopen00041" data-start="{" data-end="}">
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../d1/d9e/prefix__sum__array_8cpp.html#ab36151479ad37d53ef9fcb60a274b1d9">   41</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d9e/prefix__sum__array_8cpp.html#ab36151479ad37d53ef9fcb60a274b1d9">build</a>(std::vector&lt;int64_t&gt; original_array) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= static_cast&lt;int&gt;(original_array.size()); i++) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        PSA.push_back(PSA[i - 1] + original_array[i]);</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    }</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>}</div>
+</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../d1/d9e/prefix__sum__array_8cpp.html#a7c8fd967c36dbba5fdf9c71faed604cf">   52</a></span>int64_t <a class="code hl_struct" href="../../dd/d1b/structquery.html">query</a>(int64_t beg, int64_t end) { <span class="keywordflow">return</span> PSA[end] - PSA[beg - 1]; }</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>}  <span class="comment">// namespace prefix_sum_array</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>}  <span class="comment">// namespace range_queries</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="foldopen" id="foldopen00061" data-start="{" data-end="}">
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"><a class="line" href="../../d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   61</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    std::vector&lt;int64_t&gt; values{0,  123, 0,  2,  -2, 5,</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>                                24, 0,   23, -1, -1};  <span class="comment">// original array</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    range_queries::prefix_sum_array::build(values);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="comment">// queries are of the type: sum of the range [a, b] = psa[b] - psa[a-1]</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    assert(range_queries::prefix_sum_array::query(1, 10) ==</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>           173);  <span class="comment">// sum of the entire array</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    assert(range_queries::prefix_sum_array::query(4, 6) ==</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>           27);  <span class="comment">// the sum of the interval [4, 6]</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    assert(range_queries::prefix_sum_array::query(5, 9) ==</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>           51);  <span class="comment">// the sum of the interval [5, 9]</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>}</div>
+</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="foldopen" id="foldopen00080" data-start="{" data-end="}">
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="../../d1/d9e/prefix__sum__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   80</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/d9e/prefix__sum__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <a class="code hl_function" href="../../d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>}</div>
+</div>
+<div class="ttc" id="anamespaceprefix__sum__array_html"><div class="ttname"><a href="../../d7/d88/namespaceprefix__sum__array.html">prefix_sum_array</a></div><div class="ttdoc">Range sum queries using prefix-sum-array.</div></div>
+<div class="ttc" id="anamespacerange__queries_html"><div class="ttname"><a href="../../dd/d69/namespacerange__queries.html">range_queries</a></div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00028">fenwick_tree.cpp:28</a></div></div>
+<div class="ttc" id="aprefix__sum__array_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d1/d9e/prefix__sum__array_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> <a href="#l00061">prefix_sum_array.cpp:61</a></div></div>
+<div class="ttc" id="aprefix__sum__array_8cpp_html_ab36151479ad37d53ef9fcb60a274b1d9"><div class="ttname"><a href="../../d1/d9e/prefix__sum__array_8cpp.html#ab36151479ad37d53ef9fcb60a274b1d9">range_queries::prefix_sum_array::build</a></div><div class="ttdeci">void build(std::vector&lt; int64_t &gt; original_array)</div><div class="ttdoc">function that builds the PSA</div><div class="ttdef"><b>Definition</b> <a href="#l00041">prefix_sum_array.cpp:41</a></div></div>
+<div class="ttc" id="aprefix__sum__array_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/d9e/prefix__sum__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00080">prefix_sum_array.cpp:80</a></div></div>
+<div class="ttc" id="astructquery_html"><div class="ttname"><a href="../../dd/d1b/structquery.html">query</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d53/mo_8cpp_source.html#l00009">mo.cpp:9</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_074119ce3a874b57120c49a0cc4bb5ad.html">range_queries</a></li><li class="navelem"><a class="el" href="../../d1/d9e/prefix__sum__array_8cpp.html">prefix_sum_array.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/da6/rungekutta_8cpp.html b/d1/da6/rungekutta_8cpp.html
index 9056a1e46..96b3c3ba8 100644
--- a/d1/da6/rungekutta_8cpp.html
+++ b/d1/da6/rungekutta_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/rungekutta.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/rungekutta.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for rungekutta.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/dc7/rungekutta_8cpp__incl.svg" width="336" height="111"><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">
+</div>
+<p><a href="../../d1/da6/rungekutta_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr>
@@ -152,6 +171,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods" target="_blank">Runge Kutta fourth order</a> method implementation </p>
 <dl class="section author"><dt>Author</dt><dd><a href="http://github.com/rudra697" target="_blank">Rudra Prasad Das</a></dd></dl>
 <p>It solves the unknown value of y for a given value of x only first order differential equations can be solved </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d1/da6/rungekutta_8cpp_source.html">rungekutta.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a450497475f5607333f9aca8f88901579" name="a450497475f5607333f9aca8f88901579"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a450497475f5607333f9aca8f88901579">&#9670;&#160;</a></span>change()</h2>
@@ -192,6 +213,8 @@ Functions</h2></td></tr>
 <dl class="section return"><dt>Returns</dt><dd>the computed function value at that call </dd></dl>
 <dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html#a0">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp</a>.</dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/da6/rungekutta_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../d1/da6/rungekutta_8cpp_source.html">rungekutta.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   33</span>{ <span class="keywordflow">return</span> ((x - y) / 2.0); }</div>
 </div><!-- fragment -->
 </div>
@@ -213,17 +236,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/da6/rungekutta_8cpp_source.html#l00130">130</a> of file <a class="el" href="../../d1/da6/rungekutta_8cpp_source.html">rungekutta.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  130</span>           {</div>
 <div class="line"><span class="lineno">  131</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Execute the tests</span></div>
 <div class="line"><span class="lineno">  132</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  133</span>}</div>
-<div class="ttc" id="arungekutta_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Tests to check algorithm implementation.</div><div class="ttdef"><b>Definition</b> rungekutta.cpp:100</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/da6/rungekutta_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="arungekutta_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Tests to check algorithm implementation.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/da6/rungekutta_8cpp_source.html#l00100">rungekutta.cpp:100</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7b9f40c7b5e9749cc550f19be3dc8856" name="a7b9f40c7b5e9749cc550f19be3dc8856"></a>
@@ -268,6 +288,8 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>the value of y at thr required value of x from the initial conditions </dd></dl>
 <dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html#a1">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp</a>.</dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/da6/rungekutta_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../d1/da6/rungekutta_8cpp_source.html">rungekutta.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   58</span>                                   {</div>
 <div class="line"><span class="lineno">   59</span>    <span class="comment">// Count number of iterations</span></div>
 <div class="line"><span class="lineno">   60</span>    <span class="comment">// using step size or</span></div>
@@ -279,7 +301,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   66</span> </div>
 <div class="line"><span class="lineno">   67</span>    <span class="keyword">auto</span> n = <span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>((x - init_x) / <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>);</div>
 <div class="line"><span class="lineno">   68</span>    <span class="comment">// used a vector container for the variables</span></div>
-<div class="line"><span class="lineno">   69</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>(4, 0.0);</div>
+<div class="line"><span class="lineno">   69</span>    std::vector&lt;double&gt; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>(4, 0.0);</div>
 <div class="line"><span class="lineno">   70</span> </div>
 <div class="line"><span class="lineno">   71</span>    <span class="comment">// Iterate for number of iterations</span></div>
 <div class="line"><span class="lineno">   72</span> </div>
@@ -303,16 +325,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   90</span> </div>
 <div class="line"><span class="lineno">   91</span>    <span class="keywordflow">return</span> y;</div>
 <div class="line"><span class="lineno">   92</span>}</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> hash_search.cpp:45</div></div>
-<div class="ttc" id="arungekutta_8cpp_html_a450497475f5607333f9aca8f88901579"><div class="ttname"><a href="#a450497475f5607333f9aca8f88901579">change</a></div><div class="ttdeci">static double change(double x, double y)</div><div class="ttdoc">asserting the test functions</div><div class="ttdef"><b>Definition</b> rungekutta.cpp:33</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph.svg" width="283" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00045">hash_search.cpp:45</a></div></div>
+<div class="ttc" id="arungekutta_8cpp_html_a450497475f5607333f9aca8f88901579"><div class="ttname"><a href="#a450497475f5607333f9aca8f88901579">change</a></div><div class="ttdeci">static double change(double x, double y)</div><div class="ttdoc">asserting the test functions</div><div class="ttdef"><b>Definition</b> <a href="../../d1/da6/rungekutta_8cpp_source.html#l00033">rungekutta.cpp:33</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -340,33 +356,34 @@ Here is the call graph for this function:</div>
 
 <p>Tests to check algorithm implementation. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/da6/rungekutta_8cpp_source.html#l00100">100</a> of file <a class="el" href="../../d1/da6/rungekutta_8cpp_source.html">rungekutta.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  100</span>                   {</div>
-<div class="line"><span class="lineno">  101</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The Runge Kutta function will be tested on the basis of &quot;</span></div>
+<div class="line"><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The Runge Kutta function will be tested on the basis of &quot;</span></div>
 <div class="line"><span class="lineno">  102</span>                 <span class="stringliteral">&quot;precomputed values\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  103</span> </div>
-<div class="line"><span class="lineno">  104</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1....&quot;</span></div>
+<div class="line"><span class="lineno">  104</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1....&quot;</span></div>
 <div class="line"><span class="lineno">  105</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  106</span>    <span class="keywordtype">double</span> valfirst = <a class="code hl_function" href="#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a>(</div>
 <div class="line"><span class="lineno">  107</span>        2, 3, 4, 0.2);  <span class="comment">// Tests the function with pre calculated values</span></div>
 <div class="line"><span class="lineno">  108</span>    assert(valfirst == 3.10363932323749570);</div>
-<div class="line"><span class="lineno">  109</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 1\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  109</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 1\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  110</span> </div>
-<div class="line"><span class="lineno">  111</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2....&quot;</span></div>
+<div class="line"><span class="lineno">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2....&quot;</span></div>
 <div class="line"><span class="lineno">  112</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  113</span>    <span class="keywordtype">double</span> valsec = <a class="code hl_function" href="#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a>(</div>
 <div class="line"><span class="lineno">  114</span>        1, 2, 5, 0.1);  <span class="comment">// The value of step changed</span></div>
 <div class="line"><span class="lineno">  115</span>    assert(valsec == 3.40600589380261409);</div>
-<div class="line"><span class="lineno">  116</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 2\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  116</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 2\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  117</span> </div>
-<div class="line"><span class="lineno">  118</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3....&quot;</span></div>
+<div class="line"><span class="lineno">  118</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3....&quot;</span></div>
 <div class="line"><span class="lineno">  119</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  120</span>    <span class="keywordtype">double</span> valthird = <a class="code hl_function" href="#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a>(</div>
 <div class="line"><span class="lineno">  121</span>        -1, 3, 4, 0.1);  <span class="comment">// Tested with negative value</span></div>
 <div class="line"><span class="lineno">  122</span>    assert(valthird == 2.49251005860244268);</div>
-<div class="line"><span class="lineno">  123</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 3\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  123</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 3\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  124</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="arungekutta_8cpp_html_a7b9f40c7b5e9749cc550f19be3dc8856"><div class="ttname"><a href="#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a></div><div class="ttdeci">double rungeKutta(double init_x, const double &amp;init_y, const double &amp;x, const double &amp;h)</div><div class="ttdoc">the Runge Kutta method finds the value of integration of a function in the given limits....</div><div class="ttdef"><b>Definition</b> rungekutta.cpp:57</div></div>
+<div class="ttc" id="arungekutta_8cpp_html_a7b9f40c7b5e9749cc550f19be3dc8856"><div class="ttname"><a href="#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a></div><div class="ttdeci">double rungeKutta(double init_x, const double &amp;init_y, const double &amp;x, const double &amp;h)</div><div class="ttdoc">the Runge Kutta method finds the value of integration of a function in the given limits....</div><div class="ttdef"><b>Definition</b> <a href="../../d1/da6/rungekutta_8cpp_source.html#l00057">rungekutta.cpp:57</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph.map b/d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph.map
deleted file mode 100644
index 9ddff3647..000000000
--- a/d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="numerical_methods::runge_kutta::rungeKutta" name="numerical_methods::runge_kutta::rungeKutta">
-<area shape="rect" id="Node000001" title="the Runge Kutta method finds the value of integration of a function in the given limits...." alt="" coords="5,29,166,70"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="55,29,53,19,58,11,69,5,86,3,103,5,114,11,111,16,101,10,85,8,71,10,62,14,58,20,60,28"/>
-<area shape="rect" id="Node000002" href="$d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579" title="asserting the test functions" alt="" coords="214,12,277,37"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="165,34,198,29,199,34,166,40"/>
-<area shape="rect" id="Node000003" href="$d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" title=" " alt="" coords="226,61,265,86"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="166,59,211,66,210,71,165,64"/>
-</map>
diff --git a/d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph.md5 b/d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph.md5
deleted file mode 100644
index 8712c43d7..000000000
--- a/d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4b166e3b126e619907528809ca5c64cc
\ No newline at end of file
diff --git a/d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph.svg b/d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph.svg
deleted file mode 100644
index e072d070c..000000000
--- a/d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::runge_kutta::rungeKutta Pages: 1 -->
-<svg width="212pt" height="69pt"
- viewBox="0.00 0.00 211.75 68.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64.88)">
-<title>numerical_methods::runge_kutta::rungeKutta</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="the Runge Kutta method finds the value of integration of a function in the given limits....">
-<polygon fill="#999999" stroke="#666666" points="120.25,-42.88 0,-42.88 0,-12.37 120.25,-12.37 120.25,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="60.12" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">runge_kutta::rungeKutta</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.88,-43.36C34.55,-52.43 41.63,-60.88 60.12,-60.88 70.24,-60.88 76.94,-58.35 80.23,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.69,-55.17 81.21,-44.87 76.72,-54.46 83.69,-55.17"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579" target="_top" xlink:title="asserting the test functions">
-<polygon fill="white" stroke="#666666" points="203.75,-56.25 156.25,-56.25 156.25,-37 203.75,-37 203.75,-56.25"/>
-<text text-anchor="middle" x="180" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">change</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.41,-37.18C128.68,-38.51 136.95,-39.85 144.56,-41.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.95,-44.52 154.38,-42.66 145.06,-37.61 143.95,-44.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194.4,-19.25 165.6,-19.25 165.6,0 194.4,0 194.4,-19.25"/>
-<text text-anchor="middle" x="180" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.41,-18.57C132.18,-16.77 143.93,-14.98 153.79,-13.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.26,-16.94 163.62,-11.97 153.21,-10.02 154.26,-16.94"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph_org.svg b/d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph_org.svg
deleted file mode 100644
index a7499ccf3..000000000
--- a/d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph_org.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::runge_kutta::rungeKutta Pages: 1 -->
-<svg width="212pt" height="69pt"
- viewBox="0.00 0.00 211.75 68.88" 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 64.88)">
-<title>numerical_methods::runge_kutta::rungeKutta</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="the Runge Kutta method finds the value of integration of a function in the given limits....">
-<polygon fill="#999999" stroke="#666666" points="120.25,-42.88 0,-42.88 0,-12.37 120.25,-12.37 120.25,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="60.12" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">runge_kutta::rungeKutta</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.88,-43.36C34.55,-52.43 41.63,-60.88 60.12,-60.88 70.24,-60.88 76.94,-58.35 80.23,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.69,-55.17 81.21,-44.87 76.72,-54.46 83.69,-55.17"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579" target="_top" xlink:title="asserting the test functions">
-<polygon fill="white" stroke="#666666" points="203.75,-56.25 156.25,-56.25 156.25,-37 203.75,-37 203.75,-56.25"/>
-<text text-anchor="middle" x="180" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">change</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.41,-37.18C128.68,-38.51 136.95,-39.85 144.56,-41.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.95,-44.52 154.38,-42.66 145.06,-37.61 143.95,-44.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194.4,-19.25 165.6,-19.25 165.6,0 194.4,0 194.4,-19.25"/>
-<text text-anchor="middle" x="180" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.41,-18.57C132.18,-16.77 143.93,-14.98 153.79,-13.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.26,-16.94 163.62,-11.97 153.21,-10.02 154.26,-16.94"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/da6/rungekutta_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d1/da6/rungekutta_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 696e8ae2a..000000000
--- a/d1/da6/rungekutta_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Tests to check algorithm implementation." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d1/da6/rungekutta_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/da6/rungekutta_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 0ce175bbd..000000000
--- a/d1/da6/rungekutta_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-522817575743a598fc6eb2c0a5eeb150
\ No newline at end of file
diff --git a/d1/da6/rungekutta_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/da6/rungekutta_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 0fae9de18..000000000
--- a/d1/da6/rungekutta_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Tests to check algorithm implementation.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/da6/rungekutta_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d1/da6/rungekutta_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index b6c223559..000000000
--- a/d1/da6/rungekutta_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Tests to check algorithm implementation.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/da6/rungekutta_8cpp_source.html b/d1/da6/rungekutta_8cpp_source.html
new file mode 100644
index 000000000..3d48c5233
--- /dev/null
+++ b/d1/da6/rungekutta_8cpp_source.html
@@ -0,0 +1,228 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/rungekutta.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/da6/rungekutta_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">rungekutta.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d1/da6/rungekutta_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">   33</a></span><span class="keyword">static</span> <span class="keywordtype">double</span> <a class="code hl_function" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(<span class="keywordtype">double</span> x, <span class="keywordtype">double</span> y) { <span class="keywordflow">return</span> ((x - y) / 2.0); }</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a> {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/de7/namespacerunge__kutta.html">runge_kutta</a> {</div>
+<div class="foldopen" id="foldopen00057" data-start="{" data-end="}">
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">   57</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">rungeKutta</a>(<span class="keywordtype">double</span> init_x, <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;init_y, <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x,</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>                  <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;<a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="comment">// Count number of iterations</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="comment">// using step size or</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="comment">// step height h</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="comment">// n calucates the number of iterations</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="comment">// k1, k2, k3, k4 are the Runge Kutta variables</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="comment">// used for calculation of y at each iteration</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keyword">auto</span> n = <span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>((x - init_x) / <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="comment">// used a vector container for the variables</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    std::vector&lt;double&gt; k(4, 0.0);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="comment">// Iterate for number of iterations</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordtype">double</span> y = init_y;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= n; ++i) {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        <span class="comment">// Apply Runge Kutta Formulas</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="comment">// to find next value of y</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        k[0] = <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> * <a class="code hl_function" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x, y);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        k[1] = <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> * <a class="code hl_function" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x + 0.5 * <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, y + 0.5 * k[0]);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        k[2] = <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> * <a class="code hl_function" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x + 0.5 * <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, y + 0.5 * k[1]);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        k[3] = <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> * <a class="code hl_function" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x + <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, y + k[2]);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <span class="comment">// Update next value of y</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        y += (1.0 / 6.0) * (k[0] + 2 * k[1] + 2 * k[2] + k[3]);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        <span class="comment">// Update next value of x</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        init_x += <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordflow">return</span> y;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>}</div>
+</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>}  <span class="comment">// namespace runge_kutta</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>}  <span class="comment">// namespace numerical_methods</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="foldopen" id="foldopen00100" data-start="{" data-end="}">
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"><a class="line" href="../../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  100</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The Runge Kutta function will be tested on the basis of &quot;</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>                 <span class="stringliteral">&quot;precomputed values\n&quot;</span>;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1....&quot;</span></div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="keywordtype">double</span> valfirst = numerical_methods::runge_kutta::rungeKutta(</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        2, 3, 4, 0.2);  <span class="comment">// Tests the function with pre calculated values</span></div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    assert(valfirst == 3.10363932323749570);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 1\n&quot;</span>;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span> </div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2....&quot;</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="keywordtype">double</span> valsec = numerical_methods::runge_kutta::rungeKutta(</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        1, 2, 5, 0.1);  <span class="comment">// The value of step changed</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    assert(valsec == 3.40600589380261409);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 2\n&quot;</span>;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span> </div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3....&quot;</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <span class="keywordtype">double</span> valthird = numerical_methods::runge_kutta::rungeKutta(</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        -1, 3, 4, 0.1);  <span class="comment">// Tested with negative value</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    assert(valthird == 2.49251005860244268);</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 3\n&quot;</span>;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>}</div>
+</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
+<div class="foldopen" id="foldopen00130" data-start="{" data-end="}">
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"><a class="line" href="../../d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  130</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <a class="code hl_function" href="../../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Execute the tests</span></div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>}</div>
+</div>
+<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00045">hash_search.cpp:45</a></div></div>
+<div class="ttc" id="anamespacenumerical__methods_html"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacerunge__kutta_html"><div class="ttname"><a href="../../d2/de7/namespacerunge__kutta.html">runge_kutta</a></div><div class="ttdoc">Functions for Runge Kutta fourth order method.</div></div>
+<div class="ttc" id="arungekutta_8cpp_html_a450497475f5607333f9aca8f88901579"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a></div><div class="ttdeci">static double change(double x, double y)</div><div class="ttdoc">asserting the test functions</div><div class="ttdef"><b>Definition</b> <a href="#l00033">rungekutta.cpp:33</a></div></div>
+<div class="ttc" id="arungekutta_8cpp_html_a7b9f40c7b5e9749cc550f19be3dc8856"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a></div><div class="ttdeci">double rungeKutta(double init_x, const double &amp;init_y, const double &amp;x, const double &amp;h)</div><div class="ttdoc">the Runge Kutta method finds the value of integration of a function in the given limits....</div><div class="ttdef"><b>Definition</b> <a href="#l00057">rungekutta.cpp:57</a></div></div>
+<div class="ttc" id="arungekutta_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Tests to check algorithm implementation.</div><div class="ttdef"><b>Definition</b> <a href="#l00100">rungekutta.cpp:100</a></div></div>
+<div class="ttc" id="arungekutta_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00130">rungekutta.cpp:130</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../d1/da6/rungekutta_8cpp.html">rungekutta.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/da7/armstrong__number__templated_8cpp.html b/d1/da7/armstrong__number__templated_8cpp.html
index ba4e290d9..1508a1e32 100644
--- a/d1/da7/armstrong__number__templated_8cpp.html
+++ b/d1/da7/armstrong__number__templated_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/armstrong_number_templated.cpp File Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming/armstrong_number_templated.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for armstrong_number_templated.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/dc5/armstrong__number__templated_8cpp__incl.svg" width="252" height="126"><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">
+</div>
+<p><a href="../../d1/da7/armstrong__number__templated_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
@@ -149,6 +168,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/shivhek25" target="_blank">Shivam Singhal</a> </dd>
 <dd>
 <a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d1/da7/armstrong__number__templated_8cpp_source.html">armstrong_number_templated.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -167,17 +188,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/da7/armstrong__number__templated_8cpp_source.html#l00090">90</a> of file <a class="el" href="../../d1/da7/armstrong__number__templated_8cpp_source.html">armstrong_number_templated.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   90</span>           {</div>
 <div class="line"><span class="lineno">   91</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   92</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   93</span>}</div>
-<div class="ttc" id="aarmstrong__number__templated_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> armstrong_number_templated.cpp:71</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="479" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aarmstrong__number__templated_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/da7/armstrong__number__templated_8cpp_source.html#l00071">armstrong_number_templated.cpp:71</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -205,6 +223,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/da7/armstrong__number__templated_8cpp_source.html#l00071">71</a> of file <a class="el" href="../../d1/da7/armstrong__number__templated_8cpp_source.html">armstrong_number_templated.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   71</span>                    {</div>
 <div class="line"><span class="lineno">   72</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">dynamic_programming::is_armstrong</a>(153) == <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">   73</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">dynamic_programming::is_armstrong</a>(1) == <span class="keyword">true</span>);</div>
@@ -217,16 +237,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   80</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">dynamic_programming::is_armstrong</a>(989) == <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">   81</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">dynamic_programming::is_armstrong</a>(103) == <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">   82</span> </div>
-<div class="line"><span class="lineno">   83</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   83</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   84</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="anamespacedynamic__programming_html_af046365a8d77a1267acc082f86135a26"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">dynamic_programming::is_armstrong</a></div><div class="ttdeci">bool is_armstrong(const T &amp;number)</div><div class="ttdoc">Checks if the given number is armstrong or not.</div><div class="ttdef"><b>Definition</b> armstrong_number_templated.cpp:39</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="382" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacedynamic__programming_html_af046365a8d77a1267acc082f86135a26"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">dynamic_programming::is_armstrong</a></div><div class="ttdeci">bool is_armstrong(const T &amp;number)</div><div class="ttdoc">Checks if the given number is armstrong or not.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/da7/armstrong__number__templated_8cpp_source.html#l00039">armstrong_number_templated.cpp:39</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index e1981f0d4..000000000
--- a/d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,13,56,38"/>
-<area shape="rect" id="Node000002" href="$dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26" title="Checks if the given number is armstrong or not." alt="" coords="104,5,256,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,23,88,23,88,28,56,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="304,13,375,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="257,23,288,23,288,28,257,28"/>
-</map>
diff --git a/d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 216e61c9b..000000000
--- a/d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b44e10878ced7e9fa812384c9c32fd9a
\ No newline at end of file
diff --git a/d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index 62c775197..000000000
--- a/d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="286pt" height="39pt"
- viewBox="0.00 0.00 285.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-24.88 0,-24.88 0,-5.63 37.75,-5.63 37.75,-24.88"/>
-<text text-anchor="middle" x="18.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26" target="_top" xlink:title="Checks if the given number is armstrong or not.">
-<polygon fill="white" stroke="#666666" points="188,-30.5 73.75,-30.5 73.75,0 188,0 188,-30.5"/>
-<text text-anchor="start" x="81.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="130.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::is_armstrong</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.04,-15.25C44.99,-15.25 53.39,-15.25 62.26,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.15,-18.75 72.15,-15.25 62.15,-11.75 62.15,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="277.5,-24.88 224,-24.88 224,-5.63 277.5,-5.63 277.5,-24.88"/>
-<text text-anchor="middle" x="250.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.4,-15.25C196.46,-15.25 204.59,-15.25 212.17,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.03,-18.75 222.03,-15.25 212.03,-11.75 212.03,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index e535e38f2..000000000
--- a/d1/da7/armstrong__number__templated_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="286pt" height="39pt"
- viewBox="0.00 0.00 285.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-24.88 0,-24.88 0,-5.63 37.75,-5.63 37.75,-24.88"/>
-<text text-anchor="middle" x="18.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26" target="_top" xlink:title="Checks if the given number is armstrong or not.">
-<polygon fill="white" stroke="#666666" points="188,-30.5 73.75,-30.5 73.75,0 188,0 188,-30.5"/>
-<text text-anchor="start" x="81.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="130.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::is_armstrong</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.04,-15.25C44.99,-15.25 53.39,-15.25 62.26,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.15,-18.75 72.15,-15.25 62.15,-11.75 62.15,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="277.5,-24.88 224,-24.88 224,-5.63 277.5,-5.63 277.5,-24.88"/>
-<text text-anchor="middle" x="250.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.4,-15.25C196.46,-15.25 204.59,-15.25 212.17,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.03,-18.75 222.03,-15.25 212.03,-11.75 212.03,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index f9fbb23aa..000000000
--- a/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,13,55,38"/>
-<area shape="rect" id="Node000002" href="$d1/da7/armstrong__number__templated_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,13,153,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,23,88,23,88,28,55,28"/>
-<area shape="rect" id="Node000003" href="$dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26" title="Checks if the given number is armstrong or not." alt="" coords="201,5,353,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,23,186,23,186,28,153,28"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="401,13,473,38"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="354,23,386,23,386,28,354,28"/>
-</map>
diff --git a/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 32c8878b9..000000000
--- a/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ec3c99204a91eb6d2db419fdce5fbf07
\ No newline at end of file
diff --git a/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 13657b65b..000000000
--- a/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="359pt" height="39pt"
- viewBox="0.00 0.00 358.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-24.88 0,-24.88 0,-5.63 37,-5.63 37,-24.88"/>
-<text text-anchor="middle" x="18.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/da7/armstrong__number__templated_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-24.88 73,-24.88 73,-5.63 110.75,-5.63 110.75,-24.88"/>
-<text text-anchor="middle" x="91.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-15.25C44.55,-15.25 53.37,-15.25 61.69,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-18.75 71.43,-15.25 61.43,-11.75 61.43,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26" target="_top" xlink:title="Checks if the given number is armstrong or not.">
-<polygon fill="white" stroke="#666666" points="261,-30.5 146.75,-30.5 146.75,0 261,0 261,-30.5"/>
-<text text-anchor="start" x="154.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="203.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::is_armstrong</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.04,-15.25C117.99,-15.25 126.39,-15.25 135.26,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.15,-18.75 145.15,-15.25 135.15,-11.75 135.15,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="350.5,-24.88 297,-24.88 297,-5.63 350.5,-5.63 350.5,-24.88"/>
-<text text-anchor="middle" x="323.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M261.4,-15.25C269.46,-15.25 277.59,-15.25 285.17,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.03,-18.75 295.03,-15.25 285.03,-11.75 285.03,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index d45985b33..000000000
--- a/d1/da7/armstrong__number__templated_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="359pt" height="39pt"
- viewBox="0.00 0.00 358.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-24.88 0,-24.88 0,-5.63 37,-5.63 37,-24.88"/>
-<text text-anchor="middle" x="18.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/da7/armstrong__number__templated_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-24.88 73,-24.88 73,-5.63 110.75,-5.63 110.75,-24.88"/>
-<text text-anchor="middle" x="91.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-15.25C44.55,-15.25 53.37,-15.25 61.69,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-18.75 71.43,-15.25 61.43,-11.75 61.43,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26" target="_top" xlink:title="Checks if the given number is armstrong or not.">
-<polygon fill="white" stroke="#666666" points="261,-30.5 146.75,-30.5 146.75,0 261,0 261,-30.5"/>
-<text text-anchor="start" x="154.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="203.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::is_armstrong</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.04,-15.25C117.99,-15.25 126.39,-15.25 135.26,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.15,-18.75 145.15,-15.25 135.15,-11.75 135.15,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="350.5,-24.88 297,-24.88 297,-5.63 350.5,-5.63 350.5,-24.88"/>
-<text text-anchor="middle" x="323.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M261.4,-15.25C269.46,-15.25 277.59,-15.25 285.17,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.03,-18.75 295.03,-15.25 285.03,-11.75 285.03,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/da7/armstrong__number__templated_8cpp_source.html b/d1/da7/armstrong__number__templated_8cpp_source.html
new file mode 100644
index 000000000..bf226d771
--- /dev/null
+++ b/d1/da7/armstrong__number__templated_8cpp_source.html
@@ -0,0 +1,202 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/armstrong_number_templated.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/da7/armstrong__number__templated_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">armstrong_number_templated.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d1/da7/armstrong__number__templated_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;cmath&gt;</span>     </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a> {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00039" data-start="{" data-end="}">
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">   39</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">is_armstrong</a>(<span class="keyword">const</span> T &amp;number) {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordtype">int</span> count = 0, temp = number, result = 0, rem = 0;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="comment">// Count the number of digits of the given number.</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="comment">// For example: 153 would be 3 digits.</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">while</span> (temp != 0) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        temp /= 10;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        count++;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="comment">// Calculation for checking of armstrongs number i.e.</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="comment">// in an n-digit number sum of the digits is raised to a power of `n` is</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="comment">// equal to the original number.</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    temp = number;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">while</span> (temp != 0) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        rem = temp % 10;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        result += <span class="keyword">static_cast&lt;</span>T<span class="keyword">&gt;</span>(std::pow(rem, count));</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        temp /= 10;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    }</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">if</span> (result == number) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>}</div>
+</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>}  <span class="comment">// namespace dynamic_programming</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="foldopen" id="foldopen00071" data-start="{" data-end="}">
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"><a class="line" href="../../d1/da7/armstrong__number__templated_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">   71</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/da7/armstrong__number__templated_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">dynamic_programming::is_armstrong</a>(153) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">dynamic_programming::is_armstrong</a>(1) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">dynamic_programming::is_armstrong</a>(0) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">dynamic_programming::is_armstrong</a>(370) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">dynamic_programming::is_armstrong</a>(1634) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">dynamic_programming::is_armstrong</a>(580) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">dynamic_programming::is_armstrong</a>(15) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">dynamic_programming::is_armstrong</a>(1024) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">dynamic_programming::is_armstrong</a>(989) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">dynamic_programming::is_armstrong</a>(103) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>}</div>
+</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="foldopen" id="foldopen00090" data-start="{" data-end="}">
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="../../d1/da7/armstrong__number__templated_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   90</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/da7/armstrong__number__templated_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <a class="code hl_function" href="../../d1/da7/armstrong__number__templated_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>}</div>
+</div>
+<div class="ttc" id="aarmstrong__number__templated_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d1/da7/armstrong__number__templated_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> <a href="#l00071">armstrong_number_templated.cpp:71</a></div></div>
+<div class="ttc" id="aarmstrong__number__templated_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/da7/armstrong__number__templated_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00090">armstrong_number_templated.cpp:90</a></div></div>
+<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
+<div class="ttc" id="anamespacedynamic__programming_html_af046365a8d77a1267acc082f86135a26"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">dynamic_programming::is_armstrong</a></div><div class="ttdeci">bool is_armstrong(const T &amp;number)</div><div class="ttdoc">Checks if the given number is armstrong or not.</div><div class="ttdef"><b>Definition</b> <a href="#l00039">armstrong_number_templated.cpp:39</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../d1/da7/armstrong__number__templated_8cpp.html">armstrong_number_templated.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp.html b/d1/daa/random__pivot__quick__sort_8cpp.html
index 579aff02b..f870e6318 100644
--- a/d1/daa/random__pivot__quick__sort_8cpp.html
+++ b/d1/daa/random__pivot__quick__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/random_pivot_quick_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/random_pivot_quick_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -125,7 +142,9 @@ Include dependency graph for random_pivot_quick_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/random__pivot__quick__sort_8cpp__incl.svg" width="494" height="126"><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">
+</div>
+<p><a href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td></tr>
@@ -144,22 +163,22 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ac3281dc34a9cfd7beb332419b8a0aa10" id="r_ac3281dc34a9cfd7beb332419b8a0aa10"><td class="memTemplParams" colspan="2">template&lt;size_t T&gt; </td></tr>
-<tr class="memitem:ac3281dc34a9cfd7beb332419b8a0aa10"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac3281dc34a9cfd7beb332419b8a0aa10">sorting::random_pivot_quick_sort::showArray</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int64_t, T &gt; arr)</td></tr>
+<tr class="memitem:ac3281dc34a9cfd7beb332419b8a0aa10"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac3281dc34a9cfd7beb332419b8a0aa10">sorting::random_pivot_quick_sort::showArray</a> (std::array&lt; int64_t, T &gt; arr)</td></tr>
 <tr class="memdesc:ac3281dc34a9cfd7beb332419b8a0aa10"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to print the array.  <br /></td></tr>
 <tr class="separator:ac3281dc34a9cfd7beb332419b8a0aa10"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aac5657b4fe2251cd21073f44233f6ea5" id="r_aac5657b4fe2251cd21073f44233f6ea5"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aac5657b4fe2251cd21073f44233f6ea5">sorting::random_pivot_quick_sort::getRandomIndex</a> (int64_t start, int64_t end)</td></tr>
 <tr class="memdesc:aac5657b4fe2251cd21073f44233f6ea5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Takes the start and end indices of an array and returns a random int64_teger between the range of those two for selecting pivot element.  <br /></td></tr>
 <tr class="separator:aac5657b4fe2251cd21073f44233f6ea5"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a3d1c39e1ff42c04fb8ec0c0b9411cd3e" id="r_a3d1c39e1ff42c04fb8ec0c0b9411cd3e"><td class="memTemplParams" colspan="2">template&lt;size_t size&gt; </td></tr>
-<tr class="memitem:a3d1c39e1ff42c04fb8ec0c0b9411cd3e"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">std::tuple</a>&lt; int64_t, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int64_t, size &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a3d1c39e1ff42c04fb8ec0c0b9411cd3e">sorting::random_pivot_quick_sort::partition</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int64_t, size &gt; arr, int64_t start, int64_t end)</td></tr>
+<tr class="memitem:a3d1c39e1ff42c04fb8ec0c0b9411cd3e"><td class="memTemplItemLeft" align="right" valign="top">std::tuple&lt; int64_t, std::array&lt; int64_t, size &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a3d1c39e1ff42c04fb8ec0c0b9411cd3e">sorting::random_pivot_quick_sort::partition</a> (std::array&lt; int64_t, size &gt; arr, int64_t start, int64_t end)</td></tr>
 <tr class="memdesc:a3d1c39e1ff42c04fb8ec0c0b9411cd3e"><td class="mdescLeft">&#160;</td><td class="mdescRight">A partition function which handles the partition logic of quick sort.  <br /></td></tr>
 <tr class="separator:a3d1c39e1ff42c04fb8ec0c0b9411cd3e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a7d2e7465e7b5d54c2de6d5e9db1ea6a5" id="r_a7d2e7465e7b5d54c2de6d5e9db1ea6a5"><td class="memTemplParams" colspan="2">template&lt;size_t size&gt; </td></tr>
-<tr class="memitem:a7d2e7465e7b5d54c2de6d5e9db1ea6a5"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int64_t, size &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int64_t, size &gt; arr, int64_t start, int64_t end)</td></tr>
+<tr class="memitem:a7d2e7465e7b5d54c2de6d5e9db1ea6a5"><td class="memTemplItemLeft" align="right" valign="top">std::array&lt; int64_t, size &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a> (std::array&lt; int64_t, size &gt; arr, int64_t start, int64_t end)</td></tr>
 <tr class="memdesc:a7d2e7465e7b5d54c2de6d5e9db1ea6a5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Random pivot quick sort function. This function is the starting point of the algorithm.  <br /></td></tr>
 <tr class="separator:a7d2e7465e7b5d54c2de6d5e9db1ea6a5"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a40675d2eb960c71ca31ec475ba90120d" id="r_a40675d2eb960c71ca31ec475ba90120d"><td class="memTemplParams" colspan="2">template&lt;size_t size&gt; </td></tr>
-<tr class="memitem:a40675d2eb960c71ca31ec475ba90120d"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int64_t, size &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a40675d2eb960c71ca31ec475ba90120d">sorting::random_pivot_quick_sort::generateUnsortedArray</a> (int64_t from, int64_t to)</td></tr>
+<tr class="memitem:a40675d2eb960c71ca31ec475ba90120d"><td class="memTemplItemLeft" align="right" valign="top">std::array&lt; int64_t, size &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a40675d2eb960c71ca31ec475ba90120d">sorting::random_pivot_quick_sort::generateUnsortedArray</a> (int64_t from, int64_t to)</td></tr>
 <tr class="memdesc:a40675d2eb960c71ca31ec475ba90120d"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function utility to generate unsorted array of given size and range.  <br /></td></tr>
 <tr class="separator:a40675d2eb960c71ca31ec475ba90120d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -196,6 +215,8 @@ Functions</h2></td></tr>
 <li>Return the partition index from the function.</li>
 </ul>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/foo290" target="_blank">Nitin Sharma</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html">random_pivot_quick_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a40675d2eb960c71ca31ec475ba90120d" name="a40675d2eb960c71ca31ec475ba90120d"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a40675d2eb960c71ca31ec475ba90120d">&#9670;&#160;</a></span>generateUnsortedArray()</h2>
@@ -206,7 +227,7 @@ Functions</h2></td></tr>
 template&lt;size_t size&gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int64_t, size &gt; sorting::random_pivot_quick_sort::generateUnsortedArray </td>
+          <td class="memname">std::array&lt; int64_t, size &gt; sorting::random_pivot_quick_sort::generateUnsortedArray </td>
           <td>(</td>
           <td class="paramtype">int64_t</td>          <td class="paramname"><span class="paramname"><em>from</em></span>, </td>
         </tr>
@@ -233,9 +254,11 @@ template&lt;size_t size&gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>std::array&lt;int64_t , size&gt; Unsorted array of specified size. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00160">160</a> of file <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html">random_pivot_quick_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  160</span>                                                                        {</div>
-<div class="line"><span class="lineno">  161</span>    srand(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">time</a>(<span class="keyword">nullptr</span>));</div>
-<div class="line"><span class="lineno">  162</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int64_t, size&gt;</a> unsortedArray{};</div>
+<div class="line"><span class="lineno">  161</span>    srand(time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><span class="lineno">  162</span>    std::array&lt;int64_t, size&gt; unsortedArray{};</div>
 <div class="line"><span class="lineno">  163</span>    assert(from &lt; to);</div>
 <div class="line"><span class="lineno">  164</span>    int64_t i = 0;</div>
 <div class="line"><span class="lineno">  165</span>    <span class="keywordflow">while</span> (i &lt; size) {</div>
@@ -247,14 +270,7 @@ template&lt;size_t size&gt; </div>
 <div class="line"><span class="lineno">  171</span>    }</div>
 <div class="line"><span class="lineno">  172</span>    <span class="keywordflow">return</span> unsortedArray;</div>
 <div class="line"><span class="lineno">  173</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/daa/random__pivot__quick__sort_8cpp_a40675d2eb960c71ca31ec475ba90120d_cgraph.svg" width="211" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aac5657b4fe2251cd21073f44233f6ea5" name="aac5657b4fe2251cd21073f44233f6ea5"></a>
@@ -285,18 +301,14 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>int64_t A random number between start and end index. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00088">88</a> of file <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html">random_pivot_quick_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   88</span>                                                   {</div>
-<div class="line"><span class="lineno">   89</span>    srand(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">time</a>(<span class="keyword">nullptr</span>));  <span class="comment">// Initialize random number generator.</span></div>
-<div class="line"><span class="lineno">   90</span>    int64_t randomPivotIndex = start + rand() % (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> - start + 1);</div>
+<div class="line"><span class="lineno">   89</span>    srand(time(<span class="keyword">nullptr</span>));  <span class="comment">// Initialize random number generator.</span></div>
+<div class="line"><span class="lineno">   90</span>    int64_t randomPivotIndex = start + rand() % (end - start + 1);</div>
 <div class="line"><span class="lineno">   91</span>    <span class="keywordflow">return</span> randomPivotIndex;</div>
 <div class="line"><span class="lineno">   92</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/daa/random__pivot__quick__sort_8cpp_aac5657b4fe2251cd21073f44233f6ea5_cgraph.svg" width="207" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
@@ -327,35 +339,29 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00323">323</a> of file <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html">random_pivot_quick_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  323</span>                                 {</div>
 <div class="line"><span class="lineno">  324</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Executes various test cases.</span></div>
 <div class="line"><span class="lineno">  325</span> </div>
 <div class="line"><span class="lineno">  326</span>    <span class="keyword">const</span> int64_t inputSize = 10;</div>
-<div class="line"><span class="lineno">  327</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int64_t, inputSize&gt;</a> unsorted_array =</div>
+<div class="line"><span class="lineno">  327</span>    std::array&lt;int64_t, inputSize&gt; unsorted_array =</div>
 <div class="line"><span class="lineno">  328</span>        sorting::random_pivot_quick_sort::generateUnsortedArray&lt;inputSize&gt;(</div>
 <div class="line"><span class="lineno">  329</span>            50, 1000);</div>
-<div class="line"><span class="lineno">  330</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Unsorted array is : &quot;</span> &lt;&lt; <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">  330</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Unsorted array is : &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  331</span>    <a class="code hl_function" href="#ac3281dc34a9cfd7beb332419b8a0aa10">sorting::random_pivot_quick_sort::showArray</a>(unsorted_array);</div>
 <div class="line"><span class="lineno">  332</span> </div>
-<div class="line"><span class="lineno">  333</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int64_t, inputSize&gt;</a> sorted_array =</div>
+<div class="line"><span class="lineno">  333</span>    std::array&lt;int64_t, inputSize&gt; sorted_array =</div>
 <div class="line"><span class="lineno">  334</span>        <a class="code hl_function" href="#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a>(</div>
-<div class="line"><span class="lineno">  335</span>            unsorted_array, 0, unsorted_array.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>() - 1);</div>
-<div class="line"><span class="lineno">  336</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Sorted array is : &quot;</span> &lt;&lt; <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">  335</span>            unsorted_array, 0, unsorted_array.size() - 1);</div>
+<div class="line"><span class="lineno">  336</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted array is : &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  337</span>    <a class="code hl_function" href="#ac3281dc34a9cfd7beb332419b8a0aa10">sorting::random_pivot_quick_sort::showArray</a>(sorted_array);</div>
 <div class="line"><span class="lineno">  338</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  339</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="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="arandom__pivot__quick__sort_8cpp_html_a7d2e7465e7b5d54c2de6d5e9db1ea6a5"><div class="ttname"><a href="#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a></div><div class="ttdeci">std::array&lt; int64_t, size &gt; quickSortRP(std::array&lt; int64_t, size &gt; arr, int64_t start, int64_t end)</div><div class="ttdoc">Random pivot quick sort function. This function is the starting point of the algorithm.</div><div class="ttdef"><b>Definition</b> random_pivot_quick_sort.cpp:130</div></div>
-<div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> random_pivot_quick_sort.cpp:312</div></div>
-<div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_ac3281dc34a9cfd7beb332419b8a0aa10"><div class="ttname"><a href="#ac3281dc34a9cfd7beb332419b8a0aa10">sorting::random_pivot_quick_sort::showArray</a></div><div class="ttdeci">void showArray(std::array&lt; int64_t, T &gt; arr)</div><div class="ttdoc">Utility function to print the array.</div><div class="ttdef"><b>Definition</b> random_pivot_quick_sort.cpp:73</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/size.html">std::array::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="100%" height="508"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_a7d2e7465e7b5d54c2de6d5e9db1ea6a5"><div class="ttname"><a href="#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a></div><div class="ttdeci">std::array&lt; int64_t, size &gt; quickSortRP(std::array&lt; int64_t, size &gt; arr, int64_t start, int64_t end)</div><div class="ttdoc">Random pivot quick sort function. This function is the starting point of the algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00130">random_pivot_quick_sort.cpp:130</a></div></div>
+<div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00312">random_pivot_quick_sort.cpp:312</a></div></div>
+<div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_ac3281dc34a9cfd7beb332419b8a0aa10"><div class="ttname"><a href="#ac3281dc34a9cfd7beb332419b8a0aa10">sorting::random_pivot_quick_sort::showArray</a></div><div class="ttdeci">void showArray(std::array&lt; int64_t, T &gt; arr)</div><div class="ttdoc">Utility function to print the array.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00073">random_pivot_quick_sort.cpp:73</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a3d1c39e1ff42c04fb8ec0c0b9411cd3e" name="a3d1c39e1ff42c04fb8ec0c0b9411cd3e"></a>
@@ -367,9 +373,9 @@ Here is the call graph for this function:</div>
 template&lt;size_t size&gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">std::tuple</a>&lt; int64_t, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int64_t, size &gt; &gt; sorting::random_pivot_quick_sort::partition </td>
+          <td class="memname">std::tuple&lt; int64_t, std::array&lt; int64_t, size &gt; &gt; sorting::random_pivot_quick_sort::partition </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int64_t, size &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
+          <td class="paramtype">std::array&lt; int64_t, size &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -399,30 +405,25 @@ template&lt;size_t size&gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>std::tuple&lt;int64_t , std::array&lt;int64_t , size&gt;&gt; A tuple of pivot index and pivot sorted array. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00103">103</a> of file <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html">random_pivot_quick_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  104</span>                                                             {</div>
-<div class="line"><span class="lineno">  105</span>    int64_t pivot = arr[<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a>];  <span class="comment">// Randomly selected element will be here from</span></div>
+<div class="line"><span class="lineno">  105</span>    int64_t pivot = arr[end];  <span class="comment">// Randomly selected element will be here from</span></div>
 <div class="line"><span class="lineno">  106</span>                               <span class="comment">// caller function (quickSortRP()).</span></div>
 <div class="line"><span class="lineno">  107</span>    int64_t pInd = start;</div>
 <div class="line"><span class="lineno">  108</span> </div>
-<div class="line"><span class="lineno">  109</span>    <span class="keywordflow">for</span> (int64_t i = start; i &lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a>; i++) {</div>
+<div class="line"><span class="lineno">  109</span>    <span class="keywordflow">for</span> (int64_t i = start; i &lt; end; i++) {</div>
 <div class="line"><span class="lineno">  110</span>        <span class="keywordflow">if</span> (arr[i] &lt;= pivot) {</div>
-<div class="line"><span class="lineno">  111</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(arr[i], arr[pInd]);  <span class="comment">// swapping the elements from current</span></div>
+<div class="line"><span class="lineno">  111</span>            std::swap(arr[i], arr[pInd]);  <span class="comment">// swapping the elements from current</span></div>
 <div class="line"><span class="lineno">  112</span>                                           <span class="comment">// index to pInd.</span></div>
 <div class="line"><span class="lineno">  113</span>            pInd++;</div>
 <div class="line"><span class="lineno">  114</span>        }</div>
 <div class="line"><span class="lineno">  115</span>    }</div>
-<div class="line"><span class="lineno">  116</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(arr[pInd],</div>
+<div class="line"><span class="lineno">  116</span>    std::swap(arr[pInd],</div>
 <div class="line"><span class="lineno">  117</span>              arr[end]);  <span class="comment">// swapping the pivot element to its sorted position</span></div>
-<div class="line"><span class="lineno">  118</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html">std::make_tuple</a>(pInd, arr);</div>
+<div class="line"><span class="lineno">  118</span>    <span class="keywordflow">return</span> std::make_tuple(pInd, arr);</div>
 <div class="line"><span class="lineno">  119</span>}</div>
-<div class="ttc" id="amake_tuple_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html">std::make_tuple</a></div><div class="ttdeci">T make_tuple(T... args)</div></div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- 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="../../d1/daa/random__pivot__quick__sort_8cpp_a3d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph.svg" width="320" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7d2e7465e7b5d54c2de6d5e9db1ea6a5" name="a7d2e7465e7b5d54c2de6d5e9db1ea6a5"></a>
@@ -434,9 +435,9 @@ Here is the call graph for this function:</div>
 template&lt;size_t size&gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int64_t, size &gt; sorting::random_pivot_quick_sort::quickSortRP </td>
+          <td class="memname">std::array&lt; int64_t, size &gt; sorting::random_pivot_quick_sort::quickSortRP </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int64_t, size &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
+          <td class="paramtype">std::array&lt; int64_t, size &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -466,35 +467,30 @@ template&lt;size_t size&gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>std::array&lt;int64_t , size&gt; A fully sorted array in ascending order. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00130">130</a> of file <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html">random_pivot_quick_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  131</span>                                                                  {</div>
 <div class="line"><span class="lineno">  132</span>    <span class="keywordflow">if</span> (start &lt; end) {</div>
 <div class="line"><span class="lineno">  133</span>        int64_t randomIndex = <a class="code hl_function" href="#aac5657b4fe2251cd21073f44233f6ea5">getRandomIndex</a>(start, end);</div>
 <div class="line"><span class="lineno">  134</span> </div>
 <div class="line"><span class="lineno">  135</span>        <span class="comment">// switching the pivot with right most bound.</span></div>
-<div class="line"><span class="lineno">  136</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(arr[end], arr[randomIndex]);</div>
+<div class="line"><span class="lineno">  136</span>        std::swap(arr[end], arr[randomIndex]);</div>
 <div class="line"><span class="lineno">  137</span> </div>
 <div class="line"><span class="lineno">  138</span>        int64_t pivotIndex = 0;</div>
 <div class="line"><span class="lineno">  139</span>        <span class="comment">// getting pivot index and pivot sorted array.</span></div>
-<div class="line"><span class="lineno">  140</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a>(pivotIndex, arr) = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/partition.html">partition</a>(arr, start, end);</div>
+<div class="line"><span class="lineno">  140</span>        std::tie(pivotIndex, arr) = partition(arr, start, end);</div>
 <div class="line"><span class="lineno">  141</span> </div>
 <div class="line"><span class="lineno">  142</span>        <span class="comment">// Recursively calling</span></div>
-<div class="line"><span class="lineno">  143</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;int64_t, arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>()&gt; rightSortingLeft =</div>
+<div class="line"><span class="lineno">  143</span>        std::array&lt;int64_t, arr.size()&gt; rightSortingLeft =</div>
 <div class="line"><span class="lineno">  144</span>            <a class="code hl_function" href="#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">quickSortRP</a>(arr, start, pivotIndex - 1);</div>
-<div class="line"><span class="lineno">  145</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;int64_t, arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>()&gt; full_sorted =</div>
+<div class="line"><span class="lineno">  145</span>        std::array&lt;int64_t, arr.size()&gt; full_sorted =</div>
 <div class="line"><span class="lineno">  146</span>            <a class="code hl_function" href="#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">quickSortRP</a>(rightSortingLeft, pivotIndex + 1, end);</div>
 <div class="line"><span class="lineno">  147</span>        arr = full_sorted;</div>
 <div class="line"><span class="lineno">  148</span>    }</div>
 <div class="line"><span class="lineno">  149</span>    <span class="keywordflow">return</span> arr;</div>
 <div class="line"><span class="lineno">  150</span>}</div>
-<div class="ttc" id="apartition_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/partition.html">std::partition</a></div><div class="ttdeci">T partition(T... args)</div></div>
-<div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_aac5657b4fe2251cd21073f44233f6ea5"><div class="ttname"><a href="#aac5657b4fe2251cd21073f44233f6ea5">sorting::random_pivot_quick_sort::getRandomIndex</a></div><div class="ttdeci">int64_t getRandomIndex(int64_t start, int64_t end)</div><div class="ttdoc">Takes the start and end indices of an array and returns a random int64_teger between the range of tho...</div><div class="ttdef"><b>Definition</b> random_pivot_quick_sort.cpp:88</div></div>
-<div class="ttc" id="atie_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a></div><div class="ttdeci">T tie(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/daa/random__pivot__quick__sort_8cpp_a7d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph.svg" width="424" height="224"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_aac5657b4fe2251cd21073f44233f6ea5"><div class="ttname"><a href="#aac5657b4fe2251cd21073f44233f6ea5">sorting::random_pivot_quick_sort::getRandomIndex</a></div><div class="ttdeci">int64_t getRandomIndex(int64_t start, int64_t end)</div><div class="ttdoc">Takes the start and end indices of an array and returns a random int64_teger between the range of tho...</div><div class="ttdef"><b>Definition</b> <a href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00088">random_pivot_quick_sort.cpp:88</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac3281dc34a9cfd7beb332419b8a0aa10" name="ac3281dc34a9cfd7beb332419b8a0aa10"></a>
@@ -508,7 +504,7 @@ template&lt;size_t T&gt; </div>
         <tr>
           <td class="memname">void sorting::random_pivot_quick_sort::showArray </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int64_t, T &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
+          <td class="paramtype">std::array&lt; int64_t, T &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -528,18 +524,15 @@ template&lt;size_t T&gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   73</span>                                         {</div>
-<div class="line"><span class="lineno">   74</span>    <span class="keywordflow">for</span> (int64_t i = 0; i &lt; arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>(); i++) {</div>
-<div class="line"><span class="lineno">   75</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
-<div class="line"><span class="lineno">   76</span>    }</div>
-<div class="line"><span class="lineno">   77</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   78</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/daa/random__pivot__quick__sort_8cpp_ac3281dc34a9cfd7beb332419b8a0aa10_cgraph.svg" width="326" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00073">73</a> of file <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html">random_pivot_quick_sort.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   73</span>                                         {</div>
+<div class="line"><span class="lineno">   74</span>    <span class="keywordflow">for</span> (int64_t i = 0; i &lt; arr.size(); i++) {</div>
+<div class="line"><span class="lineno">   75</span>        std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   76</span>    }</div>
+<div class="line"><span class="lineno">   77</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   78</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -567,18 +560,15 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00312">312</a> of file <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html">random_pivot_quick_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  312</span>                   {</div>
 <div class="line"><span class="lineno">  313</span>    <a class="code hl_class" href="../../d5/d58/class_test_cases.html">TestCases</a> tc = <a class="code hl_class" href="../../d5/d58/class_test_cases.html">TestCases</a>();</div>
 <div class="line"><span class="lineno">  314</span>    tc.<a class="code hl_function" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a>();</div>
 <div class="line"><span class="lineno">  315</span>}</div>
-<div class="ttc" id="aclass_test_cases_html"><div class="ttname"><a href="../../d5/d58/class_test_cases.html">TestCases</a></div><div class="ttdoc">class encapsulating the necessary test cases</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:225</div></div>
-<div class="ttc" id="aclass_test_cases_html_aeabea90c02f9159e4a784bbf736e1e23"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">TestCases::runTests</a></div><div class="ttdeci">void runTests()</div><div class="ttdoc">Executes test cases.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:243</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="467"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclass_test_cases_html"><div class="ttname"><a href="../../d5/d58/class_test_cases.html">TestCases</a></div><div class="ttdoc">class encapsulating the necessary test cases</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00225">inorder_successor_of_bst.cpp:225</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_aeabea90c02f9159e4a784bbf736e1e23"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">TestCases::runTests</a></div><div class="ttdeci">void runTests()</div><div class="ttdoc">Executes test cases.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00243">inorder_successor_of_bst.cpp:243</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
deleted file mode 100644
index 52ae7720e..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ /dev/null
@@ -1,27 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,80,55,106"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="814,119,885,145"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,79,103,57,170,32,248,11,289,5,329,3,530,3,600,6,653,18,704,39,767,70,797,87,824,107,820,111,794,92,765,74,702,44,651,23,599,12,530,8,329,8,289,10,249,16,172,37,105,62,56,84"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="103,130,211,156"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,100,109,121,107,126,54,105"/>
-<area shape="rect" id="Node000004" href="$d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="135,80,178,106"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="55,91,119,91,119,96,55,96"/>
-<area shape="rect" id="Node000005" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="259,119,401,145"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="180,95,255,113,254,118,179,101"/>
-<area shape="poly" id="edge5_Node000005_Node000002" title=" " alt="" coords="354,116,397,96,449,80,538,67,608,67,679,79,767,100,803,111,801,116,765,105,678,84,608,73,538,72,450,85,399,101,357,121"/>
-<area shape="rect" id="Node000006" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="657,195,766,221"/>
-<area shape="poly" id="edge6_Node000005_Node000006" title=" " alt="" coords="358,143,400,163,450,180,550,198,641,204,641,210,549,203,449,185,398,168,355,148"/>
-<area shape="rect" id="Node000007" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, printing inorder successor of last node." alt="" coords="449,95,609,121"/>
-<area shape="poly" id="edge8_Node000005_Node000007" title=" " alt="" coords="401,121,433,117,434,122,402,126"/>
-<area shape="rect" id="Node000008" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="449,144,609,170"/>
-<area shape="poly" id="edge11_Node000005_Node000008" title=" " alt="" coords="402,138,434,143,433,148,401,144"/>
-<area shape="rect" id="Node000009" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="449,246,609,272"/>
-<area shape="poly" id="edge14_Node000005_Node000009" title=" " alt="" coords="347,143,392,182,451,224,475,237,473,242,448,229,388,187,344,147"/>
-<area shape="poly" id="edge7_Node000006_Node000002" title=" " alt="" coords="735,192,810,150,813,155,738,197"/>
-<area shape="poly" id="edge9_Node000007_Node000002" title=" " alt="" coords="609,111,799,126,798,131,609,117"/>
-<area shape="poly" id="edge10_Node000007_Node000006" title=" " alt="" coords="584,119,610,130,651,155,686,183,683,187,648,160,607,134,582,124"/>
-<area shape="poly" id="edge12_Node000008_Node000002" title=" " alt="" coords="609,148,798,133,799,139,609,154"/>
-<area shape="poly" id="edge13_Node000008_Node000006" title=" " alt="" coords="579,168,649,188,647,193,577,173"/>
-<area shape="poly" id="edge15_Node000009_Node000002" title=" " alt="" coords="609,262,687,256,727,247,765,231,786,216,805,197,832,157,837,160,809,200,790,220,767,236,729,252,688,262,609,268"/>
-<area shape="poly" id="edge16_Node000009_Node000006" title=" " alt="" coords="577,243,647,223,649,228,579,248"/>
-</map>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
deleted file mode 100644
index fd5b3b001..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-31cc20888567fc08184cf71c248a3bdd
\ No newline at end of file
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
deleted file mode 100644
index db985afd3..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ /dev/null
@@ -1,320 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 208 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 668;
-var viewHeight = 208;
-var sectionId = 'dynsection-3';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-143.25 0,-143.25 0,-124 37,-124 37,-143.25"/>
-<text text-anchor="middle" x="18.5" y="-129.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="660,-114.25 606.5,-114.25 606.5,-95 660,-95 660,-114.25"/>
-<text text-anchor="middle" x="633.25" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-142.8C74.72,-160.94 163.45,-199.62 242.62,-199.62 242.62,-199.62 242.62,-199.62 393.75,-199.62 475.39,-199.62 497.09,-185.33 570.5,-149.62 585.6,-142.28 600.86,-131.2 612.43,-121.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="614.6,-124.63 620.04,-115.54 610.12,-119.25 614.6,-124.63"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.25,-106.25 73,-106.25 73,-87 154.25,-87 154.25,-106.25"/>
-<text text-anchor="middle" x="113.62" y="-92.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.46,-126.49C48.63,-122.05 63.4,-116.18 76.88,-110.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.92,-114.18 85.93,-107.23 75.34,-107.67 77.92,-114.18"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="129.88,-143.25 97.38,-143.25 97.38,-124 129.88,-124 129.88,-143.25"/>
-<text text-anchor="middle" x="113.62" y="-129.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.46,-133.62C51.05,-133.62 69.96,-133.62 85.41,-133.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.38,-137.13 95.38,-133.63 85.38,-130.13 85.38,-137.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
-<polygon fill="white" stroke="#666666" points="297,-114.25 190.25,-114.25 190.25,-95 297,-95 297,-114.25"/>
-<text text-anchor="middle" x="243.62" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.32,-130.07C144.58,-126.84 166.49,-121.87 187.18,-117.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.72,-120.65 196.7,-115.03 186.17,-113.83 187.72,-120.65"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge5_Node000005_Node000002" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge5_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.57,-114.64C279.96,-123.73 307.4,-136.48 333,-141.62 436.69,-162.46 467.63,-151.18 570.5,-126.62 579.37,-124.51 588.74,-121.56 597.43,-118.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="598.37,-121.89 606.56,-115.16 595.96,-115.32 598.37,-121.89"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="570.5,-57.25 488.5,-57.25 488.5,-38 570.5,-38 570.5,-57.25"/>
-<text text-anchor="middle" x="529.5" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.33,-94.56C280.82,-85.64 307.93,-73.07 333,-66.62 380.8,-54.34 437.03,-49.88 476.88,-48.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="476.8,-51.82 486.67,-47.98 476.56,-44.82 476.8,-51.82"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
-<polygon fill="white" stroke="#666666" points="452.5,-132.25 333,-132.25 333,-113 452.5,-113 452.5,-132.25"/>
-<text text-anchor="middle" x="392.75" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge8_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge8_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.32,-111.07C305.11,-112.03 313.24,-113.02 321.32,-114.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.82,-117.47 331.17,-115.21 321.67,-110.52 320.82,-117.47"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="452.5,-95.25 333,-95.25 333,-76 452.5,-76 452.5,-95.25"/>
-<text text-anchor="middle" x="392.75" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge11_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge11_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.32,-97.82C305.11,-96.81 313.24,-95.76 321.32,-94.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="321.7,-98.2 331.17,-93.45 320.81,-91.26 321.7,-98.2"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="452.5,-19.25 333,-19.25 333,0 452.5,0 452.5,-19.25"/>
-<text text-anchor="middle" x="392.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge14_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge14_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.03,-94.57C270.84,-79.71 302.31,-51.7 333,-33.62 338.84,-30.19 345.26,-27.01 351.65,-24.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="353,-27.41 360.87,-20.32 350.3,-20.95 353,-27.41"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node2 -->
-<g id="edge7_Node000006_Node000002" class="edge">
-<title>Node6&#45;&gt;Node2</title>
-<g id="a_edge7_Node000006_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M548.22,-57.55C563.74,-66.25 586.54,-79.02 604.48,-89.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="602.63,-92.05 613.07,-93.88 606.05,-85.94 602.63,-92.05"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node2 -->
-<g id="edge9_Node000007_Node000002" class="edge">
-<title>Node7&#45;&gt;Node2</title>
-<g id="a_edge9_Node000007_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M452.71,-118.18C497.21,-114.82 556.92,-110.31 595,-107.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="594.86,-110.96 604.57,-106.71 594.34,-103.98 594.86,-110.96"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge10_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge10_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M433.36,-112.55C439.91,-110.31 446.51,-107.67 452.5,-104.62 473.48,-93.96 494.69,-77.46 509.36,-64.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="511.61,-67.63 516.84,-58.42 507.01,-62.37 511.61,-67.63"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node2 -->
-<g id="edge12_Node000008_Node000002" class="edge">
-<title>Node8&#45;&gt;Node2</title>
-<g id="a_edge12_Node000008_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M452.71,-90.32C497.21,-93.87 556.92,-98.62 595,-101.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="594.32,-105.11 604.57,-102.42 594.88,-98.14 594.32,-105.11"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge13_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge13_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M429.51,-75.54C445.62,-71 464.86,-65.57 482.08,-60.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="482.91,-64.12 491.59,-58.03 481.01,-57.38 482.91,-64.12"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node2 -->
-<g id="edge15_Node000009_Node000002" class="edge">
-<title>Node9&#45;&gt;Node2</title>
-<g id="a_edge15_Node000009_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M452.79,-4.99C488.83,-4.73 534.71,-9.17 570.5,-28.62 593.76,-41.26 611.56,-66.64 621.95,-84.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="618.84,-86.2 626.71,-93.29 624.98,-82.84 618.84,-86.2"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node6 -->
-<g id="edge16_Node000009_Node000006" class="edge">
-<title>Node9&#45;&gt;Node6</title>
-<g id="a_edge16_Node000009_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M429.51,-19.71C445.62,-24.25 464.86,-29.68 482.08,-34.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.01,-37.87 491.59,-37.22 482.91,-31.13 481.01,-37.87"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
deleted file mode 100644
index c9f3e00a2..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
+++ /dev/null
@@ -1,237 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="668pt" height="208pt"
- viewBox="0.00 0.00 668.00 207.62" 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 203.62)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-143.25 0,-143.25 0,-124 37,-124 37,-143.25"/>
-<text text-anchor="middle" x="18.5" y="-129.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="660,-114.25 606.5,-114.25 606.5,-95 660,-95 660,-114.25"/>
-<text text-anchor="middle" x="633.25" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-142.8C74.72,-160.94 163.45,-199.62 242.62,-199.62 242.62,-199.62 242.62,-199.62 393.75,-199.62 475.39,-199.62 497.09,-185.33 570.5,-149.62 585.6,-142.28 600.86,-131.2 612.43,-121.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="614.6,-124.63 620.04,-115.54 610.12,-119.25 614.6,-124.63"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.25,-106.25 73,-106.25 73,-87 154.25,-87 154.25,-106.25"/>
-<text text-anchor="middle" x="113.62" y="-92.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.46,-126.49C48.63,-122.05 63.4,-116.18 76.88,-110.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.92,-114.18 85.93,-107.23 75.34,-107.67 77.92,-114.18"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="129.88,-143.25 97.38,-143.25 97.38,-124 129.88,-124 129.88,-143.25"/>
-<text text-anchor="middle" x="113.62" y="-129.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.46,-133.62C51.05,-133.62 69.96,-133.62 85.41,-133.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.38,-137.13 95.38,-133.63 85.38,-130.13 85.38,-137.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
-<polygon fill="white" stroke="#666666" points="297,-114.25 190.25,-114.25 190.25,-95 297,-95 297,-114.25"/>
-<text text-anchor="middle" x="243.62" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.32,-130.07C144.58,-126.84 166.49,-121.87 187.18,-117.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.72,-120.65 196.7,-115.03 186.17,-113.83 187.72,-120.65"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge5_Node000005_Node000002" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge5_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.57,-114.64C279.96,-123.73 307.4,-136.48 333,-141.62 436.69,-162.46 467.63,-151.18 570.5,-126.62 579.37,-124.51 588.74,-121.56 597.43,-118.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="598.37,-121.89 606.56,-115.16 595.96,-115.32 598.37,-121.89"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="570.5,-57.25 488.5,-57.25 488.5,-38 570.5,-38 570.5,-57.25"/>
-<text text-anchor="middle" x="529.5" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.33,-94.56C280.82,-85.64 307.93,-73.07 333,-66.62 380.8,-54.34 437.03,-49.88 476.88,-48.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="476.8,-51.82 486.67,-47.98 476.56,-44.82 476.8,-51.82"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
-<polygon fill="white" stroke="#666666" points="452.5,-132.25 333,-132.25 333,-113 452.5,-113 452.5,-132.25"/>
-<text text-anchor="middle" x="392.75" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge8_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge8_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.32,-111.07C305.11,-112.03 313.24,-113.02 321.32,-114.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.82,-117.47 331.17,-115.21 321.67,-110.52 320.82,-117.47"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="452.5,-95.25 333,-95.25 333,-76 452.5,-76 452.5,-95.25"/>
-<text text-anchor="middle" x="392.75" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge11_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge11_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.32,-97.82C305.11,-96.81 313.24,-95.76 321.32,-94.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="321.7,-98.2 331.17,-93.45 320.81,-91.26 321.7,-98.2"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="452.5,-19.25 333,-19.25 333,0 452.5,0 452.5,-19.25"/>
-<text text-anchor="middle" x="392.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge14_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge14_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.03,-94.57C270.84,-79.71 302.31,-51.7 333,-33.62 338.84,-30.19 345.26,-27.01 351.65,-24.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="353,-27.41 360.87,-20.32 350.3,-20.95 353,-27.41"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node2 -->
-<g id="edge7_Node000006_Node000002" class="edge">
-<title>Node6&#45;&gt;Node2</title>
-<g id="a_edge7_Node000006_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M548.22,-57.55C563.74,-66.25 586.54,-79.02 604.48,-89.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="602.63,-92.05 613.07,-93.88 606.05,-85.94 602.63,-92.05"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node2 -->
-<g id="edge9_Node000007_Node000002" class="edge">
-<title>Node7&#45;&gt;Node2</title>
-<g id="a_edge9_Node000007_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M452.71,-118.18C497.21,-114.82 556.92,-110.31 595,-107.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="594.86,-110.96 604.57,-106.71 594.34,-103.98 594.86,-110.96"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge10_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge10_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M433.36,-112.55C439.91,-110.31 446.51,-107.67 452.5,-104.62 473.48,-93.96 494.69,-77.46 509.36,-64.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="511.61,-67.63 516.84,-58.42 507.01,-62.37 511.61,-67.63"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node2 -->
-<g id="edge12_Node000008_Node000002" class="edge">
-<title>Node8&#45;&gt;Node2</title>
-<g id="a_edge12_Node000008_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M452.71,-90.32C497.21,-93.87 556.92,-98.62 595,-101.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="594.32,-105.11 604.57,-102.42 594.88,-98.14 594.32,-105.11"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge13_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge13_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M429.51,-75.54C445.62,-71 464.86,-65.57 482.08,-60.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="482.91,-64.12 491.59,-58.03 481.01,-57.38 482.91,-64.12"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node2 -->
-<g id="edge15_Node000009_Node000002" class="edge">
-<title>Node9&#45;&gt;Node2</title>
-<g id="a_edge15_Node000009_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M452.79,-4.99C488.83,-4.73 534.71,-9.17 570.5,-28.62 593.76,-41.26 611.56,-66.64 621.95,-84.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="618.84,-86.2 626.71,-93.29 624.98,-82.84 618.84,-86.2"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node6 -->
-<g id="edge16_Node000009_Node000006" class="edge">
-<title>Node9&#45;&gt;Node6</title>
-<g id="a_edge16_Node000009_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M429.51,-19.71C445.62,-24.25 464.86,-29.68 482.08,-34.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.01,-37.87 491.59,-37.22 482.91,-31.13 481.01,-37.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a3d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph.map b/d1/daa/random__pivot__quick__sort_8cpp_a3d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph.map
deleted file mode 100644
index a2268c504..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_a3d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="sorting::random_pivot_quick_sort::partition" name="sorting::random_pivot_quick_sort::partition">
-<area shape="rect" id="Node000001" title="A partition function which handles the partition logic of quick sort." alt="" coords="5,23,152,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/tuple/make_tuple.html#" title=" " alt="" coords="200,5,314,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="152,30,184,26,185,31,153,36"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="218,55,296,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="153,51,203,58,202,63,152,56"/>
-</map>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a3d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph.md5 b/d1/daa/random__pivot__quick__sort_8cpp_a3d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph.md5
deleted file mode 100644
index 6ed2d4fdf..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_a3d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d34e803b57601bb88cdf6539a52187a2
\ No newline at end of file
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a3d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph.svg b/d1/daa/random__pivot__quick__sort_8cpp_a3d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph.svg
deleted file mode 100644
index b87943353..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_a3d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::random_pivot_quick_sort::partition Pages: 1 -->
-<svg width="240pt" height="64pt"
- viewBox="0.00 0.00 239.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>sorting::random_pivot_quick_sort::partition</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A partition function which handles the partition logic of quick sort.">
-<polygon fill="#999999" stroke="#666666" points="109.75,-42.88 0,-42.88 0,-12.37 109.75,-12.37 109.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::random_pivot</text>
-<text text-anchor="middle" x="54.88" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_quick_sort::partition</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.5,-56.25 145.75,-56.25 145.75,-37 231.5,-37 231.5,-56.25"/>
-<text text-anchor="middle" x="188.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_tuple</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.22,-35.46C118.13,-36.6 126.26,-37.78 134.15,-38.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.58,-42.37 143.98,-40.33 134.58,-35.44 133.58,-42.37"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="218,-19.25 159.25,-19.25 159.25,0 218,0 218,-19.25"/>
-<text text-anchor="middle" x="188.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.22,-20.2C122.77,-18.49 135.89,-16.69 147.69,-15.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.05,-18.56 157.48,-13.74 147.1,-11.63 148.05,-18.56"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a3d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph_org.svg b/d1/daa/random__pivot__quick__sort_8cpp_a3d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph_org.svg
deleted file mode 100644
index 66c03ebcf..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_a3d1c39e1ff42c04fb8ec0c0b9411cd3e_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::random_pivot_quick_sort::partition Pages: 1 -->
-<svg width="240pt" height="64pt"
- viewBox="0.00 0.00 239.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>sorting::random_pivot_quick_sort::partition</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A partition function which handles the partition logic of quick sort.">
-<polygon fill="#999999" stroke="#666666" points="109.75,-42.88 0,-42.88 0,-12.37 109.75,-12.37 109.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::random_pivot</text>
-<text text-anchor="middle" x="54.88" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_quick_sort::partition</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.5,-56.25 145.75,-56.25 145.75,-37 231.5,-37 231.5,-56.25"/>
-<text text-anchor="middle" x="188.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_tuple</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.22,-35.46C118.13,-36.6 126.26,-37.78 134.15,-38.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.58,-42.37 143.98,-40.33 134.58,-35.44 133.58,-42.37"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="218,-19.25 159.25,-19.25 159.25,0 218,0 218,-19.25"/>
-<text text-anchor="middle" x="188.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.22,-20.2C122.77,-18.49 135.89,-16.69 147.69,-15.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.05,-18.56 157.48,-13.74 147.1,-11.63 148.05,-18.56"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a40675d2eb960c71ca31ec475ba90120d_cgraph.map b/d1/daa/random__pivot__quick__sort_8cpp_a40675d2eb960c71ca31ec475ba90120d_cgraph.map
deleted file mode 100644
index ff7d60061..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_a40675d2eb960c71ca31ec475ba90120d_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="sorting::random_pivot_quick_sort::generateUnsortedArray" name="sorting::random_pivot_quick_sort::generateUnsortedArray">
-<area shape="rect" id="Node000001" title="A function utility to generate unsorted array of given size and range." alt="" coords="5,29,205,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="66,29,66,19,73,10,86,5,105,3,126,5,139,12,137,17,125,10,105,8,88,10,76,15,71,21,71,29"/>
-</map>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a40675d2eb960c71ca31ec475ba90120d_cgraph.md5 b/d1/daa/random__pivot__quick__sort_8cpp_a40675d2eb960c71ca31ec475ba90120d_cgraph.md5
deleted file mode 100644
index 5c3d89da8..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_a40675d2eb960c71ca31ec475ba90120d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-55d1f74f39366fb2822beb68202af297
\ No newline at end of file
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a40675d2eb960c71ca31ec475ba90120d_cgraph.svg b/d1/daa/random__pivot__quick__sort_8cpp_a40675d2eb960c71ca31ec475ba90120d_cgraph.svg
deleted file mode 100644
index 46bc9997a..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_a40675d2eb960c71ca31ec475ba90120d_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::random_pivot_quick_sort::generateUnsortedArray Pages: 1 -->
-<svg width="158pt" height="68pt"
- viewBox="0.00 0.00 157.50 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>sorting::random_pivot_quick_sort::generateUnsortedArray</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function utility to generate unsorted array of given size and range.">
-<polygon fill="#999999" stroke="#666666" points="149.5,-41.75 0,-41.75 0,0 149.5,0 149.5,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::random_pivot</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_quick_sort::generateUnsorted</text>
-<text text-anchor="middle" x="74.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Array</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47.16,-42.07C44.53,-51.55 53.73,-59.75 74.75,-59.75 86.9,-59.75 95.11,-57.01 99.36,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.65,-54.1 101.94,-43.53 95.9,-52.23 102.65,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a40675d2eb960c71ca31ec475ba90120d_cgraph_org.svg b/d1/daa/random__pivot__quick__sort_8cpp_a40675d2eb960c71ca31ec475ba90120d_cgraph_org.svg
deleted file mode 100644
index 593b2b518..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_a40675d2eb960c71ca31ec475ba90120d_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::random_pivot_quick_sort::generateUnsortedArray Pages: 1 -->
-<svg width="158pt" height="68pt"
- viewBox="0.00 0.00 157.50 67.75" 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 63.75)">
-<title>sorting::random_pivot_quick_sort::generateUnsortedArray</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function utility to generate unsorted array of given size and range.">
-<polygon fill="#999999" stroke="#666666" points="149.5,-41.75 0,-41.75 0,0 149.5,0 149.5,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::random_pivot</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_quick_sort::generateUnsorted</text>
-<text text-anchor="middle" x="74.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Array</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47.16,-42.07C44.53,-51.55 53.73,-59.75 74.75,-59.75 86.9,-59.75 95.11,-57.01 99.36,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.65,-54.1 101.94,-43.53 95.9,-52.23 102.65,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a7d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph.map b/d1/daa/random__pivot__quick__sort_8cpp_a7d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph.map
deleted file mode 100644
index d1bcd9700..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_a7d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="sorting::random_pivot_quick_sort::quickSortRP" name="sorting::random_pivot_quick_sort::quickSortRP">
-<area shape="rect" id="Node000001" title="Random pivot quick sort function. This function is the starting point of the algorithm." alt="" coords="5,112,176,153"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="47,112,45,102,52,93,67,87,91,85,115,88,130,94,128,99,114,93,90,91,68,93,55,97,50,103,52,111"/>
-<area shape="rect" id="Node000002" href="$d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5" title="Takes the start and end indices of an array and returns a random int64_teger between the range of tho..." alt="" coords="224,29,419,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="143,109,223,79,241,73,242,78,225,84,145,114"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="267,94,376,120"/>
-<area shape="poly" id="edge4_Node000001_Node000003" title=" " alt="" coords="176,120,251,112,252,117,176,126"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="282,144,360,169"/>
-<area shape="poly" id="edge5_Node000001_Node000004" title=" " alt="" coords="176,139,267,148,267,153,176,144"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/tuple/tie.html#" title=" " alt="" coords="291,193,352,218"/>
-<area shape="poly" id="edge6_Node000001_Node000005" title=" " alt="" coords="144,151,224,179,276,193,275,198,223,184,142,156"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="278,29,276,19,283,10,298,5,321,3,346,5,361,11,359,16,345,10,321,8,299,10,286,15,281,21,283,28"/>
-</map>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a7d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph.md5 b/d1/daa/random__pivot__quick__sort_8cpp_a7d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph.md5
deleted file mode 100644
index 3bf616b8f..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_a7d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f9c0f871e9e37ffe69cd5230dccc4ed0
\ No newline at end of file
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a7d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph.svg b/d1/daa/random__pivot__quick__sort_8cpp_a7d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph.svg
deleted file mode 100644
index 4c9bb3619..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_a7d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph.svg
+++ /dev/null
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::random_pivot_quick_sort::quickSortRP Pages: 1 -->
-<svg width="318pt" height="168pt"
- viewBox="0.00 0.00 318.25 167.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 163.88)">
-<title>sorting::random_pivot_quick_sort::quickSortRP</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Random pivot quick sort function. This function is the starting point of the algorithm.">
-<polygon fill="#999999" stroke="#666666" points="127.75,-79.88 0,-79.88 0,-49.38 127.75,-49.38 127.75,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::random_pivot</text>
-<text text-anchor="middle" x="63.88" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">_quick_sort::quickSortRP</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.2,-80.36C26.94,-89.43 37.16,-97.88 63.88,-97.88 78.48,-97.88 88.16,-95.35 92.91,-91.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.35,-92.26 94.33,-81.86 89.42,-91.24 96.35,-92.26"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5" target="_top" xlink:title="Takes the start and end indices of an array and returns a random int64_teger between the range of tho...">
-<polygon fill="white" stroke="#666666" points="310.25,-141.88 163.75,-141.88 163.75,-111.38 310.25,-111.38 310.25,-141.88"/>
-<text text-anchor="start" x="171.75" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::random_pivot</text>
-<text text-anchor="middle" x="237" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">_quick_sort::getRandomIndex</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.17,-80.21C122.25,-87.25 144.01,-95.56 163.75,-102.62 168.09,-104.18 172.59,-105.75 177.12,-107.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.68,-110.52 186.27,-110.44 177.93,-103.9 175.68,-110.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="277.62,-93.25 196.38,-93.25 196.38,-74 277.62,-74 277.62,-93.25"/>
-<text text-anchor="middle" x="237" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.11,-71.65C146.78,-73.72 166.97,-75.96 184.78,-77.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.27,-81.4 194.59,-79.03 185.04,-74.45 184.27,-81.4"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.38,-56.25 207.62,-56.25 207.62,-37 266.38,-37 266.38,-56.25"/>
-<text text-anchor="middle" x="237" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.11,-57.97C150.87,-55.58 175.9,-52.95 196.12,-50.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.33,-54.32 205.9,-49.79 195.59,-47.36 196.33,-54.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260,-19.25 214,-19.25 214,0 260,0 260,-19.25"/>
-<text text-anchor="middle" x="237" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::tie</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.5,-49.01C121.62,-41.98 143.62,-33.88 163.75,-27.62 176.29,-23.73 190.25,-20.09 202.53,-17.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="203.28,-20.54 212.21,-14.84 201.67,-13.73 203.28,-20.54"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M206.32,-142.36C200.06,-151.43 210.29,-159.88 237,-159.88 251.61,-159.88 261.29,-157.35 266.03,-153.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.47,-154.26 267.46,-143.86 262.54,-153.24 269.47,-154.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a7d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph_org.svg b/d1/daa/random__pivot__quick__sort_8cpp_a7d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph_org.svg
deleted file mode 100644
index 561703031..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_a7d2e7465e7b5d54c2de6d5e9db1ea6a5_cgraph_org.svg
+++ /dev/null
@@ -1,113 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::random_pivot_quick_sort::quickSortRP Pages: 1 -->
-<svg width="318pt" height="168pt"
- viewBox="0.00 0.00 318.25 167.88" 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 163.88)">
-<title>sorting::random_pivot_quick_sort::quickSortRP</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Random pivot quick sort function. This function is the starting point of the algorithm.">
-<polygon fill="#999999" stroke="#666666" points="127.75,-79.88 0,-79.88 0,-49.38 127.75,-49.38 127.75,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::random_pivot</text>
-<text text-anchor="middle" x="63.88" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">_quick_sort::quickSortRP</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.2,-80.36C26.94,-89.43 37.16,-97.88 63.88,-97.88 78.48,-97.88 88.16,-95.35 92.91,-91.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.35,-92.26 94.33,-81.86 89.42,-91.24 96.35,-92.26"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5" target="_top" xlink:title="Takes the start and end indices of an array and returns a random int64_teger between the range of tho...">
-<polygon fill="white" stroke="#666666" points="310.25,-141.88 163.75,-141.88 163.75,-111.38 310.25,-111.38 310.25,-141.88"/>
-<text text-anchor="start" x="171.75" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::random_pivot</text>
-<text text-anchor="middle" x="237" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">_quick_sort::getRandomIndex</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.17,-80.21C122.25,-87.25 144.01,-95.56 163.75,-102.62 168.09,-104.18 172.59,-105.75 177.12,-107.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.68,-110.52 186.27,-110.44 177.93,-103.9 175.68,-110.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="277.62,-93.25 196.38,-93.25 196.38,-74 277.62,-74 277.62,-93.25"/>
-<text text-anchor="middle" x="237" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.11,-71.65C146.78,-73.72 166.97,-75.96 184.78,-77.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.27,-81.4 194.59,-79.03 185.04,-74.45 184.27,-81.4"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.38,-56.25 207.62,-56.25 207.62,-37 266.38,-37 266.38,-56.25"/>
-<text text-anchor="middle" x="237" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.11,-57.97C150.87,-55.58 175.9,-52.95 196.12,-50.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.33,-54.32 205.9,-49.79 195.59,-47.36 196.33,-54.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260,-19.25 214,-19.25 214,0 260,0 260,-19.25"/>
-<text text-anchor="middle" x="237" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::tie</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.5,-49.01C121.62,-41.98 143.62,-33.88 163.75,-27.62 176.29,-23.73 190.25,-20.09 202.53,-17.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="203.28,-20.54 212.21,-14.84 201.67,-13.73 203.28,-20.54"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M206.32,-142.36C200.06,-151.43 210.29,-159.88 237,-159.88 251.61,-159.88 261.29,-157.35 266.03,-153.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.47,-154.26 267.46,-143.86 262.54,-153.24 269.47,-154.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index de38214d8..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,22 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,92,49,117"/>
-<area shape="rect" id="Node000002" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="97,92,239,117"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,102,81,102,81,107,49,107"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="652,92,723,117"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="182,89,226,55,255,38,286,26,375,6,412,3,447,4,518,20,605,50,633,64,659,80,656,85,631,68,603,55,517,25,446,10,412,8,375,11,288,31,257,43,229,60,185,93"/>
-<area shape="rect" id="Node000004" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="494,92,604,117"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="239,102,479,102,479,107,239,107"/>
-<area shape="rect" id="Node000005" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, printing inorder successor of last node." alt="" coords="287,41,446,67"/>
-<area shape="poly" id="edge5_Node000002_Node000005" title=" " alt="" coords="221,88,298,69,299,74,222,94"/>
-<area shape="rect" id="Node000006" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="287,142,446,168"/>
-<area shape="poly" id="edge8_Node000002_Node000006" title=" " alt="" coords="222,115,299,135,298,141,221,121"/>
-<area shape="rect" id="Node000007" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="287,192,446,217"/>
-<area shape="poly" id="edge11_Node000002_Node000007" title=" " alt="" coords="188,116,232,147,288,178,301,183,299,188,286,183,230,151,185,120"/>
-<area shape="poly" id="edge4_Node000004_Node000003" title=" " alt="" coords="604,102,636,102,636,107,604,107"/>
-<area shape="poly" id="edge6_Node000005_Node000003" title=" " alt="" coords="447,56,523,64,604,77,637,85,636,90,603,82,523,69,446,61"/>
-<area shape="poly" id="edge7_Node000005_Node000004" title=" " alt="" coords="416,65,486,84,485,90,415,70"/>
-<area shape="poly" id="edge9_Node000006_Node000003" title=" " alt="" coords="446,148,523,140,603,127,636,119,637,124,604,132,523,145,447,153"/>
-<area shape="poly" id="edge10_Node000006_Node000004" title=" " alt="" coords="415,139,485,119,486,125,416,144"/>
-<area shape="poly" id="edge12_Node000007_Node000003" title=" " alt="" coords="446,190,523,174,603,149,652,123,655,128,605,154,524,179,447,195"/>
-<area shape="poly" id="edge13_Node000007_Node000004" title=" " alt="" coords="420,189,445,178,486,153,520,126,524,130,489,157,448,183,422,194"/>
-</map>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 8a5e67e52..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d2c5c4cea9e9ad710f2e888f48c03542
\ No newline at end of file
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 8a6a74dbc..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,275 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<!--zoomable 167 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 546;
-var viewHeight = 167;
-var sectionId = 'dynsection-7';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-94.25 0,-94.25 0,-75 32.5,-75 32.5,-94.25"/>
-<text text-anchor="middle" x="16.25" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
-<polygon fill="white" stroke="#666666" points="175.25,-94.25 68.5,-94.25 68.5,-75 175.25,-75 175.25,-94.25"/>
-<text text-anchor="middle" x="121.88" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.99,-84.62C39.68,-84.62 47.96,-84.62 56.74,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.53,-88.13 66.53,-84.63 56.53,-81.13 56.53,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="538.25,-94.25 484.75,-94.25 484.75,-75 538.25,-75 538.25,-94.25"/>
-<text text-anchor="middle" x="511.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.81,-94.72C149.53,-108.47 180.08,-132.44 211.25,-141.62 312.8,-171.53 349.58,-160.65 448.75,-123.62 463.08,-118.27 477.62,-109.3 488.99,-101.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="490.85,-104.29 496.86,-95.56 486.72,-98.64 490.85,-104.29"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="448.75,-94.25 366.75,-94.25 366.75,-75 448.75,-75 448.75,-94.25"/>
-<text text-anchor="middle" x="407.75" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.6,-84.62C226.92,-84.62 304.41,-84.62 355.29,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.16,-88.13 365.16,-84.63 355.16,-81.13 355.16,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
-<polygon fill="white" stroke="#666666" points="330.75,-132.25 211.25,-132.25 211.25,-113 330.75,-113 330.75,-132.25"/>
-<text text-anchor="middle" x="271" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.92,-94.71C179.69,-99.3 200.95,-104.79 219.89,-109.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.01,-113.07 229.57,-112.18 220.76,-106.29 219.01,-113.07"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="330.75,-56.25 211.25,-56.25 211.25,-37 330.75,-37 330.75,-56.25"/>
-<text text-anchor="middle" x="271" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge8_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge8_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.92,-74.54C179.69,-69.95 200.95,-64.46 219.89,-59.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.76,-62.96 229.57,-57.07 219.01,-56.18 220.76,-62.96"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="330.75,-19.25 211.25,-19.25 211.25,0 330.75,0 330.75,-19.25"/>
-<text text-anchor="middle" x="271" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge11_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge11_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.98,-74.52C152.67,-62.04 182.77,-40.86 211.25,-27.62 214.34,-26.19 217.58,-24.83 220.88,-23.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.84,-26.92 230.08,-20.26 219.48,-20.33 221.84,-26.92"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M448.96,-84.62C456.86,-84.62 465.11,-84.62 472.91,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="472.8,-88.13 482.8,-84.63 472.8,-81.13 472.8,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge6_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge6_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.95,-119.12C365.52,-116.37 409.9,-111.61 448.75,-103.62 456.81,-101.97 465.33,-99.7 473.38,-97.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="474.39,-100.65 482.9,-94.34 472.31,-93.97 474.39,-100.65"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge7_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge7_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.76,-112.54C323.87,-108 343.11,-102.57 360.33,-97.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="361.16,-101.12 369.84,-95.03 359.26,-94.38 361.16,-101.12"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge9_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge9_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.95,-50.13C365.52,-52.88 409.9,-57.64 448.75,-65.62 456.81,-67.28 465.33,-69.55 473.38,-71.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="472.31,-75.28 482.9,-74.91 474.39,-68.6 472.31,-75.28"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge10_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge10_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.76,-56.71C323.87,-61.25 343.11,-66.68 360.33,-71.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="359.26,-74.87 369.84,-74.22 361.16,-68.13 359.26,-74.87"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge12_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge12_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.99,-18.51C365.97,-24.86 410.75,-34.93 448.75,-49.62 461.64,-54.61 475.09,-61.95 486.13,-68.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="484.26,-71.58 494.6,-73.9 487.97,-65.64 484.26,-71.58"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge13_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge13_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M311.61,-19.7C318.16,-21.94 324.76,-24.58 330.75,-27.62 351.73,-38.29 372.94,-54.79 387.61,-67.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="385.26,-69.88 395.09,-73.83 389.86,-64.62 385.26,-69.88"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index e339729cd..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,192 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="546pt" height="167pt"
- viewBox="0.00 0.00 546.25 167.01" 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 163.01)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-94.25 0,-94.25 0,-75 32.5,-75 32.5,-94.25"/>
-<text text-anchor="middle" x="16.25" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
-<polygon fill="white" stroke="#666666" points="175.25,-94.25 68.5,-94.25 68.5,-75 175.25,-75 175.25,-94.25"/>
-<text text-anchor="middle" x="121.88" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.99,-84.62C39.68,-84.62 47.96,-84.62 56.74,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.53,-88.13 66.53,-84.63 56.53,-81.13 56.53,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="538.25,-94.25 484.75,-94.25 484.75,-75 538.25,-75 538.25,-94.25"/>
-<text text-anchor="middle" x="511.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.81,-94.72C149.53,-108.47 180.08,-132.44 211.25,-141.62 312.8,-171.53 349.58,-160.65 448.75,-123.62 463.08,-118.27 477.62,-109.3 488.99,-101.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="490.85,-104.29 496.86,-95.56 486.72,-98.64 490.85,-104.29"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="448.75,-94.25 366.75,-94.25 366.75,-75 448.75,-75 448.75,-94.25"/>
-<text text-anchor="middle" x="407.75" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.6,-84.62C226.92,-84.62 304.41,-84.62 355.29,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.16,-88.13 365.16,-84.63 355.16,-81.13 355.16,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
-<polygon fill="white" stroke="#666666" points="330.75,-132.25 211.25,-132.25 211.25,-113 330.75,-113 330.75,-132.25"/>
-<text text-anchor="middle" x="271" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.92,-94.71C179.69,-99.3 200.95,-104.79 219.89,-109.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.01,-113.07 229.57,-112.18 220.76,-106.29 219.01,-113.07"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="330.75,-56.25 211.25,-56.25 211.25,-37 330.75,-37 330.75,-56.25"/>
-<text text-anchor="middle" x="271" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge8_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge8_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.92,-74.54C179.69,-69.95 200.95,-64.46 219.89,-59.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.76,-62.96 229.57,-57.07 219.01,-56.18 220.76,-62.96"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="330.75,-19.25 211.25,-19.25 211.25,0 330.75,0 330.75,-19.25"/>
-<text text-anchor="middle" x="271" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge11_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge11_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.98,-74.52C152.67,-62.04 182.77,-40.86 211.25,-27.62 214.34,-26.19 217.58,-24.83 220.88,-23.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.84,-26.92 230.08,-20.26 219.48,-20.33 221.84,-26.92"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M448.96,-84.62C456.86,-84.62 465.11,-84.62 472.91,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="472.8,-88.13 482.8,-84.63 472.8,-81.13 472.8,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge6_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge6_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.95,-119.12C365.52,-116.37 409.9,-111.61 448.75,-103.62 456.81,-101.97 465.33,-99.7 473.38,-97.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="474.39,-100.65 482.9,-94.34 472.31,-93.97 474.39,-100.65"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge7_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge7_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.76,-112.54C323.87,-108 343.11,-102.57 360.33,-97.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="361.16,-101.12 369.84,-95.03 359.26,-94.38 361.16,-101.12"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge9_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge9_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.95,-50.13C365.52,-52.88 409.9,-57.64 448.75,-65.62 456.81,-67.28 465.33,-69.55 473.38,-71.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="472.31,-75.28 482.9,-74.91 474.39,-68.6 472.31,-75.28"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge10_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge10_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.76,-56.71C323.87,-61.25 343.11,-66.68 360.33,-71.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="359.26,-74.87 369.84,-74.22 361.16,-68.13 359.26,-74.87"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge12_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge12_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.99,-18.51C365.97,-24.86 410.75,-34.93 448.75,-49.62 461.64,-54.61 475.09,-61.95 486.13,-68.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="484.26,-71.58 494.6,-73.9 487.97,-65.64 484.26,-71.58"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge13_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge13_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M311.61,-19.7C318.16,-21.94 324.76,-24.58 330.75,-27.62 351.73,-38.29 372.94,-54.79 387.61,-67.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="385.26,-69.88 395.09,-73.83 389.86,-64.62 385.26,-69.88"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_aac5657b4fe2251cd21073f44233f6ea5_cgraph.map b/d1/daa/random__pivot__quick__sort_8cpp_aac5657b4fe2251cd21073f44233f6ea5_cgraph.map
deleted file mode 100644
index 4bea15666..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_aac5657b4fe2251cd21073f44233f6ea5_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="sorting::random_pivot_quick_sort::getRandomIndex" name="sorting::random_pivot_quick_sort::getRandomIndex">
-<area shape="rect" id="Node000001" title="Takes the start and end indices of an array and returns a random int64_teger between the range of tho..." alt="" coords="5,29,201,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="66,29,64,19,70,10,83,5,103,3,124,5,137,11,135,16,123,10,103,8,85,10,73,15,69,20,71,28"/>
-</map>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_aac5657b4fe2251cd21073f44233f6ea5_cgraph.md5 b/d1/daa/random__pivot__quick__sort_8cpp_aac5657b4fe2251cd21073f44233f6ea5_cgraph.md5
deleted file mode 100644
index 966d29e65..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_aac5657b4fe2251cd21073f44233f6ea5_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-67b3323df28113cbd63092c51ba41a53
\ No newline at end of file
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_aac5657b4fe2251cd21073f44233f6ea5_cgraph.svg b/d1/daa/random__pivot__quick__sort_8cpp_aac5657b4fe2251cd21073f44233f6ea5_cgraph.svg
deleted file mode 100644
index 4304e653c..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_aac5657b4fe2251cd21073f44233f6ea5_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::random_pivot_quick_sort::getRandomIndex Pages: 1 -->
-<svg width="155pt" height="57pt"
- viewBox="0.00 0.00 154.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>sorting::random_pivot_quick_sort::getRandomIndex</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Takes the start and end indices of an array and returns a random int64_teger between the range of tho...">
-<polygon fill="#999999" stroke="#666666" points="146.5,-30.5 0,-30.5 0,0 146.5,0 146.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::random_pivot</text>
-<text text-anchor="middle" x="73.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_quick_sort::getRandomIndex</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47.29,-30.99C41.99,-40.06 50.65,-48.5 73.25,-48.5 85.61,-48.5 93.8,-45.97 97.82,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.27,-42.84 99.02,-32.49 94.32,-41.98 101.27,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_aac5657b4fe2251cd21073f44233f6ea5_cgraph_org.svg b/d1/daa/random__pivot__quick__sort_8cpp_aac5657b4fe2251cd21073f44233f6ea5_cgraph_org.svg
deleted file mode 100644
index 3b4ab5a23..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_aac5657b4fe2251cd21073f44233f6ea5_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::random_pivot_quick_sort::getRandomIndex Pages: 1 -->
-<svg width="155pt" height="57pt"
- viewBox="0.00 0.00 154.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>sorting::random_pivot_quick_sort::getRandomIndex</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Takes the start and end indices of an array and returns a random int64_teger between the range of tho...">
-<polygon fill="#999999" stroke="#666666" points="146.5,-30.5 0,-30.5 0,0 146.5,0 146.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::random_pivot</text>
-<text text-anchor="middle" x="73.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_quick_sort::getRandomIndex</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47.29,-30.99C41.99,-40.06 50.65,-48.5 73.25,-48.5 85.61,-48.5 93.8,-45.97 97.82,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.27,-42.84 99.02,-32.49 94.32,-41.98 101.27,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_ac3281dc34a9cfd7beb332419b8a0aa10_cgraph.map b/d1/daa/random__pivot__quick__sort_8cpp_ac3281dc34a9cfd7beb332419b8a0aa10_cgraph.map
deleted file mode 100644
index ed1a86eac..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_ac3281dc34a9cfd7beb332419b8a0aa10_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="sorting::random_pivot_quick_sort::showArray" name="sorting::random_pivot_quick_sort::showArray">
-<area shape="rect" id="Node000001" title="Utility function to print the array." alt="" coords="5,29,164,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="50,29,48,19,54,10,66,5,85,3,104,5,116,11,114,16,103,10,84,8,67,10,57,14,53,20,55,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="230,12,302,37"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="164,36,214,29,215,34,165,41"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="212,61,320,86"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="165,58,197,62,196,67,164,63"/>
-</map>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_ac3281dc34a9cfd7beb332419b8a0aa10_cgraph.md5 b/d1/daa/random__pivot__quick__sort_8cpp_ac3281dc34a9cfd7beb332419b8a0aa10_cgraph.md5
deleted file mode 100644
index 2deb8c045..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_ac3281dc34a9cfd7beb332419b8a0aa10_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ee14619c159a34a1b9271c7062848321
\ No newline at end of file
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_ac3281dc34a9cfd7beb332419b8a0aa10_cgraph.svg b/d1/daa/random__pivot__quick__sort_8cpp_ac3281dc34a9cfd7beb332419b8a0aa10_cgraph.svg
deleted file mode 100644
index 057fcf0f3..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_ac3281dc34a9cfd7beb332419b8a0aa10_cgraph.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::random_pivot_quick_sort::showArray Pages: 1 -->
-<svg width="244pt" height="69pt"
- viewBox="0.00 0.00 244.00 68.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64.88)">
-<title>sorting::random_pivot_quick_sort::showArray</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to print the array.">
-<polygon fill="#999999" stroke="#666666" points="118.75,-42.88 0,-42.88 0,-12.37 118.75,-12.37 118.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::random_pivot</text>
-<text text-anchor="middle" x="59.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_quick_sort::showArray</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.28,-43.36C30.36,-52.43 38.39,-60.88 59.38,-60.88 70.85,-60.88 78.45,-58.35 82.18,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.63,-55.2 83.3,-44.86 78.68,-54.4 85.63,-55.2"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222.12,-56.25 168.62,-56.25 168.62,-37 222.12,-37 222.12,-56.25"/>
-<text text-anchor="middle" x="195.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.15,-35.96C132.02,-37.78 145.3,-39.67 157.05,-41.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.33,-44.77 166.72,-42.7 157.31,-37.84 156.33,-44.77"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236,-19.25 154.75,-19.25 154.75,0 236,0 236,-19.25"/>
-<text text-anchor="middle" x="195.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.15,-19.73C127.18,-18.65 135.37,-17.55 143.25,-16.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.58,-19.98 153.02,-15.18 142.65,-13.04 143.58,-19.98"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_ac3281dc34a9cfd7beb332419b8a0aa10_cgraph_org.svg b/d1/daa/random__pivot__quick__sort_8cpp_ac3281dc34a9cfd7beb332419b8a0aa10_cgraph_org.svg
deleted file mode 100644
index 309352bf6..000000000
--- a/d1/daa/random__pivot__quick__sort_8cpp_ac3281dc34a9cfd7beb332419b8a0aa10_cgraph_org.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::random_pivot_quick_sort::showArray Pages: 1 -->
-<svg width="244pt" height="69pt"
- viewBox="0.00 0.00 244.00 68.88" 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 64.88)">
-<title>sorting::random_pivot_quick_sort::showArray</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to print the array.">
-<polygon fill="#999999" stroke="#666666" points="118.75,-42.88 0,-42.88 0,-12.37 118.75,-12.37 118.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::random_pivot</text>
-<text text-anchor="middle" x="59.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_quick_sort::showArray</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.28,-43.36C30.36,-52.43 38.39,-60.88 59.38,-60.88 70.85,-60.88 78.45,-58.35 82.18,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.63,-55.2 83.3,-44.86 78.68,-54.4 85.63,-55.2"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222.12,-56.25 168.62,-56.25 168.62,-37 222.12,-37 222.12,-56.25"/>
-<text text-anchor="middle" x="195.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.15,-35.96C132.02,-37.78 145.3,-39.67 157.05,-41.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.33,-44.77 166.72,-42.7 157.31,-37.84 156.33,-44.77"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236,-19.25 154.75,-19.25 154.75,0 236,0 236,-19.25"/>
-<text text-anchor="middle" x="195.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.15,-19.73C127.18,-18.65 135.37,-17.55 143.25,-16.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.58,-19.98 153.02,-15.18 142.65,-13.04 143.58,-19.98"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_source.html b/d1/daa/random__pivot__quick__sort_8cpp_source.html
new file mode 100644
index 000000000..4ea6d9c04
--- /dev/null
+++ b/d1/daa/random__pivot__quick__sort_8cpp_source.html
@@ -0,0 +1,388 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/random_pivot_quick_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/daa/random__pivot__quick__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">random_pivot_quick_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d1/daa/random__pivot__quick__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="preprocessor">#include &lt;array&gt;</span>      </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="preprocessor">#include &lt;ctime&gt;</span>      </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="preprocessor">#include &lt;tuple&gt;</span>      </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../de/d6b/namespacerandom__pivot__quick__sort.html">random_pivot_quick_sort</a> {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> T&gt;</div>
+<div class="foldopen" id="foldopen00073" data-start="{" data-end="}">
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"><a class="line" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10">   73</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10">showArray</a>(std::array&lt;int64_t, T&gt; arr) {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keywordflow">for</span> (int64_t i = 0; i &lt; arr.size(); i++) {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    }</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>}</div>
+</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="foldopen" id="foldopen00088" data-start="{" data-end="}">
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"><a class="line" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5">   88</a></span>int64_t <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5">getRandomIndex</a>(int64_t start, int64_t end) {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    srand(time(<span class="keyword">nullptr</span>));  <span class="comment">// Initialize random number generator.</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    int64_t randomPivotIndex = start + rand() % (end - start + 1);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordflow">return</span> randomPivotIndex;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>}</div>
+</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> size&gt;</div>
+<div class="foldopen" id="foldopen00103" data-start="{" data-end="}">
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"><a class="line" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a3d1c39e1ff42c04fb8ec0c0b9411cd3e">  103</a></span>std::tuple&lt;int64_t, std::array&lt;int64_t, size&gt;&gt; partition(</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::array&lt;int64_t, size&gt; arr, int64_t start, int64_t end) {</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    int64_t pivot = arr[end];  <span class="comment">// Randomly selected element will be here from</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>                               <span class="comment">// caller function (quickSortRP()).</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    int64_t pInd = start;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="keywordflow">for</span> (int64_t i = start; i &lt; end; i++) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        <span class="keywordflow">if</span> (arr[i] &lt;= pivot) {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>            std::swap(arr[i], arr[pInd]);  <span class="comment">// swapping the elements from current</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>                                           <span class="comment">// index to pInd.</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>            pInd++;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        }</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    }</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::swap(arr[pInd],</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>              arr[end]);  <span class="comment">// swapping the pivot element to its sorted position</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <span class="keywordflow">return</span> std::make_tuple(pInd, arr);</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>}</div>
+</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> size&gt;</div>
+<div class="foldopen" id="foldopen00130" data-start="{" data-end="}">
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"><a class="line" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">  130</a></span>std::array&lt;int64_t, size&gt; <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">quickSortRP</a>(std::array&lt;int64_t, size&gt; arr,</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>                                      int64_t start, int64_t end) {</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="keywordflow">if</span> (start &lt; end) {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        int64_t randomIndex = <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5">getRandomIndex</a>(start, end);</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>        <span class="comment">// switching the pivot with right most bound.</span></div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        std::swap(arr[end], arr[randomIndex]);</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span> </div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>        int64_t pivotIndex = 0;</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>        <span class="comment">// getting pivot index and pivot sorted array.</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        std::tie(pivotIndex, arr) = partition(arr, start, end);</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        <span class="comment">// Recursively calling</span></div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        std::array&lt;int64_t, arr.size()&gt; rightSortingLeft =</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>            <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">quickSortRP</a>(arr, start, pivotIndex - 1);</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        std::array&lt;int64_t, arr.size()&gt; full_sorted =</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>            <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">quickSortRP</a>(rightSortingLeft, pivotIndex + 1, end);</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        arr = full_sorted;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    }</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    <span class="keywordflow">return</span> arr;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>}</div>
+</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> size&gt;</div>
+<div class="foldopen" id="foldopen00160" data-start="{" data-end="}">
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"><a class="line" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a40675d2eb960c71ca31ec475ba90120d">  160</a></span>std::array&lt;int64_t, size&gt; <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a40675d2eb960c71ca31ec475ba90120d">generateUnsortedArray</a>(int64_t from, int64_t to) {</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    srand(time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    std::array&lt;int64_t, size&gt; unsortedArray{};</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    assert(from &lt; to);</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    int64_t i = 0;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    <span class="keywordflow">while</span> (i &lt; size) {</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        int64_t randomNum = from + rand() % (to - from + 1);</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>        <span class="keywordflow">if</span> (randomNum) {</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>            unsortedArray[i] = randomNum;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>            i++;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        }</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    }</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <span class="keywordflow">return</span> unsortedArray;</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>}</div>
+</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span> </div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>}  <span class="comment">// namespace random_pivot_quick_sort</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span> </div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span><span class="keyword">class </span><a class="code hl_class" href="../../d5/d58/class_test_cases.html">TestCases</a> {</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00189" data-start="{" data-end="}">
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"><a class="line" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">  189</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(T msg) {</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>        <span class="comment">// It&#39;s just to avoid writing cout and endl</span></div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;[TESTS] : ---&gt; &quot;</span> &lt;&lt; msg &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    }</div>
+</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span> </div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00199" data-start="{" data-end="}">
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"><a class="line" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">  199</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a>() {</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running Tests...&quot;</span>);</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span> </div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>();</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>();</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>();</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span> </div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Test Cases over!&quot;</span>);</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    }</div>
+</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span> </div>
+<div class="foldopen" id="foldopen00214" data-start="{" data-end="}">
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"><a class="line" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">  214</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>() {</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>        <span class="keyword">const</span> int64_t inputSize = 1;</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>            <span class="stringliteral">&quot;~&quot;</span>);</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 1 for Random Pivot Quick Sort Algorithm : &quot;</span>);</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;   EDGE CASE : Only contains one element&quot;</span>);</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>        std::array&lt;int64_t, inputSize&gt; unsorted_arr{2};</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span> </div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>        int64_t start = 0;</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>        int64_t end = unsorted_arr.size() - 1;  <span class="comment">// length - 1</span></div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span> </div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running algorithm of data of length 50 ...&quot;</span>);</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>        std::array&lt;int64_t, unsorted_arr.size()&gt; sorted_arr =</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>            sorting::random_pivot_quick_sort::quickSortRP(unsorted_arr, start,</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>                                                          end);</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Algorithm finished!&quot;</span>);</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span> </div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>        assert(std::is_sorted(sorted_arr.begin(), sorted_arr.end()));</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span> </div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 1 PASS!&quot;</span>);</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>            <span class="stringliteral">&quot;~&quot;</span>);</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    }</div>
+</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span> </div>
+<div class="foldopen" id="foldopen00245" data-start="{" data-end="}">
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"><a class="line" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">  245</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>() {</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>        <span class="keyword">const</span> int64_t inputSize = 500;</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>            <span class="stringliteral">&quot;~&quot;</span>);</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;   BIG INPUT : Contains 500 elements and repeated elements&quot;</span>);</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 2 for Random Pivot Quick Sort Algorithm : &quot;</span>);</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>        std::array&lt;int64_t, inputSize&gt; unsorted_arr =</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>            sorting::random_pivot_quick_sort::generateUnsortedArray&lt;inputSize&gt;(</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>                1, 10000);</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span> </div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>        int64_t start = 0;</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>        int64_t end = unsorted_arr.size() - 1;  <span class="comment">// length - 1</span></div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span> </div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running algorithm of data of length 500 ...&quot;</span>);</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>        std::array&lt;int64_t, unsorted_arr.size()&gt; sorted_arr =</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>            sorting::random_pivot_quick_sort::quickSortRP(unsorted_arr, start,</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>                                                          end);</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Algorithm finished!&quot;</span>);</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span> </div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>        assert(std::is_sorted(sorted_arr.begin(), sorted_arr.end()));</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span> </div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 2 PASS!&quot;</span>);</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>            <span class="stringliteral">&quot;~&quot;</span>);</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    }</div>
+</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span> </div>
+<div class="foldopen" id="foldopen00278" data-start="{" data-end="}">
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"><a class="line" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">  278</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>() {</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>        <span class="keyword">const</span> int64_t inputSize = 1000;</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>            <span class="stringliteral">&quot;~&quot;</span>);</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 3 for Random Pivot Quick Sort Algorithm : &quot;</span>);</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;   LARGE INPUT : Contains 1000 elements and repeated elements&quot;</span>);</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>        std::array&lt;int64_t, inputSize&gt; unsorted_arr =</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>            sorting::random_pivot_quick_sort::generateUnsortedArray&lt;inputSize&gt;(</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>                1, 10000);</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span> </div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>        int64_t start = 0;</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>        int64_t end = unsorted_arr.size() - 1;  <span class="comment">// length - 1</span></div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span> </div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running algorithm...&quot;</span>);</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>        std::array&lt;int64_t, unsorted_arr.size()&gt; sorted_arr =</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>            sorting::random_pivot_quick_sort::quickSortRP(unsorted_arr, start,</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>                                                          end);</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Algorithm finished!&quot;</span>);</div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span> </div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>        assert(std::is_sorted(sorted_arr.begin(), sorted_arr.end()));</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span> </div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 3 PASS!&quot;</span>);</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>            <span class="stringliteral">&quot;~&quot;</span>);</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>    }</div>
+</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>};</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span> </div>
+<div class="foldopen" id="foldopen00312" data-start="{" data-end="}">
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"><a class="line" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  312</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>    <a class="code hl_class" href="../../d5/d58/class_test_cases.html">TestCases</a> tc = <a class="code hl_class" href="../../d5/d58/class_test_cases.html">TestCases</a>();</div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>    tc.<a class="code hl_function" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a>();</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>}</div>
+</div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span> </div>
+<div class="foldopen" id="foldopen00323" data-start="{" data-end="}">
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"><a class="line" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">  323</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[]) {</div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>    <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Executes various test cases.</span></div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span> </div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>    <span class="keyword">const</span> int64_t inputSize = 10;</div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>    std::array&lt;int64_t, inputSize&gt; unsorted_array =</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>        sorting::random_pivot_quick_sort::generateUnsortedArray&lt;inputSize&gt;(</div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>            50, 1000);</div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Unsorted array is : &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>    sorting::random_pivot_quick_sort::showArray(unsorted_array);</div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span> </div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>    std::array&lt;int64_t, inputSize&gt; sorted_array =</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>        sorting::random_pivot_quick_sort::quickSortRP(</div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>            unsorted_array, 0, unsorted_array.size() - 1);</div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted array is : &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>    sorting::random_pivot_quick_sort::showArray(sorted_array);</div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>}</div>
+</div>
+<div class="ttc" id="aclass_test_cases_html"><div class="ttname"><a href="../../d5/d58/class_test_cases.html">TestCases</a></div><div class="ttdoc">class encapsulating the necessary test cases</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00225">inorder_successor_of_bst.cpp:225</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_aa3aa3d5bf666f327ee8e2d11d397b06e"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">TestCases::log</a></div><div class="ttdeci">void log(T msg)</div><div class="ttdoc">A function to print64_t given message on console.</div><div class="ttdef"><b>Definition</b> <a href="#l00189">random_pivot_quick_sort.cpp:189</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_abae0148985f159b582a385cf399254e3"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">TestCases::testCase_2</a></div><div class="ttdeci">void testCase_2()</div><div class="ttdoc">A test case which contains main list of 100 elements and sublist of 20.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00304">inorder_successor_of_bst.cpp:304</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_ac2636e8b5b9e053374c45bfcf0603008"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">TestCases::testCase_1</a></div><div class="ttdeci">void testCase_1()</div><div class="ttdoc">A test case contains edge case, printing inorder successor of last node.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00259">inorder_successor_of_bst.cpp:259</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_ad9f95c09931625b41e3be1f88d1e28c5"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">TestCases::testCase_3</a></div><div class="ttdeci">void testCase_3()</div><div class="ttdoc">A test case which contains main list of 50 elements and sublist of 20.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00345">inorder_successor_of_bst.cpp:345</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_aeabea90c02f9159e4a784bbf736e1e23"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">TestCases::runTests</a></div><div class="ttdeci">void runTests()</div><div class="ttdoc">Executes test cases.</div><div class="ttdef"><b>Definition</b> <a href="#l00199">random_pivot_quick_sort.cpp:199</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacerandom__pivot__quick__sort_html"><div class="ttname"><a href="../../de/d6b/namespacerandom__pivot__quick__sort.html">random_pivot_quick_sort</a></div><div class="ttdoc">Functions for the Random Pivot Quick Sort implementation.</div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+<div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_a40675d2eb960c71ca31ec475ba90120d"><div class="ttname"><a href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a40675d2eb960c71ca31ec475ba90120d">sorting::random_pivot_quick_sort::generateUnsortedArray</a></div><div class="ttdeci">std::array&lt; int64_t, size &gt; generateUnsortedArray(int64_t from, int64_t to)</div><div class="ttdoc">A function utility to generate unsorted array of given size and range.</div><div class="ttdef"><b>Definition</b> <a href="#l00160">random_pivot_quick_sort.cpp:160</a></div></div>
+<div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_a7d2e7465e7b5d54c2de6d5e9db1ea6a5"><div class="ttname"><a href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a></div><div class="ttdeci">std::array&lt; int64_t, size &gt; quickSortRP(std::array&lt; int64_t, size &gt; arr, int64_t start, int64_t end)</div><div class="ttdoc">Random pivot quick sort function. This function is the starting point of the algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00130">random_pivot_quick_sort.cpp:130</a></div></div>
+<div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d1/daa/random__pivot__quick__sort_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> <a href="#l00312">random_pivot_quick_sort.cpp:312</a></div></div>
+<div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_aac5657b4fe2251cd21073f44233f6ea5"><div class="ttname"><a href="../../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5">sorting::random_pivot_quick_sort::getRandomIndex</a></div><div class="ttdeci">int64_t getRandomIndex(int64_t start, int64_t end)</div><div class="ttdoc">Takes the start and end indices of an array and returns a random int64_teger between the range of tho...</div><div class="ttdef"><b>Definition</b> <a href="#l00088">random_pivot_quick_sort.cpp:88</a></div></div>
+<div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_ac3281dc34a9cfd7beb332419b8a0aa10"><div class="ttname"><a href="../../d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10">sorting::random_pivot_quick_sort::showArray</a></div><div class="ttdeci">void showArray(std::array&lt; int64_t, T &gt; arr)</div><div class="ttdoc">Utility function to print the array.</div><div class="ttdef"><b>Definition</b> <a href="#l00073">random_pivot_quick_sort.cpp:73</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp.html">random_pivot_quick_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.map b/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.map
index d7dd79417..c595e3dc4 100644
--- a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.map
+++ b/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.map
@@ -1,5 +1,5 @@
 <map id="std::is_integral&lt; uint128_t &gt;" name="std::is_integral&lt; uint128_t &gt;">
 <area shape="rect" id="Node000001" title=" " alt="" coords="5,79,189,105"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integral_constant.html" title=" " alt="" coords="46,5,148,31"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="46,5,148,31"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="100,46,100,79,94,79,94,46"/>
 </map>
diff --git a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.md5 b/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.md5
index 02d792f20..10a023df0 100644
--- a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.md5
+++ b/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.md5
@@ -1 +1 @@
-ae61aae73f537f6171eb63e089015b91
\ No newline at end of file
+d8e72a5cac00bd09a7e428aa97dcd5b4
\ No newline at end of file
diff --git a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.svg b/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.svg
index e8bf7b111..a60440e80 100644
--- a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.svg
+++ b/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="106.75,-74.5 30.75,-74.5 30.75,-55.25 106.75,-55.25 106.75,-74.5"/>
 <text text-anchor="middle" x="68.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph_org.svg b/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph_org.svg
index b0db0f467..ad39e9932 100644
--- a/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph_org.svg
+++ b/d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="106.75,-74.5 30.75,-74.5 30.75,-55.25 106.75,-55.25 106.75,-74.5"/>
 <text text-anchor="middle" x="68.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/d1/db3/structcompare.html b/d1/db3/structcompare.html
index 60eb7fcc9..db975cfd1 100644
--- a/d1/db3/structcompare.html
+++ b/d1/db3/structcompare.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: compare Struct Reference</title>
+<title>TheAlgorithms/C++: compare Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -116,7 +133,10 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:a05e9f9b75efa6583b2367710185094c7" id="r_a05e9f9b75efa6583b2367710185094c7"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a05e9f9b75efa6583b2367710185094c7">operator()</a> (const <a class="el" href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a> *const l, const <a class="el" href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a> *const r) const</td></tr>
 <tr class="separator:a05e9f9b75efa6583b2367710185094c7"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
-<h2 class="groupheader">Member Function Documentation</h2>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../d5/d8e/huffman_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../d5/d8e/huffman_8cpp_source.html">huffman.cpp</a>.</p>
+</div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="a05e9f9b75efa6583b2367710185094c7" name="a05e9f9b75efa6583b2367710185094c7"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a05e9f9b75efa6583b2367710185094c7">&#9670;&#160;</a></span>operator()()</h2>
 
@@ -143,15 +163,17 @@ Public Member Functions</h2></td></tr>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d8e/huffman_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../d5/d8e/huffman_8cpp_source.html">huffman.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   38</span>                                                      {</div>
 <div class="line"><span class="lineno">   39</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>-&gt;freq &gt; r-&gt;freq;</div>
 <div class="line"><span class="lineno">   40</span>    }</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:119</div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00119">composite_simpson_rule.cpp:119</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>greedy_algorithms/<b>huffman.cpp</b></li>
+<li>greedy_algorithms/<a class="el" href="../../d5/d8e/huffman_8cpp_source.html">huffman.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d1/db6/namespaceknight__tour.html b/d1/db6/namespaceknight__tour.html
index 04e9cc7a7..c141e62ed 100644
--- a/d1/db6/namespaceknight__tour.html
+++ b/d1/db6/namespaceknight__tour.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: knight_tour Namespace Reference</title>
+<title>TheAlgorithms/C++: knight_tour Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.map b/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.map
index 4a8ad8eb9..146baa9a2 100644
--- a/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.map
+++ b/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.map
@@ -1,13 +1,11 @@
 <map id="others::Cache::LRUCache&lt; K, V &gt;" name="others::Cache::LRUCache&lt; K, V &gt;">
-<area shape="rect" id="Node000001" title="LRUCache." alt="" coords="637,68,814,109"/>
+<area shape="rect" id="Node000001" title="LRUCache." alt="" coords="637,30,814,71"/>
 <area shape="rect" id="Node000002" href="$de/d21/classothers_1_1_cache_1_1_d___node.html" title=" " alt="" coords="121,11,280,52"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="295,29,361,31,444,36,526,46,637,66,637,72,525,51,443,42,361,37,295,34"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map.html" title=" " alt="" coords="385,61,525,117"/>
-<area shape="poly" id="edge6_Node000005_Node000002" title=" " alt="" coords="296,50,385,70,384,76,295,55"/>
-<area shape="rect" id="Node000003" title=" " alt="" coords="5,57,44,83"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="58,60,120,46,121,52,59,65"/>
-<area shape="poly" id="edge5_Node000005_Node000003" title=" " alt="" coords="60,71,121,76,385,85,385,90,121,81,59,76"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="409,141,502,167"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="516,137,638,107,639,112,517,142"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="541,86,637,86,637,91,541,91"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="295,30,361,32,637,43,637,49,361,37,295,36"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="385,61,525,117"/>
+<area shape="poly" id="edge5_Node000004_Node000002" title=" " alt="" coords="296,50,385,71,384,76,295,56"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="5,58,44,83"/>
+<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="58,61,120,47,121,52,59,66"/>
+<area shape="poly" id="edge4_Node000004_Node000003" title=" " alt="" coords="60,71,121,76,385,85,385,91,121,81,59,77"/>
+<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="541,74,637,60,637,66,541,80"/>
 </map>
diff --git a/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.md5 b/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.md5
index 572d4f653..d5121c79c 100644
--- a/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.md5
+++ b/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.md5
@@ -1 +1 @@
-000048512d2af21496e0d3a3054ece76
\ No newline at end of file
+8400c3ebfcfef8437a8888c2d74d787e
\ No newline at end of file
diff --git a/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.svg b/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.svg
index 0a6584801..57282b24d 100644
--- a/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.svg
+++ b/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.svg
@@ -4,7 +4,7 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: others::Cache::LRUCache&lt; K, V &gt; Pages: 1 -->
-<!--zoomable 129 -->
+<!--zoomable 92 -->
 
 <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)">
 
@@ -48,7 +48,7 @@
 </defs>
 <script type="application/ecmascript">
 var viewWidth = 614;
-var viewHeight = 129;
+var viewHeight = 92;
 var sectionId = 'dynsection-0';
 </script>
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
@@ -59,9 +59,9 @@ var sectionId = 'dynsection-0';
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="LRUCache.">
-<polygon fill="#999999" stroke="#666666" points="606.3,-73.88 474.05,-73.88 474.05,-43.38 606.3,-43.38 606.3,-73.88"/>
-<text text-anchor="start" x="482.05" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="540.17" y="-49.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, V &gt;</text>
+<polygon fill="#999999" stroke="#666666" points="606.3,-65.12 474.05,-65.12 474.05,-34.62 606.3,-34.62 606.3,-65.12"/>
+<text text-anchor="start" x="482.05" y="-51.62" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
+<text text-anchor="middle" x="540.17" y="-40.38" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, V &gt;</text>
 </a>
 </g>
 </g>
@@ -69,9 +69,9 @@ var sectionId = 'dynsection-0';
 <g id="Node000002" class="node">
 <title>Node2</title>
 <g id="a_Node000002"><a xlink:href="../../de/d21/classothers_1_1_cache_1_1_d___node.html" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="206.05,-116.88 86.55,-116.88 86.55,-86.38 206.05,-86.38 206.05,-116.88"/>
-<text text-anchor="start" x="94.55" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::D_Node</text>
-<text text-anchor="middle" x="146.3" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, V &gt;</text>
+<polygon fill="white" stroke="#666666" points="206.05,-79.12 86.55,-79.12 86.55,-48.62 206.05,-48.62 206.05,-79.12"/>
+<text text-anchor="start" x="94.55" y="-65.62" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::D_Node</text>
+<text text-anchor="middle" x="146.3" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, V &gt;</text>
 </a>
 </g>
 </g>
@@ -79,40 +79,40 @@ var sectionId = 'dynsection-0';
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M217.35,-101.3C233.59,-100.99 250.81,-100.47 266.8,-99.62 321.72,-96.72 335.62,-96.5 390.05,-88.62 417.62,-84.63 447.8,-78.84 473.74,-73.4"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="217.74,-97.79 207.8,-101.46 217.86,-104.79 217.74,-97.79"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M217.33,-63.02C233.57,-62.74 250.79,-62.36 266.8,-61.88 337.53,-59.73 418.54,-55.99 473.7,-53.26"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="217.72,-59.52 207.78,-63.18 217.84,-66.51 217.72,-59.52"/>
 </a>
 </g>
-<text text-anchor="middle" x="337.42" y="-111.66" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> head</text>
-<text text-anchor="middle" x="337.42" y="-100.41" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">tail</text>
+<text text-anchor="middle" x="337.42" y="-74.22" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> head</text>
+<text text-anchor="middle" x="337.42" y="-62.97" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">tail</text>
 </g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="390.05,-79.5 284.8,-79.5 284.8,-37.75 390.05,-37.75 390.05,-79.5"/>
-<text text-anchor="start" x="292.8" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="start" x="292.8" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, others::Cache::</text>
-<text text-anchor="middle" x="337.42" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">D_Node&lt; K, V &gt; * &gt;</text>
+<!-- Node4 -->
+<g id="Node000004" class="node">
+<title>Node4</title>
+<g id="a_Node000004"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="390.05,-41.75 284.8,-41.75 284.8,0 390.05,0 390.05,-41.75"/>
+<text text-anchor="start" x="292.8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
+<text text-anchor="start" x="292.8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, others::Cache::</text>
+<text text-anchor="middle" x="337.42" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">D_Node&lt; K, V &gt; * &gt;</text>
 </a>
 </g>
 </g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000002" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M217.44,-85.68C239.66,-80.63 263.82,-75.13 284.52,-70.43"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="216.81,-82.23 207.84,-87.86 218.37,-89.06 216.81,-82.23"/>
+<!-- Node2&#45;&gt;Node4 -->
+<g id="edge5_Node000004_Node000002" class="edge">
+<title>Node2&#45;&gt;Node4</title>
+<g id="a_edge5_Node000004_Node000002"><a xlink:title=" ">
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M217.44,-47.93C239.66,-42.88 263.82,-37.38 284.52,-32.68"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="216.81,-44.48 207.84,-50.11 218.37,-51.31 216.81,-44.48"/>
 </a>
 </g>
-<text text-anchor="middle" x="245.42" y="-85.73" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="245.42" y="-47.98" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
 <g id="a_Node000003"><a xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="28.8,-82.25 0,-82.25 0,-63 28.8,-63 28.8,-82.25"/>
-<text text-anchor="middle" x="14.4" y="-68.75" font-family="Helvetica,sans-Serif" font-size="10.00">K</text>
+<polygon fill="white" stroke="#bfbfbf" points="28.8,-44.5 0,-44.5 0,-25.25 28.8,-25.25 28.8,-44.5"/>
+<text text-anchor="middle" x="14.4" y="-31" font-family="Helvetica,sans-Serif" font-size="10.00">K</text>
 </a>
 </g>
 </g>
@@ -120,50 +120,31 @@ var sectionId = 'dynsection-0';
 <g id="edge2_Node000002_Node000003" class="edge">
 <title>Node3&#45;&gt;Node2</title>
 <g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M39.77,-78.07C52.98,-81.01 69.92,-84.8 86.34,-88.46"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="40.81,-74.71 30.29,-75.95 39.29,-81.54 40.81,-74.71"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M39.77,-40.32C52.98,-43.26 69.92,-47.05 86.34,-50.71"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="40.81,-36.96 30.29,-38.2 39.29,-43.79 40.81,-36.96"/>
 </a>
 </g>
-<text text-anchor="middle" x="57.67" y="-85.42" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
+<text text-anchor="middle" x="57.67" y="-47.67" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
 </g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000003" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M40.64,-70.06C54.23,-68.76 71.29,-67.28 86.55,-66.38 155,-62.31 234.14,-60.31 284.7,-59.38"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="40.41,-66.56 30.8,-71.02 41.09,-73.53 40.41,-66.56"/>
-</a>
-</g>
-<text text-anchor="middle" x="146.3" y="-68.12" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> keys</text>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="372.42,-19.25 302.42,-19.25 302.42,0 372.42,0 372.42,-19.25"/>
-<text text-anchor="middle" x="337.42" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint32_t</text>
+<!-- Node3&#45;&gt;Node4 -->
+<g id="edge4_Node000004_Node000003" class="edge">
+<title>Node3&#45;&gt;Node4</title>
+<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M40.64,-32.31C54.23,-31.01 71.29,-29.53 86.55,-28.62 155,-24.56 234.14,-22.56 284.7,-21.63"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="40.41,-28.81 30.8,-33.27 41.09,-35.78 40.41,-28.81"/>
 </a>
 </g>
+<text text-anchor="middle" x="146.3" y="-30.38" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> keys</text>
 </g>
 <!-- Node4&#45;&gt;Node1 -->
 <g id="edge3_Node000001_Node000004" class="edge">
 <title>Node4&#45;&gt;Node1</title>
 <g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M383.51,-20.63C410.45,-27.2 445.1,-35.66 474.87,-42.93"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="384.49,-17.27 373.95,-18.3 382.83,-24.07 384.49,-17.27"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M401.73,-30.02C424.68,-33.33 450.63,-37.08 473.76,-40.43"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="402.28,-26.56 391.88,-28.6 401.28,-33.49 402.28,-26.56"/>
 </a>
 </g>
-<text text-anchor="middle" x="432.05" y="-38.81" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> _capacity</text>
-</g>
-<!-- Node5&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node5&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M401.73,-58.62C424.68,-58.62 450.63,-58.62 473.76,-58.62"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="401.9,-55.13 391.9,-58.63 401.9,-62.13 401.9,-55.13"/>
-</a>
-</g>
-<text text-anchor="middle" x="432.05" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> node_map</text>
+<text text-anchor="middle" x="432.05" y="-38.86" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> node_map</text>
 </g>
 </g>
 </svg>
diff --git a/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph_org.svg b/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph_org.svg
index b244c724d..ba4d2e1fb 100644
--- a/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph_org.svg
+++ b/d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph_org.svg
@@ -4,17 +4,17 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: others::Cache::LRUCache&lt; K, V &gt; Pages: 1 -->
-<svg width="614pt" height="129pt"
- viewBox="0.00 0.00 614.30 129.16" 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 125.16)">
+<svg width="614pt" height="92pt"
+ viewBox="0.00 0.00 614.30 91.72" 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 87.72)">
 <title>others::Cache::LRUCache&lt; K, V &gt;</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="LRUCache.">
-<polygon fill="#999999" stroke="#666666" points="606.3,-73.88 474.05,-73.88 474.05,-43.38 606.3,-43.38 606.3,-73.88"/>
-<text text-anchor="start" x="482.05" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="540.17" y="-49.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, V &gt;</text>
+<polygon fill="#999999" stroke="#666666" points="606.3,-65.12 474.05,-65.12 474.05,-34.62 606.3,-34.62 606.3,-65.12"/>
+<text text-anchor="start" x="482.05" y="-51.62" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
+<text text-anchor="middle" x="540.17" y="-40.38" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, V &gt;</text>
 </a>
 </g>
 </g>
@@ -22,9 +22,9 @@
 <g id="Node000002" class="node">
 <title>Node2</title>
 <g id="a_Node000002"><a xlink:href="../../de/d21/classothers_1_1_cache_1_1_d___node.html" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="206.05,-116.88 86.55,-116.88 86.55,-86.38 206.05,-86.38 206.05,-116.88"/>
-<text text-anchor="start" x="94.55" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::D_Node</text>
-<text text-anchor="middle" x="146.3" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, V &gt;</text>
+<polygon fill="white" stroke="#666666" points="206.05,-79.12 86.55,-79.12 86.55,-48.62 206.05,-48.62 206.05,-79.12"/>
+<text text-anchor="start" x="94.55" y="-65.62" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::D_Node</text>
+<text text-anchor="middle" x="146.3" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, V &gt;</text>
 </a>
 </g>
 </g>
@@ -32,40 +32,40 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M217.35,-101.3C233.59,-100.99 250.81,-100.47 266.8,-99.62 321.72,-96.72 335.62,-96.5 390.05,-88.62 417.62,-84.63 447.8,-78.84 473.74,-73.4"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="217.74,-97.79 207.8,-101.46 217.86,-104.79 217.74,-97.79"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M217.33,-63.02C233.57,-62.74 250.79,-62.36 266.8,-61.88 337.53,-59.73 418.54,-55.99 473.7,-53.26"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="217.72,-59.52 207.78,-63.18 217.84,-66.51 217.72,-59.52"/>
 </a>
 </g>
-<text text-anchor="middle" x="337.42" y="-111.66" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> head</text>
-<text text-anchor="middle" x="337.42" y="-100.41" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">tail</text>
+<text text-anchor="middle" x="337.42" y="-74.22" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> head</text>
+<text text-anchor="middle" x="337.42" y="-62.97" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">tail</text>
 </g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="390.05,-79.5 284.8,-79.5 284.8,-37.75 390.05,-37.75 390.05,-79.5"/>
-<text text-anchor="start" x="292.8" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="start" x="292.8" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, others::Cache::</text>
-<text text-anchor="middle" x="337.42" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">D_Node&lt; K, V &gt; * &gt;</text>
+<!-- Node4 -->
+<g id="Node000004" class="node">
+<title>Node4</title>
+<g id="a_Node000004"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="390.05,-41.75 284.8,-41.75 284.8,0 390.05,0 390.05,-41.75"/>
+<text text-anchor="start" x="292.8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
+<text text-anchor="start" x="292.8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, others::Cache::</text>
+<text text-anchor="middle" x="337.42" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">D_Node&lt; K, V &gt; * &gt;</text>
 </a>
 </g>
 </g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000002" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M217.44,-85.68C239.66,-80.63 263.82,-75.13 284.52,-70.43"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="216.81,-82.23 207.84,-87.86 218.37,-89.06 216.81,-82.23"/>
+<!-- Node2&#45;&gt;Node4 -->
+<g id="edge5_Node000004_Node000002" class="edge">
+<title>Node2&#45;&gt;Node4</title>
+<g id="a_edge5_Node000004_Node000002"><a xlink:title=" ">
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M217.44,-47.93C239.66,-42.88 263.82,-37.38 284.52,-32.68"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="216.81,-44.48 207.84,-50.11 218.37,-51.31 216.81,-44.48"/>
 </a>
 </g>
-<text text-anchor="middle" x="245.42" y="-85.73" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="245.42" y="-47.98" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
 <g id="a_Node000003"><a xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="28.8,-82.25 0,-82.25 0,-63 28.8,-63 28.8,-82.25"/>
-<text text-anchor="middle" x="14.4" y="-68.75" font-family="Helvetica,sans-Serif" font-size="10.00">K</text>
+<polygon fill="white" stroke="#bfbfbf" points="28.8,-44.5 0,-44.5 0,-25.25 28.8,-25.25 28.8,-44.5"/>
+<text text-anchor="middle" x="14.4" y="-31" font-family="Helvetica,sans-Serif" font-size="10.00">K</text>
 </a>
 </g>
 </g>
@@ -73,50 +73,31 @@
 <g id="edge2_Node000002_Node000003" class="edge">
 <title>Node3&#45;&gt;Node2</title>
 <g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M39.77,-78.07C52.98,-81.01 69.92,-84.8 86.34,-88.46"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="40.81,-74.71 30.29,-75.95 39.29,-81.54 40.81,-74.71"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M39.77,-40.32C52.98,-43.26 69.92,-47.05 86.34,-50.71"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="40.81,-36.96 30.29,-38.2 39.29,-43.79 40.81,-36.96"/>
 </a>
 </g>
-<text text-anchor="middle" x="57.67" y="-85.42" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
+<text text-anchor="middle" x="57.67" y="-47.67" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
 </g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000003" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M40.64,-70.06C54.23,-68.76 71.29,-67.28 86.55,-66.38 155,-62.31 234.14,-60.31 284.7,-59.38"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="40.41,-66.56 30.8,-71.02 41.09,-73.53 40.41,-66.56"/>
-</a>
-</g>
-<text text-anchor="middle" x="146.3" y="-68.12" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> keys</text>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="372.42,-19.25 302.42,-19.25 302.42,0 372.42,0 372.42,-19.25"/>
-<text text-anchor="middle" x="337.42" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint32_t</text>
+<!-- Node3&#45;&gt;Node4 -->
+<g id="edge4_Node000004_Node000003" class="edge">
+<title>Node3&#45;&gt;Node4</title>
+<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M40.64,-32.31C54.23,-31.01 71.29,-29.53 86.55,-28.62 155,-24.56 234.14,-22.56 284.7,-21.63"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="40.41,-28.81 30.8,-33.27 41.09,-35.78 40.41,-28.81"/>
 </a>
 </g>
+<text text-anchor="middle" x="146.3" y="-30.38" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> keys</text>
 </g>
 <!-- Node4&#45;&gt;Node1 -->
 <g id="edge3_Node000001_Node000004" class="edge">
 <title>Node4&#45;&gt;Node1</title>
 <g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M383.51,-20.63C410.45,-27.2 445.1,-35.66 474.87,-42.93"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="384.49,-17.27 373.95,-18.3 382.83,-24.07 384.49,-17.27"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M401.73,-30.02C424.68,-33.33 450.63,-37.08 473.76,-40.43"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="402.28,-26.56 391.88,-28.6 401.28,-33.49 402.28,-26.56"/>
 </a>
 </g>
-<text text-anchor="middle" x="432.05" y="-38.81" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> _capacity</text>
-</g>
-<!-- Node5&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node5&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M401.73,-58.62C424.68,-58.62 450.63,-58.62 473.76,-58.62"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="401.9,-55.13 391.9,-58.63 401.9,-62.13 401.9,-55.13"/>
-</a>
-</g>
-<text text-anchor="middle" x="432.05" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> node_map</text>
+<text text-anchor="middle" x="432.05" y="-38.86" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> node_map</text>
 </g>
 </g>
 </svg>
diff --git a/d1/dbb/n__choose__r_8cpp.html b/d1/dbb/n__choose__r_8cpp.html
index 845cd5e1b..8e88d41c3 100644
--- a/d1/dbb/n__choose__r_8cpp.html
+++ b/d1/dbb/n__choose__r_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/n_choose_r.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/n_choose_r.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for n_choose_r.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/df6/n__choose__r_8cpp__incl.svg" width="255" height="111"><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">
+</div>
+<p><a href="../../d1/dbb/n__choose__r_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -145,6 +164,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Combination" target="_blank">Combinations</a> n choose r function implementation </p>
 <p>A very basic and efficient method of calculating choosing r from n different choices. \( \binom{n}{r} = \frac{n!}{r! (n-r)!} \)</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/tjgurwara99" target="_blank">Tajmeet Singh</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d1/dbb/n__choose__r_8cpp_source.html">n_choose_r.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">&#9670;&#160;</a></span>main()</h2>
@@ -174,17 +195,14 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dbb/n__choose__r_8cpp_source.html#l00080">80</a> of file <a class="el" href="../../d1/dbb/n__choose__r_8cpp_source.html">n_choose_r.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   80</span>                                 {</div>
 <div class="line"><span class="lineno">   81</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// executing tests</span></div>
 <div class="line"><span class="lineno">   82</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   83</span>}</div>
-<div class="ttc" id="an__choose__r_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> n_choose_r.cpp:52</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="326" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="an__choose__r_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbb/n__choose__r_8cpp_source.html#l00052">n_choose_r.cpp:52</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -212,36 +230,31 @@ Here is the call graph for this function:</div>
 
 <p>Test implementations. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dbb/n__choose__r_8cpp_source.html#l00052">52</a> of file <a class="el" href="../../d1/dbb/n__choose__r_8cpp_source.html">n_choose_r.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   52</span>                   {</div>
 <div class="line"><span class="lineno">   53</span>    <span class="comment">// First test on 5 choose 2</span></div>
 <div class="line"><span class="lineno">   54</span>    uint8_t t = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a>(5, 2);</div>
 <div class="line"><span class="lineno">   55</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;10 is the answer but function says otherwise.\n&quot;</span>, t == 10));</div>
-<div class="line"><span class="lineno">   56</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;First test passes.&quot;</span> &lt;&lt; <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">   56</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;First test passes.&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   57</span>    <span class="comment">// Second test on 5 choose 3</span></div>
 <div class="line"><span class="lineno">   58</span>    t = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a>(5, 3);</div>
 <div class="line"><span class="lineno">   59</span>    assert(</div>
 <div class="line"><span class="lineno">   60</span>        ((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;10 is the answer but the function says otherwise.\n&quot;</span>, t == 10));</div>
-<div class="line"><span class="lineno">   61</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Second test passes.&quot;</span> &lt;&lt; <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">   61</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Second test passes.&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   62</span>    <span class="comment">// Third test on 3 choose 2</span></div>
 <div class="line"><span class="lineno">   63</span>    t = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a>(3, 2);</div>
 <div class="line"><span class="lineno">   64</span>    assert(</div>
 <div class="line"><span class="lineno">   65</span>        ((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;3 is the answer but the function says otherwise.\n&quot;</span>, t == 3));</div>
-<div class="line"><span class="lineno">   66</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Third test passes.&quot;</span> &lt;&lt; <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">   66</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Third test passes.&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   67</span>    <span class="comment">// Fourth test on 10 choose 4</span></div>
 <div class="line"><span class="lineno">   68</span>    t = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a>(10, 4);</div>
 <div class="line"><span class="lineno">   69</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;210 is the answer but the function says otherwise.\n&quot;</span>,</div>
 <div class="line"><span class="lineno">   70</span>            t == 210));</div>
-<div class="line"><span class="lineno">   71</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Fourth test passes.&quot;</span> &lt;&lt; <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">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Fourth test passes.&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   72</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="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="anamespacemath_html_a6e2dff75c5de70455b90c799d6ad6967"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a></div><div class="ttdeci">T n_choose_r(T n, T r)</div><div class="ttdoc">This is the function implementation of .</div><div class="ttdef"><b>Definition</b> n_choose_r.cpp:35</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="228" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemath_html_a6e2dff75c5de70455b90c799d6ad6967"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a></div><div class="ttdeci">T n_choose_r(T n, T r)</div><div class="ttdoc">This is the function implementation of .</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbb/n__choose__r_8cpp_source.html#l00035">n_choose_r.cpp:35</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
deleted file mode 100644
index d2ab0da18..000000000
--- a/d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Test implementations." alt="" coords="103,31,146,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,41,87,41,87,46,55,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="221,5,292,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,37,205,25,206,30,147,42"/>
-<area shape="rect" id="Node000004" href="$dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967" title="This is the function implementation of ." alt="" coords="194,55,319,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="147,45,179,51,178,56,146,50"/>
-</map>
diff --git a/d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
deleted file mode 100644
index 410ee9a43..000000000
--- a/d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-209f034b4aadc915057253b2509e935f
\ No newline at end of file
diff --git a/d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
deleted file mode 100644
index 091029b8c..000000000
--- a/d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="244pt" height="64pt"
- viewBox="0.00 0.00 243.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.25,-56.25 161.75,-56.25 161.75,-37 215.25,-37 215.25,-56.25"/>
-<text text-anchor="middle" x="188.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.87,-30.68C117.89,-33.02 134.98,-36.36 150.43,-39.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.32,-42.73 159.8,-41.21 150.66,-35.86 149.32,-42.73"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967" target="_top" xlink:title="This is the function implementation of .">
-<polygon fill="white" stroke="#666666" points="235.5,-19.25 141.5,-19.25 141.5,0 235.5,0 235.5,-19.25"/>
-<text text-anchor="middle" x="188.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::n_choose_r</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.87,-24.73C112.67,-23.48 121.09,-21.92 129.93,-20.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.55,-23.72 139.75,-18.46 129.28,-16.84 130.55,-23.72"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
deleted file mode 100644
index 6da044ec0..000000000
--- a/d1/dbb/n__choose__r_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="244pt" height="64pt"
- viewBox="0.00 0.00 243.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.25,-56.25 161.75,-56.25 161.75,-37 215.25,-37 215.25,-56.25"/>
-<text text-anchor="middle" x="188.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.87,-30.68C117.89,-33.02 134.98,-36.36 150.43,-39.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.32,-42.73 159.8,-41.21 150.66,-35.86 149.32,-42.73"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967" target="_top" xlink:title="This is the function implementation of .">
-<polygon fill="white" stroke="#666666" points="235.5,-19.25 141.5,-19.25 141.5,0 235.5,0 235.5,-19.25"/>
-<text text-anchor="middle" x="188.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::n_choose_r</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.87,-24.73C112.67,-23.48 121.09,-21.92 129.93,-20.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.55,-23.72 139.75,-18.46 129.28,-16.84 130.55,-23.72"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index ef10d4374..000000000
--- a/d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Test implementations." alt="" coords="5,31,49,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="124,5,195,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,37,108,25,109,30,50,42"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967" title="This is the function implementation of ." alt="" coords="97,55,222,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="50,45,82,51,81,56,49,50"/>
-</map>
diff --git a/d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index eb5bbc85f..000000000
--- a/d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-97e38f159c278de26b88bfebbdb40210
\ No newline at end of file
diff --git a/d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 8510d0fe3..000000000
--- a/d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="171pt" height="64pt"
- viewBox="0.00 0.00 170.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="142.25,-56.25 88.75,-56.25 88.75,-37 142.25,-37 142.25,-56.25"/>
-<text text-anchor="middle" x="115.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.87,-30.68C44.89,-33.02 61.98,-36.36 77.43,-39.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.32,-42.73 86.8,-41.21 77.66,-35.86 76.32,-42.73"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967" target="_top" xlink:title="This is the function implementation of .">
-<polygon fill="white" stroke="#666666" points="162.5,-19.25 68.5,-19.25 68.5,0 162.5,0 162.5,-19.25"/>
-<text text-anchor="middle" x="115.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::n_choose_r</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.87,-24.73C39.67,-23.48 48.09,-21.92 56.93,-20.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.55,-23.72 66.75,-18.46 56.28,-16.84 57.55,-23.72"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 934133509..000000000
--- a/d1/dbb/n__choose__r_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="171pt" height="64pt"
- viewBox="0.00 0.00 170.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="142.25,-56.25 88.75,-56.25 88.75,-37 142.25,-37 142.25,-56.25"/>
-<text text-anchor="middle" x="115.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.87,-30.68C44.89,-33.02 61.98,-36.36 77.43,-39.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.32,-42.73 86.8,-41.21 77.66,-35.86 76.32,-42.73"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967" target="_top" xlink:title="This is the function implementation of .">
-<polygon fill="white" stroke="#666666" points="162.5,-19.25 68.5,-19.25 68.5,0 162.5,0 162.5,-19.25"/>
-<text text-anchor="middle" x="115.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::n_choose_r</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.87,-24.73C39.67,-23.48 48.09,-21.92 56.93,-20.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.55,-23.72 66.75,-18.46 56.28,-16.84 57.55,-23.72"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/dbb/n__choose__r_8cpp_source.html b/d1/dbb/n__choose__r_8cpp_source.html
new file mode 100644
index 000000000..d7017f4ee
--- /dev/null
+++ b/d1/dbb/n__choose__r_8cpp_source.html
@@ -0,0 +1,192 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/n_choose_r.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/dbb/n__choose__r_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">n_choose_r.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d1/dbb/n__choose__r_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
+<div class="foldopen" id="foldopen00035" data-start="{" data-end="}">
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">   35</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">n_choose_r</a>(T n, T r) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">if</span> (r &gt; n / 2) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        r = n - r;  <span class="comment">// Because of the fact that  nCr(n, r) == nCr(n, n - r)</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    }</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    T ans = 1;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= r; i++) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        ans *= n - r + i;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        ans /= i;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">return</span> ans;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>}</div>
+</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="foldopen" id="foldopen00052" data-start="{" data-end="}">
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   52</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="comment">// First test on 5 choose 2</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    uint8_t t = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a>(5, 2);</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;10 is the answer but function says otherwise.\n&quot;</span>, t == 10));</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;First test passes.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="comment">// Second test on 5 choose 3</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    t = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a>(5, 3);</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    assert(</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        ((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;10 is the answer but the function says otherwise.\n&quot;</span>, t == 10));</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Second test passes.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="comment">// Third test on 3 choose 2</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    t = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a>(3, 2);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    assert(</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        ((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;3 is the answer but the function says otherwise.\n&quot;</span>, t == 3));</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Third test passes.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="comment">// Fourth test on 10 choose 4</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    t = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a>(10, 4);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;210 is the answer but the function says otherwise.\n&quot;</span>,</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            t == 210));</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Fourth test passes.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>}</div>
+</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="foldopen" id="foldopen00080" data-start="{" data-end="}">
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="../../d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">   80</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[]) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <a class="code hl_function" href="../../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// executing tests</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>}</div>
+</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="an__choose__r_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d1/dbb/n__choose__r_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> <a href="#l00052">n_choose_r.cpp:52</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_a6e2dff75c5de70455b90c799d6ad6967"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a></div><div class="ttdeci">T n_choose_r(T n, T r)</div><div class="ttdoc">This is the function implementation of .</div><div class="ttdef"><b>Definition</b> <a href="#l00035">n_choose_r.cpp:35</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d1/dbb/n__choose__r_8cpp.html">n_choose_r.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/dbe/lu__decomposition_8h.html b/d1/dbe/lu__decomposition_8h.html
index 8f51f4bbf..4f76c722d 100644
--- a/d1/dbe/lu__decomposition_8h.html
+++ b/d1/dbe/lu__decomposition_8h.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/lu_decomposition.h File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/lu_decomposition.h File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -132,7 +149,7 @@ This graph shows which files directly or indirectly include this file:</div>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="typedef-members" name="typedef-members"></a>
 Typedefs</h2></td></tr>
 <tr class="memitem:ac029b636b353cefbb18b2fcc71e427e4" id="r_ac029b636b353cefbb18b2fcc71e427e4"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ac029b636b353cefbb18b2fcc71e427e4"><td class="memTemplItemLeft" align="right" valign="top">using&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac029b636b353cefbb18b2fcc71e427e4">matrix</a> = <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt;T&gt;&gt;</td></tr>
+<tr class="memitem:ac029b636b353cefbb18b2fcc71e427e4"><td class="memTemplItemLeft" align="right" valign="top">using&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac029b636b353cefbb18b2fcc71e427e4">matrix</a> = std::vector&lt;std::valarray&lt;T&gt;&gt;</td></tr>
 <tr class="separator:ac029b636b353cefbb18b2fcc71e427e4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
@@ -147,6 +164,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Functions associated with <a href="https://en.wikipedia.org/wiki/LU_decomposition" target="_blank">LU Decomposition</a> of a square matrix. </p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d1/dbe/lu__decomposition_8h_source.html">lu_decomposition.h</a>.</p>
 </div><h2 class="groupheader">Typedef Documentation</h2>
 <a id="ac029b636b353cefbb18b2fcc71e427e4" name="ac029b636b353cefbb18b2fcc71e427e4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ac029b636b353cefbb18b2fcc71e427e4">&#9670;&#160;</a></span>matrix</h2>
@@ -157,11 +176,13 @@ Functions</h2></td></tr>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname">using <a class="el" href="#ac029b636b353cefbb18b2fcc71e427e4">matrix</a> = <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt;T&gt;&gt;</td>
+          <td class="memname">using <a class="el" href="#ac029b636b353cefbb18b2fcc71e427e4">matrix</a> = std::vector&lt;std::valarray&lt;T&gt;&gt;</td>
         </tr>
       </table>
 </div><div class="memdoc">
-<p>Define matrix type as a <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></code> of <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></code> </p>
+<p>Define matrix type as a <code>std::vector</code> of <code>std::valarray</code> </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dbe/lu__decomposition_8h_source.html#l00019">19</a> of file <a class="el" href="../../d1/dbe/lu__decomposition_8h_source.html">lu_decomposition.h</a>.</p>
 
 </div>
 </div>
@@ -196,30 +217,25 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>determinant of matrix A </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dbe/lu__decomposition_8h_source.html#l00090">90</a> of file <a class="el" href="../../d1/dbe/lu__decomposition_8h_source.html">lu_decomposition.h</a>.</p>
 <div class="fragment"><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">matrix&lt;double&gt;</a> L(A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(), <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(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">   92</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;double&gt;</a> U(A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(), <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(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">   91</span>    <a class="code hl_typedef" href="#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;double&gt;</a> L(A.size(), std::valarray&lt;double&gt;(A.size()));</div>
+<div class="line"><span class="lineno">   92</span>    <a class="code hl_typedef" href="#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;double&gt;</a> U(A.size(), std::valarray&lt;double&gt;(A.size()));</div>
 <div class="line"><span class="lineno">   93</span> </div>
 <div class="line"><span class="lineno">   94</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="#a75b8a228c6419ecda6077255d6d60509">lu_decomposition</a>(A, &amp;L, &amp;U) &lt; 0)</div>
 <div class="line"><span class="lineno">   95</span>        <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   96</span> </div>
 <div class="line"><span class="lineno">   97</span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = 1.f;</div>
-<div class="line"><span class="lineno">   98</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
+<div class="line"><span class="lineno">   98</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.size(); i++) {</div>
 <div class="line"><span class="lineno">   99</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> *= L[i][i] * U[i][i];</div>
 <div class="line"><span class="lineno">  100</span>    }</div>
 <div class="line"><span class="lineno">  101</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  102</span>}</div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-<div class="ttc" id="alu__decomposition_8h_html_a75b8a228c6419ecda6077255d6d60509"><div class="ttname"><a href="#a75b8a228c6419ecda6077255d6d60509">lu_decomposition</a></div><div class="ttdeci">int lu_decomposition(const matrix&lt; T &gt; &amp;A, matrix&lt; double &gt; *L, matrix&lt; double &gt; *U)</div><div class="ttdef"><b>Definition</b> lu_decomposition.h:29</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="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.svg" width="451" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+<div class="ttc" id="alu__decomposition_8h_html_a75b8a228c6419ecda6077255d6d60509"><div class="ttname"><a href="#a75b8a228c6419ecda6077255d6d60509">lu_decomposition</a></div><div class="ttdeci">int lu_decomposition(const matrix&lt; T &gt; &amp;A, matrix&lt; double &gt; *L, matrix&lt; double &gt; *U)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbe/lu__decomposition_8h_source.html#l00029">lu_decomposition.h:29</a></div></div>
+<div class="ttc" id="alu__decomposition_8h_html_ac029b636b353cefbb18b2fcc71e427e4"><div class="ttname"><a href="#ac029b636b353cefbb18b2fcc71e427e4">matrix</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; matrix</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbe/lu__decomposition_8h_source.html#l00019">lu_decomposition.h:19</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a75b8a228c6419ecda6077255d6d60509" name="a75b8a228c6419ecda6077255d6d60509"></a>
@@ -258,13 +274,15 @@ template&lt;typename T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>0 if no errors </dd>
 <dd>
 negative if error occurred </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dbe/lu__decomposition_8h_source.html#l00029">29</a> of file <a class="el" href="../../d1/dbe/lu__decomposition_8h_source.html">lu_decomposition.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   29</span>                                                                               {</div>
 <div class="line"><span class="lineno">   30</span>    <span class="keywordtype">int</span> row, col, j;</div>
-<div class="line"><span class="lineno">   31</span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> = 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">   31</span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> = A.size();</div>
 <div class="line"><span class="lineno">   32</span> </div>
 <div class="line"><span class="lineno">   33</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> != A[0].size()) {</div>
 <div class="line"><span class="lineno">   34</span>        <span class="comment">// check matrix is a square matrix</span></div>
-<div class="line"><span class="lineno">   35</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Not a square matrix!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   35</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Not a square matrix!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   36</span>        <span class="keywordflow">return</span> -1;</div>
 <div class="line"><span class="lineno">   37</span>    }</div>
 <div class="line"><span class="lineno">   38</span> </div>
@@ -308,14 +326,8 @@ negative if error occurred </dd></dl>
 <div class="line"><span class="lineno">   76</span> </div>
 <div class="line"><span class="lineno">   77</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   78</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::cerr</a></div></div>
-<div class="ttc" id="amatrix__exponentiation_8cpp_html_a9977ad12548c4a49dee9dc3f0685aa54"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a></div><div class="ttdeci">ll mat_size</div><div class="ttdef"><b>Definition</b> matrix_exponentiation.cpp:45</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.svg" width="296" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a9977ad12548c4a49dee9dc3f0685aa54"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a></div><div class="ttdeci">ll mat_size</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00045">matrix_exponentiation.cpp:45</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.map b/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.map
deleted file mode 100644
index a63a2954f..000000000
--- a/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="determinant_lu" name="determinant_lu">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,112,56"/>
-<area shape="rect" id="Node000002" href="$d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" title=" " alt="" coords="160,5,282,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="112,33,144,27,145,33,113,38"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="330,31,445,56"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="112,41,314,41,314,46,112,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="283,25,315,30,314,35,282,30"/>
-</map>
diff --git a/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.md5 b/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.md5
deleted file mode 100644
index 2194eb25e..000000000
--- a/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ad518d85881ee45c1b3a451bc3a03849
\ No newline at end of file
diff --git a/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.svg b/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.svg
deleted file mode 100644
index 708356837..000000000
--- a/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: determinant_lu Pages: 1 -->
-<svg width="338pt" height="46pt"
- viewBox="0.00 0.00 338.00 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>determinant_lu</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="79.75,-19.25 0,-19.25 0,0 79.75,0 79.75,-19.25"/>
-<text text-anchor="middle" x="39.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">determinant_lu</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="207.5,-38.25 115.75,-38.25 115.75,-19 207.5,-19 207.5,-38.25"/>
-<text text-anchor="middle" x="161.62" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.09,-15.85C87.87,-17.08 96.19,-18.4 104.41,-19.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.59,-23.12 114.01,-21.23 104.68,-16.21 103.59,-23.12"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="330,-19.25 243.5,-19.25 243.5,0 330,0 330,-19.25"/>
-<text text-anchor="middle" x="286.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.22,-9.62C121.26,-9.62 185.89,-9.62 231.7,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.7,-13.13 241.7,-9.63 231.7,-6.13 231.7,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.77,-21.66C215.61,-20.45 223.83,-19.18 231.87,-17.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.22,-21.43 241.57,-16.44 231.15,-14.51 232.22,-21.43"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph_org.svg b/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph_org.svg
deleted file mode 100644
index 843ce78b8..000000000
--- a/d1/dbe/lu__decomposition_8h_a3108d43bd32c6fb3b3c158476c51ba7f_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: determinant_lu Pages: 1 -->
-<svg width="338pt" height="46pt"
- viewBox="0.00 0.00 338.00 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>determinant_lu</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="79.75,-19.25 0,-19.25 0,0 79.75,0 79.75,-19.25"/>
-<text text-anchor="middle" x="39.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">determinant_lu</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="207.5,-38.25 115.75,-38.25 115.75,-19 207.5,-19 207.5,-38.25"/>
-<text text-anchor="middle" x="161.62" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.09,-15.85C87.87,-17.08 96.19,-18.4 104.41,-19.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.59,-23.12 114.01,-21.23 104.68,-16.21 103.59,-23.12"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="330,-19.25 243.5,-19.25 243.5,0 330,0 330,-19.25"/>
-<text text-anchor="middle" x="286.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.22,-9.62C121.26,-9.62 185.89,-9.62 231.7,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.7,-13.13 241.7,-9.63 231.7,-6.13 231.7,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.77,-21.66C215.61,-20.45 223.83,-19.18 231.87,-17.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.22,-21.43 241.57,-16.44 231.15,-14.51 232.22,-21.43"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.map b/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.map
deleted file mode 100644
index 82af792ad..000000000
--- a/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="lu_decomposition" name="lu_decomposition">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,128,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="176,5,291,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="128,16,160,16,160,21,128,21"/>
-</map>
diff --git a/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.md5 b/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.md5
deleted file mode 100644
index 042f8a3e8..000000000
--- a/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6fc82c91e775927765540fabc37368cd
\ No newline at end of file
diff --git a/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.svg b/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.svg
deleted file mode 100644
index 68e8971fe..000000000
--- a/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: lu_decomposition Pages: 1 -->
-<svg width="222pt" height="27pt"
- viewBox="0.00 0.00 222.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>lu_decomposition</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="91.75,-19.25 0,-19.25 0,0 91.75,0 91.75,-19.25"/>
-<text text-anchor="middle" x="45.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.25,-19.25 127.75,-19.25 127.75,0 214.25,0 214.25,-19.25"/>
-<text text-anchor="middle" x="171" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.02,-9.62C99.77,-9.62 107.89,-9.62 115.84,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.8,-13.13 125.8,-9.63 115.8,-6.13 115.8,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph_org.svg b/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph_org.svg
deleted file mode 100644
index 9b1f5b80d..000000000
--- a/d1/dbe/lu__decomposition_8h_a75b8a228c6419ecda6077255d6d60509_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: lu_decomposition Pages: 1 -->
-<svg width="222pt" height="27pt"
- viewBox="0.00 0.00 222.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>lu_decomposition</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="91.75,-19.25 0,-19.25 0,0 91.75,0 91.75,-19.25"/>
-<text text-anchor="middle" x="45.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.25,-19.25 127.75,-19.25 127.75,0 214.25,0 214.25,-19.25"/>
-<text text-anchor="middle" x="171" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.02,-9.62C99.77,-9.62 107.89,-9.62 115.84,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.8,-13.13 125.8,-9.63 115.8,-6.13 115.8,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/dbe/lu__decomposition_8h_source.html b/d1/dbe/lu__decomposition_8h_source.html
index 9ba3cbdf8..0df00da40 100644
--- a/d1/dbe/lu__decomposition_8h_source.html
+++ b/d1/dbe/lu__decomposition_8h_source.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/lu_decomposition.h Source File</title>
+<title>TheAlgorithms/C++: numerical_methods/lu_decomposition.h Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -107,13 +124,7 @@ $(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.html','../../'); in
   <div class="headertitle"><div class="title">lu_decomposition.h</div></div>
 </div><!--header-->
 <div class="contents">
-<a href="../../d1/dbe/lu__decomposition_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * @file lu_decomposition.h</span></div>
-<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * @author [Krishna Vedala](https://github.com/kvedala)</span></div>
-<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * @brief Functions associated with [LU</span></div>
-<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * Decomposition](https://en.wikipedia.org/wiki/LU_decomposition)</span></div>
-<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> * of a square matrix.</span></div>
-<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> */</span></div>
+<a href="../../d1/dbe/lu__decomposition_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
 <div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#pragma once</span></div>
 <div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
 <div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
@@ -122,27 +133,19 @@ $(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.html','../../'); in
 <div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#ifdef _OPENMP</span></div>
 <div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;omp.h&gt;</span></div>
 <div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#endif</span></div>
-<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment"></span> </div>
-<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment">/** Define matrix type as a `std::vector` of `std::valarray` */</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
 <div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
-<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"><a class="line" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">   19</a></span><span class="keyword">using </span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt;;</div>
-<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment"></span> </div>
-<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment">/** Perform LU decomposition on matrix</span></div>
-<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"> * \param[in] A matrix to decompose</span></div>
-<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"> * \param[out] L output L matrix</span></div>
-<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment"> * \param[out] U output U matrix</span></div>
-<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment"> * \returns 0 if no errors</span></div>
-<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment"> * \returns negative if error occurred</span></div>
-<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"><a class="line" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">   19</a></span><span class="keyword">using </span><a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a> = std::vector&lt;std::valarray&lt;T&gt;&gt;;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
 <div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00029" data-start="{" data-end="}">
-<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509">   29</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509">lu_decomposition</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;T&gt;</a> &amp;A, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;double&gt;</a> *L, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;double&gt;</a> *U) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509">   29</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509">lu_decomposition</a>(<span class="keyword">const</span> <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;T&gt;</a> &amp;A, <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;double&gt;</a> *L, <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;double&gt;</a> *U) {</div>
 <div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordtype">int</span> row, col, j;</div>
-<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> = 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"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> = A.size();</div>
 <div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
 <div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> != A[0].size()) {</div>
 <div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        <span class="comment">// check matrix is a square matrix</span></div>
-<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Not a square matrix!\n&quot;</span>;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Not a square matrix!\n&quot;</span>;</div>
 <div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        <span class="keywordflow">return</span> -1;</div>
 <div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    }</div>
 <div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
@@ -187,39 +190,27 @@ $(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.html','../../'); in
 <div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>}</div>
 </div>
-<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span><span class="comment"></span> </div>
-<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span><span class="comment"> * Compute determinant of an NxN square matrix using LU decomposition.</span></div>
-<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span><span class="comment"> * Using LU decomposition, the determinant is given by the product of diagonal</span></div>
-<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span><span class="comment"> * elements of matrices L and U.</span></div>
-<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span><span class="comment"> *</span></div>
-<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span><span class="comment"> * @tparam T datatype of input matrix - int, unsigned int, double, etc</span></div>
-<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span><span class="comment"> * @param A input square matrix</span></div>
-<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span><span class="comment"> * @return determinant of matrix A</span></div>
-<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
 <div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00090" data-start="{" data-end="}">
-<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">   90</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;T&gt;</a> &amp;A) {</div>
-<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;double&gt;</a> L(A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(), <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(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"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;double&gt;</a> U(A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(), <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(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"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">   90</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(<span class="keyword">const</span> <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;T&gt;</a> &amp;A) {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;double&gt;</a> L(A.size(), std::valarray&lt;double&gt;(A.size()));</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;double&gt;</a> U(A.size(), std::valarray&lt;double&gt;(A.size()));</div>
 <div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
 <div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509">lu_decomposition</a>(A, &amp;L, &amp;U) &lt; 0)</div>
 <div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        <span class="keywordflow">return</span> 0;</div>
 <div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
 <div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="keywordtype">double</span> result = 1.f;</div>
-<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.size(); i++) {</div>
 <div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        result *= L[i][i] * U[i][i];</div>
 <div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    }</div>
 <div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keywordflow">return</span> result;</div>
 <div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>}</div>
 </div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div></div>
-<div class="ttc" id="alu__decomposition_8h_html_a3108d43bd32c6fb3b3c158476c51ba7f"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a></div><div class="ttdeci">double determinant_lu(const matrix&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> lu_decomposition.h:90</div></div>
-<div class="ttc" id="alu__decomposition_8h_html_a75b8a228c6419ecda6077255d6d60509"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509">lu_decomposition</a></div><div class="ttdeci">int lu_decomposition(const matrix&lt; T &gt; &amp;A, matrix&lt; double &gt; *L, matrix&lt; double &gt; *U)</div><div class="ttdef"><b>Definition</b> lu_decomposition.h:29</div></div>
-<div class="ttc" id="amatrix__exponentiation_8cpp_html_a9977ad12548c4a49dee9dc3f0685aa54"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a></div><div class="ttdeci">ll mat_size</div><div class="ttdef"><b>Definition</b> matrix_exponentiation.cpp:45</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="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></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 class="ttc" id="alu__decomposition_8h_html_a3108d43bd32c6fb3b3c158476c51ba7f"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a></div><div class="ttdeci">double determinant_lu(const matrix&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="#l00090">lu_decomposition.h:90</a></div></div>
+<div class="ttc" id="alu__decomposition_8h_html_a75b8a228c6419ecda6077255d6d60509"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509">lu_decomposition</a></div><div class="ttdeci">int lu_decomposition(const matrix&lt; T &gt; &amp;A, matrix&lt; double &gt; *L, matrix&lt; double &gt; *U)</div><div class="ttdef"><b>Definition</b> <a href="#l00029">lu_decomposition.h:29</a></div></div>
+<div class="ttc" id="alu__decomposition_8h_html_ac029b636b353cefbb18b2fcc71e427e4"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; matrix</div><div class="ttdef"><b>Definition</b> <a href="#l00019">lu_decomposition.h:19</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a9977ad12548c4a49dee9dc3f0685aa54"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a></div><div class="ttdeci">ll mat_size</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00045">matrix_exponentiation.cpp:45</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/d1/dc0/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node-members.html b/d1/dc0/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node-members.html
index 07b271e5b..dc246f1c5 100644
--- a/d1/dc0/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node-members.html
+++ b/d1/dc0/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d1/dc2/class_graph__coll__graph.map b/d1/dc2/class_graph__coll__graph.map
index 768d1187e..cf874b5cd 100644
--- a/d1/dc2/class_graph__coll__graph.map
+++ b/d1/dc2/class_graph__coll__graph.map
@@ -1,21 +1,19 @@
 <map id="Graph" name="Graph">
 <area shape="rect" id="Node000001" title=" " alt="" coords="585,174,641,200"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="276,8,413,33"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="276,8,413,33"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="429,24,498,41,532,56,563,77,583,100,597,126,612,173,607,175,592,128,578,103,559,81,530,61,496,46,428,29"/>
 <area shape="rect" id="Node000003" href="$d7/d77/class_edge.html" title=" " alt="" coords="53,8,105,33"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="120,18,275,18,275,23,120,23"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/map.html" title=" " alt="" coords="258,58,431,114"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="258,58,431,114"/>
 <area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="447,94,506,109,562,133,587,152,604,172,600,176,583,155,560,137,504,114,446,99"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="5,65,153,106"/>
+<area shape="rect" id="Node000005" title=" " alt="" coords="5,65,153,106"/>
 <area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="168,83,257,83,257,88,168,88"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="266,137,423,178"/>
+<area shape="rect" id="Node000006" title=" " alt="" coords="266,137,423,178"/>
 <area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="439,165,585,181,584,187,438,171"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="284,202,405,228"/>
+<area shape="rect" id="Node000007" title=" " alt="" coords="284,202,405,228"/>
 <area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="420,212,489,208,561,199,584,194,585,199,561,205,489,214,420,217"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="270,252,419,293"/>
+<area shape="rect" id="Node000008" title=" " alt="" coords="270,252,419,293"/>
 <area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="434,265,497,254,560,232,582,216,599,199,603,202,585,220,562,236,499,259,435,271"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/tuple.html" title=" " alt="" coords="15,252,143,293"/>
-<area shape="poly" id="edge8_Node000008_Node000009" title=" " alt="" coords="158,270,269,270,269,275,158,275"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/bitset.html" title=" " alt="" coords="273,317,416,342"/>
-<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="430,326,497,313,530,300,559,283,577,264,591,241,606,200,611,201,596,244,582,267,563,287,532,305,499,318,431,331"/>
+<area shape="rect" id="Node000009" title=" " alt="" coords="273,317,416,342"/>
+<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="430,326,497,313,530,300,559,283,577,264,591,241,606,200,611,201,596,244,582,267,563,287,532,305,499,318,431,331"/>
 </map>
diff --git a/d1/dc2/class_graph__coll__graph.md5 b/d1/dc2/class_graph__coll__graph.md5
index c3e5b9763..903300090 100644
--- a/d1/dc2/class_graph__coll__graph.md5
+++ b/d1/dc2/class_graph__coll__graph.md5
@@ -1 +1 @@
-ff1e3808bc1707202b3c553605f4077d
\ No newline at end of file
+9df69d214f86923b96a5af1503d65ffc
\ No newline at end of file
diff --git a/d1/dc2/class_graph__coll__graph.svg b/d1/dc2/class_graph__coll__graph.svg
index 18feeca81..0a6ee4f5b 100644
--- a/d1/dc2/class_graph__coll__graph.svg
+++ b/d1/dc2/class_graph__coll__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="305.75,-251.25 202.75,-251.25 202.75,-232 305.75,-232 305.75,-251.25"/>
 <text text-anchor="middle" x="254.25" y="-237.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; Edge &gt;</text>
 </a>
@@ -69,7 +69,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="319.25,-213.5 189.25,-213.5 189.25,-171.75 319.25,-171.75 319.25,-213.5"/>
 <text text-anchor="start" x="197.25" y="-200" font-family="Helvetica,sans-Serif" font-size="10.00">std::map&lt; unsigned</text>
 <text text-anchor="start" x="197.25" y="-188.75" font-family="Helvetica,sans-Serif" font-size="10.00"> int, std::vector&lt; unsigned</text>
@@ -90,7 +90,7 @@
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000005"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="110.5,-207.88 0,-207.88 0,-177.38 110.5,-177.38 110.5,-207.88"/>
 <text text-anchor="start" x="8" y="-194.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; unsigned</text>
 <text text-anchor="middle" x="55.25" y="-183.12" font-family="Helvetica,sans-Serif" font-size="10.00"> int &gt;</text>
@@ -110,7 +110,7 @@
 <!-- Node6 -->
 <g id="Node000006" class="node">
 <title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000006"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="313.25,-153.88 195.25,-153.88 195.25,-123.38 313.25,-123.38 313.25,-153.88"/>
 <text text-anchor="start" x="203.25" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="254.25" y="-129.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -131,7 +131,7 @@
 <!-- Node7 -->
 <g id="Node000007" class="node">
 <title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000007"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="299.75,-105.25 208.75,-105.25 208.75,-86 299.75,-86 299.75,-105.25"/>
 <text text-anchor="middle" x="254.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
@@ -150,7 +150,7 @@
 <!-- Node8 -->
 <g id="Node000008" class="node">
 <title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000008"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="310.25,-67.88 198.25,-67.88 198.25,-37.38 310.25,-37.38 310.25,-67.88"/>
 <text text-anchor="start" x="206.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::tuple</text>
 <text text-anchor="middle" x="254.25" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int, int, int &gt; &gt;</text>
@@ -170,36 +170,16 @@
 <!-- Node9 -->
 <g id="Node000009" class="node">
 <title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/tuple.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="103,-67.88 7.5,-67.88 7.5,-37.38 103,-37.38 103,-67.88"/>
-<text text-anchor="start" x="15.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::tuple&lt; int, int,</text>
-<text text-anchor="middle" x="55.25" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00"> int &gt;</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node8 -->
-<g id="edge8_Node000008_Node000009" class="edge">
-<title>Node9&#45;&gt;Node8</title>
-<g id="a_edge8_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M114.81,-52.62C141.16,-52.62 172.12,-52.62 198.07,-52.62"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="114.95,-49.13 104.95,-52.63 114.95,-56.13 114.95,-49.13"/>
-</a>
-</g>
-<text text-anchor="middle" x="149.88" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/bitset.html" xlink:title=" ">
+<g id="a_Node000009"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="307.62,-19.25 200.88,-19.25 200.88,0 307.62,0 307.62,-19.25"/>
 <text text-anchor="middle" x="254.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::bitset&lt; MAXN &gt;</text>
 </a>
 </g>
 </g>
-<!-- Node10&#45;&gt;Node1 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node10&#45;&gt;Node1</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
+<!-- Node9&#45;&gt;Node1 -->
+<g id="edge8_Node000001_Node000009" class="edge">
+<title>Node9&#45;&gt;Node1</title>
+<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
 <path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M319.05,-10.37C351.13,-13.66 388.98,-22.33 416.75,-43.38 437.89,-59.39 448.39,-90.51 452.58,-106.54"/>
 <polygon fill="#9a32cd" stroke="#9a32cd" points="319.74,-6.91 309.48,-9.54 319.14,-13.89 319.74,-6.91"/>
 </a>
diff --git a/d1/dc2/class_graph__coll__graph_org.svg b/d1/dc2/class_graph__coll__graph_org.svg
index df5514575..2d1e7a0fe 100644
--- a/d1/dc2/class_graph__coll__graph_org.svg
+++ b/d1/dc2/class_graph__coll__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="305.75,-251.25 202.75,-251.25 202.75,-232 305.75,-232 305.75,-251.25"/>
 <text text-anchor="middle" x="254.25" y="-237.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; Edge &gt;</text>
 </a>
@@ -58,7 +58,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="319.25,-213.5 189.25,-213.5 189.25,-171.75 319.25,-171.75 319.25,-213.5"/>
 <text text-anchor="start" x="197.25" y="-200" font-family="Helvetica,sans-Serif" font-size="10.00">std::map&lt; unsigned</text>
 <text text-anchor="start" x="197.25" y="-188.75" font-family="Helvetica,sans-Serif" font-size="10.00"> int, std::vector&lt; unsigned</text>
@@ -79,7 +79,7 @@
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000005"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="110.5,-207.88 0,-207.88 0,-177.38 110.5,-177.38 110.5,-207.88"/>
 <text text-anchor="start" x="8" y="-194.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; unsigned</text>
 <text text-anchor="middle" x="55.25" y="-183.12" font-family="Helvetica,sans-Serif" font-size="10.00"> int &gt;</text>
@@ -99,7 +99,7 @@
 <!-- Node6 -->
 <g id="Node000006" class="node">
 <title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000006"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="313.25,-153.88 195.25,-153.88 195.25,-123.38 313.25,-123.38 313.25,-153.88"/>
 <text text-anchor="start" x="203.25" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="254.25" y="-129.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -120,7 +120,7 @@
 <!-- Node7 -->
 <g id="Node000007" class="node">
 <title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000007"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="299.75,-105.25 208.75,-105.25 208.75,-86 299.75,-86 299.75,-105.25"/>
 <text text-anchor="middle" x="254.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
@@ -139,7 +139,7 @@
 <!-- Node8 -->
 <g id="Node000008" class="node">
 <title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000008"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="310.25,-67.88 198.25,-67.88 198.25,-37.38 310.25,-37.38 310.25,-67.88"/>
 <text text-anchor="start" x="206.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::tuple</text>
 <text text-anchor="middle" x="254.25" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int, int, int &gt; &gt;</text>
@@ -159,36 +159,16 @@
 <!-- Node9 -->
 <g id="Node000009" class="node">
 <title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/tuple.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="103,-67.88 7.5,-67.88 7.5,-37.38 103,-37.38 103,-67.88"/>
-<text text-anchor="start" x="15.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::tuple&lt; int, int,</text>
-<text text-anchor="middle" x="55.25" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00"> int &gt;</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node8 -->
-<g id="edge8_Node000008_Node000009" class="edge">
-<title>Node9&#45;&gt;Node8</title>
-<g id="a_edge8_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M114.81,-52.62C141.16,-52.62 172.12,-52.62 198.07,-52.62"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="114.95,-49.13 104.95,-52.63 114.95,-56.13 114.95,-49.13"/>
-</a>
-</g>
-<text text-anchor="middle" x="149.88" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/bitset.html" xlink:title=" ">
+<g id="a_Node000009"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="307.62,-19.25 200.88,-19.25 200.88,0 307.62,0 307.62,-19.25"/>
 <text text-anchor="middle" x="254.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::bitset&lt; MAXN &gt;</text>
 </a>
 </g>
 </g>
-<!-- Node10&#45;&gt;Node1 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node10&#45;&gt;Node1</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
+<!-- Node9&#45;&gt;Node1 -->
+<g id="edge8_Node000001_Node000009" class="edge">
+<title>Node9&#45;&gt;Node1</title>
+<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
 <path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M319.05,-10.37C351.13,-13.66 388.98,-22.33 416.75,-43.38 437.89,-59.39 448.39,-90.51 452.58,-106.54"/>
 <polygon fill="#9a32cd" stroke="#9a32cd" points="319.74,-6.91 309.48,-9.54 319.14,-13.89 319.74,-6.91"/>
 </a>
diff --git a/d1/dc2/classstack.html b/d1/dc2/classstack.html
index d8b06e898..b39d1927a 100644
--- a/d1/dc2/classstack.html
+++ b/d1/dc2/classstack.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: stack&lt; ValueType &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: stack&lt; ValueType &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -114,27 +131,26 @@ $(function(){initNavTree('d1/dc2/classstack.html','../../'); initResizable(true)
 </div><!--header-->
 <div class="contents">
 
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>  
+<p>for std::invalid_argument  
  <a href="#details">More...</a></p>
 
 <p><code>#include &lt;<a class="el" href="../../df/d47/stack_8hpp_source.html">stack.hpp</a>&gt;</code></p>
 <div class="dynheader">
 Collaboration diagram for stack&lt; ValueType &gt;:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/dcb/classstack__coll__graph.svg" width="503" height="244"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/dcb/classstack__coll__graph.svg" width="448" height="244"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-types" name="pub-types"></a>
 Public Types</h2></td></tr>
-<tr class="memitem:acd4f2a45d37824eecc4400673c9a840b" id="r_acd4f2a45d37824eecc4400673c9a840b"><td class="memItemLeft" align="right" valign="top"><a id="acd4f2a45d37824eecc4400673c9a840b" name="acd4f2a45d37824eecc4400673c9a840b"></a>
-using&#160;</td><td class="memItemRight" valign="bottom"><b>value_type</b> = ValueType</td></tr>
+<tr class="memitem:acd4f2a45d37824eecc4400673c9a840b" id="r_acd4f2a45d37824eecc4400673c9a840b"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acd4f2a45d37824eecc4400673c9a840b">value_type</a> = ValueType</td></tr>
 <tr class="separator:acd4f2a45d37824eecc4400673c9a840b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:a8bce109630118a34faae717f72986033" id="r_a8bce109630118a34faae717f72986033"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8bce109630118a34faae717f72986033">display</a> () const</td></tr>
 <tr class="separator:a8bce109630118a34faae717f72986033"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a6bbcca5e5d3ab096095899d236edf767" id="r_a6bbcca5e5d3ab096095899d236edf767"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; value_type &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6bbcca5e5d3ab096095899d236edf767">toVector</a> () const</td></tr>
+<tr class="memitem:a6bbcca5e5d3ab096095899d236edf767" id="r_a6bbcca5e5d3ab096095899d236edf767"><td class="memItemLeft" align="right" valign="top">std::vector&lt; value_type &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6bbcca5e5d3ab096095899d236edf767">toVector</a> () const</td></tr>
 <tr class="separator:a6bbcca5e5d3ab096095899d236edf767"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a163eb9a6206c874c9bf98d032fca11c5" id="r_a163eb9a6206c874c9bf98d032fca11c5"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a163eb9a6206c874c9bf98d032fca11c5">isEmptyStack</a> () const</td></tr>
 <tr class="separator:a163eb9a6206c874c9bf98d032fca11c5"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -154,23 +170,43 @@ Private Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:aefb3dac828e32b4ec014ff4b5d43a6b8" id="r_aefb3dac828e32b4ec014ff4b5d43a6b8"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt; value_type &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a></td></tr>
+<tr class="memitem:aefb3dac828e32b4ec014ff4b5d43a6b8" id="r_aefb3dac828e32b4ec014ff4b5d43a6b8"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt; value_type &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a></td></tr>
 <tr class="separator:aefb3dac828e32b4ec014ff4b5d43a6b8"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0a6b2b93ec970296940798ee98a5072e" id="r_a0a6b2b93ec970296940798ee98a5072e"><td class="memItemLeft" align="right" valign="top"><a id="a0a6b2b93ec970296940798ee98a5072e" name="a0a6b2b93ec970296940798ee98a5072e"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><b>size</b> = 0</td></tr>
-<tr class="memdesc:a0a6b2b93ec970296940798ee98a5072e"><td class="mdescLeft">&#160;</td><td class="mdescRight">size of stack <br /></td></tr>
+<tr class="memitem:a0a6b2b93ec970296940798ee98a5072e" id="r_a0a6b2b93ec970296940798ee98a5072e"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0a6b2b93ec970296940798ee98a5072e">size</a> = 0</td></tr>
+<tr class="memdesc:a0a6b2b93ec970296940798ee98a5072e"><td class="mdescLeft">&#160;</td><td class="mdescRight">size of stack  <br /></td></tr>
 <tr class="separator:a0a6b2b93ec970296940798ee98a5072e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><div class="compoundTemplParams">template&lt;class ValueType&gt;<br />
-class stack&lt; ValueType &gt;</div><p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a> </p>
+class stack&lt; ValueType &gt;</div><p>for std::invalid_argument </p>
 <p>for <a class="el" href="../../db/d8b/struct_node.html">Node</a> Definition of the stack class </p><dl class="tparams"><dt>Template Parameters</dt><dd>
   <table class="tparams">
     <tr><td class="paramname">value_type</td><td>type of data nodes of the linked list in the stack should contain </td></tr>
   </table>
   </dd>
 </dl>
-</div><h2 class="groupheader">Member Function Documentation</h2>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/stack_8hpp_source.html#l00019">19</a> of file <a class="el" href="../../df/d47/stack_8hpp_source.html">stack.hpp</a>.</p>
+</div><h2 class="groupheader">Member Typedef Documentation</h2>
+<a id="acd4f2a45d37824eecc4400673c9a840b" name="acd4f2a45d37824eecc4400673c9a840b"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#acd4f2a45d37824eecc4400673c9a840b">&#9670;&#160;</a></span>value_type</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;class ValueType &gt; </div>
+      <table class="memname">
+        <tr>
+          <td class="memname">using <a class="el" href="../../d1/dc2/classstack.html">stack</a>&lt; ValueType &gt;::value_type = ValueType</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/stack_8hpp_source.html#l00021">21</a> of file <a class="el" href="../../df/d47/stack_8hpp_source.html">stack.hpp</a>.</p>
+
+</div>
+</div>
+<h2 class="groupheader">Member Function Documentation</h2>
 <a id="a6f13157faa1a762c59e67da8b9516092" name="a6f13157faa1a762c59e67da8b9516092"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a6f13157faa1a762c59e67da8b9516092">&#9670;&#160;</a></span>clear()</h2>
 
@@ -196,12 +232,14 @@ template&lt;class ValueType &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>Clear stack </p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/stack_8hpp_source.html#l00069">69</a> of file <a class="el" href="../../df/d47/stack_8hpp_source.html">stack.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   69</span>                 {</div>
 <div class="line"><span class="lineno">   70</span>        <a class="code hl_variable" href="#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a> = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">   71</span>        <a class="code hl_variable" href="#a0a6b2b93ec970296940798ee98a5072e">size</a> = 0;</div>
 <div class="line"><span class="lineno">   72</span>    }</div>
-<div class="ttc" id="aclassstack_html_a0a6b2b93ec970296940798ee98a5072e"><div class="ttname"><a href="#a0a6b2b93ec970296940798ee98a5072e">stack::size</a></div><div class="ttdeci">std::size_t size</div><div class="ttdoc">size of stack</div><div class="ttdef"><b>Definition</b> stack.hpp:77</div></div>
-<div class="ttc" id="aclassstack_html_aefb3dac828e32b4ec014ff4b5d43a6b8"><div class="ttname"><a href="#aefb3dac828e32b4ec014ff4b5d43a6b8">stack::stackTop</a></div><div class="ttdeci">std::shared_ptr&lt; Node&lt; value_type &gt; &gt; stackTop</div><div class="ttdef"><b>Definition</b> stack.hpp:75</div></div>
+<div class="ttc" id="aclassstack_html_a0a6b2b93ec970296940798ee98a5072e"><div class="ttname"><a href="#a0a6b2b93ec970296940798ee98a5072e">stack::size</a></div><div class="ttdeci">std::size_t size</div><div class="ttdoc">size of stack</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00077">stack.hpp:77</a></div></div>
+<div class="ttc" id="aclassstack_html_aefb3dac828e32b4ec014ff4b5d43a6b8"><div class="ttname"><a href="#aefb3dac828e32b4ec014ff4b5d43a6b8">stack::stackTop</a></div><div class="ttdeci">std::shared_ptr&lt; Node&lt; value_type &gt; &gt; stackTop</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00075">stack.hpp:75</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -230,21 +268,15 @@ template&lt;class ValueType &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>Show stack </p>
-<div class="fragment"><div class="line"><span class="lineno">   24</span>                         {</div>
-<div class="line"><span class="lineno">   25</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Top --&gt; &quot;</span>;</div>
-<div class="line"><span class="lineno">   26</span>        display_all(this-&gt;<a class="code hl_variable" href="#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html">get</a>());</div>
-<div class="line"><span class="lineno">   27</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
-<div class="line"><span class="lineno">   28</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Size of stack: &quot;</span> &lt;&lt; <a class="code hl_variable" href="#a0a6b2b93ec970296940798ee98a5072e">size</a> &lt;&lt; <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">   29</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="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="aget_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html">std::shared_ptr::get</a></div><div class="ttdeci">T get(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.svg" width="296" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../df/d47/stack_8hpp_source.html#l00024">24</a> of file <a class="el" href="../../df/d47/stack_8hpp_source.html">stack.hpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   24</span>                         {</div>
+<div class="line"><span class="lineno">   25</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Top --&gt; &quot;</span>;</div>
+<div class="line"><span class="lineno">   26</span>        display_all(this-&gt;<a class="code hl_variable" href="#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>.get());</div>
+<div class="line"><span class="lineno">   27</span>        std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><span class="lineno">   28</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Size of stack: &quot;</span> &lt;&lt; <a class="code hl_variable" href="#a0a6b2b93ec970296940798ee98a5072e">size</a> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   29</span>    }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aef1fc81033eb301d0311edda0337eed4" name="aef1fc81033eb301d0311edda0337eed4"></a>
@@ -271,13 +303,14 @@ template&lt;class ValueType &gt; </div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/stack_8hpp_source.html#l00036">36</a> of file <a class="el" href="../../df/d47/stack_8hpp_source.html">stack.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   36</span>                                {</div>
 <div class="line"><span class="lineno">   37</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="#a163eb9a6206c874c9bf98d032fca11c5">isEmptyStack</a>()) {</div>
-<div class="line"><span class="lineno">   38</span>            <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>(<span class="stringliteral">&quot;Stack is empty.&quot;</span>);</div>
+<div class="line"><span class="lineno">   38</span>            <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Stack is empty.&quot;</span>);</div>
 <div class="line"><span class="lineno">   39</span>        }</div>
 <div class="line"><span class="lineno">   40</span>    }</div>
-<div class="ttc" id="aclassstack_html_a163eb9a6206c874c9bf98d032fca11c5"><div class="ttname"><a href="#a163eb9a6206c874c9bf98d032fca11c5">stack::isEmptyStack</a></div><div class="ttdeci">bool isEmptyStack() const</div><div class="ttdef"><b>Definition</b> stack.hpp:44</div></div>
-<div class="ttc" id="ainvalid_argument_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></div></div>
+<div class="ttc" id="aclassstack_html_a163eb9a6206c874c9bf98d032fca11c5"><div class="ttname"><a href="#a163eb9a6206c874c9bf98d032fca11c5">stack::isEmptyStack</a></div><div class="ttdeci">bool isEmptyStack() const</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00044">stack.hpp:44</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -306,6 +339,8 @@ template&lt;class ValueType &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>Determine whether the stack is empty </p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/stack_8hpp_source.html#l00044">44</a> of file <a class="el" href="../../df/d47/stack_8hpp_source.html">stack.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   44</span>{ <span class="keywordflow">return</span> (<a class="code hl_variable" href="#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a> == <span class="keyword">nullptr</span>); }</div>
 </div><!-- fragment -->
 </div>
@@ -335,6 +370,8 @@ template&lt;class ValueType &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>Remove the top element of the stack </p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/stack_8hpp_source.html#l00062">62</a> of file <a class="el" href="../../df/d47/stack_8hpp_source.html">stack.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>               {</div>
 <div class="line"><span class="lineno">   63</span>        ensureNotEmpty();</div>
 <div class="line"><span class="lineno">   64</span>        <a class="code hl_variable" href="#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a> = <a class="code hl_variable" href="#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>-&gt;next;</div>
@@ -368,20 +405,16 @@ template&lt;class ValueType &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>Add new item to the stack </p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/stack_8hpp_source.html#l00047">47</a> of file <a class="el" href="../../df/d47/stack_8hpp_source.html">stack.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   47</span>                                      {</div>
-<div class="line"><span class="lineno">   48</span>        <span class="keyword">auto</span> newNode = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;Node&lt;value_type&gt;</a>&gt;();</div>
+<div class="line"><span class="lineno">   48</span>        <span class="keyword">auto</span> newNode = std::make_shared&lt;Node&lt;value_type&gt;&gt;();</div>
 <div class="line"><span class="lineno">   49</span>        newNode-&gt;data = item;</div>
 <div class="line"><span class="lineno">   50</span>        newNode-&gt;next = <a class="code hl_variable" href="#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>;</div>
 <div class="line"><span class="lineno">   51</span>        <a class="code hl_variable" href="#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a> = newNode;</div>
 <div class="line"><span class="lineno">   52</span>        <a class="code hl_variable" href="#a0a6b2b93ec970296940798ee98a5072e">size</a>++;</div>
 <div class="line"><span class="lineno">   53</span>    }</div>
-<div class="ttc" id="amake_shared_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared</a></div><div class="ttdeci">T make_shared(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/dc2/classstack_a90df277532c23519aa7ac3c08ed90a1d_cgraph.svg" width="274" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae09630c4384903d187801921b2ddc709" name="ae09630c4384903d187801921b2ddc709"></a>
@@ -409,6 +442,8 @@ template&lt;class ValueType &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>Return the top element of the stack </p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/stack_8hpp_source.html#l00056">56</a> of file <a class="el" href="../../df/d47/stack_8hpp_source.html">stack.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   56</span>                           {</div>
 <div class="line"><span class="lineno">   57</span>        ensureNotEmpty();</div>
 <div class="line"><span class="lineno">   58</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>-&gt;data;</div>
@@ -428,7 +463,7 @@ template&lt;class ValueType &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; value_type &gt; <a class="el" href="../../d1/dc2/classstack.html">stack</a>&lt; ValueType &gt;::toVector </td>
+          <td class="memname">std::vector&lt; value_type &gt; <a class="el" href="../../d1/dc2/classstack.html">stack</a>&lt; ValueType &gt;::toVector </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td> const</td>
@@ -440,13 +475,43 @@ template&lt;class ValueType &gt; </div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/stack_8hpp_source.html#l00031">31</a> of file <a class="el" href="../../df/d47/stack_8hpp_source.html">stack.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   31</span>                                           {</div>
-<div class="line"><span class="lineno">   32</span>        <span class="keywordflow">return</span> push_all_to_vector(this-&gt;<a class="code hl_variable" href="#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html">get</a>(), this-&gt;size);</div>
+<div class="line"><span class="lineno">   32</span>        <span class="keywordflow">return</span> push_all_to_vector(this-&gt;<a class="code hl_variable" href="#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>.get(), this-&gt;size);</div>
 <div class="line"><span class="lineno">   33</span>    }</div>
 </div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
+<a id="a0a6b2b93ec970296940798ee98a5072e" name="a0a6b2b93ec970296940798ee98a5072e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a0a6b2b93ec970296940798ee98a5072e">&#9670;&#160;</a></span>size</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;class ValueType &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::size_t <a class="el" href="../../d1/dc2/classstack.html">stack</a>&lt; ValueType &gt;::size = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>size of stack </p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/stack_8hpp_source.html#l00077">77</a> of file <a class="el" href="../../df/d47/stack_8hpp_source.html">stack.hpp</a>.</p>
+
+</div>
+</div>
 <a id="aefb3dac828e32b4ec014ff4b5d43a6b8" name="aefb3dac828e32b4ec014ff4b5d43a6b8"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aefb3dac828e32b4ec014ff4b5d43a6b8">&#9670;&#160;</a></span>stackTop</h2>
 
@@ -459,7 +524,7 @@ template&lt;class ValueType &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt;<a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt;value_type&gt; &gt; <a class="el" href="../../d1/dc2/classstack.html">stack</a>&lt; ValueType &gt;::stackTop</td>
+          <td class="memname">std::shared_ptr&lt;<a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt;value_type&gt; &gt; <a class="el" href="../../d1/dc2/classstack.html">stack</a>&lt; ValueType &gt;::stackTop</td>
         </tr>
       </table>
   </td>
@@ -471,7 +536,9 @@ template&lt;class ValueType &gt; </div>
 <b>Initial value:</b><div class="fragment"><div class="line">=</div>
 <div class="line">        {}</div>
 </div><!-- fragment --><p>Pointer to the stack </p>
-<div class="fragment"><div class="line"><span class="lineno">   76</span>        {};                <span class="comment">/**&lt; Pointer to the stack */</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/stack_8hpp_source.html#l00075">75</a> of file <a class="el" href="../../df/d47/stack_8hpp_source.html">stack.hpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   76</span>        {};                </div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.map b/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.map
deleted file mode 100644
index 61f1d9554..000000000
--- a/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="stack::display" name="stack::display">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,108,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="187,5,258,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="108,33,171,23,172,28,109,38"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/get.html#" title=" " alt="" coords="156,55,290,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="109,48,141,53,140,58,108,54"/>
-</map>
diff --git a/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.md5 b/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.md5
deleted file mode 100644
index 792bd88f1..000000000
--- a/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0cde2ffbdb43f96abc212bc9b4a92a8c
\ No newline at end of file
diff --git a/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.svg b/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.svg
deleted file mode 100644
index d89ecf7b7..000000000
--- a/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: stack::display Pages: 1 -->
-<svg width="222pt" height="64pt"
- viewBox="0.00 0.00 221.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>stack::display</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="76.75,-37.25 0,-37.25 0,-18 76.75,-18 76.75,-37.25"/>
-<text text-anchor="middle" x="38.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::display</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.88,-56.25 136.38,-56.25 136.38,-37 189.88,-37 189.88,-56.25"/>
-<text text-anchor="middle" x="163.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.21,-33.48C92.36,-35.83 109.78,-38.52 124.87,-40.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.98,-44.26 134.4,-42.33 125.05,-37.34 123.98,-44.26"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="213.5,-19.25 112.75,-19.25 112.75,0 213.5,0 213.5,-19.25"/>
-<text text-anchor="middle" x="163.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr::get</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.21,-22.08C84.86,-20.96 93.08,-19.75 101.3,-18.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.55,-22.04 110.94,-17.13 100.54,-15.12 101.55,-22.04"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph_org.svg b/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph_org.svg
deleted file mode 100644
index ed2101887..000000000
--- a/d1/dc2/classstack_a8bce109630118a34faae717f72986033_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: stack::display Pages: 1 -->
-<svg width="222pt" height="64pt"
- viewBox="0.00 0.00 221.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>stack::display</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="76.75,-37.25 0,-37.25 0,-18 76.75,-18 76.75,-37.25"/>
-<text text-anchor="middle" x="38.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::display</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.88,-56.25 136.38,-56.25 136.38,-37 189.88,-37 189.88,-56.25"/>
-<text text-anchor="middle" x="163.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.21,-33.48C92.36,-35.83 109.78,-38.52 124.87,-40.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.98,-44.26 134.4,-42.33 125.05,-37.34 123.98,-44.26"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="213.5,-19.25 112.75,-19.25 112.75,0 213.5,0 213.5,-19.25"/>
-<text text-anchor="middle" x="163.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr::get</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.21,-22.08C84.86,-20.96 93.08,-19.75 101.3,-18.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.55,-22.04 110.94,-17.13 100.54,-15.12 101.55,-22.04"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/dc2/classstack_a90df277532c23519aa7ac3c08ed90a1d_cgraph.map b/d1/dc2/classstack_a90df277532c23519aa7ac3c08ed90a1d_cgraph.map
deleted file mode 100644
index aac2a03e9..000000000
--- a/d1/dc2/classstack_a90df277532c23519aa7ac3c08ed90a1d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="stack::push" name="stack::push">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,95,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="143,5,268,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="95,16,127,16,127,21,95,21"/>
-</map>
diff --git a/d1/dc2/classstack_a90df277532c23519aa7ac3c08ed90a1d_cgraph.md5 b/d1/dc2/classstack_a90df277532c23519aa7ac3c08ed90a1d_cgraph.md5
deleted file mode 100644
index 0000637e8..000000000
--- a/d1/dc2/classstack_a90df277532c23519aa7ac3c08ed90a1d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c452f22af36569c5ffe32b3ceccd2756
\ No newline at end of file
diff --git a/d1/dc2/classstack_a90df277532c23519aa7ac3c08ed90a1d_cgraph.svg b/d1/dc2/classstack_a90df277532c23519aa7ac3c08ed90a1d_cgraph.svg
deleted file mode 100644
index d62afec60..000000000
--- a/d1/dc2/classstack_a90df277532c23519aa7ac3c08ed90a1d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: stack::push Pages: 1 -->
-<svg width="205pt" height="27pt"
- viewBox="0.00 0.00 205.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>stack::push</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="67,-19.25 0,-19.25 0,0 67,0 67,-19.25"/>
-<text text-anchor="middle" x="33.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197,-19.25 103,-19.25 103,0 197,0 197,-19.25"/>
-<text text-anchor="middle" x="150" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M67.31,-9.62C74.77,-9.62 82.9,-9.62 91.06,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.02,-13.13 101.02,-9.63 91.02,-6.13 91.02,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/dc2/classstack_a90df277532c23519aa7ac3c08ed90a1d_cgraph_org.svg b/d1/dc2/classstack_a90df277532c23519aa7ac3c08ed90a1d_cgraph_org.svg
deleted file mode 100644
index 0a18283e7..000000000
--- a/d1/dc2/classstack_a90df277532c23519aa7ac3c08ed90a1d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: stack::push Pages: 1 -->
-<svg width="205pt" height="27pt"
- viewBox="0.00 0.00 205.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>stack::push</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="67,-19.25 0,-19.25 0,0 67,0 67,-19.25"/>
-<text text-anchor="middle" x="33.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197,-19.25 103,-19.25 103,0 197,0 197,-19.25"/>
-<text text-anchor="middle" x="150" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M67.31,-9.62C74.77,-9.62 82.9,-9.62 91.06,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.02,-13.13 101.02,-9.63 91.02,-6.13 91.02,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/dc5/classlarge__number__coll__graph.map b/d1/dc5/classlarge__number__coll__graph.map
index 441c961df..d32150a14 100644
--- a/d1/dc5/classlarge__number__coll__graph.map
+++ b/d1/dc5/classlarge__number__coll__graph.map
@@ -1,5 +1,5 @@
 <map id="large_number" name="large_number">
 <area shape="rect" id="Node000001" title=" " alt="" coords="29,109,129,135"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="5,5,153,46"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,5,153,46"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="82,61,82,109,76,109,76,61"/>
 </map>
diff --git a/d1/dc5/classlarge__number__coll__graph.md5 b/d1/dc5/classlarge__number__coll__graph.md5
index 4a9cebe8b..1edafd50a 100644
--- a/d1/dc5/classlarge__number__coll__graph.md5
+++ b/d1/dc5/classlarge__number__coll__graph.md5
@@ -1 +1 @@
-f1f0cb26d8a8a4fb05a866d3acf7f133
\ No newline at end of file
+7087791adc5a848727631eb9eda727c7
\ No newline at end of file
diff --git a/d1/dc5/classlarge__number__coll__graph.svg b/d1/dc5/classlarge__number__coll__graph.svg
index 05b0b1e4c..3d8ee36af 100644
--- a/d1/dc5/classlarge__number__coll__graph.svg
+++ b/d1/dc5/classlarge__number__coll__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="110.5,-97 0,-97 0,-66.5 110.5,-66.5 110.5,-97"/>
 <text text-anchor="start" x="8" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; unsigned</text>
 <text text-anchor="middle" x="55.25" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00"> char &gt;</text>
diff --git a/d1/dc5/classlarge__number__coll__graph_org.svg b/d1/dc5/classlarge__number__coll__graph_org.svg
index cf4377f54..f01da67a8 100644
--- a/d1/dc5/classlarge__number__coll__graph_org.svg
+++ b/d1/dc5/classlarge__number__coll__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="110.5,-97 0,-97 0,-66.5 110.5,-66.5 110.5,-97"/>
 <text text-anchor="start" x="8" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; unsigned</text>
 <text text-anchor="middle" x="55.25" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00"> char &gt;</text>
diff --git a/d1/dc7/linear__probing__hash__table_8cpp.html b/d1/dc7/linear__probing__hash__table_8cpp.html
index 4b521aac3..97a079fdf 100644
--- a/d1/dc7/linear__probing__hash__table_8cpp.html
+++ b/d1/dc7/linear__probing__hash__table_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: hashing/linear_probing_hash_table.cpp File Reference</title>
+<title>TheAlgorithms/C++: hashing/linear_probing_hash_table.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for linear_probing_hash_table.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/dad/linear__probing__hash__table_8cpp__incl.svg" width="166" height="126"><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">
+</div>
+<p><a href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">linear_probing::Entry</a></td></tr>
@@ -143,7 +162,7 @@ Functions</h2></td></tr>
 <tr class="memitem:a16d34fd3511626a83ab00665d7bc34d1" id="r_a16d34fd3511626a83ab00665d7bc34d1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1">linear_probing::add</a> (int key)</td></tr>
 <tr class="separator:a16d34fd3511626a83ab00665d7bc34d1"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a4bde7a47f98dd1ad24c84038e2608527" id="r_a4bde7a47f98dd1ad24c84038e2608527"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">linear_probing::hashFxn</a> (int key)</td></tr>
-<tr class="memdesc:a4bde7a47f98dd1ad24c84038e2608527"><td class="mdescLeft">&#160;</td><td class="mdescRight">Hash a key. Uses the STL library's <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash()</a></code> function.  <br /></td></tr>
+<tr class="memdesc:a4bde7a47f98dd1ad24c84038e2608527"><td class="mdescLeft">&#160;</td><td class="mdescRight">Hash a key. Uses the STL library's <code>std::hash()</code> function.  <br /></td></tr>
 <tr class="separator:a4bde7a47f98dd1ad24c84038e2608527"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a6322209aaa91b7bbf16f96e1cc52b746" id="r_a6322209aaa91b7bbf16f96e1cc52b746"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linear_probing::linearProbe</a> (int key, bool searching)</td></tr>
 <tr class="separator:a6322209aaa91b7bbf16f96e1cc52b746"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -162,23 +181,17 @@ Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:addfce7597f6a42f796fa597ae40eecc9" id="r_addfce7597f6a42f796fa597ae40eecc9"><td class="memItemLeft" align="right" valign="top"><a id="addfce7597f6a42f796fa597ae40eecc9" name="addfce7597f6a42f796fa597ae40eecc9"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>linear_probing::notPresent</b></td></tr>
+<tr class="memitem:addfce7597f6a42f796fa597ae40eecc9" id="r_addfce7597f6a42f796fa597ae40eecc9"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#addfce7597f6a42f796fa597ae40eecc9">linear_probing::notPresent</a></td></tr>
 <tr class="separator:addfce7597f6a42f796fa597ae40eecc9"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:acb1dc3f09cf07c2633580a1c46c9f0a8" id="r_acb1dc3f09cf07c2633580a1c46c9f0a8"><td class="memItemLeft" align="right" valign="top"><a id="acb1dc3f09cf07c2633580a1c46c9f0a8" name="acb1dc3f09cf07c2633580a1c46c9f0a8"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>linear_probing::table</b></td></tr>
+<tr class="memitem:acb1dc3f09cf07c2633580a1c46c9f0a8" id="r_acb1dc3f09cf07c2633580a1c46c9f0a8"><td class="memItemLeft" align="right" valign="top">std::vector&lt; <a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#acb1dc3f09cf07c2633580a1c46c9f0a8">linear_probing::table</a></td></tr>
 <tr class="separator:acb1dc3f09cf07c2633580a1c46c9f0a8"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a4fdb68db9f02ae4156e1845563004f8e" id="r_a4fdb68db9f02ae4156e1845563004f8e"><td class="memItemLeft" align="right" valign="top"><a id="a4fdb68db9f02ae4156e1845563004f8e" name="a4fdb68db9f02ae4156e1845563004f8e"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>linear_probing::totalSize</b></td></tr>
+<tr class="memitem:a4fdb68db9f02ae4156e1845563004f8e" id="r_a4fdb68db9f02ae4156e1845563004f8e"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a4fdb68db9f02ae4156e1845563004f8e">linear_probing::totalSize</a></td></tr>
 <tr class="separator:a4fdb68db9f02ae4156e1845563004f8e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a62fbd519adacd4e05706f34a7e551288" id="r_a62fbd519adacd4e05706f34a7e551288"><td class="memItemLeft" align="right" valign="top"><a id="a62fbd519adacd4e05706f34a7e551288" name="a62fbd519adacd4e05706f34a7e551288"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>linear_probing::tomb</b> = -1</td></tr>
+<tr class="memitem:a62fbd519adacd4e05706f34a7e551288" id="r_a62fbd519adacd4e05706f34a7e551288"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a62fbd519adacd4e05706f34a7e551288">linear_probing::tomb</a> = -1</td></tr>
 <tr class="separator:a62fbd519adacd4e05706f34a7e551288"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8e81b17f2f8403c982368da3dac1ae87" id="r_a8e81b17f2f8403c982368da3dac1ae87"><td class="memItemLeft" align="right" valign="top"><a id="a8e81b17f2f8403c982368da3dac1ae87" name="a8e81b17f2f8403c982368da3dac1ae87"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>linear_probing::size</b></td></tr>
+<tr class="memitem:a8e81b17f2f8403c982368da3dac1ae87" id="r_a8e81b17f2f8403c982368da3dac1ae87"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a8e81b17f2f8403c982368da3dac1ae87">linear_probing::size</a></td></tr>
 <tr class="separator:a8e81b17f2f8403c982368da3dac1ae87"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a5ff22c1a04290e24ef3ba3d6a3a06386" id="r_a5ff22c1a04290e24ef3ba3d6a3a06386"><td class="memItemLeft" align="right" valign="top"><a id="a5ff22c1a04290e24ef3ba3d6a3a06386" name="a5ff22c1a04290e24ef3ba3d6a3a06386"></a>
-bool&#160;</td><td class="memItemRight" valign="bottom"><b>linear_probing::rehashing</b></td></tr>
+<tr class="memitem:a5ff22c1a04290e24ef3ba3d6a3a06386" id="r_a5ff22c1a04290e24ef3ba3d6a3a06386"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d89/namespacelinear__probing.html#a5ff22c1a04290e24ef3ba3d6a3a06386">linear_probing::rehashing</a></td></tr>
 <tr class="separator:a5ff22c1a04290e24ef3ba3d6a3a06386"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -187,6 +200,8 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>linear_probing::rehas
 <dd>
 <a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
 <dl class="section note"><dt>Note</dt><dd>The implementation can be optimized by using OOP style. </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -203,46 +218,48 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>linear_probing::rehas
       </table>
 </div><div class="memdoc">
 <p>Main function </p><dl class="section return"><dt>Returns</dt><dd>0 on success </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00224">224</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  224</span>           {</div>
 <div class="line"><span class="lineno">  225</span>    <span class="keywordtype">int</span> cmd = 0, <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hash</a> = 0, key = 0;</div>
-<div class="line"><span class="lineno">  226</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the initial size of Hash Table. = &quot;</span>;</div>
-<div class="line"><span class="lineno">  227</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; totalSize;</div>
-<div class="line"><span class="lineno">  228</span>    table = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Entry&gt;</a>(totalSize);</div>
+<div class="line"><span class="lineno">  226</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the initial size of Hash Table. = &quot;</span>;</div>
+<div class="line"><span class="lineno">  227</span>    std::cin &gt;&gt; totalSize;</div>
+<div class="line"><span class="lineno">  228</span>    table = std::vector&lt;Entry&gt;(totalSize);</div>
 <div class="line"><span class="lineno">  229</span>    <span class="keywordtype">bool</span> loop = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  230</span>    <span class="keywordflow">while</span> (loop) {</div>
-<div class="line"><span class="lineno">  231</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  232</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;PLEASE CHOOSE -&quot;</span> &lt;&lt; <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">  233</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1. Add key. (Numeric only)&quot;</span> &lt;&lt; <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">  234</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2. Remove key.&quot;</span> &lt;&lt; <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">  235</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;3. Find key.&quot;</span> &lt;&lt; <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">  236</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;4. Generate Hash. (Numeric only)&quot;</span> &lt;&lt; <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">  237</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;5. Display Hash table.&quot;</span> &lt;&lt; <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">  238</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;6. Exit.&quot;</span> &lt;&lt; <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">  239</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; cmd;</div>
+<div class="line"><span class="lineno">  231</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  232</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;PLEASE CHOOSE -&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  233</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;1. Add key. (Numeric only)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  234</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;2. Remove key.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  235</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;3. Find key.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  236</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;4. Generate Hash. (Numeric only)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  237</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;5. Display Hash table.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  238</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;6. Exit.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  239</span>        std::cin &gt;&gt; cmd;</div>
 <div class="line"><span class="lineno">  240</span>        <span class="keywordflow">switch</span> (cmd) {</div>
 <div class="line"><span class="lineno">  241</span>            <span class="keywordflow">case</span> 1:</div>
-<div class="line"><span class="lineno">  242</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter key to add = &quot;</span>;</div>
-<div class="line"><span class="lineno">  243</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; key;</div>
+<div class="line"><span class="lineno">  242</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter key to add = &quot;</span>;</div>
+<div class="line"><span class="lineno">  243</span>                std::cin &gt;&gt; key;</div>
 <div class="line"><span class="lineno">  244</span>                <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908">linear_probing::addInfo</a>(key);</div>
 <div class="line"><span class="lineno">  245</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  246</span>            <span class="keywordflow">case</span> 2:</div>
-<div class="line"><span class="lineno">  247</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter key to remove = &quot;</span>;</div>
-<div class="line"><span class="lineno">  248</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; key;</div>
+<div class="line"><span class="lineno">  247</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter key to remove = &quot;</span>;</div>
+<div class="line"><span class="lineno">  248</span>                std::cin &gt;&gt; key;</div>
 <div class="line"><span class="lineno">  249</span>                <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0">linear_probing::removalInfo</a>(key);</div>
 <div class="line"><span class="lineno">  250</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  251</span>            <span class="keywordflow">case</span> 3: {</div>
-<div class="line"><span class="lineno">  252</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter key to search = &quot;</span>;</div>
-<div class="line"><span class="lineno">  253</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; key;</div>
+<div class="line"><span class="lineno">  252</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter key to search = &quot;</span>;</div>
+<div class="line"><span class="lineno">  253</span>                std::cin &gt;&gt; key;</div>
 <div class="line"><span class="lineno">  254</span>                <a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> entry = table[<a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linear_probing::linearProbe</a>(key, <span class="keyword">true</span>)];</div>
 <div class="line"><span class="lineno">  255</span>                <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> == linear_probing::notPresent) {</div>
-<div class="line"><span class="lineno">  256</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Key not present&quot;</span>;</div>
+<div class="line"><span class="lineno">  256</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;Key not present&quot;</span>;</div>
 <div class="line"><span class="lineno">  257</span>                }</div>
 <div class="line"><span class="lineno">  258</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  259</span>            }</div>
 <div class="line"><span class="lineno">  260</span>            <span class="keywordflow">case</span> 4:</div>
-<div class="line"><span class="lineno">  261</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter element to generate hash = &quot;</span>;</div>
-<div class="line"><span class="lineno">  262</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; key;</div>
-<div class="line"><span class="lineno">  263</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hash of &quot;</span> &lt;&lt; key</div>
+<div class="line"><span class="lineno">  261</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter element to generate hash = &quot;</span>;</div>
+<div class="line"><span class="lineno">  262</span>                std::cin &gt;&gt; key;</div>
+<div class="line"><span class="lineno">  263</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Hash of &quot;</span> &lt;&lt; key</div>
 <div class="line"><span class="lineno">  264</span>                          &lt;&lt; <span class="stringliteral">&quot; is = &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">linear_probing::hashFxn</a>(key);</div>
 <div class="line"><span class="lineno">  265</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  266</span>            <span class="keywordflow">case</span> 5:</div>
@@ -253,28 +270,19 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>linear_probing::rehas
 <div class="line"><span class="lineno">  271</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  272</span>                <span class="comment">// delete[] table;</span></div>
 <div class="line"><span class="lineno">  273</span>        }</div>
-<div class="line"><span class="lineno">  274</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  274</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  275</span>    }</div>
 <div class="line"><span class="lineno">  276</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  277</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> md5.cpp:288</div></div>
-<div class="ttc" id="anamespacelinear__probing_html_a16680b8a37d442c2f208faa286e33908"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908">linear_probing::addInfo</a></div><div class="ttdeci">void addInfo(int key)</div><div class="ttdef"><b>Definition</b> linear_probing_hash_table.cpp:186</div></div>
-<div class="ttc" id="anamespacelinear__probing_html_a4bde7a47f98dd1ad24c84038e2608527"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">linear_probing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdoc">Hash a key. Uses the STL library's std::hash() function.</div><div class="ttdef"><b>Definition</b> linear_probing_hash_table.cpp:46</div></div>
-<div class="ttc" id="anamespacelinear__probing_html_a6322209aaa91b7bbf16f96e1cc52b746"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linear_probing::linearProbe</a></div><div class="ttdeci">int linearProbe(int key, bool searching)</div><div class="ttdef"><b>Definition</b> linear_probing_hash_table.cpp:55</div></div>
-<div class="ttc" id="anamespacelinear__probing_html_a75854f5aa216e61219154c62167ce8f0"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0">linear_probing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition</b> linear_probing_hash_table.cpp:201</div></div>
-<div class="ttc" id="anamespacelinear__probing_html_ad87b71d810901fab69c4ad9d4d0fa635"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">linear_probing::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition</b> linear_probing_hash_table.cpp:120</div></div>
-<div class="ttc" id="astructlinear__probing_1_1_entry_html"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html">linear_probing::Entry</a></div><div class="ttdef"><b>Definition</b> linear_probing_hash_table.cpp:35</div></div>
-<div class="ttc" id="astructlinear__probing_1_1_entry_html_a4d84e90b73022083761f85f8586c4c2a"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">linear_probing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition</b> linear_probing_hash_table.cpp:37</div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d1/dc7/linear__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d96/md5_8cpp_source.html#l00288">md5.cpp:288</a></div></div>
+<div class="ttc" id="anamespacelinear__probing_html_a16680b8a37d442c2f208faa286e33908"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908">linear_probing::addInfo</a></div><div class="ttdeci">void addInfo(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00186">linear_probing_hash_table.cpp:186</a></div></div>
+<div class="ttc" id="anamespacelinear__probing_html_a4bde7a47f98dd1ad24c84038e2608527"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">linear_probing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdoc">Hash a key. Uses the STL library's std::hash() function.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00046">linear_probing_hash_table.cpp:46</a></div></div>
+<div class="ttc" id="anamespacelinear__probing_html_a6322209aaa91b7bbf16f96e1cc52b746"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linear_probing::linearProbe</a></div><div class="ttdeci">int linearProbe(int key, bool searching)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00055">linear_probing_hash_table.cpp:55</a></div></div>
+<div class="ttc" id="anamespacelinear__probing_html_a75854f5aa216e61219154c62167ce8f0"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0">linear_probing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00201">linear_probing_hash_table.cpp:201</a></div></div>
+<div class="ttc" id="anamespacelinear__probing_html_ad87b71d810901fab69c4ad9d4d0fa635"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">linear_probing::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00120">linear_probing_hash_table.cpp:120</a></div></div>
+<div class="ttc" id="astructlinear__probing_1_1_entry_html"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html">linear_probing::Entry</a></div><div class="ttdef"><b>Definition</b> <a href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00035">linear_probing_hash_table.cpp:35</a></div></div>
+<div class="ttc" id="astructlinear__probing_1_1_entry_html_a4d84e90b73022083761f85f8586c4c2a"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">linear_probing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00037">linear_probing_hash_table.cpp:37</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d1/dc7/linear__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d1/dc7/linear__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index a290663e8..000000000
--- a/d1/dc7/linear__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,39 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,164,55,190"/>
-<area shape="rect" id="Node000002" href="$d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908" title=" " alt="" coords="115,188,268,214"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,178,100,185,100,190,55,183"/>
-<area shape="rect" id="Node000004" href="$d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746" title=" " alt="" coords="528,291,703,316"/>
-<area shape="poly" id="edge18_Node000001_Node000004" title=" " alt="" coords="48,188,73,207,104,224,210,257,319,279,423,293,513,299,512,304,423,298,318,285,208,262,102,229,70,211,44,192"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="798,139,869,164"/>
-<area shape="poly" id="edge16_Node000001_Node000005" title=" " alt="" coords="35,162,60,120,78,97,101,77,159,46,209,33,328,22,434,9,520,3,560,5,603,13,650,26,704,46,736,63,765,83,812,125,808,129,762,88,733,67,702,51,648,31,602,18,560,11,520,8,435,14,328,27,210,38,161,51,104,82,82,101,64,123,40,165"/>
-<area shape="rect" id="Node000006" href="$d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" title="Hash a key. Uses the STL library&#39;s std::hash() function." alt="" coords="754,380,913,406"/>
-<area shape="poly" id="edge17_Node000001_Node000006" title=" " alt="" coords="40,189,64,233,82,257,104,279,159,317,208,345,255,364,301,376,401,388,528,398,637,402,738,398,738,404,637,408,528,403,401,394,300,381,253,369,206,350,156,322,101,283,78,261,59,236,35,192"/>
-<area shape="rect" id="Node000010" href="$d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635" title=" " alt="" coords="329,37,479,63"/>
-<area shape="poly" id="edge15_Node000001_Node000010" title=" " alt="" coords="45,161,71,142,101,124,155,102,210,85,313,61,315,66,211,90,156,107,104,129,73,146,48,165"/>
-<area shape="rect" id="Node000011" href="$d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0" title=" " alt="" coords="103,139,280,164"/>
-<area shape="poly" id="edge19_Node000001_Node000011" title=" " alt="" coords="55,170,90,165,91,170,56,176"/>
-<area shape="rect" id="Node000003" href="$d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1" title=" " alt="" coords="339,188,469,214"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="268,198,324,198,324,203,268,203"/>
-<area shape="poly" id="edge13_Node000002_Node000005" title=" " alt="" coords="246,212,334,229,449,243,512,246,576,244,640,238,702,225,730,215,757,202,802,172,805,176,759,206,732,220,703,230,641,243,576,250,512,251,448,248,333,234,245,217"/>
-<area shape="poly" id="edge14_Node000002_Node000006" title=" " alt="" coords="213,212,265,246,341,290,432,335,529,370,582,382,636,389,738,394,738,399,636,394,581,387,528,375,430,340,339,295,262,250,210,216"/>
-<area shape="poly" id="edge11_Node000002_Node000010" title=" " alt="" coords="256,185,279,174,294,163,304,152,326,124,377,72,381,76,330,128,308,156,297,167,281,179,258,190"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="440,212,481,230,578,280,576,285,479,235,437,217"/>
-<area shape="rect" id="Node000009" href="$d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0" title=" " alt="" coords="541,189,690,215"/>
-<area shape="poly" id="edge8_Node000003_Node000009" title=" " alt="" coords="470,207,526,208,526,213,470,212"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="662,288,701,269,806,173,809,177,704,274,664,292"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="655,314,704,333,790,371,788,375,702,338,653,319"/>
-<area shape="rect" id="Node000007" href="$d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" title=" " alt="" coords="751,244,916,270"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="679,287,755,271,756,276,680,293"/>
-<area shape="rect" id="Node000008" href="$d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" title=" " alt="" coords="751,294,916,334"/>
-<area shape="poly" id="edge7_Node000004_Node000008" title=" " alt="" coords="703,305,735,307,735,312,703,310"/>
-<area shape="poly" id="edge9_Node000009_Node000003" title=" " alt="" coords="541,196,485,195,485,190,541,190"/>
-<area shape="poly" id="edge10_Node000009_Node000005" title=" " alt="" coords="673,186,782,160,784,166,675,191"/>
-<area shape="poly" id="edge12_Node000010_Node000005" title=" " alt="" coords="480,48,587,56,646,65,704,80,756,102,801,128,799,132,754,106,702,85,645,70,586,61,480,53"/>
-<area shape="poly" id="edge21_Node000011_Node000005" title=" " alt="" coords="251,135,328,123,433,116,515,116,703,130,783,140,782,146,702,135,515,121,433,121,328,129,252,141"/>
-<area shape="poly" id="edge22_Node000011_Node000006" title=" " alt="" coords="258,162,281,173,297,186,307,198,316,211,330,224,369,250,403,266,482,301,505,315,529,326,622,350,742,374,741,379,621,355,527,331,503,320,479,306,401,271,367,255,326,228,312,214,303,201,293,189,279,178,256,167"/>
-<area shape="poly" id="edge20_Node000011_Node000010" title=" " alt="" coords="216,136,327,80,356,67,358,72,329,85,219,141"/>
-<area shape="rect" id="Node000012" href="$d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28" title=" " alt="" coords="328,139,480,164"/>
-<area shape="poly" id="edge23_Node000011_Node000012" title=" " alt="" coords="281,149,313,149,313,154,281,154"/>
-<area shape="poly" id="edge25_Node000012_Node000004" title=" " alt="" coords="460,162,482,173,498,186,508,198,530,226,589,279,585,283,526,229,504,201,494,190,479,178,458,167"/>
-<area shape="poly" id="edge24_Node000012_Node000005" title=" " alt="" coords="481,149,782,149,782,154,481,154"/>
-</map>
diff --git a/d1/dc7/linear__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/dc7/linear__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index ee113239f..000000000
--- a/d1/dc7/linear__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8ede06e805d35b101be3d43b50f0fd5e
\ No newline at end of file
diff --git a/d1/dc7/linear__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/dc7/linear__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index eb8709618..000000000
--- a/d1/dc7/linear__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,429 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 308 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 691;
-var viewHeight = 308;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-181.25 0,-181.25 0,-162 37,-162 37,-181.25"/>
-<text text-anchor="middle" x="18.5" y="-167.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.62,-163.25 82.38,-163.25 82.38,-144 196.62,-144 196.62,-163.25"/>
-<text text-anchor="middle" x="139.5" y="-149.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::addInfo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-168.93C46.59,-167.53 58.59,-165.71 71.06,-163.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.22,-167.34 80.58,-162.39 70.17,-160.42 71.22,-167.34"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="523,-86.25 392.25,-86.25 392.25,-67 523,-67 523,-86.25"/>
-<text text-anchor="middle" x="457.62" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::linearProbe</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge18_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge18_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.51,-161.74C40.76,-153.12 56.83,-141.04 73,-134.62 174.45,-94.39 301.16,-81.85 380.51,-78.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="380.52,-81.57 390.36,-77.64 380.21,-74.58 380.52,-81.57"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="647.75,-200.25 594.25,-200.25 594.25,-181 647.75,-181 647.75,-200.25"/>
-<text text-anchor="middle" x="621" y="-186.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge16_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge16_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.98,-181.63C31.65,-197.56 48.82,-228.5 73,-244.62 137.3,-287.51 165.26,-276.45 242,-285.62 366.26,-300.48 407.22,-315.12 523,-267.62 555.31,-254.37 585.67,-226.94 603.54,-208.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="605.88,-211.28 610.23,-201.62 600.81,-206.46 605.88,-211.28"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="680.75,-19.25 561.25,-19.25 561.25,0 680.75,0 680.75,-19.25"/>
-<text text-anchor="middle" x="621" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge17_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge17_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.89,-161.51C31.54,-145.02 48.83,-112.3 73,-93.62 189.64,-3.47 245.5,-17.66 392.25,-3.62 444.77,1.4 504.39,-0.44 549.46,-3.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="549.15,-6.85 559.37,-4.04 549.63,0.14 549.15,-6.85"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="355.5,-276.25 242.75,-276.25 242.75,-257 355.5,-257 355.5,-276.25"/>
-<text text-anchor="middle" x="299.12" y="-262.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge15_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge15_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.03,-181.75C41.37,-190.33 57.28,-202.36 73,-209.62 123.72,-233.06 185.49,-247.82 231.49,-256.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.58,-259.83 241.05,-258.18 231.83,-252.94 230.58,-259.83"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="206,-200.25 73,-200.25 73,-181 206,-181 206,-200.25"/>
-<text text-anchor="middle" x="139.5" y="-186.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::removalInfo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge19_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge19_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-174.47C44.81,-175.67 54.07,-177.14 63.92,-178.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="63.31,-182.16 73.74,-180.28 64.41,-175.25 63.31,-182.16"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="348,-163.25 250.25,-163.25 250.25,-144 348,-144 348,-163.25"/>
-<text text-anchor="middle" x="299.12" y="-149.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::add</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M196.96,-153.62C210.49,-153.62 224.97,-153.62 238.63,-153.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.36,-157.13 248.36,-153.63 238.36,-150.13 238.36,-157.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge13_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge13_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.19,-143.52C250.64,-127.33 401.57,-100.59 523,-133.62 551.44,-141.36 580.05,-159.78 598.75,-173.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="596.54,-176.31 606.61,-179.6 600.79,-170.75 596.54,-176.31"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge14_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge14_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.67,-143.68C191.65,-118.36 294.97,-51.51 392.25,-24.62 443.66,-10.42 503.96,-7 549.6,-6.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="549.34,-10.46 559.36,-7.01 549.38,-3.46 549.34,-10.46"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge11_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge11_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.97,-163.69C194.92,-165.85 200.74,-168.47 206,-171.62 225.95,-183.59 225.84,-192.89 242,-209.62 254.64,-222.71 269.04,-237.33 280.09,-248.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.54,-250.88 287.06,-255.52 282.51,-245.95 277.54,-250.88"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.91,-143.54C334.75,-139.41 346.11,-134.46 356.25,-129.62 381.13,-117.76 408.78,-103.04 428.76,-92.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="430.31,-95.26 437.39,-87.38 426.94,-89.13 430.31,-95.26"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="513.25,-162.25 402,-162.25 402,-143 513.25,-143 513.25,-162.25"/>
-<text text-anchor="middle" x="457.62" y="-148.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::rehash</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M348.36,-147.03C361.68,-146.51 376.37,-146.29 390.52,-146.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="390.16,-149.87 400.2,-146.48 390.24,-142.87 390.16,-149.87"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M493.2,-86.71C503.19,-90.35 513.86,-94.99 523,-100.62 531.79,-106.04 576.08,-148.25 601.67,-172.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="599.14,-175.31 608.76,-179.74 604,-170.27 599.14,-175.31"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.65,-66.59C498,-62.43 511.18,-57.44 523,-52.62 544.82,-43.73 569.05,-32.99 587.83,-24.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="589.18,-27.7 596.83,-20.37 586.28,-21.33 589.18,-27.7"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="683,-121.25 559,-121.25 559,-102 683,-102 683,-121.25"/>
-<text text-anchor="middle" x="621" y="-107.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M505.3,-86.75C523.11,-90.61 543.64,-95.06 562.35,-99.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="561.43,-102.5 571.95,-101.2 562.92,-95.66 561.43,-102.5"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="683,-83.88 559,-83.88 559,-53.38 683,-53.38 683,-83.88"/>
-<text text-anchor="start" x="567" y="-70.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::searching</text>
-<text text-anchor="middle" x="621" y="-59.12" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M523.33,-73.42C531.26,-73.02 539.4,-72.62 547.43,-72.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="547.36,-75.73 557.17,-71.74 547.01,-68.74 547.36,-75.73"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge9_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge9_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M401.71,-159.45C388.13,-159.87 373.51,-159.99 359.71,-159.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="359.94,-156.32 349.87,-159.63 359.8,-163.32 359.94,-156.32"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge10_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge10_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M501.45,-162.71C526.92,-168.71 558.9,-176.24 583.23,-181.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="582.14,-185.31 592.68,-184.19 583.75,-178.49 582.14,-185.31"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node5 -->
-<g id="edge12_Node000010_Node000005" class="edge">
-<title>Node10&#45;&gt;Node5</title>
-<g id="a_edge12_Node000010_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M355.81,-266.51C401.63,-265.03 467.78,-259.69 523,-242.62 549.49,-234.44 577.12,-218.82 596.08,-206.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="597.91,-209.82 604.4,-201.44 594.1,-203.95 597.91,-209.82"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge21_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge21_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.72,-200.74C202.42,-204.31 223.08,-207.87 242,-209.62 366.37,-221.17 398.56,-215.44 523,-204.62 542.88,-202.9 564.91,-199.81 582.94,-196.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="583.35,-200.46 592.66,-195.41 582.23,-193.55 583.35,-200.46"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node6 -->
-<g id="edge22_Node000011_Node000006" class="edge">
-<title>Node11&#45;&gt;Node6</title>
-<g id="a_edge22_Node000011_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.97,-180.56C194.92,-178.4 200.74,-175.78 206,-172.62 225.95,-160.66 223.35,-148.54 242,-134.62 287.64,-100.57 305.68,-102.8 356.25,-76.62 372.32,-68.31 375.23,-63.77 392.25,-57.62 421.09,-47.2 495.8,-32.27 551.85,-21.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="552.46,-25.28 561.66,-20.02 551.19,-18.39 552.46,-25.28"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node10 -->
-<g id="edge20_Node000011_Node000010" class="edge">
-<title>Node11&#45;&gt;Node10</title>
-<g id="a_edge20_Node000011_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.02,-200.6C179.22,-211.37 212.6,-228.83 242,-242.62 248.9,-245.86 256.35,-249.17 263.49,-252.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.69,-255.3 272.26,-256 264.43,-248.86 261.69,-255.3"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="356.25,-200.25 242,-200.25 242,-181 356.25,-181 356.25,-200.25"/>
-<text text-anchor="middle" x="299.12" y="-186.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::remove</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge23_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge23_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M206.43,-190.62C214.37,-190.62 222.48,-190.62 230.44,-190.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.44,-194.13 240.44,-190.63 230.44,-187.13 230.44,-194.13"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node4 -->
-<g id="edge25_Node000012_Node000004" class="edge">
-<title>Node12&#45;&gt;Node4</title>
-<g id="a_edge25_Node000012_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.23,-180.59C345.82,-178.39 351.33,-175.76 356.25,-172.62 376.14,-159.94 375.4,-150.13 392.25,-133.62 406.5,-119.67 423.4,-104.76 436.31,-93.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="438.41,-96.5 443.76,-87.36 433.88,-91.17 438.41,-96.5"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node5 -->
-<g id="edge24_Node000012_Node000005" class="edge">
-<title>Node12&#45;&gt;Node5</title>
-<g id="a_edge24_Node000012_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M356.58,-190.62C421.58,-190.62 526.54,-190.62 582.33,-190.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="582.26,-194.13 592.26,-190.63 582.26,-187.13 582.26,-194.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="linear__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/dc7/linear__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d1/dc7/linear__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 1a9923c13..000000000
--- a/d1/dc7/linear__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,346 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="691pt" height="308pt"
- viewBox="0.00 0.00 691.00 308.22" 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 304.22)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-181.25 0,-181.25 0,-162 37,-162 37,-181.25"/>
-<text text-anchor="middle" x="18.5" y="-167.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.62,-163.25 82.38,-163.25 82.38,-144 196.62,-144 196.62,-163.25"/>
-<text text-anchor="middle" x="139.5" y="-149.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::addInfo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-168.93C46.59,-167.53 58.59,-165.71 71.06,-163.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.22,-167.34 80.58,-162.39 70.17,-160.42 71.22,-167.34"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="523,-86.25 392.25,-86.25 392.25,-67 523,-67 523,-86.25"/>
-<text text-anchor="middle" x="457.62" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::linearProbe</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge18_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge18_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.51,-161.74C40.76,-153.12 56.83,-141.04 73,-134.62 174.45,-94.39 301.16,-81.85 380.51,-78.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="380.52,-81.57 390.36,-77.64 380.21,-74.58 380.52,-81.57"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="647.75,-200.25 594.25,-200.25 594.25,-181 647.75,-181 647.75,-200.25"/>
-<text text-anchor="middle" x="621" y="-186.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge16_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge16_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.98,-181.63C31.65,-197.56 48.82,-228.5 73,-244.62 137.3,-287.51 165.26,-276.45 242,-285.62 366.26,-300.48 407.22,-315.12 523,-267.62 555.31,-254.37 585.67,-226.94 603.54,-208.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="605.88,-211.28 610.23,-201.62 600.81,-206.46 605.88,-211.28"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="680.75,-19.25 561.25,-19.25 561.25,0 680.75,0 680.75,-19.25"/>
-<text text-anchor="middle" x="621" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge17_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge17_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.89,-161.51C31.54,-145.02 48.83,-112.3 73,-93.62 189.64,-3.47 245.5,-17.66 392.25,-3.62 444.77,1.4 504.39,-0.44 549.46,-3.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="549.15,-6.85 559.37,-4.04 549.63,0.14 549.15,-6.85"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="355.5,-276.25 242.75,-276.25 242.75,-257 355.5,-257 355.5,-276.25"/>
-<text text-anchor="middle" x="299.12" y="-262.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge15_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge15_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.03,-181.75C41.37,-190.33 57.28,-202.36 73,-209.62 123.72,-233.06 185.49,-247.82 231.49,-256.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.58,-259.83 241.05,-258.18 231.83,-252.94 230.58,-259.83"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="206,-200.25 73,-200.25 73,-181 206,-181 206,-200.25"/>
-<text text-anchor="middle" x="139.5" y="-186.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::removalInfo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge19_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge19_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-174.47C44.81,-175.67 54.07,-177.14 63.92,-178.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="63.31,-182.16 73.74,-180.28 64.41,-175.25 63.31,-182.16"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="348,-163.25 250.25,-163.25 250.25,-144 348,-144 348,-163.25"/>
-<text text-anchor="middle" x="299.12" y="-149.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::add</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M196.96,-153.62C210.49,-153.62 224.97,-153.62 238.63,-153.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.36,-157.13 248.36,-153.63 238.36,-150.13 238.36,-157.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge13_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge13_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.19,-143.52C250.64,-127.33 401.57,-100.59 523,-133.62 551.44,-141.36 580.05,-159.78 598.75,-173.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="596.54,-176.31 606.61,-179.6 600.79,-170.75 596.54,-176.31"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge14_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge14_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.67,-143.68C191.65,-118.36 294.97,-51.51 392.25,-24.62 443.66,-10.42 503.96,-7 549.6,-6.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="549.34,-10.46 559.36,-7.01 549.38,-3.46 549.34,-10.46"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge11_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge11_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.97,-163.69C194.92,-165.85 200.74,-168.47 206,-171.62 225.95,-183.59 225.84,-192.89 242,-209.62 254.64,-222.71 269.04,-237.33 280.09,-248.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.54,-250.88 287.06,-255.52 282.51,-245.95 277.54,-250.88"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.91,-143.54C334.75,-139.41 346.11,-134.46 356.25,-129.62 381.13,-117.76 408.78,-103.04 428.76,-92.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="430.31,-95.26 437.39,-87.38 426.94,-89.13 430.31,-95.26"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="513.25,-162.25 402,-162.25 402,-143 513.25,-143 513.25,-162.25"/>
-<text text-anchor="middle" x="457.62" y="-148.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::rehash</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M348.36,-147.03C361.68,-146.51 376.37,-146.29 390.52,-146.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="390.16,-149.87 400.2,-146.48 390.24,-142.87 390.16,-149.87"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M493.2,-86.71C503.19,-90.35 513.86,-94.99 523,-100.62 531.79,-106.04 576.08,-148.25 601.67,-172.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="599.14,-175.31 608.76,-179.74 604,-170.27 599.14,-175.31"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.65,-66.59C498,-62.43 511.18,-57.44 523,-52.62 544.82,-43.73 569.05,-32.99 587.83,-24.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="589.18,-27.7 596.83,-20.37 586.28,-21.33 589.18,-27.7"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="683,-121.25 559,-121.25 559,-102 683,-102 683,-121.25"/>
-<text text-anchor="middle" x="621" y="-107.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M505.3,-86.75C523.11,-90.61 543.64,-95.06 562.35,-99.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="561.43,-102.5 571.95,-101.2 562.92,-95.66 561.43,-102.5"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="683,-83.88 559,-83.88 559,-53.38 683,-53.38 683,-83.88"/>
-<text text-anchor="start" x="567" y="-70.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::searching</text>
-<text text-anchor="middle" x="621" y="-59.12" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M523.33,-73.42C531.26,-73.02 539.4,-72.62 547.43,-72.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="547.36,-75.73 557.17,-71.74 547.01,-68.74 547.36,-75.73"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge9_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge9_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M401.71,-159.45C388.13,-159.87 373.51,-159.99 359.71,-159.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="359.94,-156.32 349.87,-159.63 359.8,-163.32 359.94,-156.32"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge10_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge10_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M501.45,-162.71C526.92,-168.71 558.9,-176.24 583.23,-181.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="582.14,-185.31 592.68,-184.19 583.75,-178.49 582.14,-185.31"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node5 -->
-<g id="edge12_Node000010_Node000005" class="edge">
-<title>Node10&#45;&gt;Node5</title>
-<g id="a_edge12_Node000010_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M355.81,-266.51C401.63,-265.03 467.78,-259.69 523,-242.62 549.49,-234.44 577.12,-218.82 596.08,-206.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="597.91,-209.82 604.4,-201.44 594.1,-203.95 597.91,-209.82"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge21_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge21_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.72,-200.74C202.42,-204.31 223.08,-207.87 242,-209.62 366.37,-221.17 398.56,-215.44 523,-204.62 542.88,-202.9 564.91,-199.81 582.94,-196.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="583.35,-200.46 592.66,-195.41 582.23,-193.55 583.35,-200.46"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node6 -->
-<g id="edge22_Node000011_Node000006" class="edge">
-<title>Node11&#45;&gt;Node6</title>
-<g id="a_edge22_Node000011_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.97,-180.56C194.92,-178.4 200.74,-175.78 206,-172.62 225.95,-160.66 223.35,-148.54 242,-134.62 287.64,-100.57 305.68,-102.8 356.25,-76.62 372.32,-68.31 375.23,-63.77 392.25,-57.62 421.09,-47.2 495.8,-32.27 551.85,-21.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="552.46,-25.28 561.66,-20.02 551.19,-18.39 552.46,-25.28"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node10 -->
-<g id="edge20_Node000011_Node000010" class="edge">
-<title>Node11&#45;&gt;Node10</title>
-<g id="a_edge20_Node000011_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.02,-200.6C179.22,-211.37 212.6,-228.83 242,-242.62 248.9,-245.86 256.35,-249.17 263.49,-252.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.69,-255.3 272.26,-256 264.43,-248.86 261.69,-255.3"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="356.25,-200.25 242,-200.25 242,-181 356.25,-181 356.25,-200.25"/>
-<text text-anchor="middle" x="299.12" y="-186.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::remove</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge23_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge23_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M206.43,-190.62C214.37,-190.62 222.48,-190.62 230.44,-190.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.44,-194.13 240.44,-190.63 230.44,-187.13 230.44,-194.13"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node4 -->
-<g id="edge25_Node000012_Node000004" class="edge">
-<title>Node12&#45;&gt;Node4</title>
-<g id="a_edge25_Node000012_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.23,-180.59C345.82,-178.39 351.33,-175.76 356.25,-172.62 376.14,-159.94 375.4,-150.13 392.25,-133.62 406.5,-119.67 423.4,-104.76 436.31,-93.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="438.41,-96.5 443.76,-87.36 433.88,-91.17 438.41,-96.5"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node5 -->
-<g id="edge24_Node000012_Node000005" class="edge">
-<title>Node12&#45;&gt;Node5</title>
-<g id="a_edge24_Node000012_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M356.58,-190.62C421.58,-190.62 526.54,-190.62 582.33,-190.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="582.26,-194.13 592.26,-190.63 582.26,-187.13 582.26,-194.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/dc7/linear__probing__hash__table_8cpp_source.html b/d1/dc7/linear__probing__hash__table_8cpp_source.html
new file mode 100644
index 000000000..51a42d38a
--- /dev/null
+++ b/d1/dc7/linear__probing__hash__table_8cpp_source.html
@@ -0,0 +1,395 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: hashing/linear_probing_hash_table.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/dc7/linear__probing__hash__table_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">linear_probing_hash_table.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d1/dc7/linear__probing__hash__table_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d89/namespacelinear__probing.html">linear_probing</a> {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment">// fwd declarations</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="keyword">using </span><a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> = <span class="keyword">struct </span><a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a>;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">putProber</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a>&amp; entry, <span class="keywordtype">int</span> key);</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77">searchingProber</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a>&amp; entry, <span class="keywordtype">int</span> key);</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1">add</a>(<span class="keywordtype">int</span> key);</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment">// Undocumented globals</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keywordtype">int</span> notPresent;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>std::vector&lt;Entry&gt; table;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keywordtype">int</span> totalSize;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keywordtype">int</span> tomb = -1;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keywordtype">int</span> size;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keywordtype">bool</span> rehashing;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="foldopen" id="foldopen00035" data-start="{" data-end="};">
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../db/d19/structlinear__probing_1_1_entry.html">   35</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77">   36</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77">Entry</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> = notPresent) : <a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a>(<a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a>) {}  </div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="};">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">   37</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a>;                                            </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>};</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="foldopen" id="foldopen00046" data-start="{" data-end="}">
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">   46</a></span><span class="keywordtype">size_t</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">hashFxn</a>(<span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    std::hash&lt;int&gt; hash;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">return</span> hash(key);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>}</div>
+</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="foldopen" id="foldopen00055" data-start="{" data-end="}">
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">   55</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linearProbe</a>(<span class="keywordtype">int</span> key, <span class="keywordtype">bool</span> searching) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordtype">int</span> hash = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(<a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">hashFxn</a>(key));</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordtype">int</span> i = 0;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> entry;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        <span class="keywordtype">int</span> index = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>((hash + i) % totalSize);</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        entry = table[index];</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordflow">if</span> (searching) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> == notPresent) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>                <span class="keywordflow">return</span> notPresent;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77">searchingProber</a>(entry, key)) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Found key!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                <span class="keywordflow">return</span> index;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Found tombstone or equal hash, checking next&quot;</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>                      &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            i++;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">putProber</a>(entry, key)) {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>                <span class="keywordflow">if</span> (!rehashing) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;Spot found!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>                }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>                <span class="keywordflow">return</span> index;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>            <span class="keywordflow">if</span> (!rehashing) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Spot taken, looking at next&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>            }</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            i++;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        }</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        <span class="keywordflow">if</span> (i == totalSize) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Linear probe failed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            <span class="keywordflow">return</span> notPresent;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    } <span class="keywordflow">while</span> (entry.<a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> != notPresent);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="keywordflow">return</span> notPresent;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>}</div>
+</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="foldopen" id="foldopen00098" data-start="{" data-end="}">
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">   98</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">putProber</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a>&amp; entry, <span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> == notPresent || entry.<a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> == tomb) {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    }</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>}</div>
+</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="foldopen" id="foldopen00110" data-start="{" data-end="}">
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77">  110</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77">searchingProber</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a>&amp; entry, <span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> == key) {</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    }</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>}</div>
+</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="foldopen" id="foldopen00120" data-start="{" data-end="}">
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">  120</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">display</a>() {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; totalSize; i++) {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        <span class="keywordflow">if</span> (table[i].key == notPresent) {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; Empty &quot;</span>;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (table[i].key == tomb) {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; Tomb &quot;</span>;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>            std::cout &lt;&lt; table[i].key;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        }</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    }</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>}</div>
+</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="foldopen" id="foldopen00138" data-start="{" data-end="}">
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0">  138</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0">rehash</a>() {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <span class="comment">// Necessary so wall of add info isn&#39;t printed all at once</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    rehashing = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <span class="keywordtype">int</span> oldSize = totalSize;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    std::vector&lt;Entry&gt; oldTable(table);</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <span class="comment">// Really this should use the next prime number greater than totalSize *</span></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <span class="comment">// 2</span></div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    totalSize *= 2;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    table = std::vector&lt;Entry&gt;(totalSize);</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; oldSize; i++) {</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        <span class="keywordflow">if</span> (oldTable[i].key != -1 &amp;&amp; oldTable[i].key != notPresent) {</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>            size--;  <span class="comment">// Size stays the same (add increments size)</span></div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>            <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1">add</a>(oldTable[i].key);</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>        }</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    }</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    <span class="comment">// delete[] oldTable;</span></div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    rehashing = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Table was rehashed, new size is: &quot;</span> &lt;&lt; totalSize &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>}</div>
+</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span> </div>
+<div class="foldopen" id="foldopen00161" data-start="{" data-end="}">
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1">  161</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1">add</a>(<span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    <span class="keywordtype">int</span> index = <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linearProbe</a>(key, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    table[index].key = key;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    <span class="comment">// Load factor greater than 0.5 causes resizing</span></div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    <span class="keywordflow">if</span> (++size / <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(totalSize) &gt;= 0.5) {</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0">rehash</a>();</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    }</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>}</div>
+</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span> </div>
+<div class="foldopen" id="foldopen00173" data-start="{" data-end="}">
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28">  173</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28">remove</a>(<span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    <span class="keywordtype">int</span> index = <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linearProbe</a>(key, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    <span class="keywordflow">if</span> (index == notPresent) {</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;key not found&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    }</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Removal Successful, leaving tomb&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    table[index].key = tomb;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    size--;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>}</div>
+</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span> </div>
+<div class="foldopen" id="foldopen00186" data-start="{" data-end="}">
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908">  186</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908">addInfo</a>(<span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initial table: &quot;</span>;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">display</a>();</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;hash of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">hashFxn</a>(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>              &lt;&lt; totalSize &lt;&lt; <span class="stringliteral">&quot; == &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">hashFxn</a>(key) % totalSize;</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1">add</a>(key);</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;New table: &quot;</span>;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">display</a>();</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>}</div>
+</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span> </div>
+<div class="foldopen" id="foldopen00201" data-start="{" data-end="}">
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"><a class="line" href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0">  201</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0">removalInfo</a>(<span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initial table: &quot;</span>;</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">display</a>();</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;hash of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">hashFxn</a>(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>              &lt;&lt; totalSize &lt;&lt; <span class="stringliteral">&quot; == &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">hashFxn</a>(key) % totalSize;</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28">remove</a>(key);</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;New table: &quot;</span>;</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">display</a>();</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>}</div>
+</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>}  <span class="comment">// namespace linear_probing</span></div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span><span class="keyword">using </span><a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">linear_probing::Entry</a>;</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span><span class="keyword">using </span>linear_probing::table;</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span><span class="keyword">using </span>linear_probing::totalSize;</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span> </div>
+<div class="foldopen" id="foldopen00224" data-start="{" data-end="}">
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"><a class="line" href="../../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  224</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    <span class="keywordtype">int</span> cmd = 0, hash = 0, key = 0;</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the initial size of Hash Table. = &quot;</span>;</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    std::cin &gt;&gt; totalSize;</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    table = std::vector&lt;Entry&gt;(totalSize);</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    <span class="keywordtype">bool</span> loop = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    <span class="keywordflow">while</span> (loop) {</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;PLEASE CHOOSE -&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;1. Add key. (Numeric only)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;2. Remove key.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;3. Find key.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;4. Generate Hash. (Numeric only)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;5. Display Hash table.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;6. Exit.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>        std::cin &gt;&gt; cmd;</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>        <span class="keywordflow">switch</span> (cmd) {</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>            <span class="keywordflow">case</span> 1:</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter key to add = &quot;</span>;</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>                std::cin &gt;&gt; key;</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>                <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908">linear_probing::addInfo</a>(key);</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>            <span class="keywordflow">case</span> 2:</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter key to remove = &quot;</span>;</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>                std::cin &gt;&gt; key;</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>                <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0">linear_probing::removalInfo</a>(key);</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>            <span class="keywordflow">case</span> 3: {</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter key to search = &quot;</span>;</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>                std::cin &gt;&gt; key;</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>                <a class="code hl_struct" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> entry = table[<a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linear_probing::linearProbe</a>(key, <span class="keyword">true</span>)];</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>                <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> == linear_probing::notPresent) {</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;Key not present&quot;</span>;</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>                }</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>            }</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>            <span class="keywordflow">case</span> 4:</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter element to generate hash = &quot;</span>;</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>                std::cin &gt;&gt; key;</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Hash of &quot;</span> &lt;&lt; key</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>                          &lt;&lt; <span class="stringliteral">&quot; is = &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">linear_probing::hashFxn</a>(key);</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>            <span class="keywordflow">case</span> 5:</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>                <a class="code hl_function" href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">linear_probing::display</a>();</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>            <span class="keywordflow">default</span>:</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>                loop = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>                <span class="comment">// delete[] table;</span></div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>        }</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    }</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>}</div>
+</div>
+</div>
+</div>
+<div class="ttc" id="alinear__probing__hash__table_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00224">linear_probing_hash_table.cpp:224</a></div></div>
+<div class="ttc" id="anamespacelinear__probing_html"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html">linear_probing</a></div><div class="ttdoc">An implementation of hash table using linear probing algorithm.</div></div>
+<div class="ttc" id="anamespacelinear__probing_html_a16680b8a37d442c2f208faa286e33908"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908">linear_probing::addInfo</a></div><div class="ttdeci">void addInfo(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00186">linear_probing_hash_table.cpp:186</a></div></div>
+<div class="ttc" id="anamespacelinear__probing_html_a16d34fd3511626a83ab00665d7bc34d1"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1">linear_probing::add</a></div><div class="ttdeci">void add(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00161">linear_probing_hash_table.cpp:161</a></div></div>
+<div class="ttc" id="anamespacelinear__probing_html_a4bde7a47f98dd1ad24c84038e2608527"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527">linear_probing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdoc">Hash a key. Uses the STL library's std::hash() function.</div><div class="ttdef"><b>Definition</b> <a href="#l00046">linear_probing_hash_table.cpp:46</a></div></div>
+<div class="ttc" id="anamespacelinear__probing_html_a6322209aaa91b7bbf16f96e1cc52b746"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746">linear_probing::linearProbe</a></div><div class="ttdeci">int linearProbe(int key, bool searching)</div><div class="ttdef"><b>Definition</b> <a href="#l00055">linear_probing_hash_table.cpp:55</a></div></div>
+<div class="ttc" id="anamespacelinear__probing_html_a6a082dc1426a79f866cee6b370df37b0"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0">linear_probing::rehash</a></div><div class="ttdeci">void rehash()</div><div class="ttdef"><b>Definition</b> <a href="#l00138">linear_probing_hash_table.cpp:138</a></div></div>
+<div class="ttc" id="anamespacelinear__probing_html_a75854f5aa216e61219154c62167ce8f0"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0">linear_probing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00201">linear_probing_hash_table.cpp:201</a></div></div>
+<div class="ttc" id="anamespacelinear__probing_html_a75d779938df7ebc68581d922b60a2541"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">linear_probing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00098">linear_probing_hash_table.cpp:98</a></div></div>
+<div class="ttc" id="anamespacelinear__probing_html_a942fc8407b8001890ea26830cdcd9d77"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77">linear_probing::searchingProber</a></div><div class="ttdeci">bool searchingProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00110">linear_probing_hash_table.cpp:110</a></div></div>
+<div class="ttc" id="anamespacelinear__probing_html_abcf8d033f8115f39f3c93cfb6cee0b28"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28">linear_probing::remove</a></div><div class="ttdeci">void remove(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00173">linear_probing_hash_table.cpp:173</a></div></div>
+<div class="ttc" id="anamespacelinear__probing_html_ad87b71d810901fab69c4ad9d4d0fa635"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635">linear_probing::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition</b> <a href="#l00120">linear_probing_hash_table.cpp:120</a></div></div>
+<div class="ttc" id="astructlinear__probing_1_1_entry_html"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html">linear_probing::Entry</a></div><div class="ttdef"><b>Definition</b> <a href="#l00035">linear_probing_hash_table.cpp:35</a></div></div>
+<div class="ttc" id="astructlinear__probing_1_1_entry_html_a2139f643a3caf074da1db8a9fa16fa77"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77">linear_probing::Entry::Entry</a></div><div class="ttdeci">Entry(int key=notPresent)</div><div class="ttdoc">constructor</div><div class="ttdef"><b>Definition</b> <a href="#l00036">linear_probing_hash_table.cpp:36</a></div></div>
+<div class="ttc" id="astructlinear__probing_1_1_entry_html_a4d84e90b73022083761f85f8586c4c2a"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">linear_probing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition</b> <a href="#l00037">linear_probing_hash_table.cpp:37</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_ece9b94c107bbaa1dd68197a8c9983b9.html">hashing</a></li><li class="navelem"><a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp.html">linear_probing_hash_table.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/dcc/wiggle__sort_8cpp.html b/d1/dcc/wiggle__sort_8cpp.html
index 57cd53c61..c469425a7 100644
--- a/d1/dcc/wiggle__sort_8cpp.html
+++ b/d1/dcc/wiggle__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/wiggle_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/wiggle_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for wiggle_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d28/wiggle__sort_8cpp__incl.svg" width="512" height="111"><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">
+</div>
+<p><a href="../../d1/dcc/wiggle__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -137,11 +156,11 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a99eeded693ac073717282fae365957a1" id="r_a99eeded693ac073717282fae365957a1"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a99eeded693ac073717282fae365957a1"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a99eeded693ac073717282fae365957a1">sorting::wiggle_sort::wiggleSort</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;arr)</td></tr>
+<tr class="memitem:a99eeded693ac073717282fae365957a1"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a99eeded693ac073717282fae365957a1">sorting::wiggle_sort::wiggleSort</a> (const std::vector&lt; T &gt; &amp;arr)</td></tr>
 <tr class="memdesc:a99eeded693ac073717282fae365957a1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function used for sorting the elements in wave form.  <br /></td></tr>
 <tr class="separator:a99eeded693ac073717282fae365957a1"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ga135e4c638e3bcf548bd122b5f49a3e72" id="r_ga135e4c638e3bcf548bd122b5f49a3e72"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ga135e4c638e3bcf548bd122b5f49a3e72"><td class="memTemplItemLeft" align="right" valign="top">static void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;arr)</td></tr>
+<tr class="memitem:ga135e4c638e3bcf548bd122b5f49a3e72"><td class="memTemplItemLeft" align="right" valign="top">static void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a> (const std::vector&lt; T &gt; &amp;arr)</td></tr>
 <tr class="memdesc:ga135e4c638e3bcf548bd122b5f49a3e72"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function used for printing the elements. Prints elements of the array after they're sorted using wiggle sort algorithm.  <br /></td></tr>
 <tr class="separator:ga135e4c638e3bcf548bd122b5f49a3e72"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:gaa8dca7b867074164d5f45b0f3851269d" id="r_gaa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -153,6 +172,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>[Wiggle Sort Algorithm] (<a href="https://leetcode.com/problems/wiggle-sort-ii/">https://leetcode.com/problems/wiggle-sort-ii/</a>) Implementation </p>
 <dl class="section author"><dt>Author</dt><dd><a href="http://github.com/roshan0708" target="_blank">Roshan Kanwar</a></dd></dl>
 <p>Wiggle Sort sorts the array into a wave like array. An array ‘arr[0..n-1]’ is sorted in wave form, if arr[0] &gt;= arr[1] &lt;= arr[2] &gt;= arr[3] &lt;= arr[4] &gt;= ….. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d1/dcc/wiggle__sort_8cpp_source.html">wiggle_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a99eeded693ac073717282fae365957a1" name="a99eeded693ac073717282fae365957a1"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a99eeded693ac073717282fae365957a1">&#9670;&#160;</a></span>wiggleSort()</h2>
@@ -163,9 +184,9 @@ Functions</h2></td></tr>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; sorting::wiggle_sort::wiggleSort </td>
+          <td class="memname">std::vector&lt; T &gt; sorting::wiggle_sort::wiggleSort </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -179,36 +200,30 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
-<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html#a1">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp</a>.</dd>
+<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html#a0">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp</a>.</dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dcc/wiggle__sort_8cpp_source.html#l00054">54</a> of file <a class="el" href="../../d1/dcc/wiggle__sort_8cpp_source.html">wiggle_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   54</span>                                                 {</div>
-<div class="line"><span class="lineno">   55</span>    uint32_t size = 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">   55</span>    uint32_t size = arr.size();</div>
 <div class="line"><span class="lineno">   56</span> </div>
-<div class="line"><span class="lineno">   57</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> out(</div>
+<div class="line"><span class="lineno">   57</span>    std::vector&lt;T&gt; out(</div>
 <div class="line"><span class="lineno">   58</span>        arr);  <span class="comment">// create a copy of input vector. this way, the original input</span></div>
 <div class="line"><span class="lineno">   59</span>               <span class="comment">// vector does not get modified. a sorted array is is returned.</span></div>
 <div class="line"><span class="lineno">   60</span> </div>
 <div class="line"><span class="lineno">   61</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i += 2) {</div>
 <div class="line"><span class="lineno">   62</span>        <span class="keywordflow">if</span> (i &gt; 0 &amp;&amp; out[i - 1] &gt; out[i]) {</div>
-<div class="line"><span class="lineno">   63</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(out[i], out[i - 1]);  <span class="comment">// swapping the two values</span></div>
+<div class="line"><span class="lineno">   63</span>            std::swap(out[i], out[i - 1]);  <span class="comment">// swapping the two values</span></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="keywordflow">if</span> (i &lt; size - 1 &amp;&amp; out[i] &lt; out[i + 1]) {</div>
-<div class="line"><span class="lineno">   67</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(out[i], out[i + 1]);  <span class="comment">// swapping the two values</span></div>
+<div class="line"><span class="lineno">   67</span>            std::swap(out[i], out[i + 1]);  <span class="comment">// swapping the two values</span></div>
 <div class="line"><span class="lineno">   68</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">return</span> out;  <span class="comment">// returns the sorted vector</span></div>
 <div class="line"><span class="lineno">   72</span>}</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="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/dcc/wiggle__sort_8cpp_a99eeded693ac073717282fae365957a1_cgraph.svg" width="308" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d1/dcc/wiggle__sort_8cpp_a99eeded693ac073717282fae365957a1_cgraph.map b/d1/dcc/wiggle__sort_8cpp_a99eeded693ac073717282fae365957a1_cgraph.map
deleted file mode 100644
index c6041e4c5..000000000
--- a/d1/dcc/wiggle__sort_8cpp_a99eeded693ac073717282fae365957a1_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="sorting::wiggle_sort::wiggleSort" name="sorting::wiggle_sort::wiggleSort">
-<area shape="rect" id="Node000001" title="Function used for sorting the elements in wave form." alt="" coords="5,29,140,70"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="39,29,38,19,43,10,55,5,73,3,92,5,103,11,100,16,90,10,72,8,56,10,47,14,43,20,44,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="188,12,303,37"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="140,37,171,32,172,38,141,42"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="206,61,284,86"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="140,56,191,64,191,69,140,62"/>
-</map>
diff --git a/d1/dcc/wiggle__sort_8cpp_a99eeded693ac073717282fae365957a1_cgraph.md5 b/d1/dcc/wiggle__sort_8cpp_a99eeded693ac073717282fae365957a1_cgraph.md5
deleted file mode 100644
index 134c01ed9..000000000
--- a/d1/dcc/wiggle__sort_8cpp_a99eeded693ac073717282fae365957a1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d47c2d83ccb858443aceeb7daeff5106
\ No newline at end of file
diff --git a/d1/dcc/wiggle__sort_8cpp_a99eeded693ac073717282fae365957a1_cgraph.svg b/d1/dcc/wiggle__sort_8cpp_a99eeded693ac073717282fae365957a1_cgraph.svg
deleted file mode 100644
index 5d7c5fbe0..000000000
--- a/d1/dcc/wiggle__sort_8cpp_a99eeded693ac073717282fae365957a1_cgraph.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::wiggle_sort::wiggleSort Pages: 1 -->
-<svg width="231pt" height="69pt"
- viewBox="0.00 0.00 231.25 68.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64.88)">
-<title>sorting::wiggle_sort::wiggleSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function used for sorting the elements in wave form.">
-<polygon fill="#999999" stroke="#666666" points="100.75,-42.88 0,-42.88 0,-12.37 100.75,-12.37 100.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::wiggle_sort</text>
-<text text-anchor="middle" x="50.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::wiggleSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.41,-43.36C22.72,-52.43 30.37,-60.88 50.38,-60.88 61.31,-60.88 68.56,-58.35 72.11,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.57,-55.19 73.18,-44.87 68.61,-54.42 75.57,-55.19"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.25,-56.25 136.75,-56.25 136.75,-37 223.25,-37 223.25,-56.25"/>
-<text text-anchor="middle" x="180" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.08,-35.03C108.89,-36.19 116.99,-37.39 124.89,-38.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.36,-42.03 134.76,-40.04 125.39,-35.11 124.36,-42.03"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209.38,-19.25 150.62,-19.25 150.62,0 209.38,0 209.38,-19.25"/>
-<text text-anchor="middle" x="180" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.08,-20.61C113.71,-18.83 127.11,-16.94 139.17,-15.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.34,-18.75 148.75,-13.89 138.36,-11.82 139.34,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/dcc/wiggle__sort_8cpp_a99eeded693ac073717282fae365957a1_cgraph_org.svg b/d1/dcc/wiggle__sort_8cpp_a99eeded693ac073717282fae365957a1_cgraph_org.svg
deleted file mode 100644
index baaf2c5d8..000000000
--- a/d1/dcc/wiggle__sort_8cpp_a99eeded693ac073717282fae365957a1_cgraph_org.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::wiggle_sort::wiggleSort Pages: 1 -->
-<svg width="231pt" height="69pt"
- viewBox="0.00 0.00 231.25 68.88" 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 64.88)">
-<title>sorting::wiggle_sort::wiggleSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function used for sorting the elements in wave form.">
-<polygon fill="#999999" stroke="#666666" points="100.75,-42.88 0,-42.88 0,-12.37 100.75,-12.37 100.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::wiggle_sort</text>
-<text text-anchor="middle" x="50.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::wiggleSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.41,-43.36C22.72,-52.43 30.37,-60.88 50.38,-60.88 61.31,-60.88 68.56,-58.35 72.11,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.57,-55.19 73.18,-44.87 68.61,-54.42 75.57,-55.19"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.25,-56.25 136.75,-56.25 136.75,-37 223.25,-37 223.25,-56.25"/>
-<text text-anchor="middle" x="180" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.08,-35.03C108.89,-36.19 116.99,-37.39 124.89,-38.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.36,-42.03 134.76,-40.04 125.39,-35.11 124.36,-42.03"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209.38,-19.25 150.62,-19.25 150.62,0 209.38,0 209.38,-19.25"/>
-<text text-anchor="middle" x="180" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.08,-20.61C113.71,-18.83 127.11,-16.94 139.17,-15.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.34,-18.75 148.75,-13.89 138.36,-11.82 139.34,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/dcc/wiggle__sort_8cpp_source.html b/d1/dcc/wiggle__sort_8cpp_source.html
new file mode 100644
index 000000000..b2de21125
--- /dev/null
+++ b/d1/dcc/wiggle__sort_8cpp_source.html
@@ -0,0 +1,227 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/wiggle_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/dcc/wiggle__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">wiggle_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d1/dcc/wiggle__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/d52/namespacewiggle__sort.html">wiggle_sort</a> {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;  <span class="comment">// this allows to have vectors of ints, double, float,</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>                       <span class="comment">// etc</span></div>
+<div class="foldopen" id="foldopen00054" data-start="{" data-end="}">
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="../../d1/dcc/wiggle__sort_8cpp.html#a99eeded693ac073717282fae365957a1">   54</a></span>std::vector&lt;T&gt; <a class="code hl_function" href="../../d1/dcc/wiggle__sort_8cpp.html#a99eeded693ac073717282fae365957a1">wiggleSort</a>(<span class="keyword">const</span> std::vector&lt;T&gt; &amp;arr) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    uint32_t size = arr.size();</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    std::vector&lt;T&gt; out(</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        arr);  <span class="comment">// create a copy of input vector. this way, the original input</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>               <span class="comment">// vector does not get modified. a sorted array is is returned.</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i += 2) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordflow">if</span> (i &gt; 0 &amp;&amp; out[i - 1] &gt; out[i]) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            std::swap(out[i], out[i - 1]);  <span class="comment">// swapping the two values</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="keywordflow">if</span> (i &lt; size - 1 &amp;&amp; out[i] &lt; out[i + 1]) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            std::swap(out[i], out[i + 1]);  <span class="comment">// swapping the two values</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordflow">return</span> out;  <span class="comment">// returns the sorted vector</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>}</div>
+</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>}  <span class="comment">// namespace wiggle_sort</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00086" data-start="{" data-end="}">
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">   86</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a>(<span class="keyword">const</span> std::vector&lt;T&gt; &amp;arr) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    uint32_t size = arr.size();</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted elements are as follows: &quot;</span>;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;[&quot;</span>;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        std::cout &lt;&lt; arr[i];</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        <span class="keywordflow">if</span> (i != size - 1) {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        }</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    }</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;]&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>}</div>
+</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="foldopen" id="foldopen00107" data-start="{" data-end="}">
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"><a class="line" href="../../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d">  107</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    std::srand(std::time(<span class="keyword">nullptr</span>));  <span class="comment">// initialize random number generator</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    std::vector&lt;float&gt; data1(100);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;d : data1) {  <span class="comment">// generate random numbers between -5.0 and 4.99</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        d = float(std::rand() % 1000 - 500) / 100.f;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    }</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    std::vector&lt;float&gt; sorted = sorting::wiggle_sort::wiggleSort&lt;float&gt;(data1);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <a class="code hl_function" href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a>(sorted);</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <span class="keywordflow">for</span> (uint32_t j = 0; j &lt; data1.size(); j += 2) {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        assert(data1[j] &lt;= data1[j + 1] &amp;&amp;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>               data1[j + 1] &gt;= data1[j + 2]);  <span class="comment">// check the validation condition</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    }</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 passed\n&quot;</span>;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>}</div>
+</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    <a class="code hl_function" href="../../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>}</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="agroup__sorting_html_ga135e4c638e3bcf548bd122b5f49a3e72"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a></div><div class="ttdeci">static void displayElements(const std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Utility function used for printing the elements. Prints elements of the array after they're sorted us...</div><div class="ttdef"><b>Definition</b> <a href="#l00086">wiggle_sort.cpp:86</a></div></div>
+<div class="ttc" id="agroup__sorting_html_gaa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00107">wiggle_sort.cpp:107</a></div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+<div class="ttc" id="anamespacewiggle__sort_html"><div class="ttname"><a href="../../d0/d52/namespacewiggle__sort.html">wiggle_sort</a></div><div class="ttdoc">Functions for Wiggle Sort algorithm.</div></div>
+<div class="ttc" id="awiggle__sort_8cpp_html_a99eeded693ac073717282fae365957a1"><div class="ttname"><a href="../../d1/dcc/wiggle__sort_8cpp.html#a99eeded693ac073717282fae365957a1">sorting::wiggle_sort::wiggleSort</a></div><div class="ttdeci">std::vector&lt; T &gt; wiggleSort(const std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Function used for sorting the elements in wave form.</div><div class="ttdef"><b>Definition</b> <a href="#l00054">wiggle_sort.cpp:54</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d1/dcc/wiggle__sort_8cpp.html">wiggle_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.map b/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.map
index b3ec9ab01..242df6e83 100644
--- a/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.map
+++ b/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.map
@@ -1,8 +1,8 @@
 <map id="data_structures::trie_using_hashmap::Trie::Node" name="data_structures::trie_using_hashmap::Trie::Node">
 <area shape="rect" id="Node000001" title="struct representing a trie node." alt="" coords="5,58,194,99"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="261,5,423,61"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="261,5,423,61"/>
 <area shape="poly" id="edge3_Node000003_Node000001" title=" " alt="" coords="209,55,260,46,261,51,210,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map.html" title=" " alt="" coords="528,36,695,121"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="528,36,695,121"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="512,87,423,91,261,91,194,88,194,82,261,86,423,86,512,82"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="439,47,528,62,527,67,438,52"/>
 </map>
diff --git a/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.md5 b/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.md5
index 85cdc5062..833ee007a 100644
--- a/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.md5
+++ b/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.md5
@@ -1 +1 @@
-55e30b5558d59953848529fa0fcacb38
\ No newline at end of file
+014504e5188f5e0235e95c3a3d6e6719
\ No newline at end of file
diff --git a/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.svg b/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.svg
index 57a95b3b0..370df8572 100644
--- a/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.svg
+++ b/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph.svg
@@ -68,7 +68,7 @@ var sectionId = 'dynsection-0';
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="313.25,-87 191.5,-87 191.5,-45.25 313.25,-45.25 313.25,-87"/>
 <text text-anchor="start" x="199.5" y="-73.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; data</text>
 <text text-anchor="start" x="199.5" y="-62.25" font-family="Helvetica,sans-Serif" font-size="10.00">_structures::trie_using</text>
@@ -89,7 +89,7 @@ var sectionId = 'dynsection-0';
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="517.5,-64.25 392,-64.25 392,0 517.5,0 517.5,-64.25"/>
 <text text-anchor="start" x="400" y="-50.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
 <text text-anchor="start" x="400" y="-39.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; char16_t, std::shared</text>
diff --git a/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph_org.svg b/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph_org.svg
index 5aec37d6d..5052d2cbd 100644
--- a/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph_org.svg
+++ b/d1/dda/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node__coll__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="313.25,-87 191.5,-87 191.5,-45.25 313.25,-45.25 313.25,-87"/>
 <text text-anchor="start" x="199.5" y="-73.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; data</text>
 <text text-anchor="start" x="199.5" y="-62.25" font-family="Helvetica,sans-Serif" font-size="10.00">_structures::trie_using</text>
@@ -42,7 +42,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="517.5,-64.25 392,-64.25 392,0 517.5,0 517.5,-64.25"/>
 <text text-anchor="start" x="400" y="-50.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
 <text text-anchor="start" x="400" y="-39.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; char16_t, std::shared</text>
diff --git a/d1/de0/namespacenumerical__methods.html b/d1/de0/namespacenumerical__methods.html
index afbc1f73b..a708ed7a9 100644
--- a/d1/de0/namespacenumerical__methods.html
+++ b/d1/de0/namespacenumerical__methods.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods Namespace Reference</title>
+<title>TheAlgorithms/C++: numerical_methods Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,31 +135,31 @@ Functions</h2></td></tr>
 <tr class="memitem:a28e67885f8606564cc8335f483f63309" id="r_a28e67885f8606564cc8335f483f63309"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a28e67885f8606564cc8335f483f63309">babylonian_method</a> (double radicand)</td></tr>
 <tr class="memdesc:a28e67885f8606564cc8335f483f63309"><td class="mdescLeft">&#160;</td><td class="mdescRight">Babylonian methods is an iterative function which returns square root of radicand.  <br /></td></tr>
 <tr class="separator:a28e67885f8606564cc8335f483f63309"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a158fd271b9a53e8f3f60b08b18857150" id="r_a158fd271b9a53e8f3f60b08b18857150"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a158fd271b9a53e8f3f60b08b18857150">FastFourierTransform</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; *p, uint8_t n)</td></tr>
+<tr class="memitem:a158fd271b9a53e8f3f60b08b18857150" id="r_a158fd271b9a53e8f3f60b08b18857150"><td class="memItemLeft" align="right" valign="top">std::complex&lt; double &gt; *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a158fd271b9a53e8f3f60b08b18857150">FastFourierTransform</a> (std::complex&lt; double &gt; *p, uint8_t n)</td></tr>
 <tr class="memdesc:a158fd271b9a53e8f3f60b08b18857150"><td class="mdescLeft">&#160;</td><td class="mdescRight">FastFourierTransform is a recursive function which returns list of complex numbers.  <br /></td></tr>
 <tr class="separator:a158fd271b9a53e8f3f60b08b18857150"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aee56dc85997b8cd42bad71a5d6bd2d93" id="r_aee56dc85997b8cd42bad71a5d6bd2d93"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aee56dc85997b8cd42bad71a5d6bd2d93">InverseFastFourierTransform</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; *p, uint8_t n)</td></tr>
+<tr class="memitem:aee56dc85997b8cd42bad71a5d6bd2d93" id="r_aee56dc85997b8cd42bad71a5d6bd2d93"><td class="memItemLeft" align="right" valign="top">std::complex&lt; double &gt; *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aee56dc85997b8cd42bad71a5d6bd2d93">InverseFastFourierTransform</a> (std::complex&lt; double &gt; *p, uint8_t n)</td></tr>
 <tr class="memdesc:aee56dc85997b8cd42bad71a5d6bd2d93"><td class="mdescLeft">&#160;</td><td class="mdescRight">InverseFastFourierTransform is a recursive function which returns list of complex numbers.  <br /></td></tr>
 <tr class="separator:aee56dc85997b8cd42bad71a5d6bd2d93"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>for assert </p>
 <p>Numerical Methods.</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a> container</p>
+<p>for std::map container</p>
 <p>for storing points and coefficents</p>
 <p>for io operations</p>
 <p>for math functions</p>
 <p>for IO operations</p>
 <p>Numerical algorithms/methods</p>
-<p>for assert for integer allocation for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a> for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a> container</p>
+<p>for assert for integer allocation for std::atof for std::function for IO operations for std::map container</p>
 <p>Numerical algorithms/methods</p>
 <p>for math operations</p>
 <p>Numerical methods</p>
-<p>for assert for mathematical-related functions 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 assert for mathematical-related functions for IO operations for std::vector</p>
 <p>Numerical algorithms/methods</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for assert for fabs</p>
+<p>for std::array for assert for fabs</p>
 <p>Numerical Methods algorithms</p>
-<p>for assert for math functions for integer allocation for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a> for IO operations</p>
+<p>for assert for math functions for integer allocation for std::atof for std::function for IO operations</p>
 <p>Numerical algorithms/methods </p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a28e67885f8606564cc8335f483f63309" name="a28e67885f8606564cc8335f483f63309"></a>
@@ -175,36 +192,31 @@ Functions</h2></td></tr>
 <p>Temp variable to x0 and x1</p>
 <p>Newly calculated root</p>
 <p>Returning final root</p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d9c/babylonian__method_8cpp_source.html#l00030">30</a> of file <a class="el" href="../../dc/d9c/babylonian__method_8cpp_source.html">babylonian_method.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   30</span>                                          {</div>
-<div class="line"><span class="lineno">   31</span>    <span class="keywordtype">int</span> i = 1;  <span class="comment">/// To find initial root or rough approximation</span></div>
+<div class="line"><span class="lineno">   31</span>    <span class="keywordtype">int</span> i = 1;  </div>
 <div class="line"><span class="lineno">   32</span> </div>
 <div class="line"><span class="lineno">   33</span>    <span class="keywordflow">while</span> (i * i &lt;= radicand) {</div>
 <div class="line"><span class="lineno">   34</span>        i++;</div>
 <div class="line"><span class="lineno">   35</span>    }</div>
 <div class="line"><span class="lineno">   36</span> </div>
-<div class="line"><span class="lineno">   37</span>    i--;  <span class="comment">/// Real Initial value will be i-1 as loop stops on +1 value</span></div>
+<div class="line"><span class="lineno">   37</span>    i--;  </div>
 <div class="line"><span class="lineno">   38</span> </div>
-<div class="line"><span class="lineno">   39</span>    <span class="keywordtype">double</span> x0 = i;  <span class="comment">/// Storing previous value for comparison</span></div>
+<div class="line"><span class="lineno">   39</span>    <span class="keywordtype">double</span> x0 = i;  </div>
 <div class="line"><span class="lineno">   40</span>    <span class="keywordtype">double</span> x1 =</div>
-<div class="line"><span class="lineno">   41</span>        (radicand / x0 + x0) / 2;  <span class="comment">/// Storing calculated value for comparison</span></div>
-<div class="line"><span class="lineno">   42</span>    <span class="keywordtype">double</span> temp = NAN;             <span class="comment">/// Temp variable to x0 and x1</span></div>
+<div class="line"><span class="lineno">   41</span>        (radicand / x0 + x0) / 2;  </div>
+<div class="line"><span class="lineno">   42</span>    <span class="keywordtype">double</span> temp = NAN;             </div>
 <div class="line"><span class="lineno">   43</span> </div>
-<div class="line"><span class="lineno">   44</span>    <span class="keywordflow">while</span> (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(x0, x1) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(x0, x1) &lt; 0.0001) {</div>
-<div class="line"><span class="lineno">   45</span>        temp = (radicand / x1 + x1) / 2;  <span class="comment">/// Newly calculated root</span></div>
+<div class="line"><span class="lineno">   44</span>    <span class="keywordflow">while</span> (std::max(x0, x1) - std::min(x0, x1) &lt; 0.0001) {</div>
+<div class="line"><span class="lineno">   45</span>        temp = (radicand / x1 + x1) / 2;  </div>
 <div class="line"><span class="lineno">   46</span>        x0 = x1;</div>
 <div class="line"><span class="lineno">   47</span>        x1 = temp;</div>
 <div class="line"><span class="lineno">   48</span>    }</div>
 <div class="line"><span class="lineno">   49</span> </div>
-<div class="line"><span class="lineno">   50</span>    <span class="keywordflow">return</span> x1;  <span class="comment">/// Returning final root</span></div>
+<div class="line"><span class="lineno">   50</span>    <span class="keywordflow">return</span> x1;  </div>
 <div class="line"><span class="lineno">   51</span>}</div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="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><!-- 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="../../d1/de0/namespacenumerical__methods_a28e67885f8606564cc8335f483f63309_cgraph.svg" width="274" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a158fd271b9a53e8f3f60b08b18857150" name="a158fd271b9a53e8f3f60b08b18857150"></a>
@@ -214,9 +226,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; * numerical_methods::FastFourierTransform </td>
+          <td class="memname">std::complex&lt; double &gt; * numerical_methods::FastFourierTransform </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>p</em></span>, </td>
+          <td class="paramtype">std::complex&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>p</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -251,45 +263,47 @@ y if n!=1 </dd></dl>
 <p>Updating the last n/2 elements</p>
 <p>Deleting dynamic array ye</p>
 <p>Deleting dynamic array yo</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d9a/fast__fourier__transform_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d8/d9a/fast__fourier__transform_8cpp_source.html">fast_fourier_transform.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   42</span>                                                                           {</div>
 <div class="line"><span class="lineno">   43</span>    <span class="keywordflow">if</span> (n == 1) {</div>
-<div class="line"><span class="lineno">   44</span>        <span class="keywordflow">return</span> p;  <span class="comment">/// Base Case To return</span></div>
+<div class="line"><span class="lineno">   44</span>        <span class="keywordflow">return</span> p;  </div>
 <div class="line"><span class="lineno">   45</span>    }</div>
 <div class="line"><span class="lineno">   46</span> </div>
-<div class="line"><span class="lineno">   47</span>    <span class="keywordtype">double</span> pi = 2 * asin(1.0);  <span class="comment">/// Declaring value of pi</span></div>
+<div class="line"><span class="lineno">   47</span>    <span class="keywordtype">double</span> pi = 2 * asin(1.0);  </div>
 <div class="line"><span class="lineno">   48</span> </div>
-<div class="line"><span class="lineno">   49</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> om = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>(</div>
-<div class="line"><span class="lineno">   50</span>        cos(2 * pi / n), sin(2 * pi / n));  <span class="comment">/// Calculating value of omega</span></div>
+<div class="line"><span class="lineno">   49</span>    std::complex&lt;double&gt; om = std::complex&lt;double&gt;(</div>
+<div class="line"><span class="lineno">   50</span>        cos(2 * pi / n), sin(2 * pi / n));  </div>
 <div class="line"><span class="lineno">   51</span> </div>
-<div class="line"><span class="lineno">   52</span>    <span class="keyword">auto</span> *pe = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[n / 2];  <span class="comment">/// Coefficients of even power</span></div>
+<div class="line"><span class="lineno">   52</span>    <span class="keyword">auto</span> *pe = <span class="keyword">new</span> std::complex&lt;double&gt;[n / 2];  </div>
 <div class="line"><span class="lineno">   53</span> </div>
-<div class="line"><span class="lineno">   54</span>    <span class="keyword">auto</span> *po = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[n / 2];  <span class="comment">/// Coefficients of odd power</span></div>
+<div class="line"><span class="lineno">   54</span>    <span class="keyword">auto</span> *po = <span class="keyword">new</span> std::complex&lt;double&gt;[n / 2];  </div>
 <div class="line"><span class="lineno">   55</span> </div>
 <div class="line"><span class="lineno">   56</span>    <span class="keywordtype">int</span> k1 = 0, k2 = 0;</div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
 <div class="line"><span class="lineno">   58</span>        <span class="keywordflow">if</span> (j % 2 == 0) {</div>
-<div class="line"><span class="lineno">   59</span>            pe[k1++] = p[j];  <span class="comment">/// Assigning values of even Coefficients</span></div>
+<div class="line"><span class="lineno">   59</span>            pe[k1++] = p[j];  </div>
 <div class="line"><span class="lineno">   60</span> </div>
 <div class="line"><span class="lineno">   61</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   62</span>            po[k2++] = p[j];  <span class="comment">/// Assigning value of odd Coefficients</span></div>
+<div class="line"><span class="lineno">   62</span>            po[k2++] = p[j];  </div>
 <div class="line"><span class="lineno">   63</span>        }</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>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *ye =</div>
-<div class="line"><span class="lineno">   67</span>        <a class="code hl_function" href="#a158fd271b9a53e8f3f60b08b18857150">FastFourierTransform</a>(pe, n / 2);  <span class="comment">/// Recursive Call</span></div>
+<div class="line"><span class="lineno">   66</span>    std::complex&lt;double&gt; *ye =</div>
+<div class="line"><span class="lineno">   67</span>        <a class="code hl_function" href="#a158fd271b9a53e8f3f60b08b18857150">FastFourierTransform</a>(pe, n / 2);  </div>
 <div class="line"><span class="lineno">   68</span> </div>
-<div class="line"><span class="lineno">   69</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *yo =</div>
-<div class="line"><span class="lineno">   70</span>        <a class="code hl_function" href="#a158fd271b9a53e8f3f60b08b18857150">FastFourierTransform</a>(po, n / 2);  <span class="comment">/// Recursive Call</span></div>
+<div class="line"><span class="lineno">   69</span>    std::complex&lt;double&gt; *yo =</div>
+<div class="line"><span class="lineno">   70</span>        <a class="code hl_function" href="#a158fd271b9a53e8f3f60b08b18857150">FastFourierTransform</a>(po, n / 2);  </div>
 <div class="line"><span class="lineno">   71</span> </div>
-<div class="line"><span class="lineno">   72</span>    <span class="keyword">auto</span> *y = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[n];  <span class="comment">/// Final value representation list</span></div>
+<div class="line"><span class="lineno">   72</span>    <span class="keyword">auto</span> *y = <span class="keyword">new</span> std::complex&lt;double&gt;[n];  </div>
 <div class="line"><span class="lineno">   73</span> </div>
 <div class="line"><span class="lineno">   74</span>    k1 = 0, k2 = 0;</div>
 <div class="line"><span class="lineno">   75</span> </div>
 <div class="line"><span class="lineno">   76</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n / 2; i++) {</div>
 <div class="line"><span class="lineno">   77</span>        y[i] =</div>
-<div class="line"><span class="lineno">   78</span>            ye[k1] + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">pow</a>(om, i) * yo[k2];  <span class="comment">/// Updating the first n/2 elements</span></div>
+<div class="line"><span class="lineno">   78</span>            ye[k1] + pow(om, i) * yo[k2];  </div>
 <div class="line"><span class="lineno">   79</span>        y[i + n / 2] =</div>
-<div class="line"><span class="lineno">   80</span>            ye[k1] - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">pow</a>(om, i) * yo[k2];  <span class="comment">/// Updating the last n/2 elements</span></div>
+<div class="line"><span class="lineno">   80</span>            ye[k1] - pow(om, i) * yo[k2];  </div>
 <div class="line"><span class="lineno">   81</span> </div>
 <div class="line"><span class="lineno">   82</span>        k1++;</div>
 <div class="line"><span class="lineno">   83</span>        k2++;</div>
@@ -300,19 +314,12 @@ y if n!=1 </dd></dl>
 <div class="line"><span class="lineno">   88</span>        <span class="keyword">delete</span>[] po;</div>
 <div class="line"><span class="lineno">   89</span>    }</div>
 <div class="line"><span class="lineno">   90</span> </div>
-<div class="line"><span class="lineno">   91</span>    <span class="keyword">delete</span>[] ye;  <span class="comment">/// Deleting dynamic array ye</span></div>
-<div class="line"><span class="lineno">   92</span>    <span class="keyword">delete</span>[] yo;  <span class="comment">/// Deleting dynamic array yo</span></div>
+<div class="line"><span class="lineno">   91</span>    <span class="keyword">delete</span>[] ye;  </div>
+<div class="line"><span class="lineno">   92</span>    <span class="keyword">delete</span>[] yo;  </div>
 <div class="line"><span class="lineno">   93</span>    <span class="keywordflow">return</span> y;</div>
 <div class="line"><span class="lineno">   94</span>}</div>
-<div class="ttc" id="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div></div>
-<div class="ttc" id="anamespacenumerical__methods_html_a158fd271b9a53e8f3f60b08b18857150"><div class="ttname"><a href="#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a></div><div class="ttdeci">std::complex&lt; double &gt; * FastFourierTransform(std::complex&lt; double &gt; *p, uint8_t n)</div><div class="ttdoc">FastFourierTransform is a recursive function which returns list of complex numbers.</div><div class="ttdef"><b>Definition</b> fast_fourier_transform.cpp:42</div></div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/de0/namespacenumerical__methods_a158fd271b9a53e8f3f60b08b18857150_cgraph.svg" width="158" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacenumerical__methods_html_a158fd271b9a53e8f3f60b08b18857150"><div class="ttname"><a href="#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a></div><div class="ttdeci">std::complex&lt; double &gt; * FastFourierTransform(std::complex&lt; double &gt; *p, uint8_t n)</div><div class="ttdoc">FastFourierTransform is a recursive function which returns list of complex numbers.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d9a/fast__fourier__transform_8cpp_source.html#l00042">fast_fourier_transform.cpp:42</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aee56dc85997b8cd42bad71a5d6bd2d93" name="aee56dc85997b8cd42bad71a5d6bd2d93"></a>
@@ -322,9 +329,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; * numerical_methods::InverseFastFourierTransform </td>
+          <td class="memname">std::complex&lt; double &gt; * numerical_methods::InverseFastFourierTransform </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>p</em></span>, </td>
+          <td class="paramtype">std::complex&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>p</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -361,48 +368,50 @@ y if n!=1 </dd></dl>
 <p>Updating the last n/2 elements</p>
 <p>Deleting dynamic array ye</p>
 <p>Deleting dynamic array yo</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d37/inverse__fast__fourier__transform_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../d9/d37/inverse__fast__fourier__transform_8cpp_source.html">inverse_fast_fourier_transform.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   35</span>                                                             {</div>
 <div class="line"><span class="lineno">   36</span>    <span class="keywordflow">if</span> (n == 1) {</div>
-<div class="line"><span class="lineno">   37</span>        <span class="keywordflow">return</span> p;  <span class="comment">/// Base Case To return</span></div>
+<div class="line"><span class="lineno">   37</span>        <span class="keywordflow">return</span> p;  </div>
 <div class="line"><span class="lineno">   38</span>    }</div>
 <div class="line"><span class="lineno">   39</span> </div>
-<div class="line"><span class="lineno">   40</span>    <span class="keywordtype">double</span> pi = 2 * asin(1.0);  <span class="comment">/// Declaring value of pi</span></div>
+<div class="line"><span class="lineno">   40</span>    <span class="keywordtype">double</span> pi = 2 * asin(1.0);  </div>
 <div class="line"><span class="lineno">   41</span> </div>
-<div class="line"><span class="lineno">   42</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> om = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>(</div>
-<div class="line"><span class="lineno">   43</span>        cos(2 * pi / n), sin(2 * pi / n));  <span class="comment">/// Calculating value of omega</span></div>
+<div class="line"><span class="lineno">   42</span>    std::complex&lt;double&gt; om = std::complex&lt;double&gt;(</div>
+<div class="line"><span class="lineno">   43</span>        cos(2 * pi / n), sin(2 * pi / n));  </div>
 <div class="line"><span class="lineno">   44</span> </div>
-<div class="line"><span class="lineno">   45</span>    om.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">real</a>(om.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">real</a>() / n);  <span class="comment">/// One change in comparison with DFT</span></div>
-<div class="line"><span class="lineno">   46</span>    om.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">imag</a>(om.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">imag</a>() / n);  <span class="comment">/// One change in comparison with DFT</span></div>
+<div class="line"><span class="lineno">   45</span>    om.real(om.real() / n);  </div>
+<div class="line"><span class="lineno">   46</span>    om.imag(om.imag() / n);  </div>
 <div class="line"><span class="lineno">   47</span> </div>
-<div class="line"><span class="lineno">   48</span>    <span class="keyword">auto</span> *pe = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[n / 2];  <span class="comment">/// Coefficients of even power</span></div>
+<div class="line"><span class="lineno">   48</span>    <span class="keyword">auto</span> *pe = <span class="keyword">new</span> std::complex&lt;double&gt;[n / 2];  </div>
 <div class="line"><span class="lineno">   49</span> </div>
-<div class="line"><span class="lineno">   50</span>    <span class="keyword">auto</span> *po = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[n / 2];  <span class="comment">/// Coefficients of odd power</span></div>
+<div class="line"><span class="lineno">   50</span>    <span class="keyword">auto</span> *po = <span class="keyword">new</span> std::complex&lt;double&gt;[n / 2];  </div>
 <div class="line"><span class="lineno">   51</span> </div>
 <div class="line"><span class="lineno">   52</span>    <span class="keywordtype">int</span> k1 = 0, k2 = 0;</div>
 <div class="line"><span class="lineno">   53</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
 <div class="line"><span class="lineno">   54</span>        <span class="keywordflow">if</span> (j % 2 == 0) {</div>
-<div class="line"><span class="lineno">   55</span>            pe[k1++] = p[j];  <span class="comment">/// Assigning values of even Coefficients</span></div>
+<div class="line"><span class="lineno">   55</span>            pe[k1++] = p[j];  </div>
 <div class="line"><span class="lineno">   56</span> </div>
 <div class="line"><span class="lineno">   57</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   58</span>            po[k2++] = p[j];  <span class="comment">/// Assigning value of odd Coefficients</span></div>
+<div class="line"><span class="lineno">   58</span>            po[k2++] = p[j];  </div>
 <div class="line"><span class="lineno">   59</span>        }</div>
 <div class="line"><span class="lineno">   60</span>    }</div>
 <div class="line"><span class="lineno">   61</span> </div>
-<div class="line"><span class="lineno">   62</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *ye =</div>
-<div class="line"><span class="lineno">   63</span>        <a class="code hl_function" href="#aee56dc85997b8cd42bad71a5d6bd2d93">InverseFastFourierTransform</a>(pe, n / 2);  <span class="comment">/// Recursive Call</span></div>
+<div class="line"><span class="lineno">   62</span>    std::complex&lt;double&gt; *ye =</div>
+<div class="line"><span class="lineno">   63</span>        <a class="code hl_function" href="#aee56dc85997b8cd42bad71a5d6bd2d93">InverseFastFourierTransform</a>(pe, n / 2);  </div>
 <div class="line"><span class="lineno">   64</span> </div>
-<div class="line"><span class="lineno">   65</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *yo =</div>
-<div class="line"><span class="lineno">   66</span>        <a class="code hl_function" href="#aee56dc85997b8cd42bad71a5d6bd2d93">InverseFastFourierTransform</a>(po, n / 2);  <span class="comment">/// Recursive Call</span></div>
+<div class="line"><span class="lineno">   65</span>    std::complex&lt;double&gt; *yo =</div>
+<div class="line"><span class="lineno">   66</span>        <a class="code hl_function" href="#aee56dc85997b8cd42bad71a5d6bd2d93">InverseFastFourierTransform</a>(po, n / 2);  </div>
 <div class="line"><span class="lineno">   67</span> </div>
-<div class="line"><span class="lineno">   68</span>    <span class="keyword">auto</span> *y = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[n];  <span class="comment">/// Final value representation list</span></div>
+<div class="line"><span class="lineno">   68</span>    <span class="keyword">auto</span> *y = <span class="keyword">new</span> std::complex&lt;double&gt;[n];  </div>
 <div class="line"><span class="lineno">   69</span> </div>
 <div class="line"><span class="lineno">   70</span>    k1 = 0, k2 = 0;</div>
 <div class="line"><span class="lineno">   71</span> </div>
 <div class="line"><span class="lineno">   72</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n / 2; i++) {</div>
 <div class="line"><span class="lineno">   73</span>        y[i] =</div>
-<div class="line"><span class="lineno">   74</span>            ye[k1] + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">pow</a>(om, i) * yo[k2];  <span class="comment">/// Updating the first n/2 elements</span></div>
+<div class="line"><span class="lineno">   74</span>            ye[k1] + pow(om, i) * yo[k2];  </div>
 <div class="line"><span class="lineno">   75</span>        y[i + n / 2] =</div>
-<div class="line"><span class="lineno">   76</span>            ye[k1] - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">pow</a>(om, i) * yo[k2];  <span class="comment">/// Updating the last n/2 elements</span></div>
+<div class="line"><span class="lineno">   76</span>            ye[k1] - pow(om, i) * yo[k2];  </div>
 <div class="line"><span class="lineno">   77</span> </div>
 <div class="line"><span class="lineno">   78</span>        k1++;</div>
 <div class="line"><span class="lineno">   79</span>        k2++;</div>
@@ -413,19 +422,12 @@ y if n!=1 </dd></dl>
 <div class="line"><span class="lineno">   84</span>        <span class="keyword">delete</span>[] po;</div>
 <div class="line"><span class="lineno">   85</span>    }</div>
 <div class="line"><span class="lineno">   86</span> </div>
-<div class="line"><span class="lineno">   87</span>    <span class="keyword">delete</span>[] ye;  <span class="comment">/// Deleting dynamic array ye</span></div>
-<div class="line"><span class="lineno">   88</span>    <span class="keyword">delete</span>[] yo;  <span class="comment">/// Deleting dynamic array yo</span></div>
+<div class="line"><span class="lineno">   87</span>    <span class="keyword">delete</span>[] ye;  </div>
+<div class="line"><span class="lineno">   88</span>    <span class="keyword">delete</span>[] yo;  </div>
 <div class="line"><span class="lineno">   89</span>    <span class="keywordflow">return</span> y;</div>
 <div class="line"><span class="lineno">   90</span>}</div>
-<div class="ttc" id="aimag_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">std::complex::imag</a></div><div class="ttdeci">T imag(T... args)</div></div>
-<div class="ttc" id="anamespacenumerical__methods_html_aee56dc85997b8cd42bad71a5d6bd2d93"><div class="ttname"><a href="#aee56dc85997b8cd42bad71a5d6bd2d93">numerical_methods::InverseFastFourierTransform</a></div><div class="ttdeci">std::complex&lt; double &gt; * InverseFastFourierTransform(std::complex&lt; double &gt; *p, uint8_t n)</div><div class="ttdoc">InverseFastFourierTransform is a recursive function which returns list of complex numbers.</div><div class="ttdef"><b>Definition</b> inverse_fast_fourier_transform.cpp:34</div></div>
-<div class="ttc" id="areal_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">std::complex::real</a></div><div class="ttdeci">T real(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/de0/namespacenumerical__methods_aee56dc85997b8cd42bad71a5d6bd2d93_cgraph.svg" width="380" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacenumerical__methods_html_aee56dc85997b8cd42bad71a5d6bd2d93"><div class="ttname"><a href="#aee56dc85997b8cd42bad71a5d6bd2d93">numerical_methods::InverseFastFourierTransform</a></div><div class="ttdeci">std::complex&lt; double &gt; * InverseFastFourierTransform(std::complex&lt; double &gt; *p, uint8_t n)</div><div class="ttdoc">InverseFastFourierTransform is a recursive function which returns list of complex numbers.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d37/inverse__fast__fourier__transform_8cpp_source.html#l00034">inverse_fast_fourier_transform.cpp:34</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d1/de0/namespacenumerical__methods_a158fd271b9a53e8f3f60b08b18857150_cgraph.map b/d1/de0/namespacenumerical__methods_a158fd271b9a53e8f3f60b08b18857150_cgraph.map
deleted file mode 100644
index ea146bcb8..000000000
--- a/d1/de0/namespacenumerical__methods_a158fd271b9a53e8f3f60b08b18857150_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="numerical_methods::FastFourierTransform" name="numerical_methods::FastFourierTransform">
-<area shape="rect" id="Node000001" title="FastFourierTransform is a recursive function which returns list of complex numbers." alt="" coords="5,29,152,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="50,29,49,20,53,11,63,5,79,3,95,5,105,12,102,16,93,10,78,8,65,10,57,14,54,20,55,28"/>
-</map>
diff --git a/d1/de0/namespacenumerical__methods_a158fd271b9a53e8f3f60b08b18857150_cgraph.md5 b/d1/de0/namespacenumerical__methods_a158fd271b9a53e8f3f60b08b18857150_cgraph.md5
deleted file mode 100644
index 71804c7db..000000000
--- a/d1/de0/namespacenumerical__methods_a158fd271b9a53e8f3f60b08b18857150_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5a33ee1f1f07b006a6efe5a5297dbec6
\ No newline at end of file
diff --git a/d1/de0/namespacenumerical__methods_a158fd271b9a53e8f3f60b08b18857150_cgraph.svg b/d1/de0/namespacenumerical__methods_a158fd271b9a53e8f3f60b08b18857150_cgraph.svg
deleted file mode 100644
index 05cabcae6..000000000
--- a/d1/de0/namespacenumerical__methods_a158fd271b9a53e8f3f60b08b18857150_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::FastFourierTransform Pages: 1 -->
-<svg width="118pt" height="57pt"
- viewBox="0.00 0.00 117.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>numerical_methods::FastFourierTransform</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="FastFourierTransform is a recursive function which returns list of complex numbers.">
-<polygon fill="#999999" stroke="#666666" points="109.75,-30.5 0,-30.5 0,0 109.75,0 109.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="54.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">FastFourierTransform</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.43,-30.99C31.46,-40.06 37.94,-48.5 54.88,-48.5 64.14,-48.5 70.27,-45.97 73.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.74,-42.77 74.18,-32.49 69.77,-42.13 76.74,-42.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/de0/namespacenumerical__methods_a158fd271b9a53e8f3f60b08b18857150_cgraph_org.svg b/d1/de0/namespacenumerical__methods_a158fd271b9a53e8f3f60b08b18857150_cgraph_org.svg
deleted file mode 100644
index ebeb877a2..000000000
--- a/d1/de0/namespacenumerical__methods_a158fd271b9a53e8f3f60b08b18857150_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::FastFourierTransform Pages: 1 -->
-<svg width="118pt" height="57pt"
- viewBox="0.00 0.00 117.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>numerical_methods::FastFourierTransform</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="FastFourierTransform is a recursive function which returns list of complex numbers.">
-<polygon fill="#999999" stroke="#666666" points="109.75,-30.5 0,-30.5 0,0 109.75,0 109.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="54.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">FastFourierTransform</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.43,-30.99C31.46,-40.06 37.94,-48.5 54.88,-48.5 64.14,-48.5 70.27,-45.97 73.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.74,-42.77 74.18,-32.49 69.77,-42.13 76.74,-42.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/de0/namespacenumerical__methods_a28e67885f8606564cc8335f483f63309_cgraph.map b/d1/de0/namespacenumerical__methods_a28e67885f8606564cc8335f483f63309_cgraph.map
deleted file mode 100644
index 2556839f4..000000000
--- a/d1/de0/namespacenumerical__methods_a28e67885f8606564cc8335f483f63309_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="numerical_methods::babylonian_method" name="numerical_methods::babylonian_method">
-<area shape="rect" id="Node000001" title="Babylonian methods is an iterative function which returns square root of radicand." alt="" coords="5,23,148,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="196,5,268,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="147,29,180,24,181,29,148,35"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="198,55,266,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="148,52,183,57,182,63,147,57"/>
-</map>
diff --git a/d1/de0/namespacenumerical__methods_a28e67885f8606564cc8335f483f63309_cgraph.md5 b/d1/de0/namespacenumerical__methods_a28e67885f8606564cc8335f483f63309_cgraph.md5
deleted file mode 100644
index 72031fabc..000000000
--- a/d1/de0/namespacenumerical__methods_a28e67885f8606564cc8335f483f63309_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5fa6268766ed5e7a570dcbb8f2b15869
\ No newline at end of file
diff --git a/d1/de0/namespacenumerical__methods_a28e67885f8606564cc8335f483f63309_cgraph.svg b/d1/de0/namespacenumerical__methods_a28e67885f8606564cc8335f483f63309_cgraph.svg
deleted file mode 100644
index adc0f1a15..000000000
--- a/d1/de0/namespacenumerical__methods_a28e67885f8606564cc8335f483f63309_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::babylonian_method Pages: 1 -->
-<svg width="205pt" height="64pt"
- viewBox="0.00 0.00 205.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>numerical_methods::babylonian_method</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Babylonian methods is an iterative function which returns square root of radicand.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-42.88 0,-42.88 0,-12.37 106.75,-12.37 106.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">babylonian_method</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197,-56.25 142.75,-56.25 142.75,-37 197,-37 197,-56.25"/>
-<text text-anchor="middle" x="169.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.93,-36.35C115.13,-37.71 123.46,-39.09 131.24,-40.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.6,-43.82 141.04,-42.01 131.75,-36.92 130.6,-43.82"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.5,-19.25 144.25,-19.25 144.25,0 195.5,0 195.5,-19.25"/>
-<text text-anchor="middle" x="169.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.93,-19.36C115.72,-17.98 124.66,-16.58 132.91,-15.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.2,-18.78 142.54,-13.77 132.12,-11.86 133.2,-18.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/de0/namespacenumerical__methods_a28e67885f8606564cc8335f483f63309_cgraph_org.svg b/d1/de0/namespacenumerical__methods_a28e67885f8606564cc8335f483f63309_cgraph_org.svg
deleted file mode 100644
index c944c9212..000000000
--- a/d1/de0/namespacenumerical__methods_a28e67885f8606564cc8335f483f63309_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::babylonian_method Pages: 1 -->
-<svg width="205pt" height="64pt"
- viewBox="0.00 0.00 205.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>numerical_methods::babylonian_method</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Babylonian methods is an iterative function which returns square root of radicand.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-42.88 0,-42.88 0,-12.37 106.75,-12.37 106.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">babylonian_method</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197,-56.25 142.75,-56.25 142.75,-37 197,-37 197,-56.25"/>
-<text text-anchor="middle" x="169.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.93,-36.35C115.13,-37.71 123.46,-39.09 131.24,-40.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.6,-43.82 141.04,-42.01 131.75,-36.92 130.6,-43.82"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.5,-19.25 144.25,-19.25 144.25,0 195.5,0 195.5,-19.25"/>
-<text text-anchor="middle" x="169.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.93,-19.36C115.72,-17.98 124.66,-16.58 132.91,-15.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.2,-18.78 142.54,-13.77 132.12,-11.86 133.2,-18.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/de0/namespacenumerical__methods_aee56dc85997b8cd42bad71a5d6bd2d93_cgraph.map b/d1/de0/namespacenumerical__methods_aee56dc85997b8cd42bad71a5d6bd2d93_cgraph.map
deleted file mode 100644
index 97ac7a1db..000000000
--- a/d1/de0/namespacenumerical__methods_aee56dc85997b8cd42bad71a5d6bd2d93_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="numerical_methods::InverseFastFourierTransform" name="numerical_methods::InverseFastFourierTransform">
-<area shape="rect" id="Node000001" title="InverseFastFourierTransform is a recursive function which returns list of complex numbers." alt="" coords="5,29,195,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="60,29,58,19,65,10,79,5,100,3,123,5,136,11,134,16,121,10,100,8,80,10,68,15,64,20,66,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/imag.html#" title=" " alt="" coords="243,12,375,37"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="194,36,227,32,227,37,195,41"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/real.html#" title=" " alt="" coords="246,61,372,86"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="195,58,231,62,230,67,194,63"/>
-</map>
diff --git a/d1/de0/namespacenumerical__methods_aee56dc85997b8cd42bad71a5d6bd2d93_cgraph.md5 b/d1/de0/namespacenumerical__methods_aee56dc85997b8cd42bad71a5d6bd2d93_cgraph.md5
deleted file mode 100644
index f99f2b417..000000000
--- a/d1/de0/namespacenumerical__methods_aee56dc85997b8cd42bad71a5d6bd2d93_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5e590c690db4d9ea41434e169bdf7eeb
\ No newline at end of file
diff --git a/d1/de0/namespacenumerical__methods_aee56dc85997b8cd42bad71a5d6bd2d93_cgraph.svg b/d1/de0/namespacenumerical__methods_aee56dc85997b8cd42bad71a5d6bd2d93_cgraph.svg
deleted file mode 100644
index 5b41c1718..000000000
--- a/d1/de0/namespacenumerical__methods_aee56dc85997b8cd42bad71a5d6bd2d93_cgraph.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::InverseFastFourierTransform Pages: 1 -->
-<svg width="285pt" height="69pt"
- viewBox="0.00 0.00 285.25 68.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64.88)">
-<title>numerical_methods::InverseFastFourierTransform</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="InverseFastFourierTransform is a recursive function which returns list of complex numbers.">
-<polygon fill="#999999" stroke="#666666" points="142,-42.88 0,-42.88 0,-12.37 142,-12.37 142,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="71" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">InverseFastFourierTransform</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.25,-43.36C37.58,-52.43 46.83,-60.88 71,-60.88 84.22,-60.88 92.97,-58.35 97.27,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.71,-55.23 98.55,-44.86 93.77,-54.31 100.71,-55.23"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="277.25,-56.25 178,-56.25 178,-37 277.25,-37 277.25,-56.25"/>
-<text text-anchor="middle" x="227.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.07,-36.24C150.13,-37.23 158.29,-38.23 166.2,-39.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.71,-42.67 176.07,-40.41 166.57,-35.72 165.71,-42.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.62,-19.25 180.62,-19.25 180.62,0 274.62,0 274.62,-19.25"/>
-<text text-anchor="middle" x="227.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.07,-19.47C151.07,-18.42 160.21,-17.36 168.98,-16.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.23,-19.83 178.76,-15.2 168.42,-12.88 169.23,-19.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/de0/namespacenumerical__methods_aee56dc85997b8cd42bad71a5d6bd2d93_cgraph_org.svg b/d1/de0/namespacenumerical__methods_aee56dc85997b8cd42bad71a5d6bd2d93_cgraph_org.svg
deleted file mode 100644
index 501c5e0f1..000000000
--- a/d1/de0/namespacenumerical__methods_aee56dc85997b8cd42bad71a5d6bd2d93_cgraph_org.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::InverseFastFourierTransform Pages: 1 -->
-<svg width="285pt" height="69pt"
- viewBox="0.00 0.00 285.25 68.88" 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 64.88)">
-<title>numerical_methods::InverseFastFourierTransform</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="InverseFastFourierTransform is a recursive function which returns list of complex numbers.">
-<polygon fill="#999999" stroke="#666666" points="142,-42.88 0,-42.88 0,-12.37 142,-12.37 142,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="71" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">InverseFastFourierTransform</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.25,-43.36C37.58,-52.43 46.83,-60.88 71,-60.88 84.22,-60.88 92.97,-58.35 97.27,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.71,-55.23 98.55,-44.86 93.77,-54.31 100.71,-55.23"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="277.25,-56.25 178,-56.25 178,-37 277.25,-37 277.25,-56.25"/>
-<text text-anchor="middle" x="227.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.07,-36.24C150.13,-37.23 158.29,-38.23 166.2,-39.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.71,-42.67 176.07,-40.41 166.57,-35.72 165.71,-42.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.62,-19.25 180.62,-19.25 180.62,0 274.62,0 274.62,-19.25"/>
-<text text-anchor="middle" x="227.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.07,-19.47C151.07,-18.42 160.21,-17.36 168.98,-16.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.23,-19.83 178.76,-15.2 168.42,-12.88 169.23,-19.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/de7/classgeometry_1_1jarvis_1_1_convexhull-members.html b/d1/de7/classgeometry_1_1jarvis_1_1_convexhull-members.html
index 2e33a6569..a9c792224 100644
--- a/d1/de7/classgeometry_1_1jarvis_1_1_convexhull-members.html
+++ b/d1/de7/classgeometry_1_1jarvis_1_1_convexhull-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d1/de9/integral__approximation_8cpp.html b/d1/de9/integral__approximation_8cpp.html
index 3c3c043d2..dac80f280 100644
--- a/d1/de9/integral__approximation_8cpp.html
+++ b/d1/de9/integral__approximation_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/integral_approximation.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/integral_approximation.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for integral_approximation.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/dc3/integral__approximation_8cpp__incl.svg" width="439" height="111"><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">
+</div>
+<p><a href="../../d1/de9/integral__approximation_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -132,7 +151,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:aec65db4e5c7317323227f026fe50ef11" id="r_aec65db4e5c7317323227f026fe50ef11"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11">math::integral_approx</a> (double lb, double ub, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; double(double)&gt; &amp;func, double delta=.0001)</td></tr>
+<tr class="memitem:aec65db4e5c7317323227f026fe50ef11" id="r_aec65db4e5c7317323227f026fe50ef11"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11">math::integral_approx</a> (double lb, double ub, const std::function&lt; double(double)&gt; &amp;func, double delta=.0001)</td></tr>
 <tr class="memdesc:aec65db4e5c7317323227f026fe50ef11"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes integral approximation.  <br /></td></tr>
 <tr class="separator:aec65db4e5c7317323227f026fe50ef11"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a50936ee98f4d40f17823befc65a32aec" id="r_a50936ee98f4d40f17823befc65a32aec"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec">math::test_eval</a> (double approx, double expected, double threshold)</td></tr>
@@ -149,6 +168,8 @@ Functions</h2></td></tr>
 <p>In mathematics, a Riemann sum is a certain kind of approximation of an integral by a finite sum. It is named after nineteenth-century German mathematician Bernhard Riemann. One very common application is approximating the area of functions or lines on a graph and the length of curves and other approximations. The sum is calculated by partitioning the region into shapes (rectangles, trapezoids, parabolas, or cubics) that form a region similar to the region being measured, then calculating the area for each of these shapes, and finally adding all of these small areas together. This approach can be used to find a numerical approximation for a definite integral even if the fundamental theorem of calculus does not make it easy to find a closed-form solution. Because the region filled by the small shapes is usually not the same shape as the region being measured, the Riemann sum will differ from the area being measured. This error can be reduced by dividing up the region more finely, using smaller and smaller shapes. As the shapes get smaller and smaller, the sum approaches the Riemann integral. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/bwalton24" target="_blank">Benjamin Walton</a> </dd>
 <dd>
 <a href="https://github.com/shiqisheng00" target="_blank">Shiqi Sheng</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d1/de9/integral__approximation_8cpp_source.html">integral_approximation.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -167,17 +188,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/de9/integral__approximation_8cpp_source.html#l00133">133</a> of file <a class="el" href="../../d1/de9/integral__approximation_8cpp_source.html">integral_approximation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  133</span>           {</div>
 <div class="line"><span class="lineno">  134</span>    <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  135</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  136</span>}</div>
-<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> caesar_cipher.cpp:100</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/de9/integral__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00100">caesar_cipher.cpp:100</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -202,70 +220,68 @@ Here is the call graph for this function:</div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/de9/integral__approximation_8cpp_source.html#l00075">75</a> of file <a class="el" href="../../d1/de9/integral__approximation_8cpp_source.html">integral_approximation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   75</span>                   {</div>
 <div class="line"><span class="lineno">   76</span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a> = <a class="code hl_function" href="../../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11">math::integral_approx</a>(</div>
-<div class="line"><span class="lineno">   77</span>        3.24, 7.56, [](<span class="keyword">const</span> <span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">log</a>(x) + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">exp</a>(x) + x; });</div>
-<div class="line"><span class="lineno">   78</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test Case 1&quot;</span> &lt;&lt; <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">   79</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;function: log(x) + e^x + x&quot;</span> &lt;&lt; <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">   80</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;range: [3.24, 7.56]&quot;</span> &lt;&lt; <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">   81</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;value: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a> &lt;&lt; <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">   77</span>        3.24, 7.56, [](<span class="keyword">const</span> <span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(x) + <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">exp</a>(x) + x; });</div>
+<div class="line"><span class="lineno">   78</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test Case 1&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   79</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;function: log(x) + e^x + x&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;range: [3.24, 7.56]&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   81</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;value: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   82</span>    <a class="code hl_function" href="../../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec">math::test_eval</a>(<a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a>, 1924.80384023549, .001);</div>
-<div class="line"><span class="lineno">   83</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed!&quot;</span> &lt;&lt; <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">   84</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;=====================&quot;</span> &lt;&lt; <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">   83</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;=====================&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   85</span> </div>
 <div class="line"><span class="lineno">   86</span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a> = <a class="code hl_function" href="../../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11">math::integral_approx</a>(0.023, 3.69, [](<span class="keyword">const</span> <span class="keywordtype">double</span> x) {</div>
-<div class="line"><span class="lineno">   87</span>        <span class="keywordflow">return</span> x * x + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">cos</a>(x) + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">exp</a>(x) + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">log</a>(x) * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">log</a>(x);</div>
+<div class="line"><span class="lineno">   87</span>        <span class="keywordflow">return</span> x * x + cos(x) + <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">exp</a>(x) + <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(x) * <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(x);</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/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test Case 2&quot;</span> &lt;&lt; <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">   90</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;function: x^2 + cos(x) + e^x + log^2(x)&quot;</span> &lt;&lt; <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">   91</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;range: [.023, 3.69]&quot;</span> &lt;&lt; <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">   92</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;value: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a> &lt;&lt; <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">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test Case 2&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   90</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;function: x^2 + cos(x) + e^x + log^2(x)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   91</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;range: [.023, 3.69]&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;value: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   93</span>    <a class="code hl_function" href="../../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec">math::test_eval</a>(<a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a>, 58.71291345202729, .001);</div>
-<div class="line"><span class="lineno">   94</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed!&quot;</span> &lt;&lt; <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">   95</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;=====================&quot;</span> &lt;&lt; <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">   94</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   95</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;=====================&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   96</span> </div>
 <div class="line"><span class="lineno">   97</span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a> = <a class="code hl_function" href="../../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11">math::integral_approx</a>(</div>
 <div class="line"><span class="lineno">   98</span>        10.78, 24.899, [](<span class="keyword">const</span> <span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> x * x * x - x * x + 378; });</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> &lt;&lt; <span class="stringliteral">&quot;Test Case 3&quot;</span> &lt;&lt; <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">  100</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;function: x^3 - x^2 + 378&quot;</span> &lt;&lt; <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">  101</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;range: [10.78, 24.899]&quot;</span> &lt;&lt; <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">  102</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;value: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a> &lt;&lt; <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">   99</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test Case 3&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  100</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;function: x^3 - x^2 + 378&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;range: [10.78, 24.899]&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  102</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;value: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  103</span>    <a class="code hl_function" href="../../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec">math::test_eval</a>(<a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a>, 93320.65915078377, .001);</div>
-<div class="line"><span class="lineno">  104</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed!&quot;</span> &lt;&lt; <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">  105</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;=====================&quot;</span> &lt;&lt; <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">  104</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  105</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;=====================&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  106</span> </div>
 <div class="line"><span class="lineno">  107</span>    <span class="keywordtype">double</span> test_4 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11">math::integral_approx</a>(</div>
 <div class="line"><span class="lineno">  108</span>        .101, .505,</div>
-<div class="line"><span class="lineno">  109</span>        [](<span class="keyword">const</span> <span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">cos</a>(x) * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/tan.html">tan</a>(x) * x * x + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">exp</a>(x); },</div>
+<div class="line"><span class="lineno">  109</span>        [](<span class="keyword">const</span> <span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> cos(x) * tan(x) * x * x + <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">exp</a>(x); },</div>
 <div class="line"><span class="lineno">  110</span>        .00001);</div>
-<div class="line"><span class="lineno">  111</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test Case 4&quot;</span> &lt;&lt; <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">  112</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;function: cos(x)*tan(x)*x^2 + e^x&quot;</span> &lt;&lt; <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">  113</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;range: [.101, .505]&quot;</span> &lt;&lt; <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">  114</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;value: &quot;</span> &lt;&lt; test_4 &lt;&lt; <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">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test Case 4&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  112</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;function: cos(x)*tan(x)*x^2 + e^x&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;range: [.101, .505]&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;value: &quot;</span> &lt;&lt; test_4 &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  115</span>    <a class="code hl_function" href="../../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec">math::test_eval</a>(test_4, 0.566485986311631, .001);</div>
-<div class="line"><span class="lineno">  116</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 4 Passed!&quot;</span> &lt;&lt; <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">  117</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;=====================&quot;</span> &lt;&lt; <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">  116</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  117</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;=====================&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  118</span> </div>
 <div class="line"><span class="lineno">  119</span>    <span class="keywordtype">double</span> test_5 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11">math::integral_approx</a>(</div>
-<div class="line"><span class="lineno">  120</span>        -1, 1, [](<span class="keyword">const</span> <span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">exp</a>(-1 / (x * x)); });</div>
-<div class="line"><span class="lineno">  121</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test Case 5&quot;</span> &lt;&lt; <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">  122</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;function: e^(-1/x^2)&quot;</span> &lt;&lt; <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">  123</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;range: [-1, 1]&quot;</span> &lt;&lt; <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">  124</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;value: &quot;</span> &lt;&lt; test_5 &lt;&lt; <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">  120</span>        -1, 1, [](<span class="keyword">const</span> <span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">exp</a>(-1 / (x * x)); });</div>
+<div class="line"><span class="lineno">  121</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test Case 5&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  122</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;function: e^(-1/x^2)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  123</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;range: [-1, 1]&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  124</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;value: &quot;</span> &lt;&lt; test_5 &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  125</span>    <a class="code hl_function" href="../../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec">math::test_eval</a>(test_5, 0.1781477117815607, .001);</div>
-<div class="line"><span class="lineno">  126</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 5 Passed!&quot;</span> &lt;&lt; <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">  126</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 5 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  127</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="acos_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a></div><div class="ttdeci">T cos(T... args)</div></div>
-<div class="ttc" id="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="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div>
-<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:505</div></div>
-<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:549</div></div>
-<div class="ttc" id="aheavy__light__decomposition_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:592</div></div>
-<div class="ttc" id="alog_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/log.html">std::log</a></div><div class="ttdeci">T log(T... args)</div></div>
-<div class="ttc" id="anamespacemath_html_a50936ee98f4d40f17823befc65a32aec"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec">math::test_eval</a></div><div class="ttdeci">void test_eval(double approx, double expected, double threshold)</div><div class="ttdoc">Wrapper to evaluate if the approximated value is within .XX% threshold of the exact value.</div><div class="ttdef"><b>Definition</b> integral_approximation.cpp:62</div></div>
-<div class="ttc" id="anamespacemath_html_aec65db4e5c7317323227f026fe50ef11"><div class="ttname"><a href="../../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11">math::integral_approx</a></div><div class="ttdeci">double integral_approx(double lb, double ub, const std::function&lt; double(double)&gt; &amp;func, double delta=.0001)</div><div class="ttdoc">Computes integral approximation.</div><div class="ttdef"><b>Definition</b> integral_approximation.cpp:42</div></div>
-<div class="ttc" id="atan_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/tan.html">std::tan</a></div><div class="ttdeci">T tan(T... args)</div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00505">heavy_light_decomposition.cpp:505</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00549">heavy_light_decomposition.cpp:549</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00592">heavy_light_decomposition.cpp:592</a></div></div>
+<div class="ttc" id="alru__cache_8cpp_html_a24d21a345ed06f7fba6919718cf3e058"><div class="ttname"><a href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">lru_tests::log</a></div><div class="ttdeci">void log(T msg)</div><div class="ttdoc">A function to print given message on console.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db3/lru__cache_8cpp_source.html#l00149">lru_cache.cpp:149</a></div></div>
+<div class="ttc" id="anamespaceciphers_1_1elliptic__curve__key__exchange_html_ac00616a4e40d3cd5cfb4da87d9ff9af0"><div class="ttname"><a href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">ciphers::elliptic_curve_key_exchange::exp</a></div><div class="ttdeci">uint256_t exp(uint256_t number, uint256_t power, const uint256_t &amp;mod)</div><div class="ttdoc">This function calculates number raised to exponent power under modulo mod using Modular Exponentiatio...</div><div class="ttdef"><b>Definition</b> <a href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00078">elliptic_curve_key_exchange.cpp:78</a></div></div>
+<div class="ttc" id="anamespacemath_html_a50936ee98f4d40f17823befc65a32aec"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec">math::test_eval</a></div><div class="ttdeci">void test_eval(double approx, double expected, double threshold)</div><div class="ttdoc">Wrapper to evaluate if the approximated value is within .XX% threshold of the exact value.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/de9/integral__approximation_8cpp_source.html#l00062">integral_approximation.cpp:62</a></div></div>
+<div class="ttc" id="anamespacemath_html_aec65db4e5c7317323227f026fe50ef11"><div class="ttname"><a href="../../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11">math::integral_approx</a></div><div class="ttdeci">double integral_approx(double lb, double ub, const std::function&lt; double(double)&gt; &amp;func, double delta=.0001)</div><div class="ttdoc">Computes integral approximation.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/de9/integral__approximation_8cpp_source.html#l00042">integral_approximation.cpp:42</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/d1/de9/integral__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d1/de9/integral__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index cc0f19d61..000000000
--- a/d1/de9/integral__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" title=" " alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/d1/de9/integral__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/de9/integral__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 133642d61..000000000
--- a/d1/de9/integral__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-45a93b7dd32655ba8027ce8e55842be5
\ No newline at end of file
diff --git a/d1/de9/integral__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/de9/integral__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index cfe500a18..000000000
--- a/d1/de9/integral__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/de9/integral__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d1/de9/integral__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 1d3bc748a..000000000
--- a/d1/de9/integral__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/de9/integral__approximation_8cpp_source.html b/d1/de9/integral__approximation_8cpp_source.html
new file mode 100644
index 000000000..1c0d16f04
--- /dev/null
+++ b/d1/de9/integral__approximation_8cpp_source.html
@@ -0,0 +1,239 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/integral_approximation.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/de9/integral__approximation_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">integral_approximation.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d1/de9/integral__approximation_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;cassert&gt;</span>     </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;cmath&gt;</span>       </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;functional&gt;</span>  </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;iostream&gt;</span>    </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="foldopen" id="foldopen00042" data-start="{" data-end="}">
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11">   42</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11">integral_approx</a>(<span class="keywordtype">double</span> lb, <span class="keywordtype">double</span> ub,</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>                       <span class="keyword">const</span> std::function&lt;<span class="keywordtype">double</span>(<span class="keywordtype">double</span>)&gt;&amp; func,</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>                       <span class="keywordtype">double</span> delta = .0001) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordtype">double</span> result = 0;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    uint64_t numDeltas = <span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>((ub - lb) / delta);</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; numDeltas; i++) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="keywordtype">double</span> begin = lb + i * delta;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        <span class="keywordtype">double</span> end = lb + (i + 1) * delta;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        result += delta * (func(begin) + func(end)) / 2;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>}</div>
+</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec">   62</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec">test_eval</a>(<span class="keywordtype">double</span> approx, <span class="keywordtype">double</span> expected, <span class="keywordtype">double</span> threshold) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    assert(approx &gt;= expected * (1 - threshold));</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    assert(approx &lt;= expected * (1 + threshold));</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>}</div>
+</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a> = <a class="code hl_function" href="../../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11">math::integral_approx</a>(</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        3.24, 7.56, [](<span class="keyword">const</span> <span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(x) + <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">exp</a>(x) + x; });</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test Case 1&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;function: log(x) + e^x + x&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;range: [3.24, 7.56]&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;value: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <a class="code hl_function" href="../../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec">math::test_eval</a>(<a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a>, 1924.80384023549, .001);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;=====================&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a> = <a class="code hl_function" href="../../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11">math::integral_approx</a>(0.023, 3.69, [](<span class="keyword">const</span> <span class="keywordtype">double</span> x) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        <span class="keywordflow">return</span> x * x + cos(x) + <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">exp</a>(x) + <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(x) * <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(x);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    });</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test Case 2&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;function: x^2 + cos(x) + e^x + log^2(x)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;range: [.023, 3.69]&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;value: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <a class="code hl_function" href="../../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec">math::test_eval</a>(<a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a>, 58.71291345202729, .001);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;=====================&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a> = <a class="code hl_function" href="../../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11">math::integral_approx</a>(</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        10.78, 24.899, [](<span class="keyword">const</span> <span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> x * x * x - x * x + 378; });</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test Case 3&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;function: x^3 - x^2 + 378&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;range: [10.78, 24.899]&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;value: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <a class="code hl_function" href="../../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec">math::test_eval</a>(<a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a>, 93320.65915078377, .001);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;=====================&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <span class="keywordtype">double</span> test_4 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11">math::integral_approx</a>(</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        .101, .505,</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        [](<span class="keyword">const</span> <span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> cos(x) * tan(x) * x * x + <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">exp</a>(x); },</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        .00001);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test Case 4&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;function: cos(x)*tan(x)*x^2 + e^x&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;range: [.101, .505]&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;value: &quot;</span> &lt;&lt; test_4 &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <a class="code hl_function" href="../../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec">math::test_eval</a>(test_4, 0.566485986311631, .001);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;=====================&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <span class="keywordtype">double</span> test_5 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11">math::integral_approx</a>(</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        -1, 1, [](<span class="keyword">const</span> <span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">exp</a>(-1 / (x * x)); });</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test Case 5&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;function: e^(-1/x^2)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;range: [-1, 1]&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;value: &quot;</span> &lt;&lt; test_5 &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    <a class="code hl_function" href="../../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec">math::test_eval</a>(test_5, 0.1781477117815607, .001);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 5 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>}</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
+<div class="foldopen" id="foldopen00133" data-start="{" data-end="}">
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"><a class="line" href="../../d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  133</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>}</div>
+</div>
+<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00100">caesar_cipher.cpp:100</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00505">heavy_light_decomposition.cpp:505</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00549">heavy_light_decomposition.cpp:549</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00592">heavy_light_decomposition.cpp:592</a></div></div>
+<div class="ttc" id="aintegral__approximation_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00133">integral_approximation.cpp:133</a></div></div>
+<div class="ttc" id="alru__cache_8cpp_html_a24d21a345ed06f7fba6919718cf3e058"><div class="ttname"><a href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">lru_tests::log</a></div><div class="ttdeci">void log(T msg)</div><div class="ttdoc">A function to print given message on console.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db3/lru__cache_8cpp_source.html#l00149">lru_cache.cpp:149</a></div></div>
+<div class="ttc" id="anamespaceciphers_1_1elliptic__curve__key__exchange_html_ac00616a4e40d3cd5cfb4da87d9ff9af0"><div class="ttname"><a href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">ciphers::elliptic_curve_key_exchange::exp</a></div><div class="ttdeci">uint256_t exp(uint256_t number, uint256_t power, const uint256_t &amp;mod)</div><div class="ttdoc">This function calculates number raised to exponent power under modulo mod using Modular Exponentiatio...</div><div class="ttdef"><b>Definition</b> <a href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00078">elliptic_curve_key_exchange.cpp:78</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_a50936ee98f4d40f17823befc65a32aec"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec">math::test_eval</a></div><div class="ttdeci">void test_eval(double approx, double expected, double threshold)</div><div class="ttdoc">Wrapper to evaluate if the approximated value is within .XX% threshold of the exact value.</div><div class="ttdef"><b>Definition</b> <a href="#l00062">integral_approximation.cpp:62</a></div></div>
+<div class="ttc" id="anamespacemath_html_aec65db4e5c7317323227f026fe50ef11"><div class="ttname"><a href="../../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11">math::integral_approx</a></div><div class="ttdeci">double integral_approx(double lb, double ub, const std::function&lt; double(double)&gt; &amp;func, double delta=.0001)</div><div class="ttdoc">Computes integral approximation.</div><div class="ttdef"><b>Definition</b> <a href="#l00042">integral_approximation.cpp:42</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d1/de9/integral__approximation_8cpp.html">integral_approximation.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/deb/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node-members.html b/d1/deb/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node-members.html
index 6760751be..6abed494c 100644
--- a/d1/deb/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node-members.html
+++ b/d1/deb/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d1/ded/windowed__median_8cpp.html b/d1/ded/windowed__median_8cpp.html
index 3d161ebaa..0525b92d4 100644
--- a/d1/ded/windowed__median_8cpp.html
+++ b/d1/ded/windowed__median_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: probability/windowed_median.cpp File Reference</title>
+<title>TheAlgorithms/C++: probability/windowed_median.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -126,7 +143,9 @@ Include dependency graph for windowed_median.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d5b/windowed__median_8cpp__incl.svg" width="442" height="126"><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">
+</div>
+<p><a href="../../d1/ded/windowed__median_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a></td></tr>
@@ -144,16 +163,14 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="typedef-members" name="typedef-members"></a>
 Typedefs</h2></td></tr>
-<tr class="memitem:af02e266543ae8ddb86a5af00ee2d817e" id="r_af02e266543ae8ddb86a5af00ee2d817e"><td class="memItemLeft" align="right" valign="top"><a id="af02e266543ae8ddb86a5af00ee2d817e" name="af02e266543ae8ddb86a5af00ee2d817e"></a>
-using&#160;</td><td class="memItemRight" valign="bottom"><b>probability::windowed_median::Window</b> = <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt;int&gt;</td></tr>
+<tr class="memitem:af02e266543ae8ddb86a5af00ee2d817e" id="r_af02e266543ae8ddb86a5af00ee2d817e"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af02e266543ae8ddb86a5af00ee2d817e">probability::windowed_median::Window</a> = std::list&lt;int&gt;</td></tr>
 <tr class="separator:af02e266543ae8ddb86a5af00ee2d817e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a3ab815f521baa673516c6ae077868d76" id="r_a3ab815f521baa673516c6ae077868d76"><td class="memItemLeft" align="right" valign="top"><a id="a3ab815f521baa673516c6ae077868d76" name="a3ab815f521baa673516c6ae077868d76"></a>
-using&#160;</td><td class="memItemRight" valign="bottom"><b>probability::windowed_median::size_type</b> = Window::size_type</td></tr>
+<tr class="memitem:a3ab815f521baa673516c6ae077868d76" id="r_a3ab815f521baa673516c6ae077868d76"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3ab815f521baa673516c6ae077868d76">probability::windowed_median::size_type</a> = Window::size_type</td></tr>
 <tr class="separator:a3ab815f521baa673516c6ae077868d76"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a6dc652a36ea42ba262c4e4236e3e6601" id="r_a6dc652a36ea42ba262c4e4236e3e6601"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6dc652a36ea42ba262c4e4236e3e6601">test</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;vals, int windowSize)</td></tr>
+<tr class="memitem:a6dc652a36ea42ba262c4e4236e3e6601" id="r_a6dc652a36ea42ba262c4e4236e3e6601"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6dc652a36ea42ba262c4e4236e3e6601">test</a> (const std::vector&lt; int &gt; &amp;vals, int windowSize)</td></tr>
 <tr class="memdesc:a6dc652a36ea42ba262c4e4236e3e6601"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations.  <br /></td></tr>
 <tr class="separator:a6dc652a36ea42ba262c4e4236e3e6601"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ac0f2228420376f4db7e1274f2b41667c" id="r_ac0f2228420376f4db7e1274f2b41667c"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac0f2228420376f4db7e1274f2b41667c">main</a> (int argc, const char *argv[])</td></tr>
@@ -165,9 +182,44 @@ Functions</h2></td></tr>
 <p>Given a stream of integers, the algorithm calculates the median of a fixed size window at the back of the stream. The leading time complexity of this algorithm is O(log(N), and it is inspired by the known algorithm to [find median from (infinite) data stream](<a href="https://www.tutorialcup.com/interview/algorithm/find-median-from-data-stream.htm">https://www.tutorialcup.com/interview/algorithm/find-median-from-data-stream.htm</a>), with the proper modifications to account for the finite window size for which the median is requested</p>
 <h3><a class="anchor" id="autotoc_md102"></a>
 Algorithm</h3>
-<p>The sliding window is managed by a list, which guarantees O(1) for both pushing and popping. Each new value is pushed to the window back, while a value from the front of the window is popped. In addition, the algorithm manages a multi-value binary search tree (BST), implemented by <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset.html">std::multiset</a>. For each new value that is inserted into the window, it is also inserted to the BST. When a value is popped from the window, it is also erased from the BST. Both insertion and erasion to/from the BST are O(logN) in time, with N the size of the window. Finally, the algorithm keeps a pointer to the root of the BST, and updates its position whenever values are inserted or erased to/from BST. The root of the tree is the median! Hence, median retrieval is always O(1)</p>
+<p>The sliding window is managed by a list, which guarantees O(1) for both pushing and popping. Each new value is pushed to the window back, while a value from the front of the window is popped. In addition, the algorithm manages a multi-value binary search tree (BST), implemented by std::multiset. For each new value that is inserted into the window, it is also inserted to the BST. When a value is popped from the window, it is also erased from the BST. Both insertion and erasion to/from the BST are O(logN) in time, with N the size of the window. Finally, the algorithm keeps a pointer to the root of the BST, and updates its position whenever values are inserted or erased to/from BST. The root of the tree is the median! Hence, median retrieval is always O(1)</p>
 <p>Time complexity: O(logN). Space complexity: O(N). N - size of window </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/YanivHollander" target="_blank">Yaniv Hollander</a> </dd></dl>
-</div><h2 class="groupheader">Function Documentation</h2>
+
+<p class="definition">Definition in file <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html">windowed_median.cpp</a>.</p>
+</div><h2 class="groupheader">Typedef Documentation</h2>
+<a id="a3ab815f521baa673516c6ae077868d76" name="a3ab815f521baa673516c6ae077868d76"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a3ab815f521baa673516c6ae077868d76">&#9670;&#160;</a></span>size_type</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">using probability::windowed_median::size_type = Window::size_type</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html#l00049">49</a> of file <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html">windowed_median.cpp</a>.</p>
+
+</div>
+</div>
+<a id="af02e266543ae8ddb86a5af00ee2d817e" name="af02e266543ae8ddb86a5af00ee2d817e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#af02e266543ae8ddb86a5af00ee2d817e">&#9670;&#160;</a></span>Window</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">using probability::windowed_median::Window = std::list&lt;int&gt;</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html">windowed_median.cpp</a>.</p>
+
+</div>
+</div>
+<h2 class="groupheader">Function Documentation</h2>
 <a id="ac0f2228420376f4db7e1274f2b41667c" name="ac0f2228420376f4db7e1274f2b41667c"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ac0f2228420376f4db7e1274f2b41667c">&#9670;&#160;</a></span>main()</h2>
 
@@ -209,59 +261,44 @@ Algorithm</h3>
 <p>Window size in the range [3, 10]</p>
 <p>Random array values (positive/negative)</p>
 <p>Testing randomized test</p>
-<div class="fragment"><div class="line"><span class="lineno">  198</span>                                       {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  199</span><span class="comment">    /// A few fixed test cases</span></div>
-<div class="line"><span class="lineno">  200</span><span class="comment"></span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({1, 2, 3, 4, 5, 6, 7, 8, 9},</div>
-<div class="line"><span class="lineno">  201</span>         3);  <span class="comment">/// Array of sorted values; odd window size</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html#l00198">198</a> of file <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html">windowed_median.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  198</span>                                       {</div>
+<div class="line"><span class="lineno">  200</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({1, 2, 3, 4, 5, 6, 7, 8, 9},</div>
+<div class="line"><span class="lineno">  201</span>         3);  </div>
 <div class="line"><span class="lineno">  202</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({9, 8, 7, 6, 5, 4, 3, 2, 1},</div>
-<div class="line"><span class="lineno">  203</span>         3);  <span class="comment">/// Array of sorted values - decreasing; odd window size</span></div>
-<div class="line"><span class="lineno">  204</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({9, 8, 7, 6, 5, 4, 5, 6}, 4);     <span class="comment">/// Even window size</span></div>
-<div class="line"><span class="lineno">  205</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({3, 3, 3, 3, 3, 3, 3, 3, 3}, 3);  <span class="comment">/// Array with repeating values</span></div>
-<div class="line"><span class="lineno">  206</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({3, 3, 3, 3, 7, 3, 3, 3, 3}, 3);  <span class="comment">/// Array with same values except one</span></div>
+<div class="line"><span class="lineno">  203</span>         3);  </div>
+<div class="line"><span class="lineno">  204</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({9, 8, 7, 6, 5, 4, 5, 6}, 4);     </div>
+<div class="line"><span class="lineno">  205</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({3, 3, 3, 3, 3, 3, 3, 3, 3}, 3);  </div>
+<div class="line"><span class="lineno">  206</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({3, 3, 3, 3, 7, 3, 3, 3, 3}, 3);  </div>
 <div class="line"><span class="lineno">  207</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({4, 3, 3, -5, -5, 1, 3, 4, 5},</div>
-<div class="line"><span class="lineno">  208</span>         5);  <span class="comment">/// Array that includes repeating values including negatives</span></div>
-<div class="line"><span class="lineno">  209</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  210</span><span class="comment">    /// Array with large values - sum of few pairs exceeds MAX_INT. Window size</span></div>
-<div class="line"><span class="lineno">  211</span><span class="comment">    /// is even - testing calculation of average median between two middle</span></div>
-<div class="line"><span class="lineno">  212</span><span class="comment">    /// values</span></div>
-<div class="line"><span class="lineno">  213</span><span class="comment"></span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({470211272, 101027544, 1457850878, 1458777923, 2007237709, 823564440,</div>
+<div class="line"><span class="lineno">  208</span>         5);  </div>
+<div class="line"><span class="lineno">  209</span> </div>
+<div class="line"><span class="lineno">  213</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({470211272, 101027544, 1457850878, 1458777923, 2007237709, 823564440,</div>
 <div class="line"><span class="lineno">  214</span>          1115438165, 1784484492, 74243042, 114807987},</div>
 <div class="line"><span class="lineno">  215</span>         6);</div>
-<div class="line"><span class="lineno">  216</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  217</span><span class="comment">    /// Random test cases</span></div>
-<div class="line"><span class="lineno">  218</span><span class="comment"></span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>)));</div>
-<div class="line"><span class="lineno">  219</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> vals;</div>
+<div class="line"><span class="lineno">  216</span> </div>
+<div class="line"><span class="lineno">  218</span>    std::srand(<span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">&gt;</span>(std::time(<span class="keyword">nullptr</span>)));</div>
+<div class="line"><span class="lineno">  219</span>    std::vector&lt;int&gt; vals;</div>
 <div class="line"><span class="lineno">  220</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 8; i &lt; 100; i++) {</div>
 <div class="line"><span class="lineno">  221</span>        <span class="keyword">const</span> <span class="keyword">auto</span> n =</div>
-<div class="line"><span class="lineno">  222</span>            1 + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() /</div>
-<div class="line"><span class="lineno">  223</span>                    ((RAND_MAX + 5u) / 20);  <span class="comment">/// Array size in the range [5, 20]</span></div>
+<div class="line"><span class="lineno">  222</span>            1 + std::rand() /</div>
+<div class="line"><span class="lineno">  223</span>                    ((RAND_MAX + 5u) / 20);  </div>
 <div class="line"><span class="lineno">  224</span>        <span class="keyword">auto</span> windowSize =</div>
-<div class="line"><span class="lineno">  225</span>            1 + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() / ((RAND_MAX + 3u) /</div>
-<div class="line"><span class="lineno">  226</span>                               10);  <span class="comment">/// Window size in the range [3, 10]</span></div>
-<div class="line"><span class="lineno">  227</span>        vals.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/clear.html">clear</a>();</div>
-<div class="line"><span class="lineno">  228</span>        vals.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">reserve</a>(n);</div>
+<div class="line"><span class="lineno">  225</span>            1 + std::rand() / ((RAND_MAX + 3u) /</div>
+<div class="line"><span class="lineno">  226</span>                               10);  </div>
+<div class="line"><span class="lineno">  227</span>        vals.clear();</div>
+<div class="line"><span class="lineno">  228</span>        vals.reserve(n);</div>
 <div class="line"><span class="lineno">  229</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
-<div class="line"><span class="lineno">  230</span>            vals.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(</div>
-<div class="line"><span class="lineno">  231</span>                rand() - RAND_MAX);  <span class="comment">/// Random array values (positive/negative)</span></div>
+<div class="line"><span class="lineno">  230</span>            vals.push_back(</div>
+<div class="line"><span class="lineno">  231</span>                rand() - RAND_MAX);  </div>
 <div class="line"><span class="lineno">  232</span>        }</div>
-<div class="line"><span class="lineno">  233</span>        <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(vals, windowSize);  <span class="comment">/// Testing randomized test</span></div>
+<div class="line"><span class="lineno">  233</span>        <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(vals, windowSize);  </div>
 <div class="line"><span class="lineno">  234</span>    }</div>
 <div class="line"><span class="lineno">  235</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  236</span>}</div>
-<div class="ttc" id="aclear_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/clear.html">std::vector::clear</a></div><div class="ttdeci">T clear(T... args)</div></div>
-<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> generate_parentheses.cpp:82</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-<div class="ttc" id="areserve_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">std::vector::reserve</a></div><div class="ttdeci">T reserve(T... args)</div></div>
-<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.svg" width="100%" height="567"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00082">generate_parentheses.cpp:82</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6dc652a36ea42ba262c4e4236e3e6601" name="a6dc652a36ea42ba262c4e4236e3e6601"></a>
@@ -276,7 +313,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">static void test </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>vals</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>vals</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -300,22 +337,18 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <p>Comparing medians: efficient function vs. Naive one</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html#l00182">182</a> of file <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html">windowed_median.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  182</span>                                                             {</div>
 <div class="line"><span class="lineno">  183</span>    <a class="code hl_class" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a> windowedMedian(windowSize);</div>
 <div class="line"><span class="lineno">  184</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> val : vals) {</div>
 <div class="line"><span class="lineno">  185</span>        windowedMedian.insert(val);</div>
-<div class="line"><span class="lineno">  186</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  187</span><span class="comment">        /// Comparing medians: efficient function vs. Naive one</span></div>
-<div class="line"><span class="lineno">  188</span><span class="comment"></span>        assert(windowedMedian.getMedian() == windowedMedian.getMedianNaive());</div>
+<div class="line"><span class="lineno">  186</span> </div>
+<div class="line"><span class="lineno">  188</span>        assert(windowedMedian.getMedian() == windowedMedian.getMedianNaive());</div>
 <div class="line"><span class="lineno">  189</span>    }</div>
 <div class="line"><span class="lineno">  190</span>}</div>
-<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a></div><div class="ttdoc">A class to calculate the median of a leading sliding window at the back of a stream of integer values...</div><div class="ttdef"><b>Definition</b> windowed_median.cpp:56</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a></div><div class="ttdoc">A class to calculate the median of a leading sliding window at the back of a stream of integer values...</div><div class="ttdef"><b>Definition</b> <a href="../../d1/ded/windowed__median_8cpp_source.html#l00056">windowed_median.cpp:56</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph.map b/d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph.map
deleted file mode 100644
index 92d9ec6ac..000000000
--- a/d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph.map
+++ /dev/null
@@ -1,35 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,136,49,162"/>
-<area shape="rect" id="Node000002" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d" title="Gets the median of the values in the sliding window." alt="" coords="97,121,278,177"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,146,81,146,81,152,49,152"/>
-<area shape="rect" id="Node000004" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6" title="A naive and inefficient method to obtain the median of the sliding window. Used for testing!" alt="" coords="97,16,278,71"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="47,133,130,78,133,82,50,138"/>
-<area shape="rect" id="Node000006" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7" title="Insert a new value to the stream." alt="" coords="97,221,278,277"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="50,160,130,210,127,215,48,164"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/multiset/size.html#" title=" " alt="" coords="559,136,685,162"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="278,146,544,146,544,152,278,152"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/sort.html#" title=" " alt="" coords="370,5,464,31"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="278,31,354,22,354,28,279,36"/>
-<area shape="rect" id="Node000007" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e" title="Erases a value from a sorted multi&#45;value BST." alt="" coords="326,286,507,342"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="279,272,312,282,311,287,278,277"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/front.html#" title=" " alt="" coords="368,236,466,262"/>
-<area shape="poly" id="edge10_Node000006_Node000010" title=" " alt="" coords="278,246,352,246,352,252,278,252"/>
-<area shape="rect" id="Node000011" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24" title="Inserts a value to a sorted multi&#45;value BST." alt="" coords="326,56,507,111"/>
-<area shape="poly" id="edge11_Node000006_Node000011" title=" " alt="" coords="231,218,276,187,366,119,369,123,280,191,234,223"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/pop_front.html#" title=" " alt="" coords="354,367,480,392"/>
-<area shape="poly" id="edge15_Node000006_Node000014" title=" " alt="" coords="220,275,269,315,327,352,343,359,341,363,325,357,265,319,217,279"/>
-<area shape="rect" id="Node000015" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/push_back.html#" title=" " alt="" coords="349,416,484,442"/>
-<area shape="poly" id="edge16_Node000006_Node000015" title=" " alt="" coords="208,275,257,340,290,374,327,403,336,407,334,412,325,407,286,378,253,344,204,279"/>
-<area shape="rect" id="Node000016" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/size.html#" title=" " alt="" coords="368,187,465,212"/>
-<area shape="poly" id="edge17_Node000006_Node000016" title=" " alt="" coords="278,227,353,210,354,216,279,232"/>
-<area shape="poly" id="edge9_Node000007_Node000003" title=" " alt="" coords="487,284,506,272,534,248,560,222,601,173,605,176,564,226,538,252,509,276,490,288"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/multiset/erase.html#" title=" " alt="" coords="555,327,689,352"/>
-<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="508,323,540,327,539,332,507,328"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/multiset/find.html#" title=" " alt="" coords="561,277,683,303"/>
-<area shape="poly" id="edge8_Node000007_Node000009" title=" " alt="" coords="507,301,545,296,545,302,508,306"/>
-<area shape="poly" id="edge14_Node000011_Node000003" title=" " alt="" coords="507,109,566,128,564,133,505,115"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/multiset/begin.html#" title=" " alt="" coords="556,29,688,55"/>
-<area shape="poly" id="edge12_Node000011_Node000012" title=" " alt="" coords="507,63,540,56,541,61,508,68"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/multiset/insert.html#" title=" " alt="" coords="555,79,689,104"/>
-<area shape="poly" id="edge13_Node000011_Node000013" title=" " alt="" coords="508,84,540,86,539,91,507,90"/>
-</map>
diff --git a/d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph.md5 b/d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph.md5
deleted file mode 100644
index 340eb6ac5..000000000
--- a/d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6c3e29055975a8834e9a3aeda925e296
\ No newline at end of file
diff --git a/d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph.svg b/d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph.svg
deleted file mode 100644
index d1c7a4718..000000000
--- a/d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph.svg
+++ /dev/null
@@ -1,402 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<!--zoomable 335 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 521;
-var viewHeight = 335;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-229.25 0,-229.25 0,-210 32.5,-210 32.5,-229.25"/>
-<text text-anchor="middle" x="16.25" y="-215.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d" target="_top" xlink:title="Gets the median of the values in the sliding window.">
-<polygon fill="white" stroke="#666666" points="204.5,-240.5 68.5,-240.5 68.5,-198.75 204.5,-198.75 204.5,-240.5"/>
-<text text-anchor="start" x="76.5" y="-227" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="76.5" y="-215.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="136.5" y="-204.5" font-family="Helvetica,sans-Serif" font-size="10.00">::getMedian</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.71,-219.62C39.39,-219.62 47.74,-219.62 56.78,-219.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.58,-223.13 66.58,-219.63 56.58,-216.13 56.58,-223.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6" target="_top" xlink:title="A naive and inefficient method to obtain the median of the sliding window. Used for testing!">
-<polygon fill="white" stroke="#666666" points="204.5,-319.5 68.5,-319.5 68.5,-277.75 204.5,-277.75 204.5,-319.5"/>
-<text text-anchor="start" x="76.5" y="-306" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="76.5" y="-294.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="136.5" y="-283.5" font-family="Helvetica,sans-Serif" font-size="10.00">::getMedianNaive</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.23,-229.63C47.82,-240.05 72.92,-256.82 94.48,-271.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.25,-273.94 102.51,-276.59 96.14,-268.12 92.25,-273.94"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7" target="_top" xlink:title="Insert a new value to the stream.">
-<polygon fill="white" stroke="#666666" points="204.5,-165.5 68.5,-165.5 68.5,-123.75 204.5,-123.75 204.5,-165.5"/>
-<text text-anchor="start" x="76.5" y="-152" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="76.5" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="136.5" y="-129.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.71,-209.82C47.84,-200.22 71.6,-185.16 92.46,-171.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.26,-174.93 100.83,-166.61 90.51,-169.01 94.26,-174.93"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="509.5,-229.25 415.5,-229.25 415.5,-210 509.5,-210 509.5,-229.25"/>
-<text text-anchor="middle" x="462.5" y="-215.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.63,-219.62C263.47,-219.62 348.08,-219.62 403.89,-219.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="403.83,-223.13 413.83,-219.63 403.83,-216.13 403.83,-223.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="343.88,-327.25 273.12,-327.25 273.12,-308 343.88,-308 343.88,-327.25"/>
-<text text-anchor="middle" x="308.5" y="-313.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::sort</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.69,-306.13C223.78,-308.27 244.13,-310.54 261.64,-312.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.15,-315.97 271.48,-313.6 261.93,-309.01 261.15,-315.97"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e" target="_top" xlink:title="Erases a value from a sorted multi&#45;value BST.">
-<polygon fill="white" stroke="#666666" points="376.5,-116.5 240.5,-116.5 240.5,-74.75 376.5,-74.75 376.5,-116.5"/>
-<text text-anchor="start" x="248.5" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="248.5" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="308.5" y="-80.5" font-family="Helvetica,sans-Serif" font-size="10.00">::eraseFromSorted</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.69,-125.26C212.82,-122.92 221.18,-120.51 229.45,-118.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.15,-121.56 238.79,-115.43 228.21,-114.84 230.15,-121.56"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="345.38,-154.25 271.62,-154.25 271.62,-135 345.38,-135 345.38,-154.25"/>
-<text text-anchor="middle" x="308.5" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::front</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge10_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge10_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.69,-144.62C223.24,-144.62 242.97,-144.62 260.14,-144.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.06,-148.13 270.06,-144.63 260.06,-141.13 260.06,-148.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24" target="_top" xlink:title="Inserts a value to a sorted multi&#45;value BST.">
-<polygon fill="white" stroke="#666666" points="376.5,-289.5 240.5,-289.5 240.5,-247.75 376.5,-247.75 376.5,-289.5"/>
-<text text-anchor="start" x="248.5" y="-276" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="248.5" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="308.5" y="-253.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insertToSorted</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge11_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge11_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.16,-165.96C181.17,-173.32 193.46,-181.7 204.5,-189.62 227.25,-205.97 252.2,-225.07 271.84,-240.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.52,-243.02 279.55,-246.43 273.83,-237.51 269.52,-243.02"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="355.88,-56.25 261.12,-56.25 261.12,-37 355.88,-37 355.88,-56.25"/>
-<text text-anchor="middle" x="308.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_front</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node14 -->
-<g id="edge15_Node000006_Node000014" class="edge">
-<title>Node6&#45;&gt;Node14</title>
-<g id="a_edge15_Node000006_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.92,-123.36C179.72,-105.64 210.09,-80.89 240.5,-65.62 244.23,-63.75 248.17,-62.04 252.21,-60.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.29,-63.8 261.57,-57.19 250.97,-57.2 253.29,-63.8"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="359.25,-19.25 257.75,-19.25 257.75,0 359.25,0 359.25,-19.25"/>
-<text text-anchor="middle" x="308.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node15 -->
-<g id="edge16_Node000006_Node000015" class="edge">
-<title>Node6&#45;&gt;Node15</title>
-<g id="a_edge16_Node000006_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.42,-123.49C167.67,-97.07 200.73,-52.32 240.5,-27.62 242.62,-26.31 244.84,-25.09 247.12,-23.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.25,-27.28 256.07,-20.13 245.49,-20.84 248.25,-27.28"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="344.62,-191.25 272.38,-191.25 272.38,-172 344.62,-172 344.62,-191.25"/>
-<text text-anchor="middle" x="308.5" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node16 -->
-<g id="edge17_Node000006_Node000016" class="edge">
-<title>Node6&#45;&gt;Node16</title>
-<g id="a_edge17_Node000006_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.69,-159.25C223.57,-163.36 243.68,-167.73 261.06,-171.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.05,-174.88 270.56,-173.59 261.54,-168.04 260.05,-174.88"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge9_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge9_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M362.6,-116.87C367.46,-119.56 372.17,-122.48 376.5,-125.62 405.87,-146.96 432.69,-179.84 448.05,-200.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="445.03,-202.33 453.74,-208.37 450.7,-198.22 445.03,-202.33"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="512.5,-86.25 412.5,-86.25 412.5,-67 512.5,-67 512.5,-86.25"/>
-<text text-anchor="middle" x="462.5" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::erase</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M376.61,-87.24C384.63,-86.23 392.78,-85.22 400.69,-84.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="401.1,-87.7 410.59,-82.99 400.23,-80.76 401.1,-87.7"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="508.38,-123.25 416.62,-123.25 416.62,-104 508.38,-104 508.38,-123.25"/>
-<text text-anchor="middle" x="462.5" y="-109.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::find</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M376.61,-103.57C386.01,-104.68 395.58,-105.82 404.76,-106.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.28,-110.37 414.62,-108.07 405.1,-103.42 404.28,-110.37"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node3 -->
-<g id="edge14_Node000011_Node000003" class="edge">
-<title>Node11&#45;&gt;Node3</title>
-<g id="a_edge14_Node000011_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M375.73,-247.28C390.6,-242.48 405.99,-237.52 419.55,-233.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="420.57,-236.5 429.02,-230.1 418.42,-229.83 420.57,-236.5"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="512.12,-309.25 412.88,-309.25 412.88,-290 512.12,-290 512.12,-309.25"/>
-<text text-anchor="middle" x="462.5" y="-295.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::begin</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge12_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge12_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M376.61,-282.31C384.83,-283.99 393.18,-285.69 401.29,-287.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="400.56,-290.77 411.06,-289.34 401.96,-283.91 400.56,-290.77"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="512.5,-272.25 412.5,-272.25 412.5,-253 512.5,-253 512.5,-272.25"/>
-<text text-anchor="middle" x="462.5" y="-258.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::insert</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node13 -->
-<g id="edge13_Node000011_Node000013" class="edge">
-<title>Node11&#45;&gt;Node13</title>
-<g id="a_edge13_Node000011_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M376.61,-265.98C384.63,-265.66 392.78,-265.34 400.69,-265.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="400.72,-268.53 410.58,-264.64 400.45,-261.53 400.72,-268.53"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph_org.svg b/d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph_org.svg
deleted file mode 100644
index d8b2660cd..000000000
--- a/d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph_org.svg
+++ /dev/null
@@ -1,319 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="521pt" height="335pt"
- viewBox="0.00 0.00 520.50 335.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 331.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-229.25 0,-229.25 0,-210 32.5,-210 32.5,-229.25"/>
-<text text-anchor="middle" x="16.25" y="-215.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d" target="_top" xlink:title="Gets the median of the values in the sliding window.">
-<polygon fill="white" stroke="#666666" points="204.5,-240.5 68.5,-240.5 68.5,-198.75 204.5,-198.75 204.5,-240.5"/>
-<text text-anchor="start" x="76.5" y="-227" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="76.5" y="-215.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="136.5" y="-204.5" font-family="Helvetica,sans-Serif" font-size="10.00">::getMedian</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.71,-219.62C39.39,-219.62 47.74,-219.62 56.78,-219.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.58,-223.13 66.58,-219.63 56.58,-216.13 56.58,-223.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6" target="_top" xlink:title="A naive and inefficient method to obtain the median of the sliding window. Used for testing!">
-<polygon fill="white" stroke="#666666" points="204.5,-319.5 68.5,-319.5 68.5,-277.75 204.5,-277.75 204.5,-319.5"/>
-<text text-anchor="start" x="76.5" y="-306" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="76.5" y="-294.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="136.5" y="-283.5" font-family="Helvetica,sans-Serif" font-size="10.00">::getMedianNaive</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.23,-229.63C47.82,-240.05 72.92,-256.82 94.48,-271.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.25,-273.94 102.51,-276.59 96.14,-268.12 92.25,-273.94"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7" target="_top" xlink:title="Insert a new value to the stream.">
-<polygon fill="white" stroke="#666666" points="204.5,-165.5 68.5,-165.5 68.5,-123.75 204.5,-123.75 204.5,-165.5"/>
-<text text-anchor="start" x="76.5" y="-152" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="76.5" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="136.5" y="-129.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.71,-209.82C47.84,-200.22 71.6,-185.16 92.46,-171.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.26,-174.93 100.83,-166.61 90.51,-169.01 94.26,-174.93"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="509.5,-229.25 415.5,-229.25 415.5,-210 509.5,-210 509.5,-229.25"/>
-<text text-anchor="middle" x="462.5" y="-215.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.63,-219.62C263.47,-219.62 348.08,-219.62 403.89,-219.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="403.83,-223.13 413.83,-219.63 403.83,-216.13 403.83,-223.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="343.88,-327.25 273.12,-327.25 273.12,-308 343.88,-308 343.88,-327.25"/>
-<text text-anchor="middle" x="308.5" y="-313.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::sort</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.69,-306.13C223.78,-308.27 244.13,-310.54 261.64,-312.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.15,-315.97 271.48,-313.6 261.93,-309.01 261.15,-315.97"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e" target="_top" xlink:title="Erases a value from a sorted multi&#45;value BST.">
-<polygon fill="white" stroke="#666666" points="376.5,-116.5 240.5,-116.5 240.5,-74.75 376.5,-74.75 376.5,-116.5"/>
-<text text-anchor="start" x="248.5" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="248.5" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="308.5" y="-80.5" font-family="Helvetica,sans-Serif" font-size="10.00">::eraseFromSorted</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.69,-125.26C212.82,-122.92 221.18,-120.51 229.45,-118.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.15,-121.56 238.79,-115.43 228.21,-114.84 230.15,-121.56"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="345.38,-154.25 271.62,-154.25 271.62,-135 345.38,-135 345.38,-154.25"/>
-<text text-anchor="middle" x="308.5" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::front</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge10_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge10_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.69,-144.62C223.24,-144.62 242.97,-144.62 260.14,-144.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.06,-148.13 270.06,-144.63 260.06,-141.13 260.06,-148.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24" target="_top" xlink:title="Inserts a value to a sorted multi&#45;value BST.">
-<polygon fill="white" stroke="#666666" points="376.5,-289.5 240.5,-289.5 240.5,-247.75 376.5,-247.75 376.5,-289.5"/>
-<text text-anchor="start" x="248.5" y="-276" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="248.5" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="308.5" y="-253.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insertToSorted</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge11_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge11_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.16,-165.96C181.17,-173.32 193.46,-181.7 204.5,-189.62 227.25,-205.97 252.2,-225.07 271.84,-240.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.52,-243.02 279.55,-246.43 273.83,-237.51 269.52,-243.02"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="355.88,-56.25 261.12,-56.25 261.12,-37 355.88,-37 355.88,-56.25"/>
-<text text-anchor="middle" x="308.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_front</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node14 -->
-<g id="edge15_Node000006_Node000014" class="edge">
-<title>Node6&#45;&gt;Node14</title>
-<g id="a_edge15_Node000006_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.92,-123.36C179.72,-105.64 210.09,-80.89 240.5,-65.62 244.23,-63.75 248.17,-62.04 252.21,-60.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.29,-63.8 261.57,-57.19 250.97,-57.2 253.29,-63.8"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="359.25,-19.25 257.75,-19.25 257.75,0 359.25,0 359.25,-19.25"/>
-<text text-anchor="middle" x="308.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node15 -->
-<g id="edge16_Node000006_Node000015" class="edge">
-<title>Node6&#45;&gt;Node15</title>
-<g id="a_edge16_Node000006_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.42,-123.49C167.67,-97.07 200.73,-52.32 240.5,-27.62 242.62,-26.31 244.84,-25.09 247.12,-23.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.25,-27.28 256.07,-20.13 245.49,-20.84 248.25,-27.28"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="344.62,-191.25 272.38,-191.25 272.38,-172 344.62,-172 344.62,-191.25"/>
-<text text-anchor="middle" x="308.5" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node16 -->
-<g id="edge17_Node000006_Node000016" class="edge">
-<title>Node6&#45;&gt;Node16</title>
-<g id="a_edge17_Node000006_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.69,-159.25C223.57,-163.36 243.68,-167.73 261.06,-171.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.05,-174.88 270.56,-173.59 261.54,-168.04 260.05,-174.88"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge9_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge9_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M362.6,-116.87C367.46,-119.56 372.17,-122.48 376.5,-125.62 405.87,-146.96 432.69,-179.84 448.05,-200.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="445.03,-202.33 453.74,-208.37 450.7,-198.22 445.03,-202.33"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="512.5,-86.25 412.5,-86.25 412.5,-67 512.5,-67 512.5,-86.25"/>
-<text text-anchor="middle" x="462.5" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::erase</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M376.61,-87.24C384.63,-86.23 392.78,-85.22 400.69,-84.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="401.1,-87.7 410.59,-82.99 400.23,-80.76 401.1,-87.7"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="508.38,-123.25 416.62,-123.25 416.62,-104 508.38,-104 508.38,-123.25"/>
-<text text-anchor="middle" x="462.5" y="-109.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::find</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M376.61,-103.57C386.01,-104.68 395.58,-105.82 404.76,-106.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.28,-110.37 414.62,-108.07 405.1,-103.42 404.28,-110.37"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node3 -->
-<g id="edge14_Node000011_Node000003" class="edge">
-<title>Node11&#45;&gt;Node3</title>
-<g id="a_edge14_Node000011_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M375.73,-247.28C390.6,-242.48 405.99,-237.52 419.55,-233.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="420.57,-236.5 429.02,-230.1 418.42,-229.83 420.57,-236.5"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="512.12,-309.25 412.88,-309.25 412.88,-290 512.12,-290 512.12,-309.25"/>
-<text text-anchor="middle" x="462.5" y="-295.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::begin</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge12_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge12_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M376.61,-282.31C384.83,-283.99 393.18,-285.69 401.29,-287.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="400.56,-290.77 411.06,-289.34 401.96,-283.91 400.56,-290.77"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="512.5,-272.25 412.5,-272.25 412.5,-253 512.5,-253 512.5,-272.25"/>
-<text text-anchor="middle" x="462.5" y="-258.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::insert</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node13 -->
-<g id="edge13_Node000011_Node000013" class="edge">
-<title>Node11&#45;&gt;Node13</title>
-<g id="a_edge13_Node000011_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M376.61,-265.98C384.63,-265.66 392.78,-265.34 400.69,-265.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="400.72,-268.53 410.58,-264.64 400.45,-261.53 400.72,-268.53"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.map b/d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.map
deleted file mode 100644
index 623420d47..000000000
--- a/d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.map
+++ /dev/null
@@ -1,26 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,177,55,202"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/clear.html#" title=" " alt="" coords="521,77,640,102"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="37,174,63,142,81,125,101,112,153,93,207,79,262,70,317,66,420,67,506,75,505,80,420,72,317,71,263,76,208,84,155,98,104,117,84,129,67,145,42,178"/>
-<area shape="rect" id="Node000003" 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="719,67,873,93"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="33,175,56,125,76,97,101,75,141,53,183,36,226,23,271,13,362,4,453,5,539,14,619,28,742,60,740,65,617,33,539,19,452,10,362,9,272,19,228,28,185,41,143,58,104,80,80,101,61,128,38,177"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="134,127,206,153"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="54,178,118,155,120,161,56,183"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/reserve.html#" title=" " alt="" coords="103,177,237,202"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="55,187,87,187,87,192,55,192"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="130,226,210,252"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="56,195,118,218,116,223,54,200"/>
-<area shape="rect" id="Node000007" href="$dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="148,275,192,301"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="43,201,69,231,104,262,135,276,132,281,101,266,65,235,39,205"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="134,325,206,350"/>
-<area shape="poly" id="edge13_Node000001_Node000011" title=" " alt="" coords="38,202,61,255,80,285,104,311,121,322,118,326,101,315,76,288,56,257,33,204"/>
-<area shape="rect" id="Node000008" href="$df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" title="wrapper interface" alt="" coords="285,150,442,191"/>
-<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="191,280,236,262,284,231,325,199,329,203,287,236,238,266,193,285"/>
-<area shape="poly" id="edge8_Node000008_Node000002" title=" " alt="" coords="407,147,489,112,512,105,514,110,491,117,409,152"/>
-<area shape="rect" id="Node000009" href="$df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" title="function that adds parenthesis to the string." alt="" coords="490,150,671,191"/>
-<area shape="poly" id="edge9_Node000008_Node000009" title=" " alt="" coords="443,168,475,168,475,173,443,173"/>
-<area shape="poly" id="edge12_Node000009_Node000003" title=" " alt="" coords="630,147,748,97,750,102,632,152"/>
-<area shape="poly" id="edge11_Node000009_Node000009" title=" " alt="" coords="540,150,538,140,544,131,559,126,581,124,604,126,618,132,616,137,602,131,580,129,560,131,548,136,543,142,545,149"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="735,158,857,184"/>
-<area shape="poly" id="edge10_Node000009_Node000010" title=" " alt="" coords="671,168,719,168,719,173,671,173"/>
-</map>
diff --git a/d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.md5 b/d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.md5
deleted file mode 100644
index 0ad8369a2..000000000
--- a/d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c7f3b5092f16cf0fc45e86a58a52b185
\ No newline at end of file
diff --git a/d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.svg b/d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.svg
deleted file mode 100644
index fd2718de3..000000000
--- a/d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.svg
+++ /dev/null
@@ -1,313 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 267 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 659;
-var viewHeight = 267;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-130.25 0,-130.25 0,-111 37,-111 37,-130.25"/>
-<text text-anchor="middle" x="18.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="476.12,-205.25 386.62,-205.25 386.62,-186 476.12,-186 476.12,-205.25"/>
-<text text-anchor="middle" x="431.38" y="-191.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.61,-130.72C34.27,-143.98 51.5,-166.75 73,-176.62 171.74,-221.99 302.37,-214.24 375.22,-204.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="375.47,-208.27 384.91,-203.45 374.53,-201.34 375.47,-208.27"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="650.75,-212.25 535,-212.25 535,-193 650.75,-193 650.75,-212.25"/>
-<text text-anchor="middle" x="592.88" y="-198.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.67,-130.75C28.98,-149.01 44.96,-187.18 73,-204.62 226.83,-300.32 459.19,-244.42 551.76,-216.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="552.66,-219.45 561.15,-213.12 550.56,-212.77 552.66,-219.45"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.5,-167.25 96.25,-167.25 96.25,-148 150.5,-148 150.5,-167.25"/>
-<text text-anchor="middle" x="123.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.42,-127.07C50.52,-131.78 68.75,-138.34 84.96,-144.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.76,-147.46 94.36,-147.55 86.13,-140.87 83.76,-147.46"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/reserve.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173.75,-130.25 73,-130.25 73,-111 173.75,-111 173.75,-130.25"/>
-<text text-anchor="middle" x="123.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::reserve</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.42,-120.62C44.38,-120.62 52.79,-120.62 61.58,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.33,-124.13 71.33,-120.63 61.33,-117.13 61.33,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="153.12,-93.25 93.62,-93.25 93.62,-74 153.12,-74 153.12,-93.25"/>
-<text text-anchor="middle" x="123.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.42,-114.18C50.24,-109.57 67.97,-103.19 83.92,-97.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.95,-100.81 93.17,-94.13 82.58,-94.22 84.95,-100.81"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="139.62,-56.25 107.12,-56.25 107.12,-37 139.62,-37 139.62,-56.25"/>
-<text text-anchor="middle" x="123.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.75,-110.58C36.15,-98.21 53.64,-77.28 73,-64.62 79.98,-60.06 88.27,-56.47 96.04,-53.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.92,-57.12 105.4,-50.76 94.81,-50.44 96.92,-57.12"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.5,-19.25 96.25,-19.25 96.25,0 150.5,0 150.5,-19.25"/>
-<text text-anchor="middle" x="123.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge13_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge13_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.63,-110.7C29.05,-91.87 45.48,-50.76 73,-27.62 76.69,-24.52 80.97,-21.93 85.42,-19.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.62,-23.07 94.57,-16.06 83.98,-16.58 86.62,-23.07"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" target="_top" xlink:title="wrapper interface">
-<polygon fill="white" stroke="#666666" points="327.75,-149.88 209.75,-149.88 209.75,-119.38 327.75,-119.38 327.75,-149.88"/>
-<text text-anchor="start" x="217.75" y="-136.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="268.75" y="-125.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::generate</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140,-51.04C149.97,-54.16 162.99,-58.82 173.75,-64.62 198.15,-77.79 223.2,-96.77 241.3,-111.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.02,-114.3 248.93,-118.03 243.51,-108.93 239.02,-114.3"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node2 -->
-<g id="edge8_Node000008_Node000002" class="edge">
-<title>Node8&#45;&gt;Node2</title>
-<g id="a_edge8_Node000008_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M301.91,-150.36C319.85,-158.79 342.75,-168.98 363.75,-176.62 369.19,-178.61 374.94,-180.51 380.69,-182.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.64,-185.64 390.22,-185.16 381.65,-178.94 379.64,-185.64"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" target="_top" xlink:title="function that adds parenthesis to the string.">
-<polygon fill="white" stroke="#666666" points="499,-149.88 363.75,-149.88 363.75,-119.38 499,-119.38 499,-149.88"/>
-<text text-anchor="start" x="371.75" y="-136.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="431.38" y="-125.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::makeStrings</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge9_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M328.19,-134.62C335.94,-134.62 343.97,-134.62 351.98,-134.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="351.75,-138.13 361.75,-134.63 351.75,-131.13 351.75,-138.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge12_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge12_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M468.97,-150.23C495.69,-161.62 531.65,-176.95 557.77,-188.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="556.34,-191.28 566.91,-191.98 559.09,-184.84 556.34,-191.28"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node9 -->
-<g id="edge11_Node000009_Node000009" class="edge">
-<title>Node9&#45;&gt;Node9</title>
-<g id="a_edge11_Node000009_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M402.76,-150.36C396.92,-159.43 406.46,-167.88 431.38,-167.88 445,-167.88 454.03,-165.35 458.46,-161.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="461.9,-162.24 459.79,-151.86 454.96,-161.29 461.9,-162.24"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="638.75,-144.25 547,-144.25 547,-125 638.75,-125 638.75,-144.25"/>
-<text text-anchor="middle" x="592.88" y="-130.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge10_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge10_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M499.09,-134.62C511.13,-134.62 523.57,-134.62 535.29,-134.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="535.2,-138.13 545.2,-134.63 535.2,-131.13 535.2,-138.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph_org.svg b/d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph_org.svg
deleted file mode 100644
index 960cb7534..000000000
--- a/d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph_org.svg
+++ /dev/null
@@ -1,230 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="659pt" height="267pt"
- viewBox="0.00 0.00 658.75 266.67" 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 262.67)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-130.25 0,-130.25 0,-111 37,-111 37,-130.25"/>
-<text text-anchor="middle" x="18.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="476.12,-205.25 386.62,-205.25 386.62,-186 476.12,-186 476.12,-205.25"/>
-<text text-anchor="middle" x="431.38" y="-191.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.61,-130.72C34.27,-143.98 51.5,-166.75 73,-176.62 171.74,-221.99 302.37,-214.24 375.22,-204.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="375.47,-208.27 384.91,-203.45 374.53,-201.34 375.47,-208.27"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="650.75,-212.25 535,-212.25 535,-193 650.75,-193 650.75,-212.25"/>
-<text text-anchor="middle" x="592.88" y="-198.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.67,-130.75C28.98,-149.01 44.96,-187.18 73,-204.62 226.83,-300.32 459.19,-244.42 551.76,-216.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="552.66,-219.45 561.15,-213.12 550.56,-212.77 552.66,-219.45"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.5,-167.25 96.25,-167.25 96.25,-148 150.5,-148 150.5,-167.25"/>
-<text text-anchor="middle" x="123.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.42,-127.07C50.52,-131.78 68.75,-138.34 84.96,-144.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.76,-147.46 94.36,-147.55 86.13,-140.87 83.76,-147.46"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/reserve.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173.75,-130.25 73,-130.25 73,-111 173.75,-111 173.75,-130.25"/>
-<text text-anchor="middle" x="123.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::reserve</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.42,-120.62C44.38,-120.62 52.79,-120.62 61.58,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.33,-124.13 71.33,-120.63 61.33,-117.13 61.33,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="153.12,-93.25 93.62,-93.25 93.62,-74 153.12,-74 153.12,-93.25"/>
-<text text-anchor="middle" x="123.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.42,-114.18C50.24,-109.57 67.97,-103.19 83.92,-97.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.95,-100.81 93.17,-94.13 82.58,-94.22 84.95,-100.81"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="139.62,-56.25 107.12,-56.25 107.12,-37 139.62,-37 139.62,-56.25"/>
-<text text-anchor="middle" x="123.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.75,-110.58C36.15,-98.21 53.64,-77.28 73,-64.62 79.98,-60.06 88.27,-56.47 96.04,-53.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.92,-57.12 105.4,-50.76 94.81,-50.44 96.92,-57.12"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.5,-19.25 96.25,-19.25 96.25,0 150.5,0 150.5,-19.25"/>
-<text text-anchor="middle" x="123.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge13_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge13_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.63,-110.7C29.05,-91.87 45.48,-50.76 73,-27.62 76.69,-24.52 80.97,-21.93 85.42,-19.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.62,-23.07 94.57,-16.06 83.98,-16.58 86.62,-23.07"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" target="_top" xlink:title="wrapper interface">
-<polygon fill="white" stroke="#666666" points="327.75,-149.88 209.75,-149.88 209.75,-119.38 327.75,-119.38 327.75,-149.88"/>
-<text text-anchor="start" x="217.75" y="-136.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="268.75" y="-125.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::generate</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140,-51.04C149.97,-54.16 162.99,-58.82 173.75,-64.62 198.15,-77.79 223.2,-96.77 241.3,-111.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.02,-114.3 248.93,-118.03 243.51,-108.93 239.02,-114.3"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node2 -->
-<g id="edge8_Node000008_Node000002" class="edge">
-<title>Node8&#45;&gt;Node2</title>
-<g id="a_edge8_Node000008_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M301.91,-150.36C319.85,-158.79 342.75,-168.98 363.75,-176.62 369.19,-178.61 374.94,-180.51 380.69,-182.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.64,-185.64 390.22,-185.16 381.65,-178.94 379.64,-185.64"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" target="_top" xlink:title="function that adds parenthesis to the string.">
-<polygon fill="white" stroke="#666666" points="499,-149.88 363.75,-149.88 363.75,-119.38 499,-119.38 499,-149.88"/>
-<text text-anchor="start" x="371.75" y="-136.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="431.38" y="-125.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::makeStrings</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge9_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M328.19,-134.62C335.94,-134.62 343.97,-134.62 351.98,-134.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="351.75,-138.13 361.75,-134.63 351.75,-131.13 351.75,-138.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge12_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge12_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M468.97,-150.23C495.69,-161.62 531.65,-176.95 557.77,-188.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="556.34,-191.28 566.91,-191.98 559.09,-184.84 556.34,-191.28"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node9 -->
-<g id="edge11_Node000009_Node000009" class="edge">
-<title>Node9&#45;&gt;Node9</title>
-<g id="a_edge11_Node000009_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M402.76,-150.36C396.92,-159.43 406.46,-167.88 431.38,-167.88 445,-167.88 454.03,-165.35 458.46,-161.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="461.9,-162.24 459.79,-151.86 454.96,-161.29 461.9,-162.24"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="638.75,-144.25 547,-144.25 547,-125 638.75,-125 638.75,-144.25"/>
-<text text-anchor="middle" x="592.88" y="-130.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge10_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge10_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M499.09,-134.62C511.13,-134.62 523.57,-134.62 535.29,-134.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="535.2,-138.13 545.2,-134.63 535.2,-131.13 535.2,-138.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/ded/windowed__median_8cpp_source.html b/d1/ded/windowed__median_8cpp_source.html
new file mode 100644
index 000000000..c3d74d4b5
--- /dev/null
+++ b/d1/ded/windowed__median_8cpp_source.html
@@ -0,0 +1,299 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: probability/windowed_median.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/ded/windowed__median_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">windowed_median.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d1/ded/windowed__median_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;cassert&gt;</span>  </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &lt;cstdlib&gt;</span>  </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#include &lt;ctime&gt;</span>    </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;list&gt;</span>     </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#include &lt;set&gt;</span>  </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#include &lt;vector&gt;</span>  </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a> {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d21/namespacewindowed__median.html">windowed_median</a> {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="keyword">using </span>Window = std::list&lt;int&gt;;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="keyword">using </span>size_type = Window::size_type;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="foldopen" id="foldopen00056" data-start="{" data-end="};">
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">   56</a></span><span class="keyword">class </span><a class="code hl_class" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">WindowedMedian</a> {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750">   57</a></span>    <span class="keyword">const</span> size_type <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750">_windowSize</a>;  </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2">   58</a></span>    Window <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2">_window</a>;  </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">   59</a></span>    std::multiset&lt;int&gt; <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>;  </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    std::multiset&lt;int&gt;::const_iterator</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">   62</a></span>        <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>;  </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="foldopen" id="foldopen00069" data-start="{" data-end="}">
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24">   69</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24">insertToSorted</a>(<span class="keywordtype">int</span> value) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.insert(value);  </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        <span class="keyword">const</span> <span class="keyword">auto</span> sz = <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.size();</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        <span class="keywordflow">if</span> (sz == 1) {  </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> = <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.begin();</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        }</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="keywordflow">if</span> (value &lt; *<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> &amp;&amp; sz % 2 == 0) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>            --<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>;  <span class="comment">// O(1) - traversing one step to the left child</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        }</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (value &gt;= *<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> &amp;&amp; sz % 2 != 0) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            ++<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>;  </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    }</div>
+</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="foldopen" id="foldopen00095" data-start="{" data-end="}">
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e">   95</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e">eraseFromSorted</a>(<span class="keywordtype">int</span> value) {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        <span class="keyword">const</span> <span class="keyword">auto</span> sz = <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.size();</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        <span class="keywordflow">if</span> (value &lt;= *<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> &amp;&amp; sz % 2 == 0) {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>            ++<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>;  </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        }</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (value &gt;= *<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> &amp;&amp; sz % 2 != 0) {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            --<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>;  <span class="comment">// O(1) - traversing one step to the left child</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        }</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        <span class="keyword">const</span> <span class="keyword">auto</span> it = <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.find(value);  <span class="comment">// O(logN)</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.erase(it);                    <span class="comment">// O(logN)</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    }</div>
+</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span> </div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"><a class="line" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d">  123</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d">WindowedMedian</a>(size_type windowSize) : <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750">_windowSize</a>(windowSize){};</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
+<div class="foldopen" id="foldopen00129" data-start="{" data-end="}">
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"><a class="line" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7">  129</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7">insert</a>(<span class="keywordtype">int</span> value) {</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2">_window</a>.push_back(value);</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        <a class="code hl_function" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24">insertToSorted</a>(value);  <span class="comment">// Insert value to the multi-value BST - O(logN)</span></div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2">_window</a>.size() &gt; <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750">_windowSize</a>) {  </div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>            <a class="code hl_function" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e">eraseFromSorted</a>(</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>                <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2">_window</a>.front());  </div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>            <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2">_window</a>.pop_front();   </div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        }</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    }</div>
+</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span> </div>
+<div class="foldopen" id="foldopen00148" data-start="{" data-end="}">
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"><a class="line" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d">  148</a></span>    <span class="keywordtype">float</span> <a class="code hl_function" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d">getMedian</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.size() % 2 != 0) {</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>            <span class="keywordflow">return</span> *<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>;  <span class="comment">// O(1)</span></div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>        }</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>        <span class="keywordflow">return</span> 0.5f * *<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> + 0.5f * *next(<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>);  </div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    }</div>
+</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span> </div>
+<div class="foldopen" id="foldopen00161" data-start="{" data-end="}">
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"><a class="line" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6">  161</a></span>    <span class="keywordtype">float</span> <a class="code hl_function" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6">getMedianNaive</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        <span class="keyword">auto</span> window = <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2">_window</a>;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        window.sort();  </div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>        <span class="keyword">auto</span> median =</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>            *next(window.begin(),</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>                  window.size() / 2);  </div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>        <span class="keywordflow">if</span> (window.size() % 2 != 0) {</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>            <span class="keywordflow">return</span> median;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>        }</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        <span class="keywordflow">return</span> 0.5f * median +</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>               0.5f * *next(window.begin(), window.size() / 2 - 1);  </div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    }</div>
+</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>};</div>
+</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>}  <span class="comment">// namespace windowed_median</span></div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>}  <span class="comment">// namespace probability</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
+<div class="foldopen" id="foldopen00182" data-start="{" data-end="}">
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"><a class="line" href="../../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601">  182</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(<span class="keyword">const</span> std::vector&lt;int&gt; &amp;vals, <span class="keywordtype">int</span> windowSize) {</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    <a class="code hl_class" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a> windowedMedian(windowSize);</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> val : vals) {</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        windowedMedian.<a class="code hl_function" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7">insert</a>(val);</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span> </div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>        assert(windowedMedian.<a class="code hl_function" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d">getMedian</a>() == windowedMedian.<a class="code hl_function" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6">getMedianNaive</a>());</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    }</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>}</div>
+</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span> </div>
+<div class="foldopen" id="foldopen00198" data-start="{" data-end="}">
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"><a class="line" href="../../d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c">  198</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keyword">const</span> <span class="keywordtype">char</span> *argv[]) {</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({1, 2, 3, 4, 5, 6, 7, 8, 9},</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>         3);  </div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({9, 8, 7, 6, 5, 4, 3, 2, 1},</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>         3);  </div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({9, 8, 7, 6, 5, 4, 5, 6}, 4);     </div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({3, 3, 3, 3, 3, 3, 3, 3, 3}, 3);  </div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({3, 3, 3, 3, 7, 3, 3, 3, 3}, 3);  </div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({4, 3, 3, -5, -5, 1, 3, 4, 5},</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>         5);  </div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span> </div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>({470211272, 101027544, 1457850878, 1458777923, 2007237709, 823564440,</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>          1115438165, 1784484492, 74243042, 114807987},</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>         6);</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span> </div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    std::srand(<span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">&gt;</span>(std::time(<span class="keyword">nullptr</span>)));</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    std::vector&lt;int&gt; vals;</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 8; i &lt; 100; i++) {</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>        <span class="keyword">const</span> <span class="keyword">auto</span> n =</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>            1 + std::rand() /</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>                    ((RAND_MAX + 5u) / 20);  </div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>        <span class="keyword">auto</span> windowSize =</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>            1 + std::rand() / ((RAND_MAX + 3u) /</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>                               10);  </div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>        vals.clear();</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>        vals.reserve(n);</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>            vals.push_back(</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>                rand() - RAND_MAX);  </div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>        }</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>        <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(vals, windowSize);  </div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    }</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>}</div>
+</div>
+<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a></div><div class="ttdoc">A class to calculate the median of a leading sliding window at the back of a stream of integer values...</div><div class="ttdef"><b>Definition</b> <a href="#l00056">windowed_median.cpp:56</a></div></div>
+<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_a3a7f57679e9cd6c9f042dfd0612b2b24"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24">probability::windowed_median::WindowedMedian::insertToSorted</a></div><div class="ttdeci">void insertToSorted(int value)</div><div class="ttdoc">Inserts a value to a sorted multi-value BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00069">windowed_median.cpp:69</a></div></div>
+<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_a55ae3543a76045dffcb5ec7904a32a20"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">probability::windowed_median::WindowedMedian::_itMedian</a></div><div class="ttdeci">std::multiset&lt; int &gt;::const_iterator _itMedian</div><div class="ttdef"><b>Definition</b> <a href="#l00062">windowed_median.cpp:62</a></div></div>
+<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_a61804988fcb1a6caf640f8291979aaa6"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6">probability::windowed_median::WindowedMedian::getMedianNaive</a></div><div class="ttdeci">float getMedianNaive() const</div><div class="ttdoc">A naive and inefficient method to obtain the median of the sliding window. Used for testing!</div><div class="ttdef"><b>Definition</b> <a href="#l00161">windowed_median.cpp:161</a></div></div>
+<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_a6b52b7851750f28d53508e63c52a69f7"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7">probability::windowed_median::WindowedMedian::insert</a></div><div class="ttdeci">void insert(int value)</div><div class="ttdoc">Insert a new value to the stream.</div><div class="ttdef"><b>Definition</b> <a href="#l00129">windowed_median.cpp:129</a></div></div>
+<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_a825a7aaef844c9f743a27b268e8569b2"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2">probability::windowed_median::WindowedMedian::_window</a></div><div class="ttdeci">Window _window</div><div class="ttdoc">a sliding window of values along the stream</div><div class="ttdef"><b>Definition</b> <a href="#l00058">windowed_median.cpp:58</a></div></div>
+<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_a938cafbdf70dc01e86e9bb12d29ec65d"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d">probability::windowed_median::WindowedMedian::getMedian</a></div><div class="ttdeci">float getMedian() const</div><div class="ttdoc">Gets the median of the values in the sliding window.</div><div class="ttdef"><b>Definition</b> <a href="#l00148">windowed_median.cpp:148</a></div></div>
+<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_aac676369661d15a3eb782c0fee77d45d"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d">probability::windowed_median::WindowedMedian::WindowedMedian</a></div><div class="ttdeci">WindowedMedian(size_type windowSize)</div><div class="ttdoc">Constructs a WindowedMedian object.</div><div class="ttdef"><b>Definition</b> <a href="#l00123">windowed_median.cpp:123</a></div></div>
+<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_aacd76f078632faee1a8788d031e6c2de"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">probability::windowed_median::WindowedMedian::_sortedValues</a></div><div class="ttdeci">std::multiset&lt; int &gt; _sortedValues</div><div class="ttdef"><b>Definition</b> <a href="#l00059">windowed_median.cpp:59</a></div></div>
+<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_aafda847b152684578dab891e5268d750"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750">probability::windowed_median::WindowedMedian::_windowSize</a></div><div class="ttdeci">const size_type _windowSize</div><div class="ttdoc">sliding window size</div><div class="ttdef"><b>Definition</b> <a href="#l00057">windowed_median.cpp:57</a></div></div>
+<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_af544e271ea19a6fd69a6b3ed6816453e"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e">probability::windowed_median::WindowedMedian::eraseFromSorted</a></div><div class="ttdeci">void eraseFromSorted(int value)</div><div class="ttdoc">Erases a value from a sorted multi-value BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00095">windowed_median.cpp:95</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00082">generate_parentheses.cpp:82</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespaceprobability_html"><div class="ttname"><a href="../../d4/ded/namespaceprobability.html">probability</a></div><div class="ttdoc">Probability algorithms.</div></div>
+<div class="ttc" id="anamespacewindowed__median_html"><div class="ttname"><a href="../../dd/d21/namespacewindowed__median.html">windowed_median</a></div><div class="ttdoc">Functions for the Windowed Median algorithm implementation.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_82e494173a87936756866de2fa774307.html">probability</a></li><li class="navelem"><a class="el" href="../../d1/ded/windowed__median_8cpp.html">windowed_median.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list.html b/d1/def/classdata__structures_1_1linked__list_1_1list.html
index 6cbc449cf..501f00d86 100644
--- a/d1/def/classdata__structures_1_1linked__list_1_1list.html
+++ b/d1/def/classdata__structures_1_1linked__list_1_1list.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::linked_list::list Class Reference</title>
+<title>TheAlgorithms/C++: data_structures::linked_list::list Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -132,7 +149,7 @@ Public Member Functions</h2></td></tr>
 <tr class="separator:a009b19ac8cca40f2e4daa2e5989fa4f3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a1313837c0e9ec67fd9fbd17987e2d615" id="r_a1313837c0e9ec67fd9fbd17987e2d615"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1313837c0e9ec67fd9fbd17987e2d615">display</a> ()</td></tr>
 <tr class="separator:a1313837c0e9ec67fd9fbd17987e2d615"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad3423f7518671351340932db3c24959a" id="r_ad3423f7518671351340932db3c24959a"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad3423f7518671351340932db3c24959a">search</a> (int find_elem)</td></tr>
+<tr class="memitem:ad3423f7518671351340932db3c24959a" id="r_ad3423f7518671351340932db3c24959a"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad3423f7518671351340932db3c24959a">search</a> (int find_elem)</td></tr>
 <tr class="separator:ad3423f7518671351340932db3c24959a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af0981944884c6dc19361ff67451261c9" id="r_af0981944884c6dc19361ff67451261c9"><td class="memItemLeft" align="right" valign="top"><a id="af0981944884c6dc19361ff67451261c9" name="af0981944884c6dc19361ff67451261c9"></a>
 void&#160;</td><td class="memItemRight" valign="bottom"><b>reverse</b> ()</td></tr>
@@ -175,19 +192,19 @@ Private Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:aa3801cea564a3b3bb7b03abfffdcf1e1" id="r_aa3801cea564a3b3bb7b03abfffdcf1e1"><td class="memItemLeft" align="right" valign="top"><a id="aa3801cea564a3b3bb7b03abfffdcf1e1" name="aa3801cea564a3b3bb7b03abfffdcf1e1"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>first</b></td></tr>
-<tr class="memdesc:aa3801cea564a3b3bb7b03abfffdcf1e1"><td class="mdescLeft">&#160;</td><td class="mdescRight">link before the actual first element <br /></td></tr>
+<tr class="memitem:aa3801cea564a3b3bb7b03abfffdcf1e1" id="r_aa3801cea564a3b3bb7b03abfffdcf1e1"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a></td></tr>
+<tr class="memdesc:aa3801cea564a3b3bb7b03abfffdcf1e1"><td class="mdescLeft">&#160;</td><td class="mdescRight">link before the actual first element  <br /></td></tr>
 <tr class="separator:aa3801cea564a3b3bb7b03abfffdcf1e1"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af39bcc08641ce0c813023f364a9a9015" id="r_af39bcc08641ce0c813023f364a9a9015"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af39bcc08641ce0c813023f364a9a9015">last</a></td></tr>
+<tr class="memitem:af39bcc08641ce0c813023f364a9a9015" id="r_af39bcc08641ce0c813023f364a9a9015"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af39bcc08641ce0c813023f364a9a9015">last</a></td></tr>
 <tr class="memdesc:af39bcc08641ce0c813023f364a9a9015"><td class="mdescLeft">&#160;</td><td class="mdescRight">last link on the list  <br /></td></tr>
 <tr class="separator:af39bcc08641ce0c813023f364a9a9015"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad7e7823ae52c4ebf3b85a1bec096be5d" id="r_ad7e7823ae52c4ebf3b85a1bec096be5d"><td class="memItemLeft" align="right" valign="top"><a id="ad7e7823ae52c4ebf3b85a1bec096be5d" name="ad7e7823ae52c4ebf3b85a1bec096be5d"></a>
-<a class="el" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>head</b> = nullptr</td></tr>
+<tr class="memitem:ad7e7823ae52c4ebf3b85a1bec096be5d" id="r_ad7e7823ae52c4ebf3b85a1bec096be5d"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad7e7823ae52c4ebf3b85a1bec096be5d">head</a> = nullptr</td></tr>
 <tr class="separator:ad7e7823ae52c4ebf3b85a1bec096be5d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A list class containing a sequence of links </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00068">68</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a50e209b55b83622254177050945e7826" name="a50e209b55b83622254177050945e7826"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a50e209b55b83622254177050945e7826">&#9670;&#160;</a></span>list() <span class="overload">[1/2]</span></h2>
@@ -212,21 +229,17 @@ Private Attributes</h2></td></tr>
 </table>
 </div><div class="memdoc">
 <p>List constructor. Initializes the first and last link. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00089">89</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   89</span>           {</div>
 <div class="line"><span class="lineno">   90</span>        <span class="comment">// Initialize the first link</span></div>
-<div class="line"><span class="lineno">   91</span>        <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;link&gt;</a>();</div>
+<div class="line"><span class="lineno">   91</span>        <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a> = std::make_shared&lt;link&gt;();</div>
 <div class="line"><span class="lineno">   92</span>        <span class="comment">// Initialize the last link with the first link</span></div>
 <div class="line"><span class="lineno">   93</span>        <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a> = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">   94</span>    }</div>
-<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_aa3801cea564a3b3bb7b03abfffdcf1e1"><div class="ttname"><a href="#aa3801cea564a3b3bb7b03abfffdcf1e1">data_structures::linked_list::list::first</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; first</div><div class="ttdoc">link before the actual first element</div><div class="ttdef"><b>Definition</b> linked_list.cpp:83</div></div>
-<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_af39bcc08641ce0c813023f364a9a9015"><div class="ttname"><a href="#af39bcc08641ce0c813023f364a9a9015">data_structures::linked_list::list::last</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; last</div><div class="ttdoc">last link on the list</div><div class="ttdef"><b>Definition</b> linked_list.cpp:84</div></div>
-<div class="ttc" id="amake_shared_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared</a></div><div class="ttdeci">T make_shared(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.svg" width="338" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_aa3801cea564a3b3bb7b03abfffdcf1e1"><div class="ttname"><a href="#aa3801cea564a3b3bb7b03abfffdcf1e1">data_structures::linked_list::list::first</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; first</div><div class="ttdoc">link before the actual first element</div><div class="ttdef"><b>Definition</b> <a href="../../da/dc3/linked__list_8cpp_source.html#l00083">linked_list.cpp:83</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_af39bcc08641ce0c813023f364a9a9015"><div class="ttname"><a href="#af39bcc08641ce0c813023f364a9a9015">data_structures::linked_list::list::last</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; last</div><div class="ttdoc">last link on the list</div><div class="ttdef"><b>Definition</b> <a href="../../da/dc3/linked__list_8cpp_source.html#l00084">linked_list.cpp:84</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a72eaabb03a048506432f8d167db12524" name="a72eaabb03a048506432f8d167db12524"></a>
@@ -243,8 +256,10 @@ Here is the call graph for this function:</div>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00196">196</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  196</span>{ <a class="code hl_function" href="#ac614ed8f1953f5486fab1cd6d7aa0500">delete_all_nodes</a>(); }</div>
-<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_ac614ed8f1953f5486fab1cd6d7aa0500"><div class="ttname"><a href="#ac614ed8f1953f5486fab1cd6d7aa0500">data_structures::linked_list::list::delete_all_nodes</a></div><div class="ttdeci">void delete_all_nodes()</div><div class="ttdoc">calls delete operator on every node in the represented list</div><div class="ttdef"><b>Definition</b> reverse_a_linked_list.cpp:188</div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_ac614ed8f1953f5486fab1cd6d7aa0500"><div class="ttname"><a href="#ac614ed8f1953f5486fab1cd6d7aa0500">data_structures::linked_list::list::delete_all_nodes</a></div><div class="ttdeci">void delete_all_nodes()</div><div class="ttdoc">calls delete operator on every node in the represented list</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00188">reverse_a_linked_list.cpp:188</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -264,6 +279,8 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>copy constructor creating a deep copy of every node of the input </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00206">206</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  206</span>{ copy_all_nodes_from_list(other); }</div>
 </div><!-- fragment -->
 </div>
@@ -291,12 +308,14 @@ Here is the call graph for this function:</div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00198">198</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  198</span>                                                     {</div>
 <div class="line"><span class="lineno">  199</span>    assert(<a class="code hl_function" href="#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>());</div>
 <div class="line"><span class="lineno">  200</span>    head = <a class="code hl_function" href="../../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511">copy_all_nodes</a>(other.head);</div>
 <div class="line"><span class="lineno">  201</span>}</div>
-<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a454ab4918f579869dfed4bb420a3f897"><div class="ttname"><a href="#a454ab4918f579869dfed4bb420a3f897">data_structures::linked_list::list::isEmpty</a></div><div class="ttdeci">bool isEmpty()</div><div class="ttdef"><b>Definition</b> linked_list.cpp:111</div></div>
-<div class="ttc" id="areverse__a__linked__list_8cpp_html_a7f80d9712cc7d77399dcacb4c2917511"><div class="ttname"><a href="../../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511">data_structures::linked_list::copy_all_nodes</a></div><div class="ttdeci">Node * copy_all_nodes(const Node *const node)</div><div class="ttdoc">creates a deep copy of a list starting at the input node</div><div class="ttdef"><b>Definition</b> reverse_a_linked_list.cpp:53</div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a454ab4918f579869dfed4bb420a3f897"><div class="ttname"><a href="#a454ab4918f579869dfed4bb420a3f897">data_structures::linked_list::list::isEmpty</a></div><div class="ttdeci">bool isEmpty()</div><div class="ttdef"><b>Definition</b> <a href="../../da/dc3/linked__list_8cpp_source.html#l00111">linked_list.cpp:111</a></div></div>
+<div class="ttc" id="areverse__a__linked__list_8cpp_html_a7f80d9712cc7d77399dcacb4c2917511"><div class="ttname"><a href="../../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511">data_structures::linked_list::copy_all_nodes</a></div><div class="ttdeci">Node * copy_all_nodes(const Node *const node)</div><div class="ttdoc">creates a deep copy of a list starting at the input node</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00053">reverse_a_linked_list.cpp:53</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -324,6 +343,8 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>calls delete operator on every node in the represented list </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00188">188</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  188</span>                            {</div>
 <div class="line"><span class="lineno">  189</span>    <span class="keywordflow">while</span> (head != <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">  190</span>        <span class="keyword">const</span> <span class="keyword">auto</span> tmp_node = head-&gt;<a class="code hl_variable" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">next</a>;</div>
@@ -331,7 +352,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  192</span>        head = tmp_node;</div>
 <div class="line"><span class="lineno">  193</span>    }</div>
 <div class="line"><span class="lineno">  194</span>}</div>
-<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1_node_html_acfccd7b52c91d91300c5b317e5ec7a6e"><div class="ttname"><a href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">data_structures::linked_list::Node::next</a></div><div class="ttdeci">Node * next</div><div class="ttdoc">value of the current link</div><div class="ttdef"><b>Definition</b> reverse_a_linked_list.cpp:45</div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1_node_html_acfccd7b52c91d91300c5b317e5ec7a6e"><div class="ttname"><a href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">data_structures::linked_list::Node::next</a></div><div class="ttdeci">Node * next</div><div class="ttdoc">value of the current link</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00045">reverse_a_linked_list.cpp:45</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -350,25 +371,20 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>function displays all the elements in the list </p><dl class="section return"><dt>Returns</dt><dd>'void' </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00181">181</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  181</span>                   {</div>
 <div class="line"><span class="lineno">  182</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
-<div class="line"><span class="lineno">  183</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;List is Empty!&quot;</span>;</div>
+<div class="line"><span class="lineno">  183</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;List is Empty!&quot;</span>;</div>
 <div class="line"><span class="lineno">  184</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  185</span>    }</div>
-<div class="line"><span class="lineno">  186</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;link&gt;</a> t = <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>;</div>
+<div class="line"><span class="lineno">  186</span>    std::shared_ptr&lt;link&gt; t = <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>;</div>
 <div class="line"><span class="lineno">  187</span>    <span class="keywordflow">while</span> (t-&gt;succ() != <span class="keyword">nullptr</span>) {</div>
-<div class="line"><span class="lineno">  188</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; t-&gt;succ()-&gt;val() &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><span class="lineno">  188</span>        std::cout &lt;&lt; t-&gt;succ()-&gt;val() &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
 <div class="line"><span class="lineno">  189</span>        t = t-&gt;succ();</div>
 <div class="line"><span class="lineno">  190</span>    }</div>
 <div class="line"><span class="lineno">  191</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="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/def/classdata__structures_1_1linked__list_1_1list_a1313837c0e9ec67fd9fbd17987e2d615_cgraph.svg" width="366" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a009b19ac8cca40f2e4daa2e5989fa4f3" name="a009b19ac8cca40f2e4daa2e5989fa4f3"></a>
@@ -391,23 +407,25 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00152">152</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  152</span>                             {</div>
 <div class="line"><span class="lineno">  153</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
-<div class="line"><span class="lineno">  154</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;List is Empty!&quot;</span>;</div>
+<div class="line"><span class="lineno">  154</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;List is Empty!&quot;</span>;</div>
 <div class="line"><span class="lineno">  155</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  156</span>    }</div>
-<div class="line"><span class="lineno">  157</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;link&gt;</a> t = <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>;</div>
-<div class="line"><span class="lineno">  158</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;link&gt;</a> to_be_removed = <span class="keyword">nullptr</span>;</div>
+<div class="line"><span class="lineno">  157</span>    std::shared_ptr&lt;link&gt; t = <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>;</div>
+<div class="line"><span class="lineno">  158</span>    std::shared_ptr&lt;link&gt; to_be_removed = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  159</span>    <span class="keywordflow">while</span> (t != <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a> &amp;&amp; t-&gt;succ()-&gt;val() != old_elem) {</div>
 <div class="line"><span class="lineno">  160</span>        t = t-&gt;succ();</div>
 <div class="line"><span class="lineno">  161</span>    }</div>
 <div class="line"><span class="lineno">  162</span>    <span class="keywordflow">if</span> (t == <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a>) {</div>
-<div class="line"><span class="lineno">  163</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Element not found\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  163</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Element not found\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  164</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  165</span>    }</div>
 <div class="line"><span class="lineno">  166</span>    to_be_removed = t-&gt;succ();</div>
 <div class="line"><span class="lineno">  167</span>    t-&gt;succ() = t-&gt;succ()-&gt;succ();</div>
-<div class="line"><span class="lineno">  168</span>    to_be_removed.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/reset.html">reset</a>();</div>
+<div class="line"><span class="lineno">  168</span>    to_be_removed.reset();</div>
 <div class="line"><span class="lineno">  169</span>    <span class="keywordflow">if</span> (t-&gt;succ() == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">  170</span>        <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a> = t;</div>
 <div class="line"><span class="lineno">  171</span>    }</div>
@@ -415,13 +433,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  173</span>        <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a> = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  174</span>    }</div>
 <div class="line"><span class="lineno">  175</span>}</div>
-<div class="ttc" id="areset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr/reset.html">std::shared_ptr::reset</a></div><div class="ttdeci">T reset(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/def/classdata__structures_1_1linked__list_1_1list_a009b19ac8cca40f2e4daa2e5989fa4f3_cgraph.svg" width="366" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa69707af46eb6d410eb3a54ee58e1ed1" name="aa69707af46eb6d410eb3a54ee58e1ed1"></a>
@@ -446,6 +458,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00099">99</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   99</span>                           {</div>
 <div class="line"><span class="lineno">  100</span>    <span class="keywordflow">try</span> {</div>
 <div class="line"><span class="lineno">  101</span>        <span class="comment">// NOLINTNEXTLINE(cppcoreguidelines-owning-memory)</span></div>
@@ -462,19 +476,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  112</span>            }</div>
 <div class="line"><span class="lineno">  113</span>            temp-&gt;next = new_node;</div>
 <div class="line"><span class="lineno">  114</span>        }</div>
-<div class="line"><span class="lineno">  115</span>    } <span class="keywordflow">catch</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html">std::bad_alloc</a>&amp; exception) {</div>
-<div class="line"><span class="lineno">  116</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;bad_alloc detected: &quot;</span> &lt;&lt; exception.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/exception/what.html">what</a>() &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  115</span>    } <span class="keywordflow">catch</span> (std::bad_alloc&amp; exception) {</div>
+<div class="line"><span class="lineno">  116</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;bad_alloc detected: &quot;</span> &lt;&lt; exception.what() &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  117</span>    }</div>
 <div class="line"><span class="lineno">  118</span>}</div>
-<div class="ttc" id="abad_alloc_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html">std::bad_alloc</a></div></div>
-<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</div></div>
-<div class="ttc" id="awhat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/exception/what.html">std::bad_alloc::what</a></div><div class="ttdeci">T what(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.svg" width="366" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a454ab4918f579869dfed4bb420a3f897" name="a454ab4918f579869dfed4bb420a3f897"></a>
@@ -494,6 +501,8 @@ Here is the call graph for this function:</div>
 <p>function checks if list is empty </p><dl class="section return"><dt>Returns</dt><dd>true if list is empty </dd>
 <dd>
 false if list is not empty </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00111">111</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  111</span>                   {</div>
 <div class="line"><span class="lineno">  112</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a> == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">  113</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
@@ -523,6 +532,8 @@ false if list is not empty </dd></dl>
 <dl class="section return"><dt>Returns</dt><dd>true if the list is empty </dd>
 <dd>
 false if the list is not empty </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00093">93</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   93</span>{ <span class="keywordflow">return</span> head == <span class="keyword">nullptr</span>; }</div>
 </div><!-- fragment -->
 </div>
@@ -543,6 +554,8 @@ false if the list is not empty </dd></dl>
 </div><div class="memdoc">
 
 <p>assignment operator creating a deep copy of every node of the input </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00211">211</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  211</span>                                       {</div>
 <div class="line"><span class="lineno">  212</span>    <span class="keywordflow">if</span> (<span class="keyword">this</span> == &amp;other) {</div>
 <div class="line"><span class="lineno">  213</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -552,12 +565,7 @@ false if the list is not empty </dd></dl>
 <div class="line"><span class="lineno">  217</span>    copy_all_nodes_from_list(other);</div>
 <div class="line"><span class="lineno">  218</span>    <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  219</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/def/classdata__structures_1_1linked__list_1_1list_adb04f732911fcfd30f7177b367c6af41_cgraph.svg" width="388" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6e9859d1a0755fb51e41904d20c95496" name="a6e9859d1a0755fb51e41904d20c95496"></a>
@@ -580,21 +588,18 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00123">123</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  123</span>                                 {</div>
 <div class="line"><span class="lineno">  124</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
-<div class="line"><span class="lineno">  125</span>        <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ() = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;link&gt;</a>(new_elem);</div>
+<div class="line"><span class="lineno">  125</span>        <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ() = std::make_shared&lt;link&gt;(new_elem);</div>
 <div class="line"><span class="lineno">  126</span>        <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a> = <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ();</div>
 <div class="line"><span class="lineno">  127</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  128</span>        <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a>-&gt;succ() = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;link&gt;</a>(new_elem);</div>
+<div class="line"><span class="lineno">  128</span>        <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a>-&gt;succ() = std::make_shared&lt;link&gt;(new_elem);</div>
 <div class="line"><span class="lineno">  129</span>        <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a> = <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a>-&gt;succ();</div>
 <div class="line"><span class="lineno">  130</span>    }</div>
 <div class="line"><span class="lineno">  131</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph.svg" width="366" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a332b965afd9d6bea8d3246673acd52c7" name="a332b965afd9d6bea8d3246673acd52c7"></a>
@@ -617,22 +622,19 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00137">137</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  137</span>                                  {</div>
 <div class="line"><span class="lineno">  138</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
-<div class="line"><span class="lineno">  139</span>        <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ() = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;link&gt;</a>(new_elem);</div>
+<div class="line"><span class="lineno">  139</span>        <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ() = std::make_shared&lt;link&gt;(new_elem);</div>
 <div class="line"><span class="lineno">  140</span>        <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a> = <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ();</div>
 <div class="line"><span class="lineno">  141</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  142</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;link&gt;</a> t = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;link&gt;</a>(new_elem);</div>
+<div class="line"><span class="lineno">  142</span>        std::shared_ptr&lt;link&gt; t = std::make_shared&lt;link&gt;(new_elem);</div>
 <div class="line"><span class="lineno">  143</span>        t-&gt;succ() = <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ();</div>
 <div class="line"><span class="lineno">  144</span>        <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ() = t;</div>
 <div class="line"><span class="lineno">  145</span>    }</div>
 <div class="line"><span class="lineno">  146</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph.svg" width="366" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac466ec086c0835822467bd3d8f3ab90e" name="ac466ec086c0835822467bd3d8f3ab90e"></a>
@@ -652,19 +654,20 @@ Here is the call graph for this function:</div>
 
 <p>Utility function for reversing a list. </p>
 <p>Using the current, previous, and next pointer. </p><dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00125">125</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  125</span>                       {</div>
 <div class="line"><span class="lineno">  126</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* curr = head;</div>
-<div class="line"><span class="lineno">  127</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a> = <span class="keyword">nullptr</span>;</div>
+<div class="line"><span class="lineno">  127</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* prev = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  128</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* next_node = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  129</span>    <span class="keywordflow">while</span> (curr != <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">  130</span>        next_node = curr-&gt;next;</div>
-<div class="line"><span class="lineno">  131</span>        curr-&gt;next = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a>;</div>
-<div class="line"><span class="lineno">  132</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a> = curr;</div>
+<div class="line"><span class="lineno">  131</span>        curr-&gt;next = prev;</div>
+<div class="line"><span class="lineno">  132</span>        prev = curr;</div>
 <div class="line"><span class="lineno">  133</span>        curr = next_node;</div>
 <div class="line"><span class="lineno">  134</span>    }</div>
-<div class="line"><span class="lineno">  135</span>    head = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a>;</div>
+<div class="line"><span class="lineno">  135</span>    head = prev;</div>
 <div class="line"><span class="lineno">  136</span>}</div>
-<div class="ttc" id="aprev_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/prev.html">std::prev</a></div><div class="ttdeci">T prev(T... args)</div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -675,7 +678,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt; data_structures::linked_list::list::search </td>
+          <td class="memname">std::shared_ptr&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt; data_structures::linked_list::list::search </td>
           <td>(</td>
           <td class="paramtype">int</td>          <td class="paramname"><span class="paramname"><em>find_elem</em></span></td><td>)</td>
           <td></td>
@@ -689,28 +692,25 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00197">197</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  197</span>                                              {</div>
 <div class="line"><span class="lineno">  198</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
-<div class="line"><span class="lineno">  199</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;List is Empty!&quot;</span>;</div>
+<div class="line"><span class="lineno">  199</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;List is Empty!&quot;</span>;</div>
 <div class="line"><span class="lineno">  200</span>        <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  201</span>    }</div>
-<div class="line"><span class="lineno">  202</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;link&gt;</a> t = <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>;</div>
+<div class="line"><span class="lineno">  202</span>    std::shared_ptr&lt;link&gt; t = <a class="code hl_variable" href="#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>;</div>
 <div class="line"><span class="lineno">  203</span>    <span class="keywordflow">while</span> (t != <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a> &amp;&amp; t-&gt;succ()-&gt;val() != find_elem) {</div>
 <div class="line"><span class="lineno">  204</span>        t = t-&gt;succ();</div>
 <div class="line"><span class="lineno">  205</span>    }</div>
 <div class="line"><span class="lineno">  206</span>    <span class="keywordflow">if</span> (t == <a class="code hl_variable" href="#af39bcc08641ce0c813023f364a9a9015">last</a>) {</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> &lt;&lt; <span class="stringliteral">&quot;Element not found\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  207</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Element not found\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  208</span>        <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  209</span>    }</div>
-<div class="line"><span class="lineno">  210</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Element was found\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  210</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Element was found\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  211</span>    <span class="keywordflow">return</span> t-&gt;succ();</div>
 <div class="line"><span class="lineno">  212</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/def/classdata__structures_1_1linked__list_1_1list_ad3423f7518671351340932db3c24959a_cgraph.svg" width="366" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a9785d1478e59f5a90288b2928a7094d6" name="a9785d1478e59f5a90288b2928a7094d6"></a>
@@ -730,20 +730,16 @@ Here is the call graph for this function:</div>
 
 <p>Utility function to find the top element of the list. </p>
 <dl class="section return"><dt>Returns</dt><dd>the top element of the list </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00142">142</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  142</span>                        {</div>
 <div class="line"><span class="lineno">  143</span>    <span class="keywordflow">if</span> (!<a class="code hl_function" href="#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
 <div class="line"><span class="lineno">  144</span>        <span class="keywordflow">return</span> head-&gt;val;</div>
 <div class="line"><span class="lineno">  145</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  146</span>        <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/logic_error.html">std::logic_error</a>(<span class="stringliteral">&quot;List is empty&quot;</span>);</div>
+<div class="line"><span class="lineno">  146</span>        <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;List is empty&quot;</span>);</div>
 <div class="line"><span class="lineno">  147</span>    }</div>
 <div class="line"><span class="lineno">  148</span>}</div>
-<div class="ttc" id="alogic_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/logic_error.html">std::logic_error</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.svg" width="366" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2b951a3f1123b9b2f4891ec96aa76d69" name="a2b951a3f1123b9b2f4891ec96aa76d69"></a>
@@ -763,6 +759,8 @@ Here is the call graph for this function:</div>
 
 <p>Utility function to find the i th element of the list. </p>
 <dl class="section return"><dt>Returns</dt><dd>the i th element of the list </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00168">168</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  168</span>                                          {</div>
 <div class="line"><span class="lineno">  169</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* current = head;</div>
 <div class="line"><span class="lineno">  170</span> </div>
@@ -777,13 +775,62 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  179</span> </div>
 <div class="line"><span class="lineno">  180</span>    <span class="comment">/* if we get to this line,the caller was asking for a non-existent element</span></div>
 <div class="line"><span class="lineno">  181</span><span class="comment">    so we assert fail */</span></div>
-<div class="line"><span class="lineno">  182</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">exit</a>(1);</div>
+<div class="line"><span class="lineno">  182</span>    exit(1);</div>
 <div class="line"><span class="lineno">  183</span>}</div>
-<div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
 </div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
+<a id="aa3801cea564a3b3bb7b03abfffdcf1e1" name="aa3801cea564a3b3bb7b03abfffdcf1e1"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aa3801cea564a3b3bb7b03abfffdcf1e1">&#9670;&#160;</a></span>first</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::shared_ptr&lt;<a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a>&gt; data_structures::linked_list::list::first</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>link before the actual first element </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00083">83</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ad7e7823ae52c4ebf3b85a1bec096be5d" name="ad7e7823ae52c4ebf3b85a1bec096be5d"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ad7e7823ae52c4ebf3b85a1bec096be5d">&#9670;&#160;</a></span>head</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a>* data_structures::linked_list::list::head = nullptr</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00070">70</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
+
+</div>
+</div>
 <a id="af39bcc08641ce0c813023f364a9a9015" name="af39bcc08641ce0c813023f364a9a9015"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#af39bcc08641ce0c813023f364a9a9015">&#9670;&#160;</a></span>last</h2>
 
@@ -808,11 +855,13 @@ Here is the call graph for this function:</div>
 <p>Utility function to find the last element of the list.</p>
 <dl class="section return"><dt>Returns</dt><dd>the last element of the list </dd></dl>
 
+<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00084">84</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following files:<ul>
-<li>data_structures/<a class="el" href="../../da/dc3/linked__list_8cpp.html">linked_list.cpp</a></li>
-<li>data_structures/<a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp.html">reverse_a_linked_list.cpp</a></li>
+<li>data_structures/<a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a009b19ac8cca40f2e4daa2e5989fa4f3_cgraph.map b/d1/def/classdata__structures_1_1linked__list_1_1list_a009b19ac8cca40f2e4daa2e5989fa4f3_cgraph.map
deleted file mode 100644
index d5ce6e41c..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a009b19ac8cca40f2e4daa2e5989fa4f3_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="data_structures::linked_list::list::erase" name="data_structures::linked_list::list::erase">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,35,159,75"/>
-<area shape="rect" id="Node000002" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" title=" " alt="" coords="207,5,360,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,41,191,36,192,42,159,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/reset.html#" title=" " alt="" coords="211,70,356,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="159,63,196,68,195,73,159,68"/>
-</map>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a009b19ac8cca40f2e4daa2e5989fa4f3_cgraph.md5 b/d1/def/classdata__structures_1_1linked__list_1_1list_a009b19ac8cca40f2e4daa2e5989fa4f3_cgraph.md5
deleted file mode 100644
index 66b8433c5..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a009b19ac8cca40f2e4daa2e5989fa4f3_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fa24d6241c5257491047b42e6334d303
\ No newline at end of file
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a009b19ac8cca40f2e4daa2e5989fa4f3_cgraph.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a009b19ac8cca40f2e4daa2e5989fa4f3_cgraph.svg
deleted file mode 100644
index 1617e9ca1..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a009b19ac8cca40f2e4daa2e5989fa4f3_cgraph.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::list::erase Pages: 1 -->
-<svg width="274pt" height="76pt"
- viewBox="0.00 0.00 274.00 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>data_structures::linked_list::list::erase</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="115,-45.88 0,-45.88 0,-15.37 115,-15.37 115,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::erase</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-67.88 151,-67.88 151,-37.38 266,-37.38 266,-67.88"/>
-<text text-anchor="start" x="159" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="208.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-39.01C123.19,-40.18 131.42,-41.39 139.53,-42.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139,-46.05 149.4,-44.05 140.02,-39.12 139,-46.05"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/reset.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263,-19.25 154,-19.25 154,0 263,0 263,-19.25"/>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr::reset</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-22.63C124.16,-21.37 133.42,-20.07 142.5,-18.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.94,-22.26 152.35,-17.4 141.96,-15.33 142.94,-22.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a009b19ac8cca40f2e4daa2e5989fa4f3_cgraph_org.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a009b19ac8cca40f2e4daa2e5989fa4f3_cgraph_org.svg
deleted file mode 100644
index 40480b1fa..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a009b19ac8cca40f2e4daa2e5989fa4f3_cgraph_org.svg
+++ /dev/null
@@ -1,59 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::list::erase Pages: 1 -->
-<svg width="274pt" height="76pt"
- viewBox="0.00 0.00 274.00 75.88" 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 71.88)">
-<title>data_structures::linked_list::list::erase</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="115,-45.88 0,-45.88 0,-15.37 115,-15.37 115,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::erase</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-67.88 151,-67.88 151,-37.38 266,-37.38 266,-67.88"/>
-<text text-anchor="start" x="159" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="208.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-39.01C123.19,-40.18 131.42,-41.39 139.53,-42.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139,-46.05 149.4,-44.05 140.02,-39.12 139,-46.05"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/reset.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263,-19.25 154,-19.25 154,0 263,0 263,-19.25"/>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr::reset</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-22.63C124.16,-21.37 133.42,-20.07 142.5,-18.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.94,-22.26 152.35,-17.4 141.96,-15.33 142.94,-22.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a1313837c0e9ec67fd9fbd17987e2d615_cgraph.map b/d1/def/classdata__structures_1_1linked__list_1_1list_a1313837c0e9ec67fd9fbd17987e2d615_cgraph.map
deleted file mode 100644
index a531a1711..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a1313837c0e9ec67fd9fbd17987e2d615_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::linked_list::list::display" name="data_structures::linked_list::list::display">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,159,46"/>
-<area shape="rect" id="Node000002" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" title=" " alt="" coords="207,5,360,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,23,191,23,191,28,159,28"/>
-</map>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a1313837c0e9ec67fd9fbd17987e2d615_cgraph.md5 b/d1/def/classdata__structures_1_1linked__list_1_1list_a1313837c0e9ec67fd9fbd17987e2d615_cgraph.md5
deleted file mode 100644
index 69fee328e..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a1313837c0e9ec67fd9fbd17987e2d615_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-424c4d539c12eb30f3b057941d387774
\ No newline at end of file
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a1313837c0e9ec67fd9fbd17987e2d615_cgraph.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a1313837c0e9ec67fd9fbd17987e2d615_cgraph.svg
deleted file mode 100644
index 514594842..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a1313837c0e9ec67fd9fbd17987e2d615_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::list::display Pages: 1 -->
-<svg width="274pt" height="39pt"
- viewBox="0.00 0.00 274.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::linked_list::list::display</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::display</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-30.5 151,-30.5 151,0 266,0 266,-30.5"/>
-<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-15.25C123.19,-15.25 131.42,-15.25 139.53,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.39,-18.75 149.39,-15.25 139.39,-11.75 139.39,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a1313837c0e9ec67fd9fbd17987e2d615_cgraph_org.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a1313837c0e9ec67fd9fbd17987e2d615_cgraph_org.svg
deleted file mode 100644
index 852e9d7f8..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a1313837c0e9ec67fd9fbd17987e2d615_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::list::display Pages: 1 -->
-<svg width="274pt" height="39pt"
- viewBox="0.00 0.00 274.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::linked_list::list::display</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::display</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-30.5 151,-30.5 151,0 266,0 266,-30.5"/>
-<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-15.25C123.19,-15.25 131.42,-15.25 139.53,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.39,-18.75 149.39,-15.25 139.39,-11.75 139.39,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph.map b/d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph.map
deleted file mode 100644
index e2f6a333e..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="data_structures::linked_list::list::push_front" name="data_structures::linked_list::list::push_front">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,35,159,75"/>
-<area shape="rect" id="Node000002" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" title=" " alt="" coords="207,5,360,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,41,191,36,192,42,159,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="221,70,346,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="159,63,206,70,205,75,159,68"/>
-</map>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph.md5 b/d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph.md5
deleted file mode 100644
index 06d663288..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0032bc307b79d250ee483373106d5316
\ No newline at end of file
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph.svg
deleted file mode 100644
index 81c33c70a..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::list::push_front Pages: 1 -->
-<svg width="274pt" height="76pt"
- viewBox="0.00 0.00 274.00 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>data_structures::linked_list::list::push_front</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="115,-45.88 0,-45.88 0,-15.37 115,-15.37 115,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-67.88 151,-67.88 151,-37.38 266,-37.38 266,-67.88"/>
-<text text-anchor="start" x="159" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="208.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-39.01C123.19,-40.18 131.42,-41.39 139.53,-42.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139,-46.05 149.4,-44.05 140.02,-39.12 139,-46.05"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-19.25 161.5,-19.25 161.5,0 255.5,0 255.5,-19.25"/>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-22.63C126.6,-21.03 138.54,-19.34 149.91,-17.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.15,-21.24 159.57,-16.38 149.17,-14.31 150.15,-21.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph_org.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph_org.svg
deleted file mode 100644
index e6b9c5626..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a332b965afd9d6bea8d3246673acd52c7_cgraph_org.svg
+++ /dev/null
@@ -1,59 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::list::push_front Pages: 1 -->
-<svg width="274pt" height="76pt"
- viewBox="0.00 0.00 274.00 75.88" 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 71.88)">
-<title>data_structures::linked_list::list::push_front</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="115,-45.88 0,-45.88 0,-15.37 115,-15.37 115,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-67.88 151,-67.88 151,-37.38 266,-37.38 266,-67.88"/>
-<text text-anchor="start" x="159" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="208.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-39.01C123.19,-40.18 131.42,-41.39 139.53,-42.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139,-46.05 149.4,-44.05 140.02,-39.12 139,-46.05"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-19.25 161.5,-19.25 161.5,0 255.5,0 255.5,-19.25"/>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-22.63C126.6,-21.03 138.54,-19.34 149.91,-17.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.15,-21.24 159.57,-16.38 149.17,-14.31 150.15,-21.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.map b/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.map
deleted file mode 100644
index 5b2b3d934..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::linked_list::list::list" name="data_structures::linked_list::list::list">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,159,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="207,13,332,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,23,191,23,191,28,159,28"/>
-</map>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.md5 b/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.md5
deleted file mode 100644
index a9e619480..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-eb039a1cbb1453f6e0da4806c497b8f2
\ No newline at end of file
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.svg
deleted file mode 100644
index 3451fd083..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::list::list Pages: 1 -->
-<svg width="253pt" height="39pt"
- viewBox="0.00 0.00 253.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::linked_list::list::list</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::list</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245,-24.88 151,-24.88 151,-5.63 245,-5.63 245,-24.88"/>
-<text text-anchor="middle" x="198" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.23,-15.25C123.16,-15.25 131.32,-15.25 139.27,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.2,-18.75 149.2,-15.25 139.2,-11.75 139.2,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph_org.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph_org.svg
deleted file mode 100644
index 5452b5c48..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a50e209b55b83622254177050945e7826_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::list::list Pages: 1 -->
-<svg width="253pt" height="39pt"
- viewBox="0.00 0.00 253.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::linked_list::list::list</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::list</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245,-24.88 151,-24.88 151,-5.63 245,-5.63 245,-24.88"/>
-<text text-anchor="middle" x="198" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.23,-15.25C123.16,-15.25 131.32,-15.25 139.27,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.2,-18.75 149.2,-15.25 139.2,-11.75 139.2,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph.map b/d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph.map
deleted file mode 100644
index f4b196d00..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="data_structures::linked_list::list::push_back" name="data_structures::linked_list::list::push_back">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,35,159,75"/>
-<area shape="rect" id="Node000002" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" title=" " alt="" coords="207,5,360,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,41,191,36,192,42,159,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="221,70,346,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="159,63,206,70,205,75,159,68"/>
-</map>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph.md5 b/d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph.md5
deleted file mode 100644
index 29c5a1a70..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-82dcec9845ec741b5f1388a134b04b81
\ No newline at end of file
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph.svg
deleted file mode 100644
index cf1532d5e..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::list::push_back Pages: 1 -->
-<svg width="274pt" height="76pt"
- viewBox="0.00 0.00 274.00 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>data_structures::linked_list::list::push_back</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="115,-45.88 0,-45.88 0,-15.37 115,-15.37 115,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-67.88 151,-67.88 151,-37.38 266,-37.38 266,-67.88"/>
-<text text-anchor="start" x="159" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="208.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-39.01C123.19,-40.18 131.42,-41.39 139.53,-42.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139,-46.05 149.4,-44.05 140.02,-39.12 139,-46.05"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-19.25 161.5,-19.25 161.5,0 255.5,0 255.5,-19.25"/>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-22.63C126.6,-21.03 138.54,-19.34 149.91,-17.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.15,-21.24 159.57,-16.38 149.17,-14.31 150.15,-21.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph_org.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph_org.svg
deleted file mode 100644
index 9e2ede1ba..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a6e9859d1a0755fb51e41904d20c95496_cgraph_org.svg
+++ /dev/null
@@ -1,59 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::list::push_back Pages: 1 -->
-<svg width="274pt" height="76pt"
- viewBox="0.00 0.00 274.00 75.88" 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 71.88)">
-<title>data_structures::linked_list::list::push_back</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="115,-45.88 0,-45.88 0,-15.37 115,-15.37 115,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-67.88 151,-67.88 151,-37.38 266,-37.38 266,-67.88"/>
-<text text-anchor="start" x="159" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="208.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-39.01C123.19,-40.18 131.42,-41.39 139.53,-42.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139,-46.05 149.4,-44.05 140.02,-39.12 139,-46.05"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-19.25 161.5,-19.25 161.5,0 255.5,0 255.5,-19.25"/>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-22.63C126.6,-21.03 138.54,-19.34 149.91,-17.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.15,-21.24 159.57,-16.38 149.17,-14.31 150.15,-21.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.map b/d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.map
deleted file mode 100644
index 435b604e7..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::linked_list::list::top" name="data_structures::linked_list::list::top">
-<area shape="rect" id="Node000001" title="Utility function to find the top element of the list." alt="" coords="5,5,159,46"/>
-<area shape="rect" id="Node000002" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" title=" " alt="" coords="207,5,360,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,23,191,23,191,28,159,28"/>
-</map>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.md5 b/d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.md5
deleted file mode 100644
index 4fafb0812..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-001150031427d341e6f62059c5eb7640
\ No newline at end of file
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.svg
deleted file mode 100644
index 7360b22a9..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::list::top Pages: 1 -->
-<svg width="274pt" height="39pt"
- viewBox="0.00 0.00 274.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::linked_list::list::top</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to find the top element of the list.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::top</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-30.5 151,-30.5 151,0 266,0 266,-30.5"/>
-<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-15.25C123.19,-15.25 131.42,-15.25 139.53,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.39,-18.75 149.39,-15.25 139.39,-11.75 139.39,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph_org.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph_org.svg
deleted file mode 100644
index c598cf1b1..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_a9785d1478e59f5a90288b2928a7094d6_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::list::top Pages: 1 -->
-<svg width="274pt" height="39pt"
- viewBox="0.00 0.00 274.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::linked_list::list::top</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to find the top element of the list.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::top</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-30.5 151,-30.5 151,0 266,0 266,-30.5"/>
-<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-15.25C123.19,-15.25 131.42,-15.25 139.53,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.39,-18.75 149.39,-15.25 139.39,-11.75 139.39,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.map b/d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.map
deleted file mode 100644
index acbe5059f..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="data_structures::linked_list::list::insert" name="data_structures::linked_list::list::insert">
-<area shape="rect" id="Node000001" title="Utility function that adds a new element at the end of the list." alt="" coords="5,35,159,75"/>
-<area shape="rect" id="Node000002" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" title=" " alt="" coords="207,5,360,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,41,191,36,192,42,159,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/error/exception/what.html#" title=" " alt="" coords="214,70,352,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="159,63,199,69,198,74,159,68"/>
-</map>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.md5 b/d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.md5
deleted file mode 100644
index d596dd346..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7f4463b596974a51ddfeefc35461a1c4
\ No newline at end of file
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.svg
deleted file mode 100644
index 146db8a56..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::list::insert Pages: 1 -->
-<svg width="274pt" height="76pt"
- viewBox="0.00 0.00 274.00 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>data_structures::linked_list::list::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function that adds a new element at the end of the list.">
-<polygon fill="#999999" stroke="#666666" points="115,-45.88 0,-45.88 0,-15.37 115,-15.37 115,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-67.88 151,-67.88 151,-37.38 266,-37.38 266,-67.88"/>
-<text text-anchor="start" x="159" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="208.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-39.01C123.19,-40.18 131.42,-41.39 139.53,-42.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139,-46.05 149.4,-44.05 140.02,-39.12 139,-46.05"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.38,-19.25 156.62,-19.25 156.62,0 260.38,0 260.38,-19.25"/>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::bad_alloc::what</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-22.63C124.95,-21.26 135.07,-19.83 144.91,-18.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.37,-21.92 154.78,-17.06 144.39,-14.99 145.37,-21.92"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph_org.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph_org.svg
deleted file mode 100644
index 787951ffc..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_aa69707af46eb6d410eb3a54ee58e1ed1_cgraph_org.svg
+++ /dev/null
@@ -1,59 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::list::insert Pages: 1 -->
-<svg width="274pt" height="76pt"
- viewBox="0.00 0.00 274.00 75.88" 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 71.88)">
-<title>data_structures::linked_list::list::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function that adds a new element at the end of the list.">
-<polygon fill="#999999" stroke="#666666" points="115,-45.88 0,-45.88 0,-15.37 115,-15.37 115,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-67.88 151,-67.88 151,-37.38 266,-37.38 266,-67.88"/>
-<text text-anchor="start" x="159" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="208.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-39.01C123.19,-40.18 131.42,-41.39 139.53,-42.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139,-46.05 149.4,-44.05 140.02,-39.12 139,-46.05"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.38,-19.25 156.62,-19.25 156.62,0 260.38,0 260.38,-19.25"/>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::bad_alloc::what</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-22.63C124.95,-21.26 135.07,-19.83 144.91,-18.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.37,-21.92 154.78,-17.06 144.39,-14.99 145.37,-21.92"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_ad3423f7518671351340932db3c24959a_cgraph.map b/d1/def/classdata__structures_1_1linked__list_1_1list_ad3423f7518671351340932db3c24959a_cgraph.map
deleted file mode 100644
index f75b4b4d2..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_ad3423f7518671351340932db3c24959a_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::linked_list::list::search" name="data_structures::linked_list::list::search">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,159,46"/>
-<area shape="rect" id="Node000002" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" title=" " alt="" coords="207,5,360,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,23,191,23,191,28,159,28"/>
-</map>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_ad3423f7518671351340932db3c24959a_cgraph.md5 b/d1/def/classdata__structures_1_1linked__list_1_1list_ad3423f7518671351340932db3c24959a_cgraph.md5
deleted file mode 100644
index 0d21bdf0b..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_ad3423f7518671351340932db3c24959a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3785b767d36da983218294d15a0df6c7
\ No newline at end of file
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_ad3423f7518671351340932db3c24959a_cgraph.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_ad3423f7518671351340932db3c24959a_cgraph.svg
deleted file mode 100644
index 75a73eb8b..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_ad3423f7518671351340932db3c24959a_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::list::search Pages: 1 -->
-<svg width="274pt" height="39pt"
- viewBox="0.00 0.00 274.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::linked_list::list::search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-30.5 151,-30.5 151,0 266,0 266,-30.5"/>
-<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-15.25C123.19,-15.25 131.42,-15.25 139.53,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.39,-18.75 149.39,-15.25 139.39,-11.75 139.39,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_ad3423f7518671351340932db3c24959a_cgraph_org.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_ad3423f7518671351340932db3c24959a_cgraph_org.svg
deleted file mode 100644
index 7880c2a67..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_ad3423f7518671351340932db3c24959a_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::list::search Pages: 1 -->
-<svg width="274pt" height="39pt"
- viewBox="0.00 0.00 274.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::linked_list::list::search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-30.5 151,-30.5 151,0 266,0 266,-30.5"/>
-<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-15.25C123.19,-15.25 131.42,-15.25 139.53,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.39,-18.75 149.39,-15.25 139.39,-11.75 139.39,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_adb04f732911fcfd30f7177b367c6af41_cgraph.map b/d1/def/classdata__structures_1_1linked__list_1_1list_adb04f732911fcfd30f7177b367c6af41_cgraph.map
deleted file mode 100644
index 9707db3f0..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_adb04f732911fcfd30f7177b367c6af41_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::linked_list::list::operator=" name="data_structures::linked_list::list::operator=">
-<area shape="rect" id="Node000001" title="assignment operator creating a deep copy of every node of the input" alt="" coords="5,5,159,46"/>
-<area shape="rect" id="Node000002" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#ac614ed8f1953f5486fab1cd6d7aa0500" title="calls delete operator on every node in the represented list" alt="" coords="207,5,382,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,23,191,23,191,28,159,28"/>
-</map>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_adb04f732911fcfd30f7177b367c6af41_cgraph.md5 b/d1/def/classdata__structures_1_1linked__list_1_1list_adb04f732911fcfd30f7177b367c6af41_cgraph.md5
deleted file mode 100644
index 1922fdf8b..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_adb04f732911fcfd30f7177b367c6af41_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b6077b2cc9c93b7400bc011a61c94f7b
\ No newline at end of file
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_adb04f732911fcfd30f7177b367c6af41_cgraph.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_adb04f732911fcfd30f7177b367c6af41_cgraph.svg
deleted file mode 100644
index a652b3e36..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_adb04f732911fcfd30f7177b367c6af41_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::list::operator= Pages: 1 -->
-<svg width="291pt" height="39pt"
- viewBox="0.00 0.00 290.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::linked_list::list::operator=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="assignment operator creating a deep copy of every node of the input">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::operator=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac614ed8f1953f5486fab1cd6d7aa0500" target="_top" xlink:title="calls delete operator on every node in the represented list">
-<polygon fill="white" stroke="#666666" points="282.5,-30.5 151,-30.5 151,0 282.5,0 282.5,-30.5"/>
-<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="216.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::delete_all_nodes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.27,-15.25C123.04,-15.25 131.13,-15.25 139.18,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139,-18.75 149,-15.25 139,-11.75 139,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/def/classdata__structures_1_1linked__list_1_1list_adb04f732911fcfd30f7177b367c6af41_cgraph_org.svg b/d1/def/classdata__structures_1_1linked__list_1_1list_adb04f732911fcfd30f7177b367c6af41_cgraph_org.svg
deleted file mode 100644
index a74eb325d..000000000
--- a/d1/def/classdata__structures_1_1linked__list_1_1list_adb04f732911fcfd30f7177b367c6af41_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::list::operator= Pages: 1 -->
-<svg width="291pt" height="39pt"
- viewBox="0.00 0.00 290.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::linked_list::list::operator=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="assignment operator creating a deep copy of every node of the input">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::operator=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac614ed8f1953f5486fab1cd6d7aa0500" target="_top" xlink:title="calls delete operator on every node in the represented list">
-<polygon fill="white" stroke="#666666" points="282.5,-30.5 151,-30.5 151,0 282.5,0 282.5,-30.5"/>
-<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="216.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::delete_all_nodes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.27,-15.25C123.04,-15.25 131.13,-15.25 139.18,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139,-18.75 149,-15.25 139,-11.75 139,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/df2/structnode-members.html b/d1/df2/structnode-members.html
index 707f43fc1..e142dd91f 100644
--- a/d1/df2/structnode-members.html
+++ b/d1/df2/structnode-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d1/df3/hash__search_8cpp.html b/d1/df3/hash__search_8cpp.html
index f2fe4fd8e..bee1ef07c 100644
--- a/d1/df3/hash__search_8cpp.html
+++ b/d1/df3/hash__search_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: search/hash_search.cpp File Reference</title>
+<title>TheAlgorithms/C++: search/hash_search.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for hash_search.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d30/hash__search_8cpp__incl.svg" width="175" height="111"><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">
+</div>
+<p><a href="../../d1/df3/hash__search_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d10/structlist.html">list</a></td></tr>
@@ -131,13 +150,11 @@ Classes</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="define-members" name="define-members"></a>
 Macros</h2></td></tr>
-<tr class="memitem:a392fb874e547e582e9c66a08a1f23326" id="r_a392fb874e547e582e9c66a08a1f23326"><td class="memItemLeft" align="right" valign="top"><a id="a392fb874e547e582e9c66a08a1f23326" name="a392fb874e547e582e9c66a08a1f23326"></a>
-#define&#160;</td><td class="memItemRight" valign="bottom"><b>MAX</b>&#160;&#160;&#160;6</td></tr>
-<tr class="memdesc:a392fb874e547e582e9c66a08a1f23326"><td class="mdescLeft">&#160;</td><td class="mdescRight">Determines how much data. <br /></td></tr>
+<tr class="memitem:a392fb874e547e582e9c66a08a1f23326" id="r_a392fb874e547e582e9c66a08a1f23326"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a392fb874e547e582e9c66a08a1f23326">MAX</a>&#160;&#160;&#160;6</td></tr>
+<tr class="memdesc:a392fb874e547e582e9c66a08a1f23326"><td class="mdescLeft">&#160;</td><td class="mdescRight">Determines how much data.  <br /></td></tr>
 <tr class="separator:a392fb874e547e582e9c66a08a1f23326"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a77c722016053a1d484aa177ce205b367" id="r_a77c722016053a1d484aa177ce205b367"><td class="memItemLeft" align="right" valign="top"><a id="a77c722016053a1d484aa177ce205b367" name="a77c722016053a1d484aa177ce205b367"></a>
-#define&#160;</td><td class="memItemRight" valign="bottom"><b>HASHMAX</b>&#160;&#160;&#160;5</td></tr>
-<tr class="memdesc:a77c722016053a1d484aa177ce205b367"><td class="mdescLeft">&#160;</td><td class="mdescRight">Determines the length of the hash table. <br /></td></tr>
+<tr class="memitem:a77c722016053a1d484aa177ce205b367" id="r_a77c722016053a1d484aa177ce205b367"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a77c722016053a1d484aa177ce205b367">HASHMAX</a>&#160;&#160;&#160;5</td></tr>
+<tr class="memdesc:a77c722016053a1d484aa177ce205b367"><td class="mdescLeft">&#160;</td><td class="mdescRight">Determines the length of the hash table.  <br /></td></tr>
 <tr class="separator:a77c722016053a1d484aa177ce205b367"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="typedef-members" name="typedef-members"></a>
@@ -165,9 +182,8 @@ Variables</h2></td></tr>
 <tr class="memitem:a6e1a77282bc65ad359d753d25df23243" id="r_a6e1a77282bc65ad359d753d25df23243"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6e1a77282bc65ad359d753d25df23243">data</a> [MAX] = {1, 10, 15, 5, 8, 7}</td></tr>
 <tr class="memdesc:a6e1a77282bc65ad359d753d25df23243"><td class="mdescLeft">&#160;</td><td class="mdescRight">test data  <br /></td></tr>
 <tr class="separator:a6e1a77282bc65ad359d753d25df23243"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af413b1740073db54796642b0ab814d6d" id="r_af413b1740073db54796642b0ab814d6d"><td class="memItemLeft" align="right" valign="top"><a id="af413b1740073db54796642b0ab814d6d" name="af413b1740073db54796642b0ab814d6d"></a>
-<a class="el" href="../../d5/da1/structnode.html">node</a>&#160;</td><td class="memItemRight" valign="bottom"><b>hashtab</b> [<a class="el" href="#a77c722016053a1d484aa177ce205b367">HASHMAX</a>]</td></tr>
-<tr class="memdesc:af413b1740073db54796642b0ab814d6d"><td class="mdescLeft">&#160;</td><td class="mdescRight">array of nodes <br /></td></tr>
+<tr class="memitem:af413b1740073db54796642b0ab814d6d" id="r_af413b1740073db54796642b0ab814d6d"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af413b1740073db54796642b0ab814d6d">hashtab</a> [<a class="el" href="#a77c722016053a1d484aa177ce205b367">HASHMAX</a>]</td></tr>
+<tr class="memdesc:af413b1740073db54796642b0ab814d6d"><td class="mdescLeft">&#160;</td><td class="mdescRight">array of nodes  <br /></td></tr>
 <tr class="separator:af413b1740073db54796642b0ab814d6d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -176,7 +192,46 @@ Variables</h2></td></tr>
 <p>In this algorithm, we use the method of division and reservation remainder to construct the hash function, and use the method of chain address to solve the conflict, that is, we link a chain list after the data, and store all the records whose keywords are synonyms in the same linear chain list.</p>
 <dl class="section warning"><dt>Warning</dt><dd>This program is only for educational purposes. It has serious flaws in implementation with regards to memory management resulting in large amounts of memory leaks. </dd></dl>
 <dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000012">Todo</a></b></dt><dd>fix the program for memory leaks and better structure in C++ and not C fashion </dd></dl>
-</div><h2 class="groupheader">Typedef Documentation</h2>
+
+<p class="definition">Definition in file <a class="el" href="../../d1/df3/hash__search_8cpp_source.html">hash_search.cpp</a>.</p>
+</div><h2 class="groupheader">Macro Definition Documentation</h2>
+<a id="a77c722016053a1d484aa177ce205b367" name="a77c722016053a1d484aa177ce205b367"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a77c722016053a1d484aa177ce205b367">&#9670;&#160;</a></span>HASHMAX</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">#define HASHMAX&#160;&#160;&#160;5</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Determines the length of the hash table. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/df3/hash__search_8cpp_source.html#l00022">22</a> of file <a class="el" href="../../d1/df3/hash__search_8cpp_source.html">hash_search.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a392fb874e547e582e9c66a08a1f23326" name="a392fb874e547e582e9c66a08a1f23326"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a392fb874e547e582e9c66a08a1f23326">&#9670;&#160;</a></span>MAX</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">#define MAX&#160;&#160;&#160;6</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Determines how much data. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/df3/hash__search_8cpp_source.html#l00021">21</a> of file <a class="el" href="../../d1/df3/hash__search_8cpp_source.html">hash_search.cpp</a>.</p>
+
+</div>
+</div>
+<h2 class="groupheader">Typedef Documentation</h2>
 <a id="a8ca8dcb494104d273679e219e53d0555" name="a8ca8dcb494104d273679e219e53d0555"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a8ca8dcb494104d273679e219e53d0555">&#9670;&#160;</a></span>node</h2>
 
@@ -215,10 +270,12 @@ Variables</h2></td></tr>
 </dl>
 <dl class="section warning"><dt>Warning</dt><dd>dynamic memory allocated to <code>n</code> never gets freed. </dd></dl>
 <dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000013">Todo</a></b></dt><dd>fix memory leak </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/df3/hash__search_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../d1/df3/hash__search_8cpp_source.html">hash_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   55</span>                          {  <span class="comment">// Construct hash table</span></div>
-<div class="line"><span class="lineno">   56</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">link</a> p, n;</div>
+<div class="line"><span class="lineno">   56</span>    <a class="code hl_typedef" href="#ad6fcd983304f85afa199d97a9b0ca9f6">link</a> p, n;</div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordtype">int</span> index;</div>
-<div class="line"><span class="lineno">   58</span>    n = (<a class="code hl_typedef" href="#ad6fcd983304f85afa199d97a9b0ca9f6">link</a>)<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/c/malloc.html">malloc</a>(<span class="keyword">sizeof</span>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>));</div>
+<div class="line"><span class="lineno">   58</span>    n = (<a class="code hl_typedef" href="#ad6fcd983304f85afa199d97a9b0ca9f6">link</a>)malloc(<span class="keyword">sizeof</span>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>));</div>
 <div class="line"><span class="lineno">   59</span>    n-&gt;key = key;</div>
 <div class="line"><span class="lineno">   60</span>    n-&gt;next = NULL;</div>
 <div class="line"><span class="lineno">   61</span>    index = <a class="code hl_function" href="#a566eaf0ffafd50bc61e644561fd27001">h</a>(key);</div>
@@ -230,18 +287,11 @@ Variables</h2></td></tr>
 <div class="line"><span class="lineno">   67</span>        <a class="code hl_variable" href="#af413b1740073db54796642b0ab814d6d">hashtab</a>[index].next = n;</div>
 <div class="line"><span class="lineno">   68</span>    }</div>
 <div class="line"><span class="lineno">   69</span>}</div>
-<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> hash_search.cpp:45</div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00045">hash_search.cpp:45</a></div></div>
 <div class="ttc" id="ahash__search_8cpp_html_ad6fcd983304f85afa199d97a9b0ca9f6"><div class="ttname"><a href="#ad6fcd983304f85afa199d97a9b0ca9f6">link</a></div><div class="ttdeci">struct list * link</div><div class="ttdoc">pointer to nodes</div></div>
-<div class="ttc" id="ahash__search_8cpp_html_af413b1740073db54796642b0ab814d6d"><div class="ttname"><a href="#af413b1740073db54796642b0ab814d6d">hashtab</a></div><div class="ttdeci">node hashtab[HASHMAX]</div><div class="ttdoc">array of nodes</div><div class="ttdef"><b>Definition</b> hash_search.cpp:35</div></div>
-<div class="ttc" id="alist_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a></div></div>
-<div class="ttc" id="amalloc_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/c/malloc.html">std::malloc</a></div><div class="ttdeci">T malloc(T... args)</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.svg" width="179" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ahash__search_8cpp_html_af413b1740073db54796642b0ab814d6d"><div class="ttname"><a href="#af413b1740073db54796642b0ab814d6d">hashtab</a></div><div class="ttdeci">node hashtab[HASHMAX]</div><div class="ttdoc">array of nodes</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00035">hash_search.cpp:35</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a566eaf0ffafd50bc61e644561fd27001" name="a566eaf0ffafd50bc61e644561fd27001"></a>
@@ -267,8 +317,10 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>hash value for <code>key</code> </dd></dl>
 <dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html#a2">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp</a>.</dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/df3/hash__search_8cpp_source.html#l00045">45</a> of file <a class="el" href="../../d1/df3/hash__search_8cpp_source.html">hash_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   45</span>{ <span class="keywordflow">return</span> key % <a class="code hl_define" href="#a77c722016053a1d484aa177ce205b367">HASHMAX</a>; }</div>
-<div class="ttc" id="ahash__search_8cpp_html_a77c722016053a1d484aa177ce205b367"><div class="ttname"><a href="#a77c722016053a1d484aa177ce205b367">HASHMAX</a></div><div class="ttdeci">#define HASHMAX</div><div class="ttdoc">Determines the length of the hash table.</div><div class="ttdef"><b>Definition</b> hash_search.cpp:22</div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a77c722016053a1d484aa177ce205b367"><div class="ttname"><a href="#a77c722016053a1d484aa177ce205b367">HASHMAX</a></div><div class="ttdeci">#define HASHMAX</div><div class="ttdoc">Determines the length of the hash table.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00022">hash_search.cpp:22</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -293,19 +345,21 @@ Here is the call graph for this function:</div>
 <p>Input the key to be searched, and get the hash header position through the H (int key) function, then one-dimensional linear search. If found </p><dl class="section return"><dt>Returns</dt><dd>element depth and number of searches If not found </dd>
 <dd>
 -1 </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/df3/hash__search_8cpp_source.html#l00076">76</a> of file <a class="el" href="../../d1/df3/hash__search_8cpp_source.html">hash_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   76</span>                                       {  <span class="comment">// Hash lookup function</span></div>
-<div class="line"><span class="lineno">   77</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">link</a> pointer;</div>
+<div class="line"><span class="lineno">   77</span>    <a class="code hl_typedef" href="#ad6fcd983304f85afa199d97a9b0ca9f6">link</a> pointer;</div>
 <div class="line"><span class="lineno">   78</span>    <span class="keywordtype">int</span> index;</div>
 <div class="line"><span class="lineno">   79</span> </div>
 <div class="line"><span class="lineno">   80</span>    *counter = 0;</div>
 <div class="line"><span class="lineno">   81</span>    index = <a class="code hl_function" href="#a566eaf0ffafd50bc61e644561fd27001">h</a>(key);</div>
 <div class="line"><span class="lineno">   82</span>    pointer = <a class="code hl_variable" href="#af413b1740073db54796642b0ab814d6d">hashtab</a>[index].next;</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/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;data[&quot;</span> &lt;&lt; index &lt;&lt; <span class="stringliteral">&quot;]:&quot;</span>;</div>
+<div class="line"><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;data[&quot;</span> &lt;&lt; index &lt;&lt; <span class="stringliteral">&quot;]:&quot;</span>;</div>
 <div class="line"><span class="lineno">   85</span> </div>
 <div class="line"><span class="lineno">   86</span>    <span class="keywordflow">while</span> (pointer != NULL) {</div>
 <div class="line"><span class="lineno">   87</span>        counter[0]++;</div>
-<div class="line"><span class="lineno">   88</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;data[&quot;</span> &lt;&lt; pointer-&gt;key &lt;&lt; <span class="stringliteral">&quot;]:&quot;</span>;</div>
+<div class="line"><span class="lineno">   88</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;data[&quot;</span> &lt;&lt; pointer-&gt;key &lt;&lt; <span class="stringliteral">&quot;]:&quot;</span>;</div>
 <div class="line"><span class="lineno">   89</span>        <span class="keywordflow">if</span> (pointer-&gt;key == key)</div>
 <div class="line"><span class="lineno">   90</span>            <span class="keywordflow">return</span> 1;</div>
 <div class="line"><span class="lineno">   91</span>        <span class="keywordflow">else</span></div>
@@ -314,13 +368,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   94</span> </div>
 <div class="line"><span class="lineno">   95</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   96</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><!-- 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="../../d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.svg" width="192" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -338,8 +386,10 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/df3/hash__search_8cpp_source.html#l00099">99</a> of file <a class="el" href="../../d1/df3/hash__search_8cpp_source.html">hash_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   99</span>           {</div>
-<div class="line"><span class="lineno">  100</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">link</a> p;</div>
+<div class="line"><span class="lineno">  100</span>    <a class="code hl_typedef" href="#ad6fcd983304f85afa199d97a9b0ca9f6">link</a> p;</div>
 <div class="line"><span class="lineno">  101</span>    <span class="keywordtype">int</span> key, index, i, counter;  <span class="comment">// Key is the value to be found</span></div>
 <div class="line"><span class="lineno">  102</span>    index = 0;</div>
 <div class="line"><span class="lineno">  103</span> </div>
@@ -350,17 +400,17 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  108</span>    }</div>
 <div class="line"><span class="lineno">  109</span> </div>
 <div class="line"><span class="lineno">  110</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_define" href="#a77c722016053a1d484aa177ce205b367">HASHMAX</a>; i++) {  <span class="comment">// Output hash table</span></div>
-<div class="line"><span class="lineno">  111</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;hashtab [&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  111</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;hashtab [&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  112</span> </div>
 <div class="line"><span class="lineno">  113</span>        p = <a class="code hl_variable" href="#af413b1740073db54796642b0ab814d6d">hashtab</a>[i].next;</div>
 <div class="line"><span class="lineno">  114</span> </div>
 <div class="line"><span class="lineno">  115</span>        <span class="keywordflow">while</span> (p != NULL) {</div>
-<div class="line"><span class="lineno">  116</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;please int key:&quot;</span>;</div>
+<div class="line"><span class="lineno">  116</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;please int key:&quot;</span>;</div>
 <div class="line"><span class="lineno">  117</span>            <span class="keywordflow">if</span> (p-&gt;key &gt; 0)</div>
-<div class="line"><span class="lineno">  118</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;[&quot;</span> &lt;&lt; p-&gt;key &lt;&lt; <span class="stringliteral">&quot;]&quot;</span>;</div>
+<div class="line"><span class="lineno">  118</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;[&quot;</span> &lt;&lt; p-&gt;key &lt;&lt; <span class="stringliteral">&quot;]&quot;</span>;</div>
 <div class="line"><span class="lineno">  119</span>            p = p-&gt;next;</div>
 <div class="line"><span class="lineno">  120</span>        }</div>
-<div class="line"><span class="lineno">  121</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  121</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  122</span>    }</div>
 <div class="line"><span class="lineno">  123</span> </div>
 <div class="line"><span class="lineno">  124</span>    <span class="keywordflow">while</span> (key != -1) {</div>
@@ -368,9 +418,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  126</span>        <span class="comment">// test key = 10</span></div>
 <div class="line"><span class="lineno">  127</span>        key = 10;</div>
 <div class="line"><span class="lineno">  128</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="#a36ea13c16028f18ef2d5ff47f3fda7a2">hash_search</a>(key, &amp;counter))</div>
-<div class="line"><span class="lineno">  129</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;search time = &quot;</span> &lt;&lt; counter &lt;&lt; <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">  129</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;search time = &quot;</span> &lt;&lt; counter &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  130</span>        <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">  131</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;no found!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  131</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;no found!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  132</span>        key = -1;  <span class="comment">// Exit test</span></div>
 <div class="line"><span class="lineno">  133</span>        <span class="comment">/* The test sample is returned as:</span></div>
 <div class="line"><span class="lineno">  134</span><span class="comment">         * data[0]:data[5]:data[15]:data[10]:search time = 3 The search is</span></div>
@@ -379,17 +429,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  137</span> </div>
 <div class="line"><span class="lineno">  138</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  139</span>}</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="ahash__search_8cpp_html_a36ea13c16028f18ef2d5ff47f3fda7a2"><div class="ttname"><a href="#a36ea13c16028f18ef2d5ff47f3fda7a2">hash_search</a></div><div class="ttdeci">int hash_search(int key, int *counter)</div><div class="ttdef"><b>Definition</b> hash_search.cpp:76</div></div>
-<div class="ttc" id="ahash__search_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdoc">Determines how much data.</div><div class="ttdef"><b>Definition</b> hash_search.cpp:21</div></div>
-<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
-<div class="ttc" id="ahash__search_8cpp_html_ad0831425f1389166a9518f422d0c6ec5"><div class="ttname"><a href="#ad0831425f1389166a9518f422d0c6ec5">create_list</a></div><div class="ttdeci">void create_list(int key)</div><div class="ttdef"><b>Definition</b> hash_search.cpp:55</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="290" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ahash__search_8cpp_html_a36ea13c16028f18ef2d5ff47f3fda7a2"><div class="ttname"><a href="#a36ea13c16028f18ef2d5ff47f3fda7a2">hash_search</a></div><div class="ttdeci">int hash_search(int key, int *counter)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00076">hash_search.cpp:76</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdoc">Determines how much data.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00021">hash_search.cpp:21</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_ad0831425f1389166a9518f422d0c6ec5"><div class="ttname"><a href="#ad0831425f1389166a9518f422d0c6ec5">create_list</a></div><div class="ttdeci">void create_list(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00055">hash_search.cpp:55</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Variable Documentation</h2>
@@ -406,8 +450,28 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>test data </p>
-<div class="fragment"><div class="line"><span class="lineno">   24</span>{1, 10, 15, 5, 8, 7};  <span class="comment">//!&lt; test data</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/df3/hash__search_8cpp_source.html#l00024">24</a> of file <a class="el" href="../../d1/df3/hash__search_8cpp_source.html">hash_search.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   24</span>{1, 10, 15, 5, 8, 7};  </div>
 </div><!-- fragment -->
+</div>
+</div>
+<a id="af413b1740073db54796642b0ab814d6d" name="af413b1740073db54796642b0ab814d6d"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#af413b1740073db54796642b0ab814d6d">&#9670;&#160;</a></span>hashtab</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a> hashtab[<a class="el" href="#a77c722016053a1d484aa177ce205b367">HASHMAX</a>]</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>array of nodes </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/df3/hash__search_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../d1/df3/hash__search_8cpp_source.html">hash_search.cpp</a>.</p>
+
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.map b/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.map
deleted file mode 100644
index 9f703544e..000000000
--- a/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="hash_search" name="hash_search">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,101,31"/>
-<area shape="rect" id="Node000002" href="$d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" title=" " alt="" coords="149,5,187,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="101,16,133,16,133,21,101,21"/>
-</map>
diff --git a/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.md5 b/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.md5
deleted file mode 100644
index bfdb47332..000000000
--- a/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cc083f0c40114bf7af529f860051e4eb
\ No newline at end of file
diff --git a/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.svg b/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.svg
deleted file mode 100644
index 36afafcc7..000000000
--- a/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hash_search Pages: 1 -->
-<svg width="144pt" height="27pt"
- viewBox="0.00 0.00 144.30 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>hash_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="71.5,-19.25 0,-19.25 0,0 71.5,0 71.5,-19.25"/>
-<text text-anchor="middle" x="35.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="136.3,-19.25 107.5,-19.25 107.5,0 136.3,0 136.3,-19.25"/>
-<text text-anchor="middle" x="121.9" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.95,-9.62C80.01,-9.62 88.42,-9.62 95.94,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.7,-13.13 105.7,-9.63 95.7,-6.13 95.7,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph_org.svg b/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph_org.svg
deleted file mode 100644
index 4afdd27ed..000000000
--- a/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hash_search Pages: 1 -->
-<svg width="144pt" height="27pt"
- viewBox="0.00 0.00 144.30 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>hash_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="71.5,-19.25 0,-19.25 0,0 71.5,0 71.5,-19.25"/>
-<text text-anchor="middle" x="35.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="136.3,-19.25 107.5,-19.25 107.5,0 136.3,0 136.3,-19.25"/>
-<text text-anchor="middle" x="121.9" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.95,-9.62C80.01,-9.62 88.42,-9.62 95.94,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.7,-13.13 105.7,-9.63 95.7,-6.13 95.7,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.map b/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.map
deleted file mode 100644
index a8f468ebd..000000000
--- a/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="create_list" name="create_list">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,87,31"/>
-<area shape="rect" id="Node000002" href="$d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" title=" " alt="" coords="135,5,173,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="87,16,119,16,119,21,87,21"/>
-</map>
diff --git a/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.md5 b/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.md5
deleted file mode 100644
index 1de9c3475..000000000
--- a/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-94ce1abff25351e87a5082ac36298289
\ No newline at end of file
diff --git a/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.svg b/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.svg
deleted file mode 100644
index 63e2810ce..000000000
--- a/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: create_list Pages: 1 -->
-<svg width="134pt" height="27pt"
- viewBox="0.00 0.00 133.80 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>create_list</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="61,-19.25 0,-19.25 0,0 61,0 61,-19.25"/>
-<text text-anchor="middle" x="30.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_list</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125.8,-19.25 97,-19.25 97,0 125.8,0 125.8,-19.25"/>
-<text text-anchor="middle" x="111.4" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.33,-9.62C69.25,-9.62 77.73,-9.62 85.37,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.32,-13.13 95.32,-9.63 85.32,-6.13 85.32,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph_org.svg b/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph_org.svg
deleted file mode 100644
index e0e7ba427..000000000
--- a/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: create_list Pages: 1 -->
-<svg width="134pt" height="27pt"
- viewBox="0.00 0.00 133.80 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>create_list</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="61,-19.25 0,-19.25 0,0 61,0 61,-19.25"/>
-<text text-anchor="middle" x="30.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_list</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125.8,-19.25 97,-19.25 97,0 125.8,0 125.8,-19.25"/>
-<text text-anchor="middle" x="111.4" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.33,-9.62C69.25,-9.62 77.73,-9.62 85.37,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.32,-13.13 95.32,-9.63 85.32,-6.13 85.32,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 5583d25bd..000000000
--- a/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,55,80"/>
-<area shape="rect" id="Node000002" href="$d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5" title=" " alt="" coords="110,5,191,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,55,102,35,104,40,56,60"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="115,55,186,80"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="55,65,99,65,99,70,55,70"/>
-<area shape="rect" id="Node000005" href="$d1/df3/hash__search_8cpp.html#a36ea13c16028f18ef2d5ff47f3fda7a2" title=" " alt="" coords="103,104,198,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="56,75,104,95,102,100,54,80"/>
-<area shape="rect" id="Node000003" href="$d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" title=" " alt="" coords="246,55,284,80"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="183,29,233,51,231,56,181,34"/>
-<area shape="poly" id="edge5_Node000005_Node000003" title=" " alt="" coords="181,101,231,79,233,84,183,106"/>
-</map>
diff --git a/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 00f79a2cf..000000000
--- a/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3d50ff14bb4892772bd3400c43ad67f7
\ No newline at end of file
diff --git a/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index b6e6d55e7..000000000
--- a/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,128 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="217pt" height="101pt"
- viewBox="0.00 0.00 217.30 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="139.25,-93.25 78.25,-93.25 78.25,-74 139.25,-74 139.25,-93.25"/>
-<text text-anchor="middle" x="108.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_list</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.36,-54.11C47.72,-58.46 61.12,-64.08 73.44,-69.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.92,-72.4 82.5,-73.04 74.63,-65.94 71.92,-72.4"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.5,-56.25 82,-56.25 82,-37 135.5,-37 135.5,-56.25"/>
-<text text-anchor="middle" x="108.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.36,-46.62C46.78,-46.62 58.71,-46.62 70.06,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.03,-50.13 80.03,-46.63 70.03,-43.13 70.03,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a36ea13c16028f18ef2d5ff47f3fda7a2" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="144.5,-19.25 73,-19.25 73,0 144.5,0 144.5,-19.25"/>
-<text text-anchor="middle" x="108.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.36,-39.14C47.72,-34.79 61.12,-29.17 73.44,-24.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.63,-27.31 82.5,-20.21 71.92,-20.85 74.63,-27.31"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209.3,-56.25 180.5,-56.25 180.5,-37 209.3,-37 209.3,-56.25"/>
-<text text-anchor="middle" x="194.9" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.74,-73.51C144.25,-68.46 158.17,-62.33 169.82,-57.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.01,-60.51 178.76,-53.28 168.2,-54.1 171.01,-60.51"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge5_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge5_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.74,-19.74C144.25,-24.79 158.17,-30.92 169.82,-36.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.2,-39.15 178.76,-39.97 171.01,-32.74 168.2,-39.15"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 660954ca1..000000000
--- a/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="217pt" height="101pt"
- viewBox="0.00 0.00 217.30 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="139.25,-93.25 78.25,-93.25 78.25,-74 139.25,-74 139.25,-93.25"/>
-<text text-anchor="middle" x="108.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_list</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.36,-54.11C47.72,-58.46 61.12,-64.08 73.44,-69.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.92,-72.4 82.5,-73.04 74.63,-65.94 71.92,-72.4"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.5,-56.25 82,-56.25 82,-37 135.5,-37 135.5,-56.25"/>
-<text text-anchor="middle" x="108.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.36,-46.62C46.78,-46.62 58.71,-46.62 70.06,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.03,-50.13 80.03,-46.63 70.03,-43.13 70.03,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a36ea13c16028f18ef2d5ff47f3fda7a2" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="144.5,-19.25 73,-19.25 73,0 144.5,0 144.5,-19.25"/>
-<text text-anchor="middle" x="108.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.36,-39.14C47.72,-34.79 61.12,-29.17 73.44,-24.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.63,-27.31 82.5,-20.21 71.92,-20.85 74.63,-27.31"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209.3,-56.25 180.5,-56.25 180.5,-37 209.3,-37 209.3,-56.25"/>
-<text text-anchor="middle" x="194.9" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.74,-73.51C144.25,-68.46 158.17,-62.33 169.82,-57.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.01,-60.51 178.76,-53.28 168.2,-54.1 171.01,-60.51"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge5_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge5_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.74,-19.74C144.25,-24.79 158.17,-30.92 169.82,-36.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.2,-39.15 178.76,-39.97 171.01,-32.74 168.2,-39.15"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d1/df3/hash__search_8cpp_source.html b/d1/df3/hash__search_8cpp_source.html
new file mode 100644
index 000000000..93d5a9a05
--- /dev/null
+++ b/d1/df3/hash__search_8cpp_source.html
@@ -0,0 +1,259 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: search/hash_search.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d1/df3/hash__search_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">hash_search.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d1/df3/hash__search_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;cstdlib&gt;</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"><a class="line" href="../../d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326">   21</a></span><span class="preprocessor">#define MAX 6      </span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"><a class="line" href="../../d1/df3/hash__search_8cpp.html#a77c722016053a1d484aa177ce205b367">   22</a></span><span class="preprocessor">#define HASHMAX 5  </span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"><a class="line" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">   24</a></span><span class="keywordtype">int</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[<a class="code hl_define" href="../../d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a>] = {1, 10, 15, 5, 8, 7};  </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="foldopen" id="foldopen00029" data-start="{" data-end="};">
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../d8/d10/structlist.html">   29</a></span><span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code hl_struct" href="../../d8/d10/structlist.html">list</a> {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"><a class="line" href="../../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c">   30</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c">key</a>;            </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="../../d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f">   31</a></span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../d8/d10/structlist.html">list</a>* <a class="code hl_variable" href="../../d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f">next</a>;  </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555">   32</a></span>} <a class="code hl_typedef" href="../../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555">node</a>,                 </div>
+</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6">   33</a></span>    *<a class="code hl_typedef" href="../../d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6">link</a>;              </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d">   35</a></span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d">hashtab</a>[<a class="code hl_define" href="../../d1/df3/hash__search_8cpp.html#a77c722016053a1d484aa177ce205b367">HASHMAX</a>];  </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="comment">// int counter = 1;</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">   45</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c">key</a>) { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c">key</a> % <a class="code hl_define" href="../../d1/df3/hash__search_8cpp.html#a77c722016053a1d484aa177ce205b367">HASHMAX</a>; }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="foldopen" id="foldopen00055" data-start="{" data-end="}">
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5">   55</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5">create_list</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c">key</a>) {  <span class="comment">// Construct hash table</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <a class="code hl_typedef" href="../../d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6">link</a> p, n;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordtype">int</span> index;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    n = (<a class="code hl_typedef" href="../../d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6">link</a>)malloc(<span class="keyword">sizeof</span>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>));</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    n-&gt;key = <a class="code hl_variable" href="../../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c">key</a>;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    n-&gt;next = NULL;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    index = <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>(<a class="code hl_variable" href="../../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c">key</a>);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    p = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d">hashtab</a>[index].next;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordflow">if</span> (p != NULL) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        n-&gt;next = p;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d">hashtab</a>[index].next = n;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d">hashtab</a>[index].next = n;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>}</div>
+</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="foldopen" id="foldopen00076" data-start="{" data-end="}">
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"><a class="line" href="../../d1/df3/hash__search_8cpp.html#a36ea13c16028f18ef2d5ff47f3fda7a2">   76</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a36ea13c16028f18ef2d5ff47f3fda7a2">hash_search</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c">key</a>, <span class="keywordtype">int</span>* counter) {  <span class="comment">// Hash lookup function</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <a class="code hl_typedef" href="../../d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6">link</a> pointer;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordtype">int</span> index;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    *counter = 0;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    index = <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>(<a class="code hl_variable" href="../../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c">key</a>);</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    pointer = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d">hashtab</a>[index].next;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;data[&quot;</span> &lt;&lt; index &lt;&lt; <span class="stringliteral">&quot;]:&quot;</span>;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordflow">while</span> (pointer != NULL) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        counter[0]++;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;data[&quot;</span> &lt;&lt; pointer-&gt;key &lt;&lt; <span class="stringliteral">&quot;]:&quot;</span>;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        <span class="keywordflow">if</span> (pointer-&gt;key == <a class="code hl_variable" href="../../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c">key</a>)</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>            <span class="keywordflow">return</span> 1;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>            pointer = pointer-&gt;next;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    }</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>}</div>
+</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="foldopen" id="foldopen00099" data-start="{" data-end="}">
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"><a class="line" href="../../d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   99</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <a class="code hl_typedef" href="../../d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6">link</a> p;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c">key</a>, index, i, counter;  <span class="comment">// Key is the value to be found</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    index = 0;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="comment">// You can write the input mode here</span></div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="keywordflow">while</span> (index &lt; <a class="code hl_define" href="../../d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a>) {  <span class="comment">// Construct hash table</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5">create_list</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[index]);</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        index++;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    }</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_define" href="../../d1/df3/hash__search_8cpp.html#a77c722016053a1d484aa177ce205b367">HASHMAX</a>; i++) {  <span class="comment">// Output hash table</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;hashtab [&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span>;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        p = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d">hashtab</a>[i].next;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        <span class="keywordflow">while</span> (p != NULL) {</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;please int key:&quot;</span>;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>            <span class="keywordflow">if</span> (p-&gt;key &gt; 0)</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;[&quot;</span> &lt;&lt; p-&gt;key &lt;&lt; <span class="stringliteral">&quot;]&quot;</span>;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>            p = p-&gt;next;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        }</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    }</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    <span class="keywordflow">while</span> (<a class="code hl_variable" href="../../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c">key</a> != -1) {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        <span class="comment">// You can write the input mode here</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        <span class="comment">// test key = 10</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <a class="code hl_variable" href="../../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c">key</a> = 10;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a36ea13c16028f18ef2d5ff47f3fda7a2">hash_search</a>(<a class="code hl_variable" href="../../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c">key</a>, &amp;counter))</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;search time = &quot;</span> &lt;&lt; counter &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;no found!\n&quot;</span>;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        <a class="code hl_variable" href="../../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c">key</a> = -1;  <span class="comment">// Exit test</span></div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        <span class="comment">/* The test sample is returned as:</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span><span class="comment">         * data[0]:data[5]:data[15]:data[10]:search time = 3 The search is</span></div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span><span class="comment">         * successful. There are 10 in this set of data */</span></div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    }</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span> </div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>}</div>
+</div>
+<div class="ttc" id="ahash__search_8cpp_html_a36ea13c16028f18ef2d5ff47f3fda7a2"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a36ea13c16028f18ef2d5ff47f3fda7a2">hash_search</a></div><div class="ttdeci">int hash_search(int key, int *counter)</div><div class="ttdef"><b>Definition</b> <a href="#l00076">hash_search.cpp:76</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdoc">Determines how much data.</div><div class="ttdef"><b>Definition</b> <a href="#l00021">hash_search.cpp:21</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00045">hash_search.cpp:45</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a77c722016053a1d484aa177ce205b367"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a77c722016053a1d484aa177ce205b367">HASHMAX</a></div><div class="ttdeci">#define HASHMAX</div><div class="ttdoc">Determines the length of the hash table.</div><div class="ttdef"><b>Definition</b> <a href="#l00022">hash_search.cpp:22</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a8ca8dcb494104d273679e219e53d0555"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555">node</a></div><div class="ttdeci">struct list node</div></div>
+<div class="ttc" id="ahash__search_8cpp_html_ad0831425f1389166a9518f422d0c6ec5"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5">create_list</a></div><div class="ttdeci">void create_list(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00055">hash_search.cpp:55</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_ad6fcd983304f85afa199d97a9b0ca9f6"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6">link</a></div><div class="ttdeci">struct list * link</div><div class="ttdoc">pointer to nodes</div></div>
+<div class="ttc" id="ahash__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00099">hash_search.cpp:99</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_af413b1740073db54796642b0ab814d6d"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d">hashtab</a></div><div class="ttdeci">node hashtab[HASHMAX]</div><div class="ttdoc">array of nodes</div><div class="ttdef"><b>Definition</b> <a href="#l00035">hash_search.cpp:35</a></div></div>
+<div class="ttc" id="astructlist_html"><div class="ttname"><a href="../../d8/d10/structlist.html">list</a></div><div class="ttdef"><b>Definition</b> <a href="#l00029">hash_search.cpp:29</a></div></div>
+<div class="ttc" id="astructlist_html_a1900fe79e875e2838625b2eb60837f8f"><div class="ttname"><a href="../../d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f">list::next</a></div><div class="ttdeci">struct list * next</div><div class="ttdoc">pointer to next link in the chain</div><div class="ttdef"><b>Definition</b> <a href="#l00031">hash_search.cpp:31</a></div></div>
+<div class="ttc" id="astructlist_html_aaab2e33bc1ca6f44e72239bfb58f100c"><div class="ttname"><a href="../../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c">list::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value for node</div><div class="ttdef"><b>Definition</b> <a href="#l00030">hash_search.cpp:30</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../d1/df3/hash__search_8cpp.html">hash_search.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.map b/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.map
index 117830e8e..7f429ca37 100644
--- a/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.map
+++ b/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.map
@@ -1,9 +1,9 @@
 <map id="backtracking::generate_parentheses" name="backtracking::generate_parentheses">
 <area shape="rect" id="Node000001" title="generate_parentheses class" alt="" coords="11,273,165,313"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="5,184,171,210"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,184,171,210"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="91,225,91,272,85,272,85,225"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string.html" title=" " alt="" coords="48,95,128,121"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="48,95,128,121"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="91,137,91,184,85,184,85,137"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string.html" title=" " alt="" coords="25,5,151,46"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="25,5,151,46"/>
 <area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="91,61,91,95,85,95,85,61"/>
 </map>
diff --git a/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.md5 b/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.md5
index 1ae2b8112..c9e2e55dc 100644
--- a/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.md5
+++ b/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.md5
@@ -1 +1 @@
-0f14ae3d3756260ff6d03fd21aa3f452
\ No newline at end of file
+539309940b12abfde1ed39f5cbccb73c
\ No newline at end of file
diff --git a/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.svg b/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.svg
index 42350f6d5..0c1337828 100644
--- a/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.svg
+++ b/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph.svg
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="124,-97 0,-97 0,-77.75 124,-77.75 124,-97"/>
 <text text-anchor="middle" x="62" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::string &gt;</text>
 </a>
@@ -51,7 +51,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="91.75,-163.5 32.25,-163.5 32.25,-144.25 91.75,-144.25 91.75,-163.5"/>
 <text text-anchor="middle" x="62" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">std::string</text>
 </a>
@@ -70,7 +70,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="109,-231 15,-231 15,-200.5 109,-200.5 109,-231"/>
 <text text-anchor="start" x="23" y="-217.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::basic_string&lt;</text>
 <text text-anchor="middle" x="62" y="-206.25" font-family="Helvetica,sans-Serif" font-size="10.00"> Char &gt;</text>
diff --git a/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph_org.svg b/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph_org.svg
index 71bc83bf7..c84a3b2c1 100644
--- a/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph_org.svg
+++ b/d1/df5/classbacktracking_1_1generate__parentheses__coll__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="124,-97 0,-97 0,-77.75 124,-77.75 124,-97"/>
 <text text-anchor="middle" x="62" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::string &gt;</text>
 </a>
@@ -40,7 +40,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="91.75,-163.5 32.25,-163.5 32.25,-144.25 91.75,-144.25 91.75,-163.5"/>
 <text text-anchor="middle" x="62" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">std::string</text>
 </a>
@@ -59,7 +59,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="109,-231 15,-231 15,-200.5 109,-200.5 109,-231"/>
 <text text-anchor="start" x="23" y="-217.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::basic_string&lt;</text>
 <text text-anchor="middle" x="62" y="-206.25" font-family="Helvetica,sans-Serif" font-size="10.00"> Char &gt;</text>
diff --git a/d1/df6/class_easter_year_month_day.html b/d1/df6/class_easter_year_month_day.html
index 28dd80a78..314a95c8d 100644
--- a/d1/df6/class_easter_year_month_day.html
+++ b/d1/df6/class_easter_year_month_day.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: EasterYearMonthDay Class Reference</title>
+<title>TheAlgorithms/C++: EasterYearMonthDay Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,22 +139,21 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a28d3cd09391390250932b7fb58fe61dc" id="r_a28d3cd09391390250932b7fb58fe61dc"><td class="memItemLeft" align="right" valign="top"><a id="a28d3cd09391390250932b7fb58fe61dc" name="a28d3cd09391390250932b7fb58fe61dc"></a>
-uint64_t&#160;</td><td class="memItemRight" valign="bottom"><b>year</b></td></tr>
-<tr class="memdesc:a28d3cd09391390250932b7fb58fe61dc"><td class="mdescLeft">&#160;</td><td class="mdescRight">year Easter is on <br /></td></tr>
+<tr class="memitem:a28d3cd09391390250932b7fb58fe61dc" id="r_a28d3cd09391390250932b7fb58fe61dc"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a28d3cd09391390250932b7fb58fe61dc">year</a></td></tr>
+<tr class="memdesc:a28d3cd09391390250932b7fb58fe61dc"><td class="mdescLeft">&#160;</td><td class="mdescRight">year Easter is on  <br /></td></tr>
 <tr class="separator:a28d3cd09391390250932b7fb58fe61dc"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a01a068eae0b6fa8f86f5f60c2840bbde" id="r_a01a068eae0b6fa8f86f5f60c2840bbde"><td class="memItemLeft" align="right" valign="top"><a id="a01a068eae0b6fa8f86f5f60c2840bbde" name="a01a068eae0b6fa8f86f5f60c2840bbde"></a>
-uint64_t&#160;</td><td class="memItemRight" valign="bottom"><b>month</b></td></tr>
-<tr class="memdesc:a01a068eae0b6fa8f86f5f60c2840bbde"><td class="mdescLeft">&#160;</td><td class="mdescRight">month Easter is on <br /></td></tr>
+<tr class="memitem:a01a068eae0b6fa8f86f5f60c2840bbde" id="r_a01a068eae0b6fa8f86f5f60c2840bbde"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a01a068eae0b6fa8f86f5f60c2840bbde">month</a></td></tr>
+<tr class="memdesc:a01a068eae0b6fa8f86f5f60c2840bbde"><td class="mdescLeft">&#160;</td><td class="mdescRight">month Easter is on  <br /></td></tr>
 <tr class="separator:a01a068eae0b6fa8f86f5f60c2840bbde"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ade0b934e5b1af24e19ff959673b2ec51" id="r_ade0b934e5b1af24e19ff959673b2ec51"><td class="memItemLeft" align="right" valign="top"><a id="ade0b934e5b1af24e19ff959673b2ec51" name="ade0b934e5b1af24e19ff959673b2ec51"></a>
-uint64_t&#160;</td><td class="memItemRight" valign="bottom"><b>day</b></td></tr>
-<tr class="memdesc:ade0b934e5b1af24e19ff959673b2ec51"><td class="mdescLeft">&#160;</td><td class="mdescRight">day Easter is on <br /></td></tr>
+<tr class="memitem:ade0b934e5b1af24e19ff959673b2ec51" id="r_ade0b934e5b1af24e19ff959673b2ec51"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ade0b934e5b1af24e19ff959673b2ec51">day</a></td></tr>
+<tr class="memdesc:ade0b934e5b1af24e19ff959673b2ec51"><td class="mdescLeft">&#160;</td><td class="mdescRight">day Easter is on  <br /></td></tr>
 <tr class="separator:ade0b934e5b1af24e19ff959673b2ec51"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>for assert </p>
 <p>for IO operations </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d4e/easter_8cpp_source.html#l00027">27</a> of file <a class="el" href="../../d6/d4e/easter_8cpp_source.html">easter.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="aa8db6676ddde31b0027a08d582615194" name="aa8db6676ddde31b0027a08d582615194"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aa8db6676ddde31b0027a08d582615194">&#9670;&#160;</a></span>EasterYearMonthDay()</h2>
@@ -170,19 +186,76 @@ uint64_t&#160;</td><td class="memItemRight" valign="bottom"><b>day</b></td></tr>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d4e/easter_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../d6/d4e/easter_8cpp_source.html">easter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   33</span>                                                                             {</div>
 <div class="line"><span class="lineno">   34</span>        <a class="code hl_variable" href="#a28d3cd09391390250932b7fb58fe61dc">year</a> = newYear;  <span class="comment">// Assigns year to class</span></div>
 <div class="line"><span class="lineno">   35</span>        <a class="code hl_variable" href="#a01a068eae0b6fa8f86f5f60c2840bbde">month</a> = newMonth;</div>
 <div class="line"><span class="lineno">   36</span>        <a class="code hl_variable" href="#ade0b934e5b1af24e19ff959673b2ec51">day</a> = newDay;</div>
 <div class="line"><span class="lineno">   37</span>    }</div>
-<div class="ttc" id="aclass_easter_year_month_day_html_a01a068eae0b6fa8f86f5f60c2840bbde"><div class="ttname"><a href="#a01a068eae0b6fa8f86f5f60c2840bbde">EasterYearMonthDay::month</a></div><div class="ttdeci">uint64_t month</div><div class="ttdoc">month Easter is on</div><div class="ttdef"><b>Definition</b> easter.cpp:30</div></div>
-<div class="ttc" id="aclass_easter_year_month_day_html_a28d3cd09391390250932b7fb58fe61dc"><div class="ttname"><a href="#a28d3cd09391390250932b7fb58fe61dc">EasterYearMonthDay::year</a></div><div class="ttdeci">uint64_t year</div><div class="ttdoc">year Easter is on</div><div class="ttdef"><b>Definition</b> easter.cpp:29</div></div>
-<div class="ttc" id="aclass_easter_year_month_day_html_ade0b934e5b1af24e19ff959673b2ec51"><div class="ttname"><a href="#ade0b934e5b1af24e19ff959673b2ec51">EasterYearMonthDay::day</a></div><div class="ttdeci">uint64_t day</div><div class="ttdoc">day Easter is on</div><div class="ttdef"><b>Definition</b> easter.cpp:31</div></div>
+<div class="ttc" id="aclass_easter_year_month_day_html_a01a068eae0b6fa8f86f5f60c2840bbde"><div class="ttname"><a href="#a01a068eae0b6fa8f86f5f60c2840bbde">EasterYearMonthDay::month</a></div><div class="ttdeci">uint64_t month</div><div class="ttdoc">month Easter is on</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d4e/easter_8cpp_source.html#l00030">easter.cpp:30</a></div></div>
+<div class="ttc" id="aclass_easter_year_month_day_html_a28d3cd09391390250932b7fb58fe61dc"><div class="ttname"><a href="#a28d3cd09391390250932b7fb58fe61dc">EasterYearMonthDay::year</a></div><div class="ttdeci">uint64_t year</div><div class="ttdoc">year Easter is on</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d4e/easter_8cpp_source.html#l00029">easter.cpp:29</a></div></div>
+<div class="ttc" id="aclass_easter_year_month_day_html_ade0b934e5b1af24e19ff959673b2ec51"><div class="ttname"><a href="#ade0b934e5b1af24e19ff959673b2ec51">EasterYearMonthDay::day</a></div><div class="ttdeci">uint64_t day</div><div class="ttdoc">day Easter is on</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d4e/easter_8cpp_source.html#l00031">easter.cpp:31</a></div></div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="ade0b934e5b1af24e19ff959673b2ec51" name="ade0b934e5b1af24e19ff959673b2ec51"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ade0b934e5b1af24e19ff959673b2ec51">&#9670;&#160;</a></span>day</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">uint64_t EasterYearMonthDay::day</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>day Easter is on </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d4e/easter_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../d6/d4e/easter_8cpp_source.html">easter.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a01a068eae0b6fa8f86f5f60c2840bbde" name="a01a068eae0b6fa8f86f5f60c2840bbde"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a01a068eae0b6fa8f86f5f60c2840bbde">&#9670;&#160;</a></span>month</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">uint64_t EasterYearMonthDay::month</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>month Easter is on </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d4e/easter_8cpp_source.html#l00030">30</a> of file <a class="el" href="../../d6/d4e/easter_8cpp_source.html">easter.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a28d3cd09391390250932b7fb58fe61dc" name="a28d3cd09391390250932b7fb58fe61dc"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a28d3cd09391390250932b7fb58fe61dc">&#9670;&#160;</a></span>year</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">uint64_t EasterYearMonthDay::year</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>year Easter is on </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d4e/easter_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../d6/d4e/easter_8cpp_source.html">easter.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>others/<b>easter.cpp</b></li>
+<li>others/<a class="el" href="../../d6/d4e/easter_8cpp_source.html">easter.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d2/d05/class_min_heap.html b/d2/d05/class_min_heap.html
index 65135c7da..742f741ac 100644
--- a/d2/d05/class_min_heap.html
+++ b/d2/d05/class_min_heap.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: MinHeap Class Reference</title>
+<title>TheAlgorithms/C++: MinHeap Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -137,21 +154,20 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a34a93a87967308eb516328c0aca3c48e" id="r_a34a93a87967308eb516328c0aca3c48e"><td class="memItemLeft" align="right" valign="top"><a id="a34a93a87967308eb516328c0aca3c48e" name="a34a93a87967308eb516328c0aca3c48e"></a>
-int *&#160;</td><td class="memItemRight" valign="bottom"><b>harr</b></td></tr>
-<tr class="memdesc:a34a93a87967308eb516328c0aca3c48e"><td class="mdescLeft">&#160;</td><td class="mdescRight">pointer to array of elements in heap <br /></td></tr>
+<tr class="memitem:a34a93a87967308eb516328c0aca3c48e" id="r_a34a93a87967308eb516328c0aca3c48e"><td class="memItemLeft" align="right" valign="top">int *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a34a93a87967308eb516328c0aca3c48e">harr</a></td></tr>
+<tr class="memdesc:a34a93a87967308eb516328c0aca3c48e"><td class="mdescLeft">&#160;</td><td class="mdescRight">pointer to array of elements in heap  <br /></td></tr>
 <tr class="separator:a34a93a87967308eb516328c0aca3c48e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a88b4aa3e66392a3eabbf2517a9a79a02" id="r_a88b4aa3e66392a3eabbf2517a9a79a02"><td class="memItemLeft" align="right" valign="top"><a id="a88b4aa3e66392a3eabbf2517a9a79a02" name="a88b4aa3e66392a3eabbf2517a9a79a02"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>capacity</b></td></tr>
-<tr class="memdesc:a88b4aa3e66392a3eabbf2517a9a79a02"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum possible size of min heap <br /></td></tr>
+<tr class="memitem:a88b4aa3e66392a3eabbf2517a9a79a02" id="r_a88b4aa3e66392a3eabbf2517a9a79a02"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a88b4aa3e66392a3eabbf2517a9a79a02">capacity</a></td></tr>
+<tr class="memdesc:a88b4aa3e66392a3eabbf2517a9a79a02"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum possible size of min heap  <br /></td></tr>
 <tr class="separator:a88b4aa3e66392a3eabbf2517a9a79a02"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae4d358bf063bb196a1945b3fb99b4913" id="r_ae4d358bf063bb196a1945b3fb99b4913"><td class="memItemLeft" align="right" valign="top"><a id="ae4d358bf063bb196a1945b3fb99b4913" name="ae4d358bf063bb196a1945b3fb99b4913"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>heap_size</b></td></tr>
-<tr class="memdesc:ae4d358bf063bb196a1945b3fb99b4913"><td class="mdescLeft">&#160;</td><td class="mdescRight">Current number of elements in min heap. <br /></td></tr>
+<tr class="memitem:ae4d358bf063bb196a1945b3fb99b4913" id="r_ae4d358bf063bb196a1945b3fb99b4913"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae4d358bf063bb196a1945b3fb99b4913">heap_size</a></td></tr>
+<tr class="memdesc:ae4d358bf063bb196a1945b3fb99b4913"><td class="mdescLeft">&#160;</td><td class="mdescRight">Current number of elements in min heap.  <br /></td></tr>
 <tr class="separator:ae4d358bf063bb196a1945b3fb99b4913"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A class for Min Heap </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html#l00010">10</a> of file <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html">binaryheap.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a078cb888e642bb1f95dd0e03f0a35820" name="a078cb888e642bb1f95dd0e03f0a35820"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a078cb888e642bb1f95dd0e03f0a35820">&#9670;&#160;</a></span>MinHeap()</h2>
@@ -181,14 +197,16 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>heap_size</b></td></tr
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html#l00019">19</a> of file <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html">binaryheap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   19</span>                              {</div>
 <div class="line"><span class="lineno">   20</span>        <a class="code hl_variable" href="#ae4d358bf063bb196a1945b3fb99b4913">heap_size</a> = 0;</div>
 <div class="line"><span class="lineno">   21</span>        <a class="code hl_variable" href="#a88b4aa3e66392a3eabbf2517a9a79a02">capacity</a> = cap;</div>
 <div class="line"><span class="lineno">   22</span>        <a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a> = <span class="keyword">new</span> <span class="keywordtype">int</span>[cap];</div>
 <div class="line"><span class="lineno">   23</span>    }</div>
-<div class="ttc" id="aclass_min_heap_html_a34a93a87967308eb516328c0aca3c48e"><div class="ttname"><a href="#a34a93a87967308eb516328c0aca3c48e">MinHeap::harr</a></div><div class="ttdeci">int * harr</div><div class="ttdoc">pointer to array of elements in heap</div><div class="ttdef"><b>Definition</b> binaryheap.cpp:11</div></div>
-<div class="ttc" id="aclass_min_heap_html_a88b4aa3e66392a3eabbf2517a9a79a02"><div class="ttname"><a href="#a88b4aa3e66392a3eabbf2517a9a79a02">MinHeap::capacity</a></div><div class="ttdeci">int capacity</div><div class="ttdoc">maximum possible size of min heap</div><div class="ttdef"><b>Definition</b> binaryheap.cpp:12</div></div>
-<div class="ttc" id="aclass_min_heap_html_ae4d358bf063bb196a1945b3fb99b4913"><div class="ttname"><a href="#ae4d358bf063bb196a1945b3fb99b4913">MinHeap::heap_size</a></div><div class="ttdeci">int heap_size</div><div class="ttdoc">Current number of elements in min heap.</div><div class="ttdef"><b>Definition</b> binaryheap.cpp:13</div></div>
+<div class="ttc" id="aclass_min_heap_html_a34a93a87967308eb516328c0aca3c48e"><div class="ttname"><a href="#a34a93a87967308eb516328c0aca3c48e">MinHeap::harr</a></div><div class="ttdeci">int * harr</div><div class="ttdoc">pointer to array of elements in heap</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/binaryheap_8cpp_source.html#l00011">binaryheap.cpp:11</a></div></div>
+<div class="ttc" id="aclass_min_heap_html_a88b4aa3e66392a3eabbf2517a9a79a02"><div class="ttname"><a href="#a88b4aa3e66392a3eabbf2517a9a79a02">MinHeap::capacity</a></div><div class="ttdeci">int capacity</div><div class="ttdoc">maximum possible size of min heap</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/binaryheap_8cpp_source.html#l00012">binaryheap.cpp:12</a></div></div>
+<div class="ttc" id="aclass_min_heap_html_ae4d358bf063bb196a1945b3fb99b4913"><div class="ttname"><a href="#ae4d358bf063bb196a1945b3fb99b4913">MinHeap::heap_size</a></div><div class="ttdeci">int heap_size</div><div class="ttdoc">Current number of elements in min heap.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/binaryheap_8cpp_source.html#l00013">binaryheap.cpp:13</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -214,6 +232,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>heap_size</b></td></tr
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html#l00051">51</a> of file <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html">binaryheap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   51</span>{ <span class="keyword">delete</span>[] <a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>; }</div>
 </div><!-- fragment -->
 </div>
@@ -239,20 +259,16 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>heap_size</b></td></tr
 </div><div class="memdoc">
 <p>Decreases key value of key at index i to new_val</p>
 <p>Decreases value of key at index 'i' to new_val. It is assumed that new_val is smaller than harr[i]. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html#l00076">76</a> of file <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html">binaryheap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   76</span>                                            {</div>
 <div class="line"><span class="lineno">   77</span>    <a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[i] = new_val;</div>
 <div class="line"><span class="lineno">   78</span>    <span class="keywordflow">while</span> (i != 0 &amp;&amp; <a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[parent(i)] &gt; <a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[i]) {</div>
-<div class="line"><span class="lineno">   79</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(<a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[i], <a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[parent(i)]);</div>
+<div class="line"><span class="lineno">   79</span>        std::swap(<a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[i], <a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[parent(i)]);</div>
 <div class="line"><span class="lineno">   80</span>        i = parent(i);</div>
 <div class="line"><span class="lineno">   81</span>    }</div>
 <div class="line"><span class="lineno">   82</span>}</div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- 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="../../d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.svg" width="295" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a37ac126eabb0c3ce04047172abccca29" name="a37ac126eabb0c3ce04047172abccca29"></a>
@@ -271,18 +287,15 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 <p>Deletes a key stored at index i</p>
 <p>This function deletes key at index i. It first reduced value to minus infinite, then calls <a class="el" href="#a4014f1edaed0bd7db0c0d2ca53228980">extractMin()</a> </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html#l00105">105</a> of file <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html">binaryheap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  105</span>                             {</div>
 <div class="line"><span class="lineno">  106</span>    <a class="code hl_function" href="#aa7f726cc6327955d22871592227432f5">decreaseKey</a>(i, INT_MIN);</div>
 <div class="line"><span class="lineno">  107</span>    <a class="code hl_function" href="#a4014f1edaed0bd7db0c0d2ca53228980">extractMin</a>();</div>
 <div class="line"><span class="lineno">  108</span>}</div>
-<div class="ttc" id="aclass_min_heap_html_a4014f1edaed0bd7db0c0d2ca53228980"><div class="ttname"><a href="#a4014f1edaed0bd7db0c0d2ca53228980">MinHeap::extractMin</a></div><div class="ttdeci">int extractMin()</div><div class="ttdef"><b>Definition</b> binaryheap.cpp:85</div></div>
-<div class="ttc" id="aclass_min_heap_html_aa7f726cc6327955d22871592227432f5"><div class="ttname"><a href="#aa7f726cc6327955d22871592227432f5">MinHeap::decreaseKey</a></div><div class="ttdeci">void decreaseKey(int i, int new_val)</div><div class="ttdef"><b>Definition</b> binaryheap.cpp:76</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.svg" width="100%" height="414"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclass_min_heap_html_a4014f1edaed0bd7db0c0d2ca53228980"><div class="ttname"><a href="#a4014f1edaed0bd7db0c0d2ca53228980">MinHeap::extractMin</a></div><div class="ttdeci">int extractMin()</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/binaryheap_8cpp_source.html#l00085">binaryheap.cpp:85</a></div></div>
+<div class="ttc" id="aclass_min_heap_html_aa7f726cc6327955d22871592227432f5"><div class="ttname"><a href="#aa7f726cc6327955d22871592227432f5">MinHeap::decreaseKey</a></div><div class="ttdeci">void decreaseKey(int i, int new_val)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/binaryheap_8cpp_source.html#l00076">binaryheap.cpp:76</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4014f1edaed0bd7db0c0d2ca53228980" name="a4014f1edaed0bd7db0c0d2ca53228980"></a>
@@ -300,6 +313,8 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>to extract the root which is the minimum element </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html#l00085">85</a> of file <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html">binaryheap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   85</span>                        {</div>
 <div class="line"><span class="lineno">   86</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="#ae4d358bf063bb196a1945b3fb99b4913">heap_size</a> &lt;= 0)</div>
 <div class="line"><span class="lineno">   87</span>        <span class="keywordflow">return</span> INT_MAX;</div>
@@ -316,13 +331,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   98</span> </div>
 <div class="line"><span class="lineno">   99</span>    <span class="keywordflow">return</span> root;</div>
 <div class="line"><span class="lineno">  100</span>}</div>
-<div class="ttc" id="aclass_min_heap_html_aaef438c1056492cb62c4a4d9035b5cad"><div class="ttname"><a href="#aaef438c1056492cb62c4a4d9035b5cad">MinHeap::MinHeapify</a></div><div class="ttdeci">void MinHeapify(int)</div><div class="ttdef"><b>Definition</b> binaryheap.cpp:113</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.svg" width="503" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclass_min_heap_html_aaef438c1056492cb62c4a4d9035b5cad"><div class="ttname"><a href="#aaef438c1056492cb62c4a4d9035b5cad">MinHeap::MinHeapify</a></div><div class="ttdeci">void MinHeapify(int)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/binaryheap_8cpp_source.html#l00113">binaryheap.cpp:113</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a336ac71f0d857269fe9a98058a3cd130" name="a336ac71f0d857269fe9a98058a3cd130"></a>
@@ -348,6 +358,8 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Returns the minimum key (key at root) from min heap </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html#l00043">43</a> of file <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html">binaryheap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   43</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[0]; }</div>
 </div><!-- fragment -->
 </div>
@@ -367,9 +379,11 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Inserts a new key 'k' </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html">binaryheap.cpp</a>.</p>
 <div class="fragment"><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_variable" href="#ae4d358bf063bb196a1945b3fb99b4913">heap_size</a> == <a class="code hl_variable" href="#a88b4aa3e66392a3eabbf2517a9a79a02">capacity</a>) {</div>
-<div class="line"><span class="lineno">   57</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nOverflow: Could not insertKey\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   57</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nOverflow: Could not insertKey\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   58</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">   59</span>    }</div>
 <div class="line"><span class="lineno">   60</span> </div>
@@ -380,18 +394,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   65</span> </div>
 <div class="line"><span class="lineno">   66</span>    <span class="comment">// Fix the min heap property if it is violated</span></div>
 <div class="line"><span class="lineno">   67</span>    <span class="keywordflow">while</span> (i != 0 &amp;&amp; <a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[parent(i)] &gt; <a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[i]) {</div>
-<div class="line"><span class="lineno">   68</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(<a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[i], <a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[parent(i)]);</div>
+<div class="line"><span class="lineno">   68</span>        std::swap(<a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[i], <a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[parent(i)]);</div>
 <div class="line"><span class="lineno">   69</span>        i = parent(i);</div>
 <div class="line"><span class="lineno">   70</span>    }</div>
 <div class="line"><span class="lineno">   71</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="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.svg" width="274" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8c6c141e3de664819686aa637e1afca" name="aa8c6c141e3de664819686aa637e1afca"></a>
@@ -417,6 +425,8 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>to get index of left child of node at index i </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html">binaryheap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   31</span>{ <span class="keywordflow">return</span> (2 * i + 1); }</div>
 </div><!-- fragment -->
 </div>
@@ -437,6 +447,8 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 <p>to heapify a subtree with the root at given index</p>
 <p>A recursive method to heapify a subtree with the root at given index This method assumes that the subtrees are already heapified </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html#l00113">113</a> of file <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html">binaryheap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  113</span>                              {</div>
 <div class="line"><span class="lineno">  114</span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> = <a class="code hl_function" href="#aa8c6c141e3de664819686aa637e1afca">left</a>(i);</div>
 <div class="line"><span class="lineno">  115</span>    <span class="keywordtype">int</span> r = <a class="code hl_function" href="#ac760b85cf90265b8d674b942a43fb70e">right</a>(i);</div>
@@ -446,19 +458,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  119</span>    <span class="keywordflow">if</span> (r &lt; <a class="code hl_variable" href="#ae4d358bf063bb196a1945b3fb99b4913">heap_size</a> &amp;&amp; <a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[r] &lt; <a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[smallest])</div>
 <div class="line"><span class="lineno">  120</span>        smallest = r;</div>
 <div class="line"><span class="lineno">  121</span>    <span class="keywordflow">if</span> (smallest != i) {</div>
-<div class="line"><span class="lineno">  122</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(<a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[i], <a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[smallest]);</div>
+<div class="line"><span class="lineno">  122</span>        std::swap(<a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[i], <a class="code hl_variable" href="#a34a93a87967308eb516328c0aca3c48e">harr</a>[smallest]);</div>
 <div class="line"><span class="lineno">  123</span>        <a class="code hl_function" href="#aaef438c1056492cb62c4a4d9035b5cad">MinHeapify</a>(smallest);</div>
 <div class="line"><span class="lineno">  124</span>    }</div>
 <div class="line"><span class="lineno">  125</span>}</div>
-<div class="ttc" id="aclass_min_heap_html_aa8c6c141e3de664819686aa637e1afca"><div class="ttname"><a href="#aa8c6c141e3de664819686aa637e1afca">MinHeap::left</a></div><div class="ttdeci">int left(int i)</div><div class="ttdef"><b>Definition</b> binaryheap.cpp:31</div></div>
-<div class="ttc" id="aclass_min_heap_html_ac760b85cf90265b8d674b942a43fb70e"><div class="ttname"><a href="#ac760b85cf90265b8d674b942a43fb70e">MinHeap::right</a></div><div class="ttdeci">int right(int i)</div><div class="ttdef"><b>Definition</b> binaryheap.cpp:34</div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:119</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.svg" width="312" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclass_min_heap_html_aa8c6c141e3de664819686aa637e1afca"><div class="ttname"><a href="#aa8c6c141e3de664819686aa637e1afca">MinHeap::left</a></div><div class="ttdeci">int left(int i)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/binaryheap_8cpp_source.html#l00031">binaryheap.cpp:31</a></div></div>
+<div class="ttc" id="aclass_min_heap_html_ac760b85cf90265b8d674b942a43fb70e"><div class="ttname"><a href="#ac760b85cf90265b8d674b942a43fb70e">MinHeap::right</a></div><div class="ttdeci">int right(int i)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/binaryheap_8cpp_source.html#l00034">binaryheap.cpp:34</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00119">composite_simpson_rule.cpp:119</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0e893f9deb4be4cf4f9990e736483e81" name="a0e893f9deb4be4cf4f9990e736483e81"></a>
@@ -483,6 +490,8 @@ Here is the call graph for this function:</div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html">binaryheap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   28</span>{ <span class="keywordflow">return</span> (i - 1) / 2; }</div>
 </div><!-- fragment -->
 </div>
@@ -510,12 +519,93 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>to get index of right child of node at index i </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html">binaryheap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   34</span>{ <span class="keywordflow">return</span> (2 * i + 2); }</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a88b4aa3e66392a3eabbf2517a9a79a02" name="a88b4aa3e66392a3eabbf2517a9a79a02"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a88b4aa3e66392a3eabbf2517a9a79a02">&#9670;&#160;</a></span>capacity</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int MinHeap::capacity</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>maximum possible size of min heap </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html#l00012">12</a> of file <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html">binaryheap.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a34a93a87967308eb516328c0aca3c48e" name="a34a93a87967308eb516328c0aca3c48e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a34a93a87967308eb516328c0aca3c48e">&#9670;&#160;</a></span>harr</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int* MinHeap::harr</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>pointer to array of elements in heap </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html#l00011">11</a> of file <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html">binaryheap.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ae4d358bf063bb196a1945b3fb99b4913" name="ae4d358bf063bb196a1945b3fb99b4913"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ae4d358bf063bb196a1945b3fb99b4913">&#9670;&#160;</a></span>heap_size</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int MinHeap::heap_size</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Current number of elements in min heap. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html#l00013">13</a> of file <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html">binaryheap.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../de/dc3/binaryheap_8cpp.html">binaryheap.cpp</a></li>
+<li>data_structures/<a class="el" href="../../de/dc3/binaryheap_8cpp_source.html">binaryheap.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.map b/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.map
deleted file mode 100644
index a65352322..000000000
--- a/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="MinHeap::deleteKey" name="MinHeap::deleteKey">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,43,145,68"/>
-<area shape="rect" id="Node000002" href="$d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5" title=" " alt="" coords="383,5,540,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="145,46,367,25,367,30,145,51"/>
-<area shape="rect" id="Node000004" href="$d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980" title=" " alt="" coords="193,68,335,94"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="145,62,177,67,177,72,145,68"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="602,11,681,36"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="541,18,587,19,587,25,541,23"/>
-<area shape="rect" id="Node000005" href="$d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad" title=" " alt="" coords="388,79,535,104"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="336,82,372,84,372,89,335,87"/>
-<area shape="poly" id="edge8_Node000005_Node000003" title=" " alt="" coords="497,76,590,40,592,45,499,81"/>
-<area shape="poly" id="edge6_Node000005_Node000005" title=" " alt="" coords="431,80,425,70,429,60,441,54,462,52,483,55,495,61,492,66,482,60,462,57,443,59,433,64,431,69,436,77"/>
-<area shape="rect" id="Node000006" href="$d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca" title=" " alt="" coords="592,72,691,98"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="535,86,576,85,576,90,536,91"/>
-<area shape="rect" id="Node000007" href="$d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e" title=" " alt="" coords="588,121,695,147"/>
-<area shape="poly" id="edge7_Node000005_Node000007" title=" " alt="" coords="520,102,574,115,573,121,518,108"/>
-</map>
diff --git a/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.md5 b/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.md5
deleted file mode 100644
index 397b7ba64..000000000
--- a/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e6e0cdfeb0093b8caaeeb886f65f4400
\ No newline at end of file
diff --git a/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.svg b/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.svg
deleted file mode 100644
index c6823c055..000000000
--- a/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.svg
+++ /dev/null
@@ -1,230 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: MinHeap::deleteKey Pages: 1 -->
-<!--zoomable 114 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 525;
-var viewHeight = 114;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>MinHeap::deleteKey</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="104.5,-78.25 0,-78.25 0,-59 104.5,-59 104.5,-78.25"/>
-<text text-anchor="middle" x="52.25" y="-64.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::deleteKey</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="401.25,-106.25 283.25,-106.25 283.25,-87 401.25,-87 401.25,-106.25"/>
-<text text-anchor="middle" x="342.25" y="-92.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::decreaseKey</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.74,-73.63C151.22,-78.15 220,-84.84 271.42,-89.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="270.97,-93.31 281.26,-90.79 271.65,-86.34 270.97,-93.31"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.25,-59.25 140.5,-59.25 140.5,-40 247.25,-40 247.25,-59.25"/>
-<text text-anchor="middle" x="193.88" y="-45.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::extractMin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.84,-61.6C112.66,-60.54 120.8,-59.43 128.84,-58.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.16,-61.83 138.59,-57.01 128.21,-54.89 129.16,-61.83"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="506.5,-102.25 447.75,-102.25 447.75,-83 506.5,-83 506.5,-102.25"/>
-<text text-anchor="middle" x="477.12" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M401.53,-94.87C413.21,-94.52 425.22,-94.16 436.11,-93.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="436.01,-97.33 445.9,-93.54 435.79,-90.34 436.01,-97.33"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.5,-51.25 287,-51.25 287,-32 397.5,-32 397.5,-51.25"/>
-<text text-anchor="middle" x="342.25" y="-37.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::MinHeapify</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M247.72,-46.74C256.59,-46.25 265.89,-45.74 275.04,-45.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="275.21,-48.74 285,-44.7 274.82,-41.75 275.21,-48.74"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge8_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge8_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M369.5,-51.7C389.43,-59.35 417.08,-69.96 439.24,-78.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="437.92,-81.71 448.51,-82.03 440.43,-75.18 437.92,-81.71"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.13,-51.54C311.5,-60.15 318.54,-69.25 342.25,-69.25 355.22,-69.25 363.2,-66.53 366.19,-62.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="369.59,-61.83 363.74,-53 362.81,-63.56 369.59,-61.83"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="514.38,-56.25 439.88,-56.25 439.88,-37 514.38,-37 514.38,-56.25"/>
-<text text-anchor="middle" x="477.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::left</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M397.68,-43.67C407.78,-44.05 418.25,-44.45 428.14,-44.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="427.78,-48.31 437.91,-45.19 428.04,-41.31 427.78,-48.31"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="517,-19.25 437.25,-19.25 437.25,0 517,0 517,-19.25"/>
-<text text-anchor="middle" x="477.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::right</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge7_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge7_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M385.29,-31.5C398.24,-28.38 412.63,-24.92 426.06,-21.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="426.69,-25.13 435.59,-19.39 425.05,-18.32 426.69,-25.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="class_min_heap_a37ac126eabb0c3ce04047172abccca29_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph_org.svg b/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph_org.svg
deleted file mode 100644
index 75de37c24..000000000
--- a/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph_org.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: MinHeap::deleteKey Pages: 1 -->
-<svg width="525pt" height="114pt"
- viewBox="0.00 0.00 525.00 114.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 110.25)">
-<title>MinHeap::deleteKey</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="104.5,-78.25 0,-78.25 0,-59 104.5,-59 104.5,-78.25"/>
-<text text-anchor="middle" x="52.25" y="-64.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::deleteKey</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="401.25,-106.25 283.25,-106.25 283.25,-87 401.25,-87 401.25,-106.25"/>
-<text text-anchor="middle" x="342.25" y="-92.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::decreaseKey</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.74,-73.63C151.22,-78.15 220,-84.84 271.42,-89.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="270.97,-93.31 281.26,-90.79 271.65,-86.34 270.97,-93.31"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.25,-59.25 140.5,-59.25 140.5,-40 247.25,-40 247.25,-59.25"/>
-<text text-anchor="middle" x="193.88" y="-45.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::extractMin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.84,-61.6C112.66,-60.54 120.8,-59.43 128.84,-58.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.16,-61.83 138.59,-57.01 128.21,-54.89 129.16,-61.83"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="506.5,-102.25 447.75,-102.25 447.75,-83 506.5,-83 506.5,-102.25"/>
-<text text-anchor="middle" x="477.12" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M401.53,-94.87C413.21,-94.52 425.22,-94.16 436.11,-93.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="436.01,-97.33 445.9,-93.54 435.79,-90.34 436.01,-97.33"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.5,-51.25 287,-51.25 287,-32 397.5,-32 397.5,-51.25"/>
-<text text-anchor="middle" x="342.25" y="-37.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::MinHeapify</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M247.72,-46.74C256.59,-46.25 265.89,-45.74 275.04,-45.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="275.21,-48.74 285,-44.7 274.82,-41.75 275.21,-48.74"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge8_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge8_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M369.5,-51.7C389.43,-59.35 417.08,-69.96 439.24,-78.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="437.92,-81.71 448.51,-82.03 440.43,-75.18 437.92,-81.71"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.13,-51.54C311.5,-60.15 318.54,-69.25 342.25,-69.25 355.22,-69.25 363.2,-66.53 366.19,-62.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="369.59,-61.83 363.74,-53 362.81,-63.56 369.59,-61.83"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="514.38,-56.25 439.88,-56.25 439.88,-37 514.38,-37 514.38,-56.25"/>
-<text text-anchor="middle" x="477.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::left</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M397.68,-43.67C407.78,-44.05 418.25,-44.45 428.14,-44.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="427.78,-48.31 437.91,-45.19 428.04,-41.31 427.78,-48.31"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="517,-19.25 437.25,-19.25 437.25,0 517,0 517,-19.25"/>
-<text text-anchor="middle" x="477.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::right</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge7_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge7_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M385.29,-31.5C398.24,-28.38 412.63,-24.92 426.06,-21.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="426.69,-25.13 435.59,-19.39 425.05,-18.32 426.69,-25.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.map b/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.map
deleted file mode 100644
index 221381ab5..000000000
--- a/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="MinHeap::extractMin" name="MinHeap::extractMin">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,148,80"/>
-<area shape="rect" id="Node000002" href="$d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad" title=" " alt="" coords="196,55,343,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="148,65,180,65,180,70,148,70"/>
-<area shape="poly" id="edge3_Node000002_Node000002" title=" " alt="" coords="240,56,234,46,237,36,250,30,269,28,291,31,302,37,299,42,289,36,269,33,251,35,241,40,239,45,244,53"/>
-<area shape="rect" id="Node000003" href="$d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca" title=" " alt="" coords="394,5,494,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="317,51,380,33,382,38,318,57"/>
-<area shape="rect" id="Node000004" href="$d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e" title=" " alt="" coords="391,55,497,80"/>
-<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="343,65,376,65,376,70,343,70"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="405,104,483,130"/>
-<area shape="poly" id="edge5_Node000002_Node000005" title=" " alt="" coords="318,78,391,99,389,104,317,84"/>
-</map>
diff --git a/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.md5 b/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.md5
deleted file mode 100644
index 4544e6444..000000000
--- a/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-325a6ef9c217b5b6c81035c0feddd5df
\ No newline at end of file
diff --git a/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.svg b/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.svg
deleted file mode 100644
index 6cbb673d6..000000000
--- a/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.svg
+++ /dev/null
@@ -1,128 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: MinHeap::extractMin Pages: 1 -->
-<svg width="377pt" height="101pt"
- viewBox="0.00 0.00 377.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>MinHeap::extractMin</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="106.75,-56.25 0,-56.25 0,-37 106.75,-37 106.75,-56.25"/>
-<text text-anchor="middle" x="53.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::extractMin</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.25,-56.25 142.75,-56.25 142.75,-37 253.25,-37 253.25,-56.25"/>
-<text text-anchor="middle" x="198" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::MinHeapify</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.08,-46.62C114.95,-46.62 123.15,-46.62 131.26,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.09,-50.13 141.09,-46.63 131.09,-43.13 131.09,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.47,-56.54C168.11,-65.15 174.95,-74.25 198,-74.25 210.61,-74.25 218.36,-71.53 221.27,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.69,-66.88 218.89,-58.01 217.89,-68.56 224.69,-66.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="366.38,-93.25 291.88,-93.25 291.88,-74 366.38,-74 366.38,-93.25"/>
-<text text-anchor="middle" x="329.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::left</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.28,-56.74C248.95,-60.94 266.16,-65.87 281.82,-70.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="280.85,-73.72 291.43,-73.11 282.78,-66.99 280.85,-73.72"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="369,-56.25 289.25,-56.25 289.25,-37 369,-37 369,-56.25"/>
-<text text-anchor="middle" x="329.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::right</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.39,-46.62C261.44,-46.62 269.72,-46.62 277.69,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.58,-50.13 287.58,-46.63 277.58,-43.13 277.58,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.5,-19.25 299.75,-19.25 299.75,0 358.5,0 358.5,-19.25"/>
-<text text-anchor="middle" x="329.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.28,-36.51C251.07,-31.71 271.2,-25.94 288.51,-20.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.3,-24.39 297.95,-18.27 287.38,-17.66 289.3,-24.39"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph_org.svg b/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph_org.svg
deleted file mode 100644
index 7ac91923a..000000000
--- a/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph_org.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: MinHeap::extractMin Pages: 1 -->
-<svg width="377pt" height="101pt"
- viewBox="0.00 0.00 377.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>MinHeap::extractMin</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="106.75,-56.25 0,-56.25 0,-37 106.75,-37 106.75,-56.25"/>
-<text text-anchor="middle" x="53.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::extractMin</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.25,-56.25 142.75,-56.25 142.75,-37 253.25,-37 253.25,-56.25"/>
-<text text-anchor="middle" x="198" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::MinHeapify</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.08,-46.62C114.95,-46.62 123.15,-46.62 131.26,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.09,-50.13 141.09,-46.63 131.09,-43.13 131.09,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.47,-56.54C168.11,-65.15 174.95,-74.25 198,-74.25 210.61,-74.25 218.36,-71.53 221.27,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.69,-66.88 218.89,-58.01 217.89,-68.56 224.69,-66.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="366.38,-93.25 291.88,-93.25 291.88,-74 366.38,-74 366.38,-93.25"/>
-<text text-anchor="middle" x="329.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::left</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.28,-56.74C248.95,-60.94 266.16,-65.87 281.82,-70.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="280.85,-73.72 291.43,-73.11 282.78,-66.99 280.85,-73.72"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="369,-56.25 289.25,-56.25 289.25,-37 369,-37 369,-56.25"/>
-<text text-anchor="middle" x="329.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::right</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.39,-46.62C261.44,-46.62 269.72,-46.62 277.69,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.58,-50.13 287.58,-46.63 277.58,-43.13 277.58,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.5,-19.25 299.75,-19.25 299.75,0 358.5,0 358.5,-19.25"/>
-<text text-anchor="middle" x="329.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.28,-36.51C251.07,-31.71 271.2,-25.94 288.51,-20.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.3,-24.39 297.95,-18.27 287.38,-17.66 289.3,-24.39"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.map b/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.map
deleted file mode 100644
index 2f091f797..000000000
--- a/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="MinHeap::decreaseKey" name="MinHeap::decreaseKey">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,163,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="211,5,289,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="163,16,195,16,195,21,163,21"/>
-</map>
diff --git a/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.md5 b/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.md5
deleted file mode 100644
index f3e40a1f6..000000000
--- a/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a8505d3f12ecdb96135803b402b566aa
\ No newline at end of file
diff --git a/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.svg b/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.svg
deleted file mode 100644
index 202bed15c..000000000
--- a/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: MinHeap::decreaseKey Pages: 1 -->
-<svg width="221pt" height="27pt"
- viewBox="0.00 0.00 220.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>MinHeap::decreaseKey</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="118,-19.25 0,-19.25 0,0 118,0 118,-19.25"/>
-<text text-anchor="middle" x="59" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::decreaseKey</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="212.75,-19.25 154,-19.25 154,0 212.75,0 212.75,-19.25"/>
-<text text-anchor="middle" x="183.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.32,-9.62C126.5,-9.62 134.74,-9.62 142.47,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.21,-13.13 152.21,-9.63 142.21,-6.13 142.21,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph_org.svg b/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph_org.svg
deleted file mode 100644
index 02698ae61..000000000
--- a/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: MinHeap::decreaseKey Pages: 1 -->
-<svg width="221pt" height="27pt"
- viewBox="0.00 0.00 220.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>MinHeap::decreaseKey</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="118,-19.25 0,-19.25 0,0 118,0 118,-19.25"/>
-<text text-anchor="middle" x="59" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::decreaseKey</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="212.75,-19.25 154,-19.25 154,0 212.75,0 212.75,-19.25"/>
-<text text-anchor="middle" x="183.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.32,-9.62C126.5,-9.62 134.74,-9.62 142.47,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.21,-13.13 152.21,-9.63 142.21,-6.13 142.21,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.map b/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.map
deleted file mode 100644
index 5fc12ff51..000000000
--- a/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="MinHeap::MinHeapify" name="MinHeap::MinHeapify">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,153,80"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="49,56,44,46,47,36,59,30,79,28,100,31,111,37,109,42,99,36,79,33,61,35,51,40,49,45,54,53"/>
-<area shape="rect" id="Node000002" href="$d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca" title=" " alt="" coords="204,5,304,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="127,51,190,33,191,38,128,57"/>
-<area shape="rect" id="Node000003" href="$d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e" title=" " alt="" coords="201,55,307,80"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="153,65,185,65,185,70,153,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="215,104,293,130"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="128,78,200,99,199,104,127,84"/>
-</map>
diff --git a/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.md5 b/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.md5
deleted file mode 100644
index c5a3c45d9..000000000
--- a/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7fac5552561d78a4c2b59c95372c9033
\ No newline at end of file
diff --git a/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.svg b/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.svg
deleted file mode 100644
index 6e04cd718..000000000
--- a/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.svg
+++ /dev/null
@@ -1,110 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: MinHeap::MinHeapify Pages: 1 -->
-<svg width="234pt" height="101pt"
- viewBox="0.00 0.00 234.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>MinHeap::MinHeapify</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="110.5,-56.25 0,-56.25 0,-37 110.5,-37 110.5,-56.25"/>
-<text text-anchor="middle" x="55.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::MinHeapify</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.72,-56.54C25.36,-65.15 32.2,-74.25 55.25,-74.25 67.86,-74.25 75.61,-71.53 78.52,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.94,-66.88 76.14,-58.01 75.14,-68.56 81.94,-66.88"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.62,-93.25 149.12,-93.25 149.12,-74 223.62,-74 223.62,-93.25"/>
-<text text-anchor="middle" x="186.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::left</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.53,-56.74C106.2,-60.94 123.41,-65.87 139.07,-70.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.1,-73.72 148.68,-73.11 140.03,-66.99 138.1,-73.72"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.25,-56.25 146.5,-56.25 146.5,-37 226.25,-37 226.25,-56.25"/>
-<text text-anchor="middle" x="186.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::right</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.64,-46.62C118.69,-46.62 126.97,-46.62 134.94,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.83,-50.13 144.83,-46.63 134.83,-43.13 134.83,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.75,-19.25 157,-19.25 157,0 215.75,0 215.75,-19.25"/>
-<text text-anchor="middle" x="186.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.53,-36.51C108.32,-31.71 128.45,-25.94 145.76,-20.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.55,-24.39 155.2,-18.27 144.63,-17.66 146.55,-24.39"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph_org.svg b/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph_org.svg
deleted file mode 100644
index d86872333..000000000
--- a/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph_org.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: MinHeap::MinHeapify Pages: 1 -->
-<svg width="234pt" height="101pt"
- viewBox="0.00 0.00 234.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>MinHeap::MinHeapify</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="110.5,-56.25 0,-56.25 0,-37 110.5,-37 110.5,-56.25"/>
-<text text-anchor="middle" x="55.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::MinHeapify</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.72,-56.54C25.36,-65.15 32.2,-74.25 55.25,-74.25 67.86,-74.25 75.61,-71.53 78.52,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.94,-66.88 76.14,-58.01 75.14,-68.56 81.94,-66.88"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.62,-93.25 149.12,-93.25 149.12,-74 223.62,-74 223.62,-93.25"/>
-<text text-anchor="middle" x="186.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::left</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.53,-56.74C106.2,-60.94 123.41,-65.87 139.07,-70.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.1,-73.72 148.68,-73.11 140.03,-66.99 138.1,-73.72"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.25,-56.25 146.5,-56.25 146.5,-37 226.25,-37 226.25,-56.25"/>
-<text text-anchor="middle" x="186.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::right</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.64,-46.62C118.69,-46.62 126.97,-46.62 134.94,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.83,-50.13 144.83,-46.63 134.83,-43.13 134.83,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.75,-19.25 157,-19.25 157,0 215.75,0 215.75,-19.25"/>
-<text text-anchor="middle" x="186.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.53,-36.51C108.32,-31.71 128.45,-25.94 145.76,-20.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.55,-24.39 155.2,-18.27 144.63,-17.66 146.55,-24.39"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.map b/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.map
deleted file mode 100644
index 2e3b9378c..000000000
--- a/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="MinHeap::insertKey" name="MinHeap::insertKey">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,142,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="190,5,268,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="142,16,174,16,174,21,142,21"/>
-</map>
diff --git a/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.md5 b/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.md5
deleted file mode 100644
index 957b2b6e1..000000000
--- a/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-14128a93234d6975f4dbad29019fcef8
\ No newline at end of file
diff --git a/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.svg b/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.svg
deleted file mode 100644
index de6b680e3..000000000
--- a/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: MinHeap::insertKey Pages: 1 -->
-<svg width="205pt" height="27pt"
- viewBox="0.00 0.00 205.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>MinHeap::insertKey</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="102.25,-19.25 0,-19.25 0,0 102.25,0 102.25,-19.25"/>
-<text text-anchor="middle" x="51.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::insertKey</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197,-19.25 138.25,-19.25 138.25,0 197,0 197,-19.25"/>
-<text text-anchor="middle" x="167.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.68,-9.62C110.72,-9.62 118.93,-9.62 126.68,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.48,-13.13 136.48,-9.63 126.48,-6.13 126.48,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph_org.svg b/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph_org.svg
deleted file mode 100644
index 88deb7a95..000000000
--- a/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: MinHeap::insertKey Pages: 1 -->
-<svg width="205pt" height="27pt"
- viewBox="0.00 0.00 205.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>MinHeap::insertKey</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="102.25,-19.25 0,-19.25 0,0 102.25,0 102.25,-19.25"/>
-<text text-anchor="middle" x="51.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap::insertKey</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197,-19.25 138.25,-19.25 138.25,0 197,0 197,-19.25"/>
-<text text-anchor="middle" x="167.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.68,-9.62C110.72,-9.62 118.93,-9.62 126.68,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.48,-13.13 136.48,-9.63 126.48,-6.13 126.48,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d0b/fast__power_8cpp.html b/d2/d0b/fast__power_8cpp.html
index ff04594a2..c47fd5f73 100644
--- a/d2/d0b/fast__power_8cpp.html
+++ b/d2/d0b/fast__power_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/fast_power.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/fast_power.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for fast_power.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d30/fast__power_8cpp__incl.svg" width="498" height="111"><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">
+</div>
+<p><a href="../../d2/d0b/fast__power_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a8399b847626e5bba983cab7c7918b445" id="r_a8399b847626e5bba983cab7c7918b445"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
@@ -143,6 +162,8 @@ Functions</h2></td></tr>
  \cdot a^\frac{b-1}{2} \cdot a = {a^\frac{b-1}{2}}^2 \cdot a\)</li>
 </ol>
 <p>We can compute \(a^b\) recursively using above algorithm. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d2/d0b/fast__power_8cpp_source.html">fast_power.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a0d4e3f0099a6975b74a314a35bd0f94d" name="a0d4e3f0099a6975b74a314a35bd0f94d"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0d4e3f0099a6975b74a314a35bd0f94d">&#9670;&#160;</a></span>fast_power_linear()</h2>
@@ -165,6 +186,8 @@ template&lt;typename T &gt; </div>
       </table>
 </div><div class="memdoc">
 <p>Same algorithm with little different formula. It still calculates in \(O(\log N)\) </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d0b/fast__power_8cpp_source.html#l00050">50</a> of file <a class="el" href="../../d2/d0b/fast__power_8cpp_source.html">fast_power.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   50</span>                                   {</div>
 <div class="line"><span class="lineno">   51</span>    <span class="comment">// negative power. a^b = 1 / (a^-b)</span></div>
 <div class="line"><span class="lineno">   52</span>    <span class="keywordflow">if</span> (b &lt; 0)</div>
@@ -179,14 +202,9 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   61</span>    }</div>
 <div class="line"><span class="lineno">   62</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   63</span>}</div>
-<div class="ttc" id="afast__power_8cpp_html_a0d4e3f0099a6975b74a314a35bd0f94d"><div class="ttname"><a href="#a0d4e3f0099a6975b74a314a35bd0f94d">fast_power_linear</a></div><div class="ttdeci">double fast_power_linear(T a, T b)</div><div class="ttdef"><b>Definition</b> fast_power.cpp:50</div></div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d0b/fast__power_8cpp_a0d4e3f0099a6975b74a314a35bd0f94d_cgraph.svg" width="135" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afast__power_8cpp_html_a0d4e3f0099a6975b74a314a35bd0f94d"><div class="ttname"><a href="#a0d4e3f0099a6975b74a314a35bd0f94d">fast_power_linear</a></div><div class="ttdeci">double fast_power_linear(T a, T b)</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d0b/fast__power_8cpp_source.html#l00050">fast_power.cpp:50</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a8399b847626e5bba983cab7c7918b445" name="a8399b847626e5bba983cab7c7918b445"></a>
@@ -210,6 +228,8 @@ template&lt;typename T &gt; </div>
       </table>
 </div><div class="memdoc">
 <p>algorithm implementation for \(a^b\) </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d0b/fast__power_8cpp_source.html#l00026">26</a> of file <a class="el" href="../../d2/d0b/fast__power_8cpp_source.html">fast_power.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   26</span>                                      {</div>
 <div class="line"><span class="lineno">   27</span>    <span class="comment">// negative power. a^b = 1 / (a^-b)</span></div>
 <div class="line"><span class="lineno">   28</span>    <span class="keywordflow">if</span> (b &lt; 0)</div>
@@ -228,13 +248,8 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   41</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = bottom * bottom * a;</div>
 <div class="line"><span class="lineno">   42</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   43</span>}</div>
-<div class="ttc" id="afast__power_8cpp_html_a8399b847626e5bba983cab7c7918b445"><div class="ttname"><a href="#a8399b847626e5bba983cab7c7918b445">fast_power_recursive</a></div><div class="ttdeci">double fast_power_recursive(T a, T b)</div><div class="ttdef"><b>Definition</b> fast_power.cpp:26</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d0b/fast__power_8cpp_a8399b847626e5bba983cab7c7918b445_cgraph.svg" width="156" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afast__power_8cpp_html_a8399b847626e5bba983cab7c7918b445"><div class="ttname"><a href="#a8399b847626e5bba983cab7c7918b445">fast_power_recursive</a></div><div class="ttdeci">double fast_power_recursive(T a, T b)</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d0b/fast__power_8cpp_source.html#l00026">fast_power.cpp:26</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -252,46 +267,35 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d0b/fast__power_8cpp_source.html#l00068">68</a> of file <a class="el" href="../../d2/d0b/fast__power_8cpp_source.html">fast_power.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   68</span>           {</div>
-<div class="line"><span class="lineno">   69</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>));</div>
-<div class="line"><span class="lineno">   70</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html">std::ios_base::sync_with_stdio</a>(<span class="keyword">false</span>);</div>
+<div class="line"><span class="lineno">   69</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><span class="lineno">   70</span>    std::ios_base::sync_with_stdio(<span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">   71</span> </div>
-<div class="line"><span class="lineno">   72</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testing...&quot;</span> &lt;&lt; <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">   72</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   73</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 20; i++) {</div>
-<div class="line"><span class="lineno">   74</span>        <span class="keywordtype">int</span> a = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 20 - 10;</div>
-<div class="line"><span class="lineno">   75</span>        <span class="keywordtype">int</span> b = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 20 - 10;</div>
-<div class="line"><span class="lineno">   76</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <span class="stringliteral">&quot;Calculating &quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;^&quot;</span> &lt;&lt; b &lt;&lt; <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">   77</span>        assert(<a class="code hl_function" href="#a8399b847626e5bba983cab7c7918b445">fast_power_recursive</a>(a, b) == <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(a, b));</div>
-<div class="line"><span class="lineno">   78</span>        assert(<a class="code hl_function" href="#a0d4e3f0099a6975b74a314a35bd0f94d">fast_power_linear</a>(a, b) == <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(a, b));</div>
+<div class="line"><span class="lineno">   74</span>        <span class="keywordtype">int</span> a = std::rand() % 20 - 10;</div>
+<div class="line"><span class="lineno">   75</span>        <span class="keywordtype">int</span> b = std::rand() % 20 - 10;</div>
+<div class="line"><span class="lineno">   76</span>        std::cout &lt;&lt; std::endl &lt;&lt; <span class="stringliteral">&quot;Calculating &quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;^&quot;</span> &lt;&lt; b &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   77</span>        assert(<a class="code hl_function" href="#a8399b847626e5bba983cab7c7918b445">fast_power_recursive</a>(a, b) == std::pow(a, b));</div>
+<div class="line"><span class="lineno">   78</span>        assert(<a class="code hl_function" href="#a0d4e3f0099a6975b74a314a35bd0f94d">fast_power_linear</a>(a, b) == std::pow(a, b));</div>
 <div class="line"><span class="lineno">   79</span> </div>
-<div class="line"><span class="lineno">   80</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;------ &quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;^&quot;</span> &lt;&lt; b &lt;&lt; <span class="stringliteral">&quot; = &quot;</span></div>
-<div class="line"><span class="lineno">   81</span>                  &lt;&lt; <a class="code hl_function" href="#a8399b847626e5bba983cab7c7918b445">fast_power_recursive</a>(a, b) &lt;&lt; <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">   80</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;------ &quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;^&quot;</span> &lt;&lt; b &lt;&lt; <span class="stringliteral">&quot; = &quot;</span></div>
+<div class="line"><span class="lineno">   81</span>                  &lt;&lt; <a class="code hl_function" href="#a8399b847626e5bba983cab7c7918b445">fast_power_recursive</a>(a, b) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   82</span>    }</div>
 <div class="line"><span class="lineno">   83</span> </div>
 <div class="line"><span class="lineno">   84</span>    int64_t a, b;</div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; a &gt;&gt; b;</div>
+<div class="line"><span class="lineno">   85</span>    std::cin &gt;&gt; a &gt;&gt; b;</div>
 <div class="line"><span class="lineno">   86</span> </div>
-<div class="line"><span class="lineno">   87</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;^&quot;</span> &lt;&lt; b &lt;&lt; <span class="stringliteral">&quot; = &quot;</span> &lt;&lt; <a class="code hl_function" href="#a8399b847626e5bba983cab7c7918b445">fast_power_recursive</a>(a, b)</div>
-<div class="line"><span class="lineno">   88</span>              &lt;&lt; <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">   87</span>    std::cout &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;^&quot;</span> &lt;&lt; b &lt;&lt; <span class="stringliteral">&quot; = &quot;</span> &lt;&lt; <a class="code hl_function" href="#a8399b847626e5bba983cab7c7918b445">fast_power_recursive</a>(a, b)</div>
+<div class="line"><span class="lineno">   88</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   89</span> </div>
-<div class="line"><span class="lineno">   90</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;^&quot;</span> &lt;&lt; b &lt;&lt; <span class="stringliteral">&quot; = &quot;</span> &lt;&lt; <a class="code hl_function" href="#a0d4e3f0099a6975b74a314a35bd0f94d">fast_power_linear</a>(a, b) &lt;&lt; <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">   90</span>    std::cout &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;^&quot;</span> &lt;&lt; b &lt;&lt; <span class="stringliteral">&quot; = &quot;</span> &lt;&lt; <a class="code hl_function" href="#a0d4e3f0099a6975b74a314a35bd0f94d">fast_power_linear</a>(a, b) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   91</span> </div>
 <div class="line"><span class="lineno">   92</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   93</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="async_with_stdio_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html">std::ios_base::sync_with_stdio</a></div><div class="ttdeci">T sync_with_stdio(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="254" height="446"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d2/d0b/fast__power_8cpp_a0d4e3f0099a6975b74a314a35bd0f94d_cgraph.map b/d2/d0b/fast__power_8cpp_a0d4e3f0099a6975b74a314a35bd0f94d_cgraph.map
deleted file mode 100644
index 18d95ec31..000000000
--- a/d2/d0b/fast__power_8cpp_a0d4e3f0099a6975b74a314a35bd0f94d_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="fast_power_linear" name="fast_power_linear">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,129,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,30,41,21,44,11,53,5,67,3,82,5,91,12,87,16,80,10,67,8,55,10,48,14,47,20,50,28"/>
-</map>
diff --git a/d2/d0b/fast__power_8cpp_a0d4e3f0099a6975b74a314a35bd0f94d_cgraph.md5 b/d2/d0b/fast__power_8cpp_a0d4e3f0099a6975b74a314a35bd0f94d_cgraph.md5
deleted file mode 100644
index baa2223b4..000000000
--- a/d2/d0b/fast__power_8cpp_a0d4e3f0099a6975b74a314a35bd0f94d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ce73acb2abd90b8bc28833f851011888
\ No newline at end of file
diff --git a/d2/d0b/fast__power_8cpp_a0d4e3f0099a6975b74a314a35bd0f94d_cgraph.svg b/d2/d0b/fast__power_8cpp_a0d4e3f0099a6975b74a314a35bd0f94d_cgraph.svg
deleted file mode 100644
index 51b199c0c..000000000
--- a/d2/d0b/fast__power_8cpp_a0d4e3f0099a6975b74a314a35bd0f94d_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: fast_power_linear Pages: 1 -->
-<svg width="101pt" height="45pt"
- viewBox="0.00 0.00 100.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>fast_power_linear</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="92.5,-19.25 0,-19.25 0,0 92.5,0 92.5,-19.25"/>
-<text text-anchor="middle" x="46.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fast_power_linear</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.77,-19.54C25.16,-28.15 29.99,-37.25 46.25,-37.25 55.14,-37.25 60.61,-34.53 62.67,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.16,-30.28 60.99,-21.03 59.26,-31.48 66.16,-30.28"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d0b/fast__power_8cpp_a0d4e3f0099a6975b74a314a35bd0f94d_cgraph_org.svg b/d2/d0b/fast__power_8cpp_a0d4e3f0099a6975b74a314a35bd0f94d_cgraph_org.svg
deleted file mode 100644
index 0a6c80f98..000000000
--- a/d2/d0b/fast__power_8cpp_a0d4e3f0099a6975b74a314a35bd0f94d_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: fast_power_linear Pages: 1 -->
-<svg width="101pt" height="45pt"
- viewBox="0.00 0.00 100.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>fast_power_linear</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="92.5,-19.25 0,-19.25 0,0 92.5,0 92.5,-19.25"/>
-<text text-anchor="middle" x="46.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fast_power_linear</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.77,-19.54C25.16,-28.15 29.99,-37.25 46.25,-37.25 55.14,-37.25 60.61,-34.53 62.67,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.16,-30.28 60.99,-21.03 59.26,-31.48 66.16,-30.28"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d0b/fast__power_8cpp_a8399b847626e5bba983cab7c7918b445_cgraph.map b/d2/d0b/fast__power_8cpp_a8399b847626e5bba983cab7c7918b445_cgraph.map
deleted file mode 100644
index cad8907f0..000000000
--- a/d2/d0b/fast__power_8cpp_a8399b847626e5bba983cab7c7918b445_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="fast_power_recursive" name="fast_power_recursive">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,151,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="53,30,48,21,51,11,61,5,78,3,96,5,105,12,102,16,94,10,78,8,63,10,55,14,53,20,58,28"/>
-</map>
diff --git a/d2/d0b/fast__power_8cpp_a8399b847626e5bba983cab7c7918b445_cgraph.md5 b/d2/d0b/fast__power_8cpp_a8399b847626e5bba983cab7c7918b445_cgraph.md5
deleted file mode 100644
index d5a9468de..000000000
--- a/d2/d0b/fast__power_8cpp_a8399b847626e5bba983cab7c7918b445_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-efff79a8c244e7ddc58a223805086aaf
\ No newline at end of file
diff --git a/d2/d0b/fast__power_8cpp_a8399b847626e5bba983cab7c7918b445_cgraph.svg b/d2/d0b/fast__power_8cpp_a8399b847626e5bba983cab7c7918b445_cgraph.svg
deleted file mode 100644
index 26b49e770..000000000
--- a/d2/d0b/fast__power_8cpp_a8399b847626e5bba983cab7c7918b445_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: fast_power_recursive Pages: 1 -->
-<svg width="117pt" height="45pt"
- viewBox="0.00 0.00 117.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>fast_power_recursive</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="109,-19.25 0,-19.25 0,0 109,0 109,-19.25"/>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fast_power_recursive</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.44,-19.54C29.65,-28.15 35.34,-37.25 54.5,-37.25 64.98,-37.25 71.43,-34.53 73.85,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.31,-30.11 71.87,-21.02 70.45,-31.52 77.31,-30.11"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d0b/fast__power_8cpp_a8399b847626e5bba983cab7c7918b445_cgraph_org.svg b/d2/d0b/fast__power_8cpp_a8399b847626e5bba983cab7c7918b445_cgraph_org.svg
deleted file mode 100644
index 6772a4bb9..000000000
--- a/d2/d0b/fast__power_8cpp_a8399b847626e5bba983cab7c7918b445_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: fast_power_recursive Pages: 1 -->
-<svg width="117pt" height="45pt"
- viewBox="0.00 0.00 117.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>fast_power_recursive</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="109,-19.25 0,-19.25 0,0 109,0 109,-19.25"/>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fast_power_recursive</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.44,-19.54C29.65,-28.15 35.34,-37.25 54.5,-37.25 64.98,-37.25 71.43,-34.53 73.85,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.31,-30.11 71.87,-21.02 70.45,-31.52 77.31,-30.11"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 1727dc66a..000000000
--- a/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,227,55,252"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="140,5,211,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="30,226,34,190,46,140,67,87,82,62,101,40,124,26,127,30,104,44,86,65,72,89,51,142,40,191,35,227"/>
-<area shape="rect" id="Node000003" href="$d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d" title=" " alt="" coords="114,79,237,104"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="33,225,56,172,76,140,101,114,105,110,108,115,104,117,80,144,61,174,38,227"/>
-<area shape="rect" id="Node000004" href="$d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445" title=" " alt="" coords="103,152,248,178"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="45,224,71,205,101,186,112,181,114,186,104,191,74,210,49,229"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="140,201,211,227"/>
-<area shape="poly" id="edge6_Node000001_Node000005" title=" " alt="" coords="54,233,124,220,125,226,55,238"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="139,251,212,276"/>
-<area shape="poly" id="edge7_Node000001_Node000006" title=" " alt="" coords="55,241,124,252,123,258,54,246"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="136,300,215,326"/>
-<area shape="poly" id="edge8_Node000001_Node000007" title=" " alt="" coords="49,250,104,286,122,294,120,299,101,291,46,255"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/ios_base/sync_with_stdio.html#" title=" " alt="" coords="108,350,243,390"/>
-<area shape="poly" id="edge9_Node000001_Node000008" title=" " alt="" coords="40,251,65,292,83,316,104,336,108,339,105,343,101,340,79,319,61,295,36,254"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="139,415,212,440"/>
-<area shape="poly" id="edge10_Node000001_Node000009" title=" " alt="" coords="36,252,43,283,56,322,76,364,104,400,126,414,123,418,101,404,71,367,51,324,38,284,31,254"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="150,80,146,70,148,61,159,54,175,52,193,55,203,61,200,66,191,60,175,57,160,59,153,64,151,70,155,77"/>
-<area shape="poly" id="edge5_Node000004_Node000004" title=" " alt="" coords="150,153,146,143,148,134,159,128,175,125,193,128,203,135,200,139,191,133,175,131,160,133,153,137,151,143,155,150"/>
-</map>
diff --git a/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 9d603cf82..000000000
--- a/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d21789d8538e8cc7c2890d62733cd9f3
\ No newline at end of file
diff --git a/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index f6077826d..000000000
--- a/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,210 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="190pt" height="334pt"
- viewBox="0.00 0.00 190.00 334.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 330.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-160.25 0,-160.25 0,-141 37,-141 37,-160.25"/>
-<text text-anchor="middle" x="18.5" y="-146.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.25,-326.25 100.75,-326.25 100.75,-307 154.25,-307 154.25,-326.25"/>
-<text text-anchor="middle" x="127.5" y="-312.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.19,-160.47C22.54,-186.72 32.57,-259.08 73,-298.62 77.71,-303.23 83.64,-306.66 89.82,-309.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.27,-312.38 98.86,-312.25 90.5,-305.75 88.27,-312.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173.75,-271.25 81.25,-271.25 81.25,-252 173.75,-252 173.75,-271.25"/>
-<text text-anchor="middle" x="127.5" y="-257.75" font-family="Helvetica,sans-Serif" font-size="10.00">fast_power_linear</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.57,-160.61C28.91,-179.55 45.2,-220.83 73,-243.62 73.97,-244.42 74.97,-245.17 76,-245.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.22,-248.92 84.64,-250.83 77.69,-242.83 74.22,-248.92"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="182,-216.25 73,-216.25 73,-197 182,-197 182,-216.25"/>
-<text text-anchor="middle" x="127.5" y="-202.75" font-family="Helvetica,sans-Serif" font-size="10.00">fast_power_recursive</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.17,-160.45C41.6,-168.84 57.57,-180.77 73,-188.62 75.56,-189.93 78.23,-191.17 80.96,-192.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.65,-195.59 90.23,-196 82.21,-189.08 79.65,-195.59"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.25,-179.25 100.75,-179.25 100.75,-160 154.25,-160 154.25,-179.25"/>
-<text text-anchor="middle" x="127.5" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.17,-153.76C51.29,-156.27 71.57,-159.87 89.24,-163.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.44,-166.42 98.9,-164.72 89.66,-159.53 88.44,-166.42"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.62,-142.25 100.38,-142.25 100.38,-123 154.62,-123 154.62,-142.25"/>
-<text text-anchor="middle" x="127.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.17,-147.65C51.19,-145.29 71.29,-141.91 88.88,-138.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.21,-142.45 98.49,-137.34 88.05,-135.54 89.21,-142.45"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="157.25,-105.25 97.75,-105.25 97.75,-86 157.25,-86 157.25,-105.25"/>
-<text text-anchor="middle" x="127.5" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge8_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.63,-140.75C42.09,-132.62 57.86,-121.22 73,-113.62 77.29,-111.48 81.89,-109.49 86.53,-107.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.66,-111 95.88,-104.32 85.28,-104.41 87.66,-111"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="178.25,-67.88 76.75,-67.88 76.75,-37.38 178.25,-37.38 178.25,-67.88"/>
-<text text-anchor="start" x="84.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::ios_base::sync</text>
-<text text-anchor="middle" x="127.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_with_stdio</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge9_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge9_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.45,-140.73C32.64,-125.21 50.38,-95.04 73,-76.62 73.95,-75.85 74.92,-75.1 75.92,-74.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.62,-77.44 84.17,-69.11 73.85,-71.54 77.62,-77.44"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.62,-19.25 100.38,-19.25 100.38,0 154.62,0 154.62,-19.25"/>
-<text text-anchor="middle" x="127.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge10_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge10_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.13,-140.54C25.4,-117.44 38.97,-60.29 73,-28.62 77.65,-24.3 83.34,-20.95 89.26,-18.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.35,-21.69 98.55,-14.98 87.96,-15.11 90.35,-21.69"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.44,-271.54C102.65,-280.15 108.34,-289.25 127.5,-289.25 137.98,-289.25 144.43,-286.53 146.85,-282.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.31,-282.11 144.87,-273.02 143.45,-283.52 150.31,-282.11"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.44,-216.54C102.65,-225.15 108.34,-234.25 127.5,-234.25 137.98,-234.25 144.43,-231.53 146.85,-227.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.31,-227.11 144.87,-218.02 143.45,-228.52 150.31,-227.11"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index a9e9ecdf4..000000000
--- a/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,184 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="190pt" height="334pt"
- viewBox="0.00 0.00 190.00 334.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 330.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-160.25 0,-160.25 0,-141 37,-141 37,-160.25"/>
-<text text-anchor="middle" x="18.5" y="-146.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.25,-326.25 100.75,-326.25 100.75,-307 154.25,-307 154.25,-326.25"/>
-<text text-anchor="middle" x="127.5" y="-312.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.19,-160.47C22.54,-186.72 32.57,-259.08 73,-298.62 77.71,-303.23 83.64,-306.66 89.82,-309.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.27,-312.38 98.86,-312.25 90.5,-305.75 88.27,-312.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173.75,-271.25 81.25,-271.25 81.25,-252 173.75,-252 173.75,-271.25"/>
-<text text-anchor="middle" x="127.5" y="-257.75" font-family="Helvetica,sans-Serif" font-size="10.00">fast_power_linear</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.57,-160.61C28.91,-179.55 45.2,-220.83 73,-243.62 73.97,-244.42 74.97,-245.17 76,-245.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.22,-248.92 84.64,-250.83 77.69,-242.83 74.22,-248.92"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="182,-216.25 73,-216.25 73,-197 182,-197 182,-216.25"/>
-<text text-anchor="middle" x="127.5" y="-202.75" font-family="Helvetica,sans-Serif" font-size="10.00">fast_power_recursive</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.17,-160.45C41.6,-168.84 57.57,-180.77 73,-188.62 75.56,-189.93 78.23,-191.17 80.96,-192.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.65,-195.59 90.23,-196 82.21,-189.08 79.65,-195.59"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.25,-179.25 100.75,-179.25 100.75,-160 154.25,-160 154.25,-179.25"/>
-<text text-anchor="middle" x="127.5" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.17,-153.76C51.29,-156.27 71.57,-159.87 89.24,-163.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.44,-166.42 98.9,-164.72 89.66,-159.53 88.44,-166.42"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.62,-142.25 100.38,-142.25 100.38,-123 154.62,-123 154.62,-142.25"/>
-<text text-anchor="middle" x="127.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.17,-147.65C51.19,-145.29 71.29,-141.91 88.88,-138.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.21,-142.45 98.49,-137.34 88.05,-135.54 89.21,-142.45"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="157.25,-105.25 97.75,-105.25 97.75,-86 157.25,-86 157.25,-105.25"/>
-<text text-anchor="middle" x="127.5" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge8_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.63,-140.75C42.09,-132.62 57.86,-121.22 73,-113.62 77.29,-111.48 81.89,-109.49 86.53,-107.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.66,-111 95.88,-104.32 85.28,-104.41 87.66,-111"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="178.25,-67.88 76.75,-67.88 76.75,-37.38 178.25,-37.38 178.25,-67.88"/>
-<text text-anchor="start" x="84.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::ios_base::sync</text>
-<text text-anchor="middle" x="127.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_with_stdio</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge9_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge9_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.45,-140.73C32.64,-125.21 50.38,-95.04 73,-76.62 73.95,-75.85 74.92,-75.1 75.92,-74.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.62,-77.44 84.17,-69.11 73.85,-71.54 77.62,-77.44"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.62,-19.25 100.38,-19.25 100.38,0 154.62,0 154.62,-19.25"/>
-<text text-anchor="middle" x="127.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge10_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge10_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.13,-140.54C25.4,-117.44 38.97,-60.29 73,-28.62 77.65,-24.3 83.34,-20.95 89.26,-18.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.35,-21.69 98.55,-14.98 87.96,-15.11 90.35,-21.69"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.44,-271.54C102.65,-280.15 108.34,-289.25 127.5,-289.25 137.98,-289.25 144.43,-286.53 146.85,-282.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.31,-282.11 144.87,-273.02 143.45,-283.52 150.31,-282.11"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.44,-216.54C102.65,-225.15 108.34,-234.25 127.5,-234.25 137.98,-234.25 144.43,-231.53 146.85,-227.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.31,-227.11 144.87,-218.02 143.45,-228.52 150.31,-227.11"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d0b/fast__power_8cpp_source.html b/d2/d0b/fast__power_8cpp_source.html
new file mode 100644
index 000000000..503920dd2
--- /dev/null
+++ b/d2/d0b/fast__power_8cpp_source.html
@@ -0,0 +1,216 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/fast_power.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d2/d0b/fast__power_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">fast_power.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d2/d0b/fast__power_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;cstdlib&gt;</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00026" data-start="{" data-end="}">
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"><a class="line" href="../../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445">   26</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445">fast_power_recursive</a>(T a, T b) {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="comment">// negative power. a^b = 1 / (a^-b)</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="keywordflow">if</span> (b &lt; 0)</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>        <span class="keywordflow">return</span> 1.0 / <a class="code hl_function" href="../../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445">fast_power_recursive</a>(a, -b);</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordflow">if</span> (b == 0)</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        <span class="keywordflow">return</span> 1;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    T bottom = <a class="code hl_function" href="../../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445">fast_power_recursive</a>(a, b &gt;&gt; 1);</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="comment">// Since it is integer division b/2 = (b-1)/2 where b is odd.</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="comment">// Therefore, case2 is easily solved by integer division.</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordtype">double</span> result;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">if</span> ((b &amp; 1) == 0)  <span class="comment">// case1</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        result = bottom * bottom;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">else</span>  <span class="comment">// case2</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        result = bottom * bottom * a;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>}</div>
+</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00050" data-start="{" data-end="}">
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"><a class="line" href="../../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d">   50</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d">fast_power_linear</a>(T a, T b) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="comment">// negative power. a^b = 1 / (a^-b)</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">if</span> (b &lt; 0)</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        <span class="keywordflow">return</span> 1.0 / <a class="code hl_function" href="../../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d">fast_power_linear</a>(a, -b);</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordtype">double</span> result = 1;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">while</span> (b) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        <span class="keywordflow">if</span> (b &amp; 1)</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>            result = result * a;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        a = a * a;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        b = b &gt;&gt; 1;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    }</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>}</div>
+</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="foldopen" id="foldopen00068" data-start="{" data-end="}">
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"><a class="line" href="../../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   68</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    std::ios_base::sync_with_stdio(<span class="keyword">false</span>);</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 20; i++) {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        <span class="keywordtype">int</span> a = std::rand() % 20 - 10;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        <span class="keywordtype">int</span> b = std::rand() % 20 - 10;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        std::cout &lt;&lt; std::endl &lt;&lt; <span class="stringliteral">&quot;Calculating &quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;^&quot;</span> &lt;&lt; b &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        assert(<a class="code hl_function" href="../../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445">fast_power_recursive</a>(a, b) == std::pow(a, b));</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        assert(<a class="code hl_function" href="../../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d">fast_power_linear</a>(a, b) == std::pow(a, b));</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;------ &quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;^&quot;</span> &lt;&lt; b &lt;&lt; <span class="stringliteral">&quot; = &quot;</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>                  &lt;&lt; <a class="code hl_function" href="../../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445">fast_power_recursive</a>(a, b) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    }</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    int64_t a, b;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::cin &gt;&gt; a &gt;&gt; b;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    std::cout &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;^&quot;</span> &lt;&lt; b &lt;&lt; <span class="stringliteral">&quot; = &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445">fast_power_recursive</a>(a, b)</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    std::cout &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;^&quot;</span> &lt;&lt; b &lt;&lt; <span class="stringliteral">&quot; = &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d">fast_power_linear</a>(a, b) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>}</div>
+</div>
+<div class="ttc" id="afast__power_8cpp_html_a0d4e3f0099a6975b74a314a35bd0f94d"><div class="ttname"><a href="../../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d">fast_power_linear</a></div><div class="ttdeci">double fast_power_linear(T a, T b)</div><div class="ttdef"><b>Definition</b> <a href="#l00050">fast_power.cpp:50</a></div></div>
+<div class="ttc" id="afast__power_8cpp_html_a8399b847626e5bba983cab7c7918b445"><div class="ttname"><a href="../../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445">fast_power_recursive</a></div><div class="ttdeci">double fast_power_recursive(T a, T b)</div><div class="ttdef"><b>Definition</b> <a href="#l00026">fast_power.cpp:26</a></div></div>
+<div class="ttc" id="afast__power_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00068">fast_power.cpp:68</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d2/d0b/fast__power_8cpp.html">fast_power.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d2/d21/gnome__sort_8cpp.html b/d2/d21/gnome__sort_8cpp.html
index e0dc553e6..5932ba00c 100644
--- a/d2/d21/gnome__sort_8cpp.html
+++ b/d2/d21/gnome__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/gnome_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/gnome_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for gnome_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d4e/gnome__sort_8cpp__incl.svg" width="344" height="111"><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">
+</div>
+<p><a href="../../d2/d21/gnome__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -135,7 +154,7 @@ Functions</h2></td></tr>
 <tr class="memitem:a2f8bc626eb57acae24a94636a23af6a1"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">sorting::gnomeSort</a> (T *arr, int size)</td></tr>
 <tr class="separator:a2f8bc626eb57acae24a94636a23af6a1"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa3677f87b5b4756bc77e9e34c5f27935" id="r_aa3677f87b5b4756bc77e9e34c5f27935"><td class="memTemplParams" colspan="2">template&lt;typename T , size_t size&gt; </td></tr>
-<tr class="memitem:aa3677f87b5b4756bc77e9e34c5f27935"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, size &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935">sorting::gnomeSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, size &gt; arr)</td></tr>
+<tr class="memitem:aa3677f87b5b4756bc77e9e34c5f27935"><td class="memTemplItemLeft" align="right" valign="top">std::array&lt; T, size &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935">sorting::gnomeSort</a> (std::array&lt; T, size &gt; arr)</td></tr>
 <tr class="separator:aa3677f87b5b4756bc77e9e34c5f27935"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
 <tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -149,6 +168,8 @@ Functions</h2></td></tr>
 <a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a></dd></dl>
 <p>Gnome sort algorithm is not the best one but it is widely used. The algorithm iteratively checks the order of pairs in the array. If they are on right order it moves to the next successive pair, otherwise it swaps elements. This operation is repeated until no more swaps are made thus indicating the values to be in ascending order.</p>
 <p>The time Complexity of the algorithm is \(O(n^2)\) and in some cases it can be \(O(n)\). </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d2/d21/gnome__sort_8cpp_source.html">gnome_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -165,17 +186,14 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Our main function with example of sort method. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d21/gnome__sort_8cpp_source.html#l00130">130</a> of file <a class="el" href="../../d2/d21/gnome__sort_8cpp_source.html">gnome_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  130</span>           {</div>
 <div class="line"><span class="lineno">  131</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
 <div class="line"><span class="lineno">  132</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  133</span>}</div>
-<div class="ttc" id="agnome__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> gnome_sort.cpp:85</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="458" height="332"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agnome__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d21/gnome__sort_8cpp_source.html#l00085">gnome_sort.cpp:85</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -201,62 +219,51 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Test function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d21/gnome__sort_8cpp_source.html#l00085">85</a> of file <a class="el" href="../../d2/d21/gnome__sort_8cpp_source.html">gnome_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   85</span>                   {</div>
 <div class="line"><span class="lineno">   86</span>    <span class="comment">// Example 1. Creating array of int,</span></div>
-<div class="line"><span class="lineno">   87</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 - as a C-array...&quot;</span>;</div>
+<div class="line"><span class="lineno">   87</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 - as a C-array...&quot;</span>;</div>
 <div class="line"><span class="lineno">   88</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> size = 6;</div>
-<div class="line"><span class="lineno">   89</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, size&gt;</a> arr = {-22, 100, 150, 35, -10, 99};</div>
-<div class="line"><span class="lineno">   90</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">sorting::gnomeSort</a>(arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/data.html">data</a>(),</div>
+<div class="line"><span class="lineno">   89</span>    std::array&lt;int, size&gt; arr = {-22, 100, 150, 35, -10, 99};</div>
+<div class="line"><span class="lineno">   90</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">sorting::gnomeSort</a>(arr.data(),</div>
 <div class="line"><span class="lineno">   91</span>                       size);  <span class="comment">// pass array data as a C-style array pointer</span></div>
-<div class="line"><span class="lineno">   92</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr)));</div>
-<div class="line"><span class="lineno">   93</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; Passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   92</span>    assert(std::is_sorted(std::begin(arr), std::end(arr)));</div>
+<div class="line"><span class="lineno">   93</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; Passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   94</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
-<div class="line"><span class="lineno">   95</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><span class="lineno">   95</span>        std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
 <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/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   97</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   98</span> </div>
 <div class="line"><span class="lineno">   99</span>    <span class="comment">// Example 2. Creating array of doubles.</span></div>
-<div class="line"><span class="lineno">  100</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest 2 - as a std::array...&quot;</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/array.html">std::array&lt;double, size&gt;</a> double_arr = {-100.2, 10.2, 20.0, 9.0, 7.5, 7.2};</div>
-<div class="line"><span class="lineno">  102</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, size&gt;</a> sorted_arr = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">sorting::gnomeSort</a>(double_arr);</div>
-<div class="line"><span class="lineno">  103</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(sorted_arr), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(sorted_arr)));</div>
-<div class="line"><span class="lineno">  104</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; Passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  100</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest 2 - as a std::array...&quot;</span>;</div>
+<div class="line"><span class="lineno">  101</span>    std::array&lt;double, size&gt; double_arr = {-100.2, 10.2, 20.0, 9.0, 7.5, 7.2};</div>
+<div class="line"><span class="lineno">  102</span>    std::array&lt;double, size&gt; sorted_arr = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">sorting::gnomeSort</a>(double_arr);</div>
+<div class="line"><span class="lineno">  103</span>    assert(std::is_sorted(std::begin(sorted_arr), std::end(sorted_arr)));</div>
+<div class="line"><span class="lineno">  104</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; Passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  105</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
-<div class="line"><span class="lineno">  106</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; double_arr[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><span class="lineno">  106</span>        std::cout &lt;&lt; double_arr[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</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> &lt;&lt; <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">  108</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  109</span> </div>
 <div class="line"><span class="lineno">  110</span>    <span class="comment">// Example 3. Creating random array of float.</span></div>
-<div class="line"><span class="lineno">  111</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest 3 - 200 random numbers as a std::array...&quot;</span>;</div>
+<div class="line"><span class="lineno">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest 3 - 200 random numbers as a std::array...&quot;</span>;</div>
 <div class="line"><span class="lineno">  112</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> size2 = 200;</div>
-<div class="line"><span class="lineno">  113</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;float, size2&gt;</a> rand_arr{};</div>
+<div class="line"><span class="lineno">  113</span>    std::array&lt;float, size2&gt; rand_arr{};</div>
 <div class="line"><span class="lineno">  114</span> </div>
 <div class="line"><span class="lineno">  115</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;a : rand_arr) {</div>
 <div class="line"><span class="lineno">  116</span>        <span class="comment">// generate random numbers between -5.0 and 4.99</span></div>
-<div class="line"><span class="lineno">  117</span>        a = float(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 1000 - 500) / 100.f;</div>
+<div class="line"><span class="lineno">  117</span>        a = float(std::rand() % 1000 - 500) / 100.f;</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>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;float, size2&gt;</a> float_arr = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">sorting::gnomeSort</a>(rand_arr);</div>
-<div class="line"><span class="lineno">  121</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(float_arr), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(float_arr)));</div>
-<div class="line"><span class="lineno">  122</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; Passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  120</span>    std::array&lt;float, size2&gt; float_arr = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">sorting::gnomeSort</a>(rand_arr);</div>
+<div class="line"><span class="lineno">  121</span>    assert(std::is_sorted(std::begin(float_arr), std::end(float_arr)));</div>
+<div class="line"><span class="lineno">  122</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; Passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  123</span>    <span class="comment">// for (int i = 0; i &lt; size; i++) std::cout &lt;&lt; double_arr[i] &lt;&lt; &quot;, &quot;;</span></div>
-<div class="line"><span class="lineno">  124</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  124</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  125</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="adata_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/data.html">std::array::data</a></div><div class="ttdeci">T data(T... args)</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="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="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-<div class="ttc" id="anamespacesorting_html_a2f8bc626eb57acae24a94636a23af6a1"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">sorting::gnomeSort</a></div><div class="ttdeci">void gnomeSort(T *arr, int size)</div><div class="ttdef"><b>Definition</b> gnome_sort.cpp:34</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-</div><!-- 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="../../d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="360" height="332"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacesorting_html_a2f8bc626eb57acae24a94636a23af6a1"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">sorting::gnomeSort</a></div><div class="ttdeci">void gnomeSort(T *arr, int size)</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d21/gnome__sort_8cpp_source.html#l00034">gnome_sort.cpp:34</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 2f96c380a..000000000
--- a/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,153,49,179"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="123,5,202,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="30,152,52,99,70,67,95,40,108,31,111,36,98,44,75,71,56,101,35,154"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/data.html#" title=" " alt="" coords="108,55,217,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="35,151,60,120,95,89,102,85,105,90,98,94,64,124,40,154"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="128,104,196,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="48,156,113,132,114,137,50,161"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="127,153,198,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="49,164,111,164,111,169,49,169"/>
-<area shape="rect" id="Node000006" href="$d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1" title=" " alt="" coords="97,203,228,228"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="50,171,112,194,110,199,48,176"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="112,252,212,278"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="40,178,64,208,98,239,105,243,102,247,95,243,60,212,35,181"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="126,301,198,327"/>
-<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="35,178,56,231,75,262,98,288,113,298,110,302,95,292,70,265,52,234,30,180"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="276,203,354,228"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="229,213,261,213,261,218,229,218"/>
-</map>
diff --git a/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 6457831ad..000000000
--- a/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-04546fe8ef19ee7f962434454cb45908
\ No newline at end of file
diff --git a/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 00eb68e3b..000000000
--- a/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,191 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="270pt" height="249pt"
- viewBox="0.00 0.00 269.75 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-130.25 0,-130.25 0,-111 32.5,-111 32.5,-130.25"/>
-<text text-anchor="middle" x="16.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="147.12,-241.25 88.38,-241.25 88.38,-222 147.12,-222 147.12,-241.25"/>
-<text text-anchor="middle" x="117.75" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.14,-130.53C26.11,-149.32 41.57,-190.38 68.5,-213.62 71.31,-216.05 74.47,-218.16 77.81,-220"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.2,-223.11 86.75,-224.09 79.11,-216.74 76.2,-223.11"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/data.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158.75,-204.25 76.75,-204.25 76.75,-185 158.75,-185 158.75,-204.25"/>
-<text text-anchor="middle" x="117.75" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.11,-130.66C33.03,-143.03 49.71,-163.95 68.5,-176.62 70.05,-177.67 71.68,-178.67 73.35,-179.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.41,-182.56 81.93,-183.84 74.5,-176.28 71.41,-182.56"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.38,-167.25 92.12,-167.25 92.12,-148 143.38,-148 143.38,-167.25"/>
-<text text-anchor="middle" x="117.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.8,-126.41C45.71,-131.21 64.58,-138.23 81.16,-144.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.63,-147.56 90.22,-147.76 82.07,-140.99 79.63,-147.56"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="144.5,-130.25 91,-130.25 91,-111 144.5,-111 144.5,-130.25"/>
-<text text-anchor="middle" x="117.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.8,-120.62C45.29,-120.62 63.35,-120.62 79.53,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.35,-124.13 89.35,-120.63 79.35,-117.13 79.35,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="167,-93.25 68.5,-93.25 68.5,-74 167,-74 167,-93.25"/>
-<text text-anchor="middle" x="117.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::gnomeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.8,-114.84C45.14,-110.25 62.93,-103.64 78.96,-97.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.12,-100.98 88.27,-94.21 77.68,-94.42 80.12,-100.98"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.38,-56.25 80.12,-56.25 80.12,-37 155.38,-37 155.38,-56.25"/>
-<text text-anchor="middle" x="117.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.11,-110.59C33.03,-98.22 49.71,-77.3 68.5,-64.62 70.05,-63.58 71.68,-62.58 73.35,-61.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.5,-64.97 81.93,-57.41 71.41,-58.69 74.5,-64.97"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="144.88,-19.25 90.62,-19.25 90.62,0 144.88,0 144.88,-19.25"/>
-<text text-anchor="middle" x="117.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.14,-110.72C26.11,-91.93 41.57,-50.87 68.5,-27.62 71.87,-24.72 75.75,-22.26 79.82,-20.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.91,-23.53 88.74,-16.39 78.17,-17.09 80.91,-23.53"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="261.75,-93.25 203,-93.25 203,-74 261.75,-74 261.75,-93.25"/>
-<text text-anchor="middle" x="232.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.49,-83.62C175.47,-83.62 183.65,-83.62 191.38,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.17,-87.13 201.17,-83.63 191.17,-80.13 191.17,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 83ccfe2ca..000000000
--- a/d2/d21/gnome__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,165 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="270pt" height="249pt"
- viewBox="0.00 0.00 269.75 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-130.25 0,-130.25 0,-111 32.5,-111 32.5,-130.25"/>
-<text text-anchor="middle" x="16.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="147.12,-241.25 88.38,-241.25 88.38,-222 147.12,-222 147.12,-241.25"/>
-<text text-anchor="middle" x="117.75" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.14,-130.53C26.11,-149.32 41.57,-190.38 68.5,-213.62 71.31,-216.05 74.47,-218.16 77.81,-220"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.2,-223.11 86.75,-224.09 79.11,-216.74 76.2,-223.11"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/data.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158.75,-204.25 76.75,-204.25 76.75,-185 158.75,-185 158.75,-204.25"/>
-<text text-anchor="middle" x="117.75" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.11,-130.66C33.03,-143.03 49.71,-163.95 68.5,-176.62 70.05,-177.67 71.68,-178.67 73.35,-179.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.41,-182.56 81.93,-183.84 74.5,-176.28 71.41,-182.56"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.38,-167.25 92.12,-167.25 92.12,-148 143.38,-148 143.38,-167.25"/>
-<text text-anchor="middle" x="117.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.8,-126.41C45.71,-131.21 64.58,-138.23 81.16,-144.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.63,-147.56 90.22,-147.76 82.07,-140.99 79.63,-147.56"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="144.5,-130.25 91,-130.25 91,-111 144.5,-111 144.5,-130.25"/>
-<text text-anchor="middle" x="117.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.8,-120.62C45.29,-120.62 63.35,-120.62 79.53,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.35,-124.13 89.35,-120.63 79.35,-117.13 79.35,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="167,-93.25 68.5,-93.25 68.5,-74 167,-74 167,-93.25"/>
-<text text-anchor="middle" x="117.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::gnomeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.8,-114.84C45.14,-110.25 62.93,-103.64 78.96,-97.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.12,-100.98 88.27,-94.21 77.68,-94.42 80.12,-100.98"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.38,-56.25 80.12,-56.25 80.12,-37 155.38,-37 155.38,-56.25"/>
-<text text-anchor="middle" x="117.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.11,-110.59C33.03,-98.22 49.71,-77.3 68.5,-64.62 70.05,-63.58 71.68,-62.58 73.35,-61.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.5,-64.97 81.93,-57.41 71.41,-58.69 74.5,-64.97"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="144.88,-19.25 90.62,-19.25 90.62,0 144.88,0 144.88,-19.25"/>
-<text text-anchor="middle" x="117.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.14,-110.72C26.11,-91.93 41.57,-50.87 68.5,-27.62 71.87,-24.72 75.75,-22.26 79.82,-20.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.91,-23.53 88.74,-16.39 78.17,-17.09 80.91,-23.53"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="261.75,-93.25 203,-93.25 203,-74 261.75,-74 261.75,-93.25"/>
-<text text-anchor="middle" x="232.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.49,-83.62C175.47,-83.62 183.65,-83.62 191.38,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.17,-87.13 201.17,-83.63 191.17,-80.13 191.17,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 46dca776e..000000000
--- a/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,153,55,179"/>
-<area shape="rect" id="Node000002" href="$d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title=" " alt="" coords="103,153,146,179"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,164,87,164,87,169,55,169"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="220,5,299,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="127,152,149,99,168,67,192,40,205,31,208,36,196,44,172,71,154,101,132,154"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/data.html#" title=" " alt="" coords="205,55,314,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="133,151,158,120,192,89,199,85,202,90,196,94,161,124,137,154"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="226,104,294,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="145,156,210,132,212,137,147,161"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="224,153,295,179"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="146,164,209,164,209,169,146,169"/>
-<area shape="rect" id="Node000007" href="$d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1" title=" " alt="" coords="194,203,325,228"/>
-<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="147,171,209,194,207,199,145,176"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="210,252,310,278"/>
-<area shape="poly" id="edge8_Node000002_Node000009" title=" " alt="" coords="137,178,161,208,196,239,202,243,199,247,192,243,158,212,133,181"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="224,301,296,327"/>
-<area shape="poly" id="edge9_Node000002_Node000010" title=" " alt="" coords="132,178,154,231,172,262,196,288,211,298,208,302,192,292,168,265,149,234,127,180"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="373,203,452,228"/>
-<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="326,213,358,213,358,218,326,218"/>
-</map>
diff --git a/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 33c454926..000000000
--- a/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-45f942402a5af3ab2f81ab1bd6bb064f
\ No newline at end of file
diff --git a/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index d6af6055f..000000000
--- a/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,209 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="343pt" height="249pt"
- viewBox="0.00 0.00 342.75 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-130.25 0,-130.25 0,-111 37,-111 37,-130.25"/>
-<text text-anchor="middle" x="18.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-130.25 73,-130.25 73,-111 105.5,-111 105.5,-130.25"/>
-<text text-anchor="middle" x="89.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-120.62C44.58,-120.62 53.31,-120.62 61.45,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-124.13 71.2,-120.63 61.2,-117.13 61.2,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.12,-241.25 161.38,-241.25 161.38,-222 220.12,-222 220.12,-241.25"/>
-<text text-anchor="middle" x="190.75" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.14,-130.53C99.11,-149.32 114.57,-190.38 141.5,-213.62 144.31,-216.05 147.47,-218.16 150.81,-220"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.2,-223.11 159.75,-224.09 152.11,-216.74 149.2,-223.11"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/data.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.75,-204.25 149.75,-204.25 149.75,-185 231.75,-185 231.75,-204.25"/>
-<text text-anchor="middle" x="190.75" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::data</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.11,-130.66C106.03,-143.03 122.71,-163.95 141.5,-176.62 143.05,-177.67 144.68,-178.67 146.35,-179.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.41,-182.56 154.93,-183.84 147.5,-176.28 144.41,-182.56"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.38,-167.25 165.12,-167.25 165.12,-148 216.38,-148 216.38,-167.25"/>
-<text text-anchor="middle" x="190.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.8,-126.41C118.71,-131.21 137.58,-138.23 154.16,-144.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.63,-147.56 163.22,-147.76 155.07,-140.99 152.63,-147.56"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="217.5,-130.25 164,-130.25 164,-111 217.5,-111 217.5,-130.25"/>
-<text text-anchor="middle" x="190.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.8,-120.62C118.29,-120.62 136.35,-120.62 152.53,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.35,-124.13 162.35,-120.63 152.35,-117.13 152.35,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="240,-93.25 141.5,-93.25 141.5,-74 240,-74 240,-93.25"/>
-<text text-anchor="middle" x="190.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::gnomeSort</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.8,-114.84C118.14,-110.25 135.93,-103.64 151.96,-97.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.12,-100.98 161.27,-94.21 150.68,-94.42 153.12,-100.98"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.38,-56.25 153.12,-56.25 153.12,-37 228.38,-37 228.38,-56.25"/>
-<text text-anchor="middle" x="190.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.11,-110.59C106.03,-98.22 122.71,-77.3 141.5,-64.62 143.05,-63.58 144.68,-62.58 146.35,-61.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.5,-64.97 154.93,-57.41 144.41,-58.69 147.5,-64.97"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="217.88,-19.25 163.62,-19.25 163.62,0 217.88,0 217.88,-19.25"/>
-<text text-anchor="middle" x="190.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge9_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.14,-110.72C99.11,-91.93 114.57,-50.87 141.5,-27.62 144.87,-24.72 148.75,-22.26 152.82,-20.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.91,-23.53 161.74,-16.39 151.17,-17.09 153.91,-23.53"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="334.75,-93.25 276,-93.25 276,-74 334.75,-74 334.75,-93.25"/>
-<text text-anchor="middle" x="305.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M240.49,-83.62C248.47,-83.62 256.65,-83.62 264.38,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="264.17,-87.13 274.17,-83.63 264.17,-80.13 264.17,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index b77cb971e..000000000
--- a/d2/d21/gnome__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,183 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="343pt" height="249pt"
- viewBox="0.00 0.00 342.75 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-130.25 0,-130.25 0,-111 37,-111 37,-130.25"/>
-<text text-anchor="middle" x="18.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-130.25 73,-130.25 73,-111 105.5,-111 105.5,-130.25"/>
-<text text-anchor="middle" x="89.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-120.62C44.58,-120.62 53.31,-120.62 61.45,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-124.13 71.2,-120.63 61.2,-117.13 61.2,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.12,-241.25 161.38,-241.25 161.38,-222 220.12,-222 220.12,-241.25"/>
-<text text-anchor="middle" x="190.75" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.14,-130.53C99.11,-149.32 114.57,-190.38 141.5,-213.62 144.31,-216.05 147.47,-218.16 150.81,-220"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.2,-223.11 159.75,-224.09 152.11,-216.74 149.2,-223.11"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/data.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.75,-204.25 149.75,-204.25 149.75,-185 231.75,-185 231.75,-204.25"/>
-<text text-anchor="middle" x="190.75" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::data</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.11,-130.66C106.03,-143.03 122.71,-163.95 141.5,-176.62 143.05,-177.67 144.68,-178.67 146.35,-179.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.41,-182.56 154.93,-183.84 147.5,-176.28 144.41,-182.56"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.38,-167.25 165.12,-167.25 165.12,-148 216.38,-148 216.38,-167.25"/>
-<text text-anchor="middle" x="190.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.8,-126.41C118.71,-131.21 137.58,-138.23 154.16,-144.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.63,-147.56 163.22,-147.76 155.07,-140.99 152.63,-147.56"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="217.5,-130.25 164,-130.25 164,-111 217.5,-111 217.5,-130.25"/>
-<text text-anchor="middle" x="190.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.8,-120.62C118.29,-120.62 136.35,-120.62 152.53,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.35,-124.13 162.35,-120.63 152.35,-117.13 152.35,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="240,-93.25 141.5,-93.25 141.5,-74 240,-74 240,-93.25"/>
-<text text-anchor="middle" x="190.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::gnomeSort</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.8,-114.84C118.14,-110.25 135.93,-103.64 151.96,-97.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.12,-100.98 161.27,-94.21 150.68,-94.42 153.12,-100.98"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.38,-56.25 153.12,-56.25 153.12,-37 228.38,-37 228.38,-56.25"/>
-<text text-anchor="middle" x="190.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.11,-110.59C106.03,-98.22 122.71,-77.3 141.5,-64.62 143.05,-63.58 144.68,-62.58 146.35,-61.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.5,-64.97 154.93,-57.41 144.41,-58.69 147.5,-64.97"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="217.88,-19.25 163.62,-19.25 163.62,0 217.88,0 217.88,-19.25"/>
-<text text-anchor="middle" x="190.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge9_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.14,-110.72C99.11,-91.93 114.57,-50.87 141.5,-27.62 144.87,-24.72 148.75,-22.26 152.82,-20.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.91,-23.53 161.74,-16.39 151.17,-17.09 153.91,-23.53"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="334.75,-93.25 276,-93.25 276,-74 334.75,-74 334.75,-93.25"/>
-<text text-anchor="middle" x="305.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M240.49,-83.62C248.47,-83.62 256.65,-83.62 264.38,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="264.17,-87.13 274.17,-83.63 264.17,-80.13 264.17,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d21/gnome__sort_8cpp_source.html b/d2/d21/gnome__sort_8cpp_source.html
new file mode 100644
index 000000000..3c3b23b37
--- /dev/null
+++ b/d2/d21/gnome__sort_8cpp_source.html
@@ -0,0 +1,242 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/gnome_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d2/d21/gnome__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">gnome_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d2/d21/gnome__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  <span class="comment">// for std::swap</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;array&gt;</span>      <span class="comment">// for std::array</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cassert&gt;</span>    <span class="comment">// for assertions</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;iostream&gt;</span>   <span class="comment">// for io operations</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00034" data-start="{" data-end="}">
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">   34</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">gnomeSort</a>(T *arr, <span class="keywordtype">int</span> size) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="comment">// few easy cases</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">if</span> (size &lt;= 1) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    }</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordtype">int</span> index = 0;  <span class="comment">// initialize some variables.</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">while</span> (index &lt; size) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        <span class="comment">// check for swap</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="keywordflow">if</span> ((index == 0) || (arr[index] &gt;= arr[index - 1])) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>            index++;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            std::swap(arr[index], arr[index - 1]);  <span class="comment">// swap</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            index--;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>}</div>
+</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keywordtype">size_t</span> size&gt;</div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935">   62</a></span>std::array&lt;T, size&gt; <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">gnomeSort</a>(std::array&lt;T, size&gt; arr) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="comment">// few easy cases</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="keywordflow">if</span> (size &lt;= 1) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <span class="keywordflow">return</span> arr;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keywordtype">int</span> index = 0;  <span class="comment">// initialize loop index</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordflow">while</span> (index &lt; size) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        <span class="comment">// check for swap</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        <span class="keywordflow">if</span> ((index == 0) || (arr[index] &gt;= arr[index - 1])) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            index++;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            std::swap(arr[index], arr[index - 1]);  <span class="comment">// swap</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            index--;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        }</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordflow">return</span> arr;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>}</div>
+</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="foldopen" id="foldopen00085" data-start="{" data-end="}">
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"><a class="line" href="../../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   85</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="comment">// Example 1. Creating array of int,</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 - as a C-array...&quot;</span>;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> size = 6;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::array&lt;int, size&gt; arr = {-22, 100, 150, 35, -10, 99};</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">sorting::gnomeSort</a>(arr.data(),</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>                       size);  <span class="comment">// pass array data as a C-style array pointer</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    assert(std::is_sorted(std::begin(arr), std::end(arr)));</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; Passed\n&quot;</span>;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span> </div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="comment">// Example 2. Creating array of doubles.</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest 2 - as a std::array...&quot;</span>;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    std::array&lt;double, size&gt; double_arr = {-100.2, 10.2, 20.0, 9.0, 7.5, 7.2};</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    std::array&lt;double, size&gt; sorted_arr = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">sorting::gnomeSort</a>(double_arr);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    assert(std::is_sorted(std::begin(sorted_arr), std::end(sorted_arr)));</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; Passed\n&quot;</span>;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        std::cout &lt;&lt; double_arr[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    }</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="comment">// Example 3. Creating random array of float.</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest 3 - 200 random numbers as a std::array...&quot;</span>;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> size2 = 200;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    std::array&lt;float, size2&gt; rand_arr{};</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;a : rand_arr) {</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        <span class="comment">// generate random numbers between -5.0 and 4.99</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        a = float(std::rand() % 1000 - 500) / 100.f;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    }</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    std::array&lt;float, size2&gt; float_arr = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">sorting::gnomeSort</a>(rand_arr);</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    assert(std::is_sorted(std::begin(float_arr), std::end(float_arr)));</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; Passed\n&quot;</span>;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    <span class="comment">// for (int i = 0; i &lt; size; i++) std::cout &lt;&lt; double_arr[i] &lt;&lt; &quot;, &quot;;</span></div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>}</div>
+</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
+<div class="foldopen" id="foldopen00130" data-start="{" data-end="}">
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"><a class="line" href="../../d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  130</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <a class="code hl_function" href="../../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>}</div>
+</div>
+<div class="ttc" id="agnome__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00085">gnome_sort.cpp:85</a></div></div>
+<div class="ttc" id="agnome__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00130">gnome_sort.cpp:130</a></div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+<div class="ttc" id="anamespacesorting_html_a2f8bc626eb57acae24a94636a23af6a1"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">sorting::gnomeSort</a></div><div class="ttdeci">void gnomeSort(T *arr, int size)</div><div class="ttdef"><b>Definition</b> <a href="#l00034">gnome_sort.cpp:34</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d2/d21/gnome__sort_8cpp.html">gnome_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d2/d22/jump__search_8cpp.html b/d2/d22/jump__search_8cpp.html
index 647b26358..e3223a686 100644
--- a/d2/d22/jump__search_8cpp.html
+++ b/d2/d22/jump__search_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: search/jump_search.cpp File Reference</title>
+<title>TheAlgorithms/C++: search/jump_search.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for jump_search.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/dbd/jump__search_8cpp__incl.svg" width="262" height="111"><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">
+</div>
+<p><a href="../../d2/d22/jump__search_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ab49fd8f401bfc71f63b74711390cccf0" id="r_ab49fd8f401bfc71f63b74711390cccf0"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab49fd8f401bfc71f63b74711390cccf0">jumpSearch</a> (int arr[], int x, int n)</td></tr>
@@ -130,6 +149,8 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>C++ program to implement <a href="https://en.wikipedia.org/wiki/Jump_search" target="_blank">Jump Search</a> </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d2/d22/jump__search_8cpp_source.html">jump_search.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ab49fd8f401bfc71f63b74711390cccf0" name="ab49fd8f401bfc71f63b74711390cccf0"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ab49fd8f401bfc71f63b74711390cccf0">&#9670;&#160;</a></span>jumpSearch()</h2>
@@ -155,16 +176,18 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>jump search implementation </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d22/jump__search_8cpp_source.html#l00012">12</a> of file <a class="el" href="../../d2/d22/jump__search_8cpp_source.html">jump_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   12</span>                                        {</div>
 <div class="line"><span class="lineno">   13</span>    <span class="comment">// Finding block size to be jumped</span></div>
-<div class="line"><span class="lineno">   14</span>    <span class="keywordtype">int</span> step = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(n);</div>
+<div class="line"><span class="lineno">   14</span>    <span class="keywordtype">int</span> step = std::sqrt(n);</div>
 <div class="line"><span class="lineno">   15</span> </div>
 <div class="line"><span class="lineno">   16</span>    <span class="comment">// Finding the block where element is</span></div>
 <div class="line"><span class="lineno">   17</span>    <span class="comment">// present (if it is present)</span></div>
-<div class="line"><span class="lineno">   18</span>    <span class="keywordtype">int</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a> = 0;</div>
-<div class="line"><span class="lineno">   19</span>    <span class="keywordflow">while</span> (arr[<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(step, n) - 1] &lt; x) {</div>
-<div class="line"><span class="lineno">   20</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a> = step;</div>
-<div class="line"><span class="lineno">   21</span>        step += <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(n);</div>
+<div class="line"><span class="lineno">   18</span>    <span class="keywordtype">int</span> prev = 0;</div>
+<div class="line"><span class="lineno">   19</span>    <span class="keywordflow">while</span> (arr[std::min(step, n) - 1] &lt; x) {</div>
+<div class="line"><span class="lineno">   20</span>        prev = step;</div>
+<div class="line"><span class="lineno">   21</span>        step += std::sqrt(n);</div>
 <div class="line"><span class="lineno">   22</span>        <span class="keywordflow">if</span> (prev &gt;= n)</div>
 <div class="line"><span class="lineno">   23</span>            <span class="keywordflow">return</span> -1;</div>
 <div class="line"><span class="lineno">   24</span>    }</div>
@@ -172,28 +195,20 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   26</span>    <span class="comment">// Doing a linear search for x in block</span></div>
 <div class="line"><span class="lineno">   27</span>    <span class="comment">// beginning with prev.</span></div>
 <div class="line"><span class="lineno">   28</span>    <span class="keywordflow">while</span> (arr[prev] &lt; x) {</div>
-<div class="line"><span class="lineno">   29</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a>++;</div>
+<div class="line"><span class="lineno">   29</span>        prev++;</div>
 <div class="line"><span class="lineno">   30</span> </div>
 <div class="line"><span class="lineno">   31</span>        <span class="comment">// If we reached next block or end of</span></div>
 <div class="line"><span class="lineno">   32</span>        <span class="comment">// array, element is not present.</span></div>
-<div class="line"><span class="lineno">   33</span>        <span class="keywordflow">if</span> (prev == <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(step, n))</div>
+<div class="line"><span class="lineno">   33</span>        <span class="keywordflow">if</span> (prev == std::min(step, n))</div>
 <div class="line"><span class="lineno">   34</span>            <span class="keywordflow">return</span> -1;</div>
 <div class="line"><span class="lineno">   35</span>    }</div>
 <div class="line"><span class="lineno">   36</span>    <span class="comment">// If element is found</span></div>
 <div class="line"><span class="lineno">   37</span>    <span class="keywordflow">if</span> (arr[prev] == x)</div>
-<div class="line"><span class="lineno">   38</span>        <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a>;</div>
+<div class="line"><span class="lineno">   38</span>        <span class="keywordflow">return</span> prev;</div>
 <div class="line"><span class="lineno">   39</span> </div>
 <div class="line"><span class="lineno">   40</span>    <span class="keywordflow">return</span> -1;</div>
 <div class="line"><span class="lineno">   41</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="aprev_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/prev.html">std::prev</a></div><div class="ttdeci">T prev(T... args)</div></div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.svg" width="219" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -210,6 +225,8 @@ Here is the call graph for this function:</div>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d22/jump__search_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../d2/d22/jump__search_8cpp_source.html">jump_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   44</span>           {</div>
 <div class="line"><span class="lineno">   45</span>    <span class="keywordtype">int</span> arr[] = {0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610};</div>
 <div class="line"><span class="lineno">   46</span>    <span class="keywordtype">int</span> x = 55;</div>
@@ -219,11 +236,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   50</span>    <span class="keywordtype">int</span> index = <a class="code hl_function" href="#ab49fd8f401bfc71f63b74711390cccf0">jumpSearch</a>(arr, x, n);</div>
 <div class="line"><span class="lineno">   51</span> </div>
 <div class="line"><span class="lineno">   52</span>    <span class="comment">// Print the index where &#39;x&#39; is located</span></div>
-<div class="line"><span class="lineno">   53</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nNumber &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; is at index &quot;</span> &lt;&lt; index;</div>
+<div class="line"><span class="lineno">   53</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nNumber &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; is at index &quot;</span> &lt;&lt; index;</div>
 <div class="line"><span class="lineno">   54</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   55</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="ajump__search_8cpp_html_ab49fd8f401bfc71f63b74711390cccf0"><div class="ttname"><a href="#ab49fd8f401bfc71f63b74711390cccf0">jumpSearch</a></div><div class="ttdeci">int jumpSearch(int arr[], int x, int n)</div><div class="ttdef"><b>Definition</b> jump_search.cpp:12</div></div>
+<div class="ttc" id="ajump__search_8cpp_html_ab49fd8f401bfc71f63b74711390cccf0"><div class="ttname"><a href="#ab49fd8f401bfc71f63b74711390cccf0">jumpSearch</a></div><div class="ttdeci">int jumpSearch(int arr[], int x, int n)</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d22/jump__search_8cpp_source.html#l00012">jump_search.cpp:12</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.map b/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.map
deleted file mode 100644
index 5f894688a..000000000
--- a/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="jumpSearch" name="jumpSearch">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,96,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="144,5,212,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="96,32,128,25,129,31,97,37"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="144,55,213,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="97,49,129,56,128,61,96,55"/>
-</map>
diff --git a/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.md5 b/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.md5
deleted file mode 100644
index 4fb63b8fe..000000000
--- a/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-23006dd13c477678e1ba31963390a7fa
\ No newline at end of file
diff --git a/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.svg b/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.svg
deleted file mode 100644
index 8cfe89966..000000000
--- a/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: jumpSearch Pages: 1 -->
-<svg width="164pt" height="64pt"
- viewBox="0.00 0.00 163.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>jumpSearch</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="67.75,-37.25 0,-37.25 0,-18 67.75,-18 67.75,-37.25"/>
-<text text-anchor="middle" x="33.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">jumpSearch</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.38,-56.25 104.12,-56.25 104.12,-37 155.38,-37 155.38,-56.25"/>
-<text text-anchor="middle" x="129.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M68.24,-34.38C76.1,-35.97 84.51,-37.67 92.49,-39.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.78,-42.71 102.28,-41.27 93.17,-35.85 91.78,-42.71"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.75,-19.25 103.75,-19.25 103.75,0 155.75,0 155.75,-19.25"/>
-<text text-anchor="middle" x="129.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M68.24,-21.23C76.03,-19.73 84.36,-18.14 92.28,-16.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.82,-20.08 101.98,-14.76 91.5,-13.2 92.82,-20.08"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph_org.svg b/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph_org.svg
deleted file mode 100644
index 047f3ac1a..000000000
--- a/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: jumpSearch Pages: 1 -->
-<svg width="164pt" height="64pt"
- viewBox="0.00 0.00 163.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>jumpSearch</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="67.75,-37.25 0,-37.25 0,-18 67.75,-18 67.75,-37.25"/>
-<text text-anchor="middle" x="33.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">jumpSearch</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.38,-56.25 104.12,-56.25 104.12,-37 155.38,-37 155.38,-56.25"/>
-<text text-anchor="middle" x="129.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M68.24,-34.38C76.1,-35.97 84.51,-37.67 92.49,-39.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.78,-42.71 102.28,-41.27 93.17,-35.85 91.78,-42.71"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.75,-19.25 103.75,-19.25 103.75,0 155.75,0 155.75,-19.25"/>
-<text text-anchor="middle" x="129.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M68.24,-21.23C76.03,-19.73 84.36,-18.14 92.28,-16.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.82,-20.08 101.98,-14.76 91.5,-13.2 92.82,-20.08"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d22/jump__search_8cpp_source.html b/d2/d22/jump__search_8cpp_source.html
new file mode 100644
index 000000000..08e922439
--- /dev/null
+++ b/d2/d22/jump__search_8cpp_source.html
@@ -0,0 +1,190 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: search/jump_search.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d2/d22/jump__search_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">jump_search.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d2/d22/jump__search_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
+<div class="foldopen" id="foldopen00012" data-start="{" data-end="}">
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"><a class="line" href="../../d2/d22/jump__search_8cpp.html#ab49fd8f401bfc71f63b74711390cccf0">   12</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d2/d22/jump__search_8cpp.html#ab49fd8f401bfc71f63b74711390cccf0">jumpSearch</a>(<span class="keywordtype">int</span> arr[], <span class="keywordtype">int</span> x, <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <span class="comment">// Finding block size to be jumped</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordtype">int</span> step = std::sqrt(n);</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <span class="comment">// Finding the block where element is</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="comment">// present (if it is present)</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="keywordtype">int</span> prev = 0;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    <span class="keywordflow">while</span> (arr[std::min(step, n) - 1] &lt; x) {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        prev = step;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        step += std::sqrt(n);</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        <span class="keywordflow">if</span> (prev &gt;= n)</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>            <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    }</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="comment">// Doing a linear search for x in block</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="comment">// beginning with prev.</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="keywordflow">while</span> (arr[prev] &lt; x) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>        prev++;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        <span class="comment">// If we reached next block or end of</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        <span class="comment">// array, element is not present.</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        <span class="keywordflow">if</span> (prev == std::min(step, n))</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>            <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    }</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="comment">// If element is found</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">if</span> (arr[prev] == x)</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <span class="keywordflow">return</span> prev;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>}</div>
+</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="comment">// Driver program to test function</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordtype">int</span> arr[] = {0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610};</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keywordtype">int</span> x = 55;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordtype">int</span> n = <span class="keyword">sizeof</span>(arr) / <span class="keyword">sizeof</span>(arr[0]);</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="comment">// Find the index of &#39;x&#39; using Jump Search</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordtype">int</span> index = <a class="code hl_function" href="../../d2/d22/jump__search_8cpp.html#ab49fd8f401bfc71f63b74711390cccf0">jumpSearch</a>(arr, x, n);</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="comment">// Print the index where &#39;x&#39; is located</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nNumber &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; is at index &quot;</span> &lt;&lt; index;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="ajump__search_8cpp_html_ab49fd8f401bfc71f63b74711390cccf0"><div class="ttname"><a href="../../d2/d22/jump__search_8cpp.html#ab49fd8f401bfc71f63b74711390cccf0">jumpSearch</a></div><div class="ttdeci">int jumpSearch(int arr[], int x, int n)</div><div class="ttdef"><b>Definition</b> <a href="#l00012">jump_search.cpp:12</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../d2/d22/jump__search_8cpp.html">jump_search.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d2/d26/count__inversions_8cpp.html b/d2/d26/count__inversions_8cpp.html
index 988847a5f..0424ec58a 100644
--- a/d2/d26/count__inversions_8cpp.html
+++ b/d2/d26/count__inversions_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/count_inversions.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/count_inversions.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for count_inversions.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d6c/count__inversions_8cpp__incl.svg" width="336" height="111"><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">
+</div>
+<p><a href="../../d2/d26/count__inversions_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -174,6 +193,8 @@ Algorithm</h3>
 <li>Print the answer</li>
 </ol>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/rakshitraj" target="_blank">Rakshit Raj</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d2/d26/count__inversions_8cpp_source.html">count_inversions.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a3332498eabf6579ef059c0d0e9f4ec80" name="a3332498eabf6579ef059c0d0e9f4ec80"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a3332498eabf6579ef059c0d0e9f4ec80">&#9670;&#160;</a></span>countInversion()</h2>
@@ -200,29 +221,22 @@ template&lt;class T &gt; </div>
 <p>Number of inversions in a sorted array is 0. Number of inversion in an array[1...n] sorted in non-ascending order is n(n-1)/2, since each pair of elements contitute an inversion.</p>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramname">arr</td><td>- array, data member of <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>, input for counting inversions </td></tr>
+    <tr><td class="paramname">arr</td><td>- array, data member of std::vector&lt;int&gt;, input for counting inversions </td></tr>
     <tr><td class="paramname">array_size</td><td>- number of elementa in the array </td></tr>
   </table>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>number of inversions in input array, sorts the array </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  164</span>                                                     {</div>
-<div class="line"><span class="lineno">  165</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> temp;</div>
-<div class="line"><span class="lineno">  166</span>    temp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">reserve</a>(size);</div>
-<div class="line"><span class="lineno">  167</span>    temp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/assign.html">assign</a>(size, 0);</div>
-<div class="line"><span class="lineno">  168</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, temp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/data.html">data</a>(), 0, size - 1);</div>
-<div class="line"><span class="lineno">  169</span>}</div>
-<div class="ttc" id="aassign_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/assign.html">std::vector::assign</a></div><div class="ttdeci">T assign(T... args)</div></div>
-<div class="ttc" id="adata_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/data.html">std::vector::data</a></div><div class="ttdeci">T data(T... args)</div></div>
-<div class="ttc" id="agroup__sorting_html_gab6b14fea48d9841e29b9fc26be6e05d7"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a></div><div class="ttdeci">void mergeSort(int *arr, int l, int r)</div><div class="ttdef"><b>Definition</b> merge_sort.cpp:71</div></div>
-<div class="ttc" id="areserve_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">std::vector::reserve</a></div><div class="ttdeci">T reserve(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d26/count__inversions_8cpp_a3332498eabf6579ef059c0d0e9f4ec80_cgraph.svg" width="314" height="224"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d2/d26/count__inversions_8cpp_source.html#l00164">164</a> of file <a class="el" href="../../d2/d26/count__inversions_8cpp_source.html">count_inversions.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  164</span>                                                     {</div>
+<div class="line"><span class="lineno">  165</span>    std::vector&lt;T&gt; temp;</div>
+<div class="line"><span class="lineno">  166</span>    temp.reserve(size);</div>
+<div class="line"><span class="lineno">  167</span>    temp.assign(size, 0);</div>
+<div class="line"><span class="lineno">  168</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, temp.data(), 0, size - 1);</div>
+<div class="line"><span class="lineno">  169</span>}</div>
+<div class="ttc" id="agroup__sorting_html_gab6b14fea48d9841e29b9fc26be6e05d7"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a></div><div class="ttdeci">void mergeSort(int *arr, int l, int r)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/df4/merge__sort_8cpp_source.html#l00071">merge_sort.cpp:71</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -243,18 +257,15 @@ Here is the call graph for this function:</div>
 <p>Program Body contains all main funtionality. </p>
 <dl class="section return"><dt>Returns</dt><dd>void</dd></dl>
 <p>Main function </p><dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d26/count__inversions_8cpp_source.html#l00271">271</a> of file <a class="el" href="../../d2/d26/count__inversions_8cpp_source.html">count_inversions.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  271</span>           {</div>
 <div class="line"><span class="lineno">  272</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Run test implementations</span></div>
 <div class="line"><span class="lineno">  273</span>    <span class="comment">// body(); // test your own array</span></div>
 <div class="line"><span class="lineno">  274</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  275</span>}</div>
-<div class="ttc" id="acount__inversions_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> count_inversions.cpp:194</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="316" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acount__inversions_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d26/count__inversions_8cpp_source.html#l00194">count_inversions.cpp:194</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aad643c14734394e784a75169cb58132f" name="aad643c14734394e784a75169cb58132f"></a>
@@ -307,6 +318,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>number of inversions found in merge step </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d26/count__inversions_8cpp_source.html#l00085">85</a> of file <a class="el" href="../../d2/d26/count__inversions_8cpp_source.html">count_inversions.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   85</span>                                                                             {</div>
 <div class="line"><span class="lineno">   86</span>    uint32_t i = left;       <span class="comment">/* i --&gt; index of left sub-array */</span></div>
 <div class="line"><span class="lineno">   87</span>    uint32_t j = mid + 1;    <span class="comment">/* j --&gt; index for right sub-array */</span></div>
@@ -331,13 +344,12 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  106</span>        temp[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++] = arr[j++];</div>
 <div class="line"><span class="lineno">  107</span>    }</div>
 <div class="line"><span class="lineno">  108</span>    <span class="comment">// Copy temp[] to arr[]</span></div>
-<div class="line"><span class="lineno">  109</span>    <span class="keywordflow">for</span> (k = left; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> &lt;= <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++) {</div>
+<div class="line"><span class="lineno">  109</span>    <span class="keywordflow">for</span> (k = left; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> &lt;= right; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++) {</div>
 <div class="line"><span class="lineno">  110</span>        arr[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] = temp[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>];</div>
 <div class="line"><span class="lineno">  111</span>    }</div>
 <div class="line"><span class="lineno">  112</span>    <span class="keywordflow">return</span> inv_count;</div>
 <div class="line"><span class="lineno">  113</span>}</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-<div class="ttc" id="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::right</a></div><div class="ttdeci">T right(T... args)</div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -384,11 +396,13 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>number of inversions in array </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d26/count__inversions_8cpp_source.html#l00132">132</a> of file <a class="el" href="../../d2/d26/count__inversions_8cpp_source.html">count_inversions.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  132</span>                                                                   {</div>
 <div class="line"><span class="lineno">  133</span>    uint32_t mid = 0, inv_count = 0;</div>
 <div class="line"><span class="lineno">  134</span>    <span class="keywordflow">if</span> (right &gt; left) {</div>
 <div class="line"><span class="lineno">  135</span>        <span class="comment">// midpoint to split the array</span></div>
-<div class="line"><span class="lineno">  136</span>        mid = (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a> + left) / 2;</div>
+<div class="line"><span class="lineno">  136</span>        mid = (right + left) / 2;</div>
 <div class="line"><span class="lineno">  137</span>        <span class="comment">// Add inversions in left and right sub-arrays</span></div>
 <div class="line"><span class="lineno">  138</span>        inv_count += <a class="code hl_function" href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, temp, left, mid);  <span class="comment">// left sub-array</span></div>
 <div class="line"><span class="lineno">  139</span>        inv_count += <a class="code hl_function" href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, temp, mid + 1, right);</div>
@@ -398,13 +412,8 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  143</span>    }</div>
 <div class="line"><span class="lineno">  144</span>    <span class="keywordflow">return</span> inv_count;</div>
 <div class="line"><span class="lineno">  145</span>}</div>
-<div class="ttc" id="agroup__sorting_html_ga460c61cd948203b4816bef2accb3fc73"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge</a></div><div class="ttdeci">void merge(int *arr, int l, int m, int r)</div><div class="ttdef"><b>Definition</b> merge_sort.cpp:33</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph.svg" width="131" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agroup__sorting_html_ga460c61cd948203b4816bef2accb3fc73"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge</a></div><div class="ttdeci">void merge(int *arr, int l, int m, int r)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/df4/merge__sort_8cpp_source.html#l00033">merge_sort.cpp:33</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a851ca6a0391d14fb49a97d55e4377497" name="a851ca6a0391d14fb49a97d55e4377497"></a>
@@ -437,14 +446,15 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d26/count__inversions_8cpp_source.html#l00179">179</a> of file <a class="el" href="../../d2/d26/count__inversions_8cpp_source.html">count_inversions.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  179</span>                                             {</div>
-<div class="line"><span class="lineno">  180</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Printing array: \n&quot;</span>;</div>
+<div class="line"><span class="lineno">  180</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Printing array: \n&quot;</span>;</div>
 <div class="line"><span class="lineno">  181</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; array_size; i++) {</div>
-<div class="line"><span class="lineno">  182</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; arr[i];</div>
+<div class="line"><span class="lineno">  182</span>        std::cout &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; arr[i];</div>
 <div class="line"><span class="lineno">  183</span>    }</div>
-<div class="line"><span class="lineno">  184</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  184</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  185</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><!-- fragment -->
 </div>
 </div>
@@ -473,47 +483,43 @@ template&lt;typename T &gt; </div>
 
 <p>Test implementations. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d26/count__inversions_8cpp_source.html#l00194">194</a> of file <a class="el" href="../../d2/d26/count__inversions_8cpp_source.html">count_inversions.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  194</span>                   {</div>
 <div class="line"><span class="lineno">  195</span>    <span class="comment">// Test 1</span></div>
-<div class="line"><span class="lineno">  196</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> arr1 = {</div>
+<div class="line"><span class="lineno">  196</span>    std::vector&lt;uint64_t&gt; arr1 = {</div>
 <div class="line"><span class="lineno">  197</span>        100, 99, 98, 97, 96, 95, 94, 93, 92, 91, 90, 89, 88, 87, 86, 85, 84,</div>
 <div class="line"><span class="lineno">  198</span>        83,  82, 81, 80, 79, 78, 77, 76, 75, 74, 73, 72, 71, 70, 69, 68, 67,</div>
 <div class="line"><span class="lineno">  199</span>        66,  65, 64, 63, 62, 61, 60, 59, 58, 57, 56, 55, 54, 53, 52, 51, 50,</div>
 <div class="line"><span class="lineno">  200</span>        49,  48, 47, 46, 45, 44, 43, 42, 41, 40, 39, 38, 37, 36, 35, 34, 33,</div>
 <div class="line"><span class="lineno">  201</span>        32,  31, 30, 29, 28, 27, 26, 25, 24, 23, 22, 21, 20, 19, 18, 17, 16,</div>
 <div class="line"><span class="lineno">  202</span>        15,  14, 13, 12, 11, 10, 9,  8,  7,  6,  5,  4,  3,  2,  1};</div>
-<div class="line"><span class="lineno">  203</span>    uint32_t size1 = arr1.<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">  203</span>    uint32_t size1 = arr1.size();</div>
 <div class="line"><span class="lineno">  204</span>    uint32_t inv_count1 = 4950;</div>
-<div class="line"><span class="lineno">  205</span>    uint32_t result1 = <a class="code hl_function" href="#a3332498eabf6579ef059c0d0e9f4ec80">sorting::inversion::countInversion</a>(arr1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/data.html">data</a>(), size1);</div>
+<div class="line"><span class="lineno">  205</span>    uint32_t result1 = <a class="code hl_function" href="#a3332498eabf6579ef059c0d0e9f4ec80">sorting::inversion::countInversion</a>(arr1.data(), size1);</div>
 <div class="line"><span class="lineno">  206</span>    assert(inv_count1 == result1);</div>
 <div class="line"><span class="lineno">  207</span>    <span class="comment">// Test 2</span></div>
-<div class="line"><span class="lineno">  208</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> arr2 = {22, 66, 75, 23, 11, 87, 2, 44, 98, 43};</div>
-<div class="line"><span class="lineno">  209</span>    uint32_t size2 = arr2.<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">  208</span>    std::vector&lt;int&gt; arr2 = {22, 66, 75, 23, 11, 87, 2, 44, 98, 43};</div>
+<div class="line"><span class="lineno">  209</span>    uint32_t size2 = arr2.size();</div>
 <div class="line"><span class="lineno">  210</span>    uint32_t inv_count2 = 20;</div>
-<div class="line"><span class="lineno">  211</span>    uint32_t result2 = <a class="code hl_function" href="#a3332498eabf6579ef059c0d0e9f4ec80">sorting::inversion::countInversion</a>(arr2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/data.html">data</a>(), size2);</div>
+<div class="line"><span class="lineno">  211</span>    uint32_t result2 = <a class="code hl_function" href="#a3332498eabf6579ef059c0d0e9f4ec80">sorting::inversion::countInversion</a>(arr2.data(), size2);</div>
 <div class="line"><span class="lineno">  212</span>    assert(inv_count2 == result2);</div>
 <div class="line"><span class="lineno">  213</span>    <span class="comment">// Test 3</span></div>
-<div class="line"><span class="lineno">  214</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> arr3 = {33.1, 45.2, 65.4, 76.5, 1.0,</div>
+<div class="line"><span class="lineno">  214</span>    std::vector&lt;double&gt; arr3 = {33.1, 45.2, 65.4, 76.5, 1.0,</div>
 <div class="line"><span class="lineno">  215</span>                                2.9,  5.4,  7.7,  88.9, 12.4};</div>
-<div class="line"><span class="lineno">  216</span>    uint32_t size3 = arr3.<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">  216</span>    uint32_t size3 = arr3.size();</div>
 <div class="line"><span class="lineno">  217</span>    uint32_t inv_count3 = 21;</div>
-<div class="line"><span class="lineno">  218</span>    uint32_t result3 = <a class="code hl_function" href="#a3332498eabf6579ef059c0d0e9f4ec80">sorting::inversion::countInversion</a>(arr3.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/data.html">data</a>(), size3);</div>
+<div class="line"><span class="lineno">  218</span>    uint32_t result3 = <a class="code hl_function" href="#a3332498eabf6579ef059c0d0e9f4ec80">sorting::inversion::countInversion</a>(arr3.data(), size3);</div>
 <div class="line"><span class="lineno">  219</span>    assert(inv_count3 == result3);</div>
 <div class="line"><span class="lineno">  220</span>    <span class="comment">// Test 4</span></div>
-<div class="line"><span class="lineno">  221</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;char&gt;</a> arr4 = {<span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;b&#39;</span>, <span class="charliteral">&#39;c&#39;</span>, <span class="charliteral">&#39;d&#39;</span>, <span class="charliteral">&#39;e&#39;</span>};</div>
-<div class="line"><span class="lineno">  222</span>    uint32_t size4 = arr4.<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">  221</span>    std::vector&lt;char&gt; arr4 = {<span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;b&#39;</span>, <span class="charliteral">&#39;c&#39;</span>, <span class="charliteral">&#39;d&#39;</span>, <span class="charliteral">&#39;e&#39;</span>};</div>
+<div class="line"><span class="lineno">  222</span>    uint32_t size4 = arr4.size();</div>
 <div class="line"><span class="lineno">  223</span>    uint32_t inv_count4 = 0;</div>
-<div class="line"><span class="lineno">  224</span>    uint32_t result4 = <a class="code hl_function" href="#a3332498eabf6579ef059c0d0e9f4ec80">sorting::inversion::countInversion</a>(arr4.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/data.html">data</a>(), size4);</div>
+<div class="line"><span class="lineno">  224</span>    uint32_t result4 = <a class="code hl_function" href="#a3332498eabf6579ef059c0d0e9f4ec80">sorting::inversion::countInversion</a>(arr4.data(), size4);</div>
 <div class="line"><span class="lineno">  225</span>    assert(inv_count4 == result4);</div>
 <div class="line"><span class="lineno">  226</span>}</div>
-<div class="ttc" id="acount__inversions_8cpp_html_a3332498eabf6579ef059c0d0e9f4ec80"><div class="ttname"><a href="#a3332498eabf6579ef059c0d0e9f4ec80">sorting::inversion::countInversion</a></div><div class="ttdeci">uint32_t countInversion(T *arr, const uint32_t size)</div><div class="ttdoc">Function countInversion() returns the number of inversion present in the input array....</div><div class="ttdef"><b>Definition</b> count_inversions.cpp:164</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><!-- 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="../../d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="219" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acount__inversions_8cpp_html_a3332498eabf6579ef059c0d0e9f4ec80"><div class="ttname"><a href="#a3332498eabf6579ef059c0d0e9f4ec80">sorting::inversion::countInversion</a></div><div class="ttdeci">uint32_t countInversion(T *arr, const uint32_t size)</div><div class="ttdoc">Function countInversion() returns the number of inversion present in the input array....</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d26/count__inversions_8cpp_source.html#l00164">count_inversions.cpp:164</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d2/d26/count__inversions_8cpp_a3332498eabf6579ef059c0d0e9f4ec80_cgraph.map b/d2/d26/count__inversions_8cpp_a3332498eabf6579ef059c0d0e9f4ec80_cgraph.map
deleted file mode 100644
index 81ad996a9..000000000
--- a/d2/d26/count__inversions_8cpp_a3332498eabf6579ef059c0d0e9f4ec80_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="sorting::inversion::countInversion" name="sorting::inversion::countInversion">
-<area shape="rect" id="Node000001" title="Function countInversion() returns the number of inversion present in the input array...." alt="" coords="5,88,126,129"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="32,88,30,79,36,70,48,64,66,62,85,64,96,71,94,75,83,69,65,67,49,69,39,74,35,80,37,87"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/assign.html#" title=" " alt="" coords="176,5,306,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="95,86,172,40,183,35,185,40,175,45,98,90"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/data.html#" title=" " alt="" coords="183,55,299,80"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="126,92,168,82,170,87,127,97"/>
-<area shape="rect" id="Node000004" href="$d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661" title="Implement merge Sort and count inverions while merging." alt="" coords="181,128,301,169"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="127,120,166,129,165,134,126,125"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/reserve.html#" title=" " alt="" coords="174,193,308,219"/>
-<area shape="poly" id="edge6_Node000001_Node000005" title=" " alt="" coords="95,127,132,153,175,178,187,185,185,189,172,183,129,158,92,132"/>
-<area shape="poly" id="edge5_Node000004_Node000004" title=" " alt="" coords="207,128,206,119,211,110,223,104,241,102,260,104,272,111,269,115,258,109,241,107,224,109,215,114,211,120,212,127"/>
-</map>
diff --git a/d2/d26/count__inversions_8cpp_a3332498eabf6579ef059c0d0e9f4ec80_cgraph.md5 b/d2/d26/count__inversions_8cpp_a3332498eabf6579ef059c0d0e9f4ec80_cgraph.md5
deleted file mode 100644
index f79861519..000000000
--- a/d2/d26/count__inversions_8cpp_a3332498eabf6579ef059c0d0e9f4ec80_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8f05f165f5f087909f1d5f88490d4e38
\ No newline at end of file
diff --git a/d2/d26/count__inversions_8cpp_a3332498eabf6579ef059c0d0e9f4ec80_cgraph.svg b/d2/d26/count__inversions_8cpp_a3332498eabf6579ef059c0d0e9f4ec80_cgraph.svg
deleted file mode 100644
index ca5a0005a..000000000
--- a/d2/d26/count__inversions_8cpp_a3332498eabf6579ef059c0d0e9f4ec80_cgraph.svg
+++ /dev/null
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::inversion::countInversion Pages: 1 -->
-<svg width="235pt" height="168pt"
- viewBox="0.00 0.00 235.00 168.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 164.25)">
-<title>sorting::inversion::countInversion</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function countInversion() returns the number of inversion present in the input array....">
-<polygon fill="#999999" stroke="#666666" points="90.25,-97.88 0,-97.88 0,-67.38 90.25,-67.38 90.25,-97.88"/>
-<text text-anchor="start" x="8" y="-84.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::inversion</text>
-<text text-anchor="middle" x="45.12" y="-73.12" font-family="Helvetica,sans-Serif" font-size="10.00">::countInversion</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.82,-98.36C17.07,-107.43 24.83,-115.88 45.12,-115.88 56.22,-115.88 63.57,-113.35 67.18,-109.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.63,-110.19 68.26,-99.87 63.67,-109.42 70.63,-110.19"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/assign.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="225.12,-160.25 128.12,-160.25 128.12,-141 225.12,-141 225.12,-160.25"/>
-<text text-anchor="middle" x="176.62" y="-146.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::assign</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M68.2,-98.15C83.9,-108.75 105.76,-122.63 126.25,-132.62 128.83,-133.88 131.53,-135.11 134.27,-136.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.93,-139.52 143.52,-139.99 135.54,-133.02 132.93,-139.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/data.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-123.25 133,-123.25 133,-104 220.25,-104 220.25,-123.25"/>
-<text text-anchor="middle" x="176.62" y="-109.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.69,-93.29C101.01,-95.76 112.09,-98.41 122.72,-100.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="121.58,-104.29 132.12,-103.21 123.21,-97.48 121.58,-104.29"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661" target="_top" xlink:title="Implement merge Sort and count inverions while merging.">
-<polygon fill="white" stroke="#666666" points="221.75,-67.88 131.5,-67.88 131.5,-37.38 221.75,-37.38 221.75,-67.88"/>
-<text text-anchor="start" x="139.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::inversion</text>
-<text text-anchor="middle" x="176.62" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::mergeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.69,-72.3C100.26,-70.08 110.48,-67.72 120.4,-65.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.99,-68.87 129.94,-63.21 119.41,-62.06 120.99,-68.87"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/reserve.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227,-19.25 126.25,-19.25 126.25,0 227,0 227,-19.25"/>
-<text text-anchor="middle" x="176.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::reserve</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.41,-67.07C82.15,-55.47 104.83,-39.78 126.25,-28.62 129.29,-27.04 132.49,-25.52 135.74,-24.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.89,-27.38 144.77,-20.29 134.19,-20.92 136.89,-27.38"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.32,-68.36C148.57,-77.43 156.33,-85.88 176.62,-85.88 187.72,-85.88 195.07,-83.35 198.68,-79.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.13,-80.19 199.76,-69.87 195.17,-79.42 202.13,-80.19"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d26/count__inversions_8cpp_a3332498eabf6579ef059c0d0e9f4ec80_cgraph_org.svg b/d2/d26/count__inversions_8cpp_a3332498eabf6579ef059c0d0e9f4ec80_cgraph_org.svg
deleted file mode 100644
index 059e7e1c4..000000000
--- a/d2/d26/count__inversions_8cpp_a3332498eabf6579ef059c0d0e9f4ec80_cgraph_org.svg
+++ /dev/null
@@ -1,113 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::inversion::countInversion Pages: 1 -->
-<svg width="235pt" height="168pt"
- viewBox="0.00 0.00 235.00 168.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 164.25)">
-<title>sorting::inversion::countInversion</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function countInversion() returns the number of inversion present in the input array....">
-<polygon fill="#999999" stroke="#666666" points="90.25,-97.88 0,-97.88 0,-67.38 90.25,-67.38 90.25,-97.88"/>
-<text text-anchor="start" x="8" y="-84.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::inversion</text>
-<text text-anchor="middle" x="45.12" y="-73.12" font-family="Helvetica,sans-Serif" font-size="10.00">::countInversion</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.82,-98.36C17.07,-107.43 24.83,-115.88 45.12,-115.88 56.22,-115.88 63.57,-113.35 67.18,-109.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.63,-110.19 68.26,-99.87 63.67,-109.42 70.63,-110.19"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/assign.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="225.12,-160.25 128.12,-160.25 128.12,-141 225.12,-141 225.12,-160.25"/>
-<text text-anchor="middle" x="176.62" y="-146.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::assign</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M68.2,-98.15C83.9,-108.75 105.76,-122.63 126.25,-132.62 128.83,-133.88 131.53,-135.11 134.27,-136.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.93,-139.52 143.52,-139.99 135.54,-133.02 132.93,-139.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/data.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-123.25 133,-123.25 133,-104 220.25,-104 220.25,-123.25"/>
-<text text-anchor="middle" x="176.62" y="-109.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.69,-93.29C101.01,-95.76 112.09,-98.41 122.72,-100.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="121.58,-104.29 132.12,-103.21 123.21,-97.48 121.58,-104.29"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661" target="_top" xlink:title="Implement merge Sort and count inverions while merging.">
-<polygon fill="white" stroke="#666666" points="221.75,-67.88 131.5,-67.88 131.5,-37.38 221.75,-37.38 221.75,-67.88"/>
-<text text-anchor="start" x="139.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::inversion</text>
-<text text-anchor="middle" x="176.62" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::mergeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.69,-72.3C100.26,-70.08 110.48,-67.72 120.4,-65.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.99,-68.87 129.94,-63.21 119.41,-62.06 120.99,-68.87"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/reserve.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227,-19.25 126.25,-19.25 126.25,0 227,0 227,-19.25"/>
-<text text-anchor="middle" x="176.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::reserve</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.41,-67.07C82.15,-55.47 104.83,-39.78 126.25,-28.62 129.29,-27.04 132.49,-25.52 135.74,-24.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.89,-27.38 144.77,-20.29 134.19,-20.92 136.89,-27.38"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.32,-68.36C148.57,-77.43 156.33,-85.88 176.62,-85.88 187.72,-85.88 195.07,-83.35 198.68,-79.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.13,-80.19 199.76,-69.87 195.17,-79.42 202.13,-80.19"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index cfde15fa4..000000000
--- a/d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Test implementations." alt="" coords="5,31,49,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/data.html#" title=" " alt="" coords="97,5,213,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,37,81,30,82,35,50,42"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="97,55,212,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="50,45,82,51,81,56,48,50"/>
-</map>
diff --git a/d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index c6f6aaf25..000000000
--- a/d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4692c78e54ffffefcb6ad58a24e4a685
\ No newline at end of file
diff --git a/d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index bd73769ba..000000000
--- a/d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="164pt" height="64pt"
- viewBox="0.00 0.00 163.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/data.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.75,-56.25 68.5,-56.25 68.5,-37 155.75,-37 155.75,-56.25"/>
-<text text-anchor="middle" x="112.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.75,-30.76C39.56,-32.14 48.01,-33.85 56.81,-35.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.07,-39.05 66.56,-37.61 57.46,-32.19 56.07,-39.05"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.38,-19.25 68.88,-19.25 68.88,0 155.38,0 155.38,-19.25"/>
-<text text-anchor="middle" x="112.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.75,-24.65C39.71,-23.32 48.38,-21.66 57.39,-19.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.81,-23.41 66.97,-18.09 56.49,-16.54 57.81,-23.41"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 51692603d..000000000
--- a/d2/d26/count__inversions_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="164pt" height="64pt"
- viewBox="0.00 0.00 163.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/data.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.75,-56.25 68.5,-56.25 68.5,-37 155.75,-37 155.75,-56.25"/>
-<text text-anchor="middle" x="112.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.75,-30.76C39.56,-32.14 48.01,-33.85 56.81,-35.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.07,-39.05 66.56,-37.61 57.46,-32.19 56.07,-39.05"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.38,-19.25 68.88,-19.25 68.88,0 155.38,0 155.38,-19.25"/>
-<text text-anchor="middle" x="112.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.75,-24.65C39.71,-23.32 48.38,-21.66 57.39,-19.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.81,-23.41 66.97,-18.09 56.49,-16.54 57.81,-23.41"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index a2d43d06b..000000000
--- a/d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Program Body contains all main funtionality." alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Test implementations." alt="" coords="103,31,146,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,41,87,41,87,46,55,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/data.html#" title=" " alt="" coords="194,5,310,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,37,178,30,179,35,147,42"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="194,55,310,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="147,45,180,51,179,56,146,50"/>
-</map>
diff --git a/d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index ac4e0bfb6..000000000
--- a/d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ea912fb6d9e7e5bace3723fbd8f5de24
\ No newline at end of file
diff --git a/d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index dc89e41ff..000000000
--- a/d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="237pt" height="64pt"
- viewBox="0.00 0.00 236.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Program Body contains all main funtionality.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/data.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.75,-56.25 141.5,-56.25 141.5,-37 228.75,-37 228.75,-56.25"/>
-<text text-anchor="middle" x="185.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::data</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.75,-30.76C112.56,-32.14 121.01,-33.85 129.81,-35.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.07,-39.05 139.56,-37.61 130.46,-32.19 129.07,-39.05"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.38,-19.25 141.88,-19.25 141.88,0 228.38,0 228.38,-19.25"/>
-<text text-anchor="middle" x="185.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.75,-24.65C112.71,-23.32 121.38,-21.66 130.39,-19.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.81,-23.41 139.97,-18.09 129.49,-16.54 130.81,-23.41"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 868bd5ccf..000000000
--- a/d2/d26/count__inversions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="237pt" height="64pt"
- viewBox="0.00 0.00 236.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Program Body contains all main funtionality.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/data.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.75,-56.25 141.5,-56.25 141.5,-37 228.75,-37 228.75,-56.25"/>
-<text text-anchor="middle" x="185.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::data</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.75,-30.76C112.56,-32.14 121.01,-33.85 129.81,-35.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.07,-39.05 139.56,-37.61 130.46,-32.19 129.07,-39.05"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.38,-19.25 141.88,-19.25 141.88,0 228.38,0 228.38,-19.25"/>
-<text text-anchor="middle" x="185.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.75,-24.65C112.71,-23.32 121.38,-21.66 130.39,-19.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.81,-23.41 139.97,-18.09 129.49,-16.54 130.81,-23.41"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph.map b/d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph.map
deleted file mode 100644
index 7ee998f44..000000000
--- a/d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="sorting::inversion::mergeSort" name="sorting::inversion::mergeSort">
-<area shape="rect" id="Node000001" title="Implement merge Sort and count inverions while merging." alt="" coords="5,29,126,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="42,29,40,20,44,11,53,5,66,3,79,5,87,12,84,16,77,10,65,8,55,10,48,14,46,20,47,28"/>
-</map>
diff --git a/d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph.md5 b/d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph.md5
deleted file mode 100644
index 3666ab758..000000000
--- a/d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4e4df187bd1da7f684a014e54a10f164
\ No newline at end of file
diff --git a/d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph.svg b/d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph.svg
deleted file mode 100644
index d675b9bb4..000000000
--- a/d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::inversion::mergeSort Pages: 1 -->
-<svg width="98pt" height="57pt"
- viewBox="0.00 0.00 98.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>sorting::inversion::mergeSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Implement merge Sort and count inverions while merging.">
-<polygon fill="#999999" stroke="#666666" points="90.25,-30.5 0,-30.5 0,0 90.25,0 90.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::inversion</text>
-<text text-anchor="middle" x="45.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::mergeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.13,-30.99C25.87,-40.06 31.2,-48.5 45.12,-48.5 52.74,-48.5 57.79,-45.97 60.26,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="63.73,-42.73 61,-32.49 56.75,-42.2 63.73,-42.73"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph_org.svg b/d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph_org.svg
deleted file mode 100644
index 1ae45e655..000000000
--- a/d2/d26/count__inversions_8cpp_ae97a486e14101c4822ea8dc47f0d1661_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::inversion::mergeSort Pages: 1 -->
-<svg width="98pt" height="57pt"
- viewBox="0.00 0.00 98.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>sorting::inversion::mergeSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Implement merge Sort and count inverions while merging.">
-<polygon fill="#999999" stroke="#666666" points="90.25,-30.5 0,-30.5 0,0 90.25,0 90.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::inversion</text>
-<text text-anchor="middle" x="45.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::mergeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.13,-30.99C25.87,-40.06 31.2,-48.5 45.12,-48.5 52.74,-48.5 57.79,-45.97 60.26,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="63.73,-42.73 61,-32.49 56.75,-42.2 63.73,-42.73"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d26/count__inversions_8cpp_source.html b/d2/d26/count__inversions_8cpp_source.html
new file mode 100644
index 000000000..c16ec64d0
--- /dev/null
+++ b/d2/d26/count__inversions_8cpp_source.html
@@ -0,0 +1,316 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/count_inversions.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d2/d26/count__inversions_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">count_inversions.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d2/d26/count__inversions_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="preprocessor">#include &lt;cstdint&gt;</span>   </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/d13/namespaceinversion.html">inversion</a> {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="comment">// Functions used ---&gt;</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="comment">// int mergeSort(int* arr, int* temp, int left, int right);</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="comment">// int merge(int* arr, int* temp, int left, int mid, int right);</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="comment">// int countInversion(int* arr, const int size);</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="comment">// void show(int* arr, const int size);</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00085" data-start="{" data-end="}">
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"><a class="line" href="../../d2/d26/count__inversions_8cpp.html#aad643c14734394e784a75169cb58132f">   85</a></span>uint32_t <a class="code hl_function" href="../../d2/d26/count__inversions_8cpp.html#aad643c14734394e784a75169cb58132f">merge</a>(T* arr, T* temp, uint32_t left, uint32_t mid, uint32_t right) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    uint32_t i = left;       <span class="comment">/* i --&gt; index of left sub-array */</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    uint32_t j = mid + 1;    <span class="comment">/* j --&gt; index for right sub-array */</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    uint32_t k = left;       <span class="comment">/* k --&gt; index for resultant array temp */</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    uint32_t inv_count = 0;  <span class="comment">// inversion count</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordflow">while</span> ((i &lt;= mid) &amp;&amp; (j &lt;= right)) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        <span class="keywordflow">if</span> (arr[i] &lt;= arr[j]) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>            temp[k++] = arr[i++];</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>            temp[k++] = arr[j++];</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            inv_count +=</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>                (mid - i +</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>                 1);  <span class="comment">// tricky; may vary depending on selection of sub-array</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        }</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    }</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="comment">// Add remaining elements from the larger subarray to the end of temp</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="keywordflow">while</span> (i &lt;= mid) {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        temp[k++] = arr[i++];</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    }</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="keywordflow">while</span> (j &lt;= right) {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        temp[k++] = arr[j++];</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    }</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="comment">// Copy temp[] to arr[]</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="keywordflow">for</span> (k = left; k &lt;= right; k++) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        arr[k] = temp[k];</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    }</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="keywordflow">return</span> inv_count;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>}</div>
+</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00132" data-start="{" data-end="}">
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"><a class="line" href="../../d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661">  132</a></span>uint32_t <a class="code hl_function" href="../../d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661">mergeSort</a>(T* arr, T* temp, uint32_t left, uint32_t right) {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    uint32_t mid = 0, inv_count = 0;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <span class="keywordflow">if</span> (right &gt; left) {</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>        <span class="comment">// midpoint to split the array</span></div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        mid = (right + left) / 2;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        <span class="comment">// Add inversions in left and right sub-arrays</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>        inv_count += <a class="code hl_function" href="../../d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661">mergeSort</a>(arr, temp, left, mid);  <span class="comment">// left sub-array</span></div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>        inv_count += <a class="code hl_function" href="../../d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661">mergeSort</a>(arr, temp, mid + 1, right);</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span> </div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        <span class="comment">// inversions in the merge step</span></div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        inv_count += <a class="code hl_function" href="../../d2/d26/count__inversions_8cpp.html#aad643c14734394e784a75169cb58132f">merge</a>(arr, temp, left, mid, right);</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    }</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <span class="keywordflow">return</span> inv_count;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>}</div>
+</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span> </div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
+<div class="foldopen" id="foldopen00164" data-start="{" data-end="}">
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"><a class="line" href="../../d2/d26/count__inversions_8cpp.html#a3332498eabf6579ef059c0d0e9f4ec80">  164</a></span>uint32_t <a class="code hl_function" href="../../d2/d26/count__inversions_8cpp.html#a3332498eabf6579ef059c0d0e9f4ec80">countInversion</a>(T* arr, <span class="keyword">const</span> uint32_t size) {</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    std::vector&lt;T&gt; temp;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    temp.reserve(size);</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    temp.assign(size, 0);</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661">mergeSort</a>(arr, temp.data(), 0, size - 1);</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>}</div>
+</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span> </div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00179" data-start="{" data-end="}">
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"><a class="line" href="../../d2/d26/count__inversions_8cpp.html#a851ca6a0391d14fb49a97d55e4377497">  179</a></span><span class="keywordtype">void</span> show(T* arr, <span class="keyword">const</span> uint32_t array_size) {</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Printing array: \n&quot;</span>;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; array_size; i++) {</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>        std::cout &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; arr[i];</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    }</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>}</div>
+</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span> </div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>}  <span class="comment">// namespace inversion</span></div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span> </div>
+<div class="foldopen" id="foldopen00194" data-start="{" data-end="}">
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"><a class="line" href="../../d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  194</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    <span class="comment">// Test 1</span></div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    std::vector&lt;uint64_t&gt; arr1 = {</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>        100, 99, 98, 97, 96, 95, 94, 93, 92, 91, 90, 89, 88, 87, 86, 85, 84,</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>        83,  82, 81, 80, 79, 78, 77, 76, 75, 74, 73, 72, 71, 70, 69, 68, 67,</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        66,  65, 64, 63, 62, 61, 60, 59, 58, 57, 56, 55, 54, 53, 52, 51, 50,</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>        49,  48, 47, 46, 45, 44, 43, 42, 41, 40, 39, 38, 37, 36, 35, 34, 33,</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>        32,  31, 30, 29, 28, 27, 26, 25, 24, 23, 22, 21, 20, 19, 18, 17, 16,</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>        15,  14, 13, 12, 11, 10, 9,  8,  7,  6,  5,  4,  3,  2,  1};</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    uint32_t size1 = arr1.size();</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    uint32_t inv_count1 = 4950;</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    uint32_t result1 = sorting::inversion::countInversion(arr1.data(), size1);</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    assert(inv_count1 == result1);</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    <span class="comment">// Test 2</span></div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    std::vector&lt;int&gt; arr2 = {22, 66, 75, 23, 11, 87, 2, 44, 98, 43};</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    uint32_t size2 = arr2.size();</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    uint32_t inv_count2 = 20;</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    uint32_t result2 = sorting::inversion::countInversion(arr2.data(), size2);</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    assert(inv_count2 == result2);</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    <span class="comment">// Test 3</span></div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    std::vector&lt;double&gt; arr3 = {33.1, 45.2, 65.4, 76.5, 1.0,</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>                                2.9,  5.4,  7.7,  88.9, 12.4};</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    uint32_t size3 = arr3.size();</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    uint32_t inv_count3 = 21;</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    uint32_t result3 = sorting::inversion::countInversion(arr3.data(), size3);</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    assert(inv_count3 == result3);</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    <span class="comment">// Test 4</span></div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    std::vector&lt;char&gt; arr4 = {<span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;b&#39;</span>, <span class="charliteral">&#39;c&#39;</span>, <span class="charliteral">&#39;d&#39;</span>, <span class="charliteral">&#39;e&#39;</span>};</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    uint32_t size4 = arr4.size();</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    uint32_t inv_count4 = 0;</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    uint32_t result4 = sorting::inversion::countInversion(arr4.data(), size4);</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    assert(inv_count4 == result4);</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>}</div>
+</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span> </div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span><span class="comment">// /**</span></div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span><span class="comment">//  * @brief Program Body contains all main funtionality</span></div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span><span class="comment">//  * @returns void</span></div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span><span class="comment">//  */</span></div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span><span class="comment">// template &lt;typename T&gt;</span></div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span><span class="comment">// static void body() {</span></div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span><span class="comment">//     // Input your own sequence</span></div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span><span class="comment">//     uint_t size;</span></div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span><span class="comment">//     T input;</span></div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span><span class="comment">//     std::cout &lt;&lt; &quot;Enter number of elements:&quot;;</span></div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span><span class="comment">//     std::cin &gt;&gt; size;</span></div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span><span class="comment">//</span></div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span><span class="comment">//     std::vector&lt;T&gt; arr;</span></div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span><span class="comment">//     arr.reserve(size);</span></div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span><span class="comment">//</span></div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span><span class="comment">//     std::cout &lt;&lt; &quot;Enter elements --&gt;\n&quot;;</span></div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span><span class="comment">//     for (uint64_t i=1; i&lt;=size; i++) {</span></div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span><span class="comment">//         std::cout &lt;&lt; &quot;Element &quot;&lt;&lt; i &lt;&lt;&quot; :&quot;;</span></div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span><span class="comment">//         std::cin &gt;&gt; input;</span></div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span><span class="comment">//         arr.push_back(input);</span></div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span><span class="comment">//     }</span></div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span><span class="comment">//</span></div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span><span class="comment">//     if (size != arr.size()) {</span></div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span><span class="comment">//         size = arr.size();</span></div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span><span class="comment">//     }</span></div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span><span class="comment">//</span></div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span><span class="comment">//     std::cout &lt;&lt; &quot;\n&quot;;</span></div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span><span class="comment">//     sorting::inversion::show(arr.data(), size);</span></div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span><span class="comment">//     std::cout &lt;&lt; &quot;\n&quot;;</span></div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span><span class="comment">//</span></div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span><span class="comment">//     // Counting inversions</span></div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span><span class="comment">//     std::cout &lt;&lt; &quot;\nThe number of inversions: &quot;&lt;&lt;</span></div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span><span class="comment">//     sorting::inversion::countInversion(arr.data(), size) &lt;&lt; &quot;\n&quot;;</span></div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span><span class="comment">//</span></div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span><span class="comment">//     // Output sorted array</span></div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span><span class="comment">//     std::cout &lt;&lt; &quot;\nSorted array --&gt;  \n&quot;;</span></div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span><span class="comment">//     sorting::inversion::show(arr.data(), size);</span></div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span><span class="comment">// }</span></div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span> </div>
+<div class="foldopen" id="foldopen00271" data-start="{" data-end="}">
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"><a class="line" href="../../d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  271</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    <a class="code hl_function" href="../../d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Run test implementations</span></div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>    <span class="comment">// body(); // test your own array</span></div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>}</div>
+</div>
+<div class="ttc" id="acount__inversions_8cpp_html_a3332498eabf6579ef059c0d0e9f4ec80"><div class="ttname"><a href="../../d2/d26/count__inversions_8cpp.html#a3332498eabf6579ef059c0d0e9f4ec80">sorting::inversion::countInversion</a></div><div class="ttdeci">uint32_t countInversion(T *arr, const uint32_t size)</div><div class="ttdoc">Function countInversion() returns the number of inversion present in the input array....</div><div class="ttdef"><b>Definition</b> <a href="#l00164">count_inversions.cpp:164</a></div></div>
+<div class="ttc" id="acount__inversions_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d2/d26/count__inversions_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> <a href="#l00194">count_inversions.cpp:194</a></div></div>
+<div class="ttc" id="acount__inversions_8cpp_html_aad643c14734394e784a75169cb58132f"><div class="ttname"><a href="../../d2/d26/count__inversions_8cpp.html#aad643c14734394e784a75169cb58132f">sorting::inversion::merge</a></div><div class="ttdeci">uint32_t merge(T *arr, T *temp, uint32_t left, uint32_t mid, uint32_t right)</div><div class="ttdoc">Function to merge two sub-arrays.</div><div class="ttdef"><b>Definition</b> <a href="#l00085">count_inversions.cpp:85</a></div></div>
+<div class="ttc" id="acount__inversions_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Program Body contains all main funtionality.</div><div class="ttdef"><b>Definition</b> <a href="#l00271">count_inversions.cpp:271</a></div></div>
+<div class="ttc" id="acount__inversions_8cpp_html_ae97a486e14101c4822ea8dc47f0d1661"><div class="ttname"><a href="../../d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661">sorting::inversion::mergeSort</a></div><div class="ttdeci">uint32_t mergeSort(T *arr, T *temp, uint32_t left, uint32_t right)</div><div class="ttdoc">Implement merge Sort and count inverions while merging.</div><div class="ttdef"><b>Definition</b> <a href="#l00132">count_inversions.cpp:132</a></div></div>
+<div class="ttc" id="anamespaceinversion_html"><div class="ttname"><a href="../../d9/d13/namespaceinversion.html">inversion</a></div><div class="ttdoc">Functions for counting inversions using Merge Sort algorithm.</div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d2/d26/count__inversions_8cpp.html">count_inversions.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d2/d2c/structtower.html b/d2/d2c/structtower.html
index 6628f83ae..a59d91b07 100644
--- a/d2/d2c/structtower.html
+++ b/d2/d2c/structtower.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: tower Struct Reference</title>
+<title>TheAlgorithms/C++: tower Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -113,19 +130,56 @@ $(function(){initNavTree('d2/d2c/structtower.html','../../'); initResizable(true
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a3ebb75c13c57d51a8a1ba1ea54a515e9" id="r_a3ebb75c13c57d51a8a1ba1ea54a515e9"><td class="memItemLeft" align="right" valign="top"><a id="a3ebb75c13c57d51a8a1ba1ea54a515e9" name="a3ebb75c13c57d51a8a1ba1ea54a515e9"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>values</b> [10]</td></tr>
-<tr class="memdesc:a3ebb75c13c57d51a8a1ba1ea54a515e9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Values in the tower. <br /></td></tr>
+<tr class="memitem:a3ebb75c13c57d51a8a1ba1ea54a515e9" id="r_a3ebb75c13c57d51a8a1ba1ea54a515e9"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3ebb75c13c57d51a8a1ba1ea54a515e9">values</a> [10]</td></tr>
+<tr class="memdesc:a3ebb75c13c57d51a8a1ba1ea54a515e9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Values in the tower.  <br /></td></tr>
 <tr class="separator:a3ebb75c13c57d51a8a1ba1ea54a515e9"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:acb535964abd34c47678a4ade0628223d" id="r_acb535964abd34c47678a4ade0628223d"><td class="memItemLeft" align="right" valign="top"><a id="acb535964abd34c47678a4ade0628223d" name="acb535964abd34c47678a4ade0628223d"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>top</b></td></tr>
-<tr class="memdesc:acb535964abd34c47678a4ade0628223d"><td class="mdescLeft">&#160;</td><td class="mdescRight">top tower ID <br /></td></tr>
+<tr class="memitem:acb535964abd34c47678a4ade0628223d" id="r_acb535964abd34c47678a4ade0628223d"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acb535964abd34c47678a4ade0628223d">top</a></td></tr>
+<tr class="memdesc:acb535964abd34c47678a4ade0628223d"><td class="mdescLeft">&#160;</td><td class="mdescRight">top tower ID  <br /></td></tr>
 <tr class="separator:acb535964abd34c47678a4ade0628223d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Define the state of tower </p>
-</div><hr/>The documentation for this struct was generated from the following file:<ul>
-<li>others/<a class="el" href="../../db/d3c/tower__of__hanoi_8cpp.html">tower_of_hanoi.cpp</a></li>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp_source.html#l00011">11</a> of file <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp_source.html">tower_of_hanoi.cpp</a>.</p>
+</div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="acb535964abd34c47678a4ade0628223d" name="acb535964abd34c47678a4ade0628223d"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#acb535964abd34c47678a4ade0628223d">&#9670;&#160;</a></span>top</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int tower::top</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>top tower ID </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp_source.html#l00015">15</a> of file <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp_source.html">tower_of_hanoi.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a3ebb75c13c57d51a8a1ba1ea54a515e9" name="a3ebb75c13c57d51a8a1ba1ea54a515e9"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a3ebb75c13c57d51a8a1ba1ea54a515e9">&#9670;&#160;</a></span>values</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int tower::values[10]</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Values in the tower. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp_source.html#l00013">13</a> of file <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp_source.html">tower_of_hanoi.cpp</a>.</p>
+
+</div>
+</div>
+<hr/>The documentation for this struct was generated from the following file:<ul>
+<li>others/<a class="el" href="../../db/d3c/tower__of__hanoi_8cpp_source.html">tower_of_hanoi.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html b/d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html
index 67f155a87..336ae1aba 100644
--- a/d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html
+++ b/d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: greedy_algorithms::dijkstra Namespace Reference</title>
+<title>TheAlgorithms/C++: greedy_algorithms::dijkstra Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,10 +139,10 @@ Classes</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:af6cb29ca6dc5771439f6ea7262058a71" id="r_af6cb29ca6dc5771439f6ea7262058a71"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af6cb29ca6dc5771439f6ea7262058a71">minimum_distance</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; mdist, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; vset, int V)</td></tr>
+<tr class="memitem:af6cb29ca6dc5771439f6ea7262058a71" id="r_af6cb29ca6dc5771439f6ea7262058a71"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af6cb29ca6dc5771439f6ea7262058a71">minimum_distance</a> (std::vector&lt; int &gt; mdist, std::vector&lt; bool &gt; vset, int V)</td></tr>
 <tr class="memdesc:af6cb29ca6dc5771439f6ea7262058a71"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function that finds the vertex with the minimum distance in <code>mdist</code>.  <br /></td></tr>
 <tr class="separator:af6cb29ca6dc5771439f6ea7262058a71"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a7341d7c76a6145e991cdd231f689fca8" id="r_a7341d7c76a6145e991cdd231f689fca8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7341d7c76a6145e991cdd231f689fca8">print</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; dist, int V)</td></tr>
+<tr class="memitem:a7341d7c76a6145e991cdd231f689fca8" id="r_a7341d7c76a6145e991cdd231f689fca8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7341d7c76a6145e991cdd231f689fca8">print</a> (std::vector&lt; int &gt; dist, int V)</td></tr>
 <tr class="memdesc:a7341d7c76a6145e991cdd231f689fca8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to print the distances to vertices.  <br /></td></tr>
 <tr class="separator:a7341d7c76a6145e991cdd231f689fca8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af915876d0ca33cc71a6a6191a8cd3ccd" id="r_af915876d0ca33cc71a6a6191a8cd3ccd"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af915876d0ca33cc71a6a6191a8cd3ccd">dijkstra</a> (<a class="el" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html">Graph</a> graph, int src)</td></tr>
@@ -164,10 +181,12 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html#l00124">124</a> of file <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html">dijkstra_greedy.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  124</span>                                    {</div>
 <div class="line"><span class="lineno">  125</span>    <span class="keywordtype">int</span> V = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.vertexNum;</div>
-<div class="line"><span class="lineno">  126</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> mdist{};  <span class="comment">// Stores updated distances to the vertex</span></div>
-<div class="line"><span class="lineno">  127</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a> vset{};  <span class="comment">// `vset[i]` is true if the vertex `i` is included in the shortest path tree</span></div>
+<div class="line"><span class="lineno">  126</span>    std::vector&lt;int&gt; mdist{};  <span class="comment">// Stores updated distances to the vertex</span></div>
+<div class="line"><span class="lineno">  127</span>    std::vector&lt;bool&gt; vset{};  <span class="comment">// `vset[i]` is true if the vertex `i` is included in the shortest path tree</span></div>
 <div class="line"><span class="lineno">  128</span> </div>
 <div class="line"><span class="lineno">  129</span>    <span class="comment">// Initialize `mdist and `vset`. Set the distance of the source as zero</span></div>
 <div class="line"><span class="lineno">  130</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
@@ -194,14 +213,8 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  151</span>    print(mdist, V);</div>
 <div class="line"><span class="lineno">  152</span>}</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 class="ttc" id="anamespacegreedy__algorithms_1_1dijkstra_html_af6cb29ca6dc5771439f6ea7262058a71"><div class="ttname"><a href="#af6cb29ca6dc5771439f6ea7262058a71">greedy_algorithms::dijkstra::minimum_distance</a></div><div class="ttdeci">int minimum_distance(std::vector&lt; int &gt; mdist, std::vector&lt; bool &gt; vset, int V)</div><div class="ttdoc">Utility function that finds the vertex with the minimum distance in mdist.</div><div class="ttdef"><b>Definition</b> dijkstra_greedy.cpp:82</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.svg" width="375" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacegreedy__algorithms_1_1dijkstra_html_af6cb29ca6dc5771439f6ea7262058a71"><div class="ttname"><a href="#af6cb29ca6dc5771439f6ea7262058a71">greedy_algorithms::dijkstra::minimum_distance</a></div><div class="ttdeci">int minimum_distance(std::vector&lt; int &gt; mdist, std::vector&lt; bool &gt; vset, int V)</div><div class="ttdoc">Utility function that finds the vertex with the minimum distance in mdist.</div><div class="ttdef"><b>Definition</b> <a href="../../da/de8/dijkstra__greedy_8cpp_source.html#l00082">dijkstra_greedy.cpp:82</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af6cb29ca6dc5771439f6ea7262058a71" name="af6cb29ca6dc5771439f6ea7262058a71"></a>
@@ -213,12 +226,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">int greedy_algorithms::dijkstra::minimum_distance </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;</td>          <td class="paramname"><span class="paramname"><em>mdist</em></span>, </td>
+          <td class="paramtype">std::vector&lt; int &gt;</td>          <td class="paramname"><span class="paramname"><em>mdist</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt;</td>          <td class="paramname"><span class="paramname"><em>vset</em></span>, </td>
+          <td class="paramtype">std::vector&lt; bool &gt;</td>          <td class="paramname"><span class="paramname"><em>vset</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -238,6 +251,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>index of the vertex with the minimum distance </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html#l00082">82</a> of file <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html">dijkstra_greedy.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   82</span>                                                                        {</div>
 <div class="line"><span class="lineno">   83</span>    <span class="keywordtype">int</span> minVal = INT_MAX, minInd = 0;</div>
 <div class="line"><span class="lineno">   84</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
@@ -261,7 +276,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void greedy_algorithms::dijkstra::print </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;</td>          <td class="paramname"><span class="paramname"><em>dist</em></span>, </td>
+          <td class="paramtype">std::vector&lt; int &gt;</td>          <td class="paramname"><span class="paramname"><em>dist</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -281,18 +296,19 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html#l00104">104</a> of file <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html">dijkstra_greedy.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  104</span>                                       {</div>
-<div class="line"><span class="lineno">  105</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nVertex  Distance\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  105</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nVertex  Distance\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  106</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
 <div class="line"><span class="lineno">  107</span>        <span class="keywordflow">if</span> (dist[i] &lt; INT_MAX) {</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> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; dist[i] &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  108</span>            std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; dist[i] &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  109</span>        }</div>
 <div class="line"><span class="lineno">  110</span>        <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  111</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;\tINF&quot;</span> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  111</span>            std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;\tINF&quot;</span> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  112</span>        }</div>
 <div class="line"><span class="lineno">  113</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><!-- fragment -->
 </div>
 </div>
diff --git a/d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.map b/d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.map
deleted file mode 100644
index d7dd5dcda..000000000
--- a/d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="greedy_algorithms::dijkstra::dijkstra" name="greedy_algorithms::dijkstra::dijkstra">
-<area shape="rect" id="Node000001" title="The main function that finds the shortest path from a given source to all other vertices using Dijkst..." alt="" coords="5,39,141,79"/>
-<area shape="rect" id="Node000002" href="$d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71" title="Utility function that finds the vertex with the minimum distance in mdist." alt="" coords="189,5,369,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="140,45,173,40,174,45,141,51"/>
-<area shape="rect" id="Node000003" href="$d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8" title="Utility function to print the distances to vertices." alt="" coords="211,71,346,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="141,67,196,75,195,81,140,72"/>
-</map>
diff --git a/d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.md5 b/d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.md5
deleted file mode 100644
index f221a54cd..000000000
--- a/d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6a887c459b8903bd6972c5ee7fc6d05b
\ No newline at end of file
diff --git a/d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.svg b/d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.svg
deleted file mode 100644
index e400def88..000000000
--- a/d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph.svg
+++ /dev/null
@@ -1,86 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: greedy_algorithms::dijkstra::dijkstra Pages: 1 -->
-<svg width="281pt" height="88pt"
- viewBox="0.00 0.00 280.75 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>greedy_algorithms::dijkstra::dijkstra</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function that finds the shortest path from a given source to all other vertices using Dijkst...">
-<polygon fill="#999999" stroke="#666666" points="101.5,-54.5 0,-54.5 0,-24 101.5,-24 101.5,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="50.75" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">dijkstra::dijkstra</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71" target="_top" xlink:title="Utility function that finds the vertex with the minimum distance in mdist.">
-<polygon fill="white" stroke="#666666" points="272.75,-79.5 137.5,-79.5 137.5,-49 272.75,-49 272.75,-79.5"/>
-<text text-anchor="start" x="145.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="205.12" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">dijkstra::minimum_distance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.64,-47.44C109.46,-48.72 117.7,-50.07 125.97,-51.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.3,-54.86 135.73,-53.03 126.43,-47.96 125.3,-54.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8" target="_top" xlink:title="Utility function to print the distances to vertices.">
-<polygon fill="white" stroke="#666666" points="255.88,-30.5 154.38,-30.5 154.38,0 255.88,0 255.88,-30.5"/>
-<text text-anchor="start" x="162.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="205.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dijkstra::print</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.64,-31.39C114.8,-29.32 129.15,-27.06 142.83,-24.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.29,-28.37 152.62,-23.36 142.2,-21.46 143.29,-28.37"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph_org.svg b/d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph_org.svg
deleted file mode 100644
index 7ab3f586d..000000000
--- a/d2/d2f/namespacegreedy__algorithms_1_1dijkstra_af915876d0ca33cc71a6a6191a8cd3ccd_cgraph_org.svg
+++ /dev/null
@@ -1,60 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: greedy_algorithms::dijkstra::dijkstra Pages: 1 -->
-<svg width="281pt" height="88pt"
- viewBox="0.00 0.00 280.75 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>greedy_algorithms::dijkstra::dijkstra</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function that finds the shortest path from a given source to all other vertices using Dijkst...">
-<polygon fill="#999999" stroke="#666666" points="101.5,-54.5 0,-54.5 0,-24 101.5,-24 101.5,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="50.75" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">dijkstra::dijkstra</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71" target="_top" xlink:title="Utility function that finds the vertex with the minimum distance in mdist.">
-<polygon fill="white" stroke="#666666" points="272.75,-79.5 137.5,-79.5 137.5,-49 272.75,-49 272.75,-79.5"/>
-<text text-anchor="start" x="145.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="205.12" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">dijkstra::minimum_distance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.64,-47.44C109.46,-48.72 117.7,-50.07 125.97,-51.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.3,-54.86 135.73,-53.03 126.43,-47.96 125.3,-54.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8" target="_top" xlink:title="Utility function to print the distances to vertices.">
-<polygon fill="white" stroke="#666666" points="255.88,-30.5 154.38,-30.5 154.38,0 255.88,0 255.88,-30.5"/>
-<text text-anchor="start" x="162.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="205.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dijkstra::print</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.64,-31.39C114.8,-29.32 129.15,-27.06 142.83,-24.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.29,-28.37 152.62,-23.36 142.2,-21.46 143.29,-28.37"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d36/structgeometry_1_1jarvis_1_1_point-members.html b/d2/d36/structgeometry_1_1jarvis_1_1_point-members.html
index f32c212df..ee46f0b6f 100644
--- a/d2/d36/structgeometry_1_1jarvis_1_1_point-members.html
+++ b/d2/d36/structgeometry_1_1jarvis_1_1_point-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d2/d3b/namespaceqr__algorithm.html b/d2/d3b/namespaceqr__algorithm.html
index 054fce43b..3eb37c82c 100644
--- a/d2/d3b/namespaceqr__algorithm.html
+++ b/d2/d3b/namespaceqr__algorithm.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: qr_algorithm Namespace Reference</title>
+<title>TheAlgorithms/C++: qr_algorithm Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -116,24 +133,24 @@ $(function(){initNavTree('d2/d3b/namespaceqr__algorithm.html','../../'); initRes
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:adfbdf47277c8cfee229b05b72f1f7834" id="r_adfbdf47277c8cfee229b05b72f1f7834"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:adfbdf47277c8cfee229b05b72f1f7834"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#adfbdf47277c8cfee229b05b72f1f7834">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; const &amp;v)</td></tr>
+<tr class="memitem:adfbdf47277c8cfee229b05b72f1f7834"><td class="memTemplItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#adfbdf47277c8cfee229b05b72f1f7834">operator&lt;&lt;</a> (std::ostream &amp;out, std::valarray&lt; std::valarray&lt; T &gt; &gt; const &amp;v)</td></tr>
 <tr class="separator:adfbdf47277c8cfee229b05b72f1f7834"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a257425cb2365359da51c6fe6741834d8" id="r_a257425cb2365359da51c6fe6741834d8"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a257425cb2365359da51c6fe6741834d8"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a257425cb2365359da51c6fe6741834d8">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; const &amp;v)</td></tr>
+<tr class="memitem:a257425cb2365359da51c6fe6741834d8"><td class="memTemplItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a257425cb2365359da51c6fe6741834d8">operator&lt;&lt;</a> (std::ostream &amp;out, std::valarray&lt; T &gt; const &amp;v)</td></tr>
 <tr class="separator:a257425cb2365359da51c6fe6741834d8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a8ea313a1a1b5f9d0e3e332c29c6446ec" id="r_a8ea313a1a1b5f9d0e3e332c29c6446ec"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a8ea313a1a1b5f9d0e3e332c29c6446ec"><td class="memTemplItemLeft" align="right" valign="top">double&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a8ea313a1a1b5f9d0e3e332c29c6446ec">vector_dot</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;a, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;b)</td></tr>
+<tr class="memitem:a8ea313a1a1b5f9d0e3e332c29c6446ec"><td class="memTemplItemLeft" align="right" valign="top">double&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a8ea313a1a1b5f9d0e3e332c29c6446ec">vector_dot</a> (const std::valarray&lt; T &gt; &amp;a, const std::valarray&lt; T &gt; &amp;b)</td></tr>
 <tr class="separator:a8ea313a1a1b5f9d0e3e332c29c6446ec"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ad16da2183db22378435042f26af43d5f" id="r_ad16da2183db22378435042f26af43d5f"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ad16da2183db22378435042f26af43d5f"><td class="memTemplItemLeft" align="right" valign="top">double&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ad16da2183db22378435042f26af43d5f">vector_mag</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;a)</td></tr>
+<tr class="memitem:ad16da2183db22378435042f26af43d5f"><td class="memTemplItemLeft" align="right" valign="top">double&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ad16da2183db22378435042f26af43d5f">vector_mag</a> (const std::valarray&lt; T &gt; &amp;a)</td></tr>
 <tr class="separator:ad16da2183db22378435042f26af43d5f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a6d3c7dce1f142141f509d09f6c0e25dc" id="r_a6d3c7dce1f142141f509d09f6c0e25dc"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a6d3c7dce1f142141f509d09f6c0e25dc"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a6d3c7dce1f142141f509d09f6c0e25dc">vector_proj</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;a, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;b)</td></tr>
+<tr class="memitem:a6d3c7dce1f142141f509d09f6c0e25dc"><td class="memTemplItemLeft" align="right" valign="top">std::valarray&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a6d3c7dce1f142141f509d09f6c0e25dc">vector_proj</a> (const std::valarray&lt; T &gt; &amp;a, const std::valarray&lt; T &gt; &amp;b)</td></tr>
 <tr class="separator:a6d3c7dce1f142141f509d09f6c0e25dc"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a73ce637634fc49e1d10d190eb388ebf1" id="r_a73ce637634fc49e1d10d190eb388ebf1"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a73ce637634fc49e1d10d190eb388ebf1"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a73ce637634fc49e1d10d190eb388ebf1">qr_decompose</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; *Q, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; *R)</td></tr>
+<tr class="memitem:a73ce637634fc49e1d10d190eb388ebf1"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a73ce637634fc49e1d10d190eb388ebf1">qr_decompose</a> (const std::valarray&lt; std::valarray&lt; T &gt; &gt; &amp;A, std::valarray&lt; std::valarray&lt; T &gt; &gt; *Q, std::valarray&lt; std::valarray&lt; T &gt; &gt; *R)</td></tr>
 <tr class="separator:a73ce637634fc49e1d10d190eb388ebf1"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a28e2fa3e803abaea6c568dc45d69d8cc" id="r_a28e2fa3e803abaea6c568dc45d69d8cc"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a28e2fa3e803abaea6c568dc45d69d8cc">eigen_values</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *A, bool print_intermediates=false)</td></tr>
+<tr class="memitem:a28e2fa3e803abaea6c568dc45d69d8cc" id="r_a28e2fa3e803abaea6c568dc45d69d8cc"><td class="memItemLeft" align="right" valign="top">std::valarray&lt; double &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a28e2fa3e803abaea6c568dc45d69d8cc">eigen_values</a> (std::valarray&lt; std::valarray&lt; double &gt; &gt; *A, bool print_intermediates=false)</td></tr>
 <tr class="separator:a28e2fa3e803abaea6c568dc45d69d8cc"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -146,9 +163,9 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; qr_algorithm::eigen_values </td>
+          <td class="memname">std::valarray&lt; double &gt; qr_algorithm::eigen_values </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">std::valarray&lt; std::valarray&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -183,27 +200,29 @@ Functions</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d75/qr__eigen__values_8cpp_source.html#l00098">98</a> of file <a class="el" href="../../de/d75/qr__eigen__values_8cpp_source.html">qr_eigen_values.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   99</span>                                                                     {</div>
 <div class="line"><span class="lineno">  100</span>    <span class="keywordtype">int</span> rows = A-&gt;size();</div>
 <div class="line"><span class="lineno">  101</span>    <span class="keywordtype">int</span> columns = rows;</div>
 <div class="line"><span class="lineno">  102</span>    <span class="keywordtype">int</span> counter = 0, num_eigs = rows - 1;</div>
 <div class="line"><span class="lineno">  103</span>    <span class="keywordtype">double</span> last_eig = 0;</div>
 <div class="line"><span class="lineno">  104</span> </div>
-<div class="line"><span class="lineno">  105</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;std::valarray&lt;double&gt;</a>&gt; Q(rows);</div>
-<div class="line"><span class="lineno">  106</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;std::valarray&lt;double&gt;</a>&gt; R(columns);</div>
+<div class="line"><span class="lineno">  105</span>    std::valarray&lt;std::valarray&lt;double&gt;&gt; Q(rows);</div>
+<div class="line"><span class="lineno">  106</span>    std::valarray&lt;std::valarray&lt;double&gt;&gt; R(columns);</div>
 <div class="line"><span class="lineno">  107</span> </div>
 <div class="line"><span class="lineno">  108</span>    <span class="comment">/* number of eigen values = matrix size */</span></div>
-<div class="line"><span class="lineno">  109</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> eigen_vals(rows);</div>
+<div class="line"><span class="lineno">  109</span>    std::valarray&lt;double&gt; eigen_vals(rows);</div>
 <div class="line"><span class="lineno">  110</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; rows; i++) {</div>
-<div class="line"><span class="lineno">  111</span>        Q[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(columns);</div>
-<div class="line"><span class="lineno">  112</span>        R[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(columns);</div>
+<div class="line"><span class="lineno">  111</span>        Q[i] = std::valarray&lt;double&gt;(columns);</div>
+<div class="line"><span class="lineno">  112</span>        R[i] = std::valarray&lt;double&gt;(columns);</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>    <span class="comment">/* continue till all eigen values are found */</span></div>
 <div class="line"><span class="lineno">  116</span>    <span class="keywordflow">while</span> (num_eigs &gt; 0) {</div>
 <div class="line"><span class="lineno">  117</span>        <span class="comment">/* iterate with QR decomposition */</span></div>
 <div class="line"><span class="lineno">  118</span>        <span class="keywordflow">while</span> (std::abs(A[0][num_eigs][num_eigs - 1]) &gt;</div>
-<div class="line"><span class="lineno">  119</span>               <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">std::numeric_limits&lt;double&gt;::epsilon</a>()) {</div>
+<div class="line"><span class="lineno">  119</span>               std::numeric_limits&lt;double&gt;::epsilon()) {</div>
 <div class="line"><span class="lineno">  120</span>            <span class="comment">// initial approximation = last diagonal element</span></div>
 <div class="line"><span class="lineno">  121</span>            last_eig = A[0][num_eigs][num_eigs];</div>
 <div class="line"><span class="lineno">  122</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; rows; i++) {</div>
@@ -213,10 +232,10 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  126</span>            qr_decompose(*A, &amp;Q, &amp;R);</div>
 <div class="line"><span class="lineno">  127</span> </div>
 <div class="line"><span class="lineno">  128</span>            <span class="keywordflow">if</span> (print_intermediates) {</div>
-<div class="line"><span class="lineno">  129</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; *A &lt;&lt; <span class="stringliteral">&quot;\n&quot;</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> &lt;&lt; Q &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  131</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; R &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  132</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fprintf.html">printf</a>(<span class="stringliteral">&quot;-------------------- %d ---------------------\n&quot;</span>,</div>
+<div class="line"><span class="lineno">  129</span>                std::cout &lt;&lt; *A &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  130</span>                std::cout &lt;&lt; Q &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  131</span>                std::cout &lt;&lt; R &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  132</span>                printf(<span class="stringliteral">&quot;-------------------- %d ---------------------\n&quot;</span>,</div>
 <div class="line"><span class="lineno">  133</span>                       ++counter);</div>
 <div class="line"><span class="lineno">  134</span>            }</div>
 <div class="line"><span class="lineno">  135</span> </div>
@@ -232,9 +251,9 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  145</span>        eigen_vals[num_eigs] = last_eig;</div>
 <div class="line"><span class="lineno">  146</span>        <span class="comment">// A[0][num_eigs][num_eigs];</span></div>
 <div class="line"><span class="lineno">  147</span>        <span class="keywordflow">if</span> (print_intermediates) {</div>
-<div class="line"><span class="lineno">  148</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;========================\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  149</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Eigen value: &quot;</span> &lt;&lt; last_eig &lt;&lt; <span class="stringliteral">&quot;,\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  150</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;========================\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  148</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;========================\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  149</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Eigen value: &quot;</span> &lt;&lt; last_eig &lt;&lt; <span class="stringliteral">&quot;,\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  150</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;========================\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  151</span>        }</div>
 <div class="line"><span class="lineno">  152</span> </div>
 <div class="line"><span class="lineno">  153</span>        num_eigs--;</div>
@@ -244,23 +263,14 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  157</span>    eigen_vals[0] = A[0][0][0];</div>
 <div class="line"><span class="lineno">  158</span> </div>
 <div class="line"><span class="lineno">  159</span>    <span class="keywordflow">if</span> (print_intermediates) {</div>
-<div class="line"><span class="lineno">  160</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; Q &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  161</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; R &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  160</span>        std::cout &lt;&lt; Q &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  161</span>        std::cout &lt;&lt; R &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  162</span>    }</div>
 <div class="line"><span class="lineno">  163</span> </div>
 <div class="line"><span class="lineno">  164</span>    <span class="keywordflow">return</span> eigen_vals;</div>
 <div class="line"><span class="lineno">  165</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="afprintf_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/c/fprintf.html">std::printf</a></div><div class="ttdeci">T printf(T... args)</div></div>
-<div class="ttc" id="anumeric_limits_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">std::numeric_limits</a></div></div>
-<div class="ttc" id="aqr__eigen__values_8cpp_html_abb8bf4c55e10685a5eb2ad3797fde1ae"><div class="ttname"><a href="../../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae">mat_mul</a></div><div class="ttdeci">void mat_mul(const std::valarray&lt; std::valarray&lt; double &gt; &gt; &amp;A, const std::valarray&lt; std::valarray&lt; double &gt; &gt; &amp;B, std::valarray&lt; std::valarray&lt; double &gt; &gt; *OUT)</div><div class="ttdef"><b>Definition</b> qr_eigen_values.cpp:54</div></div>
-<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.svg" width="100%" height="382"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aqr__eigen__values_8cpp_html_abb8bf4c55e10685a5eb2ad3797fde1ae"><div class="ttname"><a href="../../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae">mat_mul</a></div><div class="ttdeci">void mat_mul(const std::valarray&lt; std::valarray&lt; double &gt; &gt; &amp;A, const std::valarray&lt; std::valarray&lt; double &gt; &gt; &amp;B, std::valarray&lt; std::valarray&lt; double &gt; &gt; *OUT)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d75/qr__eigen__values_8cpp_source.html#l00054">qr_eigen_values.cpp:54</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="adfbdf47277c8cfee229b05b72f1f7834" name="adfbdf47277c8cfee229b05b72f1f7834"></a>
@@ -272,43 +282,35 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; qr_algorithm::operator&lt;&lt; </td>
+          <td class="memname">std::ostream &amp; qr_algorithm::operator&lt;&lt; </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
+          <td class="paramtype">std::ostream &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>v</em></span>&#160;)</td>
+          <td class="paramtype">std::valarray&lt; std::valarray&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>v</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>operator to print a matrix </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d68/qr__decompose_8h_source.html#l00033">33</a> of file <a class="el" href="../../d4/d68/qr__decompose_8h_source.html">qr_decompose.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   34</span>                                                               {</div>
 <div class="line"><span class="lineno">   35</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> width = 12;</div>
 <div class="line"><span class="lineno">   36</span>    <span class="keyword">const</span> <span class="keywordtype">char</span> separator = <span class="charliteral">&#39; &#39;</span>;</div>
 <div class="line"><span class="lineno">   37</span> </div>
-<div class="line"><span class="lineno">   38</span>    out.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">precision</a>(4);</div>
+<div class="line"><span class="lineno">   38</span>    out.precision(4);</div>
 <div class="line"><span class="lineno">   39</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; v.size(); row++) {</div>
 <div class="line"><span class="lineno">   40</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; v[row].size(); col++)</div>
-<div class="line"><span class="lineno">   41</span>            out &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::right</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(width) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">std::setfill</a>(separator)</div>
+<div class="line"><span class="lineno">   41</span>            out &lt;&lt; std::right &lt;&lt; std::setw(width) &lt;&lt; std::setfill(separator)</div>
 <div class="line"><span class="lineno">   42</span>                &lt;&lt; v[row][col];</div>
-<div class="line"><span class="lineno">   43</span>        out &lt;&lt; <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">   43</span>        out &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   44</span>    }</div>
 <div class="line"><span class="lineno">   45</span> </div>
 <div class="line"><span class="lineno">   46</span>    <span class="keywordflow">return</span> out;</div>
 <div class="line"><span class="lineno">   47</span>}</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="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::right</a></div><div class="ttdeci">T right(T... args)</div></div>
-<div class="ttc" id="aprecision_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">std::ostream::precision</a></div><div class="ttdeci">T precision(T... args)</div></div>
-<div class="ttc" id="asetfill_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">std::setfill</a></div><div class="ttdeci">T setfill(T... args)</div></div>
-<div class="ttc" id="asetw_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a></div><div class="ttdeci">T setw(T... args)</div></div>
-</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="../../d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph.svg" width="376" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a257425cb2365359da51c6fe6741834d8" name="a257425cb2365359da51c6fe6741834d8"></a>
@@ -320,36 +322,33 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; qr_algorithm::operator&lt;&lt; </td>
+          <td class="memname">std::ostream &amp; qr_algorithm::operator&lt;&lt; </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
+          <td class="paramtype">std::ostream &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>v</em></span>&#160;)</td>
+          <td class="paramtype">std::valarray&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>v</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>operator to print a vector </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d68/qr__decompose_8h_source.html#l00053">53</a> of file <a class="el" href="../../d4/d68/qr__decompose_8h_source.html">qr_decompose.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   53</span>                                                                 {</div>
 <div class="line"><span class="lineno">   54</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> width = 10;</div>
 <div class="line"><span class="lineno">   55</span>    <span class="keyword">const</span> <span class="keywordtype">char</span> separator = <span class="charliteral">&#39; &#39;</span>;</div>
 <div class="line"><span class="lineno">   56</span> </div>
-<div class="line"><span class="lineno">   57</span>    out.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">precision</a>(4);</div>
+<div class="line"><span class="lineno">   57</span>    out.precision(4);</div>
 <div class="line"><span class="lineno">   58</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; v.size(); row++) {</div>
-<div class="line"><span class="lineno">   59</span>        out &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::right</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(width) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">std::setfill</a>(separator)</div>
+<div class="line"><span class="lineno">   59</span>        out &lt;&lt; std::right &lt;&lt; std::setw(width) &lt;&lt; std::setfill(separator)</div>
 <div class="line"><span class="lineno">   60</span>            &lt;&lt; v[row];</div>
 <div class="line"><span class="lineno">   61</span>    }</div>
 <div class="line"><span class="lineno">   62</span> </div>
 <div class="line"><span class="lineno">   63</span>    <span class="keywordflow">return</span> out;</div>
 <div class="line"><span class="lineno">   64</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.svg" width="376" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a73ce637634fc49e1d10d190eb388ebf1" name="a73ce637634fc49e1d10d190eb388ebf1"></a>
@@ -363,17 +362,17 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void qr_algorithm::qr_decompose </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">const std::valarray&lt; std::valarray&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>Q</em></span>, </td>
+          <td class="paramtype">std::valarray&lt; std::valarray&lt; T &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>Q</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>R</em></span>&#160;)</td>
+          <td class="paramtype">std::valarray&lt; std::valarray&lt; T &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>R</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -408,12 +407,14 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d68/qr__decompose_8h_source.html#l00146">146</a> of file <a class="el" href="../../d4/d68/qr__decompose_8h_source.html">qr_decompose.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  150</span>  {</div>
-<div class="line"><span class="lineno">  151</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> ROWS = A.size();        <span class="comment">// number of rows of A</span></div>
-<div class="line"><span class="lineno">  152</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> COLUMNS = A[0].size();  <span class="comment">// number of columns of A</span></div>
-<div class="line"><span class="lineno">  153</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> col_vector(ROWS);</div>
-<div class="line"><span class="lineno">  154</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> col_vector2(ROWS);</div>
-<div class="line"><span class="lineno">  155</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> tmp_vector(ROWS);</div>
+<div class="line"><span class="lineno">  151</span>    std::size_t ROWS = A.size();        <span class="comment">// number of rows of A</span></div>
+<div class="line"><span class="lineno">  152</span>    std::size_t COLUMNS = A[0].size();  <span class="comment">// number of columns of A</span></div>
+<div class="line"><span class="lineno">  153</span>    std::valarray&lt;T&gt; col_vector(ROWS);</div>
+<div class="line"><span class="lineno">  154</span>    std::valarray&lt;T&gt; col_vector2(ROWS);</div>
+<div class="line"><span class="lineno">  155</span>    std::valarray&lt;T&gt; tmp_vector(ROWS);</div>
 <div class="line"><span class="lineno">  156</span> </div>
 <div class="line"><span class="lineno">  157</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; COLUMNS; i++) {</div>
 <div class="line"><span class="lineno">  158</span>        <span class="comment">/* for each column =&gt; R is a square matrix of NxN */</span></div>
@@ -466,18 +467,12 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  205</span>        }</div>
 <div class="line"><span class="lineno">  206</span>    }</div>
 <div class="line"><span class="lineno">  207</span>}</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:232</div></div>
-<div class="ttc" id="anamespaceqr__algorithm_html_a6d3c7dce1f142141f509d09f6c0e25dc"><div class="ttname"><a href="#a6d3c7dce1f142141f509d09f6c0e25dc">qr_algorithm::vector_proj</a></div><div class="ttdeci">std::valarray&lt; T &gt; vector_proj(const std::valarray&lt; T &gt; &amp;a, const std::valarray&lt; T &gt; &amp;b)</div><div class="ttdef"><b>Definition</b> qr_decompose.h:104</div></div>
-<div class="ttc" id="anamespaceqr__algorithm_html_ad16da2183db22378435042f26af43d5f"><div class="ttname"><a href="#ad16da2183db22378435042f26af43d5f">qr_algorithm::vector_mag</a></div><div class="ttdeci">double vector_mag(const std::valarray&lt; T &gt; &amp;a)</div><div class="ttdef"><b>Definition</b> qr_decompose.h:92</div></div>
-<div class="ttc" id="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></div></div>
-<div class="ttc" id="avector__cross__product_8cpp_html_a4b2a9757a87c18e1642d72410ecfaba8"><div class="ttname"><a href="../../df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8">math::vector_cross::mag</a></div><div class="ttdeci">double mag(const std::array&lt; double, 3 &gt; &amp;vec)</div><div class="ttdoc">Calculates the magnitude of the mathematical vector from it's direction ratios.</div><div class="ttdef"><b>Definition</b> vector_cross_product.cpp:83</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d3b/namespaceqr__algorithm_a73ce637634fc49e1d10d190eb388ebf1_cgraph.svg" width="622" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00232">vector_ops.hpp:232</a></div></div>
+<div class="ttc" id="anamespaceqr__algorithm_html_a6d3c7dce1f142141f509d09f6c0e25dc"><div class="ttname"><a href="#a6d3c7dce1f142141f509d09f6c0e25dc">qr_algorithm::vector_proj</a></div><div class="ttdeci">std::valarray&lt; T &gt; vector_proj(const std::valarray&lt; T &gt; &amp;a, const std::valarray&lt; T &gt; &amp;b)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d68/qr__decompose_8h_source.html#l00104">qr_decompose.h:104</a></div></div>
+<div class="ttc" id="anamespaceqr__algorithm_html_ad16da2183db22378435042f26af43d5f"><div class="ttname"><a href="#ad16da2183db22378435042f26af43d5f">qr_algorithm::vector_mag</a></div><div class="ttdeci">double vector_mag(const std::valarray&lt; T &gt; &amp;a)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d68/qr__decompose_8h_source.html#l00092">qr_decompose.h:92</a></div></div>
+<div class="ttc" id="avector__cross__product_8cpp_html_a4b2a9757a87c18e1642d72410ecfaba8"><div class="ttname"><a href="../../df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8">math::vector_cross::mag</a></div><div class="ttdeci">double mag(const std::array&lt; double, 3 &gt; &amp;vec)</div><div class="ttdoc">Calculates the magnitude of the mathematical vector from it's direction ratios.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d66/vector__cross__product_8cpp_source.html#l00083">vector_cross_product.cpp:83</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a8ea313a1a1b5f9d0e3e332c29c6446ec" name="a8ea313a1a1b5f9d0e3e332c29c6446ec"></a>
@@ -494,12 +489,12 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">double qr_algorithm::vector_dot </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
+          <td class="paramtype">const std::valarray&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>b</em></span>&#160;)</td>
+          <td class="paramtype">const std::valarray&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>b</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -511,6 +506,8 @@ template&lt;typename T &gt; </div>
 <p>Compute dot product of two vectors of equal lengths</p>
 <p>If \(\vec{a}=\left[a_0,a_1,a_2,...,a_L\right]\) and \(\vec{b}=\left[b_0,b_1,b_1,...,b_L\right]\) then \(\vec{a}\cdot\vec{b}=\displaystyle\sum_{i=0}^L a_i\times b_i\)</p>
 <dl class="section return"><dt>Returns</dt><dd>\(\vec{a}\cdot\vec{b}\) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d68/qr__decompose_8h_source.html#l00076">76</a> of file <a class="el" href="../../d4/d68/qr__decompose_8h_source.html">qr_decompose.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   76</span>                                                                           {</div>
 <div class="line"><span class="lineno">   77</span>    <span class="keywordflow">return</span> (a * b).sum();</div>
 <div class="line"><span class="lineno">   78</span>    <span class="comment">// could also use following</span></div>
@@ -534,7 +531,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">double qr_algorithm::vector_mag </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span></td><td>)</td>
+          <td class="paramtype">const std::valarray&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -547,18 +544,14 @@ template&lt;typename T &gt; </div>
 <p>Compute magnitude of vector.</p>
 <p>If \(\vec{a}=\left[a_0,a_1,a_2,...,a_L\right]\) then \(\left|\vec{a}\right|=\sqrt{\displaystyle\sum_{i=0}^L a_i^2}\)</p>
 <dl class="section return"><dt>Returns</dt><dd>\(\left|\vec{a}\right|\) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d68/qr__decompose_8h_source.html#l00092">92</a> of file <a class="el" href="../../d4/d68/qr__decompose_8h_source.html">qr_decompose.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   92</span>                                                  {</div>
 <div class="line"><span class="lineno">   93</span>    <span class="keywordtype">double</span> dot = <a class="code hl_function" href="#a8ea313a1a1b5f9d0e3e332c29c6446ec">vector_dot</a>(a, a);</div>
-<div class="line"><span class="lineno">   94</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(dot);</div>
+<div class="line"><span class="lineno">   94</span>    <span class="keywordflow">return</span> std::sqrt(dot);</div>
 <div class="line"><span class="lineno">   95</span>}</div>
-<div class="ttc" id="anamespaceqr__algorithm_html_a8ea313a1a1b5f9d0e3e332c29c6446ec"><div class="ttname"><a href="#a8ea313a1a1b5f9d0e3e332c29c6446ec">qr_algorithm::vector_dot</a></div><div class="ttdeci">double vector_dot(const std::valarray&lt; T &gt; &amp;a, const std::valarray&lt; T &gt; &amp;b)</div><div class="ttdef"><b>Definition</b> qr_decompose.h:76</div></div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.svg" width="388" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespaceqr__algorithm_html_a8ea313a1a1b5f9d0e3e332c29c6446ec"><div class="ttname"><a href="#a8ea313a1a1b5f9d0e3e332c29c6446ec">qr_algorithm::vector_dot</a></div><div class="ttdeci">double vector_dot(const std::valarray&lt; T &gt; &amp;a, const std::valarray&lt; T &gt; &amp;b)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d68/qr__decompose_8h_source.html#l00076">qr_decompose.h:76</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6d3c7dce1f142141f509d09f6c0e25dc" name="a6d3c7dce1f142141f509d09f6c0e25dc"></a>
@@ -570,14 +563,14 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; qr_algorithm::vector_proj </td>
+          <td class="memname">std::valarray&lt; T &gt; qr_algorithm::vector_proj </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
+          <td class="paramtype">const std::valarray&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>b</em></span>&#160;)</td>
+          <td class="paramtype">const std::valarray&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>b</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -586,13 +579,14 @@ template&lt;typename T &gt; </div>
 </p>
 <dl class="section return"><dt>Returns</dt><dd>NULL if error, otherwise pointer to output </dd></dl>
 <p>check for division by zero using machine epsilon</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d68/qr__decompose_8h_source.html#l00104">104</a> of file <a class="el" href="../../d4/d68/qr__decompose_8h_source.html">qr_decompose.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  105</span>                                                      {</div>
 <div class="line"><span class="lineno">  106</span>    <span class="keywordtype">double</span> num = <a class="code hl_function" href="#a8ea313a1a1b5f9d0e3e332c29c6446ec">vector_dot</a>(a, b);</div>
 <div class="line"><span class="lineno">  107</span>    <span class="keywordtype">double</span> deno = <a class="code hl_function" href="#a8ea313a1a1b5f9d0e3e332c29c6446ec">vector_dot</a>(b, b);</div>
-<div class="line"><span class="lineno">  108</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  109</span><span class="comment">    /*! check for division by zero using machine epsilon */</span></div>
-<div class="line"><span class="lineno">  110</span>    <span class="keywordflow">if</span> (deno &lt;= <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">std::numeric_limits&lt;double&gt;::epsilon</a>()) {</div>
-<div class="line"><span class="lineno">  111</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;[&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;] Possible division by zero\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  108</span> </div>
+<div class="line"><span class="lineno">  110</span>    <span class="keywordflow">if</span> (deno &lt;= std::numeric_limits&lt;double&gt;::epsilon()) {</div>
+<div class="line"><span class="lineno">  111</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;[&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;] Possible division by zero\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  112</span>        <span class="keywordflow">return</span> a;  <span class="comment">// return vector a back</span></div>
 <div class="line"><span class="lineno">  113</span>    }</div>
 <div class="line"><span class="lineno">  114</span> </div>
@@ -600,12 +594,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  116</span> </div>
 <div class="line"><span class="lineno">  117</span>    <span class="keywordflow">return</span> b * scalar;</div>
 <div class="line"><span class="lineno">  118</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d3b/namespaceqr__algorithm_a6d3c7dce1f142141f509d09f6c0e25dc_cgraph.svg" width="384" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.map b/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.map
deleted file mode 100644
index 88b4690df..000000000
--- a/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="qr_algorithm::operator&lt;&lt;" name="qr_algorithm::operator&lt;&lt;">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,80,169,106"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/ios_base/precision.html#" title=" " alt="" coords="217,5,371,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="119,77,216,40,233,34,235,39,218,45,121,82"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/left.html#" title=" " alt="" coords="258,55,330,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="169,80,242,71,242,76,169,85"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setfill.html#" title=" " alt="" coords="255,104,333,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="169,100,240,108,239,113,169,105"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setw.html#" title=" " alt="" coords="256,153,332,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="122,104,218,140,242,148,240,153,216,145,120,109"/>
-</map>
diff --git a/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.md5 b/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.md5
deleted file mode 100644
index d9892e55d..000000000
--- a/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-23e4e78cf3f136e0ea4329cf6536e0d7
\ No newline at end of file
diff --git a/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.svg b/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.svg
deleted file mode 100644
index edb212981..000000000
--- a/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: qr_algorithm::operator&lt;&lt; Pages: 1 -->
-<svg width="282pt" height="138pt"
- viewBox="0.00 0.00 282.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>qr_algorithm::operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="122.5,-74.25 0,-74.25 0,-55 122.5,-55 122.5,-74.25"/>
-<text text-anchor="middle" x="61.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.25,-130.25 158.5,-130.25 158.5,-111 274.25,-111 274.25,-130.25"/>
-<text text-anchor="middle" x="216.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.2,-74.62C105.57,-82.57 133.61,-93.79 158.5,-102.62 162.66,-104.1 167.02,-105.59 171.38,-107.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.13,-110.31 180.72,-110.07 172.3,-103.65 170.13,-110.31"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/left.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.5,-93.25 189.25,-93.25 189.25,-74 243.5,-74 243.5,-93.25"/>
-<text text-anchor="middle" x="216.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::right</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.77,-72.13C141.2,-74.42 160.93,-76.87 177.42,-78.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.94,-82.38 187.29,-80.14 177.8,-75.44 176.94,-82.38"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245.75,-56.25 187,-56.25 187,-37 245.75,-37 245.75,-56.25"/>
-<text text-anchor="middle" x="216.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.77,-57.51C140.53,-55.42 159.49,-53.19 175.61,-51.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.75,-54.81 185.27,-50.16 174.93,-47.86 175.75,-54.81"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="244.62,-19.25 188.12,-19.25 188.12,0 244.62,0 244.62,-19.25"/>
-<text text-anchor="middle" x="216.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.03,-54.63C106.38,-46.93 134,-36.2 158.5,-27.62 164.43,-25.55 170.74,-23.45 176.91,-21.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.87,-24.82 186.34,-18.45 175.75,-18.15 177.87,-24.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph_org.svg b/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph_org.svg
deleted file mode 100644
index 9d8e3fcde..000000000
--- a/d2/d3b/namespaceqr__algorithm_a257425cb2365359da51c6fe6741834d8_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: qr_algorithm::operator&lt;&lt; Pages: 1 -->
-<svg width="282pt" height="138pt"
- viewBox="0.00 0.00 282.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>qr_algorithm::operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="122.5,-74.25 0,-74.25 0,-55 122.5,-55 122.5,-74.25"/>
-<text text-anchor="middle" x="61.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.25,-130.25 158.5,-130.25 158.5,-111 274.25,-111 274.25,-130.25"/>
-<text text-anchor="middle" x="216.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.2,-74.62C105.57,-82.57 133.61,-93.79 158.5,-102.62 162.66,-104.1 167.02,-105.59 171.38,-107.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.13,-110.31 180.72,-110.07 172.3,-103.65 170.13,-110.31"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/left.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.5,-93.25 189.25,-93.25 189.25,-74 243.5,-74 243.5,-93.25"/>
-<text text-anchor="middle" x="216.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::right</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.77,-72.13C141.2,-74.42 160.93,-76.87 177.42,-78.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.94,-82.38 187.29,-80.14 177.8,-75.44 176.94,-82.38"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245.75,-56.25 187,-56.25 187,-37 245.75,-37 245.75,-56.25"/>
-<text text-anchor="middle" x="216.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.77,-57.51C140.53,-55.42 159.49,-53.19 175.61,-51.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.75,-54.81 185.27,-50.16 174.93,-47.86 175.75,-54.81"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="244.62,-19.25 188.12,-19.25 188.12,0 244.62,0 244.62,-19.25"/>
-<text text-anchor="middle" x="216.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.03,-54.63C106.38,-46.93 134,-36.2 158.5,-27.62 164.43,-25.55 170.74,-23.45 176.91,-21.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.87,-24.82 186.34,-18.45 175.75,-18.15 177.87,-24.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.map b/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.map
deleted file mode 100644
index 727a19451..000000000
--- a/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="qr_algorithm::eigen_values" name="qr_algorithm::eigen_values">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,23,137,64"/>
-<area shape="rect" id="Node000002" href="$de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae" title=" " alt="" coords="242,5,313,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="136,33,226,22,227,27,137,38"/>
-<area shape="rect" id="Node000003" href="$d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1" title=" " alt="" coords="185,55,370,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="137,48,169,52,169,58,136,54"/>
-<area shape="rect" id="Node000004" href="$d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f" title=" " alt="" coords="418,29,586,55"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="370,54,402,51,403,56,371,60"/>
-<area shape="rect" id="Node000007" href="$d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc" title=" " alt="" coords="420,79,584,104"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="371,75,404,78,404,84,370,80"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="680,29,750,55"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="587,40,665,40,665,45,587,45"/>
-<area shape="rect" id="Node000006" href="$d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" title=" " alt="" coords="634,79,796,104"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="562,53,642,72,641,77,560,58"/>
-<area shape="poly" id="edge7_Node000007_Node000006" title=" " alt="" coords="585,89,619,89,619,94,585,94"/>
-</map>
diff --git a/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.md5 b/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.md5
deleted file mode 100644
index 34100262b..000000000
--- a/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-835c4d7ef55d24567988a9cb0e874083
\ No newline at end of file
diff --git a/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.svg b/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.svg
deleted file mode 100644
index 331c6c507..000000000
--- a/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph.svg
+++ /dev/null
@@ -1,222 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: qr_algorithm::eigen_values Pages: 1 -->
-<!--zoomable 82 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 601;
-var viewHeight = 82;
-var sectionId = 'dynsection-0';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>qr_algorithm::eigen_values</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-60.88 0,-60.88 0,-30.38 98.5,-30.38 98.5,-60.88"/>
-<text text-anchor="start" x="8" y="-47.38" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::eigen</text>
-<text text-anchor="middle" x="49.25" y="-36.12" font-family="Helvetica,sans-Serif" font-size="10.00">_values</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="230.75,-74.25 177.25,-74.25 177.25,-55 230.75,-55 230.75,-74.25"/>
-<text text-anchor="middle" x="204" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.58,-51.64C120.35,-54.35 145.66,-57.49 165.9,-60.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.32,-63.46 175.67,-61.23 166.18,-56.52 165.32,-63.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273.5,-37.25 134.5,-37.25 134.5,-18 273.5,-18 273.5,-37.25"/>
-<text text-anchor="middle" x="204" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::qr_decompose</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.58,-39.93C106.33,-39.02 114.53,-38.05 122.79,-37.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.03,-40.57 132.55,-35.93 122.21,-33.62 123.03,-40.57"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="435.75,-56.25 309.5,-56.25 309.5,-37 435.75,-37 435.75,-56.25"/>
-<text text-anchor="middle" x="372.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_mag</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M273.73,-35.46C281.72,-36.37 289.88,-37.3 297.93,-38.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.35,-41.68 307.69,-39.33 298.15,-34.72 297.35,-41.68"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="434.25,-19.25 311,-19.25 311,0 434.25,0 434.25,-19.25"/>
-<text text-anchor="middle" x="372.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_proj</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M273.73,-20.2C282.12,-19.29 290.7,-18.37 299.14,-17.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.44,-20.94 309.01,-16.39 298.69,-13.98 299.44,-20.94"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="558.25,-56.25 506.25,-56.25 506.25,-37 558.25,-37 558.25,-56.25"/>
-<text text-anchor="middle" x="532.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M435.92,-46.62C455.78,-46.62 477.1,-46.62 494.53,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="494.4,-50.13 504.4,-46.63 494.4,-43.13 494.4,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="592.75,-19.25 471.75,-19.25 471.75,0 592.75,0 592.75,-19.25"/>
-<text text-anchor="middle" x="532.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_dot</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M416.7,-36.51C435.38,-32.13 457.45,-26.95 477.22,-22.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="477.82,-25.76 486.76,-20.07 476.22,-18.95 477.82,-25.76"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge7_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge7_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M434.57,-9.62C442.91,-9.62 451.53,-9.62 460.03,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="459.99,-13.13 469.99,-9.63 459.99,-6.13 459.99,-13.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph_org.svg b/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph_org.svg
deleted file mode 100644
index 16d6c0311..000000000
--- a/d2/d3b/namespaceqr__algorithm_a28e2fa3e803abaea6c568dc45d69d8cc_cgraph_org.svg
+++ /dev/null
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: qr_algorithm::eigen_values Pages: 1 -->
-<svg width="601pt" height="82pt"
- viewBox="0.00 0.00 600.75 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>qr_algorithm::eigen_values</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-60.88 0,-60.88 0,-30.38 98.5,-30.38 98.5,-60.88"/>
-<text text-anchor="start" x="8" y="-47.38" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::eigen</text>
-<text text-anchor="middle" x="49.25" y="-36.12" font-family="Helvetica,sans-Serif" font-size="10.00">_values</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="230.75,-74.25 177.25,-74.25 177.25,-55 230.75,-55 230.75,-74.25"/>
-<text text-anchor="middle" x="204" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.58,-51.64C120.35,-54.35 145.66,-57.49 165.9,-60.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.32,-63.46 175.67,-61.23 166.18,-56.52 165.32,-63.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273.5,-37.25 134.5,-37.25 134.5,-18 273.5,-18 273.5,-37.25"/>
-<text text-anchor="middle" x="204" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::qr_decompose</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.58,-39.93C106.33,-39.02 114.53,-38.05 122.79,-37.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.03,-40.57 132.55,-35.93 122.21,-33.62 123.03,-40.57"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="435.75,-56.25 309.5,-56.25 309.5,-37 435.75,-37 435.75,-56.25"/>
-<text text-anchor="middle" x="372.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_mag</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M273.73,-35.46C281.72,-36.37 289.88,-37.3 297.93,-38.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.35,-41.68 307.69,-39.33 298.15,-34.72 297.35,-41.68"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="434.25,-19.25 311,-19.25 311,0 434.25,0 434.25,-19.25"/>
-<text text-anchor="middle" x="372.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_proj</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M273.73,-20.2C282.12,-19.29 290.7,-18.37 299.14,-17.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.44,-20.94 309.01,-16.39 298.69,-13.98 299.44,-20.94"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="558.25,-56.25 506.25,-56.25 506.25,-37 558.25,-37 558.25,-56.25"/>
-<text text-anchor="middle" x="532.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M435.92,-46.62C455.78,-46.62 477.1,-46.62 494.53,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="494.4,-50.13 504.4,-46.63 494.4,-43.13 494.4,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="592.75,-19.25 471.75,-19.25 471.75,0 592.75,0 592.75,-19.25"/>
-<text text-anchor="middle" x="532.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_dot</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M416.7,-36.51C435.38,-32.13 457.45,-26.95 477.22,-22.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="477.82,-25.76 486.76,-20.07 476.22,-18.95 477.82,-25.76"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge7_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge7_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M434.57,-9.62C442.91,-9.62 451.53,-9.62 460.03,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="459.99,-13.13 469.99,-9.63 459.99,-6.13 459.99,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d3b/namespaceqr__algorithm_a6d3c7dce1f142141f509d09f6c0e25dc_cgraph.map b/d2/d3b/namespaceqr__algorithm_a6d3c7dce1f142141f509d09f6c0e25dc_cgraph.map
deleted file mode 100644
index f1eddd910..000000000
--- a/d2/d3b/namespaceqr__algorithm_a6d3c7dce1f142141f509d09f6c0e25dc_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="qr_algorithm::vector_proj" name="qr_algorithm::vector_proj">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,170,31"/>
-<area shape="rect" id="Node000002" href="$d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" title=" " alt="" coords="218,5,379,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="170,16,202,16,202,21,170,21"/>
-</map>
diff --git a/d2/d3b/namespaceqr__algorithm_a6d3c7dce1f142141f509d09f6c0e25dc_cgraph.md5 b/d2/d3b/namespaceqr__algorithm_a6d3c7dce1f142141f509d09f6c0e25dc_cgraph.md5
deleted file mode 100644
index 092596690..000000000
--- a/d2/d3b/namespaceqr__algorithm_a6d3c7dce1f142141f509d09f6c0e25dc_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d482aea59b7bc06ab150c5cb942b2a81
\ No newline at end of file
diff --git a/d2/d3b/namespaceqr__algorithm_a6d3c7dce1f142141f509d09f6c0e25dc_cgraph.svg b/d2/d3b/namespaceqr__algorithm_a6d3c7dce1f142141f509d09f6c0e25dc_cgraph.svg
deleted file mode 100644
index b3617d170..000000000
--- a/d2/d3b/namespaceqr__algorithm_a6d3c7dce1f142141f509d09f6c0e25dc_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: qr_algorithm::vector_proj Pages: 1 -->
-<svg width="288pt" height="27pt"
- viewBox="0.00 0.00 288.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>qr_algorithm::vector_proj</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="123.25,-19.25 0,-19.25 0,0 123.25,0 123.25,-19.25"/>
-<text text-anchor="middle" x="61.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_proj</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="280.25,-19.25 159.25,-19.25 159.25,0 280.25,0 280.25,-19.25"/>
-<text text-anchor="middle" x="219.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_dot</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M123.43,-9.62C131.35,-9.62 139.51,-9.62 147.58,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.36,-13.13 157.36,-9.63 147.36,-6.13 147.36,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d3b/namespaceqr__algorithm_a6d3c7dce1f142141f509d09f6c0e25dc_cgraph_org.svg b/d2/d3b/namespaceqr__algorithm_a6d3c7dce1f142141f509d09f6c0e25dc_cgraph_org.svg
deleted file mode 100644
index a71509e99..000000000
--- a/d2/d3b/namespaceqr__algorithm_a6d3c7dce1f142141f509d09f6c0e25dc_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: qr_algorithm::vector_proj Pages: 1 -->
-<svg width="288pt" height="27pt"
- viewBox="0.00 0.00 288.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>qr_algorithm::vector_proj</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="123.25,-19.25 0,-19.25 0,0 123.25,0 123.25,-19.25"/>
-<text text-anchor="middle" x="61.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_proj</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="280.25,-19.25 159.25,-19.25 159.25,0 280.25,0 280.25,-19.25"/>
-<text text-anchor="middle" x="219.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_dot</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M123.43,-9.62C131.35,-9.62 139.51,-9.62 147.58,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.36,-13.13 157.36,-9.63 147.36,-6.13 147.36,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d3b/namespaceqr__algorithm_a73ce637634fc49e1d10d190eb388ebf1_cgraph.map b/d2/d3b/namespaceqr__algorithm_a73ce637634fc49e1d10d190eb388ebf1_cgraph.map
deleted file mode 100644
index 9f7b3df09..000000000
--- a/d2/d3b/namespaceqr__algorithm_a73ce637634fc49e1d10d190eb388ebf1_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="qr_algorithm::qr_decompose" name="qr_algorithm::qr_decompose">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,191,56"/>
-<area shape="rect" id="Node000002" href="$d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f" title=" " alt="" coords="239,5,407,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="191,30,223,27,224,32,191,36"/>
-<area shape="rect" id="Node000005" href="$d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc" title=" " alt="" coords="241,55,405,80"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="191,51,225,54,225,60,191,56"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="501,5,570,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="407,16,485,16,485,21,407,21"/>
-<area shape="rect" id="Node000004" href="$d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" title=" " alt="" coords="455,55,616,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="382,29,463,48,462,53,381,34"/>
-<area shape="poly" id="edge5_Node000005_Node000004" title=" " alt="" coords="405,65,439,65,439,70,405,70"/>
-</map>
diff --git a/d2/d3b/namespaceqr__algorithm_a73ce637634fc49e1d10d190eb388ebf1_cgraph.md5 b/d2/d3b/namespaceqr__algorithm_a73ce637634fc49e1d10d190eb388ebf1_cgraph.md5
deleted file mode 100644
index b79ae481a..000000000
--- a/d2/d3b/namespaceqr__algorithm_a73ce637634fc49e1d10d190eb388ebf1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-46f9a1dd27bf0b3571fe9396e7a9178b
\ No newline at end of file
diff --git a/d2/d3b/namespaceqr__algorithm_a73ce637634fc49e1d10d190eb388ebf1_cgraph.svg b/d2/d3b/namespaceqr__algorithm_a73ce637634fc49e1d10d190eb388ebf1_cgraph.svg
deleted file mode 100644
index 05eafd5fa..000000000
--- a/d2/d3b/namespaceqr__algorithm_a73ce637634fc49e1d10d190eb388ebf1_cgraph.svg
+++ /dev/null
@@ -1,128 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: qr_algorithm::qr_decompose Pages: 1 -->
-<svg width="466pt" height="64pt"
- viewBox="0.00 0.00 466.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>qr_algorithm::qr_decompose</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="139,-37.25 0,-37.25 0,-18 139,-18 139,-37.25"/>
-<text text-anchor="middle" x="69.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::qr_decompose</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="301.25,-56.25 175,-56.25 175,-37 301.25,-37 301.25,-56.25"/>
-<text text-anchor="middle" x="238.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_mag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.23,-35.46C147.22,-36.37 155.38,-37.3 163.43,-38.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.85,-41.68 173.19,-39.33 163.65,-34.72 162.85,-41.68"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="299.75,-19.25 176.5,-19.25 176.5,0 299.75,0 299.75,-19.25"/>
-<text text-anchor="middle" x="238.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_proj</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.23,-20.2C147.62,-19.29 156.2,-18.37 164.64,-17.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.94,-20.94 174.51,-16.39 164.19,-13.98 164.94,-20.94"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="423.75,-56.25 371.75,-56.25 371.75,-37 423.75,-37 423.75,-56.25"/>
-<text text-anchor="middle" x="397.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M301.42,-46.62C321.28,-46.62 342.6,-46.62 360.03,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="359.9,-50.13 369.9,-46.63 359.9,-43.13 359.9,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="458.25,-19.25 337.25,-19.25 337.25,0 458.25,0 458.25,-19.25"/>
-<text text-anchor="middle" x="397.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_dot</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.2,-36.51C300.88,-32.13 322.95,-26.95 342.72,-22.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="343.32,-25.76 352.26,-20.07 341.72,-18.95 343.32,-25.76"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge5_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge5_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M300.07,-9.62C308.41,-9.62 317.03,-9.62 325.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.49,-13.13 335.49,-9.63 325.49,-6.13 325.49,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d3b/namespaceqr__algorithm_a73ce637634fc49e1d10d190eb388ebf1_cgraph_org.svg b/d2/d3b/namespaceqr__algorithm_a73ce637634fc49e1d10d190eb388ebf1_cgraph_org.svg
deleted file mode 100644
index 2de247c59..000000000
--- a/d2/d3b/namespaceqr__algorithm_a73ce637634fc49e1d10d190eb388ebf1_cgraph_org.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: qr_algorithm::qr_decompose Pages: 1 -->
-<svg width="466pt" height="64pt"
- viewBox="0.00 0.00 466.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>qr_algorithm::qr_decompose</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="139,-37.25 0,-37.25 0,-18 139,-18 139,-37.25"/>
-<text text-anchor="middle" x="69.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::qr_decompose</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="301.25,-56.25 175,-56.25 175,-37 301.25,-37 301.25,-56.25"/>
-<text text-anchor="middle" x="238.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_mag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.23,-35.46C147.22,-36.37 155.38,-37.3 163.43,-38.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.85,-41.68 173.19,-39.33 163.65,-34.72 162.85,-41.68"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="299.75,-19.25 176.5,-19.25 176.5,0 299.75,0 299.75,-19.25"/>
-<text text-anchor="middle" x="238.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_proj</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.23,-20.2C147.62,-19.29 156.2,-18.37 164.64,-17.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.94,-20.94 174.51,-16.39 164.19,-13.98 164.94,-20.94"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="423.75,-56.25 371.75,-56.25 371.75,-37 423.75,-37 423.75,-56.25"/>
-<text text-anchor="middle" x="397.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M301.42,-46.62C321.28,-46.62 342.6,-46.62 360.03,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="359.9,-50.13 369.9,-46.63 359.9,-43.13 359.9,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="458.25,-19.25 337.25,-19.25 337.25,0 458.25,0 458.25,-19.25"/>
-<text text-anchor="middle" x="397.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_dot</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.2,-36.51C300.88,-32.13 322.95,-26.95 342.72,-22.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="343.32,-25.76 352.26,-20.07 341.72,-18.95 343.32,-25.76"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge5_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge5_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M300.07,-9.62C308.41,-9.62 317.03,-9.62 325.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.49,-13.13 335.49,-9.63 325.49,-6.13 325.49,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.map b/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.map
deleted file mode 100644
index 51b181363..000000000
--- a/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="qr_algorithm::vector_mag" name="qr_algorithm::vector_mag">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,174,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="268,5,337,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="174,31,252,21,252,27,174,36"/>
-<area shape="rect" id="Node000003" href="$d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" title=" " alt="" coords="222,55,383,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="174,50,206,54,206,59,174,56"/>
-</map>
diff --git a/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.md5 b/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.md5
deleted file mode 100644
index 8a0b75473..000000000
--- a/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c2b9d4bf3c30a50da97306821a95eb1a
\ No newline at end of file
diff --git a/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.svg b/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.svg
deleted file mode 100644
index 799261362..000000000
--- a/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: qr_algorithm::vector_mag Pages: 1 -->
-<svg width="291pt" height="64pt"
- viewBox="0.00 0.00 291.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>qr_algorithm::vector_mag</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="126.25,-37.25 0,-37.25 0,-18 126.25,-18 126.25,-37.25"/>
-<text text-anchor="middle" x="63.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_mag</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.75,-56.25 196.75,-56.25 196.75,-37 248.75,-37 248.75,-56.25"/>
-<text text-anchor="middle" x="222.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.42,-35.13C146.28,-37.53 167.6,-40.1 185.03,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.56,-45.67 194.91,-43.39 185.4,-38.72 184.56,-45.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.25,-19.25 162.25,-19.25 162.25,0 283.25,0 283.25,-19.25"/>
-<text text-anchor="middle" x="222.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_dot</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.42,-20.51C134.38,-19.6 142.57,-18.67 150.65,-17.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.92,-21.24 160.46,-16.62 150.13,-14.28 150.92,-21.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph_org.svg b/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph_org.svg
deleted file mode 100644
index f0ac1c468..000000000
--- a/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: qr_algorithm::vector_mag Pages: 1 -->
-<svg width="291pt" height="64pt"
- viewBox="0.00 0.00 291.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>qr_algorithm::vector_mag</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="126.25,-37.25 0,-37.25 0,-18 126.25,-18 126.25,-37.25"/>
-<text text-anchor="middle" x="63.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_mag</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.75,-56.25 196.75,-56.25 196.75,-37 248.75,-37 248.75,-56.25"/>
-<text text-anchor="middle" x="222.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.42,-35.13C146.28,-37.53 167.6,-40.1 185.03,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.56,-45.67 194.91,-43.39 185.4,-38.72 184.56,-45.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.25,-19.25 162.25,-19.25 162.25,0 283.25,0 283.25,-19.25"/>
-<text text-anchor="middle" x="222.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_dot</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.42,-20.51C134.38,-19.6 142.57,-18.67 150.65,-17.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.92,-21.24 160.46,-16.62 150.13,-14.28 150.92,-21.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph.map b/d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph.map
deleted file mode 100644
index c1971a678..000000000
--- a/d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="qr_algorithm::operator&lt;&lt;" name="qr_algorithm::operator&lt;&lt;">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,104,169,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="258,5,330,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="107,101,155,71,216,40,242,30,244,35,218,45,158,76,109,106"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/ios_base/precision.html#" title=" " alt="" coords="217,55,371,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="143,101,222,82,223,87,145,106"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/left.html#" title=" " alt="" coords="258,104,330,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="169,114,242,114,242,120,169,120"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setfill.html#" title=" " alt="" coords="255,153,333,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="145,128,240,151,239,156,143,133"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setw.html#" title=" " alt="" coords="256,203,332,228"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="109,128,158,158,218,189,242,198,240,203,216,194,155,163,107,132"/>
-</map>
diff --git a/d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph.md5 b/d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph.md5
deleted file mode 100644
index 0dc31c22b..000000000
--- a/d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b980627778b1c3e06b5698d20950fe1d
\ No newline at end of file
diff --git a/d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph.svg b/d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph.svg
deleted file mode 100644
index 3244c344f..000000000
--- a/d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: qr_algorithm::operator&lt;&lt; Pages: 1 -->
-<svg width="282pt" height="175pt"
- viewBox="0.00 0.00 282.25 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>qr_algorithm::operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="122.5,-93.25 0,-93.25 0,-74 122.5,-74 122.5,-93.25"/>
-<text text-anchor="middle" x="61.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.12,-167.25 189.62,-167.25 189.62,-148 243.12,-148 243.12,-167.25"/>
-<text text-anchor="middle" x="216.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.04,-93.62C95.48,-105.75 128.27,-126.24 158.5,-139.62 164.75,-142.39 171.56,-144.93 178.22,-147.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.13,-150.5 187.72,-150.19 179.25,-143.82 177.13,-150.5"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.25,-130.25 158.5,-130.25 158.5,-111 274.25,-111 274.25,-130.25"/>
-<text text-anchor="middle" x="216.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.09,-93.74C122.15,-98.1 143.49,-103.25 162.62,-107.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.57,-111.22 172.11,-110.17 163.21,-104.42 161.57,-111.22"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/left.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.5,-93.25 189.25,-93.25 189.25,-74 243.5,-74 243.5,-93.25"/>
-<text text-anchor="middle" x="216.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::right</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.77,-83.62C141.2,-83.62 160.93,-83.62 177.42,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.28,-87.13 187.28,-83.63 177.28,-80.13 177.28,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245.75,-56.25 187,-56.25 187,-37 245.75,-37 245.75,-56.25"/>
-<text text-anchor="middle" x="216.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.09,-73.51C126.41,-68.12 153.73,-61.52 175.71,-56.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.29,-59.67 185.19,-53.92 174.65,-52.86 176.29,-59.67"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="244.62,-19.25 188.12,-19.25 188.12,0 244.62,0 244.62,-19.25"/>
-<text text-anchor="middle" x="216.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.04,-73.63C95.48,-61.5 128.27,-41.01 158.5,-27.62 164.3,-25.06 170.58,-22.69 176.78,-20.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.85,-23.9 186.29,-17.5 175.7,-17.24 177.85,-23.9"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph_org.svg b/d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph_org.svg
deleted file mode 100644
index 7544454bf..000000000
--- a/d2/d3b/namespaceqr__algorithm_adfbdf47277c8cfee229b05b72f1f7834_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: qr_algorithm::operator&lt;&lt; Pages: 1 -->
-<svg width="282pt" height="175pt"
- viewBox="0.00 0.00 282.25 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>qr_algorithm::operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="122.5,-93.25 0,-93.25 0,-74 122.5,-74 122.5,-93.25"/>
-<text text-anchor="middle" x="61.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.12,-167.25 189.62,-167.25 189.62,-148 243.12,-148 243.12,-167.25"/>
-<text text-anchor="middle" x="216.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.04,-93.62C95.48,-105.75 128.27,-126.24 158.5,-139.62 164.75,-142.39 171.56,-144.93 178.22,-147.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.13,-150.5 187.72,-150.19 179.25,-143.82 177.13,-150.5"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.25,-130.25 158.5,-130.25 158.5,-111 274.25,-111 274.25,-130.25"/>
-<text text-anchor="middle" x="216.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.09,-93.74C122.15,-98.1 143.49,-103.25 162.62,-107.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.57,-111.22 172.11,-110.17 163.21,-104.42 161.57,-111.22"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/left.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.5,-93.25 189.25,-93.25 189.25,-74 243.5,-74 243.5,-93.25"/>
-<text text-anchor="middle" x="216.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::right</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.77,-83.62C141.2,-83.62 160.93,-83.62 177.42,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.28,-87.13 187.28,-83.63 177.28,-80.13 177.28,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245.75,-56.25 187,-56.25 187,-37 245.75,-37 245.75,-56.25"/>
-<text text-anchor="middle" x="216.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.09,-73.51C126.41,-68.12 153.73,-61.52 175.71,-56.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.29,-59.67 185.19,-53.92 174.65,-52.86 176.29,-59.67"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="244.62,-19.25 188.12,-19.25 188.12,0 244.62,0 244.62,-19.25"/>
-<text text-anchor="middle" x="216.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.04,-73.63C95.48,-61.5 128.27,-41.01 158.5,-27.62 164.3,-25.06 170.58,-22.69 176.78,-20.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.85,-23.9 186.29,-17.5 175.7,-17.24 177.85,-23.9"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d45/segtree_8cpp.html b/d2/d45/segtree_8cpp.html
index 6f56c273e..35af03921 100644
--- a/d2/d45/segtree_8cpp.html
+++ b/d2/d45/segtree_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: range_queries/segtree.cpp File Reference</title>
+<title>TheAlgorithms/C++: range_queries/segtree.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,16 +139,18 @@ Include dependency graph for segtree.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../de/db6/segtree_8cpp__incl.svg" width="418" height="111"><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">
+</div>
+<p><a href="../../d2/d45/segtree_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:ae752659b7c1719d68fdb2ca538a93696" id="r_ae752659b7c1719d68fdb2ca538a93696"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae752659b7c1719d68fdb2ca538a93696">ConsTree</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;arr, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; *segtree, uint64_t low, uint64_t high, uint64_t pos)</td></tr>
-<tr class="memdesc:ae752659b7c1719d68fdb2ca538a93696"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>  <br /></td></tr>
+<tr class="memitem:ae752659b7c1719d68fdb2ca538a93696" id="r_ae752659b7c1719d68fdb2ca538a93696"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae752659b7c1719d68fdb2ca538a93696">ConsTree</a> (const std::vector&lt; int64_t &gt; &amp;arr, std::vector&lt; int64_t &gt; *segtree, uint64_t low, uint64_t high, uint64_t pos)</td></tr>
+<tr class="memdesc:ae752659b7c1719d68fdb2ca538a93696"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::vector  <br /></td></tr>
 <tr class="separator:ae752659b7c1719d68fdb2ca538a93696"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a423a97ea0c7ea6e33b5844a6858d902d" id="r_a423a97ea0c7ea6e33b5844a6858d902d"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a423a97ea0c7ea6e33b5844a6858d902d">query</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; *segtree, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; *lazy, uint64_t qlow, uint64_t qhigh, uint64_t low, uint64_t high, uint64_t pos)</td></tr>
+<tr class="memitem:a423a97ea0c7ea6e33b5844a6858d902d" id="r_a423a97ea0c7ea6e33b5844a6858d902d"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a423a97ea0c7ea6e33b5844a6858d902d">query</a> (std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, uint64_t qlow, uint64_t qhigh, uint64_t low, uint64_t high, uint64_t pos)</td></tr>
 <tr class="memdesc:a423a97ea0c7ea6e33b5844a6858d902d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the sum of all elements in a range.  <br /></td></tr>
 <tr class="separator:a423a97ea0c7ea6e33b5844a6858d902d"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:abd3e818681fb2e29cf08f4f60f82c8e0" id="r_abd3e818681fb2e29cf08f4f60f82c8e0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abd3e818681fb2e29cf08f4f60f82c8e0">update</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; *segtree, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos)</td></tr>
+<tr class="memitem:abd3e818681fb2e29cf08f4f60f82c8e0" id="r_abd3e818681fb2e29cf08f4f60f82c8e0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abd3e818681fb2e29cf08f4f60f82c8e0">update</a> (std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos)</td></tr>
 <tr class="memdesc:abd3e818681fb2e29cf08f4f60f82c8e0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Updates a range of the segment tree.  <br /></td></tr>
 <tr class="separator:abd3e818681fb2e29cf08f4f60f82c8e0"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -155,6 +174,8 @@ Functions</h2></td></tr>
 <a href="https://github.com/sohamroy19" target="_blank">Soham Roy</a> </dd></dl>
 </li>
 </ul>
+
+<p class="definition">Definition in file <a class="el" href="../../d2/d45/segtree_8cpp_source.html">segtree.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae752659b7c1719d68fdb2ca538a93696" name="ae752659b7c1719d68fdb2ca538a93696"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae752659b7c1719d68fdb2ca538a93696">&#9670;&#160;</a></span>ConsTree()</h2>
@@ -165,12 +186,12 @@ Functions</h2></td></tr>
         <tr>
           <td class="memname">void ConsTree </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; int64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; *</td>          <td class="paramname"><span class="paramname"><em>segtree</em></span>, </td>
+          <td class="paramtype">std::vector&lt; int64_t &gt; *</td>          <td class="paramname"><span class="paramname"><em>segtree</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -190,8 +211,8 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 
-<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 log2 for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> for IO operations</p>
+<p>for std::vector </p>
+<p>for assert for log2 for std::uint64_t for IO operations</p>
 <p>Constructs the initial segment tree</p>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
@@ -204,6 +225,8 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d45/segtree_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../d2/d45/segtree_8cpp_source.html">segtree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   39</span>                                                         {</div>
 <div class="line"><span class="lineno">   40</span>    <span class="keywordflow">if</span> (low == high) {</div>
 <div class="line"><span class="lineno">   41</span>        (*segtree)[pos] = arr[low];</div>
@@ -215,13 +238,8 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   47</span>    <a class="code hl_function" href="#ae752659b7c1719d68fdb2ca538a93696">ConsTree</a>(arr, segtree, mid + 1, high, 2 * pos + 2);</div>
 <div class="line"><span class="lineno">   48</span>    (*segtree)[pos] = (*segtree)[2 * pos + 1] + (*segtree)[2 * pos + 2];</div>
 <div class="line"><span class="lineno">   49</span>}</div>
-<div class="ttc" id="asegtree_8cpp_html_ae752659b7c1719d68fdb2ca538a93696"><div class="ttname"><a href="#ae752659b7c1719d68fdb2ca538a93696">ConsTree</a></div><div class="ttdeci">void ConsTree(const std::vector&lt; int64_t &gt; &amp;arr, std::vector&lt; int64_t &gt; *segtree, uint64_t low, uint64_t high, uint64_t pos)</div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition</b> segtree.cpp:38</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d45/segtree_8cpp_ae752659b7c1719d68fdb2ca538a93696_cgraph.svg" width="90" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asegtree_8cpp_html_ae752659b7c1719d68fdb2ca538a93696"><div class="ttname"><a href="#ae752659b7c1719d68fdb2ca538a93696">ConsTree</a></div><div class="ttdeci">void ConsTree(const std::vector&lt; int64_t &gt; &amp;arr, std::vector&lt; int64_t &gt; *segtree, uint64_t low, uint64_t high, uint64_t pos)</div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d45/segtree_8cpp_source.html#l00038">segtree.cpp:38</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -241,73 +259,64 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d45/segtree_8cpp_source.html#l00168">168</a> of file <a class="el" href="../../d2/d45/segtree_8cpp_source.html">segtree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  168</span>           {</div>
 <div class="line"><span class="lineno">  169</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  170</span> </div>
-<div class="line"><span class="lineno">  171</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter number of elements: &quot;</span>;</div>
+<div class="line"><span class="lineno">  171</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter number of elements: &quot;</span>;</div>
 <div class="line"><span class="lineno">  172</span> </div>
 <div class="line"><span class="lineno">  173</span>    uint64_t n = 0;</div>
-<div class="line"><span class="lineno">  174</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;</div>
+<div class="line"><span class="lineno">  174</span>    std::cin &gt;&gt; n;</div>
 <div class="line"><span class="lineno">  175</span> </div>
-<div class="line"><span class="lineno">  176</span>    <span class="keyword">auto</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">max</a> = <span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>(2 * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">pow</a>(2, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/ceil.html">ceil</a>(log2(n))) - 1);</div>
-<div class="line"><span class="lineno">  177</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> arr(n), lazy(max), segtree(max);</div>
+<div class="line"><span class="lineno">  176</span>    <span class="keyword">auto</span> max = <span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>(2 * pow(2, ceil(log2(n))) - 1);</div>
+<div class="line"><span class="lineno">  177</span>    std::vector&lt;int64_t&gt; arr(n), lazy(max), segtree(max);</div>
 <div class="line"><span class="lineno">  178</span> </div>
 <div class="line"><span class="lineno">  179</span>    <span class="keywordtype">int</span> choice = 0;</div>
-<div class="line"><span class="lineno">  180</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nDo you wish to enter each number?:\n&quot;</span></div>
+<div class="line"><span class="lineno">  180</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nDo you wish to enter each number?:\n&quot;</span></div>
 <div class="line"><span class="lineno">  181</span>                 <span class="stringliteral">&quot;1: Yes\n&quot;</span></div>
 <div class="line"><span class="lineno">  182</span>                 <span class="stringliteral">&quot;0: No (default initialize them to 0)\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  183</span> </div>
-<div class="line"><span class="lineno">  184</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; choice;</div>
+<div class="line"><span class="lineno">  184</span>    std::cin &gt;&gt; choice;</div>
 <div class="line"><span class="lineno">  185</span>    <span class="keywordflow">if</span> (choice == 1) {</div>
-<div class="line"><span class="lineno">  186</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter &quot;</span> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; numbers:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  186</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter &quot;</span> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; numbers:\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  187</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= n; i++) {</div>
-<div class="line"><span class="lineno">  188</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;: &quot;</span>;</div>
-<div class="line"><span class="lineno">  189</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; arr[i];</div>
+<div class="line"><span class="lineno">  188</span>            std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;: &quot;</span>;</div>
+<div class="line"><span class="lineno">  189</span>            std::cin &gt;&gt; arr[i];</div>
 <div class="line"><span class="lineno">  190</span>        }</div>
 <div class="line"><span class="lineno">  191</span>    }</div>
 <div class="line"><span class="lineno">  192</span> </div>
 <div class="line"><span class="lineno">  193</span>    <a class="code hl_function" href="#ae752659b7c1719d68fdb2ca538a93696">ConsTree</a>(arr, &amp;segtree, 0, n - 1, 0);</div>
 <div class="line"><span class="lineno">  194</span> </div>
 <div class="line"><span class="lineno">  195</span>    <span class="keywordflow">do</span> {</div>
-<div class="line"><span class="lineno">  196</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nMake your choice:\n&quot;</span></div>
+<div class="line"><span class="lineno">  196</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nMake your choice:\n&quot;</span></div>
 <div class="line"><span class="lineno">  197</span>                     <span class="stringliteral">&quot;1: Range update (input)\n&quot;</span></div>
 <div class="line"><span class="lineno">  198</span>                     <span class="stringliteral">&quot;2: Range query (output)\n&quot;</span></div>
 <div class="line"><span class="lineno">  199</span>                     <span class="stringliteral">&quot;0: Exit\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  200</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; choice;</div>
+<div class="line"><span class="lineno">  200</span>        std::cin &gt;&gt; choice;</div>
 <div class="line"><span class="lineno">  201</span> </div>
 <div class="line"><span class="lineno">  202</span>        <span class="keywordflow">if</span> (choice == 1) {</div>
-<div class="line"><span class="lineno">  203</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter 1-indexed lower bound, upper bound &amp; value:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  203</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Enter 1-indexed lower bound, upper bound &amp; value:\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  204</span> </div>
 <div class="line"><span class="lineno">  205</span>            uint64_t p = 1, q = 1, v = 0;</div>
-<div class="line"><span class="lineno">  206</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; p &gt;&gt; q &gt;&gt; v;</div>
+<div class="line"><span class="lineno">  206</span>            std::cin &gt;&gt; p &gt;&gt; q &gt;&gt; v;</div>
 <div class="line"><span class="lineno">  207</span>            <a class="code hl_function" href="#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>(&amp;segtree, &amp;lazy, p - 1, q - 1, v, 0, n - 1, 0);</div>
 <div class="line"><span class="lineno">  208</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (choice == 2) {</div>
-<div class="line"><span class="lineno">  209</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter 1-indexed lower bound &amp; upper bound:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  209</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Enter 1-indexed lower bound &amp; upper bound:\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  210</span> </div>
 <div class="line"><span class="lineno">  211</span>            uint64_t p = 1, q = 1;</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_istream.html">std::cin</a> &gt;&gt; p &gt;&gt; q;</div>
-<div class="line"><span class="lineno">  213</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#a423a97ea0c7ea6e33b5844a6858d902d">query</a>(&amp;segtree, &amp;lazy, p - 1, q - 1, 0, n - 1, 0);</div>
-<div class="line"><span class="lineno">  214</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  212</span>            std::cin &gt;&gt; p &gt;&gt; q;</div>
+<div class="line"><span class="lineno">  213</span>            std::cout &lt;&lt; <a class="code hl_function" href="#a423a97ea0c7ea6e33b5844a6858d902d">query</a>(&amp;segtree, &amp;lazy, p - 1, q - 1, 0, n - 1, 0);</div>
+<div class="line"><span class="lineno">  214</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  215</span>        }</div>
 <div class="line"><span class="lineno">  216</span>    } <span class="keywordflow">while</span> (choice &gt; 0);</div>
 <div class="line"><span class="lineno">  217</span> </div>
 <div class="line"><span class="lineno">  218</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  219</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="aceil_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/ceil.html">std::ceil</a></div><div class="ttdeci">T ceil(T... args)</div></div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-<div class="ttc" id="asegtree_8cpp_html_a423a97ea0c7ea6e33b5844a6858d902d"><div class="ttname"><a href="#a423a97ea0c7ea6e33b5844a6858d902d">query</a></div><div class="ttdeci">int64_t query(std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, uint64_t qlow, uint64_t qhigh, uint64_t low, uint64_t high, uint64_t pos)</div><div class="ttdoc">Returns the sum of all elements in a range.</div><div class="ttdef"><b>Definition</b> segtree.cpp:63</div></div>
-<div class="ttc" id="asegtree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> segtree.cpp:147</div></div>
-<div class="ttc" id="asegtree_8cpp_html_abd3e818681fb2e29cf08f4f60f82c8e0"><div class="ttname"><a href="#abd3e818681fb2e29cf08f4f60f82c8e0">update</a></div><div class="ttdeci">void update(std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos)</div><div class="ttdoc">Updates a range of the segment tree.</div><div class="ttdef"><b>Definition</b> segtree.cpp:103</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="278" height="208"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asegtree_8cpp_html_a423a97ea0c7ea6e33b5844a6858d902d"><div class="ttname"><a href="#a423a97ea0c7ea6e33b5844a6858d902d">query</a></div><div class="ttdeci">int64_t query(std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, uint64_t qlow, uint64_t qhigh, uint64_t low, uint64_t high, uint64_t pos)</div><div class="ttdoc">Returns the sum of all elements in a range.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d45/segtree_8cpp_source.html#l00063">segtree.cpp:63</a></div></div>
+<div class="ttc" id="asegtree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d45/segtree_8cpp_source.html#l00147">segtree.cpp:147</a></div></div>
+<div class="ttc" id="asegtree_8cpp_html_abd3e818681fb2e29cf08f4f60f82c8e0"><div class="ttname"><a href="#abd3e818681fb2e29cf08f4f60f82c8e0">update</a></div><div class="ttdeci">void update(std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos)</div><div class="ttdoc">Updates a range of the segment tree.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d45/segtree_8cpp_source.html#l00103">segtree.cpp:103</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a423a97ea0c7ea6e33b5844a6858d902d" name="a423a97ea0c7ea6e33b5844a6858d902d"></a>
@@ -319,12 +328,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">int64_t query </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; *</td>          <td class="paramname"><span class="paramname"><em>segtree</em></span>, </td>
+          <td class="paramtype">std::vector&lt; int64_t &gt; *</td>          <td class="paramname"><span class="paramname"><em>segtree</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; *</td>          <td class="paramname"><span class="paramname"><em>lazy</em></span>, </td>
+          <td class="paramtype">std::vector&lt; int64_t &gt; *</td>          <td class="paramname"><span class="paramname"><em>lazy</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -368,6 +377,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>result of the range query for this function call </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d45/segtree_8cpp_source.html#l00063">63</a> of file <a class="el" href="../../d2/d45/segtree_8cpp_source.html">segtree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   65</span>                            {</div>
 <div class="line"><span class="lineno">   66</span>    <span class="keywordflow">if</span> (low &gt; high || qlow &gt; high || low &gt; qhigh) {</div>
 <div class="line"><span class="lineno">   67</span>        <span class="keywordflow">return</span> 0;</div>
@@ -392,12 +403,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   86</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="#a423a97ea0c7ea6e33b5844a6858d902d">query</a>(segtree, lazy, qlow, qhigh, low, mid, 2 * pos + 1) +</div>
 <div class="line"><span class="lineno">   87</span>           <a class="code hl_function" href="#a423a97ea0c7ea6e33b5844a6858d902d">query</a>(segtree, lazy, qlow, qhigh, mid + 1, high, 2 * pos + 2);</div>
 <div class="line"><span class="lineno">   88</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.svg" width="64" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -425,11 +431,13 @@ Here is the call graph for this function:</div>
 
 <p>Self-test implementation. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d45/segtree_8cpp_source.html#l00147">147</a> of file <a class="el" href="../../d2/d45/segtree_8cpp_source.html">segtree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  147</span>                   {</div>
-<div class="line"><span class="lineno">  148</span>    <span class="keyword">auto</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">max</a> = <span class="keyword">static_cast&lt;</span>int64_t<span class="keyword">&gt;</span>(2 * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">pow</a>(2, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/ceil.html">ceil</a>(log2(7))) - 1);</div>
+<div class="line"><span class="lineno">  148</span>    <span class="keyword">auto</span> max = <span class="keyword">static_cast&lt;</span>int64_t<span class="keyword">&gt;</span>(2 * pow(2, ceil(log2(7))) - 1);</div>
 <div class="line"><span class="lineno">  149</span>    assert(max == 15);</div>
 <div class="line"><span class="lineno">  150</span> </div>
-<div class="line"><span class="lineno">  151</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> arr{1, 2, 3, 4, 5, 6, 7}, lazy(max), segtree(max);</div>
+<div class="line"><span class="lineno">  151</span>    std::vector&lt;int64_t&gt; arr{1, 2, 3, 4, 5, 6, 7}, lazy(max), segtree(max);</div>
 <div class="line"><span class="lineno">  152</span>    <a class="code hl_function" href="#ae752659b7c1719d68fdb2ca538a93696">ConsTree</a>(arr, &amp;segtree, 0, 7 - 1, 0);</div>
 <div class="line"><span class="lineno">  153</span> </div>
 <div class="line"><span class="lineno">  154</span>    assert(<a class="code hl_function" href="#a423a97ea0c7ea6e33b5844a6858d902d">query</a>(&amp;segtree, &amp;lazy, 1, 5, 0, 7 - 1, 0) == 2 + 3 + 4 + 5 + 6);</div>
@@ -440,12 +448,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  159</span>    <a class="code hl_function" href="#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>(&amp;segtree, &amp;lazy, 0, 6, -2, 0, 7 - 1, 0);</div>
 <div class="line"><span class="lineno">  160</span>    assert(<a class="code hl_function" href="#a423a97ea0c7ea6e33b5844a6858d902d">query</a>(&amp;segtree, &amp;lazy, 0, 4, 0, 7 - 1, 0) == -1 + 0 + 2 + 3 + 4);</div>
 <div class="line"><span class="lineno">  161</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="180" height="207"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abd3e818681fb2e29cf08f4f60f82c8e0" name="abd3e818681fb2e29cf08f4f60f82c8e0"></a>
@@ -457,12 +460,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void update </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; *</td>          <td class="paramname"><span class="paramname"><em>segtree</em></span>, </td>
+          <td class="paramtype">std::vector&lt; int64_t &gt; *</td>          <td class="paramname"><span class="paramname"><em>segtree</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; *</td>          <td class="paramname"><span class="paramname"><em>lazy</em></span>, </td>
+          <td class="paramtype">std::vector&lt; int64_t &gt; *</td>          <td class="paramname"><span class="paramname"><em>lazy</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -512,6 +515,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d45/segtree_8cpp_source.html#l00103">103</a> of file <a class="el" href="../../d2/d45/segtree_8cpp_source.html">segtree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  105</span>                                         {</div>
 <div class="line"><span class="lineno">  106</span>    <span class="keywordflow">if</span> (low &gt; high) {</div>
 <div class="line"><span class="lineno">  107</span>        <span class="keywordflow">return</span>;</div>
@@ -548,12 +553,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  138</span>    <a class="code hl_function" href="#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>(segtree, lazy, start, end, delta, mid + 1, high, 2 * pos + 2);</div>
 <div class="line"><span class="lineno">  139</span>    (*segtree)[pos] = (*segtree)[2 * pos + 1] + (*segtree)[2 * pos + 2];</div>
 <div class="line"><span class="lineno">  140</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d45/segtree_8cpp_abd3e818681fb2e29cf08f4f60f82c8e0_cgraph.svg" width="71" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.map b/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.map
deleted file mode 100644
index bacea79c8..000000000
--- a/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="query" name="query">
-<area shape="rect" id="Node000001" title="Returns the sum of all elements in a range." alt="" coords="5,29,59,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="21,29,20,12,25,5,32,3,40,6,44,12,39,15,36,10,32,8,28,9,25,13,26,29"/>
-</map>
diff --git a/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.md5 b/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.md5
deleted file mode 100644
index 5f3b146db..000000000
--- a/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4beb5565895e9cc3a907595a928822dd
\ No newline at end of file
diff --git a/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.svg b/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.svg
deleted file mode 100644
index b1d9d2168..000000000
--- a/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: query Pages: 1 -->
-<svg width="48pt" height="45pt"
- viewBox="0.00 0.00 48.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>query</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Returns the sum of all elements in a range.">
-<polygon fill="#999999" stroke="#666666" points="40,-19.25 0,-19.25 0,0 40,0 40,-19.25"/>
-<text text-anchor="middle" x="20" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M13.74,-19.54C10.88,-28.15 12.97,-37.25 20,-37.25 23.74,-37.25 26.08,-34.68 27.02,-30.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="30.52,-30.8 26.36,-21.05 23.53,-31.26 30.52,-30.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph_org.svg b/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph_org.svg
deleted file mode 100644
index 3d06d4a57..000000000
--- a/d2/d45/segtree_8cpp_a423a97ea0c7ea6e33b5844a6858d902d_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: query Pages: 1 -->
-<svg width="48pt" height="45pt"
- viewBox="0.00 0.00 48.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>query</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Returns the sum of all elements in a range.">
-<polygon fill="#999999" stroke="#666666" points="40,-19.25 0,-19.25 0,0 40,0 40,-19.25"/>
-<text text-anchor="middle" x="20" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M13.74,-19.54C10.88,-28.15 12.97,-37.25 20,-37.25 23.74,-37.25 26.08,-34.68 27.02,-30.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="30.52,-30.8 26.36,-21.05 23.53,-31.26 30.52,-30.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index e869c7533..000000000
--- a/d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementation." alt="" coords="5,103,49,128"/>
-<area shape="rect" id="Node000002" href="$d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696" title="for std::vector" alt="" coords="97,29,175,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="45,100,95,64,99,62,102,66,98,68,48,104"/>
-<area shape="rect" id="Node000003" href="$d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d" title="Returns the sum of all elements in a range." alt="" coords="109,103,162,128"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="49,113,94,113,94,118,49,118"/>
-<area shape="rect" id="Node000004" href="$d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0" title="Updates a range of the segment tree." alt="" coords="106,176,166,202"/>
-<area shape="poly" id="edge5_Node000001_Node000004" title=" " alt="" coords="49,127,104,165,101,169,46,131"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="116,30,113,21,115,11,123,5,136,3,150,5,157,12,153,16,147,10,136,8,125,10,119,14,118,20,121,28"/>
-<area shape="poly" id="edge4_Node000003_Node000003" title=" " alt="" coords="116,103,113,94,115,85,123,78,136,76,150,79,157,86,153,89,147,83,136,81,125,83,119,88,118,94,121,101"/>
-<area shape="poly" id="edge6_Node000004_Node000004" title=" " alt="" coords="116,177,113,167,115,158,123,152,136,149,150,152,157,159,153,163,147,157,136,155,125,157,119,161,118,167,121,175"/>
-</map>
diff --git a/d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 2d602a06b..000000000
--- a/d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6c368350e0a7027c1dc6b6fa18659a3e
\ No newline at end of file
diff --git a/d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 3601b652d..000000000
--- a/d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,128 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="135pt" height="155pt"
- viewBox="0.00 0.00 135.25 155.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 151.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementation.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-74.25 0,-74.25 0,-55 32.5,-55 32.5,-74.25"/>
-<text text-anchor="middle" x="16.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696" target="_top" xlink:title="for std::vector">
-<polygon fill="white" stroke="#666666" points="127.25,-129.25 68.5,-129.25 68.5,-110 127.25,-110 127.25,-129.25"/>
-<text text-anchor="middle" x="97.88" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">ConsTree</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.58,-74.59C40.84,-82.16 55.42,-92.76 68.5,-101.62 69.35,-102.2 70.21,-102.78 71.08,-103.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69,-106.18 79.29,-108.69 72.81,-100.31 69,-106.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d" target="_top" xlink:title="Returns the sum of all elements in a range.">
-<polygon fill="white" stroke="#666666" points="117.88,-74.25 77.88,-74.25 77.88,-55 117.88,-55 117.88,-74.25"/>
-<text text-anchor="middle" x="97.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.98,-64.62C42.47,-64.62 54.87,-64.62 66.23,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66,-68.13 76,-64.63 66,-61.13 66,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0" target="_top" xlink:title="Updates a range of the segment tree.">
-<polygon fill="white" stroke="#666666" points="120.5,-19.25 75.25,-19.25 75.25,0 120.5,0 120.5,-19.25"/>
-<text text-anchor="middle" x="97.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.85,-54.54C43.42,-46.55 59.79,-35.24 73.22,-25.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.88,-29.07 81.12,-20.51 70.9,-23.31 74.88,-29.07"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.1,-129.54C79.27,-138.15 83.53,-147.25 97.88,-147.25 105.72,-147.25 110.55,-144.53 112.36,-140.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.86,-140.39 110.88,-131.03 108.95,-141.45 115.86,-140.39"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.1,-74.54C79.27,-83.15 83.53,-92.25 97.88,-92.25 105.72,-92.25 110.55,-89.53 112.36,-85.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.86,-85.39 110.88,-76.03 108.95,-86.45 115.86,-85.39"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge6_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge6_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.1,-19.54C79.27,-28.15 83.53,-37.25 97.88,-37.25 105.72,-37.25 110.55,-34.53 112.36,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.86,-30.39 110.88,-21.03 108.95,-31.45 115.86,-30.39"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index b64e6b3a6..000000000
--- a/d2/d45/segtree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="135pt" height="155pt"
- viewBox="0.00 0.00 135.25 155.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 151.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementation.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-74.25 0,-74.25 0,-55 32.5,-55 32.5,-74.25"/>
-<text text-anchor="middle" x="16.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696" target="_top" xlink:title="for std::vector">
-<polygon fill="white" stroke="#666666" points="127.25,-129.25 68.5,-129.25 68.5,-110 127.25,-110 127.25,-129.25"/>
-<text text-anchor="middle" x="97.88" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">ConsTree</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.58,-74.59C40.84,-82.16 55.42,-92.76 68.5,-101.62 69.35,-102.2 70.21,-102.78 71.08,-103.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69,-106.18 79.29,-108.69 72.81,-100.31 69,-106.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d" target="_top" xlink:title="Returns the sum of all elements in a range.">
-<polygon fill="white" stroke="#666666" points="117.88,-74.25 77.88,-74.25 77.88,-55 117.88,-55 117.88,-74.25"/>
-<text text-anchor="middle" x="97.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.98,-64.62C42.47,-64.62 54.87,-64.62 66.23,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66,-68.13 76,-64.63 66,-61.13 66,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0" target="_top" xlink:title="Updates a range of the segment tree.">
-<polygon fill="white" stroke="#666666" points="120.5,-19.25 75.25,-19.25 75.25,0 120.5,0 120.5,-19.25"/>
-<text text-anchor="middle" x="97.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.85,-54.54C43.42,-46.55 59.79,-35.24 73.22,-25.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.88,-29.07 81.12,-20.51 70.9,-23.31 74.88,-29.07"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.1,-129.54C79.27,-138.15 83.53,-147.25 97.88,-147.25 105.72,-147.25 110.55,-144.53 112.36,-140.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.86,-140.39 110.88,-131.03 108.95,-141.45 115.86,-140.39"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.1,-74.54C79.27,-83.15 83.53,-92.25 97.88,-92.25 105.72,-92.25 110.55,-89.53 112.36,-85.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.86,-85.39 110.88,-76.03 108.95,-86.45 115.86,-85.39"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge6_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge6_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.1,-19.54C79.27,-28.15 83.53,-37.25 97.88,-37.25 105.72,-37.25 110.55,-34.53 112.36,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.86,-30.39 110.88,-21.03 108.95,-31.45 115.86,-30.39"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d45/segtree_8cpp_abd3e818681fb2e29cf08f4f60f82c8e0_cgraph.map b/d2/d45/segtree_8cpp_abd3e818681fb2e29cf08f4f60f82c8e0_cgraph.map
deleted file mode 100644
index c219b08d7..000000000
--- a/d2/d45/segtree_8cpp_abd3e818681fb2e29cf08f4f60f82c8e0_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="update" name="update">
-<area shape="rect" id="Node000001" title="Updates a range of the segment tree." alt="" coords="5,29,66,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="23,29,23,12,27,5,36,3,44,6,48,12,44,15,41,10,35,8,31,10,28,14,29,29"/>
-</map>
diff --git a/d2/d45/segtree_8cpp_abd3e818681fb2e29cf08f4f60f82c8e0_cgraph.md5 b/d2/d45/segtree_8cpp_abd3e818681fb2e29cf08f4f60f82c8e0_cgraph.md5
deleted file mode 100644
index 09f31c0b9..000000000
--- a/d2/d45/segtree_8cpp_abd3e818681fb2e29cf08f4f60f82c8e0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a6327aecff5a1ed72a0210ea6b30c077
\ No newline at end of file
diff --git a/d2/d45/segtree_8cpp_abd3e818681fb2e29cf08f4f60f82c8e0_cgraph.svg b/d2/d45/segtree_8cpp_abd3e818681fb2e29cf08f4f60f82c8e0_cgraph.svg
deleted file mode 100644
index 342892b63..000000000
--- a/d2/d45/segtree_8cpp_abd3e818681fb2e29cf08f4f60f82c8e0_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: update Pages: 1 -->
-<svg width="53pt" height="45pt"
- viewBox="0.00 0.00 53.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>update</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Updates a range of the segment tree.">
-<polygon fill="#999999" stroke="#666666" points="45.25,-19.25 0,-19.25 0,0 45.25,0 45.25,-19.25"/>
-<text text-anchor="middle" x="22.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M15.54,-19.54C12.31,-28.15 14.67,-37.25 22.62,-37.25 26.85,-37.25 29.5,-34.68 30.57,-30.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="34.06,-30.76 29.82,-21.05 27.08,-31.28 34.06,-30.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d45/segtree_8cpp_abd3e818681fb2e29cf08f4f60f82c8e0_cgraph_org.svg b/d2/d45/segtree_8cpp_abd3e818681fb2e29cf08f4f60f82c8e0_cgraph_org.svg
deleted file mode 100644
index 0c28147e2..000000000
--- a/d2/d45/segtree_8cpp_abd3e818681fb2e29cf08f4f60f82c8e0_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: update Pages: 1 -->
-<svg width="53pt" height="45pt"
- viewBox="0.00 0.00 53.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>update</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Updates a range of the segment tree.">
-<polygon fill="#999999" stroke="#666666" points="45.25,-19.25 0,-19.25 0,0 45.25,0 45.25,-19.25"/>
-<text text-anchor="middle" x="22.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M15.54,-19.54C12.31,-28.15 14.67,-37.25 22.62,-37.25 26.85,-37.25 29.5,-34.68 30.57,-30.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="34.06,-30.76 29.82,-21.05 27.08,-31.28 34.06,-30.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index b61783e3f..000000000
--- a/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,104,55,130"/>
-<area shape="rect" id="Node000002" href="$d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696" title="for std::vector" alt="" coords="194,29,272,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="44,101,70,82,102,64,140,51,178,44,179,49,141,57,104,69,73,86,48,106"/>
-<area shape="rect" id="Node000003" href="$d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d" title="Returns the sum of all elements in a range." alt="" coords="206,103,260,128"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="55,114,146,114,191,114,191,119,146,119,55,120"/>
-<area shape="rect" id="Node000004" href="$d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementation." alt="" coords="103,79,146,104"/>
-<area shape="poly" id="edge5_Node000001_Node000004" title=" " alt="" coords="54,108,87,99,88,104,56,113"/>
-<area shape="rect" id="Node000005" href="$d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0" title="Updates a range of the segment tree." alt="" coords="203,177,263,203"/>
-<area shape="poly" id="edge10_Node000001_Node000005" title=" " alt="" coords="56,123,189,172,188,177,54,128"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="214,30,210,21,212,11,220,5,233,3,247,5,254,12,251,16,245,10,233,8,222,10,217,14,215,20,219,28"/>
-<area shape="poly" id="edge4_Node000003_Node000003" title=" " alt="" coords="214,103,210,94,212,85,220,78,233,76,247,79,254,86,251,89,245,83,233,81,222,83,217,88,215,94,219,101"/>
-<area shape="poly" id="edge6_Node000004_Node000002" title=" " alt="" coords="146,79,188,60,190,64,148,84"/>
-<area shape="poly" id="edge7_Node000004_Node000003" title=" " alt="" coords="147,94,192,104,191,109,146,99"/>
-<area shape="poly" id="edge8_Node000004_Node000005" title=" " alt="" coords="142,103,208,164,204,168,138,107"/>
-<area shape="poly" id="edge9_Node000005_Node000005" title=" " alt="" coords="214,178,210,169,212,159,220,153,233,151,247,153,254,160,251,164,245,158,233,156,222,158,217,162,215,168,219,176"/>
-</map>
diff --git a/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 3ab386bf6..000000000
--- a/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-67332d76b842788ad2c01c9d0b1410a8
\ No newline at end of file
diff --git a/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index ae5d10f8a..000000000
--- a/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,173 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="208pt" height="156pt"
- viewBox="0.00 0.00 208.25 156.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 152.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696" target="_top" xlink:title="for std::vector">
-<polygon fill="white" stroke="#666666" points="200.25,-130.25 141.5,-130.25 141.5,-111 200.25,-111 200.25,-130.25"/>
-<text text-anchor="middle" x="170.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">ConsTree</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.52,-74.66C40.77,-83.42 56.84,-95.78 73,-102.62 90.96,-110.23 112.14,-114.63 130.11,-117.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.53,-120.63 139.88,-118.4 130.4,-113.69 129.53,-120.63"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d" target="_top" xlink:title="Returns the sum of all elements in a range.">
-<polygon fill="white" stroke="#666666" points="190.88,-75.25 150.88,-75.25 150.88,-56 190.88,-56 190.88,-75.25"/>
-<text text-anchor="middle" x="170.88" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.29,-64.54C54.68,-64.48 81.91,-64.44 105.5,-64.62 116.46,-64.71 128.48,-64.88 139.12,-65.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.87,-68.55 148.92,-65.22 138.99,-61.55 138.87,-68.55"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementation.">
-<polygon fill="white" stroke="#666666" points="105.5,-93.25 73,-93.25 73,-74 105.5,-74 105.5,-93.25"/>
-<text text-anchor="middle" x="89.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-69.52C44.67,-71.58 53.52,-74.03 61.73,-76.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.68,-79.64 71.25,-78.93 62.55,-72.89 60.68,-79.64"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0" target="_top" xlink:title="Updates a range of the segment tree.">
-<polygon fill="white" stroke="#666666" points="193.5,-19.25 148.25,-19.25 148.25,0 193.5,0 193.5,-19.25"/>
-<text text-anchor="middle" x="170.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge10_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge10_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.34,-58.1C61.94,-49.1 106.7,-32.73 137.34,-21.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.31,-24.9 146.5,-18.17 135.91,-18.32 138.31,-24.9"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.1,-130.54C152.27,-139.15 156.53,-148.25 170.88,-148.25 178.72,-148.25 183.55,-145.53 185.36,-141.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.86,-141.39 183.88,-132.03 181.95,-142.45 188.86,-141.39"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.1,-75.54C152.27,-84.15 156.53,-93.25 170.88,-93.25 178.72,-93.25 183.55,-90.53 185.36,-86.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.86,-86.39 183.88,-77.03 181.95,-87.45 188.86,-86.39"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge6_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge6_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.98,-90.94C115.12,-95.18 126.96,-100.68 137.97,-105.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.23,-108.85 146.78,-109.89 139.18,-102.5 136.23,-108.85"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge7_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge7_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.98,-80.07C115.57,-77.9 128.14,-75.06 139.59,-72.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.06,-75.95 149.04,-70.34 138.51,-69.13 140.06,-75.95"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge8_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge8_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.99,-73.65C113.69,-61.84 135.08,-41.96 150.66,-27.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153,-30.08 157.94,-20.71 148.24,-24.96 153,-30.08"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge9_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge9_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.1,-19.54C152.27,-28.15 156.53,-37.25 170.88,-37.25 178.72,-37.25 183.55,-34.53 185.36,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.86,-30.39 183.88,-21.03 181.95,-31.45 188.86,-30.39"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index b96c55099..000000000
--- a/d2/d45/segtree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="208pt" height="156pt"
- viewBox="0.00 0.00 208.25 156.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 152.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696" target="_top" xlink:title="for std::vector">
-<polygon fill="white" stroke="#666666" points="200.25,-130.25 141.5,-130.25 141.5,-111 200.25,-111 200.25,-130.25"/>
-<text text-anchor="middle" x="170.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">ConsTree</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.52,-74.66C40.77,-83.42 56.84,-95.78 73,-102.62 90.96,-110.23 112.14,-114.63 130.11,-117.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.53,-120.63 139.88,-118.4 130.4,-113.69 129.53,-120.63"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d" target="_top" xlink:title="Returns the sum of all elements in a range.">
-<polygon fill="white" stroke="#666666" points="190.88,-75.25 150.88,-75.25 150.88,-56 190.88,-56 190.88,-75.25"/>
-<text text-anchor="middle" x="170.88" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.29,-64.54C54.68,-64.48 81.91,-64.44 105.5,-64.62 116.46,-64.71 128.48,-64.88 139.12,-65.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.87,-68.55 148.92,-65.22 138.99,-61.55 138.87,-68.55"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementation.">
-<polygon fill="white" stroke="#666666" points="105.5,-93.25 73,-93.25 73,-74 105.5,-74 105.5,-93.25"/>
-<text text-anchor="middle" x="89.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-69.52C44.67,-71.58 53.52,-74.03 61.73,-76.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.68,-79.64 71.25,-78.93 62.55,-72.89 60.68,-79.64"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0" target="_top" xlink:title="Updates a range of the segment tree.">
-<polygon fill="white" stroke="#666666" points="193.5,-19.25 148.25,-19.25 148.25,0 193.5,0 193.5,-19.25"/>
-<text text-anchor="middle" x="170.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge10_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge10_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.34,-58.1C61.94,-49.1 106.7,-32.73 137.34,-21.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.31,-24.9 146.5,-18.17 135.91,-18.32 138.31,-24.9"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.1,-130.54C152.27,-139.15 156.53,-148.25 170.88,-148.25 178.72,-148.25 183.55,-145.53 185.36,-141.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.86,-141.39 183.88,-132.03 181.95,-142.45 188.86,-141.39"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.1,-75.54C152.27,-84.15 156.53,-93.25 170.88,-93.25 178.72,-93.25 183.55,-90.53 185.36,-86.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.86,-86.39 183.88,-77.03 181.95,-87.45 188.86,-86.39"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge6_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge6_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.98,-90.94C115.12,-95.18 126.96,-100.68 137.97,-105.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.23,-108.85 146.78,-109.89 139.18,-102.5 136.23,-108.85"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge7_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge7_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.98,-80.07C115.57,-77.9 128.14,-75.06 139.59,-72.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.06,-75.95 149.04,-70.34 138.51,-69.13 140.06,-75.95"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge8_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge8_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.99,-73.65C113.69,-61.84 135.08,-41.96 150.66,-27.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153,-30.08 157.94,-20.71 148.24,-24.96 153,-30.08"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge9_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge9_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.1,-19.54C152.27,-28.15 156.53,-37.25 170.88,-37.25 178.72,-37.25 183.55,-34.53 185.36,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.86,-30.39 183.88,-21.03 181.95,-31.45 188.86,-30.39"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d45/segtree_8cpp_ae752659b7c1719d68fdb2ca538a93696_cgraph.map b/d2/d45/segtree_8cpp_ae752659b7c1719d68fdb2ca538a93696_cgraph.map
deleted file mode 100644
index 317e58b89..000000000
--- a/d2/d45/segtree_8cpp_ae752659b7c1719d68fdb2ca538a93696_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="ConsTree" name="ConsTree">
-<area shape="rect" id="Node000001" title="for std::vector" alt="" coords="5,29,84,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="30,29,29,12,35,5,45,3,55,5,60,12,56,15,52,10,44,8,37,10,34,14,35,29"/>
-</map>
diff --git a/d2/d45/segtree_8cpp_ae752659b7c1719d68fdb2ca538a93696_cgraph.md5 b/d2/d45/segtree_8cpp_ae752659b7c1719d68fdb2ca538a93696_cgraph.md5
deleted file mode 100644
index 3b73e96c4..000000000
--- a/d2/d45/segtree_8cpp_ae752659b7c1719d68fdb2ca538a93696_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f00a82031718d136ff74e99fcc9e0f2f
\ No newline at end of file
diff --git a/d2/d45/segtree_8cpp_ae752659b7c1719d68fdb2ca538a93696_cgraph.svg b/d2/d45/segtree_8cpp_ae752659b7c1719d68fdb2ca538a93696_cgraph.svg
deleted file mode 100644
index 01c27a1e2..000000000
--- a/d2/d45/segtree_8cpp_ae752659b7c1719d68fdb2ca538a93696_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ConsTree Pages: 1 -->
-<svg width="67pt" height="45pt"
- viewBox="0.00 0.00 66.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>ConsTree</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="for std::vector">
-<polygon fill="#999999" stroke="#666666" points="58.75,-19.25 0,-19.25 0,0 58.75,0 58.75,-19.25"/>
-<text text-anchor="middle" x="29.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ConsTree</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.18,-19.54C15.98,-28.15 19.05,-37.25 29.38,-37.25 34.86,-37.25 38.3,-34.68 39.69,-30.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="43.17,-30.66 38.72,-21.04 36.2,-31.34 43.17,-30.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d45/segtree_8cpp_ae752659b7c1719d68fdb2ca538a93696_cgraph_org.svg b/d2/d45/segtree_8cpp_ae752659b7c1719d68fdb2ca538a93696_cgraph_org.svg
deleted file mode 100644
index 303cc1b0f..000000000
--- a/d2/d45/segtree_8cpp_ae752659b7c1719d68fdb2ca538a93696_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ConsTree Pages: 1 -->
-<svg width="67pt" height="45pt"
- viewBox="0.00 0.00 66.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>ConsTree</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="for std::vector">
-<polygon fill="#999999" stroke="#666666" points="58.75,-19.25 0,-19.25 0,0 58.75,0 58.75,-19.25"/>
-<text text-anchor="middle" x="29.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ConsTree</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.18,-19.54C15.98,-28.15 19.05,-37.25 29.38,-37.25 34.86,-37.25 38.3,-34.68 39.69,-30.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="43.17,-30.66 38.72,-21.04 36.2,-31.34 43.17,-30.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d45/segtree_8cpp_source.html b/d2/d45/segtree_8cpp_source.html
new file mode 100644
index 000000000..7e175920e
--- /dev/null
+++ b/d2/d45/segtree_8cpp_source.html
@@ -0,0 +1,306 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: range_queries/segtree.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d2/d45/segtree_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">segtree.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d2/d45/segtree_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;cmath&gt;</span>     </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;cstdint&gt;</span>   </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="foldopen" id="foldopen00038" data-start="{" data-end="}">
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="../../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696">   38</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696">ConsTree</a>(<span class="keyword">const</span> std::vector&lt;int64_t&gt; &amp;arr, std::vector&lt;int64_t&gt; *segtree,</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>              uint64_t low, uint64_t high, uint64_t pos) {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">if</span> (low == high) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        (*segtree)[pos] = arr[low];</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    uint64_t mid = (low + high) / 2;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696">ConsTree</a>(arr, segtree, low, mid, 2 * pos + 1);</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696">ConsTree</a>(arr, segtree, mid + 1, high, 2 * pos + 2);</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    (*segtree)[pos] = (*segtree)[2 * pos + 1] + (*segtree)[2 * pos + 2];</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>}</div>
+</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="foldopen" id="foldopen00063" data-start="{" data-end="}">
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"><a class="line" href="../../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d">   63</a></span>int64_t <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d">query</a>(std::vector&lt;int64_t&gt; *segtree, std::vector&lt;int64_t&gt; *lazy,</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>              uint64_t qlow, uint64_t qhigh, uint64_t low, uint64_t high,</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>              uint64_t pos) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">if</span> (low &gt; high || qlow &gt; high || low &gt; qhigh) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keywordflow">if</span> ((*lazy)[pos] != 0) {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        (*segtree)[pos] += (*lazy)[pos] * (high - low + 1);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        <span class="keywordflow">if</span> (low != high) {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            (*lazy)[2 * pos + 1] += (*lazy)[pos];</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            (*lazy)[2 * pos + 2] += (*lazy)[pos];</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        }</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        (*lazy)[pos] = 0;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    }</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordflow">if</span> (qlow &lt;= low &amp;&amp; qhigh &gt;= high) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <span class="keywordflow">return</span> (*segtree)[pos];</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    }</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    uint64_t mid = (low + high) / 2;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d">query</a>(segtree, lazy, qlow, qhigh, low, mid, 2 * pos + 1) +</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>           <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d">query</a>(segtree, lazy, qlow, qhigh, mid + 1, high, 2 * pos + 2);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>}</div>
+</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="foldopen" id="foldopen00103" data-start="{" data-end="}">
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"><a class="line" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">  103</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>(std::vector&lt;int64_t&gt; *segtree, std::vector&lt;int64_t&gt; *lazy,</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>            int64_t start, int64_t end, int64_t delta, uint64_t low,</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>            uint64_t high, uint64_t pos) {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="keywordflow">if</span> (low &gt; high) {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    }</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordflow">if</span> ((*lazy)[pos] != 0) {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        (*segtree)[pos] += (*lazy)[pos] * (high - low + 1);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        <span class="keywordflow">if</span> (low != high) {</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>            (*lazy)[2 * pos + 1] += (*lazy)[pos];</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>            (*lazy)[2 * pos + 2] += (*lazy)[pos];</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        }</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        (*lazy)[pos] = 0;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    }</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <span class="keywordflow">if</span> (start &gt; high || end &lt; low) {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    }</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    <span class="keywordflow">if</span> (start &lt;= low &amp;&amp; end &gt;= high) {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        (*segtree)[pos] += delta * (high - low + 1);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <span class="keywordflow">if</span> (low != high) {</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>            (*lazy)[2 * pos + 1] += delta;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>            (*lazy)[2 * pos + 2] += delta;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        }</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    }</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    uint64_t mid = (low + high) / 2;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span> </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>(segtree, lazy, start, end, delta, low, mid, 2 * pos + 1);</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>(segtree, lazy, start, end, delta, mid + 1, high, 2 * pos + 2);</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    (*segtree)[pos] = (*segtree)[2 * pos + 1] + (*segtree)[2 * pos + 2];</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>}</div>
+</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="foldopen" id="foldopen00147" data-start="{" data-end="}">
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"><a class="line" href="../../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  147</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    <span class="keyword">auto</span> max = <span class="keyword">static_cast&lt;</span>int64_t<span class="keyword">&gt;</span>(2 * pow(2, ceil(log2(7))) - 1);</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    assert(max == 15);</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    std::vector&lt;int64_t&gt; arr{1, 2, 3, 4, 5, 6, 7}, lazy(max), segtree(max);</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696">ConsTree</a>(arr, &amp;segtree, 0, 7 - 1, 0);</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span> </div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    assert(<a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d">query</a>(&amp;segtree, &amp;lazy, 1, 5, 0, 7 - 1, 0) == 2 + 3 + 4 + 5 + 6);</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span> </div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>(&amp;segtree, &amp;lazy, 2, 4, 1, 0, 7 - 1, 0);</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    assert(<a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d">query</a>(&amp;segtree, &amp;lazy, 1, 5, 0, 7 - 1, 0) == 2 + 4 + 5 + 6 + 6);</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span> </div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>(&amp;segtree, &amp;lazy, 0, 6, -2, 0, 7 - 1, 0);</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    assert(<a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d">query</a>(&amp;segtree, &amp;lazy, 0, 4, 0, 7 - 1, 0) == -1 + 0 + 2 + 3 + 4);</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>}</div>
+</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span> </div>
+<div class="foldopen" id="foldopen00168" data-start="{" data-end="}">
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"><a class="line" href="../../d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  168</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span> </div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter number of elements: &quot;</span>;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span> </div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    uint64_t n = 0;</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span> </div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    <span class="keyword">auto</span> max = <span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>(2 * pow(2, ceil(log2(n))) - 1);</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    std::vector&lt;int64_t&gt; arr(n), lazy(max), segtree(max);</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    <span class="keywordtype">int</span> choice = 0;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nDo you wish to enter each number?:\n&quot;</span></div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>                 <span class="stringliteral">&quot;1: Yes\n&quot;</span></div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>                 <span class="stringliteral">&quot;0: No (default initialize them to 0)\n&quot;</span>;</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span> </div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    std::cin &gt;&gt; choice;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    <span class="keywordflow">if</span> (choice == 1) {</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter &quot;</span> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; numbers:\n&quot;</span>;</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= n; i++) {</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>            std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;: &quot;</span>;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>            std::cin &gt;&gt; arr[i];</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>        }</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    }</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span> </div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696">ConsTree</a>(arr, &amp;segtree, 0, n - 1, 0);</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span> </div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nMake your choice:\n&quot;</span></div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>                     <span class="stringliteral">&quot;1: Range update (input)\n&quot;</span></div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>                     <span class="stringliteral">&quot;2: Range query (output)\n&quot;</span></div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>                     <span class="stringliteral">&quot;0: Exit\n&quot;</span>;</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>        std::cin &gt;&gt; choice;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span> </div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>        <span class="keywordflow">if</span> (choice == 1) {</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Enter 1-indexed lower bound, upper bound &amp; value:\n&quot;</span>;</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span> </div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>            uint64_t p = 1, q = 1, v = 0;</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>            std::cin &gt;&gt; p &gt;&gt; q &gt;&gt; v;</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>            <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>(&amp;segtree, &amp;lazy, p - 1, q - 1, v, 0, n - 1, 0);</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (choice == 2) {</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Enter 1-indexed lower bound &amp; upper bound:\n&quot;</span>;</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span> </div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>            uint64_t p = 1, q = 1;</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>            std::cin &gt;&gt; p &gt;&gt; q;</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>            std::cout &lt;&lt; <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d">query</a>(&amp;segtree, &amp;lazy, p - 1, q - 1, 0, n - 1, 0);</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>        }</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    } <span class="keywordflow">while</span> (choice &gt; 0);</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span> </div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>}</div>
+</div>
+<div class="ttc" id="asegtree_8cpp_html_a423a97ea0c7ea6e33b5844a6858d902d"><div class="ttname"><a href="../../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d">query</a></div><div class="ttdeci">int64_t query(std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, uint64_t qlow, uint64_t qhigh, uint64_t low, uint64_t high, uint64_t pos)</div><div class="ttdoc">Returns the sum of all elements in a range.</div><div class="ttdef"><b>Definition</b> <a href="#l00063">segtree.cpp:63</a></div></div>
+<div class="ttc" id="asegtree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> <a href="#l00147">segtree.cpp:147</a></div></div>
+<div class="ttc" id="asegtree_8cpp_html_abd3e818681fb2e29cf08f4f60f82c8e0"><div class="ttname"><a href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a></div><div class="ttdeci">void update(std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos)</div><div class="ttdoc">Updates a range of the segment tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00103">segtree.cpp:103</a></div></div>
+<div class="ttc" id="asegtree_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00168">segtree.cpp:168</a></div></div>
+<div class="ttc" id="asegtree_8cpp_html_ae752659b7c1719d68fdb2ca538a93696"><div class="ttname"><a href="../../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696">ConsTree</a></div><div class="ttdeci">void ConsTree(const std::vector&lt; int64_t &gt; &amp;arr, std::vector&lt; int64_t &gt; *segtree, uint64_t low, uint64_t high, uint64_t pos)</div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition</b> <a href="#l00038">segtree.cpp:38</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_074119ce3a874b57120c49a0cc4bb5ad.html">range_queries</a></li><li class="navelem"><a class="el" href="../../d2/d45/segtree_8cpp.html">segtree.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html b/d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html
new file mode 100644
index 000000000..ba4db9103
--- /dev/null
+++ b/d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html
@@ -0,0 +1,258 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * Author: Amit Kumar</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * Created: May 24, 2020</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * Copyright: 2020, Open-Source</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * Last Modified: May 25, 2020</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;bitset&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;limits&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;queue&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;tuple&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;utility&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment">// std::max capacity of node in graph</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="keyword">const</span> <span class="keywordtype">int</span> MAXN = 505;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="keyword">class </span><a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> {</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    std::vector&lt;std::vector&lt;int&gt; &gt; residual_capacity, capacity;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="keywordtype">int</span> total_nodes = 0;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keywordtype">int</span> total_edges = 0, source = 0, sink = 0;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    std::vector&lt;int&gt; parent;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    std::vector&lt;std::tuple&lt;int, int, int&gt; &gt; edge_participated;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    std::bitset&lt;MAXN&gt; visited;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="keywordtype">int</span> max_flow = 0;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="keywordtype">bool</span> bfs(<span class="keywordtype">int</span> source, <span class="keywordtype">int</span> sink) {  <span class="comment">//  to find the augmented - path</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        visited.reset();</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        std::queue&lt;int&gt; q;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>        q.push(source);</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        <span class="keywordtype">bool</span> is_path_found = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        <span class="keywordflow">while</span> (q.empty() == <span class="keyword">false</span> &amp;&amp; is_path_found == <span class="keyword">false</span>) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>            <span class="keywordtype">int</span> current_node = q.front();</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>            visited.set(current_node);</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>            q.pop();</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; total_nodes; ++i) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>                <span class="keywordflow">if</span> (residual_capacity[current_node][i] &gt; 0 &amp;&amp; !visited[i]) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>                    visited.set(i);</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>                    parent[i] = current_node;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>                    <span class="keywordflow">if</span> (i == sink) {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>                        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>                    }</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>                    q.push(i);</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>                }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>            }</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordtype">void</span> set_graph() {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        std::cin &gt;&gt; total_nodes &gt;&gt; total_edges &gt;&gt; source &gt;&gt; sink;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        parent = std::vector&lt;int&gt;(total_nodes, -1);</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        capacity = residual_capacity = std::vector&lt;std::vector&lt;int&gt; &gt;(</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            total_nodes, std::vector&lt;int&gt;(total_nodes));</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> start = 0, destination = 0, capacity_ = 0, i = 0;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>             i &lt; total_edges; ++i) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            std::cin &gt;&gt; start &gt;&gt; destination &gt;&gt; capacity_;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>            residual_capacity[start][destination] = capacity_;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            capacity[start][destination] = capacity_;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        }</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    }</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordtype">void</span> ford_fulkerson() {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">while</span> (bfs(source, sink)) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            <span class="keywordtype">int</span> current_node = sink;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            <span class="keywordtype">int</span> flow = std::numeric_limits&lt;int&gt;::max();</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            <span class="keywordflow">while</span> (current_node != source) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>                <span class="keywordtype">int</span> parent_ = parent[current_node];</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                flow = std::min(flow, residual_capacity[parent_][current_node]);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>                current_node = parent_;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            }</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>            current_node = sink;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            max_flow += flow;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            <span class="keywordflow">while</span> (current_node != source) {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>                <span class="keywordtype">int</span> parent_ = parent[current_node];</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>                residual_capacity[parent_][current_node] -= flow;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>                residual_capacity[current_node][parent_] += flow;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>                current_node = parent_;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            }</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    }</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keywordtype">void</span> print_flow_info() {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; total_nodes; ++i) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; total_nodes; ++j) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>                <span class="keywordflow">if</span> (capacity[i][j] &amp;&amp;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>                    residual_capacity[i][j] &lt; capacity[i][j]) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>                    edge_participated.emplace_back(std::make_tuple(</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>                        i, j, capacity[i][j] - residual_capacity[i][j]));</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>                }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>            }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nNodes : &quot;</span> &lt;&lt; total_nodes &lt;&lt; <span class="stringliteral">&quot;\nMax flow: &quot;</span> &lt;&lt; max_flow</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>                  &lt;&lt; <span class="stringliteral">&quot;\nEdge present in flow: &quot;</span> &lt;&lt; edge_participated.size()</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>                  &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nSource\tDestination\tCapacity\total_nodes&quot;</span>;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; edge_data : edge_participated) {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            <span class="keywordtype">int</span> source = 0, destination = 0, capacity_ = 0;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            std::tie(source, destination, capacity_) = edge_data;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>            std::cout &lt;&lt; source &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; destination &lt;&lt; <span class="stringliteral">&quot;\t\t&quot;</span> &lt;&lt; capacity_</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>                      &lt;&lt; <span class="charliteral">&#39;\t&#39;</span>;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        }</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    }</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>};</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="comment">/*</span></div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span><span class="comment">       Input Graph: (for testing )</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span><span class="comment">        4 5 0 3</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span><span class="comment">        0 1 10</span></div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span><span class="comment">        1 2 1</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span><span class="comment">        1 3 1</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span><span class="comment">        0 2 1</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span><span class="comment">        2 3 10</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.set_graph();</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.ford_fulkerson();</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.print_flow_info();</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>}</div>
+<div class="ttc" id="aclass_graph_html"><div class="ttname"><a href="../../da/d9a/class_graph.html">Graph</a></div><div class="ttdef"><b>Definition</b> <a href="../../df/d14/bellman__ford_8cpp_source.html#l00014">bellman_ford.cpp:14</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></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><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><b>max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d2/d52/heap__sort_8cpp.html b/d2/d52/heap__sort_8cpp.html
index ac77b461f..6e813bee3 100644
--- a/d2/d52/heap__sort_8cpp.html
+++ b/d2/d52/heap__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/heap_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/heap_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for heap_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/dfa/heap__sort_8cpp__incl.svg" width="270" height="111"><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">
+</div>
+<p><a href="../../d2/d52/heap__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a9ed3e1510afdf3edd06cf2b68769a767" id="r_a9ed3e1510afdf3edd06cf2b68769a767"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
@@ -142,6 +161,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="http://github.com/ayaankhan98" target="_blank">Ayaan Khan</a></dd></dl>
 <p>Heap-sort is a comparison-based sorting algorithm. Heap-sort can be thought of as an improved selection sort: like selection sort, heap sort divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the largest element from it and inserting it into the sorted region. Unlike selection sort, heap sort does not waste time with a linear-time scan of the unsorted region; rather, heap sort maintains the unsorted region in a heap data structure to more quickly find the largest element in each step.</p>
 <p>Time Complexity - \(O(n \log(n))\) </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d2/d52/heap__sort_8cpp_source.html">heap_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -158,17 +179,14 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d52/heap__sort_8cpp_source.html#l00120">120</a> of file <a class="el" href="../../d2/d52/heap__sort_8cpp_source.html">heap_sort.cpp</a>.</p>
 <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="#ae1a3968e7947464bee7714f6d43b7002">test</a>();</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="aheap__sort_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> heap_sort.cpp:99</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="427" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aheap__sort_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d52/heap__sort_8cpp_source.html#l00099">heap_sort.cpp:99</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a9ed3e1510afdf3edd06cf2b68769a767" name="a9ed3e1510afdf3edd06cf2b68769a767"></a>
@@ -199,11 +217,12 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d52/heap__sort_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../d2/d52/heap__sort_8cpp_source.html">heap_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   37</span>                                {</div>
-<div class="line"><span class="lineno">   38</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; sz; i++) <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
-<div class="line"><span class="lineno">   39</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   38</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; sz; i++) std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><span class="lineno">   39</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   40</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><!-- fragment -->
 </div>
 </div>
@@ -222,34 +241,30 @@ template&lt;typename T &gt; </div>
       </table>
 </div><div class="memdoc">
 <p>Test cases to test the program </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d52/heap__sort_8cpp_source.html#l00099">99</a> of file <a class="el" href="../../d2/d52/heap__sort_8cpp_source.html">heap_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   99</span>            {</div>
-<div class="line"><span class="lineno">  100</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  100</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  101</span>    <span class="keywordtype">int</span> arr[] = {-10, 78, -1, -6, 7, 4, 94, 5, 99, 0};</div>
 <div class="line"><span class="lineno">  102</span>    <span class="keywordtype">int</span> sz = <span class="keyword">sizeof</span>(arr) / <span class="keyword">sizeof</span>(arr[0]);  <span class="comment">// sz - size of array</span></div>
 <div class="line"><span class="lineno">  103</span>    <a class="code hl_function" href="#a9ed3e1510afdf3edd06cf2b68769a767">printArray</a>(arr, sz);  <span class="comment">// displaying the array before sorting</span></div>
 <div class="line"><span class="lineno">  104</span>    <a class="code hl_function" href="../../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f">heapSort</a>(arr, sz);    <span class="comment">// calling heapsort to sort the array</span></div>
 <div class="line"><span class="lineno">  105</span>    <a class="code hl_function" href="#a9ed3e1510afdf3edd06cf2b68769a767">printArray</a>(arr, sz);  <span class="comment">// display array after sorting</span></div>
-<div class="line"><span class="lineno">  106</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr, arr + sz));</div>
-<div class="line"><span class="lineno">  107</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed\n========================\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  106</span>    assert(std::is_sorted(arr, arr + sz));</div>
+<div class="line"><span class="lineno">  107</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed\n========================\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  108</span> </div>
-<div class="line"><span class="lineno">  109</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  109</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  110</span>    <span class="keywordtype">double</span> arr2[] = {4.5, -3.6, 7.6, 0, 12.9};</div>
 <div class="line"><span class="lineno">  111</span>    sz = <span class="keyword">sizeof</span>(arr2) / <span class="keyword">sizeof</span>(arr2[0]);</div>
 <div class="line"><span class="lineno">  112</span>    <a class="code hl_function" href="#a9ed3e1510afdf3edd06cf2b68769a767">printArray</a>(arr2, sz);</div>
 <div class="line"><span class="lineno">  113</span>    <a class="code hl_function" href="../../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f">heapSort</a>(arr2, sz);</div>
 <div class="line"><span class="lineno">  114</span>    <a class="code hl_function" href="#a9ed3e1510afdf3edd06cf2b68769a767">printArray</a>(arr2, sz);</div>
-<div class="line"><span class="lineno">  115</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr2, arr2 + sz));</div>
-<div class="line"><span class="lineno">  116</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2 passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  115</span>    assert(std::is_sorted(arr2, arr2 + sz));</div>
+<div class="line"><span class="lineno">  116</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  117</span>}</div>
-<div class="ttc" id="agroup__sorting_html_ga29d28b140174dbdde7c9f5157758435f"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f">heapSort</a></div><div class="ttdeci">void heapSort(T *arr, int n)</div><div class="ttdef"><b>Definition</b> heap_sort.cpp:84</div></div>
-<div class="ttc" id="aheap__sort_8cpp_html_a9ed3e1510afdf3edd06cf2b68769a767"><div class="ttname"><a href="#a9ed3e1510afdf3edd06cf2b68769a767">printArray</a></div><div class="ttdeci">void printArray(T *arr, int sz)</div><div class="ttdef"><b>Definition</b> heap_sort.cpp:37</div></div>
-<div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg" width="330" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agroup__sorting_html_ga29d28b140174dbdde7c9f5157758435f"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f">heapSort</a></div><div class="ttdeci">void heapSort(T *arr, int n)</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d52/heap__sort_8cpp_source.html#l00084">heap_sort.cpp:84</a></div></div>
+<div class="ttc" id="aheap__sort_8cpp_html_a9ed3e1510afdf3edd06cf2b68769a767"><div class="ttname"><a href="#a9ed3e1510afdf3edd06cf2b68769a767">printArray</a></div><div class="ttdeci">void printArray(T *arr, int sz)</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d52/heap__sort_8cpp_source.html#l00037">heap_sort.cpp:37</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map b/d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
deleted file mode 100644
index 5753d8a03..000000000
--- a/d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,49,80"/>
-<area shape="rect" id="Node000002" href="$d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f" title=" " alt="" coords="110,5,184,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,56,99,35,101,40,50,61"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="97,55,197,80"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,65,81,65,81,70,49,70"/>
-<area shape="rect" id="Node000005" href="$d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767" title=" " alt="" coords="108,104,186,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="50,74,101,95,99,100,48,79"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="245,5,323,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="184,16,230,16,230,21,184,21"/>
-</map>
diff --git a/d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5 b/d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
deleted file mode 100644
index a8b24f1f9..000000000
--- a/d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-94d37da0b99610d699fdce229cd29aa5
\ No newline at end of file
diff --git a/d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg b/d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
deleted file mode 100644
index c624a443f..000000000
--- a/d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="247pt" height="101pt"
- viewBox="0.00 0.00 246.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-56.25 0,-56.25 0,-37 32.5,-37 32.5,-56.25"/>
-<text text-anchor="middle" x="16.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="133.62,-93.25 78.62,-93.25 78.62,-74 133.62,-74 133.62,-93.25"/>
-<text text-anchor="middle" x="106.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">heapSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-53.24C43.45,-57.66 57.66,-63.64 70.7,-69.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.3,-72.34 79.88,-72.99 72.02,-65.89 69.3,-72.34"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.75,-56.25 68.5,-56.25 68.5,-37 143.75,-37 143.75,-56.25"/>
-<text text-anchor="middle" x="106.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-46.62C39.76,-46.62 48.12,-46.62 56.71,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.51,-50.13 66.51,-46.63 56.51,-43.13 56.51,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.12,-19.25 77.12,-19.25 77.12,0 135.12,0 135.12,-19.25"/>
-<text text-anchor="middle" x="106.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">printArray</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-40.01C43.45,-35.59 57.66,-29.61 70.7,-24.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.02,-27.36 79.88,-20.26 69.3,-20.91 72.02,-27.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.5,-93.25 179.75,-93.25 179.75,-74 238.5,-74 238.5,-93.25"/>
-<text text-anchor="middle" x="209.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.93,-83.62C144.45,-83.62 156.74,-83.62 168.26,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.91,-87.13 177.91,-83.63 167.91,-80.13 167.91,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg b/d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
deleted file mode 100644
index 7f65a48d0..000000000
--- a/d2/d52/heap__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="247pt" height="101pt"
- viewBox="0.00 0.00 246.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-56.25 0,-56.25 0,-37 32.5,-37 32.5,-56.25"/>
-<text text-anchor="middle" x="16.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="133.62,-93.25 78.62,-93.25 78.62,-74 133.62,-74 133.62,-93.25"/>
-<text text-anchor="middle" x="106.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">heapSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-53.24C43.45,-57.66 57.66,-63.64 70.7,-69.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.3,-72.34 79.88,-72.99 72.02,-65.89 69.3,-72.34"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.75,-56.25 68.5,-56.25 68.5,-37 143.75,-37 143.75,-56.25"/>
-<text text-anchor="middle" x="106.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-46.62C39.76,-46.62 48.12,-46.62 56.71,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.51,-50.13 66.51,-46.63 56.51,-43.13 56.51,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.12,-19.25 77.12,-19.25 77.12,0 135.12,0 135.12,-19.25"/>
-<text text-anchor="middle" x="106.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">printArray</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-40.01C43.45,-35.59 57.66,-29.61 70.7,-24.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.02,-27.36 79.88,-20.26 69.3,-20.91 72.02,-27.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.5,-93.25 179.75,-93.25 179.75,-74 238.5,-74 238.5,-93.25"/>
-<text text-anchor="middle" x="209.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.93,-83.62C144.45,-83.62 156.74,-83.62 168.26,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.91,-87.13 177.91,-83.63 167.91,-80.13 167.91,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 9d4143fcd..000000000
--- a/d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,55,80"/>
-<area shape="rect" id="Node000002" href="$d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" title=" " alt="" coords="103,55,146,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,65,87,65,87,70,55,70"/>
-<area shape="rect" id="Node000003" href="$d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f" title=" " alt="" coords="208,5,281,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,56,196,35,198,40,148,61"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="194,55,294,80"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="147,65,178,65,178,70,147,70"/>
-<area shape="rect" id="Node000006" href="$d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767" title=" " alt="" coords="206,104,283,130"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="148,74,198,95,196,100,146,79"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="342,5,421,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="281,16,327,16,327,21,281,21"/>
-</map>
diff --git a/d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index e4e0d37fa..000000000
--- a/d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-05a647d7162638950bebf70232260678
\ No newline at end of file
diff --git a/d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 661f8def8..000000000
--- a/d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="320pt" height="101pt"
- viewBox="0.00 0.00 319.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-56.25 73,-56.25 73,-37 105.5,-37 105.5,-56.25"/>
-<text text-anchor="middle" x="89.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-46.62C44.58,-46.62 53.31,-46.62 61.45,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-50.13 71.2,-46.63 61.2,-43.13 61.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="206.62,-93.25 151.62,-93.25 151.62,-74 206.62,-74 206.62,-93.25"/>
-<text text-anchor="middle" x="179.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">heapSort</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-53.24C116.45,-57.66 130.66,-63.64 143.7,-69.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.3,-72.34 152.88,-72.99 145.02,-65.89 142.3,-72.34"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.75,-56.25 141.5,-56.25 141.5,-37 216.75,-37 216.75,-56.25"/>
-<text text-anchor="middle" x="179.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-46.62C112.76,-46.62 121.12,-46.62 129.71,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.51,-50.13 139.51,-46.63 129.51,-43.13 129.51,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="208.12,-19.25 150.12,-19.25 150.12,0 208.12,0 208.12,-19.25"/>
-<text text-anchor="middle" x="179.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">printArray</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-40.01C116.45,-35.59 130.66,-29.61 143.7,-24.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.02,-27.36 152.88,-20.26 142.3,-20.91 145.02,-27.36"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="311.5,-93.25 252.75,-93.25 252.75,-74 311.5,-74 311.5,-93.25"/>
-<text text-anchor="middle" x="282.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M206.93,-83.62C217.45,-83.62 229.74,-83.62 241.26,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="240.91,-87.13 250.91,-83.63 240.91,-80.13 240.91,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 0a081eaca..000000000
--- a/d2/d52/heap__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="320pt" height="101pt"
- viewBox="0.00 0.00 319.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-56.25 73,-56.25 73,-37 105.5,-37 105.5,-56.25"/>
-<text text-anchor="middle" x="89.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-46.62C44.58,-46.62 53.31,-46.62 61.45,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-50.13 71.2,-46.63 61.2,-43.13 61.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="206.62,-93.25 151.62,-93.25 151.62,-74 206.62,-74 206.62,-93.25"/>
-<text text-anchor="middle" x="179.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">heapSort</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-53.24C116.45,-57.66 130.66,-63.64 143.7,-69.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.3,-72.34 152.88,-72.99 145.02,-65.89 142.3,-72.34"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.75,-56.25 141.5,-56.25 141.5,-37 216.75,-37 216.75,-56.25"/>
-<text text-anchor="middle" x="179.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-46.62C112.76,-46.62 121.12,-46.62 129.71,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.51,-50.13 139.51,-46.63 129.51,-43.13 129.51,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="208.12,-19.25 150.12,-19.25 150.12,0 208.12,0 208.12,-19.25"/>
-<text text-anchor="middle" x="179.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">printArray</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-40.01C116.45,-35.59 130.66,-29.61 143.7,-24.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.02,-27.36 152.88,-20.26 142.3,-20.91 145.02,-27.36"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="311.5,-93.25 252.75,-93.25 252.75,-74 311.5,-74 311.5,-93.25"/>
-<text text-anchor="middle" x="282.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M206.93,-83.62C217.45,-83.62 229.74,-83.62 241.26,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="240.91,-87.13 250.91,-83.63 240.91,-80.13 240.91,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d52/heap__sort_8cpp_source.html b/d2/d52/heap__sort_8cpp_source.html
new file mode 100644
index 000000000..accfc1176
--- /dev/null
+++ b/d2/d52/heap__sort_8cpp_source.html
@@ -0,0 +1,213 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/heap_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d2/d52/heap__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">heap_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d2/d52/heap__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="}">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767">   37</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767">printArray</a>(T *arr, <span class="keywordtype">int</span> sz) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; sz; i++) std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>}</div>
+</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="keywordtype">void</span> heapify(T *arr, <span class="keywordtype">int</span> n, <span class="keywordtype">int</span> i) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordtype">int</span> largest = i;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> = 2 * i + 1;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordtype">int</span> r = 2 * i + 2;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordflow">if</span> (l &lt; n &amp;&amp; arr[l] &gt; arr[largest])</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        largest = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">if</span> (r &lt; n &amp;&amp; arr[r] &gt; arr[largest])</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        largest = r;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordflow">if</span> (largest != i) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        std::swap(arr[i], arr[largest]);</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        heapify(arr, n, largest);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    }</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>}</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00084" data-start="{" data-end="}">
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"><a class="line" href="../../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f">   84</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f">heapSort</a>(T *arr, <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = n - 1; i &gt;= 0; i--) heapify(arr, n, i);</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = n - 1; i &gt;= 0; i--) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        std::swap(arr[0], arr[i]);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        heapify(arr, i, 0);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>}</div>
+</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="foldopen" id="foldopen00099" data-start="{" data-end="}">
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"><a class="line" href="../../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">   99</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1\n&quot;</span>;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keywordtype">int</span> arr[] = {-10, 78, -1, -6, 7, 4, 94, 5, 99, 0};</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="keywordtype">int</span> sz = <span class="keyword">sizeof</span>(arr) / <span class="keyword">sizeof</span>(arr[0]);  <span class="comment">// sz - size of array</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <a class="code hl_function" href="../../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767">printArray</a>(arr, sz);  <span class="comment">// displaying the array before sorting</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <a class="code hl_function" href="../../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f">heapSort</a>(arr, sz);    <span class="comment">// calling heapsort to sort the array</span></div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <a class="code hl_function" href="../../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767">printArray</a>(arr, sz);  <span class="comment">// display array after sorting</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    assert(std::is_sorted(arr, arr + sz));</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed\n========================\n&quot;</span>;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2\n&quot;</span>;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordtype">double</span> arr2[] = {4.5, -3.6, 7.6, 0, 12.9};</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    sz = <span class="keyword">sizeof</span>(arr2) / <span class="keyword">sizeof</span>(arr2[0]);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <a class="code hl_function" href="../../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767">printArray</a>(arr2, sz);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <a class="code hl_function" href="../../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f">heapSort</a>(arr2, sz);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <a class="code hl_function" href="../../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767">printArray</a>(arr2, sz);</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    assert(std::is_sorted(arr2, arr2 + sz));</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 passed\n&quot;</span>;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>}</div>
+</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="foldopen" id="foldopen00120" data-start="{" data-end="}">
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"><a class="line" href="../../d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  120</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <a class="code hl_function" href="../../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>}</div>
+</div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00119">composite_simpson_rule.cpp:119</a></div></div>
+<div class="ttc" id="agroup__sorting_html_ga29d28b140174dbdde7c9f5157758435f"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f">heapSort</a></div><div class="ttdeci">void heapSort(T *arr, int n)</div><div class="ttdef"><b>Definition</b> <a href="#l00084">heap_sort.cpp:84</a></div></div>
+<div class="ttc" id="aheap__sort_8cpp_html_a9ed3e1510afdf3edd06cf2b68769a767"><div class="ttname"><a href="../../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767">printArray</a></div><div class="ttdeci">void printArray(T *arr, int sz)</div><div class="ttdef"><b>Definition</b> <a href="#l00037">heap_sort.cpp:37</a></div></div>
+<div class="ttc" id="aheap__sort_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00099">heap_sort.cpp:99</a></div></div>
+<div class="ttc" id="aheap__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00120">heap_sort.cpp:120</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d2/d52/heap__sort_8cpp.html">heap_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d2/d58/neural__network_8cpp.html b/d2/d58/neural__network_8cpp.html
index c522822aa..6099e28fa 100644
--- a/d2/d58/neural__network_8cpp.html
+++ b/d2/d58/neural__network_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: machine_learning/neural_network.cpp File Reference</title>
+<title>TheAlgorithms/C++: machine_learning/neural_network.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -130,7 +147,9 @@ Include dependency graph for neural_network.cpp:</div>
 <div class="dyncontent">
 <div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d2/d23/neural__network_8cpp__incl.svg" width="100%" height="449"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
 </div>
-</div><table class="memberdecls">
+</div>
+<p><a href="../../d2/d58/neural__network_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">machine_learning::neural_network::layers::DenseLayer</a></td></tr>
@@ -187,6 +206,8 @@ Functions</h2></td></tr>
 <p>An MLP consists of at least three layers of nodes: an input layer, a hidden layer and an output layer. Except for the input nodes, each node is a neuron that uses a nonlinear activation function. MLP utilizes a supervised learning technique called backpropagation for training. Its multiple layers and non-linear activation distinguish MLP from a linear perceptron. It can distinguish data that is not linearly separable.</p>
 <p>See <a href="https://en.wikipedia.org/wiki/Backpropagation" target="_blank">Backpropagation</a> for training algorithm.</p>
 <dl class="section note"><dt>Note</dt><dd>This implementation uses mini-batch gradient descent as optimizer and MSE as loss function. Bias is also not included. </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="aa69e95a34054d7989bf446f96b2ffaf9" name="aa69e95a34054d7989bf446f96b2ffaf9"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aa69e95a34054d7989bf446f96b2ffaf9">&#9670;&#160;</a></span>drelu()</h2>
@@ -209,13 +230,10 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>derivative of relu(x) </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   81</span>{ <span class="keywordflow">return</span> x &gt;= 0.0 ? 1.0 : 0.0; }</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="../../d2/d58/neural__network_8cpp_aa69e95a34054d7989bf446f96b2ffaf9_cgraph.svg" width="192" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00081">81</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   81</span>{ <span class="keywordflow">return</span> x &gt;= 0.0 ? 1.0 : 0.0; }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a76eb66212d577f948a457b6e29d87c46" name="a76eb66212d577f948a457b6e29d87c46"></a>
@@ -239,13 +257,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Returns derivative of sigmoid(x) </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   67</span>{ <span class="keywordflow">return</span> x * (1 - x); }</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="../../d2/d58/neural__network_8cpp_a76eb66212d577f948a457b6e29d87c46_cgraph.svg" width="176" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   67</span>{ <span class="keywordflow">return</span> x * (1 - x); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2a5e874b9774aa5362dbcf288828b95c" name="a2a5e874b9774aa5362dbcf288828b95c"></a>
@@ -269,13 +284,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Returns derivative of tanh(x) </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   95</span>{ <span class="keywordflow">return</span> 1 - x * x; }</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="../../d2/d58/neural__network_8cpp_a2a5e874b9774aa5362dbcf288828b95c_cgraph.svg" width="196" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00095">95</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   95</span>{ <span class="keywordflow">return</span> 1 - x * x; }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a32c00da08f2cf641dd336270f6e3c407" name="a32c00da08f2cf641dd336270f6e3c407"></a>
@@ -299,13 +311,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Returns x </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  112</span>{ <span class="keywordflow">return</span> x; }</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="../../d2/d58/neural__network_8cpp_a32c00da08f2cf641dd336270f6e3c407_cgraph.svg" width="176" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00112">112</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  112</span>{ <span class="keywordflow">return</span> x; }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -325,18 +334,15 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00833">833</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  833</span>           {</div>
 <div class="line"><span class="lineno">  834</span>    <span class="comment">// Testing</span></div>
 <div class="line"><span class="lineno">  835</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
 <div class="line"><span class="lineno">  836</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  837</span>}</div>
-<div class="ttc" id="aneural__network_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> neural_network.cpp:805</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aneural__network_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d58/neural__network_8cpp_source.html#l00805">neural_network.cpp:805</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af8f264600754602b6a9ea19cc690e50e" name="af8f264600754602b6a9ea19cc690e50e"></a>
@@ -360,14 +366,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>relu(x) </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   74</span>{ <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(0.0, x); }</div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-</div><!-- 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="../../d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph.svg" width="306" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00074">74</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   74</span>{ <span class="keywordflow">return</span> std::max(0.0, x); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a23aa9d32bcbcd65cfc85f0a41e2afadc" name="a23aa9d32bcbcd65cfc85f0a41e2afadc"></a>
@@ -391,14 +393,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Returns sigmoid(x) </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   60</span>{ <span class="keywordflow">return</span> 1.0 / (1.0 + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a>(-x)); }</div>
-<div class="ttc" id="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.svg" width="292" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00060">60</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   60</span>{ <span class="keywordflow">return</span> 1.0 / (1.0 + std::exp(-x)); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a45d3e30406712ada3d9713ece3c1b153" name="a45d3e30406712ada3d9713ece3c1b153"></a>
@@ -422,13 +420,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Returns x * x </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  106</span>{ <span class="keywordflow">return</span> x * x; }</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="../../d2/d58/neural__network_8cpp_a45d3e30406712ada3d9713ece3c1b153_cgraph.svg" width="176" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00106">106</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  106</span>{ <span class="keywordflow">return</span> x * x; }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a371aa7dd5d5add0143d1756bb0a1b32f" name="a371aa7dd5d5add0143d1756bb0a1b32f"></a>
@@ -452,13 +447,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Returns tanh(x) </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   88</span>{ <span class="keywordflow">return</span> 2 / (1 + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a>(-2 * x)) - 1; }</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="../../d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph.svg" width="306" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00088">88</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   88</span>{ <span class="keywordflow">return</span> 2 / (1 + std::exp(-2 * x)) - 1; }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -484,6 +476,8 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Function to test neural network </p><dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00805">805</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  805</span>                   {</div>
 <div class="line"><span class="lineno">  806</span>    <span class="comment">// Creating network with 3 layers for &quot;iris.csv&quot;</span></div>
 <div class="line"><span class="lineno">  807</span>    <a class="code hl_class" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">machine_learning::neural_network::NeuralNetwork</a> myNN =</div>
@@ -507,17 +501,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  825</span>               myNN.<a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f">single_predict</a>({{6.2, 3.4, 5.4, 2.3}})) == 2);</div>
 <div class="line"><span class="lineno">  826</span>    <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  827</span>}</div>
-<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">machine_learning::neural_network::NeuralNetwork</a></div><div class="ttdef"><b>Definition</b> neural_network.cpp:247</div></div>
-<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a3b9eac1824d365dce715fb17c33cb96f"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f">machine_learning::neural_network::NeuralNetwork::single_predict</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; double &gt; &gt; single_predict(const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</div><div class="ttdef"><b>Definition</b> neural_network.cpp:451</div></div>
-<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a5172a6791b9bd24f4232bab8d6b81fff"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff">machine_learning::neural_network::NeuralNetwork::fit_from_csv</a></div><div class="ttdeci">void fit_from_csv(const std::string &amp;file_name, const bool &amp;last_label, const int &amp;epochs, const double &amp;learning_rate, const bool &amp;normalize, const int &amp;slip_lines=1, const size_t &amp;batch_size=32, const bool &amp;shuffle=true)</div><div class="ttdef"><b>Definition</b> neural_network.cpp:587</div></div>
-<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a61d30113d13304c664057118b92a5931"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931">machine_learning::neural_network::NeuralNetwork::summary</a></div><div class="ttdeci">void summary()</div><div class="ttdef"><b>Definition</b> neural_network.cpp:773</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a50480fccfb39de20ca47f1bf51ecb6ec"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">machine_learning::argmax</a></div><div class="ttdeci">size_t argmax(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:307</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">machine_learning::neural_network::NeuralNetwork</a></div><div class="ttdef"><b>Definition</b> <a href="../../d2/d58/neural__network_8cpp_source.html#l00247">neural_network.cpp:247</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a3b9eac1824d365dce715fb17c33cb96f"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f">machine_learning::neural_network::NeuralNetwork::single_predict</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; double &gt; &gt; single_predict(const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d58/neural__network_8cpp_source.html#l00451">neural_network.cpp:451</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a5172a6791b9bd24f4232bab8d6b81fff"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff">machine_learning::neural_network::NeuralNetwork::fit_from_csv</a></div><div class="ttdeci">void fit_from_csv(const std::string &amp;file_name, const bool &amp;last_label, const int &amp;epochs, const double &amp;learning_rate, const bool &amp;normalize, const int &amp;slip_lines=1, const size_t &amp;batch_size=32, const bool &amp;shuffle=true)</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d58/neural__network_8cpp_source.html#l00587">neural_network.cpp:587</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a61d30113d13304c664057118b92a5931"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931">machine_learning::neural_network::NeuralNetwork::summary</a></div><div class="ttdeci">void summary()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d58/neural__network_8cpp_source.html#l00773">neural_network.cpp:773</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a50480fccfb39de20ca47f1bf51ecb6ec"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">machine_learning::argmax</a></div><div class="ttdeci">size_t argmax(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00307">vector_ops.hpp:307</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.map b/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.map
deleted file mode 100644
index c67c62f0c..000000000
--- a/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="machine_learning::neural_network::activations::sigmoid" name="machine_learning::neural_network::activations::sigmoid">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,171,85"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="55,29,55,19,61,10,72,5,88,3,105,5,116,12,113,16,104,10,88,8,74,10,65,14,60,21,60,29"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/exp.html#" title=" " alt="" coords="219,44,287,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="171,54,203,54,203,60,171,60"/>
-</map>
diff --git a/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.md5 b/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.md5
deleted file mode 100644
index 1f43ce89b..000000000
--- a/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-86024219bf2cdce1a7d8211f0178d1e3
\ No newline at end of file
diff --git a/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.svg b/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.svg
deleted file mode 100644
index d119dbc22..000000000
--- a/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::activations::sigmoid Pages: 1 -->
-<svg width="219pt" height="68pt"
- viewBox="0.00 0.00 219.25 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>machine_learning::neural_network::activations::sigmoid</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124,-41.75 0,-41.75 0,0 124,0 124,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_network::activations::</text>
-<text text-anchor="middle" x="62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sigmoid</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.18,-42.07C37.01,-51.55 44.62,-59.75 62,-59.75 71.78,-59.75 78.46,-57.16 82.05,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.44,-54.09 84.45,-43.54 78.65,-52.4 85.44,-54.09"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="211.25,-30.5 160,-30.5 160,-11.25 211.25,-11.25 211.25,-30.5"/>
-<text text-anchor="middle" x="185.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.17,-20.88C132.4,-20.88 140.62,-20.88 148.23,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.08,-24.38 158.08,-20.88 148.08,-17.38 148.08,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph_org.svg b/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph_org.svg
deleted file mode 100644
index 6b024d2c7..000000000
--- a/d2/d58/neural__network_8cpp_a23aa9d32bcbcd65cfc85f0a41e2afadc_cgraph_org.svg
+++ /dev/null
@@ -1,50 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::activations::sigmoid Pages: 1 -->
-<svg width="219pt" height="68pt"
- viewBox="0.00 0.00 219.25 67.75" 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 63.75)">
-<title>machine_learning::neural_network::activations::sigmoid</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124,-41.75 0,-41.75 0,0 124,0 124,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_network::activations::</text>
-<text text-anchor="middle" x="62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sigmoid</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.18,-42.07C37.01,-51.55 44.62,-59.75 62,-59.75 71.78,-59.75 78.46,-57.16 82.05,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.44,-54.09 84.45,-43.54 78.65,-52.4 85.44,-54.09"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="211.25,-30.5 160,-30.5 160,-11.25 211.25,-11.25 211.25,-30.5"/>
-<text text-anchor="middle" x="185.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.17,-20.88C132.4,-20.88 140.62,-20.88 148.23,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.08,-24.38 158.08,-20.88 148.08,-17.38 148.08,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_a2a5e874b9774aa5362dbcf288828b95c_cgraph.map b/d2/d58/neural__network_8cpp_a2a5e874b9774aa5362dbcf288828b95c_cgraph.map
deleted file mode 100644
index f87460f4d..000000000
--- a/d2/d58/neural__network_8cpp_a2a5e874b9774aa5362dbcf288828b95c_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="machine_learning::neural_network::activations::dtanh" name="machine_learning::neural_network::activations::dtanh">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,191,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="63,29,61,19,67,10,79,5,98,3,118,5,130,11,128,16,117,10,98,8,81,10,70,15,66,20,68,28"/>
-</map>
diff --git a/d2/d58/neural__network_8cpp_a2a5e874b9774aa5362dbcf288828b95c_cgraph.md5 b/d2/d58/neural__network_8cpp_a2a5e874b9774aa5362dbcf288828b95c_cgraph.md5
deleted file mode 100644
index 7c204f537..000000000
--- a/d2/d58/neural__network_8cpp_a2a5e874b9774aa5362dbcf288828b95c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8b00f2557a77578ba6bce4e64378dbdf
\ No newline at end of file
diff --git a/d2/d58/neural__network_8cpp_a2a5e874b9774aa5362dbcf288828b95c_cgraph.svg b/d2/d58/neural__network_8cpp_a2a5e874b9774aa5362dbcf288828b95c_cgraph.svg
deleted file mode 100644
index fa4c31f11..000000000
--- a/d2/d58/neural__network_8cpp_a2a5e874b9774aa5362dbcf288828b95c_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::activations::dtanh Pages: 1 -->
-<svg width="147pt" height="57pt"
- viewBox="0.00 0.00 147.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>machine_learning::neural_network::activations::dtanh</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="139,-30.5 0,-30.5 0,0 139,0 139,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="middle" x="69.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::activations::dtanh</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44.87,-30.99C39.84,-40.06 48.05,-48.5 69.5,-48.5 81.23,-48.5 89,-45.97 92.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.26,-42.83 93.95,-32.49 89.31,-42.01 96.26,-42.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_a2a5e874b9774aa5362dbcf288828b95c_cgraph_org.svg b/d2/d58/neural__network_8cpp_a2a5e874b9774aa5362dbcf288828b95c_cgraph_org.svg
deleted file mode 100644
index 8e65e5d4a..000000000
--- a/d2/d58/neural__network_8cpp_a2a5e874b9774aa5362dbcf288828b95c_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::activations::dtanh Pages: 1 -->
-<svg width="147pt" height="57pt"
- viewBox="0.00 0.00 147.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>machine_learning::neural_network::activations::dtanh</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="139,-30.5 0,-30.5 0,0 139,0 139,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="middle" x="69.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::activations::dtanh</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44.87,-30.99C39.84,-40.06 48.05,-48.5 69.5,-48.5 81.23,-48.5 89,-45.97 92.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.26,-42.83 93.95,-32.49 89.31,-42.01 96.26,-42.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_a32c00da08f2cf641dd336270f6e3c407_cgraph.map b/d2/d58/neural__network_8cpp_a32c00da08f2cf641dd336270f6e3c407_cgraph.map
deleted file mode 100644
index 8cd21f0b0..000000000
--- a/d2/d58/neural__network_8cpp_a32c00da08f2cf641dd336270f6e3c407_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="machine_learning::neural_network::util_functions::identity_function" name="machine_learning::neural_network::util_functions::identity_function">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,171,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="55,29,55,19,61,10,72,5,88,3,105,5,116,12,113,16,104,10,88,8,74,10,65,14,60,21,60,29"/>
-</map>
diff --git a/d2/d58/neural__network_8cpp_a32c00da08f2cf641dd336270f6e3c407_cgraph.md5 b/d2/d58/neural__network_8cpp_a32c00da08f2cf641dd336270f6e3c407_cgraph.md5
deleted file mode 100644
index 971e0810b..000000000
--- a/d2/d58/neural__network_8cpp_a32c00da08f2cf641dd336270f6e3c407_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2a73596ce987e153a5ec1337f33de5e9
\ No newline at end of file
diff --git a/d2/d58/neural__network_8cpp_a32c00da08f2cf641dd336270f6e3c407_cgraph.svg b/d2/d58/neural__network_8cpp_a32c00da08f2cf641dd336270f6e3c407_cgraph.svg
deleted file mode 100644
index a77ba5a09..000000000
--- a/d2/d58/neural__network_8cpp_a32c00da08f2cf641dd336270f6e3c407_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::util_functions::identity_function Pages: 1 -->
-<svg width="132pt" height="68pt"
- viewBox="0.00 0.00 132.00 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>machine_learning::neural_network::util_functions::identity_function</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124,-41.75 0,-41.75 0,0 124,0 124,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_network::util_functions</text>
-<text text-anchor="middle" x="62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::identity_function</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.11,-42.07C36.93,-51.55 44.56,-59.75 62,-59.75 71.81,-59.75 78.51,-57.16 82.12,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.5,-54.09 84.52,-43.54 78.71,-52.39 85.5,-54.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_a32c00da08f2cf641dd336270f6e3c407_cgraph_org.svg b/d2/d58/neural__network_8cpp_a32c00da08f2cf641dd336270f6e3c407_cgraph_org.svg
deleted file mode 100644
index 485f9d8e3..000000000
--- a/d2/d58/neural__network_8cpp_a32c00da08f2cf641dd336270f6e3c407_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::util_functions::identity_function Pages: 1 -->
-<svg width="132pt" height="68pt"
- viewBox="0.00 0.00 132.00 67.75" 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 63.75)">
-<title>machine_learning::neural_network::util_functions::identity_function</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124,-41.75 0,-41.75 0,0 124,0 124,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_network::util_functions</text>
-<text text-anchor="middle" x="62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::identity_function</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.11,-42.07C36.93,-51.55 44.56,-59.75 62,-59.75 71.81,-59.75 78.51,-57.16 82.12,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.5,-54.09 84.52,-43.54 78.71,-52.39 85.5,-54.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph.map b/d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph.map
deleted file mode 100644
index 0f20969ee..000000000
--- a/d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="machine_learning::neural_network::activations::tanh" name="machine_learning::neural_network::activations::tanh">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,184,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/exp.html#" title=" " alt="" coords="232,13,300,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="184,23,216,23,216,28,184,28"/>
-</map>
diff --git a/d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph.md5 b/d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph.md5
deleted file mode 100644
index 24742e288..000000000
--- a/d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2258f4231a4d2995124f5064b8a5d1f7
\ No newline at end of file
diff --git a/d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph.svg b/d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph.svg
deleted file mode 100644
index d7700e151..000000000
--- a/d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::activations::tanh Pages: 1 -->
-<svg width="229pt" height="39pt"
- viewBox="0.00 0.00 229.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>machine_learning::neural_network::activations::tanh</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="133.75,-30.5 0,-30.5 0,0 133.75,0 133.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="middle" x="66.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::activations::tanh</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221,-24.88 169.75,-24.88 169.75,-5.63 221,-5.63 221,-24.88"/>
-<text text-anchor="middle" x="195.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.09,-15.25C142.33,-15.25 150.5,-15.25 158.04,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.78,-18.75 167.78,-15.25 157.78,-11.75 157.78,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph_org.svg b/d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph_org.svg
deleted file mode 100644
index ef9d2d3b9..000000000
--- a/d2/d58/neural__network_8cpp_a371aa7dd5d5add0143d1756bb0a1b32f_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::activations::tanh Pages: 1 -->
-<svg width="229pt" height="39pt"
- viewBox="0.00 0.00 229.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>machine_learning::neural_network::activations::tanh</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="133.75,-30.5 0,-30.5 0,0 133.75,0 133.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="middle" x="66.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::activations::tanh</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221,-24.88 169.75,-24.88 169.75,-5.63 221,-5.63 221,-24.88"/>
-<text text-anchor="middle" x="195.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.09,-15.25C142.33,-15.25 150.5,-15.25 158.04,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.78,-18.75 167.78,-15.25 157.78,-11.75 157.78,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_a45d3e30406712ada3d9713ece3c1b153_cgraph.map b/d2/d58/neural__network_8cpp_a45d3e30406712ada3d9713ece3c1b153_cgraph.map
deleted file mode 100644
index 0967d82a5..000000000
--- a/d2/d58/neural__network_8cpp_a45d3e30406712ada3d9713ece3c1b153_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="machine_learning::neural_network::util_functions::square" name="machine_learning::neural_network::util_functions::square">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,171,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="55,29,55,19,61,10,72,5,88,3,105,5,116,12,113,16,104,10,88,8,74,10,65,14,60,21,60,29"/>
-</map>
diff --git a/d2/d58/neural__network_8cpp_a45d3e30406712ada3d9713ece3c1b153_cgraph.md5 b/d2/d58/neural__network_8cpp_a45d3e30406712ada3d9713ece3c1b153_cgraph.md5
deleted file mode 100644
index 09181cfb0..000000000
--- a/d2/d58/neural__network_8cpp_a45d3e30406712ada3d9713ece3c1b153_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8248d8bf4384721f1a38a82e9c66287d
\ No newline at end of file
diff --git a/d2/d58/neural__network_8cpp_a45d3e30406712ada3d9713ece3c1b153_cgraph.svg b/d2/d58/neural__network_8cpp_a45d3e30406712ada3d9713ece3c1b153_cgraph.svg
deleted file mode 100644
index 8cd007428..000000000
--- a/d2/d58/neural__network_8cpp_a45d3e30406712ada3d9713ece3c1b153_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::util_functions::square Pages: 1 -->
-<svg width="132pt" height="68pt"
- viewBox="0.00 0.00 132.00 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>machine_learning::neural_network::util_functions::square</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124,-41.75 0,-41.75 0,0 124,0 124,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_network::util_functions</text>
-<text text-anchor="middle" x="62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::square</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.11,-42.07C36.93,-51.55 44.56,-59.75 62,-59.75 71.81,-59.75 78.51,-57.16 82.12,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.5,-54.09 84.52,-43.54 78.71,-52.39 85.5,-54.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_a45d3e30406712ada3d9713ece3c1b153_cgraph_org.svg b/d2/d58/neural__network_8cpp_a45d3e30406712ada3d9713ece3c1b153_cgraph_org.svg
deleted file mode 100644
index fe0144072..000000000
--- a/d2/d58/neural__network_8cpp_a45d3e30406712ada3d9713ece3c1b153_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::util_functions::square Pages: 1 -->
-<svg width="132pt" height="68pt"
- viewBox="0.00 0.00 132.00 67.75" 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 63.75)">
-<title>machine_learning::neural_network::util_functions::square</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124,-41.75 0,-41.75 0,0 124,0 124,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_network::util_functions</text>
-<text text-anchor="middle" x="62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::square</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.11,-42.07C36.93,-51.55 44.56,-59.75 62,-59.75 71.81,-59.75 78.51,-57.16 82.12,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.5,-54.09 84.52,-43.54 78.71,-52.39 85.5,-54.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_a76eb66212d577f948a457b6e29d87c46_cgraph.map b/d2/d58/neural__network_8cpp_a76eb66212d577f948a457b6e29d87c46_cgraph.map
deleted file mode 100644
index 80373458c..000000000
--- a/d2/d58/neural__network_8cpp_a76eb66212d577f948a457b6e29d87c46_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="machine_learning::neural_network::activations::dsigmoid" name="machine_learning::neural_network::activations::dsigmoid">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,171,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="55,29,55,19,61,10,72,5,88,3,105,5,116,12,113,16,104,10,88,8,74,10,65,14,60,21,60,29"/>
-</map>
diff --git a/d2/d58/neural__network_8cpp_a76eb66212d577f948a457b6e29d87c46_cgraph.md5 b/d2/d58/neural__network_8cpp_a76eb66212d577f948a457b6e29d87c46_cgraph.md5
deleted file mode 100644
index d3cd80695..000000000
--- a/d2/d58/neural__network_8cpp_a76eb66212d577f948a457b6e29d87c46_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6a5bcf0e29c1d7229452962fa781bc9b
\ No newline at end of file
diff --git a/d2/d58/neural__network_8cpp_a76eb66212d577f948a457b6e29d87c46_cgraph.svg b/d2/d58/neural__network_8cpp_a76eb66212d577f948a457b6e29d87c46_cgraph.svg
deleted file mode 100644
index b015c57ee..000000000
--- a/d2/d58/neural__network_8cpp_a76eb66212d577f948a457b6e29d87c46_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::activations::dsigmoid Pages: 1 -->
-<svg width="132pt" height="68pt"
- viewBox="0.00 0.00 132.00 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>machine_learning::neural_network::activations::dsigmoid</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124,-41.75 0,-41.75 0,0 124,0 124,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_network::activations::</text>
-<text text-anchor="middle" x="62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsigmoid</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.11,-42.07C36.93,-51.55 44.56,-59.75 62,-59.75 71.81,-59.75 78.51,-57.16 82.12,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.5,-54.09 84.52,-43.54 78.71,-52.39 85.5,-54.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_a76eb66212d577f948a457b6e29d87c46_cgraph_org.svg b/d2/d58/neural__network_8cpp_a76eb66212d577f948a457b6e29d87c46_cgraph_org.svg
deleted file mode 100644
index 706c810db..000000000
--- a/d2/d58/neural__network_8cpp_a76eb66212d577f948a457b6e29d87c46_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::activations::dsigmoid Pages: 1 -->
-<svg width="132pt" height="68pt"
- viewBox="0.00 0.00 132.00 67.75" 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 63.75)">
-<title>machine_learning::neural_network::activations::dsigmoid</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124,-41.75 0,-41.75 0,0 124,0 124,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_network::activations::</text>
-<text text-anchor="middle" x="62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsigmoid</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.11,-42.07C36.93,-51.55 44.56,-59.75 62,-59.75 71.81,-59.75 78.51,-57.16 82.12,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.5,-54.09 84.52,-43.54 78.71,-52.39 85.5,-54.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_aa69e95a34054d7989bf446f96b2ffaf9_cgraph.map b/d2/d58/neural__network_8cpp_aa69e95a34054d7989bf446f96b2ffaf9_cgraph.map
deleted file mode 100644
index b479a0fb0..000000000
--- a/d2/d58/neural__network_8cpp_aa69e95a34054d7989bf446f96b2ffaf9_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="machine_learning::neural_network::activations::drelu" name="machine_learning::neural_network::activations::drelu">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,187,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="61,29,60,19,65,10,78,5,96,3,116,5,128,11,125,16,114,10,96,8,79,10,69,14,65,20,66,28"/>
-</map>
diff --git a/d2/d58/neural__network_8cpp_aa69e95a34054d7989bf446f96b2ffaf9_cgraph.md5 b/d2/d58/neural__network_8cpp_aa69e95a34054d7989bf446f96b2ffaf9_cgraph.md5
deleted file mode 100644
index 65b88f598..000000000
--- a/d2/d58/neural__network_8cpp_aa69e95a34054d7989bf446f96b2ffaf9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9f55532a866ee9c7c44579f257fec690
\ No newline at end of file
diff --git a/d2/d58/neural__network_8cpp_aa69e95a34054d7989bf446f96b2ffaf9_cgraph.svg b/d2/d58/neural__network_8cpp_aa69e95a34054d7989bf446f96b2ffaf9_cgraph.svg
deleted file mode 100644
index 169d98881..000000000
--- a/d2/d58/neural__network_8cpp_aa69e95a34054d7989bf446f96b2ffaf9_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::activations::drelu Pages: 1 -->
-<svg width="144pt" height="57pt"
- viewBox="0.00 0.00 144.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>machine_learning::neural_network::activations::drelu</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="136,-30.5 0,-30.5 0,0 136,0 136,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="middle" x="68" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::activations::drelu</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.9,-30.99C38.98,-40.06 47.02,-48.5 68,-48.5 79.48,-48.5 87.08,-45.97 90.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.26,-42.82 91.93,-32.49 87.3,-42.02 94.26,-42.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_aa69e95a34054d7989bf446f96b2ffaf9_cgraph_org.svg b/d2/d58/neural__network_8cpp_aa69e95a34054d7989bf446f96b2ffaf9_cgraph_org.svg
deleted file mode 100644
index 09a6648e5..000000000
--- a/d2/d58/neural__network_8cpp_aa69e95a34054d7989bf446f96b2ffaf9_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::activations::drelu Pages: 1 -->
-<svg width="144pt" height="57pt"
- viewBox="0.00 0.00 144.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>machine_learning::neural_network::activations::drelu</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="136,-30.5 0,-30.5 0,0 136,0 136,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="middle" x="68" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::activations::drelu</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.9,-30.99C38.98,-40.06 47.02,-48.5 68,-48.5 79.48,-48.5 87.08,-45.97 90.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.26,-42.82 91.93,-32.49 87.3,-42.02 94.26,-42.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 2ec725d77..000000000
--- a/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,125 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,341,49,367"/>
-<area shape="rect" id="Node000002" href="$d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec" title=" " alt="" coords="798,100,971,126"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="35,339,60,307,95,273,209,191,258,162,306,138,357,120,412,104,550,76,604,68,646,66,743,76,826,93,825,98,742,81,646,71,604,73,551,81,413,109,358,125,308,143,261,166,212,195,98,278,64,311,39,343"/>
-<area shape="rect" id="Node000011" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff" title=" " alt="" coords="97,524,266,579"/>
-<area shape="poly" id="edge12_Node000001_Node000011" title=" " alt="" coords="40,365,151,509,147,513,36,369"/>
-<area shape="rect" id="Node000046" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f" title=" " alt="" coords="324,178,493,234"/>
-<area shape="poly" id="edge72_Node000001_Node000046" title=" " alt="" coords="48,344,319,237,321,242,50,348"/>
-<area shape="rect" id="Node000047" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931" title=" " alt="" coords="800,665,969,721"/>
-<area shape="poly" id="edge74_Node000001_Node000047" title=" " alt="" coords="31,367,35,409,45,467,65,531,80,562,99,590,150,649,199,695,246,730,295,756,348,777,407,795,551,832,605,846,649,854,692,851,741,832,759,818,767,802,775,783,789,763,827,728,831,732,793,767,779,786,772,804,763,822,744,836,693,856,649,859,604,851,550,837,405,800,346,782,293,761,243,734,195,699,146,653,95,593,75,565,60,533,39,469,29,410,26,368"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="1068,153,1146,179"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="942,124,1053,151,1052,156,940,129"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/distance.html#" title=" " alt="" coords="1058,5,1155,31"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="908,97,961,69,1025,40,1043,33,1045,38,1027,45,963,74,910,102"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="1072,55,1141,80"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="950,97,1057,75,1058,80,952,102"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="1268,757,1340,783"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="965,124,980,135,996,153,1005,171,1011,207,1014,244,1019,264,1028,286,1068,346,1107,387,1147,428,1190,487,1214,538,1244,609,1295,741,1290,743,1239,610,1209,540,1185,490,1143,432,1103,391,1064,349,1024,289,1014,266,1009,245,1006,207,1000,173,991,156,976,139,961,128"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="1270,469,1338,495"/>
-<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="957,124,979,135,996,148,1005,161,1014,175,1028,189,1071,217,1110,232,1148,249,1189,280,1226,323,1256,371,1295,454,1290,456,1251,374,1221,327,1185,284,1145,253,1108,237,1069,222,1024,194,1010,178,1001,164,992,151,977,139,954,129"/>
-<area shape="rect" id="Node000008" href="$d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" title=" " alt="" coords="1032,540,1181,581"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="966,124,980,135,1002,163,1014,191,1020,217,1020,244,1018,302,1021,334,1029,369,1060,454,1091,525,1086,528,1055,456,1023,371,1015,335,1013,302,1015,244,1014,218,1009,192,997,166,976,139,963,128"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max_element.html#" title=" " alt="" coords="1044,104,1169,130"/>
-<area shape="poly" id="edge11_Node000002_Node000010" title=" " alt="" coords="971,112,1028,113,1028,118,971,117"/>
-<area shape="poly" id="edge8_Node000008_Node000006" title=" " alt="" coords="1172,580,1189,591,1225,627,1254,668,1294,742,1289,744,1250,671,1221,630,1186,595,1169,584"/>
-<area shape="poly" id="edge9_Node000008_Node000007" title=" " alt="" coords="1159,537,1255,499,1257,504,1161,542"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="1250,548,1358,574"/>
-<area shape="poly" id="edge10_Node000008_Node000009" title=" " alt="" coords="1181,558,1235,558,1235,564,1181,564"/>
-<area shape="rect" id="Node000012" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0" title=" " alt="" coords="314,531,502,572"/>
-<area shape="poly" id="edge13_Node000011_Node000012" title=" " alt="" coords="266,549,298,549,298,554,266,554"/>
-<area shape="rect" id="Node000032" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d" title=" " alt="" coords="562,1120,731,1175"/>
-<area shape="poly" id="edge50_Node000011_Node000032" title=" " alt="" coords="207,578,616,1106,612,1109,203,581"/>
-<area shape="poly" id="edge23_Node000012_Node000002" title=" " alt="" coords="413,530,487,293,527,171,548,115,581,96,617,83,654,76,693,74,766,80,828,93,827,98,765,85,692,79,655,82,618,88,584,100,552,119,532,173,492,295,418,532"/>
-<area shape="poly" id="edge25_Node000012_Node000006" title=" " alt="" coords="411,572,411,642,416,751,431,886,458,1037,479,1114,504,1191,535,1266,572,1338,616,1405,667,1465,725,1518,792,1563,849,1590,903,1607,955,1613,1004,1610,1052,1596,1097,1572,1142,1537,1185,1491,1201,1467,1216,1436,1241,1355,1260,1257,1275,1150,1293,942,1299,798,1305,799,1298,942,1280,1150,1265,1258,1246,1356,1221,1438,1206,1470,1189,1494,1145,1541,1100,1576,1054,1601,1005,1615,955,1619,902,1612,847,1595,789,1567,722,1523,663,1469,612,1408,568,1340,530,1268,499,1193,474,1116,453,1038,425,887,411,751,406,642,406,572"/>
-<area shape="poly" id="edge33_Node000012_Node000007" title=" " alt="" coords="435,529,486,493,549,460,602,443,646,437,689,431,742,416,765,401,775,394,790,388,900,359,947,350,990,346,1034,347,1080,354,1130,366,1188,385,1217,399,1243,417,1284,456,1281,460,1240,421,1214,403,1186,390,1129,371,1079,359,1033,353,991,352,947,356,902,364,792,393,778,398,768,405,744,421,690,437,647,442,604,448,551,465,489,498,438,533"/>
-<area shape="poly" id="edge34_Node000012_Node000008" title=" " alt="" coords="503,557,551,560,647,568,689,568,742,560,755,555,765,548,775,541,790,536,842,526,884,526,978,536,1017,540,1017,546,978,541,884,531,843,532,791,541,778,546,768,552,758,559,743,565,690,574,647,573,550,565,502,562"/>
-<area shape="rect" id="Node000013" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" title=" " alt="" coords="550,129,743,185"/>
-<area shape="poly" id="edge14_Node000012_Node000013" title=" " alt="" coords="409,530,421,467,445,378,464,329,487,281,515,236,548,195,551,193,555,196,552,199,519,239,491,284,469,332,450,380,426,468,415,531"/>
-<area shape="rect" id="Node000014" href="$d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" title=" " alt="" coords="804,215,965,256"/>
-<area shape="poly" id="edge22_Node000012_Node000014" title=" " alt="" coords="424,529,476,473,511,442,549,416,577,402,602,394,647,388,691,381,715,373,741,359,756,346,766,334,789,306,840,263,843,267,793,309,770,338,760,350,744,363,717,378,692,386,648,393,603,400,579,407,552,420,514,446,479,477,428,533"/>
-<area shape="rect" id="Node000016" href="$d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" title=" " alt="" coords="797,449,972,475"/>
-<area shape="poly" id="edge41_Node000012_Node000016" title=" " alt="" coords="503,554,558,554,619,549,681,540,742,524,756,517,766,509,789,492,822,478,824,483,792,496,769,513,759,522,744,529,683,545,620,555,558,559,503,560"/>
-<area shape="rect" id="Node000018" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/duration/duration_cast.html#" title=" " alt="" coords="560,796,733,822"/>
-<area shape="poly" id="edge24_Node000012_Node000018" title=" " alt="" coords="419,571,437,614,465,668,504,726,527,752,552,775,573,787,570,792,549,779,523,755,499,729,461,671,432,616,414,573"/>
-<area shape="rect" id="Node000019" href="$d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f" title=" " alt="" coords="1026,1638,1187,1678"/>
-<area shape="poly" id="edge26_Node000012_Node000019" title=" " alt="" coords="413,572,427,785,456,1121,476,1292,499,1444,524,1558,538,1596,552,1618,603,1655,660,1680,721,1696,784,1703,848,1703,909,1698,1016,1680,1017,1685,910,1703,848,1708,784,1708,720,1701,658,1685,600,1659,548,1621,533,1598,519,1560,493,1445,471,1293,451,1121,422,785,408,572"/>
-<area shape="rect" id="Node000024" href="$d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43" title=" " alt="" coords="791,600,978,641"/>
-<area shape="poly" id="edge35_Node000012_Node000024" title=" " alt="" coords="434,570,485,608,517,626,551,640,610,651,671,654,730,650,785,642,785,647,731,655,671,659,610,656,550,645,515,631,482,613,431,574"/>
-<area shape="rect" id="Node000025" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="1072,808,1141,834"/>
-<area shape="poly" id="edge40_Node000012_Node000025" title=" " alt="" coords="432,570,484,615,517,639,552,660,619,691,690,719,833,763,962,793,1058,811,1057,816,961,799,832,768,689,724,617,696,549,665,514,644,481,620,429,574"/>
-<area shape="rect" id="Node000026" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/high_resolution_clock/now.html#" title=" " alt="" coords="556,208,737,249"/>
-<area shape="poly" id="edge42_Node000012_Node000026" title=" " alt="" coords="411,530,425,476,452,403,492,326,518,290,549,259,552,256,555,260,552,263,522,294,497,329,457,405,431,478,416,531"/>
-<area shape="rect" id="Node000027" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="583,273,710,299"/>
-<area shape="poly" id="edge43_Node000012_Node000027" title=" " alt="" coords="413,530,429,484,457,423,496,361,521,333,549,308,568,297,570,302,552,312,525,336,501,364,462,426,434,486,418,532"/>
-<area shape="rect" id="Node000028" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="1049,1009,1164,1035"/>
-<area shape="poly" id="edge44_Node000012_Node000028" title=" " alt="" coords="416,572,430,624,456,695,474,733,496,769,522,803,552,832,607,868,658,888,708,896,758,898,808,899,861,904,918,918,979,947,995,959,1004,972,1013,984,1027,996,1036,1000,1033,1005,1025,1000,1009,988,1000,975,991,963,977,951,916,923,861,909,808,904,758,904,708,902,657,893,604,873,549,836,518,806,492,772,470,735,451,697,425,626,411,573"/>
-<area shape="rect" id="Node000029" href="$d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" title=" " alt="" coords="569,323,724,348"/>
-<area shape="poly" id="edge45_Node000012_Node000029" title=" " alt="" coords="418,529,438,494,467,450,505,405,549,365,572,352,575,357,552,370,508,408,471,453,442,497,422,532"/>
-<area shape="rect" id="Node000030" href="$d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a" title=" " alt="" coords="791,551,978,576"/>
-<area shape="poly" id="edge46_Node000012_Node000030" title=" " alt="" coords="442,570,492,597,551,618,604,630,647,635,689,631,742,618,756,612,765,604,789,587,808,579,810,584,792,591,769,608,759,616,744,623,690,637,647,640,604,635,550,623,490,602,440,575"/>
-<area shape="rect" id="Node000031" href="$d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e" title=" " alt="" coords="562,474,731,514"/>
-<area shape="poly" id="edge49_Node000012_Node000031" title=" " alt="" coords="495,528,546,516,547,521,496,533"/>
-<area shape="poly" id="edge15_Node000013_Node000014" title=" " alt="" coords="734,183,807,207,805,212,732,188"/>
-<area shape="rect" id="Node000015" 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="797,149,972,175"/>
-<area shape="poly" id="edge16_Node000013_Node000015" title=" " alt="" coords="743,156,781,157,781,163,743,162"/>
-<area shape="poly" id="edge17_Node000013_Node000016" title=" " alt="" coords="729,183,745,195,769,231,804,298,872,434,868,436,800,300,764,234,741,199,725,187"/>
-<area shape="poly" id="edge18_Node000016_Node000006" title=" " alt="" coords="963,473,1100,500,1157,514,1189,527,1203,542,1218,565,1248,624,1296,742,1291,744,1244,626,1214,568,1199,546,1186,531,1156,519,1099,505,962,478"/>
-<area shape="poly" id="edge19_Node000016_Node000007" title=" " alt="" coords="973,464,1254,477,1254,483,972,469"/>
-<area shape="poly" id="edge20_Node000016_Node000008" title=" " alt="" coords="931,473,979,492,1027,520,1048,531,1046,536,1025,525,977,497,929,478"/>
-<area shape="rect" id="Node000017" 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="1030,605,1184,631"/>
-<area shape="poly" id="edge21_Node000016_Node000017" title=" " alt="" coords="905,474,980,536,1003,566,1012,578,1028,591,1037,596,1035,601,1024,595,1008,582,998,569,976,540,902,478"/>
-<area shape="poly" id="edge27_Node000019_Node000006" title=" " alt="" coords="1166,1635,1185,1618,1202,1588,1218,1550,1244,1452,1264,1335,1278,1208,1295,964,1300,799,1305,799,1300,964,1283,1208,1269,1335,1249,1453,1223,1552,1207,1591,1189,1621,1170,1639"/>
-<area shape="poly" id="edge28_Node000019_Node000007" title=" " alt="" coords="1108,1637,1141,1400,1185,1047,1190,934,1193,786,1197,711,1204,642,1216,581,1233,534,1246,516,1263,502,1266,506,1250,520,1238,537,1221,582,1209,642,1202,712,1198,787,1195,934,1190,1048,1146,1401,1114,1638"/>
-<area shape="rect" id="Node000020" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/system_clock/now.html#" title=" " alt="" coords="1235,1666,1373,1706"/>
-<area shape="poly" id="edge29_Node000019_Node000020" title=" " alt="" coords="1188,1667,1221,1672,1220,1677,1187,1672"/>
-<area shape="rect" id="Node000021" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="1268,1731,1340,1756"/>
-<area shape="poly" id="edge30_Node000019_Node000021" title=" " alt="" coords="1151,1677,1236,1716,1254,1723,1252,1728,1234,1721,1149,1681"/>
-<area shape="rect" id="Node000022" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="1264,1567,1344,1592"/>
-<area shape="poly" id="edge31_Node000019_Node000022" title=" " alt="" coords="1154,1635,1234,1601,1248,1596,1250,1601,1236,1606,1156,1640"/>
-<area shape="rect" id="Node000023" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="1265,1616,1343,1642"/>
-<area shape="poly" id="edge32_Node000019_Node000023" title=" " alt="" coords="1187,1644,1249,1634,1250,1639,1188,1649"/>
-<area shape="poly" id="edge36_Node000024_Node000006" title=" " alt="" coords="947,639,979,650,1255,750,1253,755,977,655,945,644"/>
-<area shape="poly" id="edge37_Node000024_Node000007" title=" " alt="" coords="979,637,1039,646,1099,652,1151,651,1171,648,1186,641,1199,631,1206,619,1213,594,1218,565,1233,534,1267,502,1271,506,1237,537,1223,567,1218,595,1211,621,1203,634,1189,646,1173,653,1152,657,1099,657,1038,652,978,642"/>
-<area shape="poly" id="edge38_Node000024_Node000008" title=" " alt="" coords="962,597,1017,582,1018,587,963,602"/>
-<area shape="poly" id="edge39_Node000024_Node000017" title=" " alt="" coords="978,617,1014,617,1014,622,978,622"/>
-<area shape="poly" id="edge47_Node000030_Node000008" title=" " alt="" coords="978,560,1017,559,1017,565,978,565"/>
-<area shape="poly" id="edge48_Node000030_Node000017" title=" " alt="" coords="940,574,1038,599,1036,604,939,579"/>
-<area shape="poly" id="edge54_Node000032_Node000006" title=" " alt="" coords="651,1175,658,1249,666,1296,679,1346,697,1396,721,1445,753,1487,792,1523,840,1549,862,1555,884,1557,906,1555,928,1548,977,1523,1023,1487,1065,1447,1103,1402,1136,1353,1166,1302,1191,1249,1233,1140,1262,1033,1281,936,1298,798,1304,799,1287,937,1267,1035,1238,1141,1196,1251,1171,1305,1141,1356,1107,1405,1069,1451,1027,1492,979,1527,930,1553,907,1560,884,1562,861,1560,838,1554,789,1527,749,1491,717,1447,692,1399,674,1348,661,1297,653,1250,646,1176"/>
-<area shape="poly" id="edge56_Node000032_Node000007" title=" " alt="" coords="656,1119,697,996,720,916,740,834,745,794,746,744,746,625,748,565,755,511,768,466,777,449,789,435,816,415,845,399,876,388,908,381,975,377,1044,384,1110,400,1171,419,1265,460,1263,465,1169,424,1108,405,1043,390,975,382,909,386,878,393,847,404,819,419,792,439,782,452,773,468,760,512,754,566,751,625,751,744,750,795,745,835,725,917,702,997,661,1120"/>
-<area shape="poly" id="edge70_Node000032_Node000017" title=" " alt="" coords="666,1118,703,1061,740,992,754,947,758,909,765,873,774,853,789,832,811,809,833,793,877,774,924,759,949,747,976,731,1034,684,1080,640,1084,644,1037,688,980,735,951,752,925,764,879,779,836,797,814,813,793,836,779,856,770,874,763,910,759,948,745,994,708,1063,671,1121"/>
-<area shape="rect" id="Node000033" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="825,961,944,987"/>
-<area shape="poly" id="edge51_Node000032_Node000033" title=" " alt="" coords="665,1118,716,1056,751,1023,789,996,809,987,811,991,792,1000,754,1027,720,1060,669,1121"/>
-<area shape="rect" id="Node000034" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/c_str.html#" title=" " alt="" coords="826,1011,942,1036"/>
-<area shape="poly" id="edge52_Node000032_Node000034" title=" " alt="" coords="679,1117,729,1080,790,1045,810,1037,812,1042,792,1050,732,1084,683,1121"/>
-<area shape="rect" id="Node000035" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ifstream/close.html#" title=" " alt="" coords="818,1060,951,1086"/>
-<area shape="poly" id="edge53_Node000032_Node000035" title=" " alt="" coords="723,1117,790,1094,813,1088,814,1093,791,1099,725,1122"/>
-<area shape="rect" id="Node000036" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ios/eof.html#" title=" " alt="" coords="824,1109,944,1135"/>
-<area shape="poly" id="edge55_Node000032_Node000036" title=" " alt="" coords="731,1136,808,1128,809,1133,732,1141"/>
-<area shape="rect" id="Node000037" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/getline.html#" title=" " alt="" coords="842,1159,927,1184"/>
-<area shape="poly" id="edge57_Node000032_Node000037" title=" " alt="" coords="732,1153,826,1163,826,1168,731,1159"/>
-<area shape="rect" id="Node000038" href="$d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd" title=" " alt="" coords="803,1208,966,1249"/>
-<area shape="poly" id="edge58_Node000032_Node000038" title=" " alt="" coords="731,1173,809,1200,807,1205,729,1178"/>
-<area shape="rect" id="Node000039" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ifstream/is_open.html#" title=" " alt="" coords="811,1273,958,1299"/>
-<area shape="poly" id="edge59_Node000032_Node000039" title=" " alt="" coords="678,1174,729,1217,792,1258,807,1265,805,1270,789,1263,725,1222,674,1178"/>
-<area shape="rect" id="Node000040" href="$d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26" title=" " alt="" coords="796,846,972,886"/>
-<area shape="poly" id="edge60_Node000032_Node000040" title=" " alt="" coords="663,1118,716,1039,789,947,844,895,847,898,793,951,721,1042,668,1121"/>
-<area shape="rect" id="Node000042" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ifstream/open.html#" title=" " alt="" coords="819,1323,950,1348"/>
-<area shape="poly" id="edge67_Node000032_Node000042" title=" " alt="" coords="667,1174,718,1243,752,1279,792,1309,806,1316,803,1321,789,1314,749,1283,713,1246,663,1178"/>
-<area shape="rect" id="Node000043" href="$d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d" title=" " alt="" coords="791,1372,978,1398"/>
-<area shape="poly" id="edge68_Node000032_Node000043" title=" " alt="" coords="661,1175,681,1216,709,1266,746,1316,792,1359,798,1362,795,1367,789,1363,742,1320,704,1269,676,1219,656,1177"/>
-<area shape="rect" id="Node000044" href="$d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093" title=" " alt="" coords="809,1422,960,1462"/>
-<area shape="poly" id="edge69_Node000032_Node000044" title=" " alt="" coords="658,1175,675,1225,703,1287,742,1352,766,1382,792,1408,797,1412,794,1416,789,1412,762,1385,737,1355,698,1290,670,1227,653,1176"/>
-<area shape="rect" id="Node000045" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/stof.html#" title=" " alt="" coords="848,1487,920,1512"/>
-<area shape="poly" id="edge71_Node000032_Node000045" title=" " alt="" coords="655,1175,667,1237,693,1318,711,1360,733,1401,760,1439,792,1472,812,1484,834,1492,832,1497,809,1489,789,1476,756,1442,729,1404,706,1362,688,1319,662,1239,649,1176"/>
-<area shape="poly" id="edge61_Node000040_Node000006" title=" " alt="" coords="947,885,1000,897,1061,905,1125,904,1156,898,1186,888,1217,869,1245,845,1285,795,1289,798,1248,849,1221,874,1188,893,1158,903,1126,909,1061,911,999,903,946,890"/>
-<area shape="poly" id="edge62_Node000040_Node000007" title=" " alt="" coords="973,869,1035,871,1098,868,1151,860,1171,853,1186,844,1214,809,1226,774,1227,738,1221,701,1214,662,1210,622,1215,579,1233,534,1247,517,1263,502,1267,506,1251,520,1238,537,1220,580,1215,622,1219,662,1226,700,1232,738,1231,775,1218,812,1189,848,1174,858,1153,865,1098,873,1035,876,973,875"/>
-<area shape="poly" id="edge63_Node000040_Node000008" title=" " alt="" coords="900,844,938,794,976,732,989,692,994,658,1001,626,1010,609,1024,591,1026,589,1029,593,1028,595,1014,612,1006,628,999,659,994,694,980,734,942,797,905,847"/>
-<area shape="poly" id="edge65_Node000040_Node000025" title=" " alt="" coords="973,846,1057,828,1058,833,974,851"/>
-<area shape="poly" id="edge66_Node000040_Node000028" title=" " alt="" coords="953,885,980,903,997,927,1004,951,1011,974,1028,996,1037,1002,1033,1007,1024,1000,1006,977,999,953,993,930,976,907,950,889"/>
-<area shape="rect" id="Node000041" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="1070,960,1143,986"/>
-<area shape="poly" id="edge64_Node000040_Node000041" title=" " alt="" coords="943,885,979,903,1004,921,1027,939,1057,953,1055,958,1025,943,1000,925,977,907,941,890"/>
-<area shape="poly" id="edge73_Node000046_Node000013" title=" " alt="" coords="493,186,535,177,536,182,494,191"/>
-<area shape="poly" id="edge75_Node000047_Node000006" title=" " alt="" coords="965,719,1027,736,1148,755,1253,765,1253,770,1147,760,1025,741,964,724"/>
-<area shape="poly" id="edge76_Node000047_Node000008" title=" " alt="" coords="959,662,976,651,991,636,1000,621,1009,606,1024,591,1030,587,1033,591,1028,595,1013,610,1004,624,995,639,980,655,962,667"/>
-</map>
diff --git a/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 3753bd019..000000000
--- a/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9fb5afbc918fb705d4bbdcc4269a13c7
\ No newline at end of file
diff --git a/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 7362c97f8..000000000
--- a/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,1223 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<!--zoomable 1321 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 1034;
-var viewHeight = 1321;
-var sectionId = 'dynsection-10';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-1061.25 0,-1061.25 0,-1042 32.5,-1042 32.5,-1061.25"/>
-<text text-anchor="middle" x="16.25" y="-1047.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="724.25,-1242.25 594.25,-1242.25 594.25,-1223 724.25,-1223 724.25,-1242.25"/>
-<text text-anchor="middle" x="659.25" y="-1228.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::argmax</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.92,-1061.45C32.88,-1074.09 49.86,-1096.13 68.5,-1110.62 198.69,-1211.84 246.45,-1229.39 408.75,-1258.62 471.85,-1269.99 489.36,-1266.37 553,-1258.62 573.83,-1256.09 596.48,-1250.83 615.41,-1245.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="616.24,-1249.11 624.92,-1243.04 614.35,-1242.37 616.24,-1249.11"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.5,-924.5 68.5,-924.5 68.5,-882.75 195.5,-882.75 195.5,-924.5"/>
-<text text-anchor="start" x="76.5" y="-911" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="76.5" y="-899.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="132" y="-888.5" font-family="Helvetica,sans-Serif" font-size="10.00">::fit_from_csv</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge12_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge12_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.71,-1041.91C41.29,-1020.34 81.77,-967.67 107.72,-933.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.38,-936.2 113.7,-926.14 104.83,-931.93 110.38,-936.2"/>
-</a>
-</g>
-</g>
-<!-- Node46 -->
-<g id="Node000046" class="node">
-<title>Node46</title>
-<g id="a_Node000046"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="365.62,-1183.5 238.62,-1183.5 238.62,-1141.75 365.62,-1141.75 365.62,-1183.5"/>
-<text text-anchor="start" x="246.62" y="-1170" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="246.62" y="-1158.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="302.12" y="-1147.5" font-family="Helvetica,sans-Serif" font-size="10.00">::single_predict</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node46 -->
-<g id="edge72_Node000001_Node000046" class="edge">
-<title>Node1&#45;&gt;Node46</title>
-<g id="a_edge72_Node000001_Node000046"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.92,-1057.75C70.93,-1072.61 169.79,-1111.27 236.27,-1137.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="234.65,-1140.39 245.24,-1140.77 237.2,-1133.87 234.65,-1140.39"/>
-</a>
-</g>
-</g>
-<!-- Node47 -->
-<g id="Node000047" class="node">
-<title>Node47</title>
-<g id="a_Node000047"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="722.75,-818.5 595.75,-818.5 595.75,-776.75 722.75,-776.75 722.75,-818.5"/>
-<text text-anchor="start" x="603.75" y="-805" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="603.75" y="-793.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="659.25" y="-782.5" font-family="Helvetica,sans-Serif" font-size="10.00">::summary</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node47 -->
-<g id="edge74_Node000001_Node000047" class="edge">
-<title>Node1&#45;&gt;Node47</title>
-<g id="a_edge74_Node000001_Node000047"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M17.51,-1041.54C18.75,-1012.27 26.04,-926.14 68.5,-873.62 176.33,-740.27 242.4,-733.32 408.75,-691.62 470.94,-676.04 496.21,-661.87 553,-691.62 577.9,-704.67 569.7,-723.19 589,-743.62 597.66,-752.79 607.95,-761.67 617.91,-769.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="615.64,-772.15 625.71,-775.43 619.88,-766.59 615.64,-772.15"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="855.38,-1202.25 796.62,-1202.25 796.62,-1183 855.38,-1183 855.38,-1202.25"/>
-<text text-anchor="middle" x="826" y="-1188.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M701.82,-1222.53C727.37,-1216.33 759.91,-1208.43 785.13,-1202.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="785.79,-1205.75 794.68,-1199.99 784.14,-1198.94 785.79,-1205.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="862.12,-1313.25 789.88,-1313.25 789.88,-1294 862.12,-1294 862.12,-1313.25"/>
-<text text-anchor="middle" x="826" y="-1299.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M677.7,-1242.59C698.23,-1254.03 733.58,-1272.87 765.5,-1285.62 769.78,-1287.34 774.3,-1288.98 778.84,-1290.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="777.38,-1293.73 787.98,-1293.49 779.54,-1287.07 777.38,-1293.73"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="851.62,-1276.25 800.38,-1276.25 800.38,-1257 851.62,-1257 851.62,-1276.25"/>
-<text text-anchor="middle" x="826" y="-1262.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M709.23,-1242.73C734.88,-1248.03 765.71,-1254.39 789.11,-1259.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="788.29,-1262.62 798.79,-1261.22 789.7,-1255.77 788.29,-1262.62"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1000.75,-749.25 947.25,-749.25 947.25,-730 1000.75,-730 1000.75,-749.25"/>
-<text text-anchor="middle" x="974" y="-735.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M718.25,-1222.58C722.34,-1220.41 726.16,-1217.79 729.5,-1214.62 767.77,-1178.38 740.6,-1148.08 765.5,-1101.62 806.12,-1025.83 842.85,-1024.73 886.5,-950.62 906.6,-916.49 948.13,-806.79 965.31,-760.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="968.59,-761.75 968.77,-751.15 962.02,-759.32 968.59,-761.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="999.62,-965.25 948.38,-965.25 948.38,-946 999.62,-946 999.62,-965.25"/>
-<text text-anchor="middle" x="974" y="-951.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M712.7,-1222.61C718.58,-1220.45 724.32,-1217.82 729.5,-1214.62 750.14,-1201.9 746.66,-1188.89 765.5,-1173.62 813.42,-1134.78 842.64,-1149 886.5,-1105.62 925.54,-1067.01 952.91,-1007.13 965.38,-976"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="968.53,-977.57 968.88,-966.98 962,-975.04 968.53,-977.57"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="881.62,-911.88 770.38,-911.88 770.38,-881.38 881.62,-881.38 881.62,-911.88"/>
-<text text-anchor="start" x="778.38" y="-898.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="826" y="-887.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M719.28,-1222.59C723.04,-1220.4 726.51,-1217.78 729.5,-1214.62 784.19,-1157.05 742.14,-1115.52 765.5,-1039.62 778.49,-997.42 799.29,-950.53 812.55,-922.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="815.61,-924.03 816.74,-913.5 809.28,-921.03 815.61,-924.03"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="873,-1239.25 779,-1239.25 779,-1220 873,-1220 873,-1239.25"/>
-<text text-anchor="middle" x="826" y="-1225.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge11_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge11_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M724.42,-1231.46C738.54,-1231.2 753.4,-1230.93 767.25,-1230.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="767.15,-1234.18 777.09,-1230.5 767.03,-1227.18 767.15,-1234.18"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge8_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge8_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M874.05,-880.92C878.48,-878.49 882.72,-875.74 886.5,-872.62 924.63,-841.24 951.78,-788.57 964.63,-759.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="967.76,-761.4 968.51,-750.83 961.34,-758.62 967.76,-761.4"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge9_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge9_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M865.74,-912.28C888.15,-921.33 916.12,-932.64 937.88,-941.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="936.33,-944.58 946.91,-945.08 938.95,-938.09 936.33,-944.58"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1014.25,-906.25 933.75,-906.25 933.75,-887 1014.25,-887 1014.25,-906.25"/>
-<text text-anchor="middle" x="974" y="-892.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge10_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge10_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M881.78,-896.62C895.05,-896.62 909.17,-896.62 922.25,-896.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="921.9,-900.13 931.9,-896.63 921.9,-893.13 921.9,-900.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="372.75,-918.88 231.5,-918.88 231.5,-888.38 372.75,-888.38 372.75,-918.88"/>
-<text text-anchor="start" x="239.5" y="-905.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="middle" x="302.12" y="-894.12" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork::fit</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge13_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge13_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M195.6,-903.62C203.47,-903.62 211.61,-903.62 219.71,-903.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.6,-907.13 229.6,-903.63 219.6,-900.13 219.6,-907.13"/>
-</a>
-</g>
-</g>
-<!-- Node32 -->
-<g id="Node000032" class="node">
-<title>Node32</title>
-<g id="a_Node000032"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="544.38,-477.5 417.38,-477.5 417.38,-435.75 544.38,-435.75 544.38,-477.5"/>
-<text text-anchor="start" x="425.38" y="-464" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="425.38" y="-452.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="480.88" y="-441.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_XY_from_csv</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node32 -->
-<g id="edge50_Node000011_Node000032" class="edge">
-<title>Node11&#45;&gt;Node32</title>
-<g id="a_edge50_Node000011_Node000032"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M149.5,-882.37C205.83,-809.78 390.7,-571.54 456.42,-486.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="459.19,-489 462.55,-478.95 453.66,-484.7 459.19,-489"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node2 -->
-<g id="edge23_Node000012_Node000002" class="edge">
-<title>Node12&#45;&gt;Node2</title>
-<g id="a_edge23_Node000012_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.87,-919.09C327.55,-983.17 402.1,-1224.73 408.75,-1229.62 469.48,-1274.35 563.02,-1259.62 616.64,-1245.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="617.27,-1249.09 625.99,-1243.07 615.42,-1242.33 617.27,-1249.09"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node6 -->
-<g id="edge25_Node000012_Node000006" class="edge">
-<title>Node12&#45;&gt;Node6</title>
-<g id="a_edge25_Node000012_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.61,-888.08C300.47,-794.1 303.2,-300.44 589,-143.62 706.81,-78.98 800.04,-94.75 886.5,-197.62 954.72,-278.8 969.7,-628.47 972.45,-718.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="968.95,-718.36 972.73,-728.26 975.94,-718.17 968.95,-718.36"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node7 -->
-<g id="edge33_Node000012_Node000007" class="edge">
-<title>Node12&#45;&gt;Node7</title>
-<g id="a_edge33_Node000012_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M323.02,-919.18C343.44,-934.42 376.68,-957.25 408.75,-970.62 469.45,-995.94 491.84,-979.45 553,-1003.62 570.23,-1010.44 571.15,-1019.69 589,-1024.62 716.45,-1059.86 762.01,-1071.18 886.5,-1026.62 915.63,-1016.2 941.99,-991.27 957.75,-973.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="960.04,-976.62 963.99,-966.79 954.77,-972.01 960.04,-976.62"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node8 -->
-<g id="edge34_Node000012_Node000008" class="edge">
-<title>Node12&#45;&gt;Node8</title>
-<g id="a_edge34_Node000012_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M372.97,-897.59C384.9,-896.77 397.17,-896.06 408.75,-895.62 472.82,-893.2 490.6,-880.9 553,-895.62 570.41,-899.73 571.59,-909.52 589,-913.62 649.77,-927.97 667.3,-919.12 729.5,-913.62 738.96,-912.79 748.9,-911.5 758.63,-909.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="759.13,-913.45 768.43,-908.38 758,-906.54 759.13,-913.45"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="553,-1220.5 408.75,-1220.5 408.75,-1178.75 553,-1178.75 553,-1220.5"/>
-<text text-anchor="start" x="416.75" y="-1207" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="416.75" y="-1195.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="480.88" y="-1184.5" font-family="Helvetica,sans-Serif" font-size="10.00">::__detailed_single_prediction</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge14_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge14_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M305.06,-919.08C311.44,-963.84 335.75,-1095.07 408.75,-1169.62 409.35,-1170.24 409.96,-1170.83 410.59,-1171.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="408.18,-1173.98 418.19,-1177.47 412.54,-1168.51 408.18,-1173.98"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="719.75,-1155.88 598.75,-1155.88 598.75,-1125.38 719.75,-1125.38 719.75,-1155.88"/>
-<text text-anchor="start" x="606.75" y="-1142.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::apply</text>
-<text text-anchor="middle" x="659.25" y="-1131.12" font-family="Helvetica,sans-Serif" font-size="10.00">_function</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node14 -->
-<g id="edge22_Node000012_Node000014" class="edge">
-<title>Node12&#45;&gt;Node14</title>
-<g id="a_edge22_Node000012_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M315.42,-919.19C333.56,-941.13 369.61,-981.01 408.75,-1003.62 466.68,-1037.09 496.46,-1010.87 553,-1046.62 573.22,-1059.41 571.5,-1070.32 589,-1086.62 600.91,-1097.72 614.93,-1108.96 627.23,-1118.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="624.92,-1120.93 635.03,-1124.11 629.11,-1115.32 624.92,-1120.93"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="725,-980.25 593.5,-980.25 593.5,-961 725,-961 725,-980.25"/>
-<text text-anchor="middle" x="659.25" y="-966.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node16 -->
-<g id="edge41_Node000012_Node000016" class="edge">
-<title>Node12&#45;&gt;Node16</title>
-<g id="a_edge41_Node000012_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M373.17,-899.59C424.35,-898.86 494.7,-902.53 553,-922.62 571.18,-928.89 571.78,-938.07 589,-946.62 596.61,-950.4 604.96,-953.84 613.14,-956.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="611.71,-960.07 622.3,-960.08 614.03,-953.46 611.71,-960.07"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="545.5,-720.25 416.25,-720.25 416.25,-701 545.5,-701 545.5,-720.25"/>
-<text text-anchor="middle" x="480.88" y="-706.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::duration_cast</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node18 -->
-<g id="edge24_Node000012_Node000018" class="edge">
-<title>Node12&#45;&gt;Node18</title>
-<g id="a_edge24_Node000012_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.66,-888.07C321.21,-854.97 355,-777.1 408.75,-734.62 413.48,-730.89 418.82,-727.72 424.4,-725.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="425.38,-728.42 433.22,-721.29 422.65,-721.97 425.38,-728.42"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="886.5,-88.88 765.5,-88.88 765.5,-58.38 886.5,-58.38 886.5,-88.88"/>
-<text text-anchor="start" x="773.5" y="-75.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::equal</text>
-<text text-anchor="middle" x="826" y="-64.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node19 -->
-<g id="edge26_Node000012_Node000019" class="edge">
-<title>Node12&#45;&gt;Node19</title>
-<g id="a_edge26_Node000012_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.01,-888.14C310.22,-781.53 348.97,-158.83 408.75,-102.62 502.48,-14.5 666.48,-34.69 758.15,-55.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="757.23,-58.7 767.76,-57.55 758.81,-51.88 757.23,-58.7"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a xlink:href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="729.5,-866.88 589,-866.88 589,-836.38 729.5,-836.38 729.5,-866.88"/>
-<text text-anchor="start" x="597" y="-853.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::hadamard</text>
-<text text-anchor="middle" x="659.25" y="-842.12" font-family="Helvetica,sans-Serif" font-size="10.00">_product</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node24 -->
-<g id="edge35_Node000012_Node000024" class="edge">
-<title>Node12&#45;&gt;Node24</title>
-<g id="a_edge35_Node000012_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M320.23,-888.11C339.92,-871.4 374.02,-845.84 408.75,-835.62 466.24,-818.72 534.29,-824.7 584.78,-833.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="583.96,-837.21 594.44,-835.63 585.26,-830.33 583.96,-837.21"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="851.62,-711.25 800.38,-711.25 800.38,-692 851.62,-692 851.62,-711.25"/>
-<text text-anchor="middle" x="826" y="-697.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node25 -->
-<g id="edge40_Node000012_Node000025" class="edge">
-<title>Node12&#45;&gt;Node25</title>
-<g id="a_edge40_Node000012_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M318.95,-887.97C338.49,-869.43 373.51,-838.79 408.75,-820.62 540.02,-752.95 715,-719.06 789.26,-706.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="789.47,-710.47 798.79,-705.44 788.37,-703.55 789.47,-710.47"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="548.88,-1160.88 412.88,-1160.88 412.88,-1130.38 548.88,-1130.38 548.88,-1160.88"/>
-<text text-anchor="start" x="420.88" y="-1147.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::high_resolution</text>
-<text text-anchor="middle" x="480.88" y="-1136.12" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node26 -->
-<g id="edge42_Node000012_Node000026" class="edge">
-<title>Node12&#45;&gt;Node26</title>
-<g id="a_edge42_Node000012_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M306.33,-919.35C315.25,-959.12 344.08,-1064.61 408.75,-1121.62 409.54,-1122.32 410.35,-1123 411.18,-1123.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="409.19,-1126.53 419.46,-1129.15 413.06,-1120.7 409.19,-1126.53"/>
-</a>
-</g>
-</g>
-<!-- Node27 -->
-<g id="Node000027" class="node">
-<title>Node27</title>
-<g id="a_Node000027"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="528.25,-1112.25 433.5,-1112.25 433.5,-1093 528.25,-1093 528.25,-1112.25"/>
-<text text-anchor="middle" x="480.88" y="-1098.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node27 -->
-<g id="edge43_Node000012_Node000027" class="edge">
-<title>Node12&#45;&gt;Node27</title>
-<g id="a_edge43_Node000012_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.65,-919.27C318.69,-954.58 350.47,-1040.76 408.75,-1084.62 412.98,-1087.81 417.71,-1090.43 422.67,-1092.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="421.06,-1095.73 431.66,-1095.9 423.48,-1089.16 421.06,-1095.73"/>
-</a>
-</g>
-</g>
-<!-- Node28 -->
-<g id="Node000028" class="node">
-<title>Node28</title>
-<g id="a_Node000028"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="869.25,-560.25 782.75,-560.25 782.75,-541 869.25,-541 869.25,-560.25"/>
-<text text-anchor="middle" x="826" y="-546.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node28 -->
-<g id="edge44_Node000012_Node000028" class="edge">
-<title>Node12&#45;&gt;Node28</title>
-<g id="a_edge44_Node000012_Node000028"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M306.26,-888.09C315.01,-848.83 343.48,-744.97 408.75,-691.62 523.02,-598.22 602.2,-680.3 729.5,-605.62 749.29,-594.02 745.9,-580.55 765.5,-568.62 767.52,-567.4 769.62,-566.25 771.79,-565.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="773.06,-568.44 780.86,-561.27 770.29,-562.01 773.06,-568.44"/>
-</a>
-</g>
-</g>
-<!-- Node29 -->
-<g id="Node000029" class="node">
-<title>Node29</title>
-<g id="a_Node000029"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="539.12,-1075.25 422.62,-1075.25 422.62,-1056 539.12,-1056 539.12,-1075.25"/>
-<text text-anchor="middle" x="480.88" y="-1061.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node29 -->
-<g id="edge45_Node000012_Node000029" class="edge">
-<title>Node12&#45;&gt;Node29</title>
-<g id="a_edge45_Node000012_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M311.03,-919.31C326.16,-947.77 361.9,-1008.07 408.75,-1041.62 414.04,-1045.42 419.98,-1048.64 426.11,-1051.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="424.53,-1054.52 435.12,-1054.97 427.13,-1048.02 424.53,-1054.52"/>
-</a>
-</g>
-</g>
-<!-- Node30 -->
-<g id="Node000030" class="node">
-<title>Node30</title>
-<g id="a_Node000030"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="729.5,-904.25 589,-904.25 589,-885 729.5,-885 729.5,-904.25"/>
-<text text-anchor="middle" x="659.25" y="-890.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::transpose</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node30 -->
-<g id="edge46_Node000012_Node000030" class="edge">
-<title>Node12&#45;&gt;Node30</title>
-<g id="a_edge46_Node000012_Node000030"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M326.69,-888.09C347.34,-875.46 378.69,-858.62 408.75,-851.62 471.19,-837.09 491.64,-833.05 553,-851.62 571.4,-857.2 571.5,-867.65 589,-875.62 593.27,-877.57 597.79,-879.36 602.39,-880.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="601.14,-884.27 611.74,-884.05 603.32,-877.61 601.14,-884.27"/>
-</a>
-</g>
-</g>
-<!-- Node31 -->
-<g id="Node000031" class="node">
-<title>Node31</title>
-<g id="a_Node000031"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="544.38,-961.88 417.38,-961.88 417.38,-931.38 544.38,-931.38 544.38,-961.88"/>
-<text text-anchor="start" x="425.38" y="-948.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::zeroes</text>
-<text text-anchor="middle" x="480.88" y="-937.12" font-family="Helvetica,sans-Serif" font-size="10.00">_initialization</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node31 -->
-<g id="edge49_Node000012_Node000031" class="edge">
-<title>Node12&#45;&gt;Node31</title>
-<g id="a_edge49_Node000012_Node000031"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M367.69,-919.33C380.12,-922.36 393.23,-925.55 405.93,-928.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.95,-932 415.49,-930.96 406.6,-925.2 404.95,-932"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge15_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge15_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M545.55,-1178.32C563.53,-1172.31 582.98,-1165.8 600.58,-1159.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="601.47,-1163.31 609.84,-1156.82 599.25,-1156.67 601.47,-1163.31"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="725,-1205.25 593.5,-1205.25 593.5,-1186 725,-1186 725,-1205.25"/>
-<text text-anchor="middle" x="659.25" y="-1191.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node15 -->
-<g id="edge16_Node000013_Node000015" class="edge">
-<title>Node13&#45;&gt;Node15</title>
-<g id="a_edge16_Node000013_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M553.36,-1198C562.73,-1197.79 572.36,-1197.57 581.8,-1197.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="581.77,-1200.86 591.69,-1197.13 581.62,-1193.86 581.77,-1200.86"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node16 -->
-<g id="edge17_Node000013_Node000016" class="edge">
-<title>Node13&#45;&gt;Node16</title>
-<g id="a_edge17_Node000013_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M541.29,-1178.46C545.48,-1175.82 549.44,-1172.88 553,-1169.62 567.64,-1156.21 625.36,-1038.7 648.54,-990.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="651.55,-992.61 652.75,-982.09 645.25,-989.57 651.55,-992.61"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node6 -->
-<g id="edge18_Node000016_Node000006" class="edge">
-<title>Node16&#45;&gt;Node6</title>
-<g id="a_edge18_Node000016_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M718.22,-960.54C780.8,-949.22 873.33,-931.09 886.5,-920.62 913.49,-899.19 950.45,-802.7 965.83,-760.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="969.08,-761.33 969.14,-750.74 962.49,-758.98 969.08,-761.33"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node7 -->
-<g id="edge19_Node000016_Node000007" class="edge">
-<title>Node16&#45;&gt;Node7</title>
-<g id="a_edge19_Node000016_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M725.43,-967.5C789.54,-964.42 885.08,-959.84 936.72,-957.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="936.62,-960.87 946.44,-956.9 936.29,-953.88 936.62,-960.87"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node8 -->
-<g id="edge20_Node000016_Node000008" class="edge">
-<title>Node16&#45;&gt;Node8</title>
-<g id="a_edge20_Node000016_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M693.53,-960.55C705.1,-956.67 718.05,-951.89 729.5,-946.62 746.33,-938.89 749.16,-934.36 765.5,-925.62 770.63,-922.89 776.05,-920.1 781.45,-917.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="782.97,-920.54 790.38,-912.97 779.86,-914.27 782.97,-920.54"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="883.88,-863.25 768.12,-863.25 768.12,-844 883.88,-844 883.88,-863.25"/>
-<text text-anchor="middle" x="826" y="-849.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge21_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge21_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M673.81,-960.51C688.18,-949.56 711.27,-931.28 729.5,-913.62 746.92,-896.75 745.21,-885.91 765.5,-872.62 767.88,-871.07 770.4,-869.63 773,-868.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="774.24,-871.58 781.96,-864.33 771.4,-865.18 774.24,-871.58"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node6 -->
-<g id="edge27_Node000019_Node000006" class="edge">
-<title>Node19&#45;&gt;Node6</title>
-<g id="a_edge27_Node000019_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M872.01,-89.33C877.58,-92.94 882.66,-97.32 886.5,-102.62 960.05,-204.32 971.13,-618.97 972.74,-718.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="969.24,-718.15 972.88,-728.1 976.23,-718.05 969.24,-718.15"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node7 -->
-<g id="edge28_Node000019_Node000007" class="edge">
-<title>Node19&#45;&gt;Node7</title>
-<g id="a_edge28_Node000019_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M829.2,-89.02C837.45,-146.97 867.03,-357.51 886.5,-531.62 896.02,-616.8 881.62,-840.29 922.5,-915.62 927.58,-924.98 935.86,-932.91 944.26,-939.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="942.14,-941.97 952.38,-944.69 946.07,-936.18 942.14,-941.97"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1025.5,-67.88 922.5,-67.88 922.5,-37.38 1025.5,-37.38 1025.5,-67.88"/>
-<text text-anchor="start" x="930.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::system</text>
-<text text-anchor="middle" x="974" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge29_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge29_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M886.81,-65.02C894.83,-63.87 903.08,-62.68 911.15,-61.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="911.48,-65.01 920.88,-60.12 910.49,-58.08 911.48,-65.01"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1001.12,-19.25 946.88,-19.25 946.88,0 1001.12,0 1001.12,-19.25"/>
-<text text-anchor="middle" x="974" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node21 -->
-<g id="edge30_Node000019_Node000021" class="edge">
-<title>Node19&#45;&gt;Node21</title>
-<g id="a_edge30_Node000019_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M858.54,-57.98C877.02,-49.01 900.89,-37.76 922.5,-28.62 926.87,-26.78 931.48,-24.92 936.08,-23.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="937.13,-26.47 945.22,-19.63 934.63,-19.93 937.13,-26.47"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1003.75,-142.25 944.25,-142.25 944.25,-123 1003.75,-123 1003.75,-142.25"/>
-<text text-anchor="middle" x="974" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node22 -->
-<g id="edge31_Node000019_Node000022" class="edge">
-<title>Node19&#45;&gt;Node22</title>
-<g id="a_edge31_Node000019_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M862.16,-89.35C880.1,-97.21 902.34,-106.72 922.5,-114.62 925.92,-115.97 929.49,-117.33 933.08,-118.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="931.76,-121.9 942.35,-122.04 934.16,-115.33 931.76,-121.9"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1003.38,-105.25 944.62,-105.25 944.62,-86 1003.38,-86 1003.38,-105.25"/>
-<text text-anchor="middle" x="974" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node23 -->
-<g id="edge32_Node000019_Node000023" class="edge">
-<title>Node19&#45;&gt;Node23</title>
-<g id="a_edge32_Node000019_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M886.81,-82.64C902.46,-85 918.96,-87.48 933.28,-89.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="932.34,-93.04 942.75,-91.07 933.38,-86.12 932.34,-93.04"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node6 -->
-<g id="edge36_Node000024_Node000006" class="edge">
-<title>Node24&#45;&gt;Node6</title>
-<g id="a_edge36_Node000024_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M705.73,-835.96C713.66,-833.2 721.82,-830.34 729.5,-827.62 803.05,-801.59 888.81,-770.4 936.41,-753.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="937.48,-756.35 945.67,-749.63 935.08,-749.78 937.48,-756.35"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node7 -->
-<g id="edge37_Node000024_Node000007" class="edge">
-<title>Node24&#45;&gt;Node7</title>
-<g id="a_edge37_Node000024_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M729.78,-837.36C786.59,-827.33 861.44,-818.34 886.5,-834.62 919.53,-856.09 898.36,-884.49 922.5,-915.62 929.45,-924.58 938.81,-932.72 947.58,-939.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="945.31,-941.95 955.5,-944.87 949.35,-936.24 945.31,-941.95"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node8 -->
-<g id="edge38_Node000024_Node000008" class="edge">
-<title>Node24&#45;&gt;Node8</title>
-<g id="a_edge38_Node000024_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M717.87,-867.36C731.2,-871 745.48,-874.9 759.12,-878.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="757.88,-881.92 768.44,-881.18 759.72,-875.17 757.88,-881.92"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node17 -->
-<g id="edge39_Node000024_Node000017" class="edge">
-<title>Node24&#45;&gt;Node17</title>
-<g id="a_edge39_Node000024_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M729.64,-852.47C738.45,-852.57 747.45,-852.68 756.25,-852.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="756.1,-856.29 766.14,-852.91 756.18,-849.29 756.1,-856.29"/>
-</a>
-</g>
-</g>
-<!-- Node30&#45;&gt;Node8 -->
-<g id="edge47_Node000030_Node000008" class="edge">
-<title>Node30&#45;&gt;Node8</title>
-<g id="a_edge47_Node000030_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M729.64,-895.47C739.21,-895.58 749.01,-895.7 758.52,-895.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="758.39,-899.32 768.43,-895.94 758.47,-892.32 758.39,-899.32"/>
-</a>
-</g>
-</g>
-<!-- Node30&#45;&gt;Node17 -->
-<g id="edge48_Node000030_Node000017" class="edge">
-<title>Node30&#45;&gt;Node17</title>
-<g id="a_edge48_Node000030_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M700.55,-884.6C722.59,-879.11 750.12,-872.26 773.69,-866.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="774.22,-869.87 783.07,-864.06 772.52,-863.08 774.22,-869.87"/>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node6 -->
-<g id="edge54_Node000032_Node000006" class="edge">
-<title>Node32&#45;&gt;Node6</title>
-<g id="a_edge54_Node000032_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M482.35,-435.49C484.85,-380.9 499.96,-235.13 589,-173.62 640.38,-138.14 677.22,-139.47 729.5,-173.62 927.54,-303.02 965.13,-631.23 971.7,-718.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="968.21,-718.38 972.38,-728.12 975.19,-717.91 968.21,-718.38"/>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node7 -->
-<g id="edge56_Node000032_Node000007" class="edge">
-<title>Node32&#45;&gt;Node7</title>
-<g id="a_edge56_Node000032_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M489.6,-477.69C504.25,-518.43 536.09,-611.11 553,-691.62 566.71,-756.9 539.09,-945.38 589,-989.62 690.94,-1079.99 873.54,-1005.16 944.09,-970.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="945.29,-974.01 952.68,-966.42 942.17,-967.74 945.29,-974.01"/>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node17 -->
-<g id="edge70_Node000032_Node000017" class="edge">
-<title>Node32&#45;&gt;Node17</title>
-<g id="a_edge70_Node000032_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M497.26,-477.94C513.01,-500.53 537.33,-537.71 553,-572.62 575.63,-623.04 554.07,-648.81 589,-691.62 633.88,-746.63 671.49,-726.69 729.5,-767.62 758.95,-788.41 789.27,-817.21 807.62,-835.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="805.05,-838.01 814.56,-842.68 810.04,-833.1 805.05,-838.01"/>
-</a>
-</g>
-</g>
-<!-- Node33 -->
-<g id="Node000033" class="node">
-<title>Node33</title>
-<g id="a_Node000033"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="704,-596.25 614.5,-596.25 614.5,-577 704,-577 704,-596.25"/>
-<text text-anchor="middle" x="659.25" y="-582.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node33 -->
-<g id="edge51_Node000032_Node000033" class="edge">
-<title>Node32&#45;&gt;Node33</title>
-<g id="a_edge51_Node000032_Node000033"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M496.34,-477.76C514.86,-503.18 549.32,-545.33 589,-568.62 593.58,-571.31 598.56,-573.61 603.68,-575.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="602.28,-578.78 612.87,-578.63 604.5,-572.14 602.28,-578.78"/>
-</a>
-</g>
-</g>
-<!-- Node34 -->
-<g id="Node000034" class="node">
-<title>Node34</title>
-<g id="a_Node000034"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="702.88,-559.25 615.62,-559.25 615.62,-540 702.88,-540 702.88,-559.25"/>
-<text text-anchor="middle" x="659.25" y="-545.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::c_str</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node34 -->
-<g id="edge52_Node000032_Node000034" class="edge">
-<title>Node32&#45;&gt;Node34</title>
-<g id="a_edge52_Node000032_Node000034"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M506.7,-477.89C527.46,-494.67 558.49,-517.54 589,-531.62 593.89,-533.88 599.11,-535.89 604.4,-537.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="603.27,-540.98 613.86,-540.57 605.32,-534.29 603.27,-540.98"/>
-</a>
-</g>
-</g>
-<!-- Node35 -->
-<g id="Node000035" class="node">
-<title>Node35</title>
-<g id="a_Node000035"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="709.25,-522.25 609.25,-522.25 609.25,-503 709.25,-503 709.25,-522.25"/>
-<text text-anchor="middle" x="659.25" y="-508.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node35 -->
-<g id="edge53_Node000032_Node000035" class="edge">
-<title>Node32&#45;&gt;Node35</title>
-<g id="a_edge53_Node000032_Node000035"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M539.11,-477.96C555.16,-483.66 572.68,-489.62 589,-494.62 594.5,-496.31 600.28,-497.98 606.05,-499.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="605.05,-502.93 615.61,-502.15 606.87,-496.17 605.05,-502.93"/>
-</a>
-</g>
-</g>
-<!-- Node36 -->
-<g id="Node000036" class="node">
-<title>Node36</title>
-<g id="a_Node000036"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ios/eof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="704.38,-485.25 614.12,-485.25 614.12,-466 704.38,-466 704.38,-485.25"/>
-<text text-anchor="middle" x="659.25" y="-471.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::eof</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node36 -->
-<g id="edge55_Node000032_Node000036" class="edge">
-<title>Node32&#45;&gt;Node36</title>
-<g id="a_edge55_Node000032_Node000036"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M544.55,-463.38C563.41,-465.41 583.96,-467.62 602.34,-469.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="601.95,-473.08 612.27,-470.67 602.7,-466.12 601.95,-473.08"/>
-</a>
-</g>
-</g>
-<!-- Node37 -->
-<g id="Node000037" class="node">
-<title>Node37</title>
-<g id="a_Node000037"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="691.25,-448.25 627.25,-448.25 627.25,-429 691.25,-429 691.25,-448.25"/>
-<text text-anchor="middle" x="659.25" y="-434.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node37 -->
-<g id="edge57_Node000032_Node000037" class="edge">
-<title>Node32&#45;&gt;Node37</title>
-<g id="a_edge57_Node000032_Node000037"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M544.55,-450.23C568.11,-447.82 594.33,-445.15 615.65,-442.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="615.84,-446.47 625.43,-441.97 615.13,-439.51 615.84,-446.47"/>
-</a>
-</g>
-</g>
-<!-- Node38 -->
-<g id="Node000038" class="node">
-<title>Node38</title>
-<g id="a_Node000038"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="720.12,-410.88 598.38,-410.88 598.38,-380.38 720.12,-380.38 720.12,-410.88"/>
-<text text-anchor="start" x="606.38" y="-397.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::insert</text>
-<text text-anchor="middle" x="659.25" y="-386.12" font-family="Helvetica,sans-Serif" font-size="10.00">_element</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node38 -->
-<g id="edge58_Node000032_Node000038" class="edge">
-<title>Node32&#45;&gt;Node38</title>
-<g id="a_edge58_Node000032_Node000038"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M543.56,-435.29C562.58,-428.71 583.41,-421.51 602.04,-415.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="602.98,-418.44 611.29,-411.87 600.69,-411.83 602.98,-418.44"/>
-</a>
-</g>
-</g>
-<!-- Node39 -->
-<g id="Node000039" class="node">
-<title>Node39</title>
-<g id="a_Node000039"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="714.5,-362.25 604,-362.25 604,-343 714.5,-343 714.5,-362.25"/>
-<text text-anchor="middle" x="659.25" y="-348.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node39 -->
-<g id="edge59_Node000032_Node000039" class="edge">
-<title>Node32&#45;&gt;Node39</title>
-<g id="a_edge59_Node000032_Node000039"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M503.02,-435.51C523.41,-416.27 555.97,-388.37 589,-371.62 592.72,-369.74 596.65,-368.02 600.68,-366.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="601.75,-369.79 610.03,-363.18 599.44,-363.18 601.75,-369.79"/>
-</a>
-</g>
-</g>
-<!-- Node40 -->
-<g id="Node000040" class="node">
-<title>Node40</title>
-<g id="a_Node000040"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="725.38,-682.88 593.12,-682.88 593.12,-652.38 725.38,-652.38 725.38,-682.88"/>
-<text text-anchor="start" x="601.12" y="-669.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::minmax</text>
-<text text-anchor="middle" x="659.25" y="-658.12" font-family="Helvetica,sans-Serif" font-size="10.00">_scaler</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node40 -->
-<g id="edge60_Node000032_Node000040" class="edge">
-<title>Node32&#45;&gt;Node40</title>
-<g id="a_edge60_Node000032_Node000040"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M495.09,-477.94C514.11,-507.88 551.1,-563.44 589,-605.62 601.53,-619.57 616.95,-633.63 630.06,-644.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="627.63,-647.36 637.54,-651.11 632.13,-642 627.63,-647.36"/>
-</a>
-</g>
-</g>
-<!-- Node42 -->
-<g id="Node000042" class="node">
-<title>Node42</title>
-<g id="a_Node000042"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="708.12,-325.25 610.38,-325.25 610.38,-306 708.12,-306 708.12,-325.25"/>
-<text text-anchor="middle" x="659.25" y="-311.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node42 -->
-<g id="edge67_Node000032_Node000042" class="edge">
-<title>Node32&#45;&gt;Node42</title>
-<g id="a_edge67_Node000032_Node000042"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M494.61,-435.31C512.28,-407.61 546.86,-359.71 589,-333.62 592.32,-331.57 595.87,-329.75 599.55,-328.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="600.62,-331.47 608.72,-324.64 598.13,-324.92 600.62,-331.47"/>
-</a>
-</g>
-</g>
-<!-- Node43 -->
-<g id="Node000043" class="node">
-<title>Node43</title>
-<g id="a_Node000043"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="729.12,-288.25 589.38,-288.25 589.38,-269 729.12,-269 729.12,-288.25"/>
-<text text-anchor="middle" x="659.25" y="-274.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node43 -->
-<g id="edge68_Node000032_Node000043" class="edge">
-<title>Node32&#45;&gt;Node43</title>
-<g id="a_edge68_Node000032_Node000043"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M490.15,-435.35C504.73,-400.78 538.31,-332.63 589,-296.62 590.39,-295.64 591.84,-294.7 593.32,-293.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="594.85,-296.96 602.25,-289.38 591.73,-290.7 594.85,-296.96"/>
-</a>
-</g>
-</g>
-<!-- Node44 -->
-<g id="Node000044" class="node">
-<title>Node44</title>
-<g id="a_Node000044"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="716,-250.88 602.5,-250.88 602.5,-220.38 716,-220.38 716,-250.88"/>
-<text text-anchor="start" x="610.5" y="-237.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop</text>
-<text text-anchor="middle" x="659.25" y="-226.12" font-family="Helvetica,sans-Serif" font-size="10.00">_front</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node44 -->
-<g id="edge69_Node000032_Node000044" class="edge">
-<title>Node32&#45;&gt;Node44</title>
-<g id="a_edge69_Node000032_Node000044"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M487.73,-435.53C499.9,-395.51 531.69,-308.21 589,-259.62 590.12,-258.68 591.28,-257.76 592.47,-256.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="594.26,-259.9 600.9,-251.64 590.56,-253.96 594.26,-259.9"/>
-</a>
-</g>
-</g>
-<!-- Node45 -->
-<g id="Node000045" class="node">
-<title>Node45</title>
-<g id="a_Node000045"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="686.38,-202.25 632.12,-202.25 632.12,-183 686.38,-183 686.38,-202.25"/>
-<text text-anchor="middle" x="659.25" y="-188.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stod</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node45 -->
-<g id="edge71_Node000032_Node000045" class="edge">
-<title>Node32&#45;&gt;Node45</title>
-<g id="a_edge71_Node000032_Node000045"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M484.93,-435.3C492.9,-387.74 518.78,-272.37 589,-211.62 597.84,-203.98 609.49,-199.38 620.71,-196.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="621.06,-200.13 630.18,-194.75 619.69,-193.27 621.06,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node40&#45;&gt;Node6 -->
-<g id="edge61_Node000040_Node000006" class="edge">
-<title>Node40&#45;&gt;Node6</title>
-<g id="a_edge61_Node000040_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M706.04,-651.88C753.23,-638.38 827.95,-624.69 886.5,-649.62 919.91,-663.85 946.65,-698.02 961.13,-719.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="958.11,-721.7 966.42,-728.27 964.02,-717.95 958.11,-721.7"/>
-</a>
-</g>
-</g>
-<!-- Node40&#45;&gt;Node7 -->
-<g id="edge62_Node000040_Node000007" class="edge">
-<title>Node40&#45;&gt;Node7</title>
-<g id="a_edge62_Node000040_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M725.65,-663.24C784.04,-660.84 863.75,-661.78 886.5,-682.62 963.75,-753.42 869.79,-825.06 922.5,-915.62 927.9,-924.9 936.34,-932.83 944.78,-939.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="942.68,-941.94 952.91,-944.69 946.63,-936.16 942.68,-941.94"/>
-</a>
-</g>
-</g>
-<!-- Node40&#45;&gt;Node8 -->
-<g id="edge63_Node000040_Node000008" class="edge">
-<title>Node40&#45;&gt;Node8</title>
-<g id="a_edge63_Node000040_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M672.96,-683.05C688.08,-702 713.31,-735.59 729.5,-767.62 751.75,-811.65 731.55,-836.83 765.5,-872.62 765.87,-873.02 766.25,-873.41 766.64,-873.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="764.46,-876.53 774.48,-879.98 768.8,-871.04 764.46,-876.53"/>
-</a>
-</g>
-</g>
-<!-- Node40&#45;&gt;Node25 -->
-<g id="edge65_Node000040_Node000025" class="edge">
-<title>Node40&#45;&gt;Node25</title>
-<g id="a_edge65_Node000040_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M725.84,-681.16C747.29,-685.59 770.32,-690.34 788.78,-694.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="787.93,-697.55 798.43,-696.14 789.35,-690.69 787.93,-697.55"/>
-</a>
-</g>
-</g>
-<!-- Node40&#45;&gt;Node28 -->
-<g id="edge66_Node000040_Node000028" class="edge">
-<title>Node40&#45;&gt;Node28</title>
-<g id="a_edge66_Node000040_Node000028"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M709.77,-651.99C716.9,-648.35 723.76,-643.93 729.5,-638.62 755.19,-614.88 738.63,-591.02 765.5,-568.62 767.6,-566.88 769.86,-565.3 772.24,-563.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="773.72,-567.04 781.16,-559.5 770.64,-560.76 773.72,-567.04"/>
-</a>
-</g>
-</g>
-<!-- Node41 -->
-<g id="Node000041" class="node">
-<title>Node41</title>
-<g id="a_Node000041"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="853.12,-597.25 798.88,-597.25 798.88,-578 853.12,-578 853.12,-597.25"/>
-<text text-anchor="middle" x="826" y="-583.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node40&#45;&gt;Node41 -->
-<g id="edge64_Node000040_Node000041" class="edge">
-<title>Node40&#45;&gt;Node41</title>
-<g id="a_edge64_Node000040_Node000041"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M702.43,-651.92C711.56,-647.98 721.02,-643.48 729.5,-638.62 746.86,-628.69 748.08,-621.45 765.5,-611.62 772.56,-607.65 780.41,-603.99 788.03,-600.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="789.15,-604.12 797.14,-597.16 786.55,-597.62 789.15,-604.12"/>
-</a>
-</g>
-</g>
-<!-- Node46&#45;&gt;Node13 -->
-<g id="edge73_Node000046_Node000013" class="edge">
-<title>Node46&#45;&gt;Node13</title>
-<g id="a_edge73_Node000046_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M365.94,-1175.77C376.17,-1177.92 386.91,-1180.16 397.53,-1182.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.54,-1185.76 407.05,-1184.38 397.98,-1178.91 396.54,-1185.76"/>
-</a>
-</g>
-</g>
-<!-- Node47&#45;&gt;Node6 -->
-<g id="edge75_Node000047_Node000006" class="edge">
-<title>Node47&#45;&gt;Node6</title>
-<g id="a_edge75_Node000047_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M719.25,-776.31C734.18,-771.54 750.3,-766.93 765.5,-763.62 824.17,-750.89 893.73,-744.59 935.56,-741.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="935.59,-745.23 945.34,-741.09 935.13,-738.25 935.59,-745.23"/>
-</a>
-</g>
-</g>
-<!-- Node47&#45;&gt;Node8 -->
-<g id="edge76_Node000047_Node000008" class="edge">
-<title>Node47&#45;&gt;Node8</title>
-<g id="a_edge76_Node000047_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M716.06,-818.86C720.78,-821.52 725.34,-824.44 729.5,-827.62 749.85,-843.17 744.95,-857.33 765.5,-872.62 766.81,-873.6 768.17,-874.55 769.56,-875.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="767.46,-878.28 777.87,-880.25 770.95,-872.22 767.46,-878.28"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 12f410e3e..000000000
--- a/d2/d58/neural__network_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,1140 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="1034pt" height="1321pt"
- viewBox="0.00 0.00 1033.50 1321.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 1317.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-1061.25 0,-1061.25 0,-1042 32.5,-1042 32.5,-1061.25"/>
-<text text-anchor="middle" x="16.25" y="-1047.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="724.25,-1242.25 594.25,-1242.25 594.25,-1223 724.25,-1223 724.25,-1242.25"/>
-<text text-anchor="middle" x="659.25" y="-1228.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::argmax</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.92,-1061.45C32.88,-1074.09 49.86,-1096.13 68.5,-1110.62 198.69,-1211.84 246.45,-1229.39 408.75,-1258.62 471.85,-1269.99 489.36,-1266.37 553,-1258.62 573.83,-1256.09 596.48,-1250.83 615.41,-1245.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="616.24,-1249.11 624.92,-1243.04 614.35,-1242.37 616.24,-1249.11"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.5,-924.5 68.5,-924.5 68.5,-882.75 195.5,-882.75 195.5,-924.5"/>
-<text text-anchor="start" x="76.5" y="-911" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="76.5" y="-899.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="132" y="-888.5" font-family="Helvetica,sans-Serif" font-size="10.00">::fit_from_csv</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge12_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge12_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.71,-1041.91C41.29,-1020.34 81.77,-967.67 107.72,-933.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.38,-936.2 113.7,-926.14 104.83,-931.93 110.38,-936.2"/>
-</a>
-</g>
-</g>
-<!-- Node46 -->
-<g id="Node000046" class="node">
-<title>Node46</title>
-<g id="a_Node000046"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="365.62,-1183.5 238.62,-1183.5 238.62,-1141.75 365.62,-1141.75 365.62,-1183.5"/>
-<text text-anchor="start" x="246.62" y="-1170" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="246.62" y="-1158.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="302.12" y="-1147.5" font-family="Helvetica,sans-Serif" font-size="10.00">::single_predict</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node46 -->
-<g id="edge72_Node000001_Node000046" class="edge">
-<title>Node1&#45;&gt;Node46</title>
-<g id="a_edge72_Node000001_Node000046"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.92,-1057.75C70.93,-1072.61 169.79,-1111.27 236.27,-1137.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="234.65,-1140.39 245.24,-1140.77 237.2,-1133.87 234.65,-1140.39"/>
-</a>
-</g>
-</g>
-<!-- Node47 -->
-<g id="Node000047" class="node">
-<title>Node47</title>
-<g id="a_Node000047"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="722.75,-818.5 595.75,-818.5 595.75,-776.75 722.75,-776.75 722.75,-818.5"/>
-<text text-anchor="start" x="603.75" y="-805" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="603.75" y="-793.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="659.25" y="-782.5" font-family="Helvetica,sans-Serif" font-size="10.00">::summary</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node47 -->
-<g id="edge74_Node000001_Node000047" class="edge">
-<title>Node1&#45;&gt;Node47</title>
-<g id="a_edge74_Node000001_Node000047"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M17.51,-1041.54C18.75,-1012.27 26.04,-926.14 68.5,-873.62 176.33,-740.27 242.4,-733.32 408.75,-691.62 470.94,-676.04 496.21,-661.87 553,-691.62 577.9,-704.67 569.7,-723.19 589,-743.62 597.66,-752.79 607.95,-761.67 617.91,-769.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="615.64,-772.15 625.71,-775.43 619.88,-766.59 615.64,-772.15"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="855.38,-1202.25 796.62,-1202.25 796.62,-1183 855.38,-1183 855.38,-1202.25"/>
-<text text-anchor="middle" x="826" y="-1188.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M701.82,-1222.53C727.37,-1216.33 759.91,-1208.43 785.13,-1202.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="785.79,-1205.75 794.68,-1199.99 784.14,-1198.94 785.79,-1205.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="862.12,-1313.25 789.88,-1313.25 789.88,-1294 862.12,-1294 862.12,-1313.25"/>
-<text text-anchor="middle" x="826" y="-1299.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M677.7,-1242.59C698.23,-1254.03 733.58,-1272.87 765.5,-1285.62 769.78,-1287.34 774.3,-1288.98 778.84,-1290.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="777.38,-1293.73 787.98,-1293.49 779.54,-1287.07 777.38,-1293.73"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="851.62,-1276.25 800.38,-1276.25 800.38,-1257 851.62,-1257 851.62,-1276.25"/>
-<text text-anchor="middle" x="826" y="-1262.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M709.23,-1242.73C734.88,-1248.03 765.71,-1254.39 789.11,-1259.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="788.29,-1262.62 798.79,-1261.22 789.7,-1255.77 788.29,-1262.62"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1000.75,-749.25 947.25,-749.25 947.25,-730 1000.75,-730 1000.75,-749.25"/>
-<text text-anchor="middle" x="974" y="-735.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M718.25,-1222.58C722.34,-1220.41 726.16,-1217.79 729.5,-1214.62 767.77,-1178.38 740.6,-1148.08 765.5,-1101.62 806.12,-1025.83 842.85,-1024.73 886.5,-950.62 906.6,-916.49 948.13,-806.79 965.31,-760.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="968.59,-761.75 968.77,-751.15 962.02,-759.32 968.59,-761.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="999.62,-965.25 948.38,-965.25 948.38,-946 999.62,-946 999.62,-965.25"/>
-<text text-anchor="middle" x="974" y="-951.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M712.7,-1222.61C718.58,-1220.45 724.32,-1217.82 729.5,-1214.62 750.14,-1201.9 746.66,-1188.89 765.5,-1173.62 813.42,-1134.78 842.64,-1149 886.5,-1105.62 925.54,-1067.01 952.91,-1007.13 965.38,-976"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="968.53,-977.57 968.88,-966.98 962,-975.04 968.53,-977.57"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="881.62,-911.88 770.38,-911.88 770.38,-881.38 881.62,-881.38 881.62,-911.88"/>
-<text text-anchor="start" x="778.38" y="-898.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="826" y="-887.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M719.28,-1222.59C723.04,-1220.4 726.51,-1217.78 729.5,-1214.62 784.19,-1157.05 742.14,-1115.52 765.5,-1039.62 778.49,-997.42 799.29,-950.53 812.55,-922.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="815.61,-924.03 816.74,-913.5 809.28,-921.03 815.61,-924.03"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="873,-1239.25 779,-1239.25 779,-1220 873,-1220 873,-1239.25"/>
-<text text-anchor="middle" x="826" y="-1225.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge11_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge11_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M724.42,-1231.46C738.54,-1231.2 753.4,-1230.93 767.25,-1230.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="767.15,-1234.18 777.09,-1230.5 767.03,-1227.18 767.15,-1234.18"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge8_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge8_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M874.05,-880.92C878.48,-878.49 882.72,-875.74 886.5,-872.62 924.63,-841.24 951.78,-788.57 964.63,-759.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="967.76,-761.4 968.51,-750.83 961.34,-758.62 967.76,-761.4"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge9_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge9_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M865.74,-912.28C888.15,-921.33 916.12,-932.64 937.88,-941.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="936.33,-944.58 946.91,-945.08 938.95,-938.09 936.33,-944.58"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1014.25,-906.25 933.75,-906.25 933.75,-887 1014.25,-887 1014.25,-906.25"/>
-<text text-anchor="middle" x="974" y="-892.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge10_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge10_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M881.78,-896.62C895.05,-896.62 909.17,-896.62 922.25,-896.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="921.9,-900.13 931.9,-896.63 921.9,-893.13 921.9,-900.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="372.75,-918.88 231.5,-918.88 231.5,-888.38 372.75,-888.38 372.75,-918.88"/>
-<text text-anchor="start" x="239.5" y="-905.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="middle" x="302.12" y="-894.12" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork::fit</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge13_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge13_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M195.6,-903.62C203.47,-903.62 211.61,-903.62 219.71,-903.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.6,-907.13 229.6,-903.63 219.6,-900.13 219.6,-907.13"/>
-</a>
-</g>
-</g>
-<!-- Node32 -->
-<g id="Node000032" class="node">
-<title>Node32</title>
-<g id="a_Node000032"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="544.38,-477.5 417.38,-477.5 417.38,-435.75 544.38,-435.75 544.38,-477.5"/>
-<text text-anchor="start" x="425.38" y="-464" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="425.38" y="-452.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="480.88" y="-441.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_XY_from_csv</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node32 -->
-<g id="edge50_Node000011_Node000032" class="edge">
-<title>Node11&#45;&gt;Node32</title>
-<g id="a_edge50_Node000011_Node000032"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M149.5,-882.37C205.83,-809.78 390.7,-571.54 456.42,-486.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="459.19,-489 462.55,-478.95 453.66,-484.7 459.19,-489"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node2 -->
-<g id="edge23_Node000012_Node000002" class="edge">
-<title>Node12&#45;&gt;Node2</title>
-<g id="a_edge23_Node000012_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.87,-919.09C327.55,-983.17 402.1,-1224.73 408.75,-1229.62 469.48,-1274.35 563.02,-1259.62 616.64,-1245.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="617.27,-1249.09 625.99,-1243.07 615.42,-1242.33 617.27,-1249.09"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node6 -->
-<g id="edge25_Node000012_Node000006" class="edge">
-<title>Node12&#45;&gt;Node6</title>
-<g id="a_edge25_Node000012_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.61,-888.08C300.47,-794.1 303.2,-300.44 589,-143.62 706.81,-78.98 800.04,-94.75 886.5,-197.62 954.72,-278.8 969.7,-628.47 972.45,-718.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="968.95,-718.36 972.73,-728.26 975.94,-718.17 968.95,-718.36"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node7 -->
-<g id="edge33_Node000012_Node000007" class="edge">
-<title>Node12&#45;&gt;Node7</title>
-<g id="a_edge33_Node000012_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M323.02,-919.18C343.44,-934.42 376.68,-957.25 408.75,-970.62 469.45,-995.94 491.84,-979.45 553,-1003.62 570.23,-1010.44 571.15,-1019.69 589,-1024.62 716.45,-1059.86 762.01,-1071.18 886.5,-1026.62 915.63,-1016.2 941.99,-991.27 957.75,-973.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="960.04,-976.62 963.99,-966.79 954.77,-972.01 960.04,-976.62"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node8 -->
-<g id="edge34_Node000012_Node000008" class="edge">
-<title>Node12&#45;&gt;Node8</title>
-<g id="a_edge34_Node000012_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M372.97,-897.59C384.9,-896.77 397.17,-896.06 408.75,-895.62 472.82,-893.2 490.6,-880.9 553,-895.62 570.41,-899.73 571.59,-909.52 589,-913.62 649.77,-927.97 667.3,-919.12 729.5,-913.62 738.96,-912.79 748.9,-911.5 758.63,-909.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="759.13,-913.45 768.43,-908.38 758,-906.54 759.13,-913.45"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="553,-1220.5 408.75,-1220.5 408.75,-1178.75 553,-1178.75 553,-1220.5"/>
-<text text-anchor="start" x="416.75" y="-1207" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="416.75" y="-1195.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="480.88" y="-1184.5" font-family="Helvetica,sans-Serif" font-size="10.00">::__detailed_single_prediction</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge14_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge14_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M305.06,-919.08C311.44,-963.84 335.75,-1095.07 408.75,-1169.62 409.35,-1170.24 409.96,-1170.83 410.59,-1171.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="408.18,-1173.98 418.19,-1177.47 412.54,-1168.51 408.18,-1173.98"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="719.75,-1155.88 598.75,-1155.88 598.75,-1125.38 719.75,-1125.38 719.75,-1155.88"/>
-<text text-anchor="start" x="606.75" y="-1142.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::apply</text>
-<text text-anchor="middle" x="659.25" y="-1131.12" font-family="Helvetica,sans-Serif" font-size="10.00">_function</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node14 -->
-<g id="edge22_Node000012_Node000014" class="edge">
-<title>Node12&#45;&gt;Node14</title>
-<g id="a_edge22_Node000012_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M315.42,-919.19C333.56,-941.13 369.61,-981.01 408.75,-1003.62 466.68,-1037.09 496.46,-1010.87 553,-1046.62 573.22,-1059.41 571.5,-1070.32 589,-1086.62 600.91,-1097.72 614.93,-1108.96 627.23,-1118.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="624.92,-1120.93 635.03,-1124.11 629.11,-1115.32 624.92,-1120.93"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="725,-980.25 593.5,-980.25 593.5,-961 725,-961 725,-980.25"/>
-<text text-anchor="middle" x="659.25" y="-966.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node16 -->
-<g id="edge41_Node000012_Node000016" class="edge">
-<title>Node12&#45;&gt;Node16</title>
-<g id="a_edge41_Node000012_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M373.17,-899.59C424.35,-898.86 494.7,-902.53 553,-922.62 571.18,-928.89 571.78,-938.07 589,-946.62 596.61,-950.4 604.96,-953.84 613.14,-956.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="611.71,-960.07 622.3,-960.08 614.03,-953.46 611.71,-960.07"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="545.5,-720.25 416.25,-720.25 416.25,-701 545.5,-701 545.5,-720.25"/>
-<text text-anchor="middle" x="480.88" y="-706.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::duration_cast</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node18 -->
-<g id="edge24_Node000012_Node000018" class="edge">
-<title>Node12&#45;&gt;Node18</title>
-<g id="a_edge24_Node000012_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.66,-888.07C321.21,-854.97 355,-777.1 408.75,-734.62 413.48,-730.89 418.82,-727.72 424.4,-725.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="425.38,-728.42 433.22,-721.29 422.65,-721.97 425.38,-728.42"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="886.5,-88.88 765.5,-88.88 765.5,-58.38 886.5,-58.38 886.5,-88.88"/>
-<text text-anchor="start" x="773.5" y="-75.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::equal</text>
-<text text-anchor="middle" x="826" y="-64.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node19 -->
-<g id="edge26_Node000012_Node000019" class="edge">
-<title>Node12&#45;&gt;Node19</title>
-<g id="a_edge26_Node000012_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.01,-888.14C310.22,-781.53 348.97,-158.83 408.75,-102.62 502.48,-14.5 666.48,-34.69 758.15,-55.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="757.23,-58.7 767.76,-57.55 758.81,-51.88 757.23,-58.7"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a xlink:href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="729.5,-866.88 589,-866.88 589,-836.38 729.5,-836.38 729.5,-866.88"/>
-<text text-anchor="start" x="597" y="-853.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::hadamard</text>
-<text text-anchor="middle" x="659.25" y="-842.12" font-family="Helvetica,sans-Serif" font-size="10.00">_product</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node24 -->
-<g id="edge35_Node000012_Node000024" class="edge">
-<title>Node12&#45;&gt;Node24</title>
-<g id="a_edge35_Node000012_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M320.23,-888.11C339.92,-871.4 374.02,-845.84 408.75,-835.62 466.24,-818.72 534.29,-824.7 584.78,-833.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="583.96,-837.21 594.44,-835.63 585.26,-830.33 583.96,-837.21"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="851.62,-711.25 800.38,-711.25 800.38,-692 851.62,-692 851.62,-711.25"/>
-<text text-anchor="middle" x="826" y="-697.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node25 -->
-<g id="edge40_Node000012_Node000025" class="edge">
-<title>Node12&#45;&gt;Node25</title>
-<g id="a_edge40_Node000012_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M318.95,-887.97C338.49,-869.43 373.51,-838.79 408.75,-820.62 540.02,-752.95 715,-719.06 789.26,-706.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="789.47,-710.47 798.79,-705.44 788.37,-703.55 789.47,-710.47"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="548.88,-1160.88 412.88,-1160.88 412.88,-1130.38 548.88,-1130.38 548.88,-1160.88"/>
-<text text-anchor="start" x="420.88" y="-1147.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::high_resolution</text>
-<text text-anchor="middle" x="480.88" y="-1136.12" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node26 -->
-<g id="edge42_Node000012_Node000026" class="edge">
-<title>Node12&#45;&gt;Node26</title>
-<g id="a_edge42_Node000012_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M306.33,-919.35C315.25,-959.12 344.08,-1064.61 408.75,-1121.62 409.54,-1122.32 410.35,-1123 411.18,-1123.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="409.19,-1126.53 419.46,-1129.15 413.06,-1120.7 409.19,-1126.53"/>
-</a>
-</g>
-</g>
-<!-- Node27 -->
-<g id="Node000027" class="node">
-<title>Node27</title>
-<g id="a_Node000027"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="528.25,-1112.25 433.5,-1112.25 433.5,-1093 528.25,-1093 528.25,-1112.25"/>
-<text text-anchor="middle" x="480.88" y="-1098.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node27 -->
-<g id="edge43_Node000012_Node000027" class="edge">
-<title>Node12&#45;&gt;Node27</title>
-<g id="a_edge43_Node000012_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.65,-919.27C318.69,-954.58 350.47,-1040.76 408.75,-1084.62 412.98,-1087.81 417.71,-1090.43 422.67,-1092.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="421.06,-1095.73 431.66,-1095.9 423.48,-1089.16 421.06,-1095.73"/>
-</a>
-</g>
-</g>
-<!-- Node28 -->
-<g id="Node000028" class="node">
-<title>Node28</title>
-<g id="a_Node000028"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="869.25,-560.25 782.75,-560.25 782.75,-541 869.25,-541 869.25,-560.25"/>
-<text text-anchor="middle" x="826" y="-546.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node28 -->
-<g id="edge44_Node000012_Node000028" class="edge">
-<title>Node12&#45;&gt;Node28</title>
-<g id="a_edge44_Node000012_Node000028"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M306.26,-888.09C315.01,-848.83 343.48,-744.97 408.75,-691.62 523.02,-598.22 602.2,-680.3 729.5,-605.62 749.29,-594.02 745.9,-580.55 765.5,-568.62 767.52,-567.4 769.62,-566.25 771.79,-565.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="773.06,-568.44 780.86,-561.27 770.29,-562.01 773.06,-568.44"/>
-</a>
-</g>
-</g>
-<!-- Node29 -->
-<g id="Node000029" class="node">
-<title>Node29</title>
-<g id="a_Node000029"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="539.12,-1075.25 422.62,-1075.25 422.62,-1056 539.12,-1056 539.12,-1075.25"/>
-<text text-anchor="middle" x="480.88" y="-1061.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node29 -->
-<g id="edge45_Node000012_Node000029" class="edge">
-<title>Node12&#45;&gt;Node29</title>
-<g id="a_edge45_Node000012_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M311.03,-919.31C326.16,-947.77 361.9,-1008.07 408.75,-1041.62 414.04,-1045.42 419.98,-1048.64 426.11,-1051.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="424.53,-1054.52 435.12,-1054.97 427.13,-1048.02 424.53,-1054.52"/>
-</a>
-</g>
-</g>
-<!-- Node30 -->
-<g id="Node000030" class="node">
-<title>Node30</title>
-<g id="a_Node000030"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="729.5,-904.25 589,-904.25 589,-885 729.5,-885 729.5,-904.25"/>
-<text text-anchor="middle" x="659.25" y="-890.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::transpose</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node30 -->
-<g id="edge46_Node000012_Node000030" class="edge">
-<title>Node12&#45;&gt;Node30</title>
-<g id="a_edge46_Node000012_Node000030"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M326.69,-888.09C347.34,-875.46 378.69,-858.62 408.75,-851.62 471.19,-837.09 491.64,-833.05 553,-851.62 571.4,-857.2 571.5,-867.65 589,-875.62 593.27,-877.57 597.79,-879.36 602.39,-880.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="601.14,-884.27 611.74,-884.05 603.32,-877.61 601.14,-884.27"/>
-</a>
-</g>
-</g>
-<!-- Node31 -->
-<g id="Node000031" class="node">
-<title>Node31</title>
-<g id="a_Node000031"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="544.38,-961.88 417.38,-961.88 417.38,-931.38 544.38,-931.38 544.38,-961.88"/>
-<text text-anchor="start" x="425.38" y="-948.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::zeroes</text>
-<text text-anchor="middle" x="480.88" y="-937.12" font-family="Helvetica,sans-Serif" font-size="10.00">_initialization</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node31 -->
-<g id="edge49_Node000012_Node000031" class="edge">
-<title>Node12&#45;&gt;Node31</title>
-<g id="a_edge49_Node000012_Node000031"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M367.69,-919.33C380.12,-922.36 393.23,-925.55 405.93,-928.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.95,-932 415.49,-930.96 406.6,-925.2 404.95,-932"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge15_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge15_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M545.55,-1178.32C563.53,-1172.31 582.98,-1165.8 600.58,-1159.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="601.47,-1163.31 609.84,-1156.82 599.25,-1156.67 601.47,-1163.31"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="725,-1205.25 593.5,-1205.25 593.5,-1186 725,-1186 725,-1205.25"/>
-<text text-anchor="middle" x="659.25" y="-1191.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node15 -->
-<g id="edge16_Node000013_Node000015" class="edge">
-<title>Node13&#45;&gt;Node15</title>
-<g id="a_edge16_Node000013_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M553.36,-1198C562.73,-1197.79 572.36,-1197.57 581.8,-1197.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="581.77,-1200.86 591.69,-1197.13 581.62,-1193.86 581.77,-1200.86"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node16 -->
-<g id="edge17_Node000013_Node000016" class="edge">
-<title>Node13&#45;&gt;Node16</title>
-<g id="a_edge17_Node000013_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M541.29,-1178.46C545.48,-1175.82 549.44,-1172.88 553,-1169.62 567.64,-1156.21 625.36,-1038.7 648.54,-990.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="651.55,-992.61 652.75,-982.09 645.25,-989.57 651.55,-992.61"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node6 -->
-<g id="edge18_Node000016_Node000006" class="edge">
-<title>Node16&#45;&gt;Node6</title>
-<g id="a_edge18_Node000016_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M718.22,-960.54C780.8,-949.22 873.33,-931.09 886.5,-920.62 913.49,-899.19 950.45,-802.7 965.83,-760.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="969.08,-761.33 969.14,-750.74 962.49,-758.98 969.08,-761.33"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node7 -->
-<g id="edge19_Node000016_Node000007" class="edge">
-<title>Node16&#45;&gt;Node7</title>
-<g id="a_edge19_Node000016_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M725.43,-967.5C789.54,-964.42 885.08,-959.84 936.72,-957.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="936.62,-960.87 946.44,-956.9 936.29,-953.88 936.62,-960.87"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node8 -->
-<g id="edge20_Node000016_Node000008" class="edge">
-<title>Node16&#45;&gt;Node8</title>
-<g id="a_edge20_Node000016_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M693.53,-960.55C705.1,-956.67 718.05,-951.89 729.5,-946.62 746.33,-938.89 749.16,-934.36 765.5,-925.62 770.63,-922.89 776.05,-920.1 781.45,-917.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="782.97,-920.54 790.38,-912.97 779.86,-914.27 782.97,-920.54"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="883.88,-863.25 768.12,-863.25 768.12,-844 883.88,-844 883.88,-863.25"/>
-<text text-anchor="middle" x="826" y="-849.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge21_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge21_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M673.81,-960.51C688.18,-949.56 711.27,-931.28 729.5,-913.62 746.92,-896.75 745.21,-885.91 765.5,-872.62 767.88,-871.07 770.4,-869.63 773,-868.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="774.24,-871.58 781.96,-864.33 771.4,-865.18 774.24,-871.58"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node6 -->
-<g id="edge27_Node000019_Node000006" class="edge">
-<title>Node19&#45;&gt;Node6</title>
-<g id="a_edge27_Node000019_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M872.01,-89.33C877.58,-92.94 882.66,-97.32 886.5,-102.62 960.05,-204.32 971.13,-618.97 972.74,-718.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="969.24,-718.15 972.88,-728.1 976.23,-718.05 969.24,-718.15"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node7 -->
-<g id="edge28_Node000019_Node000007" class="edge">
-<title>Node19&#45;&gt;Node7</title>
-<g id="a_edge28_Node000019_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M829.2,-89.02C837.45,-146.97 867.03,-357.51 886.5,-531.62 896.02,-616.8 881.62,-840.29 922.5,-915.62 927.58,-924.98 935.86,-932.91 944.26,-939.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="942.14,-941.97 952.38,-944.69 946.07,-936.18 942.14,-941.97"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1025.5,-67.88 922.5,-67.88 922.5,-37.38 1025.5,-37.38 1025.5,-67.88"/>
-<text text-anchor="start" x="930.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::system</text>
-<text text-anchor="middle" x="974" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge29_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge29_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M886.81,-65.02C894.83,-63.87 903.08,-62.68 911.15,-61.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="911.48,-65.01 920.88,-60.12 910.49,-58.08 911.48,-65.01"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1001.12,-19.25 946.88,-19.25 946.88,0 1001.12,0 1001.12,-19.25"/>
-<text text-anchor="middle" x="974" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node21 -->
-<g id="edge30_Node000019_Node000021" class="edge">
-<title>Node19&#45;&gt;Node21</title>
-<g id="a_edge30_Node000019_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M858.54,-57.98C877.02,-49.01 900.89,-37.76 922.5,-28.62 926.87,-26.78 931.48,-24.92 936.08,-23.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="937.13,-26.47 945.22,-19.63 934.63,-19.93 937.13,-26.47"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1003.75,-142.25 944.25,-142.25 944.25,-123 1003.75,-123 1003.75,-142.25"/>
-<text text-anchor="middle" x="974" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node22 -->
-<g id="edge31_Node000019_Node000022" class="edge">
-<title>Node19&#45;&gt;Node22</title>
-<g id="a_edge31_Node000019_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M862.16,-89.35C880.1,-97.21 902.34,-106.72 922.5,-114.62 925.92,-115.97 929.49,-117.33 933.08,-118.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="931.76,-121.9 942.35,-122.04 934.16,-115.33 931.76,-121.9"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1003.38,-105.25 944.62,-105.25 944.62,-86 1003.38,-86 1003.38,-105.25"/>
-<text text-anchor="middle" x="974" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node23 -->
-<g id="edge32_Node000019_Node000023" class="edge">
-<title>Node19&#45;&gt;Node23</title>
-<g id="a_edge32_Node000019_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M886.81,-82.64C902.46,-85 918.96,-87.48 933.28,-89.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="932.34,-93.04 942.75,-91.07 933.38,-86.12 932.34,-93.04"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node6 -->
-<g id="edge36_Node000024_Node000006" class="edge">
-<title>Node24&#45;&gt;Node6</title>
-<g id="a_edge36_Node000024_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M705.73,-835.96C713.66,-833.2 721.82,-830.34 729.5,-827.62 803.05,-801.59 888.81,-770.4 936.41,-753.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="937.48,-756.35 945.67,-749.63 935.08,-749.78 937.48,-756.35"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node7 -->
-<g id="edge37_Node000024_Node000007" class="edge">
-<title>Node24&#45;&gt;Node7</title>
-<g id="a_edge37_Node000024_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M729.78,-837.36C786.59,-827.33 861.44,-818.34 886.5,-834.62 919.53,-856.09 898.36,-884.49 922.5,-915.62 929.45,-924.58 938.81,-932.72 947.58,-939.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="945.31,-941.95 955.5,-944.87 949.35,-936.24 945.31,-941.95"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node8 -->
-<g id="edge38_Node000024_Node000008" class="edge">
-<title>Node24&#45;&gt;Node8</title>
-<g id="a_edge38_Node000024_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M717.87,-867.36C731.2,-871 745.48,-874.9 759.12,-878.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="757.88,-881.92 768.44,-881.18 759.72,-875.17 757.88,-881.92"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node17 -->
-<g id="edge39_Node000024_Node000017" class="edge">
-<title>Node24&#45;&gt;Node17</title>
-<g id="a_edge39_Node000024_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M729.64,-852.47C738.45,-852.57 747.45,-852.68 756.25,-852.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="756.1,-856.29 766.14,-852.91 756.18,-849.29 756.1,-856.29"/>
-</a>
-</g>
-</g>
-<!-- Node30&#45;&gt;Node8 -->
-<g id="edge47_Node000030_Node000008" class="edge">
-<title>Node30&#45;&gt;Node8</title>
-<g id="a_edge47_Node000030_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M729.64,-895.47C739.21,-895.58 749.01,-895.7 758.52,-895.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="758.39,-899.32 768.43,-895.94 758.47,-892.32 758.39,-899.32"/>
-</a>
-</g>
-</g>
-<!-- Node30&#45;&gt;Node17 -->
-<g id="edge48_Node000030_Node000017" class="edge">
-<title>Node30&#45;&gt;Node17</title>
-<g id="a_edge48_Node000030_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M700.55,-884.6C722.59,-879.11 750.12,-872.26 773.69,-866.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="774.22,-869.87 783.07,-864.06 772.52,-863.08 774.22,-869.87"/>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node6 -->
-<g id="edge54_Node000032_Node000006" class="edge">
-<title>Node32&#45;&gt;Node6</title>
-<g id="a_edge54_Node000032_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M482.35,-435.49C484.85,-380.9 499.96,-235.13 589,-173.62 640.38,-138.14 677.22,-139.47 729.5,-173.62 927.54,-303.02 965.13,-631.23 971.7,-718.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="968.21,-718.38 972.38,-728.12 975.19,-717.91 968.21,-718.38"/>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node7 -->
-<g id="edge56_Node000032_Node000007" class="edge">
-<title>Node32&#45;&gt;Node7</title>
-<g id="a_edge56_Node000032_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M489.6,-477.69C504.25,-518.43 536.09,-611.11 553,-691.62 566.71,-756.9 539.09,-945.38 589,-989.62 690.94,-1079.99 873.54,-1005.16 944.09,-970.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="945.29,-974.01 952.68,-966.42 942.17,-967.74 945.29,-974.01"/>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node17 -->
-<g id="edge70_Node000032_Node000017" class="edge">
-<title>Node32&#45;&gt;Node17</title>
-<g id="a_edge70_Node000032_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M497.26,-477.94C513.01,-500.53 537.33,-537.71 553,-572.62 575.63,-623.04 554.07,-648.81 589,-691.62 633.88,-746.63 671.49,-726.69 729.5,-767.62 758.95,-788.41 789.27,-817.21 807.62,-835.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="805.05,-838.01 814.56,-842.68 810.04,-833.1 805.05,-838.01"/>
-</a>
-</g>
-</g>
-<!-- Node33 -->
-<g id="Node000033" class="node">
-<title>Node33</title>
-<g id="a_Node000033"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="704,-596.25 614.5,-596.25 614.5,-577 704,-577 704,-596.25"/>
-<text text-anchor="middle" x="659.25" y="-582.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node33 -->
-<g id="edge51_Node000032_Node000033" class="edge">
-<title>Node32&#45;&gt;Node33</title>
-<g id="a_edge51_Node000032_Node000033"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M496.34,-477.76C514.86,-503.18 549.32,-545.33 589,-568.62 593.58,-571.31 598.56,-573.61 603.68,-575.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="602.28,-578.78 612.87,-578.63 604.5,-572.14 602.28,-578.78"/>
-</a>
-</g>
-</g>
-<!-- Node34 -->
-<g id="Node000034" class="node">
-<title>Node34</title>
-<g id="a_Node000034"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="702.88,-559.25 615.62,-559.25 615.62,-540 702.88,-540 702.88,-559.25"/>
-<text text-anchor="middle" x="659.25" y="-545.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::c_str</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node34 -->
-<g id="edge52_Node000032_Node000034" class="edge">
-<title>Node32&#45;&gt;Node34</title>
-<g id="a_edge52_Node000032_Node000034"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M506.7,-477.89C527.46,-494.67 558.49,-517.54 589,-531.62 593.89,-533.88 599.11,-535.89 604.4,-537.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="603.27,-540.98 613.86,-540.57 605.32,-534.29 603.27,-540.98"/>
-</a>
-</g>
-</g>
-<!-- Node35 -->
-<g id="Node000035" class="node">
-<title>Node35</title>
-<g id="a_Node000035"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="709.25,-522.25 609.25,-522.25 609.25,-503 709.25,-503 709.25,-522.25"/>
-<text text-anchor="middle" x="659.25" y="-508.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node35 -->
-<g id="edge53_Node000032_Node000035" class="edge">
-<title>Node32&#45;&gt;Node35</title>
-<g id="a_edge53_Node000032_Node000035"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M539.11,-477.96C555.16,-483.66 572.68,-489.62 589,-494.62 594.5,-496.31 600.28,-497.98 606.05,-499.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="605.05,-502.93 615.61,-502.15 606.87,-496.17 605.05,-502.93"/>
-</a>
-</g>
-</g>
-<!-- Node36 -->
-<g id="Node000036" class="node">
-<title>Node36</title>
-<g id="a_Node000036"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ios/eof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="704.38,-485.25 614.12,-485.25 614.12,-466 704.38,-466 704.38,-485.25"/>
-<text text-anchor="middle" x="659.25" y="-471.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::eof</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node36 -->
-<g id="edge55_Node000032_Node000036" class="edge">
-<title>Node32&#45;&gt;Node36</title>
-<g id="a_edge55_Node000032_Node000036"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M544.55,-463.38C563.41,-465.41 583.96,-467.62 602.34,-469.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="601.95,-473.08 612.27,-470.67 602.7,-466.12 601.95,-473.08"/>
-</a>
-</g>
-</g>
-<!-- Node37 -->
-<g id="Node000037" class="node">
-<title>Node37</title>
-<g id="a_Node000037"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="691.25,-448.25 627.25,-448.25 627.25,-429 691.25,-429 691.25,-448.25"/>
-<text text-anchor="middle" x="659.25" y="-434.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node37 -->
-<g id="edge57_Node000032_Node000037" class="edge">
-<title>Node32&#45;&gt;Node37</title>
-<g id="a_edge57_Node000032_Node000037"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M544.55,-450.23C568.11,-447.82 594.33,-445.15 615.65,-442.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="615.84,-446.47 625.43,-441.97 615.13,-439.51 615.84,-446.47"/>
-</a>
-</g>
-</g>
-<!-- Node38 -->
-<g id="Node000038" class="node">
-<title>Node38</title>
-<g id="a_Node000038"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="720.12,-410.88 598.38,-410.88 598.38,-380.38 720.12,-380.38 720.12,-410.88"/>
-<text text-anchor="start" x="606.38" y="-397.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::insert</text>
-<text text-anchor="middle" x="659.25" y="-386.12" font-family="Helvetica,sans-Serif" font-size="10.00">_element</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node38 -->
-<g id="edge58_Node000032_Node000038" class="edge">
-<title>Node32&#45;&gt;Node38</title>
-<g id="a_edge58_Node000032_Node000038"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M543.56,-435.29C562.58,-428.71 583.41,-421.51 602.04,-415.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="602.98,-418.44 611.29,-411.87 600.69,-411.83 602.98,-418.44"/>
-</a>
-</g>
-</g>
-<!-- Node39 -->
-<g id="Node000039" class="node">
-<title>Node39</title>
-<g id="a_Node000039"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="714.5,-362.25 604,-362.25 604,-343 714.5,-343 714.5,-362.25"/>
-<text text-anchor="middle" x="659.25" y="-348.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node39 -->
-<g id="edge59_Node000032_Node000039" class="edge">
-<title>Node32&#45;&gt;Node39</title>
-<g id="a_edge59_Node000032_Node000039"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M503.02,-435.51C523.41,-416.27 555.97,-388.37 589,-371.62 592.72,-369.74 596.65,-368.02 600.68,-366.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="601.75,-369.79 610.03,-363.18 599.44,-363.18 601.75,-369.79"/>
-</a>
-</g>
-</g>
-<!-- Node40 -->
-<g id="Node000040" class="node">
-<title>Node40</title>
-<g id="a_Node000040"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="725.38,-682.88 593.12,-682.88 593.12,-652.38 725.38,-652.38 725.38,-682.88"/>
-<text text-anchor="start" x="601.12" y="-669.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::minmax</text>
-<text text-anchor="middle" x="659.25" y="-658.12" font-family="Helvetica,sans-Serif" font-size="10.00">_scaler</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node40 -->
-<g id="edge60_Node000032_Node000040" class="edge">
-<title>Node32&#45;&gt;Node40</title>
-<g id="a_edge60_Node000032_Node000040"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M495.09,-477.94C514.11,-507.88 551.1,-563.44 589,-605.62 601.53,-619.57 616.95,-633.63 630.06,-644.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="627.63,-647.36 637.54,-651.11 632.13,-642 627.63,-647.36"/>
-</a>
-</g>
-</g>
-<!-- Node42 -->
-<g id="Node000042" class="node">
-<title>Node42</title>
-<g id="a_Node000042"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="708.12,-325.25 610.38,-325.25 610.38,-306 708.12,-306 708.12,-325.25"/>
-<text text-anchor="middle" x="659.25" y="-311.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node42 -->
-<g id="edge67_Node000032_Node000042" class="edge">
-<title>Node32&#45;&gt;Node42</title>
-<g id="a_edge67_Node000032_Node000042"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M494.61,-435.31C512.28,-407.61 546.86,-359.71 589,-333.62 592.32,-331.57 595.87,-329.75 599.55,-328.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="600.62,-331.47 608.72,-324.64 598.13,-324.92 600.62,-331.47"/>
-</a>
-</g>
-</g>
-<!-- Node43 -->
-<g id="Node000043" class="node">
-<title>Node43</title>
-<g id="a_Node000043"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="729.12,-288.25 589.38,-288.25 589.38,-269 729.12,-269 729.12,-288.25"/>
-<text text-anchor="middle" x="659.25" y="-274.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node43 -->
-<g id="edge68_Node000032_Node000043" class="edge">
-<title>Node32&#45;&gt;Node43</title>
-<g id="a_edge68_Node000032_Node000043"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M490.15,-435.35C504.73,-400.78 538.31,-332.63 589,-296.62 590.39,-295.64 591.84,-294.7 593.32,-293.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="594.85,-296.96 602.25,-289.38 591.73,-290.7 594.85,-296.96"/>
-</a>
-</g>
-</g>
-<!-- Node44 -->
-<g id="Node000044" class="node">
-<title>Node44</title>
-<g id="a_Node000044"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="716,-250.88 602.5,-250.88 602.5,-220.38 716,-220.38 716,-250.88"/>
-<text text-anchor="start" x="610.5" y="-237.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop</text>
-<text text-anchor="middle" x="659.25" y="-226.12" font-family="Helvetica,sans-Serif" font-size="10.00">_front</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node44 -->
-<g id="edge69_Node000032_Node000044" class="edge">
-<title>Node32&#45;&gt;Node44</title>
-<g id="a_edge69_Node000032_Node000044"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M487.73,-435.53C499.9,-395.51 531.69,-308.21 589,-259.62 590.12,-258.68 591.28,-257.76 592.47,-256.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="594.26,-259.9 600.9,-251.64 590.56,-253.96 594.26,-259.9"/>
-</a>
-</g>
-</g>
-<!-- Node45 -->
-<g id="Node000045" class="node">
-<title>Node45</title>
-<g id="a_Node000045"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="686.38,-202.25 632.12,-202.25 632.12,-183 686.38,-183 686.38,-202.25"/>
-<text text-anchor="middle" x="659.25" y="-188.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stod</text>
-</a>
-</g>
-</g>
-<!-- Node32&#45;&gt;Node45 -->
-<g id="edge71_Node000032_Node000045" class="edge">
-<title>Node32&#45;&gt;Node45</title>
-<g id="a_edge71_Node000032_Node000045"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M484.93,-435.3C492.9,-387.74 518.78,-272.37 589,-211.62 597.84,-203.98 609.49,-199.38 620.71,-196.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="621.06,-200.13 630.18,-194.75 619.69,-193.27 621.06,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node40&#45;&gt;Node6 -->
-<g id="edge61_Node000040_Node000006" class="edge">
-<title>Node40&#45;&gt;Node6</title>
-<g id="a_edge61_Node000040_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M706.04,-651.88C753.23,-638.38 827.95,-624.69 886.5,-649.62 919.91,-663.85 946.65,-698.02 961.13,-719.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="958.11,-721.7 966.42,-728.27 964.02,-717.95 958.11,-721.7"/>
-</a>
-</g>
-</g>
-<!-- Node40&#45;&gt;Node7 -->
-<g id="edge62_Node000040_Node000007" class="edge">
-<title>Node40&#45;&gt;Node7</title>
-<g id="a_edge62_Node000040_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M725.65,-663.24C784.04,-660.84 863.75,-661.78 886.5,-682.62 963.75,-753.42 869.79,-825.06 922.5,-915.62 927.9,-924.9 936.34,-932.83 944.78,-939.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="942.68,-941.94 952.91,-944.69 946.63,-936.16 942.68,-941.94"/>
-</a>
-</g>
-</g>
-<!-- Node40&#45;&gt;Node8 -->
-<g id="edge63_Node000040_Node000008" class="edge">
-<title>Node40&#45;&gt;Node8</title>
-<g id="a_edge63_Node000040_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M672.96,-683.05C688.08,-702 713.31,-735.59 729.5,-767.62 751.75,-811.65 731.55,-836.83 765.5,-872.62 765.87,-873.02 766.25,-873.41 766.64,-873.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="764.46,-876.53 774.48,-879.98 768.8,-871.04 764.46,-876.53"/>
-</a>
-</g>
-</g>
-<!-- Node40&#45;&gt;Node25 -->
-<g id="edge65_Node000040_Node000025" class="edge">
-<title>Node40&#45;&gt;Node25</title>
-<g id="a_edge65_Node000040_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M725.84,-681.16C747.29,-685.59 770.32,-690.34 788.78,-694.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="787.93,-697.55 798.43,-696.14 789.35,-690.69 787.93,-697.55"/>
-</a>
-</g>
-</g>
-<!-- Node40&#45;&gt;Node28 -->
-<g id="edge66_Node000040_Node000028" class="edge">
-<title>Node40&#45;&gt;Node28</title>
-<g id="a_edge66_Node000040_Node000028"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M709.77,-651.99C716.9,-648.35 723.76,-643.93 729.5,-638.62 755.19,-614.88 738.63,-591.02 765.5,-568.62 767.6,-566.88 769.86,-565.3 772.24,-563.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="773.72,-567.04 781.16,-559.5 770.64,-560.76 773.72,-567.04"/>
-</a>
-</g>
-</g>
-<!-- Node41 -->
-<g id="Node000041" class="node">
-<title>Node41</title>
-<g id="a_Node000041"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="853.12,-597.25 798.88,-597.25 798.88,-578 853.12,-578 853.12,-597.25"/>
-<text text-anchor="middle" x="826" y="-583.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node40&#45;&gt;Node41 -->
-<g id="edge64_Node000040_Node000041" class="edge">
-<title>Node40&#45;&gt;Node41</title>
-<g id="a_edge64_Node000040_Node000041"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M702.43,-651.92C711.56,-647.98 721.02,-643.48 729.5,-638.62 746.86,-628.69 748.08,-621.45 765.5,-611.62 772.56,-607.65 780.41,-603.99 788.03,-600.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="789.15,-604.12 797.14,-597.16 786.55,-597.62 789.15,-604.12"/>
-</a>
-</g>
-</g>
-<!-- Node46&#45;&gt;Node13 -->
-<g id="edge73_Node000046_Node000013" class="edge">
-<title>Node46&#45;&gt;Node13</title>
-<g id="a_edge73_Node000046_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M365.94,-1175.77C376.17,-1177.92 386.91,-1180.16 397.53,-1182.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.54,-1185.76 407.05,-1184.38 397.98,-1178.91 396.54,-1185.76"/>
-</a>
-</g>
-</g>
-<!-- Node47&#45;&gt;Node6 -->
-<g id="edge75_Node000047_Node000006" class="edge">
-<title>Node47&#45;&gt;Node6</title>
-<g id="a_edge75_Node000047_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M719.25,-776.31C734.18,-771.54 750.3,-766.93 765.5,-763.62 824.17,-750.89 893.73,-744.59 935.56,-741.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="935.59,-745.23 945.34,-741.09 935.13,-738.25 935.59,-745.23"/>
-</a>
-</g>
-</g>
-<!-- Node47&#45;&gt;Node8 -->
-<g id="edge76_Node000047_Node000008" class="edge">
-<title>Node47&#45;&gt;Node8</title>
-<g id="a_edge76_Node000047_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M716.06,-818.86C720.78,-821.52 725.34,-824.44 729.5,-827.62 749.85,-843.17 744.95,-857.33 765.5,-872.62 766.81,-873.6 768.17,-874.55 769.56,-875.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="767.46,-878.28 777.87,-880.25 770.95,-872.22 767.46,-878.28"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index c00559568..000000000
--- a/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,127 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,341,55,367"/>
-<area shape="rect" id="Node000002" href="$d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title=" " alt="" coords="103,341,146,367"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,352,87,352,87,357,55,357"/>
-<area shape="rect" id="Node000003" href="$d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec" title=" " alt="" coords="895,100,1068,126"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="132,339,157,307,192,273,306,191,356,162,404,138,454,120,509,104,647,76,701,68,744,66,840,76,924,93,923,98,840,81,743,71,702,73,648,81,511,109,456,125,406,143,358,166,309,195,196,278,161,311,137,343"/>
-<area shape="rect" id="Node000012" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff" title=" " alt="" coords="194,524,363,579"/>
-<area shape="poly" id="edge13_Node000002_Node000012" title=" " alt="" coords="138,365,248,509,244,513,134,369"/>
-<area shape="rect" id="Node000047" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f" title=" " alt="" coords="421,178,590,234"/>
-<area shape="poly" id="edge73_Node000002_Node000047" title=" " alt="" coords="146,344,417,237,419,242,148,348"/>
-<area shape="rect" id="Node000048" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931" title=" " alt="" coords="897,665,1066,721"/>
-<area shape="poly" id="edge75_Node000002_Node000048" title=" " alt="" coords="129,367,132,409,142,467,162,531,177,562,196,590,248,649,296,695,344,730,393,756,445,777,504,795,648,832,703,846,747,854,789,851,839,832,856,818,864,802,872,783,886,763,925,728,928,732,890,767,877,786,869,804,860,822,841,836,790,856,746,859,701,851,647,837,503,800,444,782,390,761,341,734,293,699,244,653,192,593,173,565,157,533,137,469,127,410,123,368"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="1165,153,1243,179"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="1039,124,1150,151,1149,156,1038,129"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/distance.html#" title=" " alt="" coords="1156,5,1252,31"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="1005,97,1058,69,1122,40,1140,33,1142,38,1124,45,1060,74,1008,102"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="1170,55,1238,80"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="1048,97,1154,75,1155,80,1049,102"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="1366,757,1437,783"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="1062,124,1077,135,1093,153,1102,171,1109,207,1112,244,1116,264,1126,286,1165,346,1204,387,1245,428,1287,487,1312,538,1341,609,1392,741,1387,743,1336,610,1307,540,1282,490,1240,432,1201,391,1161,349,1121,289,1111,266,1106,245,1103,207,1097,173,1088,156,1074,139,1059,128"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="1367,469,1436,495"/>
-<area shape="poly" id="edge7_Node000003_Node000008" title=" " alt="" coords="1054,124,1077,135,1093,148,1102,161,1111,175,1125,189,1168,217,1207,232,1245,249,1287,280,1323,323,1353,371,1392,454,1387,456,1348,374,1319,327,1283,284,1242,253,1205,237,1166,222,1122,194,1107,178,1098,164,1089,151,1074,139,1052,129"/>
-<area shape="rect" id="Node000009" href="$d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" title=" " alt="" coords="1130,540,1278,581"/>
-<area shape="poly" id="edge8_Node000003_Node000009" title=" " alt="" coords="1063,124,1077,135,1099,163,1112,191,1117,217,1118,244,1116,302,1118,334,1126,369,1157,454,1188,525,1184,528,1152,456,1121,371,1113,335,1110,302,1112,244,1112,218,1107,192,1095,166,1073,139,1060,128"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max_element.html#" title=" " alt="" coords="1141,104,1267,130"/>
-<area shape="poly" id="edge12_Node000003_Node000011" title=" " alt="" coords="1069,112,1126,113,1126,118,1069,117"/>
-<area shape="poly" id="edge9_Node000009_Node000007" title=" " alt="" coords="1270,580,1286,591,1322,627,1352,668,1391,742,1386,744,1347,671,1318,630,1283,595,1267,584"/>
-<area shape="poly" id="edge10_Node000009_Node000008" title=" " alt="" coords="1256,537,1352,499,1354,504,1258,542"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="1348,548,1455,574"/>
-<area shape="poly" id="edge11_Node000009_Node000010" title=" " alt="" coords="1278,558,1332,558,1332,564,1278,564"/>
-<area shape="rect" id="Node000013" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0" title=" " alt="" coords="411,531,600,572"/>
-<area shape="poly" id="edge14_Node000012_Node000013" title=" " alt="" coords="363,549,396,549,396,554,363,554"/>
-<area shape="rect" id="Node000033" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d" title=" " alt="" coords="659,1120,828,1175"/>
-<area shape="poly" id="edge51_Node000012_Node000033" title=" " alt="" coords="304,578,713,1106,709,1109,300,581"/>
-<area shape="poly" id="edge24_Node000013_Node000003" title=" " alt="" coords="511,530,584,293,624,171,646,115,679,96,714,83,752,76,790,74,863,80,925,93,924,98,862,85,790,79,752,82,716,88,681,100,650,119,629,173,589,295,516,532"/>
-<area shape="poly" id="edge26_Node000013_Node000007" title=" " alt="" coords="509,572,509,642,514,751,528,886,556,1037,576,1114,601,1191,632,1266,669,1338,713,1405,764,1465,823,1518,889,1563,946,1590,1001,1607,1052,1613,1102,1610,1149,1596,1195,1572,1239,1537,1283,1491,1299,1467,1313,1436,1338,1355,1357,1257,1372,1150,1390,942,1397,798,1402,799,1395,942,1377,1150,1363,1258,1343,1356,1318,1438,1303,1470,1287,1494,1243,1541,1198,1576,1151,1601,1102,1615,1052,1619,999,1612,944,1595,887,1567,819,1523,760,1469,709,1408,665,1340,628,1268,596,1193,571,1116,551,1038,523,887,508,751,503,642,503,572"/>
-<area shape="poly" id="edge34_Node000013_Node000008" title=" " alt="" coords="532,529,583,493,647,460,700,443,743,437,786,431,839,416,862,401,872,394,887,388,998,359,1044,350,1088,346,1131,347,1177,354,1228,366,1286,385,1314,399,1341,417,1382,456,1378,460,1337,421,1312,403,1284,390,1226,371,1176,359,1131,353,1088,352,1045,356,999,364,889,393,875,398,865,405,841,421,787,437,744,442,701,448,649,465,586,498,535,533"/>
-<area shape="poly" id="edge35_Node000013_Node000009" title=" " alt="" coords="600,557,648,560,745,568,787,568,839,560,853,555,863,548,873,541,887,536,940,526,981,526,1076,536,1115,540,1114,546,1075,541,981,531,940,532,889,541,875,546,865,552,855,559,841,565,787,574,745,573,647,565,600,562"/>
-<area shape="rect" id="Node000014" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" title=" " alt="" coords="648,129,840,185"/>
-<area shape="poly" id="edge15_Node000013_Node000014" title=" " alt="" coords="507,530,518,467,543,378,561,329,584,281,612,236,646,195,648,193,652,196,650,199,616,239,589,284,566,332,548,380,524,468,512,531"/>
-<area shape="rect" id="Node000015" href="$d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" title=" " alt="" coords="901,215,1062,256"/>
-<area shape="poly" id="edge23_Node000013_Node000015" title=" " alt="" coords="521,529,573,473,608,442,646,416,674,402,699,394,744,388,788,381,812,373,839,359,854,346,863,334,886,306,937,263,941,267,890,309,867,338,857,350,841,363,814,378,790,386,745,393,700,400,676,407,649,420,611,446,577,477,525,533"/>
-<area shape="rect" id="Node000017" href="$d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" title=" " alt="" coords="894,449,1069,475"/>
-<area shape="poly" id="edge42_Node000013_Node000017" title=" " alt="" coords="600,554,655,554,716,549,779,540,839,524,853,517,863,509,887,492,919,478,921,483,889,496,866,513,856,522,841,529,780,545,717,555,656,559,600,560"/>
-<area shape="rect" id="Node000019" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/duration/duration_cast.html#" title=" " alt="" coords="658,796,830,822"/>
-<area shape="poly" id="edge25_Node000013_Node000019" title=" " alt="" coords="517,571,534,614,563,668,601,726,624,752,649,775,670,787,667,792,646,779,620,755,597,729,558,671,530,616,512,573"/>
-<area shape="rect" id="Node000020" href="$d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f" title=" " alt="" coords="1123,1638,1285,1678"/>
-<area shape="poly" id="edge27_Node000013_Node000020" title=" " alt="" coords="511,572,525,785,554,1121,573,1292,596,1444,622,1558,635,1596,650,1618,700,1655,757,1680,818,1696,882,1703,945,1703,1006,1698,1113,1680,1114,1685,1007,1703,945,1708,881,1708,817,1701,755,1685,697,1659,646,1621,631,1598,617,1560,591,1445,568,1293,548,1121,519,785,505,572"/>
-<area shape="rect" id="Node000025" href="$d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43" title=" " alt="" coords="888,600,1075,641"/>
-<area shape="poly" id="edge36_Node000013_Node000025" title=" " alt="" coords="531,570,583,608,615,626,648,640,708,651,768,654,828,650,882,642,883,647,828,655,769,659,707,656,647,645,612,631,580,613,528,574"/>
-<area shape="rect" id="Node000026" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="1170,808,1238,834"/>
-<area shape="poly" id="edge41_Node000013_Node000026" title=" " alt="" coords="530,570,582,615,614,639,649,660,717,691,788,719,931,763,1059,793,1155,811,1155,816,1058,799,929,768,786,724,715,696,646,665,611,644,578,620,526,574"/>
-<area shape="rect" id="Node000027" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/high_resolution_clock/now.html#" title=" " alt="" coords="653,208,834,249"/>
-<area shape="poly" id="edge43_Node000013_Node000027" title=" " alt="" coords="509,530,523,476,549,403,589,326,615,290,646,259,649,256,653,260,649,263,620,294,594,329,554,405,528,478,514,531"/>
-<area shape="rect" id="Node000028" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="681,273,807,299"/>
-<area shape="poly" id="edge44_Node000013_Node000028" title=" " alt="" coords="510,530,527,484,554,423,594,361,618,333,646,308,665,297,668,302,649,312,622,336,598,364,559,426,532,486,515,532"/>
-<area shape="rect" id="Node000029" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="1146,1009,1262,1035"/>
-<area shape="poly" id="edge45_Node000013_Node000029" title=" " alt="" coords="514,572,528,624,554,695,572,733,593,769,619,803,649,832,704,868,756,888,805,896,855,898,906,899,959,904,1015,918,1077,947,1092,959,1102,972,1110,984,1125,996,1133,1000,1130,1005,1122,1000,1107,988,1097,975,1088,963,1074,951,1014,923,958,909,905,904,855,904,805,902,754,893,702,873,646,836,615,806,589,772,567,735,549,697,523,626,508,573"/>
-<area shape="rect" id="Node000030" href="$d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" title=" " alt="" coords="666,323,822,348"/>
-<area shape="poly" id="edge46_Node000013_Node000030" title=" " alt="" coords="515,529,535,494,565,450,602,405,646,365,670,352,672,357,649,370,606,408,569,453,540,497,520,532"/>
-<area shape="rect" id="Node000031" href="$d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a" title=" " alt="" coords="888,551,1075,576"/>
-<area shape="poly" id="edge47_Node000013_Node000031" title=" " alt="" coords="540,570,589,597,648,618,702,630,744,635,787,631,839,618,853,612,863,604,887,587,905,579,907,584,889,591,866,608,856,616,841,623,788,637,744,640,701,635,647,623,587,602,537,575"/>
-<area shape="rect" id="Node000032" href="$d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e" title=" " alt="" coords="659,474,828,514"/>
-<area shape="poly" id="edge50_Node000013_Node000032" title=" " alt="" coords="592,528,643,516,645,521,594,533"/>
-<area shape="poly" id="edge16_Node000014_Node000015" title=" " alt="" coords="831,183,904,207,903,212,829,188"/>
-<area shape="rect" id="Node000016" 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="894,149,1069,175"/>
-<area shape="poly" id="edge17_Node000014_Node000016" title=" " alt="" coords="841,156,878,157,878,163,840,162"/>
-<area shape="poly" id="edge18_Node000014_Node000017" title=" " alt="" coords="826,183,842,195,866,231,902,298,970,434,965,436,897,300,862,234,838,199,823,187"/>
-<area shape="poly" id="edge19_Node000017_Node000007" title=" " alt="" coords="1061,473,1198,500,1255,514,1286,527,1301,542,1316,565,1346,624,1393,742,1388,744,1341,626,1311,568,1297,546,1283,531,1253,519,1197,505,1060,478"/>
-<area shape="poly" id="edge20_Node000017_Node000008" title=" " alt="" coords="1070,464,1352,477,1352,483,1070,469"/>
-<area shape="poly" id="edge21_Node000017_Node000009" title=" " alt="" coords="1028,473,1076,492,1125,520,1146,531,1143,536,1122,525,1074,497,1026,478"/>
-<area shape="rect" id="Node000018" 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="1127,605,1281,631"/>
-<area shape="poly" id="edge22_Node000017_Node000018" title=" " alt="" coords="1003,474,1077,536,1100,566,1110,578,1125,591,1135,596,1132,601,1122,595,1106,582,1096,569,1073,540,999,478"/>
-<area shape="poly" id="edge28_Node000020_Node000007" title=" " alt="" coords="1264,1635,1283,1618,1300,1588,1315,1550,1341,1452,1361,1335,1375,1208,1392,964,1397,799,1402,799,1397,964,1381,1208,1366,1335,1346,1453,1320,1552,1304,1591,1287,1621,1267,1639"/>
-<area shape="poly" id="edge29_Node000020_Node000008" title=" " alt="" coords="1206,1637,1238,1400,1282,1047,1287,934,1290,786,1294,711,1301,642,1313,581,1330,534,1344,516,1360,502,1363,506,1347,520,1335,537,1318,582,1307,642,1300,712,1296,787,1293,934,1287,1048,1244,1401,1211,1638"/>
-<area shape="rect" id="Node000021" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/system_clock/now.html#" title=" " alt="" coords="1333,1666,1470,1706"/>
-<area shape="poly" id="edge30_Node000020_Node000021" title=" " alt="" coords="1285,1667,1318,1672,1317,1677,1285,1672"/>
-<area shape="rect" id="Node000022" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="1365,1731,1438,1756"/>
-<area shape="poly" id="edge31_Node000020_Node000022" title=" " alt="" coords="1249,1677,1334,1716,1352,1723,1350,1728,1332,1721,1246,1681"/>
-<area shape="rect" id="Node000023" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="1362,1567,1441,1592"/>
-<area shape="poly" id="edge32_Node000020_Node000023" title=" " alt="" coords="1251,1635,1332,1601,1346,1596,1348,1601,1334,1606,1253,1640"/>
-<area shape="rect" id="Node000024" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="1362,1616,1440,1642"/>
-<area shape="poly" id="edge33_Node000020_Node000024" title=" " alt="" coords="1285,1644,1347,1634,1347,1639,1285,1649"/>
-<area shape="poly" id="edge37_Node000025_Node000007" title=" " alt="" coords="1045,639,1076,650,1352,750,1350,755,1074,655,1043,644"/>
-<area shape="poly" id="edge38_Node000025_Node000008" title=" " alt="" coords="1076,637,1136,646,1196,652,1248,651,1268,648,1283,641,1296,631,1304,619,1311,594,1315,565,1331,534,1364,502,1368,506,1335,537,1320,567,1316,595,1309,621,1300,634,1286,646,1270,653,1249,657,1196,657,1135,652,1075,642"/>
-<area shape="poly" id="edge39_Node000025_Node000009" title=" " alt="" coords="1059,597,1114,582,1116,587,1061,602"/>
-<area shape="poly" id="edge40_Node000025_Node000018" title=" " alt="" coords="1075,617,1111,617,1111,622,1076,622"/>
-<area shape="poly" id="edge48_Node000031_Node000009" title=" " alt="" coords="1075,560,1114,559,1114,565,1076,565"/>
-<area shape="poly" id="edge49_Node000031_Node000018" title=" " alt="" coords="1037,574,1135,599,1134,604,1036,579"/>
-<area shape="poly" id="edge55_Node000033_Node000007" title=" " alt="" coords="748,1175,755,1249,764,1296,776,1346,794,1396,818,1445,850,1487,890,1523,937,1549,959,1555,981,1557,1003,1555,1025,1548,1074,1523,1121,1487,1163,1447,1200,1402,1234,1353,1263,1302,1289,1249,1330,1140,1359,1033,1379,936,1396,798,1401,799,1384,937,1364,1035,1335,1141,1294,1251,1268,1305,1238,1356,1205,1405,1167,1451,1124,1492,1077,1527,1027,1553,1004,1560,981,1562,959,1560,935,1554,886,1527,846,1491,814,1447,789,1399,771,1348,758,1297,750,1250,743,1176"/>
-<area shape="poly" id="edge57_Node000033_Node000008" title=" " alt="" coords="753,1119,794,996,817,916,837,834,842,794,843,744,843,625,846,565,852,511,865,466,874,449,886,435,913,415,942,399,973,388,1006,381,1073,377,1141,384,1207,400,1268,419,1362,460,1360,465,1266,424,1205,405,1140,390,1073,382,1006,386,975,393,945,404,916,419,890,439,879,452,870,468,858,512,851,566,849,625,849,744,847,795,843,835,823,917,799,997,758,1120"/>
-<area shape="poly" id="edge71_Node000033_Node000018" title=" " alt="" coords="763,1118,801,1061,838,992,851,947,855,909,863,873,871,853,886,832,908,809,930,793,974,774,1021,759,1046,747,1074,731,1131,684,1178,640,1181,644,1135,688,1077,735,1049,752,1023,764,976,779,933,797,912,813,890,836,876,856,868,874,860,910,856,948,842,994,805,1063,768,1121"/>
-<area shape="rect" id="Node000034" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="922,961,1041,987"/>
-<area shape="poly" id="edge52_Node000033_Node000034" title=" " alt="" coords="762,1118,814,1056,848,1023,887,996,906,987,909,991,889,1000,852,1027,818,1060,767,1121"/>
-<area shape="rect" id="Node000035" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/c_str.html#" title=" " alt="" coords="924,1011,1040,1036"/>
-<area shape="poly" id="edge53_Node000033_Node000035" title=" " alt="" coords="777,1117,827,1080,887,1045,908,1037,910,1042,889,1050,830,1084,780,1121"/>
-<area shape="rect" id="Node000036" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ifstream/close.html#" title=" " alt="" coords="915,1060,1048,1086"/>
-<area shape="poly" id="edge54_Node000033_Node000036" title=" " alt="" coords="821,1117,887,1094,910,1088,911,1093,889,1099,822,1122"/>
-<area shape="rect" id="Node000037" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ios/eof.html#" title=" " alt="" coords="922,1109,1042,1135"/>
-<area shape="poly" id="edge56_Node000033_Node000037" title=" " alt="" coords="828,1136,906,1128,906,1133,829,1141"/>
-<area shape="rect" id="Node000038" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/getline.html#" title=" " alt="" coords="939,1159,1024,1184"/>
-<area shape="poly" id="edge58_Node000033_Node000038" title=" " alt="" coords="829,1153,924,1163,923,1168,828,1159"/>
-<area shape="rect" id="Node000039" href="$d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd" title=" " alt="" coords="900,1208,1063,1249"/>
-<area shape="poly" id="edge59_Node000033_Node000039" title=" " alt="" coords="828,1173,906,1200,905,1205,827,1178"/>
-<area shape="rect" id="Node000040" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ifstream/is_open.html#" title=" " alt="" coords="908,1273,1055,1299"/>
-<area shape="poly" id="edge60_Node000033_Node000040" title=" " alt="" coords="775,1174,826,1217,889,1258,905,1265,902,1270,887,1263,823,1222,772,1178"/>
-<area shape="rect" id="Node000041" href="$d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26" title=" " alt="" coords="894,846,1070,886"/>
-<area shape="poly" id="edge61_Node000033_Node000041" title=" " alt="" coords="761,1118,814,1039,886,947,941,895,945,898,890,951,818,1042,765,1121"/>
-<area shape="rect" id="Node000043" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ifstream/open.html#" title=" " alt="" coords="916,1323,1047,1348"/>
-<area shape="poly" id="edge68_Node000033_Node000043" title=" " alt="" coords="764,1174,815,1243,850,1279,889,1309,903,1316,901,1321,887,1314,846,1283,811,1246,760,1178"/>
-<area shape="rect" id="Node000044" href="$d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d" title=" " alt="" coords="888,1372,1075,1398"/>
-<area shape="poly" id="edge69_Node000033_Node000044" title=" " alt="" coords="759,1175,778,1216,806,1266,844,1316,890,1359,895,1362,892,1367,886,1363,840,1320,802,1269,773,1219,754,1177"/>
-<area shape="rect" id="Node000045" href="$d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093" title=" " alt="" coords="906,1422,1057,1462"/>
-<area shape="poly" id="edge70_Node000033_Node000045" title=" " alt="" coords="755,1175,773,1225,800,1287,839,1352,863,1382,890,1408,894,1412,891,1416,886,1412,859,1385,835,1355,796,1290,768,1227,750,1176"/>
-<area shape="rect" id="Node000046" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/stof.html#" title=" " alt="" coords="946,1487,1018,1512"/>
-<area shape="poly" id="edge72_Node000033_Node000046" title=" " alt="" coords="752,1175,765,1237,790,1318,808,1360,831,1401,858,1439,890,1472,909,1484,931,1492,929,1497,907,1489,886,1476,854,1442,826,1404,803,1362,785,1319,760,1239,747,1176"/>
-<area shape="poly" id="edge62_Node000041_Node000007" title=" " alt="" coords="1045,885,1098,897,1159,905,1223,904,1254,898,1284,888,1315,869,1342,845,1382,795,1386,798,1346,849,1318,874,1286,893,1255,903,1223,909,1159,911,1097,903,1043,890"/>
-<area shape="poly" id="edge63_Node000041_Node000008" title=" " alt="" coords="1070,869,1132,871,1195,868,1249,860,1269,853,1283,844,1311,809,1323,774,1324,738,1318,701,1311,662,1307,622,1312,579,1330,534,1344,517,1361,502,1364,506,1348,520,1335,537,1317,580,1313,622,1316,662,1324,700,1329,738,1328,775,1316,812,1286,848,1271,858,1250,865,1196,873,1132,876,1070,875"/>
-<area shape="poly" id="edge64_Node000041_Node000009" title=" " alt="" coords="998,844,1035,794,1073,732,1086,692,1091,658,1098,626,1107,609,1121,591,1123,589,1127,593,1125,595,1112,612,1103,628,1096,659,1092,694,1078,734,1039,797,1002,847"/>
-<area shape="poly" id="edge66_Node000041_Node000026" title=" " alt="" coords="1070,846,1154,828,1155,833,1071,851"/>
-<area shape="poly" id="edge67_Node000041_Node000029" title=" " alt="" coords="1051,885,1077,903,1095,927,1101,951,1108,974,1125,996,1134,1002,1131,1007,1121,1000,1103,977,1096,953,1090,930,1073,907,1048,889"/>
-<area shape="rect" id="Node000042" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="1168,960,1240,986"/>
-<area shape="poly" id="edge65_Node000041_Node000042" title=" " alt="" coords="1040,885,1077,903,1101,921,1125,939,1155,953,1152,958,1122,943,1098,925,1074,907,1038,890"/>
-<area shape="poly" id="edge74_Node000047_Node000014" title=" " alt="" coords="590,186,632,177,633,182,591,191"/>
-<area shape="poly" id="edge76_Node000048_Node000007" title=" " alt="" coords="1062,719,1124,736,1245,755,1350,765,1350,770,1245,760,1123,741,1061,724"/>
-<area shape="poly" id="edge77_Node000048_Node000009" title=" " alt="" coords="1056,662,1074,651,1088,636,1097,621,1106,606,1122,591,1127,587,1130,591,1125,595,1110,610,1102,624,1093,639,1077,655,1059,667"/>
-</map>
diff --git a/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index d74f16b70..000000000
--- a/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cf9a0e6a88cfedf23e60357c2dd7e9d8
\ No newline at end of file
diff --git a/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 7385d4323..000000000
--- a/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,1241 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 1321 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 1107;
-var viewHeight = 1321;
-var sectionId = 'dynsection-5';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-1061.25 0,-1061.25 0,-1042 37,-1042 37,-1061.25"/>
-<text text-anchor="middle" x="18.5" y="-1047.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-1061.25 73,-1061.25 73,-1042 105.5,-1042 105.5,-1061.25"/>
-<text text-anchor="middle" x="89.25" y="-1047.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-1051.62C44.58,-1051.62 53.31,-1051.62 61.45,-1051.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-1055.13 71.2,-1051.63 61.2,-1048.13 61.2,-1055.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="797.25,-1242.25 667.25,-1242.25 667.25,-1223 797.25,-1223 797.25,-1242.25"/>
-<text text-anchor="middle" x="732.25" y="-1228.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::argmax</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.92,-1061.45C105.88,-1074.09 122.86,-1096.13 141.5,-1110.62 271.69,-1211.84 319.45,-1229.39 481.75,-1258.62 544.85,-1269.99 562.36,-1266.37 626,-1258.62 646.83,-1256.09 669.48,-1250.83 688.41,-1245.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="689.24,-1249.11 697.92,-1243.04 687.35,-1242.37 689.24,-1249.11"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="268.5,-924.5 141.5,-924.5 141.5,-882.75 268.5,-882.75 268.5,-924.5"/>
-<text text-anchor="start" x="149.5" y="-911" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="149.5" y="-899.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="205" y="-888.5" font-family="Helvetica,sans-Serif" font-size="10.00">::fit_from_csv</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge13_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge13_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.71,-1041.91C114.29,-1020.34 154.77,-967.67 180.72,-933.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.38,-936.2 186.7,-926.14 177.83,-931.93 183.38,-936.2"/>
-</a>
-</g>
-</g>
-<!-- Node47 -->
-<g id="Node000047" class="node">
-<title>Node47</title>
-<g id="a_Node000047"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="438.62,-1183.5 311.62,-1183.5 311.62,-1141.75 438.62,-1141.75 438.62,-1183.5"/>
-<text text-anchor="start" x="319.62" y="-1170" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="319.62" y="-1158.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="375.12" y="-1147.5" font-family="Helvetica,sans-Serif" font-size="10.00">::single_predict</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node47 -->
-<g id="edge73_Node000002_Node000047" class="edge">
-<title>Node2&#45;&gt;Node47</title>
-<g id="a_edge73_Node000002_Node000047"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.92,-1057.75C143.93,-1072.61 242.79,-1111.27 309.27,-1137.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.65,-1140.39 318.24,-1140.77 310.2,-1133.87 307.65,-1140.39"/>
-</a>
-</g>
-</g>
-<!-- Node48 -->
-<g id="Node000048" class="node">
-<title>Node48</title>
-<g id="a_Node000048"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="795.75,-818.5 668.75,-818.5 668.75,-776.75 795.75,-776.75 795.75,-818.5"/>
-<text text-anchor="start" x="676.75" y="-805" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="676.75" y="-793.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="732.25" y="-782.5" font-family="Helvetica,sans-Serif" font-size="10.00">::summary</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node48 -->
-<g id="edge75_Node000002_Node000048" class="edge">
-<title>Node2&#45;&gt;Node48</title>
-<g id="a_edge75_Node000002_Node000048"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.51,-1041.54C91.75,-1012.27 99.04,-926.14 141.5,-873.62 249.33,-740.27 315.4,-733.32 481.75,-691.62 543.94,-676.04 569.21,-661.87 626,-691.62 650.9,-704.67 642.7,-723.19 662,-743.62 670.66,-752.79 680.95,-761.67 690.91,-769.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="688.64,-772.15 698.71,-775.43 692.88,-766.59 688.64,-772.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="928.38,-1202.25 869.62,-1202.25 869.62,-1183 928.38,-1183 928.38,-1202.25"/>
-<text text-anchor="middle" x="899" y="-1188.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M774.82,-1222.53C800.37,-1216.33 832.91,-1208.43 858.13,-1202.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="858.79,-1205.75 867.68,-1199.99 857.14,-1198.94 858.79,-1205.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="935.12,-1313.25 862.88,-1313.25 862.88,-1294 935.12,-1294 935.12,-1313.25"/>
-<text text-anchor="middle" x="899" y="-1299.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M750.7,-1242.59C771.23,-1254.03 806.58,-1272.87 838.5,-1285.62 842.78,-1287.34 847.3,-1288.98 851.84,-1290.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="850.38,-1293.73 860.98,-1293.49 852.54,-1287.07 850.38,-1293.73"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="924.62,-1276.25 873.38,-1276.25 873.38,-1257 924.62,-1257 924.62,-1276.25"/>
-<text text-anchor="middle" x="899" y="-1262.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M782.23,-1242.73C807.88,-1248.03 838.71,-1254.39 862.11,-1259.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="861.29,-1262.62 871.79,-1261.22 862.7,-1255.77 861.29,-1262.62"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1073.75,-749.25 1020.25,-749.25 1020.25,-730 1073.75,-730 1073.75,-749.25"/>
-<text text-anchor="middle" x="1047" y="-735.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M791.25,-1222.58C795.34,-1220.41 799.16,-1217.79 802.5,-1214.62 840.77,-1178.38 813.6,-1148.08 838.5,-1101.62 879.12,-1025.83 915.85,-1024.73 959.5,-950.62 979.6,-916.49 1021.13,-806.79 1038.31,-760.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1041.59,-761.75 1041.77,-751.15 1035.02,-759.32 1041.59,-761.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1072.62,-965.25 1021.38,-965.25 1021.38,-946 1072.62,-946 1072.62,-965.25"/>
-<text text-anchor="middle" x="1047" y="-951.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M785.7,-1222.61C791.58,-1220.45 797.32,-1217.82 802.5,-1214.62 823.14,-1201.9 819.66,-1188.89 838.5,-1173.62 886.42,-1134.78 915.64,-1149 959.5,-1105.62 998.54,-1067.01 1025.91,-1007.13 1038.38,-976"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1041.53,-977.57 1041.88,-966.98 1035,-975.04 1041.53,-977.57"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="954.62,-911.88 843.38,-911.88 843.38,-881.38 954.62,-881.38 954.62,-911.88"/>
-<text text-anchor="start" x="851.38" y="-898.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="899" y="-887.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M792.28,-1222.59C796.04,-1220.4 799.51,-1217.78 802.5,-1214.62 857.19,-1157.05 815.14,-1115.52 838.5,-1039.62 851.49,-997.42 872.29,-950.53 885.55,-922.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="888.61,-924.03 889.74,-913.5 882.28,-921.03 888.61,-924.03"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="946,-1239.25 852,-1239.25 852,-1220 946,-1220 946,-1239.25"/>
-<text text-anchor="middle" x="899" y="-1225.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node11 -->
-<g id="edge12_Node000003_Node000011" class="edge">
-<title>Node3&#45;&gt;Node11</title>
-<g id="a_edge12_Node000003_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M797.42,-1231.46C811.54,-1231.2 826.4,-1230.93 840.25,-1230.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="840.15,-1234.18 850.09,-1230.5 840.03,-1227.18 840.15,-1234.18"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge9_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge9_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M947.05,-880.92C951.48,-878.49 955.72,-875.74 959.5,-872.62 997.63,-841.24 1024.78,-788.57 1037.63,-759.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1040.76,-761.4 1041.51,-750.83 1034.34,-758.62 1040.76,-761.4"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node8 -->
-<g id="edge10_Node000009_Node000008" class="edge">
-<title>Node9&#45;&gt;Node8</title>
-<g id="a_edge10_Node000009_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M938.74,-912.28C961.15,-921.33 989.12,-932.64 1010.88,-941.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1009.33,-944.58 1019.91,-945.08 1011.95,-938.09 1009.33,-944.58"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1087.25,-906.25 1006.75,-906.25 1006.75,-887 1087.25,-887 1087.25,-906.25"/>
-<text text-anchor="middle" x="1047" y="-892.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge11_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge11_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M954.78,-896.62C968.05,-896.62 982.17,-896.62 995.25,-896.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="994.9,-900.13 1004.9,-896.63 994.9,-893.13 994.9,-900.13"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="445.75,-918.88 304.5,-918.88 304.5,-888.38 445.75,-888.38 445.75,-918.88"/>
-<text text-anchor="start" x="312.5" y="-905.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="middle" x="375.12" y="-894.12" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork::fit</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge14_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge14_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M268.6,-903.62C276.47,-903.62 284.61,-903.62 292.71,-903.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="292.6,-907.13 302.6,-903.63 292.6,-900.13 292.6,-907.13"/>
-</a>
-</g>
-</g>
-<!-- Node33 -->
-<g id="Node000033" class="node">
-<title>Node33</title>
-<g id="a_Node000033"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="617.38,-477.5 490.38,-477.5 490.38,-435.75 617.38,-435.75 617.38,-477.5"/>
-<text text-anchor="start" x="498.38" y="-464" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="498.38" y="-452.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="553.88" y="-441.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_XY_from_csv</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node33 -->
-<g id="edge51_Node000012_Node000033" class="edge">
-<title>Node12&#45;&gt;Node33</title>
-<g id="a_edge51_Node000012_Node000033"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M222.5,-882.37C278.83,-809.78 463.7,-571.54 529.42,-486.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="532.19,-489 535.55,-478.95 526.66,-484.7 532.19,-489"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node3 -->
-<g id="edge24_Node000013_Node000003" class="edge">
-<title>Node13&#45;&gt;Node3</title>
-<g id="a_edge24_Node000013_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.87,-919.09C400.55,-983.17 475.1,-1224.73 481.75,-1229.62 542.48,-1274.35 636.02,-1259.62 689.64,-1245.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="690.27,-1249.09 698.99,-1243.07 688.42,-1242.33 690.27,-1249.09"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node7 -->
-<g id="edge26_Node000013_Node000007" class="edge">
-<title>Node13&#45;&gt;Node7</title>
-<g id="a_edge26_Node000013_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M375.61,-888.08C373.47,-794.1 376.2,-300.44 662,-143.62 779.81,-78.98 873.04,-94.75 959.5,-197.62 1027.72,-278.8 1042.7,-628.47 1045.45,-718.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1041.95,-718.36 1045.73,-728.26 1048.94,-718.17 1041.95,-718.36"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node8 -->
-<g id="edge34_Node000013_Node000008" class="edge">
-<title>Node13&#45;&gt;Node8</title>
-<g id="a_edge34_Node000013_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M396.02,-919.18C416.44,-934.42 449.68,-957.25 481.75,-970.62 542.45,-995.94 564.84,-979.45 626,-1003.62 643.23,-1010.44 644.15,-1019.69 662,-1024.62 789.45,-1059.86 835.01,-1071.18 959.5,-1026.62 988.63,-1016.2 1014.99,-991.27 1030.75,-973.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1033.04,-976.62 1036.99,-966.79 1027.77,-972.01 1033.04,-976.62"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node9 -->
-<g id="edge35_Node000013_Node000009" class="edge">
-<title>Node13&#45;&gt;Node9</title>
-<g id="a_edge35_Node000013_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M445.97,-897.59C457.9,-896.77 470.17,-896.06 481.75,-895.62 545.82,-893.2 563.6,-880.9 626,-895.62 643.41,-899.73 644.59,-909.52 662,-913.62 722.77,-927.97 740.3,-919.12 802.5,-913.62 811.96,-912.79 821.9,-911.5 831.63,-909.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="832.13,-913.45 841.43,-908.38 831,-906.54 832.13,-913.45"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="626,-1220.5 481.75,-1220.5 481.75,-1178.75 626,-1178.75 626,-1220.5"/>
-<text text-anchor="start" x="489.75" y="-1207" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="489.75" y="-1195.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="553.88" y="-1184.5" font-family="Helvetica,sans-Serif" font-size="10.00">::__detailed_single_prediction</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge15_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge15_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M378.06,-919.08C384.44,-963.84 408.75,-1095.07 481.75,-1169.62 482.35,-1170.24 482.96,-1170.83 483.59,-1171.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.18,-1173.98 491.19,-1177.47 485.54,-1168.51 481.18,-1173.98"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="792.75,-1155.88 671.75,-1155.88 671.75,-1125.38 792.75,-1125.38 792.75,-1155.88"/>
-<text text-anchor="start" x="679.75" y="-1142.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::apply</text>
-<text text-anchor="middle" x="732.25" y="-1131.12" font-family="Helvetica,sans-Serif" font-size="10.00">_function</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node15 -->
-<g id="edge23_Node000013_Node000015" class="edge">
-<title>Node13&#45;&gt;Node15</title>
-<g id="a_edge23_Node000013_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M388.42,-919.19C406.56,-941.13 442.61,-981.01 481.75,-1003.62 539.68,-1037.09 569.46,-1010.87 626,-1046.62 646.22,-1059.41 644.5,-1070.32 662,-1086.62 673.91,-1097.72 687.93,-1108.96 700.23,-1118.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="697.92,-1120.93 708.03,-1124.11 702.11,-1115.32 697.92,-1120.93"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="798,-980.25 666.5,-980.25 666.5,-961 798,-961 798,-980.25"/>
-<text text-anchor="middle" x="732.25" y="-966.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node17 -->
-<g id="edge42_Node000013_Node000017" class="edge">
-<title>Node13&#45;&gt;Node17</title>
-<g id="a_edge42_Node000013_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M446.17,-899.59C497.35,-898.86 567.7,-902.53 626,-922.62 644.18,-928.89 644.78,-938.07 662,-946.62 669.61,-950.4 677.96,-953.84 686.14,-956.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="684.71,-960.07 695.3,-960.08 687.03,-953.46 684.71,-960.07"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="618.5,-720.25 489.25,-720.25 489.25,-701 618.5,-701 618.5,-720.25"/>
-<text text-anchor="middle" x="553.88" y="-706.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::duration_cast</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node19 -->
-<g id="edge25_Node000013_Node000019" class="edge">
-<title>Node13&#45;&gt;Node19</title>
-<g id="a_edge25_Node000013_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.66,-888.07C394.21,-854.97 428,-777.1 481.75,-734.62 486.48,-730.89 491.82,-727.72 497.4,-725.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="498.38,-728.42 506.22,-721.29 495.65,-721.97 498.38,-728.42"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="959.5,-88.88 838.5,-88.88 838.5,-58.38 959.5,-58.38 959.5,-88.88"/>
-<text text-anchor="start" x="846.5" y="-75.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::equal</text>
-<text text-anchor="middle" x="899" y="-64.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node20 -->
-<g id="edge27_Node000013_Node000020" class="edge">
-<title>Node13&#45;&gt;Node20</title>
-<g id="a_edge27_Node000013_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M377.01,-888.14C383.22,-781.53 421.97,-158.83 481.75,-102.62 575.48,-14.5 739.48,-34.69 831.15,-55.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="830.23,-58.7 840.76,-57.55 831.81,-51.88 830.23,-58.7"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a xlink:href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="802.5,-866.88 662,-866.88 662,-836.38 802.5,-836.38 802.5,-866.88"/>
-<text text-anchor="start" x="670" y="-853.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::hadamard</text>
-<text text-anchor="middle" x="732.25" y="-842.12" font-family="Helvetica,sans-Serif" font-size="10.00">_product</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node25 -->
-<g id="edge36_Node000013_Node000025" class="edge">
-<title>Node13&#45;&gt;Node25</title>
-<g id="a_edge36_Node000013_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M393.23,-888.11C412.92,-871.4 447.02,-845.84 481.75,-835.62 539.24,-818.72 607.29,-824.7 657.78,-833.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="656.96,-837.21 667.44,-835.63 658.26,-830.33 656.96,-837.21"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="924.62,-711.25 873.38,-711.25 873.38,-692 924.62,-692 924.62,-711.25"/>
-<text text-anchor="middle" x="899" y="-697.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node26 -->
-<g id="edge41_Node000013_Node000026" class="edge">
-<title>Node13&#45;&gt;Node26</title>
-<g id="a_edge41_Node000013_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M391.95,-887.97C411.49,-869.43 446.51,-838.79 481.75,-820.62 613.02,-752.95 788,-719.06 862.26,-706.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="862.47,-710.47 871.79,-705.44 861.37,-703.55 862.47,-710.47"/>
-</a>
-</g>
-</g>
-<!-- Node27 -->
-<g id="Node000027" class="node">
-<title>Node27</title>
-<g id="a_Node000027"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="621.88,-1160.88 485.88,-1160.88 485.88,-1130.38 621.88,-1130.38 621.88,-1160.88"/>
-<text text-anchor="start" x="493.88" y="-1147.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::high_resolution</text>
-<text text-anchor="middle" x="553.88" y="-1136.12" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node27 -->
-<g id="edge43_Node000013_Node000027" class="edge">
-<title>Node13&#45;&gt;Node27</title>
-<g id="a_edge43_Node000013_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M379.33,-919.35C388.25,-959.12 417.08,-1064.61 481.75,-1121.62 482.54,-1122.32 483.35,-1123 484.18,-1123.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="482.19,-1126.53 492.46,-1129.15 486.06,-1120.7 482.19,-1126.53"/>
-</a>
-</g>
-</g>
-<!-- Node28 -->
-<g id="Node000028" class="node">
-<title>Node28</title>
-<g id="a_Node000028"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="601.25,-1112.25 506.5,-1112.25 506.5,-1093 601.25,-1093 601.25,-1112.25"/>
-<text text-anchor="middle" x="553.88" y="-1098.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node28 -->
-<g id="edge44_Node000013_Node000028" class="edge">
-<title>Node13&#45;&gt;Node28</title>
-<g id="a_edge44_Node000013_Node000028"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.65,-919.27C391.69,-954.58 423.47,-1040.76 481.75,-1084.62 485.98,-1087.81 490.71,-1090.43 495.67,-1092.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="494.06,-1095.73 504.66,-1095.9 496.48,-1089.16 494.06,-1095.73"/>
-</a>
-</g>
-</g>
-<!-- Node29 -->
-<g id="Node000029" class="node">
-<title>Node29</title>
-<g id="a_Node000029"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="942.25,-560.25 855.75,-560.25 855.75,-541 942.25,-541 942.25,-560.25"/>
-<text text-anchor="middle" x="899" y="-546.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node29 -->
-<g id="edge45_Node000013_Node000029" class="edge">
-<title>Node13&#45;&gt;Node29</title>
-<g id="a_edge45_Node000013_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M379.26,-888.09C388.01,-848.83 416.48,-744.97 481.75,-691.62 596.02,-598.22 675.2,-680.3 802.5,-605.62 822.29,-594.02 818.9,-580.55 838.5,-568.62 840.52,-567.4 842.62,-566.25 844.79,-565.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="846.06,-568.44 853.86,-561.27 843.29,-562.01 846.06,-568.44"/>
-</a>
-</g>
-</g>
-<!-- Node30 -->
-<g id="Node000030" class="node">
-<title>Node30</title>
-<g id="a_Node000030"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="612.12,-1075.25 495.62,-1075.25 495.62,-1056 612.12,-1056 612.12,-1075.25"/>
-<text text-anchor="middle" x="553.88" y="-1061.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node30 -->
-<g id="edge46_Node000013_Node000030" class="edge">
-<title>Node13&#45;&gt;Node30</title>
-<g id="a_edge46_Node000013_Node000030"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M384.03,-919.31C399.16,-947.77 434.9,-1008.07 481.75,-1041.62 487.04,-1045.42 492.98,-1048.64 499.11,-1051.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="497.53,-1054.52 508.12,-1054.97 500.13,-1048.02 497.53,-1054.52"/>
-</a>
-</g>
-</g>
-<!-- Node31 -->
-<g id="Node000031" class="node">
-<title>Node31</title>
-<g id="a_Node000031"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="802.5,-904.25 662,-904.25 662,-885 802.5,-885 802.5,-904.25"/>
-<text text-anchor="middle" x="732.25" y="-890.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::transpose</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node31 -->
-<g id="edge47_Node000013_Node000031" class="edge">
-<title>Node13&#45;&gt;Node31</title>
-<g id="a_edge47_Node000013_Node000031"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M399.69,-888.09C420.34,-875.46 451.69,-858.62 481.75,-851.62 544.19,-837.09 564.64,-833.05 626,-851.62 644.4,-857.2 644.5,-867.65 662,-875.62 666.27,-877.57 670.79,-879.36 675.39,-880.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="674.14,-884.27 684.74,-884.05 676.32,-877.61 674.14,-884.27"/>
-</a>
-</g>
-</g>
-<!-- Node32 -->
-<g id="Node000032" class="node">
-<title>Node32</title>
-<g id="a_Node000032"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="617.38,-961.88 490.38,-961.88 490.38,-931.38 617.38,-931.38 617.38,-961.88"/>
-<text text-anchor="start" x="498.38" y="-948.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::zeroes</text>
-<text text-anchor="middle" x="553.88" y="-937.12" font-family="Helvetica,sans-Serif" font-size="10.00">_initialization</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node32 -->
-<g id="edge50_Node000013_Node000032" class="edge">
-<title>Node13&#45;&gt;Node32</title>
-<g id="a_edge50_Node000013_Node000032"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M440.69,-919.33C453.12,-922.36 466.23,-925.55 478.93,-928.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="477.95,-932 488.49,-930.96 479.6,-925.2 477.95,-932"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge16_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge16_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M618.55,-1178.32C636.53,-1172.31 655.98,-1165.8 673.58,-1159.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="674.47,-1163.31 682.84,-1156.82 672.25,-1156.67 674.47,-1163.31"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="798,-1205.25 666.5,-1205.25 666.5,-1186 798,-1186 798,-1205.25"/>
-<text text-anchor="middle" x="732.25" y="-1191.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node16 -->
-<g id="edge17_Node000014_Node000016" class="edge">
-<title>Node14&#45;&gt;Node16</title>
-<g id="a_edge17_Node000014_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M626.36,-1198C635.73,-1197.79 645.36,-1197.57 654.8,-1197.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="654.77,-1200.86 664.69,-1197.13 654.62,-1193.86 654.77,-1200.86"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node17 -->
-<g id="edge18_Node000014_Node000017" class="edge">
-<title>Node14&#45;&gt;Node17</title>
-<g id="a_edge18_Node000014_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M614.29,-1178.46C618.48,-1175.82 622.44,-1172.88 626,-1169.62 640.64,-1156.21 698.36,-1038.7 721.54,-990.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="724.55,-992.61 725.75,-982.09 718.25,-989.57 724.55,-992.61"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node7 -->
-<g id="edge19_Node000017_Node000007" class="edge">
-<title>Node17&#45;&gt;Node7</title>
-<g id="a_edge19_Node000017_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M791.22,-960.54C853.8,-949.22 946.33,-931.09 959.5,-920.62 986.49,-899.19 1023.45,-802.7 1038.83,-760.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1042.08,-761.33 1042.14,-750.74 1035.49,-758.98 1042.08,-761.33"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node8 -->
-<g id="edge20_Node000017_Node000008" class="edge">
-<title>Node17&#45;&gt;Node8</title>
-<g id="a_edge20_Node000017_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M798.43,-967.5C862.54,-964.42 958.08,-959.84 1009.72,-957.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1009.62,-960.87 1019.44,-956.9 1009.29,-953.88 1009.62,-960.87"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node9 -->
-<g id="edge21_Node000017_Node000009" class="edge">
-<title>Node17&#45;&gt;Node9</title>
-<g id="a_edge21_Node000017_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M766.53,-960.55C778.1,-956.67 791.05,-951.89 802.5,-946.62 819.33,-938.89 822.16,-934.36 838.5,-925.62 843.63,-922.89 849.05,-920.1 854.45,-917.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="855.97,-920.54 863.38,-912.97 852.86,-914.27 855.97,-920.54"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="956.88,-863.25 841.12,-863.25 841.12,-844 956.88,-844 956.88,-863.25"/>
-<text text-anchor="middle" x="899" y="-849.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge22_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge22_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M746.81,-960.51C761.18,-949.56 784.27,-931.28 802.5,-913.62 819.92,-896.75 818.21,-885.91 838.5,-872.62 840.88,-871.07 843.4,-869.63 846,-868.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="847.24,-871.58 854.96,-864.33 844.4,-865.18 847.24,-871.58"/>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node7 -->
-<g id="edge28_Node000020_Node000007" class="edge">
-<title>Node20&#45;&gt;Node7</title>
-<g id="a_edge28_Node000020_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M945.01,-89.33C950.58,-92.94 955.66,-97.32 959.5,-102.62 1033.05,-204.32 1044.13,-618.97 1045.74,-718.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1042.24,-718.15 1045.88,-728.1 1049.23,-718.05 1042.24,-718.15"/>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node8 -->
-<g id="edge29_Node000020_Node000008" class="edge">
-<title>Node20&#45;&gt;Node8</title>
-<g id="a_edge29_Node000020_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M902.2,-89.02C910.45,-146.97 940.03,-357.51 959.5,-531.62 969.02,-616.8 954.62,-840.29 995.5,-915.62 1000.58,-924.98 1008.86,-932.91 1017.26,-939.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1015.14,-941.97 1025.38,-944.69 1019.07,-936.18 1015.14,-941.97"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1098.5,-67.88 995.5,-67.88 995.5,-37.38 1098.5,-37.38 1098.5,-67.88"/>
-<text text-anchor="start" x="1003.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::system</text>
-<text text-anchor="middle" x="1047" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node21 -->
-<g id="edge30_Node000020_Node000021" class="edge">
-<title>Node20&#45;&gt;Node21</title>
-<g id="a_edge30_Node000020_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M959.81,-65.02C967.83,-63.87 976.08,-62.68 984.15,-61.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="984.48,-65.01 993.88,-60.12 983.49,-58.08 984.48,-65.01"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1074.12,-19.25 1019.88,-19.25 1019.88,0 1074.12,0 1074.12,-19.25"/>
-<text text-anchor="middle" x="1047" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node22 -->
-<g id="edge31_Node000020_Node000022" class="edge">
-<title>Node20&#45;&gt;Node22</title>
-<g id="a_edge31_Node000020_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M931.54,-57.98C950.02,-49.01 973.89,-37.76 995.5,-28.62 999.87,-26.78 1004.48,-24.92 1009.08,-23.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1010.13,-26.47 1018.22,-19.63 1007.63,-19.93 1010.13,-26.47"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1076.75,-142.25 1017.25,-142.25 1017.25,-123 1076.75,-123 1076.75,-142.25"/>
-<text text-anchor="middle" x="1047" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node23 -->
-<g id="edge32_Node000020_Node000023" class="edge">
-<title>Node20&#45;&gt;Node23</title>
-<g id="a_edge32_Node000020_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M935.16,-89.35C953.1,-97.21 975.34,-106.72 995.5,-114.62 998.92,-115.97 1002.49,-117.33 1006.08,-118.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1004.76,-121.9 1015.35,-122.04 1007.16,-115.33 1004.76,-121.9"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1076.38,-105.25 1017.62,-105.25 1017.62,-86 1076.38,-86 1076.38,-105.25"/>
-<text text-anchor="middle" x="1047" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node24 -->
-<g id="edge33_Node000020_Node000024" class="edge">
-<title>Node20&#45;&gt;Node24</title>
-<g id="a_edge33_Node000020_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M959.81,-82.64C975.46,-85 991.96,-87.48 1006.28,-89.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1005.34,-93.04 1015.75,-91.07 1006.38,-86.12 1005.34,-93.04"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node7 -->
-<g id="edge37_Node000025_Node000007" class="edge">
-<title>Node25&#45;&gt;Node7</title>
-<g id="a_edge37_Node000025_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M778.73,-835.96C786.66,-833.2 794.82,-830.34 802.5,-827.62 876.05,-801.59 961.81,-770.4 1009.41,-753.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1010.48,-756.35 1018.67,-749.63 1008.08,-749.78 1010.48,-756.35"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node8 -->
-<g id="edge38_Node000025_Node000008" class="edge">
-<title>Node25&#45;&gt;Node8</title>
-<g id="a_edge38_Node000025_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M802.78,-837.36C859.59,-827.33 934.44,-818.34 959.5,-834.62 992.53,-856.09 971.36,-884.49 995.5,-915.62 1002.45,-924.58 1011.81,-932.72 1020.58,-939.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1018.31,-941.95 1028.5,-944.87 1022.35,-936.24 1018.31,-941.95"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node9 -->
-<g id="edge39_Node000025_Node000009" class="edge">
-<title>Node25&#45;&gt;Node9</title>
-<g id="a_edge39_Node000025_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M790.87,-867.36C804.2,-871 818.48,-874.9 832.12,-878.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="830.88,-881.92 841.44,-881.18 832.72,-875.17 830.88,-881.92"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node18 -->
-<g id="edge40_Node000025_Node000018" class="edge">
-<title>Node25&#45;&gt;Node18</title>
-<g id="a_edge40_Node000025_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M802.64,-852.47C811.45,-852.57 820.45,-852.68 829.25,-852.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="829.1,-856.29 839.14,-852.91 829.18,-849.29 829.1,-856.29"/>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node9 -->
-<g id="edge48_Node000031_Node000009" class="edge">
-<title>Node31&#45;&gt;Node9</title>
-<g id="a_edge48_Node000031_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M802.64,-895.47C812.21,-895.58 822.01,-895.7 831.52,-895.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="831.39,-899.32 841.43,-895.94 831.47,-892.32 831.39,-899.32"/>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node18 -->
-<g id="edge49_Node000031_Node000018" class="edge">
-<title>Node31&#45;&gt;Node18</title>
-<g id="a_edge49_Node000031_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M773.55,-884.6C795.59,-879.11 823.12,-872.26 846.69,-866.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="847.22,-869.87 856.07,-864.06 845.52,-863.08 847.22,-869.87"/>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node7 -->
-<g id="edge55_Node000033_Node000007" class="edge">
-<title>Node33&#45;&gt;Node7</title>
-<g id="a_edge55_Node000033_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M555.35,-435.49C557.85,-380.9 572.96,-235.13 662,-173.62 713.38,-138.14 750.22,-139.47 802.5,-173.62 1000.54,-303.02 1038.13,-631.23 1044.7,-718.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1041.21,-718.38 1045.38,-728.12 1048.19,-717.91 1041.21,-718.38"/>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node8 -->
-<g id="edge57_Node000033_Node000008" class="edge">
-<title>Node33&#45;&gt;Node8</title>
-<g id="a_edge57_Node000033_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M562.6,-477.69C577.25,-518.43 609.09,-611.11 626,-691.62 639.71,-756.9 612.09,-945.38 662,-989.62 763.94,-1079.99 946.54,-1005.16 1017.09,-970.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1018.29,-974.01 1025.68,-966.42 1015.17,-967.74 1018.29,-974.01"/>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node18 -->
-<g id="edge71_Node000033_Node000018" class="edge">
-<title>Node33&#45;&gt;Node18</title>
-<g id="a_edge71_Node000033_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M570.26,-477.94C586.01,-500.53 610.33,-537.71 626,-572.62 648.63,-623.04 627.07,-648.81 662,-691.62 706.88,-746.63 744.49,-726.69 802.5,-767.62 831.95,-788.41 862.27,-817.21 880.62,-835.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="878.05,-838.01 887.56,-842.68 883.04,-833.1 878.05,-838.01"/>
-</a>
-</g>
-</g>
-<!-- Node34 -->
-<g id="Node000034" class="node">
-<title>Node34</title>
-<g id="a_Node000034"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="777,-596.25 687.5,-596.25 687.5,-577 777,-577 777,-596.25"/>
-<text text-anchor="middle" x="732.25" y="-582.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node34 -->
-<g id="edge52_Node000033_Node000034" class="edge">
-<title>Node33&#45;&gt;Node34</title>
-<g id="a_edge52_Node000033_Node000034"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M569.34,-477.76C587.86,-503.18 622.32,-545.33 662,-568.62 666.58,-571.31 671.56,-573.61 676.68,-575.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="675.28,-578.78 685.87,-578.63 677.5,-572.14 675.28,-578.78"/>
-</a>
-</g>
-</g>
-<!-- Node35 -->
-<g id="Node000035" class="node">
-<title>Node35</title>
-<g id="a_Node000035"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="775.88,-559.25 688.62,-559.25 688.62,-540 775.88,-540 775.88,-559.25"/>
-<text text-anchor="middle" x="732.25" y="-545.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::c_str</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node35 -->
-<g id="edge53_Node000033_Node000035" class="edge">
-<title>Node33&#45;&gt;Node35</title>
-<g id="a_edge53_Node000033_Node000035"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M579.7,-477.89C600.46,-494.67 631.49,-517.54 662,-531.62 666.89,-533.88 672.11,-535.89 677.4,-537.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="676.27,-540.98 686.86,-540.57 678.32,-534.29 676.27,-540.98"/>
-</a>
-</g>
-</g>
-<!-- Node36 -->
-<g id="Node000036" class="node">
-<title>Node36</title>
-<g id="a_Node000036"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="782.25,-522.25 682.25,-522.25 682.25,-503 782.25,-503 782.25,-522.25"/>
-<text text-anchor="middle" x="732.25" y="-508.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node36 -->
-<g id="edge54_Node000033_Node000036" class="edge">
-<title>Node33&#45;&gt;Node36</title>
-<g id="a_edge54_Node000033_Node000036"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M612.11,-477.96C628.16,-483.66 645.68,-489.62 662,-494.62 667.5,-496.31 673.28,-497.98 679.05,-499.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="678.05,-502.93 688.61,-502.15 679.87,-496.17 678.05,-502.93"/>
-</a>
-</g>
-</g>
-<!-- Node37 -->
-<g id="Node000037" class="node">
-<title>Node37</title>
-<g id="a_Node000037"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ios/eof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="777.38,-485.25 687.12,-485.25 687.12,-466 777.38,-466 777.38,-485.25"/>
-<text text-anchor="middle" x="732.25" y="-471.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::eof</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node37 -->
-<g id="edge56_Node000033_Node000037" class="edge">
-<title>Node33&#45;&gt;Node37</title>
-<g id="a_edge56_Node000033_Node000037"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M617.55,-463.38C636.41,-465.41 656.96,-467.62 675.34,-469.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="674.95,-473.08 685.27,-470.67 675.7,-466.12 674.95,-473.08"/>
-</a>
-</g>
-</g>
-<!-- Node38 -->
-<g id="Node000038" class="node">
-<title>Node38</title>
-<g id="a_Node000038"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="764.25,-448.25 700.25,-448.25 700.25,-429 764.25,-429 764.25,-448.25"/>
-<text text-anchor="middle" x="732.25" y="-434.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node38 -->
-<g id="edge58_Node000033_Node000038" class="edge">
-<title>Node33&#45;&gt;Node38</title>
-<g id="a_edge58_Node000033_Node000038"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M617.55,-450.23C641.11,-447.82 667.33,-445.15 688.65,-442.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="688.84,-446.47 698.43,-441.97 688.13,-439.51 688.84,-446.47"/>
-</a>
-</g>
-</g>
-<!-- Node39 -->
-<g id="Node000039" class="node">
-<title>Node39</title>
-<g id="a_Node000039"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="793.12,-410.88 671.38,-410.88 671.38,-380.38 793.12,-380.38 793.12,-410.88"/>
-<text text-anchor="start" x="679.38" y="-397.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::insert</text>
-<text text-anchor="middle" x="732.25" y="-386.12" font-family="Helvetica,sans-Serif" font-size="10.00">_element</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node39 -->
-<g id="edge59_Node000033_Node000039" class="edge">
-<title>Node33&#45;&gt;Node39</title>
-<g id="a_edge59_Node000033_Node000039"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M616.56,-435.29C635.58,-428.71 656.41,-421.51 675.04,-415.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="675.98,-418.44 684.29,-411.87 673.69,-411.83 675.98,-418.44"/>
-</a>
-</g>
-</g>
-<!-- Node40 -->
-<g id="Node000040" class="node">
-<title>Node40</title>
-<g id="a_Node000040"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="787.5,-362.25 677,-362.25 677,-343 787.5,-343 787.5,-362.25"/>
-<text text-anchor="middle" x="732.25" y="-348.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node40 -->
-<g id="edge60_Node000033_Node000040" class="edge">
-<title>Node33&#45;&gt;Node40</title>
-<g id="a_edge60_Node000033_Node000040"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M576.02,-435.51C596.41,-416.27 628.97,-388.37 662,-371.62 665.72,-369.74 669.65,-368.02 673.68,-366.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="674.75,-369.79 683.03,-363.18 672.44,-363.18 674.75,-369.79"/>
-</a>
-</g>
-</g>
-<!-- Node41 -->
-<g id="Node000041" class="node">
-<title>Node41</title>
-<g id="a_Node000041"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="798.38,-682.88 666.12,-682.88 666.12,-652.38 798.38,-652.38 798.38,-682.88"/>
-<text text-anchor="start" x="674.12" y="-669.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::minmax</text>
-<text text-anchor="middle" x="732.25" y="-658.12" font-family="Helvetica,sans-Serif" font-size="10.00">_scaler</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node41 -->
-<g id="edge61_Node000033_Node000041" class="edge">
-<title>Node33&#45;&gt;Node41</title>
-<g id="a_edge61_Node000033_Node000041"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M568.09,-477.94C587.11,-507.88 624.1,-563.44 662,-605.62 674.53,-619.57 689.95,-633.63 703.06,-644.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="700.63,-647.36 710.54,-651.11 705.13,-642 700.63,-647.36"/>
-</a>
-</g>
-</g>
-<!-- Node43 -->
-<g id="Node000043" class="node">
-<title>Node43</title>
-<g id="a_Node000043"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="781.12,-325.25 683.38,-325.25 683.38,-306 781.12,-306 781.12,-325.25"/>
-<text text-anchor="middle" x="732.25" y="-311.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node43 -->
-<g id="edge68_Node000033_Node000043" class="edge">
-<title>Node33&#45;&gt;Node43</title>
-<g id="a_edge68_Node000033_Node000043"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M567.61,-435.31C585.28,-407.61 619.86,-359.71 662,-333.62 665.32,-331.57 668.87,-329.75 672.55,-328.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="673.62,-331.47 681.72,-324.64 671.13,-324.92 673.62,-331.47"/>
-</a>
-</g>
-</g>
-<!-- Node44 -->
-<g id="Node000044" class="node">
-<title>Node44</title>
-<g id="a_Node000044"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="802.12,-288.25 662.38,-288.25 662.38,-269 802.12,-269 802.12,-288.25"/>
-<text text-anchor="middle" x="732.25" y="-274.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node44 -->
-<g id="edge69_Node000033_Node000044" class="edge">
-<title>Node33&#45;&gt;Node44</title>
-<g id="a_edge69_Node000033_Node000044"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M563.15,-435.35C577.73,-400.78 611.31,-332.63 662,-296.62 663.39,-295.64 664.84,-294.7 666.32,-293.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="667.85,-296.96 675.25,-289.38 664.73,-290.7 667.85,-296.96"/>
-</a>
-</g>
-</g>
-<!-- Node45 -->
-<g id="Node000045" class="node">
-<title>Node45</title>
-<g id="a_Node000045"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="789,-250.88 675.5,-250.88 675.5,-220.38 789,-220.38 789,-250.88"/>
-<text text-anchor="start" x="683.5" y="-237.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop</text>
-<text text-anchor="middle" x="732.25" y="-226.12" font-family="Helvetica,sans-Serif" font-size="10.00">_front</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node45 -->
-<g id="edge70_Node000033_Node000045" class="edge">
-<title>Node33&#45;&gt;Node45</title>
-<g id="a_edge70_Node000033_Node000045"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M560.73,-435.53C572.9,-395.51 604.69,-308.21 662,-259.62 663.12,-258.68 664.28,-257.76 665.47,-256.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="667.26,-259.9 673.9,-251.64 663.56,-253.96 667.26,-259.9"/>
-</a>
-</g>
-</g>
-<!-- Node46 -->
-<g id="Node000046" class="node">
-<title>Node46</title>
-<g id="a_Node000046"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="759.38,-202.25 705.12,-202.25 705.12,-183 759.38,-183 759.38,-202.25"/>
-<text text-anchor="middle" x="732.25" y="-188.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stod</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node46 -->
-<g id="edge72_Node000033_Node000046" class="edge">
-<title>Node33&#45;&gt;Node46</title>
-<g id="a_edge72_Node000033_Node000046"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M557.93,-435.3C565.9,-387.74 591.78,-272.37 662,-211.62 670.84,-203.98 682.49,-199.38 693.71,-196.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="694.06,-200.13 703.18,-194.75 692.69,-193.27 694.06,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node41&#45;&gt;Node7 -->
-<g id="edge62_Node000041_Node000007" class="edge">
-<title>Node41&#45;&gt;Node7</title>
-<g id="a_edge62_Node000041_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M779.04,-651.88C826.23,-638.38 900.95,-624.69 959.5,-649.62 992.91,-663.85 1019.65,-698.02 1034.13,-719.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1031.11,-721.7 1039.42,-728.27 1037.02,-717.95 1031.11,-721.7"/>
-</a>
-</g>
-</g>
-<!-- Node41&#45;&gt;Node8 -->
-<g id="edge63_Node000041_Node000008" class="edge">
-<title>Node41&#45;&gt;Node8</title>
-<g id="a_edge63_Node000041_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M798.65,-663.24C857.04,-660.84 936.75,-661.78 959.5,-682.62 1036.75,-753.42 942.79,-825.06 995.5,-915.62 1000.9,-924.9 1009.34,-932.83 1017.78,-939.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1015.68,-941.94 1025.91,-944.69 1019.63,-936.16 1015.68,-941.94"/>
-</a>
-</g>
-</g>
-<!-- Node41&#45;&gt;Node9 -->
-<g id="edge64_Node000041_Node000009" class="edge">
-<title>Node41&#45;&gt;Node9</title>
-<g id="a_edge64_Node000041_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M745.96,-683.05C761.08,-702 786.31,-735.59 802.5,-767.62 824.75,-811.65 804.55,-836.83 838.5,-872.62 838.87,-873.02 839.25,-873.41 839.64,-873.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="837.46,-876.53 847.48,-879.98 841.8,-871.04 837.46,-876.53"/>
-</a>
-</g>
-</g>
-<!-- Node41&#45;&gt;Node26 -->
-<g id="edge66_Node000041_Node000026" class="edge">
-<title>Node41&#45;&gt;Node26</title>
-<g id="a_edge66_Node000041_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M798.84,-681.16C820.29,-685.59 843.32,-690.34 861.78,-694.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="860.93,-697.55 871.43,-696.14 862.35,-690.69 860.93,-697.55"/>
-</a>
-</g>
-</g>
-<!-- Node41&#45;&gt;Node29 -->
-<g id="edge67_Node000041_Node000029" class="edge">
-<title>Node41&#45;&gt;Node29</title>
-<g id="a_edge67_Node000041_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M782.77,-651.99C789.9,-648.35 796.76,-643.93 802.5,-638.62 828.19,-614.88 811.63,-591.02 838.5,-568.62 840.6,-566.88 842.86,-565.3 845.24,-563.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="846.72,-567.04 854.16,-559.5 843.64,-560.76 846.72,-567.04"/>
-</a>
-</g>
-</g>
-<!-- Node42 -->
-<g id="Node000042" class="node">
-<title>Node42</title>
-<g id="a_Node000042"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="926.12,-597.25 871.88,-597.25 871.88,-578 926.12,-578 926.12,-597.25"/>
-<text text-anchor="middle" x="899" y="-583.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node41&#45;&gt;Node42 -->
-<g id="edge65_Node000041_Node000042" class="edge">
-<title>Node41&#45;&gt;Node42</title>
-<g id="a_edge65_Node000041_Node000042"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M775.43,-651.92C784.56,-647.98 794.02,-643.48 802.5,-638.62 819.86,-628.69 821.08,-621.45 838.5,-611.62 845.56,-607.65 853.41,-603.99 861.03,-600.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="862.15,-604.12 870.14,-597.16 859.55,-597.62 862.15,-604.12"/>
-</a>
-</g>
-</g>
-<!-- Node47&#45;&gt;Node14 -->
-<g id="edge74_Node000047_Node000014" class="edge">
-<title>Node47&#45;&gt;Node14</title>
-<g id="a_edge74_Node000047_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M438.94,-1175.77C449.17,-1177.92 459.91,-1180.16 470.53,-1182.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="469.54,-1185.76 480.05,-1184.38 470.98,-1178.91 469.54,-1185.76"/>
-</a>
-</g>
-</g>
-<!-- Node48&#45;&gt;Node7 -->
-<g id="edge76_Node000048_Node000007" class="edge">
-<title>Node48&#45;&gt;Node7</title>
-<g id="a_edge76_Node000048_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M792.25,-776.31C807.18,-771.54 823.3,-766.93 838.5,-763.62 897.17,-750.89 966.73,-744.59 1008.56,-741.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1008.59,-745.23 1018.34,-741.09 1008.13,-738.25 1008.59,-745.23"/>
-</a>
-</g>
-</g>
-<!-- Node48&#45;&gt;Node9 -->
-<g id="edge77_Node000048_Node000009" class="edge">
-<title>Node48&#45;&gt;Node9</title>
-<g id="a_edge77_Node000048_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M789.06,-818.86C793.78,-821.52 798.34,-824.44 802.5,-827.62 822.85,-843.17 817.95,-857.33 838.5,-872.62 839.81,-873.6 841.17,-874.55 842.56,-875.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="840.46,-878.28 850.87,-880.25 843.95,-872.22 840.46,-878.28"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 0f2cbd3ac..000000000
--- a/d2/d58/neural__network_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,1158 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="1107pt" height="1321pt"
- viewBox="0.00 0.00 1106.50 1321.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 1317.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-1061.25 0,-1061.25 0,-1042 37,-1042 37,-1061.25"/>
-<text text-anchor="middle" x="18.5" y="-1047.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-1061.25 73,-1061.25 73,-1042 105.5,-1042 105.5,-1061.25"/>
-<text text-anchor="middle" x="89.25" y="-1047.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-1051.62C44.58,-1051.62 53.31,-1051.62 61.45,-1051.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-1055.13 71.2,-1051.63 61.2,-1048.13 61.2,-1055.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="797.25,-1242.25 667.25,-1242.25 667.25,-1223 797.25,-1223 797.25,-1242.25"/>
-<text text-anchor="middle" x="732.25" y="-1228.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::argmax</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.92,-1061.45C105.88,-1074.09 122.86,-1096.13 141.5,-1110.62 271.69,-1211.84 319.45,-1229.39 481.75,-1258.62 544.85,-1269.99 562.36,-1266.37 626,-1258.62 646.83,-1256.09 669.48,-1250.83 688.41,-1245.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="689.24,-1249.11 697.92,-1243.04 687.35,-1242.37 689.24,-1249.11"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="268.5,-924.5 141.5,-924.5 141.5,-882.75 268.5,-882.75 268.5,-924.5"/>
-<text text-anchor="start" x="149.5" y="-911" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="149.5" y="-899.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="205" y="-888.5" font-family="Helvetica,sans-Serif" font-size="10.00">::fit_from_csv</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge13_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge13_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.71,-1041.91C114.29,-1020.34 154.77,-967.67 180.72,-933.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.38,-936.2 186.7,-926.14 177.83,-931.93 183.38,-936.2"/>
-</a>
-</g>
-</g>
-<!-- Node47 -->
-<g id="Node000047" class="node">
-<title>Node47</title>
-<g id="a_Node000047"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="438.62,-1183.5 311.62,-1183.5 311.62,-1141.75 438.62,-1141.75 438.62,-1183.5"/>
-<text text-anchor="start" x="319.62" y="-1170" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="319.62" y="-1158.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="375.12" y="-1147.5" font-family="Helvetica,sans-Serif" font-size="10.00">::single_predict</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node47 -->
-<g id="edge73_Node000002_Node000047" class="edge">
-<title>Node2&#45;&gt;Node47</title>
-<g id="a_edge73_Node000002_Node000047"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.92,-1057.75C143.93,-1072.61 242.79,-1111.27 309.27,-1137.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.65,-1140.39 318.24,-1140.77 310.2,-1133.87 307.65,-1140.39"/>
-</a>
-</g>
-</g>
-<!-- Node48 -->
-<g id="Node000048" class="node">
-<title>Node48</title>
-<g id="a_Node000048"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="795.75,-818.5 668.75,-818.5 668.75,-776.75 795.75,-776.75 795.75,-818.5"/>
-<text text-anchor="start" x="676.75" y="-805" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="676.75" y="-793.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="732.25" y="-782.5" font-family="Helvetica,sans-Serif" font-size="10.00">::summary</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node48 -->
-<g id="edge75_Node000002_Node000048" class="edge">
-<title>Node2&#45;&gt;Node48</title>
-<g id="a_edge75_Node000002_Node000048"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.51,-1041.54C91.75,-1012.27 99.04,-926.14 141.5,-873.62 249.33,-740.27 315.4,-733.32 481.75,-691.62 543.94,-676.04 569.21,-661.87 626,-691.62 650.9,-704.67 642.7,-723.19 662,-743.62 670.66,-752.79 680.95,-761.67 690.91,-769.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="688.64,-772.15 698.71,-775.43 692.88,-766.59 688.64,-772.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="928.38,-1202.25 869.62,-1202.25 869.62,-1183 928.38,-1183 928.38,-1202.25"/>
-<text text-anchor="middle" x="899" y="-1188.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M774.82,-1222.53C800.37,-1216.33 832.91,-1208.43 858.13,-1202.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="858.79,-1205.75 867.68,-1199.99 857.14,-1198.94 858.79,-1205.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="935.12,-1313.25 862.88,-1313.25 862.88,-1294 935.12,-1294 935.12,-1313.25"/>
-<text text-anchor="middle" x="899" y="-1299.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M750.7,-1242.59C771.23,-1254.03 806.58,-1272.87 838.5,-1285.62 842.78,-1287.34 847.3,-1288.98 851.84,-1290.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="850.38,-1293.73 860.98,-1293.49 852.54,-1287.07 850.38,-1293.73"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="924.62,-1276.25 873.38,-1276.25 873.38,-1257 924.62,-1257 924.62,-1276.25"/>
-<text text-anchor="middle" x="899" y="-1262.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M782.23,-1242.73C807.88,-1248.03 838.71,-1254.39 862.11,-1259.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="861.29,-1262.62 871.79,-1261.22 862.7,-1255.77 861.29,-1262.62"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1073.75,-749.25 1020.25,-749.25 1020.25,-730 1073.75,-730 1073.75,-749.25"/>
-<text text-anchor="middle" x="1047" y="-735.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M791.25,-1222.58C795.34,-1220.41 799.16,-1217.79 802.5,-1214.62 840.77,-1178.38 813.6,-1148.08 838.5,-1101.62 879.12,-1025.83 915.85,-1024.73 959.5,-950.62 979.6,-916.49 1021.13,-806.79 1038.31,-760.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1041.59,-761.75 1041.77,-751.15 1035.02,-759.32 1041.59,-761.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1072.62,-965.25 1021.38,-965.25 1021.38,-946 1072.62,-946 1072.62,-965.25"/>
-<text text-anchor="middle" x="1047" y="-951.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M785.7,-1222.61C791.58,-1220.45 797.32,-1217.82 802.5,-1214.62 823.14,-1201.9 819.66,-1188.89 838.5,-1173.62 886.42,-1134.78 915.64,-1149 959.5,-1105.62 998.54,-1067.01 1025.91,-1007.13 1038.38,-976"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1041.53,-977.57 1041.88,-966.98 1035,-975.04 1041.53,-977.57"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="954.62,-911.88 843.38,-911.88 843.38,-881.38 954.62,-881.38 954.62,-911.88"/>
-<text text-anchor="start" x="851.38" y="-898.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="899" y="-887.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M792.28,-1222.59C796.04,-1220.4 799.51,-1217.78 802.5,-1214.62 857.19,-1157.05 815.14,-1115.52 838.5,-1039.62 851.49,-997.42 872.29,-950.53 885.55,-922.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="888.61,-924.03 889.74,-913.5 882.28,-921.03 888.61,-924.03"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="946,-1239.25 852,-1239.25 852,-1220 946,-1220 946,-1239.25"/>
-<text text-anchor="middle" x="899" y="-1225.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node11 -->
-<g id="edge12_Node000003_Node000011" class="edge">
-<title>Node3&#45;&gt;Node11</title>
-<g id="a_edge12_Node000003_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M797.42,-1231.46C811.54,-1231.2 826.4,-1230.93 840.25,-1230.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="840.15,-1234.18 850.09,-1230.5 840.03,-1227.18 840.15,-1234.18"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge9_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge9_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M947.05,-880.92C951.48,-878.49 955.72,-875.74 959.5,-872.62 997.63,-841.24 1024.78,-788.57 1037.63,-759.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1040.76,-761.4 1041.51,-750.83 1034.34,-758.62 1040.76,-761.4"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node8 -->
-<g id="edge10_Node000009_Node000008" class="edge">
-<title>Node9&#45;&gt;Node8</title>
-<g id="a_edge10_Node000009_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M938.74,-912.28C961.15,-921.33 989.12,-932.64 1010.88,-941.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1009.33,-944.58 1019.91,-945.08 1011.95,-938.09 1009.33,-944.58"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1087.25,-906.25 1006.75,-906.25 1006.75,-887 1087.25,-887 1087.25,-906.25"/>
-<text text-anchor="middle" x="1047" y="-892.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge11_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge11_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M954.78,-896.62C968.05,-896.62 982.17,-896.62 995.25,-896.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="994.9,-900.13 1004.9,-896.63 994.9,-893.13 994.9,-900.13"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="445.75,-918.88 304.5,-918.88 304.5,-888.38 445.75,-888.38 445.75,-918.88"/>
-<text text-anchor="start" x="312.5" y="-905.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="middle" x="375.12" y="-894.12" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork::fit</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge14_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge14_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M268.6,-903.62C276.47,-903.62 284.61,-903.62 292.71,-903.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="292.6,-907.13 302.6,-903.63 292.6,-900.13 292.6,-907.13"/>
-</a>
-</g>
-</g>
-<!-- Node33 -->
-<g id="Node000033" class="node">
-<title>Node33</title>
-<g id="a_Node000033"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="617.38,-477.5 490.38,-477.5 490.38,-435.75 617.38,-435.75 617.38,-477.5"/>
-<text text-anchor="start" x="498.38" y="-464" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="498.38" y="-452.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="553.88" y="-441.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_XY_from_csv</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node33 -->
-<g id="edge51_Node000012_Node000033" class="edge">
-<title>Node12&#45;&gt;Node33</title>
-<g id="a_edge51_Node000012_Node000033"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M222.5,-882.37C278.83,-809.78 463.7,-571.54 529.42,-486.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="532.19,-489 535.55,-478.95 526.66,-484.7 532.19,-489"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node3 -->
-<g id="edge24_Node000013_Node000003" class="edge">
-<title>Node13&#45;&gt;Node3</title>
-<g id="a_edge24_Node000013_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.87,-919.09C400.55,-983.17 475.1,-1224.73 481.75,-1229.62 542.48,-1274.35 636.02,-1259.62 689.64,-1245.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="690.27,-1249.09 698.99,-1243.07 688.42,-1242.33 690.27,-1249.09"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node7 -->
-<g id="edge26_Node000013_Node000007" class="edge">
-<title>Node13&#45;&gt;Node7</title>
-<g id="a_edge26_Node000013_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M375.61,-888.08C373.47,-794.1 376.2,-300.44 662,-143.62 779.81,-78.98 873.04,-94.75 959.5,-197.62 1027.72,-278.8 1042.7,-628.47 1045.45,-718.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1041.95,-718.36 1045.73,-728.26 1048.94,-718.17 1041.95,-718.36"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node8 -->
-<g id="edge34_Node000013_Node000008" class="edge">
-<title>Node13&#45;&gt;Node8</title>
-<g id="a_edge34_Node000013_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M396.02,-919.18C416.44,-934.42 449.68,-957.25 481.75,-970.62 542.45,-995.94 564.84,-979.45 626,-1003.62 643.23,-1010.44 644.15,-1019.69 662,-1024.62 789.45,-1059.86 835.01,-1071.18 959.5,-1026.62 988.63,-1016.2 1014.99,-991.27 1030.75,-973.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1033.04,-976.62 1036.99,-966.79 1027.77,-972.01 1033.04,-976.62"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node9 -->
-<g id="edge35_Node000013_Node000009" class="edge">
-<title>Node13&#45;&gt;Node9</title>
-<g id="a_edge35_Node000013_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M445.97,-897.59C457.9,-896.77 470.17,-896.06 481.75,-895.62 545.82,-893.2 563.6,-880.9 626,-895.62 643.41,-899.73 644.59,-909.52 662,-913.62 722.77,-927.97 740.3,-919.12 802.5,-913.62 811.96,-912.79 821.9,-911.5 831.63,-909.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="832.13,-913.45 841.43,-908.38 831,-906.54 832.13,-913.45"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="626,-1220.5 481.75,-1220.5 481.75,-1178.75 626,-1178.75 626,-1220.5"/>
-<text text-anchor="start" x="489.75" y="-1207" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="489.75" y="-1195.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="553.88" y="-1184.5" font-family="Helvetica,sans-Serif" font-size="10.00">::__detailed_single_prediction</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge15_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge15_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M378.06,-919.08C384.44,-963.84 408.75,-1095.07 481.75,-1169.62 482.35,-1170.24 482.96,-1170.83 483.59,-1171.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.18,-1173.98 491.19,-1177.47 485.54,-1168.51 481.18,-1173.98"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="792.75,-1155.88 671.75,-1155.88 671.75,-1125.38 792.75,-1125.38 792.75,-1155.88"/>
-<text text-anchor="start" x="679.75" y="-1142.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::apply</text>
-<text text-anchor="middle" x="732.25" y="-1131.12" font-family="Helvetica,sans-Serif" font-size="10.00">_function</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node15 -->
-<g id="edge23_Node000013_Node000015" class="edge">
-<title>Node13&#45;&gt;Node15</title>
-<g id="a_edge23_Node000013_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M388.42,-919.19C406.56,-941.13 442.61,-981.01 481.75,-1003.62 539.68,-1037.09 569.46,-1010.87 626,-1046.62 646.22,-1059.41 644.5,-1070.32 662,-1086.62 673.91,-1097.72 687.93,-1108.96 700.23,-1118.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="697.92,-1120.93 708.03,-1124.11 702.11,-1115.32 697.92,-1120.93"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="798,-980.25 666.5,-980.25 666.5,-961 798,-961 798,-980.25"/>
-<text text-anchor="middle" x="732.25" y="-966.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node17 -->
-<g id="edge42_Node000013_Node000017" class="edge">
-<title>Node13&#45;&gt;Node17</title>
-<g id="a_edge42_Node000013_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M446.17,-899.59C497.35,-898.86 567.7,-902.53 626,-922.62 644.18,-928.89 644.78,-938.07 662,-946.62 669.61,-950.4 677.96,-953.84 686.14,-956.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="684.71,-960.07 695.3,-960.08 687.03,-953.46 684.71,-960.07"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="618.5,-720.25 489.25,-720.25 489.25,-701 618.5,-701 618.5,-720.25"/>
-<text text-anchor="middle" x="553.88" y="-706.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::duration_cast</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node19 -->
-<g id="edge25_Node000013_Node000019" class="edge">
-<title>Node13&#45;&gt;Node19</title>
-<g id="a_edge25_Node000013_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.66,-888.07C394.21,-854.97 428,-777.1 481.75,-734.62 486.48,-730.89 491.82,-727.72 497.4,-725.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="498.38,-728.42 506.22,-721.29 495.65,-721.97 498.38,-728.42"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="959.5,-88.88 838.5,-88.88 838.5,-58.38 959.5,-58.38 959.5,-88.88"/>
-<text text-anchor="start" x="846.5" y="-75.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::equal</text>
-<text text-anchor="middle" x="899" y="-64.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node20 -->
-<g id="edge27_Node000013_Node000020" class="edge">
-<title>Node13&#45;&gt;Node20</title>
-<g id="a_edge27_Node000013_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M377.01,-888.14C383.22,-781.53 421.97,-158.83 481.75,-102.62 575.48,-14.5 739.48,-34.69 831.15,-55.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="830.23,-58.7 840.76,-57.55 831.81,-51.88 830.23,-58.7"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a xlink:href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="802.5,-866.88 662,-866.88 662,-836.38 802.5,-836.38 802.5,-866.88"/>
-<text text-anchor="start" x="670" y="-853.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::hadamard</text>
-<text text-anchor="middle" x="732.25" y="-842.12" font-family="Helvetica,sans-Serif" font-size="10.00">_product</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node25 -->
-<g id="edge36_Node000013_Node000025" class="edge">
-<title>Node13&#45;&gt;Node25</title>
-<g id="a_edge36_Node000013_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M393.23,-888.11C412.92,-871.4 447.02,-845.84 481.75,-835.62 539.24,-818.72 607.29,-824.7 657.78,-833.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="656.96,-837.21 667.44,-835.63 658.26,-830.33 656.96,-837.21"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="924.62,-711.25 873.38,-711.25 873.38,-692 924.62,-692 924.62,-711.25"/>
-<text text-anchor="middle" x="899" y="-697.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node26 -->
-<g id="edge41_Node000013_Node000026" class="edge">
-<title>Node13&#45;&gt;Node26</title>
-<g id="a_edge41_Node000013_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M391.95,-887.97C411.49,-869.43 446.51,-838.79 481.75,-820.62 613.02,-752.95 788,-719.06 862.26,-706.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="862.47,-710.47 871.79,-705.44 861.37,-703.55 862.47,-710.47"/>
-</a>
-</g>
-</g>
-<!-- Node27 -->
-<g id="Node000027" class="node">
-<title>Node27</title>
-<g id="a_Node000027"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="621.88,-1160.88 485.88,-1160.88 485.88,-1130.38 621.88,-1130.38 621.88,-1160.88"/>
-<text text-anchor="start" x="493.88" y="-1147.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::high_resolution</text>
-<text text-anchor="middle" x="553.88" y="-1136.12" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node27 -->
-<g id="edge43_Node000013_Node000027" class="edge">
-<title>Node13&#45;&gt;Node27</title>
-<g id="a_edge43_Node000013_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M379.33,-919.35C388.25,-959.12 417.08,-1064.61 481.75,-1121.62 482.54,-1122.32 483.35,-1123 484.18,-1123.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="482.19,-1126.53 492.46,-1129.15 486.06,-1120.7 482.19,-1126.53"/>
-</a>
-</g>
-</g>
-<!-- Node28 -->
-<g id="Node000028" class="node">
-<title>Node28</title>
-<g id="a_Node000028"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="601.25,-1112.25 506.5,-1112.25 506.5,-1093 601.25,-1093 601.25,-1112.25"/>
-<text text-anchor="middle" x="553.88" y="-1098.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node28 -->
-<g id="edge44_Node000013_Node000028" class="edge">
-<title>Node13&#45;&gt;Node28</title>
-<g id="a_edge44_Node000013_Node000028"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.65,-919.27C391.69,-954.58 423.47,-1040.76 481.75,-1084.62 485.98,-1087.81 490.71,-1090.43 495.67,-1092.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="494.06,-1095.73 504.66,-1095.9 496.48,-1089.16 494.06,-1095.73"/>
-</a>
-</g>
-</g>
-<!-- Node29 -->
-<g id="Node000029" class="node">
-<title>Node29</title>
-<g id="a_Node000029"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="942.25,-560.25 855.75,-560.25 855.75,-541 942.25,-541 942.25,-560.25"/>
-<text text-anchor="middle" x="899" y="-546.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node29 -->
-<g id="edge45_Node000013_Node000029" class="edge">
-<title>Node13&#45;&gt;Node29</title>
-<g id="a_edge45_Node000013_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M379.26,-888.09C388.01,-848.83 416.48,-744.97 481.75,-691.62 596.02,-598.22 675.2,-680.3 802.5,-605.62 822.29,-594.02 818.9,-580.55 838.5,-568.62 840.52,-567.4 842.62,-566.25 844.79,-565.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="846.06,-568.44 853.86,-561.27 843.29,-562.01 846.06,-568.44"/>
-</a>
-</g>
-</g>
-<!-- Node30 -->
-<g id="Node000030" class="node">
-<title>Node30</title>
-<g id="a_Node000030"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="612.12,-1075.25 495.62,-1075.25 495.62,-1056 612.12,-1056 612.12,-1075.25"/>
-<text text-anchor="middle" x="553.88" y="-1061.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node30 -->
-<g id="edge46_Node000013_Node000030" class="edge">
-<title>Node13&#45;&gt;Node30</title>
-<g id="a_edge46_Node000013_Node000030"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M384.03,-919.31C399.16,-947.77 434.9,-1008.07 481.75,-1041.62 487.04,-1045.42 492.98,-1048.64 499.11,-1051.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="497.53,-1054.52 508.12,-1054.97 500.13,-1048.02 497.53,-1054.52"/>
-</a>
-</g>
-</g>
-<!-- Node31 -->
-<g id="Node000031" class="node">
-<title>Node31</title>
-<g id="a_Node000031"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="802.5,-904.25 662,-904.25 662,-885 802.5,-885 802.5,-904.25"/>
-<text text-anchor="middle" x="732.25" y="-890.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::transpose</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node31 -->
-<g id="edge47_Node000013_Node000031" class="edge">
-<title>Node13&#45;&gt;Node31</title>
-<g id="a_edge47_Node000013_Node000031"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M399.69,-888.09C420.34,-875.46 451.69,-858.62 481.75,-851.62 544.19,-837.09 564.64,-833.05 626,-851.62 644.4,-857.2 644.5,-867.65 662,-875.62 666.27,-877.57 670.79,-879.36 675.39,-880.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="674.14,-884.27 684.74,-884.05 676.32,-877.61 674.14,-884.27"/>
-</a>
-</g>
-</g>
-<!-- Node32 -->
-<g id="Node000032" class="node">
-<title>Node32</title>
-<g id="a_Node000032"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="617.38,-961.88 490.38,-961.88 490.38,-931.38 617.38,-931.38 617.38,-961.88"/>
-<text text-anchor="start" x="498.38" y="-948.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::zeroes</text>
-<text text-anchor="middle" x="553.88" y="-937.12" font-family="Helvetica,sans-Serif" font-size="10.00">_initialization</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node32 -->
-<g id="edge50_Node000013_Node000032" class="edge">
-<title>Node13&#45;&gt;Node32</title>
-<g id="a_edge50_Node000013_Node000032"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M440.69,-919.33C453.12,-922.36 466.23,-925.55 478.93,-928.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="477.95,-932 488.49,-930.96 479.6,-925.2 477.95,-932"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge16_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge16_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M618.55,-1178.32C636.53,-1172.31 655.98,-1165.8 673.58,-1159.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="674.47,-1163.31 682.84,-1156.82 672.25,-1156.67 674.47,-1163.31"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="798,-1205.25 666.5,-1205.25 666.5,-1186 798,-1186 798,-1205.25"/>
-<text text-anchor="middle" x="732.25" y="-1191.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node16 -->
-<g id="edge17_Node000014_Node000016" class="edge">
-<title>Node14&#45;&gt;Node16</title>
-<g id="a_edge17_Node000014_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M626.36,-1198C635.73,-1197.79 645.36,-1197.57 654.8,-1197.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="654.77,-1200.86 664.69,-1197.13 654.62,-1193.86 654.77,-1200.86"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node17 -->
-<g id="edge18_Node000014_Node000017" class="edge">
-<title>Node14&#45;&gt;Node17</title>
-<g id="a_edge18_Node000014_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M614.29,-1178.46C618.48,-1175.82 622.44,-1172.88 626,-1169.62 640.64,-1156.21 698.36,-1038.7 721.54,-990.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="724.55,-992.61 725.75,-982.09 718.25,-989.57 724.55,-992.61"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node7 -->
-<g id="edge19_Node000017_Node000007" class="edge">
-<title>Node17&#45;&gt;Node7</title>
-<g id="a_edge19_Node000017_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M791.22,-960.54C853.8,-949.22 946.33,-931.09 959.5,-920.62 986.49,-899.19 1023.45,-802.7 1038.83,-760.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1042.08,-761.33 1042.14,-750.74 1035.49,-758.98 1042.08,-761.33"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node8 -->
-<g id="edge20_Node000017_Node000008" class="edge">
-<title>Node17&#45;&gt;Node8</title>
-<g id="a_edge20_Node000017_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M798.43,-967.5C862.54,-964.42 958.08,-959.84 1009.72,-957.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1009.62,-960.87 1019.44,-956.9 1009.29,-953.88 1009.62,-960.87"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node9 -->
-<g id="edge21_Node000017_Node000009" class="edge">
-<title>Node17&#45;&gt;Node9</title>
-<g id="a_edge21_Node000017_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M766.53,-960.55C778.1,-956.67 791.05,-951.89 802.5,-946.62 819.33,-938.89 822.16,-934.36 838.5,-925.62 843.63,-922.89 849.05,-920.1 854.45,-917.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="855.97,-920.54 863.38,-912.97 852.86,-914.27 855.97,-920.54"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="956.88,-863.25 841.12,-863.25 841.12,-844 956.88,-844 956.88,-863.25"/>
-<text text-anchor="middle" x="899" y="-849.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge22_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge22_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M746.81,-960.51C761.18,-949.56 784.27,-931.28 802.5,-913.62 819.92,-896.75 818.21,-885.91 838.5,-872.62 840.88,-871.07 843.4,-869.63 846,-868.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="847.24,-871.58 854.96,-864.33 844.4,-865.18 847.24,-871.58"/>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node7 -->
-<g id="edge28_Node000020_Node000007" class="edge">
-<title>Node20&#45;&gt;Node7</title>
-<g id="a_edge28_Node000020_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M945.01,-89.33C950.58,-92.94 955.66,-97.32 959.5,-102.62 1033.05,-204.32 1044.13,-618.97 1045.74,-718.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1042.24,-718.15 1045.88,-728.1 1049.23,-718.05 1042.24,-718.15"/>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node8 -->
-<g id="edge29_Node000020_Node000008" class="edge">
-<title>Node20&#45;&gt;Node8</title>
-<g id="a_edge29_Node000020_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M902.2,-89.02C910.45,-146.97 940.03,-357.51 959.5,-531.62 969.02,-616.8 954.62,-840.29 995.5,-915.62 1000.58,-924.98 1008.86,-932.91 1017.26,-939.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1015.14,-941.97 1025.38,-944.69 1019.07,-936.18 1015.14,-941.97"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1098.5,-67.88 995.5,-67.88 995.5,-37.38 1098.5,-37.38 1098.5,-67.88"/>
-<text text-anchor="start" x="1003.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::system</text>
-<text text-anchor="middle" x="1047" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node21 -->
-<g id="edge30_Node000020_Node000021" class="edge">
-<title>Node20&#45;&gt;Node21</title>
-<g id="a_edge30_Node000020_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M959.81,-65.02C967.83,-63.87 976.08,-62.68 984.15,-61.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="984.48,-65.01 993.88,-60.12 983.49,-58.08 984.48,-65.01"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1074.12,-19.25 1019.88,-19.25 1019.88,0 1074.12,0 1074.12,-19.25"/>
-<text text-anchor="middle" x="1047" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node22 -->
-<g id="edge31_Node000020_Node000022" class="edge">
-<title>Node20&#45;&gt;Node22</title>
-<g id="a_edge31_Node000020_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M931.54,-57.98C950.02,-49.01 973.89,-37.76 995.5,-28.62 999.87,-26.78 1004.48,-24.92 1009.08,-23.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1010.13,-26.47 1018.22,-19.63 1007.63,-19.93 1010.13,-26.47"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1076.75,-142.25 1017.25,-142.25 1017.25,-123 1076.75,-123 1076.75,-142.25"/>
-<text text-anchor="middle" x="1047" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node23 -->
-<g id="edge32_Node000020_Node000023" class="edge">
-<title>Node20&#45;&gt;Node23</title>
-<g id="a_edge32_Node000020_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M935.16,-89.35C953.1,-97.21 975.34,-106.72 995.5,-114.62 998.92,-115.97 1002.49,-117.33 1006.08,-118.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1004.76,-121.9 1015.35,-122.04 1007.16,-115.33 1004.76,-121.9"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1076.38,-105.25 1017.62,-105.25 1017.62,-86 1076.38,-86 1076.38,-105.25"/>
-<text text-anchor="middle" x="1047" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node24 -->
-<g id="edge33_Node000020_Node000024" class="edge">
-<title>Node20&#45;&gt;Node24</title>
-<g id="a_edge33_Node000020_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M959.81,-82.64C975.46,-85 991.96,-87.48 1006.28,-89.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1005.34,-93.04 1015.75,-91.07 1006.38,-86.12 1005.34,-93.04"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node7 -->
-<g id="edge37_Node000025_Node000007" class="edge">
-<title>Node25&#45;&gt;Node7</title>
-<g id="a_edge37_Node000025_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M778.73,-835.96C786.66,-833.2 794.82,-830.34 802.5,-827.62 876.05,-801.59 961.81,-770.4 1009.41,-753.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1010.48,-756.35 1018.67,-749.63 1008.08,-749.78 1010.48,-756.35"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node8 -->
-<g id="edge38_Node000025_Node000008" class="edge">
-<title>Node25&#45;&gt;Node8</title>
-<g id="a_edge38_Node000025_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M802.78,-837.36C859.59,-827.33 934.44,-818.34 959.5,-834.62 992.53,-856.09 971.36,-884.49 995.5,-915.62 1002.45,-924.58 1011.81,-932.72 1020.58,-939.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1018.31,-941.95 1028.5,-944.87 1022.35,-936.24 1018.31,-941.95"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node9 -->
-<g id="edge39_Node000025_Node000009" class="edge">
-<title>Node25&#45;&gt;Node9</title>
-<g id="a_edge39_Node000025_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M790.87,-867.36C804.2,-871 818.48,-874.9 832.12,-878.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="830.88,-881.92 841.44,-881.18 832.72,-875.17 830.88,-881.92"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node18 -->
-<g id="edge40_Node000025_Node000018" class="edge">
-<title>Node25&#45;&gt;Node18</title>
-<g id="a_edge40_Node000025_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M802.64,-852.47C811.45,-852.57 820.45,-852.68 829.25,-852.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="829.1,-856.29 839.14,-852.91 829.18,-849.29 829.1,-856.29"/>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node9 -->
-<g id="edge48_Node000031_Node000009" class="edge">
-<title>Node31&#45;&gt;Node9</title>
-<g id="a_edge48_Node000031_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M802.64,-895.47C812.21,-895.58 822.01,-895.7 831.52,-895.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="831.39,-899.32 841.43,-895.94 831.47,-892.32 831.39,-899.32"/>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node18 -->
-<g id="edge49_Node000031_Node000018" class="edge">
-<title>Node31&#45;&gt;Node18</title>
-<g id="a_edge49_Node000031_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M773.55,-884.6C795.59,-879.11 823.12,-872.26 846.69,-866.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="847.22,-869.87 856.07,-864.06 845.52,-863.08 847.22,-869.87"/>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node7 -->
-<g id="edge55_Node000033_Node000007" class="edge">
-<title>Node33&#45;&gt;Node7</title>
-<g id="a_edge55_Node000033_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M555.35,-435.49C557.85,-380.9 572.96,-235.13 662,-173.62 713.38,-138.14 750.22,-139.47 802.5,-173.62 1000.54,-303.02 1038.13,-631.23 1044.7,-718.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1041.21,-718.38 1045.38,-728.12 1048.19,-717.91 1041.21,-718.38"/>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node8 -->
-<g id="edge57_Node000033_Node000008" class="edge">
-<title>Node33&#45;&gt;Node8</title>
-<g id="a_edge57_Node000033_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M562.6,-477.69C577.25,-518.43 609.09,-611.11 626,-691.62 639.71,-756.9 612.09,-945.38 662,-989.62 763.94,-1079.99 946.54,-1005.16 1017.09,-970.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1018.29,-974.01 1025.68,-966.42 1015.17,-967.74 1018.29,-974.01"/>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node18 -->
-<g id="edge71_Node000033_Node000018" class="edge">
-<title>Node33&#45;&gt;Node18</title>
-<g id="a_edge71_Node000033_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M570.26,-477.94C586.01,-500.53 610.33,-537.71 626,-572.62 648.63,-623.04 627.07,-648.81 662,-691.62 706.88,-746.63 744.49,-726.69 802.5,-767.62 831.95,-788.41 862.27,-817.21 880.62,-835.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="878.05,-838.01 887.56,-842.68 883.04,-833.1 878.05,-838.01"/>
-</a>
-</g>
-</g>
-<!-- Node34 -->
-<g id="Node000034" class="node">
-<title>Node34</title>
-<g id="a_Node000034"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="777,-596.25 687.5,-596.25 687.5,-577 777,-577 777,-596.25"/>
-<text text-anchor="middle" x="732.25" y="-582.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node34 -->
-<g id="edge52_Node000033_Node000034" class="edge">
-<title>Node33&#45;&gt;Node34</title>
-<g id="a_edge52_Node000033_Node000034"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M569.34,-477.76C587.86,-503.18 622.32,-545.33 662,-568.62 666.58,-571.31 671.56,-573.61 676.68,-575.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="675.28,-578.78 685.87,-578.63 677.5,-572.14 675.28,-578.78"/>
-</a>
-</g>
-</g>
-<!-- Node35 -->
-<g id="Node000035" class="node">
-<title>Node35</title>
-<g id="a_Node000035"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="775.88,-559.25 688.62,-559.25 688.62,-540 775.88,-540 775.88,-559.25"/>
-<text text-anchor="middle" x="732.25" y="-545.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::c_str</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node35 -->
-<g id="edge53_Node000033_Node000035" class="edge">
-<title>Node33&#45;&gt;Node35</title>
-<g id="a_edge53_Node000033_Node000035"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M579.7,-477.89C600.46,-494.67 631.49,-517.54 662,-531.62 666.89,-533.88 672.11,-535.89 677.4,-537.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="676.27,-540.98 686.86,-540.57 678.32,-534.29 676.27,-540.98"/>
-</a>
-</g>
-</g>
-<!-- Node36 -->
-<g id="Node000036" class="node">
-<title>Node36</title>
-<g id="a_Node000036"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="782.25,-522.25 682.25,-522.25 682.25,-503 782.25,-503 782.25,-522.25"/>
-<text text-anchor="middle" x="732.25" y="-508.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node36 -->
-<g id="edge54_Node000033_Node000036" class="edge">
-<title>Node33&#45;&gt;Node36</title>
-<g id="a_edge54_Node000033_Node000036"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M612.11,-477.96C628.16,-483.66 645.68,-489.62 662,-494.62 667.5,-496.31 673.28,-497.98 679.05,-499.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="678.05,-502.93 688.61,-502.15 679.87,-496.17 678.05,-502.93"/>
-</a>
-</g>
-</g>
-<!-- Node37 -->
-<g id="Node000037" class="node">
-<title>Node37</title>
-<g id="a_Node000037"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ios/eof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="777.38,-485.25 687.12,-485.25 687.12,-466 777.38,-466 777.38,-485.25"/>
-<text text-anchor="middle" x="732.25" y="-471.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::eof</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node37 -->
-<g id="edge56_Node000033_Node000037" class="edge">
-<title>Node33&#45;&gt;Node37</title>
-<g id="a_edge56_Node000033_Node000037"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M617.55,-463.38C636.41,-465.41 656.96,-467.62 675.34,-469.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="674.95,-473.08 685.27,-470.67 675.7,-466.12 674.95,-473.08"/>
-</a>
-</g>
-</g>
-<!-- Node38 -->
-<g id="Node000038" class="node">
-<title>Node38</title>
-<g id="a_Node000038"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="764.25,-448.25 700.25,-448.25 700.25,-429 764.25,-429 764.25,-448.25"/>
-<text text-anchor="middle" x="732.25" y="-434.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node38 -->
-<g id="edge58_Node000033_Node000038" class="edge">
-<title>Node33&#45;&gt;Node38</title>
-<g id="a_edge58_Node000033_Node000038"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M617.55,-450.23C641.11,-447.82 667.33,-445.15 688.65,-442.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="688.84,-446.47 698.43,-441.97 688.13,-439.51 688.84,-446.47"/>
-</a>
-</g>
-</g>
-<!-- Node39 -->
-<g id="Node000039" class="node">
-<title>Node39</title>
-<g id="a_Node000039"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="793.12,-410.88 671.38,-410.88 671.38,-380.38 793.12,-380.38 793.12,-410.88"/>
-<text text-anchor="start" x="679.38" y="-397.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::insert</text>
-<text text-anchor="middle" x="732.25" y="-386.12" font-family="Helvetica,sans-Serif" font-size="10.00">_element</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node39 -->
-<g id="edge59_Node000033_Node000039" class="edge">
-<title>Node33&#45;&gt;Node39</title>
-<g id="a_edge59_Node000033_Node000039"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M616.56,-435.29C635.58,-428.71 656.41,-421.51 675.04,-415.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="675.98,-418.44 684.29,-411.87 673.69,-411.83 675.98,-418.44"/>
-</a>
-</g>
-</g>
-<!-- Node40 -->
-<g id="Node000040" class="node">
-<title>Node40</title>
-<g id="a_Node000040"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="787.5,-362.25 677,-362.25 677,-343 787.5,-343 787.5,-362.25"/>
-<text text-anchor="middle" x="732.25" y="-348.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node40 -->
-<g id="edge60_Node000033_Node000040" class="edge">
-<title>Node33&#45;&gt;Node40</title>
-<g id="a_edge60_Node000033_Node000040"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M576.02,-435.51C596.41,-416.27 628.97,-388.37 662,-371.62 665.72,-369.74 669.65,-368.02 673.68,-366.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="674.75,-369.79 683.03,-363.18 672.44,-363.18 674.75,-369.79"/>
-</a>
-</g>
-</g>
-<!-- Node41 -->
-<g id="Node000041" class="node">
-<title>Node41</title>
-<g id="a_Node000041"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="798.38,-682.88 666.12,-682.88 666.12,-652.38 798.38,-652.38 798.38,-682.88"/>
-<text text-anchor="start" x="674.12" y="-669.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::minmax</text>
-<text text-anchor="middle" x="732.25" y="-658.12" font-family="Helvetica,sans-Serif" font-size="10.00">_scaler</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node41 -->
-<g id="edge61_Node000033_Node000041" class="edge">
-<title>Node33&#45;&gt;Node41</title>
-<g id="a_edge61_Node000033_Node000041"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M568.09,-477.94C587.11,-507.88 624.1,-563.44 662,-605.62 674.53,-619.57 689.95,-633.63 703.06,-644.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="700.63,-647.36 710.54,-651.11 705.13,-642 700.63,-647.36"/>
-</a>
-</g>
-</g>
-<!-- Node43 -->
-<g id="Node000043" class="node">
-<title>Node43</title>
-<g id="a_Node000043"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="781.12,-325.25 683.38,-325.25 683.38,-306 781.12,-306 781.12,-325.25"/>
-<text text-anchor="middle" x="732.25" y="-311.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node43 -->
-<g id="edge68_Node000033_Node000043" class="edge">
-<title>Node33&#45;&gt;Node43</title>
-<g id="a_edge68_Node000033_Node000043"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M567.61,-435.31C585.28,-407.61 619.86,-359.71 662,-333.62 665.32,-331.57 668.87,-329.75 672.55,-328.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="673.62,-331.47 681.72,-324.64 671.13,-324.92 673.62,-331.47"/>
-</a>
-</g>
-</g>
-<!-- Node44 -->
-<g id="Node000044" class="node">
-<title>Node44</title>
-<g id="a_Node000044"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="802.12,-288.25 662.38,-288.25 662.38,-269 802.12,-269 802.12,-288.25"/>
-<text text-anchor="middle" x="732.25" y="-274.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node44 -->
-<g id="edge69_Node000033_Node000044" class="edge">
-<title>Node33&#45;&gt;Node44</title>
-<g id="a_edge69_Node000033_Node000044"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M563.15,-435.35C577.73,-400.78 611.31,-332.63 662,-296.62 663.39,-295.64 664.84,-294.7 666.32,-293.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="667.85,-296.96 675.25,-289.38 664.73,-290.7 667.85,-296.96"/>
-</a>
-</g>
-</g>
-<!-- Node45 -->
-<g id="Node000045" class="node">
-<title>Node45</title>
-<g id="a_Node000045"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="789,-250.88 675.5,-250.88 675.5,-220.38 789,-220.38 789,-250.88"/>
-<text text-anchor="start" x="683.5" y="-237.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop</text>
-<text text-anchor="middle" x="732.25" y="-226.12" font-family="Helvetica,sans-Serif" font-size="10.00">_front</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node45 -->
-<g id="edge70_Node000033_Node000045" class="edge">
-<title>Node33&#45;&gt;Node45</title>
-<g id="a_edge70_Node000033_Node000045"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M560.73,-435.53C572.9,-395.51 604.69,-308.21 662,-259.62 663.12,-258.68 664.28,-257.76 665.47,-256.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="667.26,-259.9 673.9,-251.64 663.56,-253.96 667.26,-259.9"/>
-</a>
-</g>
-</g>
-<!-- Node46 -->
-<g id="Node000046" class="node">
-<title>Node46</title>
-<g id="a_Node000046"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="759.38,-202.25 705.12,-202.25 705.12,-183 759.38,-183 759.38,-202.25"/>
-<text text-anchor="middle" x="732.25" y="-188.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stod</text>
-</a>
-</g>
-</g>
-<!-- Node33&#45;&gt;Node46 -->
-<g id="edge72_Node000033_Node000046" class="edge">
-<title>Node33&#45;&gt;Node46</title>
-<g id="a_edge72_Node000033_Node000046"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M557.93,-435.3C565.9,-387.74 591.78,-272.37 662,-211.62 670.84,-203.98 682.49,-199.38 693.71,-196.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="694.06,-200.13 703.18,-194.75 692.69,-193.27 694.06,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node41&#45;&gt;Node7 -->
-<g id="edge62_Node000041_Node000007" class="edge">
-<title>Node41&#45;&gt;Node7</title>
-<g id="a_edge62_Node000041_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M779.04,-651.88C826.23,-638.38 900.95,-624.69 959.5,-649.62 992.91,-663.85 1019.65,-698.02 1034.13,-719.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1031.11,-721.7 1039.42,-728.27 1037.02,-717.95 1031.11,-721.7"/>
-</a>
-</g>
-</g>
-<!-- Node41&#45;&gt;Node8 -->
-<g id="edge63_Node000041_Node000008" class="edge">
-<title>Node41&#45;&gt;Node8</title>
-<g id="a_edge63_Node000041_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M798.65,-663.24C857.04,-660.84 936.75,-661.78 959.5,-682.62 1036.75,-753.42 942.79,-825.06 995.5,-915.62 1000.9,-924.9 1009.34,-932.83 1017.78,-939.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1015.68,-941.94 1025.91,-944.69 1019.63,-936.16 1015.68,-941.94"/>
-</a>
-</g>
-</g>
-<!-- Node41&#45;&gt;Node9 -->
-<g id="edge64_Node000041_Node000009" class="edge">
-<title>Node41&#45;&gt;Node9</title>
-<g id="a_edge64_Node000041_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M745.96,-683.05C761.08,-702 786.31,-735.59 802.5,-767.62 824.75,-811.65 804.55,-836.83 838.5,-872.62 838.87,-873.02 839.25,-873.41 839.64,-873.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="837.46,-876.53 847.48,-879.98 841.8,-871.04 837.46,-876.53"/>
-</a>
-</g>
-</g>
-<!-- Node41&#45;&gt;Node26 -->
-<g id="edge66_Node000041_Node000026" class="edge">
-<title>Node41&#45;&gt;Node26</title>
-<g id="a_edge66_Node000041_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M798.84,-681.16C820.29,-685.59 843.32,-690.34 861.78,-694.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="860.93,-697.55 871.43,-696.14 862.35,-690.69 860.93,-697.55"/>
-</a>
-</g>
-</g>
-<!-- Node41&#45;&gt;Node29 -->
-<g id="edge67_Node000041_Node000029" class="edge">
-<title>Node41&#45;&gt;Node29</title>
-<g id="a_edge67_Node000041_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M782.77,-651.99C789.9,-648.35 796.76,-643.93 802.5,-638.62 828.19,-614.88 811.63,-591.02 838.5,-568.62 840.6,-566.88 842.86,-565.3 845.24,-563.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="846.72,-567.04 854.16,-559.5 843.64,-560.76 846.72,-567.04"/>
-</a>
-</g>
-</g>
-<!-- Node42 -->
-<g id="Node000042" class="node">
-<title>Node42</title>
-<g id="a_Node000042"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="926.12,-597.25 871.88,-597.25 871.88,-578 926.12,-578 926.12,-597.25"/>
-<text text-anchor="middle" x="899" y="-583.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node41&#45;&gt;Node42 -->
-<g id="edge65_Node000041_Node000042" class="edge">
-<title>Node41&#45;&gt;Node42</title>
-<g id="a_edge65_Node000041_Node000042"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M775.43,-651.92C784.56,-647.98 794.02,-643.48 802.5,-638.62 819.86,-628.69 821.08,-621.45 838.5,-611.62 845.56,-607.65 853.41,-603.99 861.03,-600.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="862.15,-604.12 870.14,-597.16 859.55,-597.62 862.15,-604.12"/>
-</a>
-</g>
-</g>
-<!-- Node47&#45;&gt;Node14 -->
-<g id="edge74_Node000047_Node000014" class="edge">
-<title>Node47&#45;&gt;Node14</title>
-<g id="a_edge74_Node000047_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M438.94,-1175.77C449.17,-1177.92 459.91,-1180.16 470.53,-1182.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="469.54,-1185.76 480.05,-1184.38 470.98,-1178.91 469.54,-1185.76"/>
-</a>
-</g>
-</g>
-<!-- Node48&#45;&gt;Node7 -->
-<g id="edge76_Node000048_Node000007" class="edge">
-<title>Node48&#45;&gt;Node7</title>
-<g id="a_edge76_Node000048_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M792.25,-776.31C807.18,-771.54 823.3,-766.93 838.5,-763.62 897.17,-750.89 966.73,-744.59 1008.56,-741.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1008.59,-745.23 1018.34,-741.09 1008.13,-738.25 1008.59,-745.23"/>
-</a>
-</g>
-</g>
-<!-- Node48&#45;&gt;Node9 -->
-<g id="edge77_Node000048_Node000009" class="edge">
-<title>Node48&#45;&gt;Node9</title>
-<g id="a_edge77_Node000048_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M789.06,-818.86C793.78,-821.52 798.34,-824.44 802.5,-827.62 822.85,-843.17 817.95,-857.33 838.5,-872.62 839.81,-873.6 841.17,-874.55 842.56,-875.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="840.46,-878.28 850.87,-880.25 843.95,-872.22 840.46,-878.28"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph.map b/d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph.map
deleted file mode 100644
index 3ac3787a8..000000000
--- a/d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="machine_learning::neural_network::activations::relu" name="machine_learning::neural_network::activations::relu">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,180,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="60,29,58,19,63,11,75,5,93,3,111,5,123,11,120,16,110,10,92,8,76,10,67,14,63,20,65,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="228,37,300,62"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="180,47,212,47,212,52,180,52"/>
-</map>
diff --git a/d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph.md5 b/d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph.md5
deleted file mode 100644
index e81489ebc..000000000
--- a/d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b9985b49c0c438862f970c86ba4d9947
\ No newline at end of file
diff --git a/d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph.svg b/d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph.svg
deleted file mode 100644
index c0b0fb1ad..000000000
--- a/d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::activations::relu Pages: 1 -->
-<svg width="229pt" height="57pt"
- viewBox="0.00 0.00 229.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>machine_learning::neural_network::activations::relu</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="130.75,-30.5 0,-30.5 0,0 130.75,0 130.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="middle" x="65.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::activations::relu</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.6,-30.99C37.96,-40.06 45.55,-48.5 65.38,-48.5 76.22,-48.5 83.4,-45.97 86.92,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.38,-42.81 87.98,-32.49 83.42,-42.05 90.38,-42.81"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221,-24.88 166.75,-24.88 166.75,-5.63 221,-5.63 221,-24.88"/>
-<text text-anchor="middle" x="193.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.11,-15.25C139.33,-15.25 147.51,-15.25 155.11,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.96,-18.75 164.96,-15.25 154.96,-11.75 154.96,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph_org.svg b/d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph_org.svg
deleted file mode 100644
index dea145241..000000000
--- a/d2/d58/neural__network_8cpp_af8f264600754602b6a9ea19cc690e50e_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::activations::relu Pages: 1 -->
-<svg width="229pt" height="57pt"
- viewBox="0.00 0.00 229.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>machine_learning::neural_network::activations::relu</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="130.75,-30.5 0,-30.5 0,0 130.75,0 130.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="middle" x="65.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::activations::relu</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.6,-30.99C37.96,-40.06 45.55,-48.5 65.38,-48.5 76.22,-48.5 83.4,-45.97 86.92,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.38,-42.81 87.98,-32.49 83.42,-42.05 90.38,-42.81"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221,-24.88 166.75,-24.88 166.75,-5.63 221,-5.63 221,-24.88"/>
-<text text-anchor="middle" x="193.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.11,-15.25C139.33,-15.25 147.51,-15.25 155.11,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.96,-18.75 164.96,-15.25 154.96,-11.75 154.96,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d58/neural__network_8cpp_source.html b/d2/d58/neural__network_8cpp_source.html
new file mode 100644
index 000000000..1ce37116f
--- /dev/null
+++ b/d2/d58/neural__network_8cpp_source.html
@@ -0,0 +1,800 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: machine_learning/neural_network.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d2/d58/neural__network_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">neural_network.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d2/d58/neural__network_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &lt;chrono&gt;</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;fstream&gt;</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#include &lt;sstream&gt;</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="preprocessor">#include &lt;string&gt;</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="preprocessor">#include &lt;valarray&gt;</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &quot;<a class="code" href="../../d8/d95/vector__ops_8hpp.html">vector_ops.hpp</a>&quot;</span>  <span class="comment">// Custom header file for vector operations</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d77/namespacemachine__learning.html">machine_learning</a> {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/d2e/namespaceneural__network.html">neural_network</a> {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d39/namespaceactivations.html">activations</a> {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"><a class="line" href="../../d2/d58/neural__network_8cpp.html#a23aa9d32bcbcd65cfc85f0a41e2afadc">   60</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/d58/neural__network_8cpp.html#a23aa9d32bcbcd65cfc85f0a41e2afadc">sigmoid</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x) { <span class="keywordflow">return</span> 1.0 / (1.0 + std::exp(-x)); }</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../d2/d58/neural__network_8cpp.html#a76eb66212d577f948a457b6e29d87c46">   67</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/d58/neural__network_8cpp.html#a76eb66212d577f948a457b6e29d87c46">dsigmoid</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x) { <span class="keywordflow">return</span> x * (1 - x); }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="../../d2/d58/neural__network_8cpp.html#af8f264600754602b6a9ea19cc690e50e">   74</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/d58/neural__network_8cpp.html#af8f264600754602b6a9ea19cc690e50e">relu</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x) { <span class="keywordflow">return</span> std::max(0.0, x); }</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="../../d2/d58/neural__network_8cpp.html#aa69e95a34054d7989bf446f96b2ffaf9">   81</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/d58/neural__network_8cpp.html#aa69e95a34054d7989bf446f96b2ffaf9">drelu</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x) { <span class="keywordflow">return</span> x &gt;= 0.0 ? 1.0 : 0.0; }</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"><a class="line" href="../../d2/d58/neural__network_8cpp.html#a371aa7dd5d5add0143d1756bb0a1b32f">   88</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/d58/neural__network_8cpp.html#a371aa7dd5d5add0143d1756bb0a1b32f">tanh</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x) { <span class="keywordflow">return</span> 2 / (1 + std::exp(-2 * x)) - 1; }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="../../d2/d58/neural__network_8cpp.html#a2a5e874b9774aa5362dbcf288828b95c">   95</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/d58/neural__network_8cpp.html#a2a5e874b9774aa5362dbcf288828b95c">dtanh</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x) { <span class="keywordflow">return</span> 1 - x * x; }</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>}  <span class="comment">// namespace activations</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d3/d17/namespaceutil__functions.html">util_functions</a> {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"><a class="line" href="../../d2/d58/neural__network_8cpp.html#a45d3e30406712ada3d9713ece3c1b153">  106</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/d58/neural__network_8cpp.html#a45d3e30406712ada3d9713ece3c1b153">square</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x) { <span class="keywordflow">return</span> x * x; }</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"><a class="line" href="../../d2/d58/neural__network_8cpp.html#a32c00da08f2cf641dd336270f6e3c407">  112</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/d58/neural__network_8cpp.html#a32c00da08f2cf641dd336270f6e3c407">identity_function</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x) { <span class="keywordflow">return</span> x; }</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>}  <span class="comment">// namespace util_functions</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a> {</div>
+<div class="foldopen" id="foldopen00125" data-start="{" data-end="};">
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"><a class="line" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">  125</a></span><span class="keyword">class </span><a class="code hl_class" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">DenseLayer</a> {</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    <span class="comment">// To store activation function and it&#39;s derivative</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    double (*activation_function)(<span class="keyword">const</span> <span class="keywordtype">double</span> &amp;);</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    double (*dactivation_function)(<span class="keyword">const</span> <span class="keywordtype">double</span> &amp;);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="keywordtype">int</span> neurons;             <span class="comment">// To store number of neurons (used in summary)</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    std::string activation;  <span class="comment">// To store activation name (used in summary)</span></div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; kernel;  <span class="comment">// To store kernel (aka weights)</span></div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span> </div>
+<div class="foldopen" id="foldopen00141" data-start="{" data-end="}">
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"><a class="line" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a11046825be0b6dbb73fbe834aa49200e">  141</a></span>    <a class="code hl_function" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a11046825be0b6dbb73fbe834aa49200e">DenseLayer</a>(<span class="keyword">const</span> <span class="keywordtype">int</span> &amp;neurons, <span class="keyword">const</span> std::string &amp;activation,</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>               <span class="keyword">const</span> std::pair&lt;size_t, size_t&gt; &amp;kernel_shape,</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>               <span class="keyword">const</span> <span class="keywordtype">bool</span> &amp;random_kernel) {</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        <span class="comment">// Choosing activation (and it&#39;s derivative)</span></div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        <span class="keywordflow">if</span> (activation == <span class="stringliteral">&quot;sigmoid&quot;</span>) {</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>            activation_function = neural_network::activations::sigmoid;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>            dactivation_function = neural_network::activations::sigmoid;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (activation == <span class="stringliteral">&quot;relu&quot;</span>) {</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>            activation_function = neural_network::activations::relu;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>            dactivation_function = neural_network::activations::drelu;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (activation == <span class="stringliteral">&quot;tanh&quot;</span>) {</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>            activation_function = neural_network::activations::tanh;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>            dactivation_function = neural_network::activations::dtanh;</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (activation == <span class="stringliteral">&quot;none&quot;</span>) {</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>            <span class="comment">// Set identity function in casse of none is supplied</span></div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>            activation_function =</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>                neural_network::util_functions::identity_function;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>            dactivation_function =</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>                neural_network::util_functions::identity_function;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>            <span class="comment">// If supplied activation is invalid</span></div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Invalid argument. Expected {none, sigmoid, relu, &quot;</span></div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>                         <span class="stringliteral">&quot;tanh} got &quot;</span>;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>            std::cerr &lt;&lt; activation &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>            std::exit(EXIT_FAILURE);</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>        }</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        this-&gt;activation = activation;  <span class="comment">// Setting activation name</span></div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>        this-&gt;neurons = neurons;        <span class="comment">// Setting number of neurons</span></div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        <span class="comment">// Initialize kernel according to flag</span></div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>        <span class="keywordflow">if</span> (random_kernel) {</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>            <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905">uniform_random_initialization</a>(kernel, kernel_shape, -1.0, 1.0);</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>            <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4">unit_matrix_initialization</a>(kernel, kernel_shape);</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        }</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00183" data-start="{" data-end="}">
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"><a class="line" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#af136ec31dbd35b1be2eb9a057677c704">  183</a></span>    <a class="code hl_function" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#af136ec31dbd35b1be2eb9a057677c704">DenseLayer</a>(<span class="keyword">const</span> <span class="keywordtype">int</span> &amp;neurons, <span class="keyword">const</span> std::string &amp;activation,</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>               <span class="keyword">const</span> std::vector&lt;std::valarray&lt;double&gt;&gt; &amp;kernel) {</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        <span class="comment">// Choosing activation (and it&#39;s derivative)</span></div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        <span class="keywordflow">if</span> (activation == <span class="stringliteral">&quot;sigmoid&quot;</span>) {</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>            activation_function = neural_network::activations::sigmoid;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>            dactivation_function = neural_network::activations::sigmoid;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (activation == <span class="stringliteral">&quot;relu&quot;</span>) {</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>            activation_function = neural_network::activations::relu;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>            dactivation_function = neural_network::activations::drelu;</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (activation == <span class="stringliteral">&quot;tanh&quot;</span>) {</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>            activation_function = neural_network::activations::tanh;</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>            dactivation_function = neural_network::activations::dtanh;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (activation == <span class="stringliteral">&quot;none&quot;</span>) {</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>            <span class="comment">// Set identity function in casse of none is supplied</span></div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>            activation_function =</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>                neural_network::util_functions::identity_function;</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>            dactivation_function =</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>                neural_network::util_functions::identity_function;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>            <span class="comment">// If supplied activation is invalid</span></div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Invalid argument. Expected {none, sigmoid, relu, &quot;</span></div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>                         <span class="stringliteral">&quot;tanh} got &quot;</span>;</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>            std::cerr &lt;&lt; activation &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>            std::exit(EXIT_FAILURE);</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>        }</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>        this-&gt;activation = activation;  <span class="comment">// Setting activation name</span></div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>        this-&gt;neurons = neurons;        <span class="comment">// Setting number of neurons</span></div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>        this-&gt;kernel = kernel;          <span class="comment">// Setting supplied kernel values</span></div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    }</div>
+</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span> </div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"><a class="line" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2">  219</a></span>    <a class="code hl_function" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2">DenseLayer</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">DenseLayer</a> &amp;layer) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span> </div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"><a class="line" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ac9cda9453c4a0caf5bae7f9213b019a0">  224</a></span>    <a class="code hl_function" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ac9cda9453c4a0caf5bae7f9213b019a0">~DenseLayer</a>() = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span> </div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"><a class="line" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ae077132526d2863e46aa77cb0f7d6aa2">  229</a></span>    <a class="code hl_class" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">DenseLayer</a> &amp;<a class="code hl_function" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ae077132526d2863e46aa77cb0f7d6aa2">operator=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">DenseLayer</a> &amp;layer) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span> </div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"><a class="line" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6c859e3737aa88b29854df0347b29f4e">  234</a></span>    <a class="code hl_function" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6c859e3737aa88b29854df0347b29f4e">DenseLayer</a>(<a class="code hl_class" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">DenseLayer</a> &amp;&amp;) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span> </div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"><a class="line" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a19aaccad279b22dbbb6c55e5697b4114">  239</a></span>    <a class="code hl_class" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">DenseLayer</a> &amp;<a class="code hl_function" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a19aaccad279b22dbbb6c55e5697b4114">operator=</a>(<a class="code hl_class" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">DenseLayer</a> &amp;&amp;) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>};</div>
+</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>}  <span class="comment">// namespace layers</span></div>
+<div class="foldopen" id="foldopen00247" data-start="{" data-end="};">
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">  247</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> {</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    std::vector&lt;neural_network::layers::DenseLayer&gt; <a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>;  <span class="comment">// To store layers</span></div>
+<div class="foldopen" id="foldopen00256" data-start="{" data-end="}">
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4c4c6f63ab965317f9471518ee931b89">  256</a></span>    <a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4c4c6f63ab965317f9471518ee931b89">NeuralNetwork</a>(</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>        <span class="keyword">const</span> std::vector&lt;std::pair&lt;int, std::string&gt;&gt; &amp;config,</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>        <span class="keyword">const</span> std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; &amp;kernels) {</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>        <span class="comment">// First layer should not have activation</span></div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>        <span class="keywordflow">if</span> (config.begin()-&gt;second != <span class="stringliteral">&quot;none&quot;</span>) {</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>            std::cerr</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>                &lt;&lt; <span class="stringliteral">&quot;First layer can&#39;t have activation other than none got &quot;</span></div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>                &lt;&lt; config.begin()-&gt;second;</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>            std::cerr &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>            std::exit(EXIT_FAILURE);</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>        }</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>        <span class="comment">// Network should have atleast two layers</span></div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>        <span class="keywordflow">if</span> (config.size() &lt;= 1) {</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Invalid size of network, &quot;</span>;</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Atleast two layers are required&quot;</span>;</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>            std::exit(EXIT_FAILURE);</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>        }</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>        <span class="comment">// Reconstructing all pretrained layers</span></div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; config.size(); i++) {</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>            <a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>.emplace_back(<a class="code hl_class" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">neural_network::layers::DenseLayer</a>(</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>                config[i].first, config[i].second, kernels[i]));</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>        }</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;INFO: Network constructed successfully&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>    }</div>
+</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>    std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt;</div>
+<div class="foldopen" id="foldopen00289" data-start="{" data-end="}">
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b">  289</a></span>    <a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b">__detailed_single_prediction</a>(<span class="keyword">const</span> std::vector&lt;std::valarray&lt;double&gt;&gt; &amp;X) {</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>        std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; details;</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>        std::vector&lt;std::valarray&lt;double&gt;&gt; current_pass = X;</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>        details.emplace_back(X);</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>        <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;l : <a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>) {</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>            current_pass = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9">multiply</a>(current_pass, l.kernel);</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>            current_pass = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">apply_function</a>(current_pass, l.activation_function);</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>            details.emplace_back(current_pass);</div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>        }</div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>        <span class="keywordflow">return</span> details;</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>    }</div>
+</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span> </div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ae7cf126a3a8f9d20c81b21584d061a08">  306</a></span>    <a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ae7cf126a3a8f9d20c81b21584d061a08">NeuralNetwork</a>() = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span> </div>
+<div class="foldopen" id="foldopen00313" data-start="{" data-end="}">
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a62151b0398a2536be60d950e10ffe9a8">  313</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a62151b0398a2536be60d950e10ffe9a8">NeuralNetwork</a>(</div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>        <span class="keyword">const</span> std::vector&lt;std::pair&lt;int, std::string&gt;&gt; &amp;config) {</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>        <span class="comment">// First layer should not have activation</span></div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>        <span class="keywordflow">if</span> (config.begin()-&gt;second != <span class="stringliteral">&quot;none&quot;</span>) {</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>            std::cerr</div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>                &lt;&lt; <span class="stringliteral">&quot;First layer can&#39;t have activation other than none got &quot;</span></div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>                &lt;&lt; config.begin()-&gt;second;</div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>            std::cerr &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>            std::exit(EXIT_FAILURE);</div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>        }</div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>        <span class="comment">// Network should have atleast two layers</span></div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>        <span class="keywordflow">if</span> (config.size() &lt;= 1) {</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Invalid size of network, &quot;</span>;</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Atleast two layers are required&quot;</span>;</div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>            std::exit(EXIT_FAILURE);</div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>        }</div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>        <span class="comment">// Separately creating first layer so it can have unit matrix</span></div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>        <span class="comment">// as kernel.</span></div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>        <a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>.push_back(<a class="code hl_class" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">neural_network::layers::DenseLayer</a>(</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>            config[0].first, config[0].second,</div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>            {config[0].first, config[0].first}, <span class="keyword">false</span>));</div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>        <span class="comment">// Creating remaining layers</span></div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 1; i &lt; config.size(); i++) {</div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>            <a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>.push_back(<a class="code hl_class" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">neural_network::layers::DenseLayer</a>(</div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>                config[i].first, config[i].second,</div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>                {config[i - 1].first, config[i].first}, <span class="keyword">true</span>));</div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>        }</div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;INFO: Network constructed successfully&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>    }</div>
+</div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span> </div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a176b955c90ae57d7dbc3c63f27c84c75">  350</a></span>    <a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a176b955c90ae57d7dbc3c63f27c84c75">NeuralNetwork</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> &amp;model) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span> </div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a8973f687738ddd76f93b5562feae4027">  355</a></span>    <a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a8973f687738ddd76f93b5562feae4027">~NeuralNetwork</a>() = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span> </div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58a9614e4c6d4ca672d3358e99a3404f">  360</a></span>    <a class="code hl_class" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> &amp;<a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58a9614e4c6d4ca672d3358e99a3404f">operator=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> &amp;model) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span> </div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a173bb71780af6953ec2e307a4c74b025">  365</a></span>    <a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a173bb71780af6953ec2e307a4c74b025">NeuralNetwork</a>(<a class="code hl_class" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> &amp;&amp;) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span> </div>
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2c49bfebf9b859d5ceb26035d3003601">  370</a></span>    <a class="code hl_class" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> &amp;<a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2c49bfebf9b859d5ceb26035d3003601">operator=</a>(<a class="code hl_class" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> &amp;&amp;) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span> </div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>    std::pair&lt;std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt;,</div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>              std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt;&gt;</div>
+<div class="foldopen" id="foldopen00382" data-start="{" data-end="}">
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d">  382</a></span>    <a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d">get_XY_from_csv</a>(<span class="keyword">const</span> std::string &amp;file_name, <span class="keyword">const</span> <span class="keywordtype">bool</span> &amp;last_label,</div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>                    <span class="keyword">const</span> <span class="keywordtype">bool</span> &amp;normalize, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;slip_lines = 1) {</div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>        std::ifstream in_file;                          <span class="comment">// Ifstream to read file</span></div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>        in_file.open(file_name.c_str(), std::ios::in);  <span class="comment">// Open file</span></div>
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>        <span class="comment">// If there is any problem in opening file</span></div>
+<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>        <span class="keywordflow">if</span> (!in_file.is_open()) {</div>
+<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Unable to open file: &quot;</span> &lt;&lt; file_name &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>            std::exit(EXIT_FAILURE);</div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>        }</div>
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>        std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; X,</div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>            Y;             <span class="comment">// To store X and Y</span></div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>        std::string line;  <span class="comment">// To store each line</span></div>
+<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>        <span class="comment">// Skip lines</span></div>
+<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; slip_lines; i++) {</div>
+<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>            std::getline(in_file, line, <span class="charliteral">&#39;\n&#39;</span>);  <span class="comment">// Ignore line</span></div>
+<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>        }</div>
+<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>        <span class="comment">// While file has information</span></div>
+<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span>        <span class="keywordflow">while</span> (!in_file.eof() &amp;&amp; std::getline(in_file, line, <span class="charliteral">&#39;\n&#39;</span>)) {</div>
+<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>            std::valarray&lt;double&gt; x_data,</div>
+<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>                y_data;                  <span class="comment">// To store single sample and label</span></div>
+<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>            std::stringstream ss(line);  <span class="comment">// Constructing stringstream from line</span></div>
+<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>            std::string token;  <span class="comment">// To store each token in line (seprated by &#39;,&#39;)</span></div>
+<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span>            <span class="keywordflow">while</span> (std::getline(ss, token, <span class="charliteral">&#39;,&#39;</span>)) {  <span class="comment">// For each token</span></div>
+<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>                <span class="comment">// Insert numerical value of token in x_data</span></div>
+<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>                x_data = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd">insert_element</a>(x_data, std::stod(token));</div>
+<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>            }</div>
+<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>            <span class="comment">// If label is in last column</span></div>
+<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>            <span class="keywordflow">if</span> (last_label) {</div>
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>                y_data.resize(this-&gt;layers.back().neurons);</div>
+<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>                <span class="comment">// If task is classification</span></div>
+<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>                <span class="keywordflow">if</span> (y_data.size() &gt; 1) {</div>
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>                    y_data[x_data[x_data.size() - 1]] = 1;</div>
+<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>                }</div>
+<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>                <span class="comment">// If task is regrssion (of single value)</span></div>
+<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>                <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>                    y_data[0] = x_data[x_data.size() - 1];</div>
+<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>                }</div>
+<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>                x_data = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d">pop_back</a>(x_data);  <span class="comment">// Remove label from x_data</span></div>
+<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>                y_data.resize(this-&gt;layers.back().neurons);</div>
+<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>                <span class="comment">// If task is classification</span></div>
+<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span>                <span class="keywordflow">if</span> (y_data.size() &gt; 1) {</div>
+<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span>                    y_data[x_data[x_data.size() - 1]] = 1;</div>
+<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span>                }</div>
+<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>                <span class="comment">// If task is regrssion (of single value)</span></div>
+<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>                <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span>                    y_data[0] = x_data[x_data.size() - 1];</div>
+<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>                }</div>
+<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span>                x_data = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093">pop_front</a>(x_data);  <span class="comment">// Remove label from x_data</span></div>
+<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>            }</div>
+<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>            <span class="comment">// Push collected X_data and y_data in X and Y</span></div>
+<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>            X.push_back({x_data});</div>
+<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>            Y.push_back({y_data});</div>
+<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>        }</div>
+<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span>        <span class="comment">// Normalize training data if flag is set</span></div>
+<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>        <span class="keywordflow">if</span> (normalize) {</div>
+<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>            <span class="comment">// Scale data between 0 and 1 using min-max scaler</span></div>
+<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>            X = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26">minmax_scaler</a>(X, 0.01, 1.0);</div>
+<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>        }</div>
+<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>        in_file.close();         <span class="comment">// Closing file</span></div>
+<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>        <span class="keywordflow">return</span> make_pair(X, Y);  <span class="comment">// Return pair of X and Y</span></div>
+<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span>    }</div>
+</div>
+<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span> </div>
+<div class="foldopen" id="foldopen00451" data-start="{" data-end="}">
+<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f">  451</a></span>    std::vector&lt;std::valarray&lt;double&gt;&gt; <a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f">single_predict</a>(</div>
+<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span>        <span class="keyword">const</span> std::vector&lt;std::valarray&lt;double&gt;&gt; &amp;X) {</div>
+<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>        <span class="comment">// Get activations of all layers</span></div>
+<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>        <span class="keyword">auto</span> <a class="code hl_namespace" href="../../d5/d39/namespaceactivations.html">activations</a> = this-&gt;<a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b">__detailed_single_prediction</a>(X);</div>
+<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>        <span class="comment">// Return activations of last layer (actual predicted values)</span></div>
+<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>        <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../d5/d39/namespaceactivations.html">activations</a>.back();</div>
+<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>    }</div>
+</div>
+<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span> </div>
+<div class="foldopen" id="foldopen00464" data-start="{" data-end="}">
+<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a88bf9023ab3d4cdb61cf707c7cdfc86b">  464</a></span>    std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; <a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a88bf9023ab3d4cdb61cf707c7cdfc86b">batch_predict</a>(</div>
+<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span>        <span class="keyword">const</span> std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; &amp;X) {</div>
+<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span>        <span class="comment">// Store predicted values</span></div>
+<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span>        std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; predicted_batch(</div>
+<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span>            X.size());</div>
+<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; X.size(); i++) {  <span class="comment">// For every sample</span></div>
+<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span>            <span class="comment">// Push predicted values</span></div>
+<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span>            predicted_batch[i] = this-&gt;<a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f">single_predict</a>(X[i]);</div>
+<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>        }</div>
+<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span>        <span class="keywordflow">return</span> predicted_batch;  <span class="comment">// Return predicted values</span></div>
+<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span>    }</div>
+</div>
+<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span> </div>
+<div class="foldopen" id="foldopen00485" data-start="{" data-end="}">
+<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0">  485</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0">fit</a>(<span class="keyword">const</span> std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; &amp;X_,</div>
+<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span>             <span class="keyword">const</span> std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; &amp;Y_,</div>
+<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span>             <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;epochs = 100, <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;learning_rate = 0.01,</div>
+<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span>             <span class="keyword">const</span> <span class="keywordtype">size_t</span> &amp;batch_size = 32, <span class="keyword">const</span> <span class="keywordtype">bool</span> &amp;shuffle = <span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span>        std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; X = X_, Y = Y_;</div>
+<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span>        <span class="comment">// Both label and input data should have same size</span></div>
+<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>        <span class="keywordflow">if</span> (X.size() != Y.size()) {</div>
+<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;X and Y in fit have different sizes&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span>            std::exit(EXIT_FAILURE);</div>
+<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span>        }</div>
+<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;INFO: Training Started&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> epoch = 1; epoch &lt;= epochs; epoch++) {  <span class="comment">// For every epoch</span></div>
+<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>            <span class="comment">// Shuffle X and Y if flag is set</span></div>
+<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>            <span class="keywordflow">if</span> (shuffle) {</div>
+<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span>                <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f">equal_shuffle</a>(X, Y);</div>
+<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>            }</div>
+<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span>            <span class="keyword">auto</span> start =</div>
+<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>                std::chrono::high_resolution_clock::now();  <span class="comment">// Start clock</span></div>
+<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span>            <span class="keywordtype">double</span> loss = 0,</div>
+<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span>                   acc = 0;  <span class="comment">// Initialize performance metrics with zero</span></div>
+<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span>            <span class="comment">// For each starting index of batch</span></div>
+<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> batch_start = 0; batch_start &lt; X.size();</div>
+<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>                 batch_start += batch_size) {</div>
+<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span>                <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = batch_start;</div>
+<div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span>                     i &lt; std::min(X.size(), batch_start + batch_size); i++) {</div>
+<div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span>                    std::vector&lt;std::valarray&lt;double&gt;&gt; grad, cur_error,</div>
+<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span>                        predicted;</div>
+<div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span>                    <span class="keyword">auto</span> <a class="code hl_namespace" href="../../d5/d39/namespaceactivations.html">activations</a> = this-&gt;<a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b">__detailed_single_prediction</a>(X[i]);</div>
+<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span>                    <span class="comment">// Gradients vector to store gradients for all layers</span></div>
+<div class="line"><a id="l00515" name="l00515"></a><span class="lineno">  515</span>                    <span class="comment">// They will be averaged and applied to kernel</span></div>
+<div class="line"><a id="l00516" name="l00516"></a><span class="lineno">  516</span>                    std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; gradients;</div>
+<div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span>                    gradients.resize(this-&gt;layers.size());</div>
+<div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span>                    <span class="comment">// First initialize gradients to zero</span></div>
+<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span>                    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; gradients.size(); i++) {</div>
+<div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span>                        <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e">zeroes_initialization</a>(</div>
+<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span>                            gradients[i], <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(this-&gt;layers[i].kernel));</div>
+<div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span>                    }</div>
+<div class="line"><a id="l00523" name="l00523"></a><span class="lineno">  523</span>                    predicted = <a class="code hl_namespace" href="../../d5/d39/namespaceactivations.html">activations</a>.back();  <span class="comment">// Predicted vector</span></div>
+<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span>                    cur_error = predicted - Y[i];    <span class="comment">// Absoulute error</span></div>
+<div class="line"><a id="l00525" name="l00525"></a><span class="lineno">  525</span>                    <span class="comment">// Calculating loss with MSE</span></div>
+<div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span>                    loss += <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a>(<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">apply_function</a>(</div>
+<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span>                        cur_error, neural_network::util_functions::square));</div>
+<div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span>                    <span class="comment">// If prediction is correct</span></div>
+<div class="line"><a id="l00529" name="l00529"></a><span class="lineno">  529</span>                    <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">argmax</a>(predicted) == <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">argmax</a>(Y[i])) {</div>
+<div class="line"><a id="l00530" name="l00530"></a><span class="lineno">  530</span>                        acc += 1;</div>
+<div class="line"><a id="l00531" name="l00531"></a><span class="lineno">  531</span>                    }</div>
+<div class="line"><a id="l00532" name="l00532"></a><span class="lineno">  532</span>                    <span class="comment">// For every layer (except first) starting from last one</span></div>
+<div class="line"><a id="l00533" name="l00533"></a><span class="lineno">  533</span>                    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = this-&gt;layers.size() - 1; j &gt;= 1; j--) {</div>
+<div class="line"><a id="l00534" name="l00534"></a><span class="lineno">  534</span>                        <span class="comment">// Backpropogating errors</span></div>
+<div class="line"><a id="l00535" name="l00535"></a><span class="lineno">  535</span>                        cur_error = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43">hadamard_product</a>(</div>
+<div class="line"><a id="l00536" name="l00536"></a><span class="lineno">  536</span>                            cur_error,</div>
+<div class="line"><a id="l00537" name="l00537"></a><span class="lineno">  537</span>                            <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">apply_function</a>(</div>
+<div class="line"><a id="l00538" name="l00538"></a><span class="lineno">  538</span>                                <a class="code hl_namespace" href="../../d5/d39/namespaceactivations.html">activations</a>[j + 1],</div>
+<div class="line"><a id="l00539" name="l00539"></a><span class="lineno">  539</span>                                this-&gt;layers[j].dactivation_function));</div>
+<div class="line"><a id="l00540" name="l00540"></a><span class="lineno">  540</span>                        <span class="comment">// Calculating gradient for current layer</span></div>
+<div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</span>                        grad = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9">multiply</a>(<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a">transpose</a>(<a class="code hl_namespace" href="../../d5/d39/namespaceactivations.html">activations</a>[j]), cur_error);</div>
+<div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span>                        <span class="comment">// Change error according to current kernel values</span></div>
+<div class="line"><a id="l00543" name="l00543"></a><span class="lineno">  543</span>                        cur_error = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9">multiply</a>(cur_error,</div>
+<div class="line"><a id="l00544" name="l00544"></a><span class="lineno">  544</span>                                             <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a">transpose</a>(this-&gt;layers[j].kernel));</div>
+<div class="line"><a id="l00545" name="l00545"></a><span class="lineno">  545</span>                        <span class="comment">// Adding gradient values to collection of gradients</span></div>
+<div class="line"><a id="l00546" name="l00546"></a><span class="lineno">  546</span>                        gradients[j] = gradients[j] + grad / double(batch_size);</div>
+<div class="line"><a id="l00547" name="l00547"></a><span class="lineno">  547</span>                    }</div>
+<div class="line"><a id="l00548" name="l00548"></a><span class="lineno">  548</span>                    <span class="comment">// Applying gradients</span></div>
+<div class="line"><a id="l00549" name="l00549"></a><span class="lineno">  549</span>                    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = this-&gt;layers.size() - 1; j &gt;= 1; j--) {</div>
+<div class="line"><a id="l00550" name="l00550"></a><span class="lineno">  550</span>                        <span class="comment">// Updating kernel (aka weights)</span></div>
+<div class="line"><a id="l00551" name="l00551"></a><span class="lineno">  551</span>                        this-&gt;layers[j].kernel = this-&gt;layers[j].kernel -</div>
+<div class="line"><a id="l00552" name="l00552"></a><span class="lineno">  552</span>                                                 gradients[j] * learning_rate;</div>
+<div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</span>                    }</div>
+<div class="line"><a id="l00554" name="l00554"></a><span class="lineno">  554</span>                }</div>
+<div class="line"><a id="l00555" name="l00555"></a><span class="lineno">  555</span>            }</div>
+<div class="line"><a id="l00556" name="l00556"></a><span class="lineno">  556</span>            <span class="keyword">auto</span> stop =</div>
+<div class="line"><a id="l00557" name="l00557"></a><span class="lineno">  557</span>                std::chrono::high_resolution_clock::now();  <span class="comment">// Stoping the clock</span></div>
+<div class="line"><a id="l00558" name="l00558"></a><span class="lineno">  558</span>            <span class="comment">// Calculate time taken by epoch</span></div>
+<div class="line"><a id="l00559" name="l00559"></a><span class="lineno">  559</span>            <span class="keyword">auto</span> duration =</div>
+<div class="line"><a id="l00560" name="l00560"></a><span class="lineno">  560</span>                std::chrono::duration_cast&lt;std::chrono::microseconds&gt;(stop -</div>
+<div class="line"><a id="l00561" name="l00561"></a><span class="lineno">  561</span>                                                                      start);</div>
+<div class="line"><a id="l00562" name="l00562"></a><span class="lineno">  562</span>            loss /= X.size();        <span class="comment">// Averaging loss</span></div>
+<div class="line"><a id="l00563" name="l00563"></a><span class="lineno">  563</span>            acc /= X.size();         <span class="comment">// Averaging accuracy</span></div>
+<div class="line"><a id="l00564" name="l00564"></a><span class="lineno">  564</span>            std::cout.precision(4);  <span class="comment">// set output precision to 4</span></div>
+<div class="line"><a id="l00565" name="l00565"></a><span class="lineno">  565</span>            <span class="comment">// Printing training stats</span></div>
+<div class="line"><a id="l00566" name="l00566"></a><span class="lineno">  566</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Training: Epoch &quot;</span> &lt;&lt; epoch &lt;&lt; <span class="charliteral">&#39;/&#39;</span> &lt;&lt; epochs;</div>
+<div class="line"><a id="l00567" name="l00567"></a><span class="lineno">  567</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;, Loss: &quot;</span> &lt;&lt; loss;</div>
+<div class="line"><a id="l00568" name="l00568"></a><span class="lineno">  568</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;, Accuracy: &quot;</span> &lt;&lt; acc;</div>
+<div class="line"><a id="l00569" name="l00569"></a><span class="lineno">  569</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;, Taken time: &quot;</span> &lt;&lt; duration.count() / 1e6</div>
+<div class="line"><a id="l00570" name="l00570"></a><span class="lineno">  570</span>                      &lt;&lt; <span class="stringliteral">&quot; seconds&quot;</span>;</div>
+<div class="line"><a id="l00571" name="l00571"></a><span class="lineno">  571</span>            std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00572" name="l00572"></a><span class="lineno">  572</span>        }</div>
+<div class="line"><a id="l00573" name="l00573"></a><span class="lineno">  573</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00574" name="l00574"></a><span class="lineno">  574</span>    }</div>
+</div>
+<div class="line"><a id="l00575" name="l00575"></a><span class="lineno">  575</span> </div>
+<div class="foldopen" id="foldopen00587" data-start="{" data-end="}">
+<div class="line"><a id="l00587" name="l00587"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff">  587</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff">fit_from_csv</a>(<span class="keyword">const</span> std::string &amp;file_name, <span class="keyword">const</span> <span class="keywordtype">bool</span> &amp;last_label,</div>
+<div class="line"><a id="l00588" name="l00588"></a><span class="lineno">  588</span>                      <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;epochs, <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;learning_rate,</div>
+<div class="line"><a id="l00589" name="l00589"></a><span class="lineno">  589</span>                      <span class="keyword">const</span> <span class="keywordtype">bool</span> &amp;normalize, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;slip_lines = 1,</div>
+<div class="line"><a id="l00590" name="l00590"></a><span class="lineno">  590</span>                      <span class="keyword">const</span> <span class="keywordtype">size_t</span> &amp;batch_size = 32,</div>
+<div class="line"><a id="l00591" name="l00591"></a><span class="lineno">  591</span>                      <span class="keyword">const</span> <span class="keywordtype">bool</span> &amp;shuffle = <span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00592" name="l00592"></a><span class="lineno">  592</span>        <span class="comment">// Getting training data from csv file</span></div>
+<div class="line"><a id="l00593" name="l00593"></a><span class="lineno">  593</span>        <span class="keyword">auto</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> =</div>
+<div class="line"><a id="l00594" name="l00594"></a><span class="lineno">  594</span>            this-&gt;<a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d">get_XY_from_csv</a>(file_name, last_label, normalize, slip_lines);</div>
+<div class="line"><a id="l00595" name="l00595"></a><span class="lineno">  595</span>        <span class="comment">// Fit the model on training data</span></div>
+<div class="line"><a id="l00596" name="l00596"></a><span class="lineno">  596</span>        this-&gt;<a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0">fit</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>.first, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>.second, epochs, learning_rate, batch_size,</div>
+<div class="line"><a id="l00597" name="l00597"></a><span class="lineno">  597</span>                  shuffle);</div>
+<div class="line"><a id="l00598" name="l00598"></a><span class="lineno">  598</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00599" name="l00599"></a><span class="lineno">  599</span>    }</div>
+</div>
+<div class="line"><a id="l00600" name="l00600"></a><span class="lineno">  600</span> </div>
+<div class="foldopen" id="foldopen00606" data-start="{" data-end="}">
+<div class="line"><a id="l00606" name="l00606"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e">  606</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e">evaluate</a>(<span class="keyword">const</span> std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; &amp;X,</div>
+<div class="line"><a id="l00607" name="l00607"></a><span class="lineno">  607</span>                  <span class="keyword">const</span> std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; &amp;Y) {</div>
+<div class="line"><a id="l00608" name="l00608"></a><span class="lineno">  608</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;INFO: Evaluation Started&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00609" name="l00609"></a><span class="lineno">  609</span>        <span class="keywordtype">double</span> acc = 0, loss = 0;  <span class="comment">// initialize performance metrics with zero</span></div>
+<div class="line"><a id="l00610" name="l00610"></a><span class="lineno">  610</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; X.size(); i++) {  <span class="comment">// For every sample in input</span></div>
+<div class="line"><a id="l00611" name="l00611"></a><span class="lineno">  611</span>            <span class="comment">// Get predictions</span></div>
+<div class="line"><a id="l00612" name="l00612"></a><span class="lineno">  612</span>            std::vector&lt;std::valarray&lt;double&gt;&gt; pred =</div>
+<div class="line"><a id="l00613" name="l00613"></a><span class="lineno">  613</span>                this-&gt;<a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f">single_predict</a>(X[i]);</div>
+<div class="line"><a id="l00614" name="l00614"></a><span class="lineno">  614</span>            <span class="comment">// If predicted class is correct</span></div>
+<div class="line"><a id="l00615" name="l00615"></a><span class="lineno">  615</span>            <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">argmax</a>(pred) == <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">argmax</a>(Y[i])) {</div>
+<div class="line"><a id="l00616" name="l00616"></a><span class="lineno">  616</span>                acc += 1;  <span class="comment">// Increment accuracy</span></div>
+<div class="line"><a id="l00617" name="l00617"></a><span class="lineno">  617</span>            }</div>
+<div class="line"><a id="l00618" name="l00618"></a><span class="lineno">  618</span>            <span class="comment">// Calculating loss - Mean Squared Error</span></div>
+<div class="line"><a id="l00619" name="l00619"></a><span class="lineno">  619</span>            loss += <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a>(<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">apply_function</a>((Y[i] - pred),</div>
+<div class="line"><a id="l00620" name="l00620"></a><span class="lineno">  620</span>                                       neural_network::util_functions::square) *</div>
+<div class="line"><a id="l00621" name="l00621"></a><span class="lineno">  621</span>                        0.5);</div>
+<div class="line"><a id="l00622" name="l00622"></a><span class="lineno">  622</span>        }</div>
+<div class="line"><a id="l00623" name="l00623"></a><span class="lineno">  623</span>        acc /= X.size();   <span class="comment">// Averaging accuracy</span></div>
+<div class="line"><a id="l00624" name="l00624"></a><span class="lineno">  624</span>        loss /= X.size();  <span class="comment">// Averaging loss</span></div>
+<div class="line"><a id="l00625" name="l00625"></a><span class="lineno">  625</span>        <span class="comment">// Prinitng performance of the model</span></div>
+<div class="line"><a id="l00626" name="l00626"></a><span class="lineno">  626</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Evaluation: Loss: &quot;</span> &lt;&lt; loss;</div>
+<div class="line"><a id="l00627" name="l00627"></a><span class="lineno">  627</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;, Accuracy: &quot;</span> &lt;&lt; acc &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00628" name="l00628"></a><span class="lineno">  628</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00629" name="l00629"></a><span class="lineno">  629</span>    }</div>
+</div>
+<div class="line"><a id="l00630" name="l00630"></a><span class="lineno">  630</span> </div>
+<div class="foldopen" id="foldopen00638" data-start="{" data-end="}">
+<div class="line"><a id="l00638" name="l00638"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a36494e26ff36d6e15c1022bb9a1ee848">  638</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a36494e26ff36d6e15c1022bb9a1ee848">evaluate_from_csv</a>(<span class="keyword">const</span> std::string &amp;file_name, <span class="keyword">const</span> <span class="keywordtype">bool</span> &amp;last_label,</div>
+<div class="line"><a id="l00639" name="l00639"></a><span class="lineno">  639</span>                           <span class="keyword">const</span> <span class="keywordtype">bool</span> &amp;normalize, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;slip_lines = 1) {</div>
+<div class="line"><a id="l00640" name="l00640"></a><span class="lineno">  640</span>        <span class="comment">// Getting training data from csv file</span></div>
+<div class="line"><a id="l00641" name="l00641"></a><span class="lineno">  641</span>        <span class="keyword">auto</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> =</div>
+<div class="line"><a id="l00642" name="l00642"></a><span class="lineno">  642</span>            this-&gt;<a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d">get_XY_from_csv</a>(file_name, last_label, normalize, slip_lines);</div>
+<div class="line"><a id="l00643" name="l00643"></a><span class="lineno">  643</span>        <span class="comment">// Evaluating model</span></div>
+<div class="line"><a id="l00644" name="l00644"></a><span class="lineno">  644</span>        this-&gt;<a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e">evaluate</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>.first, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>.second);</div>
+<div class="line"><a id="l00645" name="l00645"></a><span class="lineno">  645</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00646" name="l00646"></a><span class="lineno">  646</span>    }</div>
+</div>
+<div class="line"><a id="l00647" name="l00647"></a><span class="lineno">  647</span> </div>
+<div class="foldopen" id="foldopen00652" data-start="{" data-end="}">
+<div class="line"><a id="l00652" name="l00652"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4f14e473bb0722c6490b9dc8da5982aa">  652</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4f14e473bb0722c6490b9dc8da5982aa">save_model</a>(<span class="keyword">const</span> std::string &amp;_file_name) {</div>
+<div class="line"><a id="l00653" name="l00653"></a><span class="lineno">  653</span>        std::string file_name = _file_name;</div>
+<div class="line"><a id="l00654" name="l00654"></a><span class="lineno">  654</span>        <span class="comment">// Adding &quot;.model&quot; extension if it is not already there in name</span></div>
+<div class="line"><a id="l00655" name="l00655"></a><span class="lineno">  655</span>        <span class="keywordflow">if</span> (file_name.find(<span class="stringliteral">&quot;.model&quot;</span>) == file_name.npos) {</div>
+<div class="line"><a id="l00656" name="l00656"></a><span class="lineno">  656</span>            file_name += <span class="stringliteral">&quot;.model&quot;</span>;</div>
+<div class="line"><a id="l00657" name="l00657"></a><span class="lineno">  657</span>        }</div>
+<div class="line"><a id="l00658" name="l00658"></a><span class="lineno">  658</span>        std::ofstream out_file;  <span class="comment">// Ofstream to write in file</span></div>
+<div class="line"><a id="l00659" name="l00659"></a><span class="lineno">  659</span>        <span class="comment">// Open file in out|trunc mode</span></div>
+<div class="line"><a id="l00660" name="l00660"></a><span class="lineno">  660</span>        out_file.open(file_name.c_str(),</div>
+<div class="line"><a id="l00661" name="l00661"></a><span class="lineno">  661</span>                      std::ofstream::out | std::ofstream::trunc);</div>
+<div class="line"><a id="l00662" name="l00662"></a><span class="lineno">  662</span>        <span class="comment">// If there is any problem in opening file</span></div>
+<div class="line"><a id="l00663" name="l00663"></a><span class="lineno">  663</span>        <span class="keywordflow">if</span> (!out_file.is_open()) {</div>
+<div class="line"><a id="l00664" name="l00664"></a><span class="lineno">  664</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><a id="l00665" name="l00665"></a><span class="lineno">  665</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Unable to open file: &quot;</span> &lt;&lt; file_name &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00666" name="l00666"></a><span class="lineno">  666</span>            std::exit(EXIT_FAILURE);</div>
+<div class="line"><a id="l00667" name="l00667"></a><span class="lineno">  667</span>        }</div>
+<div class="line"><a id="l00707" name="l00707"></a><span class="lineno">  707</span>        <span class="comment">// Saving model in the same format</span></div>
+<div class="line"><a id="l00708" name="l00708"></a><span class="lineno">  708</span>        out_file &lt;&lt; <a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>.size();</div>
+<div class="line"><a id="l00709" name="l00709"></a><span class="lineno">  709</span>        out_file &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00710" name="l00710"></a><span class="lineno">  710</span>        <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;layer : this-&gt;layers) {</div>
+<div class="line"><a id="l00711" name="l00711"></a><span class="lineno">  711</span>            out_file &lt;&lt; layer.neurons &lt;&lt; <span class="charliteral">&#39; &#39;</span> &lt;&lt; layer.activation &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00712" name="l00712"></a><span class="lineno">  712</span>            <span class="keyword">const</span> <span class="keyword">auto</span> shape = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(layer.kernel);</div>
+<div class="line"><a id="l00713" name="l00713"></a><span class="lineno">  713</span>            out_file &lt;&lt; shape.first &lt;&lt; <span class="charliteral">&#39; &#39;</span> &lt;&lt; shape.second &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00714" name="l00714"></a><span class="lineno">  714</span>            <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;row : layer.kernel) {</div>
+<div class="line"><a id="l00715" name="l00715"></a><span class="lineno">  715</span>                <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;val : row) {</div>
+<div class="line"><a id="l00716" name="l00716"></a><span class="lineno">  716</span>                    out_file &lt;&lt; val &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><a id="l00717" name="l00717"></a><span class="lineno">  717</span>                }</div>
+<div class="line"><a id="l00718" name="l00718"></a><span class="lineno">  718</span>                out_file &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00719" name="l00719"></a><span class="lineno">  719</span>            }</div>
+<div class="line"><a id="l00720" name="l00720"></a><span class="lineno">  720</span>        }</div>
+<div class="line"><a id="l00721" name="l00721"></a><span class="lineno">  721</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;INFO: Model saved successfully with name : &quot;</span>;</div>
+<div class="line"><a id="l00722" name="l00722"></a><span class="lineno">  722</span>        std::cout &lt;&lt; file_name &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00723" name="l00723"></a><span class="lineno">  723</span>        out_file.close();  <span class="comment">// Closing file</span></div>
+<div class="line"><a id="l00724" name="l00724"></a><span class="lineno">  724</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00725" name="l00725"></a><span class="lineno">  725</span>    }</div>
+</div>
+<div class="line"><a id="l00726" name="l00726"></a><span class="lineno">  726</span> </div>
+<div class="foldopen" id="foldopen00732" data-start="{" data-end="}">
+<div class="line"><a id="l00732" name="l00732"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58ed20abf6ce3744535bd8b5bb9e741b">  732</a></span>    <a class="code hl_class" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> <a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58ed20abf6ce3744535bd8b5bb9e741b">load_model</a>(<span class="keyword">const</span> std::string &amp;file_name) {</div>
+<div class="line"><a id="l00733" name="l00733"></a><span class="lineno">  733</span>        std::ifstream in_file;            <span class="comment">// Ifstream to read file</span></div>
+<div class="line"><a id="l00734" name="l00734"></a><span class="lineno">  734</span>        in_file.open(file_name.c_str());  <span class="comment">// Openinig file</span></div>
+<div class="line"><a id="l00735" name="l00735"></a><span class="lineno">  735</span>        <span class="comment">// If there is any problem in opening file</span></div>
+<div class="line"><a id="l00736" name="l00736"></a><span class="lineno">  736</span>        <span class="keywordflow">if</span> (!in_file.is_open()) {</div>
+<div class="line"><a id="l00737" name="l00737"></a><span class="lineno">  737</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><a id="l00738" name="l00738"></a><span class="lineno">  738</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Unable to open file: &quot;</span> &lt;&lt; file_name &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00739" name="l00739"></a><span class="lineno">  739</span>            std::exit(EXIT_FAILURE);</div>
+<div class="line"><a id="l00740" name="l00740"></a><span class="lineno">  740</span>        }</div>
+<div class="line"><a id="l00741" name="l00741"></a><span class="lineno">  741</span>        std::vector&lt;std::pair&lt;int, std::string&gt;&gt; config;  <span class="comment">// To store config</span></div>
+<div class="line"><a id="l00742" name="l00742"></a><span class="lineno">  742</span>        std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt;</div>
+<div class="line"><a id="l00743" name="l00743"></a><span class="lineno">  743</span>            kernels;  <span class="comment">// To store pretrained kernels</span></div>
+<div class="line"><a id="l00744" name="l00744"></a><span class="lineno">  744</span>        <span class="comment">// Loading model from saved file format</span></div>
+<div class="line"><a id="l00745" name="l00745"></a><span class="lineno">  745</span>        <span class="keywordtype">size_t</span> total_layers = 0;</div>
+<div class="line"><a id="l00746" name="l00746"></a><span class="lineno">  746</span>        in_file &gt;&gt; total_layers;</div>
+<div class="line"><a id="l00747" name="l00747"></a><span class="lineno">  747</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; total_layers; i++) {</div>
+<div class="line"><a id="l00748" name="l00748"></a><span class="lineno">  748</span>            <span class="keywordtype">int</span> neurons = 0;</div>
+<div class="line"><a id="l00749" name="l00749"></a><span class="lineno">  749</span>            std::string activation;</div>
+<div class="line"><a id="l00750" name="l00750"></a><span class="lineno">  750</span>            <span class="keywordtype">size_t</span> shape_a = 0, shape_b = 0;</div>
+<div class="line"><a id="l00751" name="l00751"></a><span class="lineno">  751</span>            std::vector&lt;std::valarray&lt;double&gt;&gt; kernel;</div>
+<div class="line"><a id="l00752" name="l00752"></a><span class="lineno">  752</span>            in_file &gt;&gt; neurons &gt;&gt; activation &gt;&gt; shape_a &gt;&gt; shape_b;</div>
+<div class="line"><a id="l00753" name="l00753"></a><span class="lineno">  753</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> r = 0; r &lt; shape_a; r++) {</div>
+<div class="line"><a id="l00754" name="l00754"></a><span class="lineno">  754</span>                std::valarray&lt;double&gt; row(shape_b);</div>
+<div class="line"><a id="l00755" name="l00755"></a><span class="lineno">  755</span>                <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> c = 0; c &lt; shape_b; c++) {</div>
+<div class="line"><a id="l00756" name="l00756"></a><span class="lineno">  756</span>                    in_file &gt;&gt; row[c];</div>
+<div class="line"><a id="l00757" name="l00757"></a><span class="lineno">  757</span>                }</div>
+<div class="line"><a id="l00758" name="l00758"></a><span class="lineno">  758</span>                kernel.push_back(row);</div>
+<div class="line"><a id="l00759" name="l00759"></a><span class="lineno">  759</span>            }</div>
+<div class="line"><a id="l00760" name="l00760"></a><span class="lineno">  760</span>            config.emplace_back(make_pair(neurons, activation));</div>
+<div class="line"><a id="l00761" name="l00761"></a><span class="lineno">  761</span>            ;</div>
+<div class="line"><a id="l00762" name="l00762"></a><span class="lineno">  762</span>            kernels.emplace_back(kernel);</div>
+<div class="line"><a id="l00763" name="l00763"></a><span class="lineno">  763</span>        }</div>
+<div class="line"><a id="l00764" name="l00764"></a><span class="lineno">  764</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;INFO: Model loaded successfully&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00765" name="l00765"></a><span class="lineno">  765</span>        in_file.close();  <span class="comment">// Closing file</span></div>
+<div class="line"><a id="l00766" name="l00766"></a><span class="lineno">  766</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ae7cf126a3a8f9d20c81b21584d061a08">NeuralNetwork</a>(</div>
+<div class="line"><a id="l00767" name="l00767"></a><span class="lineno">  767</span>            config, kernels);  <span class="comment">// Return instance of NeuralNetwork class</span></div>
+<div class="line"><a id="l00768" name="l00768"></a><span class="lineno">  768</span>    }</div>
+</div>
+<div class="line"><a id="l00769" name="l00769"></a><span class="lineno">  769</span> </div>
+<div class="foldopen" id="foldopen00773" data-start="{" data-end="}">
+<div class="line"><a id="l00773" name="l00773"></a><span class="lineno"><a class="line" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931">  773</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931">summary</a>() {</div>
+<div class="line"><a id="l00774" name="l00774"></a><span class="lineno">  774</span>        <span class="comment">// Printing Summary</span></div>
+<div class="line"><a id="l00775" name="l00775"></a><span class="lineno">  775</span>        std::cout</div>
+<div class="line"><a id="l00776" name="l00776"></a><span class="lineno">  776</span>            &lt;&lt; <span class="stringliteral">&quot;===============================================================&quot;</span></div>
+<div class="line"><a id="l00777" name="l00777"></a><span class="lineno">  777</span>            &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00778" name="l00778"></a><span class="lineno">  778</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\t\t+ MODEL SUMMARY +\t\t\n&quot;</span>;</div>
+<div class="line"><a id="l00779" name="l00779"></a><span class="lineno">  779</span>        std::cout</div>
+<div class="line"><a id="l00780" name="l00780"></a><span class="lineno">  780</span>            &lt;&lt; <span class="stringliteral">&quot;===============================================================&quot;</span></div>
+<div class="line"><a id="l00781" name="l00781"></a><span class="lineno">  781</span>            &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00782" name="l00782"></a><span class="lineno">  782</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 1; i &lt;= <a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>.size(); i++) {  <span class="comment">// For every layer</span></div>
+<div class="line"><a id="l00783" name="l00783"></a><span class="lineno">  783</span>            std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;)&quot;</span>;</div>
+<div class="line"><a id="l00784" name="l00784"></a><span class="lineno">  784</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; Neurons : &quot;</span></div>
+<div class="line"><a id="l00785" name="l00785"></a><span class="lineno">  785</span>                      &lt;&lt; <a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>[i - 1].neurons;  <span class="comment">// number of neurons</span></div>
+<div class="line"><a id="l00786" name="l00786"></a><span class="lineno">  786</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;, Activation : &quot;</span></div>
+<div class="line"><a id="l00787" name="l00787"></a><span class="lineno">  787</span>                      &lt;&lt; <a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>[i - 1].activation;  <span class="comment">// activation</span></div>
+<div class="line"><a id="l00788" name="l00788"></a><span class="lineno">  788</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;, kernel Shape : &quot;</span></div>
+<div class="line"><a id="l00789" name="l00789"></a><span class="lineno">  789</span>                      &lt;&lt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(<a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>[i - 1].kernel);  <span class="comment">// kernel shape</span></div>
+<div class="line"><a id="l00790" name="l00790"></a><span class="lineno">  790</span>            std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00791" name="l00791"></a><span class="lineno">  791</span>        }</div>
+<div class="line"><a id="l00792" name="l00792"></a><span class="lineno">  792</span>        std::cout</div>
+<div class="line"><a id="l00793" name="l00793"></a><span class="lineno">  793</span>            &lt;&lt; <span class="stringliteral">&quot;===============================================================&quot;</span></div>
+<div class="line"><a id="l00794" name="l00794"></a><span class="lineno">  794</span>            &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00795" name="l00795"></a><span class="lineno">  795</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00796" name="l00796"></a><span class="lineno">  796</span>    }</div>
+</div>
+<div class="line"><a id="l00797" name="l00797"></a><span class="lineno">  797</span>};</div>
+</div>
+<div class="line"><a id="l00798" name="l00798"></a><span class="lineno">  798</span>}  <span class="comment">// namespace neural_network</span></div>
+<div class="line"><a id="l00799" name="l00799"></a><span class="lineno">  799</span>}  <span class="comment">// namespace machine_learning</span></div>
+<div class="line"><a id="l00800" name="l00800"></a><span class="lineno">  800</span> </div>
+<div class="foldopen" id="foldopen00805" data-start="{" data-end="}">
+<div class="line"><a id="l00805" name="l00805"></a><span class="lineno"><a class="line" href="../../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  805</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00806" name="l00806"></a><span class="lineno">  806</span>    <span class="comment">// Creating network with 3 layers for &quot;iris.csv&quot;</span></div>
+<div class="line"><a id="l00807" name="l00807"></a><span class="lineno">  807</span>    <a class="code hl_class" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">machine_learning::neural_network::NeuralNetwork</a> myNN =</div>
+<div class="line"><a id="l00808" name="l00808"></a><span class="lineno">  808</span>        <a class="code hl_class" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">machine_learning::neural_network::NeuralNetwork</a>({</div>
+<div class="line"><a id="l00809" name="l00809"></a><span class="lineno">  809</span>            {4, <span class="stringliteral">&quot;none&quot;</span>},  <span class="comment">// First layer with 3 neurons and &quot;none&quot; as activation</span></div>
+<div class="line"><a id="l00810" name="l00810"></a><span class="lineno">  810</span>            {6,</div>
+<div class="line"><a id="l00811" name="l00811"></a><span class="lineno">  811</span>             <span class="stringliteral">&quot;relu&quot;</span>},  <span class="comment">// Second layer with 6 neurons and &quot;relu&quot; as activation</span></div>
+<div class="line"><a id="l00812" name="l00812"></a><span class="lineno">  812</span>            {3, <span class="stringliteral">&quot;sigmoid&quot;</span>}  <span class="comment">// Third layer with 3 neurons and &quot;sigmoid&quot; as</span></div>
+<div class="line"><a id="l00813" name="l00813"></a><span class="lineno">  813</span>                            <span class="comment">// activation</span></div>
+<div class="line"><a id="l00814" name="l00814"></a><span class="lineno">  814</span>        });</div>
+<div class="line"><a id="l00815" name="l00815"></a><span class="lineno">  815</span>    <span class="comment">// Printing summary of model</span></div>
+<div class="line"><a id="l00816" name="l00816"></a><span class="lineno">  816</span>    myNN.<a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931">summary</a>();</div>
+<div class="line"><a id="l00817" name="l00817"></a><span class="lineno">  817</span>    <span class="comment">// Training Model</span></div>
+<div class="line"><a id="l00818" name="l00818"></a><span class="lineno">  818</span>    myNN.<a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff">fit_from_csv</a>(<span class="stringliteral">&quot;iris.csv&quot;</span>, <span class="keyword">true</span>, 100, 0.3, <span class="keyword">false</span>, 2, 32, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00819" name="l00819"></a><span class="lineno">  819</span>    <span class="comment">// Testing predictions of model</span></div>
+<div class="line"><a id="l00820" name="l00820"></a><span class="lineno">  820</span>    assert(<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">machine_learning::argmax</a>(</div>
+<div class="line"><a id="l00821" name="l00821"></a><span class="lineno">  821</span>               myNN.<a class="code hl_function" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f">single_predict</a>({{5, 3.4, 1.6, 0.4}})) == 0);</div>
+<div class="line"><a id="l00822" name="l00822"></a><span class="lineno">  822</span>    assert(<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">machine_learning::argmax</a>(</div>
+<div class="line"><a id="l00823" name="l00823"></a><span class="lineno">  823</span>               myNN.single_predict({{6.4, 2.9, 4.3, 1.3}})) == 1);</div>
+<div class="line"><a id="l00824" name="l00824"></a><span class="lineno">  824</span>    assert(<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">machine_learning::argmax</a>(</div>
+<div class="line"><a id="l00825" name="l00825"></a><span class="lineno">  825</span>               myNN.single_predict({{6.2, 3.4, 5.4, 2.3}})) == 2);</div>
+<div class="line"><a id="l00826" name="l00826"></a><span class="lineno">  826</span>    <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00827" name="l00827"></a><span class="lineno">  827</span>}</div>
+</div>
+<div class="line"><a id="l00828" name="l00828"></a><span class="lineno">  828</span> </div>
+<div class="foldopen" id="foldopen00833" data-start="{" data-end="}">
+<div class="line"><a id="l00833" name="l00833"></a><span class="lineno"><a class="line" href="../../d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  833</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00834" name="l00834"></a><span class="lineno">  834</span>    <span class="comment">// Testing</span></div>
+<div class="line"><a id="l00835" name="l00835"></a><span class="lineno">  835</span>    <a class="code hl_function" href="../../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
+<div class="line"><a id="l00836" name="l00836"></a><span class="lineno">  836</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00837" name="l00837"></a><span class="lineno">  837</span>}</div>
+</div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">machine_learning::neural_network::NeuralNetwork</a></div><div class="ttdef"><b>Definition</b> <a href="#l00247">neural_network.cpp:247</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a173bb71780af6953ec2e307a4c74b025"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a173bb71780af6953ec2e307a4c74b025">machine_learning::neural_network::NeuralNetwork::NeuralNetwork</a></div><div class="ttdeci">NeuralNetwork(NeuralNetwork &amp;&amp;)=default</div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a176b955c90ae57d7dbc3c63f27c84c75"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a176b955c90ae57d7dbc3c63f27c84c75">machine_learning::neural_network::NeuralNetwork::NeuralNetwork</a></div><div class="ttdeci">NeuralNetwork(const NeuralNetwork &amp;model)=default</div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a2be1b52bb9f57486f9a436f35c9089c0"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0">machine_learning::neural_network::NeuralNetwork::fit</a></div><div class="ttdeci">void fit(const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;X_, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;Y_, const int &amp;epochs=100, const double &amp;learning_rate=0.01, const size_t &amp;batch_size=32, const bool &amp;shuffle=true)</div><div class="ttdef"><b>Definition</b> <a href="#l00485">neural_network.cpp:485</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a2c49bfebf9b859d5ceb26035d3003601"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2c49bfebf9b859d5ceb26035d3003601">machine_learning::neural_network::NeuralNetwork::operator=</a></div><div class="ttdeci">NeuralNetwork &amp; operator=(NeuralNetwork &amp;&amp;)=default</div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a361a45f3c3d8347d79103bf182d0570b"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b">machine_learning::neural_network::NeuralNetwork::__detailed_single_prediction</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; __detailed_single_prediction(const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</div><div class="ttdef"><b>Definition</b> <a href="#l00289">neural_network.cpp:289</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a36494e26ff36d6e15c1022bb9a1ee848"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a36494e26ff36d6e15c1022bb9a1ee848">machine_learning::neural_network::NeuralNetwork::evaluate_from_csv</a></div><div class="ttdeci">void evaluate_from_csv(const std::string &amp;file_name, const bool &amp;last_label, const bool &amp;normalize, const int &amp;slip_lines=1)</div><div class="ttdef"><b>Definition</b> <a href="#l00638">neural_network.cpp:638</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a3b9eac1824d365dce715fb17c33cb96f"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f">machine_learning::neural_network::NeuralNetwork::single_predict</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; double &gt; &gt; single_predict(const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</div><div class="ttdef"><b>Definition</b> <a href="#l00451">neural_network.cpp:451</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a4c4c6f63ab965317f9471518ee931b89"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4c4c6f63ab965317f9471518ee931b89">machine_learning::neural_network::NeuralNetwork::NeuralNetwork</a></div><div class="ttdeci">NeuralNetwork(const std::vector&lt; std::pair&lt; int, std::string &gt; &gt; &amp;config, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;kernels)</div><div class="ttdef"><b>Definition</b> <a href="#l00256">neural_network.cpp:256</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a4f14e473bb0722c6490b9dc8da5982aa"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4f14e473bb0722c6490b9dc8da5982aa">machine_learning::neural_network::NeuralNetwork::save_model</a></div><div class="ttdeci">void save_model(const std::string &amp;_file_name)</div><div class="ttdef"><b>Definition</b> <a href="#l00652">neural_network.cpp:652</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a5172a6791b9bd24f4232bab8d6b81fff"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff">machine_learning::neural_network::NeuralNetwork::fit_from_csv</a></div><div class="ttdeci">void fit_from_csv(const std::string &amp;file_name, const bool &amp;last_label, const int &amp;epochs, const double &amp;learning_rate, const bool &amp;normalize, const int &amp;slip_lines=1, const size_t &amp;batch_size=32, const bool &amp;shuffle=true)</div><div class="ttdef"><b>Definition</b> <a href="#l00587">neural_network.cpp:587</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a58a9614e4c6d4ca672d3358e99a3404f"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58a9614e4c6d4ca672d3358e99a3404f">machine_learning::neural_network::NeuralNetwork::operator=</a></div><div class="ttdeci">NeuralNetwork &amp; operator=(const NeuralNetwork &amp;model)=default</div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a58ed20abf6ce3744535bd8b5bb9e741b"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58ed20abf6ce3744535bd8b5bb9e741b">machine_learning::neural_network::NeuralNetwork::load_model</a></div><div class="ttdeci">NeuralNetwork load_model(const std::string &amp;file_name)</div><div class="ttdef"><b>Definition</b> <a href="#l00732">neural_network.cpp:732</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a61d30113d13304c664057118b92a5931"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931">machine_learning::neural_network::NeuralNetwork::summary</a></div><div class="ttdeci">void summary()</div><div class="ttdef"><b>Definition</b> <a href="#l00773">neural_network.cpp:773</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a62151b0398a2536be60d950e10ffe9a8"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a62151b0398a2536be60d950e10ffe9a8">machine_learning::neural_network::NeuralNetwork::NeuralNetwork</a></div><div class="ttdeci">NeuralNetwork(const std::vector&lt; std::pair&lt; int, std::string &gt; &gt; &amp;config)</div><div class="ttdef"><b>Definition</b> <a href="#l00313">neural_network.cpp:313</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a650c677fd6512665741ddd9b7983275d"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d">machine_learning::neural_network::NeuralNetwork::get_XY_from_csv</a></div><div class="ttdeci">std::pair&lt; std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt;, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &gt; get_XY_from_csv(const std::string &amp;file_name, const bool &amp;last_label, const bool &amp;normalize, const int &amp;slip_lines=1)</div><div class="ttdef"><b>Definition</b> <a href="#l00382">neural_network.cpp:382</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a88bf9023ab3d4cdb61cf707c7cdfc86b"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a88bf9023ab3d4cdb61cf707c7cdfc86b">machine_learning::neural_network::NeuralNetwork::batch_predict</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; batch_predict(const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;X)</div><div class="ttdef"><b>Definition</b> <a href="#l00464">neural_network.cpp:464</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a8973f687738ddd76f93b5562feae4027"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a8973f687738ddd76f93b5562feae4027">machine_learning::neural_network::NeuralNetwork::~NeuralNetwork</a></div><div class="ttdeci">~NeuralNetwork()=default</div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_ae7cf126a3a8f9d20c81b21584d061a08"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ae7cf126a3a8f9d20c81b21584d061a08">machine_learning::neural_network::NeuralNetwork::NeuralNetwork</a></div><div class="ttdeci">NeuralNetwork()=default</div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_aec648ea4f40bd71123b5f907a681dd8e"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e">machine_learning::neural_network::NeuralNetwork::evaluate</a></div><div class="ttdeci">void evaluate(const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;X, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;Y)</div><div class="ttdef"><b>Definition</b> <a href="#l00606">neural_network.cpp:606</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">machine_learning::neural_network::layers::DenseLayer</a></div><div class="ttdef"><b>Definition</b> <a href="#l00125">neural_network.cpp:125</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_a11046825be0b6dbb73fbe834aa49200e"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a11046825be0b6dbb73fbe834aa49200e">machine_learning::neural_network::layers::DenseLayer::DenseLayer</a></div><div class="ttdeci">DenseLayer(const int &amp;neurons, const std::string &amp;activation, const std::pair&lt; size_t, size_t &gt; &amp;kernel_shape, const bool &amp;random_kernel)</div><div class="ttdef"><b>Definition</b> <a href="#l00141">neural_network.cpp:141</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_a19aaccad279b22dbbb6c55e5697b4114"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a19aaccad279b22dbbb6c55e5697b4114">machine_learning::neural_network::layers::DenseLayer::operator=</a></div><div class="ttdeci">DenseLayer &amp; operator=(DenseLayer &amp;&amp;)=default</div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_a2871146feaaa453558239df67b21e0d2"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2">machine_learning::neural_network::layers::DenseLayer::DenseLayer</a></div><div class="ttdeci">DenseLayer(const DenseLayer &amp;layer)=default</div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_a6c859e3737aa88b29854df0347b29f4e"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6c859e3737aa88b29854df0347b29f4e">machine_learning::neural_network::layers::DenseLayer::DenseLayer</a></div><div class="ttdeci">DenseLayer(DenseLayer &amp;&amp;)=default</div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_ac9cda9453c4a0caf5bae7f9213b019a0"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ac9cda9453c4a0caf5bae7f9213b019a0">machine_learning::neural_network::layers::DenseLayer::~DenseLayer</a></div><div class="ttdeci">~DenseLayer()=default</div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_ae077132526d2863e46aa77cb0f7d6aa2"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ae077132526d2863e46aa77cb0f7d6aa2">machine_learning::neural_network::layers::DenseLayer::operator=</a></div><div class="ttdeci">DenseLayer &amp; operator=(const DenseLayer &amp;layer)=default</div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_af136ec31dbd35b1be2eb9a057677c704"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#af136ec31dbd35b1be2eb9a057677c704">machine_learning::neural_network::layers::DenseLayer::DenseLayer</a></div><div class="ttdeci">DenseLayer(const int &amp;neurons, const std::string &amp;activation, const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;kernel)</div><div class="ttdef"><b>Definition</b> <a href="#l00183">neural_network.cpp:183</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="anamespaceactivations_html"><div class="ttname"><a href="../../d5/d39/namespaceactivations.html">activations</a></div><div class="ttdoc">Various activation functions used in Neural network.</div></div>
+<div class="ttc" id="anamespacelayers_html"><div class="ttname"><a href="../../d5/d2c/namespacelayers.html">layers</a></div><div class="ttdoc">This namespace contains layers used in MLP.</div></div>
+<div class="ttc" id="anamespacemachine__learning_html"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></div><div class="ttdoc">A* search algorithm</div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a496302e3371aa7b478cb7d5917904bdd"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd">machine_learning::insert_element</a></div><div class="ttdeci">std::valarray&lt; T &gt; insert_element(const std::valarray&lt; T &gt; &amp;A, const T &amp;ele)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00085">vector_ops.hpp:85</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a50480fccfb39de20ca47f1bf51ecb6ec"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">machine_learning::argmax</a></div><div class="ttdeci">size_t argmax(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00307">vector_ops.hpp:307</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a5342906d42b80fc6b6b3ad17bf00fcb9"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9">machine_learning::multiply</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; multiply(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00460">vector_ops.hpp:460</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00232">vector_ops.hpp:232</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a89fde571b38f9483576594f66572958a"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a">machine_learning::transpose</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; transpose(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00382">vector_ops.hpp:382</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4">machine_learning::unit_matrix_initialization</a></div><div class="ttdeci">void unit_matrix_initialization(std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00193">vector_ops.hpp:193</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a912cf68863063a38d6e63545be5eb093"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093">machine_learning::pop_front</a></div><div class="ttdeci">std::valarray&lt; T &gt; pop_front(const std::valarray&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00102">vector_ops.hpp:102</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_aa4bbf61e65f8cd297255fa94b983d078"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">machine_learning::get_shape</a></div><div class="ttdeci">std::pair&lt; size_t, size_t &gt; get_shape(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00247">vector_ops.hpp:247</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_abee7b35403af3612222d3b7a53074905"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905">machine_learning::uniform_random_initialization</a></div><div class="ttdeci">void uniform_random_initialization(std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape, const T &amp;low, const T &amp;high)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00166">vector_ops.hpp:166</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_ac1bdaa2a724b4ce6a6bb371a5dbe2e7e"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e">machine_learning::zeroes_initialization</a></div><div class="ttdeci">void zeroes_initialization(std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00213">vector_ops.hpp:213</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_ac332d152078e96311e43ac5e7183ea26"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26">machine_learning::minmax_scaler</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; minmax_scaler(const std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;A, const T &amp;low, const T &amp;high)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00269">vector_ops.hpp:269</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_acafa3e62b686aebdbad81c4f89913f43"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43">machine_learning::hadamard_product</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; hadamard_product(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00494">vector_ops.hpp:494</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_ad0bdc88e5f1be47c46c0f0c8ebf754bb"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">machine_learning::apply_function</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; apply_function(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, T(*func)(const T &amp;))</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00329">vector_ops.hpp:329</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_ae10178b082f0205c326550877d998e5d"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d">machine_learning::pop_back</a></div><div class="ttdeci">std::valarray&lt; T &gt; pop_back(const std::valarray&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00119">vector_ops.hpp:119</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_af801bf30591ca6b2c38ff4fed0ded23f"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f">machine_learning::equal_shuffle</a></div><div class="ttdeci">void equal_shuffle(std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;A, std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00136">vector_ops.hpp:136</a></div></div>
+<div class="ttc" id="anamespaceneural__network_html"><div class="ttname"><a href="../../d0/d2e/namespaceneural__network.html">neural_network</a></div><div class="ttdoc">Neural Network or Multilayer Perceptron.</div></div>
+<div class="ttc" id="anamespaceutil__functions_html"><div class="ttname"><a href="../../d3/d17/namespaceutil__functions.html">util_functions</a></div><div class="ttdoc">Various utility functions used in Neural network.</div></div>
+<div class="ttc" id="aneural__network_8cpp_html_a23aa9d32bcbcd65cfc85f0a41e2afadc"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#a23aa9d32bcbcd65cfc85f0a41e2afadc">machine_learning::neural_network::activations::sigmoid</a></div><div class="ttdeci">double sigmoid(const double &amp;x)</div><div class="ttdef"><b>Definition</b> <a href="#l00060">neural_network.cpp:60</a></div></div>
+<div class="ttc" id="aneural__network_8cpp_html_a2a5e874b9774aa5362dbcf288828b95c"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#a2a5e874b9774aa5362dbcf288828b95c">machine_learning::neural_network::activations::dtanh</a></div><div class="ttdeci">double dtanh(const double &amp;x)</div><div class="ttdef"><b>Definition</b> <a href="#l00095">neural_network.cpp:95</a></div></div>
+<div class="ttc" id="aneural__network_8cpp_html_a32c00da08f2cf641dd336270f6e3c407"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#a32c00da08f2cf641dd336270f6e3c407">machine_learning::neural_network::util_functions::identity_function</a></div><div class="ttdeci">double identity_function(const double &amp;x)</div><div class="ttdef"><b>Definition</b> <a href="#l00112">neural_network.cpp:112</a></div></div>
+<div class="ttc" id="aneural__network_8cpp_html_a371aa7dd5d5add0143d1756bb0a1b32f"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#a371aa7dd5d5add0143d1756bb0a1b32f">machine_learning::neural_network::activations::tanh</a></div><div class="ttdeci">double tanh(const double &amp;x)</div><div class="ttdef"><b>Definition</b> <a href="#l00088">neural_network.cpp:88</a></div></div>
+<div class="ttc" id="aneural__network_8cpp_html_a45d3e30406712ada3d9713ece3c1b153"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#a45d3e30406712ada3d9713ece3c1b153">machine_learning::neural_network::util_functions::square</a></div><div class="ttdeci">double square(const double &amp;x)</div><div class="ttdef"><b>Definition</b> <a href="#l00106">neural_network.cpp:106</a></div></div>
+<div class="ttc" id="aneural__network_8cpp_html_a76eb66212d577f948a457b6e29d87c46"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#a76eb66212d577f948a457b6e29d87c46">machine_learning::neural_network::activations::dsigmoid</a></div><div class="ttdeci">double dsigmoid(const double &amp;x)</div><div class="ttdef"><b>Definition</b> <a href="#l00067">neural_network.cpp:67</a></div></div>
+<div class="ttc" id="aneural__network_8cpp_html_aa69e95a34054d7989bf446f96b2ffaf9"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#aa69e95a34054d7989bf446f96b2ffaf9">machine_learning::neural_network::activations::drelu</a></div><div class="ttdeci">double drelu(const double &amp;x)</div><div class="ttdef"><b>Definition</b> <a href="#l00081">neural_network.cpp:81</a></div></div>
+<div class="ttc" id="aneural__network_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00805">neural_network.cpp:805</a></div></div>
+<div class="ttc" id="aneural__network_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00833">neural_network.cpp:833</a></div></div>
+<div class="ttc" id="aneural__network_8cpp_html_af8f264600754602b6a9ea19cc690e50e"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#af8f264600754602b6a9ea19cc690e50e">machine_learning::neural_network::activations::relu</a></div><div class="ttdeci">double relu(const double &amp;x)</div><div class="ttdef"><b>Definition</b> <a href="#l00074">neural_network.cpp:74</a></div></div>
+<div class="ttc" id="avector__ops_8hpp_html"><div class="ttname"><a href="../../d8/d95/vector__ops_8hpp.html">vector_ops.hpp</a></div><div class="ttdoc">Various functions for vectors associated with [NeuralNetwork (aka Multilayer Perceptron)] (https://en...</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_3343723ae086de42ee4ca9774da3a13f.html">machine_learning</a></li><li class="navelem"><a class="el" href="../../d2/d58/neural__network_8cpp.html">neural_network.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d2/d5a/subset__sum_8cpp.html b/d2/d5a/subset__sum_8cpp.html
index 16dcf5775..ad8f81319 100644
--- a/d2/d5a/subset__sum_8cpp.html
+++ b/d2/d5a/subset__sum_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: backtracking/subset_sum.cpp File Reference</title>
+<title>TheAlgorithms/C++: backtracking/subset_sum.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for subset_sum.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/da8/subset__sum_8cpp__incl.svg" width="336" height="126"><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">
+</div>
+<p><a href="../../d2/d5a/subset__sum_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html">backtracking</a></td></tr>
@@ -134,7 +153,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a7cb50d36a59427a33f64a266dac83d99" id="r_a7cb50d36a59427a33f64a266dac83d99"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7cb50d36a59427a33f64a266dac83d99">backtracking::subset_sum::number_of_subsets</a> (int32_t sum, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;in_arr)</td></tr>
+<tr class="memitem:a7cb50d36a59427a33f64a266dac83d99" id="r_a7cb50d36a59427a33f64a266dac83d99"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7cb50d36a59427a33f64a266dac83d99">backtracking::subset_sum::number_of_subsets</a> (int32_t sum, const std::vector&lt; int32_t &gt; &amp;in_arr)</td></tr>
 <tr class="memdesc:a7cb50d36a59427a33f64a266dac83d99"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function implements count of subsets.  <br /></td></tr>
 <tr class="separator:a7cb50d36a59427a33f64a266dac83d99"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -147,6 +166,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of the <a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset Sum</a> problem. </p>
 <p>We are given an array and a sum value. The algorithm finds all the subsets of that array with sum equal to the given sum and return such subsets count. This approach will have exponential time complexity. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Swastyy" target="_blank">Swastika Gupta</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d2/d5a/subset__sum_8cpp_source.html">subset_sum.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -165,17 +186,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d5a/subset__sum_8cpp_source.html#l00104">104</a> of file <a class="el" href="../../d2/d5a/subset__sum_8cpp_source.html">subset_sum.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  104</span>           {</div>
 <div class="line"><span class="lineno">  105</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  106</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  107</span>}</div>
-<div class="ttc" id="asubset__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#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:58</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asubset__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d5a/subset__sum_8cpp_source.html#l00058">subset_sum.cpp:58</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7cb50d36a59427a33f64a266dac83d99" name="a7cb50d36a59427a33f64a266dac83d99"></a>
@@ -192,7 +210,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>in_arr</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; int32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>in_arr</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -206,15 +224,17 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>count of the number of subsets with required sum </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d5a/subset__sum_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../d2/d5a/subset__sum_8cpp_source.html">subset_sum.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   34</span>                                                                          {</div>
-<div class="line"><span class="lineno">   35</span>    int32_t nelement = in_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">   35</span>    int32_t nelement = in_arr.size();</div>
 <div class="line"><span class="lineno">   36</span>    uint64_t count_of_subset = 0;</div>
 <div class="line"><span class="lineno">   37</span> </div>
 <div class="line"><span class="lineno">   38</span>    <span class="keywordflow">for</span> (int32_t i = 0; i &lt; (1 &lt;&lt; (nelement)); i++) {</div>
-<div class="line"><span class="lineno">   39</span>        int32_t <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a">check</a> = 0;</div>
+<div class="line"><span class="lineno">   39</span>        int32_t check = 0;</div>
 <div class="line"><span class="lineno">   40</span>        <span class="keywordflow">for</span> (int32_t j = 0; j &lt; nelement; j++) {</div>
 <div class="line"><span class="lineno">   41</span>            <span class="keywordflow">if</span> (i &amp; (1 &lt;&lt; j)) {</div>
-<div class="line"><span class="lineno">   42</span>                <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a">check</a> += (in_arr[j]);</div>
+<div class="line"><span class="lineno">   42</span>                check += (in_arr[j]);</div>
 <div class="line"><span class="lineno">   43</span>            }</div>
 <div class="line"><span class="lineno">   44</span>        }</div>
 <div class="line"><span class="lineno">   45</span>        <span class="keywordflow">if</span> (check == sum) {</div>
@@ -223,14 +243,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   48</span>    }</div>
 <div class="line"><span class="lineno">   49</span>    <span class="keywordflow">return</span> count_of_subset;</div>
 <div class="line"><span class="lineno">   50</span>}</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="aword__break_8cpp_html_a272b0f5cdb4e41fd6dee4538b808c06a"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a">dynamic_programming::word_break::check</a></div><div class="ttdeci">bool check(const std::string &amp;s, const std::unordered_set&lt; std::string &gt; &amp;strSet, int pos, std::vector&lt; int &gt; *dp)</div><div class="ttdoc">Function that checks if the string passed in param can be segmented from position 'pos',...</div><div class="ttdef"><b>Definition</b> word_break.cpp:80</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.svg" width="350" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -258,56 +271,50 @@ Here is the call graph for this function:</div>
 
 <p>Test implementations. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d5a/subset__sum_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d2/d5a/subset__sum_8cpp_source.html">subset_sum.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   58</span>                   {</div>
 <div class="line"><span class="lineno">   59</span>    <span class="comment">// 1st test</span></div>
-<div class="line"><span class="lineno">   60</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1st test &quot;</span>;</div>
-<div class="line"><span class="lineno">   61</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> array1 = {-7, -3, -2, 5, 8};  <span class="comment">// input array</span></div>
+<div class="line"><span class="lineno">   60</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test &quot;</span>;</div>
+<div class="line"><span class="lineno">   61</span>    std::vector&lt;int32_t&gt; array1 = {-7, -3, -2, 5, 8};  <span class="comment">// input array</span></div>
 <div class="line"><span class="lineno">   62</span>    assert(backtracking::subset_sum::number_of_subsets(0, array1) ==</div>
 <div class="line"><span class="lineno">   63</span>           2);  <span class="comment">// first argument in subset_sum function is the required sum and</span></div>
 <div class="line"><span class="lineno">   64</span>                <span class="comment">// second is the input array</span></div>
-<div class="line"><span class="lineno">   65</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   65</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   66</span> </div>
 <div class="line"><span class="lineno">   67</span>    <span class="comment">// 2nd test</span></div>
-<div class="line"><span class="lineno">   68</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2nd test &quot;</span>;</div>
-<div class="line"><span class="lineno">   69</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> array2 = {1, 2, 3, 3};</div>
+<div class="line"><span class="lineno">   68</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test &quot;</span>;</div>
+<div class="line"><span class="lineno">   69</span>    std::vector&lt;int32_t&gt; array2 = {1, 2, 3, 3};</div>
 <div class="line"><span class="lineno">   70</span>    assert(backtracking::subset_sum::number_of_subsets(6, array2) ==</div>
 <div class="line"><span class="lineno">   71</span>           3);  <span class="comment">// here we are expecting 3 subsets which sum up to 6 i.e.</span></div>
 <div class="line"><span class="lineno">   72</span>                <span class="comment">// {(1,2,3),(1,2,3),(3,3)}</span></div>
-<div class="line"><span class="lineno">   73</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   73</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   74</span> </div>
 <div class="line"><span class="lineno">   75</span>    <span class="comment">// 3rd test</span></div>
-<div class="line"><span class="lineno">   76</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;3rd test &quot;</span>;</div>
-<div class="line"><span class="lineno">   77</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> array3 = {1, 1, 1, 1};</div>
+<div class="line"><span class="lineno">   76</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test &quot;</span>;</div>
+<div class="line"><span class="lineno">   77</span>    std::vector&lt;int32_t&gt; array3 = {1, 1, 1, 1};</div>
 <div class="line"><span class="lineno">   78</span>    assert(backtracking::subset_sum::number_of_subsets(1, array3) ==</div>
 <div class="line"><span class="lineno">   79</span>           4);  <span class="comment">// here we are expecting 4 subsets which sum up to 1 i.e.</span></div>
 <div class="line"><span class="lineno">   80</span>                <span class="comment">// {(1),(1),(1),(1)}</span></div>
-<div class="line"><span class="lineno">   81</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   81</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   82</span> </div>
 <div class="line"><span class="lineno">   83</span>    <span class="comment">// 4th test</span></div>
-<div class="line"><span class="lineno">   84</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;4th test &quot;</span>;</div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> array4 = {3, 3, 3, 3};</div>
+<div class="line"><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;4th test &quot;</span>;</div>
+<div class="line"><span class="lineno">   85</span>    std::vector&lt;int32_t&gt; array4 = {3, 3, 3, 3};</div>
 <div class="line"><span class="lineno">   86</span>    assert(backtracking::subset_sum::number_of_subsets(6, array4) ==</div>
 <div class="line"><span class="lineno">   87</span>           6);  <span class="comment">// here we are expecting 6 subsets which sum up to 6 i.e.</span></div>
 <div class="line"><span class="lineno">   88</span>                <span class="comment">// {(3,3),(3,3),(3,3),(3,3),(3,3),(3,3)}</span></div>
-<div class="line"><span class="lineno">   89</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   90</span> </div>
 <div class="line"><span class="lineno">   91</span>    <span class="comment">// Test 5</span></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> &lt;&lt; <span class="stringliteral">&quot;5th test &quot;</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&lt;int32_t&gt;</a> array5 = {};</div>
+<div class="line"><span class="lineno">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;5th test &quot;</span>;</div>
+<div class="line"><span class="lineno">   93</span>    std::vector&lt;int32_t&gt; array5 = {};</div>
 <div class="line"><span class="lineno">   94</span>    assert(backtracking::subset_sum::number_of_subsets(6, array5) ==</div>
 <div class="line"><span class="lineno">   95</span>           0);  <span class="comment">// here we are expecting 0 subsets which sum up to 6 i.e. we</span></div>
 <div class="line"><span class="lineno">   96</span>                <span class="comment">// cannot select anything from an empty array</span></div>
-<div class="line"><span class="lineno">   97</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   97</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   98</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="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="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.map b/d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.map
deleted file mode 100644
index f1c101aac..000000000
--- a/d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="backtracking::subset_sum::number_of_subsets" name="backtracking::subset_sum::number_of_subsets">
-<area shape="rect" id="Node000001" title="The main function implements count of subsets." alt="" coords="5,29,181,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="56,29,54,19,60,10,73,5,93,3,114,5,127,11,124,16,113,10,93,8,75,10,64,15,60,20,61,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="229,37,344,62"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="181,47,213,47,213,52,181,52"/>
-</map>
diff --git a/d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.md5 b/d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.md5
deleted file mode 100644
index 6c265bbb4..000000000
--- a/d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0167af918816be760ae4a84116edffca
\ No newline at end of file
diff --git a/d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.svg b/d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.svg
deleted file mode 100644
index ad002c6a4..000000000
--- a/d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::subset_sum::number_of_subsets Pages: 1 -->
-<svg width="262pt" height="57pt"
- viewBox="0.00 0.00 262.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::subset_sum::number_of_subsets</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function implements count of subsets.">
-<polygon fill="#999999" stroke="#666666" points="131.5,-30.5 0,-30.5 0,0 131.5,0 131.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::subset</text>
-<text text-anchor="middle" x="65.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sum::number_of_subsets</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.06,-30.99C34.81,-40.06 43.38,-48.5 65.75,-48.5 77.99,-48.5 86.09,-45.97 90.07,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.51,-42.84 91.26,-32.49 86.57,-41.99 93.51,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254,-24.88 167.5,-24.88 167.5,-5.63 254,-5.63 254,-24.88"/>
-<text text-anchor="middle" x="210.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.97,-15.25C139.9,-15.25 147.93,-15.25 155.66,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.62,-18.75 165.62,-15.25 155.62,-11.75 155.62,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph_org.svg b/d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph_org.svg
deleted file mode 100644
index 74dc4afdf..000000000
--- a/d2/d5a/subset__sum_8cpp_a7cb50d36a59427a33f64a266dac83d99_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::subset_sum::number_of_subsets Pages: 1 -->
-<svg width="262pt" height="57pt"
- viewBox="0.00 0.00 262.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::subset_sum::number_of_subsets</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function implements count of subsets.">
-<polygon fill="#999999" stroke="#666666" points="131.5,-30.5 0,-30.5 0,0 131.5,0 131.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::subset</text>
-<text text-anchor="middle" x="65.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sum::number_of_subsets</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.06,-30.99C34.81,-40.06 43.38,-48.5 65.75,-48.5 77.99,-48.5 86.09,-45.97 90.07,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.51,-42.84 91.26,-32.49 86.57,-41.99 93.51,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254,-24.88 167.5,-24.88 167.5,-5.63 254,-5.63 254,-24.88"/>
-<text text-anchor="middle" x="210.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.97,-15.25C139.9,-15.25 147.93,-15.25 155.66,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.62,-18.75 165.62,-15.25 155.62,-11.75 155.62,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 70d5655bc..000000000
--- a/d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index ba23d1a28..000000000
--- a/d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bd038f66bf9d22bf1d56990307c4d8c4
\ No newline at end of file
diff --git a/d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 4d8821131..000000000
--- a/d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 9b8e12ae0..000000000
--- a/d2/d5a/subset__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index ec67d1ecf..000000000
--- a/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d2/d5a/subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 90956ad7d..000000000
--- a/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-574f4d71b42b28252ea9230e978fabd8
\ No newline at end of file
diff --git a/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index bfbef9751..000000000
--- a/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d5a/subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index e0a300d0e..000000000
--- a/d2/d5a/subset__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d5a/subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d5a/subset__sum_8cpp_source.html b/d2/d5a/subset__sum_8cpp_source.html
new file mode 100644
index 000000000..88bcb685d
--- /dev/null
+++ b/d2/d5a/subset__sum_8cpp_source.html
@@ -0,0 +1,222 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: backtracking/subset_sum.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d2/d5a/subset__sum_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">subset_sum.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d2/d5a/subset__sum_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../db/dc0/namespacebacktracking.html">backtracking</a> {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dc/d3a/namespacesubset__sum.html">subset_sum</a> {</div>
+<div class="foldopen" id="foldopen00034" data-start="{" data-end="}">
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../d2/d5a/subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99">   34</a></span>uint64_t <a class="code hl_function" href="../../d2/d5a/subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99">number_of_subsets</a>(int32_t sum, <span class="keyword">const</span> std::vector&lt;int32_t&gt; &amp;in_arr) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    int32_t nelement = in_arr.size();</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    uint64_t count_of_subset = 0;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">for</span> (int32_t i = 0; i &lt; (1 &lt;&lt; (nelement)); i++) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        int32_t check = 0;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <span class="keywordflow">for</span> (int32_t j = 0; j &lt; nelement; j++) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>            <span class="keywordflow">if</span> (i &amp; (1 &lt;&lt; j)) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>                check += (in_arr[j]);</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>            }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        }</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="keywordflow">if</span> (check == sum) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            count_of_subset++;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">return</span> count_of_subset;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>}</div>
+</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>}  <span class="comment">// namespace subset_sum</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>}  <span class="comment">// namespace backtracking</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="foldopen" id="foldopen00058" data-start="{" data-end="}">
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../d2/d5a/subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   58</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d5a/subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="comment">// 1st test</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test &quot;</span>;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    std::vector&lt;int32_t&gt; array1 = {-7, -3, -2, 5, 8};  <span class="comment">// input array</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    assert(backtracking::subset_sum::number_of_subsets(0, array1) ==</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>           2);  <span class="comment">// first argument in subset_sum function is the required sum and</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>                <span class="comment">// second is the input array</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="comment">// 2nd test</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test &quot;</span>;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    std::vector&lt;int32_t&gt; array2 = {1, 2, 3, 3};</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    assert(backtracking::subset_sum::number_of_subsets(6, array2) ==</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>           3);  <span class="comment">// here we are expecting 3 subsets which sum up to 6 i.e.</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>                <span class="comment">// {(1,2,3),(1,2,3),(3,3)}</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="comment">// 3rd test</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test &quot;</span>;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    std::vector&lt;int32_t&gt; array3 = {1, 1, 1, 1};</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    assert(backtracking::subset_sum::number_of_subsets(1, array3) ==</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>           4);  <span class="comment">// here we are expecting 4 subsets which sum up to 1 i.e.</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>                <span class="comment">// {(1),(1),(1),(1)}</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="comment">// 4th test</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;4th test &quot;</span>;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::vector&lt;int32_t&gt; array4 = {3, 3, 3, 3};</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    assert(backtracking::subset_sum::number_of_subsets(6, array4) ==</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>           6);  <span class="comment">// here we are expecting 6 subsets which sum up to 6 i.e.</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>                <span class="comment">// {(3,3),(3,3),(3,3),(3,3),(3,3),(3,3)}</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="comment">// Test 5</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;5th test &quot;</span>;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    std::vector&lt;int32_t&gt; array5 = {};</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    assert(backtracking::subset_sum::number_of_subsets(6, array5) ==</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>           0);  <span class="comment">// here we are expecting 0 subsets which sum up to 6 i.e. we</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>                <span class="comment">// cannot select anything from an empty array</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>}</div>
+</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="foldopen" id="foldopen00104" data-start="{" data-end="}">
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"><a class="line" href="../../d2/d5a/subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  104</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d2/d5a/subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <a class="code hl_function" href="../../d2/d5a/subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>}</div>
+</div>
+<div class="ttc" id="anamespacebacktracking_html"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html">backtracking</a></div><div class="ttdoc">for vector container</div></div>
+<div class="ttc" id="anamespacesubset__sum_html"><div class="ttname"><a href="../../dc/d3a/namespacesubset__sum.html">subset_sum</a></div><div class="ttdoc">Functions for [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm.</div></div>
+<div class="ttc" id="asubset__sum_8cpp_html_a7cb50d36a59427a33f64a266dac83d99"><div class="ttname"><a href="../../d2/d5a/subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99">backtracking::subset_sum::number_of_subsets</a></div><div class="ttdeci">uint64_t number_of_subsets(int32_t sum, const std::vector&lt; int32_t &gt; &amp;in_arr)</div><div class="ttdoc">The main function implements count of subsets.</div><div class="ttdef"><b>Definition</b> <a href="#l00034">subset_sum.cpp:34</a></div></div>
+<div class="ttc" id="asubset__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d2/d5a/subset__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> <a href="#l00058">subset_sum.cpp:58</a></div></div>
+<div class="ttc" id="asubset__sum_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d2/d5a/subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00104">subset_sum.cpp:104</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a class="el" href="../../d2/d5a/subset__sum_8cpp.html">subset_sum.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d2/d64/prims__minimum__spanning__tree_8cpp_source.html b/d2/d64/prims__minimum__spanning__tree_8cpp_source.html
new file mode 100644
index 000000000..48357dc0f
--- /dev/null
+++ b/d2/d64/prims__minimum__spanning__tree_8cpp_source.html
@@ -0,0 +1,206 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: greedy_algorithms/prims_minimum_spanning_tree.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d2/d64/prims__minimum__spanning__tree_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">prims_minimum_spanning_tree.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#define V 4</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#define INFINITY 99999</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span> </div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="keywordtype">int</span> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[V][V] = {{0, 5, 1, 2}, {5, 0, 3, 3}, {1, 3, 0, 4}, {2, 3, 4, 0}};</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="foldopen" id="foldopen00009" data-start="{" data-end="};">
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"><a class="line" href="../../d1/d77/structmst.html">    9</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../d1/d77/structmst.html">mst</a> {</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    <span class="keywordtype">bool</span> visited;</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    <span class="keywordtype">int</span> key;</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="keywordtype">int</span> near;</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>};</div>
+</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><a class="code hl_struct" href="../../d1/d77/structmst.html">mst</a> MST_Array[V];</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="keywordtype">void</span> initilize() {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        MST_Array[i].visited = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        MST_Array[i].key = INFINITY;  <span class="comment">// considering INFINITY as inifinity</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        MST_Array[i].near = i;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    }</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    MST_Array[0].key = 0;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>}</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keywordtype">void</span> updateNear() {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> v = 0; v &lt; V; v++) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>        <span class="keywordtype">int</span> min = INFINITY;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        <span class="keywordtype">int</span> minIndex = 0;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>            <span class="keywordflow">if</span> (MST_Array[i].key &lt; min &amp;&amp; MST_Array[i].visited == <span class="keyword">false</span> &amp;&amp;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>                MST_Array[i].key != INFINITY) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>                min = MST_Array[i].key;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>                minIndex = i;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>            }</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        }</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        MST_Array[minIndex].visited = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>            <span class="keywordflow">if</span> (<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[minIndex][i] != 0 &amp;&amp; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[minIndex][i] &lt; INFINITY) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>                <span class="keywordflow">if</span> (<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[minIndex][i] &lt; MST_Array[i].key) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>                    MST_Array[i].key = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[minIndex][i];</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>                    MST_Array[i].near = minIndex;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>                }</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>}</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="keywordtype">void</span> show() {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  -  &quot;</span> &lt;&lt; MST_Array[i].near &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>             &lt;&lt; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[i][MST_Array[i].near] &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>}</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    initilize();</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    updateNear();</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    show();</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></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 class="ttc" id="astructmst_html"><div class="ttname"><a href="../../d1/d77/structmst.html">mst</a></div><div class="ttdef"><b>Definition</b> <a href="#l00009">prims_minimum_spanning_tree.cpp:9</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_0eaa691bd54ab0922ca7f50599de6d22.html">greedy_algorithms</a></li><li class="navelem"><b>prims_minimum_spanning_tree.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d2/d7d/egg__dropping__puzzle_8cpp_source.html b/d2/d7d/egg__dropping__puzzle_8cpp_source.html
new file mode 100644
index 000000000..20e866a5b
--- /dev/null
+++ b/d2/d7d/egg__dropping__puzzle_8cpp_source.html
@@ -0,0 +1,189 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/egg_dropping_puzzle.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d2/d7d/egg__dropping__puzzle_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">egg_dropping_puzzle.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/* Function to get minimun number of trials needed</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * in worst case with n eggs and k floors</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &lt;climits&gt;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="keywordtype">int</span> eggDrop(<span class="keywordtype">int</span> n, <span class="keywordtype">int</span> k) {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    std::vector&lt;std::vector&lt;int&gt; &gt; eggFloor(n + 1, std::vector&lt;int&gt;(k + 1));</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= n; i++) {</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>        eggFloor[i][1] = 1;  <span class="comment">// n eggs..1 Floor</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        eggFloor[i][0] = 0;  <span class="comment">// n eggs..0 Floor</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    }</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="comment">// Only one egg available</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 1; j &lt;= <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>; j++) {</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        eggFloor[1][j] = j;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    }</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i &lt;= n; i++) {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 2; j &lt;= <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>; j++) {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>            eggFloor[i][j] = INT_MAX;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 1; x &lt;= j; x++) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>                <span class="comment">// 1+max(eggBreak[one less egg, lower floors],</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>                <span class="comment">//       eggDoesntBreak[same # of eggs, upper floors]);</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>                <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = 1 + max(eggFloor[i - 1][x - 1], eggFloor[i][j - x]);</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>                <span class="keywordflow">if</span> (result &lt; eggFloor[i][j])</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>                    eggFloor[i][j] = <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>            }</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        }</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    }</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordflow">return</span> eggFloor[n][<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>];</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>}</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordtype">int</span> n, <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    cout &lt;&lt; <span class="stringliteral">&quot;Enter number of eggs and floors: &quot;</span>;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    cin &gt;&gt; n &gt;&gt; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    cout &lt;&lt; <span class="stringliteral">&quot;Minimum number of trials in worst case: &quot;</span> &lt;&lt; eggDrop(n, k) &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>}</div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><b>egg_dropping_puzzle.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d2/d84/classprobability_1_1geometric__dist_1_1geometric__distribution-members.html b/d2/d84/classprobability_1_1geometric__dist_1_1geometric__distribution-members.html
index 897089d68..f4490c3ba 100644
--- a/d2/d84/classprobability_1_1geometric__dist_1_1geometric__distribution-members.html
+++ b/d2/d84/classprobability_1_1geometric__dist_1_1geometric__distribution-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html
index 0c3d5cad4..6887c8278 100644
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html
+++ b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: range_queries::heavy_light_decomposition::HLD&lt; X &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: range_queries::heavy_light_decomposition::HLD&lt; X &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -150,7 +167,7 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:ab916d554afa8ca5230b4310c2c69fae0 inherit pub_methods_classrange__queries_1_1heavy__light__decomposition_1_1_tree" id="r_ab916d554afa8ca5230b4310c2c69fae0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0">change_root</a> (int new_root)</td></tr>
 <tr class="memdesc:ab916d554afa8ca5230b4310c2c69fae0 inherit pub_methods_classrange__queries_1_1heavy__light__decomposition_1_1_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">Set the root for the tree.  <br /></td></tr>
 <tr class="separator:ab916d554afa8ca5230b4310c2c69fae0 inherit pub_methods_classrange__queries_1_1heavy__light__decomposition_1_1_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a04cd96efaba147b19d3afc769b90ff70 inherit pub_methods_classrange__queries_1_1heavy__light__decomposition_1_1_tree" id="r_a04cd96efaba147b19d3afc769b90ff70"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70">set_node_val</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; X &gt; &amp;node_val)</td></tr>
+<tr class="memitem:a04cd96efaba147b19d3afc769b90ff70 inherit pub_methods_classrange__queries_1_1heavy__light__decomposition_1_1_tree" id="r_a04cd96efaba147b19d3afc769b90ff70"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70">set_node_val</a> (const std::vector&lt; X &gt; &amp;node_val)</td></tr>
 <tr class="memdesc:a04cd96efaba147b19d3afc769b90ff70 inherit pub_methods_classrange__queries_1_1heavy__light__decomposition_1_1_tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">Set the values for all the nodes.  <br /></td></tr>
 <tr class="separator:a04cd96efaba147b19d3afc769b90ff70 inherit pub_methods_classrange__queries_1_1heavy__light__decomposition_1_1_tree"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ad22d760a5a33545a70e7ea5e1786c8dc inherit pub_methods_classrange__queries_1_1heavy__light__decomposition_1_1_tree" id="r_ad22d760a5a33545a70e7ea5e1786c8dc"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc">init</a> ()</td></tr>
@@ -183,21 +200,17 @@ Private Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a722cc7cf2c3e4d15583601a48b09776f" id="r_a722cc7cf2c3e4d15583601a48b09776f"><td class="memItemLeft" align="right" valign="top"><a id="a722cc7cf2c3e4d15583601a48b09776f" name="a722cc7cf2c3e4d15583601a48b09776f"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>label</b></td></tr>
-<tr class="memdesc:a722cc7cf2c3e4d15583601a48b09776f"><td class="mdescLeft">&#160;</td><td class="mdescRight">utility member to assign labels in <a class="el" href="#a0579062b384e54b611b80c6337c7f2c8" title="Utility function to lable the nodes so that heavy chains have a contigous lable.">dfs_labels()</a> <br /></td></tr>
+<tr class="memitem:a722cc7cf2c3e4d15583601a48b09776f" id="r_a722cc7cf2c3e4d15583601a48b09776f"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a722cc7cf2c3e4d15583601a48b09776f">label</a></td></tr>
+<tr class="memdesc:a722cc7cf2c3e4d15583601a48b09776f"><td class="mdescLeft">&#160;</td><td class="mdescRight">utility member to assign labels in <a class="el" href="#a0579062b384e54b611b80c6337c7f2c8" title="Utility function to lable the nodes so that heavy chains have a contigous lable.">dfs_labels()</a>  <br /></td></tr>
 <tr class="separator:a722cc7cf2c3e4d15583601a48b09776f"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa86a91ae0cd7898990a8170a2f2c9cda" id="r_aa86a91ae0cd7898990a8170a2f2c9cda"><td class="memItemLeft" align="right" valign="top"><a id="aa86a91ae0cd7898990a8170a2f2c9cda" name="aa86a91ae0cd7898990a8170a2f2c9cda"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>h_label</b></td></tr>
-<tr class="memdesc:aa86a91ae0cd7898990a8170a2f2c9cda"><td class="mdescLeft">&#160;</td><td class="mdescRight">stores the label of a node <br /></td></tr>
+<tr class="memitem:aa86a91ae0cd7898990a8170a2f2c9cda" id="r_aa86a91ae0cd7898990a8170a2f2c9cda"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa86a91ae0cd7898990a8170a2f2c9cda">h_label</a></td></tr>
+<tr class="memdesc:aa86a91ae0cd7898990a8170a2f2c9cda"><td class="mdescLeft">&#160;</td><td class="mdescRight">stores the label of a node  <br /></td></tr>
 <tr class="separator:aa86a91ae0cd7898990a8170a2f2c9cda"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a84424f180f12b514eaab57a6aa20b104" id="r_a84424f180f12b514eaab57a6aa20b104"><td class="memItemLeft" align="right" valign="top"><a id="a84424f180f12b514eaab57a6aa20b104" name="a84424f180f12b514eaab57a6aa20b104"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>h_heavychlid</b></td></tr>
-<tr class="memdesc:a84424f180f12b514eaab57a6aa20b104"><td class="mdescLeft">&#160;</td><td class="mdescRight">stores the heavy child of a node <br /></td></tr>
+<tr class="memitem:a84424f180f12b514eaab57a6aa20b104" id="r_a84424f180f12b514eaab57a6aa20b104"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a84424f180f12b514eaab57a6aa20b104">h_heavychlid</a></td></tr>
+<tr class="memdesc:a84424f180f12b514eaab57a6aa20b104"><td class="mdescLeft">&#160;</td><td class="mdescRight">stores the heavy child of a node  <br /></td></tr>
 <tr class="separator:a84424f180f12b514eaab57a6aa20b104"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a1b336474d17eff1aa4be73d4068dc725" id="r_a1b336474d17eff1aa4be73d4068dc725"><td class="memItemLeft" align="right" valign="top"><a id="a1b336474d17eff1aa4be73d4068dc725" name="a1b336474d17eff1aa4be73d4068dc725"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>h_parent</b></td></tr>
-<tr class="memdesc:a1b336474d17eff1aa4be73d4068dc725"><td class="mdescLeft">&#160;</td><td class="mdescRight">stores the top of the heavy chain from a node <br /></td></tr>
+<tr class="memitem:a1b336474d17eff1aa4be73d4068dc725" id="r_a1b336474d17eff1aa4be73d4068dc725"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1b336474d17eff1aa4be73d4068dc725">h_parent</a></td></tr>
+<tr class="memdesc:a1b336474d17eff1aa4be73d4068dc725"><td class="mdescLeft">&#160;</td><td class="mdescRight">stores the top of the heavy chain from a node  <br /></td></tr>
 <tr class="separator:a1b336474d17eff1aa4be73d4068dc725"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -209,6 +222,8 @@ class range_queries::heavy_light_decomposition::HLD&lt; X &gt;</div><p>The Heavy
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00336">336</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a6e486767434e44076c1ac374a22da726" name="a6e486767434e44076c1ac374a22da726"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a6e486767434e44076c1ac374a22da726">&#9670;&#160;</a></span>HLD()</h2>
@@ -242,26 +257,23 @@ template&lt;typename X &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00409">409</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  435</span>                             : <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1">Tree&lt;X&gt;</a>(nodes), <a class="code hl_function" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1">SG&lt;X&gt;</a>(nodes) {</div>
 <div class="line"><span class="lineno">  436</span>    <span class="comment">/* Initialization and resize vectors */</span></div>
 <div class="line"><span class="lineno">  437</span>    <a class="code hl_variable" href="#a722cc7cf2c3e4d15583601a48b09776f">label</a> = 0;</div>
-<div class="line"><span class="lineno">  438</span>    <a class="code hl_variable" href="#aa86a91ae0cd7898990a8170a2f2c9cda">h_label</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/assign.html">assign</a>(<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">Tree&lt;X&gt;::t_nodes</a>, -1);</div>
-<div class="line"><span class="lineno">  439</span>    <a class="code hl_variable" href="#a84424f180f12b514eaab57a6aa20b104">h_heavychlid</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/assign.html">assign</a>(<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">Tree&lt;X&gt;::t_nodes</a>, -1);</div>
-<div class="line"><span class="lineno">  440</span>    <a class="code hl_variable" href="#a1b336474d17eff1aa4be73d4068dc725">h_parent</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/resize.html">resize</a>(<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">Tree&lt;X&gt;::t_nodes</a>);</div>
-<div class="line"><span class="lineno">  441</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/iota.html">iota</a>(<a class="code hl_variable" href="#a1b336474d17eff1aa4be73d4068dc725">h_parent</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), <a class="code hl_variable" href="#a1b336474d17eff1aa4be73d4068dc725">h_parent</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>(), 0);</div>
+<div class="line"><span class="lineno">  438</span>    <a class="code hl_variable" href="#aa86a91ae0cd7898990a8170a2f2c9cda">h_label</a>.assign(<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">Tree&lt;X&gt;::t_nodes</a>, -1);</div>
+<div class="line"><span class="lineno">  439</span>    <a class="code hl_variable" href="#a84424f180f12b514eaab57a6aa20b104">h_heavychlid</a>.assign(<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">Tree&lt;X&gt;::t_nodes</a>, -1);</div>
+<div class="line"><span class="lineno">  440</span>    <a class="code hl_variable" href="#a1b336474d17eff1aa4be73d4068dc725">h_parent</a>.resize(<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">Tree&lt;X&gt;::t_nodes</a>);</div>
+<div class="line"><span class="lineno">  441</span>    iota(<a class="code hl_variable" href="#a1b336474d17eff1aa4be73d4068dc725">h_parent</a>.begin(), <a class="code hl_variable" href="#a1b336474d17eff1aa4be73d4068dc725">h_parent</a>.end(), 0);</div>
 <div class="line"><span class="lineno">  442</span>  }</div>
-<div class="ttc" id="aassign_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/assign.html">std::vector::assign</a></div><div class="ttdeci">T assign(T... args)</div></div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a1b336474d17eff1aa4be73d4068dc725"><div class="ttname"><a href="#a1b336474d17eff1aa4be73d4068dc725">range_queries::heavy_light_decomposition::HLD::h_parent</a></div><div class="ttdeci">std::vector&lt; int &gt; h_parent</div><div class="ttdoc">stores the top of the heavy chain from a node</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:341</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a722cc7cf2c3e4d15583601a48b09776f"><div class="ttname"><a href="#a722cc7cf2c3e4d15583601a48b09776f">range_queries::heavy_light_decomposition::HLD::label</a></div><div class="ttdeci">int label</div><div class="ttdoc">utility member to assign labels in dfs_labels()</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:338</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a84424f180f12b514eaab57a6aa20b104"><div class="ttname"><a href="#a84424f180f12b514eaab57a6aa20b104">range_queries::heavy_light_decomposition::HLD::h_heavychlid</a></div><div class="ttdeci">std::vector&lt; int &gt; h_heavychlid</div><div class="ttdoc">stores the heavy child of a node</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:340</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_aa86a91ae0cd7898990a8170a2f2c9cda"><div class="ttname"><a href="#aa86a91ae0cd7898990a8170a2f2c9cda">range_queries::heavy_light_decomposition::HLD::h_label</a></div><div class="ttdeci">std::vector&lt; int &gt; h_label</div><div class="ttdoc">stores the label of a node</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:339</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_afba5c1225ba04c0025c7786c09ff28f1"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1">range_queries::heavy_light_decomposition::SG::SG</a></div><div class="ttdeci">SG(int size)</div><div class="ttdoc">Class parameterized constructor. Resizes the and initilizes the data members.</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:282</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a835fb2bbb27307b8cacad9b287968bc1"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1">range_queries::heavy_light_decomposition::Tree::Tree</a></div><div class="ttdeci">Tree(int nodes)</div><div class="ttdoc">Class parameterized constructor, resizes the and initializes the data members.</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:140</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ae4630fa70a80a1dc65a875488a67178a"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">range_queries::heavy_light_decomposition::Tree::t_nodes</a></div><div class="ttdeci">const int t_nodes</div><div class="ttdoc">number of nodes</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:84</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="aiota_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/iota.html">std::iota</a></div><div class="ttdeci">T iota(T... args)</div></div>
-<div class="ttc" id="aresize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/resize.html">std::vector::resize</a></div><div class="ttdeci">T resize(T... args)</div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a1b336474d17eff1aa4be73d4068dc725"><div class="ttname"><a href="#a1b336474d17eff1aa4be73d4068dc725">range_queries::heavy_light_decomposition::HLD::h_parent</a></div><div class="ttdeci">std::vector&lt; int &gt; h_parent</div><div class="ttdoc">stores the top of the heavy chain from a node</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00341">heavy_light_decomposition.cpp:341</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a722cc7cf2c3e4d15583601a48b09776f"><div class="ttname"><a href="#a722cc7cf2c3e4d15583601a48b09776f">range_queries::heavy_light_decomposition::HLD::label</a></div><div class="ttdeci">int label</div><div class="ttdoc">utility member to assign labels in dfs_labels()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00338">heavy_light_decomposition.cpp:338</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a84424f180f12b514eaab57a6aa20b104"><div class="ttname"><a href="#a84424f180f12b514eaab57a6aa20b104">range_queries::heavy_light_decomposition::HLD::h_heavychlid</a></div><div class="ttdeci">std::vector&lt; int &gt; h_heavychlid</div><div class="ttdoc">stores the heavy child of a node</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00340">heavy_light_decomposition.cpp:340</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_aa86a91ae0cd7898990a8170a2f2c9cda"><div class="ttname"><a href="#aa86a91ae0cd7898990a8170a2f2c9cda">range_queries::heavy_light_decomposition::HLD::h_label</a></div><div class="ttdeci">std::vector&lt; int &gt; h_label</div><div class="ttdoc">stores the label of a node</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00339">heavy_light_decomposition.cpp:339</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_afba5c1225ba04c0025c7786c09ff28f1"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1">range_queries::heavy_light_decomposition::SG::SG</a></div><div class="ttdeci">SG(int size)</div><div class="ttdoc">Class parameterized constructor. Resizes the and initilizes the data members.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00282">heavy_light_decomposition.cpp:282</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a835fb2bbb27307b8cacad9b287968bc1"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1">range_queries::heavy_light_decomposition::Tree::Tree</a></div><div class="ttdeci">Tree(int nodes)</div><div class="ttdoc">Class parameterized constructor, resizes the and initializes the data members.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00140">heavy_light_decomposition.cpp:140</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ae4630fa70a80a1dc65a875488a67178a"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">range_queries::heavy_light_decomposition::Tree::t_nodes</a></div><div class="ttdeci">const int t_nodes</div><div class="ttdoc">number of nodes</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00084">heavy_light_decomposition.cpp:84</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -304,10 +316,12 @@ template&lt;typename X &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the sum of ndoe values in the simple path from a to b </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00409">409</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  409</span>                              {</div>
 <div class="line"><span class="lineno">  410</span>    X ret = <a class="code hl_variable" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5">SG&lt;X&gt;::sret_init</a>;</div>
 <div class="line"><span class="lineno">  411</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">Tree&lt;X&gt;::t_depth</a>[a] &lt; <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">Tree&lt;X&gt;::t_depth</a>[b]) {</div>
-<div class="line"><span class="lineno">  412</span>      <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(a, b);</div>
+<div class="line"><span class="lineno">  412</span>      std::swap(a, b);</div>
 <div class="line"><span class="lineno">  413</span>    }</div>
 <div class="line"><span class="lineno">  414</span>    <span class="keywordflow">while</span> (<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">Tree&lt;X&gt;::t_depth</a>[a] &gt;= <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">Tree&lt;X&gt;::t_depth</a>[b]) {</div>
 <div class="line"><span class="lineno">  415</span>      <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> = <a class="code hl_variable" href="#aa86a91ae0cd7898990a8170a2f2c9cda">h_label</a>[<a class="code hl_variable" href="#a1b336474d17eff1aa4be73d4068dc725">h_parent</a>[a]];</div>
@@ -323,19 +337,13 @@ template&lt;typename X &gt; </div>
 <div class="line"><span class="lineno">  425</span>    }</div>
 <div class="line"><span class="lineno">  426</span>    <span class="keywordflow">return</span> ret;</div>
 <div class="line"><span class="lineno">  427</span>  }</div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_a1fda852e6e522707fd97f61cdb0a2591"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a1fda852e6e522707fd97f61cdb0a2591">range_queries::heavy_light_decomposition::SG::query</a></div><div class="ttdeci">X query(int l, int r)</div><div class="ttdoc">Make a range query from node label l to node label r.</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:305</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_a41c733f5f5e262b308f7cb95c88c1e74"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74">range_queries::heavy_light_decomposition::SG::combine</a></div><div class="ttdeci">X combine(X lhs, X rhs)</div><div class="ttdoc">Function that specifies the type of operation involved when segments are combined.</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:274</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_aa7f93971a9f891e0bbb7023081f379d5"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5">range_queries::heavy_light_decomposition::SG::sret_init</a></div><div class="ttdeci">X sret_init</div><div class="ttdoc">inital query return value</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:264</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a0efd0b9c564092f443ca97030d866ef1"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">range_queries::heavy_light_decomposition::Tree::t_depth</a></div><div class="ttdeci">std::vector&lt; int &gt; t_depth</div><div class="ttdoc">a vector to store the depth of a node,</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:88</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a350157a5fb79f76fceae33fc84171203"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">range_queries::heavy_light_decomposition::Tree::t_par</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; t_par</div><div class="ttdoc">a matrix to store every node's 2^kth parent</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:87</div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:119</div></div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- 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="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.svg" width="350" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_a1fda852e6e522707fd97f61cdb0a2591"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a1fda852e6e522707fd97f61cdb0a2591">range_queries::heavy_light_decomposition::SG::query</a></div><div class="ttdeci">X query(int l, int r)</div><div class="ttdoc">Make a range query from node label l to node label r.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00305">heavy_light_decomposition.cpp:305</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_a41c733f5f5e262b308f7cb95c88c1e74"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74">range_queries::heavy_light_decomposition::SG::combine</a></div><div class="ttdeci">X combine(X lhs, X rhs)</div><div class="ttdoc">Function that specifies the type of operation involved when segments are combined.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00274">heavy_light_decomposition.cpp:274</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_aa7f93971a9f891e0bbb7023081f379d5"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5">range_queries::heavy_light_decomposition::SG::sret_init</a></div><div class="ttdeci">X sret_init</div><div class="ttdoc">inital query return value</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00264">heavy_light_decomposition.cpp:264</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a0efd0b9c564092f443ca97030d866ef1"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">range_queries::heavy_light_decomposition::Tree::t_depth</a></div><div class="ttdeci">std::vector&lt; int &gt; t_depth</div><div class="ttdoc">a vector to store the depth of a node,</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00088">heavy_light_decomposition.cpp:88</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a350157a5fb79f76fceae33fc84171203"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">range_queries::heavy_light_decomposition::Tree::t_par</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; t_par</div><div class="ttdoc">a matrix to store every node's 2^kth parent</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00087">heavy_light_decomposition.cpp:87</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00119">composite_simpson_rule.cpp:119</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af64848d6630c39d0f09ce2359cc7c4f8" name="af64848d6630c39d0f09ce2359cc7c4f8"></a>
@@ -376,6 +384,8 @@ template&lt;typename X &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00350">350</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  350</span>                                 {</div>
 <div class="line"><span class="lineno">  351</span>    <span class="keywordtype">int</span> hc_size = -1, hc_id = -1;</div>
 <div class="line"><span class="lineno">  352</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> &amp;v : <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab1aeaefa1bd97b867c652ba916fbdb43">Tree&lt;X&gt;::t_adj</a>[u]) {</div>
@@ -389,15 +399,10 @@ template&lt;typename X &gt; </div>
 <div class="line"><span class="lineno">  360</span>    }</div>
 <div class="line"><span class="lineno">  361</span>    <a class="code hl_variable" href="#a84424f180f12b514eaab57a6aa20b104">h_heavychlid</a>[u] = hc_id;</div>
 <div class="line"><span class="lineno">  362</span>  }</div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_af64848d6630c39d0f09ce2359cc7c4f8"><div class="ttname"><a href="#af64848d6630c39d0f09ce2359cc7c4f8">range_queries::heavy_light_decomposition::HLD::dfs_hc</a></div><div class="ttdeci">void dfs_hc(int u, int p=-1)</div><div class="ttdoc">Utility function to assign heavy child to each node (-1 for a leaf node)</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:350</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ab1aeaefa1bd97b867c652ba916fbdb43"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab1aeaefa1bd97b867c652ba916fbdb43">range_queries::heavy_light_decomposition::Tree::t_adj</a></div><div class="ttdeci">std::vector&lt; std::list&lt; int &gt; &gt; t_adj</div><div class="ttdoc">an adjacency list to stores the tree edges</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:83</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ada1494fccbc7f1f07b2f9be9f7e07ad5"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ada1494fccbc7f1f07b2f9be9f7e07ad5">range_queries::heavy_light_decomposition::Tree::t_size</a></div><div class="ttdeci">std::vector&lt; int &gt; t_size</div><div class="ttdoc">a vector to store the subtree size rooted at node</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:89</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_af64848d6630c39d0f09ce2359cc7c4f8_cgraph.svg" width="156" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_af64848d6630c39d0f09ce2359cc7c4f8"><div class="ttname"><a href="#af64848d6630c39d0f09ce2359cc7c4f8">range_queries::heavy_light_decomposition::HLD::dfs_hc</a></div><div class="ttdeci">void dfs_hc(int u, int p=-1)</div><div class="ttdoc">Utility function to assign heavy child to each node (-1 for a leaf node)</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00350">heavy_light_decomposition.cpp:350</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ab1aeaefa1bd97b867c652ba916fbdb43"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab1aeaefa1bd97b867c652ba916fbdb43">range_queries::heavy_light_decomposition::Tree::t_adj</a></div><div class="ttdeci">std::vector&lt; std::list&lt; int &gt; &gt; t_adj</div><div class="ttdoc">an adjacency list to stores the tree edges</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00083">heavy_light_decomposition.cpp:83</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ada1494fccbc7f1f07b2f9be9f7e07ad5"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ada1494fccbc7f1f07b2f9be9f7e07ad5">range_queries::heavy_light_decomposition::Tree::t_size</a></div><div class="ttdeci">std::vector&lt; int &gt; t_size</div><div class="ttdoc">a vector to store the subtree size rooted at node</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00089">heavy_light_decomposition.cpp:89</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0579062b384e54b611b80c6337c7f2c8" name="a0579062b384e54b611b80c6337c7f2c8"></a>
@@ -438,6 +443,8 @@ template&lt;typename X &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00390">390</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  390</span>                                     {</div>
 <div class="line"><span class="lineno">  391</span>    <a class="code hl_variable" href="#aa86a91ae0cd7898990a8170a2f2c9cda">h_label</a>[u] = <a class="code hl_variable" href="#a722cc7cf2c3e4d15583601a48b09776f">label</a>++;</div>
 <div class="line"><span class="lineno">  392</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a84424f180f12b514eaab57a6aa20b104">h_heavychlid</a>[u] != -1) {</div>
@@ -449,13 +456,8 @@ template&lt;typename X &gt; </div>
 <div class="line"><span class="lineno">  398</span>      }</div>
 <div class="line"><span class="lineno">  399</span>    }</div>
 <div class="line"><span class="lineno">  400</span>  }</div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a0579062b384e54b611b80c6337c7f2c8"><div class="ttname"><a href="#a0579062b384e54b611b80c6337c7f2c8">range_queries::heavy_light_decomposition::HLD::dfs_labels</a></div><div class="ttdeci">void dfs_labels(int u, int p=-1)</div><div class="ttdoc">Utility function to lable the nodes so that heavy chains have a contigous lable.</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:390</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a0579062b384e54b611b80c6337c7f2c8_cgraph.svg" width="156" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a0579062b384e54b611b80c6337c7f2c8"><div class="ttname"><a href="#a0579062b384e54b611b80c6337c7f2c8">range_queries::heavy_light_decomposition::HLD::dfs_labels</a></div><div class="ttdeci">void dfs_labels(int u, int p=-1)</div><div class="ttdoc">Utility function to lable the nodes so that heavy chains have a contigous lable.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00390">heavy_light_decomposition.cpp:390</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2dfbda148aad0bfaba2ebfda9ebc915a" name="a2dfbda148aad0bfaba2ebfda9ebc915a"></a>
@@ -496,6 +498,8 @@ template&lt;typename X &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00371">371</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  371</span>                                  {</div>
 <div class="line"><span class="lineno">  372</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a84424f180f12b514eaab57a6aa20b104">h_heavychlid</a>[u] != -1) {</div>
 <div class="line"><span class="lineno">  373</span>      <a class="code hl_variable" href="#a1b336474d17eff1aa4be73d4068dc725">h_parent</a>[<a class="code hl_variable" href="#a84424f180f12b514eaab57a6aa20b104">h_heavychlid</a>[u]] = <a class="code hl_variable" href="#a1b336474d17eff1aa4be73d4068dc725">h_parent</a>[u];</div>
@@ -507,13 +511,8 @@ template&lt;typename X &gt; </div>
 <div class="line"><span class="lineno">  379</span>      }</div>
 <div class="line"><span class="lineno">  380</span>    }</div>
 <div class="line"><span class="lineno">  381</span>  }</div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a2dfbda148aad0bfaba2ebfda9ebc915a"><div class="ttname"><a href="#a2dfbda148aad0bfaba2ebfda9ebc915a">range_queries::heavy_light_decomposition::HLD::dfs_par</a></div><div class="ttdeci">void dfs_par(int u, int p=-1)</div><div class="ttdoc">Utility function to assign highest parent that can be reached though heavy chains.</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:371</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a2dfbda148aad0bfaba2ebfda9ebc915a_cgraph.svg" width="156" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a2dfbda148aad0bfaba2ebfda9ebc915a"><div class="ttname"><a href="#a2dfbda148aad0bfaba2ebfda9ebc915a">range_queries::heavy_light_decomposition::HLD::dfs_par</a></div><div class="ttdeci">void dfs_par(int u, int p=-1)</div><div class="ttdoc">Utility function to assign highest parent that can be reached though heavy chains.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00371">heavy_light_decomposition.cpp:371</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae9e979edd69678b85665c01e2ee97828" name="ae9e979edd69678b85665c01e2ee97828"></a>
@@ -543,6 +542,8 @@ template&lt;typename X &gt; </div>
 
 <p>This function must be called after the tree adjacency list and node values are populated The function initializes the required parametes, and populates the segment tree. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00450">450</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  450</span>              {</div>
 <div class="line"><span class="lineno">  451</span>    <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc">Tree&lt;X&gt;::init</a>();</div>
 <div class="line"><span class="lineno">  452</span> </div>
@@ -561,16 +562,11 @@ template&lt;typename X &gt; </div>
 <div class="line"><span class="lineno">  465</span>          <a class="code hl_function" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74">SG&lt;X&gt;::combine</a>(<a class="code hl_variable" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afbf8a9cb9449d5ca844f4e141a801e6a">SG&lt;X&gt;::s_tree</a>[i &lt;&lt; 1], <a class="code hl_variable" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afbf8a9cb9449d5ca844f4e141a801e6a">SG&lt;X&gt;::s_tree</a>[i &lt;&lt; 1 | 1]);</div>
 <div class="line"><span class="lineno">  466</span>    }</div>
 <div class="line"><span class="lineno">  467</span>  }</div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_afbf8a9cb9449d5ca844f4e141a801e6a"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afbf8a9cb9449d5ca844f4e141a801e6a">range_queries::heavy_light_decomposition::SG::s_tree</a></div><div class="ttdeci">std::vector&lt; X &gt; s_tree</div><div class="ttdoc">Everything here is private, and can only be accessed through the methods, in the derived class (HLD)</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:262</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a135b7952593c9b1aae38fcaf1cc1abf7"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a135b7952593c9b1aae38fcaf1cc1abf7">range_queries::heavy_light_decomposition::Tree::t_val</a></div><div class="ttdeci">std::vector&lt; X &gt; t_val</div><div class="ttdoc">values of nodes</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:92</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_aa6c37e840355b9fb2105181c578694e8"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa6c37e840355b9fb2105181c578694e8">range_queries::heavy_light_decomposition::Tree::t_root</a></div><div class="ttdeci">int t_root</div><div class="ttdoc">the root of the tree</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:91</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ad22d760a5a33545a70e7ea5e1786c8dc"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc">range_queries::heavy_light_decomposition::Tree::init</a></div><div class="ttdeci">void init()</div><div class="ttdoc">This function must be called after the tree adjacency list and node values are populated The function...</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:186</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_ae9e979edd69678b85665c01e2ee97828_cgraph.svg" width="543" height="511"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_afbf8a9cb9449d5ca844f4e141a801e6a"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afbf8a9cb9449d5ca844f4e141a801e6a">range_queries::heavy_light_decomposition::SG::s_tree</a></div><div class="ttdeci">std::vector&lt; X &gt; s_tree</div><div class="ttdoc">Everything here is private, and can only be accessed through the methods, in the derived class (HLD)</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00262">heavy_light_decomposition.cpp:262</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a135b7952593c9b1aae38fcaf1cc1abf7"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a135b7952593c9b1aae38fcaf1cc1abf7">range_queries::heavy_light_decomposition::Tree::t_val</a></div><div class="ttdeci">std::vector&lt; X &gt; t_val</div><div class="ttdoc">values of nodes</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00092">heavy_light_decomposition.cpp:92</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_aa6c37e840355b9fb2105181c578694e8"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa6c37e840355b9fb2105181c578694e8">range_queries::heavy_light_decomposition::Tree::t_root</a></div><div class="ttdeci">int t_root</div><div class="ttdoc">the root of the tree</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00091">heavy_light_decomposition.cpp:91</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ad22d760a5a33545a70e7ea5e1786c8dc"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc">range_queries::heavy_light_decomposition::Tree::init</a></div><div class="ttdeci">void init()</div><div class="ttdoc">This function must be called after the tree adjacency list and node values are populated The function...</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00186">heavy_light_decomposition.cpp:186</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4dfbf5d9df825eeb63b294c6849bdcab" name="a4dfbf5d9df825eeb63b294c6849bdcab"></a>
@@ -611,6 +607,8 @@ template&lt;typename X &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the sum of node values in the simple path from a to b </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00489">489</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  489</span>                        {</div>
 <div class="line"><span class="lineno">  490</span>    <span class="keywordtype">int</span> lc = <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4">Tree&lt;X&gt;::lca</a>(a, b);</div>
 <div class="line"><span class="lineno">  491</span>    X ret = <a class="code hl_variable" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5">SG&lt;X&gt;::sret_init</a>;</div>
@@ -619,14 +617,9 @@ template&lt;typename X &gt; </div>
 <div class="line"><span class="lineno">  494</span>    ret += <a class="code hl_function" href="#a7d5b40c076347a6aabfb37a0590f2f24">chain_query</a>(b, lc);</div>
 <div class="line"><span class="lineno">  495</span>    <span class="keywordflow">return</span> ret - <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a135b7952593c9b1aae38fcaf1cc1abf7">Tree&lt;X&gt;::t_val</a>[lc];</div>
 <div class="line"><span class="lineno">  496</span>  }</div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a7d5b40c076347a6aabfb37a0590f2f24"><div class="ttname"><a href="#a7d5b40c076347a6aabfb37a0590f2f24">range_queries::heavy_light_decomposition::HLD::chain_query</a></div><div class="ttdeci">X chain_query(int a, int b)</div><div class="ttdoc">Utility function to break down a path query into two chain queries.</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:409</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ae2b407e64aaf9878fbee7ee6efe9c7d4"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4">range_queries::heavy_light_decomposition::Tree::lca</a></div><div class="ttdeci">int lca(int a, int b)</div><div class="ttdoc">The function returns the least common ancestor of two nodes.</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:229</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.svg" width="543" height="204"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a7d5b40c076347a6aabfb37a0590f2f24"><div class="ttname"><a href="#a7d5b40c076347a6aabfb37a0590f2f24">range_queries::heavy_light_decomposition::HLD::chain_query</a></div><div class="ttdeci">X chain_query(int a, int b)</div><div class="ttdoc">Utility function to break down a path query into two chain queries.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00409">heavy_light_decomposition.cpp:409</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ae2b407e64aaf9878fbee7ee6efe9c7d4"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4">range_queries::heavy_light_decomposition::Tree::lca</a></div><div class="ttdeci">int lca(int a, int b)</div><div class="ttdoc">The function returns the least common ancestor of two nodes.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00229">heavy_light_decomposition.cpp:229</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a9f1cb54ed09fde931bf3220d75ee4c57" name="a9f1cb54ed09fde931bf3220d75ee4c57"></a>
@@ -667,24 +660,134 @@ template&lt;typename X &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00475">475</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  475</span>                               {</div>
 <div class="line"><span class="lineno">  476</span>    X diff = val - <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a135b7952593c9b1aae38fcaf1cc1abf7">Tree&lt;X&gt;::t_val</a>[<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>];</div>
 <div class="line"><span class="lineno">  477</span>    <a class="code hl_function" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c">SG&lt;X&gt;::update</a>(<a class="code hl_variable" href="#aa86a91ae0cd7898990a8170a2f2c9cda">h_label</a>[<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>], diff);</div>
 <div class="line"><span class="lineno">  478</span>    <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a135b7952593c9b1aae38fcaf1cc1abf7">Tree&lt;X&gt;::t_val</a>[<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>] = val;</div>
 <div class="line"><span class="lineno">  479</span>  }</div>
-<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_a3c75bf5770790f8eba8cc92227b5400c"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c">range_queries::heavy_light_decomposition::SG::update</a></div><div class="ttdeci">void update(int p, X v)</div><div class="ttdoc">Update the value at a node.</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:293</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a9f1cb54ed09fde931bf3220d75ee4c57_cgraph.svg" width="350" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_a3c75bf5770790f8eba8cc92227b5400c"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c">range_queries::heavy_light_decomposition::SG::update</a></div><div class="ttdeci">void update(int p, X v)</div><div class="ttdoc">Update the value at a node.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00293">heavy_light_decomposition.cpp:293</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a84424f180f12b514eaab57a6aa20b104" name="a84424f180f12b514eaab57a6aa20b104"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a84424f180f12b514eaab57a6aa20b104">&#9670;&#160;</a></span>h_heavychlid</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename X &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;int&gt; <a class="el" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">range_queries::heavy_light_decomposition::HLD</a>&lt; X &gt;::h_heavychlid</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>stores the heavy child of a node </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00340">340</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
+
+</div>
+</div>
+<a id="aa86a91ae0cd7898990a8170a2f2c9cda" name="aa86a91ae0cd7898990a8170a2f2c9cda"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aa86a91ae0cd7898990a8170a2f2c9cda">&#9670;&#160;</a></span>h_label</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename X &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;int&gt; <a class="el" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">range_queries::heavy_light_decomposition::HLD</a>&lt; X &gt;::h_label</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>stores the label of a node </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00339">339</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a1b336474d17eff1aa4be73d4068dc725" name="a1b336474d17eff1aa4be73d4068dc725"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a1b336474d17eff1aa4be73d4068dc725">&#9670;&#160;</a></span>h_parent</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename X &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;int&gt; <a class="el" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">range_queries::heavy_light_decomposition::HLD</a>&lt; X &gt;::h_parent</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>stores the top of the heavy chain from a node </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00341">341</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a722cc7cf2c3e4d15583601a48b09776f" name="a722cc7cf2c3e4d15583601a48b09776f"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a722cc7cf2c3e4d15583601a48b09776f">&#9670;&#160;</a></span>label</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename X &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int <a class="el" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">range_queries::heavy_light_decomposition::HLD</a>&lt; X &gt;::label</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>utility member to assign labels in <a class="el" href="#a0579062b384e54b611b80c6337c7f2c8" title="Utility function to lable the nodes so that heavy chains have a contigous lable.">dfs_labels()</a> </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00338">338</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>range_queries/<a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp.html">heavy_light_decomposition.cpp</a></li>
+<li>range_queries/<a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a0579062b384e54b611b80c6337c7f2c8_cgraph.map b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a0579062b384e54b611b80c6337c7f2c8_cgraph.map
deleted file mode 100644
index 6759b0ed5..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a0579062b384e54b611b80c6337c7f2c8_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="range_queries::heavy_light_decomposition::HLD::dfs_labels" name="range_queries::heavy_light_decomposition::HLD::dfs_labels">
-<area shape="rect" id="Node000001" title="Utility function to lable the nodes so that heavy chains have a contigous lable." alt="" coords="5,29,151,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="49,29,49,19,54,10,64,5,78,3,94,5,103,12,100,16,92,10,78,8,66,10,58,14,54,21,54,29"/>
-</map>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a0579062b384e54b611b80c6337c7f2c8_cgraph.md5 b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a0579062b384e54b611b80c6337c7f2c8_cgraph.md5
deleted file mode 100644
index e7dbfb07a..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a0579062b384e54b611b80c6337c7f2c8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0f5965070c280318b4f25c28d84b0772
\ No newline at end of file
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a0579062b384e54b611b80c6337c7f2c8_cgraph.svg b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a0579062b384e54b611b80c6337c7f2c8_cgraph.svg
deleted file mode 100644
index c7bdb1d9d..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a0579062b384e54b611b80c6337c7f2c8_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::HLD::dfs_labels Pages: 1 -->
-<svg width="117pt" height="68pt"
- viewBox="0.00 0.00 117.00 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>range_queries::heavy_light_decomposition::HLD::dfs_labels</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.38,-42.07C32.47,-51.55 39.17,-59.75 54.5,-59.75 63.12,-59.75 69.02,-57.16 72.18,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.58,-54.06 74.29,-43.55 68.74,-52.57 75.58,-54.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a0579062b384e54b611b80c6337c7f2c8_cgraph_org.svg b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a0579062b384e54b611b80c6337c7f2c8_cgraph_org.svg
deleted file mode 100644
index 62ee77489..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a0579062b384e54b611b80c6337c7f2c8_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::HLD::dfs_labels Pages: 1 -->
-<svg width="117pt" height="68pt"
- viewBox="0.00 0.00 117.00 67.75" 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 63.75)">
-<title>range_queries::heavy_light_decomposition::HLD::dfs_labels</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.38,-42.07C32.47,-51.55 39.17,-59.75 54.5,-59.75 63.12,-59.75 69.02,-57.16 72.18,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.58,-54.06 74.29,-43.55 68.74,-52.57 75.58,-54.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a2dfbda148aad0bfaba2ebfda9ebc915a_cgraph.map b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a2dfbda148aad0bfaba2ebfda9ebc915a_cgraph.map
deleted file mode 100644
index d36c37699..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a2dfbda148aad0bfaba2ebfda9ebc915a_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="range_queries::heavy_light_decomposition::HLD::dfs_par" name="range_queries::heavy_light_decomposition::HLD::dfs_par">
-<area shape="rect" id="Node000001" title="Utility function to assign highest parent that can be reached though heavy chains." alt="" coords="5,29,151,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="49,29,49,19,54,10,64,5,78,3,94,5,103,12,100,16,92,10,78,8,66,10,58,14,54,21,54,29"/>
-</map>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a2dfbda148aad0bfaba2ebfda9ebc915a_cgraph.md5 b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a2dfbda148aad0bfaba2ebfda9ebc915a_cgraph.md5
deleted file mode 100644
index 4e0c19f4a..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a2dfbda148aad0bfaba2ebfda9ebc915a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-85f487af64c5d751d0addeac240dcae9
\ No newline at end of file
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a2dfbda148aad0bfaba2ebfda9ebc915a_cgraph.svg b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a2dfbda148aad0bfaba2ebfda9ebc915a_cgraph.svg
deleted file mode 100644
index 34c38a9cb..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a2dfbda148aad0bfaba2ebfda9ebc915a_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::HLD::dfs_par Pages: 1 -->
-<svg width="117pt" height="68pt"
- viewBox="0.00 0.00 117.00 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>range_queries::heavy_light_decomposition::HLD::dfs_par</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.38,-42.07C32.47,-51.55 39.17,-59.75 54.5,-59.75 63.12,-59.75 69.02,-57.16 72.18,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.58,-54.06 74.29,-43.55 68.74,-52.57 75.58,-54.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a2dfbda148aad0bfaba2ebfda9ebc915a_cgraph_org.svg b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a2dfbda148aad0bfaba2ebfda9ebc915a_cgraph_org.svg
deleted file mode 100644
index cdee92e4a..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a2dfbda148aad0bfaba2ebfda9ebc915a_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::HLD::dfs_par Pages: 1 -->
-<svg width="117pt" height="68pt"
- viewBox="0.00 0.00 117.00 67.75" 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 63.75)">
-<title>range_queries::heavy_light_decomposition::HLD::dfs_par</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.38,-42.07C32.47,-51.55 39.17,-59.75 54.5,-59.75 63.12,-59.75 69.02,-57.16 72.18,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.58,-54.06 74.29,-43.55 68.74,-52.57 75.58,-54.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.map b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.map
deleted file mode 100644
index 141c3e0c1..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="range_queries::heavy_light_decomposition::HLD::query" name="range_queries::heavy_light_decomposition::HLD::query">
-<area shape="rect" id="Node000001" title="This function returns the sum of node values in the simple path from from node_1 to node_2." alt="" coords="5,103,151,158"/>
-<area shape="rect" id="Node000002" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" title="Utility function to break down a path query into two chain queries." alt="" coords="199,63,344,118"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="150,113,183,106,184,111,151,118"/>
-<area shape="rect" id="Node000005" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" title="The function returns the least common ancestor of two nodes." alt="" coords="199,143,344,198"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="151,143,184,150,183,155,150,148"/>
-<area shape="rect" id="Node000003" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" title="Function that specifies the type of operation involved when segments are combined." alt="" coords="392,5,537,61"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="343,66,376,57,377,62,345,72"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="426,86,504,111"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="344,91,410,94,410,99,344,96"/>
-<area shape="rect" id="Node000006" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store..." alt="" coords="392,143,537,198"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="344,168,376,168,376,173,344,173"/>
-</map>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.md5 b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.md5
deleted file mode 100644
index 98e647f74..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e12241efdff252bbfea94d43ba2dcad5
\ No newline at end of file
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.svg b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.svg
deleted file mode 100644
index 83cb2e9f5..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::HLD::query Pages: 1 -->
-<svg width="407pt" height="153pt"
- viewBox="0.00 0.00 407.00 152.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 148.75)">
-<title>range_queries::heavy_light_decomposition::HLD::query</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function returns the sum of node values in the simple path from from node_1 to node_2.">
-<polygon fill="#999999" stroke="#666666" points="109,-71.75 0,-71.75 0,-30 109,-30 109,-71.75"/>
-<text text-anchor="start" x="8" y="-58.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-47" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-35.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::query</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" target="_top" xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="white" stroke="#666666" points="254,-101.75 145,-101.75 145,-60 254,-60 254,-101.75"/>
-<text text-anchor="start" x="153" y="-88.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-77" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-65.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-62.13C117.11,-63.8 125.38,-65.54 133.53,-67.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.56,-70.62 143.06,-69.24 133.99,-63.77 132.56,-70.62"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" target="_top" xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="white" stroke="#666666" points="254,-41.75 145,-41.75 145,0 254,0 254,-41.75"/>
-<text text-anchor="start" x="153" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-39.62C117.11,-37.95 125.38,-36.21 133.53,-34.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.99,-37.98 143.06,-32.51 132.56,-31.13 133.99,-37.98"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="399,-144.75 290,-144.75 290,-103 399,-103 399,-144.75"/>
-<text text-anchor="start" x="298" y="-131.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="298" y="-120" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="344.5" y="-108.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.15,-97.01C262.11,-99.4 270.38,-101.89 278.53,-104.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.51,-107.69 288.1,-107.21 279.53,-100.98 277.51,-107.69"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373.88,-84.5 315.12,-84.5 315.12,-65.25 373.88,-65.25 373.88,-84.5"/>
-<text text-anchor="middle" x="344.5" y="-71" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.15,-78.62C270.57,-77.93 288.34,-77.19 303.66,-76.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="303.49,-80.06 313.34,-76.14 303.2,-73.06 303.49,-80.06"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="399,-41.75 290,-41.75 290,0 399,0 399,-41.75"/>
-<text text-anchor="start" x="298" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="298" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="344.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.15,-20.88C262.02,-20.88 270.19,-20.88 278.26,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.03,-24.38 288.03,-20.88 278.03,-17.38 278.03,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph_org.svg b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph_org.svg
deleted file mode 100644
index 2cbf78057..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a4dfbf5d9df825eeb63b294c6849bdcab_cgraph_org.svg
+++ /dev/null
@@ -1,121 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::HLD::query Pages: 1 -->
-<svg width="407pt" height="153pt"
- viewBox="0.00 0.00 407.00 152.75" 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 148.75)">
-<title>range_queries::heavy_light_decomposition::HLD::query</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function returns the sum of node values in the simple path from from node_1 to node_2.">
-<polygon fill="#999999" stroke="#666666" points="109,-71.75 0,-71.75 0,-30 109,-30 109,-71.75"/>
-<text text-anchor="start" x="8" y="-58.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-47" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-35.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::query</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" target="_top" xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="white" stroke="#666666" points="254,-101.75 145,-101.75 145,-60 254,-60 254,-101.75"/>
-<text text-anchor="start" x="153" y="-88.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-77" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-65.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-62.13C117.11,-63.8 125.38,-65.54 133.53,-67.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.56,-70.62 143.06,-69.24 133.99,-63.77 132.56,-70.62"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" target="_top" xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="white" stroke="#666666" points="254,-41.75 145,-41.75 145,0 254,0 254,-41.75"/>
-<text text-anchor="start" x="153" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-39.62C117.11,-37.95 125.38,-36.21 133.53,-34.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.99,-37.98 143.06,-32.51 132.56,-31.13 133.99,-37.98"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="399,-144.75 290,-144.75 290,-103 399,-103 399,-144.75"/>
-<text text-anchor="start" x="298" y="-131.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="298" y="-120" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="344.5" y="-108.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.15,-97.01C262.11,-99.4 270.38,-101.89 278.53,-104.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.51,-107.69 288.1,-107.21 279.53,-100.98 277.51,-107.69"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373.88,-84.5 315.12,-84.5 315.12,-65.25 373.88,-65.25 373.88,-84.5"/>
-<text text-anchor="middle" x="344.5" y="-71" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.15,-78.62C270.57,-77.93 288.34,-77.19 303.66,-76.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="303.49,-80.06 313.34,-76.14 303.2,-73.06 303.49,-80.06"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="399,-41.75 290,-41.75 290,0 399,0 399,-41.75"/>
-<text text-anchor="start" x="298" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="298" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="344.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.15,-20.88C262.02,-20.88 270.19,-20.88 278.26,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.03,-24.38 288.03,-20.88 278.03,-17.38 278.03,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.map b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.map
deleted file mode 100644
index 275d1f83a..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="range_queries::heavy_light_decomposition::HLD::chain_query" name="range_queries::heavy_light_decomposition::HLD::chain_query">
-<area shape="rect" id="Node000001" title="Utility function to break down a path query into two chain queries." alt="" coords="5,39,151,94"/>
-<area shape="rect" id="Node000002" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" title="Function that specifies the type of operation involved when segments are combined." alt="" coords="199,5,344,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="150,51,183,46,183,51,151,57"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="232,86,310,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="151,76,217,87,216,92,150,81"/>
-</map>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.md5 b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.md5
deleted file mode 100644
index adfd4c6b7..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-12e76c1512b957760253c826b8286917
\ No newline at end of file
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.svg b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.svg
deleted file mode 100644
index cd170471c..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph.svg
+++ /dev/null
@@ -1,87 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::HLD::chain_query Pages: 1 -->
-<svg width="262pt" height="88pt"
- viewBox="0.00 0.00 262.00 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>range_queries::heavy_light_decomposition::HLD::chain_query</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="#999999" stroke="#666666" points="109,-54.5 0,-54.5 0,-12.75 109,-12.75 109,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="254,-79.5 145,-79.5 145,-37.75 254,-37.75 254,-79.5"/>
-<text text-anchor="start" x="153" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-43.01C117.02,-44.38 125.19,-45.81 133.26,-47.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.6,-50.66 143.05,-48.93 133.81,-43.76 132.6,-50.66"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.88,-19.25 170.12,-19.25 170.12,0 228.88,0 228.88,-19.25"/>
-<text text-anchor="middle" x="199.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-24.62C125.57,-21.86 143.34,-18.88 158.66,-16.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.07,-19.79 168.36,-14.68 157.92,-12.89 159.07,-19.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph_org.svg b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph_org.svg
deleted file mode 100644
index 5b4a036e8..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a7d5b40c076347a6aabfb37a0590f2f24_cgraph_org.svg
+++ /dev/null
@@ -1,61 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::HLD::chain_query Pages: 1 -->
-<svg width="262pt" height="88pt"
- viewBox="0.00 0.00 262.00 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>range_queries::heavy_light_decomposition::HLD::chain_query</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="#999999" stroke="#666666" points="109,-54.5 0,-54.5 0,-12.75 109,-12.75 109,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="254,-79.5 145,-79.5 145,-37.75 254,-37.75 254,-79.5"/>
-<text text-anchor="start" x="153" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-43.01C117.02,-44.38 125.19,-45.81 133.26,-47.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.6,-50.66 143.05,-48.93 133.81,-43.76 132.6,-50.66"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.88,-19.25 170.12,-19.25 170.12,0 228.88,0 228.88,-19.25"/>
-<text text-anchor="middle" x="199.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-24.62C125.57,-21.86 143.34,-18.88 158.66,-16.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.07,-19.79 168.36,-14.68 157.92,-12.89 159.07,-19.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a9f1cb54ed09fde931bf3220d75ee4c57_cgraph.map b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a9f1cb54ed09fde931bf3220d75ee4c57_cgraph.map
deleted file mode 100644
index 466651aa1..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a9f1cb54ed09fde931bf3220d75ee4c57_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="range_queries::heavy_light_decomposition::HLD::update" name="range_queries::heavy_light_decomposition::HLD::update">
-<area shape="rect" id="Node000001" title="This function updates the value at node with val." alt="" coords="5,5,151,61"/>
-<area shape="rect" id="Node000002" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" title="Update the value at a node." alt="" coords="199,5,344,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="151,30,183,30,183,36,151,36"/>
-</map>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a9f1cb54ed09fde931bf3220d75ee4c57_cgraph.md5 b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a9f1cb54ed09fde931bf3220d75ee4c57_cgraph.md5
deleted file mode 100644
index 47ea16c2f..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a9f1cb54ed09fde931bf3220d75ee4c57_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6df3b32539a830377e5d1b3e373845d5
\ No newline at end of file
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a9f1cb54ed09fde931bf3220d75ee4c57_cgraph.svg b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a9f1cb54ed09fde931bf3220d75ee4c57_cgraph.svg
deleted file mode 100644
index e84b1fe9a..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a9f1cb54ed09fde931bf3220d75ee4c57_cgraph.svg
+++ /dev/null
@@ -1,69 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::HLD::update Pages: 1 -->
-<svg width="262pt" height="50pt"
- viewBox="0.00 0.00 262.00 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>range_queries::heavy_light_decomposition::HLD::update</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function updates the value at node with val.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::update</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" target="_top" xlink:title="Update the value at a node.">
-<polygon fill="white" stroke="#666666" points="254,-41.75 145,-41.75 145,0 254,0 254,-41.75"/>
-<text text-anchor="start" x="153" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-20.88C117.02,-20.88 125.19,-20.88 133.26,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.03,-24.38 143.03,-20.88 133.03,-17.38 133.03,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a9f1cb54ed09fde931bf3220d75ee4c57_cgraph_org.svg b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a9f1cb54ed09fde931bf3220d75ee4c57_cgraph_org.svg
deleted file mode 100644
index eea282c06..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_a9f1cb54ed09fde931bf3220d75ee4c57_cgraph_org.svg
+++ /dev/null
@@ -1,43 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::HLD::update Pages: 1 -->
-<svg width="262pt" height="50pt"
- viewBox="0.00 0.00 262.00 49.75" 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.75)">
-<title>range_queries::heavy_light_decomposition::HLD::update</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function updates the value at node with val.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::update</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" target="_top" xlink:title="Update the value at a node.">
-<polygon fill="white" stroke="#666666" points="254,-41.75 145,-41.75 145,0 254,0 254,-41.75"/>
-<text text-anchor="start" x="153" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-20.88C117.02,-20.88 125.19,-20.88 133.26,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.03,-24.38 143.03,-20.88 133.03,-17.38 133.03,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_ae9e979edd69678b85665c01e2ee97828_cgraph.map b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_ae9e979edd69678b85665c01e2ee97828_cgraph.map
deleted file mode 100644
index 8893d7463..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_ae9e979edd69678b85665c01e2ee97828_cgraph.map
+++ /dev/null
@@ -1,22 +0,0 @@
-<map id="range_queries::heavy_light_decomposition::HLD::init" name="range_queries::heavy_light_decomposition::HLD::init">
-<area shape="rect" id="Node000001" title="This function must be called after the tree adjacency list and node values are populated The function..." alt="" coords="5,213,151,269"/>
-<area shape="rect" id="Node000002" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" title="Function that specifies the type of operation involved when segments are combined." alt="" coords="199,5,344,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="92,211,135,143,164,106,197,71,200,68,204,72,201,75,168,109,139,146,97,214"/>
-<area shape="rect" id="Node000003" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)" alt="" coords="199,109,344,165"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="130,210,203,170,206,175,133,215"/>
-<area shape="rect" id="Node000004" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" title="Utility function to lable the nodes so that heavy chains have a contigous lable." alt="" coords="199,213,344,269"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="151,238,183,238,183,244,151,244"/>
-<area shape="rect" id="Node000005" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" title="Utility function to assign highest parent that can be reached though heavy chains." alt="" coords="199,317,344,373"/>
-<area shape="poly" id="edge6_Node000001_Node000005" title=" " alt="" coords="133,267,206,307,203,312,130,272"/>
-<area shape="rect" id="Node000006" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" title="This function must be called after the tree adjacency list and node values are populated The function..." alt="" coords="199,397,344,453"/>
-<area shape="poly" id="edge8_Node000001_Node000006" title=" " alt="" coords="100,268,143,324,170,355,200,383,204,386,201,390,197,387,167,359,139,328,96,271"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="233,109,233,99,240,90,253,85,271,83,292,85,304,92,302,97,290,90,271,88,254,90,244,95,238,101,238,109"/>
-<area shape="poly" id="edge5_Node000004_Node000004" title=" " alt="" coords="233,213,233,203,240,194,253,189,271,187,292,189,304,196,302,201,290,194,271,192,254,194,244,199,238,205,238,213"/>
-<area shape="poly" id="edge7_Node000005_Node000005" title=" " alt="" coords="233,317,233,307,240,298,253,293,271,291,292,293,304,300,302,305,290,298,271,296,254,298,244,303,238,309,238,317"/>
-<area shape="rect" id="Node000007" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" title="Utility function to populate the t_par vector." alt="" coords="392,345,537,401"/>
-<area shape="poly" id="edge9_Node000006_Node000007" title=" " alt="" coords="344,403,376,394,377,399,345,408"/>
-<area shape="rect" id="Node000008" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" title="Utility function to compute sub&#45;tree sizes." alt="" coords="392,449,537,505"/>
-<area shape="poly" id="edge11_Node000006_Node000008" title=" " alt="" coords="345,442,377,451,376,456,344,447"/>
-<area shape="poly" id="edge10_Node000007_Node000007" title=" " alt="" coords="426,345,427,335,434,326,446,321,465,319,485,321,498,328,495,333,484,326,465,324,448,326,437,331,432,337,432,345"/>
-<area shape="poly" id="edge12_Node000008_Node000008" title=" " alt="" coords="426,449,427,439,434,430,446,425,465,423,485,425,498,432,495,437,484,430,465,428,448,430,437,435,432,441,432,449"/>
-</map>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_ae9e979edd69678b85665c01e2ee97828_cgraph.md5 b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_ae9e979edd69678b85665c01e2ee97828_cgraph.md5
deleted file mode 100644
index 8dae84378..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_ae9e979edd69678b85665c01e2ee97828_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-301f234ffbc3cf902b0f0a3d9384b56c
\ No newline at end of file
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_ae9e979edd69678b85665c01e2ee97828_cgraph.svg b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_ae9e979edd69678b85665c01e2ee97828_cgraph.svg
deleted file mode 100644
index d62c938fd..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_ae9e979edd69678b85665c01e2ee97828_cgraph.svg
+++ /dev/null
@@ -1,234 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::HLD::init Pages: 1 -->
-<svg width="407pt" height="383pt"
- viewBox="0.00 0.00 407.00 382.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 378.75)">
-<title>range_queries::heavy_light_decomposition::HLD::init</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="#999999" stroke="#666666" points="109,-218.75 0,-218.75 0,-177 109,-177 109,-218.75"/>
-<text text-anchor="start" x="8" y="-205.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-194" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-182.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::init</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="254,-374.75 145,-374.75 145,-333 254,-333 254,-374.75"/>
-<text text-anchor="start" x="153" y="-361.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-350" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-338.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.74,-219.24C81.74,-246.21 110.48,-292.85 145,-323.88 145.76,-324.56 146.54,-325.24 147.34,-325.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.06,-328.57 155.16,-331.76 149.26,-322.97 145.06,-328.57"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" target="_top" xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="white" stroke="#666666" points="254,-296.75 145,-296.75 145,-255 254,-255 254,-296.75"/>
-<text text-anchor="start" x="153" y="-283.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-272" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-260.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.58,-219.19C111.52,-228.43 131.55,-239.36 149.48,-249.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.69,-252.15 158.14,-253.86 151.04,-246 147.69,-252.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" target="_top" xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="white" stroke="#666666" points="254,-218.75 145,-218.75 145,-177 254,-177 254,-218.75"/>
-<text text-anchor="start" x="153" y="-205.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-194" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-182.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-197.88C117.02,-197.88 125.19,-197.88 133.26,-197.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.03,-201.38 143.03,-197.88 133.03,-194.38 133.03,-201.38"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" target="_top" xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="white" stroke="#666666" points="254,-140.75 145,-140.75 145,-99 254,-99 254,-140.75"/>
-<text text-anchor="start" x="153" y="-127.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-116" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-104.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.58,-176.56C111.52,-167.32 131.55,-156.39 149.48,-146.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.04,-149.75 158.14,-141.89 147.69,-143.6 151.04,-149.75"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="254,-80.75 145,-80.75 145,-39 254,-39 254,-80.75"/>
-<text text-anchor="start" x="153" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge8_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge8_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.39,-176.81C85.54,-153.49 113.95,-115.76 145,-89.88 145.92,-89.11 146.86,-88.35 147.82,-87.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.52,-90.69 155.65,-82.04 145.47,-84.98 149.52,-90.69"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.74,-297.07C170.19,-306.55 179.11,-314.75 199.5,-314.75 211.29,-314.75 219.24,-312.01 223.36,-307.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.66,-309.1 225.87,-298.53 219.9,-307.28 226.66,-309.1"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.74,-219.07C170.19,-228.55 179.11,-236.75 199.5,-236.75 211.29,-236.75 219.24,-234.01 223.36,-229.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.66,-231.1 225.87,-220.53 219.9,-229.28 226.66,-231.1"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge7_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge7_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.74,-141.07C170.19,-150.55 179.11,-158.75 199.5,-158.75 211.29,-158.75 219.24,-156.01 223.36,-151.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.66,-153.1 225.87,-142.53 219.9,-151.28 226.66,-153.1"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="399,-119.75 290,-119.75 290,-78 399,-78 399,-119.75"/>
-<text text-anchor="start" x="298" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="298" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="344.5" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge9_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge9_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.15,-74.51C262.11,-76.68 270.38,-78.93 278.53,-81.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.52,-84.51 288.08,-83.76 279.36,-77.75 277.52,-84.51"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="399,-41.75 290,-41.75 290,0 399,0 399,-41.75"/>
-<text text-anchor="start" x="298" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="298" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="344.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge11_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge11_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.15,-45.24C262.11,-43.07 270.38,-40.82 278.53,-38.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="279.36,-42 288.08,-35.99 277.52,-35.24 279.36,-42"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge10_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge10_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M317.74,-120.07C315.19,-129.55 324.11,-137.75 344.5,-137.75 356.29,-137.75 364.24,-135.01 368.36,-130.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="371.66,-132.1 370.87,-121.53 364.9,-130.28 371.66,-132.1"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge12_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge12_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M317.74,-42.07C315.19,-51.55 324.11,-59.75 344.5,-59.75 356.29,-59.75 364.24,-57.01 368.36,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="371.66,-54.1 370.87,-43.53 364.9,-52.28 371.66,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_ae9e979edd69678b85665c01e2ee97828_cgraph_org.svg b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_ae9e979edd69678b85665c01e2ee97828_cgraph_org.svg
deleted file mode 100644
index d39bd95f4..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_ae9e979edd69678b85665c01e2ee97828_cgraph_org.svg
+++ /dev/null
@@ -1,208 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::HLD::init Pages: 1 -->
-<svg width="407pt" height="383pt"
- viewBox="0.00 0.00 407.00 382.75" 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 378.75)">
-<title>range_queries::heavy_light_decomposition::HLD::init</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="#999999" stroke="#666666" points="109,-218.75 0,-218.75 0,-177 109,-177 109,-218.75"/>
-<text text-anchor="start" x="8" y="-205.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-194" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-182.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::init</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="254,-374.75 145,-374.75 145,-333 254,-333 254,-374.75"/>
-<text text-anchor="start" x="153" y="-361.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-350" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-338.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.74,-219.24C81.74,-246.21 110.48,-292.85 145,-323.88 145.76,-324.56 146.54,-325.24 147.34,-325.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.06,-328.57 155.16,-331.76 149.26,-322.97 145.06,-328.57"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" target="_top" xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="white" stroke="#666666" points="254,-296.75 145,-296.75 145,-255 254,-255 254,-296.75"/>
-<text text-anchor="start" x="153" y="-283.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-272" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-260.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.58,-219.19C111.52,-228.43 131.55,-239.36 149.48,-249.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.69,-252.15 158.14,-253.86 151.04,-246 147.69,-252.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" target="_top" xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="white" stroke="#666666" points="254,-218.75 145,-218.75 145,-177 254,-177 254,-218.75"/>
-<text text-anchor="start" x="153" y="-205.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-194" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-182.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-197.88C117.02,-197.88 125.19,-197.88 133.26,-197.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.03,-201.38 143.03,-197.88 133.03,-194.38 133.03,-201.38"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" target="_top" xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="white" stroke="#666666" points="254,-140.75 145,-140.75 145,-99 254,-99 254,-140.75"/>
-<text text-anchor="start" x="153" y="-127.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-116" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-104.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.58,-176.56C111.52,-167.32 131.55,-156.39 149.48,-146.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.04,-149.75 158.14,-141.89 147.69,-143.6 151.04,-149.75"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="254,-80.75 145,-80.75 145,-39 254,-39 254,-80.75"/>
-<text text-anchor="start" x="153" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge8_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge8_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.39,-176.81C85.54,-153.49 113.95,-115.76 145,-89.88 145.92,-89.11 146.86,-88.35 147.82,-87.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.52,-90.69 155.65,-82.04 145.47,-84.98 149.52,-90.69"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.74,-297.07C170.19,-306.55 179.11,-314.75 199.5,-314.75 211.29,-314.75 219.24,-312.01 223.36,-307.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.66,-309.1 225.87,-298.53 219.9,-307.28 226.66,-309.1"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.74,-219.07C170.19,-228.55 179.11,-236.75 199.5,-236.75 211.29,-236.75 219.24,-234.01 223.36,-229.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.66,-231.1 225.87,-220.53 219.9,-229.28 226.66,-231.1"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge7_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge7_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.74,-141.07C170.19,-150.55 179.11,-158.75 199.5,-158.75 211.29,-158.75 219.24,-156.01 223.36,-151.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.66,-153.1 225.87,-142.53 219.9,-151.28 226.66,-153.1"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="399,-119.75 290,-119.75 290,-78 399,-78 399,-119.75"/>
-<text text-anchor="start" x="298" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="298" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="344.5" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge9_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge9_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.15,-74.51C262.11,-76.68 270.38,-78.93 278.53,-81.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.52,-84.51 288.08,-83.76 279.36,-77.75 277.52,-84.51"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="399,-41.75 290,-41.75 290,0 399,0 399,-41.75"/>
-<text text-anchor="start" x="298" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="298" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="344.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge11_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge11_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.15,-45.24C262.11,-43.07 270.38,-40.82 278.53,-38.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="279.36,-42 288.08,-35.99 277.52,-35.24 279.36,-42"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge10_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge10_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M317.74,-120.07C315.19,-129.55 324.11,-137.75 344.5,-137.75 356.29,-137.75 364.24,-135.01 368.36,-130.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="371.66,-132.1 370.87,-121.53 364.9,-130.28 371.66,-132.1"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge12_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge12_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M317.74,-42.07C315.19,-51.55 324.11,-59.75 344.5,-59.75 356.29,-59.75 364.24,-57.01 368.36,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="371.66,-54.1 370.87,-43.53 364.9,-52.28 371.66,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_af64848d6630c39d0f09ce2359cc7c4f8_cgraph.map b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_af64848d6630c39d0f09ce2359cc7c4f8_cgraph.map
deleted file mode 100644
index 36ce49d22..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_af64848d6630c39d0f09ce2359cc7c4f8_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="range_queries::heavy_light_decomposition::HLD::dfs_hc" name="range_queries::heavy_light_decomposition::HLD::dfs_hc">
-<area shape="rect" id="Node000001" title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)" alt="" coords="5,29,151,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="49,29,49,19,54,10,64,5,78,3,94,5,103,12,100,16,92,10,78,8,66,10,58,14,54,21,54,29"/>
-</map>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_af64848d6630c39d0f09ce2359cc7c4f8_cgraph.md5 b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_af64848d6630c39d0f09ce2359cc7c4f8_cgraph.md5
deleted file mode 100644
index 632ca54a2..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_af64848d6630c39d0f09ce2359cc7c4f8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6ec1493c6c9f6ce74673cbc99dcf6bbd
\ No newline at end of file
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_af64848d6630c39d0f09ce2359cc7c4f8_cgraph.svg b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_af64848d6630c39d0f09ce2359cc7c4f8_cgraph.svg
deleted file mode 100644
index e4e59371b..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_af64848d6630c39d0f09ce2359cc7c4f8_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::HLD::dfs_hc Pages: 1 -->
-<svg width="117pt" height="68pt"
- viewBox="0.00 0.00 117.00 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>range_queries::heavy_light_decomposition::HLD::dfs_hc</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.38,-42.07C32.47,-51.55 39.17,-59.75 54.5,-59.75 63.12,-59.75 69.02,-57.16 72.18,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.58,-54.06 74.29,-43.55 68.74,-52.57 75.58,-54.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_af64848d6630c39d0f09ce2359cc7c4f8_cgraph_org.svg b/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_af64848d6630c39d0f09ce2359cc7c4f8_cgraph_org.svg
deleted file mode 100644
index bbc6addaf..000000000
--- a/d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_af64848d6630c39d0f09ce2359cc7c4f8_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::HLD::dfs_hc Pages: 1 -->
-<svg width="117pt" height="68pt"
- viewBox="0.00 0.00 117.00 67.75" 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 63.75)">
-<title>range_queries::heavy_light_decomposition::HLD::dfs_hc</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.38,-42.07C32.47,-51.55 39.17,-59.75 54.5,-59.75 63.12,-59.75 69.02,-57.16 72.18,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.58,-54.06 74.29,-43.55 68.74,-52.57 75.58,-54.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d90/namespacegreedy__algorithms.html b/d2/d90/namespacegreedy__algorithms.html
index b4bf9b671..6c8ba5434 100644
--- a/d2/d90/namespacegreedy__algorithms.html
+++ b/d2/d90/namespacegreedy__algorithms.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: greedy_algorithms Namespace Reference</title>
+<title>TheAlgorithms/C++: greedy_algorithms Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -135,11 +152,11 @@ Classes</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a33e3819aa9ffec0e380383c52603b502" id="r_a33e3819aa9ffec0e380383c52603b502"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a33e3819aa9ffec0e380383c52603b502">can_jump</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;nums)</td></tr>
+<tr class="memitem:a33e3819aa9ffec0e380383c52603b502" id="r_a33e3819aa9ffec0e380383c52603b502"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a33e3819aa9ffec0e380383c52603b502">can_jump</a> (const std::vector&lt; int &gt; &amp;nums)</td></tr>
 <tr class="memdesc:a33e3819aa9ffec0e380383c52603b502"><td class="mdescLeft">&#160;</td><td class="mdescRight">Checks whether the given element (default is <code>1</code>) can jump to the last index.  <br /></td></tr>
 <tr class="separator:a33e3819aa9ffec0e380383c52603b502"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a349e4ab9a97532c3931a2bd2a19c0098" id="r_a349e4ab9a97532c3931a2bd2a19c0098"><td class="memTemplParams" colspan="2">template&lt;typename T , <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> N, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> M&gt; </td></tr>
-<tr class="memitem:a349e4ab9a97532c3931a2bd2a19c0098"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a349e4ab9a97532c3931a2bd2a19c0098">findMinimumEdge</a> (const T &amp;infinity, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt;, M &gt; &amp;graph)</td></tr>
+<tr class="memitem:a349e4ab9a97532c3931a2bd2a19c0098" id="r_a349e4ab9a97532c3931a2bd2a19c0098"><td class="memTemplParams" colspan="2">template&lt;typename T , std::size_t N, std::size_t M&gt; </td></tr>
+<tr class="memitem:a349e4ab9a97532c3931a2bd2a19c0098"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a349e4ab9a97532c3931a2bd2a19c0098">findMinimumEdge</a> (const T &amp;infinity, const std::array&lt; std::array&lt; T, N &gt;, M &gt; &amp;graph)</td></tr>
 <tr class="memdesc:a349e4ab9a97532c3931a2bd2a19c0098"><td class="mdescLeft">&#160;</td><td class="mdescRight">Finds the minimum edge of the given graph.  <br /></td></tr>
 <tr class="separator:a349e4ab9a97532c3931a2bd2a19c0098"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
@@ -147,16 +164,16 @@ Functions</h2></td></tr>
 <div class="textblock"><p>for string class </p>
 <p>for uint32_t</p>
 <p>Greedy Algorithms.</p>
-<p>For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> to store separated digits.</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>For std::vector to store separated digits.</p>
+<p>for std::vector</p>
 <p>for reverse function for tests for input and outputs</p>
 <p>Greedy Algorithms</p>
 <p>for assert for INT_MAX for IO operations</p>
 <p>Greedy Algorithms</p>
 <p>For reveresing the vector For assert() function to check for errors For abs() function For int64_t data type to handle large numbers For input/output operations</p>
 <p>Greedy Algorithms</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/find.html">std::find</a> for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
-<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></p>
+<p>for std::find for assert for std::uint32_t for std::vector</p>
+<p>for assert for std::cout</p>
 <p>Greedy Algorithms</p>
 <p>for array for IO operations for numeric limits</p>
 <p>Greedy Algorithms </p>
@@ -170,7 +187,7 @@ Functions</h2></td></tr>
         <tr>
           <td class="memname">bool greedy_algorithms::can_jump </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>nums</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>nums</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -186,8 +203,10 @@ Functions</h2></td></tr>
 <dl class="section return"><dt>Returns</dt><dd>true if the index can be reached </dd>
 <dd>
 false if the index can NOT be reached </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dba/jump__game_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d6/dba/jump__game_8cpp_source.html">jump_game.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   42</span>                                          {</div>
-<div class="line"><span class="lineno">   43</span>    <span class="keywordtype">size_t</span> lastPos = nums.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() - 1;</div>
+<div class="line"><span class="lineno">   43</span>    <span class="keywordtype">size_t</span> lastPos = nums.size() - 1;</div>
 <div class="line"><span class="lineno">   44</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = lastPos; i != <span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(-1); i--) {</div>
 <div class="line"><span class="lineno">   45</span>        <span class="keywordflow">if</span> (i + nums[i] &gt;= lastPos) {</div>
 <div class="line"><span class="lineno">   46</span>            lastPos = i;</div>
@@ -195,13 +214,7 @@ false if the index can NOT be reached </dd></dl>
 <div class="line"><span class="lineno">   48</span>    }</div>
 <div class="line"><span class="lineno">   49</span>    <span class="keywordflow">return</span> lastPos == 0;</div>
 <div class="line"><span class="lineno">   50</span>}</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><!-- 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="../../d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.svg" width="310" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a349e4ab9a97532c3931a2bd2a19c0098" name="a349e4ab9a97532c3931a2bd2a19c0098"></a>
@@ -210,7 +223,7 @@ Here is the call graph for this function:</div>
 <div class="memitem">
 <div class="memproto">
 <div class="memtemplate">
-template&lt;typename T , <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> N, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> M&gt; </div>
+template&lt;typename T , std::size_t N, std::size_t M&gt; </div>
       <table class="memname">
         <tr>
           <td class="memname">void greedy_algorithms::findMinimumEdge </td>
@@ -220,7 +233,7 @@ template&lt;typename T , <a class="elRef" target="_blank" href="http://en.cppref
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt;, M &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>graph</em></span>&#160;)</td>
+          <td class="paramtype">const std::array&lt; std::array&lt; T, N &gt;, M &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>graph</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -234,9 +247,11 @@ template&lt;typename T , <a class="elRef" target="_blank" href="http://en.cppref
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html">kruskals_minimum_spanning_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   39</span>                                                               {</div>
 <div class="line"><span class="lineno">   40</span>    <span class="keywordflow">if</span> (N != M) {</div>
-<div class="line"><span class="lineno">   41</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nWrong input passed. Provided array has dimensions &quot;</span> &lt;&lt; N</div>
+<div class="line"><span class="lineno">   41</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nWrong input passed. Provided array has dimensions &quot;</span> &lt;&lt; N</div>
 <div class="line"><span class="lineno">   42</span>                  &lt;&lt; <span class="stringliteral">&quot;x&quot;</span> &lt;&lt; M &lt;&lt; <span class="stringliteral">&quot;. Please provide a square matrix.\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   43</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">   44</span>    }</div>
@@ -249,11 +264,10 @@ template&lt;typename T , <a class="elRef" target="_blank" href="http://en.cppref
 <div class="line"><span class="lineno">   51</span>                minIndex = j;</div>
 <div class="line"><span class="lineno">   52</span>            }</div>
 <div class="line"><span class="lineno">   53</span>        }</div>
-<div class="line"><span class="lineno">   54</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  -  &quot;</span> &lt;&lt; minIndex &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[i][minIndex]</div>
+<div class="line"><span class="lineno">   54</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  -  &quot;</span> &lt;&lt; minIndex &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[i][minIndex]</div>
 <div class="line"><span class="lineno">   55</span>                  &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   56</span>    }</div>
 <div class="line"><span class="lineno">   57</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="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph Algorithms.</div></div>
 </div><!-- fragment -->
 </div>
diff --git a/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.map b/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.map
deleted file mode 100644
index 70affb272..000000000
--- a/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="greedy_algorithms::can_jump" name="greedy_algorithms::can_jump">
-<area shape="rect" id="Node000001" title="Checks whether the given element (default is 1) can jump to the last index." alt="" coords="5,5,141,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="189,13,304,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="141,23,173,23,173,28,141,28"/>
-</map>
diff --git a/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.md5 b/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.md5
deleted file mode 100644
index a8a778259..000000000
--- a/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c42fb8e2aa1ecbda76282b1d15466f0d
\ No newline at end of file
diff --git a/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.svg b/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.svg
deleted file mode 100644
index 6db30b379..000000000
--- a/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: greedy_algorithms::can_jump Pages: 1 -->
-<svg width="232pt" height="39pt"
- viewBox="0.00 0.00 232.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>greedy_algorithms::can_jump</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Checks whether the given element (default is 1) can jump to the last index.">
-<polygon fill="#999999" stroke="#666666" points="101.5,-30.5 0,-30.5 0,0 101.5,0 101.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">can_jump</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-24.88 137.5,-24.88 137.5,-5.63 224,-5.63 224,-24.88"/>
-<text text-anchor="middle" x="180.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.97,-15.25C109.78,-15.25 117.88,-15.25 125.77,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.61,-18.75 135.61,-15.25 125.61,-11.75 125.61,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph_org.svg b/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph_org.svg
deleted file mode 100644
index 038678563..000000000
--- a/d2/d90/namespacegreedy__algorithms_a33e3819aa9ffec0e380383c52603b502_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: greedy_algorithms::can_jump Pages: 1 -->
-<svg width="232pt" height="39pt"
- viewBox="0.00 0.00 232.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>greedy_algorithms::can_jump</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Checks whether the given element (default is 1) can jump to the last index.">
-<polygon fill="#999999" stroke="#666666" points="101.5,-30.5 0,-30.5 0,0 101.5,0 101.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">can_jump</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-24.88 137.5,-24.88 137.5,-5.63 224,-5.63 224,-24.88"/>
-<text text-anchor="middle" x="180.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.97,-15.25C109.78,-15.25 117.88,-15.25 125.77,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.61,-18.75 135.61,-15.25 125.61,-11.75 125.61,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.map b/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.map
index d064f7fb1..7ccf54af2 100644
--- a/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.map
+++ b/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.map
@@ -1,7 +1,7 @@
 <map id="probability::windowed_median::WindowedMedian" name="probability::windowed_median::WindowedMedian">
 <area shape="rect" id="Node000001" title="A class to calculate the median of a leading sliding window at the back of a stream of integer values..." alt="" coords="36,109,218,150"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list.html" title=" " alt="" coords="5,5,108,31"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,5,108,31"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="75,43,117,107,112,110,70,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/multiset.html" title=" " alt="" coords="132,5,264,31"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="132,5,264,31"/>
 <area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="186,46,160,86,144,110,139,107,156,84,181,43"/>
 </map>
diff --git a/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.md5 b/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.md5
index d3755a32e..ef30c3304 100644
--- a/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.md5
+++ b/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.md5
@@ -1 +1 @@
-0f8ff915777326ce579476e1f4e3eab0
\ No newline at end of file
+cdcabaec5eb705c1a021b743a5037fbf
\ No newline at end of file
diff --git a/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.svg b/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.svg
index 279745a8f..9112a3ec2 100644
--- a/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.svg
+++ b/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.svg
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="76.75,-108.25 0,-108.25 0,-89 76.75,-89 76.75,-108.25"/>
 <text text-anchor="middle" x="38.38" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list&lt; int &gt;</text>
 </a>
@@ -51,7 +51,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="193.62,-108.25 95.12,-108.25 95.12,-89 193.62,-89 193.62,-108.25"/>
 <text text-anchor="middle" x="144.38" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset&lt; int &gt;</text>
 </a>
diff --git a/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph_org.svg b/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph_org.svg
index e441f8d2d..0cedb3f0e 100644
--- a/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph_org.svg
+++ b/d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="76.75,-108.25 0,-108.25 0,-89 76.75,-89 76.75,-108.25"/>
 <text text-anchor="middle" x="38.38" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list&lt; int &gt;</text>
 </a>
@@ -40,7 +40,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="193.62,-108.25 95.12,-108.25 95.12,-89 193.62,-89 193.62,-108.25"/>
 <text text-anchor="middle" x="144.38" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset&lt; int &gt;</text>
 </a>
diff --git a/d2/d96/sparse__table__range__queries_8cpp_source.html b/d2/d96/sparse__table__range__queries_8cpp_source.html
new file mode 100644
index 000000000..146f8f4a3
--- /dev/null
+++ b/d2/d96/sparse__table__range__queries_8cpp_source.html
@@ -0,0 +1,199 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: range_queries/sparse_table_range_queries.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d2/d96/sparse__table__range__queries_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">sparse_table_range_queries.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d69/namespacerange__queries.html">range_queries</a> {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/d55/namespacesparse__table.html">sparse_table</a> {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>std::vector&lt;T&gt; computeLogs(<span class="keyword">const</span> std::vector&lt;T&gt;&amp; A) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordtype">int</span> n = A.size();</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    std::vector&lt;T&gt; logs(n);</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    logs[1] = 0;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i &lt; n; i++) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        logs[i] = logs[i / 2] + 1;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    }</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordflow">return</span> logs;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>}</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>std::vector&lt;std::vector&lt;T&gt; &gt; buildTable(<span class="keyword">const</span> std::vector&lt;T&gt;&amp; A,</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>                                        <span class="keyword">const</span> std::vector&lt;T&gt;&amp; logs) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordtype">int</span> n = A.size();</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    std::vector&lt;std::vector&lt;T&gt; &gt; table(20, std::vector&lt;T&gt;(n + 5, 0));</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordtype">int</span> curLen = 0;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= logs[n]; i++) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        curLen = 1 &lt;&lt; i;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j + curLen &lt; n; j++) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            <span class="keywordflow">if</span> (curLen == 1) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>                table[i][j] = A[j];</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>                table[i][j] =</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                    std::min(table[i - 1][j], table[i - 1][j + curLen / 2]);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        }</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keywordflow">return</span> table;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>}</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span><span class="keywordtype">int</span> getMinimum(<span class="keywordtype">int</span> beg, <span class="keywordtype">int</span> end, <span class="keyword">const</span> std::vector&lt;T&gt;&amp; logs,</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>               <span class="keyword">const</span> std::vector&lt;std::vector&lt;T&gt; &gt;&amp; table) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordtype">int</span> p = logs[end - beg + 1];</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="keywordtype">int</span> pLen = 1 &lt;&lt; p;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keywordflow">return</span> std::min(table[p][beg], table[p][end - pLen + 1]);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>}</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>}  <span class="comment">// namespace sparse_table</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>}  <span class="comment">// namespace range_queries</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    std::vector&lt;int&gt; A{1, 2, 0, 3, 9};</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    std::vector&lt;int&gt; logs = range_queries::sparse_table::computeLogs(A);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    std::vector&lt;std::vector&lt;int&gt; &gt; table =</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        range_queries::sparse_table::buildTable(A, logs);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    assert(range_queries::sparse_table::getMinimum(0, 0, logs, table) == 1);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    assert(range_queries::sparse_table::getMinimum(0, 4, logs, table) == 0);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    assert(range_queries::sparse_table::getMinimum(2, 4, logs, table) == 0);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacerange__queries_html"><div class="ttname"><a href="../../dd/d69/namespacerange__queries.html">range_queries</a></div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00028">fenwick_tree.cpp:28</a></div></div>
+<div class="ttc" id="anamespacesparse__table_html"><div class="ttname"><a href="../../d9/d55/namespacesparse__table.html">sparse_table</a></div><div class="ttdoc">Functions for Implementation of Sparse Table</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_074119ce3a874b57120c49a0cc4bb5ad.html">range_queries</a></li><li class="navelem"><b>sparse_table_range_queries.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html b/d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html
index 9484ad168..6ad957b67 100644
--- a/d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html
+++ b/d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others::iterative_tree_traversals::Node Struct Reference</title>
+<title>TheAlgorithms/C++: others::iterative_tree_traversals::Node Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,9 +138,8 @@ Collaboration diagram for others::iterative_tree_traversals::Node:</div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:ad443d44275337b9e361375ce66f1104f" id="r_ad443d44275337b9e361375ce66f1104f"><td class="memItemLeft" align="right" valign="top"><a id="ad443d44275337b9e361375ce66f1104f" name="ad443d44275337b9e361375ce66f1104f"></a>
-int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b> = 0</td></tr>
-<tr class="memdesc:ad443d44275337b9e361375ce66f1104f"><td class="mdescLeft">&#160;</td><td class="mdescRight">The value/key of the node. <br /></td></tr>
+<tr class="memitem:ad443d44275337b9e361375ce66f1104f" id="r_ad443d44275337b9e361375ce66f1104f"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad443d44275337b9e361375ce66f1104f">data</a> = 0</td></tr>
+<tr class="memdesc:ad443d44275337b9e361375ce66f1104f"><td class="mdescLeft">&#160;</td><td class="mdescRight">The value/key of the node.  <br /></td></tr>
 <tr class="separator:ad443d44275337b9e361375ce66f1104f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a1dbaeff928e469a05251879568515b8e" id="r_a1dbaeff928e469a05251879568515b8e"><td class="memItemLeft" align="right" valign="top">struct <a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1dbaeff928e469a05251879568515b8e">left</a> {}</td></tr>
 <tr class="memdesc:a1dbaeff928e469a05251879568515b8e"><td class="mdescLeft">&#160;</td><td class="mdescRight">struct pointer to left subtree.  <br /></td></tr>
@@ -134,7 +150,27 @@ int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b> = 0</td><
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>defines the structure of a node of the tree </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a>.</p>
 </div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="ad443d44275337b9e361375ce66f1104f" name="ad443d44275337b9e361375ce66f1104f"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ad443d44275337b9e361375ce66f1104f">&#9670;&#160;</a></span>data</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int64_t others::iterative_tree_traversals::Node::data = 0</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>The value/key of the node. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a>.</p>
+
+</div>
+</div>
 <a id="a1dbaeff928e469a05251879568515b8e" name="a1dbaeff928e469a05251879568515b8e"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a1dbaeff928e469a05251879568515b8e">&#9670;&#160;</a></span>left</h2>
 
@@ -148,7 +184,9 @@ int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b> = 0</td><
 </div><div class="memdoc">
 
 <p>struct pointer to left subtree. </p>
-<div class="fragment"><div class="line"><span class="lineno">   60</span>{};   <span class="comment">///&lt; struct pointer to left subtree.</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00060">60</a> of file <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   60</span>{};   </div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -165,12 +203,14 @@ int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b> = 0</td><
 </div><div class="memdoc">
 
 <p>struct pointer to right subtree. </p>
-<div class="fragment"><div class="line"><span class="lineno">   61</span>{};  <span class="comment">///&lt; struct pointer to right subtree.</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00061">61</a> of file <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   61</span>{};  </div>
 </div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>others/<a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp.html">iterative_tree_traversals.cpp</a></li>
+<li>others/<a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d2/da2/matrix__chain__multiplication_8cpp_source.html b/d2/da2/matrix__chain__multiplication_8cpp_source.html
new file mode 100644
index 000000000..f1d1b5959
--- /dev/null
+++ b/d2/da2/matrix__chain__multiplication_8cpp_source.html
@@ -0,0 +1,201 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/matrix_chain_multiplication.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d2/da2/matrix__chain__multiplication_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">matrix_chain_multiplication.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;climits&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#define MAX 10</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span> </div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment">// dp table to store the solution for already computed sub problems</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="keywordtype">int</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[MAX][MAX];</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment">// Function to find the most efficient way to multiply the given sequence of</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment">// matrices</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="keywordtype">int</span> MatrixChainMultiplication(<span class="keywordtype">int</span> dim[], <span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j) {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <span class="comment">// base case: one matrix</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordflow">if</span> (j &lt;= i + 1)</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="comment">// stores minimum number of scalar multiplications (i.e., cost)</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="comment">// needed to compute the matrix M[i+1]...M[j] = M[i..j]</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    <span class="keywordtype">int</span> min = INT_MAX;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="comment">// if dp[i][j] is not calculated (calculate it!!)</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    <span class="keywordflow">if</span> (<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j] == 0) {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        <span class="comment">// take the minimum over each possible position at which the</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        <span class="comment">// sequence of matrices can be split</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = i + 1; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> &lt;= j - 1; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++) {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>            <span class="comment">// recur for M[i+1]..M[k] to get a i x k matrix</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>            <span class="keywordtype">int</span> cost = MatrixChainMultiplication(dim, i, k);</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>            <span class="comment">// recur for M[k+1]..M[j] to get a k x j matrix</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>            cost += MatrixChainMultiplication(dim, k, j);</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>            <span class="comment">// cost to multiply two (i x k) and (k x j) matrix</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>            cost += dim[i] * dim[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] * dim[j];</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>            <span class="keywordflow">if</span> (cost &lt; min)</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>                min = cost;  <span class="comment">// store the minimum cost</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        }</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j] = min;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    }</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="comment">// return min cost to multiply M[j+1]..M[j]</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j];</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>}</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="comment">// main function</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="comment">// Matrix i has Dimensions dim[i-1] &amp; dim[i] for i=1..n</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="comment">// input is 10 x 30 matrix, 30 x 5 matrix, 5 x 60 matrix</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordtype">int</span> dim[] = {10, 30, 5, 60};</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordtype">int</span> n = <span class="keyword">sizeof</span>(dim) / <span class="keyword">sizeof</span>(dim[0]);</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="comment">// Function Calling: MatrixChainMultiplications(dimensions_array, starting,</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="comment">// ending);</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    cout &lt;&lt; <span class="stringliteral">&quot;Minimum cost is &quot;</span> &lt;&lt; MatrixChainMultiplication(dim, 0, n - 1)</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>         &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>}</div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</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> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><b>matrix_chain_multiplication.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d2/da7/namespacefind__non__repeating__integer.html b/d2/da7/namespacefind__non__repeating__integer.html
index c35ac21ba..7645029f5 100644
--- a/d2/da7/namespacefind__non__repeating__integer.html
+++ b/d2/da7/namespacefind__non__repeating__integer.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: find_non_repeating_integer Namespace Reference</title>
+<title>TheAlgorithms/C++: find_non_repeating_integer Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html b/d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html
index 0c245deba..a69a72301 100644
--- a/d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html
+++ b/d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: greedy_algorithms::dijkstra::Graph Class Reference</title>
+<title>TheAlgorithms/C++: greedy_algorithms::dijkstra::Graph Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -131,14 +148,15 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a2b0f8f5d257613bb0c0cb470413964b1" id="r_a2b0f8f5d257613bb0c0cb470413964b1"><td class="memItemLeft" align="right" valign="top"><a id="a2b0f8f5d257613bb0c0cb470413964b1" name="a2b0f8f5d257613bb0c0cb470413964b1"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>vertexNum</b> = 0</td></tr>
+<tr class="memitem:a2b0f8f5d257613bb0c0cb470413964b1" id="r_a2b0f8f5d257613bb0c0cb470413964b1"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2b0f8f5d257613bb0c0cb470413964b1">vertexNum</a> = 0</td></tr>
 <tr class="separator:a2b0f8f5d257613bb0c0cb470413964b1"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a42a583424fb3b90346f1564d737a0fff" id="r_a42a583424fb3b90346f1564d737a0fff"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a42a583424fb3b90346f1564d737a0fff">edges</a> {}</td></tr>
+<tr class="memitem:a42a583424fb3b90346f1564d737a0fff" id="r_a42a583424fb3b90346f1564d737a0fff"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a42a583424fb3b90346f1564d737a0fff">edges</a> {}</td></tr>
 <tr class="separator:a42a583424fb3b90346f1564d737a0fff"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Wrapper class for storing a graph. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html">dijkstra_greedy.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="afefaeb247734a7c64bd04e68e3c1c4bc" name="afefaeb247734a7c64bd04e68e3c1c4bc"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#afefaeb247734a7c64bd04e68e3c1c4bc">&#9670;&#160;</a></span>Graph()</h2>
@@ -170,11 +188,13 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>vertexNum</b> = 0</td>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html">dijkstra_greedy.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   44</span>                                {</div>
 <div class="line"><span class="lineno">   45</span>        <span class="comment">// Initialize the array edges</span></div>
-<div class="line"><span class="lineno">   46</span>        this-&gt;edges = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;int&gt;</a>&gt;(V, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(V, 0));</div>
+<div class="line"><span class="lineno">   46</span>        this-&gt;edges = std::vector&lt;std::vector&lt;int&gt;&gt;(V, std::vector&lt;int&gt;(V, 0));</div>
 <div class="line"><span class="lineno">   47</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
-<div class="line"><span class="lineno">   48</span>            edges[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(V, 0);</div>
+<div class="line"><span class="lineno">   48</span>            edges[i] = std::vector&lt;int&gt;(V, 0);</div>
 <div class="line"><span class="lineno">   49</span>        }</div>
 <div class="line"><span class="lineno">   50</span> </div>
 <div class="line"><span class="lineno">   51</span>        <span class="comment">// Fills the array with zeros</span></div>
@@ -186,7 +206,6 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>vertexNum</b> = 0</td>
 <div class="line"><span class="lineno">   57</span> </div>
 <div class="line"><span class="lineno">   58</span>        this-&gt;vertexNum = V;</div>
 <div class="line"><span class="lineno">   59</span>    }</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>
 </div>
@@ -233,6 +252,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>vertexNum</b> = 0</td>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html#l00068">68</a> of file <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html">dijkstra_greedy.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   68</span>                                                {</div>
 <div class="line"><span class="lineno">   69</span>        this-&gt;edges[src][dst] = weight;</div>
 <div class="line"><span class="lineno">   70</span>    }</div>
@@ -247,16 +268,34 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>vertexNum</b> = 0</td>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;int&gt; &gt; greedy_algorithms::dijkstra::Graph::edges {}</td>
+          <td class="memname">std::vector&lt;std::vector&lt;int&gt; &gt; greedy_algorithms::dijkstra::Graph::edges {}</td>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html">dijkstra_greedy.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   38</span>{};</div>
 </div><!-- fragment -->
+</div>
+</div>
+<a id="a2b0f8f5d257613bb0c0cb470413964b1" name="a2b0f8f5d257613bb0c0cb470413964b1"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a2b0f8f5d257613bb0c0cb470413964b1">&#9670;&#160;</a></span>vertexNum</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int greedy_algorithms::dijkstra::Graph::vertexNum = 0</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html">dijkstra_greedy.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>greedy_algorithms/<a class="el" href="../../da/de8/dijkstra__greedy_8cpp.html">dijkstra_greedy.cpp</a></li>
+<li>greedy_algorithms/<a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html">dijkstra_greedy.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d2/db0/namespacesieve__of__eratosthenes.html b/d2/db0/namespacesieve__of__eratosthenes.html
index 3a60528d0..5c6080779 100644
--- a/d2/db0/namespacesieve__of__eratosthenes.html
+++ b/d2/db0/namespacesieve__of__eratosthenes.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sieve_of_eratosthenes Namespace Reference</title>
+<title>TheAlgorithms/C++: sieve_of_eratosthenes Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.map b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.map
index d0c8861bf..dd77d83b8 100644
--- a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.map
+++ b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.map
@@ -1,7 +1,7 @@
 <map id="data_structures::treap::Treap" name="data_structures::treap::Treap">
 <area shape="rect" id="Node000001" title="Struct representation of the treap." alt="" coords="114,154,262,195"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array.html" title=" " alt="" coords="5,13,184,38"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,13,184,38"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="113,50,178,152,173,155,108,53"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array.html" title=" " alt="" coords="207,5,358,46"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="207,5,358,46"/>
 <area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="264,60,203,155,198,152,260,57"/>
 </map>
diff --git a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.md5 b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.md5
index d24e187d3..5d6be357d 100644
--- a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.md5
+++ b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.md5
@@ -1 +1 @@
-50739112ee891e9d18129e02ad649cfd
\ No newline at end of file
+c4fe396a269318ee0919570a882ed9b1
\ No newline at end of file
diff --git a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.svg b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.svg
index 8913427a8..ee40b276f 100644
--- a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.svg
+++ b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph.svg
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="133.75,-136.38 0,-136.38 0,-117.12 133.75,-117.12 133.75,-136.38"/>
 <text text-anchor="middle" x="66.88" y="-122.88" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; int, maxNode &gt;</text>
 </a>
@@ -54,7 +54,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="264.25,-142 151.5,-142 151.5,-111.5 264.25,-111.5 264.25,-142"/>
 <text text-anchor="start" x="159.5" y="-128.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; std::array</text>
 <text text-anchor="middle" x="207.88" y="-117.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int, 2 &gt;, maxNode &gt;</text>
diff --git a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph_org.svg b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph_org.svg
index ba08d1ec4..c48f571d7 100644
--- a/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph_org.svg
+++ b/d2/db9/structdata__structures_1_1treap_1_1_treap__coll__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="133.75,-136.38 0,-136.38 0,-117.12 133.75,-117.12 133.75,-136.38"/>
 <text text-anchor="middle" x="66.88" y="-122.88" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; int, maxNode &gt;</text>
 </a>
@@ -43,7 +43,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="264.25,-142 151.5,-142 151.5,-111.5 264.25,-111.5 264.25,-142"/>
 <text text-anchor="start" x="159.5" y="-128.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; std::array</text>
 <text text-anchor="middle" x="207.88" y="-117.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int, 2 &gt;, maxNode &gt;</text>
diff --git a/d2/dc4/classstack__linked_list.html b/d2/dc4/classstack__linked_list.html
index 5930807cb..d509f94f2 100644
--- a/d2/dc4/classstack__linked_list.html
+++ b/d2/dc4/classstack__linked_list.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: stack_linkedList Class Reference</title>
+<title>TheAlgorithms/C++: stack_linkedList Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -128,14 +145,15 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a445c8ffd4a85bf74a5d5f7b7e716f06d" id="r_a445c8ffd4a85bf74a5d5f7b7e716f06d"><td class="memItemLeft" align="right" valign="top"><a id="a445c8ffd4a85bf74a5d5f7b7e716f06d" name="a445c8ffd4a85bf74a5d5f7b7e716f06d"></a>
-<a class="el" href="../../d0/dff/structlinkedlist.html">linkedlist</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>front</b></td></tr>
+<tr class="memitem:a445c8ffd4a85bf74a5d5f7b7e716f06d" id="r_a445c8ffd4a85bf74a5d5f7b7e716f06d"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d0/dff/structlinkedlist.html">linkedlist</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a445c8ffd4a85bf74a5d5f7b7e716f06d">front</a></td></tr>
 <tr class="separator:a445c8ffd4a85bf74a5d5f7b7e716f06d"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa34ec2024dcfe130e6458149093772b3" id="r_aa34ec2024dcfe130e6458149093772b3"><td class="memItemLeft" align="right" valign="top"><a id="aa34ec2024dcfe130e6458149093772b3" name="aa34ec2024dcfe130e6458149093772b3"></a>
-<a class="el" href="../../d0/dff/structlinkedlist.html">linkedlist</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>rear</b></td></tr>
+<tr class="memitem:aa34ec2024dcfe130e6458149093772b3" id="r_aa34ec2024dcfe130e6458149093772b3"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d0/dff/structlinkedlist.html">linkedlist</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa34ec2024dcfe130e6458149093772b3">rear</a></td></tr>
 <tr class="separator:aa34ec2024dcfe130e6458149093772b3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
-<h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html#l00010">10</a> of file <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html">queue_using_linkedlist.cpp</a>.</p>
+</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a44c1c5a34c5fb553025a33abe4f2e819" name="a44c1c5a34c5fb553025a33abe4f2e819"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a44c1c5a34c5fb553025a33abe4f2e819">&#9670;&#160;</a></span>stack_linkedList()</h2>
 
@@ -158,6 +176,8 @@ Public Attributes</h2></td></tr>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html#l00015">15</a> of file <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html">queue_using_linkedlist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   15</span>{ front = rear = NULL; }</div>
 </div><!-- fragment -->
 </div>
@@ -177,11 +197,13 @@ Public Attributes</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html">queue_using_linkedlist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   32</span>                              {</div>
 <div class="line"><span class="lineno">   33</span>    <a class="code hl_struct" href="../../d0/dff/structlinkedlist.html">linkedlist</a> *temp;</div>
 <div class="line"><span class="lineno">   34</span>    <span class="keywordtype">int</span> ele;</div>
 <div class="line"><span class="lineno">   35</span>    <span class="keywordflow">if</span> (front == NULL)</div>
-<div class="line"><span class="lineno">   36</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nStack is empty&quot;</span>;</div>
+<div class="line"><span class="lineno">   36</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nStack is empty&quot;</span>;</div>
 <div class="line"><span class="lineno">   37</span>    <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">   38</span>        temp = front;</div>
 <div class="line"><span class="lineno">   39</span>        ele = temp-&gt;data;</div>
@@ -192,8 +214,7 @@ Public Attributes</h2></td></tr>
 <div class="line"><span class="lineno">   44</span>    }</div>
 <div class="line"><span class="lineno">   45</span>    <span class="keywordflow">return</span> ele;</div>
 <div class="line"><span class="lineno">   46</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="astructlinkedlist_html"><div class="ttname"><a href="../../d0/dff/structlinkedlist.html">linkedlist</a></div><div class="ttdef"><b>Definition</b> queue_using_linkedlist.cpp:6</div></div>
+<div class="ttc" id="astructlinkedlist_html"><div class="ttname"><a href="../../d0/dff/structlinkedlist.html">linkedlist</a></div><div class="ttdef"><b>Definition</b> <a href="../../de/d5b/queue__using__linkedlist_8cpp_source.html#l00006">queue_using_linkedlist.cpp:6</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -211,15 +232,17 @@ Public Attributes</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html">queue_using_linkedlist.cpp</a>.</p>
 <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> (front == NULL)</div>
-<div class="line"><span class="lineno">   49</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nStack is empty&quot;</span>;</div>
+<div class="line"><span class="lineno">   49</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nStack is empty&quot;</span>;</div>
 <div class="line"><span class="lineno">   50</span> </div>
 <div class="line"><span class="lineno">   51</span>    <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">   52</span>        <a class="code hl_struct" href="../../d0/dff/structlinkedlist.html">linkedlist</a> *temp;</div>
 <div class="line"><span class="lineno">   53</span>        temp = front;</div>
 <div class="line"><span class="lineno">   54</span>        <span class="keywordflow">while</span> (temp != NULL) {</div>
-<div class="line"><span class="lineno">   55</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; temp-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   55</span>            std::cout &lt;&lt; temp-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   56</span>            temp = temp-&gt;next;</div>
 <div class="line"><span class="lineno">   57</span>        }</div>
 <div class="line"><span class="lineno">   58</span>    }</div>
@@ -241,6 +264,8 @@ Public Attributes</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html#l00020">20</a> of file <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html">queue_using_linkedlist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   20</span>                                      {</div>
 <div class="line"><span class="lineno">   21</span>    <a class="code hl_struct" href="../../d0/dff/structlinkedlist.html">linkedlist</a> *temp = <span class="keyword">new</span> <a class="code hl_struct" href="../../d0/dff/structlinkedlist.html">linkedlist</a>();</div>
 <div class="line"><span class="lineno">   22</span>    temp-&gt;data = ele;</div>
@@ -254,10 +279,43 @@ Public Attributes</h2></td></tr>
 <div class="line"><span class="lineno">   30</span>    }</div>
 <div class="line"><span class="lineno">   31</span>}</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a445c8ffd4a85bf74a5d5f7b7e716f06d" name="a445c8ffd4a85bf74a5d5f7b7e716f06d"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a445c8ffd4a85bf74a5d5f7b7e716f06d">&#9670;&#160;</a></span>front</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d0/dff/structlinkedlist.html">linkedlist</a>* stack_linkedList::front</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html#l00012">12</a> of file <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html">queue_using_linkedlist.cpp</a>.</p>
+
+</div>
+</div>
+<a id="aa34ec2024dcfe130e6458149093772b3" name="aa34ec2024dcfe130e6458149093772b3"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aa34ec2024dcfe130e6458149093772b3">&#9670;&#160;</a></span>rear</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d0/dff/structlinkedlist.html">linkedlist</a>* stack_linkedList::rear</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html#l00013">13</a> of file <a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html">queue_using_linkedlist.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>data_structures/<b>queue_using_linkedlist.cpp</b></li>
+<li>data_structures/<a class="el" href="../../de/d5b/queue__using__linkedlist_8cpp_source.html">queue_using_linkedlist.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d2/dc8/classdata__structures_1_1_stack.html b/d2/dc8/classdata__structures_1_1_stack.html
index b1807fc6b..208a228fc 100644
--- a/d2/dc8/classdata__structures_1_1_stack.html
+++ b/d2/dc8/classdata__structures_1_1_stack.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::Stack&lt; T &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: data_structures::Stack&lt; T &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -149,17 +166,14 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a3f912a0e9bed5b24b206584e3010dce3" id="r_a3f912a0e9bed5b24b206584e3010dce3"><td class="memItemLeft" align="right" valign="top"><a id="a3f912a0e9bed5b24b206584e3010dce3" name="a3f912a0e9bed5b24b206584e3010dce3"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; T[]&gt;&#160;</td><td class="memItemRight" valign="bottom"><b>stack</b></td></tr>
-<tr class="memdesc:a3f912a0e9bed5b24b206584e3010dce3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Smart pointer to the stack array. <br /></td></tr>
+<tr class="memitem:a3f912a0e9bed5b24b206584e3010dce3" id="r_a3f912a0e9bed5b24b206584e3010dce3"><td class="memItemLeft" align="right" valign="top">std::unique_ptr&lt; T[]&gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3f912a0e9bed5b24b206584e3010dce3">stack</a></td></tr>
+<tr class="memdesc:a3f912a0e9bed5b24b206584e3010dce3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Smart pointer to the stack array.  <br /></td></tr>
 <tr class="separator:a3f912a0e9bed5b24b206584e3010dce3"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a88a10062c0662a385f172669f2f19b86" id="r_a88a10062c0662a385f172669f2f19b86"><td class="memItemLeft" align="right" valign="top"><a id="a88a10062c0662a385f172669f2f19b86" name="a88a10062c0662a385f172669f2f19b86"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>stackSize</b></td></tr>
-<tr class="memdesc:a88a10062c0662a385f172669f2f19b86"><td class="mdescLeft">&#160;</td><td class="mdescRight">Maximum size of the stack. <br /></td></tr>
+<tr class="memitem:a88a10062c0662a385f172669f2f19b86" id="r_a88a10062c0662a385f172669f2f19b86"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a88a10062c0662a385f172669f2f19b86">stackSize</a></td></tr>
+<tr class="memdesc:a88a10062c0662a385f172669f2f19b86"><td class="mdescLeft">&#160;</td><td class="mdescRight">Maximum size of the stack.  <br /></td></tr>
 <tr class="separator:a88a10062c0662a385f172669f2f19b86"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a71afc94746d47fb2c0c4fa4b612edee6" id="r_a71afc94746d47fb2c0c4fa4b612edee6"><td class="memItemLeft" align="right" valign="top"><a id="a71afc94746d47fb2c0c4fa4b612edee6" name="a71afc94746d47fb2c0c4fa4b612edee6"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>stackIndex</b></td></tr>
-<tr class="memdesc:a71afc94746d47fb2c0c4fa4b612edee6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Index pointing to the top element of the stack. <br /></td></tr>
+<tr class="memitem:a71afc94746d47fb2c0c4fa4b612edee6" id="r_a71afc94746d47fb2c0c4fa4b612edee6"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a></td></tr>
+<tr class="memdesc:a71afc94746d47fb2c0c4fa4b612edee6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Index pointing to the top element of the stack.  <br /></td></tr>
 <tr class="separator:a71afc94746d47fb2c0c4fa4b612edee6"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -171,6 +185,8 @@ class data_structures::Stack&lt; T &gt;</div><p>Class representation of a stack.
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html#l00016">16</a> of file <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html">stack_using_array.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a8cb0602c8a9c1603d0315938177ecc6a" name="a8cb0602c8a9c1603d0315938177ecc6a"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a8cb0602c8a9c1603d0315938177ecc6a">&#9670;&#160;</a></span>Stack()</h2>
@@ -204,10 +220,12 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html">stack_using_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   28</span>: <a class="code hl_variable" href="#a88a10062c0662a385f172669f2f19b86">stackSize</a>(size), <a class="code hl_variable" href="#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a>(-1), <a class="code hl_variable" href="#a3f912a0e9bed5b24b206584e3010dce3">stack</a>(<span class="keyword">new</span> T[size]) {}</div>
-<div class="ttc" id="aclassdata__structures_1_1_stack_html_a3f912a0e9bed5b24b206584e3010dce3"><div class="ttname"><a href="#a3f912a0e9bed5b24b206584e3010dce3">data_structures::Stack::stack</a></div><div class="ttdeci">std::unique_ptr&lt; T[]&gt; stack</div><div class="ttdoc">Smart pointer to the stack array.</div><div class="ttdef"><b>Definition</b> stack_using_array.cpp:18</div></div>
-<div class="ttc" id="aclassdata__structures_1_1_stack_html_a71afc94746d47fb2c0c4fa4b612edee6"><div class="ttname"><a href="#a71afc94746d47fb2c0c4fa4b612edee6">data_structures::Stack::stackIndex</a></div><div class="ttdeci">int stackIndex</div><div class="ttdoc">Index pointing to the top element of the stack.</div><div class="ttdef"><b>Definition</b> stack_using_array.cpp:20</div></div>
-<div class="ttc" id="aclassdata__structures_1_1_stack_html_a88a10062c0662a385f172669f2f19b86"><div class="ttname"><a href="#a88a10062c0662a385f172669f2f19b86">data_structures::Stack::stackSize</a></div><div class="ttdeci">int stackSize</div><div class="ttdoc">Maximum size of the stack.</div><div class="ttdef"><b>Definition</b> stack_using_array.cpp:19</div></div>
+<div class="ttc" id="aclassdata__structures_1_1_stack_html_a3f912a0e9bed5b24b206584e3010dce3"><div class="ttname"><a href="#a3f912a0e9bed5b24b206584e3010dce3">data_structures::Stack::stack</a></div><div class="ttdeci">std::unique_ptr&lt; T[]&gt; stack</div><div class="ttdoc">Smart pointer to the stack array.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d96/stack__using__array_8cpp_source.html#l00018">stack_using_array.cpp:18</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_stack_html_a71afc94746d47fb2c0c4fa4b612edee6"><div class="ttname"><a href="#a71afc94746d47fb2c0c4fa4b612edee6">data_structures::Stack::stackIndex</a></div><div class="ttdeci">int stackIndex</div><div class="ttdoc">Index pointing to the top element of the stack.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d96/stack__using__array_8cpp_source.html#l00020">stack_using_array.cpp:20</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_stack_html_a88a10062c0662a385f172669f2f19b86"><div class="ttname"><a href="#a88a10062c0662a385f172669f2f19b86">data_structures::Stack::stackSize</a></div><div class="ttdeci">int stackSize</div><div class="ttdoc">Maximum size of the stack.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d96/stack__using__array_8cpp_source.html#l00019">stack_using_array.cpp:19</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -241,25 +259,21 @@ template&lt;typename T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>The bottom element of the stack </dd></dl>
 <dl class="exception"><dt>Exceptions</dt><dd>
   <table class="exception">
-    <tr><td class="paramname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a></td><td>if the stack is empty </td></tr>
+    <tr><td class="paramname">std::out_of_range</td><td>if the stack is empty </td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html#l00097">97</a> of file <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html">stack_using_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   97</span>                     {</div>
 <div class="line"><span class="lineno">   98</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="#a04e2e7cb58b2de6d3a15053bfaaf6080">empty</a>()) {</div>
-<div class="line"><span class="lineno">   99</span>            <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a>(<span class="stringliteral">&quot;Stack underflow&quot;</span>);</div>
+<div class="line"><span class="lineno">   99</span>            <span class="keywordflow">throw</span> std::out_of_range(<span class="stringliteral">&quot;Stack underflow&quot;</span>);</div>
 <div class="line"><span class="lineno">  100</span>        }</div>
 <div class="line"><span class="lineno">  101</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[0];</div>
 <div class="line"><span class="lineno">  102</span>    }</div>
-<div class="ttc" id="aclassdata__structures_1_1_stack_html_a04e2e7cb58b2de6d3a15053bfaaf6080"><div class="ttname"><a href="#a04e2e7cb58b2de6d3a15053bfaaf6080">data_structures::Stack::empty</a></div><div class="ttdeci">bool empty() const</div><div class="ttdoc">Checks if the stack is empty.</div><div class="ttdef"><b>Definition</b> stack_using_array.cpp:41</div></div>
-<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> stack.hpp:19</div></div>
-<div class="ttc" id="aout_of_range_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph.svg" width="366" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1_stack_html_a04e2e7cb58b2de6d3a15053bfaaf6080"><div class="ttname"><a href="#a04e2e7cb58b2de6d3a15053bfaaf6080">data_structures::Stack::empty</a></div><div class="ttdeci">bool empty() const</div><div class="ttdoc">Checks if the stack is empty.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d96/stack__using__array_8cpp_source.html#l00041">stack_using_array.cpp:41</a></div></div>
+<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00019">stack.hpp:19</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a04e2e7cb58b2de6d3a15053bfaaf6080" name="a04e2e7cb58b2de6d3a15053bfaaf6080"></a>
@@ -289,6 +303,8 @@ template&lt;typename T &gt; </div>
 
 <p>Checks if the stack is empty. </p>
 <dl class="section return"><dt>Returns</dt><dd>true if the stack is empty, false otherwise </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html">stack_using_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   41</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a> == -1; }</div>
 </div><!-- fragment -->
 </div>
@@ -320,6 +336,8 @@ template&lt;typename T &gt; </div>
 
 <p>Checks if the stack is full. </p>
 <dl class="section return"><dt>Returns</dt><dd>true if the stack is full, false otherwise </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html">stack_using_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   35</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a> == <a class="code hl_variable" href="#a88a10062c0662a385f172669f2f19b86">stackSize</a> - 1; }</div>
 </div><!-- fragment -->
 </div>
@@ -353,22 +371,19 @@ template&lt;typename T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>The popped element </dd></dl>
 <dl class="exception"><dt>Exceptions</dt><dd>
   <table class="exception">
-    <tr><td class="paramname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a></td><td>if the stack is empty </td></tr>
+    <tr><td class="paramname">std::out_of_range</td><td>if the stack is empty </td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html">stack_using_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>            {</div>
 <div class="line"><span class="lineno">   63</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="#a04e2e7cb58b2de6d3a15053bfaaf6080">empty</a>()) {</div>
-<div class="line"><span class="lineno">   64</span>            <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a>(<span class="stringliteral">&quot;Stack underflow&quot;</span>);</div>
+<div class="line"><span class="lineno">   64</span>            <span class="keywordflow">throw</span> std::out_of_range(<span class="stringliteral">&quot;Stack underflow&quot;</span>);</div>
 <div class="line"><span class="lineno">   65</span>        }</div>
 <div class="line"><span class="lineno">   66</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[<a class="code hl_variable" href="#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a>--];</div>
 <div class="line"><span class="lineno">   67</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph.svg" width="395" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa9f9b087e9e7c00628e1289f0f1de3b2" name="aa9f9b087e9e7c00628e1289f0f1de3b2"></a>
@@ -403,20 +418,17 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html">stack_using_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   48</span>                         {</div>
 <div class="line"><span class="lineno">   49</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="#aa753346c8ee5f21d4f4482398fe6d5c1">full</a>()) {</div>
-<div class="line"><span class="lineno">   50</span>            <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a>(<span class="stringliteral">&quot;Stack overflow&quot;</span>);</div>
+<div class="line"><span class="lineno">   50</span>            <span class="keywordflow">throw</span> std::out_of_range(<span class="stringliteral">&quot;Stack overflow&quot;</span>);</div>
 <div class="line"><span class="lineno">   51</span>        } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">   52</span>            <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[++<a class="code hl_variable" href="#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a>] = element;</div>
 <div class="line"><span class="lineno">   53</span>        }</div>
 <div class="line"><span class="lineno">   54</span>    }</div>
-<div class="ttc" id="aclassdata__structures_1_1_stack_html_aa753346c8ee5f21d4f4482398fe6d5c1"><div class="ttname"><a href="#aa753346c8ee5f21d4f4482398fe6d5c1">data_structures::Stack::full</a></div><div class="ttdeci">bool full() const</div><div class="ttdoc">Checks if the stack is full.</div><div class="ttdef"><b>Definition</b> stack_using_array.cpp:35</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph.svg" width="366" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1_stack_html_aa753346c8ee5f21d4f4482398fe6d5c1"><div class="ttname"><a href="#aa753346c8ee5f21d4f4482398fe6d5c1">data_structures::Stack::full</a></div><div class="ttdeci">bool full() const</div><div class="ttdoc">Checks if the stack is full.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d96/stack__using__array_8cpp_source.html#l00035">stack_using_array.cpp:35</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abb86ed67d9d97112897a09cfb10ff586" name="abb86ed67d9d97112897a09cfb10ff586"></a>
@@ -445,12 +457,13 @@ template&lt;typename T &gt; </div>
 </div><div class="memdoc">
 
 <p>Displays all elements in the stack. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html#l00072">72</a> of file <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html">stack_using_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   72</span>                      {</div>
 <div class="line"><span class="lineno">   73</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= <a class="code hl_variable" href="#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a>; i++) {</div>
-<div class="line"><span class="lineno">   74</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[i] &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   74</span>            std::cout &lt;&lt; <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[i] &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   75</span>        }</div>
 <div class="line"><span class="lineno">   76</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><!-- fragment -->
 </div>
 </div>
@@ -483,26 +496,108 @@ template&lt;typename T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>The topmost element of the stack </dd></dl>
 <dl class="exception"><dt>Exceptions</dt><dd>
   <table class="exception">
-    <tr><td class="paramname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a></td><td>if the stack is empty </td></tr>
+    <tr><td class="paramname">std::out_of_range</td><td>if the stack is empty </td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html#l00084">84</a> of file <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html">stack_using_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   84</span>                      {</div>
 <div class="line"><span class="lineno">   85</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="#a04e2e7cb58b2de6d3a15053bfaaf6080">empty</a>()) {</div>
-<div class="line"><span class="lineno">   86</span>            <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a>(<span class="stringliteral">&quot;Stack underflow&quot;</span>);</div>
+<div class="line"><span class="lineno">   86</span>            <span class="keywordflow">throw</span> std::out_of_range(<span class="stringliteral">&quot;Stack underflow&quot;</span>);</div>
 <div class="line"><span class="lineno">   87</span>        }</div>
 <div class="line"><span class="lineno">   88</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[<a class="code hl_variable" href="#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a>];</div>
 <div class="line"><span class="lineno">   89</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph.svg" width="366" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a3f912a0e9bed5b24b206584e3010dce3" name="a3f912a0e9bed5b24b206584e3010dce3"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a3f912a0e9bed5b24b206584e3010dce3">&#9670;&#160;</a></span>stack</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename T &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::unique_ptr&lt;T[]&gt; <a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack</a>&lt; T &gt;<a class="el" href="../../d1/dc2/classstack.html">::stack</a></td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Smart pointer to the stack array. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html#l00018">18</a> of file <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html">stack_using_array.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a71afc94746d47fb2c0c4fa4b612edee6" name="a71afc94746d47fb2c0c4fa4b612edee6"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a71afc94746d47fb2c0c4fa4b612edee6">&#9670;&#160;</a></span>stackIndex</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename T &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int <a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack</a>&lt; T &gt;::stackIndex</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Index pointing to the top element of the stack. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html#l00020">20</a> of file <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html">stack_using_array.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a88a10062c0662a385f172669f2f19b86" name="a88a10062c0662a385f172669f2f19b86"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a88a10062c0662a385f172669f2f19b86">&#9670;&#160;</a></span>stackSize</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename T &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int <a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack</a>&lt; T &gt;::stackSize</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Maximum size of the stack. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html#l00019">19</a> of file <a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html">stack_using_array.cpp</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>data_structures/<b>stack_using_array.cpp</b></li>
+<li>data_structures/<a class="el" href="../../d8/d96/stack__using__array_8cpp_source.html">stack_using_array.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph.map b/d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph.map
deleted file mode 100644
index 6b2351f5a..000000000
--- a/d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::Stack::bottom" name="data_structures::Stack::bottom">
-<area shape="rect" id="Node000001" title="Displays the bottom element of the stack." alt="" coords="5,5,159,46"/>
-<area shape="rect" id="Node000002" href="$d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080" title="Checks if the stack is empty." alt="" coords="207,5,360,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,23,191,23,191,28,159,28"/>
-</map>
diff --git a/d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph.md5 b/d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph.md5
deleted file mode 100644
index cb5a7b3b4..000000000
--- a/d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-512dee9322fc30c83b03c7723d356ea5
\ No newline at end of file
diff --git a/d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph.svg b/d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph.svg
deleted file mode 100644
index 6d1a773d9..000000000
--- a/d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::Stack::bottom Pages: 1 -->
-<svg width="274pt" height="39pt"
- viewBox="0.00 0.00 274.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::Stack::bottom</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Displays the bottom element of the stack.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::bottom</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080" target="_top" xlink:title="Checks if the stack is empty.">
-<polygon fill="white" stroke="#666666" points="266,-30.5 151,-30.5 151,0 266,0 266,-30.5"/>
-<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-15.25C123.19,-15.25 131.42,-15.25 139.53,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.39,-18.75 149.39,-15.25 139.39,-11.75 139.39,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph_org.svg b/d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph_org.svg
deleted file mode 100644
index 886fbf37f..000000000
--- a/d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::Stack::bottom Pages: 1 -->
-<svg width="274pt" height="39pt"
- viewBox="0.00 0.00 274.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::Stack::bottom</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Displays the bottom element of the stack.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::bottom</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080" target="_top" xlink:title="Checks if the stack is empty.">
-<polygon fill="white" stroke="#666666" points="266,-30.5 151,-30.5 151,0 266,0 266,-30.5"/>
-<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-15.25C123.19,-15.25 131.42,-15.25 139.53,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.39,-18.75 149.39,-15.25 139.39,-11.75 139.39,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph.map b/d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph.map
deleted file mode 100644
index eb7ce3f4b..000000000
--- a/d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::Stack::topmost" name="data_structures::Stack::topmost">
-<area shape="rect" id="Node000001" title="Displays the topmost element of the stack." alt="" coords="5,5,159,46"/>
-<area shape="rect" id="Node000002" href="$d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080" title="Checks if the stack is empty." alt="" coords="207,5,360,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,23,191,23,191,28,159,28"/>
-</map>
diff --git a/d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph.md5 b/d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph.md5
deleted file mode 100644
index cf80e65fd..000000000
--- a/d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0bf4679a8dd8bec2876299055859fed6
\ No newline at end of file
diff --git a/d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph.svg b/d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph.svg
deleted file mode 100644
index 3c91dfdca..000000000
--- a/d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::Stack::topmost Pages: 1 -->
-<svg width="274pt" height="39pt"
- viewBox="0.00 0.00 274.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::Stack::topmost</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Displays the topmost element of the stack.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::topmost</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080" target="_top" xlink:title="Checks if the stack is empty.">
-<polygon fill="white" stroke="#666666" points="266,-30.5 151,-30.5 151,0 266,0 266,-30.5"/>
-<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-15.25C123.19,-15.25 131.42,-15.25 139.53,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.39,-18.75 149.39,-15.25 139.39,-11.75 139.39,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph_org.svg b/d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph_org.svg
deleted file mode 100644
index 72619ee46..000000000
--- a/d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::Stack::topmost Pages: 1 -->
-<svg width="274pt" height="39pt"
- viewBox="0.00 0.00 274.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::Stack::topmost</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Displays the topmost element of the stack.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::topmost</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080" target="_top" xlink:title="Checks if the stack is empty.">
-<polygon fill="white" stroke="#666666" points="266,-30.5 151,-30.5 151,0 266,0 266,-30.5"/>
-<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-15.25C123.19,-15.25 131.42,-15.25 139.53,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.39,-18.75 149.39,-15.25 139.39,-11.75 139.39,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph.map b/d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph.map
deleted file mode 100644
index 1760ce55a..000000000
--- a/d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::Stack::push" name="data_structures::Stack::push">
-<area shape="rect" id="Node000001" title="Pushes an element onto the stack." alt="" coords="5,5,159,46"/>
-<area shape="rect" id="Node000002" href="$d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1" title="Checks if the stack is full." alt="" coords="207,5,360,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,23,191,23,191,28,159,28"/>
-</map>
diff --git a/d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph.md5 b/d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph.md5
deleted file mode 100644
index ae57923a0..000000000
--- a/d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-04111dff9752fdbb83c636f658bb2c4c
\ No newline at end of file
diff --git a/d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph.svg b/d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph.svg
deleted file mode 100644
index a98092c6e..000000000
--- a/d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::Stack::push Pages: 1 -->
-<svg width="274pt" height="39pt"
- viewBox="0.00 0.00 274.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::Stack::push</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Pushes an element onto the stack.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1" target="_top" xlink:title="Checks if the stack is full.">
-<polygon fill="white" stroke="#666666" points="266,-30.5 151,-30.5 151,0 266,0 266,-30.5"/>
-<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::full</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-15.25C123.19,-15.25 131.42,-15.25 139.53,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.39,-18.75 149.39,-15.25 139.39,-11.75 139.39,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph_org.svg b/d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph_org.svg
deleted file mode 100644
index 758965798..000000000
--- a/d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::Stack::push Pages: 1 -->
-<svg width="274pt" height="39pt"
- viewBox="0.00 0.00 274.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::Stack::push</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Pushes an element onto the stack.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1" target="_top" xlink:title="Checks if the stack is full.">
-<polygon fill="white" stroke="#666666" points="266,-30.5 151,-30.5 151,0 266,0 266,-30.5"/>
-<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::full</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-15.25C123.19,-15.25 131.42,-15.25 139.53,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.39,-18.75 149.39,-15.25 139.39,-11.75 139.39,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph.map b/d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph.map
deleted file mode 100644
index e0a8b6a23..000000000
--- a/d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::Stack::pop" name="data_structures::Stack::pop">
-<area shape="rect" id="Node000001" title="Pops an element from the stack." alt="" coords="5,13,188,38"/>
-<area shape="rect" id="Node000002" href="$d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080" title="Checks if the stack is empty." alt="" coords="236,5,389,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="188,23,220,23,220,28,188,28"/>
-</map>
diff --git a/d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph.md5 b/d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph.md5
deleted file mode 100644
index d31270799..000000000
--- a/d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c0b0e361825dc1db439c164ff12ea73f
\ No newline at end of file
diff --git a/d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph.svg b/d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph.svg
deleted file mode 100644
index 37353d7fa..000000000
--- a/d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::Stack::pop Pages: 1 -->
-<svg width="296pt" height="39pt"
- viewBox="0.00 0.00 295.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::Stack::pop</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Pops an element from the stack.">
-<polygon fill="#999999" stroke="#666666" points="136.75,-24.88 0,-24.88 0,-5.63 136.75,-5.63 136.75,-24.88"/>
-<text text-anchor="middle" x="68.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080" target="_top" xlink:title="Checks if the stack is empty.">
-<polygon fill="white" stroke="#666666" points="287.75,-30.5 172.75,-30.5 172.75,0 287.75,0 287.75,-30.5"/>
-<text text-anchor="start" x="180.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
-<text text-anchor="middle" x="230.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M137.18,-15.25C145.07,-15.25 153.12,-15.25 161.02,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.92,-18.75 170.92,-15.25 160.92,-11.75 160.92,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph_org.svg b/d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph_org.svg
deleted file mode 100644
index 6c6c95386..000000000
--- a/d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::Stack::pop Pages: 1 -->
-<svg width="296pt" height="39pt"
- viewBox="0.00 0.00 295.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::Stack::pop</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Pops an element from the stack.">
-<polygon fill="#999999" stroke="#666666" points="136.75,-24.88 0,-24.88 0,-5.63 136.75,-5.63 136.75,-24.88"/>
-<text text-anchor="middle" x="68.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080" target="_top" xlink:title="Checks if the stack is empty.">
-<polygon fill="white" stroke="#666666" points="287.75,-30.5 172.75,-30.5 172.75,0 287.75,0 287.75,-30.5"/>
-<text text-anchor="start" x="180.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
-<text text-anchor="middle" x="230.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M137.18,-15.25C145.07,-15.25 153.12,-15.25 161.02,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.92,-18.75 170.92,-15.25 160.92,-11.75 160.92,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/dce/classothers_1_1iterative__tree__traversals_1_1_binary_tree-members.html b/d2/dce/classothers_1_1iterative__tree__traversals_1_1_binary_tree-members.html
index 62531d698..c49305379 100644
--- a/d2/dce/classothers_1_1iterative__tree__traversals_1_1_binary_tree-members.html
+++ b/d2/dce/classothers_1_1iterative__tree__traversals_1_1_binary_tree-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d2/dcf/namespacestatistics.html b/d2/dcf/namespacestatistics.html
index 7d28b0ae9..c48e0552b 100644
--- a/d2/dcf/namespacestatistics.html
+++ b/d2/dcf/namespacestatistics.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: statistics Namespace Reference</title>
+<title>TheAlgorithms/C++: statistics Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html b/d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html
index adf91150e..2d95f3dc1 100644
--- a/d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html
+++ b/d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: std::is_integral&lt; uint128_t &gt; Struct Reference</title>
+<title>TheAlgorithms/C++: std::is_integral&lt; uint128_t &gt; Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -117,7 +134,10 @@ Collaboration diagram for std::is_integral&lt; uint128_t &gt;:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/db0/structstd_1_1is__integral_3_01uint128__t_01_4__coll__graph.svg" width="195" height="111"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
-<hr/>The documentation for this struct was generated from the following file:<ul>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00025">25</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
+</div><hr/>The documentation for this struct was generated from the following file:<ul>
 <li>ciphers/<a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a></li>
 </ul>
 </div><!-- contents -->
@@ -125,7 +145,7 @@ Collaboration diagram for std::is_integral&lt; uint128_t &gt;:</div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
-    <li class="navelem"><a class="el" href="../../d8/dcc/namespacestd.html">std</a></li><li class="navelem"><a class="el" href="../../d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html">is_integral&lt; uint128_t &gt;</a></li>
+    <li class="navelem"><b>std</b></li><li class="navelem"><a class="el" href="../../d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html">is_integral&lt; uint128_t &gt;</a></li>
     <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
   </ul>
 </div>
diff --git a/d2/ddb/namespacegcd__of__n__numbers.html b/d2/ddb/namespacegcd__of__n__numbers.html
index 9507eecf3..4b3ac833b 100644
--- a/d2/ddb/namespacegcd__of__n__numbers.html
+++ b/d2/ddb/namespacegcd__of__n__numbers.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: gcd_of_n_numbers Namespace Reference</title>
+<title>TheAlgorithms/C++: gcd_of_n_numbers Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d2/de1/namespacehouse__robber.html b/d2/de1/namespacehouse__robber.html
index fb424343f..81883389e 100644
--- a/d2/de1/namespacehouse__robber.html
+++ b/d2/de1/namespacehouse__robber.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: house_robber Namespace Reference</title>
+<title>TheAlgorithms/C++: house_robber Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d2/de3/structlinear__probing_1_1_entry-members.html b/d2/de3/structlinear__probing_1_1_entry-members.html
index 21f14b78a..66d30b238 100644
--- a/d2/de3/structlinear__probing_1_1_entry-members.html
+++ b/d2/de3/structlinear__probing_1_1_entry-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d2/de7/namespacerunge__kutta.html b/d2/de7/namespacerunge__kutta.html
index 133f98664..dee91a8f2 100644
--- a/d2/de7/namespacerunge__kutta.html
+++ b/d2/de7/namespacerunge__kutta.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: runge_kutta Namespace Reference</title>
+<title>TheAlgorithms/C++: runge_kutta Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d2/de9/heavy__light__decomposition_8cpp.html b/d2/de9/heavy__light__decomposition_8cpp.html
index 925bac6c0..970748a86 100644
--- a/d2/de9/heavy__light__decomposition_8cpp.html
+++ b/d2/de9/heavy__light__decomposition_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: range_queries/heavy_light_decomposition.cpp File Reference</title>
+<title>TheAlgorithms/C++: range_queries/heavy_light_decomposition.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -128,7 +145,9 @@ Include dependency graph for heavy_light_decomposition.cpp:</div>
 <div class="dyncontent">
 <div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d8/dc0/heavy__light__decomposition_8cpp__incl.svg" width="100%" height="394"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
 </div>
-</div><table class="memberdecls">
+</div>
+<p><a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></td></tr>
@@ -144,7 +163,7 @@ Classes</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d69/namespacerange__queries.html">range_queries</a></td></tr>
-<tr class="memdesc:dd/d69/namespacerange__queries"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
+<tr class="memdesc:dd/d69/namespacerange__queries"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::vector <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d6f/namespaceheavy__light__decomposition.html">heavy_light_decomposition</a></td></tr>
 <tr class="memdesc:db/d6f/namespaceheavy__light__decomposition"><td class="mdescLeft">&#160;</td><td class="mdescRight">Heavy light decomposition algorithm. <br /></td></tr>
@@ -180,6 +199,8 @@ Functions</h2></td></tr>
 <li>Call obj.query(a, b) to get the (sum) of node values in the simple path from a to b. Note: a and b, must be 0 indexed.</li>
 </ol>
 <p>Sample I/O at the bottom. </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000011">Todo</a></b></dt><dd>Support edge weight queries, by storing the edge weight value in it's child algorithm verified by testing in CSES path queries: <a href="https://cses.fi/problemset/task/1138">https://cses.fi/problemset/task/1138</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -196,21 +217,18 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00634">634</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  634</span>           {</div>
 <div class="line"><span class="lineno">  635</span>  <a class="code hl_function" href="#a34b8683a2b429de5cce57e6d733ec817">test_1</a>();</div>
 <div class="line"><span class="lineno">  636</span>  <a class="code hl_function" href="#a458410412185a5f09199deaff7157a8d">test_2</a>();</div>
 <div class="line"><span class="lineno">  637</span>  <a class="code hl_function" href="#af31ec5409537703d9c8a47350386b32a">test_3</a>();</div>
 <div class="line"><span class="lineno">  638</span>  <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  639</span>}</div>
-<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:505</div></div>
-<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:549</div></div>
-<div class="ttc" id="aheavy__light__decomposition_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:592</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00505">heavy_light_decomposition.cpp:505</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00549">heavy_light_decomposition.cpp:549</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00592">heavy_light_decomposition.cpp:592</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a34b8683a2b429de5cce57e6d733ec817" name="a34b8683a2b429de5cce57e6d733ec817"></a>
@@ -236,20 +254,22 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Test implementations </p><dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00505">505</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  505</span>                     {</div>
-<div class="line"><span class="lineno">  506</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  506</span>  std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1:\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  507</span> </div>
 <div class="line"><span class="lineno">  508</span>  <span class="comment">// Test details</span></div>
 <div class="line"><span class="lineno">  509</span>  <span class="keywordtype">int</span> n = 5;</div>
-<div class="line"><span class="lineno">  510</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> node_values = {4, 2, 5, 2, 1};</div>
-<div class="line"><span class="lineno">  511</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;int&gt;</a>&gt; edges = {{1, 2}, {1, 3}, {3, 4}, {3, 5}};</div>
-<div class="line"><span class="lineno">  512</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;int&gt;</a>&gt; queries = {</div>
+<div class="line"><span class="lineno">  510</span>  std::vector&lt;int64_t&gt; node_values = {4, 2, 5, 2, 1};</div>
+<div class="line"><span class="lineno">  511</span>  std::vector&lt;std::vector&lt;int&gt;&gt; edges = {{1, 2}, {1, 3}, {3, 4}, {3, 5}};</div>
+<div class="line"><span class="lineno">  512</span>  std::vector&lt;std::vector&lt;int&gt;&gt; queries = {</div>
 <div class="line"><span class="lineno">  513</span>      {2, 1, 4},</div>
 <div class="line"><span class="lineno">  514</span>      {1, 3, 2},</div>
 <div class="line"><span class="lineno">  515</span>      {2, 1, 4},</div>
 <div class="line"><span class="lineno">  516</span>  };</div>
-<div class="line"><span class="lineno">  517</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> expected_result = {11, 8};</div>
-<div class="line"><span class="lineno">  518</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> code_result;</div>
+<div class="line"><span class="lineno">  517</span>  std::vector&lt;int&gt; expected_result = {11, 8};</div>
+<div class="line"><span class="lineno">  518</span>  std::vector&lt;int&gt; code_result;</div>
 <div class="line"><span class="lineno">  519</span> </div>
 <div class="line"><span class="lineno">  520</span>  <a class="code hl_class" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">range_queries::heavy_light_decomposition::HLD&lt;int64_t&gt;</a> hld(n);</div>
 <div class="line"><span class="lineno">  521</span>  hld.set_node_val(node_values);</div>
@@ -265,27 +285,18 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  531</span>      hld.update(p - 1, x);</div>
 <div class="line"><span class="lineno">  532</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (type == 2) {</div>
 <div class="line"><span class="lineno">  533</span>      <span class="keywordtype">int</span> a = q[1], b = q[2];</div>
-<div class="line"><span class="lineno">  534</span>      code_result.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(hld.query(a - 1, b - 1));</div>
+<div class="line"><span class="lineno">  534</span>      code_result.push_back(hld.query(a - 1, b - 1));</div>
 <div class="line"><span class="lineno">  535</span>    } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">  536</span>      <span class="keywordflow">continue</span>;</div>
 <div class="line"><span class="lineno">  537</span>    }</div>
 <div class="line"><span class="lineno">  538</span>  }</div>
-<div class="line"><span class="lineno">  539</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; static_cast&lt;int&gt;(expected_result.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()); i++) {</div>
+<div class="line"><span class="lineno">  539</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; static_cast&lt;int&gt;(expected_result.size()); i++) {</div>
 <div class="line"><span class="lineno">  540</span>    assert(expected_result[i] == code_result[i]);</div>
 <div class="line"><span class="lineno">  541</span>  }</div>
-<div class="line"><span class="lineno">  542</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest 1 passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  542</span>  std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest 1 passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  543</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="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">range_queries::heavy_light_decomposition::HLD</a></div><div class="ttdoc">The Heavy-Light Decomposition class.</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:336</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="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>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">range_queries::heavy_light_decomposition::HLD</a></div><div class="ttdoc">The Heavy-Light Decomposition class.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00336">heavy_light_decomposition.cpp:336</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a458410412185a5f09199deaff7157a8d" name="a458410412185a5f09199deaff7157a8d"></a>
@@ -311,19 +322,21 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Second test implementations </p><dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00549">549</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  549</span>                     {</div>
-<div class="line"><span class="lineno">  550</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  550</span>  std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2:\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  551</span> </div>
 <div class="line"><span class="lineno">  552</span>  <span class="comment">// Test details (Bamboo)</span></div>
 <div class="line"><span class="lineno">  553</span>  <span class="keywordtype">int</span> n = 10;</div>
-<div class="line"><span class="lineno">  554</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> node_values = {1, 8, 6, 8, 6, 2, 9, 2, 3, 2};</div>
-<div class="line"><span class="lineno">  555</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;int&gt;</a>&gt; edges = {</div>
+<div class="line"><span class="lineno">  554</span>  std::vector&lt;int64_t&gt; node_values = {1, 8, 6, 8, 6, 2, 9, 2, 3, 2};</div>
+<div class="line"><span class="lineno">  555</span>  std::vector&lt;std::vector&lt;int&gt;&gt; edges = {</div>
 <div class="line"><span class="lineno">  556</span>      {10, 5}, {6, 2}, {10, 7}, {5, 2}, {3, 9}, {8, 3}, {1, 4}, {6, 4}, {8, 7}};</div>
-<div class="line"><span class="lineno">  557</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;int&gt;</a>&gt; queries = {</div>
+<div class="line"><span class="lineno">  557</span>  std::vector&lt;std::vector&lt;int&gt;&gt; queries = {</div>
 <div class="line"><span class="lineno">  558</span>      {2, 1, 10}, {2, 1, 6}, {1, 3, 4}, {2, 1, 9}, {1, 5, 3},</div>
 <div class="line"><span class="lineno">  559</span>      {1, 7, 8},  {2, 1, 4}, {2, 1, 8}, {1, 1, 4}, {1, 2, 7}};</div>
-<div class="line"><span class="lineno">  560</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> expected_result = {27, 11, 45, 9, 34};</div>
-<div class="line"><span class="lineno">  561</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> code_result;</div>
+<div class="line"><span class="lineno">  560</span>  std::vector&lt;int&gt; expected_result = {27, 11, 45, 9, 34};</div>
+<div class="line"><span class="lineno">  561</span>  std::vector&lt;int&gt; code_result;</div>
 <div class="line"><span class="lineno">  562</span> </div>
 <div class="line"><span class="lineno">  563</span>  <a class="code hl_class" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">range_queries::heavy_light_decomposition::HLD&lt;int64_t&gt;</a> hld(n);</div>
 <div class="line"><span class="lineno">  564</span>  hld.set_node_val(node_values);</div>
@@ -339,22 +352,17 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  574</span>      hld.update(p - 1, x);</div>
 <div class="line"><span class="lineno">  575</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (type == 2) {</div>
 <div class="line"><span class="lineno">  576</span>      <span class="keywordtype">int</span> a = q[1], b = q[2];</div>
-<div class="line"><span class="lineno">  577</span>      code_result.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(hld.query(a - 1, b - 1));</div>
+<div class="line"><span class="lineno">  577</span>      code_result.push_back(hld.query(a - 1, b - 1));</div>
 <div class="line"><span class="lineno">  578</span>    } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">  579</span>      <span class="keywordflow">continue</span>;</div>
 <div class="line"><span class="lineno">  580</span>    }</div>
 <div class="line"><span class="lineno">  581</span>  }</div>
-<div class="line"><span class="lineno">  582</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; static_cast&lt;int&gt;(expected_result.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()); i++) {</div>
+<div class="line"><span class="lineno">  582</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; static_cast&lt;int&gt;(expected_result.size()); i++) {</div>
 <div class="line"><span class="lineno">  583</span>    assert(expected_result[i] == code_result[i]);</div>
 <div class="line"><span class="lineno">  584</span>  }</div>
-<div class="line"><span class="lineno">  585</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest2 passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  585</span>  std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest2 passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  586</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af31ec5409537703d9c8a47350386b32a" name="af31ec5409537703d9c8a47350386b32a"></a>
@@ -380,19 +388,21 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Third test implementations </p><dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00592">592</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  592</span>                     {</div>
-<div class="line"><span class="lineno">  593</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  593</span>  std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3:\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  594</span> </div>
 <div class="line"><span class="lineno">  595</span>  <span class="comment">// Test details</span></div>
 <div class="line"><span class="lineno">  596</span>  <span class="keywordtype">int</span> n = 8;</div>
-<div class="line"><span class="lineno">  597</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> node_values = {1, 8, 6, 8, 6, 2, 9, 2};</div>
-<div class="line"><span class="lineno">  598</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;int&gt;</a>&gt; edges = {{1, 2}, {2, 3}, {3, 4}, {1, 5},</div>
+<div class="line"><span class="lineno">  597</span>  std::vector&lt;int64_t&gt; node_values = {1, 8, 6, 8, 6, 2, 9, 2};</div>
+<div class="line"><span class="lineno">  598</span>  std::vector&lt;std::vector&lt;int&gt;&gt; edges = {{1, 2}, {2, 3}, {3, 4}, {1, 5},</div>
 <div class="line"><span class="lineno">  599</span>                                         {6, 3}, {7, 5}, {8, 7}};</div>
-<div class="line"><span class="lineno">  600</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;int&gt;</a>&gt; queries = {</div>
+<div class="line"><span class="lineno">  600</span>  std::vector&lt;std::vector&lt;int&gt;&gt; queries = {</div>
 <div class="line"><span class="lineno">  601</span>      {2, 6, 8}, {2, 3, 6}, {1, 3, 4}, {2, 7, 1}, {1, 5, 3},</div>
 <div class="line"><span class="lineno">  602</span>      {1, 7, 8}, {2, 6, 4}, {2, 7, 8}, {1, 1, 4}, {1, 2, 7}};</div>
-<div class="line"><span class="lineno">  603</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> expected_result = {34, 8, 16, 14, 10};</div>
-<div class="line"><span class="lineno">  604</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> code_result;</div>
+<div class="line"><span class="lineno">  603</span>  std::vector&lt;int&gt; expected_result = {34, 8, 16, 14, 10};</div>
+<div class="line"><span class="lineno">  604</span>  std::vector&lt;int&gt; code_result;</div>
 <div class="line"><span class="lineno">  605</span> </div>
 <div class="line"><span class="lineno">  606</span>  <a class="code hl_class" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">range_queries::heavy_light_decomposition::HLD&lt;int64_t&gt;</a> hld(n);</div>
 <div class="line"><span class="lineno">  607</span>  hld.set_node_val(node_values);</div>
@@ -408,22 +418,17 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  617</span>      hld.update(p - 1, x);</div>
 <div class="line"><span class="lineno">  618</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (type == 2) {</div>
 <div class="line"><span class="lineno">  619</span>      <span class="keywordtype">int</span> a = q[1], b = q[2];</div>
-<div class="line"><span class="lineno">  620</span>      code_result.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(hld.query(a - 1, b - 1));</div>
+<div class="line"><span class="lineno">  620</span>      code_result.push_back(hld.query(a - 1, b - 1));</div>
 <div class="line"><span class="lineno">  621</span>    } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">  622</span>      <span class="keywordflow">continue</span>;</div>
 <div class="line"><span class="lineno">  623</span>    }</div>
 <div class="line"><span class="lineno">  624</span>  }</div>
-<div class="line"><span class="lineno">  625</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; static_cast&lt;int&gt;(expected_result.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()); i++) {</div>
+<div class="line"><span class="lineno">  625</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; static_cast&lt;int&gt;(expected_result.size()); i++) {</div>
 <div class="line"><span class="lineno">  626</span>    assert(expected_result[i] == code_result[i]);</div>
 <div class="line"><span class="lineno">  627</span>  }</div>
-<div class="line"><span class="lineno">  628</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest3 passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  628</span>  std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest3 passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  629</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.map b/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.map
deleted file mode 100644
index a855d1f43..000000000
--- a/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.map
+++ /dev/null
@@ -1,49 +0,0 @@
-<map id="test_1" name="test_1">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,420,63,446"/>
-<area shape="rect" id="Node000002" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" title="Adds an undirected edge from node u to node v in the tree." alt="" coords="111,5,256,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="32,420,33,362,42,275,51,226,65,176,84,128,108,82,118,70,123,73,113,85,88,130,70,178,56,227,47,276,39,363,38,420"/>
-<area shape="rect" id="Node000003" 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="304,16,458,42"/>
-<area shape="poly" id="edge16_Node000001_Node000003" title=" " alt="" coords="32,420,33,368,41,292,51,251,64,209,83,169,109,132,303,52,323,45,324,50,305,57,112,137,88,171,69,211,56,252,47,293,38,369,37,420"/>
-<area shape="rect" id="Node000004" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" title="This function must be called after the tree adjacency list and node values are populated The function..." alt="" coords="111,405,256,461"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="63,430,95,430,95,436,63,436"/>
-<area shape="rect" id="Node000012" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" title="This function returns the sum of node values in the simple path from from node_1 to node_2." alt="" coords="111,147,256,202"/>
-<area shape="poly" id="edge17_Node000001_Node000012" title=" " alt="" coords="40,419,156,215,161,217,45,421"/>
-<area shape="rect" id="Node000017" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" title="Set the values for all the nodes." alt="" coords="111,499,256,554"/>
-<area shape="poly" id="edge23_Node000001_Node000017" title=" " alt="" coords="58,444,127,488,124,493,55,449"/>
-<area shape="rect" id="Node000018" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="324,670,439,695"/>
-<area shape="poly" id="edge25_Node000001_Node000018" title=" " alt="" coords="42,445,67,502,87,535,112,565,158,599,210,627,262,648,310,664,308,669,260,653,207,632,156,604,109,568,83,538,62,504,37,447"/>
-<area shape="rect" id="Node000019" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" title="This function updates the value at node with val." alt="" coords="111,707,256,762"/>
-<area shape="poly" id="edge26_Node000001_Node000019" title=" " alt="" coords="41,446,67,527,88,581,113,635,151,693,147,696,108,637,83,583,62,529,36,447"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="256,29,288,28,289,34,256,34"/>
-<area shape="rect" id="Node000005" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" title="Function that specifies the type of operation involved when segments are combined." alt="" coords="506,212,652,268"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="193,404,210,370,233,331,264,293,303,263,348,243,397,232,445,227,491,227,491,233,446,233,398,237,350,248,305,267,268,297,238,334,214,372,198,406"/>
-<area shape="rect" id="Node000006" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)" alt="" coords="308,301,454,357"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="236,402,303,367,311,362,314,367,305,372,239,407"/>
-<area shape="rect" id="Node000007" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" title="Utility function to lable the nodes so that heavy chains have a contigous lable." alt="" coords="308,405,454,461"/>
-<area shape="poly" id="edge7_Node000004_Node000007" title=" " alt="" coords="256,430,293,430,293,436,256,436"/>
-<area shape="rect" id="Node000008" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" title="Utility function to assign highest parent that can be reached though heavy chains." alt="" coords="308,589,454,645"/>
-<area shape="poly" id="edge9_Node000004_Node000008" title=" " alt="" coords="229,460,258,485,282,518,306,551,333,577,329,581,302,555,278,521,254,488,225,464"/>
-<area shape="rect" id="Node000009" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" title="This function must be called after the tree adjacency list and node values are populated The function..." alt="" coords="308,485,454,541"/>
-<area shape="poly" id="edge11_Node000004_Node000009" title=" " alt="" coords="255,459,298,477,296,482,253,464"/>
-<area shape="poly" id="edge6_Node000006_Node000006" title=" " alt="" coords="342,301,342,291,350,282,363,277,381,275,402,277,415,284,412,289,401,282,381,280,364,282,353,287,347,293,347,301"/>
-<area shape="poly" id="edge8_Node000007_Node000007" title=" " alt="" coords="342,405,342,395,350,386,363,381,381,379,402,381,415,388,412,393,401,386,381,384,364,386,353,391,347,397,347,405"/>
-<area shape="poly" id="edge10_Node000008_Node000008" title=" " alt="" coords="342,589,342,579,350,570,363,565,381,563,402,565,415,572,412,577,401,570,381,568,364,570,353,575,347,581,347,589"/>
-<area shape="rect" id="Node000010" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" title="Utility function to populate the t_par vector." alt="" coords="506,537,652,593"/>
-<area shape="poly" id="edge12_Node000009_Node000010" title=" " alt="" coords="455,530,492,540,491,545,453,535"/>
-<area shape="rect" id="Node000011" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" title="Utility function to compute sub&#45;tree sizes." alt="" coords="506,433,652,489"/>
-<area shape="poly" id="edge14_Node000009_Node000011" title=" " alt="" coords="453,492,491,482,492,487,455,497"/>
-<area shape="poly" id="edge13_Node000010_Node000010" title=" " alt="" coords="540,537,540,527,547,518,560,513,579,511,600,513,613,520,610,525,598,518,579,516,562,518,551,523,545,529,545,537"/>
-<area shape="poly" id="edge15_Node000011_Node000011" title=" " alt="" coords="540,433,540,423,547,414,560,409,579,407,600,409,613,416,610,421,598,414,579,412,562,414,551,419,545,425,545,433"/>
-<area shape="rect" id="Node000013" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" title="Utility function to break down a path query into two chain queries." alt="" coords="308,147,454,202"/>
-<area shape="poly" id="edge18_Node000012_Node000013" title=" " alt="" coords="256,172,293,172,293,177,256,177"/>
-<area shape="rect" id="Node000015" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" title="The function returns the least common ancestor of two nodes." alt="" coords="308,67,454,122"/>
-<area shape="poly" id="edge21_Node000012_Node000015" title=" " alt="" coords="253,144,296,126,298,131,255,149"/>
-<area shape="poly" id="edge19_Node000013_Node000005" title=" " alt="" coords="455,196,492,208,491,214,453,201"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="540,162,618,187"/>
-<area shape="poly" id="edge20_Node000013_Node000014" title=" " alt="" coords="454,172,524,172,524,177,454,177"/>
-<area shape="rect" id="Node000016" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store..." alt="" coords="506,67,652,122"/>
-<area shape="poly" id="edge22_Node000015_Node000016" title=" " alt="" coords="454,92,491,92,491,97,454,97"/>
-<area shape="poly" id="edge24_Node000017_Node000018" title=" " alt="" coords="216,553,258,597,280,628,290,642,306,655,314,660,311,665,302,659,286,645,276,632,254,600,212,557"/>
-<area shape="rect" id="Node000020" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" title="Update the value at a node." alt="" coords="308,720,454,776"/>
-<area shape="poly" id="edge27_Node000019_Node000020" title=" " alt="" coords="256,737,294,739,293,745,256,742"/>
-</map>
diff --git a/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.md5 b/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.md5
deleted file mode 100644
index fbe73cb07..000000000
--- a/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-edb2016c067a1e815a7f88ec910cc9a6
\ No newline at end of file
diff --git a/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg b/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg
deleted file mode 100644
index dbcbe896e..000000000
--- a/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg
+++ /dev/null
@@ -1,550 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_1 Pages: 1 -->
-<!--zoomable 586 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 493;
-var viewHeight = 586;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test_1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="43,-266.5 0,-266.5 0,-247.25 43,-247.25 43,-266.5"/>
-<text text-anchor="middle" x="21.5" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" target="_top" xlink:title="Adds an undirected edge from node u to node v in the tree.">
-<polygon fill="white" stroke="#666666" points="188,-577.75 79,-577.75 79,-536 188,-536 188,-577.75"/>
-<text text-anchor="start" x="87" y="-564.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-553" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-541.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.17,-266.88C21.45,-303.74 23.17,-434.18 79,-518.88 81.13,-522.11 83.65,-525.16 86.4,-528.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.8,-530.38 93.55,-534.51 88.5,-525.19 83.8,-530.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="339.75,-569.5 224,-569.5 224,-550.25 339.75,-550.25 339.75,-569.5"/>
-<text text-anchor="middle" x="281.88" y="-556" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge16_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge16_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.06,-266.77C21.07,-300.92 22.35,-415.33 79,-480.88 81.85,-484.17 219.92,-539.35 224,-540.88 228.74,-542.64 233.72,-544.42 238.69,-546.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.42,-549.41 248.01,-549.32 239.68,-542.79 237.42,-549.41"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="188,-277.75 79,-277.75 79,-236 188,-236 188,-277.75"/>
-<text text-anchor="start" x="87" y="-264.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::init</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.45,-256.88C50.47,-256.88 58.71,-256.88 67.3,-256.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.2,-260.38 77.2,-256.88 67.2,-253.38 67.2,-260.38"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" target="_top" xlink:title="This function returns the sum of node values in the simple path from from node_1 to node_2.">
-<polygon fill="white" stroke="#666666" points="188,-471.75 79,-471.75 79,-430 188,-430 188,-471.75"/>
-<text text-anchor="start" x="87" y="-458.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-447" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-435.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge17_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge17_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.11,-266.76C43.95,-294.7 89.53,-375.1 114.91,-419.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.73,-421.34 119.7,-428.31 117.82,-417.88 111.73,-421.34"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" target="_top" xlink:title="Set the values for all the nodes.">
-<polygon fill="white" stroke="#666666" points="188,-207.75 79,-207.75 79,-166 188,-166 188,-207.75"/>
-<text text-anchor="start" x="87" y="-194.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-183" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::set_node_val</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge23_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge23_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.26,-246.85C51.72,-238.28 71.71,-225.56 89.83,-214.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.25,-217.27 97.81,-208.95 87.49,-211.37 91.25,-217.27"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.12,-79.5 238.62,-79.5 238.62,-60.25 325.12,-60.25 325.12,-79.5"/>
-<text text-anchor="middle" x="281.88" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node18 -->
-<g id="edge25_Node000001_Node000018" class="edge">
-<title>Node1&#45;&gt;Node18</title>
-<g id="a_edge25_Node000001_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.74,-247.05C32.63,-227.49 50.48,-183.31 79,-156.88 121.06,-117.89 183.3,-94.7 227.53,-82.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.18,-85.64 236.91,-79.63 226.34,-78.89 228.18,-85.64"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" target="_top" xlink:title="This function updates the value at node with val.">
-<polygon fill="white" stroke="#666666" points="188,-51.75 79,-51.75 79,-10 188,-10 188,-51.75"/>
-<text text-anchor="start" x="87" y="-38.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-27" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-15.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node19 -->
-<g id="edge26_Node000001_Node000019" class="edge">
-<title>Node1&#45;&gt;Node19</title>
-<g id="a_edge26_Node000001_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.2,-246.88C32.12,-221.97 51.92,-155.52 79,-104.88 87.12,-89.69 97.98,-74.06 107.8,-61.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.42,-63.44 113.78,-53.39 104.89,-59.15 110.42,-63.44"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-557.98C196.05,-558.14 204.25,-558.3 212.37,-558.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.18,-561.97 222.25,-558.67 212.32,-554.97 212.18,-561.97"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="484.75,-422.75 375.75,-422.75 375.75,-381 484.75,-381 484.75,-422.75"/>
-<text text-anchor="start" x="383.75" y="-409.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-398" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-386.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.84,-278.2C155.51,-307.43 182.62,-359.03 224,-382.88 266.18,-407.18 321.48,-411.02 364.06,-409.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.12,-412.78 373.91,-408.75 363.74,-405.79 364.12,-412.78"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" target="_top" xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="white" stroke="#666666" points="336.38,-355.75 227.38,-355.75 227.38,-314 336.38,-314 336.38,-355.75"/>
-<text text-anchor="start" x="235.38" y="-342.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-331" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-319.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.12,-278.2C189.66,-286.54 207.65,-296.18 224,-304.88 226.08,-305.98 228.2,-307.11 230.35,-308.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.65,-311.31 239.13,-312.9 231.93,-305.12 228.65,-311.31"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" target="_top" xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="white" stroke="#666666" points="336.38,-277.75 227.38,-277.75 227.38,-236 336.38,-236 336.38,-277.75"/>
-<text text-anchor="start" x="235.38" y="-264.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge7_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge7_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-256.88C197.22,-256.88 206.7,-256.88 216,-256.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.69,-260.38 225.69,-256.88 215.69,-253.38 215.69,-260.38"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" target="_top" xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="white" stroke="#666666" points="336.38,-139.75 227.38,-139.75 227.38,-98 336.38,-98 336.38,-139.75"/>
-<text text-anchor="start" x="235.38" y="-126.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge9_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge9_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M166.37,-235.54C173.84,-229.88 181.5,-223.49 188,-216.88 207.19,-197.34 205.4,-186.97 224,-166.88 230.17,-160.21 237.24,-153.58 244.26,-147.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.5,-150.17 251.88,-141.04 241.98,-144.82 246.5,-150.17"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="336.38,-217.75 227.38,-217.75 227.38,-176 336.38,-176 336.38,-217.75"/>
-<text text-anchor="start" x="235.38" y="-204.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-193" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-181.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge11_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge11_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.52,-235.55C196.87,-231.31 207.84,-226.81 218.5,-222.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.7,-225.73 227.62,-218.7 217.04,-219.26 219.7,-225.73"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.49,-356.07C251.88,-365.55 261.01,-373.75 281.88,-373.75 293.94,-373.75 302.08,-371.01 306.29,-366.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.59,-368.1 308.86,-357.53 302.84,-366.24 309.59,-368.1"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge8_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge8_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.49,-278.07C251.88,-287.55 261.01,-295.75 281.88,-295.75 293.94,-295.75 302.08,-293.01 306.29,-288.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.59,-290.1 308.86,-279.53 302.84,-288.24 309.59,-290.1"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge10_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge10_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.49,-140.07C251.88,-149.55 261.01,-157.75 281.88,-157.75 293.94,-157.75 302.08,-155.01 306.29,-150.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.59,-152.1 308.86,-141.53 302.84,-150.24 309.59,-152.1"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="484.75,-178.75 375.75,-178.75 375.75,-137 484.75,-137 484.75,-178.75"/>
-<text text-anchor="start" x="383.75" y="-165.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-154" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-142.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge12_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge12_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-182.57C345.7,-180.14 355.28,-177.58 364.68,-175.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.36,-178.52 374.12,-172.56 363.56,-171.76 365.36,-178.52"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="484.75,-256.75 375.75,-256.75 375.75,-215 484.75,-215 484.75,-256.75"/>
-<text text-anchor="start" x="383.75" y="-243.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-232" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge14_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge14_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-211.18C345.7,-213.61 355.28,-216.17 364.68,-218.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="363.56,-221.99 374.12,-221.19 365.36,-215.23 363.56,-221.99"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node10 -->
-<g id="edge13_Node000010_Node000010" class="edge">
-<title>Node10&#45;&gt;Node10</title>
-<g id="a_edge13_Node000010_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M402.86,-179.07C400.26,-188.55 409.38,-196.75 430.25,-196.75 442.31,-196.75 450.45,-194.01 454.67,-189.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.96,-191.1 457.23,-180.53 451.21,-189.24 457.96,-191.1"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node11 -->
-<g id="edge15_Node000011_Node000011" class="edge">
-<title>Node11&#45;&gt;Node11</title>
-<g id="a_edge15_Node000011_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M402.86,-257.07C400.26,-266.55 409.38,-274.75 430.25,-274.75 442.31,-274.75 450.45,-272.01 454.67,-267.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.96,-269.1 457.23,-258.53 451.21,-267.24 457.96,-269.1"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" target="_top" xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="white" stroke="#666666" points="336.38,-471.75 227.38,-471.75 227.38,-430 336.38,-430 336.38,-471.75"/>
-<text text-anchor="start" x="235.38" y="-458.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-447" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-435.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge18_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge18_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-450.88C197.22,-450.88 206.7,-450.88 216,-450.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.69,-454.38 225.69,-450.88 215.69,-447.38 215.69,-454.38"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" target="_top" xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="white" stroke="#666666" points="336.38,-531.75 227.38,-531.75 227.38,-490 336.38,-490 336.38,-531.75"/>
-<text text-anchor="start" x="235.38" y="-518.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-507" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-495.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node15 -->
-<g id="edge21_Node000012_Node000015" class="edge">
-<title>Node12&#45;&gt;Node15</title>
-<g id="a_edge21_Node000012_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.52,-472.2C196.87,-476.44 207.84,-480.94 218.5,-485.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.04,-488.49 227.62,-489.05 219.7,-482.02 217.04,-488.49"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node5 -->
-<g id="edge19_Node000013_Node000005" class="edge">
-<title>Node13&#45;&gt;Node5</title>
-<g id="a_edge19_Node000013_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-432.91C345.7,-429.84 355.28,-426.64 364.68,-423.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.78,-426.81 374.15,-420.32 363.55,-420.18 365.78,-426.81"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="459.62,-460.5 400.88,-460.5 400.88,-441.25 459.62,-441.25 459.62,-460.5"/>
-<text text-anchor="middle" x="430.25" y="-447" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge20_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge20_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-450.88C354.01,-450.88 373.08,-450.88 389.35,-450.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="389.13,-454.38 399.13,-450.88 389.13,-447.38 389.13,-454.38"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="484.75,-531.75 375.75,-531.75 375.75,-490 484.75,-490 484.75,-531.75"/>
-<text text-anchor="start" x="383.75" y="-518.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-507" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-495.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge22_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge22_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-510.88C345.6,-510.88 355.08,-510.88 364.37,-510.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.07,-514.38 374.07,-510.88 364.07,-507.38 364.07,-514.38"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge24_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge24_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.59,-165.52C166.43,-155.78 178.02,-143.96 188,-132.88 204.91,-114.1 203.2,-103.22 224,-88.88 226.09,-87.43 228.3,-86.1 230.58,-84.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.01,-88.05 239.58,-80.64 229.04,-81.71 232.01,-88.05"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" target="_top" xlink:title="Update the value at a node.">
-<polygon fill="white" stroke="#666666" points="336.38,-41.75 227.38,-41.75 227.38,0 336.38,0 336.38,-41.75"/>
-<text text-anchor="start" x="235.38" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::update</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge27_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge27_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-27.21C197.22,-26.59 206.7,-25.94 216,-25.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.96,-28.82 225.7,-24.64 215.48,-21.83 215.96,-28.82"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph_org.svg b/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph_org.svg
deleted file mode 100644
index 4efcf0881..000000000
--- a/d2/de9/heavy__light__decomposition_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph_org.svg
+++ /dev/null
@@ -1,467 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_1 Pages: 1 -->
-<svg width="493pt" height="586pt"
- viewBox="0.00 0.00 492.75 585.75" 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 581.75)">
-<title>test_1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="43,-266.5 0,-266.5 0,-247.25 43,-247.25 43,-266.5"/>
-<text text-anchor="middle" x="21.5" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" target="_top" xlink:title="Adds an undirected edge from node u to node v in the tree.">
-<polygon fill="white" stroke="#666666" points="188,-577.75 79,-577.75 79,-536 188,-536 188,-577.75"/>
-<text text-anchor="start" x="87" y="-564.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-553" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-541.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.17,-266.88C21.45,-303.74 23.17,-434.18 79,-518.88 81.13,-522.11 83.65,-525.16 86.4,-528.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.8,-530.38 93.55,-534.51 88.5,-525.19 83.8,-530.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="339.75,-569.5 224,-569.5 224,-550.25 339.75,-550.25 339.75,-569.5"/>
-<text text-anchor="middle" x="281.88" y="-556" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge16_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge16_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.06,-266.77C21.07,-300.92 22.35,-415.33 79,-480.88 81.85,-484.17 219.92,-539.35 224,-540.88 228.74,-542.64 233.72,-544.42 238.69,-546.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.42,-549.41 248.01,-549.32 239.68,-542.79 237.42,-549.41"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="188,-277.75 79,-277.75 79,-236 188,-236 188,-277.75"/>
-<text text-anchor="start" x="87" y="-264.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::init</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.45,-256.88C50.47,-256.88 58.71,-256.88 67.3,-256.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.2,-260.38 77.2,-256.88 67.2,-253.38 67.2,-260.38"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" target="_top" xlink:title="This function returns the sum of node values in the simple path from from node_1 to node_2.">
-<polygon fill="white" stroke="#666666" points="188,-471.75 79,-471.75 79,-430 188,-430 188,-471.75"/>
-<text text-anchor="start" x="87" y="-458.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-447" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-435.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge17_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge17_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.11,-266.76C43.95,-294.7 89.53,-375.1 114.91,-419.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.73,-421.34 119.7,-428.31 117.82,-417.88 111.73,-421.34"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" target="_top" xlink:title="Set the values for all the nodes.">
-<polygon fill="white" stroke="#666666" points="188,-207.75 79,-207.75 79,-166 188,-166 188,-207.75"/>
-<text text-anchor="start" x="87" y="-194.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-183" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::set_node_val</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge23_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge23_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.26,-246.85C51.72,-238.28 71.71,-225.56 89.83,-214.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.25,-217.27 97.81,-208.95 87.49,-211.37 91.25,-217.27"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.12,-79.5 238.62,-79.5 238.62,-60.25 325.12,-60.25 325.12,-79.5"/>
-<text text-anchor="middle" x="281.88" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node18 -->
-<g id="edge25_Node000001_Node000018" class="edge">
-<title>Node1&#45;&gt;Node18</title>
-<g id="a_edge25_Node000001_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.74,-247.05C32.63,-227.49 50.48,-183.31 79,-156.88 121.06,-117.89 183.3,-94.7 227.53,-82.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.18,-85.64 236.91,-79.63 226.34,-78.89 228.18,-85.64"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" target="_top" xlink:title="This function updates the value at node with val.">
-<polygon fill="white" stroke="#666666" points="188,-51.75 79,-51.75 79,-10 188,-10 188,-51.75"/>
-<text text-anchor="start" x="87" y="-38.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-27" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-15.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node19 -->
-<g id="edge26_Node000001_Node000019" class="edge">
-<title>Node1&#45;&gt;Node19</title>
-<g id="a_edge26_Node000001_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.2,-246.88C32.12,-221.97 51.92,-155.52 79,-104.88 87.12,-89.69 97.98,-74.06 107.8,-61.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.42,-63.44 113.78,-53.39 104.89,-59.15 110.42,-63.44"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-557.98C196.05,-558.14 204.25,-558.3 212.37,-558.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.18,-561.97 222.25,-558.67 212.32,-554.97 212.18,-561.97"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="484.75,-422.75 375.75,-422.75 375.75,-381 484.75,-381 484.75,-422.75"/>
-<text text-anchor="start" x="383.75" y="-409.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-398" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-386.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.84,-278.2C155.51,-307.43 182.62,-359.03 224,-382.88 266.18,-407.18 321.48,-411.02 364.06,-409.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.12,-412.78 373.91,-408.75 363.74,-405.79 364.12,-412.78"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" target="_top" xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="white" stroke="#666666" points="336.38,-355.75 227.38,-355.75 227.38,-314 336.38,-314 336.38,-355.75"/>
-<text text-anchor="start" x="235.38" y="-342.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-331" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-319.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.12,-278.2C189.66,-286.54 207.65,-296.18 224,-304.88 226.08,-305.98 228.2,-307.11 230.35,-308.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.65,-311.31 239.13,-312.9 231.93,-305.12 228.65,-311.31"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" target="_top" xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="white" stroke="#666666" points="336.38,-277.75 227.38,-277.75 227.38,-236 336.38,-236 336.38,-277.75"/>
-<text text-anchor="start" x="235.38" y="-264.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge7_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge7_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-256.88C197.22,-256.88 206.7,-256.88 216,-256.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.69,-260.38 225.69,-256.88 215.69,-253.38 215.69,-260.38"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" target="_top" xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="white" stroke="#666666" points="336.38,-139.75 227.38,-139.75 227.38,-98 336.38,-98 336.38,-139.75"/>
-<text text-anchor="start" x="235.38" y="-126.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge9_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge9_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M166.37,-235.54C173.84,-229.88 181.5,-223.49 188,-216.88 207.19,-197.34 205.4,-186.97 224,-166.88 230.17,-160.21 237.24,-153.58 244.26,-147.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.5,-150.17 251.88,-141.04 241.98,-144.82 246.5,-150.17"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="336.38,-217.75 227.38,-217.75 227.38,-176 336.38,-176 336.38,-217.75"/>
-<text text-anchor="start" x="235.38" y="-204.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-193" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-181.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge11_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge11_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.52,-235.55C196.87,-231.31 207.84,-226.81 218.5,-222.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.7,-225.73 227.62,-218.7 217.04,-219.26 219.7,-225.73"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.49,-356.07C251.88,-365.55 261.01,-373.75 281.88,-373.75 293.94,-373.75 302.08,-371.01 306.29,-366.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.59,-368.1 308.86,-357.53 302.84,-366.24 309.59,-368.1"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge8_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge8_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.49,-278.07C251.88,-287.55 261.01,-295.75 281.88,-295.75 293.94,-295.75 302.08,-293.01 306.29,-288.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.59,-290.1 308.86,-279.53 302.84,-288.24 309.59,-290.1"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge10_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge10_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.49,-140.07C251.88,-149.55 261.01,-157.75 281.88,-157.75 293.94,-157.75 302.08,-155.01 306.29,-150.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.59,-152.1 308.86,-141.53 302.84,-150.24 309.59,-152.1"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="484.75,-178.75 375.75,-178.75 375.75,-137 484.75,-137 484.75,-178.75"/>
-<text text-anchor="start" x="383.75" y="-165.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-154" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-142.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge12_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge12_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-182.57C345.7,-180.14 355.28,-177.58 364.68,-175.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.36,-178.52 374.12,-172.56 363.56,-171.76 365.36,-178.52"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="484.75,-256.75 375.75,-256.75 375.75,-215 484.75,-215 484.75,-256.75"/>
-<text text-anchor="start" x="383.75" y="-243.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-232" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge14_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge14_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-211.18C345.7,-213.61 355.28,-216.17 364.68,-218.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="363.56,-221.99 374.12,-221.19 365.36,-215.23 363.56,-221.99"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node10 -->
-<g id="edge13_Node000010_Node000010" class="edge">
-<title>Node10&#45;&gt;Node10</title>
-<g id="a_edge13_Node000010_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M402.86,-179.07C400.26,-188.55 409.38,-196.75 430.25,-196.75 442.31,-196.75 450.45,-194.01 454.67,-189.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.96,-191.1 457.23,-180.53 451.21,-189.24 457.96,-191.1"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node11 -->
-<g id="edge15_Node000011_Node000011" class="edge">
-<title>Node11&#45;&gt;Node11</title>
-<g id="a_edge15_Node000011_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M402.86,-257.07C400.26,-266.55 409.38,-274.75 430.25,-274.75 442.31,-274.75 450.45,-272.01 454.67,-267.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.96,-269.1 457.23,-258.53 451.21,-267.24 457.96,-269.1"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" target="_top" xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="white" stroke="#666666" points="336.38,-471.75 227.38,-471.75 227.38,-430 336.38,-430 336.38,-471.75"/>
-<text text-anchor="start" x="235.38" y="-458.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-447" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-435.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge18_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge18_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-450.88C197.22,-450.88 206.7,-450.88 216,-450.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.69,-454.38 225.69,-450.88 215.69,-447.38 215.69,-454.38"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" target="_top" xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="white" stroke="#666666" points="336.38,-531.75 227.38,-531.75 227.38,-490 336.38,-490 336.38,-531.75"/>
-<text text-anchor="start" x="235.38" y="-518.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-507" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-495.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node15 -->
-<g id="edge21_Node000012_Node000015" class="edge">
-<title>Node12&#45;&gt;Node15</title>
-<g id="a_edge21_Node000012_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.52,-472.2C196.87,-476.44 207.84,-480.94 218.5,-485.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.04,-488.49 227.62,-489.05 219.7,-482.02 217.04,-488.49"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node5 -->
-<g id="edge19_Node000013_Node000005" class="edge">
-<title>Node13&#45;&gt;Node5</title>
-<g id="a_edge19_Node000013_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-432.91C345.7,-429.84 355.28,-426.64 364.68,-423.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.78,-426.81 374.15,-420.32 363.55,-420.18 365.78,-426.81"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="459.62,-460.5 400.88,-460.5 400.88,-441.25 459.62,-441.25 459.62,-460.5"/>
-<text text-anchor="middle" x="430.25" y="-447" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge20_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge20_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-450.88C354.01,-450.88 373.08,-450.88 389.35,-450.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="389.13,-454.38 399.13,-450.88 389.13,-447.38 389.13,-454.38"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="484.75,-531.75 375.75,-531.75 375.75,-490 484.75,-490 484.75,-531.75"/>
-<text text-anchor="start" x="383.75" y="-518.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-507" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-495.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge22_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge22_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-510.88C345.6,-510.88 355.08,-510.88 364.37,-510.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.07,-514.38 374.07,-510.88 364.07,-507.38 364.07,-514.38"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge24_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge24_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.59,-165.52C166.43,-155.78 178.02,-143.96 188,-132.88 204.91,-114.1 203.2,-103.22 224,-88.88 226.09,-87.43 228.3,-86.1 230.58,-84.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.01,-88.05 239.58,-80.64 229.04,-81.71 232.01,-88.05"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" target="_top" xlink:title="Update the value at a node.">
-<polygon fill="white" stroke="#666666" points="336.38,-41.75 227.38,-41.75 227.38,0 336.38,0 336.38,-41.75"/>
-<text text-anchor="start" x="235.38" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::update</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge27_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge27_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-27.21C197.22,-26.59 206.7,-25.94 216,-25.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.96,-28.82 225.7,-24.64 215.48,-21.83 215.96,-28.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.map b/d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.map
deleted file mode 100644
index 18f55b03a..000000000
--- a/d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.map
+++ /dev/null
@@ -1,49 +0,0 @@
-<map id="test_2" name="test_2">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,420,63,446"/>
-<area shape="rect" id="Node000002" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" title="Adds an undirected edge from node u to node v in the tree." alt="" coords="111,5,256,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="32,420,33,362,42,275,51,226,65,176,84,128,108,82,118,70,123,73,113,85,88,130,70,178,56,227,47,276,39,363,38,420"/>
-<area shape="rect" id="Node000003" 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="304,16,458,42"/>
-<area shape="poly" id="edge16_Node000001_Node000003" title=" " alt="" coords="32,420,33,368,41,292,51,251,64,209,83,169,109,132,303,52,323,45,324,50,305,57,112,137,88,171,69,211,56,252,47,293,38,369,37,420"/>
-<area shape="rect" id="Node000004" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" title="This function must be called after the tree adjacency list and node values are populated The function..." alt="" coords="111,405,256,461"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="63,430,95,430,95,436,63,436"/>
-<area shape="rect" id="Node000012" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" title="This function returns the sum of node values in the simple path from from node_1 to node_2." alt="" coords="111,147,256,202"/>
-<area shape="poly" id="edge17_Node000001_Node000012" title=" " alt="" coords="40,419,156,215,161,217,45,421"/>
-<area shape="rect" id="Node000017" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" title="Set the values for all the nodes." alt="" coords="111,499,256,554"/>
-<area shape="poly" id="edge23_Node000001_Node000017" title=" " alt="" coords="58,444,127,488,124,493,55,449"/>
-<area shape="rect" id="Node000018" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="324,670,439,695"/>
-<area shape="poly" id="edge25_Node000001_Node000018" title=" " alt="" coords="42,445,67,502,87,535,112,565,158,599,210,627,262,648,310,664,308,669,260,653,207,632,156,604,109,568,83,538,62,504,37,447"/>
-<area shape="rect" id="Node000019" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" title="This function updates the value at node with val." alt="" coords="111,707,256,762"/>
-<area shape="poly" id="edge26_Node000001_Node000019" title=" " alt="" coords="41,446,67,527,88,581,113,635,151,693,147,696,108,637,83,583,62,529,36,447"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="256,29,288,28,289,34,256,34"/>
-<area shape="rect" id="Node000005" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" title="Function that specifies the type of operation involved when segments are combined." alt="" coords="506,212,652,268"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="193,404,210,370,233,331,264,293,303,263,348,243,397,232,445,227,491,227,491,233,446,233,398,237,350,248,305,267,268,297,238,334,214,372,198,406"/>
-<area shape="rect" id="Node000006" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)" alt="" coords="308,301,454,357"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="236,402,303,367,311,362,314,367,305,372,239,407"/>
-<area shape="rect" id="Node000007" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" title="Utility function to lable the nodes so that heavy chains have a contigous lable." alt="" coords="308,405,454,461"/>
-<area shape="poly" id="edge7_Node000004_Node000007" title=" " alt="" coords="256,430,293,430,293,436,256,436"/>
-<area shape="rect" id="Node000008" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" title="Utility function to assign highest parent that can be reached though heavy chains." alt="" coords="308,589,454,645"/>
-<area shape="poly" id="edge9_Node000004_Node000008" title=" " alt="" coords="229,460,258,485,282,518,306,551,333,577,329,581,302,555,278,521,254,488,225,464"/>
-<area shape="rect" id="Node000009" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" title="This function must be called after the tree adjacency list and node values are populated The function..." alt="" coords="308,485,454,541"/>
-<area shape="poly" id="edge11_Node000004_Node000009" title=" " alt="" coords="255,459,298,477,296,482,253,464"/>
-<area shape="poly" id="edge6_Node000006_Node000006" title=" " alt="" coords="342,301,342,291,350,282,363,277,381,275,402,277,415,284,412,289,401,282,381,280,364,282,353,287,347,293,347,301"/>
-<area shape="poly" id="edge8_Node000007_Node000007" title=" " alt="" coords="342,405,342,395,350,386,363,381,381,379,402,381,415,388,412,393,401,386,381,384,364,386,353,391,347,397,347,405"/>
-<area shape="poly" id="edge10_Node000008_Node000008" title=" " alt="" coords="342,589,342,579,350,570,363,565,381,563,402,565,415,572,412,577,401,570,381,568,364,570,353,575,347,581,347,589"/>
-<area shape="rect" id="Node000010" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" title="Utility function to populate the t_par vector." alt="" coords="506,537,652,593"/>
-<area shape="poly" id="edge12_Node000009_Node000010" title=" " alt="" coords="455,530,492,540,491,545,453,535"/>
-<area shape="rect" id="Node000011" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" title="Utility function to compute sub&#45;tree sizes." alt="" coords="506,433,652,489"/>
-<area shape="poly" id="edge14_Node000009_Node000011" title=" " alt="" coords="453,492,491,482,492,487,455,497"/>
-<area shape="poly" id="edge13_Node000010_Node000010" title=" " alt="" coords="540,537,540,527,547,518,560,513,579,511,600,513,613,520,610,525,598,518,579,516,562,518,551,523,545,529,545,537"/>
-<area shape="poly" id="edge15_Node000011_Node000011" title=" " alt="" coords="540,433,540,423,547,414,560,409,579,407,600,409,613,416,610,421,598,414,579,412,562,414,551,419,545,425,545,433"/>
-<area shape="rect" id="Node000013" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" title="Utility function to break down a path query into two chain queries." alt="" coords="308,147,454,202"/>
-<area shape="poly" id="edge18_Node000012_Node000013" title=" " alt="" coords="256,172,293,172,293,177,256,177"/>
-<area shape="rect" id="Node000015" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" title="The function returns the least common ancestor of two nodes." alt="" coords="308,67,454,122"/>
-<area shape="poly" id="edge21_Node000012_Node000015" title=" " alt="" coords="253,144,296,126,298,131,255,149"/>
-<area shape="poly" id="edge19_Node000013_Node000005" title=" " alt="" coords="455,196,492,208,491,214,453,201"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="540,162,618,187"/>
-<area shape="poly" id="edge20_Node000013_Node000014" title=" " alt="" coords="454,172,524,172,524,177,454,177"/>
-<area shape="rect" id="Node000016" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store..." alt="" coords="506,67,652,122"/>
-<area shape="poly" id="edge22_Node000015_Node000016" title=" " alt="" coords="454,92,491,92,491,97,454,97"/>
-<area shape="poly" id="edge24_Node000017_Node000018" title=" " alt="" coords="216,553,258,597,280,628,290,642,306,655,314,660,311,665,302,659,286,645,276,632,254,600,212,557"/>
-<area shape="rect" id="Node000020" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" title="Update the value at a node." alt="" coords="308,720,454,776"/>
-<area shape="poly" id="edge27_Node000019_Node000020" title=" " alt="" coords="256,737,294,739,293,745,256,742"/>
-</map>
diff --git a/d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.md5 b/d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.md5
deleted file mode 100644
index 8a9e76d39..000000000
--- a/d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8ecad942a5bceec4383a81337820d2ec
\ No newline at end of file
diff --git a/d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg b/d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg
deleted file mode 100644
index d4be2b5ae..000000000
--- a/d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg
+++ /dev/null
@@ -1,550 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_2 Pages: 1 -->
-<!--zoomable 586 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 493;
-var viewHeight = 586;
-var sectionId = 'dynsection-3';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test_2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="43,-266.5 0,-266.5 0,-247.25 43,-247.25 43,-266.5"/>
-<text text-anchor="middle" x="21.5" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" target="_top" xlink:title="Adds an undirected edge from node u to node v in the tree.">
-<polygon fill="white" stroke="#666666" points="188,-577.75 79,-577.75 79,-536 188,-536 188,-577.75"/>
-<text text-anchor="start" x="87" y="-564.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-553" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-541.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.17,-266.88C21.45,-303.74 23.17,-434.18 79,-518.88 81.13,-522.11 83.65,-525.16 86.4,-528.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.8,-530.38 93.55,-534.51 88.5,-525.19 83.8,-530.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="339.75,-569.5 224,-569.5 224,-550.25 339.75,-550.25 339.75,-569.5"/>
-<text text-anchor="middle" x="281.88" y="-556" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge16_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge16_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.06,-266.77C21.07,-300.92 22.35,-415.33 79,-480.88 81.85,-484.17 219.92,-539.35 224,-540.88 228.74,-542.64 233.72,-544.42 238.69,-546.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.42,-549.41 248.01,-549.32 239.68,-542.79 237.42,-549.41"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="188,-277.75 79,-277.75 79,-236 188,-236 188,-277.75"/>
-<text text-anchor="start" x="87" y="-264.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::init</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.45,-256.88C50.47,-256.88 58.71,-256.88 67.3,-256.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.2,-260.38 77.2,-256.88 67.2,-253.38 67.2,-260.38"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" target="_top" xlink:title="This function returns the sum of node values in the simple path from from node_1 to node_2.">
-<polygon fill="white" stroke="#666666" points="188,-471.75 79,-471.75 79,-430 188,-430 188,-471.75"/>
-<text text-anchor="start" x="87" y="-458.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-447" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-435.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge17_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge17_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.11,-266.76C43.95,-294.7 89.53,-375.1 114.91,-419.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.73,-421.34 119.7,-428.31 117.82,-417.88 111.73,-421.34"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" target="_top" xlink:title="Set the values for all the nodes.">
-<polygon fill="white" stroke="#666666" points="188,-207.75 79,-207.75 79,-166 188,-166 188,-207.75"/>
-<text text-anchor="start" x="87" y="-194.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-183" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::set_node_val</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge23_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge23_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.26,-246.85C51.72,-238.28 71.71,-225.56 89.83,-214.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.25,-217.27 97.81,-208.95 87.49,-211.37 91.25,-217.27"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.12,-79.5 238.62,-79.5 238.62,-60.25 325.12,-60.25 325.12,-79.5"/>
-<text text-anchor="middle" x="281.88" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node18 -->
-<g id="edge25_Node000001_Node000018" class="edge">
-<title>Node1&#45;&gt;Node18</title>
-<g id="a_edge25_Node000001_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.74,-247.05C32.63,-227.49 50.48,-183.31 79,-156.88 121.06,-117.89 183.3,-94.7 227.53,-82.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.18,-85.64 236.91,-79.63 226.34,-78.89 228.18,-85.64"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" target="_top" xlink:title="This function updates the value at node with val.">
-<polygon fill="white" stroke="#666666" points="188,-51.75 79,-51.75 79,-10 188,-10 188,-51.75"/>
-<text text-anchor="start" x="87" y="-38.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-27" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-15.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node19 -->
-<g id="edge26_Node000001_Node000019" class="edge">
-<title>Node1&#45;&gt;Node19</title>
-<g id="a_edge26_Node000001_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.2,-246.88C32.12,-221.97 51.92,-155.52 79,-104.88 87.12,-89.69 97.98,-74.06 107.8,-61.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.42,-63.44 113.78,-53.39 104.89,-59.15 110.42,-63.44"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-557.98C196.05,-558.14 204.25,-558.3 212.37,-558.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.18,-561.97 222.25,-558.67 212.32,-554.97 212.18,-561.97"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="484.75,-422.75 375.75,-422.75 375.75,-381 484.75,-381 484.75,-422.75"/>
-<text text-anchor="start" x="383.75" y="-409.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-398" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-386.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.84,-278.2C155.51,-307.43 182.62,-359.03 224,-382.88 266.18,-407.18 321.48,-411.02 364.06,-409.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.12,-412.78 373.91,-408.75 363.74,-405.79 364.12,-412.78"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" target="_top" xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="white" stroke="#666666" points="336.38,-355.75 227.38,-355.75 227.38,-314 336.38,-314 336.38,-355.75"/>
-<text text-anchor="start" x="235.38" y="-342.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-331" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-319.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.12,-278.2C189.66,-286.54 207.65,-296.18 224,-304.88 226.08,-305.98 228.2,-307.11 230.35,-308.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.65,-311.31 239.13,-312.9 231.93,-305.12 228.65,-311.31"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" target="_top" xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="white" stroke="#666666" points="336.38,-277.75 227.38,-277.75 227.38,-236 336.38,-236 336.38,-277.75"/>
-<text text-anchor="start" x="235.38" y="-264.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge7_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge7_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-256.88C197.22,-256.88 206.7,-256.88 216,-256.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.69,-260.38 225.69,-256.88 215.69,-253.38 215.69,-260.38"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" target="_top" xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="white" stroke="#666666" points="336.38,-139.75 227.38,-139.75 227.38,-98 336.38,-98 336.38,-139.75"/>
-<text text-anchor="start" x="235.38" y="-126.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge9_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge9_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M166.37,-235.54C173.84,-229.88 181.5,-223.49 188,-216.88 207.19,-197.34 205.4,-186.97 224,-166.88 230.17,-160.21 237.24,-153.58 244.26,-147.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.5,-150.17 251.88,-141.04 241.98,-144.82 246.5,-150.17"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="336.38,-217.75 227.38,-217.75 227.38,-176 336.38,-176 336.38,-217.75"/>
-<text text-anchor="start" x="235.38" y="-204.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-193" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-181.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge11_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge11_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.52,-235.55C196.87,-231.31 207.84,-226.81 218.5,-222.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.7,-225.73 227.62,-218.7 217.04,-219.26 219.7,-225.73"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.49,-356.07C251.88,-365.55 261.01,-373.75 281.88,-373.75 293.94,-373.75 302.08,-371.01 306.29,-366.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.59,-368.1 308.86,-357.53 302.84,-366.24 309.59,-368.1"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge8_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge8_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.49,-278.07C251.88,-287.55 261.01,-295.75 281.88,-295.75 293.94,-295.75 302.08,-293.01 306.29,-288.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.59,-290.1 308.86,-279.53 302.84,-288.24 309.59,-290.1"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge10_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge10_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.49,-140.07C251.88,-149.55 261.01,-157.75 281.88,-157.75 293.94,-157.75 302.08,-155.01 306.29,-150.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.59,-152.1 308.86,-141.53 302.84,-150.24 309.59,-152.1"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="484.75,-178.75 375.75,-178.75 375.75,-137 484.75,-137 484.75,-178.75"/>
-<text text-anchor="start" x="383.75" y="-165.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-154" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-142.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge12_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge12_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-182.57C345.7,-180.14 355.28,-177.58 364.68,-175.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.36,-178.52 374.12,-172.56 363.56,-171.76 365.36,-178.52"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="484.75,-256.75 375.75,-256.75 375.75,-215 484.75,-215 484.75,-256.75"/>
-<text text-anchor="start" x="383.75" y="-243.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-232" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge14_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge14_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-211.18C345.7,-213.61 355.28,-216.17 364.68,-218.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="363.56,-221.99 374.12,-221.19 365.36,-215.23 363.56,-221.99"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node10 -->
-<g id="edge13_Node000010_Node000010" class="edge">
-<title>Node10&#45;&gt;Node10</title>
-<g id="a_edge13_Node000010_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M402.86,-179.07C400.26,-188.55 409.38,-196.75 430.25,-196.75 442.31,-196.75 450.45,-194.01 454.67,-189.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.96,-191.1 457.23,-180.53 451.21,-189.24 457.96,-191.1"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node11 -->
-<g id="edge15_Node000011_Node000011" class="edge">
-<title>Node11&#45;&gt;Node11</title>
-<g id="a_edge15_Node000011_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M402.86,-257.07C400.26,-266.55 409.38,-274.75 430.25,-274.75 442.31,-274.75 450.45,-272.01 454.67,-267.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.96,-269.1 457.23,-258.53 451.21,-267.24 457.96,-269.1"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" target="_top" xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="white" stroke="#666666" points="336.38,-471.75 227.38,-471.75 227.38,-430 336.38,-430 336.38,-471.75"/>
-<text text-anchor="start" x="235.38" y="-458.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-447" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-435.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge18_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge18_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-450.88C197.22,-450.88 206.7,-450.88 216,-450.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.69,-454.38 225.69,-450.88 215.69,-447.38 215.69,-454.38"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" target="_top" xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="white" stroke="#666666" points="336.38,-531.75 227.38,-531.75 227.38,-490 336.38,-490 336.38,-531.75"/>
-<text text-anchor="start" x="235.38" y="-518.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-507" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-495.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node15 -->
-<g id="edge21_Node000012_Node000015" class="edge">
-<title>Node12&#45;&gt;Node15</title>
-<g id="a_edge21_Node000012_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.52,-472.2C196.87,-476.44 207.84,-480.94 218.5,-485.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.04,-488.49 227.62,-489.05 219.7,-482.02 217.04,-488.49"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node5 -->
-<g id="edge19_Node000013_Node000005" class="edge">
-<title>Node13&#45;&gt;Node5</title>
-<g id="a_edge19_Node000013_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-432.91C345.7,-429.84 355.28,-426.64 364.68,-423.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.78,-426.81 374.15,-420.32 363.55,-420.18 365.78,-426.81"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="459.62,-460.5 400.88,-460.5 400.88,-441.25 459.62,-441.25 459.62,-460.5"/>
-<text text-anchor="middle" x="430.25" y="-447" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge20_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge20_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-450.88C354.01,-450.88 373.08,-450.88 389.35,-450.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="389.13,-454.38 399.13,-450.88 389.13,-447.38 389.13,-454.38"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="484.75,-531.75 375.75,-531.75 375.75,-490 484.75,-490 484.75,-531.75"/>
-<text text-anchor="start" x="383.75" y="-518.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-507" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-495.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge22_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge22_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-510.88C345.6,-510.88 355.08,-510.88 364.37,-510.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.07,-514.38 374.07,-510.88 364.07,-507.38 364.07,-514.38"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge24_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge24_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.59,-165.52C166.43,-155.78 178.02,-143.96 188,-132.88 204.91,-114.1 203.2,-103.22 224,-88.88 226.09,-87.43 228.3,-86.1 230.58,-84.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.01,-88.05 239.58,-80.64 229.04,-81.71 232.01,-88.05"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" target="_top" xlink:title="Update the value at a node.">
-<polygon fill="white" stroke="#666666" points="336.38,-41.75 227.38,-41.75 227.38,0 336.38,0 336.38,-41.75"/>
-<text text-anchor="start" x="235.38" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::update</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge27_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge27_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-27.21C197.22,-26.59 206.7,-25.94 216,-25.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.96,-28.82 225.7,-24.64 215.48,-21.83 215.96,-28.82"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph_org.svg b/d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph_org.svg
deleted file mode 100644
index ce2c6eac2..000000000
--- a/d2/de9/heavy__light__decomposition_8cpp_a458410412185a5f09199deaff7157a8d_cgraph_org.svg
+++ /dev/null
@@ -1,467 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_2 Pages: 1 -->
-<svg width="493pt" height="586pt"
- viewBox="0.00 0.00 492.75 585.75" 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 581.75)">
-<title>test_2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="43,-266.5 0,-266.5 0,-247.25 43,-247.25 43,-266.5"/>
-<text text-anchor="middle" x="21.5" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" target="_top" xlink:title="Adds an undirected edge from node u to node v in the tree.">
-<polygon fill="white" stroke="#666666" points="188,-577.75 79,-577.75 79,-536 188,-536 188,-577.75"/>
-<text text-anchor="start" x="87" y="-564.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-553" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-541.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.17,-266.88C21.45,-303.74 23.17,-434.18 79,-518.88 81.13,-522.11 83.65,-525.16 86.4,-528.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.8,-530.38 93.55,-534.51 88.5,-525.19 83.8,-530.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="339.75,-569.5 224,-569.5 224,-550.25 339.75,-550.25 339.75,-569.5"/>
-<text text-anchor="middle" x="281.88" y="-556" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge16_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge16_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.06,-266.77C21.07,-300.92 22.35,-415.33 79,-480.88 81.85,-484.17 219.92,-539.35 224,-540.88 228.74,-542.64 233.72,-544.42 238.69,-546.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.42,-549.41 248.01,-549.32 239.68,-542.79 237.42,-549.41"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="188,-277.75 79,-277.75 79,-236 188,-236 188,-277.75"/>
-<text text-anchor="start" x="87" y="-264.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::init</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.45,-256.88C50.47,-256.88 58.71,-256.88 67.3,-256.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.2,-260.38 77.2,-256.88 67.2,-253.38 67.2,-260.38"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" target="_top" xlink:title="This function returns the sum of node values in the simple path from from node_1 to node_2.">
-<polygon fill="white" stroke="#666666" points="188,-471.75 79,-471.75 79,-430 188,-430 188,-471.75"/>
-<text text-anchor="start" x="87" y="-458.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-447" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-435.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge17_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge17_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.11,-266.76C43.95,-294.7 89.53,-375.1 114.91,-419.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.73,-421.34 119.7,-428.31 117.82,-417.88 111.73,-421.34"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" target="_top" xlink:title="Set the values for all the nodes.">
-<polygon fill="white" stroke="#666666" points="188,-207.75 79,-207.75 79,-166 188,-166 188,-207.75"/>
-<text text-anchor="start" x="87" y="-194.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-183" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::set_node_val</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge23_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge23_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.26,-246.85C51.72,-238.28 71.71,-225.56 89.83,-214.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.25,-217.27 97.81,-208.95 87.49,-211.37 91.25,-217.27"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.12,-79.5 238.62,-79.5 238.62,-60.25 325.12,-60.25 325.12,-79.5"/>
-<text text-anchor="middle" x="281.88" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node18 -->
-<g id="edge25_Node000001_Node000018" class="edge">
-<title>Node1&#45;&gt;Node18</title>
-<g id="a_edge25_Node000001_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.74,-247.05C32.63,-227.49 50.48,-183.31 79,-156.88 121.06,-117.89 183.3,-94.7 227.53,-82.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.18,-85.64 236.91,-79.63 226.34,-78.89 228.18,-85.64"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" target="_top" xlink:title="This function updates the value at node with val.">
-<polygon fill="white" stroke="#666666" points="188,-51.75 79,-51.75 79,-10 188,-10 188,-51.75"/>
-<text text-anchor="start" x="87" y="-38.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-27" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-15.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node19 -->
-<g id="edge26_Node000001_Node000019" class="edge">
-<title>Node1&#45;&gt;Node19</title>
-<g id="a_edge26_Node000001_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.2,-246.88C32.12,-221.97 51.92,-155.52 79,-104.88 87.12,-89.69 97.98,-74.06 107.8,-61.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.42,-63.44 113.78,-53.39 104.89,-59.15 110.42,-63.44"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-557.98C196.05,-558.14 204.25,-558.3 212.37,-558.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.18,-561.97 222.25,-558.67 212.32,-554.97 212.18,-561.97"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="484.75,-422.75 375.75,-422.75 375.75,-381 484.75,-381 484.75,-422.75"/>
-<text text-anchor="start" x="383.75" y="-409.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-398" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-386.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.84,-278.2C155.51,-307.43 182.62,-359.03 224,-382.88 266.18,-407.18 321.48,-411.02 364.06,-409.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.12,-412.78 373.91,-408.75 363.74,-405.79 364.12,-412.78"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" target="_top" xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="white" stroke="#666666" points="336.38,-355.75 227.38,-355.75 227.38,-314 336.38,-314 336.38,-355.75"/>
-<text text-anchor="start" x="235.38" y="-342.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-331" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-319.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.12,-278.2C189.66,-286.54 207.65,-296.18 224,-304.88 226.08,-305.98 228.2,-307.11 230.35,-308.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.65,-311.31 239.13,-312.9 231.93,-305.12 228.65,-311.31"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" target="_top" xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="white" stroke="#666666" points="336.38,-277.75 227.38,-277.75 227.38,-236 336.38,-236 336.38,-277.75"/>
-<text text-anchor="start" x="235.38" y="-264.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge7_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge7_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-256.88C197.22,-256.88 206.7,-256.88 216,-256.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.69,-260.38 225.69,-256.88 215.69,-253.38 215.69,-260.38"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" target="_top" xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="white" stroke="#666666" points="336.38,-139.75 227.38,-139.75 227.38,-98 336.38,-98 336.38,-139.75"/>
-<text text-anchor="start" x="235.38" y="-126.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge9_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge9_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M166.37,-235.54C173.84,-229.88 181.5,-223.49 188,-216.88 207.19,-197.34 205.4,-186.97 224,-166.88 230.17,-160.21 237.24,-153.58 244.26,-147.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.5,-150.17 251.88,-141.04 241.98,-144.82 246.5,-150.17"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="336.38,-217.75 227.38,-217.75 227.38,-176 336.38,-176 336.38,-217.75"/>
-<text text-anchor="start" x="235.38" y="-204.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-193" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-181.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge11_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge11_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.52,-235.55C196.87,-231.31 207.84,-226.81 218.5,-222.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.7,-225.73 227.62,-218.7 217.04,-219.26 219.7,-225.73"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.49,-356.07C251.88,-365.55 261.01,-373.75 281.88,-373.75 293.94,-373.75 302.08,-371.01 306.29,-366.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.59,-368.1 308.86,-357.53 302.84,-366.24 309.59,-368.1"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge8_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge8_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.49,-278.07C251.88,-287.55 261.01,-295.75 281.88,-295.75 293.94,-295.75 302.08,-293.01 306.29,-288.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.59,-290.1 308.86,-279.53 302.84,-288.24 309.59,-290.1"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge10_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge10_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.49,-140.07C251.88,-149.55 261.01,-157.75 281.88,-157.75 293.94,-157.75 302.08,-155.01 306.29,-150.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.59,-152.1 308.86,-141.53 302.84,-150.24 309.59,-152.1"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="484.75,-178.75 375.75,-178.75 375.75,-137 484.75,-137 484.75,-178.75"/>
-<text text-anchor="start" x="383.75" y="-165.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-154" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-142.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge12_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge12_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-182.57C345.7,-180.14 355.28,-177.58 364.68,-175.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.36,-178.52 374.12,-172.56 363.56,-171.76 365.36,-178.52"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="484.75,-256.75 375.75,-256.75 375.75,-215 484.75,-215 484.75,-256.75"/>
-<text text-anchor="start" x="383.75" y="-243.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-232" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge14_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge14_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-211.18C345.7,-213.61 355.28,-216.17 364.68,-218.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="363.56,-221.99 374.12,-221.19 365.36,-215.23 363.56,-221.99"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node10 -->
-<g id="edge13_Node000010_Node000010" class="edge">
-<title>Node10&#45;&gt;Node10</title>
-<g id="a_edge13_Node000010_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M402.86,-179.07C400.26,-188.55 409.38,-196.75 430.25,-196.75 442.31,-196.75 450.45,-194.01 454.67,-189.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.96,-191.1 457.23,-180.53 451.21,-189.24 457.96,-191.1"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node11 -->
-<g id="edge15_Node000011_Node000011" class="edge">
-<title>Node11&#45;&gt;Node11</title>
-<g id="a_edge15_Node000011_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M402.86,-257.07C400.26,-266.55 409.38,-274.75 430.25,-274.75 442.31,-274.75 450.45,-272.01 454.67,-267.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.96,-269.1 457.23,-258.53 451.21,-267.24 457.96,-269.1"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" target="_top" xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="white" stroke="#666666" points="336.38,-471.75 227.38,-471.75 227.38,-430 336.38,-430 336.38,-471.75"/>
-<text text-anchor="start" x="235.38" y="-458.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-447" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-435.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge18_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge18_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-450.88C197.22,-450.88 206.7,-450.88 216,-450.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.69,-454.38 225.69,-450.88 215.69,-447.38 215.69,-454.38"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" target="_top" xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="white" stroke="#666666" points="336.38,-531.75 227.38,-531.75 227.38,-490 336.38,-490 336.38,-531.75"/>
-<text text-anchor="start" x="235.38" y="-518.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-507" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-495.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node15 -->
-<g id="edge21_Node000012_Node000015" class="edge">
-<title>Node12&#45;&gt;Node15</title>
-<g id="a_edge21_Node000012_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.52,-472.2C196.87,-476.44 207.84,-480.94 218.5,-485.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.04,-488.49 227.62,-489.05 219.7,-482.02 217.04,-488.49"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node5 -->
-<g id="edge19_Node000013_Node000005" class="edge">
-<title>Node13&#45;&gt;Node5</title>
-<g id="a_edge19_Node000013_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-432.91C345.7,-429.84 355.28,-426.64 364.68,-423.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.78,-426.81 374.15,-420.32 363.55,-420.18 365.78,-426.81"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="459.62,-460.5 400.88,-460.5 400.88,-441.25 459.62,-441.25 459.62,-460.5"/>
-<text text-anchor="middle" x="430.25" y="-447" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge20_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge20_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-450.88C354.01,-450.88 373.08,-450.88 389.35,-450.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="389.13,-454.38 399.13,-450.88 389.13,-447.38 389.13,-454.38"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="484.75,-531.75 375.75,-531.75 375.75,-490 484.75,-490 484.75,-531.75"/>
-<text text-anchor="start" x="383.75" y="-518.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-507" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-495.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge22_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge22_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-510.88C345.6,-510.88 355.08,-510.88 364.37,-510.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.07,-514.38 374.07,-510.88 364.07,-507.38 364.07,-514.38"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge24_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge24_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.59,-165.52C166.43,-155.78 178.02,-143.96 188,-132.88 204.91,-114.1 203.2,-103.22 224,-88.88 226.09,-87.43 228.3,-86.1 230.58,-84.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.01,-88.05 239.58,-80.64 229.04,-81.71 232.01,-88.05"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" target="_top" xlink:title="Update the value at a node.">
-<polygon fill="white" stroke="#666666" points="336.38,-41.75 227.38,-41.75 227.38,0 336.38,0 336.38,-41.75"/>
-<text text-anchor="start" x="235.38" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::update</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge27_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge27_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-27.21C197.22,-26.59 206.7,-25.94 216,-25.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.96,-28.82 225.7,-24.64 215.48,-21.83 215.96,-28.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 376cc5d81..000000000
--- a/d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,69 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,300,55,326"/>
-<area shape="rect" id="Node000002" href="$d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" title=" " alt="" coords="103,300,160,326"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,311,87,311,87,316,55,316"/>
-<area shape="rect" id="Node000022" href="$d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d" title=" " alt="" coords="103,243,160,269"/>
-<area shape="poly" id="edge29_Node000001_Node000022" title=" " alt="" coords="53,298,92,275,95,279,56,302"/>
-<area shape="rect" id="Node000023" href="$d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a" title=" " alt="" coords="103,398,160,423"/>
-<area shape="poly" id="edge37_Node000001_Node000023" title=" " alt="" coords="47,324,108,385,105,389,43,328"/>
-<area shape="rect" id="Node000003" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" title="Adds an undirected edge from node u to node v in the tree." alt="" coords="208,351,353,406"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="162,323,203,342,201,347,160,328"/>
-<area shape="rect" id="Node000004" 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="401,306,556,331"/>
-<area shape="poly" id="edge17_Node000002_Node000004" title=" " alt="" coords="160,311,386,314,386,320,160,316"/>
-<area shape="rect" id="Node000005" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" title="This function must be called after the tree adjacency list and node values are populated The function..." alt="" coords="208,612,353,668"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="141,325,163,384,175,431,183,468,192,504,210,548,245,599,241,602,206,550,187,506,177,469,170,432,157,386,136,327"/>
-<area shape="rect" id="Node000013" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" title="This function returns the sum of node values in the simple path from from node_1 to node_2." alt="" coords="208,481,353,537"/>
-<area shape="poly" id="edge18_Node000002_Node000013" title=" " alt="" coords="144,325,210,417,249,467,245,471,206,420,140,328"/>
-<area shape="rect" id="Node000018" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" title="Set the values for all the nodes." alt="" coords="208,220,353,276"/>
-<area shape="poly" id="edge24_Node000002_Node000018" title=" " alt="" coords="160,298,201,280,203,285,162,303"/>
-<area shape="rect" id="Node000019" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="421,202,536,227"/>
-<area shape="poly" id="edge26_Node000002_Node000019" title=" " alt="" coords="143,298,158,280,170,258,177,239,187,221,207,206,233,194,260,187,317,182,372,186,420,195,419,200,372,191,317,187,261,192,235,199,209,210,191,224,182,241,175,260,162,283,147,302"/>
-<area shape="rect" id="Node000020" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" title="This function updates the value at node with val." alt="" coords="208,89,353,145"/>
-<area shape="poly" id="edge27_Node000002_Node000020" title=" " alt="" coords="143,299,158,280,172,248,179,220,187,193,206,162,214,154,218,157,210,166,192,195,184,221,177,250,162,283,148,302"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="353,354,418,334,420,339,354,359"/>
-<area shape="rect" id="Node000006" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" title="Function that specifies the type of operation involved when segments are combined." alt="" coords="604,560,749,616"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="354,633,450,625,555,612,588,606,589,611,556,617,450,630,354,638"/>
-<area shape="rect" id="Node000007" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)" alt="" coords="406,885,551,941"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="297,667,339,751,369,801,403,847,429,873,425,877,399,851,365,804,334,754,292,669"/>
-<area shape="rect" id="Node000008" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" title="Utility function to lable the nodes so that heavy chains have a contigous lable." alt="" coords="406,547,551,602"/>
-<area shape="poly" id="edge8_Node000005_Node000008" title=" " alt="" coords="353,613,390,601,392,606,354,618"/>
-<area shape="rect" id="Node000009" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" title="Utility function to assign highest parent that can be reached though heavy chains." alt="" coords="406,701,551,757"/>
-<area shape="poly" id="edge10_Node000005_Node000009" title=" " alt="" coords="345,666,403,692,400,697,343,671"/>
-<area shape="rect" id="Node000010" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" title="This function must be called after the tree adjacency list and node values are populated The function..." alt="" coords="406,781,551,837"/>
-<area shape="poly" id="edge12_Node000005_Node000010" title=" " alt="" coords="305,666,348,716,403,767,408,770,404,775,400,771,344,720,301,670"/>
-<area shape="poly" id="edge7_Node000007_Node000007" title=" " alt="" coords="439,885,440,875,447,866,460,861,479,859,500,861,512,868,510,873,498,866,478,864,461,866,450,871,445,877,445,885"/>
-<area shape="poly" id="edge9_Node000008_Node000008" title=" " alt="" coords="439,546,440,536,447,528,460,522,479,520,500,523,512,530,510,534,498,528,478,525,461,527,450,532,445,538,445,546"/>
-<area shape="poly" id="edge11_Node000009_Node000009" title=" " alt="" coords="439,701,440,691,447,682,460,677,479,675,500,677,512,684,510,689,498,682,478,680,461,682,450,687,445,693,445,701"/>
-<area shape="rect" id="Node000011" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" title="Utility function to populate the t_par vector." alt="" coords="604,833,749,889"/>
-<area shape="poly" id="edge13_Node000010_Node000011" title=" " alt="" coords="552,826,590,836,588,841,551,831"/>
-<area shape="rect" id="Node000012" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" title="Utility function to compute sub&#45;tree sizes." alt="" coords="604,729,749,785"/>
-<area shape="poly" id="edge15_Node000010_Node000012" title=" " alt="" coords="551,788,588,778,590,783,552,793"/>
-<area shape="poly" id="edge14_Node000011_Node000011" title=" " alt="" coords="637,833,638,823,645,814,658,809,676,807,697,809,710,816,708,821,696,814,676,812,659,814,648,819,643,825,642,833"/>
-<area shape="poly" id="edge16_Node000012_Node000012" title=" " alt="" coords="637,729,638,719,645,710,658,705,676,703,697,705,710,712,708,717,696,710,676,708,659,710,648,715,643,721,642,729"/>
-<area shape="rect" id="Node000014" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" title="Utility function to break down a path query into two chain queries." alt="" coords="406,443,551,498"/>
-<area shape="poly" id="edge19_Node000013_Node000014" title=" " alt="" coords="353,492,390,485,391,490,354,498"/>
-<area shape="rect" id="Node000016" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" title="The function returns the least common ancestor of two nodes." alt="" coords="406,363,551,418"/>
-<area shape="poly" id="edge22_Node000013_Node000016" title=" " alt="" coords="324,479,352,460,400,428,407,424,410,428,403,433,355,465,327,483"/>
-<area shape="poly" id="edge20_Node000014_Node000006" title=" " alt="" coords="537,497,557,508,622,549,619,553,554,513,534,501"/>
-<area shape="rect" id="Node000015" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="637,458,716,483"/>
-<area shape="poly" id="edge21_Node000014_Node000015" title=" " alt="" coords="551,468,622,468,622,473,551,473"/>
-<area shape="rect" id="Node000017" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store..." alt="" coords="604,363,749,418"/>
-<area shape="poly" id="edge23_Node000016_Node000017" title=" " alt="" coords="551,388,588,388,588,393,551,393"/>
-<area shape="poly" id="edge25_Node000018_Node000019" title=" " alt="" coords="353,233,405,224,406,229,354,238"/>
-<area shape="rect" id="Node000021" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" title="Update the value at a node." alt="" coords="406,89,551,145"/>
-<area shape="poly" id="edge28_Node000020_Node000021" title=" " alt="" coords="354,115,391,115,391,120,354,120"/>
-<area shape="poly" id="edge30_Node000022_Node000003" title=" " alt="" coords="150,267,236,339,232,343,147,271"/>
-<area shape="poly" id="edge32_Node000022_Node000004" title=" " alt="" coords="131,242,136,207,148,160,170,113,186,92,206,75,245,54,281,47,317,53,355,75,373,93,383,112,388,131,388,151,389,193,393,215,404,239,426,268,451,293,447,297,422,272,399,241,388,217,384,194,383,151,382,132,378,113,369,96,352,79,315,58,281,52,247,59,210,79,190,96,175,116,153,162,141,208,136,243"/>
-<area shape="poly" id="edge31_Node000022_Node000005" title=" " alt="" coords="149,268,162,287,177,325,185,358,187,418,190,478,197,511,210,548,225,575,244,599,239,602,221,577,206,550,192,512,184,478,182,418,179,359,172,326,158,289,145,271"/>
-<area shape="poly" id="edge33_Node000022_Node000013" title=" " alt="" coords="148,267,162,287,179,322,187,352,195,382,210,417,246,468,242,471,206,420,190,384,182,354,174,324,158,289,143,270"/>
-<area shape="poly" id="edge34_Node000022_Node000018" title=" " alt="" coords="160,252,192,250,193,255,161,257"/>
-<area shape="poly" id="edge35_Node000022_Node000019" title=" " alt="" coords="130,243,132,200,141,141,151,110,164,80,183,53,206,31,244,10,280,3,316,10,355,31,370,44,379,59,385,90,388,122,393,139,403,156,421,175,442,191,439,195,418,179,399,159,389,141,383,123,380,90,374,61,366,48,352,35,315,15,280,8,246,15,210,35,187,57,169,83,156,112,146,143,137,201,135,243"/>
-<area shape="poly" id="edge36_Node000022_Node000020" title=" " alt="" coords="139,241,167,204,206,162,218,152,221,157,210,166,171,207,143,245"/>
-<area shape="poly" id="edge38_Node000023_Node000003" title=" " alt="" coords="160,402,192,395,193,400,161,407"/>
-<area shape="poly" id="edge40_Node000023_Node000004" title=" " alt="" coords="138,423,145,451,159,486,180,520,210,547,248,566,283,574,316,568,352,547,371,526,380,504,382,480,379,455,376,429,376,403,383,376,399,349,412,337,416,341,403,352,388,378,382,403,382,429,385,454,387,480,385,505,376,529,355,551,318,573,282,579,246,571,206,551,176,524,154,488,140,453,133,425"/>
-<area shape="poly" id="edge39_Node000023_Node000005" title=" " alt="" coords="138,423,160,500,181,547,210,592,218,600,214,604,206,595,177,550,155,501,133,425"/>
-<area shape="poly" id="edge41_Node000023_Node000013" title=" " alt="" coords="153,422,209,460,224,470,221,475,207,465,150,426"/>
-<area shape="poly" id="edge42_Node000023_Node000018" title=" " alt="" coords="143,395,242,285,246,289,147,399"/>
-<area shape="poly" id="edge43_Node000023_Node000019" title=" " alt="" coords="161,419,202,430,252,438,304,435,329,428,352,416,366,404,375,391,381,362,385,329,390,311,399,292,423,261,448,236,452,239,427,265,404,295,395,313,390,330,386,363,380,393,370,407,355,421,331,433,305,441,252,443,201,436,160,424"/>
-<area shape="poly" id="edge44_Node000023_Node000020" title=" " alt="" coords="135,396,157,338,178,271,188,242,206,207,242,155,246,158,210,209,193,244,183,273,163,339,140,398"/>
-</map>
diff --git a/d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 4d322f245..000000000
--- a/d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1300f7307fde54a8eb10429e332996d5
\ No newline at end of file
diff --git a/d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 8e91da693..000000000
--- a/d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,730 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 710 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 566;
-var viewHeight = 710;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-480.5 0,-480.5 0,-461.25 37,-461.25 37,-480.5"/>
-<text text-anchor="middle" x="18.5" y="-467" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116,-480.5 73,-480.5 73,-461.25 116,-461.25 116,-480.5"/>
-<text text-anchor="middle" x="94.5" y="-467" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.41,-470.88C44.54,-470.88 52.97,-470.88 61.1,-470.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.09,-474.38 71.09,-470.88 61.09,-467.38 61.09,-474.38"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116,-523.5 73,-523.5 73,-504.25 116,-504.25 116,-523.5"/>
-<text text-anchor="middle" x="94.5" y="-510" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node22 -->
-<g id="edge29_Node000001_Node000022" class="edge">
-<title>Node1&#45;&gt;Node22</title>
-<g id="a_edge29_Node000001_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.66,-480.85C45.47,-485.97 56.41,-492.32 66.33,-498.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.46,-501.05 74.87,-503.05 67.98,-495 64.46,-501.05"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116,-407.5 73,-407.5 73,-388.25 116,-388.25 116,-407.5"/>
-<text text-anchor="middle" x="94.5" y="-394" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node23 -->
-<g id="edge37_Node000001_Node000023" class="edge">
-<title>Node1&#45;&gt;Node23</title>
-<g id="a_edge37_Node000001_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.48,-461.03C41.35,-449.32 61.39,-429.56 75.88,-415.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.94,-418.14 82.6,-408.63 73.02,-413.16 77.94,-418.14"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" target="_top" xlink:title="Adds an undirected edge from node u to node v in the tree.">
-<polygon fill="white" stroke="#666666" points="261,-442.75 152,-442.75 152,-401 261,-401 261,-442.75"/>
-<text text-anchor="start" x="160" y="-429.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="160" y="-418" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="206.5" y="-406.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.45,-461.54C125.42,-457.55 136.39,-452.66 147.52,-447.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.64,-451.04 156.35,-443.77 145.79,-444.64 148.64,-451.04"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="412.75,-476.5 297,-476.5 297,-457.25 412.75,-457.25 412.75,-476.5"/>
-<text text-anchor="middle" x="354.88" y="-463" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge17_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge17_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.21,-470.55C152.45,-469.99 228.89,-468.81 285.34,-467.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.25,-471.44 295.19,-467.78 285.14,-464.44 285.25,-471.44"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="261,-246.75 152,-246.75 152,-205 261,-205 261,-246.75"/>
-<text text-anchor="start" x="160" y="-233.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="160" y="-222" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="206.5" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::init</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.51,-461.01C103.83,-450.24 110.77,-432.47 116,-416.88 134.12,-362.87 125.92,-344.51 152,-293.88 158.95,-280.39 168.74,-266.96 178.05,-255.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.56,-258.09 184.37,-248.21 175.23,-253.56 180.56,-258.09"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" target="_top" xlink:title="This function returns the sum of node values in the simple path from from node_1 to node_2.">
-<polygon fill="white" stroke="#666666" points="261,-344.75 152,-344.75 152,-303 261,-303 261,-344.75"/>
-<text text-anchor="start" x="160" y="-331.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="160" y="-320" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="206.5" y="-308.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::query</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node13 -->
-<g id="edge18_Node000002_Node000013" class="edge">
-<title>Node2&#45;&gt;Node13</title>
-<g id="a_edge18_Node000002_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.49,-460.79C113.02,-445.67 133.68,-416.29 152,-391.88 161.39,-379.36 172,-365.77 181.27,-354.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.95,-356.31 187.44,-346.3 178.47,-351.95 183.95,-356.31"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" target="_top" xlink:title="Set the values for all the nodes.">
-<polygon fill="white" stroke="#666666" points="261,-540.75 152,-540.75 152,-499 261,-499 261,-540.75"/>
-<text text-anchor="start" x="160" y="-527.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="160" y="-516" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="206.5" y="-504.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::set_node_val</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node18 -->
-<g id="edge24_Node000002_Node000018" class="edge">
-<title>Node2&#45;&gt;Node18</title>
-<g id="a_edge24_Node000002_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.45,-480.21C125.42,-484.2 136.39,-489.09 147.52,-494.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.79,-497.11 156.35,-497.98 148.64,-490.71 145.79,-497.11"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="398.12,-554.5 311.62,-554.5 311.62,-535.25 398.12,-535.25 398.12,-554.5"/>
-<text text-anchor="middle" x="354.88" y="-541" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node19 -->
-<g id="edge26_Node000002_Node000019" class="edge">
-<title>Node2&#45;&gt;Node19</title>
-<g id="a_edge26_Node000002_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.57,-480.92C108.25,-485.13 112.45,-490.14 116,-494.88 133.52,-518.25 126.3,-535.98 152,-549.88 201.4,-576.58 268.02,-567.91 310.97,-557.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="311.58,-561.13 320.42,-555.29 309.86,-554.34 311.58,-561.13"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" target="_top" xlink:title="This function updates the value at node with val.">
-<polygon fill="white" stroke="#666666" points="261,-638.75 152,-638.75 152,-597 261,-597 261,-638.75"/>
-<text text-anchor="start" x="160" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="160" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="206.5" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::update</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node20 -->
-<g id="edge27_Node000002_Node000020" class="edge">
-<title>Node2&#45;&gt;Node20</title>
-<g id="a_edge27_Node000002_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.04,-480.6C108.79,-484.76 112.92,-489.82 116,-494.88 138,-530.95 125.11,-550.28 152,-582.88 153.82,-585.08 155.82,-587.2 157.94,-589.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.57,-591.8 165.46,-595.59 160.09,-586.46 155.57,-591.8"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M261.17,-438.38C277.32,-443.34 294.84,-448.73 310.26,-453.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.03,-456.75 319.62,-456.34 311.09,-450.06 309.03,-456.75"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="557.75,-285.75 448.75,-285.75 448.75,-244 557.75,-244 557.75,-285.75"/>
-<text text-anchor="start" x="456.75" y="-272.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="456.75" y="-261" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="503.25" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M261.32,-228.97C302.86,-231.82 361.67,-236.84 412.75,-244.88 420.75,-246.13 429.11,-247.68 437.36,-249.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="436.52,-252.76 447.03,-251.39 437.96,-245.91 436.52,-252.76"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" target="_top" xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="white" stroke="#666666" points="409.38,-41.75 300.38,-41.75 300.38,0 409.38,0 409.38,-41.75"/>
-<text text-anchor="start" x="308.38" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="308.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="354.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.69,-204.59C230.98,-172.94 260.68,-112.53 297,-68.88 302.69,-62.03 309.44,-55.39 316.27,-49.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.37,-52.16 323.72,-43.01 313.84,-46.82 318.37,-52.16"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" target="_top" xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="white" stroke="#666666" points="409.38,-295.75 300.38,-295.75 300.38,-254 409.38,-254 409.38,-295.75"/>
-<text text-anchor="start" x="308.38" y="-282.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="308.38" y="-271" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="354.88" y="-259.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge8_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge8_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M261.17,-243.84C270.32,-246.91 279.91,-250.11 289.3,-253.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.18,-256.57 298.77,-256.43 290.4,-249.94 288.18,-256.57"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" target="_top" xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="white" stroke="#666666" points="409.38,-179.75 300.38,-179.75 300.38,-138 409.38,-138 409.38,-179.75"/>
-<text text-anchor="start" x="308.38" y="-166.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="308.38" y="-155" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="354.88" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge10_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge10_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.81,-204.68C267.56,-198.38 282.78,-191.42 297.11,-184.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.35,-188.14 305.98,-180.8 295.43,-181.78 298.35,-188.14"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="409.38,-119.75 300.38,-119.75 300.38,-78 409.38,-78 409.38,-119.75"/>
-<text text-anchor="start" x="308.38" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="308.38" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="354.88" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge12_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge12_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M223.56,-204.61C240.24,-183.53 267.94,-151.22 297,-128.88 298.12,-128.01 299.27,-127.16 300.44,-126.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="302.08,-129.44 308.51,-121.01 298.23,-123.59 302.08,-129.44"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M327.49,-42.07C324.88,-51.55 334.01,-59.75 354.88,-59.75 366.94,-59.75 375.08,-57.01 379.29,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="382.59,-54.1 381.86,-43.53 375.84,-52.24 382.59,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge9_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge9_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M327.49,-296.07C324.88,-305.55 334.01,-313.75 354.88,-313.75 366.94,-313.75 375.08,-311.01 379.29,-306.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="382.59,-308.1 381.86,-297.53 375.84,-306.24 382.59,-308.1"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node9 -->
-<g id="edge11_Node000009_Node000009" class="edge">
-<title>Node9&#45;&gt;Node9</title>
-<g id="a_edge11_Node000009_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M327.49,-180.07C324.88,-189.55 334.01,-197.75 354.88,-197.75 366.94,-197.75 375.08,-195.01 379.29,-190.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="382.59,-192.1 381.86,-181.53 375.84,-190.24 382.59,-192.1"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="557.75,-80.75 448.75,-80.75 448.75,-39 557.75,-39 557.75,-80.75"/>
-<text text-anchor="start" x="456.75" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="456.75" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="503.25" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge13_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge13_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M409.55,-84.57C418.7,-82.14 428.28,-79.58 437.68,-77.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="438.36,-80.52 447.12,-74.56 436.56,-73.76 438.36,-80.52"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="557.75,-158.75 448.75,-158.75 448.75,-117 557.75,-117 557.75,-158.75"/>
-<text text-anchor="start" x="456.75" y="-145.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="456.75" y="-134" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="503.25" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node12 -->
-<g id="edge15_Node000010_Node000012" class="edge">
-<title>Node10&#45;&gt;Node12</title>
-<g id="a_edge15_Node000010_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M409.55,-113.18C418.7,-115.61 428.28,-118.17 437.68,-120.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="436.56,-123.99 447.12,-123.19 438.36,-117.23 436.56,-123.99"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node11 -->
-<g id="edge14_Node000011_Node000011" class="edge">
-<title>Node11&#45;&gt;Node11</title>
-<g id="a_edge14_Node000011_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M475.86,-81.07C473.26,-90.55 482.38,-98.75 503.25,-98.75 515.31,-98.75 523.45,-96.01 527.67,-91.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="530.96,-93.1 530.23,-82.53 524.21,-91.24 530.96,-93.1"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node12 -->
-<g id="edge16_Node000012_Node000012" class="edge">
-<title>Node12&#45;&gt;Node12</title>
-<g id="a_edge16_Node000012_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M475.86,-159.07C473.26,-168.55 482.38,-176.75 503.25,-176.75 515.31,-176.75 523.45,-174.01 527.67,-169.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="530.96,-171.1 530.23,-160.53 524.21,-169.24 530.96,-171.1"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" target="_top" xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="white" stroke="#666666" points="409.38,-373.75 300.38,-373.75 300.38,-332 409.38,-332 409.38,-373.75"/>
-<text text-anchor="start" x="308.38" y="-360.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="308.38" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="354.88" y="-337.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge19_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge19_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M261.17,-334.51C270.22,-336.3 279.7,-338.18 289,-340.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.23,-343.44 298.72,-341.95 289.59,-336.57 288.23,-343.44"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" target="_top" xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="white" stroke="#666666" points="409.38,-433.75 300.38,-433.75 300.38,-392 409.38,-392 409.38,-433.75"/>
-<text text-anchor="start" x="308.38" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="308.38" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="354.88" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node16 -->
-<g id="edge22_Node000013_Node000016" class="edge">
-<title>Node13&#45;&gt;Node16</title>
-<g id="a_edge22_Node000013_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M240.07,-345.12C246.98,-349.65 254.24,-354.41 261,-358.88 277.05,-369.47 280.47,-373.04 297,-382.88 298.83,-383.97 300.71,-385.06 302.62,-386.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.53,-389 310.96,-390.83 303.95,-382.89 300.53,-389"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node6 -->
-<g id="edge20_Node000014_Node000006" class="edge">
-<title>Node14&#45;&gt;Node6</title>
-<g id="a_edge20_Node000014_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M397.43,-331.51C402.63,-328.68 407.84,-325.75 412.75,-322.88 428.87,-313.43 446.18,-302.42 461.25,-292.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="463.11,-295.51 469.53,-287.08 459.25,-289.67 463.11,-295.51"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="532.62,-362.5 473.88,-362.5 473.88,-343.25 532.62,-343.25 532.62,-362.5"/>
-<text text-anchor="middle" x="503.25" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge21_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge21_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M409.55,-352.88C427.01,-352.88 446.08,-352.88 462.35,-352.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="462.13,-356.38 472.13,-352.88 462.13,-349.38 462.13,-356.38"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="557.75,-433.75 448.75,-433.75 448.75,-392 557.75,-392 557.75,-433.75"/>
-<text text-anchor="start" x="456.75" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="456.75" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="503.25" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge23_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge23_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M409.55,-412.88C418.6,-412.88 428.08,-412.88 437.37,-412.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="437.07,-416.38 447.07,-412.88 437.07,-409.38 437.07,-416.38"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node19 -->
-<g id="edge25_Node000018_Node000019" class="edge">
-<title>Node18&#45;&gt;Node19</title>
-<g id="a_edge25_Node000018_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M261.17,-529.04C273.79,-531.2 287.25,-533.5 299.88,-535.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.26,-539.1 309.71,-537.33 300.44,-532.2 299.26,-539.1"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" target="_top" xlink:title="Update the value at a node.">
-<polygon fill="white" stroke="#666666" points="409.38,-638.75 300.38,-638.75 300.38,-597 409.38,-597 409.38,-638.75"/>
-<text text-anchor="start" x="308.38" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="308.38" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="354.88" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::update</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node21 -->
-<g id="edge28_Node000020_Node000021" class="edge">
-<title>Node20&#45;&gt;Node21</title>
-<g id="a_edge28_Node000020_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M261.17,-617.88C270.22,-617.88 279.7,-617.88 289,-617.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.69,-621.38 298.69,-617.88 288.69,-614.38 288.69,-621.38"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node3 -->
-<g id="edge30_Node000022_Node000003" class="edge">
-<title>Node22&#45;&gt;Node3</title>
-<g id="a_edge30_Node000022_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.27,-504.03C122.47,-491.32 149.57,-468.66 171.45,-450.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.57,-453.14 179,-444.04 169.08,-447.77 173.57,-453.14"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node4 -->
-<g id="edge32_Node000022_Node000004" class="edge">
-<title>Node22&#45;&gt;Node4</title>
-<g id="a_edge32_Node000022_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.16,-523.92C98.49,-549.87 108.66,-619.12 152,-647.88 192.36,-674.66 222.2,-676.88 261,-647.88 306.28,-614.03 268.57,-574.74 297,-525.88 306.24,-510 320.62,-495.13 332.61,-484.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.79,-487.03 340.05,-477.83 330.2,-481.75 334.79,-487.03"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node5 -->
-<g id="edge31_Node000022_Node000005" class="edge">
-<title>Node22&#45;&gt;Node5</title>
-<g id="a_edge31_Node000022_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.01,-503.98C109.71,-499.95 113.55,-495.02 116,-489.88 154.07,-409.9 115.55,-374.6 152,-293.88 158.19,-280.16 167.74,-266.76 177.06,-255.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.53,-258.02 183.43,-248.17 174.24,-253.44 179.53,-258.02"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node13 -->
-<g id="edge33_Node000022_Node000013" class="edge">
-<title>Node22&#45;&gt;Node13</title>
-<g id="a_edge33_Node000022_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.14,-504.21C108.9,-500.05 113.01,-494.98 116,-489.88 139.44,-449.83 129.37,-432.39 152,-391.88 159.46,-378.53 169.44,-365.04 178.76,-353.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.31,-356.05 185.07,-346.14 175.95,-351.55 181.31,-356.05"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node18 -->
-<g id="edge34_Node000022_Node000018" class="edge">
-<title>Node22&#45;&gt;Node18</title>
-<g id="a_edge34_Node000022_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.45,-515.02C123.47,-515.4 131.71,-515.85 140.3,-516.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.02,-519.81 150.2,-516.86 140.4,-512.82 140.02,-519.81"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node19 -->
-<g id="edge35_Node000022_Node000019" class="edge">
-<title>Node22&#45;&gt;Node19</title>
-<g id="a_edge35_Node000022_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.26,-523.63C95.13,-553.35 99.28,-643.05 152,-680.88 191.36,-709.11 221.04,-708.26 261,-680.88 297.56,-655.82 270.3,-623.26 297,-587.88 304.91,-577.39 316.03,-568.21 326.35,-561.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.13,-564.07 334.59,-555.67 324.3,-558.21 328.13,-564.07"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node20 -->
-<g id="edge36_Node000022_Node000020" class="edge">
-<title>Node22&#45;&gt;Node20</title>
-<g id="a_edge36_Node000022_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102,-523.58C111.76,-537.7 131.27,-564.25 152,-582.88 154.68,-585.29 157.55,-587.65 160.5,-589.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.2,-592.59 168.34,-595.66 162.32,-586.93 158.2,-592.59"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node3 -->
-<g id="edge38_Node000023_Node000003" class="edge">
-<title>Node23&#45;&gt;Node3</title>
-<g id="a_edge38_Node000023_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.45,-402.45C123.55,-403.99 131.9,-405.82 140.59,-407.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.71,-411.1 150.23,-409.82 141.21,-404.26 139.71,-411.1"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node4 -->
-<g id="edge40_Node000023_Node000004" class="edge">
-<title>Node23&#45;&gt;Node4</title>
-<g id="a_edge40_Node000023_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.43,-387.81C102.21,-366.03 116.86,-314.78 152,-293.88 193.64,-269.11 222.93,-263.91 261,-293.88 314.53,-336.01 252.89,-390.96 297,-442.88 299.69,-446.04 302.87,-448.8 306.33,-451.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.28,-454.06 314.69,-456 307.76,-447.99 304.28,-454.06"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node5 -->
-<g id="edge39_Node000023_Node000005" class="edge">
-<title>Node23&#45;&gt;Node5</title>
-<g id="a_edge39_Node000023_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.48,-387.86C102.69,-363.68 118.7,-301.11 152,-260.88 153.83,-258.67 155.83,-256.55 157.95,-254.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.1,-257.3 165.48,-248.17 155.58,-251.95 160.1,-257.3"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node13 -->
-<g id="edge41_Node000023_Node000013" class="edge">
-<title>Node23&#45;&gt;Node13</title>
-<g id="a_edge41_Node000023_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.83,-387.84C121.21,-379.9 137.56,-368.58 152,-358.88 155.63,-356.44 159.4,-353.92 163.2,-351.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.91,-354.48 171.33,-346.05 161.05,-348.63 164.91,-354.48"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node18 -->
-<g id="edge42_Node000023_Node000018" class="edge">
-<title>Node23&#45;&gt;Node18</title>
-<g id="a_edge42_Node000023_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.5,-407.86C120.61,-425.73 154.95,-463.81 179.1,-490.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.24,-492.65 185.53,-497.73 181.44,-487.96 176.24,-492.65"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node19 -->
-<g id="edge43_Node000023_Node000019" class="edge">
-<title>Node23&#45;&gt;Node19</title>
-<g id="a_edge43_Node000023_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.24,-389.88C149.9,-378.38 217.06,-361.65 261,-391.88 297.86,-417.23 272.99,-448.12 297,-485.88 306.98,-501.56 321.59,-516.61 333.5,-527.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.04,-530.08 340.84,-534.11 335.7,-524.85 331.04,-530.08"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node20 -->
-<g id="edge44_Node000023_Node000020" class="edge">
-<title>Node23&#45;&gt;Node20</title>
-<g id="a_edge44_Node000023_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.31,-407.82C103.45,-418.64 110.25,-436.47 116,-451.88 132.23,-495.34 129.37,-509.36 152,-549.88 159.46,-563.22 169.44,-576.71 178.76,-588.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.95,-590.2 185.07,-595.61 181.31,-585.7 175.95,-590.2"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 00da69fe3..000000000
--- a/d2/de9/heavy__light__decomposition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,647 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="566pt" height="710pt"
- viewBox="0.00 0.00 565.75 709.79" 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 705.79)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-480.5 0,-480.5 0,-461.25 37,-461.25 37,-480.5"/>
-<text text-anchor="middle" x="18.5" y="-467" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116,-480.5 73,-480.5 73,-461.25 116,-461.25 116,-480.5"/>
-<text text-anchor="middle" x="94.5" y="-467" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.41,-470.88C44.54,-470.88 52.97,-470.88 61.1,-470.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.09,-474.38 71.09,-470.88 61.09,-467.38 61.09,-474.38"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116,-523.5 73,-523.5 73,-504.25 116,-504.25 116,-523.5"/>
-<text text-anchor="middle" x="94.5" y="-510" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node22 -->
-<g id="edge29_Node000001_Node000022" class="edge">
-<title>Node1&#45;&gt;Node22</title>
-<g id="a_edge29_Node000001_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.66,-480.85C45.47,-485.97 56.41,-492.32 66.33,-498.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.46,-501.05 74.87,-503.05 67.98,-495 64.46,-501.05"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116,-407.5 73,-407.5 73,-388.25 116,-388.25 116,-407.5"/>
-<text text-anchor="middle" x="94.5" y="-394" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node23 -->
-<g id="edge37_Node000001_Node000023" class="edge">
-<title>Node1&#45;&gt;Node23</title>
-<g id="a_edge37_Node000001_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.48,-461.03C41.35,-449.32 61.39,-429.56 75.88,-415.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.94,-418.14 82.6,-408.63 73.02,-413.16 77.94,-418.14"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" target="_top" xlink:title="Adds an undirected edge from node u to node v in the tree.">
-<polygon fill="white" stroke="#666666" points="261,-442.75 152,-442.75 152,-401 261,-401 261,-442.75"/>
-<text text-anchor="start" x="160" y="-429.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="160" y="-418" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="206.5" y="-406.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.45,-461.54C125.42,-457.55 136.39,-452.66 147.52,-447.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.64,-451.04 156.35,-443.77 145.79,-444.64 148.64,-451.04"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="412.75,-476.5 297,-476.5 297,-457.25 412.75,-457.25 412.75,-476.5"/>
-<text text-anchor="middle" x="354.88" y="-463" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge17_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge17_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.21,-470.55C152.45,-469.99 228.89,-468.81 285.34,-467.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.25,-471.44 295.19,-467.78 285.14,-464.44 285.25,-471.44"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="261,-246.75 152,-246.75 152,-205 261,-205 261,-246.75"/>
-<text text-anchor="start" x="160" y="-233.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="160" y="-222" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="206.5" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::init</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.51,-461.01C103.83,-450.24 110.77,-432.47 116,-416.88 134.12,-362.87 125.92,-344.51 152,-293.88 158.95,-280.39 168.74,-266.96 178.05,-255.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.56,-258.09 184.37,-248.21 175.23,-253.56 180.56,-258.09"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" target="_top" xlink:title="This function returns the sum of node values in the simple path from from node_1 to node_2.">
-<polygon fill="white" stroke="#666666" points="261,-344.75 152,-344.75 152,-303 261,-303 261,-344.75"/>
-<text text-anchor="start" x="160" y="-331.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="160" y="-320" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="206.5" y="-308.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::query</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node13 -->
-<g id="edge18_Node000002_Node000013" class="edge">
-<title>Node2&#45;&gt;Node13</title>
-<g id="a_edge18_Node000002_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.49,-460.79C113.02,-445.67 133.68,-416.29 152,-391.88 161.39,-379.36 172,-365.77 181.27,-354.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.95,-356.31 187.44,-346.3 178.47,-351.95 183.95,-356.31"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" target="_top" xlink:title="Set the values for all the nodes.">
-<polygon fill="white" stroke="#666666" points="261,-540.75 152,-540.75 152,-499 261,-499 261,-540.75"/>
-<text text-anchor="start" x="160" y="-527.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="160" y="-516" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="206.5" y="-504.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::set_node_val</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node18 -->
-<g id="edge24_Node000002_Node000018" class="edge">
-<title>Node2&#45;&gt;Node18</title>
-<g id="a_edge24_Node000002_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.45,-480.21C125.42,-484.2 136.39,-489.09 147.52,-494.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.79,-497.11 156.35,-497.98 148.64,-490.71 145.79,-497.11"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="398.12,-554.5 311.62,-554.5 311.62,-535.25 398.12,-535.25 398.12,-554.5"/>
-<text text-anchor="middle" x="354.88" y="-541" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node19 -->
-<g id="edge26_Node000002_Node000019" class="edge">
-<title>Node2&#45;&gt;Node19</title>
-<g id="a_edge26_Node000002_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.57,-480.92C108.25,-485.13 112.45,-490.14 116,-494.88 133.52,-518.25 126.3,-535.98 152,-549.88 201.4,-576.58 268.02,-567.91 310.97,-557.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="311.58,-561.13 320.42,-555.29 309.86,-554.34 311.58,-561.13"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" target="_top" xlink:title="This function updates the value at node with val.">
-<polygon fill="white" stroke="#666666" points="261,-638.75 152,-638.75 152,-597 261,-597 261,-638.75"/>
-<text text-anchor="start" x="160" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="160" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="206.5" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::update</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node20 -->
-<g id="edge27_Node000002_Node000020" class="edge">
-<title>Node2&#45;&gt;Node20</title>
-<g id="a_edge27_Node000002_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.04,-480.6C108.79,-484.76 112.92,-489.82 116,-494.88 138,-530.95 125.11,-550.28 152,-582.88 153.82,-585.08 155.82,-587.2 157.94,-589.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.57,-591.8 165.46,-595.59 160.09,-586.46 155.57,-591.8"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M261.17,-438.38C277.32,-443.34 294.84,-448.73 310.26,-453.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.03,-456.75 319.62,-456.34 311.09,-450.06 309.03,-456.75"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="557.75,-285.75 448.75,-285.75 448.75,-244 557.75,-244 557.75,-285.75"/>
-<text text-anchor="start" x="456.75" y="-272.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="456.75" y="-261" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="503.25" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M261.32,-228.97C302.86,-231.82 361.67,-236.84 412.75,-244.88 420.75,-246.13 429.11,-247.68 437.36,-249.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="436.52,-252.76 447.03,-251.39 437.96,-245.91 436.52,-252.76"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" target="_top" xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="white" stroke="#666666" points="409.38,-41.75 300.38,-41.75 300.38,0 409.38,0 409.38,-41.75"/>
-<text text-anchor="start" x="308.38" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="308.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="354.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.69,-204.59C230.98,-172.94 260.68,-112.53 297,-68.88 302.69,-62.03 309.44,-55.39 316.27,-49.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.37,-52.16 323.72,-43.01 313.84,-46.82 318.37,-52.16"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" target="_top" xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="white" stroke="#666666" points="409.38,-295.75 300.38,-295.75 300.38,-254 409.38,-254 409.38,-295.75"/>
-<text text-anchor="start" x="308.38" y="-282.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="308.38" y="-271" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="354.88" y="-259.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge8_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge8_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M261.17,-243.84C270.32,-246.91 279.91,-250.11 289.3,-253.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.18,-256.57 298.77,-256.43 290.4,-249.94 288.18,-256.57"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" target="_top" xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="white" stroke="#666666" points="409.38,-179.75 300.38,-179.75 300.38,-138 409.38,-138 409.38,-179.75"/>
-<text text-anchor="start" x="308.38" y="-166.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="308.38" y="-155" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="354.88" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge10_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge10_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.81,-204.68C267.56,-198.38 282.78,-191.42 297.11,-184.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.35,-188.14 305.98,-180.8 295.43,-181.78 298.35,-188.14"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="409.38,-119.75 300.38,-119.75 300.38,-78 409.38,-78 409.38,-119.75"/>
-<text text-anchor="start" x="308.38" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="308.38" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="354.88" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge12_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge12_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M223.56,-204.61C240.24,-183.53 267.94,-151.22 297,-128.88 298.12,-128.01 299.27,-127.16 300.44,-126.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="302.08,-129.44 308.51,-121.01 298.23,-123.59 302.08,-129.44"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M327.49,-42.07C324.88,-51.55 334.01,-59.75 354.88,-59.75 366.94,-59.75 375.08,-57.01 379.29,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="382.59,-54.1 381.86,-43.53 375.84,-52.24 382.59,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge9_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge9_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M327.49,-296.07C324.88,-305.55 334.01,-313.75 354.88,-313.75 366.94,-313.75 375.08,-311.01 379.29,-306.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="382.59,-308.1 381.86,-297.53 375.84,-306.24 382.59,-308.1"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node9 -->
-<g id="edge11_Node000009_Node000009" class="edge">
-<title>Node9&#45;&gt;Node9</title>
-<g id="a_edge11_Node000009_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M327.49,-180.07C324.88,-189.55 334.01,-197.75 354.88,-197.75 366.94,-197.75 375.08,-195.01 379.29,-190.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="382.59,-192.1 381.86,-181.53 375.84,-190.24 382.59,-192.1"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="557.75,-80.75 448.75,-80.75 448.75,-39 557.75,-39 557.75,-80.75"/>
-<text text-anchor="start" x="456.75" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="456.75" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="503.25" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge13_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge13_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M409.55,-84.57C418.7,-82.14 428.28,-79.58 437.68,-77.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="438.36,-80.52 447.12,-74.56 436.56,-73.76 438.36,-80.52"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="557.75,-158.75 448.75,-158.75 448.75,-117 557.75,-117 557.75,-158.75"/>
-<text text-anchor="start" x="456.75" y="-145.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="456.75" y="-134" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="503.25" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node12 -->
-<g id="edge15_Node000010_Node000012" class="edge">
-<title>Node10&#45;&gt;Node12</title>
-<g id="a_edge15_Node000010_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M409.55,-113.18C418.7,-115.61 428.28,-118.17 437.68,-120.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="436.56,-123.99 447.12,-123.19 438.36,-117.23 436.56,-123.99"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node11 -->
-<g id="edge14_Node000011_Node000011" class="edge">
-<title>Node11&#45;&gt;Node11</title>
-<g id="a_edge14_Node000011_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M475.86,-81.07C473.26,-90.55 482.38,-98.75 503.25,-98.75 515.31,-98.75 523.45,-96.01 527.67,-91.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="530.96,-93.1 530.23,-82.53 524.21,-91.24 530.96,-93.1"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node12 -->
-<g id="edge16_Node000012_Node000012" class="edge">
-<title>Node12&#45;&gt;Node12</title>
-<g id="a_edge16_Node000012_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M475.86,-159.07C473.26,-168.55 482.38,-176.75 503.25,-176.75 515.31,-176.75 523.45,-174.01 527.67,-169.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="530.96,-171.1 530.23,-160.53 524.21,-169.24 530.96,-171.1"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" target="_top" xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="white" stroke="#666666" points="409.38,-373.75 300.38,-373.75 300.38,-332 409.38,-332 409.38,-373.75"/>
-<text text-anchor="start" x="308.38" y="-360.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="308.38" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="354.88" y="-337.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge19_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge19_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M261.17,-334.51C270.22,-336.3 279.7,-338.18 289,-340.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.23,-343.44 298.72,-341.95 289.59,-336.57 288.23,-343.44"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" target="_top" xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="white" stroke="#666666" points="409.38,-433.75 300.38,-433.75 300.38,-392 409.38,-392 409.38,-433.75"/>
-<text text-anchor="start" x="308.38" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="308.38" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="354.88" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node16 -->
-<g id="edge22_Node000013_Node000016" class="edge">
-<title>Node13&#45;&gt;Node16</title>
-<g id="a_edge22_Node000013_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M240.07,-345.12C246.98,-349.65 254.24,-354.41 261,-358.88 277.05,-369.47 280.47,-373.04 297,-382.88 298.83,-383.97 300.71,-385.06 302.62,-386.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.53,-389 310.96,-390.83 303.95,-382.89 300.53,-389"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node6 -->
-<g id="edge20_Node000014_Node000006" class="edge">
-<title>Node14&#45;&gt;Node6</title>
-<g id="a_edge20_Node000014_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M397.43,-331.51C402.63,-328.68 407.84,-325.75 412.75,-322.88 428.87,-313.43 446.18,-302.42 461.25,-292.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="463.11,-295.51 469.53,-287.08 459.25,-289.67 463.11,-295.51"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="532.62,-362.5 473.88,-362.5 473.88,-343.25 532.62,-343.25 532.62,-362.5"/>
-<text text-anchor="middle" x="503.25" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge21_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge21_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M409.55,-352.88C427.01,-352.88 446.08,-352.88 462.35,-352.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="462.13,-356.38 472.13,-352.88 462.13,-349.38 462.13,-356.38"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="557.75,-433.75 448.75,-433.75 448.75,-392 557.75,-392 557.75,-433.75"/>
-<text text-anchor="start" x="456.75" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="456.75" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="503.25" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge23_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge23_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M409.55,-412.88C418.6,-412.88 428.08,-412.88 437.37,-412.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="437.07,-416.38 447.07,-412.88 437.07,-409.38 437.07,-416.38"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node19 -->
-<g id="edge25_Node000018_Node000019" class="edge">
-<title>Node18&#45;&gt;Node19</title>
-<g id="a_edge25_Node000018_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M261.17,-529.04C273.79,-531.2 287.25,-533.5 299.88,-535.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.26,-539.1 309.71,-537.33 300.44,-532.2 299.26,-539.1"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" target="_top" xlink:title="Update the value at a node.">
-<polygon fill="white" stroke="#666666" points="409.38,-638.75 300.38,-638.75 300.38,-597 409.38,-597 409.38,-638.75"/>
-<text text-anchor="start" x="308.38" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="308.38" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="354.88" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::update</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node21 -->
-<g id="edge28_Node000020_Node000021" class="edge">
-<title>Node20&#45;&gt;Node21</title>
-<g id="a_edge28_Node000020_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M261.17,-617.88C270.22,-617.88 279.7,-617.88 289,-617.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.69,-621.38 298.69,-617.88 288.69,-614.38 288.69,-621.38"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node3 -->
-<g id="edge30_Node000022_Node000003" class="edge">
-<title>Node22&#45;&gt;Node3</title>
-<g id="a_edge30_Node000022_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.27,-504.03C122.47,-491.32 149.57,-468.66 171.45,-450.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.57,-453.14 179,-444.04 169.08,-447.77 173.57,-453.14"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node4 -->
-<g id="edge32_Node000022_Node000004" class="edge">
-<title>Node22&#45;&gt;Node4</title>
-<g id="a_edge32_Node000022_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.16,-523.92C98.49,-549.87 108.66,-619.12 152,-647.88 192.36,-674.66 222.2,-676.88 261,-647.88 306.28,-614.03 268.57,-574.74 297,-525.88 306.24,-510 320.62,-495.13 332.61,-484.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.79,-487.03 340.05,-477.83 330.2,-481.75 334.79,-487.03"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node5 -->
-<g id="edge31_Node000022_Node000005" class="edge">
-<title>Node22&#45;&gt;Node5</title>
-<g id="a_edge31_Node000022_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.01,-503.98C109.71,-499.95 113.55,-495.02 116,-489.88 154.07,-409.9 115.55,-374.6 152,-293.88 158.19,-280.16 167.74,-266.76 177.06,-255.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.53,-258.02 183.43,-248.17 174.24,-253.44 179.53,-258.02"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node13 -->
-<g id="edge33_Node000022_Node000013" class="edge">
-<title>Node22&#45;&gt;Node13</title>
-<g id="a_edge33_Node000022_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.14,-504.21C108.9,-500.05 113.01,-494.98 116,-489.88 139.44,-449.83 129.37,-432.39 152,-391.88 159.46,-378.53 169.44,-365.04 178.76,-353.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.31,-356.05 185.07,-346.14 175.95,-351.55 181.31,-356.05"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node18 -->
-<g id="edge34_Node000022_Node000018" class="edge">
-<title>Node22&#45;&gt;Node18</title>
-<g id="a_edge34_Node000022_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.45,-515.02C123.47,-515.4 131.71,-515.85 140.3,-516.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.02,-519.81 150.2,-516.86 140.4,-512.82 140.02,-519.81"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node19 -->
-<g id="edge35_Node000022_Node000019" class="edge">
-<title>Node22&#45;&gt;Node19</title>
-<g id="a_edge35_Node000022_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.26,-523.63C95.13,-553.35 99.28,-643.05 152,-680.88 191.36,-709.11 221.04,-708.26 261,-680.88 297.56,-655.82 270.3,-623.26 297,-587.88 304.91,-577.39 316.03,-568.21 326.35,-561.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.13,-564.07 334.59,-555.67 324.3,-558.21 328.13,-564.07"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node20 -->
-<g id="edge36_Node000022_Node000020" class="edge">
-<title>Node22&#45;&gt;Node20</title>
-<g id="a_edge36_Node000022_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102,-523.58C111.76,-537.7 131.27,-564.25 152,-582.88 154.68,-585.29 157.55,-587.65 160.5,-589.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.2,-592.59 168.34,-595.66 162.32,-586.93 158.2,-592.59"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node3 -->
-<g id="edge38_Node000023_Node000003" class="edge">
-<title>Node23&#45;&gt;Node3</title>
-<g id="a_edge38_Node000023_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.45,-402.45C123.55,-403.99 131.9,-405.82 140.59,-407.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.71,-411.1 150.23,-409.82 141.21,-404.26 139.71,-411.1"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node4 -->
-<g id="edge40_Node000023_Node000004" class="edge">
-<title>Node23&#45;&gt;Node4</title>
-<g id="a_edge40_Node000023_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.43,-387.81C102.21,-366.03 116.86,-314.78 152,-293.88 193.64,-269.11 222.93,-263.91 261,-293.88 314.53,-336.01 252.89,-390.96 297,-442.88 299.69,-446.04 302.87,-448.8 306.33,-451.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.28,-454.06 314.69,-456 307.76,-447.99 304.28,-454.06"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node5 -->
-<g id="edge39_Node000023_Node000005" class="edge">
-<title>Node23&#45;&gt;Node5</title>
-<g id="a_edge39_Node000023_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.48,-387.86C102.69,-363.68 118.7,-301.11 152,-260.88 153.83,-258.67 155.83,-256.55 157.95,-254.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.1,-257.3 165.48,-248.17 155.58,-251.95 160.1,-257.3"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node13 -->
-<g id="edge41_Node000023_Node000013" class="edge">
-<title>Node23&#45;&gt;Node13</title>
-<g id="a_edge41_Node000023_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.83,-387.84C121.21,-379.9 137.56,-368.58 152,-358.88 155.63,-356.44 159.4,-353.92 163.2,-351.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.91,-354.48 171.33,-346.05 161.05,-348.63 164.91,-354.48"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node18 -->
-<g id="edge42_Node000023_Node000018" class="edge">
-<title>Node23&#45;&gt;Node18</title>
-<g id="a_edge42_Node000023_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.5,-407.86C120.61,-425.73 154.95,-463.81 179.1,-490.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.24,-492.65 185.53,-497.73 181.44,-487.96 176.24,-492.65"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node19 -->
-<g id="edge43_Node000023_Node000019" class="edge">
-<title>Node23&#45;&gt;Node19</title>
-<g id="a_edge43_Node000023_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.24,-389.88C149.9,-378.38 217.06,-361.65 261,-391.88 297.86,-417.23 272.99,-448.12 297,-485.88 306.98,-501.56 321.59,-516.61 333.5,-527.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.04,-530.08 340.84,-534.11 335.7,-524.85 331.04,-530.08"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node20 -->
-<g id="edge44_Node000023_Node000020" class="edge">
-<title>Node23&#45;&gt;Node20</title>
-<g id="a_edge44_Node000023_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.31,-407.82C103.45,-418.64 110.25,-436.47 116,-451.88 132.23,-495.34 129.37,-509.36 152,-549.88 159.46,-563.22 169.44,-576.71 178.76,-588.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.95,-590.2 185.07,-595.61 181.31,-585.7 175.95,-590.2"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.map b/d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.map
deleted file mode 100644
index 97b09654f..000000000
--- a/d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.map
+++ /dev/null
@@ -1,49 +0,0 @@
-<map id="test_3" name="test_3">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,420,63,446"/>
-<area shape="rect" id="Node000002" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" title="Adds an undirected edge from node u to node v in the tree." alt="" coords="111,5,256,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="32,420,33,362,42,275,51,226,65,176,84,128,108,82,118,70,123,73,113,85,88,130,70,178,56,227,47,276,39,363,38,420"/>
-<area shape="rect" id="Node000003" 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="304,16,458,42"/>
-<area shape="poly" id="edge16_Node000001_Node000003" title=" " alt="" coords="32,420,33,368,41,292,51,251,64,209,83,169,109,132,303,52,323,45,324,50,305,57,112,137,88,171,69,211,56,252,47,293,38,369,37,420"/>
-<area shape="rect" id="Node000004" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" title="This function must be called after the tree adjacency list and node values are populated The function..." alt="" coords="111,405,256,461"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="63,430,95,430,95,436,63,436"/>
-<area shape="rect" id="Node000012" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" title="This function returns the sum of node values in the simple path from from node_1 to node_2." alt="" coords="111,147,256,202"/>
-<area shape="poly" id="edge17_Node000001_Node000012" title=" " alt="" coords="40,419,156,215,161,217,45,421"/>
-<area shape="rect" id="Node000017" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" title="Set the values for all the nodes." alt="" coords="111,499,256,554"/>
-<area shape="poly" id="edge23_Node000001_Node000017" title=" " alt="" coords="58,444,127,488,124,493,55,449"/>
-<area shape="rect" id="Node000018" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="324,670,439,695"/>
-<area shape="poly" id="edge25_Node000001_Node000018" title=" " alt="" coords="42,445,67,502,87,535,112,565,158,599,210,627,262,648,310,664,308,669,260,653,207,632,156,604,109,568,83,538,62,504,37,447"/>
-<area shape="rect" id="Node000019" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" title="This function updates the value at node with val." alt="" coords="111,707,256,762"/>
-<area shape="poly" id="edge26_Node000001_Node000019" title=" " alt="" coords="41,446,67,527,88,581,113,635,151,693,147,696,108,637,83,583,62,529,36,447"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="256,29,288,28,289,34,256,34"/>
-<area shape="rect" id="Node000005" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" title="Function that specifies the type of operation involved when segments are combined." alt="" coords="506,212,652,268"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="193,404,210,370,233,331,264,293,303,263,348,243,397,232,445,227,491,227,491,233,446,233,398,237,350,248,305,267,268,297,238,334,214,372,198,406"/>
-<area shape="rect" id="Node000006" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)" alt="" coords="308,301,454,357"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="236,402,303,367,311,362,314,367,305,372,239,407"/>
-<area shape="rect" id="Node000007" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" title="Utility function to lable the nodes so that heavy chains have a contigous lable." alt="" coords="308,405,454,461"/>
-<area shape="poly" id="edge7_Node000004_Node000007" title=" " alt="" coords="256,430,293,430,293,436,256,436"/>
-<area shape="rect" id="Node000008" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" title="Utility function to assign highest parent that can be reached though heavy chains." alt="" coords="308,589,454,645"/>
-<area shape="poly" id="edge9_Node000004_Node000008" title=" " alt="" coords="229,460,258,485,282,518,306,551,333,577,329,581,302,555,278,521,254,488,225,464"/>
-<area shape="rect" id="Node000009" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" title="This function must be called after the tree adjacency list and node values are populated The function..." alt="" coords="308,485,454,541"/>
-<area shape="poly" id="edge11_Node000004_Node000009" title=" " alt="" coords="255,459,298,477,296,482,253,464"/>
-<area shape="poly" id="edge6_Node000006_Node000006" title=" " alt="" coords="342,301,342,291,350,282,363,277,381,275,402,277,415,284,412,289,401,282,381,280,364,282,353,287,347,293,347,301"/>
-<area shape="poly" id="edge8_Node000007_Node000007" title=" " alt="" coords="342,405,342,395,350,386,363,381,381,379,402,381,415,388,412,393,401,386,381,384,364,386,353,391,347,397,347,405"/>
-<area shape="poly" id="edge10_Node000008_Node000008" title=" " alt="" coords="342,589,342,579,350,570,363,565,381,563,402,565,415,572,412,577,401,570,381,568,364,570,353,575,347,581,347,589"/>
-<area shape="rect" id="Node000010" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" title="Utility function to populate the t_par vector." alt="" coords="506,537,652,593"/>
-<area shape="poly" id="edge12_Node000009_Node000010" title=" " alt="" coords="455,530,492,540,491,545,453,535"/>
-<area shape="rect" id="Node000011" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" title="Utility function to compute sub&#45;tree sizes." alt="" coords="506,433,652,489"/>
-<area shape="poly" id="edge14_Node000009_Node000011" title=" " alt="" coords="453,492,491,482,492,487,455,497"/>
-<area shape="poly" id="edge13_Node000010_Node000010" title=" " alt="" coords="540,537,540,527,547,518,560,513,579,511,600,513,613,520,610,525,598,518,579,516,562,518,551,523,545,529,545,537"/>
-<area shape="poly" id="edge15_Node000011_Node000011" title=" " alt="" coords="540,433,540,423,547,414,560,409,579,407,600,409,613,416,610,421,598,414,579,412,562,414,551,419,545,425,545,433"/>
-<area shape="rect" id="Node000013" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" title="Utility function to break down a path query into two chain queries." alt="" coords="308,147,454,202"/>
-<area shape="poly" id="edge18_Node000012_Node000013" title=" " alt="" coords="256,172,293,172,293,177,256,177"/>
-<area shape="rect" id="Node000015" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" title="The function returns the least common ancestor of two nodes." alt="" coords="308,67,454,122"/>
-<area shape="poly" id="edge21_Node000012_Node000015" title=" " alt="" coords="253,144,296,126,298,131,255,149"/>
-<area shape="poly" id="edge19_Node000013_Node000005" title=" " alt="" coords="455,196,492,208,491,214,453,201"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="540,162,618,187"/>
-<area shape="poly" id="edge20_Node000013_Node000014" title=" " alt="" coords="454,172,524,172,524,177,454,177"/>
-<area shape="rect" id="Node000016" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store..." alt="" coords="506,67,652,122"/>
-<area shape="poly" id="edge22_Node000015_Node000016" title=" " alt="" coords="454,92,491,92,491,97,454,97"/>
-<area shape="poly" id="edge24_Node000017_Node000018" title=" " alt="" coords="216,553,258,597,280,628,290,642,306,655,314,660,311,665,302,659,286,645,276,632,254,600,212,557"/>
-<area shape="rect" id="Node000020" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" title="Update the value at a node." alt="" coords="308,720,454,776"/>
-<area shape="poly" id="edge27_Node000019_Node000020" title=" " alt="" coords="256,737,294,739,293,745,256,742"/>
-</map>
diff --git a/d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.md5 b/d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.md5
deleted file mode 100644
index a283dd8c0..000000000
--- a/d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f87e25e26305ef0fab62e38a09d1b449
\ No newline at end of file
diff --git a/d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg b/d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg
deleted file mode 100644
index 9c02fb37b..000000000
--- a/d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg
+++ /dev/null
@@ -1,550 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_3 Pages: 1 -->
-<!--zoomable 586 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 493;
-var viewHeight = 586;
-var sectionId = 'dynsection-4';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test_3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="43,-266.5 0,-266.5 0,-247.25 43,-247.25 43,-266.5"/>
-<text text-anchor="middle" x="21.5" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" target="_top" xlink:title="Adds an undirected edge from node u to node v in the tree.">
-<polygon fill="white" stroke="#666666" points="188,-577.75 79,-577.75 79,-536 188,-536 188,-577.75"/>
-<text text-anchor="start" x="87" y="-564.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-553" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-541.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.17,-266.88C21.45,-303.74 23.17,-434.18 79,-518.88 81.13,-522.11 83.65,-525.16 86.4,-528.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.8,-530.38 93.55,-534.51 88.5,-525.19 83.8,-530.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="339.75,-569.5 224,-569.5 224,-550.25 339.75,-550.25 339.75,-569.5"/>
-<text text-anchor="middle" x="281.88" y="-556" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge16_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge16_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.06,-266.77C21.07,-300.92 22.35,-415.33 79,-480.88 81.85,-484.17 219.92,-539.35 224,-540.88 228.74,-542.64 233.72,-544.42 238.69,-546.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.42,-549.41 248.01,-549.32 239.68,-542.79 237.42,-549.41"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="188,-277.75 79,-277.75 79,-236 188,-236 188,-277.75"/>
-<text text-anchor="start" x="87" y="-264.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::init</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.45,-256.88C50.47,-256.88 58.71,-256.88 67.3,-256.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.2,-260.38 77.2,-256.88 67.2,-253.38 67.2,-260.38"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" target="_top" xlink:title="This function returns the sum of node values in the simple path from from node_1 to node_2.">
-<polygon fill="white" stroke="#666666" points="188,-471.75 79,-471.75 79,-430 188,-430 188,-471.75"/>
-<text text-anchor="start" x="87" y="-458.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-447" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-435.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge17_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge17_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.11,-266.76C43.95,-294.7 89.53,-375.1 114.91,-419.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.73,-421.34 119.7,-428.31 117.82,-417.88 111.73,-421.34"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" target="_top" xlink:title="Set the values for all the nodes.">
-<polygon fill="white" stroke="#666666" points="188,-207.75 79,-207.75 79,-166 188,-166 188,-207.75"/>
-<text text-anchor="start" x="87" y="-194.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-183" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::set_node_val</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge23_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge23_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.26,-246.85C51.72,-238.28 71.71,-225.56 89.83,-214.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.25,-217.27 97.81,-208.95 87.49,-211.37 91.25,-217.27"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.12,-79.5 238.62,-79.5 238.62,-60.25 325.12,-60.25 325.12,-79.5"/>
-<text text-anchor="middle" x="281.88" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node18 -->
-<g id="edge25_Node000001_Node000018" class="edge">
-<title>Node1&#45;&gt;Node18</title>
-<g id="a_edge25_Node000001_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.74,-247.05C32.63,-227.49 50.48,-183.31 79,-156.88 121.06,-117.89 183.3,-94.7 227.53,-82.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.18,-85.64 236.91,-79.63 226.34,-78.89 228.18,-85.64"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" target="_top" xlink:title="This function updates the value at node with val.">
-<polygon fill="white" stroke="#666666" points="188,-51.75 79,-51.75 79,-10 188,-10 188,-51.75"/>
-<text text-anchor="start" x="87" y="-38.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-27" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-15.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node19 -->
-<g id="edge26_Node000001_Node000019" class="edge">
-<title>Node1&#45;&gt;Node19</title>
-<g id="a_edge26_Node000001_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.2,-246.88C32.12,-221.97 51.92,-155.52 79,-104.88 87.12,-89.69 97.98,-74.06 107.8,-61.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.42,-63.44 113.78,-53.39 104.89,-59.15 110.42,-63.44"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-557.98C196.05,-558.14 204.25,-558.3 212.37,-558.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.18,-561.97 222.25,-558.67 212.32,-554.97 212.18,-561.97"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="484.75,-422.75 375.75,-422.75 375.75,-381 484.75,-381 484.75,-422.75"/>
-<text text-anchor="start" x="383.75" y="-409.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-398" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-386.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.84,-278.2C155.51,-307.43 182.62,-359.03 224,-382.88 266.18,-407.18 321.48,-411.02 364.06,-409.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.12,-412.78 373.91,-408.75 363.74,-405.79 364.12,-412.78"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" target="_top" xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="white" stroke="#666666" points="336.38,-355.75 227.38,-355.75 227.38,-314 336.38,-314 336.38,-355.75"/>
-<text text-anchor="start" x="235.38" y="-342.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-331" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-319.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.12,-278.2C189.66,-286.54 207.65,-296.18 224,-304.88 226.08,-305.98 228.2,-307.11 230.35,-308.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.65,-311.31 239.13,-312.9 231.93,-305.12 228.65,-311.31"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" target="_top" xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="white" stroke="#666666" points="336.38,-277.75 227.38,-277.75 227.38,-236 336.38,-236 336.38,-277.75"/>
-<text text-anchor="start" x="235.38" y="-264.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge7_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge7_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-256.88C197.22,-256.88 206.7,-256.88 216,-256.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.69,-260.38 225.69,-256.88 215.69,-253.38 215.69,-260.38"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" target="_top" xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="white" stroke="#666666" points="336.38,-139.75 227.38,-139.75 227.38,-98 336.38,-98 336.38,-139.75"/>
-<text text-anchor="start" x="235.38" y="-126.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge9_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge9_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M166.37,-235.54C173.84,-229.88 181.5,-223.49 188,-216.88 207.19,-197.34 205.4,-186.97 224,-166.88 230.17,-160.21 237.24,-153.58 244.26,-147.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.5,-150.17 251.88,-141.04 241.98,-144.82 246.5,-150.17"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="336.38,-217.75 227.38,-217.75 227.38,-176 336.38,-176 336.38,-217.75"/>
-<text text-anchor="start" x="235.38" y="-204.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-193" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-181.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge11_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge11_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.52,-235.55C196.87,-231.31 207.84,-226.81 218.5,-222.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.7,-225.73 227.62,-218.7 217.04,-219.26 219.7,-225.73"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.49,-356.07C251.88,-365.55 261.01,-373.75 281.88,-373.75 293.94,-373.75 302.08,-371.01 306.29,-366.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.59,-368.1 308.86,-357.53 302.84,-366.24 309.59,-368.1"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge8_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge8_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.49,-278.07C251.88,-287.55 261.01,-295.75 281.88,-295.75 293.94,-295.75 302.08,-293.01 306.29,-288.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.59,-290.1 308.86,-279.53 302.84,-288.24 309.59,-290.1"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge10_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge10_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.49,-140.07C251.88,-149.55 261.01,-157.75 281.88,-157.75 293.94,-157.75 302.08,-155.01 306.29,-150.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.59,-152.1 308.86,-141.53 302.84,-150.24 309.59,-152.1"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="484.75,-178.75 375.75,-178.75 375.75,-137 484.75,-137 484.75,-178.75"/>
-<text text-anchor="start" x="383.75" y="-165.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-154" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-142.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge12_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge12_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-182.57C345.7,-180.14 355.28,-177.58 364.68,-175.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.36,-178.52 374.12,-172.56 363.56,-171.76 365.36,-178.52"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="484.75,-256.75 375.75,-256.75 375.75,-215 484.75,-215 484.75,-256.75"/>
-<text text-anchor="start" x="383.75" y="-243.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-232" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge14_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge14_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-211.18C345.7,-213.61 355.28,-216.17 364.68,-218.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="363.56,-221.99 374.12,-221.19 365.36,-215.23 363.56,-221.99"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node10 -->
-<g id="edge13_Node000010_Node000010" class="edge">
-<title>Node10&#45;&gt;Node10</title>
-<g id="a_edge13_Node000010_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M402.86,-179.07C400.26,-188.55 409.38,-196.75 430.25,-196.75 442.31,-196.75 450.45,-194.01 454.67,-189.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.96,-191.1 457.23,-180.53 451.21,-189.24 457.96,-191.1"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node11 -->
-<g id="edge15_Node000011_Node000011" class="edge">
-<title>Node11&#45;&gt;Node11</title>
-<g id="a_edge15_Node000011_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M402.86,-257.07C400.26,-266.55 409.38,-274.75 430.25,-274.75 442.31,-274.75 450.45,-272.01 454.67,-267.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.96,-269.1 457.23,-258.53 451.21,-267.24 457.96,-269.1"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" target="_top" xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="white" stroke="#666666" points="336.38,-471.75 227.38,-471.75 227.38,-430 336.38,-430 336.38,-471.75"/>
-<text text-anchor="start" x="235.38" y="-458.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-447" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-435.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge18_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge18_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-450.88C197.22,-450.88 206.7,-450.88 216,-450.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.69,-454.38 225.69,-450.88 215.69,-447.38 215.69,-454.38"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" target="_top" xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="white" stroke="#666666" points="336.38,-531.75 227.38,-531.75 227.38,-490 336.38,-490 336.38,-531.75"/>
-<text text-anchor="start" x="235.38" y="-518.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-507" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-495.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node15 -->
-<g id="edge21_Node000012_Node000015" class="edge">
-<title>Node12&#45;&gt;Node15</title>
-<g id="a_edge21_Node000012_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.52,-472.2C196.87,-476.44 207.84,-480.94 218.5,-485.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.04,-488.49 227.62,-489.05 219.7,-482.02 217.04,-488.49"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node5 -->
-<g id="edge19_Node000013_Node000005" class="edge">
-<title>Node13&#45;&gt;Node5</title>
-<g id="a_edge19_Node000013_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-432.91C345.7,-429.84 355.28,-426.64 364.68,-423.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.78,-426.81 374.15,-420.32 363.55,-420.18 365.78,-426.81"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="459.62,-460.5 400.88,-460.5 400.88,-441.25 459.62,-441.25 459.62,-460.5"/>
-<text text-anchor="middle" x="430.25" y="-447" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge20_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge20_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-450.88C354.01,-450.88 373.08,-450.88 389.35,-450.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="389.13,-454.38 399.13,-450.88 389.13,-447.38 389.13,-454.38"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="484.75,-531.75 375.75,-531.75 375.75,-490 484.75,-490 484.75,-531.75"/>
-<text text-anchor="start" x="383.75" y="-518.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-507" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-495.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge22_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge22_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-510.88C345.6,-510.88 355.08,-510.88 364.37,-510.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.07,-514.38 374.07,-510.88 364.07,-507.38 364.07,-514.38"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge24_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge24_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.59,-165.52C166.43,-155.78 178.02,-143.96 188,-132.88 204.91,-114.1 203.2,-103.22 224,-88.88 226.09,-87.43 228.3,-86.1 230.58,-84.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.01,-88.05 239.58,-80.64 229.04,-81.71 232.01,-88.05"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" target="_top" xlink:title="Update the value at a node.">
-<polygon fill="white" stroke="#666666" points="336.38,-41.75 227.38,-41.75 227.38,0 336.38,0 336.38,-41.75"/>
-<text text-anchor="start" x="235.38" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::update</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge27_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge27_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-27.21C197.22,-26.59 206.7,-25.94 216,-25.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.96,-28.82 225.7,-24.64 215.48,-21.83 215.96,-28.82"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph_org.svg b/d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph_org.svg
deleted file mode 100644
index a66c27dd3..000000000
--- a/d2/de9/heavy__light__decomposition_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph_org.svg
+++ /dev/null
@@ -1,467 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_3 Pages: 1 -->
-<svg width="493pt" height="586pt"
- viewBox="0.00 0.00 492.75 585.75" 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 581.75)">
-<title>test_3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="43,-266.5 0,-266.5 0,-247.25 43,-247.25 43,-266.5"/>
-<text text-anchor="middle" x="21.5" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" target="_top" xlink:title="Adds an undirected edge from node u to node v in the tree.">
-<polygon fill="white" stroke="#666666" points="188,-577.75 79,-577.75 79,-536 188,-536 188,-577.75"/>
-<text text-anchor="start" x="87" y="-564.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-553" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-541.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.17,-266.88C21.45,-303.74 23.17,-434.18 79,-518.88 81.13,-522.11 83.65,-525.16 86.4,-528.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.8,-530.38 93.55,-534.51 88.5,-525.19 83.8,-530.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="339.75,-569.5 224,-569.5 224,-550.25 339.75,-550.25 339.75,-569.5"/>
-<text text-anchor="middle" x="281.88" y="-556" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge16_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge16_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.06,-266.77C21.07,-300.92 22.35,-415.33 79,-480.88 81.85,-484.17 219.92,-539.35 224,-540.88 228.74,-542.64 233.72,-544.42 238.69,-546.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.42,-549.41 248.01,-549.32 239.68,-542.79 237.42,-549.41"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="188,-277.75 79,-277.75 79,-236 188,-236 188,-277.75"/>
-<text text-anchor="start" x="87" y="-264.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::init</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.45,-256.88C50.47,-256.88 58.71,-256.88 67.3,-256.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.2,-260.38 77.2,-256.88 67.2,-253.38 67.2,-260.38"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" target="_top" xlink:title="This function returns the sum of node values in the simple path from from node_1 to node_2.">
-<polygon fill="white" stroke="#666666" points="188,-471.75 79,-471.75 79,-430 188,-430 188,-471.75"/>
-<text text-anchor="start" x="87" y="-458.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-447" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-435.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge17_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge17_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.11,-266.76C43.95,-294.7 89.53,-375.1 114.91,-419.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.73,-421.34 119.7,-428.31 117.82,-417.88 111.73,-421.34"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" target="_top" xlink:title="Set the values for all the nodes.">
-<polygon fill="white" stroke="#666666" points="188,-207.75 79,-207.75 79,-166 188,-166 188,-207.75"/>
-<text text-anchor="start" x="87" y="-194.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-183" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::set_node_val</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge23_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge23_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.26,-246.85C51.72,-238.28 71.71,-225.56 89.83,-214.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.25,-217.27 97.81,-208.95 87.49,-211.37 91.25,-217.27"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.12,-79.5 238.62,-79.5 238.62,-60.25 325.12,-60.25 325.12,-79.5"/>
-<text text-anchor="middle" x="281.88" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node18 -->
-<g id="edge25_Node000001_Node000018" class="edge">
-<title>Node1&#45;&gt;Node18</title>
-<g id="a_edge25_Node000001_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.74,-247.05C32.63,-227.49 50.48,-183.31 79,-156.88 121.06,-117.89 183.3,-94.7 227.53,-82.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.18,-85.64 236.91,-79.63 226.34,-78.89 228.18,-85.64"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" target="_top" xlink:title="This function updates the value at node with val.">
-<polygon fill="white" stroke="#666666" points="188,-51.75 79,-51.75 79,-10 188,-10 188,-51.75"/>
-<text text-anchor="start" x="87" y="-38.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="87" y="-27" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="133.5" y="-15.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node19 -->
-<g id="edge26_Node000001_Node000019" class="edge">
-<title>Node1&#45;&gt;Node19</title>
-<g id="a_edge26_Node000001_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.2,-246.88C32.12,-221.97 51.92,-155.52 79,-104.88 87.12,-89.69 97.98,-74.06 107.8,-61.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.42,-63.44 113.78,-53.39 104.89,-59.15 110.42,-63.44"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-557.98C196.05,-558.14 204.25,-558.3 212.37,-558.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.18,-561.97 222.25,-558.67 212.32,-554.97 212.18,-561.97"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="484.75,-422.75 375.75,-422.75 375.75,-381 484.75,-381 484.75,-422.75"/>
-<text text-anchor="start" x="383.75" y="-409.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-398" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-386.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.84,-278.2C155.51,-307.43 182.62,-359.03 224,-382.88 266.18,-407.18 321.48,-411.02 364.06,-409.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.12,-412.78 373.91,-408.75 363.74,-405.79 364.12,-412.78"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" target="_top" xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="white" stroke="#666666" points="336.38,-355.75 227.38,-355.75 227.38,-314 336.38,-314 336.38,-355.75"/>
-<text text-anchor="start" x="235.38" y="-342.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-331" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-319.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.12,-278.2C189.66,-286.54 207.65,-296.18 224,-304.88 226.08,-305.98 228.2,-307.11 230.35,-308.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.65,-311.31 239.13,-312.9 231.93,-305.12 228.65,-311.31"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" target="_top" xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="white" stroke="#666666" points="336.38,-277.75 227.38,-277.75 227.38,-236 336.38,-236 336.38,-277.75"/>
-<text text-anchor="start" x="235.38" y="-264.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge7_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge7_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-256.88C197.22,-256.88 206.7,-256.88 216,-256.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.69,-260.38 225.69,-256.88 215.69,-253.38 215.69,-260.38"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" target="_top" xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="white" stroke="#666666" points="336.38,-139.75 227.38,-139.75 227.38,-98 336.38,-98 336.38,-139.75"/>
-<text text-anchor="start" x="235.38" y="-126.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge9_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge9_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M166.37,-235.54C173.84,-229.88 181.5,-223.49 188,-216.88 207.19,-197.34 205.4,-186.97 224,-166.88 230.17,-160.21 237.24,-153.58 244.26,-147.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.5,-150.17 251.88,-141.04 241.98,-144.82 246.5,-150.17"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="336.38,-217.75 227.38,-217.75 227.38,-176 336.38,-176 336.38,-217.75"/>
-<text text-anchor="start" x="235.38" y="-204.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-193" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-181.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge11_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge11_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.52,-235.55C196.87,-231.31 207.84,-226.81 218.5,-222.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.7,-225.73 227.62,-218.7 217.04,-219.26 219.7,-225.73"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.49,-356.07C251.88,-365.55 261.01,-373.75 281.88,-373.75 293.94,-373.75 302.08,-371.01 306.29,-366.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.59,-368.1 308.86,-357.53 302.84,-366.24 309.59,-368.1"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge8_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge8_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.49,-278.07C251.88,-287.55 261.01,-295.75 281.88,-295.75 293.94,-295.75 302.08,-293.01 306.29,-288.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.59,-290.1 308.86,-279.53 302.84,-288.24 309.59,-290.1"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge10_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge10_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.49,-140.07C251.88,-149.55 261.01,-157.75 281.88,-157.75 293.94,-157.75 302.08,-155.01 306.29,-150.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.59,-152.1 308.86,-141.53 302.84,-150.24 309.59,-152.1"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="484.75,-178.75 375.75,-178.75 375.75,-137 484.75,-137 484.75,-178.75"/>
-<text text-anchor="start" x="383.75" y="-165.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-154" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-142.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge12_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge12_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-182.57C345.7,-180.14 355.28,-177.58 364.68,-175.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.36,-178.52 374.12,-172.56 363.56,-171.76 365.36,-178.52"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="484.75,-256.75 375.75,-256.75 375.75,-215 484.75,-215 484.75,-256.75"/>
-<text text-anchor="start" x="383.75" y="-243.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-232" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge14_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge14_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-211.18C345.7,-213.61 355.28,-216.17 364.68,-218.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="363.56,-221.99 374.12,-221.19 365.36,-215.23 363.56,-221.99"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node10 -->
-<g id="edge13_Node000010_Node000010" class="edge">
-<title>Node10&#45;&gt;Node10</title>
-<g id="a_edge13_Node000010_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M402.86,-179.07C400.26,-188.55 409.38,-196.75 430.25,-196.75 442.31,-196.75 450.45,-194.01 454.67,-189.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.96,-191.1 457.23,-180.53 451.21,-189.24 457.96,-191.1"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node11 -->
-<g id="edge15_Node000011_Node000011" class="edge">
-<title>Node11&#45;&gt;Node11</title>
-<g id="a_edge15_Node000011_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M402.86,-257.07C400.26,-266.55 409.38,-274.75 430.25,-274.75 442.31,-274.75 450.45,-272.01 454.67,-267.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.96,-269.1 457.23,-258.53 451.21,-267.24 457.96,-269.1"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" target="_top" xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="white" stroke="#666666" points="336.38,-471.75 227.38,-471.75 227.38,-430 336.38,-430 336.38,-471.75"/>
-<text text-anchor="start" x="235.38" y="-458.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-447" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-435.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge18_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge18_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-450.88C197.22,-450.88 206.7,-450.88 216,-450.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.69,-454.38 225.69,-450.88 215.69,-447.38 215.69,-454.38"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" target="_top" xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="white" stroke="#666666" points="336.38,-531.75 227.38,-531.75 227.38,-490 336.38,-490 336.38,-531.75"/>
-<text text-anchor="start" x="235.38" y="-518.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-507" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-495.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node15 -->
-<g id="edge21_Node000012_Node000015" class="edge">
-<title>Node12&#45;&gt;Node15</title>
-<g id="a_edge21_Node000012_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.52,-472.2C196.87,-476.44 207.84,-480.94 218.5,-485.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.04,-488.49 227.62,-489.05 219.7,-482.02 217.04,-488.49"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node5 -->
-<g id="edge19_Node000013_Node000005" class="edge">
-<title>Node13&#45;&gt;Node5</title>
-<g id="a_edge19_Node000013_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-432.91C345.7,-429.84 355.28,-426.64 364.68,-423.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.78,-426.81 374.15,-420.32 363.55,-420.18 365.78,-426.81"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="459.62,-460.5 400.88,-460.5 400.88,-441.25 459.62,-441.25 459.62,-460.5"/>
-<text text-anchor="middle" x="430.25" y="-447" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge20_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge20_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-450.88C354.01,-450.88 373.08,-450.88 389.35,-450.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="389.13,-454.38 399.13,-450.88 389.13,-447.38 389.13,-454.38"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="484.75,-531.75 375.75,-531.75 375.75,-490 484.75,-490 484.75,-531.75"/>
-<text text-anchor="start" x="383.75" y="-518.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="383.75" y="-507" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="430.25" y="-495.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge22_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge22_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.55,-510.88C345.6,-510.88 355.08,-510.88 364.37,-510.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.07,-514.38 374.07,-510.88 364.07,-507.38 364.07,-514.38"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge24_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge24_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.59,-165.52C166.43,-155.78 178.02,-143.96 188,-132.88 204.91,-114.1 203.2,-103.22 224,-88.88 226.09,-87.43 228.3,-86.1 230.58,-84.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.01,-88.05 239.58,-80.64 229.04,-81.71 232.01,-88.05"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" target="_top" xlink:title="Update the value at a node.">
-<polygon fill="white" stroke="#666666" points="336.38,-41.75 227.38,-41.75 227.38,0 336.38,0 336.38,-41.75"/>
-<text text-anchor="start" x="235.38" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="235.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="281.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::update</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge27_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge27_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.17,-27.21C197.22,-26.59 206.7,-25.94 216,-25.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.96,-28.82 225.7,-24.64 215.48,-21.83 215.96,-28.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d2/de9/heavy__light__decomposition_8cpp_source.html b/d2/de9/heavy__light__decomposition_8cpp_source.html
new file mode 100644
index 000000000..6010c0571
--- /dev/null
+++ b/d2/de9/heavy__light__decomposition_8cpp_source.html
@@ -0,0 +1,634 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: range_queries/heavy_light_decomposition.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d2/de9/heavy__light__decomposition_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">heavy_light_decomposition.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d2/de9/heavy__light__decomposition_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="preprocessor">#include &lt;list&gt;</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="preprocessor">#include &lt;numeric&gt;</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="preprocessor">#include &lt;string&gt;</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d69/namespacerange__queries.html">range_queries</a> {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../db/d6f/namespaceheavy__light__decomposition.html">heavy_light_decomposition</a> {</div>
+<div class="foldopen" id="foldopen00078" data-start="{" data-end="};">
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"><a class="line" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">   78</a></span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> X&gt; <span class="keyword">class </span><a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree</a> {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>  <span class="comment">//</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span><span class="keyword">private</span>:</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>  std::vector&lt;std::list&lt;int&gt;&gt;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"><a class="line" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab1aeaefa1bd97b867c652ba916fbdb43">   83</a></span>      <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab1aeaefa1bd97b867c652ba916fbdb43">t_adj</a>;         </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"><a class="line" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">   84</a></span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>, </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"><a class="line" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab2ab020f798d00be2613ecf63074b7c1">   85</a></span>      <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab2ab020f798d00be2613ecf63074b7c1">t_maxlift</a>;     </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>  std::vector&lt;std::vector&lt;int&gt;&gt;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"><a class="line" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">   87</a></span>      <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">t_par</a>;                </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"><a class="line" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">   88</a></span>  std::vector&lt;int&gt; <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">t_depth</a>, </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"><a class="line" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ada1494fccbc7f1f07b2f9be9f7e07ad5">   89</a></span>      <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ada1494fccbc7f1f07b2f9be9f7e07ad5">t_size</a>; </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"><a class="line" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa6c37e840355b9fb2105181c578694e8">   91</a></span>  <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa6c37e840355b9fb2105181c578694e8">t_root</a>;           </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a135b7952593c9b1aae38fcaf1cc1abf7">   92</a></span>  std::vector&lt;X&gt; <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a135b7952593c9b1aae38fcaf1cc1abf7">t_val</a>; </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>  <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt; <span class="keyword">friend</span> <span class="keyword">class </span><a class="code hl_class" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">HLD</a>;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="foldopen" id="foldopen00101" data-start="{" data-end="}">
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"><a class="line" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460">  101</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460">dfs_size</a>(<span class="keywordtype">int</span> u, <span class="keywordtype">int</span> p = -1) {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> &amp;v : <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab1aeaefa1bd97b867c652ba916fbdb43">t_adj</a>[u]) {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>      <span class="keywordflow">if</span> (v ^ p) {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460">dfs_size</a>(v, u);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ada1494fccbc7f1f07b2f9be9f7e07ad5">t_size</a>[u] += <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ada1494fccbc7f1f07b2f9be9f7e07ad5">t_size</a>[v];</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>      }</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    }</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>  }</div>
+</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="foldopen" id="foldopen00116" data-start="{" data-end="}">
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"><a class="line" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4">  116</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4">dfs_lca</a>(<span class="keywordtype">int</span> u, <span class="keywordtype">int</span> p = -1) {</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">t_par</a>[u][0] = p;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <span class="keywordflow">if</span> (p != -1) {</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>      <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">t_depth</a>[u] = 1 + <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">t_depth</a>[p];</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    }</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 1; k &lt; <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab2ab020f798d00be2613ecf63074b7c1">t_maxlift</a>; k++) {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>      <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">t_par</a>[u][k - 1] != -1) {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">t_par</a>[u][k] = <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">t_par</a>[<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">t_par</a>[u][k - 1]][k - 1];</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>      }</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    }</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> &amp;v : <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab1aeaefa1bd97b867c652ba916fbdb43">t_adj</a>[u]) {</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>      <span class="keywordflow">if</span> (v ^ p) {</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4">dfs_lca</a>(v, u);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>      }</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    }</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>  }</div>
+</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span> </div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span><span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00140" data-start="{" data-end="}">
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"><a class="line" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1">  140</a></span>  <span class="keyword">explicit</span> <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1">Tree</a>(<span class="keywordtype">int</span> nodes)</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>      : <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>(nodes), <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab2ab020f798d00be2613ecf63074b7c1">t_maxlift</a>(static_cast&lt;int&gt;(floor(log2(nodes))) + 1) {</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    <span class="comment">/* Initialize and resize all the vectors */</span></div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa6c37e840355b9fb2105181c578694e8">t_root</a> = 0; <span class="comment">/* Default */</span></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab1aeaefa1bd97b867c652ba916fbdb43">t_adj</a>.resize(<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>);</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">t_par</a>.assign(<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>, std::vector&lt;int&gt;(<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab2ab020f798d00be2613ecf63074b7c1">t_maxlift</a>, -1));</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">t_depth</a>.assign(<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>, 0);</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ada1494fccbc7f1f07b2f9be9f7e07ad5">t_size</a>.assign(<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>, 1);</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a135b7952593c9b1aae38fcaf1cc1abf7">t_val</a>.resize(<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>);</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>  }</div>
+</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
+<div class="foldopen" id="foldopen00157" data-start="{" data-end="}">
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"><a class="line" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d">  157</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d">add_edge</a>(<span class="keyword">const</span> <span class="keywordtype">int</span> u, <span class="keyword">const</span> <span class="keywordtype">int</span> v) {</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab1aeaefa1bd97b867c652ba916fbdb43">t_adj</a>[u].push_back(v);</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab1aeaefa1bd97b867c652ba916fbdb43">t_adj</a>[v].push_back(u);</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>  }</div>
+</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span> </div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"><a class="line" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0">  167</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0">change_root</a>(<span class="keywordtype">int</span> new_root) { <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa6c37e840355b9fb2105181c578694e8">t_root</a> = new_root; }</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span> </div>
+<div class="foldopen" id="foldopen00175" data-start="{" data-end="}">
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"><a class="line" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70">  175</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70">set_node_val</a>(<span class="keyword">const</span> std::vector&lt;X&gt; &amp;node_val) {</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    assert(<span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(node_val.size()) == <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>);</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a135b7952593c9b1aae38fcaf1cc1abf7">t_val</a> = node_val;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>  }</div>
+</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span> </div>
+<div class="foldopen" id="foldopen00186" data-start="{" data-end="}">
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"><a class="line" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc">  186</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc">init</a>() {</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    assert(<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a> &gt; 0);</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460">dfs_size</a>(<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa6c37e840355b9fb2105181c578694e8">t_root</a>);</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4">dfs_lca</a>(<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa6c37e840355b9fb2105181c578694e8">t_root</a>);</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>  }</div>
+</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span> </div>
+<div class="foldopen" id="foldopen00200" data-start="{" data-end="}">
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"><a class="line" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3">  200</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3">lift</a>(<span class="keywordtype">int</span> *<span class="keyword">const</span> p, <span class="keywordtype">int</span> dist) {</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; k &lt; <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab2ab020f798d00be2613ecf63074b7c1">t_maxlift</a>; k++) {</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>      <span class="keywordflow">if</span> (*p == -1) {</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>      }</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>      <span class="keywordflow">if</span> (dist &amp; 1) {</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>        *p = <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">t_par</a>[*p][k];</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>      }</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>      dist &gt;&gt;= 1;</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    }</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>  }</div>
+</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span> </div>
+<div class="foldopen" id="foldopen00218" data-start="{" data-end="}">
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"><a class="line" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a8f7bca1746d40f21ad832fcea59aa6c6">  218</a></span>  <span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a8f7bca1746d40f21ad832fcea59aa6c6">kth_ancestor</a>(<span class="keywordtype">int</span> p, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;dist) {</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3">lift</a>(&amp;p, dist);</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    <span class="keywordflow">return</span> p;</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>  }</div>
+</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span> </div>
+<div class="foldopen" id="foldopen00229" data-start="{" data-end="}">
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"><a class="line" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4">  229</a></span>  <span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4">lca</a>(<span class="keywordtype">int</span> a, <span class="keywordtype">int</span> b) {</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    assert(a &gt;= 0 and b &gt;= 0 and a &lt; <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a> and b &lt; <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">t_nodes</a>);</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">t_depth</a>[a] &gt; <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">t_depth</a>[b]) {</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>      <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3">lift</a>(&amp;a, <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">t_depth</a>[a] - <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">t_depth</a>[b]);</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    }</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">t_depth</a>[b] &gt; <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">t_depth</a>[a]) {</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>      <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3">lift</a>(&amp;b, <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">t_depth</a>[b] - <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">t_depth</a>[a]);</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    }</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    <span class="keywordflow">if</span> (a == b) {</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>      <span class="keywordflow">return</span> a;</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    }</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab2ab020f798d00be2613ecf63074b7c1">t_maxlift</a> - 1; k &gt;= 0; k--) {</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>      <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">t_par</a>[a][k] != <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">t_par</a>[b][k]) {</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>        a = <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">t_par</a>[a][k];</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>        b = <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">t_par</a>[b][k];</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>      }</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    }</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">t_par</a>[a][0];</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>  }</div>
+</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>};</div>
+</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span> </div>
+<div class="foldopen" id="foldopen00254" data-start="{" data-end="};">
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"><a class="line" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">  254</a></span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> X&gt; <span class="keyword">class </span><a class="code hl_class" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">SG</a> {</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span><span class="keyword">private</span>:</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"><a class="line" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afbf8a9cb9449d5ca844f4e141a801e6a">  262</a></span>  std::vector&lt;X&gt; <a class="code hl_variable" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afbf8a9cb9449d5ca844f4e141a801e6a">s_tree</a>; </div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"><a class="line" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ac6d912bbfafa3a7509f66bbc1729ca25">  263</a></span>  <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ac6d912bbfafa3a7509f66bbc1729ca25">s_size</a>;            </div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"><a class="line" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5">  264</a></span>  X <a class="code hl_variable" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5">sret_init</a> = 0;       </div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>  <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt; <span class="keyword">friend</span> <span class="keyword">class </span><a class="code hl_class" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">HLD</a>;</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span> </div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"><a class="line" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74">  274</a></span>  X <a class="code hl_function" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74">combine</a>(X lhs, X rhs) { <span class="keywordflow">return</span> lhs + rhs; }</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span> </div>
+<div class="foldopen" id="foldopen00282" data-start="{" data-end="}">
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"><a class="line" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1">  282</a></span>  <span class="keyword">explicit</span> <a class="code hl_function" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1">SG</a>(<span class="keywordtype">int</span> size) {</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    <a class="code hl_variable" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ac6d912bbfafa3a7509f66bbc1729ca25">s_size</a> = size;</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>    <a class="code hl_variable" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afbf8a9cb9449d5ca844f4e141a801e6a">s_tree</a>.assign(2 * <a class="code hl_variable" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ac6d912bbfafa3a7509f66bbc1729ca25">s_size</a>, 0ll);</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>  }</div>
+</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span> </div>
+<div class="foldopen" id="foldopen00293" data-start="{" data-end="}">
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"><a class="line" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c">  293</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c">update</a>(<span class="keywordtype">int</span> p, X v) {</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>    <span class="keywordflow">for</span> (p += <a class="code hl_variable" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ac6d912bbfafa3a7509f66bbc1729ca25">s_size</a>; p &gt; 0; p &gt;&gt;= 1) {</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>      <a class="code hl_variable" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afbf8a9cb9449d5ca844f4e141a801e6a">s_tree</a>[p] += v;</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>    }</div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>  }</div>
+</div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span> </div>
+<div class="foldopen" id="foldopen00305" data-start="{" data-end="}">
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"><a class="line" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a1fda852e6e522707fd97f61cdb0a2591">  305</a></span>  X <a class="code hl_function" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a1fda852e6e522707fd97f61cdb0a2591">query</a>(<span class="keywordtype">int</span> l, <span class="keywordtype">int</span> r) {</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>    X lhs = <a class="code hl_variable" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5">sret_init</a>, rhs = <a class="code hl_variable" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5">sret_init</a>;</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>    <span class="keywordflow">for</span> (l += <a class="code hl_variable" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ac6d912bbfafa3a7509f66bbc1729ca25">s_size</a>, r += <a class="code hl_variable" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ac6d912bbfafa3a7509f66bbc1729ca25">s_size</a> + 1; l &lt; r; l &gt;&gt;= 1, r &gt;&gt;= 1) {</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>      <span class="keywordflow">if</span> (l &amp; 1) {</div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>        lhs = <a class="code hl_function" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74">combine</a>(lhs, <a class="code hl_variable" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afbf8a9cb9449d5ca844f4e141a801e6a">s_tree</a>[l++]);</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>      }</div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>      <span class="keywordflow">if</span> (r &amp; 1) {</div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>        rhs = <a class="code hl_function" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74">combine</a>(<a class="code hl_variable" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afbf8a9cb9449d5ca844f4e141a801e6a">s_tree</a>[--r], rhs);</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>      }</div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>    }</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74">combine</a>(lhs, rhs);</div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>  }</div>
+</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span> </div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"><a class="line" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ad3b942be27a1b0fe3cff6cb6edf01294">  329</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ad3b942be27a1b0fe3cff6cb6edf01294">set_sret_init</a>(X new_sret_init) { <a class="code hl_variable" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5">sret_init</a> = new_sret_init; }</div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>};</div>
+</div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span> </div>
+<div class="foldopen" id="foldopen00336" data-start="{" data-end="};">
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"><a class="line" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">  336</a></span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> X&gt; <span class="keyword">class </span><a class="code hl_class" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">HLD</a> : <span class="keyword">public</span> <a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree</a>&lt;X&gt;, <span class="keyword">public</span> <a class="code hl_class" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">SG</a>&lt;X&gt; {</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span><span class="keyword">private</span>:</div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"><a class="line" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a722cc7cf2c3e4d15583601a48b09776f">  338</a></span>  <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a722cc7cf2c3e4d15583601a48b09776f">label</a>;                </div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"><a class="line" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#aa86a91ae0cd7898990a8170a2f2c9cda">  339</a></span>  std::vector&lt;int&gt; <a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#aa86a91ae0cd7898990a8170a2f2c9cda">h_label</a>, </div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"><a class="line" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a84424f180f12b514eaab57a6aa20b104">  340</a></span>      <a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a84424f180f12b514eaab57a6aa20b104">h_heavychlid</a>,         </div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"><a class="line" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725">  341</a></span>      <a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725">h_parent</a>;             </div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span> </div>
+<div class="foldopen" id="foldopen00350" data-start="{" data-end="}">
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"><a class="line" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8">  350</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8">dfs_hc</a>(<span class="keywordtype">int</span> u, <span class="keywordtype">int</span> p = -1) {</div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>    <span class="keywordtype">int</span> hc_size = -1, hc_id = -1;</div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> &amp;v : <a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_adj</a>[u]) {</div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>      <span class="keywordflow">if</span> (v ^ p) {</div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>        <a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8">dfs_hc</a>(v, u);</div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>        <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_size</a>[v] &gt; hc_size) {</div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>          hc_size = <a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_size</a>[v];</div>
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>          hc_id = v;</div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>        }</div>
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>      }</div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>    }</div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>    <a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a84424f180f12b514eaab57a6aa20b104">h_heavychlid</a>[u] = hc_id;</div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>  }</div>
+</div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span> </div>
+<div class="foldopen" id="foldopen00371" data-start="{" data-end="}">
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"><a class="line" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a">  371</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a">dfs_par</a>(<span class="keywordtype">int</span> u, <span class="keywordtype">int</span> p = -1) {</div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a84424f180f12b514eaab57a6aa20b104">h_heavychlid</a>[u] != -1) {</div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>      <a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725">h_parent</a>[<a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a84424f180f12b514eaab57a6aa20b104">h_heavychlid</a>[u]] = <a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725">h_parent</a>[u];</div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>      <a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a">dfs_par</a>(<a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a84424f180f12b514eaab57a6aa20b104">h_heavychlid</a>[u], u);</div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>    }</div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> &amp;v : <a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_adj</a>[u]) {</div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>      <span class="keywordflow">if</span> (v ^ p and v ^ <a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a84424f180f12b514eaab57a6aa20b104">h_heavychlid</a>[u]) {</div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>        <a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a">dfs_par</a>(v, u);</div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>      }</div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>    }</div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>  }</div>
+</div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span> </div>
+<div class="foldopen" id="foldopen00390" data-start="{" data-end="}">
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"><a class="line" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8">  390</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8">dfs_labels</a>(<span class="keywordtype">int</span> u, <span class="keywordtype">int</span> p = -1) {</div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>    <a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#aa86a91ae0cd7898990a8170a2f2c9cda">h_label</a>[u] = <a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a722cc7cf2c3e4d15583601a48b09776f">label</a>++;</div>
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a84424f180f12b514eaab57a6aa20b104">h_heavychlid</a>[u] != -1) {</div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>      <a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8">dfs_labels</a>(<a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a84424f180f12b514eaab57a6aa20b104">h_heavychlid</a>[u], u);</div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>    }</div>
+<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> &amp;v : <a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_adj</a>[u]) {</div>
+<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>      <span class="keywordflow">if</span> (v ^ p and v ^ <a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a84424f180f12b514eaab57a6aa20b104">h_heavychlid</a>[u]) {</div>
+<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>        <a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8">dfs_labels</a>(v, u);</div>
+<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>      }</div>
+<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>    }</div>
+<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span>  }</div>
+</div>
+<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span> </div>
+<div class="foldopen" id="foldopen00409" data-start="{" data-end="}">
+<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"><a class="line" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24">  409</a></span>  X <a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24">chain_query</a>(<span class="keywordtype">int</span> a, <span class="keywordtype">int</span> b) {</div>
+<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>    X ret = <a class="code hl_class" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">SG&lt;X&gt;::sret_init</a>;</div>
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>    <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_depth</a>[a] &lt; <a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_depth</a>[b]) {</div>
+<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>      std::swap(a, b);</div>
+<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>    }</div>
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>    <span class="keywordflow">while</span> (<a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_depth</a>[a] &gt;= <a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_depth</a>[b]) {</div>
+<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>      <span class="keywordtype">int</span> l = <a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#aa86a91ae0cd7898990a8170a2f2c9cda">h_label</a>[<a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725">h_parent</a>[a]];</div>
+<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>      <span class="keywordtype">int</span> r = <a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#aa86a91ae0cd7898990a8170a2f2c9cda">h_label</a>[a];</div>
+<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>      <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_depth</a>[<a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725">h_parent</a>[a]] &lt; <a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_depth</a>[b]) {</div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>        l += <a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_depth</a>[b] - <a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_depth</a>[<a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725">h_parent</a>[a]];</div>
+<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>      }</div>
+<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>      ret = <a class="code hl_function" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74">SG&lt;X&gt;::combine</a>(ret, <a class="code hl_class" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">SG&lt;X&gt;::query</a>(l, r));</div>
+<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>      a = <a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_par</a>[<a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725">h_parent</a>[a]][0];</div>
+<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>      <span class="keywordflow">if</span> (a == -1) {</div>
+<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>        <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span>      }</div>
+<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span>    }</div>
+<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span>    <span class="keywordflow">return</span> ret;</div>
+<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>  }</div>
+</div>
+<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span> </div>
+<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span><span class="keyword">public</span>:</div>
+<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>  <span class="keyword">explicit</span> <a class="code hl_class" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">HLD&lt;X&gt;</a>(<span class="keywordtype">int</span> nodes) : <a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree</a>&lt;X&gt;(nodes), <a class="code hl_class" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">SG</a>&lt;X&gt;(nodes) {</div>
+<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>    <span class="comment">/* Initialization and resize vectors */</span></div>
+<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span>    <a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a722cc7cf2c3e4d15583601a48b09776f">label</a> = 0;</div>
+<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>    <a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#aa86a91ae0cd7898990a8170a2f2c9cda">h_label</a>.assign(<a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_nodes</a>, -1);</div>
+<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>    <a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a84424f180f12b514eaab57a6aa20b104">h_heavychlid</a>.assign(<a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_nodes</a>, -1);</div>
+<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>    <a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725">h_parent</a>.resize(<a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_nodes</a>);</div>
+<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>    iota(<a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725">h_parent</a>.begin(), <a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725">h_parent</a>.end(), 0);</div>
+<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>  }</div>
+<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span> </div>
+<div class="foldopen" id="foldopen00450" data-start="{" data-end="}">
+<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"><a class="line" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828">  450</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828">init</a>() {</div>
+<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span>    <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc">Tree&lt;X&gt;::init</a>();</div>
+<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span> </div>
+<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>    <span class="comment">// Fill the heavy child, greatest parent, and labels</span></div>
+<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>    <a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a722cc7cf2c3e4d15583601a48b09776f">label</a> = 0;</div>
+<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>    <a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8">dfs_hc</a>(<a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_root</a>);</div>
+<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>    <a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a">dfs_par</a>(<a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_root</a>);</div>
+<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>    <a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8">dfs_labels</a>(<a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_root</a>);</div>
+<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span> </div>
+<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span>    <span class="comment">// Segment Tree Initialization</span></div>
+<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; Tree&lt;X&gt;::t_nodes; i++) {</div>
+<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>      <a class="code hl_class" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">SG&lt;X&gt;::s_tree</a>[<a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#aa86a91ae0cd7898990a8170a2f2c9cda">h_label</a>[i] + <a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_nodes</a>] = <a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_val</a>[i];</div>
+<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>    }</div>
+<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = <a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_nodes</a> - 1; i &gt; 0; i--) {</div>
+<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span>      <a class="code hl_class" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">SG&lt;X&gt;::s_tree</a>[i] =</div>
+<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span>          <a class="code hl_function" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74">SG&lt;X&gt;::combine</a>(<a class="code hl_class" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">SG&lt;X&gt;::s_tree</a>[i &lt;&lt; 1], <a class="code hl_class" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">SG&lt;X&gt;::s_tree</a>[i &lt;&lt; 1 | 1]);</div>
+<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span>    }</div>
+<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span>  }</div>
+</div>
+<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span> </div>
+<div class="foldopen" id="foldopen00475" data-start="{" data-end="}">
+<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"><a class="line" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57">  475</a></span>  <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57">update</a>(<span class="keywordtype">int</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, X val) {</div>
+<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span>    X diff = val - <a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_val</a>[<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>];</div>
+<div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span>    <a class="code hl_function" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c">SG&lt;X&gt;::update</a>(<a class="code hl_variable" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#aa86a91ae0cd7898990a8170a2f2c9cda">h_label</a>[<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>], diff);</div>
+<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>    <a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_val</a>[<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>] = val;</div>
+<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span>  }</div>
+</div>
+<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span> </div>
+<div class="foldopen" id="foldopen00489" data-start="{" data-end="}">
+<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"><a class="line" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab">  489</a></span>  X <a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab">query</a>(<span class="keywordtype">int</span> a, <span class="keywordtype">int</span> b) {</div>
+<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span>    <span class="keywordtype">int</span> lc = <a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4">Tree&lt;X&gt;::lca</a>(a, b);</div>
+<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>    X ret = <a class="code hl_class" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">SG&lt;X&gt;::sret_init</a>;</div>
+<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span>    assert(lc != -1);</div>
+<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span>    ret += <a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24">chain_query</a>(a, lc);</div>
+<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span>    ret += <a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24">chain_query</a>(b, lc);</div>
+<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span>    <span class="keywordflow">return</span> ret - <a class="code hl_class" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree&lt;X&gt;::t_val</a>[lc];</div>
+<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span>  }</div>
+</div>
+<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span>};</div>
+</div>
+<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>} <span class="comment">// namespace heavy_light_decomposition</span></div>
+<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>} <span class="comment">// namespace range_queries</span></div>
+<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span> </div>
+<div class="foldopen" id="foldopen00505" data-start="{" data-end="}">
+<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"><a class="line" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">  505</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a>() {</div>
+<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span>  std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1:\n&quot;</span>;</div>
+<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span> </div>
+<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>  <span class="comment">// Test details</span></div>
+<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span>  <span class="keywordtype">int</span> n = 5;</div>
+<div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span>  std::vector&lt;int64_t&gt; node_values = {4, 2, 5, 2, 1};</div>
+<div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span>  std::vector&lt;std::vector&lt;int&gt;&gt; edges = {{1, 2}, {1, 3}, {3, 4}, {3, 5}};</div>
+<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span>  std::vector&lt;std::vector&lt;int&gt;&gt; queries = {</div>
+<div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span>      {2, 1, 4},</div>
+<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span>      {1, 3, 2},</div>
+<div class="line"><a id="l00515" name="l00515"></a><span class="lineno">  515</span>      {2, 1, 4},</div>
+<div class="line"><a id="l00516" name="l00516"></a><span class="lineno">  516</span>  };</div>
+<div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span>  std::vector&lt;int&gt; expected_result = {11, 8};</div>
+<div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span>  std::vector&lt;int&gt; code_result;</div>
+<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span> </div>
+<div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span>  <a class="code hl_class" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">range_queries::heavy_light_decomposition::HLD&lt;int64_t&gt;</a> hld(n);</div>
+<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span>  hld.<a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70">set_node_val</a>(node_values);</div>
+<div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n - 1; i++) {</div>
+<div class="line"><a id="l00523" name="l00523"></a><span class="lineno">  523</span>    <span class="keywordtype">int</span> u = edges[i][0], v = edges[i][1];</div>
+<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span>    hld.<a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d">add_edge</a>(u - 1, v - 1);</div>
+<div class="line"><a id="l00525" name="l00525"></a><span class="lineno">  525</span>  }</div>
+<div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span>  hld.<a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828">init</a>();</div>
+<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;q : queries) {</div>
+<div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span>    <span class="keywordtype">int</span> type = q[0];</div>
+<div class="line"><a id="l00529" name="l00529"></a><span class="lineno">  529</span>    <span class="keywordflow">if</span> (type == 1) {</div>
+<div class="line"><a id="l00530" name="l00530"></a><span class="lineno">  530</span>      <span class="keywordtype">int</span> p = q[1], x = q[2];</div>
+<div class="line"><a id="l00531" name="l00531"></a><span class="lineno">  531</span>      hld.<a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57">update</a>(p - 1, x);</div>
+<div class="line"><a id="l00532" name="l00532"></a><span class="lineno">  532</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (type == 2) {</div>
+<div class="line"><a id="l00533" name="l00533"></a><span class="lineno">  533</span>      <span class="keywordtype">int</span> a = q[1], b = q[2];</div>
+<div class="line"><a id="l00534" name="l00534"></a><span class="lineno">  534</span>      code_result.push_back(hld.<a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab">query</a>(a - 1, b - 1));</div>
+<div class="line"><a id="l00535" name="l00535"></a><span class="lineno">  535</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00536" name="l00536"></a><span class="lineno">  536</span>      <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00537" name="l00537"></a><span class="lineno">  537</span>    }</div>
+<div class="line"><a id="l00538" name="l00538"></a><span class="lineno">  538</span>  }</div>
+<div class="line"><a id="l00539" name="l00539"></a><span class="lineno">  539</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; static_cast&lt;int&gt;(expected_result.size()); i++) {</div>
+<div class="line"><a id="l00540" name="l00540"></a><span class="lineno">  540</span>    assert(expected_result[i] == code_result[i]);</div>
+<div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</span>  }</div>
+<div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span>  std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest 1 passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00543" name="l00543"></a><span class="lineno">  543</span>}</div>
+</div>
+<div class="line"><a id="l00544" name="l00544"></a><span class="lineno">  544</span> </div>
+<div class="foldopen" id="foldopen00549" data-start="{" data-end="}">
+<div class="line"><a id="l00549" name="l00549"></a><span class="lineno"><a class="line" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">  549</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a>() {</div>
+<div class="line"><a id="l00550" name="l00550"></a><span class="lineno">  550</span>  std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2:\n&quot;</span>;</div>
+<div class="line"><a id="l00551" name="l00551"></a><span class="lineno">  551</span> </div>
+<div class="line"><a id="l00552" name="l00552"></a><span class="lineno">  552</span>  <span class="comment">// Test details (Bamboo)</span></div>
+<div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</span>  <span class="keywordtype">int</span> n = 10;</div>
+<div class="line"><a id="l00554" name="l00554"></a><span class="lineno">  554</span>  std::vector&lt;int64_t&gt; node_values = {1, 8, 6, 8, 6, 2, 9, 2, 3, 2};</div>
+<div class="line"><a id="l00555" name="l00555"></a><span class="lineno">  555</span>  std::vector&lt;std::vector&lt;int&gt;&gt; edges = {</div>
+<div class="line"><a id="l00556" name="l00556"></a><span class="lineno">  556</span>      {10, 5}, {6, 2}, {10, 7}, {5, 2}, {3, 9}, {8, 3}, {1, 4}, {6, 4}, {8, 7}};</div>
+<div class="line"><a id="l00557" name="l00557"></a><span class="lineno">  557</span>  std::vector&lt;std::vector&lt;int&gt;&gt; queries = {</div>
+<div class="line"><a id="l00558" name="l00558"></a><span class="lineno">  558</span>      {2, 1, 10}, {2, 1, 6}, {1, 3, 4}, {2, 1, 9}, {1, 5, 3},</div>
+<div class="line"><a id="l00559" name="l00559"></a><span class="lineno">  559</span>      {1, 7, 8},  {2, 1, 4}, {2, 1, 8}, {1, 1, 4}, {1, 2, 7}};</div>
+<div class="line"><a id="l00560" name="l00560"></a><span class="lineno">  560</span>  std::vector&lt;int&gt; expected_result = {27, 11, 45, 9, 34};</div>
+<div class="line"><a id="l00561" name="l00561"></a><span class="lineno">  561</span>  std::vector&lt;int&gt; code_result;</div>
+<div class="line"><a id="l00562" name="l00562"></a><span class="lineno">  562</span> </div>
+<div class="line"><a id="l00563" name="l00563"></a><span class="lineno">  563</span>  <a class="code hl_class" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">range_queries::heavy_light_decomposition::HLD&lt;int64_t&gt;</a> hld(n);</div>
+<div class="line"><a id="l00564" name="l00564"></a><span class="lineno">  564</span>  hld.<a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70">set_node_val</a>(node_values);</div>
+<div class="line"><a id="l00565" name="l00565"></a><span class="lineno">  565</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n - 1; i++) {</div>
+<div class="line"><a id="l00566" name="l00566"></a><span class="lineno">  566</span>    <span class="keywordtype">int</span> u = edges[i][0], v = edges[i][1];</div>
+<div class="line"><a id="l00567" name="l00567"></a><span class="lineno">  567</span>    hld.<a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d">add_edge</a>(u - 1, v - 1);</div>
+<div class="line"><a id="l00568" name="l00568"></a><span class="lineno">  568</span>  }</div>
+<div class="line"><a id="l00569" name="l00569"></a><span class="lineno">  569</span>  hld.<a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828">init</a>();</div>
+<div class="line"><a id="l00570" name="l00570"></a><span class="lineno">  570</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;q : queries) {</div>
+<div class="line"><a id="l00571" name="l00571"></a><span class="lineno">  571</span>    <span class="keywordtype">int</span> type = q[0];</div>
+<div class="line"><a id="l00572" name="l00572"></a><span class="lineno">  572</span>    <span class="keywordflow">if</span> (type == 1) {</div>
+<div class="line"><a id="l00573" name="l00573"></a><span class="lineno">  573</span>      <span class="keywordtype">int</span> p = q[1], x = q[2];</div>
+<div class="line"><a id="l00574" name="l00574"></a><span class="lineno">  574</span>      hld.<a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57">update</a>(p - 1, x);</div>
+<div class="line"><a id="l00575" name="l00575"></a><span class="lineno">  575</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (type == 2) {</div>
+<div class="line"><a id="l00576" name="l00576"></a><span class="lineno">  576</span>      <span class="keywordtype">int</span> a = q[1], b = q[2];</div>
+<div class="line"><a id="l00577" name="l00577"></a><span class="lineno">  577</span>      code_result.push_back(hld.<a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab">query</a>(a - 1, b - 1));</div>
+<div class="line"><a id="l00578" name="l00578"></a><span class="lineno">  578</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00579" name="l00579"></a><span class="lineno">  579</span>      <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00580" name="l00580"></a><span class="lineno">  580</span>    }</div>
+<div class="line"><a id="l00581" name="l00581"></a><span class="lineno">  581</span>  }</div>
+<div class="line"><a id="l00582" name="l00582"></a><span class="lineno">  582</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; static_cast&lt;int&gt;(expected_result.size()); i++) {</div>
+<div class="line"><a id="l00583" name="l00583"></a><span class="lineno">  583</span>    assert(expected_result[i] == code_result[i]);</div>
+<div class="line"><a id="l00584" name="l00584"></a><span class="lineno">  584</span>  }</div>
+<div class="line"><a id="l00585" name="l00585"></a><span class="lineno">  585</span>  std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest2 passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00586" name="l00586"></a><span class="lineno">  586</span>}</div>
+</div>
+<div class="line"><a id="l00587" name="l00587"></a><span class="lineno">  587</span> </div>
+<div class="foldopen" id="foldopen00592" data-start="{" data-end="}">
+<div class="line"><a id="l00592" name="l00592"></a><span class="lineno"><a class="line" href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">  592</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a>() {</div>
+<div class="line"><a id="l00593" name="l00593"></a><span class="lineno">  593</span>  std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3:\n&quot;</span>;</div>
+<div class="line"><a id="l00594" name="l00594"></a><span class="lineno">  594</span> </div>
+<div class="line"><a id="l00595" name="l00595"></a><span class="lineno">  595</span>  <span class="comment">// Test details</span></div>
+<div class="line"><a id="l00596" name="l00596"></a><span class="lineno">  596</span>  <span class="keywordtype">int</span> n = 8;</div>
+<div class="line"><a id="l00597" name="l00597"></a><span class="lineno">  597</span>  std::vector&lt;int64_t&gt; node_values = {1, 8, 6, 8, 6, 2, 9, 2};</div>
+<div class="line"><a id="l00598" name="l00598"></a><span class="lineno">  598</span>  std::vector&lt;std::vector&lt;int&gt;&gt; edges = {{1, 2}, {2, 3}, {3, 4}, {1, 5},</div>
+<div class="line"><a id="l00599" name="l00599"></a><span class="lineno">  599</span>                                         {6, 3}, {7, 5}, {8, 7}};</div>
+<div class="line"><a id="l00600" name="l00600"></a><span class="lineno">  600</span>  std::vector&lt;std::vector&lt;int&gt;&gt; queries = {</div>
+<div class="line"><a id="l00601" name="l00601"></a><span class="lineno">  601</span>      {2, 6, 8}, {2, 3, 6}, {1, 3, 4}, {2, 7, 1}, {1, 5, 3},</div>
+<div class="line"><a id="l00602" name="l00602"></a><span class="lineno">  602</span>      {1, 7, 8}, {2, 6, 4}, {2, 7, 8}, {1, 1, 4}, {1, 2, 7}};</div>
+<div class="line"><a id="l00603" name="l00603"></a><span class="lineno">  603</span>  std::vector&lt;int&gt; expected_result = {34, 8, 16, 14, 10};</div>
+<div class="line"><a id="l00604" name="l00604"></a><span class="lineno">  604</span>  std::vector&lt;int&gt; code_result;</div>
+<div class="line"><a id="l00605" name="l00605"></a><span class="lineno">  605</span> </div>
+<div class="line"><a id="l00606" name="l00606"></a><span class="lineno">  606</span>  <a class="code hl_class" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">range_queries::heavy_light_decomposition::HLD&lt;int64_t&gt;</a> hld(n);</div>
+<div class="line"><a id="l00607" name="l00607"></a><span class="lineno">  607</span>  hld.<a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70">set_node_val</a>(node_values);</div>
+<div class="line"><a id="l00608" name="l00608"></a><span class="lineno">  608</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n - 1; i++) {</div>
+<div class="line"><a id="l00609" name="l00609"></a><span class="lineno">  609</span>    <span class="keywordtype">int</span> u = edges[i][0], v = edges[i][1];</div>
+<div class="line"><a id="l00610" name="l00610"></a><span class="lineno">  610</span>    hld.<a class="code hl_function" href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d">add_edge</a>(u - 1, v - 1);</div>
+<div class="line"><a id="l00611" name="l00611"></a><span class="lineno">  611</span>  }</div>
+<div class="line"><a id="l00612" name="l00612"></a><span class="lineno">  612</span>  hld.<a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828">init</a>();</div>
+<div class="line"><a id="l00613" name="l00613"></a><span class="lineno">  613</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;q : queries) {</div>
+<div class="line"><a id="l00614" name="l00614"></a><span class="lineno">  614</span>    <span class="keywordtype">int</span> type = q[0];</div>
+<div class="line"><a id="l00615" name="l00615"></a><span class="lineno">  615</span>    <span class="keywordflow">if</span> (type == 1) {</div>
+<div class="line"><a id="l00616" name="l00616"></a><span class="lineno">  616</span>      <span class="keywordtype">int</span> p = q[1], x = q[2];</div>
+<div class="line"><a id="l00617" name="l00617"></a><span class="lineno">  617</span>      hld.<a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57">update</a>(p - 1, x);</div>
+<div class="line"><a id="l00618" name="l00618"></a><span class="lineno">  618</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (type == 2) {</div>
+<div class="line"><a id="l00619" name="l00619"></a><span class="lineno">  619</span>      <span class="keywordtype">int</span> a = q[1], b = q[2];</div>
+<div class="line"><a id="l00620" name="l00620"></a><span class="lineno">  620</span>      code_result.push_back(hld.<a class="code hl_function" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab">query</a>(a - 1, b - 1));</div>
+<div class="line"><a id="l00621" name="l00621"></a><span class="lineno">  621</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00622" name="l00622"></a><span class="lineno">  622</span>      <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00623" name="l00623"></a><span class="lineno">  623</span>    }</div>
+<div class="line"><a id="l00624" name="l00624"></a><span class="lineno">  624</span>  }</div>
+<div class="line"><a id="l00625" name="l00625"></a><span class="lineno">  625</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; static_cast&lt;int&gt;(expected_result.size()); i++) {</div>
+<div class="line"><a id="l00626" name="l00626"></a><span class="lineno">  626</span>    assert(expected_result[i] == code_result[i]);</div>
+<div class="line"><a id="l00627" name="l00627"></a><span class="lineno">  627</span>  }</div>
+<div class="line"><a id="l00628" name="l00628"></a><span class="lineno">  628</span>  std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest3 passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00629" name="l00629"></a><span class="lineno">  629</span>}</div>
+</div>
+<div class="line"><a id="l00630" name="l00630"></a><span class="lineno">  630</span> </div>
+<div class="foldopen" id="foldopen00634" data-start="{" data-end="}">
+<div class="line"><a id="l00634" name="l00634"></a><span class="lineno"><a class="line" href="../../d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  634</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00635" name="l00635"></a><span class="lineno">  635</span>  <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a>();</div>
+<div class="line"><a id="l00636" name="l00636"></a><span class="lineno">  636</span>  <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a>();</div>
+<div class="line"><a id="l00637" name="l00637"></a><span class="lineno">  637</span>  <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a>();</div>
+<div class="line"><a id="l00638" name="l00638"></a><span class="lineno">  638</span>  <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00639" name="l00639"></a><span class="lineno">  639</span>}</div>
+</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">range_queries::heavy_light_decomposition::HLD</a></div><div class="ttdoc">The Heavy-Light Decomposition class.</div><div class="ttdef"><b>Definition</b> <a href="#l00336">heavy_light_decomposition.cpp:336</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a0579062b384e54b611b80c6337c7f2c8"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8">range_queries::heavy_light_decomposition::HLD::dfs_labels</a></div><div class="ttdeci">void dfs_labels(int u, int p=-1)</div><div class="ttdoc">Utility function to lable the nodes so that heavy chains have a contigous lable.</div><div class="ttdef"><b>Definition</b> <a href="#l00390">heavy_light_decomposition.cpp:390</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a1b336474d17eff1aa4be73d4068dc725"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725">range_queries::heavy_light_decomposition::HLD::h_parent</a></div><div class="ttdeci">std::vector&lt; int &gt; h_parent</div><div class="ttdoc">stores the top of the heavy chain from a node</div><div class="ttdef"><b>Definition</b> <a href="#l00341">heavy_light_decomposition.cpp:341</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a2dfbda148aad0bfaba2ebfda9ebc915a"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a">range_queries::heavy_light_decomposition::HLD::dfs_par</a></div><div class="ttdeci">void dfs_par(int u, int p=-1)</div><div class="ttdoc">Utility function to assign highest parent that can be reached though heavy chains.</div><div class="ttdef"><b>Definition</b> <a href="#l00371">heavy_light_decomposition.cpp:371</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a4dfbf5d9df825eeb63b294c6849bdcab"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab">range_queries::heavy_light_decomposition::HLD::query</a></div><div class="ttdeci">X query(int a, int b)</div><div class="ttdoc">This function returns the sum of node values in the simple path from from node_1 to node_2.</div><div class="ttdef"><b>Definition</b> <a href="#l00489">heavy_light_decomposition.cpp:489</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a722cc7cf2c3e4d15583601a48b09776f"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a722cc7cf2c3e4d15583601a48b09776f">range_queries::heavy_light_decomposition::HLD::label</a></div><div class="ttdeci">int label</div><div class="ttdoc">utility member to assign labels in dfs_labels()</div><div class="ttdef"><b>Definition</b> <a href="#l00338">heavy_light_decomposition.cpp:338</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a7d5b40c076347a6aabfb37a0590f2f24"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24">range_queries::heavy_light_decomposition::HLD::chain_query</a></div><div class="ttdeci">X chain_query(int a, int b)</div><div class="ttdoc">Utility function to break down a path query into two chain queries.</div><div class="ttdef"><b>Definition</b> <a href="#l00409">heavy_light_decomposition.cpp:409</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a84424f180f12b514eaab57a6aa20b104"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a84424f180f12b514eaab57a6aa20b104">range_queries::heavy_light_decomposition::HLD::h_heavychlid</a></div><div class="ttdeci">std::vector&lt; int &gt; h_heavychlid</div><div class="ttdoc">stores the heavy child of a node</div><div class="ttdef"><b>Definition</b> <a href="#l00340">heavy_light_decomposition.cpp:340</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a9f1cb54ed09fde931bf3220d75ee4c57"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57">range_queries::heavy_light_decomposition::HLD::update</a></div><div class="ttdeci">void update(int node, X val)</div><div class="ttdoc">This function updates the value at node with val.</div><div class="ttdef"><b>Definition</b> <a href="#l00475">heavy_light_decomposition.cpp:475</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_aa86a91ae0cd7898990a8170a2f2c9cda"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#aa86a91ae0cd7898990a8170a2f2c9cda">range_queries::heavy_light_decomposition::HLD::h_label</a></div><div class="ttdeci">std::vector&lt; int &gt; h_label</div><div class="ttdoc">stores the label of a node</div><div class="ttdef"><b>Definition</b> <a href="#l00339">heavy_light_decomposition.cpp:339</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_ae9e979edd69678b85665c01e2ee97828"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828">range_queries::heavy_light_decomposition::HLD::init</a></div><div class="ttdeci">void init()</div><div class="ttdoc">This function must be called after the tree adjacency list and node values are populated The function...</div><div class="ttdef"><b>Definition</b> <a href="#l00450">heavy_light_decomposition.cpp:450</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_af64848d6630c39d0f09ce2359cc7c4f8"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8">range_queries::heavy_light_decomposition::HLD::dfs_hc</a></div><div class="ttdeci">void dfs_hc(int u, int p=-1)</div><div class="ttdoc">Utility function to assign heavy child to each node (-1 for a leaf node)</div><div class="ttdef"><b>Definition</b> <a href="#l00350">heavy_light_decomposition.cpp:350</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">range_queries::heavy_light_decomposition::SG</a></div><div class="ttdoc">Segment Tree, to store heavy chains.</div><div class="ttdef"><b>Definition</b> <a href="#l00254">heavy_light_decomposition.cpp:254</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_a1fda852e6e522707fd97f61cdb0a2591"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a1fda852e6e522707fd97f61cdb0a2591">range_queries::heavy_light_decomposition::SG::query</a></div><div class="ttdeci">X query(int l, int r)</div><div class="ttdoc">Make a range query from node label l to node label r.</div><div class="ttdef"><b>Definition</b> <a href="#l00305">heavy_light_decomposition.cpp:305</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_a3c75bf5770790f8eba8cc92227b5400c"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c">range_queries::heavy_light_decomposition::SG::update</a></div><div class="ttdeci">void update(int p, X v)</div><div class="ttdoc">Update the value at a node.</div><div class="ttdef"><b>Definition</b> <a href="#l00293">heavy_light_decomposition.cpp:293</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_a41c733f5f5e262b308f7cb95c88c1e74"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74">range_queries::heavy_light_decomposition::SG::combine</a></div><div class="ttdeci">X combine(X lhs, X rhs)</div><div class="ttdoc">Function that specifies the type of operation involved when segments are combined.</div><div class="ttdef"><b>Definition</b> <a href="#l00274">heavy_light_decomposition.cpp:274</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_aa7f93971a9f891e0bbb7023081f379d5"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5">range_queries::heavy_light_decomposition::SG::sret_init</a></div><div class="ttdeci">X sret_init</div><div class="ttdoc">inital query return value</div><div class="ttdef"><b>Definition</b> <a href="#l00264">heavy_light_decomposition.cpp:264</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_ac6d912bbfafa3a7509f66bbc1729ca25"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ac6d912bbfafa3a7509f66bbc1729ca25">range_queries::heavy_light_decomposition::SG::s_size</a></div><div class="ttdeci">int s_size</div><div class="ttdoc">number of leaves in the segment tree</div><div class="ttdef"><b>Definition</b> <a href="#l00263">heavy_light_decomposition.cpp:263</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_ad3b942be27a1b0fe3cff6cb6edf01294"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ad3b942be27a1b0fe3cff6cb6edf01294">range_queries::heavy_light_decomposition::SG::set_sret_init</a></div><div class="ttdeci">void set_sret_init(X new_sret_init)</div><div class="ttdoc">Set the initialization for the query data type, based on requirement.</div><div class="ttdef"><b>Definition</b> <a href="#l00329">heavy_light_decomposition.cpp:329</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_afba5c1225ba04c0025c7786c09ff28f1"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1">range_queries::heavy_light_decomposition::SG::SG</a></div><div class="ttdeci">SG(int size)</div><div class="ttdoc">Class parameterized constructor. Resizes the and initilizes the data members.</div><div class="ttdef"><b>Definition</b> <a href="#l00282">heavy_light_decomposition.cpp:282</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_afbf8a9cb9449d5ca844f4e141a801e6a"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afbf8a9cb9449d5ca844f4e141a801e6a">range_queries::heavy_light_decomposition::SG::s_tree</a></div><div class="ttdeci">std::vector&lt; X &gt; s_tree</div><div class="ttdoc">Everything here is private, and can only be accessed through the methods, in the derived class (HLD)</div><div class="ttdef"><b>Definition</b> <a href="#l00262">heavy_light_decomposition.cpp:262</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">range_queries::heavy_light_decomposition::Tree</a></div><div class="ttdoc">A Basic Tree, which supports binary lifting.</div><div class="ttdef"><b>Definition</b> <a href="#l00078">heavy_light_decomposition.cpp:78</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a04cd96efaba147b19d3afc769b90ff70"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70">range_queries::heavy_light_decomposition::Tree::set_node_val</a></div><div class="ttdeci">void set_node_val(const std::vector&lt; X &gt; &amp;node_val)</div><div class="ttdoc">Set the values for all the nodes.</div><div class="ttdef"><b>Definition</b> <a href="#l00175">heavy_light_decomposition.cpp:175</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a0efd0b9c564092f443ca97030d866ef1"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1">range_queries::heavy_light_decomposition::Tree::t_depth</a></div><div class="ttdeci">std::vector&lt; int &gt; t_depth</div><div class="ttdoc">a vector to store the depth of a node,</div><div class="ttdef"><b>Definition</b> <a href="#l00088">heavy_light_decomposition.cpp:88</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a135b7952593c9b1aae38fcaf1cc1abf7"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a135b7952593c9b1aae38fcaf1cc1abf7">range_queries::heavy_light_decomposition::Tree::t_val</a></div><div class="ttdeci">std::vector&lt; X &gt; t_val</div><div class="ttdoc">values of nodes</div><div class="ttdef"><b>Definition</b> <a href="#l00092">heavy_light_decomposition.cpp:92</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a350157a5fb79f76fceae33fc84171203"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">range_queries::heavy_light_decomposition::Tree::t_par</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; t_par</div><div class="ttdoc">a matrix to store every node's 2^kth parent</div><div class="ttdef"><b>Definition</b> <a href="#l00087">heavy_light_decomposition.cpp:87</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a79ab4601c4a95c0902ac04e779e5f54d"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d">range_queries::heavy_light_decomposition::Tree::add_edge</a></div><div class="ttdeci">void add_edge(const int u, const int v)</div><div class="ttdoc">Adds an undirected edge from node u to node v in the tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00157">heavy_light_decomposition.cpp:157</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a835fb2bbb27307b8cacad9b287968bc1"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1">range_queries::heavy_light_decomposition::Tree::Tree</a></div><div class="ttdeci">Tree(int nodes)</div><div class="ttdoc">Class parameterized constructor, resizes the and initializes the data members.</div><div class="ttdef"><b>Definition</b> <a href="#l00140">heavy_light_decomposition.cpp:140</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a8f7bca1746d40f21ad832fcea59aa6c6"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a8f7bca1746d40f21ad832fcea59aa6c6">range_queries::heavy_light_decomposition::Tree::kth_ancestor</a></div><div class="ttdeci">int kth_ancestor(int p, const int &amp;dist)</div><div class="ttdoc">The function returns the kth ancestor of a node.</div><div class="ttdef"><b>Definition</b> <a href="#l00218">heavy_light_decomposition.cpp:218</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_aa339c31ec74cd86a4842a8b09653d460"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460">range_queries::heavy_light_decomposition::Tree::dfs_size</a></div><div class="ttdeci">void dfs_size(int u, int p=-1)</div><div class="ttdoc">Utility function to compute sub-tree sizes.</div><div class="ttdef"><b>Definition</b> <a href="#l00101">heavy_light_decomposition.cpp:101</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_aa6c37e840355b9fb2105181c578694e8"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa6c37e840355b9fb2105181c578694e8">range_queries::heavy_light_decomposition::Tree::t_root</a></div><div class="ttdeci">int t_root</div><div class="ttdoc">the root of the tree</div><div class="ttdef"><b>Definition</b> <a href="#l00091">heavy_light_decomposition.cpp:91</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ab1aeaefa1bd97b867c652ba916fbdb43"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab1aeaefa1bd97b867c652ba916fbdb43">range_queries::heavy_light_decomposition::Tree::t_adj</a></div><div class="ttdeci">std::vector&lt; std::list&lt; int &gt; &gt; t_adj</div><div class="ttdoc">an adjacency list to stores the tree edges</div><div class="ttdef"><b>Definition</b> <a href="#l00083">heavy_light_decomposition.cpp:83</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ab2ab020f798d00be2613ecf63074b7c1"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab2ab020f798d00be2613ecf63074b7c1">range_queries::heavy_light_decomposition::Tree::t_maxlift</a></div><div class="ttdeci">const int t_maxlift</div><div class="ttdoc">maximum possible height of the tree</div><div class="ttdef"><b>Definition</b> <a href="#l00085">heavy_light_decomposition.cpp:85</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ab916d554afa8ca5230b4310c2c69fae0"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0">range_queries::heavy_light_decomposition::Tree::change_root</a></div><div class="ttdeci">void change_root(int new_root)</div><div class="ttdoc">Set the root for the tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00167">heavy_light_decomposition.cpp:167</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ac7761255f2ba06b398b9aae5e4dce5f3"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3">range_queries::heavy_light_decomposition::Tree::lift</a></div><div class="ttdeci">void lift(int *const p, int dist)</div><div class="ttdoc">The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...</div><div class="ttdef"><b>Definition</b> <a href="#l00200">heavy_light_decomposition.cpp:200</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ad22d760a5a33545a70e7ea5e1786c8dc"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc">range_queries::heavy_light_decomposition::Tree::init</a></div><div class="ttdeci">void init()</div><div class="ttdoc">This function must be called after the tree adjacency list and node values are populated The function...</div><div class="ttdef"><b>Definition</b> <a href="#l00186">heavy_light_decomposition.cpp:186</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ada1494fccbc7f1f07b2f9be9f7e07ad5"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ada1494fccbc7f1f07b2f9be9f7e07ad5">range_queries::heavy_light_decomposition::Tree::t_size</a></div><div class="ttdeci">std::vector&lt; int &gt; t_size</div><div class="ttdoc">a vector to store the subtree size rooted at node</div><div class="ttdef"><b>Definition</b> <a href="#l00089">heavy_light_decomposition.cpp:89</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ae2b407e64aaf9878fbee7ee6efe9c7d4"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4">range_queries::heavy_light_decomposition::Tree::lca</a></div><div class="ttdeci">int lca(int a, int b)</div><div class="ttdoc">The function returns the least common ancestor of two nodes.</div><div class="ttdef"><b>Definition</b> <a href="#l00229">heavy_light_decomposition.cpp:229</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ae4630fa70a80a1dc65a875488a67178a"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a">range_queries::heavy_light_decomposition::Tree::t_nodes</a></div><div class="ttdeci">const int t_nodes</div><div class="ttdoc">number of nodes</div><div class="ttdef"><b>Definition</b> <a href="#l00084">heavy_light_decomposition.cpp:84</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ae8de7aefcb6635d3dacdd174cd4890c4"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4">range_queries::heavy_light_decomposition::Tree::dfs_lca</a></div><div class="ttdeci">void dfs_lca(int u, int p=-1)</div><div class="ttdoc">Utility function to populate the t_par vector.</div><div class="ttdef"><b>Definition</b> <a href="#l00116">heavy_light_decomposition.cpp:116</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> <a href="#l00505">heavy_light_decomposition.cpp:505</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> <a href="#l00549">heavy_light_decomposition.cpp:549</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00634">heavy_light_decomposition.cpp:634</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> <a href="#l00592">heavy_light_decomposition.cpp:592</a></div></div>
+<div class="ttc" id="anamespaceheavy__light__decomposition_html"><div class="ttname"><a href="../../db/d6f/namespaceheavy__light__decomposition.html">heavy_light_decomposition</a></div><div class="ttdoc">Heavy light decomposition algorithm.</div></div>
+<div class="ttc" id="anamespacerange__queries_html"><div class="ttname"><a href="../../dd/d69/namespacerange__queries.html">range_queries</a></div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00028">fenwick_tree.cpp:28</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_074119ce3a874b57120c49a0cc4bb5ad.html">range_queries</a></li><li class="navelem"><a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp.html">heavy_light_decomposition.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html b/d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html
index 47677182b..5f2309f8b 100644
--- a/d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html
+++ b/d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: std::is_arithmetic&lt; uint128_t &gt; Struct Reference</title>
+<title>TheAlgorithms/C++: std::is_arithmetic&lt; uint128_t &gt; Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -117,7 +134,10 @@ Collaboration diagram for std::is_arithmetic&lt; uint128_t &gt;:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.svg" width="132" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
-<hr/>The documentation for this struct was generated from the following file:<ul>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00027">27</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
+</div><hr/>The documentation for this struct was generated from the following file:<ul>
 <li>ciphers/<a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a></li>
 </ul>
 </div><!-- contents -->
@@ -125,7 +145,7 @@ Collaboration diagram for std::is_arithmetic&lt; uint128_t &gt;:</div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
-    <li class="navelem"><a class="el" href="../../d8/dcc/namespacestd.html">std</a></li><li class="navelem"><a class="el" href="../../d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html">is_arithmetic&lt; uint128_t &gt;</a></li>
+    <li class="navelem"><b>std</b></li><li class="navelem"><a class="el" href="../../d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html">is_arithmetic&lt; uint128_t &gt;</a></li>
     <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
   </ul>
 </div>
diff --git a/d3/d05/classbinary__search__tree-members.html b/d3/d05/classbinary__search__tree-members.html
index 98bfc4ab1..07b6e0993 100644
--- a/d3/d05/classbinary__search__tree-members.html
+++ b/d3/d05/classbinary__search__tree-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d3/d05/sudoku__solver_8cpp.html b/d3/d05/sudoku__solver_8cpp.html
index 46784ff6f..b8b731c4d 100644
--- a/d3/d05/sudoku__solver_8cpp.html
+++ b/d3/d05/sudoku__solver_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: backtracking/sudoku_solver.cpp File Reference</title>
+<title>TheAlgorithms/C++: backtracking/sudoku_solver.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for sudoku_solver.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dfd/sudoku__solver_8cpp__incl.svg" width="160" height="126"><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">
+</div>
+<p><a href="../../d3/d05/sudoku__solver_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html">backtracking</a></td></tr>
@@ -133,15 +152,15 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a07dc6acffd0500de9bdbf16b3ade94b0" id="r_a07dc6acffd0500de9bdbf16b3ade94b0"><td class="memTemplParams" colspan="2">template&lt;size_t V&gt; </td></tr>
-<tr class="memitem:a07dc6acffd0500de9bdbf16b3ade94b0"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a07dc6acffd0500de9bdbf16b3ade94b0">backtracking::sudoku_solver::isPossible</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;mat, int i, int j, int no, int n)</td></tr>
+<tr class="memitem:a07dc6acffd0500de9bdbf16b3ade94b0"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a07dc6acffd0500de9bdbf16b3ade94b0">backtracking::sudoku_solver::isPossible</a> (const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;mat, int i, int j, int no, int n)</td></tr>
 <tr class="memdesc:a07dc6acffd0500de9bdbf16b3ade94b0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Check if it's possible to place a number (<code>no</code> parameter)  <br /></td></tr>
 <tr class="separator:a07dc6acffd0500de9bdbf16b3ade94b0"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ab040a12d7684cd85fb3684f4211ea5ac" id="r_ab040a12d7684cd85fb3684f4211ea5ac"><td class="memTemplParams" colspan="2">template&lt;size_t V&gt; </td></tr>
-<tr class="memitem:ab040a12d7684cd85fb3684f4211ea5ac"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ab040a12d7684cd85fb3684f4211ea5ac">backtracking::sudoku_solver::printMat</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;mat, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;starting_mat, int n)</td></tr>
+<tr class="memitem:ab040a12d7684cd85fb3684f4211ea5ac"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ab040a12d7684cd85fb3684f4211ea5ac">backtracking::sudoku_solver::printMat</a> (const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;mat, const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;starting_mat, int n)</td></tr>
 <tr class="memdesc:ab040a12d7684cd85fb3684f4211ea5ac"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to print the matrix.  <br /></td></tr>
 <tr class="separator:ab040a12d7684cd85fb3684f4211ea5ac"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ac911c8bca8556206ff64461b2424866b" id="r_ac911c8bca8556206ff64461b2424866b"><td class="memTemplParams" colspan="2">template&lt;size_t V&gt; </td></tr>
-<tr class="memitem:ac911c8bca8556206ff64461b2424866b"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac911c8bca8556206ff64461b2424866b">backtracking::sudoku_solver::solveSudoku</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;mat, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;starting_mat, int i, int j)</td></tr>
+<tr class="memitem:ac911c8bca8556206ff64461b2424866b"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac911c8bca8556206ff64461b2424866b">backtracking::sudoku_solver::solveSudoku</a> (std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;mat, const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;starting_mat, int i, int j)</td></tr>
 <tr class="memdesc:ac911c8bca8556206ff64461b2424866b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function to implement the Sudoku algorithm.  <br /></td></tr>
 <tr class="separator:ac911c8bca8556206ff64461b2424866b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
@@ -154,6 +173,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/DarthCoder3200" target="_blank">DarthCoder3200</a> </dd>
 <dd>
 <a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html">sudoku_solver.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a07dc6acffd0500de9bdbf16b3ade94b0" name="a07dc6acffd0500de9bdbf16b3ade94b0"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a07dc6acffd0500de9bdbf16b3ade94b0">&#9670;&#160;</a></span>isPossible()</h2>
@@ -166,7 +187,7 @@ template&lt;size_t V&gt; </div>
         <tr>
           <td class="memname">bool backtracking::sudoku_solver::isPossible </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>mat</em></span>, </td>
+          <td class="paramtype">const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>mat</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -213,16 +234,16 @@ template&lt;size_t V&gt; </div>
 <code>false</code> if 'mat' equals to 'no' </dd></dl>
 <p><code>no</code> shouldn't be present in either row i or column j</p>
 <p><code>no</code> shouldn't be present in the 3*3 subgrid</p>
-<div class="fragment"><div class="line"><span class="lineno">   45</span>                               {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   46</span><span class="comment">    /// `no` shouldn&#39;t be present in either row i or column j</span></div>
-<div class="line"><span class="lineno">   47</span><span class="comment"></span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x &lt; n; x++) {</div>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html">sudoku_solver.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   45</span>                               {</div>
+<div class="line"><span class="lineno">   47</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x &lt; n; x++) {</div>
 <div class="line"><span class="lineno">   48</span>        <span class="keywordflow">if</span> (mat[x][j] == no || mat[i][x] == no) {</div>
 <div class="line"><span class="lineno">   49</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</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="comment"></span> </div>
-<div class="line"><span class="lineno">   53</span><span class="comment">    /// `no` shouldn&#39;t be present in the 3*3 subgrid</span></div>
-<div class="line"><span class="lineno">   54</span><span class="comment"></span>    <span class="keywordtype">int</span> sx = (i / 3) * 3;</div>
+<div class="line"><span class="lineno">   52</span> </div>
+<div class="line"><span class="lineno">   54</span>    <span class="keywordtype">int</span> sx = (i / 3) * 3;</div>
 <div class="line"><span class="lineno">   55</span>    <span class="keywordtype">int</span> sy = (j / 3) * 3;</div>
 <div class="line"><span class="lineno">   56</span> </div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = sx; x &lt; sx + 3; x++) {</div>
@@ -235,12 +256,7 @@ template&lt;size_t V&gt; </div>
 <div class="line"><span class="lineno">   64</span> </div>
 <div class="line"><span class="lineno">   65</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   66</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d05/sudoku__solver_8cpp_a07dc6acffd0500de9bdbf16b3ade94b0_cgraph.svg" width="156" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -260,35 +276,29 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html#l00154">154</a> of file <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html">sudoku_solver.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  154</span>           {</div>
 <div class="line"><span class="lineno">  155</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> V = 9;</div>
-<div class="line"><span class="lineno">  156</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;int, V&gt;</a>, V&gt; mat = {</div>
-<div class="line"><span class="lineno">  157</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, V&gt;</a>{5, 3, 0, 0, 7, 0, 0, 0, 0},</div>
-<div class="line"><span class="lineno">  158</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, V&gt;</a>{6, 0, 0, 1, 9, 5, 0, 0, 0},</div>
-<div class="line"><span class="lineno">  159</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, V&gt;</a>{0, 9, 8, 0, 0, 0, 0, 6, 0},</div>
-<div class="line"><span class="lineno">  160</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, V&gt;</a>{8, 0, 0, 0, 6, 0, 0, 0, 3},</div>
-<div class="line"><span class="lineno">  161</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, V&gt;</a>{4, 0, 0, 8, 0, 3, 0, 0, 1},</div>
-<div class="line"><span class="lineno">  162</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, V&gt;</a>{7, 0, 0, 0, 2, 0, 0, 0, 6},</div>
-<div class="line"><span class="lineno">  163</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, V&gt;</a>{0, 6, 0, 0, 0, 0, 2, 8, 0},</div>
-<div class="line"><span class="lineno">  164</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, V&gt;</a>{0, 0, 0, 4, 1, 9, 0, 0, 5},</div>
-<div class="line"><span class="lineno">  165</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, V&gt;</a>{0, 0, 0, 0, 8, 0, 0, 7, 9}};</div>
+<div class="line"><span class="lineno">  156</span>    std::array&lt;std::array&lt;int, V&gt;, V&gt; mat = {</div>
+<div class="line"><span class="lineno">  157</span>        std::array&lt;int, V&gt;{5, 3, 0, 0, 7, 0, 0, 0, 0},</div>
+<div class="line"><span class="lineno">  158</span>        std::array&lt;int, V&gt;{6, 0, 0, 1, 9, 5, 0, 0, 0},</div>
+<div class="line"><span class="lineno">  159</span>        std::array&lt;int, V&gt;{0, 9, 8, 0, 0, 0, 0, 6, 0},</div>
+<div class="line"><span class="lineno">  160</span>        std::array&lt;int, V&gt;{8, 0, 0, 0, 6, 0, 0, 0, 3},</div>
+<div class="line"><span class="lineno">  161</span>        std::array&lt;int, V&gt;{4, 0, 0, 8, 0, 3, 0, 0, 1},</div>
+<div class="line"><span class="lineno">  162</span>        std::array&lt;int, V&gt;{7, 0, 0, 0, 2, 0, 0, 0, 6},</div>
+<div class="line"><span class="lineno">  163</span>        std::array&lt;int, V&gt;{0, 6, 0, 0, 0, 0, 2, 8, 0},</div>
+<div class="line"><span class="lineno">  164</span>        std::array&lt;int, V&gt;{0, 0, 0, 4, 1, 9, 0, 0, 5},</div>
+<div class="line"><span class="lineno">  165</span>        std::array&lt;int, V&gt;{0, 0, 0, 0, 8, 0, 0, 7, 9}};</div>
 <div class="line"><span class="lineno">  166</span> </div>
 <div class="line"><span class="lineno">  167</span>    backtracking::sudoku_solver::printMat&lt;V&gt;(mat, mat, 9);</div>
-<div class="line"><span class="lineno">  168</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Solution &quot;</span> &lt;&lt; <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">  169</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;int, V&gt;</a>, V&gt; starting_mat = mat;</div>
+<div class="line"><span class="lineno">  168</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Solution &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  169</span>    std::array&lt;std::array&lt;int, V&gt;, V&gt; starting_mat = mat;</div>
 <div class="line"><span class="lineno">  170</span>    backtracking::sudoku_solver::solveSudoku&lt;V&gt;(mat, starting_mat, 0, 0);</div>
 <div class="line"><span class="lineno">  171</span> </div>
 <div class="line"><span class="lineno">  172</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  173</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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><!-- 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="../../d3/d05/sudoku__solver_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="180" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ab040a12d7684cd85fb3684f4211ea5ac" name="ab040a12d7684cd85fb3684f4211ea5ac"></a>
@@ -302,12 +312,12 @@ template&lt;size_t V&gt; </div>
         <tr>
           <td class="memname">void backtracking::sudoku_solver::printMat </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>mat</em></span>, </td>
+          <td class="paramtype">const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>mat</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>starting_mat</em></span>, </td>
+          <td class="paramtype">const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>starting_mat</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -333,31 +343,28 @@ template&lt;size_t V&gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html">sudoku_solver.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   78</span>                                                                        {</div>
 <div class="line"><span class="lineno">   79</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
 <div class="line"><span class="lineno">   80</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
 <div class="line"><span class="lineno">   81</span>            <span class="keywordflow">if</span> (starting_mat[i][j] != mat[i][j]) {</div>
-<div class="line"><span class="lineno">   82</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\033[93m&quot;</span> &lt;&lt; mat[i][j] &lt;&lt; <span class="stringliteral">&quot;\033[0m&quot;</span></div>
+<div class="line"><span class="lineno">   82</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\033[93m&quot;</span> &lt;&lt; mat[i][j] &lt;&lt; <span class="stringliteral">&quot;\033[0m&quot;</span></div>
 <div class="line"><span class="lineno">   83</span>                          &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   84</span>            } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   85</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; mat[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   85</span>                std::cout &lt;&lt; mat[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   86</span>            }</div>
 <div class="line"><span class="lineno">   87</span>            <span class="keywordflow">if</span> ((j + 1) % 3 == 0) {</div>
-<div class="line"><span class="lineno">   88</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="charliteral">&#39;\t&#39;</span>;</div>
+<div class="line"><span class="lineno">   88</span>                std::cout &lt;&lt; <span class="charliteral">&#39;\t&#39;</span>;</div>
 <div class="line"><span class="lineno">   89</span>            }</div>
 <div class="line"><span class="lineno">   90</span>        }</div>
 <div class="line"><span class="lineno">   91</span>        <span class="keywordflow">if</span> ((i + 1) % 3 == 0) {</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> &lt;&lt; <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">   92</span>            std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   93</span>        }</div>
-<div class="line"><span class="lineno">   94</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   94</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   95</span>    }</div>
 <div class="line"><span class="lineno">   96</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d05/sudoku__solver_8cpp_ab040a12d7684cd85fb3684f4211ea5ac_cgraph.svg" width="276" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac911c8bca8556206ff64461b2424866b" name="ac911c8bca8556206ff64461b2424866b"></a>
@@ -371,12 +378,12 @@ template&lt;size_t V&gt; </div>
         <tr>
           <td class="memname">bool backtracking::sudoku_solver::solveSudoku </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>mat</em></span>, </td>
+          <td class="paramtype">std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>mat</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>starting_mat</em></span>, </td>
+          <td class="paramtype">const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>starting_mat</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -418,47 +425,34 @@ template&lt;size_t V&gt; </div>
 <p>Place the 'no' - assuming a solution will exist</p>
 <p>Couldn't find a solution loop will place the next <code>no</code>.</p>
 <p><a class="el" href="../../dd/d4f/class_solution.html">Solution</a> couldn't be found for any of the numbers provided</p>
-<div class="fragment"><div class="line"><span class="lineno">  112</span>                        {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  113</span><span class="comment">    /// Base Case</span></div>
-<div class="line"><span class="lineno">  114</span><span class="comment"></span>    <span class="keywordflow">if</span> (i == 9) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  115</span><span class="comment">        /// Solved for 9 rows already</span></div>
-<div class="line"><span class="lineno">  116</span><span class="comment"></span>        printMat&lt;V&gt;(mat, starting_mat, 9);</div>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html#l00110">110</a> of file <a class="el" href="../../d3/d05/sudoku__solver_8cpp_source.html">sudoku_solver.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  112</span>                        {</div>
+<div class="line"><span class="lineno">  114</span>    <span class="keywordflow">if</span> (i == 9) {</div>
+<div class="line"><span class="lineno">  116</span>        printMat&lt;V&gt;(mat, starting_mat, 9);</div>
 <div class="line"><span class="lineno">  117</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  118</span>    }</div>
-<div class="line"><span class="lineno">  119</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  120</span><span class="comment">    /// Crossed the last  Cell in the row</span></div>
-<div class="line"><span class="lineno">  121</span><span class="comment"></span>    <span class="keywordflow">if</span> (j == 9) {</div>
+<div class="line"><span class="lineno">  119</span> </div>
+<div class="line"><span class="lineno">  121</span>    <span class="keywordflow">if</span> (j == 9) {</div>
 <div class="line"><span class="lineno">  122</span>        <span class="keywordflow">return</span> solveSudoku&lt;V&gt;(mat, starting_mat, i + 1, 0);</div>
 <div class="line"><span class="lineno">  123</span>    }</div>
-<div class="line"><span class="lineno">  124</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  125</span><span class="comment">    /// Blue Cell - Skip</span></div>
-<div class="line"><span class="lineno">  126</span><span class="comment"></span>    <span class="keywordflow">if</span> (mat[i][j] != 0) {</div>
+<div class="line"><span class="lineno">  124</span> </div>
+<div class="line"><span class="lineno">  126</span>    <span class="keywordflow">if</span> (mat[i][j] != 0) {</div>
 <div class="line"><span class="lineno">  127</span>        <span class="keywordflow">return</span> solveSudoku&lt;V&gt;(mat, starting_mat, i, j + 1);</div>
-<div class="line"><span class="lineno">  128</span>    }<span class="comment"></span></div>
-<div class="line"><span class="lineno">  129</span><span class="comment">    /// White Cell</span></div>
-<div class="line"><span class="lineno">  130</span><span class="comment">    /// Try to place every possible no</span></div>
-<div class="line"><span class="lineno">  131</span><span class="comment"></span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> no = 1; no &lt;= 9; no++) {</div>
-<div class="line"><span class="lineno">  132</span>        <span class="keywordflow">if</span> (isPossible&lt;V&gt;(mat, i, j, no, 9)) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  133</span><span class="comment">            /// Place the &#39;no&#39; - assuming a solution will exist</span></div>
-<div class="line"><span class="lineno">  134</span><span class="comment"></span>            mat[i][j] = no;</div>
+<div class="line"><span class="lineno">  128</span>    }</div>
+<div class="line"><span class="lineno">  131</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> no = 1; no &lt;= 9; no++) {</div>
+<div class="line"><span class="lineno">  132</span>        <span class="keywordflow">if</span> (isPossible&lt;V&gt;(mat, i, j, no, 9)) {</div>
+<div class="line"><span class="lineno">  134</span>            mat[i][j] = no;</div>
 <div class="line"><span class="lineno">  135</span>            <span class="keywordtype">bool</span> solution_found = solveSudoku&lt;V&gt;(mat, starting_mat, i, j + 1);</div>
 <div class="line"><span class="lineno">  136</span>            <span class="keywordflow">if</span> (solution_found) {</div>
 <div class="line"><span class="lineno">  137</span>                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
-<div class="line"><span class="lineno">  138</span>            }<span class="comment"></span></div>
-<div class="line"><span class="lineno">  139</span><span class="comment">            /// Couldn&#39;t find a solution</span></div>
-<div class="line"><span class="lineno">  140</span><span class="comment">            /// loop will place the next `no`.</span></div>
-<div class="line"><span class="lineno">  141</span><span class="comment"></span>        }</div>
-<div class="line"><span class="lineno">  142</span>    }<span class="comment"></span></div>
-<div class="line"><span class="lineno">  143</span><span class="comment">    /// Solution couldn&#39;t be found for any of the numbers provided</span></div>
-<div class="line"><span class="lineno">  144</span><span class="comment"></span>    mat[i][j] = 0;</div>
+<div class="line"><span class="lineno">  138</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">  144</span>    mat[i][j] = 0;</div>
 <div class="line"><span class="lineno">  145</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  146</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d05/sudoku__solver_8cpp_ac911c8bca8556206ff64461b2424866b_cgraph.svg" width="158" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/d05/sudoku__solver_8cpp_a07dc6acffd0500de9bdbf16b3ade94b0_cgraph.map b/d3/d05/sudoku__solver_8cpp_a07dc6acffd0500de9bdbf16b3ade94b0_cgraph.map
deleted file mode 100644
index 8f6484923..000000000
--- a/d3/d05/sudoku__solver_8cpp_a07dc6acffd0500de9bdbf16b3ade94b0_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="backtracking::sudoku_solver::isPossible" name="backtracking::sudoku_solver::isPossible">
-<area shape="rect" id="Node000001" title="Check if it&#39;s possible to place a number (no parameter)" alt="" coords="5,29,151,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="50,29,48,20,53,11,63,5,78,3,94,5,104,12,101,16,92,10,78,8,65,10,57,14,54,20,55,28"/>
-</map>
diff --git a/d3/d05/sudoku__solver_8cpp_a07dc6acffd0500de9bdbf16b3ade94b0_cgraph.md5 b/d3/d05/sudoku__solver_8cpp_a07dc6acffd0500de9bdbf16b3ade94b0_cgraph.md5
deleted file mode 100644
index 8b8d9379a..000000000
--- a/d3/d05/sudoku__solver_8cpp_a07dc6acffd0500de9bdbf16b3ade94b0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c02f8695e5e3d46fba4a92d91244b0b9
\ No newline at end of file
diff --git a/d3/d05/sudoku__solver_8cpp_a07dc6acffd0500de9bdbf16b3ade94b0_cgraph.svg b/d3/d05/sudoku__solver_8cpp_a07dc6acffd0500de9bdbf16b3ade94b0_cgraph.svg
deleted file mode 100644
index d7e6b5417..000000000
--- a/d3/d05/sudoku__solver_8cpp_a07dc6acffd0500de9bdbf16b3ade94b0_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::sudoku_solver::isPossible Pages: 1 -->
-<svg width="117pt" height="57pt"
- viewBox="0.00 0.00 117.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::sudoku_solver::isPossible</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Check if it&#39;s possible to place a number (no parameter)">
-<polygon fill="#999999" stroke="#666666" points="109,-30.5 0,-30.5 0,0 109,0 109,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::sudoku</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_solver::isPossible</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.19,-30.99C31.24,-40.06 37.68,-48.5 54.5,-48.5 63.7,-48.5 69.79,-45.97 72.78,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.24,-42.77 73.68,-32.49 69.27,-42.13 76.24,-42.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d05/sudoku__solver_8cpp_a07dc6acffd0500de9bdbf16b3ade94b0_cgraph_org.svg b/d3/d05/sudoku__solver_8cpp_a07dc6acffd0500de9bdbf16b3ade94b0_cgraph_org.svg
deleted file mode 100644
index e223e174b..000000000
--- a/d3/d05/sudoku__solver_8cpp_a07dc6acffd0500de9bdbf16b3ade94b0_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::sudoku_solver::isPossible Pages: 1 -->
-<svg width="117pt" height="57pt"
- viewBox="0.00 0.00 117.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::sudoku_solver::isPossible</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Check if it&#39;s possible to place a number (no parameter)">
-<polygon fill="#999999" stroke="#666666" points="109,-30.5 0,-30.5 0,0 109,0 109,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::sudoku</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_solver::isPossible</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.19,-30.99C31.24,-40.06 37.68,-48.5 54.5,-48.5 63.7,-48.5 69.79,-45.97 72.78,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.24,-42.77 73.68,-32.49 69.27,-42.13 76.24,-42.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d05/sudoku__solver_8cpp_ab040a12d7684cd85fb3684f4211ea5ac_cgraph.map b/d3/d05/sudoku__solver_8cpp_ab040a12d7684cd85fb3684f4211ea5ac_cgraph.map
deleted file mode 100644
index 64876d7b1..000000000
--- a/d3/d05/sudoku__solver_8cpp_ab040a12d7684cd85fb3684f4211ea5ac_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="backtracking::sudoku_solver::printMat" name="backtracking::sudoku_solver::printMat">
-<area shape="rect" id="Node000001" title="Utility function to print the matrix." alt="" coords="5,29,151,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="48,29,46,19,51,11,62,5,78,3,95,5,106,11,103,16,94,10,78,8,64,10,55,14,51,20,53,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="199,37,270,62"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="151,47,183,47,183,52,151,52"/>
-</map>
diff --git a/d3/d05/sudoku__solver_8cpp_ab040a12d7684cd85fb3684f4211ea5ac_cgraph.md5 b/d3/d05/sudoku__solver_8cpp_ab040a12d7684cd85fb3684f4211ea5ac_cgraph.md5
deleted file mode 100644
index db310880f..000000000
--- a/d3/d05/sudoku__solver_8cpp_ab040a12d7684cd85fb3684f4211ea5ac_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-95b5d0dc3157967090f0363bf6eec409
\ No newline at end of file
diff --git a/d3/d05/sudoku__solver_8cpp_ab040a12d7684cd85fb3684f4211ea5ac_cgraph.svg b/d3/d05/sudoku__solver_8cpp_ab040a12d7684cd85fb3684f4211ea5ac_cgraph.svg
deleted file mode 100644
index 0a9846180..000000000
--- a/d3/d05/sudoku__solver_8cpp_ab040a12d7684cd85fb3684f4211ea5ac_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::sudoku_solver::printMat Pages: 1 -->
-<svg width="207pt" height="57pt"
- viewBox="0.00 0.00 206.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::sudoku_solver::printMat</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to print the matrix.">
-<polygon fill="#999999" stroke="#666666" points="109,-30.5 0,-30.5 0,0 109,0 109,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::sudoku</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_solver::printMat</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.72,-30.99C29.48,-40.06 36.41,-48.5 54.5,-48.5 64.39,-48.5 70.95,-45.97 74.16,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.62,-42.79 75.13,-32.49 70.66,-42.1 77.62,-42.79"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="198.5,-24.88 145,-24.88 145,-5.63 198.5,-5.63 198.5,-24.88"/>
-<text text-anchor="middle" x="171.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.41,-15.25C117.49,-15.25 125.66,-15.25 133.29,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.23,-18.75 143.23,-15.25 133.23,-11.75 133.23,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d05/sudoku__solver_8cpp_ab040a12d7684cd85fb3684f4211ea5ac_cgraph_org.svg b/d3/d05/sudoku__solver_8cpp_ab040a12d7684cd85fb3684f4211ea5ac_cgraph_org.svg
deleted file mode 100644
index 509c3958e..000000000
--- a/d3/d05/sudoku__solver_8cpp_ab040a12d7684cd85fb3684f4211ea5ac_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::sudoku_solver::printMat Pages: 1 -->
-<svg width="207pt" height="57pt"
- viewBox="0.00 0.00 206.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::sudoku_solver::printMat</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to print the matrix.">
-<polygon fill="#999999" stroke="#666666" points="109,-30.5 0,-30.5 0,0 109,0 109,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::sudoku</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_solver::printMat</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.72,-30.99C29.48,-40.06 36.41,-48.5 54.5,-48.5 64.39,-48.5 70.95,-45.97 74.16,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.62,-42.79 75.13,-32.49 70.66,-42.1 77.62,-42.79"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="198.5,-24.88 145,-24.88 145,-5.63 198.5,-5.63 198.5,-24.88"/>
-<text text-anchor="middle" x="171.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.41,-15.25C117.49,-15.25 125.66,-15.25 133.29,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.23,-18.75 143.23,-15.25 133.23,-11.75 133.23,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d05/sudoku__solver_8cpp_ac911c8bca8556206ff64461b2424866b_cgraph.map b/d3/d05/sudoku__solver_8cpp_ac911c8bca8556206ff64461b2424866b_cgraph.map
deleted file mode 100644
index fc496e9ad..000000000
--- a/d3/d05/sudoku__solver_8cpp_ac911c8bca8556206ff64461b2424866b_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="backtracking::sudoku_solver::solveSudoku" name="backtracking::sudoku_solver::solveSudoku">
-<area shape="rect" id="Node000001" title="Main function to implement the Sudoku algorithm." alt="" coords="5,29,152,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="50,29,49,20,53,11,63,5,79,3,95,5,105,12,102,16,93,10,78,8,65,10,57,14,54,20,55,28"/>
-</map>
diff --git a/d3/d05/sudoku__solver_8cpp_ac911c8bca8556206ff64461b2424866b_cgraph.md5 b/d3/d05/sudoku__solver_8cpp_ac911c8bca8556206ff64461b2424866b_cgraph.md5
deleted file mode 100644
index 0691267c0..000000000
--- a/d3/d05/sudoku__solver_8cpp_ac911c8bca8556206ff64461b2424866b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-967aa17d61b313d2e25e67112a9c9f3f
\ No newline at end of file
diff --git a/d3/d05/sudoku__solver_8cpp_ac911c8bca8556206ff64461b2424866b_cgraph.svg b/d3/d05/sudoku__solver_8cpp_ac911c8bca8556206ff64461b2424866b_cgraph.svg
deleted file mode 100644
index 9506b93cf..000000000
--- a/d3/d05/sudoku__solver_8cpp_ac911c8bca8556206ff64461b2424866b_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::sudoku_solver::solveSudoku Pages: 1 -->
-<svg width="118pt" height="57pt"
- viewBox="0.00 0.00 117.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::sudoku_solver::solveSudoku</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function to implement the Sudoku algorithm.">
-<polygon fill="#999999" stroke="#666666" points="109.75,-30.5 0,-30.5 0,0 109.75,0 109.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::sudoku</text>
-<text text-anchor="middle" x="54.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_solver::solveSudoku</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.43,-30.99C31.46,-40.06 37.94,-48.5 54.88,-48.5 64.14,-48.5 70.27,-45.97 73.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.74,-42.77 74.18,-32.49 69.77,-42.13 76.74,-42.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d05/sudoku__solver_8cpp_ac911c8bca8556206ff64461b2424866b_cgraph_org.svg b/d3/d05/sudoku__solver_8cpp_ac911c8bca8556206ff64461b2424866b_cgraph_org.svg
deleted file mode 100644
index 954999b83..000000000
--- a/d3/d05/sudoku__solver_8cpp_ac911c8bca8556206ff64461b2424866b_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::sudoku_solver::solveSudoku Pages: 1 -->
-<svg width="118pt" height="57pt"
- viewBox="0.00 0.00 117.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::sudoku_solver::solveSudoku</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function to implement the Sudoku algorithm.">
-<polygon fill="#999999" stroke="#666666" points="109.75,-30.5 0,-30.5 0,0 109.75,0 109.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::sudoku</text>
-<text text-anchor="middle" x="54.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_solver::solveSudoku</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.43,-30.99C31.46,-40.06 37.94,-48.5 54.88,-48.5 64.14,-48.5 70.27,-45.97 73.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.74,-42.77 74.18,-32.49 69.77,-42.13 76.74,-42.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d05/sudoku__solver_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/d05/sudoku__solver_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 72e4661e0..000000000
--- a/d3/d05/sudoku__solver_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d3/d05/sudoku__solver_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/d05/sudoku__solver_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 67add7ca9..000000000
--- a/d3/d05/sudoku__solver_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-43978bd5f251984f240d34b044bed87c
\ No newline at end of file
diff --git a/d3/d05/sudoku__solver_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/d05/sudoku__solver_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index dfc67d7f9..000000000
--- a/d3/d05/sudoku__solver_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 134.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-9.62C44.56,-9.62 52.97,-9.62 61.25,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.21,-13.13 71.21,-9.63 61.21,-6.13 61.21,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d05/sudoku__solver_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/d05/sudoku__solver_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index b8d51c6c3..000000000
--- a/d3/d05/sudoku__solver_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 134.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-9.62C44.56,-9.62 52.97,-9.62 61.25,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.21,-13.13 71.21,-9.63 61.21,-6.13 61.21,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d05/sudoku__solver_8cpp_source.html b/d3/d05/sudoku__solver_8cpp_source.html
new file mode 100644
index 000000000..fda7f79e7
--- /dev/null
+++ b/d3/d05/sudoku__solver_8cpp_source.html
@@ -0,0 +1,252 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: backtracking/sudoku_solver.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/d05/sudoku__solver_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">sudoku_solver.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/d05/sudoku__solver_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;array&gt;</span>     </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../db/dc0/namespacebacktracking.html">backtracking</a> {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d9f/namespacesudoku__solver.html">sudoku_solver</a> {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> V&gt;</div>
+<div class="foldopen" id="foldopen00044" data-start="{" data-end="}">
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="../../d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0">   44</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0">isPossible</a>(<span class="keyword">const</span> std::array&lt;std::array&lt;int, V&gt;, V&gt; &amp;mat, <span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j,</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>                <span class="keywordtype">int</span> no, <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x &lt; n; x++) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="keywordflow">if</span> (mat[x][j] == no || mat[i][x] == no) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordtype">int</span> sx = (i / 3) * 3;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordtype">int</span> sy = (j / 3) * 3;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = sx; x &lt; sx + 3; x++) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> y = sy; y &lt; sy + 3; y++) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            <span class="keywordflow">if</span> (mat[x][y] == no) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            }</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        }</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>}</div>
+</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> V&gt;</div>
+<div class="foldopen" id="foldopen00077" data-start="{" data-end="}">
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../d3/d05/sudoku__solver_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac">   77</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d05/sudoku__solver_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac">printMat</a>(<span class="keyword">const</span> std::array&lt;std::array&lt;int, V&gt;, V&gt; &amp;mat,</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>              <span class="keyword">const</span> std::array&lt;std::array&lt;int, V&gt;, V&gt; &amp;starting_mat, <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>            <span class="keywordflow">if</span> (starting_mat[i][j] != mat[i][j]) {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\033[93m&quot;</span> &lt;&lt; mat[i][j] &lt;&lt; <span class="stringliteral">&quot;\033[0m&quot;</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>                          &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>                std::cout &lt;&lt; mat[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            }</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            <span class="keywordflow">if</span> ((j + 1) % 3 == 0) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>                std::cout &lt;&lt; <span class="charliteral">&#39;\t&#39;</span>;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>            }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        <span class="keywordflow">if</span> ((i + 1) % 3 == 0) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>            std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        }</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    }</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>}</div>
+</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> V&gt;</div>
+<div class="foldopen" id="foldopen00110" data-start="{" data-end="}">
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"><a class="line" href="../../d3/d05/sudoku__solver_8cpp.html#ac911c8bca8556206ff64461b2424866b">  110</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d05/sudoku__solver_8cpp.html#ac911c8bca8556206ff64461b2424866b">solveSudoku</a>(std::array&lt;std::array&lt;int, V&gt;, V&gt; &amp;mat,</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>                 <span class="keyword">const</span> std::array&lt;std::array&lt;int, V&gt;, V&gt; &amp;starting_mat, <span class="keywordtype">int</span> i,</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>                 <span class="keywordtype">int</span> j) {</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="keywordflow">if</span> (i == 9) {</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        printMat&lt;V&gt;(mat, starting_mat, 9);</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    }</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="keywordflow">if</span> (j == 9) {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        <span class="keywordflow">return</span> solveSudoku&lt;V&gt;(mat, starting_mat, i + 1, 0);</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    }</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <span class="keywordflow">if</span> (mat[i][j] != 0) {</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <span class="keywordflow">return</span> solveSudoku&lt;V&gt;(mat, starting_mat, i, j + 1);</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    }</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> no = 1; no &lt;= 9; no++) {</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        <span class="keywordflow">if</span> (isPossible&lt;V&gt;(mat, i, j, no, 9)) {</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>            mat[i][j] = no;</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>            <span class="keywordtype">bool</span> solution_found = solveSudoku&lt;V&gt;(mat, starting_mat, i, j + 1);</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>            <span class="keywordflow">if</span> (solution_found) {</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>            }</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        }</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    }</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    mat[i][j] = 0;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>}</div>
+</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>}  <span class="comment">// namespace sudoku_solver</span></div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>}  <span class="comment">// namespace backtracking</span></div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span> </div>
+<div class="foldopen" id="foldopen00154" data-start="{" data-end="}">
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"><a class="line" href="../../d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  154</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> V = 9;</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    std::array&lt;std::array&lt;int, V&gt;, V&gt; mat = {</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>        std::array&lt;int, V&gt;{5, 3, 0, 0, 7, 0, 0, 0, 0},</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>        std::array&lt;int, V&gt;{6, 0, 0, 1, 9, 5, 0, 0, 0},</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        std::array&lt;int, V&gt;{0, 9, 8, 0, 0, 0, 0, 6, 0},</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>        std::array&lt;int, V&gt;{8, 0, 0, 0, 6, 0, 0, 0, 3},</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        std::array&lt;int, V&gt;{4, 0, 0, 8, 0, 3, 0, 0, 1},</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        std::array&lt;int, V&gt;{7, 0, 0, 0, 2, 0, 0, 0, 6},</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        std::array&lt;int, V&gt;{0, 6, 0, 0, 0, 0, 2, 8, 0},</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>        std::array&lt;int, V&gt;{0, 0, 0, 4, 1, 9, 0, 0, 5},</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>        std::array&lt;int, V&gt;{0, 0, 0, 0, 8, 0, 0, 7, 9}};</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span> </div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    backtracking::sudoku_solver::printMat&lt;V&gt;(mat, mat, 9);</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Solution &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    std::array&lt;std::array&lt;int, V&gt;, V&gt; starting_mat = mat;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    backtracking::sudoku_solver::solveSudoku&lt;V&gt;(mat, starting_mat, 0, 0);</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span> </div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>}</div>
+</div>
+<div class="ttc" id="anamespacebacktracking_html"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html">backtracking</a></div><div class="ttdoc">for vector container</div></div>
+<div class="ttc" id="anamespacesudoku__solver_html"><div class="ttname"><a href="../../d8/d9f/namespacesudoku__solver.html">sudoku_solver</a></div><div class="ttdoc">Functions for the Sudoku Solver implementation.</div></div>
+<div class="ttc" id="asudoku__solver_8cpp_html_a07dc6acffd0500de9bdbf16b3ade94b0"><div class="ttname"><a href="../../d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0">backtracking::sudoku_solver::isPossible</a></div><div class="ttdeci">bool isPossible(const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;mat, int i, int j, int no, int n)</div><div class="ttdoc">Check if it's possible to place a number (no parameter)</div><div class="ttdef"><b>Definition</b> <a href="#l00044">sudoku_solver.cpp:44</a></div></div>
+<div class="ttc" id="asudoku__solver_8cpp_html_ab040a12d7684cd85fb3684f4211ea5ac"><div class="ttname"><a href="../../d3/d05/sudoku__solver_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac">backtracking::sudoku_solver::printMat</a></div><div class="ttdeci">void printMat(const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;mat, const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;starting_mat, int n)</div><div class="ttdoc">Utility function to print the matrix.</div><div class="ttdef"><b>Definition</b> <a href="#l00077">sudoku_solver.cpp:77</a></div></div>
+<div class="ttc" id="asudoku__solver_8cpp_html_ac911c8bca8556206ff64461b2424866b"><div class="ttname"><a href="../../d3/d05/sudoku__solver_8cpp.html#ac911c8bca8556206ff64461b2424866b">backtracking::sudoku_solver::solveSudoku</a></div><div class="ttdeci">bool solveSudoku(std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;mat, const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;starting_mat, int i, int j)</div><div class="ttdoc">Main function to implement the Sudoku algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00110">sudoku_solver.cpp:110</a></div></div>
+<div class="ttc" id="asudoku__solver_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00154">sudoku_solver.cpp:154</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a class="el" href="../../d3/d05/sudoku__solver_8cpp.html">sudoku_solver.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp.html b/d3/d06/ode__semi__implicit__euler_8cpp.html
index ffc8097a8..8fc8480e7 100644
--- a/d3/d06/ode__semi__implicit__euler_8cpp.html
+++ b/d3/d06/ode__semi__implicit__euler_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/ode_semi_implicit_euler.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/ode_semi_implicit_euler.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,22 +139,24 @@ Include dependency graph for ode_semi_implicit_euler.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/db4/ode__semi__implicit__euler_8cpp__incl.svg" width="423" height="126"><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">
+</div>
+<p><a href="../../d3/d06/ode__semi__implicit__euler_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:abaeae8f62a018d197f0187a1c80a90fe" id="r_abaeae8f62a018d197f0187a1c80a90fe"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abaeae8f62a018d197f0187a1c80a90fe">problem</a> (const double &amp;x, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *y, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *dy)</td></tr>
+<tr class="memitem:abaeae8f62a018d197f0187a1c80a90fe" id="r_abaeae8f62a018d197f0187a1c80a90fe"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abaeae8f62a018d197f0187a1c80a90fe">problem</a> (const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</td></tr>
 <tr class="memdesc:abaeae8f62a018d197f0187a1c80a90fe"><td class="mdescLeft">&#160;</td><td class="mdescRight">Problem statement for a system with first-order differential equations. Updates the system differential variables.  <br /></td></tr>
 <tr class="separator:abaeae8f62a018d197f0187a1c80a90fe"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af3adf7b092a87868917ee5fb4255192b" id="r_af3adf7b092a87868917ee5fb4255192b"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af3adf7b092a87868917ee5fb4255192b">exact_solution</a> (const double &amp;x, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *y)</td></tr>
+<tr class="memitem:af3adf7b092a87868917ee5fb4255192b" id="r_af3adf7b092a87868917ee5fb4255192b"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af3adf7b092a87868917ee5fb4255192b">exact_solution</a> (const double &amp;x, std::valarray&lt; double &gt; *y)</td></tr>
 <tr class="memdesc:af3adf7b092a87868917ee5fb4255192b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Exact solution of the problem. Used for solution comparison.  <br /></td></tr>
 <tr class="separator:af3adf7b092a87868917ee5fb4255192b"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ga827bf009831ddc477c5fa8891d5cb35f" id="r_ga827bf009831ddc477c5fa8891d5cb35f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f">semi_implicit_euler_step</a> (const double dx, const double &amp;x, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *y, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *dy)</td></tr>
+<tr class="memitem:ga827bf009831ddc477c5fa8891d5cb35f" id="r_ga827bf009831ddc477c5fa8891d5cb35f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f">semi_implicit_euler_step</a> (const double dx, const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</td></tr>
 <tr class="memdesc:ga827bf009831ddc477c5fa8891d5cb35f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute next step approximation using the semi-implicit-Euler method.  <br /></td></tr>
 <tr class="separator:ga827bf009831ddc477c5fa8891d5cb35f"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ga3874d294ab00fe9ce8731c5b7991a089" id="r_ga3874d294ab00fe9ce8731c5b7991a089"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089">semi_implicit_euler</a> (double dx, double x0, double x_max, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *y, bool save_to_file=false)</td></tr>
+<tr class="memitem:ga3874d294ab00fe9ce8731c5b7991a089" id="r_ga3874d294ab00fe9ce8731c5b7991a089"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089">semi_implicit_euler</a> (double dx, double x0, double x_max, std::valarray&lt; double &gt; *y, bool save_to_file=false)</td></tr>
 <tr class="memdesc:ga3874d294ab00fe9ce8731c5b7991a089"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute approximation using the semi-implicit-Euler method in the given limits.  <br /></td></tr>
 <tr class="separator:ga3874d294ab00fe9ce8731c5b7991a089"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa13517b8e5de1b75592052db7f7e237f" id="r_aa13517b8e5de1b75592052db7f7e237f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a> (const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;Y0)</td></tr>
+<tr class="memitem:aa13517b8e5de1b75592052db7f7e237f" id="r_aa13517b8e5de1b75592052db7f7e237f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a> (const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0)</td></tr>
 <tr class="separator:aa13517b8e5de1b75592052db7f7e237f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a0ddf1224851353fc92bfbff6f499fa97" id="r_a0ddf1224851353fc92bfbff6f499fa97"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0ddf1224851353fc92bfbff6f499fa97">main</a> (int argc, char *argv[])</td></tr>
 <tr class="separator:a0ddf1224851353fc92bfbff6f499fa97"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -164,6 +183,8 @@ Functions</h2></td></tr>
 <div class="line">dy[0] = y[1];</div>
 <div class="line">dy[1] = mu * (1.f - y[0] * y[0]) * y[1] - y[0];</div>
 </div><!-- fragment --> <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d6/dd3/ode__midpoint__euler_8cpp.html" title="Solve a multivariable first order ordinary differential equation (ODEs) using midpoint Euler method">ode_midpoint_euler.cpp</a>, <a class="el" href="../../db/dd3/ode__forward__euler_8cpp.html" title="Solve a multivariable first order ordinary differential equation (ODEs) using forward Euler method">ode_forward_euler.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/d06/ode__semi__implicit__euler_8cpp_source.html">ode_semi_implicit_euler.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="af3adf7b092a87868917ee5fb4255192b" name="af3adf7b092a87868917ee5fb4255192b"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#af3adf7b092a87868917ee5fb4255192b">&#9670;&#160;</a></span>exact_solution()</h2>
@@ -179,7 +200,7 @@ Functions</h2></td></tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>&#160;)</td>
+          <td class="paramtype">std::valarray&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -192,18 +213,13 @@ Functions</h2></td></tr>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">   66</span>                                                             {</div>
-<div class="line"><span class="lineno">   67</span>    y[0][0] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a>(x);</div>
-<div class="line"><span class="lineno">   68</span>    y[0][1] = -<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a>(x);</div>
-<div class="line"><span class="lineno">   69</span>}</div>
-<div class="ttc" id="acos_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a></div><div class="ttdeci">T cos(T... args)</div></div>
-<div class="ttc" id="asin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a></div><div class="ttdeci">T sin(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg" width="232" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d3/d06/ode__semi__implicit__euler_8cpp_source.html#l00066">66</a> of file <a class="el" href="../../d3/d06/ode__semi__implicit__euler_8cpp_source.html">ode_semi_implicit_euler.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   66</span>                                                             {</div>
+<div class="line"><span class="lineno">   67</span>    y[0][0] = std::cos(x);</div>
+<div class="line"><span class="lineno">   68</span>    y[0][1] = -std::sin(x);</div>
+<div class="line"><span class="lineno">   69</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
@@ -225,41 +241,34 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Main Function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d06/ode__semi__implicit__euler_8cpp_source.html#l00189">189</a> of file <a class="el" href="../../d3/d06/ode__semi__implicit__euler_8cpp_source.html">ode_semi_implicit_euler.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  189</span>                                 {</div>
 <div class="line"><span class="lineno">  190</span>    <span class="keywordtype">double</span> X0 = 0.f;                       <span class="comment">/* initial value of x0 */</span></div>
 <div class="line"><span class="lineno">  191</span>    <span class="keywordtype">double</span> X_MAX = 10.F;                   <span class="comment">/* upper limit of integration */</span></div>
-<div class="line"><span class="lineno">  192</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> Y0 = {1.f, 0.f}; <span class="comment">/* initial value Y = y(x = x_0) */</span></div>
+<div class="line"><span class="lineno">  192</span>    std::valarray&lt;double&gt; Y0 = {1.f, 0.f}; <span class="comment">/* initial value Y = y(x = x_0) */</span></div>
 <div class="line"><span class="lineno">  193</span>    <span class="keywordtype">double</span> step_size;</div>
 <div class="line"><span class="lineno">  194</span> </div>
 <div class="line"><span class="lineno">  195</span>    <span class="keywordflow">if</span> (argc == 1) {</div>
-<div class="line"><span class="lineno">  196</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter the step size: &quot;</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_istream.html">std::cin</a> &gt;&gt; step_size;</div>
+<div class="line"><span class="lineno">  196</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the step size: &quot;</span>;</div>
+<div class="line"><span class="lineno">  197</span>        std::cin &gt;&gt; step_size;</div>
 <div class="line"><span class="lineno">  198</span>    } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">  199</span>        <span class="comment">// use commandline argument as independent variable step size</span></div>
-<div class="line"><span class="lineno">  200</span>        step_size = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a>(argv[1]);</div>
+<div class="line"><span class="lineno">  200</span>        step_size = std::atof(argv[1]);</div>
 <div class="line"><span class="lineno">  201</span>    }</div>
 <div class="line"><span class="lineno">  202</span> </div>
 <div class="line"><span class="lineno">  203</span>    <span class="comment">// get approximate solution</span></div>
 <div class="line"><span class="lineno">  204</span>    <span class="keywordtype">double</span> total_time = <a class="code hl_function" href="../../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089">semi_implicit_euler</a>(step_size, X0, X_MAX, &amp;Y0, <span class="keyword">true</span>);</div>
-<div class="line"><span class="lineno">  205</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tTime = &quot;</span> &lt;&lt; total_time &lt;&lt; <span class="stringliteral">&quot; ms\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  205</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tTime = &quot;</span> &lt;&lt; total_time &lt;&lt; <span class="stringliteral">&quot; ms\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  206</span> </div>
 <div class="line"><span class="lineno">  207</span>    <span class="comment">/* compute exact solution for comparion */</span></div>
 <div class="line"><span class="lineno">  208</span>    <a class="code hl_function" href="#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a>(X0, X_MAX, step_size, Y0);</div>
 <div class="line"><span class="lineno">  209</span> </div>
 <div class="line"><span class="lineno">  210</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  211</span>}</div>
-<div class="ttc" id="aatof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a></div><div class="ttdeci">T atof(T... args)</div></div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="agroup__ode_html_ga3874d294ab00fe9ce8731c5b7991a089"><div class="ttname"><a href="../../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089">semi_implicit_euler</a></div><div class="ttdeci">double semi_implicit_euler(double dx, double x0, double x_max, std::valarray&lt; double &gt; *y, bool save_to_file=false)</div><div class="ttdoc">Compute approximation using the semi-implicit-Euler method in the given limits.</div><div class="ttdef"><b>Definition</b> ode_semi_implicit_euler.cpp:103</div></div>
-<div class="ttc" id="aode__semi__implicit__euler_8cpp_html_aa13517b8e5de1b75592052db7f7e237f"><div class="ttname"><a href="#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a></div><div class="ttdeci">void save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0)</div><div class="ttdef"><b>Definition</b> ode_semi_implicit_euler.cpp:153</div></div>
-<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="578" height="356"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agroup__ode_html_ga3874d294ab00fe9ce8731c5b7991a089"><div class="ttname"><a href="../../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089">semi_implicit_euler</a></div><div class="ttdeci">double semi_implicit_euler(double dx, double x0, double x_max, std::valarray&lt; double &gt; *y, bool save_to_file=false)</div><div class="ttdoc">Compute approximation using the semi-implicit-Euler method in the given limits.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d06/ode__semi__implicit__euler_8cpp_source.html#l00103">ode_semi_implicit_euler.cpp:103</a></div></div>
+<div class="ttc" id="aode__semi__implicit__euler_8cpp_html_aa13517b8e5de1b75592052db7f7e237f"><div class="ttname"><a href="#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a></div><div class="ttdeci">void save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d06/ode__semi__implicit__euler_8cpp_source.html#l00153">ode_semi_implicit_euler.cpp:153</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abaeae8f62a018d197f0187a1c80a90fe" name="abaeae8f62a018d197f0187a1c80a90fe"></a>
@@ -276,12 +285,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
+          <td class="paramtype">std::valarray&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>dy</em></span>&#160;)</td>
+          <td class="paramtype">std::valarray&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>dy</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -296,6 +305,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d06/ode__semi__implicit__euler_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../d3/d06/ode__semi__implicit__euler_8cpp_source.html">ode_semi_implicit_euler.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   54</span>                                      {</div>
 <div class="line"><span class="lineno">   55</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> omega = 1.F;             <span class="comment">// some const for the problem</span></div>
 <div class="line"><span class="lineno">   56</span>    dy[0][0] = y[0][1];                   <span class="comment">// x dot</span></div>
@@ -328,7 +339,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>Y0</em></span>&#160;)</td>
+          <td class="paramtype">const std::valarray&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>Y0</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -342,18 +353,20 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d06/ode__semi__implicit__euler_8cpp_source.html#l00153">153</a> of file <a class="el" href="../../d3/d06/ode__semi__implicit__euler_8cpp_source.html">ode_semi_implicit_euler.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  155</span>                                                        {</div>
 <div class="line"><span class="lineno">  156</span>    <span class="keywordtype">double</span> x = X0;</div>
-<div class="line"><span class="lineno">  157</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> y = Y0;</div>
+<div class="line"><span class="lineno">  157</span>    std::valarray&lt;double&gt; y = Y0;</div>
 <div class="line"><span class="lineno">  158</span> </div>
-<div class="line"><span class="lineno">  159</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a> fp(<span class="stringliteral">&quot;exact.csv&quot;</span>, std::ostream::out);</div>
+<div class="line"><span class="lineno">  159</span>    std::ofstream fp(<span class="stringliteral">&quot;exact.csv&quot;</span>, std::ostream::out);</div>
 <div class="line"><span class="lineno">  160</span>    <span class="keywordflow">if</span> (!fp.is_open()) {</div>
-<div class="line"><span class="lineno">  161</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/perror.html">std::perror</a>(<span class="stringliteral">&quot;Error! &quot;</span>);</div>
+<div class="line"><span class="lineno">  161</span>        std::perror(<span class="stringliteral">&quot;Error! &quot;</span>);</div>
 <div class="line"><span class="lineno">  162</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  163</span>    }</div>
-<div class="line"><span class="lineno">  164</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Finding exact solution\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  164</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Finding exact solution\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  165</span> </div>
-<div class="line"><span class="lineno">  166</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> t1 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  166</span>    std::clock_t t1 = std::clock();</div>
 <div class="line"><span class="lineno">  167</span>    <span class="keywordflow">do</span> {</div>
 <div class="line"><span class="lineno">  168</span>        fp &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
 <div class="line"><span class="lineno">  169</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; y.size() - 1; i++) {</div>
@@ -366,23 +379,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  176</span>        x += step_size;</div>
 <div class="line"><span class="lineno">  177</span>    } <span class="keywordflow">while</span> (x &lt;= X_MAX);</div>
 <div class="line"><span class="lineno">  178</span> </div>
-<div class="line"><span class="lineno">  179</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> t2 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  179</span>    std::clock_t t2 = std::clock();</div>
 <div class="line"><span class="lineno">  180</span>    <span class="keywordtype">double</span> total_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(t2 - t1) / CLOCKS_PER_SEC;</div>
-<div class="line"><span class="lineno">  181</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tTime = &quot;</span> &lt;&lt; total_time &lt;&lt; <span class="stringliteral">&quot; ms\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  181</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tTime = &quot;</span> &lt;&lt; total_time &lt;&lt; <span class="stringliteral">&quot; ms\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  182</span> </div>
 <div class="line"><span class="lineno">  183</span>    fp.close();</div>
 <div class="line"><span class="lineno">  184</span>}</div>
-<div class="ttc" id="abasic_ofstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a></div></div>
-<div class="ttc" id="aclock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a></div><div class="ttdeci">T clock(T... args)</div></div>
-<div class="ttc" id="aclock_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a></div></div>
-<div class="ttc" id="aode__semi__implicit__euler_8cpp_html_af3adf7b092a87868917ee5fb4255192b"><div class="ttname"><a href="#af3adf7b092a87868917ee5fb4255192b">exact_solution</a></div><div class="ttdeci">void exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y)</div><div class="ttdoc">Exact solution of the problem. Used for solution comparison.</div><div class="ttdef"><b>Definition</b> ode_semi_implicit_euler.cpp:66</div></div>
-<div class="ttc" id="aperror_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/c/perror.html">std::perror</a></div><div class="ttdeci">T perror(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg" width="467" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aode__semi__implicit__euler_8cpp_html_af3adf7b092a87868917ee5fb4255192b"><div class="ttname"><a href="#af3adf7b092a87868917ee5fb4255192b">exact_solution</a></div><div class="ttdeci">void exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y)</div><div class="ttdoc">Exact solution of the problem. Used for solution comparison.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d06/ode__semi__implicit__euler_8cpp_source.html#l00066">ode_semi_implicit_euler.cpp:66</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
deleted file mode 100644
index 44149c9a6..000000000
--- a/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ /dev/null
@@ -1,33 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,128,55,154"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/atof.html#" title=" " alt="" coords="138,79,208,104"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,130,102,113,123,106,124,111,104,118,56,135"/>
-<area shape="rect" id="Node000003" href="$d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f" title=" " alt="" coords="103,128,243,154"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,138,87,138,87,144,55,144"/>
-<area shape="rect" id="Node000011" href="$d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089" title="Compute approximation using the semi&#45;implicit&#45;Euler method in the given limits." alt="" coords="107,177,239,203"/>
-<area shape="poly" id="edge10_Node000001_Node000011" title=" " alt="" coords="56,147,104,164,120,169,118,174,102,169,54,152"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/clock.html#" title=" " alt="" coords="334,177,412,203"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="229,152,319,174,318,179,228,157"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="304,227,442,252"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="223,152,244,163,260,176,269,189,278,201,293,213,301,218,298,222,289,218,274,205,265,192,256,179,242,167,221,157"/>
-<area shape="rect" id="Node000006" href="$d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b" title="Exact solution of the problem. Used for solution comparison." alt="" coords="320,29,426,55"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="221,125,242,115,256,102,265,90,274,77,290,64,305,56,307,61,292,68,278,80,269,93,260,106,244,119,223,130"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="298,79,449,104"/>
-<area shape="poly" id="edge8_Node000003_Node000009" title=" " alt="" coords="228,125,302,106,304,111,229,130"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/c/perror.html#" title=" " alt="" coords="333,128,413,154"/>
-<area shape="poly" id="edge9_Node000003_Node000010" title=" " alt="" coords="243,138,317,138,317,144,243,144"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/cos.html#" title=" " alt="" coords="503,55,572,80"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="427,48,488,57,488,63,426,53"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sin.html#" title=" " alt="" coords="505,5,570,31"/>
-<area shape="poly" id="edge7_Node000006_Node000008" title=" " alt="" coords="426,32,489,22,490,28,426,37"/>
-<area shape="poly" id="edge11_Node000011_Node000004" title=" " alt="" coords="239,188,318,188,318,193,239,193"/>
-<area shape="poly" id="edge12_Node000011_Node000005" title=" " alt="" coords="229,201,304,220,302,225,228,206"/>
-<area shape="poly" id="edge13_Node000011_Node000009" title=" " alt="" coords="221,174,242,164,256,152,265,139,274,126,289,113,298,109,301,113,293,118,278,130,269,142,260,155,244,168,223,179"/>
-<area shape="poly" id="edge15_Node000011_Node000010" title=" " alt="" coords="228,174,317,152,319,157,229,179"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="306,276,440,302"/>
-<area shape="poly" id="edge14_Node000011_Node000012" title=" " alt="" coords="193,201,237,232,292,262,306,268,304,273,290,267,234,236,190,206"/>
-<area shape="rect" id="Node000013" href="$d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f" title="Compute next step approximation using the semi&#45;implicit&#45;Euler method." alt="" coords="291,325,455,351"/>
-<area shape="poly" id="edge16_Node000011_Node000013" title=" " alt="" coords="185,202,227,255,258,286,292,312,301,316,298,321,290,316,254,290,223,259,181,205"/>
-<area shape="rect" id="Node000014" href="$d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti..." alt="" coords="504,325,571,351"/>
-<area shape="poly" id="edge17_Node000013_Node000014" title=" " alt="" coords="456,336,488,336,488,341,456,341"/>
-</map>
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
deleted file mode 100644
index c2a878873..000000000
--- a/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2181418741ad24555dda1b133613f3d4
\ No newline at end of file
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
deleted file mode 100644
index 150769c0a..000000000
--- a/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ /dev/null
@@ -1,317 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="433pt" height="267pt"
- viewBox="0.00 0.00 432.75 267.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 263.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-167.25 0,-167.25 0,-148 37,-148 37,-167.25"/>
-<text text-anchor="middle" x="18.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/atof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.62,-204.25 99.62,-204.25 99.62,-185 151.62,-185 151.62,-204.25"/>
-<text text-anchor="middle" x="125.62" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::atof</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-163.98C47.72,-167.69 61.1,-172.44 73,-176.62 78.05,-178.4 83.38,-180.27 88.62,-182.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.12,-185.28 97.72,-185.27 89.43,-178.68 87.12,-185.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="178.25,-167.25 73,-167.25 73,-148 178.25,-148 178.25,-167.25"/>
-<text text-anchor="middle" x="125.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.33,-157.62C44.25,-157.62 52.63,-157.62 61.41,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.17,-161.13 71.17,-157.63 61.17,-154.13 61.17,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089" target="_top" xlink:title="Compute approximation using the semi&#45;implicit&#45;Euler method in the given limits.">
-<polygon fill="white" stroke="#666666" points="175.25,-130.25 76,-130.25 76,-111 175.25,-111 175.25,-130.25"/>
-<text text-anchor="middle" x="125.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">semi_implicit_euler</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-151.27C47.72,-147.56 61.1,-142.81 73,-138.62 76.9,-137.25 80.97,-135.83 85.03,-134.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.96,-137.79 94.24,-131.19 83.65,-131.18 85.96,-137.79"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-130.25 246.5,-130.25 246.5,-111 305.25,-111 305.25,-130.25"/>
-<text text-anchor="middle" x="275.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.13,-147.51C188.26,-142.24 214,-135.82 235.02,-130.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="235.84,-133.98 244.69,-128.16 234.14,-127.18 235.84,-133.98"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="327.38,-93.25 224.38,-93.25 224.38,-74 327.38,-74 327.38,-93.25"/>
-<text text-anchor="middle" x="275.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.66,-147.57C168.09,-145.35 173.47,-142.72 178.25,-139.62 197.79,-126.99 194.42,-113.8 214.25,-101.62 216.26,-100.39 218.36,-99.24 220.52,-98.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.78,-101.43 229.57,-94.25 219,-95 221.78,-101.43"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b" target="_top" xlink:title="Exact solution of the problem. Used for solution comparison.">
-<polygon fill="white" stroke="#666666" points="315.38,-241.25 236.38,-241.25 236.38,-222 315.38,-222 315.38,-241.25"/>
-<text text-anchor="middle" x="275.88" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.66,-167.68C168.09,-169.9 173.47,-172.53 178.25,-175.62 197.79,-188.26 194.42,-201.45 214.25,-213.62 217.78,-215.79 221.58,-217.71 225.51,-219.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.05,-222.6 234.65,-222.86 226.53,-216.05 224.05,-222.6"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="332.62,-204.25 219.12,-204.25 219.12,-185 332.62,-185 332.62,-204.25"/>
-<text text-anchor="middle" x="275.88" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.13,-167.74C184.46,-172.06 204.89,-177.16 223.28,-181.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.4,-185.13 232.95,-184.16 224.09,-178.34 222.4,-185.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/perror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306,-167.25 245.75,-167.25 245.75,-148 306,-148 306,-167.25"/>
-<text text-anchor="middle" x="275.88" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::perror</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node10 -->
-<g id="edge9_Node000003_Node000010" class="edge">
-<title>Node3&#45;&gt;Node10</title>
-<g id="a_edge9_Node000003_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M178.48,-157.62C196.66,-157.62 216.81,-157.62 233.97,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.79,-161.13 243.79,-157.63 233.79,-154.13 233.79,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424.75,-222.25 373.5,-222.25 373.5,-203 424.75,-203 424.75,-222.25"/>
-<text text-anchor="middle" x="399.12" y="-208.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M315.57,-225.56C330.45,-223.23 347.36,-220.58 361.98,-218.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="362.31,-221.78 371.64,-216.77 361.22,-214.86 362.31,-221.78"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="423.25,-259.25 375,-259.25 375,-240 423.25,-240 423.25,-259.25"/>
-<text text-anchor="middle" x="399.12" y="-245.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M315.57,-237.37C330.88,-239.64 348.35,-242.24 363.27,-244.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="362.69,-247.9 373.09,-245.91 363.71,-240.98 362.69,-247.9"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node4 -->
-<g id="edge11_Node000011_Node000004" class="edge">
-<title>Node11&#45;&gt;Node4</title>
-<g id="a_edge11_Node000011_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.58,-120.62C194.81,-120.62 216.61,-120.62 234.87,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="234.79,-124.13 244.79,-120.63 234.79,-117.13 234.79,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge12_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge12_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.13,-110.51C184.46,-106.19 204.89,-101.09 223.28,-96.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.09,-99.91 232.95,-94.09 222.4,-93.12 224.09,-99.91"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node9 -->
-<g id="edge13_Node000011_Node000009" class="edge">
-<title>Node11&#45;&gt;Node9</title>
-<g id="a_edge13_Node000011_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.66,-130.68C168.09,-132.9 173.47,-135.53 178.25,-138.62 197.79,-151.26 194.42,-164.45 214.25,-176.62 216.26,-177.86 218.36,-179.01 220.52,-180.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219,-183.25 229.57,-184 221.78,-176.82 219,-183.25"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node10 -->
-<g id="edge15_Node000011_Node000010" class="edge">
-<title>Node11&#45;&gt;Node10</title>
-<g id="a_edge15_Node000011_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.13,-130.74C188.11,-135.97 213.65,-142.34 234.59,-147.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.68,-150.95 244.23,-149.98 235.37,-144.16 233.68,-150.95"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="326.25,-56.25 225.5,-56.25 225.5,-37 326.25,-37 326.25,-56.25"/>
-<text text-anchor="middle" x="275.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge14_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge14_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.61,-110.66C156.16,-98.37 186.01,-77.53 214.25,-64.62 217.55,-63.12 221,-61.7 224.51,-60.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.43,-63.76 233.72,-57.17 223.13,-57.15 225.43,-63.76"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f" target="_top" xlink:title="Compute next step approximation using the semi&#45;implicit&#45;Euler method.">
-<polygon fill="white" stroke="#666666" points="337.5,-19.25 214.25,-19.25 214.25,0 337.5,0 337.5,-19.25"/>
-<text text-anchor="middle" x="275.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">semi_implicit_euler_step</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node13 -->
-<g id="edge16_Node000011_Node000013" class="edge">
-<title>Node11&#45;&gt;Node13</title>
-<g id="a_edge16_Node000011_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.31,-110.58C146.5,-91.53 177.79,-50.07 214.25,-27.62 216.26,-26.39 218.36,-25.23 220.52,-24.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.78,-27.42 229.56,-20.24 219,-21 221.78,-27.42"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" target="_top" xlink:title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti...">
-<polygon fill="white" stroke="#666666" points="424.38,-19.25 373.88,-19.25 373.88,0 424.38,0 424.38,-19.25"/>
-<text text-anchor="middle" x="399.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">problem</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge17_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge17_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M337.86,-9.62C346.14,-9.62 354.41,-9.62 362.06,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="361.95,-13.13 371.95,-9.63 361.95,-6.13 361.95,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
deleted file mode 100644
index efbce1033..000000000
--- a/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
+++ /dev/null
@@ -1,291 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="433pt" height="267pt"
- viewBox="0.00 0.00 432.75 267.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 263.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-167.25 0,-167.25 0,-148 37,-148 37,-167.25"/>
-<text text-anchor="middle" x="18.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/atof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.62,-204.25 99.62,-204.25 99.62,-185 151.62,-185 151.62,-204.25"/>
-<text text-anchor="middle" x="125.62" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::atof</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-163.98C47.72,-167.69 61.1,-172.44 73,-176.62 78.05,-178.4 83.38,-180.27 88.62,-182.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.12,-185.28 97.72,-185.27 89.43,-178.68 87.12,-185.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="178.25,-167.25 73,-167.25 73,-148 178.25,-148 178.25,-167.25"/>
-<text text-anchor="middle" x="125.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.33,-157.62C44.25,-157.62 52.63,-157.62 61.41,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.17,-161.13 71.17,-157.63 61.17,-154.13 61.17,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089" target="_top" xlink:title="Compute approximation using the semi&#45;implicit&#45;Euler method in the given limits.">
-<polygon fill="white" stroke="#666666" points="175.25,-130.25 76,-130.25 76,-111 175.25,-111 175.25,-130.25"/>
-<text text-anchor="middle" x="125.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">semi_implicit_euler</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-151.27C47.72,-147.56 61.1,-142.81 73,-138.62 76.9,-137.25 80.97,-135.83 85.03,-134.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.96,-137.79 94.24,-131.19 83.65,-131.18 85.96,-137.79"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-130.25 246.5,-130.25 246.5,-111 305.25,-111 305.25,-130.25"/>
-<text text-anchor="middle" x="275.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.13,-147.51C188.26,-142.24 214,-135.82 235.02,-130.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="235.84,-133.98 244.69,-128.16 234.14,-127.18 235.84,-133.98"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="327.38,-93.25 224.38,-93.25 224.38,-74 327.38,-74 327.38,-93.25"/>
-<text text-anchor="middle" x="275.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.66,-147.57C168.09,-145.35 173.47,-142.72 178.25,-139.62 197.79,-126.99 194.42,-113.8 214.25,-101.62 216.26,-100.39 218.36,-99.24 220.52,-98.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.78,-101.43 229.57,-94.25 219,-95 221.78,-101.43"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b" target="_top" xlink:title="Exact solution of the problem. Used for solution comparison.">
-<polygon fill="white" stroke="#666666" points="315.38,-241.25 236.38,-241.25 236.38,-222 315.38,-222 315.38,-241.25"/>
-<text text-anchor="middle" x="275.88" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.66,-167.68C168.09,-169.9 173.47,-172.53 178.25,-175.62 197.79,-188.26 194.42,-201.45 214.25,-213.62 217.78,-215.79 221.58,-217.71 225.51,-219.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.05,-222.6 234.65,-222.86 226.53,-216.05 224.05,-222.6"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="332.62,-204.25 219.12,-204.25 219.12,-185 332.62,-185 332.62,-204.25"/>
-<text text-anchor="middle" x="275.88" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.13,-167.74C184.46,-172.06 204.89,-177.16 223.28,-181.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.4,-185.13 232.95,-184.16 224.09,-178.34 222.4,-185.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/perror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306,-167.25 245.75,-167.25 245.75,-148 306,-148 306,-167.25"/>
-<text text-anchor="middle" x="275.88" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::perror</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node10 -->
-<g id="edge9_Node000003_Node000010" class="edge">
-<title>Node3&#45;&gt;Node10</title>
-<g id="a_edge9_Node000003_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M178.48,-157.62C196.66,-157.62 216.81,-157.62 233.97,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.79,-161.13 243.79,-157.63 233.79,-154.13 233.79,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424.75,-222.25 373.5,-222.25 373.5,-203 424.75,-203 424.75,-222.25"/>
-<text text-anchor="middle" x="399.12" y="-208.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M315.57,-225.56C330.45,-223.23 347.36,-220.58 361.98,-218.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="362.31,-221.78 371.64,-216.77 361.22,-214.86 362.31,-221.78"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="423.25,-259.25 375,-259.25 375,-240 423.25,-240 423.25,-259.25"/>
-<text text-anchor="middle" x="399.12" y="-245.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M315.57,-237.37C330.88,-239.64 348.35,-242.24 363.27,-244.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="362.69,-247.9 373.09,-245.91 363.71,-240.98 362.69,-247.9"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node4 -->
-<g id="edge11_Node000011_Node000004" class="edge">
-<title>Node11&#45;&gt;Node4</title>
-<g id="a_edge11_Node000011_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.58,-120.62C194.81,-120.62 216.61,-120.62 234.87,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="234.79,-124.13 244.79,-120.63 234.79,-117.13 234.79,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge12_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge12_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.13,-110.51C184.46,-106.19 204.89,-101.09 223.28,-96.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.09,-99.91 232.95,-94.09 222.4,-93.12 224.09,-99.91"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node9 -->
-<g id="edge13_Node000011_Node000009" class="edge">
-<title>Node11&#45;&gt;Node9</title>
-<g id="a_edge13_Node000011_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.66,-130.68C168.09,-132.9 173.47,-135.53 178.25,-138.62 197.79,-151.26 194.42,-164.45 214.25,-176.62 216.26,-177.86 218.36,-179.01 220.52,-180.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219,-183.25 229.57,-184 221.78,-176.82 219,-183.25"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node10 -->
-<g id="edge15_Node000011_Node000010" class="edge">
-<title>Node11&#45;&gt;Node10</title>
-<g id="a_edge15_Node000011_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.13,-130.74C188.11,-135.97 213.65,-142.34 234.59,-147.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.68,-150.95 244.23,-149.98 235.37,-144.16 233.68,-150.95"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="326.25,-56.25 225.5,-56.25 225.5,-37 326.25,-37 326.25,-56.25"/>
-<text text-anchor="middle" x="275.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge14_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge14_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.61,-110.66C156.16,-98.37 186.01,-77.53 214.25,-64.62 217.55,-63.12 221,-61.7 224.51,-60.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.43,-63.76 233.72,-57.17 223.13,-57.15 225.43,-63.76"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f" target="_top" xlink:title="Compute next step approximation using the semi&#45;implicit&#45;Euler method.">
-<polygon fill="white" stroke="#666666" points="337.5,-19.25 214.25,-19.25 214.25,0 337.5,0 337.5,-19.25"/>
-<text text-anchor="middle" x="275.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">semi_implicit_euler_step</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node13 -->
-<g id="edge16_Node000011_Node000013" class="edge">
-<title>Node11&#45;&gt;Node13</title>
-<g id="a_edge16_Node000011_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.31,-110.58C146.5,-91.53 177.79,-50.07 214.25,-27.62 216.26,-26.39 218.36,-25.23 220.52,-24.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.78,-27.42 229.56,-20.24 219,-21 221.78,-27.42"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" target="_top" xlink:title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti...">
-<polygon fill="white" stroke="#666666" points="424.38,-19.25 373.88,-19.25 373.88,0 424.38,0 424.38,-19.25"/>
-<text text-anchor="middle" x="399.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">problem</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge17_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge17_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M337.86,-9.62C346.14,-9.62 354.41,-9.62 362.06,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="361.95,-13.13 371.95,-9.63 361.95,-6.13 361.95,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map b/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map
deleted file mode 100644
index 51548e610..000000000
--- a/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="save_exact_solution" name="save_exact_solution">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,104,146,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/clock.html#" title=" " alt="" coords="230,5,308,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="93,101,137,71,193,40,215,31,217,36,195,45,140,76,96,106"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="201,55,338,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="128,101,200,82,202,87,130,106"/>
-<area shape="rect" id="Node000004" href="$d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b" title="Exact solution of the problem. Used for solution comparison." alt="" coords="217,104,322,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="146,114,201,114,201,120,146,120"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="194,153,345,179"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="130,128,202,146,200,151,128,133"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/c/perror.html#" title=" " alt="" coords="229,203,310,228"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="96,128,140,158,195,189,215,198,213,202,193,194,137,163,93,132"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/cos.html#" title=" " alt="" coords="393,80,461,106"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="322,106,377,98,378,103,323,111"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sin.html#" title=" " alt="" coords="395,129,459,155"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="323,123,380,132,379,137,322,128"/>
-</map>
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 b/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5
deleted file mode 100644
index 9612dbf02..000000000
--- a/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bb3d651d0a34877da3f2bc1188fab5c9
\ No newline at end of file
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg b/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg
deleted file mode 100644
index 672469412..000000000
--- a/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg
+++ /dev/null
@@ -1,173 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: save_exact_solution Pages: 1 -->
-<svg width="350pt" height="175pt"
- viewBox="0.00 0.00 350.00 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>save_exact_solution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="105.25,-93.25 0,-93.25 0,-74 105.25,-74 105.25,-93.25"/>
-<text text-anchor="middle" x="52.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.38,-167.25 168.62,-167.25 168.62,-148 227.38,-148 227.38,-167.25"/>
-<text text-anchor="middle" x="198" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.95,-93.69C83.61,-105.9 113.32,-126.46 141.25,-139.62 146.46,-142.08 152.1,-144.33 157.72,-146.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.35,-149.58 166.95,-149.45 158.58,-142.95 156.35,-149.58"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-130.25 146.5,-130.25 146.5,-111 249.5,-111 249.5,-130.25"/>
-<text text-anchor="middle" x="198" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.8,-93.74C109.48,-98.04 129.13,-103.11 146.85,-107.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.85,-111.04 156.4,-110.15 147.6,-104.26 145.85,-111.04"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b" target="_top" xlink:title="Exact solution of the problem. Used for solution comparison.">
-<polygon fill="white" stroke="#666666" points="237.5,-93.25 158.5,-93.25 158.5,-74 237.5,-74 237.5,-93.25"/>
-<text text-anchor="middle" x="198" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.39,-83.62C118.91,-83.62 133.46,-83.62 146.9,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.85,-87.13 156.85,-83.63 146.85,-80.13 146.85,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-56.25 141.25,-56.25 141.25,-37 254.75,-37 254.75,-56.25"/>
-<text text-anchor="middle" x="198" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.8,-73.51C109.48,-69.21 129.13,-64.14 146.85,-59.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.6,-62.99 156.4,-57.1 145.85,-56.21 147.6,-62.99"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/perror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.12,-19.25 167.88,-19.25 167.88,0 228.12,0 228.12,-19.25"/>
-<text text-anchor="middle" x="198" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::perror</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.95,-73.56C83.61,-61.35 113.32,-40.79 141.25,-27.62 146.17,-25.31 151.46,-23.17 156.76,-21.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.74,-24.61 166.09,-18.08 155.49,-17.98 157.74,-24.61"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="342,-111.25 290.75,-111.25 290.75,-92 342,-92 342,-111.25"/>
-<text text-anchor="middle" x="316.38" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.75,-89.62C251.15,-91.69 266.1,-94 279.28,-96.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.4,-99.45 288.82,-97.52 279.47,-92.53 278.4,-99.45"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="340.5,-74.25 292.25,-74.25 292.25,-55 340.5,-55 340.5,-74.25"/>
-<text text-anchor="middle" x="316.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.75,-77.3C251.66,-75.03 267.25,-72.48 280.78,-70.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.25,-73.74 290.56,-68.68 280.13,-66.83 281.25,-73.74"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph_org.svg b/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph_org.svg
deleted file mode 100644
index 230e7a567..000000000
--- a/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph_org.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: save_exact_solution Pages: 1 -->
-<svg width="350pt" height="175pt"
- viewBox="0.00 0.00 350.00 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>save_exact_solution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="105.25,-93.25 0,-93.25 0,-74 105.25,-74 105.25,-93.25"/>
-<text text-anchor="middle" x="52.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.38,-167.25 168.62,-167.25 168.62,-148 227.38,-148 227.38,-167.25"/>
-<text text-anchor="middle" x="198" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.95,-93.69C83.61,-105.9 113.32,-126.46 141.25,-139.62 146.46,-142.08 152.1,-144.33 157.72,-146.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.35,-149.58 166.95,-149.45 158.58,-142.95 156.35,-149.58"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-130.25 146.5,-130.25 146.5,-111 249.5,-111 249.5,-130.25"/>
-<text text-anchor="middle" x="198" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.8,-93.74C109.48,-98.04 129.13,-103.11 146.85,-107.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.85,-111.04 156.4,-110.15 147.6,-104.26 145.85,-111.04"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b" target="_top" xlink:title="Exact solution of the problem. Used for solution comparison.">
-<polygon fill="white" stroke="#666666" points="237.5,-93.25 158.5,-93.25 158.5,-74 237.5,-74 237.5,-93.25"/>
-<text text-anchor="middle" x="198" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.39,-83.62C118.91,-83.62 133.46,-83.62 146.9,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.85,-87.13 156.85,-83.63 146.85,-80.13 146.85,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-56.25 141.25,-56.25 141.25,-37 254.75,-37 254.75,-56.25"/>
-<text text-anchor="middle" x="198" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.8,-73.51C109.48,-69.21 129.13,-64.14 146.85,-59.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.6,-62.99 156.4,-57.1 145.85,-56.21 147.6,-62.99"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/perror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.12,-19.25 167.88,-19.25 167.88,0 228.12,0 228.12,-19.25"/>
-<text text-anchor="middle" x="198" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::perror</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.95,-73.56C83.61,-61.35 113.32,-40.79 141.25,-27.62 146.17,-25.31 151.46,-23.17 156.76,-21.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.74,-24.61 166.09,-18.08 155.49,-17.98 157.74,-24.61"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="342,-111.25 290.75,-111.25 290.75,-92 342,-92 342,-111.25"/>
-<text text-anchor="middle" x="316.38" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.75,-89.62C251.15,-91.69 266.1,-94 279.28,-96.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.4,-99.45 288.82,-97.52 279.47,-92.53 278.4,-99.45"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="340.5,-74.25 292.25,-74.25 292.25,-55 340.5,-55 340.5,-74.25"/>
-<text text-anchor="middle" x="316.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.75,-77.3C251.66,-75.03 267.25,-72.48 280.78,-70.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.25,-73.74 290.56,-68.68 280.13,-66.83 281.25,-73.74"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map b/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map
deleted file mode 100644
index 20ef8b76a..000000000
--- a/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="exact_solution" name="exact_solution">
-<area shape="rect" id="Node000001" title="Exact solution of the problem. Used for solution comparison." alt="" coords="5,31,111,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/cos.html#" title=" " alt="" coords="159,5,227,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="111,31,143,25,144,30,112,36"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sin.html#" title=" " alt="" coords="161,55,225,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="112,50,146,56,145,62,111,56"/>
-</map>
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 b/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5
deleted file mode 100644
index bfa5784f3..000000000
--- a/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-775f69ca4eafdff6467315705aafdd17
\ No newline at end of file
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg b/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg
deleted file mode 100644
index 85206d2ac..000000000
--- a/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: exact_solution Pages: 1 -->
-<svg width="174pt" height="64pt"
- viewBox="0.00 0.00 174.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>exact_solution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Exact solution of the problem. Used for solution comparison.">
-<polygon fill="#999999" stroke="#666666" points="79,-37.25 0,-37.25 0,-18 79,-18 79,-37.25"/>
-<text text-anchor="middle" x="39.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="166.25,-56.25 115,-56.25 115,-37 166.25,-37 166.25,-56.25"/>
-<text text-anchor="middle" x="140.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.39,-35.08C87.34,-36.6 95.66,-38.2 103.51,-39.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.58,-43.09 113.06,-41.53 103.9,-36.21 102.58,-43.09"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164.75,-19.25 116.5,-19.25 116.5,0 164.75,0 164.75,-19.25"/>
-<text text-anchor="middle" x="140.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.39,-20.56C87.8,-19.04 96.63,-17.43 104.87,-15.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.3,-19.42 114.51,-14.19 104.05,-12.53 105.3,-19.42"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph_org.svg b/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph_org.svg
deleted file mode 100644
index b49865b04..000000000
--- a/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: exact_solution Pages: 1 -->
-<svg width="174pt" height="64pt"
- viewBox="0.00 0.00 174.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>exact_solution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Exact solution of the problem. Used for solution comparison.">
-<polygon fill="#999999" stroke="#666666" points="79,-37.25 0,-37.25 0,-18 79,-18 79,-37.25"/>
-<text text-anchor="middle" x="39.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="166.25,-56.25 115,-56.25 115,-37 166.25,-37 166.25,-56.25"/>
-<text text-anchor="middle" x="140.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.39,-35.08C87.34,-36.6 95.66,-38.2 103.51,-39.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.58,-43.09 113.06,-41.53 103.9,-36.21 102.58,-43.09"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164.75,-19.25 116.5,-19.25 116.5,0 164.75,0 164.75,-19.25"/>
-<text text-anchor="middle" x="140.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.39,-20.56C87.8,-19.04 96.63,-17.43 104.87,-15.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.3,-19.42 114.51,-14.19 104.05,-12.53 105.3,-19.42"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_source.html b/d3/d06/ode__semi__implicit__euler_8cpp_source.html
new file mode 100644
index 000000000..1fd63606b
--- /dev/null
+++ b/d3/d06/ode__semi__implicit__euler_8cpp_source.html
@@ -0,0 +1,281 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/ode_semi_implicit_euler.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/d06/ode__semi__implicit__euler_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">ode_semi_implicit_euler.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/d06/ode__semi__implicit__euler_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="preprocessor">#include &lt;fstream&gt;</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#include &lt;valarray&gt;</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="foldopen" id="foldopen00053" data-start="{" data-end="}">
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">   53</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x, std::valarray&lt;double&gt; *y,</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>             std::valarray&lt;double&gt; *dy) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> omega = 1.F;             <span class="comment">// some const for the problem</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    dy[0][0] = y[0][1];                   <span class="comment">// x dot</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    dy[0][1] = -omega * omega * y[0][0];  <span class="comment">// y dot</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}</div>
+</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="foldopen" id="foldopen00066" data-start="{" data-end="}">
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"><a class="line" href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b">   66</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b">exact_solution</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x, std::valarray&lt;double&gt; *y) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    y[0][0] = std::cos(x);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    y[0][1] = -std::sin(x);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>}</div>
+</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="foldopen" id="foldopen00082" data-start="{" data-end="}">
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="../../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f">   82</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f">semi_implicit_euler_step</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> dx, <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x,</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>                              std::valarray&lt;double&gt; *y,</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>                              std::valarray&lt;double&gt; *dy) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <a class="code hl_function" href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a>(x, y, dy);         <span class="comment">// update dy once</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    y[0][0] += dx * dy[0][0];  <span class="comment">// update y0</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <a class="code hl_function" href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a>(x, y, dy);         <span class="comment">// update dy once more</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    dy[0][0] = 0.f;      <span class="comment">// ignore y0</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    y[0] += dy[0] * dx;  <span class="comment">// update remaining using new dy</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>}</div>
+</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="foldopen" id="foldopen00103" data-start="{" data-end="}">
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"><a class="line" href="../../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089">  103</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089">semi_implicit_euler</a>(<span class="keywordtype">double</span> dx, <span class="keywordtype">double</span> x0, <span class="keywordtype">double</span> x_max,</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>                           std::valarray&lt;double&gt; *y,</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>                           <span class="keywordtype">bool</span> save_to_file = <span class="keyword">false</span>) {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    std::valarray&lt;double&gt; dy = y[0];</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    std::ofstream fp;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="keywordflow">if</span> (save_to_file) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        fp.open(<span class="stringliteral">&quot;semi_implicit_euler.csv&quot;</span>, std::ofstream::out);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        <span class="keywordflow">if</span> (!fp.is_open()) {</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>            std::perror(<span class="stringliteral">&quot;Error! &quot;</span>);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        }</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    }</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::size_t L = y-&gt;size();</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span> </div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <span class="comment">/* start integration */</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    std::clock_t t1 = std::clock();</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <span class="keywordtype">double</span> x = x0;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="keywordflow">do</span> {  <span class="comment">// iterate for each step of independent variable</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        <span class="keywordflow">if</span> (save_to_file &amp;&amp; fp.is_open()) {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>            <span class="comment">// write to file</span></div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>            fp &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; L - 1; i++) {</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>                fp &lt;&lt; y[0][i] &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>            }</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>            fp &lt;&lt; y[0][L - 1] &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        }</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        <a class="code hl_function" href="../../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f">semi_implicit_euler_step</a>(dx, x, y, &amp;dy);  <span class="comment">// perform integration</span></div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        x += dx;                                  <span class="comment">// update step</span></div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    } <span class="keywordflow">while</span> (x &lt;= x_max);  <span class="comment">// till upper limit of independent variable</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <span class="comment">/* end of integration */</span></div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    std::clock_t t2 = std::clock();</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span> </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <span class="keywordflow">if</span> (fp.is_open())</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>        fp.close();</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span> </div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(t2 - t1) / CLOCKS_PER_SEC;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>}</div>
+</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span> </div>
+<div class="foldopen" id="foldopen00153" data-start="{" data-end="}">
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"><a class="line" href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f">  153</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> &amp;X0, <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;X_MAX,</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>                         <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;step_size,</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>                         <span class="keyword">const</span> std::valarray&lt;double&gt; &amp;Y0) {</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    <span class="keywordtype">double</span> x = X0;</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    std::valarray&lt;double&gt; y = Y0;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span> </div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    std::ofstream fp(<span class="stringliteral">&quot;exact.csv&quot;</span>, std::ostream::out);</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    <span class="keywordflow">if</span> (!fp.is_open()) {</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        std::perror(<span class="stringliteral">&quot;Error! &quot;</span>);</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    }</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Finding exact solution\n&quot;</span>;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span> </div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    std::clock_t t1 = std::clock();</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        fp &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; y.size() - 1; i++) {</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>            fp &lt;&lt; y[i] &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>        }</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>        fp &lt;&lt; y[y.size() - 1] &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span> </div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        <a class="code hl_function" href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b">exact_solution</a>(x, &amp;y);</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span> </div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        x += step_size;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    } <span class="keywordflow">while</span> (x &lt;= X_MAX);</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    std::clock_t t2 = std::clock();</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    <span class="keywordtype">double</span> total_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(t2 - t1) / CLOCKS_PER_SEC;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tTime = &quot;</span> &lt;&lt; total_time &lt;&lt; <span class="stringliteral">&quot; ms\n&quot;</span>;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span> </div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    fp.close();</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>}</div>
+</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span> </div>
+<div class="foldopen" id="foldopen00189" data-start="{" data-end="}">
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"><a class="line" href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">  189</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[]) {</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    <span class="keywordtype">double</span> X0 = 0.f;                       <span class="comment">/* initial value of x0 */</span></div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    <span class="keywordtype">double</span> X_MAX = 10.F;                   <span class="comment">/* upper limit of integration */</span></div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    std::valarray&lt;double&gt; Y0 = {1.f, 0.f}; <span class="comment">/* initial value Y = y(x = x_0) */</span></div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    <span class="keywordtype">double</span> step_size;</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span> </div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    <span class="keywordflow">if</span> (argc == 1) {</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the step size: &quot;</span>;</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>        std::cin &gt;&gt; step_size;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        <span class="comment">// use commandline argument as independent variable step size</span></div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>        step_size = std::atof(argv[1]);</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    }</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span> </div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    <span class="comment">// get approximate solution</span></div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    <span class="keywordtype">double</span> total_time = <a class="code hl_function" href="../../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089">semi_implicit_euler</a>(step_size, X0, X_MAX, &amp;Y0, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tTime = &quot;</span> &lt;&lt; total_time &lt;&lt; <span class="stringliteral">&quot; ms\n&quot;</span>;</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span> </div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    <span class="comment">/* compute exact solution for comparion */</span></div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    <a class="code hl_function" href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a>(X0, X_MAX, step_size, Y0);</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span> </div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>}</div>
+</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="agroup__ode_html_ga3874d294ab00fe9ce8731c5b7991a089"><div class="ttname"><a href="../../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089">semi_implicit_euler</a></div><div class="ttdeci">double semi_implicit_euler(double dx, double x0, double x_max, std::valarray&lt; double &gt; *y, bool save_to_file=false)</div><div class="ttdoc">Compute approximation using the semi-implicit-Euler method in the given limits.</div><div class="ttdef"><b>Definition</b> <a href="#l00103">ode_semi_implicit_euler.cpp:103</a></div></div>
+<div class="ttc" id="agroup__ode_html_ga827bf009831ddc477c5fa8891d5cb35f"><div class="ttname"><a href="../../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f">semi_implicit_euler_step</a></div><div class="ttdeci">void semi_implicit_euler_step(const double dx, const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Compute next step approximation using the semi-implicit-Euler method.</div><div class="ttdef"><b>Definition</b> <a href="#l00082">ode_semi_implicit_euler.cpp:82</a></div></div>
+<div class="ttc" id="aode__semi__implicit__euler_8cpp_html_aa13517b8e5de1b75592052db7f7e237f"><div class="ttname"><a href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a></div><div class="ttdeci">void save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0)</div><div class="ttdef"><b>Definition</b> <a href="#l00153">ode_semi_implicit_euler.cpp:153</a></div></div>
+<div class="ttc" id="aode__semi__implicit__euler_8cpp_html_abaeae8f62a018d197f0187a1c80a90fe"><div class="ttname"><a href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a></div><div class="ttdeci">void problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Problem statement for a system with first-order differential equations. Updates the system differenti...</div><div class="ttdef"><b>Definition</b> <a href="#l00053">ode_semi_implicit_euler.cpp:53</a></div></div>
+<div class="ttc" id="aode__semi__implicit__euler_8cpp_html_af3adf7b092a87868917ee5fb4255192b"><div class="ttname"><a href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b">exact_solution</a></div><div class="ttdeci">void exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y)</div><div class="ttdoc">Exact solution of the problem. Used for solution comparison.</div><div class="ttdef"><b>Definition</b> <a href="#l00066">ode_semi_implicit_euler.cpp:66</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../d3/d06/ode__semi__implicit__euler_8cpp.html">ode_semi_implicit_euler.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/d09/node_8hpp.html b/d3/d09/node_8hpp.html
index f0db50aab..8bb94ff1b 100644
--- a/d3/d09/node_8hpp.html
+++ b/d3/d09/node_8hpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/node.hpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/node.hpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,7 @@ Include dependency graph for node.hpp:</div>
 </div><div class="textblock"><div class="dynheader">
 This graph shows which files directly or indirectly include this file:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/da2/node_8hpp__dep__incl.svg" width="382" height="111"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/da2/node_8hpp__dep__incl.svg" width="512" height="199"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 </div>
 </div>
 <p><a href="../../d3/d09/node_8hpp_source.html">Go to the source code of this file.</a></p>
@@ -143,11 +160,13 @@ Functions</h2></td></tr>
 <tr class="memitem:aed1593858f6a7284d21caa8839b65520"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aed1593858f6a7284d21caa8839b65520">display_all</a> (const <a class="el" href="../../db/d8b/struct_node.html">Node</a> *const inNode)</td></tr>
 <tr class="separator:aed1593858f6a7284d21caa8839b65520"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a134faa726adc30b00d03454f77b87a0f" id="r_a134faa726adc30b00d03454f77b87a0f"><td class="memTemplParams" colspan="2">template&lt;typename <a class="el" href="../../db/d8b/struct_node.html">Node</a> &gt; </td></tr>
-<tr class="memitem:a134faa726adc30b00d03454f77b87a0f"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; typename Node::value_type &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a134faa726adc30b00d03454f77b87a0f">push_all_to_vector</a> (const <a class="el" href="../../db/d8b/struct_node.html">Node</a> *const inNode, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> expected_size=0)</td></tr>
+<tr class="memitem:a134faa726adc30b00d03454f77b87a0f"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; typename Node::value_type &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a134faa726adc30b00d03454f77b87a0f">push_all_to_vector</a> (const <a class="el" href="../../db/d8b/struct_node.html">Node</a> *const inNode, const std::size_t expected_size=0)</td></tr>
 <tr class="separator:a134faa726adc30b00d03454f77b87a0f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Provides <a class="el" href="../../db/d8b/struct_node.html">Node</a> class and related utilities. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/d09/node_8hpp_source.html">node.hpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="aed1593858f6a7284d21caa8839b65520" name="aed1593858f6a7284d21caa8839b65520"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aed1593858f6a7284d21caa8839b65520">&#9670;&#160;</a></span>display_all()</h2>
@@ -165,12 +184,13 @@ template&lt;typename <a class="el" href="../../db/d8b/struct_node.html">Node</a>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d09/node_8hpp_source.html#l00031">31</a> of file <a class="el" href="../../d3/d09/node_8hpp_source.html">node.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   31</span>                                           {</div>
 <div class="line"><span class="lineno">   32</span>    traverse(inNode,</div>
-<div class="line"><span class="lineno">   33</span>             [](<span class="keyword">const</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>&amp; curNode) { <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; curNode.data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>; });</div>
+<div class="line"><span class="lineno">   33</span>             [](<span class="keyword">const</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>&amp; curNode) { std::cout &lt;&lt; curNode.data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>; });</div>
 <div class="line"><span class="lineno">   34</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="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</div></div>
+<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -183,27 +203,26 @@ template&lt;typename <a class="el" href="../../db/d8b/struct_node.html">Node</a>
 template&lt;typename <a class="el" href="../../db/d8b/struct_node.html">Node</a> &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; typename Node::value_type &gt; push_all_to_vector </td>
+          <td class="memname">std::vector&lt; typename Node::value_type &gt; push_all_to_vector </td>
           <td>(</td>
           <td class="paramtype">const <a class="el" href="../../db/d8b/struct_node.html">Node</a> *const</td>          <td class="paramname"><span class="paramname"><em>inNode</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></td>          <td class="paramname"><span class="paramname"><em>expected_size</em></span><span class="paramdefsep"> = </span><span class="paramdefval">0</span>&#160;)</td>
+          <td class="paramtype">const std::size_t</td>          <td class="paramname"><span class="paramname"><em>expected_size</em></span><span class="paramdefsep"> = </span><span class="paramdefval">0</span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d09/node_8hpp_source.html#l00037">37</a> of file <a class="el" href="../../d3/d09/node_8hpp_source.html">node.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   38</span>                                                                 {</div>
-<div class="line"><span class="lineno">   39</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;typename Node::value_type&gt;</a> res;</div>
-<div class="line"><span class="lineno">   40</span>    res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">reserve</a>(expected_size);</div>
+<div class="line"><span class="lineno">   39</span>    std::vector&lt;typename Node::value_type&gt; res;</div>
+<div class="line"><span class="lineno">   40</span>    res.reserve(expected_size);</div>
 <div class="line"><span class="lineno">   41</span>    traverse(inNode,</div>
-<div class="line"><span class="lineno">   42</span>             [&amp;res](<span class="keyword">const</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>&amp; curNode) { res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(curNode.data); });</div>
+<div class="line"><span class="lineno">   42</span>             [&amp;res](<span class="keyword">const</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>&amp; curNode) { res.push_back(curNode.data); });</div>
 <div class="line"><span class="lineno">   43</span>    <span class="keywordflow">return</span> res;</div>
 <div class="line"><span class="lineno">   44</span>}</div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="areserve_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">std::vector::reserve</a></div><div class="ttdeci">T reserve(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -227,6 +246,8 @@ template&lt;typename <a class="el" href="../../db/d8b/struct_node.html">Node</a>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d09/node_8hpp_source.html#l00023">23</a> of file <a class="el" href="../../d3/d09/node_8hpp_source.html">node.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   23</span>                                                              {</div>
 <div class="line"><span class="lineno">   24</span>    <span class="keywordflow">if</span> (inNode) {</div>
 <div class="line"><span class="lineno">   25</span>        action(*inNode);</div>
diff --git a/d3/d09/node_8hpp_source.html b/d3/d09/node_8hpp_source.html
index 346b5832d..dbc5731b5 100644
--- a/d3/d09/node_8hpp_source.html
+++ b/d3/d09/node_8hpp_source.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/node.hpp Source File</title>
+<title>TheAlgorithms/C++: data_structures/node.hpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -107,25 +124,19 @@ $(function(){initNavTree('d3/d09/node_8hpp_source.html','../../'); initResizable
   <div class="headertitle"><div class="title">node.hpp</div></div>
 </div><!--header-->
 <div class="contents">
-<a href="../../d3/d09/node_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * @file</span></div>
-<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * @brief  Provides Node class and related utilities</span></div>
-<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> **/</span></div>
+<a href="../../d3/d09/node_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
 <div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#ifndef DATA_STRUCTURES_NODE_HPP_</span></div>
 <div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#define DATA_STRUCTURES_NODE_HPP_</span></div>
 <div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
-<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;iostream&gt;</span>  <span class="comment">/// for std::cout</span></div>
-<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;memory&gt;</span>    <span class="comment">/// for std::shared_ptr</span></div>
-<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;vector&gt;</span>    <span class="comment">/// for std::vector</span></div>
-<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment"></span> </div>
-<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment">/** Definition of the node as a linked-list</span></div>
-<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment"> * \tparam ValueType type of data nodes of the linked list should contain</span></div>
-<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;memory&gt;</span>    </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
 <div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> ValueType&gt;</div>
 <div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="keyword">struct </span><a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> {</div>
 <div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="keyword">using </span>value_type = ValueType;</div>
 <div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    ValueType data = {};</div>
-<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Node&lt;ValueType&gt;</a>&gt; next = {};</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    std::shared_ptr&lt;Node&lt;ValueType&gt;&gt; next = {};</div>
 <div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>};</div>
 <div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
 <div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> Node, <span class="keyword">typename</span> Action&gt;</div>
@@ -139,27 +150,21 @@ $(function(){initNavTree('d3/d09/node_8hpp_source.html','../../'); initResizable
 <div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> Node&gt;</div>
 <div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keywordtype">void</span> display_all(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* <span class="keyword">const</span> inNode) {</div>
 <div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    traverse(inNode,</div>
-<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>             [](<span class="keyword">const</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>&amp; curNode) { <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; curNode.data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>; });</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>             [](<span class="keyword">const</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>&amp; curNode) { std::cout &lt;&lt; curNode.data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>; });</div>
 <div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>}</div>
 <div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
 <div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> Node&gt;</div>
-<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;typename Node::value_type&gt;</a> push_all_to_vector(</div>
-<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keyword">const</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* <span class="keyword">const</span> inNode, <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> expected_size = 0) {</div>
-<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;typename Node::value_type&gt;</a> res;</div>
-<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">reserve</a>(expected_size);</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>std::vector&lt;typename Node::value_type&gt; push_all_to_vector(</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keyword">const</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* <span class="keyword">const</span> inNode, <span class="keyword">const</span> std::size_t expected_size = 0) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    std::vector&lt;typename Node::value_type&gt; res;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    res.reserve(expected_size);</div>
 <div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    traverse(inNode,</div>
-<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>             [&amp;res](<span class="keyword">const</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>&amp; curNode) { res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(curNode.data); });</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>             [&amp;res](<span class="keyword">const</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>&amp; curNode) { res.push_back(curNode.data); });</div>
 <div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">return</span> res;</div>
 <div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>}</div>
 <div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
 <div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="preprocessor">#endif  </span><span class="comment">// DATA_STRUCTURES_NODE_HPP_</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="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="areserve_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">std::vector::reserve</a></div><div class="ttdeci">T reserve(T... args)</div></div>
-<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div></div>
-<div class="ttc" id="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></div></div>
-<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</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 class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/d3/d11/classdata__structures_1_1_stack__coll__graph.map b/d3/d11/classdata__structures_1_1_stack__coll__graph.map
index aa0179da9..ccb918e58 100644
--- a/d3/d11/classdata__structures_1_1_stack__coll__graph.map
+++ b/d3/d11/classdata__structures_1_1_stack__coll__graph.map
@@ -1,6 +1,6 @@
 <map id="data_structures::Stack&lt; T &gt;" name="data_structures::Stack&lt; T &gt;">
 <area shape="rect" id="Node000001" title="Class representation of a stack." alt="" coords="5,183,191,208"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/unique_ptr.html" title=" " alt="" coords="26,94,170,120"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="26,94,170,120"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="101,135,101,182,95,182,95,135"/>
 <area shape="rect" id="Node000003" title=" " alt="" coords="79,5,117,31"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="101,47,101,94,95,94,95,47"/>
diff --git a/d3/d11/classdata__structures_1_1_stack__coll__graph.md5 b/d3/d11/classdata__structures_1_1_stack__coll__graph.md5
index 276f1a59f..8904a7a1d 100644
--- a/d3/d11/classdata__structures_1_1_stack__coll__graph.md5
+++ b/d3/d11/classdata__structures_1_1_stack__coll__graph.md5
@@ -1 +1 @@
-e4f07cc465819f91d399e033e545f779
\ No newline at end of file
+e9cea5c7b8886882188820b752112f7c
\ No newline at end of file
diff --git a/d3/d11/classdata__structures_1_1_stack__coll__graph.svg b/d3/d11/classdata__structures_1_1_stack__coll__graph.svg
index a22c6bf35..bdbb3ed5b 100644
--- a/d3/d11/classdata__structures_1_1_stack__coll__graph.svg
+++ b/d3/d11/classdata__structures_1_1_stack__coll__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="123.25,-85.75 15.75,-85.75 15.75,-66.5 123.25,-66.5 123.25,-85.75"/>
 <text text-anchor="middle" x="69.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr&lt; T[]&gt;</text>
 </a>
diff --git a/d3/d11/classdata__structures_1_1_stack__coll__graph_org.svg b/d3/d11/classdata__structures_1_1_stack__coll__graph_org.svg
index 08ab12c73..a7174fe86 100644
--- a/d3/d11/classdata__structures_1_1_stack__coll__graph_org.svg
+++ b/d3/d11/classdata__structures_1_1_stack__coll__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="123.25,-85.75 15.75,-85.75 15.75,-66.5 123.25,-66.5 123.25,-85.75"/>
 <text text-anchor="middle" x="69.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr&lt; T[]&gt;</text>
 </a>
diff --git a/d3/d17/namespaceutil__functions.html b/d3/d17/namespaceutil__functions.html
index dc923651a..01f6e7296 100644
--- a/d3/d17/namespaceutil__functions.html
+++ b/d3/d17/namespaceutil__functions.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: util_functions Namespace Reference</title>
+<title>TheAlgorithms/C++: util_functions Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d3/d19/sparse__matrix_8cpp.html b/d3/d19/sparse__matrix_8cpp.html
index 0a1185a2b..3bd79826b 100644
--- a/d3/d19/sparse__matrix_8cpp.html
+++ b/d3/d19/sparse__matrix_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/sparse_matrix.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/sparse_matrix.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -115,7 +132,9 @@ Include dependency graph for sparse_matrix.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/dbc/sparse__matrix_8cpp__incl.svg" width="179" height="111"><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">
+</div>
+<p><a href="../../d3/d19/sparse__matrix_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
@@ -123,6 +142,8 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A sparse matrix is a matrix which has number of zeroes greater than \(\frac{m\times n}{2}\), where m and n are the dimensions of the matrix. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/d19/sparse__matrix_8cpp_source.html">sparse_matrix.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -139,25 +160,27 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d19/sparse__matrix_8cpp_source.html#l00009">9</a> of file <a class="el" href="../../d3/d19/sparse__matrix_8cpp_source.html">sparse_matrix.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">    9</span>           {</div>
 <div class="line"><span class="lineno">   10</span>    <span class="keywordtype">int</span> m, n;</div>
 <div class="line"><span class="lineno">   11</span>    <span class="keywordtype">int</span> counterZeros = 0;</div>
 <div class="line"><span class="lineno">   12</span> </div>
-<div class="line"><span class="lineno">   13</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter dimensions of matrix (seperated with space): &quot;</span>;</div>
-<div class="line"><span class="lineno">   14</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; m;</div>
-<div class="line"><span class="lineno">   15</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;</div>
+<div class="line"><span class="lineno">   13</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter dimensions of matrix (seperated with space): &quot;</span>;</div>
+<div class="line"><span class="lineno">   14</span>    std::cin &gt;&gt; m;</div>
+<div class="line"><span class="lineno">   15</span>    std::cin &gt;&gt; n;</div>
 <div class="line"><span class="lineno">   16</span> </div>
 <div class="line"><span class="lineno">   17</span>    <span class="keywordtype">int</span> **a = <span class="keyword">new</span> <span class="keywordtype">int</span> *[m];</div>
 <div class="line"><span class="lineno">   18</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; m; i++) a[i] = <span class="keyword">new</span> <span class="keywordtype">int</span>[n];</div>
 <div class="line"><span class="lineno">   19</span> </div>
-<div class="line"><span class="lineno">   20</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter matrix elements:&quot;</span>;</div>
-<div class="line"><span class="lineno">   21</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   20</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter matrix elements:&quot;</span>;</div>
+<div class="line"><span class="lineno">   21</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   22</span> </div>
 <div class="line"><span class="lineno">   23</span>    <span class="comment">// reads the matrix from stdin</span></div>
 <div class="line"><span class="lineno">   24</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; m; i++) {</div>
 <div class="line"><span class="lineno">   25</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
-<div class="line"><span class="lineno">   26</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;element? &quot;</span>;</div>
-<div class="line"><span class="lineno">   27</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; a[i][j];</div>
+<div class="line"><span class="lineno">   26</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;element? &quot;</span>;</div>
+<div class="line"><span class="lineno">   27</span>            std::cin &gt;&gt; a[i][j];</div>
 <div class="line"><span class="lineno">   28</span>        }</div>
 <div class="line"><span class="lineno">   29</span>    }</div>
 <div class="line"><span class="lineno">   30</span> </div>
@@ -171,16 +194,14 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   38</span> </div>
 <div class="line"><span class="lineno">   39</span>    <span class="comment">// makes sure the matrix is a sparse matrix</span></div>
 <div class="line"><span class="lineno">   40</span>    <span class="keywordflow">if</span> (counterZeros &gt; ((m * n) / 2))  <span class="comment">// Checking for sparse matrix</span></div>
-<div class="line"><span class="lineno">   41</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Sparse matrix&quot;</span>;</div>
+<div class="line"><span class="lineno">   41</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Sparse matrix&quot;</span>;</div>
 <div class="line"><span class="lineno">   42</span>    <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">   43</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Not a sparse matrix&quot;</span>;</div>
+<div class="line"><span class="lineno">   43</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Not a sparse matrix&quot;</span>;</div>
 <div class="line"><span class="lineno">   44</span> </div>
 <div class="line"><span class="lineno">   45</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; m; i++) <span class="keyword">delete</span>[] a[i];</div>
 <div class="line"><span class="lineno">   46</span>    <span class="keyword">delete</span>[] a;</div>
 <div class="line"><span class="lineno">   47</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   48</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/d3/d19/sparse__matrix_8cpp_source.html b/d3/d19/sparse__matrix_8cpp_source.html
new file mode 100644
index 000000000..96d621a02
--- /dev/null
+++ b/d3/d19/sparse__matrix_8cpp_source.html
@@ -0,0 +1,183 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/sparse_matrix.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/d19/sparse__matrix_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">sparse_matrix.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/d19/sparse__matrix_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="foldopen" id="foldopen00009" data-start="{" data-end="}">
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"><a class="line" href="../../d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">    9</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    <span class="keywordtype">int</span> m, n;</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    <span class="keywordtype">int</span> counterZeros = 0;</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter dimensions of matrix (seperated with space): &quot;</span>;</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    std::cin &gt;&gt; m;</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="keywordtype">int</span> **a = <span class="keyword">new</span> <span class="keywordtype">int</span> *[m];</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; m; i++) a[i] = <span class="keyword">new</span> <span class="keywordtype">int</span>[n];</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter matrix elements:&quot;</span>;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    <span class="comment">// reads the matrix from stdin</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; m; i++) {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;element? &quot;</span>;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>            std::cin &gt;&gt; a[i][j];</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        }</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    }</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="comment">// counts the zero&#39;s</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; m; i++) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>            <span class="keywordflow">if</span> (a[i][j] == 0)</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>                counterZeros++;  <span class="comment">// Counting number of zeroes</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        }</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    }</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="comment">// makes sure the matrix is a sparse matrix</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">if</span> (counterZeros &gt; ((m * n) / 2))  <span class="comment">// Checking for sparse matrix</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Sparse matrix&quot;</span>;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Not a sparse matrix&quot;</span>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; m; i++) <span class="keyword">delete</span>[] a[i];</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keyword">delete</span>[] a;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>}</div>
+</div>
+<div class="ttc" id="asparse__matrix_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00009">sparse_matrix.cpp:9</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../d3/d19/sparse__matrix_8cpp.html">sparse_matrix.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/d1f/structdata__structures_1_1list__array_1_1list-members.html b/d3/d1f/structdata__structures_1_1list__array_1_1list-members.html
index 4f5454965..1eba3f75c 100644
--- a/d3/d1f/structdata__structures_1_1list__array_1_1list-members.html
+++ b/d3/d1f/structdata__structures_1_1list__array_1_1list-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d3/d1f/structsearch_1_1sublist__search_1_1_node-members.html b/d3/d1f/structsearch_1_1sublist__search_1_1_node-members.html
index 94c28848d..4b942d9cf 100644
--- a/d3/d1f/structsearch_1_1sublist__search_1_1_node-members.html
+++ b/d3/d1f/structsearch_1_1sublist__search_1_1_node-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d3/d22/quick__sort__iterative_8cpp.html b/d3/d22/quick__sort__iterative_8cpp.html
index a5e71cd6f..0fb07800b 100644
--- a/d3/d22/quick__sort__iterative_8cpp.html
+++ b/d3/d22/quick__sort__iterative_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/quick_sort_iterative.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/quick_sort_iterative.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for quick_sort_iterative.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d33/quick__sort__iterative_8cpp__incl.svg" width="428" height="126"><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">
+</div>
+<p><a href="../../d3/d22/quick__sort__iterative_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -132,10 +151,10 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:aac8f44b28b4aa96444383030b28f8b34" id="r_aac8f44b28b4aa96444383030b28f8b34"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34">sorting::partition</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;arr, int start, int end)</td></tr>
+<tr class="memitem:aac8f44b28b4aa96444383030b28f8b34" id="r_aac8f44b28b4aa96444383030b28f8b34"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34">sorting::partition</a> (std::vector&lt; int &gt; &amp;arr, int start, int end)</td></tr>
 <tr class="memdesc:aac8f44b28b4aa96444383030b28f8b34"><td class="mdescLeft">&#160;</td><td class="mdescRight">The partition function sorts the array from start to end and uses the last element as the pivot.  <br /></td></tr>
 <tr class="separator:aac8f44b28b4aa96444383030b28f8b34"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a263595fd9a0163b5b997b89fab3a0dc5" id="r_a263595fd9a0163b5b997b89fab3a0dc5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5">sorting::iterativeQuickSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;arr)</td></tr>
+<tr class="memitem:a263595fd9a0163b5b997b89fab3a0dc5" id="r_a263595fd9a0163b5b997b89fab3a0dc5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5">sorting::iterativeQuickSort</a> (std::vector&lt; int &gt; &amp;arr)</td></tr>
 <tr class="memdesc:a263595fd9a0163b5b997b89fab3a0dc5"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main sorting function.  <br /></td></tr>
 <tr class="separator:a263595fd9a0163b5b997b89fab3a0dc5"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a88ec9ad42717780d6caaff9d3d6977f9" id="r_a88ec9ad42717780d6caaff9d3d6977f9"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a> ()</td></tr>
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Quick Sort without recursion. This method uses the stack instead. Both recursive and iterative implementations have O(n log n) best case and O(n^2) worst case. </p>
 <p><a href="https://stackoverflow.com/questions/12553238/quicksort-iterative-or-recursive">https://stackoverflow.com/questions/12553238/quicksort-iterative-or-recursive</a> <a href="https://en.wikipedia.org/wiki/Quicksort">https://en.wikipedia.org/wiki/Quicksort</a> <a href="https://www.geeksforgeeks.org/iterative-quick-sort/">https://www.geeksforgeeks.org/iterative-quick-sort/</a> </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/sebe324" target="_blank">Sebe324</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/d22/quick__sort__iterative_8cpp_source.html">quick_sort_iterative.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -166,17 +187,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d22/quick__sort__iterative_8cpp_source.html#l00128">128</a> of file <a class="el" href="../../d3/d22/quick__sort__iterative_8cpp_source.html">quick_sort_iterative.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  129</span>{</div>
 <div class="line"><span class="lineno">  130</span>    <a class="code hl_function" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>(); <span class="comment">// run self test implementation</span></div>
 <div class="line"><span class="lineno">  131</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  132</span>}</div>
-<div class="ttc" id="aquick__sort__iterative_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> quick_sort_iterative.cpp:94</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="512"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aquick__sort__iterative_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d22/quick__sort__iterative_8cpp_source.html#l00094">quick_sort_iterative.cpp:94</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a88ec9ad42717780d6caaff9d3d6977f9" name="a88ec9ad42717780d6caaff9d3d6977f9"></a>
@@ -196,45 +214,37 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d22/quick__sort__iterative_8cpp_source.html#l00094">94</a> of file <a class="el" href="../../d3/d22/quick__sort__iterative_8cpp_source.html">quick_sort_iterative.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   95</span>{</div>
 <div class="line"><span class="lineno">   96</span>    <span class="comment">//TEST 1 - Positive numbers</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&lt;int&gt;</a> case1={100,534,1000000,553,10,61,2000,238,2756,9,12,56,30};</div>
-<div class="line"><span class="lineno">   98</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;TEST 1\n&quot;</span>;</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>&lt;&lt;<span class="stringliteral">&quot;Before: \n&quot;</span>;</div>
-<div class="line"><span class="lineno">  100</span>    <span class="keywordflow">for</span>(<span class="keyword">auto</span> x : case1) <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;x&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;</div>
-<div class="line"><span class="lineno">  101</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   97</span>    std::vector&lt;int&gt; case1={100,534,1000000,553,10,61,2000,238,2756,9,12,56,30};</div>
+<div class="line"><span class="lineno">   98</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;TEST 1\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   99</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;Before: \n&quot;</span>;</div>
+<div class="line"><span class="lineno">  100</span>    <span class="keywordflow">for</span>(<span class="keyword">auto</span> x : case1) std::cout&lt;&lt;x&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><span class="lineno">  101</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  102</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5">sorting::iterativeQuickSort</a>(case1);</div>
-<div class="line"><span class="lineno">  103</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(case1),<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(case1)));</div>
-<div class="line"><span class="lineno">  104</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;Test 1 succesful!\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  105</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;After: \n&quot;</span>;</div>
-<div class="line"><span class="lineno">  106</span>    <span class="keywordflow">for</span>(<span class="keyword">auto</span> x : case1) <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;x&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;</div>
-<div class="line"><span class="lineno">  107</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  103</span>    assert(std::is_sorted(std::begin(case1),std::end(case1)));</div>
+<div class="line"><span class="lineno">  104</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;Test 1 succesful!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  105</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;After: \n&quot;</span>;</div>
+<div class="line"><span class="lineno">  106</span>    <span class="keywordflow">for</span>(<span class="keyword">auto</span> x : case1) std::cout&lt;&lt;x&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><span class="lineno">  107</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  108</span> </div>
 <div class="line"><span class="lineno">  109</span>    <span class="comment">//TEST 2 - Negative numbers</span></div>
-<div class="line"><span class="lineno">  110</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> case2={-10,-2,-5,-2,-3746,-785,-123, -452, -32456};</div>
-<div class="line"><span class="lineno">  111</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;TEST 2\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  112</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;Before: \n&quot;</span>;</div>
-<div class="line"><span class="lineno">  113</span>    <span class="keywordflow">for</span>(<span class="keyword">auto</span> x : case2) <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;x&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;</div>
-<div class="line"><span class="lineno">  114</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  110</span>    std::vector&lt;int&gt; case2={-10,-2,-5,-2,-3746,-785,-123, -452, -32456};</div>
+<div class="line"><span class="lineno">  111</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;TEST 2\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  112</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;Before: \n&quot;</span>;</div>
+<div class="line"><span class="lineno">  113</span>    <span class="keywordflow">for</span>(<span class="keyword">auto</span> x : case2) std::cout&lt;&lt;x&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><span class="lineno">  114</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  115</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5">sorting::iterativeQuickSort</a>(case2);</div>
-<div class="line"><span class="lineno">  116</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(case2),<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(case2)));</div>
-<div class="line"><span class="lineno">  117</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;Test 2 succesful!\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  118</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;After: \n&quot;</span>;</div>
-<div class="line"><span class="lineno">  119</span>    <span class="keywordflow">for</span>(<span class="keyword">auto</span> x : case2) <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;x&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;</div>
-<div class="line"><span class="lineno">  120</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  116</span>    assert(std::is_sorted(std::begin(case2),std::end(case2)));</div>
+<div class="line"><span class="lineno">  117</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;Test 2 succesful!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  118</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;After: \n&quot;</span>;</div>
+<div class="line"><span class="lineno">  119</span>    <span class="keywordflow">for</span>(<span class="keyword">auto</span> x : case2) std::cout&lt;&lt;x&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><span class="lineno">  120</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  121</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="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-<div class="ttc" id="anamespacesorting_html_a263595fd9a0163b5b997b89fab3a0dc5"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5">sorting::iterativeQuickSort</a></div><div class="ttdeci">void iterativeQuickSort(std::vector&lt; int &gt; &amp;arr)</div><div class="ttdoc">The main sorting function.</div><div class="ttdef"><b>Definition</b> quick_sort_iterative.cpp:58</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg" width="619" height="283"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacesorting_html_a263595fd9a0163b5b997b89fab3a0dc5"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5">sorting::iterativeQuickSort</a></div><div class="ttdeci">void iterativeQuickSort(std::vector&lt; int &gt; &amp;arr)</div><div class="ttdoc">The main sorting function.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d22/quick__sort__iterative_8cpp_source.html#l00058">quick_sort_iterative.cpp:58</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map b/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
deleted file mode 100644
index 8ffe4f08f..000000000
--- a/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
+++ /dev/null
@@ -1,25 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,80,56,106"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="151,5,229,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="46,77,71,58,103,40,135,28,137,33,105,45,74,63,49,82"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="156,55,224,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,86,140,73,141,78,57,92"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="140,104,240,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="57,94,125,104,124,110,56,99"/>
-<area shape="rect" id="Node000005" href="$d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5" title="The main sorting function." alt="" coords="104,153,276,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="50,104,75,122,105,140,118,145,116,150,102,145,72,127,46,108"/>
-<area shape="rect" id="Node000006" href="$d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34" title="The partition function sorts the array from start to end and uses the last element as the pivot." alt="" coords="324,55,439,80"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="252,150,275,140,289,128,298,116,307,103,322,89,328,86,331,90,326,94,311,106,303,119,293,132,277,144,255,155"/>
-<area shape="rect" id="Node000008" href="$d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" title=" " alt="" coords="340,104,423,130"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="242,150,325,129,326,134,244,155"/>
-<area shape="rect" id="Node000009" href="$d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" title=" " alt="" coords="337,153,426,179"/>
-<area shape="poly" id="edge8_Node000005_Node000009" title=" " alt="" coords="276,164,322,164,322,169,276,169"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="324,203,439,228"/>
-<area shape="poly" id="edge10_Node000005_Node000011" title=" " alt="" coords="244,177,315,196,314,201,242,182"/>
-<area shape="rect" id="Node000012" href="$d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" title=" " alt="" coords="342,252,421,278"/>
-<area shape="poly" id="edge11_Node000005_Node000012" title=" " alt="" coords="215,177,325,238,334,243,332,248,323,243,212,182"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="511,55,589,80"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="439,65,495,65,495,70,439,70"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="487,153,613,179"/>
-<area shape="poly" id="edge9_Node000009_Node000010" title=" " alt="" coords="427,164,472,164,472,169,427,169"/>
-</map>
diff --git a/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 b/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
deleted file mode 100644
index e36ac93fb..000000000
--- a/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-158ce392a4ad655ed5e2070c61b55785
\ No newline at end of file
diff --git a/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg b/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
deleted file mode 100644
index 9f9e9c4c1..000000000
--- a/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
+++ /dev/null
@@ -1,245 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="464pt" height="212pt"
- viewBox="0.00 0.00 463.50 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-148.25 0,-148.25 0,-129 37.75,-129 37.75,-148.25"/>
-<text text-anchor="middle" x="18.88" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="167.75,-204.25 109,-204.25 109,-185 167.75,-185 167.75,-204.25"/>
-<text text-anchor="middle" x="138.38" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.55,-148.64C42,-157.14 58.05,-169.14 73.75,-176.62 81.3,-180.23 89.71,-183.24 97.87,-185.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.72,-189.01 107.3,-188.32 98.6,-182.27 96.72,-189.01"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164,-167.25 112.75,-167.25 112.75,-148 164,-148 164,-167.25"/>
-<text text-anchor="middle" x="138.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.23,-141.59C55.04,-144.31 80.39,-148.41 101.25,-151.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.68,-155.24 111.11,-153.38 101.79,-148.33 100.68,-155.24"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176,-130.25 100.75,-130.25 100.75,-111 176,-111 176,-130.25"/>
-<text text-anchor="middle" x="138.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.23,-135.81C51.96,-133.71 71.39,-130.73 89.41,-127.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.83,-131.45 99.18,-126.48 88.77,-124.53 89.83,-131.45"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5" target="_top" xlink:title="The main sorting function.">
-<polygon fill="white" stroke="#666666" points="203,-93.25 73.75,-93.25 73.75,-74 203,-74 203,-93.25"/>
-<text text-anchor="middle" x="138.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::iterativeQuickSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.01,-128.57C42.49,-120.32 58.34,-108.86 73.75,-101.62 77.02,-100.09 80.45,-98.66 83.96,-97.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.84,-100.73 93.15,-94.15 82.55,-94.11 84.84,-100.73"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34" target="_top" xlink:title="The partition function sorts the array from start to end and uses the last element as the pivot.">
-<polygon fill="white" stroke="#666666" points="325.12,-167.25 239.38,-167.25 239.38,-148 325.12,-148 325.12,-167.25"/>
-<text text-anchor="middle" x="282.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::partition</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.13,-93.69C192.02,-95.86 197.79,-98.48 203,-101.62 222.91,-113.67 219.9,-126.34 239,-139.62 240.35,-140.56 241.76,-141.47 243.2,-142.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="241.3,-145.29 251.78,-146.86 244.56,-139.1 241.3,-145.29"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="313.12,-130.25 251.38,-130.25 251.38,-111 313.12,-111 313.12,-130.25"/>
-<text text-anchor="middle" x="282.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M178.14,-93.74C197.35,-98.74 220.54,-104.79 240.06,-109.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.05,-113.24 249.61,-112.37 240.82,-106.46 239.05,-113.24"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="315.75,-93.25 248.75,-93.25 248.75,-74 315.75,-74 315.75,-93.25"/>
-<text text-anchor="middle" x="282.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge8_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge8_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.26,-83.62C214.71,-83.62 226.41,-83.62 237.14,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.84,-87.13 246.84,-83.63 236.84,-80.13 236.84,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.5,-56.25 239,-56.25 239,-37 325.5,-37 325.5,-56.25"/>
-<text text-anchor="middle" x="282.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node11 -->
-<g id="edge10_Node000005_Node000011" class="edge">
-<title>Node5&#45;&gt;Node11</title>
-<g id="a_edge10_Node000005_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M178.14,-73.51C194.72,-69.19 214.27,-64.09 231.87,-59.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.27,-63.02 241.06,-57.11 230.5,-56.24 232.27,-63.02"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312,-19.25 252.5,-19.25 252.5,0 312,0 312,-19.25"/>
-<text text-anchor="middle" x="282.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node12 -->
-<g id="edge11_Node000005_Node000012" class="edge">
-<title>Node5&#45;&gt;Node12</title>
-<g id="a_edge11_Node000005_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156,-73.54C175.53,-61.86 209.09,-42.35 239,-27.62 241.27,-26.51 243.62,-25.39 246,-24.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="247.37,-27.52 255.09,-20.26 244.53,-21.12 247.37,-27.52"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="437.88,-167.25 379.12,-167.25 379.12,-148 437.88,-148 437.88,-167.25"/>
-<text text-anchor="middle" x="408.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M325.32,-157.62C338.93,-157.62 353.98,-157.62 367.44,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="367.28,-161.13 377.28,-157.63 367.28,-154.13 367.28,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="455.5,-93.25 361.5,-93.25 361.5,-74 455.5,-74 455.5,-93.25"/>
-<text text-anchor="middle" x="408.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M316.22,-83.62C326.57,-83.62 338.32,-83.62 349.86,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="349.76,-87.13 359.76,-83.63 349.76,-80.13 349.76,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg b/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
deleted file mode 100644
index afa3fde81..000000000
--- a/d3/d22/quick__sort__iterative_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
+++ /dev/null
@@ -1,219 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="464pt" height="212pt"
- viewBox="0.00 0.00 463.50 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-148.25 0,-148.25 0,-129 37.75,-129 37.75,-148.25"/>
-<text text-anchor="middle" x="18.88" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="167.75,-204.25 109,-204.25 109,-185 167.75,-185 167.75,-204.25"/>
-<text text-anchor="middle" x="138.38" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.55,-148.64C42,-157.14 58.05,-169.14 73.75,-176.62 81.3,-180.23 89.71,-183.24 97.87,-185.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.72,-189.01 107.3,-188.32 98.6,-182.27 96.72,-189.01"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164,-167.25 112.75,-167.25 112.75,-148 164,-148 164,-167.25"/>
-<text text-anchor="middle" x="138.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.23,-141.59C55.04,-144.31 80.39,-148.41 101.25,-151.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.68,-155.24 111.11,-153.38 101.79,-148.33 100.68,-155.24"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176,-130.25 100.75,-130.25 100.75,-111 176,-111 176,-130.25"/>
-<text text-anchor="middle" x="138.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.23,-135.81C51.96,-133.71 71.39,-130.73 89.41,-127.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.83,-131.45 99.18,-126.48 88.77,-124.53 89.83,-131.45"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5" target="_top" xlink:title="The main sorting function.">
-<polygon fill="white" stroke="#666666" points="203,-93.25 73.75,-93.25 73.75,-74 203,-74 203,-93.25"/>
-<text text-anchor="middle" x="138.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::iterativeQuickSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.01,-128.57C42.49,-120.32 58.34,-108.86 73.75,-101.62 77.02,-100.09 80.45,-98.66 83.96,-97.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.84,-100.73 93.15,-94.15 82.55,-94.11 84.84,-100.73"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34" target="_top" xlink:title="The partition function sorts the array from start to end and uses the last element as the pivot.">
-<polygon fill="white" stroke="#666666" points="325.12,-167.25 239.38,-167.25 239.38,-148 325.12,-148 325.12,-167.25"/>
-<text text-anchor="middle" x="282.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::partition</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.13,-93.69C192.02,-95.86 197.79,-98.48 203,-101.62 222.91,-113.67 219.9,-126.34 239,-139.62 240.35,-140.56 241.76,-141.47 243.2,-142.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="241.3,-145.29 251.78,-146.86 244.56,-139.1 241.3,-145.29"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="313.12,-130.25 251.38,-130.25 251.38,-111 313.12,-111 313.12,-130.25"/>
-<text text-anchor="middle" x="282.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M178.14,-93.74C197.35,-98.74 220.54,-104.79 240.06,-109.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.05,-113.24 249.61,-112.37 240.82,-106.46 239.05,-113.24"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="315.75,-93.25 248.75,-93.25 248.75,-74 315.75,-74 315.75,-93.25"/>
-<text text-anchor="middle" x="282.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge8_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge8_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.26,-83.62C214.71,-83.62 226.41,-83.62 237.14,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.84,-87.13 246.84,-83.63 236.84,-80.13 236.84,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.5,-56.25 239,-56.25 239,-37 325.5,-37 325.5,-56.25"/>
-<text text-anchor="middle" x="282.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node11 -->
-<g id="edge10_Node000005_Node000011" class="edge">
-<title>Node5&#45;&gt;Node11</title>
-<g id="a_edge10_Node000005_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M178.14,-73.51C194.72,-69.19 214.27,-64.09 231.87,-59.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.27,-63.02 241.06,-57.11 230.5,-56.24 232.27,-63.02"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312,-19.25 252.5,-19.25 252.5,0 312,0 312,-19.25"/>
-<text text-anchor="middle" x="282.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node12 -->
-<g id="edge11_Node000005_Node000012" class="edge">
-<title>Node5&#45;&gt;Node12</title>
-<g id="a_edge11_Node000005_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156,-73.54C175.53,-61.86 209.09,-42.35 239,-27.62 241.27,-26.51 243.62,-25.39 246,-24.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="247.37,-27.52 255.09,-20.26 244.53,-21.12 247.37,-27.52"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="437.88,-167.25 379.12,-167.25 379.12,-148 437.88,-148 437.88,-167.25"/>
-<text text-anchor="middle" x="408.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M325.32,-157.62C338.93,-157.62 353.98,-157.62 367.44,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="367.28,-161.13 377.28,-157.63 367.28,-154.13 367.28,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="455.5,-93.25 361.5,-93.25 361.5,-74 455.5,-74 455.5,-93.25"/>
-<text text-anchor="middle" x="408.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M316.22,-83.62C326.57,-83.62 338.32,-83.62 349.86,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="349.76,-87.13 359.76,-83.63 349.76,-80.13 349.76,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 6e462d101..000000000
--- a/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,27 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,80,55,106"/>
-<area shape="rect" id="Node000002" href="$d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" title="Self&#45;test implementations." alt="" coords="103,80,153,106"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,90,88,90,88,96,55,96"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="248,5,326,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="143,77,169,58,200,40,232,28,234,33,202,45,172,63,146,82"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="253,55,321,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="153,86,237,73,238,78,154,92"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="237,104,337,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="154,94,222,104,221,110,153,99"/>
-<area shape="rect" id="Node000006" href="$d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5" title="The main sorting function." alt="" coords="201,153,373,179"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="147,104,172,122,202,140,216,145,214,150,200,145,169,127,144,108"/>
-<area shape="rect" id="Node000007" href="$d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34" title="The partition function sorts the array from start to end and uses the last element as the pivot." alt="" coords="422,55,536,80"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="350,150,372,140,387,128,396,116,405,103,420,89,425,86,428,90,423,94,409,106,400,119,390,132,375,144,352,155"/>
-<area shape="rect" id="Node000009" href="$d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" title=" " alt="" coords="438,104,520,130"/>
-<area shape="poly" id="edge8_Node000006_Node000009" title=" " alt="" coords="340,150,422,129,423,134,341,155"/>
-<area shape="rect" id="Node000010" href="$d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" title=" " alt="" coords="434,153,524,179"/>
-<area shape="poly" id="edge9_Node000006_Node000010" title=" " alt="" coords="374,164,419,164,419,169,374,169"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="421,203,537,228"/>
-<area shape="poly" id="edge11_Node000006_Node000012" title=" " alt="" coords="341,177,412,196,411,201,340,182"/>
-<area shape="rect" id="Node000013" href="$d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" title=" " alt="" coords="439,252,519,278"/>
-<area shape="poly" id="edge12_Node000006_Node000013" title=" " alt="" coords="312,177,423,238,432,243,430,248,420,243,309,182"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="608,55,686,80"/>
-<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="536,65,593,65,593,70,536,70"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="585,153,710,179"/>
-<area shape="poly" id="edge10_Node000010_Node000011" title=" " alt="" coords="524,164,569,164,569,169,524,169"/>
-</map>
diff --git a/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index d7351b2f3..000000000
--- a/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-59d4a23b72d21f40b7731e0cf5a8a31b
\ No newline at end of file
diff --git a/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 31d4a50db..000000000
--- a/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,320 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 212 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 537;
-var viewHeight = 212;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-148.25 0,-148.25 0,-129 37,-129 37,-148.25"/>
-<text text-anchor="middle" x="18.5" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-148.25 73,-148.25 73,-129 110.75,-129 110.75,-148.25"/>
-<text text-anchor="middle" x="91.88" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-138.62C44.55,-138.62 53.37,-138.62 61.69,-138.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-142.13 71.43,-138.63 61.43,-135.13 61.43,-142.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="240.75,-204.25 182,-204.25 182,-185 240.75,-185 240.75,-204.25"/>
-<text text-anchor="middle" x="211.38" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.55,-148.64C115,-157.14 131.05,-169.14 146.75,-176.62 154.3,-180.23 162.71,-183.24 170.87,-185.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.72,-189.01 180.3,-188.32 171.6,-182.27 169.72,-189.01"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237,-167.25 185.75,-167.25 185.75,-148 237,-148 237,-167.25"/>
-<text text-anchor="middle" x="211.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.23,-141.59C128.04,-144.31 153.39,-148.41 174.25,-151.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.68,-155.24 184.11,-153.38 174.79,-148.33 173.68,-155.24"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249,-130.25 173.75,-130.25 173.75,-111 249,-111 249,-130.25"/>
-<text text-anchor="middle" x="211.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.23,-135.81C124.96,-133.71 144.39,-130.73 162.41,-127.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.83,-131.45 172.18,-126.48 161.77,-124.53 162.83,-131.45"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5" target="_top" xlink:title="The main sorting function.">
-<polygon fill="white" stroke="#666666" points="276,-93.25 146.75,-93.25 146.75,-74 276,-74 276,-93.25"/>
-<text text-anchor="middle" x="211.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::iterativeQuickSort</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.01,-128.57C115.49,-120.32 131.34,-108.86 146.75,-101.62 150.02,-100.09 153.45,-98.66 156.96,-97.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.84,-100.73 166.15,-94.15 155.55,-94.11 157.84,-100.73"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34" target="_top" xlink:title="The partition function sorts the array from start to end and uses the last element as the pivot.">
-<polygon fill="white" stroke="#666666" points="398.12,-167.25 312.38,-167.25 312.38,-148 398.12,-148 398.12,-167.25"/>
-<text text-anchor="middle" x="355.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::partition</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.13,-93.69C265.02,-95.86 270.79,-98.48 276,-101.62 295.91,-113.67 292.9,-126.34 312,-139.62 313.35,-140.56 314.76,-141.47 316.2,-142.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.3,-145.29 324.78,-146.86 317.56,-139.1 314.3,-145.29"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="386.12,-130.25 324.38,-130.25 324.38,-111 386.12,-111 386.12,-130.25"/>
-<text text-anchor="middle" x="355.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge8_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge8_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.14,-93.74C270.35,-98.74 293.54,-104.79 313.06,-109.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="312.05,-113.24 322.61,-112.37 313.82,-106.46 312.05,-113.24"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="388.75,-93.25 321.75,-93.25 321.75,-74 388.75,-74 388.75,-93.25"/>
-<text text-anchor="middle" x="355.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge9_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge9_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M276.26,-83.62C287.71,-83.62 299.41,-83.62 310.14,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.84,-87.13 319.84,-83.63 309.84,-80.13 309.84,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="398.5,-56.25 312,-56.25 312,-37 398.5,-37 398.5,-56.25"/>
-<text text-anchor="middle" x="355.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node12 -->
-<g id="edge11_Node000006_Node000012" class="edge">
-<title>Node6&#45;&gt;Node12</title>
-<g id="a_edge11_Node000006_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.14,-73.51C267.72,-69.19 287.27,-64.09 304.87,-59.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.27,-63.02 314.06,-57.11 303.5,-56.24 305.27,-63.02"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385,-19.25 325.5,-19.25 325.5,0 385,0 385,-19.25"/>
-<text text-anchor="middle" x="355.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node13 -->
-<g id="edge12_Node000006_Node000013" class="edge">
-<title>Node6&#45;&gt;Node13</title>
-<g id="a_edge12_Node000006_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229,-73.54C248.53,-61.86 282.09,-42.35 312,-27.62 314.27,-26.51 316.62,-25.39 319,-24.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.37,-27.52 328.09,-20.26 317.53,-21.12 320.37,-27.52"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="510.88,-167.25 452.12,-167.25 452.12,-148 510.88,-148 510.88,-167.25"/>
-<text text-anchor="middle" x="481.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M398.32,-157.62C411.93,-157.62 426.98,-157.62 440.44,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="440.28,-161.13 450.28,-157.63 440.28,-154.13 440.28,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="528.5,-93.25 434.5,-93.25 434.5,-74 528.5,-74 528.5,-93.25"/>
-<text text-anchor="middle" x="481.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge10_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge10_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M389.22,-83.62C399.57,-83.62 411.32,-83.62 422.86,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="422.76,-87.13 432.76,-83.63 422.76,-80.13 422.76,-87.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 14e6a101d..000000000
--- a/d3/d22/quick__sort__iterative_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,237 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="537pt" height="212pt"
- viewBox="0.00 0.00 536.50 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-148.25 0,-148.25 0,-129 37,-129 37,-148.25"/>
-<text text-anchor="middle" x="18.5" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-148.25 73,-148.25 73,-129 110.75,-129 110.75,-148.25"/>
-<text text-anchor="middle" x="91.88" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-138.62C44.55,-138.62 53.37,-138.62 61.69,-138.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-142.13 71.43,-138.63 61.43,-135.13 61.43,-142.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="240.75,-204.25 182,-204.25 182,-185 240.75,-185 240.75,-204.25"/>
-<text text-anchor="middle" x="211.38" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.55,-148.64C115,-157.14 131.05,-169.14 146.75,-176.62 154.3,-180.23 162.71,-183.24 170.87,-185.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.72,-189.01 180.3,-188.32 171.6,-182.27 169.72,-189.01"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237,-167.25 185.75,-167.25 185.75,-148 237,-148 237,-167.25"/>
-<text text-anchor="middle" x="211.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.23,-141.59C128.04,-144.31 153.39,-148.41 174.25,-151.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.68,-155.24 184.11,-153.38 174.79,-148.33 173.68,-155.24"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249,-130.25 173.75,-130.25 173.75,-111 249,-111 249,-130.25"/>
-<text text-anchor="middle" x="211.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.23,-135.81C124.96,-133.71 144.39,-130.73 162.41,-127.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.83,-131.45 172.18,-126.48 161.77,-124.53 162.83,-131.45"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5" target="_top" xlink:title="The main sorting function.">
-<polygon fill="white" stroke="#666666" points="276,-93.25 146.75,-93.25 146.75,-74 276,-74 276,-93.25"/>
-<text text-anchor="middle" x="211.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::iterativeQuickSort</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.01,-128.57C115.49,-120.32 131.34,-108.86 146.75,-101.62 150.02,-100.09 153.45,-98.66 156.96,-97.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.84,-100.73 166.15,-94.15 155.55,-94.11 157.84,-100.73"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34" target="_top" xlink:title="The partition function sorts the array from start to end and uses the last element as the pivot.">
-<polygon fill="white" stroke="#666666" points="398.12,-167.25 312.38,-167.25 312.38,-148 398.12,-148 398.12,-167.25"/>
-<text text-anchor="middle" x="355.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::partition</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.13,-93.69C265.02,-95.86 270.79,-98.48 276,-101.62 295.91,-113.67 292.9,-126.34 312,-139.62 313.35,-140.56 314.76,-141.47 316.2,-142.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.3,-145.29 324.78,-146.86 317.56,-139.1 314.3,-145.29"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="386.12,-130.25 324.38,-130.25 324.38,-111 386.12,-111 386.12,-130.25"/>
-<text text-anchor="middle" x="355.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge8_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge8_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.14,-93.74C270.35,-98.74 293.54,-104.79 313.06,-109.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="312.05,-113.24 322.61,-112.37 313.82,-106.46 312.05,-113.24"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="388.75,-93.25 321.75,-93.25 321.75,-74 388.75,-74 388.75,-93.25"/>
-<text text-anchor="middle" x="355.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge9_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge9_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M276.26,-83.62C287.71,-83.62 299.41,-83.62 310.14,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.84,-87.13 319.84,-83.63 309.84,-80.13 309.84,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="398.5,-56.25 312,-56.25 312,-37 398.5,-37 398.5,-56.25"/>
-<text text-anchor="middle" x="355.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node12 -->
-<g id="edge11_Node000006_Node000012" class="edge">
-<title>Node6&#45;&gt;Node12</title>
-<g id="a_edge11_Node000006_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.14,-73.51C267.72,-69.19 287.27,-64.09 304.87,-59.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.27,-63.02 314.06,-57.11 303.5,-56.24 305.27,-63.02"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385,-19.25 325.5,-19.25 325.5,0 385,0 385,-19.25"/>
-<text text-anchor="middle" x="355.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node13 -->
-<g id="edge12_Node000006_Node000013" class="edge">
-<title>Node6&#45;&gt;Node13</title>
-<g id="a_edge12_Node000006_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229,-73.54C248.53,-61.86 282.09,-42.35 312,-27.62 314.27,-26.51 316.62,-25.39 319,-24.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.37,-27.52 328.09,-20.26 317.53,-21.12 320.37,-27.52"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="510.88,-167.25 452.12,-167.25 452.12,-148 510.88,-148 510.88,-167.25"/>
-<text text-anchor="middle" x="481.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M398.32,-157.62C411.93,-157.62 426.98,-157.62 440.44,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="440.28,-161.13 450.28,-157.63 440.28,-154.13 440.28,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="528.5,-93.25 434.5,-93.25 434.5,-74 528.5,-74 528.5,-93.25"/>
-<text text-anchor="middle" x="481.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge10_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge10_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M389.22,-83.62C399.57,-83.62 411.32,-83.62 422.86,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="422.76,-87.13 432.76,-83.63 422.76,-80.13 422.76,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d22/quick__sort__iterative_8cpp_source.html b/d3/d22/quick__sort__iterative_8cpp_source.html
new file mode 100644
index 000000000..c3c70c533
--- /dev/null
+++ b/d3/d22/quick__sort__iterative_8cpp_source.html
@@ -0,0 +1,246 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/quick_sort_iterative.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/d22/quick__sort__iterative_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">quick_sort_iterative.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/d22/quick__sort__iterative_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;iostream&gt;</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;vector&gt;</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;stack&gt;</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;algorithm&gt;</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;cassert&gt;</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="foldopen" id="foldopen00033" data-start="{" data-end="}">
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34">   33</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34">partition</a>(std::vector&lt;int&gt; &amp;arr, <span class="keywordtype">int</span> start, <span class="keywordtype">int</span> end)</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>{</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordtype">int</span> pivot = arr[end];</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordtype">int</span> index = start - 1;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = start; j &lt; end; j++) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        <span class="keywordflow">if</span> (arr[j] &lt;= pivot) {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>            std::swap(arr[++index], arr[j]);</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        }</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    std::swap(arr[index + 1], arr[end]);</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordflow">return</span> index + 1;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>}</div>
+</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="foldopen" id="foldopen00058" data-start="{" data-end="}">
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5">   58</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5">iterativeQuickSort</a>(std::vector&lt;int&gt; &amp;arr)</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>{</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    std::stack&lt;int&gt; <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordtype">int</span> start = 0;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordtype">int</span> end = arr.size()-1;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(start);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(end);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">while</span>(!<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.empty())</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        end = <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">top</a>();</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>();</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        start = <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">top</a>();</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>();</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        <span class="keywordtype">int</span> pivotIndex = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34">partition</a>(arr,start,end);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        <span class="keywordflow">if</span>(pivotIndex -1 &gt; start)</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(start);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(pivotIndex-1);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <span class="keywordflow">if</span>(pivotIndex+1&lt;end)</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(pivotIndex+1);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(end);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        }</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    }</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>}</div>
+</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>} <span class="comment">// namespace sorting</span></div>
+<div class="foldopen" id="foldopen00094" data-start="{" data-end="}">
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"><a class="line" href="../../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">   94</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>()</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>{</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="comment">//TEST 1 - Positive numbers</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    std::vector&lt;int&gt; case1={100,534,1000000,553,10,61,2000,238,2756,9,12,56,30};</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;TEST 1\n&quot;</span>;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;Before: \n&quot;</span>;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="keywordflow">for</span>(<span class="keyword">auto</span> x : case1) std::cout&lt;&lt;x&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5">sorting::iterativeQuickSort</a>(case1);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    assert(std::is_sorted(std::begin(case1),std::end(case1)));</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;Test 1 succesful!\n&quot;</span>;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;After: \n&quot;</span>;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="keywordflow">for</span>(<span class="keyword">auto</span> x : case1) std::cout&lt;&lt;x&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="comment">//TEST 2 - Negative numbers</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    std::vector&lt;int&gt; case2={-10,-2,-5,-2,-3746,-785,-123, -452, -32456};</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;TEST 2\n&quot;</span>;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;Before: \n&quot;</span>;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="keywordflow">for</span>(<span class="keyword">auto</span> x : case2) std::cout&lt;&lt;x&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5">sorting::iterativeQuickSort</a>(case2);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    assert(std::is_sorted(std::begin(case2),std::end(case2)));</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;Test 2 succesful!\n&quot;</span>;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;After: \n&quot;</span>;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <span class="keywordflow">for</span>(<span class="keyword">auto</span> x : case2) std::cout&lt;&lt;x&lt;&lt;<span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    std::cout&lt;&lt;<span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>}</div>
+</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span> </div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="foldopen" id="foldopen00128" data-start="{" data-end="}">
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"><a class="line" href="../../d3/d22/quick__sort__iterative_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  128</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/d22/quick__sort__iterative_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>()</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>{</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <a class="code hl_function" href="../../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>(); <span class="comment">// run self test implementation</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>}</div>
+</div>
+<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00019">stack.hpp:19</a></div></div>
+<div class="ttc" id="aclassstack_html_a3647fb4418890f19e0dc414b8092b8b0"><div class="ttname"><a href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00062">stack.hpp:62</a></div></div>
+<div class="ttc" id="aclassstack_html_a90df277532c23519aa7ac3c08ed90a1d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack::push</a></div><div class="ttdeci">void push(const value_type &amp;item)</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00047">stack.hpp:47</a></div></div>
+<div class="ttc" id="aclassstack_html_ae09630c4384903d187801921b2ddc709"><div class="ttname"><a href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">stack::top</a></div><div class="ttdeci">value_type top() const</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00056">stack.hpp:56</a></div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+<div class="ttc" id="anamespacesorting_html_a263595fd9a0163b5b997b89fab3a0dc5"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5">sorting::iterativeQuickSort</a></div><div class="ttdeci">void iterativeQuickSort(std::vector&lt; int &gt; &amp;arr)</div><div class="ttdoc">The main sorting function.</div><div class="ttdef"><b>Definition</b> <a href="#l00058">quick_sort_iterative.cpp:58</a></div></div>
+<div class="ttc" id="anamespacesorting_html_aac8f44b28b4aa96444383030b28f8b34"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34">sorting::partition</a></div><div class="ttdeci">int partition(std::vector&lt; int &gt; &amp;arr, int start, int end)</div><div class="ttdoc">The partition function sorts the array from start to end and uses the last element as the pivot.</div><div class="ttdef"><b>Definition</b> <a href="#l00033">quick_sort_iterative.cpp:33</a></div></div>
+<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00020">paranthesis_matching.cpp:20</a></div></div>
+<div class="ttc" id="aquick__sort__iterative_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="#l00094">quick_sort_iterative.cpp:94</a></div></div>
+<div class="ttc" id="aquick__sort__iterative_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d22/quick__sort__iterative_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00128">quick_sort_iterative.cpp:128</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d3/d22/quick__sort__iterative_8cpp.html">quick_sort_iterative.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/d22/saddleback__search_8cpp.html b/d3/d22/saddleback__search_8cpp.html
index 28ea0bb0f..9ad2713c7 100644
--- a/d3/d22/saddleback__search_8cpp.html
+++ b/d3/d22/saddleback__search_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: search/saddleback_search.cpp File Reference</title>
+<title>TheAlgorithms/C++: search/saddleback_search.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for saddleback_search.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d4c/saddleback__search_8cpp__incl.svg" width="336" height="111"><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">
+</div>
+<p><a href="../../d3/d22/saddleback__search_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dca/namespacesearch.html">search</a></td></tr>
@@ -134,7 +153,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:ad1e0ca34797d88490747c08eca70a2e6" id="r_ad1e0ca34797d88490747c08eca70a2e6"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint32_t, uint32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &gt; <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>, int32_t element)</td></tr>
+<tr class="memitem:ad1e0ca34797d88490747c08eca70a2e6" id="r_ad1e0ca34797d88490747c08eca70a2e6"><td class="memItemLeft" align="right" valign="top">std::pair&lt; uint32_t, uint32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a> (std::vector&lt; std::vector&lt; int32_t &gt; &gt; <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>, int32_t element)</td></tr>
 <tr class="separator:ad1e0ca34797d88490747c08eca70a2e6"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
 <tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test implementations.  <br /></td></tr>
@@ -147,6 +166,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Implementation of <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a> for 2D arrays. </p>
 <p>Saddleback Algorithm is an algorithm that searches 2D array in linear time, i.e, O(m + n), where m is number of rows and n is number of columns of 2D array. Also, each row and column of the matrix should be sorted beforehand for this algorithm to work.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/HashirGJ8842" target="_blank">Hashir Niazi</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/d22/saddleback__search_8cpp_source.html">saddleback_search.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -165,17 +186,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d22/saddleback__search_8cpp_source.html#l00112">112</a> of file <a class="el" href="../../d3/d22/saddleback__search_8cpp_source.html">saddleback_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  112</span>           {</div>
 <div class="line"><span class="lineno">  113</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the tests</span></div>
 <div class="line"><span class="lineno">  114</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  115</span>}</div>
-<div class="ttc" id="asaddleback__search_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> saddleback_search.cpp:78</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d22/saddleback__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="307" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asaddleback__search_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d22/saddleback__search_8cpp_source.html#l00078">saddleback_search.cpp:78</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad1e0ca34797d88490747c08eca70a2e6" name="ad1e0ca34797d88490747c08eca70a2e6"></a>
@@ -185,9 +203,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint32_t, uint32_t &gt; search::saddleback::saddleback </td>
+          <td class="memname">std::pair&lt; uint32_t, uint32_t &gt; search::saddleback::saddleback </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &gt;</td>          <td class="paramname"><span class="paramname"><em>matrix</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; int32_t &gt; &gt;</td>          <td class="paramname"><span class="paramname"><em>matrix</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -203,27 +221,29 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
-<dl class="section return"><dt>Returns</dt><dd>An <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a> of with row and column populated within it, if the element is present. </dd>
+<dl class="section return"><dt>Returns</dt><dd>An std::pair of with row and column populated within it, if the element is present. </dd>
 <dd>
-An <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a> with (0, 0), if the element is not present. </dd></dl>
+An std::pair with (0, 0), if the element is not present. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d22/saddleback__search_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../d3/d22/saddleback__search_8cpp_source.html">saddleback_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   40</span>                                                           {</div>
 <div class="line"><span class="lineno">   41</span>    uint32_t left_index = 0;</div>
-<div class="line"><span class="lineno">   42</span>    uint32_t right_index = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>[0].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() - 1;  <span class="comment">// Start from top right corner</span></div>
+<div class="line"><span class="lineno">   42</span>    uint32_t right_index = <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>[0].size() - 1;  <span class="comment">// Start from top right corner</span></div>
 <div class="line"><span class="lineno">   43</span>    <span class="keywordflow">while</span> (left_index &lt;</div>
-<div class="line"><span class="lineno">   44</span>           <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()) {  <span class="comment">// Exit once the value of indexes get out of range.</span></div>
+<div class="line"><span class="lineno">   44</span>           <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>.size()) {  <span class="comment">// Exit once the value of indexes get out of range.</span></div>
 <div class="line"><span class="lineno">   45</span>        <span class="keywordflow">if</span> (element ==</div>
-<div class="line"><span class="lineno">   46</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>[left_index]</div>
+<div class="line"><span class="lineno">   46</span>            <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>[left_index]</div>
 <div class="line"><span class="lineno">   47</span>                  [right_index]) {  <span class="comment">// If value on this position of matrix is</span></div>
 <div class="line"><span class="lineno">   48</span>                                    <span class="comment">// equal to element, return (row, column).</span></div>
-<div class="line"><span class="lineno">   49</span>            <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(left_index + 1, right_index + 1);</div>
+<div class="line"><span class="lineno">   49</span>            <span class="keywordflow">return</span> std::make_pair(left_index + 1, right_index + 1);</div>
 <div class="line"><span class="lineno">   50</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (element &gt;</div>
-<div class="line"><span class="lineno">   51</span>                   <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>[left_index]</div>
+<div class="line"><span class="lineno">   51</span>                   <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>[left_index]</div>
 <div class="line"><span class="lineno">   52</span>                         [right_index]) {  <span class="comment">// Else if value on this position of</span></div>
 <div class="line"><span class="lineno">   53</span>                                           <span class="comment">// matrix is less than the element,</span></div>
 <div class="line"><span class="lineno">   54</span>                                           <span class="comment">// move left.</span></div>
 <div class="line"><span class="lineno">   55</span>            ++left_index;</div>
 <div class="line"><span class="lineno">   56</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (element &lt;</div>
-<div class="line"><span class="lineno">   57</span>                   <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>[left_index]</div>
+<div class="line"><span class="lineno">   57</span>                   <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>[left_index]</div>
 <div class="line"><span class="lineno">   58</span>                         [right_index]) {  <span class="comment">// Else if value on this position of</span></div>
 <div class="line"><span class="lineno">   59</span>                                           <span class="comment">// matrix is greater than the</span></div>
 <div class="line"><span class="lineno">   60</span>                                           <span class="comment">// element, move down.</span></div>
@@ -233,19 +253,12 @@ An <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utili
 <div class="line"><span class="lineno">   64</span>                --right_index;</div>
 <div class="line"><span class="lineno">   65</span>        }</div>
 <div class="line"><span class="lineno">   66</span>    }</div>
-<div class="line"><span class="lineno">   67</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
+<div class="line"><span class="lineno">   67</span>    <span class="keywordflow">return</span> std::make_pair(</div>
 <div class="line"><span class="lineno">   68</span>        0, 0);  <span class="comment">// If the program reaches here, that means one of the index</span></div>
 <div class="line"><span class="lineno">   69</span>                <span class="comment">// went out of index, hence no element present.</span></div>
 <div class="line"><span class="lineno">   70</span>}</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>
-<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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d22/saddleback__search_8cpp_ad1e0ca34797d88490747c08eca70a2e6_cgraph.svg" width="308" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="alu__decomposition_8h_html_ac029b636b353cefbb18b2fcc71e427e4"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; matrix</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbe/lu__decomposition_8h_source.html#l00019">lu_decomposition.h:19</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -273,43 +286,39 @@ Here is the call graph for this function:</div>
 
 <p>Test implementations. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d22/saddleback__search_8cpp_source.html#l00078">78</a> of file <a class="el" href="../../d3/d22/saddleback__search_8cpp_source.html">saddleback_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   78</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&lt;std::vector&lt;int32_t&gt;</a>&gt; <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a> = {{1, 10, 100, 1000, 10000},</div>
+<div class="line"><span class="lineno">   79</span>    std::vector&lt;std::vector&lt;int32_t&gt;&gt; <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a> = {{1, 10, 100, 1000, 10000},</div>
 <div class="line"><span class="lineno">   80</span>                                                {2, 20, 200, 2000, 20000},</div>
 <div class="line"><span class="lineno">   81</span>                                                {3, 30, 300, 3000, 30000},</div>
 <div class="line"><span class="lineno">   82</span>                                                {4, 40, 400, 4000, 40000},</div>
 <div class="line"><span class="lineno">   83</span>                                                {5, 50, 500, 5000, 50000}};</div>
 <div class="line"><span class="lineno">   84</span> </div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;uint32_t, uint32_t&gt;</a> not_found = <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">   86</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;uint32_t, uint32_t&gt;</a> test_answer;</div>
+<div class="line"><span class="lineno">   85</span>    std::pair&lt;uint32_t, uint32_t&gt; not_found = std::make_pair(0, 0);</div>
+<div class="line"><span class="lineno">   86</span>    std::pair&lt;uint32_t, uint32_t&gt; test_answer;</div>
 <div class="line"><span class="lineno">   87</span>    <span class="comment">// Test 1</span></div>
-<div class="line"><span class="lineno">   88</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;uint32_t, uint32_t&gt;</a> answer1 =</div>
-<div class="line"><span class="lineno">   89</span>        <a class="code hl_function" href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>, 123);</div>
+<div class="line"><span class="lineno">   88</span>    std::pair&lt;uint32_t, uint32_t&gt; answer1 =</div>
+<div class="line"><span class="lineno">   89</span>        <a class="code hl_function" href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>, 123);</div>
 <div class="line"><span class="lineno">   90</span>    assert(not_found == answer1);</div>
 <div class="line"><span class="lineno">   91</span>    <span class="comment">// Test 2</span></div>
-<div class="line"><span class="lineno">   92</span>    answer1 = <a class="code hl_function" href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>, 0);</div>
+<div class="line"><span class="lineno">   92</span>    answer1 = <a class="code hl_function" href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>, 0);</div>
 <div class="line"><span class="lineno">   93</span>    assert(not_found == answer1);</div>
 <div class="line"><span class="lineno">   94</span>    <span class="comment">// Test 3</span></div>
-<div class="line"><span class="lineno">   95</span>    answer1 = <a class="code hl_function" href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>, 1);</div>
-<div class="line"><span class="lineno">   96</span>    test_answer = <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);</div>
+<div class="line"><span class="lineno">   95</span>    answer1 = <a class="code hl_function" href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>, 1);</div>
+<div class="line"><span class="lineno">   96</span>    test_answer = std::make_pair(1, 1);</div>
 <div class="line"><span class="lineno">   97</span>    assert(test_answer == answer1);</div>
 <div class="line"><span class="lineno">   98</span>    <span class="comment">// Test 4</span></div>
-<div class="line"><span class="lineno">   99</span>    answer1 = <a class="code hl_function" href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>, 50000);</div>
-<div class="line"><span class="lineno">  100</span>    test_answer = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(5, 5);</div>
+<div class="line"><span class="lineno">   99</span>    answer1 = <a class="code hl_function" href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>, 50000);</div>
+<div class="line"><span class="lineno">  100</span>    test_answer = std::make_pair(5, 5);</div>
 <div class="line"><span class="lineno">  101</span>    assert(test_answer == answer1);</div>
 <div class="line"><span class="lineno">  102</span>    <span class="comment">// Test 5</span></div>
-<div class="line"><span class="lineno">  103</span>    answer1 = <a class="code hl_function" href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix</a>, 300);</div>
-<div class="line"><span class="lineno">  104</span>    test_answer = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(3, 3);</div>
+<div class="line"><span class="lineno">  103</span>    answer1 = <a class="code hl_function" href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a>(<a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>, 300);</div>
+<div class="line"><span class="lineno">  104</span>    test_answer = std::make_pair(3, 3);</div>
 <div class="line"><span class="lineno">  105</span>    assert(test_answer == answer1);</div>
 <div class="line"><span class="lineno">  106</span>}</div>
-<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
-<div class="ttc" id="asaddleback__search_8cpp_html_ad1e0ca34797d88490747c08eca70a2e6"><div class="ttname"><a href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a></div><div class="ttdeci">std::pair&lt; uint32_t, uint32_t &gt; saddleback(std::vector&lt; std::vector&lt; int32_t &gt; &gt; matrix, int32_t element)</div><div class="ttdef"><b>Definition</b> saddleback_search.cpp:39</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d22/saddleback__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="210" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asaddleback__search_8cpp_html_ad1e0ca34797d88490747c08eca70a2e6"><div class="ttname"><a href="#ad1e0ca34797d88490747c08eca70a2e6">search::saddleback::saddleback</a></div><div class="ttdeci">std::pair&lt; uint32_t, uint32_t &gt; saddleback(std::vector&lt; std::vector&lt; int32_t &gt; &gt; matrix, int32_t element)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d22/saddleback__search_8cpp_source.html#l00039">saddleback_search.cpp:39</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/d22/saddleback__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d3/d22/saddleback__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index a6da5bdb7..000000000
--- a/d3/d22/saddleback__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="97,5,204,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/d3/d22/saddleback__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d3/d22/saddleback__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 6e32ee08b..000000000
--- a/d3/d22/saddleback__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5ce391fd56a3c13bdf8c21ea50e4f900
\ No newline at end of file
diff --git a/d3/d22/saddleback__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d3/d22/saddleback__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 16698d8e3..000000000
--- a/d3/d22/saddleback__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="157pt" height="27pt"
- viewBox="0.00 0.00 157.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149,-19.25 68.5,-19.25 68.5,0 149,0 149,-19.25"/>
-<text text-anchor="middle" x="108.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.6,-9.62C39.48,-9.62 48.03,-9.62 56.87,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.6,-13.13 66.6,-9.63 56.6,-6.13 56.6,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d22/saddleback__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d3/d22/saddleback__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 2c8544738..000000000
--- a/d3/d22/saddleback__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="157pt" height="27pt"
- viewBox="0.00 0.00 157.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149,-19.25 68.5,-19.25 68.5,0 149,0 149,-19.25"/>
-<text text-anchor="middle" x="108.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.6,-9.62C39.48,-9.62 48.03,-9.62 56.87,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.6,-13.13 66.6,-9.63 56.6,-6.13 56.6,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d22/saddleback__search_8cpp_ad1e0ca34797d88490747c08eca70a2e6_cgraph.map b/d3/d22/saddleback__search_8cpp_ad1e0ca34797d88490747c08eca70a2e6_cgraph.map
deleted file mode 100644
index 7bea522e5..000000000
--- a/d3/d22/saddleback__search_8cpp_ad1e0ca34797d88490747c08eca70a2e6_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="search::saddleback::saddleback" name="search::saddleback::saddleback">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,23,140,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="192,5,299,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="140,31,176,26,177,31,141,36"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="188,55,303,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="140,50,172,55,171,60,140,55"/>
-</map>
diff --git a/d3/d22/saddleback__search_8cpp_ad1e0ca34797d88490747c08eca70a2e6_cgraph.md5 b/d3/d22/saddleback__search_8cpp_ad1e0ca34797d88490747c08eca70a2e6_cgraph.md5
deleted file mode 100644
index 46cd4df2d..000000000
--- a/d3/d22/saddleback__search_8cpp_ad1e0ca34797d88490747c08eca70a2e6_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c064d6185c6987dad57149f03a718a5d
\ No newline at end of file
diff --git a/d3/d22/saddleback__search_8cpp_ad1e0ca34797d88490747c08eca70a2e6_cgraph.svg b/d3/d22/saddleback__search_8cpp_ad1e0ca34797d88490747c08eca70a2e6_cgraph.svg
deleted file mode 100644
index 9d9794da3..000000000
--- a/d3/d22/saddleback__search_8cpp_ad1e0ca34797d88490747c08eca70a2e6_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: search::saddleback::saddleback Pages: 1 -->
-<svg width="231pt" height="64pt"
- viewBox="0.00 0.00 231.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>search::saddleback::saddleback</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="100.75,-42.88 0,-42.88 0,-12.37 100.75,-12.37 100.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">search::saddleback</text>
-<text text-anchor="middle" x="50.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::saddleback</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-56.25 139.75,-56.25 139.75,-37 220.25,-37 220.25,-56.25"/>
-<text text-anchor="middle" x="180" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.08,-35.03C110.04,-36.36 119.39,-37.75 128.37,-39.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.59,-42.51 138,-40.52 128.62,-35.59 127.59,-42.51"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.25,-19.25 136.75,-19.25 136.75,0 223.25,0 223.25,-19.25"/>
-<text text-anchor="middle" x="180" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.08,-20.61C108.89,-19.51 116.99,-18.37 124.89,-17.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.35,-20.73 134.76,-15.86 124.37,-13.8 125.35,-20.73"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d22/saddleback__search_8cpp_ad1e0ca34797d88490747c08eca70a2e6_cgraph_org.svg b/d3/d22/saddleback__search_8cpp_ad1e0ca34797d88490747c08eca70a2e6_cgraph_org.svg
deleted file mode 100644
index ee63a13ab..000000000
--- a/d3/d22/saddleback__search_8cpp_ad1e0ca34797d88490747c08eca70a2e6_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: search::saddleback::saddleback Pages: 1 -->
-<svg width="231pt" height="64pt"
- viewBox="0.00 0.00 231.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>search::saddleback::saddleback</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="100.75,-42.88 0,-42.88 0,-12.37 100.75,-12.37 100.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">search::saddleback</text>
-<text text-anchor="middle" x="50.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::saddleback</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-56.25 139.75,-56.25 139.75,-37 220.25,-37 220.25,-56.25"/>
-<text text-anchor="middle" x="180" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.08,-35.03C110.04,-36.36 119.39,-37.75 128.37,-39.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.59,-42.51 138,-40.52 128.62,-35.59 127.59,-42.51"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.25,-19.25 136.75,-19.25 136.75,0 223.25,0 223.25,-19.25"/>
-<text text-anchor="middle" x="180" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.08,-20.61C108.89,-19.51 116.99,-18.37 124.89,-17.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.35,-20.73 134.76,-15.86 124.37,-13.8 125.35,-20.73"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d22/saddleback__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/d22/saddleback__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index af84e5270..000000000
--- a/d3/d22/saddleback__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="194,5,301,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/d3/d22/saddleback__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/d22/saddleback__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 952846481..000000000
--- a/d3/d22/saddleback__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-00e379748516a0b917af9960f76c6896
\ No newline at end of file
diff --git a/d3/d22/saddleback__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/d22/saddleback__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 63f73f27d..000000000
--- a/d3/d22/saddleback__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="230pt" height="27pt"
- viewBox="0.00 0.00 230.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222,-19.25 141.5,-19.25 141.5,0 222,0 222,-19.25"/>
-<text text-anchor="middle" x="181.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.6,-9.62C112.48,-9.62 121.03,-9.62 129.87,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.6,-13.13 139.6,-9.63 129.6,-6.13 129.6,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d22/saddleback__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/d22/saddleback__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 4086d1832..000000000
--- a/d3/d22/saddleback__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="230pt" height="27pt"
- viewBox="0.00 0.00 230.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222,-19.25 141.5,-19.25 141.5,0 222,0 222,-19.25"/>
-<text text-anchor="middle" x="181.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.6,-9.62C112.48,-9.62 121.03,-9.62 129.87,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.6,-13.13 139.6,-9.63 129.6,-6.13 129.6,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d22/saddleback__search_8cpp_source.html b/d3/d22/saddleback__search_8cpp_source.html
new file mode 100644
index 000000000..3bbda4a7e
--- /dev/null
+++ b/d3/d22/saddleback__search_8cpp_source.html
@@ -0,0 +1,225 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: search/saddleback_search.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/d22/saddleback__search_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">saddleback_search.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/d22/saddleback__search_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a> {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/dda/namespacesaddleback.html">saddleback</a> {</div>
+<div class="foldopen" id="foldopen00039" data-start="{" data-end="}">
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../d3/d22/saddleback__search_8cpp.html#ad1e0ca34797d88490747c08eca70a2e6">   39</a></span>std::pair&lt;uint32_t, uint32_t&gt; <a class="code hl_namespace" href="../../d0/dda/namespacesaddleback.html">saddleback</a>(</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    std::vector&lt;std::vector&lt;int32_t&gt;&gt; <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>, int32_t element) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    uint32_t left_index = 0;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    uint32_t right_index = <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>[0].size() - 1;  <span class="comment">// Start from top right corner</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">while</span> (left_index &lt;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>           <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>.size()) {  <span class="comment">// Exit once the value of indexes get out of range.</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="keywordflow">if</span> (element ==</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>[left_index]</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>                  [right_index]) {  <span class="comment">// If value on this position of matrix is</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>                                    <span class="comment">// equal to element, return (row, column).</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            <span class="keywordflow">return</span> std::make_pair(left_index + 1, right_index + 1);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (element &gt;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>                   <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>[left_index]</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>                         [right_index]) {  <span class="comment">// Else if value on this position of</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>                                           <span class="comment">// matrix is less than the element,</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>                                           <span class="comment">// move left.</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            ++left_index;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (element &lt;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>                   <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>[left_index]</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>                         [right_index]) {  <span class="comment">// Else if value on this position of</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>                                           <span class="comment">// matrix is greater than the</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>                                           <span class="comment">// element, move down.</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            <span class="keywordflow">if</span> (!right_index)</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>                --right_index;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">return</span> std::make_pair(</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        0, 0);  <span class="comment">// If the program reaches here, that means one of the index</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>                <span class="comment">// went out of index, hence no element present.</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>}</div>
+</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>}  <span class="comment">// namespace saddleback</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>}  <span class="comment">// namespace search</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="foldopen" id="foldopen00078" data-start="{" data-end="}">
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"><a class="line" href="../../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   78</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    std::vector&lt;std::vector&lt;int32_t&gt;&gt; <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a> = {{1, 10, 100, 1000, 10000},</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>                                                {2, 20, 200, 2000, 20000},</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>                                                {3, 30, 300, 3000, 30000},</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>                                                {4, 40, 400, 4000, 40000},</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>                                                {5, 50, 500, 5000, 50000}};</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::pair&lt;uint32_t, uint32_t&gt; not_found = std::make_pair(0, 0);</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    std::pair&lt;uint32_t, uint32_t&gt; test_answer;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="comment">// Test 1</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    std::pair&lt;uint32_t, uint32_t&gt; answer1 =</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        search::saddleback::saddleback(<a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>, 123);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    assert(not_found == answer1);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="comment">// Test 2</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    answer1 = search::saddleback::saddleback(<a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>, 0);</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    assert(not_found == answer1);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="comment">// Test 3</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    answer1 = search::saddleback::saddleback(<a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>, 1);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    test_answer = std::make_pair(1, 1);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    assert(test_answer == answer1);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="comment">// Test 4</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    answer1 = search::saddleback::saddleback(<a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>, 50000);</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    test_answer = std::make_pair(5, 5);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    assert(test_answer == answer1);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="comment">// Test 5</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    answer1 = search::saddleback::saddleback(<a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>, 300);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    test_answer = std::make_pair(3, 3);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    assert(test_answer == answer1);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>}</div>
+</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="foldopen" id="foldopen00112" data-start="{" data-end="}">
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"><a class="line" href="../../d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  112</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <a class="code hl_function" href="../../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the tests</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>}</div>
+</div>
+<div class="ttc" id="alu__decomposition_8h_html_ac029b636b353cefbb18b2fcc71e427e4"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; matrix</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbe/lu__decomposition_8h_source.html#l00019">lu_decomposition.h:19</a></div></div>
+<div class="ttc" id="anamespacesaddleback_html"><div class="ttname"><a href="../../d0/dda/namespacesaddleback.html">saddleback</a></div><div class="ttdoc">Function for implementing Saddleback Algorithm.</div></div>
+<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> <a href="../../df/dd5/binary__search_8cpp_source.html#l00047">binary_search.cpp:47</a></div></div>
+<div class="ttc" id="asaddleback__search_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d3/d22/saddleback__search_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> <a href="#l00078">saddleback_search.cpp:78</a></div></div>
+<div class="ttc" id="asaddleback__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00112">saddleback_search.cpp:112</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../d3/d22/saddleback__search_8cpp.html">saddleback_search.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/d24/qr__decomposition_8cpp.html b/d3/d24/qr__decomposition_8cpp.html
index a1047281d..6cd28596d 100644
--- a/d3/d24/qr__decomposition_8cpp.html
+++ b/d3/d24/qr__decomposition_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/qr_decomposition.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/qr_decomposition.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for qr_decomposition.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/df9/qr__decomposition_8cpp__incl.svg" width="612" height="199"><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">
+</div>
+<p><a href="../../d3/d24/qr__decomposition_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a840291bc02cba5474a4cb46a9b9566fe" id="r_a840291bc02cba5474a4cb46a9b9566fe"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a840291bc02cba5474a4cb46a9b9566fe">main</a> (void)</td></tr>
@@ -132,6 +151,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Program to compute the <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> of a given matrix. </p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/d24/qr__decomposition_8cpp_source.html">qr_decomposition.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a840291bc02cba5474a4cb46a9b9566fe" name="a840291bc02cba5474a4cb46a9b9566fe"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a840291bc02cba5474a4cb46a9b9566fe">&#9670;&#160;</a></span>main()</h2>
@@ -148,53 +169,45 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d24/qr__decomposition_8cpp_source.html#l00023">23</a> of file <a class="el" href="../../d3/d24/qr__decomposition_8cpp_source.html">qr_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   23</span>               {</div>
 <div class="line"><span class="lineno">   24</span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> ROWS, COLUMNS;</div>
 <div class="line"><span class="lineno">   25</span> </div>
-<div class="line"><span class="lineno">   26</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the number of rows and columns: &quot;</span>;</div>
-<div class="line"><span class="lineno">   27</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; ROWS &gt;&gt; COLUMNS;</div>
+<div class="line"><span class="lineno">   26</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of rows and columns: &quot;</span>;</div>
+<div class="line"><span class="lineno">   27</span>    std::cin &gt;&gt; ROWS &gt;&gt; COLUMNS;</div>
 <div class="line"><span class="lineno">   28</span> </div>
-<div class="line"><span class="lineno">   29</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter matrix elements row-wise:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   29</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter matrix elements row-wise:\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   30</span> </div>
-<div class="line"><span class="lineno">   31</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;std::valarray&lt;double&gt;</a>&gt; A(ROWS);</div>
-<div class="line"><span class="lineno">   32</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;std::valarray&lt;double&gt;</a>&gt; Q(ROWS);</div>
-<div class="line"><span class="lineno">   33</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;std::valarray&lt;double&gt;</a>&gt; R(COLUMNS);</div>
-<div class="line"><span class="lineno">   34</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(ROWS, COLUMNS); i++) {</div>
+<div class="line"><span class="lineno">   31</span>    std::valarray&lt;std::valarray&lt;double&gt;&gt; A(ROWS);</div>
+<div class="line"><span class="lineno">   32</span>    std::valarray&lt;std::valarray&lt;double&gt;&gt; Q(ROWS);</div>
+<div class="line"><span class="lineno">   33</span>    std::valarray&lt;std::valarray&lt;double&gt;&gt; R(COLUMNS);</div>
+<div class="line"><span class="lineno">   34</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; std::max(ROWS, COLUMNS); i++) {</div>
 <div class="line"><span class="lineno">   35</span>        <span class="keywordflow">if</span> (i &lt; ROWS) {</div>
-<div class="line"><span class="lineno">   36</span>            A[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(COLUMNS);</div>
-<div class="line"><span class="lineno">   37</span>            Q[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(COLUMNS);</div>
+<div class="line"><span class="lineno">   36</span>            A[i] = std::valarray&lt;double&gt;(COLUMNS);</div>
+<div class="line"><span class="lineno">   37</span>            Q[i] = std::valarray&lt;double&gt;(COLUMNS);</div>
 <div class="line"><span class="lineno">   38</span>        }</div>
 <div class="line"><span class="lineno">   39</span>        <span class="keywordflow">if</span> (i &lt; COLUMNS) {</div>
-<div class="line"><span class="lineno">   40</span>            R[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(COLUMNS);</div>
+<div class="line"><span class="lineno">   40</span>            R[i] = std::valarray&lt;double&gt;(COLUMNS);</div>
 <div class="line"><span class="lineno">   41</span>        }</div>
 <div class="line"><span class="lineno">   42</span>    }</div>
 <div class="line"><span class="lineno">   43</span> </div>
 <div class="line"><span class="lineno">   44</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; ROWS; i++)</div>
 <div class="line"><span class="lineno">   45</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; COLUMNS; j++) std::cin &gt;&gt; A[i][j];</div>
 <div class="line"><span class="lineno">   46</span> </div>
-<div class="line"><span class="lineno">   47</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; A &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   47</span>    std::cout &lt;&lt; A &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   48</span> </div>
-<div class="line"><span class="lineno">   49</span>    clock_t t1 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">clock</a>();</div>
+<div class="line"><span class="lineno">   49</span>    clock_t t1 = clock();</div>
 <div class="line"><span class="lineno">   50</span>    qr_decompose(A, &amp;Q, &amp;R);</div>
-<div class="line"><span class="lineno">   51</span>    <span class="keywordtype">double</span> dtime = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">clock</a>() - t1) / CLOCKS_PER_SEC;</div>
+<div class="line"><span class="lineno">   51</span>    <span class="keywordtype">double</span> dtime = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(clock() - t1) / CLOCKS_PER_SEC;</div>
 <div class="line"><span class="lineno">   52</span> </div>
-<div class="line"><span class="lineno">   53</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; Q &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   54</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; R &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   55</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Time taken to compute: &quot;</span> &lt;&lt; dtime &lt;&lt; <span class="stringliteral">&quot; sec\n &quot;</span>;</div>
+<div class="line"><span class="lineno">   53</span>    std::cout &lt;&lt; Q &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   54</span>    std::cout &lt;&lt; R &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   55</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Time taken to compute: &quot;</span> &lt;&lt; dtime &lt;&lt; <span class="stringliteral">&quot; sec\n &quot;</span>;</div>
 <div class="line"><span class="lineno">   56</span> </div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   58</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="aclock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a></div><div class="ttdeci">T clock(T... args)</div></div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg" width="180" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map b/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map
deleted file mode 100644
index 87708cd15..000000000
--- a/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="103,5,175,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 b/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5
deleted file mode 100644
index c1a37b9f4..000000000
--- a/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cfcc9d22fdb0436cf64f69e1bb02b4b4
\ No newline at end of file
diff --git a/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg b/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg
deleted file mode 100644
index 36271053b..000000000
--- a/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 135.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-19.25 73,-19.25 73,0 127.25,0 127.25,-19.25"/>
-<text text-anchor="middle" x="100.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.17,-9.62C44.35,-9.62 52.94,-9.62 61.41,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.22,-13.13 71.21,-9.63 61.21,-6.13 61.22,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg b/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg
deleted file mode 100644
index a1d93057c..000000000
--- a/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 135.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-19.25 73,-19.25 73,0 127.25,0 127.25,-19.25"/>
-<text text-anchor="middle" x="100.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.17,-9.62C44.35,-9.62 52.94,-9.62 61.41,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.22,-13.13 71.21,-9.63 61.21,-6.13 61.22,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d24/qr__decomposition_8cpp_source.html b/d3/d24/qr__decomposition_8cpp_source.html
new file mode 100644
index 000000000..96b4524a4
--- /dev/null
+++ b/d3/d24/qr__decomposition_8cpp_source.html
@@ -0,0 +1,190 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/qr_decomposition.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/d24/qr__decomposition_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">qr_decomposition.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/d24/qr__decomposition_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;array&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;cstdlib&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &quot;<a class="code" href="../../d4/d68/qr__decompose_8h.html">./qr_decompose.h</a>&quot;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="keyword">using </span><a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1">qr_algorithm::qr_decompose</a>;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="keyword">using </span>qr_algorithm::operator&lt;&lt;;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="foldopen" id="foldopen00023" data-start="{" data-end="}">
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"><a class="line" href="../../d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">   23</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">main</a>(<span class="keywordtype">void</span>) {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> ROWS, COLUMNS;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of rows and columns: &quot;</span>;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    std::cin &gt;&gt; ROWS &gt;&gt; COLUMNS;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter matrix elements row-wise:\n&quot;</span>;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    std::valarray&lt;std::valarray&lt;double&gt;&gt; A(ROWS);</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    std::valarray&lt;std::valarray&lt;double&gt;&gt; Q(ROWS);</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    std::valarray&lt;std::valarray&lt;double&gt;&gt; R(COLUMNS);</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; std::max(ROWS, COLUMNS); i++) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        <span class="keywordflow">if</span> (i &lt; ROWS) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>            A[i] = std::valarray&lt;double&gt;(COLUMNS);</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>            Q[i] = std::valarray&lt;double&gt;(COLUMNS);</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        }</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        <span class="keywordflow">if</span> (i &lt; COLUMNS) {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>            R[i] = std::valarray&lt;double&gt;(COLUMNS);</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        }</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; ROWS; i++)</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; COLUMNS; j++) std::cin &gt;&gt; A[i][j];</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    std::cout &lt;&lt; A &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    clock_t t1 = clock();</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    qr_decompose(A, &amp;Q, &amp;R);</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordtype">double</span> dtime = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(clock() - t1) / CLOCKS_PER_SEC;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    std::cout &lt;&lt; Q &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    std::cout &lt;&lt; R &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Time taken to compute: &quot;</span> &lt;&lt; dtime &lt;&lt; <span class="stringliteral">&quot; sec\n &quot;</span>;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}</div>
+</div>
+<div class="ttc" id="anamespaceqr__algorithm_html_a73ce637634fc49e1d10d190eb388ebf1"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1">qr_algorithm::qr_decompose</a></div><div class="ttdeci">void qr_decompose(const std::valarray&lt; std::valarray&lt; T &gt; &gt; &amp;A, std::valarray&lt; std::valarray&lt; T &gt; &gt; *Q, std::valarray&lt; std::valarray&lt; T &gt; &gt; *R)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d68/qr__decompose_8h_source.html#l00146">qr_decompose.h:146</a></div></div>
+<div class="ttc" id="aqr__decompose_8h_html"><div class="ttname"><a href="../../d4/d68/qr__decompose_8h.html">qr_decompose.h</a></div><div class="ttdoc">Library functions to compute QR decomposition of a given matrix.</div></div>
+<div class="ttc" id="aqr__decomposition_8cpp_html_a840291bc02cba5474a4cb46a9b9566fe"><div class="ttname"><a href="../../d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">main</a></div><div class="ttdeci">int main(void)</div><div class="ttdef"><b>Definition</b> <a href="#l00023">qr_decomposition.cpp:23</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../d3/d24/qr__decomposition_8cpp.html">qr_decomposition.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/d25/classdata__structures_1_1_stack-members.html b/d3/d25/classdata__structures_1_1_stack-members.html
index 963826600..ab7b5ec7e 100644
--- a/d3/d25/classdata__structures_1_1_stack-members.html
+++ b/d3/d25/classdata__structures_1_1_stack-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d3/d26/binary__search__tree_8cpp.html b/d3/d26/binary__search__tree_8cpp.html
index 2513f5ef8..23a0aeb56 100644
--- a/d3/d26/binary__search__tree_8cpp.html
+++ b/d3/d26/binary__search__tree_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/binary_search_tree.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/binary_search_tree.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for binary_search_tree.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d0c/binary__search__tree_8cpp__incl.svg" width="162" height="126"><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">
+</div>
+<p><a href="../../d3/d26/binary__search__tree_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/da1/structnode.html">node</a></td></tr>
@@ -153,14 +172,15 @@ Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:aebb1a5194a2cd7efe7ee7fc417e78293" id="r_aebb1a5194a2cd7efe7ee7fc417e78293"><td class="memItemLeft" align="right" valign="top"><a id="aebb1a5194a2cd7efe7ee7fc417e78293" name="aebb1a5194a2cd7efe7ee7fc417e78293"></a>
-<a class="el" href="../../dc/db5/struct_queue.html">Queue</a>&#160;</td><td class="memItemRight" valign="bottom"><b>queue</b></td></tr>
+<tr class="memitem:aebb1a5194a2cd7efe7ee7fc417e78293" id="r_aebb1a5194a2cd7efe7ee7fc417e78293"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aebb1a5194a2cd7efe7ee7fc417e78293">queue</a></td></tr>
 <tr class="separator:aebb1a5194a2cd7efe7ee7fc417e78293"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A simple tree implementation using structured nodes. </p>
 <dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000003">Todo</a></b></dt><dd>update code to use C++ STL library features and OO structure </dd></dl>
 <dl class="section warning"><dt>Warning</dt><dd>This program is a poor implementation - C style - and does not utilize any of the C++ STL features. </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="aa65d9b7fa9bd517ace3d819abc85c8b6" name="aa65d9b7fa9bd517ace3d819abc85c8b6"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aa65d9b7fa9bd517ace3d819abc85c8b6">&#9670;&#160;</a></span>BFT()</h2>
@@ -176,15 +196,16 @@ Variables</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00092">92</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   92</span>                  {</div>
 <div class="line"><span class="lineno">   93</span>    <span class="keywordflow">if</span> (n != NULL) {</div>
-<div class="line"><span class="lineno">   94</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><span class="lineno">   94</span>        std::cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
 <div class="line"><span class="lineno">   95</span>        enqueue(n-&gt;left);</div>
 <div class="line"><span class="lineno">   96</span>        enqueue(n-&gt;right);</div>
 <div class="line"><span class="lineno">   97</span>        BFT(dequeue());</div>
 <div class="line"><span class="lineno">   98</span>    }</div>
 <div class="line"><span class="lineno">   99</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><!-- fragment -->
 </div>
 </div>
@@ -202,9 +223,11 @@ Variables</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00027">27</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   27</span>{ <span class="keywordflow">return</span> (<a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>.t[<a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>.<a class="code hl_function" href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">front</a>++]); }</div>
-<div class="ttc" id="aclassqueue_html"><div class="ttname"><a href="../../db/da9/classqueue.html">queue</a></div><div class="ttdef"><b>Definition</b> queue.hpp:9</div></div>
-<div class="ttc" id="aclassqueue_html_a75e231798bc706b8b0773a07f78713e7"><div class="ttname"><a href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">queue::front</a></div><div class="ttdeci">value_type front() const</div><div class="ttdef"><b>Definition</b> queue.hpp:72</div></div>
+<div class="ttc" id="aclassqueue_html"><div class="ttname"><a href="../../db/da9/classqueue.html">queue</a></div><div class="ttdef"><b>Definition</b> <a href="../../d7/ded/queue_8hpp_source.html#l00009">queue.hpp:9</a></div></div>
+<div class="ttc" id="aclassqueue_html_a75e231798bc706b8b0773a07f78713e7"><div class="ttname"><a href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">queue::front</a></div><div class="ttdeci">value_type front() const</div><div class="ttdef"><b>Definition</b> <a href="../../d7/ded/queue_8hpp_source.html#l00072">queue.hpp:72</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -222,6 +245,8 @@ Variables</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00025">25</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   25</span>{ <a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>.t[<a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>.rear++] = n; }</div>
 </div><!-- fragment -->
 </div>
@@ -240,6 +265,8 @@ Variables</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   53</span>                             {</div>
 <div class="line"><span class="lineno">   54</span>    <span class="keywordflow">while</span> (n-&gt;right != NULL) {</div>
 <div class="line"><span class="lineno">   55</span>        n = n-&gt;right;</div>
@@ -263,10 +290,12 @@ Variables</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00109">109</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  109</span>                 {</div>
 <div class="line"><span class="lineno">  110</span>    <span class="keywordflow">if</span> (n != NULL) {</div>
 <div class="line"><span class="lineno">  111</span>        In(n-&gt;left);</div>
-<div class="line"><span class="lineno">  112</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><span class="lineno">  112</span>        std::cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
 <div class="line"><span class="lineno">  113</span>        In(n-&gt;right);</div>
 <div class="line"><span class="lineno">  114</span>    }</div>
 <div class="line"><span class="lineno">  115</span>}</div>
@@ -291,6 +320,8 @@ Variables</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   29</span>                            {</div>
 <div class="line"><span class="lineno">   30</span>    <span class="keywordflow">if</span> (x &lt; n-&gt;val) {</div>
 <div class="line"><span class="lineno">   31</span>        <span class="keywordflow">if</span> (n-&gt;left == NULL) {</div>
@@ -314,8 +345,8 @@ Variables</h2></td></tr>
 <div class="line"><span class="lineno">   49</span>        }</div>
 <div class="line"><span class="lineno">   50</span>    }</div>
 <div class="line"><span class="lineno">   51</span>}</div>
-<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -333,37 +364,39 @@ Variables</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00125">125</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  125</span>           {</div>
 <div class="line"><span class="lineno">  126</span>    <a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>.<a class="code hl_function" href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">front</a> = 0;</div>
 <div class="line"><span class="lineno">  127</span>    <a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>.rear = 0;</div>
 <div class="line"><span class="lineno">  128</span>    <span class="keywordtype">int</span> value;</div>
 <div class="line"><span class="lineno">  129</span>    <span class="keywordtype">int</span> ch;</div>
 <div class="line"><span class="lineno">  130</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *root = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
-<div class="line"><span class="lineno">  131</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter the value of root node :&quot;</span>;</div>
-<div class="line"><span class="lineno">  132</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; value;</div>
+<div class="line"><span class="lineno">  131</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the value of root node :&quot;</span>;</div>
+<div class="line"><span class="lineno">  132</span>    std::cin &gt;&gt; value;</div>
 <div class="line"><span class="lineno">  133</span>    root-&gt;val = value;</div>
 <div class="line"><span class="lineno">  134</span>    root-&gt;left = NULL;</div>
 <div class="line"><span class="lineno">  135</span>    root-&gt;right = NULL;</div>
 <div class="line"><span class="lineno">  136</span>    <span class="keywordflow">do</span> {</div>
-<div class="line"><span class="lineno">  137</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n1. Insert&quot;</span></div>
+<div class="line"><span class="lineno">  137</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n1. Insert&quot;</span></div>
 <div class="line"><span class="lineno">  138</span>                  &lt;&lt; <span class="stringliteral">&quot;\n2. Delete&quot;</span></div>
 <div class="line"><span class="lineno">  139</span>                  &lt;&lt; <span class="stringliteral">&quot;\n3. Breadth First&quot;</span></div>
 <div class="line"><span class="lineno">  140</span>                  &lt;&lt; <span class="stringliteral">&quot;\n4. Preorder Depth First&quot;</span></div>
 <div class="line"><span class="lineno">  141</span>                  &lt;&lt; <span class="stringliteral">&quot;\n5. Inorder Depth First&quot;</span></div>
 <div class="line"><span class="lineno">  142</span>                  &lt;&lt; <span class="stringliteral">&quot;\n6. Postorder Depth First&quot;</span>;</div>
 <div class="line"><span class="lineno">  143</span> </div>
-<div class="line"><span class="lineno">  144</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter Your Choice : &quot;</span>;</div>
-<div class="line"><span class="lineno">  145</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; ch;</div>
+<div class="line"><span class="lineno">  144</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter Your Choice : &quot;</span>;</div>
+<div class="line"><span class="lineno">  145</span>        std::cin &gt;&gt; ch;</div>
 <div class="line"><span class="lineno">  146</span>        <span class="keywordtype">int</span> x;</div>
 <div class="line"><span class="lineno">  147</span>        <span class="keywordflow">switch</span> (ch) {</div>
 <div class="line"><span class="lineno">  148</span>        <span class="keywordflow">case</span> 1:</div>
-<div class="line"><span class="lineno">  149</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter the value to be Inserted : &quot;</span>;</div>
-<div class="line"><span class="lineno">  150</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; x;</div>
+<div class="line"><span class="lineno">  149</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the value to be Inserted : &quot;</span>;</div>
+<div class="line"><span class="lineno">  150</span>            std::cin &gt;&gt; x;</div>
 <div class="line"><span class="lineno">  151</span>            Insert(root, x);</div>
 <div class="line"><span class="lineno">  152</span>            <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  153</span>        <span class="keywordflow">case</span> 2:</div>
-<div class="line"><span class="lineno">  154</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter the value to be Deleted : &quot;</span>;</div>
-<div class="line"><span class="lineno">  155</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; x;</div>
+<div class="line"><span class="lineno">  154</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the value to be Deleted : &quot;</span>;</div>
+<div class="line"><span class="lineno">  155</span>            std::cin &gt;&gt; x;</div>
 <div class="line"><span class="lineno">  156</span>            Remove(root, root, x);</div>
 <div class="line"><span class="lineno">  157</span>            <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  158</span>        <span class="keywordflow">case</span> 3:</div>
@@ -383,7 +416,6 @@ Variables</h2></td></tr>
 <div class="line"><span class="lineno">  172</span> </div>
 <div class="line"><span class="lineno">  173</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  174</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -401,11 +433,13 @@ Variables</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00117">117</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  117</span>                   {</div>
 <div class="line"><span class="lineno">  118</span>    <span class="keywordflow">if</span> (n != NULL) {</div>
 <div class="line"><span class="lineno">  119</span>        Post(n-&gt;left);</div>
 <div class="line"><span class="lineno">  120</span>        Post(n-&gt;right);</div>
-<div class="line"><span class="lineno">  121</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><span class="lineno">  121</span>        std::cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
 <div class="line"><span class="lineno">  122</span>    }</div>
 <div class="line"><span class="lineno">  123</span>}</div>
 </div><!-- fragment -->
@@ -425,9 +459,11 @@ Variables</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00101">101</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  101</span>                  {</div>
 <div class="line"><span class="lineno">  102</span>    <span class="keywordflow">if</span> (n != NULL) {</div>
-<div class="line"><span class="lineno">  103</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><span class="lineno">  103</span>        std::cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
 <div class="line"><span class="lineno">  104</span>        Pre(n-&gt;left);</div>
 <div class="line"><span class="lineno">  105</span>        Pre(n-&gt;right);</div>
 <div class="line"><span class="lineno">  106</span>    }</div>
@@ -458,6 +494,8 @@ Variables</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00060">60</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   60</span>                                     {</div>
 <div class="line"><span class="lineno">   61</span>    <span class="keywordflow">if</span> (n-&gt;val == x) {</div>
 <div class="line"><span class="lineno">   62</span>        <span class="keywordflow">if</span> (n-&gt;right == NULL &amp;&amp; n-&gt;left == NULL) {</div>
@@ -490,6 +528,23 @@ Variables</h2></td></tr>
 <div class="line"><span class="lineno">   89</span>    }</div>
 <div class="line"><span class="lineno">   90</span>}</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Variable Documentation</h2>
+<a id="aebb1a5194a2cd7efe7ee7fc417e78293" name="aebb1a5194a2cd7efe7ee7fc417e78293"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aebb1a5194a2cd7efe7ee7fc417e78293">&#9670;&#160;</a></span>queue</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a> queue</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00023">23</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
+
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/d26/binary__search__tree_8cpp_source.html b/d3/d26/binary__search__tree_8cpp_source.html
new file mode 100644
index 000000000..5659aa60a
--- /dev/null
+++ b/d3/d26/binary__search__tree_8cpp_source.html
@@ -0,0 +1,314 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/binary_search_tree.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/d26/binary__search__tree_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">binary_search_tree.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/d26/binary__search__tree_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="foldopen" id="foldopen00011" data-start="{" data-end="};">
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"><a class="line" href="../../d5/da1/structnode.html">   11</a></span><span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="keywordtype">int</span> val;</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *left;</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *right;</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>};</div>
+</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="foldopen" id="foldopen00017" data-start="{" data-end="};">
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"><a class="line" href="../../dc/db5/struct_queue.html">   17</a></span><span class="keyword">struct </span><a class="code hl_class" href="../../dc/db5/struct_queue.html">Queue</a> {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t[100];</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    <span class="keywordtype">int</span> front;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="keywordtype">int</span> rear;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>};</div>
+</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><a class="code hl_class" href="../../dc/db5/struct_queue.html">Queue</a> <a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keywordtype">void</span> enqueue(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n) { <a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>.t[<a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>.rear++] = n; }</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *dequeue() { <span class="keywordflow">return</span> (<a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>.t[<a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>.<a class="code hl_function" href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">front</a>++]); }</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keywordtype">void</span> Insert(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n, <span class="keywordtype">int</span> x) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">if</span> (x &lt; n-&gt;val) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        <span class="keywordflow">if</span> (n-&gt;left == NULL) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *temp = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>            temp-&gt;val = x;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>            temp-&gt;left = NULL;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>            temp-&gt;right = NULL;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>            n-&gt;left = temp;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>            Insert(n-&gt;left, x);</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        }</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        <span class="keywordflow">if</span> (n-&gt;right == NULL) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *temp = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>            temp-&gt;val = x;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>            temp-&gt;left = NULL;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>            temp-&gt;right = NULL;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            n-&gt;right = temp;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            Insert(n-&gt;right, x);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>}</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="keywordtype">int</span> findMaxInLeftST(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">while</span> (n-&gt;right != NULL) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        n = n-&gt;right;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">return</span> n-&gt;val;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="keywordtype">void</span> Remove(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *p, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n, <span class="keywordtype">int</span> x) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">if</span> (n-&gt;val == x) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordflow">if</span> (n-&gt;right == NULL &amp;&amp; n-&gt;left == NULL) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            <span class="keywordflow">if</span> (x &lt; p-&gt;val) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>                p-&gt;right = NULL;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>                p-&gt;left = NULL;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (n-&gt;right == NULL) {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            <span class="keywordflow">if</span> (x &lt; p-&gt;val) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>                p-&gt;right = n-&gt;left;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>                p-&gt;left = n-&gt;left;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            }</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (n-&gt;left == NULL) {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            <span class="keywordflow">if</span> (x &lt; p-&gt;val) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>                p-&gt;right = n-&gt;right;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>                p-&gt;left = n-&gt;right;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>            <span class="keywordtype">int</span> y = findMaxInLeftST(n-&gt;left);</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>            n-&gt;val = y;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            Remove(n, n-&gt;right, y);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        }</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x &lt; n-&gt;val) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        Remove(n, n-&gt;left, x);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        Remove(n, n-&gt;right, x);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>}</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span><span class="keywordtype">void</span> BFT(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="keywordflow">if</span> (n != NULL) {</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        std::cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        enqueue(n-&gt;left);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        enqueue(n-&gt;right);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        BFT(dequeue());</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    }</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>}</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span><span class="keywordtype">void</span> Pre(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n) {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="keywordflow">if</span> (n != NULL) {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        std::cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        Pre(n-&gt;left);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        Pre(n-&gt;right);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    }</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>}</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span><span class="keywordtype">void</span> In(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordflow">if</span> (n != NULL) {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        In(n-&gt;left);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        std::cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        In(n-&gt;right);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    }</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>}</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span><span class="keywordtype">void</span> Post(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n) {</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <span class="keywordflow">if</span> (n != NULL) {</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>        Post(n-&gt;left);</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        Post(n-&gt;right);</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        std::cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    }</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>}</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>.<a class="code hl_function" href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">front</a> = 0;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    <a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>.rear = 0;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    <span class="keywordtype">int</span> value;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    <span class="keywordtype">int</span> ch;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *root = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the value of root node :&quot;</span>;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    std::cin &gt;&gt; value;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    root-&gt;val = value;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    root-&gt;left = NULL;</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    root-&gt;right = NULL;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n1. Insert&quot;</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>                  &lt;&lt; <span class="stringliteral">&quot;\n2. Delete&quot;</span></div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>                  &lt;&lt; <span class="stringliteral">&quot;\n3. Breadth First&quot;</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>                  &lt;&lt; <span class="stringliteral">&quot;\n4. Preorder Depth First&quot;</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>                  &lt;&lt; <span class="stringliteral">&quot;\n5. Inorder Depth First&quot;</span></div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>                  &lt;&lt; <span class="stringliteral">&quot;\n6. Postorder Depth First&quot;</span>;</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span> </div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter Your Choice : &quot;</span>;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        std::cin &gt;&gt; ch;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        <span class="keywordtype">int</span> x;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        <span class="keywordflow">switch</span> (ch) {</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        <span class="keywordflow">case</span> 1:</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the value to be Inserted : &quot;</span>;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>            std::cin &gt;&gt; x;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>            Insert(root, x);</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>        <span class="keywordflow">case</span> 2:</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the value to be Deleted : &quot;</span>;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>            std::cin &gt;&gt; x;</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>            Remove(root, root, x);</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>        <span class="keywordflow">case</span> 3:</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>            BFT(root);</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        <span class="keywordflow">case</span> 4:</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>            Pre(root);</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>        <span class="keywordflow">case</span> 5:</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>            In(root);</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>        <span class="keywordflow">case</span> 6:</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>            Post(root);</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        }</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    } <span class="keywordflow">while</span> (ch != 0);</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span> </div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>}</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="aclassqueue_html"><div class="ttname"><a href="../../db/da9/classqueue.html">queue</a></div><div class="ttdef"><b>Definition</b> <a href="../../d7/ded/queue_8hpp_source.html#l00009">queue.hpp:9</a></div></div>
+<div class="ttc" id="aclassqueue_html_a75e231798bc706b8b0773a07f78713e7"><div class="ttname"><a href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">queue::front</a></div><div class="ttdeci">value_type front() const</div><div class="ttdef"><b>Definition</b> <a href="../../d7/ded/queue_8hpp_source.html#l00072">queue.hpp:72</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="astruct_queue_html"><div class="ttname"><a href="../../dc/db5/struct_queue.html">Queue</a></div><div class="ttdef"><b>Definition</b> <a href="#l00017">binary_search_tree.cpp:17</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html">binary_search_tree.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html
index a1ce70fe2..c7d1e2d4d 100644
--- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html
+++ b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::trie_using_hashmap::Trie Class Reference</title>
+<title>TheAlgorithms/C++: data_structures::trie_using_hashmap::Trie Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -133,33 +150,35 @@ Public Member Functions</h2></td></tr>
 &#160;</td><td class="memItemRight" valign="bottom"><b>Trie</b> ()=default</td></tr>
 <tr class="memdesc:a092d0805a9e647c2048777dbe67b35ab"><td class="mdescLeft">&#160;</td><td class="mdescRight">&lt; Constructor <br /></td></tr>
 <tr class="separator:a092d0805a9e647c2048777dbe67b35ab"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:abcae0a4456e7f583ce716e3ef466dfd2" id="r_abcae0a4456e7f583ce716e3ef466dfd2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abcae0a4456e7f583ce716e3ef466dfd2">insert</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;word)</td></tr>
+<tr class="memitem:abcae0a4456e7f583ce716e3ef466dfd2" id="r_abcae0a4456e7f583ce716e3ef466dfd2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abcae0a4456e7f583ce716e3ef466dfd2">insert</a> (const std::string &amp;word)</td></tr>
 <tr class="memdesc:abcae0a4456e7f583ce716e3ef466dfd2"><td class="mdescLeft">&#160;</td><td class="mdescRight">insert the string into the trie  <br /></td></tr>
 <tr class="separator:abcae0a4456e7f583ce716e3ef466dfd2"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad71eb24207c28b546631802dba97310f" id="r_ad71eb24207c28b546631802dba97310f"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad71eb24207c28b546631802dba97310f">search</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;word)</td></tr>
+<tr class="memitem:ad71eb24207c28b546631802dba97310f" id="r_ad71eb24207c28b546631802dba97310f"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad71eb24207c28b546631802dba97310f">search</a> (const std::string &amp;word)</td></tr>
 <tr class="memdesc:ad71eb24207c28b546631802dba97310f"><td class="mdescLeft">&#160;</td><td class="mdescRight">search a word/string inside the trie  <br /></td></tr>
 <tr class="separator:ad71eb24207c28b546631802dba97310f"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af3aee573fbabd2c1510c0f74f842dd17" id="r_af3aee573fbabd2c1510c0f74f842dd17"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af3aee573fbabd2c1510c0f74f842dd17">startwith</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;prefix)</td></tr>
+<tr class="memitem:af3aee573fbabd2c1510c0f74f842dd17" id="r_af3aee573fbabd2c1510c0f74f842dd17"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af3aee573fbabd2c1510c0f74f842dd17">startwith</a> (const std::string &amp;prefix)</td></tr>
 <tr class="memdesc:af3aee573fbabd2c1510c0f74f842dd17"><td class="mdescLeft">&#160;</td><td class="mdescRight">search a word/string that starts with a given prefix  <br /></td></tr>
 <tr class="separator:af3aee573fbabd2c1510c0f74f842dd17"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ac0bf3d6791cba144b3f539835d835e75" id="r_ac0bf3d6791cba144b3f539835d835e75"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac0bf3d6791cba144b3f539835d835e75">delete_word</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> word)</td></tr>
+<tr class="memitem:ac0bf3d6791cba144b3f539835d835e75" id="r_ac0bf3d6791cba144b3f539835d835e75"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac0bf3d6791cba144b3f539835d835e75">delete_word</a> (std::string word)</td></tr>
 <tr class="memdesc:ac0bf3d6791cba144b3f539835d835e75"><td class="mdescLeft">&#160;</td><td class="mdescRight">delete a word/string from a trie  <br /></td></tr>
 <tr class="separator:ac0bf3d6791cba144b3f539835d835e75"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a7bbe538c8015e8ce158e7ed43f605ebd" id="r_a7bbe538c8015e8ce158e7ed43f605ebd"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7bbe538c8015e8ce158e7ed43f605ebd">get_all_words</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; results, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</a> &gt; &amp;element, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> prefix)</td></tr>
+<tr class="memitem:a7bbe538c8015e8ce158e7ed43f605ebd" id="r_a7bbe538c8015e8ce158e7ed43f605ebd"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::string &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7bbe538c8015e8ce158e7ed43f605ebd">get_all_words</a> (std::vector&lt; std::string &gt; results, const std::shared_ptr&lt; <a class="el" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</a> &gt; &amp;element, std::string prefix)</td></tr>
 <tr class="memdesc:a7bbe538c8015e8ce158e7ed43f605ebd"><td class="mdescLeft">&#160;</td><td class="mdescRight">helper function to predict/recommend words that starts with a given prefix from the end of prefix's node iterate through all the child nodes by recursively appending all the possible words below the trie  <br /></td></tr>
 <tr class="separator:a7bbe538c8015e8ce158e7ed43f605ebd"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae15fdc7f2b5023992d87a711d78566c4" id="r_ae15fdc7f2b5023992d87a711d78566c4"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;prefix)</td></tr>
+<tr class="memitem:ae15fdc7f2b5023992d87a711d78566c4" id="r_ae15fdc7f2b5023992d87a711d78566c4"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::string &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a> (const std::string &amp;prefix)</td></tr>
 <tr class="memdesc:ae15fdc7f2b5023992d87a711d78566c4"><td class="mdescLeft">&#160;</td><td class="mdescRight">predict/recommend a word that starts with a given prefix  <br /></td></tr>
 <tr class="separator:ae15fdc7f2b5023992d87a711d78566c4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a832072498abeaa52ad43c4fc99cba248" id="r_a832072498abeaa52ad43c4fc99cba248"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a832072498abeaa52ad43c4fc99cba248">root_node</a></td></tr>
+<tr class="memitem:a832072498abeaa52ad43c4fc99cba248" id="r_a832072498abeaa52ad43c4fc99cba248"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a832072498abeaa52ad43c4fc99cba248">root_node</a></td></tr>
 <tr class="memdesc:a832072498abeaa52ad43c4fc99cba248"><td class="mdescLeft">&#160;</td><td class="mdescRight">declaring root node of trie  <br /></td></tr>
 <tr class="separator:a832072498abeaa52ad43c4fc99cba248"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a class="el" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" title="Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...">Trie</a> class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html">trie_using_hashmap.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="ac0bf3d6791cba144b3f539835d835e75" name="ac0bf3d6791cba144b3f539835d835e75"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ac0bf3d6791cba144b3f539835d835e75">&#9670;&#160;</a></span>delete_word()</h2>
@@ -173,7 +192,7 @@ Private Attributes</h2></td></tr>
         <tr>
           <td class="memname">void data_structures::trie_using_hashmap::Trie::delete_word </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>word</em></span></td><td>)</td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>word</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -191,9 +210,11 @@ Private Attributes</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00122">122</a> of file <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html">trie_using_hashmap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  122</span>                                     {</div>
-<div class="line"><span class="lineno">  123</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Node&gt;</a> curr = <a class="code hl_variable" href="#a832072498abeaa52ad43c4fc99cba248">root_node</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/stack.html">std::stack&lt;std::shared_ptr&lt;Node&gt;</a>&gt; nodes;</div>
+<div class="line"><span class="lineno">  123</span>        std::shared_ptr&lt;Node&gt; curr = <a class="code hl_variable" href="#a832072498abeaa52ad43c4fc99cba248">root_node</a>;</div>
+<div class="line"><span class="lineno">  124</span>        std::stack&lt;std::shared_ptr&lt;Node&gt;&gt; nodes;</div>
 <div class="line"><span class="lineno">  125</span>        <span class="keywordtype">int</span> cnt = 0;</div>
 <div class="line"><span class="lineno">  126</span>        <span class="keywordflow">for</span> (<span class="keywordtype">char</span> ch : word) {</div>
 <div class="line"><span class="lineno">  127</span>            <span class="keywordflow">if</span> (curr-&gt;children.find(ch) == curr-&gt;children.end()) {</div>
@@ -203,34 +224,24 @@ Private Attributes</h2></td></tr>
 <div class="line"><span class="lineno">  131</span>                cnt++;</div>
 <div class="line"><span class="lineno">  132</span>            }</div>
 <div class="line"><span class="lineno">  133</span> </div>
-<div class="line"><span class="lineno">  134</span>            nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(curr-&gt;children[ch]);</div>
+<div class="line"><span class="lineno">  134</span>            nodes.push(curr-&gt;children[ch]);</div>
 <div class="line"><span class="lineno">  135</span>            curr = curr-&gt;children[ch];</div>
 <div class="line"><span class="lineno">  136</span>        }</div>
 <div class="line"><span class="lineno">  137</span>        <span class="comment">// Delete only when it&#39;s a word, and it has children after</span></div>
 <div class="line"><span class="lineno">  138</span>        <span class="comment">// or prefix in the line</span></div>
-<div class="line"><span class="lineno">  139</span>        <span class="keywordflow">if</span> (nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>()-&gt;word_end) {</div>
-<div class="line"><span class="lineno">  140</span>            nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>()-&gt;word_end = <span class="keyword">false</span>;</div>
+<div class="line"><span class="lineno">  139</span>        <span class="keywordflow">if</span> (nodes.top()-&gt;word_end) {</div>
+<div class="line"><span class="lineno">  140</span>            nodes.top()-&gt;word_end = <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  141</span>        }</div>
 <div class="line"><span class="lineno">  142</span>        <span class="comment">// Delete only when it has no children after</span></div>
 <div class="line"><span class="lineno">  143</span>        <span class="comment">// and also no prefix in the line</span></div>
-<div class="line"><span class="lineno">  144</span>        <span class="keywordflow">while</span> (!(nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>()-&gt;word_end) &amp;&amp; nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>()-&gt;children.empty()) {</div>
-<div class="line"><span class="lineno">  145</span>            nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
-<div class="line"><span class="lineno">  146</span>            nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>()-&gt;children.erase(word.back());</div>
+<div class="line"><span class="lineno">  144</span>        <span class="keywordflow">while</span> (!(nodes.top()-&gt;word_end) &amp;&amp; nodes.top()-&gt;children.empty()) {</div>
+<div class="line"><span class="lineno">  145</span>            nodes.pop();</div>
+<div class="line"><span class="lineno">  146</span>            nodes.top()-&gt;children.erase(word.back());</div>
 <div class="line"><span class="lineno">  147</span>            word.pop_back();</div>
 <div class="line"><span class="lineno">  148</span>        }</div>
 <div class="line"><span class="lineno">  149</span>    }</div>
-<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_a832072498abeaa52ad43c4fc99cba248"><div class="ttname"><a href="#a832072498abeaa52ad43c4fc99cba248">data_structures::trie_using_hashmap::Trie::root_node</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; root_node</div><div class="ttdoc">declaring root node of trie</div><div class="ttdef"><b>Definition</b> trie_using_hashmap.cpp:51</div></div>
-<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/pop.html">std::stack::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
-<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/push.html">std::stack::push</a></div><div class="ttdeci">T push(T... args)</div></div>
-<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div></div>
-<div class="ttc" id="astack_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a></div></div>
-<div class="ttc" id="atop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/top.html">std::stack::top</a></div><div class="ttdeci">T top(T... args)</div></div>
-</div><!-- 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="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.svg" width="352" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_a832072498abeaa52ad43c4fc99cba248"><div class="ttname"><a href="#a832072498abeaa52ad43c4fc99cba248">data_structures::trie_using_hashmap::Trie::root_node</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; root_node</div><div class="ttdoc">declaring root node of trie</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00051">trie_using_hashmap.cpp:51</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7bbe538c8015e8ce158e7ed43f605ebd" name="a7bbe538c8015e8ce158e7ed43f605ebd"></a>
@@ -243,19 +254,19 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; data_structures::trie_using_hashmap::Trie::get_all_words </td>
+          <td class="memname">std::vector&lt; std::string &gt; data_structures::trie_using_hashmap::Trie::get_all_words </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt;</td>          <td class="paramname"><span class="paramname"><em>results</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::string &gt;</td>          <td class="paramname"><span class="paramname"><em>results</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>element</em></span>, </td>
+          <td class="paramtype">const std::shared_ptr&lt; <a class="el" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>element</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>prefix</em></span>&#160;)</td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>prefix</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -275,38 +286,32 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>list of recommended words </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00160">160</a> of file <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html">trie_using_hashmap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  162</span>                                                             {</div>
 <div class="line"><span class="lineno">  163</span>        <span class="keywordflow">if</span> (element-&gt;<a class="code hl_variable" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a3cdb077745d3dc97212d693132371219">word_end</a>) {</div>
-<div class="line"><span class="lineno">  164</span>            results.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(prefix);</div>
+<div class="line"><span class="lineno">  164</span>            results.push_back(prefix);</div>
 <div class="line"><span class="lineno">  165</span>        }</div>
 <div class="line"><span class="lineno">  166</span>        <span class="keywordflow">if</span> (element-&gt;<a class="code hl_variable" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a08212cdc99164b59da91b81f45e2f88e">children</a>.empty()) {</div>
 <div class="line"><span class="lineno">  167</span>            <span class="keywordflow">return</span> results;</div>
 <div class="line"><span class="lineno">  168</span>        }</div>
 <div class="line"><span class="lineno">  169</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span>&amp; x : element-&gt;<a class="code hl_variable" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a08212cdc99164b59da91b81f45e2f88e">children</a>) {</div>
-<div class="line"><span class="lineno">  170</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> key = <span class="stringliteral">&quot;&quot;</span>;</div>
+<div class="line"><span class="lineno">  170</span>            std::string key = <span class="stringliteral">&quot;&quot;</span>;</div>
 <div class="line"><span class="lineno">  171</span>            key = x.first;</div>
 <div class="line"><span class="lineno">  172</span>            prefix += key;</div>
 <div class="line"><span class="lineno">  173</span> </div>
 <div class="line"><span class="lineno">  174</span>            results =</div>
 <div class="line"><span class="lineno">  175</span>                <a class="code hl_function" href="#a7bbe538c8015e8ce158e7ed43f605ebd">get_all_words</a>(results, element-&gt;<a class="code hl_variable" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a08212cdc99164b59da91b81f45e2f88e">children</a>[x.first], prefix);</div>
 <div class="line"><span class="lineno">  176</span> </div>
-<div class="line"><span class="lineno">  177</span>            prefix.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html">pop_back</a>();</div>
+<div class="line"><span class="lineno">  177</span>            prefix.pop_back();</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>        <span class="keywordflow">return</span> results;</div>
 <div class="line"><span class="lineno">  181</span>    }</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_a7bbe538c8015e8ce158e7ed43f605ebd"><div class="ttname"><a href="#a7bbe538c8015e8ce158e7ed43f605ebd">data_structures::trie_using_hashmap::Trie::get_all_words</a></div><div class="ttdeci">std::vector&lt; std::string &gt; get_all_words(std::vector&lt; std::string &gt; results, const std::shared_ptr&lt; Node &gt; &amp;element, std::string prefix)</div><div class="ttdoc">helper function to predict/recommend words that starts with a given prefix from the end of prefix's n...</div><div class="ttdef"><b>Definition</b> trie_using_hashmap.cpp:160</div></div>
-<div class="ttc" id="apop_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html">std::string::pop_back</a></div><div class="ttdeci">T pop_back(T... args)</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="astructdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node_html_a08212cdc99164b59da91b81f45e2f88e"><div class="ttname"><a href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a08212cdc99164b59da91b81f45e2f88e">data_structures::trie_using_hashmap::Trie::Node::children</a></div><div class="ttdeci">std::unordered_map&lt; char16_t, std::shared_ptr&lt; Node &gt; &gt; children</div><div class="ttdef"><b>Definition</b> trie_using_hashmap.cpp:46</div></div>
-<div class="ttc" id="astructdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node_html_a3cdb077745d3dc97212d693132371219"><div class="ttname"><a href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a3cdb077745d3dc97212d693132371219">data_structures::trie_using_hashmap::Trie::Node::word_end</a></div><div class="ttdeci">bool word_end</div><div class="ttdoc">boolean variable to represent the node end</div><div class="ttdef"><b>Definition</b> trie_using_hashmap.cpp:48</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph.svg" width="363" height="100"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_a7bbe538c8015e8ce158e7ed43f605ebd"><div class="ttname"><a href="#a7bbe538c8015e8ce158e7ed43f605ebd">data_structures::trie_using_hashmap::Trie::get_all_words</a></div><div class="ttdeci">std::vector&lt; std::string &gt; get_all_words(std::vector&lt; std::string &gt; results, const std::shared_ptr&lt; Node &gt; &amp;element, std::string prefix)</div><div class="ttdoc">helper function to predict/recommend words that starts with a given prefix from the end of prefix's n...</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00160">trie_using_hashmap.cpp:160</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node_html_a08212cdc99164b59da91b81f45e2f88e"><div class="ttname"><a href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a08212cdc99164b59da91b81f45e2f88e">data_structures::trie_using_hashmap::Trie::Node::children</a></div><div class="ttdeci">std::unordered_map&lt; char16_t, std::shared_ptr&lt; Node &gt; &gt; children</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00046">trie_using_hashmap.cpp:46</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node_html_a3cdb077745d3dc97212d693132371219"><div class="ttname"><a href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a3cdb077745d3dc97212d693132371219">data_structures::trie_using_hashmap::Trie::Node::word_end</a></div><div class="ttdeci">bool word_end</div><div class="ttdoc">boolean variable to represent the node end</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00048">trie_using_hashmap.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abcae0a4456e7f583ce716e3ef466dfd2" name="abcae0a4456e7f583ce716e3ef466dfd2"></a>
@@ -321,7 +326,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void data_structures::trie_using_hashmap::Trie::insert </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>word</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>word</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -339,11 +344,13 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html">trie_using_hashmap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>                                       {</div>
-<div class="line"><span class="lineno">   63</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Node&gt;</a> curr = <a class="code hl_variable" href="#a832072498abeaa52ad43c4fc99cba248">root_node</a>;</div>
+<div class="line"><span class="lineno">   63</span>        std::shared_ptr&lt;Node&gt; curr = <a class="code hl_variable" href="#a832072498abeaa52ad43c4fc99cba248">root_node</a>;</div>
 <div class="line"><span class="lineno">   64</span>        <span class="keywordflow">for</span> (<span class="keywordtype">char</span> ch : word) {</div>
 <div class="line"><span class="lineno">   65</span>            <span class="keywordflow">if</span> (curr-&gt;children.find(ch) == curr-&gt;children.end()) {</div>
-<div class="line"><span class="lineno">   66</span>                curr-&gt;children[ch] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;Node&gt;</a>();</div>
+<div class="line"><span class="lineno">   66</span>                curr-&gt;children[ch] = std::make_shared&lt;Node&gt;();</div>
 <div class="line"><span class="lineno">   67</span>            }</div>
 <div class="line"><span class="lineno">   68</span>            curr = curr-&gt;children[ch];</div>
 <div class="line"><span class="lineno">   69</span>        }</div>
@@ -352,13 +359,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   72</span>            curr-&gt;word_end = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   73</span>        }</div>
 <div class="line"><span class="lineno">   74</span>    }</div>
-<div class="ttc" id="amake_shared_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared</a></div><div class="ttdeci">T make_shared(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph.svg" width="334" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae15fdc7f2b5023992d87a711d78566c4" name="ae15fdc7f2b5023992d87a711d78566c4"></a>
@@ -371,9 +372,9 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; data_structures::trie_using_hashmap::Trie::predict_words </td>
+          <td class="memname">std::vector&lt; std::string &gt; data_structures::trie_using_hashmap::Trie::predict_words </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>prefix</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>prefix</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -393,9 +394,11 @@ Here is the call graph for this function:</div>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>list of recommended words </dd></dl>
 <p>&lt; iteratively and recursively get the recommended words</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00188">188</a> of file <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html">trie_using_hashmap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  188</span>                                                                {</div>
-<div class="line"><span class="lineno">  189</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::string&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
-<div class="line"><span class="lineno">  190</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Node&gt;</a> curr = <a class="code hl_variable" href="#a832072498abeaa52ad43c4fc99cba248">root_node</a>;</div>
+<div class="line"><span class="lineno">  189</span>        std::vector&lt;std::string&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
+<div class="line"><span class="lineno">  190</span>        std::shared_ptr&lt;Node&gt; curr = <a class="code hl_variable" href="#a832072498abeaa52ad43c4fc99cba248">root_node</a>;</div>
 <div class="line"><span class="lineno">  191</span>        <span class="comment">// traversing until the end of the given prefix in trie</span></div>
 <div class="line"><span class="lineno">  192</span> </div>
 <div class="line"><span class="lineno">  193</span>        <span class="keywordflow">for</span> (<span class="keywordtype">char</span> ch : prefix) {</div>
@@ -414,18 +417,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  206</span> </div>
 <div class="line"><span class="lineno">  207</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="#a7bbe538c8015e8ce158e7ed43f605ebd">get_all_words</a>(</div>
 <div class="line"><span class="lineno">  208</span>            result, curr,</div>
-<div class="line"><span class="lineno">  209</span>            prefix);  <span class="comment">///&lt; iteratively and recursively get the recommended words</span></div>
+<div class="line"><span class="lineno">  209</span>            prefix);  </div>
 <div class="line"><span class="lineno">  210</span> </div>
 <div class="line"><span class="lineno">  211</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  212</span>    }</div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph.svg" width="560" height="100"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad71eb24207c28b546631802dba97310f" name="ad71eb24207c28b546631802dba97310f"></a>
@@ -440,7 +437,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool data_structures::trie_using_hashmap::Trie::search </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>word</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>word</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -461,8 +458,10 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if found </dd>
 <dd>
 <code>false</code> if not found </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00082">82</a> of file <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html">trie_using_hashmap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   82</span>                                       {</div>
-<div class="line"><span class="lineno">   83</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Node&gt;</a> curr = <a class="code hl_variable" href="#a832072498abeaa52ad43c4fc99cba248">root_node</a>;</div>
+<div class="line"><span class="lineno">   83</span>        std::shared_ptr&lt;Node&gt; curr = <a class="code hl_variable" href="#a832072498abeaa52ad43c4fc99cba248">root_node</a>;</div>
 <div class="line"><span class="lineno">   84</span>        <span class="keywordflow">for</span> (<span class="keywordtype">char</span> ch : word) {</div>
 <div class="line"><span class="lineno">   85</span>            <span class="keywordflow">if</span> (curr-&gt;children.find(ch) == curr-&gt;children.end()) {</div>
 <div class="line"><span class="lineno">   86</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
@@ -494,7 +493,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool data_structures::trie_using_hashmap::Trie::startwith </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>prefix</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>prefix</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -515,8 +514,10 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if found </dd>
 <dd>
 <code>false</code> if not found </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html">trie_using_hashmap.cpp</a>.</p>
 <div class="fragment"><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/memory/shared_ptr.html">std::shared_ptr&lt;Node&gt;</a> curr = <a class="code hl_variable" href="#a832072498abeaa52ad43c4fc99cba248">root_node</a>;</div>
+<div class="line"><span class="lineno">  108</span>        std::shared_ptr&lt;Node&gt; curr = <a class="code hl_variable" href="#a832072498abeaa52ad43c4fc99cba248">root_node</a>;</div>
 <div class="line"><span class="lineno">  109</span>        <span class="keywordflow">for</span> (<span class="keywordtype">char</span> ch : prefix) {</div>
 <div class="line"><span class="lineno">  110</span>            <span class="keywordflow">if</span> (curr-&gt;children.find(ch) == curr-&gt;children.end()) {</div>
 <div class="line"><span class="lineno">  111</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
@@ -539,7 +540,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt;<a class="el" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</a>&gt; data_structures::trie_using_hashmap::Trie::root_node</td>
+          <td class="memname">std::shared_ptr&lt;<a class="el" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</a>&gt; data_structures::trie_using_hashmap::Trie::root_node</td>
         </tr>
       </table>
   </td>
@@ -549,14 +550,16 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <b>Initial value:</b><div class="fragment"><div class="line">=</div>
-<div class="line">        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;Node&gt;</a>()</div>
+<div class="line">        std::make_shared&lt;Node&gt;()</div>
 </div><!-- fragment -->
 <p>declaring root node of trie </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00051">51</a> of file <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html">trie_using_hashmap.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp.html">trie_using_hashmap.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html">trie_using_hashmap.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph.map b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph.map
deleted file mode 100644
index d5c38c203..000000000
--- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="data_structures::trie_using_hashmap::Trie::get_all_words" name="data_structures::trie_using_hashmap::Trie::get_all_words">
-<area shape="rect" id="Node000001" title="helper function to predict/recommend words that starts with a given prefix from the end of prefix&#39;s n..." alt="" coords="5,29,155,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="40,29,41,19,48,10,61,5,80,3,101,5,114,12,112,17,100,10,80,8,63,10,51,15,46,21,46,29"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/pop_back.html#" title=" " alt="" coords="208,19,352,45"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="155,45,193,40,193,45,156,50"/>
-<area shape="rect" id="Node000003" 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="203,68,357,94"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="156,64,187,67,187,73,155,69"/>
-</map>
diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph.md5 b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph.md5
deleted file mode 100644
index 31f29aa38..000000000
--- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e803ee39835f17576c2e13b35a2d7e4e
\ No newline at end of file
diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph.svg b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph.svg
deleted file mode 100644
index 26166ce84..000000000
--- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::trie_using_hashmap::Trie::get_all_words Pages: 1 -->
-<svg width="272pt" height="75pt"
- viewBox="0.00 0.00 271.75 74.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 70.5)">
-<title>data_structures::trie_using_hashmap::Trie::get_all_words</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="helper function to predict/recommend words that starts with a given prefix from the end of prefix&#39;s n...">
-<polygon fill="#999999" stroke="#666666" points="112,-48.5 0,-48.5 0,-6.75 112,-6.75 112,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="56" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_all_words</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.34,-48.82C25.7,-58.3 34.92,-66.5 56,-66.5 68.18,-66.5 76.41,-63.76 80.67,-59.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.96,-60.85 83.26,-50.28 77.21,-58.98 83.96,-60.85"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.62,-56.25 152.12,-56.25 152.12,-37 259.62,-37 259.62,-56.25"/>
-<text text-anchor="middle" x="205.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.48,-34.75C121.69,-35.94 131.3,-37.17 140.7,-38.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.15,-41.84 150.52,-39.64 141.05,-34.89 140.15,-41.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263.75,-19.25 148,-19.25 148,0 263.75,0 263.75,-19.25"/>
-<text text-anchor="middle" x="205.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.48,-20.87C120.28,-19.92 128.37,-18.94 136.38,-17.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.59,-21.46 146.1,-16.78 135.75,-14.51 136.59,-21.46"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph_org.svg b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph_org.svg
deleted file mode 100644
index f141c0d5b..000000000
--- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_a7bbe538c8015e8ce158e7ed43f605ebd_cgraph_org.svg
+++ /dev/null
@@ -1,68 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::trie_using_hashmap::Trie::get_all_words Pages: 1 -->
-<svg width="272pt" height="75pt"
- viewBox="0.00 0.00 271.75 74.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 70.5)">
-<title>data_structures::trie_using_hashmap::Trie::get_all_words</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="helper function to predict/recommend words that starts with a given prefix from the end of prefix&#39;s n...">
-<polygon fill="#999999" stroke="#666666" points="112,-48.5 0,-48.5 0,-6.75 112,-6.75 112,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="56" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_all_words</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.34,-48.82C25.7,-58.3 34.92,-66.5 56,-66.5 68.18,-66.5 76.41,-63.76 80.67,-59.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.96,-60.85 83.26,-50.28 77.21,-58.98 83.96,-60.85"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.62,-56.25 152.12,-56.25 152.12,-37 259.62,-37 259.62,-56.25"/>
-<text text-anchor="middle" x="205.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.48,-34.75C121.69,-35.94 131.3,-37.17 140.7,-38.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.15,-41.84 150.52,-39.64 141.05,-34.89 140.15,-41.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263.75,-19.25 148,-19.25 148,0 263.75,0 263.75,-19.25"/>
-<text text-anchor="middle" x="205.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.48,-20.87C120.28,-19.92 128.37,-18.94 136.38,-17.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.59,-21.46 146.1,-16.78 135.75,-14.51 136.59,-21.46"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph.map b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph.map
deleted file mode 100644
index d6f13ad79..000000000
--- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::trie_using_hashmap::Trie::insert" name="data_structures::trie_using_hashmap::Trie::insert">
-<area shape="rect" id="Node000001" title="insert the string into the trie" alt="" coords="5,5,155,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="203,20,328,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,30,187,30,187,36,155,36"/>
-</map>
diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph.md5 b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph.md5
deleted file mode 100644
index 33f25c3cf..000000000
--- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e609b4e93f177f0189066effc0596c8f
\ No newline at end of file
diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph.svg b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph.svg
deleted file mode 100644
index 45ff3e0a5..000000000
--- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::trie_using_hashmap::Trie::insert Pages: 1 -->
-<svg width="250pt" height="50pt"
- viewBox="0.00 0.00 250.00 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>data_structures::trie_using_hashmap::Trie::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="insert the string into the trie">
-<polygon fill="#999999" stroke="#666666" points="112,-41.75 0,-41.75 0,0 112,0 112,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="56" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242,-30.5 148,-30.5 148,-11.25 242,-11.25 242,-30.5"/>
-<text text-anchor="middle" x="195" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.33,-20.88C120.21,-20.88 128.34,-20.88 136.27,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.17,-24.38 146.17,-20.88 136.17,-17.38 136.17,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph_org.svg b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph_org.svg
deleted file mode 100644
index 7b1cc6fcc..000000000
--- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_abcae0a4456e7f583ce716e3ef466dfd2_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::trie_using_hashmap::Trie::insert Pages: 1 -->
-<svg width="250pt" height="50pt"
- viewBox="0.00 0.00 250.00 49.75" 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.75)">
-<title>data_structures::trie_using_hashmap::Trie::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="insert the string into the trie">
-<polygon fill="#999999" stroke="#666666" points="112,-41.75 0,-41.75 0,0 112,0 112,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="56" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242,-30.5 148,-30.5 148,-11.25 242,-11.25 242,-30.5"/>
-<text text-anchor="middle" x="195" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.33,-20.88C120.21,-20.88 128.34,-20.88 136.27,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.17,-24.38 146.17,-20.88 136.17,-17.38 136.17,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.map b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.map
deleted file mode 100644
index 7cfe396ce..000000000
--- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="data_structures::trie_using_hashmap::Trie::delete_word" name="data_structures::trie_using_hashmap::Trie::delete_word">
-<area shape="rect" id="Node000001" title="delete a word/string from a trie" alt="" coords="5,89,155,145"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/back.html#" title=" " alt="" coords="217,5,332,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="121,86,201,40,214,34,216,39,204,45,123,91"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/stack/pop.html#" title=" " alt="" coords="220,55,328,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="154,95,205,82,207,87,156,100"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/pop_back.html#" title=" " alt="" coords="203,104,346,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="155,114,187,114,187,120,155,120"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/stack/push.html#" title=" " alt="" coords="217,153,332,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="156,133,207,146,205,152,154,138"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/stack/top.html#" title=" " alt="" coords="222,203,327,228"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="123,143,204,189,216,194,214,199,201,194,121,147"/>
-</map>
diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.md5 b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.md5
deleted file mode 100644
index a8bd992c7..000000000
--- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3b0db2e520e3797e71e50693fa3648ae
\ No newline at end of file
diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.svg b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.svg
deleted file mode 100644
index c289d828a..000000000
--- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph.svg
+++ /dev/null
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::trie_using_hashmap::Trie::delete_word Pages: 1 -->
-<svg width="264pt" height="175pt"
- viewBox="0.00 0.00 263.50 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>data_structures::trie_using_hashmap::Trie::delete_word</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="delete a word/string from a trie">
-<polygon fill="#999999" stroke="#666666" points="112,-104.5 0,-104.5 0,-62.75 112,-62.75 112,-104.5"/>
-<text text-anchor="start" x="8" y="-91" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="8" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="56" y="-68.5" font-family="Helvetica,sans-Serif" font-size="10.00">::delete_word</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245,-167.25 158.5,-167.25 158.5,-148 245,-148 245,-167.25"/>
-<text text-anchor="middle" x="201.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.62,-104.85C104.84,-116.16 127.02,-129.74 148,-139.62 150.91,-141 153.96,-142.32 157.06,-143.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.65,-146.79 166.24,-147.06 158.14,-140.24 155.65,-146.79"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242.38,-130.25 161.12,-130.25 161.12,-111 242.38,-111 242.38,-130.25"/>
-<text text-anchor="middle" x="201.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.17,-97.82C124.78,-101.07 138.11,-104.5 150.5,-107.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.54,-111.06 160.1,-110.16 151.29,-104.28 149.54,-111.06"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-93.25 148,-93.25 148,-74 255.5,-74 255.5,-93.25"/>
-<text text-anchor="middle" x="201.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.17,-83.62C120.13,-83.62 128.39,-83.62 136.51,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.35,-87.13 146.35,-83.63 136.35,-80.13 136.35,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245,-56.25 158.5,-56.25 158.5,-37 245,-37 245,-56.25"/>
-<text text-anchor="middle" x="201.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.17,-69.43C124.78,-66.18 138.11,-62.75 150.5,-59.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.29,-62.97 160.1,-57.09 149.54,-56.19 151.29,-62.97"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/top.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="241.25,-19.25 162.25,-19.25 162.25,0 241.25,0 241.25,-19.25"/>
-<text text-anchor="middle" x="201.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.62,-62.4C104.84,-51.09 127.02,-37.51 148,-27.62 150.91,-26.25 153.96,-24.93 157.06,-23.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.14,-27.01 166.24,-20.19 155.65,-20.46 158.14,-27.01"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph_org.svg b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph_org.svg
deleted file mode 100644
index 23a919e56..000000000
--- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ac0bf3d6791cba144b3f539835d835e75_cgraph_org.svg
+++ /dev/null
@@ -1,113 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::trie_using_hashmap::Trie::delete_word Pages: 1 -->
-<svg width="264pt" height="175pt"
- viewBox="0.00 0.00 263.50 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>data_structures::trie_using_hashmap::Trie::delete_word</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="delete a word/string from a trie">
-<polygon fill="#999999" stroke="#666666" points="112,-104.5 0,-104.5 0,-62.75 112,-62.75 112,-104.5"/>
-<text text-anchor="start" x="8" y="-91" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="8" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="56" y="-68.5" font-family="Helvetica,sans-Serif" font-size="10.00">::delete_word</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245,-167.25 158.5,-167.25 158.5,-148 245,-148 245,-167.25"/>
-<text text-anchor="middle" x="201.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.62,-104.85C104.84,-116.16 127.02,-129.74 148,-139.62 150.91,-141 153.96,-142.32 157.06,-143.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.65,-146.79 166.24,-147.06 158.14,-140.24 155.65,-146.79"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242.38,-130.25 161.12,-130.25 161.12,-111 242.38,-111 242.38,-130.25"/>
-<text text-anchor="middle" x="201.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.17,-97.82C124.78,-101.07 138.11,-104.5 150.5,-107.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.54,-111.06 160.1,-110.16 151.29,-104.28 149.54,-111.06"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-93.25 148,-93.25 148,-74 255.5,-74 255.5,-93.25"/>
-<text text-anchor="middle" x="201.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.17,-83.62C120.13,-83.62 128.39,-83.62 136.51,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.35,-87.13 146.35,-83.63 136.35,-80.13 136.35,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245,-56.25 158.5,-56.25 158.5,-37 245,-37 245,-56.25"/>
-<text text-anchor="middle" x="201.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.17,-69.43C124.78,-66.18 138.11,-62.75 150.5,-59.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.29,-62.97 160.1,-57.09 149.54,-56.19 151.29,-62.97"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/top.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="241.25,-19.25 162.25,-19.25 162.25,0 241.25,0 241.25,-19.25"/>
-<text text-anchor="middle" x="201.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.62,-62.4C104.84,-51.09 127.02,-37.51 148,-27.62 150.91,-26.25 153.96,-24.93 157.06,-23.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.14,-27.01 166.24,-20.19 155.65,-20.46 158.14,-27.01"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph.map b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph.map
deleted file mode 100644
index becaed83b..000000000
--- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="data_structures::trie_using_hashmap::Trie::predict_words" name="data_structures::trie_using_hashmap::Trie::predict_words">
-<area shape="rect" id="Node000001" title="predict/recommend a word that starts with a given prefix" alt="" coords="5,29,155,85"/>
-<area shape="rect" id="Node000002" href="$d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd" title="helper function to predict/recommend words that starts with a given prefix from the end of prefix&#39;s n..." alt="" coords="203,29,352,85"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,54,187,54,187,60,155,60"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="238,29,239,19,246,10,259,5,277,3,298,5,311,12,309,17,297,10,277,8,260,10,249,15,244,21,244,29"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/pop_back.html#" title=" " alt="" coords="406,19,549,45"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="352,45,390,40,391,45,353,50"/>
-<area shape="rect" id="Node000004" 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="400,68,554,94"/>
-<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="353,64,385,67,384,73,352,69"/>
-</map>
diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph.md5 b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph.md5
deleted file mode 100644
index f190db2ef..000000000
--- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c8dd3c377db1dd0bdb80185592f1f029
\ No newline at end of file
diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph.svg b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph.svg
deleted file mode 100644
index 3713fa669..000000000
--- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph.svg
+++ /dev/null
@@ -1,114 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::trie_using_hashmap::Trie::predict_words Pages: 1 -->
-<svg width="420pt" height="75pt"
- viewBox="0.00 0.00 419.75 74.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 70.5)">
-<title>data_structures::trie_using_hashmap::Trie::predict_words</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="predict/recommend a word that starts with a given prefix">
-<polygon fill="#999999" stroke="#666666" points="112,-48.5 0,-48.5 0,-6.75 112,-6.75 112,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="56" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::predict_words</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd" target="_top" xlink:title="helper function to predict/recommend words that starts with a given prefix from the end of prefix&#39;s n...">
-<polygon fill="white" stroke="#666666" points="260,-48.5 148,-48.5 148,-6.75 260,-6.75 260,-48.5"/>
-<text text-anchor="start" x="156" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="156" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="204" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_all_words</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.2,-27.62C120.1,-27.62 128.3,-27.62 136.39,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.21,-31.13 146.21,-27.63 136.21,-24.13 136.21,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.68,-48.82C174.08,-58.3 183.19,-66.5 204,-66.5 216.03,-66.5 224.15,-63.76 228.36,-59.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.65,-60.85 230.92,-50.28 224.9,-59 231.65,-60.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="407.62,-56.25 300.12,-56.25 300.12,-37 407.62,-37 407.62,-56.25"/>
-<text text-anchor="middle" x="353.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.48,-34.75C269.69,-35.94 279.3,-37.17 288.7,-38.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.15,-41.84 298.52,-39.64 289.05,-34.89 288.15,-41.84"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="411.75,-19.25 296,-19.25 296,0 411.75,0 411.75,-19.25"/>
-<text text-anchor="middle" x="353.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.48,-20.87C268.28,-19.92 276.37,-18.94 284.38,-17.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.59,-21.46 294.1,-16.78 283.75,-14.51 284.59,-21.46"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph_org.svg b/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph_org.svg
deleted file mode 100644
index c40d5bc81..000000000
--- a/d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie_ae15fdc7f2b5023992d87a711d78566c4_cgraph_org.svg
+++ /dev/null
@@ -1,88 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::trie_using_hashmap::Trie::predict_words Pages: 1 -->
-<svg width="420pt" height="75pt"
- viewBox="0.00 0.00 419.75 74.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 70.5)">
-<title>data_structures::trie_using_hashmap::Trie::predict_words</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="predict/recommend a word that starts with a given prefix">
-<polygon fill="#999999" stroke="#666666" points="112,-48.5 0,-48.5 0,-6.75 112,-6.75 112,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="56" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::predict_words</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd" target="_top" xlink:title="helper function to predict/recommend words that starts with a given prefix from the end of prefix&#39;s n...">
-<polygon fill="white" stroke="#666666" points="260,-48.5 148,-48.5 148,-6.75 260,-6.75 260,-48.5"/>
-<text text-anchor="start" x="156" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="156" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="204" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_all_words</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.2,-27.62C120.1,-27.62 128.3,-27.62 136.39,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.21,-31.13 146.21,-27.63 136.21,-24.13 136.21,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.68,-48.82C174.08,-58.3 183.19,-66.5 204,-66.5 216.03,-66.5 224.15,-63.76 228.36,-59.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.65,-60.85 230.92,-50.28 224.9,-59 231.65,-60.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="407.62,-56.25 300.12,-56.25 300.12,-37 407.62,-37 407.62,-56.25"/>
-<text text-anchor="middle" x="353.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.48,-34.75C269.69,-35.94 279.3,-37.17 288.7,-38.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.15,-41.84 298.52,-39.64 289.05,-34.89 288.15,-41.84"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="411.75,-19.25 296,-19.25 296,0 411.75,0 411.75,-19.25"/>
-<text text-anchor="middle" x="353.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.48,-20.87C268.28,-19.92 276.37,-18.94 284.38,-17.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.59,-21.46 294.1,-16.78 283.75,-14.51 284.59,-21.46"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html b/d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html
index 083e634e9..7f196ea1e 100644
--- a/d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html
+++ b/d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::comparison_operator Struct Reference</title>
+<title>TheAlgorithms/C++: machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::comparison_operator Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -116,12 +133,14 @@ $(function(){initNavTree('d3/d2a/structmachine__learning_1_1aystar__search_1_1_a
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:ae1dab9186db26e65979ec71f46821904" id="r_ae1dab9186db26e65979ec71f46821904"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae1dab9186db26e65979ec71f46821904">operator()</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt; &amp;a, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt; &amp;b) const</td></tr>
+<tr class="memitem:ae1dab9186db26e65979ec71f46821904" id="r_ae1dab9186db26e65979ec71f46821904"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae1dab9186db26e65979ec71f46821904">operator()</a> (const std::shared_ptr&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt; &amp;a, const std::shared_ptr&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt; &amp;b) const</td></tr>
 <tr class="separator:ae1dab9186db26e65979ec71f46821904"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><div class="compoundTemplParams">template&lt;typename Puzzle&gt;<br />
 struct machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::comparison_operator</div><p>Custom comparator for open_list. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00370">370</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="ae1dab9186db26e65979ec71f46821904" name="ae1dab9186db26e65979ec71f46821904"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae1dab9186db26e65979ec71f46821904">&#9670;&#160;</a></span>operator()()</h2>
@@ -137,12 +156,12 @@ template&lt;typename Puzzle &gt; </div>
         <tr>
           <td class="memname">bool <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a>&lt; Puzzle &gt;::comparison_operator::operator() </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
+          <td class="paramtype">const std::shared_ptr&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>b</em></span>&#160;) const</td>
+          <td class="paramtype">const std::shared_ptr&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>b</em></span>&#160;) const</td>
         </tr>
       </table>
   </td>
@@ -151,6 +170,8 @@ template&lt;typename Puzzle &gt; </div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00371">371</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  372</span>                                                            {</div>
 <div class="line"><span class="lineno">  373</span>            <span class="keywordflow">return</span> *(a-&gt;state) &lt; *(b-&gt;state);</div>
 <div class="line"><span class="lineno">  374</span>        }</div>
@@ -158,7 +179,7 @@ template&lt;typename Puzzle &gt; </div>
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>machine_learning/<b>a_star_search.cpp</b></li>
+<li>machine_learning/<a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d3/d36/digit__separation_8cpp.html b/d3/d36/digit__separation_8cpp.html
index a06fc78e9..c2fcd233e 100644
--- a/d3/d36/digit__separation_8cpp.html
+++ b/d3/d36/digit__separation_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: greedy_algorithms/digit_separation.cpp File Reference</title>
+<title>TheAlgorithms/C++: greedy_algorithms/digit_separation.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -125,7 +142,9 @@ Include dependency graph for digit_separation.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d47/digit__separation_8cpp__incl.svg" width="515" height="126"><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">
+</div>
+<p><a href="../../d3/d36/digit__separation_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html">greedy_algorithms::DigitSeparation</a></td></tr>
@@ -151,6 +170,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Separates digits from numbers in forward and reverse order. </p>
 <dl class="section see"><dt>See also</dt><dd><a href="https://www.log2base2.com/c-examples/loop/split-a-number-into-digits-in-c.html">https://www.log2base2.com/c-examples/loop/split-a-number-into-digits-in-c.html</a></dd></dl>
 <p>The DigitSeparation class provides two methods to separate the digits of large integers: digitSeparationReverseOrder and digitSeparationForwardOrder. The digitSeparationReverseOrder method extracts digits by repeatedly applying the modulus operation (% 10) to isolate the last digit, then divides the number by 10 to remove it. This process continues until the entire number is broken down into its digits, which are stored in reverse order. If the number is zero, the method directly returns a vector containing {0} to handle this edge case. Negative numbers are handled by taking the absolute value, ensuring consistent behavior regardless of the sign. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/mjk22071998" target="_blank">Muhammad Junaid Khalid</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/d36/digit__separation_8cpp_source.html">digit_separation.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -169,18 +190,15 @@ Functions</h2></td></tr>
 
 <p>main function </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on successful exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d36/digit__separation_8cpp_source.html#l00138">138</a> of file <a class="el" href="../../d3/d36/digit__separation_8cpp_source.html">digit_separation.cpp</a>.</p>
 <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="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self test implementation</span></div>
 <div class="line"><span class="lineno">  140</span> </div>
 <div class="line"><span class="lineno">  141</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  142</span>}</div>
-<div class="ttc" id="adigit__separation_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">self test implementation</div><div class="ttdef"><b>Definition</b> digit_separation.cpp:83</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="663" height="132"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="adigit__separation_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">self test implementation</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d36/digit__separation_8cpp_source.html#l00083">digit_separation.cpp:83</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -208,17 +226,19 @@ Here is the call graph for this function:</div>
 
 <p>self test implementation </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d36/digit__separation_8cpp_source.html#l00083">83</a> of file <a class="el" href="../../d3/d36/digit__separation_8cpp_source.html">digit_separation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   83</span>                    {</div>
 <div class="line"><span class="lineno">   84</span>    <a class="code hl_class" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html">greedy_algorithms::DigitSeparation</a> ds;</div>
 <div class="line"><span class="lineno">   85</span> </div>
 <div class="line"><span class="lineno">   86</span>    <span class="comment">// Test case: Positive number</span></div>
-<div class="line"><span class="lineno">   87</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> number = 1234567890;</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&lt;std::int64_t&gt;</a> expectedReverse = {0, 9, 8, 7, 6, 5, 4, 3, 2, 1};</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&lt;std::int64_t&gt;</a> expectedForward = {1, 2, 3, 4, 5, 6, 7, 8, 9, 0};</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&lt;std::int64_t&gt;</a> reverseOrder =</div>
+<div class="line"><span class="lineno">   87</span>    std::int64_t number = 1234567890;</div>
+<div class="line"><span class="lineno">   88</span>    std::vector&lt;std::int64_t&gt; expectedReverse = {0, 9, 8, 7, 6, 5, 4, 3, 2, 1};</div>
+<div class="line"><span class="lineno">   89</span>    std::vector&lt;std::int64_t&gt; expectedForward = {1, 2, 3, 4, 5, 6, 7, 8, 9, 0};</div>
+<div class="line"><span class="lineno">   90</span>    std::vector&lt;std::int64_t&gt; reverseOrder =</div>
 <div class="line"><span class="lineno">   91</span>        ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">digitSeparationReverseOrder</a>(number);</div>
 <div class="line"><span class="lineno">   92</span>    assert(reverseOrder == expectedReverse);</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&lt;std::int64_t&gt;</a> forwardOrder =</div>
+<div class="line"><span class="lineno">   93</span>    std::vector&lt;std::int64_t&gt; forwardOrder =</div>
 <div class="line"><span class="lineno">   94</span>        ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">digitSeparationForwardOrder</a>(number);</div>
 <div class="line"><span class="lineno">   95</span>    assert(forwardOrder == expectedForward);</div>
 <div class="line"><span class="lineno">   96</span> </div>
@@ -258,17 +278,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  130</span>    forwardOrder = ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">digitSeparationForwardOrder</a>(number);</div>
 <div class="line"><span class="lineno">  131</span>    assert(forwardOrder == expectedForward);</div>
 <div class="line"><span class="lineno">  132</span>}</div>
-<div class="ttc" id="aclassgreedy__algorithms_1_1_digit_separation_html"><div class="ttname"><a href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html">greedy_algorithms::DigitSeparation</a></div><div class="ttdoc">A class that provides methods to separate the digits of a large positive number.</div><div class="ttdef"><b>Definition</b> digit_separation.cpp:35</div></div>
-<div class="ttc" id="aclassgreedy__algorithms_1_1_digit_separation_html_a1809ae6828223999374bde5b197a59c8"><div class="ttname"><a href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">greedy_algorithms::DigitSeparation::digitSeparationForwardOrder</a></div><div class="ttdeci">std::vector&lt; std::int64_t &gt; digitSeparationForwardOrder(std::int64_t largeNumber) const</div><div class="ttdoc">Implementation of digitSeparationForwardOrder method.</div><div class="ttdef"><b>Definition</b> digit_separation.cpp:68</div></div>
-<div class="ttc" id="aclassgreedy__algorithms_1_1_digit_separation_html_a34769a780845e9d4279152899bd3bf79"><div class="ttname"><a href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">greedy_algorithms::DigitSeparation::digitSeparationReverseOrder</a></div><div class="ttdeci">std::vector&lt; std::int64_t &gt; digitSeparationReverseOrder(std::int64_t largeNumber) const</div><div class="ttdoc">Implementation of digitSeparationReverseOrder method.</div><div class="ttdef"><b>Definition</b> digit_separation.cpp:48</div></div>
-<div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a></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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="566" height="132"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassgreedy__algorithms_1_1_digit_separation_html"><div class="ttname"><a href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html">greedy_algorithms::DigitSeparation</a></div><div class="ttdoc">A class that provides methods to separate the digits of a large positive number.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d36/digit__separation_8cpp_source.html#l00035">digit_separation.cpp:35</a></div></div>
+<div class="ttc" id="aclassgreedy__algorithms_1_1_digit_separation_html_a1809ae6828223999374bde5b197a59c8"><div class="ttname"><a href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">greedy_algorithms::DigitSeparation::digitSeparationForwardOrder</a></div><div class="ttdeci">std::vector&lt; std::int64_t &gt; digitSeparationForwardOrder(std::int64_t largeNumber) const</div><div class="ttdoc">Implementation of digitSeparationForwardOrder method.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d36/digit__separation_8cpp_source.html#l00068">digit_separation.cpp:68</a></div></div>
+<div class="ttc" id="aclassgreedy__algorithms_1_1_digit_separation_html_a34769a780845e9d4279152899bd3bf79"><div class="ttname"><a href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">greedy_algorithms::DigitSeparation::digitSeparationReverseOrder</a></div><div class="ttdeci">std::vector&lt; std::int64_t &gt; digitSeparationReverseOrder(std::int64_t largeNumber) const</div><div class="ttdoc">Implementation of digitSeparationReverseOrder method.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d36/digit__separation_8cpp_source.html#l00048">digit_separation.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index 80ac12428..000000000
--- a/d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="self test implementation" alt="" coords="5,54,56,79"/>
-<area shape="rect" id="Node000002" href="$da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8" title="Implementation of digitSeparationForwardOrder method." alt="" coords="104,71,308,126"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="57,68,89,74,88,80,56,74"/>
-<area shape="rect" id="Node000003" href="$da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79" title="Implementation of digitSeparationReverseOrder method." alt="" coords="356,5,560,61"/>
-<area shape="poly" id="edge4_Node000001_Node000003" title=" " alt="" coords="55,61,103,56,340,38,340,43,104,61,56,66"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="308,69,340,61,341,66,309,75"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/reverse.html#" title=" " alt="" coords="413,86,503,111"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="308,96,397,96,397,101,308,101"/>
-</map>
diff --git a/d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 859bc715b..000000000
--- a/d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1649b7dab17754b877f56efbec73556b
\ No newline at end of file
diff --git a/d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index 63573e05c..000000000
--- a/d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,114 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="424pt" height="99pt"
- viewBox="0.00 0.00 424.25 98.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 94.75)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="self test implementation">
-<polygon fill="#999999" stroke="#666666" points="37.75,-54.5 0,-54.5 0,-35.25 37.75,-35.25 37.75,-54.5"/>
-<text text-anchor="middle" x="18.88" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8" target="_top" xlink:title="Implementation of digitSeparationForwardOrder method.">
-<polygon fill="white" stroke="#666666" points="227,-41.75 73.75,-41.75 73.75,0 227,0 227,-41.75"/>
-<text text-anchor="start" x="81.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="81.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
-<text text-anchor="middle" x="150.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ForwardOrder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.15,-41.49C44.99,-40.22 53.3,-38.68 62.25,-37.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.76,-40.49 71.95,-35.22 61.48,-33.6 62.76,-40.49"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79" target="_top" xlink:title="Implementation of digitSeparationReverseOrder method.">
-<polygon fill="white" stroke="#666666" points="416.25,-90.75 263,-90.75 263,-49 416.25,-49 416.25,-90.75"/>
-<text text-anchor="start" x="271" y="-77.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="271" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
-<text text-anchor="middle" x="339.62" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">ReverseOrder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.82,-47.05C48.29,-48.28 61.75,-49.78 73.75,-50.88 132.87,-56.29 199.52,-61.06 251.18,-64.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="250.92,-67.96 261.12,-65.12 251.37,-60.97 250.92,-67.96"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M227.27,-40.73C235.28,-42.83 243.48,-44.98 251.61,-47.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="250.6,-50.46 261.16,-49.6 252.37,-43.69 250.6,-50.46"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373.5,-30.5 305.75,-30.5 305.75,-11.25 373.5,-11.25 373.5,-30.5"/>
-<text text-anchor="middle" x="339.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M227.27,-20.88C249.98,-20.88 274.14,-20.88 294.12,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.86,-24.38 303.86,-20.88 293.86,-17.38 293.86,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index 844775428..000000000
--- a/d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,88 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="424pt" height="99pt"
- viewBox="0.00 0.00 424.25 98.75" 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 94.75)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="self test implementation">
-<polygon fill="#999999" stroke="#666666" points="37.75,-54.5 0,-54.5 0,-35.25 37.75,-35.25 37.75,-54.5"/>
-<text text-anchor="middle" x="18.88" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8" target="_top" xlink:title="Implementation of digitSeparationForwardOrder method.">
-<polygon fill="white" stroke="#666666" points="227,-41.75 73.75,-41.75 73.75,0 227,0 227,-41.75"/>
-<text text-anchor="start" x="81.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="81.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
-<text text-anchor="middle" x="150.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ForwardOrder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.15,-41.49C44.99,-40.22 53.3,-38.68 62.25,-37.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.76,-40.49 71.95,-35.22 61.48,-33.6 62.76,-40.49"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79" target="_top" xlink:title="Implementation of digitSeparationReverseOrder method.">
-<polygon fill="white" stroke="#666666" points="416.25,-90.75 263,-90.75 263,-49 416.25,-49 416.25,-90.75"/>
-<text text-anchor="start" x="271" y="-77.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="271" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
-<text text-anchor="middle" x="339.62" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">ReverseOrder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.82,-47.05C48.29,-48.28 61.75,-49.78 73.75,-50.88 132.87,-56.29 199.52,-61.06 251.18,-64.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="250.92,-67.96 261.12,-65.12 251.37,-60.97 250.92,-67.96"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M227.27,-40.73C235.28,-42.83 243.48,-44.98 251.61,-47.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="250.6,-50.46 261.16,-49.6 252.37,-43.69 250.6,-50.46"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373.5,-30.5 305.75,-30.5 305.75,-11.25 373.5,-11.25 373.5,-30.5"/>
-<text text-anchor="middle" x="339.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M227.27,-20.88C249.98,-20.88 274.14,-20.88 294.12,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.86,-24.38 303.86,-20.88 293.86,-17.38 293.86,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 36ec9b490..000000000
--- a/d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="main function" alt="" coords="5,54,55,79"/>
-<area shape="rect" id="Node000002" href="$d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="self test implementation" alt="" coords="103,54,153,79"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,64,88,64,88,69,55,69"/>
-<area shape="rect" id="Node000003" href="$da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8" title="Implementation of digitSeparationForwardOrder method." alt="" coords="201,71,405,126"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="154,68,186,74,185,80,153,74"/>
-<area shape="rect" id="Node000004" href="$da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79" title="Implementation of digitSeparationReverseOrder method." alt="" coords="453,5,658,61"/>
-<area shape="poly" id="edge5_Node000002_Node000004" title=" " alt="" coords="153,61,201,56,437,38,438,43,201,61,153,66"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="405,69,437,61,439,66,406,75"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/reverse.html#" title=" " alt="" coords="510,86,601,111"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="406,96,495,96,495,101,406,101"/>
-</map>
diff --git a/d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 11ee4acae..000000000
--- a/d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a557164585e504eb1d90a8d78bad24e8
\ No newline at end of file
diff --git a/d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index dd062b2fe..000000000
--- a/d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,132 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="497pt" height="99pt"
- viewBox="0.00 0.00 497.25 98.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 94.75)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-54.5 0,-54.5 0,-35.25 37,-35.25 37,-54.5"/>
-<text text-anchor="middle" x="18.5" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="self test implementation">
-<polygon fill="white" stroke="#666666" points="110.75,-54.5 73,-54.5 73,-35.25 110.75,-35.25 110.75,-54.5"/>
-<text text-anchor="middle" x="91.88" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-44.88C44.55,-44.88 53.37,-44.88 61.69,-44.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-48.38 71.43,-44.88 61.43,-41.38 61.43,-48.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8" target="_top" xlink:title="Implementation of digitSeparationForwardOrder method.">
-<polygon fill="white" stroke="#666666" points="300,-41.75 146.75,-41.75 146.75,0 300,0 300,-41.75"/>
-<text text-anchor="start" x="154.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="154.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
-<text text-anchor="middle" x="223.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ForwardOrder</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.15,-41.49C117.99,-40.22 126.3,-38.68 135.25,-37.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.76,-40.49 144.95,-35.22 134.48,-33.6 135.76,-40.49"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79" target="_top" xlink:title="Implementation of digitSeparationReverseOrder method.">
-<polygon fill="white" stroke="#666666" points="489.25,-90.75 336,-90.75 336,-49 489.25,-49 489.25,-90.75"/>
-<text text-anchor="start" x="344" y="-77.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="344" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
-<text text-anchor="middle" x="412.62" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">ReverseOrder</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge5_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge5_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.82,-47.05C121.29,-48.28 134.75,-49.78 146.75,-50.88 205.87,-56.29 272.52,-61.06 324.18,-64.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="323.92,-67.96 334.12,-65.12 324.37,-60.97 323.92,-67.96"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M300.27,-40.73C308.28,-42.83 316.48,-44.98 324.61,-47.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="323.6,-50.46 334.16,-49.6 325.37,-43.69 323.6,-50.46"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="446.5,-30.5 378.75,-30.5 378.75,-11.25 446.5,-11.25 446.5,-30.5"/>
-<text text-anchor="middle" x="412.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M300.27,-20.88C322.98,-20.88 347.14,-20.88 367.12,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="366.86,-24.38 376.86,-20.88 366.86,-17.38 366.86,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 3e0d75d4b..000000000
--- a/d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,106 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="497pt" height="99pt"
- viewBox="0.00 0.00 497.25 98.75" 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 94.75)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-54.5 0,-54.5 0,-35.25 37,-35.25 37,-54.5"/>
-<text text-anchor="middle" x="18.5" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="self test implementation">
-<polygon fill="white" stroke="#666666" points="110.75,-54.5 73,-54.5 73,-35.25 110.75,-35.25 110.75,-54.5"/>
-<text text-anchor="middle" x="91.88" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-44.88C44.55,-44.88 53.37,-44.88 61.69,-44.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-48.38 71.43,-44.88 61.43,-41.38 61.43,-48.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8" target="_top" xlink:title="Implementation of digitSeparationForwardOrder method.">
-<polygon fill="white" stroke="#666666" points="300,-41.75 146.75,-41.75 146.75,0 300,0 300,-41.75"/>
-<text text-anchor="start" x="154.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="154.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
-<text text-anchor="middle" x="223.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ForwardOrder</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.15,-41.49C117.99,-40.22 126.3,-38.68 135.25,-37.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.76,-40.49 144.95,-35.22 134.48,-33.6 135.76,-40.49"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79" target="_top" xlink:title="Implementation of digitSeparationReverseOrder method.">
-<polygon fill="white" stroke="#666666" points="489.25,-90.75 336,-90.75 336,-49 489.25,-49 489.25,-90.75"/>
-<text text-anchor="start" x="344" y="-77.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="344" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
-<text text-anchor="middle" x="412.62" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">ReverseOrder</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge5_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge5_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.82,-47.05C121.29,-48.28 134.75,-49.78 146.75,-50.88 205.87,-56.29 272.52,-61.06 324.18,-64.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="323.92,-67.96 334.12,-65.12 324.37,-60.97 323.92,-67.96"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M300.27,-40.73C308.28,-42.83 316.48,-44.98 324.61,-47.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="323.6,-50.46 334.16,-49.6 325.37,-43.69 323.6,-50.46"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="446.5,-30.5 378.75,-30.5 378.75,-11.25 446.5,-11.25 446.5,-30.5"/>
-<text text-anchor="middle" x="412.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M300.27,-20.88C322.98,-20.88 347.14,-20.88 367.12,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="366.86,-24.38 376.86,-20.88 366.86,-17.38 366.86,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d36/digit__separation_8cpp_source.html b/d3/d36/digit__separation_8cpp_source.html
new file mode 100644
index 000000000..9ce137255
--- /dev/null
+++ b/d3/d36/digit__separation_8cpp_source.html
@@ -0,0 +1,249 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: greedy_algorithms/digit_separation.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/d36/digit__separation_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">digit_separation.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/d36/digit__separation_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cmath&gt;</span>      </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cstdint&gt;</span>    </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a> {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="foldopen" id="foldopen00035" data-start="{" data-end="};">
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html">   35</a></span><span class="keyword">class </span><a class="code hl_class" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html">DigitSeparation</a> {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#afd54c969a6c9bab16b4a064fbc8ed40e">   40</a></span>    <a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#afd54c969a6c9bab16b4a064fbc8ed40e">DigitSeparation</a>() {}</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="foldopen" id="foldopen00048" data-start="{" data-end="}">
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">   48</a></span>    std::vector&lt;std::int64_t&gt; <a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">digitSeparationReverseOrder</a>(</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        std::int64_t largeNumber)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        std::vector&lt;std::int64_t&gt; result;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        <span class="keywordflow">if</span> (largeNumber != 0) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            <span class="keywordflow">while</span> (largeNumber != 0) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>                result.push_back(std::abs(largeNumber % 10));</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>                largeNumber /= 10;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            result.push_back(0);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    }</div>
+</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="foldopen" id="foldopen00068" data-start="{" data-end="}">
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"><a class="line" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">   68</a></span>    std::vector&lt;std::int64_t&gt; <a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">digitSeparationForwardOrder</a>(</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        std::int64_t largeNumber)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        std::vector&lt;std::int64_t&gt; result =</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>            <a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">digitSeparationReverseOrder</a>(largeNumber);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        std::reverse(result.begin(), result.end());</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    }</div>
+</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>};</div>
+</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>}  <span class="comment">// namespace greedy_algorithms</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="foldopen" id="foldopen00083" data-start="{" data-end="}">
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"><a class="line" href="../../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">   83</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <a class="code hl_class" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html">greedy_algorithms::DigitSeparation</a> ds;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="comment">// Test case: Positive number</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    std::int64_t number = 1234567890;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    std::vector&lt;std::int64_t&gt; expectedReverse = {0, 9, 8, 7, 6, 5, 4, 3, 2, 1};</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::vector&lt;std::int64_t&gt; expectedForward = {1, 2, 3, 4, 5, 6, 7, 8, 9, 0};</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    std::vector&lt;std::int64_t&gt; reverseOrder =</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">digitSeparationReverseOrder</a>(number);</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    assert(reverseOrder == expectedReverse);</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    std::vector&lt;std::int64_t&gt; forwardOrder =</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">digitSeparationForwardOrder</a>(number);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    assert(forwardOrder == expectedForward);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="comment">// Test case: Single digit number</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    number = 5;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    expectedReverse = {5};</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    expectedForward = {5};</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    reverseOrder = ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">digitSeparationReverseOrder</a>(number);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    assert(reverseOrder == expectedReverse);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    forwardOrder = ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">digitSeparationForwardOrder</a>(number);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    assert(forwardOrder == expectedForward);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="comment">// Test case: Zero</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    number = 0;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    expectedReverse = {0};</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    expectedForward = {0};</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    reverseOrder = ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">digitSeparationReverseOrder</a>(number);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    assert(reverseOrder == expectedReverse);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    forwardOrder = ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">digitSeparationForwardOrder</a>(number);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    assert(forwardOrder == expectedForward);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <span class="comment">// Test case: Large number</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    number = 987654321012345;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    expectedReverse = {5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9};</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    expectedForward = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5};</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    reverseOrder = ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">digitSeparationReverseOrder</a>(number);</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    assert(reverseOrder == expectedReverse);</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    forwardOrder = ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">digitSeparationForwardOrder</a>(number);</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    assert(forwardOrder == expectedForward);</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    <span class="comment">// Test case: Negative number</span></div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    number = -987654321012345;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    expectedReverse = {5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9};</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    expectedForward = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5};</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    reverseOrder = ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">digitSeparationReverseOrder</a>(number);</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    assert(reverseOrder == expectedReverse);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    forwardOrder = ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">digitSeparationForwardOrder</a>(number);</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    assert(forwardOrder == expectedForward);</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>}</div>
+</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span> </div>
+<div class="foldopen" id="foldopen00138" data-start="{" data-end="}">
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"><a class="line" href="../../d3/d36/digit__separation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  138</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/d36/digit__separation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <a class="code hl_function" href="../../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self test implementation</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span> </div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>}</div>
+</div>
+<div class="ttc" id="aclassgreedy__algorithms_1_1_digit_separation_html"><div class="ttname"><a href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html">greedy_algorithms::DigitSeparation</a></div><div class="ttdoc">A class that provides methods to separate the digits of a large positive number.</div><div class="ttdef"><b>Definition</b> <a href="#l00035">digit_separation.cpp:35</a></div></div>
+<div class="ttc" id="aclassgreedy__algorithms_1_1_digit_separation_html_a1809ae6828223999374bde5b197a59c8"><div class="ttname"><a href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">greedy_algorithms::DigitSeparation::digitSeparationForwardOrder</a></div><div class="ttdeci">std::vector&lt; std::int64_t &gt; digitSeparationForwardOrder(std::int64_t largeNumber) const</div><div class="ttdoc">Implementation of digitSeparationForwardOrder method.</div><div class="ttdef"><b>Definition</b> <a href="#l00068">digit_separation.cpp:68</a></div></div>
+<div class="ttc" id="aclassgreedy__algorithms_1_1_digit_separation_html_a34769a780845e9d4279152899bd3bf79"><div class="ttname"><a href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">greedy_algorithms::DigitSeparation::digitSeparationReverseOrder</a></div><div class="ttdeci">std::vector&lt; std::int64_t &gt; digitSeparationReverseOrder(std::int64_t largeNumber) const</div><div class="ttdoc">Implementation of digitSeparationReverseOrder method.</div><div class="ttdef"><b>Definition</b> <a href="#l00048">digit_separation.cpp:48</a></div></div>
+<div class="ttc" id="aclassgreedy__algorithms_1_1_digit_separation_html_afd54c969a6c9bab16b4a064fbc8ed40e"><div class="ttname"><a href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#afd54c969a6c9bab16b4a064fbc8ed40e">greedy_algorithms::DigitSeparation::DigitSeparation</a></div><div class="ttdeci">DigitSeparation()</div><div class="ttdoc">Default constructor for the DigitSeparation class.</div><div class="ttdef"><b>Definition</b> <a href="#l00040">digit_separation.cpp:40</a></div></div>
+<div class="ttc" id="adigit__separation_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">self test implementation</div><div class="ttdef"><b>Definition</b> <a href="#l00083">digit_separation.cpp:83</a></div></div>
+<div class="ttc" id="adigit__separation_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d36/digit__separation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition</b> <a href="#l00138">digit_separation.cpp:138</a></div></div>
+<div class="ttc" id="anamespacegreedy__algorithms_html"><div class="ttname"><a href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></div><div class="ttdoc">for string class</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d1f/binary__addition_8cpp_source.html#l00027">binary_addition.cpp:27</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_0eaa691bd54ab0922ca7f50599de6d22.html">greedy_algorithms</a></li><li class="navelem"><a class="el" href="../../d3/d36/digit__separation_8cpp.html">digit_separation.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/d39/manacher__algorithm_8cpp.html b/d3/d39/manacher__algorithm_8cpp.html
index 84b16f558..c18180425 100644
--- a/d3/d39/manacher__algorithm_8cpp.html
+++ b/d3/d39/manacher__algorithm_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: strings/manacher_algorithm.cpp File Reference</title>
+<title>TheAlgorithms/C++: strings/manacher_algorithm.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for manacher_algorithm.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d05/manacher__algorithm_8cpp__incl.svg" width="420" height="111"><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">
+</div>
+<p><a href="../../d3/d39/manacher__algorithm_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dcb/namespacestrings.html">strings</a></td></tr>
@@ -135,7 +154,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a95e6a2976bb2f332898f373941d52098" id="r_a95e6a2976bb2f332898f373941d52098"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a95e6a2976bb2f332898f373941d52098">strings::manacher::manacher</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;prototype)</td></tr>
+<tr class="memitem:a95e6a2976bb2f332898f373941d52098" id="r_a95e6a2976bb2f332898f373941d52098"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a95e6a2976bb2f332898f373941d52098">strings::manacher::manacher</a> (const std::string &amp;prototype)</td></tr>
 <tr class="memdesc:a95e6a2976bb2f332898f373941d52098"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function that implements Manacher's algorithm.  <br /></td></tr>
 <tr class="separator:a95e6a2976bb2f332898f373941d52098"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Longest_palindromic_substring" target="_blank">Manacher's Algorithm</a> </p>
 <p>Manacher's Algorithm is used to find the longest palindromic substring within a string in O(n) time. It exploits the property of a palindrome that its first half is symmetric to the last half, and thus if the first half is a palindrome, then last half is also a palindrome. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/riti2409" target="_blank">Riti Kumari</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/d39/manacher__algorithm_8cpp_source.html">manacher_algorithm.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -166,17 +187,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d39/manacher__algorithm_8cpp_source.html#l00172">172</a> of file <a class="el" href="../../d3/d39/manacher__algorithm_8cpp_source.html">manacher_algorithm.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  172</span>           {</div>
 <div class="line"><span class="lineno">  173</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  174</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  175</span>}</div>
-<div class="ttc" id="amanacher__algorithm_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> manacher_algorithm.cpp:151</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d39/manacher__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amanacher__algorithm_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d39/manacher__algorithm_8cpp_source.html#l00151">manacher_algorithm.cpp:151</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a95e6a2976bb2f332898f373941d52098" name="a95e6a2976bb2f332898f373941d52098"></a>
@@ -186,9 +204,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> strings::manacher::manacher </td>
+          <td class="memname">std::string strings::manacher::manacher </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>prototype</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>prototype</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -202,19 +220,21 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the largest palindromic substring </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d39/manacher__algorithm_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../d3/d39/manacher__algorithm_8cpp_source.html">manacher_algorithm.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   41</span>                                               {</div>
-<div class="line"><span class="lineno">   42</span>    <span class="keywordflow">if</span> (prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() &gt; 0) {</div>
+<div class="line"><span class="lineno">   42</span>    <span class="keywordflow">if</span> (prototype.size() &gt; 0) {</div>
 <div class="line"><span class="lineno">   43</span>        <span class="comment">// stuffing characters between the input string to handle cases with</span></div>
 <div class="line"><span class="lineno">   44</span>        <span class="comment">// even length palindrome</span></div>
-<div class="line"><span class="lineno">   45</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> stuffed_string = <span class="stringliteral">&quot;&quot;</span>;</div>
+<div class="line"><span class="lineno">   45</span>        std::string stuffed_string = <span class="stringliteral">&quot;&quot;</span>;</div>
 <div class="line"><span class="lineno">   46</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> str : prototype) {</div>
 <div class="line"><span class="lineno">   47</span>            stuffed_string += str;</div>
 <div class="line"><span class="lineno">   48</span>            stuffed_string += <span class="stringliteral">&quot;#&quot;</span>;</div>
 <div class="line"><span class="lineno">   49</span>        }</div>
 <div class="line"><span class="lineno">   50</span>        stuffed_string = <span class="stringliteral">&quot;@#&quot;</span> + stuffed_string + <span class="stringliteral">&quot;&amp;&quot;</span>;</div>
 <div class="line"><span class="lineno">   51</span> </div>
-<div class="line"><span class="lineno">   52</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> palindrome_max_half_length(</div>
-<div class="line"><span class="lineno">   53</span>            stuffed_string.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>(),</div>
+<div class="line"><span class="lineno">   52</span>        std::vector&lt;uint64_t&gt; palindrome_max_half_length(</div>
+<div class="line"><span class="lineno">   53</span>            stuffed_string.size(),</div>
 <div class="line"><span class="lineno">   54</span>            0);  <span class="comment">// this array will consist of largest possible half length of</span></div>
 <div class="line"><span class="lineno">   55</span>                 <span class="comment">// palindrome centered at index (say i with respect to the</span></div>
 <div class="line"><span class="lineno">   56</span>                 <span class="comment">// stuffed string). This value will be lower bound of half</span></div>
@@ -225,12 +245,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   61</span>                <span class="comment">// substring which would be considered as the larger</span></div>
 <div class="line"><span class="lineno">   62</span>                <span class="comment">// palindrome, having symmetric halves</span></div>
 <div class="line"><span class="lineno">   63</span> </div>
-<div class="line"><span class="lineno">   64</span>        uint64_t <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a> = 0;  <span class="comment">// this is the maximum length of the palindrome</span></div>
+<div class="line"><span class="lineno">   64</span>        uint64_t right = 0;  <span class="comment">// this is the maximum length of the palindrome</span></div>
 <div class="line"><span class="lineno">   65</span>                             <span class="comment">// from &#39;bigger_center&#39; to the rightmost end</span></div>
 <div class="line"><span class="lineno">   66</span> </div>
 <div class="line"><span class="lineno">   67</span>        <span class="comment">// i is considered as center lying within one half of the palindrone</span></div>
 <div class="line"><span class="lineno">   68</span>        <span class="comment">// which is centered at &#39;bigger_center&#39;</span></div>
-<div class="line"><span class="lineno">   69</span>        <span class="keywordflow">for</span> (uint64_t i = 1; i &lt; stuffed_string.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1; i++) {</div>
+<div class="line"><span class="lineno">   69</span>        <span class="keywordflow">for</span> (uint64_t i = 1; i &lt; stuffed_string.size() - 1; i++) {</div>
 <div class="line"><span class="lineno">   70</span>            <span class="keywordflow">if</span> (i &lt; right) {  <span class="comment">// when i is before right end, considering</span></div>
 <div class="line"><span class="lineno">   71</span>                              <span class="comment">// &#39;bigger_center&#39; as center of palindrome</span></div>
 <div class="line"><span class="lineno">   72</span>                uint64_t opposite_to_i =</div>
@@ -242,7 +262,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   78</span>                <span class="comment">// the palindrome on having center at opposite end,</span></div>
 <div class="line"><span class="lineno">   79</span>                <span class="comment">// and the string between i and right end,</span></div>
 <div class="line"><span class="lineno">   80</span>                <span class="comment">// considering &#39;bigger_center&#39; as center of palindrome</span></div>
-<div class="line"><span class="lineno">   81</span>                palindrome_max_half_length[i] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(</div>
+<div class="line"><span class="lineno">   81</span>                palindrome_max_half_length[i] = std::min(</div>
 <div class="line"><span class="lineno">   82</span>                    palindrome_max_half_length[opposite_to_i], right - i);</div>
 <div class="line"><span class="lineno">   83</span>            }</div>
 <div class="line"><span class="lineno">   84</span> </div>
@@ -259,7 +279,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   95</span>            <span class="comment">// to center i</span></div>
 <div class="line"><span class="lineno">   96</span>            <span class="keywordflow">if</span> (i + palindrome_max_half_length[i] &gt; right) {</div>
 <div class="line"><span class="lineno">   97</span>                bigger_center = i;</div>
-<div class="line"><span class="lineno">   98</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a> = i + palindrome_max_half_length[i];</div>
+<div class="line"><span class="lineno">   98</span>                right = i + palindrome_max_half_length[i];</div>
 <div class="line"><span class="lineno">   99</span>            }</div>
 <div class="line"><span class="lineno">  100</span>        }</div>
 <div class="line"><span class="lineno">  101</span> </div>
@@ -267,14 +287,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  103</span>        uint64_t half_length = 0;   <span class="comment">// half length of the largest palindrome</span></div>
 <div class="line"><span class="lineno">  104</span>        uint64_t center_index = 0;  <span class="comment">// index of center of the largest palindrome</span></div>
 <div class="line"><span class="lineno">  105</span> </div>
-<div class="line"><span class="lineno">  106</span>        <span class="keywordflow">for</span> (uint64_t i = 1; i &lt; stuffed_string.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1; i++) {</div>
+<div class="line"><span class="lineno">  106</span>        <span class="keywordflow">for</span> (uint64_t i = 1; i &lt; stuffed_string.size() - 1; i++) {</div>
 <div class="line"><span class="lineno">  107</span>            <span class="keywordflow">if</span> (palindrome_max_half_length[i] &gt; half_length) {</div>
 <div class="line"><span class="lineno">  108</span>                half_length = palindrome_max_half_length[i];</div>
 <div class="line"><span class="lineno">  109</span>                center_index = i;</div>
 <div class="line"><span class="lineno">  110</span>            }</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/string/basic_string.html">std::string</a> palindromic_substring =</div>
+<div class="line"><span class="lineno">  113</span>        std::string palindromic_substring =</div>
 <div class="line"><span class="lineno">  114</span>            <span class="stringliteral">&quot;&quot;</span>;  <span class="comment">// contains the resulting largest palindrome</span></div>
 <div class="line"><span class="lineno">  115</span> </div>
 <div class="line"><span class="lineno">  116</span>        <span class="keywordflow">if</span> (half_length &gt; 0) {</div>
@@ -285,10 +305,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  121</span>            uint64_t start =</div>
 <div class="line"><span class="lineno">  122</span>                center_index - half_length +</div>
 <div class="line"><span class="lineno">  123</span>                1;  <span class="comment">// index of first character of palindromic substring</span></div>
-<div class="line"><span class="lineno">  124</span>            uint64_t <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">  124</span>            uint64_t end =</div>
 <div class="line"><span class="lineno">  125</span>                center_index + half_length -</div>
 <div class="line"><span class="lineno">  126</span>                1;  <span class="comment">// index of last character of palindromic substring</span></div>
-<div class="line"><span class="lineno">  127</span>            <span class="keywordflow">for</span> (uint64_t index = start; index &lt;= <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a>; index += 2) {</div>
+<div class="line"><span class="lineno">  127</span>            <span class="keywordflow">for</span> (uint64_t index = start; index &lt;= end; index += 2) {</div>
 <div class="line"><span class="lineno">  128</span>                palindromic_substring += stuffed_string[index];</div>
 <div class="line"><span class="lineno">  129</span>            }</div>
 <div class="line"><span class="lineno">  130</span>        } <span class="keywordflow">else</span> {</div>
@@ -304,18 +324,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  140</span>        <span class="keywordflow">return</span> <span class="stringliteral">&quot;&quot;</span>;</div>
 <div class="line"><span class="lineno">  141</span>    }</div>
 <div class="line"><span class="lineno">  142</span>}</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="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="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::right</a></div><div class="ttdeci">T right(T... args)</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="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d39/manacher__algorithm_8cpp_a95e6a2976bb2f332898f373941d52098_cgraph.svg" width="304" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -343,6 +352,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d39/manacher__algorithm_8cpp_source.html#l00151">151</a> of file <a class="el" href="../../d3/d39/manacher__algorithm_8cpp_source.html">manacher_algorithm.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  151</span>                   {</div>
 <div class="line"><span class="lineno">  152</span>    assert(strings::manacher::manacher(<span class="stringliteral">&quot;&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
 <div class="line"><span class="lineno">  153</span>    assert(strings::manacher::manacher(<span class="stringliteral">&quot;abababc&quot;</span>) == <span class="stringliteral">&quot;ababa&quot;</span>);</div>
@@ -357,16 +368,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  162</span>    assert(strings::manacher::manacher(<span class="stringliteral">&quot;xy&quot;</span>) == <span class="stringliteral">&quot;x&quot;</span>);</div>
 <div class="line"><span class="lineno">  163</span>    assert(strings::manacher::manacher(<span class="stringliteral">&quot;abced&quot;</span>) == <span class="stringliteral">&quot;a&quot;</span>);</div>
 <div class="line"><span class="lineno">  164</span> </div>
-<div class="line"><span class="lineno">  165</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have passed!&quot;</span> &lt;&lt; <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">  165</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  166</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="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><!-- 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="../../d3/d39/manacher__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/d39/manacher__algorithm_8cpp_a95e6a2976bb2f332898f373941d52098_cgraph.map b/d3/d39/manacher__algorithm_8cpp_a95e6a2976bb2f332898f373941d52098_cgraph.map
deleted file mode 100644
index b730270e5..000000000
--- a/d3/d39/manacher__algorithm_8cpp_a95e6a2976bb2f332898f373941d52098_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="strings::manacher::manacher" name="strings::manacher::manacher">
-<area shape="rect" id="Node000001" title="A function that implements Manacher&#39;s algorithm." alt="" coords="5,23,139,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="208,5,276,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="139,31,192,23,193,28,140,36"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="187,55,298,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="139,50,171,55,171,60,139,56"/>
-</map>
diff --git a/d3/d39/manacher__algorithm_8cpp_a95e6a2976bb2f332898f373941d52098_cgraph.md5 b/d3/d39/manacher__algorithm_8cpp_a95e6a2976bb2f332898f373941d52098_cgraph.md5
deleted file mode 100644
index 3e88890c1..000000000
--- a/d3/d39/manacher__algorithm_8cpp_a95e6a2976bb2f332898f373941d52098_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5cc757fae541948d69eb830eea5d29da
\ No newline at end of file
diff --git a/d3/d39/manacher__algorithm_8cpp_a95e6a2976bb2f332898f373941d52098_cgraph.svg b/d3/d39/manacher__algorithm_8cpp_a95e6a2976bb2f332898f373941d52098_cgraph.svg
deleted file mode 100644
index 4f83da24a..000000000
--- a/d3/d39/manacher__algorithm_8cpp_a95e6a2976bb2f332898f373941d52098_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: strings::manacher::manacher Pages: 1 -->
-<svg width="228pt" height="64pt"
- viewBox="0.00 0.00 227.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>strings::manacher::manacher</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function that implements Manacher&#39;s algorithm.">
-<polygon fill="#999999" stroke="#666666" points="100,-42.88 0,-42.88 0,-12.37 100,-12.37 100,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::manacher::</text>
-<text text-anchor="middle" x="50" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">manacher</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203.38,-56.25 152.12,-56.25 152.12,-37 203.38,-37 203.38,-56.25"/>
-<text text-anchor="middle" x="177.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.34,-35.08C113.69,-37.1 127.89,-39.24 140.38,-41.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.85,-44.59 150.26,-42.62 140.89,-37.67 139.85,-44.59"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.5,-19.25 136,-19.25 136,0 219.5,0 219.5,-19.25"/>
-<text text-anchor="middle" x="177.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.34,-20.56C108.2,-19.44 116.35,-18.27 124.28,-17.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.77,-20.6 134.18,-15.72 123.78,-13.67 124.77,-20.6"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d39/manacher__algorithm_8cpp_a95e6a2976bb2f332898f373941d52098_cgraph_org.svg b/d3/d39/manacher__algorithm_8cpp_a95e6a2976bb2f332898f373941d52098_cgraph_org.svg
deleted file mode 100644
index 663dc47f2..000000000
--- a/d3/d39/manacher__algorithm_8cpp_a95e6a2976bb2f332898f373941d52098_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: strings::manacher::manacher Pages: 1 -->
-<svg width="228pt" height="64pt"
- viewBox="0.00 0.00 227.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>strings::manacher::manacher</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function that implements Manacher&#39;s algorithm.">
-<polygon fill="#999999" stroke="#666666" points="100,-42.88 0,-42.88 0,-12.37 100,-12.37 100,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::manacher::</text>
-<text text-anchor="middle" x="50" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">manacher</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203.38,-56.25 152.12,-56.25 152.12,-37 203.38,-37 203.38,-56.25"/>
-<text text-anchor="middle" x="177.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.34,-35.08C113.69,-37.1 127.89,-39.24 140.38,-41.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.85,-44.59 150.26,-42.62 140.89,-37.67 139.85,-44.59"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.5,-19.25 136,-19.25 136,0 219.5,0 219.5,-19.25"/>
-<text text-anchor="middle" x="177.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.34,-20.56C108.2,-19.44 116.35,-18.27 124.28,-17.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.77,-20.6 134.18,-15.72 123.78,-13.67 124.77,-20.6"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d39/manacher__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d3/d39/manacher__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index e85e01374..000000000
--- a/d3/d39/manacher__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/d3/d39/manacher__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d3/d39/manacher__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 5901bc148..000000000
--- a/d3/d39/manacher__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-729fb887ee50b6291b0542ba0592a5c7
\ No newline at end of file
diff --git a/d3/d39/manacher__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d3/d39/manacher__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 2e04695b9..000000000
--- a/d3/d39/manacher__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d39/manacher__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d3/d39/manacher__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1813bd719..000000000
--- a/d3/d39/manacher__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d39/manacher__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/d39/manacher__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index a5f0d142c..000000000
--- a/d3/d39/manacher__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/d3/d39/manacher__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/d39/manacher__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 1f8359178..000000000
--- a/d3/d39/manacher__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-add43904fdf843985262d1605a818e5b
\ No newline at end of file
diff --git a/d3/d39/manacher__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/d39/manacher__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 133531675..000000000
--- a/d3/d39/manacher__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d39/manacher__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/d39/manacher__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index e87964840..000000000
--- a/d3/d39/manacher__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d39/manacher__algorithm_8cpp_source.html b/d3/d39/manacher__algorithm_8cpp_source.html
new file mode 100644
index 000000000..5070ebee6
--- /dev/null
+++ b/d3/d39/manacher__algorithm_8cpp_source.html
@@ -0,0 +1,287 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: strings/manacher_algorithm.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/d39/manacher__algorithm_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">manacher_algorithm.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/d39/manacher__algorithm_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#ifdef _MSC_VER</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;string&gt;</span>  </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cstring&gt;</span>  </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/dcb/namespacestrings.html">strings</a> {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/dc6/namespacemanacher.html">manacher</a> {</div>
+<div class="foldopen" id="foldopen00041" data-start="{" data-end="}">
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../d3/d39/manacher__algorithm_8cpp.html#a95e6a2976bb2f332898f373941d52098">   41</a></span>std::string <a class="code hl_namespace" href="../../d8/dc6/namespacemanacher.html">manacher</a>(<span class="keyword">const</span> std::string &amp;prototype) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">if</span> (prototype.size() &gt; 0) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="comment">// stuffing characters between the input string to handle cases with</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="comment">// even length palindrome</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        std::string stuffed_string = <span class="stringliteral">&quot;&quot;</span>;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> str : prototype) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            stuffed_string += str;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            stuffed_string += <span class="stringliteral">&quot;#&quot;</span>;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        stuffed_string = <span class="stringliteral">&quot;@#&quot;</span> + stuffed_string + <span class="stringliteral">&quot;&amp;&quot;</span>;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        std::vector&lt;uint64_t&gt; palindrome_max_half_length(</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            stuffed_string.size(),</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            0);  <span class="comment">// this array will consist of largest possible half length of</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>                 <span class="comment">// palindrome centered at index (say i with respect to the</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>                 <span class="comment">// stuffed string). This value will be lower bound of half</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>                 <span class="comment">// length since single character is a palindrome in itself.</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        uint64_t bigger_center =</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            0;  <span class="comment">// this is the index of the center of palindromic</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>                <span class="comment">// substring which would be considered as the larger</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>                <span class="comment">// palindrome, having symmetric halves</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        uint64_t right = 0;  <span class="comment">// this is the maximum length of the palindrome</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>                             <span class="comment">// from &#39;bigger_center&#39; to the rightmost end</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <span class="comment">// i is considered as center lying within one half of the palindrone</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        <span class="comment">// which is centered at &#39;bigger_center&#39;</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        <span class="keywordflow">for</span> (uint64_t i = 1; i &lt; stuffed_string.size() - 1; i++) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            <span class="keywordflow">if</span> (i &lt; right) {  <span class="comment">// when i is before right end, considering</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>                              <span class="comment">// &#39;bigger_center&#39; as center of palindrome</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>                uint64_t opposite_to_i =</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>                    2 * bigger_center -</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>                    i;  <span class="comment">// this is the opposite end of string, if</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>                        <span class="comment">// centered at center, and having one end as i</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>                <span class="comment">// finding the minimum possible half length among</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>                <span class="comment">// the palindrome on having center at opposite end,</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>                <span class="comment">// and the string between i and right end,</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>                <span class="comment">// considering &#39;bigger_center&#39; as center of palindrome</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>                palindrome_max_half_length[i] = std::min(</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>                    palindrome_max_half_length[opposite_to_i], right - i);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            }</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>            <span class="comment">// expanding the palindrome across the maximum stored length in the</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            <span class="comment">// array, centered at i</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            <span class="keywordflow">while</span> (stuffed_string[i + (palindrome_max_half_length[i] + 1)] ==</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>                   stuffed_string[i - (palindrome_max_half_length[i] + 1)]) {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>                palindrome_max_half_length[i]++;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>            }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>            <span class="comment">// if palindrome centered at i exceeds the rightmost end of</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>            <span class="comment">// palindrome centered at &#39;bigger_center&#39;, then i will be made the</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>            <span class="comment">// &#39;bigger_center&#39; and right value will also be updated with respect</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>            <span class="comment">// to center i</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            <span class="keywordflow">if</span> (i + palindrome_max_half_length[i] &gt; right) {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>                bigger_center = i;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>                right = i + palindrome_max_half_length[i];</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>            }</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        }</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        <span class="comment">// now extracting the first largest palindrome</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        uint64_t half_length = 0;   <span class="comment">// half length of the largest palindrome</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        uint64_t center_index = 0;  <span class="comment">// index of center of the largest palindrome</span></div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="keywordflow">for</span> (uint64_t i = 1; i &lt; stuffed_string.size() - 1; i++) {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>            <span class="keywordflow">if</span> (palindrome_max_half_length[i] &gt; half_length) {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>                half_length = palindrome_max_half_length[i];</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>                center_index = i;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>            }</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        }</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        std::string palindromic_substring =</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>            <span class="stringliteral">&quot;&quot;</span>;  <span class="comment">// contains the resulting largest palindrome</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        <span class="keywordflow">if</span> (half_length &gt; 0) {</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>            <span class="comment">// extra information: when &#39;#&#39; is the center, then palindromic</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>            <span class="comment">// substring will have even length, else palindromic substring will</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>            <span class="comment">// have odd length</span></div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>            uint64_t start =</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>                center_index - half_length +</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>                1;  <span class="comment">// index of first character of palindromic substring</span></div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>            uint64_t end =</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>                center_index + half_length -</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>                1;  <span class="comment">// index of last character of palindromic substring</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>            <span class="keywordflow">for</span> (uint64_t index = start; index &lt;= end; index += 2) {</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>                palindromic_substring += stuffed_string[index];</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>            }</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>            <span class="comment">// if length = 0, then there does not exist any palindrome of length</span></div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>            <span class="comment">// &gt; 1 so we can assign any character of length 1 from string as the</span></div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>            <span class="comment">// palindromic substring</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>            palindromic_substring = prototype[0];</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>        }</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        <span class="keywordflow">return</span> palindromic_substring;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span> </div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>        <span class="comment">// handling case when string is empty</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        <span class="keywordflow">return</span> <span class="stringliteral">&quot;&quot;</span>;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    }</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>}</div>
+</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span> </div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>}  <span class="comment">// namespace manacher</span></div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>}  <span class="comment">// namespace strings</span></div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span> </div>
+<div class="foldopen" id="foldopen00151" data-start="{" data-end="}">
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"><a class="line" href="../../d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  151</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    assert(strings::manacher::manacher(<span class="stringliteral">&quot;&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    assert(strings::manacher::manacher(<span class="stringliteral">&quot;abababc&quot;</span>) == <span class="stringliteral">&quot;ababa&quot;</span>);</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    assert(strings::manacher::manacher(<span class="stringliteral">&quot;cbaabd&quot;</span>) == <span class="stringliteral">&quot;baab&quot;</span>);</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    assert(strings::manacher::manacher(<span class="stringliteral">&quot;DedzefDeD&quot;</span>) == <span class="stringliteral">&quot;DeD&quot;</span>);</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    assert(strings::manacher::manacher(<span class="stringliteral">&quot;XZYYXXYZXX&quot;</span>) == <span class="stringliteral">&quot;YXXY&quot;</span>);</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    assert(strings::manacher::manacher(<span class="stringliteral">&quot;1sm222m10abc&quot;</span>) == <span class="stringliteral">&quot;m222m&quot;</span>);</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    assert(strings::manacher::manacher(<span class="stringliteral">&quot;798989591&quot;</span>) == <span class="stringliteral">&quot;98989&quot;</span>);</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    assert(strings::manacher::manacher(<span class="stringliteral">&quot;xacdedcax&quot;</span>) == <span class="stringliteral">&quot;xacdedcax&quot;</span>);</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    assert(strings::manacher::manacher(<span class="stringliteral">&quot;xaccax&quot;</span>) == <span class="stringliteral">&quot;xaccax&quot;</span>);</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    assert(strings::manacher::manacher(<span class="stringliteral">&quot;a&quot;</span>) == <span class="stringliteral">&quot;a&quot;</span>);</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    assert(strings::manacher::manacher(<span class="stringliteral">&quot;xy&quot;</span>) == <span class="stringliteral">&quot;x&quot;</span>);</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    assert(strings::manacher::manacher(<span class="stringliteral">&quot;abced&quot;</span>) == <span class="stringliteral">&quot;a&quot;</span>);</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span> </div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>}</div>
+</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span> </div>
+<div class="foldopen" id="foldopen00172" data-start="{" data-end="}">
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"><a class="line" href="../../d3/d39/manacher__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  172</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/d39/manacher__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    <a class="code hl_function" href="../../d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>}</div>
+</div>
+<div class="ttc" id="amanacher__algorithm_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d3/d39/manacher__algorithm_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> <a href="#l00151">manacher_algorithm.cpp:151</a></div></div>
+<div class="ttc" id="amanacher__algorithm_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d39/manacher__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00172">manacher_algorithm.cpp:172</a></div></div>
+<div class="ttc" id="anamespacemanacher_html"><div class="ttname"><a href="../../d8/dc6/namespacemanacher.html">manacher</a></div><div class="ttdoc">Functions for Manacher's Algorithm implementation.</div></div>
+<div class="ttc" id="anamespacestrings_html"><div class="ttname"><a href="../../df/dcb/namespacestrings.html">strings</a></div><div class="ttdoc">String algorithms.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db2/boyer__moore_8cpp_source.html#l00058">boyer_moore.cpp:58</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_73a3cc5065b223eb41b02873c0e19f0e.html">strings</a></li><li class="navelem"><a class="el" href="../../d3/d39/manacher__algorithm_8cpp.html">manacher_algorithm.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/d40/graph__coloring_8cpp.html b/d3/d40/graph__coloring_8cpp.html
index 1d8ad5bb7..dbf0ebc67 100644
--- a/d3/d40/graph__coloring_8cpp.html
+++ b/d3/d40/graph__coloring_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: backtracking/graph_coloring.cpp File Reference</title>
+<title>TheAlgorithms/C++: backtracking/graph_coloring.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for graph_coloring.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/dce/graph__coloring_8cpp__incl.svg" width="238" height="126"><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">
+</div>
+<p><a href="../../d3/d40/graph__coloring_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html">backtracking</a></td></tr>
@@ -134,15 +153,15 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a8c47fa37fb6eeeb781b2ec1b05af6b07" id="r_a8c47fa37fb6eeeb781b2ec1b05af6b07"><td class="memTemplParams" colspan="2">template&lt;size_t V&gt; </td></tr>
-<tr class="memitem:a8c47fa37fb6eeeb781b2ec1b05af6b07"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a8c47fa37fb6eeeb781b2ec1b05af6b07">backtracking::graph_coloring::printSolution</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt; &amp;color)</td></tr>
+<tr class="memitem:a8c47fa37fb6eeeb781b2ec1b05af6b07"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a8c47fa37fb6eeeb781b2ec1b05af6b07">backtracking::graph_coloring::printSolution</a> (const std::array&lt; int, V &gt; &amp;color)</td></tr>
 <tr class="memdesc:a8c47fa37fb6eeeb781b2ec1b05af6b07"><td class="mdescLeft">&#160;</td><td class="mdescRight">A utility function to print the solution.  <br /></td></tr>
 <tr class="separator:a8c47fa37fb6eeeb781b2ec1b05af6b07"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a976efe049deb042bf1f02612e181ab1d" id="r_a976efe049deb042bf1f02612e181ab1d"><td class="memTemplParams" colspan="2">template&lt;size_t V&gt; </td></tr>
-<tr class="memitem:a976efe049deb042bf1f02612e181ab1d"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a976efe049deb042bf1f02612e181ab1d">backtracking::graph_coloring::isSafe</a> (int v, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;graph, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt; &amp;color, int c)</td></tr>
+<tr class="memitem:a976efe049deb042bf1f02612e181ab1d"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a976efe049deb042bf1f02612e181ab1d">backtracking::graph_coloring::isSafe</a> (int v, const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;graph, const std::array&lt; int, V &gt; &amp;color, int c)</td></tr>
 <tr class="memdesc:a976efe049deb042bf1f02612e181ab1d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to check if the current color assignment is safe for vertex v.  <br /></td></tr>
 <tr class="separator:a976efe049deb042bf1f02612e181ab1d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a40337efc5dad761096489bf2c5b1c80c" id="r_a40337efc5dad761096489bf2c5b1c80c"><td class="memTemplParams" colspan="2">template&lt;size_t V&gt; </td></tr>
-<tr class="memitem:a40337efc5dad761096489bf2c5b1c80c"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a40337efc5dad761096489bf2c5b1c80c">backtracking::graph_coloring::graphColoring</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;graph, int m, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt; color, int v)</td></tr>
+<tr class="memitem:a40337efc5dad761096489bf2c5b1c80c"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a40337efc5dad761096489bf2c5b1c80c">backtracking::graph_coloring::graphColoring</a> (const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;graph, int m, std::array&lt; int, V &gt; color, int v)</td></tr>
 <tr class="memdesc:a40337efc5dad761096489bf2c5b1c80c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive utility function to solve m coloring problem.  <br /></td></tr>
 <tr class="separator:a40337efc5dad761096489bf2c5b1c80c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
@@ -155,6 +174,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AnupKumarPanwar" target="_blank">Anup Kumar Panwar</a> </dd>
 <dd>
 <a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/d40/graph__coloring_8cpp_source.html">graph_coloring.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a40337efc5dad761096489bf2c5b1c80c" name="a40337efc5dad761096489bf2c5b1c80c"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a40337efc5dad761096489bf2c5b1c80c">&#9670;&#160;</a></span>graphColoring()</h2>
@@ -167,7 +188,7 @@ template&lt;size_t V&gt; </div>
         <tr>
           <td class="memname">void backtracking::graph_coloring::graphColoring </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>graph</em></span>, </td>
+          <td class="paramtype">const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>graph</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -177,7 +198,7 @@ template&lt;size_t V&gt; </div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;</td>          <td class="paramname"><span class="paramname"><em>color</em></span>, </td>
+          <td class="paramtype">std::array&lt; int, V &gt;</td>          <td class="paramname"><span class="paramname"><em>color</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -203,6 +224,8 @@ template&lt;size_t V&gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d40/graph__coloring_8cpp_source.html#l00082">82</a> of file <a class="el" href="../../d3/d40/graph__coloring_8cpp_source.html">graph_coloring.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   83</span>                                                  {</div>
 <div class="line"><span class="lineno">   84</span>    <span class="comment">// base case:</span></div>
 <div class="line"><span class="lineno">   85</span>    <span class="comment">// If all vertices are assigned a color then return true</span></div>
@@ -226,12 +249,7 @@ template&lt;size_t V&gt; </div>
 <div class="line"><span class="lineno">  103</span>    }</div>
 <div class="line"><span class="lineno">  104</span>}</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">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d40/graph__coloring_8cpp_a40337efc5dad761096489bf2c5b1c80c_cgraph.svg" width="172" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a976efe049deb042bf1f02612e181ab1d" name="a976efe049deb042bf1f02612e181ab1d"></a>
@@ -250,12 +268,12 @@ template&lt;size_t V&gt; </div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt;, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>graph</em></span>, </td>
+          <td class="paramtype">const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>graph</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>color</em></span>, </td>
+          <td class="paramtype">const std::array&lt; int, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>color</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -284,6 +302,8 @@ template&lt;size_t V&gt; </div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if the color is safe to be assigned to the node </dd>
 <dd>
 <code>false</code> if the color is not safe to be assigned to the node </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d40/graph__coloring_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../d3/d40/graph__coloring_8cpp_source.html">graph_coloring.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   63</span>                                                  {</div>
 <div class="line"><span class="lineno">   64</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
 <div class="line"><span class="lineno">   65</span>        <span class="keywordflow">if</span> (<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[v][i] &amp;&amp; c == color[i]) {</div>
@@ -292,12 +312,7 @@ template&lt;size_t V&gt; </div>
 <div class="line"><span class="lineno">   68</span>    }</div>
 <div class="line"><span class="lineno">   69</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   70</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d40/graph__coloring_8cpp_a976efe049deb042bf1f02612e181ab1d_cgraph.svg" width="147" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -317,6 +332,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d40/graph__coloring_8cpp_source.html#l00112">112</a> of file <a class="el" href="../../d3/d40/graph__coloring_8cpp_source.html">graph_coloring.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  112</span>           {</div>
 <div class="line"><span class="lineno">  113</span>    <span class="comment">// Create following graph and test whether it is 3 colorable</span></div>
 <div class="line"><span class="lineno">  114</span>    <span class="comment">// (3)---(2)</span></div>
@@ -326,17 +343,16 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  118</span>    <span class="comment">// (0)---(1)</span></div>
 <div class="line"><span class="lineno">  119</span> </div>
 <div class="line"><span class="lineno">  120</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> V = 4;  <span class="comment">// number of vertices in the graph</span></div>
-<div class="line"><span class="lineno">  121</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;int, V&gt;</a>, V&gt; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> = {</div>
-<div class="line"><span class="lineno">  122</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, V&gt;</a>({0, 1, 1, 1}), <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, V&gt;</a>({1, 0, 1, 0}),</div>
-<div class="line"><span class="lineno">  123</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, V&gt;</a>({1, 1, 0, 1}), <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, V&gt;</a>({1, 0, 1, 0})};</div>
+<div class="line"><span class="lineno">  121</span>    std::array&lt;std::array&lt;int, V&gt;, V&gt; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> = {</div>
+<div class="line"><span class="lineno">  122</span>        std::array&lt;int, V&gt;({0, 1, 1, 1}), std::array&lt;int, V&gt;({1, 0, 1, 0}),</div>
+<div class="line"><span class="lineno">  123</span>        std::array&lt;int, V&gt;({1, 1, 0, 1}), std::array&lt;int, V&gt;({1, 0, 1, 0})};</div>
 <div class="line"><span class="lineno">  124</span> </div>
 <div class="line"><span class="lineno">  125</span>    <span class="keywordtype">int</span> m = 3;  <span class="comment">// Number of colors</span></div>
-<div class="line"><span class="lineno">  126</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, V&gt;</a> color{};</div>
+<div class="line"><span class="lineno">  126</span>    std::array&lt;int, V&gt; color{};</div>
 <div class="line"><span class="lineno">  127</span> </div>
 <div class="line"><span class="lineno">  128</span>    backtracking::graph_coloring::graphColoring&lt;V&gt;(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, m, color, 0);</div>
 <div class="line"><span class="lineno">  129</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  130</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -351,7 +367,7 @@ template&lt;size_t V&gt; </div>
         <tr>
           <td class="memname">void backtracking::graph_coloring::printSolution </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>color</em></span></td><td>)</td>
+          <td class="paramtype">const std::array&lt; int, V &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>color</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -370,20 +386,16 @@ template&lt;size_t V&gt; </div>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">   42</span>                                                  {</div>
-<div class="line"><span class="lineno">   43</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Following are the assigned colors\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   44</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; col : color) {</div>
-<div class="line"><span class="lineno">   45</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; col;</div>
-<div class="line"><span class="lineno">   46</span>    }</div>
-<div class="line"><span class="lineno">   47</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   48</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><!-- 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="../../d3/d40/graph__coloring_8cpp_a8c47fa37fb6eeeb781b2ec1b05af6b07_cgraph.svg" width="164" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d3/d40/graph__coloring_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d3/d40/graph__coloring_8cpp_source.html">graph_coloring.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   42</span>                                                  {</div>
+<div class="line"><span class="lineno">   43</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Following are the assigned colors\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   44</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; col : color) {</div>
+<div class="line"><span class="lineno">   45</span>        std::cout &lt;&lt; col;</div>
+<div class="line"><span class="lineno">   46</span>    }</div>
+<div class="line"><span class="lineno">   47</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   48</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/d40/graph__coloring_8cpp_a40337efc5dad761096489bf2c5b1c80c_cgraph.map b/d3/d40/graph__coloring_8cpp_a40337efc5dad761096489bf2c5b1c80c_cgraph.map
deleted file mode 100644
index 8fe28dc03..000000000
--- a/d3/d40/graph__coloring_8cpp_a40337efc5dad761096489bf2c5b1c80c_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="backtracking::graph_coloring::graphColoring" name="backtracking::graph_coloring::graphColoring">
-<area shape="rect" id="Node000001" title="Recursive utility function to solve m coloring problem." alt="" coords="5,29,167,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="55,29,53,19,58,11,69,5,86,3,104,5,114,11,112,16,102,10,86,8,71,10,62,14,59,20,60,28"/>
-</map>
diff --git a/d3/d40/graph__coloring_8cpp_a40337efc5dad761096489bf2c5b1c80c_cgraph.md5 b/d3/d40/graph__coloring_8cpp_a40337efc5dad761096489bf2c5b1c80c_cgraph.md5
deleted file mode 100644
index be91d0abe..000000000
--- a/d3/d40/graph__coloring_8cpp_a40337efc5dad761096489bf2c5b1c80c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bddb528d7822c37cb1c698d75a8eb4ee
\ No newline at end of file
diff --git a/d3/d40/graph__coloring_8cpp_a40337efc5dad761096489bf2c5b1c80c_cgraph.svg b/d3/d40/graph__coloring_8cpp_a40337efc5dad761096489bf2c5b1c80c_cgraph.svg
deleted file mode 100644
index 896d0c374..000000000
--- a/d3/d40/graph__coloring_8cpp_a40337efc5dad761096489bf2c5b1c80c_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::graph_coloring::graphColoring Pages: 1 -->
-<svg width="129pt" height="57pt"
- viewBox="0.00 0.00 129.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::graph_coloring::graphColoring</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive utility function to solve m coloring problem.">
-<polygon fill="#999999" stroke="#666666" points="121,-30.5 0,-30.5 0,0 121,0 121,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::graph</text>
-<text text-anchor="middle" x="60.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_coloring::graphColoring</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.06,-30.99C34.68,-40.06 41.83,-48.5 60.5,-48.5 70.71,-48.5 77.47,-45.97 80.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.25,-42.8 81.79,-32.49 77.29,-42.08 84.25,-42.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d40/graph__coloring_8cpp_a40337efc5dad761096489bf2c5b1c80c_cgraph_org.svg b/d3/d40/graph__coloring_8cpp_a40337efc5dad761096489bf2c5b1c80c_cgraph_org.svg
deleted file mode 100644
index 16687c7f3..000000000
--- a/d3/d40/graph__coloring_8cpp_a40337efc5dad761096489bf2c5b1c80c_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::graph_coloring::graphColoring Pages: 1 -->
-<svg width="129pt" height="57pt"
- viewBox="0.00 0.00 129.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::graph_coloring::graphColoring</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive utility function to solve m coloring problem.">
-<polygon fill="#999999" stroke="#666666" points="121,-30.5 0,-30.5 0,0 121,0 121,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::graph</text>
-<text text-anchor="middle" x="60.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_coloring::graphColoring</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.06,-30.99C34.68,-40.06 41.83,-48.5 60.5,-48.5 70.71,-48.5 77.47,-45.97 80.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.25,-42.8 81.79,-32.49 77.29,-42.08 84.25,-42.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d40/graph__coloring_8cpp_a8c47fa37fb6eeeb781b2ec1b05af6b07_cgraph.map b/d3/d40/graph__coloring_8cpp_a8c47fa37fb6eeeb781b2ec1b05af6b07_cgraph.map
deleted file mode 100644
index 27384d891..000000000
--- a/d3/d40/graph__coloring_8cpp_a8c47fa37fb6eeeb781b2ec1b05af6b07_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="backtracking::graph_coloring::printSolution" name="backtracking::graph_coloring::printSolution">
-<area shape="rect" id="Node000001" title="A utility function to print the solution." alt="" coords="5,29,159,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="52,29,51,19,56,11,66,5,82,3,99,5,109,11,106,16,97,10,82,8,68,10,59,14,56,20,57,28"/>
-</map>
diff --git a/d3/d40/graph__coloring_8cpp_a8c47fa37fb6eeeb781b2ec1b05af6b07_cgraph.md5 b/d3/d40/graph__coloring_8cpp_a8c47fa37fb6eeeb781b2ec1b05af6b07_cgraph.md5
deleted file mode 100644
index 501a4ac3a..000000000
--- a/d3/d40/graph__coloring_8cpp_a8c47fa37fb6eeeb781b2ec1b05af6b07_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-69cba02947340ea09a27c294b1c90efc
\ No newline at end of file
diff --git a/d3/d40/graph__coloring_8cpp_a8c47fa37fb6eeeb781b2ec1b05af6b07_cgraph.svg b/d3/d40/graph__coloring_8cpp_a8c47fa37fb6eeeb781b2ec1b05af6b07_cgraph.svg
deleted file mode 100644
index 371fa4c87..000000000
--- a/d3/d40/graph__coloring_8cpp_a8c47fa37fb6eeeb781b2ec1b05af6b07_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::graph_coloring::printSolution Pages: 1 -->
-<svg width="123pt" height="57pt"
- viewBox="0.00 0.00 123.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::graph_coloring::printSolution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A utility function to print the solution.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::graph</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_coloring::printSolution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.12,-30.99C32.96,-40.06 39.76,-48.5 57.5,-48.5 67.2,-48.5 73.63,-45.97 76.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.25,-42.78 77.73,-32.49 73.28,-42.11 80.25,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d40/graph__coloring_8cpp_a8c47fa37fb6eeeb781b2ec1b05af6b07_cgraph_org.svg b/d3/d40/graph__coloring_8cpp_a8c47fa37fb6eeeb781b2ec1b05af6b07_cgraph_org.svg
deleted file mode 100644
index 5ba068267..000000000
--- a/d3/d40/graph__coloring_8cpp_a8c47fa37fb6eeeb781b2ec1b05af6b07_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::graph_coloring::printSolution Pages: 1 -->
-<svg width="123pt" height="57pt"
- viewBox="0.00 0.00 123.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::graph_coloring::printSolution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A utility function to print the solution.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::graph</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_coloring::printSolution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.12,-30.99C32.96,-40.06 39.76,-48.5 57.5,-48.5 67.2,-48.5 73.63,-45.97 76.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.25,-42.78 77.73,-32.49 73.28,-42.11 80.25,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d40/graph__coloring_8cpp_a976efe049deb042bf1f02612e181ab1d_cgraph.map b/d3/d40/graph__coloring_8cpp_a976efe049deb042bf1f02612e181ab1d_cgraph.map
deleted file mode 100644
index 0817c78bc..000000000
--- a/d3/d40/graph__coloring_8cpp_a976efe049deb042bf1f02612e181ab1d_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="backtracking::graph_coloring::isSafe" name="backtracking::graph_coloring::isSafe">
-<area shape="rect" id="Node000001" title="Utility function to check if the current color assignment is safe for vertex v." alt="" coords="5,29,141,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="46,29,45,20,49,11,59,5,73,3,88,5,97,12,94,16,86,10,73,8,61,10,53,14,50,20,52,28"/>
-</map>
diff --git a/d3/d40/graph__coloring_8cpp_a976efe049deb042bf1f02612e181ab1d_cgraph.md5 b/d3/d40/graph__coloring_8cpp_a976efe049deb042bf1f02612e181ab1d_cgraph.md5
deleted file mode 100644
index 01d099401..000000000
--- a/d3/d40/graph__coloring_8cpp_a976efe049deb042bf1f02612e181ab1d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d3c3f41af62feff0fa9bde20638034e0
\ No newline at end of file
diff --git a/d3/d40/graph__coloring_8cpp_a976efe049deb042bf1f02612e181ab1d_cgraph.svg b/d3/d40/graph__coloring_8cpp_a976efe049deb042bf1f02612e181ab1d_cgraph.svg
deleted file mode 100644
index 9a9e4def5..000000000
--- a/d3/d40/graph__coloring_8cpp_a976efe049deb042bf1f02612e181ab1d_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::graph_coloring::isSafe Pages: 1 -->
-<svg width="110pt" height="57pt"
- viewBox="0.00 0.00 109.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::graph_coloring::isSafe</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to check if the current color assignment is safe for vertex v.">
-<polygon fill="#999999" stroke="#666666" points="101.5,-30.5 0,-30.5 0,0 101.5,0 101.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::graph</text>
-<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_coloring::isSafe</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.76,-30.99C29.09,-40.06 35.09,-48.5 50.75,-48.5 59.31,-48.5 64.99,-45.97 67.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.24,-42.76 68.61,-32.49 64.26,-42.16 71.24,-42.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d40/graph__coloring_8cpp_a976efe049deb042bf1f02612e181ab1d_cgraph_org.svg b/d3/d40/graph__coloring_8cpp_a976efe049deb042bf1f02612e181ab1d_cgraph_org.svg
deleted file mode 100644
index e0dfeef38..000000000
--- a/d3/d40/graph__coloring_8cpp_a976efe049deb042bf1f02612e181ab1d_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::graph_coloring::isSafe Pages: 1 -->
-<svg width="110pt" height="57pt"
- viewBox="0.00 0.00 109.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::graph_coloring::isSafe</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to check if the current color assignment is safe for vertex v.">
-<polygon fill="#999999" stroke="#666666" points="101.5,-30.5 0,-30.5 0,0 101.5,0 101.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::graph</text>
-<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_coloring::isSafe</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.76,-30.99C29.09,-40.06 35.09,-48.5 50.75,-48.5 59.31,-48.5 64.99,-45.97 67.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.24,-42.76 68.61,-32.49 64.26,-42.16 71.24,-42.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d40/graph__coloring_8cpp_source.html b/d3/d40/graph__coloring_8cpp_source.html
new file mode 100644
index 000000000..65259e847
--- /dev/null
+++ b/d3/d40/graph__coloring_8cpp_source.html
@@ -0,0 +1,225 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: backtracking/graph_coloring.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/d40/graph__coloring_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">graph_coloring.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/d40/graph__coloring_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;array&gt;</span>     </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../db/dc0/namespacebacktracking.html">backtracking</a> {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d08/namespacegraph__coloring.html">graph_coloring</a> {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> V&gt;</div>
+<div class="foldopen" id="foldopen00042" data-start="{" data-end="}">
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07">   42</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07">printSolution</a>(<span class="keyword">const</span> std::array&lt;int, V&gt;&amp; color) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Following are the assigned colors\n&quot;</span>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; col : color) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        std::cout &lt;&lt; col;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    }</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>}</div>
+</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> V&gt;</div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d">   62</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d">isSafe</a>(<span class="keywordtype">int</span> v, <span class="keyword">const</span> std::array&lt;std::array&lt;int, V&gt;, V&gt;&amp; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>,</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            <span class="keyword">const</span> std::array&lt;int, V&gt;&amp; color, <span class="keywordtype">int</span> c) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <span class="keywordflow">if</span> (<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[v][i] &amp;&amp; c == color[i]) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>}</div>
+</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> V&gt;</div>
+<div class="foldopen" id="foldopen00082" data-start="{" data-end="}">
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="../../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c">   82</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c">graphColoring</a>(<span class="keyword">const</span> std::array&lt;std::array&lt;int, V&gt;, V&gt;&amp; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, <span class="keywordtype">int</span> m,</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>                   std::array&lt;int, V&gt; color, <span class="keywordtype">int</span> v) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="comment">// base case:</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="comment">// If all vertices are assigned a color then return true</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordflow">if</span> (v == V) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        printSolution&lt;V&gt;(color);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="comment">// Consider this vertex v and try different colors</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> c = 1; c &lt;= m; c++) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        <span class="comment">// Check if assignment of color c to v is fine</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="keywordflow">if</span> (isSafe&lt;V&gt;(v, <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, color, c)) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>            color[v] = c;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            <span class="comment">// recur to assign colors to rest of the vertices</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>            graphColoring&lt;V&gt;(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, m, color, v + 1);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>            <span class="comment">// If assigning color c doesn&#39;t lead to a solution then remove it</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>            color[v] = 0;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        }</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    }</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>}</div>
+</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>}  <span class="comment">// namespace graph_coloring</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>}  <span class="comment">// namespace backtracking</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="foldopen" id="foldopen00112" data-start="{" data-end="}">
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"><a class="line" href="../../d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  112</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="comment">// Create following graph and test whether it is 3 colorable</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="comment">// (3)---(2)</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <span class="comment">// |   / |</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <span class="comment">// |  /  |</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="comment">// | /   |</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <span class="comment">// (0)---(1)</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> V = 4;  <span class="comment">// number of vertices in the graph</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    std::array&lt;std::array&lt;int, V&gt;, V&gt; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> = {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        std::array&lt;int, V&gt;({0, 1, 1, 1}), std::array&lt;int, V&gt;({1, 0, 1, 0}),</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        std::array&lt;int, V&gt;({1, 1, 0, 1}), std::array&lt;int, V&gt;({1, 0, 1, 0})};</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    <span class="keywordtype">int</span> m = 3;  <span class="comment">// Number of colors</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    std::array&lt;int, V&gt; color{};</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span> </div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    backtracking::graph_coloring::graphColoring&lt;V&gt;(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, m, color, 0);</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>}</div>
+</div>
+<div class="ttc" id="agraph__coloring_8cpp_html_a40337efc5dad761096489bf2c5b1c80c"><div class="ttname"><a href="../../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c">backtracking::graph_coloring::graphColoring</a></div><div class="ttdeci">void graphColoring(const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;graph, int m, std::array&lt; int, V &gt; color, int v)</div><div class="ttdoc">Recursive utility function to solve m coloring problem.</div><div class="ttdef"><b>Definition</b> <a href="#l00082">graph_coloring.cpp:82</a></div></div>
+<div class="ttc" id="agraph__coloring_8cpp_html_a8c47fa37fb6eeeb781b2ec1b05af6b07"><div class="ttname"><a href="../../d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07">backtracking::graph_coloring::printSolution</a></div><div class="ttdeci">void printSolution(const std::array&lt; int, V &gt; &amp;color)</div><div class="ttdoc">A utility function to print the solution.</div><div class="ttdef"><b>Definition</b> <a href="#l00042">graph_coloring.cpp:42</a></div></div>
+<div class="ttc" id="agraph__coloring_8cpp_html_a976efe049deb042bf1f02612e181ab1d"><div class="ttname"><a href="../../d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d">backtracking::graph_coloring::isSafe</a></div><div class="ttdeci">bool isSafe(int v, const std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;graph, const std::array&lt; int, V &gt; &amp;color, int c)</div><div class="ttdoc">Utility function to check if the current color assignment is safe for vertex v.</div><div class="ttdef"><b>Definition</b> <a href="#l00062">graph_coloring.cpp:62</a></div></div>
+<div class="ttc" id="agraph__coloring_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00112">graph_coloring.cpp:112</a></div></div>
+<div class="ttc" id="anamespacebacktracking_html"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html">backtracking</a></div><div class="ttdoc">for vector container</div></div>
+<div class="ttc" id="anamespacegraph__coloring_html"><div class="ttname"><a href="../../d7/d08/namespacegraph__coloring.html">graph_coloring</a></div><div class="ttdoc">Functions for the Graph Coloring algorithm,.</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><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a class="el" href="../../d3/d40/graph__coloring_8cpp.html">graph_coloring.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/d4c/quick__sort__3_8cpp.html b/d3/d4c/quick__sort__3_8cpp.html
index 18914f1c6..19e8396d6 100644
--- a/d3/d4c/quick__sort__3_8cpp.html
+++ b/d3/d4c/quick__sort__3_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/quick_sort_3.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/quick_sort_3.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for quick_sort_3.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/df7/quick__sort__3_8cpp__incl.svg" width="427" height="126"><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">
+</div>
+<p><a href="../../d3/d4c/quick__sort__3_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -133,10 +152,10 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a9f59fe72dacc1f1218ef3c303d843168" id="r_a9f59fe72dacc1f1218ef3c303d843168"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a9f59fe72dacc1f1218ef3c303d843168"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168">sorting::quicksort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *arr, int32_t low, int32_t high)</td></tr>
+<tr class="memitem:a9f59fe72dacc1f1218ef3c303d843168"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168">sorting::quicksort</a> (std::vector&lt; T &gt; *arr, int32_t low, int32_t high)</td></tr>
 <tr class="separator:a9f59fe72dacc1f1218ef3c303d843168"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a6eb67c2f91c98cf4464f75b5882022de" id="r_a6eb67c2f91c98cf4464f75b5882022de"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a6eb67c2f91c98cf4464f75b5882022de"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a6eb67c2f91c98cf4464f75b5882022de">sorting::quicksort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; arr, int32_t low, int32_t high)</td></tr>
+<tr class="memitem:a6eb67c2f91c98cf4464f75b5882022de"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a6eb67c2f91c98cf4464f75b5882022de">sorting::quicksort</a> (std::vector&lt; T &gt; arr, int32_t low, int32_t high)</td></tr>
 <tr class="separator:a6eb67c2f91c98cf4464f75b5882022de"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a07e5c62de28aeddea986890ce7ac1bda" id="r_a07e5c62de28aeddea986890ce7ac1bda"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a07e5c62de28aeddea986890ce7ac1bda">test_int</a> ()</td></tr>
 <tr class="separator:a07e5c62de28aeddea986890ce7ac1bda"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -150,6 +169,8 @@ Functions</h2></td></tr>
 <p>Quick sort 3 works on Dutch National Flag Algorithm The major difference between simple quicksort and quick sort 3 comes in the function partition3 In quick_sort_partition3 we divide the vector/array into 3 parts. quick sort 3 works faster in some cases as compared to simple quicksort. </p><dl class="section author"><dt>Author</dt><dd>immortal-j </dd>
 <dd>
 <a href="https://github/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/d4c/quick__sort__3_8cpp_source.html">quick_sort_3.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -166,22 +187,17 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Driver program for above functions </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d4c/quick__sort__3_8cpp_source.html#l00184">184</a> of file <a class="el" href="../../d3/d4c/quick__sort__3_8cpp_source.html">quick_sort_3.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  184</span>           {</div>
-<div class="line"><span class="lineno">  185</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>));</div>
+<div class="line"><span class="lineno">  185</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
 <div class="line"><span class="lineno">  186</span>    <a class="code hl_function" href="#a07e5c62de28aeddea986890ce7ac1bda">test_int</a>();</div>
 <div class="line"><span class="lineno">  187</span>    <a class="code hl_function" href="#a2635b04ad943fa28b7bbf8d1e6479792">test_double</a>();</div>
 <div class="line"><span class="lineno">  188</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  189</span>}</div>
-<div class="ttc" id="aquick__sort__3_8cpp_html_a07e5c62de28aeddea986890ce7ac1bda"><div class="ttname"><a href="#a07e5c62de28aeddea986890ce7ac1bda">test_int</a></div><div class="ttdeci">static void test_int()</div><div class="ttdef"><b>Definition</b> quick_sort_3.cpp:138</div></div>
-<div class="ttc" id="aquick__sort__3_8cpp_html_a2635b04ad943fa28b7bbf8d1e6479792"><div class="ttname"><a href="#a2635b04ad943fa28b7bbf8d1e6479792">test_double</a></div><div class="ttdeci">static void test_double()</div><div class="ttdef"><b>Definition</b> quick_sort_3.cpp:160</div></div>
-<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="366" height="258"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aquick__sort__3_8cpp_html_a07e5c62de28aeddea986890ce7ac1bda"><div class="ttname"><a href="#a07e5c62de28aeddea986890ce7ac1bda">test_int</a></div><div class="ttdeci">static void test_int()</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d4c/quick__sort__3_8cpp_source.html#l00138">quick_sort_3.cpp:138</a></div></div>
+<div class="ttc" id="aquick__sort__3_8cpp_html_a2635b04ad943fa28b7bbf8d1e6479792"><div class="ttname"><a href="#a2635b04ad943fa28b7bbf8d1e6479792">test_double</a></div><div class="ttdeci">static void test_double()</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d4c/quick__sort__3_8cpp_source.html#l00160">quick_sort_3.cpp:160</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2635b04ad943fa28b7bbf8d1e6479792" name="a2635b04ad943fa28b7bbf8d1e6479792"></a>
@@ -207,41 +223,32 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Test function for double type arrays </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d4c/quick__sort__3_8cpp_source.html#l00160">160</a> of file <a class="el" href="../../d3/d4c/quick__sort__3_8cpp_source.html">quick_sort_3.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  160</span>                          {</div>
-<div class="line"><span class="lineno">  161</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTesting Double type arrays\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  161</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTesting Double type arrays\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  162</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> num_tests = 1; num_tests &lt; 21; num_tests++) {</div>
-<div class="line"><span class="lineno">  163</span>        <span class="keywordtype">size_t</span> size = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 500;</div>
-<div class="line"><span class="lineno">  164</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> arr(size);</div>
+<div class="line"><span class="lineno">  163</span>        <span class="keywordtype">size_t</span> size = std::rand() % 500;</div>
+<div class="line"><span class="lineno">  164</span>        std::vector&lt;double&gt; arr(size);</div>
 <div class="line"><span class="lineno">  165</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;a : arr) {</div>
-<div class="line"><span class="lineno">  166</span>            a = double(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 500) -</div>
+<div class="line"><span class="lineno">  166</span>            a = double(std::rand() % 500) -</div>
 <div class="line"><span class="lineno">  167</span>                250.f;   <span class="comment">// random numbers between -250, 249</span></div>
 <div class="line"><span class="lineno">  168</span>            a /= 100.f;  <span class="comment">// convert to -2.5 to 2.49</span></div>
 <div class="line"><span class="lineno">  169</span>        }</div>
 <div class="line"><span class="lineno">  170</span> </div>
-<div class="line"><span class="lineno">  171</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test &quot;</span> &lt;&lt; num_tests &lt;&lt; <span class="stringliteral">&quot;\t Array size:&quot;</span> &lt;&lt; size &lt;&lt; <span class="stringliteral">&quot;\t &quot;</span>;</div>
-<div class="line"><span class="lineno">  172</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sorted =</div>
+<div class="line"><span class="lineno">  171</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Test &quot;</span> &lt;&lt; num_tests &lt;&lt; <span class="stringliteral">&quot;\t Array size:&quot;</span> &lt;&lt; size &lt;&lt; <span class="stringliteral">&quot;\t &quot;</span>;</div>
+<div class="line"><span class="lineno">  172</span>        std::vector&lt;double&gt; sorted =</div>
 <div class="line"><span class="lineno">  173</span>            <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168">sorting::quicksort</a>(arr, 0, int32_t(size) - 1);</div>
 <div class="line"><span class="lineno">  174</span>        <span class="keywordflow">if</span> (size &lt; 20) {</div>
-<div class="line"><span class="lineno">  175</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\t Sorted Array is:\n\t&quot;</span>;</div>
-<div class="line"><span class="lineno">  176</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; sorted &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  175</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\t Sorted Array is:\n\t&quot;</span>;</div>
+<div class="line"><span class="lineno">  176</span>            std::cout &lt;&lt; sorted &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  177</span>        }</div>
-<div class="line"><span class="lineno">  178</span>        assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(sorted), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(sorted)));</div>
-<div class="line"><span class="lineno">  179</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\t Passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  178</span>        assert(std::is_sorted(std::begin(sorted), std::end(sorted)));</div>
+<div class="line"><span class="lineno">  179</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\t Passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  180</span>    }</div>
 <div class="line"><span class="lineno">  181</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="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-<div class="ttc" id="anamespacesorting_html_a9f59fe72dacc1f1218ef3c303d843168"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168">sorting::quicksort</a></div><div class="ttdeci">void quicksort(std::vector&lt; T &gt; *arr, int32_t low, int32_t high)</div><div class="ttdef"><b>Definition</b> quick_sort_3.cpp:94</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.svg" width="268" height="258"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacesorting_html_a9f59fe72dacc1f1218ef3c303d843168"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168">sorting::quicksort</a></div><div class="ttdeci">void quicksort(std::vector&lt; T &gt; *arr, int32_t low, int32_t high)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d4c/quick__sort__3_8cpp_source.html#l00094">quick_sort_3.cpp:94</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a07e5c62de28aeddea986890ce7ac1bda" name="a07e5c62de28aeddea986890ce7ac1bda"></a>
@@ -267,32 +274,29 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Test function for integer type arrays </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d4c/quick__sort__3_8cpp_source.html#l00138">138</a> of file <a class="el" href="../../d3/d4c/quick__sort__3_8cpp_source.html">quick_sort_3.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  138</span>                       {</div>
-<div class="line"><span class="lineno">  139</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTesting integer type arrays\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  139</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTesting integer type arrays\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  140</span> </div>
 <div class="line"><span class="lineno">  141</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> num_tests = 1; num_tests &lt; 21; num_tests++) {</div>
-<div class="line"><span class="lineno">  142</span>        <span class="keywordtype">size_t</span> size = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 500;</div>
-<div class="line"><span class="lineno">  143</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> arr(size);</div>
+<div class="line"><span class="lineno">  142</span>        <span class="keywordtype">size_t</span> size = std::rand() % 500;</div>
+<div class="line"><span class="lineno">  143</span>        std::vector&lt;int&gt; arr(size);</div>
 <div class="line"><span class="lineno">  144</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;a : arr) {</div>
-<div class="line"><span class="lineno">  145</span>            a = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 500 - 250;  <span class="comment">// random numbers between -250, 249</span></div>
+<div class="line"><span class="lineno">  145</span>            a = std::rand() % 500 - 250;  <span class="comment">// random numbers between -250, 249</span></div>
 <div class="line"><span class="lineno">  146</span>        }</div>
 <div class="line"><span class="lineno">  147</span> </div>
-<div class="line"><span class="lineno">  148</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test &quot;</span> &lt;&lt; num_tests &lt;&lt; <span class="stringliteral">&quot;\t Array size:&quot;</span> &lt;&lt; size &lt;&lt; <span class="stringliteral">&quot;\t &quot;</span>;</div>
-<div class="line"><span class="lineno">  149</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> sorted = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168">sorting::quicksort</a>(arr, 0, int32_t(size) - 1);</div>
+<div class="line"><span class="lineno">  148</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Test &quot;</span> &lt;&lt; num_tests &lt;&lt; <span class="stringliteral">&quot;\t Array size:&quot;</span> &lt;&lt; size &lt;&lt; <span class="stringliteral">&quot;\t &quot;</span>;</div>
+<div class="line"><span class="lineno">  149</span>        std::vector&lt;int&gt; sorted = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168">sorting::quicksort</a>(arr, 0, int32_t(size) - 1);</div>
 <div class="line"><span class="lineno">  150</span>        <span class="keywordflow">if</span> (size &lt; 20) {</div>
-<div class="line"><span class="lineno">  151</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\t Sorted Array is:\n\t&quot;</span>;</div>
-<div class="line"><span class="lineno">  152</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; sorted &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  151</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\t Sorted Array is:\n\t&quot;</span>;</div>
+<div class="line"><span class="lineno">  152</span>            std::cout &lt;&lt; sorted &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  153</span>        }</div>
-<div class="line"><span class="lineno">  154</span>        assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(sorted), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(sorted)));</div>
-<div class="line"><span class="lineno">  155</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\t Passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  154</span>        assert(std::is_sorted(std::begin(sorted), std::end(sorted)));</div>
+<div class="line"><span class="lineno">  155</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\t Passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  156</span>    }</div>
 <div class="line"><span class="lineno">  157</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.svg" width="244" height="258"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.map b/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.map
deleted file mode 100644
index 9cce64d88..000000000
--- a/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.map
+++ /dev/null
@@ -1,14 +0,0 @@
-<map id="test_int" name="test_int">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,104,70,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="139,5,218,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,102,77,71,116,40,124,35,127,40,119,44,81,75,52,105"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="144,55,212,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="69,103,129,82,130,87,71,108"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="128,104,228,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="70,114,113,114,113,120,70,120"/>
-<area shape="rect" id="Node000005" href="$d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168" title=" " alt="" coords="118,177,239,203"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="65,128,140,167,137,172,63,133"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="142,227,214,252"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="49,129,77,170,97,193,119,213,129,220,127,224,116,218,93,197,72,173,44,132"/>
-<area shape="poly" id="edge5_Node000005_Node000005" title=" " alt="" coords="154,178,149,169,152,159,162,153,178,151,196,153,205,160,202,164,194,158,178,156,164,158,156,162,155,168,159,176"/>
-</map>
diff --git a/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.md5 b/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.md5
deleted file mode 100644
index 1bb9d3071..000000000
--- a/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-698c5864ad48e139688c7c3f1e6fe586
\ No newline at end of file
diff --git a/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.svg b/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.svg
deleted file mode 100644
index a3d65c268..000000000
--- a/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph.svg
+++ /dev/null
@@ -1,146 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_int Pages: 1 -->
-<svg width="183pt" height="193pt"
- viewBox="0.00 0.00 183.25 193.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 189.25)">
-<title>test_int</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="48.25,-111.25 0,-111.25 0,-92 48.25,-92 48.25,-111.25"/>
-<text text-anchor="middle" x="24.12" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_int</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.12,-185.25 100.38,-185.25 100.38,-166 159.12,-166 159.12,-185.25"/>
-<text text-anchor="middle" x="129.75" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.44,-111.51C44.14,-123.72 63.79,-144.48 84.25,-157.62 86.09,-158.81 88.02,-159.94 90,-161.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.29,-164.07 98.82,-165.26 91.33,-157.77 88.29,-164.07"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.38,-148.25 104.12,-148.25 104.12,-129 155.38,-129 155.38,-148.25"/>
-<text text-anchor="middle" x="129.75" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M48.64,-110.02C61.77,-114.71 78.41,-120.65 93.11,-125.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.86,-129.17 102.46,-129.24 94.22,-122.58 91.86,-129.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="167.38,-111.25 92.12,-111.25 92.12,-92 167.38,-92 167.38,-111.25"/>
-<text text-anchor="middle" x="129.75" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M48.64,-101.62C58.12,-101.62 69.43,-101.62 80.52,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.4,-105.13 90.4,-101.63 80.4,-98.13 80.4,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="175.25,-56.25 84.25,-56.25 84.25,-37 175.25,-37 175.25,-56.25"/>
-<text text-anchor="middle" x="129.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::quicksort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44.13,-91.54C59.69,-83.28 81.95,-71.47 99.73,-62.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.34,-65.14 108.53,-57.36 98.05,-58.96 101.34,-65.14"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="156.88,-19.25 102.62,-19.25 102.62,0 156.88,0 156.88,-19.25"/>
-<text text-anchor="middle" x="129.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.77,-91.65C40.06,-76.02 59.99,-45.71 84.25,-27.62 86.67,-25.82 89.3,-24.16 92.03,-22.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.28,-25.93 100.79,-18.45 90.26,-19.62 93.28,-25.93"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.21,-56.54C105.67,-65.15 111.18,-74.25 129.75,-74.25 139.9,-74.25 146.15,-71.53 148.5,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.97,-67.15 146.58,-58.02 145.1,-68.51 151.97,-67.15"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph_org.svg b/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph_org.svg
deleted file mode 100644
index 677043045..000000000
--- a/d3/d4c/quick__sort__3_8cpp_a07e5c62de28aeddea986890ce7ac1bda_cgraph_org.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_int Pages: 1 -->
-<svg width="183pt" height="193pt"
- viewBox="0.00 0.00 183.25 193.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 189.25)">
-<title>test_int</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="48.25,-111.25 0,-111.25 0,-92 48.25,-92 48.25,-111.25"/>
-<text text-anchor="middle" x="24.12" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_int</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.12,-185.25 100.38,-185.25 100.38,-166 159.12,-166 159.12,-185.25"/>
-<text text-anchor="middle" x="129.75" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.44,-111.51C44.14,-123.72 63.79,-144.48 84.25,-157.62 86.09,-158.81 88.02,-159.94 90,-161.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.29,-164.07 98.82,-165.26 91.33,-157.77 88.29,-164.07"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.38,-148.25 104.12,-148.25 104.12,-129 155.38,-129 155.38,-148.25"/>
-<text text-anchor="middle" x="129.75" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M48.64,-110.02C61.77,-114.71 78.41,-120.65 93.11,-125.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.86,-129.17 102.46,-129.24 94.22,-122.58 91.86,-129.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="167.38,-111.25 92.12,-111.25 92.12,-92 167.38,-92 167.38,-111.25"/>
-<text text-anchor="middle" x="129.75" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M48.64,-101.62C58.12,-101.62 69.43,-101.62 80.52,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.4,-105.13 90.4,-101.63 80.4,-98.13 80.4,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="175.25,-56.25 84.25,-56.25 84.25,-37 175.25,-37 175.25,-56.25"/>
-<text text-anchor="middle" x="129.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::quicksort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44.13,-91.54C59.69,-83.28 81.95,-71.47 99.73,-62.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.34,-65.14 108.53,-57.36 98.05,-58.96 101.34,-65.14"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="156.88,-19.25 102.62,-19.25 102.62,0 156.88,0 156.88,-19.25"/>
-<text text-anchor="middle" x="129.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.77,-91.65C40.06,-76.02 59.99,-45.71 84.25,-27.62 86.67,-25.82 89.3,-24.16 92.03,-22.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.28,-25.93 100.79,-18.45 90.26,-19.62 93.28,-25.93"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.21,-56.54C105.67,-65.15 111.18,-74.25 129.75,-74.25 139.9,-74.25 146.15,-71.53 148.5,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.97,-67.15 146.58,-58.02 145.1,-68.51 151.97,-67.15"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.map b/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.map
deleted file mode 100644
index a002a0637..000000000
--- a/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.map
+++ /dev/null
@@ -1,14 +0,0 @@
-<map id="test_double" name="test_double">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,104,94,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="163,5,242,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="62,102,96,72,140,40,148,36,151,40,143,44,100,76,66,106"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="168,55,236,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="91,101,152,81,154,86,93,106"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="152,104,252,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="94,114,137,114,137,120,94,120"/>
-<area shape="rect" id="Node000005" href="$d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168" title=" " alt="" coords="142,177,263,203"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="80,128,161,168,159,173,77,133"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="166,227,238,252"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="62,128,95,170,118,193,143,213,154,220,151,224,140,218,114,197,91,173,58,132"/>
-<area shape="poly" id="edge5_Node000005_Node000005" title=" " alt="" coords="176,178,171,169,174,159,185,153,202,151,221,153,231,160,228,164,219,158,202,156,187,158,178,163,176,168,181,176"/>
-</map>
diff --git a/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.md5 b/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.md5
deleted file mode 100644
index 5d2c75705..000000000
--- a/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f05f4e63c4cd11fabd37e0b681124d57
\ No newline at end of file
diff --git a/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.svg b/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.svg
deleted file mode 100644
index 16d93eb3c..000000000
--- a/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph.svg
+++ /dev/null
@@ -1,146 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_double Pages: 1 -->
-<svg width="201pt" height="193pt"
- viewBox="0.00 0.00 201.25 193.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 189.25)">
-<title>test_double</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="66.25,-111.25 0,-111.25 0,-92 66.25,-92 66.25,-111.25"/>
-<text text-anchor="middle" x="33.12" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_double</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.12,-185.25 118.38,-185.25 118.38,-166 177.12,-166 177.12,-185.25"/>
-<text text-anchor="middle" x="147.75" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44,-111.41C56.64,-123.52 79.61,-144.17 102.25,-157.62 104.13,-158.74 106.09,-159.82 108.1,-160.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.44,-163.94 116.98,-165.01 109.41,-157.6 106.44,-163.94"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173.38,-148.25 122.12,-148.25 122.12,-129 173.38,-129 173.38,-148.25"/>
-<text text-anchor="middle" x="147.75" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M64.9,-111.74C79.12,-116.41 96.1,-121.98 110.89,-126.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="109.67,-130.13 120.26,-129.92 111.86,-123.48 109.67,-130.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="185.38,-111.25 110.12,-111.25 110.12,-92 185.38,-92 185.38,-111.25"/>
-<text text-anchor="middle" x="147.75" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.7,-101.62C76.62,-101.62 87.75,-101.62 98.48,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.38,-105.13 108.38,-101.63 98.38,-98.13 98.38,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.25,-56.25 102.25,-56.25 102.25,-37 193.25,-37 193.25,-56.25"/>
-<text text-anchor="middle" x="147.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::quicksort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M54.78,-91.54C71.93,-83.16 96.57,-71.13 116.03,-61.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="117.41,-64.85 124.86,-57.31 114.34,-58.56 117.41,-64.85"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="174.88,-19.25 120.62,-19.25 120.62,0 174.88,0 174.88,-19.25"/>
-<text text-anchor="middle" x="147.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.99,-91.7C52.2,-76.14 75.83,-45.91 102.25,-27.62 104.73,-25.91 107.41,-24.31 110.16,-22.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.41,-26.13 118.97,-18.71 108.43,-19.79 111.41,-26.13"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.8,-56.54C121.62,-65.15 127.6,-74.25 147.75,-74.25 158.77,-74.25 165.55,-71.53 168.1,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.55,-67.05 166.01,-58.02 164.71,-68.53 171.55,-67.05"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph_org.svg b/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph_org.svg
deleted file mode 100644
index b3951a1f9..000000000
--- a/d3/d4c/quick__sort__3_8cpp_a2635b04ad943fa28b7bbf8d1e6479792_cgraph_org.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_double Pages: 1 -->
-<svg width="201pt" height="193pt"
- viewBox="0.00 0.00 201.25 193.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 189.25)">
-<title>test_double</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="66.25,-111.25 0,-111.25 0,-92 66.25,-92 66.25,-111.25"/>
-<text text-anchor="middle" x="33.12" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_double</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.12,-185.25 118.38,-185.25 118.38,-166 177.12,-166 177.12,-185.25"/>
-<text text-anchor="middle" x="147.75" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44,-111.41C56.64,-123.52 79.61,-144.17 102.25,-157.62 104.13,-158.74 106.09,-159.82 108.1,-160.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.44,-163.94 116.98,-165.01 109.41,-157.6 106.44,-163.94"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173.38,-148.25 122.12,-148.25 122.12,-129 173.38,-129 173.38,-148.25"/>
-<text text-anchor="middle" x="147.75" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M64.9,-111.74C79.12,-116.41 96.1,-121.98 110.89,-126.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="109.67,-130.13 120.26,-129.92 111.86,-123.48 109.67,-130.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="185.38,-111.25 110.12,-111.25 110.12,-92 185.38,-92 185.38,-111.25"/>
-<text text-anchor="middle" x="147.75" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.7,-101.62C76.62,-101.62 87.75,-101.62 98.48,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.38,-105.13 108.38,-101.63 98.38,-98.13 98.38,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.25,-56.25 102.25,-56.25 102.25,-37 193.25,-37 193.25,-56.25"/>
-<text text-anchor="middle" x="147.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::quicksort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M54.78,-91.54C71.93,-83.16 96.57,-71.13 116.03,-61.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="117.41,-64.85 124.86,-57.31 114.34,-58.56 117.41,-64.85"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="174.88,-19.25 120.62,-19.25 120.62,0 174.88,0 174.88,-19.25"/>
-<text text-anchor="middle" x="147.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.99,-91.7C52.2,-76.14 75.83,-45.91 102.25,-27.62 104.73,-25.91 107.41,-24.31 110.16,-22.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.41,-26.13 118.97,-18.71 108.43,-19.79 111.41,-26.13"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.8,-56.54C121.62,-65.15 127.6,-74.25 147.75,-74.25 158.77,-74.25 165.55,-71.53 168.1,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.55,-67.05 166.01,-58.02 164.71,-68.53 171.55,-67.05"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index a29ac3378..000000000
--- a/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,27 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,105,55,131"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="107,31,186,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,103,101,65,106,62,109,67,104,70,51,107"/>
-<area shape="rect" id="Node000003" href="$d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792" title=" " alt="" coords="103,80,191,106"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="54,110,87,103,88,108,56,116"/>
-<area shape="rect" id="Node000009" href="$d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda" title=" " alt="" coords="115,129,179,155"/>
-<area shape="poly" id="edge9_Node000001_Node000009" title=" " alt="" coords="56,121,100,130,99,135,54,126"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="111,179,183,204"/>
-<area shape="poly" id="edge15_Node000001_Node000010" title=" " alt="" coords="51,129,104,165,109,168,106,173,101,170,48,134"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="260,55,339,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="191,83,245,74,246,79,192,88"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="266,104,334,130"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="192,97,250,106,250,112,191,102"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="250,153,350,179"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="174,104,240,140,251,145,249,149,238,145,171,109"/>
-<area shape="rect" id="Node000007" href="$d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168" title=" " alt="" coords="239,227,360,252"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="178,104,193,115,209,134,218,152,227,170,241,190,269,215,265,219,237,193,222,173,214,154,205,137,189,119,175,108"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="264,5,336,31"/>
-<area shape="poly" id="edge8_Node000003_Node000008" title=" " alt="" coords="171,77,238,40,248,35,251,40,240,45,173,82"/>
-<area shape="poly" id="edge7_Node000007_Node000007" title=" " alt="" coords="273,228,268,218,271,208,282,202,300,200,318,203,328,209,325,214,317,208,300,205,284,207,276,212,274,218,278,225"/>
-<area shape="poly" id="edge10_Node000009_Node000004" title=" " alt="" coords="171,127,238,89,248,84,251,89,240,94,173,131"/>
-<area shape="poly" id="edge11_Node000009_Node000005" title=" " alt="" coords="179,134,250,122,251,127,180,139"/>
-<area shape="poly" id="edge12_Node000009_Node000006" title=" " alt="" coords="180,145,235,153,234,159,179,150"/>
-<area shape="poly" id="edge13_Node000009_Node000007" title=" " alt="" coords="174,153,192,164,269,215,266,220,190,168,171,158"/>
-<area shape="poly" id="edge14_Node000009_Node000008" title=" " alt="" coords="175,127,189,116,204,97,212,78,220,60,237,40,248,33,251,37,241,44,225,62,217,81,209,100,193,120,178,131"/>
-</map>
diff --git a/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index dc792aada..000000000
--- a/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3379ea5dbff847d0032bdda0680e8026
\ No newline at end of file
diff --git a/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index c6bbd2afc..000000000
--- a/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,263 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="274pt" height="193pt"
- viewBox="0.00 0.00 274.25 193.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 189.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-110.25 0,-110.25 0,-91 37,-91 37,-110.25"/>
-<text text-anchor="middle" x="18.5" y="-96.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.88,-166.25 76.38,-166.25 76.38,-147 135.88,-147 135.88,-166.25"/>
-<text text-anchor="middle" x="106.12" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-110.72C43.52,-118.62 58.94,-129.73 73,-138.62 74.22,-139.39 75.47,-140.17 76.73,-140.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.87,-143.9 85.27,-145.92 78.4,-137.85 74.87,-143.9"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="139.25,-129.25 73,-129.25 73,-110 139.25,-110 139.25,-129.25"/>
-<text text-anchor="middle" x="106.12" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_double</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.24,-104.56C44.33,-106.13 52.82,-108.02 61.37,-109.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.53,-113.31 71.05,-112.06 62.04,-106.48 60.53,-113.31"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="130.25,-92.25 82,-92.25 82,-73 130.25,-73 130.25,-92.25"/>
-<text text-anchor="middle" x="106.12" y="-78.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_int</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.24,-96.9C46.87,-94.87 59.1,-92.3 70.53,-89.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.01,-93.37 80.07,-87.89 69.57,-86.52 71.01,-93.37"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="133.25,-55.25 79,-55.25 79,-36 133.25,-36 133.25,-55.25"/>
-<text text-anchor="middle" x="106.12" y="-41.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge15_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge15_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.34,-90.52C44,-82.86 59.2,-72.23 73,-63.62 74.22,-62.86 75.47,-62.1 76.75,-61.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.4,-64.42 85.29,-56.37 74.89,-58.36 78.4,-64.42"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="250.12,-148.25 191.38,-148.25 191.38,-129 250.12,-129 250.12,-148.25"/>
-<text text-anchor="middle" x="220.75" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.7,-125.12C152.26,-127.24 166.75,-129.68 179.92,-131.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.14,-135.32 189.58,-133.54 180.31,-128.42 179.14,-135.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.38,-111.25 195.12,-111.25 195.12,-92 246.38,-92 246.38,-111.25"/>
-<text text-anchor="middle" x="220.75" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.7,-114.42C153.4,-112.23 169.4,-109.67 183.48,-107.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.94,-110.89 193.27,-105.86 182.84,-103.98 183.94,-110.89"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.38,-74.25 183.12,-74.25 183.12,-55 258.38,-55 258.38,-74.25"/>
-<text text-anchor="middle" x="220.75" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.2,-109.5C141.94,-100.19 165.63,-87.16 175.25,-82.62 177.82,-81.41 180.5,-80.2 183.21,-79.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.41,-82.31 192.26,-75.19 181.68,-75.86 184.41,-82.31"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.25,-19.25 175.25,-19.25 175.25,0 266.25,0 266.25,-19.25"/>
-<text text-anchor="middle" x="220.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::quicksort</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.53,-109.58C132.33,-107.27 136.08,-104.6 139.25,-101.62 160.8,-81.35 155.5,-67.65 175.25,-45.62 181.5,-38.65 189.18,-31.94 196.39,-26.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.06,-29.35 203.91,-20.52 193.83,-23.78 198.06,-29.35"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.88,-185.25 193.62,-185.25 193.62,-166 247.88,-166 247.88,-185.25"/>
-<text text-anchor="middle" x="220.75" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge8_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge8_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.93,-129.59C144.68,-140.64 173.96,-157.01 175.25,-157.62 177.81,-158.85 180.49,-160.07 183.19,-161.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.66,-164.42 192.24,-165.1 184.39,-157.98 181.66,-164.42"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.8,-19.54C194.62,-28.15 200.6,-37.25 220.75,-37.25 231.77,-37.25 238.55,-34.53 241.1,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.55,-30.05 239.01,-21.02 237.71,-31.53 244.55,-30.05"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node4 -->
-<g id="edge10_Node000009_Node000004" class="edge">
-<title>Node9&#45;&gt;Node4</title>
-<g id="a_edge10_Node000009_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.93,-92.59C144.68,-103.64 173.96,-120.01 175.25,-120.62 177.81,-121.85 180.49,-123.07 183.19,-124.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.66,-127.42 192.24,-128.1 184.39,-120.98 181.66,-127.42"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge11_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge11_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.73,-86.61C146.19,-89.21 166.66,-92.67 184.08,-95.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.07,-98.99 193.51,-97.2 184.23,-92.08 183.07,-98.99"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node6 -->
-<g id="edge12_Node000009_Node000006" class="edge">
-<title>Node9&#45;&gt;Node6</title>
-<g id="a_edge12_Node000009_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.73,-78.85C142.64,-76.95 157.54,-74.57 171.72,-72.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.05,-75.79 181.37,-70.76 170.95,-68.88 172.05,-75.79"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge13_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge13_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.64,-72.62C130.14,-70.09 134.9,-67.32 139.25,-64.62 159.03,-52.36 180.77,-37.41 196.68,-26.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.39,-29.27 204.52,-20.62 194.34,-23.56 198.39,-29.27"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node8 -->
-<g id="edge14_Node000009_Node000008" class="edge">
-<title>Node9&#45;&gt;Node8</title>
-<g id="a_edge14_Node000009_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.55,-92.65C132.35,-94.96 136.1,-97.63 139.25,-100.62 160.99,-121.25 152.25,-138.42 175.25,-157.62 177.63,-159.61 180.25,-161.4 183,-163"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.41,-166.12 191.93,-167.39 184.5,-159.84 181.41,-166.12"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 8359a175f..000000000
--- a/d3/d4c/quick__sort__3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,237 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="274pt" height="193pt"
- viewBox="0.00 0.00 274.25 193.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 189.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-110.25 0,-110.25 0,-91 37,-91 37,-110.25"/>
-<text text-anchor="middle" x="18.5" y="-96.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.88,-166.25 76.38,-166.25 76.38,-147 135.88,-147 135.88,-166.25"/>
-<text text-anchor="middle" x="106.12" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-110.72C43.52,-118.62 58.94,-129.73 73,-138.62 74.22,-139.39 75.47,-140.17 76.73,-140.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.87,-143.9 85.27,-145.92 78.4,-137.85 74.87,-143.9"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="139.25,-129.25 73,-129.25 73,-110 139.25,-110 139.25,-129.25"/>
-<text text-anchor="middle" x="106.12" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_double</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.24,-104.56C44.33,-106.13 52.82,-108.02 61.37,-109.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.53,-113.31 71.05,-112.06 62.04,-106.48 60.53,-113.31"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="130.25,-92.25 82,-92.25 82,-73 130.25,-73 130.25,-92.25"/>
-<text text-anchor="middle" x="106.12" y="-78.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_int</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.24,-96.9C46.87,-94.87 59.1,-92.3 70.53,-89.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.01,-93.37 80.07,-87.89 69.57,-86.52 71.01,-93.37"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="133.25,-55.25 79,-55.25 79,-36 133.25,-36 133.25,-55.25"/>
-<text text-anchor="middle" x="106.12" y="-41.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge15_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge15_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.34,-90.52C44,-82.86 59.2,-72.23 73,-63.62 74.22,-62.86 75.47,-62.1 76.75,-61.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.4,-64.42 85.29,-56.37 74.89,-58.36 78.4,-64.42"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="250.12,-148.25 191.38,-148.25 191.38,-129 250.12,-129 250.12,-148.25"/>
-<text text-anchor="middle" x="220.75" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.7,-125.12C152.26,-127.24 166.75,-129.68 179.92,-131.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.14,-135.32 189.58,-133.54 180.31,-128.42 179.14,-135.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.38,-111.25 195.12,-111.25 195.12,-92 246.38,-92 246.38,-111.25"/>
-<text text-anchor="middle" x="220.75" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.7,-114.42C153.4,-112.23 169.4,-109.67 183.48,-107.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.94,-110.89 193.27,-105.86 182.84,-103.98 183.94,-110.89"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.38,-74.25 183.12,-74.25 183.12,-55 258.38,-55 258.38,-74.25"/>
-<text text-anchor="middle" x="220.75" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.2,-109.5C141.94,-100.19 165.63,-87.16 175.25,-82.62 177.82,-81.41 180.5,-80.2 183.21,-79.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.41,-82.31 192.26,-75.19 181.68,-75.86 184.41,-82.31"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.25,-19.25 175.25,-19.25 175.25,0 266.25,0 266.25,-19.25"/>
-<text text-anchor="middle" x="220.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::quicksort</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.53,-109.58C132.33,-107.27 136.08,-104.6 139.25,-101.62 160.8,-81.35 155.5,-67.65 175.25,-45.62 181.5,-38.65 189.18,-31.94 196.39,-26.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.06,-29.35 203.91,-20.52 193.83,-23.78 198.06,-29.35"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.88,-185.25 193.62,-185.25 193.62,-166 247.88,-166 247.88,-185.25"/>
-<text text-anchor="middle" x="220.75" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge8_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge8_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.93,-129.59C144.68,-140.64 173.96,-157.01 175.25,-157.62 177.81,-158.85 180.49,-160.07 183.19,-161.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.66,-164.42 192.24,-165.1 184.39,-157.98 181.66,-164.42"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.8,-19.54C194.62,-28.15 200.6,-37.25 220.75,-37.25 231.77,-37.25 238.55,-34.53 241.1,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.55,-30.05 239.01,-21.02 237.71,-31.53 244.55,-30.05"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node4 -->
-<g id="edge10_Node000009_Node000004" class="edge">
-<title>Node9&#45;&gt;Node4</title>
-<g id="a_edge10_Node000009_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.93,-92.59C144.68,-103.64 173.96,-120.01 175.25,-120.62 177.81,-121.85 180.49,-123.07 183.19,-124.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.66,-127.42 192.24,-128.1 184.39,-120.98 181.66,-127.42"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge11_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge11_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.73,-86.61C146.19,-89.21 166.66,-92.67 184.08,-95.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.07,-98.99 193.51,-97.2 184.23,-92.08 183.07,-98.99"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node6 -->
-<g id="edge12_Node000009_Node000006" class="edge">
-<title>Node9&#45;&gt;Node6</title>
-<g id="a_edge12_Node000009_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.73,-78.85C142.64,-76.95 157.54,-74.57 171.72,-72.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.05,-75.79 181.37,-70.76 170.95,-68.88 172.05,-75.79"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge13_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge13_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.64,-72.62C130.14,-70.09 134.9,-67.32 139.25,-64.62 159.03,-52.36 180.77,-37.41 196.68,-26.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.39,-29.27 204.52,-20.62 194.34,-23.56 198.39,-29.27"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node8 -->
-<g id="edge14_Node000009_Node000008" class="edge">
-<title>Node9&#45;&gt;Node8</title>
-<g id="a_edge14_Node000009_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.55,-92.65C132.35,-94.96 136.1,-97.63 139.25,-100.62 160.99,-121.25 152.25,-138.42 175.25,-157.62 177.63,-159.61 180.25,-161.4 183,-163"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.41,-166.12 191.93,-167.39 184.5,-159.84 181.41,-166.12"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d4c/quick__sort__3_8cpp_source.html b/d3/d4c/quick__sort__3_8cpp_source.html
new file mode 100644
index 000000000..785b7740f
--- /dev/null
+++ b/d3/d4c/quick__sort__3_8cpp_source.html
@@ -0,0 +1,293 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/quick_sort_3.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/d4c/quick__sort__3_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">quick_sort_3.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/d4c/quick__sort__3_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="keyword">namespace </span>{</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>std::ostream &amp;<a class="code hl_function" href="../../d7/db9/hill__cipher_8cpp.html#a34bfcd756610834acac501f9eea1e2eb">operator&lt;&lt;</a>(std::ostream &amp;out, <span class="keyword">const</span> std::vector&lt;T&gt; &amp;arr) {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; arr.size(); ++i) {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        out &lt;&lt; arr[i];</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        <span class="keywordflow">if</span> (i &lt; arr.size() - 1) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>            out &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        }</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    }</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordflow">return</span> out;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>}</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>}  <span class="comment">// namespace</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="keyword">namespace </span>{  <span class="comment">// using un-named namespace here to prevent partition function</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>             <span class="comment">// being visible to end-users</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="keywordtype">void</span> partition3(std::vector&lt;T&gt; *arr, int32_t low, int32_t high, int32_t *i,</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>                int32_t *j) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="comment">// To handle 2 elements</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">if</span> (high - low &lt;= 1) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        <span class="keywordflow">if</span> ((*arr)[high] &lt; (*arr)[low]) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            std::swap((*arr)[high], (*arr)[low]);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        }</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        *i = low;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        *j = high;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    int32_t mid = low;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    T pivot = (*arr)[high];</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keywordflow">while</span> (mid &lt;= high) {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        <span class="keywordflow">if</span> ((*arr)[mid] &lt; pivot) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            std::swap((*arr)[low++], (*arr)[mid++]);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((*arr)[mid] == pivot) {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            mid++;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((*arr)[mid] &gt; pivot) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>            std::swap((*arr)[mid], (*arr)[high--]);</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    }</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="comment">// update i and j</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    *i = low - 1;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    *j = mid;  <span class="comment">// or high-1</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>}</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>}  <span class="comment">// namespace</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00094" data-start="{" data-end="}">
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168">   94</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168">quicksort</a>(std::vector&lt;T&gt; *arr, int32_t low, int32_t high) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keywordflow">if</span> (low &gt;= high) {  <span class="comment">// 1 or 0 elements</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    }</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span> </div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    int32_t i = 0, j = 0;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="comment">// i and j are passed as reference</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    partition3(arr, low, high, &amp;i, &amp;j);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="comment">// Recur two halves</span></div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168">quicksort</a>(arr, low, i);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168">quicksort</a>(arr, j, high);</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>}</div>
+</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00119" data-start="{" data-end="}">
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#a6eb67c2f91c98cf4464f75b5882022de">  119</a></span>std::vector&lt;T&gt; <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168">quicksort</a>(std::vector&lt;T&gt; arr, int32_t low, int32_t high) {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <span class="keywordflow">if</span> (low &gt;= high) {  <span class="comment">// 1 or 0 elements</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        <span class="keywordflow">return</span> arr;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    }</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    int32_t i = 0, j = 0;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <span class="comment">// i and j are passed as reference</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    partition3(&amp;arr, low, high, &amp;i, &amp;j);</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    <span class="comment">// Recur two halves</span></div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168">quicksort</a>(&amp;arr, low, i);</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168">quicksort</a>(&amp;arr, j, high);</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <span class="keywordflow">return</span> arr;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>}</div>
+</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span> </div>
+<div class="foldopen" id="foldopen00138" data-start="{" data-end="}">
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"><a class="line" href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">  138</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">test_int</a>() {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTesting integer type arrays\n&quot;</span>;</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span> </div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> num_tests = 1; num_tests &lt; 21; num_tests++) {</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        <span class="keywordtype">size_t</span> size = std::rand() % 500;</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        std::vector&lt;int&gt; arr(size);</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;a : arr) {</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>            a = std::rand() % 500 - 250;  <span class="comment">// random numbers between -250, 249</span></div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        }</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span> </div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Test &quot;</span> &lt;&lt; num_tests &lt;&lt; <span class="stringliteral">&quot;\t Array size:&quot;</span> &lt;&lt; size &lt;&lt; <span class="stringliteral">&quot;\t &quot;</span>;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        std::vector&lt;int&gt; sorted = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168">sorting::quicksort</a>(arr, 0, int32_t(size) - 1);</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>        <span class="keywordflow">if</span> (size &lt; 20) {</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\t Sorted Array is:\n\t&quot;</span>;</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>            std::cout &lt;&lt; sorted &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>        }</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        assert(std::is_sorted(std::begin(sorted), std::end(sorted)));</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\t Passed\n&quot;</span>;</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    }</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>}</div>
+</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span> </div>
+<div class="foldopen" id="foldopen00160" data-start="{" data-end="}">
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"><a class="line" href="../../d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792">  160</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792">test_double</a>() {</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTesting Double type arrays\n&quot;</span>;</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> num_tests = 1; num_tests &lt; 21; num_tests++) {</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        <span class="keywordtype">size_t</span> size = std::rand() % 500;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>        std::vector&lt;double&gt; arr(size);</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;a : arr) {</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>            a = double(std::rand() % 500) -</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>                250.f;   <span class="comment">// random numbers between -250, 249</span></div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>            a /= 100.f;  <span class="comment">// convert to -2.5 to 2.49</span></div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>        }</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span> </div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Test &quot;</span> &lt;&lt; num_tests &lt;&lt; <span class="stringliteral">&quot;\t Array size:&quot;</span> &lt;&lt; size &lt;&lt; <span class="stringliteral">&quot;\t &quot;</span>;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>        std::vector&lt;double&gt; sorted =</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>            <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168">sorting::quicksort</a>(arr, 0, int32_t(size) - 1);</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        <span class="keywordflow">if</span> (size &lt; 20) {</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\t Sorted Array is:\n\t&quot;</span>;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>            std::cout &lt;&lt; sorted &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        }</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        assert(std::is_sorted(std::begin(sorted), std::end(sorted)));</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\t Passed\n&quot;</span>;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    }</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>}</div>
+</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span> </div>
+<div class="foldopen" id="foldopen00184" data-start="{" data-end="}">
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"><a class="line" href="../../d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  184</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    <a class="code hl_function" href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">test_int</a>();</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    <a class="code hl_function" href="../../d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792">test_double</a>();</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>}</div>
+</div>
+<div class="ttc" id="ahill__cipher_8cpp_html_a34bfcd756610834acac501f9eea1e2eb"><div class="ttname"><a href="../../d7/db9/hill__cipher_8cpp.html#a34bfcd756610834acac501f9eea1e2eb">operator&lt;&lt;</a></div><div class="ttdeci">static std::ostream &amp; operator&lt;&lt;(std::ostream &amp;out, matrix&lt; T &gt; const &amp;v)</div><div class="ttdef"><b>Definition</b> <a href="../../d7/db9/hill__cipher_8cpp_source.html#l00055">hill_cipher.cpp:55</a></div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+<div class="ttc" id="anamespacesorting_html_a9f59fe72dacc1f1218ef3c303d843168"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168">sorting::quicksort</a></div><div class="ttdeci">void quicksort(std::vector&lt; T &gt; *arr, int32_t low, int32_t high)</div><div class="ttdef"><b>Definition</b> <a href="#l00094">quick_sort_3.cpp:94</a></div></div>
+<div class="ttc" id="aquick__sort__3_8cpp_html_a07e5c62de28aeddea986890ce7ac1bda"><div class="ttname"><a href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">test_int</a></div><div class="ttdeci">static void test_int()</div><div class="ttdef"><b>Definition</b> <a href="#l00138">quick_sort_3.cpp:138</a></div></div>
+<div class="ttc" id="aquick__sort__3_8cpp_html_a2635b04ad943fa28b7bbf8d1e6479792"><div class="ttname"><a href="../../d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792">test_double</a></div><div class="ttdeci">static void test_double()</div><div class="ttdef"><b>Definition</b> <a href="#l00160">quick_sort_3.cpp:160</a></div></div>
+<div class="ttc" id="aquick__sort__3_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00184">quick_sort_3.cpp:184</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d3/d4c/quick__sort__3_8cpp.html">quick_sort_3.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/d4c/xor__cipher_8cpp.html b/d3/d4c/xor__cipher_8cpp.html
index b1e3db3d5..574557298 100644
--- a/d3/d4c/xor__cipher_8cpp.html
+++ b/d3/d4c/xor__cipher_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ciphers/xor_cipher.cpp File Reference</title>
+<title>TheAlgorithms/C++: ciphers/xor_cipher.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for xor_cipher.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d85/xor__cipher_8cpp__incl.svg" width="248" height="111"><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">
+</div>
+<p><a href="../../d3/d4c/xor__cipher_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d4e/namespaceciphers.html">ciphers</a></td></tr>
@@ -133,9 +152,9 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:aeff72a463ffc580c16cc849cbbdc58ef" id="r_aeff72a463ffc580c16cc849cbbdc58ef"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aeff72a463ffc580c16cc849cbbdc58ef">ciphers::XOR::encrypt</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text, const int &amp;key)</td></tr>
+<tr class="memitem:aeff72a463ffc580c16cc849cbbdc58ef" id="r_aeff72a463ffc580c16cc849cbbdc58ef"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aeff72a463ffc580c16cc849cbbdc58ef">ciphers::XOR::encrypt</a> (const std::string &amp;text, const int &amp;key)</td></tr>
 <tr class="separator:aeff72a463ffc580c16cc849cbbdc58ef"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a6099b7e0f1793f418d2c1befca8355a4" id="r_a6099b7e0f1793f418d2c1befca8355a4"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6099b7e0f1793f418d2c1befca8355a4">ciphers::XOR::decrypt</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text, const int &amp;key)</td></tr>
+<tr class="memitem:a6099b7e0f1793f418d2c1befca8355a4" id="r_a6099b7e0f1793f418d2c1befca8355a4"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6099b7e0f1793f418d2c1befca8355a4">ciphers::XOR::decrypt</a> (const std::string &amp;text, const int &amp;key)</td></tr>
 <tr class="separator:a6099b7e0f1793f418d2c1befca8355a4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae1a3968e7947464bee7714f6d43b7002" id="r_ae1a3968e7947464bee7714f6d43b7002"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae1a3968e7947464bee7714f6d43b7002">test</a> ()</td></tr>
 <tr class="separator:ae1a3968e7947464bee7714f6d43b7002"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -157,6 +176,8 @@ Algorithm</h3>
 <p>Choose the key for encryption and apply <a class="el" href="../../d7/d47/namespace_x_o_r.html" title="Functions for XOR cipher algorithm.">XOR</a> operation to each character of a string. Reapplying <a class="el" href="../../d7/d47/namespace_x_o_r.html" title="Functions for XOR cipher algorithm.">XOR</a> operation to each character of encrypted string will give original string back.</p>
 <dl class="section note"><dt>Note</dt><dd>This program implements <a class="el" href="../../d7/d47/namespace_x_o_r.html" title="Functions for XOR cipher algorithm.">XOR</a> Cipher for string with ASCII characters.</dd></dl>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/imdeep2905" target="_blank">Deep Raval</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/d4c/xor__cipher_8cpp_source.html">xor_cipher.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a6099b7e0f1793f418d2c1befca8355a4" name="a6099b7e0f1793f418d2c1befca8355a4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a6099b7e0f1793f418d2c1befca8355a4">&#9670;&#160;</a></span>decrypt()</h2>
@@ -165,9 +186,9 @@ Algorithm</h3>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ciphers::XOR::decrypt </td>
+          <td class="memname">std::string ciphers::XOR::decrypt </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -184,15 +205,16 @@ Algorithm</h3>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new decrypted text </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d4c/xor__cipher_8cpp_source.html#l00061">61</a> of file <a class="el" href="../../d3/d4c/xor__cipher_8cpp_source.html">xor_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   61</span>                                                                  {</div>
-<div class="line"><span class="lineno">   62</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> decrypted_text = <span class="stringliteral">&quot;&quot;</span>; <span class="comment">// Empty string to store decrypted text</span></div>
+<div class="line"><span class="lineno">   62</span>            std::string decrypted_text = <span class="stringliteral">&quot;&quot;</span>; <span class="comment">// Empty string to store decrypted text</span></div>
 <div class="line"><span class="lineno">   63</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;c : text) { <span class="comment">// Going through each character</span></div>
 <div class="line"><span class="lineno">   64</span>                <span class="keywordtype">char</span> decrypted_char = char(c ^ key); <span class="comment">// Applying decryption</span></div>
 <div class="line"><span class="lineno">   65</span>                decrypted_text += decrypted_char; <span class="comment">// Appending decrypted character</span></div>
 <div class="line"><span class="lineno">   66</span>            }</div>
 <div class="line"><span class="lineno">   67</span>            <span class="keywordflow">return</span> decrypted_text; <span class="comment">// Returning decrypted text</span></div>
 <div class="line"><span class="lineno">   68</span>        }</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -203,9 +225,9 @@ Algorithm</h3>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ciphers::XOR::encrypt </td>
+          <td class="memname">std::string ciphers::XOR::encrypt </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -222,8 +244,10 @@ Algorithm</h3>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new encrypted text </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d4c/xor__cipher_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../d3/d4c/xor__cipher_8cpp_source.html">xor_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   47</span>                                                                  {</div>
-<div class="line"><span class="lineno">   48</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> encrypted_text = <span class="stringliteral">&quot;&quot;</span>; <span class="comment">// Empty string to store encrypted text</span></div>
+<div class="line"><span class="lineno">   48</span>            std::string encrypted_text = <span class="stringliteral">&quot;&quot;</span>; <span class="comment">// Empty string to store encrypted text</span></div>
 <div class="line"><span class="lineno">   49</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;c: text) { <span class="comment">// Going through each character</span></div>
 <div class="line"><span class="lineno">   50</span>                <span class="keywordtype">char</span> encrypted_char = char(c ^ key); <span class="comment">// Applying encyption</span></div>
 <div class="line"><span class="lineno">   51</span>                encrypted_text += encrypted_char; <span class="comment">// Appending encrypted character</span></div>
@@ -248,18 +272,15 @@ Algorithm</h3>
       </table>
 </div><div class="memdoc">
 <p>Driver Code </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d4c/xor__cipher_8cpp_source.html#l00095">95</a> of file <a class="el" href="../../d3/d4c/xor__cipher_8cpp_source.html">xor_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   95</span>           {</div>
 <div class="line"><span class="lineno">   96</span>    <span class="comment">// Testing</span></div>
 <div class="line"><span class="lineno">   97</span>    <a class="code hl_function" href="#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
 <div class="line"><span class="lineno">   98</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   99</span>}</div>
-<div class="ttc" id="axor__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> xor_cipher.cpp:75</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d4c/xor__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="axor__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d4c/xor__cipher_8cpp_source.html#l00075">xor_cipher.cpp:75</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae1a3968e7947464bee7714f6d43b7002" name="ae1a3968e7947464bee7714f6d43b7002"></a>
@@ -277,34 +298,29 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Function to test above algorithm </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d4c/xor__cipher_8cpp_source.html#l00075">75</a> of file <a class="el" href="../../d3/d4c/xor__cipher_8cpp_source.html">xor_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   75</span>            {</div>
 <div class="line"><span class="lineno">   76</span>    <span class="comment">// Test 1</span></div>
-<div class="line"><span class="lineno">   77</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> text1 = <span class="stringliteral">&quot;Whipalsh! : Do watch this movie...&quot;</span>;</div>
-<div class="line"><span class="lineno">   78</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> encrypted1 = <a class="code hl_function" href="#aeff72a463ffc580c16cc849cbbdc58ef">ciphers::XOR::encrypt</a>(text1, 17);</div>
-<div class="line"><span class="lineno">   79</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> decrypted1 = <a class="code hl_function" href="#a6099b7e0f1793f418d2c1befca8355a4">ciphers::XOR::decrypt</a>(encrypted1, 17);</div>
+<div class="line"><span class="lineno">   77</span>    std::string text1 = <span class="stringliteral">&quot;Whipalsh! : Do watch this movie...&quot;</span>;</div>
+<div class="line"><span class="lineno">   78</span>    std::string encrypted1 = <a class="code hl_function" href="#aeff72a463ffc580c16cc849cbbdc58ef">ciphers::XOR::encrypt</a>(text1, 17);</div>
+<div class="line"><span class="lineno">   79</span>    std::string decrypted1 = <a class="code hl_function" href="#a6099b7e0f1793f418d2c1befca8355a4">ciphers::XOR::decrypt</a>(encrypted1, 17);</div>
 <div class="line"><span class="lineno">   80</span>    assert(text1 == decrypted1);</div>
-<div class="line"><span class="lineno">   81</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text1;</div>
-<div class="line"><span class="lineno">   82</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; , Encrypted text (with key = 17) : &quot;</span> &lt;&lt; encrypted1;</div>
-<div class="line"><span class="lineno">   83</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; , Decrypted text : &quot;</span>&lt;&lt; decrypted1 &lt;&lt; <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">   81</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text1;</div>
+<div class="line"><span class="lineno">   82</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Encrypted text (with key = 17) : &quot;</span> &lt;&lt; encrypted1;</div>
+<div class="line"><span class="lineno">   83</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Decrypted text : &quot;</span>&lt;&lt; decrypted1 &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   84</span>    <span class="comment">// Test 2</span></div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> text2 = <span class="stringliteral">&quot;-&gt;Valar M0rghulis&lt;-&quot;</span>;</div>
-<div class="line"><span class="lineno">   86</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> encrypted2 = <a class="code hl_function" href="#aeff72a463ffc580c16cc849cbbdc58ef">ciphers::XOR::encrypt</a>(text2, 29);</div>
-<div class="line"><span class="lineno">   87</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> decrypted2 = <a class="code hl_function" href="#a6099b7e0f1793f418d2c1befca8355a4">ciphers::XOR::decrypt</a>(encrypted2, 29);</div>
+<div class="line"><span class="lineno">   85</span>    std::string text2 = <span class="stringliteral">&quot;-&gt;Valar M0rghulis&lt;-&quot;</span>;</div>
+<div class="line"><span class="lineno">   86</span>    std::string encrypted2 = <a class="code hl_function" href="#aeff72a463ffc580c16cc849cbbdc58ef">ciphers::XOR::encrypt</a>(text2, 29);</div>
+<div class="line"><span class="lineno">   87</span>    std::string decrypted2 = <a class="code hl_function" href="#a6099b7e0f1793f418d2c1befca8355a4">ciphers::XOR::decrypt</a>(encrypted2, 29);</div>
 <div class="line"><span class="lineno">   88</span>    assert(text2 == decrypted2);</div>
-<div class="line"><span class="lineno">   89</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text2;</div>
-<div class="line"><span class="lineno">   90</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; , Encrypted text (with key = 29) : &quot;</span> &lt;&lt; encrypted2;</div>
-<div class="line"><span class="lineno">   91</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; , Decrypted text : &quot;</span>&lt;&lt; decrypted2 &lt;&lt; <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">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text2;</div>
+<div class="line"><span class="lineno">   90</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Encrypted text (with key = 29) : &quot;</span> &lt;&lt; encrypted2;</div>
+<div class="line"><span class="lineno">   91</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Decrypted text : &quot;</span>&lt;&lt; decrypted2 &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   92</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="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="axor__cipher_8cpp_html_a6099b7e0f1793f418d2c1befca8355a4"><div class="ttname"><a href="#a6099b7e0f1793f418d2c1befca8355a4">ciphers::XOR::decrypt</a></div><div class="ttdeci">std::string decrypt(const std::string &amp;text, const int &amp;key)</div><div class="ttdef"><b>Definition</b> xor_cipher.cpp:61</div></div>
-<div class="ttc" id="axor__cipher_8cpp_html_aeff72a463ffc580c16cc849cbbdc58ef"><div class="ttname"><a href="#aeff72a463ffc580c16cc849cbbdc58ef">ciphers::XOR::encrypt</a></div><div class="ttdeci">std::string encrypt(const std::string &amp;text, const int &amp;key)</div><div class="ttdef"><b>Definition</b> xor_cipher.cpp:47</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d4c/xor__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="axor__cipher_8cpp_html_a6099b7e0f1793f418d2c1befca8355a4"><div class="ttname"><a href="#a6099b7e0f1793f418d2c1befca8355a4">ciphers::XOR::decrypt</a></div><div class="ttdeci">std::string decrypt(const std::string &amp;text, const int &amp;key)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d4c/xor__cipher_8cpp_source.html#l00061">xor_cipher.cpp:61</a></div></div>
+<div class="ttc" id="axor__cipher_8cpp_html_aeff72a463ffc580c16cc849cbbdc58ef"><div class="ttname"><a href="#aeff72a463ffc580c16cc849cbbdc58ef">ciphers::XOR::encrypt</a></div><div class="ttdeci">std::string encrypt(const std::string &amp;text, const int &amp;key)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d4c/xor__cipher_8cpp_source.html#l00047">xor_cipher.cpp:47</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/d4c/xor__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map b/d3/d4c/xor__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
deleted file mode 100644
index ab849b4e9..000000000
--- a/d3/d4c/xor__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/d3/d4c/xor__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5 b/d3/d4c/xor__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
deleted file mode 100644
index 027bb45f5..000000000
--- a/d3/d4c/xor__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a1d13d80069df469bd6cb7baa71c0ea1
\ No newline at end of file
diff --git a/d3/d4c/xor__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg b/d3/d4c/xor__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
deleted file mode 100644
index 74b7e7dc5..000000000
--- a/d3/d4c/xor__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d4c/xor__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg b/d3/d4c/xor__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
deleted file mode 100644
index b7b979de9..000000000
--- a/d3/d4c/xor__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d4c/xor__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/d4c/xor__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 820d4e877..000000000
--- a/d3/d4c/xor__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" title=" " alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/d3/d4c/xor__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/d4c/xor__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index c4f52ee26..000000000
--- a/d3/d4c/xor__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-267e2f0061432ffb296687502c6d1864
\ No newline at end of file
diff --git a/d3/d4c/xor__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/d4c/xor__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 4ad814427..000000000
--- a/d3/d4c/xor__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d4c/xor__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/d4c/xor__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index babf8e8e2..000000000
--- a/d3/d4c/xor__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d4c/xor__cipher_8cpp_source.html b/d3/d4c/xor__cipher_8cpp_source.html
new file mode 100644
index 000000000..f91961ba4
--- /dev/null
+++ b/d3/d4c/xor__cipher_8cpp_source.html
@@ -0,0 +1,199 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: ciphers/xor_cipher.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/d4c/xor__cipher_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">xor_cipher.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/d4c/xor__cipher_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;string&gt;</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/d4e/namespaceciphers.html">ciphers</a> {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d47/namespace_x_o_r.html">XOR</a> {   </div>
+<div class="foldopen" id="foldopen00047" data-start="{" data-end="}">
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="../../d3/d4c/xor__cipher_8cpp.html#aeff72a463ffc580c16cc849cbbdc58ef">   47</a></span>        std::string encrypt (<span class="keyword">const</span> std::string &amp;text, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;key) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            std::string encrypted_text = <span class="stringliteral">&quot;&quot;</span>; <span class="comment">// Empty string to store encrypted text</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;c: text) { <span class="comment">// Going through each character</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>                <span class="keywordtype">char</span> encrypted_char = char(c ^ key); <span class="comment">// Applying encyption</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>                encrypted_text += encrypted_char; <span class="comment">// Appending encrypted character</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            }</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            <span class="keywordflow">return</span> encrypted_text; <span class="comment">// Returning encrypted text</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        }</div>
+</div>
+<div class="foldopen" id="foldopen00061" data-start="{" data-end="}">
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"><a class="line" href="../../d3/d4c/xor__cipher_8cpp.html#a6099b7e0f1793f418d2c1befca8355a4">   61</a></span>        std::string decrypt (<span class="keyword">const</span> std::string &amp;text, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;key) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            std::string decrypted_text = <span class="stringliteral">&quot;&quot;</span>; <span class="comment">// Empty string to store decrypted text</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;c : text) { <span class="comment">// Going through each character</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>                <span class="keywordtype">char</span> decrypted_char = char(c ^ key); <span class="comment">// Applying decryption</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>                decrypted_text += decrypted_char; <span class="comment">// Appending decrypted character</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            <span class="keywordflow">return</span> decrypted_text; <span class="comment">// Returning decrypted text</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        }</div>
+</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    } <span class="comment">// namespace XOR</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>} <span class="comment">// namespace ciphers</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="foldopen" id="foldopen00075" data-start="{" data-end="}">
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="../../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">   75</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="comment">// Test 1</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    std::string text1 = <span class="stringliteral">&quot;Whipalsh! : Do watch this movie...&quot;</span>;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    std::string encrypted1 = ciphers::XOR::encrypt(text1, 17);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    std::string decrypted1 = ciphers::XOR::decrypt(encrypted1, 17);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    assert(text1 == decrypted1);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text1;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Encrypted text (with key = 17) : &quot;</span> &lt;&lt; encrypted1;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Decrypted text : &quot;</span>&lt;&lt; decrypted1 &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="comment">// Test 2</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::string text2 = <span class="stringliteral">&quot;-&gt;Valar M0rghulis&lt;-&quot;</span>;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    std::string encrypted2 = ciphers::XOR::encrypt(text2, 29);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    std::string decrypted2 = ciphers::XOR::decrypt(encrypted2, 29);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    assert(text2 == decrypted2);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text2;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Encrypted text (with key = 29) : &quot;</span> &lt;&lt; encrypted2;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Decrypted text : &quot;</span>&lt;&lt; decrypted2 &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>}</div>
+</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="foldopen" id="foldopen00095" data-start="{" data-end="}">
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="../../d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   95</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="comment">// Testing</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <a class="code hl_function" href="../../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>}</div>
+</div>
+<div class="ttc" id="anamespace_x_o_r_html"><div class="ttname"><a href="../../d7/d47/namespace_x_o_r.html">XOR</a></div><div class="ttdoc">Functions for XOR cipher algorithm.</div></div>
+<div class="ttc" id="anamespaceciphers_html"><div class="ttname"><a href="../../d6/d4e/namespaceciphers.html">ciphers</a></div><div class="ttdoc">Algorithms for encryption and decryption.</div></div>
+<div class="ttc" id="axor__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00075">xor_cipher.cpp:75</a></div></div>
+<div class="ttc" id="axor__cipher_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00095">xor_cipher.cpp:95</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_4d6e05837bf820fb089a8a8cdf2f42b7.html">ciphers</a></li><li class="navelem"><a class="el" href="../../d3/d4c/xor__cipher_8cpp.html">xor_cipher.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/d53/mo_8cpp_source.html b/d3/d53/mo_8cpp_source.html
new file mode 100644
index 000000000..d56dad7c1
--- /dev/null
+++ b/d3/d53/mo_8cpp_source.html
@@ -0,0 +1,212 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: range_queries/mo.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/d53/mo_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">mo.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 1e6 + 5;</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="keywordtype">int</span> a[<a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>], bucket[<a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>], cnt[<a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>];</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="keywordtype">int</span> bucket_size;</div>
+<div class="foldopen" id="foldopen00009" data-start="{" data-end="};">
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"><a class="line" href="../../dd/d1b/structquery.html">    9</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../dd/d1b/structquery.html">query</a> {</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    <span class="keywordtype">int</span> l, r, i;</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>} q[N];</div>
+</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="keywordtype">int</span> ans = 0;</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a>(<span class="keywordtype">int</span> index) {</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    cnt[a[index]]++;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <span class="keywordflow">if</span> (cnt[a[index]] == 1)</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>        ans++;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>}</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931">remove</a>(<span class="keywordtype">int</span> index) {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    cnt[a[index]]--;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keywordflow">if</span> (cnt[a[index]] == 0)</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        ans--;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>}</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keywordtype">bool</span> mycmp(<a class="code hl_struct" href="../../dd/d1b/structquery.html">query</a> x, <a class="code hl_struct" href="../../dd/d1b/structquery.html">query</a> y) {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="keywordflow">if</span> (x.l / bucket_size != y.l / bucket_size)</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        <span class="keywordflow">return</span> x.l / bucket_size &lt; y.l / bucket_size;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="keywordflow">return</span> x.r &lt; y.r;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>}</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordtype">int</span> n, t, i, j, <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = 0;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    scanf(<span class="stringliteral">&quot;%d&quot;</span>, &amp;n);</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">for</span> (i = 0; i &lt; n; i++) scanf(<span class="stringliteral">&quot;%d&quot;</span>, &amp;a[i]);</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    bucket_size = ceil(sqrt(n));</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    scanf(<span class="stringliteral">&quot;%d&quot;</span>, &amp;t);</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">for</span> (i = 0; i &lt; t; i++) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        scanf(<span class="stringliteral">&quot;%d %d&quot;</span>, &amp;q[i].l, &amp;q[i].r);</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        q[i].l--;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        q[i].r--;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        q[i].i = i;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    sort(q, q + t, mycmp);</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordtype">int</span> left = 0, right = 0;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordflow">for</span> (i = 0; i &lt; t; i++) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordtype">int</span> L = q[i].l, R = q[i].r;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="keywordflow">while</span> (left &lt; L) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931">remove</a>(left);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            left++;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        <span class="keywordflow">while</span> (left &gt; L) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            <a class="code hl_function" href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a>(left - 1);</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            left--;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="keywordflow">while</span> (right &lt;= R) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            <a class="code hl_function" href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a>(right);</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            right++;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <span class="keywordflow">while</span> (right &gt; R + 1) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931">remove</a>(right - 1);</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            right--;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        }</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        bucket[q[i].i] = ans;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordflow">for</span> (i = 0; i &lt; t; i++) printf(<span class="stringliteral">&quot;%d\n&quot;</span>, bucket[i]);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>}</div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_a28083ecac6eb94b643281875c8665931"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931">double_hashing::remove</a></div><div class="ttdeci">void remove(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00199">double_hash_hash_table.cpp:199</a></div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+<div class="ttc" id="astructquery_html"><div class="ttname"><a href="../../dd/d1b/structquery.html">query</a></div><div class="ttdef"><b>Definition</b> <a href="#l00009">mo.cpp:9</a></div></div>
+<div class="ttc" id="auint128__t_8hpp_html_a3ff77262ffd6743df5b808d41382a6f3"><div class="ttname"><a href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a></div><div class="ttdeci">std::string add(const std::string &amp;first, const std::string &amp;second)</div><div class="ttdoc">Adding two string.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00038">uint128_t.hpp:38</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_074119ce3a874b57120c49a0cc4bb5ad.html">range_queries</a></li><li class="navelem"><b>mo.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/d61/vector__important__functions_8cpp.html b/d3/d61/vector__important__functions_8cpp.html
index 492a7ff3c..4d904190a 100644
--- a/d3/d61/vector__important__functions_8cpp.html
+++ b/d3/d61/vector__important__functions_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/vector_important_functions.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/vector_important_functions.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,7 +127,7 @@ $(function(){initNavTree('d3/d61/vector__important__functions_8cpp.html','../../
 </div><!--header-->
 <div class="contents">
 
-<p>A C++ program to demonstrate working of <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort()</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse()</a>  
+<p>A C++ program to demonstrate working of std::sort(), std::reverse()  
 <a href="#details">More...</a></p>
 <div class="textblock"><code>#include &lt;algorithm&gt;</code><br />
 <code>#include &lt;iostream&gt;</code><br />
@@ -121,14 +138,18 @@ Include dependency graph for vector_important_functions.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/dca/vector__important__functions_8cpp__incl.svg" width="354" height="126"><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">
+</div>
+<p><a href="../../d3/d61/vector__important__functions_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
 <tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
-<div class="textblock"><p>A C++ program to demonstrate working of <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort()</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse()</a> </p>
+<div class="textblock"><p>A C++ program to demonstrate working of std::sort(), std::reverse() </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/d61/vector__important__functions_8cpp_source.html">vector_important_functions.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -145,52 +166,42 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d61/vector__important__functions_8cpp_source.html#l00011">11</a> of file <a class="el" href="../../d3/d61/vector__important__functions_8cpp_source.html">vector_important_functions.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   11</span>           {</div>
 <div class="line"><span class="lineno">   12</span>    <span class="comment">// Initializing vector with array values</span></div>
 <div class="line"><span class="lineno">   13</span>    <span class="keywordtype">int</span> arr[] = {10, 20, 5, 23, 42, 15};</div>
 <div class="line"><span class="lineno">   14</span>    <span class="keywordtype">int</span> n = <span class="keyword">sizeof</span>(arr) / <span class="keyword">sizeof</span>(arr[0]);</div>
-<div class="line"><span class="lineno">   15</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> vect(arr, arr + n);</div>
+<div class="line"><span class="lineno">   15</span>    std::vector&lt;int&gt; vect(arr, arr + n);</div>
 <div class="line"><span class="lineno">   16</span> </div>
-<div class="line"><span class="lineno">   17</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Vector is: &quot;</span>;</div>
-<div class="line"><span class="lineno">   18</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; vect[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   17</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Vector is: &quot;</span>;</div>
+<div class="line"><span class="lineno">   18</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) std::cout &lt;&lt; vect[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   19</span> </div>
 <div class="line"><span class="lineno">   20</span>    <span class="comment">// Sorting the Vector in Ascending order</span></div>
-<div class="line"><span class="lineno">   21</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a>(vect.begin(), vect.end());</div>
+<div class="line"><span class="lineno">   21</span>    std::sort(vect.begin(), vect.end());</div>
 <div class="line"><span class="lineno">   22</span> </div>
-<div class="line"><span class="lineno">   23</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nVector after sorting is: &quot;</span>;</div>
-<div class="line"><span class="lineno">   24</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; vect[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   23</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nVector after sorting is: &quot;</span>;</div>
+<div class="line"><span class="lineno">   24</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) std::cout &lt;&lt; vect[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   25</span> </div>
 <div class="line"><span class="lineno">   26</span>    <span class="comment">// Reversing the Vector</span></div>
-<div class="line"><span class="lineno">   27</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a>(vect.begin(), vect.end());</div>
+<div class="line"><span class="lineno">   27</span>    std::reverse(vect.begin(), vect.end());</div>
 <div class="line"><span class="lineno">   28</span> </div>
-<div class="line"><span class="lineno">   29</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nVector after reversing is: &quot;</span>;</div>
-<div class="line"><span class="lineno">   30</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 6; i++) <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; vect[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   29</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nVector after reversing is: &quot;</span>;</div>
+<div class="line"><span class="lineno">   30</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 6; i++) std::cout &lt;&lt; vect[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   31</span> </div>
-<div class="line"><span class="lineno">   32</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nMaximum element of vector is: &quot;</span>;</div>
-<div class="line"><span class="lineno">   33</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; *<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">max_element</a>(vect.begin(), vect.end());</div>
+<div class="line"><span class="lineno">   32</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nMaximum element of vector is: &quot;</span>;</div>
+<div class="line"><span class="lineno">   33</span>    std::cout &lt;&lt; *max_element(vect.begin(), vect.end());</div>
 <div class="line"><span class="lineno">   34</span> </div>
-<div class="line"><span class="lineno">   35</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nMinimum element of vector is: &quot;</span>;</div>
-<div class="line"><span class="lineno">   36</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; *<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min_element.html">min_element</a>(vect.begin(), vect.end());</div>
+<div class="line"><span class="lineno">   35</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nMinimum element of vector is: &quot;</span>;</div>
+<div class="line"><span class="lineno">   36</span>    std::cout &lt;&lt; *min_element(vect.begin(), vect.end());</div>
 <div class="line"><span class="lineno">   37</span> </div>
 <div class="line"><span class="lineno">   38</span>    <span class="comment">// Starting the summation from 0</span></div>
-<div class="line"><span class="lineno">   39</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nThe summation of vector elements is: &quot;</span>;</div>
-<div class="line"><span class="lineno">   40</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html">accumulate</a>(vect.begin(), vect.end(), 0);</div>
+<div class="line"><span class="lineno">   39</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nThe summation of vector elements is: &quot;</span>;</div>
+<div class="line"><span class="lineno">   40</span>    std::cout &lt;&lt; accumulate(vect.begin(), vect.end(), 0);</div>
 <div class="line"><span class="lineno">   41</span> </div>
 <div class="line"><span class="lineno">   42</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   43</span>}</div>
-<div class="ttc" id="aaccumulate_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html">std::accumulate</a></div><div class="ttdeci">T accumulate(T... args)</div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="amax_element_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">std::max_element</a></div><div class="ttdeci">T max_element(T... args)</div></div>
-<div class="ttc" id="amin_element_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min_element.html">std::min_element</a></div><div class="ttdeci">T min_element(T... args)</div></div>
-<div class="ttc" id="areverse_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a></div><div class="ttdeci">T reverse(T... args)</div></div>
-<div class="ttc" id="asort_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a></div><div class="ttdeci">T sort(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="231" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 035eb807c..000000000
--- a/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,80,55,106"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="103,5,225,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="46,77,101,40,110,35,112,40,104,44,49,82"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="108,55,220,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="54,86,92,78,93,84,55,91"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/reverse.html#" title=" " alt="" coords="119,104,209,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="55,95,104,103,103,109,54,100"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/sort.html#" title=" " alt="" coords="129,153,198,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="50,104,104,140,116,146,114,151,101,144,47,108"/>
-</map>
diff --git a/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index d2ab53fe4..000000000
--- a/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-312ca0d34ef2757daf2c31970ee2e14c
\ No newline at end of file
diff --git a/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 7ae9af2fc..000000000
--- a/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="173pt" height="138pt"
- viewBox="0.00 0.00 172.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164.75,-130.25 73,-130.25 73,-111 164.75,-111 164.75,-130.25"/>
-<text text-anchor="middle" x="118.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.71,-74.56C42.21,-82.8 58,-94.44 73,-102.62 75.07,-103.76 77.23,-104.86 79.43,-105.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.93,-109.08 88.49,-109.96 80.79,-102.69 77.93,-109.08"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161,-93.25 76.75,-93.25 76.75,-74 161,-74 161,-93.25"/>
-<text text-anchor="middle" x="118.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.09,-68.02C45.12,-69.57 55.11,-71.5 65.29,-73.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.37,-76.86 74.85,-75.32 65.69,-69.98 64.37,-76.86"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152.75,-56.25 85,-56.25 85,-37 152.75,-37 152.75,-56.25"/>
-<text text-anchor="middle" x="118.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.09,-61.41C47.26,-59.55 60.56,-57.11 73.43,-54.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.83,-58.24 83.04,-53 72.57,-51.36 73.83,-58.24"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="144.88,-19.25 92.88,-19.25 92.88,0 144.88,0 144.88,-19.25"/>
-<text text-anchor="middle" x="118.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.17,-54.65C42.7,-46.67 58.28,-35.54 73,-27.62 76.01,-26.01 79.19,-24.45 82.42,-22.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.53,-26.31 91.34,-19.16 80.77,-19.87 83.53,-26.31"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 9802f620a..000000000
--- a/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="173pt" height="138pt"
- viewBox="0.00 0.00 172.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164.75,-130.25 73,-130.25 73,-111 164.75,-111 164.75,-130.25"/>
-<text text-anchor="middle" x="118.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.71,-74.56C42.21,-82.8 58,-94.44 73,-102.62 75.07,-103.76 77.23,-104.86 79.43,-105.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.93,-109.08 88.49,-109.96 80.79,-102.69 77.93,-109.08"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161,-93.25 76.75,-93.25 76.75,-74 161,-74 161,-93.25"/>
-<text text-anchor="middle" x="118.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.09,-68.02C45.12,-69.57 55.11,-71.5 65.29,-73.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.37,-76.86 74.85,-75.32 65.69,-69.98 64.37,-76.86"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152.75,-56.25 85,-56.25 85,-37 152.75,-37 152.75,-56.25"/>
-<text text-anchor="middle" x="118.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.09,-61.41C47.26,-59.55 60.56,-57.11 73.43,-54.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.83,-58.24 83.04,-53 72.57,-51.36 73.83,-58.24"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="144.88,-19.25 92.88,-19.25 92.88,0 144.88,0 144.88,-19.25"/>
-<text text-anchor="middle" x="118.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.17,-54.65C42.7,-46.67 58.28,-35.54 73,-27.62 76.01,-26.01 79.19,-24.45 82.42,-22.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.53,-26.31 91.34,-19.16 80.77,-19.87 83.53,-26.31"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d61/vector__important__functions_8cpp_source.html b/d3/d61/vector__important__functions_8cpp_source.html
new file mode 100644
index 000000000..7133f51f9
--- /dev/null
+++ b/d3/d61/vector__important__functions_8cpp_source.html
@@ -0,0 +1,179 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/vector_important_functions.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/d61/vector__important__functions_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">vector_important_functions.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/d61/vector__important__functions_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;numeric&gt;</span>  <span class="comment">// For accumulate operation</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
+<div class="foldopen" id="foldopen00011" data-start="{" data-end="}">
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"><a class="line" href="../../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   11</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="comment">// Initializing vector with array values</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <span class="keywordtype">int</span> arr[] = {10, 20, 5, 23, 42, 15};</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordtype">int</span> n = <span class="keyword">sizeof</span>(arr) / <span class="keyword">sizeof</span>(arr[0]);</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    std::vector&lt;int&gt; vect(arr, arr + n);</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Vector is: &quot;</span>;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) std::cout &lt;&lt; vect[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="comment">// Sorting the Vector in Ascending order</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    std::sort(vect.begin(), vect.end());</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nVector after sorting is: &quot;</span>;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) std::cout &lt;&lt; vect[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="comment">// Reversing the Vector</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    std::reverse(vect.begin(), vect.end());</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nVector after reversing is: &quot;</span>;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 6; i++) std::cout &lt;&lt; vect[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nMaximum element of vector is: &quot;</span>;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    std::cout &lt;&lt; *max_element(vect.begin(), vect.end());</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nMinimum element of vector is: &quot;</span>;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    std::cout &lt;&lt; *min_element(vect.begin(), vect.end());</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="comment">// Starting the summation from 0</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nThe summation of vector elements is: &quot;</span>;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    std::cout &lt;&lt; accumulate(vect.begin(), vect.end(), 0);</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>}</div>
+</div>
+<div class="ttc" id="avector__important__functions_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00011">vector_important_functions.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../d3/d61/vector__important__functions_8cpp.html">vector_important_functions.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.map b/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.map
index a1388dd47..fd892a1db 100644
--- a/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.map
+++ b/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.map
@@ -1,11 +1,11 @@
 <map id="machine_learning::neural_network::layers::DenseLayer" name="machine_learning::neural_network::layers::DenseLayer">
 <area shape="rect" id="Node000001" title=" " alt="" coords="48,213,243,253"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string.html" title=" " alt="" coords="32,116,112,142"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="32,116,112,142"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="92,153,133,211,129,214,87,156"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string.html" title=" " alt="" coords="5,5,131,46"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="5,5,131,46"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="72,61,74,116,69,116,67,61"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="144,109,312,150"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="144,109,312,150"/>
 <area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="204,164,163,214,159,211,200,160"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/valarray.html" title=" " alt="" coords="154,13,310,38"/>
+<area shape="rect" id="Node000005" title=" " alt="" coords="154,13,310,38"/>
 <area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="234,54,231,109,226,108,228,54"/>
 </map>
diff --git a/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.md5 b/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.md5
index 3b70553a3..4fd94a0db 100644
--- a/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.md5
+++ b/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.md5
@@ -1 +1 @@
-a6758ec4ee1be61728dae08e00c64118
\ No newline at end of file
+032639c9d85c64eec4bd6bd2ad3a0358
\ No newline at end of file
diff --git a/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.svg b/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.svg
index cc6895905..fc9cfe06c 100644
--- a/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.svg
+++ b/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph.svg
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="79.75,-102.62 20.25,-102.62 20.25,-83.38 79.75,-83.38 79.75,-102.62"/>
 <text text-anchor="middle" x="50" y="-89.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::string</text>
 </a>
@@ -51,7 +51,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="94,-186 0,-186 0,-155.5 94,-155.5 94,-186"/>
 <text text-anchor="start" x="8" y="-172.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::basic_string&lt;</text>
 <text text-anchor="middle" x="47" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00"> Char &gt;</text>
@@ -70,7 +70,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="229.75,-108.25 104.25,-108.25 104.25,-77.75 229.75,-77.75 229.75,-108.25"/>
 <text text-anchor="start" x="112.25" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::valarray</text>
 <text text-anchor="middle" x="167" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; double &gt; &gt;</text>
@@ -90,7 +90,7 @@
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/valarray.html" xlink:title=" ">
+<g id="a_Node000005"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="228.25,-180.38 111.75,-180.38 111.75,-161.12 228.25,-161.12 228.25,-180.38"/>
 <text text-anchor="middle" x="170" y="-166.88" font-family="Helvetica,sans-Serif" font-size="10.00">std::valarray&lt; double &gt;</text>
 </a>
diff --git a/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph_org.svg b/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph_org.svg
index b62dfc605..a9b32ebd0 100644
--- a/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph_org.svg
+++ b/d3/d65/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer__coll__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="79.75,-102.62 20.25,-102.62 20.25,-83.38 79.75,-83.38 79.75,-102.62"/>
 <text text-anchor="middle" x="50" y="-89.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::string</text>
 </a>
@@ -40,7 +40,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="94,-186 0,-186 0,-155.5 94,-155.5 94,-186"/>
 <text text-anchor="start" x="8" y="-172.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::basic_string&lt;</text>
 <text text-anchor="middle" x="47" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00"> Char &gt;</text>
@@ -59,7 +59,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="229.75,-108.25 104.25,-108.25 104.25,-77.75 229.75,-77.75 229.75,-108.25"/>
 <text text-anchor="start" x="112.25" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::valarray</text>
 <text text-anchor="middle" x="167" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; double &gt; &gt;</text>
@@ -79,7 +79,7 @@
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/valarray.html" xlink:title=" ">
+<g id="a_Node000005"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="228.25,-180.38 111.75,-180.38 111.75,-161.12 228.25,-161.12 228.25,-180.38"/>
 <text text-anchor="middle" x="170" y="-166.88" font-family="Helvetica,sans-Serif" font-size="10.00">std::valarray&lt; double &gt;</text>
 </a>
diff --git a/d3/d6d/namespacesimpson__method.html b/d3/d6d/namespacesimpson__method.html
index 1af52db9d..baf7fa55b 100644
--- a/d3/d6d/namespacesimpson__method.html
+++ b/d3/d6d/namespacesimpson__method.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: simpson_method Namespace Reference</title>
+<title>TheAlgorithms/C++: simpson_method Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d3/d7d/brute__force__string__searching_8cpp.html b/d3/d7d/brute__force__string__searching_8cpp.html
index d39783432..90ec10e59 100644
--- a/d3/d7d/brute__force__string__searching_8cpp.html
+++ b/d3/d7d/brute__force__string__searching_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: strings/brute_force_string_searching.cpp File Reference</title>
+<title>TheAlgorithms/C++: strings/brute_force_string_searching.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for brute_force_string_searching.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dbf/brute__force__string__searching_8cpp__incl.svg" width="247" height="126"><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">
+</div>
+<p><a href="../../d3/d7d/brute__force__string__searching_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html">string_search</a></td></tr>
@@ -131,18 +150,20 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:aeb2cd81064717aedd62bfb096b1a73d8" id="r_aeb2cd81064717aedd62bfb096b1a73d8"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8">string_search::brute_force</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;pattern)</td></tr>
+<tr class="memitem:aeb2cd81064717aedd62bfb096b1a73d8" id="r_aeb2cd81064717aedd62bfb096b1a73d8"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8">string_search::brute_force</a> (const std::string &amp;text, const std::string &amp;pattern)</td></tr>
 <tr class="separator:aeb2cd81064717aedd62bfb096b1a73d8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
 <tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:ae2abaa9caa13fff35e45edca00bee123" id="r_ae2abaa9caa13fff35e45edca00bee123"><td class="memItemLeft" align="right" valign="top">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae2abaa9caa13fff35e45edca00bee123">test_set</a></td></tr>
+<tr class="memitem:ae2abaa9caa13fff35e45edca00bee123" id="r_ae2abaa9caa13fff35e45edca00bee123"><td class="memItemLeft" align="right" valign="top">const std::vector&lt; std::vector&lt; std::string &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae2abaa9caa13fff35e45edca00bee123">test_set</a></td></tr>
 <tr class="separator:ae2abaa9caa13fff35e45edca00bee123"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>String pattern search - brute force. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/d7d/brute__force__string__searching_8cpp_source.html">brute_force_string_searching.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -159,27 +180,22 @@ Variables</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d7d/brute__force__string__searching_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../d3/d7d/brute__force__string__searching_8cpp_source.html">brute_force_string_searching.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   47</span>           {</div>
 <div class="line"><span class="lineno">   48</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;i : <a class="code hl_variable" href="#ae2abaa9caa13fff35e45edca00bee123">test_set</a>) {</div>
 <div class="line"><span class="lineno">   49</span>        <span class="keywordtype">int</span> output = brute_force(i[0], i[1]);</div>
 <div class="line"><span class="lineno">   50</span> </div>
-<div class="line"><span class="lineno">   51</span>        <span class="keywordflow">if</span> (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html">std::to_string</a>(output) == i[2]) {</div>
-<div class="line"><span class="lineno">   52</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;success\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   51</span>        <span class="keywordflow">if</span> (std::to_string(output) == i[2]) {</div>
+<div class="line"><span class="lineno">   52</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;success\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   53</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   54</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;failure\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   54</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;failure\n&quot;</span>;</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="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   58</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="abrute__force__string__searching_8cpp_html_ae2abaa9caa13fff35e45edca00bee123"><div class="ttname"><a href="#ae2abaa9caa13fff35e45edca00bee123">test_set</a></div><div class="ttdeci">const std::vector&lt; std::vector&lt; std::string &gt; &gt; test_set</div><div class="ttdef"><b>Definition</b> brute_force_string_searching.cpp:41</div></div>
-<div class="ttc" id="ato_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html">std::to_string</a></div><div class="ttdeci">T to_string(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-</div>
-
+<div class="ttc" id="abrute__force__string__searching_8cpp_html_ae2abaa9caa13fff35e45edca00bee123"><div class="ttname"><a href="#ae2abaa9caa13fff35e45edca00bee123">test_set</a></div><div class="ttdeci">const std::vector&lt; std::vector&lt; std::string &gt; &gt; test_set</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d7d/brute__force__string__searching_8cpp_source.html#l00041">brute_force_string_searching.cpp:41</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Variable Documentation</h2>
@@ -190,7 +206,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&gt; &gt; test_set</td>
+          <td class="memname">const std::vector&lt;std::vector&lt;std::string&gt; &gt; test_set</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -199,6 +215,8 @@ Here is the call graph for this function:</div>
 <div class="line">    {<span class="stringliteral">&quot;a&quot;</span>, <span class="stringliteral">&quot;aa&quot;</span>, <span class="stringliteral">&quot;-1&quot;</span>},  {<span class="stringliteral">&quot;a&quot;</span>, <span class="stringliteral">&quot;a&quot;</span>, <span class="stringliteral">&quot;0&quot;</span>},    {<span class="stringliteral">&quot;ba&quot;</span>, <span class="stringliteral">&quot;b&quot;</span>, <span class="stringliteral">&quot;0&quot;</span>},</div>
 <div class="line">    {<span class="stringliteral">&quot;bba&quot;</span>, <span class="stringliteral">&quot;bb&quot;</span>, <span class="stringliteral">&quot;0&quot;</span>}, {<span class="stringliteral">&quot;bbca&quot;</span>, <span class="stringliteral">&quot;c&quot;</span>, <span class="stringliteral">&quot;2&quot;</span>}, {<span class="stringliteral">&quot;ab&quot;</span>, <span class="stringliteral">&quot;b&quot;</span>, <span class="stringliteral">&quot;1&quot;</span>}}</div>
 </div><!-- fragment --><p>set of test cases </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d7d/brute__force__string__searching_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../d3/d7d/brute__force__string__searching_8cpp_source.html">brute_force_string_searching.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   41</span>                                                 {</div>
 <div class="line"><span class="lineno">   42</span>    <span class="comment">// {text, pattern, expected output}</span></div>
 <div class="line"><span class="lineno">   43</span>    {<span class="stringliteral">&quot;a&quot;</span>, <span class="stringliteral">&quot;aa&quot;</span>, <span class="stringliteral">&quot;-1&quot;</span>},  {<span class="stringliteral">&quot;a&quot;</span>, <span class="stringliteral">&quot;a&quot;</span>, <span class="stringliteral">&quot;0&quot;</span>},    {<span class="stringliteral">&quot;ba&quot;</span>, <span class="stringliteral">&quot;b&quot;</span>, <span class="stringliteral">&quot;0&quot;</span>},</div>
diff --git a/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index efe013608..000000000
--- a/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/to_string.html#" title=" " alt="" coords="103,5,200,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 49b22e1ca..000000000
--- a/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c5855b8490389800b06f57bcbbd5c9aa
\ No newline at end of file
diff --git a/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 1c9dd2d23..000000000
--- a/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="154pt" height="27pt"
- viewBox="0.00 0.00 154.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146,-19.25 73,-19.25 73,0 146,0 146,-19.25"/>
-<text text-anchor="middle" x="109.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::to_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.08,-9.62C44.13,-9.62 52.61,-9.62 61.24,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.04,-13.13 71.04,-9.63 61.04,-6.13 61.04,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index cc2b03070..000000000
--- a/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="154pt" height="27pt"
- viewBox="0.00 0.00 154.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146,-19.25 73,-19.25 73,0 146,0 146,-19.25"/>
-<text text-anchor="middle" x="109.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::to_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.08,-9.62C44.13,-9.62 52.61,-9.62 61.24,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.04,-13.13 71.04,-9.63 61.04,-6.13 61.04,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d7d/brute__force__string__searching_8cpp_source.html b/d3/d7d/brute__force__string__searching_8cpp_source.html
new file mode 100644
index 000000000..a0b0d8658
--- /dev/null
+++ b/d3/d7d/brute__force__string__searching_8cpp_source.html
@@ -0,0 +1,195 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: strings/brute_force_string_searching.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/d7d/brute__force__string__searching_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">brute_force_string_searching.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/d7d/brute__force__string__searching_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#ifdef _MSC_VER</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;string&gt;</span>  <span class="comment">// use this for MS Visual C++</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="foldopen" id="foldopen00013" data-start="{" data-end="}">
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"><a class="line" href="../../d9/d03/namespacestring__search.html">   13</a></span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/d03/namespacestring__search.html">string_search</a> {</div>
+<div class="foldopen" id="foldopen00021" data-start="{" data-end="}">
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"><a class="line" href="../../d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8">   21</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8">brute_force</a>(<span class="keyword">const</span> std::string &amp;text, <span class="keyword">const</span> std::string &amp;pattern) {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    <span class="keywordtype">size_t</span> pat_l = pattern.length();</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    <span class="keywordtype">size_t</span> txt_l = text.length();</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="keywordtype">int</span> index = -1;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="keywordflow">if</span> (pat_l &lt;= txt_l) {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; txt_l - pat_l + 1; i++) {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>            std::string s = text.substr(i, pat_l);</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>            <span class="keywordflow">if</span> (s == pattern) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>                index = i;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>            }</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        }</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    }</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">return</span> index;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>}</div>
+</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>}  <span class="comment">// namespace string_search</span></div>
+</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="keyword">using </span><a class="code hl_function" href="../../d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8">string_search::brute_force</a>;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="foldopen" id="foldopen00041" data-start="{" data-end="};">
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123">   41</a></span><span class="keyword">const</span> std::vector&lt;std::vector&lt;std::string&gt;&gt; <a class="code hl_variable" href="../../d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123">test_set</a> = {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="comment">// {text, pattern, expected output}</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    {<span class="stringliteral">&quot;a&quot;</span>, <span class="stringliteral">&quot;aa&quot;</span>, <span class="stringliteral">&quot;-1&quot;</span>},  {<span class="stringliteral">&quot;a&quot;</span>, <span class="stringliteral">&quot;a&quot;</span>, <span class="stringliteral">&quot;0&quot;</span>},    {<span class="stringliteral">&quot;ba&quot;</span>, <span class="stringliteral">&quot;b&quot;</span>, <span class="stringliteral">&quot;0&quot;</span>},</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    {<span class="stringliteral">&quot;bba&quot;</span>, <span class="stringliteral">&quot;bb&quot;</span>, <span class="stringliteral">&quot;0&quot;</span>}, {<span class="stringliteral">&quot;bbca&quot;</span>, <span class="stringliteral">&quot;c&quot;</span>, <span class="stringliteral">&quot;2&quot;</span>}, {<span class="stringliteral">&quot;ab&quot;</span>, <span class="stringliteral">&quot;b&quot;</span>, <span class="stringliteral">&quot;1&quot;</span>}};</div>
+</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="foldopen" id="foldopen00047" data-start="{" data-end="}">
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="../../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   47</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;i : <a class="code hl_variable" href="../../d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123">test_set</a>) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        <span class="keywordtype">int</span> output = brute_force(i[0], i[1]);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        <span class="keywordflow">if</span> (std::to_string(output) == i[2]) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;success\n&quot;</span>;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;failure\n&quot;</span>;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}</div>
+</div>
+<div class="ttc" id="abrute__force__string__searching_8cpp_html_ae2abaa9caa13fff35e45edca00bee123"><div class="ttname"><a href="../../d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123">test_set</a></div><div class="ttdeci">const std::vector&lt; std::vector&lt; std::string &gt; &gt; test_set</div><div class="ttdef"><b>Definition</b> <a href="#l00041">brute_force_string_searching.cpp:41</a></div></div>
+<div class="ttc" id="abrute__force__string__searching_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00047">brute_force_string_searching.cpp:47</a></div></div>
+<div class="ttc" id="anamespacestring__search_html"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html">string_search</a></div><div class="ttdoc">String search algorithms.</div><div class="ttdef"><b>Definition</b> <a href="#l00013">brute_force_string_searching.cpp:13</a></div></div>
+<div class="ttc" id="anamespacestring__search_html_aeb2cd81064717aedd62bfb096b1a73d8"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8">string_search::brute_force</a></div><div class="ttdeci">int brute_force(const std::string &amp;text, const std::string &amp;pattern)</div><div class="ttdef"><b>Definition</b> <a href="#l00021">brute_force_string_searching.cpp:21</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_73a3cc5065b223eb41b02873c0e19f0e.html">strings</a></li><li class="navelem"><a class="el" href="../../d3/d7d/brute__force__string__searching_8cpp.html">brute_force_string_searching.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/d80/z__function_8cpp.html b/d3/d80/z__function_8cpp.html
index c1cd6ddf5..9643faa52 100644
--- a/d3/d80/z__function_8cpp.html
+++ b/d3/d80/z__function_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: strings/z_function.cpp File Reference</title>
+<title>TheAlgorithms/C++: strings/z_function.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,13 +139,15 @@ Include dependency graph for z_function.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/df1/z__function_8cpp__incl.svg" width="420" height="111"><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">
+</div>
+<p><a href="../../d3/d80/z__function_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:ac044c4794349a8cff6256b99950d5773" id="r_ac044c4794349a8cff6256b99950d5773"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac044c4794349a8cff6256b99950d5773">Z_function</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;pattern)</td></tr>
+<tr class="memitem:ac044c4794349a8cff6256b99950d5773" id="r_ac044c4794349a8cff6256b99950d5773"><td class="memItemLeft" align="right" valign="top">std::vector&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac044c4794349a8cff6256b99950d5773">Z_function</a> (const std::string &amp;pattern)</td></tr>
 <tr class="memdesc:ac044c4794349a8cff6256b99950d5773"><td class="mdescLeft">&#160;</td><td class="mdescRight">for IO operations  <br /></td></tr>
 <tr class="separator:ac044c4794349a8cff6256b99950d5773"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ac186ca3ac3a69b5e52543bb13fe46db8" id="r_ac186ca3ac3a69b5e52543bb13fe46db8"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac186ca3ac3a69b5e52543bb13fe46db8">find_pat_in_text</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;pattern, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text)</td></tr>
+<tr class="memitem:ac186ca3ac3a69b5e52543bb13fe46db8" id="r_ac186ca3ac3a69b5e52543bb13fe46db8"><td class="memItemLeft" align="right" valign="top">std::vector&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac186ca3ac3a69b5e52543bb13fe46db8">find_pat_in_text</a> (const std::string &amp;pattern, const std::string &amp;text)</td></tr>
 <tr class="memdesc:ac186ca3ac3a69b5e52543bb13fe46db8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Using Z_function to find a pattern in a text.  <br /></td></tr>
 <tr class="separator:ac186ca3ac3a69b5e52543bb13fe46db8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -145,6 +164,8 @@ Functions</h2></td></tr>
 <li>E.g.: string: ababb then z[2]=2 as s[2]=s[0] and s[3]=s[1] and s[4]!=s[2] <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/RitikaGupta8734" target="_blank">Ritika Gupta</a> </dd></dl>
 </li>
 </ol>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/d80/z__function_8cpp_source.html">z_function.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ac186ca3ac3a69b5e52543bb13fe46db8" name="ac186ca3ac3a69b5e52543bb13fe46db8"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ac186ca3ac3a69b5e52543bb13fe46db8">&#9670;&#160;</a></span>find_pat_in_text()</h2>
@@ -153,14 +174,14 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; find_pat_in_text </td>
+          <td class="memname">std::vector&lt; uint64_t &gt; find_pat_in_text </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>pattern</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>pattern</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>&#160;)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -174,28 +195,22 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>a vector of starting indexes where pattern is found in the text </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d80/z__function_8cpp_source.html#l00054">54</a> of file <a class="el" href="../../d3/d80/z__function_8cpp_source.html">z_function.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   55</span>                                                              {</div>
-<div class="line"><span class="lineno">   56</span>    uint64_t text_length = text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>(), pattern_length = pattern.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
-<div class="line"><span class="lineno">   57</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> z = <a class="code hl_function" href="#ac044c4794349a8cff6256b99950d5773">Z_function</a>(pattern + <span class="charliteral">&#39;#&#39;</span> + text);</div>
-<div class="line"><span class="lineno">   58</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> matching_indexes;</div>
+<div class="line"><span class="lineno">   56</span>    uint64_t text_length = text.size(), pattern_length = pattern.size();</div>
+<div class="line"><span class="lineno">   57</span>    std::vector&lt;uint64_t&gt; z = <a class="code hl_function" href="#ac044c4794349a8cff6256b99950d5773">Z_function</a>(pattern + <span class="charliteral">&#39;#&#39;</span> + text);</div>
+<div class="line"><span class="lineno">   58</span>    std::vector&lt;uint64_t&gt; matching_indexes;</div>
 <div class="line"><span class="lineno">   59</span> </div>
 <div class="line"><span class="lineno">   60</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; text_length; i++) {</div>
 <div class="line"><span class="lineno">   61</span>        <span class="keywordflow">if</span> (z[i + pattern_length + 1] == pattern_length) {</div>
-<div class="line"><span class="lineno">   62</span>            matching_indexes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(i);</div>
+<div class="line"><span class="lineno">   62</span>            matching_indexes.push_back(i);</div>
 <div class="line"><span class="lineno">   63</span>        }</div>
 <div class="line"><span class="lineno">   64</span>    }</div>
 <div class="line"><span class="lineno">   65</span>    <span class="keywordflow">return</span> matching_indexes;</div>
 <div class="line"><span class="lineno">   66</span>}</div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-<div class="ttc" id="az__function_8cpp_html_ac044c4794349a8cff6256b99950d5773"><div class="ttname"><a href="#ac044c4794349a8cff6256b99950d5773">Z_function</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; Z_function(const std::string &amp;pattern)</div><div class="ttdoc">for IO operations</div><div class="ttdef"><b>Definition</b> z_function.cpp:29</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d80/z__function_8cpp_ac186ca3ac3a69b5e52543bb13fe46db8_cgraph.svg" width="486" height="138"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="az__function_8cpp_html_ac044c4794349a8cff6256b99950d5773"><div class="ttname"><a href="#ac044c4794349a8cff6256b99950d5773">Z_function</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; Z_function(const std::string &amp;pattern)</div><div class="ttdoc">for IO operations</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d80/z__function_8cpp_source.html#l00029">z_function.cpp:29</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -215,17 +230,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d80/z__function_8cpp_source.html#l00094">94</a> of file <a class="el" href="../../d3/d80/z__function_8cpp_source.html">z_function.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   94</span>           {</div>
 <div class="line"><span class="lineno">   95</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   96</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   97</span>}</div>
-<div class="ttc" id="az__function_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> z_function.cpp:72</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="403"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="az__function_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d80/z__function_8cpp_source.html#l00072">z_function.cpp:72</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -253,31 +265,27 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d80/z__function_8cpp_source.html#l00072">72</a> of file <a class="el" href="../../d3/d80/z__function_8cpp_source.html">z_function.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   72</span>                   {</div>
 <div class="line"><span class="lineno">   73</span>    <span class="comment">// usual case</span></div>
-<div class="line"><span class="lineno">   74</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> text1 = <span class="stringliteral">&quot;alskfjaldsabc1abc1abcbksbcdnsdabcabc&quot;</span>;</div>
-<div class="line"><span class="lineno">   75</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> pattern1 = <span class="stringliteral">&quot;abc&quot;</span>;</div>
+<div class="line"><span class="lineno">   74</span>    std::string text1 = <span class="stringliteral">&quot;alskfjaldsabc1abc1abcbksbcdnsdabcabc&quot;</span>;</div>
+<div class="line"><span class="lineno">   75</span>    std::string pattern1 = <span class="stringliteral">&quot;abc&quot;</span>;</div>
 <div class="line"><span class="lineno">   76</span> </div>
 <div class="line"><span class="lineno">   77</span>    <span class="comment">// matching_indexes1 gets the indexes where pattern1 exists in text1</span></div>
-<div class="line"><span class="lineno">   78</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> matching_indexes1 = <a class="code hl_function" href="#ac186ca3ac3a69b5e52543bb13fe46db8">find_pat_in_text</a>(pattern1, text1);</div>
-<div class="line"><span class="lineno">   79</span>    assert((matching_indexes1 == <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a>{10, 14, 18, 30, 33}));</div>
+<div class="line"><span class="lineno">   78</span>    std::vector&lt;uint64_t&gt; matching_indexes1 = <a class="code hl_function" href="#ac186ca3ac3a69b5e52543bb13fe46db8">find_pat_in_text</a>(pattern1, text1);</div>
+<div class="line"><span class="lineno">   79</span>    assert((matching_indexes1 == std::vector&lt;uint64_t&gt;{10, 14, 18, 30, 33}));</div>
 <div class="line"><span class="lineno">   80</span> </div>
 <div class="line"><span class="lineno">   81</span>    <span class="comment">// corner case</span></div>
-<div class="line"><span class="lineno">   82</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> text2 = <span class="stringliteral">&quot;greengrass&quot;</span>;</div>
-<div class="line"><span class="lineno">   83</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> pattern2 = <span class="stringliteral">&quot;abc&quot;</span>;</div>
+<div class="line"><span class="lineno">   82</span>    std::string text2 = <span class="stringliteral">&quot;greengrass&quot;</span>;</div>
+<div class="line"><span class="lineno">   83</span>    std::string pattern2 = <span class="stringliteral">&quot;abc&quot;</span>;</div>
 <div class="line"><span class="lineno">   84</span> </div>
 <div class="line"><span class="lineno">   85</span>    <span class="comment">// matching_indexes2 gets the indexes where pattern2 exists in text2</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&lt;uint64_t&gt;</a> matching_indexes2 = <a class="code hl_function" href="#ac186ca3ac3a69b5e52543bb13fe46db8">find_pat_in_text</a>(pattern2, text2);</div>
-<div class="line"><span class="lineno">   87</span>    assert((matching_indexes2 == <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a>{}));</div>
+<div class="line"><span class="lineno">   86</span>    std::vector&lt;uint64_t&gt; matching_indexes2 = <a class="code hl_function" href="#ac186ca3ac3a69b5e52543bb13fe46db8">find_pat_in_text</a>(pattern2, text2);</div>
+<div class="line"><span class="lineno">   87</span>    assert((matching_indexes2 == std::vector&lt;uint64_t&gt;{}));</div>
 <div class="line"><span class="lineno">   88</span>}</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="az__function_8cpp_html_ac186ca3ac3a69b5e52543bb13fe46db8"><div class="ttname"><a href="#ac186ca3ac3a69b5e52543bb13fe46db8">find_pat_in_text</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; find_pat_in_text(const std::string &amp;pattern, const std::string &amp;text)</div><div class="ttdoc">Using Z_function to find a pattern in a text.</div><div class="ttdef"><b>Definition</b> z_function.cpp:54</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d80/z__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="578" height="138"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="az__function_8cpp_html_ac186ca3ac3a69b5e52543bb13fe46db8"><div class="ttname"><a href="#ac186ca3ac3a69b5e52543bb13fe46db8">find_pat_in_text</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; find_pat_in_text(const std::string &amp;pattern, const std::string &amp;text)</div><div class="ttdoc">Using Z_function to find a pattern in a text.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d80/z__function_8cpp_source.html#l00054">z_function.cpp:54</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac044c4794349a8cff6256b99950d5773" name="ac044c4794349a8cff6256b99950d5773"></a>
@@ -287,16 +295,16 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; Z_function </td>
+          <td class="memname">std::vector&lt; uint64_t &gt; Z_function </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>pattern</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>pattern</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
 </div><div class="memdoc">
 
 <p>for IO operations </p>
-<p>for string for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>for string for assert for std::vector</p>
 <p>Generate the Z-function for the inputted string. </p><dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramdir">[in]</td><td class="paramname">pattern</td><td>text on which to apply the Z-function </td></tr>
@@ -304,13 +312,15 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the Z-function output as a vector array </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d80/z__function_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../d3/d80/z__function_8cpp_source.html">z_function.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   29</span>                                                         {</div>
-<div class="line"><span class="lineno">   30</span>    uint64_t pattern_length = pattern.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
-<div class="line"><span class="lineno">   31</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> z(pattern_length, 0);</div>
+<div class="line"><span class="lineno">   30</span>    uint64_t pattern_length = pattern.size();</div>
+<div class="line"><span class="lineno">   31</span>    std::vector&lt;uint64_t&gt; z(pattern_length, 0);</div>
 <div class="line"><span class="lineno">   32</span> </div>
 <div class="line"><span class="lineno">   33</span>    <span class="keywordflow">for</span> (uint64_t i = 1, l = 0, r = 0; i &lt; pattern_length; i++) {</div>
 <div class="line"><span class="lineno">   34</span>        <span class="keywordflow">if</span> (i &lt;= r) {</div>
-<div class="line"><span class="lineno">   35</span>            z[i] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(r - i + 1, z[i - l]);</div>
+<div class="line"><span class="lineno">   35</span>            z[i] = std::min(r - i + 1, z[i - l]);</div>
 <div class="line"><span class="lineno">   36</span>        }</div>
 <div class="line"><span class="lineno">   37</span>        <span class="keywordflow">while</span> (i + z[i] &lt; pattern_length &amp;&amp;</div>
 <div class="line"><span class="lineno">   38</span>               pattern[z[i]] == pattern[i + z[i]]) {</div>
@@ -322,13 +332,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   44</span>    }</div>
 <div class="line"><span class="lineno">   45</span>    <span class="keywordflow">return</span> z;</div>
 <div class="line"><span class="lineno">   46</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><!-- 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="../../d3/d80/z__function_8cpp_ac044c4794349a8cff6256b99950d5773_cgraph.svg" width="252" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/d80/z__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d3/d80/z__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 84dfd0151..000000000
--- a/d3/d80/z__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,14 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,56,49,82"/>
-<area shape="rect" id="Node000002" href="$d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8" title="Using Z_function to find a pattern in a text." alt="" coords="97,56,210,82"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,66,81,66,81,72,49,72"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="258,5,412,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="201,53,271,33,273,38,203,58"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="460,57,572,83"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="211,66,445,67,445,73,211,72"/>
-<area shape="rect" id="Node000005" href="$d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773" title="for IO operations" alt="" coords="294,107,376,132"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="203,80,279,101,278,106,201,85"/>
-<area shape="poly" id="edge6_Node000005_Node000004" title=" " alt="" coords="376,106,451,85,452,90,378,111"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="482,107,550,132"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="377,117,466,117,466,122,377,122"/>
-</map>
diff --git a/d3/d80/z__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d3/d80/z__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index e546b1192..000000000
--- a/d3/d80/z__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1d82d2f0a7c5bbfa059fdb058e9113e2
\ No newline at end of file
diff --git a/d3/d80/z__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d3/d80/z__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index f84bc6fdb..000000000
--- a/d3/d80/z__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,146 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="433pt" height="103pt"
- viewBox="0.00 0.00 432.75 103.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 99.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-57.25 0,-57.25 0,-38 32.5,-38 32.5,-57.25"/>
-<text text-anchor="middle" x="16.25" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8" target="_top" xlink:title="Using Z_function to find a pattern in a text.">
-<polygon fill="white" stroke="#666666" points="153.5,-57.25 68.5,-57.25 68.5,-38 153.5,-38 153.5,-57.25"/>
-<text text-anchor="middle" x="111" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">find_pat_in_text</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.98,-47.62C39.74,-47.62 48.07,-47.62 56.72,-47.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.67,-51.13 66.67,-47.63 56.67,-44.13 56.67,-51.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-95.25 189.5,-95.25 189.5,-76 305.25,-76 305.25,-95.25"/>
-<text text-anchor="middle" x="247.38" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.66,-57.71C163.73,-62.25 182.92,-67.68 200.08,-72.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.99,-75.86 209.56,-75.21 200.89,-69.13 198.99,-75.86"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424.75,-56.25 341.25,-56.25 341.25,-37 424.75,-37 424.75,-56.25"/>
-<text text-anchor="middle" x="383" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.89,-47.47C201.16,-47.29 278.13,-47.01 329.41,-46.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.4,-50.32 339.38,-46.78 329.37,-43.32 329.4,-50.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="278.25,-19.25 216.5,-19.25 216.5,0 278.25,0 278.25,-19.25"/>
-<text text-anchor="middle" x="247.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Z_function</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.66,-37.54C165.3,-32.55 186.69,-26.5 205.05,-21.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.9,-24.71 214.57,-18.62 203.99,-17.97 205.9,-24.71"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge6_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.7,-18.02C295.23,-22.6 316.05,-28.36 334.67,-33.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.59,-36.85 344.16,-36.15 335.46,-30.11 333.59,-36.85"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408.62,-19.25 357.38,-19.25 357.38,0 408.62,0 408.62,-19.25"/>
-<text text-anchor="middle" x="383" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.7,-9.62C298.61,-9.62 324.77,-9.62 345.79,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.65,-13.13 355.65,-9.63 345.65,-6.13 345.65,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d80/z__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d3/d80/z__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index b25400d03..000000000
--- a/d3/d80/z__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="433pt" height="103pt"
- viewBox="0.00 0.00 432.75 103.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 99.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-57.25 0,-57.25 0,-38 32.5,-38 32.5,-57.25"/>
-<text text-anchor="middle" x="16.25" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8" target="_top" xlink:title="Using Z_function to find a pattern in a text.">
-<polygon fill="white" stroke="#666666" points="153.5,-57.25 68.5,-57.25 68.5,-38 153.5,-38 153.5,-57.25"/>
-<text text-anchor="middle" x="111" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">find_pat_in_text</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.98,-47.62C39.74,-47.62 48.07,-47.62 56.72,-47.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.67,-51.13 66.67,-47.63 56.67,-44.13 56.67,-51.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-95.25 189.5,-95.25 189.5,-76 305.25,-76 305.25,-95.25"/>
-<text text-anchor="middle" x="247.38" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.66,-57.71C163.73,-62.25 182.92,-67.68 200.08,-72.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.99,-75.86 209.56,-75.21 200.89,-69.13 198.99,-75.86"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424.75,-56.25 341.25,-56.25 341.25,-37 424.75,-37 424.75,-56.25"/>
-<text text-anchor="middle" x="383" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.89,-47.47C201.16,-47.29 278.13,-47.01 329.41,-46.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.4,-50.32 339.38,-46.78 329.37,-43.32 329.4,-50.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="278.25,-19.25 216.5,-19.25 216.5,0 278.25,0 278.25,-19.25"/>
-<text text-anchor="middle" x="247.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Z_function</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.66,-37.54C165.3,-32.55 186.69,-26.5 205.05,-21.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.9,-24.71 214.57,-18.62 203.99,-17.97 205.9,-24.71"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge6_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.7,-18.02C295.23,-22.6 316.05,-28.36 334.67,-33.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.59,-36.85 344.16,-36.15 335.46,-30.11 333.59,-36.85"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408.62,-19.25 357.38,-19.25 357.38,0 408.62,0 408.62,-19.25"/>
-<text text-anchor="middle" x="383" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.7,-9.62C298.61,-9.62 324.77,-9.62 345.79,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.65,-13.13 355.65,-9.63 345.65,-6.13 345.65,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d80/z__function_8cpp_ac044c4794349a8cff6256b99950d5773_cgraph.map b/d3/d80/z__function_8cpp_ac044c4794349a8cff6256b99950d5773_cgraph.map
deleted file mode 100644
index 12ad371b7..000000000
--- a/d3/d80/z__function_8cpp_ac044c4794349a8cff6256b99950d5773_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="Z_function" name="Z_function">
-<area shape="rect" id="Node000001" title="for IO operations" alt="" coords="5,31,88,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="157,5,226,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="88,34,142,24,142,29,89,39"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="136,55,247,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="89,48,121,53,120,58,88,53"/>
-</map>
diff --git a/d3/d80/z__function_8cpp_ac044c4794349a8cff6256b99950d5773_cgraph.md5 b/d3/d80/z__function_8cpp_ac044c4794349a8cff6256b99950d5773_cgraph.md5
deleted file mode 100644
index c8ae08099..000000000
--- a/d3/d80/z__function_8cpp_ac044c4794349a8cff6256b99950d5773_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-84f21c72905372653bf30f8388f5108f
\ No newline at end of file
diff --git a/d3/d80/z__function_8cpp_ac044c4794349a8cff6256b99950d5773_cgraph.svg b/d3/d80/z__function_8cpp_ac044c4794349a8cff6256b99950d5773_cgraph.svg
deleted file mode 100644
index 25620580a..000000000
--- a/d3/d80/z__function_8cpp_ac044c4794349a8cff6256b99950d5773_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Z_function Pages: 1 -->
-<svg width="189pt" height="64pt"
- viewBox="0.00 0.00 189.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>Z_function</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="for IO operations">
-<polygon fill="#999999" stroke="#666666" points="61.75,-37.25 0,-37.25 0,-18 61.75,-18 61.75,-37.25"/>
-<text text-anchor="middle" x="30.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">Z_function</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.12,-56.25 113.88,-56.25 113.88,-37 165.12,-37 165.12,-56.25"/>
-<text text-anchor="middle" x="139.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.14,-33.02C74.72,-35.26 89.4,-37.88 102.52,-40.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.6,-43.61 112.06,-41.91 102.83,-36.71 101.6,-43.61"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="181.25,-19.25 97.75,-19.25 97.75,0 181.25,0 181.25,-19.25"/>
-<text text-anchor="middle" x="139.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.14,-22.52C69.68,-21.24 77.97,-19.84 86.23,-18.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.63,-21.93 95.91,-16.81 85.47,-15.03 86.63,-21.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d80/z__function_8cpp_ac044c4794349a8cff6256b99950d5773_cgraph_org.svg b/d3/d80/z__function_8cpp_ac044c4794349a8cff6256b99950d5773_cgraph_org.svg
deleted file mode 100644
index f54470a0f..000000000
--- a/d3/d80/z__function_8cpp_ac044c4794349a8cff6256b99950d5773_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Z_function Pages: 1 -->
-<svg width="189pt" height="64pt"
- viewBox="0.00 0.00 189.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>Z_function</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="for IO operations">
-<polygon fill="#999999" stroke="#666666" points="61.75,-37.25 0,-37.25 0,-18 61.75,-18 61.75,-37.25"/>
-<text text-anchor="middle" x="30.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">Z_function</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.12,-56.25 113.88,-56.25 113.88,-37 165.12,-37 165.12,-56.25"/>
-<text text-anchor="middle" x="139.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.14,-33.02C74.72,-35.26 89.4,-37.88 102.52,-40.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.6,-43.61 112.06,-41.91 102.83,-36.71 101.6,-43.61"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="181.25,-19.25 97.75,-19.25 97.75,0 181.25,0 181.25,-19.25"/>
-<text text-anchor="middle" x="139.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.14,-22.52C69.68,-21.24 77.97,-19.84 86.23,-18.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.63,-21.93 95.91,-16.81 85.47,-15.03 86.63,-21.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d80/z__function_8cpp_ac186ca3ac3a69b5e52543bb13fe46db8_cgraph.map b/d3/d80/z__function_8cpp_ac186ca3ac3a69b5e52543bb13fe46db8_cgraph.map
deleted file mode 100644
index 75f4d6166..000000000
--- a/d3/d80/z__function_8cpp_ac186ca3ac3a69b5e52543bb13fe46db8_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="find_pat_in_text" name="find_pat_in_text">
-<area shape="rect" id="Node000001" title="Using Z_function to find a pattern in a text." alt="" coords="5,56,119,82"/>
-<area shape="rect" id="Node000002" 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="167,5,321,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="110,53,180,33,182,38,112,58"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="369,57,480,83"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="119,66,353,67,353,73,119,72"/>
-<area shape="rect" id="Node000004" href="$d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773" title="for IO operations" alt="" coords="203,107,285,132"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="112,80,188,101,187,106,110,85"/>
-<area shape="poly" id="edge5_Node000004_Node000003" title=" " alt="" coords="285,106,360,85,361,90,286,111"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="390,107,459,132"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="286,117,375,117,375,122,286,122"/>
-</map>
diff --git a/d3/d80/z__function_8cpp_ac186ca3ac3a69b5e52543bb13fe46db8_cgraph.md5 b/d3/d80/z__function_8cpp_ac186ca3ac3a69b5e52543bb13fe46db8_cgraph.md5
deleted file mode 100644
index 90a7054fe..000000000
--- a/d3/d80/z__function_8cpp_ac186ca3ac3a69b5e52543bb13fe46db8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bb675e8412f6eb64f98efd7ebca07418
\ No newline at end of file
diff --git a/d3/d80/z__function_8cpp_ac186ca3ac3a69b5e52543bb13fe46db8_cgraph.svg b/d3/d80/z__function_8cpp_ac186ca3ac3a69b5e52543bb13fe46db8_cgraph.svg
deleted file mode 100644
index 5e0be60cc..000000000
--- a/d3/d80/z__function_8cpp_ac186ca3ac3a69b5e52543bb13fe46db8_cgraph.svg
+++ /dev/null
@@ -1,128 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: find_pat_in_text Pages: 1 -->
-<svg width="364pt" height="103pt"
- viewBox="0.00 0.00 364.25 103.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 99.25)">
-<title>find_pat_in_text</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Using Z_function to find a pattern in a text.">
-<polygon fill="#999999" stroke="#666666" points="85,-57.25 0,-57.25 0,-38 85,-38 85,-57.25"/>
-<text text-anchor="middle" x="42.5" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">find_pat_in_text</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-95.25 121,-95.25 121,-76 236.75,-76 236.75,-95.25"/>
-<text text-anchor="middle" x="178.88" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.16,-57.71C95.23,-62.25 114.42,-67.68 131.58,-72.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.49,-75.86 141.06,-75.21 132.39,-69.13 130.49,-75.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="356.25,-56.25 272.75,-56.25 272.75,-37 356.25,-37 356.25,-56.25"/>
-<text text-anchor="middle" x="314.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.39,-47.47C132.66,-47.29 209.63,-47.01 260.91,-46.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.9,-50.32 270.88,-46.78 260.87,-43.32 260.9,-50.32"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="209.75,-19.25 148,-19.25 148,0 209.75,0 209.75,-19.25"/>
-<text text-anchor="middle" x="178.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Z_function</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.16,-37.54C96.8,-32.55 118.19,-26.5 136.55,-21.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.4,-24.71 146.07,-18.62 135.49,-17.97 137.4,-24.71"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M210.2,-18.02C226.73,-22.6 247.55,-28.36 266.17,-33.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.09,-36.85 275.66,-36.15 266.96,-30.11 265.09,-36.85"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="340.12,-19.25 288.88,-19.25 288.88,0 340.12,0 340.12,-19.25"/>
-<text text-anchor="middle" x="314.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M210.2,-9.62C230.11,-9.62 256.27,-9.62 277.29,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.15,-13.13 287.15,-9.63 277.15,-6.13 277.15,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d80/z__function_8cpp_ac186ca3ac3a69b5e52543bb13fe46db8_cgraph_org.svg b/d3/d80/z__function_8cpp_ac186ca3ac3a69b5e52543bb13fe46db8_cgraph_org.svg
deleted file mode 100644
index fef97a9cd..000000000
--- a/d3/d80/z__function_8cpp_ac186ca3ac3a69b5e52543bb13fe46db8_cgraph_org.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: find_pat_in_text Pages: 1 -->
-<svg width="364pt" height="103pt"
- viewBox="0.00 0.00 364.25 103.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 99.25)">
-<title>find_pat_in_text</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Using Z_function to find a pattern in a text.">
-<polygon fill="#999999" stroke="#666666" points="85,-57.25 0,-57.25 0,-38 85,-38 85,-57.25"/>
-<text text-anchor="middle" x="42.5" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">find_pat_in_text</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-95.25 121,-95.25 121,-76 236.75,-76 236.75,-95.25"/>
-<text text-anchor="middle" x="178.88" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.16,-57.71C95.23,-62.25 114.42,-67.68 131.58,-72.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.49,-75.86 141.06,-75.21 132.39,-69.13 130.49,-75.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="356.25,-56.25 272.75,-56.25 272.75,-37 356.25,-37 356.25,-56.25"/>
-<text text-anchor="middle" x="314.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.39,-47.47C132.66,-47.29 209.63,-47.01 260.91,-46.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.9,-50.32 270.88,-46.78 260.87,-43.32 260.9,-50.32"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="209.75,-19.25 148,-19.25 148,0 209.75,0 209.75,-19.25"/>
-<text text-anchor="middle" x="178.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Z_function</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.16,-37.54C96.8,-32.55 118.19,-26.5 136.55,-21.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.4,-24.71 146.07,-18.62 135.49,-17.97 137.4,-24.71"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M210.2,-18.02C226.73,-22.6 247.55,-28.36 266.17,-33.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.09,-36.85 275.66,-36.15 266.96,-30.11 265.09,-36.85"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="340.12,-19.25 288.88,-19.25 288.88,0 340.12,0 340.12,-19.25"/>
-<text text-anchor="middle" x="314.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M210.2,-9.62C230.11,-9.62 256.27,-9.62 277.29,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.15,-13.13 287.15,-9.63 277.15,-6.13 277.15,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index b87e26ae0..000000000
--- a/d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,56,55,82"/>
-<area shape="rect" id="Node000002" href="$d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,56,146,82"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,66,87,66,87,72,55,72"/>
-<area shape="rect" id="Node000003" href="$d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8" title="Using Z_function to find a pattern in a text." alt="" coords="194,56,307,82"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="147,66,178,66,178,72,147,72"/>
-<area shape="rect" id="Node000004" 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="355,5,510,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="299,53,369,33,370,38,300,58"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="558,57,669,83"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="308,66,542,67,542,73,308,72"/>
-<area shape="rect" id="Node000006" href="$d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773" title="for IO operations" alt="" coords="391,107,474,132"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="300,80,377,101,375,106,299,85"/>
-<area shape="poly" id="edge7_Node000006_Node000005" title=" " alt="" coords="474,106,548,85,550,90,475,111"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="579,107,648,132"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="474,117,564,117,564,122,474,122"/>
-</map>
diff --git a/d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 4007dc276..000000000
--- a/d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1c03ff7c211a2e754c1e194b6ba90e40
\ No newline at end of file
diff --git a/d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 3e79f5686..000000000
--- a/d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,221 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 103 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 506;
-var viewHeight = 103;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-57.25 0,-57.25 0,-38 37,-38 37,-57.25"/>
-<text text-anchor="middle" x="18.5" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-57.25 73,-57.25 73,-38 105.5,-38 105.5,-57.25"/>
-<text text-anchor="middle" x="89.25" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-47.62C44.58,-47.62 53.31,-47.62 61.45,-47.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-51.13 71.2,-47.63 61.2,-44.13 61.2,-51.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8" target="_top" xlink:title="Using Z_function to find a pattern in a text.">
-<polygon fill="white" stroke="#666666" points="226.5,-57.25 141.5,-57.25 141.5,-38 226.5,-38 226.5,-57.25"/>
-<text text-anchor="middle" x="184" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">find_pat_in_text</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.98,-47.62C112.74,-47.62 121.07,-47.62 129.72,-47.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.67,-51.13 139.67,-47.63 129.67,-44.13 129.67,-51.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="378.25,-95.25 262.5,-95.25 262.5,-76 378.25,-76 378.25,-95.25"/>
-<text text-anchor="middle" x="320.38" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.66,-57.71C236.73,-62.25 255.92,-67.68 273.08,-72.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="271.99,-75.86 282.56,-75.21 273.89,-69.13 271.99,-75.86"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="497.75,-56.25 414.25,-56.25 414.25,-37 497.75,-37 497.75,-56.25"/>
-<text text-anchor="middle" x="456" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M226.89,-47.47C274.16,-47.29 351.13,-47.01 402.41,-46.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="402.4,-50.32 412.38,-46.78 402.37,-43.32 402.4,-50.32"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="351.25,-19.25 289.5,-19.25 289.5,0 351.25,0 351.25,-19.25"/>
-<text text-anchor="middle" x="320.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Z_function</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.66,-37.54C238.3,-32.55 259.69,-26.5 278.05,-21.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.9,-24.71 287.57,-18.62 276.99,-17.97 278.9,-24.71"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge7_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge7_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M351.7,-18.02C368.23,-22.6 389.05,-28.36 407.67,-33.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="406.59,-36.85 417.16,-36.15 408.46,-30.11 406.59,-36.85"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="481.62,-19.25 430.38,-19.25 430.38,0 481.62,0 481.62,-19.25"/>
-<text text-anchor="middle" x="456" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M351.7,-9.62C371.61,-9.62 397.77,-9.62 418.79,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="418.65,-13.13 428.65,-9.63 418.65,-6.13 418.65,-13.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index c7117d70d..000000000
--- a/d3/d80/z__function_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,138 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="506pt" height="103pt"
- viewBox="0.00 0.00 505.75 103.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 99.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-57.25 0,-57.25 0,-38 37,-38 37,-57.25"/>
-<text text-anchor="middle" x="18.5" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-57.25 73,-57.25 73,-38 105.5,-38 105.5,-57.25"/>
-<text text-anchor="middle" x="89.25" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-47.62C44.58,-47.62 53.31,-47.62 61.45,-47.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-51.13 71.2,-47.63 61.2,-44.13 61.2,-51.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8" target="_top" xlink:title="Using Z_function to find a pattern in a text.">
-<polygon fill="white" stroke="#666666" points="226.5,-57.25 141.5,-57.25 141.5,-38 226.5,-38 226.5,-57.25"/>
-<text text-anchor="middle" x="184" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">find_pat_in_text</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.98,-47.62C112.74,-47.62 121.07,-47.62 129.72,-47.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.67,-51.13 139.67,-47.63 129.67,-44.13 129.67,-51.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="378.25,-95.25 262.5,-95.25 262.5,-76 378.25,-76 378.25,-95.25"/>
-<text text-anchor="middle" x="320.38" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.66,-57.71C236.73,-62.25 255.92,-67.68 273.08,-72.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="271.99,-75.86 282.56,-75.21 273.89,-69.13 271.99,-75.86"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="497.75,-56.25 414.25,-56.25 414.25,-37 497.75,-37 497.75,-56.25"/>
-<text text-anchor="middle" x="456" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M226.89,-47.47C274.16,-47.29 351.13,-47.01 402.41,-46.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="402.4,-50.32 412.38,-46.78 402.37,-43.32 402.4,-50.32"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="351.25,-19.25 289.5,-19.25 289.5,0 351.25,0 351.25,-19.25"/>
-<text text-anchor="middle" x="320.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Z_function</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.66,-37.54C238.3,-32.55 259.69,-26.5 278.05,-21.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.9,-24.71 287.57,-18.62 276.99,-17.97 278.9,-24.71"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge7_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge7_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M351.7,-18.02C368.23,-22.6 389.05,-28.36 407.67,-33.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="406.59,-36.85 417.16,-36.15 408.46,-30.11 406.59,-36.85"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="481.62,-19.25 430.38,-19.25 430.38,0 481.62,0 481.62,-19.25"/>
-<text text-anchor="middle" x="456" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M351.7,-9.62C371.61,-9.62 397.77,-9.62 418.79,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="418.65,-13.13 428.65,-9.63 418.65,-6.13 418.65,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d80/z__function_8cpp_source.html b/d3/d80/z__function_8cpp_source.html
new file mode 100644
index 000000000..48071e7d8
--- /dev/null
+++ b/d3/d80/z__function_8cpp_source.html
@@ -0,0 +1,215 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: strings/z_function.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/d80/z__function_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">z_function.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/d80/z__function_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#ifdef _MSC_VER</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;string&gt;</span>  </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;cstring&gt;</span>  </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cassert&gt;</span>  </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;vector&gt;</span>   </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="foldopen" id="foldopen00029" data-start="{" data-end="}">
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773">   29</a></span>std::vector&lt;uint64_t&gt; <a class="code hl_function" href="../../d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773">Z_function</a>(<span class="keyword">const</span> std::string &amp;pattern) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    uint64_t pattern_length = pattern.size();</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    std::vector&lt;uint64_t&gt; z(pattern_length, 0);</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordflow">for</span> (uint64_t i = 1, l = 0, r = 0; i &lt; pattern_length; i++) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        <span class="keywordflow">if</span> (i &lt;= r) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>            z[i] = std::min(r - i + 1, z[i - l]);</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        }</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        <span class="keywordflow">while</span> (i + z[i] &lt; pattern_length &amp;&amp;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>               pattern[z[i]] == pattern[i + z[i]]) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            z[i]++;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        }</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        <span class="keywordflow">if</span> (i + z[i] - 1 &gt; r) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>            r = i + z[i] - 1;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    }</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordflow">return</span> z;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>}</div>
+</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="foldopen" id="foldopen00054" data-start="{" data-end="}">
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="../../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8">   54</a></span>std::vector&lt;uint64_t&gt; <a class="code hl_function" href="../../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8">find_pat_in_text</a>(<span class="keyword">const</span> std::string &amp;pattern,</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>                                       <span class="keyword">const</span> std::string &amp;text) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    uint64_t text_length = text.size(), pattern_length = pattern.size();</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    std::vector&lt;uint64_t&gt; z = <a class="code hl_function" href="../../d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773">Z_function</a>(pattern + <span class="charliteral">&#39;#&#39;</span> + text);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    std::vector&lt;uint64_t&gt; matching_indexes;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; text_length; i++) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="keywordflow">if</span> (z[i + pattern_length + 1] == pattern_length) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            matching_indexes.push_back(i);</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordflow">return</span> matching_indexes;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>}</div>
+</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="foldopen" id="foldopen00072" data-start="{" data-end="}">
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"><a class="line" href="../../d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   72</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="comment">// usual case</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    std::string text1 = <span class="stringliteral">&quot;alskfjaldsabc1abc1abcbksbcdnsdabcabc&quot;</span>;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    std::string pattern1 = <span class="stringliteral">&quot;abc&quot;</span>;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="comment">// matching_indexes1 gets the indexes where pattern1 exists in text1</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    std::vector&lt;uint64_t&gt; matching_indexes1 = <a class="code hl_function" href="../../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8">find_pat_in_text</a>(pattern1, text1);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    assert((matching_indexes1 == std::vector&lt;uint64_t&gt;{10, 14, 18, 30, 33}));</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="comment">// corner case</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    std::string text2 = <span class="stringliteral">&quot;greengrass&quot;</span>;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    std::string pattern2 = <span class="stringliteral">&quot;abc&quot;</span>;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="comment">// matching_indexes2 gets the indexes where pattern2 exists in text2</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    std::vector&lt;uint64_t&gt; matching_indexes2 = <a class="code hl_function" href="../../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8">find_pat_in_text</a>(pattern2, text2);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    assert((matching_indexes2 == std::vector&lt;uint64_t&gt;{}));</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>}</div>
+</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="foldopen" id="foldopen00094" data-start="{" data-end="}">
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"><a class="line" href="../../d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   94</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <a class="code hl_function" href="../../d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>}</div>
+</div>
+<div class="ttc" id="az__function_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d3/d80/z__function_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> <a href="#l00072">z_function.cpp:72</a></div></div>
+<div class="ttc" id="az__function_8cpp_html_ac044c4794349a8cff6256b99950d5773"><div class="ttname"><a href="../../d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773">Z_function</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; Z_function(const std::string &amp;pattern)</div><div class="ttdoc">for IO operations</div><div class="ttdef"><b>Definition</b> <a href="#l00029">z_function.cpp:29</a></div></div>
+<div class="ttc" id="az__function_8cpp_html_ac186ca3ac3a69b5e52543bb13fe46db8"><div class="ttname"><a href="../../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8">find_pat_in_text</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; find_pat_in_text(const std::string &amp;pattern, const std::string &amp;text)</div><div class="ttdoc">Using Z_function to find a pattern in a text.</div><div class="ttdef"><b>Definition</b> <a href="#l00054">z_function.cpp:54</a></div></div>
+<div class="ttc" id="az__function_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00094">z_function.cpp:94</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_73a3cc5065b223eb41b02873c0e19f0e.html">strings</a></li><li class="navelem"><a class="el" href="../../d3/d80/z__function_8cpp.html">z_function.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/d84/word__break_8cpp.html b/d3/d84/word__break_8cpp.html
index 07f9925bb..247fd86c2 100644
--- a/d3/d84/word__break_8cpp.html
+++ b/d3/d84/word__break_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/word_break.cpp File Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming/word_break.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for word_break.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d73/word__break_8cpp__incl.svg" width="540" height="126"><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">
+</div>
+<p><a href="../../d3/d84/word__break_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
@@ -136,13 +155,13 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a1cc9dd6e6190d10a010fdcdfe7a21a81" id="r_a1cc9dd6e6190d10a010fdcdfe7a21a81"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1cc9dd6e6190d10a010fdcdfe7a21a81">dynamic_programming::word_break::exists</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_set.html">std::unordered_set</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &amp;strSet)</td></tr>
+<tr class="memitem:a1cc9dd6e6190d10a010fdcdfe7a21a81" id="r_a1cc9dd6e6190d10a010fdcdfe7a21a81"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1cc9dd6e6190d10a010fdcdfe7a21a81">dynamic_programming::word_break::exists</a> (const std::string &amp;str, const std::unordered_set&lt; std::string &gt; &amp;strSet)</td></tr>
 <tr class="memdesc:a1cc9dd6e6190d10a010fdcdfe7a21a81"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that checks if the string passed in param is present in the the unordered_set passed.  <br /></td></tr>
 <tr class="separator:a1cc9dd6e6190d10a010fdcdfe7a21a81"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a272b0f5cdb4e41fd6dee4538b808c06a" id="r_a272b0f5cdb4e41fd6dee4538b808c06a"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a272b0f5cdb4e41fd6dee4538b808c06a">dynamic_programming::word_break::check</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;s, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_set.html">std::unordered_set</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &amp;strSet, int pos, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; *dp)</td></tr>
+<tr class="memitem:a272b0f5cdb4e41fd6dee4538b808c06a" id="r_a272b0f5cdb4e41fd6dee4538b808c06a"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a272b0f5cdb4e41fd6dee4538b808c06a">dynamic_programming::word_break::check</a> (const std::string &amp;s, const std::unordered_set&lt; std::string &gt; &amp;strSet, int pos, std::vector&lt; int &gt; *dp)</td></tr>
 <tr class="memdesc:a272b0f5cdb4e41fd6dee4538b808c06a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that checks if the string passed in param can be segmented from position 'pos', and then correctly go on to segment the rest of the string correctly as well to reach a solution.  <br /></td></tr>
 <tr class="separator:a272b0f5cdb4e41fd6dee4538b808c06a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:afe4dcd6fd5282e535685361cba645d7c" id="r_afe4dcd6fd5282e535685361cba645d7c"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afe4dcd6fd5282e535685361cba645d7c">dynamic_programming::word_break::wordBreak</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;s, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &amp;wordDict)</td></tr>
+<tr class="memitem:afe4dcd6fd5282e535685361cba645d7c" id="r_afe4dcd6fd5282e535685361cba645d7c"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afe4dcd6fd5282e535685361cba645d7c">dynamic_programming::word_break::wordBreak</a> (const std::string &amp;s, const std::vector&lt; std::string &gt; &amp;wordDict)</td></tr>
 <tr class="memdesc:afe4dcd6fd5282e535685361cba645d7c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that checks if the string passed in param can be segmented into the strings present in the vector. In others words, it checks if any permutation of strings in the vector can be concatenated to form the final string.  <br /></td></tr>
 <tr class="separator:afe4dcd6fd5282e535685361cba645d7c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -161,6 +180,8 @@ Functions</h2></td></tr>
 pen apple". Note that you are allowed to reuse a dictionary word.</p>
 <p>Example 3: Input: s = "catsandog", wordDict = ["cats", "dog", "sand", "and", "cat"] Output: false</p>
 <dl class="section author"><dt>Author</dt><dd>[Akshay Anand] (<a href="https://github.com/axayjha">https://github.com/axayjha</a>) </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/d84/word__break_8cpp_source.html">word_break.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a272b0f5cdb4e41fd6dee4538b808c06a" name="a272b0f5cdb4e41fd6dee4538b808c06a"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a272b0f5cdb4e41fd6dee4538b808c06a">&#9670;&#160;</a></span>check()</h2>
@@ -171,12 +192,12 @@ pen apple". Note that you are allowed to reuse a dictionary word.</p>
         <tr>
           <td class="memname">bool dynamic_programming::word_break::check </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_set.html">std::unordered_set</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>strSet</em></span>, </td>
+          <td class="paramtype">const std::unordered_set&lt; std::string &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>strSet</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -186,7 +207,7 @@ pen apple". Note that you are allowed to reuse a dictionary word.</p>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; *</td>          <td class="paramname"><span class="paramname"><em>dp</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; int &gt; *</td>          <td class="paramname"><span class="paramname"><em>dp</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -204,8 +225,10 @@ pen apple". Note that you are allowed to reuse a dictionary word.</p>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if a valid solution/segmentation is possible by segmenting at index pos </dd>
 <dd>
 <code>false</code> otherwise </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d84/word__break_8cpp_source.html#l00080">80</a> of file <a class="el" href="../../d3/d84/word__break_8cpp_source.html">word_break.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   81</span>                                        {</div>
-<div class="line"><span class="lineno">   82</span>    <span class="keywordflow">if</span> (pos == s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>()) {</div>
+<div class="line"><span class="lineno">   82</span>    <span class="keywordflow">if</span> (pos == s.length()) {</div>
 <div class="line"><span class="lineno">   83</span>        <span class="comment">// if we have reached till the end of the string, means we have</span></div>
 <div class="line"><span class="lineno">   84</span>        <span class="comment">// segmented throughout correctly hence we have a solution, thus</span></div>
 <div class="line"><span class="lineno">   85</span>        <span class="comment">// returning true</span></div>
@@ -219,19 +242,19 @@ pen apple". Note that you are allowed to reuse a dictionary word.</p>
 <div class="line"><span class="lineno">   93</span>        <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>-&gt;at(pos) == 1;</div>
 <div class="line"><span class="lineno">   94</span>    }</div>
 <div class="line"><span class="lineno">   95</span> </div>
-<div class="line"><span class="lineno">   96</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> wordTillNow =</div>
+<div class="line"><span class="lineno">   96</span>    std::string wordTillNow =</div>
 <div class="line"><span class="lineno">   97</span>        <span class="stringliteral">&quot;&quot;</span>;  <span class="comment">// string to save the prefixes of word till different positons</span></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 = pos; i &lt; s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>(); i++) {</div>
+<div class="line"><span class="lineno">   99</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = pos; i &lt; s.length(); i++) {</div>
 <div class="line"><span class="lineno">  100</span>        <span class="comment">// Loop starting from pos to end, to check valid set of</span></div>
 <div class="line"><span class="lineno">  101</span>        <span class="comment">// segmentations if any</span></div>
 <div class="line"><span class="lineno">  102</span>        wordTillNow +=</div>
-<div class="line"><span class="lineno">  103</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>(1, s[i]);  <span class="comment">// storing the prefix till the position i</span></div>
+<div class="line"><span class="lineno">  103</span>            std::string(1, s[i]);  <span class="comment">// storing the prefix till the position i</span></div>
 <div class="line"><span class="lineno">  104</span> </div>
 <div class="line"><span class="lineno">  105</span>        <span class="comment">// if the prefix till current position is present in the dictionary</span></div>
 <div class="line"><span class="lineno">  106</span>        <span class="comment">// and the remaining substring can also be segmented legally, then</span></div>
 <div class="line"><span class="lineno">  107</span>        <span class="comment">// set solution at position pos in the memo, and return true</span></div>
-<div class="line"><span class="lineno">  108</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a>(wordTillNow, strSet) &amp;&amp; <a class="code hl_function" href="#a272b0f5cdb4e41fd6dee4538b808c06a">check</a>(s, strSet, i + 1, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>)) {</div>
+<div class="line"><span class="lineno">  108</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a>(wordTillNow, strSet) &amp;&amp; check(s, strSet, i + 1, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>)) {</div>
 <div class="line"><span class="lineno">  109</span>            <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>-&gt;at(pos) = 1;</div>
 <div class="line"><span class="lineno">  110</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  111</span>        }</div>
@@ -241,17 +264,9 @@ pen apple". Note that you are allowed to reuse a dictionary word.</p>
 <div class="line"><span class="lineno">  115</span>    <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>-&gt;at(pos) = 0;  <span class="comment">// so set solution at pos as false</span></div>
 <div class="line"><span class="lineno">  116</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;     <span class="comment">// and return no solution at position pos</span></div>
 <div class="line"><span class="lineno">  117</span>}</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="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/string/basic_string/size.html">std::string::length</a></div><div class="ttdeci">T length(T... args)</div></div>
-<div class="ttc" id="aword__break_8cpp_html_a1cc9dd6e6190d10a010fdcdfe7a21a81"><div class="ttname"><a href="#a1cc9dd6e6190d10a010fdcdfe7a21a81">dynamic_programming::word_break::exists</a></div><div class="ttdeci">bool exists(const std::string &amp;str, const std::unordered_set&lt; std::string &gt; &amp;strSet)</div><div class="ttdoc">Function that checks if the string passed in param is present in the the unordered_set passed.</div><div class="ttdef"><b>Definition</b> word_break.cpp:60</div></div>
-<div class="ttc" id="aword__break_8cpp_html_a272b0f5cdb4e41fd6dee4538b808c06a"><div class="ttname"><a href="#a272b0f5cdb4e41fd6dee4538b808c06a">dynamic_programming::word_break::check</a></div><div class="ttdeci">bool check(const std::string &amp;s, const std::unordered_set&lt; std::string &gt; &amp;strSet, int pos, std::vector&lt; int &gt; *dp)</div><div class="ttdoc">Function that checks if the string passed in param can be segmented from position 'pos',...</div><div class="ttdef"><b>Definition</b> word_break.cpp:80</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.svg" width="570" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></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> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></div>
+<div class="ttc" id="aword__break_8cpp_html_a1cc9dd6e6190d10a010fdcdfe7a21a81"><div class="ttname"><a href="#a1cc9dd6e6190d10a010fdcdfe7a21a81">dynamic_programming::word_break::exists</a></div><div class="ttdeci">bool exists(const std::string &amp;str, const std::unordered_set&lt; std::string &gt; &amp;strSet)</div><div class="ttdoc">Function that checks if the string passed in param is present in the the unordered_set passed.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d84/word__break_8cpp_source.html#l00060">word_break.cpp:60</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1cc9dd6e6190d10a010fdcdfe7a21a81" name="a1cc9dd6e6190d10a010fdcdfe7a21a81"></a>
@@ -263,12 +278,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool dynamic_programming::word_break::exists </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_set.html">std::unordered_set</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>strSet</em></span>&#160;)</td>
+          <td class="paramtype">const std::unordered_set&lt; std::string &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>strSet</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -284,17 +299,12 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if str is present in strSet </dd>
 <dd>
 <code>false</code> if str is not present in strSet </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   61</span>                                                       {</div>
-<div class="line"><span class="lineno">   62</span>    <span class="keywordflow">return</span> strSet.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_set/find.html">find</a>(str) != strSet.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_set/end.html">end</a>();</div>
-<div class="line"><span class="lineno">   63</span>}</div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_set/end.html">std::unordered_set::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="afind_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_set/find.html">std::unordered_set::find</a></div><div class="ttdeci">T find(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.svg" width="370" height="104"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d3/d84/word__break_8cpp_source.html#l00060">60</a> of file <a class="el" href="../../d3/d84/word__break_8cpp_source.html">word_break.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   61</span>                                                       {</div>
+<div class="line"><span class="lineno">   62</span>    <span class="keywordflow">return</span> strSet.find(str) != strSet.end();</div>
+<div class="line"><span class="lineno">   63</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -314,30 +324,24 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d84/word__break_8cpp_source.html#l00174">174</a> of file <a class="el" href="../../d3/d84/word__break_8cpp_source.html">word_break.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  174</span>           {</div>
 <div class="line"><span class="lineno">  175</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// call the test function :)</span></div>
 <div class="line"><span class="lineno">  176</span> </div>
 <div class="line"><span class="lineno">  177</span>    <span class="comment">// the complete string</span></div>
-<div class="line"><span class="lineno">  178</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s = <span class="stringliteral">&quot;applepenapple&quot;</span>;</div>
+<div class="line"><span class="lineno">  178</span>    <span class="keyword">const</span> std::string s = <span class="stringliteral">&quot;applepenapple&quot;</span>;</div>
 <div class="line"><span class="lineno">  179</span>    <span class="comment">// the dictionary to be used</span></div>
-<div class="line"><span class="lineno">  180</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::string&gt;</a> wordDict = {<span class="stringliteral">&quot;apple&quot;</span>, <span class="stringliteral">&quot;pen&quot;</span>};</div>
+<div class="line"><span class="lineno">  180</span>    <span class="keyword">const</span> std::vector&lt;std::string&gt; wordDict = {<span class="stringliteral">&quot;apple&quot;</span>, <span class="stringliteral">&quot;pen&quot;</span>};</div>
 <div class="line"><span class="lineno">  181</span> </div>
 <div class="line"><span class="lineno">  182</span>    <span class="comment">// should return true, as applepenapple can be segmented as apple + pen +</span></div>
 <div class="line"><span class="lineno">  183</span>    <span class="comment">// apple</span></div>
-<div class="line"><span class="lineno">  184</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#afe4dcd6fd5282e535685361cba645d7c">dynamic_programming::word_break::wordBreak</a>(s, wordDict)</div>
-<div class="line"><span class="lineno">  185</span>              &lt;&lt; <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">  184</span>    std::cout &lt;&lt; <a class="code hl_function" href="#afe4dcd6fd5282e535685361cba645d7c">dynamic_programming::word_break::wordBreak</a>(s, wordDict)</div>
+<div class="line"><span class="lineno">  185</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  186</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="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="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-<div class="ttc" id="aword__break_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> word_break.cpp:156</div></div>
-<div class="ttc" id="aword__break_8cpp_html_afe4dcd6fd5282e535685361cba645d7c"><div class="ttname"><a href="#afe4dcd6fd5282e535685361cba645d7c">dynamic_programming::word_break::wordBreak</a></div><div class="ttdeci">bool wordBreak(const std::string &amp;s, const std::vector&lt; std::string &gt; &amp;wordDict)</div><div class="ttdoc">Function that checks if the string passed in param can be segmented into the strings present in the v...</div><div class="ttdef"><b>Definition</b> word_break.cpp:131</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aword__break_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d84/word__break_8cpp_source.html#l00156">word_break.cpp:156</a></div></div>
+<div class="ttc" id="aword__break_8cpp_html_afe4dcd6fd5282e535685361cba645d7c"><div class="ttname"><a href="#afe4dcd6fd5282e535685361cba645d7c">dynamic_programming::word_break::wordBreak</a></div><div class="ttdeci">bool wordBreak(const std::string &amp;s, const std::vector&lt; std::string &gt; &amp;wordDict)</div><div class="ttdoc">Function that checks if the string passed in param can be segmented into the strings present in the v...</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d84/word__break_8cpp_source.html#l00131">word_break.cpp:131</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -365,26 +369,23 @@ Here is the call graph for this function:</div>
 
 <p>Test implementations. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d84/word__break_8cpp_source.html#l00156">156</a> of file <a class="el" href="../../d3/d84/word__break_8cpp_source.html">word_break.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  156</span>                   {</div>
 <div class="line"><span class="lineno">  157</span>    <span class="comment">// the complete string</span></div>
-<div class="line"><span class="lineno">  158</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s = <span class="stringliteral">&quot;applepenapple&quot;</span>;</div>
+<div class="line"><span class="lineno">  158</span>    <span class="keyword">const</span> std::string s = <span class="stringliteral">&quot;applepenapple&quot;</span>;</div>
 <div class="line"><span class="lineno">  159</span>    <span class="comment">// the dictionary to be used</span></div>
-<div class="line"><span class="lineno">  160</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::string&gt;</a> wordDict = {<span class="stringliteral">&quot;apple&quot;</span>, <span class="stringliteral">&quot;pen&quot;</span>};</div>
+<div class="line"><span class="lineno">  160</span>    <span class="keyword">const</span> std::vector&lt;std::string&gt; wordDict = {<span class="stringliteral">&quot;apple&quot;</span>, <span class="stringliteral">&quot;pen&quot;</span>};</div>
 <div class="line"><span class="lineno">  161</span> </div>
 <div class="line"><span class="lineno">  162</span>    assert(dynamic_programming::word_break::wordBreak(s, wordDict));</div>
 <div class="line"><span class="lineno">  163</span> </div>
 <div class="line"><span class="lineno">  164</span>    <span class="comment">// should return true, as applepenapple can be segmented as apple + pen +</span></div>
 <div class="line"><span class="lineno">  165</span>    <span class="comment">// apple</span></div>
-<div class="line"><span class="lineno">  166</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#afe4dcd6fd5282e535685361cba645d7c">dynamic_programming::word_break::wordBreak</a>(s, wordDict)</div>
-<div class="line"><span class="lineno">  167</span>              &lt;&lt; <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">  168</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test implementation passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  166</span>    std::cout &lt;&lt; <a class="code hl_function" href="#afe4dcd6fd5282e535685361cba645d7c">dynamic_programming::word_break::wordBreak</a>(s, wordDict)</div>
+<div class="line"><span class="lineno">  167</span>              &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  168</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test implementation passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  169</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="afe4dcd6fd5282e535685361cba645d7c" name="afe4dcd6fd5282e535685361cba645d7c"></a>
@@ -396,12 +397,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool dynamic_programming::word_break::wordBreak </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>wordDict</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; std::string &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>wordDict</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -417,31 +418,26 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if s can be formed by a combination of strings present in wordDict </dd>
 <dd>
 <code>false</code> otherwise </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d84/word__break_8cpp_source.html#l00131">131</a> of file <a class="el" href="../../d3/d84/word__break_8cpp_source.html">word_break.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  131</span>                                                                         {</div>
 <div class="line"><span class="lineno">  132</span>    <span class="comment">// unordered set to store words in the dictionary for constant time</span></div>
 <div class="line"><span class="lineno">  133</span>    <span class="comment">// search</span></div>
-<div class="line"><span class="lineno">  134</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_set.html">std::unordered_set&lt;std::string&gt;</a> strSet;</div>
+<div class="line"><span class="lineno">  134</span>    std::unordered_set&lt;std::string&gt; strSet;</div>
 <div class="line"><span class="lineno">  135</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;s : wordDict) {</div>
-<div class="line"><span class="lineno">  136</span>        strSet.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_set/insert.html">insert</a>(s);</div>
+<div class="line"><span class="lineno">  136</span>        strSet.insert(s);</div>
 <div class="line"><span class="lineno">  137</span>    }</div>
 <div class="line"><span class="lineno">  138</span>    <span class="comment">// a vector to be used for memoization, whose value at index i will</span></div>
 <div class="line"><span class="lineno">  139</span>    <span class="comment">// tell if the string s can be segmented (correctly) at position i.</span></div>
 <div class="line"><span class="lineno">  140</span>    <span class="comment">// initializing it with INT_MAX (which will denote no solution)</span></div>
-<div class="line"><span class="lineno">  141</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>(), INT_MAX);</div>
+<div class="line"><span class="lineno">  141</span>    std::vector&lt;int&gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(s.length(), INT_MAX);</div>
 <div class="line"><span class="lineno">  142</span> </div>
 <div class="line"><span class="lineno">  143</span>    <span class="comment">// calling check method with position = 0, to check from left</span></div>
 <div class="line"><span class="lineno">  144</span>    <span class="comment">// from where can be start segmenting the complete string in correct</span></div>
 <div class="line"><span class="lineno">  145</span>    <span class="comment">// manner</span></div>
-<div class="line"><span class="lineno">  146</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="#a272b0f5cdb4e41fd6dee4538b808c06a">check</a>(s, strSet, 0, &amp;<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);</div>
+<div class="line"><span class="lineno">  146</span>    <span class="keywordflow">return</span> check(s, strSet, 0, &amp;<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);</div>
 <div class="line"><span class="lineno">  147</span>}</div>
-<div class="ttc" id="ainsert_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_set/insert.html">std::unordered_set::insert</a></div><div class="ttdeci">T insert(T... args)</div></div>
-<div class="ttc" id="aunordered_set_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_set.html">std::unordered_set</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.svg" width="100%" height="443"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.map b/d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.map
deleted file mode 100644
index 0b89b411d..000000000
--- a/d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="dynamic_programming::word_break::exists" name="dynamic_programming::word_break::exists">
-<area shape="rect" id="Node000001" title="Function that checks if the string passed in param is present in the the unordered_set passed." alt="" coords="5,29,158,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="43,29,41,19,47,10,61,5,82,3,104,5,117,11,114,16,102,10,81,8,62,10,51,15,46,20,48,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/end.html#" title=" " alt="" coords="206,8,364,33"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="158,36,190,31,190,37,159,41"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/find.html#" title=" " alt="" coords="220,57,350,98"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="158,58,205,64,204,69,158,63"/>
-</map>
diff --git a/d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.md5 b/d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.md5
deleted file mode 100644
index 00b2cc218..000000000
--- a/d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-50f596e11d14a2b33b72767daf20b4ec
\ No newline at end of file
diff --git a/d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.svg b/d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.svg
deleted file mode 100644
index abdfba2aa..000000000
--- a/d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::word_break::exists Pages: 1 -->
-<svg width="277pt" height="78pt"
- viewBox="0.00 0.00 277.00 77.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 73.5)">
-<title>dynamic_programming::word_break::exists</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that checks if the string passed in param is present in the the unordered_set passed.">
-<polygon fill="#999999" stroke="#666666" points="114.25,-51.5 0,-51.5 0,-21 114.25,-21 114.25,-51.5"/>
-<text text-anchor="start" x="8" y="-38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="57.12" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">::word_break::exists</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.1,-51.99C24.59,-61.06 33.59,-69.5 57.12,-69.5 69.99,-69.5 78.52,-66.97 82.7,-63.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.14,-63.85 83.95,-53.49 79.2,-62.96 86.14,-63.85"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269,-67.88 150.25,-67.88 150.25,-48.62 269,-48.62 269,-67.88"/>
-<text text-anchor="middle" x="209.62" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.59,-44.5C122.42,-45.65 130.53,-46.83 138.56,-48.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.93,-51.45 148.33,-49.44 138.94,-44.53 137.93,-51.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.12,-30.5 161.12,-30.5 161.12,0 258.12,0 258.12,-30.5"/>
-<text text-anchor="start" x="169.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="209.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.59,-28.37C125.98,-26.78 137.98,-25.11 149.45,-23.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.79,-26.99 159.21,-22.14 148.82,-20.06 149.79,-26.99"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph_org.svg b/d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph_org.svg
deleted file mode 100644
index 4d4834129..000000000
--- a/d3/d84/word__break_8cpp_a1cc9dd6e6190d10a010fdcdfe7a21a81_cgraph_org.svg
+++ /dev/null
@@ -1,68 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::word_break::exists Pages: 1 -->
-<svg width="277pt" height="78pt"
- viewBox="0.00 0.00 277.00 77.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 73.5)">
-<title>dynamic_programming::word_break::exists</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that checks if the string passed in param is present in the the unordered_set passed.">
-<polygon fill="#999999" stroke="#666666" points="114.25,-51.5 0,-51.5 0,-21 114.25,-21 114.25,-51.5"/>
-<text text-anchor="start" x="8" y="-38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="57.12" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">::word_break::exists</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.1,-51.99C24.59,-61.06 33.59,-69.5 57.12,-69.5 69.99,-69.5 78.52,-66.97 82.7,-63.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.14,-63.85 83.95,-53.49 79.2,-62.96 86.14,-63.85"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269,-67.88 150.25,-67.88 150.25,-48.62 269,-48.62 269,-67.88"/>
-<text text-anchor="middle" x="209.62" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.59,-44.5C122.42,-45.65 130.53,-46.83 138.56,-48.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.93,-51.45 148.33,-49.44 138.94,-44.53 137.93,-51.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.12,-30.5 161.12,-30.5 161.12,0 258.12,0 258.12,-30.5"/>
-<text text-anchor="start" x="169.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="209.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.59,-28.37C125.98,-26.78 137.98,-25.11 149.45,-23.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.79,-26.99 159.21,-22.14 148.82,-20.06 149.79,-26.99"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.map b/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.map
deleted file mode 100644
index 7e941c170..000000000
--- a/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="dynamic_programming::word_break::check" name="dynamic_programming::word_break::check">
-<area shape="rect" id="Node000001" title="Function that checks if the string passed in param can be segmented from position &#39;pos&#39;,..." alt="" coords="5,59,158,99"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="43,59,42,49,48,40,61,34,82,32,103,34,116,41,114,45,102,40,81,37,63,39,51,44,47,50,49,57"/>
-<area shape="rect" id="Node000002" href="$d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81" title="Function that checks if the string passed in param is present in the the unordered_set passed." alt="" coords="206,29,358,70"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="158,65,190,60,191,66,159,70"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="221,94,343,120"/>
-<area shape="poly" id="edge6_Node000001_Node000005" title=" " alt="" coords="159,87,205,94,205,99,158,92"/>
-<area shape="poly" id="edge4_Node000002_Node000002" title=" " alt="" coords="244,29,242,19,248,10,262,5,282,3,304,5,317,11,314,16,302,10,282,8,263,10,251,15,247,20,249,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/end.html#" title=" " alt="" coords="406,9,564,34"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="358,37,390,32,391,37,359,42"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/find.html#" title=" " alt="" coords="420,59,550,99"/>
-<area shape="poly" id="edge5_Node000002_Node000004" title=" " alt="" coords="359,58,405,65,405,70,358,63"/>
-</map>
diff --git a/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.md5 b/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.md5
deleted file mode 100644
index 0631ce367..000000000
--- a/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9aeb52ba9667a8be34ad9e06cce3d2e2
\ No newline at end of file
diff --git a/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.svg b/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.svg
deleted file mode 100644
index 21fe2d9ad..000000000
--- a/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph.svg
+++ /dev/null
@@ -1,140 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::word_break::check Pages: 1 -->
-<svg width="427pt" height="94pt"
- viewBox="0.00 0.00 427.25 93.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89.88)">
-<title>dynamic_programming::word_break::check</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that checks if the string passed in param can be segmented from position &#39;pos&#39;,...">
-<polygon fill="#999999" stroke="#666666" points="114.25,-45.88 0,-45.88 0,-15.37 114.25,-15.37 114.25,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="57.12" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::word_break::check</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.5,-46.36C25.07,-55.43 33.94,-63.88 57.12,-63.88 69.8,-63.88 78.2,-61.35 82.32,-57.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.77,-58.22 83.56,-47.86 78.82,-57.34 85.77,-58.22"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81" target="_top" xlink:title="Function that checks if the string passed in param is present in the the unordered_set passed.">
-<polygon fill="white" stroke="#666666" points="264.5,-67.88 150.25,-67.88 150.25,-37.38 264.5,-37.38 264.5,-67.88"/>
-<text text-anchor="start" x="158.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="207.38" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::word_break::exists</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.59,-39.01C122.49,-40.18 130.67,-41.39 138.75,-42.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.16,-46.04 148.56,-44.05 139.19,-39.12 138.16,-46.04"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.25,-19.25 161.5,-19.25 161.5,0 253.25,0 253.25,-19.25"/>
-<text text-anchor="middle" x="207.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.59,-22.63C126.13,-20.99 138.28,-19.27 149.82,-17.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.2,-21.12 159.61,-16.25 149.22,-14.19 150.2,-21.12"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge4_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge4_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.75,-68.36C175.32,-77.43 184.19,-85.88 207.38,-85.88 220.05,-85.88 228.45,-83.35 232.57,-79.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.02,-80.22 233.81,-69.86 229.07,-79.34 236.02,-80.22"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="419.25,-83.25 300.5,-83.25 300.5,-64 419.25,-64 419.25,-83.25"/>
-<text text-anchor="middle" x="359.88" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.84,-60.5C272.67,-61.6 280.78,-62.73 288.81,-63.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.19,-67.3 298.58,-65.21 289.16,-60.36 288.19,-67.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408.38,-45.88 311.38,-45.88 311.38,-15.37 408.38,-15.37 408.38,-45.88"/>
-<text text-anchor="start" x="319.38" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="359.88" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge5_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge5_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.84,-44.37C276.23,-42.71 288.23,-40.95 299.7,-39.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.07,-42.76 309.46,-37.85 299.06,-35.83 300.07,-42.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph_org.svg b/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph_org.svg
deleted file mode 100644
index fb296022b..000000000
--- a/d3/d84/word__break_8cpp_a272b0f5cdb4e41fd6dee4538b808c06a_cgraph_org.svg
+++ /dev/null
@@ -1,114 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::word_break::check Pages: 1 -->
-<svg width="427pt" height="94pt"
- viewBox="0.00 0.00 427.25 93.88" 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.88)">
-<title>dynamic_programming::word_break::check</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that checks if the string passed in param can be segmented from position &#39;pos&#39;,...">
-<polygon fill="#999999" stroke="#666666" points="114.25,-45.88 0,-45.88 0,-15.37 114.25,-15.37 114.25,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="57.12" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::word_break::check</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.5,-46.36C25.07,-55.43 33.94,-63.88 57.12,-63.88 69.8,-63.88 78.2,-61.35 82.32,-57.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.77,-58.22 83.56,-47.86 78.82,-57.34 85.77,-58.22"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81" target="_top" xlink:title="Function that checks if the string passed in param is present in the the unordered_set passed.">
-<polygon fill="white" stroke="#666666" points="264.5,-67.88 150.25,-67.88 150.25,-37.38 264.5,-37.38 264.5,-67.88"/>
-<text text-anchor="start" x="158.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="207.38" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::word_break::exists</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.59,-39.01C122.49,-40.18 130.67,-41.39 138.75,-42.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.16,-46.04 148.56,-44.05 139.19,-39.12 138.16,-46.04"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.25,-19.25 161.5,-19.25 161.5,0 253.25,0 253.25,-19.25"/>
-<text text-anchor="middle" x="207.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.59,-22.63C126.13,-20.99 138.28,-19.27 149.82,-17.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.2,-21.12 159.61,-16.25 149.22,-14.19 150.2,-21.12"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge4_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge4_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.75,-68.36C175.32,-77.43 184.19,-85.88 207.38,-85.88 220.05,-85.88 228.45,-83.35 232.57,-79.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.02,-80.22 233.81,-69.86 229.07,-79.34 236.02,-80.22"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="419.25,-83.25 300.5,-83.25 300.5,-64 419.25,-64 419.25,-83.25"/>
-<text text-anchor="middle" x="359.88" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.84,-60.5C272.67,-61.6 280.78,-62.73 288.81,-63.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.19,-67.3 298.58,-65.21 289.16,-60.36 288.19,-67.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408.38,-45.88 311.38,-45.88 311.38,-15.37 408.38,-15.37 408.38,-45.88"/>
-<text text-anchor="start" x="319.38" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="359.88" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge5_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge5_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.84,-44.37C276.23,-42.71 288.23,-40.95 299.7,-39.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.07,-42.76 309.46,-37.85 299.06,-35.83 300.07,-42.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 70d5655bc..000000000
--- a/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index ba23d1a28..000000000
--- a/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bd038f66bf9d22bf1d56990307c4d8c4
\ No newline at end of file
diff --git a/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 4d8821131..000000000
--- a/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 9b8e12ae0..000000000
--- a/d3/d84/word__break_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 24d467a5a..000000000
--- a/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,179,16,179,21,55,21"/>
-<area shape="rect" id="Node000003" href="$d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Test implementations." alt="" coords="103,31,146,56"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,22,88,31,87,36,54,27"/>
-<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="146,36,178,28,179,33,147,41"/>
-</map>
diff --git a/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index ac87660fe..000000000
--- a/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-46da6d92f4088e4ba558ac0e714f8630
\ No newline at end of file
diff --git a/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index e84a685f0..000000000
--- a/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="46pt"
- viewBox="0.00 0.00 203.00 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-38.25 0,-38.25 0,-19 37,-19 37,-38.25"/>
-<text text-anchor="middle" x="18.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-38.25 141.5,-38.25 141.5,-19 195,-19 195,-38.25"/>
-<text text-anchor="middle" x="168.25" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-28.62C60.16,-28.62 100.32,-28.62 129.97,-28.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.64,-32.13 139.64,-28.63 129.64,-25.13 129.64,-32.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-23.73C44.67,-21.67 53.52,-19.22 61.73,-16.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.55,-20.36 71.25,-14.32 60.68,-13.61 62.55,-20.36"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-13.47C112.86,-15.2 121.49,-17.33 130.03,-19.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.06,-22.81 139.61,-21.8 130.74,-16.01 129.06,-22.81"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 079828b93..000000000
--- a/d3/d84/word__break_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="46pt"
- viewBox="0.00 0.00 203.00 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-38.25 0,-38.25 0,-19 37,-19 37,-38.25"/>
-<text text-anchor="middle" x="18.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-38.25 141.5,-38.25 141.5,-19 195,-19 195,-38.25"/>
-<text text-anchor="middle" x="168.25" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-28.62C60.16,-28.62 100.32,-28.62 129.97,-28.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.64,-32.13 139.64,-28.63 129.64,-25.13 129.64,-32.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-23.73C44.67,-21.67 53.52,-19.22 61.73,-16.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.55,-20.36 71.25,-14.32 60.68,-13.61 62.55,-20.36"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-13.47C112.86,-15.2 121.49,-17.33 130.03,-19.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.06,-22.81 139.61,-21.8 130.74,-16.01 129.06,-22.81"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.map b/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.map
deleted file mode 100644
index e8a806fa8..000000000
--- a/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="dynamic_programming::word_break::wordBreak" name="dynamic_programming::word_break::wordBreak">
-<area shape="rect" id="Node000001" title="Function that checks if the string passed in param can be segmented into the strings present in the v..." alt="" coords="5,87,172,127"/>
-<area shape="poly" id="edge10_Node000001_Node000001" title=" " alt="" coords="49,87,47,77,54,68,68,62,89,60,111,62,124,69,122,73,110,68,88,65,69,67,57,72,52,78,54,85"/>
-<area shape="rect" id="Node000002" href="$d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a" title="Function that checks if the string passed in param can be segmented from position &#39;pos&#39;,..." alt="" coords="220,29,372,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="164,84,204,72,206,77,165,89"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="435,94,557,120"/>
-<area shape="poly" id="edge9_Node000001_Node000006" title=" " alt="" coords="172,104,420,104,420,110,172,110"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/insert.html#" title=" " alt="" coords="231,144,360,185"/>
-<area shape="poly" id="edge8_Node000001_Node000007" title=" " alt="" coords="165,125,217,140,215,145,164,130"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="258,29,256,19,262,10,276,5,296,3,318,5,331,11,328,16,316,10,296,8,277,10,265,15,261,20,263,28"/>
-<area shape="rect" id="Node000003" href="$d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81" title="Function that checks if the string passed in param is present in the the unordered_set passed." alt="" coords="420,29,572,70"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="372,47,405,47,405,52,372,52"/>
-<area shape="poly" id="edge7_Node000002_Node000006" title=" " alt="" coords="370,68,435,87,433,92,368,73"/>
-<area shape="poly" id="edge5_Node000003_Node000003" title=" " alt="" coords="458,29,456,19,462,10,476,5,496,3,518,5,531,11,529,16,517,10,496,8,477,10,466,15,461,20,463,28"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/end.html#" title=" " alt="" coords="620,9,779,34"/>
-<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="572,37,604,32,605,37,573,42"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/find.html#" title=" " alt="" coords="635,59,764,99"/>
-<area shape="poly" id="edge6_Node000003_Node000005" title=" " alt="" coords="573,58,620,65,619,70,572,63"/>
-</map>
diff --git a/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.md5 b/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.md5
deleted file mode 100644
index c6d7ee1a9..000000000
--- a/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-23d38ad0b294425ff401134af1e094ed
\ No newline at end of file
diff --git a/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.svg b/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.svg
deleted file mode 100644
index 971ef160e..000000000
--- a/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph.svg
+++ /dev/null
@@ -1,253 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::word_break::wordBreak Pages: 1 -->
-<!--zoomable 143 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 588;
-var viewHeight = 143;
-var sectionId = 'dynsection-5';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>dynamic_programming::word_break::wordBreak</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that checks if the string passed in param can be segmented into the strings present in the v...">
-<polygon fill="#999999" stroke="#666666" points="124.75,-73.5 0,-73.5 0,-43 124.75,-43 124.75,-73.5"/>
-<text text-anchor="start" x="8" y="-60" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="62.38" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">::word_break::wordBreak</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge10_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge10_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.82,-73.99C29.2,-83.06 38.38,-91.5 62.38,-91.5 75.5,-91.5 84.19,-88.97 88.45,-85.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.9,-85.86 89.73,-75.49 84.96,-84.94 91.9,-85.86"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a" target="_top" xlink:title="Function that checks if the string passed in param can be segmented from position &#39;pos&#39;,...">
-<polygon fill="white" stroke="#666666" points="275,-116.5 160.75,-116.5 160.75,-86 275,-86 275,-116.5"/>
-<text text-anchor="start" x="168.75" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="217.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">::word_break::check</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.23,-73.9C129.17,-76.68 139.63,-79.61 149.85,-82.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.78,-85.81 159.35,-85.14 150.67,-79.07 148.78,-85.81"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="414,-67.88 322.25,-67.88 322.25,-48.62 414,-48.62 414,-67.88"/>
-<text text-anchor="middle" x="368.12" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge9_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge9_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.21,-58.25C179.56,-58.25 257.98,-58.25 310.66,-58.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="310.63,-61.75 320.63,-58.25 310.63,-54.75 310.63,-61.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.38,-30.5 169.38,-30.5 169.38,0 266.38,0 266.38,-30.5"/>
-<text text-anchor="start" x="177.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="217.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge8_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.23,-42.6C131.82,-39.08 145.23,-35.32 157.95,-31.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.77,-35.16 167.46,-29.09 156.88,-28.42 158.77,-35.16"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.25,-116.99C185.82,-126.06 194.69,-134.5 217.88,-134.5 230.55,-134.5 238.95,-131.97 243.07,-128.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.52,-128.85 244.31,-118.49 239.57,-127.97 246.52,-128.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81" target="_top" xlink:title="Function that checks if the string passed in param is present in the the unordered_set passed.">
-<polygon fill="white" stroke="#666666" points="425.25,-116.5 311,-116.5 311,-86 425.25,-86 425.25,-116.5"/>
-<text text-anchor="start" x="319" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="368.12" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">::word_break::exists</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.34,-101.25C283.24,-101.25 291.42,-101.25 299.5,-101.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.3,-104.75 309.3,-101.25 299.3,-97.75 299.3,-104.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge7_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge7_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M272.82,-85.6C288.8,-80.97 306.15,-75.94 321.55,-71.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.3,-74.9 330.93,-68.75 320.35,-68.17 322.3,-74.9"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge5_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge5_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M341.5,-116.99C336.07,-126.06 344.94,-134.5 368.12,-134.5 380.8,-134.5 389.2,-131.97 393.32,-128.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.77,-128.85 394.56,-118.49 389.82,-127.97 396.77,-128.85"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="580,-131.88 461.25,-131.88 461.25,-112.62 580,-112.62 580,-131.88"/>
-<text text-anchor="middle" x="520.62" y="-118.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set::end</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M425.59,-109.13C433.42,-110.22 441.53,-111.35 449.56,-112.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="448.94,-115.92 459.33,-113.84 449.91,-108.99 448.94,-115.92"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="569.12,-94.5 472.12,-94.5 472.12,-64 569.12,-64 569.12,-94.5"/>
-<text text-anchor="start" x="480.12" y="-81" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="520.62" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge6_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge6_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M425.59,-93C436.98,-91.33 448.98,-89.58 460.45,-87.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="460.82,-91.38 470.21,-86.47 459.81,-84.46 460.82,-91.38"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph_org.svg b/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph_org.svg
deleted file mode 100644
index 0e5c31a97..000000000
--- a/d3/d84/word__break_8cpp_afe4dcd6fd5282e535685361cba645d7c_cgraph_org.svg
+++ /dev/null
@@ -1,170 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::word_break::wordBreak Pages: 1 -->
-<svg width="588pt" height="143pt"
- viewBox="0.00 0.00 588.00 142.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138.5)">
-<title>dynamic_programming::word_break::wordBreak</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that checks if the string passed in param can be segmented into the strings present in the v...">
-<polygon fill="#999999" stroke="#666666" points="124.75,-73.5 0,-73.5 0,-43 124.75,-43 124.75,-73.5"/>
-<text text-anchor="start" x="8" y="-60" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="62.38" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">::word_break::wordBreak</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge10_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge10_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.82,-73.99C29.2,-83.06 38.38,-91.5 62.38,-91.5 75.5,-91.5 84.19,-88.97 88.45,-85.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.9,-85.86 89.73,-75.49 84.96,-84.94 91.9,-85.86"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a" target="_top" xlink:title="Function that checks if the string passed in param can be segmented from position &#39;pos&#39;,...">
-<polygon fill="white" stroke="#666666" points="275,-116.5 160.75,-116.5 160.75,-86 275,-86 275,-116.5"/>
-<text text-anchor="start" x="168.75" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="217.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">::word_break::check</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.23,-73.9C129.17,-76.68 139.63,-79.61 149.85,-82.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.78,-85.81 159.35,-85.14 150.67,-79.07 148.78,-85.81"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="414,-67.88 322.25,-67.88 322.25,-48.62 414,-48.62 414,-67.88"/>
-<text text-anchor="middle" x="368.12" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge9_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge9_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.21,-58.25C179.56,-58.25 257.98,-58.25 310.66,-58.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="310.63,-61.75 320.63,-58.25 310.63,-54.75 310.63,-61.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.38,-30.5 169.38,-30.5 169.38,0 266.38,0 266.38,-30.5"/>
-<text text-anchor="start" x="177.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="217.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge8_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.23,-42.6C131.82,-39.08 145.23,-35.32 157.95,-31.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.77,-35.16 167.46,-29.09 156.88,-28.42 158.77,-35.16"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.25,-116.99C185.82,-126.06 194.69,-134.5 217.88,-134.5 230.55,-134.5 238.95,-131.97 243.07,-128.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.52,-128.85 244.31,-118.49 239.57,-127.97 246.52,-128.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81" target="_top" xlink:title="Function that checks if the string passed in param is present in the the unordered_set passed.">
-<polygon fill="white" stroke="#666666" points="425.25,-116.5 311,-116.5 311,-86 425.25,-86 425.25,-116.5"/>
-<text text-anchor="start" x="319" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="368.12" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">::word_break::exists</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.34,-101.25C283.24,-101.25 291.42,-101.25 299.5,-101.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.3,-104.75 309.3,-101.25 299.3,-97.75 299.3,-104.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge7_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge7_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M272.82,-85.6C288.8,-80.97 306.15,-75.94 321.55,-71.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.3,-74.9 330.93,-68.75 320.35,-68.17 322.3,-74.9"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge5_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge5_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M341.5,-116.99C336.07,-126.06 344.94,-134.5 368.12,-134.5 380.8,-134.5 389.2,-131.97 393.32,-128.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.77,-128.85 394.56,-118.49 389.82,-127.97 396.77,-128.85"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="580,-131.88 461.25,-131.88 461.25,-112.62 580,-112.62 580,-131.88"/>
-<text text-anchor="middle" x="520.62" y="-118.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set::end</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M425.59,-109.13C433.42,-110.22 441.53,-111.35 449.56,-112.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="448.94,-115.92 459.33,-113.84 449.91,-108.99 448.94,-115.92"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="569.12,-94.5 472.12,-94.5 472.12,-64 569.12,-64 569.12,-94.5"/>
-<text text-anchor="start" x="480.12" y="-81" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="520.62" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge6_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge6_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M425.59,-93C436.98,-91.33 448.98,-89.58 460.45,-87.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="460.82,-91.38 470.21,-86.47 459.81,-84.46 460.82,-91.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d84/word__break_8cpp_source.html b/d3/d84/word__break_8cpp_source.html
new file mode 100644
index 000000000..d07d67270
--- /dev/null
+++ b/d3/d84/word__break_8cpp_source.html
@@ -0,0 +1,258 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/word_break.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/d84/word__break_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">word_break.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/d84/word__break_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &lt;climits&gt;</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;string&gt;</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#include &lt;unordered_set&gt;</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a> {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/d53/namespaceword__break.html">word_break</a> {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="foldopen" id="foldopen00060" data-start="{" data-end="}">
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"><a class="line" href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">   60</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a>(<span class="keyword">const</span> std::string &amp;str,</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            <span class="keyword">const</span> std::unordered_set&lt;std::string&gt; &amp;strSet) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordflow">return</span> strSet.find(str) != strSet.end();</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>}</div>
+</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="foldopen" id="foldopen00080" data-start="{" data-end="}">
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="../../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a">   80</a></span><span class="keywordtype">bool</span> check(<span class="keyword">const</span> std::string &amp;s, <span class="keyword">const</span> std::unordered_set&lt;std::string&gt; &amp;strSet,</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>           <span class="keywordtype">int</span> pos, std::vector&lt;int&gt; *<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>) {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">if</span> (pos == s.length()) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="comment">// if we have reached till the end of the string, means we have</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        <span class="comment">// segmented throughout correctly hence we have a solution, thus</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        <span class="comment">// returning true</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keywordflow">if</span> (<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>-&gt;at(pos) != INT_MAX) {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        <span class="comment">// if dp[pos] is not INT_MAX, means we must have saved a solution</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        <span class="comment">// for the position pos; then return if the solution at pos is true</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        <span class="comment">// or not</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>-&gt;at(pos) == 1;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    }</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    std::string wordTillNow =</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        <span class="stringliteral">&quot;&quot;</span>;  <span class="comment">// string to save the prefixes of word till different positons</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span> </div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = pos; i &lt; s.length(); i++) {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        <span class="comment">// Loop starting from pos to end, to check valid set of</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        <span class="comment">// segmentations if any</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        wordTillNow +=</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>            std::string(1, s[i]);  <span class="comment">// storing the prefix till the position i</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        <span class="comment">// if the prefix till current position is present in the dictionary</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="comment">// and the remaining substring can also be segmented legally, then</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        <span class="comment">// set solution at position pos in the memo, and return true</span></div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a>(wordTillNow, strSet) &amp;&amp; check(s, strSet, i + 1, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>)) {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>-&gt;at(pos) = 1;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        }</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    }</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="comment">// if function has still not returned, then there must be no legal</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="comment">// segmentation possible after segmenting at pos</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>-&gt;at(pos) = 0;  <span class="comment">// so set solution at pos as false</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;     <span class="comment">// and return no solution at position pos</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>}</div>
+</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="foldopen" id="foldopen00131" data-start="{" data-end="}">
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"><a class="line" href="../../d3/d84/word__break_8cpp.html#afe4dcd6fd5282e535685361cba645d7c">  131</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#afe4dcd6fd5282e535685361cba645d7c">wordBreak</a>(<span class="keyword">const</span> std::string &amp;s, <span class="keyword">const</span> std::vector&lt;std::string&gt; &amp;wordDict) {</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="comment">// unordered set to store words in the dictionary for constant time</span></div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <span class="comment">// search</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    std::unordered_set&lt;std::string&gt; strSet;</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;s : wordDict) {</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        strSet.insert(s);</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    }</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <span class="comment">// a vector to be used for memoization, whose value at index i will</span></div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <span class="comment">// tell if the string s can be segmented (correctly) at position i.</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="comment">// initializing it with INT_MAX (which will denote no solution)</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    std::vector&lt;int&gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(s.length(), INT_MAX);</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span> </div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <span class="comment">// calling check method with position = 0, to check from left</span></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <span class="comment">// from where can be start segmenting the complete string in correct</span></div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <span class="comment">// manner</span></div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    <span class="keywordflow">return</span> check(s, strSet, 0, &amp;<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>}</div>
+</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span> </div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>}  <span class="comment">// namespace word_break</span></div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>}  <span class="comment">// namespace dynamic_programming</span></div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
+<div class="foldopen" id="foldopen00156" data-start="{" data-end="}">
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"><a class="line" href="../../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  156</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    <span class="comment">// the complete string</span></div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    <span class="keyword">const</span> std::string s = <span class="stringliteral">&quot;applepenapple&quot;</span>;</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    <span class="comment">// the dictionary to be used</span></div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    <span class="keyword">const</span> std::vector&lt;std::string&gt; wordDict = {<span class="stringliteral">&quot;apple&quot;</span>, <span class="stringliteral">&quot;pen&quot;</span>};</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span> </div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    assert(dynamic_programming::word_break::wordBreak(s, wordDict));</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span> </div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    <span class="comment">// should return true, as applepenapple can be segmented as apple + pen +</span></div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    <span class="comment">// apple</span></div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    std::cout &lt;&lt; dynamic_programming::word_break::wordBreak(s, wordDict)</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test implementation passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00174" data-start="{" data-end="}">
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"><a class="line" href="../../d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  174</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// call the test function :)</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    <span class="comment">// the complete string</span></div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    <span class="keyword">const</span> std::string s = <span class="stringliteral">&quot;applepenapple&quot;</span>;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    <span class="comment">// the dictionary to be used</span></div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    <span class="keyword">const</span> std::vector&lt;std::string&gt; wordDict = {<span class="stringliteral">&quot;apple&quot;</span>, <span class="stringliteral">&quot;pen&quot;</span>};</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span> </div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    <span class="comment">// should return true, as applepenapple can be segmented as apple + pen +</span></div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    <span class="comment">// apple</span></div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    std::cout &lt;&lt; dynamic_programming::word_break::wordBreak(s, wordDict)</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>}</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> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></div>
+<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
+<div class="ttc" id="anamespaceword__break_html"><div class="ttname"><a href="../../d6/d53/namespaceword__break.html">word_break</a></div><div class="ttdoc">Functions for Word Break problem.</div></div>
+<div class="ttc" id="aword__break_8cpp_html_a1cc9dd6e6190d10a010fdcdfe7a21a81"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">dynamic_programming::word_break::exists</a></div><div class="ttdeci">bool exists(const std::string &amp;str, const std::unordered_set&lt; std::string &gt; &amp;strSet)</div><div class="ttdoc">Function that checks if the string passed in param is present in the the unordered_set passed.</div><div class="ttdef"><b>Definition</b> <a href="#l00060">word_break.cpp:60</a></div></div>
+<div class="ttc" id="aword__break_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d3/d84/word__break_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> <a href="#l00156">word_break.cpp:156</a></div></div>
+<div class="ttc" id="aword__break_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00174">word_break.cpp:174</a></div></div>
+<div class="ttc" id="aword__break_8cpp_html_afe4dcd6fd5282e535685361cba645d7c"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#afe4dcd6fd5282e535685361cba645d7c">dynamic_programming::word_break::wordBreak</a></div><div class="ttdeci">bool wordBreak(const std::string &amp;s, const std::vector&lt; std::string &gt; &amp;wordDict)</div><div class="ttdoc">Function that checks if the string passed in param can be segmented into the strings present in the v...</div><div class="ttdef"><b>Definition</b> <a href="#l00131">word_break.cpp:131</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../d3/d84/word__break_8cpp.html">word_break.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/d91/namespacestrassens__multiplication.html b/d3/d91/namespacestrassens__multiplication.html
index ef3355a13..0372cdeb7 100644
--- a/d3/d91/namespacestrassens__multiplication.html
+++ b/d3/d91/namespacestrassens__multiplication.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: strassens_multiplication Namespace Reference</title>
+<title>TheAlgorithms/C++: strassens_multiplication Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d3/d92/pancake__sort_8cpp.html b/d3/d92/pancake__sort_8cpp.html
index 7b1c35bf0..05de3b9a4 100644
--- a/d3/d92/pancake__sort_8cpp.html
+++ b/d3/d92/pancake__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/pancake_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/pancake_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for pancake_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d38/pancake__sort_8cpp__incl.svg" width="350" height="111"><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">
+</div>
+<p><a href="../../d3/d92/pancake__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -135,11 +154,11 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a99e27ad84ad43df9977776b1a8d5416e" id="r_a99e27ad84ad43df9977776b1a8d5416e"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a99e27ad84ad43df9977776b1a8d5416e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a99e27ad84ad43df9977776b1a8d5416e">sorting::pancake_sort::reverse</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;arr, int start, int end)</td></tr>
+<tr class="memitem:a99e27ad84ad43df9977776b1a8d5416e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a99e27ad84ad43df9977776b1a8d5416e">sorting::pancake_sort::reverse</a> (std::vector&lt; T &gt; &amp;arr, int start, int end)</td></tr>
 <tr class="memdesc:a99e27ad84ad43df9977776b1a8d5416e"><td class="mdescLeft">&#160;</td><td class="mdescRight">This implementation is for reversing elements in a a C-style array .  <br /></td></tr>
 <tr class="separator:a99e27ad84ad43df9977776b1a8d5416e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:abff90bc0f54e4f8ea5f0330471781bd5" id="r_abff90bc0f54e4f8ea5f0330471781bd5"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:abff90bc0f54e4f8ea5f0330471781bd5"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#abff90bc0f54e4f8ea5f0330471781bd5">sorting::pancake_sort::pancakeSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;arr, int size)</td></tr>
+<tr class="memitem:abff90bc0f54e4f8ea5f0330471781bd5"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#abff90bc0f54e4f8ea5f0330471781bd5">sorting::pancake_sort::pancakeSort</a> (std::vector&lt; T &gt; &amp;arr, int size)</td></tr>
 <tr class="memdesc:abff90bc0f54e4f8ea5f0330471781bd5"><td class="mdescLeft">&#160;</td><td class="mdescRight">This implementation is for a C-style array input that gets modified in place.  <br /></td></tr>
 <tr class="separator:abff90bc0f54e4f8ea5f0330471781bd5"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -155,6 +174,8 @@ Functions</h2></td></tr>
 <dl class="section see"><dt>See also</dt><dd>more on <a href="https://en.wikipedia.org/wiki/Pancake_sorting" target="_blank">Pancake sort</a> </dd>
 <dd>
 related <a class="el" href="../../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" title="Problem statement for a system with first-order differential equations. Updates the system differenti...">problem</a> at <a href="https://leetcode.com/problems/pancake-sorting/" target="_blank">Leetcode</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/d92/pancake__sort_8cpp_source.html">pancake_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -173,17 +194,14 @@ related <a class="el" href="../../db/dd3/ode__forward__euler_8cpp.html#abaeae8f6
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d92/pancake__sort_8cpp_source.html#l00128">128</a> of file <a class="el" href="../../d3/d92/pancake__sort_8cpp_source.html">pancake_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  128</span>           {</div>
 <div class="line"><span class="lineno">  129</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
 <div class="line"><span class="lineno">  130</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  131</span>}</div>
-<div class="ttc" id="apancake__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> pancake_sort.cpp:86</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d92/pancake__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="322" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="apancake__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d92/pancake__sort_8cpp_source.html#l00086">pancake_sort.cpp:86</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abff90bc0f54e4f8ea5f0330471781bd5" name="abff90bc0f54e4f8ea5f0330471781bd5"></a>
@@ -197,7 +215,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">int sorting::pancake_sort::pancakeSort </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
+          <td class="paramtype">std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -216,6 +234,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d92/pancake__sort_8cpp_source.html#l00061">61</a> of file <a class="el" href="../../d3/d92/pancake__sort_8cpp_source.html">pancake_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   61</span>                                             {</div>
 <div class="line"><span class="lineno">   62</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = size; i &gt; 1; --i) {</div>
 <div class="line"><span class="lineno">   63</span>        <span class="keywordtype">int</span> max_index = 0, j = 0;  <span class="comment">// intialize some variables.</span></div>
@@ -228,19 +248,13 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   70</span>        }</div>
 <div class="line"><span class="lineno">   71</span>        <span class="keywordflow">if</span> (max_index != i - 1)  <span class="comment">// check for reversing</span></div>
 <div class="line"><span class="lineno">   72</span>        {</div>
-<div class="line"><span class="lineno">   73</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">reverse</a>(arr, 0, max_index);</div>
-<div class="line"><span class="lineno">   74</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">reverse</a>(arr, 0, i - 1);</div>
+<div class="line"><span class="lineno">   73</span>            reverse(arr, 0, max_index);</div>
+<div class="line"><span class="lineno">   74</span>            reverse(arr, 0, i - 1);</div>
 <div class="line"><span class="lineno">   75</span>        }</div>
 <div class="line"><span class="lineno">   76</span>    }</div>
 <div class="line"><span class="lineno">   77</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   78</span>}</div>
-<div class="ttc" id="areverse_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a></div><div class="ttdeci">T reverse(T... args)</div></div>
-</div><!-- 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="../../d3/d92/pancake__sort_8cpp_abff90bc0f54e4f8ea5f0330471781bd5_cgraph.svg" width="158" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a99e27ad84ad43df9977776b1a8d5416e" name="a99e27ad84ad43df9977776b1a8d5416e"></a>
@@ -254,7 +268,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void sorting::pancake_sort::reverse </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
+          <td class="paramtype">std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -279,17 +293,18 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d92/pancake__sort_8cpp_source.html#l00043">43</a> of file <a class="el" href="../../d3/d92/pancake__sort_8cpp_source.html">pancake_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   43</span>                                                    {</div>
 <div class="line"><span class="lineno">   44</span>    T temp;  <span class="comment">// Temporary variable</span></div>
 <div class="line"><span class="lineno">   45</span>    <span class="keywordflow">while</span> (start &lt;= end) {</div>
 <div class="line"><span class="lineno">   46</span>        temp = arr[start];</div>
-<div class="line"><span class="lineno">   47</span>        arr[start] = arr[<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">   48</span>        arr[<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a>] = temp;</div>
+<div class="line"><span class="lineno">   47</span>        arr[start] = arr[end];</div>
+<div class="line"><span class="lineno">   48</span>        arr[end] = temp;</div>
 <div class="line"><span class="lineno">   49</span>        start++;</div>
-<div class="line"><span class="lineno">   50</span>        <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">   50</span>        end--;</div>
 <div class="line"><span class="lineno">   51</span>    }</div>
 <div class="line"><span class="lineno">   52</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>
 </div>
@@ -318,56 +333,48 @@ template&lt;typename T &gt; </div>
 
 <p>Test implementations. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d92/pancake__sort_8cpp_source.html#l00086">86</a> of file <a class="el" href="../../d3/d92/pancake__sort_8cpp_source.html">pancake_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   86</span>                   {</div>
 <div class="line"><span class="lineno">   87</span>    <span class="comment">// example 1: vector of int</span></div>
 <div class="line"><span class="lineno">   88</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> size1 = 7;</div>
-<div class="line"><span class="lineno">   89</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest 1- as std::vector&lt;int&gt;...&quot;</span>;</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&lt;int&gt;</a> arr1 = {23, 10, 20, 11, 12, 6, 7};</div>
+<div class="line"><span class="lineno">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest 1- as std::vector&lt;int&gt;...&quot;</span>;</div>
+<div class="line"><span class="lineno">   90</span>    std::vector&lt;int&gt; arr1 = {23, 10, 20, 11, 12, 6, 7};</div>
 <div class="line"><span class="lineno">   91</span>    <a class="code hl_function" href="#abff90bc0f54e4f8ea5f0330471781bd5">sorting::pancake_sort::pancakeSort</a>(arr1, size1);</div>
-<div class="line"><span class="lineno">   92</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), arr1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()));</div>
-<div class="line"><span class="lineno">   93</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   92</span>    assert(std::is_sorted(arr1.begin(), arr1.end()));</div>
+<div class="line"><span class="lineno">   93</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   94</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size1; i++) {</div>
-<div class="line"><span class="lineno">   95</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; arr1[i] &lt;&lt; <span class="stringliteral">&quot; ,&quot;</span>;</div>
+<div class="line"><span class="lineno">   95</span>        std::cout &lt;&lt; arr1[i] &lt;&lt; <span class="stringliteral">&quot; ,&quot;</span>;</div>
 <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/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   97</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   98</span> </div>
 <div class="line"><span class="lineno">   99</span>    <span class="comment">// example 2: vector of double</span></div>
 <div class="line"><span class="lineno">  100</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> size2 = 8;</div>
-<div class="line"><span class="lineno">  101</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest 2- as std::vector&lt;double&gt;...&quot;</span>;</div>
-<div class="line"><span class="lineno">  102</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> arr2 = {23.56, 10.62, 200.78, 111.484,</div>
+<div class="line"><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest 2- as std::vector&lt;double&gt;...&quot;</span>;</div>
+<div class="line"><span class="lineno">  102</span>    std::vector&lt;double&gt; arr2 = {23.56, 10.62, 200.78, 111.484,</div>
 <div class="line"><span class="lineno">  103</span>                                3.9,   1.2,   61.77,  79.6};</div>
 <div class="line"><span class="lineno">  104</span>    <a class="code hl_function" href="#abff90bc0f54e4f8ea5f0330471781bd5">sorting::pancake_sort::pancakeSort</a>(arr2, size2);</div>
-<div class="line"><span class="lineno">  105</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), arr2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()));</div>
-<div class="line"><span class="lineno">  106</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  105</span>    assert(std::is_sorted(arr2.begin(), arr2.end()));</div>
+<div class="line"><span class="lineno">  106</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  107</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size2; i++) {</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> &lt;&lt; arr2[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><span class="lineno">  108</span>        std::cout &lt;&lt; arr2[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
 <div class="line"><span class="lineno">  109</span>    }</div>
-<div class="line"><span class="lineno">  110</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  110</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  111</span> </div>
 <div class="line"><span class="lineno">  112</span>    <span class="comment">// example 3:vector of float</span></div>
 <div class="line"><span class="lineno">  113</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> size3 = 7;</div>
-<div class="line"><span class="lineno">  114</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest 3- as std::vector&lt;float&gt;...&quot;</span>;</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&lt;float&gt;</a> arr3 = {6.56, 12.62, 200.78, 768.484, 19.27, 68.87, 9.6};</div>
+<div class="line"><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest 3- as std::vector&lt;float&gt;...&quot;</span>;</div>
+<div class="line"><span class="lineno">  115</span>    std::vector&lt;float&gt; arr3 = {6.56, 12.62, 200.78, 768.484, 19.27, 68.87, 9.6};</div>
 <div class="line"><span class="lineno">  116</span>    <a class="code hl_function" href="#abff90bc0f54e4f8ea5f0330471781bd5">sorting::pancake_sort::pancakeSort</a>(arr3, size3);</div>
-<div class="line"><span class="lineno">  117</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr3.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), arr3.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()));</div>
-<div class="line"><span class="lineno">  118</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  117</span>    assert(std::is_sorted(arr3.begin(), arr3.end()));</div>
+<div class="line"><span class="lineno">  118</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  119</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size3; i++) {</div>
-<div class="line"><span class="lineno">  120</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; arr3[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><span class="lineno">  120</span>        std::cout &lt;&lt; arr3[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
 <div class="line"><span class="lineno">  121</span>    }</div>
-<div class="line"><span class="lineno">  122</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  122</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  123</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="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</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="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-<div class="ttc" id="apancake__sort_8cpp_html_abff90bc0f54e4f8ea5f0330471781bd5"><div class="ttname"><a href="#abff90bc0f54e4f8ea5f0330471781bd5">sorting::pancake_sort::pancakeSort</a></div><div class="ttdeci">int pancakeSort(std::vector&lt; T &gt; &amp;arr, int size)</div><div class="ttdoc">This implementation is for a C-style array input that gets modified in place.</div><div class="ttdef"><b>Definition</b> pancake_sort.cpp:61</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d92/pancake__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="224" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="apancake__sort_8cpp_html_abff90bc0f54e4f8ea5f0330471781bd5"><div class="ttname"><a href="#abff90bc0f54e4f8ea5f0330471781bd5">sorting::pancake_sort::pancakeSort</a></div><div class="ttdeci">int pancakeSort(std::vector&lt; T &gt; &amp;arr, int size)</div><div class="ttdoc">This implementation is for a C-style array input that gets modified in place.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d92/pancake__sort_8cpp_source.html#l00061">pancake_sort.cpp:61</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/d92/pancake__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d3/d92/pancake__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index e799e8a4a..000000000
--- a/d3/d92/pancake__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Test implementations." alt="" coords="5,80,49,106"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="97,5,219,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="42,77,95,40,104,35,106,40,98,44,45,82"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="102,55,214,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="48,86,86,79,87,84,49,91"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="122,104,194,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,94,108,105,107,110,48,99"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="108,153,208,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="46,104,98,140,106,144,104,149,95,144,43,108"/>
-</map>
diff --git a/d3/d92/pancake__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d3/d92/pancake__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 83a482f2f..000000000
--- a/d3/d92/pancake__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e64022ce5c0252591bf4dd1aeaf129c1
\ No newline at end of file
diff --git a/d3/d92/pancake__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d3/d92/pancake__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 080b30481..000000000
--- a/d3/d92/pancake__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="168pt" height="138pt"
- viewBox="0.00 0.00 168.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-74.25 0,-74.25 0,-55 32.5,-55 32.5,-74.25"/>
-<text text-anchor="middle" x="16.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-130.25 68.5,-130.25 68.5,-111 160.25,-111 160.25,-130.25"/>
-<text text-anchor="middle" x="114.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.87,-74.6C38.89,-82.86 54,-94.52 68.5,-102.62 70.56,-103.78 72.71,-104.89 74.9,-105.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.39,-109.13 83.95,-110.04 76.27,-102.74 73.39,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="156.5,-93.25 72.25,-93.25 72.25,-74 156.5,-74 156.5,-93.25"/>
-<text text-anchor="middle" x="114.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-67.68C40.49,-69.22 50.45,-71.19 60.7,-73.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="59.86,-76.61 70.35,-75.12 61.22,-69.75 59.86,-76.61"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.12,-56.25 87.62,-56.25 87.62,-37 141.12,-37 141.12,-56.25"/>
-<text text-anchor="middle" x="114.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-61.73C44.45,-59.53 61.14,-56.41 76.29,-53.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.79,-57.04 85.98,-51.76 75.51,-50.16 76.79,-57.04"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152,-19.25 76.75,-19.25 76.75,0 152,0 152,-19.25"/>
-<text text-anchor="middle" x="114.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.32,-54.61C39.37,-46.6 54.27,-35.46 68.5,-27.62 70.57,-26.49 72.72,-25.38 74.92,-24.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.28,-27.54 83.98,-20.26 73.42,-21.15 76.28,-27.54"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d92/pancake__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d3/d92/pancake__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 0f8e33da3..000000000
--- a/d3/d92/pancake__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="168pt" height="138pt"
- viewBox="0.00 0.00 168.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-74.25 0,-74.25 0,-55 32.5,-55 32.5,-74.25"/>
-<text text-anchor="middle" x="16.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-130.25 68.5,-130.25 68.5,-111 160.25,-111 160.25,-130.25"/>
-<text text-anchor="middle" x="114.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.87,-74.6C38.89,-82.86 54,-94.52 68.5,-102.62 70.56,-103.78 72.71,-104.89 74.9,-105.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.39,-109.13 83.95,-110.04 76.27,-102.74 73.39,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="156.5,-93.25 72.25,-93.25 72.25,-74 156.5,-74 156.5,-93.25"/>
-<text text-anchor="middle" x="114.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-67.68C40.49,-69.22 50.45,-71.19 60.7,-73.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="59.86,-76.61 70.35,-75.12 61.22,-69.75 59.86,-76.61"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.12,-56.25 87.62,-56.25 87.62,-37 141.12,-37 141.12,-56.25"/>
-<text text-anchor="middle" x="114.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-61.73C44.45,-59.53 61.14,-56.41 76.29,-53.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.79,-57.04 85.98,-51.76 75.51,-50.16 76.79,-57.04"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152,-19.25 76.75,-19.25 76.75,0 152,0 152,-19.25"/>
-<text text-anchor="middle" x="114.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.32,-54.61C39.37,-46.6 54.27,-35.46 68.5,-27.62 70.57,-26.49 72.72,-25.38 74.92,-24.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.28,-27.54 83.98,-20.26 73.42,-21.15 76.28,-27.54"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d92/pancake__sort_8cpp_abff90bc0f54e4f8ea5f0330471781bd5_cgraph.map b/d3/d92/pancake__sort_8cpp_abff90bc0f54e4f8ea5f0330471781bd5_cgraph.map
deleted file mode 100644
index 8182560d7..000000000
--- a/d3/d92/pancake__sort_8cpp_abff90bc0f54e4f8ea5f0330471781bd5_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="sorting::pancake_sort::pancakeSort" name="sorting::pancake_sort::pancakeSort">
-<area shape="rect" id="Node000001" title="This implementation is for a C&#45;style array input that gets modified in place." alt="" coords="5,29,152,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="50,29,49,20,53,11,63,5,79,3,95,5,105,12,102,16,93,10,78,8,65,10,57,14,54,20,55,28"/>
-</map>
diff --git a/d3/d92/pancake__sort_8cpp_abff90bc0f54e4f8ea5f0330471781bd5_cgraph.md5 b/d3/d92/pancake__sort_8cpp_abff90bc0f54e4f8ea5f0330471781bd5_cgraph.md5
deleted file mode 100644
index 6a5eb6462..000000000
--- a/d3/d92/pancake__sort_8cpp_abff90bc0f54e4f8ea5f0330471781bd5_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fe0ae85da2a883d67da2a84773cfd138
\ No newline at end of file
diff --git a/d3/d92/pancake__sort_8cpp_abff90bc0f54e4f8ea5f0330471781bd5_cgraph.svg b/d3/d92/pancake__sort_8cpp_abff90bc0f54e4f8ea5f0330471781bd5_cgraph.svg
deleted file mode 100644
index 26425e69e..000000000
--- a/d3/d92/pancake__sort_8cpp_abff90bc0f54e4f8ea5f0330471781bd5_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::pancake_sort::pancakeSort Pages: 1 -->
-<svg width="118pt" height="57pt"
- viewBox="0.00 0.00 117.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>sorting::pancake_sort::pancakeSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This implementation is for a C&#45;style array input that gets modified in place.">
-<polygon fill="#999999" stroke="#666666" points="109.75,-30.5 0,-30.5 0,0 109.75,0 109.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pancake_sort</text>
-<text text-anchor="middle" x="54.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pancakeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.43,-30.99C31.46,-40.06 37.94,-48.5 54.88,-48.5 64.14,-48.5 70.27,-45.97 73.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.74,-42.77 74.18,-32.49 69.77,-42.13 76.74,-42.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d92/pancake__sort_8cpp_abff90bc0f54e4f8ea5f0330471781bd5_cgraph_org.svg b/d3/d92/pancake__sort_8cpp_abff90bc0f54e4f8ea5f0330471781bd5_cgraph_org.svg
deleted file mode 100644
index 7c2eb07c9..000000000
--- a/d3/d92/pancake__sort_8cpp_abff90bc0f54e4f8ea5f0330471781bd5_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::pancake_sort::pancakeSort Pages: 1 -->
-<svg width="118pt" height="57pt"
- viewBox="0.00 0.00 117.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>sorting::pancake_sort::pancakeSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This implementation is for a C&#45;style array input that gets modified in place.">
-<polygon fill="#999999" stroke="#666666" points="109.75,-30.5 0,-30.5 0,0 109.75,0 109.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pancake_sort</text>
-<text text-anchor="middle" x="54.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pancakeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.43,-30.99C31.46,-40.06 37.94,-48.5 54.88,-48.5 64.14,-48.5 70.27,-45.97 73.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.74,-42.77 74.18,-32.49 69.77,-42.13 76.74,-42.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d92/pancake__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/d92/pancake__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index aebc6f438..000000000
--- a/d3/d92/pancake__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,80,55,106"/>
-<area shape="rect" id="Node000002" href="$d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Test implementations." alt="" coords="103,80,146,106"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,90,87,90,87,96,55,96"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="194,5,316,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="140,77,193,40,201,35,204,40,195,44,143,82"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="199,55,311,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="146,86,183,79,184,84,147,91"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="220,104,291,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="147,94,205,105,204,110,146,99"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="205,153,305,179"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="143,104,195,140,204,144,201,149,193,144,140,108"/>
-</map>
diff --git a/d3/d92/pancake__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/d92/pancake__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 1cd5b6f39..000000000
--- a/d3/d92/pancake__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-66e82a7b25e6652f975389001e45264f
\ No newline at end of file
diff --git a/d3/d92/pancake__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/d92/pancake__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 703925e19..000000000
--- a/d3/d92/pancake__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="241pt" height="138pt"
- viewBox="0.00 0.00 241.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-74.25 73,-74.25 73,-55 105.5,-55 105.5,-74.25"/>
-<text text-anchor="middle" x="89.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-64.62C44.58,-64.62 53.31,-64.62 61.45,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-68.13 71.2,-64.63 61.2,-61.13 61.2,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.25,-130.25 141.5,-130.25 141.5,-111 233.25,-111 233.25,-130.25"/>
-<text text-anchor="middle" x="187.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.87,-74.6C111.89,-82.86 127,-94.52 141.5,-102.62 143.56,-103.78 145.71,-104.89 147.9,-105.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.39,-109.13 156.95,-110.04 149.27,-102.74 146.39,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="229.5,-93.25 145.25,-93.25 145.25,-74 229.5,-74 229.5,-93.25"/>
-<text text-anchor="middle" x="187.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-67.68C113.49,-69.22 123.45,-71.19 133.7,-73.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.86,-76.61 143.35,-75.12 134.22,-69.75 132.86,-76.61"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.12,-56.25 160.62,-56.25 160.62,-37 214.12,-37 214.12,-56.25"/>
-<text text-anchor="middle" x="187.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-61.73C117.45,-59.53 134.14,-56.41 149.29,-53.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.79,-57.04 158.98,-51.76 148.51,-50.16 149.79,-57.04"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="225,-19.25 149.75,-19.25 149.75,0 225,0 225,-19.25"/>
-<text text-anchor="middle" x="187.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.32,-54.61C112.37,-46.6 127.27,-35.46 141.5,-27.62 143.57,-26.49 145.72,-25.38 147.92,-24.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.28,-27.54 156.98,-20.26 146.42,-21.15 149.28,-27.54"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d92/pancake__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/d92/pancake__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 436e42806..000000000
--- a/d3/d92/pancake__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="241pt" height="138pt"
- viewBox="0.00 0.00 241.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-74.25 73,-74.25 73,-55 105.5,-55 105.5,-74.25"/>
-<text text-anchor="middle" x="89.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-64.62C44.58,-64.62 53.31,-64.62 61.45,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-68.13 71.2,-64.63 61.2,-61.13 61.2,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.25,-130.25 141.5,-130.25 141.5,-111 233.25,-111 233.25,-130.25"/>
-<text text-anchor="middle" x="187.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.87,-74.6C111.89,-82.86 127,-94.52 141.5,-102.62 143.56,-103.78 145.71,-104.89 147.9,-105.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.39,-109.13 156.95,-110.04 149.27,-102.74 146.39,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="229.5,-93.25 145.25,-93.25 145.25,-74 229.5,-74 229.5,-93.25"/>
-<text text-anchor="middle" x="187.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-67.68C113.49,-69.22 123.45,-71.19 133.7,-73.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.86,-76.61 143.35,-75.12 134.22,-69.75 132.86,-76.61"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.12,-56.25 160.62,-56.25 160.62,-37 214.12,-37 214.12,-56.25"/>
-<text text-anchor="middle" x="187.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-61.73C117.45,-59.53 134.14,-56.41 149.29,-53.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.79,-57.04 158.98,-51.76 148.51,-50.16 149.79,-57.04"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="225,-19.25 149.75,-19.25 149.75,0 225,0 225,-19.25"/>
-<text text-anchor="middle" x="187.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.32,-54.61C112.37,-46.6 127.27,-35.46 141.5,-27.62 143.57,-26.49 145.72,-25.38 147.92,-24.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.28,-27.54 156.98,-20.26 146.42,-21.15 149.28,-27.54"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d92/pancake__sort_8cpp_source.html b/d3/d92/pancake__sort_8cpp_source.html
new file mode 100644
index 000000000..70a7d421c
--- /dev/null
+++ b/d3/d92/pancake__sort_8cpp_source.html
@@ -0,0 +1,233 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/pancake_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/d92/pancake__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">pancake_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/d92/pancake__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  <span class="comment">// for std::is_sorted</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cassert&gt;</span>    <span class="comment">// for std::assert</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;iostream&gt;</span>   <span class="comment">// for io operations</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;vector&gt;</span>     <span class="comment">// for std::vector</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/d10/namespacepancake__sort.html">pancake_sort</a> {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00043" data-start="{" data-end="}">
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="../../d3/d92/pancake__sort_8cpp.html#a99e27ad84ad43df9977776b1a8d5416e">   43</a></span><span class="keywordtype">void</span> reverse(std::vector&lt;T&gt; &amp;arr, <span class="keywordtype">int</span> start, <span class="keywordtype">int</span> end) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    T temp;  <span class="comment">// Temporary variable</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordflow">while</span> (start &lt;= end) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        temp = arr[start];</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        arr[start] = arr[end];</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        arr[end] = temp;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        start++;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        end--;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>}</div>
+</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00061" data-start="{" data-end="}">
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"><a class="line" href="../../d3/d92/pancake__sort_8cpp.html#abff90bc0f54e4f8ea5f0330471781bd5">   61</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/d92/pancake__sort_8cpp.html#abff90bc0f54e4f8ea5f0330471781bd5">pancakeSort</a>(std::vector&lt;T&gt; &amp;arr, <span class="keywordtype">int</span> size) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = size; i &gt; 1; --i) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordtype">int</span> max_index = 0, j = 0;  <span class="comment">// intialize some variables.</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        T max_value = 0;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <span class="keywordflow">for</span> (j = 0; j &lt; i; j++) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            <span class="keywordflow">if</span> (arr[j] &gt;= max_value) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>                max_value = arr[j];</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                max_index = j;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        }</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        <span class="keywordflow">if</span> (max_index != i - 1)  <span class="comment">// check for reversing</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            reverse(arr, 0, max_index);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            reverse(arr, 0, i - 1);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        }</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    }</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>}</div>
+</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>}  <span class="comment">// namespace pancake_sort</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="foldopen" id="foldopen00086" data-start="{" data-end="}">
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="../../d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   86</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="comment">// example 1: vector of int</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> size1 = 7;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest 1- as std::vector&lt;int&gt;...&quot;</span>;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    std::vector&lt;int&gt; arr1 = {23, 10, 20, 11, 12, 6, 7};</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    sorting::pancake_sort::pancakeSort(arr1, size1);</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    assert(std::is_sorted(arr1.begin(), arr1.end()));</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed\n&quot;</span>;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size1; i++) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        std::cout &lt;&lt; arr1[i] &lt;&lt; <span class="stringliteral">&quot; ,&quot;</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span> </div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="comment">// example 2: vector of double</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> size2 = 8;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest 2- as std::vector&lt;double&gt;...&quot;</span>;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    std::vector&lt;double&gt; arr2 = {23.56, 10.62, 200.78, 111.484,</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>                                3.9,   1.2,   61.77,  79.6};</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    sorting::pancake_sort::pancakeSort(arr2, size2);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    assert(std::is_sorted(arr2.begin(), arr2.end()));</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed\n&quot;</span>;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size2; i++) {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        std::cout &lt;&lt; arr2[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    }</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="comment">// example 3:vector of float</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> size3 = 7;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest 3- as std::vector&lt;float&gt;...&quot;</span>;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    std::vector&lt;float&gt; arr3 = {6.56, 12.62, 200.78, 768.484, 19.27, 68.87, 9.6};</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    sorting::pancake_sort::pancakeSort(arr3, size3);</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    assert(std::is_sorted(arr3.begin(), arr3.end()));</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed\n&quot;</span>;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size3; i++) {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        std::cout &lt;&lt; arr3[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    }</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00128" data-start="{" data-end="}">
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"><a class="line" href="../../d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  128</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    <a class="code hl_function" href="../../d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>}</div>
+</div>
+<div class="ttc" id="anamespacepancake__sort_html"><div class="ttname"><a href="../../df/d10/namespacepancake__sort.html">pancake_sort</a></div><div class="ttdoc">Functions for Pancake sort algorithm.</div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+<div class="ttc" id="apancake__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d3/d92/pancake__sort_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> <a href="#l00086">pancake_sort.cpp:86</a></div></div>
+<div class="ttc" id="apancake__sort_8cpp_html_abff90bc0f54e4f8ea5f0330471781bd5"><div class="ttname"><a href="../../d3/d92/pancake__sort_8cpp.html#abff90bc0f54e4f8ea5f0330471781bd5">sorting::pancake_sort::pancakeSort</a></div><div class="ttdeci">int pancakeSort(std::vector&lt; T &gt; &amp;arr, int size)</div><div class="ttdoc">This implementation is for a C-style array input that gets modified in place.</div><div class="ttdef"><b>Definition</b> <a href="#l00061">pancake_sort.cpp:61</a></div></div>
+<div class="ttc" id="apancake__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00128">pancake_sort.cpp:128</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d3/d92/pancake__sort_8cpp.html">pancake_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html
index 5e16ec20f..a8621a316 100644
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html
+++ b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::tree_234::Tree234 Class Reference</title>
+<title>TheAlgorithms/C++: data_structures::tree_234::Tree234 Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,7 +135,7 @@ $(function(){initNavTree('d3/d95/classdata__structures_1_1tree__234_1_1_tree234.
 <div class="dynheader">
 Collaboration diagram for data_structures::tree_234::Tree234:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.svg" width="355" height="332"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.svg" width="355" height="244"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
@@ -198,7 +215,7 @@ Private Member Functions</h2></td></tr>
 <tr class="memitem:a936bb546e6a94d8b9d35b30ee1bb291a" id="r_a936bb546e6a94d8b9d35b30ee1bb291a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a936bb546e6a94d8b9d35b30ee1bb291a">Traverse</a> (<a class="el" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *tree)</td></tr>
 <tr class="memdesc:a936bb546e6a94d8b9d35b30ee1bb291a"><td class="mdescLeft">&#160;</td><td class="mdescRight">In-order traverse the tree, print items.  <br /></td></tr>
 <tr class="separator:a936bb546e6a94d8b9d35b30ee1bb291a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af260f0760344771bf8fce4fc9b1739be" id="r_af260f0760344771bf8fce4fc9b1739be"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af260f0760344771bf8fce4fc9b1739be">PrintNode</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a> &amp;ofs, <a class="el" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="el" href="../../d5/da1/structnode.html">node</a>, int64_t parent_index, int64_t index, int8_t parent_child_index)</td></tr>
+<tr class="memitem:af260f0760344771bf8fce4fc9b1739be" id="r_af260f0760344771bf8fce4fc9b1739be"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af260f0760344771bf8fce4fc9b1739be">PrintNode</a> (std::ofstream &amp;ofs, <a class="el" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="el" href="../../d5/da1/structnode.html">node</a>, int64_t parent_index, int64_t index, int8_t parent_child_index)</td></tr>
 <tr class="memdesc:af260f0760344771bf8fce4fc9b1739be"><td class="mdescLeft">&#160;</td><td class="mdescRight">Print the tree to a dot file. You can convert it to picture with graphviz.  <br /></td></tr>
 <tr class="separator:af260f0760344771bf8fce4fc9b1739be"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
@@ -210,6 +227,8 @@ Private Attributes</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>2-3-4 tree class </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00323">323</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="ac4e7d1eb145af5e18b11c26f94a01e0e" name="ac4e7d1eb145af5e18b11c26f94a01e0e"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ac4e7d1eb145af5e18b11c26f94a01e0e">&#9670;&#160;</a></span>~Tree234()</h2>
@@ -225,9 +244,11 @@ Private Attributes</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00541">541</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  541</span>{ <a class="code hl_function" href="#a273511e84a5243ffffe81be28bd24855">DeleteNode</a>(<a class="code hl_variable" href="#a348ea76c7629b2dcf740be062f970a36">root_</a>); }</div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a273511e84a5243ffffe81be28bd24855"><div class="ttname"><a href="#a273511e84a5243ffffe81be28bd24855">data_structures::tree_234::Tree234::DeleteNode</a></div><div class="ttdeci">void DeleteNode(Node *tree)</div><div class="ttdoc">Recursive release the tree.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:547</div></div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a348ea76c7629b2dcf740be062f970a36"><div class="ttname"><a href="#a348ea76c7629b2dcf740be062f970a36">data_structures::tree_234::Tree234::root_</a></div><div class="ttdeci">Node * root_</div><div class="ttdoc">root node of the tree</div><div class="ttdef"><b>Definition</b> tree_234.cpp:538</div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a273511e84a5243ffffe81be28bd24855"><div class="ttname"><a href="#a273511e84a5243ffffe81be28bd24855">data_structures::tree_234::Tree234::DeleteNode</a></div><div class="ttdeci">void DeleteNode(Node *tree)</div><div class="ttdoc">Recursive release the tree.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00547">tree_234.cpp:547</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a348ea76c7629b2dcf740be062f970a36"><div class="ttname"><a href="#a348ea76c7629b2dcf740be062f970a36">data_structures::tree_234::Tree234::root_</a></div><div class="ttdeci">Node * root_</div><div class="ttdoc">root node of the tree</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00538">tree_234.cpp:538</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -262,6 +283,8 @@ Private Attributes</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00547">547</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  547</span>                                   {</div>
 <div class="line"><span class="lineno">  548</span>    <span class="keywordflow">if</span> (!tree) {</div>
 <div class="line"><span class="lineno">  549</span>        <span class="keywordflow">return</span>;</div>
@@ -272,12 +295,7 @@ Private Attributes</h2></td></tr>
 <div class="line"><span class="lineno">  554</span> </div>
 <div class="line"><span class="lineno">  555</span>    <span class="keyword">delete</span> tree;</div>
 <div class="line"><span class="lineno">  556</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.svg" width="392" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac85ba5abfd6d34dcd908b2afe6464657" name="ac85ba5abfd6d34dcd908b2afe6464657"></a>
@@ -311,24 +329,20 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>max item of the tree </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l01098">1098</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1098</span>                                          {</div>
 <div class="line"><span class="lineno"> 1099</span>    assert(tree);</div>
-<div class="line"><span class="lineno"> 1100</span>    int64_t <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">max</a> = 0;</div>
+<div class="line"><span class="lineno"> 1100</span>    int64_t max = 0;</div>
 <div class="line"><span class="lineno"> 1101</span> </div>
 <div class="line"><span class="lineno"> 1102</span>    <span class="keywordflow">while</span> (tree) {</div>
-<div class="line"><span class="lineno"> 1103</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">max</a> = tree-&gt;GetMaxItem();</div>
+<div class="line"><span class="lineno"> 1103</span>        max = tree-&gt;GetMaxItem();</div>
 <div class="line"><span class="lineno"> 1104</span>        tree = tree-&gt;GetRightmostChild();</div>
 <div class="line"><span class="lineno"> 1105</span>    }</div>
 <div class="line"><span class="lineno"> 1106</span> </div>
-<div class="line"><span class="lineno"> 1107</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">max</a>;</div>
+<div class="line"><span class="lineno"> 1107</span>    <span class="keywordflow">return</span> max;</div>
 <div class="line"><span class="lineno"> 1108</span>}</div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-</div><!-- 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="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.svg" width="476" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a65a1235659356166a3e9b451c64fcc36" name="a65a1235659356166a3e9b451c64fcc36"></a>
@@ -362,24 +376,20 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>min item of the tree </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l01115">1115</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1115</span>                                          {</div>
 <div class="line"><span class="lineno"> 1116</span>    assert(tree);</div>
-<div class="line"><span class="lineno"> 1117</span>    int64_t <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a> = 0;</div>
+<div class="line"><span class="lineno"> 1117</span>    int64_t min = 0;</div>
 <div class="line"><span class="lineno"> 1118</span> </div>
 <div class="line"><span class="lineno"> 1119</span>    <span class="keywordflow">while</span> (tree) {</div>
-<div class="line"><span class="lineno"> 1120</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a> = tree-&gt;GetMinItem();</div>
+<div class="line"><span class="lineno"> 1120</span>        min = tree-&gt;GetMinItem();</div>
 <div class="line"><span class="lineno"> 1121</span>        tree = tree-&gt;GetLeftmostChild();</div>
 <div class="line"><span class="lineno"> 1122</span>    }</div>
 <div class="line"><span class="lineno"> 1123</span> </div>
-<div class="line"><span class="lineno"> 1124</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a>;</div>
+<div class="line"><span class="lineno"> 1124</span>    <span class="keywordflow">return</span> min;</div>
 <div class="line"><span class="lineno"> 1125</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><!-- 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="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.svg" width="464" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6749ebb40710c9752a2771eda03c6b3e" name="a6749ebb40710c9752a2771eda03c6b3e"></a>
@@ -404,14 +414,11 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">  655</span>{ <a class="code hl_function" href="#a07811b3c564a3a443b106c9aa717629d">InsertPreSplit</a>(item); }</div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a07811b3c564a3a443b106c9aa717629d"><div class="ttname"><a href="#a07811b3c564a3a443b106c9aa717629d">data_structures::tree_234::Tree234::InsertPreSplit</a></div><div class="ttdeci">void InsertPreSplit(int64_t item)</div><div class="ttdoc">A insert implementation of pre-split.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:585</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.svg" width="100%" height="484"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00655">655</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  655</span>{ <a class="code hl_function" href="#a07811b3c564a3a443b106c9aa717629d">InsertPreSplit</a>(item); }</div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a07811b3c564a3a443b106c9aa717629d"><div class="ttname"><a href="#a07811b3c564a3a443b106c9aa717629d">data_structures::tree_234::Tree234::InsertPreSplit</a></div><div class="ttdeci">void InsertPreSplit(int64_t item)</div><div class="ttdoc">A insert implementation of pre-split.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00585">tree_234.cpp:585</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a02df91964915ca97609d35f847faff5f" name="a02df91964915ca97609d35f847faff5f"></a>
@@ -450,10 +457,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the node that split as the parent when overflow happen </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00663">663</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  663</span>                                              {</div>
 <div class="line"><span class="lineno">  664</span>    assert(tree != <span class="keyword">nullptr</span>);</div>
 <div class="line"><span class="lineno">  665</span> </div>
-<div class="line"><span class="lineno">  666</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr&lt;Node&gt;</a> split_node;</div>
+<div class="line"><span class="lineno">  666</span>    std::unique_ptr&lt;Node&gt; split_node;</div>
 <div class="line"><span class="lineno">  667</span> </div>
 <div class="line"><span class="lineno">  668</span>    <span class="keywordflow">if</span> (tree-&gt;Contains(item)) {</div>
 <div class="line"><span class="lineno">  669</span>        <span class="comment">// return nullptr indicate current node not overflow</span></div>
@@ -462,29 +471,21 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  672</span> </div>
 <div class="line"><span class="lineno">  673</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *next_node = tree-&gt;GetNextPossibleChild(item);</div>
 <div class="line"><span class="lineno">  674</span>    <span class="keywordflow">if</span> (next_node) {</div>
-<div class="line"><span class="lineno">  675</span>        split_node.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr/reset.html">reset</a>(<a class="code hl_function" href="#a6749ebb40710c9752a2771eda03c6b3e">Insert</a>(next_node, item));</div>
+<div class="line"><span class="lineno">  675</span>        split_node.reset(<a class="code hl_function" href="#a6749ebb40710c9752a2771eda03c6b3e">Insert</a>(next_node, item));</div>
 <div class="line"><span class="lineno">  676</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  677</span>        split_node.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr/reset.html">reset</a>(<span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(item));</div>
+<div class="line"><span class="lineno">  677</span>        split_node.reset(<span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(item));</div>
 <div class="line"><span class="lineno">  678</span>    }</div>
 <div class="line"><span class="lineno">  679</span> </div>
 <div class="line"><span class="lineno">  680</span>    <span class="keywordflow">if</span> (split_node) {</div>
-<div class="line"><span class="lineno">  681</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a11f0d016dff7f7e62b3dddb9fdf47805">MergeNode</a>(tree, split_node.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html">get</a>());</div>
+<div class="line"><span class="lineno">  681</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a11f0d016dff7f7e62b3dddb9fdf47805">MergeNode</a>(tree, split_node.get());</div>
 <div class="line"><span class="lineno">  682</span>    }</div>
 <div class="line"><span class="lineno">  683</span> </div>
 <div class="line"><span class="lineno">  684</span>    <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  685</span>}</div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a11f0d016dff7f7e62b3dddb9fdf47805"><div class="ttname"><a href="#a11f0d016dff7f7e62b3dddb9fdf47805">data_structures::tree_234::Tree234::MergeNode</a></div><div class="ttdeci">Node * MergeNode(Node *dst_node, Node *node)</div><div class="ttdoc">A helper function used during post-merge insert.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:700</div></div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a6749ebb40710c9752a2771eda03c6b3e"><div class="ttname"><a href="#a6749ebb40710c9752a2771eda03c6b3e">data_structures::tree_234::Tree234::Insert</a></div><div class="ttdeci">void Insert(int64_t item)</div><div class="ttdoc">Insert item to tree.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:655</div></div>
-<div class="ttc" id="aget_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html">std::unique_ptr::get</a></div><div class="ttdeci">T get(T... args)</div></div>
-<div class="ttc" id="areset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/unique_ptr/reset.html">std::unique_ptr::reset</a></div><div class="ttdeci">T reset(T... args)</div></div>
-<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</div></div>
-<div class="ttc" id="aunique_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a11f0d016dff7f7e62b3dddb9fdf47805"><div class="ttname"><a href="#a11f0d016dff7f7e62b3dddb9fdf47805">data_structures::tree_234::Tree234::MergeNode</a></div><div class="ttdeci">Node * MergeNode(Node *dst_node, Node *node)</div><div class="ttdoc">A helper function used during post-merge insert.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00700">tree_234.cpp:700</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a6749ebb40710c9752a2771eda03c6b3e"><div class="ttname"><a href="#a6749ebb40710c9752a2771eda03c6b3e">data_structures::tree_234::Tree234::Insert</a></div><div class="ttdeci">void Insert(int64_t item)</div><div class="ttdoc">Insert item to tree.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00655">tree_234.cpp:655</a></div></div>
+<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa7e5e00033f38006a224f30bdbf3f703" name="aa7e5e00033f38006a224f30bdbf3f703"></a>
@@ -517,6 +518,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00637">637</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  637</span>                                          {</div>
 <div class="line"><span class="lineno">  638</span>    <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#a348ea76c7629b2dcf740be062f970a36">root_</a>) {</div>
 <div class="line"><span class="lineno">  639</span>        <a class="code hl_variable" href="#a348ea76c7629b2dcf740be062f970a36">root_</a> = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(item);</div>
@@ -530,12 +533,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  647</span>        <a class="code hl_variable" href="#a348ea76c7629b2dcf740be062f970a36">root_</a> = split_node;</div>
 <div class="line"><span class="lineno">  648</span>    }</div>
 <div class="line"><span class="lineno">  649</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.svg" width="100%" height="484"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a07811b3c564a3a443b106c9aa717629d" name="a07811b3c564a3a443b106c9aa717629d"></a>
@@ -568,6 +566,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00585">585</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  585</span>                                         {</div>
 <div class="line"><span class="lineno">  586</span>    <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#a348ea76c7629b2dcf740be062f970a36">root_</a>) {</div>
 <div class="line"><span class="lineno">  587</span>        <a class="code hl_variable" href="#a348ea76c7629b2dcf740be062f970a36">root_</a> = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(item);</div>
@@ -579,7 +579,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  593</span> </div>
 <div class="line"><span class="lineno">  594</span>    <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
 <div class="line"><span class="lineno">  595</span>        <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
-<div class="line"><span class="lineno">  596</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr&lt;Node&gt;</a> tmp(<span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(item));</div>
+<div class="line"><span class="lineno">  596</span>            std::unique_ptr&lt;Node&gt; tmp(<span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(item));</div>
 <div class="line"><span class="lineno">  597</span>            <a class="code hl_function" href="#ad37e29e2a4a6cc0eb65cbd5595e1da95">MergeNodeNotFull</a>(parent, tmp.get());</div>
 <div class="line"><span class="lineno">  598</span>            <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  599</span>        }</div>
@@ -615,16 +615,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  629</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = parent-&gt;GetNextPossibleChild(item);</div>
 <div class="line"><span class="lineno">  630</span>    }</div>
 <div class="line"><span class="lineno">  631</span>}</div>
-<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a370b625ca9f16bbef2b65e024ef78ea9"><div class="ttname"><a href="#a370b625ca9f16bbef2b65e024ef78ea9">data_structures::tree_234::Tree234::SplitNode</a></div><div class="ttdeci">Node * SplitNode(Node *node)</div><div class="ttdoc">Split a 4-node to 1 parent and 2 children, and return the parent node.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:745</div></div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_ad37e29e2a4a6cc0eb65cbd5595e1da95"><div class="ttname"><a href="#ad37e29e2a4a6cc0eb65cbd5595e1da95">data_structures::tree_234::Tree234::MergeNodeNotFull</a></div><div class="ttdeci">void MergeNodeNotFull(Node *dst_node, Node *node)</div><div class="ttdoc">Merge node to a not-full target node.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:730</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.svg" width="100%" height="484"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a370b625ca9f16bbef2b65e024ef78ea9"><div class="ttname"><a href="#a370b625ca9f16bbef2b65e024ef78ea9">data_structures::tree_234::Tree234::SplitNode</a></div><div class="ttdeci">Node * SplitNode(Node *node)</div><div class="ttdoc">Split a 4-node to 1 parent and 2 children, and return the parent node.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00745">tree_234.cpp:745</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_ad37e29e2a4a6cc0eb65cbd5595e1da95"><div class="ttname"><a href="#ad37e29e2a4a6cc0eb65cbd5595e1da95">data_structures::tree_234::Tree234::MergeNodeNotFull</a></div><div class="ttdeci">void MergeNodeNotFull(Node *dst_node, Node *node)</div><div class="ttdoc">Merge node to a not-full target node.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00730">tree_234.cpp:730</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae58dca20f08eaf9313f6e7b0869c2d0e" name="ae58dca20f08eaf9313f6e7b0869c2d0e"></a>
@@ -663,19 +658,20 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00869">869</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  869</span>                                                   {</div>
 <div class="line"><span class="lineno">  870</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *left = parent-&gt;GetItemLeftChild(index);</div>
-<div class="line"><span class="lineno">  871</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a> = parent-&gt;GetItemRightChild(index);</div>
+<div class="line"><span class="lineno">  871</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *right = parent-&gt;GetItemRightChild(index);</div>
 <div class="line"><span class="lineno">  872</span> </div>
-<div class="line"><span class="lineno">  873</span>    assert(right &amp;&amp; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>-&gt;Is34Node());</div>
+<div class="line"><span class="lineno">  873</span>    assert(right &amp;&amp; right-&gt;Is34Node());</div>
 <div class="line"><span class="lineno">  874</span>    assert(left &amp;&amp; left-&gt;Is2Node());</div>
 <div class="line"><span class="lineno">  875</span> </div>
 <div class="line"><span class="lineno">  876</span>    left-&gt;InsertItemByIndex(left-&gt;GetCount(), parent-&gt;GetItem(index),</div>
-<div class="line"><span class="lineno">  877</span>                            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>-&gt;GetLeftmostChild(), <span class="keyword">false</span>);</div>
-<div class="line"><span class="lineno">  878</span>    parent-&gt;SetItem(index, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>-&gt;GetMinItem());</div>
-<div class="line"><span class="lineno">  879</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>-&gt;RemoveItemByIndex(0, <span class="keyword">false</span>);</div>
+<div class="line"><span class="lineno">  877</span>                            right-&gt;GetLeftmostChild(), <span class="keyword">false</span>);</div>
+<div class="line"><span class="lineno">  878</span>    parent-&gt;SetItem(index, right-&gt;GetMinItem());</div>
+<div class="line"><span class="lineno">  879</span>    right-&gt;RemoveItemByIndex(0, <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">  880</span>}</div>
-<div class="ttc" id="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::right</a></div><div class="ttdeci">T right(T... args)</div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -716,6 +712,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the merged 4-node </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00895">895</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  895</span>                                               {</div>
 <div class="line"><span class="lineno">  896</span>    assert(parent);</div>
 <div class="line"><span class="lineno">  897</span> </div>
@@ -744,12 +742,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  920</span> </div>
 <div class="line"><span class="lineno">  921</span>    <span class="keywordflow">return</span> left_child;</div>
 <div class="line"><span class="lineno">  922</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.svg" width="359" height="379"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a11f0d016dff7f7e62b3dddb9fdf47805" name="a11f0d016dff7f7e62b3dddb9fdf47805"></a>
@@ -789,6 +782,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>overflow node of this level </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00700">700</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  700</span>                                                   {</div>
 <div class="line"><span class="lineno">  701</span>    assert(dst_node != <span class="keyword">nullptr</span> &amp;&amp; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> != <span class="keyword">nullptr</span>);</div>
 <div class="line"><span class="lineno">  702</span> </div>
@@ -808,12 +803,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  716</span> </div>
 <div class="line"><span class="lineno">  717</span>    <span class="keywordflow">return</span> dst_node;</div>
 <div class="line"><span class="lineno">  718</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.svg" width="100%" height="561"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad37e29e2a4a6cc0eb65cbd5595e1da95" name="ad37e29e2a4a6cc0eb65cbd5595e1da95"></a>
@@ -852,6 +842,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00730">730</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  730</span>                                                         {</div>
 <div class="line"><span class="lineno">  731</span>    assert(dst_node &amp;&amp; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> &amp;&amp; !dst_node-&gt;IsFull() &amp;&amp; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;Is2Node());</div>
 <div class="line"><span class="lineno">  732</span> </div>
@@ -860,12 +852,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  735</span>    dst_node-&gt;SetChild(i, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetChild(0));</div>
 <div class="line"><span class="lineno">  736</span>    dst_node-&gt;SetChild(i + 1, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetChild(1));</div>
 <div class="line"><span class="lineno">  737</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.svg" width="100%" height="478"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2e9a9db7792cf5383f4c4cc418255165" name="a2e9a9db7792cf5383f4c4cc418255165"></a>
@@ -893,16 +880,18 @@ Here is the call graph for this function:</div>
 <p>This is a helper structure to do a level order traversal to print the tree.</p>
 <p>&lt; tree node</p>
 <p>&lt; node index of level order that used when draw the link between child and parent</p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l01131">1131</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1131</span>                                         {</div>
 <div class="line"><span class="lineno"> 1132</span>    <span class="keywordflow">if</span> (!file_name) {</div>
 <div class="line"><span class="lineno"> 1133</span>        file_name = <span class="stringliteral">&quot;out.dot&quot;</span>;</div>
 <div class="line"><span class="lineno"> 1134</span>    }</div>
 <div class="line"><span class="lineno"> 1135</span> </div>
-<div class="line"><span class="lineno"> 1136</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a> ofs;</div>
+<div class="line"><span class="lineno"> 1136</span>    std::ofstream ofs;</div>
 <div class="line"><span class="lineno"> 1137</span> </div>
-<div class="line"><span class="lineno"> 1138</span>    ofs.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html">open</a>(file_name);</div>
+<div class="line"><span class="lineno"> 1138</span>    ofs.open(file_name);</div>
 <div class="line"><span class="lineno"> 1139</span>    <span class="keywordflow">if</span> (!ofs) {</div>
-<div class="line"><span class="lineno"> 1140</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;create tree dot file failed, &quot;</span> &lt;&lt; file_name &lt;&lt; <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"> 1140</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;create tree dot file failed, &quot;</span> &lt;&lt; file_name &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno"> 1141</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno"> 1142</span>    }</div>
 <div class="line"><span class="lineno"> 1143</span> </div>
@@ -910,16 +899,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno"> 1145</span>    ofs &lt;&lt; <span class="stringliteral">&quot;node [shape=record]\n&quot;</span>;</div>
 <div class="line"><span class="lineno"> 1146</span> </div>
 <div class="line"><span class="lineno"> 1147</span>    int64_t index = 0;</div>
-<div class="line"><span class="lineno"> 1148</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno"> 1149</span><span class="comment">    /** @brief This is a helper structure to do a level order traversal to print</span></div>
-<div class="line"><span class="lineno"> 1150</span><span class="comment">     * the tree. */</span></div>
+<div class="line"><span class="lineno"> 1148</span> </div>
 <div class="line"><span class="lineno"> 1151</span>    <span class="keyword">struct </span>NodeInfo {</div>
-<div class="line"><span class="lineno"> 1152</span>        <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;     <span class="comment">///&lt; tree node</span></div>
-<div class="line"><span class="lineno"> 1153</span>        int64_t index;  <span class="comment">///&lt; node index of level order that used when draw the</span><span class="comment"></span></div>
-<div class="line"><span class="lineno"> 1154</span><span class="comment">                        ///&lt; link between child and parent</span></div>
-<div class="line"><span class="lineno"> 1155</span><span class="comment"></span>    };</div>
+<div class="line"><span class="lineno"> 1152</span>        <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;     </div>
+<div class="line"><span class="lineno"> 1153</span>        int64_t index;  </div>
+<div class="line"><span class="lineno"> 1155</span>    };</div>
 <div class="line"><span class="lineno"> 1156</span> </div>
-<div class="line"><span class="lineno"> 1157</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue&lt;NodeInfo&gt;</a> q;</div>
+<div class="line"><span class="lineno"> 1157</span>    std::queue&lt;NodeInfo&gt; q;</div>
 <div class="line"><span class="lineno"> 1158</span> </div>
 <div class="line"><span class="lineno"> 1159</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a348ea76c7629b2dcf740be062f970a36">root_</a>) {</div>
 <div class="line"><span class="lineno"> 1160</span>        <span class="comment">// print root node</span></div>
@@ -972,21 +958,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno"> 1207</span>    }</div>
 <div class="line"><span class="lineno"> 1208</span> </div>
 <div class="line"><span class="lineno"> 1209</span>    ofs &lt;&lt; <span class="stringliteral">&quot;}\n&quot;</span>;</div>
-<div class="line"><span class="lineno"> 1210</span>    ofs.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html">close</a>();</div>
+<div class="line"><span class="lineno"> 1210</span>    ofs.close();</div>
 <div class="line"><span class="lineno"> 1211</span>}</div>
-<div class="ttc" id="abasic_ofstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_af260f0760344771bf8fce4fc9b1739be"><div class="ttname"><a href="#af260f0760344771bf8fce4fc9b1739be">data_structures::tree_234::Tree234::PrintNode</a></div><div class="ttdeci">void PrintNode(std::ofstream &amp;ofs, Node *node, int64_t parent_index, int64_t index, int8_t parent_child_index)</div><div class="ttdoc">Print the tree to a dot file. You can convert it to picture with graphviz.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:1226</div></div>
-<div class="ttc" id="aclose_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html">std::ofstream::close</a></div><div class="ttdeci">T close(T... args)</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="aopen_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html">std::ofstream::open</a></div><div class="ttdeci">T open(T... args)</div></div>
-<div class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.svg" width="371" height="200"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_af260f0760344771bf8fce4fc9b1739be"><div class="ttname"><a href="#af260f0760344771bf8fce4fc9b1739be">data_structures::tree_234::Tree234::PrintNode</a></div><div class="ttdeci">void PrintNode(std::ofstream &amp;ofs, Node *node, int64_t parent_index, int64_t index, int8_t parent_child_index)</div><div class="ttdoc">Print the tree to a dot file. You can convert it to picture with graphviz.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l01226">tree_234.cpp:1226</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af260f0760344771bf8fce4fc9b1739be" name="af260f0760344771bf8fce4fc9b1739be"></a>
@@ -1001,7 +976,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void data_structures::tree_234::Tree234::PrintNode </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>ofs</em></span>, </td>
+          <td class="paramtype">std::ofstream &amp;</td>          <td class="paramname"><span class="paramname"><em>ofs</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -1042,6 +1017,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l01226">1226</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1227</span>                                                                  {</div>
 <div class="line"><span class="lineno"> 1228</span>    assert(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
 <div class="line"><span class="lineno"> 1229</span> </div>
@@ -1098,14 +1075,11 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if item found and removed, false otherwise </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  929</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a61dd051a74e5f36c8dc03dae8dca6ef4">RemovePreMerge</a>(<a class="code hl_variable" href="#a348ea76c7629b2dcf740be062f970a36">root_</a>, item); }</div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a61dd051a74e5f36c8dc03dae8dca6ef4"><div class="ttname"><a href="#a61dd051a74e5f36c8dc03dae8dca6ef4">data_structures::tree_234::Tree234::RemovePreMerge</a></div><div class="ttdeci">bool RemovePreMerge(Node *node, int64_t item)</div><div class="ttdoc">Main function implement the pre-merge remove operation.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:937</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00929">929</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  929</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a61dd051a74e5f36c8dc03dae8dca6ef4">RemovePreMerge</a>(<a class="code hl_variable" href="#a348ea76c7629b2dcf740be062f970a36">root_</a>, item); }</div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a61dd051a74e5f36c8dc03dae8dca6ef4"><div class="ttname"><a href="#a61dd051a74e5f36c8dc03dae8dca6ef4">data_structures::tree_234::Tree234::RemovePreMerge</a></div><div class="ttdeci">bool RemovePreMerge(Node *node, int64_t item)</div><div class="ttdoc">Main function implement the pre-merge remove operation.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00937">tree_234.cpp:937</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a61dd051a74e5f36c8dc03dae8dca6ef4" name="a61dd051a74e5f36c8dc03dae8dca6ef4"></a>
@@ -1144,6 +1118,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if remove success, false otherwise </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00937">937</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  937</span>                                                     {</div>
 <div class="line"><span class="lineno">  938</span>    <span class="keywordflow">while</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
 <div class="line"><span class="lineno">  939</span>        <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;IsLeaf()) {</div>
@@ -1299,19 +1275,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno"> 1089</span> </div>
 <div class="line"><span class="lineno"> 1090</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno"> 1091</span>}</div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a36f4d5f603f7edb7db7c73fb53ba14e9"><div class="ttname"><a href="#a36f4d5f603f7edb7db7c73fb53ba14e9">data_structures::tree_234::Tree234::Merge</a></div><div class="ttdeci">Node * Merge(Node *parent, int8_t index)</div><div class="ttdoc">Merge the item at index of the parent node, and its left and right child.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:895</div></div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a65a1235659356166a3e9b451c64fcc36"><div class="ttname"><a href="#a65a1235659356166a3e9b451c64fcc36">data_structures::tree_234::Tree234::GetTreeMinItem</a></div><div class="ttdeci">int64_t GetTreeMinItem(Node *tree)</div><div class="ttdoc">Get the min item of the tree.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:1115</div></div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_ac5361479dd996eb331759f33808657d9"><div class="ttname"><a href="#ac5361479dd996eb331759f33808657d9">data_structures::tree_234::Tree234::TryLeftRotate</a></div><div class="ttdeci">bool TryLeftRotate(Node *parent, Node *to_child)</div><div class="ttdoc">A handy function to try if we can do a left rotate to the target node.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:778</div></div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_ac85ba5abfd6d34dcd908b2afe6464657"><div class="ttname"><a href="#ac85ba5abfd6d34dcd908b2afe6464657">data_structures::tree_234::Tree234::GetTreeMaxItem</a></div><div class="ttdeci">int64_t GetTreeMaxItem(Node *tree)</div><div class="ttdoc">Get the max item of the tree.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:1098</div></div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_ae58dca20f08eaf9313f6e7b0869c2d0e"><div class="ttname"><a href="#ae58dca20f08eaf9313f6e7b0869c2d0e">data_structures::tree_234::Tree234::LeftRotate</a></div><div class="ttdeci">void LeftRotate(Node *parent, int8_t index)</div><div class="ttdoc">Do the actual left rotate operation.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:869</div></div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_ae68f8e62be02657c1287def6b38d7cc9"><div class="ttname"><a href="#ae68f8e62be02657c1287def6b38d7cc9">data_structures::tree_234::Tree234::RightRotate</a></div><div class="ttdeci">void RightRotate(Node *parent, int8_t index)</div><div class="ttdoc">Do the actual right rotate operation.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:845</div></div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_aec0642d1d151521ca7c70ea85cdb15d3"><div class="ttname"><a href="#aec0642d1d151521ca7c70ea85cdb15d3">data_structures::tree_234::Tree234::TryRightRotate</a></div><div class="ttdeci">bool TryRightRotate(Node *parent, Node *to_child)</div><div class="ttdoc">A handy function to try if we can do a right rotate to the target node.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:813</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a36f4d5f603f7edb7db7c73fb53ba14e9"><div class="ttname"><a href="#a36f4d5f603f7edb7db7c73fb53ba14e9">data_structures::tree_234::Tree234::Merge</a></div><div class="ttdeci">Node * Merge(Node *parent, int8_t index)</div><div class="ttdoc">Merge the item at index of the parent node, and its left and right child.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00895">tree_234.cpp:895</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a65a1235659356166a3e9b451c64fcc36"><div class="ttname"><a href="#a65a1235659356166a3e9b451c64fcc36">data_structures::tree_234::Tree234::GetTreeMinItem</a></div><div class="ttdeci">int64_t GetTreeMinItem(Node *tree)</div><div class="ttdoc">Get the min item of the tree.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l01115">tree_234.cpp:1115</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_ac5361479dd996eb331759f33808657d9"><div class="ttname"><a href="#ac5361479dd996eb331759f33808657d9">data_structures::tree_234::Tree234::TryLeftRotate</a></div><div class="ttdeci">bool TryLeftRotate(Node *parent, Node *to_child)</div><div class="ttdoc">A handy function to try if we can do a left rotate to the target node.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00778">tree_234.cpp:778</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_ac85ba5abfd6d34dcd908b2afe6464657"><div class="ttname"><a href="#ac85ba5abfd6d34dcd908b2afe6464657">data_structures::tree_234::Tree234::GetTreeMaxItem</a></div><div class="ttdeci">int64_t GetTreeMaxItem(Node *tree)</div><div class="ttdoc">Get the max item of the tree.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l01098">tree_234.cpp:1098</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_ae58dca20f08eaf9313f6e7b0869c2d0e"><div class="ttname"><a href="#ae58dca20f08eaf9313f6e7b0869c2d0e">data_structures::tree_234::Tree234::LeftRotate</a></div><div class="ttdeci">void LeftRotate(Node *parent, int8_t index)</div><div class="ttdoc">Do the actual left rotate operation.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00869">tree_234.cpp:869</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_ae68f8e62be02657c1287def6b38d7cc9"><div class="ttname"><a href="#ae68f8e62be02657c1287def6b38d7cc9">data_structures::tree_234::Tree234::RightRotate</a></div><div class="ttdeci">void RightRotate(Node *parent, int8_t index)</div><div class="ttdoc">Do the actual right rotate operation.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00845">tree_234.cpp:845</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_aec0642d1d151521ca7c70ea85cdb15d3"><div class="ttname"><a href="#aec0642d1d151521ca7c70ea85cdb15d3">data_structures::tree_234::Tree234::TryRightRotate</a></div><div class="ttdeci">bool TryRightRotate(Node *parent, Node *to_child)</div><div class="ttdoc">A handy function to try if we can do a right rotate to the target node.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00813">tree_234.cpp:813</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae68f8e62be02657c1287def6b38d7cc9" name="ae68f8e62be02657c1287def6b38d7cc9"></a>
@@ -1350,14 +1321,16 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00845">845</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  845</span>                                                    {</div>
 <div class="line"><span class="lineno">  846</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *left = parent-&gt;GetItemLeftChild(index);</div>
-<div class="line"><span class="lineno">  847</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a> = parent-&gt;GetItemRightChild(index);</div>
+<div class="line"><span class="lineno">  847</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *right = parent-&gt;GetItemRightChild(index);</div>
 <div class="line"><span class="lineno">  848</span> </div>
 <div class="line"><span class="lineno">  849</span>    assert(left &amp;&amp; left-&gt;Is34Node());</div>
-<div class="line"><span class="lineno">  850</span>    assert(right &amp;&amp; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>-&gt;Is2Node());</div>
+<div class="line"><span class="lineno">  850</span>    assert(right &amp;&amp; right-&gt;Is2Node());</div>
 <div class="line"><span class="lineno">  851</span> </div>
-<div class="line"><span class="lineno">  852</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>-&gt;InsertItemByIndex(0, parent-&gt;GetItem(index),</div>
+<div class="line"><span class="lineno">  852</span>    right-&gt;InsertItemByIndex(0, parent-&gt;GetItem(index),</div>
 <div class="line"><span class="lineno">  853</span>                             left-&gt;GetRightmostChild(), <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">  854</span>    parent-&gt;SetItem(index, left-&gt;GetMaxItem());</div>
 <div class="line"><span class="lineno">  855</span>    left-&gt;RemoveItemByIndex(left-&gt;GetCount() - 1, <span class="keyword">true</span>);</div>
@@ -1396,14 +1369,16 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>split parent node </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00745">745</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  745</span>                                   {</div>
 <div class="line"><span class="lineno">  746</span>    assert(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetCount() == 3);</div>
 <div class="line"><span class="lineno">  747</span> </div>
 <div class="line"><span class="lineno">  748</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *left = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
 <div class="line"><span class="lineno">  749</span> </div>
-<div class="line"><span class="lineno">  750</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a> = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItem(2));</div>
-<div class="line"><span class="lineno">  751</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>-&gt;SetChild(0, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetChild(2));</div>
-<div class="line"><span class="lineno">  752</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>-&gt;SetChild(1, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetChild(3));</div>
+<div class="line"><span class="lineno">  750</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *right = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItem(2));</div>
+<div class="line"><span class="lineno">  751</span>    right-&gt;SetChild(0, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetChild(2));</div>
+<div class="line"><span class="lineno">  752</span>    right-&gt;SetChild(1, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetChild(3));</div>
 <div class="line"><span class="lineno">  753</span> </div>
 <div class="line"><span class="lineno">  754</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *parent = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItem(1));</div>
 <div class="line"><span class="lineno">  755</span>    parent-&gt;SetChild(0, left);</div>
@@ -1439,17 +1414,14 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00562">562</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  562</span>                       {</div>
 <div class="line"><span class="lineno">  563</span>    <a class="code hl_function" href="#a84ab7b4fe7442b5e2eeed8c050bb86bd">Traverse</a>(<a class="code hl_variable" href="#a348ea76c7629b2dcf740be062f970a36">root_</a>);</div>
-<div class="line"><span class="lineno">  564</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  564</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  565</span>}</div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a84ab7b4fe7442b5e2eeed8c050bb86bd"><div class="ttname"><a href="#a84ab7b4fe7442b5e2eeed8c050bb86bd">data_structures::tree_234::Tree234::Traverse</a></div><div class="ttdeci">void Traverse()</div><div class="ttdoc">In-order traverse.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:562</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.svg" width="294" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a84ab7b4fe7442b5e2eeed8c050bb86bd"><div class="ttname"><a href="#a84ab7b4fe7442b5e2eeed8c050bb86bd">data_structures::tree_234::Tree234::Traverse</a></div><div class="ttdeci">void Traverse()</div><div class="ttdoc">In-order traverse.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00562">tree_234.cpp:562</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a936bb546e6a94d8b9d35b30ee1bb291a" name="a936bb546e6a94d8b9d35b30ee1bb291a"></a>
@@ -1482,6 +1454,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00567">567</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  567</span>                                 {</div>
 <div class="line"><span class="lineno">  568</span>    <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
 <div class="line"><span class="lineno">  569</span>        <span class="keywordflow">return</span>;</div>
@@ -1490,17 +1464,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  572</span>    int8_t i = 0;</div>
 <div class="line"><span class="lineno">  573</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetCount(); i++) {</div>
 <div class="line"><span class="lineno">  574</span>        <a class="code hl_function" href="#a84ab7b4fe7442b5e2eeed8c050bb86bd">Traverse</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetChild(i));</div>
-<div class="line"><span class="lineno">  575</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItem(i) &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><span class="lineno">  575</span>        std::cout &lt;&lt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItem(i) &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
 <div class="line"><span class="lineno">  576</span>    }</div>
 <div class="line"><span class="lineno">  577</span> </div>
 <div class="line"><span class="lineno">  578</span>    <a class="code hl_function" href="#a84ab7b4fe7442b5e2eeed8c050bb86bd">Traverse</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetChild(i));</div>
 <div class="line"><span class="lineno">  579</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.svg" width="506" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac5361479dd996eb331759f33808657d9" name="ac5361479dd996eb331759f33808657d9"></a>
@@ -1540,6 +1509,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if we successfully do the rotate. false if the requirements are not fulfilled. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00778">778</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  778</span>                                                        {</div>
 <div class="line"><span class="lineno">  779</span>    <span class="keywordtype">int</span> to_child_index = parent-&gt;GetChildIndex(to_child);</div>
 <div class="line"><span class="lineno">  780</span> </div>
@@ -1559,12 +1530,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  794</span> </div>
 <div class="line"><span class="lineno">  795</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  796</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.svg" width="424" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aec0642d1d151521ca7c70ea85cdb15d3" name="aec0642d1d151521ca7c70ea85cdb15d3"></a>
@@ -1604,6 +1570,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if we successfully do the rotate. false if the requirements are not fulfilled. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00813">813</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  813</span>                                                         {</div>
 <div class="line"><span class="lineno">  814</span>    int8_t to_child_index = parent-&gt;GetChildIndex(to_child);</div>
 <div class="line"><span class="lineno">  815</span> </div>
@@ -1623,12 +1591,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  829</span> </div>
 <div class="line"><span class="lineno">  830</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  831</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.svg" width="443" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
@@ -1653,12 +1616,14 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>root node of the tree </p>
-<div class="fragment"><div class="line"><span class="lineno">  538</span>{<span class="keyword">nullptr</span>};  <span class="comment">///&lt; root node of the tree</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00538">538</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  538</span>{<span class="keyword">nullptr</span>};  </div>
 </div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../db/dbc/tree__234_8cpp.html">tree_234.cpp</a></li>
+<li>data_structures/<a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.map
deleted file mode 100644
index 146b2020e..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.map
+++ /dev/null
@@ -1,39 +0,0 @@
-<map id="data_structures::tree_234::Tree234::Insert" name="data_structures::tree_234::Tree234::Insert">
-<area shape="rect" id="Node000001" title="A helper function used by post&#45;merge insert." alt="" coords="5,143,151,183"/>
-<area shape="rect" id="Node000002" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" title="Check if item is in the node." alt="" coords="1182,5,1330,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="96,140,140,100,167,81,198,65,288,33,363,22,439,21,536,23,793,23,1166,23,1166,28,793,28,536,28,439,27,363,27,290,38,200,69,170,85,143,105,100,144"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/unique_ptr/get.html#" title=" " alt="" coords="725,64,859,89"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="109,140,150,117,198,99,266,84,337,73,477,62,606,61,710,66,710,72,606,67,478,67,337,78,267,89,199,104,153,122,112,144"/>
-<area shape="rect" id="Node000004" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46" title="Get next node which is possibly contains item." alt="" coords="199,228,394,284"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="129,181,217,219,214,224,127,186"/>
-<area shape="rect" id="Node000005" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e" title="Insert item to tree." alt="" coords="224,113,369,154"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="151,151,208,143,209,148,152,156"/>
-<area shape="rect" id="Node000013" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805" title="A helper function used during post&#45;merge insert." alt="" coords="448,207,627,247"/>
-<area shape="poly" id="edge15_Node000001_Node000013" title=" " alt="" coords="152,170,433,210,432,215,151,176"/>
-<area shape="rect" id="Node000016" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/unique_ptr/reset.html#" title=" " alt="" coords="224,309,368,334"/>
-<area shape="poly" id="edge21_Node000001_Node000016" title=" " alt="" coords="94,182,137,238,166,269,200,294,212,300,209,305,197,299,163,273,133,242,90,185"/>
-<area shape="rect" id="Node000006" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d" title="A insert implementation of pre&#45;split." alt="" coords="442,113,633,154"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="369,131,426,131,426,136,369,136"/>
-<area shape="poly" id="edge6_Node000006_Node000003" title=" " alt="" coords="630,110,716,91,717,96,632,115"/>
-<area shape="rect" id="Node000007" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" title="Merge node to a not&#45;full target node." alt="" coords="681,179,903,219"/>
-<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="620,152,696,172,695,177,619,157"/>
-<area shape="rect" id="Node000012" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node." alt="" coords="707,113,877,154"/>
-<area shape="poly" id="edge14_Node000006_Node000012" title=" " alt="" coords="634,131,692,131,692,136,634,136"/>
-<area shape="rect" id="Node000008" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" title="Insert item to the proper position of the node and return the position index." alt="" coords="951,63,1106,103"/>
-<area shape="poly" id="edge8_Node000007_Node000008" title=" " alt="" coords="876,176,901,163,916,152,925,140,934,127,949,114,957,109,960,113,952,118,938,131,929,143,920,156,904,168,879,180"/>
-<area shape="rect" id="Node000010" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" title="Check if node is a full (4&#45;node)" alt="" coords="1185,185,1326,226"/>
-<area shape="poly" id="edge12_Node000007_Node000010" title=" " alt="" coords="903,198,1169,202,1169,207,903,203"/>
-<area shape="rect" id="Node000011" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" title="Set child pointer to the position of index." alt="" coords="955,128,1102,169"/>
-<area shape="poly" id="edge13_Node000007_Node000011" title=" " alt="" coords="889,175,939,165,941,170,891,181"/>
-<area shape="poly" id="edge9_Node000008_Node000002" title=" " alt="" coords="1106,61,1166,46,1167,51,1107,66"/>
-<area shape="rect" id="Node000009" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" title="Insert a value to the index position." alt="" coords="1154,71,1357,111"/>
-<area shape="poly" id="edge10_Node000008_Node000009" title=" " alt="" coords="1106,83,1138,84,1138,90,1106,88"/>
-<area shape="poly" id="edge11_Node000008_Node000010" title=" " alt="" coords="1081,102,1107,114,1211,175,1209,179,1105,119,1079,106"/>
-<area shape="poly" id="edge19_Node000013_Node000007" title=" " alt="" coords="627,214,665,210,666,216,628,220"/>
-<area shape="poly" id="edge18_Node000013_Node000010" title=" " alt="" coords="628,227,681,228,792,230,903,228,1043,221,1169,211,1169,216,1044,226,903,234,792,236,681,234,628,233"/>
-<area shape="poly" id="edge20_Node000013_Node000012" title=" " alt="" coords="584,204,680,165,704,157,705,162,682,169,586,209"/>
-<area shape="rect" id="Node000014" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" title="Get the child pointer at position of index." alt="" coords="718,359,866,399"/>
-<area shape="poly" id="edge16_Node000013_Node000014" title=" " alt="" coords="561,246,613,295,647,321,683,343,705,354,703,358,680,348,644,325,610,299,557,250"/>
-<area shape="rect" id="Node000015" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" title="Get item of the \index index." alt="" coords="720,293,864,334"/>
-<area shape="poly" id="edge17_Node000013_Node000015" title=" " alt="" coords="601,245,716,285,715,290,599,251"/>
-</map>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.md5
deleted file mode 100644
index ee2366c6b..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8dc392f2cbd5a2e8da1b305ad1b38d4a
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.svg
deleted file mode 100644
index 78c709456..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph.svg
+++ /dev/null
@@ -1,443 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::Insert Pages: 1 -->
-<!--zoomable 304 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 1022;
-var viewHeight = 304;
-var sectionId = 'dynsection-5';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>data_structures::tree_234::Tree234::Insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A helper function used by post&#45;merge insert.">
-<polygon fill="#999999" stroke="#666666" points="109,-192.5 0,-192.5 0,-162 109,-162 109,-192.5"/>
-<text text-anchor="start" x="8" y="-179" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="54.5" y="-167.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="993.38,-295.5 882.12,-295.5 882.12,-265 993.38,-265 993.38,-295.5"/>
-<text text-anchor="start" x="890.12" y="-282" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="937.75" y="-270.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.6,-192.91C85.93,-209.92 114.5,-236.37 145,-249.25 249.46,-293.37 284.85,-280.25 398.25,-280.25 398.25,-280.25 398.25,-280.25 591,-280.25 688.23,-280.25 800.84,-280.25 870.44,-280.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="870.15,-283.75 880.15,-280.25 870.15,-276.75 870.15,-283.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="640,-251.88 540,-251.88 540,-232.62 640,-232.62 640,-251.88"/>
-<text text-anchor="middle" x="590" y="-238.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr::get</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.04,-192.94C96.45,-203.63 121.19,-216.95 145,-223.25 278.17,-258.5 441.55,-253.82 528.23,-247.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="528.46,-251.26 538.18,-247.04 527.95,-244.28 528.46,-251.26"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46" target="_top" xlink:title="Get next node which is possibly contains item.">
-<polygon fill="white" stroke="#666666" points="291.5,-128.12 145,-128.12 145,-86.38 291.5,-86.38 291.5,-128.12"/>
-<text text-anchor="start" x="153" y="-114.62" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="start" x="153" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetNextPossible</text>
-<text text-anchor="middle" x="218.25" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">Child</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.8,-161.54C111.18,-153.15 135.52,-142.62 157.6,-133.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.71,-136.4 166.5,-129.21 155.93,-129.97 158.71,-136.4"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e" target="_top" xlink:title="Insert item to tree.">
-<polygon fill="white" stroke="#666666" points="272.75,-214.5 163.75,-214.5 163.75,-184 272.75,-184 272.75,-214.5"/>
-<text text-anchor="start" x="171.75" y="-201" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="218.25" y="-189.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.36,-184.58C123.07,-186.44 137.94,-188.46 152.14,-190.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.47,-193.84 161.85,-191.71 152.41,-186.9 151.47,-193.84"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805" target="_top" xlink:title="A helper function used during post&#45;merge insert.">
-<polygon fill="white" stroke="#666666" points="466.5,-144.5 332,-144.5 332,-114 466.5,-114 466.5,-144.5"/>
-<text text-anchor="start" x="340" y="-131" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="399.25" y="-119.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node13 -->
-<g id="edge15_Node000001_Node000013" class="edge">
-<title>Node1&#45;&gt;Node13</title>
-<g id="a_edge15_Node000001_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.43,-169.7C166.16,-161.75 255.98,-149.17 320.39,-140.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.79,-143.63 330.21,-138.78 319.82,-136.7 320.79,-143.63"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr/reset.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272.38,-67.88 164.12,-67.88 164.12,-48.62 272.38,-48.62 272.38,-67.88"/>
-<text text-anchor="middle" x="218.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr::reset</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge21_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge21_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M65.02,-161.83C79.51,-139.68 109.22,-99.13 145,-77.25 147.8,-75.54 150.75,-73.98 153.8,-72.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.09,-75.81 163.05,-68.81 152.46,-69.32 155.09,-75.81"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d" target="_top" xlink:title="A insert implementation of pre&#45;split.">
-<polygon fill="white" stroke="#666666" points="471,-214.5 327.5,-214.5 327.5,-184 471,-184 471,-214.5"/>
-<text text-anchor="start" x="335.5" y="-201" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="399.25" y="-189.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::InsertPreSplit</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M272.96,-199.25C286.36,-199.25 301.05,-199.25 315.51,-199.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.51,-202.75 325.51,-199.25 315.51,-195.75 315.51,-202.75"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge6_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge6_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M469.19,-214.96C490.33,-219.77 513.31,-225.01 533.44,-229.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="532.6,-232.99 543.13,-231.8 534.16,-226.17 532.6,-232.99"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" target="_top" xlink:title="Merge node to a not&#45;full target node.">
-<polygon fill="white" stroke="#666666" points="673,-165.5 507,-165.5 507,-135 673,-135 673,-165.5"/>
-<text text-anchor="start" x="515" y="-152" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="590" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNodeNotFull</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M460.75,-183.54C478.78,-178.86 498.72,-173.69 517.39,-168.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="518.25,-172.23 527.05,-166.33 516.49,-165.46 518.25,-172.23"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" target="_top" xlink:title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node.">
-<polygon fill="white" stroke="#666666" points="653.5,-214.5 526.5,-214.5 526.5,-184 653.5,-184 653.5,-214.5"/>
-<text text-anchor="start" x="534.5" y="-201" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="590" y="-189.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::SplitNode</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node12 -->
-<g id="edge14_Node000006_Node000012" class="edge">
-<title>Node6&#45;&gt;Node12</title>
-<g id="a_edge14_Node000006_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M471.34,-199.25C485.52,-199.25 500.45,-199.25 514.74,-199.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="514.52,-202.75 524.52,-199.25 514.52,-195.75 514.52,-202.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" target="_top" xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="white" stroke="#666666" points="825.5,-252.5 709,-252.5 709,-222 825.5,-222 825.5,-252.5"/>
-<text text-anchor="start" x="717" y="-239" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="767.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge8_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M654.21,-165.92C660.76,-168.6 667.15,-171.69 673,-175.25 692.59,-187.19 690.13,-199.19 709,-212.25 710.95,-213.6 712.99,-214.9 715.08,-216.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="713.38,-219.21 723.84,-220.92 716.72,-213.07 713.38,-219.21"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="990.75,-160.5 884.75,-160.5 884.75,-130 990.75,-130 990.75,-160.5"/>
-<text text-anchor="start" x="892.75" y="-147" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="937.75" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node10 -->
-<g id="edge12_Node000007_Node000010" class="edge">
-<title>Node7&#45;&gt;Node10</title>
-<g id="a_edge12_Node000007_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M673.38,-149.06C734.57,-148.17 816.84,-146.98 873.05,-146.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="872.82,-149.67 882.77,-146.03 872.72,-142.68 872.82,-149.67"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="822.12,-203.5 712.38,-203.5 712.38,-173 822.12,-173 822.12,-203.5"/>
-<text text-anchor="start" x="720.38" y="-190" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="767.25" y="-178.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node11 -->
-<g id="edge13_Node000007_Node000011" class="edge">
-<title>Node7&#45;&gt;Node11</title>
-<g id="a_edge13_Node000007_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M663.55,-165.98C675.95,-168.67 688.76,-171.45 700.96,-174.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="699.96,-177.46 710.48,-176.16 701.45,-170.62 699.96,-177.46"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node2 -->
-<g id="edge9_Node000008_Node000002" class="edge">
-<title>Node8&#45;&gt;Node2</title>
-<g id="a_edge9_Node000008_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M825.77,-251.93C840.2,-255.61 855.8,-259.59 870.62,-263.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="869.75,-266.76 880.3,-265.84 871.48,-259.98 869.75,-266.76"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="1014,-246.5 861.5,-246.5 861.5,-216 1014,-216 1014,-246.5"/>
-<text text-anchor="start" x="869.5" y="-233" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="937.75" y="-221.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge10_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge10_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M825.77,-235.2C833.48,-234.93 841.52,-234.64 849.6,-234.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="849.64,-237.85 859.51,-234 849.39,-230.86 849.64,-237.85"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge11_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge11_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M806.15,-221.53C812.67,-218.59 819.33,-215.44 825.5,-212.25 852.42,-198.34 881.74,-180.57 903.52,-166.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="905.13,-169.95 911.69,-161.63 901.37,-164.04 905.13,-169.95"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node7 -->
-<g id="edge19_Node000013_Node000007" class="edge">
-<title>Node13&#45;&gt;Node7</title>
-<g id="a_edge19_Node000013_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M466.8,-136.65C476.03,-137.68 485.65,-138.75 495.26,-139.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="494.69,-143.28 505.01,-140.91 495.46,-136.32 494.69,-143.28"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node10 -->
-<g id="edge18_Node000013_Node000010" class="edge">
-<title>Node13&#45;&gt;Node10</title>
-<g id="a_edge18_Node000013_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M466.87,-127.09C480.16,-126.74 494.02,-126.43 507,-126.25 580.77,-125.21 599.27,-123.6 673,-126.25 741.39,-128.71 819.56,-134.75 872.93,-139.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="872.49,-142.84 882.76,-140.22 873.1,-135.86 872.49,-142.84"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node12 -->
-<g id="edge20_Node000013_Node000012" class="edge">
-<title>Node13&#45;&gt;Node12</title>
-<g id="a_edge20_Node000013_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M434.99,-144.96C455.69,-154.06 482.61,-165.42 507,-174.25 512.6,-176.28 518.45,-178.28 524.34,-180.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="522.89,-183.43 533.49,-183.17 525.04,-176.77 522.89,-183.43"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" target="_top" xlink:title="Get the child pointer at position of index.">
-<polygon fill="white" stroke="#666666" points="645.25,-30.5 534.75,-30.5 534.75,0 645.25,0 645.25,-30.5"/>
-<text text-anchor="start" x="542.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="590" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetChild</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge16_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge16_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.06,-113.51C434.44,-93.76 470.28,-60.1 507,-40.25 512.32,-37.38 518.02,-34.78 523.83,-32.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="524.8,-35.83 532.97,-29.08 522.37,-29.27 524.8,-35.83"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" target="_top" xlink:title="Get item of the \index index.">
-<polygon fill="white" stroke="#666666" points="643.75,-79.5 536.25,-79.5 536.25,-49 643.75,-49 643.75,-79.5"/>
-<text text-anchor="start" x="544.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="590" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetItem</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node15 -->
-<g id="edge17_Node000013_Node000015" class="edge">
-<title>Node13&#45;&gt;Node15</title>
-<g id="a_edge17_Node000013_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M445.94,-113.52C472.04,-104.53 504.99,-93.18 532.68,-83.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.66,-87.01 541.97,-80.45 531.38,-80.39 533.66,-87.01"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph_org.svg
deleted file mode 100644
index 9d66eb37c..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a02df91964915ca97609d35f847faff5f_cgraph_org.svg
+++ /dev/null
@@ -1,360 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::Insert Pages: 1 -->
-<svg width="1022pt" height="304pt"
- viewBox="0.00 0.00 1022.00 303.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 299.5)">
-<title>data_structures::tree_234::Tree234::Insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A helper function used by post&#45;merge insert.">
-<polygon fill="#999999" stroke="#666666" points="109,-192.5 0,-192.5 0,-162 109,-162 109,-192.5"/>
-<text text-anchor="start" x="8" y="-179" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="54.5" y="-167.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="993.38,-295.5 882.12,-295.5 882.12,-265 993.38,-265 993.38,-295.5"/>
-<text text-anchor="start" x="890.12" y="-282" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="937.75" y="-270.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.6,-192.91C85.93,-209.92 114.5,-236.37 145,-249.25 249.46,-293.37 284.85,-280.25 398.25,-280.25 398.25,-280.25 398.25,-280.25 591,-280.25 688.23,-280.25 800.84,-280.25 870.44,-280.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="870.15,-283.75 880.15,-280.25 870.15,-276.75 870.15,-283.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="640,-251.88 540,-251.88 540,-232.62 640,-232.62 640,-251.88"/>
-<text text-anchor="middle" x="590" y="-238.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr::get</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.04,-192.94C96.45,-203.63 121.19,-216.95 145,-223.25 278.17,-258.5 441.55,-253.82 528.23,-247.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="528.46,-251.26 538.18,-247.04 527.95,-244.28 528.46,-251.26"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46" target="_top" xlink:title="Get next node which is possibly contains item.">
-<polygon fill="white" stroke="#666666" points="291.5,-128.12 145,-128.12 145,-86.38 291.5,-86.38 291.5,-128.12"/>
-<text text-anchor="start" x="153" y="-114.62" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="start" x="153" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetNextPossible</text>
-<text text-anchor="middle" x="218.25" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">Child</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.8,-161.54C111.18,-153.15 135.52,-142.62 157.6,-133.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.71,-136.4 166.5,-129.21 155.93,-129.97 158.71,-136.4"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e" target="_top" xlink:title="Insert item to tree.">
-<polygon fill="white" stroke="#666666" points="272.75,-214.5 163.75,-214.5 163.75,-184 272.75,-184 272.75,-214.5"/>
-<text text-anchor="start" x="171.75" y="-201" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="218.25" y="-189.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.36,-184.58C123.07,-186.44 137.94,-188.46 152.14,-190.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.47,-193.84 161.85,-191.71 152.41,-186.9 151.47,-193.84"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805" target="_top" xlink:title="A helper function used during post&#45;merge insert.">
-<polygon fill="white" stroke="#666666" points="466.5,-144.5 332,-144.5 332,-114 466.5,-114 466.5,-144.5"/>
-<text text-anchor="start" x="340" y="-131" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="399.25" y="-119.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node13 -->
-<g id="edge15_Node000001_Node000013" class="edge">
-<title>Node1&#45;&gt;Node13</title>
-<g id="a_edge15_Node000001_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.43,-169.7C166.16,-161.75 255.98,-149.17 320.39,-140.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.79,-143.63 330.21,-138.78 319.82,-136.7 320.79,-143.63"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr/reset.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272.38,-67.88 164.12,-67.88 164.12,-48.62 272.38,-48.62 272.38,-67.88"/>
-<text text-anchor="middle" x="218.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr::reset</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge21_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge21_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M65.02,-161.83C79.51,-139.68 109.22,-99.13 145,-77.25 147.8,-75.54 150.75,-73.98 153.8,-72.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.09,-75.81 163.05,-68.81 152.46,-69.32 155.09,-75.81"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d" target="_top" xlink:title="A insert implementation of pre&#45;split.">
-<polygon fill="white" stroke="#666666" points="471,-214.5 327.5,-214.5 327.5,-184 471,-184 471,-214.5"/>
-<text text-anchor="start" x="335.5" y="-201" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="399.25" y="-189.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::InsertPreSplit</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M272.96,-199.25C286.36,-199.25 301.05,-199.25 315.51,-199.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.51,-202.75 325.51,-199.25 315.51,-195.75 315.51,-202.75"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge6_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge6_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M469.19,-214.96C490.33,-219.77 513.31,-225.01 533.44,-229.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="532.6,-232.99 543.13,-231.8 534.16,-226.17 532.6,-232.99"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" target="_top" xlink:title="Merge node to a not&#45;full target node.">
-<polygon fill="white" stroke="#666666" points="673,-165.5 507,-165.5 507,-135 673,-135 673,-165.5"/>
-<text text-anchor="start" x="515" y="-152" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="590" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNodeNotFull</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M460.75,-183.54C478.78,-178.86 498.72,-173.69 517.39,-168.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="518.25,-172.23 527.05,-166.33 516.49,-165.46 518.25,-172.23"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" target="_top" xlink:title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node.">
-<polygon fill="white" stroke="#666666" points="653.5,-214.5 526.5,-214.5 526.5,-184 653.5,-184 653.5,-214.5"/>
-<text text-anchor="start" x="534.5" y="-201" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="590" y="-189.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::SplitNode</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node12 -->
-<g id="edge14_Node000006_Node000012" class="edge">
-<title>Node6&#45;&gt;Node12</title>
-<g id="a_edge14_Node000006_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M471.34,-199.25C485.52,-199.25 500.45,-199.25 514.74,-199.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="514.52,-202.75 524.52,-199.25 514.52,-195.75 514.52,-202.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" target="_top" xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="white" stroke="#666666" points="825.5,-252.5 709,-252.5 709,-222 825.5,-222 825.5,-252.5"/>
-<text text-anchor="start" x="717" y="-239" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="767.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge8_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M654.21,-165.92C660.76,-168.6 667.15,-171.69 673,-175.25 692.59,-187.19 690.13,-199.19 709,-212.25 710.95,-213.6 712.99,-214.9 715.08,-216.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="713.38,-219.21 723.84,-220.92 716.72,-213.07 713.38,-219.21"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="990.75,-160.5 884.75,-160.5 884.75,-130 990.75,-130 990.75,-160.5"/>
-<text text-anchor="start" x="892.75" y="-147" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="937.75" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node10 -->
-<g id="edge12_Node000007_Node000010" class="edge">
-<title>Node7&#45;&gt;Node10</title>
-<g id="a_edge12_Node000007_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M673.38,-149.06C734.57,-148.17 816.84,-146.98 873.05,-146.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="872.82,-149.67 882.77,-146.03 872.72,-142.68 872.82,-149.67"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="822.12,-203.5 712.38,-203.5 712.38,-173 822.12,-173 822.12,-203.5"/>
-<text text-anchor="start" x="720.38" y="-190" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="767.25" y="-178.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node11 -->
-<g id="edge13_Node000007_Node000011" class="edge">
-<title>Node7&#45;&gt;Node11</title>
-<g id="a_edge13_Node000007_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M663.55,-165.98C675.95,-168.67 688.76,-171.45 700.96,-174.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="699.96,-177.46 710.48,-176.16 701.45,-170.62 699.96,-177.46"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node2 -->
-<g id="edge9_Node000008_Node000002" class="edge">
-<title>Node8&#45;&gt;Node2</title>
-<g id="a_edge9_Node000008_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M825.77,-251.93C840.2,-255.61 855.8,-259.59 870.62,-263.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="869.75,-266.76 880.3,-265.84 871.48,-259.98 869.75,-266.76"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="1014,-246.5 861.5,-246.5 861.5,-216 1014,-216 1014,-246.5"/>
-<text text-anchor="start" x="869.5" y="-233" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="937.75" y="-221.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge10_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge10_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M825.77,-235.2C833.48,-234.93 841.52,-234.64 849.6,-234.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="849.64,-237.85 859.51,-234 849.39,-230.86 849.64,-237.85"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge11_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge11_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M806.15,-221.53C812.67,-218.59 819.33,-215.44 825.5,-212.25 852.42,-198.34 881.74,-180.57 903.52,-166.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="905.13,-169.95 911.69,-161.63 901.37,-164.04 905.13,-169.95"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node7 -->
-<g id="edge19_Node000013_Node000007" class="edge">
-<title>Node13&#45;&gt;Node7</title>
-<g id="a_edge19_Node000013_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M466.8,-136.65C476.03,-137.68 485.65,-138.75 495.26,-139.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="494.69,-143.28 505.01,-140.91 495.46,-136.32 494.69,-143.28"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node10 -->
-<g id="edge18_Node000013_Node000010" class="edge">
-<title>Node13&#45;&gt;Node10</title>
-<g id="a_edge18_Node000013_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M466.87,-127.09C480.16,-126.74 494.02,-126.43 507,-126.25 580.77,-125.21 599.27,-123.6 673,-126.25 741.39,-128.71 819.56,-134.75 872.93,-139.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="872.49,-142.84 882.76,-140.22 873.1,-135.86 872.49,-142.84"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node12 -->
-<g id="edge20_Node000013_Node000012" class="edge">
-<title>Node13&#45;&gt;Node12</title>
-<g id="a_edge20_Node000013_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M434.99,-144.96C455.69,-154.06 482.61,-165.42 507,-174.25 512.6,-176.28 518.45,-178.28 524.34,-180.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="522.89,-183.43 533.49,-183.17 525.04,-176.77 522.89,-183.43"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" target="_top" xlink:title="Get the child pointer at position of index.">
-<polygon fill="white" stroke="#666666" points="645.25,-30.5 534.75,-30.5 534.75,0 645.25,0 645.25,-30.5"/>
-<text text-anchor="start" x="542.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="590" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetChild</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge16_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge16_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.06,-113.51C434.44,-93.76 470.28,-60.1 507,-40.25 512.32,-37.38 518.02,-34.78 523.83,-32.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="524.8,-35.83 532.97,-29.08 522.37,-29.27 524.8,-35.83"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" target="_top" xlink:title="Get item of the \index index.">
-<polygon fill="white" stroke="#666666" points="643.75,-79.5 536.25,-79.5 536.25,-49 643.75,-49 643.75,-79.5"/>
-<text text-anchor="start" x="544.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="590" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetItem</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node15 -->
-<g id="edge17_Node000013_Node000015" class="edge">
-<title>Node13&#45;&gt;Node15</title>
-<g id="a_edge17_Node000013_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M445.94,-113.52C472.04,-104.53 504.99,-93.18 532.68,-83.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.66,-87.01 541.97,-80.45 531.38,-80.39 533.66,-87.01"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.map
deleted file mode 100644
index eace8876e..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.map
+++ /dev/null
@@ -1,20 +0,0 @@
-<map id="data_structures::tree_234::Tree234::InsertPreSplit" name="data_structures::tree_234::Tree234::InsertPreSplit">
-<area shape="rect" id="Node000001" title="A insert implementation of pre&#45;split." alt="" coords="5,133,197,174"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/unique_ptr/get.html#" title=" " alt="" coords="289,84,422,109"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="194,130,279,111,281,116,195,135"/>
-<area shape="rect" id="Node000003" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" title="Merge node to a not&#45;full target node." alt="" coords="245,133,466,174"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="197,151,229,151,229,156,197,156"/>
-<area shape="rect" id="Node000009" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node." alt="" coords="271,199,440,239"/>
-<area shape="poly" id="edge9_Node000001_Node000009" title=" " alt="" coords="184,172,259,192,258,197,182,177"/>
-<area shape="rect" id="Node000004" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" title="Insert item to the proper position of the node and return the position index." alt="" coords="514,72,669,113"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="436,130,498,114,500,119,437,135"/>
-<area shape="rect" id="Node000007" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" title="Check if node is a full (4&#45;node)" alt="" coords="748,136,890,177"/>
-<area shape="poly" id="edge7_Node000003_Node000007" title=" " alt="" coords="467,152,733,153,733,159,466,157"/>
-<area shape="rect" id="Node000008" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" title="Set child pointer to the position of index." alt="" coords="518,191,665,231"/>
-<area shape="poly" id="edge8_Node000003_Node000008" title=" " alt="" coords="442,172,504,187,503,192,441,177"/>
-<area shape="rect" id="Node000005" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" title="Check if item is in the node." alt="" coords="745,5,893,46"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="663,69,732,48,733,54,664,74"/>
-<area shape="rect" id="Node000006" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" title="Insert a value to the index position." alt="" coords="717,71,921,111"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="670,89,701,89,701,94,670,95"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="667,111,734,130,733,135,666,116"/>
-</map>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.md5
deleted file mode 100644
index c25eac01e..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bc48a145b1b454b9ad86c6c54230c54d
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.svg
deleted file mode 100644
index 07943b0bb..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph.svg
+++ /dev/null
@@ -1,265 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::InsertPreSplit Pages: 1 -->
-<!--zoomable 184 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 695;
-var viewHeight = 184;
-var sectionId = 'dynsection-7';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>data_structures::tree_234::Tree234::InsertPreSplit</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A insert implementation of pre&#45;split.">
-<polygon fill="#999999" stroke="#666666" points="143.5,-79.5 0,-79.5 0,-49 143.5,-49 143.5,-79.5"/>
-<text text-anchor="start" x="8" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="71.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::InsertPreSplit</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312.5,-116.88 212.5,-116.88 212.5,-97.62 312.5,-97.62 312.5,-116.88"/>
-<text text-anchor="middle" x="262.5" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr::get</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.69,-79.96C162.83,-84.77 185.81,-90.01 205.94,-94.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.1,-97.99 215.63,-96.8 206.66,-91.17 205.1,-97.99"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" target="_top" xlink:title="Merge node to a not&#45;full target node.">
-<polygon fill="white" stroke="#666666" points="345.5,-79.5 179.5,-79.5 179.5,-49 345.5,-49 345.5,-79.5"/>
-<text text-anchor="start" x="187.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="262.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNodeNotFull</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M143.84,-64.25C151.65,-64.25 159.69,-64.25 167.73,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.54,-67.75 177.54,-64.25 167.54,-60.75 167.54,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" target="_top" xlink:title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node.">
-<polygon fill="white" stroke="#666666" points="326,-30.5 199,-30.5 199,0 326,0 326,-30.5"/>
-<text text-anchor="start" x="207" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="262.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::SplitNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.25,-48.54C151.28,-43.86 171.22,-38.69 189.89,-33.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.75,-37.23 199.55,-31.33 188.99,-30.46 190.75,-37.23"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" target="_top" xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="white" stroke="#666666" points="498,-125.5 381.5,-125.5 381.5,-95 498,-95 498,-125.5"/>
-<text text-anchor="start" x="389.5" y="-112" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="439.75" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M323.32,-79.95C338.4,-83.91 354.71,-88.19 370.18,-92.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="369.25,-95.62 379.81,-94.78 371.02,-88.85 369.25,-95.62"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="663.25,-77.5 557.25,-77.5 557.25,-47 663.25,-47 663.25,-77.5"/>
-<text text-anchor="start" x="565.25" y="-64" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="610.25" y="-52.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge7_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge7_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M345.88,-63.77C407.07,-63.42 489.34,-62.94 545.55,-62.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="545.29,-66.12 555.27,-62.56 545.25,-59.12 545.29,-66.12"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="494.62,-36.5 384.88,-36.5 384.88,-6 494.62,-6 494.62,-36.5"/>
-<text text-anchor="start" x="392.88" y="-23" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="439.75" y="-11.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge8_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge8_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M327.27,-48.6C342.39,-44.89 358.53,-40.93 373.71,-37.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="374.21,-40.69 383.09,-34.91 372.54,-33.89 374.21,-40.69"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="665.88,-175.5 554.62,-175.5 554.62,-145 665.88,-145 665.88,-175.5"/>
-<text text-anchor="start" x="562.62" y="-162" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="610.25" y="-150.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M493.6,-125.93C509.99,-130.8 528.23,-136.21 545.29,-141.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="544.26,-144.62 554.84,-144.11 546.25,-137.91 544.26,-144.62"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="686.5,-126.5 534,-126.5 534,-96 686.5,-96 686.5,-126.5"/>
-<text text-anchor="start" x="542" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="610.25" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M498.27,-110.59C505.98,-110.64 514.02,-110.68 522.1,-110.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="521.98,-114.23 532.01,-110.79 522.03,-107.23 521.98,-114.23"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M495.92,-94.53C511.98,-89.96 529.65,-84.92 546.16,-80.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="546.7,-83.71 555.36,-77.6 544.78,-76.98 546.7,-83.71"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph_org.svg
deleted file mode 100644
index e38cbe8f3..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a07811b3c564a3a443b106c9aa717629d_cgraph_org.svg
+++ /dev/null
@@ -1,182 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::InsertPreSplit Pages: 1 -->
-<svg width="695pt" height="184pt"
- viewBox="0.00 0.00 694.50 183.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 179.5)">
-<title>data_structures::tree_234::Tree234::InsertPreSplit</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A insert implementation of pre&#45;split.">
-<polygon fill="#999999" stroke="#666666" points="143.5,-79.5 0,-79.5 0,-49 143.5,-49 143.5,-79.5"/>
-<text text-anchor="start" x="8" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="71.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::InsertPreSplit</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312.5,-116.88 212.5,-116.88 212.5,-97.62 312.5,-97.62 312.5,-116.88"/>
-<text text-anchor="middle" x="262.5" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr::get</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.69,-79.96C162.83,-84.77 185.81,-90.01 205.94,-94.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.1,-97.99 215.63,-96.8 206.66,-91.17 205.1,-97.99"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" target="_top" xlink:title="Merge node to a not&#45;full target node.">
-<polygon fill="white" stroke="#666666" points="345.5,-79.5 179.5,-79.5 179.5,-49 345.5,-49 345.5,-79.5"/>
-<text text-anchor="start" x="187.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="262.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNodeNotFull</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M143.84,-64.25C151.65,-64.25 159.69,-64.25 167.73,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.54,-67.75 177.54,-64.25 167.54,-60.75 167.54,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" target="_top" xlink:title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node.">
-<polygon fill="white" stroke="#666666" points="326,-30.5 199,-30.5 199,0 326,0 326,-30.5"/>
-<text text-anchor="start" x="207" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="262.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::SplitNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.25,-48.54C151.28,-43.86 171.22,-38.69 189.89,-33.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.75,-37.23 199.55,-31.33 188.99,-30.46 190.75,-37.23"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" target="_top" xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="white" stroke="#666666" points="498,-125.5 381.5,-125.5 381.5,-95 498,-95 498,-125.5"/>
-<text text-anchor="start" x="389.5" y="-112" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="439.75" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M323.32,-79.95C338.4,-83.91 354.71,-88.19 370.18,-92.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="369.25,-95.62 379.81,-94.78 371.02,-88.85 369.25,-95.62"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="663.25,-77.5 557.25,-77.5 557.25,-47 663.25,-47 663.25,-77.5"/>
-<text text-anchor="start" x="565.25" y="-64" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="610.25" y="-52.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge7_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge7_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M345.88,-63.77C407.07,-63.42 489.34,-62.94 545.55,-62.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="545.29,-66.12 555.27,-62.56 545.25,-59.12 545.29,-66.12"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="494.62,-36.5 384.88,-36.5 384.88,-6 494.62,-6 494.62,-36.5"/>
-<text text-anchor="start" x="392.88" y="-23" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="439.75" y="-11.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge8_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge8_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M327.27,-48.6C342.39,-44.89 358.53,-40.93 373.71,-37.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="374.21,-40.69 383.09,-34.91 372.54,-33.89 374.21,-40.69"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="665.88,-175.5 554.62,-175.5 554.62,-145 665.88,-145 665.88,-175.5"/>
-<text text-anchor="start" x="562.62" y="-162" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="610.25" y="-150.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M493.6,-125.93C509.99,-130.8 528.23,-136.21 545.29,-141.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="544.26,-144.62 554.84,-144.11 546.25,-137.91 544.26,-144.62"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="686.5,-126.5 534,-126.5 534,-96 686.5,-96 686.5,-126.5"/>
-<text text-anchor="start" x="542" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="610.25" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M498.27,-110.59C505.98,-110.64 514.02,-110.68 522.1,-110.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="521.98,-114.23 532.01,-110.79 522.03,-107.23 521.98,-114.23"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M495.92,-94.53C511.98,-89.96 529.65,-84.92 546.16,-80.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="546.7,-83.71 555.36,-77.6 544.78,-76.98 546.7,-83.71"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.map
deleted file mode 100644
index 1c76cfbb0..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.map
+++ /dev/null
@@ -1,23 +0,0 @@
-<map id="data_structures::tree_234::Tree234::MergeNode" name="data_structures::tree_234::Tree234::MergeNode">
-<area shape="rect" id="Node000001" title="A helper function used during post&#45;merge insert." alt="" coords="5,128,185,169"/>
-<area shape="rect" id="Node000002" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" title="Get the child pointer at position of index." alt="" coords="270,5,417,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="122,125,171,91,231,57,254,47,256,52,234,61,174,95,125,130"/>
-<area shape="rect" id="Node000003" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" title="Get item of the \index index." alt="" coords="272,71,415,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="184,125,256,108,257,114,186,130"/>
-<area shape="rect" id="Node000004" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" title="Check if node is a full (4&#45;node)" alt="" coords="736,171,878,211"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="185,150,658,176,721,181,721,186,657,182,185,155"/>
-<area shape="rect" id="Node000005" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" title="Merge node to a not&#45;full target node." alt="" coords="233,185,454,226"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="186,166,238,179,237,184,184,172"/>
-<area shape="rect" id="Node000010" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node." alt="" coords="259,251,428,291"/>
-<area shape="poly" id="edge11_Node000001_Node000010" title=" " alt="" coords="125,167,174,202,234,235,251,243,249,247,231,240,171,206,122,171"/>
-<area shape="poly" id="edge9_Node000005_Node000004" title=" " alt="" coords="454,200,721,191,721,196,455,205"/>
-<area shape="rect" id="Node000006" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" title="Insert item to the proper position of the node and return the position index." alt="" coords="502,236,657,277"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="442,224,487,234,486,239,441,229"/>
-<area shape="rect" id="Node000009" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" title="Set child pointer to the position of index." alt="" coords="506,301,653,342"/>
-<area shape="poly" id="edge10_Node000005_Node000009" title=" " alt="" coords="430,224,455,237,471,249,480,262,490,274,504,286,512,291,509,296,500,290,486,277,476,265,467,253,453,241,428,229"/>
-<area shape="poly" id="edge8_Node000006_Node000004" title=" " alt="" coords="652,233,720,213,722,218,653,238"/>
-<area shape="rect" id="Node000007" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" title="Check if item is in the node." alt="" coords="733,236,881,277"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="658,254,717,254,717,259,658,259"/>
-<area shape="rect" id="Node000008" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" title="Insert a value to the index position." alt="" coords="705,301,909,342"/>
-<area shape="poly" id="edge7_Node000006_Node000008" title=" " alt="" coords="653,275,720,294,719,299,652,280"/>
-</map>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.md5
deleted file mode 100644
index 0ebf10854..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d2ad74189d965cb758f0d56d23c5a780
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.svg
deleted file mode 100644
index 5aaafb170..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph.svg
+++ /dev/null
@@ -1,294 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::MergeNode Pages: 1 -->
-<!--zoomable 261 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 686;
-var viewHeight = 261;
-var sectionId = 'dynsection-9';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>data_structures::tree_234::Tree234::MergeNode</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A helper function used during post&#45;merge insert.">
-<polygon fill="#999999" stroke="#666666" points="134.5,-160.5 0,-160.5 0,-130 134.5,-130 134.5,-160.5"/>
-<text text-anchor="start" x="8" y="-147" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="67.25" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNode</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" target="_top" xlink:title="Get the child pointer at position of index.">
-<polygon fill="white" stroke="#666666" points="308.75,-252.5 198.25,-252.5 198.25,-222 308.75,-222 308.75,-252.5"/>
-<text text-anchor="start" x="206.25" y="-239" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="253.5" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetChild</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.38,-160.94C108.3,-175.84 140.13,-198.03 170.5,-212.25 175.89,-214.77 181.6,-217.12 187.39,-219.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.85,-222.45 196.44,-222.47 188.17,-215.85 185.85,-222.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" target="_top" xlink:title="Get item of the \index index.">
-<polygon fill="white" stroke="#666666" points="307.25,-203.5 199.75,-203.5 199.75,-173 307.25,-173 307.25,-203.5"/>
-<text text-anchor="start" x="207.75" y="-190" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="253.5" y="-178.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetItem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.77,-160.77C152.19,-164.84 170.93,-169.21 188.23,-173.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.35,-176.64 197.89,-175.5 188.95,-169.82 187.35,-176.64"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="654.25,-128.5 548.25,-128.5 548.25,-98 654.25,-98 654.25,-128.5"/>
-<text text-anchor="start" x="556.25" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="601.25" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.96,-142.14C217.96,-138.15 364.01,-130.72 489,-122.25 504.48,-121.2 521.16,-119.93 536.77,-118.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="536.73,-122.19 546.41,-117.89 536.16,-115.21 536.73,-122.19"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" target="_top" xlink:title="Merge node to a not&#45;full target node.">
-<polygon fill="white" stroke="#666666" points="336.5,-117.5 170.5,-117.5 170.5,-87 336.5,-87 336.5,-117.5"/>
-<text text-anchor="start" x="178.5" y="-104" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="253.5" y="-92.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNodeNotFull</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.77,-129.73C147.57,-126.74 161.09,-123.58 174.23,-120.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.73,-123.99 183.68,-118.31 173.14,-117.18 174.73,-123.99"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" target="_top" xlink:title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node.">
-<polygon fill="white" stroke="#666666" points="317,-68.5 190,-68.5 190,-38 317,-38 317,-68.5"/>
-<text text-anchor="start" x="198" y="-55" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="253.5" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::SplitNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge11_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.38,-129.56C108.3,-114.66 140.13,-92.47 170.5,-78.25 174.67,-76.3 179.03,-74.45 183.47,-72.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.34,-76.12 192.52,-69.39 181.92,-69.55 184.34,-76.12"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge9_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge9_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.88,-104.87C398.07,-106.82 480.34,-109.44 536.55,-111.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="536.16,-114.71 546.27,-111.53 536.38,-107.72 536.16,-114.71"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" target="_top" xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="white" stroke="#666666" points="489,-79.5 372.5,-79.5 372.5,-49 489,-49 489,-79.5"/>
-<text text-anchor="start" x="380.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="430.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M327.05,-86.52C338.35,-84.07 349.99,-81.54 361.2,-79.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="361.72,-82.58 370.75,-77.04 360.24,-75.74 361.72,-82.58"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="485.62,-30.5 375.88,-30.5 375.88,0 485.62,0 485.62,-30.5"/>
-<text text-anchor="start" x="383.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="430.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge10_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge10_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M317.71,-86.58C324.26,-83.9 330.65,-80.81 336.5,-77.25 356.09,-65.31 353.63,-53.31 372.5,-40.25 374.45,-38.9 376.49,-37.6 378.58,-36.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="380.22,-39.43 387.34,-31.58 376.88,-33.29 380.22,-39.43"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge8_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M485.53,-79.89C501.88,-84.64 520.01,-89.92 536.93,-94.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="535.81,-98.16 546.39,-97.59 537.77,-91.43 535.81,-98.16"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="656.88,-79.5 545.62,-79.5 545.62,-49 656.88,-49 656.88,-79.5"/>
-<text text-anchor="start" x="553.62" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="601.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M489.27,-64.25C503.7,-64.25 519.3,-64.25 534.12,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.75,-67.75 543.75,-64.25 533.75,-60.75 533.75,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="677.5,-30.5 525,-30.5 525,0 677.5,0 677.5,-30.5"/>
-<text text-anchor="start" x="533" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="601.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M485.53,-48.61C501.41,-43.99 518.96,-38.89 535.46,-34.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="536.04,-37.57 544.66,-31.41 534.08,-30.85 536.04,-37.57"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph_org.svg
deleted file mode 100644
index de4771adb..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a11f0d016dff7f7e62b3dddb9fdf47805_cgraph_org.svg
+++ /dev/null
@@ -1,211 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::MergeNode Pages: 1 -->
-<svg width="686pt" height="261pt"
- viewBox="0.00 0.00 685.50 260.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 256.5)">
-<title>data_structures::tree_234::Tree234::MergeNode</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A helper function used during post&#45;merge insert.">
-<polygon fill="#999999" stroke="#666666" points="134.5,-160.5 0,-160.5 0,-130 134.5,-130 134.5,-160.5"/>
-<text text-anchor="start" x="8" y="-147" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="67.25" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNode</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" target="_top" xlink:title="Get the child pointer at position of index.">
-<polygon fill="white" stroke="#666666" points="308.75,-252.5 198.25,-252.5 198.25,-222 308.75,-222 308.75,-252.5"/>
-<text text-anchor="start" x="206.25" y="-239" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="253.5" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetChild</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.38,-160.94C108.3,-175.84 140.13,-198.03 170.5,-212.25 175.89,-214.77 181.6,-217.12 187.39,-219.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.85,-222.45 196.44,-222.47 188.17,-215.85 185.85,-222.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" target="_top" xlink:title="Get item of the \index index.">
-<polygon fill="white" stroke="#666666" points="307.25,-203.5 199.75,-203.5 199.75,-173 307.25,-173 307.25,-203.5"/>
-<text text-anchor="start" x="207.75" y="-190" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="253.5" y="-178.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetItem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.77,-160.77C152.19,-164.84 170.93,-169.21 188.23,-173.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.35,-176.64 197.89,-175.5 188.95,-169.82 187.35,-176.64"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="654.25,-128.5 548.25,-128.5 548.25,-98 654.25,-98 654.25,-128.5"/>
-<text text-anchor="start" x="556.25" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="601.25" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.96,-142.14C217.96,-138.15 364.01,-130.72 489,-122.25 504.48,-121.2 521.16,-119.93 536.77,-118.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="536.73,-122.19 546.41,-117.89 536.16,-115.21 536.73,-122.19"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" target="_top" xlink:title="Merge node to a not&#45;full target node.">
-<polygon fill="white" stroke="#666666" points="336.5,-117.5 170.5,-117.5 170.5,-87 336.5,-87 336.5,-117.5"/>
-<text text-anchor="start" x="178.5" y="-104" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="253.5" y="-92.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNodeNotFull</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.77,-129.73C147.57,-126.74 161.09,-123.58 174.23,-120.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.73,-123.99 183.68,-118.31 173.14,-117.18 174.73,-123.99"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" target="_top" xlink:title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node.">
-<polygon fill="white" stroke="#666666" points="317,-68.5 190,-68.5 190,-38 317,-38 317,-68.5"/>
-<text text-anchor="start" x="198" y="-55" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="253.5" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::SplitNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge11_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.38,-129.56C108.3,-114.66 140.13,-92.47 170.5,-78.25 174.67,-76.3 179.03,-74.45 183.47,-72.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.34,-76.12 192.52,-69.39 181.92,-69.55 184.34,-76.12"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge9_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge9_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.88,-104.87C398.07,-106.82 480.34,-109.44 536.55,-111.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="536.16,-114.71 546.27,-111.53 536.38,-107.72 536.16,-114.71"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" target="_top" xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="white" stroke="#666666" points="489,-79.5 372.5,-79.5 372.5,-49 489,-49 489,-79.5"/>
-<text text-anchor="start" x="380.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="430.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M327.05,-86.52C338.35,-84.07 349.99,-81.54 361.2,-79.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="361.72,-82.58 370.75,-77.04 360.24,-75.74 361.72,-82.58"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="485.62,-30.5 375.88,-30.5 375.88,0 485.62,0 485.62,-30.5"/>
-<text text-anchor="start" x="383.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="430.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge10_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge10_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M317.71,-86.58C324.26,-83.9 330.65,-80.81 336.5,-77.25 356.09,-65.31 353.63,-53.31 372.5,-40.25 374.45,-38.9 376.49,-37.6 378.58,-36.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="380.22,-39.43 387.34,-31.58 376.88,-33.29 380.22,-39.43"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge8_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M485.53,-79.89C501.88,-84.64 520.01,-89.92 536.93,-94.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="535.81,-98.16 546.39,-97.59 537.77,-91.43 535.81,-98.16"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="656.88,-79.5 545.62,-79.5 545.62,-49 656.88,-49 656.88,-79.5"/>
-<text text-anchor="start" x="553.62" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="601.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M489.27,-64.25C503.7,-64.25 519.3,-64.25 534.12,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.75,-67.75 543.75,-64.25 533.75,-60.75 533.75,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="677.5,-30.5 525,-30.5 525,0 677.5,0 677.5,-30.5"/>
-<text text-anchor="start" x="533" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="601.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M485.53,-48.61C501.41,-43.99 518.96,-38.89 535.46,-34.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="536.04,-37.57 544.66,-31.41 534.08,-30.85 536.04,-37.57"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.map
deleted file mode 100644
index 5c1d6dea2..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="data_structures::tree_234::Tree234::DeleteNode" name="data_structures::tree_234::Tree234::DeleteNode">
-<area shape="rect" id="Node000001" title="Recursive release the tree." alt="" coords="5,39,187,79"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="55,39,53,29,60,20,74,14,96,12,119,14,133,21,131,25,118,20,96,17,76,19,63,24,59,30,61,37"/>
-<area shape="rect" id="Node000002" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" title="Get the child pointer at position of index." alt="" coords="237,5,384,46"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="187,42,222,37,222,42,188,47"/>
-<area shape="rect" id="Node000003" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06" title="Get the item count that current saved in the node." alt="" coords="235,71,387,111"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="188,70,219,75,219,80,187,75"/>
-</map>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.md5
deleted file mode 100644
index 0763c07f9..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-14e80e78165d85a265a6c99bf841a80e
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.svg
deleted file mode 100644
index d220771c7..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph.svg
+++ /dev/null
@@ -1,95 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::DeleteNode Pages: 1 -->
-<svg width="294pt" height="88pt"
- viewBox="0.00 0.00 294.25 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>data_structures::tree_234::Tree234::DeleteNode</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive release the tree.">
-<polygon fill="#999999" stroke="#666666" points="136,-54.5 0,-54.5 0,-24 136,-24 136,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="68" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::DeleteNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.45,-54.99C33.62,-64.06 43.14,-72.5 68,-72.5 81.6,-72.5 90.6,-69.97 95.02,-66.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.46,-66.87 96.35,-56.49 91.53,-65.92 98.46,-66.87"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" target="_top" xlink:title="Get the child pointer at position of index.">
-<polygon fill="white" stroke="#666666" points="284.38,-79.5 173.88,-79.5 173.88,-49 284.38,-49 284.38,-79.5"/>
-<text text-anchor="start" x="181.88" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="229.12" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetChild</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.48,-49.85C145.08,-51.2 153.87,-52.58 162.44,-53.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.63,-57.35 172.05,-55.44 162.72,-50.43 161.63,-57.35"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06" target="_top" xlink:title="Get the item count that current saved in the node.">
-<polygon fill="white" stroke="#666666" points="286.25,-30.5 172,-30.5 172,0 286.25,0 286.25,-30.5"/>
-<text text-anchor="start" x="180" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="229.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetCount</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.48,-29.07C144.34,-27.89 152.35,-26.68 160.21,-25.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.72,-28.96 170.08,-24 159.67,-22.03 160.72,-28.96"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph_org.svg
deleted file mode 100644
index 80303a919..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a273511e84a5243ffffe81be28bd24855_cgraph_org.svg
+++ /dev/null
@@ -1,69 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::DeleteNode Pages: 1 -->
-<svg width="294pt" height="88pt"
- viewBox="0.00 0.00 294.25 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>data_structures::tree_234::Tree234::DeleteNode</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive release the tree.">
-<polygon fill="#999999" stroke="#666666" points="136,-54.5 0,-54.5 0,-24 136,-24 136,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="68" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::DeleteNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.45,-54.99C33.62,-64.06 43.14,-72.5 68,-72.5 81.6,-72.5 90.6,-69.97 95.02,-66.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.46,-66.87 96.35,-56.49 91.53,-65.92 98.46,-66.87"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" target="_top" xlink:title="Get the child pointer at position of index.">
-<polygon fill="white" stroke="#666666" points="284.38,-79.5 173.88,-79.5 173.88,-49 284.38,-49 284.38,-79.5"/>
-<text text-anchor="start" x="181.88" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="229.12" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetChild</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.48,-49.85C145.08,-51.2 153.87,-52.58 162.44,-53.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.63,-57.35 172.05,-55.44 162.72,-50.43 161.63,-57.35"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06" target="_top" xlink:title="Get the item count that current saved in the node.">
-<polygon fill="white" stroke="#666666" points="286.25,-30.5 172,-30.5 172,0 286.25,0 286.25,-30.5"/>
-<text text-anchor="start" x="180" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="229.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetCount</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.48,-29.07C144.34,-27.89 152.35,-26.68 160.21,-25.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.72,-28.96 170.08,-24 159.67,-22.03 160.72,-28.96"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.map
deleted file mode 100644
index eba8c008b..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="data_structures::tree_234::Tree234::Print" name="data_structures::tree_234::Tree234::Print">
-<area shape="rect" id="Node000001" title="Print tree into a dot file." alt="" coords="5,72,147,113"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="211,5,348,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="121,70,194,40,212,33,214,39,196,45,123,74"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="244,55,316,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="147,81,229,71,229,76,147,87"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="213,104,347,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="147,99,198,104,197,110,147,104"/>
-<area shape="rect" id="Node000005" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be" title="Print the tree to a dot file. You can convert it to picture with graphviz." alt="" coords="195,154,365,194"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="127,111,196,140,210,145,208,150,194,145,125,116"/>
-</map>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.md5
deleted file mode 100644
index 0016405bc..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6e1034a7b2539208479742a12ae92ab9
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.svg
deleted file mode 100644
index 6d0693ea2..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph.svg
+++ /dev/null
@@ -1,121 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::Print Pages: 1 -->
-<svg width="278pt" height="150pt"
- viewBox="0.00 0.00 277.75 149.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 145.88)">
-<title>data_structures::tree_234::Tree234::Print</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Print tree into a dot file.">
-<polygon fill="#999999" stroke="#666666" points="106,-91.5 0,-91.5 0,-61 106,-61 106,-91.5"/>
-<text text-anchor="start" x="8" y="-78" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="53" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Print</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257.38,-141.88 154.38,-141.88 154.38,-122.62 257.38,-122.62 257.38,-141.88"/>
-<text text-anchor="middle" x="205.88" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.44,-91.9C103.71,-99.2 123.67,-107.7 142,-114.25 146.45,-115.84 151.12,-117.39 155.81,-118.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.69,-122.19 165.27,-121.74 156.72,-115.49 154.69,-122.19"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.62,-104.88 179.12,-104.88 179.12,-85.62 232.62,-85.62 232.62,-104.88"/>
-<text text-anchor="middle" x="205.88" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.35,-82.84C126.55,-85.39 149.2,-88.24 167.68,-90.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.01,-94.01 177.37,-91.79 167.89,-87.06 167.01,-94.01"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="256.25,-67.88 155.5,-67.88 155.5,-48.62 256.25,-48.62 256.25,-67.88"/>
-<text text-anchor="middle" x="205.88" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.35,-70C118.47,-68.56 131.47,-67.01 143.92,-65.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.14,-69.02 153.66,-64.36 143.31,-62.07 144.14,-69.02"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be" target="_top" xlink:title="Print the tree to a dot file. You can convert it to picture with graphviz.">
-<polygon fill="white" stroke="#666666" points="269.75,-30.5 142,-30.5 142,0 269.75,0 269.75,-30.5"/>
-<text text-anchor="start" x="150" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="205.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::PrintNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.28,-60.68C106.11,-53.96 124.93,-46.1 142,-39.25 145.42,-37.88 148.94,-36.48 152.5,-35.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.73,-38.37 161.79,-31.48 151.2,-31.84 153.73,-38.37"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph_org.svg
deleted file mode 100644
index 5287e05ee..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a2e9a9db7792cf5383f4c4cc418255165_cgraph_org.svg
+++ /dev/null
@@ -1,95 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::Print Pages: 1 -->
-<svg width="278pt" height="150pt"
- viewBox="0.00 0.00 277.75 149.88" 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 145.88)">
-<title>data_structures::tree_234::Tree234::Print</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Print tree into a dot file.">
-<polygon fill="#999999" stroke="#666666" points="106,-91.5 0,-91.5 0,-61 106,-61 106,-91.5"/>
-<text text-anchor="start" x="8" y="-78" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="53" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Print</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257.38,-141.88 154.38,-141.88 154.38,-122.62 257.38,-122.62 257.38,-141.88"/>
-<text text-anchor="middle" x="205.88" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.44,-91.9C103.71,-99.2 123.67,-107.7 142,-114.25 146.45,-115.84 151.12,-117.39 155.81,-118.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.69,-122.19 165.27,-121.74 156.72,-115.49 154.69,-122.19"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.62,-104.88 179.12,-104.88 179.12,-85.62 232.62,-85.62 232.62,-104.88"/>
-<text text-anchor="middle" x="205.88" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.35,-82.84C126.55,-85.39 149.2,-88.24 167.68,-90.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.01,-94.01 177.37,-91.79 167.89,-87.06 167.01,-94.01"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="256.25,-67.88 155.5,-67.88 155.5,-48.62 256.25,-48.62 256.25,-67.88"/>
-<text text-anchor="middle" x="205.88" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.35,-70C118.47,-68.56 131.47,-67.01 143.92,-65.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.14,-69.02 153.66,-64.36 143.31,-62.07 144.14,-69.02"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be" target="_top" xlink:title="Print the tree to a dot file. You can convert it to picture with graphviz.">
-<polygon fill="white" stroke="#666666" points="269.75,-30.5 142,-30.5 142,0 269.75,0 269.75,-30.5"/>
-<text text-anchor="start" x="150" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="205.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::PrintNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.28,-60.68C106.11,-53.96 124.93,-46.1 142,-39.25 145.42,-37.88 148.94,-36.48 152.5,-35.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.73,-38.37 161.79,-31.48 151.2,-31.84 153.73,-38.37"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.map
deleted file mode 100644
index b099934d3..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="data_structures::tree_234::Tree234::Merge" name="data_structures::tree_234::Tree234::Merge">
-<area shape="rect" id="Node000001" title="Merge the item at index of the parent node, and its left and right child." alt="" coords="5,169,154,210"/>
-<area shape="rect" id="Node000002" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" title="Get the child pointer at position of index." alt="" coords="204,5,351,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="94,167,138,114,167,84,200,57,208,52,211,56,203,61,171,88,142,117,98,171"/>
-<area shape="rect" id="Node000003" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" title="Get item of the \index index." alt="" coords="206,71,349,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="116,167,200,122,213,116,216,121,203,127,119,171"/>
-<area shape="rect" id="Node000004" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" title="Check if node is a 2&#45;node." alt="" coords="205,136,350,177"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="154,175,189,168,190,174,155,180"/>
-<area shape="rect" id="Node000005" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" title="Set child pointer to the position of index." alt="" coords="204,201,350,242"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="154,199,189,205,188,210,154,204"/>
-<area shape="rect" id="Node000006" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1" title="Set the item count of the node." alt="" coords="202,267,353,307"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="120,208,203,251,216,257,213,262,200,256,117,213"/>
-<area shape="rect" id="Node000007" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc" title="Set item value at position of index." alt="" coords="206,332,348,373"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="98,209,142,262,171,291,203,317,211,322,208,327,200,321,168,295,138,265,94,212"/>
-</map>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.md5
deleted file mode 100644
index 8f223094b..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0bf1646aa61c24e2ac9e0183b5e572f8
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.svg
deleted file mode 100644
index 4a91dba47..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph.svg
+++ /dev/null
@@ -1,162 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::Merge Pages: 1 -->
-<svg width="269pt" height="284pt"
- viewBox="0.00 0.00 268.75 283.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 279.5)">
-<title>data_structures::tree_234::Tree234::Merge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Merge the item at index of the parent node, and its left and right child.">
-<polygon fill="#999999" stroke="#666666" points="111.25,-152.5 0,-152.5 0,-122 111.25,-122 111.25,-152.5"/>
-<text text-anchor="start" x="8" y="-139" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="55.62" y="-127.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Merge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" target="_top" xlink:title="Get the child pointer at position of index.">
-<polygon fill="white" stroke="#666666" points="259.25,-275.5 148.75,-275.5 148.75,-245 259.25,-245 259.25,-275.5"/>
-<text text-anchor="start" x="156.75" y="-262" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="204" y="-250.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetChild</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M67.67,-152.65C83.37,-173.63 113.94,-211.32 147.25,-235.25 149.03,-236.53 150.88,-237.76 152.78,-238.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.88,-241.89 161.31,-243.77 154.33,-235.8 150.88,-241.89"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" target="_top" xlink:title="Get item of the \index index.">
-<polygon fill="white" stroke="#666666" points="257.75,-226.5 150.25,-226.5 150.25,-196 257.75,-196 257.75,-226.5"/>
-<text text-anchor="start" x="158.25" y="-213" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="204" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetItem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.11,-152.8C101.94,-162.71 125.76,-175.64 147.25,-186.25 150.34,-187.77 153.54,-189.31 156.77,-190.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.21,-193.97 165.75,-195 158.15,-187.62 155.21,-193.97"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" target="_top" xlink:title="Check if node is a 2&#45;node.">
-<polygon fill="white" stroke="#666666" points="258.5,-177.5 149.5,-177.5 149.5,-147 258.5,-147 258.5,-177.5"/>
-<text text-anchor="start" x="157.5" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="204" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is2Node</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.55,-146.63C120.22,-148.11 129.25,-149.65 138.12,-151.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.29,-154.58 147.74,-152.81 138.47,-147.68 137.29,-154.58"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="258.88,-128.5 149.12,-128.5 149.12,-98 258.88,-98 258.88,-128.5"/>
-<text text-anchor="start" x="157.12" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="204" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.55,-128.25C120.01,-126.86 128.82,-125.41 137.48,-123.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.95,-127.46 147.25,-122.39 136.82,-120.56 137.95,-127.46"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1" target="_top" xlink:title="Set the item count of the node.">
-<polygon fill="white" stroke="#666666" points="260.75,-79.5 147.25,-79.5 147.25,-49 260.75,-49 260.75,-79.5"/>
-<text text-anchor="start" x="155.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="204" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetCount</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.95,-121.63C102.7,-112 126.13,-99.56 147.25,-89.25 150.34,-87.74 153.55,-86.21 156.79,-84.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.16,-87.91 165.78,-80.54 155.23,-81.55 158.16,-87.91"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc" target="_top" xlink:title="Set item value at position of index.">
-<polygon fill="white" stroke="#666666" points="257.38,-30.5 150.62,-30.5 150.62,0 257.38,0 257.38,-30.5"/>
-<text text-anchor="start" x="158.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="204" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetItem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M67.98,-121.66C83.79,-100.84 114.25,-63.83 147.25,-40.25 149.21,-38.85 151.27,-37.5 153.38,-36.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.59,-39.53 161.61,-31.6 151.18,-33.42 154.59,-39.53"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph_org.svg
deleted file mode 100644
index 7bff0be9f..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a36f4d5f603f7edb7db7c73fb53ba14e9_cgraph_org.svg
+++ /dev/null
@@ -1,136 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::Merge Pages: 1 -->
-<svg width="269pt" height="284pt"
- viewBox="0.00 0.00 268.75 283.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 279.5)">
-<title>data_structures::tree_234::Tree234::Merge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Merge the item at index of the parent node, and its left and right child.">
-<polygon fill="#999999" stroke="#666666" points="111.25,-152.5 0,-152.5 0,-122 111.25,-122 111.25,-152.5"/>
-<text text-anchor="start" x="8" y="-139" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="55.62" y="-127.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Merge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" target="_top" xlink:title="Get the child pointer at position of index.">
-<polygon fill="white" stroke="#666666" points="259.25,-275.5 148.75,-275.5 148.75,-245 259.25,-245 259.25,-275.5"/>
-<text text-anchor="start" x="156.75" y="-262" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="204" y="-250.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetChild</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M67.67,-152.65C83.37,-173.63 113.94,-211.32 147.25,-235.25 149.03,-236.53 150.88,-237.76 152.78,-238.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.88,-241.89 161.31,-243.77 154.33,-235.8 150.88,-241.89"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" target="_top" xlink:title="Get item of the \index index.">
-<polygon fill="white" stroke="#666666" points="257.75,-226.5 150.25,-226.5 150.25,-196 257.75,-196 257.75,-226.5"/>
-<text text-anchor="start" x="158.25" y="-213" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="204" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetItem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.11,-152.8C101.94,-162.71 125.76,-175.64 147.25,-186.25 150.34,-187.77 153.54,-189.31 156.77,-190.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.21,-193.97 165.75,-195 158.15,-187.62 155.21,-193.97"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" target="_top" xlink:title="Check if node is a 2&#45;node.">
-<polygon fill="white" stroke="#666666" points="258.5,-177.5 149.5,-177.5 149.5,-147 258.5,-147 258.5,-177.5"/>
-<text text-anchor="start" x="157.5" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="204" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is2Node</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.55,-146.63C120.22,-148.11 129.25,-149.65 138.12,-151.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.29,-154.58 147.74,-152.81 138.47,-147.68 137.29,-154.58"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="258.88,-128.5 149.12,-128.5 149.12,-98 258.88,-98 258.88,-128.5"/>
-<text text-anchor="start" x="157.12" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="204" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.55,-128.25C120.01,-126.86 128.82,-125.41 137.48,-123.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.95,-127.46 147.25,-122.39 136.82,-120.56 137.95,-127.46"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1" target="_top" xlink:title="Set the item count of the node.">
-<polygon fill="white" stroke="#666666" points="260.75,-79.5 147.25,-79.5 147.25,-49 260.75,-49 260.75,-79.5"/>
-<text text-anchor="start" x="155.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="204" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetCount</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.95,-121.63C102.7,-112 126.13,-99.56 147.25,-89.25 150.34,-87.74 153.55,-86.21 156.79,-84.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.16,-87.91 165.78,-80.54 155.23,-81.55 158.16,-87.91"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc" target="_top" xlink:title="Set item value at position of index.">
-<polygon fill="white" stroke="#666666" points="257.38,-30.5 150.62,-30.5 150.62,0 257.38,0 257.38,-30.5"/>
-<text text-anchor="start" x="158.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="204" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetItem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M67.98,-121.66C83.79,-100.84 114.25,-63.83 147.25,-40.25 149.21,-38.85 151.27,-37.5 153.38,-36.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.59,-39.53 161.61,-31.6 151.18,-33.42 154.59,-39.53"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.map
deleted file mode 100644
index 8706ac94d..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.map
+++ /dev/null
@@ -1,46 +0,0 @@
-<map id="data_structures::tree_234::Tree234::Remove" name="data_structures::tree_234::Tree234::Remove">
-<area shape="rect" id="Node000001" title="Remove item from tree." alt="" coords="5,585,167,626"/>
-<area shape="rect" id="Node000002" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4" title="Main function implement the pre&#45;merge remove operation." alt="" coords="215,585,432,626"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="167,603,199,603,199,608,167,608"/>
-<area shape="rect" id="Node000003" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657" title="Get the max item of the tree." alt="" coords="480,71,690,111"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="326,584,343,515,373,414,418,299,446,242,478,188,509,150,543,119,546,123,513,154,482,191,451,244,423,301,378,416,348,516,331,586"/>
-<area shape="rect" id="Node000006" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36" title="Get the min item of the tree." alt="" coords="482,201,688,242"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="336,584,559,254,563,257,341,587"/>
-<area shape="rect" id="Node000009" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" title="Check if node is a 2&#45;node." alt="" coords="769,593,915,634"/>
-<area shape="poly" id="edge8_Node000002_Node000009" title=" " alt="" coords="410,582,480,571,585,563,691,571,763,586,761,591,690,576,585,568,480,576,411,587"/>
-<area shape="rect" id="Node000010" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18" title="Check if node is a 3&#45;node or 4&#45;node, this is useful when we delete item from 2&#45;3&#45;4 tree." alt="" coords="509,815,661,855"/>
-<area shape="poly" id="edge9_Node000002_Node000010" title=" " alt="" coords="339,625,394,706,435,753,482,794,500,805,497,810,478,798,431,757,390,710,334,628"/>
-<area shape="rect" id="Node000011" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e" title="Do the actual left rotate operation." alt="" coords="755,659,929,699"/>
-<area shape="poly" id="edge10_Node000002_Node000011" title=" " alt="" coords="420,624,480,635,616,654,740,667,739,673,615,659,480,640,419,629"/>
-<area shape="rect" id="Node000012" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9" title="Merge the item at index of the parent node, and its left and right child." alt="" coords="511,463,659,503"/>
-<area shape="poly" id="edge11_Node000002_Node000012" title=" " alt="" coords="365,583,479,527,522,508,524,512,481,532,367,587"/>
-<area shape="rect" id="Node000018" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9" title="Do the actual right rotate operation." alt="" coords="751,736,933,777"/>
-<area shape="poly" id="edge18_Node000002_Node000018" title=" " alt="" coords="341,625,364,655,396,690,436,724,481,750,544,768,611,776,676,777,735,772,736,778,676,782,610,782,543,773,479,755,433,729,392,694,360,658,336,628"/>
-<area shape="rect" id="Node000019" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9" title="A handy function to try if we can do a left rotate to the target node." alt="" coords="489,585,681,626"/>
-<area shape="poly" id="edge19_Node000002_Node000019" title=" " alt="" coords="432,603,473,603,473,608,432,608"/>
-<area shape="rect" id="Node000020" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3" title="A handy function to try if we can do a right rotate to the target node." alt="" coords="484,700,686,741"/>
-<area shape="poly" id="edge22_Node000002_Node000020" title=" " alt="" coords="366,624,481,679,512,692,510,697,479,684,363,629"/>
-<area shape="rect" id="Node000004" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57" title="Get max item (rightmost) in the current node." alt="" coords="758,5,926,46"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="667,67,744,48,745,53,669,73"/>
-<area shape="rect" id="Node000005" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94" title="Get rightmose child of the current node." alt="" coords="738,71,946,111"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="691,88,723,88,723,94,691,94"/>
-<area shape="rect" id="Node000007" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e" title="Get leftmose child of the current node." alt="" coords="743,136,941,177"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="667,198,744,178,745,184,669,203"/>
-<area shape="rect" id="Node000008" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71" title="get min item (leftmost) in the current node" alt="" coords="760,201,924,242"/>
-<area shape="poly" id="edge7_Node000006_Node000008" title=" " alt="" coords="689,219,744,219,744,224,689,224"/>
-<area shape="poly" id="edge14_Node000012_Node000009" title=" " alt="" coords="645,502,692,527,707,541,716,554,725,566,740,578,756,587,754,592,737,583,721,570,712,557,703,545,689,532,642,506"/>
-<area shape="rect" id="Node000013" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" title="Get the child pointer at position of index." alt="" coords="768,332,916,373"/>
-<area shape="poly" id="edge12_Node000012_Node000013" title=" " alt="" coords="613,460,669,422,737,383,754,376,756,381,740,388,672,426,616,464"/>
-<area shape="rect" id="Node000014" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" title="Get item of the \index index." alt="" coords="770,397,914,438"/>
-<area shape="poly" id="edge13_Node000012_Node000014" title=" " alt="" coords="659,462,754,437,756,442,660,467"/>
-<area shape="rect" id="Node000015" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" title="Set child pointer to the position of index." alt="" coords="769,463,915,503"/>
-<area shape="poly" id="edge15_Node000012_Node000015" title=" " alt="" coords="660,480,753,480,753,486,660,486"/>
-<area shape="rect" id="Node000016" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1" title="Set the item count of the node." alt="" coords="766,528,918,569"/>
-<area shape="poly" id="edge16_Node000012_Node000016" title=" " alt="" coords="660,499,752,523,750,528,659,504"/>
-<area shape="rect" id="Node000017" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc" title="Set item value at position of index." alt="" coords="771,267,913,307"/>
-<area shape="poly" id="edge17_Node000012_Node000017" title=" " alt="" coords="598,461,654,391,693,352,737,318,755,308,758,313,740,323,696,356,658,395,602,464"/>
-<area shape="poly" id="edge20_Node000019_Node000009" title=" " alt="" coords="682,606,754,608,754,614,682,611"/>
-<area shape="poly" id="edge21_Node000019_Node000011" title=" " alt="" coords="660,624,754,651,753,656,658,629"/>
-<area shape="poly" id="edge23_Node000020_Node000009" title=" " alt="" coords="625,697,737,645,757,637,759,642,739,649,627,702"/>
-<area shape="poly" id="edge24_Node000020_Node000018" title=" " alt="" coords="687,732,736,739,735,744,686,737"/>
-</map>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.md5
deleted file mode 100644
index 76c6b18d3..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-56a15f5779160075adf9553e4289531e
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.svg
deleted file mode 100644
index 24fcff493..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph.svg
+++ /dev/null
@@ -1,511 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::Remove Pages: 1 -->
-<!--zoomable 646 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 713;
-var viewHeight = 646;
-var sectionId = 'dynsection-12';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>data_structures::tree_234::Tree234::Remove</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Remove item from tree.">
-<polygon fill="#999999" stroke="#666666" points="121,-202.5 0,-202.5 0,-172 121,-172 121,-202.5"/>
-<text text-anchor="start" x="8" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="60.5" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Remove</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4" target="_top" xlink:title="Main function implement the pre&#45;merge remove operation.">
-<polygon fill="white" stroke="#666666" points="320,-202.5 157,-202.5 157,-172 320,-172 320,-202.5"/>
-<text text-anchor="start" x="165" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="238.5" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::RemovePreMerge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.09,-187.25C128.97,-187.25 137.2,-187.25 145.47,-187.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.24,-190.75 155.24,-187.25 145.24,-183.75 145.24,-190.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657" target="_top" xlink:title="Get the max item of the tree.">
-<polygon fill="white" stroke="#666666" points="513.75,-588.5 356,-588.5 356,-558 513.75,-558 513.75,-588.5"/>
-<text text-anchor="start" x="364" y="-575" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="434.88" y="-563.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.65,-202.67C252.87,-250.13 288.4,-397 356,-499.25 369.02,-518.94 388.2,-537.25 404.27,-550.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="401.68,-553.13 411.64,-556.74 406.1,-547.71 401.68,-553.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36" target="_top" xlink:title="Get the min item of the tree.">
-<polygon fill="white" stroke="#666666" points="512.25,-490.5 357.5,-490.5 357.5,-460 512.25,-460 512.25,-490.5"/>
-<text text-anchor="start" x="365.5" y="-477" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="434.88" y="-465.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.95,-202.73C281.79,-249.91 377.79,-392.15 416.96,-450.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.03,-452.1 422.53,-458.43 419.83,-448.19 414.03,-452.1"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" target="_top" xlink:title="Check if node is a 2&#45;node.">
-<polygon fill="white" stroke="#666666" points="682,-196.5 573,-196.5 573,-166 682,-166 682,-196.5"/>
-<text text-anchor="start" x="581" y="-183" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is2Node</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.15,-203C320.93,-206.42 339.05,-209.52 356,-211.25 425.75,-218.36 444.23,-220.34 513.75,-211.25 531.46,-208.93 550.35,-204.65 567.5,-200.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="568.34,-203.44 577.04,-197.38 566.46,-196.69 568.34,-203.44"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18" target="_top" xlink:title="Check if node is a 3&#45;node or 4&#45;node, this is useful when we delete item from 2&#45;3&#45;4 tree.">
-<polygon fill="white" stroke="#666666" points="492,-30.5 377.75,-30.5 377.75,0 492,0 492,-30.5"/>
-<text text-anchor="start" x="385.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="434.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is34Node</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge9_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.33,-171.62C265.48,-142.59 306.03,-80.06 356,-44.25 360.32,-41.16 365,-38.35 369.86,-35.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="371.12,-39.1 378.65,-31.64 368.12,-32.77 371.12,-39.1"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e" target="_top" xlink:title="Do the actual left rotate operation.">
-<polygon fill="white" stroke="#666666" points="692.5,-147.5 562.5,-147.5 562.5,-117 692.5,-117 692.5,-147.5"/>
-<text text-anchor="start" x="570.5" y="-134" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::LeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge10_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge10_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M310.78,-171.52C325.68,-168.52 341.32,-165.6 356,-163.25 421.47,-152.78 496.41,-144.47 550.78,-139.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="550.94,-142.61 560.55,-138.15 550.26,-135.64 550.94,-142.61"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9" target="_top" xlink:title="Merge the item at index of the parent node, and its left and right child.">
-<polygon fill="white" stroke="#666666" points="490.5,-294.5 379.25,-294.5 379.25,-264 490.5,-264 490.5,-294.5"/>
-<text text-anchor="start" x="387.25" y="-281" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="434.88" y="-269.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Merge</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge11_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge11_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.52,-202.77C293.92,-214.39 326.85,-230.57 356,-244.25 366.37,-249.11 377.57,-254.23 388.16,-259"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="386.55,-262.12 397.11,-263.02 389.41,-255.73 386.55,-262.12"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9" target="_top" xlink:title="Do the actual right rotate operation.">
-<polygon fill="white" stroke="#666666" points="695.88,-89.5 559.12,-89.5 559.12,-59 695.88,-59 695.88,-89.5"/>
-<text text-anchor="start" x="567.12" y="-76" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-64.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::RightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node18 -->
-<g id="edge18_Node000002_Node000018" class="edge">
-<title>Node2&#45;&gt;Node18</title>
-<g id="a_edge18_Node000002_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.82,-171.83C267.84,-146.45 307.77,-96.73 356,-77.25 416.91,-52.65 492,-54.03 547.6,-60.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="546.95,-63.8 557.31,-61.54 547.8,-56.85 546.95,-63.8"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9" target="_top" xlink:title="A handy function to try if we can do a left rotate to the target node.">
-<polygon fill="white" stroke="#666666" points="507,-202.5 362.75,-202.5 362.75,-172 507,-172 507,-202.5"/>
-<text text-anchor="start" x="370.75" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="434.88" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryLeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node19 -->
-<g id="edge19_Node000002_Node000019" class="edge">
-<title>Node2&#45;&gt;Node19</title>
-<g id="a_edge19_Node000002_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M320.24,-187.25C330.4,-187.25 340.8,-187.25 350.99,-187.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.86,-190.75 360.86,-187.25 350.86,-183.75 350.86,-190.75"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3" target="_top" xlink:title="A handy function to try if we can do a right rotate to the target node.">
-<polygon fill="white" stroke="#666666" points="510.38,-116.5 359.38,-116.5 359.38,-86 510.38,-86 510.38,-116.5"/>
-<text text-anchor="start" x="367.38" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="434.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryRightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node20 -->
-<g id="edge22_Node000002_Node000020" class="edge">
-<title>Node2&#45;&gt;Node20</title>
-<g id="a_edge22_Node000002_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M269.29,-171.66C292.61,-159.71 326,-143.14 356,-130.25 363.38,-127.08 371.24,-123.92 379.01,-120.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.99,-124.28 388.09,-117.45 377.5,-117.73 379.99,-124.28"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57" target="_top" xlink:title="Get max item (rightmost) in the current node.">
-<polygon fill="white" stroke="#666666" points="690.62,-637.5 564.38,-637.5 564.38,-607 690.62,-607 690.62,-637.5"/>
-<text text-anchor="start" x="572.38" y="-624" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-612.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M496.98,-588.96C515.27,-593.66 535.51,-598.86 554.45,-603.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="553.4,-607.07 563.95,-606.17 555.14,-600.29 553.4,-607.07"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94" target="_top" xlink:title="Get rightmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="705.25,-588.5 549.75,-588.5 549.75,-558 705.25,-558 705.25,-588.5"/>
-<text text-anchor="start" x="557.75" y="-575" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-563.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetRightmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M514.23,-573.25C522.03,-573.25 529.98,-573.25 537.88,-573.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="537.85,-576.75 547.85,-573.25 537.85,-569.75 537.85,-576.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e" target="_top" xlink:title="Get leftmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="701.88,-539.5 553.12,-539.5 553.12,-509 701.88,-509 701.88,-539.5"/>
-<text text-anchor="start" x="561.12" y="-526" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-514.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetLeftmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M496.98,-490.96C515.27,-495.66 535.51,-500.86 554.45,-505.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="553.4,-509.07 563.95,-508.17 555.14,-502.29 553.4,-509.07"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71" target="_top" xlink:title="get min item (leftmost) in the current node">
-<polygon fill="white" stroke="#666666" points="689.12,-490.5 565.88,-490.5 565.88,-460 689.12,-460 689.12,-490.5"/>
-<text text-anchor="start" x="573.88" y="-477" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-465.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M512.59,-475.25C526.33,-475.25 540.6,-475.25 554.21,-475.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="553.95,-478.75 563.95,-475.25 553.95,-471.75 553.95,-478.75"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node9 -->
-<g id="edge14_Node000012_Node000009" class="edge">
-<title>Node12&#45;&gt;Node9</title>
-<g id="a_edge14_Node000012_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M478.73,-263.57C490.59,-258.3 503.11,-251.8 513.75,-244.25 532.72,-230.78 530.08,-218.68 549.75,-206.25 553.68,-203.77 557.88,-201.5 562.22,-199.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="563.32,-202.79 571.13,-195.63 560.56,-196.36 563.32,-202.79"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" target="_top" xlink:title="Get the child pointer at position of index.">
-<polygon fill="white" stroke="#666666" points="682.75,-392.5 572.25,-392.5 572.25,-362 682.75,-362 682.75,-392.5"/>
-<text text-anchor="start" x="580.25" y="-379" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-367.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetChild</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge12_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge12_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M456.75,-294.96C478.9,-311.05 515.37,-335.96 549.75,-352.25 553.7,-354.12 557.82,-355.91 562.02,-357.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="560.55,-360.78 571.14,-361.08 563.04,-354.24 560.55,-360.78"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" target="_top" xlink:title="Get item of the \index index.">
-<polygon fill="white" stroke="#666666" points="681.25,-343.5 573.75,-343.5 573.75,-313 681.25,-313 681.25,-343.5"/>
-<text text-anchor="start" x="581.75" y="-330" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-318.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetItem</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node14 -->
-<g id="edge13_Node000012_Node000014" class="edge">
-<title>Node12&#45;&gt;Node14</title>
-<g id="a_edge13_Node000012_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M490.76,-293.36C513.06,-299.09 539,-305.76 562.18,-311.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="561.3,-315.1 571.85,-314.2 563.04,-308.32 561.3,-315.1"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="682.38,-294.5 572.62,-294.5 572.62,-264 682.38,-264 682.38,-294.5"/>
-<text text-anchor="start" x="580.62" y="-281" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-269.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node15 -->
-<g id="edge15_Node000012_Node000015" class="edge">
-<title>Node12&#45;&gt;Node15</title>
-<g id="a_edge15_Node000012_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M490.76,-279.25C512.68,-279.25 538.11,-279.25 560.99,-279.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="560.82,-282.75 570.82,-279.25 560.82,-275.75 560.82,-282.75"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1" target="_top" xlink:title="Set the item count of the node.">
-<polygon fill="white" stroke="#666666" points="684.25,-245.5 570.75,-245.5 570.75,-215 684.25,-215 684.25,-245.5"/>
-<text text-anchor="start" x="578.75" y="-232" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetCount</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node16 -->
-<g id="edge16_Node000012_Node000016" class="edge">
-<title>Node12&#45;&gt;Node16</title>
-<g id="a_edge16_Node000012_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M490.76,-265.14C512.11,-259.65 536.8,-253.31 559.21,-247.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="560.07,-250.94 568.89,-245.06 558.33,-244.16 560.07,-250.94"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc" target="_top" xlink:title="Set item value at position of index.">
-<polygon fill="white" stroke="#666666" points="680.88,-441.5 574.12,-441.5 574.12,-411 680.88,-411 680.88,-441.5"/>
-<text text-anchor="start" x="582.12" y="-428" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-416.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetItem</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node17 -->
-<g id="edge17_Node000012_Node000017" class="edge">
-<title>Node12&#45;&gt;Node17</title>
-<g id="a_edge17_Node000012_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M446.28,-294.72C464.36,-320.46 504.06,-372.13 549.75,-401.25 553.99,-403.95 558.54,-406.38 563.24,-408.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="561.73,-411.73 572.3,-412.4 564.45,-405.28 561.73,-411.73"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node9 -->
-<g id="edge20_Node000019_Node000009" class="edge">
-<title>Node19&#45;&gt;Node9</title>
-<g id="a_edge20_Node000019_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M507.4,-185C525.16,-184.44 544.11,-183.84 561.54,-183.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="561.35,-186.8 571.24,-182.99 561.13,-179.81 561.35,-186.8"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node11 -->
-<g id="edge21_Node000019_Node000011" class="edge">
-<title>Node19&#45;&gt;Node11</title>
-<g id="a_edge21_Node000019_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M490.25,-171.56C512.38,-165.18 538.15,-157.74 561.29,-151.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="561.97,-154.51 570.6,-148.38 560.02,-147.79 561.97,-154.51"/>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node9 -->
-<g id="edge23_Node000020_Node000009" class="edge">
-<title>Node20&#45;&gt;Node9</title>
-<g id="a_edge23_Node000020_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M465.35,-116.85C488.05,-128.52 520.42,-144.45 549.75,-156.25 554.41,-158.12 559.27,-159.96 564.18,-161.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="562.94,-165.01 573.53,-165.02 565.26,-158.41 562.94,-165.01"/>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node18 -->
-<g id="edge24_Node000020_Node000018" class="edge">
-<title>Node20&#45;&gt;Node18</title>
-<g id="a_edge24_Node000020_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M510.67,-90.66C522.81,-88.94 535.41,-87.15 547.64,-85.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="547.84,-88.93 557.25,-84.06 546.86,-82 547.84,-88.93"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph_org.svg
deleted file mode 100644
index b7de917e0..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a5da1be3f5b5d967ebb36a201f3ebad11_cgraph_org.svg
+++ /dev/null
@@ -1,428 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::Remove Pages: 1 -->
-<svg width="713pt" height="646pt"
- viewBox="0.00 0.00 713.25 645.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 641.5)">
-<title>data_structures::tree_234::Tree234::Remove</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Remove item from tree.">
-<polygon fill="#999999" stroke="#666666" points="121,-202.5 0,-202.5 0,-172 121,-172 121,-202.5"/>
-<text text-anchor="start" x="8" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="60.5" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Remove</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4" target="_top" xlink:title="Main function implement the pre&#45;merge remove operation.">
-<polygon fill="white" stroke="#666666" points="320,-202.5 157,-202.5 157,-172 320,-172 320,-202.5"/>
-<text text-anchor="start" x="165" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="238.5" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::RemovePreMerge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.09,-187.25C128.97,-187.25 137.2,-187.25 145.47,-187.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.24,-190.75 155.24,-187.25 145.24,-183.75 145.24,-190.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657" target="_top" xlink:title="Get the max item of the tree.">
-<polygon fill="white" stroke="#666666" points="513.75,-588.5 356,-588.5 356,-558 513.75,-558 513.75,-588.5"/>
-<text text-anchor="start" x="364" y="-575" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="434.88" y="-563.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.65,-202.67C252.87,-250.13 288.4,-397 356,-499.25 369.02,-518.94 388.2,-537.25 404.27,-550.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="401.68,-553.13 411.64,-556.74 406.1,-547.71 401.68,-553.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36" target="_top" xlink:title="Get the min item of the tree.">
-<polygon fill="white" stroke="#666666" points="512.25,-490.5 357.5,-490.5 357.5,-460 512.25,-460 512.25,-490.5"/>
-<text text-anchor="start" x="365.5" y="-477" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="434.88" y="-465.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.95,-202.73C281.79,-249.91 377.79,-392.15 416.96,-450.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.03,-452.1 422.53,-458.43 419.83,-448.19 414.03,-452.1"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" target="_top" xlink:title="Check if node is a 2&#45;node.">
-<polygon fill="white" stroke="#666666" points="682,-196.5 573,-196.5 573,-166 682,-166 682,-196.5"/>
-<text text-anchor="start" x="581" y="-183" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is2Node</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.15,-203C320.93,-206.42 339.05,-209.52 356,-211.25 425.75,-218.36 444.23,-220.34 513.75,-211.25 531.46,-208.93 550.35,-204.65 567.5,-200.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="568.34,-203.44 577.04,-197.38 566.46,-196.69 568.34,-203.44"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18" target="_top" xlink:title="Check if node is a 3&#45;node or 4&#45;node, this is useful when we delete item from 2&#45;3&#45;4 tree.">
-<polygon fill="white" stroke="#666666" points="492,-30.5 377.75,-30.5 377.75,0 492,0 492,-30.5"/>
-<text text-anchor="start" x="385.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="434.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is34Node</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge9_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.33,-171.62C265.48,-142.59 306.03,-80.06 356,-44.25 360.32,-41.16 365,-38.35 369.86,-35.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="371.12,-39.1 378.65,-31.64 368.12,-32.77 371.12,-39.1"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e" target="_top" xlink:title="Do the actual left rotate operation.">
-<polygon fill="white" stroke="#666666" points="692.5,-147.5 562.5,-147.5 562.5,-117 692.5,-117 692.5,-147.5"/>
-<text text-anchor="start" x="570.5" y="-134" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::LeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge10_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge10_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M310.78,-171.52C325.68,-168.52 341.32,-165.6 356,-163.25 421.47,-152.78 496.41,-144.47 550.78,-139.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="550.94,-142.61 560.55,-138.15 550.26,-135.64 550.94,-142.61"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9" target="_top" xlink:title="Merge the item at index of the parent node, and its left and right child.">
-<polygon fill="white" stroke="#666666" points="490.5,-294.5 379.25,-294.5 379.25,-264 490.5,-264 490.5,-294.5"/>
-<text text-anchor="start" x="387.25" y="-281" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="434.88" y="-269.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Merge</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge11_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge11_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.52,-202.77C293.92,-214.39 326.85,-230.57 356,-244.25 366.37,-249.11 377.57,-254.23 388.16,-259"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="386.55,-262.12 397.11,-263.02 389.41,-255.73 386.55,-262.12"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9" target="_top" xlink:title="Do the actual right rotate operation.">
-<polygon fill="white" stroke="#666666" points="695.88,-89.5 559.12,-89.5 559.12,-59 695.88,-59 695.88,-89.5"/>
-<text text-anchor="start" x="567.12" y="-76" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-64.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::RightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node18 -->
-<g id="edge18_Node000002_Node000018" class="edge">
-<title>Node2&#45;&gt;Node18</title>
-<g id="a_edge18_Node000002_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.82,-171.83C267.84,-146.45 307.77,-96.73 356,-77.25 416.91,-52.65 492,-54.03 547.6,-60.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="546.95,-63.8 557.31,-61.54 547.8,-56.85 546.95,-63.8"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9" target="_top" xlink:title="A handy function to try if we can do a left rotate to the target node.">
-<polygon fill="white" stroke="#666666" points="507,-202.5 362.75,-202.5 362.75,-172 507,-172 507,-202.5"/>
-<text text-anchor="start" x="370.75" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="434.88" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryLeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node19 -->
-<g id="edge19_Node000002_Node000019" class="edge">
-<title>Node2&#45;&gt;Node19</title>
-<g id="a_edge19_Node000002_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M320.24,-187.25C330.4,-187.25 340.8,-187.25 350.99,-187.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.86,-190.75 360.86,-187.25 350.86,-183.75 350.86,-190.75"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3" target="_top" xlink:title="A handy function to try if we can do a right rotate to the target node.">
-<polygon fill="white" stroke="#666666" points="510.38,-116.5 359.38,-116.5 359.38,-86 510.38,-86 510.38,-116.5"/>
-<text text-anchor="start" x="367.38" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="434.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryRightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node20 -->
-<g id="edge22_Node000002_Node000020" class="edge">
-<title>Node2&#45;&gt;Node20</title>
-<g id="a_edge22_Node000002_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M269.29,-171.66C292.61,-159.71 326,-143.14 356,-130.25 363.38,-127.08 371.24,-123.92 379.01,-120.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.99,-124.28 388.09,-117.45 377.5,-117.73 379.99,-124.28"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57" target="_top" xlink:title="Get max item (rightmost) in the current node.">
-<polygon fill="white" stroke="#666666" points="690.62,-637.5 564.38,-637.5 564.38,-607 690.62,-607 690.62,-637.5"/>
-<text text-anchor="start" x="572.38" y="-624" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-612.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M496.98,-588.96C515.27,-593.66 535.51,-598.86 554.45,-603.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="553.4,-607.07 563.95,-606.17 555.14,-600.29 553.4,-607.07"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94" target="_top" xlink:title="Get rightmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="705.25,-588.5 549.75,-588.5 549.75,-558 705.25,-558 705.25,-588.5"/>
-<text text-anchor="start" x="557.75" y="-575" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-563.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetRightmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M514.23,-573.25C522.03,-573.25 529.98,-573.25 537.88,-573.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="537.85,-576.75 547.85,-573.25 537.85,-569.75 537.85,-576.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e" target="_top" xlink:title="Get leftmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="701.88,-539.5 553.12,-539.5 553.12,-509 701.88,-509 701.88,-539.5"/>
-<text text-anchor="start" x="561.12" y="-526" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-514.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetLeftmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M496.98,-490.96C515.27,-495.66 535.51,-500.86 554.45,-505.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="553.4,-509.07 563.95,-508.17 555.14,-502.29 553.4,-509.07"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71" target="_top" xlink:title="get min item (leftmost) in the current node">
-<polygon fill="white" stroke="#666666" points="689.12,-490.5 565.88,-490.5 565.88,-460 689.12,-460 689.12,-490.5"/>
-<text text-anchor="start" x="573.88" y="-477" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-465.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M512.59,-475.25C526.33,-475.25 540.6,-475.25 554.21,-475.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="553.95,-478.75 563.95,-475.25 553.95,-471.75 553.95,-478.75"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node9 -->
-<g id="edge14_Node000012_Node000009" class="edge">
-<title>Node12&#45;&gt;Node9</title>
-<g id="a_edge14_Node000012_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M478.73,-263.57C490.59,-258.3 503.11,-251.8 513.75,-244.25 532.72,-230.78 530.08,-218.68 549.75,-206.25 553.68,-203.77 557.88,-201.5 562.22,-199.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="563.32,-202.79 571.13,-195.63 560.56,-196.36 563.32,-202.79"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" target="_top" xlink:title="Get the child pointer at position of index.">
-<polygon fill="white" stroke="#666666" points="682.75,-392.5 572.25,-392.5 572.25,-362 682.75,-362 682.75,-392.5"/>
-<text text-anchor="start" x="580.25" y="-379" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-367.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetChild</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge12_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge12_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M456.75,-294.96C478.9,-311.05 515.37,-335.96 549.75,-352.25 553.7,-354.12 557.82,-355.91 562.02,-357.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="560.55,-360.78 571.14,-361.08 563.04,-354.24 560.55,-360.78"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" target="_top" xlink:title="Get item of the \index index.">
-<polygon fill="white" stroke="#666666" points="681.25,-343.5 573.75,-343.5 573.75,-313 681.25,-313 681.25,-343.5"/>
-<text text-anchor="start" x="581.75" y="-330" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-318.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetItem</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node14 -->
-<g id="edge13_Node000012_Node000014" class="edge">
-<title>Node12&#45;&gt;Node14</title>
-<g id="a_edge13_Node000012_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M490.76,-293.36C513.06,-299.09 539,-305.76 562.18,-311.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="561.3,-315.1 571.85,-314.2 563.04,-308.32 561.3,-315.1"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="682.38,-294.5 572.62,-294.5 572.62,-264 682.38,-264 682.38,-294.5"/>
-<text text-anchor="start" x="580.62" y="-281" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-269.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node15 -->
-<g id="edge15_Node000012_Node000015" class="edge">
-<title>Node12&#45;&gt;Node15</title>
-<g id="a_edge15_Node000012_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M490.76,-279.25C512.68,-279.25 538.11,-279.25 560.99,-279.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="560.82,-282.75 570.82,-279.25 560.82,-275.75 560.82,-282.75"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1" target="_top" xlink:title="Set the item count of the node.">
-<polygon fill="white" stroke="#666666" points="684.25,-245.5 570.75,-245.5 570.75,-215 684.25,-215 684.25,-245.5"/>
-<text text-anchor="start" x="578.75" y="-232" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetCount</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node16 -->
-<g id="edge16_Node000012_Node000016" class="edge">
-<title>Node12&#45;&gt;Node16</title>
-<g id="a_edge16_Node000012_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M490.76,-265.14C512.11,-259.65 536.8,-253.31 559.21,-247.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="560.07,-250.94 568.89,-245.06 558.33,-244.16 560.07,-250.94"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc" target="_top" xlink:title="Set item value at position of index.">
-<polygon fill="white" stroke="#666666" points="680.88,-441.5 574.12,-441.5 574.12,-411 680.88,-411 680.88,-441.5"/>
-<text text-anchor="start" x="582.12" y="-428" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="627.5" y="-416.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetItem</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node17 -->
-<g id="edge17_Node000012_Node000017" class="edge">
-<title>Node12&#45;&gt;Node17</title>
-<g id="a_edge17_Node000012_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M446.28,-294.72C464.36,-320.46 504.06,-372.13 549.75,-401.25 553.99,-403.95 558.54,-406.38 563.24,-408.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="561.73,-411.73 572.3,-412.4 564.45,-405.28 561.73,-411.73"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node9 -->
-<g id="edge20_Node000019_Node000009" class="edge">
-<title>Node19&#45;&gt;Node9</title>
-<g id="a_edge20_Node000019_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M507.4,-185C525.16,-184.44 544.11,-183.84 561.54,-183.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="561.35,-186.8 571.24,-182.99 561.13,-179.81 561.35,-186.8"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node11 -->
-<g id="edge21_Node000019_Node000011" class="edge">
-<title>Node19&#45;&gt;Node11</title>
-<g id="a_edge21_Node000019_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M490.25,-171.56C512.38,-165.18 538.15,-157.74 561.29,-151.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="561.97,-154.51 570.6,-148.38 560.02,-147.79 561.97,-154.51"/>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node9 -->
-<g id="edge23_Node000020_Node000009" class="edge">
-<title>Node20&#45;&gt;Node9</title>
-<g id="a_edge23_Node000020_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M465.35,-116.85C488.05,-128.52 520.42,-144.45 549.75,-156.25 554.41,-158.12 559.27,-159.96 564.18,-161.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="562.94,-165.01 573.53,-165.02 565.26,-158.41 562.94,-165.01"/>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node18 -->
-<g id="edge24_Node000020_Node000018" class="edge">
-<title>Node20&#45;&gt;Node18</title>
-<g id="a_edge24_Node000020_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M510.67,-90.66C522.81,-88.94 535.41,-87.15 547.64,-85.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="547.84,-88.93 557.25,-84.06 546.86,-82 547.84,-88.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.map
deleted file mode 100644
index 631c0b7a8..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.map
+++ /dev/null
@@ -1,44 +0,0 @@
-<map id="data_structures::tree_234::Tree234::RemovePreMerge" name="data_structures::tree_234::Tree234::RemovePreMerge">
-<area shape="rect" id="Node000001" title="Main function implement the pre&#45;merge remove operation." alt="" coords="5,585,223,626"/>
-<area shape="rect" id="Node000002" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657" title="Get the max item of the tree." alt="" coords="271,71,481,111"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="117,584,134,515,164,414,209,299,237,242,268,188,299,150,333,119,337,123,303,154,273,191,241,244,213,301,169,416,139,516,122,586"/>
-<area shape="rect" id="Node000005" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36" title="Get the min item of the tree." alt="" coords="273,201,479,242"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="127,584,350,254,354,257,131,587"/>
-<area shape="rect" id="Node000008" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" title="Check if node is a 2&#45;node." alt="" coords="560,593,705,634"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="201,582,270,571,376,563,481,571,553,586,552,591,481,576,376,568,271,576,202,587"/>
-<area shape="rect" id="Node000009" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18" title="Check if node is a 3&#45;node or 4&#45;node, this is useful when we delete item from 2&#45;3&#45;4 tree." alt="" coords="300,815,452,855"/>
-<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="129,625,185,706,225,753,272,794,291,805,288,810,269,798,221,757,180,710,125,628"/>
-<area shape="rect" id="Node000010" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e" title="Do the actual left rotate operation." alt="" coords="546,659,719,699"/>
-<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="211,624,271,635,406,654,531,667,530,673,406,659,270,640,210,629"/>
-<area shape="rect" id="Node000011" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9" title="Merge the item at index of the parent node, and its left and right child." alt="" coords="302,463,450,503"/>
-<area shape="poly" id="edge10_Node000001_Node000011" title=" " alt="" coords="156,583,270,527,312,508,315,512,272,532,158,587"/>
-<area shape="rect" id="Node000017" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9" title="Do the actual right rotate operation." alt="" coords="542,736,724,777"/>
-<area shape="poly" id="edge17_Node000001_Node000017" title=" " alt="" coords="131,625,154,655,187,690,226,724,272,750,335,768,401,776,466,777,526,772,526,778,466,782,401,782,334,773,270,755,223,729,183,694,150,658,127,628"/>
-<area shape="rect" id="Node000018" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9" title="A handy function to try if we can do a left rotate to the target node." alt="" coords="280,585,472,626"/>
-<area shape="poly" id="edge18_Node000001_Node000018" title=" " alt="" coords="223,603,264,603,264,608,223,608"/>
-<area shape="rect" id="Node000019" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3" title="A handy function to try if we can do a right rotate to the target node." alt="" coords="275,700,476,741"/>
-<area shape="poly" id="edge21_Node000001_Node000019" title=" " alt="" coords="156,624,272,679,302,692,300,697,270,684,154,629"/>
-<area shape="rect" id="Node000003" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57" title="Get max item (rightmost) in the current node." alt="" coords="548,5,717,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="458,67,535,48,536,53,459,73"/>
-<area shape="rect" id="Node000004" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94" title="Get rightmose child of the current node." alt="" coords="529,71,736,111"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="482,88,513,88,513,94,482,94"/>
-<area shape="rect" id="Node000006" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e" title="Get leftmose child of the current node." alt="" coords="534,136,732,177"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="458,198,535,178,536,184,459,203"/>
-<area shape="rect" id="Node000007" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71" title="get min item (leftmost) in the current node" alt="" coords="550,201,715,242"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="479,219,535,219,535,224,479,224"/>
-<area shape="poly" id="edge13_Node000011_Node000008" title=" " alt="" coords="436,502,483,527,497,541,507,554,516,566,530,578,547,587,544,592,528,583,512,570,503,557,493,545,479,532,433,506"/>
-<area shape="rect" id="Node000012" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" title="Get the child pointer at position of index." alt="" coords="559,332,706,373"/>
-<area shape="poly" id="edge11_Node000011_Node000012" title=" " alt="" coords="404,460,459,422,528,383,544,376,546,381,530,388,462,426,407,464"/>
-<area shape="rect" id="Node000013" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" title="Get item of the \index index." alt="" coords="561,397,704,438"/>
-<area shape="poly" id="edge12_Node000011_Node000013" title=" " alt="" coords="450,462,545,437,546,442,451,467"/>
-<area shape="rect" id="Node000014" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" title="Set child pointer to the position of index." alt="" coords="560,463,706,503"/>
-<area shape="poly" id="edge14_Node000011_Node000014" title=" " alt="" coords="450,480,544,480,544,486,450,486"/>
-<area shape="rect" id="Node000015" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1" title="Set the item count of the node." alt="" coords="557,528,708,569"/>
-<area shape="poly" id="edge15_Node000011_Node000015" title=" " alt="" coords="451,499,542,523,541,528,450,504"/>
-<area shape="rect" id="Node000016" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc" title="Set item value at position of index." alt="" coords="562,267,704,307"/>
-<area shape="poly" id="edge16_Node000011_Node000016" title=" " alt="" coords="389,461,444,391,483,352,528,318,546,308,548,313,530,323,487,356,448,395,393,464"/>
-<area shape="poly" id="edge19_Node000018_Node000008" title=" " alt="" coords="473,606,545,608,545,614,472,611"/>
-<area shape="poly" id="edge20_Node000018_Node000010" title=" " alt="" coords="450,624,545,651,544,656,449,629"/>
-<area shape="poly" id="edge22_Node000019_Node000008" title=" " alt="" coords="415,697,528,645,547,637,549,642,530,649,418,702"/>
-<area shape="poly" id="edge23_Node000019_Node000017" title=" " alt="" coords="477,732,527,739,526,744,477,737"/>
-</map>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.md5
deleted file mode 100644
index 43d254765..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-60a496b3cfead2e226fc1033ca6e026e
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.svg
deleted file mode 100644
index c5aa57c8e..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph.svg
+++ /dev/null
@@ -1,492 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::RemovePreMerge Pages: 1 -->
-<!--zoomable 646 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 556;
-var viewHeight = 646;
-var sectionId = 'dynsection-13';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>data_structures::tree_234::Tree234::RemovePreMerge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function implement the pre&#45;merge remove operation.">
-<polygon fill="#999999" stroke="#666666" points="163,-202.5 0,-202.5 0,-172 163,-172 163,-202.5"/>
-<text text-anchor="start" x="8" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="81.5" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::RemovePreMerge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657" target="_top" xlink:title="Get the max item of the tree.">
-<polygon fill="white" stroke="#666666" points="356.75,-588.5 199,-588.5 199,-558 356.75,-558 356.75,-588.5"/>
-<text text-anchor="start" x="207" y="-575" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="277.88" y="-563.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.65,-202.67C95.87,-250.13 131.4,-397 199,-499.25 212.02,-518.94 231.2,-537.25 247.27,-550.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.68,-553.13 254.64,-556.74 249.1,-547.71 244.68,-553.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36" target="_top" xlink:title="Get the min item of the tree.">
-<polygon fill="white" stroke="#666666" points="355.25,-490.5 200.5,-490.5 200.5,-460 355.25,-460 355.25,-490.5"/>
-<text text-anchor="start" x="208.5" y="-477" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="277.88" y="-465.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.95,-202.73C124.79,-249.91 220.79,-392.15 259.96,-450.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.03,-452.1 265.53,-458.43 262.83,-448.19 257.03,-452.1"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" target="_top" xlink:title="Check if node is a 2&#45;node.">
-<polygon fill="white" stroke="#666666" points="525,-196.5 416,-196.5 416,-166 525,-166 525,-196.5"/>
-<text text-anchor="start" x="424" y="-183" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is2Node</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.15,-203C163.93,-206.42 182.05,-209.52 199,-211.25 268.75,-218.36 287.23,-220.34 356.75,-211.25 374.46,-208.93 393.35,-204.65 410.5,-200.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="411.34,-203.44 420.04,-197.38 409.46,-196.69 411.34,-203.44"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18" target="_top" xlink:title="Check if node is a 3&#45;node or 4&#45;node, this is useful when we delete item from 2&#45;3&#45;4 tree.">
-<polygon fill="white" stroke="#666666" points="335,-30.5 220.75,-30.5 220.75,0 335,0 335,-30.5"/>
-<text text-anchor="start" x="228.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="277.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is34Node</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.33,-171.62C108.48,-142.59 149.03,-80.06 199,-44.25 203.32,-41.16 208,-38.35 212.86,-35.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.12,-39.1 221.65,-31.64 211.12,-32.77 214.12,-39.1"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e" target="_top" xlink:title="Do the actual left rotate operation.">
-<polygon fill="white" stroke="#666666" points="535.5,-147.5 405.5,-147.5 405.5,-117 535.5,-117 535.5,-147.5"/>
-<text text-anchor="start" x="413.5" y="-134" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::LeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.78,-171.52C168.68,-168.52 184.32,-165.6 199,-163.25 264.47,-152.78 339.41,-144.47 393.78,-139.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.94,-142.61 403.55,-138.15 393.26,-135.64 393.94,-142.61"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9" target="_top" xlink:title="Merge the item at index of the parent node, and its left and right child.">
-<polygon fill="white" stroke="#666666" points="333.5,-294.5 222.25,-294.5 222.25,-264 333.5,-264 333.5,-294.5"/>
-<text text-anchor="start" x="230.25" y="-281" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="277.88" y="-269.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Merge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.52,-202.77C136.92,-214.39 169.85,-230.57 199,-244.25 209.37,-249.11 220.57,-254.23 231.16,-259"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.55,-262.12 240.11,-263.02 232.41,-255.73 229.55,-262.12"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9" target="_top" xlink:title="Do the actual right rotate operation.">
-<polygon fill="white" stroke="#666666" points="538.88,-89.5 402.12,-89.5 402.12,-59 538.88,-59 538.88,-89.5"/>
-<text text-anchor="start" x="410.12" y="-76" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-64.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::RightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge17_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge17_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.82,-171.83C110.84,-146.45 150.77,-96.73 199,-77.25 259.91,-52.65 335,-54.03 390.6,-60.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="389.95,-63.8 400.31,-61.54 390.8,-56.85 389.95,-63.8"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9" target="_top" xlink:title="A handy function to try if we can do a left rotate to the target node.">
-<polygon fill="white" stroke="#666666" points="350,-202.5 205.75,-202.5 205.75,-172 350,-172 350,-202.5"/>
-<text text-anchor="start" x="213.75" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="277.88" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryLeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node18 -->
-<g id="edge18_Node000001_Node000018" class="edge">
-<title>Node1&#45;&gt;Node18</title>
-<g id="a_edge18_Node000001_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.24,-187.25C173.4,-187.25 183.8,-187.25 193.99,-187.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="193.86,-190.75 203.86,-187.25 193.86,-183.75 193.86,-190.75"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3" target="_top" xlink:title="A handy function to try if we can do a right rotate to the target node.">
-<polygon fill="white" stroke="#666666" points="353.38,-116.5 202.38,-116.5 202.38,-86 353.38,-86 353.38,-116.5"/>
-<text text-anchor="start" x="210.38" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="277.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryRightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node19 -->
-<g id="edge21_Node000001_Node000019" class="edge">
-<title>Node1&#45;&gt;Node19</title>
-<g id="a_edge21_Node000001_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.29,-171.66C135.61,-159.71 169,-143.14 199,-130.25 206.38,-127.08 214.24,-123.92 222.01,-120.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.99,-124.28 231.09,-117.45 220.5,-117.73 222.99,-124.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57" target="_top" xlink:title="Get max item (rightmost) in the current node.">
-<polygon fill="white" stroke="#666666" points="533.62,-637.5 407.38,-637.5 407.38,-607 533.62,-607 533.62,-637.5"/>
-<text text-anchor="start" x="415.38" y="-624" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-612.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M339.98,-588.96C358.27,-593.66 378.51,-598.86 397.45,-603.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.4,-607.07 406.95,-606.17 398.14,-600.29 396.4,-607.07"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94" target="_top" xlink:title="Get rightmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="548.25,-588.5 392.75,-588.5 392.75,-558 548.25,-558 548.25,-588.5"/>
-<text text-anchor="start" x="400.75" y="-575" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-563.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetRightmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M357.23,-573.25C365.03,-573.25 372.98,-573.25 380.88,-573.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="380.85,-576.75 390.85,-573.25 380.85,-569.75 380.85,-576.75"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e" target="_top" xlink:title="Get leftmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="544.88,-539.5 396.12,-539.5 396.12,-509 544.88,-509 544.88,-539.5"/>
-<text text-anchor="start" x="404.12" y="-526" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-514.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetLeftmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M339.98,-490.96C358.27,-495.66 378.51,-500.86 397.45,-505.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.4,-509.07 406.95,-508.17 398.14,-502.29 396.4,-509.07"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71" target="_top" xlink:title="get min item (leftmost) in the current node">
-<polygon fill="white" stroke="#666666" points="532.12,-490.5 408.88,-490.5 408.88,-460 532.12,-460 532.12,-490.5"/>
-<text text-anchor="start" x="416.88" y="-477" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-465.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M355.59,-475.25C369.33,-475.25 383.6,-475.25 397.21,-475.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.95,-478.75 406.95,-475.25 396.95,-471.75 396.95,-478.75"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node8 -->
-<g id="edge13_Node000011_Node000008" class="edge">
-<title>Node11&#45;&gt;Node8</title>
-<g id="a_edge13_Node000011_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.73,-263.57C333.59,-258.3 346.11,-251.8 356.75,-244.25 375.72,-230.78 373.08,-218.68 392.75,-206.25 396.68,-203.77 400.88,-201.5 405.22,-199.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="406.32,-202.79 414.13,-195.63 403.56,-196.36 406.32,-202.79"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" target="_top" xlink:title="Get the child pointer at position of index.">
-<polygon fill="white" stroke="#666666" points="525.75,-392.5 415.25,-392.5 415.25,-362 525.75,-362 525.75,-392.5"/>
-<text text-anchor="start" x="423.25" y="-379" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-367.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetChild</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge11_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge11_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.75,-294.96C321.9,-311.05 358.37,-335.96 392.75,-352.25 396.7,-354.12 400.82,-355.91 405.02,-357.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="403.55,-360.78 414.14,-361.08 406.04,-354.24 403.55,-360.78"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" target="_top" xlink:title="Get item of the \index index.">
-<polygon fill="white" stroke="#666666" points="524.25,-343.5 416.75,-343.5 416.75,-313 524.25,-313 524.25,-343.5"/>
-<text text-anchor="start" x="424.75" y="-330" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-318.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetItem</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node13 -->
-<g id="edge12_Node000011_Node000013" class="edge">
-<title>Node11&#45;&gt;Node13</title>
-<g id="a_edge12_Node000011_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.76,-293.36C356.06,-299.09 382,-305.76 405.18,-311.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.3,-315.1 414.85,-314.2 406.04,-308.32 404.3,-315.1"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="525.38,-294.5 415.62,-294.5 415.62,-264 525.38,-264 525.38,-294.5"/>
-<text text-anchor="start" x="423.62" y="-281" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-269.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node14 -->
-<g id="edge14_Node000011_Node000014" class="edge">
-<title>Node11&#45;&gt;Node14</title>
-<g id="a_edge14_Node000011_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.76,-279.25C355.68,-279.25 381.11,-279.25 403.99,-279.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="403.82,-282.75 413.82,-279.25 403.82,-275.75 403.82,-282.75"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1" target="_top" xlink:title="Set the item count of the node.">
-<polygon fill="white" stroke="#666666" points="527.25,-245.5 413.75,-245.5 413.75,-215 527.25,-215 527.25,-245.5"/>
-<text text-anchor="start" x="421.75" y="-232" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetCount</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node15 -->
-<g id="edge15_Node000011_Node000015" class="edge">
-<title>Node11&#45;&gt;Node15</title>
-<g id="a_edge15_Node000011_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.76,-265.14C355.11,-259.65 379.8,-253.31 402.21,-247.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="403.07,-250.94 411.89,-245.06 401.33,-244.16 403.07,-250.94"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc" target="_top" xlink:title="Set item value at position of index.">
-<polygon fill="white" stroke="#666666" points="523.88,-441.5 417.12,-441.5 417.12,-411 523.88,-411 523.88,-441.5"/>
-<text text-anchor="start" x="425.12" y="-428" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-416.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetItem</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node16 -->
-<g id="edge16_Node000011_Node000016" class="edge">
-<title>Node11&#45;&gt;Node16</title>
-<g id="a_edge16_Node000011_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M289.28,-294.72C307.36,-320.46 347.06,-372.13 392.75,-401.25 396.99,-403.95 401.54,-406.38 406.24,-408.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.73,-411.73 415.3,-412.4 407.45,-405.28 404.73,-411.73"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node8 -->
-<g id="edge19_Node000018_Node000008" class="edge">
-<title>Node18&#45;&gt;Node8</title>
-<g id="a_edge19_Node000018_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M350.4,-185C368.16,-184.44 387.11,-183.84 404.54,-183.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.35,-186.8 414.24,-182.99 404.13,-179.81 404.35,-186.8"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node10 -->
-<g id="edge20_Node000018_Node000010" class="edge">
-<title>Node18&#45;&gt;Node10</title>
-<g id="a_edge20_Node000018_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.25,-171.56C355.38,-165.18 381.15,-157.74 404.29,-151.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.97,-154.51 413.6,-148.38 403.02,-147.79 404.97,-154.51"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node8 -->
-<g id="edge22_Node000019_Node000008" class="edge">
-<title>Node19&#45;&gt;Node8</title>
-<g id="a_edge22_Node000019_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.35,-116.85C331.05,-128.52 363.42,-144.45 392.75,-156.25 397.41,-158.12 402.27,-159.96 407.18,-161.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="405.94,-165.01 416.53,-165.02 408.26,-158.41 405.94,-165.01"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node17 -->
-<g id="edge23_Node000019_Node000017" class="edge">
-<title>Node19&#45;&gt;Node17</title>
-<g id="a_edge23_Node000019_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M353.67,-90.66C365.81,-88.94 378.41,-87.15 390.64,-85.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="390.84,-88.93 400.25,-84.06 389.86,-82 390.84,-88.93"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph_org.svg
deleted file mode 100644
index deda2c2ec..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a61dd051a74e5f36c8dc03dae8dca6ef4_cgraph_org.svg
+++ /dev/null
@@ -1,409 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::RemovePreMerge Pages: 1 -->
-<svg width="556pt" height="646pt"
- viewBox="0.00 0.00 556.25 645.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 641.5)">
-<title>data_structures::tree_234::Tree234::RemovePreMerge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function implement the pre&#45;merge remove operation.">
-<polygon fill="#999999" stroke="#666666" points="163,-202.5 0,-202.5 0,-172 163,-172 163,-202.5"/>
-<text text-anchor="start" x="8" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="81.5" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::RemovePreMerge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657" target="_top" xlink:title="Get the max item of the tree.">
-<polygon fill="white" stroke="#666666" points="356.75,-588.5 199,-588.5 199,-558 356.75,-558 356.75,-588.5"/>
-<text text-anchor="start" x="207" y="-575" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="277.88" y="-563.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.65,-202.67C95.87,-250.13 131.4,-397 199,-499.25 212.02,-518.94 231.2,-537.25 247.27,-550.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.68,-553.13 254.64,-556.74 249.1,-547.71 244.68,-553.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36" target="_top" xlink:title="Get the min item of the tree.">
-<polygon fill="white" stroke="#666666" points="355.25,-490.5 200.5,-490.5 200.5,-460 355.25,-460 355.25,-490.5"/>
-<text text-anchor="start" x="208.5" y="-477" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="277.88" y="-465.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.95,-202.73C124.79,-249.91 220.79,-392.15 259.96,-450.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.03,-452.1 265.53,-458.43 262.83,-448.19 257.03,-452.1"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" target="_top" xlink:title="Check if node is a 2&#45;node.">
-<polygon fill="white" stroke="#666666" points="525,-196.5 416,-196.5 416,-166 525,-166 525,-196.5"/>
-<text text-anchor="start" x="424" y="-183" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is2Node</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.15,-203C163.93,-206.42 182.05,-209.52 199,-211.25 268.75,-218.36 287.23,-220.34 356.75,-211.25 374.46,-208.93 393.35,-204.65 410.5,-200.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="411.34,-203.44 420.04,-197.38 409.46,-196.69 411.34,-203.44"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18" target="_top" xlink:title="Check if node is a 3&#45;node or 4&#45;node, this is useful when we delete item from 2&#45;3&#45;4 tree.">
-<polygon fill="white" stroke="#666666" points="335,-30.5 220.75,-30.5 220.75,0 335,0 335,-30.5"/>
-<text text-anchor="start" x="228.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="277.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is34Node</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.33,-171.62C108.48,-142.59 149.03,-80.06 199,-44.25 203.32,-41.16 208,-38.35 212.86,-35.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.12,-39.1 221.65,-31.64 211.12,-32.77 214.12,-39.1"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e" target="_top" xlink:title="Do the actual left rotate operation.">
-<polygon fill="white" stroke="#666666" points="535.5,-147.5 405.5,-147.5 405.5,-117 535.5,-117 535.5,-147.5"/>
-<text text-anchor="start" x="413.5" y="-134" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::LeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.78,-171.52C168.68,-168.52 184.32,-165.6 199,-163.25 264.47,-152.78 339.41,-144.47 393.78,-139.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.94,-142.61 403.55,-138.15 393.26,-135.64 393.94,-142.61"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9" target="_top" xlink:title="Merge the item at index of the parent node, and its left and right child.">
-<polygon fill="white" stroke="#666666" points="333.5,-294.5 222.25,-294.5 222.25,-264 333.5,-264 333.5,-294.5"/>
-<text text-anchor="start" x="230.25" y="-281" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="277.88" y="-269.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Merge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.52,-202.77C136.92,-214.39 169.85,-230.57 199,-244.25 209.37,-249.11 220.57,-254.23 231.16,-259"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.55,-262.12 240.11,-263.02 232.41,-255.73 229.55,-262.12"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9" target="_top" xlink:title="Do the actual right rotate operation.">
-<polygon fill="white" stroke="#666666" points="538.88,-89.5 402.12,-89.5 402.12,-59 538.88,-59 538.88,-89.5"/>
-<text text-anchor="start" x="410.12" y="-76" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-64.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::RightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge17_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge17_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.82,-171.83C110.84,-146.45 150.77,-96.73 199,-77.25 259.91,-52.65 335,-54.03 390.6,-60.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="389.95,-63.8 400.31,-61.54 390.8,-56.85 389.95,-63.8"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9" target="_top" xlink:title="A handy function to try if we can do a left rotate to the target node.">
-<polygon fill="white" stroke="#666666" points="350,-202.5 205.75,-202.5 205.75,-172 350,-172 350,-202.5"/>
-<text text-anchor="start" x="213.75" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="277.88" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryLeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node18 -->
-<g id="edge18_Node000001_Node000018" class="edge">
-<title>Node1&#45;&gt;Node18</title>
-<g id="a_edge18_Node000001_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.24,-187.25C173.4,-187.25 183.8,-187.25 193.99,-187.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="193.86,-190.75 203.86,-187.25 193.86,-183.75 193.86,-190.75"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3" target="_top" xlink:title="A handy function to try if we can do a right rotate to the target node.">
-<polygon fill="white" stroke="#666666" points="353.38,-116.5 202.38,-116.5 202.38,-86 353.38,-86 353.38,-116.5"/>
-<text text-anchor="start" x="210.38" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="277.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryRightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node19 -->
-<g id="edge21_Node000001_Node000019" class="edge">
-<title>Node1&#45;&gt;Node19</title>
-<g id="a_edge21_Node000001_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.29,-171.66C135.61,-159.71 169,-143.14 199,-130.25 206.38,-127.08 214.24,-123.92 222.01,-120.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.99,-124.28 231.09,-117.45 220.5,-117.73 222.99,-124.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57" target="_top" xlink:title="Get max item (rightmost) in the current node.">
-<polygon fill="white" stroke="#666666" points="533.62,-637.5 407.38,-637.5 407.38,-607 533.62,-607 533.62,-637.5"/>
-<text text-anchor="start" x="415.38" y="-624" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-612.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M339.98,-588.96C358.27,-593.66 378.51,-598.86 397.45,-603.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.4,-607.07 406.95,-606.17 398.14,-600.29 396.4,-607.07"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94" target="_top" xlink:title="Get rightmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="548.25,-588.5 392.75,-588.5 392.75,-558 548.25,-558 548.25,-588.5"/>
-<text text-anchor="start" x="400.75" y="-575" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-563.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetRightmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M357.23,-573.25C365.03,-573.25 372.98,-573.25 380.88,-573.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="380.85,-576.75 390.85,-573.25 380.85,-569.75 380.85,-576.75"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e" target="_top" xlink:title="Get leftmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="544.88,-539.5 396.12,-539.5 396.12,-509 544.88,-509 544.88,-539.5"/>
-<text text-anchor="start" x="404.12" y="-526" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-514.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetLeftmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M339.98,-490.96C358.27,-495.66 378.51,-500.86 397.45,-505.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.4,-509.07 406.95,-508.17 398.14,-502.29 396.4,-509.07"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71" target="_top" xlink:title="get min item (leftmost) in the current node">
-<polygon fill="white" stroke="#666666" points="532.12,-490.5 408.88,-490.5 408.88,-460 532.12,-460 532.12,-490.5"/>
-<text text-anchor="start" x="416.88" y="-477" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-465.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M355.59,-475.25C369.33,-475.25 383.6,-475.25 397.21,-475.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.95,-478.75 406.95,-475.25 396.95,-471.75 396.95,-478.75"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node8 -->
-<g id="edge13_Node000011_Node000008" class="edge">
-<title>Node11&#45;&gt;Node8</title>
-<g id="a_edge13_Node000011_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.73,-263.57C333.59,-258.3 346.11,-251.8 356.75,-244.25 375.72,-230.78 373.08,-218.68 392.75,-206.25 396.68,-203.77 400.88,-201.5 405.22,-199.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="406.32,-202.79 414.13,-195.63 403.56,-196.36 406.32,-202.79"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" target="_top" xlink:title="Get the child pointer at position of index.">
-<polygon fill="white" stroke="#666666" points="525.75,-392.5 415.25,-392.5 415.25,-362 525.75,-362 525.75,-392.5"/>
-<text text-anchor="start" x="423.25" y="-379" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-367.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetChild</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge11_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge11_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.75,-294.96C321.9,-311.05 358.37,-335.96 392.75,-352.25 396.7,-354.12 400.82,-355.91 405.02,-357.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="403.55,-360.78 414.14,-361.08 406.04,-354.24 403.55,-360.78"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" target="_top" xlink:title="Get item of the \index index.">
-<polygon fill="white" stroke="#666666" points="524.25,-343.5 416.75,-343.5 416.75,-313 524.25,-313 524.25,-343.5"/>
-<text text-anchor="start" x="424.75" y="-330" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-318.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetItem</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node13 -->
-<g id="edge12_Node000011_Node000013" class="edge">
-<title>Node11&#45;&gt;Node13</title>
-<g id="a_edge12_Node000011_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.76,-293.36C356.06,-299.09 382,-305.76 405.18,-311.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.3,-315.1 414.85,-314.2 406.04,-308.32 404.3,-315.1"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="525.38,-294.5 415.62,-294.5 415.62,-264 525.38,-264 525.38,-294.5"/>
-<text text-anchor="start" x="423.62" y="-281" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-269.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node14 -->
-<g id="edge14_Node000011_Node000014" class="edge">
-<title>Node11&#45;&gt;Node14</title>
-<g id="a_edge14_Node000011_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.76,-279.25C355.68,-279.25 381.11,-279.25 403.99,-279.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="403.82,-282.75 413.82,-279.25 403.82,-275.75 403.82,-282.75"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1" target="_top" xlink:title="Set the item count of the node.">
-<polygon fill="white" stroke="#666666" points="527.25,-245.5 413.75,-245.5 413.75,-215 527.25,-215 527.25,-245.5"/>
-<text text-anchor="start" x="421.75" y="-232" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetCount</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node15 -->
-<g id="edge15_Node000011_Node000015" class="edge">
-<title>Node11&#45;&gt;Node15</title>
-<g id="a_edge15_Node000011_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.76,-265.14C355.11,-259.65 379.8,-253.31 402.21,-247.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="403.07,-250.94 411.89,-245.06 401.33,-244.16 403.07,-250.94"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc" target="_top" xlink:title="Set item value at position of index.">
-<polygon fill="white" stroke="#666666" points="523.88,-441.5 417.12,-441.5 417.12,-411 523.88,-411 523.88,-441.5"/>
-<text text-anchor="start" x="425.12" y="-428" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="470.5" y="-416.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetItem</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node16 -->
-<g id="edge16_Node000011_Node000016" class="edge">
-<title>Node11&#45;&gt;Node16</title>
-<g id="a_edge16_Node000011_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M289.28,-294.72C307.36,-320.46 347.06,-372.13 392.75,-401.25 396.99,-403.95 401.54,-406.38 406.24,-408.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.73,-411.73 415.3,-412.4 407.45,-405.28 404.73,-411.73"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node8 -->
-<g id="edge19_Node000018_Node000008" class="edge">
-<title>Node18&#45;&gt;Node8</title>
-<g id="a_edge19_Node000018_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M350.4,-185C368.16,-184.44 387.11,-183.84 404.54,-183.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.35,-186.8 414.24,-182.99 404.13,-179.81 404.35,-186.8"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node10 -->
-<g id="edge20_Node000018_Node000010" class="edge">
-<title>Node18&#45;&gt;Node10</title>
-<g id="a_edge20_Node000018_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.25,-171.56C355.38,-165.18 381.15,-157.74 404.29,-151.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.97,-154.51 413.6,-148.38 403.02,-147.79 404.97,-154.51"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node8 -->
-<g id="edge22_Node000019_Node000008" class="edge">
-<title>Node19&#45;&gt;Node8</title>
-<g id="a_edge22_Node000019_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.35,-116.85C331.05,-128.52 363.42,-144.45 392.75,-156.25 397.41,-158.12 402.27,-159.96 407.18,-161.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="405.94,-165.01 416.53,-165.02 408.26,-158.41 405.94,-165.01"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node17 -->
-<g id="edge23_Node000019_Node000017" class="edge">
-<title>Node19&#45;&gt;Node17</title>
-<g id="a_edge23_Node000019_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M353.67,-90.66C365.81,-88.94 378.41,-87.15 390.64,-85.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="390.84,-88.93 400.25,-84.06 389.86,-82 390.84,-88.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.map
deleted file mode 100644
index e2d54c74f..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="data_structures::tree_234::Tree234::GetTreeMinItem" name="data_structures::tree_234::Tree234::GetTreeMinItem">
-<area shape="rect" id="Node000001" title="Get the min item of the tree." alt="" coords="5,39,212,79"/>
-<area shape="rect" id="Node000002" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e" title="Get leftmose child of the current node." alt="" coords="260,5,458,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="212,43,244,38,244,44,212,48"/>
-<area shape="rect" id="Node000003" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71" title="get min item (leftmost) in the current node" alt="" coords="277,71,441,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="212,70,261,76,261,81,212,75"/>
-</map>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.md5
deleted file mode 100644
index 07c9dd1e8..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9074ed9a9a5d19235d16d1f2d07eb74f
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.svg
deleted file mode 100644
index 9b055984c..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph.svg
+++ /dev/null
@@ -1,86 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::GetTreeMinItem Pages: 1 -->
-<svg width="348pt" height="88pt"
- viewBox="0.00 0.00 347.50 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>data_structures::tree_234::Tree234::GetTreeMinItem</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get the min item of the tree.">
-<polygon fill="#999999" stroke="#666666" points="154.75,-54.5 0,-54.5 0,-24 154.75,-24 154.75,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="77.38" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e" target="_top" xlink:title="Get leftmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="339.5,-79.5 190.75,-79.5 190.75,-49 339.5,-49 339.5,-79.5"/>
-<text text-anchor="start" x="198.75" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="265.12" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetLeftmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155,-49.56C162.95,-50.63 171.06,-51.72 179.09,-52.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.49,-56.26 188.87,-54.12 179.42,-49.32 178.49,-56.26"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71" target="_top" xlink:title="get min item (leftmost) in the current node">
-<polygon fill="white" stroke="#666666" points="326.75,-30.5 203.5,-30.5 203.5,0 326.75,0 326.75,-30.5"/>
-<text text-anchor="start" x="211.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="265.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155,-29.35C167.19,-27.77 179.77,-26.15 191.86,-24.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.3,-28.06 201.77,-23.31 191.4,-21.12 192.3,-28.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph_org.svg
deleted file mode 100644
index 3ed9216f5..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a65a1235659356166a3e9b451c64fcc36_cgraph_org.svg
+++ /dev/null
@@ -1,60 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::GetTreeMinItem Pages: 1 -->
-<svg width="348pt" height="88pt"
- viewBox="0.00 0.00 347.50 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>data_structures::tree_234::Tree234::GetTreeMinItem</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get the min item of the tree.">
-<polygon fill="#999999" stroke="#666666" points="154.75,-54.5 0,-54.5 0,-24 154.75,-24 154.75,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="77.38" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e" target="_top" xlink:title="Get leftmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="339.5,-79.5 190.75,-79.5 190.75,-49 339.5,-49 339.5,-79.5"/>
-<text text-anchor="start" x="198.75" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="265.12" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetLeftmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155,-49.56C162.95,-50.63 171.06,-51.72 179.09,-52.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.49,-56.26 188.87,-54.12 179.42,-49.32 178.49,-56.26"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71" target="_top" xlink:title="get min item (leftmost) in the current node">
-<polygon fill="white" stroke="#666666" points="326.75,-30.5 203.5,-30.5 203.5,0 326.75,0 326.75,-30.5"/>
-<text text-anchor="start" x="211.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="265.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155,-29.35C167.19,-27.77 179.77,-26.15 191.86,-24.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.3,-28.06 201.77,-23.31 191.4,-21.12 192.3,-28.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.map
deleted file mode 100644
index 1f163470f..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.map
+++ /dev/null
@@ -1,22 +0,0 @@
-<map id="data_structures::tree_234::Tree234::Insert" name="data_structures::tree_234::Tree234::Insert">
-<area shape="rect" id="Node000001" title="Insert item to tree." alt="" coords="5,133,151,174"/>
-<area shape="rect" id="Node000002" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d" title="A insert implementation of pre&#45;split." alt="" coords="199,133,390,174"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="151,151,183,151,183,156,151,156"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/unique_ptr/get.html#" title=" " alt="" coords="482,84,615,109"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="387,130,473,111,474,116,388,135"/>
-<area shape="rect" id="Node000004" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" title="Merge node to a not&#45;full target node." alt="" coords="438,133,659,174"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="390,151,422,151,422,156,390,156"/>
-<area shape="rect" id="Node000010" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node." alt="" coords="464,199,633,239"/>
-<area shape="poly" id="edge10_Node000002_Node000010" title=" " alt="" coords="377,172,453,192,451,197,376,177"/>
-<area shape="rect" id="Node000005" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" title="Insert item to the proper position of the node and return the position index." alt="" coords="707,72,863,113"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="629,130,692,114,693,119,630,135"/>
-<area shape="rect" id="Node000008" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" title="Check if node is a full (4&#45;node)" alt="" coords="942,136,1083,177"/>
-<area shape="poly" id="edge8_Node000004_Node000008" title=" " alt="" coords="660,152,926,153,926,159,660,157"/>
-<area shape="rect" id="Node000009" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" title="Set child pointer to the position of index." alt="" coords="712,191,858,231"/>
-<area shape="poly" id="edge9_Node000004_Node000009" title=" " alt="" coords="636,172,698,187,696,192,634,177"/>
-<area shape="rect" id="Node000006" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" title="Check if item is in the node." alt="" coords="938,5,1086,46"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="856,69,925,48,926,54,858,74"/>
-<area shape="rect" id="Node000007" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" title="Insert a value to the index position." alt="" coords="911,71,1114,111"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="863,89,895,89,895,94,863,95"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="861,111,928,130,926,135,859,116"/>
-</map>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.md5
deleted file mode 100644
index 33b3ede1c..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bbc7abb032bc1f6b9ea5e314dcae3710
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.svg
deleted file mode 100644
index bf88323c8..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph.svg
+++ /dev/null
@@ -1,284 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::Insert Pages: 1 -->
-<!--zoomable 184 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 840;
-var viewHeight = 184;
-var sectionId = 'dynsection-4';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>data_structures::tree_234::Tree234::Insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Insert item to tree.">
-<polygon fill="#999999" stroke="#666666" points="109,-79.5 0,-79.5 0,-49 109,-49 109,-79.5"/>
-<text text-anchor="start" x="8" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="54.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d" target="_top" xlink:title="A insert implementation of pre&#45;split.">
-<polygon fill="white" stroke="#666666" points="288.5,-79.5 145,-79.5 145,-49 288.5,-49 288.5,-79.5"/>
-<text text-anchor="start" x="153" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="216.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::InsertPreSplit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.31,-64.25C117.03,-64.25 125.12,-64.25 133.25,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.21,-67.75 143.21,-64.25 133.21,-60.75 133.21,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="457.5,-116.88 357.5,-116.88 357.5,-97.62 457.5,-97.62 457.5,-116.88"/>
-<text text-anchor="middle" x="407.5" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr::get</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M286.69,-79.96C307.83,-84.77 330.81,-90.01 350.94,-94.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.1,-97.99 360.63,-96.8 351.66,-91.17 350.1,-97.99"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" target="_top" xlink:title="Merge node to a not&#45;full target node.">
-<polygon fill="white" stroke="#666666" points="490.5,-79.5 324.5,-79.5 324.5,-49 490.5,-49 490.5,-79.5"/>
-<text text-anchor="start" x="332.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="407.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNodeNotFull</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M288.84,-64.25C296.65,-64.25 304.69,-64.25 312.73,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="312.54,-67.75 322.54,-64.25 312.54,-60.75 312.54,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" target="_top" xlink:title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node.">
-<polygon fill="white" stroke="#666666" points="471,-30.5 344,-30.5 344,0 471,0 471,-30.5"/>
-<text text-anchor="start" x="352" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="407.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::SplitNode</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge10_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge10_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.25,-48.54C296.28,-43.86 316.22,-38.69 334.89,-33.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="335.75,-37.23 344.55,-31.33 333.99,-30.46 335.75,-37.23"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" target="_top" xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="white" stroke="#666666" points="643,-125.5 526.5,-125.5 526.5,-95 643,-95 643,-125.5"/>
-<text text-anchor="start" x="534.5" y="-112" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="584.75" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M468.32,-79.95C483.4,-83.91 499.71,-88.19 515.18,-92.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="514.25,-95.62 524.81,-94.78 516.02,-88.85 514.25,-95.62"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="808.25,-77.5 702.25,-77.5 702.25,-47 808.25,-47 808.25,-77.5"/>
-<text text-anchor="start" x="710.25" y="-64" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="755.25" y="-52.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge8_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge8_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M490.88,-63.77C552.07,-63.42 634.34,-62.94 690.55,-62.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="690.29,-66.12 700.27,-62.56 690.25,-59.12 690.29,-66.12"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="639.62,-36.5 529.88,-36.5 529.88,-6 639.62,-6 639.62,-36.5"/>
-<text text-anchor="start" x="537.88" y="-23" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="584.75" y="-11.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge9_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge9_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M472.27,-48.6C487.39,-44.89 503.53,-40.93 518.71,-37.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="519.21,-40.69 528.09,-34.91 517.54,-33.89 519.21,-40.69"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="810.88,-175.5 699.62,-175.5 699.62,-145 810.88,-145 810.88,-175.5"/>
-<text text-anchor="start" x="707.62" y="-162" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="755.25" y="-150.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M638.6,-125.93C654.99,-130.8 673.23,-136.21 690.29,-141.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="689.26,-144.62 699.84,-144.11 691.25,-137.91 689.26,-144.62"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="831.5,-126.5 679,-126.5 679,-96 831.5,-96 831.5,-126.5"/>
-<text text-anchor="start" x="687" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="755.25" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M643.27,-110.59C650.98,-110.64 659.02,-110.68 667.1,-110.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="666.98,-114.23 677.01,-110.79 667.03,-107.23 666.98,-114.23"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M640.92,-94.53C656.98,-89.96 674.65,-84.92 691.16,-80.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="691.7,-83.71 700.36,-77.6 689.78,-76.98 691.7,-83.71"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph_org.svg
deleted file mode 100644
index 632464989..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a6749ebb40710c9752a2771eda03c6b3e_cgraph_org.svg
+++ /dev/null
@@ -1,201 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::Insert Pages: 1 -->
-<svg width="840pt" height="184pt"
- viewBox="0.00 0.00 839.50 183.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 179.5)">
-<title>data_structures::tree_234::Tree234::Insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Insert item to tree.">
-<polygon fill="#999999" stroke="#666666" points="109,-79.5 0,-79.5 0,-49 109,-49 109,-79.5"/>
-<text text-anchor="start" x="8" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="54.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d" target="_top" xlink:title="A insert implementation of pre&#45;split.">
-<polygon fill="white" stroke="#666666" points="288.5,-79.5 145,-79.5 145,-49 288.5,-49 288.5,-79.5"/>
-<text text-anchor="start" x="153" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="216.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::InsertPreSplit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.31,-64.25C117.03,-64.25 125.12,-64.25 133.25,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.21,-67.75 143.21,-64.25 133.21,-60.75 133.21,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="457.5,-116.88 357.5,-116.88 357.5,-97.62 457.5,-97.62 457.5,-116.88"/>
-<text text-anchor="middle" x="407.5" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr::get</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M286.69,-79.96C307.83,-84.77 330.81,-90.01 350.94,-94.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.1,-97.99 360.63,-96.8 351.66,-91.17 350.1,-97.99"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" target="_top" xlink:title="Merge node to a not&#45;full target node.">
-<polygon fill="white" stroke="#666666" points="490.5,-79.5 324.5,-79.5 324.5,-49 490.5,-49 490.5,-79.5"/>
-<text text-anchor="start" x="332.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="407.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNodeNotFull</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M288.84,-64.25C296.65,-64.25 304.69,-64.25 312.73,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="312.54,-67.75 322.54,-64.25 312.54,-60.75 312.54,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" target="_top" xlink:title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node.">
-<polygon fill="white" stroke="#666666" points="471,-30.5 344,-30.5 344,0 471,0 471,-30.5"/>
-<text text-anchor="start" x="352" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="407.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::SplitNode</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge10_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge10_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.25,-48.54C296.28,-43.86 316.22,-38.69 334.89,-33.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="335.75,-37.23 344.55,-31.33 333.99,-30.46 335.75,-37.23"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" target="_top" xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="white" stroke="#666666" points="643,-125.5 526.5,-125.5 526.5,-95 643,-95 643,-125.5"/>
-<text text-anchor="start" x="534.5" y="-112" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="584.75" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M468.32,-79.95C483.4,-83.91 499.71,-88.19 515.18,-92.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="514.25,-95.62 524.81,-94.78 516.02,-88.85 514.25,-95.62"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="808.25,-77.5 702.25,-77.5 702.25,-47 808.25,-47 808.25,-77.5"/>
-<text text-anchor="start" x="710.25" y="-64" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="755.25" y="-52.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge8_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge8_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M490.88,-63.77C552.07,-63.42 634.34,-62.94 690.55,-62.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="690.29,-66.12 700.27,-62.56 690.25,-59.12 690.29,-66.12"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="639.62,-36.5 529.88,-36.5 529.88,-6 639.62,-6 639.62,-36.5"/>
-<text text-anchor="start" x="537.88" y="-23" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="584.75" y="-11.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge9_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge9_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M472.27,-48.6C487.39,-44.89 503.53,-40.93 518.71,-37.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="519.21,-40.69 528.09,-34.91 517.54,-33.89 519.21,-40.69"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="810.88,-175.5 699.62,-175.5 699.62,-145 810.88,-145 810.88,-175.5"/>
-<text text-anchor="start" x="707.62" y="-162" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="755.25" y="-150.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M638.6,-125.93C654.99,-130.8 673.23,-136.21 690.29,-141.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="689.26,-144.62 699.84,-144.11 691.25,-137.91 689.26,-144.62"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="831.5,-126.5 679,-126.5 679,-96 831.5,-96 831.5,-126.5"/>
-<text text-anchor="start" x="687" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="755.25" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M643.27,-110.59C650.98,-110.64 659.02,-110.68 667.1,-110.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="666.98,-114.23 677.01,-110.79 667.03,-107.23 666.98,-114.23"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M640.92,-94.53C656.98,-89.96 674.65,-84.92 691.16,-80.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="691.7,-83.71 700.36,-77.6 689.78,-76.98 691.7,-83.71"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.map
deleted file mode 100644
index f4faa1a44..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="data_structures::tree_234::Tree234::Traverse" name="data_structures::tree_234::Tree234::Traverse">
-<area shape="rect" id="Node000001" title="In&#45;order traverse." alt="" coords="5,29,169,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="55,29,54,19,59,11,70,5,87,3,105,5,116,11,113,16,104,10,87,8,72,10,62,14,59,20,60,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="217,37,288,62"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="169,47,201,47,201,52,169,52"/>
-</map>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.md5
deleted file mode 100644
index 427f1cff1..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-dd153d4fe98e898ddf769f35d6219caf
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.svg
deleted file mode 100644
index d8f3c3ad7..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::Traverse Pages: 1 -->
-<svg width="220pt" height="57pt"
- viewBox="0.00 0.00 220.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>data_structures::tree_234::Tree234::Traverse</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="In&#45;order traverse.">
-<polygon fill="#999999" stroke="#666666" points="122.5,-30.5 0,-30.5 0,0 122.5,0 122.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="61.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Traverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.28,-30.99C34.79,-40.06 42.12,-48.5 61.25,-48.5 71.71,-48.5 78.64,-45.97 82.04,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.5,-42.8 83.06,-32.49 78.54,-42.07 85.5,-42.8"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="212,-24.88 158.5,-24.88 158.5,-5.63 212,-5.63 212,-24.88"/>
-<text text-anchor="middle" x="185.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.89,-15.25C131.06,-15.25 139.23,-15.25 146.82,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.69,-18.75 156.69,-15.25 146.69,-11.75 146.69,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph_org.svg
deleted file mode 100644
index 8967ac6ae..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a84ab7b4fe7442b5e2eeed8c050bb86bd_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::Traverse Pages: 1 -->
-<svg width="220pt" height="57pt"
- viewBox="0.00 0.00 220.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>data_structures::tree_234::Tree234::Traverse</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="In&#45;order traverse.">
-<polygon fill="#999999" stroke="#666666" points="122.5,-30.5 0,-30.5 0,0 122.5,0 122.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="61.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Traverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.28,-30.99C34.79,-40.06 42.12,-48.5 61.25,-48.5 71.71,-48.5 78.64,-45.97 82.04,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.5,-42.8 83.06,-32.49 78.54,-42.07 85.5,-42.8"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="212,-24.88 158.5,-24.88 158.5,-5.63 212,-5.63 212,-24.88"/>
-<text text-anchor="middle" x="185.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.89,-15.25C131.06,-15.25 139.23,-15.25 146.82,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.69,-18.75 156.69,-15.25 146.69,-11.75 146.69,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.map
deleted file mode 100644
index 75a915073..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="data_structures::tree_234::Tree234::Traverse" name="data_structures::tree_234::Tree234::Traverse">
-<area shape="rect" id="Node000001" title="In&#45;order traverse the tree, print items." alt="" coords="5,29,169,70"/>
-<area shape="rect" id="Node000002" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd" title="In&#45;order traverse." alt="" coords="217,29,380,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="169,47,201,47,201,52,169,52"/>
-<area shape="poly" id="edge3_Node000002_Node000002" title=" " alt="" coords="266,29,265,19,270,11,281,5,298,3,317,5,327,11,325,16,315,10,298,8,283,10,274,14,270,20,272,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="428,37,499,62"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="381,47,412,47,412,52,381,52"/>
-</map>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.md5
deleted file mode 100644
index d385e9bdb..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5756177b9ccf1107bdc758311e006fee
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.svg
deleted file mode 100644
index 4c542d33b..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::Traverse Pages: 1 -->
-<svg width="379pt" height="57pt"
- viewBox="0.00 0.00 378.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>data_structures::tree_234::Tree234::Traverse</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="In&#45;order traverse the tree, print items.">
-<polygon fill="#999999" stroke="#666666" points="122.5,-30.5 0,-30.5 0,0 122.5,0 122.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="61.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Traverse</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd" target="_top" xlink:title="In&#45;order traverse.">
-<polygon fill="white" stroke="#666666" points="281,-30.5 158.5,-30.5 158.5,0 281,0 281,-30.5"/>
-<text text-anchor="start" x="166.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="219.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Traverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.76,-15.25C130.65,-15.25 138.8,-15.25 146.85,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.63,-18.75 156.63,-15.25 146.63,-11.75 146.63,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.78,-30.99C193.29,-40.06 200.62,-48.5 219.75,-48.5 230.21,-48.5 237.14,-45.97 240.54,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244,-42.8 241.56,-32.49 237.04,-42.07 244,-42.8"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="370.5,-24.88 317,-24.88 317,-5.63 370.5,-5.63 370.5,-24.88"/>
-<text text-anchor="middle" x="343.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M281.39,-15.25C289.56,-15.25 297.73,-15.25 305.32,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.19,-18.75 315.19,-15.25 305.19,-11.75 305.19,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph_org.svg
deleted file mode 100644
index 200eea697..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_a936bb546e6a94d8b9d35b30ee1bb291a_cgraph_org.svg
+++ /dev/null
@@ -1,68 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::Traverse Pages: 1 -->
-<svg width="379pt" height="57pt"
- viewBox="0.00 0.00 378.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>data_structures::tree_234::Tree234::Traverse</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="In&#45;order traverse the tree, print items.">
-<polygon fill="#999999" stroke="#666666" points="122.5,-30.5 0,-30.5 0,0 122.5,0 122.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="61.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Traverse</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd" target="_top" xlink:title="In&#45;order traverse.">
-<polygon fill="white" stroke="#666666" points="281,-30.5 158.5,-30.5 158.5,0 281,0 281,-30.5"/>
-<text text-anchor="start" x="166.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="219.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Traverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.76,-15.25C130.65,-15.25 138.8,-15.25 146.85,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.63,-18.75 156.63,-15.25 146.63,-11.75 146.63,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.78,-30.99C193.29,-40.06 200.62,-48.5 219.75,-48.5 230.21,-48.5 237.14,-45.97 240.54,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244,-42.8 241.56,-32.49 237.04,-42.07 244,-42.8"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="370.5,-24.88 317,-24.88 317,-5.63 370.5,-5.63 370.5,-24.88"/>
-<text text-anchor="middle" x="343.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M281.39,-15.25C289.56,-15.25 297.73,-15.25 305.32,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.19,-18.75 315.19,-15.25 305.19,-11.75 305.19,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.map
deleted file mode 100644
index 33f7086b7..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.map
+++ /dev/null
@@ -1,24 +0,0 @@
-<map id="data_structures::tree_234::Tree234::InsertPostMerge" name="data_structures::tree_234::Tree234::InsertPostMerge">
-<area shape="rect" id="Node000001" title="A insert implementation of post&#45;merge." alt="" coords="5,133,214,174"/>
-<area shape="rect" id="Node000002" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e" title="Insert item to tree." alt="" coords="262,133,407,174"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="214,151,246,151,246,156,214,156"/>
-<area shape="rect" id="Node000003" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d" title="A insert implementation of pre&#45;split." alt="" coords="455,133,646,174"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="407,151,439,151,439,156,407,156"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/unique_ptr/get.html#" title=" " alt="" coords="738,84,872,109"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="643,130,729,111,730,116,645,135"/>
-<area shape="rect" id="Node000005" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" title="Merge node to a not&#45;full target node." alt="" coords="694,133,916,174"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="647,151,679,151,679,156,647,156"/>
-<area shape="rect" id="Node000011" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node." alt="" coords="720,199,890,239"/>
-<area shape="poly" id="edge11_Node000003_Node000011" title=" " alt="" coords="633,172,709,192,708,197,632,177"/>
-<area shape="rect" id="Node000006" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" title="Insert item to the proper position of the node and return the position index." alt="" coords="964,72,1119,113"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="885,130,948,114,949,119,887,135"/>
-<area shape="rect" id="Node000009" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" title="Check if node is a full (4&#45;node)" alt="" coords="1198,136,1339,177"/>
-<area shape="poly" id="edge9_Node000005_Node000009" title=" " alt="" coords="916,152,1182,153,1182,159,916,157"/>
-<area shape="rect" id="Node000010" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" title="Set child pointer to the position of index." alt="" coords="968,191,1114,231"/>
-<area shape="poly" id="edge10_Node000005_Node000010" title=" " alt="" coords="892,172,954,187,953,192,891,177"/>
-<area shape="rect" id="Node000007" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" title="Check if item is in the node." alt="" coords="1194,5,1343,46"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="1112,69,1181,48,1183,54,1114,74"/>
-<area shape="rect" id="Node000008" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" title="Insert a value to the index position." alt="" coords="1167,71,1370,111"/>
-<area shape="poly" id="edge7_Node000006_Node000008" title=" " alt="" coords="1119,89,1151,89,1151,94,1119,95"/>
-<area shape="poly" id="edge8_Node000006_Node000009" title=" " alt="" coords="1117,111,1184,130,1182,135,1116,116"/>
-</map>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.md5
deleted file mode 100644
index 599033112..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f21f766569699841c7124b147916060b
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.svg
deleted file mode 100644
index c0c0c8311..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph.svg
+++ /dev/null
@@ -1,303 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::InsertPostMerge Pages: 1 -->
-<!--zoomable 184 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 1032;
-var viewHeight = 184;
-var sectionId = 'dynsection-6';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>data_structures::tree_234::Tree234::InsertPostMerge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A insert implementation of post&#45;merge.">
-<polygon fill="#999999" stroke="#666666" points="156.25,-79.5 0,-79.5 0,-49 156.25,-49 156.25,-79.5"/>
-<text text-anchor="start" x="8" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="78.12" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::InsertPostMerge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e" target="_top" xlink:title="Insert item to tree.">
-<polygon fill="white" stroke="#666666" points="301.25,-79.5 192.25,-79.5 192.25,-49 301.25,-49 301.25,-79.5"/>
-<text text-anchor="start" x="200.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="246.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.58,-64.25C164.58,-64.25 172.64,-64.25 180.49,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.27,-67.75 190.27,-64.25 180.27,-60.75 180.27,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d" target="_top" xlink:title="A insert implementation of pre&#45;split.">
-<polygon fill="white" stroke="#666666" points="480.75,-79.5 337.25,-79.5 337.25,-49 480.75,-49 480.75,-79.5"/>
-<text text-anchor="start" x="345.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="409" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::InsertPreSplit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M301.56,-64.25C309.28,-64.25 317.37,-64.25 325.5,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.46,-67.75 335.46,-64.25 325.46,-60.75 325.46,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="649.75,-116.88 549.75,-116.88 549.75,-97.62 649.75,-97.62 649.75,-116.88"/>
-<text text-anchor="middle" x="599.75" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr::get</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M478.94,-79.96C500.08,-84.77 523.06,-90.01 543.19,-94.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="542.35,-97.99 552.88,-96.8 543.91,-91.17 542.35,-97.99"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" target="_top" xlink:title="Merge node to a not&#45;full target node.">
-<polygon fill="white" stroke="#666666" points="682.75,-79.5 516.75,-79.5 516.75,-49 682.75,-49 682.75,-79.5"/>
-<text text-anchor="start" x="524.75" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNodeNotFull</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M481.09,-64.25C488.9,-64.25 496.94,-64.25 504.98,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="504.79,-67.75 514.79,-64.25 504.79,-60.75 504.79,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" target="_top" xlink:title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node.">
-<polygon fill="white" stroke="#666666" points="663.25,-30.5 536.25,-30.5 536.25,0 663.25,0 663.25,-30.5"/>
-<text text-anchor="start" x="544.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::SplitNode</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node11 -->
-<g id="edge11_Node000003_Node000011" class="edge">
-<title>Node3&#45;&gt;Node11</title>
-<g id="a_edge11_Node000003_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.5,-48.54C488.53,-43.86 508.47,-38.69 527.14,-33.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="528,-37.23 536.8,-31.33 526.24,-30.46 528,-37.23"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" target="_top" xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="white" stroke="#666666" points="835.25,-125.5 718.75,-125.5 718.75,-95 835.25,-95 835.25,-125.5"/>
-<text text-anchor="start" x="726.75" y="-112" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="777" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M660.57,-79.95C675.65,-83.91 691.96,-88.19 707.43,-92.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="706.5,-95.62 717.06,-94.78 708.27,-88.85 706.5,-95.62"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="1000.5,-77.5 894.5,-77.5 894.5,-47 1000.5,-47 1000.5,-77.5"/>
-<text text-anchor="start" x="902.5" y="-64" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="947.5" y="-52.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge9_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge9_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M683.13,-63.77C744.32,-63.42 826.59,-62.94 882.8,-62.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="882.54,-66.12 892.52,-62.56 882.5,-59.12 882.54,-66.12"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="831.88,-36.5 722.12,-36.5 722.12,-6 831.88,-6 831.88,-36.5"/>
-<text text-anchor="start" x="730.12" y="-23" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="777" y="-11.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge10_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge10_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M664.52,-48.6C679.64,-44.89 695.78,-40.93 710.96,-37.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="711.46,-40.69 720.34,-34.91 709.79,-33.89 711.46,-40.69"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="1003.12,-175.5 891.88,-175.5 891.88,-145 1003.12,-145 1003.12,-175.5"/>
-<text text-anchor="start" x="899.88" y="-162" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="947.5" y="-150.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M830.85,-125.93C847.24,-130.8 865.48,-136.21 882.54,-141.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="881.51,-144.62 892.09,-144.11 883.5,-137.91 881.51,-144.62"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="1023.75,-126.5 871.25,-126.5 871.25,-96 1023.75,-96 1023.75,-126.5"/>
-<text text-anchor="start" x="879.25" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="947.5" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M835.52,-110.59C843.23,-110.64 851.27,-110.68 859.35,-110.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="859.23,-114.23 869.26,-110.79 859.28,-107.23 859.23,-114.23"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge8_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge8_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M833.17,-94.53C849.23,-89.96 866.9,-84.92 883.41,-80.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="883.95,-83.71 892.61,-77.6 882.03,-76.98 883.95,-83.71"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph_org.svg
deleted file mode 100644
index b7e6f4dc8..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aa7e5e00033f38006a224f30bdbf3f703_cgraph_org.svg
+++ /dev/null
@@ -1,220 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::InsertPostMerge Pages: 1 -->
-<svg width="1032pt" height="184pt"
- viewBox="0.00 0.00 1031.75 183.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 179.5)">
-<title>data_structures::tree_234::Tree234::InsertPostMerge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A insert implementation of post&#45;merge.">
-<polygon fill="#999999" stroke="#666666" points="156.25,-79.5 0,-79.5 0,-49 156.25,-49 156.25,-79.5"/>
-<text text-anchor="start" x="8" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="78.12" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::InsertPostMerge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e" target="_top" xlink:title="Insert item to tree.">
-<polygon fill="white" stroke="#666666" points="301.25,-79.5 192.25,-79.5 192.25,-49 301.25,-49 301.25,-79.5"/>
-<text text-anchor="start" x="200.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="246.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.58,-64.25C164.58,-64.25 172.64,-64.25 180.49,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.27,-67.75 190.27,-64.25 180.27,-60.75 180.27,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d" target="_top" xlink:title="A insert implementation of pre&#45;split.">
-<polygon fill="white" stroke="#666666" points="480.75,-79.5 337.25,-79.5 337.25,-49 480.75,-49 480.75,-79.5"/>
-<text text-anchor="start" x="345.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="409" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::InsertPreSplit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M301.56,-64.25C309.28,-64.25 317.37,-64.25 325.5,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.46,-67.75 335.46,-64.25 325.46,-60.75 325.46,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="649.75,-116.88 549.75,-116.88 549.75,-97.62 649.75,-97.62 649.75,-116.88"/>
-<text text-anchor="middle" x="599.75" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr::get</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M478.94,-79.96C500.08,-84.77 523.06,-90.01 543.19,-94.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="542.35,-97.99 552.88,-96.8 543.91,-91.17 542.35,-97.99"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" target="_top" xlink:title="Merge node to a not&#45;full target node.">
-<polygon fill="white" stroke="#666666" points="682.75,-79.5 516.75,-79.5 516.75,-49 682.75,-49 682.75,-79.5"/>
-<text text-anchor="start" x="524.75" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNodeNotFull</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M481.09,-64.25C488.9,-64.25 496.94,-64.25 504.98,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="504.79,-67.75 514.79,-64.25 504.79,-60.75 504.79,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" target="_top" xlink:title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node.">
-<polygon fill="white" stroke="#666666" points="663.25,-30.5 536.25,-30.5 536.25,0 663.25,0 663.25,-30.5"/>
-<text text-anchor="start" x="544.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::SplitNode</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node11 -->
-<g id="edge11_Node000003_Node000011" class="edge">
-<title>Node3&#45;&gt;Node11</title>
-<g id="a_edge11_Node000003_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.5,-48.54C488.53,-43.86 508.47,-38.69 527.14,-33.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="528,-37.23 536.8,-31.33 526.24,-30.46 528,-37.23"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" target="_top" xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="white" stroke="#666666" points="835.25,-125.5 718.75,-125.5 718.75,-95 835.25,-95 835.25,-125.5"/>
-<text text-anchor="start" x="726.75" y="-112" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="777" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M660.57,-79.95C675.65,-83.91 691.96,-88.19 707.43,-92.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="706.5,-95.62 717.06,-94.78 708.27,-88.85 706.5,-95.62"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="1000.5,-77.5 894.5,-77.5 894.5,-47 1000.5,-47 1000.5,-77.5"/>
-<text text-anchor="start" x="902.5" y="-64" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="947.5" y="-52.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge9_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge9_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M683.13,-63.77C744.32,-63.42 826.59,-62.94 882.8,-62.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="882.54,-66.12 892.52,-62.56 882.5,-59.12 882.54,-66.12"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="831.88,-36.5 722.12,-36.5 722.12,-6 831.88,-6 831.88,-36.5"/>
-<text text-anchor="start" x="730.12" y="-23" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="777" y="-11.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge10_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge10_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M664.52,-48.6C679.64,-44.89 695.78,-40.93 710.96,-37.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="711.46,-40.69 720.34,-34.91 709.79,-33.89 711.46,-40.69"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="1003.12,-175.5 891.88,-175.5 891.88,-145 1003.12,-145 1003.12,-175.5"/>
-<text text-anchor="start" x="899.88" y="-162" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="947.5" y="-150.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M830.85,-125.93C847.24,-130.8 865.48,-136.21 882.54,-141.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="881.51,-144.62 892.09,-144.11 883.5,-137.91 881.51,-144.62"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="1023.75,-126.5 871.25,-126.5 871.25,-96 1023.75,-96 1023.75,-126.5"/>
-<text text-anchor="start" x="879.25" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="947.5" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M835.52,-110.59C843.23,-110.64 851.27,-110.68 859.35,-110.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="859.23,-114.23 869.26,-110.79 859.28,-107.23 859.23,-114.23"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge8_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge8_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M833.17,-94.53C849.23,-89.96 866.9,-84.92 883.41,-80.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="883.95,-83.71 892.61,-77.6 882.03,-76.98 883.95,-83.71"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.map
deleted file mode 100644
index 5f1191fda..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="data_structures::tree_234::Tree234::TryLeftRotate" name="data_structures::tree_234::Tree234::TryLeftRotate">
-<area shape="rect" id="Node000001" title="A handy function to try if we can do a left rotate to the target node." alt="" coords="5,39,198,79"/>
-<area shape="rect" id="Node000002" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" title="Check if node is a 2&#45;node." alt="" coords="260,5,405,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="198,42,244,36,245,41,199,48"/>
-<area shape="rect" id="Node000003" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e" title="Do the actual left rotate operation." alt="" coords="246,71,419,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="199,70,231,74,230,80,198,75"/>
-</map>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.md5
deleted file mode 100644
index 7b13f6b72..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fbd3fe83281ab5301e01abc4b25978b0
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.svg
deleted file mode 100644
index cbac1e75b..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph.svg
+++ /dev/null
@@ -1,86 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::TryLeftRotate Pages: 1 -->
-<svg width="318pt" height="88pt"
- viewBox="0.00 0.00 318.25 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>data_structures::tree_234::Tree234::TryLeftRotate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A handy function to try if we can do a left rotate to the target node.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-54.5 0,-54.5 0,-24 144.25,-24 144.25,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="72.12" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryLeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" target="_top" xlink:title="Check if node is a 2&#45;node.">
-<polygon fill="white" stroke="#666666" points="299.75,-79.5 190.75,-79.5 190.75,-49 299.75,-49 299.75,-79.5"/>
-<text text-anchor="start" x="198.75" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="245.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is2Node</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.71,-49.71C156.18,-51.38 167.99,-53.11 179.3,-54.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.5,-58.18 188.9,-56.16 179.52,-51.26 178.5,-58.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e" target="_top" xlink:title="Do the actual left rotate operation.">
-<polygon fill="white" stroke="#666666" points="310.25,-30.5 180.25,-30.5 180.25,0 310.25,0 310.25,-30.5"/>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="245.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::LeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.71,-29.21C152.61,-28.1 160.68,-26.97 168.63,-25.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.86,-29.36 178.27,-24.5 167.88,-22.43 168.86,-29.36"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph_org.svg
deleted file mode 100644
index 6660655ae..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac5361479dd996eb331759f33808657d9_cgraph_org.svg
+++ /dev/null
@@ -1,60 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::TryLeftRotate Pages: 1 -->
-<svg width="318pt" height="88pt"
- viewBox="0.00 0.00 318.25 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>data_structures::tree_234::Tree234::TryLeftRotate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A handy function to try if we can do a left rotate to the target node.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-54.5 0,-54.5 0,-24 144.25,-24 144.25,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="72.12" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryLeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" target="_top" xlink:title="Check if node is a 2&#45;node.">
-<polygon fill="white" stroke="#666666" points="299.75,-79.5 190.75,-79.5 190.75,-49 299.75,-49 299.75,-79.5"/>
-<text text-anchor="start" x="198.75" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="245.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is2Node</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.71,-49.71C156.18,-51.38 167.99,-53.11 179.3,-54.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.5,-58.18 188.9,-56.16 179.52,-51.26 178.5,-58.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e" target="_top" xlink:title="Do the actual left rotate operation.">
-<polygon fill="white" stroke="#666666" points="310.25,-30.5 180.25,-30.5 180.25,0 310.25,0 310.25,-30.5"/>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="245.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::LeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.71,-29.21C152.61,-28.1 160.68,-26.97 168.63,-25.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.86,-29.36 178.27,-24.5 167.88,-22.43 168.86,-29.36"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.map
deleted file mode 100644
index bfda9c61f..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="data_structures::tree_234::Tree234::GetTreeMaxItem" name="data_structures::tree_234::Tree234::GetTreeMaxItem">
-<area shape="rect" id="Node000001" title="Get the max item of the tree." alt="" coords="5,39,216,79"/>
-<area shape="rect" id="Node000002" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57" title="Get max item (rightmost) in the current node." alt="" coords="283,5,452,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="216,43,267,36,268,41,217,48"/>
-<area shape="rect" id="Node000003" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94" title="Get rightmose child of the current node." alt="" coords="264,71,471,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="217,70,249,74,248,79,216,75"/>
-</map>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.md5
deleted file mode 100644
index b4912fca8..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ab691c0c5776d7178d9a59d8ecf52d7f
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.svg
deleted file mode 100644
index d9a8cf2c1..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph.svg
+++ /dev/null
@@ -1,86 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::GetTreeMaxItem Pages: 1 -->
-<svg width="357pt" height="88pt"
- viewBox="0.00 0.00 357.25 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>data_structures::tree_234::Tree234::GetTreeMaxItem</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get the max item of the tree.">
-<polygon fill="#999999" stroke="#666666" points="157.75,-54.5 0,-54.5 0,-24 157.75,-24 157.75,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="78.88" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57" target="_top" xlink:title="Get max item (rightmost) in the current node.">
-<polygon fill="white" stroke="#666666" points="334.62,-79.5 208.38,-79.5 208.38,-49 334.62,-49 334.62,-79.5"/>
-<text text-anchor="start" x="216.38" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="271.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.23,-49.53C170.97,-51.2 184.13,-52.92 196.75,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.29,-58.05 206.66,-55.88 197.2,-51.11 196.29,-58.05"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94" target="_top" xlink:title="Get rightmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="349.25,-30.5 193.75,-30.5 193.75,0 349.25,0 349.25,-30.5"/>
-<text text-anchor="start" x="201.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="271.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetRightmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.23,-29.38C166.12,-28.39 174.17,-27.38 182.15,-26.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.38,-29.87 191.87,-25.15 181.51,-22.93 182.38,-29.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph_org.svg
deleted file mode 100644
index 5b1e05fe0..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ac85ba5abfd6d34dcd908b2afe6464657_cgraph_org.svg
+++ /dev/null
@@ -1,60 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::GetTreeMaxItem Pages: 1 -->
-<svg width="357pt" height="88pt"
- viewBox="0.00 0.00 357.25 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>data_structures::tree_234::Tree234::GetTreeMaxItem</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get the max item of the tree.">
-<polygon fill="#999999" stroke="#666666" points="157.75,-54.5 0,-54.5 0,-24 157.75,-24 157.75,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="78.88" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57" target="_top" xlink:title="Get max item (rightmost) in the current node.">
-<polygon fill="white" stroke="#666666" points="334.62,-79.5 208.38,-79.5 208.38,-49 334.62,-49 334.62,-79.5"/>
-<text text-anchor="start" x="216.38" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="271.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.23,-49.53C170.97,-51.2 184.13,-52.92 196.75,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.29,-58.05 206.66,-55.88 197.2,-51.11 196.29,-58.05"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94" target="_top" xlink:title="Get rightmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="349.25,-30.5 193.75,-30.5 193.75,0 349.25,0 349.25,-30.5"/>
-<text text-anchor="start" x="201.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="271.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetRightmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.23,-29.38C166.12,-28.39 174.17,-27.38 182.15,-26.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.38,-29.87 191.87,-25.15 181.51,-22.93 182.38,-29.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.map
deleted file mode 100644
index cc0202a51..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.map
+++ /dev/null
@@ -1,14 +0,0 @@
-<map id="data_structures::tree_234::Tree234::MergeNodeNotFull" name="data_structures::tree_234::Tree234::MergeNodeNotFull">
-<area shape="rect" id="Node000001" title="Merge node to a not&#45;full target node." alt="" coords="5,133,227,174"/>
-<area shape="rect" id="Node000002" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" title="Insert item to the proper position of the node and return the position index." alt="" coords="275,72,430,113"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="196,130,259,114,260,119,198,135"/>
-<area shape="rect" id="Node000005" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" title="Check if node is a full (4&#45;node)" alt="" coords="509,136,650,177"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="227,152,493,153,493,159,227,157"/>
-<area shape="rect" id="Node000006" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" title="Set child pointer to the position of index." alt="" coords="279,191,426,231"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="203,172,265,187,264,192,202,177"/>
-<area shape="rect" id="Node000003" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" title="Check if item is in the node." alt="" coords="506,5,654,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="423,69,492,48,494,54,425,74"/>
-<area shape="rect" id="Node000004" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" title="Insert a value to the index position." alt="" coords="478,71,681,111"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="430,89,462,89,462,94,430,95"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="428,111,495,130,493,135,427,116"/>
-</map>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.md5
deleted file mode 100644
index 1da6d486a..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e3fcb2130cbbc81b17b50dc3f8127a22
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.svg
deleted file mode 100644
index 4511b25d0..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph.svg
+++ /dev/null
@@ -1,209 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::MergeNodeNotFull Pages: 1 -->
-<!--zoomable 178 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 515;
-var viewHeight = 178;
-var sectionId = 'dynsection-10';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>data_structures::tree_234::Tree234::MergeNodeNotFull</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Merge node to a not&#45;full target node.">
-<polygon fill="#999999" stroke="#666666" points="166,-73.5 0,-73.5 0,-43 166,-43 166,-73.5"/>
-<text text-anchor="start" x="8" y="-60" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="83" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNodeNotFull</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" target="_top" xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="white" stroke="#666666" points="318.5,-119.5 202,-119.5 202,-89 318.5,-89 318.5,-119.5"/>
-<text text-anchor="start" x="210" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="260.25" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M143.82,-73.95C158.9,-77.91 175.21,-82.19 190.68,-86.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.75,-89.62 200.31,-88.78 191.52,-82.85 189.75,-89.62"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="483.75,-71.5 377.75,-71.5 377.75,-41 483.75,-41 483.75,-71.5"/>
-<text text-anchor="start" x="385.75" y="-58" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="430.75" y="-46.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M166.38,-57.77C227.57,-57.42 309.84,-56.94 366.05,-56.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.79,-60.12 375.77,-56.56 365.75,-53.12 365.79,-60.12"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="315.12,-30.5 205.38,-30.5 205.38,0 315.12,0 315.12,-30.5"/>
-<text text-anchor="start" x="213.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="260.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.77,-42.6C162.89,-38.89 179.03,-34.93 194.21,-31.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.71,-34.69 203.59,-28.91 193.04,-27.89 194.71,-34.69"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="486.38,-169.5 375.12,-169.5 375.12,-139 486.38,-139 486.38,-169.5"/>
-<text text-anchor="start" x="383.12" y="-156" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="430.75" y="-144.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M314.1,-119.93C330.49,-124.8 348.73,-130.21 365.79,-135.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.76,-138.62 375.34,-138.11 366.75,-131.91 364.76,-138.62"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="507,-120.5 354.5,-120.5 354.5,-90 507,-90 507,-120.5"/>
-<text text-anchor="start" x="362.5" y="-107" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="430.75" y="-95.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M318.77,-104.59C326.48,-104.64 334.52,-104.68 342.6,-104.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="342.48,-108.23 352.51,-104.79 342.53,-101.23 342.48,-108.23"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M316.42,-88.53C332.48,-83.96 350.15,-78.92 366.66,-74.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="367.2,-77.71 375.86,-71.6 365.28,-70.98 367.2,-77.71"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph_org.svg
deleted file mode 100644
index 5b5fa594f..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_ad37e29e2a4a6cc0eb65cbd5595e1da95_cgraph_org.svg
+++ /dev/null
@@ -1,126 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::MergeNodeNotFull Pages: 1 -->
-<svg width="515pt" height="178pt"
- viewBox="0.00 0.00 515.00 177.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 173.5)">
-<title>data_structures::tree_234::Tree234::MergeNodeNotFull</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Merge node to a not&#45;full target node.">
-<polygon fill="#999999" stroke="#666666" points="166,-73.5 0,-73.5 0,-43 166,-43 166,-73.5"/>
-<text text-anchor="start" x="8" y="-60" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="83" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNodeNotFull</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" target="_top" xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="white" stroke="#666666" points="318.5,-119.5 202,-119.5 202,-89 318.5,-89 318.5,-119.5"/>
-<text text-anchor="start" x="210" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="260.25" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M143.82,-73.95C158.9,-77.91 175.21,-82.19 190.68,-86.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.75,-89.62 200.31,-88.78 191.52,-82.85 189.75,-89.62"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="483.75,-71.5 377.75,-71.5 377.75,-41 483.75,-41 483.75,-71.5"/>
-<text text-anchor="start" x="385.75" y="-58" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="430.75" y="-46.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M166.38,-57.77C227.57,-57.42 309.84,-56.94 366.05,-56.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.79,-60.12 375.77,-56.56 365.75,-53.12 365.79,-60.12"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="315.12,-30.5 205.38,-30.5 205.38,0 315.12,0 315.12,-30.5"/>
-<text text-anchor="start" x="213.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="260.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.77,-42.6C162.89,-38.89 179.03,-34.93 194.21,-31.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.71,-34.69 203.59,-28.91 193.04,-27.89 194.71,-34.69"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="486.38,-169.5 375.12,-169.5 375.12,-139 486.38,-139 486.38,-169.5"/>
-<text text-anchor="start" x="383.12" y="-156" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="430.75" y="-144.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M314.1,-119.93C330.49,-124.8 348.73,-130.21 365.79,-135.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.76,-138.62 375.34,-138.11 366.75,-131.91 364.76,-138.62"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="507,-120.5 354.5,-120.5 354.5,-90 507,-90 507,-120.5"/>
-<text text-anchor="start" x="362.5" y="-107" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="430.75" y="-95.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M318.77,-104.59C326.48,-104.64 334.52,-104.68 342.6,-104.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="342.48,-108.23 352.51,-104.79 342.53,-101.23 342.48,-108.23"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M316.42,-88.53C332.48,-83.96 350.15,-78.92 366.66,-74.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="367.2,-77.71 375.86,-71.6 365.28,-70.98 367.2,-77.71"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.map b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.map
deleted file mode 100644
index 11f6c67cc..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="data_structures::tree_234::Tree234::TryRightRotate" name="data_structures::tree_234::Tree234::TryRightRotate">
-<area shape="rect" id="Node000001" title="A handy function to try if we can do a right rotate to the target node." alt="" coords="5,39,207,79"/>
-<area shape="rect" id="Node000002" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" title="Check if node is a 2&#45;node." alt="" coords="273,5,418,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="207,42,258,35,258,40,208,48"/>
-<area shape="rect" id="Node000003" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9" title="Do the actual right rotate operation." alt="" coords="255,71,437,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="208,70,240,74,239,79,207,75"/>
-</map>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.md5 b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.md5
deleted file mode 100644
index 5312117aa..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b9338704eef8044ca352036ace7081fb
\ No newline at end of file
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.svg
deleted file mode 100644
index 9353c356a..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph.svg
+++ /dev/null
@@ -1,86 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::TryRightRotate Pages: 1 -->
-<svg width="332pt" height="88pt"
- viewBox="0.00 0.00 331.75 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>data_structures::tree_234::Tree234::TryRightRotate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A handy function to try if we can do a right rotate to the target node.">
-<polygon fill="#999999" stroke="#666666" points="151,-54.5 0,-54.5 0,-24 151,-24 151,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="75.5" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryRightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" target="_top" xlink:title="Check if node is a 2&#45;node.">
-<polygon fill="white" stroke="#666666" points="309.88,-79.5 200.88,-79.5 200.88,-49 309.88,-49 309.88,-79.5"/>
-<text text-anchor="start" x="208.88" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="255.38" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is2Node</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.42,-49.78C164.07,-51.56 177.1,-53.39 189.47,-55.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.72,-58.56 199.11,-56.48 189.69,-51.62 188.72,-58.56"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9" target="_top" xlink:title="Do the actual right rotate operation.">
-<polygon fill="white" stroke="#666666" points="323.75,-30.5 187,-30.5 187,0 323.75,0 323.75,-30.5"/>
-<text text-anchor="start" x="195" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="255.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::RightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.42,-29.14C159.36,-28.07 167.45,-26.98 175.43,-25.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.67,-29.4 185.11,-24.6 174.74,-22.46 175.67,-29.4"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph_org.svg b/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph_org.svg
deleted file mode 100644
index 6daa70f32..000000000
--- a/d3/d95/classdata__structures_1_1tree__234_1_1_tree234_aec0642d1d151521ca7c70ea85cdb15d3_cgraph_org.svg
+++ /dev/null
@@ -1,60 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Tree234::TryRightRotate Pages: 1 -->
-<svg width="332pt" height="88pt"
- viewBox="0.00 0.00 331.75 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>data_structures::tree_234::Tree234::TryRightRotate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A handy function to try if we can do a right rotate to the target node.">
-<polygon fill="#999999" stroke="#666666" points="151,-54.5 0,-54.5 0,-24 151,-24 151,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="75.5" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryRightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" target="_top" xlink:title="Check if node is a 2&#45;node.">
-<polygon fill="white" stroke="#666666" points="309.88,-79.5 200.88,-79.5 200.88,-49 309.88,-49 309.88,-79.5"/>
-<text text-anchor="start" x="208.88" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="255.38" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is2Node</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.42,-49.78C164.07,-51.56 177.1,-53.39 189.47,-55.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.72,-58.56 199.11,-56.48 189.69,-51.62 188.72,-58.56"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9" target="_top" xlink:title="Do the actual right rotate operation.">
-<polygon fill="white" stroke="#666666" points="323.75,-30.5 187,-30.5 187,0 323.75,0 323.75,-30.5"/>
-<text text-anchor="start" x="195" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="255.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::RightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.42,-29.14C159.36,-28.07 167.45,-26.98 175.43,-25.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.67,-29.4 185.11,-24.6 174.74,-22.46 175.67,-29.4"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/d98/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer-members.html b/d3/d98/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer-members.html
index 75d41dbd1..0fa249f49 100644
--- a/d3/d98/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer-members.html
+++ b/d3/d98/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d3/d9c/class_longest___substring-members.html b/d3/d9c/class_longest___substring-members.html
index 85870d585..f0fc464bc 100644
--- a/d3/d9c/class_longest___substring-members.html
+++ b/d3/d9c/class_longest___substring-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d3/d9f/classothers_1_1postfix__expression_1_1_stack-members.html b/d3/d9f/classothers_1_1postfix__expression_1_1_stack-members.html
index 6eb998527..5ac4c813a 100644
--- a/d3/d9f/classothers_1_1postfix__expression_1_1_stack-members.html
+++ b/d3/d9f/classothers_1_1postfix__expression_1_1_stack-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d3/da1/namespacen__queens.html b/d3/da1/namespacen__queens.html
index fab7b4e95..69c4488fb 100644
--- a/d3/da1/namespacen__queens.html
+++ b/d3/da1/namespacen__queens.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: n_queens Namespace Reference</title>
+<title>TheAlgorithms/C++: n_queens Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d3/da3/classstatistics_1_1stats__computer2-members.html b/d3/da3/classstatistics_1_1stats__computer2-members.html
index 586d50827..bdb2fef08 100644
--- a/d3/da3/classstatistics_1_1stats__computer2-members.html
+++ b/d3/da3/classstatistics_1_1stats__computer2-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d3/da3/structgeometry_1_1grahamscan_1_1_point-members.html b/d3/da3/structgeometry_1_1grahamscan_1_1_point-members.html
index 8acbcd89d..d8dde7196 100644
--- a/d3/da3/structgeometry_1_1grahamscan_1_1_point-members.html
+++ b/d3/da3/structgeometry_1_1grahamscan_1_1_point-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d3/da6/classbinary__search__tree__coll__graph.map b/d3/da6/classbinary__search__tree__coll__graph.map
index 30396942b..3d6072529 100644
--- a/d3/da6/classbinary__search__tree__coll__graph.map
+++ b/d3/da6/classbinary__search__tree__coll__graph.map
@@ -1,12 +1,10 @@
 <map id="binary_search_tree&lt; T &gt;" name="binary_search_tree&lt; T &gt;">
-<area shape="rect" id="Node000001" title="The Binary Search Tree class." alt="" coords="207,132,370,157"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/unique_ptr.html" title=" " alt="" coords="68,5,237,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="188,54,276,129,273,133,185,58"/>
-<area shape="rect" id="Node000003" href="$dd/db6/structbinary__search__tree_1_1bst__node.html" title="A struct to represent a node in the Binary Search Tree." alt="" coords="38,124,169,165"/>
-<area shape="poly" id="edge4_Node000003_Node000002" title=" " alt="" coords="142,61,126,101,115,125,110,122,121,99,137,59"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="95,108,96,89,102,69,121,45,125,48,107,71,102,89,101,109"/>
-<area shape="rect" id="Node000004" title=" " alt="" coords="5,13,44,38"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="36,52,60,98,81,122,77,125,55,102,31,54"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/size_t.html" title=" " alt="" coords="261,13,343,38"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="301,54,293,131,287,131,296,54"/>
+<area shape="rect" id="Node000001" title="The Binary Search Tree class." alt="" coords="5,132,169,157"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="70,5,240,46"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="125,59,116,71,101,103,92,132,87,130,96,101,112,69,121,56"/>
+<area shape="rect" id="Node000003" href="$dd/db6/structbinary__search__tree_1_1bst__node.html" title="A struct to represent a node in the Binary Search Tree." alt="" coords="193,124,325,165"/>
+<area shape="poly" id="edge4_Node000003_Node000002" title=" " alt="" coords="160,61,166,81,176,98,189,111,205,121,202,126,186,115,172,102,161,83,155,62"/>
+<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="235,113,202,72,178,49,181,45,206,68,239,109"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="264,13,302,38"/>
+<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="280,54,266,124,260,123,275,53"/>
 </map>
diff --git a/d3/da6/classbinary__search__tree__coll__graph.md5 b/d3/da6/classbinary__search__tree__coll__graph.md5
index 18afeb956..b07aee5b1 100644
--- a/d3/da6/classbinary__search__tree__coll__graph.md5
+++ b/d3/da6/classbinary__search__tree__coll__graph.md5
@@ -1 +1 @@
-ff3ded2dfa555ac04d4557318afe8aea
\ No newline at end of file
+e5687e1d8e8d583f05fc35234e9360f5
\ No newline at end of file
diff --git a/d3/da6/classbinary__search__tree__coll__graph.svg b/d3/da6/classbinary__search__tree__coll__graph.svg
index ce4117668..717148a1a 100644
--- a/d3/da6/classbinary__search__tree__coll__graph.svg
+++ b/d3/da6/classbinary__search__tree__coll__graph.svg
@@ -4,8 +4,8 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: binary_search_tree&lt; T &gt; Pages: 1 -->
-<svg width="282pt" height="128pt"
- viewBox="0.00 0.00 281.65 127.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="248pt" height="128pt"
+ viewBox="0.00 0.00 247.50 127.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
 <svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
@@ -23,18 +23,18 @@
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="The Binary Search Tree class.">
-<polygon fill="#999999" stroke="#666666" points="273.65,-24.88 151.15,-24.88 151.15,-5.63 273.65,-5.63 273.65,-24.88"/>
-<text text-anchor="middle" x="212.4" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree&lt; T &gt;</text>
+<polygon fill="#999999" stroke="#666666" points="122.5,-24.88 0,-24.88 0,-5.63 122.5,-5.63 122.5,-24.88"/>
+<text text-anchor="middle" x="61.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree&lt; T &gt;</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173.9,-119.5 46.9,-119.5 46.9,-89 173.9,-89 173.9,-119.5"/>
-<text text-anchor="start" x="54.9" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr&lt; binary</text>
-<text text-anchor="middle" x="110.4" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search_tree::bst_node &gt;</text>
+<g id="a_Node000002"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="175.75,-119.5 48.75,-119.5 48.75,-89 175.75,-89 175.75,-119.5"/>
+<text text-anchor="start" x="56.75" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr&lt; binary</text>
+<text text-anchor="middle" x="112.25" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search_tree::bst_node &gt;</text>
 </a>
 </g>
 </g>
@@ -42,19 +42,19 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M135.8,-81.59C157.05,-63.46 186.3,-38.51 201.79,-25.3"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="133.73,-78.75 128.39,-87.9 138.27,-84.07 133.73,-78.75"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M88.23,-80.22C85.78,-77.25 83.47,-74.15 81.5,-71 72.27,-56.21 66.3,-36.58 63.38,-25.29"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="85.5,-82.42 94.82,-87.47 90.69,-77.71 85.5,-82.42"/>
 </a>
 </g>
-<text text-anchor="middle" x="185.91" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> root_</text>
+<text text-anchor="middle" x="93.88" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> root_</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
 <g id="a_Node000003"><a xlink:href="../../dd/db6/structbinary__search__tree_1_1bst__node.html" target="_top" xlink:title="A struct to represent a node in the Binary Search Tree.">
-<polygon fill="white" stroke="#666666" points="122.65,-30.5 24.15,-30.5 24.15,0 122.65,0 122.65,-30.5"/>
-<text text-anchor="start" x="32.15" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="73.4" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; T &gt;::bst_node</text>
+<polygon fill="white" stroke="#666666" points="239.5,-30.5 141,-30.5 141,0 239.5,0 239.5,-30.5"/>
+<text text-anchor="start" x="149" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
+<text text-anchor="middle" x="190.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; T &gt;::bst_node</text>
 </a>
 </g>
 </g>
@@ -62,29 +62,29 @@
 <g id="edge4_Node000003_Node000002" class="edge">
 <title>Node2&#45;&gt;Node3</title>
 <g id="a_edge4_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M100.64,-78.16C96.92,-68.81 92.57,-58.12 88.4,-48.5 85.9,-42.72 83.01,-36.43 80.44,-30.95"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="97.34,-79.33 104.26,-87.35 103.85,-76.76 97.34,-79.33"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M114.43,-77.41C116.36,-67.52 119.93,-56.65 126.5,-48.5 132.34,-41.26 140.23,-35.49 148.47,-30.96"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="110.97,-76.87 113.01,-87.26 117.9,-77.86 110.97,-76.87"/>
 </a>
 </g>
-<text text-anchor="middle" x="107.12" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> left</text>
-<text text-anchor="middle" x="107.12" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">right</text>
+<text text-anchor="middle" x="135.88" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> left</text>
+<text text-anchor="middle" x="135.88" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">right</text>
 </g>
 <!-- Node3&#45;&gt;Node2 -->
 <g id="edge2_Node000002_Node000003" class="edge">
 <title>Node3&#45;&gt;Node2</title>
 <g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M69.52,-42.1C69.17,-51.56 70.09,-62.12 74.15,-71 77.23,-77.74 82.48,-83.66 88.04,-88.52"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="72.98,-42.67 70.37,-32.4 66.01,-42.06 72.98,-42.67"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M174.03,-40.16C166.88,-50.08 158.1,-61.47 149.25,-71 143.57,-77.12 136.81,-83.28 130.64,-88.55"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="176.81,-42.28 179.71,-32.09 171.09,-38.25 176.81,-42.28"/>
 </a>
 </g>
-<text text-anchor="middle" x="81.28" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> ptr</text>
+<text text-anchor="middle" x="174.35" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> ptr</text>
 </g>
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
 <g id="a_Node000004"><a xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="28.8,-113.88 0,-113.88 0,-94.62 28.8,-94.62 28.8,-113.88"/>
-<text text-anchor="middle" x="14.4" y="-100.38" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
+<polygon fill="white" stroke="#bfbfbf" points="222.65,-113.88 193.85,-113.88 193.85,-94.62 222.65,-94.62 222.65,-113.88"/>
+<text text-anchor="middle" x="208.25" y="-100.38" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
 </a>
 </g>
 </g>
@@ -92,30 +92,11 @@
 <g id="edge3_Node000003_Node000004" class="edge">
 <title>Node4&#45;&gt;Node3</title>
 <g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M21.13,-83.59C25.37,-72.69 31.49,-59.22 39.15,-48.5 43.71,-42.12 49.66,-35.99 55.33,-30.82"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="17.93,-82.13 17.8,-92.73 24.51,-84.53 17.93,-82.13"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M204.15,-83.45C200.84,-67.42 196.24,-45.22 193.26,-30.8"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="200.63,-83.7 206.08,-92.79 207.49,-82.28 200.63,-83.7"/>
 </a>
 </g>
-<text text-anchor="middle" x="52.27" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> value</text>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="253.28,-113.88 191.53,-113.88 191.53,-94.62 253.28,-94.62 253.28,-113.88"/>
-<text text-anchor="middle" x="222.4" y="-100.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node5&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M220.06,-82.88C217.97,-64.68 215,-38.84 213.44,-25.31"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="216.58,-83.23 221.19,-92.76 223.53,-82.43 216.58,-83.23"/>
-</a>
-</g>
-<text text-anchor="middle" x="231.71" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> size_</text>
+<text text-anchor="middle" x="214.52" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> value</text>
 </g>
 </g>
 </svg>
diff --git a/d3/da6/classbinary__search__tree__coll__graph_org.svg b/d3/da6/classbinary__search__tree__coll__graph_org.svg
index a459e62a6..eda153ebc 100644
--- a/d3/da6/classbinary__search__tree__coll__graph_org.svg
+++ b/d3/da6/classbinary__search__tree__coll__graph_org.svg
@@ -4,26 +4,26 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: binary_search_tree&lt; T &gt; Pages: 1 -->
-<svg width="282pt" height="128pt"
- viewBox="0.00 0.00 281.65 127.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="248pt" height="128pt"
+ viewBox="0.00 0.00 247.50 127.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 <g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 123.5)">
 <title>binary_search_tree&lt; T &gt;</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="The Binary Search Tree class.">
-<polygon fill="#999999" stroke="#666666" points="273.65,-24.88 151.15,-24.88 151.15,-5.63 273.65,-5.63 273.65,-24.88"/>
-<text text-anchor="middle" x="212.4" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree&lt; T &gt;</text>
+<polygon fill="#999999" stroke="#666666" points="122.5,-24.88 0,-24.88 0,-5.63 122.5,-5.63 122.5,-24.88"/>
+<text text-anchor="middle" x="61.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree&lt; T &gt;</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173.9,-119.5 46.9,-119.5 46.9,-89 173.9,-89 173.9,-119.5"/>
-<text text-anchor="start" x="54.9" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr&lt; binary</text>
-<text text-anchor="middle" x="110.4" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search_tree::bst_node &gt;</text>
+<g id="a_Node000002"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="175.75,-119.5 48.75,-119.5 48.75,-89 175.75,-89 175.75,-119.5"/>
+<text text-anchor="start" x="56.75" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr&lt; binary</text>
+<text text-anchor="middle" x="112.25" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search_tree::bst_node &gt;</text>
 </a>
 </g>
 </g>
@@ -31,19 +31,19 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M135.8,-81.59C157.05,-63.46 186.3,-38.51 201.79,-25.3"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="133.73,-78.75 128.39,-87.9 138.27,-84.07 133.73,-78.75"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M88.23,-80.22C85.78,-77.25 83.47,-74.15 81.5,-71 72.27,-56.21 66.3,-36.58 63.38,-25.29"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="85.5,-82.42 94.82,-87.47 90.69,-77.71 85.5,-82.42"/>
 </a>
 </g>
-<text text-anchor="middle" x="185.91" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> root_</text>
+<text text-anchor="middle" x="93.88" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> root_</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
 <g id="a_Node000003"><a xlink:href="../../dd/db6/structbinary__search__tree_1_1bst__node.html" target="_top" xlink:title="A struct to represent a node in the Binary Search Tree.">
-<polygon fill="white" stroke="#666666" points="122.65,-30.5 24.15,-30.5 24.15,0 122.65,0 122.65,-30.5"/>
-<text text-anchor="start" x="32.15" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="73.4" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; T &gt;::bst_node</text>
+<polygon fill="white" stroke="#666666" points="239.5,-30.5 141,-30.5 141,0 239.5,0 239.5,-30.5"/>
+<text text-anchor="start" x="149" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
+<text text-anchor="middle" x="190.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; T &gt;::bst_node</text>
 </a>
 </g>
 </g>
@@ -51,29 +51,29 @@
 <g id="edge4_Node000003_Node000002" class="edge">
 <title>Node2&#45;&gt;Node3</title>
 <g id="a_edge4_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M100.64,-78.16C96.92,-68.81 92.57,-58.12 88.4,-48.5 85.9,-42.72 83.01,-36.43 80.44,-30.95"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="97.34,-79.33 104.26,-87.35 103.85,-76.76 97.34,-79.33"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M114.43,-77.41C116.36,-67.52 119.93,-56.65 126.5,-48.5 132.34,-41.26 140.23,-35.49 148.47,-30.96"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="110.97,-76.87 113.01,-87.26 117.9,-77.86 110.97,-76.87"/>
 </a>
 </g>
-<text text-anchor="middle" x="107.12" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> left</text>
-<text text-anchor="middle" x="107.12" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">right</text>
+<text text-anchor="middle" x="135.88" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> left</text>
+<text text-anchor="middle" x="135.88" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">right</text>
 </g>
 <!-- Node3&#45;&gt;Node2 -->
 <g id="edge2_Node000002_Node000003" class="edge">
 <title>Node3&#45;&gt;Node2</title>
 <g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M69.52,-42.1C69.17,-51.56 70.09,-62.12 74.15,-71 77.23,-77.74 82.48,-83.66 88.04,-88.52"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="72.98,-42.67 70.37,-32.4 66.01,-42.06 72.98,-42.67"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M174.03,-40.16C166.88,-50.08 158.1,-61.47 149.25,-71 143.57,-77.12 136.81,-83.28 130.64,-88.55"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="176.81,-42.28 179.71,-32.09 171.09,-38.25 176.81,-42.28"/>
 </a>
 </g>
-<text text-anchor="middle" x="81.28" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> ptr</text>
+<text text-anchor="middle" x="174.35" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> ptr</text>
 </g>
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
 <g id="a_Node000004"><a xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="28.8,-113.88 0,-113.88 0,-94.62 28.8,-94.62 28.8,-113.88"/>
-<text text-anchor="middle" x="14.4" y="-100.38" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
+<polygon fill="white" stroke="#bfbfbf" points="222.65,-113.88 193.85,-113.88 193.85,-94.62 222.65,-94.62 222.65,-113.88"/>
+<text text-anchor="middle" x="208.25" y="-100.38" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
 </a>
 </g>
 </g>
@@ -81,30 +81,11 @@
 <g id="edge3_Node000003_Node000004" class="edge">
 <title>Node4&#45;&gt;Node3</title>
 <g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M21.13,-83.59C25.37,-72.69 31.49,-59.22 39.15,-48.5 43.71,-42.12 49.66,-35.99 55.33,-30.82"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="17.93,-82.13 17.8,-92.73 24.51,-84.53 17.93,-82.13"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M204.15,-83.45C200.84,-67.42 196.24,-45.22 193.26,-30.8"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="200.63,-83.7 206.08,-92.79 207.49,-82.28 200.63,-83.7"/>
 </a>
 </g>
-<text text-anchor="middle" x="52.27" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> value</text>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="253.28,-113.88 191.53,-113.88 191.53,-94.62 253.28,-94.62 253.28,-113.88"/>
-<text text-anchor="middle" x="222.4" y="-100.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node5&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M220.06,-82.88C217.97,-64.68 215,-38.84 213.44,-25.31"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="216.58,-83.23 221.19,-92.76 223.53,-82.43 216.58,-83.23"/>
-</a>
-</g>
-<text text-anchor="middle" x="231.71" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> size_</text>
+<text text-anchor="middle" x="214.52" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> value</text>
 </g>
 </g>
 </svg>
diff --git a/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.map b/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.map
index 7a704130c..ef5ad855b 100644
--- a/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.map
+++ b/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.map
@@ -1,10 +1,8 @@
 <map id="data_structures::sparse_table::Sparse_table" name="data_structures::sparse_table::Sparse_table">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,286,164,327"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array.html" title=" " alt="" coords="6,94,163,120"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="83,136,77,183,78,239,84,285,79,286,73,239,72,183,77,135"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array.html" title=" " alt="" coords="114,183,258,223"/>
-<area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="110,128,166,180,163,184,107,132"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="41,5,128,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="87,47,87,94,82,94,82,47"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="158,236,106,288,102,284,154,232"/>
+<area shape="rect" id="Node000001" title=" " alt="" coords="5,198,164,238"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="6,5,163,31"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="83,47,77,94,78,150,84,197,79,197,73,150,72,94,77,46"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="114,94,258,135"/>
+<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="110,40,166,91,163,95,107,44"/>
+<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="158,147,106,199,102,195,154,144"/>
 </map>
diff --git a/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.md5 b/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.md5
index 785967f9e..b745f8626 100644
--- a/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.md5
+++ b/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.md5
@@ -1 +1 @@
-2896309b56d557019c7b0406773e928b
\ No newline at end of file
+dc3f886e4e584f5db23a82a4c0668541
\ No newline at end of file
diff --git a/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.svg b/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.svg
index 089a285d1..fe2bf9eef 100644
--- a/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.svg
+++ b/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.svg
@@ -4,8 +4,8 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: data_structures::sparse_table::Sparse_table Pages: 1 -->
-<svg width="197pt" height="249pt"
- viewBox="0.00 0.00 197.12 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="197pt" height="183pt"
+ viewBox="0.00 0.00 197.12 182.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
 <svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
@@ -17,7 +17,7 @@
 ]]></style>
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
 <svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 178.75)">
 <title>data_structures::sparse_table::Sparse_table</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="118.38,-174.75 0.38,-174.75 0.38,-155.5 118.38,-155.5 118.38,-174.75"/>
 <text text-anchor="middle" x="59.38" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; int64_t, N &gt;</text>
 </a>
@@ -49,49 +49,30 @@
 <text text-anchor="middle" x="62.25" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> A</text>
 <text text-anchor="middle" x="62.25" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">LOG</text>
 </g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<!-- Node3 -->
+<g id="Node000003" class="node">
+<title>Node3</title>
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="189.12,-108.25 81.62,-108.25 81.62,-77.75 189.12,-77.75 189.12,-108.25"/>
 <text text-anchor="start" x="89.62" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; std::array</text>
 <text text-anchor="middle" x="135.38" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int64_t, N &gt;, M &gt;</text>
 </a>
 </g>
 </g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
+<!-- Node2&#45;&gt;Node3 -->
+<g id="edge3_Node000003_Node000002" class="edge">
+<title>Node2&#45;&gt;Node3</title>
+<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
 <path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M77.44,-147.46C90.22,-135.66 107.21,-119.99 119.48,-108.67"/>
 <polygon fill="#9a32cd" stroke="#9a32cd" points="75.09,-144.86 70.11,-154.22 79.84,-150.01 75.09,-144.86"/>
 </a>
 </g>
 <text text-anchor="middle" x="121.03" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
 </g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="91.75,-241.25 27,-241.25 27,-222 91.75,-222 91.75,-241.25"/>
-<text text-anchor="middle" x="59.38" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::int64_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M59.38,-210.15C59.38,-198.32 59.38,-184.04 59.38,-175.02"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="55.88,-210.14 59.38,-220.14 62.88,-210.14 55.88,-210.14"/>
-</a>
-</g>
-<text text-anchor="middle" x="80.75" y="-194.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
-<!-- Node4&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node4&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
+<!-- Node3&#45;&gt;Node1 -->
+<g id="edge2_Node000001_Node000003" class="edge">
+<title>Node3&#45;&gt;Node1</title>
+<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
 <path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M112.92,-69.62C100.34,-57.08 85.01,-41.8 73.98,-30.81"/>
 <polygon fill="#9a32cd" stroke="#9a32cd" points="110.1,-71.75 119.65,-76.33 115.04,-66.79 110.1,-71.75"/>
 </a>
diff --git a/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph_org.svg b/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph_org.svg
index 9730ee997..73fcfbc77 100644
--- a/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph_org.svg
+++ b/d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph_org.svg
@@ -4,9 +4,9 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: data_structures::sparse_table::Sparse_table Pages: 1 -->
-<svg width="197pt" height="249pt"
- viewBox="0.00 0.00 197.12 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
+<svg width="197pt" height="183pt"
+ viewBox="0.00 0.00 197.12 182.75" 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 178.75)">
 <title>data_structures::sparse_table::Sparse_table</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="118.38,-174.75 0.38,-174.75 0.38,-155.5 118.38,-155.5 118.38,-174.75"/>
 <text text-anchor="middle" x="59.38" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; int64_t, N &gt;</text>
 </a>
@@ -38,49 +38,30 @@
 <text text-anchor="middle" x="62.25" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> A</text>
 <text text-anchor="middle" x="62.25" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">LOG</text>
 </g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<!-- Node3 -->
+<g id="Node000003" class="node">
+<title>Node3</title>
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="189.12,-108.25 81.62,-108.25 81.62,-77.75 189.12,-77.75 189.12,-108.25"/>
 <text text-anchor="start" x="89.62" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; std::array</text>
 <text text-anchor="middle" x="135.38" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int64_t, N &gt;, M &gt;</text>
 </a>
 </g>
 </g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
+<!-- Node2&#45;&gt;Node3 -->
+<g id="edge3_Node000003_Node000002" class="edge">
+<title>Node2&#45;&gt;Node3</title>
+<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
 <path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M77.44,-147.46C90.22,-135.66 107.21,-119.99 119.48,-108.67"/>
 <polygon fill="#9a32cd" stroke="#9a32cd" points="75.09,-144.86 70.11,-154.22 79.84,-150.01 75.09,-144.86"/>
 </a>
 </g>
 <text text-anchor="middle" x="121.03" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
 </g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="91.75,-241.25 27,-241.25 27,-222 91.75,-222 91.75,-241.25"/>
-<text text-anchor="middle" x="59.38" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::int64_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M59.38,-210.15C59.38,-198.32 59.38,-184.04 59.38,-175.02"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="55.88,-210.14 59.38,-220.14 62.88,-210.14 55.88,-210.14"/>
-</a>
-</g>
-<text text-anchor="middle" x="80.75" y="-194.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
-<!-- Node4&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node4&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
+<!-- Node3&#45;&gt;Node1 -->
+<g id="edge2_Node000001_Node000003" class="edge">
+<title>Node3&#45;&gt;Node1</title>
+<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
 <path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M112.92,-69.62C100.34,-57.08 85.01,-41.8 73.98,-30.81"/>
 <polygon fill="#9a32cd" stroke="#9a32cd" points="110.1,-71.75 119.65,-76.33 115.04,-66.79 110.1,-71.75"/>
 </a>
diff --git a/d3/dae/dsu__path__compression_8cpp.html b/d3/dae/dsu__path__compression_8cpp.html
index 27184a475..9d07b0197 100644
--- a/d3/dae/dsu__path__compression_8cpp.html
+++ b/d3/dae/dsu__path__compression_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/dsu_path_compression.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/dsu_path_compression.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for dsu_path_compression.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/de3/dsu__path__compression_8cpp__incl.svg" width="336" height="126"><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">
+</div>
+<p><a href="../../d3/dae/dsu__path__compression_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td></tr>
@@ -146,6 +165,8 @@ Functions</h2></td></tr>
 <p>It is a very powerful data structure that keeps track of different clusters(sets) of elements, these sets are disjoint(doesnot have a common
 element). Disjoint sets uses cases : for finding connected components in a graph, used in Kruskal's algorithm for finding <a class="el" href="../../d4/d12/namespace_minimum.html" title="Implementation of Minimum Edit Distance algorithm.">Minimum</a> Spanning tree. Operations that can be performed: 1) UnionSet(i,j): add(element i and j to the set) 2) findSet(i): returns the representative of the set to which i belogngs to. 3) get_max(i),get_min(i) : returns the maximum and minimum Below is the class-based approach which uses the heuristic of path compression. Using path compression in findSet(i),we are able to get to the representative of i in O(1) time. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AayushVyasKIIT" target="_blank">AayushVyasKIIT</a> </dd></dl>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../df/d28/dsu__union__rank_8cpp.html" title="DSU (Disjoint sets)">dsu_union_rank.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -166,24 +187,21 @@ element). Disjoint sets uses cases : for finding connected components in a graph
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
 <p>&lt; number of items</p>
 <p>&lt; object of class disjoint sets</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00206">206</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  206</span>           {</div>
-<div class="line"><span class="lineno">  207</span>    uint64_t n = 10;  <span class="comment">///&lt; number of items</span></div>
-<div class="line"><span class="lineno">  208</span>    <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1);     <span class="comment">///&lt; object of class disjoint sets</span></div>
+<div class="line"><span class="lineno">  207</span>    uint64_t n = 10;  </div>
+<div class="line"><span class="lineno">  208</span>    <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1);     </div>
 <div class="line"><span class="lineno">  209</span> </div>
 <div class="line"><span class="lineno">  210</span>    <a class="code hl_function" href="#ae7880ce913f3058a35ff106d5be9e243">test1</a>();  <span class="comment">// run 1st test case</span></div>
 <div class="line"><span class="lineno">  211</span>    <a class="code hl_function" href="#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>();  <span class="comment">// run 2nd test case</span></div>
 <div class="line"><span class="lineno">  212</span> </div>
 <div class="line"><span class="lineno">  213</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  214</span>}</div>
-<div class="ttc" id="aclassdsu_html"><div class="ttname"><a href="../../dd/d1f/classdsu.html">dsu</a></div><div class="ttdoc">Disjoint sets union data structure, class based representation.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:34</div></div>
-<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:187</div></div>
-<div class="ttc" id="adsu__path__compression_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-test implementations, 1st test.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:170</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="599" height="384"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdsu_html"><div class="ttname"><a href="../../dd/d1f/classdsu.html">dsu</a></div><div class="ttdoc">Disjoint sets union data structure, class based representation.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00034">dsu_path_compression.cpp:34</a></div></div>
+<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00187">dsu_path_compression.cpp:187</a></div></div>
+<div class="ttc" id="adsu__path__compression_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-test implementations, 1st test.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00170">dsu_path_compression.cpp:170</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae7880ce913f3058a35ff106d5be9e243" name="ae7880ce913f3058a35ff106d5be9e243"></a>
@@ -213,28 +231,23 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
 <p>&lt; number of items</p>
 <p>&lt; object of class disjoint sets</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00170">170</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  170</span>                    {</div>
 <div class="line"><span class="lineno">  171</span>    <span class="comment">// the minimum, maximum, and size of the set</span></div>
-<div class="line"><span class="lineno">  172</span>    uint64_t n = 10;  <span class="comment">///&lt; number of items</span></div>
-<div class="line"><span class="lineno">  173</span>    <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1);     <span class="comment">///&lt; object of class disjoint sets</span></div>
+<div class="line"><span class="lineno">  172</span>    uint64_t n = 10;  </div>
+<div class="line"><span class="lineno">  173</span>    <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1);     </div>
 <div class="line"><span class="lineno">  174</span>    <span class="comment">// set 1</span></div>
 <div class="line"><span class="lineno">  175</span>    d.UnionSet(1, 2);  <span class="comment">// performs union operation on 1 and 2</span></div>
 <div class="line"><span class="lineno">  176</span>    d.UnionSet(1, 4);  <span class="comment">// performs union operation on 1 and 4</span></div>
-<div class="line"><span class="lineno">  177</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;uint64_t&gt;</a> ans = {1, 4, 3};</div>
+<div class="line"><span class="lineno">  177</span>    vector&lt;uint64_t&gt; ans = {1, 4, 3};</div>
 <div class="line"><span class="lineno">  178</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; ans.size(); i++) {</div>
 <div class="line"><span class="lineno">  179</span>        assert(d.get(4).at(i) == ans[i]);  <span class="comment">// makes sure algorithm works fine</span></div>
 <div class="line"><span class="lineno">  180</span>    }</div>
-<div class="line"><span class="lineno">  181</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;1st test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><span class="lineno">  181</span>    cout &lt;&lt; <span class="stringliteral">&quot;1st test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">  182</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="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> matrix_exponentiation.cpp:36</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg" width="502" height="384"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a45d94ead4cf4e1ff9f87c38bc99f59ae" name="a45d94ead4cf4e1ff9f87c38bc99f59ae"></a>
@@ -264,26 +277,23 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
 <p>&lt; number of items</p>
 <p>&lt; object of class disjoint sets</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00187">187</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  187</span>                    {</div>
 <div class="line"><span class="lineno">  188</span>    <span class="comment">// the minimum, maximum, and size of the set</span></div>
-<div class="line"><span class="lineno">  189</span>    uint64_t n = 10;  <span class="comment">///&lt; number of items</span></div>
-<div class="line"><span class="lineno">  190</span>    <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1);     <span class="comment">///&lt; object of class disjoint sets</span></div>
+<div class="line"><span class="lineno">  189</span>    uint64_t n = 10;  </div>
+<div class="line"><span class="lineno">  190</span>    <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1);     </div>
 <div class="line"><span class="lineno">  191</span>    <span class="comment">// set 1</span></div>
 <div class="line"><span class="lineno">  192</span>    d.UnionSet(3, 5);</div>
 <div class="line"><span class="lineno">  193</span>    d.UnionSet(5, 6);</div>
 <div class="line"><span class="lineno">  194</span>    d.UnionSet(5, 7);</div>
-<div class="line"><span class="lineno">  195</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;uint64_t&gt;</a> ans = {3, 7, 4};</div>
+<div class="line"><span class="lineno">  195</span>    vector&lt;uint64_t&gt; ans = {3, 7, 4};</div>
 <div class="line"><span class="lineno">  196</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; ans.size(); i++) {</div>
 <div class="line"><span class="lineno">  197</span>        assert(d.get(3).at(i) == ans[i]);  <span class="comment">// makes sure algorithm works fine</span></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/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;2nd test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><span class="lineno">  199</span>    cout &lt;&lt; <span class="stringliteral">&quot;2nd test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">  200</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg" width="502" height="384"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.map b/d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.map
deleted file mode 100644
index 608797aa9..000000000
--- a/d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.map
+++ /dev/null
@@ -1,28 +0,0 @@
-<map id="test2" name="test2">
-<area shape="rect" id="Node000001" title="Self&#45;implementations, 2nd test." alt="" coords="5,179,56,204"/>
-<area shape="rect" id="Node000002" href="$dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" title="prints the minimum, maximum and size of the set to which i belongs to" alt="" coords="122,80,190,106"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="47,176,125,113,128,118,50,180"/>
-<area shape="rect" id="Node000007" href="$dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="104,229,208,255"/>
-<area shape="poly" id="edge9_Node000001_Node000007" title=" " alt="" coords="57,199,109,221,107,226,55,204"/>
-<area shape="rect" id="Node000003" href="$dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" title="A utility function that returns the max element of the set to which i belongs to." alt="" coords="256,5,356,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="182,77,255,40,263,36,265,41,257,45,184,82"/>
-<area shape="rect" id="Node000005" href="$dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" title="A utility function that returns the min element of the set to which i belongs to." alt="" coords="258,55,354,80"/>
-<area shape="poly" id="edge5_Node000002_Node000005" title=" " alt="" coords="190,85,243,75,243,81,191,90"/>
-<area shape="rect" id="Node000006" href="$dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" title="A utility function that returns the size of the set to which i belongs to." alt="" coords="269,104,343,130"/>
-<area shape="poly" id="edge7_Node000002_Node000006" title=" " alt="" coords="191,96,254,106,254,111,190,101"/>
-<area shape="rect" id="Node000004" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="404,104,496,130"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="339,29,358,40,425,92,422,96,355,44,336,34"/>
-<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="425,105,420,95,423,86,433,80,450,77,468,80,477,87,474,91,466,85,450,83,435,85,428,89,426,95,430,102"/>
-<area shape="poly" id="edge6_Node000005_Node000004" title=" " alt="" coords="347,78,397,96,395,101,345,83"/>
-<area shape="poly" id="edge8_Node000006_Node000004" title=" " alt="" coords="344,114,389,114,389,120,344,120"/>
-<area shape="poly" id="edge10_Node000007_Node000004" title=" " alt="" coords="181,226,255,190,397,133,399,138,257,195,184,231"/>
-<area shape="rect" id="Node000008" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="259,205,353,231"/>
-<area shape="poly" id="edge11_Node000007_Node000008" title=" " alt="" coords="208,231,243,225,244,231,209,236"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="270,255,342,280"/>
-<area shape="poly" id="edge13_Node000007_Node000009" title=" " alt="" coords="209,248,255,256,254,262,208,254"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="272,304,340,330"/>
-<area shape="poly" id="edge14_Node000007_Node000010" title=" " alt="" coords="184,253,257,290,265,294,263,299,255,295,182,258"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="267,353,345,379"/>
-<area shape="poly" id="edge15_Node000007_Node000011" title=" " alt="" coords="170,254,207,295,258,340,262,343,259,348,254,344,203,299,166,257"/>
-<area shape="poly" id="edge12_Node000008_Node000004" title=" " alt="" coords="327,203,355,184,418,137,421,142,358,188,330,207"/>
-</map>
diff --git a/d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.md5 b/d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.md5
deleted file mode 100644
index 6a9ede4ca..000000000
--- a/d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8cd3cfacef1c102f7424cb9f65c51fef
\ No newline at end of file
diff --git a/d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg b/d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg
deleted file mode 100644
index 1194dcaa2..000000000
--- a/d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg
+++ /dev/null
@@ -1,272 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="376pt" height="288pt"
- viewBox="0.00 0.00 375.75 288.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 284.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;implementations, 2nd test.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-150.25 0,-150.25 0,-131 37.75,-131 37.75,-150.25"/>
-<text text-anchor="middle" x="18.88" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
-<polygon fill="white" stroke="#666666" points="138.5,-224.25 87.25,-224.25 87.25,-205 138.5,-205 138.5,-224.25"/>
-<text text-anchor="middle" x="112.88" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.28,-150.6C47.23,-162.63 72.6,-183.03 90.68,-197.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.21,-200.08 98.19,-203.62 92.59,-194.62 88.21,-200.08"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="152,-112.25 73.75,-112.25 73.75,-93 152,-93 152,-112.25"/>
-<text text-anchor="middle" x="112.88" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge9_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge9_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.05,-133.12C49.21,-128.51 63.86,-122.46 77.17,-116.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.16,-120.34 86.07,-113.29 75.49,-113.87 78.16,-120.34"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="263.25,-280.25 188,-280.25 188,-261 263.25,-261 263.25,-280.25"/>
-<text text-anchor="middle" x="225.62" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.34,-224.72C148.26,-232.43 169.39,-243.28 188,-252.62 189.95,-253.6 191.95,-254.6 193.98,-255.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.19,-258.63 202.7,-259.92 195.29,-252.36 192.19,-258.63"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="261.75,-243.25 189.5,-243.25 189.5,-224 261.75,-224 261.75,-243.25"/>
-<text text-anchor="middle" x="225.62" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.73,-218.89C150.39,-220.89 164.67,-223.34 178.22,-225.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.41,-229.08 187.86,-227.32 178.6,-222.18 177.41,-229.08"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="253.5,-206.25 197.75,-206.25 197.75,-187 253.5,-187 253.5,-206.25"/>
-<text text-anchor="middle" x="225.62" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge7_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge7_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.73,-210.59C152.79,-208.3 170.67,-205.39 186.47,-202.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="186.72,-206.33 196.03,-201.27 185.6,-199.42 186.72,-206.33"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="367.75,-206.25 299.25,-206.25 299.25,-187 367.75,-187 367.75,-206.25"/>
-<text text-anchor="middle" x="333.5" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.14,-260.55C253.91,-258.14 258.83,-255.45 263.25,-252.62 281.25,-241.13 299.98,-225.74 313.42,-214"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.52,-216.81 320.67,-207.55 310.87,-211.58 315.52,-216.81"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M316.61,-206.54C308.91,-215.15 314.54,-224.25 333.5,-224.25 343.87,-224.25 350.25,-221.53 352.65,-217.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="356.11,-217.12 350.69,-208.02 349.25,-218.52 356.11,-217.12"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge6_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.56,-223.51C267.11,-219.48 280.6,-214.76 293.03,-210.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.89,-213.83 302.18,-207.22 291.58,-207.22 293.89,-213.83"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge8_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.89,-196.62C264.18,-196.62 276.19,-196.62 287.67,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.38,-200.13 297.38,-196.63 287.38,-193.13 287.38,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge10_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge10_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.85,-112.67C147.7,-120.39 168.95,-131.13 188,-139.62 223.49,-155.45 264.81,-171.52 294.15,-182.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="292.76,-185.76 303.35,-185.98 295.21,-179.2 292.76,-185.76"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="261,-130.25 190.25,-130.25 190.25,-111 261,-111 261,-130.25"/>
-<text text-anchor="middle" x="225.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge11_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge11_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.3,-108.87C160.81,-110.25 169.92,-111.73 178.7,-113.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.05,-116.6 188.48,-114.75 179.17,-109.69 178.05,-116.6"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.75,-93.25 198.5,-93.25 198.5,-74 252.75,-74 252.75,-93.25"/>
-<text text-anchor="middle" x="225.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge13_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge13_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.3,-96.03C163.52,-94.11 175.77,-92.01 186.94,-90.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.36,-93.57 196.62,-88.43 186.17,-86.67 187.36,-93.57"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.25,-56.25 200,-56.25 200,-37 251.25,-37 251.25,-56.25"/>
-<text text-anchor="middle" x="225.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node10 -->
-<g id="edge14_Node000007_Node000010" class="edge">
-<title>Node7&#45;&gt;Node10</title>
-<g id="a_edge14_Node000007_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.34,-92.53C148.26,-84.82 169.39,-73.97 188,-64.62 189.95,-63.65 191.95,-62.65 193.98,-61.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.29,-64.89 202.7,-57.33 192.19,-58.62 195.29,-64.89"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255,-19.25 196.25,-19.25 196.25,0 255,0 255,-19.25"/>
-<text text-anchor="middle" x="225.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node11 -->
-<g id="edge15_Node000007_Node000011" class="edge">
-<title>Node7&#45;&gt;Node11</title>
-<g id="a_edge15_Node000007_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.89,-92.58C134.62,-77.11 160.81,-47.2 188,-27.62 189.13,-26.81 190.31,-26.01 191.51,-25.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.85,-28.5 199.78,-20.49 189.36,-22.43 192.85,-28.5"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge12_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge12_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.46,-130.68C248.96,-134.9 256.53,-139.91 263.25,-144.62 279.39,-155.96 297.17,-169.33 310.67,-179.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="308.41,-182.34 318.46,-185.67 312.68,-176.8 308.41,-182.34"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg b/d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg
deleted file mode 100644
index 4b339c6be..000000000
--- a/d3/dae/dsu__path__compression_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg
+++ /dev/null
@@ -1,246 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="376pt" height="288pt"
- viewBox="0.00 0.00 375.75 288.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 284.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;implementations, 2nd test.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-150.25 0,-150.25 0,-131 37.75,-131 37.75,-150.25"/>
-<text text-anchor="middle" x="18.88" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
-<polygon fill="white" stroke="#666666" points="138.5,-224.25 87.25,-224.25 87.25,-205 138.5,-205 138.5,-224.25"/>
-<text text-anchor="middle" x="112.88" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.28,-150.6C47.23,-162.63 72.6,-183.03 90.68,-197.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.21,-200.08 98.19,-203.62 92.59,-194.62 88.21,-200.08"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="152,-112.25 73.75,-112.25 73.75,-93 152,-93 152,-112.25"/>
-<text text-anchor="middle" x="112.88" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge9_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge9_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.05,-133.12C49.21,-128.51 63.86,-122.46 77.17,-116.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.16,-120.34 86.07,-113.29 75.49,-113.87 78.16,-120.34"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="263.25,-280.25 188,-280.25 188,-261 263.25,-261 263.25,-280.25"/>
-<text text-anchor="middle" x="225.62" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.34,-224.72C148.26,-232.43 169.39,-243.28 188,-252.62 189.95,-253.6 191.95,-254.6 193.98,-255.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.19,-258.63 202.7,-259.92 195.29,-252.36 192.19,-258.63"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="261.75,-243.25 189.5,-243.25 189.5,-224 261.75,-224 261.75,-243.25"/>
-<text text-anchor="middle" x="225.62" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.73,-218.89C150.39,-220.89 164.67,-223.34 178.22,-225.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.41,-229.08 187.86,-227.32 178.6,-222.18 177.41,-229.08"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="253.5,-206.25 197.75,-206.25 197.75,-187 253.5,-187 253.5,-206.25"/>
-<text text-anchor="middle" x="225.62" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge7_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge7_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.73,-210.59C152.79,-208.3 170.67,-205.39 186.47,-202.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="186.72,-206.33 196.03,-201.27 185.6,-199.42 186.72,-206.33"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="367.75,-206.25 299.25,-206.25 299.25,-187 367.75,-187 367.75,-206.25"/>
-<text text-anchor="middle" x="333.5" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.14,-260.55C253.91,-258.14 258.83,-255.45 263.25,-252.62 281.25,-241.13 299.98,-225.74 313.42,-214"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.52,-216.81 320.67,-207.55 310.87,-211.58 315.52,-216.81"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M316.61,-206.54C308.91,-215.15 314.54,-224.25 333.5,-224.25 343.87,-224.25 350.25,-221.53 352.65,-217.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="356.11,-217.12 350.69,-208.02 349.25,-218.52 356.11,-217.12"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge6_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.56,-223.51C267.11,-219.48 280.6,-214.76 293.03,-210.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.89,-213.83 302.18,-207.22 291.58,-207.22 293.89,-213.83"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge8_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.89,-196.62C264.18,-196.62 276.19,-196.62 287.67,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.38,-200.13 297.38,-196.63 287.38,-193.13 287.38,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge10_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge10_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.85,-112.67C147.7,-120.39 168.95,-131.13 188,-139.62 223.49,-155.45 264.81,-171.52 294.15,-182.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="292.76,-185.76 303.35,-185.98 295.21,-179.2 292.76,-185.76"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="261,-130.25 190.25,-130.25 190.25,-111 261,-111 261,-130.25"/>
-<text text-anchor="middle" x="225.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge11_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge11_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.3,-108.87C160.81,-110.25 169.92,-111.73 178.7,-113.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.05,-116.6 188.48,-114.75 179.17,-109.69 178.05,-116.6"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.75,-93.25 198.5,-93.25 198.5,-74 252.75,-74 252.75,-93.25"/>
-<text text-anchor="middle" x="225.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge13_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge13_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.3,-96.03C163.52,-94.11 175.77,-92.01 186.94,-90.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.36,-93.57 196.62,-88.43 186.17,-86.67 187.36,-93.57"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.25,-56.25 200,-56.25 200,-37 251.25,-37 251.25,-56.25"/>
-<text text-anchor="middle" x="225.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node10 -->
-<g id="edge14_Node000007_Node000010" class="edge">
-<title>Node7&#45;&gt;Node10</title>
-<g id="a_edge14_Node000007_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.34,-92.53C148.26,-84.82 169.39,-73.97 188,-64.62 189.95,-63.65 191.95,-62.65 193.98,-61.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.29,-64.89 202.7,-57.33 192.19,-58.62 195.29,-64.89"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255,-19.25 196.25,-19.25 196.25,0 255,0 255,-19.25"/>
-<text text-anchor="middle" x="225.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node11 -->
-<g id="edge15_Node000007_Node000011" class="edge">
-<title>Node7&#45;&gt;Node11</title>
-<g id="a_edge15_Node000007_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.89,-92.58C134.62,-77.11 160.81,-47.2 188,-27.62 189.13,-26.81 190.31,-26.01 191.51,-25.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.85,-28.5 199.78,-20.49 189.36,-22.43 192.85,-28.5"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge12_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge12_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.46,-130.68C248.96,-134.9 256.53,-139.91 263.25,-144.62 279.39,-155.96 297.17,-169.33 310.67,-179.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="308.41,-182.34 318.46,-185.67 312.68,-176.8 308.41,-182.34"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 3681f27c6..000000000
--- a/d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,34 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,155,55,180"/>
-<area shape="rect" id="Node000002" href="$d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" title="Self&#45;test implementations, 1st test." alt="" coords="103,129,153,155"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,159,87,150,89,155,56,164"/>
-<area shape="rect" id="Node000013" href="$d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" title="Self&#45;implementations, 2nd test." alt="" coords="103,179,153,204"/>
-<area shape="poly" id="edge17_Node000001_Node000013" title=" " alt="" coords="56,171,89,179,87,184,54,176"/>
-<area shape="rect" id="Node000003" href="$dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" title="prints the minimum, maximum and size of the set to which i belongs to" alt="" coords="219,104,287,130"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,135,203,124,204,129,154,140"/>
-<area shape="rect" id="Node000008" href="$dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="201,203,305,228"/>
-<area shape="poly" id="edge10_Node000002_Node000008" title=" " alt="" coords="153,153,218,192,215,197,150,158"/>
-<area shape="rect" id="Node000004" href="$dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" title="A utility function that returns the max element of the set to which i belongs to." alt="" coords="353,55,454,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="287,103,347,83,348,88,288,108"/>
-<area shape="rect" id="Node000006" href="$dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" title="A utility function that returns the min element of the set to which i belongs to." alt="" coords="355,104,452,130"/>
-<area shape="poly" id="edge6_Node000003_Node000006" title=" " alt="" coords="288,114,340,114,340,120,288,120"/>
-<area shape="rect" id="Node000007" href="$dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" title="A utility function that returns the size of the set to which i belongs to." alt="" coords="366,5,441,31"/>
-<area shape="poly" id="edge8_Node000003_Node000007" title=" " alt="" coords="268,102,305,72,352,40,358,36,361,41,355,44,309,76,272,106"/>
-<area shape="rect" id="Node000005" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="502,104,593,130"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="444,78,494,96,492,101,443,83"/>
-<area shape="poly" id="edge5_Node000005_Node000005" title=" " alt="" coords="522,105,518,95,521,86,531,80,547,77,565,80,574,87,571,91,563,85,547,83,533,85,525,89,523,95,527,102"/>
-<area shape="poly" id="edge7_Node000006_Node000005" title=" " alt="" coords="452,114,486,114,486,120,452,120"/>
-<area shape="poly" id="edge9_Node000007_Node000005" title=" " alt="" coords="436,29,455,40,522,92,519,96,452,44,434,34"/>
-<area shape="poly" id="edge11_Node000008_Node000005" title=" " alt="" coords="268,227,304,260,328,276,354,288,382,297,405,301,427,299,452,288,470,274,486,258,511,219,528,179,538,144,543,145,533,181,516,222,490,261,474,278,455,292,428,304,405,307,381,302,352,293,326,280,301,264,265,231"/>
-<area shape="rect" id="Node000009" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="356,353,451,379"/>
-<area shape="poly" id="edge12_Node000008_Node000009" title=" " alt="" coords="266,227,302,276,355,332,368,342,365,346,352,336,298,279,261,230"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="367,203,440,228"/>
-<area shape="poly" id="edge14_Node000008_Node000010" title=" " alt="" coords="306,213,352,213,352,218,306,218"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="369,252,438,278"/>
-<area shape="poly" id="edge15_Node000008_Node000011" title=" " alt="" coords="296,226,356,246,354,252,294,232"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="364,153,443,179"/>
-<area shape="poly" id="edge16_Node000008_Node000012" title=" " alt="" coords="294,199,349,181,350,186,296,205"/>
-<area shape="poly" id="edge13_Node000009_Node000005" title=" " alt="" coords="430,351,452,332,484,285,508,233,526,184,537,144,542,145,531,186,513,235,488,288,456,336,433,355"/>
-<area shape="poly" id="edge18_Node000013_Node000003" title=" " alt="" coords="150,176,215,136,218,141,152,180"/>
-<area shape="poly" id="edge19_Node000013_Node000008" title=" " alt="" coords="154,194,187,200,186,205,153,199"/>
-</map>
diff --git a/d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index baab57f8a..000000000
--- a/d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c77bb4e5ca7dce7480d4b794ee20bfef
\ No newline at end of file
diff --git a/d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index f0b7b5201..000000000
--- a/d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,326 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="449pt" height="288pt"
- viewBox="0.00 0.00 448.75 288.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 284.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-168.25 0,-168.25 0,-149 37,-149 37,-168.25"/>
-<text text-anchor="middle" x="18.5" y="-154.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title="Self&#45;test implementations, 1st test.">
-<polygon fill="white" stroke="#666666" points="110.75,-187.25 73,-187.25 73,-168 110.75,-168 110.75,-187.25"/>
-<text text-anchor="middle" x="91.88" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-163.32C44.64,-165.32 53.57,-167.69 61.98,-169.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.91,-173.27 71.48,-172.46 62.71,-166.51 60.91,-173.27"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title="Self&#45;implementations, 2nd test.">
-<polygon fill="white" stroke="#666666" points="110.75,-150.25 73,-150.25 73,-131 110.75,-131 110.75,-150.25"/>
-<text text-anchor="middle" x="91.88" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node13 -->
-<g id="edge17_Node000001_Node000013" class="edge">
-<title>Node1&#45;&gt;Node13</title>
-<g id="a_edge17_Node000001_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-154.18C44.64,-152.29 53.57,-150.03 61.98,-147.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.63,-151.36 71.47,-145.52 60.92,-144.57 62.63,-151.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
-<polygon fill="white" stroke="#666666" points="211.5,-206.25 160.25,-206.25 160.25,-187 211.5,-187 211.5,-206.25"/>
-<text text-anchor="middle" x="185.88" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.05,-181.38C121.82,-183.6 135.86,-186.5 148.8,-189.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.79,-192.54 158.29,-191.13 149.2,-185.68 147.79,-192.54"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="225,-132.25 146.75,-132.25 146.75,-113 225,-113 225,-132.25"/>
-<text text-anchor="middle" x="185.88" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge10_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge10_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.75,-167.54C123.37,-159.4 142.77,-147.8 158.44,-138.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.02,-141.56 166.81,-133.43 156.43,-135.55 160.02,-141.56"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="336.25,-243.25 261,-243.25 261,-224 336.25,-224 336.25,-243.25"/>
-<text text-anchor="middle" x="298.62" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M211.73,-204.93C224.97,-209.35 241.6,-214.91 256.68,-219.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="255.3,-223.17 265.89,-223.02 257.52,-216.54 255.3,-223.17"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="334.75,-206.25 262.5,-206.25 262.5,-187 334.75,-187 334.75,-206.25"/>
-<text text-anchor="middle" x="298.62" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M211.73,-196.62C223.39,-196.62 237.67,-196.62 251.22,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="250.84,-200.13 260.84,-196.63 250.84,-193.13 250.84,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="326.5,-280.25 270.75,-280.25 270.75,-261 326.5,-261 326.5,-280.25"/>
-<text text-anchor="middle" x="298.62" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge8_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge8_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M198.45,-206.47C212.63,-218.27 237.65,-238.25 261,-252.62 262.43,-253.51 263.92,-254.38 265.43,-255.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="263.76,-258.32 274.23,-259.92 267.04,-252.14 263.76,-258.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="440.75,-206.25 372.25,-206.25 372.25,-187 440.75,-187 440.75,-206.25"/>
-<text text-anchor="middle" x="406.5" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M328.56,-223.51C340.11,-219.48 353.6,-214.76 366.03,-210.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="366.89,-213.83 375.18,-207.22 364.58,-207.22 366.89,-213.83"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M389.61,-206.54C381.91,-215.15 387.54,-224.25 406.5,-224.25 416.87,-224.25 423.25,-221.53 425.65,-217.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.11,-217.12 423.69,-208.02 422.25,-218.52 429.11,-217.12"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge7_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge7_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M335.17,-196.62C343.35,-196.62 352.15,-196.62 360.67,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="360.5,-200.13 370.5,-196.63 360.5,-193.13 360.5,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge9_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge9_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M322.14,-260.55C326.91,-258.14 331.83,-255.45 336.25,-252.62 354.25,-241.13 372.98,-225.74 386.42,-214"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="388.52,-216.81 393.67,-207.55 383.87,-211.58 388.52,-216.81"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge11_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge11_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M195.74,-112.74C208.58,-99.26 233.78,-75.75 261,-66.62 292.71,-55.99 307.58,-49.41 336.25,-66.62 375.95,-90.46 394.13,-145.6 401.38,-175.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="397.89,-176.29 403.45,-185.31 404.73,-174.79 397.89,-176.29"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="334,-19.25 263.25,-19.25 263.25,0 334,0 334,-19.25"/>
-<text text-anchor="middle" x="298.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge12_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge12_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.62,-112.72C205.75,-95.37 232.63,-58.92 261,-33.62 263.98,-30.96 267.29,-28.38 270.65,-25.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.48,-28.95 278.84,-20.47 268.58,-23.14 272.48,-28.95"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.75,-132.25 271.5,-132.25 271.5,-113 325.75,-113 325.75,-132.25"/>
-<text text-anchor="middle" x="298.62" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge14_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge14_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M225.3,-122.62C236.52,-122.62 248.77,-122.62 259.94,-122.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="259.6,-126.13 269.6,-122.63 259.6,-119.13 259.6,-126.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.25,-95.25 273,-95.25 273,-76 324.25,-76 324.25,-95.25"/>
-<text text-anchor="middle" x="298.62" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node11 -->
-<g id="edge15_Node000008_Node000011" class="edge">
-<title>Node8&#45;&gt;Node11</title>
-<g id="a_edge15_Node000008_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M217.14,-112.51C231.02,-107.88 247.57,-102.35 262.05,-97.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.82,-100.94 271.2,-94.45 260.6,-94.3 262.82,-100.94"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="328,-169.25 269.25,-169.25 269.25,-150 328,-150 328,-169.25"/>
-<text text-anchor="middle" x="298.62" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node12 -->
-<g id="edge16_Node000008_Node000012" class="edge">
-<title>Node8&#45;&gt;Node12</title>
-<g id="a_edge16_Node000008_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M217.14,-132.74C229.75,-136.95 244.56,-141.9 258.02,-146.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="256.89,-149.71 267.49,-149.56 259.11,-143.07 256.89,-149.71"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge13_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge13_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M319.56,-19.71C325.51,-23.45 331.67,-28.14 336.25,-33.62 372.62,-77.14 392.53,-142.56 400.82,-175.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="397.37,-176.36 403.09,-185.29 404.18,-174.75 397.37,-176.36"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node3 -->
-<g id="edge18_Node000013_Node000003" class="edge">
-<title>Node13&#45;&gt;Node3</title>
-<g id="a_edge18_Node000013_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.32,-150.64C122.97,-158.95 142.65,-170.92 158.5,-180.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.6,-183.51 166.97,-185.72 160.24,-177.54 156.6,-183.51"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node8 -->
-<g id="edge19_Node000013_Node000008" class="edge">
-<title>Node13&#45;&gt;Node8</title>
-<g id="a_edge19_Node000013_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.05,-137.07C118.19,-135.67 126.77,-133.99 135.51,-132.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.95,-135.76 145.09,-130.41 134.6,-128.89 135.95,-135.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 29d2a131a..000000000
--- a/d3/dae/dsu__path__compression_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,300 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="449pt" height="288pt"
- viewBox="0.00 0.00 448.75 288.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 284.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-168.25 0,-168.25 0,-149 37,-149 37,-168.25"/>
-<text text-anchor="middle" x="18.5" y="-154.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title="Self&#45;test implementations, 1st test.">
-<polygon fill="white" stroke="#666666" points="110.75,-187.25 73,-187.25 73,-168 110.75,-168 110.75,-187.25"/>
-<text text-anchor="middle" x="91.88" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-163.32C44.64,-165.32 53.57,-167.69 61.98,-169.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.91,-173.27 71.48,-172.46 62.71,-166.51 60.91,-173.27"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title="Self&#45;implementations, 2nd test.">
-<polygon fill="white" stroke="#666666" points="110.75,-150.25 73,-150.25 73,-131 110.75,-131 110.75,-150.25"/>
-<text text-anchor="middle" x="91.88" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node13 -->
-<g id="edge17_Node000001_Node000013" class="edge">
-<title>Node1&#45;&gt;Node13</title>
-<g id="a_edge17_Node000001_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-154.18C44.64,-152.29 53.57,-150.03 61.98,-147.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.63,-151.36 71.47,-145.52 60.92,-144.57 62.63,-151.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
-<polygon fill="white" stroke="#666666" points="211.5,-206.25 160.25,-206.25 160.25,-187 211.5,-187 211.5,-206.25"/>
-<text text-anchor="middle" x="185.88" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.05,-181.38C121.82,-183.6 135.86,-186.5 148.8,-189.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.79,-192.54 158.29,-191.13 149.2,-185.68 147.79,-192.54"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="225,-132.25 146.75,-132.25 146.75,-113 225,-113 225,-132.25"/>
-<text text-anchor="middle" x="185.88" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge10_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge10_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.75,-167.54C123.37,-159.4 142.77,-147.8 158.44,-138.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.02,-141.56 166.81,-133.43 156.43,-135.55 160.02,-141.56"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="336.25,-243.25 261,-243.25 261,-224 336.25,-224 336.25,-243.25"/>
-<text text-anchor="middle" x="298.62" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M211.73,-204.93C224.97,-209.35 241.6,-214.91 256.68,-219.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="255.3,-223.17 265.89,-223.02 257.52,-216.54 255.3,-223.17"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="334.75,-206.25 262.5,-206.25 262.5,-187 334.75,-187 334.75,-206.25"/>
-<text text-anchor="middle" x="298.62" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M211.73,-196.62C223.39,-196.62 237.67,-196.62 251.22,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="250.84,-200.13 260.84,-196.63 250.84,-193.13 250.84,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="326.5,-280.25 270.75,-280.25 270.75,-261 326.5,-261 326.5,-280.25"/>
-<text text-anchor="middle" x="298.62" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge8_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge8_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M198.45,-206.47C212.63,-218.27 237.65,-238.25 261,-252.62 262.43,-253.51 263.92,-254.38 265.43,-255.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="263.76,-258.32 274.23,-259.92 267.04,-252.14 263.76,-258.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="440.75,-206.25 372.25,-206.25 372.25,-187 440.75,-187 440.75,-206.25"/>
-<text text-anchor="middle" x="406.5" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M328.56,-223.51C340.11,-219.48 353.6,-214.76 366.03,-210.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="366.89,-213.83 375.18,-207.22 364.58,-207.22 366.89,-213.83"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M389.61,-206.54C381.91,-215.15 387.54,-224.25 406.5,-224.25 416.87,-224.25 423.25,-221.53 425.65,-217.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.11,-217.12 423.69,-208.02 422.25,-218.52 429.11,-217.12"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge7_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge7_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M335.17,-196.62C343.35,-196.62 352.15,-196.62 360.67,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="360.5,-200.13 370.5,-196.63 360.5,-193.13 360.5,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge9_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge9_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M322.14,-260.55C326.91,-258.14 331.83,-255.45 336.25,-252.62 354.25,-241.13 372.98,-225.74 386.42,-214"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="388.52,-216.81 393.67,-207.55 383.87,-211.58 388.52,-216.81"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge11_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge11_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M195.74,-112.74C208.58,-99.26 233.78,-75.75 261,-66.62 292.71,-55.99 307.58,-49.41 336.25,-66.62 375.95,-90.46 394.13,-145.6 401.38,-175.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="397.89,-176.29 403.45,-185.31 404.73,-174.79 397.89,-176.29"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="334,-19.25 263.25,-19.25 263.25,0 334,0 334,-19.25"/>
-<text text-anchor="middle" x="298.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge12_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge12_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.62,-112.72C205.75,-95.37 232.63,-58.92 261,-33.62 263.98,-30.96 267.29,-28.38 270.65,-25.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.48,-28.95 278.84,-20.47 268.58,-23.14 272.48,-28.95"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.75,-132.25 271.5,-132.25 271.5,-113 325.75,-113 325.75,-132.25"/>
-<text text-anchor="middle" x="298.62" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge14_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge14_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M225.3,-122.62C236.52,-122.62 248.77,-122.62 259.94,-122.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="259.6,-126.13 269.6,-122.63 259.6,-119.13 259.6,-126.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.25,-95.25 273,-95.25 273,-76 324.25,-76 324.25,-95.25"/>
-<text text-anchor="middle" x="298.62" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node11 -->
-<g id="edge15_Node000008_Node000011" class="edge">
-<title>Node8&#45;&gt;Node11</title>
-<g id="a_edge15_Node000008_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M217.14,-112.51C231.02,-107.88 247.57,-102.35 262.05,-97.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.82,-100.94 271.2,-94.45 260.6,-94.3 262.82,-100.94"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="328,-169.25 269.25,-169.25 269.25,-150 328,-150 328,-169.25"/>
-<text text-anchor="middle" x="298.62" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node12 -->
-<g id="edge16_Node000008_Node000012" class="edge">
-<title>Node8&#45;&gt;Node12</title>
-<g id="a_edge16_Node000008_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M217.14,-132.74C229.75,-136.95 244.56,-141.9 258.02,-146.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="256.89,-149.71 267.49,-149.56 259.11,-143.07 256.89,-149.71"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge13_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge13_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M319.56,-19.71C325.51,-23.45 331.67,-28.14 336.25,-33.62 372.62,-77.14 392.53,-142.56 400.82,-175.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="397.37,-176.36 403.09,-185.29 404.18,-174.75 397.37,-176.36"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node3 -->
-<g id="edge18_Node000013_Node000003" class="edge">
-<title>Node13&#45;&gt;Node3</title>
-<g id="a_edge18_Node000013_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.32,-150.64C122.97,-158.95 142.65,-170.92 158.5,-180.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.6,-183.51 166.97,-185.72 160.24,-177.54 156.6,-183.51"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node8 -->
-<g id="edge19_Node000013_Node000008" class="edge">
-<title>Node13&#45;&gt;Node8</title>
-<g id="a_edge19_Node000013_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.05,-137.07C118.19,-135.67 126.77,-133.99 135.51,-132.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.95,-135.76 145.09,-130.41 134.6,-128.89 135.95,-135.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map b/d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map
deleted file mode 100644
index 283945258..000000000
--- a/d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map
+++ /dev/null
@@ -1,28 +0,0 @@
-<map id="test1" name="test1">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations, 1st test." alt="" coords="5,179,56,204"/>
-<area shape="rect" id="Node000002" href="$dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" title="prints the minimum, maximum and size of the set to which i belongs to" alt="" coords="122,80,190,106"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="47,176,125,113,128,118,50,180"/>
-<area shape="rect" id="Node000007" href="$dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="104,229,208,255"/>
-<area shape="poly" id="edge9_Node000001_Node000007" title=" " alt="" coords="57,199,109,221,107,226,55,204"/>
-<area shape="rect" id="Node000003" href="$dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" title="A utility function that returns the max element of the set to which i belongs to." alt="" coords="256,5,356,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="182,77,255,40,263,36,265,41,257,45,184,82"/>
-<area shape="rect" id="Node000005" href="$dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" title="A utility function that returns the min element of the set to which i belongs to." alt="" coords="258,55,354,80"/>
-<area shape="poly" id="edge5_Node000002_Node000005" title=" " alt="" coords="190,85,243,75,243,81,191,90"/>
-<area shape="rect" id="Node000006" href="$dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" title="A utility function that returns the size of the set to which i belongs to." alt="" coords="269,104,343,130"/>
-<area shape="poly" id="edge7_Node000002_Node000006" title=" " alt="" coords="191,96,254,106,254,111,190,101"/>
-<area shape="rect" id="Node000004" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="404,104,496,130"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="339,29,358,40,425,92,422,96,355,44,336,34"/>
-<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="425,105,420,95,423,86,433,80,450,77,468,80,477,87,474,91,466,85,450,83,435,85,428,89,426,95,430,102"/>
-<area shape="poly" id="edge6_Node000005_Node000004" title=" " alt="" coords="347,78,397,96,395,101,345,83"/>
-<area shape="poly" id="edge8_Node000006_Node000004" title=" " alt="" coords="344,114,389,114,389,120,344,120"/>
-<area shape="poly" id="edge10_Node000007_Node000004" title=" " alt="" coords="181,226,255,190,397,133,399,138,257,195,184,231"/>
-<area shape="rect" id="Node000008" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="259,205,353,231"/>
-<area shape="poly" id="edge11_Node000007_Node000008" title=" " alt="" coords="208,231,243,225,244,231,209,236"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="270,255,342,280"/>
-<area shape="poly" id="edge13_Node000007_Node000009" title=" " alt="" coords="209,248,255,256,254,262,208,254"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="272,304,340,330"/>
-<area shape="poly" id="edge14_Node000007_Node000010" title=" " alt="" coords="184,253,257,290,265,294,263,299,255,295,182,258"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="267,353,345,379"/>
-<area shape="poly" id="edge15_Node000007_Node000011" title=" " alt="" coords="170,254,207,295,258,340,262,343,259,348,254,344,203,299,166,257"/>
-<area shape="poly" id="edge12_Node000008_Node000004" title=" " alt="" coords="327,203,355,184,418,137,421,142,358,188,330,207"/>
-</map>
diff --git a/d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5 b/d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5
deleted file mode 100644
index 752b569f9..000000000
--- a/d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c234d8a5258bce82c70451816654c35f
\ No newline at end of file
diff --git a/d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg b/d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg
deleted file mode 100644
index d965bf31e..000000000
--- a/d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg
+++ /dev/null
@@ -1,272 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="376pt" height="288pt"
- viewBox="0.00 0.00 375.75 288.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 284.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations, 1st test.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-150.25 0,-150.25 0,-131 37.75,-131 37.75,-150.25"/>
-<text text-anchor="middle" x="18.88" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
-<polygon fill="white" stroke="#666666" points="138.5,-224.25 87.25,-224.25 87.25,-205 138.5,-205 138.5,-224.25"/>
-<text text-anchor="middle" x="112.88" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.28,-150.6C47.23,-162.63 72.6,-183.03 90.68,-197.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.21,-200.08 98.19,-203.62 92.59,-194.62 88.21,-200.08"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="152,-112.25 73.75,-112.25 73.75,-93 152,-93 152,-112.25"/>
-<text text-anchor="middle" x="112.88" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge9_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge9_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.05,-133.12C49.21,-128.51 63.86,-122.46 77.17,-116.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.16,-120.34 86.07,-113.29 75.49,-113.87 78.16,-120.34"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="263.25,-280.25 188,-280.25 188,-261 263.25,-261 263.25,-280.25"/>
-<text text-anchor="middle" x="225.62" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.34,-224.72C148.26,-232.43 169.39,-243.28 188,-252.62 189.95,-253.6 191.95,-254.6 193.98,-255.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.19,-258.63 202.7,-259.92 195.29,-252.36 192.19,-258.63"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="261.75,-243.25 189.5,-243.25 189.5,-224 261.75,-224 261.75,-243.25"/>
-<text text-anchor="middle" x="225.62" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.73,-218.89C150.39,-220.89 164.67,-223.34 178.22,-225.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.41,-229.08 187.86,-227.32 178.6,-222.18 177.41,-229.08"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="253.5,-206.25 197.75,-206.25 197.75,-187 253.5,-187 253.5,-206.25"/>
-<text text-anchor="middle" x="225.62" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge7_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge7_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.73,-210.59C152.79,-208.3 170.67,-205.39 186.47,-202.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="186.72,-206.33 196.03,-201.27 185.6,-199.42 186.72,-206.33"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="367.75,-206.25 299.25,-206.25 299.25,-187 367.75,-187 367.75,-206.25"/>
-<text text-anchor="middle" x="333.5" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.14,-260.55C253.91,-258.14 258.83,-255.45 263.25,-252.62 281.25,-241.13 299.98,-225.74 313.42,-214"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.52,-216.81 320.67,-207.55 310.87,-211.58 315.52,-216.81"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M316.61,-206.54C308.91,-215.15 314.54,-224.25 333.5,-224.25 343.87,-224.25 350.25,-221.53 352.65,-217.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="356.11,-217.12 350.69,-208.02 349.25,-218.52 356.11,-217.12"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge6_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.56,-223.51C267.11,-219.48 280.6,-214.76 293.03,-210.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.89,-213.83 302.18,-207.22 291.58,-207.22 293.89,-213.83"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge8_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.89,-196.62C264.18,-196.62 276.19,-196.62 287.67,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.38,-200.13 297.38,-196.63 287.38,-193.13 287.38,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge10_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge10_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.85,-112.67C147.7,-120.39 168.95,-131.13 188,-139.62 223.49,-155.45 264.81,-171.52 294.15,-182.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="292.76,-185.76 303.35,-185.98 295.21,-179.2 292.76,-185.76"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="261,-130.25 190.25,-130.25 190.25,-111 261,-111 261,-130.25"/>
-<text text-anchor="middle" x="225.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge11_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge11_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.3,-108.87C160.81,-110.25 169.92,-111.73 178.7,-113.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.05,-116.6 188.48,-114.75 179.17,-109.69 178.05,-116.6"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.75,-93.25 198.5,-93.25 198.5,-74 252.75,-74 252.75,-93.25"/>
-<text text-anchor="middle" x="225.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge13_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge13_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.3,-96.03C163.52,-94.11 175.77,-92.01 186.94,-90.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.36,-93.57 196.62,-88.43 186.17,-86.67 187.36,-93.57"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.25,-56.25 200,-56.25 200,-37 251.25,-37 251.25,-56.25"/>
-<text text-anchor="middle" x="225.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node10 -->
-<g id="edge14_Node000007_Node000010" class="edge">
-<title>Node7&#45;&gt;Node10</title>
-<g id="a_edge14_Node000007_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.34,-92.53C148.26,-84.82 169.39,-73.97 188,-64.62 189.95,-63.65 191.95,-62.65 193.98,-61.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.29,-64.89 202.7,-57.33 192.19,-58.62 195.29,-64.89"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255,-19.25 196.25,-19.25 196.25,0 255,0 255,-19.25"/>
-<text text-anchor="middle" x="225.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node11 -->
-<g id="edge15_Node000007_Node000011" class="edge">
-<title>Node7&#45;&gt;Node11</title>
-<g id="a_edge15_Node000007_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.89,-92.58C134.62,-77.11 160.81,-47.2 188,-27.62 189.13,-26.81 190.31,-26.01 191.51,-25.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.85,-28.5 199.78,-20.49 189.36,-22.43 192.85,-28.5"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge12_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge12_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.46,-130.68C248.96,-134.9 256.53,-139.91 263.25,-144.62 279.39,-155.96 297.17,-169.33 310.67,-179.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="308.41,-182.34 318.46,-185.67 312.68,-176.8 308.41,-182.34"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg b/d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg
deleted file mode 100644
index 25231443c..000000000
--- a/d3/dae/dsu__path__compression_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg
+++ /dev/null
@@ -1,246 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="376pt" height="288pt"
- viewBox="0.00 0.00 375.75 288.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 284.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations, 1st test.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-150.25 0,-150.25 0,-131 37.75,-131 37.75,-150.25"/>
-<text text-anchor="middle" x="18.88" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
-<polygon fill="white" stroke="#666666" points="138.5,-224.25 87.25,-224.25 87.25,-205 138.5,-205 138.5,-224.25"/>
-<text text-anchor="middle" x="112.88" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.28,-150.6C47.23,-162.63 72.6,-183.03 90.68,-197.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.21,-200.08 98.19,-203.62 92.59,-194.62 88.21,-200.08"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="152,-112.25 73.75,-112.25 73.75,-93 152,-93 152,-112.25"/>
-<text text-anchor="middle" x="112.88" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge9_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge9_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.05,-133.12C49.21,-128.51 63.86,-122.46 77.17,-116.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.16,-120.34 86.07,-113.29 75.49,-113.87 78.16,-120.34"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="263.25,-280.25 188,-280.25 188,-261 263.25,-261 263.25,-280.25"/>
-<text text-anchor="middle" x="225.62" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.34,-224.72C148.26,-232.43 169.39,-243.28 188,-252.62 189.95,-253.6 191.95,-254.6 193.98,-255.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.19,-258.63 202.7,-259.92 195.29,-252.36 192.19,-258.63"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="261.75,-243.25 189.5,-243.25 189.5,-224 261.75,-224 261.75,-243.25"/>
-<text text-anchor="middle" x="225.62" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.73,-218.89C150.39,-220.89 164.67,-223.34 178.22,-225.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.41,-229.08 187.86,-227.32 178.6,-222.18 177.41,-229.08"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="253.5,-206.25 197.75,-206.25 197.75,-187 253.5,-187 253.5,-206.25"/>
-<text text-anchor="middle" x="225.62" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge7_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge7_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.73,-210.59C152.79,-208.3 170.67,-205.39 186.47,-202.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="186.72,-206.33 196.03,-201.27 185.6,-199.42 186.72,-206.33"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="367.75,-206.25 299.25,-206.25 299.25,-187 367.75,-187 367.75,-206.25"/>
-<text text-anchor="middle" x="333.5" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.14,-260.55C253.91,-258.14 258.83,-255.45 263.25,-252.62 281.25,-241.13 299.98,-225.74 313.42,-214"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.52,-216.81 320.67,-207.55 310.87,-211.58 315.52,-216.81"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M316.61,-206.54C308.91,-215.15 314.54,-224.25 333.5,-224.25 343.87,-224.25 350.25,-221.53 352.65,-217.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="356.11,-217.12 350.69,-208.02 349.25,-218.52 356.11,-217.12"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge6_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.56,-223.51C267.11,-219.48 280.6,-214.76 293.03,-210.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.89,-213.83 302.18,-207.22 291.58,-207.22 293.89,-213.83"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge8_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.89,-196.62C264.18,-196.62 276.19,-196.62 287.67,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.38,-200.13 297.38,-196.63 287.38,-193.13 287.38,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge10_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge10_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.85,-112.67C147.7,-120.39 168.95,-131.13 188,-139.62 223.49,-155.45 264.81,-171.52 294.15,-182.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="292.76,-185.76 303.35,-185.98 295.21,-179.2 292.76,-185.76"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="261,-130.25 190.25,-130.25 190.25,-111 261,-111 261,-130.25"/>
-<text text-anchor="middle" x="225.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge11_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge11_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.3,-108.87C160.81,-110.25 169.92,-111.73 178.7,-113.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.05,-116.6 188.48,-114.75 179.17,-109.69 178.05,-116.6"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.75,-93.25 198.5,-93.25 198.5,-74 252.75,-74 252.75,-93.25"/>
-<text text-anchor="middle" x="225.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge13_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge13_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.3,-96.03C163.52,-94.11 175.77,-92.01 186.94,-90.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.36,-93.57 196.62,-88.43 186.17,-86.67 187.36,-93.57"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.25,-56.25 200,-56.25 200,-37 251.25,-37 251.25,-56.25"/>
-<text text-anchor="middle" x="225.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node10 -->
-<g id="edge14_Node000007_Node000010" class="edge">
-<title>Node7&#45;&gt;Node10</title>
-<g id="a_edge14_Node000007_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.34,-92.53C148.26,-84.82 169.39,-73.97 188,-64.62 189.95,-63.65 191.95,-62.65 193.98,-61.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.29,-64.89 202.7,-57.33 192.19,-58.62 195.29,-64.89"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255,-19.25 196.25,-19.25 196.25,0 255,0 255,-19.25"/>
-<text text-anchor="middle" x="225.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node11 -->
-<g id="edge15_Node000007_Node000011" class="edge">
-<title>Node7&#45;&gt;Node11</title>
-<g id="a_edge15_Node000007_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.89,-92.58C134.62,-77.11 160.81,-47.2 188,-27.62 189.13,-26.81 190.31,-26.01 191.51,-25.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.85,-28.5 199.78,-20.49 189.36,-22.43 192.85,-28.5"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge12_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge12_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.46,-130.68C248.96,-134.9 256.53,-139.91 263.25,-144.62 279.39,-155.96 297.17,-169.33 310.67,-179.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="308.41,-182.34 318.46,-185.67 312.68,-176.8 308.41,-182.34"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/dae/dsu__path__compression_8cpp_source.html b/d3/dae/dsu__path__compression_8cpp_source.html
new file mode 100644
index 000000000..ebe6ee515
--- /dev/null
+++ b/d3/dae/dsu__path__compression_8cpp_source.html
@@ -0,0 +1,292 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/dsu_path_compression.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/dae/dsu__path__compression_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">dsu_path_compression.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/dae/dsu__path__compression_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">using </span>std::cout;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">using </span>std::endl;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">using </span>std::vector;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="foldopen" id="foldopen00034" data-start="{" data-end="};">
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html">   34</a></span><span class="keyword">class </span><a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">   36</a></span>    vector&lt;uint64_t&gt; <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>;           </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">   37</a></span>    vector&lt;uint64_t&gt; <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>;       </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">   38</a></span>    vector&lt;uint64_t&gt; <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>;     </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">   39</a></span>    vector&lt;uint64_t&gt; <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>;  </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">   40</a></span>    vector&lt;uint64_t&gt; <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>;  </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00046" data-start="{" data-end="}">
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72">   46</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72">dsu</a>(uint64_t n) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>.assign(n, 0);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>            <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] = i;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        }</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>.assign(n, 0);</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>.assign(n, 0);</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>.assign(n, 0);</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[i] = 0;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>            <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[i] = i;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[i] = i;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        }</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>.assign(n, 0);</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[i] = 1;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
+</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="foldopen" id="foldopen00074" data-start="{" data-end="}">
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">   74</a></span>    uint64_t <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(uint64_t i) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] == i) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            <span class="keywordflow">return</span> i;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        }</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        <span class="keywordflow">return</span> (<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] = <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i]));</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00088" data-start="{" data-end="}">
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">   88</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">UnionSet</a>(uint64_t i, uint64_t j) {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">isSame</a>(i, j)) {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        }</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="comment">// we find the representative of the i and j</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        uint64_t x = <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        uint64_t y = <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(j);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] &gt; <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>            std::swap(x, y);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        }</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[x] = y;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] == <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>            <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]++;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        }</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[y] += <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[x];</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[y] = std::max(<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[x], <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[y]);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[y] = std::min(<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[x], <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[y]);</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00124" data-start="{" data-end="}">
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">  124</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">isSame</a>(uint64_t i, uint64_t j) {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i) == <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(j)) {</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        }</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00136" data-start="{" data-end="}">
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a">  136</a></span>    vector&lt;uint64_t&gt; <a class="code hl_function" href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a">get</a>(uint64_t i) {</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        vector&lt;uint64_t&gt; ans;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>        ans.push_back(<a class="code hl_function" href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415">get_min</a>(i));</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>        ans.push_back(<a class="code hl_function" href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde">get_max</a>(i));</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        ans.push_back(<a class="code hl_function" href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">size</a>(i));</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        <span class="keywordflow">return</span> ans;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    }</div>
+</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">  149</a></span>    uint64_t <a class="code hl_function" href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">size</a>(uint64_t i) { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[<a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i)]; }</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde">  156</a></span>    uint64_t <a class="code hl_function" href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde">get_max</a>(uint64_t i) { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[<a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i)]; }</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415">  163</a></span>    uint64_t <a class="code hl_function" href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415">get_min</a>(uint64_t i) { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[<a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i)]; }</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>};</div>
+</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span> </div>
+<div class="foldopen" id="foldopen00170" data-start="{" data-end="}">
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"><a class="line" href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">  170</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>() {</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    <span class="comment">// the minimum, maximum, and size of the set</span></div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    uint64_t n = 10;  </div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1);     </div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    <span class="comment">// set 1</span></div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">UnionSet</a>(1, 2);  <span class="comment">// performs union operation on 1 and 2</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">UnionSet</a>(1, 4);  <span class="comment">// performs union operation on 1 and 4</span></div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    vector&lt;uint64_t&gt; ans = {1, 4, 3};</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; ans.size(); i++) {</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        assert(d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a">get</a>(4).at(i) == ans[i]);  <span class="comment">// makes sure algorithm works fine</span></div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    }</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    cout &lt;&lt; <span class="stringliteral">&quot;1st test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00187" data-start="{" data-end="}">
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"><a class="line" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">  187</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>() {</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    <span class="comment">// the minimum, maximum, and size of the set</span></div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    uint64_t n = 10;  </div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1);     </div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    <span class="comment">// set 1</span></div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">UnionSet</a>(3, 5);</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">UnionSet</a>(5, 6);</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">UnionSet</a>(5, 7);</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    vector&lt;uint64_t&gt; ans = {3, 7, 4};</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; ans.size(); i++) {</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>        assert(d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a">get</a>(3).at(i) == ans[i]);  <span class="comment">// makes sure algorithm works fine</span></div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    }</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    cout &lt;&lt; <span class="stringliteral">&quot;2nd test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>}</div>
+</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span> </div>
+<div class="foldopen" id="foldopen00206" data-start="{" data-end="}">
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"><a class="line" href="../../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  206</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    uint64_t n = 10;  </div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1);     </div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span> </div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>();  <span class="comment">// run 1st test case</span></div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>();  <span class="comment">// run 2nd test case</span></div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span> </div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>}</div>
+</div>
+<div class="ttc" id="aclassdsu_html"><div class="ttname"><a href="../../dd/d1f/classdsu.html">dsu</a></div><div class="ttdoc">Disjoint sets union data structure, class based representation.</div><div class="ttdef"><b>Definition</b> <a href="#l00034">dsu_path_compression.cpp:34</a></div></div>
+<div class="ttc" id="aclassdsu_html_a0ce2672c570f4235eafddb0c9a58115a"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a">dsu::get</a></div><div class="ttdeci">vector&lt; uint64_t &gt; get(uint64_t i)</div><div class="ttdoc">prints the minimum, maximum and size of the set to which i belongs to</div><div class="ttdef"><b>Definition</b> <a href="#l00136">dsu_path_compression.cpp:136</a></div></div>
+<div class="ttc" id="aclassdsu_html_a126e3002a464e53cd54b07ba56482a72"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72">dsu::dsu</a></div><div class="ttdeci">dsu(uint64_t n)</div><div class="ttdoc">contructor for initialising all data members.</div><div class="ttdef"><b>Definition</b> <a href="#l00046">dsu_path_compression.cpp:46</a></div></div>
+<div class="ttc" id="aclassdsu_html_a16851f78fe390fc1430905c83d6a2f1c"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">dsu::findSet</a></div><div class="ttdeci">uint64_t findSet(uint64_t i)</div><div class="ttdoc">Method to find the representative of the set to which i belongs to, T(n) = O(1)</div><div class="ttdef"><b>Definition</b> <a href="#l00074">dsu_path_compression.cpp:74</a></div></div>
+<div class="ttc" id="aclassdsu_html_a1c24228b0f2f49220133fb8c3566a55c"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">dsu::size</a></div><div class="ttdeci">uint64_t size(uint64_t i)</div><div class="ttdoc">A utility function that returns the size of the set to which i belongs to.</div><div class="ttdef"><b>Definition</b> <a href="#l00149">dsu_path_compression.cpp:149</a></div></div>
+<div class="ttc" id="aclassdsu_html_a1d77aad7fc39fe7140d834cd347e5c63"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63">dsu::minElement</a></div><div class="ttdeci">vector&lt; uint64_t &gt; minElement</div><div class="ttdoc">minimum of each set to which i belongs to</div><div class="ttdef"><b>Definition</b> <a href="#l00040">dsu_path_compression.cpp:40</a></div></div>
+<div class="ttc" id="aclassdsu_html_a1ef0b0462a0dda63514f641cbb7dd8cb"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">dsu::p</a></div><div class="ttdeci">vector&lt; uint64_t &gt; p</div><div class="ttdoc">keeps track of the parent of ith element</div><div class="ttdef"><b>Definition</b> <a href="#l00036">dsu_path_compression.cpp:36</a></div></div>
+<div class="ttc" id="aclassdsu_html_a4ade6f16c418fc98b54452f7b0252a53"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53">dsu::maxElement</a></div><div class="ttdeci">vector&lt; uint64_t &gt; maxElement</div><div class="ttdoc">maximum of each set to which i belongs to</div><div class="ttdef"><b>Definition</b> <a href="#l00039">dsu_path_compression.cpp:39</a></div></div>
+<div class="ttc" id="aclassdsu_html_a4bf54d33fba178998dbbe4c57f2e9429"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">dsu::depth</a></div><div class="ttdeci">vector&lt; uint64_t &gt; depth</div><div class="ttdoc">tracks the depth(rank) of i in the tree</div><div class="ttdef"><b>Definition</b> <a href="#l00037">dsu_path_compression.cpp:37</a></div></div>
+<div class="ttc" id="aclassdsu_html_a64d25c5986742f7c234ed449b2ff7303"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">dsu::isSame</a></div><div class="ttdeci">bool isSame(uint64_t i, uint64_t j)</div><div class="ttdoc">A utility function which check whether i and j belongs to same set or not.</div><div class="ttdef"><b>Definition</b> <a href="#l00124">dsu_path_compression.cpp:124</a></div></div>
+<div class="ttc" id="aclassdsu_html_a696141b8b092466767f4bfe1c5e46cde"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde">dsu::get_max</a></div><div class="ttdeci">uint64_t get_max(uint64_t i)</div><div class="ttdoc">A utility function that returns the max element of the set to which i belongs to.</div><div class="ttdef"><b>Definition</b> <a href="#l00156">dsu_path_compression.cpp:156</a></div></div>
+<div class="ttc" id="aclassdsu_html_a6ac30c07abca2aaa3b291504c25c3559"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">dsu::UnionSet</a></div><div class="ttdeci">void UnionSet(uint64_t i, uint64_t j)</div><div class="ttdoc">Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...</div><div class="ttdef"><b>Definition</b> <a href="#l00088">dsu_path_compression.cpp:88</a></div></div>
+<div class="ttc" id="aclassdsu_html_ac0dc3e17e49fe19b159b4ea4096d7b55"><div class="ttname"><a href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">dsu::setSize</a></div><div class="ttdeci">vector&lt; uint64_t &gt; setSize</div><div class="ttdoc">size of each chunk(set)</div><div class="ttdef"><b>Definition</b> <a href="#l00038">dsu_path_compression.cpp:38</a></div></div>
+<div class="ttc" id="aclassdsu_html_ac713a5b496d0405c82e2808a85e58415"><div class="ttname"><a href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415">dsu::get_min</a></div><div class="ttdeci">uint64_t get_min(uint64_t i)</div><div class="ttdoc">A utility function that returns the min element of the set to which i belongs to.</div><div class="ttdef"><b>Definition</b> <a href="#l00163">dsu_path_compression.cpp:163</a></div></div>
+<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> <a href="#l00187">dsu_path_compression.cpp:187</a></div></div>
+<div class="ttc" id="adsu__path__compression_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00206">dsu_path_compression.cpp:206</a></div></div>
+<div class="ttc" id="adsu__path__compression_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-test implementations, 1st test.</div><div class="ttdef"><b>Definition</b> <a href="#l00170">dsu_path_compression.cpp:170</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d3/dae/dsu__path__compression_8cpp.html">dsu_path_compression.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/db0/namespacelinked__list.html b/d3/db0/namespacelinked__list.html
index 32439570c..eaac3a5cb 100644
--- a/d3/db0/namespacelinked__list.html
+++ b/d3/db0/namespacelinked__list.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: linked_list Namespace Reference</title>
+<title>TheAlgorithms/C++: linked_list Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d3/db2/boyer__moore_8cpp.html b/d3/db2/boyer__moore_8cpp.html
index 0094ff01f..c74723f6d 100644
--- a/d3/db2/boyer__moore_8cpp.html
+++ b/d3/db2/boyer__moore_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: strings/boyer_moore.cpp File Reference</title>
+<title>TheAlgorithms/C++: strings/boyer_moore.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -126,7 +143,9 @@ Include dependency graph for boyer_moore.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/db6/boyer__moore_8cpp__incl.svg" width="498" height="111"><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">
+</div>
+<p><a href="../../d3/db2/boyer__moore_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">strings::boyer_moore::pattern</a></td></tr>
@@ -150,16 +169,16 @@ Macros</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:aa709cf7fca02b7d3e1888423d5f739a1" id="r_aa709cf7fca02b7d3e1888423d5f739a1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1">strings::boyer_moore::init_good_suffix</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &amp;arg)</td></tr>
+<tr class="memitem:aa709cf7fca02b7d3e1888423d5f739a1" id="r_aa709cf7fca02b7d3e1888423d5f739a1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1">strings::boyer_moore::init_good_suffix</a> (const std::string &amp;str, std::vector&lt; size_t &gt; &amp;arg)</td></tr>
 <tr class="memdesc:aa709cf7fca02b7d3e1888423d5f739a1"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function that preprocess the good suffix thable.  <br /></td></tr>
 <tr class="separator:aa709cf7fca02b7d3e1888423d5f739a1"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2f6688c9bb3e692297a3aa09cebc1c00" id="r_a2f6688c9bb3e692297a3aa09cebc1c00"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00">strings::boyer_moore::init_bad_char</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &amp;arg)</td></tr>
+<tr class="memitem:a2f6688c9bb3e692297a3aa09cebc1c00" id="r_a2f6688c9bb3e692297a3aa09cebc1c00"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00">strings::boyer_moore::init_bad_char</a> (const std::string &amp;str, std::vector&lt; size_t &gt; &amp;arg)</td></tr>
 <tr class="memdesc:a2f6688c9bb3e692297a3aa09cebc1c00"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function that preprocess the bad char table.  <br /></td></tr>
 <tr class="separator:a2f6688c9bb3e692297a3aa09cebc1c00"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0b165af1dc341289fd705be4c67728f8" id="r_a0b165af1dc341289fd705be4c67728f8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8">strings::boyer_moore::init_pattern</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, <a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">pattern</a> &amp;arg)</td></tr>
+<tr class="memitem:a0b165af1dc341289fd705be4c67728f8" id="r_a0b165af1dc341289fd705be4c67728f8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8">strings::boyer_moore::init_pattern</a> (const std::string &amp;str, <a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">pattern</a> &amp;arg)</td></tr>
 <tr class="memdesc:a0b165af1dc341289fd705be4c67728f8"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function that initializes pattern.  <br /></td></tr>
 <tr class="separator:a0b165af1dc341289fd705be4c67728f8"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a15703b553faed0d28202c10808cf9738" id="r_a15703b553faed0d28202c10808cf9738"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738">strings::boyer_moore::search</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, const <a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">pattern</a> &amp;arg)</td></tr>
+<tr class="memitem:a15703b553faed0d28202c10808cf9738" id="r_a15703b553faed0d28202c10808cf9738"><td class="memItemLeft" align="right" valign="top">std::vector&lt; size_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738">strings::boyer_moore::search</a> (const std::string &amp;str, const <a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">pattern</a> &amp;arg)</td></tr>
 <tr class="memdesc:a15703b553faed0d28202c10808cf9738"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function that implements Boyer-Moore's algorithm.  <br /></td></tr>
 <tr class="separator:a15703b553faed0d28202c10808cf9738"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a056122c8fe8fb0f5fca6428d3f7b5c3a" id="r_a056122c8fe8fb0f5fca6428d3f7b5c3a"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a">strings::boyer_moore::is_prefix</a> (const char *str, const char *pat, size_t len)</td></tr>
@@ -188,6 +207,8 @@ Functions</h2></td></tr>
 <p>[The bad character rule] (<a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm#The_bad_character_rule">https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm#The_bad_character_rule</a>)</p>
 <p>[The good suffix rule] (<a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm#The_good_suffix_rule">https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm#The_good_suffix_rule</a>)</p>
 <p>The shift rules are implemented as constant-time table lookups, using tables generated during the preprocessing of P. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/stoychoX" target="_blank">Stoycho Kyosev</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html">boyer_moore.cpp</a>.</p>
 </div><h2 class="groupheader">Macro Definition Documentation</h2>
 <a id="a77c872c08612d7b8861ba13bc9881cbd" name="a77c872c08612d7b8861ba13bc9881cbd"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a77c872c08612d7b8861ba13bc9881cbd">&#9670;&#160;</a></span>APLHABET_SIZE</h2>
@@ -202,7 +223,9 @@ Functions</h2></td></tr>
 </div><div class="memdoc">
 
 <p>number of symbols in the alphabet we use </p>
-<p>for assert for CHAR_MAX macro for strlen for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
+<p>for assert for CHAR_MAX macro for strlen for IO operations for std::string for std::vector </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html#l00052">52</a> of file <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html">boyer_moore.cpp</a>.</p>
 
 </div>
 </div>
@@ -230,27 +253,22 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html#l00220">220</a> of file <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html">boyer_moore.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  220</span>                                {</div>
 <div class="line"><span class="lineno">  221</span>    <a class="code hl_struct" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">strings::boyer_moore::pattern</a> ands;</div>
 <div class="line"><span class="lineno">  222</span>    <a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8">strings::boyer_moore::init_pattern</a>(<span class="stringliteral">&quot;and&quot;</span>, ands);</div>
-<div class="line"><span class="lineno">  223</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;size_t&gt;</a> indexes = <a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738">strings::boyer_moore::search</a>(text, ands);</div>
+<div class="line"><span class="lineno">  223</span>    std::vector&lt;size_t&gt; indexes = <a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738">strings::boyer_moore::search</a>(text, ands);</div>
 <div class="line"><span class="lineno">  224</span> </div>
-<div class="line"><span class="lineno">  225</span>    assert(indexes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() == 2);</div>
+<div class="line"><span class="lineno">  225</span>    assert(indexes.size() == 2);</div>
 <div class="line"><span class="lineno">  226</span>    assert(<a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a">strings::boyer_moore::is_prefix</a>(text + indexes[0], <span class="stringliteral">&quot;and&quot;</span>, 3));</div>
 <div class="line"><span class="lineno">  227</span>    assert(<a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a">strings::boyer_moore::is_prefix</a>(text + indexes[1], <span class="stringliteral">&quot;and&quot;</span>, 3));</div>
 <div class="line"><span class="lineno">  228</span>}</div>
-<div class="ttc" id="anamespacestrings_1_1boyer__moore_html_a056122c8fe8fb0f5fca6428d3f7b5c3a"><div class="ttname"><a href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a">strings::boyer_moore::is_prefix</a></div><div class="ttdeci">bool is_prefix(const char *str, const char *pat, size_t len)</div><div class="ttdoc">Check if pat is prefix of str.</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:200</div></div>
-<div class="ttc" id="anamespacestrings_1_1boyer__moore_html_a0b165af1dc341289fd705be4c67728f8"><div class="ttname"><a href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8">strings::boyer_moore::init_pattern</a></div><div class="ttdeci">void init_pattern(const std::string &amp;str, pattern &amp;arg)</div><div class="ttdoc">A function that initializes pattern.</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:153</div></div>
-<div class="ttc" id="anamespacestrings_1_1boyer__moore_html_a15703b553faed0d28202c10808cf9738"><div class="ttname"><a href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738">strings::boyer_moore::search</a></div><div class="ttdeci">std::vector&lt; size_t &gt; search(const std::string &amp;str, const pattern &amp;arg)</div><div class="ttdoc">A function that implements Boyer-Moore's algorithm.</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:165</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="astructstrings_1_1boyer__moore_1_1pattern_html"><div class="ttname"><a href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">strings::boyer_moore::pattern</a></div><div class="ttdoc">A structure representing all the data we need to search the preprocessed pattern in text.</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:70</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.svg" width="667" height="286"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacestrings_1_1boyer__moore_html_a056122c8fe8fb0f5fca6428d3f7b5c3a"><div class="ttname"><a href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a">strings::boyer_moore::is_prefix</a></div><div class="ttdeci">bool is_prefix(const char *str, const char *pat, size_t len)</div><div class="ttdoc">Check if pat is prefix of str.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db2/boyer__moore_8cpp_source.html#l00200">boyer_moore.cpp:200</a></div></div>
+<div class="ttc" id="anamespacestrings_1_1boyer__moore_html_a0b165af1dc341289fd705be4c67728f8"><div class="ttname"><a href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8">strings::boyer_moore::init_pattern</a></div><div class="ttdeci">void init_pattern(const std::string &amp;str, pattern &amp;arg)</div><div class="ttdoc">A function that initializes pattern.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db2/boyer__moore_8cpp_source.html#l00153">boyer_moore.cpp:153</a></div></div>
+<div class="ttc" id="anamespacestrings_1_1boyer__moore_html_a15703b553faed0d28202c10808cf9738"><div class="ttname"><a href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738">strings::boyer_moore::search</a></div><div class="ttdeci">std::vector&lt; size_t &gt; search(const std::string &amp;str, const pattern &amp;arg)</div><div class="ttdoc">A function that implements Boyer-Moore's algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db2/boyer__moore_8cpp_source.html#l00165">boyer_moore.cpp:165</a></div></div>
+<div class="ttc" id="astructstrings_1_1boyer__moore_1_1pattern_html"><div class="ttname"><a href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">strings::boyer_moore::pattern</a></div><div class="ttdoc">A structure representing all the data we need to search the preprocessed pattern in text.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db2/boyer__moore_8cpp_source.html#l00070">boyer_moore.cpp:70</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -270,17 +288,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html#l00269">269</a> of file <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html">boyer_moore.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  269</span>           {</div>
 <div class="line"><span class="lineno">  270</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  271</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  272</span>}</div>
-<div class="ttc" id="aboyer__moore_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:250</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="553"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aboyer__moore_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db2/boyer__moore_8cpp_source.html#l00250">boyer_moore.cpp:250</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac8fac0dd4b19973da103a434143a16d2" name="ac8fac0dd4b19973da103a434143a16d2"></a>
@@ -306,23 +321,20 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html#l00235">235</a> of file <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html">boyer_moore.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  235</span>                                {</div>
 <div class="line"><span class="lineno">  236</span>    <a class="code hl_struct" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">strings::boyer_moore::pattern</a> pat;</div>
 <div class="line"><span class="lineno">  237</span>    <a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8">strings::boyer_moore::init_pattern</a>(<span class="stringliteral">&quot;pat&quot;</span>, pat);</div>
-<div class="line"><span class="lineno">  238</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;size_t&gt;</a> indexes = <a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738">strings::boyer_moore::search</a>(text, pat);</div>
+<div class="line"><span class="lineno">  238</span>    std::vector&lt;size_t&gt; indexes = <a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738">strings::boyer_moore::search</a>(text, pat);</div>
 <div class="line"><span class="lineno">  239</span> </div>
-<div class="line"><span class="lineno">  240</span>    assert(indexes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() == 6);</div>
+<div class="line"><span class="lineno">  240</span>    assert(indexes.size() == 6);</div>
 <div class="line"><span class="lineno">  241</span> </div>
 <div class="line"><span class="lineno">  242</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; currentIndex : indexes) {</div>
 <div class="line"><span class="lineno">  243</span>        assert(<a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a">strings::boyer_moore::is_prefix</a>(text + currentIndex, <span class="stringliteral">&quot;pat&quot;</span>, 3));</div>
 <div class="line"><span class="lineno">  244</span>    }</div>
 <div class="line"><span class="lineno">  245</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.svg" width="664" height="286"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -350,6 +362,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html#l00250">250</a> of file <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html">boyer_moore.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  250</span>                    {</div>
 <div class="line"><span class="lineno">  251</span>    <span class="keyword">const</span> <span class="keywordtype">char</span>* text =</div>
 <div class="line"><span class="lineno">  252</span>        <span class="stringliteral">&quot;When pat Mr. and Mrs. pat Dursley woke up on the dull, gray  \</span></div>
@@ -362,17 +376,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  259</span>    <a class="code hl_function" href="#acb8f69e7901ee7459d98bd4b9dda79d9">and_test</a>(text);</div>
 <div class="line"><span class="lineno">  260</span>    <a class="code hl_function" href="#ac8fac0dd4b19973da103a434143a16d2">pat_test</a>(text);</div>
 <div class="line"><span class="lineno">  261</span> </div>
-<div class="line"><span class="lineno">  262</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  262</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  263</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="aboyer__moore_8cpp_html_ac8fac0dd4b19973da103a434143a16d2"><div class="ttname"><a href="#ac8fac0dd4b19973da103a434143a16d2">pat_test</a></div><div class="ttdeci">void pat_test(const char *text)</div><div class="ttdoc">A test case in which we search for every appearance of the word 'pat'.</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:235</div></div>
-<div class="ttc" id="aboyer__moore_8cpp_html_acb8f69e7901ee7459d98bd4b9dda79d9"><div class="ttname"><a href="#acb8f69e7901ee7459d98bd4b9dda79d9">and_test</a></div><div class="ttdeci">void and_test(const char *text)</div><div class="ttdoc">A test case in which we search for every appearance of the word 'and'.</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:220</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="100%" height="553"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aboyer__moore_8cpp_html_ac8fac0dd4b19973da103a434143a16d2"><div class="ttname"><a href="#ac8fac0dd4b19973da103a434143a16d2">pat_test</a></div><div class="ttdeci">void pat_test(const char *text)</div><div class="ttdoc">A test case in which we search for every appearance of the word 'pat'.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db2/boyer__moore_8cpp_source.html#l00235">boyer_moore.cpp:235</a></div></div>
+<div class="ttc" id="aboyer__moore_8cpp_html_acb8f69e7901ee7459d98bd4b9dda79d9"><div class="ttname"><a href="#acb8f69e7901ee7459d98bd4b9dda79d9">and_test</a></div><div class="ttdeci">void and_test(const char *text)</div><div class="ttdoc">A test case in which we search for every appearance of the word 'and'.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db2/boyer__moore_8cpp_source.html#l00220">boyer_moore.cpp:220</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index cb5cf3fd0..000000000
--- a/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,36 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,100,56,125"/>
-<area shape="rect" id="Node000002" href="$d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9" title="A test case in which we search for every appearance of the word &#39;and&#39;." alt="" coords="104,74,175,100"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,104,88,96,89,101,57,109"/>
-<area shape="rect" id="Node000013" href="$d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2" title="A test case in which we search for every appearance of the word &#39;pat&#39;." alt="" coords="105,124,174,149"/>
-<area shape="poly" id="edge17_Node000001_Node000013" title=" " alt="" coords="57,115,91,123,90,128,55,120"/>
-<area shape="rect" id="Node000003" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8" title="A function that initializes pattern." alt="" coords="223,120,366,161"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="176,97,220,112,219,117,174,102"/>
-<area shape="rect" id="Node000008" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a" title="Check if pat is prefix of str." alt="" coords="223,5,366,46"/>
-<area shape="poly" id="edge10_Node000002_Node000008" title=" " alt="" coords="173,71,226,50,228,55,175,76"/>
-<area shape="rect" id="Node000009" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738" title="A function that implements Boyer&#45;Moore&#39;s algorithm." alt="" coords="223,187,366,227"/>
-<area shape="poly" id="edge11_Node000002_Node000009" title=" " alt="" coords="163,98,177,109,191,126,201,141,210,155,225,170,233,176,229,180,221,174,206,159,196,144,187,129,173,113,160,102"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="237,70,352,96"/>
-<area shape="poly" id="edge16_Node000002_Node000012" title=" " alt="" coords="175,83,221,82,222,88,175,89"/>
-<area shape="rect" id="Node000004" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00" title="A function that preprocess the bad char table." alt="" coords="420,52,563,93"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="355,117,415,96,417,101,357,122"/>
-<area shape="rect" id="Node000007" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1" title="A function that preprocess the good suffix thable." alt="" coords="420,117,563,158"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="367,137,404,136,404,142,367,142"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="619,125,741,150"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="553,91,627,117,625,122,551,96"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="617,68,743,93"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="564,73,602,74,601,80,563,78"/>
-<area shape="poly" id="edge7_Node000007_Node000005" title=" " alt="" coords="564,144,603,144,603,149,564,149"/>
-<area shape="poly" id="edge9_Node000007_Node000005" title=" " alt="" coords="564,126,603,126,603,131,564,132"/>
-<area shape="poly" id="edge8_Node000007_Node000006" title=" " alt="" coords="560,114,620,96,622,101,561,119"/>
-<area shape="poly" id="edge12_Node000009_Node000005" title=" " alt="" coords="366,207,462,197,568,179,649,155,650,160,569,184,463,202,367,213"/>
-<area shape="poly" id="edge15_Node000009_Node000005" title=" " alt="" coords="366,188,462,174,568,155,603,147,605,152,569,160,463,179,367,193"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="455,257,528,282"/>
-<area shape="poly" id="edge13_Node000009_Node000010" title=" " alt="" coords="361,225,442,251,440,256,360,230"/>
-<area shape="rect" id="Node000011" 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="414,306,569,332"/>
-<area shape="poly" id="edge14_Node000009_Node000011" title=" " alt="" coords="321,226,363,260,416,293,427,298,424,303,413,297,360,264,317,230"/>
-<area shape="poly" id="edge18_Node000013_Node000003" title=" " alt="" coords="174,135,208,135,207,141,174,140"/>
-<area shape="poly" id="edge19_Node000013_Node000008" title=" " alt="" coords="160,121,173,110,196,82,206,70,221,56,226,52,229,56,225,60,210,73,200,86,177,114,163,125"/>
-<area shape="poly" id="edge20_Node000013_Node000009" title=" " alt="" coords="171,147,236,177,234,182,169,152"/>
-<area shape="poly" id="edge21_Node000013_Node000012" title=" " alt="" coords="173,122,240,99,242,104,175,127"/>
-</map>
diff --git a/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 568a3a749..000000000
--- a/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4eb1653c59591f0ecd44126f66bf895d
\ No newline at end of file
diff --git a/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index 5188e319b..000000000
--- a/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,406 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<!--zoomable 253 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 561;
-var viewHeight = 253;
-var sectionId = 'dynsection-4';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-174.25 0,-174.25 0,-155 37.75,-155 37.75,-174.25"/>
-<text text-anchor="middle" x="18.88" y="-160.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9" target="_top" xlink:title="A test case in which we search for every appearance of the word &#39;and&#39;.">
-<polygon fill="white" stroke="#666666" points="127.25,-193.25 73.75,-193.25 73.75,-174 127.25,-174 127.25,-193.25"/>
-<text text-anchor="middle" x="100.5" y="-179.75" font-family="Helvetica,sans-Serif" font-size="10.00">and_test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-168.94C45.22,-170.67 53.89,-172.74 62.39,-174.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.34,-178.12 71.88,-177.03 62.96,-171.31 61.34,-178.12"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2" target="_top" xlink:title="A test case in which we search for every appearance of the word &#39;pat&#39;.">
-<polygon fill="white" stroke="#666666" points="126.12,-156.25 74.88,-156.25 74.88,-137 126.12,-137 126.12,-156.25"/>
-<text text-anchor="middle" x="100.5" y="-142.75" font-family="Helvetica,sans-Serif" font-size="10.00">pat_test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node13 -->
-<g id="edge17_Node000001_Node000013" class="edge">
-<title>Node1&#45;&gt;Node13</title>
-<g id="a_edge17_Node000001_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-160.54C45.56,-158.82 54.7,-156.75 63.58,-154.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.1,-158.22 73.09,-152.6 62.56,-151.39 64.1,-158.22"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8" target="_top" xlink:title="A function that initializes pattern.">
-<polygon fill="white" stroke="#666666" points="270.75,-158.88 163.25,-158.88 163.25,-128.38 270.75,-128.38 270.75,-158.88"/>
-<text text-anchor="start" x="171.25" y="-145.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="217" y="-134.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_pattern</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.48,-174.55C137.38,-171.09 149.08,-167 160.68,-162.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.53,-166.36 169.82,-159.76 159.22,-159.75 161.53,-166.36"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a" target="_top" xlink:title="Check if pat is prefix of str.">
-<polygon fill="white" stroke="#666666" points="270.75,-244.88 163.25,-244.88 163.25,-214.38 270.75,-214.38 270.75,-244.88"/>
-<text text-anchor="start" x="171.25" y="-231.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="217" y="-220.12" font-family="Helvetica,sans-Serif" font-size="10.00">::is_prefix</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge10_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge10_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.63,-193.72C138.38,-198.44 152.8,-204.23 166.6,-209.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.99,-212.9 175.57,-213.38 167.6,-206.41 164.99,-212.9"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738" target="_top" xlink:title="A function that implements Boyer&#45;Moore&#39;s algorithm.">
-<polygon fill="white" stroke="#666666" points="270.75,-108.88 163.25,-108.88 163.25,-78.38 270.75,-78.38 270.75,-108.88"/>
-<text text-anchor="start" x="171.25" y="-95.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="217" y="-84.12" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge11_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge11_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.33,-173.67C120.75,-171.22 124.24,-168.48 127.25,-165.62 146.1,-147.77 143.1,-136 163.25,-119.62 165.15,-118.08 167.16,-116.6 169.23,-115.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.7,-118.39 177.38,-110.16 167.03,-112.43 170.7,-118.39"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.25,-196.25 173.75,-196.25 173.75,-177 260.25,-177 260.25,-196.25"/>
-<text text-anchor="middle" x="217" y="-182.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge16_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge16_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.48,-184.31C137.78,-184.58 150.03,-184.9 162.08,-185.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.9,-188.71 171.99,-185.47 162.09,-181.71 161.9,-188.71"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00" target="_top" xlink:title="A function that preprocess the bad char table.">
-<polygon fill="white" stroke="#666666" points="418.38,-209.88 310.88,-209.88 310.88,-179.38 418.38,-179.38 418.38,-209.88"/>
-<text text-anchor="start" x="318.88" y="-196.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="364.62" y="-185.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_bad_char</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.88,-159.34C277.2,-164.36 293.23,-169.97 308.21,-175.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="306.87,-178.46 317.46,-178.46 309.18,-171.85 306.87,-178.46"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1" target="_top" xlink:title="A function that preprocess the good suffix thable.">
-<polygon fill="white" stroke="#666666" points="418.38,-160.88 310.88,-160.88 310.88,-130.38 418.38,-130.38 418.38,-160.88"/>
-<text text-anchor="start" x="318.88" y="-147.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="364.62" y="-136.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_good_suffix</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.99,-144.35C280.12,-144.48 289.71,-144.61 299.11,-144.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.87,-148.24 308.92,-144.87 298.97,-141.24 298.87,-148.24"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="551.75,-155.25 460,-155.25 460,-136 551.75,-136 551.75,-155.25"/>
-<text text-anchor="middle" x="505.88" y="-141.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M410.07,-178.99C427.83,-172.74 448.11,-165.6 465.35,-159.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="466.48,-162.85 474.75,-156.22 464.16,-156.24 466.48,-162.85"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="553.25,-198.25 458.5,-198.25 458.5,-179 553.25,-179 553.25,-198.25"/>
-<text text-anchor="middle" x="505.88" y="-184.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M418.67,-192.34C427.96,-191.94 437.66,-191.52 447.07,-191.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="447,-194.62 456.84,-190.69 446.7,-187.63 447,-194.62"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge7_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge7_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M418.67,-139.05C428.39,-138.84 438.57,-138.82 448.39,-138.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="448.1,-142.48 458.19,-139.22 448.28,-135.48 448.1,-142.48"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge9_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge9_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M418.67,-152.2C428.39,-152.41 438.57,-152.43 448.39,-152.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="448.28,-155.77 458.19,-152.03 448.1,-148.77 448.28,-155.77"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge8_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge8_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M416.29,-161.27C431.16,-165.86 447.29,-170.84 461.65,-175.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="460.2,-178.49 470.79,-178.1 462.27,-171.81 460.2,-178.49"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge12_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge12_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.91,-91.36C312.42,-94.21 371.5,-101.77 422.5,-112.62 443.33,-117.06 466.6,-124.03 483.07,-130.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.36,-133.95 491.91,-134.95 484.28,-127.59 481.36,-133.95"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge15_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge15_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.91,-106.05C312.42,-112.21 371.5,-119.77 422.5,-130.62 431.1,-132.46 440.12,-134.72 448.91,-137.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="447.84,-140.35 458.4,-139.51 449.62,-133.58 447.84,-140.35"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="391.75,-56.25 337.5,-56.25 337.5,-37 391.75,-37 391.75,-56.25"/>
-<text text-anchor="middle" x="364.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge13_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge13_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M266.49,-77.97C286.09,-71.65 308.34,-64.47 326.6,-58.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.51,-61.96 335.95,-55.56 325.36,-55.3 327.51,-61.96"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="422.5,-19.25 306.75,-19.25 306.75,0 422.5,0 422.5,-19.25"/>
-<text text-anchor="middle" x="364.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge14_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge14_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.19,-78.09C252.27,-63.35 279.74,-41.45 306.75,-27.62 309.42,-26.26 312.22,-24.97 315.08,-23.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.1,-27.11 324.18,-20.26 313.59,-20.58 316.1,-27.11"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node3 -->
-<g id="edge18_Node000013_Node000003" class="edge">
-<title>Node13&#45;&gt;Node3</title>
-<g id="a_edge18_Node000013_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.34,-145.97C133.93,-145.78 142.64,-145.55 151.6,-145.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.58,-148.81 161.48,-145.05 151.4,-141.82 151.58,-148.81"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node8 -->
-<g id="edge19_Node000013_Node000008" class="edge">
-<title>Node13&#45;&gt;Node8</title>
-<g id="a_edge19_Node000013_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.21,-156.71C120.64,-159.15 124.16,-161.86 127.25,-164.62 145.32,-180.8 143.78,-191.17 163.25,-205.62 164.41,-206.49 165.6,-207.32 166.83,-208.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.94,-211.09 175.32,-213.21 168.53,-205.08 164.94,-211.09"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node9 -->
-<g id="edge20_Node000013_Node000009" class="edge">
-<title>Node13&#45;&gt;Node9</title>
-<g id="a_edge20_Node000013_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M123.31,-136.53C137.06,-130.16 155.32,-121.71 171.99,-114"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.13,-117.32 180.74,-109.95 170.19,-110.97 173.13,-117.32"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node12 -->
-<g id="edge21_Node000013_Node000012" class="edge">
-<title>Node13&#45;&gt;Node12</title>
-<g id="a_edge21_Node000013_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.34,-155.3C141.02,-160.43 159.93,-167.04 176.6,-172.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.14,-176.06 185.73,-176.05 177.45,-169.45 175.14,-176.06"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index 0eb9fa0d1..000000000
--- a/d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,323 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="561pt" height="253pt"
- viewBox="0.00 0.00 561.25 252.88" 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 248.88)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-174.25 0,-174.25 0,-155 37.75,-155 37.75,-174.25"/>
-<text text-anchor="middle" x="18.88" y="-160.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9" target="_top" xlink:title="A test case in which we search for every appearance of the word &#39;and&#39;.">
-<polygon fill="white" stroke="#666666" points="127.25,-193.25 73.75,-193.25 73.75,-174 127.25,-174 127.25,-193.25"/>
-<text text-anchor="middle" x="100.5" y="-179.75" font-family="Helvetica,sans-Serif" font-size="10.00">and_test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-168.94C45.22,-170.67 53.89,-172.74 62.39,-174.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.34,-178.12 71.88,-177.03 62.96,-171.31 61.34,-178.12"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2" target="_top" xlink:title="A test case in which we search for every appearance of the word &#39;pat&#39;.">
-<polygon fill="white" stroke="#666666" points="126.12,-156.25 74.88,-156.25 74.88,-137 126.12,-137 126.12,-156.25"/>
-<text text-anchor="middle" x="100.5" y="-142.75" font-family="Helvetica,sans-Serif" font-size="10.00">pat_test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node13 -->
-<g id="edge17_Node000001_Node000013" class="edge">
-<title>Node1&#45;&gt;Node13</title>
-<g id="a_edge17_Node000001_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-160.54C45.56,-158.82 54.7,-156.75 63.58,-154.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.1,-158.22 73.09,-152.6 62.56,-151.39 64.1,-158.22"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8" target="_top" xlink:title="A function that initializes pattern.">
-<polygon fill="white" stroke="#666666" points="270.75,-158.88 163.25,-158.88 163.25,-128.38 270.75,-128.38 270.75,-158.88"/>
-<text text-anchor="start" x="171.25" y="-145.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="217" y="-134.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_pattern</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.48,-174.55C137.38,-171.09 149.08,-167 160.68,-162.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.53,-166.36 169.82,-159.76 159.22,-159.75 161.53,-166.36"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a" target="_top" xlink:title="Check if pat is prefix of str.">
-<polygon fill="white" stroke="#666666" points="270.75,-244.88 163.25,-244.88 163.25,-214.38 270.75,-214.38 270.75,-244.88"/>
-<text text-anchor="start" x="171.25" y="-231.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="217" y="-220.12" font-family="Helvetica,sans-Serif" font-size="10.00">::is_prefix</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge10_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge10_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.63,-193.72C138.38,-198.44 152.8,-204.23 166.6,-209.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.99,-212.9 175.57,-213.38 167.6,-206.41 164.99,-212.9"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738" target="_top" xlink:title="A function that implements Boyer&#45;Moore&#39;s algorithm.">
-<polygon fill="white" stroke="#666666" points="270.75,-108.88 163.25,-108.88 163.25,-78.38 270.75,-78.38 270.75,-108.88"/>
-<text text-anchor="start" x="171.25" y="-95.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="217" y="-84.12" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge11_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge11_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.33,-173.67C120.75,-171.22 124.24,-168.48 127.25,-165.62 146.1,-147.77 143.1,-136 163.25,-119.62 165.15,-118.08 167.16,-116.6 169.23,-115.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.7,-118.39 177.38,-110.16 167.03,-112.43 170.7,-118.39"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.25,-196.25 173.75,-196.25 173.75,-177 260.25,-177 260.25,-196.25"/>
-<text text-anchor="middle" x="217" y="-182.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge16_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge16_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.48,-184.31C137.78,-184.58 150.03,-184.9 162.08,-185.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.9,-188.71 171.99,-185.47 162.09,-181.71 161.9,-188.71"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00" target="_top" xlink:title="A function that preprocess the bad char table.">
-<polygon fill="white" stroke="#666666" points="418.38,-209.88 310.88,-209.88 310.88,-179.38 418.38,-179.38 418.38,-209.88"/>
-<text text-anchor="start" x="318.88" y="-196.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="364.62" y="-185.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_bad_char</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.88,-159.34C277.2,-164.36 293.23,-169.97 308.21,-175.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="306.87,-178.46 317.46,-178.46 309.18,-171.85 306.87,-178.46"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1" target="_top" xlink:title="A function that preprocess the good suffix thable.">
-<polygon fill="white" stroke="#666666" points="418.38,-160.88 310.88,-160.88 310.88,-130.38 418.38,-130.38 418.38,-160.88"/>
-<text text-anchor="start" x="318.88" y="-147.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="364.62" y="-136.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_good_suffix</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.99,-144.35C280.12,-144.48 289.71,-144.61 299.11,-144.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.87,-148.24 308.92,-144.87 298.97,-141.24 298.87,-148.24"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="551.75,-155.25 460,-155.25 460,-136 551.75,-136 551.75,-155.25"/>
-<text text-anchor="middle" x="505.88" y="-141.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M410.07,-178.99C427.83,-172.74 448.11,-165.6 465.35,-159.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="466.48,-162.85 474.75,-156.22 464.16,-156.24 466.48,-162.85"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="553.25,-198.25 458.5,-198.25 458.5,-179 553.25,-179 553.25,-198.25"/>
-<text text-anchor="middle" x="505.88" y="-184.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M418.67,-192.34C427.96,-191.94 437.66,-191.52 447.07,-191.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="447,-194.62 456.84,-190.69 446.7,-187.63 447,-194.62"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge7_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge7_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M418.67,-139.05C428.39,-138.84 438.57,-138.82 448.39,-138.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="448.1,-142.48 458.19,-139.22 448.28,-135.48 448.1,-142.48"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge9_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge9_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M418.67,-152.2C428.39,-152.41 438.57,-152.43 448.39,-152.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="448.28,-155.77 458.19,-152.03 448.1,-148.77 448.28,-155.77"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge8_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge8_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M416.29,-161.27C431.16,-165.86 447.29,-170.84 461.65,-175.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="460.2,-178.49 470.79,-178.1 462.27,-171.81 460.2,-178.49"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge12_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge12_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.91,-91.36C312.42,-94.21 371.5,-101.77 422.5,-112.62 443.33,-117.06 466.6,-124.03 483.07,-130.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.36,-133.95 491.91,-134.95 484.28,-127.59 481.36,-133.95"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge15_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge15_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.91,-106.05C312.42,-112.21 371.5,-119.77 422.5,-130.62 431.1,-132.46 440.12,-134.72 448.91,-137.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="447.84,-140.35 458.4,-139.51 449.62,-133.58 447.84,-140.35"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="391.75,-56.25 337.5,-56.25 337.5,-37 391.75,-37 391.75,-56.25"/>
-<text text-anchor="middle" x="364.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge13_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge13_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M266.49,-77.97C286.09,-71.65 308.34,-64.47 326.6,-58.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.51,-61.96 335.95,-55.56 325.36,-55.3 327.51,-61.96"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="422.5,-19.25 306.75,-19.25 306.75,0 422.5,0 422.5,-19.25"/>
-<text text-anchor="middle" x="364.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge14_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge14_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.19,-78.09C252.27,-63.35 279.74,-41.45 306.75,-27.62 309.42,-26.26 312.22,-24.97 315.08,-23.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.1,-27.11 324.18,-20.26 313.59,-20.58 316.1,-27.11"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node3 -->
-<g id="edge18_Node000013_Node000003" class="edge">
-<title>Node13&#45;&gt;Node3</title>
-<g id="a_edge18_Node000013_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.34,-145.97C133.93,-145.78 142.64,-145.55 151.6,-145.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.58,-148.81 161.48,-145.05 151.4,-141.82 151.58,-148.81"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node8 -->
-<g id="edge19_Node000013_Node000008" class="edge">
-<title>Node13&#45;&gt;Node8</title>
-<g id="a_edge19_Node000013_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.21,-156.71C120.64,-159.15 124.16,-161.86 127.25,-164.62 145.32,-180.8 143.78,-191.17 163.25,-205.62 164.41,-206.49 165.6,-207.32 166.83,-208.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.94,-211.09 175.32,-213.21 168.53,-205.08 164.94,-211.09"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node9 -->
-<g id="edge20_Node000013_Node000009" class="edge">
-<title>Node13&#45;&gt;Node9</title>
-<g id="a_edge20_Node000013_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M123.31,-136.53C137.06,-130.16 155.32,-121.71 171.99,-114"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.13,-117.32 180.74,-109.95 170.19,-110.97 173.13,-117.32"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node12 -->
-<g id="edge21_Node000013_Node000012" class="edge">
-<title>Node13&#45;&gt;Node12</title>
-<g id="a_edge21_Node000013_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.34,-155.3C141.02,-160.43 159.93,-167.04 176.6,-172.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.14,-176.06 185.73,-176.05 177.45,-169.45 175.14,-176.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.map b/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.map
deleted file mode 100644
index c261b29c5..000000000
--- a/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.map
+++ /dev/null
@@ -1,28 +0,0 @@
-<map id="pat_test" name="pat_test">
-<area shape="rect" id="Node000001" title="A test case in which we search for every appearance of the word &#39;pat&#39;." alt="" coords="5,169,74,194"/>
-<area shape="rect" id="Node000002" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8" title="A function that initializes pattern." alt="" coords="122,71,265,111"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="62,166,143,117,146,122,65,171"/>
-<area shape="rect" id="Node000007" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a" title="Check if pat is prefix of str." alt="" coords="122,189,265,230"/>
-<area shape="poly" id="edge9_Node000001_Node000007" title=" " alt="" coords="74,185,107,191,106,196,74,190"/>
-<area shape="rect" id="Node000008" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738" title="A function that implements Boyer&#45;Moore&#39;s algorithm." alt="" coords="313,136,456,177"/>
-<area shape="poly" id="edge10_Node000001_Node000008" title=" " alt="" coords="74,177,297,160,298,165,74,182"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="136,254,251,280"/>
-<area shape="poly" id="edge15_Node000001_Node000011" title=" " alt="" coords="58,193,87,216,123,239,135,245,133,250,120,244,84,221,54,197"/>
-<area shape="rect" id="Node000003" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00" title="A function that preprocess the bad char table." alt="" coords="313,5,456,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="254,68,308,49,310,54,256,73"/>
-<area shape="rect" id="Node000006" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1" title="A function that preprocess the good suffix thable." alt="" coords="313,71,456,111"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="265,88,298,88,298,94,265,94"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="520,78,643,104"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="449,44,527,70,525,75,447,49"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="518,21,645,46"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="457,26,503,28,503,33,457,31"/>
-<area shape="poly" id="edge6_Node000006_Node000004" title=" " alt="" coords="457,97,505,97,505,102,457,102"/>
-<area shape="poly" id="edge8_Node000006_Node000004" title=" " alt="" coords="457,80,505,80,505,85,457,85"/>
-<area shape="poly" id="edge7_Node000006_Node000005" title=" " alt="" coords="456,68,520,49,521,54,457,73"/>
-<area shape="poly" id="edge11_Node000008_Node000004" title=" " alt="" coords="456,139,543,108,545,113,458,144"/>
-<area shape="poly" id="edge14_Node000008_Node000004" title=" " alt="" coords="425,133,504,105,506,110,427,138"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="545,136,618,161"/>
-<area shape="poly" id="edge12_Node000008_Node000009" title=" " alt="" coords="457,151,529,148,529,153,457,156"/>
-<area shape="rect" id="Node000010" 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="504,185,659,210"/>
-<area shape="poly" id="edge13_Node000008_Node000010" title=" " alt="" coords="457,169,503,178,502,184,456,174"/>
-</map>
diff --git a/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.md5 b/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.md5
deleted file mode 100644
index 52585bc69..000000000
--- a/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-382f0c5d9378c7cbcf591c40e3a3a7db
\ No newline at end of file
diff --git a/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.svg b/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.svg
deleted file mode 100644
index be05d1d3b..000000000
--- a/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.svg
+++ /dev/null
@@ -1,277 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: pat_test Pages: 1 -->
-<svg width="498pt" height="214pt"
- viewBox="0.00 0.00 498.00 213.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 209.88)">
-<title>pat_test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A test case in which we search for every appearance of the word &#39;pat&#39;.">
-<polygon fill="#999999" stroke="#666666" points="51.25,-83.25 0,-83.25 0,-64 51.25,-64 51.25,-83.25"/>
-<text text-anchor="middle" x="25.62" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">pat_test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8" target="_top" xlink:title="A function that initializes pattern.">
-<polygon fill="white" stroke="#666666" points="194.75,-156.88 87.25,-156.88 87.25,-126.38 194.75,-126.38 194.75,-156.88"/>
-<text text-anchor="start" x="95.25" y="-143.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="141" y="-132.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_pattern</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.35,-83.66C59.34,-93.25 83.95,-108.01 104.34,-120.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.28,-123.08 112.65,-125.22 105.88,-117.08 102.28,-123.08"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a" target="_top" xlink:title="Check if pat is prefix of str.">
-<polygon fill="white" stroke="#666666" points="194.75,-67.88 87.25,-67.88 87.25,-37.38 194.75,-37.38 194.75,-67.88"/>
-<text text-anchor="start" x="95.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="141" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::is_prefix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge9_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge9_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M51.51,-69.02C58.76,-67.67 67.04,-66.14 75.55,-64.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.14,-68.01 85.33,-62.75 74.86,-61.13 76.14,-68.01"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738" target="_top" xlink:title="A function that implements Boyer&#45;Moore&#39;s algorithm.">
-<polygon fill="white" stroke="#666666" points="338.25,-107.88 230.75,-107.88 230.75,-77.38 338.25,-77.38 338.25,-107.88"/>
-<text text-anchor="start" x="238.75" y="-94.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="284.5" y="-83.12" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge10_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge10_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M51.72,-75.48C90.15,-78.32 164.79,-83.84 219.01,-87.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.51,-91.33 228.74,-88.57 219.03,-84.35 218.51,-91.33"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="184.25,-19.25 97.75,-19.25 97.75,0 184.25,0 184.25,-19.25"/>
-<text text-anchor="middle" x="141" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge15_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge15_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.01,-63.57C49.71,-53.64 68.77,-38.53 87.25,-28.62 90.28,-27 93.49,-25.46 96.75,-24.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.93,-27.31 105.87,-20.3 95.29,-20.83 97.93,-27.31"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00" target="_top" xlink:title="A function that preprocess the bad char table.">
-<polygon fill="white" stroke="#666666" points="338.25,-205.88 230.75,-205.88 230.75,-175.38 338.25,-175.38 338.25,-205.88"/>
-<text text-anchor="start" x="238.75" y="-192.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="284.5" y="-181.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_bad_char</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.16,-157.26C200.05,-161.73 214.25,-166.65 227.7,-171.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.26,-174.51 236.85,-174.47 228.55,-167.89 226.26,-174.51"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1" target="_top" xlink:title="A function that preprocess the good suffix thable.">
-<polygon fill="white" stroke="#666666" points="338.25,-156.88 230.75,-156.88 230.75,-126.38 338.25,-126.38 338.25,-156.88"/>
-<text text-anchor="start" x="238.75" y="-143.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="284.5" y="-132.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_good_suffix</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M195.09,-141.62C202.98,-141.62 211.18,-141.62 219.27,-141.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.07,-145.13 229.07,-141.63 219.07,-138.13 219.07,-145.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="478,-151.25 386.25,-151.25 386.25,-132 478,-132 478,-151.25"/>
-<text text-anchor="middle" x="432.12" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M331.98,-174.99C350.73,-168.68 372.17,-161.46 390.31,-155.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="391.32,-158.71 399.68,-152.2 389.09,-152.08 391.32,-158.71"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="479.5,-194.25 384.75,-194.25 384.75,-175 479.5,-175 479.5,-194.25"/>
-<text text-anchor="middle" x="432.12" y="-180.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M338.49,-188.44C349.83,-187.97 361.87,-187.48 373.38,-187"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="373.32,-190.51 383.17,-186.6 373.03,-183.52 373.32,-190.51"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge6_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge6_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M338.49,-135.1C350.32,-134.82 362.91,-134.8 374.87,-135.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="374.49,-138.52 384.58,-135.29 374.68,-131.53 374.49,-138.52"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge8_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M338.49,-148.15C350.32,-148.43 362.91,-148.45 374.87,-148.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="374.68,-151.72 384.58,-147.96 374.49,-144.73 374.68,-151.72"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge7_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge7_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M338.49,-157.27C354.19,-161.91 371.23,-166.94 386.36,-171.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="384.96,-174.64 395.54,-174.12 386.94,-167.93 384.96,-174.64"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge11_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge11_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M338.49,-103.93C360.71,-110.89 385.6,-119.64 403.98,-127.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="402.54,-130.29 413.11,-130.96 405.26,-123.84 402.54,-130.29"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge14_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge14_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M315.67,-108.37C332.75,-115.17 354.67,-122.88 374.81,-129.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="373.74,-132.6 384.32,-132.22 375.81,-125.92 373.74,-132.6"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="459.25,-108.25 405,-108.25 405,-89 459.25,-89 459.25,-108.25"/>
-<text text-anchor="middle" x="432.12" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge12_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge12_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M338.49,-94.81C356.55,-95.55 376.37,-96.37 393.03,-97.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="392.88,-100.55 403.02,-97.47 393.17,-93.56 392.88,-100.55"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="490,-71.25 374.25,-71.25 374.25,-52 490,-52 490,-71.25"/>
-<text text-anchor="middle" x="432.12" y="-57.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge13_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge13_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M338.49,-81.35C349.59,-78.98 361.35,-76.48 372.64,-74.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="373.19,-77.54 382.25,-72.03 371.74,-70.69 373.19,-77.54"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph_org.svg b/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph_org.svg
deleted file mode 100644
index 512630dc3..000000000
--- a/d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph_org.svg
+++ /dev/null
@@ -1,251 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: pat_test Pages: 1 -->
-<svg width="498pt" height="214pt"
- viewBox="0.00 0.00 498.00 213.88" 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 209.88)">
-<title>pat_test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A test case in which we search for every appearance of the word &#39;pat&#39;.">
-<polygon fill="#999999" stroke="#666666" points="51.25,-83.25 0,-83.25 0,-64 51.25,-64 51.25,-83.25"/>
-<text text-anchor="middle" x="25.62" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">pat_test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8" target="_top" xlink:title="A function that initializes pattern.">
-<polygon fill="white" stroke="#666666" points="194.75,-156.88 87.25,-156.88 87.25,-126.38 194.75,-126.38 194.75,-156.88"/>
-<text text-anchor="start" x="95.25" y="-143.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="141" y="-132.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_pattern</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.35,-83.66C59.34,-93.25 83.95,-108.01 104.34,-120.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.28,-123.08 112.65,-125.22 105.88,-117.08 102.28,-123.08"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a" target="_top" xlink:title="Check if pat is prefix of str.">
-<polygon fill="white" stroke="#666666" points="194.75,-67.88 87.25,-67.88 87.25,-37.38 194.75,-37.38 194.75,-67.88"/>
-<text text-anchor="start" x="95.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="141" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::is_prefix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge9_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge9_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M51.51,-69.02C58.76,-67.67 67.04,-66.14 75.55,-64.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.14,-68.01 85.33,-62.75 74.86,-61.13 76.14,-68.01"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738" target="_top" xlink:title="A function that implements Boyer&#45;Moore&#39;s algorithm.">
-<polygon fill="white" stroke="#666666" points="338.25,-107.88 230.75,-107.88 230.75,-77.38 338.25,-77.38 338.25,-107.88"/>
-<text text-anchor="start" x="238.75" y="-94.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="284.5" y="-83.12" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge10_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge10_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M51.72,-75.48C90.15,-78.32 164.79,-83.84 219.01,-87.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.51,-91.33 228.74,-88.57 219.03,-84.35 218.51,-91.33"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="184.25,-19.25 97.75,-19.25 97.75,0 184.25,0 184.25,-19.25"/>
-<text text-anchor="middle" x="141" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge15_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge15_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.01,-63.57C49.71,-53.64 68.77,-38.53 87.25,-28.62 90.28,-27 93.49,-25.46 96.75,-24.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.93,-27.31 105.87,-20.3 95.29,-20.83 97.93,-27.31"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00" target="_top" xlink:title="A function that preprocess the bad char table.">
-<polygon fill="white" stroke="#666666" points="338.25,-205.88 230.75,-205.88 230.75,-175.38 338.25,-175.38 338.25,-205.88"/>
-<text text-anchor="start" x="238.75" y="-192.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="284.5" y="-181.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_bad_char</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.16,-157.26C200.05,-161.73 214.25,-166.65 227.7,-171.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.26,-174.51 236.85,-174.47 228.55,-167.89 226.26,-174.51"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1" target="_top" xlink:title="A function that preprocess the good suffix thable.">
-<polygon fill="white" stroke="#666666" points="338.25,-156.88 230.75,-156.88 230.75,-126.38 338.25,-126.38 338.25,-156.88"/>
-<text text-anchor="start" x="238.75" y="-143.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="284.5" y="-132.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_good_suffix</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M195.09,-141.62C202.98,-141.62 211.18,-141.62 219.27,-141.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.07,-145.13 229.07,-141.63 219.07,-138.13 219.07,-145.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="478,-151.25 386.25,-151.25 386.25,-132 478,-132 478,-151.25"/>
-<text text-anchor="middle" x="432.12" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M331.98,-174.99C350.73,-168.68 372.17,-161.46 390.31,-155.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="391.32,-158.71 399.68,-152.2 389.09,-152.08 391.32,-158.71"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="479.5,-194.25 384.75,-194.25 384.75,-175 479.5,-175 479.5,-194.25"/>
-<text text-anchor="middle" x="432.12" y="-180.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M338.49,-188.44C349.83,-187.97 361.87,-187.48 373.38,-187"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="373.32,-190.51 383.17,-186.6 373.03,-183.52 373.32,-190.51"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge6_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge6_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M338.49,-135.1C350.32,-134.82 362.91,-134.8 374.87,-135.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="374.49,-138.52 384.58,-135.29 374.68,-131.53 374.49,-138.52"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge8_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M338.49,-148.15C350.32,-148.43 362.91,-148.45 374.87,-148.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="374.68,-151.72 384.58,-147.96 374.49,-144.73 374.68,-151.72"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge7_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge7_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M338.49,-157.27C354.19,-161.91 371.23,-166.94 386.36,-171.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="384.96,-174.64 395.54,-174.12 386.94,-167.93 384.96,-174.64"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge11_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge11_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M338.49,-103.93C360.71,-110.89 385.6,-119.64 403.98,-127.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="402.54,-130.29 413.11,-130.96 405.26,-123.84 402.54,-130.29"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge14_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge14_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M315.67,-108.37C332.75,-115.17 354.67,-122.88 374.81,-129.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="373.74,-132.6 384.32,-132.22 375.81,-125.92 373.74,-132.6"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="459.25,-108.25 405,-108.25 405,-89 459.25,-89 459.25,-108.25"/>
-<text text-anchor="middle" x="432.12" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge12_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge12_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M338.49,-94.81C356.55,-95.55 376.37,-96.37 393.03,-97.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="392.88,-100.55 403.02,-97.47 393.17,-93.56 392.88,-100.55"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="490,-71.25 374.25,-71.25 374.25,-52 490,-52 490,-71.25"/>
-<text text-anchor="middle" x="432.12" y="-57.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge13_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge13_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M338.49,-81.35C349.59,-78.98 361.35,-76.48 372.64,-74.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="373.19,-77.54 382.25,-72.03 371.74,-70.69 373.19,-77.54"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.map b/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.map
deleted file mode 100644
index 19dea83c6..000000000
--- a/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.map
+++ /dev/null
@@ -1,28 +0,0 @@
-<map id="and_test" name="and_test">
-<area shape="rect" id="Node000001" title="A test case in which we search for every appearance of the word &#39;and&#39;." alt="" coords="5,169,77,194"/>
-<area shape="rect" id="Node000002" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8" title="A function that initializes pattern." alt="" coords="125,71,268,111"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="63,166,146,117,148,122,66,171"/>
-<area shape="rect" id="Node000007" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a" title="Check if pat is prefix of str." alt="" coords="125,189,268,230"/>
-<area shape="poly" id="edge9_Node000001_Node000007" title=" " alt="" coords="77,185,110,191,109,197,76,191"/>
-<area shape="rect" id="Node000008" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738" title="A function that implements Boyer&#45;Moore&#39;s algorithm." alt="" coords="316,136,459,177"/>
-<area shape="poly" id="edge10_Node000001_Node000008" title=" " alt="" coords="77,176,300,160,301,165,77,182"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="139,254,254,280"/>
-<area shape="poly" id="edge15_Node000001_Node000011" title=" " alt="" coords="59,193,89,216,126,239,139,246,137,250,123,244,86,221,56,197"/>
-<area shape="rect" id="Node000003" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00" title="A function that preprocess the bad char table." alt="" coords="316,5,459,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="257,68,311,49,313,54,259,73"/>
-<area shape="rect" id="Node000006" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1" title="A function that preprocess the good suffix thable." alt="" coords="316,71,459,111"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="268,88,301,88,301,94,268,94"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="523,78,646,104"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="452,44,530,70,528,75,450,49"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="521,21,648,46"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="460,26,506,28,506,33,460,31"/>
-<area shape="poly" id="edge6_Node000006_Node000004" title=" " alt="" coords="460,97,508,97,508,102,460,102"/>
-<area shape="poly" id="edge8_Node000006_Node000004" title=" " alt="" coords="460,80,508,80,508,85,460,85"/>
-<area shape="poly" id="edge7_Node000006_Node000005" title=" " alt="" coords="459,68,523,49,524,54,460,73"/>
-<area shape="poly" id="edge11_Node000008_Node000004" title=" " alt="" coords="459,139,546,108,548,113,461,144"/>
-<area shape="poly" id="edge14_Node000008_Node000004" title=" " alt="" coords="428,133,507,105,509,110,430,138"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="548,136,621,161"/>
-<area shape="poly" id="edge12_Node000008_Node000009" title=" " alt="" coords="460,151,532,148,532,153,460,156"/>
-<area shape="rect" id="Node000010" 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="507,185,662,210"/>
-<area shape="poly" id="edge13_Node000008_Node000010" title=" " alt="" coords="460,169,506,178,505,184,459,174"/>
-</map>
diff --git a/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.md5 b/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.md5
deleted file mode 100644
index 05cf26abe..000000000
--- a/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-98d8f70da8aad14556827317ad6b0ff1
\ No newline at end of file
diff --git a/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.svg b/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.svg
deleted file mode 100644
index e21a9cfe2..000000000
--- a/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.svg
+++ /dev/null
@@ -1,277 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: and_test Pages: 1 -->
-<svg width="500pt" height="214pt"
- viewBox="0.00 0.00 500.25 213.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 209.88)">
-<title>and_test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A test case in which we search for every appearance of the word &#39;and&#39;.">
-<polygon fill="#999999" stroke="#666666" points="53.5,-83.25 0,-83.25 0,-64 53.5,-64 53.5,-83.25"/>
-<text text-anchor="middle" x="26.75" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">and_test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8" target="_top" xlink:title="A function that initializes pattern.">
-<polygon fill="white" stroke="#666666" points="197,-156.88 89.5,-156.88 89.5,-126.38 197,-126.38 197,-156.88"/>
-<text text-anchor="start" x="97.5" y="-143.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="143.25" y="-132.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_pattern</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44.64,-83.66C60.79,-93.25 85.65,-108.01 106.23,-120.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="104.25,-123.13 114.64,-125.23 107.83,-117.11 104.25,-123.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a" target="_top" xlink:title="Check if pat is prefix of str.">
-<polygon fill="white" stroke="#666666" points="197,-67.88 89.5,-67.88 89.5,-37.38 197,-37.38 197,-67.88"/>
-<text text-anchor="start" x="97.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="143.25" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::is_prefix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge9_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge9_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.73,-68.86C61.07,-67.51 69.4,-65.99 77.94,-64.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.54,-67.87 87.74,-62.62 77.28,-60.98 78.54,-67.87"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738" target="_top" xlink:title="A function that implements Boyer&#45;Moore&#39;s algorithm.">
-<polygon fill="white" stroke="#666666" points="340.5,-107.88 233,-107.88 233,-77.38 340.5,-77.38 340.5,-107.88"/>
-<text text-anchor="start" x="241" y="-94.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="286.75" y="-83.12" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge10_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge10_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.91,-75.55C92.9,-78.42 167.46,-83.91 221.52,-87.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.99,-91.36 231.22,-88.61 221.5,-84.38 220.99,-91.36"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="186.5,-19.25 100,-19.25 100,0 186.5,0 186.5,-19.25"/>
-<text text-anchor="middle" x="143.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge15_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge15_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.38,-63.58C51.32,-53.66 70.75,-38.57 89.5,-28.62 92.68,-26.94 96.05,-25.34 99.47,-23.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.46,-27.22 108.42,-20.23 97.84,-20.73 100.46,-27.22"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00" target="_top" xlink:title="A function that preprocess the bad char table.">
-<polygon fill="white" stroke="#666666" points="340.5,-205.88 233,-205.88 233,-175.38 340.5,-175.38 340.5,-205.88"/>
-<text text-anchor="start" x="241" y="-192.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="286.75" y="-181.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_bad_char</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.41,-157.26C202.3,-161.73 216.5,-166.65 229.95,-171.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.51,-174.51 239.1,-174.47 230.8,-167.89 228.51,-174.51"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1" target="_top" xlink:title="A function that preprocess the good suffix thable.">
-<polygon fill="white" stroke="#666666" points="340.5,-156.88 233,-156.88 233,-126.38 340.5,-126.38 340.5,-156.88"/>
-<text text-anchor="start" x="241" y="-143.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="286.75" y="-132.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_good_suffix</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.34,-141.62C205.23,-141.62 213.43,-141.62 221.52,-141.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.32,-145.13 231.32,-141.63 221.32,-138.13 221.32,-145.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="480.25,-151.25 388.5,-151.25 388.5,-132 480.25,-132 480.25,-151.25"/>
-<text text-anchor="middle" x="434.38" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M334.23,-174.99C352.98,-168.68 374.42,-161.46 392.56,-155.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.57,-158.71 401.93,-152.2 391.34,-152.08 393.57,-158.71"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="481.75,-194.25 387,-194.25 387,-175 481.75,-175 481.75,-194.25"/>
-<text text-anchor="middle" x="434.38" y="-180.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.74,-188.44C352.08,-187.97 364.12,-187.48 375.63,-187"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="375.57,-190.51 385.42,-186.6 375.28,-183.52 375.57,-190.51"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge6_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge6_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.74,-135.1C352.57,-134.82 365.16,-134.8 377.12,-135.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="376.74,-138.52 386.83,-135.29 376.93,-131.53 376.74,-138.52"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge8_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.74,-148.15C352.57,-148.43 365.16,-148.45 377.12,-148.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="376.93,-151.72 386.83,-147.96 376.74,-144.73 376.93,-151.72"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge7_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge7_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.74,-157.27C356.44,-161.91 373.48,-166.94 388.61,-171.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="387.21,-174.64 397.79,-174.12 389.19,-167.93 387.21,-174.64"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge11_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge11_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.74,-103.93C362.96,-110.89 387.85,-119.64 406.23,-127.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.79,-130.29 415.36,-130.96 407.51,-123.84 404.79,-130.29"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge14_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge14_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M317.92,-108.37C335,-115.17 356.92,-122.88 377.06,-129.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="375.99,-132.6 386.57,-132.22 378.06,-125.92 375.99,-132.6"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="461.5,-108.25 407.25,-108.25 407.25,-89 461.5,-89 461.5,-108.25"/>
-<text text-anchor="middle" x="434.38" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge12_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge12_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.74,-94.81C358.8,-95.55 378.62,-96.37 395.28,-97.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="395.13,-100.55 405.27,-97.47 395.42,-93.56 395.13,-100.55"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="492.25,-71.25 376.5,-71.25 376.5,-52 492.25,-52 492.25,-71.25"/>
-<text text-anchor="middle" x="434.38" y="-57.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge13_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge13_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.74,-81.35C351.84,-78.98 363.6,-76.48 374.89,-74.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="375.44,-77.54 384.5,-72.03 373.99,-70.69 375.44,-77.54"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph_org.svg b/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph_org.svg
deleted file mode 100644
index 7eb33592b..000000000
--- a/d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph_org.svg
+++ /dev/null
@@ -1,251 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: and_test Pages: 1 -->
-<svg width="500pt" height="214pt"
- viewBox="0.00 0.00 500.25 213.88" 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 209.88)">
-<title>and_test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A test case in which we search for every appearance of the word &#39;and&#39;.">
-<polygon fill="#999999" stroke="#666666" points="53.5,-83.25 0,-83.25 0,-64 53.5,-64 53.5,-83.25"/>
-<text text-anchor="middle" x="26.75" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">and_test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8" target="_top" xlink:title="A function that initializes pattern.">
-<polygon fill="white" stroke="#666666" points="197,-156.88 89.5,-156.88 89.5,-126.38 197,-126.38 197,-156.88"/>
-<text text-anchor="start" x="97.5" y="-143.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="143.25" y="-132.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_pattern</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44.64,-83.66C60.79,-93.25 85.65,-108.01 106.23,-120.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="104.25,-123.13 114.64,-125.23 107.83,-117.11 104.25,-123.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a" target="_top" xlink:title="Check if pat is prefix of str.">
-<polygon fill="white" stroke="#666666" points="197,-67.88 89.5,-67.88 89.5,-37.38 197,-37.38 197,-67.88"/>
-<text text-anchor="start" x="97.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="143.25" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::is_prefix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge9_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge9_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.73,-68.86C61.07,-67.51 69.4,-65.99 77.94,-64.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.54,-67.87 87.74,-62.62 77.28,-60.98 78.54,-67.87"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738" target="_top" xlink:title="A function that implements Boyer&#45;Moore&#39;s algorithm.">
-<polygon fill="white" stroke="#666666" points="340.5,-107.88 233,-107.88 233,-77.38 340.5,-77.38 340.5,-107.88"/>
-<text text-anchor="start" x="241" y="-94.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="286.75" y="-83.12" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge10_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge10_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.91,-75.55C92.9,-78.42 167.46,-83.91 221.52,-87.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.99,-91.36 231.22,-88.61 221.5,-84.38 220.99,-91.36"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="186.5,-19.25 100,-19.25 100,0 186.5,0 186.5,-19.25"/>
-<text text-anchor="middle" x="143.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge15_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge15_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.38,-63.58C51.32,-53.66 70.75,-38.57 89.5,-28.62 92.68,-26.94 96.05,-25.34 99.47,-23.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.46,-27.22 108.42,-20.23 97.84,-20.73 100.46,-27.22"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00" target="_top" xlink:title="A function that preprocess the bad char table.">
-<polygon fill="white" stroke="#666666" points="340.5,-205.88 233,-205.88 233,-175.38 340.5,-175.38 340.5,-205.88"/>
-<text text-anchor="start" x="241" y="-192.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="286.75" y="-181.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_bad_char</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.41,-157.26C202.3,-161.73 216.5,-166.65 229.95,-171.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.51,-174.51 239.1,-174.47 230.8,-167.89 228.51,-174.51"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1" target="_top" xlink:title="A function that preprocess the good suffix thable.">
-<polygon fill="white" stroke="#666666" points="340.5,-156.88 233,-156.88 233,-126.38 340.5,-126.38 340.5,-156.88"/>
-<text text-anchor="start" x="241" y="-143.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="286.75" y="-132.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_good_suffix</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.34,-141.62C205.23,-141.62 213.43,-141.62 221.52,-141.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.32,-145.13 231.32,-141.63 221.32,-138.13 221.32,-145.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="480.25,-151.25 388.5,-151.25 388.5,-132 480.25,-132 480.25,-151.25"/>
-<text text-anchor="middle" x="434.38" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M334.23,-174.99C352.98,-168.68 374.42,-161.46 392.56,-155.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.57,-158.71 401.93,-152.2 391.34,-152.08 393.57,-158.71"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="481.75,-194.25 387,-194.25 387,-175 481.75,-175 481.75,-194.25"/>
-<text text-anchor="middle" x="434.38" y="-180.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.74,-188.44C352.08,-187.97 364.12,-187.48 375.63,-187"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="375.57,-190.51 385.42,-186.6 375.28,-183.52 375.57,-190.51"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge6_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge6_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.74,-135.1C352.57,-134.82 365.16,-134.8 377.12,-135.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="376.74,-138.52 386.83,-135.29 376.93,-131.53 376.74,-138.52"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge8_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.74,-148.15C352.57,-148.43 365.16,-148.45 377.12,-148.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="376.93,-151.72 386.83,-147.96 376.74,-144.73 376.93,-151.72"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge7_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge7_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.74,-157.27C356.44,-161.91 373.48,-166.94 388.61,-171.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="387.21,-174.64 397.79,-174.12 389.19,-167.93 387.21,-174.64"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge11_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge11_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.74,-103.93C362.96,-110.89 387.85,-119.64 406.23,-127.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.79,-130.29 415.36,-130.96 407.51,-123.84 404.79,-130.29"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge14_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge14_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M317.92,-108.37C335,-115.17 356.92,-122.88 377.06,-129.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="375.99,-132.6 386.57,-132.22 378.06,-125.92 375.99,-132.6"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="461.5,-108.25 407.25,-108.25 407.25,-89 461.5,-89 461.5,-108.25"/>
-<text text-anchor="middle" x="434.38" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge12_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge12_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.74,-94.81C358.8,-95.55 378.62,-96.37 395.28,-97.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="395.13,-100.55 405.27,-97.47 395.42,-93.56 395.13,-100.55"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="492.25,-71.25 376.5,-71.25 376.5,-52 492.25,-52 492.25,-71.25"/>
-<text text-anchor="middle" x="434.38" y="-57.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge13_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge13_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.74,-81.35C351.84,-78.98 363.6,-76.48 374.89,-74.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="375.44,-77.54 384.5,-72.03 373.99,-70.69 375.44,-77.54"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 3438ed78f..000000000
--- a/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,38 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,100,55,125"/>
-<area shape="rect" id="Node000002" href="$d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,100,153,125"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,110,88,110,88,115,55,115"/>
-<area shape="rect" id="Node000003" href="$d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9" title="A test case in which we search for every appearance of the word &#39;and&#39;." alt="" coords="201,74,272,100"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,104,185,96,186,101,154,109"/>
-<area shape="rect" id="Node000014" href="$d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2" title="A test case in which we search for every appearance of the word &#39;pat&#39;." alt="" coords="202,124,271,149"/>
-<area shape="poly" id="edge18_Node000002_Node000014" title=" " alt="" coords="154,115,188,123,187,128,153,120"/>
-<area shape="rect" id="Node000004" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8" title="A function that initializes pattern." alt="" coords="320,120,464,161"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="274,97,318,112,316,117,272,102"/>
-<area shape="rect" id="Node000009" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a" title="Check if pat is prefix of str." alt="" coords="320,5,464,46"/>
-<area shape="poly" id="edge11_Node000003_Node000009" title=" " alt="" coords="271,71,324,50,326,55,272,76"/>
-<area shape="rect" id="Node000010" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738" title="A function that implements Boyer&#45;Moore&#39;s algorithm." alt="" coords="320,187,464,227"/>
-<area shape="poly" id="edge12_Node000003_Node000010" title=" " alt="" coords="261,98,274,109,289,126,298,141,307,155,322,170,330,176,327,180,319,174,303,159,293,144,285,129,270,113,257,102"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="334,70,450,96"/>
-<area shape="poly" id="edge17_Node000003_Node000013" title=" " alt="" coords="273,83,319,82,319,88,273,89"/>
-<area shape="rect" id="Node000005" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00" title="A function that preprocess the bad char table." alt="" coords="517,52,660,93"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="452,117,513,96,514,101,454,122"/>
-<area shape="rect" id="Node000008" href="$d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1" title="A function that preprocess the good suffix thable." alt="" coords="517,117,660,158"/>
-<area shape="poly" id="edge7_Node000004_Node000008" title=" " alt="" coords="464,137,501,136,502,142,464,142"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="716,125,838,150"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="650,91,724,117,722,122,649,96"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="714,68,840,93"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="661,73,699,74,699,80,661,78"/>
-<area shape="poly" id="edge8_Node000008_Node000006" title=" " alt="" coords="661,144,701,144,701,149,661,149"/>
-<area shape="poly" id="edge10_Node000008_Node000006" title=" " alt="" coords="661,126,701,126,701,131,661,132"/>
-<area shape="poly" id="edge9_Node000008_Node000007" title=" " alt="" coords="657,114,717,96,719,101,659,119"/>
-<area shape="poly" id="edge13_Node000010_Node000006" title=" " alt="" coords="464,207,560,197,665,179,746,155,748,160,667,184,561,202,464,213"/>
-<area shape="poly" id="edge16_Node000010_Node000006" title=" " alt="" coords="463,188,560,174,665,155,701,147,702,152,667,160,561,179,464,193"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="553,257,625,282"/>
-<area shape="poly" id="edge14_Node000010_Node000011" title=" " alt="" coords="459,225,539,251,537,256,457,230"/>
-<area shape="rect" id="Node000012" 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="512,306,666,332"/>
-<area shape="poly" id="edge15_Node000010_Node000012" title=" " alt="" coords="418,226,461,260,513,293,524,298,522,303,510,297,457,264,415,230"/>
-<area shape="poly" id="edge19_Node000014_Node000004" title=" " alt="" coords="271,135,305,135,305,141,271,140"/>
-<area shape="poly" id="edge20_Node000014_Node000009" title=" " alt="" coords="257,121,270,110,294,82,303,70,319,56,324,52,327,56,322,60,307,73,298,86,274,114,261,125"/>
-<area shape="poly" id="edge21_Node000014_Node000010" title=" " alt="" coords="268,147,333,177,331,182,266,152"/>
-<area shape="poly" id="edge22_Node000014_Node000013" title=" " alt="" coords="270,122,337,99,339,104,272,127"/>
-</map>
diff --git a/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 937c40c2c..000000000
--- a/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c01f7d0f619a779c5be556c9694222ec
\ No newline at end of file
diff --git a/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index fae0ad110..000000000
--- a/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,424 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 253 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 634;
-var viewHeight = 253;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-174.25 0,-174.25 0,-155 37,-155 37,-174.25"/>
-<text text-anchor="middle" x="18.5" y="-160.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-174.25 73,-174.25 73,-155 110.75,-155 110.75,-174.25"/>
-<text text-anchor="middle" x="91.88" y="-160.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-164.62C44.55,-164.62 53.37,-164.62 61.69,-164.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-168.13 71.43,-164.63 61.43,-161.13 61.43,-168.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9" target="_top" xlink:title="A test case in which we search for every appearance of the word &#39;and&#39;.">
-<polygon fill="white" stroke="#666666" points="200.25,-193.25 146.75,-193.25 146.75,-174 200.25,-174 200.25,-193.25"/>
-<text text-anchor="middle" x="173.5" y="-179.75" font-family="Helvetica,sans-Serif" font-size="10.00">and_test</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.94,-168.94C118.22,-170.67 126.89,-172.74 135.39,-174.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.34,-178.12 144.88,-177.03 135.96,-171.31 134.34,-178.12"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2" target="_top" xlink:title="A test case in which we search for every appearance of the word &#39;pat&#39;.">
-<polygon fill="white" stroke="#666666" points="199.12,-156.25 147.88,-156.25 147.88,-137 199.12,-137 199.12,-156.25"/>
-<text text-anchor="middle" x="173.5" y="-142.75" font-family="Helvetica,sans-Serif" font-size="10.00">pat_test</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node14 -->
-<g id="edge18_Node000002_Node000014" class="edge">
-<title>Node2&#45;&gt;Node14</title>
-<g id="a_edge18_Node000002_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.94,-160.54C118.56,-158.82 127.7,-156.75 136.58,-154.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.1,-158.22 146.09,-152.6 135.56,-151.39 137.1,-158.22"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8" target="_top" xlink:title="A function that initializes pattern.">
-<polygon fill="white" stroke="#666666" points="343.75,-158.88 236.25,-158.88 236.25,-128.38 343.75,-128.38 343.75,-158.88"/>
-<text text-anchor="start" x="244.25" y="-145.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="290" y="-134.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_pattern</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M200.48,-174.55C210.38,-171.09 222.08,-167 233.68,-162.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="234.53,-166.36 242.82,-159.76 232.22,-159.75 234.53,-166.36"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a" target="_top" xlink:title="Check if pat is prefix of str.">
-<polygon fill="white" stroke="#666666" points="343.75,-244.88 236.25,-244.88 236.25,-214.38 343.75,-214.38 343.75,-244.88"/>
-<text text-anchor="start" x="244.25" y="-231.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="290" y="-220.12" font-family="Helvetica,sans-Serif" font-size="10.00">::is_prefix</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge11_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge11_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.63,-193.72C211.38,-198.44 225.8,-204.23 239.6,-209.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.99,-212.9 248.57,-213.38 240.6,-206.41 237.99,-212.9"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738" target="_top" xlink:title="A function that implements Boyer&#45;Moore&#39;s algorithm.">
-<polygon fill="white" stroke="#666666" points="343.75,-108.88 236.25,-108.88 236.25,-78.38 343.75,-78.38 343.75,-108.88"/>
-<text text-anchor="start" x="244.25" y="-95.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="290" y="-84.12" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node10 -->
-<g id="edge12_Node000003_Node000010" class="edge">
-<title>Node3&#45;&gt;Node10</title>
-<g id="a_edge12_Node000003_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.33,-173.67C193.75,-171.22 197.24,-168.48 200.25,-165.62 219.1,-147.77 216.1,-136 236.25,-119.62 238.15,-118.08 240.16,-116.6 242.23,-115.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.7,-118.39 250.38,-110.16 240.03,-112.43 243.7,-118.39"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="333.25,-196.25 246.75,-196.25 246.75,-177 333.25,-177 333.25,-196.25"/>
-<text text-anchor="middle" x="290" y="-182.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node13 -->
-<g id="edge17_Node000003_Node000013" class="edge">
-<title>Node3&#45;&gt;Node13</title>
-<g id="a_edge17_Node000003_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M200.48,-184.31C210.78,-184.58 223.03,-184.9 235.08,-185.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="234.9,-188.71 244.99,-185.47 235.09,-181.71 234.9,-188.71"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00" target="_top" xlink:title="A function that preprocess the bad char table.">
-<polygon fill="white" stroke="#666666" points="491.38,-209.88 383.88,-209.88 383.88,-179.38 491.38,-179.38 491.38,-209.88"/>
-<text text-anchor="start" x="391.88" y="-196.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="437.62" y="-185.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_bad_char</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M335.88,-159.34C350.2,-164.36 366.23,-169.97 381.21,-175.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.87,-178.46 390.46,-178.46 382.18,-171.85 379.87,-178.46"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1" target="_top" xlink:title="A function that preprocess the good suffix thable.">
-<polygon fill="white" stroke="#666666" points="491.38,-160.88 383.88,-160.88 383.88,-130.38 491.38,-130.38 491.38,-160.88"/>
-<text text-anchor="start" x="391.88" y="-147.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="437.62" y="-136.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_good_suffix</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.99,-144.35C353.12,-144.48 362.71,-144.61 372.11,-144.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="371.87,-148.24 381.92,-144.87 371.97,-141.24 371.87,-148.24"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="624.75,-155.25 533,-155.25 533,-136 624.75,-136 624.75,-155.25"/>
-<text text-anchor="middle" x="578.88" y="-141.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M483.07,-178.99C500.83,-172.74 521.11,-165.6 538.35,-159.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="539.48,-162.85 547.75,-156.22 537.16,-156.24 539.48,-162.85"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="626.25,-198.25 531.5,-198.25 531.5,-179 626.25,-179 626.25,-198.25"/>
-<text text-anchor="middle" x="578.88" y="-184.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M491.67,-192.34C500.96,-191.94 510.66,-191.52 520.07,-191.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="520,-194.62 529.84,-190.69 519.7,-187.63 520,-194.62"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge8_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge8_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M491.67,-139.05C501.39,-138.84 511.57,-138.82 521.39,-138.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="521.1,-142.48 531.19,-139.22 521.28,-135.48 521.1,-142.48"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge10_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge10_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M491.67,-152.2C501.39,-152.41 511.57,-152.43 521.39,-152.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="521.28,-155.77 531.19,-152.03 521.1,-148.77 521.28,-155.77"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge9_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge9_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M489.29,-161.27C504.16,-165.86 520.29,-170.84 534.65,-175.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.2,-178.49 543.79,-178.1 535.27,-171.81 533.2,-178.49"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node6 -->
-<g id="edge13_Node000010_Node000006" class="edge">
-<title>Node10&#45;&gt;Node6</title>
-<g id="a_edge13_Node000010_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.91,-91.36C385.42,-94.21 444.5,-101.77 495.5,-112.62 516.33,-117.06 539.6,-124.03 556.07,-130.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="554.36,-133.95 564.91,-134.95 557.28,-127.59 554.36,-133.95"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node6 -->
-<g id="edge16_Node000010_Node000006" class="edge">
-<title>Node10&#45;&gt;Node6</title>
-<g id="a_edge16_Node000010_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.91,-106.05C385.42,-112.21 444.5,-119.77 495.5,-130.62 504.1,-132.46 513.12,-134.72 521.91,-137.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="520.84,-140.35 531.4,-139.51 522.62,-133.58 520.84,-140.35"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="464.75,-56.25 410.5,-56.25 410.5,-37 464.75,-37 464.75,-56.25"/>
-<text text-anchor="middle" x="437.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge14_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge14_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M339.49,-77.97C359.09,-71.65 381.34,-64.47 399.6,-58.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="400.51,-61.96 408.95,-55.56 398.36,-55.3 400.51,-61.96"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="495.5,-19.25 379.75,-19.25 379.75,0 495.5,0 495.5,-19.25"/>
-<text text-anchor="middle" x="437.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node12 -->
-<g id="edge15_Node000010_Node000012" class="edge">
-<title>Node10&#45;&gt;Node12</title>
-<g id="a_edge15_Node000010_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.19,-78.09C325.27,-63.35 352.74,-41.45 379.75,-27.62 382.42,-26.26 385.22,-24.97 388.08,-23.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="389.1,-27.11 397.18,-20.26 386.59,-20.58 389.1,-27.11"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node4 -->
-<g id="edge19_Node000014_Node000004" class="edge">
-<title>Node14&#45;&gt;Node4</title>
-<g id="a_edge19_Node000014_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.34,-145.97C206.93,-145.78 215.64,-145.55 224.6,-145.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.58,-148.81 234.48,-145.05 224.4,-141.82 224.58,-148.81"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node9 -->
-<g id="edge20_Node000014_Node000009" class="edge">
-<title>Node14&#45;&gt;Node9</title>
-<g id="a_edge20_Node000014_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.21,-156.71C193.64,-159.15 197.16,-161.86 200.25,-164.62 218.32,-180.8 216.78,-191.17 236.25,-205.62 237.41,-206.49 238.6,-207.32 239.83,-208.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.94,-211.09 248.32,-213.21 241.53,-205.08 237.94,-211.09"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node10 -->
-<g id="edge21_Node000014_Node000010" class="edge">
-<title>Node14&#45;&gt;Node10</title>
-<g id="a_edge21_Node000014_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M196.31,-136.53C210.06,-130.16 228.32,-121.71 244.99,-114"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.13,-117.32 253.74,-109.95 243.19,-110.97 246.13,-117.32"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node13 -->
-<g id="edge22_Node000014_Node000013" class="edge">
-<title>Node14&#45;&gt;Node13</title>
-<g id="a_edge22_Node000014_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.34,-155.3C214.02,-160.43 232.93,-167.04 249.6,-172.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.14,-176.06 258.73,-176.05 250.45,-169.45 248.14,-176.06"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index c3621a827..000000000
--- a/d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,341 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="634pt" height="253pt"
- viewBox="0.00 0.00 634.25 252.88" 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 248.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-174.25 0,-174.25 0,-155 37,-155 37,-174.25"/>
-<text text-anchor="middle" x="18.5" y="-160.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-174.25 73,-174.25 73,-155 110.75,-155 110.75,-174.25"/>
-<text text-anchor="middle" x="91.88" y="-160.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-164.62C44.55,-164.62 53.37,-164.62 61.69,-164.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-168.13 71.43,-164.63 61.43,-161.13 61.43,-168.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9" target="_top" xlink:title="A test case in which we search for every appearance of the word &#39;and&#39;.">
-<polygon fill="white" stroke="#666666" points="200.25,-193.25 146.75,-193.25 146.75,-174 200.25,-174 200.25,-193.25"/>
-<text text-anchor="middle" x="173.5" y="-179.75" font-family="Helvetica,sans-Serif" font-size="10.00">and_test</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.94,-168.94C118.22,-170.67 126.89,-172.74 135.39,-174.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.34,-178.12 144.88,-177.03 135.96,-171.31 134.34,-178.12"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2" target="_top" xlink:title="A test case in which we search for every appearance of the word &#39;pat&#39;.">
-<polygon fill="white" stroke="#666666" points="199.12,-156.25 147.88,-156.25 147.88,-137 199.12,-137 199.12,-156.25"/>
-<text text-anchor="middle" x="173.5" y="-142.75" font-family="Helvetica,sans-Serif" font-size="10.00">pat_test</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node14 -->
-<g id="edge18_Node000002_Node000014" class="edge">
-<title>Node2&#45;&gt;Node14</title>
-<g id="a_edge18_Node000002_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.94,-160.54C118.56,-158.82 127.7,-156.75 136.58,-154.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.1,-158.22 146.09,-152.6 135.56,-151.39 137.1,-158.22"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8" target="_top" xlink:title="A function that initializes pattern.">
-<polygon fill="white" stroke="#666666" points="343.75,-158.88 236.25,-158.88 236.25,-128.38 343.75,-128.38 343.75,-158.88"/>
-<text text-anchor="start" x="244.25" y="-145.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="290" y="-134.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_pattern</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M200.48,-174.55C210.38,-171.09 222.08,-167 233.68,-162.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="234.53,-166.36 242.82,-159.76 232.22,-159.75 234.53,-166.36"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a" target="_top" xlink:title="Check if pat is prefix of str.">
-<polygon fill="white" stroke="#666666" points="343.75,-244.88 236.25,-244.88 236.25,-214.38 343.75,-214.38 343.75,-244.88"/>
-<text text-anchor="start" x="244.25" y="-231.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="290" y="-220.12" font-family="Helvetica,sans-Serif" font-size="10.00">::is_prefix</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge11_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge11_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.63,-193.72C211.38,-198.44 225.8,-204.23 239.6,-209.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.99,-212.9 248.57,-213.38 240.6,-206.41 237.99,-212.9"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738" target="_top" xlink:title="A function that implements Boyer&#45;Moore&#39;s algorithm.">
-<polygon fill="white" stroke="#666666" points="343.75,-108.88 236.25,-108.88 236.25,-78.38 343.75,-78.38 343.75,-108.88"/>
-<text text-anchor="start" x="244.25" y="-95.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="290" y="-84.12" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node10 -->
-<g id="edge12_Node000003_Node000010" class="edge">
-<title>Node3&#45;&gt;Node10</title>
-<g id="a_edge12_Node000003_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.33,-173.67C193.75,-171.22 197.24,-168.48 200.25,-165.62 219.1,-147.77 216.1,-136 236.25,-119.62 238.15,-118.08 240.16,-116.6 242.23,-115.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.7,-118.39 250.38,-110.16 240.03,-112.43 243.7,-118.39"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="333.25,-196.25 246.75,-196.25 246.75,-177 333.25,-177 333.25,-196.25"/>
-<text text-anchor="middle" x="290" y="-182.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node13 -->
-<g id="edge17_Node000003_Node000013" class="edge">
-<title>Node3&#45;&gt;Node13</title>
-<g id="a_edge17_Node000003_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M200.48,-184.31C210.78,-184.58 223.03,-184.9 235.08,-185.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="234.9,-188.71 244.99,-185.47 235.09,-181.71 234.9,-188.71"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00" target="_top" xlink:title="A function that preprocess the bad char table.">
-<polygon fill="white" stroke="#666666" points="491.38,-209.88 383.88,-209.88 383.88,-179.38 491.38,-179.38 491.38,-209.88"/>
-<text text-anchor="start" x="391.88" y="-196.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="437.62" y="-185.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_bad_char</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M335.88,-159.34C350.2,-164.36 366.23,-169.97 381.21,-175.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.87,-178.46 390.46,-178.46 382.18,-171.85 379.87,-178.46"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1" target="_top" xlink:title="A function that preprocess the good suffix thable.">
-<polygon fill="white" stroke="#666666" points="491.38,-160.88 383.88,-160.88 383.88,-130.38 491.38,-130.38 491.38,-160.88"/>
-<text text-anchor="start" x="391.88" y="-147.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="437.62" y="-136.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_good_suffix</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.99,-144.35C353.12,-144.48 362.71,-144.61 372.11,-144.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="371.87,-148.24 381.92,-144.87 371.97,-141.24 371.87,-148.24"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="624.75,-155.25 533,-155.25 533,-136 624.75,-136 624.75,-155.25"/>
-<text text-anchor="middle" x="578.88" y="-141.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M483.07,-178.99C500.83,-172.74 521.11,-165.6 538.35,-159.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="539.48,-162.85 547.75,-156.22 537.16,-156.24 539.48,-162.85"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="626.25,-198.25 531.5,-198.25 531.5,-179 626.25,-179 626.25,-198.25"/>
-<text text-anchor="middle" x="578.88" y="-184.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M491.67,-192.34C500.96,-191.94 510.66,-191.52 520.07,-191.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="520,-194.62 529.84,-190.69 519.7,-187.63 520,-194.62"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge8_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge8_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M491.67,-139.05C501.39,-138.84 511.57,-138.82 521.39,-138.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="521.1,-142.48 531.19,-139.22 521.28,-135.48 521.1,-142.48"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge10_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge10_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M491.67,-152.2C501.39,-152.41 511.57,-152.43 521.39,-152.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="521.28,-155.77 531.19,-152.03 521.1,-148.77 521.28,-155.77"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge9_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge9_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M489.29,-161.27C504.16,-165.86 520.29,-170.84 534.65,-175.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.2,-178.49 543.79,-178.1 535.27,-171.81 533.2,-178.49"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node6 -->
-<g id="edge13_Node000010_Node000006" class="edge">
-<title>Node10&#45;&gt;Node6</title>
-<g id="a_edge13_Node000010_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.91,-91.36C385.42,-94.21 444.5,-101.77 495.5,-112.62 516.33,-117.06 539.6,-124.03 556.07,-130.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="554.36,-133.95 564.91,-134.95 557.28,-127.59 554.36,-133.95"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node6 -->
-<g id="edge16_Node000010_Node000006" class="edge">
-<title>Node10&#45;&gt;Node6</title>
-<g id="a_edge16_Node000010_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.91,-106.05C385.42,-112.21 444.5,-119.77 495.5,-130.62 504.1,-132.46 513.12,-134.72 521.91,-137.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="520.84,-140.35 531.4,-139.51 522.62,-133.58 520.84,-140.35"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="464.75,-56.25 410.5,-56.25 410.5,-37 464.75,-37 464.75,-56.25"/>
-<text text-anchor="middle" x="437.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge14_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge14_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M339.49,-77.97C359.09,-71.65 381.34,-64.47 399.6,-58.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="400.51,-61.96 408.95,-55.56 398.36,-55.3 400.51,-61.96"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="495.5,-19.25 379.75,-19.25 379.75,0 495.5,0 495.5,-19.25"/>
-<text text-anchor="middle" x="437.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node12 -->
-<g id="edge15_Node000010_Node000012" class="edge">
-<title>Node10&#45;&gt;Node12</title>
-<g id="a_edge15_Node000010_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.19,-78.09C325.27,-63.35 352.74,-41.45 379.75,-27.62 382.42,-26.26 385.22,-24.97 388.08,-23.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="389.1,-27.11 397.18,-20.26 386.59,-20.58 389.1,-27.11"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node4 -->
-<g id="edge19_Node000014_Node000004" class="edge">
-<title>Node14&#45;&gt;Node4</title>
-<g id="a_edge19_Node000014_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.34,-145.97C206.93,-145.78 215.64,-145.55 224.6,-145.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.58,-148.81 234.48,-145.05 224.4,-141.82 224.58,-148.81"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node9 -->
-<g id="edge20_Node000014_Node000009" class="edge">
-<title>Node14&#45;&gt;Node9</title>
-<g id="a_edge20_Node000014_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.21,-156.71C193.64,-159.15 197.16,-161.86 200.25,-164.62 218.32,-180.8 216.78,-191.17 236.25,-205.62 237.41,-206.49 238.6,-207.32 239.83,-208.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.94,-211.09 248.32,-213.21 241.53,-205.08 237.94,-211.09"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node10 -->
-<g id="edge21_Node000014_Node000010" class="edge">
-<title>Node14&#45;&gt;Node10</title>
-<g id="a_edge21_Node000014_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M196.31,-136.53C210.06,-130.16 228.32,-121.71 244.99,-114"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.13,-117.32 253.74,-109.95 243.19,-110.97 246.13,-117.32"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node13 -->
-<g id="edge22_Node000014_Node000013" class="edge">
-<title>Node14&#45;&gt;Node13</title>
-<g id="a_edge22_Node000014_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.34,-155.3C214.02,-160.43 232.93,-167.04 249.6,-172.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.14,-176.06 258.73,-176.05 250.45,-169.45 248.14,-176.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/db2/boyer__moore_8cpp_source.html b/d3/db2/boyer__moore_8cpp_source.html
new file mode 100644
index 000000000..243308f11
--- /dev/null
+++ b/d3/db2/boyer__moore_8cpp_source.html
@@ -0,0 +1,334 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: strings/boyer_moore.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/db2/boyer__moore_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">boyer_moore.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/db2/boyer__moore_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="preprocessor">#include &lt;climits&gt;</span>   </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="preprocessor">#include &lt;cstring&gt;</span>   </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="preprocessor">#include &lt;string&gt;</span>    </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd">   52</a></span><span class="preprocessor">#define APLHABET_SIZE CHAR_MAX  </span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="foldopen" id="foldopen00058" data-start="{" data-end="}">
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../df/dcb/namespacestrings.html">   58</a></span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/dcb/namespacestrings.html">strings</a> {</div>
+<div class="foldopen" id="foldopen00065" data-start="{" data-end="}">
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html">   65</a></span><span class="keyword">namespace </span>boyer_moore {</div>
+<div class="foldopen" id="foldopen00070" data-start="{" data-end="};">
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"><a class="line" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">   70</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">pattern</a> {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::string pat;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    std::vector&lt;size_t&gt;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645">   74</a></span>        <a class="code hl_variable" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645">bad_char</a>;  </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    std::vector&lt;size_t&gt;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"><a class="line" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e">   78</a></span>        <a class="code hl_variable" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e">good_suffix</a>;  </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>};</div>
+</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="foldopen" id="foldopen00089" data-start="{" data-end="}">
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"><a class="line" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1">   89</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1">init_good_suffix</a>(<span class="keyword">const</span> std::string&amp; str, std::vector&lt;size_t&gt;&amp; arg) {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    arg.resize(str.size() + 1, 0);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="comment">// border_pos[i] - the index of the longest proper suffix of str[i..] which</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="comment">// is also a proper prefix.</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    std::vector&lt;size_t&gt; border_pos(str.size() + 1, 0);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="keywordtype">size_t</span> current_char = str.length();</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keywordtype">size_t</span> border_index = str.length() + 1;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    border_pos[current_char] = border_index;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="keywordflow">while</span> (current_char &gt; 0) {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        <span class="keywordflow">while</span> (border_index &lt;= str.length() &amp;&amp;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>               str[current_char - 1] != str[border_index - 1]) {</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>            <span class="keywordflow">if</span> (arg[border_index] == 0) {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>                arg[border_index] = border_index - current_char;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>            }</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            border_index = border_pos[border_index];</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        }</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        current_char--;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        border_index--;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        border_pos[current_char] = border_index;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    }</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="keywordtype">size_t</span> largest_border_index = border_pos[0];</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; str.size(); i++) {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        <span class="keywordflow">if</span> (arg[i] == 0) {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>            arg[i] = largest_border_index;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        }</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        <span class="comment">// If we go pass the largest border we find the next one as we iterate</span></div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        <span class="keywordflow">if</span> (i == largest_border_index) {</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>            largest_border_index = border_pos[largest_border_index];</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        }</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    }</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>}</div>
+</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="foldopen" id="foldopen00138" data-start="{" data-end="}">
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"><a class="line" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00">  138</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00">init_bad_char</a>(<span class="keyword">const</span> std::string&amp; str, std::vector&lt;size_t&gt;&amp; arg) {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    arg.resize(<a class="code hl_define" href="../../d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd">APLHABET_SIZE</a>, str.length());</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span> </div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; str.length(); i++) {</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        arg[str[i]] = str.length() - i - 1;</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    }</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>}</div>
+</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span> </div>
+<div class="foldopen" id="foldopen00153" data-start="{" data-end="}">
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"><a class="line" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8">  153</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8">init_pattern</a>(<span class="keyword">const</span> std::string&amp; str, <a class="code hl_struct" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">pattern</a>&amp; arg) {</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    arg.pat = str;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    <a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00">init_bad_char</a>(str, arg.<a class="code hl_variable" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645">bad_char</a>);</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    <a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1">init_good_suffix</a>(str, arg.<a class="code hl_variable" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e">good_suffix</a>);</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00165" data-start="{" data-end="}">
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"><a class="line" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738">  165</a></span>std::vector&lt;size_t&gt; <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>(<span class="keyword">const</span> std::string&amp; str, <span class="keyword">const</span> <a class="code hl_struct" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">pattern</a>&amp; arg) {</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    <span class="keywordtype">size_t</span> index_position = arg.pat.size() - 1;</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    std::vector&lt;size_t&gt; index_storage;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span> </div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    <span class="keywordflow">while</span> (index_position &lt; str.length()) {</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        <span class="keywordtype">size_t</span> index_string = index_position;</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>        <span class="keywordtype">int</span> index_pattern = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(arg.pat.size()) - 1;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span> </div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>        <span class="keywordflow">while</span> (index_pattern &gt;= 0 &amp;&amp;</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>               str[index_string] == arg.pat[index_pattern]) {</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>            --index_pattern;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>            --index_string;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        }</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        <span class="keywordflow">if</span> (index_pattern &lt; 0) {</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>            index_storage.push_back(index_position - arg.pat.length() + 1);</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>            index_position += arg.<a class="code hl_variable" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e">good_suffix</a>[0];</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>            index_position += std::max(arg.<a class="code hl_variable" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645">bad_char</a>[str[index_string]],</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>                                       arg.<a class="code hl_variable" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e">good_suffix</a>[index_pattern + 1]);</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        }</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    }</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span> </div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    <span class="keywordflow">return</span> index_storage;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>}</div>
+</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span> </div>
+<div class="foldopen" id="foldopen00200" data-start="{" data-end="}">
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"><a class="line" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a">  200</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a">is_prefix</a>(<span class="keyword">const</span> <span class="keywordtype">char</span>* str, <span class="keyword">const</span> <span class="keywordtype">char</span>* pat, <span class="keywordtype">size_t</span> len) {</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    <span class="keywordflow">if</span> (strlen(str) &lt; len) {</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    }</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span> </div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; len; i++) {</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>        <span class="keywordflow">if</span> (str[i] != pat[i]) {</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>        }</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    }</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span> </div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>}</div>
+</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>}  <span class="comment">// namespace boyer_moore</span></div>
+</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>}  <span class="comment">// namespace strings</span></div>
+</div>
+<div class="foldopen" id="foldopen00220" data-start="{" data-end="}">
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"><a class="line" href="../../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9">  220</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9">and_test</a>(<span class="keyword">const</span> <span class="keywordtype">char</span>* text) {</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    <a class="code hl_struct" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">strings::boyer_moore::pattern</a> ands;</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    <a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8">strings::boyer_moore::init_pattern</a>(<span class="stringliteral">&quot;and&quot;</span>, ands);</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    std::vector&lt;size_t&gt; indexes = <a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738">strings::boyer_moore::search</a>(text, ands);</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span> </div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    assert(indexes.size() == 2);</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    assert(<a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a">strings::boyer_moore::is_prefix</a>(text + indexes[0], <span class="stringliteral">&quot;and&quot;</span>, 3));</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    assert(<a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a">strings::boyer_moore::is_prefix</a>(text + indexes[1], <span class="stringliteral">&quot;and&quot;</span>, 3));</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>}</div>
+</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span> </div>
+<div class="foldopen" id="foldopen00235" data-start="{" data-end="}">
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"><a class="line" href="../../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2">  235</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2">pat_test</a>(<span class="keyword">const</span> <span class="keywordtype">char</span>* text) {</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    <a class="code hl_struct" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">strings::boyer_moore::pattern</a> pat;</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    <a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8">strings::boyer_moore::init_pattern</a>(<span class="stringliteral">&quot;pat&quot;</span>, pat);</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    std::vector&lt;size_t&gt; indexes = <a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738">strings::boyer_moore::search</a>(text, pat);</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span> </div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    assert(indexes.size() == 6);</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span> </div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; currentIndex : indexes) {</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>        assert(<a class="code hl_function" href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a">strings::boyer_moore::is_prefix</a>(text + currentIndex, <span class="stringliteral">&quot;pat&quot;</span>, 3));</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    }</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00250" data-start="{" data-end="}">
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"><a class="line" href="../../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">  250</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    <span class="keyword">const</span> <span class="keywordtype">char</span>* text =</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>        <span class="stringliteral">&quot;When pat Mr. and Mrs. pat Dursley woke up on the dull, gray  \</span></div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span><span class="stringliteral">                            Tuesday our story starts, \</span></div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span><span class="stringliteral">                there was nothing about pat the cloudy sky outside to pat suggest that\</span></div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span><span class="stringliteral">                        strange and \</span></div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span><span class="stringliteral">                    mysterious things would pat soon be happening all pat over the \</span></div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span><span class="stringliteral">                        country.&quot;</span>;</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span> </div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>    <a class="code hl_function" href="../../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9">and_test</a>(text);</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>    <a class="code hl_function" href="../../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2">pat_test</a>(text);</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span> </div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>}</div>
+</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span> </div>
+<div class="foldopen" id="foldopen00269" data-start="{" data-end="}">
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"><a class="line" href="../../d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  269</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    <a class="code hl_function" href="../../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>}</div>
+</div>
+<div class="ttc" id="aboyer__moore_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d3/db2/boyer__moore_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> <a href="#l00250">boyer_moore.cpp:250</a></div></div>
+<div class="ttc" id="aboyer__moore_8cpp_html_a77c872c08612d7b8861ba13bc9881cbd"><div class="ttname"><a href="../../d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd">APLHABET_SIZE</a></div><div class="ttdeci">#define APLHABET_SIZE</div><div class="ttdoc">number of symbols in the alphabet we use</div><div class="ttdef"><b>Definition</b> <a href="#l00052">boyer_moore.cpp:52</a></div></div>
+<div class="ttc" id="aboyer__moore_8cpp_html_ac8fac0dd4b19973da103a434143a16d2"><div class="ttname"><a href="../../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2">pat_test</a></div><div class="ttdeci">void pat_test(const char *text)</div><div class="ttdoc">A test case in which we search for every appearance of the word 'pat'.</div><div class="ttdef"><b>Definition</b> <a href="#l00235">boyer_moore.cpp:235</a></div></div>
+<div class="ttc" id="aboyer__moore_8cpp_html_acb8f69e7901ee7459d98bd4b9dda79d9"><div class="ttname"><a href="../../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9">and_test</a></div><div class="ttdeci">void and_test(const char *text)</div><div class="ttdoc">A test case in which we search for every appearance of the word 'and'.</div><div class="ttdef"><b>Definition</b> <a href="#l00220">boyer_moore.cpp:220</a></div></div>
+<div class="ttc" id="aboyer__moore_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00269">boyer_moore.cpp:269</a></div></div>
+<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> <a href="../../df/dd5/binary__search_8cpp_source.html#l00047">binary_search.cpp:47</a></div></div>
+<div class="ttc" id="anamespacestrings_1_1boyer__moore_html_a056122c8fe8fb0f5fca6428d3f7b5c3a"><div class="ttname"><a href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a">strings::boyer_moore::is_prefix</a></div><div class="ttdeci">bool is_prefix(const char *str, const char *pat, size_t len)</div><div class="ttdoc">Check if pat is prefix of str.</div><div class="ttdef"><b>Definition</b> <a href="#l00200">boyer_moore.cpp:200</a></div></div>
+<div class="ttc" id="anamespacestrings_1_1boyer__moore_html_a0b165af1dc341289fd705be4c67728f8"><div class="ttname"><a href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8">strings::boyer_moore::init_pattern</a></div><div class="ttdeci">void init_pattern(const std::string &amp;str, pattern &amp;arg)</div><div class="ttdoc">A function that initializes pattern.</div><div class="ttdef"><b>Definition</b> <a href="#l00153">boyer_moore.cpp:153</a></div></div>
+<div class="ttc" id="anamespacestrings_1_1boyer__moore_html_a15703b553faed0d28202c10808cf9738"><div class="ttname"><a href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738">strings::boyer_moore::search</a></div><div class="ttdeci">std::vector&lt; size_t &gt; search(const std::string &amp;str, const pattern &amp;arg)</div><div class="ttdoc">A function that implements Boyer-Moore's algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00165">boyer_moore.cpp:165</a></div></div>
+<div class="ttc" id="anamespacestrings_1_1boyer__moore_html_a2f6688c9bb3e692297a3aa09cebc1c00"><div class="ttname"><a href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00">strings::boyer_moore::init_bad_char</a></div><div class="ttdeci">void init_bad_char(const std::string &amp;str, std::vector&lt; size_t &gt; &amp;arg)</div><div class="ttdoc">A function that preprocess the bad char table.</div><div class="ttdef"><b>Definition</b> <a href="#l00138">boyer_moore.cpp:138</a></div></div>
+<div class="ttc" id="anamespacestrings_1_1boyer__moore_html_aa709cf7fca02b7d3e1888423d5f739a1"><div class="ttname"><a href="../../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1">strings::boyer_moore::init_good_suffix</a></div><div class="ttdeci">void init_good_suffix(const std::string &amp;str, std::vector&lt; size_t &gt; &amp;arg)</div><div class="ttdoc">A function that preprocess the good suffix thable.</div><div class="ttdef"><b>Definition</b> <a href="#l00089">boyer_moore.cpp:89</a></div></div>
+<div class="ttc" id="anamespacestrings_html"><div class="ttname"><a href="../../df/dcb/namespacestrings.html">strings</a></div><div class="ttdoc">String algorithms.</div><div class="ttdef"><b>Definition</b> <a href="#l00058">boyer_moore.cpp:58</a></div></div>
+<div class="ttc" id="astructstrings_1_1boyer__moore_1_1pattern_html"><div class="ttname"><a href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">strings::boyer_moore::pattern</a></div><div class="ttdoc">A structure representing all the data we need to search the preprocessed pattern in text.</div><div class="ttdef"><b>Definition</b> <a href="#l00070">boyer_moore.cpp:70</a></div></div>
+<div class="ttc" id="astructstrings_1_1boyer__moore_1_1pattern_html_a3d62f615a0171a5d77e7018f704f3a7e"><div class="ttname"><a href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e">strings::boyer_moore::pattern::good_suffix</a></div><div class="ttdeci">std::vector&lt; size_t &gt; good_suffix</div><div class="ttdef"><b>Definition</b> <a href="#l00078">boyer_moore.cpp:78</a></div></div>
+<div class="ttc" id="astructstrings_1_1boyer__moore_1_1pattern_html_ae5ca7abf15e939eddc80542131de3645"><div class="ttname"><a href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645">strings::boyer_moore::pattern::bad_char</a></div><div class="ttdeci">std::vector&lt; size_t &gt; bad_char</div><div class="ttdef"><b>Definition</b> <a href="#l00074">boyer_moore.cpp:74</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_73a3cc5065b223eb41b02873c0e19f0e.html">strings</a></li><li class="navelem"><a class="el" href="../../d3/db2/boyer__moore_8cpp.html">boyer_moore.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/db3/lru__cache_8cpp.html b/d3/db3/lru__cache_8cpp.html
index 397857c53..669936e4e 100644
--- a/d3/db3/lru__cache_8cpp.html
+++ b/d3/db3/lru__cache_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/lru_cache.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/lru_cache.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for lru_cache.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d6d/lru__cache_8cpp__incl.svg" width="452" height="111"><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">
+</div>
+<p><a href="../../d3/db3/lru__cache_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html">others::lru_cache::LRUCache</a></td></tr>
@@ -194,6 +213,8 @@ Data Structure used</h2>
 <li>If present, we shift that page from its current location to beginning of the cache and update the address in hash map for that page.</li>
 </ul>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/foo290" target="_blank">Nitin Sharma</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html">lru_cache.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a24d21a345ed06f7fba6919718cf3e058" name="a24d21a345ed06f7fba6919718cf3e058"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a24d21a345ed06f7fba6919718cf3e058">&#9670;&#160;</a></span>log()</h2>
@@ -220,18 +241,13 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html#l00149">149</a> of file <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html">lru_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  149</span>                {</div>
 <div class="line"><span class="lineno">  150</span>    <span class="comment">// It&#39;s just to avoid writing cout and endl</span></div>
-<div class="line"><span class="lineno">  151</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;[TESTS] : ---&gt; &quot;</span> &lt;&lt; msg &lt;&lt; <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">  151</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;[TESTS] : ---&gt; &quot;</span> &lt;&lt; msg &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  152</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="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><!-- 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="../../d3/db3/lru__cache_8cpp_a24d21a345ed06f7fba6919718cf3e058_cgraph.svg" width="227" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -251,6 +267,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html#l00252">252</a> of file <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html">lru_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  252</span>           {</div>
 <div class="line"><span class="lineno">  253</span>    <a class="code hl_function" href="#a6a3be6d8871b1f5dc03688da8f3ee9e6">lru_tests::run_tests</a>();</div>
 <div class="line"><span class="lineno">  254</span> </div>
@@ -265,18 +283,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  263</span> </div>
 <div class="line"><span class="lineno">  264</span>    cache.display();</div>
 <div class="line"><span class="lineno">  265</span> </div>
-<div class="line"><span class="lineno">  266</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hits: &quot;</span> &lt;&lt; cache.getHits()</div>
-<div class="line"><span class="lineno">  267</span>              &lt;&lt; <span class="stringliteral">&quot; Miss: &quot;</span> &lt;&lt; cache.getPageFault() &lt;&lt; <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">  266</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hits: &quot;</span> &lt;&lt; cache.getHits()</div>
+<div class="line"><span class="lineno">  267</span>              &lt;&lt; <span class="stringliteral">&quot; Miss: &quot;</span> &lt;&lt; cache.getPageFault() &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  268</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  269</span>}</div>
-<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html"><div class="ttname"><a href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html">others::lru_cache::LRUCache</a></div><div class="ttdoc">LRU cache class.</div><div class="ttdef"><b>Definition</b> lru_cache.cpp:68</div></div>
-<div class="ttc" id="alru__cache_8cpp_html_a6a3be6d8871b1f5dc03688da8f3ee9e6"><div class="ttname"><a href="#a6a3be6d8871b1f5dc03688da8f3ee9e6">lru_tests::run_tests</a></div><div class="ttdeci">static void run_tests()</div><div class="ttdoc">A function to invoke all test cases.</div><div class="ttdef"><b>Definition</b> lru_cache.cpp:239</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/db3/lru__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="494" height="520"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html"><div class="ttname"><a href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html">others::lru_cache::LRUCache</a></div><div class="ttdoc">LRU cache class.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db3/lru__cache_8cpp_source.html#l00068">lru_cache.cpp:68</a></div></div>
+<div class="ttc" id="alru__cache_8cpp_html_a6a3be6d8871b1f5dc03688da8f3ee9e6"><div class="ttname"><a href="#a6a3be6d8871b1f5dc03688da8f3ee9e6">lru_tests::run_tests</a></div><div class="ttdeci">static void run_tests()</div><div class="ttdoc">A function to invoke all test cases.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db3/lru__cache_8cpp_source.html#l00239">lru_cache.cpp:239</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6a3be6d8871b1f5dc03688da8f3ee9e6" name="a6a3be6d8871b1f5dc03688da8f3ee9e6"></a>
@@ -304,23 +317,20 @@ Here is the call graph for this function:</div>
 
 <p>A function to invoke all test cases. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html#l00239">239</a> of file <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html">lru_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  239</span>                        {</div>
 <div class="line"><span class="lineno">  240</span>    <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a>();</div>
 <div class="line"><span class="lineno">  241</span>    <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a>();</div>
 <div class="line"><span class="lineno">  242</span>    <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a>();</div>
-<div class="line"><span class="lineno">  243</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">log</a>(<span class="stringliteral">&quot;&quot;</span>);</div>
-<div class="line"><span class="lineno">  244</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">log</a>(<span class="stringliteral">&quot;TESTS COMPLETED!&quot;</span>);</div>
+<div class="line"><span class="lineno">  243</span>    <a class="code hl_function" href="#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;&quot;</span>);</div>
+<div class="line"><span class="lineno">  244</span>    <a class="code hl_function" href="#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;TESTS COMPLETED!&quot;</span>);</div>
 <div class="line"><span class="lineno">  245</span>}</div>
-<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:505</div></div>
-<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:549</div></div>
-<div class="ttc" id="aheavy__light__decomposition_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:592</div></div>
-<div class="ttc" id="alog_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/log.html">std::log</a></div><div class="ttdeci">T log(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d3/db3/lru__cache_8cpp_a6a3be6d8871b1f5dc03688da8f3ee9e6_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00505">heavy_light_decomposition.cpp:505</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00549">heavy_light_decomposition.cpp:549</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00592">heavy_light_decomposition.cpp:592</a></div></div>
+<div class="ttc" id="alru__cache_8cpp_html_a24d21a345ed06f7fba6919718cf3e058"><div class="ttname"><a href="#a24d21a345ed06f7fba6919718cf3e058">lru_tests::log</a></div><div class="ttdeci">void log(T msg)</div><div class="ttdoc">A function to print given message on console.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db3/lru__cache_8cpp_source.html#l00149">lru_cache.cpp:149</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6401e8f2d41d8cc9cd0e52ab381608d4" name="a6401e8f2d41d8cc9cd0e52ab381608d4"></a>
@@ -348,11 +358,13 @@ Here is the call graph for this function:</div>
 
 <p>A simple test case The assert statement will check expected hist and miss to resultant hits and miss. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html#l00160">160</a> of file <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html">lru_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  160</span>                     {</div>
 <div class="line"><span class="lineno">  161</span>    uint64_t expected_hits = 2;</div>
 <div class="line"><span class="lineno">  162</span>    uint64_t expected_pageFault = 4;</div>
 <div class="line"><span class="lineno">  163</span> </div>
-<div class="line"><span class="lineno">  164</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">log</a>(<span class="stringliteral">&quot;Running Test-1...&quot;</span>);</div>
+<div class="line"><span class="lineno">  164</span>    <a class="code hl_function" href="#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Running Test-1...&quot;</span>);</div>
 <div class="line"><span class="lineno">  165</span> </div>
 <div class="line"><span class="lineno">  166</span>    <a class="code hl_class" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html">others::lru_cache::LRUCache</a> cache(4);</div>
 <div class="line"><span class="lineno">  167</span>    cache.refer(1);</div>
@@ -362,18 +374,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  171</span>    cache.refer(4);</div>
 <div class="line"><span class="lineno">  172</span>    cache.refer(5);</div>
 <div class="line"><span class="lineno">  173</span> </div>
-<div class="line"><span class="lineno">  174</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">log</a>(<span class="stringliteral">&quot;Checking assert statement...&quot;</span>);</div>
+<div class="line"><span class="lineno">  174</span>    <a class="code hl_function" href="#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Checking assert statement...&quot;</span>);</div>
 <div class="line"><span class="lineno">  175</span>    assert(cache.getHits() == expected_hits &amp;&amp;</div>
 <div class="line"><span class="lineno">  176</span>           cache.getPageFault() == expected_pageFault);</div>
-<div class="line"><span class="lineno">  177</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">log</a>(<span class="stringliteral">&quot;Assert successful!&quot;</span>);</div>
-<div class="line"><span class="lineno">  178</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">log</a>(<span class="stringliteral">&quot;Test-1 complete!&quot;</span>);</div>
+<div class="line"><span class="lineno">  177</span>    <a class="code hl_function" href="#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Assert successful!&quot;</span>);</div>
+<div class="line"><span class="lineno">  178</span>    <a class="code hl_function" href="#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Test-1 complete!&quot;</span>);</div>
 <div class="line"><span class="lineno">  179</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/db3/lru__cache_8cpp_a6401e8f2d41d8cc9cd0e52ab381608d4_cgraph.svg" width="559" height="463"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4b02e288a407876a8d6024f98a2a25ec" name="a4b02e288a407876a8d6024f98a2a25ec"></a>
@@ -401,11 +408,13 @@ Here is the call graph for this function:</div>
 
 <p>A test case contains hits more than cache size The assert statement will check expected hist and miss to resultant hits and miss. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html#l00187">187</a> of file <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html">lru_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  187</span>                     {</div>
 <div class="line"><span class="lineno">  188</span>    uint64_t expected_hits = 4;</div>
 <div class="line"><span class="lineno">  189</span>    uint64_t expected_pageFault = 2;</div>
 <div class="line"><span class="lineno">  190</span> </div>
-<div class="line"><span class="lineno">  191</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">log</a>(<span class="stringliteral">&quot;Running Test-2...&quot;</span>);</div>
+<div class="line"><span class="lineno">  191</span>    <a class="code hl_function" href="#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Running Test-2...&quot;</span>);</div>
 <div class="line"><span class="lineno">  192</span> </div>
 <div class="line"><span class="lineno">  193</span>    <a class="code hl_class" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html">others::lru_cache::LRUCache</a> cache(4);</div>
 <div class="line"><span class="lineno">  194</span>    cache.refer(1);</div>
@@ -415,18 +424,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  198</span>    cache.refer(1);</div>
 <div class="line"><span class="lineno">  199</span>    cache.refer(5);</div>
 <div class="line"><span class="lineno">  200</span> </div>
-<div class="line"><span class="lineno">  201</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">log</a>(<span class="stringliteral">&quot;Checking assert statement...&quot;</span>);</div>
+<div class="line"><span class="lineno">  201</span>    <a class="code hl_function" href="#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Checking assert statement...&quot;</span>);</div>
 <div class="line"><span class="lineno">  202</span>    assert(cache.getHits() == expected_hits &amp;&amp;</div>
 <div class="line"><span class="lineno">  203</span>           cache.getPageFault() == expected_pageFault);</div>
-<div class="line"><span class="lineno">  204</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">log</a>(<span class="stringliteral">&quot;Assert successful!&quot;</span>);</div>
-<div class="line"><span class="lineno">  205</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">log</a>(<span class="stringliteral">&quot;Test-2 complete!&quot;</span>);</div>
+<div class="line"><span class="lineno">  204</span>    <a class="code hl_function" href="#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Assert successful!&quot;</span>);</div>
+<div class="line"><span class="lineno">  205</span>    <a class="code hl_function" href="#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Test-2 complete!&quot;</span>);</div>
 <div class="line"><span class="lineno">  206</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/db3/lru__cache_8cpp_a4b02e288a407876a8d6024f98a2a25ec_cgraph.svg" width="559" height="463"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a01ec21fc91ddafd964ae2035ba7892c0" name="a01ec21fc91ddafd964ae2035ba7892c0"></a>
@@ -454,11 +458,13 @@ Here is the call graph for this function:</div>
 
 <p>A simple test case The assert statement will check expected hist and miss to resultant hits and miss. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html#l00214">214</a> of file <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html">lru_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  214</span>                     {</div>
 <div class="line"><span class="lineno">  215</span>    uint64_t expected_hits = 1;</div>
 <div class="line"><span class="lineno">  216</span>    uint64_t expected_pageFault = 5;</div>
 <div class="line"><span class="lineno">  217</span> </div>
-<div class="line"><span class="lineno">  218</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">log</a>(<span class="stringliteral">&quot;Running Test-3...&quot;</span>);</div>
+<div class="line"><span class="lineno">  218</span>    <a class="code hl_function" href="#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Running Test-3...&quot;</span>);</div>
 <div class="line"><span class="lineno">  219</span> </div>
 <div class="line"><span class="lineno">  220</span>    <a class="code hl_class" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html">others::lru_cache::LRUCache</a> cache(4);</div>
 <div class="line"><span class="lineno">  221</span>    cache.refer(1);</div>
@@ -468,18 +474,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  225</span>    cache.refer(5);</div>
 <div class="line"><span class="lineno">  226</span>    cache.refer(5);</div>
 <div class="line"><span class="lineno">  227</span> </div>
-<div class="line"><span class="lineno">  228</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">log</a>(<span class="stringliteral">&quot;Checking assert statement...&quot;</span>);</div>
+<div class="line"><span class="lineno">  228</span>    <a class="code hl_function" href="#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Checking assert statement...&quot;</span>);</div>
 <div class="line"><span class="lineno">  229</span>    assert(cache.getHits() == expected_hits &amp;&amp;</div>
 <div class="line"><span class="lineno">  230</span>           cache.getPageFault() == expected_pageFault);</div>
-<div class="line"><span class="lineno">  231</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">log</a>(<span class="stringliteral">&quot;Assert successful!&quot;</span>);</div>
-<div class="line"><span class="lineno">  232</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">log</a>(<span class="stringliteral">&quot;Test-3 complete!&quot;</span>);</div>
+<div class="line"><span class="lineno">  231</span>    <a class="code hl_function" href="#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Assert successful!&quot;</span>);</div>
+<div class="line"><span class="lineno">  232</span>    <a class="code hl_function" href="#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Test-3 complete!&quot;</span>);</div>
 <div class="line"><span class="lineno">  233</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.svg" width="559" height="463"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.map b/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.map
deleted file mode 100644
index cf9f79432..000000000
--- a/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.map
+++ /dev/null
@@ -1,28 +0,0 @@
-<map id="lru_tests::test_3" name="lru_tests::test_3">
-<area shape="rect" id="Node000001" title="A simple test case The assert statement will check expected hist and miss to resultant hits and miss." alt="" coords="5,145,121,171"/>
-<area shape="poly" id="edge13_Node000001_Node000001" title=" " alt="" coords="31,146,25,137,28,127,42,121,63,119,86,121,98,128,96,132,84,126,63,124,43,126,32,131,30,136,35,143"/>
-<area shape="rect" id="Node000002" href="$d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933" title="A function to get page hits." alt="" coords="186,72,322,113"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="102,142,177,116,179,121,104,147"/>
-<area shape="rect" id="Node000003" href="$d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2" title="A function to get page fault." alt="" coords="169,138,340,178"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="121,156,153,156,153,161,121,161"/>
-<area shape="rect" id="Node000004" href="$d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602" title="Refer to a page, or request a page from memory." alt="" coords="190,203,319,244"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="104,169,179,195,177,200,102,174"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/back.html#" title=" " alt="" coords="420,5,521,31"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="318,203,338,188,351,170,358,152,361,115,364,78,371,59,386,40,405,28,408,32,390,44,376,62,369,79,366,116,363,153,356,173,342,192,321,208"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/begin.html#" title=" " alt="" coords="419,55,522,80"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="318,202,338,188,355,164,361,140,367,115,375,102,386,89,403,79,406,83,390,94,379,105,372,117,366,141,360,166,342,192,321,207"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/end.html#" title=" " alt="" coords="388,104,553,130"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="316,200,338,188,353,176,362,163,371,151,387,139,395,134,398,139,389,143,375,155,366,167,357,179,342,192,319,205"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/erase.html#" title=" " alt="" coords="418,153,523,179"/>
-<area shape="poly" id="edge7_Node000004_Node000008" title=" " alt="" coords="319,204,404,181,405,186,320,209"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/erase.html#" title=" " alt="" coords="402,203,539,244"/>
-<area shape="poly" id="edge8_Node000004_Node000009" title=" " alt="" coords="319,221,387,221,387,226,319,226"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/find.html#" title=" " alt="" coords="402,268,539,309"/>
-<area shape="poly" id="edge9_Node000004_Node000010" title=" " alt="" coords="320,240,388,261,387,266,318,245"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/pop_back.html#" title=" " alt="" coords="406,333,535,359"/>
-<area shape="poly" id="edge10_Node000004_Node000011" title=" " alt="" coords="281,242,329,281,389,318,404,325,402,330,387,323,326,285,277,246"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/push_front.html#" title=" " alt="" coords="404,383,537,408"/>
-<area shape="poly" id="edge11_Node000004_Node000012" title=" " alt="" coords="271,242,318,305,351,340,389,369,397,374,394,378,387,374,348,344,314,309,266,246"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/size.html#" title=" " alt="" coords="422,432,519,458"/>
-<area shape="poly" id="edge12_Node000004_Node000013" title=" " alt="" coords="266,243,284,281,310,328,346,377,390,419,409,429,406,434,386,423,342,381,306,331,279,283,261,245"/>
-</map>
diff --git a/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.md5 b/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.md5
deleted file mode 100644
index fb46817ca..000000000
--- a/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-45c667bda31cfb5b173793e831e0ddde
\ No newline at end of file
diff --git a/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.svg b/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.svg
deleted file mode 100644
index 1f292a92c..000000000
--- a/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph.svg
+++ /dev/null
@@ -1,277 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: lru_tests::test_3 Pages: 1 -->
-<svg width="419pt" height="347pt"
- viewBox="0.00 0.00 419.00 347.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 343.25)">
-<title>lru_tests::test_3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A simple test case The assert statement will check expected hist and miss to resultant hits and miss.">
-<polygon fill="#999999" stroke="#666666" points="86.5,-234.25 0,-234.25 0,-215 86.5,-215 86.5,-234.25"/>
-<text text-anchor="middle" x="43.25" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">lru_tests::test_3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge13_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge13_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.78,-234.54C10.54,-243.15 18.03,-252.25 43.25,-252.25 57.04,-252.25 65.54,-249.53 68.72,-245.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.1,-244.74 66.11,-236 65.34,-246.57 72.1,-244.74"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933" target="_top" xlink:title="A function to get page hits.">
-<polygon fill="white" stroke="#666666" points="237.88,-288.88 135.62,-288.88 135.62,-258.38 237.88,-258.38 237.88,-288.88"/>
-<text text-anchor="start" x="143.62" y="-275.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="186.75" y="-264.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getHits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.23,-234.66C89.46,-240.28 110.25,-247.48 129.54,-254.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.35,-257.45 138.94,-257.42 130.64,-250.84 128.35,-257.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2" target="_top" xlink:title="A function to get page fault.">
-<polygon fill="white" stroke="#666666" points="251,-239.88 122.5,-239.88 122.5,-209.38 251,-209.38 251,-239.88"/>
-<text text-anchor="start" x="130.5" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="186.75" y="-215.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getPageFault</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.7,-224.62C94.37,-224.62 102.57,-224.62 110.84,-224.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.62,-228.13 120.62,-224.63 110.62,-221.13 110.62,-228.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602" target="_top" xlink:title="Refer to a page, or request a page from memory.">
-<polygon fill="white" stroke="#666666" points="235.25,-190.88 138.25,-190.88 138.25,-160.38 235.25,-160.38 235.25,-190.88"/>
-<text text-anchor="start" x="146.25" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="186.75" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::refer</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.23,-214.59C89.46,-208.97 110.25,-201.77 129.54,-195.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.64,-198.41 138.94,-191.83 128.35,-191.8 130.64,-198.41"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="386.62,-339.25 311.38,-339.25 311.38,-320 386.62,-320 386.62,-339.25"/>
-<text text-anchor="middle" x="349" y="-325.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.59,-189.08C241.3,-192.18 246.64,-195.98 251,-200.62 286.5,-238.43 249.84,-275.44 287,-311.62 290.9,-315.42 295.56,-318.42 300.54,-320.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.07,-323.98 309.66,-324.29 301.58,-317.44 299.07,-323.98"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387.75,-302.25 310.25,-302.25 310.25,-283 387.75,-283 387.75,-302.25"/>
-<text text-anchor="middle" x="349" y="-288.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::begin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.65,-190C241.21,-192.94 246.5,-196.45 251,-200.62 277.83,-225.48 259.08,-250.99 287,-274.62 290.65,-277.71 294.81,-280.27 299.21,-282.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.76,-285.59 308.35,-286.03 300.35,-279.08 297.76,-285.59"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="411,-265.25 287,-265.25 287,-246 411,-246 411,-265.25"/>
-<text text-anchor="middle" x="349" y="-251.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.17,-191.31C240.03,-194.05 245.79,-197.15 251,-200.62 270.09,-213.35 267.36,-225.77 287,-237.62 289.03,-238.85 291.15,-240 293.33,-241.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.89,-244.26 302.46,-244.97 294.64,-237.82 291.89,-244.26"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="388.12,-228.25 309.88,-228.25 309.88,-209 388.12,-209 388.12,-228.25"/>
-<text text-anchor="middle" x="349" y="-214.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::erase</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.4,-188.41C255.64,-193.84 279.2,-200.16 299.53,-205.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.42,-208.95 308.99,-208.16 300.24,-202.18 298.42,-208.95"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.12,-190.88 297.88,-190.88 297.88,-160.38 400.12,-160.38 400.12,-190.88"/>
-<text text-anchor="start" x="305.88" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="349" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">::erase</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge8_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge8_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.4,-175.62C251.29,-175.62 269.23,-175.62 286.05,-175.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.96,-179.13 295.96,-175.63 285.96,-172.13 285.96,-179.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.12,-141.88 297.88,-141.88 297.88,-111.38 400.12,-111.38 400.12,-141.88"/>
-<text text-anchor="start" x="305.88" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="349" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node10 -->
-<g id="edge9_Node000004_Node000010" class="edge">
-<title>Node4&#45;&gt;Node10</title>
-<g id="a_edge9_Node000004_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.4,-161.06C251.44,-156.15 269.58,-150.6 286.53,-145.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.48,-148.79 296.02,-142.52 285.44,-142.09 287.48,-148.79"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.12,-93.25 300.88,-93.25 300.88,-74 397.12,-74 397.12,-93.25"/>
-<text text-anchor="middle" x="349" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node11 -->
-<g id="edge10_Node000004_Node000011" class="edge">
-<title>Node4&#45;&gt;Node11</title>
-<g id="a_edge10_Node000004_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M205.21,-159.95C224.16,-143.65 255.88,-118.35 287,-102.62 290.52,-100.84 294.24,-99.19 298.04,-97.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.24,-100.96 307.42,-94.22 296.82,-94.38 299.24,-100.96"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="399,-56.25 299,-56.25 299,-37 399,-37 399,-56.25"/>
-<text text-anchor="middle" x="349" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node12 -->
-<g id="edge11_Node000004_Node000012" class="edge">
-<title>Node4&#45;&gt;Node12</title>
-<g id="a_edge11_Node000004_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.35,-160.26C213.12,-136.27 246.8,-90.06 287,-64.62 288.85,-63.45 290.79,-62.35 292.78,-61.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294,-64.61 301.71,-57.34 291.15,-58.22 294,-64.61"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385.12,-19.25 312.88,-19.25 312.88,0 385.12,0 385.12,-19.25"/>
-<text text-anchor="middle" x="349" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node13 -->
-<g id="edge12_Node000004_Node000013" class="edge">
-<title>Node4&#45;&gt;Node13</title>
-<g id="a_edge12_Node000004_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.88,-160.04C206.57,-129.83 238.63,-63.15 287,-27.62 291.44,-24.36 296.46,-21.69 301.68,-19.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="302.84,-22.8 311.09,-16.15 300.5,-16.21 302.84,-22.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph_org.svg b/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph_org.svg
deleted file mode 100644
index 1dd469289..000000000
--- a/d3/db3/lru__cache_8cpp_a01ec21fc91ddafd964ae2035ba7892c0_cgraph_org.svg
+++ /dev/null
@@ -1,251 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: lru_tests::test_3 Pages: 1 -->
-<svg width="419pt" height="347pt"
- viewBox="0.00 0.00 419.00 347.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 343.25)">
-<title>lru_tests::test_3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A simple test case The assert statement will check expected hist and miss to resultant hits and miss.">
-<polygon fill="#999999" stroke="#666666" points="86.5,-234.25 0,-234.25 0,-215 86.5,-215 86.5,-234.25"/>
-<text text-anchor="middle" x="43.25" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">lru_tests::test_3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge13_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge13_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.78,-234.54C10.54,-243.15 18.03,-252.25 43.25,-252.25 57.04,-252.25 65.54,-249.53 68.72,-245.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.1,-244.74 66.11,-236 65.34,-246.57 72.1,-244.74"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933" target="_top" xlink:title="A function to get page hits.">
-<polygon fill="white" stroke="#666666" points="237.88,-288.88 135.62,-288.88 135.62,-258.38 237.88,-258.38 237.88,-288.88"/>
-<text text-anchor="start" x="143.62" y="-275.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="186.75" y="-264.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getHits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.23,-234.66C89.46,-240.28 110.25,-247.48 129.54,-254.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.35,-257.45 138.94,-257.42 130.64,-250.84 128.35,-257.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2" target="_top" xlink:title="A function to get page fault.">
-<polygon fill="white" stroke="#666666" points="251,-239.88 122.5,-239.88 122.5,-209.38 251,-209.38 251,-239.88"/>
-<text text-anchor="start" x="130.5" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="186.75" y="-215.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getPageFault</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.7,-224.62C94.37,-224.62 102.57,-224.62 110.84,-224.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.62,-228.13 120.62,-224.63 110.62,-221.13 110.62,-228.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602" target="_top" xlink:title="Refer to a page, or request a page from memory.">
-<polygon fill="white" stroke="#666666" points="235.25,-190.88 138.25,-190.88 138.25,-160.38 235.25,-160.38 235.25,-190.88"/>
-<text text-anchor="start" x="146.25" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="186.75" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::refer</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.23,-214.59C89.46,-208.97 110.25,-201.77 129.54,-195.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.64,-198.41 138.94,-191.83 128.35,-191.8 130.64,-198.41"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="386.62,-339.25 311.38,-339.25 311.38,-320 386.62,-320 386.62,-339.25"/>
-<text text-anchor="middle" x="349" y="-325.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.59,-189.08C241.3,-192.18 246.64,-195.98 251,-200.62 286.5,-238.43 249.84,-275.44 287,-311.62 290.9,-315.42 295.56,-318.42 300.54,-320.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.07,-323.98 309.66,-324.29 301.58,-317.44 299.07,-323.98"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387.75,-302.25 310.25,-302.25 310.25,-283 387.75,-283 387.75,-302.25"/>
-<text text-anchor="middle" x="349" y="-288.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::begin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.65,-190C241.21,-192.94 246.5,-196.45 251,-200.62 277.83,-225.48 259.08,-250.99 287,-274.62 290.65,-277.71 294.81,-280.27 299.21,-282.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.76,-285.59 308.35,-286.03 300.35,-279.08 297.76,-285.59"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="411,-265.25 287,-265.25 287,-246 411,-246 411,-265.25"/>
-<text text-anchor="middle" x="349" y="-251.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.17,-191.31C240.03,-194.05 245.79,-197.15 251,-200.62 270.09,-213.35 267.36,-225.77 287,-237.62 289.03,-238.85 291.15,-240 293.33,-241.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.89,-244.26 302.46,-244.97 294.64,-237.82 291.89,-244.26"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="388.12,-228.25 309.88,-228.25 309.88,-209 388.12,-209 388.12,-228.25"/>
-<text text-anchor="middle" x="349" y="-214.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::erase</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.4,-188.41C255.64,-193.84 279.2,-200.16 299.53,-205.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.42,-208.95 308.99,-208.16 300.24,-202.18 298.42,-208.95"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.12,-190.88 297.88,-190.88 297.88,-160.38 400.12,-160.38 400.12,-190.88"/>
-<text text-anchor="start" x="305.88" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="349" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">::erase</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge8_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge8_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.4,-175.62C251.29,-175.62 269.23,-175.62 286.05,-175.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.96,-179.13 295.96,-175.63 285.96,-172.13 285.96,-179.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.12,-141.88 297.88,-141.88 297.88,-111.38 400.12,-111.38 400.12,-141.88"/>
-<text text-anchor="start" x="305.88" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="349" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node10 -->
-<g id="edge9_Node000004_Node000010" class="edge">
-<title>Node4&#45;&gt;Node10</title>
-<g id="a_edge9_Node000004_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.4,-161.06C251.44,-156.15 269.58,-150.6 286.53,-145.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.48,-148.79 296.02,-142.52 285.44,-142.09 287.48,-148.79"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.12,-93.25 300.88,-93.25 300.88,-74 397.12,-74 397.12,-93.25"/>
-<text text-anchor="middle" x="349" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node11 -->
-<g id="edge10_Node000004_Node000011" class="edge">
-<title>Node4&#45;&gt;Node11</title>
-<g id="a_edge10_Node000004_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M205.21,-159.95C224.16,-143.65 255.88,-118.35 287,-102.62 290.52,-100.84 294.24,-99.19 298.04,-97.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.24,-100.96 307.42,-94.22 296.82,-94.38 299.24,-100.96"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="399,-56.25 299,-56.25 299,-37 399,-37 399,-56.25"/>
-<text text-anchor="middle" x="349" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node12 -->
-<g id="edge11_Node000004_Node000012" class="edge">
-<title>Node4&#45;&gt;Node12</title>
-<g id="a_edge11_Node000004_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.35,-160.26C213.12,-136.27 246.8,-90.06 287,-64.62 288.85,-63.45 290.79,-62.35 292.78,-61.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294,-64.61 301.71,-57.34 291.15,-58.22 294,-64.61"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385.12,-19.25 312.88,-19.25 312.88,0 385.12,0 385.12,-19.25"/>
-<text text-anchor="middle" x="349" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node13 -->
-<g id="edge12_Node000004_Node000013" class="edge">
-<title>Node4&#45;&gt;Node13</title>
-<g id="a_edge12_Node000004_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.88,-160.04C206.57,-129.83 238.63,-63.15 287,-27.62 291.44,-24.36 296.46,-21.69 301.68,-19.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="302.84,-22.8 311.09,-16.15 300.5,-16.21 302.84,-22.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/db3/lru__cache_8cpp_a24d21a345ed06f7fba6919718cf3e058_cgraph.map b/d3/db3/lru__cache_8cpp_a24d21a345ed06f7fba6919718cf3e058_cgraph.map
deleted file mode 100644
index 0319492f4..000000000
--- a/d3/db3/lru__cache_8cpp_a24d21a345ed06f7fba6919718cf3e058_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="lru_tests::log" name="lru_tests::log">
-<area shape="rect" id="Node000001" title="A function to print given message on console." alt="" coords="5,5,102,31"/>
-<area shape="rect" id="Node000002" 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,221,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="102,16,134,16,134,21,102,21"/>
-</map>
diff --git a/d3/db3/lru__cache_8cpp_a24d21a345ed06f7fba6919718cf3e058_cgraph.md5 b/d3/db3/lru__cache_8cpp_a24d21a345ed06f7fba6919718cf3e058_cgraph.md5
deleted file mode 100644
index bcc4f617b..000000000
--- a/d3/db3/lru__cache_8cpp_a24d21a345ed06f7fba6919718cf3e058_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-eadd85c01f2fe8faa30c9106ea5fecdd
\ No newline at end of file
diff --git a/d3/db3/lru__cache_8cpp_a24d21a345ed06f7fba6919718cf3e058_cgraph.svg b/d3/db3/lru__cache_8cpp_a24d21a345ed06f7fba6919718cf3e058_cgraph.svg
deleted file mode 100644
index 64d937e61..000000000
--- a/d3/db3/lru__cache_8cpp_a24d21a345ed06f7fba6919718cf3e058_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: lru_tests::log Pages: 1 -->
-<svg width="170pt" height="27pt"
- viewBox="0.00 0.00 169.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>lru_tests::log</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function to print given message on console.">
-<polygon fill="#999999" stroke="#666666" points="72.25,-19.25 0,-19.25 0,0 72.25,0 72.25,-19.25"/>
-<text text-anchor="middle" x="36.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">lru_tests::log</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161.75,-19.25 108.25,-19.25 108.25,0 161.75,0 161.75,-19.25"/>
-<text text-anchor="middle" x="135" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.65,-9.62C80.39,-9.62 88.61,-9.62 96.44,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.37,-13.13 106.37,-9.63 96.37,-6.13 96.37,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/db3/lru__cache_8cpp_a24d21a345ed06f7fba6919718cf3e058_cgraph_org.svg b/d3/db3/lru__cache_8cpp_a24d21a345ed06f7fba6919718cf3e058_cgraph_org.svg
deleted file mode 100644
index 7165ba05c..000000000
--- a/d3/db3/lru__cache_8cpp_a24d21a345ed06f7fba6919718cf3e058_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: lru_tests::log Pages: 1 -->
-<svg width="170pt" height="27pt"
- viewBox="0.00 0.00 169.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>lru_tests::log</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function to print given message on console.">
-<polygon fill="#999999" stroke="#666666" points="72.25,-19.25 0,-19.25 0,0 72.25,0 72.25,-19.25"/>
-<text text-anchor="middle" x="36.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">lru_tests::log</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161.75,-19.25 108.25,-19.25 108.25,0 161.75,0 161.75,-19.25"/>
-<text text-anchor="middle" x="135" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.65,-9.62C80.39,-9.62 88.61,-9.62 96.44,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.37,-13.13 106.37,-9.63 96.37,-6.13 96.37,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/db3/lru__cache_8cpp_a4b02e288a407876a8d6024f98a2a25ec_cgraph.map b/d3/db3/lru__cache_8cpp_a4b02e288a407876a8d6024f98a2a25ec_cgraph.map
deleted file mode 100644
index bd61d2697..000000000
--- a/d3/db3/lru__cache_8cpp_a4b02e288a407876a8d6024f98a2a25ec_cgraph.map
+++ /dev/null
@@ -1,28 +0,0 @@
-<map id="lru_tests::test_2" name="lru_tests::test_2">
-<area shape="rect" id="Node000001" title="A test case contains hits more than cache size The assert statement will check expected hist and miss..." alt="" coords="5,145,121,171"/>
-<area shape="poly" id="edge13_Node000001_Node000001" title=" " alt="" coords="31,146,25,137,28,127,42,121,63,119,86,121,98,128,96,132,84,126,63,124,43,126,32,131,30,136,35,143"/>
-<area shape="rect" id="Node000002" href="$d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933" title="A function to get page hits." alt="" coords="186,72,322,113"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="102,142,177,116,179,121,104,147"/>
-<area shape="rect" id="Node000003" href="$d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2" title="A function to get page fault." alt="" coords="169,138,340,178"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="121,156,153,156,153,161,121,161"/>
-<area shape="rect" id="Node000004" href="$d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602" title="Refer to a page, or request a page from memory." alt="" coords="190,203,319,244"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="104,169,179,195,177,200,102,174"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/back.html#" title=" " alt="" coords="420,5,521,31"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="318,203,338,188,351,170,358,152,361,115,364,78,371,59,386,40,405,28,408,32,390,44,376,62,369,79,366,116,363,153,356,173,342,192,321,208"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/begin.html#" title=" " alt="" coords="419,55,522,80"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="318,202,338,188,355,164,361,140,367,115,375,102,386,89,403,79,406,83,390,94,379,105,372,117,366,141,360,166,342,192,321,207"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/end.html#" title=" " alt="" coords="388,104,553,130"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="316,200,338,188,353,176,362,163,371,151,387,139,395,134,398,139,389,143,375,155,366,167,357,179,342,192,319,205"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/erase.html#" title=" " alt="" coords="418,153,523,179"/>
-<area shape="poly" id="edge7_Node000004_Node000008" title=" " alt="" coords="319,204,404,181,405,186,320,209"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/erase.html#" title=" " alt="" coords="402,203,539,244"/>
-<area shape="poly" id="edge8_Node000004_Node000009" title=" " alt="" coords="319,221,387,221,387,226,319,226"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/find.html#" title=" " alt="" coords="402,268,539,309"/>
-<area shape="poly" id="edge9_Node000004_Node000010" title=" " alt="" coords="320,240,388,261,387,266,318,245"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/pop_back.html#" title=" " alt="" coords="406,333,535,359"/>
-<area shape="poly" id="edge10_Node000004_Node000011" title=" " alt="" coords="281,242,329,281,389,318,404,325,402,330,387,323,326,285,277,246"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/push_front.html#" title=" " alt="" coords="404,383,537,408"/>
-<area shape="poly" id="edge11_Node000004_Node000012" title=" " alt="" coords="271,242,318,305,351,340,389,369,397,374,394,378,387,374,348,344,314,309,266,246"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/size.html#" title=" " alt="" coords="422,432,519,458"/>
-<area shape="poly" id="edge12_Node000004_Node000013" title=" " alt="" coords="266,243,284,281,310,328,346,377,390,419,409,429,406,434,386,423,342,381,306,331,279,283,261,245"/>
-</map>
diff --git a/d3/db3/lru__cache_8cpp_a4b02e288a407876a8d6024f98a2a25ec_cgraph.md5 b/d3/db3/lru__cache_8cpp_a4b02e288a407876a8d6024f98a2a25ec_cgraph.md5
deleted file mode 100644
index 7d90bfbe7..000000000
--- a/d3/db3/lru__cache_8cpp_a4b02e288a407876a8d6024f98a2a25ec_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-55bb5f4d4e0a8280b5a091435be507e4
\ No newline at end of file
diff --git a/d3/db3/lru__cache_8cpp_a4b02e288a407876a8d6024f98a2a25ec_cgraph.svg b/d3/db3/lru__cache_8cpp_a4b02e288a407876a8d6024f98a2a25ec_cgraph.svg
deleted file mode 100644
index 314af24ad..000000000
--- a/d3/db3/lru__cache_8cpp_a4b02e288a407876a8d6024f98a2a25ec_cgraph.svg
+++ /dev/null
@@ -1,277 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: lru_tests::test_2 Pages: 1 -->
-<svg width="419pt" height="347pt"
- viewBox="0.00 0.00 419.00 347.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 343.25)">
-<title>lru_tests::test_2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A test case contains hits more than cache size The assert statement will check expected hist and miss...">
-<polygon fill="#999999" stroke="#666666" points="86.5,-234.25 0,-234.25 0,-215 86.5,-215 86.5,-234.25"/>
-<text text-anchor="middle" x="43.25" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">lru_tests::test_2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge13_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge13_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.78,-234.54C10.54,-243.15 18.03,-252.25 43.25,-252.25 57.04,-252.25 65.54,-249.53 68.72,-245.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.1,-244.74 66.11,-236 65.34,-246.57 72.1,-244.74"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933" target="_top" xlink:title="A function to get page hits.">
-<polygon fill="white" stroke="#666666" points="237.88,-288.88 135.62,-288.88 135.62,-258.38 237.88,-258.38 237.88,-288.88"/>
-<text text-anchor="start" x="143.62" y="-275.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="186.75" y="-264.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getHits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.23,-234.66C89.46,-240.28 110.25,-247.48 129.54,-254.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.35,-257.45 138.94,-257.42 130.64,-250.84 128.35,-257.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2" target="_top" xlink:title="A function to get page fault.">
-<polygon fill="white" stroke="#666666" points="251,-239.88 122.5,-239.88 122.5,-209.38 251,-209.38 251,-239.88"/>
-<text text-anchor="start" x="130.5" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="186.75" y="-215.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getPageFault</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.7,-224.62C94.37,-224.62 102.57,-224.62 110.84,-224.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.62,-228.13 120.62,-224.63 110.62,-221.13 110.62,-228.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602" target="_top" xlink:title="Refer to a page, or request a page from memory.">
-<polygon fill="white" stroke="#666666" points="235.25,-190.88 138.25,-190.88 138.25,-160.38 235.25,-160.38 235.25,-190.88"/>
-<text text-anchor="start" x="146.25" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="186.75" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::refer</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.23,-214.59C89.46,-208.97 110.25,-201.77 129.54,-195.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.64,-198.41 138.94,-191.83 128.35,-191.8 130.64,-198.41"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="386.62,-339.25 311.38,-339.25 311.38,-320 386.62,-320 386.62,-339.25"/>
-<text text-anchor="middle" x="349" y="-325.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.59,-189.08C241.3,-192.18 246.64,-195.98 251,-200.62 286.5,-238.43 249.84,-275.44 287,-311.62 290.9,-315.42 295.56,-318.42 300.54,-320.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.07,-323.98 309.66,-324.29 301.58,-317.44 299.07,-323.98"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387.75,-302.25 310.25,-302.25 310.25,-283 387.75,-283 387.75,-302.25"/>
-<text text-anchor="middle" x="349" y="-288.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::begin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.65,-190C241.21,-192.94 246.5,-196.45 251,-200.62 277.83,-225.48 259.08,-250.99 287,-274.62 290.65,-277.71 294.81,-280.27 299.21,-282.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.76,-285.59 308.35,-286.03 300.35,-279.08 297.76,-285.59"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="411,-265.25 287,-265.25 287,-246 411,-246 411,-265.25"/>
-<text text-anchor="middle" x="349" y="-251.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.17,-191.31C240.03,-194.05 245.79,-197.15 251,-200.62 270.09,-213.35 267.36,-225.77 287,-237.62 289.03,-238.85 291.15,-240 293.33,-241.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.89,-244.26 302.46,-244.97 294.64,-237.82 291.89,-244.26"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="388.12,-228.25 309.88,-228.25 309.88,-209 388.12,-209 388.12,-228.25"/>
-<text text-anchor="middle" x="349" y="-214.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::erase</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.4,-188.41C255.64,-193.84 279.2,-200.16 299.53,-205.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.42,-208.95 308.99,-208.16 300.24,-202.18 298.42,-208.95"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.12,-190.88 297.88,-190.88 297.88,-160.38 400.12,-160.38 400.12,-190.88"/>
-<text text-anchor="start" x="305.88" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="349" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">::erase</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge8_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge8_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.4,-175.62C251.29,-175.62 269.23,-175.62 286.05,-175.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.96,-179.13 295.96,-175.63 285.96,-172.13 285.96,-179.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.12,-141.88 297.88,-141.88 297.88,-111.38 400.12,-111.38 400.12,-141.88"/>
-<text text-anchor="start" x="305.88" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="349" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node10 -->
-<g id="edge9_Node000004_Node000010" class="edge">
-<title>Node4&#45;&gt;Node10</title>
-<g id="a_edge9_Node000004_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.4,-161.06C251.44,-156.15 269.58,-150.6 286.53,-145.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.48,-148.79 296.02,-142.52 285.44,-142.09 287.48,-148.79"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.12,-93.25 300.88,-93.25 300.88,-74 397.12,-74 397.12,-93.25"/>
-<text text-anchor="middle" x="349" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node11 -->
-<g id="edge10_Node000004_Node000011" class="edge">
-<title>Node4&#45;&gt;Node11</title>
-<g id="a_edge10_Node000004_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M205.21,-159.95C224.16,-143.65 255.88,-118.35 287,-102.62 290.52,-100.84 294.24,-99.19 298.04,-97.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.24,-100.96 307.42,-94.22 296.82,-94.38 299.24,-100.96"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="399,-56.25 299,-56.25 299,-37 399,-37 399,-56.25"/>
-<text text-anchor="middle" x="349" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node12 -->
-<g id="edge11_Node000004_Node000012" class="edge">
-<title>Node4&#45;&gt;Node12</title>
-<g id="a_edge11_Node000004_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.35,-160.26C213.12,-136.27 246.8,-90.06 287,-64.62 288.85,-63.45 290.79,-62.35 292.78,-61.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294,-64.61 301.71,-57.34 291.15,-58.22 294,-64.61"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385.12,-19.25 312.88,-19.25 312.88,0 385.12,0 385.12,-19.25"/>
-<text text-anchor="middle" x="349" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node13 -->
-<g id="edge12_Node000004_Node000013" class="edge">
-<title>Node4&#45;&gt;Node13</title>
-<g id="a_edge12_Node000004_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.88,-160.04C206.57,-129.83 238.63,-63.15 287,-27.62 291.44,-24.36 296.46,-21.69 301.68,-19.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="302.84,-22.8 311.09,-16.15 300.5,-16.21 302.84,-22.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/db3/lru__cache_8cpp_a4b02e288a407876a8d6024f98a2a25ec_cgraph_org.svg b/d3/db3/lru__cache_8cpp_a4b02e288a407876a8d6024f98a2a25ec_cgraph_org.svg
deleted file mode 100644
index ac5832154..000000000
--- a/d3/db3/lru__cache_8cpp_a4b02e288a407876a8d6024f98a2a25ec_cgraph_org.svg
+++ /dev/null
@@ -1,251 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: lru_tests::test_2 Pages: 1 -->
-<svg width="419pt" height="347pt"
- viewBox="0.00 0.00 419.00 347.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 343.25)">
-<title>lru_tests::test_2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A test case contains hits more than cache size The assert statement will check expected hist and miss...">
-<polygon fill="#999999" stroke="#666666" points="86.5,-234.25 0,-234.25 0,-215 86.5,-215 86.5,-234.25"/>
-<text text-anchor="middle" x="43.25" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">lru_tests::test_2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge13_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge13_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.78,-234.54C10.54,-243.15 18.03,-252.25 43.25,-252.25 57.04,-252.25 65.54,-249.53 68.72,-245.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.1,-244.74 66.11,-236 65.34,-246.57 72.1,-244.74"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933" target="_top" xlink:title="A function to get page hits.">
-<polygon fill="white" stroke="#666666" points="237.88,-288.88 135.62,-288.88 135.62,-258.38 237.88,-258.38 237.88,-288.88"/>
-<text text-anchor="start" x="143.62" y="-275.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="186.75" y="-264.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getHits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.23,-234.66C89.46,-240.28 110.25,-247.48 129.54,-254.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.35,-257.45 138.94,-257.42 130.64,-250.84 128.35,-257.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2" target="_top" xlink:title="A function to get page fault.">
-<polygon fill="white" stroke="#666666" points="251,-239.88 122.5,-239.88 122.5,-209.38 251,-209.38 251,-239.88"/>
-<text text-anchor="start" x="130.5" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="186.75" y="-215.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getPageFault</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.7,-224.62C94.37,-224.62 102.57,-224.62 110.84,-224.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.62,-228.13 120.62,-224.63 110.62,-221.13 110.62,-228.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602" target="_top" xlink:title="Refer to a page, or request a page from memory.">
-<polygon fill="white" stroke="#666666" points="235.25,-190.88 138.25,-190.88 138.25,-160.38 235.25,-160.38 235.25,-190.88"/>
-<text text-anchor="start" x="146.25" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="186.75" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::refer</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.23,-214.59C89.46,-208.97 110.25,-201.77 129.54,-195.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.64,-198.41 138.94,-191.83 128.35,-191.8 130.64,-198.41"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="386.62,-339.25 311.38,-339.25 311.38,-320 386.62,-320 386.62,-339.25"/>
-<text text-anchor="middle" x="349" y="-325.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.59,-189.08C241.3,-192.18 246.64,-195.98 251,-200.62 286.5,-238.43 249.84,-275.44 287,-311.62 290.9,-315.42 295.56,-318.42 300.54,-320.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.07,-323.98 309.66,-324.29 301.58,-317.44 299.07,-323.98"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387.75,-302.25 310.25,-302.25 310.25,-283 387.75,-283 387.75,-302.25"/>
-<text text-anchor="middle" x="349" y="-288.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::begin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.65,-190C241.21,-192.94 246.5,-196.45 251,-200.62 277.83,-225.48 259.08,-250.99 287,-274.62 290.65,-277.71 294.81,-280.27 299.21,-282.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.76,-285.59 308.35,-286.03 300.35,-279.08 297.76,-285.59"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="411,-265.25 287,-265.25 287,-246 411,-246 411,-265.25"/>
-<text text-anchor="middle" x="349" y="-251.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.17,-191.31C240.03,-194.05 245.79,-197.15 251,-200.62 270.09,-213.35 267.36,-225.77 287,-237.62 289.03,-238.85 291.15,-240 293.33,-241.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.89,-244.26 302.46,-244.97 294.64,-237.82 291.89,-244.26"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="388.12,-228.25 309.88,-228.25 309.88,-209 388.12,-209 388.12,-228.25"/>
-<text text-anchor="middle" x="349" y="-214.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::erase</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.4,-188.41C255.64,-193.84 279.2,-200.16 299.53,-205.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.42,-208.95 308.99,-208.16 300.24,-202.18 298.42,-208.95"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.12,-190.88 297.88,-190.88 297.88,-160.38 400.12,-160.38 400.12,-190.88"/>
-<text text-anchor="start" x="305.88" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="349" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">::erase</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge8_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge8_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.4,-175.62C251.29,-175.62 269.23,-175.62 286.05,-175.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.96,-179.13 295.96,-175.63 285.96,-172.13 285.96,-179.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.12,-141.88 297.88,-141.88 297.88,-111.38 400.12,-111.38 400.12,-141.88"/>
-<text text-anchor="start" x="305.88" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="349" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node10 -->
-<g id="edge9_Node000004_Node000010" class="edge">
-<title>Node4&#45;&gt;Node10</title>
-<g id="a_edge9_Node000004_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.4,-161.06C251.44,-156.15 269.58,-150.6 286.53,-145.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.48,-148.79 296.02,-142.52 285.44,-142.09 287.48,-148.79"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.12,-93.25 300.88,-93.25 300.88,-74 397.12,-74 397.12,-93.25"/>
-<text text-anchor="middle" x="349" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node11 -->
-<g id="edge10_Node000004_Node000011" class="edge">
-<title>Node4&#45;&gt;Node11</title>
-<g id="a_edge10_Node000004_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M205.21,-159.95C224.16,-143.65 255.88,-118.35 287,-102.62 290.52,-100.84 294.24,-99.19 298.04,-97.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.24,-100.96 307.42,-94.22 296.82,-94.38 299.24,-100.96"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="399,-56.25 299,-56.25 299,-37 399,-37 399,-56.25"/>
-<text text-anchor="middle" x="349" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node12 -->
-<g id="edge11_Node000004_Node000012" class="edge">
-<title>Node4&#45;&gt;Node12</title>
-<g id="a_edge11_Node000004_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.35,-160.26C213.12,-136.27 246.8,-90.06 287,-64.62 288.85,-63.45 290.79,-62.35 292.78,-61.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294,-64.61 301.71,-57.34 291.15,-58.22 294,-64.61"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385.12,-19.25 312.88,-19.25 312.88,0 385.12,0 385.12,-19.25"/>
-<text text-anchor="middle" x="349" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node13 -->
-<g id="edge12_Node000004_Node000013" class="edge">
-<title>Node4&#45;&gt;Node13</title>
-<g id="a_edge12_Node000004_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.88,-160.04C206.57,-129.83 238.63,-63.15 287,-27.62 291.44,-24.36 296.46,-21.69 301.68,-19.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="302.84,-22.8 311.09,-16.15 300.5,-16.21 302.84,-22.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/db3/lru__cache_8cpp_a6401e8f2d41d8cc9cd0e52ab381608d4_cgraph.map b/d3/db3/lru__cache_8cpp_a6401e8f2d41d8cc9cd0e52ab381608d4_cgraph.map
deleted file mode 100644
index f891090dc..000000000
--- a/d3/db3/lru__cache_8cpp_a6401e8f2d41d8cc9cd0e52ab381608d4_cgraph.map
+++ /dev/null
@@ -1,28 +0,0 @@
-<map id="lru_tests::test_1" name="lru_tests::test_1">
-<area shape="rect" id="Node000001" title="A simple test case The assert statement will check expected hist and miss to resultant hits and miss." alt="" coords="5,145,121,171"/>
-<area shape="poly" id="edge13_Node000001_Node000001" title=" " alt="" coords="31,146,25,137,28,127,42,121,63,119,86,121,98,128,96,132,84,126,63,124,43,126,32,131,30,136,35,143"/>
-<area shape="rect" id="Node000002" href="$d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933" title="A function to get page hits." alt="" coords="186,72,322,113"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="102,142,177,116,179,121,104,147"/>
-<area shape="rect" id="Node000003" href="$d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2" title="A function to get page fault." alt="" coords="169,138,340,178"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="121,156,153,156,153,161,121,161"/>
-<area shape="rect" id="Node000004" href="$d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602" title="Refer to a page, or request a page from memory." alt="" coords="190,203,319,244"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="104,169,179,195,177,200,102,174"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/back.html#" title=" " alt="" coords="420,5,521,31"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="318,203,338,188,351,170,358,152,361,115,364,78,371,59,386,40,405,28,408,32,390,44,376,62,369,79,366,116,363,153,356,173,342,192,321,208"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/begin.html#" title=" " alt="" coords="419,55,522,80"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="318,202,338,188,355,164,361,140,367,115,375,102,386,89,403,79,406,83,390,94,379,105,372,117,366,141,360,166,342,192,321,207"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/end.html#" title=" " alt="" coords="388,104,553,130"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="316,200,338,188,353,176,362,163,371,151,387,139,395,134,398,139,389,143,375,155,366,167,357,179,342,192,319,205"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/erase.html#" title=" " alt="" coords="418,153,523,179"/>
-<area shape="poly" id="edge7_Node000004_Node000008" title=" " alt="" coords="319,204,404,181,405,186,320,209"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/erase.html#" title=" " alt="" coords="402,203,539,244"/>
-<area shape="poly" id="edge8_Node000004_Node000009" title=" " alt="" coords="319,221,387,221,387,226,319,226"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/find.html#" title=" " alt="" coords="402,268,539,309"/>
-<area shape="poly" id="edge9_Node000004_Node000010" title=" " alt="" coords="320,240,388,261,387,266,318,245"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/pop_back.html#" title=" " alt="" coords="406,333,535,359"/>
-<area shape="poly" id="edge10_Node000004_Node000011" title=" " alt="" coords="281,242,329,281,389,318,404,325,402,330,387,323,326,285,277,246"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/push_front.html#" title=" " alt="" coords="404,383,537,408"/>
-<area shape="poly" id="edge11_Node000004_Node000012" title=" " alt="" coords="271,242,318,305,351,340,389,369,397,374,394,378,387,374,348,344,314,309,266,246"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/size.html#" title=" " alt="" coords="422,432,519,458"/>
-<area shape="poly" id="edge12_Node000004_Node000013" title=" " alt="" coords="266,243,284,281,310,328,346,377,390,419,409,429,406,434,386,423,342,381,306,331,279,283,261,245"/>
-</map>
diff --git a/d3/db3/lru__cache_8cpp_a6401e8f2d41d8cc9cd0e52ab381608d4_cgraph.md5 b/d3/db3/lru__cache_8cpp_a6401e8f2d41d8cc9cd0e52ab381608d4_cgraph.md5
deleted file mode 100644
index 7a837da15..000000000
--- a/d3/db3/lru__cache_8cpp_a6401e8f2d41d8cc9cd0e52ab381608d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a5e4a7dcb21109c054a1a93b7be39ca7
\ No newline at end of file
diff --git a/d3/db3/lru__cache_8cpp_a6401e8f2d41d8cc9cd0e52ab381608d4_cgraph.svg b/d3/db3/lru__cache_8cpp_a6401e8f2d41d8cc9cd0e52ab381608d4_cgraph.svg
deleted file mode 100644
index 20788c0e1..000000000
--- a/d3/db3/lru__cache_8cpp_a6401e8f2d41d8cc9cd0e52ab381608d4_cgraph.svg
+++ /dev/null
@@ -1,277 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: lru_tests::test_1 Pages: 1 -->
-<svg width="419pt" height="347pt"
- viewBox="0.00 0.00 419.00 347.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 343.25)">
-<title>lru_tests::test_1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A simple test case The assert statement will check expected hist and miss to resultant hits and miss.">
-<polygon fill="#999999" stroke="#666666" points="86.5,-234.25 0,-234.25 0,-215 86.5,-215 86.5,-234.25"/>
-<text text-anchor="middle" x="43.25" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">lru_tests::test_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge13_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge13_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.78,-234.54C10.54,-243.15 18.03,-252.25 43.25,-252.25 57.04,-252.25 65.54,-249.53 68.72,-245.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.1,-244.74 66.11,-236 65.34,-246.57 72.1,-244.74"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933" target="_top" xlink:title="A function to get page hits.">
-<polygon fill="white" stroke="#666666" points="237.88,-288.88 135.62,-288.88 135.62,-258.38 237.88,-258.38 237.88,-288.88"/>
-<text text-anchor="start" x="143.62" y="-275.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="186.75" y="-264.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getHits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.23,-234.66C89.46,-240.28 110.25,-247.48 129.54,-254.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.35,-257.45 138.94,-257.42 130.64,-250.84 128.35,-257.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2" target="_top" xlink:title="A function to get page fault.">
-<polygon fill="white" stroke="#666666" points="251,-239.88 122.5,-239.88 122.5,-209.38 251,-209.38 251,-239.88"/>
-<text text-anchor="start" x="130.5" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="186.75" y="-215.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getPageFault</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.7,-224.62C94.37,-224.62 102.57,-224.62 110.84,-224.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.62,-228.13 120.62,-224.63 110.62,-221.13 110.62,-228.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602" target="_top" xlink:title="Refer to a page, or request a page from memory.">
-<polygon fill="white" stroke="#666666" points="235.25,-190.88 138.25,-190.88 138.25,-160.38 235.25,-160.38 235.25,-190.88"/>
-<text text-anchor="start" x="146.25" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="186.75" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::refer</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.23,-214.59C89.46,-208.97 110.25,-201.77 129.54,-195.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.64,-198.41 138.94,-191.83 128.35,-191.8 130.64,-198.41"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="386.62,-339.25 311.38,-339.25 311.38,-320 386.62,-320 386.62,-339.25"/>
-<text text-anchor="middle" x="349" y="-325.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.59,-189.08C241.3,-192.18 246.64,-195.98 251,-200.62 286.5,-238.43 249.84,-275.44 287,-311.62 290.9,-315.42 295.56,-318.42 300.54,-320.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.07,-323.98 309.66,-324.29 301.58,-317.44 299.07,-323.98"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387.75,-302.25 310.25,-302.25 310.25,-283 387.75,-283 387.75,-302.25"/>
-<text text-anchor="middle" x="349" y="-288.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::begin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.65,-190C241.21,-192.94 246.5,-196.45 251,-200.62 277.83,-225.48 259.08,-250.99 287,-274.62 290.65,-277.71 294.81,-280.27 299.21,-282.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.76,-285.59 308.35,-286.03 300.35,-279.08 297.76,-285.59"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="411,-265.25 287,-265.25 287,-246 411,-246 411,-265.25"/>
-<text text-anchor="middle" x="349" y="-251.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.17,-191.31C240.03,-194.05 245.79,-197.15 251,-200.62 270.09,-213.35 267.36,-225.77 287,-237.62 289.03,-238.85 291.15,-240 293.33,-241.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.89,-244.26 302.46,-244.97 294.64,-237.82 291.89,-244.26"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="388.12,-228.25 309.88,-228.25 309.88,-209 388.12,-209 388.12,-228.25"/>
-<text text-anchor="middle" x="349" y="-214.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::erase</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.4,-188.41C255.64,-193.84 279.2,-200.16 299.53,-205.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.42,-208.95 308.99,-208.16 300.24,-202.18 298.42,-208.95"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.12,-190.88 297.88,-190.88 297.88,-160.38 400.12,-160.38 400.12,-190.88"/>
-<text text-anchor="start" x="305.88" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="349" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">::erase</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge8_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge8_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.4,-175.62C251.29,-175.62 269.23,-175.62 286.05,-175.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.96,-179.13 295.96,-175.63 285.96,-172.13 285.96,-179.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.12,-141.88 297.88,-141.88 297.88,-111.38 400.12,-111.38 400.12,-141.88"/>
-<text text-anchor="start" x="305.88" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="349" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node10 -->
-<g id="edge9_Node000004_Node000010" class="edge">
-<title>Node4&#45;&gt;Node10</title>
-<g id="a_edge9_Node000004_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.4,-161.06C251.44,-156.15 269.58,-150.6 286.53,-145.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.48,-148.79 296.02,-142.52 285.44,-142.09 287.48,-148.79"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.12,-93.25 300.88,-93.25 300.88,-74 397.12,-74 397.12,-93.25"/>
-<text text-anchor="middle" x="349" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node11 -->
-<g id="edge10_Node000004_Node000011" class="edge">
-<title>Node4&#45;&gt;Node11</title>
-<g id="a_edge10_Node000004_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M205.21,-159.95C224.16,-143.65 255.88,-118.35 287,-102.62 290.52,-100.84 294.24,-99.19 298.04,-97.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.24,-100.96 307.42,-94.22 296.82,-94.38 299.24,-100.96"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="399,-56.25 299,-56.25 299,-37 399,-37 399,-56.25"/>
-<text text-anchor="middle" x="349" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node12 -->
-<g id="edge11_Node000004_Node000012" class="edge">
-<title>Node4&#45;&gt;Node12</title>
-<g id="a_edge11_Node000004_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.35,-160.26C213.12,-136.27 246.8,-90.06 287,-64.62 288.85,-63.45 290.79,-62.35 292.78,-61.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294,-64.61 301.71,-57.34 291.15,-58.22 294,-64.61"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385.12,-19.25 312.88,-19.25 312.88,0 385.12,0 385.12,-19.25"/>
-<text text-anchor="middle" x="349" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node13 -->
-<g id="edge12_Node000004_Node000013" class="edge">
-<title>Node4&#45;&gt;Node13</title>
-<g id="a_edge12_Node000004_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.88,-160.04C206.57,-129.83 238.63,-63.15 287,-27.62 291.44,-24.36 296.46,-21.69 301.68,-19.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="302.84,-22.8 311.09,-16.15 300.5,-16.21 302.84,-22.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/db3/lru__cache_8cpp_a6401e8f2d41d8cc9cd0e52ab381608d4_cgraph_org.svg b/d3/db3/lru__cache_8cpp_a6401e8f2d41d8cc9cd0e52ab381608d4_cgraph_org.svg
deleted file mode 100644
index 3ac421ac6..000000000
--- a/d3/db3/lru__cache_8cpp_a6401e8f2d41d8cc9cd0e52ab381608d4_cgraph_org.svg
+++ /dev/null
@@ -1,251 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: lru_tests::test_1 Pages: 1 -->
-<svg width="419pt" height="347pt"
- viewBox="0.00 0.00 419.00 347.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 343.25)">
-<title>lru_tests::test_1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A simple test case The assert statement will check expected hist and miss to resultant hits and miss.">
-<polygon fill="#999999" stroke="#666666" points="86.5,-234.25 0,-234.25 0,-215 86.5,-215 86.5,-234.25"/>
-<text text-anchor="middle" x="43.25" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">lru_tests::test_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge13_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge13_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.78,-234.54C10.54,-243.15 18.03,-252.25 43.25,-252.25 57.04,-252.25 65.54,-249.53 68.72,-245.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.1,-244.74 66.11,-236 65.34,-246.57 72.1,-244.74"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933" target="_top" xlink:title="A function to get page hits.">
-<polygon fill="white" stroke="#666666" points="237.88,-288.88 135.62,-288.88 135.62,-258.38 237.88,-258.38 237.88,-288.88"/>
-<text text-anchor="start" x="143.62" y="-275.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="186.75" y="-264.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getHits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.23,-234.66C89.46,-240.28 110.25,-247.48 129.54,-254.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.35,-257.45 138.94,-257.42 130.64,-250.84 128.35,-257.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2" target="_top" xlink:title="A function to get page fault.">
-<polygon fill="white" stroke="#666666" points="251,-239.88 122.5,-239.88 122.5,-209.38 251,-209.38 251,-239.88"/>
-<text text-anchor="start" x="130.5" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="186.75" y="-215.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getPageFault</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.7,-224.62C94.37,-224.62 102.57,-224.62 110.84,-224.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.62,-228.13 120.62,-224.63 110.62,-221.13 110.62,-228.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602" target="_top" xlink:title="Refer to a page, or request a page from memory.">
-<polygon fill="white" stroke="#666666" points="235.25,-190.88 138.25,-190.88 138.25,-160.38 235.25,-160.38 235.25,-190.88"/>
-<text text-anchor="start" x="146.25" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="186.75" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::refer</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.23,-214.59C89.46,-208.97 110.25,-201.77 129.54,-195.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.64,-198.41 138.94,-191.83 128.35,-191.8 130.64,-198.41"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="386.62,-339.25 311.38,-339.25 311.38,-320 386.62,-320 386.62,-339.25"/>
-<text text-anchor="middle" x="349" y="-325.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.59,-189.08C241.3,-192.18 246.64,-195.98 251,-200.62 286.5,-238.43 249.84,-275.44 287,-311.62 290.9,-315.42 295.56,-318.42 300.54,-320.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.07,-323.98 309.66,-324.29 301.58,-317.44 299.07,-323.98"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387.75,-302.25 310.25,-302.25 310.25,-283 387.75,-283 387.75,-302.25"/>
-<text text-anchor="middle" x="349" y="-288.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::begin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.65,-190C241.21,-192.94 246.5,-196.45 251,-200.62 277.83,-225.48 259.08,-250.99 287,-274.62 290.65,-277.71 294.81,-280.27 299.21,-282.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.76,-285.59 308.35,-286.03 300.35,-279.08 297.76,-285.59"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="411,-265.25 287,-265.25 287,-246 411,-246 411,-265.25"/>
-<text text-anchor="middle" x="349" y="-251.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.17,-191.31C240.03,-194.05 245.79,-197.15 251,-200.62 270.09,-213.35 267.36,-225.77 287,-237.62 289.03,-238.85 291.15,-240 293.33,-241.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.89,-244.26 302.46,-244.97 294.64,-237.82 291.89,-244.26"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="388.12,-228.25 309.88,-228.25 309.88,-209 388.12,-209 388.12,-228.25"/>
-<text text-anchor="middle" x="349" y="-214.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::erase</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.4,-188.41C255.64,-193.84 279.2,-200.16 299.53,-205.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.42,-208.95 308.99,-208.16 300.24,-202.18 298.42,-208.95"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.12,-190.88 297.88,-190.88 297.88,-160.38 400.12,-160.38 400.12,-190.88"/>
-<text text-anchor="start" x="305.88" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="349" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">::erase</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge8_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge8_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.4,-175.62C251.29,-175.62 269.23,-175.62 286.05,-175.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.96,-179.13 295.96,-175.63 285.96,-172.13 285.96,-179.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.12,-141.88 297.88,-141.88 297.88,-111.38 400.12,-111.38 400.12,-141.88"/>
-<text text-anchor="start" x="305.88" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="349" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node10 -->
-<g id="edge9_Node000004_Node000010" class="edge">
-<title>Node4&#45;&gt;Node10</title>
-<g id="a_edge9_Node000004_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.4,-161.06C251.44,-156.15 269.58,-150.6 286.53,-145.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.48,-148.79 296.02,-142.52 285.44,-142.09 287.48,-148.79"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.12,-93.25 300.88,-93.25 300.88,-74 397.12,-74 397.12,-93.25"/>
-<text text-anchor="middle" x="349" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node11 -->
-<g id="edge10_Node000004_Node000011" class="edge">
-<title>Node4&#45;&gt;Node11</title>
-<g id="a_edge10_Node000004_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M205.21,-159.95C224.16,-143.65 255.88,-118.35 287,-102.62 290.52,-100.84 294.24,-99.19 298.04,-97.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.24,-100.96 307.42,-94.22 296.82,-94.38 299.24,-100.96"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="399,-56.25 299,-56.25 299,-37 399,-37 399,-56.25"/>
-<text text-anchor="middle" x="349" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node12 -->
-<g id="edge11_Node000004_Node000012" class="edge">
-<title>Node4&#45;&gt;Node12</title>
-<g id="a_edge11_Node000004_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.35,-160.26C213.12,-136.27 246.8,-90.06 287,-64.62 288.85,-63.45 290.79,-62.35 292.78,-61.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294,-64.61 301.71,-57.34 291.15,-58.22 294,-64.61"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385.12,-19.25 312.88,-19.25 312.88,0 385.12,0 385.12,-19.25"/>
-<text text-anchor="middle" x="349" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node13 -->
-<g id="edge12_Node000004_Node000013" class="edge">
-<title>Node4&#45;&gt;Node13</title>
-<g id="a_edge12_Node000004_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.88,-160.04C206.57,-129.83 238.63,-63.15 287,-27.62 291.44,-24.36 296.46,-21.69 301.68,-19.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="302.84,-22.8 311.09,-16.15 300.5,-16.21 302.84,-22.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/db3/lru__cache_8cpp_a6a3be6d8871b1f5dc03688da8f3ee9e6_cgraph.map b/d3/db3/lru__cache_8cpp_a6a3be6d8871b1f5dc03688da8f3ee9e6_cgraph.map
deleted file mode 100644
index 9762068f2..000000000
--- a/d3/db3/lru__cache_8cpp_a6a3be6d8871b1f5dc03688da8f3ee9e6_cgraph.map
+++ /dev/null
@@ -1,43 +0,0 @@
-<map id="lru_tests::run_tests" name="lru_tests::run_tests">
-<area shape="rect" id="Node000001" title="A function to invoke all test cases." alt="" coords="5,145,139,171"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="43,146,37,137,41,127,53,121,72,119,93,121,104,128,101,132,91,126,72,124,54,126,45,131,42,136,47,144"/>
-<area shape="rect" id="Node000002" href="$d3/db3/lru__cache_8cpp.html#a6401e8f2d41d8cc9cd0e52ab381608d4" title="A simple test case The assert statement will check expected hist and miss to resultant hits and miss." alt="" coords="187,72,302,98"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="103,142,186,106,196,102,198,107,188,111,105,147"/>
-<area shape="rect" id="Node000015" href="$d3/db3/lru__cache_8cpp.html#a4b02e288a407876a8d6024f98a2a25ec" title="A test case contains hits more than cache size The assert statement will check expected hist and miss..." alt="" coords="187,145,302,171"/>
-<area shape="poly" id="edge16_Node000001_Node000015" title=" " alt="" coords="139,156,171,156,171,161,139,161"/>
-<area shape="rect" id="Node000016" href="$d3/db3/lru__cache_8cpp.html#a01ec21fc91ddafd964ae2035ba7892c0" title="A simple test case The assert statement will check expected hist and miss to resultant hits and miss." alt="" coords="187,219,302,244"/>
-<area shape="poly" id="edge21_Node000001_Node000016" title=" " alt="" coords="106,169,199,210,197,215,103,174"/>
-<area shape="poly" id="edge15_Node000002_Node000002" title=" " alt="" coords="215,73,209,63,213,54,225,48,244,45,265,48,276,55,274,59,264,53,244,51,226,53,217,57,215,63,220,70"/>
-<area shape="rect" id="Node000003" href="$d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933" title="A function to get page hits." alt="" coords="368,72,504,113"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="302,85,352,87,352,92,302,90"/>
-<area shape="rect" id="Node000004" href="$d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2" title="A function to get page fault." alt="" coords="350,138,521,178"/>
-<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="281,96,367,129,365,134,279,101"/>
-<area shape="rect" id="Node000005" href="$d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602" title="Refer to a page, or request a page from memory." alt="" coords="371,203,500,244"/>
-<area shape="poly" id="edge5_Node000002_Node000005" title=" " alt="" coords="287,96,304,107,321,128,328,149,336,169,352,188,359,194,356,198,348,192,331,171,323,151,316,131,300,111,284,100"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/back.html#" title=" " alt="" coords="602,5,702,31"/>
-<area shape="poly" id="edge6_Node000005_Node000006" title=" " alt="" coords="499,203,519,188,533,170,539,152,542,115,545,78,553,59,568,40,586,28,589,32,571,44,557,62,550,79,547,116,544,153,537,173,523,192,502,208"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/begin.html#" title=" " alt="" coords="600,55,704,80"/>
-<area shape="poly" id="edge7_Node000005_Node000007" title=" " alt="" coords="499,202,519,188,536,164,542,140,549,115,556,102,568,89,584,79,587,83,571,94,560,105,554,117,547,141,541,166,523,192,502,207"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/end.html#" title=" " alt="" coords="569,104,735,130"/>
-<area shape="poly" id="edge8_Node000005_Node000008" title=" " alt="" coords="498,200,520,188,534,176,543,163,552,151,568,139,576,134,579,139,571,143,556,155,547,167,538,179,523,192,500,205"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/erase.html#" title=" " alt="" coords="600,153,704,179"/>
-<area shape="poly" id="edge9_Node000005_Node000009" title=" " alt="" coords="500,204,585,181,587,186,501,209"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/erase.html#" title=" " alt="" coords="584,203,720,244"/>
-<area shape="poly" id="edge10_Node000005_Node000010" title=" " alt="" coords="501,221,568,221,568,226,501,226"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/find.html#" title=" " alt="" coords="584,268,720,309"/>
-<area shape="poly" id="edge11_Node000005_Node000011" title=" " alt="" coords="501,240,569,261,568,266,500,245"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/pop_back.html#" title=" " alt="" coords="588,333,716,359"/>
-<area shape="poly" id="edge12_Node000005_Node000012" title=" " alt="" coords="462,242,510,281,571,318,585,325,583,330,568,323,507,285,459,246"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/push_front.html#" title=" " alt="" coords="585,383,719,408"/>
-<area shape="poly" id="edge13_Node000005_Node000013" title=" " alt="" coords="452,242,499,305,533,340,571,369,578,374,576,378,568,374,529,344,495,309,448,246"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/size.html#" title=" " alt="" coords="604,432,700,458"/>
-<area shape="poly" id="edge14_Node000005_Node000014" title=" " alt="" coords="448,243,465,281,492,328,527,377,571,419,590,429,588,434,568,423,523,381,487,331,460,283,443,245"/>
-<area shape="poly" id="edge17_Node000015_Node000003" title=" " alt="" coords="283,142,359,116,360,121,285,147"/>
-<area shape="poly" id="edge18_Node000015_Node000004" title=" " alt="" coords="302,156,334,156,334,161,302,161"/>
-<area shape="poly" id="edge19_Node000015_Node000005" title=" " alt="" coords="285,169,360,195,359,200,283,174"/>
-<area shape="poly" id="edge20_Node000015_Node000015" title=" " alt="" coords="215,146,209,137,213,127,225,121,244,119,265,121,276,128,274,132,264,126,244,124,226,126,217,131,215,136,220,144"/>
-<area shape="poly" id="edge22_Node000016_Node000003" title=" " alt="" coords="261,216,300,182,323,152,332,138,348,124,357,118,360,123,352,128,336,142,327,155,304,185,264,220"/>
-<area shape="poly" id="edge23_Node000016_Node000004" title=" " alt="" coords="279,216,365,182,367,187,281,221"/>
-<area shape="poly" id="edge24_Node000016_Node000005" title=" " alt="" coords="302,226,356,224,356,229,302,232"/>
-<area shape="poly" id="edge25_Node000016_Node000016" title=" " alt="" coords="215,220,209,210,213,200,225,194,244,192,265,195,276,201,274,206,264,200,244,197,226,199,217,204,215,209,220,217"/>
-</map>
diff --git a/d3/db3/lru__cache_8cpp_a6a3be6d8871b1f5dc03688da8f3ee9e6_cgraph.md5 b/d3/db3/lru__cache_8cpp_a6a3be6d8871b1f5dc03688da8f3ee9e6_cgraph.md5
deleted file mode 100644
index 4fb6c6d7a..000000000
--- a/d3/db3/lru__cache_8cpp_a6a3be6d8871b1f5dc03688da8f3ee9e6_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-79a330331c35e1ab368ef1c417a6bda2
\ No newline at end of file
diff --git a/d3/db3/lru__cache_8cpp_a6a3be6d8871b1f5dc03688da8f3ee9e6_cgraph.svg b/d3/db3/lru__cache_8cpp_a6a3be6d8871b1f5dc03688da8f3ee9e6_cgraph.svg
deleted file mode 100644
index 68d059df7..000000000
--- a/d3/db3/lru__cache_8cpp_a6a3be6d8871b1f5dc03688da8f3ee9e6_cgraph.svg
+++ /dev/null
@@ -1,469 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: lru_tests::run_tests Pages: 1 -->
-<!--zoomable 347 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 555;
-var viewHeight = 347;
-var sectionId = 'dynsection-3';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>lru_tests::run_tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function to invoke all test cases.">
-<polygon fill="#999999" stroke="#666666" points="100,-234.25 0,-234.25 0,-215 100,-215 100,-234.25"/>
-<text text-anchor="middle" x="50" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">lru_tests::run_tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.77,-234.54C20.54,-243.15 27.28,-252.25 50,-252.25 62.42,-252.25 70.07,-249.53 72.94,-245.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.36,-244.9 70.59,-236.01 69.56,-246.55 76.36,-244.9"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/db3/lru__cache_8cpp.html#a6401e8f2d41d8cc9cd0e52ab381608d4" target="_top" xlink:title="A simple test case The assert statement will check expected hist and miss to resultant hits and miss.">
-<polygon fill="white" stroke="#666666" points="222.5,-289.25 136,-289.25 136,-270 222.5,-270 222.5,-289.25"/>
-<text text-anchor="middle" x="179.25" y="-275.75" font-family="Helvetica,sans-Serif" font-size="10.00">lru_tests::test_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.07,-234.72C91.15,-242.19 115.01,-252.59 136,-261.62 138.63,-262.76 141.35,-263.92 144.08,-265.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.59,-268.26 153.16,-268.97 145.34,-261.82 142.59,-268.26"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d3/db3/lru__cache_8cpp.html#a4b02e288a407876a8d6024f98a2a25ec" target="_top" xlink:title="A test case contains hits more than cache size The assert statement will check expected hist and miss...">
-<polygon fill="white" stroke="#666666" points="222.5,-234.25 136,-234.25 136,-215 222.5,-215 222.5,-234.25"/>
-<text text-anchor="middle" x="179.25" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">lru_tests::test_2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node15 -->
-<g id="edge16_Node000001_Node000015" class="edge">
-<title>Node1&#45;&gt;Node15</title>
-<g id="a_edge16_Node000001_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.2,-224.62C108.09,-224.62 116.3,-224.62 124.3,-224.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.29,-228.13 134.29,-224.63 124.29,-221.13 124.29,-228.13"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d3/db3/lru__cache_8cpp.html#a01ec21fc91ddafd964ae2035ba7892c0" target="_top" xlink:title="A simple test case The assert statement will check expected hist and miss to resultant hits and miss.">
-<polygon fill="white" stroke="#666666" points="222.5,-179.25 136,-179.25 136,-160 222.5,-160 222.5,-179.25"/>
-<text text-anchor="middle" x="179.25" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">lru_tests::test_3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge21_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge21_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.34,-214.54C94.07,-206.01 122.58,-193.69 144.75,-184.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.88,-187.43 153.67,-180.25 143.1,-181 145.88,-187.43"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge15_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge15_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.02,-289.54C149.79,-298.15 156.53,-307.25 179.25,-307.25 191.67,-307.25 199.32,-304.53 202.19,-300.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.61,-299.9 199.84,-291.01 198.81,-301.55 205.61,-299.9"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933" target="_top" xlink:title="A function to get page hits.">
-<polygon fill="white" stroke="#666666" points="373.88,-288.88 271.62,-288.88 271.62,-258.38 373.88,-258.38 373.88,-288.88"/>
-<text text-anchor="start" x="279.62" y="-275.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="322.75" y="-264.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getHits</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M222.7,-277.82C234.42,-277.33 247.38,-276.78 259.95,-276.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="259.99,-279.75 269.83,-275.83 259.69,-272.75 259.99,-279.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2" target="_top" xlink:title="A function to get page fault.">
-<polygon fill="white" stroke="#666666" points="387,-239.88 258.5,-239.88 258.5,-209.38 387,-209.38 387,-239.88"/>
-<text text-anchor="start" x="266.5" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="322.75" y="-215.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getPageFault</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M206.2,-269.54C224.24,-262.53 248.86,-252.96 270.75,-244.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="271.77,-247.81 279.82,-240.92 269.23,-241.28 271.77,-247.81"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602" target="_top" xlink:title="Refer to a page, or request a page from memory.">
-<polygon fill="white" stroke="#666666" points="371.25,-190.88 274.25,-190.88 274.25,-160.38 371.25,-160.38 371.25,-190.88"/>
-<text text-anchor="start" x="282.25" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="322.75" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::refer</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M210.3,-269.68C214.67,-267.44 218.9,-264.78 222.5,-261.62 246.16,-240.86 234.57,-221.07 258.5,-200.62 260.36,-199.04 262.33,-197.54 264.39,-196.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.73,-199.41 272.54,-191.29 262.15,-193.39 265.73,-199.41"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="522.62,-339.25 447.38,-339.25 447.38,-320 522.62,-320 522.62,-339.25"/>
-<text text-anchor="middle" x="485" y="-325.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M371.59,-189.08C377.3,-192.18 382.64,-195.98 387,-200.62 422.5,-238.43 385.84,-275.44 423,-311.62 426.9,-315.42 431.56,-318.42 436.54,-320.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="435.07,-323.98 445.66,-324.29 437.58,-317.44 435.07,-323.98"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="523.75,-302.25 446.25,-302.25 446.25,-283 523.75,-283 523.75,-302.25"/>
-<text text-anchor="middle" x="485" y="-288.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::begin</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge7_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge7_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M371.65,-190C377.21,-192.94 382.5,-196.45 387,-200.62 413.83,-225.48 395.08,-250.99 423,-274.62 426.65,-277.71 430.81,-280.27 435.21,-282.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="433.76,-285.59 444.35,-286.03 436.35,-279.08 433.76,-285.59"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="547,-265.25 423,-265.25 423,-246 547,-246 547,-265.25"/>
-<text text-anchor="middle" x="485" y="-251.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge8_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge8_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M370.17,-191.31C376.03,-194.05 381.79,-197.15 387,-200.62 406.09,-213.35 403.36,-225.77 423,-237.62 425.03,-238.85 427.15,-240 429.33,-241.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="427.89,-244.26 438.46,-244.97 430.64,-237.82 427.89,-244.26"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="524.12,-228.25 445.88,-228.25 445.88,-209 524.12,-209 524.12,-228.25"/>
-<text text-anchor="middle" x="485" y="-214.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::erase</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge9_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge9_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M371.4,-188.41C391.64,-193.84 415.2,-200.16 435.53,-205.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="434.42,-208.95 444.99,-208.16 436.24,-202.18 434.42,-208.95"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="536.12,-190.88 433.88,-190.88 433.88,-160.38 536.12,-160.38 536.12,-190.88"/>
-<text text-anchor="start" x="441.88" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="485" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">::erase</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge10_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge10_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M371.4,-175.62C387.29,-175.62 405.23,-175.62 422.05,-175.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="421.96,-179.13 431.96,-175.63 421.96,-172.13 421.96,-179.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="536.12,-141.88 433.88,-141.88 433.88,-111.38 536.12,-111.38 536.12,-141.88"/>
-<text text-anchor="start" x="441.88" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="485" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node11 -->
-<g id="edge11_Node000005_Node000011" class="edge">
-<title>Node5&#45;&gt;Node11</title>
-<g id="a_edge11_Node000005_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M371.4,-161.06C387.44,-156.15 405.58,-150.6 422.53,-145.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.48,-148.79 432.02,-142.52 421.44,-142.09 423.48,-148.79"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="533.12,-93.25 436.88,-93.25 436.88,-74 533.12,-74 533.12,-93.25"/>
-<text text-anchor="middle" x="485" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node12 -->
-<g id="edge12_Node000005_Node000012" class="edge">
-<title>Node5&#45;&gt;Node12</title>
-<g id="a_edge12_Node000005_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M341.21,-159.95C360.16,-143.65 391.88,-118.35 423,-102.62 426.52,-100.84 430.24,-99.19 434.04,-97.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="435.24,-100.96 443.42,-94.22 432.82,-94.38 435.24,-100.96"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="535,-56.25 435,-56.25 435,-37 535,-37 535,-56.25"/>
-<text text-anchor="middle" x="485" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node13 -->
-<g id="edge13_Node000005_Node000013" class="edge">
-<title>Node5&#45;&gt;Node13</title>
-<g id="a_edge13_Node000005_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.35,-160.26C349.12,-136.27 382.8,-90.06 423,-64.62 424.85,-63.45 426.79,-62.35 428.78,-61.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="430,-64.61 437.71,-57.34 427.15,-58.22 430,-64.61"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="521.12,-19.25 448.88,-19.25 448.88,0 521.12,0 521.12,-19.25"/>
-<text text-anchor="middle" x="485" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node14 -->
-<g id="edge14_Node000005_Node000014" class="edge">
-<title>Node5&#45;&gt;Node14</title>
-<g id="a_edge14_Node000005_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M329.88,-160.04C342.57,-129.83 374.63,-63.15 423,-27.62 427.44,-24.36 432.46,-21.69 437.68,-19.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="438.84,-22.8 447.09,-16.15 436.5,-16.21 438.84,-22.8"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node3 -->
-<g id="edge17_Node000015_Node000003" class="edge">
-<title>Node15&#45;&gt;Node3</title>
-<g id="a_edge17_Node000015_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.23,-234.66C225.46,-240.28 246.25,-247.48 265.54,-254.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="264.35,-257.45 274.94,-257.42 266.64,-250.84 264.35,-257.45"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node4 -->
-<g id="edge18_Node000015_Node000004" class="edge">
-<title>Node15&#45;&gt;Node4</title>
-<g id="a_edge18_Node000015_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M222.7,-224.62C230.37,-224.62 238.57,-224.62 246.84,-224.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.62,-228.13 256.62,-224.63 246.62,-221.13 246.62,-228.13"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node5 -->
-<g id="edge19_Node000015_Node000005" class="edge">
-<title>Node15&#45;&gt;Node5</title>
-<g id="a_edge19_Node000015_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.23,-214.59C225.46,-208.97 246.25,-201.77 265.54,-195.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.64,-198.41 274.94,-191.83 264.35,-191.8 266.64,-198.41"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node15 -->
-<g id="edge20_Node000015_Node000015" class="edge">
-<title>Node15&#45;&gt;Node15</title>
-<g id="a_edge20_Node000015_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.02,-234.54C149.79,-243.15 156.53,-252.25 179.25,-252.25 191.67,-252.25 199.32,-249.53 202.19,-245.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.61,-244.9 199.84,-236.01 198.81,-246.55 205.61,-244.9"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node3 -->
-<g id="edge22_Node000016_Node000003" class="edge">
-<title>Node16&#45;&gt;Node3</title>
-<g id="a_edge22_Node000016_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M192.94,-179.5C201.59,-186.46 213.14,-196.18 222.5,-205.62 240.05,-223.33 238.29,-234.04 258.5,-248.62 260.48,-250.06 262.56,-251.42 264.7,-252.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.63,-255.58 273.09,-257.26 265.97,-249.42 262.63,-255.58"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node4 -->
-<g id="edge23_Node000016_Node000004" class="edge">
-<title>Node16&#45;&gt;Node4</title>
-<g id="a_edge23_Node000016_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M206.2,-179.71C224.24,-186.72 248.86,-196.29 270.75,-204.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.23,-207.97 279.82,-208.33 271.77,-201.44 269.23,-207.97"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node5 -->
-<g id="edge24_Node000016_Node000005" class="edge">
-<title>Node16&#45;&gt;Node5</title>
-<g id="a_edge24_Node000016_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M222.7,-171.43C235.3,-171.96 249.32,-172.55 262.76,-173.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.22,-176.6 272.36,-173.53 262.52,-169.61 262.22,-176.6"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node16 -->
-<g id="edge25_Node000016_Node000016" class="edge">
-<title>Node16&#45;&gt;Node16</title>
-<g id="a_edge25_Node000016_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.02,-179.54C149.79,-188.15 156.53,-197.25 179.25,-197.25 191.67,-197.25 199.32,-194.53 202.19,-190.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.61,-189.9 199.84,-181.01 198.81,-191.55 205.61,-189.9"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="lru__cache_8cpp_a6a3be6d8871b1f5dc03688da8f3ee9e6_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/db3/lru__cache_8cpp_a6a3be6d8871b1f5dc03688da8f3ee9e6_cgraph_org.svg b/d3/db3/lru__cache_8cpp_a6a3be6d8871b1f5dc03688da8f3ee9e6_cgraph_org.svg
deleted file mode 100644
index 49b135791..000000000
--- a/d3/db3/lru__cache_8cpp_a6a3be6d8871b1f5dc03688da8f3ee9e6_cgraph_org.svg
+++ /dev/null
@@ -1,386 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: lru_tests::run_tests Pages: 1 -->
-<svg width="555pt" height="347pt"
- viewBox="0.00 0.00 555.00 347.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 343.25)">
-<title>lru_tests::run_tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function to invoke all test cases.">
-<polygon fill="#999999" stroke="#666666" points="100,-234.25 0,-234.25 0,-215 100,-215 100,-234.25"/>
-<text text-anchor="middle" x="50" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">lru_tests::run_tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.77,-234.54C20.54,-243.15 27.28,-252.25 50,-252.25 62.42,-252.25 70.07,-249.53 72.94,-245.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.36,-244.9 70.59,-236.01 69.56,-246.55 76.36,-244.9"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/db3/lru__cache_8cpp.html#a6401e8f2d41d8cc9cd0e52ab381608d4" target="_top" xlink:title="A simple test case The assert statement will check expected hist and miss to resultant hits and miss.">
-<polygon fill="white" stroke="#666666" points="222.5,-289.25 136,-289.25 136,-270 222.5,-270 222.5,-289.25"/>
-<text text-anchor="middle" x="179.25" y="-275.75" font-family="Helvetica,sans-Serif" font-size="10.00">lru_tests::test_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.07,-234.72C91.15,-242.19 115.01,-252.59 136,-261.62 138.63,-262.76 141.35,-263.92 144.08,-265.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.59,-268.26 153.16,-268.97 145.34,-261.82 142.59,-268.26"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d3/db3/lru__cache_8cpp.html#a4b02e288a407876a8d6024f98a2a25ec" target="_top" xlink:title="A test case contains hits more than cache size The assert statement will check expected hist and miss...">
-<polygon fill="white" stroke="#666666" points="222.5,-234.25 136,-234.25 136,-215 222.5,-215 222.5,-234.25"/>
-<text text-anchor="middle" x="179.25" y="-220.75" font-family="Helvetica,sans-Serif" font-size="10.00">lru_tests::test_2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node15 -->
-<g id="edge16_Node000001_Node000015" class="edge">
-<title>Node1&#45;&gt;Node15</title>
-<g id="a_edge16_Node000001_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.2,-224.62C108.09,-224.62 116.3,-224.62 124.3,-224.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.29,-228.13 134.29,-224.63 124.29,-221.13 124.29,-228.13"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d3/db3/lru__cache_8cpp.html#a01ec21fc91ddafd964ae2035ba7892c0" target="_top" xlink:title="A simple test case The assert statement will check expected hist and miss to resultant hits and miss.">
-<polygon fill="white" stroke="#666666" points="222.5,-179.25 136,-179.25 136,-160 222.5,-160 222.5,-179.25"/>
-<text text-anchor="middle" x="179.25" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">lru_tests::test_3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge21_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge21_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.34,-214.54C94.07,-206.01 122.58,-193.69 144.75,-184.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.88,-187.43 153.67,-180.25 143.1,-181 145.88,-187.43"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge15_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge15_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.02,-289.54C149.79,-298.15 156.53,-307.25 179.25,-307.25 191.67,-307.25 199.32,-304.53 202.19,-300.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.61,-299.9 199.84,-291.01 198.81,-301.55 205.61,-299.9"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933" target="_top" xlink:title="A function to get page hits.">
-<polygon fill="white" stroke="#666666" points="373.88,-288.88 271.62,-288.88 271.62,-258.38 373.88,-258.38 373.88,-288.88"/>
-<text text-anchor="start" x="279.62" y="-275.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="322.75" y="-264.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getHits</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M222.7,-277.82C234.42,-277.33 247.38,-276.78 259.95,-276.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="259.99,-279.75 269.83,-275.83 259.69,-272.75 259.99,-279.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2" target="_top" xlink:title="A function to get page fault.">
-<polygon fill="white" stroke="#666666" points="387,-239.88 258.5,-239.88 258.5,-209.38 387,-209.38 387,-239.88"/>
-<text text-anchor="start" x="266.5" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="322.75" y="-215.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getPageFault</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M206.2,-269.54C224.24,-262.53 248.86,-252.96 270.75,-244.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="271.77,-247.81 279.82,-240.92 269.23,-241.28 271.77,-247.81"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602" target="_top" xlink:title="Refer to a page, or request a page from memory.">
-<polygon fill="white" stroke="#666666" points="371.25,-190.88 274.25,-190.88 274.25,-160.38 371.25,-160.38 371.25,-190.88"/>
-<text text-anchor="start" x="282.25" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="322.75" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::refer</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M210.3,-269.68C214.67,-267.44 218.9,-264.78 222.5,-261.62 246.16,-240.86 234.57,-221.07 258.5,-200.62 260.36,-199.04 262.33,-197.54 264.39,-196.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.73,-199.41 272.54,-191.29 262.15,-193.39 265.73,-199.41"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="522.62,-339.25 447.38,-339.25 447.38,-320 522.62,-320 522.62,-339.25"/>
-<text text-anchor="middle" x="485" y="-325.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M371.59,-189.08C377.3,-192.18 382.64,-195.98 387,-200.62 422.5,-238.43 385.84,-275.44 423,-311.62 426.9,-315.42 431.56,-318.42 436.54,-320.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="435.07,-323.98 445.66,-324.29 437.58,-317.44 435.07,-323.98"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="523.75,-302.25 446.25,-302.25 446.25,-283 523.75,-283 523.75,-302.25"/>
-<text text-anchor="middle" x="485" y="-288.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::begin</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge7_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge7_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M371.65,-190C377.21,-192.94 382.5,-196.45 387,-200.62 413.83,-225.48 395.08,-250.99 423,-274.62 426.65,-277.71 430.81,-280.27 435.21,-282.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="433.76,-285.59 444.35,-286.03 436.35,-279.08 433.76,-285.59"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="547,-265.25 423,-265.25 423,-246 547,-246 547,-265.25"/>
-<text text-anchor="middle" x="485" y="-251.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge8_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge8_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M370.17,-191.31C376.03,-194.05 381.79,-197.15 387,-200.62 406.09,-213.35 403.36,-225.77 423,-237.62 425.03,-238.85 427.15,-240 429.33,-241.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="427.89,-244.26 438.46,-244.97 430.64,-237.82 427.89,-244.26"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="524.12,-228.25 445.88,-228.25 445.88,-209 524.12,-209 524.12,-228.25"/>
-<text text-anchor="middle" x="485" y="-214.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::erase</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge9_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge9_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M371.4,-188.41C391.64,-193.84 415.2,-200.16 435.53,-205.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="434.42,-208.95 444.99,-208.16 436.24,-202.18 434.42,-208.95"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="536.12,-190.88 433.88,-190.88 433.88,-160.38 536.12,-160.38 536.12,-190.88"/>
-<text text-anchor="start" x="441.88" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="485" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">::erase</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge10_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge10_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M371.4,-175.62C387.29,-175.62 405.23,-175.62 422.05,-175.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="421.96,-179.13 431.96,-175.63 421.96,-172.13 421.96,-179.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="536.12,-141.88 433.88,-141.88 433.88,-111.38 536.12,-111.38 536.12,-141.88"/>
-<text text-anchor="start" x="441.88" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="485" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node11 -->
-<g id="edge11_Node000005_Node000011" class="edge">
-<title>Node5&#45;&gt;Node11</title>
-<g id="a_edge11_Node000005_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M371.4,-161.06C387.44,-156.15 405.58,-150.6 422.53,-145.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.48,-148.79 432.02,-142.52 421.44,-142.09 423.48,-148.79"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="533.12,-93.25 436.88,-93.25 436.88,-74 533.12,-74 533.12,-93.25"/>
-<text text-anchor="middle" x="485" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node12 -->
-<g id="edge12_Node000005_Node000012" class="edge">
-<title>Node5&#45;&gt;Node12</title>
-<g id="a_edge12_Node000005_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M341.21,-159.95C360.16,-143.65 391.88,-118.35 423,-102.62 426.52,-100.84 430.24,-99.19 434.04,-97.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="435.24,-100.96 443.42,-94.22 432.82,-94.38 435.24,-100.96"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="535,-56.25 435,-56.25 435,-37 535,-37 535,-56.25"/>
-<text text-anchor="middle" x="485" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node13 -->
-<g id="edge13_Node000005_Node000013" class="edge">
-<title>Node5&#45;&gt;Node13</title>
-<g id="a_edge13_Node000005_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.35,-160.26C349.12,-136.27 382.8,-90.06 423,-64.62 424.85,-63.45 426.79,-62.35 428.78,-61.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="430,-64.61 437.71,-57.34 427.15,-58.22 430,-64.61"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="521.12,-19.25 448.88,-19.25 448.88,0 521.12,0 521.12,-19.25"/>
-<text text-anchor="middle" x="485" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node14 -->
-<g id="edge14_Node000005_Node000014" class="edge">
-<title>Node5&#45;&gt;Node14</title>
-<g id="a_edge14_Node000005_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M329.88,-160.04C342.57,-129.83 374.63,-63.15 423,-27.62 427.44,-24.36 432.46,-21.69 437.68,-19.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="438.84,-22.8 447.09,-16.15 436.5,-16.21 438.84,-22.8"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node3 -->
-<g id="edge17_Node000015_Node000003" class="edge">
-<title>Node15&#45;&gt;Node3</title>
-<g id="a_edge17_Node000015_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.23,-234.66C225.46,-240.28 246.25,-247.48 265.54,-254.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="264.35,-257.45 274.94,-257.42 266.64,-250.84 264.35,-257.45"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node4 -->
-<g id="edge18_Node000015_Node000004" class="edge">
-<title>Node15&#45;&gt;Node4</title>
-<g id="a_edge18_Node000015_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M222.7,-224.62C230.37,-224.62 238.57,-224.62 246.84,-224.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.62,-228.13 256.62,-224.63 246.62,-221.13 246.62,-228.13"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node5 -->
-<g id="edge19_Node000015_Node000005" class="edge">
-<title>Node15&#45;&gt;Node5</title>
-<g id="a_edge19_Node000015_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.23,-214.59C225.46,-208.97 246.25,-201.77 265.54,-195.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.64,-198.41 274.94,-191.83 264.35,-191.8 266.64,-198.41"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node15 -->
-<g id="edge20_Node000015_Node000015" class="edge">
-<title>Node15&#45;&gt;Node15</title>
-<g id="a_edge20_Node000015_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.02,-234.54C149.79,-243.15 156.53,-252.25 179.25,-252.25 191.67,-252.25 199.32,-249.53 202.19,-245.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.61,-244.9 199.84,-236.01 198.81,-246.55 205.61,-244.9"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node3 -->
-<g id="edge22_Node000016_Node000003" class="edge">
-<title>Node16&#45;&gt;Node3</title>
-<g id="a_edge22_Node000016_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M192.94,-179.5C201.59,-186.46 213.14,-196.18 222.5,-205.62 240.05,-223.33 238.29,-234.04 258.5,-248.62 260.48,-250.06 262.56,-251.42 264.7,-252.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.63,-255.58 273.09,-257.26 265.97,-249.42 262.63,-255.58"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node4 -->
-<g id="edge23_Node000016_Node000004" class="edge">
-<title>Node16&#45;&gt;Node4</title>
-<g id="a_edge23_Node000016_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M206.2,-179.71C224.24,-186.72 248.86,-196.29 270.75,-204.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.23,-207.97 279.82,-208.33 271.77,-201.44 269.23,-207.97"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node5 -->
-<g id="edge24_Node000016_Node000005" class="edge">
-<title>Node16&#45;&gt;Node5</title>
-<g id="a_edge24_Node000016_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M222.7,-171.43C235.3,-171.96 249.32,-172.55 262.76,-173.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.22,-176.6 272.36,-173.53 262.52,-169.61 262.22,-176.6"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node16 -->
-<g id="edge25_Node000016_Node000016" class="edge">
-<title>Node16&#45;&gt;Node16</title>
-<g id="a_edge25_Node000016_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.02,-179.54C149.79,-188.15 156.53,-197.25 179.25,-197.25 191.67,-197.25 199.32,-194.53 202.19,-190.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.61,-189.9 199.84,-181.01 198.81,-191.55 205.61,-189.9"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/db3/lru__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/db3/lru__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 79d2b7f3b..000000000
--- a/d3/db3/lru__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,32 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,128,55,153"/>
-<area shape="rect" id="Node000002" href="$d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53" title="A function to display the current cache." alt="" coords="121,5,256,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="39,125,65,94,101,62,118,51,121,56,104,66,69,98,43,129"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="369,13,440,38"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="54,126,102,106,218,71,353,36,355,41,219,77,104,111,56,131"/>
-<area shape="rect" id="Node000004" href="$d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933" title="A function to get page hits." alt="" coords="120,120,256,161"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="55,138,104,138,104,143,55,143"/>
-<area shape="rect" id="Node000005" href="$d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2" title="A function to get page fault." alt="" coords="103,185,274,226"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="56,149,104,170,120,177,118,182,102,175,54,154"/>
-<area shape="rect" id="Node000006" href="$d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602" title="Refer to a page, or request a page from memory." alt="" coords="124,255,253,295"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="40,152,66,193,84,216,104,236,117,245,114,249,101,240,80,219,61,196,36,155"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="256,23,353,23,353,28,256,28"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/back.html#" title=" " alt="" coords="354,62,455,88"/>
-<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="251,252,272,236,284,219,291,201,294,167,298,132,306,115,320,97,339,85,342,89,324,101,310,117,303,134,300,168,296,203,289,221,276,240,255,256"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/begin.html#" title=" " alt="" coords="353,112,456,137"/>
-<area shape="poly" id="edge8_Node000006_Node000008" title=" " alt="" coords="249,252,272,236,288,214,295,191,302,169,320,146,337,136,340,140,324,150,307,171,300,193,293,216,276,240,252,256"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/end.html#" title=" " alt="" coords="322,161,487,186"/>
-<area shape="poly" id="edge9_Node000006_Node000009" title=" " alt="" coords="242,252,272,235,296,215,321,195,331,190,334,195,323,200,299,219,276,240,244,256"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/erase.html#" title=" " alt="" coords="352,210,457,236"/>
-<area shape="poly" id="edge10_Node000006_Node000010" title=" " alt="" coords="253,257,336,237,338,242,254,262"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/erase.html#" title=" " alt="" coords="336,260,473,301"/>
-<area shape="poly" id="edge11_Node000006_Node000011" title=" " alt="" coords="253,274,321,276,321,281,253,279"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/find.html#" title=" " alt="" coords="336,325,473,366"/>
-<area shape="poly" id="edge12_Node000006_Node000012" title=" " alt="" coords="253,293,327,318,325,323,252,298"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/pop_back.html#" title=" " alt="" coords="340,390,469,416"/>
-<area shape="poly" id="edge13_Node000006_Node000013" title=" " alt="" coords="213,294,262,335,323,375,338,382,335,387,321,380,258,339,210,298"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/push_front.html#" title=" " alt="" coords="338,440,471,465"/>
-<area shape="poly" id="edge14_Node000006_Node000014" title=" " alt="" coords="204,294,251,359,285,395,324,426,331,430,328,435,320,431,281,399,247,363,200,297"/>
-<area shape="rect" id="Node000015" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/size.html#" title=" " alt="" coords="356,489,453,514"/>
-<area shape="poly" id="edge15_Node000006_Node000015" title=" " alt="" coords="200,295,217,333,243,382,279,433,324,476,343,486,340,491,320,480,275,436,239,385,212,336,195,297"/>
-</map>
diff --git a/d3/db3/lru__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/db3/lru__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 698607137..000000000
--- a/d3/db3/lru__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-388ec1b39a65a15b637301df049b3908
\ No newline at end of file
diff --git a/d3/db3/lru__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/db3/lru__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 768ec67e3..000000000
--- a/d3/db3/lru__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,314 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="370pt" height="390pt"
- viewBox="0.00 0.00 369.50 389.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 385.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-290.25 0,-290.25 0,-271 37,-271 37,-290.25"/>
-<text text-anchor="middle" x="18.5" y="-276.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53" target="_top" xlink:title="A function to display the current cache.">
-<polygon fill="white" stroke="#666666" points="188,-381.88 86.5,-381.88 86.5,-351.38 188,-351.38 188,-381.88"/>
-<text text-anchor="start" x="94.5" y="-368.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="137.25" y="-357.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.88,-290.61C36.41,-302.95 54.05,-324 73,-337.62 77.03,-340.52 81.39,-343.23 85.87,-345.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.98,-348.71 94.46,-350.23 87.21,-342.5 83.98,-348.71"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="326.25,-376.25 272.75,-376.25 272.75,-357 326.25,-357 326.25,-376.25"/>
-<text text-anchor="middle" x="299.5" y="-362.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.05,-289.32C47.36,-294.22 60.74,-300.22 73,-304.62 107.78,-317.12 207.13,-343.2 261.63,-357.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.51,-360.55 271.07,-359.65 262.26,-353.77 260.51,-360.55"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933" target="_top" xlink:title="A function to get page hits.">
-<polygon fill="white" stroke="#666666" points="188.38,-295.88 86.12,-295.88 86.12,-265.38 188.38,-265.38 188.38,-295.88"/>
-<text text-anchor="start" x="94.12" y="-282.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="137.25" y="-271.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getHits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.49,-280.62C47.58,-280.62 60.84,-280.62 74.34,-280.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.17,-284.13 84.17,-280.63 74.17,-277.13 74.17,-284.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2" target="_top" xlink:title="A function to get page fault.">
-<polygon fill="white" stroke="#666666" points="201.5,-246.88 73,-246.88 73,-216.38 201.5,-216.38 201.5,-246.88"/>
-<text text-anchor="start" x="81" y="-233.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="137.25" y="-222.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getPageFault</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.25,-272.42C47.62,-267.69 60.99,-261.69 73,-256.62 76.99,-254.94 81.13,-253.23 85.3,-251.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.28,-254.91 94.25,-247.92 83.66,-248.42 86.28,-254.91"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602" target="_top" xlink:title="Refer to a page, or request a page from memory.">
-<polygon fill="white" stroke="#666666" points="185.75,-194.88 88.75,-194.88 88.75,-164.38 185.75,-164.38 185.75,-194.88"/>
-<text text-anchor="start" x="96.75" y="-181.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="137.25" y="-170.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::refer</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.6,-270.6C32.88,-255.21 50.6,-225.65 73,-207.62 76.04,-205.18 79.33,-202.9 82.75,-200.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.29,-203.94 91.33,-196.02 80.89,-197.82 84.29,-203.94"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.08,-366.62C211.64,-366.62 239.31,-366.62 261.06,-366.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.95,-370.13 270.95,-366.63 260.95,-363.13 260.95,-370.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="337.12,-339.25 261.88,-339.25 261.88,-320 337.12,-320 337.12,-339.25"/>
-<text text-anchor="middle" x="299.5" y="-325.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.73,-195.31C191.56,-198.7 197.03,-202.76 201.5,-207.62 234.61,-243.63 202.12,-277.85 237.5,-311.62 241.44,-315.38 246.12,-318.36 251.11,-320.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="249.66,-323.91 260.25,-324.21 252.15,-317.37 249.66,-323.91"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="338.25,-302.25 260.75,-302.25 260.75,-283 338.25,-283 338.25,-302.25"/>
-<text text-anchor="middle" x="299.5" y="-288.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::begin</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge8_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge8_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.74,-195.29C190.14,-198.73 196.3,-202.81 201.5,-207.62 226.3,-230.6 211.26,-253.31 237.5,-274.62 241.21,-277.64 245.41,-280.15 249.83,-282.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.42,-285.45 259.01,-285.84 250.98,-278.93 248.42,-285.45"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="361.5,-265.25 237.5,-265.25 237.5,-246 361.5,-246 361.5,-265.25"/>
-<text text-anchor="middle" x="299.5" y="-251.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge9_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge9_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M178.26,-195.31C186.17,-198.97 194.26,-203.13 201.5,-207.62 219.19,-218.61 219.13,-227.81 237.5,-237.62 240.01,-238.97 242.64,-240.22 245.33,-241.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.93,-244.61 254.52,-244.96 246.47,-238.08 243.93,-244.61"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="338.62,-228.25 260.38,-228.25 260.38,-209 338.62,-209 338.62,-228.25"/>
-<text text-anchor="middle" x="299.5" y="-214.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::erase</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge10_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge10_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.9,-191.22C205.73,-196.05 228.77,-201.65 248.81,-206.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="247.9,-209.91 258.44,-208.88 249.55,-203.11 247.9,-209.91"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="350.62,-190.88 248.38,-190.88 248.38,-160.38 350.62,-160.38 350.62,-190.88"/>
-<text text-anchor="start" x="256.38" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="299.5" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">::erase</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge11_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge11_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.9,-178.44C201.79,-178.04 219.73,-177.59 236.55,-177.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.55,-180.67 246.46,-176.92 236.37,-173.67 236.55,-180.67"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="350.62,-141.88 248.38,-141.88 248.38,-111.38 350.62,-111.38 350.62,-141.88"/>
-<text text-anchor="start" x="256.38" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="299.5" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node12 -->
-<g id="edge12_Node000006_Node000012" class="edge">
-<title>Node6&#45;&gt;Node12</title>
-<g id="a_edge12_Node000006_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.46,-164.01C202.67,-158.32 222.33,-151.82 240.37,-145.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="241.24,-149.25 249.63,-142.79 239.04,-142.6 241.24,-149.25"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="347.62,-93.25 251.38,-93.25 251.38,-74 347.62,-74 347.62,-93.25"/>
-<text text-anchor="middle" x="299.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node13 -->
-<g id="edge13_Node000006_Node000013" class="edge">
-<title>Node6&#45;&gt;Node13</title>
-<g id="a_edge13_Node000006_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.52,-163.98C173.2,-146.78 205.4,-119.37 237.5,-102.62 240.95,-100.83 244.6,-99.16 248.32,-97.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="249.38,-100.97 257.53,-94.2 246.93,-94.42 249.38,-100.97"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="349.5,-56.25 249.5,-56.25 249.5,-37 349.5,-37 349.5,-56.25"/>
-<text text-anchor="middle" x="299.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node14 -->
-<g id="edge14_Node000006_Node000014" class="edge">
-<title>Node6&#45;&gt;Node14</title>
-<g id="a_edge14_Node000006_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.46,-164.1C162.93,-139.35 196.5,-91.07 237.5,-64.62 239.34,-63.44 241.27,-62.32 243.25,-61.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.48,-64.57 252.16,-57.27 241.6,-58.18 244.48,-64.57"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="335.62,-19.25 263.38,-19.25 263.38,0 335.62,0 335.62,-19.25"/>
-<text text-anchor="middle" x="299.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node15 -->
-<g id="edge15_Node000006_Node000015" class="edge">
-<title>Node6&#45;&gt;Node15</title>
-<g id="a_edge15_Node000006_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.07,-164.1C156.42,-133.3 188.19,-64.31 237.5,-27.62 241.92,-24.34 246.93,-21.65 252.14,-19.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.3,-22.75 261.54,-16.09 250.95,-16.16 253.3,-22.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/db3/lru__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/db3/lru__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 935776d2f..000000000
--- a/d3/db3/lru__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,288 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="370pt" height="390pt"
- viewBox="0.00 0.00 369.50 389.88" 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 385.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-290.25 0,-290.25 0,-271 37,-271 37,-290.25"/>
-<text text-anchor="middle" x="18.5" y="-276.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53" target="_top" xlink:title="A function to display the current cache.">
-<polygon fill="white" stroke="#666666" points="188,-381.88 86.5,-381.88 86.5,-351.38 188,-351.38 188,-381.88"/>
-<text text-anchor="start" x="94.5" y="-368.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="137.25" y="-357.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.88,-290.61C36.41,-302.95 54.05,-324 73,-337.62 77.03,-340.52 81.39,-343.23 85.87,-345.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.98,-348.71 94.46,-350.23 87.21,-342.5 83.98,-348.71"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="326.25,-376.25 272.75,-376.25 272.75,-357 326.25,-357 326.25,-376.25"/>
-<text text-anchor="middle" x="299.5" y="-362.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.05,-289.32C47.36,-294.22 60.74,-300.22 73,-304.62 107.78,-317.12 207.13,-343.2 261.63,-357.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.51,-360.55 271.07,-359.65 262.26,-353.77 260.51,-360.55"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933" target="_top" xlink:title="A function to get page hits.">
-<polygon fill="white" stroke="#666666" points="188.38,-295.88 86.12,-295.88 86.12,-265.38 188.38,-265.38 188.38,-295.88"/>
-<text text-anchor="start" x="94.12" y="-282.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="137.25" y="-271.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getHits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.49,-280.62C47.58,-280.62 60.84,-280.62 74.34,-280.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.17,-284.13 84.17,-280.63 74.17,-277.13 74.17,-284.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2" target="_top" xlink:title="A function to get page fault.">
-<polygon fill="white" stroke="#666666" points="201.5,-246.88 73,-246.88 73,-216.38 201.5,-216.38 201.5,-246.88"/>
-<text text-anchor="start" x="81" y="-233.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="137.25" y="-222.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::getPageFault</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.25,-272.42C47.62,-267.69 60.99,-261.69 73,-256.62 76.99,-254.94 81.13,-253.23 85.3,-251.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.28,-254.91 94.25,-247.92 83.66,-248.42 86.28,-254.91"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602" target="_top" xlink:title="Refer to a page, or request a page from memory.">
-<polygon fill="white" stroke="#666666" points="185.75,-194.88 88.75,-194.88 88.75,-164.38 185.75,-164.38 185.75,-194.88"/>
-<text text-anchor="start" x="96.75" y="-181.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="137.25" y="-170.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::refer</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.6,-270.6C32.88,-255.21 50.6,-225.65 73,-207.62 76.04,-205.18 79.33,-202.9 82.75,-200.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.29,-203.94 91.33,-196.02 80.89,-197.82 84.29,-203.94"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.08,-366.62C211.64,-366.62 239.31,-366.62 261.06,-366.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.95,-370.13 270.95,-366.63 260.95,-363.13 260.95,-370.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="337.12,-339.25 261.88,-339.25 261.88,-320 337.12,-320 337.12,-339.25"/>
-<text text-anchor="middle" x="299.5" y="-325.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.73,-195.31C191.56,-198.7 197.03,-202.76 201.5,-207.62 234.61,-243.63 202.12,-277.85 237.5,-311.62 241.44,-315.38 246.12,-318.36 251.11,-320.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="249.66,-323.91 260.25,-324.21 252.15,-317.37 249.66,-323.91"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="338.25,-302.25 260.75,-302.25 260.75,-283 338.25,-283 338.25,-302.25"/>
-<text text-anchor="middle" x="299.5" y="-288.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::begin</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge8_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge8_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.74,-195.29C190.14,-198.73 196.3,-202.81 201.5,-207.62 226.3,-230.6 211.26,-253.31 237.5,-274.62 241.21,-277.64 245.41,-280.15 249.83,-282.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.42,-285.45 259.01,-285.84 250.98,-278.93 248.42,-285.45"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="361.5,-265.25 237.5,-265.25 237.5,-246 361.5,-246 361.5,-265.25"/>
-<text text-anchor="middle" x="299.5" y="-251.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge9_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge9_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M178.26,-195.31C186.17,-198.97 194.26,-203.13 201.5,-207.62 219.19,-218.61 219.13,-227.81 237.5,-237.62 240.01,-238.97 242.64,-240.22 245.33,-241.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.93,-244.61 254.52,-244.96 246.47,-238.08 243.93,-244.61"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="338.62,-228.25 260.38,-228.25 260.38,-209 338.62,-209 338.62,-228.25"/>
-<text text-anchor="middle" x="299.5" y="-214.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::erase</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge10_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge10_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.9,-191.22C205.73,-196.05 228.77,-201.65 248.81,-206.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="247.9,-209.91 258.44,-208.88 249.55,-203.11 247.9,-209.91"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="350.62,-190.88 248.38,-190.88 248.38,-160.38 350.62,-160.38 350.62,-190.88"/>
-<text text-anchor="start" x="256.38" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="299.5" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">::erase</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge11_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge11_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.9,-178.44C201.79,-178.04 219.73,-177.59 236.55,-177.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.55,-180.67 246.46,-176.92 236.37,-173.67 236.55,-180.67"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="350.62,-141.88 248.38,-141.88 248.38,-111.38 350.62,-111.38 350.62,-141.88"/>
-<text text-anchor="start" x="256.38" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="299.5" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node12 -->
-<g id="edge12_Node000006_Node000012" class="edge">
-<title>Node6&#45;&gt;Node12</title>
-<g id="a_edge12_Node000006_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.46,-164.01C202.67,-158.32 222.33,-151.82 240.37,-145.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="241.24,-149.25 249.63,-142.79 239.04,-142.6 241.24,-149.25"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="347.62,-93.25 251.38,-93.25 251.38,-74 347.62,-74 347.62,-93.25"/>
-<text text-anchor="middle" x="299.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node13 -->
-<g id="edge13_Node000006_Node000013" class="edge">
-<title>Node6&#45;&gt;Node13</title>
-<g id="a_edge13_Node000006_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.52,-163.98C173.2,-146.78 205.4,-119.37 237.5,-102.62 240.95,-100.83 244.6,-99.16 248.32,-97.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="249.38,-100.97 257.53,-94.2 246.93,-94.42 249.38,-100.97"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="349.5,-56.25 249.5,-56.25 249.5,-37 349.5,-37 349.5,-56.25"/>
-<text text-anchor="middle" x="299.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node14 -->
-<g id="edge14_Node000006_Node000014" class="edge">
-<title>Node6&#45;&gt;Node14</title>
-<g id="a_edge14_Node000006_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.46,-164.1C162.93,-139.35 196.5,-91.07 237.5,-64.62 239.34,-63.44 241.27,-62.32 243.25,-61.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.48,-64.57 252.16,-57.27 241.6,-58.18 244.48,-64.57"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="335.62,-19.25 263.38,-19.25 263.38,0 335.62,0 335.62,-19.25"/>
-<text text-anchor="middle" x="299.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node15 -->
-<g id="edge15_Node000006_Node000015" class="edge">
-<title>Node6&#45;&gt;Node15</title>
-<g id="a_edge15_Node000006_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.07,-164.1C156.42,-133.3 188.19,-64.31 237.5,-27.62 241.92,-24.34 246.93,-21.65 252.14,-19.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.3,-22.75 261.54,-16.09 250.95,-16.16 253.3,-22.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/db3/lru__cache_8cpp_source.html b/d3/db3/lru__cache_8cpp_source.html
new file mode 100644
index 000000000..10c960b92
--- /dev/null
+++ b/d3/db3/lru__cache_8cpp_source.html
@@ -0,0 +1,331 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/lru_cache.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/db3/lru__cache_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">lru_cache.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/db3/lru__cache_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="preprocessor">#include &lt;cassert&gt;</span>        </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="preprocessor">#include &lt;iostream&gt;</span>       </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="preprocessor">#include &lt;list&gt;</span>           </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="preprocessor">#include &lt;unordered_map&gt;</span>  </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/d6f/namespaceothers.html">others</a> {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/dcd/namespacelru__cache.html">lru_cache</a> {</div>
+<div class="foldopen" id="foldopen00068" data-start="{" data-end="};">
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"><a class="line" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html">   68</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html">LRUCache</a> {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a1aafd0444b410e0fcb66287e9954c893">   69</a></span>    uint64_t <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a1aafd0444b410e0fcb66287e9954c893">pageFrame</a>;         </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"><a class="line" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8">   70</a></span>    std::list&lt;uint64_t&gt; <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>;  </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::unordered_map&lt;uint64_t, std::list&lt;uint64_t&gt;::iterator&gt;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"><a class="line" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa4d6db56109af196ffc7e5f72bc9907c">   72</a></span>        <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa4d6db56109af196ffc7e5f72bc9907c">pageMap</a>;  </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a5f33913e7ddfbb38062362e7bd859154">   74</a></span>    uint64_t <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a5f33913e7ddfbb38062362e7bd859154">hits</a> =</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        0;  </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a09cbe562b0c396329607f5d388d57c9c">   77</a></span>    uint64_t <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a09cbe562b0c396329607f5d388d57c9c">pageFault</a> = 0;  </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"><a class="line" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4">   85</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4">LRUCache</a>(uint64_t pf) { <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a1aafd0444b410e0fcb66287e9954c893">pageFrame</a> = pf; }</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="foldopen" id="foldopen00092" data-start="{" data-end="}">
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">   92</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(uint64_t page) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        <span class="comment">// If the page requested not in cache.</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa4d6db56109af196ffc7e5f72bc9907c">pageMap</a>.find(page) == <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa4d6db56109af196ffc7e5f72bc9907c">pageMap</a>.end()) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>            <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a09cbe562b0c396329607f5d388d57c9c">pageFault</a>++;  </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            <span class="comment">// Check if the cache is full</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>.size() == <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a1aafd0444b410e0fcb66287e9954c893">pageFrame</a>) {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>                <span class="comment">// delete the last page from cache</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>                uint64_t lastPage = <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>.back();</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>                <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>.pop_back();</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>                <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa4d6db56109af196ffc7e5f72bc9907c">pageMap</a>.erase(lastPage);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>            }</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        }</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        <span class="comment">// The requested page is in the cache</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>            <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a5f33913e7ddfbb38062362e7bd859154">hits</a>++;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>            <span class="comment">// present in cache, erase from current position to bring in front</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>.erase(<a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa4d6db56109af196ffc7e5f72bc9907c">pageMap</a>[page]);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        }</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        <span class="comment">// Push it in the front of the cache and update the page reference in</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        <span class="comment">// page map.</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>.push_front(page);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa4d6db56109af196ffc7e5f72bc9907c">pageMap</a>[page] = <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>.begin();</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    }</div>
+</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="foldopen" id="foldopen00121" data-start="{" data-end="}">
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"><a class="line" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53">  121</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53">display</a>() {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        <span class="keywordflow">for</span> (uint64_t &amp;it : <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>) {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>            std::cout &lt;&lt; it &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        }</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    }</div>
+</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"><a class="line" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933">  131</a></span>    uint64_t <a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933">getHits</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a5f33913e7ddfbb38062362e7bd859154">hits</a>; }</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"><a class="line" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2">  136</a></span>    uint64_t <a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2">getPageFault</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a09cbe562b0c396329607f5d388d57c9c">pageFault</a>; }</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>};</div>
+</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>}  <span class="comment">// namespace lru_cache</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>}  <span class="comment">// namespace others</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span><span class="keyword">namespace </span>lru_tests {</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00149" data-start="{" data-end="}">
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"><a class="line" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">  149</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(T msg) {</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    <span class="comment">// It&#39;s just to avoid writing cout and endl</span></div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;[TESTS] : ---&gt; &quot;</span> &lt;&lt; msg &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>}</div>
+</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span> </div>
+<div class="foldopen" id="foldopen00160" data-start="{" data-end="}">
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"><a class="line" href="../../d3/db3/lru__cache_8cpp.html#a6401e8f2d41d8cc9cd0e52ab381608d4">  160</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a6401e8f2d41d8cc9cd0e52ab381608d4">test_1</a>() {</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    uint64_t expected_hits = 2;</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    uint64_t expected_pageFault = 4;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span> </div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Running Test-1...&quot;</span>);</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span> </div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    <a class="code hl_class" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html">others::lru_cache::LRUCache</a> cache(4);</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(1);</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(2);</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(5);</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(1);</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(4);</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(5);</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span> </div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Checking assert statement...&quot;</span>);</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    assert(cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933">getHits</a>() == expected_hits &amp;&amp;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>           cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2">getPageFault</a>() == expected_pageFault);</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Assert successful!&quot;</span>);</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Test-1 complete!&quot;</span>);</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>}</div>
+</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span> </div>
+<div class="foldopen" id="foldopen00187" data-start="{" data-end="}">
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"><a class="line" href="../../d3/db3/lru__cache_8cpp.html#a4b02e288a407876a8d6024f98a2a25ec">  187</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a4b02e288a407876a8d6024f98a2a25ec">test_2</a>() {</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    uint64_t expected_hits = 4;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    uint64_t expected_pageFault = 2;</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span> </div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Running Test-2...&quot;</span>);</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span> </div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    <a class="code hl_class" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html">others::lru_cache::LRUCache</a> cache(4);</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(1);</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(1);</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(1);</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(1);</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(1);</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(5);</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span> </div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Checking assert statement...&quot;</span>);</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    assert(cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933">getHits</a>() == expected_hits &amp;&amp;</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>           cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2">getPageFault</a>() == expected_pageFault);</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Assert successful!&quot;</span>);</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Test-2 complete!&quot;</span>);</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>}</div>
+</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span> </div>
+<div class="foldopen" id="foldopen00214" data-start="{" data-end="}">
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"><a class="line" href="../../d3/db3/lru__cache_8cpp.html#a01ec21fc91ddafd964ae2035ba7892c0">  214</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a01ec21fc91ddafd964ae2035ba7892c0">test_3</a>() {</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    uint64_t expected_hits = 1;</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    uint64_t expected_pageFault = 5;</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span> </div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Running Test-3...&quot;</span>);</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span> </div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    <a class="code hl_class" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html">others::lru_cache::LRUCache</a> cache(4);</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(1);</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(2);</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(3);</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(4);</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(5);</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(5);</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span> </div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Checking assert statement...&quot;</span>);</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    assert(cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933">getHits</a>() == expected_hits &amp;&amp;</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>           cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2">getPageFault</a>() == expected_pageFault);</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Assert successful!&quot;</span>);</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;Test-3 complete!&quot;</span>);</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>}</div>
+</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span> </div>
+<div class="foldopen" id="foldopen00239" data-start="{" data-end="}">
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"><a class="line" href="../../d3/db3/lru__cache_8cpp.html#a6a3be6d8871b1f5dc03688da8f3ee9e6">  239</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a6a3be6d8871b1f5dc03688da8f3ee9e6">run_tests</a>() {</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a6401e8f2d41d8cc9cd0e52ab381608d4">test_1</a>();</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a4b02e288a407876a8d6024f98a2a25ec">test_2</a>();</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a01ec21fc91ddafd964ae2035ba7892c0">test_3</a>();</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;&quot;</span>);</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">log</a>(<span class="stringliteral">&quot;TESTS COMPLETED!&quot;</span>);</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>}</div>
+</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>}  <span class="comment">// namespace lru_tests</span></div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span> </div>
+<div class="foldopen" id="foldopen00252" data-start="{" data-end="}">
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"><a class="line" href="../../d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  252</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    lru_tests::run_tests();</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span> </div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>    <span class="comment">// Usage</span></div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    <a class="code hl_class" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html">others::lru_cache::LRUCache</a> cache(4);</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(1);</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(2);</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(3);</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(4);</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(5);</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">refer</a>(5);</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span> </div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>    cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53">display</a>();</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span> </div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hits: &quot;</span> &lt;&lt; cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933">getHits</a>()</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>              &lt;&lt; <span class="stringliteral">&quot; Miss: &quot;</span> &lt;&lt; cache.<a class="code hl_function" href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2">getPageFault</a>() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>}</div>
+</div>
+<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html"><div class="ttname"><a href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html">others::lru_cache::LRUCache</a></div><div class="ttdoc">LRU cache class.</div><div class="ttdef"><b>Definition</b> <a href="#l00068">lru_cache.cpp:68</a></div></div>
+<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_a09cbe562b0c396329607f5d388d57c9c"><div class="ttname"><a href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a09cbe562b0c396329607f5d388d57c9c">others::lru_cache::LRUCache::pageFault</a></div><div class="ttdeci">uint64_t pageFault</div><div class="ttdef"><b>Definition</b> <a href="#l00077">lru_cache.cpp:77</a></div></div>
+<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_a1aafd0444b410e0fcb66287e9954c893"><div class="ttname"><a href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a1aafd0444b410e0fcb66287e9954c893">others::lru_cache::LRUCache::pageFrame</a></div><div class="ttdeci">uint64_t pageFrame</div><div class="ttdoc">Page frame, or total size of the cache.</div><div class="ttdef"><b>Definition</b> <a href="#l00069">lru_cache.cpp:69</a></div></div>
+<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_a3ee3560a6b90e6f50f6e063d690ba8e8"><div class="ttname"><a href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8">others::lru_cache::LRUCache::cache</a></div><div class="ttdeci">std::list&lt; uint64_t &gt; cache</div><div class="ttdoc">Cache linked list (using the STL)</div><div class="ttdef"><b>Definition</b> <a href="#l00070">lru_cache.cpp:70</a></div></div>
+<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_a41c9b6f1693b8a316cc4a2d8c9149ba4"><div class="ttname"><a href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4">others::lru_cache::LRUCache::LRUCache</a></div><div class="ttdeci">LRUCache(uint64_t pf)</div><div class="ttdoc">Constructor, Initialize thee LRU class with page frame.</div><div class="ttdef"><b>Definition</b> <a href="#l00085">lru_cache.cpp:85</a></div></div>
+<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_a5f33913e7ddfbb38062362e7bd859154"><div class="ttname"><a href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a5f33913e7ddfbb38062362e7bd859154">others::lru_cache::LRUCache::hits</a></div><div class="ttdeci">uint64_t hits</div><div class="ttdoc">was found in cache.</div><div class="ttdef"><b>Definition</b> <a href="#l00074">lru_cache.cpp:74</a></div></div>
+<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_a78be932dac71c90f485a67d4fda877e2"><div class="ttname"><a href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2">others::lru_cache::LRUCache::getPageFault</a></div><div class="ttdeci">uint64_t getPageFault() const</div><div class="ttdoc">A function to get page fault.</div><div class="ttdef"><b>Definition</b> <a href="#l00136">lru_cache.cpp:136</a></div></div>
+<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_a7dbf04bf7e1472c48639694f0b110602"><div class="ttname"><a href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602">others::lru_cache::LRUCache::refer</a></div><div class="ttdeci">void refer(uint64_t page)</div><div class="ttdoc">Refer to a page, or request a page from memory.</div><div class="ttdef"><b>Definition</b> <a href="#l00092">lru_cache.cpp:92</a></div></div>
+<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_aa24a141455b9fbcbec22392c28d04933"><div class="ttname"><a href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933">others::lru_cache::LRUCache::getHits</a></div><div class="ttdeci">uint64_t getHits() const</div><div class="ttdoc">A function to get page hits.</div><div class="ttdef"><b>Definition</b> <a href="#l00131">lru_cache.cpp:131</a></div></div>
+<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_aa4d6db56109af196ffc7e5f72bc9907c"><div class="ttname"><a href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa4d6db56109af196ffc7e5f72bc9907c">others::lru_cache::LRUCache::pageMap</a></div><div class="ttdeci">std::unordered_map&lt; uint64_t, std::list&lt; uint64_t &gt;::iterator &gt; pageMap</div><div class="ttdoc">Hash map containing pages and their addresses.</div><div class="ttdef"><b>Definition</b> <a href="#l00072">lru_cache.cpp:72</a></div></div>
+<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_aad506b1c1a3cd5b93cc7e497626bfb53"><div class="ttname"><a href="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53">others::lru_cache::LRUCache::display</a></div><div class="ttdeci">void display()</div><div class="ttdoc">A function to display the current cache.</div><div class="ttdef"><b>Definition</b> <a href="#l00121">lru_cache.cpp:121</a></div></div>
+<div class="ttc" id="alru__cache_8cpp_html_a01ec21fc91ddafd964ae2035ba7892c0"><div class="ttname"><a href="../../d3/db3/lru__cache_8cpp.html#a01ec21fc91ddafd964ae2035ba7892c0">lru_tests::test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdoc">A simple test case The assert statement will check expected hist and miss to resultant hits and miss.</div><div class="ttdef"><b>Definition</b> <a href="#l00214">lru_cache.cpp:214</a></div></div>
+<div class="ttc" id="alru__cache_8cpp_html_a24d21a345ed06f7fba6919718cf3e058"><div class="ttname"><a href="../../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058">lru_tests::log</a></div><div class="ttdeci">void log(T msg)</div><div class="ttdoc">A function to print given message on console.</div><div class="ttdef"><b>Definition</b> <a href="#l00149">lru_cache.cpp:149</a></div></div>
+<div class="ttc" id="alru__cache_8cpp_html_a4b02e288a407876a8d6024f98a2a25ec"><div class="ttname"><a href="../../d3/db3/lru__cache_8cpp.html#a4b02e288a407876a8d6024f98a2a25ec">lru_tests::test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdoc">A test case contains hits more than cache size The assert statement will check expected hist and miss...</div><div class="ttdef"><b>Definition</b> <a href="#l00187">lru_cache.cpp:187</a></div></div>
+<div class="ttc" id="alru__cache_8cpp_html_a6401e8f2d41d8cc9cd0e52ab381608d4"><div class="ttname"><a href="../../d3/db3/lru__cache_8cpp.html#a6401e8f2d41d8cc9cd0e52ab381608d4">lru_tests::test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdoc">A simple test case The assert statement will check expected hist and miss to resultant hits and miss.</div><div class="ttdef"><b>Definition</b> <a href="#l00160">lru_cache.cpp:160</a></div></div>
+<div class="ttc" id="alru__cache_8cpp_html_a6a3be6d8871b1f5dc03688da8f3ee9e6"><div class="ttname"><a href="../../d3/db3/lru__cache_8cpp.html#a6a3be6d8871b1f5dc03688da8f3ee9e6">lru_tests::run_tests</a></div><div class="ttdeci">static void run_tests()</div><div class="ttdoc">A function to invoke all test cases.</div><div class="ttdef"><b>Definition</b> <a href="#l00239">lru_cache.cpp:239</a></div></div>
+<div class="ttc" id="alru__cache_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00252">lru_cache.cpp:252</a></div></div>
+<div class="ttc" id="anamespacelru__cache_html"><div class="ttname"><a href="../../d8/dcd/namespacelru__cache.html">lru_cache</a></div><div class="ttdoc">Implementation of the LRU caching algorithm</div></div>
+<div class="ttc" id="anamespaceothers_html"><div class="ttname"><a href="../../d0/d6f/namespaceothers.html">others</a></div><div class="ttdoc">for vector</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../d3/db3/lru__cache_8cpp.html">lru_cache.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/dbb/class_cycle_check.html b/d3/dbb/class_cycle_check.html
index 7e835d658..0331545ee 100644
--- a/d3/dbb/class_cycle_check.html
+++ b/d3/dbb/class_cycle_check.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: CycleCheck Class Reference</title>
+<title>TheAlgorithms/C++: CycleCheck Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -130,7 +147,7 @@ Private Types</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-static-methods" name="pri-static-methods"></a>
 Static Private Member Functions</h2></td></tr>
-<tr class="memitem:a2f4485c08b45e7a21a2e86f9c3f01d8b" id="r_a2f4485c08b45e7a21a2e86f9c3f01d8b"><td class="memItemLeft" align="right" valign="top">static bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2f4485c08b45e7a21a2e86f9c3f01d8b">isCyclicDFSHelper</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">AdjList</a> const &amp;adjList, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; nodeStates &gt; *state, unsigned int <a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
+<tr class="memitem:a2f4485c08b45e7a21a2e86f9c3f01d8b" id="r_a2f4485c08b45e7a21a2e86f9c3f01d8b"><td class="memItemLeft" align="right" valign="top">static bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2f4485c08b45e7a21a2e86f9c3f01d8b">isCyclicDFSHelper</a> (AdjList const &amp;adjList, std::vector&lt; nodeStates &gt; *state, unsigned int <a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
 <tr class="separator:a2f4485c08b45e7a21a2e86f9c3f01d8b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -140,6 +157,8 @@ Static Private Member Functions</h2></td></tr>
 <li>isCyclicDFS uses DFS traversal method to check for cycle in a graph.</li>
 <li>isCyclidBFS used BFS traversal method to check for cycle in a graph. </li>
 </ul>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00159">159</a> of file <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a>.</p>
 </div><h2 class="groupheader">Member Enumeration Documentation</h2>
 <a id="ae68a1f08ee8c0b6323ab0f281862eadf" name="ae68a1f08ee8c0b6323ab0f281862eadf"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae68a1f08ee8c0b6323ab0f281862eadf">&#9670;&#160;</a></span>nodeStates</h2>
@@ -160,6 +179,8 @@ Static Private Member Functions</h2></td></tr>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00161">161</a> of file <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  161</span>: uint8_t { not_visited = 0, in_stack, visited };</div>
 </div><!-- fragment -->
 </div>
@@ -196,11 +217,13 @@ Static Private Member Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if a cycle is detected, else false. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00250">250</a> of file <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  250</span>                                                {</div>
 <div class="line"><span class="lineno">  251</span>        <span class="keyword">auto</span> graphAjdList = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.getAdjList();</div>
 <div class="line"><span class="lineno">  252</span>        <span class="keyword">auto</span> vertices = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.getVertices();</div>
 <div class="line"><span class="lineno">  253</span> </div>
-<div class="line"><span class="lineno">  254</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;unsigned int&gt;</a> indegree(vertices, 0);</div>
+<div class="line"><span class="lineno">  254</span>        std::vector&lt;unsigned int&gt; indegree(vertices, 0);</div>
 <div class="line"><span class="lineno">  255</span>        <span class="comment">// Calculate the indegree i.e. the number of incident edges to the node.</span></div>
 <div class="line"><span class="lineno">  256</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span>&amp; <a class="code hl_struct" href="../../d8/d10/structlist.html">list</a> : graphAjdList) {</div>
 <div class="line"><span class="lineno">  257</span>            <span class="keyword">auto</span> children = <a class="code hl_struct" href="../../d8/d10/structlist.html">list</a>.second;</div>
@@ -209,22 +232,22 @@ Static Private Member Functions</h2></td></tr>
 <div class="line"><span class="lineno">  260</span>            }</div>
 <div class="line"><span class="lineno">  261</span>        }</div>
 <div class="line"><span class="lineno">  262</span> </div>
-<div class="line"><span class="lineno">  263</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue&lt;unsigned int&gt;</a> can_be_solved;</div>
+<div class="line"><span class="lineno">  263</span>        std::queue&lt;unsigned int&gt; can_be_solved;</div>
 <div class="line"><span class="lineno">  264</span>        <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = 0; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> &lt; vertices; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>++) {</div>
 <div class="line"><span class="lineno">  265</span>            <span class="comment">// If a node doesn&#39;t have any input edges, then that node will</span></div>
 <div class="line"><span class="lineno">  266</span>            <span class="comment">// definately not result in a cycle and can be visited safely.</span></div>
 <div class="line"><span class="lineno">  267</span>            <span class="keywordflow">if</span> (!indegree[<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>]) {</div>
-<div class="line"><span class="lineno">  268</span>                can_be_solved.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/emplace.html">emplace</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
+<div class="line"><span class="lineno">  268</span>                can_be_solved.emplace(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
 <div class="line"><span class="lineno">  269</span>            }</div>
 <div class="line"><span class="lineno">  270</span>        }</div>
 <div class="line"><span class="lineno">  271</span> </div>
 <div class="line"><span class="lineno">  272</span>        <span class="comment">// Vertices that need to be traversed.</span></div>
 <div class="line"><span class="lineno">  273</span>        <span class="keyword">auto</span> remain = vertices;</div>
 <div class="line"><span class="lineno">  274</span>        <span class="comment">// While there are safe nodes that we can visit.</span></div>
-<div class="line"><span class="lineno">  275</span>        <span class="keywordflow">while</span> (!can_be_solved.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/empty.html">empty</a>()) {</div>
-<div class="line"><span class="lineno">  276</span>            <span class="keyword">auto</span> solved = can_be_solved.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/front.html">front</a>();</div>
+<div class="line"><span class="lineno">  275</span>        <span class="keywordflow">while</span> (!can_be_solved.empty()) {</div>
+<div class="line"><span class="lineno">  276</span>            <span class="keyword">auto</span> solved = can_be_solved.front();</div>
 <div class="line"><span class="lineno">  277</span>            <span class="comment">// Visit the node.</span></div>
-<div class="line"><span class="lineno">  278</span>            can_be_solved.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/pop.html">pop</a>();</div>
+<div class="line"><span class="lineno">  278</span>            can_be_solved.pop();</div>
 <div class="line"><span class="lineno">  279</span>            <span class="comment">// Decrease number of nodes that need to be traversed.</span></div>
 <div class="line"><span class="lineno">  280</span>            remain--;</div>
 <div class="line"><span class="lineno">  281</span> </div>
@@ -236,7 +259,7 @@ Static Private Member Functions</h2></td></tr>
 <div class="line"><span class="lineno">  287</span>                    <span class="keywordflow">if</span> (--indegree[child] == 0) {</div>
 <div class="line"><span class="lineno">  288</span>                        <span class="comment">// if node can be visited safely, then add that node to</span></div>
 <div class="line"><span class="lineno">  289</span>                        <span class="comment">// the visit queue.</span></div>
-<div class="line"><span class="lineno">  290</span>                        can_be_solved.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/emplace.html">emplace</a>(child);</div>
+<div class="line"><span class="lineno">  290</span>                        can_be_solved.emplace(child);</div>
 <div class="line"><span class="lineno">  291</span>                    }</div>
 <div class="line"><span class="lineno">  292</span>                }</div>
 <div class="line"><span class="lineno">  293</span>            }</div>
@@ -246,21 +269,10 @@ Static Private Member Functions</h2></td></tr>
 <div class="line"><span class="lineno">  297</span>        <span class="comment">// there is a cycle and return true, else return false.</span></div>
 <div class="line"><span class="lineno">  298</span>        <span class="keywordflow">return</span> !(remain == 0);</div>
 <div class="line"><span class="lineno">  299</span>    }</div>
-<div class="ttc" id="aemplace_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/emplace.html">std::queue::emplace</a></div><div class="ttdeci">T emplace(T... args)</div></div>
-<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/empty.html">std::queue::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
-<div class="ttc" id="afront_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/front.html">std::queue::front</a></div><div class="ttdeci">T front(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 class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/pop.html">std::queue::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
-<div class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div></div>
-<div class="ttc" id="astructlist_html"><div class="ttname"><a href="../../d8/d10/structlist.html">list</a></div><div class="ttdef"><b>Definition</b> hash_search.cpp:29</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.svg" width="372" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astructlist_html"><div class="ttname"><a href="../../d8/d10/structlist.html">list</a></div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00029">hash_search.cpp:29</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad9a270ffba3a68539b92272c702e3474" name="ad9a270ffba3a68539b92272c702e3474"></a>
@@ -297,17 +309,12 @@ Here is the call graph for this function:</div>
 <p>State of the node.</p>
 <p>It is a vector of "nodeStates" which represents the state node is in. It can take only 3 values: "not_visited", "in_stack", and "visited".</p>
 <p>Initially, all nodes are in "not_visited" state.</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00213">213</a> of file <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  213</span>                                                {</div>
 <div class="line"><span class="lineno">  214</span>        <span class="keyword">auto</span> vertices = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.getVertices();</div>
-<div class="line"><span class="lineno">  215</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  216</span><span class="comment">        /** State of the node.</span></div>
-<div class="line"><span class="lineno">  217</span><span class="comment">         *</span></div>
-<div class="line"><span class="lineno">  218</span><span class="comment">         * It is a vector of &quot;nodeStates&quot; which represents the state node is in.</span></div>
-<div class="line"><span class="lineno">  219</span><span class="comment">         * It can take only 3 values: &quot;not_visited&quot;, &quot;in_stack&quot;, and &quot;visited&quot;.</span></div>
-<div class="line"><span class="lineno">  220</span><span class="comment">         *</span></div>
-<div class="line"><span class="lineno">  221</span><span class="comment">         * Initially, all nodes are in &quot;not_visited&quot; state.</span></div>
-<div class="line"><span class="lineno">  222</span><span class="comment">         */</span></div>
-<div class="line"><span class="lineno">  223</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;nodeStates&gt;</a> state(vertices, not_visited);</div>
+<div class="line"><span class="lineno">  215</span> </div>
+<div class="line"><span class="lineno">  223</span>        std::vector&lt;nodeStates&gt; state(vertices, not_visited);</div>
 <div class="line"><span class="lineno">  224</span> </div>
 <div class="line"><span class="lineno">  225</span>        <span class="comment">// Start visiting each node.</span></div>
 <div class="line"><span class="lineno">  226</span>        <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = 0; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> &lt; vertices; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>++) {</div>
@@ -326,13 +333,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  239</span>        <span class="comment">// the graph. Return false.</span></div>
 <div class="line"><span class="lineno">  240</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  241</span>    }</div>
-<div class="ttc" id="aclass_cycle_check_html_a2f4485c08b45e7a21a2e86f9c3f01d8b"><div class="ttname"><a href="#a2f4485c08b45e7a21a2e86f9c3f01d8b">CycleCheck::isCyclicDFSHelper</a></div><div class="ttdeci">static bool isCyclicDFSHelper(AdjList const &amp;adjList, std::vector&lt; nodeStates &gt; *state, unsigned int node)</div><div class="ttdef"><b>Definition</b> cycle_check_directed_graph.cpp:171</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.svg" width="598" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclass_cycle_check_html_a2f4485c08b45e7a21a2e86f9c3f01d8b"><div class="ttname"><a href="#a2f4485c08b45e7a21a2e86f9c3f01d8b">CycleCheck::isCyclicDFSHelper</a></div><div class="ttdeci">static bool isCyclicDFSHelper(AdjList const &amp;adjList, std::vector&lt; nodeStates &gt; *state, unsigned int node)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00171">cycle_check_directed_graph.cpp:171</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2f4485c08b45e7a21a2e86f9c3f01d8b" name="a2f4485c08b45e7a21a2e86f9c3f01d8b"></a>
@@ -347,12 +349,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">static bool CycleCheck::isCyclicDFSHelper </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">AdjList</a> const &amp;</td>          <td class="paramname"><span class="paramname"><em>adjList</em></span>, </td>
+          <td class="paramtype">AdjList const &amp;</td>          <td class="paramname"><span class="paramname"><em>adjList</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; nodeStates &gt; *</td>          <td class="paramname"><span class="paramname"><em>state</em></span>, </td>
+          <td class="paramtype">std::vector&lt; nodeStates &gt; *</td>          <td class="paramname"><span class="paramname"><em>state</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -376,6 +378,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if graph has a cycle, else false. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00171">171</a> of file <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  173</span>                                                     {</div>
 <div class="line"><span class="lineno">  174</span>        <span class="comment">// Add node &quot;in_stack&quot; state.</span></div>
 <div class="line"><span class="lineno">  175</span>        (*state)[<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>] = in_stack;</div>
@@ -407,17 +411,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  201</span>        <span class="comment">// Return that current node didn&#39;t result in any cycles.</span></div>
 <div class="line"><span class="lineno">  202</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  203</span>    }</div>
-<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.svg" width="374" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>graph/<b>cycle_check_directed_graph.cpp</b></li>
+<li>graph/<a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.map b/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.map
deleted file mode 100644
index 81a256988..000000000
--- a/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="CycleCheck::isCyclicDFSHelper" name="CycleCheck::isCyclicDFSHelper">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,219,56"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="78,32,71,22,75,12,89,6,112,4,137,7,150,14,148,18,136,12,112,9,90,11,79,16,76,21,82,29"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/map/end.html#" title=" " alt="" coords="267,5,368,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="218,28,251,24,251,29,219,33"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/map/find.html#" title=" " alt="" coords="267,55,368,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="219,53,251,57,251,62,219,59"/>
-</map>
diff --git a/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.md5 b/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.md5
deleted file mode 100644
index 9535c3b17..000000000
--- a/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-195c73ff687383e161660384b18774c1
\ No newline at end of file
diff --git a/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.svg b/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.svg
deleted file mode 100644
index 1369b46d0..000000000
--- a/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: CycleCheck::isCyclicDFSHelper Pages: 1 -->
-<svg width="280pt" height="64pt"
- viewBox="0.00 0.00 280.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>CycleCheck::isCyclicDFSHelper</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="160,-37.25 0,-37.25 0,-18 160,-18 160,-37.25"/>
-<text text-anchor="middle" x="80" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">CycleCheck::isCyclicDFSHelper</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.89,-37.54C44.89,-46.15 52.93,-55.25 80,-55.25 95.23,-55.25 104.43,-52.37 107.61,-48.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111,-47.41 104.58,-38.98 104.34,-49.57 111,-47.41"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272,-56.25 196,-56.25 196,-37 272,-37 272,-56.25"/>
-<text text-anchor="middle" x="234" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.12,-37.51C168.36,-38.54 176.55,-39.57 184.3,-40.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.82,-44 194.18,-41.77 184.69,-37.06 183.82,-44"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272,-19.25 196,-19.25 196,0 272,0 272,-19.25"/>
-<text text-anchor="middle" x="234" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.12,-18.26C168.36,-17.28 176.55,-16.31 184.3,-15.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.66,-18.87 194.18,-14.22 183.83,-11.92 184.66,-18.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph_org.svg b/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph_org.svg
deleted file mode 100644
index 95e52201c..000000000
--- a/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: CycleCheck::isCyclicDFSHelper Pages: 1 -->
-<svg width="280pt" height="64pt"
- viewBox="0.00 0.00 280.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>CycleCheck::isCyclicDFSHelper</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="160,-37.25 0,-37.25 0,-18 160,-18 160,-37.25"/>
-<text text-anchor="middle" x="80" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">CycleCheck::isCyclicDFSHelper</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.89,-37.54C44.89,-46.15 52.93,-55.25 80,-55.25 95.23,-55.25 104.43,-52.37 107.61,-48.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111,-47.41 104.58,-38.98 104.34,-49.57 111,-47.41"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272,-56.25 196,-56.25 196,-37 272,-37 272,-56.25"/>
-<text text-anchor="middle" x="234" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.12,-37.51C168.36,-38.54 176.55,-39.57 184.3,-40.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.82,-44 194.18,-41.77 184.69,-37.06 183.82,-44"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272,-19.25 196,-19.25 196,0 272,0 272,-19.25"/>
-<text text-anchor="middle" x="234" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.12,-18.26C168.36,-17.28 176.55,-16.31 184.3,-15.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.66,-18.87 194.18,-14.22 183.83,-11.92 184.66,-18.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.map b/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.map
deleted file mode 100644
index 89649dea7..000000000
--- a/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="CycleCheck::isCyclicBFS" name="CycleCheck::isCyclicBFS">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,80,180,106"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/emplace.html#" title=" " alt="" coords="228,5,367,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="127,77,227,40,242,34,244,39,229,45,129,82"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/empty.html#" title=" " alt="" coords="234,55,360,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="180,79,218,75,219,80,180,85"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/front.html#" title=" " alt="" coords="239,104,356,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="180,100,224,106,223,111,180,106"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/pop.html#" title=" " alt="" coords="242,153,353,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="130,104,229,140,244,145,242,150,227,145,129,109"/>
-</map>
diff --git a/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.md5 b/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.md5
deleted file mode 100644
index 70a119e7d..000000000
--- a/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-eccf7ed03c618aa2aa56d0bbc846f71e
\ No newline at end of file
diff --git a/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.svg b/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.svg
deleted file mode 100644
index a2fd1d870..000000000
--- a/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: CycleCheck::isCyclicBFS Pages: 1 -->
-<svg width="279pt" height="138pt"
- viewBox="0.00 0.00 279.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>CycleCheck::isCyclicBFS</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="130.75,-74.25 0,-74.25 0,-55 130.75,-55 130.75,-74.25"/>
-<text text-anchor="middle" x="65.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">CycleCheck::isCyclicBFS</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/emplace.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.25,-130.25 166.75,-130.25 166.75,-111 271.25,-111 271.25,-130.25"/>
-<text text-anchor="middle" x="219" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::emplace</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.31,-74.64C112.54,-82.4 141.37,-93.36 166.75,-102.62 170.45,-103.97 174.31,-105.36 178.17,-106.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.93,-110.02 187.53,-110.06 179.27,-103.42 176.93,-110.02"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.38,-93.25 171.62,-93.25 171.62,-74 266.38,-74 266.38,-93.25"/>
-<text text-anchor="middle" x="219" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.12,-72.74C140.73,-73.94 150.59,-75.18 160.05,-76.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.49,-79.82 169.85,-77.59 160.37,-72.88 159.49,-79.82"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.62,-56.25 175.38,-56.25 175.38,-37 262.62,-37 262.62,-56.25"/>
-<text text-anchor="middle" x="219" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.12,-56.94C141.99,-55.65 153.18,-54.32 163.76,-53.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.93,-56.57 173.45,-51.91 163.1,-49.62 163.93,-56.57"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.75,-19.25 177.25,-19.25 177.25,0 260.75,0 260.75,-19.25"/>
-<text text-anchor="middle" x="219" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.17,-54.62C113.37,-47.11 141.76,-36.62 166.75,-27.62 170.46,-26.29 174.32,-24.91 178.18,-23.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.28,-26.87 187.54,-20.24 176.95,-20.27 179.28,-26.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph_org.svg b/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph_org.svg
deleted file mode 100644
index 0ebea2540..000000000
--- a/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: CycleCheck::isCyclicBFS Pages: 1 -->
-<svg width="279pt" height="138pt"
- viewBox="0.00 0.00 279.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>CycleCheck::isCyclicBFS</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="130.75,-74.25 0,-74.25 0,-55 130.75,-55 130.75,-74.25"/>
-<text text-anchor="middle" x="65.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">CycleCheck::isCyclicBFS</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/emplace.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.25,-130.25 166.75,-130.25 166.75,-111 271.25,-111 271.25,-130.25"/>
-<text text-anchor="middle" x="219" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::emplace</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.31,-74.64C112.54,-82.4 141.37,-93.36 166.75,-102.62 170.45,-103.97 174.31,-105.36 178.17,-106.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.93,-110.02 187.53,-110.06 179.27,-103.42 176.93,-110.02"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.38,-93.25 171.62,-93.25 171.62,-74 266.38,-74 266.38,-93.25"/>
-<text text-anchor="middle" x="219" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.12,-72.74C140.73,-73.94 150.59,-75.18 160.05,-76.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.49,-79.82 169.85,-77.59 160.37,-72.88 159.49,-79.82"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.62,-56.25 175.38,-56.25 175.38,-37 262.62,-37 262.62,-56.25"/>
-<text text-anchor="middle" x="219" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.12,-56.94C141.99,-55.65 153.18,-54.32 163.76,-53.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.93,-56.57 173.45,-51.91 163.1,-49.62 163.93,-56.57"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.75,-19.25 177.25,-19.25 177.25,0 260.75,0 260.75,-19.25"/>
-<text text-anchor="middle" x="219" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.17,-54.62C113.37,-47.11 141.76,-36.62 166.75,-27.62 170.46,-26.29 174.32,-24.91 178.18,-23.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.28,-26.87 187.54,-20.24 176.95,-20.27 179.28,-26.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.map b/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.map
deleted file mode 100644
index 72317c234..000000000
--- a/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="CycleCheck::isCyclicDFS" name="CycleCheck::isCyclicDFS">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,181,56"/>
-<area shape="rect" id="Node000002" href="$d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b" title=" " alt="" coords="229,31,442,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="181,41,213,41,213,46,181,46"/>
-<area shape="poly" id="edge4_Node000002_Node000002" title=" " alt="" coords="301,32,294,22,298,12,312,6,335,4,361,7,373,14,371,18,359,12,335,9,314,11,302,16,300,21,305,29"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/map/end.html#" title=" " alt="" coords="490,5,591,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="442,28,474,24,475,29,442,33"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/map/find.html#" title=" " alt="" coords="490,55,591,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="442,53,475,57,474,62,442,59"/>
-</map>
diff --git a/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.md5 b/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.md5
deleted file mode 100644
index 7930829a4..000000000
--- a/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7eba2a3b2336eb4b60d6f72ea3e2fd8d
\ No newline at end of file
diff --git a/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.svg b/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.svg
deleted file mode 100644
index 413db771b..000000000
--- a/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.svg
+++ /dev/null
@@ -1,110 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: CycleCheck::isCyclicDFS Pages: 1 -->
-<svg width="448pt" height="64pt"
- viewBox="0.00 0.00 447.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>CycleCheck::isCyclicDFS</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="131.5,-37.25 0,-37.25 0,-18 131.5,-18 131.5,-37.25"/>
-<text text-anchor="middle" x="65.75" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">CycleCheck::isCyclicDFS</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="327.5,-37.25 167.5,-37.25 167.5,-18 327.5,-18 327.5,-37.25"/>
-<text text-anchor="middle" x="247.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">CycleCheck::isCyclicDFSHelper</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.9,-27.62C139.68,-27.62 147.74,-27.62 155.8,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.66,-31.13 165.66,-27.63 155.66,-24.13 155.66,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge4_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge4_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M223.39,-37.54C212.39,-46.15 220.43,-55.25 247.5,-55.25 262.73,-55.25 271.93,-52.37 275.11,-48.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.5,-47.41 272.08,-38.98 271.84,-49.57 278.5,-47.41"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="439.5,-56.25 363.5,-56.25 363.5,-37 439.5,-37 439.5,-56.25"/>
-<text text-anchor="middle" x="401.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M327.62,-37.51C335.86,-38.54 344.05,-39.57 351.8,-40.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="351.32,-44 361.68,-41.77 352.19,-37.06 351.32,-44"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="439.5,-19.25 363.5,-19.25 363.5,0 439.5,0 439.5,-19.25"/>
-<text text-anchor="middle" x="401.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::find</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M327.62,-18.26C335.86,-17.28 344.05,-16.31 351.8,-15.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.16,-18.87 361.68,-14.22 351.33,-11.92 352.16,-18.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph_org.svg b/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph_org.svg
deleted file mode 100644
index 1abd54a6f..000000000
--- a/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph_org.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: CycleCheck::isCyclicDFS Pages: 1 -->
-<svg width="448pt" height="64pt"
- viewBox="0.00 0.00 447.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>CycleCheck::isCyclicDFS</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="131.5,-37.25 0,-37.25 0,-18 131.5,-18 131.5,-37.25"/>
-<text text-anchor="middle" x="65.75" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">CycleCheck::isCyclicDFS</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="327.5,-37.25 167.5,-37.25 167.5,-18 327.5,-18 327.5,-37.25"/>
-<text text-anchor="middle" x="247.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">CycleCheck::isCyclicDFSHelper</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.9,-27.62C139.68,-27.62 147.74,-27.62 155.8,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.66,-31.13 165.66,-27.63 155.66,-24.13 155.66,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge4_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge4_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M223.39,-37.54C212.39,-46.15 220.43,-55.25 247.5,-55.25 262.73,-55.25 271.93,-52.37 275.11,-48.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.5,-47.41 272.08,-38.98 271.84,-49.57 278.5,-47.41"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="439.5,-56.25 363.5,-56.25 363.5,-37 439.5,-37 439.5,-56.25"/>
-<text text-anchor="middle" x="401.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M327.62,-37.51C335.86,-38.54 344.05,-39.57 351.8,-40.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="351.32,-44 361.68,-41.77 352.19,-37.06 351.32,-44"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="439.5,-19.25 363.5,-19.25 363.5,0 439.5,0 439.5,-19.25"/>
-<text text-anchor="middle" x="401.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::find</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M327.62,-18.26C335.86,-17.28 344.05,-16.31 351.8,-15.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.16,-18.87 361.68,-14.22 351.33,-11.92 352.16,-18.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/dbf/classhashing_1_1sha256_1_1_hash-members.html b/d3/dbf/classhashing_1_1sha256_1_1_hash-members.html
index fd6b4365a..16cb3dc06 100644
--- a/d3/dbf/classhashing_1_1sha256_1_1_hash-members.html
+++ b/d3/dbf/classhashing_1_1sha256_1_1_hash-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d3/dc1/bucket__sort_8cpp_source.html b/d3/dc1/bucket__sort_8cpp_source.html
new file mode 100644
index 000000000..f0dd8dcf7
--- /dev/null
+++ b/d3/dc1/bucket__sort_8cpp_source.html
@@ -0,0 +1,174 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/bucket_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/dc1/bucket__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">bucket_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">// C++ program to sort an array using bucket sort</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment">// Function to sort arr[] of size n using bucket sort</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="keywordtype">void</span> bucketSort(<span class="keywordtype">float</span> arr[], <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>    <span class="comment">// 1) Create n empty buckets</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    std::vector&lt;float&gt; *b = <span class="keyword">new</span> std::vector&lt;float&gt;[n];</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    <span class="comment">// 2) Put array elements in different buckets</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>        <span class="keywordtype">int</span> bi = n * arr[i];  <span class="comment">// Index in bucket</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>        b[bi].push_back(arr[i]);</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    }</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="comment">// 3) Sort individual buckets</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) std::sort(b[i].begin(), b[i].end());</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="comment">// 4) Concatenate all buckets into arr[]</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keywordtype">int</span> index = 0;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++)</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; b[i].size(); j++) arr[index++] = b[i][j];</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="keyword">delete</span>[] b;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>}</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment">/* Driver program to test above funtion */</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordtype">float</span> arr[] = {0.897, 0.565, 0.656, 0.1234, 0.665, 0.3434};</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordtype">int</span> n = <span class="keyword">sizeof</span>(arr) / <span class="keyword">sizeof</span>(arr[0]);</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    bucketSort(arr, n);</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted array is \n&quot;</span>;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><b>bucket_sort.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/dc9/namespacefibonacci__sum.html b/d3/dc9/namespacefibonacci__sum.html
index ad8368b4a..6fe45a206 100644
--- a/d3/dc9/namespacefibonacci__sum.html
+++ b/d3/dc9/namespacefibonacci__sum.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: fibonacci_sum Namespace Reference</title>
+<title>TheAlgorithms/C++: fibonacci_sum Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp.html b/d3/dce/linkedlist__implentation__usingarray_8cpp.html
index 0e04e0621..50f8f36ad 100644
--- a/d3/dce/linkedlist__implentation__usingarray_8cpp.html
+++ b/d3/dce/linkedlist__implentation__usingarray_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/linkedlist_implentation_usingarray.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/linkedlist_implentation_usingarray.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for linkedlist_implentation_usingarray.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.svg" width="199" height="126"><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">
+</div>
+<p><a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d8b/struct_node.html">Node&lt; ValueType &gt;</a></td></tr>
@@ -145,15 +164,12 @@ Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:aed19b403f559fc5d5a4bce724f9e263c" id="r_aed19b403f559fc5d5a4bce724f9e263c"><td class="memItemLeft" align="right" valign="top"><a id="aed19b403f559fc5d5a4bce724f9e263c" name="aed19b403f559fc5d5a4bce724f9e263c"></a>
-<a class="el" href="../../db/d8b/struct_node.html">Node</a>&#160;</td><td class="memItemRight" valign="bottom"><b>AvailArray</b> [100]</td></tr>
-<tr class="memdesc:aed19b403f559fc5d5a4bce724f9e263c"><td class="mdescLeft">&#160;</td><td class="mdescRight">array that will act as nodes of a linked list. <br /></td></tr>
+<tr class="memitem:aed19b403f559fc5d5a4bce724f9e263c" id="r_aed19b403f559fc5d5a4bce724f9e263c"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d8b/struct_node.html">Node</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a> [100]</td></tr>
+<tr class="memdesc:aed19b403f559fc5d5a4bce724f9e263c"><td class="mdescLeft">&#160;</td><td class="mdescRight">array that will act as nodes of a linked list.  <br /></td></tr>
 <tr class="separator:aed19b403f559fc5d5a4bce724f9e263c"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a20358970b1abaf992eb85e071e454653" id="r_a20358970b1abaf992eb85e071e454653"><td class="memItemLeft" align="right" valign="top"><a id="a20358970b1abaf992eb85e071e454653" name="a20358970b1abaf992eb85e071e454653"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>head</b> = -1</td></tr>
+<tr class="memitem:a20358970b1abaf992eb85e071e454653" id="r_a20358970b1abaf992eb85e071e454653"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a20358970b1abaf992eb85e071e454653">head</a> = -1</td></tr>
 <tr class="separator:a20358970b1abaf992eb85e071e454653"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ab84c7d9bed2aa1ade1fd61fbf5c2e07e" id="r_ab84c7d9bed2aa1ade1fd61fbf5c2e07e"><td class="memItemLeft" align="right" valign="top"><a id="ab84c7d9bed2aa1ade1fd61fbf5c2e07e" name="ab84c7d9bed2aa1ade1fd61fbf5c2e07e"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>avail</b> = 0</td></tr>
+<tr class="memitem:ab84c7d9bed2aa1ade1fd61fbf5c2e07e" id="r_ab84c7d9bed2aa1ade1fd61fbf5c2e07e"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab84c7d9bed2aa1ade1fd61fbf5c2e07e">avail</a> = 0</td></tr>
 <tr class="separator:ab84c7d9bed2aa1ade1fd61fbf5c2e07e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -162,6 +178,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>avail</b> = 0</td></tr
 <li>The NULL is represented by -1;</li>
 <li>Limited size. (in the following case it is 100 nodes at max). But we can reuse the nodes that are to be deleted by again linking it bacj to the list. </li>
 </ol>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html">linkedlist_implentation_usingarray.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a1e5b20fed15743656bb6d2e6a6ea6269" name="a1e5b20fed15743656bb6d2e6a6ea6269"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a1e5b20fed15743656bb6d2e6a6ea6269">&#9670;&#160;</a></span>display()</h2>
@@ -177,17 +195,17 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>avail</b> = 0</td></tr
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00069">69</a> of file <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html">linkedlist_implentation_usingarray.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   69</span>               {</div>
 <div class="line"><span class="lineno">   70</span>    <span class="keywordtype">int</span> temp = head;</div>
 <div class="line"><span class="lineno">   71</span>    <span class="keywordflow">while</span> (temp != -1) {</div>
-<div class="line"><span class="lineno">   72</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_variable" href="#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[temp].data &lt;&lt; <span class="stringliteral">&quot;-&gt;&quot;</span>;</div>
+<div class="line"><span class="lineno">   72</span>        std::cout &lt;&lt; <a class="code hl_variable" href="#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[temp].data &lt;&lt; <span class="stringliteral">&quot;-&gt;&quot;</span>;</div>
 <div class="line"><span class="lineno">   73</span>        temp = <a class="code hl_variable" href="#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[temp].next;</div>
 <div class="line"><span class="lineno">   74</span>    }</div>
-<div class="line"><span class="lineno">   75</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;-1&quot;</span> &lt;&lt; <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">   75</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;-1&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   76</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="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="alinkedlist__implentation__usingarray_8cpp_html_aed19b403f559fc5d5a4bce724f9e263c"><div class="ttname"><a href="#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a></div><div class="ttdeci">Node AvailArray[100]</div><div class="ttdoc">array that will act as nodes of a linked list.</div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:19</div></div>
+<div class="ttc" id="alinkedlist__implentation__usingarray_8cpp_html_aed19b403f559fc5d5a4bce724f9e263c"><div class="ttname"><a href="#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a></div><div class="ttdeci">Node AvailArray[100]</div><div class="ttdoc">array that will act as nodes of a linked list.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00019">linkedlist_implentation_usingarray.cpp:19</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -206,6 +224,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>avail</b> = 0</td></tr
       </table>
 </div><div class="memdoc">
 <p>This function when called will delete the node with the index presented as an argument, and will put back that node into the array. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html">linkedlist_implentation_usingarray.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   42</span>                                   {</div>
 <div class="line"><span class="lineno">   43</span>    <a class="code hl_variable" href="#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[nodeToBeDeleted].next = avail;</div>
 <div class="line"><span class="lineno">   44</span>    avail = nodeToBeDeleted;</div>
@@ -228,6 +248,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>avail</b> = 0</td></tr
       </table>
 </div><div class="memdoc">
 <p>This will return the index of the first free node present in the avail list </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html">linkedlist_implentation_usingarray.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   32</span>              {</div>
 <div class="line"><span class="lineno">   33</span>    <span class="keywordtype">int</span> NodeIndexToBeReturned = avail;</div>
 <div class="line"><span class="lineno">   34</span>    avail = <a class="code hl_variable" href="#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[avail].next;</div>
@@ -250,6 +272,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>avail</b> = 0</td></tr
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00023">23</a> of file <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html">linkedlist_implentation_usingarray.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   23</span>                       {</div>
 <div class="line"><span class="lineno">   24</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= 98; i++) {</div>
 <div class="line"><span class="lineno">   25</span>        <a class="code hl_variable" href="#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[i].next = i + 1;</div>
@@ -274,20 +298,17 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>avail</b> = 0</td></tr
       </table>
 </div><div class="memdoc">
 <p>The function will insert the given data into the front of the linked list. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00050">50</a> of file <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html">linkedlist_implentation_usingarray.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   50</span>                                    {</div>
 <div class="line"><span class="lineno">   51</span>    <span class="keywordtype">int</span> newNode = <a class="code hl_function" href="#a73e11e0871f56342a30da93b6c93e8be">getnode</a>();</div>
 <div class="line"><span class="lineno">   52</span>    <a class="code hl_variable" href="#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[newNode].data = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
 <div class="line"><span class="lineno">   53</span>    <a class="code hl_variable" href="#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[newNode].next = head;</div>
 <div class="line"><span class="lineno">   54</span>    head = newNode;</div>
 <div class="line"><span class="lineno">   55</span>}</div>
-<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
-<div class="ttc" id="alinkedlist__implentation__usingarray_8cpp_html_a73e11e0871f56342a30da93b6c93e8be"><div class="ttname"><a href="#a73e11e0871f56342a30da93b6c93e8be">getnode</a></div><div class="ttdeci">int getnode()</div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:32</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.svg" width="272" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="alinkedlist__implentation__usingarray_8cpp_html_a73e11e0871f56342a30da93b6c93e8be"><div class="ttname"><a href="#a73e11e0871f56342a30da93b6c93e8be">getnode</a></div><div class="ttdeci">int getnode()</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00032">linkedlist_implentation_usingarray.cpp:32</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a92e0c1bb3b270143881e36b5fea8a60d" name="a92e0c1bb3b270143881e36b5fea8a60d"></a>
@@ -304,6 +325,8 @@ Here is the call graph for this function:</div>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html">linkedlist_implentation_usingarray.cpp</a>.</p>
 <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> newNode = <a class="code hl_function" href="#a73e11e0871f56342a30da93b6c93e8be">getnode</a>();</div>
 <div class="line"><span class="lineno">   59</span>    <span class="keywordtype">int</span> temp = head;</div>
@@ -333,49 +356,96 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00079">79</a> of file <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html">linkedlist_implentation_usingarray.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   79</span>           {</div>
 <div class="line"><span class="lineno">   80</span>    initialise_list();</div>
 <div class="line"><span class="lineno">   81</span>    <span class="keywordtype">int</span> x, y, z;</div>
 <div class="line"><span class="lineno">   82</span>    <span class="keywordflow">for</span> (;;) {</div>
-<div class="line"><span class="lineno">   83</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1. Insert At The Beginning&quot;</span> &lt;&lt; <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">   84</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2. Insert At The End&quot;</span> &lt;&lt; <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">   85</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;3. Display&quot;</span> &lt;&lt; <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">   86</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;4.Exit&quot;</span> &lt;&lt; <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">   87</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter Your choice&quot;</span> &lt;&lt; <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">   88</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; z;</div>
+<div class="line"><span class="lineno">   83</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;1. Insert At The Beginning&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   84</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;2. Insert At The End&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   85</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;3. Display&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   86</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;4.Exit&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   87</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter Your choice&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   88</span>        std::cin &gt;&gt; z;</div>
 <div class="line"><span class="lineno">   89</span>        <span class="keywordflow">switch</span> (z) {</div>
 <div class="line"><span class="lineno">   90</span>        <span class="keywordflow">case</span> 1:</div>
-<div class="line"><span class="lineno">   91</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the number you want to enter&quot;</span> &lt;&lt; <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">   92</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; x;</div>
+<div class="line"><span class="lineno">   91</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number you want to enter&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   92</span>            std::cin &gt;&gt; x;</div>
 <div class="line"><span class="lineno">   93</span>            <a class="code hl_function" href="#afcb07da7984e20b3207934696791f5df">insertAtTheBeginning</a>(x);</div>
 <div class="line"><span class="lineno">   94</span>            <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">   95</span>        <span class="keywordflow">case</span> 2:</div>
-<div class="line"><span class="lineno">   96</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the number you want to enter&quot;</span> &lt;&lt; <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">   97</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; y;</div>
+<div class="line"><span class="lineno">   96</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number you want to enter&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   97</span>            std::cin &gt;&gt; y;</div>
 <div class="line"><span class="lineno">   98</span>            insertAtTheEnd(y);</div>
 <div class="line"><span class="lineno">   99</span>            <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  100</span>        <span class="keywordflow">case</span> 3:</div>
-<div class="line"><span class="lineno">  101</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div>
+<div class="line"><span class="lineno">  101</span>            std::cout</div>
 <div class="line"><span class="lineno">  102</span>                &lt;&lt; <span class="stringliteral">&quot;The linked list contains the following element in order&quot;</span></div>
-<div class="line"><span class="lineno">  103</span>                &lt;&lt; <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">  103</span>                &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  104</span>            display();</div>
 <div class="line"><span class="lineno">  105</span>            <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  106</span>        <span class="keywordflow">case</span> 4:</div>
 <div class="line"><span class="lineno">  107</span>            <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  108</span>        <span class="keywordflow">default</span>:</div>
-<div class="line"><span class="lineno">  109</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The entered choice is not correct&quot;</span> &lt;&lt; <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">  109</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;The entered choice is not correct&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  110</span>        }</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>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  114</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="alinkedlist__implentation__usingarray_8cpp_html_afcb07da7984e20b3207934696791f5df"><div class="ttname"><a href="#afcb07da7984e20b3207934696791f5df">insertAtTheBeginning</a></div><div class="ttdeci">void insertAtTheBeginning(int data)</div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:50</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dce/linkedlist__implentation__usingarray_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="370" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="ttc" id="alinkedlist__implentation__usingarray_8cpp_html_afcb07da7984e20b3207934696791f5df"><div class="ttname"><a href="#afcb07da7984e20b3207934696791f5df">insertAtTheBeginning</a></div><div class="ttdeci">void insertAtTheBeginning(int data)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00050">linkedlist_implentation_usingarray.cpp:50</a></div></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Variable Documentation</h2>
+<a id="ab84c7d9bed2aa1ade1fd61fbf5c2e07e" name="ab84c7d9bed2aa1ade1fd61fbf5c2e07e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ab84c7d9bed2aa1ade1fd61fbf5c2e07e">&#9670;&#160;</a></span>avail</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int avail = 0</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00022">22</a> of file <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html">linkedlist_implentation_usingarray.cpp</a>.</p>
+
+</div>
+</div>
+<a id="aed19b403f559fc5d5a4bce724f9e263c" name="aed19b403f559fc5d5a4bce724f9e263c"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aed19b403f559fc5d5a4bce724f9e263c">&#9670;&#160;</a></span>AvailArray</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../db/d8b/struct_node.html">Node</a> AvailArray[100]</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>array that will act as nodes of a linked list. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00019">19</a> of file <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html">linkedlist_implentation_usingarray.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a20358970b1abaf992eb85e071e454653" name="a20358970b1abaf992eb85e071e454653"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a20358970b1abaf992eb85e071e454653">&#9670;&#160;</a></span>head</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int head = -1</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00021">21</a> of file <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html">linkedlist_implentation_usingarray.cpp</a>.</p>
 
 </div>
 </div>
diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/dce/linkedlist__implentation__usingarray_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index db3849c48..000000000
--- a/d3/dce/linkedlist__implentation__usingarray_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="140,5,211,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,37,124,24,125,30,55,42"/>
-<area shape="rect" id="Node000003" href="$d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df" title=" " alt="" coords="103,55,248,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,45,88,50,87,56,54,50"/>
-<area shape="rect" id="Node000004" href="$d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be" title=" " alt="" coords="296,55,363,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="249,65,280,65,280,70,249,70"/>
-</map>
diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/dce/linkedlist__implentation__usingarray_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 79864421c..000000000
--- a/d3/dce/linkedlist__implentation__usingarray_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bcdc38dc6668a6abfab60cdb5db7f640
\ No newline at end of file
diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/dce/linkedlist__implentation__usingarray_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 7c0219d62..000000000
--- a/d3/dce/linkedlist__implentation__usingarray_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="277pt" height="64pt"
- viewBox="0.00 0.00 276.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.25,-56.25 100.75,-56.25 100.75,-37 154.25,-37 154.25,-56.25"/>
-<text text-anchor="middle" x="127.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.17,-30.76C51.29,-33.27 71.57,-36.87 89.24,-40.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.44,-43.42 98.9,-41.72 89.66,-36.53 88.44,-43.42"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="182,-19.25 73,-19.25 73,0 182,0 182,-19.25"/>
-<text text-anchor="middle" x="127.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">insertAtTheBeginning</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.17,-24.65C44.17,-23.47 52.7,-22.04 61.66,-20.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.98,-24.03 71.26,-18.92 60.82,-17.13 61.98,-24.03"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="268.5,-19.25 218,-19.25 218,0 268.5,0 268.5,-19.25"/>
-<text text-anchor="middle" x="243.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">getnode</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.38,-9.62C190.44,-9.62 198.59,-9.62 206.16,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.99,-13.13 215.99,-9.63 205.99,-6.13 205.99,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/dce/linkedlist__implentation__usingarray_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 82bee8d54..000000000
--- a/d3/dce/linkedlist__implentation__usingarray_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="277pt" height="64pt"
- viewBox="0.00 0.00 276.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.25,-56.25 100.75,-56.25 100.75,-37 154.25,-37 154.25,-56.25"/>
-<text text-anchor="middle" x="127.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.17,-30.76C51.29,-33.27 71.57,-36.87 89.24,-40.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.44,-43.42 98.9,-41.72 89.66,-36.53 88.44,-43.42"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="182,-19.25 73,-19.25 73,0 182,0 182,-19.25"/>
-<text text-anchor="middle" x="127.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">insertAtTheBeginning</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.17,-24.65C44.17,-23.47 52.7,-22.04 61.66,-20.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.98,-24.03 71.26,-18.92 60.82,-17.13 61.98,-24.03"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="268.5,-19.25 218,-19.25 218,0 268.5,0 268.5,-19.25"/>
-<text text-anchor="middle" x="243.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">getnode</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.38,-9.62C190.44,-9.62 198.59,-9.62 206.16,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.99,-13.13 215.99,-9.63 205.99,-6.13 205.99,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.map b/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.map
deleted file mode 100644
index 3a248a29f..000000000
--- a/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="insertAtTheBeginning" name="insertAtTheBeginning">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,151,31"/>
-<area shape="rect" id="Node000002" href="$d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be" title=" " alt="" coords="199,5,266,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="151,16,183,16,183,21,151,21"/>
-</map>
diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.md5 b/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.md5
deleted file mode 100644
index 03f2c5ab7..000000000
--- a/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b7f35c7af9c26cd8bf27777c90d80ed3
\ No newline at end of file
diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.svg b/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.svg
deleted file mode 100644
index f9e28d911..000000000
--- a/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: insertAtTheBeginning Pages: 1 -->
-<svg width="204pt" height="27pt"
- viewBox="0.00 0.00 203.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>insertAtTheBeginning</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="109,-19.25 0,-19.25 0,0 109,0 109,-19.25"/>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">insertAtTheBeginning</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.5,-19.25 145,-19.25 145,0 195.5,0 195.5,-19.25"/>
-<text text-anchor="middle" x="170.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">getnode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.38,-9.62C117.44,-9.62 125.59,-9.62 133.16,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.99,-13.13 142.99,-9.63 132.99,-6.13 132.99,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph_org.svg b/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph_org.svg
deleted file mode 100644
index 2a01e912f..000000000
--- a/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: insertAtTheBeginning Pages: 1 -->
-<svg width="204pt" height="27pt"
- viewBox="0.00 0.00 203.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>insertAtTheBeginning</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="109,-19.25 0,-19.25 0,0 109,0 109,-19.25"/>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">insertAtTheBeginning</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.5,-19.25 145,-19.25 145,0 195.5,0 195.5,-19.25"/>
-<text text-anchor="middle" x="170.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">getnode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.38,-9.62C117.44,-9.62 125.59,-9.62 133.16,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.99,-13.13 142.99,-9.63 132.99,-6.13 132.99,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp_source.html b/d3/dce/linkedlist__implentation__usingarray_8cpp_source.html
new file mode 100644
index 000000000..fca3f9af4
--- /dev/null
+++ b/d3/dce/linkedlist__implentation__usingarray_8cpp_source.html
@@ -0,0 +1,248 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/linkedlist_implentation_usingarray.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/dce/linkedlist__implentation__usingarray_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">linkedlist_implentation_usingarray.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="foldopen" id="foldopen00014" data-start="{" data-end="};">
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"><a class="line" href="../../db/d8b/struct_node.html">   14</a></span><span class="keyword">struct </span><a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> {</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="keywordtype">int</span> data;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <span class="keywordtype">int</span> next;</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>};</div>
+</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"><a class="line" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">   19</a></span><a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> <a class="code hl_variable" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[100];  </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="keywordtype">int</span> head = -1;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="keywordtype">int</span> avail = 0;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keywordtype">void</span> initialise_list() {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= 98; i++) {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        <a class="code hl_variable" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[i].next = i + 1;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    }</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <a class="code hl_variable" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[99].next = -1;  <span class="comment">// indicating the end of the linked list.</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>}</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="foldopen" id="foldopen00032" data-start="{" data-end="}">
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be">   32</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be">getnode</a>() {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordtype">int</span> NodeIndexToBeReturned = avail;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    avail = <a class="code hl_variable" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[avail].next;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordflow">return</span> NodeIndexToBeReturned;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>}</div>
+</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="foldopen" id="foldopen00042" data-start="{" data-end="}">
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02">   42</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02">freeNode</a>(<span class="keywordtype">int</span> nodeToBeDeleted) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <a class="code hl_variable" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[nodeToBeDeleted].next = avail;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    avail = nodeToBeDeleted;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>}</div>
+</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="foldopen" id="foldopen00050" data-start="{" data-end="}">
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"><a class="line" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df">   50</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df">insertAtTheBeginning</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordtype">int</span> newNode = <a class="code hl_function" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be">getnode</a>();</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <a class="code hl_variable" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[newNode].data = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <a class="code hl_variable" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[newNode].next = head;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    head = newNode;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>}</div>
+</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="keywordtype">void</span> insertAtTheEnd(<span class="keywordtype">int</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordtype">int</span> newNode = <a class="code hl_function" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be">getnode</a>();</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordtype">int</span> temp = head;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">while</span> (<a class="code hl_variable" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[temp].next != -1) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        temp = <a class="code hl_variable" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[temp].next;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    }</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="comment">// temp is now pointing to the end node.</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <a class="code hl_variable" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[newNode].data = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <a class="code hl_variable" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[newNode].next = -1;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <a class="code hl_variable" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[temp].next = newNode;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>}</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="keywordtype">void</span> display() {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keywordtype">int</span> temp = head;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordflow">while</span> (temp != -1) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        std::cout &lt;&lt; <a class="code hl_variable" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[temp].data &lt;&lt; <span class="stringliteral">&quot;-&gt;&quot;</span>;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        temp = <a class="code hl_variable" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a>[temp].next;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    }</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;-1&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>}</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="foldopen" id="foldopen00079" data-start="{" data-end="}">
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   79</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    initialise_list();</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keywordtype">int</span> x, y, z;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">for</span> (;;) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;1. Insert At The Beginning&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;2. Insert At The End&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;3. Display&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;4.Exit&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter Your choice&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        std::cin &gt;&gt; z;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        <span class="keywordflow">switch</span> (z) {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        <span class="keywordflow">case</span> 1:</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number you want to enter&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>            std::cin &gt;&gt; x;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>            <a class="code hl_function" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df">insertAtTheBeginning</a>(x);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        <span class="keywordflow">case</span> 2:</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number you want to enter&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            std::cin &gt;&gt; y;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>            insertAtTheEnd(y);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        <span class="keywordflow">case</span> 3:</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>            std::cout</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>                &lt;&lt; <span class="stringliteral">&quot;The linked list contains the following element in order&quot;</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>                &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>            display();</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="keywordflow">case</span> 4:</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>            <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <span class="keywordflow">default</span>:</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;The entered choice is not correct&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        }</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    }</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>}</div>
+</div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="alinkedlist__implentation__usingarray_8cpp_html_a08ba214242a900e7251cec556b592f02"><div class="ttname"><a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02">freeNode</a></div><div class="ttdeci">void freeNode(int nodeToBeDeleted)</div><div class="ttdef"><b>Definition</b> <a href="#l00042">linkedlist_implentation_usingarray.cpp:42</a></div></div>
+<div class="ttc" id="alinkedlist__implentation__usingarray_8cpp_html_a73e11e0871f56342a30da93b6c93e8be"><div class="ttname"><a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be">getnode</a></div><div class="ttdeci">int getnode()</div><div class="ttdef"><b>Definition</b> <a href="#l00032">linkedlist_implentation_usingarray.cpp:32</a></div></div>
+<div class="ttc" id="alinkedlist__implentation__usingarray_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00079">linkedlist_implentation_usingarray.cpp:79</a></div></div>
+<div class="ttc" id="alinkedlist__implentation__usingarray_8cpp_html_aed19b403f559fc5d5a4bce724f9e263c"><div class="ttname"><a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a></div><div class="ttdeci">Node AvailArray[100]</div><div class="ttdoc">array that will act as nodes of a linked list.</div><div class="ttdef"><b>Definition</b> <a href="#l00019">linkedlist_implentation_usingarray.cpp:19</a></div></div>
+<div class="ttc" id="alinkedlist__implentation__usingarray_8cpp_html_afcb07da7984e20b3207934696791f5df"><div class="ttname"><a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df">insertAtTheBeginning</a></div><div class="ttdeci">void insertAtTheBeginning(int data)</div><div class="ttdef"><b>Definition</b> <a href="#l00050">linkedlist_implentation_usingarray.cpp:50</a></div></div>
+<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html">linkedlist_implentation_usingarray.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html b/d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html
index 444e236bd..0435f10d7 100644
--- a/d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html
+++ b/d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Contributor Covenant Code of Conduct</title>
+<title>TheAlgorithms/C++: Contributor Covenant Code of Conduct</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d3/de4/classrange__queries_1_1heavy__light__decomposition_1_1_s_g-members.html b/d3/de4/classrange__queries_1_1heavy__light__decomposition_1_1_s_g-members.html
index 99e8e565e..b2a051965 100644
--- a/d3/de4/classrange__queries_1_1heavy__light__decomposition_1_1_s_g-members.html
+++ b/d3/de4/classrange__queries_1_1heavy__light__decomposition_1_1_s_g-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d3/dea/stack__using__linked__list_8cpp_source.html b/d3/dea/stack__using__linked__list_8cpp_source.html
new file mode 100644
index 000000000..726477fd4
--- /dev/null
+++ b/d3/dea/stack__using__linked__list_8cpp_source.html
@@ -0,0 +1,206 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/stack_using_linked_list.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/dea/stack__using__linked__list_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">stack_using_linked_list.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span> </div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> {</div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span>    <span class="keywordtype">int</span> val;</div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *next;</div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span>};</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *top_var;</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="keywordtype">void</span> push(<span class="keywordtype">int</span> x) {</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    n-&gt;val = x;</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    n-&gt;next = top_var;</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    top_var = n;</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>}</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="keywordtype">void</span> pop() {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="keywordflow">if</span> (top_var == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nUnderflow&quot;</span>;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = top_var;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span> &lt;&lt; t-&gt;val &lt;&lt; <span class="stringliteral">&quot; deleted&quot;</span>;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        top_var = top_var-&gt;next;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        <span class="keyword">delete</span> t;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    }</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>}</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keywordtype">void</span> show() {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = top_var;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">while</span> (t != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        std::cout &lt;&lt; t-&gt;val &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        t = t-&gt;next;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    }</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>}</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordtype">int</span> ch = 0, x = 0;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n0. Exit or Ctrl+C&quot;</span>;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n1. Push&quot;</span>;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n2. Pop&quot;</span>;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n3. Print&quot;</span>;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter Your Choice: &quot;</span>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        std::cin &gt;&gt; ch;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="keywordflow">switch</span> (ch) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            <span class="keywordflow">case</span> 0:</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            <span class="keywordflow">case</span> 1:</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\nInsert : &quot;</span>;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>                std::cin &gt;&gt; x;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>                push(x);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            <span class="keywordflow">case</span> 2:</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>                pop();</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            <span class="keywordflow">case</span> 3:</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>                show();</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            <span class="keywordflow">default</span>:</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Invalid option!\n&quot;</span>;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        }</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    } <span class="keywordflow">while</span> (ch != 0);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>}</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><b>stack_using_linked_list.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/deb/namespaceshortest__common__supersequence.html b/d3/deb/namespaceshortest__common__supersequence.html
index 54645ac2e..32b53dbd4 100644
--- a/d3/deb/namespaceshortest__common__supersequence.html
+++ b/d3/deb/namespaceshortest__common__supersequence.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: shortest_common_supersequence Namespace Reference</title>
+<title>TheAlgorithms/C++: shortest_common_supersequence Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d3/dec/cycle__check__directed__graph_8cpp_source.html b/d3/dec/cycle__check__directed__graph_8cpp_source.html
new file mode 100644
index 000000000..89b16d3a2
--- /dev/null
+++ b/d3/dec/cycle__check__directed__graph_8cpp_source.html
@@ -0,0 +1,385 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/cycle_check_directed_graph.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/dec/cycle__check__directed__graph_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">cycle_check_directed_graph.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;iostream&gt;</span>     <span class="comment">// for std::cout</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;map&gt;</span>          <span class="comment">// for std::map</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;queue&gt;</span>        <span class="comment">// for std::queue</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;stdexcept&gt;</span>    <span class="comment">// for throwing errors</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;type_traits&gt;</span>  <span class="comment">// for std::remove_reference</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;utility&gt;</span>      <span class="comment">// for std::move</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;vector&gt;</span>       <span class="comment">// for std::vector</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keyword">struct </span><a class="code hl_struct" href="../../d7/d77/class_edge.html">Edge</a> {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> src;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> dest;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <a class="code hl_struct" href="../../d7/d77/class_edge.html">Edge</a>() = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <a class="code hl_struct" href="../../d7/d77/class_edge.html">~Edge</a>() = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <a class="code hl_struct" href="../../d7/d77/class_edge.html">Edge</a>(<a class="code hl_struct" href="../../d7/d77/class_edge.html">Edge</a>&amp;&amp;) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <a class="code hl_struct" href="../../d7/d77/class_edge.html">Edge</a>&amp; operator=(<a class="code hl_struct" href="../../d7/d77/class_edge.html">Edge</a>&amp;&amp;) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <a class="code hl_struct" href="../../d7/d77/class_edge.html">Edge</a>(<a class="code hl_struct" href="../../d7/d77/class_edge.html">Edge</a> <span class="keyword">const</span>&amp;) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <a class="code hl_struct" href="../../d7/d77/class_edge.html">Edge</a>&amp; operator=(<a class="code hl_struct" href="../../d7/d77/class_edge.html">Edge</a> <span class="keyword">const</span>&amp;) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="foldopen" id="foldopen00041" data-start="{" data-end="}">
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980">   41</a></span>    <a class="code hl_function" href="../../d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980">Edge</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> source, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> destination)</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        : src(source), dest(destination) {}</div>
+</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>};</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="keyword">using </span>AdjList = std::map&lt;unsigned int, std::vector&lt;unsigned int&gt;&gt;;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="keyword">class </span><a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a>() : m_adjList({}) {}</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <a class="code hl_class" href="../../da/d9a/class_graph.html">~Graph</a>() = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a>(<a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a>&amp;&amp;) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a>&amp; operator=(<a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a>&amp;&amp;) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a>(<a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> <span class="keyword">const</span>&amp;) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a>&amp; operator=(<a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> <span class="keyword">const</span>&amp;) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="foldopen" id="foldopen00069" data-start="{" data-end="}">
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="../../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d">   69</a></span>    <a class="code hl_function" href="../../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d">Graph</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> vertices, AdjList adjList)</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        : m_vertices(vertices), m_adjList(std::move(adjList)) {}</div>
+</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="foldopen" id="foldopen00077" data-start="{" data-end="}">
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3">   77</a></span>    <a class="code hl_function" href="../../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3">Graph</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> vertices, AdjList&amp;&amp; adjList)</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        : m_vertices(vertices), m_adjList(std::move(adjList)) {}</div>
+</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="foldopen" id="foldopen00089" data-start="{" data-end="}">
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"><a class="line" href="../../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1">   89</a></span>    <a class="code hl_function" href="../../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1">Graph</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> vertices, std::vector&lt;Edge&gt; <span class="keyword">const</span>&amp; edges)</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        : m_vertices(vertices) {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span>&amp; edge : edges) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>            <span class="keywordflow">if</span> (edge.src &gt;= vertices || edge.dest &gt;= vertices) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>                <span class="keywordflow">throw</span> std::range_error(</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>                    <span class="stringliteral">&quot;Either src or dest of edge out of range&quot;</span>);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>            }</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            m_adjList[edge.src].emplace_back(edge.dest);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        }</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    }</div>
+</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="foldopen" id="foldopen00104" data-start="{" data-end="}">
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"><a class="line" href="../../da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d">  104</a></span>    std::remove_reference&lt;AdjList&gt;::type <span class="keyword">const</span>&amp; <a class="code hl_function" href="../../da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d">getAdjList</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        <span class="keywordflow">return</span> m_adjList;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    }</div>
+</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"><a class="line" href="../../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1">  111</a></span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1">getVertices</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> m_vertices; }</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"><a class="line" href="../../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413">  119</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413">addVertices</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> num = 1) { m_vertices += num; }</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="foldopen" id="foldopen00125" data-start="{" data-end="}">
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"><a class="line" href="../../da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5">  125</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5">addEdge</a>(<a class="code hl_struct" href="../../d7/d77/class_edge.html">Edge</a> <span class="keyword">const</span>&amp; edge) {</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        <span class="keywordflow">if</span> (edge.src &gt;= m_vertices || edge.dest &gt;= m_vertices) {</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>            <span class="keywordflow">throw</span> std::range_error(<span class="stringliteral">&quot;Either src or dest of edge out of range&quot;</span>);</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        }</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        m_adjList[edge.src].emplace_back(edge.dest);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    }</div>
+</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
+<div class="foldopen" id="foldopen00137" data-start="{" data-end="}">
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"><a class="line" href="../../da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910">  137</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910">addEdge</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> source, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> destination) {</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>        <span class="keywordflow">if</span> (source &gt;= m_vertices || destination &gt;= m_vertices) {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>            <span class="keywordflow">throw</span> std::range_error(</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>                <span class="stringliteral">&quot;Either source or destination of edge out of range&quot;</span>);</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        }</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        m_adjList[source].emplace_back(destination);</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    }</div>
+</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span> </div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> m_vertices = 0;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    AdjList m_adjList;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>};</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span> </div>
+<div class="foldopen" id="foldopen00159" data-start="{" data-end="};">
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"><a class="line" href="../../d3/dbb/class_cycle_check.html">  159</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d3/dbb/class_cycle_check.html">CycleCheck</a> {</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    <span class="keyword">enum</span> nodeStates : uint8_t { not_visited = 0, in_stack, visited };</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span> </div>
+<div class="foldopen" id="foldopen00171" data-start="{" data-end="}">
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"><a class="line" href="../../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b">  171</a></span>    <span class="keyword">static</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b">isCyclicDFSHelper</a>(AdjList <span class="keyword">const</span>&amp; adjList,</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>                                  std::vector&lt;nodeStates&gt;* state,</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>                                  <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        <span class="comment">// Add node &quot;in_stack&quot; state.</span></div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        (*state)[<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>] = in_stack;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        <span class="comment">// If the node has children, then recursively visit all children of the</span></div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        <span class="comment">// node.</span></div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        <span class="keyword">auto</span> <span class="keyword">const</span> it = adjList.find(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        <span class="keywordflow">if</span> (it != adjList.end()) {</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> child : it-&gt;second) {</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>                <span class="comment">// If state of child node is &quot;not_visited&quot;, evaluate that child</span></div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>                <span class="comment">// for presence of cycle.</span></div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>                <span class="keyword">auto</span> state_of_child = (*state)[child];</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>                <span class="keywordflow">if</span> (state_of_child == not_visited) {</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>                    <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b">isCyclicDFSHelper</a>(adjList, state, child)) {</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>                        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>                    }</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>                } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (state_of_child == in_stack) {</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>                    <span class="comment">// If child node was &quot;in_stack&quot;, then that means that there</span></div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>                    <span class="comment">// is a cycle in the graph. Return true for presence of the</span></div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>                    <span class="comment">// cycle.</span></div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>                    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>                }</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>            }</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>        }</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span> </div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>        <span class="comment">// Current node has been evaluated for the presence of cycle and had no</span></div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        <span class="comment">// cycle. Mark current node as &quot;visited&quot;.</span></div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>        (*state)[<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>] = visited;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>        <span class="comment">// Return that current node didn&#39;t result in any cycles.</span></div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    }</div>
+</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span> </div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00213" data-start="{" data-end="}">
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"><a class="line" href="../../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474">  213</a></span>    <span class="keyword">static</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474">isCyclicDFS</a>(<a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> <span class="keyword">const</span>&amp; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>) {</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>        <span class="keyword">auto</span> vertices = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.getVertices();</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span> </div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>        std::vector&lt;nodeStates&gt; state(vertices, not_visited);</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span> </div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>        <span class="comment">// Start visiting each node.</span></div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>        <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = 0; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> &lt; vertices; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>++) {</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>            <span class="comment">// If a node is not visited, only then check for presence of cycle.</span></div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>            <span class="comment">// There is no need to check for presence of cycle for a visited</span></div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>            <span class="comment">// node as it has already been checked for presence of cycle.</span></div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>            <span class="keywordflow">if</span> (state[<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>] == not_visited) {</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>                <span class="comment">// Check for cycle.</span></div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>                <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b">isCyclicDFSHelper</a>(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.getAdjList(), &amp;state, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>)) {</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>                    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>                }</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>            }</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>        }</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span> </div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>        <span class="comment">// All nodes have been safely traversed, that means there is no cycle in</span></div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>        <span class="comment">// the graph. Return false.</span></div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    }</div>
+</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span> </div>
+<div class="foldopen" id="foldopen00250" data-start="{" data-end="}">
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"><a class="line" href="../../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5">  250</a></span>    <span class="keyword">static</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5">isCyclicBFS</a>(<a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> <span class="keyword">const</span>&amp; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>) {</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>        <span class="keyword">auto</span> graphAjdList = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.getAdjList();</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>        <span class="keyword">auto</span> vertices = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.getVertices();</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span> </div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>        std::vector&lt;unsigned int&gt; indegree(vertices, 0);</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>        <span class="comment">// Calculate the indegree i.e. the number of incident edges to the node.</span></div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span>&amp; <a class="code hl_struct" href="../../d8/d10/structlist.html">list</a> : graphAjdList) {</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>            <span class="keyword">auto</span> children = <a class="code hl_struct" href="../../d8/d10/structlist.html">list</a>.second;</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span>&amp; child : children) {</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>                indegree[child]++;</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>            }</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>        }</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span> </div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>        std::queue&lt;unsigned int&gt; can_be_solved;</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>        <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = 0; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> &lt; vertices; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>++) {</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>            <span class="comment">// If a node doesn&#39;t have any input edges, then that node will</span></div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>            <span class="comment">// definately not result in a cycle and can be visited safely.</span></div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>            <span class="keywordflow">if</span> (!indegree[<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>]) {</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>                can_be_solved.emplace(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>            }</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>        }</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span> </div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>        <span class="comment">// Vertices that need to be traversed.</span></div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>        <span class="keyword">auto</span> remain = vertices;</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>        <span class="comment">// While there are safe nodes that we can visit.</span></div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>        <span class="keywordflow">while</span> (!can_be_solved.empty()) {</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>            <span class="keyword">auto</span> solved = can_be_solved.front();</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>            <span class="comment">// Visit the node.</span></div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>            can_be_solved.pop();</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>            <span class="comment">// Decrease number of nodes that need to be traversed.</span></div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>            remain--;</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span> </div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>            <span class="comment">// Visit all the children of the visited node.</span></div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>            <span class="keyword">auto</span> it = graphAjdList.find(solved);</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>            <span class="keywordflow">if</span> (it != graphAjdList.end()) {</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>                <span class="keywordflow">for</span> (<span class="keyword">auto</span> child : it-&gt;second) {</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>                    <span class="comment">// Check if we can visited the node safely.</span></div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>                    <span class="keywordflow">if</span> (--indegree[child] == 0) {</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>                        <span class="comment">// if node can be visited safely, then add that node to</span></div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>                        <span class="comment">// the visit queue.</span></div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>                        can_be_solved.emplace(child);</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>                    }</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>                }</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>            }</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>        }</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span> </div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>        <span class="comment">// If there are still nodes that we can&#39;t visit, then it means that</span></div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>        <span class="comment">// there is a cycle and return true, else return false.</span></div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>        <span class="keywordflow">return</span> !(remain == 0);</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>    }</div>
+</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>};</div>
+</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span> </div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>    <span class="comment">// Instantiate the graph.</span></div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>    <a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>(7, std::vector&lt;Edge&gt;{{0, 1}, {1, 2}, {2, 0}, {2, 5}, {3, 5}});</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>    <span class="comment">// Check for cycle using BFS method.</span></div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>    std::cout &lt;&lt; <a class="code hl_function" href="../../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5">CycleCheck::isCyclicBFS</a>(g) &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span> </div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>    <span class="comment">// Check for cycle using DFS method.</span></div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>    std::cout &lt;&lt; <a class="code hl_function" href="../../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474">CycleCheck::isCyclicDFS</a>(g) &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>}</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="aclass_cycle_check_html"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html">CycleCheck</a></div><div class="ttdef"><b>Definition</b> <a href="#l00159">cycle_check_directed_graph.cpp:159</a></div></div>
+<div class="ttc" id="aclass_cycle_check_html_a2f4485c08b45e7a21a2e86f9c3f01d8b"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b">CycleCheck::isCyclicDFSHelper</a></div><div class="ttdeci">static bool isCyclicDFSHelper(AdjList const &amp;adjList, std::vector&lt; nodeStates &gt; *state, unsigned int node)</div><div class="ttdef"><b>Definition</b> <a href="#l00171">cycle_check_directed_graph.cpp:171</a></div></div>
+<div class="ttc" id="aclass_cycle_check_html_a399292a33edf87499daa52b51315aca5"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5">CycleCheck::isCyclicBFS</a></div><div class="ttdeci">static bool isCyclicBFS(Graph const &amp;graph)</div><div class="ttdef"><b>Definition</b> <a href="#l00250">cycle_check_directed_graph.cpp:250</a></div></div>
+<div class="ttc" id="aclass_cycle_check_html_ad9a270ffba3a68539b92272c702e3474"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474">CycleCheck::isCyclicDFS</a></div><div class="ttdeci">static bool isCyclicDFS(Graph const &amp;graph)</div><div class="ttdef"><b>Definition</b> <a href="#l00213">cycle_check_directed_graph.cpp:213</a></div></div>
+<div class="ttc" id="aclass_edge_html"><div class="ttname"><a href="../../d7/d77/class_edge.html">Edge</a></div><div class="ttdef"><b>Definition</b> <a href="../../df/d14/bellman__ford_8cpp_source.html#l00008">bellman_ford.cpp:8</a></div></div>
+<div class="ttc" id="aclass_edge_html_a415a5d002fe11c58711e48aabe975980"><div class="ttname"><a href="../../d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980">Edge::Edge</a></div><div class="ttdeci">Edge(unsigned int source, unsigned int destination)</div><div class="ttdef"><b>Definition</b> <a href="#l00041">cycle_check_directed_graph.cpp:41</a></div></div>
+<div class="ttc" id="aclass_graph_html"><div class="ttname"><a href="../../da/d9a/class_graph.html">Graph</a></div><div class="ttdef"><b>Definition</b> <a href="../../df/d14/bellman__ford_8cpp_source.html#l00014">bellman_ford.cpp:14</a></div></div>
+<div class="ttc" id="aclass_graph_html_a5a090e1a63a5c47bdd1a539b21f7fd1d"><div class="ttname"><a href="../../da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d">Graph::getAdjList</a></div><div class="ttdeci">std::remove_reference&lt; AdjList &gt;::type const &amp; getAdjList() const</div><div class="ttdef"><b>Definition</b> <a href="#l00104">cycle_check_directed_graph.cpp:104</a></div></div>
+<div class="ttc" id="aclass_graph_html_a8c95e00effaea0cd9404dd74cd802ae3"><div class="ttname"><a href="../../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3">Graph::Graph</a></div><div class="ttdeci">Graph(unsigned int vertices, AdjList &amp;&amp;adjList)</div><div class="ttdef"><b>Definition</b> <a href="#l00077">cycle_check_directed_graph.cpp:77</a></div></div>
+<div class="ttc" id="aclass_graph_html_a8dcb5ce0b4a6f65827f5055d9d53a3f1"><div class="ttname"><a href="../../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1">Graph::getVertices</a></div><div class="ttdeci">unsigned int getVertices() const</div><div class="ttdef"><b>Definition</b> <a href="#l00111">cycle_check_directed_graph.cpp:111</a></div></div>
+<div class="ttc" id="aclass_graph_html_aa99d44d3179d5bbbfa84a5031cf80cb1"><div class="ttname"><a href="../../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1">Graph::Graph</a></div><div class="ttdeci">Graph(unsigned int vertices, std::vector&lt; Edge &gt; const &amp;edges)</div><div class="ttdef"><b>Definition</b> <a href="#l00089">cycle_check_directed_graph.cpp:89</a></div></div>
+<div class="ttc" id="aclass_graph_html_ac5a4d9a4f894a179198936042c778413"><div class="ttname"><a href="../../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413">Graph::addVertices</a></div><div class="ttdeci">void addVertices(unsigned int num=1)</div><div class="ttdef"><b>Definition</b> <a href="#l00119">cycle_check_directed_graph.cpp:119</a></div></div>
+<div class="ttc" id="aclass_graph_html_ac85c63bcca4764a621f9f8609a8e5910"><div class="ttname"><a href="../../da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910">Graph::addEdge</a></div><div class="ttdeci">void addEdge(unsigned int source, unsigned int destination)</div><div class="ttdef"><b>Definition</b> <a href="#l00137">cycle_check_directed_graph.cpp:137</a></div></div>
+<div class="ttc" id="aclass_graph_html_adcbd1b60cab30b97c54d700eee8e456d"><div class="ttname"><a href="../../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d">Graph::Graph</a></div><div class="ttdeci">Graph(unsigned int vertices, AdjList adjList)</div><div class="ttdef"><b>Definition</b> <a href="#l00069">cycle_check_directed_graph.cpp:69</a></div></div>
+<div class="ttc" id="aclass_graph_html_af765dda8f21280e1cecea19e129f1bc5"><div class="ttname"><a href="../../da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5">Graph::addEdge</a></div><div class="ttdeci">void addEdge(Edge const &amp;edge)</div><div class="ttdef"><b>Definition</b> <a href="#l00125">cycle_check_directed_graph.cpp:125</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00115">composite_simpson_rule.cpp:115</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></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 class="ttc" id="astructlist_html"><div class="ttname"><a href="../../d8/d10/structlist.html">list</a></div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00029">hash_search.cpp:29</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><b>cycle_check_directed_graph.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/df9/recursive__bubble__sort_8cpp.html b/d3/df9/recursive__bubble__sort_8cpp.html
index 2f74a68a4..f09c27846 100644
--- a/d3/df9/recursive__bubble__sort_8cpp.html
+++ b/d3/df9/recursive__bubble__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/recursive_bubble_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/recursive_bubble_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for recursive_bubble_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d31/recursive__bubble__sort_8cpp__incl.svg" width="508" height="126"><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">
+</div>
+<p><a href="../../d3/df9/recursive__bubble__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -134,7 +153,7 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ae3a775d99dbbb94c130a973df0cfddcf" id="r_ae3a775d99dbbb94c130a973df0cfddcf"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ae3a775d99dbbb94c130a973df0cfddcf"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf">sorting::recursive_bubble_sort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *nums, uint64_t n)</td></tr>
+<tr class="memitem:ae3a775d99dbbb94c130a973df0cfddcf"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf">sorting::recursive_bubble_sort</a> (std::vector&lt; T &gt; *nums, uint64_t n)</td></tr>
 <tr class="memdesc:ae3a775d99dbbb94c130a973df0cfddcf"><td class="mdescLeft">&#160;</td><td class="mdescRight">This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is then dereferenced, so that the changes are reflected in the original vector. It also accepts a second parameter of type <code>int</code> and name <code>n</code>, which is the size of the array.  <br /></td></tr>
 <tr class="separator:ae3a775d99dbbb94c130a973df0cfddcf"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -159,6 +178,8 @@ Algorithm</h3>
 <p>While the recursive method does not necessarily have advantages over iterative versions, but it is useful to enhance the understanding of the algorithm and recursion itself. In Recursive Bubble sort algorithm, we firstly call the function on the entire array, and for every subsequent function call, we exclude the last element. This fixes the last element for that sub-array.Formally, for <code>ith</code> iteration, we consider elements up to n-i, where n is the number of elements in the array. Exit condition: n==1; i.e. the sub-array contains only one element.</p>
 <p>Complexity Time complexity: O(n) best case; O(n²) average case; O(n²) worst case Space complexity: O(n)</p>
 <p>We need to traverse the array <code>n * (n-1)</code> times. However, if the entire array is already sorted, then we need to traverse it only once. Hence, O(n) is the best case complexity </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/df9/recursive__bubble__sort_8cpp_source.html">recursive_bubble_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -177,17 +198,14 @@ Algorithm</h3>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/df9/recursive__bubble__sort_8cpp_source.html#l00155">155</a> of file <a class="el" href="../../d3/df9/recursive__bubble__sort_8cpp_source.html">recursive_bubble_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  155</span>           {</div>
 <div class="line"><span class="lineno">  156</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  157</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  158</span>}</div>
-<div class="ttc" id="arecursive__bubble__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> recursive_bubble_sort.cpp:105</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/df9/recursive__bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="480" height="323"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="arecursive__bubble__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/df9/recursive__bubble__sort_8cpp_source.html#l00105">recursive_bubble_sort.cpp:105</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -215,65 +233,55 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/df9/recursive__bubble__sort_8cpp_source.html#l00105">105</a> of file <a class="el" href="../../d3/df9/recursive__bubble__sort_8cpp_source.html">recursive_bubble_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  105</span>                   {</div>
 <div class="line"><span class="lineno">  106</span>    <span class="comment">// 1st example. Creating an array of type `int`.</span></div>
-<div class="line"><span class="lineno">  107</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1st test using `int`\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  107</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test using `int`\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  108</span>    <span class="keyword">const</span> uint64_t size = 6;</div>
-<div class="line"><span class="lineno">  109</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> arr;</div>
+<div class="line"><span class="lineno">  109</span>    std::vector&lt;int64_t&gt; arr;</div>
 <div class="line"><span class="lineno">  110</span>    <span class="comment">// populating the array</span></div>
-<div class="line"><span class="lineno">  111</span>    arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(22);</div>
-<div class="line"><span class="lineno">  112</span>    arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(46);</div>
-<div class="line"><span class="lineno">  113</span>    arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(94);</div>
-<div class="line"><span class="lineno">  114</span>    arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(12);</div>
-<div class="line"><span class="lineno">  115</span>    arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(37);</div>
-<div class="line"><span class="lineno">  116</span>    arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(63);</div>
+<div class="line"><span class="lineno">  111</span>    arr.push_back(22);</div>
+<div class="line"><span class="lineno">  112</span>    arr.push_back(46);</div>
+<div class="line"><span class="lineno">  113</span>    arr.push_back(94);</div>
+<div class="line"><span class="lineno">  114</span>    arr.push_back(12);</div>
+<div class="line"><span class="lineno">  115</span>    arr.push_back(37);</div>
+<div class="line"><span class="lineno">  116</span>    arr.push_back(63);</div>
 <div class="line"><span class="lineno">  117</span>    <span class="comment">// array populating ends</span></div>
 <div class="line"><span class="lineno">  118</span> </div>
 <div class="line"><span class="lineno">  119</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf">sorting::recursive_bubble_sort</a>(&amp;arr, size);</div>
-<div class="line"><span class="lineno">  120</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr)));</div>
-<div class="line"><span class="lineno">  121</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; 1st test passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  120</span>    assert(std::is_sorted(std::begin(arr), std::end(arr)));</div>
+<div class="line"><span class="lineno">  121</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; 1st test passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  122</span>    <span class="comment">// printing the array</span></div>
 <div class="line"><span class="lineno">  123</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; size; i++) {</div>
-<div class="line"><span class="lineno">  124</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><span class="lineno">  124</span>        std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
 <div class="line"><span class="lineno">  125</span>    }</div>
-<div class="line"><span class="lineno">  126</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  126</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  127</span> </div>
 <div class="line"><span class="lineno">  128</span>    <span class="comment">// 2nd example. Creating an array of type `double`.</span></div>
-<div class="line"><span class="lineno">  129</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2nd test using doubles\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  130</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> double_arr;</div>
+<div class="line"><span class="lineno">  129</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test using doubles\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  130</span>    std::vector&lt;double&gt; double_arr;</div>
 <div class="line"><span class="lineno">  131</span> </div>
 <div class="line"><span class="lineno">  132</span>    <span class="comment">// populating the array</span></div>
-<div class="line"><span class="lineno">  133</span>    double_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(20.4);</div>
-<div class="line"><span class="lineno">  134</span>    double_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(62.7);</div>
-<div class="line"><span class="lineno">  135</span>    double_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(12.2);</div>
-<div class="line"><span class="lineno">  136</span>    double_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(43.6);</div>
-<div class="line"><span class="lineno">  137</span>    double_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(74.1);</div>
-<div class="line"><span class="lineno">  138</span>    double_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(57.9);</div>
+<div class="line"><span class="lineno">  133</span>    double_arr.push_back(20.4);</div>
+<div class="line"><span class="lineno">  134</span>    double_arr.push_back(62.7);</div>
+<div class="line"><span class="lineno">  135</span>    double_arr.push_back(12.2);</div>
+<div class="line"><span class="lineno">  136</span>    double_arr.push_back(43.6);</div>
+<div class="line"><span class="lineno">  137</span>    double_arr.push_back(74.1);</div>
+<div class="line"><span class="lineno">  138</span>    double_arr.push_back(57.9);</div>
 <div class="line"><span class="lineno">  139</span>    <span class="comment">// array populating ends</span></div>
 <div class="line"><span class="lineno">  140</span> </div>
 <div class="line"><span class="lineno">  141</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf">sorting::recursive_bubble_sort</a>(&amp;double_arr, size);</div>
-<div class="line"><span class="lineno">  142</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(double_arr), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(double_arr)));</div>
-<div class="line"><span class="lineno">  143</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; 2nd test passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  142</span>    assert(std::is_sorted(std::begin(double_arr), std::end(double_arr)));</div>
+<div class="line"><span class="lineno">  143</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; 2nd test passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  144</span>    <span class="comment">// printing the array</span></div>
 <div class="line"><span class="lineno">  145</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; size; i++) {</div>
-<div class="line"><span class="lineno">  146</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; double_arr[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><span class="lineno">  146</span>        std::cout &lt;&lt; double_arr[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
 <div class="line"><span class="lineno">  147</span>    }</div>
-<div class="line"><span class="lineno">  148</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  148</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  149</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="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</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="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-<div class="ttc" id="anamespacesorting_html_ae3a775d99dbbb94c130a973df0cfddcf"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf">sorting::recursive_bubble_sort</a></div><div class="ttdeci">void recursive_bubble_sort(std::vector&lt; T &gt; *nums, uint64_t n)</div><div class="ttdoc">This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is t...</div><div class="ttdef"><b>Definition</b> recursive_bubble_sort.cpp:84</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/df9/recursive__bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="383" height="323"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacesorting_html_ae3a775d99dbbb94c130a973df0cfddcf"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf">sorting::recursive_bubble_sort</a></div><div class="ttdeci">void recursive_bubble_sort(std::vector&lt; T &gt; *nums, uint64_t n)</div><div class="ttdoc">This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is t...</div><div class="ttdef"><b>Definition</b> <a href="../../d3/df9/recursive__bubble__sort_8cpp_source.html#l00084">recursive_bubble_sort.cpp:84</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/df9/recursive__bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d3/df9/recursive__bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 04ca538c9..000000000
--- a/d3/df9/recursive__bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,18 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,129,49,155"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="135,5,213,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="32,127,55,85,73,61,95,40,119,27,122,32,98,44,77,64,59,88,36,130"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="140,55,208,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="41,127,66,108,95,89,124,78,126,82,98,94,69,112,45,131"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="138,104,210,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,136,122,123,123,128,49,141"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="124,153,224,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="49,143,109,153,108,158,49,148"/>
-<area shape="rect" id="Node000006" 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="97,203,251,228"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="45,153,69,172,98,189,109,194,107,199,95,194,66,176,42,158"/>
-<area shape="rect" id="Node000007" href="$d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf" title="This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is t..." alt="" coords="113,276,234,317"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="38,154,63,194,99,239,129,265,125,269,95,243,58,197,33,157"/>
-<area shape="poly" id="edge7_Node000007_Node000007" title=" " alt="" coords="145,276,144,267,148,258,159,252,174,250,190,252,200,259,197,263,188,257,174,255,160,257,152,261,149,268,150,275"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="299,284,377,310"/>
-<area shape="poly" id="edge8_Node000007_Node000008" title=" " alt="" coords="235,294,283,294,283,300,235,300"/>
-</map>
diff --git a/d3/df9/recursive__bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d3/df9/recursive__bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 2eed41c56..000000000
--- a/d3/df9/recursive__bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f1d684c8e351a072dff8761ee5242222
\ No newline at end of file
diff --git a/d3/df9/recursive__bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d3/df9/recursive__bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 2ac5765a7..000000000
--- a/d3/df9/recursive__bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,183 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="287pt" height="242pt"
- viewBox="0.00 0.00 287.00 241.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 237.88)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-140.88 0,-140.88 0,-121.62 32.5,-121.62 32.5,-140.88"/>
-<text text-anchor="middle" x="16.25" y="-127.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.75,-233.88 97,-233.88 97,-214.62 155.75,-214.62 155.75,-233.88"/>
-<text text-anchor="middle" x="126.38" y="-220.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.49,-141.34C28.74,-157.43 45.08,-188.85 68.5,-206.25 73.77,-210.17 79.92,-213.25 86.19,-215.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.7,-218.86 95.29,-218.67 86.89,-212.21 84.7,-218.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152,-196.88 100.75,-196.88 100.75,-177.62 152,-177.62 152,-196.88"/>
-<text text-anchor="middle" x="126.38" y="-183.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.33,-141.18C38.25,-149.63 53.51,-161.59 68.5,-169.25 75.04,-172.59 82.31,-175.46 89.42,-177.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.28,-181.17 98.87,-180.81 90.36,-174.49 88.28,-181.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="153.12,-159.88 99.62,-159.88 99.62,-140.62 153.12,-140.62 153.12,-159.88"/>
-<text text-anchor="middle" x="126.38" y="-146.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.74,-133.97C47.15,-136.5 69.19,-140.38 88.16,-143.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.53,-147.15 97.98,-145.44 88.74,-140.26 87.53,-147.15"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164,-122.88 88.75,-122.88 88.75,-103.62 164,-103.62 164,-122.88"/>
-<text text-anchor="middle" x="126.38" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.74,-128.67C44.51,-126.71 61.36,-123.91 77.47,-121.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.66,-124.74 86.95,-119.65 76.51,-117.84 77.66,-124.74"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="184.25,-85.88 68.5,-85.88 68.5,-66.62 184.25,-66.62 184.25,-85.88"/>
-<text text-anchor="middle" x="126.38" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.77,-121.28C38.73,-113.08 53.79,-101.64 68.5,-94.25 71.23,-92.88 74.08,-91.59 76.99,-90.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.16,-93.67 86.27,-86.85 75.68,-87.13 78.16,-93.67"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf" target="_top" xlink:title="This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is t...">
-<polygon fill="white" stroke="#666666" points="171.88,-30.5 80.88,-30.5 80.88,0 171.88,0 171.88,-30.5"/>
-<text text-anchor="start" x="88.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::recursive</text>
-<text text-anchor="middle" x="126.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_bubble_sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.66,-121.39C31.15,-106.45 48.7,-77.66 68.5,-57.25 75.32,-50.22 83.41,-43.49 91.32,-37.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.14,-40.57 99.21,-31.88 89.05,-34.89 93.14,-40.57"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.86,-30.99C102.88,-40.06 109.38,-48.5 126.38,-48.5 135.67,-48.5 141.82,-45.97 144.84,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.3,-42.77 145.75,-32.49 141.34,-42.12 148.3,-42.77"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279,-24.88 220.25,-24.88 220.25,-5.63 279,-5.63 279,-24.88"/>
-<text text-anchor="middle" x="249.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge8_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.18,-15.25C184.12,-15.25 196.94,-15.25 208.61,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.3,-18.75 218.3,-15.25 208.3,-11.75 208.3,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/df9/recursive__bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d3/df9/recursive__bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index feb71aaa0..000000000
--- a/d3/df9/recursive__bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,157 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="287pt" height="242pt"
- viewBox="0.00 0.00 287.00 241.88" 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 237.88)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-140.88 0,-140.88 0,-121.62 32.5,-121.62 32.5,-140.88"/>
-<text text-anchor="middle" x="16.25" y="-127.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.75,-233.88 97,-233.88 97,-214.62 155.75,-214.62 155.75,-233.88"/>
-<text text-anchor="middle" x="126.38" y="-220.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.49,-141.34C28.74,-157.43 45.08,-188.85 68.5,-206.25 73.77,-210.17 79.92,-213.25 86.19,-215.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.7,-218.86 95.29,-218.67 86.89,-212.21 84.7,-218.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152,-196.88 100.75,-196.88 100.75,-177.62 152,-177.62 152,-196.88"/>
-<text text-anchor="middle" x="126.38" y="-183.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.33,-141.18C38.25,-149.63 53.51,-161.59 68.5,-169.25 75.04,-172.59 82.31,-175.46 89.42,-177.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.28,-181.17 98.87,-180.81 90.36,-174.49 88.28,-181.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="153.12,-159.88 99.62,-159.88 99.62,-140.62 153.12,-140.62 153.12,-159.88"/>
-<text text-anchor="middle" x="126.38" y="-146.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.74,-133.97C47.15,-136.5 69.19,-140.38 88.16,-143.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.53,-147.15 97.98,-145.44 88.74,-140.26 87.53,-147.15"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164,-122.88 88.75,-122.88 88.75,-103.62 164,-103.62 164,-122.88"/>
-<text text-anchor="middle" x="126.38" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.74,-128.67C44.51,-126.71 61.36,-123.91 77.47,-121.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.66,-124.74 86.95,-119.65 76.51,-117.84 77.66,-124.74"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="184.25,-85.88 68.5,-85.88 68.5,-66.62 184.25,-66.62 184.25,-85.88"/>
-<text text-anchor="middle" x="126.38" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.77,-121.28C38.73,-113.08 53.79,-101.64 68.5,-94.25 71.23,-92.88 74.08,-91.59 76.99,-90.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.16,-93.67 86.27,-86.85 75.68,-87.13 78.16,-93.67"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf" target="_top" xlink:title="This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is t...">
-<polygon fill="white" stroke="#666666" points="171.88,-30.5 80.88,-30.5 80.88,0 171.88,0 171.88,-30.5"/>
-<text text-anchor="start" x="88.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::recursive</text>
-<text text-anchor="middle" x="126.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_bubble_sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.66,-121.39C31.15,-106.45 48.7,-77.66 68.5,-57.25 75.32,-50.22 83.41,-43.49 91.32,-37.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.14,-40.57 99.21,-31.88 89.05,-34.89 93.14,-40.57"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.86,-30.99C102.88,-40.06 109.38,-48.5 126.38,-48.5 135.67,-48.5 141.82,-45.97 144.84,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.3,-42.77 145.75,-32.49 141.34,-42.12 148.3,-42.77"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279,-24.88 220.25,-24.88 220.25,-5.63 279,-5.63 279,-24.88"/>
-<text text-anchor="middle" x="249.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge8_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.18,-15.25C184.12,-15.25 196.94,-15.25 208.61,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.3,-18.75 218.3,-15.25 208.3,-11.75 208.3,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/df9/recursive__bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/df9/recursive__bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 3ec3ff0c9..000000000
--- a/d3/df9/recursive__bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,20 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,129,55,155"/>
-<area shape="rect" id="Node000002" href="$d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,129,146,155"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,140,87,140,87,145,55,145"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="232,5,310,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="129,127,152,85,170,61,192,40,216,27,219,32,196,44,174,64,157,88,134,130"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="237,55,305,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="139,127,163,108,193,89,221,78,223,82,195,94,166,112,142,131"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="236,104,307,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="146,136,220,123,221,128,147,141"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="221,153,321,179"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="147,143,206,153,206,158,146,148"/>
-<area shape="rect" id="Node000007" 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="194,203,348,228"/>
-<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="143,153,167,172,195,189,206,194,204,199,193,194,164,176,139,158"/>
-<area shape="rect" id="Node000008" href="$d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf" title="This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is t..." alt="" coords="210,276,332,317"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="135,154,160,194,196,239,226,265,223,269,192,243,156,197,131,157"/>
-<area shape="poly" id="edge8_Node000008_Node000008" title=" " alt="" coords="243,276,241,267,246,258,256,252,271,250,288,252,297,259,294,263,286,257,271,255,258,257,250,261,246,268,248,275"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="396,284,475,310"/>
-<area shape="poly" id="edge9_Node000008_Node000009" title=" " alt="" coords="332,294,381,294,381,300,332,300"/>
-</map>
diff --git a/d3/df9/recursive__bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/df9/recursive__bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index d5171e0df..000000000
--- a/d3/df9/recursive__bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-205211f9307ae7b4205be9ebb4f30c85
\ No newline at end of file
diff --git a/d3/df9/recursive__bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/df9/recursive__bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 9faf754fd..000000000
--- a/d3/df9/recursive__bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,201 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="360pt" height="242pt"
- viewBox="0.00 0.00 360.00 241.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 237.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-140.88 0,-140.88 0,-121.62 37,-121.62 37,-140.88"/>
-<text text-anchor="middle" x="18.5" y="-127.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-140.88 73,-140.88 73,-121.62 105.5,-121.62 105.5,-140.88"/>
-<text text-anchor="middle" x="89.25" y="-127.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-131.25C44.58,-131.25 53.31,-131.25 61.45,-131.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-134.75 71.2,-131.25 61.2,-127.75 61.2,-134.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.75,-233.88 170,-233.88 170,-214.62 228.75,-214.62 228.75,-233.88"/>
-<text text-anchor="middle" x="199.38" y="-220.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.49,-141.34C101.74,-157.43 118.08,-188.85 141.5,-206.25 146.77,-210.17 152.92,-213.25 159.19,-215.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.7,-218.86 168.29,-218.67 159.89,-212.21 157.7,-218.86"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="225,-196.88 173.75,-196.88 173.75,-177.62 225,-177.62 225,-196.88"/>
-<text text-anchor="middle" x="199.38" y="-183.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.33,-141.18C111.25,-149.63 126.51,-161.59 141.5,-169.25 148.04,-172.59 155.31,-175.46 162.42,-177.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.28,-181.17 171.87,-180.81 163.36,-174.49 161.28,-181.17"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.12,-159.88 172.62,-159.88 172.62,-140.62 226.12,-140.62 226.12,-159.88"/>
-<text text-anchor="middle" x="199.38" y="-146.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.74,-133.97C120.15,-136.5 142.19,-140.38 161.16,-143.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.53,-147.15 170.98,-145.44 161.74,-140.26 160.53,-147.15"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237,-122.88 161.75,-122.88 161.75,-103.62 237,-103.62 237,-122.88"/>
-<text text-anchor="middle" x="199.38" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.74,-128.67C117.51,-126.71 134.36,-123.91 150.47,-121.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.66,-124.74 159.95,-119.65 149.51,-117.84 150.66,-124.74"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257.25,-85.88 141.5,-85.88 141.5,-66.62 257.25,-66.62 257.25,-85.88"/>
-<text text-anchor="middle" x="199.38" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.77,-121.28C111.73,-113.08 126.79,-101.64 141.5,-94.25 144.23,-92.88 147.08,-91.59 149.99,-90.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.16,-93.67 159.27,-86.85 148.68,-87.13 151.16,-93.67"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf" target="_top" xlink:title="This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is t...">
-<polygon fill="white" stroke="#666666" points="244.88,-30.5 153.88,-30.5 153.88,0 244.88,0 244.88,-30.5"/>
-<text text-anchor="start" x="161.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::recursive</text>
-<text text-anchor="middle" x="199.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_bubble_sort</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.66,-121.39C104.15,-106.45 121.7,-77.66 141.5,-57.25 148.32,-50.22 156.41,-43.49 164.32,-37.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.14,-40.57 172.21,-31.88 162.05,-34.89 166.14,-40.57"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge8_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge8_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M179.86,-30.99C175.88,-40.06 182.38,-48.5 199.38,-48.5 208.67,-48.5 214.82,-45.97 217.84,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.3,-42.77 218.75,-32.49 214.34,-42.12 221.3,-42.77"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="352,-24.88 293.25,-24.88 293.25,-5.63 352,-5.63 352,-24.88"/>
-<text text-anchor="middle" x="322.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge9_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.18,-15.25C257.12,-15.25 269.94,-15.25 281.61,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.3,-18.75 291.3,-15.25 281.3,-11.75 281.3,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/df9/recursive__bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/df9/recursive__bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 9b3824efa..000000000
--- a/d3/df9/recursive__bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,175 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="360pt" height="242pt"
- viewBox="0.00 0.00 360.00 241.88" 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 237.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-140.88 0,-140.88 0,-121.62 37,-121.62 37,-140.88"/>
-<text text-anchor="middle" x="18.5" y="-127.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-140.88 73,-140.88 73,-121.62 105.5,-121.62 105.5,-140.88"/>
-<text text-anchor="middle" x="89.25" y="-127.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-131.25C44.58,-131.25 53.31,-131.25 61.45,-131.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-134.75 71.2,-131.25 61.2,-127.75 61.2,-134.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.75,-233.88 170,-233.88 170,-214.62 228.75,-214.62 228.75,-233.88"/>
-<text text-anchor="middle" x="199.38" y="-220.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.49,-141.34C101.74,-157.43 118.08,-188.85 141.5,-206.25 146.77,-210.17 152.92,-213.25 159.19,-215.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.7,-218.86 168.29,-218.67 159.89,-212.21 157.7,-218.86"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="225,-196.88 173.75,-196.88 173.75,-177.62 225,-177.62 225,-196.88"/>
-<text text-anchor="middle" x="199.38" y="-183.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.33,-141.18C111.25,-149.63 126.51,-161.59 141.5,-169.25 148.04,-172.59 155.31,-175.46 162.42,-177.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.28,-181.17 171.87,-180.81 163.36,-174.49 161.28,-181.17"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.12,-159.88 172.62,-159.88 172.62,-140.62 226.12,-140.62 226.12,-159.88"/>
-<text text-anchor="middle" x="199.38" y="-146.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.74,-133.97C120.15,-136.5 142.19,-140.38 161.16,-143.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.53,-147.15 170.98,-145.44 161.74,-140.26 160.53,-147.15"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237,-122.88 161.75,-122.88 161.75,-103.62 237,-103.62 237,-122.88"/>
-<text text-anchor="middle" x="199.38" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.74,-128.67C117.51,-126.71 134.36,-123.91 150.47,-121.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.66,-124.74 159.95,-119.65 149.51,-117.84 150.66,-124.74"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257.25,-85.88 141.5,-85.88 141.5,-66.62 257.25,-66.62 257.25,-85.88"/>
-<text text-anchor="middle" x="199.38" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.77,-121.28C111.73,-113.08 126.79,-101.64 141.5,-94.25 144.23,-92.88 147.08,-91.59 149.99,-90.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.16,-93.67 159.27,-86.85 148.68,-87.13 151.16,-93.67"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf" target="_top" xlink:title="This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is t...">
-<polygon fill="white" stroke="#666666" points="244.88,-30.5 153.88,-30.5 153.88,0 244.88,0 244.88,-30.5"/>
-<text text-anchor="start" x="161.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::recursive</text>
-<text text-anchor="middle" x="199.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_bubble_sort</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.66,-121.39C104.15,-106.45 121.7,-77.66 141.5,-57.25 148.32,-50.22 156.41,-43.49 164.32,-37.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.14,-40.57 172.21,-31.88 162.05,-34.89 166.14,-40.57"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge8_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge8_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M179.86,-30.99C175.88,-40.06 182.38,-48.5 199.38,-48.5 208.67,-48.5 214.82,-45.97 217.84,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.3,-42.77 218.75,-32.49 214.34,-42.12 221.3,-42.77"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="352,-24.88 293.25,-24.88 293.25,-5.63 352,-5.63 352,-24.88"/>
-<text text-anchor="middle" x="322.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge9_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.18,-15.25C257.12,-15.25 269.94,-15.25 281.61,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.3,-18.75 291.3,-15.25 281.3,-11.75 281.3,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/df9/recursive__bubble__sort_8cpp_source.html b/d3/df9/recursive__bubble__sort_8cpp_source.html
new file mode 100644
index 000000000..b717256df
--- /dev/null
+++ b/d3/df9/recursive__bubble__sort_8cpp_source.html
@@ -0,0 +1,223 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/recursive_bubble_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/df9/recursive__bubble__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">recursive_bubble_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/df9/recursive__bubble__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="preprocessor">#include &lt;array&gt;</span>      </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00084" data-start="{" data-end="}">
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf">   84</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf">recursive_bubble_sort</a>(std::vector&lt;T&gt; *nums, uint64_t n) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keywordflow">if</span> (n == 1) {  </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n - 1; i++) {  </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        <span class="keywordflow">if</span> ((*nums)[i] &gt; (*nums)[i + 1]) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>            std::swap((*nums)[i], (*nums)[i + 1]);</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        }</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    }</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf">recursive_bubble_sort</a>(nums, n - 1);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>}</div>
+</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="foldopen" id="foldopen00105" data-start="{" data-end="}">
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"><a class="line" href="../../d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  105</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="comment">// 1st example. Creating an array of type `int`.</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test using `int`\n&quot;</span>;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="keyword">const</span> uint64_t size = 6;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    std::vector&lt;int64_t&gt; arr;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="comment">// populating the array</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    arr.push_back(22);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    arr.push_back(46);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    arr.push_back(94);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    arr.push_back(12);</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    arr.push_back(37);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    arr.push_back(63);</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="comment">// array populating ends</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf">sorting::recursive_bubble_sort</a>(&amp;arr, size);</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    assert(std::is_sorted(std::begin(arr), std::end(arr)));</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; 1st test passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="comment">// printing the array</span></div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; size; i++) {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    }</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span> </div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    <span class="comment">// 2nd example. Creating an array of type `double`.</span></div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test using doubles\n&quot;</span>;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    std::vector&lt;double&gt; double_arr;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="comment">// populating the array</span></div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    double_arr.push_back(20.4);</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    double_arr.push_back(62.7);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    double_arr.push_back(12.2);</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    double_arr.push_back(43.6);</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    double_arr.push_back(74.1);</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    double_arr.push_back(57.9);</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <span class="comment">// array populating ends</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span> </div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf">sorting::recursive_bubble_sort</a>(&amp;double_arr, size);</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    assert(std::is_sorted(std::begin(double_arr), std::end(double_arr)));</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; 2nd test passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <span class="comment">// printing the array</span></div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; size; i++) {</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        std::cout &lt;&lt; double_arr[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    }</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>}</div>
+</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
+<div class="foldopen" id="foldopen00155" data-start="{" data-end="}">
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"><a class="line" href="../../d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  155</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    <a class="code hl_function" href="../../d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>}</div>
+</div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+<div class="ttc" id="anamespacesorting_html_ae3a775d99dbbb94c130a973df0cfddcf"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf">sorting::recursive_bubble_sort</a></div><div class="ttdeci">void recursive_bubble_sort(std::vector&lt; T &gt; *nums, uint64_t n)</div><div class="ttdoc">This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is t...</div><div class="ttdef"><b>Definition</b> <a href="#l00084">recursive_bubble_sort.cpp:84</a></div></div>
+<div class="ttc" id="arecursive__bubble__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d3/df9/recursive__bubble__sort_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> <a href="#l00105">recursive_bubble_sort.cpp:105</a></div></div>
+<div class="ttc" id="arecursive__bubble__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00155">recursive_bubble_sort.cpp:155</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d3/df9/recursive__bubble__sort_8cpp.html">recursive_bubble_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/dfb/circular__queue__using__array_8cpp_source.html b/d3/dfb/circular__queue__using__array_8cpp_source.html
new file mode 100644
index 000000000..86d4f1514
--- /dev/null
+++ b/d3/dfb/circular__queue__using__array_8cpp_source.html
@@ -0,0 +1,197 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: operations_on_datastructures/circular_queue_using_array.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/dfb/circular__queue__using__array_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">circular_queue_using_array.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="keyword">using </span>std::cin;</div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="keyword">using </span>std::cout;</div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="keywordtype">int</span> <a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>[10];</div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="keywordtype">int</span> front = 0;</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="keywordtype">int</span> rear = 0;</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="keywordtype">int</span> count = 0;</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="keywordtype">void</span> Enque(<span class="keywordtype">int</span> x) {</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    <span class="keywordflow">if</span> (count == 10) {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nOverflow&quot;</span>;</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>        <a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>[rear] = x;</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>        rear = (rear + 1) % 10;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>        count++;</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    }</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>}</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="keywordtype">void</span> Deque() {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keywordflow">if</span> (front == rear) {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nUnderflow&quot;</span>;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    }</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span> &lt;&lt; <a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>[front] &lt;&lt; <span class="stringliteral">&quot; deleted&quot;</span>;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        front = (front + 1) % 10;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        count--;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    }</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>}</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keywordtype">void</span> show() {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; count; i++) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        cout &lt;&lt; <a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>[(i + front) % 10] &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    }</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>}</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordtype">int</span> ch, x;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n1. Enque&quot;</span>;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n2. Deque&quot;</span>;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n3. Print&quot;</span>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nEnter Your Choice : &quot;</span>;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        cin &gt;&gt; ch;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">if</span> (ch == 1) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            cout &lt;&lt; <span class="stringliteral">&quot;\nInsert : &quot;</span>;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            cin &gt;&gt; x;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            Enque(x);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ch == 2) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>            Deque();</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ch == 3) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            show();</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    } <span class="keywordflow">while</span> (ch != 0);</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}</div>
+<div class="ttc" id="aclassqueue_html"><div class="ttname"><a href="../../db/da9/classqueue.html">queue</a></div><div class="ttdef"><b>Definition</b> <a href="../../d7/ded/queue_8hpp_source.html#l00009">queue.hpp:9</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><b>circular_queue_using_array.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/dfe/horspool_8cpp.html b/d3/dfe/horspool_8cpp.html
index 42bf4aa67..3bbcdecd1 100644
--- a/d3/dfe/horspool_8cpp.html
+++ b/d3/dfe/horspool_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: strings/horspool.cpp File Reference</title>
+<title>TheAlgorithms/C++: strings/horspool.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for horspool.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/ddf/horspool_8cpp__incl.svg" width="306" height="111"><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">
+</div>
+<p><a href="../../d3/dfe/horspool_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dcb/namespacestrings.html">strings</a></td></tr>
@@ -133,9 +152,9 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a1a9c3aa55ccc79d0f47d50c580997336" id="r_a1a9c3aa55ccc79d0f47d50c580997336"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a>&lt; char, int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1a9c3aa55ccc79d0f47d50c580997336">strings::horspool::findShiftTable</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;prototype)</td></tr>
+<tr class="memitem:a1a9c3aa55ccc79d0f47d50c580997336" id="r_a1a9c3aa55ccc79d0f47d50c580997336"><td class="memItemLeft" align="right" valign="top">std::unordered_map&lt; char, int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1a9c3aa55ccc79d0f47d50c580997336">strings::horspool::findShiftTable</a> (const std::string &amp;prototype)</td></tr>
 <tr class="separator:a1a9c3aa55ccc79d0f47d50c580997336"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a9884bca75ce39c116697ea2574adb37d" id="r_a9884bca75ce39c116697ea2574adb37d"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9884bca75ce39c116697ea2574adb37d">strings::horspool::horspool</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;prototype)</td></tr>
+<tr class="memitem:a9884bca75ce39c116697ea2574adb37d" id="r_a9884bca75ce39c116697ea2574adb37d"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9884bca75ce39c116697ea2574adb37d">strings::horspool::horspool</a> (const std::string &amp;text, const std::string &amp;prototype)</td></tr>
 <tr class="separator:a9884bca75ce39c116697ea2574adb37d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
 <tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function with test cases for Horspool's algorithm.  <br /></td></tr>
@@ -147,6 +166,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Horspool's algorithm that finds if a string contains a substring (<a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm">https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm</a>) </p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/ckontakis" target="_blank">Harry Kontakis</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/dfe/horspool_8cpp_source.html">horspool.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a1a9c3aa55ccc79d0f47d50c580997336" name="a1a9c3aa55ccc79d0f47d50c580997336"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a1a9c3aa55ccc79d0f47d50c580997336">&#9670;&#160;</a></span>findShiftTable()</h2>
@@ -155,9 +176,9 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a>&lt; char, int &gt; strings::horspool::findShiftTable </td>
+          <td class="memname">std::unordered_map&lt; char, int &gt; strings::horspool::findShiftTable </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>prototype</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>prototype</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -169,43 +190,34 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Shift Table of Horspool's algorithm </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dfe/horspool_8cpp_source.html#l00026">26</a> of file <a class="el" href="../../d3/dfe/horspool_8cpp_source.html">horspool.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   26</span>                                                                       {</div>
-<div class="line"><span class="lineno">   27</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map&lt;char, int&gt;</a></div>
+<div class="line"><span class="lineno">   27</span>    std::unordered_map&lt;char, int&gt;</div>
 <div class="line"><span class="lineno">   28</span>        shiftTable;  <span class="comment">// A HashMap for shift table that has characters for keys and integers for values</span></div>
 <div class="line"><span class="lineno">   29</span> </div>
-<div class="line"><span class="lineno">   30</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
+<div class="line"><span class="lineno">   30</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; prototype.size();</div>
 <div class="line"><span class="lineno">   31</span>         i++) {  <span class="comment">// Checking all characters of prototype string</span></div>
-<div class="line"><span class="lineno">   32</span>        <span class="keywordflow">if</span> (shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">find</a>(prototype[i]) ==</div>
-<div class="line"><span class="lineno">   33</span>            shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">end</a>()) {  <span class="comment">// If character does not exist in HashMap</span></div>
-<div class="line"><span class="lineno">   34</span>            <span class="keywordflow">if</span> (i != prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1) {</div>
-<div class="line"><span class="lineno">   35</span>                shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html">insert</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
-<div class="line"><span class="lineno">   36</span>                    prototype[i], prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - i -</div>
+<div class="line"><span class="lineno">   32</span>        <span class="keywordflow">if</span> (shiftTable.find(prototype[i]) ==</div>
+<div class="line"><span class="lineno">   33</span>            shiftTable.end()) {  <span class="comment">// If character does not exist in HashMap</span></div>
+<div class="line"><span class="lineno">   34</span>            <span class="keywordflow">if</span> (i != prototype.size() - 1) {</div>
+<div class="line"><span class="lineno">   35</span>                shiftTable.insert(std::make_pair(</div>
+<div class="line"><span class="lineno">   36</span>                    prototype[i], prototype.size() - i -</div>
 <div class="line"><span class="lineno">   37</span>                                      1));  <span class="comment">// Insert the character as key and the size of prototype string - index of character - 1 as value</span></div>
 <div class="line"><span class="lineno">   38</span>            } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   39</span>                shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html">insert</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(</div>
+<div class="line"><span class="lineno">   39</span>                shiftTable.insert(std::make_pair(</div>
 <div class="line"><span class="lineno">   40</span>                    prototype[i],</div>
-<div class="line"><span class="lineno">   41</span>                    prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()));  <span class="comment">// Insert the character as key and the size of prototype string as value</span></div>
+<div class="line"><span class="lineno">   41</span>                    prototype.size()));  <span class="comment">// Insert the character as key and the size of prototype string as value</span></div>
 <div class="line"><span class="lineno">   42</span>            }</div>
 <div class="line"><span class="lineno">   43</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   44</span>            <span class="keywordflow">if</span> (i != prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1) {</div>
-<div class="line"><span class="lineno">   45</span>                shiftTable[prototype[i]] = prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/size.html">size</a>() - i - 1;</div>
+<div class="line"><span class="lineno">   44</span>            <span class="keywordflow">if</span> (i != prototype.size() - 1) {</div>
+<div class="line"><span class="lineno">   45</span>                shiftTable[prototype[i]] = prototype.size() - i - 1;</div>
 <div class="line"><span class="lineno">   46</span>            }</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> shiftTable;</div>
 <div class="line"><span class="lineno">   50</span>}</div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">std::unordered_map::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="afind_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">std::unordered_map::find</a></div><div class="ttdeci">T find(T... args)</div></div>
-<div class="ttc" id="ainsert_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html">std::unordered_map::insert</a></div><div class="ttdeci">T insert(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/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-<div class="ttc" id="aunordered_map_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph.svg" width="350" height="331"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a9884bca75ce39c116697ea2574adb37d" name="a9884bca75ce39c116697ea2574adb37d"></a>
@@ -217,12 +229,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool strings::horspool::horspool </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>prototype</em></span>&#160;)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>prototype</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -236,18 +248,20 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>true if text string contains prototype string </dd>
 <dd>
 false if text string does not contain prototype string </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dfe/horspool_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d3/dfe/horspool_8cpp_source.html">horspool.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   59</span>                                                                 {</div>
-<div class="line"><span class="lineno">   60</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map&lt;char, int&gt;</a> shiftTable = <a class="code hl_function" href="#a1a9c3aa55ccc79d0f47d50c580997336">findShiftTable</a>(</div>
+<div class="line"><span class="lineno">   60</span>    std::unordered_map&lt;char, int&gt; shiftTable = <a class="code hl_function" href="#a1a9c3aa55ccc79d0f47d50c580997336">findShiftTable</a>(</div>
 <div class="line"><span class="lineno">   61</span>        prototype);  <span class="comment">// Initialise shift table calling findShiftTable function</span></div>
 <div class="line"><span class="lineno">   62</span> </div>
 <div class="line"><span class="lineno">   63</span>    <span class="keywordtype">int</span> i = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(</div>
-<div class="line"><span class="lineno">   64</span>        prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() -</div>
+<div class="line"><span class="lineno">   64</span>        prototype.size() -</div>
 <div class="line"><span class="lineno">   65</span>        1);  <span class="comment">// Index that we shift in text to find the substring</span></div>
-<div class="line"><span class="lineno">   66</span>    <span class="keywordflow">while</span> (i &lt; text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) {</div>
+<div class="line"><span class="lineno">   66</span>    <span class="keywordflow">while</span> (i &lt; text.size()) {</div>
 <div class="line"><span class="lineno">   67</span>        <span class="keywordtype">int</span> j = i, <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = 0;</div>
 <div class="line"><span class="lineno">   68</span>        <span class="keywordtype">bool</span> flag = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   69</span> </div>
-<div class="line"><span class="lineno">   70</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> z = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1); z &gt;= 0 &amp;&amp; flag;</div>
+<div class="line"><span class="lineno">   70</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> z = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(prototype.size() - 1); z &gt;= 0 &amp;&amp; flag;</div>
 <div class="line"><span class="lineno">   71</span>             z--) {  <span class="comment">// Checking if all characters of substring are equal with all characters of string</span></div>
 <div class="line"><span class="lineno">   72</span>            <span class="keywordflow">if</span> (text[j] == prototype[z]) {</div>
 <div class="line"><span class="lineno">   73</span>                <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++;</div>
@@ -258,26 +272,21 @@ false if text string does not contain prototype string </dd></dl>
 <div class="line"><span class="lineno">   78</span>        }</div>
 <div class="line"><span class="lineno">   79</span> </div>
 <div class="line"><span class="lineno">   80</span>        <span class="keywordflow">if</span> (k ==</div>
-<div class="line"><span class="lineno">   81</span>            prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) {  <span class="comment">// If all characters match then return true</span></div>
+<div class="line"><span class="lineno">   81</span>            prototype.size()) {  <span class="comment">// If all characters match then return true</span></div>
 <div class="line"><span class="lineno">   82</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   83</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   84</span>            <span class="keywordflow">if</span> (shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">find</a>(text[i]) != shiftTable.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">end</a>()) {</div>
+<div class="line"><span class="lineno">   84</span>            <span class="keywordflow">if</span> (shiftTable.find(text[i]) != shiftTable.end()) {</div>
 <div class="line"><span class="lineno">   85</span>                i += shiftTable[text[i]];  <span class="comment">// If shift table contains the character then shift index as many steps as value</span></div>
 <div class="line"><span class="lineno">   86</span>            } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   87</span>                i += prototype.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();  <span class="comment">// If character does not exist in shift table then shift index as many steps as size of prototype string</span></div>
+<div class="line"><span class="lineno">   87</span>                i += prototype.size();  <span class="comment">// If character does not exist in shift table then shift index as many steps as size of prototype string</span></div>
 <div class="line"><span class="lineno">   88</span>            }</div>
 <div class="line"><span class="lineno">   89</span>        }</div>
 <div class="line"><span class="lineno">   90</span>    }</div>
 <div class="line"><span class="lineno">   91</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   92</span>}</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-<div class="ttc" id="ahorspool_8cpp_html_a1a9c3aa55ccc79d0f47d50c580997336"><div class="ttname"><a href="#a1a9c3aa55ccc79d0f47d50c580997336">strings::horspool::findShiftTable</a></div><div class="ttdeci">std::unordered_map&lt; char, int &gt; findShiftTable(const std::string &amp;prototype)</div><div class="ttdef"><b>Definition</b> horspool.cpp:26</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.svg" width="523" height="331"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="ahorspool_8cpp_html_a1a9c3aa55ccc79d0f47d50c580997336"><div class="ttname"><a href="#a1a9c3aa55ccc79d0f47d50c580997336">strings::horspool::findShiftTable</a></div><div class="ttdeci">std::unordered_map&lt; char, int &gt; findShiftTable(const std::string &amp;prototype)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dfe/horspool_8cpp_source.html#l00026">horspool.cpp:26</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -297,17 +306,14 @@ Here is the call graph for this function:</div>
 
 <p>Main Function that calls test function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dfe/horspool_8cpp_source.html#l00119">119</a> of file <a class="el" href="../../d3/dfe/horspool_8cpp_source.html">horspool.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  119</span>          {</div>
 <div class="line"><span class="lineno">  120</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
 <div class="line"><span class="lineno">  121</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  122</span>}</div>
-<div class="ttc" id="ahorspool_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function with test cases for Horspool's algorithm.</div><div class="ttdef"><b>Definition</b> horspool.cpp:100</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dfe/horspool_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ahorspool_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function with test cases for Horspool's algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dfe/horspool_8cpp_source.html#l00100">horspool.cpp:100</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -335,6 +341,8 @@ Here is the call graph for this function:</div>
 
 <p>Function with test cases for Horspool's algorithm. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dfe/horspool_8cpp_source.html#l00100">100</a> of file <a class="el" href="../../d3/dfe/horspool_8cpp_source.html">horspool.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  100</span>                  {</div>
 <div class="line"><span class="lineno">  101</span>    assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello World&quot;</span>,<span class="stringliteral">&quot;World&quot;</span>) == <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">  102</span>    assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello World&quot;</span>,<span class="stringliteral">&quot; World&quot;</span>) == <span class="keyword">true</span>);</div>
diff --git a/d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph.map b/d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph.map
deleted file mode 100644
index 85db09fa8..000000000
--- a/d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="strings::horspool::findShiftTable" name="strings::horspool::findShiftTable">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,150,131,190"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="31,150,29,140,35,131,48,125,68,123,89,126,102,132,99,137,88,131,68,128,50,130,39,135,35,141,36,149"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/end.html#" title=" " alt="" coords="179,5,344,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="80,148,119,95,146,66,177,41,187,35,190,40,180,46,150,70,123,98,84,151"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/find.html#" title=" " alt="" coords="193,55,330,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="102,147,177,106,191,100,193,105,180,111,105,152"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/insert.html#" title=" " alt="" coords="193,120,330,161"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="131,158,178,151,179,156,132,163"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="208,185,315,211"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="132,177,193,186,192,191,131,182"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="206,235,317,260"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="109,189,180,221,196,227,195,232,178,226,107,193"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/size.html#" title=" " alt="" coords="193,284,330,325"/>
-<area shape="poly" id="edge7_Node000001_Node000007" title=" " alt="" coords="89,189,129,230,180,271,187,275,185,280,177,275,125,234,85,193"/>
-</map>
diff --git a/d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph.md5 b/d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph.md5
deleted file mode 100644
index db9ccbf69..000000000
--- a/d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-132a54d65a2bc8bc0a4b5744d57b526f
\ No newline at end of file
diff --git a/d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph.svg b/d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph.svg
deleted file mode 100644
index 061bc92be..000000000
--- a/d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph.svg
+++ /dev/null
@@ -1,168 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: strings::horspool::findShiftTable Pages: 1 -->
-<svg width="262pt" height="248pt"
- viewBox="0.00 0.00 262.00 247.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 243.88)">
-<title>strings::horspool::findShiftTable</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="94,-131.5 0,-131.5 0,-101 94,-101 94,-131.5"/>
-<text text-anchor="start" x="8" y="-118" font-family="Helvetica,sans-Serif" font-size="10.00">strings::horspool::</text>
-<text text-anchor="middle" x="47" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">findShiftTable</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.31,-131.99C16.06,-141.06 24.63,-149.5 47,-149.5 59.24,-149.5 67.34,-146.97 71.32,-143.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.76,-143.84 72.51,-133.49 67.82,-142.99 74.76,-143.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254,-239.88 130,-239.88 130,-220.62 254,-220.62 254,-239.88"/>
-<text text-anchor="middle" x="192" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M57.39,-131.77C70.9,-152.79 97.75,-190.11 130,-211.25 132.39,-212.82 134.93,-214.27 137.54,-215.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136,-218.74 146.56,-219.58 138.83,-212.34 136,-218.74"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.12,-202.5 140.88,-202.5 140.88,-172 243.12,-172 243.12,-202.5"/>
-<text text-anchor="start" x="148.88" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="192" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.79,-131.79C89.73,-141.12 110.75,-152.95 130,-162.25 133.3,-163.84 136.72,-165.43 140.2,-166.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.71,-170.15 149.27,-170.93 141.5,-163.73 138.71,-170.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.12,-153.5 140.88,-153.5 140.88,-123 243.12,-123 243.12,-153.5"/>
-<text text-anchor="start" x="148.88" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="192" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.43,-123.39C105.68,-125.12 117.87,-127 129.69,-128.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.95,-132.24 139.36,-130.31 130.01,-125.33 128.95,-132.24"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.25,-104.88 151.75,-104.88 151.75,-85.62 232.25,-85.62 232.25,-104.88"/>
-<text text-anchor="middle" x="192" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.43,-109.43C109.12,-107.28 125.42,-104.88 140.38,-102.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.64,-106.18 150.02,-101.27 139.62,-99.26 140.64,-106.18"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.75,-67.88 150.25,-67.88 150.25,-48.62 233.75,-48.62 233.75,-67.88"/>
-<text text-anchor="middle" x="192" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.07,-100.59C92.52,-92.66 111.99,-83.25 130,-76.25 134.05,-74.68 138.3,-73.16 142.59,-71.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.34,-75.16 151.81,-68.78 141.21,-68.49 143.34,-75.16"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.12,-30.5 140.88,-30.5 140.88,0 243.12,0 243.12,-30.5"/>
-<text text-anchor="start" x="148.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="192" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.4,-100.51C76.58,-83.49 102.77,-56.49 130,-39.25 131.8,-38.11 133.67,-37.01 135.58,-35.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.73,-39.28 144.06,-31.63 133.56,-33.04 136.73,-39.28"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph_org.svg b/d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph_org.svg
deleted file mode 100644
index 18b2a149c..000000000
--- a/d3/dfe/horspool_8cpp_a1a9c3aa55ccc79d0f47d50c580997336_cgraph_org.svg
+++ /dev/null
@@ -1,142 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: strings::horspool::findShiftTable Pages: 1 -->
-<svg width="262pt" height="248pt"
- viewBox="0.00 0.00 262.00 247.88" 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 243.88)">
-<title>strings::horspool::findShiftTable</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="94,-131.5 0,-131.5 0,-101 94,-101 94,-131.5"/>
-<text text-anchor="start" x="8" y="-118" font-family="Helvetica,sans-Serif" font-size="10.00">strings::horspool::</text>
-<text text-anchor="middle" x="47" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">findShiftTable</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.31,-131.99C16.06,-141.06 24.63,-149.5 47,-149.5 59.24,-149.5 67.34,-146.97 71.32,-143.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.76,-143.84 72.51,-133.49 67.82,-142.99 74.76,-143.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254,-239.88 130,-239.88 130,-220.62 254,-220.62 254,-239.88"/>
-<text text-anchor="middle" x="192" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M57.39,-131.77C70.9,-152.79 97.75,-190.11 130,-211.25 132.39,-212.82 134.93,-214.27 137.54,-215.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136,-218.74 146.56,-219.58 138.83,-212.34 136,-218.74"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.12,-202.5 140.88,-202.5 140.88,-172 243.12,-172 243.12,-202.5"/>
-<text text-anchor="start" x="148.88" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="192" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.79,-131.79C89.73,-141.12 110.75,-152.95 130,-162.25 133.3,-163.84 136.72,-165.43 140.2,-166.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.71,-170.15 149.27,-170.93 141.5,-163.73 138.71,-170.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.12,-153.5 140.88,-153.5 140.88,-123 243.12,-123 243.12,-153.5"/>
-<text text-anchor="start" x="148.88" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="192" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.43,-123.39C105.68,-125.12 117.87,-127 129.69,-128.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.95,-132.24 139.36,-130.31 130.01,-125.33 128.95,-132.24"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.25,-104.88 151.75,-104.88 151.75,-85.62 232.25,-85.62 232.25,-104.88"/>
-<text text-anchor="middle" x="192" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.43,-109.43C109.12,-107.28 125.42,-104.88 140.38,-102.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.64,-106.18 150.02,-101.27 139.62,-99.26 140.64,-106.18"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.75,-67.88 150.25,-67.88 150.25,-48.62 233.75,-48.62 233.75,-67.88"/>
-<text text-anchor="middle" x="192" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.07,-100.59C92.52,-92.66 111.99,-83.25 130,-76.25 134.05,-74.68 138.3,-73.16 142.59,-71.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.34,-75.16 151.81,-68.78 141.21,-68.49 143.34,-75.16"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.12,-30.5 140.88,-30.5 140.88,0 243.12,0 243.12,-30.5"/>
-<text text-anchor="start" x="148.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="192" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.4,-100.51C76.58,-83.49 102.77,-56.49 130,-39.25 131.8,-38.11 133.67,-37.01 135.58,-35.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.73,-39.28 144.06,-31.63 133.56,-33.04 136.73,-39.28"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.map b/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.map
deleted file mode 100644
index 877281e25..000000000
--- a/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="strings::horspool::horspool" name="strings::horspool::horspool">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,96,131,137"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/end.html#" title=" " alt="" coords="352,5,517,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="119,93,178,73,264,50,346,32,347,37,265,55,179,78,121,99"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/find.html#" title=" " alt="" coords="366,55,503,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="131,105,178,98,351,80,352,85,179,103,131,110"/>
-<area shape="rect" id="Node000004" href="$d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336" title=" " alt="" coords="179,136,304,177"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="132,129,164,136,163,142,130,134"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="379,300,490,326"/>
-<area shape="poly" id="edge11_Node000001_Node000007" title=" " alt="" coords="100,136,208,208,279,249,353,285,371,292,369,297,351,290,276,253,205,212,97,140"/>
-<area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="255,134,295,88,321,63,351,41,362,35,364,40,353,46,325,67,299,91,259,138"/>
-<area shape="poly" id="edge5_Node000004_Node000003" title=" " alt="" coords="288,134,351,106,367,100,369,105,353,111,290,138"/>
-<area shape="poly" id="edge6_Node000004_Node000004" title=" " alt="" coords="208,136,206,127,212,118,224,112,241,110,260,112,272,119,269,123,259,117,241,115,225,117,215,122,212,128,213,135"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/insert.html#" title=" " alt="" coords="366,120,503,161"/>
-<area shape="poly" id="edge7_Node000004_Node000005" title=" " alt="" coords="304,149,351,145,352,150,305,154"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="381,185,488,211"/>
-<area shape="poly" id="edge8_Node000004_Node000006" title=" " alt="" coords="305,168,366,181,365,186,304,173"/>
-<area shape="poly" id="edge9_Node000004_Node000007" title=" " alt="" coords="257,176,296,231,323,260,354,285,366,292,363,297,350,290,319,264,292,234,253,179"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/size.html#" title=" " alt="" coords="366,235,503,276"/>
-<area shape="poly" id="edge10_Node000004_Node000008" title=" " alt="" coords="275,175,353,221,364,226,361,231,351,226,272,180"/>
-</map>
diff --git a/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.md5 b/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.md5
deleted file mode 100644
index d7d0c1507..000000000
--- a/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2a589a7d0350d0715aab6d5ff21407cf
\ No newline at end of file
diff --git a/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.svg b/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.svg
deleted file mode 100644
index ccd2675d5..000000000
--- a/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph.svg
+++ /dev/null
@@ -1,214 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: strings::horspool::horspool Pages: 1 -->
-<svg width="392pt" height="248pt"
- viewBox="0.00 0.00 392.00 248.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 244.25)">
-<title>strings::horspool::horspool</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="94,-171.88 0,-171.88 0,-141.38 94,-141.38 94,-171.88"/>
-<text text-anchor="start" x="8" y="-158.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::horspool::</text>
-<text text-anchor="middle" x="47" y="-147.12" font-family="Helvetica,sans-Serif" font-size="10.00">horspool</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="384,-240.25 260,-240.25 260,-221 384,-221 384,-240.25"/>
-<text text-anchor="middle" x="322" y="-226.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86,-172.26C99.72,-177.57 115.42,-183.25 130,-187.62 171.31,-200.02 218.58,-210.69 255.77,-218.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.99,-221.71 265.48,-220.26 256.37,-214.85 254.99,-221.71"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373.12,-202.88 270.88,-202.88 270.88,-172.38 373.12,-172.38 373.12,-202.88"/>
-<text text-anchor="start" x="278.88" y="-189.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="322" y="-178.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.35,-163.79C105.98,-165.48 118.43,-167.2 130,-168.62 173.16,-173.93 221.95,-178.76 259.42,-182.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.88,-185.69 269.15,-183.12 259.52,-178.72 258.88,-185.69"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-141.88 130,-141.88 130,-111.38 224,-111.38 224,-141.88"/>
-<text text-anchor="start" x="138" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::horspool::</text>
-<text text-anchor="middle" x="177" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">findShiftTable</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.21,-145.79C102.19,-143.93 110.56,-141.96 118.79,-140.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="119.45,-143.47 128.38,-137.79 117.85,-136.66 119.45,-143.47"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="363.75,-19.25 280.25,-19.25 280.25,0 363.75,0 363.75,-19.25"/>
-<text text-anchor="middle" x="322" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge11_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge11_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.53,-140.93C106.7,-114.47 186.06,-60.74 260,-28.62 264.29,-26.76 268.83,-25 273.41,-23.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="274.31,-26.74 282.65,-20.21 272.06,-20.11 274.31,-26.74"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189,-142.09C203.28,-161.1 229.98,-193.11 260,-211.62 262.61,-213.23 265.37,-214.72 268.21,-216.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.79,-219.29 277.37,-219.94 269.51,-212.83 266.79,-219.29"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.03,-142.23C227.53,-148.63 244.54,-156.07 260,-162.62 263.81,-164.24 267.75,-165.9 271.72,-167.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="270.24,-170.73 280.82,-171.32 272.92,-164.26 270.24,-170.73"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge6_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge6_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.96,-142.36C149.26,-151.43 156.94,-159.88 177,-159.88 187.97,-159.88 195.24,-157.35 198.8,-153.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.25,-154.19 199.87,-143.87 195.3,-153.42 202.25,-154.19"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373.12,-153.88 270.88,-153.88 270.88,-123.38 373.12,-123.38 373.12,-153.88"/>
-<text text-anchor="start" x="278.88" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="322" y="-129.12" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge7_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge7_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.43,-130.52C235.68,-131.46 247.87,-132.49 259.69,-133.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="259.09,-136.94 269.35,-134.29 259.68,-129.97 259.09,-136.94"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="362.25,-105.25 281.75,-105.25 281.75,-86 362.25,-86 362.25,-105.25"/>
-<text text-anchor="middle" x="322" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge8_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge8_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.43,-116.56C239.12,-113.38 255.42,-109.84 270.38,-106.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="271.01,-110.04 280.04,-104.5 269.52,-103.2 271.01,-110.04"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge9_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge9_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.05,-110.98C200.33,-89.35 227.14,-50.53 260,-28.62 262.91,-26.69 266.02,-24.94 269.25,-23.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="270.58,-26.6 278.42,-19.48 267.85,-20.15 270.58,-26.6"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373.12,-67.88 270.88,-67.88 270.88,-37.38 373.12,-37.38 373.12,-67.88"/>
-<text text-anchor="start" x="278.88" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="322" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge10_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge10_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.07,-111.08C217.18,-100.59 239.39,-86.87 260,-76.62 262.54,-75.36 265.17,-74.12 267.84,-72.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.1,-76.16 276.87,-68.96 266.3,-69.75 269.1,-76.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph_org.svg b/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph_org.svg
deleted file mode 100644
index 7cfa47468..000000000
--- a/d3/dfe/horspool_8cpp_a9884bca75ce39c116697ea2574adb37d_cgraph_org.svg
+++ /dev/null
@@ -1,188 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: strings::horspool::horspool Pages: 1 -->
-<svg width="392pt" height="248pt"
- viewBox="0.00 0.00 392.00 248.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 244.25)">
-<title>strings::horspool::horspool</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="94,-171.88 0,-171.88 0,-141.38 94,-141.38 94,-171.88"/>
-<text text-anchor="start" x="8" y="-158.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::horspool::</text>
-<text text-anchor="middle" x="47" y="-147.12" font-family="Helvetica,sans-Serif" font-size="10.00">horspool</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="384,-240.25 260,-240.25 260,-221 384,-221 384,-240.25"/>
-<text text-anchor="middle" x="322" y="-226.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86,-172.26C99.72,-177.57 115.42,-183.25 130,-187.62 171.31,-200.02 218.58,-210.69 255.77,-218.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.99,-221.71 265.48,-220.26 256.37,-214.85 254.99,-221.71"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373.12,-202.88 270.88,-202.88 270.88,-172.38 373.12,-172.38 373.12,-202.88"/>
-<text text-anchor="start" x="278.88" y="-189.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="322" y="-178.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.35,-163.79C105.98,-165.48 118.43,-167.2 130,-168.62 173.16,-173.93 221.95,-178.76 259.42,-182.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.88,-185.69 269.15,-183.12 259.52,-178.72 258.88,-185.69"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-141.88 130,-141.88 130,-111.38 224,-111.38 224,-141.88"/>
-<text text-anchor="start" x="138" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::horspool::</text>
-<text text-anchor="middle" x="177" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">findShiftTable</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.21,-145.79C102.19,-143.93 110.56,-141.96 118.79,-140.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="119.45,-143.47 128.38,-137.79 117.85,-136.66 119.45,-143.47"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="363.75,-19.25 280.25,-19.25 280.25,0 363.75,0 363.75,-19.25"/>
-<text text-anchor="middle" x="322" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge11_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge11_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.53,-140.93C106.7,-114.47 186.06,-60.74 260,-28.62 264.29,-26.76 268.83,-25 273.41,-23.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="274.31,-26.74 282.65,-20.21 272.06,-20.11 274.31,-26.74"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189,-142.09C203.28,-161.1 229.98,-193.11 260,-211.62 262.61,-213.23 265.37,-214.72 268.21,-216.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.79,-219.29 277.37,-219.94 269.51,-212.83 266.79,-219.29"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.03,-142.23C227.53,-148.63 244.54,-156.07 260,-162.62 263.81,-164.24 267.75,-165.9 271.72,-167.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="270.24,-170.73 280.82,-171.32 272.92,-164.26 270.24,-170.73"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge6_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge6_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.96,-142.36C149.26,-151.43 156.94,-159.88 177,-159.88 187.97,-159.88 195.24,-157.35 198.8,-153.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.25,-154.19 199.87,-143.87 195.3,-153.42 202.25,-154.19"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373.12,-153.88 270.88,-153.88 270.88,-123.38 373.12,-123.38 373.12,-153.88"/>
-<text text-anchor="start" x="278.88" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="322" y="-129.12" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge7_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge7_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.43,-130.52C235.68,-131.46 247.87,-132.49 259.69,-133.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="259.09,-136.94 269.35,-134.29 259.68,-129.97 259.09,-136.94"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="362.25,-105.25 281.75,-105.25 281.75,-86 362.25,-86 362.25,-105.25"/>
-<text text-anchor="middle" x="322" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge8_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge8_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.43,-116.56C239.12,-113.38 255.42,-109.84 270.38,-106.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="271.01,-110.04 280.04,-104.5 269.52,-103.2 271.01,-110.04"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge9_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge9_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.05,-110.98C200.33,-89.35 227.14,-50.53 260,-28.62 262.91,-26.69 266.02,-24.94 269.25,-23.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="270.58,-26.6 278.42,-19.48 267.85,-20.15 270.58,-26.6"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373.12,-67.88 270.88,-67.88 270.88,-37.38 373.12,-37.38 373.12,-67.88"/>
-<text text-anchor="start" x="278.88" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="322" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge10_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge10_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.07,-111.08C217.18,-100.59 239.39,-86.87 260,-76.62 262.54,-75.36 265.17,-74.12 267.84,-72.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.1,-76.16 276.87,-68.96 266.3,-69.75 269.1,-76.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/dfe/horspool_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/dfe/horspool_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 2fa4ef524..000000000
--- a/d3/dfe/horspool_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main Function that calls test function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function with test cases for Horspool&#39;s algorithm." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d3/dfe/horspool_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/dfe/horspool_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index e1386dd37..000000000
--- a/d3/dfe/horspool_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2508224853163cbec7747e791d8857c1
\ No newline at end of file
diff --git a/d3/dfe/horspool_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/dfe/horspool_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 2528d4a63..000000000
--- a/d3/dfe/horspool_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main Function that calls test function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function with test cases for Horspool&#39;s algorithm.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/dfe/horspool_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/dfe/horspool_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 04fc1027d..000000000
--- a/d3/dfe/horspool_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main Function that calls test function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function with test cases for Horspool&#39;s algorithm.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/dfe/horspool_8cpp_source.html b/d3/dfe/horspool_8cpp_source.html
new file mode 100644
index 000000000..5d12505c3
--- /dev/null
+++ b/d3/dfe/horspool_8cpp_source.html
@@ -0,0 +1,239 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: strings/horspool.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/dfe/horspool_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">horspool.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/dfe/horspool_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;unordered_map&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/dcb/namespacestrings.html">strings</a> {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d02/namespacehorspool.html">horspool</a> {</div>
+<div class="foldopen" id="foldopen00026" data-start="{" data-end="}">
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"><a class="line" href="../../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336">   26</a></span>std::unordered_map&lt;char, int&gt; <a class="code hl_function" href="../../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336">findShiftTable</a>(<span class="keyword">const</span> std::string &amp;prototype) {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    std::unordered_map&lt;char, int&gt;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        shiftTable;  <span class="comment">// A HashMap for shift table that has characters for keys and integers for values</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; prototype.size();</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>         i++) {  <span class="comment">// Checking all characters of prototype string</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        <span class="keywordflow">if</span> (shiftTable.find(prototype[i]) ==</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>            shiftTable.end()) {  <span class="comment">// If character does not exist in HashMap</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>            <span class="keywordflow">if</span> (i != prototype.size() - 1) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>                shiftTable.insert(std::make_pair(</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>                    prototype[i], prototype.size() - i -</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>                                      1));  <span class="comment">// Insert the character as key and the size of prototype string - index of character - 1 as value</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>                shiftTable.insert(std::make_pair(</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>                    prototype[i],</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>                    prototype.size()));  <span class="comment">// Insert the character as key and the size of prototype string as value</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>            }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>            <span class="keywordflow">if</span> (i != prototype.size() - 1) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>                shiftTable[prototype[i]] = prototype.size() - i - 1;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            }</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">return</span> shiftTable;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>}</div>
+</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="foldopen" id="foldopen00059" data-start="{" data-end="}">
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d3/dfe/horspool_8cpp.html#a9884bca75ce39c116697ea2574adb37d">   59</a></span><span class="keywordtype">bool</span> <a class="code hl_namespace" href="../../d5/d02/namespacehorspool.html">horspool</a>(<span class="keyword">const</span> std::string &amp;text, <span class="keyword">const</span> std::string &amp;prototype) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    std::unordered_map&lt;char, int&gt; shiftTable = <a class="code hl_function" href="../../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336">findShiftTable</a>(</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        prototype);  <span class="comment">// Initialise shift table calling findShiftTable function</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordtype">int</span> i = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        prototype.size() -</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        1);  <span class="comment">// Index that we shift in text to find the substring</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">while</span> (i &lt; text.size()) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <span class="keywordtype">int</span> j = i, k = 0;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        <span class="keywordtype">bool</span> flag = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> z = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(prototype.size() - 1); z &gt;= 0 &amp;&amp; flag;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>             z--) {  <span class="comment">// Checking if all characters of substring are equal with all characters of string</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            <span class="keywordflow">if</span> (text[j] == prototype[z]) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>                k++;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>                j--;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>                flag = <span class="keyword">false</span>;  <span class="comment">// If two characters are not equal set flag to false and break from loop</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        }</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="keywordflow">if</span> (k ==</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>            prototype.size()) {  <span class="comment">// If all characters match then return true</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            <span class="keywordflow">if</span> (shiftTable.find(text[i]) != shiftTable.end()) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>                i += shiftTable[text[i]];  <span class="comment">// If shift table contains the character then shift index as many steps as value</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>                i += prototype.size();  <span class="comment">// If character does not exist in shift table then shift index as many steps as size of prototype string</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>            }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>}</div>
+</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>} <span class="comment">// namespace horspool</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>} <span class="comment">// namespace strings</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="foldopen" id="foldopen00100" data-start="{" data-end="}">
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"><a class="line" href="../../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  100</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(){</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello World&quot;</span>,<span class="stringliteral">&quot;World&quot;</span>) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello World&quot;</span>,<span class="stringliteral">&quot; World&quot;</span>) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello World&quot;</span>,<span class="stringliteral">&quot;ello&quot;</span>) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello World&quot;</span>,<span class="stringliteral">&quot;rld&quot;</span>) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello&quot;</span>,<span class="stringliteral">&quot;Helo&quot;</span>) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    assert(strings::horspool::horspool(<span class="stringliteral">&quot;c++_algorithms&quot;</span>,<span class="stringliteral">&quot;c++_algorithms&quot;</span>) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    assert(strings::horspool::horspool(<span class="stringliteral">&quot;c++_algorithms&quot;</span>,<span class="stringliteral">&quot;c++_&quot;</span>) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    assert(strings::horspool::horspool(<span class="stringliteral">&quot;Hello&quot;</span>,<span class="stringliteral">&quot;Hello World&quot;</span>) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    assert(strings::horspool::horspool(<span class="stringliteral">&quot;c++_algorithms&quot;</span>,<span class="stringliteral">&quot;&quot;</span>) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    assert(strings::horspool::horspool(<span class="stringliteral">&quot;c++&quot;</span>,<span class="stringliteral">&quot;c&quot;</span>) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    assert(strings::horspool::horspool(<span class="stringliteral">&quot;3458934793&quot;</span>,<span class="stringliteral">&quot;4793&quot;</span>) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    assert(strings::horspool::horspool(<span class="stringliteral">&quot;3458934793&quot;</span>,<span class="stringliteral">&quot;123&quot;</span>) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>}</div>
+</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="foldopen" id="foldopen00119" data-start="{" data-end="}">
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"><a class="line" href="../../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  119</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(){</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <a class="code hl_function" href="../../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>}</div>
+</div>
+<div class="ttc" id="ahorspool_8cpp_html_a1a9c3aa55ccc79d0f47d50c580997336"><div class="ttname"><a href="../../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336">strings::horspool::findShiftTable</a></div><div class="ttdeci">std::unordered_map&lt; char, int &gt; findShiftTable(const std::string &amp;prototype)</div><div class="ttdef"><b>Definition</b> <a href="#l00026">horspool.cpp:26</a></div></div>
+<div class="ttc" id="ahorspool_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function with test cases for Horspool's algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00100">horspool.cpp:100</a></div></div>
+<div class="ttc" id="ahorspool_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main Function that calls test function.</div><div class="ttdef"><b>Definition</b> <a href="#l00119">horspool.cpp:119</a></div></div>
+<div class="ttc" id="anamespacehorspool_html"><div class="ttname"><a href="../../d5/d02/namespacehorspool.html">horspool</a></div><div class="ttdoc">Functions for Horspool's algorithm.</div></div>
+<div class="ttc" id="anamespacestrings_html"><div class="ttname"><a href="../../df/dcb/namespacestrings.html">strings</a></div><div class="ttdoc">String algorithms.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db2/boyer__moore_8cpp_source.html#l00058">boyer_moore.cpp:58</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_73a3cc5065b223eb41b02873c0e19f0e.html">strings</a></li><li class="navelem"><a class="el" href="../../d3/dfe/horspool_8cpp.html">horspool.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d3/dfe/perimeter_8cpp.html b/d3/dfe/perimeter_8cpp.html
index 2dc306b05..d180bc5d3 100644
--- a/d3/dfe/perimeter_8cpp.html
+++ b/d3/dfe/perimeter_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/perimeter.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/perimeter.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for perimeter.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d7b/perimeter_8cpp__incl.svg" width="336" height="111"><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">
+</div>
+<p><a href="../../d3/dfe/perimeter_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -175,7 +194,26 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Implementations for the <a href="https://en.wikipedia.org/wiki/Perimeter" target="_blank">perimeter</a> of various shapes. </p>
 <p>The of a shape is the amount of 2D space it takes up. All shapes have a formula for their perimeter. These implementations support multiple return types.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/OGscorpion" target="_blank">OGscorpion</a> </dd></dl>
-</div><h2 class="groupheader">Function Documentation</h2>
+
+<p class="definition">Definition in file <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html">perimeter.cpp</a>.</p>
+</div><h2 class="groupheader">Macro Definition Documentation</h2>
+<a id="a525335710b53cb064ca56b936120431e" name="a525335710b53cb064ca56b936120431e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a525335710b53cb064ca56b936120431e">&#9670;&#160;</a></span>_USE_MATH_DEFINES</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">#define _USE_MATH_DEFINES</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html#l00011">11</a> of file <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html">perimeter.cpp</a>.</p>
+
+</div>
+</div>
+<h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
 
@@ -193,17 +231,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html#l00284">284</a> of file <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html">perimeter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  284</span>           {</div>
 <div class="line"><span class="lineno">  285</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  286</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  287</span>}</div>
-<div class="ttc" id="aperimeter_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> perimeter.cpp:120</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="592" height="495"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aperimeter_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dfe/perimeter_8cpp_source.html#l00120">perimeter.cpp:120</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -231,6 +266,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html#l00120">120</a> of file <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html">perimeter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  120</span>                   {</div>
 <div class="line"><span class="lineno">  121</span>    <span class="comment">// I/O variables for testing</span></div>
 <div class="line"><span class="lineno">  122</span>    uint16_t int_length = 0;      <span class="comment">// 16 bit integer length input</span></div>
@@ -258,24 +295,24 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  144</span>    int_expected = 20;</div>
 <div class="line"><span class="lineno">  145</span>    int_perimeter = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14">math::square_perimeter</a>(int_length);</div>
 <div class="line"><span class="lineno">  146</span> </div>
-<div class="line"><span class="lineno">  147</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;perimeter OF A SQUARE (int)&quot;</span> &lt;&lt; <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">  148</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; <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">  149</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; <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">  150</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_perimeter &lt;&lt; <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">  147</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;perimeter OF A SQUARE (int)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  148</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  149</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  150</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_perimeter &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  151</span>    assert(int_perimeter == int_expected);</div>
-<div class="line"><span class="lineno">  152</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  152</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  153</span> </div>
 <div class="line"><span class="lineno">  154</span>    <span class="comment">// 2nd test</span></div>
 <div class="line"><span class="lineno">  155</span>    float_length = 2.5;</div>
 <div class="line"><span class="lineno">  156</span>    float_expected = 10;</div>
 <div class="line"><span class="lineno">  157</span>    float_perimeter = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14">math::square_perimeter</a>(float_length);</div>
 <div class="line"><span class="lineno">  158</span> </div>
-<div class="line"><span class="lineno">  159</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;perimeter OF A SQUARE (float)&quot;</span> &lt;&lt; <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">  160</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; float_length &lt;&lt; <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">  161</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; float_expected &lt;&lt; <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">  162</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; float_perimeter &lt;&lt; <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">  159</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;perimeter OF A SQUARE (float)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  160</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; float_length &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  161</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; float_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  162</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; float_perimeter &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  163</span>    assert(float_perimeter == float_expected);</div>
-<div class="line"><span class="lineno">  164</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  164</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  165</span> </div>
 <div class="line"><span class="lineno">  166</span>    <span class="comment">// 3rd test</span></div>
 <div class="line"><span class="lineno">  167</span>    int_length = 4;</div>
@@ -283,13 +320,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  169</span>    int_expected = 22;</div>
 <div class="line"><span class="lineno">  170</span>    int_perimeter = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6">math::rect_perimeter</a>(int_length, int_width);</div>
 <div class="line"><span class="lineno">  171</span> </div>
-<div class="line"><span class="lineno">  172</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;perimeter OF A RECTANGLE (int)&quot;</span> &lt;&lt; <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">  173</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; <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">  174</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Width: &quot;</span> &lt;&lt; int_width &lt;&lt; <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">  175</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; <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">  176</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_perimeter &lt;&lt; <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">  172</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;perimeter OF A RECTANGLE (int)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  173</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  174</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Width: &quot;</span> &lt;&lt; int_width &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  175</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  176</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_perimeter &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  177</span>    assert(int_perimeter == int_expected);</div>
-<div class="line"><span class="lineno">  178</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  178</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  179</span> </div>
 <div class="line"><span class="lineno">  180</span>    <span class="comment">// 4th test</span></div>
 <div class="line"><span class="lineno">  181</span>    double_length = 2.5;</div>
@@ -297,13 +334,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  183</span>    double_expected = 16.4;</div>
 <div class="line"><span class="lineno">  184</span>    double_perimeter = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6">math::rect_perimeter</a>(double_length, double_width);</div>
 <div class="line"><span class="lineno">  185</span> </div>
-<div class="line"><span class="lineno">  186</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;perimeter OF A RECTANGLE (double)&quot;</span> &lt;&lt; <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">  187</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; double_length &lt;&lt; <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">  188</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Width: &quot;</span> &lt;&lt; double_width &lt;&lt; <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">  189</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; <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">  190</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_perimeter &lt;&lt; <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">  186</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;perimeter OF A RECTANGLE (double)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  187</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; double_length &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  188</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Width: &quot;</span> &lt;&lt; double_width &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  189</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  190</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_perimeter &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  191</span>    assert(double_perimeter == double_expected);</div>
-<div class="line"><span class="lineno">  192</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  192</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  193</span> </div>
 <div class="line"><span class="lineno">  194</span>    <span class="comment">// 5th test</span></div>
 <div class="line"><span class="lineno">  195</span>    int_base = 10;</div>
@@ -313,13 +350,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  199</span>    int_perimeter =</div>
 <div class="line"><span class="lineno">  200</span>        <a class="code hl_function" href="../../dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3">math::triangle_perimeter</a>(int_base, int_height, int_hypotenuse);</div>
 <div class="line"><span class="lineno">  201</span> </div>
-<div class="line"><span class="lineno">  202</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;perimeter OF A TRIANGLE&quot;</span> &lt;&lt; <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">  203</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Base: &quot;</span> &lt;&lt; int_base &lt;&lt; <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">  204</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; <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">  205</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; <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">  206</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_perimeter &lt;&lt; <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>    std::cout &lt;&lt; <span class="stringliteral">&quot;perimeter OF A TRIANGLE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  203</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Base: &quot;</span> &lt;&lt; int_base &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  204</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  205</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  206</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_perimeter &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  207</span>    assert(int_perimeter == int_expected);</div>
-<div class="line"><span class="lineno">  208</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  209</span> </div>
 <div class="line"><span class="lineno">  210</span>    <span class="comment">// 6th test</span></div>
 <div class="line"><span class="lineno">  211</span>    double_radius = 6;</div>
@@ -328,12 +365,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  214</span>                            <span class="comment">// truncates after 14 decimal places</span></div>
 <div class="line"><span class="lineno">  215</span>    double_perimeter = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953">math::circle_perimeter</a>(double_radius);</div>
 <div class="line"><span class="lineno">  216</span> </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> &lt;&lt; <span class="stringliteral">&quot;perimeter OF A CIRCLE&quot;</span> &lt;&lt; <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>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; <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">  219</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; <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">  220</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_perimeter &lt;&lt; <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">  217</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;perimeter OF A CIRCLE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  218</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  219</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  220</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_perimeter &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  221</span>    assert(double_perimeter == double_expected);</div>
-<div class="line"><span class="lineno">  222</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  222</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  223</span> </div>
 <div class="line"><span class="lineno">  224</span>    <span class="comment">// 7th test</span></div>
 <div class="line"><span class="lineno">  225</span>    int_base = 6;</div>
@@ -341,25 +378,25 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  227</span>    int_expected = 26;</div>
 <div class="line"><span class="lineno">  228</span>    int_perimeter = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3">math::parallelogram_perimeter</a>(int_base, int_height);</div>
 <div class="line"><span class="lineno">  229</span> </div>
-<div class="line"><span class="lineno">  230</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;perimeter OF A PARALLELOGRAM&quot;</span> &lt;&lt; <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">  231</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Base: &quot;</span> &lt;&lt; int_base &lt;&lt; <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">  232</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; <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">  233</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; <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">  234</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_perimeter &lt;&lt; <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">  230</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;perimeter OF A PARALLELOGRAM&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  231</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Base: &quot;</span> &lt;&lt; int_base &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  232</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  233</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  234</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_perimeter &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  235</span>    assert(int_perimeter == int_expected);</div>
-<div class="line"><span class="lineno">  236</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  236</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  237</span> </div>
 <div class="line"><span class="lineno">  238</span>    <span class="comment">// 8th test</span></div>
 <div class="line"><span class="lineno">  239</span>    double_length = 5.5;</div>
 <div class="line"><span class="lineno">  240</span>    double_expected = 66.0;</div>
 <div class="line"><span class="lineno">  241</span>    double_perimeter = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b">math::cube_surface_perimeter</a>(double_length);</div>
 <div class="line"><span class="lineno">  242</span> </div>
-<div class="line"><span class="lineno">  243</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;SURFACE perimeter OF A CUBE&quot;</span> &lt;&lt; <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">  244</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; double_length &lt;&lt; <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">  245</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; <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">  246</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_perimeter &lt;&lt; <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">  243</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;SURFACE perimeter OF A CUBE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  244</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; double_length &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  245</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  246</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_perimeter &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  247</span>    assert(double_perimeter == double_expected);</div>
-<div class="line"><span class="lineno">  248</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  248</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  249</span> </div>
 <div class="line"><span class="lineno">  250</span>    <span class="comment">// 9th test</span></div>
 <div class="line"><span class="lineno">  251</span>    int_sides = 7;</div>
@@ -367,13 +404,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  253</span>    int_expected = 70;</div>
 <div class="line"><span class="lineno">  254</span>    int_perimeter = <a class="code hl_function" href="../../dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f">math::n_polygon_surface_perimeter</a>(int_sides, int_length);</div>
 <div class="line"><span class="lineno">  255</span> </div>
-<div class="line"><span class="lineno">  256</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;SURFACE perimeter OF A N-POLYGON&quot;</span> &lt;&lt; <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">  257</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Sides: &quot;</span> &lt;&lt; int_sides &lt;&lt; <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">  258</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; <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">  259</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; <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">  260</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_perimeter &lt;&lt; <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">  256</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;SURFACE perimeter OF A N-POLYGON&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  257</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Sides: &quot;</span> &lt;&lt; int_sides &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  258</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  259</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  260</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_perimeter &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  261</span>    assert(int_perimeter == int_expected);</div>
-<div class="line"><span class="lineno">  262</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  262</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  263</span> </div>
 <div class="line"><span class="lineno">  264</span>    <span class="comment">// 10th test</span></div>
 <div class="line"><span class="lineno">  265</span>    double_radius = 4.0;</div>
@@ -382,30 +419,23 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  268</span>    double_perimeter =</div>
 <div class="line"><span class="lineno">  269</span>        <a class="code hl_function" href="../../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73">math::cylinder_surface_perimeter</a>(double_radius, double_height);</div>
 <div class="line"><span class="lineno">  270</span> </div>
-<div class="line"><span class="lineno">  271</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;SURFACE perimeter OF A CYLINDER&quot;</span> &lt;&lt; <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">  272</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; <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">  273</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; double_height &lt;&lt; <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">  274</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; <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">  275</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_perimeter &lt;&lt; <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">  271</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;SURFACE perimeter OF A CYLINDER&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  272</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  273</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; double_height &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  274</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  275</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_perimeter &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  276</span>    assert(double_perimeter == double_expected);</div>
-<div class="line"><span class="lineno">  277</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  277</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  278</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="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="anamespacemath_html_a0efb235330ff48e14fd31faaccbcebb3"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3">math::parallelogram_perimeter</a></div><div class="ttdeci">T parallelogram_perimeter(T base, T height)</div><div class="ttdoc">perimeter of a parallelogram 2(b + h)</div><div class="ttdef"><b>Definition</b> perimeter.cpp:75</div></div>
-<div class="ttc" id="anamespacemath_html_a1d4df7a4e43a2eac1acc0ac610487c73"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73">math::cylinder_surface_perimeter</a></div><div class="ttdeci">T cylinder_surface_perimeter(T radius, T height)</div><div class="ttdoc">surface perimeter of a cylinder (2 * radius + 2 * height)</div><div class="ttdef"><b>Definition</b> perimeter.cpp:111</div></div>
-<div class="ttc" id="anamespacemath_html_a3d1e4db743b189f309327572663415f3"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3">math::triangle_perimeter</a></div><div class="ttdeci">T triangle_perimeter(T base, T height, T hypotenuse)</div><div class="ttdoc">perimeter of a triangle (a + b + c)</div><div class="ttdef"><b>Definition</b> perimeter.cpp:52</div></div>
-<div class="ttc" id="anamespacemath_html_a428769a16e9525e56588d7c7709d25a6"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6">math::rect_perimeter</a></div><div class="ttdeci">T rect_perimeter(T length, T width)</div><div class="ttdoc">perimeter of a rectangle ( 2(l + w) )</div><div class="ttdef"><b>Definition</b> perimeter.cpp:40</div></div>
-<div class="ttc" id="anamespacemath_html_a8998ca7b1886d1d7d00aef3b457a9b1b"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b">math::cube_surface_perimeter</a></div><div class="ttdeci">T cube_surface_perimeter(T length)</div><div class="ttdoc">surface perimeter of a cube ( 12</div><div class="ttdef"><b>Definition</b> perimeter.cpp:86</div></div>
-<div class="ttc" id="anamespacemath_html_a9236348755183644f1225e162d01ab14"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14">math::square_perimeter</a></div><div class="ttdeci">T square_perimeter(T length)</div><div class="ttdoc">perimeter of a square (4 * l)</div><div class="ttdef"><b>Definition</b> perimeter.cpp:28</div></div>
-<div class="ttc" id="anamespacemath_html_aa8592c3279c41a2c6d4d64eeb488f63f"><div class="ttname"><a href="../../dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f">math::n_polygon_surface_perimeter</a></div><div class="ttdeci">T n_polygon_surface_perimeter(T sides, T length)</div><div class="ttdoc">surface perimeter of a n-polygon ( n * l)</div><div class="ttdef"><b>Definition</b> perimeter.cpp:99</div></div>
-<div class="ttc" id="anamespacemath_html_ad0acf82b7bc920182bf8322d1e103953"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953">math::circle_perimeter</a></div><div class="ttdeci">T circle_perimeter(T radius)</div><div class="ttdoc">perimeter of a circle (2 * pi * r)</div><div class="ttdef"><b>Definition</b> perimeter.cpp:63</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="495" height="495"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemath_html_a0efb235330ff48e14fd31faaccbcebb3"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3">math::parallelogram_perimeter</a></div><div class="ttdeci">T parallelogram_perimeter(T base, T height)</div><div class="ttdoc">perimeter of a parallelogram 2(b + h)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dfe/perimeter_8cpp_source.html#l00075">perimeter.cpp:75</a></div></div>
+<div class="ttc" id="anamespacemath_html_a1d4df7a4e43a2eac1acc0ac610487c73"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73">math::cylinder_surface_perimeter</a></div><div class="ttdeci">T cylinder_surface_perimeter(T radius, T height)</div><div class="ttdoc">surface perimeter of a cylinder (2 * radius + 2 * height)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dfe/perimeter_8cpp_source.html#l00111">perimeter.cpp:111</a></div></div>
+<div class="ttc" id="anamespacemath_html_a3d1e4db743b189f309327572663415f3"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3">math::triangle_perimeter</a></div><div class="ttdeci">T triangle_perimeter(T base, T height, T hypotenuse)</div><div class="ttdoc">perimeter of a triangle (a + b + c)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dfe/perimeter_8cpp_source.html#l00052">perimeter.cpp:52</a></div></div>
+<div class="ttc" id="anamespacemath_html_a428769a16e9525e56588d7c7709d25a6"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6">math::rect_perimeter</a></div><div class="ttdeci">T rect_perimeter(T length, T width)</div><div class="ttdoc">perimeter of a rectangle ( 2(l + w) )</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dfe/perimeter_8cpp_source.html#l00040">perimeter.cpp:40</a></div></div>
+<div class="ttc" id="anamespacemath_html_a8998ca7b1886d1d7d00aef3b457a9b1b"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b">math::cube_surface_perimeter</a></div><div class="ttdeci">T cube_surface_perimeter(T length)</div><div class="ttdoc">surface perimeter of a cube ( 12</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dfe/perimeter_8cpp_source.html#l00086">perimeter.cpp:86</a></div></div>
+<div class="ttc" id="anamespacemath_html_a9236348755183644f1225e162d01ab14"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14">math::square_perimeter</a></div><div class="ttdeci">T square_perimeter(T length)</div><div class="ttdoc">perimeter of a square (4 * l)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dfe/perimeter_8cpp_source.html#l00028">perimeter.cpp:28</a></div></div>
+<div class="ttc" id="anamespacemath_html_aa8592c3279c41a2c6d4d64eeb488f63f"><div class="ttname"><a href="../../dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f">math::n_polygon_surface_perimeter</a></div><div class="ttdeci">T n_polygon_surface_perimeter(T sides, T length)</div><div class="ttdoc">surface perimeter of a n-polygon ( n * l)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dfe/perimeter_8cpp_source.html#l00099">perimeter.cpp:99</a></div></div>
+<div class="ttc" id="anamespacemath_html_ad0acf82b7bc920182bf8322d1e103953"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953">math::circle_perimeter</a></div><div class="ttdeci">T circle_perimeter(T radius)</div><div class="ttdoc">perimeter of a circle (2 * pi * r)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dfe/perimeter_8cpp_source.html#l00063">perimeter.cpp:63</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 80bc2dcfd..000000000
--- a/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,28 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,243,49,268"/>
-<area shape="rect" id="Node000002" href="$dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953" title="perimeter of a circle (2 * pi * r)" alt="" coords="105,5,256,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="26,242,29,203,39,150,60,92,75,65,95,42,99,38,103,42,99,45,79,68,64,94,44,151,34,204,31,243"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b" title="surface perimeter of a cube ( 12" alt="" coords="112,55,248,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="29,241,49,178,68,140,95,107,99,103,103,107,99,111,73,143,54,180,34,243"/>
-<area shape="rect" id="Node000004" href="$dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73" title="surface perimeter of a cylinder (2 * radius + 2 * height)" alt="" coords="104,120,257,161"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="34,241,58,207,95,171,101,167,104,171,98,175,63,210,38,244"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="145,185,216,211"/>
-<area shape="poly" id="edge7_Node000001_Node000007" title=" " alt="" coords="48,242,96,221,129,210,131,215,98,226,50,247"/>
-<area shape="rect" id="Node000008" href="$dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f" title="surface perimeter of a n&#45;polygon ( n * l)" alt="" coords="97,235,264,276"/>
-<area shape="poly" id="edge8_Node000001_Node000008" title=" " alt="" coords="49,253,81,253,81,258,49,258"/>
-<area shape="rect" id="Node000009" href="$dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3" title="perimeter of a parallelogram 2(b + h)" alt="" coords="113,300,248,341"/>
-<area shape="poly" id="edge9_Node000001_Node000009" title=" " alt="" coords="50,263,98,285,113,292,111,297,96,290,48,268"/>
-<area shape="rect" id="Node000010" href="$dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6" title="perimeter of a rectangle ( 2(l + w) )" alt="" coords="110,365,251,391"/>
-<area shape="poly" id="edge11_Node000001_Node000010" title=" " alt="" coords="37,268,60,309,77,331,98,351,107,356,104,361,95,355,73,335,55,312,32,270"/>
-<area shape="rect" id="Node000011" href="$dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14" title="perimeter of a square (4 * l)" alt="" coords="101,415,260,440"/>
-<area shape="poly" id="edge12_Node000001_Node000011" title=" " alt="" coords="33,268,40,296,52,332,71,370,99,402,102,404,99,409,95,405,67,372,47,334,35,298,28,269"/>
-<area shape="rect" id="Node000012" href="$dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3" title="perimeter of a triangle (a + b + c)" alt="" coords="100,464,261,490"/>
-<area shape="poly" id="edge13_Node000001_Node000012" title=" " alt="" coords="32,268,35,305,46,354,66,406,80,430,99,451,101,453,97,457,95,455,76,433,61,408,41,355,30,306,26,269"/>
-<area shape="rect" id="Node000005" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="312,308,368,334"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="250,160,266,171,290,199,310,232,334,292,329,294,305,234,286,202,262,175,247,164"/>
-<area shape="poly" id="edge5_Node000005_Node000005" title=" " alt="" coords="320,309,317,299,319,290,327,284,340,281,354,284,362,291,358,295,352,289,340,287,329,289,323,293,322,299,325,307"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="416,308,489,334"/>
-<area shape="poly" id="edge6_Node000005_Node000006" title=" " alt="" coords="369,318,400,318,400,324,369,324"/>
-<area shape="poly" id="edge10_Node000009_Node000005" title=" " alt="" coords="248,318,297,318,297,324,248,324"/>
-<area shape="poly" id="edge14_Node000012_Node000005" title=" " alt="" coords="245,461,262,451,285,428,304,401,328,348,333,350,308,403,289,431,266,455,248,466"/>
-</map>
diff --git a/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 710a03341..000000000
--- a/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ddd20aa21b8dc9e832543d0775aa4e62
\ No newline at end of file
diff --git a/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index dc8e41d5b..000000000
--- a/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,276 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="371pt" height="371pt"
- viewBox="0.00 0.00 370.50 371.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 367.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-185.25 0,-185.25 0,-166 32.5,-166 32.5,-185.25"/>
-<text text-anchor="middle" x="16.25" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953" target="_top" xlink:title="perimeter of a circle (2 * pi * r)">
-<polygon fill="white" stroke="#666666" points="187.62,-363.25 74.88,-363.25 74.88,-344 187.62,-344 187.62,-363.25"/>
-<text text-anchor="middle" x="131.25" y="-349.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::circle_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M17.44,-185.43C18.5,-213.02 25.35,-292.05 68.5,-334.62 69.53,-335.64 70.62,-336.61 71.75,-337.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.6,-340.3 79.9,-342.74 73.37,-334.4 69.6,-340.3"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b" target="_top" xlink:title="surface perimeter of a cube ( 12">
-<polygon fill="white" stroke="#666666" points="182.38,-325.88 80.12,-325.88 80.12,-295.38 182.38,-295.38 182.38,-325.88"/>
-<text text-anchor="start" x="88.12" y="-312.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::cube_surface</text>
-<text text-anchor="middle" x="131.25" y="-301.12" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M19.29,-185.58C24.14,-206.8 38.26,-256.89 68.5,-285.62 69.56,-286.63 70.67,-287.6 71.81,-288.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.76,-291.37 79.99,-294.12 73.71,-285.59 69.76,-291.37"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73" target="_top" xlink:title="surface perimeter of a cylinder (2 * radius + 2 * height)">
-<polygon fill="white" stroke="#666666" points="188.75,-276.88 73.75,-276.88 73.75,-246.38 188.75,-246.38 188.75,-276.88"/>
-<text text-anchor="start" x="81.75" y="-263.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::cylinder_surface</text>
-<text text-anchor="middle" x="131.25" y="-252.12" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.01,-185.33C31.44,-198.78 48.35,-223.07 68.5,-237.62 69.84,-238.59 71.23,-239.53 72.64,-240.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.67,-243.34 81.1,-245.18 74.1,-237.23 70.67,-243.34"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158,-228.25 104.5,-228.25 104.5,-209 158,-209 158,-228.25"/>
-<text text-anchor="middle" x="131.25" y="-214.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.71,-183.55C42.75,-188.53 56.22,-194.89 68.5,-199.62 76.41,-202.68 85.04,-205.59 93.27,-208.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.1,-211.47 102.69,-211.03 94.14,-204.77 92.1,-211.47"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f" target="_top" xlink:title="surface perimeter of a n&#45;polygon ( n * l)">
-<polygon fill="white" stroke="#666666" points="194,-190.88 68.5,-190.88 68.5,-160.38 194,-160.38 194,-190.88"/>
-<text text-anchor="start" x="76.5" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::n_polygon_surface</text>
-<text text-anchor="middle" x="131.25" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge8_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-175.62C39.57,-175.62 47.77,-175.62 56.59,-175.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.51,-179.13 66.51,-175.63 56.51,-172.13 56.51,-179.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3" target="_top" xlink:title="perimeter of a parallelogram 2(b + h)">
-<polygon fill="white" stroke="#666666" points="182,-141.88 80.5,-141.88 80.5,-111.38 182,-111.38 182,-141.88"/>
-<text text-anchor="start" x="88.5" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::parallelogram</text>
-<text text-anchor="middle" x="131.25" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.85,-168.05C42.96,-163.22 56.43,-156.89 68.5,-151.62 72.27,-149.98 76.19,-148.31 80.14,-146.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.29,-149.96 89.19,-142.9 78.61,-143.49 81.29,-149.96"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6" target="_top" xlink:title="perimeter of a rectangle ( 2(l + w) )">
-<polygon fill="white" stroke="#666666" points="184.25,-93.25 78.25,-93.25 78.25,-74 184.25,-74 184.25,-93.25"/>
-<text text-anchor="middle" x="131.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::rect_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge11_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.66,-165.53C29.06,-149.76 45.45,-119.38 68.5,-102.62 70.53,-101.15 72.67,-99.79 74.9,-98.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.19,-101.8 83.69,-94.32 73.16,-95.48 76.19,-101.8"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14" target="_top" xlink:title="perimeter of a square (4 * l)">
-<polygon fill="white" stroke="#666666" points="190.62,-56.25 71.88,-56.25 71.88,-37 190.62,-37 190.62,-56.25"/>
-<text text-anchor="middle" x="131.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::square_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge12_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge12_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M18.98,-165.67C23.28,-143.97 36.49,-92.19 68.5,-64.62 69.43,-63.82 70.4,-63.06 71.39,-62.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.89,-65.5 79.7,-57.39 69.32,-59.49 72.89,-65.5"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3" target="_top" xlink:title="perimeter of a triangle (a + b + c)">
-<polygon fill="white" stroke="#666666" points="191.75,-19.25 70.75,-19.25 70.75,0 191.75,0 191.75,-19.25"/>
-<text text-anchor="middle" x="131.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::triangle_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge13_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge13_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M17.68,-165.7C19.38,-139.24 27.72,-66.42 68.5,-27.62 69.12,-27.03 69.76,-26.46 70.42,-25.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.1,-28.99 78.5,-20.55 68.23,-23.16 72.1,-28.99"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272.25,-136.25 230,-136.25 230,-117 272.25,-117 272.25,-136.25"/>
-<text text-anchor="middle" x="251.12" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.36,-245.98C186.55,-243.56 190.51,-240.79 194,-237.62 221.09,-213.05 236.9,-172.4 244.5,-147.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="247.85,-148.75 247.25,-138.17 241.12,-146.81 247.85,-148.75"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.94,-136.54C231.92,-145.15 236.32,-154.25 251.12,-154.25 259.22,-154.25 264.21,-151.53 266.08,-147.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.58,-147.36 264.55,-138.03 262.66,-148.46 269.58,-147.36"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="362.5,-136.25 308.25,-136.25 308.25,-117 362.5,-117 362.5,-136.25"/>
-<text text-anchor="middle" x="335.38" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M272.46,-126.62C279.7,-126.62 288.11,-126.62 296.35,-126.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="296.24,-130.13 306.24,-126.63 296.24,-123.13 296.24,-130.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge10_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge10_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.24,-126.62C194.5,-126.62 207.28,-126.62 218.41,-126.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.22,-130.13 228.22,-126.63 218.22,-123.13 218.22,-130.13"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node5 -->
-<g id="edge14_Node000012_Node000005" class="edge">
-<title>Node12&#45;&gt;Node5</title>
-<g id="a_edge14_Node000012_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.6,-19.66C185.4,-21.81 189.97,-24.44 194,-27.62 219.61,-47.89 235.55,-83.26 243.63,-105.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="240.25,-106.71 246.75,-115.08 246.88,-104.48 240.25,-106.71"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 6da4292d1..000000000
--- a/d3/dfe/perimeter_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,250 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="371pt" height="371pt"
- viewBox="0.00 0.00 370.50 371.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 367.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-185.25 0,-185.25 0,-166 32.5,-166 32.5,-185.25"/>
-<text text-anchor="middle" x="16.25" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953" target="_top" xlink:title="perimeter of a circle (2 * pi * r)">
-<polygon fill="white" stroke="#666666" points="187.62,-363.25 74.88,-363.25 74.88,-344 187.62,-344 187.62,-363.25"/>
-<text text-anchor="middle" x="131.25" y="-349.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::circle_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M17.44,-185.43C18.5,-213.02 25.35,-292.05 68.5,-334.62 69.53,-335.64 70.62,-336.61 71.75,-337.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.6,-340.3 79.9,-342.74 73.37,-334.4 69.6,-340.3"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b" target="_top" xlink:title="surface perimeter of a cube ( 12">
-<polygon fill="white" stroke="#666666" points="182.38,-325.88 80.12,-325.88 80.12,-295.38 182.38,-295.38 182.38,-325.88"/>
-<text text-anchor="start" x="88.12" y="-312.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::cube_surface</text>
-<text text-anchor="middle" x="131.25" y="-301.12" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M19.29,-185.58C24.14,-206.8 38.26,-256.89 68.5,-285.62 69.56,-286.63 70.67,-287.6 71.81,-288.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.76,-291.37 79.99,-294.12 73.71,-285.59 69.76,-291.37"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73" target="_top" xlink:title="surface perimeter of a cylinder (2 * radius + 2 * height)">
-<polygon fill="white" stroke="#666666" points="188.75,-276.88 73.75,-276.88 73.75,-246.38 188.75,-246.38 188.75,-276.88"/>
-<text text-anchor="start" x="81.75" y="-263.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::cylinder_surface</text>
-<text text-anchor="middle" x="131.25" y="-252.12" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.01,-185.33C31.44,-198.78 48.35,-223.07 68.5,-237.62 69.84,-238.59 71.23,-239.53 72.64,-240.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.67,-243.34 81.1,-245.18 74.1,-237.23 70.67,-243.34"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158,-228.25 104.5,-228.25 104.5,-209 158,-209 158,-228.25"/>
-<text text-anchor="middle" x="131.25" y="-214.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.71,-183.55C42.75,-188.53 56.22,-194.89 68.5,-199.62 76.41,-202.68 85.04,-205.59 93.27,-208.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.1,-211.47 102.69,-211.03 94.14,-204.77 92.1,-211.47"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f" target="_top" xlink:title="surface perimeter of a n&#45;polygon ( n * l)">
-<polygon fill="white" stroke="#666666" points="194,-190.88 68.5,-190.88 68.5,-160.38 194,-160.38 194,-190.88"/>
-<text text-anchor="start" x="76.5" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::n_polygon_surface</text>
-<text text-anchor="middle" x="131.25" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge8_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-175.62C39.57,-175.62 47.77,-175.62 56.59,-175.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.51,-179.13 66.51,-175.63 56.51,-172.13 56.51,-179.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3" target="_top" xlink:title="perimeter of a parallelogram 2(b + h)">
-<polygon fill="white" stroke="#666666" points="182,-141.88 80.5,-141.88 80.5,-111.38 182,-111.38 182,-141.88"/>
-<text text-anchor="start" x="88.5" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::parallelogram</text>
-<text text-anchor="middle" x="131.25" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.85,-168.05C42.96,-163.22 56.43,-156.89 68.5,-151.62 72.27,-149.98 76.19,-148.31 80.14,-146.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.29,-149.96 89.19,-142.9 78.61,-143.49 81.29,-149.96"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6" target="_top" xlink:title="perimeter of a rectangle ( 2(l + w) )">
-<polygon fill="white" stroke="#666666" points="184.25,-93.25 78.25,-93.25 78.25,-74 184.25,-74 184.25,-93.25"/>
-<text text-anchor="middle" x="131.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::rect_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge11_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.66,-165.53C29.06,-149.76 45.45,-119.38 68.5,-102.62 70.53,-101.15 72.67,-99.79 74.9,-98.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.19,-101.8 83.69,-94.32 73.16,-95.48 76.19,-101.8"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14" target="_top" xlink:title="perimeter of a square (4 * l)">
-<polygon fill="white" stroke="#666666" points="190.62,-56.25 71.88,-56.25 71.88,-37 190.62,-37 190.62,-56.25"/>
-<text text-anchor="middle" x="131.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::square_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge12_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge12_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M18.98,-165.67C23.28,-143.97 36.49,-92.19 68.5,-64.62 69.43,-63.82 70.4,-63.06 71.39,-62.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.89,-65.5 79.7,-57.39 69.32,-59.49 72.89,-65.5"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3" target="_top" xlink:title="perimeter of a triangle (a + b + c)">
-<polygon fill="white" stroke="#666666" points="191.75,-19.25 70.75,-19.25 70.75,0 191.75,0 191.75,-19.25"/>
-<text text-anchor="middle" x="131.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::triangle_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge13_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge13_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M17.68,-165.7C19.38,-139.24 27.72,-66.42 68.5,-27.62 69.12,-27.03 69.76,-26.46 70.42,-25.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.1,-28.99 78.5,-20.55 68.23,-23.16 72.1,-28.99"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272.25,-136.25 230,-136.25 230,-117 272.25,-117 272.25,-136.25"/>
-<text text-anchor="middle" x="251.12" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.36,-245.98C186.55,-243.56 190.51,-240.79 194,-237.62 221.09,-213.05 236.9,-172.4 244.5,-147.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="247.85,-148.75 247.25,-138.17 241.12,-146.81 247.85,-148.75"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.94,-136.54C231.92,-145.15 236.32,-154.25 251.12,-154.25 259.22,-154.25 264.21,-151.53 266.08,-147.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.58,-147.36 264.55,-138.03 262.66,-148.46 269.58,-147.36"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="362.5,-136.25 308.25,-136.25 308.25,-117 362.5,-117 362.5,-136.25"/>
-<text text-anchor="middle" x="335.38" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M272.46,-126.62C279.7,-126.62 288.11,-126.62 296.35,-126.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="296.24,-130.13 306.24,-126.63 296.24,-123.13 296.24,-130.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge10_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge10_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.24,-126.62C194.5,-126.62 207.28,-126.62 218.41,-126.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.22,-130.13 228.22,-126.63 218.22,-123.13 218.22,-130.13"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node5 -->
-<g id="edge14_Node000012_Node000005" class="edge">
-<title>Node12&#45;&gt;Node5</title>
-<g id="a_edge14_Node000012_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.6,-19.66C185.4,-21.81 189.97,-24.44 194,-27.62 219.61,-47.89 235.55,-83.26 243.63,-105.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="240.25,-106.71 246.75,-115.08 246.88,-104.48 240.25,-106.71"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 22c2f8d69..000000000
--- a/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,30 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,243,55,268"/>
-<area shape="rect" id="Node000002" href="$d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,243,146,268"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,253,87,253,87,258,55,258"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953" title="perimeter of a circle (2 * pi * r)" alt="" coords="202,5,353,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="123,242,126,203,136,150,157,92,172,65,192,42,197,38,200,42,196,45,177,68,162,94,141,151,132,204,129,243"/>
-<area shape="rect" id="Node000004" href="$dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b" title="surface perimeter of a cube ( 12" alt="" coords="210,55,346,96"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="126,241,146,178,165,140,192,107,197,103,200,107,196,111,170,143,151,180,131,243"/>
-<area shape="rect" id="Node000005" href="$dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73" title="surface perimeter of a cylinder (2 * radius + 2 * height)" alt="" coords="201,120,354,161"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="131,241,156,207,192,171,198,167,201,171,196,175,160,210,136,244"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="242,185,313,211"/>
-<area shape="poly" id="edge8_Node000002_Node000008" title=" " alt="" coords="145,242,193,221,226,210,228,215,195,226,147,247"/>
-<area shape="rect" id="Node000009" href="$dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f" title="surface perimeter of a n&#45;polygon ( n * l)" alt="" coords="194,235,361,276"/>
-<area shape="poly" id="edge9_Node000002_Node000009" title=" " alt="" coords="147,253,178,253,178,258,147,258"/>
-<area shape="rect" id="Node000010" href="$dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3" title="perimeter of a parallelogram 2(b + h)" alt="" coords="210,300,345,341"/>
-<area shape="poly" id="edge10_Node000002_Node000010" title=" " alt="" coords="148,263,195,285,211,292,208,297,193,290,145,268"/>
-<area shape="rect" id="Node000011" href="$dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6" title="perimeter of a rectangle ( 2(l + w) )" alt="" coords="207,365,348,391"/>
-<area shape="poly" id="edge12_Node000002_Node000011" title=" " alt="" coords="134,268,157,309,175,331,196,351,204,356,201,361,192,355,171,335,153,312,129,270"/>
-<area shape="rect" id="Node000012" href="$dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14" title="perimeter of a square (4 * l)" alt="" coords="198,415,357,440"/>
-<area shape="poly" id="edge13_Node000002_Node000012" title=" " alt="" coords="131,268,137,296,150,332,169,370,196,402,200,404,196,409,192,405,164,372,145,334,132,298,125,269"/>
-<area shape="rect" id="Node000013" href="$dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3" title="perimeter of a triangle (a + b + c)" alt="" coords="197,464,358,490"/>
-<area shape="poly" id="edge14_Node000002_Node000013" title=" " alt="" coords="129,268,133,305,143,354,163,406,178,430,196,451,198,453,195,457,192,455,173,433,158,408,138,355,128,306,124,269"/>
-<area shape="rect" id="Node000006" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="409,308,466,334"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="347,160,363,171,388,199,407,232,431,292,426,294,402,234,384,202,360,175,344,164"/>
-<area shape="poly" id="edge6_Node000006_Node000006" title=" " alt="" coords="417,309,414,299,416,290,424,284,438,281,452,284,459,291,456,295,449,289,437,287,426,289,421,293,419,299,422,307"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="514,308,586,334"/>
-<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="466,318,498,318,498,324,466,324"/>
-<area shape="poly" id="edge11_Node000010_Node000006" title=" " alt="" coords="346,318,394,318,394,324,346,324"/>
-<area shape="poly" id="edge15_Node000013_Node000006" title=" " alt="" coords="342,461,360,451,383,428,401,401,425,348,430,350,406,403,387,431,363,455,345,466"/>
-</map>
diff --git a/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index de7f3bb06..000000000
--- a/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7fae855e3921b342ed3b3655fc096301
\ No newline at end of file
diff --git a/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 3aa3c9ed5..000000000
--- a/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,294 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="444pt" height="371pt"
- viewBox="0.00 0.00 443.50 371.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 367.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-185.25 0,-185.25 0,-166 37,-166 37,-185.25"/>
-<text text-anchor="middle" x="18.5" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-185.25 73,-185.25 73,-166 105.5,-166 105.5,-185.25"/>
-<text text-anchor="middle" x="89.25" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-175.62C44.58,-175.62 53.31,-175.62 61.45,-175.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-179.13 71.2,-175.63 61.2,-172.13 61.2,-179.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953" target="_top" xlink:title="perimeter of a circle (2 * pi * r)">
-<polygon fill="white" stroke="#666666" points="260.62,-363.25 147.88,-363.25 147.88,-344 260.62,-344 260.62,-363.25"/>
-<text text-anchor="middle" x="204.25" y="-349.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::circle_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.44,-185.43C91.5,-213.02 98.35,-292.05 141.5,-334.62 142.53,-335.64 143.62,-336.61 144.75,-337.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.6,-340.3 152.9,-342.74 146.37,-334.4 142.6,-340.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b" target="_top" xlink:title="surface perimeter of a cube ( 12">
-<polygon fill="white" stroke="#666666" points="255.38,-325.88 153.12,-325.88 153.12,-295.38 255.38,-295.38 255.38,-325.88"/>
-<text text-anchor="start" x="161.12" y="-312.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::cube_surface</text>
-<text text-anchor="middle" x="204.25" y="-301.12" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.29,-185.58C97.14,-206.8 111.26,-256.89 141.5,-285.62 142.56,-286.63 143.67,-287.6 144.81,-288.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.76,-291.37 152.99,-294.12 146.71,-285.59 142.76,-291.37"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73" target="_top" xlink:title="surface perimeter of a cylinder (2 * radius + 2 * height)">
-<polygon fill="white" stroke="#666666" points="261.75,-276.88 146.75,-276.88 146.75,-246.38 261.75,-246.38 261.75,-276.88"/>
-<text text-anchor="start" x="154.75" y="-263.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::cylinder_surface</text>
-<text text-anchor="middle" x="204.25" y="-252.12" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.01,-185.33C104.44,-198.78 121.35,-223.07 141.5,-237.62 142.84,-238.59 144.23,-239.53 145.64,-240.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.67,-243.34 154.1,-245.18 147.1,-237.23 143.67,-243.34"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231,-228.25 177.5,-228.25 177.5,-209 231,-209 231,-228.25"/>
-<text text-anchor="middle" x="204.25" y="-214.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge8_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge8_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.71,-183.55C115.75,-188.53 129.22,-194.89 141.5,-199.62 149.41,-202.68 158.04,-205.59 166.27,-208.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.1,-211.47 175.69,-211.03 167.14,-204.77 165.1,-211.47"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f" target="_top" xlink:title="surface perimeter of a n&#45;polygon ( n * l)">
-<polygon fill="white" stroke="#666666" points="267,-190.88 141.5,-190.88 141.5,-160.38 267,-160.38 267,-190.88"/>
-<text text-anchor="start" x="149.5" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::n_polygon_surface</text>
-<text text-anchor="middle" x="204.25" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge9_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge9_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-175.62C112.57,-175.62 120.77,-175.62 129.59,-175.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.51,-179.13 139.51,-175.63 129.51,-172.13 129.51,-179.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3" target="_top" xlink:title="perimeter of a parallelogram 2(b + h)">
-<polygon fill="white" stroke="#666666" points="255,-141.88 153.5,-141.88 153.5,-111.38 255,-111.38 255,-141.88"/>
-<text text-anchor="start" x="161.5" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::parallelogram</text>
-<text text-anchor="middle" x="204.25" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge10_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge10_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.85,-168.05C115.96,-163.22 129.43,-156.89 141.5,-151.62 145.27,-149.98 149.19,-148.31 153.14,-146.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.29,-149.96 162.19,-142.9 151.61,-143.49 154.29,-149.96"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6" target="_top" xlink:title="perimeter of a rectangle ( 2(l + w) )">
-<polygon fill="white" stroke="#666666" points="257.25,-93.25 151.25,-93.25 151.25,-74 257.25,-74 257.25,-93.25"/>
-<text text-anchor="middle" x="204.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::rect_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge12_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge12_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.66,-165.53C102.06,-149.76 118.45,-119.38 141.5,-102.62 143.53,-101.15 145.67,-99.79 147.9,-98.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.19,-101.8 156.69,-94.32 146.16,-95.48 149.19,-101.8"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14" target="_top" xlink:title="perimeter of a square (4 * l)">
-<polygon fill="white" stroke="#666666" points="263.62,-56.25 144.88,-56.25 144.88,-37 263.62,-37 263.62,-56.25"/>
-<text text-anchor="middle" x="204.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::square_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge13_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge13_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.98,-165.67C96.28,-143.97 109.49,-92.19 141.5,-64.62 142.43,-63.82 143.4,-63.06 144.39,-62.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.89,-65.5 152.7,-57.39 142.32,-59.49 145.89,-65.5"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3" target="_top" xlink:title="perimeter of a triangle (a + b + c)">
-<polygon fill="white" stroke="#666666" points="264.75,-19.25 143.75,-19.25 143.75,0 264.75,0 264.75,-19.25"/>
-<text text-anchor="middle" x="204.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::triangle_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node13 -->
-<g id="edge14_Node000002_Node000013" class="edge">
-<title>Node2&#45;&gt;Node13</title>
-<g id="a_edge14_Node000002_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.68,-165.7C92.38,-139.24 100.72,-66.42 141.5,-27.62 142.12,-27.03 142.76,-26.46 143.42,-25.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.1,-28.99 151.5,-20.55 141.23,-23.16 145.1,-28.99"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="345.25,-136.25 303,-136.25 303,-117 345.25,-117 345.25,-136.25"/>
-<text text-anchor="middle" x="324.12" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.36,-245.98C259.55,-243.56 263.51,-240.79 267,-237.62 294.09,-213.05 309.9,-172.4 317.5,-147.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.85,-148.75 320.25,-138.17 314.12,-146.81 320.85,-148.75"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M310.94,-136.54C304.92,-145.15 309.32,-154.25 324.12,-154.25 332.22,-154.25 337.21,-151.53 339.08,-147.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="342.58,-147.36 337.55,-138.03 335.66,-148.46 342.58,-147.36"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="435.5,-136.25 381.25,-136.25 381.25,-117 435.5,-117 435.5,-136.25"/>
-<text text-anchor="middle" x="408.38" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M345.46,-126.62C352.7,-126.62 361.11,-126.62 369.35,-126.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="369.24,-130.13 379.24,-126.63 369.24,-123.13 369.24,-130.13"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node6 -->
-<g id="edge11_Node000010_Node000006" class="edge">
-<title>Node10&#45;&gt;Node6</title>
-<g id="a_edge11_Node000010_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.24,-126.62C267.5,-126.62 280.28,-126.62 291.41,-126.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.22,-130.13 301.22,-126.63 291.22,-123.13 291.22,-130.13"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node6 -->
-<g id="edge15_Node000013_Node000006" class="edge">
-<title>Node13&#45;&gt;Node6</title>
-<g id="a_edge15_Node000013_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.6,-19.66C258.4,-21.81 262.97,-24.44 267,-27.62 292.61,-47.89 308.55,-83.26 316.63,-105.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.25,-106.71 319.75,-115.08 319.88,-104.48 313.25,-106.71"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index cdddf8c1e..000000000
--- a/d3/dfe/perimeter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,268 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="444pt" height="371pt"
- viewBox="0.00 0.00 443.50 371.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 367.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-185.25 0,-185.25 0,-166 37,-166 37,-185.25"/>
-<text text-anchor="middle" x="18.5" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-185.25 73,-185.25 73,-166 105.5,-166 105.5,-185.25"/>
-<text text-anchor="middle" x="89.25" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-175.62C44.58,-175.62 53.31,-175.62 61.45,-175.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-179.13 71.2,-175.63 61.2,-172.13 61.2,-179.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953" target="_top" xlink:title="perimeter of a circle (2 * pi * r)">
-<polygon fill="white" stroke="#666666" points="260.62,-363.25 147.88,-363.25 147.88,-344 260.62,-344 260.62,-363.25"/>
-<text text-anchor="middle" x="204.25" y="-349.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::circle_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.44,-185.43C91.5,-213.02 98.35,-292.05 141.5,-334.62 142.53,-335.64 143.62,-336.61 144.75,-337.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.6,-340.3 152.9,-342.74 146.37,-334.4 142.6,-340.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b" target="_top" xlink:title="surface perimeter of a cube ( 12">
-<polygon fill="white" stroke="#666666" points="255.38,-325.88 153.12,-325.88 153.12,-295.38 255.38,-295.38 255.38,-325.88"/>
-<text text-anchor="start" x="161.12" y="-312.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::cube_surface</text>
-<text text-anchor="middle" x="204.25" y="-301.12" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.29,-185.58C97.14,-206.8 111.26,-256.89 141.5,-285.62 142.56,-286.63 143.67,-287.6 144.81,-288.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.76,-291.37 152.99,-294.12 146.71,-285.59 142.76,-291.37"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73" target="_top" xlink:title="surface perimeter of a cylinder (2 * radius + 2 * height)">
-<polygon fill="white" stroke="#666666" points="261.75,-276.88 146.75,-276.88 146.75,-246.38 261.75,-246.38 261.75,-276.88"/>
-<text text-anchor="start" x="154.75" y="-263.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::cylinder_surface</text>
-<text text-anchor="middle" x="204.25" y="-252.12" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.01,-185.33C104.44,-198.78 121.35,-223.07 141.5,-237.62 142.84,-238.59 144.23,-239.53 145.64,-240.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.67,-243.34 154.1,-245.18 147.1,-237.23 143.67,-243.34"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231,-228.25 177.5,-228.25 177.5,-209 231,-209 231,-228.25"/>
-<text text-anchor="middle" x="204.25" y="-214.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge8_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge8_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.71,-183.55C115.75,-188.53 129.22,-194.89 141.5,-199.62 149.41,-202.68 158.04,-205.59 166.27,-208.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.1,-211.47 175.69,-211.03 167.14,-204.77 165.1,-211.47"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f" target="_top" xlink:title="surface perimeter of a n&#45;polygon ( n * l)">
-<polygon fill="white" stroke="#666666" points="267,-190.88 141.5,-190.88 141.5,-160.38 267,-160.38 267,-190.88"/>
-<text text-anchor="start" x="149.5" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::n_polygon_surface</text>
-<text text-anchor="middle" x="204.25" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge9_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge9_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-175.62C112.57,-175.62 120.77,-175.62 129.59,-175.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.51,-179.13 139.51,-175.63 129.51,-172.13 129.51,-179.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3" target="_top" xlink:title="perimeter of a parallelogram 2(b + h)">
-<polygon fill="white" stroke="#666666" points="255,-141.88 153.5,-141.88 153.5,-111.38 255,-111.38 255,-141.88"/>
-<text text-anchor="start" x="161.5" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::parallelogram</text>
-<text text-anchor="middle" x="204.25" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge10_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge10_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.85,-168.05C115.96,-163.22 129.43,-156.89 141.5,-151.62 145.27,-149.98 149.19,-148.31 153.14,-146.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.29,-149.96 162.19,-142.9 151.61,-143.49 154.29,-149.96"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6" target="_top" xlink:title="perimeter of a rectangle ( 2(l + w) )">
-<polygon fill="white" stroke="#666666" points="257.25,-93.25 151.25,-93.25 151.25,-74 257.25,-74 257.25,-93.25"/>
-<text text-anchor="middle" x="204.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::rect_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge12_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge12_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.66,-165.53C102.06,-149.76 118.45,-119.38 141.5,-102.62 143.53,-101.15 145.67,-99.79 147.9,-98.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.19,-101.8 156.69,-94.32 146.16,-95.48 149.19,-101.8"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14" target="_top" xlink:title="perimeter of a square (4 * l)">
-<polygon fill="white" stroke="#666666" points="263.62,-56.25 144.88,-56.25 144.88,-37 263.62,-37 263.62,-56.25"/>
-<text text-anchor="middle" x="204.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::square_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge13_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge13_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.98,-165.67C96.28,-143.97 109.49,-92.19 141.5,-64.62 142.43,-63.82 143.4,-63.06 144.39,-62.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.89,-65.5 152.7,-57.39 142.32,-59.49 145.89,-65.5"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3" target="_top" xlink:title="perimeter of a triangle (a + b + c)">
-<polygon fill="white" stroke="#666666" points="264.75,-19.25 143.75,-19.25 143.75,0 264.75,0 264.75,-19.25"/>
-<text text-anchor="middle" x="204.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::triangle_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node13 -->
-<g id="edge14_Node000002_Node000013" class="edge">
-<title>Node2&#45;&gt;Node13</title>
-<g id="a_edge14_Node000002_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.68,-165.7C92.38,-139.24 100.72,-66.42 141.5,-27.62 142.12,-27.03 142.76,-26.46 143.42,-25.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.1,-28.99 151.5,-20.55 141.23,-23.16 145.1,-28.99"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="345.25,-136.25 303,-136.25 303,-117 345.25,-117 345.25,-136.25"/>
-<text text-anchor="middle" x="324.12" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.36,-245.98C259.55,-243.56 263.51,-240.79 267,-237.62 294.09,-213.05 309.9,-172.4 317.5,-147.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.85,-148.75 320.25,-138.17 314.12,-146.81 320.85,-148.75"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M310.94,-136.54C304.92,-145.15 309.32,-154.25 324.12,-154.25 332.22,-154.25 337.21,-151.53 339.08,-147.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="342.58,-147.36 337.55,-138.03 335.66,-148.46 342.58,-147.36"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="435.5,-136.25 381.25,-136.25 381.25,-117 435.5,-117 435.5,-136.25"/>
-<text text-anchor="middle" x="408.38" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M345.46,-126.62C352.7,-126.62 361.11,-126.62 369.35,-126.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="369.24,-130.13 379.24,-126.63 369.24,-123.13 369.24,-130.13"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node6 -->
-<g id="edge11_Node000010_Node000006" class="edge">
-<title>Node10&#45;&gt;Node6</title>
-<g id="a_edge11_Node000010_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.24,-126.62C267.5,-126.62 280.28,-126.62 291.41,-126.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.22,-130.13 301.22,-126.63 291.22,-123.13 291.22,-130.13"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node6 -->
-<g id="edge15_Node000013_Node000006" class="edge">
-<title>Node13&#45;&gt;Node6</title>
-<g id="a_edge15_Node000013_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.6,-19.66C258.4,-21.81 262.97,-24.44 267,-27.62 292.61,-47.89 308.55,-83.26 316.63,-105.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.25,-106.71 319.75,-115.08 319.88,-104.48 313.25,-106.71"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d3/dfe/perimeter_8cpp_source.html b/d3/dfe/perimeter_8cpp_source.html
new file mode 100644
index 000000000..b71baafc1
--- /dev/null
+++ b/d3/dfe/perimeter_8cpp_source.html
@@ -0,0 +1,382 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/perimeter.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d3/dfe/perimeter_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">perimeter.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d3/dfe/perimeter_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#define _USE_MATH_DEFINES</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cmath&gt;</span>     </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cstdint&gt;</span>   </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00028" data-start="{" data-end="}">
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14">   28</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14">square_perimeter</a>(T length) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordflow">return</span> 4 * length;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>}</div>
+</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00040" data-start="{" data-end="}">
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6">   40</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6">rect_perimeter</a>(T length, T width) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">return</span> 2 * (length + width);</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>}</div>
+</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00052" data-start="{" data-end="}">
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3">   52</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3">triangle_perimeter</a>(T base, T <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>, T hypotenuse) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">return</span> base + <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> + hypotenuse;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>}</div>
+</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00063" data-start="{" data-end="}">
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953">   63</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953">circle_perimeter</a>(T radius) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="keywordflow">return</span> 2 * M_PI * radius;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>}</div>
+</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00075" data-start="{" data-end="}">
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3">   75</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3">parallelogram_perimeter</a>(T base, T <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keywordflow">return</span> 2 * (base + <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>);</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>}</div>
+</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00086" data-start="{" data-end="}">
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b">   86</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b">cube_surface_perimeter</a>(T length) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="keywordflow">return</span> 12 * length;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>}</div>
+</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00099" data-start="{" data-end="}">
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f">   99</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f">n_polygon_surface_perimeter</a>(T sides, T length) {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="keywordflow">return</span> sides * length;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>}</div>
+</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00111" data-start="{" data-end="}">
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73">  111</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73">cylinder_surface_perimeter</a>(T radius, T <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>) {</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="keywordflow">return</span> (2 * radius) + (2 * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>}</div>
+</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="foldopen" id="foldopen00120" data-start="{" data-end="}">
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"><a class="line" href="../../d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  120</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="comment">// I/O variables for testing</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    uint16_t int_length = 0;      <span class="comment">// 16 bit integer length input</span></div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    uint16_t int_width = 0;       <span class="comment">// 16 bit integer width input</span></div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    uint16_t int_base = 0;        <span class="comment">// 16 bit integer base input</span></div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    uint16_t int_height = 0;      <span class="comment">// 16 bit integer height input</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    uint16_t int_hypotenuse = 0;  <span class="comment">// 16 bit integer hypotenuse input</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    uint16_t int_sides = 0;       <span class="comment">// 16 bit integer sides input</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    uint16_t int_expected = 0;    <span class="comment">// 16 bit integer expected output</span></div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    uint16_t int_perimeter = 0;   <span class="comment">// 16 bit integer output</span></div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <span class="keywordtype">float</span> float_length = NAN;     <span class="comment">// float length input</span></div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="keywordtype">float</span> float_expected = NAN;   <span class="comment">// float expected output</span></div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <span class="keywordtype">float</span> float_perimeter = NAN;  <span class="comment">// float output</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <span class="keywordtype">double</span> double_length = NAN;     <span class="comment">// double length input</span></div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    <span class="keywordtype">double</span> double_width = NAN;      <span class="comment">// double width input</span></div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <span class="keywordtype">double</span> double_radius = NAN;     <span class="comment">// double radius input</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <span class="keywordtype">double</span> double_height = NAN;     <span class="comment">// double height input</span></div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <span class="keywordtype">double</span> double_expected = NAN;   <span class="comment">// double expected output</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="keywordtype">double</span> double_perimeter = NAN;  <span class="comment">// double output</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    <span class="comment">// 1st test</span></div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    int_length = 5;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    int_expected = 20;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    int_perimeter = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14">math::square_perimeter</a>(int_length);</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span> </div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;perimeter OF A SQUARE (int)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_perimeter &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    assert(int_perimeter == int_expected);</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span> </div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <span class="comment">// 2nd test</span></div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    float_length = 2.5;</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    float_expected = 10;</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    float_perimeter = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14">math::square_perimeter</a>(float_length);</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span> </div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;perimeter OF A SQUARE (float)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; float_length &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; float_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; float_perimeter &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    assert(float_perimeter == float_expected);</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span> </div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    <span class="comment">// 3rd test</span></div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    int_length = 4;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    int_width = 7;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    int_expected = 22;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    int_perimeter = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6">math::rect_perimeter</a>(int_length, int_width);</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span> </div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;perimeter OF A RECTANGLE (int)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Width: &quot;</span> &lt;&lt; int_width &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_perimeter &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    assert(int_perimeter == int_expected);</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span> </div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    <span class="comment">// 4th test</span></div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    double_length = 2.5;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    double_width = 5.7;</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    double_expected = 16.4;</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    double_perimeter = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6">math::rect_perimeter</a>(double_length, double_width);</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span> </div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;perimeter OF A RECTANGLE (double)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; double_length &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Width: &quot;</span> &lt;&lt; double_width &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_perimeter &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    assert(double_perimeter == double_expected);</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span> </div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    <span class="comment">// 5th test</span></div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    int_base = 10;</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    int_height = 3;</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    int_hypotenuse = 5;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    int_expected = 18;</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    int_perimeter =</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>        <a class="code hl_function" href="../../dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3">math::triangle_perimeter</a>(int_base, int_height, int_hypotenuse);</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span> </div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;perimeter OF A TRIANGLE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Base: &quot;</span> &lt;&lt; int_base &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_perimeter &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    assert(int_perimeter == int_expected);</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span> </div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    <span class="comment">// 6th test</span></div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    double_radius = 6;</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    double_expected =</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>        37.69911184307752;  <span class="comment">// rounded down because the double datatype</span></div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>                            <span class="comment">// truncates after 14 decimal places</span></div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    double_perimeter = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953">math::circle_perimeter</a>(double_radius);</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span> </div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;perimeter OF A CIRCLE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_perimeter &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    assert(double_perimeter == double_expected);</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span> </div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    <span class="comment">// 7th test</span></div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    int_base = 6;</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    int_height = 7;</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    int_expected = 26;</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    int_perimeter = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3">math::parallelogram_perimeter</a>(int_base, int_height);</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span> </div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;perimeter OF A PARALLELOGRAM&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Base: &quot;</span> &lt;&lt; int_base &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_perimeter &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    assert(int_perimeter == int_expected);</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span> </div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    <span class="comment">// 8th test</span></div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    double_length = 5.5;</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    double_expected = 66.0;</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    double_perimeter = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b">math::cube_surface_perimeter</a>(double_length);</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span> </div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;SURFACE perimeter OF A CUBE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; double_length &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_perimeter &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    assert(double_perimeter == double_expected);</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span> </div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    <span class="comment">// 9th test</span></div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    int_sides = 7;</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    int_length = 10;</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    int_expected = 70;</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>    int_perimeter = <a class="code hl_function" href="../../dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f">math::n_polygon_surface_perimeter</a>(int_sides, int_length);</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span> </div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;SURFACE perimeter OF A N-POLYGON&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Sides: &quot;</span> &lt;&lt; int_sides &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_perimeter &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>    assert(int_perimeter == int_expected);</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span> </div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>    <span class="comment">// 10th test</span></div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>    double_radius = 4.0;</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>    double_height = 7.0;</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>    double_expected = 22.0;</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>    double_perimeter =</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>        <a class="code hl_function" href="../../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73">math::cylinder_surface_perimeter</a>(double_radius, double_height);</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span> </div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;SURFACE perimeter OF A CYLINDER&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; double_height &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_perimeter &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>    assert(double_perimeter == double_expected);</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>}</div>
+</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span> </div>
+<div class="foldopen" id="foldopen00284" data-start="{" data-end="}">
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"><a class="line" href="../../d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  284</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>    <a class="code hl_function" href="../../d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>}</div>
+</div>
+<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00038">avltree.cpp:38</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_a0efb235330ff48e14fd31faaccbcebb3"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3">math::parallelogram_perimeter</a></div><div class="ttdeci">T parallelogram_perimeter(T base, T height)</div><div class="ttdoc">perimeter of a parallelogram 2(b + h)</div><div class="ttdef"><b>Definition</b> <a href="#l00075">perimeter.cpp:75</a></div></div>
+<div class="ttc" id="anamespacemath_html_a1d4df7a4e43a2eac1acc0ac610487c73"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73">math::cylinder_surface_perimeter</a></div><div class="ttdeci">T cylinder_surface_perimeter(T radius, T height)</div><div class="ttdoc">surface perimeter of a cylinder (2 * radius + 2 * height)</div><div class="ttdef"><b>Definition</b> <a href="#l00111">perimeter.cpp:111</a></div></div>
+<div class="ttc" id="anamespacemath_html_a3d1e4db743b189f309327572663415f3"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3">math::triangle_perimeter</a></div><div class="ttdeci">T triangle_perimeter(T base, T height, T hypotenuse)</div><div class="ttdoc">perimeter of a triangle (a + b + c)</div><div class="ttdef"><b>Definition</b> <a href="#l00052">perimeter.cpp:52</a></div></div>
+<div class="ttc" id="anamespacemath_html_a428769a16e9525e56588d7c7709d25a6"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6">math::rect_perimeter</a></div><div class="ttdeci">T rect_perimeter(T length, T width)</div><div class="ttdoc">perimeter of a rectangle ( 2(l + w) )</div><div class="ttdef"><b>Definition</b> <a href="#l00040">perimeter.cpp:40</a></div></div>
+<div class="ttc" id="anamespacemath_html_a8998ca7b1886d1d7d00aef3b457a9b1b"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b">math::cube_surface_perimeter</a></div><div class="ttdeci">T cube_surface_perimeter(T length)</div><div class="ttdoc">surface perimeter of a cube ( 12</div><div class="ttdef"><b>Definition</b> <a href="#l00086">perimeter.cpp:86</a></div></div>
+<div class="ttc" id="anamespacemath_html_a9236348755183644f1225e162d01ab14"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14">math::square_perimeter</a></div><div class="ttdeci">T square_perimeter(T length)</div><div class="ttdoc">perimeter of a square (4 * l)</div><div class="ttdef"><b>Definition</b> <a href="#l00028">perimeter.cpp:28</a></div></div>
+<div class="ttc" id="anamespacemath_html_aa8592c3279c41a2c6d4d64eeb488f63f"><div class="ttname"><a href="../../dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f">math::n_polygon_surface_perimeter</a></div><div class="ttdeci">T n_polygon_surface_perimeter(T sides, T length)</div><div class="ttdoc">surface perimeter of a n-polygon ( n * l)</div><div class="ttdef"><b>Definition</b> <a href="#l00099">perimeter.cpp:99</a></div></div>
+<div class="ttc" id="anamespacemath_html_ad0acf82b7bc920182bf8322d1e103953"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953">math::circle_perimeter</a></div><div class="ttdeci">T circle_perimeter(T radius)</div><div class="ttdoc">perimeter of a circle (2 * pi * r)</div><div class="ttdef"><b>Definition</b> <a href="#l00063">perimeter.cpp:63</a></div></div>
+<div class="ttc" id="aperimeter_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d3/dfe/perimeter_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> <a href="#l00120">perimeter.cpp:120</a></div></div>
+<div class="ttc" id="aperimeter_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00284">perimeter.cpp:284</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d3/dfe/perimeter_8cpp.html">perimeter.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d08/sha256_8cpp.html b/d4/d08/sha256_8cpp.html
index d8e910ffb..243394bbb 100644
--- a/d4/d08/sha256_8cpp.html
+++ b/d4/d08/sha256_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: hashing/sha256.cpp File Reference</title>
+<title>TheAlgorithms/C++: hashing/sha256.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -127,7 +144,9 @@ Include dependency graph for sha256.cpp:</div>
 <div class="dyncontent">
 <div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../dc/dd2/sha256_8cpp__incl.svg" width="100%" height="383"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
 </div>
-</div><table class="memberdecls">
+</div>
+<p><a href="../../d4/d08/sha256_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d84/classhashing_1_1sha256_1_1_hash.html">hashing::sha256::Hash</a></td></tr>
@@ -148,20 +167,20 @@ Functions</h2></td></tr>
 <tr class="memitem:adbcd504103c342a4da718f8fce6ff06c" id="r_adbcd504103c342a4da718f8fce6ff06c"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adbcd504103c342a4da718f8fce6ff06c">hashing::sha256::right_rotate</a> (uint32_t n, size_t rotate)</td></tr>
 <tr class="memdesc:adbcd504103c342a4da718f8fce6ff06c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Rotates the bits of a 32-bit unsigned integer.  <br /></td></tr>
 <tr class="separator:adbcd504103c342a4da718f8fce6ff06c"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a28c1c6724dc6bcf91a39818699bbec27" id="r_a28c1c6724dc6bcf91a39818699bbec27"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a28c1c6724dc6bcf91a39818699bbec27">hashing::sha256::compute_padded_size</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> input_size)</td></tr>
+<tr class="memitem:a28c1c6724dc6bcf91a39818699bbec27" id="r_a28c1c6724dc6bcf91a39818699bbec27"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a28c1c6724dc6bcf91a39818699bbec27">hashing::sha256::compute_padded_size</a> (const std::size_t input_size)</td></tr>
 <tr class="memdesc:a28c1c6724dc6bcf91a39818699bbec27"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes size of the padded input.  <br /></td></tr>
 <tr class="separator:a28c1c6724dc6bcf91a39818699bbec27"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:afea411191ec5281f43e91ea327984627" id="r_afea411191ec5281f43e91ea327984627"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:afea411191ec5281f43e91ea327984627"><td class="memTemplItemLeft" align="right" valign="top">uint8_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#afea411191ec5281f43e91ea327984627">hashing::sha256::extract_byte</a> (const T in_value, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> byte_num)</td></tr>
+<tr class="memitem:afea411191ec5281f43e91ea327984627"><td class="memTemplItemLeft" align="right" valign="top">uint8_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#afea411191ec5281f43e91ea327984627">hashing::sha256::extract_byte</a> (const T in_value, const std::size_t byte_num)</td></tr>
 <tr class="memdesc:afea411191ec5281f43e91ea327984627"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the byte at position byte_num in in_value.  <br /></td></tr>
 <tr class="separator:afea411191ec5281f43e91ea327984627"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a9e98c180d32b04aab6f767cb0c13e1da" id="r_a9e98c180d32b04aab6f767cb0c13e1da"><td class="memItemLeft" align="right" valign="top">char&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9e98c180d32b04aab6f767cb0c13e1da">hashing::sha256::get_char</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;input, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> pos)</td></tr>
+<tr class="memitem:a9e98c180d32b04aab6f767cb0c13e1da" id="r_a9e98c180d32b04aab6f767cb0c13e1da"><td class="memItemLeft" align="right" valign="top">char&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9e98c180d32b04aab6f767cb0c13e1da">hashing::sha256::get_char</a> (const std::string &amp;input, std::size_t pos)</td></tr>
 <tr class="memdesc:a9e98c180d32b04aab6f767cb0c13e1da"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the character at pos after the input is padded.  <br /></td></tr>
 <tr class="separator:a9e98c180d32b04aab6f767cb0c13e1da"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a525531b3939ed44fbf01674e21931b3a" id="r_a525531b3939ed44fbf01674e21931b3a"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint32_t, 64 &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a525531b3939ed44fbf01674e21931b3a">hashing::sha256::create_message_schedule_array</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;input, const size_t byte_num)</td></tr>
+<tr class="memitem:a525531b3939ed44fbf01674e21931b3a" id="r_a525531b3939ed44fbf01674e21931b3a"><td class="memItemLeft" align="right" valign="top">std::array&lt; uint32_t, 64 &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a525531b3939ed44fbf01674e21931b3a">hashing::sha256::create_message_schedule_array</a> (const std::string &amp;input, const size_t byte_num)</td></tr>
 <tr class="memdesc:a525531b3939ed44fbf01674e21931b3a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Creates the message schedule array.  <br /></td></tr>
 <tr class="separator:a525531b3939ed44fbf01674e21931b3a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a55475649a2bb7aae15de0716a217f43a" id="r_a55475649a2bb7aae15de0716a217f43a"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a55475649a2bb7aae15de0716a217f43a">hashing::sha256::sha256</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;input)</td></tr>
+<tr class="memitem:a55475649a2bb7aae15de0716a217f43a" id="r_a55475649a2bb7aae15de0716a217f43a"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a55475649a2bb7aae15de0716a217f43a">hashing::sha256::sha256</a> (const std::string &amp;input)</td></tr>
 <tr class="memdesc:a55475649a2bb7aae15de0716a217f43a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes the final hash value.  <br /></td></tr>
 <tr class="separator:a55475649a2bb7aae15de0716a217f43a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af9b52eba85d23e309035354141259f27" id="r_af9b52eba85d23e309035354141259f27"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af9b52eba85d23e309035354141259f27">test_compute_padded_size</a> ()</td></tr>
@@ -185,6 +204,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Simple C++ implementation of the [SHA-256 Hashing Algorithm] (<a href="https://en.wikipedia.org/wiki/SHA-2">https://en.wikipedia.org/wiki/SHA-2</a>) </p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/mdanisulh" target="_blank">Md. Anisul Haque</a> </dd></dl>
 <p><a href="https://en.wikipedia.org/wiki/SHA-2" target="_blank">SHA-2</a> is a set of cryptographic hash functions that was designed by the <a href="https://en.wikipedia.org/wiki/National_Security_Agency" target="_blank">NSA</a> and first published in 2001. SHA-256 is a part of the SHA-2 family. SHA-256 is widely used for authenticating software packages and secure password hashing. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d08/sha256_8cpp_source.html">sha256.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a28c1c6724dc6bcf91a39818699bbec27" name="a28c1c6724dc6bcf91a39818699bbec27"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a28c1c6724dc6bcf91a39818699bbec27">&#9670;&#160;</a></span>compute_padded_size()</h2>
@@ -193,9 +214,9 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> hashing::sha256::compute_padded_size </td>
+          <td class="memname">std::size_t hashing::sha256::compute_padded_size </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></td>          <td class="paramname"><span class="paramname"><em>input_size</em></span></td><td>)</td>
+          <td class="paramtype">const std::size_t</td>          <td class="paramname"><span class="paramname"><em>input_size</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -209,18 +230,15 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>size_t Size of the padded input </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d08/sha256_8cpp_source.html#l00143">143</a> of file <a class="el" href="../../d4/d08/sha256_8cpp_source.html">sha256.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  143</span>                                                          {</div>
 <div class="line"><span class="lineno">  144</span>    <span class="keywordflow">if</span> (input_size % 64 &lt; 56) {</div>
 <div class="line"><span class="lineno">  145</span>        <span class="keywordflow">return</span> input_size + 64 - (input_size % 64);</div>
 <div class="line"><span class="lineno">  146</span>    }</div>
 <div class="line"><span class="lineno">  147</span>    <span class="keywordflow">return</span> input_size + 128 - (input_size % 64);</div>
 <div class="line"><span class="lineno">  148</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d08/sha256_8cpp_a28c1c6724dc6bcf91a39818699bbec27_cgraph.svg" width="186" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a525531b3939ed44fbf01674e21931b3a" name="a525531b3939ed44fbf01674e21931b3a"></a>
@@ -230,9 +248,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint32_t, 64 &gt; hashing::sha256::create_message_schedule_array </td>
+          <td class="memname">std::array&lt; uint32_t, 64 &gt; hashing::sha256::create_message_schedule_array </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>input</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>input</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -251,8 +269,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>std::array&lt;uint32_t, 64&gt; Message schedule array </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d08/sha256_8cpp_source.html#l00195">195</a> of file <a class="el" href="../../d4/d08/sha256_8cpp_source.html">sha256.cpp</a>.</p>
 <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/container/array.html">std::array&lt;uint32_t, 64&gt;</a> blocks{};</div>
+<div class="line"><span class="lineno">  197</span>    std::array&lt;uint32_t, 64&gt; blocks{};</div>
 <div class="line"><span class="lineno">  198</span> </div>
 <div class="line"><span class="lineno">  199</span>    <span class="comment">// Copy chunk into first 16 words of the message schedule array</span></div>
 <div class="line"><span class="lineno">  200</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> block_num = 0; block_num &lt; 16; ++block_num) {</div>
@@ -281,15 +301,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  223</span> </div>
 <div class="line"><span class="lineno">  224</span>    <span class="keywordflow">return</span> blocks;</div>
 <div class="line"><span class="lineno">  225</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="asha256_8cpp_html_a9e98c180d32b04aab6f767cb0c13e1da"><div class="ttname"><a href="#a9e98c180d32b04aab6f767cb0c13e1da">hashing::sha256::get_char</a></div><div class="ttdeci">char get_char(const std::string &amp;input, std::size_t pos)</div><div class="ttdoc">Returns the character at pos after the input is padded.</div><div class="ttdef"><b>Definition</b> sha256.cpp:170</div></div>
-<div class="ttc" id="asha256_8cpp_html_adbcd504103c342a4da718f8fce6ff06c"><div class="ttname"><a href="#adbcd504103c342a4da718f8fce6ff06c">hashing::sha256::right_rotate</a></div><div class="ttdeci">uint32_t right_rotate(uint32_t n, size_t rotate)</div><div class="ttdoc">Rotates the bits of a 32-bit unsigned integer.</div><div class="ttdef"><b>Definition</b> sha256.cpp:58</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d08/sha256_8cpp_a525531b3939ed44fbf01674e21931b3a_cgraph.svg" width="632" height="186"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asha256_8cpp_html_a9e98c180d32b04aab6f767cb0c13e1da"><div class="ttname"><a href="#a9e98c180d32b04aab6f767cb0c13e1da">hashing::sha256::get_char</a></div><div class="ttdeci">char get_char(const std::string &amp;input, std::size_t pos)</div><div class="ttdoc">Returns the character at pos after the input is padded.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d08/sha256_8cpp_source.html#l00170">sha256.cpp:170</a></div></div>
+<div class="ttc" id="asha256_8cpp_html_adbcd504103c342a4da718f8fce6ff06c"><div class="ttname"><a href="#adbcd504103c342a4da718f8fce6ff06c">hashing::sha256::right_rotate</a></div><div class="ttdeci">uint32_t right_rotate(uint32_t n, size_t rotate)</div><div class="ttdoc">Rotates the bits of a 32-bit unsigned integer.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d08/sha256_8cpp_source.html#l00058">sha256.cpp:58</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="afea411191ec5281f43e91ea327984627" name="afea411191ec5281f43e91ea327984627"></a>
@@ -308,7 +322,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></td>          <td class="paramname"><span class="paramname"><em>byte_num</em></span>&#160;)</td>
+          <td class="paramtype">const std::size_t</td>          <td class="paramname"><span class="paramname"><em>byte_num</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -322,19 +336,15 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>uint8_t Byte at position byte_num </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d08/sha256_8cpp_source.html#l00157">157</a> of file <a class="el" href="../../d4/d08/sha256_8cpp_source.html">sha256.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  157</span>                                                                 {</div>
 <div class="line"><span class="lineno">  158</span>    <span class="keywordflow">if</span> (<span class="keyword">sizeof</span>(in_value) &lt;= byte_num) {</div>
-<div class="line"><span class="lineno">  159</span>        <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a>(<span class="stringliteral">&quot;Byte at index byte_num does not exist&quot;</span>);</div>
+<div class="line"><span class="lineno">  159</span>        <span class="keywordflow">throw</span> std::out_of_range(<span class="stringliteral">&quot;Byte at index byte_num does not exist&quot;</span>);</div>
 <div class="line"><span class="lineno">  160</span>    }</div>
 <div class="line"><span class="lineno">  161</span>    <span class="keywordflow">return</span> (in_value &gt;&gt; (byte_num * 8)) &amp; 0xFF;</div>
 <div class="line"><span class="lineno">  162</span>}</div>
-<div class="ttc" id="aout_of_range_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d08/sha256_8cpp_afea411191ec5281f43e91ea327984627_cgraph.svg" width="207" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a9e98c180d32b04aab6f767cb0c13e1da" name="a9e98c180d32b04aab6f767cb0c13e1da"></a>
@@ -346,12 +356,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">char hashing::sha256::get_char </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>input</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>input</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></td>          <td class="paramname"><span class="paramname"><em>pos</em></span>&#160;)</td>
+          <td class="paramtype">std::size_t</td>          <td class="paramname"><span class="paramname"><em>pos</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -365,8 +375,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>char Character at the index pos in the padded string </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d08/sha256_8cpp_source.html#l00170">170</a> of file <a class="el" href="../../d4/d08/sha256_8cpp_source.html">sha256.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  170</span>                                                     {</div>
-<div class="line"><span class="lineno">  171</span>    <span class="keyword">const</span> <span class="keyword">auto</span> input_size = input.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>();</div>
+<div class="line"><span class="lineno">  171</span>    <span class="keyword">const</span> <span class="keyword">auto</span> input_size = input.length();</div>
 <div class="line"><span class="lineno">  172</span>    <span class="keywordflow">if</span> (pos &lt; input_size) {</div>
 <div class="line"><span class="lineno">  173</span>        <span class="keywordflow">return</span> input[pos];</div>
 <div class="line"><span class="lineno">  174</span>    }</div>
@@ -378,19 +390,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  180</span>        <span class="keywordflow">return</span> <span class="stringliteral">&#39;\x00&#39;</span>;</div>
 <div class="line"><span class="lineno">  181</span>    }</div>
 <div class="line"><span class="lineno">  182</span>    <span class="keywordflow">if</span> (padded_input_size &lt;= pos) {</div>
-<div class="line"><span class="lineno">  183</span>        <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a>(<span class="stringliteral">&quot;pos is out of range&quot;</span>);</div>
+<div class="line"><span class="lineno">  183</span>        <span class="keywordflow">throw</span> std::out_of_range(<span class="stringliteral">&quot;pos is out of range&quot;</span>);</div>
 <div class="line"><span class="lineno">  184</span>    }</div>
 <div class="line"><span class="lineno">  185</span>    <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">char</span><span class="keyword">&gt;</span>(</div>
 <div class="line"><span class="lineno">  186</span>        extract_byte&lt;size_t&gt;(input_size * 8, padded_input_size - pos - 1));</div>
 <div class="line"><span class="lineno">  187</span>}</div>
-<div class="ttc" id="asha256_8cpp_html_a28c1c6724dc6bcf91a39818699bbec27"><div class="ttname"><a href="#a28c1c6724dc6bcf91a39818699bbec27">hashing::sha256::compute_padded_size</a></div><div class="ttdeci">std::size_t compute_padded_size(const std::size_t input_size)</div><div class="ttdoc">Computes size of the padded input.</div><div class="ttdef"><b>Definition</b> sha256.cpp:143</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::length</a></div><div class="ttdeci">T length(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d08/sha256_8cpp_a9e98c180d32b04aab6f767cb0c13e1da_cgraph.svg" width="408" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asha256_8cpp_html_a28c1c6724dc6bcf91a39818699bbec27"><div class="ttname"><a href="#a28c1c6724dc6bcf91a39818699bbec27">hashing::sha256::compute_padded_size</a></div><div class="ttdeci">std::size_t compute_padded_size(const std::size_t input_size)</div><div class="ttdoc">Computes size of the padded input.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d08/sha256_8cpp_source.html#l00143">sha256.cpp:143</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -410,17 +416,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d08/sha256_8cpp_source.html#l00326">326</a> of file <a class="el" href="../../d4/d08/sha256_8cpp_source.html">sha256.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  326</span>           {</div>
 <div class="line"><span class="lineno">  327</span>    <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();  <span class="comment">// Run self-test implementations</span></div>
 <div class="line"><span class="lineno">  328</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  329</span>}</div>
-<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> caesar_cipher.cpp:100</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d08/sha256_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00100">caesar_cipher.cpp:100</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="adbcd504103c342a4da718f8fce6ff06c" name="adbcd504103c342a4da718f8fce6ff06c"></a>
@@ -451,16 +454,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>uint32_t The rotated integer </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   58</span>                                                 {</div>
-<div class="line"><span class="lineno">   59</span>    <span class="keywordflow">return</span> (n &gt;&gt; rotate) | (n &lt;&lt; (32 - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/rotate.html">rotate</a>));</div>
-<div class="line"><span class="lineno">   60</span>}</div>
-<div class="ttc" id="arotate_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/rotate.html">std::rotate</a></div><div class="ttdeci">T rotate(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d08/sha256_8cpp_adbcd504103c342a4da718f8fce6ff06c_cgraph.svg" width="160" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d08/sha256_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d4/d08/sha256_8cpp_source.html">sha256.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   58</span>                                                 {</div>
+<div class="line"><span class="lineno">   59</span>    <span class="keywordflow">return</span> (n &gt;&gt; rotate) | (n &lt;&lt; (32 - rotate));</div>
+<div class="line"><span class="lineno">   60</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a55475649a2bb7aae15de0716a217f43a" name="a55475649a2bb7aae15de0716a217f43a"></a>
@@ -470,9 +469,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> hashing::sha256::sha256 </td>
+          <td class="memname">std::string hashing::sha256::sha256 </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>input</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>input</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -485,24 +484,21 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
-<dl class="section return"><dt>Returns</dt><dd><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> The final hash value </dd></dl>
+<dl class="section return"><dt>Returns</dt><dd>std::string The final hash value </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d08/sha256_8cpp_source.html#l00232">232</a> of file <a class="el" href="../../d4/d08/sha256_8cpp_source.html">sha256.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  232</span>                                         {</div>
 <div class="line"><span class="lineno">  233</span>    Hash <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>;</div>
 <div class="line"><span class="lineno">  234</span>    <span class="comment">// Process message in successive 512-bit (64-byte) chunks</span></div>
-<div class="line"><span class="lineno">  235</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> byte_num = 0; byte_num &lt; <a class="code hl_function" href="#a28c1c6724dc6bcf91a39818699bbec27">compute_padded_size</a>(input.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>());</div>
+<div class="line"><span class="lineno">  235</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> byte_num = 0; byte_num &lt; <a class="code hl_function" href="#a28c1c6724dc6bcf91a39818699bbec27">compute_padded_size</a>(input.length());</div>
 <div class="line"><span class="lineno">  236</span>         byte_num += 64) {</div>
 <div class="line"><span class="lineno">  237</span>        <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.update(<a class="code hl_function" href="#a525531b3939ed44fbf01674e21931b3a">create_message_schedule_array</a>(input, byte_num));</div>
 <div class="line"><span class="lineno">  238</span>    }</div>
 <div class="line"><span class="lineno">  239</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.to_string();</div>
 <div class="line"><span class="lineno">  240</span>}</div>
-<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> hash_search.cpp:45</div></div>
-<div class="ttc" id="asha256_8cpp_html_a525531b3939ed44fbf01674e21931b3a"><div class="ttname"><a href="#a525531b3939ed44fbf01674e21931b3a">hashing::sha256::create_message_schedule_array</a></div><div class="ttdeci">std::array&lt; uint32_t, 64 &gt; create_message_schedule_array(const std::string &amp;input, const size_t byte_num)</div><div class="ttdoc">Creates the message schedule array.</div><div class="ttdef"><b>Definition</b> sha256.cpp:195</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/d08/sha256_8cpp_a55475649a2bb7aae15de0716a217f43a_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00045">hash_search.cpp:45</a></div></div>
+<div class="ttc" id="asha256_8cpp_html_a525531b3939ed44fbf01674e21931b3a"><div class="ttname"><a href="#a525531b3939ed44fbf01674e21931b3a">hashing::sha256::create_message_schedule_array</a></div><div class="ttdeci">std::array&lt; uint32_t, 64 &gt; create_message_schedule_array(const std::string &amp;input, const size_t byte_num)</div><div class="ttdoc">Creates the message schedule array.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d08/sha256_8cpp_source.html#l00195">sha256.cpp:195</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -527,6 +523,8 @@ Here is the call graph for this function:</div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d08/sha256_8cpp_source.html#l00312">312</a> of file <a class="el" href="../../d4/d08/sha256_8cpp_source.html">sha256.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  312</span>                   {</div>
 <div class="line"><span class="lineno">  313</span>    <a class="code hl_function" href="#af9b52eba85d23e309035354141259f27">test_compute_padded_size</a>();</div>
 <div class="line"><span class="lineno">  314</span>    test_extract_byte();</div>
@@ -534,10 +532,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  316</span>    test_right_rotate();</div>
 <div class="line"><span class="lineno">  317</span>    test_sha256();</div>
 <div class="line"><span class="lineno">  318</span> </div>
-<div class="line"><span class="lineno">  319</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  319</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  320</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="asha256_8cpp_html_af9b52eba85d23e309035354141259f27"><div class="ttname"><a href="#af9b52eba85d23e309035354141259f27">test_compute_padded_size</a></div><div class="ttdeci">static void test_compute_padded_size()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> sha256.cpp:248</div></div>
+<div class="ttc" id="asha256_8cpp_html_af9b52eba85d23e309035354141259f27"><div class="ttname"><a href="#af9b52eba85d23e309035354141259f27">test_compute_padded_size</a></div><div class="ttdeci">static void test_compute_padded_size()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d08/sha256_8cpp_source.html#l00248">sha256.cpp:248</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -566,6 +563,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d08/sha256_8cpp_source.html#l00248">248</a> of file <a class="el" href="../../d4/d08/sha256_8cpp_source.html">sha256.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  248</span>                                       {</div>
 <div class="line"><span class="lineno">  249</span>    assert(hashing::sha256::compute_padded_size(55) == 64);</div>
 <div class="line"><span class="lineno">  250</span>    assert(hashing::sha256::compute_padded_size(56) == 128);</div>
@@ -596,13 +595,15 @@ Here is the call graph for this function:</div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d08/sha256_8cpp_source.html#l00254">254</a> of file <a class="el" href="../../d4/d08/sha256_8cpp_source.html">sha256.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  254</span>                                {</div>
 <div class="line"><span class="lineno">  255</span>    assert(hashing::sha256::extract_byte&lt;uint32_t&gt;(512, 0) == 0);</div>
 <div class="line"><span class="lineno">  256</span>    assert(hashing::sha256::extract_byte&lt;uint32_t&gt;(512, 1) == 2);</div>
 <div class="line"><span class="lineno">  257</span>    <span class="keywordtype">bool</span> exception = <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  258</span>    <span class="keywordflow">try</span> {</div>
 <div class="line"><span class="lineno">  259</span>        hashing::sha256::extract_byte&lt;uint32_t&gt;(512, 5);</div>
-<div class="line"><span class="lineno">  260</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a> &amp;) {</div>
+<div class="line"><span class="lineno">  260</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::out_of_range &amp;) {</div>
 <div class="line"><span class="lineno">  261</span>        exception = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  262</span>    }</div>
 <div class="line"><span class="lineno">  263</span>    assert(exception);</div>
@@ -632,6 +633,8 @@ Here is the call graph for this function:</div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d08/sha256_8cpp_source.html#l00266">266</a> of file <a class="el" href="../../d4/d08/sha256_8cpp_source.html">sha256.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  266</span>                            {</div>
 <div class="line"><span class="lineno">  267</span>    assert(hashing::sha256::get_char(<span class="stringliteral">&quot;test&quot;</span>, 3) == <span class="charliteral">&#39;t&#39;</span>);</div>
 <div class="line"><span class="lineno">  268</span>    assert(hashing::sha256::get_char(<span class="stringliteral">&quot;test&quot;</span>, 4) == <span class="stringliteral">&#39;\x80&#39;</span>);</div>
@@ -640,7 +643,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  271</span>    <span class="keywordtype">bool</span> exception = <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  272</span>    <span class="keywordflow">try</span> {</div>
 <div class="line"><span class="lineno">  273</span>        <a class="code hl_function" href="#a9e98c180d32b04aab6f767cb0c13e1da">hashing::sha256::get_char</a>(<span class="stringliteral">&quot;test&quot;</span>, 64);</div>
-<div class="line"><span class="lineno">  274</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a> &amp;) {</div>
+<div class="line"><span class="lineno">  274</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::out_of_range &amp;) {</div>
 <div class="line"><span class="lineno">  275</span>        exception = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  276</span>    }</div>
 <div class="line"><span class="lineno">  277</span>    assert(exception);</div>
@@ -670,6 +673,8 @@ Here is the call graph for this function:</div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d08/sha256_8cpp_source.html#l00280">280</a> of file <a class="el" href="../../d4/d08/sha256_8cpp_source.html">sha256.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  280</span>                                {</div>
 <div class="line"><span class="lineno">  281</span>    assert(hashing::sha256::right_rotate(128, 3) == 16);</div>
 <div class="line"><span class="lineno">  282</span>    assert(hashing::sha256::right_rotate(1, 30) == 4);</div>
@@ -700,15 +705,17 @@ Here is the call graph for this function:</div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d08/sha256_8cpp_source.html#l00286">286</a> of file <a class="el" href="../../d4/d08/sha256_8cpp_source.html">sha256.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  286</span>                          {</div>
 <div class="line"><span class="lineno">  287</span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a> {</div>
-<div class="line"><span class="lineno">  288</span>        <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> input;</div>
-<div class="line"><span class="lineno">  289</span>        <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> expected_hash;</div>
-<div class="line"><span class="lineno">  290</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> input, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> expected_hash)</div>
-<div class="line"><span class="lineno">  291</span>            : input(<a class="code hl_namespace" href="../../d8/dcc/namespacestd.html">std</a>::<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">move</a>(input)),</div>
-<div class="line"><span class="lineno">  292</span>              expected_hash(<a class="code hl_namespace" href="../../d8/dcc/namespacestd.html">std</a>::<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">move</a>(expected_hash)) {}</div>
+<div class="line"><span class="lineno">  288</span>        <span class="keyword">const</span> std::string input;</div>
+<div class="line"><span class="lineno">  289</span>        <span class="keyword">const</span> std::string expected_hash;</div>
+<div class="line"><span class="lineno">  290</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(std::string input, std::string expected_hash)</div>
+<div class="line"><span class="lineno">  291</span>            : input(std::move(input)),</div>
+<div class="line"><span class="lineno">  292</span>              expected_hash(std::move(expected_hash)) {}</div>
 <div class="line"><span class="lineno">  293</span>    };</div>
-<div class="line"><span class="lineno">  294</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;TestCase&gt;</a> test_cases{</div>
+<div class="line"><span class="lineno">  294</span>    <span class="keyword">const</span> std::vector&lt;TestCase&gt; test_cases{</div>
 <div class="line"><span class="lineno">  295</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(</div>
 <div class="line"><span class="lineno">  296</span>            <span class="stringliteral">&quot;&quot;</span>,</div>
 <div class="line"><span class="lineno">  297</span>            <span class="stringliteral">&quot;e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855&quot;</span>),</div>
@@ -725,11 +732,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  308</span>        assert(hashing::sha256::sha256(tc.input) == tc.expected_hash);</div>
 <div class="line"><span class="lineno">  309</span>    }</div>
 <div class="line"><span class="lineno">  310</span>}</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="amove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></div><div class="ttdeci">T move(T... args)</div></div>
-<div class="ttc" id="anamespacestd_html"><div class="ttname"><a href="../../d8/dcc/namespacestd.html">std</a></div><div class="ttdoc">STL namespace.</div></div>
-<div class="ttc" id="astruct_test_case_html"><div class="ttname"><a href="../../da/d86/struct_test_case.html">TestCase</a></div><div class="ttdoc">represents single example inputs and expected output of the function longest_common_string_length</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:54</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 class="ttc" id="astruct_test_case_html"><div class="ttname"><a href="../../da/d86/struct_test_case.html">TestCase</a></div><div class="ttdoc">represents single example inputs and expected output of the function longest_common_string_length</div><div class="ttdef"><b>Definition</b> <a href="../../da/d0d/longest__common__string_8cpp_source.html#l00054">longest_common_string.cpp:54</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/d4/d08/sha256_8cpp_a28c1c6724dc6bcf91a39818699bbec27_cgraph.map b/d4/d08/sha256_8cpp_a28c1c6724dc6bcf91a39818699bbec27_cgraph.map
deleted file mode 100644
index c1256261b..000000000
--- a/d4/d08/sha256_8cpp_a28c1c6724dc6bcf91a39818699bbec27_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="hashing::sha256::compute_padded_size" name="hashing::sha256::compute_padded_size">
-<area shape="rect" id="Node000001" title="Computes size of the padded input." alt="" coords="5,29,180,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="59,29,57,19,63,10,75,5,93,3,112,5,123,11,120,16,110,10,92,8,76,10,66,14,63,20,64,28"/>
-</map>
diff --git a/d4/d08/sha256_8cpp_a28c1c6724dc6bcf91a39818699bbec27_cgraph.md5 b/d4/d08/sha256_8cpp_a28c1c6724dc6bcf91a39818699bbec27_cgraph.md5
deleted file mode 100644
index 1526cac8f..000000000
--- a/d4/d08/sha256_8cpp_a28c1c6724dc6bcf91a39818699bbec27_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5302f01d8b4f06761d2a61164fddd47c
\ No newline at end of file
diff --git a/d4/d08/sha256_8cpp_a28c1c6724dc6bcf91a39818699bbec27_cgraph.svg b/d4/d08/sha256_8cpp_a28c1c6724dc6bcf91a39818699bbec27_cgraph.svg
deleted file mode 100644
index 0770406cc..000000000
--- a/d4/d08/sha256_8cpp_a28c1c6724dc6bcf91a39818699bbec27_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha256::compute_padded_size Pages: 1 -->
-<svg width="139pt" height="57pt"
- viewBox="0.00 0.00 138.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>hashing::sha256::compute_padded_size</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Computes size of the padded input.">
-<polygon fill="#999999" stroke="#666666" points="130.75,-30.5 0,-30.5 0,0 130.75,0 130.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::compute</text>
-<text text-anchor="middle" x="65.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_padded_size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.21,-30.99C37.48,-40.06 45.2,-48.5 65.38,-48.5 76.41,-48.5 83.72,-45.97 87.3,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.76,-42.81 88.38,-32.49 83.8,-42.04 90.76,-42.81"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d08/sha256_8cpp_a28c1c6724dc6bcf91a39818699bbec27_cgraph_org.svg b/d4/d08/sha256_8cpp_a28c1c6724dc6bcf91a39818699bbec27_cgraph_org.svg
deleted file mode 100644
index 9614d7043..000000000
--- a/d4/d08/sha256_8cpp_a28c1c6724dc6bcf91a39818699bbec27_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha256::compute_padded_size Pages: 1 -->
-<svg width="139pt" height="57pt"
- viewBox="0.00 0.00 138.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>hashing::sha256::compute_padded_size</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Computes size of the padded input.">
-<polygon fill="#999999" stroke="#666666" points="130.75,-30.5 0,-30.5 0,0 130.75,0 130.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::compute</text>
-<text text-anchor="middle" x="65.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_padded_size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.21,-30.99C37.48,-40.06 45.2,-48.5 65.38,-48.5 76.41,-48.5 83.72,-45.97 87.3,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.76,-42.81 88.38,-32.49 83.8,-42.04 90.76,-42.81"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d08/sha256_8cpp_a525531b3939ed44fbf01674e21931b3a_cgraph.map b/d4/d08/sha256_8cpp_a525531b3939ed44fbf01674e21931b3a_cgraph.map
deleted file mode 100644
index 3432d1520..000000000
--- a/d4/d08/sha256_8cpp_a525531b3939ed44fbf01674e21931b3a_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="hashing::sha256::create_message_schedule_array" name="hashing::sha256::create_message_schedule_array">
-<area shape="rect" id="Node000001" title="Creates the message schedule array." alt="" coords="5,99,182,139"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="51,99,49,89,56,80,71,74,94,72,118,74,132,81,130,86,116,80,93,77,72,79,59,84,54,90,57,97"/>
-<area shape="rect" id="Node000002" href="$d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da" title="Returns the character at pos after the input is padded." alt="" coords="230,65,404,90"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="182,100,228,91,229,97,183,105"/>
-<area shape="rect" id="Node000005" href="$d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c" title="Rotates the bits of a 32&#45;bit unsigned integer." alt="" coords="242,139,392,179"/>
-<area shape="poly" id="edge7_Node000001_Node000005" title=" " alt="" coords="183,132,227,140,226,146,182,137"/>
-<area shape="poly" id="edge5_Node000002_Node000002" title=" " alt="" coords="280,66,273,56,277,46,292,40,317,38,344,41,358,48,356,52,343,46,317,43,293,46,281,50,278,56,284,63"/>
-<area shape="rect" id="Node000003" href="$d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27" title="Computes size of the padded input." alt="" coords="452,29,626,70"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="404,64,436,60,437,65,405,69"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="478,94,600,120"/>
-<area shape="poly" id="edge6_Node000002_Node000004" title=" " alt="" coords="405,87,463,94,463,100,404,92"/>
-<area shape="poly" id="edge4_Node000003_Node000003" title=" " alt="" coords="497,29,495,19,502,10,517,5,539,3,563,5,578,11,575,16,562,10,539,8,518,10,505,15,500,21,502,28"/>
-<area shape="poly" id="edge8_Node000005_Node000005" title=" " alt="" coords="275,139,273,129,280,120,294,114,317,112,341,114,355,121,353,126,340,120,317,117,296,119,283,124,278,130,280,137"/>
-</map>
diff --git a/d4/d08/sha256_8cpp_a525531b3939ed44fbf01674e21931b3a_cgraph.md5 b/d4/d08/sha256_8cpp_a525531b3939ed44fbf01674e21931b3a_cgraph.md5
deleted file mode 100644
index 9c5418bed..000000000
--- a/d4/d08/sha256_8cpp_a525531b3939ed44fbf01674e21931b3a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ec2f16bf52a8fa6d2962d407a6f40a98
\ No newline at end of file
diff --git a/d4/d08/sha256_8cpp_a525531b3939ed44fbf01674e21931b3a_cgraph.svg b/d4/d08/sha256_8cpp_a525531b3939ed44fbf01674e21931b3a_cgraph.svg
deleted file mode 100644
index b55dfcb94..000000000
--- a/d4/d08/sha256_8cpp_a525531b3939ed44fbf01674e21931b3a_cgraph.svg
+++ /dev/null
@@ -1,158 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha256::create_message_schedule_array Pages: 1 -->
-<svg width="474pt" height="139pt"
- viewBox="0.00 0.00 473.75 138.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.5)">
-<title>hashing::sha256::create_message_schedule_array</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Creates the message schedule array.">
-<polygon fill="#999999" stroke="#666666" points="132.25,-60.5 0,-60.5 0,-30 132.25,-30 132.25,-60.5"/>
-<text text-anchor="start" x="8" y="-47" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::create</text>
-<text text-anchor="middle" x="66.12" y="-35.75" font-family="Helvetica,sans-Serif" font-size="10.00">_message_schedule_array</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.44,-60.99C30.39,-70.06 40.28,-78.5 66.12,-78.5 80.26,-78.5 89.62,-75.97 94.21,-72.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.65,-72.88 95.59,-62.48 90.72,-71.89 97.65,-72.88"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da" target="_top" xlink:title="Returns the character at pos after the input is padded.">
-<polygon fill="white" stroke="#666666" points="299,-85.88 168.25,-85.88 168.25,-66.62 299,-66.62 299,-85.88"/>
-<text text-anchor="middle" x="233.62" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::get_char</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.53,-57.5C143.99,-59.65 155.9,-61.88 167.35,-64.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.65,-67.45 177.12,-65.85 167.94,-60.57 166.65,-67.45"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c" target="_top" xlink:title="Rotates the bits of a 32&#45;bit unsigned integer.">
-<polygon fill="white" stroke="#666666" points="289.62,-30.5 177.62,-30.5 177.62,0 289.62,0 289.62,-30.5"/>
-<text text-anchor="start" x="185.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::right</text>
-<text text-anchor="middle" x="233.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_rotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge7_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge7_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.53,-33.39C143.53,-31.4 154.96,-29.33 165.99,-27.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.6,-30.78 175.81,-25.55 165.35,-23.89 166.6,-30.78"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge5_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge5_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.52,-86.16C195.61,-94.77 204.31,-103.88 233.62,-103.88 250.11,-103.88 260.08,-100.99 263.53,-96.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.86,-95.86 260.23,-87.59 260.25,-98.19 266.86,-95.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27" target="_top" xlink:title="Computes size of the padded input.">
-<polygon fill="white" stroke="#666666" points="465.75,-112.5 335,-112.5 335,-82 465.75,-82 465.75,-112.5"/>
-<text text-anchor="start" x="343" y="-99" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::compute</text>
-<text text-anchor="middle" x="400.38" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">_padded_size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.27,-84.49C307.17,-85.5 315.3,-86.53 323.35,-87.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.79,-91.02 333.15,-88.81 323.67,-84.07 322.79,-91.02"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="446.25,-63.88 354.5,-63.88 354.5,-44.62 446.25,-44.62 446.25,-63.88"/>
-<text text-anchor="middle" x="400.38" y="-50.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge6_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge6_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.27,-67.62C313.78,-65.68 329.06,-63.64 343.19,-61.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="343.3,-65.27 352.74,-60.48 342.37,-58.33 343.3,-65.27"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M370.83,-112.99C364.8,-122.06 374.65,-130.5 400.38,-130.5 414.45,-130.5 423.77,-127.97 428.34,-124.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="431.78,-124.88 429.71,-114.48 424.85,-123.9 431.78,-124.88"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge8_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge8_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.08,-30.99C198.05,-40.06 207.9,-48.5 233.62,-48.5 247.7,-48.5 257.02,-45.97 261.59,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.03,-42.88 262.96,-32.48 258.1,-41.9 265.03,-42.88"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d08/sha256_8cpp_a525531b3939ed44fbf01674e21931b3a_cgraph_org.svg b/d4/d08/sha256_8cpp_a525531b3939ed44fbf01674e21931b3a_cgraph_org.svg
deleted file mode 100644
index 43aed4cd8..000000000
--- a/d4/d08/sha256_8cpp_a525531b3939ed44fbf01674e21931b3a_cgraph_org.svg
+++ /dev/null
@@ -1,132 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha256::create_message_schedule_array Pages: 1 -->
-<svg width="474pt" height="139pt"
- viewBox="0.00 0.00 473.75 138.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.5)">
-<title>hashing::sha256::create_message_schedule_array</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Creates the message schedule array.">
-<polygon fill="#999999" stroke="#666666" points="132.25,-60.5 0,-60.5 0,-30 132.25,-30 132.25,-60.5"/>
-<text text-anchor="start" x="8" y="-47" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::create</text>
-<text text-anchor="middle" x="66.12" y="-35.75" font-family="Helvetica,sans-Serif" font-size="10.00">_message_schedule_array</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.44,-60.99C30.39,-70.06 40.28,-78.5 66.12,-78.5 80.26,-78.5 89.62,-75.97 94.21,-72.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.65,-72.88 95.59,-62.48 90.72,-71.89 97.65,-72.88"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da" target="_top" xlink:title="Returns the character at pos after the input is padded.">
-<polygon fill="white" stroke="#666666" points="299,-85.88 168.25,-85.88 168.25,-66.62 299,-66.62 299,-85.88"/>
-<text text-anchor="middle" x="233.62" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::get_char</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.53,-57.5C143.99,-59.65 155.9,-61.88 167.35,-64.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.65,-67.45 177.12,-65.85 167.94,-60.57 166.65,-67.45"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c" target="_top" xlink:title="Rotates the bits of a 32&#45;bit unsigned integer.">
-<polygon fill="white" stroke="#666666" points="289.62,-30.5 177.62,-30.5 177.62,0 289.62,0 289.62,-30.5"/>
-<text text-anchor="start" x="185.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::right</text>
-<text text-anchor="middle" x="233.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_rotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge7_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge7_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.53,-33.39C143.53,-31.4 154.96,-29.33 165.99,-27.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.6,-30.78 175.81,-25.55 165.35,-23.89 166.6,-30.78"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge5_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge5_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.52,-86.16C195.61,-94.77 204.31,-103.88 233.62,-103.88 250.11,-103.88 260.08,-100.99 263.53,-96.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.86,-95.86 260.23,-87.59 260.25,-98.19 266.86,-95.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27" target="_top" xlink:title="Computes size of the padded input.">
-<polygon fill="white" stroke="#666666" points="465.75,-112.5 335,-112.5 335,-82 465.75,-82 465.75,-112.5"/>
-<text text-anchor="start" x="343" y="-99" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::compute</text>
-<text text-anchor="middle" x="400.38" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">_padded_size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.27,-84.49C307.17,-85.5 315.3,-86.53 323.35,-87.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.79,-91.02 333.15,-88.81 323.67,-84.07 322.79,-91.02"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="446.25,-63.88 354.5,-63.88 354.5,-44.62 446.25,-44.62 446.25,-63.88"/>
-<text text-anchor="middle" x="400.38" y="-50.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge6_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge6_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.27,-67.62C313.78,-65.68 329.06,-63.64 343.19,-61.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="343.3,-65.27 352.74,-60.48 342.37,-58.33 343.3,-65.27"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M370.83,-112.99C364.8,-122.06 374.65,-130.5 400.38,-130.5 414.45,-130.5 423.77,-127.97 428.34,-124.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="431.78,-124.88 429.71,-114.48 424.85,-123.9 431.78,-124.88"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge8_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge8_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.08,-30.99C198.05,-40.06 207.9,-48.5 233.62,-48.5 247.7,-48.5 257.02,-45.97 261.59,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.03,-42.88 262.96,-32.48 258.1,-41.9 265.03,-42.88"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d08/sha256_8cpp_a55475649a2bb7aae15de0716a217f43a_cgraph.map b/d4/d08/sha256_8cpp_a55475649a2bb7aae15de0716a217f43a_cgraph.map
deleted file mode 100644
index 069bbd70b..000000000
--- a/d4/d08/sha256_8cpp_a55475649a2bb7aae15de0716a217f43a_cgraph.map
+++ /dev/null
@@ -1,32 +0,0 @@
-<map id="hashing::sha256::sha256" name="hashing::sha256::sha256">
-<area shape="rect" id="Node000001" title="Computes the final hash value." alt="" coords="5,213,172,238"/>
-<area shape="poly" id="edge13_Node000001_Node000001" title=" " alt="" coords="52,214,45,204,49,194,64,188,89,186,115,189,129,196,127,200,114,194,88,191,65,194,53,198,50,204,56,211"/>
-<area shape="rect" id="Node000002" href="$d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27" title="Computes size of the padded input." alt="" coords="666,29,841,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="100,210,149,162,182,134,218,110,273,81,322,59,366,45,410,36,502,31,618,35,651,37,650,42,618,40,502,36,410,41,368,50,324,64,276,85,221,115,185,139,152,166,104,214"/>
-<area shape="rect" id="Node000003" href="$d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a" title="Creates the message schedule array." alt="" coords="220,148,396,189"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="140,210,212,191,213,196,141,215"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="692,134,815,160"/>
-<area shape="poly" id="edge12_Node000001_Node000005" title=" " alt="" coords="172,227,264,229,376,227,498,217,618,198,667,183,711,164,714,169,669,188,619,203,498,222,376,232,264,234,172,233"/>
-<area shape="rect" id="Node000007" href="$d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" title=" " alt="" coords="289,264,327,289"/>
-<area shape="poly" id="edge11_Node000001_Node000007" title=" " alt="" coords="148,237,274,266,273,271,147,242"/>
-<area shape="rect" id="Node000008" href="$d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08" title="Convert the hash to a hexadecimal string." alt="" coords="230,313,386,354"/>
-<area shape="poly" id="edge14_Node000001_Node000008" title=" " alt="" coords="111,237,160,267,221,299,233,305,231,309,218,304,158,272,109,241"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="712,29,709,19,716,10,731,5,754,3,778,5,792,11,790,16,776,10,753,8,732,10,719,15,715,21,717,28"/>
-<area shape="poly" id="edge4_Node000003_Node000003" title=" " alt="" coords="266,148,264,138,271,129,286,123,308,121,332,124,346,130,344,135,330,129,308,127,287,129,274,133,270,139,272,147"/>
-<area shape="rect" id="Node000004" href="$d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da" title="Returns the character at pos after the input is padded." alt="" coords="444,74,618,100"/>
-<area shape="poly" id="edge5_Node000003_Node000004" title=" " alt="" coords="355,145,443,110,466,102,467,107,445,115,357,150"/>
-<area shape="rect" id="Node000006" href="$d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c" title="Rotates the bits of a 32&#45;bit unsigned integer." alt="" coords="456,148,606,189"/>
-<area shape="poly" id="edge9_Node000003_Node000006" title=" " alt="" coords="396,166,441,166,441,171,396,171"/>
-<area shape="poly" id="edge6_Node000004_Node000002" title=" " alt="" coords="611,71,651,64,652,69,612,76"/>
-<area shape="poly" id="edge7_Node000004_Node000004" title=" " alt="" coords="494,75,487,66,491,56,506,50,531,48,558,50,572,57,570,62,557,55,531,53,508,55,495,60,492,65,498,72"/>
-<area shape="poly" id="edge8_Node000004_Node000005" title=" " alt="" coords="583,98,689,127,688,132,581,103"/>
-<area shape="poly" id="edge10_Node000006_Node000006" title=" " alt="" coords="489,148,487,138,494,129,509,123,531,121,555,124,570,130,567,135,554,129,531,127,510,129,497,133,492,139,494,147"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/hex.html#" title=" " alt="" coords="497,268,565,293"/>
-<area shape="poly" id="edge15_Node000008_Node000009" title=" " alt="" coords="385,313,481,289,482,295,386,318"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setfill.html#" title=" " alt="" coords="492,317,570,342"/>
-<area shape="poly" id="edge16_Node000008_Node000010" title=" " alt="" coords="386,330,477,328,477,333,386,335"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setw.html#" title=" " alt="" coords="494,366,569,392"/>
-<area shape="poly" id="edge17_Node000008_Node000011" title=" " alt="" coords="386,347,479,366,478,371,385,352"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_stringstream/str.html#" title=" " alt="" coords="460,416,602,441"/>
-<area shape="poly" id="edge18_Node000008_Node000012" title=" " alt="" coords="345,352,392,377,445,402,462,408,460,413,443,407,389,382,342,357"/>
-</map>
diff --git a/d4/d08/sha256_8cpp_a55475649a2bb7aae15de0716a217f43a_cgraph.md5 b/d4/d08/sha256_8cpp_a55475649a2bb7aae15de0716a217f43a_cgraph.md5
deleted file mode 100644
index dfde8dfc9..000000000
--- a/d4/d08/sha256_8cpp_a55475649a2bb7aae15de0716a217f43a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-512c87b976a91f9fb71d08e8b4a8372c
\ No newline at end of file
diff --git a/d4/d08/sha256_8cpp_a55475649a2bb7aae15de0716a217f43a_cgraph.svg b/d4/d08/sha256_8cpp_a55475649a2bb7aae15de0716a217f43a_cgraph.svg
deleted file mode 100644
index 09ffe6906..000000000
--- a/d4/d08/sha256_8cpp_a55475649a2bb7aae15de0716a217f43a_cgraph.svg
+++ /dev/null
@@ -1,369 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha256::sha256 Pages: 1 -->
-<!--zoomable 335 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 635;
-var viewHeight = 335;
-var sectionId = 'dynsection-7';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>hashing::sha256::sha256</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Computes the final hash value.">
-<polygon fill="#999999" stroke="#666666" points="124.75,-171.25 0,-171.25 0,-152 124.75,-152 124.75,-171.25"/>
-<text text-anchor="middle" x="62.38" y="-157.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::sha256</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge13_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge13_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.62,-171.54C24.87,-180.15 33.46,-189.25 62.38,-189.25 78.64,-189.25 88.47,-186.37 91.87,-182.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.21,-181.27 88.62,-172.97 88.6,-183.56 95.21,-181.27"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27" target="_top" xlink:title="Computes size of the padded input.">
-<polygon fill="white" stroke="#666666" points="626.5,-308.88 495.75,-308.88 495.75,-278.38 626.5,-278.38 626.5,-308.88"/>
-<text text-anchor="start" x="503.75" y="-295.38" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::compute</text>
-<text text-anchor="middle" x="561.12" y="-284.12" font-family="Helvetica,sans-Serif" font-size="10.00">_padded_size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.33,-171.72C88.4,-189.27 123.93,-225.57 160.75,-246.62 278.11,-313.74 324.69,-308.67 459.75,-302.62 467.59,-302.27 475.77,-301.77 483.92,-301.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="484.18,-304.67 493.88,-300.4 483.64,-297.69 484.18,-304.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a" target="_top" xlink:title="Creates the message schedule array.">
-<polygon fill="white" stroke="#666666" points="293,-219.88 160.75,-219.88 160.75,-189.38 293,-189.38 293,-219.88"/>
-<text text-anchor="start" x="168.75" y="-206.38" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::create</text>
-<text text-anchor="middle" x="226.88" y="-195.12" font-family="Helvetica,sans-Serif" font-size="10.00">_message_schedule_array</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.47,-171.71C117.55,-175.96 136.81,-181.06 155.31,-185.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.37,-189.32 164.93,-188.5 156.16,-182.56 154.37,-189.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="607,-230.25 515.25,-230.25 515.25,-211 607,-211 607,-230.25"/>
-<text text-anchor="middle" x="561.12" y="-216.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge12_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge12_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.96,-158.34C203.61,-155.57 343.44,-155.4 459.75,-180.62 484.38,-185.97 510.81,-196.72 530.37,-205.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="528.84,-208.88 539.37,-210 531.83,-202.56 528.84,-208.88"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="241.28,-133.25 212.47,-133.25 212.47,-114 241.28,-114 241.28,-133.25"/>
-<text text-anchor="middle" x="226.88" y="-119.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge11_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge11_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.5,-151.54C136.72,-144.47 176.04,-135.28 201.13,-129.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.78,-132.85 210.72,-127.17 200.19,-126.04 201.78,-132.85"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08" target="_top" xlink:title="Convert the hash to a hexadecimal string.">
-<polygon fill="white" stroke="#666666" points="285.12,-95.88 168.62,-95.88 168.62,-65.38 285.12,-65.38 285.12,-95.88"/>
-<text text-anchor="start" x="176.62" y="-82.38" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::Hash</text>
-<text text-anchor="middle" x="226.88" y="-71.12" font-family="Helvetica,sans-Serif" font-size="10.00">::to_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge14_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge14_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M78.43,-151.68C97.19,-139.56 130.46,-118.93 160.75,-104.62 163.66,-103.25 166.67,-101.9 169.74,-100.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.93,-103.88 178.86,-96.84 168.28,-97.4 170.93,-103.88"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M531.58,-309.36C525.55,-318.43 535.4,-326.88 561.12,-326.88 575.2,-326.88 584.52,-324.35 589.09,-320.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="592.53,-321.25 590.46,-310.86 585.6,-320.27 592.53,-321.25"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.73,-220.36C191.78,-229.43 201.49,-237.88 226.88,-237.88 240.76,-237.88 249.95,-235.35 254.46,-231.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.9,-232.25 255.82,-221.86 250.97,-231.28 257.9,-232.25"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da" target="_top" xlink:title="Returns the character at pos after the input is padded.">
-<polygon fill="white" stroke="#666666" points="459.75,-275.25 329,-275.25 329,-256 459.75,-256 459.75,-275.25"/>
-<text text-anchor="middle" x="394.38" y="-261.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::get_char</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge5_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge5_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.08,-220.33C282.36,-228.66 306.78,-238.76 329,-246.62 334.42,-248.54 340.15,-250.43 345.85,-252.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.7,-255.53 355.28,-255.1 346.74,-248.84 344.7,-255.53"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c" target="_top" xlink:title="Rotates the bits of a 32&#45;bit unsigned integer.">
-<polygon fill="white" stroke="#666666" points="450.38,-219.88 338.38,-219.88 338.38,-189.38 450.38,-189.38 450.38,-219.88"/>
-<text text-anchor="start" x="346.38" y="-206.38" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::right</text>
-<text text-anchor="middle" x="394.38" y="-195.12" font-family="Helvetica,sans-Serif" font-size="10.00">_rotate</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge9_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge9_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.28,-204.62C304.28,-204.62 315.71,-204.62 326.74,-204.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.54,-208.13 336.54,-204.63 326.54,-201.13 326.54,-208.13"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge6_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge6_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M454.85,-275.73C464.43,-277.36 474.45,-279.06 484.35,-280.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="483.5,-284.15 493.95,-282.38 484.68,-277.25 483.5,-284.15"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge7_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge7_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M368.27,-275.54C356.36,-284.15 365.06,-293.25 394.38,-293.25 410.86,-293.25 420.83,-290.37 424.28,-286.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="427.61,-285.24 420.98,-276.97 421,-287.56 427.61,-285.24"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge8_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge8_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M432.35,-255.53C455.98,-249.07 486.87,-240.63 512.36,-233.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="513.09,-237.1 521.82,-231.09 511.25,-230.35 513.09,-237.1"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge10_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge10_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M364.83,-220.36C358.8,-229.43 368.65,-237.88 394.38,-237.88 408.45,-237.88 417.77,-235.35 422.34,-231.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="425.78,-232.25 423.71,-221.86 418.85,-231.27 425.78,-232.25"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/hex.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="420,-130.25 368.75,-130.25 368.75,-111 420,-111 420,-130.25"/>
-<text text-anchor="middle" x="394.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::hex</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge15_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge15_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.29,-94.5C309.24,-100.29 336.32,-106.84 357.38,-111.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="356.39,-115.29 366.94,-114.23 358.04,-108.48 356.39,-115.29"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="423.75,-93.25 365,-93.25 365,-74 423.75,-74 423.75,-93.25"/>
-<text text-anchor="middle" x="394.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge16_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge16_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.29,-81.67C307.77,-82.07 333.01,-82.53 353.44,-82.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="353.28,-86.4 363.34,-83.08 353.41,-79.4 353.28,-86.4"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="422.62,-56.25 366.12,-56.25 366.12,-37 422.62,-37 422.62,-56.25"/>
-<text text-anchor="middle" x="394.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node11 -->
-<g id="edge17_Node000008_Node000011" class="edge">
-<title>Node8&#45;&gt;Node11</title>
-<g id="a_edge17_Node000008_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.29,-68.83C308.19,-64.13 333.95,-58.83 354.57,-54.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.18,-58.04 364.28,-52.6 353.78,-51.19 355.18,-58.04"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="447.75,-19.25 341,-19.25 341,0 447.75,0 447.75,-19.25"/>
-<text text-anchor="middle" x="394.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stringstream::str</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node12 -->
-<g id="edge18_Node000008_Node000012" class="edge">
-<title>Node8&#45;&gt;Node12</title>
-<g id="a_edge18_Node000008_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.77,-65.11C273.79,-53.6 302.47,-38.15 329,-27.62 333.07,-26.01 337.34,-24.48 341.66,-23.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="342.48,-26.46 350.98,-20.13 340.39,-19.78 342.48,-26.46"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="sha256_8cpp_a55475649a2bb7aae15de0716a217f43a_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d08/sha256_8cpp_a55475649a2bb7aae15de0716a217f43a_cgraph_org.svg b/d4/d08/sha256_8cpp_a55475649a2bb7aae15de0716a217f43a_cgraph_org.svg
deleted file mode 100644
index a5857b1c4..000000000
--- a/d4/d08/sha256_8cpp_a55475649a2bb7aae15de0716a217f43a_cgraph_org.svg
+++ /dev/null
@@ -1,286 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha256::sha256 Pages: 1 -->
-<svg width="635pt" height="335pt"
- viewBox="0.00 0.00 634.50 334.88" 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 330.88)">
-<title>hashing::sha256::sha256</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Computes the final hash value.">
-<polygon fill="#999999" stroke="#666666" points="124.75,-171.25 0,-171.25 0,-152 124.75,-152 124.75,-171.25"/>
-<text text-anchor="middle" x="62.38" y="-157.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::sha256</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge13_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge13_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.62,-171.54C24.87,-180.15 33.46,-189.25 62.38,-189.25 78.64,-189.25 88.47,-186.37 91.87,-182.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.21,-181.27 88.62,-172.97 88.6,-183.56 95.21,-181.27"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27" target="_top" xlink:title="Computes size of the padded input.">
-<polygon fill="white" stroke="#666666" points="626.5,-308.88 495.75,-308.88 495.75,-278.38 626.5,-278.38 626.5,-308.88"/>
-<text text-anchor="start" x="503.75" y="-295.38" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::compute</text>
-<text text-anchor="middle" x="561.12" y="-284.12" font-family="Helvetica,sans-Serif" font-size="10.00">_padded_size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.33,-171.72C88.4,-189.27 123.93,-225.57 160.75,-246.62 278.11,-313.74 324.69,-308.67 459.75,-302.62 467.59,-302.27 475.77,-301.77 483.92,-301.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="484.18,-304.67 493.88,-300.4 483.64,-297.69 484.18,-304.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a" target="_top" xlink:title="Creates the message schedule array.">
-<polygon fill="white" stroke="#666666" points="293,-219.88 160.75,-219.88 160.75,-189.38 293,-189.38 293,-219.88"/>
-<text text-anchor="start" x="168.75" y="-206.38" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::create</text>
-<text text-anchor="middle" x="226.88" y="-195.12" font-family="Helvetica,sans-Serif" font-size="10.00">_message_schedule_array</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.47,-171.71C117.55,-175.96 136.81,-181.06 155.31,-185.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.37,-189.32 164.93,-188.5 156.16,-182.56 154.37,-189.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="607,-230.25 515.25,-230.25 515.25,-211 607,-211 607,-230.25"/>
-<text text-anchor="middle" x="561.12" y="-216.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge12_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge12_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.96,-158.34C203.61,-155.57 343.44,-155.4 459.75,-180.62 484.38,-185.97 510.81,-196.72 530.37,-205.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="528.84,-208.88 539.37,-210 531.83,-202.56 528.84,-208.88"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="241.28,-133.25 212.47,-133.25 212.47,-114 241.28,-114 241.28,-133.25"/>
-<text text-anchor="middle" x="226.88" y="-119.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge11_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge11_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.5,-151.54C136.72,-144.47 176.04,-135.28 201.13,-129.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.78,-132.85 210.72,-127.17 200.19,-126.04 201.78,-132.85"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08" target="_top" xlink:title="Convert the hash to a hexadecimal string.">
-<polygon fill="white" stroke="#666666" points="285.12,-95.88 168.62,-95.88 168.62,-65.38 285.12,-65.38 285.12,-95.88"/>
-<text text-anchor="start" x="176.62" y="-82.38" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::Hash</text>
-<text text-anchor="middle" x="226.88" y="-71.12" font-family="Helvetica,sans-Serif" font-size="10.00">::to_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge14_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge14_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M78.43,-151.68C97.19,-139.56 130.46,-118.93 160.75,-104.62 163.66,-103.25 166.67,-101.9 169.74,-100.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.93,-103.88 178.86,-96.84 168.28,-97.4 170.93,-103.88"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M531.58,-309.36C525.55,-318.43 535.4,-326.88 561.12,-326.88 575.2,-326.88 584.52,-324.35 589.09,-320.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="592.53,-321.25 590.46,-310.86 585.6,-320.27 592.53,-321.25"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.73,-220.36C191.78,-229.43 201.49,-237.88 226.88,-237.88 240.76,-237.88 249.95,-235.35 254.46,-231.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.9,-232.25 255.82,-221.86 250.97,-231.28 257.9,-232.25"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da" target="_top" xlink:title="Returns the character at pos after the input is padded.">
-<polygon fill="white" stroke="#666666" points="459.75,-275.25 329,-275.25 329,-256 459.75,-256 459.75,-275.25"/>
-<text text-anchor="middle" x="394.38" y="-261.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::get_char</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge5_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge5_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.08,-220.33C282.36,-228.66 306.78,-238.76 329,-246.62 334.42,-248.54 340.15,-250.43 345.85,-252.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.7,-255.53 355.28,-255.1 346.74,-248.84 344.7,-255.53"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c" target="_top" xlink:title="Rotates the bits of a 32&#45;bit unsigned integer.">
-<polygon fill="white" stroke="#666666" points="450.38,-219.88 338.38,-219.88 338.38,-189.38 450.38,-189.38 450.38,-219.88"/>
-<text text-anchor="start" x="346.38" y="-206.38" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::right</text>
-<text text-anchor="middle" x="394.38" y="-195.12" font-family="Helvetica,sans-Serif" font-size="10.00">_rotate</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge9_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge9_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.28,-204.62C304.28,-204.62 315.71,-204.62 326.74,-204.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.54,-208.13 336.54,-204.63 326.54,-201.13 326.54,-208.13"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge6_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge6_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M454.85,-275.73C464.43,-277.36 474.45,-279.06 484.35,-280.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="483.5,-284.15 493.95,-282.38 484.68,-277.25 483.5,-284.15"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge7_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge7_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M368.27,-275.54C356.36,-284.15 365.06,-293.25 394.38,-293.25 410.86,-293.25 420.83,-290.37 424.28,-286.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="427.61,-285.24 420.98,-276.97 421,-287.56 427.61,-285.24"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge8_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge8_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M432.35,-255.53C455.98,-249.07 486.87,-240.63 512.36,-233.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="513.09,-237.1 521.82,-231.09 511.25,-230.35 513.09,-237.1"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge10_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge10_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M364.83,-220.36C358.8,-229.43 368.65,-237.88 394.38,-237.88 408.45,-237.88 417.77,-235.35 422.34,-231.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="425.78,-232.25 423.71,-221.86 418.85,-231.27 425.78,-232.25"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/hex.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="420,-130.25 368.75,-130.25 368.75,-111 420,-111 420,-130.25"/>
-<text text-anchor="middle" x="394.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::hex</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge15_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge15_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.29,-94.5C309.24,-100.29 336.32,-106.84 357.38,-111.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="356.39,-115.29 366.94,-114.23 358.04,-108.48 356.39,-115.29"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="423.75,-93.25 365,-93.25 365,-74 423.75,-74 423.75,-93.25"/>
-<text text-anchor="middle" x="394.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge16_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge16_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.29,-81.67C307.77,-82.07 333.01,-82.53 353.44,-82.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="353.28,-86.4 363.34,-83.08 353.41,-79.4 353.28,-86.4"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="422.62,-56.25 366.12,-56.25 366.12,-37 422.62,-37 422.62,-56.25"/>
-<text text-anchor="middle" x="394.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node11 -->
-<g id="edge17_Node000008_Node000011" class="edge">
-<title>Node8&#45;&gt;Node11</title>
-<g id="a_edge17_Node000008_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.29,-68.83C308.19,-64.13 333.95,-58.83 354.57,-54.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.18,-58.04 364.28,-52.6 353.78,-51.19 355.18,-58.04"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="447.75,-19.25 341,-19.25 341,0 447.75,0 447.75,-19.25"/>
-<text text-anchor="middle" x="394.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stringstream::str</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node12 -->
-<g id="edge18_Node000008_Node000012" class="edge">
-<title>Node8&#45;&gt;Node12</title>
-<g id="a_edge18_Node000008_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.77,-65.11C273.79,-53.6 302.47,-38.15 329,-27.62 333.07,-26.01 337.34,-24.48 341.66,-23.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="342.48,-26.46 350.98,-20.13 340.39,-19.78 342.48,-26.46"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d08/sha256_8cpp_a9e98c180d32b04aab6f767cb0c13e1da_cgraph.map b/d4/d08/sha256_8cpp_a9e98c180d32b04aab6f767cb0c13e1da_cgraph.map
deleted file mode 100644
index 57b6b06f8..000000000
--- a/d4/d08/sha256_8cpp_a9e98c180d32b04aab6f767cb0c13e1da_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="hashing::sha256::get_char" name="hashing::sha256::get_char">
-<area shape="rect" id="Node000001" title="Returns the character at pos after the input is padded." alt="" coords="5,66,180,92"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="56,67,48,58,53,48,68,42,93,40,120,42,134,49,131,54,118,47,92,45,69,47,56,52,54,57,60,64"/>
-<area shape="rect" id="Node000002" href="$d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27" title="Computes size of the padded input." alt="" coords="228,29,402,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="180,65,212,61,212,66,180,70"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="254,94,376,120"/>
-<area shape="poly" id="edge4_Node000001_Node000003" title=" " alt="" coords="180,87,239,95,238,100,180,93"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="273,29,271,19,278,10,292,5,315,3,339,5,353,11,351,16,338,10,315,8,294,10,281,15,276,21,278,28"/>
-</map>
diff --git a/d4/d08/sha256_8cpp_a9e98c180d32b04aab6f767cb0c13e1da_cgraph.md5 b/d4/d08/sha256_8cpp_a9e98c180d32b04aab6f767cb0c13e1da_cgraph.md5
deleted file mode 100644
index fc8366788..000000000
--- a/d4/d08/sha256_8cpp_a9e98c180d32b04aab6f767cb0c13e1da_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f109cbd289c4aa7ecc0d801ad85ac303
\ No newline at end of file
diff --git a/d4/d08/sha256_8cpp_a9e98c180d32b04aab6f767cb0c13e1da_cgraph.svg b/d4/d08/sha256_8cpp_a9e98c180d32b04aab6f767cb0c13e1da_cgraph.svg
deleted file mode 100644
index ab44cf9f2..000000000
--- a/d4/d08/sha256_8cpp_a9e98c180d32b04aab6f767cb0c13e1da_cgraph.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha256::get_char Pages: 1 -->
-<svg width="306pt" height="94pt"
- viewBox="0.00 0.00 305.50 93.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89.88)">
-<title>hashing::sha256::get_char</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Returns the character at pos after the input is padded.">
-<polygon fill="#999999" stroke="#666666" points="130.75,-40.25 0,-40.25 0,-21 130.75,-21 130.75,-40.25"/>
-<text text-anchor="middle" x="65.38" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::get_char</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.27,-40.54C27.36,-49.15 36.06,-58.25 65.38,-58.25 81.86,-58.25 91.83,-55.37 95.28,-51.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.61,-50.24 91.98,-41.97 92,-52.56 98.61,-50.24"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27" target="_top" xlink:title="Computes size of the padded input.">
-<polygon fill="white" stroke="#666666" points="297.5,-67.88 166.75,-67.88 166.75,-37.38 297.5,-37.38 297.5,-67.88"/>
-<text text-anchor="start" x="174.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::compute</text>
-<text text-anchor="middle" x="232.12" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_padded_size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.02,-39.26C138.92,-40.31 147.05,-41.4 155.1,-42.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.52,-45.93 164.9,-43.78 155.45,-38.99 154.52,-45.93"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278,-19.25 186.25,-19.25 186.25,0 278,0 278,-19.25"/>
-<text text-anchor="middle" x="232.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.02,-22.39C145.53,-20.54 160.81,-18.59 174.94,-16.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.02,-20.31 184.49,-15.57 174.13,-13.36 175.02,-20.31"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.58,-68.36C196.55,-77.43 206.4,-85.88 232.12,-85.88 246.2,-85.88 255.52,-83.35 260.09,-79.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="263.53,-80.25 261.46,-69.86 256.6,-79.27 263.53,-80.25"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d08/sha256_8cpp_a9e98c180d32b04aab6f767cb0c13e1da_cgraph_org.svg b/d4/d08/sha256_8cpp_a9e98c180d32b04aab6f767cb0c13e1da_cgraph_org.svg
deleted file mode 100644
index 7279a353f..000000000
--- a/d4/d08/sha256_8cpp_a9e98c180d32b04aab6f767cb0c13e1da_cgraph_org.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha256::get_char Pages: 1 -->
-<svg width="306pt" height="94pt"
- viewBox="0.00 0.00 305.50 93.88" 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.88)">
-<title>hashing::sha256::get_char</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Returns the character at pos after the input is padded.">
-<polygon fill="#999999" stroke="#666666" points="130.75,-40.25 0,-40.25 0,-21 130.75,-21 130.75,-40.25"/>
-<text text-anchor="middle" x="65.38" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::get_char</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.27,-40.54C27.36,-49.15 36.06,-58.25 65.38,-58.25 81.86,-58.25 91.83,-55.37 95.28,-51.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.61,-50.24 91.98,-41.97 92,-52.56 98.61,-50.24"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27" target="_top" xlink:title="Computes size of the padded input.">
-<polygon fill="white" stroke="#666666" points="297.5,-67.88 166.75,-67.88 166.75,-37.38 297.5,-37.38 297.5,-67.88"/>
-<text text-anchor="start" x="174.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::compute</text>
-<text text-anchor="middle" x="232.12" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_padded_size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.02,-39.26C138.92,-40.31 147.05,-41.4 155.1,-42.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.52,-45.93 164.9,-43.78 155.45,-38.99 154.52,-45.93"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278,-19.25 186.25,-19.25 186.25,0 278,0 278,-19.25"/>
-<text text-anchor="middle" x="232.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.02,-22.39C145.53,-20.54 160.81,-18.59 174.94,-16.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.02,-20.31 184.49,-15.57 174.13,-13.36 175.02,-20.31"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.58,-68.36C196.55,-77.43 206.4,-85.88 232.12,-85.88 246.2,-85.88 255.52,-83.35 260.09,-79.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="263.53,-80.25 261.46,-69.86 256.6,-79.27 263.53,-80.25"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d08/sha256_8cpp_adbcd504103c342a4da718f8fce6ff06c_cgraph.map b/d4/d08/sha256_8cpp_adbcd504103c342a4da718f8fce6ff06c_cgraph.map
deleted file mode 100644
index 607ca8b77..000000000
--- a/d4/d08/sha256_8cpp_adbcd504103c342a4da718f8fce6ff06c_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="hashing::sha256::right_rotate" name="hashing::sha256::right_rotate">
-<area shape="rect" id="Node000001" title="Rotates the bits of a 32&#45;bit unsigned integer." alt="" coords="5,29,155,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="51,29,50,19,54,11,65,5,80,3,97,5,106,11,104,16,95,10,80,8,66,10,58,14,55,20,56,28"/>
-</map>
diff --git a/d4/d08/sha256_8cpp_adbcd504103c342a4da718f8fce6ff06c_cgraph.md5 b/d4/d08/sha256_8cpp_adbcd504103c342a4da718f8fce6ff06c_cgraph.md5
deleted file mode 100644
index 0bc4f94af..000000000
--- a/d4/d08/sha256_8cpp_adbcd504103c342a4da718f8fce6ff06c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f072e1b75da14f84ed5f784bad20048e
\ No newline at end of file
diff --git a/d4/d08/sha256_8cpp_adbcd504103c342a4da718f8fce6ff06c_cgraph.svg b/d4/d08/sha256_8cpp_adbcd504103c342a4da718f8fce6ff06c_cgraph.svg
deleted file mode 100644
index 1b6efb921..000000000
--- a/d4/d08/sha256_8cpp_adbcd504103c342a4da718f8fce6ff06c_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha256::right_rotate Pages: 1 -->
-<svg width="120pt" height="57pt"
- viewBox="0.00 0.00 120.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>hashing::sha256::right_rotate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Rotates the bits of a 32&#45;bit unsigned integer.">
-<polygon fill="#999999" stroke="#666666" points="112,-30.5 0,-30.5 0,0 112,0 112,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::right</text>
-<text text-anchor="middle" x="56" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_rotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.15,-30.99C32.1,-40.06 38.72,-48.5 56,-48.5 65.45,-48.5 71.71,-45.97 74.78,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.24,-42.78 75.7,-32.49 71.27,-42.12 78.24,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d08/sha256_8cpp_adbcd504103c342a4da718f8fce6ff06c_cgraph_org.svg b/d4/d08/sha256_8cpp_adbcd504103c342a4da718f8fce6ff06c_cgraph_org.svg
deleted file mode 100644
index 1fabac4e7..000000000
--- a/d4/d08/sha256_8cpp_adbcd504103c342a4da718f8fce6ff06c_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha256::right_rotate Pages: 1 -->
-<svg width="120pt" height="57pt"
- viewBox="0.00 0.00 120.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>hashing::sha256::right_rotate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Rotates the bits of a 32&#45;bit unsigned integer.">
-<polygon fill="#999999" stroke="#666666" points="112,-30.5 0,-30.5 0,0 112,0 112,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::right</text>
-<text text-anchor="middle" x="56" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_rotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.15,-30.99C32.1,-40.06 38.72,-48.5 56,-48.5 65.45,-48.5 71.71,-45.97 74.78,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.24,-42.78 75.7,-32.49 71.27,-42.12 78.24,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d08/sha256_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d08/sha256_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index cc0f19d61..000000000
--- a/d4/d08/sha256_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" title=" " alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/d4/d08/sha256_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d08/sha256_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 133642d61..000000000
--- a/d4/d08/sha256_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-45a93b7dd32655ba8027ce8e55842be5
\ No newline at end of file
diff --git a/d4/d08/sha256_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d08/sha256_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index cfe500a18..000000000
--- a/d4/d08/sha256_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d08/sha256_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/d08/sha256_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 1d3bc748a..000000000
--- a/d4/d08/sha256_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d08/sha256_8cpp_afea411191ec5281f43e91ea327984627_cgraph.map b/d4/d08/sha256_8cpp_afea411191ec5281f43e91ea327984627_cgraph.map
deleted file mode 100644
index 8e7d2361a..000000000
--- a/d4/d08/sha256_8cpp_afea411191ec5281f43e91ea327984627_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="hashing::sha256::extract_byte" name="hashing::sha256::extract_byte">
-<area shape="rect" id="Node000001" title="Returns the byte at position byte_num in in_value." alt="" coords="5,29,202,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="71,30,64,21,68,11,81,5,104,3,128,5,140,12,137,17,126,10,103,8,83,10,72,15,69,20,75,27"/>
-</map>
diff --git a/d4/d08/sha256_8cpp_afea411191ec5281f43e91ea327984627_cgraph.md5 b/d4/d08/sha256_8cpp_afea411191ec5281f43e91ea327984627_cgraph.md5
deleted file mode 100644
index e9fee38ea..000000000
--- a/d4/d08/sha256_8cpp_afea411191ec5281f43e91ea327984627_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-25cbb138a137fa1ceba615b733f23613
\ No newline at end of file
diff --git a/d4/d08/sha256_8cpp_afea411191ec5281f43e91ea327984627_cgraph.svg b/d4/d08/sha256_8cpp_afea411191ec5281f43e91ea327984627_cgraph.svg
deleted file mode 100644
index 24bca1a1d..000000000
--- a/d4/d08/sha256_8cpp_afea411191ec5281f43e91ea327984627_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha256::extract_byte Pages: 1 -->
-<svg width="155pt" height="45pt"
- viewBox="0.00 0.00 155.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>hashing::sha256::extract_byte</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Returns the byte at position byte_num in in_value.">
-<polygon fill="#999999" stroke="#666666" points="147.25,-19.25 0,-19.25 0,0 147.25,0 147.25,-19.25"/>
-<text text-anchor="middle" x="73.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::extract_byte</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M50.57,-19.54C40.06,-28.15 47.74,-37.25 73.62,-37.25 88.18,-37.25 96.99,-34.37 100.03,-30.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.44,-29.49 97.13,-20.98 96.75,-31.57 103.44,-29.49"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d08/sha256_8cpp_afea411191ec5281f43e91ea327984627_cgraph_org.svg b/d4/d08/sha256_8cpp_afea411191ec5281f43e91ea327984627_cgraph_org.svg
deleted file mode 100644
index 715300cdf..000000000
--- a/d4/d08/sha256_8cpp_afea411191ec5281f43e91ea327984627_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha256::extract_byte Pages: 1 -->
-<svg width="155pt" height="45pt"
- viewBox="0.00 0.00 155.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>hashing::sha256::extract_byte</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Returns the byte at position byte_num in in_value.">
-<polygon fill="#999999" stroke="#666666" points="147.25,-19.25 0,-19.25 0,0 147.25,0 147.25,-19.25"/>
-<text text-anchor="middle" x="73.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::extract_byte</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M50.57,-19.54C40.06,-28.15 47.74,-37.25 73.62,-37.25 88.18,-37.25 96.99,-34.37 100.03,-30.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.44,-29.49 97.13,-20.98 96.75,-31.57 103.44,-29.49"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d08/sha256_8cpp_source.html b/d4/d08/sha256_8cpp_source.html
new file mode 100644
index 000000000..51d901242
--- /dev/null
+++ b/d4/d08/sha256_8cpp_source.html
@@ -0,0 +1,425 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: hashing/sha256.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d08/sha256_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">sha256.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/d08/sha256_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;array&gt;</span>     </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;cstdint&gt;</span>   </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;iomanip&gt;</span>   </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;sstream&gt;</span>   </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;utility&gt;</span>   </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/d0c/namespacehashing.html">hashing</a> {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keyword">namespace </span><a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#a55475649a2bb7aae15de0716a217f43a">sha256</a> {</div>
+<div class="foldopen" id="foldopen00040" data-start="{" data-end="};">
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../d6/d84/classhashing_1_1sha256_1_1_hash.html">   40</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d6/d84/classhashing_1_1sha256_1_1_hash.html">Hash</a> {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="comment">// Initialize array of hash values with first 32 bits of the fractional</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="comment">// parts of the square roots of the first 8 primes 2..19</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    std::array&lt;uint32_t, 8&gt; hash = {0x6A09E667, 0xBB67AE85, 0x3C6EF372,</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>                                    0xA54FF53A, 0x510E527F, 0x9B05688C,</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>                                    0x1F83D9AB, 0x5BE0CD19};</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3">update</a>(<span class="keyword">const</span> std::array&lt;uint32_t, 64&gt; &amp;blocks);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    std::string <a class="code hl_function" href="../../d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08">to_string</a>() <span class="keyword">const</span>;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>};</div>
+</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="foldopen" id="foldopen00058" data-start="{" data-end="}">
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c">   58</a></span>uint32_t <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c">right_rotate</a>(uint32_t n, <span class="keywordtype">size_t</span> rotate) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">return</span> (n &gt;&gt; rotate) | (n &lt;&lt; (32 - rotate));</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>}</div>
+</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="foldopen" id="foldopen00067" data-start="{" data-end="}">
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3">   67</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3">Hash::update</a>(<span class="keyword">const</span> std::array&lt;uint32_t, 64&gt; &amp;blocks) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="comment">// Initialize array of round constants with first 32 bits of the fractional</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="comment">// parts of the cube roots of the first 64 primes 2..311</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keyword">const</span> std::array&lt;uint32_t, 64&gt; round_constants = {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5, 0x3956C25B, 0x59F111F1,</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        0x923F82A4, 0xAB1C5ED5, 0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174, 0xE49B69C1, 0xEFBE4786,</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        0x0FC19DC6, 0x240CA1CC, 0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA,</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7, 0xC6E00BF3, 0xD5A79147,</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        0x06CA6351, 0x14292967, 0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13,</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85, 0xA2BFE8A1, 0xA81A664B,</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        0xC24B8B70, 0xC76C51A3, 0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070,</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5, 0x391C0CB3, 0x4ED8AA4A,</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        0x5B9CCA4F, 0x682E6FF3, 0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208,</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2};</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="comment">// Initialize working variables</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="keyword">auto</span> a = hash[0];</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keyword">auto</span> b = hash[1];</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keyword">auto</span> c = hash[2];</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="keyword">auto</span> d = hash[3];</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keyword">auto</span> e = hash[4];</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keyword">auto</span> f = hash[5];</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="keyword">auto</span> g = hash[6];</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keyword">auto</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = hash[7];</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="comment">// Compression function main loop</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> block_num = 0; block_num &lt; 64; ++block_num) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        <span class="keyword">const</span> <span class="keyword">auto</span> s1 =</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c">right_rotate</a>(e, 6) ^ <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c">right_rotate</a>(e, 11) ^ <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c">right_rotate</a>(e, 25);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        <span class="keyword">const</span> <span class="keyword">auto</span> ch = (e &amp; f) ^ (~e &amp; g);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        <span class="keyword">const</span> <span class="keyword">auto</span> temp1 =</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>            <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> + s1 + ch + round_constants[block_num] + blocks[block_num];</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        <span class="keyword">const</span> <span class="keyword">auto</span> s0 =</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>            <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c">right_rotate</a>(a, 2) ^ <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c">right_rotate</a>(a, 13) ^ <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c">right_rotate</a>(a, 22);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        <span class="keyword">const</span> <span class="keyword">auto</span> maj = (a &amp; b) ^ (a &amp; c) ^ (b &amp; c);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        <span class="keyword">const</span> <span class="keyword">auto</span> temp2 = s0 + maj;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = g;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        g = f;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        f = e;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        e = d + temp1;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        d = c;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        c = b;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        b = a;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        a = temp1 + temp2;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    }</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <span class="comment">// Update hash values</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    hash[0] += a;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    hash[1] += b;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    hash[2] += c;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    hash[3] += d;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    hash[4] += e;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    hash[5] += f;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    hash[6] += g;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    hash[7] += <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>}</div>
+</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
+<div class="foldopen" id="foldopen00130" data-start="{" data-end="}">
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"><a class="line" href="../../d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08">  130</a></span>std::string <a class="code hl_function" href="../../d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08">Hash::to_string</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    std::stringstream ss;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; 8; ++i) {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        ss &lt;&lt; std::hex &lt;&lt; std::setfill(<span class="charliteral">&#39;0&#39;</span>) &lt;&lt; std::setw(8) &lt;&lt; hash[i];</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    }</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <span class="keywordflow">return</span> ss.str();</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>}</div>
+</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span> </div>
+<div class="foldopen" id="foldopen00143" data-start="{" data-end="}">
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"><a class="line" href="../../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27">  143</a></span>std::size_t <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27">compute_padded_size</a>(<span class="keyword">const</span> std::size_t input_size) {</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <span class="keywordflow">if</span> (input_size % 64 &lt; 56) {</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        <span class="keywordflow">return</span> input_size + 64 - (input_size % 64);</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    }</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    <span class="keywordflow">return</span> input_size + 128 - (input_size % 64);</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>}</div>
+</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span> </div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00157" data-start="{" data-end="}">
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"><a class="line" href="../../d4/d08/sha256_8cpp.html#afea411191ec5281f43e91ea327984627">  157</a></span>uint8_t <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#afea411191ec5281f43e91ea327984627">extract_byte</a>(<span class="keyword">const</span> T in_value, <span class="keyword">const</span> std::size_t byte_num) {</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    <span class="keywordflow">if</span> (<span class="keyword">sizeof</span>(in_value) &lt;= byte_num) {</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        <span class="keywordflow">throw</span> std::out_of_range(<span class="stringliteral">&quot;Byte at index byte_num does not exist&quot;</span>);</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    }</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    <span class="keywordflow">return</span> (in_value &gt;&gt; (byte_num * 8)) &amp; 0xFF;</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>}</div>
+</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span> </div>
+<div class="foldopen" id="foldopen00170" data-start="{" data-end="}">
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"><a class="line" href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da">  170</a></span><span class="keywordtype">char</span> <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da">get_char</a>(<span class="keyword">const</span> std::string &amp;input, std::size_t pos) {</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    <span class="keyword">const</span> <span class="keyword">auto</span> input_size = input.length();</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <span class="keywordflow">if</span> (pos &lt; input_size) {</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>        <span class="keywordflow">return</span> input[pos];</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    }</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    <span class="keywordflow">if</span> (pos == input_size) {</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        <span class="keywordflow">return</span> <span class="stringliteral">&#39;\x80&#39;</span>;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    }</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    <span class="keyword">const</span> <span class="keyword">auto</span> padded_input_size = <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27">compute_padded_size</a>(input_size);</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    <span class="keywordflow">if</span> (pos &lt; padded_input_size - 8) {</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        <span class="keywordflow">return</span> <span class="stringliteral">&#39;\x00&#39;</span>;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    }</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    <span class="keywordflow">if</span> (padded_input_size &lt;= pos) {</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>        <span class="keywordflow">throw</span> std::out_of_range(<span class="stringliteral">&quot;pos is out of range&quot;</span>);</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    }</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">char</span><span class="keyword">&gt;</span>(</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        extract_byte&lt;size_t&gt;(input_size * 8, padded_input_size - pos - 1));</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>}</div>
+</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span> </div>
+<div class="foldopen" id="foldopen00195" data-start="{" data-end="}">
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"><a class="line" href="../../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a">  195</a></span>std::array&lt;uint32_t, 64&gt; <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a">create_message_schedule_array</a>(<span class="keyword">const</span> std::string &amp;input,</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>                                                       <span class="keyword">const</span> <span class="keywordtype">size_t</span> byte_num) {</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    std::array&lt;uint32_t, 64&gt; blocks{};</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span> </div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    <span class="comment">// Copy chunk into first 16 words of the message schedule array</span></div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> block_num = 0; block_num &lt; 16; ++block_num) {</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>        blocks[block_num] =</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>            (<span class="keyword">static_cast&lt;</span>uint8_t<span class="keyword">&gt;</span>(<a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da">get_char</a>(input, byte_num + block_num * 4))</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>             &lt;&lt; 24) |</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>            (<span class="keyword">static_cast&lt;</span>uint8_t<span class="keyword">&gt;</span>(<a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da">get_char</a>(input, byte_num + block_num * 4 + 1))</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>             &lt;&lt; 16) |</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>            (<span class="keyword">static_cast&lt;</span>uint8_t<span class="keyword">&gt;</span>(<a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da">get_char</a>(input, byte_num + block_num * 4 + 2))</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>             &lt;&lt; 8) |</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>            <span class="keyword">static_cast&lt;</span>uint8_t<span class="keyword">&gt;</span>(<a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da">get_char</a>(input, byte_num + block_num * 4 + 3));</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    }</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span> </div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    <span class="comment">// Extend the first 16 words into remaining 48 words of the message schedule</span></div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    <span class="comment">// array</span></div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> block_num = 16; block_num &lt; 64; ++block_num) {</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>        <span class="keyword">const</span> <span class="keyword">auto</span> s0 = <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c">right_rotate</a>(blocks[block_num - 15], 7) ^</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>                        <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c">right_rotate</a>(blocks[block_num - 15], 18) ^</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>                        (blocks[block_num - 15] &gt;&gt; 3);</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>        <span class="keyword">const</span> <span class="keyword">auto</span> s1 = <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c">right_rotate</a>(blocks[block_num - 2], 17) ^</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>                        <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c">right_rotate</a>(blocks[block_num - 2], 19) ^</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>                        (blocks[block_num - 2] &gt;&gt; 10);</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>        blocks[block_num] =</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>            blocks[block_num - 16] + s0 + blocks[block_num - 7] + s1;</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    }</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span> </div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    <span class="keywordflow">return</span> blocks;</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>}</div>
+</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span> </div>
+<div class="foldopen" id="foldopen00232" data-start="{" data-end="}">
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"><a class="line" href="../../d4/d08/sha256_8cpp.html#a55475649a2bb7aae15de0716a217f43a">  232</a></span>std::string <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#a55475649a2bb7aae15de0716a217f43a">sha256</a>(<span class="keyword">const</span> std::string &amp;input) {</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    <a class="code hl_class" href="../../d6/d84/classhashing_1_1sha256_1_1_hash.html">Hash</a> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>;</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    <span class="comment">// Process message in successive 512-bit (64-byte) chunks</span></div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> byte_num = 0; byte_num &lt; <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27">compute_padded_size</a>(input.length());</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>         byte_num += 64) {</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>        <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.update(<a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a">create_message_schedule_array</a>(input, byte_num));</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    }</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.<a class="code hl_function" href="../../d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08">to_string</a>();</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>}</div>
+</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>}  <span class="comment">// namespace sha256</span></div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>}  <span class="comment">// namespace hashing</span></div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span> </div>
+<div class="foldopen" id="foldopen00248" data-start="{" data-end="}">
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"><a class="line" href="../../d4/d08/sha256_8cpp.html#af9b52eba85d23e309035354141259f27">  248</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#af9b52eba85d23e309035354141259f27">test_compute_padded_size</a>() {</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    assert(hashing::sha256::compute_padded_size(55) == 64);</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    assert(hashing::sha256::compute_padded_size(56) == 128);</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    assert(hashing::sha256::compute_padded_size(130) == 192);</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>}</div>
+</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span> </div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span><span class="keyword">static</span> <span class="keywordtype">void</span> test_extract_byte() {</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>    assert(hashing::sha256::extract_byte&lt;uint32_t&gt;(512, 0) == 0);</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    assert(hashing::sha256::extract_byte&lt;uint32_t&gt;(512, 1) == 2);</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    <span class="keywordtype">bool</span> exception = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    <span class="keywordflow">try</span> {</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>        hashing::sha256::extract_byte&lt;uint32_t&gt;(512, 5);</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::out_of_range &amp;) {</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>        exception = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    }</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>    assert(exception);</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>}</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span> </div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span><span class="keyword">static</span> <span class="keywordtype">void</span> test_get_char() {</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>    assert(hashing::sha256::get_char(<span class="stringliteral">&quot;test&quot;</span>, 3) == <span class="charliteral">&#39;t&#39;</span>);</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>    assert(hashing::sha256::get_char(<span class="stringliteral">&quot;test&quot;</span>, 4) == <span class="stringliteral">&#39;\x80&#39;</span>);</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>    assert(hashing::sha256::get_char(<span class="stringliteral">&quot;test&quot;</span>, 5) == <span class="stringliteral">&#39;\x00&#39;</span>);</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    assert(hashing::sha256::get_char(<span class="stringliteral">&quot;test&quot;</span>, 63) == 32);</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    <span class="keywordtype">bool</span> exception = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    <span class="keywordflow">try</span> {</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>        <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da">hashing::sha256::get_char</a>(<span class="stringliteral">&quot;test&quot;</span>, 64);</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::out_of_range &amp;) {</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>        exception = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>    }</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>    assert(exception);</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>}</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span> </div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span><span class="keyword">static</span> <span class="keywordtype">void</span> test_right_rotate() {</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>    assert(hashing::sha256::right_rotate(128, 3) == 16);</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>    assert(hashing::sha256::right_rotate(1, 30) == 4);</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    assert(hashing::sha256::right_rotate(6, 30) == 24);</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>}</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span> </div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span><span class="keyword">static</span> <span class="keywordtype">void</span> test_sha256() {</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a> {</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>        <span class="keyword">const</span> std::string input;</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>        <span class="keyword">const</span> std::string expected_hash;</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(std::string input, std::string expected_hash)</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>            : input(std::move(input)),</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>              expected_hash(std::move(expected_hash)) {}</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>    };</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>    <span class="keyword">const</span> std::vector&lt;TestCase&gt; test_cases{</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>            <span class="stringliteral">&quot;&quot;</span>,</div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>            <span class="stringliteral">&quot;e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855&quot;</span>),</div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>            <span class="stringliteral">&quot;test&quot;</span>,</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>            <span class="stringliteral">&quot;9f86d081884c7d659a2feaa0c55ad015a3bf4f1b2b0b822cd15d6c15b0f00a08&quot;</span>),</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>            <span class="stringliteral">&quot;Hello World&quot;</span>,</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>            <span class="stringliteral">&quot;a591a6d40bf420404a011733cfb7b190d62c65bf0bcda32b57b277d9ad9f146e&quot;</span>),</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;Hello World!&quot;</span>,</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>                 <span class="stringliteral">&quot;7f83b1657ff1fc53b92dc18148a1d65dfc2d4b1fa3d677284addd200126d9&quot;</span></div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>                 <span class="stringliteral">&quot;069&quot;</span>)};</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;tc : test_cases) {</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>        assert(hashing::sha256::sha256(tc.input) == tc.expected_hash);</div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>    }</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>}</div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span> </div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>    <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#af9b52eba85d23e309035354141259f27">test_compute_padded_size</a>();</div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>    test_extract_byte();</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>    test_get_char();</div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>    test_right_rotate();</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>    test_sha256();</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span> </div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>}</div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span> </div>
+<div class="foldopen" id="foldopen00326" data-start="{" data-end="}">
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"><a class="line" href="../../d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  326</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>    <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();  <span class="comment">// Run self-test implementations</span></div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>}</div>
+</div>
+<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00100">caesar_cipher.cpp:100</a></div></div>
+<div class="ttc" id="aclasshashing_1_1sha256_1_1_hash_html"><div class="ttname"><a href="../../d6/d84/classhashing_1_1sha256_1_1_hash.html">hashing::sha256::Hash</a></div><div class="ttdoc">Contains hash array and functions to update it and convert it to a hexadecimal string.</div><div class="ttdef"><b>Definition</b> <a href="#l00040">sha256.cpp:40</a></div></div>
+<div class="ttc" id="aclasshashing_1_1sha256_1_1_hash_html_a0896c27ac39c780e0ee62417fdd0b9d3"><div class="ttname"><a href="../../d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3">hashing::sha256::Hash::update</a></div><div class="ttdeci">void update(const std::array&lt; uint32_t, 64 &gt; &amp;blocks)</div><div class="ttdoc">Updates the hash array.</div><div class="ttdef"><b>Definition</b> <a href="#l00067">sha256.cpp:67</a></div></div>
+<div class="ttc" id="aclasshashing_1_1sha256_1_1_hash_html_a4581f503a263d8e928e5716d54477e08"><div class="ttname"><a href="../../d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08">hashing::sha256::Hash::to_string</a></div><div class="ttdeci">std::string to_string() const</div><div class="ttdoc">Convert the hash to a hexadecimal string.</div><div class="ttdef"><b>Definition</b> <a href="#l00130">sha256.cpp:130</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00045">hash_search.cpp:45</a></div></div>
+<div class="ttc" id="anamespacehashing_html"><div class="ttname"><a href="../../d6/d0c/namespacehashing.html">hashing</a></div><div class="ttdoc">Used for assert.</div></div>
+<div class="ttc" id="asha256_8cpp_html_a28c1c6724dc6bcf91a39818699bbec27"><div class="ttname"><a href="../../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27">hashing::sha256::compute_padded_size</a></div><div class="ttdeci">std::size_t compute_padded_size(const std::size_t input_size)</div><div class="ttdoc">Computes size of the padded input.</div><div class="ttdef"><b>Definition</b> <a href="#l00143">sha256.cpp:143</a></div></div>
+<div class="ttc" id="asha256_8cpp_html_a525531b3939ed44fbf01674e21931b3a"><div class="ttname"><a href="../../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a">hashing::sha256::create_message_schedule_array</a></div><div class="ttdeci">std::array&lt; uint32_t, 64 &gt; create_message_schedule_array(const std::string &amp;input, const size_t byte_num)</div><div class="ttdoc">Creates the message schedule array.</div><div class="ttdef"><b>Definition</b> <a href="#l00195">sha256.cpp:195</a></div></div>
+<div class="ttc" id="asha256_8cpp_html_a55475649a2bb7aae15de0716a217f43a"><div class="ttname"><a href="../../d4/d08/sha256_8cpp.html#a55475649a2bb7aae15de0716a217f43a">hashing::sha256::sha256</a></div><div class="ttdeci">std::string sha256(const std::string &amp;input)</div><div class="ttdoc">Computes the final hash value.</div><div class="ttdef"><b>Definition</b> <a href="#l00232">sha256.cpp:232</a></div></div>
+<div class="ttc" id="asha256_8cpp_html_a9e98c180d32b04aab6f767cb0c13e1da"><div class="ttname"><a href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da">hashing::sha256::get_char</a></div><div class="ttdeci">char get_char(const std::string &amp;input, std::size_t pos)</div><div class="ttdoc">Returns the character at pos after the input is padded.</div><div class="ttdef"><b>Definition</b> <a href="#l00170">sha256.cpp:170</a></div></div>
+<div class="ttc" id="asha256_8cpp_html_adbcd504103c342a4da718f8fce6ff06c"><div class="ttname"><a href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c">hashing::sha256::right_rotate</a></div><div class="ttdeci">uint32_t right_rotate(uint32_t n, size_t rotate)</div><div class="ttdoc">Rotates the bits of a 32-bit unsigned integer.</div><div class="ttdef"><b>Definition</b> <a href="#l00058">sha256.cpp:58</a></div></div>
+<div class="ttc" id="asha256_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00326">sha256.cpp:326</a></div></div>
+<div class="ttc" id="asha256_8cpp_html_af9b52eba85d23e309035354141259f27"><div class="ttname"><a href="../../d4/d08/sha256_8cpp.html#af9b52eba85d23e309035354141259f27">test_compute_padded_size</a></div><div class="ttdeci">static void test_compute_padded_size()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="#l00248">sha256.cpp:248</a></div></div>
+<div class="ttc" id="asha256_8cpp_html_afea411191ec5281f43e91ea327984627"><div class="ttname"><a href="../../d4/d08/sha256_8cpp.html#afea411191ec5281f43e91ea327984627">hashing::sha256::extract_byte</a></div><div class="ttdeci">uint8_t extract_byte(const T in_value, const std::size_t byte_num)</div><div class="ttdoc">Returns the byte at position byte_num in in_value.</div><div class="ttdef"><b>Definition</b> <a href="#l00157">sha256.cpp:157</a></div></div>
+<div class="ttc" id="astruct_test_case_html"><div class="ttname"><a href="../../da/d86/struct_test_case.html">TestCase</a></div><div class="ttdoc">represents single example inputs and expected output of the function longest_common_string_length</div><div class="ttdef"><b>Definition</b> <a href="../../da/d0d/longest__common__string_8cpp_source.html#l00054">longest_common_string.cpp:54</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_ece9b94c107bbaa1dd68197a8c9983b9.html">hashing</a></li><li class="navelem"><a class="el" href="../../d4/d08/sha256_8cpp.html">sha256.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d0e/classdata__structures_1_1linked__list_1_1_node.html b/d4/d0e/classdata__structures_1_1linked__list_1_1_node.html
index 0e792ef8b..95cf4d36b 100644
--- a/d4/d0e/classdata__structures_1_1linked__list_1_1_node.html
+++ b/d4/d0e/classdata__structures_1_1linked__list_1_1_node.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::linked_list::Node Class Reference</title>
+<title>TheAlgorithms/C++: data_structures::linked_list::Node Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,18 +135,53 @@ Collaboration diagram for data_structures::linked_list::Node:</div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a6ff2c183de573154c41eb54a9bb2d131" id="r_a6ff2c183de573154c41eb54a9bb2d131"><td class="memItemLeft" align="right" valign="top"><a id="a6ff2c183de573154c41eb54a9bb2d131" name="a6ff2c183de573154c41eb54a9bb2d131"></a>
-int32_t&#160;</td><td class="memItemRight" valign="bottom"><b>val</b></td></tr>
+<tr class="memitem:a6ff2c183de573154c41eb54a9bb2d131" id="r_a6ff2c183de573154c41eb54a9bb2d131"><td class="memItemLeft" align="right" valign="top">int32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6ff2c183de573154c41eb54a9bb2d131">val</a></td></tr>
 <tr class="separator:a6ff2c183de573154c41eb54a9bb2d131"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:acfccd7b52c91d91300c5b317e5ec7a6e" id="r_acfccd7b52c91d91300c5b317e5ec7a6e"><td class="memItemLeft" align="right" valign="top"><a id="acfccd7b52c91d91300c5b317e5ec7a6e" name="acfccd7b52c91d91300c5b317e5ec7a6e"></a>
-<a class="el" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>next</b></td></tr>
-<tr class="memdesc:acfccd7b52c91d91300c5b317e5ec7a6e"><td class="mdescLeft">&#160;</td><td class="mdescRight">value of the current link <br /></td></tr>
+<tr class="memitem:acfccd7b52c91d91300c5b317e5ec7a6e" id="r_acfccd7b52c91d91300c5b317e5ec7a6e"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acfccd7b52c91d91300c5b317e5ec7a6e">next</a></td></tr>
+<tr class="memdesc:acfccd7b52c91d91300c5b317e5ec7a6e"><td class="mdescLeft">&#160;</td><td class="mdescRight">value of the current link  <br /></td></tr>
 <tr class="separator:acfccd7b52c91d91300c5b317e5ec7a6e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A <a class="el" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a> class containing a value and pointer to another link </p>
-</div><hr/>The documentation for this class was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp.html">reverse_a_linked_list.cpp</a></li>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
+</div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="acfccd7b52c91d91300c5b317e5ec7a6e" name="acfccd7b52c91d91300c5b317e5ec7a6e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#acfccd7b52c91d91300c5b317e5ec7a6e">&#9670;&#160;</a></span>next</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a>* data_structures::linked_list::Node::next</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>value of the current link </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00045">45</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a6ff2c183de573154c41eb54a9bb2d131" name="a6ff2c183de573154c41eb54a9bb2d131"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a6ff2c183de573154c41eb54a9bb2d131">&#9670;&#160;</a></span>val</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int32_t data_structures::linked_list::Node::val</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
+
+</div>
+</div>
+<hr/>The documentation for this class was generated from the following file:<ul>
+<li>data_structures/<a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d4/d0f/namespacegram__schmidt.html b/d4/d0f/namespacegram__schmidt.html
index 8429e1dfd..615530a26 100644
--- a/d4/d0f/namespacegram__schmidt.html
+++ b/d4/d0f/namespacegram__schmidt.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: gram_schmidt Namespace Reference</title>
+<title>TheAlgorithms/C++: gram_schmidt Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d4/d12/namespace_minimum.html b/d4/d12/namespace_minimum.html
index c51544412..c850fdcf1 100644
--- a/d4/d12/namespace_minimum.html
+++ b/d4/d12/namespace_minimum.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Minimum Namespace Reference</title>
+<title>TheAlgorithms/C++: Minimum Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d4/d13/namespacebidirectional__dijkstra.html b/d4/d13/namespacebidirectional__dijkstra.html
index 628ffb4c5..1e5a0d86b 100644
--- a/d4/d13/namespacebidirectional__dijkstra.html
+++ b/d4/d13/namespacebidirectional__dijkstra.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: bidirectional_dijkstra Namespace Reference</title>
+<title>TheAlgorithms/C++: bidirectional_dijkstra Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d4/d18/composite__simpson__rule_8cpp.html b/d4/d18/composite__simpson__rule_8cpp.html
index fda394a58..62d4454e4 100644
--- a/d4/d18/composite__simpson__rule_8cpp.html
+++ b/d4/d18/composite__simpson__rule_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/composite_simpson_rule.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/composite_simpson_rule.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -125,7 +142,9 @@ Include dependency graph for composite_simpson_rule.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/db0/composite__simpson__rule_8cpp__incl.svg" width="592" height="126"><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">
+</div>
+<p><a href="../../d4/d18/composite__simpson__rule_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr>
@@ -137,7 +156,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a6ccc5eddc537dc0293d0ae3d0480f068" id="r_a6ccc5eddc537dc0293d0ae3d0480f068"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6ccc5eddc537dc0293d0ae3d0480f068">numerical_methods::simpson_method::evaluate_by_simpson</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> N, double <a class="el" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, double a, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; double(double)&gt; &amp;func)</td></tr>
+<tr class="memitem:a6ccc5eddc537dc0293d0ae3d0480f068" id="r_a6ccc5eddc537dc0293d0ae3d0480f068"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6ccc5eddc537dc0293d0ae3d0480f068">numerical_methods::simpson_method::evaluate_by_simpson</a> (std::int32_t N, double <a class="el" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, double a, const std::function&lt; double(double)&gt; &amp;func)</td></tr>
 <tr class="separator:a6ccc5eddc537dc0293d0ae3d0480f068"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a4251b4df4748a0b9c43a48f61bdd2397" id="r_a4251b4df4748a0b9c43a48f61bdd2397"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4251b4df4748a0b9c43a48f61bdd2397">numerical_methods::simpson_method::f</a> (double x)</td></tr>
 <tr class="memdesc:a4251b4df4748a0b9c43a48f61bdd2397"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function f(x) that will be used to test the method.  <br /></td></tr>
@@ -151,7 +170,7 @@ Functions</h2></td></tr>
 <tr class="memitem:a6d8df83a6f26ce24a75d3b358b7f5b8a" id="r_a6d8df83a6f26ce24a75d3b358b7f5b8a"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a> (double x)</td></tr>
 <tr class="memdesc:a6d8df83a6f26ce24a75d3b358b7f5b8a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Another test function.  <br /></td></tr>
 <tr class="separator:a6d8df83a6f26ce24a75d3b358b7f5b8a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2ae48a41e43dc6ab11b962742349646e" id="r_a2ae48a41e43dc6ab11b962742349646e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2ae48a41e43dc6ab11b962742349646e">test</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> N, double <a class="el" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, double a, double b, bool used_argv_parameters)</td></tr>
+<tr class="memitem:a2ae48a41e43dc6ab11b962742349646e" id="r_a2ae48a41e43dc6ab11b962742349646e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2ae48a41e43dc6ab11b962742349646e">test</a> (std::int32_t N, double <a class="el" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, double a, double b, bool used_argv_parameters)</td></tr>
 <tr class="memdesc:a2ae48a41e43dc6ab11b962742349646e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations.  <br /></td></tr>
 <tr class="separator:a2ae48a41e43dc6ab11b962742349646e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a3c04138a5bfe5d72780bb7e82a18e627" id="r_a3c04138a5bfe5d72780bb7e82a18e627"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3c04138a5bfe5d72780bb7e82a18e627">main</a> (int argc, char **argv)</td></tr>
@@ -170,6 +189,8 @@ Functions</h2></td></tr>
 <p>In the end of the <a class="el" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4" title="Main function.">main()</a> i compare the program's result with the one from mathematical software with 2 decimal points margin.</p>
 <p>Add sample function by replacing one of the f, g, k, l and the assert</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/ggkogkou" target="_blank">ggkogkou</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d18/composite__simpson__rule_8cpp_source.html">composite_simpson_rule.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a6ccc5eddc537dc0293d0ae3d0480f068" name="a6ccc5eddc537dc0293d0ae3d0480f068"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a6ccc5eddc537dc0293d0ae3d0480f068">&#9670;&#160;</a></span>evaluate_by_simpson()</h2>
@@ -180,7 +201,7 @@ Functions</h2></td></tr>
         <tr>
           <td class="memname">double numerical_methods::simpson_method::evaluate_by_simpson </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a></td>          <td class="paramname"><span class="paramname"><em>N</em></span>, </td>
+          <td class="paramtype">std::int32_t</td>          <td class="paramname"><span class="paramname"><em>N</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -195,34 +216,36 @@ Functions</h2></td></tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; double(double)&gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>func</em></span>&#160;)</td>
+          <td class="paramtype">const std::function&lt; double(double)&gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>func</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../d4/d18/composite__simpson__rule_8cpp_source.html">composite_simpson_rule.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   68</span>                                                                    {</div>
-<div class="line"><span class="lineno">   69</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map&lt;std::int32_t, double&gt;</a></div>
+<div class="line"><span class="lineno">   69</span>    std::map&lt;std::int32_t, double&gt;</div>
 <div class="line"><span class="lineno">   70</span>        data_table;  <span class="comment">// Contains the data points. key: i, value: f(xi)</span></div>
 <div class="line"><span class="lineno">   71</span>    <span class="keywordtype">double</span> xi = a;   <span class="comment">// Initialize xi to the starting point x0 = a</span></div>
 <div class="line"><span class="lineno">   72</span> </div>
 <div class="line"><span class="lineno">   73</span>    <span class="comment">// Create the data table</span></div>
 <div class="line"><span class="lineno">   74</span>    <span class="keywordtype">double</span> temp = NAN;</div>
-<div class="line"><span class="lineno">   75</span>    <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> i = 0; i &lt;= <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
+<div class="line"><span class="lineno">   75</span>    <span class="keywordflow">for</span> (std::int32_t i = 0; i &lt;= <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
 <div class="line"><span class="lineno">   76</span>        temp = func(xi);</div>
-<div class="line"><span class="lineno">   77</span>        data_table.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(</div>
-<div class="line"><span class="lineno">   78</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;std::int32_t, double&gt;</a>(i, temp));  <span class="comment">// add i and f(xi)</span></div>
+<div class="line"><span class="lineno">   77</span>        data_table.insert(</div>
+<div class="line"><span class="lineno">   78</span>            std::pair&lt;std::int32_t, double&gt;(i, temp));  <span class="comment">// add i and f(xi)</span></div>
 <div class="line"><span class="lineno">   79</span>        xi += <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>;  <span class="comment">// Get the next point xi for the next iteration</span></div>
 <div class="line"><span class="lineno">   80</span>    }</div>
 <div class="line"><span class="lineno">   81</span> </div>
 <div class="line"><span class="lineno">   82</span>    <span class="comment">// Evaluate the integral.</span></div>
 <div class="line"><span class="lineno">   83</span>    <span class="comment">// Remember: f(x0) + 4*f(x1) + 2*f(x2) + ... + 2*f(xN-2) + 4*f(xN-1) + f(xN)</span></div>
 <div class="line"><span class="lineno">   84</span>    <span class="keywordtype">double</span> evaluate_integral = 0;</div>
-<div class="line"><span class="lineno">   85</span>    <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> i = 0; i &lt;= <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
+<div class="line"><span class="lineno">   85</span>    <span class="keywordflow">for</span> (std::int32_t i = 0; i &lt;= <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
 <div class="line"><span class="lineno">   86</span>        <span class="keywordflow">if</span> (i == 0 || i == N) {</div>
-<div class="line"><span class="lineno">   87</span>            evaluate_integral += data_table.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/at.html">at</a>(i);</div>
+<div class="line"><span class="lineno">   87</span>            evaluate_integral += data_table.at(i);</div>
 <div class="line"><span class="lineno">   88</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (i % 2 == 1) {</div>
-<div class="line"><span class="lineno">   89</span>            evaluate_integral += 4 * data_table.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/at.html">at</a>(i);</div>
+<div class="line"><span class="lineno">   89</span>            evaluate_integral += 4 * data_table.at(i);</div>
 <div class="line"><span class="lineno">   90</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   91</span>            evaluate_integral += 2 * data_table.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/at.html">at</a>(i);</div>
+<div class="line"><span class="lineno">   91</span>            evaluate_integral += 2 * data_table.at(i);</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> </div>
@@ -231,20 +254,14 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   97</span> </div>
 <div class="line"><span class="lineno">   98</span>    <span class="comment">// If the result calculated is nan, then the user has given wrong input</span></div>
 <div class="line"><span class="lineno">   99</span>    <span class="comment">// interval.</span></div>
-<div class="line"><span class="lineno">  100</span>    assert(!<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/isnan.html">std::isnan</a>(evaluate_integral) &amp;&amp;</div>
+<div class="line"><span class="lineno">  100</span>    assert(!std::isnan(evaluate_integral) &amp;&amp;</div>
 <div class="line"><span class="lineno">  101</span>           <span class="stringliteral">&quot;The definite integral can&#39;t be evaluated. Check the validity of &quot;</span></div>
 <div class="line"><span class="lineno">  102</span>           <span class="stringliteral">&quot;your input.\n&quot;</span>);</div>
 <div class="line"><span class="lineno">  103</span>    <span class="comment">// Else return</span></div>
 <div class="line"><span class="lineno">  104</span>    <span class="keywordflow">return</span> evaluate_integral;</div>
 <div class="line"><span class="lineno">  105</span>}</div>
-<div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map/at.html">std::map::at</a></div><div class="ttdeci">T at(T... args)</div></div>
-<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> hash_search.cpp:45</div></div>
-<div class="ttc" id="ainsert_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map/insert.html">std::map::insert</a></div><div class="ttdeci">T insert(T... args)</div></div>
-<div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a></div></div>
-<div class="ttc" id="aisnan_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/isnan.html">std::isnan</a></div><div class="ttdeci">T isnan(T... args)</div></div>
-<div class="ttc" id="amap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a></div></div>
-<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
-<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00045">hash_search.cpp:45</a></div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -271,15 +288,10 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the value of the dependent variable yi = f(xi) </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  113</span>{ <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(x) + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">std::log</a>(x); }</div>
-<div class="ttc" id="alog_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/log.html">std::log</a></div><div class="ttdeci">T log(T... args)</div></div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d18/composite__simpson__rule_8cpp_a4251b4df4748a0b9c43a48f61bdd2397_cgraph.svg" width="271" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00113">113</a> of file <a class="el" href="../../d4/d18/composite__simpson__rule_8cpp_source.html">composite_simpson_rule.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  113</span>{ <span class="keywordflow">return</span> std::sqrt(x) + std::log(x); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2f67508d5f392b0321772169342c98ad" name="a2f67508d5f392b0321772169342c98ad"></a>
@@ -298,15 +310,10 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>Another test function. </p>
-<div class="fragment"><div class="line"><span class="lineno">  115</span>{ <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a>(-x) * (4 - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(x, 2)); }</div>
-<div class="ttc" id="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d18/composite__simpson__rule_8cpp_a2f67508d5f392b0321772169342c98ad_cgraph.svg" width="272" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00115">115</a> of file <a class="el" href="../../d4/d18/composite__simpson__rule_8cpp_source.html">composite_simpson_rule.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  115</span>{ <span class="keywordflow">return</span> std::exp(-x) * (4 - std::pow(x, 2)); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1b74d828b33760094906797042b89442" name="a1b74d828b33760094906797042b89442"></a>
@@ -325,13 +332,10 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>Another test function. </p>
-<div class="fragment"><div class="line"><span class="lineno">  117</span>{ <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(2 * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(x, 3) + 3); }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d18/composite__simpson__rule_8cpp_a1b74d828b33760094906797042b89442_cgraph.svg" width="272" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">117</a> of file <a class="el" href="../../d4/d18/composite__simpson__rule_8cpp_source.html">composite_simpson_rule.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  117</span>{ <span class="keywordflow">return</span> std::sqrt(2 * std::pow(x, 3) + 3); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6d8df83a6f26ce24a75d3b358b7f5b8a" name="a6d8df83a6f26ce24a75d3b358b7f5b8a"></a>
@@ -350,13 +354,10 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>Another test function. </p>
-<div class="fragment"><div class="line"><span class="lineno">  119</span>{ <span class="keywordflow">return</span> x + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">std::log</a>(2 * x + 1); }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d18/composite__simpson__rule_8cpp_a6d8df83a6f26ce24a75d3b358b7f5b8a_cgraph.svg" width="266" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00119">119</a> of file <a class="el" href="../../d4/d18/composite__simpson__rule_8cpp_source.html">composite_simpson_rule.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  119</span>{ <span class="keywordflow">return</span> x + std::log(2 * x + 1); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a3c04138a5bfe5d72780bb7e82a18e627" name="a3c04138a5bfe5d72780bb7e82a18e627"></a>
@@ -390,12 +391,12 @@ Here is the call graph for this function:</div>
 <p>Number of intervals to divide the integration interval. MUST BE EVEN</p>
 <p>Starting and ending point of the integration in the real axis</p>
 <p>Step, calculated by a, b and N</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00170">170</a> of file <a class="el" href="../../d4/d18/composite__simpson__rule_8cpp_source.html">composite_simpson_rule.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  170</span>                                {</div>
-<div class="line"><span class="lineno">  171</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 16;  <span class="comment">/// Number of intervals to divide the integration</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  172</span><span class="comment">                          /// interval. MUST BE EVEN</span></div>
-<div class="line"><span class="lineno">  173</span><span class="comment"></span>    <span class="keywordtype">double</span> a = 1, b = 3;  <span class="comment">/// Starting and ending point of the integration in</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  174</span><span class="comment">                          /// the real axis</span></div>
-<div class="line"><span class="lineno">  175</span><span class="comment"></span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = NAN;       <span class="comment">/// Step, calculated by a, b and N</span></div>
+<div class="line"><span class="lineno">  171</span>    std::int32_t <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 16;  </div>
+<div class="line"><span class="lineno">  173</span>    <span class="keywordtype">double</span> a = 1, b = 3;  </div>
+<div class="line"><span class="lineno">  175</span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = NAN;       </div>
 <div class="line"><span class="lineno">  176</span> </div>
 <div class="line"><span class="lineno">  177</span>    <span class="keywordtype">bool</span> used_argv_parameters =</div>
 <div class="line"><span class="lineno">  178</span>        <span class="keyword">false</span>;  <span class="comment">// If argv parameters are used then the assert must be omitted</span></div>
@@ -404,20 +405,20 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  181</span>    <span class="comment">// Get user input (by the command line parameters or the console after</span></div>
 <div class="line"><span class="lineno">  182</span>    <span class="comment">// displaying messages)</span></div>
 <div class="line"><span class="lineno">  183</span>    <span class="keywordflow">if</span> (argc == 4) {</div>
-<div class="line"><span class="lineno">  184</span>        <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">std::atoi</a>(argv[1]);</div>
-<div class="line"><span class="lineno">  185</span>        a = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a>(argv[2]);</div>
-<div class="line"><span class="lineno">  186</span>        b = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a>(argv[3]);</div>
+<div class="line"><span class="lineno">  184</span>        <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = std::atoi(argv[1]);</div>
+<div class="line"><span class="lineno">  185</span>        a = std::atof(argv[2]);</div>
+<div class="line"><span class="lineno">  186</span>        b = std::atof(argv[3]);</div>
 <div class="line"><span class="lineno">  187</span>        <span class="comment">// Check if a&lt;b else abort</span></div>
 <div class="line"><span class="lineno">  188</span>        assert(a &lt; b &amp;&amp; <span class="stringliteral">&quot;a has to be less than b&quot;</span>);</div>
 <div class="line"><span class="lineno">  189</span>        assert(N &gt; 0 &amp;&amp; <span class="stringliteral">&quot;N has to be &gt; 0&quot;</span>);</div>
 <div class="line"><span class="lineno">  190</span>        <span class="keywordflow">if</span> (N &lt; 16 || a != 1 || b != 3) {</div>
 <div class="line"><span class="lineno">  191</span>            used_argv_parameters = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  192</span>        }</div>
-<div class="line"><span class="lineno">  193</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;You selected N=&quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div>
-<div class="line"><span class="lineno">  194</span>                  &lt;&lt; <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">  193</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;You selected N=&quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div>
+<div class="line"><span class="lineno">  194</span>                  &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  195</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  196</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Default N=&quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div>
-<div class="line"><span class="lineno">  197</span>                  &lt;&lt; <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">  196</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Default N=&quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div>
+<div class="line"><span class="lineno">  197</span>                  &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  198</span>    }</div>
 <div class="line"><span class="lineno">  199</span> </div>
 <div class="line"><span class="lineno">  200</span>    <span class="comment">// Find the step</span></div>
@@ -427,17 +428,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  204</span> </div>
 <div class="line"><span class="lineno">  205</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  206</span>}</div>
-<div class="ttc" id="aatof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a></div><div class="ttdeci">T atof(T... args)</div></div>
-<div class="ttc" id="aatoi_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">std::atoi</a></div><div class="ttdeci">T atoi(T... args)</div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> generate_parentheses.cpp:82</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/d18/composite__simpson__rule_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg" width="100%" height="523"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00082">generate_parentheses.cpp:82</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2ae48a41e43dc6ab11b962742349646e" name="a2ae48a41e43dc6ab11b962742349646e"></a>
@@ -452,7 +444,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">static void test </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a></td>          <td class="paramname"><span class="paramname"><em>N</em></span>, </td>
+          <td class="paramtype">std::int32_t</td>          <td class="paramname"><span class="paramname"><em>N</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -493,42 +485,39 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00132">132</a> of file <a class="el" href="../../d4/d18/composite__simpson__rule_8cpp_source.html">composite_simpson_rule.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  133</span>                                            {</div>
 <div class="line"><span class="lineno">  134</span>    <span class="comment">// Call the functions and find the integral of each function</span></div>
 <div class="line"><span class="lineno">  135</span>    <span class="keywordtype">double</span> result_f = numerical_methods::simpson_method::evaluate_by_simpson(</div>
 <div class="line"><span class="lineno">  136</span>        N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::simpson_method::f);</div>
 <div class="line"><span class="lineno">  137</span>    assert((used_argv_parameters || (result_f &gt;= 4.09 &amp;&amp; result_f &lt;= 4.10)) &amp;&amp;</div>
 <div class="line"><span class="lineno">  138</span>           <span class="stringliteral">&quot;The result of f(x) is wrong&quot;</span>);</div>
-<div class="line"><span class="lineno">  139</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The result of integral f(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
-<div class="line"><span class="lineno">  140</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_f &lt;&lt; <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">  139</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The result of integral f(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
+<div class="line"><span class="lineno">  140</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_f &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  141</span> </div>
 <div class="line"><span class="lineno">  142</span>    <span class="keywordtype">double</span> result_g = numerical_methods::simpson_method::evaluate_by_simpson(</div>
 <div class="line"><span class="lineno">  143</span>        N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::simpson_method::g);</div>
 <div class="line"><span class="lineno">  144</span>    assert((used_argv_parameters || (result_g &gt;= 0.27 &amp;&amp; result_g &lt;= 0.28)) &amp;&amp;</div>
 <div class="line"><span class="lineno">  145</span>           <span class="stringliteral">&quot;The result of g(x) is wrong&quot;</span>);</div>
-<div class="line"><span class="lineno">  146</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The result of integral g(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
-<div class="line"><span class="lineno">  147</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_g &lt;&lt; <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">  146</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The result of integral g(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
+<div class="line"><span class="lineno">  147</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_g &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  148</span> </div>
 <div class="line"><span class="lineno">  149</span>    <span class="keywordtype">double</span> result_k = numerical_methods::simpson_method::evaluate_by_simpson(</div>
 <div class="line"><span class="lineno">  150</span>        N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::simpson_method::k);</div>
 <div class="line"><span class="lineno">  151</span>    assert((used_argv_parameters || (result_k &gt;= 9.06 &amp;&amp; result_k &lt;= 9.07)) &amp;&amp;</div>
 <div class="line"><span class="lineno">  152</span>           <span class="stringliteral">&quot;The result of k(x) is wrong&quot;</span>);</div>
-<div class="line"><span class="lineno">  153</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The result of integral k(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
-<div class="line"><span class="lineno">  154</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_k &lt;&lt; <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">  153</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The result of integral k(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
+<div class="line"><span class="lineno">  154</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_k &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  155</span> </div>
 <div class="line"><span class="lineno">  156</span>    <span class="keywordtype">double</span> result_l = numerical_methods::simpson_method::evaluate_by_simpson(</div>
 <div class="line"><span class="lineno">  157</span>        N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::simpson_method::l);</div>
 <div class="line"><span class="lineno">  158</span>    assert((used_argv_parameters || (result_l &gt;= 7.16 &amp;&amp; result_l &lt;= 7.17)) &amp;&amp;</div>
 <div class="line"><span class="lineno">  159</span>           <span class="stringliteral">&quot;The result of l(x) is wrong&quot;</span>);</div>
-<div class="line"><span class="lineno">  160</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The result of integral l(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
-<div class="line"><span class="lineno">  161</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_l &lt;&lt; <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">  160</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The result of integral l(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
+<div class="line"><span class="lineno">  161</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_l &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  162</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d18/composite__simpson__rule_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.svg" width="174" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/d18/composite__simpson__rule_8cpp_a1b74d828b33760094906797042b89442_cgraph.map b/d4/d18/composite__simpson__rule_8cpp_a1b74d828b33760094906797042b89442_cgraph.map
deleted file mode 100644
index a683f56e9..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a1b74d828b33760094906797042b89442_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="numerical_methods::simpson_method::k" name="numerical_methods::simpson_method::k">
-<area shape="rect" id="Node000001" title="Another test function." alt="" coords="5,29,148,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="46,29,45,19,50,11,61,5,77,3,94,5,104,11,101,16,92,10,76,8,62,10,54,14,50,20,52,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="196,12,267,37"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="148,35,180,30,181,35,149,41"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="197,61,266,86"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="149,58,181,63,180,69,148,63"/>
-</map>
diff --git a/d4/d18/composite__simpson__rule_8cpp_a1b74d828b33760094906797042b89442_cgraph.md5 b/d4/d18/composite__simpson__rule_8cpp_a1b74d828b33760094906797042b89442_cgraph.md5
deleted file mode 100644
index eddb992f5..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a1b74d828b33760094906797042b89442_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-94cd7849e83ef592e8a6fe147fd6bda0
\ No newline at end of file
diff --git a/d4/d18/composite__simpson__rule_8cpp_a1b74d828b33760094906797042b89442_cgraph.svg b/d4/d18/composite__simpson__rule_8cpp_a1b74d828b33760094906797042b89442_cgraph.svg
deleted file mode 100644
index fa9b44aaf..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a1b74d828b33760094906797042b89442_cgraph.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::simpson_method::k Pages: 1 -->
-<svg width="204pt" height="69pt"
- viewBox="0.00 0.00 204.25 68.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64.88)">
-<title>numerical_methods::simpson_method::k</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Another test function.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-42.88 0,-42.88 0,-12.37 106.75,-12.37 106.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">simpson_method::k</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.8,-43.36C28.6,-52.43 35.46,-60.88 53.38,-60.88 63.17,-60.88 69.67,-58.35 72.85,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.31,-55.16 73.8,-44.87 69.34,-54.48 76.31,-55.16"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.25,-56.25 142.75,-56.25 142.75,-37 196.25,-37 196.25,-56.25"/>
-<text text-anchor="middle" x="169.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.09,-36.4C115.24,-37.76 123.5,-39.13 131.22,-40.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.48,-43.84 140.92,-42.03 131.63,-36.94 130.48,-43.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.5,-19.25 143.5,-19.25 143.5,0 195.5,0 195.5,-19.25"/>
-<text text-anchor="middle" x="169.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.09,-19.31C115.39,-18 123.82,-16.67 131.66,-15.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.18,-18.9 141.52,-13.88 131.09,-11.98 132.18,-18.9"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d18/composite__simpson__rule_8cpp_a1b74d828b33760094906797042b89442_cgraph_org.svg b/d4/d18/composite__simpson__rule_8cpp_a1b74d828b33760094906797042b89442_cgraph_org.svg
deleted file mode 100644
index 717874418..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a1b74d828b33760094906797042b89442_cgraph_org.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::simpson_method::k Pages: 1 -->
-<svg width="204pt" height="69pt"
- viewBox="0.00 0.00 204.25 68.88" 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 64.88)">
-<title>numerical_methods::simpson_method::k</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Another test function.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-42.88 0,-42.88 0,-12.37 106.75,-12.37 106.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">simpson_method::k</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.8,-43.36C28.6,-52.43 35.46,-60.88 53.38,-60.88 63.17,-60.88 69.67,-58.35 72.85,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.31,-55.16 73.8,-44.87 69.34,-54.48 76.31,-55.16"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.25,-56.25 142.75,-56.25 142.75,-37 196.25,-37 196.25,-56.25"/>
-<text text-anchor="middle" x="169.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.09,-36.4C115.24,-37.76 123.5,-39.13 131.22,-40.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.48,-43.84 140.92,-42.03 131.63,-36.94 130.48,-43.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.5,-19.25 143.5,-19.25 143.5,0 195.5,0 195.5,-19.25"/>
-<text text-anchor="middle" x="169.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.09,-19.31C115.39,-18 123.82,-16.67 131.66,-15.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.18,-18.9 141.52,-13.88 131.09,-11.98 132.18,-18.9"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d18/composite__simpson__rule_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.map b/d4/d18/composite__simpson__rule_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.map
deleted file mode 100644
index 36cb2a672..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,31,49,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,36,81,28,82,33,50,41"/>
-<area shape="rect" id="Node000003" href="$d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" title=" " alt="" coords="113,55,152,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="50,46,98,57,97,62,49,51"/>
-</map>
diff --git a/d4/d18/composite__simpson__rule_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.md5 b/d4/d18/composite__simpson__rule_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.md5
deleted file mode 100644
index 195b68a6d..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-35205101949ce7aa6a6ebedcb619e803
\ No newline at end of file
diff --git a/d4/d18/composite__simpson__rule_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.svg b/d4/d18/composite__simpson__rule_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.svg
deleted file mode 100644
index 5424cc847..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="64pt"
- viewBox="0.00 0.00 130.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-56.25 68.5,-56.25 68.5,-37 122,-37 122,-56.25"/>
-<text text-anchor="middle" x="95.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-31.47C39.86,-33.2 48.49,-35.33 57.03,-37.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.06,-40.81 66.61,-39.8 57.74,-34.01 56.06,-40.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="109.65,-19.25 80.85,-19.25 80.85,0 109.65,0 109.65,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-23.98C43.31,-21.53 57.36,-18.25 69.37,-15.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.08,-18.87 79.02,-13.18 68.49,-12.05 70.08,-18.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d18/composite__simpson__rule_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph_org.svg b/d4/d18/composite__simpson__rule_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph_org.svg
deleted file mode 100644
index c30627a2d..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="64pt"
- viewBox="0.00 0.00 130.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-56.25 68.5,-56.25 68.5,-37 122,-37 122,-56.25"/>
-<text text-anchor="middle" x="95.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-31.47C39.86,-33.2 48.49,-35.33 57.03,-37.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.06,-40.81 66.61,-39.8 57.74,-34.01 56.06,-40.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="109.65,-19.25 80.85,-19.25 80.85,0 109.65,0 109.65,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-23.98C43.31,-21.53 57.36,-18.25 69.37,-15.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.08,-18.87 79.02,-13.18 68.49,-12.05 70.08,-18.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d18/composite__simpson__rule_8cpp_a2f67508d5f392b0321772169342c98ad_cgraph.map b/d4/d18/composite__simpson__rule_8cpp_a2f67508d5f392b0321772169342c98ad_cgraph.map
deleted file mode 100644
index 67a96baf2..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a2f67508d5f392b0321772169342c98ad_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="numerical_methods::simpson_method::g" name="numerical_methods::simpson_method::g">
-<area shape="rect" id="Node000001" title="Another test function." alt="" coords="5,29,148,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="46,29,45,19,50,11,61,5,77,3,94,5,104,11,101,16,92,10,76,8,62,10,54,14,50,20,52,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/exp.html#" title=" " alt="" coords="197,12,266,37"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="148,35,181,30,182,35,149,41"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="196,61,267,86"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="149,58,181,63,180,68,148,63"/>
-</map>
diff --git a/d4/d18/composite__simpson__rule_8cpp_a2f67508d5f392b0321772169342c98ad_cgraph.md5 b/d4/d18/composite__simpson__rule_8cpp_a2f67508d5f392b0321772169342c98ad_cgraph.md5
deleted file mode 100644
index 81368d71f..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a2f67508d5f392b0321772169342c98ad_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f53e11488b67bd9662302ace302f3ef6
\ No newline at end of file
diff --git a/d4/d18/composite__simpson__rule_8cpp_a2f67508d5f392b0321772169342c98ad_cgraph.svg b/d4/d18/composite__simpson__rule_8cpp_a2f67508d5f392b0321772169342c98ad_cgraph.svg
deleted file mode 100644
index 8060800ee..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a2f67508d5f392b0321772169342c98ad_cgraph.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::simpson_method::g Pages: 1 -->
-<svg width="204pt" height="69pt"
- viewBox="0.00 0.00 204.25 68.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64.88)">
-<title>numerical_methods::simpson_method::g</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Another test function.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-42.88 0,-42.88 0,-12.37 106.75,-12.37 106.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">simpson_method::g</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.8,-43.36C28.6,-52.43 35.46,-60.88 53.38,-60.88 63.17,-60.88 69.67,-58.35 72.85,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.31,-55.16 73.8,-44.87 69.34,-54.48 76.31,-55.16"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.12,-56.25 143.88,-56.25 143.88,-37 195.12,-37 195.12,-56.25"/>
-<text text-anchor="middle" x="169.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.09,-36.4C115.65,-37.83 124.33,-39.27 132.38,-40.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.67,-44.04 142.11,-42.23 132.82,-37.14 131.67,-44.04"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.25,-19.25 142.75,-19.25 142.75,0 196.25,0 196.25,-19.25"/>
-<text text-anchor="middle" x="169.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.09,-19.31C115.24,-18.03 123.5,-16.72 131.22,-15.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.58,-18.99 140.92,-13.98 130.49,-12.08 131.58,-18.99"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d18/composite__simpson__rule_8cpp_a2f67508d5f392b0321772169342c98ad_cgraph_org.svg b/d4/d18/composite__simpson__rule_8cpp_a2f67508d5f392b0321772169342c98ad_cgraph_org.svg
deleted file mode 100644
index 81108b5b8..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a2f67508d5f392b0321772169342c98ad_cgraph_org.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::simpson_method::g Pages: 1 -->
-<svg width="204pt" height="69pt"
- viewBox="0.00 0.00 204.25 68.88" 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 64.88)">
-<title>numerical_methods::simpson_method::g</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Another test function.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-42.88 0,-42.88 0,-12.37 106.75,-12.37 106.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">simpson_method::g</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.8,-43.36C28.6,-52.43 35.46,-60.88 53.38,-60.88 63.17,-60.88 69.67,-58.35 72.85,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.31,-55.16 73.8,-44.87 69.34,-54.48 76.31,-55.16"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.12,-56.25 143.88,-56.25 143.88,-37 195.12,-37 195.12,-56.25"/>
-<text text-anchor="middle" x="169.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.09,-36.4C115.65,-37.83 124.33,-39.27 132.38,-40.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.67,-44.04 142.11,-42.23 132.82,-37.14 131.67,-44.04"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.25,-19.25 142.75,-19.25 142.75,0 196.25,0 196.25,-19.25"/>
-<text text-anchor="middle" x="169.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.09,-19.31C115.24,-18.03 123.5,-16.72 131.22,-15.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.58,-18.99 140.92,-13.98 130.49,-12.08 131.58,-18.99"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d18/composite__simpson__rule_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/d4/d18/composite__simpson__rule_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
deleted file mode 100644
index 02ce30d37..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
+++ /dev/null
@@ -1,24 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,104,55,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/atof.html#" title=" " alt="" coords="104,5,173,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="41,102,101,40,103,38,106,42,104,44,45,105"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/atoi.html#" title=" " alt="" coords="104,55,172,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="54,103,93,85,95,90,56,108"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,104,174,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="55,114,87,114,87,120,55,120"/>
-<area shape="rect" id="Node000005" href="$d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" title=" " alt="" coords="119,153,158,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="56,126,106,149,104,154,54,130"/>
-<area shape="rect" id="Node000006" href="$dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="117,203,160,228"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="45,128,104,190,106,191,103,195,101,193,41,132"/>
-<area shape="rect" id="Node000007" href="$df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" title="wrapper interface" alt="" coords="222,195,379,236"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="161,213,206,213,206,218,161,218"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/clear.html#" title=" " alt="" coords="458,161,577,187"/>
-<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="379,198,442,186,443,191,380,203"/>
-<area shape="rect" id="Node000009" href="$df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" title="function that adds parenthesis to the string." alt="" coords="427,235,608,276"/>
-<area shape="poly" id="edge8_Node000007_Node000009" title=" " alt="" coords="380,227,412,233,411,239,379,233"/>
-<area shape="poly" id="edge10_Node000009_Node000009" title=" " alt="" coords="477,235,475,225,481,216,496,211,518,209,541,211,555,217,553,222,539,216,517,214,497,216,485,220,480,226,482,234"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="672,217,794,243"/>
-<area shape="poly" id="edge9_Node000009_Node000010" title=" " alt="" coords="607,242,656,237,656,242,608,248"/>
-<area shape="rect" id="Node000011" 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="656,267,810,292"/>
-<area shape="poly" id="edge11_Node000009_Node000011" title=" " alt="" coords="608,263,640,267,640,272,607,268"/>
-</map>
diff --git a/d4/d18/composite__simpson__rule_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/d4/d18/composite__simpson__rule_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
deleted file mode 100644
index 694e59ecc..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2876d363335959fb324f5f8f8ceb79af
\ No newline at end of file
diff --git a/d4/d18/composite__simpson__rule_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/d4/d18/composite__simpson__rule_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
deleted file mode 100644
index 2faf67371..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
+++ /dev/null
@@ -1,295 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 223 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 612;
-var viewHeight = 223;
-var sectionId = 'dynsection-5';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-141.25 0,-141.25 0,-122 37,-122 37,-141.25"/>
-<text text-anchor="middle" x="18.5" y="-127.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/atof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125.75,-215.25 73.75,-215.25 73.75,-196 125.75,-196 125.75,-215.25"/>
-<text text-anchor="middle" x="99.75" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::atof</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.04,-141.71C38.17,-153.39 55.86,-172.92 73,-187.62 73.5,-188.06 74.02,-188.49 74.54,-188.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.11,-191.47 82.19,-194.72 76.34,-185.89 72.11,-191.47"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/atoi.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125.38,-178.25 74.12,-178.25 74.12,-159 125.38,-159 125.38,-178.25"/>
-<text text-anchor="middle" x="99.75" y="-164.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::atoi</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-140.02C46.14,-144.06 56.77,-149.03 66.74,-153.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.26,-156.85 75.8,-157.91 68.22,-150.51 65.26,-156.85"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-141.25 73,-141.25 73,-122 126.5,-122 126.5,-141.25"/>
-<text text-anchor="middle" x="99.75" y="-127.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-131.62C44.56,-131.62 52.97,-131.62 61.25,-131.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.21,-135.13 71.21,-131.63 61.21,-128.13 61.21,-135.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="114.15,-104.25 85.35,-104.25 85.35,-85 114.15,-85 114.15,-104.25"/>
-<text text-anchor="middle" x="99.75" y="-90.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-123.23C48.53,-118.07 62.82,-111.4 74.82,-105.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.08,-109.07 83.66,-101.67 73.12,-102.73 76.08,-109.07"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="116,-67.25 83.5,-67.25 83.5,-48 116,-48 116,-67.25"/>
-<text text-anchor="middle" x="99.75" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.04,-121.54C38.17,-109.86 55.86,-90.33 73,-75.62 73.5,-75.19 74.02,-74.76 74.54,-74.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.34,-77.36 82.19,-68.53 72.11,-71.78 76.34,-77.36"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" target="_top" xlink:title="wrapper interface">
-<polygon fill="white" stroke="#666666" points="280.5,-72.88 162.5,-72.88 162.5,-42.38 280.5,-42.38 280.5,-72.88"/>
-<text text-anchor="start" x="170.5" y="-59.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="221.5" y="-48.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::generate</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.41,-57.62C125.57,-57.62 137.87,-57.62 150.79,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.74,-61.13 160.74,-57.63 150.74,-54.13 150.74,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="428.88,-98.25 339.38,-98.25 339.38,-79 428.88,-79 428.88,-98.25"/>
-<text text-anchor="middle" x="384.12" y="-84.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.94,-68.9C296.24,-71.86 312.68,-75.03 327.81,-77.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.11,-81.38 337.6,-79.84 328.44,-74.51 327.11,-81.38"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" target="_top" xlink:title="function that adds parenthesis to the string.">
-<polygon fill="white" stroke="#666666" points="451.75,-42.88 316.5,-42.88 316.5,-12.37 451.75,-12.37 451.75,-42.88"/>
-<text text-anchor="start" x="324.5" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="384.12" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::makeStrings</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.94,-46.71C288.69,-45.26 296.72,-43.76 304.73,-42.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.33,-45.71 314.52,-40.44 304.05,-38.83 305.33,-45.71"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node9 -->
-<g id="edge10_Node000009_Node000009" class="edge">
-<title>Node9&#45;&gt;Node9</title>
-<g id="a_edge10_Node000009_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M355.51,-43.36C349.67,-52.43 359.21,-60.88 384.12,-60.88 397.75,-60.88 406.78,-58.35 411.21,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.65,-55.24 412.54,-44.86 407.71,-54.29 414.65,-55.24"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="591.5,-56.25 499.75,-56.25 499.75,-37 591.5,-37 591.5,-56.25"/>
-<text text-anchor="middle" x="545.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M451.84,-35.57C463.88,-37.01 476.32,-38.49 488.04,-39.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="487.62,-43.36 497.96,-41.07 488.45,-36.41 487.62,-43.36"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="603.5,-19.25 487.75,-19.25 487.75,0 603.5,0 603.5,-19.25"/>
-<text text-anchor="middle" x="545.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge11_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge11_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M451.84,-20.1C459.85,-19.19 468.04,-18.27 476.07,-17.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="476.24,-20.86 485.78,-16.27 475.45,-13.91 476.24,-20.86"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="composite__simpson__rule_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d18/composite__simpson__rule_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/d4/d18/composite__simpson__rule_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
deleted file mode 100644
index 673d7249d..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
+++ /dev/null
@@ -1,212 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="612pt" height="223pt"
- viewBox="0.00 0.00 611.50 223.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 219.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-141.25 0,-141.25 0,-122 37,-122 37,-141.25"/>
-<text text-anchor="middle" x="18.5" y="-127.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/atof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125.75,-215.25 73.75,-215.25 73.75,-196 125.75,-196 125.75,-215.25"/>
-<text text-anchor="middle" x="99.75" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::atof</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.04,-141.71C38.17,-153.39 55.86,-172.92 73,-187.62 73.5,-188.06 74.02,-188.49 74.54,-188.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.11,-191.47 82.19,-194.72 76.34,-185.89 72.11,-191.47"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/atoi.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125.38,-178.25 74.12,-178.25 74.12,-159 125.38,-159 125.38,-178.25"/>
-<text text-anchor="middle" x="99.75" y="-164.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::atoi</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-140.02C46.14,-144.06 56.77,-149.03 66.74,-153.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.26,-156.85 75.8,-157.91 68.22,-150.51 65.26,-156.85"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-141.25 73,-141.25 73,-122 126.5,-122 126.5,-141.25"/>
-<text text-anchor="middle" x="99.75" y="-127.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-131.62C44.56,-131.62 52.97,-131.62 61.25,-131.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.21,-135.13 71.21,-131.63 61.21,-128.13 61.21,-135.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="114.15,-104.25 85.35,-104.25 85.35,-85 114.15,-85 114.15,-104.25"/>
-<text text-anchor="middle" x="99.75" y="-90.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-123.23C48.53,-118.07 62.82,-111.4 74.82,-105.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.08,-109.07 83.66,-101.67 73.12,-102.73 76.08,-109.07"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="116,-67.25 83.5,-67.25 83.5,-48 116,-48 116,-67.25"/>
-<text text-anchor="middle" x="99.75" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.04,-121.54C38.17,-109.86 55.86,-90.33 73,-75.62 73.5,-75.19 74.02,-74.76 74.54,-74.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.34,-77.36 82.19,-68.53 72.11,-71.78 76.34,-77.36"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" target="_top" xlink:title="wrapper interface">
-<polygon fill="white" stroke="#666666" points="280.5,-72.88 162.5,-72.88 162.5,-42.38 280.5,-42.38 280.5,-72.88"/>
-<text text-anchor="start" x="170.5" y="-59.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="221.5" y="-48.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::generate</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.41,-57.62C125.57,-57.62 137.87,-57.62 150.79,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.74,-61.13 160.74,-57.63 150.74,-54.13 150.74,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="428.88,-98.25 339.38,-98.25 339.38,-79 428.88,-79 428.88,-98.25"/>
-<text text-anchor="middle" x="384.12" y="-84.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.94,-68.9C296.24,-71.86 312.68,-75.03 327.81,-77.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.11,-81.38 337.6,-79.84 328.44,-74.51 327.11,-81.38"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" target="_top" xlink:title="function that adds parenthesis to the string.">
-<polygon fill="white" stroke="#666666" points="451.75,-42.88 316.5,-42.88 316.5,-12.37 451.75,-12.37 451.75,-42.88"/>
-<text text-anchor="start" x="324.5" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="384.12" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::makeStrings</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.94,-46.71C288.69,-45.26 296.72,-43.76 304.73,-42.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.33,-45.71 314.52,-40.44 304.05,-38.83 305.33,-45.71"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node9 -->
-<g id="edge10_Node000009_Node000009" class="edge">
-<title>Node9&#45;&gt;Node9</title>
-<g id="a_edge10_Node000009_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M355.51,-43.36C349.67,-52.43 359.21,-60.88 384.12,-60.88 397.75,-60.88 406.78,-58.35 411.21,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.65,-55.24 412.54,-44.86 407.71,-54.29 414.65,-55.24"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="591.5,-56.25 499.75,-56.25 499.75,-37 591.5,-37 591.5,-56.25"/>
-<text text-anchor="middle" x="545.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M451.84,-35.57C463.88,-37.01 476.32,-38.49 488.04,-39.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="487.62,-43.36 497.96,-41.07 488.45,-36.41 487.62,-43.36"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="603.5,-19.25 487.75,-19.25 487.75,0 603.5,0 603.5,-19.25"/>
-<text text-anchor="middle" x="545.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge11_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge11_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M451.84,-20.1C459.85,-19.19 468.04,-18.27 476.07,-17.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="476.24,-20.86 485.78,-16.27 475.45,-13.91 476.24,-20.86"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d18/composite__simpson__rule_8cpp_a4251b4df4748a0b9c43a48f61bdd2397_cgraph.map b/d4/d18/composite__simpson__rule_8cpp_a4251b4df4748a0b9c43a48f61bdd2397_cgraph.map
deleted file mode 100644
index f81befb3b..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a4251b4df4748a0b9c43a48f61bdd2397_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="numerical_methods::simpson_method::f" name="numerical_methods::simpson_method::f">
-<area shape="rect" id="Node000001" title="A function f(x) that will be used to test the method." alt="" coords="5,29,148,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="47,29,45,19,50,11,61,5,77,3,94,5,104,11,101,16,92,10,76,8,62,10,54,14,50,20,52,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/log.html#" title=" " alt="" coords="198,12,262,37"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="148,35,183,29,183,35,149,41"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="196,61,265,86"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="149,58,181,63,180,69,148,63"/>
-</map>
diff --git a/d4/d18/composite__simpson__rule_8cpp_a4251b4df4748a0b9c43a48f61bdd2397_cgraph.md5 b/d4/d18/composite__simpson__rule_8cpp_a4251b4df4748a0b9c43a48f61bdd2397_cgraph.md5
deleted file mode 100644
index 413195e6a..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a4251b4df4748a0b9c43a48f61bdd2397_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-904bc754b6db647a4b26294f08713992
\ No newline at end of file
diff --git a/d4/d18/composite__simpson__rule_8cpp_a4251b4df4748a0b9c43a48f61bdd2397_cgraph.svg b/d4/d18/composite__simpson__rule_8cpp_a4251b4df4748a0b9c43a48f61bdd2397_cgraph.svg
deleted file mode 100644
index 9946fe105..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a4251b4df4748a0b9c43a48f61bdd2397_cgraph.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::simpson_method::f Pages: 1 -->
-<svg width="203pt" height="69pt"
- viewBox="0.00 0.00 202.75 68.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64.88)">
-<title>numerical_methods::simpson_method::f</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function f(x) that will be used to test the method.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-42.88 0,-42.88 0,-12.37 106.75,-12.37 106.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">simpson_method::f</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.93,-43.36C28.76,-52.43 35.57,-60.88 53.38,-60.88 63.11,-60.88 69.56,-58.35 72.72,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.18,-55.16 73.67,-44.87 69.22,-54.48 76.18,-55.16"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/log.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="192.88,-56.25 144.62,-56.25 144.62,-37 192.88,-37 192.88,-56.25"/>
-<text text-anchor="middle" x="168.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::log</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.08,-36.46C115.96,-37.95 124.98,-39.46 133.24,-40.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.41,-44.25 142.85,-42.45 133.56,-37.35 132.41,-44.25"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194.75,-19.25 142.75,-19.25 142.75,0 194.75,0 194.75,-19.25"/>
-<text text-anchor="middle" x="168.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.08,-19.26C115.22,-17.96 123.47,-16.65 131.16,-15.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.48,-18.93 140.8,-13.9 130.38,-12.01 131.48,-18.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d18/composite__simpson__rule_8cpp_a4251b4df4748a0b9c43a48f61bdd2397_cgraph_org.svg b/d4/d18/composite__simpson__rule_8cpp_a4251b4df4748a0b9c43a48f61bdd2397_cgraph_org.svg
deleted file mode 100644
index 72621bc2c..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a4251b4df4748a0b9c43a48f61bdd2397_cgraph_org.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::simpson_method::f Pages: 1 -->
-<svg width="203pt" height="69pt"
- viewBox="0.00 0.00 202.75 68.88" 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 64.88)">
-<title>numerical_methods::simpson_method::f</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function f(x) that will be used to test the method.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-42.88 0,-42.88 0,-12.37 106.75,-12.37 106.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">simpson_method::f</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.93,-43.36C28.76,-52.43 35.57,-60.88 53.38,-60.88 63.11,-60.88 69.56,-58.35 72.72,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.18,-55.16 73.67,-44.87 69.22,-54.48 76.18,-55.16"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/log.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="192.88,-56.25 144.62,-56.25 144.62,-37 192.88,-37 192.88,-56.25"/>
-<text text-anchor="middle" x="168.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::log</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.08,-36.46C115.96,-37.95 124.98,-39.46 133.24,-40.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.41,-44.25 142.85,-42.45 133.56,-37.35 132.41,-44.25"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194.75,-19.25 142.75,-19.25 142.75,0 194.75,0 194.75,-19.25"/>
-<text text-anchor="middle" x="168.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.08,-19.26C115.22,-17.96 123.47,-16.65 131.16,-15.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.48,-18.93 140.8,-13.9 130.38,-12.01 131.48,-18.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d18/composite__simpson__rule_8cpp_a6d8df83a6f26ce24a75d3b358b7f5b8a_cgraph.map b/d4/d18/composite__simpson__rule_8cpp_a6d8df83a6f26ce24a75d3b358b7f5b8a_cgraph.map
deleted file mode 100644
index adf248b7b..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a6d8df83a6f26ce24a75d3b358b7f5b8a_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="numerical_methods::simpson_method::l" name="numerical_methods::simpson_method::l">
-<area shape="rect" id="Node000001" title="Another test function." alt="" coords="5,29,148,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="47,29,46,19,50,11,61,5,77,3,93,5,103,11,100,16,91,10,76,8,63,10,54,14,51,20,52,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/log.html#" title=" " alt="" coords="196,37,260,62"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="148,47,180,47,180,52,148,52"/>
-</map>
diff --git a/d4/d18/composite__simpson__rule_8cpp_a6d8df83a6f26ce24a75d3b358b7f5b8a_cgraph.md5 b/d4/d18/composite__simpson__rule_8cpp_a6d8df83a6f26ce24a75d3b358b7f5b8a_cgraph.md5
deleted file mode 100644
index c728d46d6..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a6d8df83a6f26ce24a75d3b358b7f5b8a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-10c8585472bb854a6e3bf6fed59b4fdc
\ No newline at end of file
diff --git a/d4/d18/composite__simpson__rule_8cpp_a6d8df83a6f26ce24a75d3b358b7f5b8a_cgraph.svg b/d4/d18/composite__simpson__rule_8cpp_a6d8df83a6f26ce24a75d3b358b7f5b8a_cgraph.svg
deleted file mode 100644
index 8debeddef..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a6d8df83a6f26ce24a75d3b358b7f5b8a_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::simpson_method::l Pages: 1 -->
-<svg width="199pt" height="57pt"
- viewBox="0.00 0.00 199.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>numerical_methods::simpson_method::l</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Another test function.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-30.5 0,-30.5 0,0 106.75,0 106.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">simpson_method::l</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.26,-30.99C29.16,-40.06 35.86,-48.5 53.38,-48.5 62.95,-48.5 69.3,-45.97 72.41,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.87,-42.78 73.34,-32.49 68.9,-42.11 75.87,-42.78"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/log.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191,-24.88 142.75,-24.88 142.75,-5.63 191,-5.63 191,-24.88"/>
-<text text-anchor="middle" x="166.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::log</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.19,-15.25C115.31,-15.25 123.52,-15.25 131.12,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.95,-18.75 140.95,-15.25 130.95,-11.75 130.95,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d18/composite__simpson__rule_8cpp_a6d8df83a6f26ce24a75d3b358b7f5b8a_cgraph_org.svg b/d4/d18/composite__simpson__rule_8cpp_a6d8df83a6f26ce24a75d3b358b7f5b8a_cgraph_org.svg
deleted file mode 100644
index ecb796601..000000000
--- a/d4/d18/composite__simpson__rule_8cpp_a6d8df83a6f26ce24a75d3b358b7f5b8a_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::simpson_method::l Pages: 1 -->
-<svg width="199pt" height="57pt"
- viewBox="0.00 0.00 199.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>numerical_methods::simpson_method::l</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Another test function.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-30.5 0,-30.5 0,0 106.75,0 106.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">simpson_method::l</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.26,-30.99C29.16,-40.06 35.86,-48.5 53.38,-48.5 62.95,-48.5 69.3,-45.97 72.41,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.87,-42.78 73.34,-32.49 68.9,-42.11 75.87,-42.78"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/log.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191,-24.88 142.75,-24.88 142.75,-5.63 191,-5.63 191,-24.88"/>
-<text text-anchor="middle" x="166.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::log</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.19,-15.25C115.31,-15.25 123.52,-15.25 131.12,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.95,-18.75 140.95,-15.25 130.95,-11.75 130.95,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d18/composite__simpson__rule_8cpp_source.html b/d4/d18/composite__simpson__rule_8cpp_source.html
new file mode 100644
index 000000000..92f7f2810
--- /dev/null
+++ b/d4/d18/composite__simpson__rule_8cpp_source.html
@@ -0,0 +1,277 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/composite_simpson_rule.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d18/composite__simpson__rule_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">composite_simpson_rule.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/d18/composite__simpson__rule_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="preprocessor">#include &lt;cassert&gt;</span>  </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#include &lt;cmath&gt;</span>    </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &lt;cstdint&gt;</span>     </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#include &lt;cstdlib&gt;</span>     </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="preprocessor">#include &lt;functional&gt;</span>  </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="preprocessor">#include &lt;iostream&gt;</span>    </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="preprocessor">#include &lt;map&gt;</span>         </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a> {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d3/d6d/namespacesimpson__method.html">simpson_method</a> {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="keywordtype">double</span> evaluate_by_simpson(std::int32_t N, <span class="keywordtype">double</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, <span class="keywordtype">double</span> a,</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                           <span class="keyword">const</span> std::function&lt;<span class="keywordtype">double</span>(<span class="keywordtype">double</span>)&gt;&amp; func) {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    std::map&lt;std::int32_t, double&gt;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        data_table;  <span class="comment">// Contains the data points. key: i, value: f(xi)</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordtype">double</span> xi = a;   <span class="comment">// Initialize xi to the starting point x0 = a</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="comment">// Create the data table</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keywordtype">double</span> temp = NAN;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="keywordflow">for</span> (std::int32_t i = 0; i &lt;= <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        temp = func(xi);</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        data_table.insert(</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            std::pair&lt;std::int32_t, double&gt;(i, temp));  <span class="comment">// add i and f(xi)</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        xi += <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>;  <span class="comment">// Get the next point xi for the next iteration</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    }</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="comment">// Evaluate the integral.</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="comment">// Remember: f(x0) + 4*f(x1) + 2*f(x2) + ... + 2*f(xN-2) + 4*f(xN-1) + f(xN)</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="keywordtype">double</span> evaluate_integral = 0;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keywordflow">for</span> (std::int32_t i = 0; i &lt;= <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        <span class="keywordflow">if</span> (i == 0 || i == N) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            evaluate_integral += data_table.at(i);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (i % 2 == 1) {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>            evaluate_integral += 4 * data_table.at(i);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>            evaluate_integral += 2 * data_table.at(i);</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        }</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    }</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="comment">// Multiply by the coefficient h/3</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    evaluate_integral *= <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> / 3;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="comment">// If the result calculated is nan, then the user has given wrong input</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="comment">// interval.</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    assert(!std::isnan(evaluate_integral) &amp;&amp;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>           <span class="stringliteral">&quot;The definite integral can&#39;t be evaluated. Check the validity of &quot;</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>           <span class="stringliteral">&quot;your input.\n&quot;</span>);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="comment">// Else return</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="keywordflow">return</span> evaluate_integral;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>}</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"><a class="line" href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">  113</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">f</a>(<span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> std::sqrt(x) + std::log(x); }</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"><a class="line" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">  115</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>(<span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> std::exp(-x) * (4 - std::pow(x, 2)); }</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"><a class="line" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">  117</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>(<span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> std::sqrt(2 * std::pow(x, 3) + 3); }</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"><a class="line" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">  119</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>(<span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> x + std::log(2 * x + 1); }</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>}  <span class="comment">// namespace simpson_method</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>}  <span class="comment">// namespace numerical_methods</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span> </div>
+<div class="foldopen" id="foldopen00132" data-start="{" data-end="}">
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"><a class="line" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e">  132</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(std::int32_t N, <span class="keywordtype">double</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, <span class="keywordtype">double</span> a, <span class="keywordtype">double</span> b,</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>                 <span class="keywordtype">bool</span> used_argv_parameters) {</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <span class="comment">// Call the functions and find the integral of each function</span></div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <span class="keywordtype">double</span> result_f = numerical_methods::simpson_method::evaluate_by_simpson(</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::simpson_method::f);</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    assert((used_argv_parameters || (result_f &gt;= 4.09 &amp;&amp; result_f &lt;= 4.10)) &amp;&amp;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>           <span class="stringliteral">&quot;The result of f(x) is wrong&quot;</span>);</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The result of integral f(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_f &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    <span class="keywordtype">double</span> result_g = numerical_methods::simpson_method::evaluate_by_simpson(</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::simpson_method::g);</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    assert((used_argv_parameters || (result_g &gt;= 0.27 &amp;&amp; result_g &lt;= 0.28)) &amp;&amp;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>           <span class="stringliteral">&quot;The result of g(x) is wrong&quot;</span>);</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The result of integral g(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_g &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span> </div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    <span class="keywordtype">double</span> result_k = numerical_methods::simpson_method::evaluate_by_simpson(</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>        N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::simpson_method::k);</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    assert((used_argv_parameters || (result_k &gt;= 9.06 &amp;&amp; result_k &lt;= 9.07)) &amp;&amp;</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>           <span class="stringliteral">&quot;The result of k(x) is wrong&quot;</span>);</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The result of integral k(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_k &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span> </div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    <span class="keywordtype">double</span> result_l = numerical_methods::simpson_method::evaluate_by_simpson(</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>        N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::simpson_method::l);</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    assert((used_argv_parameters || (result_l &gt;= 7.16 &amp;&amp; result_l &lt;= 7.17)) &amp;&amp;</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>           <span class="stringliteral">&quot;The result of l(x) is wrong&quot;</span>);</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The result of integral l(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_l &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>}</div>
+</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span> </div>
+<div class="foldopen" id="foldopen00170" data-start="{" data-end="}">
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"><a class="line" href="../../d4/d18/composite__simpson__rule_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">  170</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span>** argv) {</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    std::int32_t N = 16;  </div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    <span class="keywordtype">double</span> a = 1, b = 3;  </div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = NAN;       </div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    <span class="keywordtype">bool</span> used_argv_parameters =</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        <span class="keyword">false</span>;  <span class="comment">// If argv parameters are used then the assert must be omitted</span></div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>                <span class="comment">// for the tst cases</span></div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span> </div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    <span class="comment">// Get user input (by the command line parameters or the console after</span></div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    <span class="comment">// displaying messages)</span></div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    <span class="keywordflow">if</span> (argc == 4) {</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>        N = std::atoi(argv[1]);</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        a = std::atof(argv[2]);</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        b = std::atof(argv[3]);</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>        <span class="comment">// Check if a&lt;b else abort</span></div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>        assert(a &lt; b &amp;&amp; <span class="stringliteral">&quot;a has to be less than b&quot;</span>);</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        assert(N &gt; 0 &amp;&amp; <span class="stringliteral">&quot;N has to be &gt; 0&quot;</span>);</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>        <span class="keywordflow">if</span> (N &lt; 16 || a != 1 || b != 3) {</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>            used_argv_parameters = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>        }</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;You selected N=&quot;</span> &lt;&lt; N &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>                  &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Default N=&quot;</span> &lt;&lt; N &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>                  &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    }</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span> </div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    <span class="comment">// Find the step</span></div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = (b - a) / N;</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span> </div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, b, used_argv_parameters);  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span> </div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>}</div>
+</div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="#l00115">composite_simpson_rule.cpp:115</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a4251b4df4748a0b9c43a48f61bdd2397"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">numerical_methods::simpson_method::f</a></div><div class="ttdeci">double f(double x)</div><div class="ttdoc">A function f(x) that will be used to test the method.</div><div class="ttdef"><b>Definition</b> <a href="#l00113">composite_simpson_rule.cpp:113</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="#l00119">composite_simpson_rule.cpp:119</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00082">generate_parentheses.cpp:82</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00045">hash_search.cpp:45</a></div></div>
+<div class="ttc" id="anamespacenumerical__methods_html"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacesimpson__method_html"><div class="ttname"><a href="../../d3/d6d/namespacesimpson__method.html">simpson_method</a></div><div class="ttdoc">Contains the Simpson's method implementation.</div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../d4/d18/composite__simpson__rule_8cpp.html">composite_simpson_rule.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d1c/namespacehamming__distance.html b/d4/d1c/namespacehamming__distance.html
index 3c16a9530..ed589c942 100644
--- a/d4/d1c/namespacehamming__distance.html
+++ b/d4/d1c/namespacehamming__distance.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: hamming_distance Namespace Reference</title>
+<title>TheAlgorithms/C++: hamming_distance Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d4/d1e/class_r_btree-members.html b/d4/d1e/class_r_btree-members.html
index 66f7eaf39..9c7ba9eb3 100644
--- a/d4/d1e/class_r_btree-members.html
+++ b/d4/d1e/class_r_btree-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d4/d1f/class_min_heap-members.html b/d4/d1f/class_min_heap-members.html
index 8d5a37560..d205283b8 100644
--- a/d4/d1f/class_min_heap-members.html
+++ b/d4/d1f/class_min_heap-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d4/d21/least__common__multiple_8cpp.html b/d4/d21/least__common__multiple_8cpp.html
index eae6761c6..704a16ee7 100644
--- a/d4/d21/least__common__multiple_8cpp.html
+++ b/d4/d21/least__common__multiple_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/least_common_multiple.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/least_common_multiple.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -116,7 +133,9 @@ Include dependency graph for least_common_multiple.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d8b/least__common__multiple_8cpp__incl.svg" width="227" height="111"><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">
+</div>
+<p><a href="../../d4/d21/least__common__multiple_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a8ba1fc66e4134ab25b2602b323150563" id="r_a8ba1fc66e4134ab25b2602b323150563"><td class="memItemLeft" align="right" valign="top">unsigned int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8ba1fc66e4134ab25b2602b323150563">gcd</a> (unsigned int x, unsigned int y)</td></tr>
@@ -131,6 +150,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Copyright 2020 </p><dl class="section author"><dt>Author</dt><dd>tjgurwara99</dd></dl>
 <p>A basic implementation of LCM function </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d21/least__common__multiple_8cpp_source.html">least_common_multiple.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a8ba1fc66e4134ab25b2602b323150563" name="a8ba1fc66e4134ab25b2602b323150563"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a8ba1fc66e4134ab25b2602b323150563">&#9670;&#160;</a></span>gcd()</h2>
@@ -151,6 +172,8 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Function for finding greatest common divisor of two numbers. @params two integers x and y whose gcd we want to find. </p><dl class="section return"><dt>Returns</dt><dd>greatest common divisor of x and y. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d21/least__common__multiple_8cpp_source.html#l00016">16</a> of file <a class="el" href="../../d4/d21/least__common__multiple_8cpp_source.html">least_common_multiple.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   16</span>                                                 {</div>
 <div class="line"><span class="lineno">   17</span>    <span class="keywordflow">if</span> (x == 0) {</div>
 <div class="line"><span class="lineno">   18</span>        <span class="keywordflow">return</span> y;</div>
@@ -172,13 +195,8 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   34</span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> temp = y / x;</div>
 <div class="line"><span class="lineno">   35</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="#a8ba1fc66e4134ab25b2602b323150563">gcd</a>(x, y - temp * x);</div>
 <div class="line"><span class="lineno">   36</span>}</div>
-<div class="ttc" id="aleast__common__multiple_8cpp_html_a8ba1fc66e4134ab25b2602b323150563"><div class="ttname"><a href="#a8ba1fc66e4134ab25b2602b323150563">gcd</a></div><div class="ttdeci">unsigned int gcd(unsigned int x, unsigned int y)</div><div class="ttdef"><b>Definition</b> least_common_multiple.cpp:16</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d21/least__common__multiple_8cpp_a8ba1fc66e4134ab25b2602b323150563_cgraph.svg" width="54" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aleast__common__multiple_8cpp_html_a8ba1fc66e4134ab25b2602b323150563"><div class="ttname"><a href="#a8ba1fc66e4134ab25b2602b323150563">gcd</a></div><div class="ttdeci">unsigned int gcd(unsigned int x, unsigned int y)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d21/least__common__multiple_8cpp_source.html#l00016">least_common_multiple.cpp:16</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8d0e241db517813725e721a152e3a25" name="aa8d0e241db517813725e721a152e3a25"></a>
@@ -200,15 +218,12 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Function for finding the least common multiple of two numbers. @params integer x and y whose lcm we want to find. </p><dl class="section return"><dt>Returns</dt><dd>lcm of x and y using the relation x * y = gcd(x, y) * lcm(x, y) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d21/least__common__multiple_8cpp_source.html#l00043">43</a> of file <a class="el" href="../../d4/d21/least__common__multiple_8cpp_source.html">least_common_multiple.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   43</span>                                                 {</div>
 <div class="line"><span class="lineno">   44</span>  <span class="keywordflow">return</span> x / <a class="code hl_function" href="#a8ba1fc66e4134ab25b2602b323150563">gcd</a>(x, y) * y;</div>
 <div class="line"><span class="lineno">   45</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.svg" width="144" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -226,17 +241,14 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d21/least__common__multiple_8cpp_source.html#l00078">78</a> of file <a class="el" href="../../d4/d21/least__common__multiple_8cpp_source.html">least_common_multiple.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   78</span>           {</div>
 <div class="line"><span class="lineno">   79</span>    <a class="code hl_function" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
 <div class="line"><span class="lineno">   80</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   81</span>}</div>
-<div class="ttc" id="aleast__common__multiple_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> least_common_multiple.cpp:50</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="368" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aleast__common__multiple_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d21/least__common__multiple_8cpp_source.html#l00050">least_common_multiple.cpp:50</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a88ec9ad42717780d6caaff9d3d6977f9" name="a88ec9ad42717780d6caaff9d3d6977f9"></a>
@@ -254,39 +266,34 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Function for testing the <a class="el" href="#aa8d0e241db517813725e721a152e3a25">lcm()</a> functions with some assert statements. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d21/least__common__multiple_8cpp_source.html#l00050">50</a> of file <a class="el" href="../../d4/d21/least__common__multiple_8cpp_source.html">least_common_multiple.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   50</span>             {</div>
 <div class="line"><span class="lineno">   51</span>    <span class="comment">// First test on lcm(5,10) == 10</span></div>
 <div class="line"><span class="lineno">   52</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;LCM of 5 and 10 is 10 but lcm function gives a different &quot;</span></div>
 <div class="line"><span class="lineno">   53</span>                  <span class="stringliteral">&quot;result.\n&quot;</span>,</div>
 <div class="line"><span class="lineno">   54</span>            <a class="code hl_function" href="#aa8d0e241db517813725e721a152e3a25">lcm</a>(5, 10) == 10));</div>
-<div class="line"><span class="lineno">   55</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;First assertion passes: LCM of 5 and 10 is &quot;</span> &lt;&lt; <a class="code hl_function" href="#aa8d0e241db517813725e721a152e3a25">lcm</a>(5, 10)</div>
-<div class="line"><span class="lineno">   56</span>              &lt;&lt; <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">   55</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;First assertion passes: LCM of 5 and 10 is &quot;</span> &lt;&lt; <a class="code hl_function" href="#aa8d0e241db517813725e721a152e3a25">lcm</a>(5, 10)</div>
+<div class="line"><span class="lineno">   56</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   57</span> </div>
 <div class="line"><span class="lineno">   58</span>    <span class="comment">// Second test on lcm(2,3) == 6 as 2 and 3 are coprime (prime in fact)</span></div>
 <div class="line"><span class="lineno">   59</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;LCM of 2 and 3 is 6 but lcm function gives a different &quot;</span></div>
 <div class="line"><span class="lineno">   60</span>                  <span class="stringliteral">&quot;result.\n&quot;</span>,</div>
 <div class="line"><span class="lineno">   61</span>            <a class="code hl_function" href="#aa8d0e241db517813725e721a152e3a25">lcm</a>(2, 3) == 6));</div>
-<div class="line"><span class="lineno">   62</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Second assertion passes: LCM of 2 and 3 is &quot;</span> &lt;&lt; <a class="code hl_function" href="#aa8d0e241db517813725e721a152e3a25">lcm</a>(2, 3)</div>
-<div class="line"><span class="lineno">   63</span>              &lt;&lt; <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">   62</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Second assertion passes: LCM of 2 and 3 is &quot;</span> &lt;&lt; <a class="code hl_function" href="#aa8d0e241db517813725e721a152e3a25">lcm</a>(2, 3)</div>
+<div class="line"><span class="lineno">   63</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   64</span> </div>
 <div class="line"><span class="lineno">   65</span>    <span class="comment">// Testing an integer overflow.</span></div>
 <div class="line"><span class="lineno">   66</span>    <span class="comment">// The algorithm should work as long as the result fits into integer.</span></div>
 <div class="line"><span class="lineno">   67</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;LCM of 987654321 and 987654321 is 987654321 but lcm function&quot;</span></div>
 <div class="line"><span class="lineno">   68</span>                  <span class="stringliteral">&quot; gives a different result.\n&quot;</span>,</div>
 <div class="line"><span class="lineno">   69</span>            <a class="code hl_function" href="#aa8d0e241db517813725e721a152e3a25">lcm</a>(987654321, 987654321) == 987654321));</div>
-<div class="line"><span class="lineno">   70</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Third assertion passes: LCM of 987654321 and 987654321 is &quot;</span></div>
+<div class="line"><span class="lineno">   70</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Third assertion passes: LCM of 987654321 and 987654321 is &quot;</span></div>
 <div class="line"><span class="lineno">   71</span>              &lt;&lt; <a class="code hl_function" href="#aa8d0e241db517813725e721a152e3a25">lcm</a>(987654321, 987654321)</div>
-<div class="line"><span class="lineno">   72</span>              &lt;&lt; <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">   72</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   73</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="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="aleast__common__multiple_8cpp_html_aa8d0e241db517813725e721a152e3a25"><div class="ttname"><a href="#aa8d0e241db517813725e721a152e3a25">lcm</a></div><div class="ttdeci">unsigned int lcm(unsigned int x, unsigned int y)</div><div class="ttdef"><b>Definition</b> least_common_multiple.cpp:43</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg" width="271" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aleast__common__multiple_8cpp_html_aa8d0e241db517813725e721a152e3a25"><div class="ttname"><a href="#aa8d0e241db517813725e721a152e3a25">lcm</a></div><div class="ttdeci">unsigned int lcm(unsigned int x, unsigned int y)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d21/least__common__multiple_8cpp_source.html#l00043">least_common_multiple.cpp:43</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map b/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
deleted file mode 100644
index 9c4b21884..000000000
--- a/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,56,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="104,5,175,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,35,88,27,89,33,57,40"/>
-<area shape="rect" id="Node000003" href="$d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25" title=" " alt="" coords="118,55,160,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="57,46,103,57,102,62,55,52"/>
-<area shape="rect" id="Node000004" href="$d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563" title=" " alt="" coords="223,55,265,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="161,65,207,65,207,70,161,70"/>
-<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="225,55,222,46,224,37,232,30,244,28,258,31,265,38,261,41,255,35,244,33,234,35,229,40,227,46,230,53"/>
-</map>
diff --git a/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 b/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
deleted file mode 100644
index a38984557..000000000
--- a/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9d6591f62b72129e41233c1aab4965dd
\ No newline at end of file
diff --git a/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg b/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
deleted file mode 100644
index 7326fc36b..000000000
--- a/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
+++ /dev/null
@@ -1,110 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="203pt" height="64pt"
- viewBox="0.00 0.00 203.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-56.25 73.75,-56.25 73.75,-37 127.25,-37 127.25,-56.25"/>
-<text text-anchor="middle" x="100.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-31.94C45.22,-33.67 53.89,-35.74 62.39,-37.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.34,-41.12 71.88,-40.03 62.96,-34.31 61.34,-41.12"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116.38,-19.25 84.62,-19.25 84.62,0 116.38,0 116.38,-19.25"/>
-<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">lcm</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-23.54C48.3,-21.2 61.48,-18.22 72.99,-15.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.72,-19.04 82.71,-13.42 72.18,-12.21 73.72,-19.04"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 163.25,-19.25 163.25,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="179.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.64,-9.62C126.54,-9.62 139.76,-9.62 151.4,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.24,-13.13 161.24,-9.63 151.24,-6.13 151.24,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M166.82,-19.54C161.2,-28.15 165.3,-37.25 179.12,-37.25 186.68,-37.25 191.34,-34.53 193.08,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.58,-30.41 191.66,-21.04 189.66,-31.44 196.58,-30.41"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg b/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
deleted file mode 100644
index 03f5b3c37..000000000
--- a/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="203pt" height="64pt"
- viewBox="0.00 0.00 203.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-56.25 73.75,-56.25 73.75,-37 127.25,-37 127.25,-56.25"/>
-<text text-anchor="middle" x="100.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-31.94C45.22,-33.67 53.89,-35.74 62.39,-37.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.34,-41.12 71.88,-40.03 62.96,-34.31 61.34,-41.12"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116.38,-19.25 84.62,-19.25 84.62,0 116.38,0 116.38,-19.25"/>
-<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">lcm</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-23.54C48.3,-21.2 61.48,-18.22 72.99,-15.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.72,-19.04 82.71,-13.42 72.18,-12.21 73.72,-19.04"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 163.25,-19.25 163.25,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="179.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.64,-9.62C126.54,-9.62 139.76,-9.62 151.4,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.24,-13.13 161.24,-9.63 151.24,-6.13 151.24,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M166.82,-19.54C161.2,-28.15 165.3,-37.25 179.12,-37.25 186.68,-37.25 191.34,-34.53 193.08,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.58,-30.41 191.66,-21.04 189.66,-31.44 196.58,-30.41"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d21/least__common__multiple_8cpp_a8ba1fc66e4134ab25b2602b323150563_cgraph.map b/d4/d21/least__common__multiple_8cpp_a8ba1fc66e4134ab25b2602b323150563_cgraph.map
deleted file mode 100644
index 979fb27dc..000000000
--- a/d4/d21/least__common__multiple_8cpp_a8ba1fc66e4134ab25b2602b323150563_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="gcd" name="gcd">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,48,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="17,29,17,12,20,5,27,3,33,6,36,13,31,15,29,10,26,8,24,9,22,13,23,29"/>
-</map>
diff --git a/d4/d21/least__common__multiple_8cpp_a8ba1fc66e4134ab25b2602b323150563_cgraph.md5 b/d4/d21/least__common__multiple_8cpp_a8ba1fc66e4134ab25b2602b323150563_cgraph.md5
deleted file mode 100644
index 3ce93c57e..000000000
--- a/d4/d21/least__common__multiple_8cpp_a8ba1fc66e4134ab25b2602b323150563_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b8b5505663d8370c4619b70f19abe443
\ No newline at end of file
diff --git a/d4/d21/least__common__multiple_8cpp_a8ba1fc66e4134ab25b2602b323150563_cgraph.svg b/d4/d21/least__common__multiple_8cpp_a8ba1fc66e4134ab25b2602b323150563_cgraph.svg
deleted file mode 100644
index e1eb36a6c..000000000
--- a/d4/d21/least__common__multiple_8cpp_a8ba1fc66e4134ab25b2602b323150563_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: gcd Pages: 1 -->
-<svg width="40pt" height="45pt"
- viewBox="0.00 0.00 39.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>gcd</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="31.75,-19.25 0,-19.25 0,0 31.75,0 31.75,-19.25"/>
-<text text-anchor="middle" x="15.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M10.9,-19.54C8.64,-28.15 10.29,-37.25 15.88,-37.25 18.84,-37.25 20.7,-34.68 21.45,-30.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="24.95,-30.85 20.93,-21.05 17.96,-31.22 24.95,-30.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d21/least__common__multiple_8cpp_a8ba1fc66e4134ab25b2602b323150563_cgraph_org.svg b/d4/d21/least__common__multiple_8cpp_a8ba1fc66e4134ab25b2602b323150563_cgraph_org.svg
deleted file mode 100644
index 366acef96..000000000
--- a/d4/d21/least__common__multiple_8cpp_a8ba1fc66e4134ab25b2602b323150563_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: gcd Pages: 1 -->
-<svg width="40pt" height="45pt"
- viewBox="0.00 0.00 39.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>gcd</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="31.75,-19.25 0,-19.25 0,0 31.75,0 31.75,-19.25"/>
-<text text-anchor="middle" x="15.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M10.9,-19.54C8.64,-28.15 10.29,-37.25 15.88,-37.25 18.84,-37.25 20.7,-34.68 21.45,-30.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="24.95,-30.85 20.93,-21.05 17.96,-31.22 24.95,-30.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.map b/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.map
deleted file mode 100644
index 87abf26b3..000000000
--- a/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="lcm" name="lcm">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,48,55"/>
-<area shape="rect" id="Node000002" href="$d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563" title=" " alt="" coords="96,29,138,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,40,80,40,80,45,48,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="100,30,97,21,99,12,106,5,117,3,129,6,135,12,131,16,126,10,117,8,108,10,104,14,103,20,105,28"/>
-</map>
diff --git a/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.md5 b/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.md5
deleted file mode 100644
index 7baa9c974..000000000
--- a/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9cd40eed5945739cc48065dfad9802ad
\ No newline at end of file
diff --git a/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.svg b/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.svg
deleted file mode 100644
index b2113b59b..000000000
--- a/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.svg
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: lcm Pages: 1 -->
-<svg width="108pt" height="45pt"
- viewBox="0.00 0.00 107.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>lcm</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="31.75,-19.25 0,-19.25 0,0 31.75,0 31.75,-19.25"/>
-<text text-anchor="middle" x="15.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">lcm</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="99.5,-19.25 67.75,-19.25 67.75,0 99.5,0 99.5,-19.25"/>
-<text text-anchor="middle" x="83.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.12,-9.62C39.26,-9.62 47.97,-9.62 56.14,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="55.94,-13.13 65.94,-9.63 55.94,-6.13 55.94,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.02,-19.54C68.18,-28.15 71.72,-37.25 83.62,-37.25 90.14,-37.25 94.15,-34.53 95.65,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.16,-30.52 94.42,-21.04 92.22,-31.4 99.16,-30.52"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph_org.svg b/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph_org.svg
deleted file mode 100644
index 221a42af6..000000000
--- a/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph_org.svg
+++ /dev/null
@@ -1,48 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: lcm Pages: 1 -->
-<svg width="108pt" height="45pt"
- viewBox="0.00 0.00 107.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>lcm</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="31.75,-19.25 0,-19.25 0,0 31.75,0 31.75,-19.25"/>
-<text text-anchor="middle" x="15.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">lcm</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="99.5,-19.25 67.75,-19.25 67.75,0 99.5,0 99.5,-19.25"/>
-<text text-anchor="middle" x="83.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.12,-9.62C39.26,-9.62 47.97,-9.62 56.14,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="55.94,-13.13 65.94,-9.63 55.94,-6.13 55.94,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.02,-19.54C68.18,-28.15 71.72,-37.25 83.62,-37.25 90.14,-37.25 94.15,-34.53 95.65,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.16,-30.52 94.42,-21.04 92.22,-31.4 99.16,-30.52"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index de2f5bf72..000000000
--- a/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" title=" " alt="" coords="103,31,153,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,41,88,41,88,46,55,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="201,5,272,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,35,185,27,186,33,154,40"/>
-<area shape="rect" id="Node000004" href="$d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25" title=" " alt="" coords="216,55,258,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="154,46,201,57,199,62,153,52"/>
-<area shape="rect" id="Node000005" href="$d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563" title=" " alt="" coords="320,55,363,80"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="258,65,305,65,305,70,258,70"/>
-<area shape="poly" id="edge5_Node000005_Node000005" title=" " alt="" coords="323,55,319,46,321,37,329,30,342,28,355,31,362,38,358,41,352,35,341,33,331,35,326,40,325,46,328,53"/>
-</map>
diff --git a/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 51c5ce2aa..000000000
--- a/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-236b51a8f72dc8c14342f71604e4f010
\ No newline at end of file
diff --git a/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index e5346b691..000000000
--- a/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,128 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="276pt" height="64pt"
- viewBox="0.00 0.00 276.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-37.25 73,-37.25 73,-18 110.75,-18 110.75,-37.25"/>
-<text text-anchor="middle" x="91.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-27.62C44.55,-27.62 53.37,-27.62 61.69,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-31.13 71.43,-27.63 61.43,-24.13 61.43,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.25,-56.25 146.75,-56.25 146.75,-37 200.25,-37 200.25,-56.25"/>
-<text text-anchor="middle" x="173.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.94,-31.94C118.22,-33.67 126.89,-35.74 135.39,-37.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.34,-41.12 144.88,-40.03 135.96,-34.31 134.34,-41.12"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.38,-19.25 157.62,-19.25 157.62,0 189.38,0 189.38,-19.25"/>
-<text text-anchor="middle" x="173.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">lcm</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.94,-23.54C121.3,-21.2 134.48,-18.22 145.99,-15.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.72,-19.04 155.71,-13.42 145.18,-12.21 146.72,-19.04"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="268,-19.25 236.25,-19.25 236.25,0 268,0 268,-19.25"/>
-<text text-anchor="middle" x="252.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.64,-9.62C199.54,-9.62 212.76,-9.62 224.4,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.24,-13.13 234.24,-9.63 224.24,-6.13 224.24,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M239.82,-19.54C234.2,-28.15 238.3,-37.25 252.12,-37.25 259.68,-37.25 264.34,-34.53 266.08,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.58,-30.41 264.66,-21.04 262.66,-31.44 269.58,-30.41"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index fd2f2ad22..000000000
--- a/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="276pt" height="64pt"
- viewBox="0.00 0.00 276.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-37.25 73,-37.25 73,-18 110.75,-18 110.75,-37.25"/>
-<text text-anchor="middle" x="91.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-27.62C44.55,-27.62 53.37,-27.62 61.69,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-31.13 71.43,-27.63 61.43,-24.13 61.43,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.25,-56.25 146.75,-56.25 146.75,-37 200.25,-37 200.25,-56.25"/>
-<text text-anchor="middle" x="173.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.94,-31.94C118.22,-33.67 126.89,-35.74 135.39,-37.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.34,-41.12 144.88,-40.03 135.96,-34.31 134.34,-41.12"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.38,-19.25 157.62,-19.25 157.62,0 189.38,0 189.38,-19.25"/>
-<text text-anchor="middle" x="173.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">lcm</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.94,-23.54C121.3,-21.2 134.48,-18.22 145.99,-15.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.72,-19.04 155.71,-13.42 145.18,-12.21 146.72,-19.04"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="268,-19.25 236.25,-19.25 236.25,0 268,0 268,-19.25"/>
-<text text-anchor="middle" x="252.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.64,-9.62C199.54,-9.62 212.76,-9.62 224.4,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.24,-13.13 234.24,-9.63 224.24,-6.13 224.24,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M239.82,-19.54C234.2,-28.15 238.3,-37.25 252.12,-37.25 259.68,-37.25 264.34,-34.53 266.08,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.58,-30.41 264.66,-21.04 262.66,-31.44 269.58,-30.41"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d21/least__common__multiple_8cpp_source.html b/d4/d21/least__common__multiple_8cpp_source.html
new file mode 100644
index 000000000..6827ce03b
--- /dev/null
+++ b/d4/d21/least__common__multiple_8cpp_source.html
@@ -0,0 +1,208 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/least_common_multiple.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d21/least__common__multiple_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">least_common_multiple.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/d21/least__common__multiple_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="foldopen" id="foldopen00016" data-start="{" data-end="}">
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"><a class="line" href="../../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563">   16</a></span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563">gcd</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y) {</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="keywordflow">if</span> (x == 0) {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        <span class="keywordflow">return</span> y;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    }</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="keywordflow">if</span> (y == 0) {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        <span class="keywordflow">return</span> x;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    }</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    <span class="keywordflow">if</span> (x == y) {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        <span class="keywordflow">return</span> x;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    }</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="keywordflow">if</span> (x &gt; y) {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        <span class="comment">// The following is valid because we have checked whether y == 0</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>        <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> temp = x / y;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563">gcd</a>(y, x - temp * y);</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    }</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="comment">// Again the following is valid because we have checked whether x == 0</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> temp = y / x;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563">gcd</a>(x, y - temp * x);</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>}</div>
+</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="foldopen" id="foldopen00043" data-start="{" data-end="}">
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="../../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25">   43</a></span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25">lcm</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> x, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> y) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>  <span class="keywordflow">return</span> x / <a class="code hl_function" href="../../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563">gcd</a>(x, y) * y;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>}</div>
+</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="foldopen" id="foldopen00050" data-start="{" data-end="}">
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"><a class="line" href="../../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">   50</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>() {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="comment">// First test on lcm(5,10) == 10</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;LCM of 5 and 10 is 10 but lcm function gives a different &quot;</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>                  <span class="stringliteral">&quot;result.\n&quot;</span>,</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            <a class="code hl_function" href="../../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25">lcm</a>(5, 10) == 10));</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;First assertion passes: LCM of 5 and 10 is &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25">lcm</a>(5, 10)</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="comment">// Second test on lcm(2,3) == 6 as 2 and 3 are coprime (prime in fact)</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;LCM of 2 and 3 is 6 but lcm function gives a different &quot;</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>                  <span class="stringliteral">&quot;result.\n&quot;</span>,</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            <a class="code hl_function" href="../../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25">lcm</a>(2, 3) == 6));</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Second assertion passes: LCM of 2 and 3 is &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25">lcm</a>(2, 3)</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="comment">// Testing an integer overflow.</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="comment">// The algorithm should work as long as the result fits into integer.</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;LCM of 987654321 and 987654321 is 987654321 but lcm function&quot;</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                  <span class="stringliteral">&quot; gives a different result.\n&quot;</span>,</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            <a class="code hl_function" href="../../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25">lcm</a>(987654321, 987654321) == 987654321));</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Third assertion passes: LCM of 987654321 and 987654321 is &quot;</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>              &lt;&lt; <a class="code hl_function" href="../../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25">lcm</a>(987654321, 987654321)</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>}</div>
+</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="foldopen" id="foldopen00078" data-start="{" data-end="}">
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"><a class="line" href="../../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   78</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <a class="code hl_function" href="../../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>}</div>
+</div>
+<div class="ttc" id="aleast__common__multiple_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="#l00050">least_common_multiple.cpp:50</a></div></div>
+<div class="ttc" id="aleast__common__multiple_8cpp_html_a8ba1fc66e4134ab25b2602b323150563"><div class="ttname"><a href="../../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563">gcd</a></div><div class="ttdeci">unsigned int gcd(unsigned int x, unsigned int y)</div><div class="ttdef"><b>Definition</b> <a href="#l00016">least_common_multiple.cpp:16</a></div></div>
+<div class="ttc" id="aleast__common__multiple_8cpp_html_aa8d0e241db517813725e721a152e3a25"><div class="ttname"><a href="../../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25">lcm</a></div><div class="ttdeci">unsigned int lcm(unsigned int x, unsigned int y)</div><div class="ttdef"><b>Definition</b> <a href="#l00043">least_common_multiple.cpp:43</a></div></div>
+<div class="ttc" id="aleast__common__multiple_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00078">least_common_multiple.cpp:78</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d4/d21/least__common__multiple_8cpp.html">least_common_multiple.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.map b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.map
index 79836d34d..87344cb65 100644
--- a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.map
+++ b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.map
@@ -1,6 +1,6 @@
 <map id="Trie::TrieNode" name="Trie::TrieNode">
 <area shape="rect" id="Node000001" title=" " alt="" coords="24,5,129,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="5,94,148,135"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,148,135"/>
 <area shape="poly" id="edge2_Node000002_Node000001" title=" " alt="" coords="59,45,55,56,55,74,63,92,58,95,50,76,50,54,55,43"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="74,79,74,31,79,31,79,79"/>
 </map>
diff --git a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.md5 b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.md5
index 9af399e85..6fb4ea892 100644
--- a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.md5
+++ b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.md5
@@ -1 +1 @@
-b024444181e368dca67ffd3a90c8cbc1
\ No newline at end of file
+b47582a3dadb2ffe3e6696f719b89b0b
\ No newline at end of file
diff --git a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.svg b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.svg
index 8d2ce3d26..14f597fa8 100644
--- a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.svg
+++ b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="106.75,-30.5 0,-30.5 0,0 106.75,0 106.75,-30.5"/>
 <text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Trie</text>
 <text text-anchor="middle" x="53.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::TrieNode &gt;</text>
diff --git a/d4/d2c/struct_trie_1_1_trie_node__coll__graph_org.svg b/d4/d2c/struct_trie_1_1_trie_node__coll__graph_org.svg
index 2d67521b4..fb0d48c90 100644
--- a/d4/d2c/struct_trie_1_1_trie_node__coll__graph_org.svg
+++ b/d4/d2c/struct_trie_1_1_trie_node__coll__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="106.75,-30.5 0,-30.5 0,0 106.75,0 106.75,-30.5"/>
 <text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Trie</text>
 <text text-anchor="middle" x="53.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::TrieNode &gt;</text>
diff --git a/d4/d32/fibonacci__fast_8cpp.html b/d4/d32/fibonacci__fast_8cpp.html
index 6b855e036..aa0a9dd5f 100644
--- a/d4/d32/fibonacci__fast_8cpp.html
+++ b/d4/d32/fibonacci__fast_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/fibonacci_fast.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/fibonacci_fast.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for fibonacci_fast.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d51/fibonacci__fast_8cpp__incl.svg" width="262" height="111"><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">
+</div>
+<p><a href="../../d4/d32/fibonacci__fast_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="define-members" name="define-members"></a>
 Macros</h2></td></tr>
 <tr class="memitem:a392fb874e547e582e9c66a08a1f23326" id="r_a392fb874e547e582e9c66a08a1f23326"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a392fb874e547e582e9c66a08a1f23326">MAX</a>&#160;&#160;&#160;93</td></tr>
@@ -139,6 +158,8 @@ Functions</h2></td></tr>
 <p>An efficient way to calculate nth fibonacci number faster and simpler than \(O(n\log n)\) method of matrix exponentiation This works by using both recursion and dynamic programming. as 93rd fibonacci exceeds 19 digits, which cannot be stored in a single long long variable, we can only use it till 92nd fibonacci we can use it for 10000th fibonacci etc, if we implement bigintegers. This algorithm works with the fact that nth fibonacci can easily found if we have already found n/2th or (n+1)/2th fibonacci It is a property of fibonacci similar to matrix exponentiation.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../de/de4/fibonacci__large_8cpp.html" title="Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library ...">fibonacci_large.cpp</a>, <a class="el" href="../../d9/d89/fibonacci_8cpp.html" title="n-th Fibonacci number.">fibonacci.cpp</a>, <a class="el" href="../../de/d47/string__fibonacci_8cpp.html" title="This Programme returns the Nth fibonacci as a string.">string_fibonacci.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d32/fibonacci__fast_8cpp_source.html">fibonacci_fast.cpp</a>.</p>
 </div><h2 class="groupheader">Macro Definition Documentation</h2>
 <a id="a392fb874e547e582e9c66a08a1f23326" name="a392fb874e547e582e9c66a08a1f23326"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a392fb874e547e582e9c66a08a1f23326">&#9670;&#160;</a></span>MAX</h2>
@@ -153,6 +174,8 @@ Functions</h2></td></tr>
 </div><div class="memdoc">
 <p>maximum number that can be computed - The result after 93 cannot be stored in a <code>uint64_t</code> data type. </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/fibonacci__fast_8cpp_source.html#l00027">27</a> of file <a class="el" href="../../d4/d32/fibonacci__fast_8cpp_source.html">fibonacci_fast.cpp</a>.</p>
+
 </div>
 </div>
 <h2 class="groupheader">Function Documentation</h2>
@@ -171,6 +194,8 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Algorithm </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/fibonacci__fast_8cpp_source.html#l00030">30</a> of file <a class="el" href="../../d4/d32/fibonacci__fast_8cpp_source.html">fibonacci_fast.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   30</span>                         {</div>
 <div class="line"><span class="lineno">   31</span>    <span class="keyword">static</span> uint64_t f1 = 1,</div>
 <div class="line"><span class="lineno">   32</span>                    f2 = 1;  <span class="comment">// using static keyword will retain the values of</span></div>
@@ -179,7 +204,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   35</span>    <span class="keywordflow">if</span> (n &lt;= 2)</div>
 <div class="line"><span class="lineno">   36</span>        <span class="keywordflow">return</span> f2;</div>
 <div class="line"><span class="lineno">   37</span>    <span class="keywordflow">if</span> (n &gt;= 93) {</div>
-<div class="line"><span class="lineno">   38</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div>
+<div class="line"><span class="lineno">   38</span>        std::cerr</div>
 <div class="line"><span class="lineno">   39</span>            &lt;&lt; <span class="stringliteral">&quot;Cannot compute for n&gt;93 due to limit of 64-bit integers\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   40</span>        <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   41</span>    }</div>
@@ -190,7 +215,6 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   46</span> </div>
 <div class="line"><span class="lineno">   47</span>    <span class="keywordflow">return</span> f2;</div>
 <div class="line"><span class="lineno">   48</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::cerr</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -209,21 +233,17 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/fibonacci__fast_8cpp_source.html#l00051">51</a> of file <a class="el" href="../../d4/d32/fibonacci__fast_8cpp_source.html">fibonacci_fast.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   51</span>           {</div>
 <div class="line"><span class="lineno">   52</span>    <span class="comment">// Main Function</span></div>
 <div class="line"><span class="lineno">   53</span>    <span class="keywordflow">for</span> (uint64_t i = 1; i &lt; 93; i++) {</div>
-<div class="line"><span class="lineno">   54</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; th fibonacci number is &quot;</span> &lt;&lt; <a class="code hl_function" href="#a5712edca101204eca8accdb1e096707f">fib</a>(i) &lt;&lt; <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">   54</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; th fibonacci number is &quot;</span> &lt;&lt; <a class="code hl_function" href="#a5712edca101204eca8accdb1e096707f">fib</a>(i) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   55</span>    }</div>
 <div class="line"><span class="lineno">   56</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   57</span>}</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="afibonacci__fast_8cpp_html_a5712edca101204eca8accdb1e096707f"><div class="ttname"><a href="#a5712edca101204eca8accdb1e096707f">fib</a></div><div class="ttdeci">uint64_t fib(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_fast.cpp:30</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="180" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afibonacci__fast_8cpp_html_a5712edca101204eca8accdb1e096707f"><div class="ttname"><a href="#a5712edca101204eca8accdb1e096707f">fib</a></div><div class="ttdeci">uint64_t fib(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/fibonacci__fast_8cpp_source.html#l00030">fibonacci_fast.cpp:30</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 5ba9a8261..000000000
--- a/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,35,87,27,88,33,56,40"/>
-<area shape="rect" id="Node000003" href="$d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f" title=" " alt="" coords="119,55,158,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,46,105,57,104,63,55,52"/>
-</map>
diff --git a/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index d95771a0b..000000000
--- a/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-451467410aae40ea8c24c4a09ee4e797
\ No newline at end of file
diff --git a/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 3dfce850c..000000000
--- a/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="64pt"
- viewBox="0.00 0.00 134.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-56.25 73,-56.25 73,-37 126.5,-37 126.5,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.64,-33.65 53.16,-35.69 61.53,-37.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.71,-41.1 71.25,-40.03 62.34,-34.3 60.71,-41.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="114.15,-19.25 85.35,-19.25 85.35,0 114.15,0 114.15,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fib</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C48.31,-21.08 62.24,-17.92 74.08,-15.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.58,-18.7 83.56,-13.08 73.03,-11.88 74.58,-18.7"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index f80e45f8f..000000000
--- a/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="64pt"
- viewBox="0.00 0.00 134.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-56.25 73,-56.25 73,-37 126.5,-37 126.5,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.64,-33.65 53.16,-35.69 61.53,-37.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.71,-41.1 71.25,-40.03 62.34,-34.3 60.71,-41.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="114.15,-19.25 85.35,-19.25 85.35,0 114.15,0 114.15,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fib</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C48.31,-21.08 62.24,-17.92 74.08,-15.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.58,-18.7 83.56,-13.08 73.03,-11.88 74.58,-18.7"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d32/fibonacci__fast_8cpp_source.html b/d4/d32/fibonacci__fast_8cpp_source.html
new file mode 100644
index 000000000..bd5e1983d
--- /dev/null
+++ b/d4/d32/fibonacci__fast_8cpp_source.html
@@ -0,0 +1,177 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/fibonacci_fast.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d32/fibonacci__fast_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">fibonacci_fast.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/d32/fibonacci__fast_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;cinttypes&gt;</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;cstdio&gt;</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326">   27</a></span><span class="preprocessor">#define MAX 93</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="foldopen" id="foldopen00030" data-start="{" data-end="}">
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"><a class="line" href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f">   30</a></span>uint64_t <a class="code hl_function" href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f">fib</a>(uint64_t n) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keyword">static</span> uint64_t f1 = 1,</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>                    f2 = 1;  <span class="comment">// using static keyword will retain the values of</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>                             <span class="comment">// f1 and f2 for the next function call.</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordflow">if</span> (n &lt;= 2)</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        <span class="keywordflow">return</span> f2;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">if</span> (n &gt;= 93) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        std::cerr</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            &lt;&lt; <span class="stringliteral">&quot;Cannot compute for n&gt;93 due to limit of 64-bit integers\n&quot;</span>;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    }</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    uint64_t temp = f2;  <span class="comment">// we do not need temp to be static</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    f2 += f1;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    f1 = temp;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">return</span> f2;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>}</div>
+</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="foldopen" id="foldopen00051" data-start="{" data-end="}">
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="../../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   51</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="comment">// Main Function</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">for</span> (uint64_t i = 1; i &lt; 93; i++) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; th fibonacci number is &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f">fib</a>(i) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>}</div>
+</div>
+<div class="ttc" id="afibonacci__fast_8cpp_html_a5712edca101204eca8accdb1e096707f"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f">fib</a></div><div class="ttdeci">uint64_t fib(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="#l00030">fibonacci_fast.cpp:30</a></div></div>
+<div class="ttc" id="afibonacci__fast_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00051">fibonacci_fast.cpp:51</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d4/d32/fibonacci__fast_8cpp.html">fibonacci_fast.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp.html b/d4/d32/inorder__successor__of__bst_8cpp.html
index 9a557dc95..fc27f0b79 100644
--- a/d4/d32/inorder__successor__of__bst_8cpp.html
+++ b/d4/d32/inorder__successor__of__bst_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: operations_on_datastructures/inorder_successor_of_bst.cpp File Reference</title>
+<title>TheAlgorithms/C++: operations_on_datastructures/inorder_successor_of_bst.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for inorder_successor_of_bst.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d66/inorder__successor__of__bst_8cpp__incl.svg" width="252" height="126"><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">
+</div>
+<p><a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></td></tr>
@@ -135,7 +154,7 @@ Classes</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></td></tr>
-<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
+<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::vector <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d74/namespaceinorder__successor__of__bst.html">inorder_successor_of_bst</a></td></tr>
 <tr class="memdesc:dd/d74/namespaceinorder__successor__of__bst"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the <a href="https://www.youtube.com/watch?v=5cPbNCrdotA" target="_blank">Inorder successor of a binary search tree</a> implementation. <br /></td></tr>
@@ -158,7 +177,7 @@ Functions</h2></td></tr>
 <tr class="memitem:a5d7266b934ca50c4f53e4f1e725d89a4" id="r_a5d7266b934ca50c4f53e4f1e725d89a4"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a> (<a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *root)</td></tr>
 <tr class="memdesc:a5d7266b934ca50c4f53e4f1e725d89a4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints the BST in inorder traversal using recursion.  <br /></td></tr>
 <tr class="separator:a5d7266b934ca50c4f53e4f1e725d89a4"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a05fe8a029e155c43e4efa598d4d089d9" id="r_a05fe8a029e155c43e4efa598d4d089d9"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a05fe8a029e155c43e4efa598d4d089d9">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a> (<a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *root, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
+<tr class="memitem:a05fe8a029e155c43e4efa598d4d089d9" id="r_a05fe8a029e155c43e4efa598d4d089d9"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a05fe8a029e155c43e4efa598d4d089d9">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a> (<a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *root, const std::vector&lt; int64_t &gt; &amp;<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
 <tr class="memdesc:a05fe8a029e155c43e4efa598d4d089d9"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function is used in test cases to quickly create BST containing large data instead of hard coding it in code. For a given root, this will add all the nodes containing data passes in data vector.  <br /></td></tr>
 <tr class="separator:a05fe8a029e155c43e4efa598d4d089d9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a3923fb22b46e085376703cae0b44d690" id="r_a3923fb22b46e085376703cae0b44d690"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3923fb22b46e085376703cae0b44d690">operations_on_datastructures::inorder_traversal_of_bst::getInorderSuccessor</a> (<a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *root, int64_t <a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
@@ -197,6 +216,8 @@ Method 2: Search from the root node</h4>
 <li>In order successor would be the deepest node in this path for which given node is in left subtree.</li>
 </ul>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/foo290" target="_blank">Nitin Sharma</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a7b20eb99272665c1777949e26ab59589" name="a7b20eb99272665c1777949e26ab59589"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a7b20eb99272665c1777949e26ab59589">&#9670;&#160;</a></span>deallocate()</h2>
@@ -221,6 +242,8 @@ Method 2: Search from the root node</h4>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00210">210</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  210</span>                                {</div>
 <div class="line"><span class="lineno">  211</span>    <span class="keywordflow">if</span> (rootNode == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">  212</span>        <span class="keywordflow">return</span>;</div>
@@ -229,13 +252,8 @@ Method 2: Search from the root node</h4>
 <div class="line"><span class="lineno">  215</span>    <a class="code hl_function" href="#a7b20eb99272665c1777949e26ab59589">deallocate</a>(rootNode-&gt;right);</div>
 <div class="line"><span class="lineno">  216</span>    <span class="keyword">delete</span> (rootNode);</div>
 <div class="line"><span class="lineno">  217</span>}</div>
-<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a7b20eb99272665c1777949e26ab59589"><div class="ttname"><a href="#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a></div><div class="ttdeci">void deallocate(Node *rootNode)</div><div class="ttdoc">This function clears the memory allocated to entire tree recursively. Its just for clean up the memor...</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:210</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.svg" width="203" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a7b20eb99272665c1777949e26ab59589"><div class="ttname"><a href="#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a></div><div class="ttdeci">void deallocate(Node *rootNode)</div><div class="ttdoc">This function clears the memory allocated to entire tree recursively. Its just for clean up the memor...</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00210">inorder_successor_of_bst.cpp:210</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a72483e3f6933e004a8d86371e8a990db" name="a72483e3f6933e004a8d86371e8a990db"></a>
@@ -261,6 +279,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Node* Pointer to the found node </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00121">121</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  121</span>                              {</div>
 <div class="line"><span class="lineno">  122</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">  123</span>        <span class="keywordflow">return</span> root;</div>
@@ -270,12 +290,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  127</span>    }</div>
 <div class="line"><span class="lineno">  128</span>    <span class="keywordflow">return</span> root;</div>
 <div class="line"><span class="lineno">  129</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d32/inorder__successor__of__bst_8cpp_a72483e3f6933e004a8d86371e8a990db_cgraph.svg" width="203" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a3923fb22b46e085376703cae0b44d690" name="a3923fb22b46e085376703cae0b44d690"></a>
@@ -306,6 +321,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd><a class="el" href="../../db/d8b/struct_node.html">Node</a> pointer to the inorder successor node. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00176">176</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  176</span>                                                    {</div>
 <div class="line"><span class="lineno">  177</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *current = <a class="code hl_function" href="#a824cbf1814854824cf05f062eea07b95">getNode</a>(root, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
 <div class="line"><span class="lineno">  178</span>    <span class="keywordflow">if</span> (current == <span class="keyword">nullptr</span>) {</div>
@@ -333,16 +350,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  200</span>        <span class="keywordflow">return</span> successor;  <span class="comment">// Nodes with maximum vales will not have a successor</span></div>
 <div class="line"><span class="lineno">  201</span>    }</div>
 <div class="line"><span class="lineno">  202</span>}</div>
-<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
-<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a72483e3f6933e004a8d86371e8a990db"><div class="ttname"><a href="#a72483e3f6933e004a8d86371e8a990db">operations_on_datastructures::inorder_traversal_of_bst::findMinNode</a></div><div class="ttdeci">Node * findMinNode(Node *root)</div><div class="ttdoc">Finds and return the minimum node in BST.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:121</div></div>
-<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a824cbf1814854824cf05f062eea07b95"><div class="ttname"><a href="#a824cbf1814854824cf05f062eea07b95">operations_on_datastructures::inorder_traversal_of_bst::getNode</a></div><div class="ttdeci">Node * getNode(Node *root, int64_t data)</div><div class="ttdoc">Searches the given data in BST and returns the pointer to the node containing that data.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:100</div></div>
-<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d32/inorder__successor__of__bst_8cpp_a3923fb22b46e085376703cae0b44d690_cgraph.svg" width="444" height="195"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a72483e3f6933e004a8d86371e8a990db"><div class="ttname"><a href="#a72483e3f6933e004a8d86371e8a990db">operations_on_datastructures::inorder_traversal_of_bst::findMinNode</a></div><div class="ttdeci">Node * findMinNode(Node *root)</div><div class="ttdoc">Finds and return the minimum node in BST.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00121">inorder_successor_of_bst.cpp:121</a></div></div>
+<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a824cbf1814854824cf05f062eea07b95"><div class="ttname"><a href="#a824cbf1814854824cf05f062eea07b95">operations_on_datastructures::inorder_traversal_of_bst::getNode</a></div><div class="ttdeci">Node * getNode(Node *root, int64_t data)</div><div class="ttdoc">Searches the given data in BST and returns the pointer to the node containing that data.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00100">inorder_successor_of_bst.cpp:100</a></div></div>
+<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a824cbf1814854824cf05f062eea07b95" name="a824cbf1814854824cf05f062eea07b95"></a>
@@ -376,27 +388,20 @@ Here is the call graph for this function:</div>
 <p><a class="el" href="../../db/d8b/struct_node.html">Node</a> found!</p>
 <p>Traverse right subtree recursively as the given data is greater than the data in root node, data must be present in right subtree.</p>
 <p>Traverse left subtree recursively as the given data is less than the data in root node, data must be present in left subtree.</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00100">100</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  100</span>                                        {</div>
 <div class="line"><span class="lineno">  101</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">  102</span>        <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  103</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (root-&gt;data == <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
-<div class="line"><span class="lineno">  104</span>        <span class="keywordflow">return</span> root;  <span class="comment">/// Node found!</span></div>
-<div class="line"><span class="lineno">  105</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> &gt; root-&gt;data) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  106</span><span class="comment">        /// Traverse right subtree recursively as the given data is greater than</span></div>
-<div class="line"><span class="lineno">  107</span><span class="comment">        /// the data in root node, data must be present in right subtree.</span></div>
-<div class="line"><span class="lineno">  108</span><span class="comment"></span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a824cbf1814854824cf05f062eea07b95">getNode</a>(root-&gt;right, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
-<div class="line"><span class="lineno">  109</span>    } <span class="keywordflow">else</span> {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  110</span><span class="comment">        /// Traverse left subtree recursively as the given data is less than the</span></div>
-<div class="line"><span class="lineno">  111</span><span class="comment">        /// data in root node, data must be present in left subtree.</span></div>
-<div class="line"><span class="lineno">  112</span><span class="comment"></span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a824cbf1814854824cf05f062eea07b95">getNode</a>(root-&gt;left, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
+<div class="line"><span class="lineno">  104</span>        <span class="keywordflow">return</span> root;  </div>
+<div class="line"><span class="lineno">  105</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> &gt; root-&gt;data) {</div>
+<div class="line"><span class="lineno">  108</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a824cbf1814854824cf05f062eea07b95">getNode</a>(root-&gt;right, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
+<div class="line"><span class="lineno">  109</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><span class="lineno">  112</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a824cbf1814854824cf05f062eea07b95">getNode</a>(root-&gt;left, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
 <div class="line"><span class="lineno">  113</span>    }</div>
 <div class="line"><span class="lineno">  114</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d32/inorder__successor__of__bst_8cpp_a824cbf1814854824cf05f062eea07b95_cgraph.svg" width="203" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a3ae0bea4123fd2ce155108e88f2ef78c" name="a3ae0bea4123fd2ce155108e88f2ef78c"></a>
@@ -427,6 +432,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Node* Pointer to the root node. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00082">82</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   82</span>                                       {</div>
 <div class="line"><span class="lineno">   83</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">   84</span>        root = <a class="code hl_function" href="#a7f6f73a33beec448c27cc1d70b220702">makeNode</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
@@ -437,13 +444,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   89</span>    }</div>
 <div class="line"><span class="lineno">   90</span>    <span class="keywordflow">return</span> root;</div>
 <div class="line"><span class="lineno">   91</span>}</div>
-<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a7f6f73a33beec448c27cc1d70b220702"><div class="ttname"><a href="#a7f6f73a33beec448c27cc1d70b220702">operations_on_datastructures::inorder_traversal_of_bst::makeNode</a></div><div class="ttdeci">Node * makeNode(int64_t data)</div><div class="ttdoc">Allocates a new node in heap for given data and returns it's pointer.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:68</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d32/inorder__successor__of__bst_8cpp_a3ae0bea4123fd2ce155108e88f2ef78c_cgraph.svg" width="444" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a7f6f73a33beec448c27cc1d70b220702"><div class="ttname"><a href="#a7f6f73a33beec448c27cc1d70b220702">operations_on_datastructures::inorder_traversal_of_bst::makeNode</a></div><div class="ttdeci">Node * makeNode(int64_t data)</div><div class="ttdoc">Allocates a new node in heap for given data and returns it's pointer.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00068">inorder_successor_of_bst.cpp:68</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
@@ -479,52 +481,46 @@ Here is the call graph for this function:</div>
 <p>&lt; An element to find inorder successor for.</p>
 <p>&lt; Making BST</p>
 <p>memory cleanup!</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00398">398</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  398</span>                                 {</div>
 <div class="line"><span class="lineno">  399</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  400</span> </div>
 <div class="line"><span class="lineno">  401</span>    <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a> *root =</div>
-<div class="line"><span class="lineno">  402</span>        <span class="keyword">nullptr</span>;  <span class="comment">///&lt; root node of the bst</span></div>
-<div class="line"><span class="lineno">  403</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> node_data{3,  4, 5,</div>
-<div class="line"><span class="lineno">  404</span>                                   89, 1, 2};  <span class="comment">///&lt; Data to add nodes in BST</span></div>
+<div class="line"><span class="lineno">  402</span>        <span class="keyword">nullptr</span>;  </div>
+<div class="line"><span class="lineno">  403</span>    std::vector&lt;int64_t&gt; node_data{3,  4, 5,</div>
+<div class="line"><span class="lineno">  404</span>                                   89, 1, 2};  </div>
 <div class="line"><span class="lineno">  405</span> </div>
-<div class="line"><span class="lineno">  406</span>    int64_t targetElement = 4;  <span class="comment">///&lt; An element to find inorder successor for.</span></div>
+<div class="line"><span class="lineno">  406</span>    int64_t targetElement = 4;  </div>
 <div class="line"><span class="lineno">  407</span>    root = <a class="code hl_function" href="#a05fe8a029e155c43e4efa598d4d089d9">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a>(</div>
-<div class="line"><span class="lineno">  408</span>        root, node_data);  <span class="comment">///&lt; Making BST</span></div>
+<div class="line"><span class="lineno">  408</span>        root, node_data);  </div>
 <div class="line"><span class="lineno">  409</span> </div>
 <div class="line"><span class="lineno">  410</span>    <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
 <div class="line"><span class="lineno">  411</span>        *inorderSuccessor = operations_on_datastructures::</div>
 <div class="line"><span class="lineno">  412</span>            inorder_traversal_of_bst::getInorderSuccessor(root, targetElement);</div>
 <div class="line"><span class="lineno">  413</span> </div>
-<div class="line"><span class="lineno">  414</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;In-order sequence is : &quot;</span>;</div>
+<div class="line"><span class="lineno">  414</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;In-order sequence is : &quot;</span>;</div>
 <div class="line"><span class="lineno">  415</span>    <a class="code hl_function" href="#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a>(root);</div>
-<div class="line"><span class="lineno">  416</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  416</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  417</span> </div>
 <div class="line"><span class="lineno">  418</span>    <span class="keywordflow">if</span> (inorderSuccessor == <span class="keyword">nullptr</span>) {</div>
-<div class="line"><span class="lineno">  419</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Inorder successor for last node is NULL&quot;</span> &lt;&lt; <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">  419</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Inorder successor for last node is NULL&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  420</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  421</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Target element is : &quot;</span> &lt;&lt; targetElement &lt;&lt; <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">  422</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Inorder successor for target element is : &quot;</span></div>
-<div class="line"><span class="lineno">  423</span>                  &lt;&lt; inorderSuccessor-&gt;<a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a> &lt;&lt; <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">  421</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Target element is : &quot;</span> &lt;&lt; targetElement &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  422</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Inorder successor for target element is : &quot;</span></div>
+<div class="line"><span class="lineno">  423</span>                  &lt;&lt; inorderSuccessor-&gt;<a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  424</span>    }</div>
 <div class="line"><span class="lineno">  425</span> </div>
-<div class="line"><span class="lineno">  426</span>    <a class="code hl_function" href="#a7b20eb99272665c1777949e26ab59589">deallocate</a>(root);  <span class="comment">/// memory cleanup!</span></div>
+<div class="line"><span class="lineno">  426</span>    <a class="code hl_function" href="#a7b20eb99272665c1777949e26ab59589">deallocate</a>(root);  </div>
 <div class="line"><span class="lineno">  427</span> </div>
 <div class="line"><span class="lineno">  428</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  429</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="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div><div class="ttdoc">A Node structure representing a single node in BST.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:56</div></div>
-<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html_ae161f3e5ef33ade73429cab9291612e2"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">operations_on_datastructures::inorder_traversal_of_bst::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The key/value of the node.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:58</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="ainorder__successor__of__bst_8cpp_html_a05fe8a029e155c43e4efa598d4d089d9"><div class="ttname"><a href="#a05fe8a029e155c43e4efa598d4d089d9">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a></div><div class="ttdeci">Node * makeBST(Node *root, const std::vector&lt; int64_t &gt; &amp;data)</div><div class="ttdoc">This function is used in test cases to quickly create BST containing large data instead of hard codin...</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:155</div></div>
-<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a5d7266b934ca50c4f53e4f1e725d89a4"><div class="ttname"><a href="#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a></div><div class="ttdeci">void printInorder(Node *root)</div><div class="ttdoc">Prints the BST in inorder traversal using recursion.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:136</div></div>
-<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:387</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>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="100%" height="508"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div><div class="ttdoc">A Node structure representing a single node in BST.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00056">inorder_successor_of_bst.cpp:56</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html_ae161f3e5ef33ade73429cab9291612e2"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">operations_on_datastructures::inorder_traversal_of_bst::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The key/value of the node.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00058">inorder_successor_of_bst.cpp:58</a></div></div>
+<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a05fe8a029e155c43e4efa598d4d089d9"><div class="ttname"><a href="#a05fe8a029e155c43e4efa598d4d089d9">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a></div><div class="ttdeci">Node * makeBST(Node *root, const std::vector&lt; int64_t &gt; &amp;data)</div><div class="ttdoc">This function is used in test cases to quickly create BST containing large data instead of hard codin...</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00155">inorder_successor_of_bst.cpp:155</a></div></div>
+<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a5d7266b934ca50c4f53e4f1e725d89a4"><div class="ttname"><a href="#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a></div><div class="ttdeci">void printInorder(Node *root)</div><div class="ttdoc">Prints the BST in inorder traversal using recursion.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00136">inorder_successor_of_bst.cpp:136</a></div></div>
+<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00387">inorder_successor_of_bst.cpp:387</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a05fe8a029e155c43e4efa598d4d089d9" name="a05fe8a029e155c43e4efa598d4d089d9"></a>
@@ -541,7 +537,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>data</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; int64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>data</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -555,18 +551,15 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd><a class="el" href="../../db/d8b/struct_node.html">Node</a> pointer to the root node. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00155">155</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  155</span>                                                          {</div>
 <div class="line"><span class="lineno">  156</span>    <span class="keywordflow">for</span> (int64_t values : <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
 <div class="line"><span class="lineno">  157</span>        root = Insert(root, values);</div>
 <div class="line"><span class="lineno">  158</span>    }</div>
 <div class="line"><span class="lineno">  159</span>    <span class="keywordflow">return</span> root;</div>
 <div class="line"><span class="lineno">  160</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d32/inorder__successor__of__bst_8cpp_a05fe8a029e155c43e4efa598d4d089d9_cgraph.svg" width="203" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7f6f73a33beec448c27cc1d70b220702" name="a7f6f73a33beec448c27cc1d70b220702"></a>
@@ -595,21 +588,18 @@ Here is the call graph for this function:</div>
 <p>&lt; setting data for node</p>
 <p>&lt; setting left child as null</p>
 <p>&lt; setting right child as null</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00068">68</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   68</span>                             {</div>
 <div class="line"><span class="lineno">   69</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>();</div>
-<div class="line"><span class="lineno">   70</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;data = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;      <span class="comment">///&lt; setting data for node</span></div>
-<div class="line"><span class="lineno">   71</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left = <span class="keyword">nullptr</span>;   <span class="comment">///&lt; setting left child as null</span></div>
-<div class="line"><span class="lineno">   72</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right = <span class="keyword">nullptr</span>;  <span class="comment">///&lt; setting right child as null</span></div>
+<div class="line"><span class="lineno">   70</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;data = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;      </div>
+<div class="line"><span class="lineno">   71</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left = <span class="keyword">nullptr</span>;   </div>
+<div class="line"><span class="lineno">   72</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right = <span class="keyword">nullptr</span>;  </div>
 <div class="line"><span class="lineno">   73</span>    <span class="keywordflow">return</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
 <div class="line"><span class="lineno">   74</span>}</div>
-<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d32/inorder__successor__of__bst_8cpp_a7f6f73a33beec448c27cc1d70b220702_cgraph.svg" width="203" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5d7266b934ca50c4f53e4f1e725d89a4" name="a5d7266b934ca50c4f53e4f1e725d89a4"></a>
@@ -637,21 +627,18 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
 <p>recursive call to left subtree</p>
 <p>recursive call to right subtree</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00136">136</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  136</span>                              {</div>
 <div class="line"><span class="lineno">  137</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">  138</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  139</span>    }</div>
 <div class="line"><span class="lineno">  140</span> </div>
-<div class="line"><span class="lineno">  141</span>    <a class="code hl_function" href="#a5d7266b934ca50c4f53e4f1e725d89a4">printInorder</a>(root-&gt;left);  <span class="comment">/// recursive call to left subtree</span></div>
-<div class="line"><span class="lineno">  142</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; root-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
-<div class="line"><span class="lineno">  143</span>    <a class="code hl_function" href="#a5d7266b934ca50c4f53e4f1e725d89a4">printInorder</a>(root-&gt;right);  <span class="comment">/// recursive call to right subtree</span></div>
+<div class="line"><span class="lineno">  141</span>    <a class="code hl_function" href="#a5d7266b934ca50c4f53e4f1e725d89a4">printInorder</a>(root-&gt;left);  </div>
+<div class="line"><span class="lineno">  142</span>    std::cout &lt;&lt; root-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  143</span>    <a class="code hl_function" href="#a5d7266b934ca50c4f53e4f1e725d89a4">printInorder</a>(root-&gt;right);  </div>
 <div class="line"><span class="lineno">  144</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.svg" width="203" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -679,18 +666,15 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00387">387</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  387</span>                   {</div>
 <div class="line"><span class="lineno">  388</span>    <a class="code hl_class" href="../../d5/d58/class_test_cases.html">TestCases</a> tc;</div>
 <div class="line"><span class="lineno">  389</span>    tc.<a class="code hl_function" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a>();</div>
 <div class="line"><span class="lineno">  390</span>}</div>
-<div class="ttc" id="aclass_test_cases_html"><div class="ttname"><a href="../../d5/d58/class_test_cases.html">TestCases</a></div><div class="ttdoc">class encapsulating the necessary test cases</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:225</div></div>
-<div class="ttc" id="aclass_test_cases_html_aeabea90c02f9159e4a784bbf736e1e23"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">TestCases::runTests</a></div><div class="ttdeci">void runTests()</div><div class="ttdoc">Executes test cases.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:243</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="467"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclass_test_cases_html"><div class="ttname"><a href="../../d5/d58/class_test_cases.html">TestCases</a></div><div class="ttdoc">class encapsulating the necessary test cases</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00225">inorder_successor_of_bst.cpp:225</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_aeabea90c02f9159e4a784bbf736e1e23"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">TestCases::runTests</a></div><div class="ttdeci">void runTests()</div><div class="ttdoc">Executes test cases.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00243">inorder_successor_of_bst.cpp:243</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a05fe8a029e155c43e4efa598d4d089d9_cgraph.map b/d4/d32/inorder__successor__of__bst_8cpp_a05fe8a029e155c43e4efa598d4d089d9_cgraph.map
deleted file mode 100644
index c616d69e1..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a05fe8a029e155c43e4efa598d4d089d9_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="operations_on_datastructures::inorder_traversal_of_bst::makeBST" name="operations_on_datastructures::inorder_traversal_of_bst::makeBST">
-<area shape="rect" id="Node000001" title="This function is used in test cases to quickly create BST containing large data instead of hard codin..." alt="" coords="5,29,198,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="63,29,64,19,71,10,83,5,102,3,122,5,134,12,132,17,120,10,101,8,85,10,74,14,69,21,69,29"/>
-</map>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a05fe8a029e155c43e4efa598d4d089d9_cgraph.md5 b/d4/d32/inorder__successor__of__bst_8cpp_a05fe8a029e155c43e4efa598d4d089d9_cgraph.md5
deleted file mode 100644
index bfeac2621..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a05fe8a029e155c43e4efa598d4d089d9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-491359e550d8c336c5059acf25cb419a
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a05fe8a029e155c43e4efa598d4d089d9_cgraph.svg b/d4/d32/inorder__successor__of__bst_8cpp_a05fe8a029e155c43e4efa598d4d089d9_cgraph.svg
deleted file mode 100644
index 6870e46d7..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a05fe8a029e155c43e4efa598d4d089d9_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::makeBST Pages: 1 -->
-<svg width="152pt" height="68pt"
- viewBox="0.00 0.00 152.25 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>operations_on_datastructures::inorder_traversal_of_bst::makeBST</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function is used in test cases to quickly create BST containing large data instead of hard codin...">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::makeBST</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.5,-42.07C42.97,-51.55 51.84,-59.75 72.12,-59.75 83.85,-59.75 91.77,-57.01 95.87,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.16,-54.1 98.36,-43.53 92.4,-52.29 99.16,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a05fe8a029e155c43e4efa598d4d089d9_cgraph_org.svg b/d4/d32/inorder__successor__of__bst_8cpp_a05fe8a029e155c43e4efa598d4d089d9_cgraph_org.svg
deleted file mode 100644
index e95d2db08..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a05fe8a029e155c43e4efa598d4d089d9_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::makeBST Pages: 1 -->
-<svg width="152pt" height="68pt"
- viewBox="0.00 0.00 152.25 67.75" 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 63.75)">
-<title>operations_on_datastructures::inorder_traversal_of_bst::makeBST</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function is used in test cases to quickly create BST containing large data instead of hard codin...">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::makeBST</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.5,-42.07C42.97,-51.55 51.84,-59.75 72.12,-59.75 83.85,-59.75 91.77,-57.01 95.87,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.16,-54.1 98.36,-43.53 92.4,-52.29 99.16,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
deleted file mode 100644
index 647dbc13c..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ /dev/null
@@ -1,25 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,43,55,69"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="749,119,820,145"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,45,145,18,204,7,264,3,465,3,535,6,588,18,639,39,702,70,732,87,759,107,755,111,729,92,700,74,637,44,586,23,534,12,465,8,264,8,204,13,146,24,55,50"/>
-<area shape="rect" id="Node000003" href="$d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,68,146,94"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,60,88,69,87,74,54,65"/>
-<area shape="rect" id="Node000004" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="194,119,336,145"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="148,87,214,111,212,116,146,92"/>
-<area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="289,116,332,96,384,80,473,67,543,67,614,79,702,100,738,111,736,116,700,105,613,84,543,73,473,72,385,85,334,101,292,121"/>
-<area shape="rect" id="Node000005" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="592,195,701,221"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="293,143,335,163,385,180,485,198,576,204,576,210,484,203,384,185,333,168,290,148"/>
-<area shape="rect" id="Node000006" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, printing inorder successor of last node." alt="" coords="384,95,544,121"/>
-<area shape="poly" id="edge7_Node000004_Node000006" title=" " alt="" coords="336,121,368,117,369,122,337,126"/>
-<area shape="rect" id="Node000007" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="384,144,544,170"/>
-<area shape="poly" id="edge10_Node000004_Node000007" title=" " alt="" coords="337,138,369,143,368,148,336,144"/>
-<area shape="rect" id="Node000008" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="384,246,544,272"/>
-<area shape="poly" id="edge13_Node000004_Node000008" title=" " alt="" coords="282,143,327,182,386,224,410,237,408,242,383,229,323,187,279,147"/>
-<area shape="poly" id="edge6_Node000005_Node000002" title=" " alt="" coords="670,192,745,150,748,155,673,197"/>
-<area shape="poly" id="edge8_Node000006_Node000002" title=" " alt="" coords="544,111,734,126,733,131,544,117"/>
-<area shape="poly" id="edge9_Node000006_Node000005" title=" " alt="" coords="519,119,545,130,586,155,621,183,618,187,583,160,542,134,517,124"/>
-<area shape="poly" id="edge11_Node000007_Node000002" title=" " alt="" coords="544,148,733,133,734,139,544,154"/>
-<area shape="poly" id="edge12_Node000007_Node000005" title=" " alt="" coords="514,168,584,188,582,193,512,173"/>
-<area shape="poly" id="edge14_Node000008_Node000002" title=" " alt="" coords="544,262,622,256,662,247,700,231,721,216,740,197,767,157,772,160,744,200,725,220,702,236,664,252,623,262,544,268"/>
-<area shape="poly" id="edge15_Node000008_Node000005" title=" " alt="" coords="512,243,582,223,584,228,514,248"/>
-</map>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
deleted file mode 100644
index 4e01eb258..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-176a0c7d34baa2213e9a37423dd7dba8
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
deleted file mode 100644
index cb50452fd..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ /dev/null
@@ -1,302 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 208 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 619;
-var viewHeight = 208;
-var sectionId = 'dynsection-6';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-171.25 0,-171.25 0,-152 37,-152 37,-171.25"/>
-<text text-anchor="middle" x="18.5" y="-157.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="611.25,-114.25 557.75,-114.25 557.75,-95 611.25,-95 611.25,-114.25"/>
-<text text-anchor="middle" x="584.5" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.05,-168.07C68.18,-178.91 135.32,-199.62 193.88,-199.62 193.88,-199.62 193.88,-199.62 345,-199.62 426.64,-199.62 448.34,-185.33 521.75,-149.62 536.85,-142.28 552.11,-131.2 563.68,-121.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="565.85,-124.63 571.29,-115.54 561.37,-119.25 565.85,-124.63"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-152.25 73,-152.25 73,-133 105.5,-133 105.5,-152.25"/>
-<text text-anchor="middle" x="89.25" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-156.73C44.67,-154.67 53.52,-152.22 61.73,-149.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.55,-153.36 71.25,-147.32 60.68,-146.61 62.55,-153.36"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
-<polygon fill="white" stroke="#666666" points="248.25,-114.25 141.5,-114.25 141.5,-95 248.25,-95 248.25,-114.25"/>
-<text text-anchor="middle" x="194.88" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.99,-136.85C119.21,-132 138.66,-124.87 155.9,-118.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.66,-122 164.85,-115.27 154.25,-115.43 156.66,-122"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.82,-114.64C231.21,-123.73 258.65,-136.48 284.25,-141.62 387.94,-162.46 418.88,-151.18 521.75,-126.62 530.62,-124.51 539.99,-121.56 548.68,-118.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="549.62,-121.89 557.81,-115.16 547.21,-115.32 549.62,-121.89"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="521.75,-57.25 439.75,-57.25 439.75,-38 521.75,-38 521.75,-57.25"/>
-<text text-anchor="middle" x="480.75" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.58,-94.56C232.07,-85.64 259.18,-73.07 284.25,-66.62 332.05,-54.34 388.28,-49.88 428.13,-48.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="428.05,-51.82 437.92,-47.98 427.81,-44.82 428.05,-51.82"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
-<polygon fill="white" stroke="#666666" points="403.75,-132.25 284.25,-132.25 284.25,-113 403.75,-113 403.75,-132.25"/>
-<text text-anchor="middle" x="344" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge7_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge7_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.57,-111.07C256.36,-112.03 264.49,-113.02 272.57,-114.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.07,-117.47 282.42,-115.21 272.92,-110.52 272.07,-117.47"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="403.75,-95.25 284.25,-95.25 284.25,-76 403.75,-76 403.75,-95.25"/>
-<text text-anchor="middle" x="344" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge10_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge10_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.57,-97.82C256.36,-96.81 264.49,-95.76 272.57,-94.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.95,-98.2 282.42,-93.45 272.06,-91.26 272.95,-98.2"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="403.75,-19.25 284.25,-19.25 284.25,0 403.75,0 403.75,-19.25"/>
-<text text-anchor="middle" x="344" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge13_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge13_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M206.28,-94.57C222.09,-79.71 253.56,-51.7 284.25,-33.62 290.09,-30.19 296.51,-27.01 302.9,-24.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.25,-27.41 312.12,-20.32 301.55,-20.95 304.25,-27.41"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge6_Node000005_Node000002" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge6_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M499.47,-57.55C514.99,-66.25 537.79,-79.02 555.73,-89.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="553.88,-92.05 564.32,-93.88 557.3,-85.94 553.88,-92.05"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node2 -->
-<g id="edge8_Node000006_Node000002" class="edge">
-<title>Node6&#45;&gt;Node2</title>
-<g id="a_edge8_Node000006_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M403.96,-118.18C448.46,-114.82 508.17,-110.31 546.25,-107.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="546.11,-110.96 555.82,-106.71 545.59,-103.98 546.11,-110.96"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge9_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge9_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M384.61,-112.55C391.16,-110.31 397.76,-107.67 403.75,-104.62 424.73,-93.96 445.94,-77.46 460.61,-64.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="462.86,-67.63 468.09,-58.42 458.26,-62.37 462.86,-67.63"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node2 -->
-<g id="edge11_Node000007_Node000002" class="edge">
-<title>Node7&#45;&gt;Node2</title>
-<g id="a_edge11_Node000007_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M403.96,-90.32C448.46,-93.87 508.17,-98.62 546.25,-101.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="545.57,-105.11 555.82,-102.42 546.13,-98.14 545.57,-105.11"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge12_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge12_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.76,-75.54C396.87,-71 416.11,-65.57 433.33,-60.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="434.16,-64.12 442.84,-58.03 432.26,-57.38 434.16,-64.12"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node2 -->
-<g id="edge14_Node000008_Node000002" class="edge">
-<title>Node8&#45;&gt;Node2</title>
-<g id="a_edge14_Node000008_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M404.04,-4.99C440.08,-4.73 485.96,-9.17 521.75,-28.62 545.01,-41.26 562.81,-66.64 573.2,-84.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="570.09,-86.2 577.96,-93.29 576.23,-82.84 570.09,-86.2"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge15_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge15_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.76,-19.71C396.87,-24.25 416.11,-29.68 433.33,-34.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="432.26,-37.87 442.84,-37.22 434.16,-31.13 432.26,-37.87"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
deleted file mode 100644
index 48d8c543d..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
+++ /dev/null
@@ -1,219 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="619pt" height="208pt"
- viewBox="0.00 0.00 619.25 207.62" 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 203.62)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-171.25 0,-171.25 0,-152 37,-152 37,-171.25"/>
-<text text-anchor="middle" x="18.5" y="-157.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="611.25,-114.25 557.75,-114.25 557.75,-95 611.25,-95 611.25,-114.25"/>
-<text text-anchor="middle" x="584.5" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.05,-168.07C68.18,-178.91 135.32,-199.62 193.88,-199.62 193.88,-199.62 193.88,-199.62 345,-199.62 426.64,-199.62 448.34,-185.33 521.75,-149.62 536.85,-142.28 552.11,-131.2 563.68,-121.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="565.85,-124.63 571.29,-115.54 561.37,-119.25 565.85,-124.63"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-152.25 73,-152.25 73,-133 105.5,-133 105.5,-152.25"/>
-<text text-anchor="middle" x="89.25" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-156.73C44.67,-154.67 53.52,-152.22 61.73,-149.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.55,-153.36 71.25,-147.32 60.68,-146.61 62.55,-153.36"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
-<polygon fill="white" stroke="#666666" points="248.25,-114.25 141.5,-114.25 141.5,-95 248.25,-95 248.25,-114.25"/>
-<text text-anchor="middle" x="194.88" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.99,-136.85C119.21,-132 138.66,-124.87 155.9,-118.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.66,-122 164.85,-115.27 154.25,-115.43 156.66,-122"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.82,-114.64C231.21,-123.73 258.65,-136.48 284.25,-141.62 387.94,-162.46 418.88,-151.18 521.75,-126.62 530.62,-124.51 539.99,-121.56 548.68,-118.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="549.62,-121.89 557.81,-115.16 547.21,-115.32 549.62,-121.89"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="521.75,-57.25 439.75,-57.25 439.75,-38 521.75,-38 521.75,-57.25"/>
-<text text-anchor="middle" x="480.75" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.58,-94.56C232.07,-85.64 259.18,-73.07 284.25,-66.62 332.05,-54.34 388.28,-49.88 428.13,-48.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="428.05,-51.82 437.92,-47.98 427.81,-44.82 428.05,-51.82"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
-<polygon fill="white" stroke="#666666" points="403.75,-132.25 284.25,-132.25 284.25,-113 403.75,-113 403.75,-132.25"/>
-<text text-anchor="middle" x="344" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge7_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge7_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.57,-111.07C256.36,-112.03 264.49,-113.02 272.57,-114.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.07,-117.47 282.42,-115.21 272.92,-110.52 272.07,-117.47"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="403.75,-95.25 284.25,-95.25 284.25,-76 403.75,-76 403.75,-95.25"/>
-<text text-anchor="middle" x="344" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge10_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge10_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.57,-97.82C256.36,-96.81 264.49,-95.76 272.57,-94.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.95,-98.2 282.42,-93.45 272.06,-91.26 272.95,-98.2"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="403.75,-19.25 284.25,-19.25 284.25,0 403.75,0 403.75,-19.25"/>
-<text text-anchor="middle" x="344" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge13_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge13_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M206.28,-94.57C222.09,-79.71 253.56,-51.7 284.25,-33.62 290.09,-30.19 296.51,-27.01 302.9,-24.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.25,-27.41 312.12,-20.32 301.55,-20.95 304.25,-27.41"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge6_Node000005_Node000002" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge6_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M499.47,-57.55C514.99,-66.25 537.79,-79.02 555.73,-89.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="553.88,-92.05 564.32,-93.88 557.3,-85.94 553.88,-92.05"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node2 -->
-<g id="edge8_Node000006_Node000002" class="edge">
-<title>Node6&#45;&gt;Node2</title>
-<g id="a_edge8_Node000006_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M403.96,-118.18C448.46,-114.82 508.17,-110.31 546.25,-107.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="546.11,-110.96 555.82,-106.71 545.59,-103.98 546.11,-110.96"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge9_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge9_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M384.61,-112.55C391.16,-110.31 397.76,-107.67 403.75,-104.62 424.73,-93.96 445.94,-77.46 460.61,-64.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="462.86,-67.63 468.09,-58.42 458.26,-62.37 462.86,-67.63"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node2 -->
-<g id="edge11_Node000007_Node000002" class="edge">
-<title>Node7&#45;&gt;Node2</title>
-<g id="a_edge11_Node000007_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M403.96,-90.32C448.46,-93.87 508.17,-98.62 546.25,-101.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="545.57,-105.11 555.82,-102.42 546.13,-98.14 545.57,-105.11"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge12_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge12_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.76,-75.54C396.87,-71 416.11,-65.57 433.33,-60.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="434.16,-64.12 442.84,-58.03 432.26,-57.38 434.16,-64.12"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node2 -->
-<g id="edge14_Node000008_Node000002" class="edge">
-<title>Node8&#45;&gt;Node2</title>
-<g id="a_edge14_Node000008_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M404.04,-4.99C440.08,-4.73 485.96,-9.17 521.75,-28.62 545.01,-41.26 562.81,-66.64 573.2,-84.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="570.09,-86.2 577.96,-93.29 576.23,-82.84 570.09,-86.2"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge15_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge15_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.76,-19.71C396.87,-24.25 416.11,-29.68 433.33,-34.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="432.26,-37.87 442.84,-37.22 434.16,-31.13 432.26,-37.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a3923fb22b46e085376703cae0b44d690_cgraph.map b/d4/d32/inorder__successor__of__bst_8cpp_a3923fb22b46e085376703cae0b44d690_cgraph.map
deleted file mode 100644
index aff68fb69..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a3923fb22b46e085376703cae0b44d690_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="operations_on_datastructures::inorder_traversal_of_bst::getInorderSuccessor" name="operations_on_datastructures::inorder_traversal_of_bst::getInorderSuccessor">
-<area shape="rect" id="Node000001" title="Inorder successor of a node is the next node in inorder traversal of the Binary Tree...." alt="" coords="5,81,198,137"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="54,81,55,71,64,62,79,57,102,55,127,57,142,64,140,69,125,62,101,60,80,62,66,67,60,73,60,81"/>
-<area shape="rect" id="Node000002" href="$d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db" title="Finds and return the minimum node in BST." alt="" coords="246,29,438,85"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="198,86,230,79,231,84,199,91"/>
-<area shape="rect" id="Node000003" href="$d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95" title="Searches the given data in BST and returns the pointer to the node containing that data." alt="" coords="246,133,438,189"/>
-<area shape="poly" id="edge4_Node000001_Node000003" title=" " alt="" coords="199,127,231,134,230,140,198,133"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="295,29,295,19,304,10,319,5,342,3,367,5,382,12,380,17,366,10,342,8,321,10,307,15,300,21,300,29"/>
-<area shape="poly" id="edge5_Node000003_Node000003" title=" " alt="" coords="295,133,295,123,304,114,319,109,342,107,367,109,382,116,380,121,366,114,342,112,321,114,307,119,300,125,300,133"/>
-</map>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a3923fb22b46e085376703cae0b44d690_cgraph.md5 b/d4/d32/inorder__successor__of__bst_8cpp_a3923fb22b46e085376703cae0b44d690_cgraph.md5
deleted file mode 100644
index 43a855de6..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a3923fb22b46e085376703cae0b44d690_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e05b5ce959ced9808573c9d20e2e5fc7
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a3923fb22b46e085376703cae0b44d690_cgraph.svg b/d4/d32/inorder__successor__of__bst_8cpp_a3923fb22b46e085376703cae0b44d690_cgraph.svg
deleted file mode 100644
index 29f3ffd67..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a3923fb22b46e085376703cae0b44d690_cgraph.svg
+++ /dev/null
@@ -1,116 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::getInorderSuccessor Pages: 1 -->
-<svg width="333pt" height="146pt"
- viewBox="0.00 0.00 332.50 145.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 141.75)">
-<title>operations_on_datastructures::inorder_traversal_of_bst::getInorderSuccessor</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Inorder successor of a node is the next node in inorder traversal of the Binary Tree....">
-<polygon fill="#999999" stroke="#666666" points="144.25,-80.75 0,-80.75 0,-39 144.25,-39 144.25,-80.75"/>
-<text text-anchor="start" x="8" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="72.12" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">::getInorderSuccessor</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.86,-81.07C35.69,-90.55 46.78,-98.75 72.12,-98.75 86.78,-98.75 96.67,-96.01 101.79,-91.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.07,-93.1 104.91,-82.5 98.43,-90.88 105.07,-93.1"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db" target="_top" xlink:title="Finds and return the minimum node in BST.">
-<polygon fill="white" stroke="#666666" points="324.5,-119.75 180.25,-119.75 180.25,-78 324.5,-78 324.5,-119.75"/>
-<text text-anchor="start" x="188.25" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="252.38" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::findMinNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-75.51C152.59,-77.26 160.78,-79.05 168.89,-80.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.89,-84.19 178.41,-82.91 169.39,-77.35 167.89,-84.19"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95" target="_top" xlink:title="Searches the given data in BST and returns the pointer to the node containing that data.">
-<polygon fill="white" stroke="#666666" points="324.5,-41.75 180.25,-41.75 180.25,0 324.5,0 324.5,-41.75"/>
-<text text-anchor="start" x="188.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::getNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-44.24C152.59,-42.49 160.78,-40.7 168.89,-38.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.39,-42.4 178.41,-36.84 167.89,-35.56 169.39,-42.4"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.11,-120.07C215.94,-129.55 227.03,-137.75 252.38,-137.75 267.03,-137.75 276.92,-135.01 282.04,-130.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.32,-132.1 285.16,-121.5 278.68,-129.88 285.32,-132.1"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge5_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge5_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.11,-42.07C215.94,-51.55 227.03,-59.75 252.38,-59.75 267.03,-59.75 276.92,-57.01 282.04,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.32,-54.1 285.16,-43.5 278.68,-51.88 285.32,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a3923fb22b46e085376703cae0b44d690_cgraph_org.svg b/d4/d32/inorder__successor__of__bst_8cpp_a3923fb22b46e085376703cae0b44d690_cgraph_org.svg
deleted file mode 100644
index 2ad18bf5d..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a3923fb22b46e085376703cae0b44d690_cgraph_org.svg
+++ /dev/null
@@ -1,90 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::getInorderSuccessor Pages: 1 -->
-<svg width="333pt" height="146pt"
- viewBox="0.00 0.00 332.50 145.75" 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 141.75)">
-<title>operations_on_datastructures::inorder_traversal_of_bst::getInorderSuccessor</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Inorder successor of a node is the next node in inorder traversal of the Binary Tree....">
-<polygon fill="#999999" stroke="#666666" points="144.25,-80.75 0,-80.75 0,-39 144.25,-39 144.25,-80.75"/>
-<text text-anchor="start" x="8" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="72.12" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">::getInorderSuccessor</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.86,-81.07C35.69,-90.55 46.78,-98.75 72.12,-98.75 86.78,-98.75 96.67,-96.01 101.79,-91.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.07,-93.1 104.91,-82.5 98.43,-90.88 105.07,-93.1"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db" target="_top" xlink:title="Finds and return the minimum node in BST.">
-<polygon fill="white" stroke="#666666" points="324.5,-119.75 180.25,-119.75 180.25,-78 324.5,-78 324.5,-119.75"/>
-<text text-anchor="start" x="188.25" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="252.38" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::findMinNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-75.51C152.59,-77.26 160.78,-79.05 168.89,-80.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.89,-84.19 178.41,-82.91 169.39,-77.35 167.89,-84.19"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95" target="_top" xlink:title="Searches the given data in BST and returns the pointer to the node containing that data.">
-<polygon fill="white" stroke="#666666" points="324.5,-41.75 180.25,-41.75 180.25,0 324.5,0 324.5,-41.75"/>
-<text text-anchor="start" x="188.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::getNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-44.24C152.59,-42.49 160.78,-40.7 168.89,-38.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.39,-42.4 178.41,-36.84 167.89,-35.56 169.39,-42.4"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.11,-120.07C215.94,-129.55 227.03,-137.75 252.38,-137.75 267.03,-137.75 276.92,-135.01 282.04,-130.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.32,-132.1 285.16,-121.5 278.68,-129.88 285.32,-132.1"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge5_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge5_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.11,-42.07C215.94,-51.55 227.03,-59.75 252.38,-59.75 267.03,-59.75 276.92,-57.01 282.04,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.32,-54.1 285.16,-43.5 278.68,-51.88 285.32,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a3ae0bea4123fd2ce155108e88f2ef78c_cgraph.map b/d4/d32/inorder__successor__of__bst_8cpp_a3ae0bea4123fd2ce155108e88f2ef78c_cgraph.map
deleted file mode 100644
index 72236a271..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a3ae0bea4123fd2ce155108e88f2ef78c_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="operations_on_datastructures::inorder_traversal_of_bst::Insert" name="operations_on_datastructures::inorder_traversal_of_bst::Insert">
-<area shape="rect" id="Node000001" title="Inserts the given data in BST while maintaining the properties of BST." alt="" coords="5,29,198,85"/>
-<area shape="rect" id="Node000002" href="$d4/d32/inorder__successor__of__bst_8cpp.html#a7f6f73a33beec448c27cc1d70b220702" title="Allocates a new node in heap for given data and returns it&#39;s pointer." alt="" coords="246,29,438,85"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="198,54,230,54,230,60,198,60"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="295,29,295,19,304,10,319,5,342,3,367,5,382,12,380,17,366,10,342,8,321,10,307,15,300,21,300,29"/>
-</map>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a3ae0bea4123fd2ce155108e88f2ef78c_cgraph.md5 b/d4/d32/inorder__successor__of__bst_8cpp_a3ae0bea4123fd2ce155108e88f2ef78c_cgraph.md5
deleted file mode 100644
index 243727430..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a3ae0bea4123fd2ce155108e88f2ef78c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f84e103599c69c8b8d12e8a425107e1c
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a3ae0bea4123fd2ce155108e88f2ef78c_cgraph.svg b/d4/d32/inorder__successor__of__bst_8cpp_a3ae0bea4123fd2ce155108e88f2ef78c_cgraph.svg
deleted file mode 100644
index 33e0a086b..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a3ae0bea4123fd2ce155108e88f2ef78c_cgraph.svg
+++ /dev/null
@@ -1,78 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::Insert Pages: 1 -->
-<svg width="333pt" height="68pt"
- viewBox="0.00 0.00 332.50 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>operations_on_datastructures::inorder_traversal_of_bst::Insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Inserts the given data in BST while maintaining the properties of BST.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7f6f73a33beec448c27cc1d70b220702" target="_top" xlink:title="Allocates a new node in heap for given data and returns it&#39;s pointer.">
-<polygon fill="white" stroke="#666666" points="324.5,-41.75 180.25,-41.75 180.25,0 324.5,0 324.5,-41.75"/>
-<text text-anchor="start" x="188.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::makeNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-20.88C152.5,-20.88 160.59,-20.88 168.61,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.37,-24.38 178.37,-20.88 168.37,-17.38 168.37,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.11,-42.07C215.94,-51.55 227.03,-59.75 252.38,-59.75 267.03,-59.75 276.92,-57.01 282.04,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.32,-54.1 285.16,-43.5 278.68,-51.88 285.32,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a3ae0bea4123fd2ce155108e88f2ef78c_cgraph_org.svg b/d4/d32/inorder__successor__of__bst_8cpp_a3ae0bea4123fd2ce155108e88f2ef78c_cgraph_org.svg
deleted file mode 100644
index c881c53e2..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a3ae0bea4123fd2ce155108e88f2ef78c_cgraph_org.svg
+++ /dev/null
@@ -1,52 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::Insert Pages: 1 -->
-<svg width="333pt" height="68pt"
- viewBox="0.00 0.00 332.50 67.75" 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 63.75)">
-<title>operations_on_datastructures::inorder_traversal_of_bst::Insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Inserts the given data in BST while maintaining the properties of BST.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7f6f73a33beec448c27cc1d70b220702" target="_top" xlink:title="Allocates a new node in heap for given data and returns it&#39;s pointer.">
-<polygon fill="white" stroke="#666666" points="324.5,-41.75 180.25,-41.75 180.25,0 324.5,0 324.5,-41.75"/>
-<text text-anchor="start" x="188.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::makeNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-20.88C152.5,-20.88 160.59,-20.88 168.61,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.37,-24.38 178.37,-20.88 168.37,-17.38 168.37,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.11,-42.07C215.94,-51.55 227.03,-59.75 252.38,-59.75 267.03,-59.75 276.92,-57.01 282.04,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.32,-54.1 285.16,-43.5 278.68,-51.88 285.32,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.map b/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.map
deleted file mode 100644
index 6d3cb1737..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="operations_on_datastructures::inorder_traversal_of_bst::printInorder" name="operations_on_datastructures::inorder_traversal_of_bst::printInorder">
-<area shape="rect" id="Node000001" title="Prints the BST in inorder traversal using recursion." alt="" coords="5,29,198,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="63,29,64,19,71,10,83,5,102,3,122,5,134,12,132,17,120,10,101,8,85,10,74,14,69,21,69,29"/>
-</map>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.md5 b/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.md5
deleted file mode 100644
index 8a7bc975e..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1f044eb16549322914bb3200b87ce058
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.svg b/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.svg
deleted file mode 100644
index 346bbef6c..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::printInorder Pages: 1 -->
-<svg width="152pt" height="68pt"
- viewBox="0.00 0.00 152.25 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>operations_on_datastructures::inorder_traversal_of_bst::printInorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Prints the BST in inorder traversal using recursion.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::printInorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.5,-42.07C42.97,-51.55 51.84,-59.75 72.12,-59.75 83.85,-59.75 91.77,-57.01 95.87,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.16,-54.1 98.36,-43.53 92.4,-52.29 99.16,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph_org.svg b/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph_org.svg
deleted file mode 100644
index dc324b937..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::printInorder Pages: 1 -->
-<svg width="152pt" height="68pt"
- viewBox="0.00 0.00 152.25 67.75" 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 63.75)">
-<title>operations_on_datastructures::inorder_traversal_of_bst::printInorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Prints the BST in inorder traversal using recursion.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::printInorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.5,-42.07C42.97,-51.55 51.84,-59.75 72.12,-59.75 83.85,-59.75 91.77,-57.01 95.87,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.16,-54.1 98.36,-43.53 92.4,-52.29 99.16,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a72483e3f6933e004a8d86371e8a990db_cgraph.map b/d4/d32/inorder__successor__of__bst_8cpp_a72483e3f6933e004a8d86371e8a990db_cgraph.map
deleted file mode 100644
index 1464a0362..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a72483e3f6933e004a8d86371e8a990db_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="operations_on_datastructures::inorder_traversal_of_bst::findMinNode" name="operations_on_datastructures::inorder_traversal_of_bst::findMinNode">
-<area shape="rect" id="Node000001" title="Finds and return the minimum node in BST." alt="" coords="5,29,198,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="63,29,64,19,71,10,83,5,102,3,122,5,134,12,132,17,120,10,101,8,85,10,74,14,69,21,69,29"/>
-</map>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a72483e3f6933e004a8d86371e8a990db_cgraph.md5 b/d4/d32/inorder__successor__of__bst_8cpp_a72483e3f6933e004a8d86371e8a990db_cgraph.md5
deleted file mode 100644
index 61f872af3..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a72483e3f6933e004a8d86371e8a990db_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-891820adabdca3911ad6160150fd0055
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a72483e3f6933e004a8d86371e8a990db_cgraph.svg b/d4/d32/inorder__successor__of__bst_8cpp_a72483e3f6933e004a8d86371e8a990db_cgraph.svg
deleted file mode 100644
index e83fd18b1..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a72483e3f6933e004a8d86371e8a990db_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::findMinNode Pages: 1 -->
-<svg width="152pt" height="68pt"
- viewBox="0.00 0.00 152.25 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>operations_on_datastructures::inorder_traversal_of_bst::findMinNode</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Finds and return the minimum node in BST.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::findMinNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.5,-42.07C42.97,-51.55 51.84,-59.75 72.12,-59.75 83.85,-59.75 91.77,-57.01 95.87,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.16,-54.1 98.36,-43.53 92.4,-52.29 99.16,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a72483e3f6933e004a8d86371e8a990db_cgraph_org.svg b/d4/d32/inorder__successor__of__bst_8cpp_a72483e3f6933e004a8d86371e8a990db_cgraph_org.svg
deleted file mode 100644
index caca112b2..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a72483e3f6933e004a8d86371e8a990db_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::findMinNode Pages: 1 -->
-<svg width="152pt" height="68pt"
- viewBox="0.00 0.00 152.25 67.75" 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 63.75)">
-<title>operations_on_datastructures::inorder_traversal_of_bst::findMinNode</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Finds and return the minimum node in BST.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::findMinNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.5,-42.07C42.97,-51.55 51.84,-59.75 72.12,-59.75 83.85,-59.75 91.77,-57.01 95.87,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.16,-54.1 98.36,-43.53 92.4,-52.29 99.16,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.map b/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.map
deleted file mode 100644
index ae7de9e8b..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="operations_on_datastructures::inorder_traversal_of_bst::deallocate" name="operations_on_datastructures::inorder_traversal_of_bst::deallocate">
-<area shape="rect" id="Node000001" title="This function clears the memory allocated to entire tree recursively. Its just for clean up the memor..." alt="" coords="5,29,198,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="63,29,64,19,71,10,83,5,102,3,122,5,134,12,132,17,120,10,101,8,85,10,74,14,69,21,69,29"/>
-</map>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.md5 b/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.md5
deleted file mode 100644
index caa84ab78..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-eab10094c23f4370bf2651d5855d9d53
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.svg b/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.svg
deleted file mode 100644
index 6ab1832d3..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::deallocate Pages: 1 -->
-<svg width="152pt" height="68pt"
- viewBox="0.00 0.00 152.25 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>operations_on_datastructures::inorder_traversal_of_bst::deallocate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function clears the memory allocated to entire tree recursively. Its just for clean up the memor...">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::deallocate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.5,-42.07C42.97,-51.55 51.84,-59.75 72.12,-59.75 83.85,-59.75 91.77,-57.01 95.87,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.16,-54.1 98.36,-43.53 92.4,-52.29 99.16,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph_org.svg b/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph_org.svg
deleted file mode 100644
index bbde74305..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::deallocate Pages: 1 -->
-<svg width="152pt" height="68pt"
- viewBox="0.00 0.00 152.25 67.75" 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 63.75)">
-<title>operations_on_datastructures::inorder_traversal_of_bst::deallocate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function clears the memory allocated to entire tree recursively. Its just for clean up the memor...">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::deallocate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.5,-42.07C42.97,-51.55 51.84,-59.75 72.12,-59.75 83.85,-59.75 91.77,-57.01 95.87,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.16,-54.1 98.36,-43.53 92.4,-52.29 99.16,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a7f6f73a33beec448c27cc1d70b220702_cgraph.map b/d4/d32/inorder__successor__of__bst_8cpp_a7f6f73a33beec448c27cc1d70b220702_cgraph.map
deleted file mode 100644
index 3582afacb..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a7f6f73a33beec448c27cc1d70b220702_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="operations_on_datastructures::inorder_traversal_of_bst::makeNode" name="operations_on_datastructures::inorder_traversal_of_bst::makeNode">
-<area shape="rect" id="Node000001" title="Allocates a new node in heap for given data and returns it&#39;s pointer." alt="" coords="5,29,198,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="63,29,64,19,71,10,83,5,102,3,122,5,134,12,132,17,120,10,101,8,85,10,74,14,69,21,69,29"/>
-</map>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a7f6f73a33beec448c27cc1d70b220702_cgraph.md5 b/d4/d32/inorder__successor__of__bst_8cpp_a7f6f73a33beec448c27cc1d70b220702_cgraph.md5
deleted file mode 100644
index d50668791..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a7f6f73a33beec448c27cc1d70b220702_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-96731cf7da4cc01161f0a21940e74512
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a7f6f73a33beec448c27cc1d70b220702_cgraph.svg b/d4/d32/inorder__successor__of__bst_8cpp_a7f6f73a33beec448c27cc1d70b220702_cgraph.svg
deleted file mode 100644
index 590cec753..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a7f6f73a33beec448c27cc1d70b220702_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::makeNode Pages: 1 -->
-<svg width="152pt" height="68pt"
- viewBox="0.00 0.00 152.25 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>operations_on_datastructures::inorder_traversal_of_bst::makeNode</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Allocates a new node in heap for given data and returns it&#39;s pointer.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::makeNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.5,-42.07C42.97,-51.55 51.84,-59.75 72.12,-59.75 83.85,-59.75 91.77,-57.01 95.87,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.16,-54.1 98.36,-43.53 92.4,-52.29 99.16,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a7f6f73a33beec448c27cc1d70b220702_cgraph_org.svg b/d4/d32/inorder__successor__of__bst_8cpp_a7f6f73a33beec448c27cc1d70b220702_cgraph_org.svg
deleted file mode 100644
index bdab4c33c..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a7f6f73a33beec448c27cc1d70b220702_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::makeNode Pages: 1 -->
-<svg width="152pt" height="68pt"
- viewBox="0.00 0.00 152.25 67.75" 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 63.75)">
-<title>operations_on_datastructures::inorder_traversal_of_bst::makeNode</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Allocates a new node in heap for given data and returns it&#39;s pointer.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::makeNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.5,-42.07C42.97,-51.55 51.84,-59.75 72.12,-59.75 83.85,-59.75 91.77,-57.01 95.87,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.16,-54.1 98.36,-43.53 92.4,-52.29 99.16,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a824cbf1814854824cf05f062eea07b95_cgraph.map b/d4/d32/inorder__successor__of__bst_8cpp_a824cbf1814854824cf05f062eea07b95_cgraph.map
deleted file mode 100644
index 01ff930f3..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a824cbf1814854824cf05f062eea07b95_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="operations_on_datastructures::inorder_traversal_of_bst::getNode" name="operations_on_datastructures::inorder_traversal_of_bst::getNode">
-<area shape="rect" id="Node000001" title="Searches the given data in BST and returns the pointer to the node containing that data." alt="" coords="5,29,198,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="63,29,64,19,71,10,83,5,102,3,122,5,134,12,132,17,120,10,101,8,85,10,74,14,69,21,69,29"/>
-</map>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a824cbf1814854824cf05f062eea07b95_cgraph.md5 b/d4/d32/inorder__successor__of__bst_8cpp_a824cbf1814854824cf05f062eea07b95_cgraph.md5
deleted file mode 100644
index 86822e05c..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a824cbf1814854824cf05f062eea07b95_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-818bcddfed44dc59cca08b407ea251ab
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a824cbf1814854824cf05f062eea07b95_cgraph.svg b/d4/d32/inorder__successor__of__bst_8cpp_a824cbf1814854824cf05f062eea07b95_cgraph.svg
deleted file mode 100644
index bff31e14e..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a824cbf1814854824cf05f062eea07b95_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::getNode Pages: 1 -->
-<svg width="152pt" height="68pt"
- viewBox="0.00 0.00 152.25 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>operations_on_datastructures::inorder_traversal_of_bst::getNode</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Searches the given data in BST and returns the pointer to the node containing that data.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::getNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.5,-42.07C42.97,-51.55 51.84,-59.75 72.12,-59.75 83.85,-59.75 91.77,-57.01 95.87,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.16,-54.1 98.36,-43.53 92.4,-52.29 99.16,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a824cbf1814854824cf05f062eea07b95_cgraph_org.svg b/d4/d32/inorder__successor__of__bst_8cpp_a824cbf1814854824cf05f062eea07b95_cgraph_org.svg
deleted file mode 100644
index 883c6fdd3..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_a824cbf1814854824cf05f062eea07b95_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::getNode Pages: 1 -->
-<svg width="152pt" height="68pt"
- viewBox="0.00 0.00 152.25 67.75" 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 63.75)">
-<title>operations_on_datastructures::inorder_traversal_of_bst::getNode</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Searches the given data in BST and returns the pointer to the node containing that data.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::getNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.5,-42.07C42.97,-51.55 51.84,-59.75 72.12,-59.75 83.85,-59.75 91.77,-57.01 95.87,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.16,-54.1 98.36,-43.53 92.4,-52.29 99.16,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index de38214d8..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,22 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,92,49,117"/>
-<area shape="rect" id="Node000002" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="97,92,239,117"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,102,81,102,81,107,49,107"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="652,92,723,117"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="182,89,226,55,255,38,286,26,375,6,412,3,447,4,518,20,605,50,633,64,659,80,656,85,631,68,603,55,517,25,446,10,412,8,375,11,288,31,257,43,229,60,185,93"/>
-<area shape="rect" id="Node000004" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="494,92,604,117"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="239,102,479,102,479,107,239,107"/>
-<area shape="rect" id="Node000005" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, printing inorder successor of last node." alt="" coords="287,41,446,67"/>
-<area shape="poly" id="edge5_Node000002_Node000005" title=" " alt="" coords="221,88,298,69,299,74,222,94"/>
-<area shape="rect" id="Node000006" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="287,142,446,168"/>
-<area shape="poly" id="edge8_Node000002_Node000006" title=" " alt="" coords="222,115,299,135,298,141,221,121"/>
-<area shape="rect" id="Node000007" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="287,192,446,217"/>
-<area shape="poly" id="edge11_Node000002_Node000007" title=" " alt="" coords="188,116,232,147,288,178,301,183,299,188,286,183,230,151,185,120"/>
-<area shape="poly" id="edge4_Node000004_Node000003" title=" " alt="" coords="604,102,636,102,636,107,604,107"/>
-<area shape="poly" id="edge6_Node000005_Node000003" title=" " alt="" coords="447,56,523,64,604,77,637,85,636,90,603,82,523,69,446,61"/>
-<area shape="poly" id="edge7_Node000005_Node000004" title=" " alt="" coords="416,65,486,84,485,90,415,70"/>
-<area shape="poly" id="edge9_Node000006_Node000003" title=" " alt="" coords="446,148,523,140,603,127,636,119,637,124,604,132,523,145,447,153"/>
-<area shape="poly" id="edge10_Node000006_Node000004" title=" " alt="" coords="415,139,485,119,486,125,416,144"/>
-<area shape="poly" id="edge12_Node000007_Node000003" title=" " alt="" coords="446,190,523,174,603,149,652,123,655,128,605,154,524,179,447,195"/>
-<area shape="poly" id="edge13_Node000007_Node000004" title=" " alt="" coords="420,189,445,178,486,153,520,126,524,130,489,157,448,183,422,194"/>
-</map>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 8a5e67e52..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d2c5c4cea9e9ad710f2e888f48c03542
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 78085e00d..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,275 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<!--zoomable 167 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 546;
-var viewHeight = 167;
-var sectionId = 'dynsection-10';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-94.25 0,-94.25 0,-75 32.5,-75 32.5,-94.25"/>
-<text text-anchor="middle" x="16.25" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
-<polygon fill="white" stroke="#666666" points="175.25,-94.25 68.5,-94.25 68.5,-75 175.25,-75 175.25,-94.25"/>
-<text text-anchor="middle" x="121.88" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.99,-84.62C39.68,-84.62 47.96,-84.62 56.74,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.53,-88.13 66.53,-84.63 56.53,-81.13 56.53,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="538.25,-94.25 484.75,-94.25 484.75,-75 538.25,-75 538.25,-94.25"/>
-<text text-anchor="middle" x="511.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.81,-94.72C149.53,-108.47 180.08,-132.44 211.25,-141.62 312.8,-171.53 349.58,-160.65 448.75,-123.62 463.08,-118.27 477.62,-109.3 488.99,-101.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="490.85,-104.29 496.86,-95.56 486.72,-98.64 490.85,-104.29"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="448.75,-94.25 366.75,-94.25 366.75,-75 448.75,-75 448.75,-94.25"/>
-<text text-anchor="middle" x="407.75" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.6,-84.62C226.92,-84.62 304.41,-84.62 355.29,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.16,-88.13 365.16,-84.63 355.16,-81.13 355.16,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
-<polygon fill="white" stroke="#666666" points="330.75,-132.25 211.25,-132.25 211.25,-113 330.75,-113 330.75,-132.25"/>
-<text text-anchor="middle" x="271" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.92,-94.71C179.69,-99.3 200.95,-104.79 219.89,-109.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.01,-113.07 229.57,-112.18 220.76,-106.29 219.01,-113.07"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="330.75,-56.25 211.25,-56.25 211.25,-37 330.75,-37 330.75,-56.25"/>
-<text text-anchor="middle" x="271" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge8_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge8_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.92,-74.54C179.69,-69.95 200.95,-64.46 219.89,-59.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.76,-62.96 229.57,-57.07 219.01,-56.18 220.76,-62.96"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="330.75,-19.25 211.25,-19.25 211.25,0 330.75,0 330.75,-19.25"/>
-<text text-anchor="middle" x="271" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge11_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge11_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.98,-74.52C152.67,-62.04 182.77,-40.86 211.25,-27.62 214.34,-26.19 217.58,-24.83 220.88,-23.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.84,-26.92 230.08,-20.26 219.48,-20.33 221.84,-26.92"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M448.96,-84.62C456.86,-84.62 465.11,-84.62 472.91,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="472.8,-88.13 482.8,-84.63 472.8,-81.13 472.8,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge6_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge6_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.95,-119.12C365.52,-116.37 409.9,-111.61 448.75,-103.62 456.81,-101.97 465.33,-99.7 473.38,-97.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="474.39,-100.65 482.9,-94.34 472.31,-93.97 474.39,-100.65"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge7_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge7_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.76,-112.54C323.87,-108 343.11,-102.57 360.33,-97.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="361.16,-101.12 369.84,-95.03 359.26,-94.38 361.16,-101.12"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge9_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge9_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.95,-50.13C365.52,-52.88 409.9,-57.64 448.75,-65.62 456.81,-67.28 465.33,-69.55 473.38,-71.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="472.31,-75.28 482.9,-74.91 474.39,-68.6 472.31,-75.28"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge10_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge10_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.76,-56.71C323.87,-61.25 343.11,-66.68 360.33,-71.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="359.26,-74.87 369.84,-74.22 361.16,-68.13 359.26,-74.87"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge12_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge12_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.99,-18.51C365.97,-24.86 410.75,-34.93 448.75,-49.62 461.64,-54.61 475.09,-61.95 486.13,-68.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="484.26,-71.58 494.6,-73.9 487.97,-65.64 484.26,-71.58"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge13_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge13_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M311.61,-19.7C318.16,-21.94 324.76,-24.58 330.75,-27.62 351.73,-38.29 372.94,-54.79 387.61,-67.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="385.26,-69.88 395.09,-73.83 389.86,-64.62 385.26,-69.88"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index e339729cd..000000000
--- a/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,192 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="546pt" height="167pt"
- viewBox="0.00 0.00 546.25 167.01" 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 163.01)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-94.25 0,-94.25 0,-75 32.5,-75 32.5,-94.25"/>
-<text text-anchor="middle" x="16.25" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
-<polygon fill="white" stroke="#666666" points="175.25,-94.25 68.5,-94.25 68.5,-75 175.25,-75 175.25,-94.25"/>
-<text text-anchor="middle" x="121.88" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.99,-84.62C39.68,-84.62 47.96,-84.62 56.74,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.53,-88.13 66.53,-84.63 56.53,-81.13 56.53,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="538.25,-94.25 484.75,-94.25 484.75,-75 538.25,-75 538.25,-94.25"/>
-<text text-anchor="middle" x="511.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.81,-94.72C149.53,-108.47 180.08,-132.44 211.25,-141.62 312.8,-171.53 349.58,-160.65 448.75,-123.62 463.08,-118.27 477.62,-109.3 488.99,-101.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="490.85,-104.29 496.86,-95.56 486.72,-98.64 490.85,-104.29"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="448.75,-94.25 366.75,-94.25 366.75,-75 448.75,-75 448.75,-94.25"/>
-<text text-anchor="middle" x="407.75" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.6,-84.62C226.92,-84.62 304.41,-84.62 355.29,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.16,-88.13 365.16,-84.63 355.16,-81.13 355.16,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
-<polygon fill="white" stroke="#666666" points="330.75,-132.25 211.25,-132.25 211.25,-113 330.75,-113 330.75,-132.25"/>
-<text text-anchor="middle" x="271" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.92,-94.71C179.69,-99.3 200.95,-104.79 219.89,-109.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.01,-113.07 229.57,-112.18 220.76,-106.29 219.01,-113.07"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="330.75,-56.25 211.25,-56.25 211.25,-37 330.75,-37 330.75,-56.25"/>
-<text text-anchor="middle" x="271" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge8_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge8_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.92,-74.54C179.69,-69.95 200.95,-64.46 219.89,-59.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.76,-62.96 229.57,-57.07 219.01,-56.18 220.76,-62.96"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="330.75,-19.25 211.25,-19.25 211.25,0 330.75,0 330.75,-19.25"/>
-<text text-anchor="middle" x="271" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge11_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge11_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.98,-74.52C152.67,-62.04 182.77,-40.86 211.25,-27.62 214.34,-26.19 217.58,-24.83 220.88,-23.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.84,-26.92 230.08,-20.26 219.48,-20.33 221.84,-26.92"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M448.96,-84.62C456.86,-84.62 465.11,-84.62 472.91,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="472.8,-88.13 482.8,-84.63 472.8,-81.13 472.8,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge6_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge6_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.95,-119.12C365.52,-116.37 409.9,-111.61 448.75,-103.62 456.81,-101.97 465.33,-99.7 473.38,-97.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="474.39,-100.65 482.9,-94.34 472.31,-93.97 474.39,-100.65"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge7_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge7_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.76,-112.54C323.87,-108 343.11,-102.57 360.33,-97.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="361.16,-101.12 369.84,-95.03 359.26,-94.38 361.16,-101.12"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge9_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge9_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.95,-50.13C365.52,-52.88 409.9,-57.64 448.75,-65.62 456.81,-67.28 465.33,-69.55 473.38,-71.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="472.31,-75.28 482.9,-74.91 474.39,-68.6 472.31,-75.28"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge10_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge10_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.76,-56.71C323.87,-61.25 343.11,-66.68 360.33,-71.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="359.26,-74.87 369.84,-74.22 361.16,-68.13 359.26,-74.87"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge12_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge12_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.99,-18.51C365.97,-24.86 410.75,-34.93 448.75,-49.62 461.64,-54.61 475.09,-61.95 486.13,-68.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="484.26,-71.58 494.6,-73.9 487.97,-65.64 484.26,-71.58"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge13_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge13_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M311.61,-19.7C318.16,-21.94 324.76,-24.58 330.75,-27.62 351.73,-38.29 372.94,-54.79 387.61,-67.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="385.26,-69.88 395.09,-73.83 389.86,-64.62 385.26,-69.88"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_source.html b/d4/d32/inorder__successor__of__bst_8cpp_source.html
new file mode 100644
index 000000000..fe00d35e6
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_source.html
@@ -0,0 +1,479 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: operations_on_datastructures/inorder_successor_of_bst.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d32/inorder__successor__of__bst_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">inorder_successor_of_bst.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/d32/inorder__successor__of__bst_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a> {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="keyword">namespace </span>inorder_traversal_of_bst {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="foldopen" id="foldopen00056" data-start="{" data-end="};">
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">   56</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">   58</a></span>    int64_t <a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a>;  </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9ccef4c746b7226488b014f5bac4789a">   59</a></span>    <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *<a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9ccef4c746b7226488b014f5bac4789a">left</a>;    </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"><a class="line" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0">   60</a></span>    <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *<a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0">right</a>;   </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>};</div>
+</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="foldopen" id="foldopen00068" data-start="{" data-end="}">
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"><a class="line" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7f6f73a33beec448c27cc1d70b220702">   68</a></span><a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *<a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7f6f73a33beec448c27cc1d70b220702">makeNode</a>(int64_t <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a>();</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;data = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;      </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left = <span class="keyword">nullptr</span>;   </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right = <span class="keyword">nullptr</span>;  </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">return</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>}</div>
+</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="foldopen" id="foldopen00082" data-start="{" data-end="}">
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a3ae0bea4123fd2ce155108e88f2ef78c">   82</a></span><a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *Insert(<a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *root, int64_t <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        root = <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7f6f73a33beec448c27cc1d70b220702">makeNode</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data &lt;= root-&gt;</a><a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        root-&gt;left = Insert(root-&gt;left, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        root-&gt;right = Insert(root-&gt;right, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="keywordflow">return</span> root;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>}</div>
+</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="foldopen" id="foldopen00100" data-start="{" data-end="}">
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"><a class="line" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95">  100</a></span><a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *<a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95">getNode</a>(<a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *root, int64_t <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (root-&gt;data == <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        <span class="keywordflow">return</span> root;  </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> &gt; root-&gt;data) {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95">getNode</a>(root-&gt;right, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95">getNode</a>(root-&gt;left, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    }</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>}</div>
+</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="foldopen" id="foldopen00121" data-start="{" data-end="}">
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"><a class="line" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db">  121</a></span><a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *<a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db">findMinNode</a>(<a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *root) {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        <span class="keywordflow">return</span> root;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    }</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    <span class="keywordflow">while</span> (root-&gt;left != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        root = root-&gt;left;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    }</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    <span class="keywordflow">return</span> root;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>}</div>
+</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="foldopen" id="foldopen00136" data-start="{" data-end="}">
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"><a class="line" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">  136</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">printInorder</a>(<a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *root) {</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    }</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span> </div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">printInorder</a>(root-&gt;left);  </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    std::cout &lt;&lt; root-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">printInorder</a>(root-&gt;right);  </div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>}</div>
+</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span> </div>
+<div class="foldopen" id="foldopen00155" data-start="{" data-end="}">
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"><a class="line" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9">  155</a></span><a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *<a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9">makeBST</a>(<a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *root, <span class="keyword">const</span> std::vector&lt;int64_t&gt; &amp;<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    <span class="keywordflow">for</span> (int64_t values : <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>        root = Insert(root, values);</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    }</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    <span class="keywordflow">return</span> root;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>}</div>
+</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span> </div>
+<div class="foldopen" id="foldopen00176" data-start="{" data-end="}">
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"><a class="line" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a3923fb22b46e085376703cae0b44d690">  176</a></span><a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *<a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a3923fb22b46e085376703cae0b44d690">getInorderSuccessor</a>(<a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *root, int64_t <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *current = <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95">getNode</a>(root, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    <span class="keywordflow">if</span> (current == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    }</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span> </div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    <span class="comment">// Case - 1</span></div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    <span class="keywordflow">if</span> (current-&gt;<a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0">right</a> != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db">findMinNode</a>(current-&gt;<a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0">right</a>);</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    }</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    <span class="comment">// case - 2</span></div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>        <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *successor = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *ancestor = root;</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span> </div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>        <span class="keywordflow">while</span> (ancestor != current &amp;&amp; ancestor != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>            <span class="comment">// This means my current node is in left of the root node</span></div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>            <span class="keywordflow">if</span> (current-&gt;<a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a> &lt; ancestor-&gt;<a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a>) {</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>                successor = ancestor;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>                ancestor = ancestor-&gt;<a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9ccef4c746b7226488b014f5bac4789a">left</a>;  <span class="comment">// keep going left</span></div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>                ancestor = ancestor-&gt;<a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0">right</a>;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>            }</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        }</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>        <span class="keywordflow">return</span> successor;  <span class="comment">// Nodes with maximum vales will not have a successor</span></div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    }</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>}</div>
+</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span> </div>
+<div class="foldopen" id="foldopen00210" data-start="{" data-end="}">
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"><a class="line" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">  210</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">deallocate</a>(<a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *rootNode) {</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    <span class="keywordflow">if</span> (rootNode == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    }</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">deallocate</a>(rootNode-&gt;<a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9ccef4c746b7226488b014f5bac4789a">left</a>);</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">deallocate</a>(rootNode-&gt;<a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0">right</a>);</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    <span class="keyword">delete</span> (rootNode);</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>}</div>
+</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span> </div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>}  <span class="comment">// namespace inorder_traversal_of_bst</span></div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>}  <span class="comment">// namespace operations_on_datastructures</span></div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span> </div>
+<div class="foldopen" id="foldopen00225" data-start="{" data-end="};">
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"><a class="line" href="../../d5/d58/class_test_cases.html">  225</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d5/d58/class_test_cases.html">TestCases</a> {</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00233" data-start="{" data-end="}">
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"><a class="line" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">  233</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(T msg) {</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>        <span class="comment">// It&#39;s just to avoid writing cout and endl</span></div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;[TESTS] : ---&gt; &quot;</span> &lt;&lt; msg &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    }</div>
+</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span> </div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00243" data-start="{" data-end="}">
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"><a class="line" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">  243</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a>() {</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running Tests...&quot;</span>);</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span> </div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>();</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>();</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>();</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span> </div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Test Cases over!&quot;</span>);</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    }</div>
+</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span> </div>
+<div class="foldopen" id="foldopen00259" data-start="{" data-end="}">
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"><a class="line" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">  259</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>() {</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>        <span class="keyword">const</span> <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>            *expectedOutput = <span class="keyword">nullptr</span>;  </div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span> </div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 1 : &quot;</span>);</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;   EDGE CASE : Printing inorder successor for last node in the &quot;</span></div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>            <span class="stringliteral">&quot;BST, Output will be nullptr.&quot;</span>);</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span> </div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>        <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a> *root =</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>            <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>        std::vector&lt;int64_t&gt; node_data{</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>            20, 3, 5, 6, 2, 23, 45, 78, 21};  </div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span> </div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>        root = operations_on_datastructures::inorder_traversal_of_bst::makeBST(</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>            root,</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>            node_data);  </div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span> </div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Inorder sequence is : &quot;</span>;</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>        operations_on_datastructures::inorder_traversal_of_bst::printInorder(</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>            root);  </div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span> </div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>        <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>            *inorderSuccessor = operations_on_datastructures::</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>                inorder_traversal_of_bst::getInorderSuccessor(</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>                    root, 78);  </div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span> </div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>        assert(inorderSuccessor == expectedOutput);</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span> </div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>        operations_on_datastructures::inorder_traversal_of_bst::deallocate(</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>            root);  </div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span> </div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 1 PASS!&quot;</span>);</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>    }</div>
+</div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span> </div>
+<div class="foldopen" id="foldopen00304" data-start="{" data-end="}">
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"><a class="line" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">  304</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>() {</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>        <span class="keyword">const</span> <span class="keywordtype">int</span> expectedOutput = 21;  </div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span> </div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 2 : &quot;</span>);</div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span> </div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>        <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a> *root =</div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>            <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>        std::vector&lt;int64_t&gt; node_data{</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>            20, 3, 5, 6, 2, 23, 45, 78, 21};  </div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span> </div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>        root = operations_on_datastructures::inorder_traversal_of_bst::makeBST(</div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>            root,</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>            node_data);  </div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span> </div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Inorder sequence is : &quot;</span>;</div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>        operations_on_datastructures::inorder_traversal_of_bst::printInorder(</div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>            root);  </div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span> </div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>        <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>            *inorderSuccessor = operations_on_datastructures::</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>                inorder_traversal_of_bst::getInorderSuccessor(</div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>                    root, 20);  </div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span> </div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>        assert(inorderSuccessor-&gt;<a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a> == expectedOutput);</div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span> </div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>        operations_on_datastructures::inorder_traversal_of_bst::deallocate(</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>            root);  </div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span> </div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 2 PASS!&quot;</span>);</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>    }</div>
+</div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span> </div>
+<div class="foldopen" id="foldopen00345" data-start="{" data-end="}">
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"><a class="line" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">  345</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>() {</div>
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>        <span class="keyword">const</span> <span class="keywordtype">int</span> expectedOutput = 110;  </div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span> </div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 3 : &quot;</span>);</div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span> </div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>        <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a> *root =</div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>            <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>        std::vector&lt;int64_t&gt; node_data{</div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>            89,  67,  32, 56, 90, 123, 120,</div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>            110, 115, 6,  78, 7,  10};  </div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span> </div>
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>        root = operations_on_datastructures::inorder_traversal_of_bst::makeBST(</div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>            root,</div>
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>            node_data);  </div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span> </div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Inorder sequence is : &quot;</span>;</div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>        operations_on_datastructures::inorder_traversal_of_bst::printInorder(</div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>            root);  </div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span> </div>
+<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>        <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
+<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>            *inorderSuccessor = operations_on_datastructures::</div>
+<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>                inorder_traversal_of_bst::getInorderSuccessor(</div>
+<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>                    root, 90);  </div>
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span> </div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>        assert(inorderSuccessor-&gt;<a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a> == expectedOutput);</div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span> </div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>        operations_on_datastructures::inorder_traversal_of_bst::deallocate(</div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>            root);  </div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span> </div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 3 PASS!&quot;</span>);</div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>    }</div>
+</div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>};</div>
+</div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span> </div>
+<div class="foldopen" id="foldopen00387" data-start="{" data-end="}">
+<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"><a class="line" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  387</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>    <a class="code hl_class" href="../../d5/d58/class_test_cases.html">TestCases</a> tc;</div>
+<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>    tc.<a class="code hl_function" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a>();</div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>}</div>
+</div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span> </div>
+<div class="foldopen" id="foldopen00398" data-start="{" data-end="}">
+<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"><a class="line" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">  398</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[]) {</div>
+<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>    <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span> </div>
+<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>    <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a> *root =</div>
+<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>        <span class="keyword">nullptr</span>;  </div>
+<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>    std::vector&lt;int64_t&gt; node_data{3,  4, 5,</div>
+<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>                                   89, 1, 2};  </div>
+<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span> </div>
+<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>    int64_t targetElement = 4;  </div>
+<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>    root = operations_on_datastructures::inorder_traversal_of_bst::makeBST(</div>
+<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>        root, node_data);  </div>
+<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span> </div>
+<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>    <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>        *inorderSuccessor = operations_on_datastructures::</div>
+<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>            inorder_traversal_of_bst::getInorderSuccessor(root, targetElement);</div>
+<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span> </div>
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;In-order sequence is : &quot;</span>;</div>
+<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>    operations_on_datastructures::inorder_traversal_of_bst::printInorder(root);</div>
+<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span> </div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>    <span class="keywordflow">if</span> (inorderSuccessor == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Inorder successor for last node is NULL&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Target element is : &quot;</span> &lt;&lt; targetElement &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Inorder successor for target element is : &quot;</span></div>
+<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>                  &lt;&lt; inorderSuccessor-&gt;<a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span>    }</div>
+<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span> </div>
+<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span>    deallocate(root);  </div>
+<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span> </div>
+<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span>}</div>
+</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="aclass_test_cases_html"><div class="ttname"><a href="../../d5/d58/class_test_cases.html">TestCases</a></div><div class="ttdoc">class encapsulating the necessary test cases</div><div class="ttdef"><b>Definition</b> <a href="#l00225">inorder_successor_of_bst.cpp:225</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_aa3aa3d5bf666f327ee8e2d11d397b06e"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">TestCases::log</a></div><div class="ttdeci">void log(T msg)</div><div class="ttdoc">A function to print given message on console.</div><div class="ttdef"><b>Definition</b> <a href="#l00233">inorder_successor_of_bst.cpp:233</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_abae0148985f159b582a385cf399254e3"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">TestCases::testCase_2</a></div><div class="ttdeci">void testCase_2()</div><div class="ttdoc">A test case which contains main list of 100 elements and sublist of 20.</div><div class="ttdef"><b>Definition</b> <a href="#l00304">inorder_successor_of_bst.cpp:304</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_ac2636e8b5b9e053374c45bfcf0603008"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">TestCases::testCase_1</a></div><div class="ttdeci">void testCase_1()</div><div class="ttdoc">A test case contains edge case, printing inorder successor of last node.</div><div class="ttdef"><b>Definition</b> <a href="#l00259">inorder_successor_of_bst.cpp:259</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_ad9f95c09931625b41e3be1f88d1e28c5"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">TestCases::testCase_3</a></div><div class="ttdeci">void testCase_3()</div><div class="ttdoc">A test case which contains main list of 50 elements and sublist of 20.</div><div class="ttdef"><b>Definition</b> <a href="#l00345">inorder_successor_of_bst.cpp:345</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_aeabea90c02f9159e4a784bbf736e1e23"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">TestCases::runTests</a></div><div class="ttdeci">void runTests()</div><div class="ttdoc">Executes test cases.</div><div class="ttdef"><b>Definition</b> <a href="#l00243">inorder_successor_of_bst.cpp:243</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div><div class="ttdoc">A Node structure representing a single node in BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00056">inorder_successor_of_bst.cpp:56</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html_a9b4ae6f5179a1c8ecfd563811a59e6c0"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0">operations_on_datastructures::inorder_traversal_of_bst::Node::right</a></div><div class="ttdeci">Node * right</div><div class="ttdoc">Pointer to right child.</div><div class="ttdef"><b>Definition</b> <a href="#l00060">inorder_successor_of_bst.cpp:60</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html_a9ccef4c746b7226488b014f5bac4789a"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9ccef4c746b7226488b014f5bac4789a">operations_on_datastructures::inorder_traversal_of_bst::Node::left</a></div><div class="ttdeci">Node * left</div><div class="ttdoc">Pointer to Left child.</div><div class="ttdef"><b>Definition</b> <a href="#l00059">inorder_successor_of_bst.cpp:59</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html_ae161f3e5ef33ade73429cab9291612e2"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">operations_on_datastructures::inorder_traversal_of_bst::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The key/value of the node.</div><div class="ttdef"><b>Definition</b> <a href="#l00058">inorder_successor_of_bst.cpp:58</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a05fe8a029e155c43e4efa598d4d089d9"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a></div><div class="ttdeci">Node * makeBST(Node *root, const std::vector&lt; int64_t &gt; &amp;data)</div><div class="ttdoc">This function is used in test cases to quickly create BST containing large data instead of hard codin...</div><div class="ttdef"><b>Definition</b> <a href="#l00155">inorder_successor_of_bst.cpp:155</a></div></div>
+<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a3923fb22b46e085376703cae0b44d690"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a3923fb22b46e085376703cae0b44d690">operations_on_datastructures::inorder_traversal_of_bst::getInorderSuccessor</a></div><div class="ttdeci">Node * getInorderSuccessor(Node *root, int64_t data)</div><div class="ttdoc">Inorder successor of a node is the next node in inorder traversal of the Binary Tree....</div><div class="ttdef"><b>Definition</b> <a href="#l00176">inorder_successor_of_bst.cpp:176</a></div></div>
+<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a5d7266b934ca50c4f53e4f1e725d89a4"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a></div><div class="ttdeci">void printInorder(Node *root)</div><div class="ttdoc">Prints the BST in inorder traversal using recursion.</div><div class="ttdef"><b>Definition</b> <a href="#l00136">inorder_successor_of_bst.cpp:136</a></div></div>
+<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a72483e3f6933e004a8d86371e8a990db"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db">operations_on_datastructures::inorder_traversal_of_bst::findMinNode</a></div><div class="ttdeci">Node * findMinNode(Node *root)</div><div class="ttdoc">Finds and return the minimum node in BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00121">inorder_successor_of_bst.cpp:121</a></div></div>
+<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a7b20eb99272665c1777949e26ab59589"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a></div><div class="ttdeci">void deallocate(Node *rootNode)</div><div class="ttdoc">This function clears the memory allocated to entire tree recursively. Its just for clean up the memor...</div><div class="ttdef"><b>Definition</b> <a href="#l00210">inorder_successor_of_bst.cpp:210</a></div></div>
+<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a7f6f73a33beec448c27cc1d70b220702"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7f6f73a33beec448c27cc1d70b220702">operations_on_datastructures::inorder_traversal_of_bst::makeNode</a></div><div class="ttdeci">Node * makeNode(int64_t data)</div><div class="ttdoc">Allocates a new node in heap for given data and returns it's pointer.</div><div class="ttdef"><b>Definition</b> <a href="#l00068">inorder_successor_of_bst.cpp:68</a></div></div>
+<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a824cbf1814854824cf05f062eea07b95"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95">operations_on_datastructures::inorder_traversal_of_bst::getNode</a></div><div class="ttdeci">Node * getNode(Node *root, int64_t data)</div><div class="ttdoc">Searches the given data in BST and returns the pointer to the node containing that data.</div><div class="ttdef"><b>Definition</b> <a href="#l00100">inorder_successor_of_bst.cpp:100</a></div></div>
+<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_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> <a href="#l00387">inorder_successor_of_bst.cpp:387</a></div></div>
+<div class="ttc" id="anamespaceoperations__on__datastructures_html"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></div><div class="ttdoc">for std::vector</div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp.html">inorder_successor_of_bst.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d38/namespacecount__bits__flip.html b/d4/d38/namespacecount__bits__flip.html
index e8721fb7c..ff6028c75 100644
--- a/d4/d38/namespacecount__bits__flip.html
+++ b/d4/d38/namespacecount__bits__flip.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: count_bits_flip Namespace Reference</title>
+<title>TheAlgorithms/C++: count_bits_flip Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d4/d38/power__of__two_8cpp.html b/d4/d38/power__of__two_8cpp.html
index 01d3e3ca5..6beacf50a 100644
--- a/d4/d38/power__of__two_8cpp.html
+++ b/d4/d38/power__of__two_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/power_of_two.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/power_of_two.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for power_of_two.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/dad/power__of__two_8cpp__incl.svg" width="172" height="111"><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">
+</div>
+<p><a href="../../d4/d38/power__of__two_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -152,6 +171,8 @@ Algorithm</h3>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/neha-hasija17" target="_blank">Neha Hasija</a> </dd>
 <dd>
 <a href="https://github.com/Rijul24" target="_blank">Rijul.S</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d38/power__of__two_8cpp_source.html">power_of_two.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -170,6 +191,8 @@ Algorithm</h3>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d38/power__of__two_8cpp_source.html#l00099">99</a> of file <a class="el" href="../../d4/d38/power__of__two_8cpp_source.html">power_of_two.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   99</span>           {</div>
 <div class="line"><span class="lineno">  100</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  101</span> </div>
@@ -178,13 +201,8 @@ Algorithm</h3>
 <div class="line"><span class="lineno">  104</span> </div>
 <div class="line"><span class="lineno">  105</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  106</span>}</div>
-<div class="ttc" id="apower__of__two_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> power_of_two.cpp:59</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d38/power__of__two_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="339" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="apower__of__two_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d38/power__of__two_8cpp_source.html#l00059">power_of_two.cpp:59</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -212,29 +230,25 @@ 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">   59</span>                   {</div>
-<div class="line"><span class="lineno">   60</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;First case testing... \n&quot;</span>; <span class="comment">// for n = 32 return 1</span></div>
-<div class="line"><span class="lineno">   61</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb">math::power_of_two</a>(32) == 1);</div>
-<div class="line"><span class="lineno">   62</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPassed!\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   63</span> </div>
-<div class="line"><span class="lineno">   64</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Second case testing... \n&quot;</span>; <span class="comment">// for n = 5 return 0</span></div>
-<div class="line"><span class="lineno">   65</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb">math::power_of_two</a>(5) == 0);</div>
-<div class="line"><span class="lineno">   66</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPassed!\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   67</span> </div>
-<div class="line"><span class="lineno">   68</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Third case testing... \n&quot;</span>; <span class="comment">// for n = 232 return 0</span></div>
-<div class="line"><span class="lineno">   69</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb">math::power_of_two</a>(232) == 0);</div>
-<div class="line"><span class="lineno">   70</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPassed!\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   71</span> </div>
-<div class="line"><span class="lineno">   72</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nAll test cases have successfully passed!\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   73</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="anamespacemath_html_a8a48be4d7f14e34c5c92925bc1cbf3bb"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb">math::power_of_two</a></div><div class="ttdeci">int power_of_two(int n)</div><div class="ttdoc">This function finds whether a number is power of 2 or not.</div><div class="ttdef"><b>Definition</b> power_of_two.cpp:42</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d38/power__of__two_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="242" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d38/power__of__two_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d4/d38/power__of__two_8cpp_source.html">power_of_two.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   59</span>                   {</div>
+<div class="line"><span class="lineno">   60</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;First case testing... \n&quot;</span>; <span class="comment">// for n = 32 return 1</span></div>
+<div class="line"><span class="lineno">   61</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb">math::power_of_two</a>(32) == 1);</div>
+<div class="line"><span class="lineno">   62</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   63</span> </div>
+<div class="line"><span class="lineno">   64</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Second case testing... \n&quot;</span>; <span class="comment">// for n = 5 return 0</span></div>
+<div class="line"><span class="lineno">   65</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb">math::power_of_two</a>(5) == 0);</div>
+<div class="line"><span class="lineno">   66</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   67</span> </div>
+<div class="line"><span class="lineno">   68</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Third case testing... \n&quot;</span>; <span class="comment">// for n = 232 return 0</span></div>
+<div class="line"><span class="lineno">   69</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb">math::power_of_two</a>(232) == 0);</div>
+<div class="line"><span class="lineno">   70</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   71</span> </div>
+<div class="line"><span class="lineno">   72</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nAll test cases have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   73</span>}</div>
+<div class="ttc" id="anamespacemath_html_a8a48be4d7f14e34c5c92925bc1cbf3bb"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb">math::power_of_two</a></div><div class="ttdeci">int power_of_two(int n)</div><div class="ttdoc">This function finds whether a number is power of 2 or not.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d38/power__of__two_8cpp_source.html#l00042">power_of_two.cpp:42</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="adfd6be45be425ae28c62ce3bfb4b40dc" name="adfd6be45be425ae28c62ce3bfb4b40dc"></a>
@@ -260,30 +274,24 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d38/power__of__two_8cpp_source.html#l00079">79</a> of file <a class="el" href="../../d4/d38/power__of__two_8cpp_source.html">power_of_two.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   79</span>                       {</div>
 <div class="line"><span class="lineno">   80</span>    <span class="keywordtype">int</span> n = 0; <span class="comment">// input from user</span></div>
 <div class="line"><span class="lineno">   81</span>    </div>
-<div class="line"><span class="lineno">   82</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter a number &quot;</span> &lt;&lt; <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">   83</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n; </div>
-<div class="line"><span class="lineno">   84</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   85</span><span class="comment">    /// function call with @param n</span></div>
-<div class="line"><span class="lineno">   86</span><span class="comment"></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb">math::power_of_two</a>(n);</div>
+<div class="line"><span class="lineno">   82</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter a number &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   83</span>    std::cin &gt;&gt; n; </div>
+<div class="line"><span class="lineno">   84</span> </div>
+<div class="line"><span class="lineno">   86</span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb">math::power_of_two</a>(n);</div>
 <div class="line"><span class="lineno">   87</span>    <span class="keywordflow">if</span> (result == 1) {</div>
-<div class="line"><span class="lineno">   88</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Yes, the number &quot;</span> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is a power of 2\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   88</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Yes, the number &quot;</span> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is a power of 2\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   89</span>    }</div>
 <div class="line"><span class="lineno">   90</span>    <span class="keywordflow">else</span> { </div>
-<div class="line"><span class="lineno">   91</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;No, the number &quot;</span> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is not a power of 2\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   91</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;No, the number &quot;</span> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is not a power of 2\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   92</span>    }</div>
 <div class="line"><span class="lineno">   93</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></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="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d38/power__of__two_8cpp_adfd6be45be425ae28c62ce3bfb4b40dc_cgraph.svg" width="308" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/d38/power__of__two_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d4/d38/power__of__two_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index ea89f8db9..000000000
--- a/d4/d38/power__of__two_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="$dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb" title="This function finds whether a number is power of 2 or not." alt="" coords="97,5,236,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/d4/d38/power__of__two_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d4/d38/power__of__two_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 66488a06d..000000000
--- a/d4/d38/power__of__two_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9e0c6287dfc04a3d264ecab862a00cbc
\ No newline at end of file
diff --git a/d4/d38/power__of__two_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d4/d38/power__of__two_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index d52a3d524..000000000
--- a/d4/d38/power__of__two_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="181pt" height="27pt"
- viewBox="0.00 0.00 181.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb" target="_top" xlink:title="This function finds whether a number is power of 2 or not.">
-<polygon fill="white" stroke="#666666" points="173,-19.25 68.5,-19.25 68.5,0 173,0 173,-19.25"/>
-<text text-anchor="middle" x="120.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::power_of_two</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.82,-9.62C39.59,-9.62 48.01,-9.62 56.93,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.89,-13.13 66.89,-9.63 56.89,-6.13 56.89,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d38/power__of__two_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d4/d38/power__of__two_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 4b584f339..000000000
--- a/d4/d38/power__of__two_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="181pt" height="27pt"
- viewBox="0.00 0.00 181.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb" target="_top" xlink:title="This function finds whether a number is power of 2 or not.">
-<polygon fill="white" stroke="#666666" points="173,-19.25 68.5,-19.25 68.5,0 173,0 173,-19.25"/>
-<text text-anchor="middle" x="120.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::power_of_two</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.82,-9.62C39.59,-9.62 48.01,-9.62 56.93,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.89,-13.13 66.89,-9.63 56.89,-6.13 56.89,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d38/power__of__two_8cpp_adfd6be45be425ae28c62ce3bfb4b40dc_cgraph.map b/d4/d38/power__of__two_8cpp_adfd6be45be425ae28c62ce3bfb4b40dc_cgraph.map
deleted file mode 100644
index cd5290687..000000000
--- a/d4/d38/power__of__two_8cpp_adfd6be45be425ae28c62ce3bfb4b40dc_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="user_input_test" name="user_input_test">
-<area shape="rect" id="Node000001" title="Take user input in the test cases (optional; currently commented)" alt="" coords="5,31,116,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="198,5,269,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="116,33,182,23,183,28,117,38"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb" title="This function finds whether a number is power of 2 or not." alt="" coords="164,55,303,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="117,49,149,53,148,58,116,54"/>
-</map>
diff --git a/d4/d38/power__of__two_8cpp_adfd6be45be425ae28c62ce3bfb4b40dc_cgraph.md5 b/d4/d38/power__of__two_8cpp_adfd6be45be425ae28c62ce3bfb4b40dc_cgraph.md5
deleted file mode 100644
index f00e914fb..000000000
--- a/d4/d38/power__of__two_8cpp_adfd6be45be425ae28c62ce3bfb4b40dc_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ce5c82b2c062e5826817ab13036bd207
\ No newline at end of file
diff --git a/d4/d38/power__of__two_8cpp_adfd6be45be425ae28c62ce3bfb4b40dc_cgraph.svg b/d4/d38/power__of__two_8cpp_adfd6be45be425ae28c62ce3bfb4b40dc_cgraph.svg
deleted file mode 100644
index e97b1a99a..000000000
--- a/d4/d38/power__of__two_8cpp_adfd6be45be425ae28c62ce3bfb4b40dc_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: user_input_test Pages: 1 -->
-<svg width="231pt" height="64pt"
- viewBox="0.00 0.00 231.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>user_input_test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Take user input in the test cases (optional; currently commented)">
-<polygon fill="#999999" stroke="#666666" points="82.75,-37.25 0,-37.25 0,-18 82.75,-18 82.75,-37.25"/>
-<text text-anchor="middle" x="41.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">user_input_test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.75,-56.25 144.25,-56.25 144.25,-37 197.75,-37 197.75,-56.25"/>
-<text text-anchor="middle" x="171" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.11,-33.69C99.04,-36.06 117.18,-38.76 132.76,-41.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.18,-44.53 142.59,-42.54 133.21,-37.61 132.18,-44.53"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb" target="_top" xlink:title="This function finds whether a number is power of 2 or not.">
-<polygon fill="white" stroke="#666666" points="223.25,-19.25 118.75,-19.25 118.75,0 223.25,0 223.25,-19.25"/>
-<text text-anchor="middle" x="171" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::power_of_two</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.11,-21.88C90.83,-20.79 99.08,-19.63 107.3,-18.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="107.53,-21.97 116.94,-17.11 106.55,-15.04 107.53,-21.97"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d38/power__of__two_8cpp_adfd6be45be425ae28c62ce3bfb4b40dc_cgraph_org.svg b/d4/d38/power__of__two_8cpp_adfd6be45be425ae28c62ce3bfb4b40dc_cgraph_org.svg
deleted file mode 100644
index daf583b35..000000000
--- a/d4/d38/power__of__two_8cpp_adfd6be45be425ae28c62ce3bfb4b40dc_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: user_input_test Pages: 1 -->
-<svg width="231pt" height="64pt"
- viewBox="0.00 0.00 231.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>user_input_test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Take user input in the test cases (optional; currently commented)">
-<polygon fill="#999999" stroke="#666666" points="82.75,-37.25 0,-37.25 0,-18 82.75,-18 82.75,-37.25"/>
-<text text-anchor="middle" x="41.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">user_input_test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.75,-56.25 144.25,-56.25 144.25,-37 197.75,-37 197.75,-56.25"/>
-<text text-anchor="middle" x="171" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.11,-33.69C99.04,-36.06 117.18,-38.76 132.76,-41.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.18,-44.53 142.59,-42.54 133.21,-37.61 132.18,-44.53"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb" target="_top" xlink:title="This function finds whether a number is power of 2 or not.">
-<polygon fill="white" stroke="#666666" points="223.25,-19.25 118.75,-19.25 118.75,0 223.25,0 223.25,-19.25"/>
-<text text-anchor="middle" x="171" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::power_of_two</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.11,-21.88C90.83,-20.79 99.08,-19.63 107.3,-18.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="107.53,-21.97 116.94,-17.11 106.55,-15.04 107.53,-21.97"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d38/power__of__two_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d38/power__of__two_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 6092e5d4a..000000000
--- a/d4/d38/power__of__two_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb" title="This function finds whether a number is power of 2 or not." alt="" coords="194,5,333,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,179,16,179,21,146,21"/>
-</map>
diff --git a/d4/d38/power__of__two_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d38/power__of__two_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index bc0a82a28..000000000
--- a/d4/d38/power__of__two_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-784dd962094c563d6a84f25a43168cb0
\ No newline at end of file
diff --git a/d4/d38/power__of__two_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d38/power__of__two_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index cbe569e2c..000000000
--- a/d4/d38/power__of__two_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="254pt" height="27pt"
- viewBox="0.00 0.00 254.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb" target="_top" xlink:title="This function finds whether a number is power of 2 or not.">
-<polygon fill="white" stroke="#666666" points="246,-19.25 141.5,-19.25 141.5,0 246,0 246,-19.25"/>
-<text text-anchor="middle" x="193.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::power_of_two</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.82,-9.62C112.59,-9.62 121.01,-9.62 129.93,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.89,-13.13 139.89,-9.63 129.89,-6.13 129.89,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d38/power__of__two_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/d38/power__of__two_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 3458d7ec4..000000000
--- a/d4/d38/power__of__two_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="254pt" height="27pt"
- viewBox="0.00 0.00 254.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb" target="_top" xlink:title="This function finds whether a number is power of 2 or not.">
-<polygon fill="white" stroke="#666666" points="246,-19.25 141.5,-19.25 141.5,0 246,0 246,-19.25"/>
-<text text-anchor="middle" x="193.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::power_of_two</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.82,-9.62C112.59,-9.62 121.01,-9.62 129.93,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.89,-13.13 139.89,-9.63 129.89,-6.13 129.89,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d38/power__of__two_8cpp_source.html b/d4/d38/power__of__two_8cpp_source.html
new file mode 100644
index 000000000..8e639f947
--- /dev/null
+++ b/d4/d38/power__of__two_8cpp_source.html
@@ -0,0 +1,206 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/power_of_two.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d38/power__of__two_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">power_of_two.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/d38/power__of__two_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="foldopen" id="foldopen00042" data-start="{" data-end="}">
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb">   42</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb">power_of_two</a>(<span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordtype">int</span> result = n &amp; (n - 1);</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">if</span> (result == 0) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="keywordflow">return</span> 1;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>}</div>
+</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="foldopen" id="foldopen00059" data-start="{" data-end="}">
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   59</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;First case testing... \n&quot;</span>; <span class="comment">// for n = 32 return 1</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb">math::power_of_two</a>(32) == 1);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed!\n&quot;</span>;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Second case testing... \n&quot;</span>; <span class="comment">// for n = 5 return 0</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb">math::power_of_two</a>(5) == 0);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed!\n&quot;</span>;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Third case testing... \n&quot;</span>; <span class="comment">// for n = 232 return 0</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb">math::power_of_two</a>(232) == 0);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed!\n&quot;</span>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nAll test cases have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>}</div>
+</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="foldopen" id="foldopen00079" data-start="{" data-end="}">
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="../../d4/d38/power__of__two_8cpp.html#adfd6be45be425ae28c62ce3bfb4b40dc">   79</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d38/power__of__two_8cpp.html#adfd6be45be425ae28c62ce3bfb4b40dc">user_input_test</a>() {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordtype">int</span> n = 0; <span class="comment">// input from user</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter a number &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    std::cin &gt;&gt; n; </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordtype">int</span> result = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb">math::power_of_two</a>(n);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="keywordflow">if</span> (result == 1) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Yes, the number &quot;</span> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is a power of 2\n&quot;</span>;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="keywordflow">else</span> { </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;No, the number &quot;</span> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is not a power of 2\n&quot;</span>;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    }</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>}</div>
+</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="foldopen" id="foldopen00099" data-start="{" data-end="}">
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"><a class="line" href="../../d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   99</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <a class="code hl_function" href="../../d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="comment">// uncomment the line below to take user inputs</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="comment">//user_input_test();</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>}</div>
+</div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_a8a48be4d7f14e34c5c92925bc1cbf3bb"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb">math::power_of_two</a></div><div class="ttdeci">int power_of_two(int n)</div><div class="ttdoc">This function finds whether a number is power of 2 or not.</div><div class="ttdef"><b>Definition</b> <a href="#l00042">power_of_two.cpp:42</a></div></div>
+<div class="ttc" id="apower__of__two_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/d38/power__of__two_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> <a href="#l00059">power_of_two.cpp:59</a></div></div>
+<div class="ttc" id="apower__of__two_8cpp_html_adfd6be45be425ae28c62ce3bfb4b40dc"><div class="ttname"><a href="../../d4/d38/power__of__two_8cpp.html#adfd6be45be425ae28c62ce3bfb4b40dc">user_input_test</a></div><div class="ttdeci">void user_input_test()</div><div class="ttdoc">Take user input in the test cases (optional; currently commented)</div><div class="ttdef"><b>Definition</b> <a href="#l00079">power_of_two.cpp:79</a></div></div>
+<div class="ttc" id="apower__of__two_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00099">power_of_two.cpp:99</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d4/d38/power__of__two_8cpp.html">power_of_two.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d39/group__open__addressing.html b/d4/d39/group__open__addressing.html
index 93209e998..f6c356700 100644
--- a/d4/d39/group__open__addressing.html
+++ b/d4/d39/group__open__addressing.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Open Addressing</title>
+<title>TheAlgorithms/C++: Open Addressing</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d4/d3e/k__nearest__neighbors_8cpp.html b/d4/d3e/k__nearest__neighbors_8cpp.html
index 41ef96e78..2bdeb8e56 100644
--- a/d4/d3e/k__nearest__neighbors_8cpp.html
+++ b/d4/d3e/k__nearest__neighbors_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: machine_learning/k_nearest_neighbors.cpp File Reference</title>
+<title>TheAlgorithms/C++: machine_learning/k_nearest_neighbors.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -126,7 +143,9 @@ Include dependency graph for k_nearest_neighbors.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/dbb/k__nearest__neighbors_8cpp__incl.svg" width="658" height="126"><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">
+</div>
+<p><a href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a></td></tr>
@@ -145,7 +164,7 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ad6ae16e50bb153ebaa7251d0aaa97b69" id="r_ad6ae16e50bb153ebaa7251d0aaa97b69"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ad6ae16e50bb153ebaa7251d0aaa97b69"><td class="memTemplItemLeft" align="right" valign="top">double&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ad6ae16e50bb153ebaa7251d0aaa97b69">machine_learning::k_nearest_neighbors::euclidean_distance</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;a, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;b)</td></tr>
+<tr class="memitem:ad6ae16e50bb153ebaa7251d0aaa97b69"><td class="memTemplItemLeft" align="right" valign="top">double&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ad6ae16e50bb153ebaa7251d0aaa97b69">machine_learning::k_nearest_neighbors::euclidean_distance</a> (const std::vector&lt; T &gt; &amp;a, const std::vector&lt; T &gt; &amp;b)</td></tr>
 <tr class="memdesc:ad6ae16e50bb153ebaa7251d0aaa97b69"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute the Euclidean distance between two vectors.  <br /></td></tr>
 <tr class="separator:ad6ae16e50bb153ebaa7251d0aaa97b69"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -159,6 +178,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Implementation of [K-Nearest Neighbors algorithm] (<a href="https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm">https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm</a>). </p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/luizcarloscf" target="_blank">Luiz Carlos Cosmi Filho</a></dd></dl>
 <p>K-nearest neighbors algorithm, also known as KNN or k-NN, is a supervised learning classifier, which uses proximity to make classifications. This implementantion uses the Euclidean Distance as distance metric to find the K-nearest neighbors. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html">k_nearest_neighbors.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ad6ae16e50bb153ebaa7251d0aaa97b69" name="ad6ae16e50bb153ebaa7251d0aaa97b69"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ad6ae16e50bb153ebaa7251d0aaa97b69">&#9670;&#160;</a></span>euclidean_distance()</h2>
@@ -171,12 +192,12 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">double machine_learning::k_nearest_neighbors::euclidean_distance </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>b</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>b</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -196,27 +217,16 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>double scalar representing the Euclidean distance between provided vectors </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   43</span>                                                                        {</div>
-<div class="line"><span class="lineno">   44</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> aux;</div>
-<div class="line"><span class="lineno">   45</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/transform.html">std::transform</a>(a.begin(), a.end(), b.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/back_inserter.html">std::back_inserter</a>(aux),</div>
-<div class="line"><span class="lineno">   46</span>                   [](T x1, T x2) { return std::pow((x1 - x2), 2); });</div>
-<div class="line"><span class="lineno">   47</span>    aux.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html">shrink_to_fit</a>();</div>
-<div class="line"><span class="lineno">   48</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html">std::accumulate</a>(aux.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), aux.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>(), 0.0));</div>
-<div class="line"><span class="lineno">   49</span>}</div>
-<div class="ttc" id="aaccumulate_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html">std::accumulate</a></div><div class="ttdeci">T accumulate(T... args)</div></div>
-<div class="ttc" id="aback_inserter_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/back_inserter.html">std::back_inserter</a></div><div class="ttdeci">T back_inserter(T... args)</div></div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="ashrink_to_fit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html">std::vector::shrink_to_fit</a></div><div class="ttdeci">T shrink_to_fit(T... args)</div></div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
-<div class="ttc" id="atransform_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/transform.html">std::transform</a></div><div class="ttdeci">T transform(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph.svg" width="328" height="348"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html#l00043">43</a> of file <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html">k_nearest_neighbors.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   43</span>                                                                        {</div>
+<div class="line"><span class="lineno">   44</span>    std::vector&lt;double&gt; aux;</div>
+<div class="line"><span class="lineno">   45</span>    std::transform(a.begin(), a.end(), b.begin(), std::back_inserter(aux),</div>
+<div class="line"><span class="lineno">   46</span>                   [](T x1, T x2) { return std::pow((x1 - x2), 2); });</div>
+<div class="line"><span class="lineno">   47</span>    aux.shrink_to_fit();</div>
+<div class="line"><span class="lineno">   48</span>    <span class="keywordflow">return</span> std::sqrt(std::accumulate(aux.begin(), aux.end(), 0.0));</div>
+<div class="line"><span class="lineno">   49</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
@@ -247,17 +257,14 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>int 0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html#l00193">193</a> of file <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html">k_nearest_neighbors.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  193</span>                                 {</div>
 <div class="line"><span class="lineno">  194</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  195</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  196</span>}</div>
-<div class="ttc" id="ak__nearest__neighbors_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> k_nearest_neighbors.cpp:140</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ak__nearest__neighbors_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html#l00140">k_nearest_neighbors.cpp:140</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -285,61 +292,56 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html#l00140">140</a> of file <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html">k_nearest_neighbors.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  140</span>                   {</div>
-<div class="line"><span class="lineno">  141</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;------- Test 1 -------&quot;</span> &lt;&lt; <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">  142</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;double&gt;</a>&gt; X1 = {{0.0, 0.0}, {0.25, 0.25},</div>
+<div class="line"><span class="lineno">  141</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 1 -------&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  142</span>    std::vector&lt;std::vector&lt;double&gt;&gt; X1 = {{0.0, 0.0}, {0.25, 0.25},</div>
 <div class="line"><span class="lineno">  143</span>                                           {0.0, 0.5}, {0.5, 0.5},</div>
 <div class="line"><span class="lineno">  144</span>                                           {1.0, 0.5}, {1.0, 1.0}};</div>
-<div class="line"><span class="lineno">  145</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> Y1 = {1, 1, 1, 1, 2, 2};</div>
+<div class="line"><span class="lineno">  145</span>    std::vector&lt;int&gt; Y1 = {1, 1, 1, 1, 2, 2};</div>
 <div class="line"><span class="lineno">  146</span>    <span class="keyword">auto</span> model1 = <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a>(X1, Y1);</div>
-<div class="line"><span class="lineno">  147</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample1 = {1.2, 1.2};</div>
-<div class="line"><span class="lineno">  148</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample2 = {0.1, 0.1};</div>
-<div class="line"><span class="lineno">  149</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample3 = {0.1, 0.5};</div>
-<div class="line"><span class="lineno">  150</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample4 = {1.0, 0.75};</div>
+<div class="line"><span class="lineno">  147</span>    std::vector&lt;double&gt; sample1 = {1.2, 1.2};</div>
+<div class="line"><span class="lineno">  148</span>    std::vector&lt;double&gt; sample2 = {0.1, 0.1};</div>
+<div class="line"><span class="lineno">  149</span>    std::vector&lt;double&gt; sample3 = {0.1, 0.5};</div>
+<div class="line"><span class="lineno">  150</span>    std::vector&lt;double&gt; sample4 = {1.0, 0.75};</div>
 <div class="line"><span class="lineno">  151</span>    assert(model1.predict(sample1, 2) == 2);</div>
 <div class="line"><span class="lineno">  152</span>    assert(model1.predict(sample2, 2) == 1);</div>
 <div class="line"><span class="lineno">  153</span>    assert(model1.predict(sample3, 2) == 1);</div>
 <div class="line"><span class="lineno">  154</span>    assert(model1.predict(sample4, 2) == 2);</div>
-<div class="line"><span class="lineno">  155</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;... Passed&quot;</span> &lt;&lt; <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">  156</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;------- Test 2 -------&quot;</span> &lt;&lt; <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">  157</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;double&gt;</a>&gt; X2 = {</div>
+<div class="line"><span class="lineno">  155</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;... Passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  156</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 2 -------&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  157</span>    std::vector&lt;std::vector&lt;double&gt;&gt; X2 = {</div>
 <div class="line"><span class="lineno">  158</span>        {0.0, 0.0, 0.0}, {0.25, 0.25, 0.0}, {0.0, 0.5, 0.0}, {0.5, 0.5, 0.0},</div>
 <div class="line"><span class="lineno">  159</span>        {1.0, 0.5, 0.0}, {1.0, 1.0, 0.0},   {1.0, 1.0, 1.0}, {1.5, 1.5, 1.0}};</div>
-<div class="line"><span class="lineno">  160</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> Y2 = {1, 1, 1, 1, 2, 2, 3, 3};</div>
+<div class="line"><span class="lineno">  160</span>    std::vector&lt;int&gt; Y2 = {1, 1, 1, 1, 2, 2, 3, 3};</div>
 <div class="line"><span class="lineno">  161</span>    <span class="keyword">auto</span> model2 = <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a>(X2, Y2);</div>
-<div class="line"><span class="lineno">  162</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample5 = {1.2, 1.2, 0.0};</div>
-<div class="line"><span class="lineno">  163</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample6 = {0.1, 0.1, 0.0};</div>
-<div class="line"><span class="lineno">  164</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample7 = {0.1, 0.5, 0.0};</div>
-<div class="line"><span class="lineno">  165</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample8 = {1.0, 0.75, 1.0};</div>
+<div class="line"><span class="lineno">  162</span>    std::vector&lt;double&gt; sample5 = {1.2, 1.2, 0.0};</div>
+<div class="line"><span class="lineno">  163</span>    std::vector&lt;double&gt; sample6 = {0.1, 0.1, 0.0};</div>
+<div class="line"><span class="lineno">  164</span>    std::vector&lt;double&gt; sample7 = {0.1, 0.5, 0.0};</div>
+<div class="line"><span class="lineno">  165</span>    std::vector&lt;double&gt; sample8 = {1.0, 0.75, 1.0};</div>
 <div class="line"><span class="lineno">  166</span>    assert(model2.predict(sample5, 2) == 2);</div>
 <div class="line"><span class="lineno">  167</span>    assert(model2.predict(sample6, 2) == 1);</div>
 <div class="line"><span class="lineno">  168</span>    assert(model2.predict(sample7, 2) == 1);</div>
 <div class="line"><span class="lineno">  169</span>    assert(model2.predict(sample8, 2) == 3);</div>
-<div class="line"><span class="lineno">  170</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;... Passed&quot;</span> &lt;&lt; <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">  171</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;------- Test 3 -------&quot;</span> &lt;&lt; <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">  172</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;double&gt;</a>&gt; X3 = {{0.0}, {1.0}, {2.0}, {3.0},</div>
+<div class="line"><span class="lineno">  170</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;... Passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  171</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 3 -------&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  172</span>    std::vector&lt;std::vector&lt;double&gt;&gt; X3 = {{0.0}, {1.0}, {2.0}, {3.0},</div>
 <div class="line"><span class="lineno">  173</span>                                           {4.0}, {5.0}, {6.0}, {7.0}};</div>
-<div class="line"><span class="lineno">  174</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> Y3 = {1, 1, 1, 1, 2, 2, 2, 2};</div>
+<div class="line"><span class="lineno">  174</span>    std::vector&lt;int&gt; Y3 = {1, 1, 1, 1, 2, 2, 2, 2};</div>
 <div class="line"><span class="lineno">  175</span>    <span class="keyword">auto</span> model3 = <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a>(X3, Y3);</div>
-<div class="line"><span class="lineno">  176</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample9 = {0.5};</div>
-<div class="line"><span class="lineno">  177</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample10 = {2.9};</div>
-<div class="line"><span class="lineno">  178</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample11 = {5.5};</div>
-<div class="line"><span class="lineno">  179</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> sample12 = {7.5};</div>
+<div class="line"><span class="lineno">  176</span>    std::vector&lt;double&gt; sample9 = {0.5};</div>
+<div class="line"><span class="lineno">  177</span>    std::vector&lt;double&gt; sample10 = {2.9};</div>
+<div class="line"><span class="lineno">  178</span>    std::vector&lt;double&gt; sample11 = {5.5};</div>
+<div class="line"><span class="lineno">  179</span>    std::vector&lt;double&gt; sample12 = {7.5};</div>
 <div class="line"><span class="lineno">  180</span>    assert(model3.predict(sample9, 3) == 1);</div>
 <div class="line"><span class="lineno">  181</span>    assert(model3.predict(sample10, 3) == 1);</div>
 <div class="line"><span class="lineno">  182</span>    assert(model3.predict(sample11, 3) == 2);</div>
 <div class="line"><span class="lineno">  183</span>    assert(model3.predict(sample12, 3) == 2);</div>
-<div class="line"><span class="lineno">  184</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;... Passed&quot;</span> &lt;&lt; <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">  184</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;... Passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  185</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="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a></div><div class="ttdoc">K-Nearest Neighbors (Knn) class using Euclidean distance as distance metric.</div><div class="ttdef"><b>Definition</b> k_nearest_neighbors.cpp:55</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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a></div><div class="ttdoc">K-Nearest Neighbors (Knn) class using Euclidean distance as distance metric.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html#l00055">k_nearest_neighbors.cpp:55</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
deleted file mode 100644
index 3284a08e7..000000000
--- a/d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
deleted file mode 100644
index 37fe5ef8a..000000000
--- a/d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4eaacbc222129bd9ffcb246ff2dd39bc
\ No newline at end of file
diff --git a/d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
deleted file mode 100644
index add459f55..000000000
--- a/d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
deleted file mode 100644
index 05b86e1ce..000000000
--- a/d4/d3e/k__nearest__neighbors_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index e85e01374..000000000
--- a/d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 5901bc148..000000000
--- a/d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-729fb887ee50b6291b0542ba0592a5c7
\ No newline at end of file
diff --git a/d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 2e04695b9..000000000
--- a/d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1813bd719..000000000
--- a/d4/d3e/k__nearest__neighbors_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph.map b/d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph.map
deleted file mode 100644
index 7b6ea9b53..000000000
--- a/d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph.map
+++ /dev/null
@@ -1,18 +0,0 @@
-<map id="machine_learning::k_nearest_neighbors::euclidean_distance" name="machine_learning::k_nearest_neighbors::euclidean_distance">
-<area shape="rect" id="Node000001" title="Compute the Euclidean distance between two vectors." alt="" coords="5,138,148,194"/>
-<area shape="poly" id="edge5_Node000001_Node000001" title=" " alt="" coords="40,138,41,128,47,119,59,114,77,112,96,114,108,121,105,126,94,119,76,117,61,119,51,123,46,130,46,138"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/accumulate.html#" title=" " alt="" coords="202,5,316,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="96,136,138,88,165,62,194,40,201,36,204,40,197,44,169,66,142,92,100,140"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/back_inserter.html#" title=" " alt="" coords="196,55,322,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="117,136,194,89,204,84,207,89,197,94,119,140"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="198,104,320,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="148,144,194,132,195,137,149,149"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="203,153,315,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="148,164,187,164,187,169,148,169"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/shrink_to_fit.html#" title=" " alt="" coords="196,203,322,244"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="149,186,182,197,180,202,148,191"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="224,268,294,294"/>
-<area shape="poly" id="edge7_Node000001_Node000007" title=" " alt="" coords="112,192,152,223,197,253,211,261,209,265,194,258,148,228,109,197"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/transform.html#" title=" " alt="" coords="208,317,310,343"/>
-<area shape="poly" id="edge8_Node000001_Node000008" title=" " alt="" coords="98,193,139,249,167,278,197,304,203,308,200,312,194,308,163,282,135,252,93,196"/>
-</map>
diff --git a/d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph.md5 b/d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph.md5
deleted file mode 100644
index 22331a535..000000000
--- a/d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-344d44295d621c27521bf3756edc7fd0
\ No newline at end of file
diff --git a/d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph.svg b/d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph.svg
deleted file mode 100644
index d7e32e2a2..000000000
--- a/d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph.svg
+++ /dev/null
@@ -1,185 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::k_nearest_neighbors::euclidean_distance Pages: 1 -->
-<svg width="246pt" height="261pt"
- viewBox="0.00 0.00 245.50 261.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 257.25)">
-<title>machine_learning::k_nearest_neighbors::euclidean_distance</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compute the Euclidean distance between two vectors.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-153.5 0,-153.5 0,-111.75 106.75,-111.75 106.75,-153.5"/>
-<text text-anchor="start" x="8" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::k</text>
-<text text-anchor="start" x="8" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">_nearest_neighbors::</text>
-<text text-anchor="middle" x="53.38" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">euclidean_distance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.14,-153.82C25.73,-163.3 34.14,-171.5 53.38,-171.5 64.49,-171.5 71.99,-168.76 75.88,-164.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.18,-165.84 78.24,-155.29 72.4,-164.12 79.18,-165.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-253.25 147.25,-253.25 147.25,-234 233,-234 233,-253.25"/>
-<text text-anchor="middle" x="190.12" y="-239.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::accumulate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.85,-153.68C86.03,-174.41 113.15,-205.78 142.75,-225.62 144.33,-226.68 145.98,-227.69 147.67,-228.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.87,-231.67 156.39,-232.96 148.97,-225.39 145.87,-231.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/back_inserter.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.12,-216.25 143.12,-216.25 143.12,-197 237.12,-197 237.12,-216.25"/>
-<text text-anchor="middle" x="190.12" y="-202.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::back_inserter</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.6,-153.84C101.28,-165.02 122.64,-178.47 142.75,-188.62 145.16,-189.84 147.67,-191.03 150.22,-192.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.82,-195.38 159.39,-196.05 151.54,-188.93 148.82,-195.38"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236,-179.25 144.25,-179.25 144.25,-160 236,-160 236,-179.25"/>
-<text text-anchor="middle" x="190.12" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.25,-147.14C118.64,-150.27 130.61,-153.56 141.77,-156.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.59,-159.93 151.16,-159.2 142.44,-153.18 140.59,-159.93"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.25,-142.25 148,-142.25 148,-123 232.25,-123 232.25,-142.25"/>
-<text text-anchor="middle" x="190.12" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.25,-132.62C116.79,-132.62 126.73,-132.62 136.27,-132.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.14,-136.13 146.14,-132.63 136.14,-129.13 136.14,-136.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.5,-104.88 142.75,-104.88 142.75,-74.38 237.5,-74.38 237.5,-104.88"/>
-<text text-anchor="start" x="150.75" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::shrink</text>
-<text text-anchor="middle" x="190.12" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_to_fit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.25,-115.75C115.25,-113.2 123.55,-110.55 131.65,-107.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.63,-111.33 141.09,-104.95 130.5,-104.66 132.63,-111.33"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.12,-56.25 164.12,-56.25 164.12,-37 216.12,-37 216.12,-56.25"/>
-<text text-anchor="middle" x="190.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M78.69,-111.44C95.8,-97.24 119.68,-78.8 142.75,-65.62 146.18,-63.67 149.85,-61.81 153.57,-60.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.85,-63.33 162.62,-56.13 152.06,-56.91 154.85,-63.33"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/transform.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.5,-19.25 151.75,-19.25 151.75,0 228.5,0 228.5,-19.25"/>
-<text text-anchor="middle" x="190.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::transform</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge8_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M67.53,-111.35C82.97,-87.95 110.58,-50.63 142.75,-27.62 144.11,-26.65 145.53,-25.72 147,-24.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.48,-28.01 155.75,-20.3 145.26,-21.79 148.48,-28.01"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph_org.svg b/d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph_org.svg
deleted file mode 100644
index 72044627b..000000000
--- a/d4/d3e/k__nearest__neighbors_8cpp_ad6ae16e50bb153ebaa7251d0aaa97b69_cgraph_org.svg
+++ /dev/null
@@ -1,159 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::k_nearest_neighbors::euclidean_distance Pages: 1 -->
-<svg width="246pt" height="261pt"
- viewBox="0.00 0.00 245.50 261.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 257.25)">
-<title>machine_learning::k_nearest_neighbors::euclidean_distance</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compute the Euclidean distance between two vectors.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-153.5 0,-153.5 0,-111.75 106.75,-111.75 106.75,-153.5"/>
-<text text-anchor="start" x="8" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::k</text>
-<text text-anchor="start" x="8" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">_nearest_neighbors::</text>
-<text text-anchor="middle" x="53.38" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">euclidean_distance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.14,-153.82C25.73,-163.3 34.14,-171.5 53.38,-171.5 64.49,-171.5 71.99,-168.76 75.88,-164.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.18,-165.84 78.24,-155.29 72.4,-164.12 79.18,-165.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-253.25 147.25,-253.25 147.25,-234 233,-234 233,-253.25"/>
-<text text-anchor="middle" x="190.12" y="-239.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::accumulate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.85,-153.68C86.03,-174.41 113.15,-205.78 142.75,-225.62 144.33,-226.68 145.98,-227.69 147.67,-228.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.87,-231.67 156.39,-232.96 148.97,-225.39 145.87,-231.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/back_inserter.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.12,-216.25 143.12,-216.25 143.12,-197 237.12,-197 237.12,-216.25"/>
-<text text-anchor="middle" x="190.12" y="-202.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::back_inserter</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.6,-153.84C101.28,-165.02 122.64,-178.47 142.75,-188.62 145.16,-189.84 147.67,-191.03 150.22,-192.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.82,-195.38 159.39,-196.05 151.54,-188.93 148.82,-195.38"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236,-179.25 144.25,-179.25 144.25,-160 236,-160 236,-179.25"/>
-<text text-anchor="middle" x="190.12" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.25,-147.14C118.64,-150.27 130.61,-153.56 141.77,-156.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.59,-159.93 151.16,-159.2 142.44,-153.18 140.59,-159.93"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.25,-142.25 148,-142.25 148,-123 232.25,-123 232.25,-142.25"/>
-<text text-anchor="middle" x="190.12" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.25,-132.62C116.79,-132.62 126.73,-132.62 136.27,-132.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.14,-136.13 146.14,-132.63 136.14,-129.13 136.14,-136.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.5,-104.88 142.75,-104.88 142.75,-74.38 237.5,-74.38 237.5,-104.88"/>
-<text text-anchor="start" x="150.75" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::shrink</text>
-<text text-anchor="middle" x="190.12" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_to_fit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.25,-115.75C115.25,-113.2 123.55,-110.55 131.65,-107.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.63,-111.33 141.09,-104.95 130.5,-104.66 132.63,-111.33"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.12,-56.25 164.12,-56.25 164.12,-37 216.12,-37 216.12,-56.25"/>
-<text text-anchor="middle" x="190.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M78.69,-111.44C95.8,-97.24 119.68,-78.8 142.75,-65.62 146.18,-63.67 149.85,-61.81 153.57,-60.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.85,-63.33 162.62,-56.13 152.06,-56.91 154.85,-63.33"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/transform.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.5,-19.25 151.75,-19.25 151.75,0 228.5,0 228.5,-19.25"/>
-<text text-anchor="middle" x="190.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::transform</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge8_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M67.53,-111.35C82.97,-87.95 110.58,-50.63 142.75,-27.62 144.11,-26.65 145.53,-25.72 147,-24.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.48,-28.01 155.75,-20.3 145.26,-21.79 148.48,-28.01"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d3e/k__nearest__neighbors_8cpp_source.html b/d4/d3e/k__nearest__neighbors_8cpp_source.html
new file mode 100644
index 000000000..b4e20300f
--- /dev/null
+++ b/d4/d3e/k__nearest__neighbors_8cpp_source.html
@@ -0,0 +1,289 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: machine_learning/k_nearest_neighbors.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d3e/k__nearest__neighbors_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">k_nearest_neighbors.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/d3e/k__nearest__neighbors_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;algorithm&gt;</span>      </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cassert&gt;</span>        </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cmath&gt;</span>          </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span>       </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;numeric&gt;</span>        </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;unordered_map&gt;</span>  </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;vector&gt;</span>         </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d77/namespacemachine__learning.html">machine_learning</a> {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d4c/namespacek__nearest__neighbors.html">k_nearest_neighbors</a> {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00043" data-start="{" data-end="}">
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="../../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69">   43</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69">euclidean_distance</a>(<span class="keyword">const</span> std::vector&lt;T&gt;&amp; a, <span class="keyword">const</span> std::vector&lt;T&gt;&amp; b) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    std::vector&lt;double&gt; aux;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    std::transform(a.begin(), a.end(), b.begin(), std::back_inserter(aux),</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>                   [](T x1, T x2) { return std::pow((x1 - x2), 2); });</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    aux.shrink_to_fit();</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">return</span> std::sqrt(std::accumulate(aux.begin(), aux.end(), 0.0));</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>}</div>
+</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="foldopen" id="foldopen00055" data-start="{" data-end="};">
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">   55</a></span><span class="keyword">class </span><a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">Knn</a> {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a16ddc13621eec6ac5f83658b3401a581">   57</a></span>    std::vector&lt;std::vector&lt;double&gt;&gt; <a class="code hl_variable" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a16ddc13621eec6ac5f83658b3401a581">X_</a>{};  </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a209383503fb6c03afac405a80bace964">   58</a></span>    std::vector&lt;int&gt; <a class="code hl_variable" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a209383503fb6c03afac405a80bace964">Y_</a>{};                  </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00067" data-start="{" data-end="}">
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200">   67</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200">Knn</a>(std::vector&lt;std::vector&lt;double&gt;&gt;&amp; X, std::vector&lt;int&gt;&amp; Y)</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        : <a class="code hl_variable" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a16ddc13621eec6ac5f83658b3401a581">X_</a>(X), <a class="code hl_variable" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a209383503fb6c03afac405a80bace964">Y_</a>(Y){};</div>
+</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b">   75</a></span>    <a class="code hl_function" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b">Knn</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">Knn</a>&amp; model) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a080f5b1742832a03c1cbba596a48bd1a">   80</a></span>    <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">Knn</a>&amp; <a class="code hl_function" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a080f5b1742832a03c1cbba596a48bd1a">operator=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">Knn</a>&amp; model) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e">   85</a></span>    <a class="code hl_function" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e">Knn</a>(<a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">Knn</a>&amp;&amp;) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#ac06986d5afddc767ddba4da738f75563">   90</a></span>    <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">Knn</a>&amp; <a class="code hl_function" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#ac06986d5afddc767ddba4da738f75563">operator=</a>(<a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">Knn</a>&amp;&amp;) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#afe732a33112b457b738f403622d226e5">   95</a></span>    <a class="code hl_function" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#afe732a33112b457b738f403622d226e5">~Knn</a>() = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="foldopen" id="foldopen00103" data-start="{" data-end="}">
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"><a class="line" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a62e152db014cd4de675fa906e5ef2861">  103</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a62e152db014cd4de675fa906e5ef2861">predict</a>(std::vector&lt;double&gt;&amp; sample, <span class="keywordtype">int</span> k) {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        std::vector&lt;int&gt; neighbors;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        std::vector&lt;std::pair&lt;double, int&gt;&gt; distances;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; this-&gt;<a class="code hl_variable" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a16ddc13621eec6ac5f83658b3401a581">X_</a>.size(); ++i) {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>            <span class="keyword">auto</span> current = this-&gt;<a class="code hl_variable" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a16ddc13621eec6ac5f83658b3401a581">X_</a>.at(i);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>            <span class="keyword">auto</span> label = this-&gt;<a class="code hl_variable" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a209383503fb6c03afac405a80bace964">Y_</a>.at(i);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            <span class="keyword">auto</span> distance = <a class="code hl_function" href="../../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69">euclidean_distance</a>(current, sample);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>            distances.emplace_back(distance, label);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        }</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        std::sort(distances.begin(), distances.end());</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; k; i++) {</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>            <span class="keyword">auto</span> label = distances.at(i).second;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>            neighbors.push_back(label);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        }</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        std::unordered_map&lt;int, int&gt; frequency;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> neighbor : neighbors) {</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>            ++frequency[neighbor];</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        }</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        std::pair&lt;int, int&gt; predicted;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        predicted.first = -1;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        predicted.second = -1;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; kv : frequency) {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>            <span class="keywordflow">if</span> (kv.second &gt; predicted.second) {</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>                predicted.second = kv.second;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>                predicted.first = kv.first;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>            }</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        }</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        <span class="keywordflow">return</span> predicted.first;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    }</div>
+</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>};</div>
+</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>}  <span class="comment">// namespace k_nearest_neighbors</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>}  <span class="comment">// namespace machine_learning</span></div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span> </div>
+<div class="foldopen" id="foldopen00140" data-start="{" data-end="}">
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"><a class="line" href="../../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  140</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 1 -------&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    std::vector&lt;std::vector&lt;double&gt;&gt; X1 = {{0.0, 0.0}, {0.25, 0.25},</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>                                           {0.0, 0.5}, {0.5, 0.5},</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>                                           {1.0, 0.5}, {1.0, 1.0}};</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    std::vector&lt;int&gt; Y1 = {1, 1, 1, 1, 2, 2};</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    <span class="keyword">auto</span> model1 = <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a>(X1, Y1);</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    std::vector&lt;double&gt; sample1 = {1.2, 1.2};</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    std::vector&lt;double&gt; sample2 = {0.1, 0.1};</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    std::vector&lt;double&gt; sample3 = {0.1, 0.5};</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    std::vector&lt;double&gt; sample4 = {1.0, 0.75};</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    assert(model1.predict(sample1, 2) == 2);</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    assert(model1.predict(sample2, 2) == 1);</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    assert(model1.predict(sample3, 2) == 1);</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    assert(model1.predict(sample4, 2) == 2);</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;... Passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 2 -------&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    std::vector&lt;std::vector&lt;double&gt;&gt; X2 = {</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>        {0.0, 0.0, 0.0}, {0.25, 0.25, 0.0}, {0.0, 0.5, 0.0}, {0.5, 0.5, 0.0},</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        {1.0, 0.5, 0.0}, {1.0, 1.0, 0.0},   {1.0, 1.0, 1.0}, {1.5, 1.5, 1.0}};</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    std::vector&lt;int&gt; Y2 = {1, 1, 1, 1, 2, 2, 3, 3};</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    <span class="keyword">auto</span> model2 = <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a>(X2, Y2);</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    std::vector&lt;double&gt; sample5 = {1.2, 1.2, 0.0};</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    std::vector&lt;double&gt; sample6 = {0.1, 0.1, 0.0};</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    std::vector&lt;double&gt; sample7 = {0.1, 0.5, 0.0};</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    std::vector&lt;double&gt; sample8 = {1.0, 0.75, 1.0};</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    assert(model2.predict(sample5, 2) == 2);</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    assert(model2.predict(sample6, 2) == 1);</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    assert(model2.predict(sample7, 2) == 1);</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    assert(model2.predict(sample8, 2) == 3);</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;... Passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 3 -------&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    std::vector&lt;std::vector&lt;double&gt;&gt; X3 = {{0.0}, {1.0}, {2.0}, {3.0},</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>                                           {4.0}, {5.0}, {6.0}, {7.0}};</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    std::vector&lt;int&gt; Y3 = {1, 1, 1, 1, 2, 2, 2, 2};</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    <span class="keyword">auto</span> model3 = <a class="code hl_class" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a>(X3, Y3);</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    std::vector&lt;double&gt; sample9 = {0.5};</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    std::vector&lt;double&gt; sample10 = {2.9};</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    std::vector&lt;double&gt; sample11 = {5.5};</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    std::vector&lt;double&gt; sample12 = {7.5};</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    assert(model3.predict(sample9, 3) == 1);</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    assert(model3.predict(sample10, 3) == 1);</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    assert(model3.predict(sample11, 3) == 2);</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    assert(model3.predict(sample12, 3) == 2);</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;... Passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>}</div>
+</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span> </div>
+<div class="foldopen" id="foldopen00193" data-start="{" data-end="}">
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"><a class="line" href="../../d4/d3e/k__nearest__neighbors_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">  193</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span>* argv[]) {</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    <a class="code hl_function" href="../../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>}</div>
+</div>
+<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">machine_learning::k_nearest_neighbors::Knn</a></div><div class="ttdoc">K-Nearest Neighbors (Knn) class using Euclidean distance as distance metric.</div><div class="ttdef"><b>Definition</b> <a href="#l00055">k_nearest_neighbors.cpp:55</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_a080f5b1742832a03c1cbba596a48bd1a"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a080f5b1742832a03c1cbba596a48bd1a">machine_learning::k_nearest_neighbors::Knn::operator=</a></div><div class="ttdeci">Knn &amp; operator=(const Knn &amp;model)=default</div></div>
+<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_a16ddc13621eec6ac5f83658b3401a581"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a16ddc13621eec6ac5f83658b3401a581">machine_learning::k_nearest_neighbors::Knn::X_</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; double &gt; &gt; X_</div><div class="ttdoc">attributes vector</div><div class="ttdef"><b>Definition</b> <a href="#l00057">k_nearest_neighbors.cpp:57</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_a188d29ffcefdb5900a8cd41eccd89200"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200">machine_learning::k_nearest_neighbors::Knn::Knn</a></div><div class="ttdeci">Knn(std::vector&lt; std::vector&lt; double &gt; &gt; &amp;X, std::vector&lt; int &gt; &amp;Y)</div><div class="ttdoc">Construct a new Knn object.</div><div class="ttdef"><b>Definition</b> <a href="#l00067">k_nearest_neighbors.cpp:67</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_a209383503fb6c03afac405a80bace964"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a209383503fb6c03afac405a80bace964">machine_learning::k_nearest_neighbors::Knn::Y_</a></div><div class="ttdeci">std::vector&lt; int &gt; Y_</div><div class="ttdoc">labels vector</div><div class="ttdef"><b>Definition</b> <a href="#l00058">k_nearest_neighbors.cpp:58</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_a4b17dcf17c847f0295b60029512c120e"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e">machine_learning::k_nearest_neighbors::Knn::Knn</a></div><div class="ttdeci">Knn(Knn &amp;&amp;)=default</div></div>
+<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_a62e152db014cd4de675fa906e5ef2861"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a62e152db014cd4de675fa906e5ef2861">machine_learning::k_nearest_neighbors::Knn::predict</a></div><div class="ttdeci">int predict(std::vector&lt; double &gt; &amp;sample, int k)</div><div class="ttdoc">Classify sample.</div><div class="ttdef"><b>Definition</b> <a href="#l00103">k_nearest_neighbors.cpp:103</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_a9f5885c40112481ae5b588fe81d7910b"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b">machine_learning::k_nearest_neighbors::Knn::Knn</a></div><div class="ttdeci">Knn(const Knn &amp;model)=default</div></div>
+<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_ac06986d5afddc767ddba4da738f75563"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#ac06986d5afddc767ddba4da738f75563">machine_learning::k_nearest_neighbors::Knn::operator=</a></div><div class="ttdeci">Knn &amp; operator=(Knn &amp;&amp;)=default</div></div>
+<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_afe732a33112b457b738f403622d226e5"><div class="ttname"><a href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#afe732a33112b457b738f403622d226e5">machine_learning::k_nearest_neighbors::Knn::~Knn</a></div><div class="ttdeci">~Knn()=default</div><div class="ttdoc">Destroy the Knn object.</div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="ak__nearest__neighbors_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/d3e/k__nearest__neighbors_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> <a href="#l00140">k_nearest_neighbors.cpp:140</a></div></div>
+<div class="ttc" id="ak__nearest__neighbors_8cpp_html_ad6ae16e50bb153ebaa7251d0aaa97b69"><div class="ttname"><a href="../../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69">machine_learning::k_nearest_neighbors::euclidean_distance</a></div><div class="ttdeci">double euclidean_distance(const std::vector&lt; T &gt; &amp;a, const std::vector&lt; T &gt; &amp;b)</div><div class="ttdoc">Compute the Euclidean distance between two vectors.</div><div class="ttdef"><b>Definition</b> <a href="#l00043">k_nearest_neighbors.cpp:43</a></div></div>
+<div class="ttc" id="anamespacek__nearest__neighbors_html"><div class="ttname"><a href="../../d7/d4c/namespacek__nearest__neighbors.html">k_nearest_neighbors</a></div><div class="ttdoc">Functions for the [K-Nearest Neighbors algorithm] (https://en.wikipedia.org/wiki/K-nearest_neighbors_...</div></div>
+<div class="ttc" id="anamespacemachine__learning_html"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></div><div class="ttdoc">A* search algorithm</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_3343723ae086de42ee4ca9774da3a13f.html">machine_learning</a></li><li class="navelem"><a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp.html">k_nearest_neighbors.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d3e/n__queens_8cpp.html b/d4/d3e/n__queens_8cpp.html
index 059399d98..0d78402b4 100644
--- a/d4/d3e/n__queens_8cpp.html
+++ b/d4/d3e/n__queens_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: backtracking/n_queens.cpp File Reference</title>
+<title>TheAlgorithms/C++: backtracking/n_queens.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for n_queens.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d83/n__queens_8cpp__incl.svg" width="191" height="111"><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">
+</div>
+<p><a href="../../d4/d3e/n__queens_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html">backtracking</a></td></tr>
@@ -133,13 +152,13 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a40ae0c7fd04eb20e7f3bff13fc6a5808" id="r_a40ae0c7fd04eb20e7f3bff13fc6a5808"><td class="memTemplParams" colspan="2">template&lt;size_t n&gt; </td></tr>
-<tr class="memitem:a40ae0c7fd04eb20e7f3bff13fc6a5808"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a40ae0c7fd04eb20e7f3bff13fc6a5808">backtracking::n_queens::printSolution</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; &amp;board)</td></tr>
+<tr class="memitem:a40ae0c7fd04eb20e7f3bff13fc6a5808"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a40ae0c7fd04eb20e7f3bff13fc6a5808">backtracking::n_queens::printSolution</a> (const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board)</td></tr>
 <tr class="separator:a40ae0c7fd04eb20e7f3bff13fc6a5808"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a5730b6683f6adcf5c5ef75cf53dc7160" id="r_a5730b6683f6adcf5c5ef75cf53dc7160"><td class="memTemplParams" colspan="2">template&lt;size_t n&gt; </td></tr>
-<tr class="memitem:a5730b6683f6adcf5c5ef75cf53dc7160"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5730b6683f6adcf5c5ef75cf53dc7160">backtracking::n_queens::isSafe</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; &amp;board, const int &amp;row, const int &amp;col)</td></tr>
+<tr class="memitem:a5730b6683f6adcf5c5ef75cf53dc7160"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5730b6683f6adcf5c5ef75cf53dc7160">backtracking::n_queens::isSafe</a> (const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board, const int &amp;row, const int &amp;col)</td></tr>
 <tr class="separator:a5730b6683f6adcf5c5ef75cf53dc7160"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a0dbd7af47d87f0b956609fe9e3288ecb" id="r_a0dbd7af47d87f0b956609fe9e3288ecb"><td class="memTemplParams" colspan="2">template&lt;size_t n&gt; </td></tr>
-<tr class="memitem:a0dbd7af47d87f0b956609fe9e3288ecb"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a0dbd7af47d87f0b956609fe9e3288ecb">backtracking::n_queens::solveNQ</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; board, const int &amp;col)</td></tr>
+<tr class="memitem:a0dbd7af47d87f0b956609fe9e3288ecb"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a0dbd7af47d87f0b956609fe9e3288ecb">backtracking::n_queens::solveNQ</a> (std::array&lt; std::array&lt; int, n &gt;, n &gt; board, const int &amp;col)</td></tr>
 <tr class="separator:a0dbd7af47d87f0b956609fe9e3288ecb"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
 <tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function.  <br /></td></tr>
@@ -151,6 +170,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd>Unknown author </dd>
 <dd>
 <a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d3e/n__queens_8cpp_source.html">n_queens.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a5730b6683f6adcf5c5ef75cf53dc7160" name="a5730b6683f6adcf5c5ef75cf53dc7160"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a5730b6683f6adcf5c5ef75cf53dc7160">&#9670;&#160;</a></span>isSafe()</h2>
@@ -163,7 +184,7 @@ template&lt;size_t n&gt; </div>
         <tr>
           <td class="memname">bool backtracking::n_queens::isSafe </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>board</em></span>, </td>
+          <td class="paramtype">const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>board</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -194,6 +215,8 @@ template&lt;size_t n&gt; </div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if queen can be placed on matrix </dd>
 <dd>
 <code>false</code> if queen can't be placed on matrix </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d3e/n__queens_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d4/d3e/n__queens_8cpp_source.html">n_queens.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   59</span>                            {</div>
 <div class="line"><span class="lineno">   60</span>    <span class="keywordtype">int</span> i = 0, j = 0;</div>
 <div class="line"><span class="lineno">   61</span> </div>
@@ -238,16 +261,17 @@ template&lt;size_t n&gt; </div>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d3e/n__queens_8cpp_source.html#l00120">120</a> of file <a class="el" href="../../d4/d3e/n__queens_8cpp_source.html">n_queens.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  120</span>           {</div>
 <div class="line"><span class="lineno">  121</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> n = 4;</div>
-<div class="line"><span class="lineno">  122</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;int, n&gt;</a>, n&gt; board = {</div>
-<div class="line"><span class="lineno">  123</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n&gt;</a>({0, 0, 0, 0}), <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n&gt;</a>({0, 0, 0, 0}),</div>
-<div class="line"><span class="lineno">  124</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n&gt;</a>({0, 0, 0, 0}), <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n&gt;</a>({0, 0, 0, 0})};</div>
+<div class="line"><span class="lineno">  122</span>    std::array&lt;std::array&lt;int, n&gt;, n&gt; board = {</div>
+<div class="line"><span class="lineno">  123</span>        std::array&lt;int, n&gt;({0, 0, 0, 0}), std::array&lt;int, n&gt;({0, 0, 0, 0}),</div>
+<div class="line"><span class="lineno">  124</span>        std::array&lt;int, n&gt;({0, 0, 0, 0}), std::array&lt;int, n&gt;({0, 0, 0, 0})};</div>
 <div class="line"><span class="lineno">  125</span> </div>
 <div class="line"><span class="lineno">  126</span>    backtracking::n_queens::solveNQ&lt;n&gt;(board, 0);</div>
 <div class="line"><span class="lineno">  127</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  128</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -262,7 +286,7 @@ template&lt;size_t n&gt; </div>
         <tr>
           <td class="memname">void backtracking::n_queens::printSolution </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>board</em></span></td><td>)</td>
+          <td class="paramtype">const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>board</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -279,16 +303,17 @@ template&lt;size_t n&gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d3e/n__queens_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../d4/d3e/n__queens_8cpp_source.html">n_queens.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   38</span>                                                               {</div>
-<div class="line"><span class="lineno">   39</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   39</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   40</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
 <div class="line"><span class="lineno">   41</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
-<div class="line"><span class="lineno">   42</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;&quot;</span> &lt;&lt; board[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   42</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;&quot;</span> &lt;&lt; board[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   43</span>        }</div>
-<div class="line"><span class="lineno">   44</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   44</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   45</span>    }</div>
 <div class="line"><span class="lineno">   46</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><!-- fragment -->
 </div>
 </div>
@@ -303,7 +328,7 @@ template&lt;size_t n&gt; </div>
         <tr>
           <td class="memname">void backtracking::n_queens::solveNQ </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt;</td>          <td class="paramname"><span class="paramname"><em>board</em></span>, </td>
+          <td class="paramtype">std::array&lt; std::array&lt; int, n &gt;, n &gt;</td>          <td class="paramname"><span class="paramname"><em>board</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -325,6 +350,8 @@ template&lt;size_t n&gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d3e/n__queens_8cpp_source.html#l00091">91</a> of file <a class="el" href="../../d4/d3e/n__queens_8cpp_source.html">n_queens.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   91</span>                                                                  {</div>
 <div class="line"><span class="lineno">   92</span>    <span class="keywordflow">if</span> (col &gt;= n) {</div>
 <div class="line"><span class="lineno">   93</span>        printSolution&lt;n&gt;(board);</div>
@@ -347,12 +374,7 @@ template&lt;size_t n&gt; </div>
 <div class="line"><span class="lineno">  110</span>        }</div>
 <div class="line"><span class="lineno">  111</span>    }</div>
 <div class="line"><span class="lineno">  112</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph.svg" width="171" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph.map b/d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph.map
deleted file mode 100644
index e6cdf7e3a..000000000
--- a/d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="backtracking::n_queens::solveNQ" name="backtracking::n_queens::solveNQ">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,165,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="54,29,53,19,58,11,69,5,85,3,103,5,113,11,110,16,101,10,85,8,70,10,61,14,58,20,59,28"/>
-</map>
diff --git a/d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph.md5 b/d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph.md5
deleted file mode 100644
index 81beb1497..000000000
--- a/d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-65d61fc813fdae86573dea9ee0af7760
\ No newline at end of file
diff --git a/d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph.svg b/d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph.svg
deleted file mode 100644
index fd2e88cbb..000000000
--- a/d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::n_queens::solveNQ Pages: 1 -->
-<svg width="128pt" height="57pt"
- viewBox="0.00 0.00 127.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::n_queens::solveNQ</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="119.5,-30.5 0,-30.5 0,0 119.5,0 119.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::n_queens</text>
-<text text-anchor="middle" x="59.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::solveNQ</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.57,-30.99C34.25,-40.06 41.31,-48.5 59.75,-48.5 69.83,-48.5 76.51,-45.97 79.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.25,-42.79 80.77,-32.49 76.28,-42.09 83.25,-42.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph_org.svg b/d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph_org.svg
deleted file mode 100644
index 4ae506580..000000000
--- a/d4/d3e/n__queens_8cpp_a0dbd7af47d87f0b956609fe9e3288ecb_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::n_queens::solveNQ Pages: 1 -->
-<svg width="128pt" height="57pt"
- viewBox="0.00 0.00 127.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::n_queens::solveNQ</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="119.5,-30.5 0,-30.5 0,0 119.5,0 119.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::n_queens</text>
-<text text-anchor="middle" x="59.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::solveNQ</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.57,-30.99C34.25,-40.06 41.31,-48.5 59.75,-48.5 69.83,-48.5 76.51,-45.97 79.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.25,-42.79 80.77,-32.49 76.28,-42.09 83.25,-42.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d3e/n__queens_8cpp_source.html b/d4/d3e/n__queens_8cpp_source.html
new file mode 100644
index 000000000..9a7347da5
--- /dev/null
+++ b/d4/d3e/n__queens_8cpp_source.html
@@ -0,0 +1,228 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: backtracking/n_queens.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d3e/n__queens_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">n_queens.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/d3e/n__queens_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;array&gt;</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../db/dc0/namespacebacktracking.html">backtracking</a> {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d3/da1/namespacen__queens.html">n_queens</a> {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> n&gt;</div>
+<div class="foldopen" id="foldopen00038" data-start="{" data-end="}">
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="../../d4/d3e/n__queens_8cpp.html#a40ae0c7fd04eb20e7f3bff13fc6a5808">   38</a></span><span class="keywordtype">void</span> printSolution(<span class="keyword">const</span> std::array&lt;std::array&lt;int, n&gt;, n&gt; &amp;board) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;&quot;</span> &lt;&lt; board[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>}</div>
+</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> n&gt;</div>
+<div class="foldopen" id="foldopen00058" data-start="{" data-end="}">
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../d4/d3e/n__queens_8cpp.html#a5730b6683f6adcf5c5ef75cf53dc7160">   58</a></span><span class="keywordtype">bool</span> isSafe(<span class="keyword">const</span> std::array&lt;std::array&lt;int, n&gt;, n&gt; &amp;board, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;row,</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;col) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordtype">int</span> i = 0, j = 0;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="comment">// Check this row on left side</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordflow">for</span> (i = 0; i &lt; col; i++) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        <span class="keywordflow">if</span> (board[row][i]) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="comment">// Check upper diagonal on left side</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keywordflow">for</span> (i = row, j = col; i &gt;= 0 &amp;&amp; j &gt;= 0; i--, j--) {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        <span class="keywordflow">if</span> (board[i][j]) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        }</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    }</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="comment">// Check lower diagonal on left side</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keywordflow">for</span> (i = row, j = col; j &gt;= 0 &amp;&amp; i &lt; n; i++, j--) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        <span class="keywordflow">if</span> (board[i][j]) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    }</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>}</div>
+</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> n&gt;</div>
+<div class="foldopen" id="foldopen00091" data-start="{" data-end="}">
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"><a class="line" href="../../d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb">   91</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb">solveNQ</a>(std::array&lt;std::array&lt;int, n&gt;, n&gt; board, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;col) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keywordflow">if</span> (col &gt;= n) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        printSolution&lt;n&gt;(board);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    }</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="comment">// Consider this column and try placing</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="comment">// this queen in all rows one by one</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        <span class="comment">// Check if queen can be placed</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        <span class="comment">// on board[i][col]</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        <span class="keywordflow">if</span> (isSafe&lt;n&gt;(board, i, col)) {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>            <span class="comment">// Place this queen in matrix</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>            board[i][col] = 1;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>            <span class="comment">// Recursive to place rest of the queens</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>            solveNQ&lt;n&gt;(board, col + 1);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            board[i][col] = 0;  <span class="comment">// backtrack</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        }</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    }</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>}</div>
+</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>}  <span class="comment">// namespace n_queens</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>}  <span class="comment">// namespace backtracking</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="foldopen" id="foldopen00120" data-start="{" data-end="}">
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"><a class="line" href="../../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  120</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> n = 4;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    std::array&lt;std::array&lt;int, n&gt;, n&gt; board = {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        std::array&lt;int, n&gt;({0, 0, 0, 0}), std::array&lt;int, n&gt;({0, 0, 0, 0}),</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        std::array&lt;int, n&gt;({0, 0, 0, 0}), std::array&lt;int, n&gt;({0, 0, 0, 0})};</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    backtracking::n_queens::solveNQ&lt;n&gt;(board, 0);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>}</div>
+</div>
+<div class="ttc" id="an__queens_8cpp_html_a0dbd7af47d87f0b956609fe9e3288ecb"><div class="ttname"><a href="../../d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb">backtracking::n_queens::solveNQ</a></div><div class="ttdeci">void solveNQ(std::array&lt; std::array&lt; int, n &gt;, n &gt; board, const int &amp;col)</div><div class="ttdef"><b>Definition</b> <a href="#l00091">n_queens.cpp:91</a></div></div>
+<div class="ttc" id="an__queens_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00120">n_queens.cpp:120</a></div></div>
+<div class="ttc" id="anamespacebacktracking_html"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html">backtracking</a></div><div class="ttdoc">for vector container</div></div>
+<div class="ttc" id="anamespacen__queens_html"><div class="ttname"><a href="../../d3/da1/namespacen__queens.html">n_queens</a></div><div class="ttdoc">Functions for Eight Queens puzzle.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a class="el" href="../../d4/d3e/n__queens_8cpp.html">n_queens.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d45/gcd__recursive__euclidean_8cpp.html b/d4/d45/gcd__recursive__euclidean_8cpp.html
index 454c80aed..d52ca7f2c 100644
--- a/d4/d45/gcd__recursive__euclidean_8cpp.html
+++ b/d4/d45/gcd__recursive__euclidean_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/gcd_recursive_euclidean.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/gcd_recursive_euclidean.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,7 +135,9 @@ Include dependency graph for gcd_recursive_euclidean.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d4c/gcd__recursive__euclidean_8cpp__incl.svg" width="147" height="126"><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">
+</div>
+<p><a href="../../d4/d45/gcd__recursive__euclidean_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ae48807fa2b7000afae599e67f327545e" id="r_ae48807fa2b7000afae599e67f327545e"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae48807fa2b7000afae599e67f327545e">gcd</a> (int num1, int num2)</td></tr>
@@ -129,6 +148,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Compute the greatest common denominator of two integers using <em>recursive form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </p>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html" title="Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm">gcd_iterative_euclidean.cpp</a>, <a class="el" href="../../d1/d11/gcd__of__n__numbers_8cpp.html" title="This program aims at calculating the GCD of n numbers.">gcd_of_n_numbers.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d45/gcd__recursive__euclidean_8cpp_source.html">gcd_recursive_euclidean.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae48807fa2b7000afae599e67f327545e" name="ae48807fa2b7000afae599e67f327545e"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae48807fa2b7000afae599e67f327545e">&#9670;&#160;</a></span>gcd()</h2>
@@ -149,9 +170,11 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>algorithm </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d45/gcd__recursive__euclidean_8cpp_source.html#l00014">14</a> of file <a class="el" href="../../d4/d45/gcd__recursive__euclidean_8cpp_source.html">gcd_recursive_euclidean.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   14</span>                            {</div>
 <div class="line"><span class="lineno">   15</span>    <span class="keywordflow">if</span> (num1 &lt;= 0 | num2 &lt;= 0) {</div>
-<div class="line"><span class="lineno">   16</span>        <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/domain_error.html">std::domain_error</a>(<span class="stringliteral">&quot;Euclidean algorithm domain is for ints &gt; 0&quot;</span>);</div>
+<div class="line"><span class="lineno">   16</span>        <span class="keywordflow">throw</span> std::domain_error(<span class="stringliteral">&quot;Euclidean algorithm domain is for ints &gt; 0&quot;</span>);</div>
 <div class="line"><span class="lineno">   17</span>    }</div>
 <div class="line"><span class="lineno">   18</span> </div>
 <div class="line"><span class="lineno">   19</span>    <span class="keywordflow">if</span> (num1 == num2) {</div>
@@ -173,14 +196,8 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   35</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#ae48807fa2b7000afae599e67f327545e">gcd</a>(num1 - num2, num2);</div>
 <div class="line"><span class="lineno">   36</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="#ae48807fa2b7000afae599e67f327545e">gcd</a>(num1, num2 - num1);</div>
 <div class="line"><span class="lineno">   37</span>}</div>
-<div class="ttc" id="adomain_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/domain_error.html">std::domain_error</a></div></div>
-<div class="ttc" id="agcd__recursive__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition</b> gcd_recursive_euclidean.cpp:14</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d45/gcd__recursive__euclidean_8cpp_ae48807fa2b7000afae599e67f327545e_cgraph.svg" width="54" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agcd__recursive__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d45/gcd__recursive__euclidean_8cpp_source.html#l00014">gcd_recursive_euclidean.cpp:14</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -198,25 +215,20 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d45/gcd__recursive__euclidean_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d4/d45/gcd__recursive__euclidean_8cpp_source.html">gcd_recursive_euclidean.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   42</span>           {</div>
-<div class="line"><span class="lineno">   43</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;gcd of 120,7 is &quot;</span> &lt;&lt; (<a class="code hl_function" href="#ae48807fa2b7000afae599e67f327545e">gcd</a>(120, 7)) &lt;&lt; <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">   43</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;gcd of 120,7 is &quot;</span> &lt;&lt; (<a class="code hl_function" href="#ae48807fa2b7000afae599e67f327545e">gcd</a>(120, 7)) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   44</span>    <span class="keywordflow">try</span> {</div>
-<div class="line"><span class="lineno">   45</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;gcd of -120,10 is &quot;</span> &lt;&lt; <a class="code hl_function" href="#ae48807fa2b7000afae599e67f327545e">gcd</a>(-120, 10) &lt;&lt; <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">   46</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/domain_error.html">std::domain_error</a> &amp;e) {</div>
-<div class="line"><span class="lineno">   47</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Error handling was successful&quot;</span> &lt;&lt; <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">   45</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;gcd of -120,10 is &quot;</span> &lt;&lt; <a class="code hl_function" href="#ae48807fa2b7000afae599e67f327545e">gcd</a>(-120, 10) &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   46</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::domain_error &amp;e) {</div>
+<div class="line"><span class="lineno">   47</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Error handling was successful&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   48</span>    }</div>
-<div class="line"><span class="lineno">   49</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;gcd of 312,221 is &quot;</span> &lt;&lt; (<a class="code hl_function" href="#ae48807fa2b7000afae599e67f327545e">gcd</a>(312, 221)) &lt;&lt; <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">   50</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;gcd of 289,204 is &quot;</span> &lt;&lt; (<a class="code hl_function" href="#ae48807fa2b7000afae599e67f327545e">gcd</a>(289, 204)) &lt;&lt; <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">   49</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;gcd of 312,221 is &quot;</span> &lt;&lt; (<a class="code hl_function" href="#ae48807fa2b7000afae599e67f327545e">gcd</a>(312, 221)) &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   50</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;gcd of 289,204 is &quot;</span> &lt;&lt; (<a class="code hl_function" href="#ae48807fa2b7000afae599e67f327545e">gcd</a>(289, 204)) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   51</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   52</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="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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="180" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/d45/gcd__recursive__euclidean_8cpp_ae48807fa2b7000afae599e67f327545e_cgraph.map b/d4/d45/gcd__recursive__euclidean_8cpp_ae48807fa2b7000afae599e67f327545e_cgraph.map
deleted file mode 100644
index 979fb27dc..000000000
--- a/d4/d45/gcd__recursive__euclidean_8cpp_ae48807fa2b7000afae599e67f327545e_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="gcd" name="gcd">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,48,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="17,29,17,12,20,5,27,3,33,6,36,13,31,15,29,10,26,8,24,9,22,13,23,29"/>
-</map>
diff --git a/d4/d45/gcd__recursive__euclidean_8cpp_ae48807fa2b7000afae599e67f327545e_cgraph.md5 b/d4/d45/gcd__recursive__euclidean_8cpp_ae48807fa2b7000afae599e67f327545e_cgraph.md5
deleted file mode 100644
index 3ce93c57e..000000000
--- a/d4/d45/gcd__recursive__euclidean_8cpp_ae48807fa2b7000afae599e67f327545e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b8b5505663d8370c4619b70f19abe443
\ No newline at end of file
diff --git a/d4/d45/gcd__recursive__euclidean_8cpp_ae48807fa2b7000afae599e67f327545e_cgraph.svg b/d4/d45/gcd__recursive__euclidean_8cpp_ae48807fa2b7000afae599e67f327545e_cgraph.svg
deleted file mode 100644
index e1eb36a6c..000000000
--- a/d4/d45/gcd__recursive__euclidean_8cpp_ae48807fa2b7000afae599e67f327545e_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: gcd Pages: 1 -->
-<svg width="40pt" height="45pt"
- viewBox="0.00 0.00 39.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>gcd</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="31.75,-19.25 0,-19.25 0,0 31.75,0 31.75,-19.25"/>
-<text text-anchor="middle" x="15.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M10.9,-19.54C8.64,-28.15 10.29,-37.25 15.88,-37.25 18.84,-37.25 20.7,-34.68 21.45,-30.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="24.95,-30.85 20.93,-21.05 17.96,-31.22 24.95,-30.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d45/gcd__recursive__euclidean_8cpp_ae48807fa2b7000afae599e67f327545e_cgraph_org.svg b/d4/d45/gcd__recursive__euclidean_8cpp_ae48807fa2b7000afae599e67f327545e_cgraph_org.svg
deleted file mode 100644
index 366acef96..000000000
--- a/d4/d45/gcd__recursive__euclidean_8cpp_ae48807fa2b7000afae599e67f327545e_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: gcd Pages: 1 -->
-<svg width="40pt" height="45pt"
- viewBox="0.00 0.00 39.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>gcd</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="31.75,-19.25 0,-19.25 0,0 31.75,0 31.75,-19.25"/>
-<text text-anchor="middle" x="15.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M10.9,-19.54C8.64,-28.15 10.29,-37.25 15.88,-37.25 18.84,-37.25 20.7,-34.68 21.45,-30.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="24.95,-30.85 20.93,-21.05 17.96,-31.22 24.95,-30.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index b07a2be89..000000000
--- a/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,43,55,68"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,45,87,33,89,38,56,50"/>
-<area shape="rect" id="Node000003" href="$d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" title=" " alt="" coords="117,79,160,104"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,61,103,77,101,82,54,66"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="119,79,115,70,118,61,125,54,138,52,152,55,159,62,156,65,150,59,138,57,128,59,122,64,121,70,124,77"/>
-</map>
diff --git a/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 641e88893..000000000
--- a/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1f6c18c0a7712f33544d6843ac8102ec
\ No newline at end of file
diff --git a/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index aefebcac8..000000000
--- a/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="82pt"
- viewBox="0.00 0.00 134.50 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-46.25 0,-46.25 0,-27 37,-27 37,-46.25"/>
-<text text-anchor="middle" x="18.5" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-74.25 73,-74.25 73,-55 126.5,-55 126.5,-74.25"/>
-<text text-anchor="middle" x="99.75" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-42.98C44.8,-45.57 53.55,-48.65 62.1,-51.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.7,-54.89 71.29,-54.92 63.03,-48.29 60.7,-54.89"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="115.62,-19.25 83.88,-19.25 83.88,0 115.62,0 115.62,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-30.5C47.9,-26.95 61.18,-22.42 72.72,-18.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.74,-21.84 82.07,-15.31 71.48,-15.22 73.74,-21.84"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.03,-19.54C81.23,-28.15 85.47,-37.25 99.75,-37.25 107.56,-37.25 112.37,-34.53 114.17,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="117.67,-30.39 112.7,-21.03 110.75,-31.45 117.67,-30.39"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 0a8cfa93c..000000000
--- a/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="82pt"
- viewBox="0.00 0.00 134.50 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-46.25 0,-46.25 0,-27 37,-27 37,-46.25"/>
-<text text-anchor="middle" x="18.5" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-74.25 73,-74.25 73,-55 126.5,-55 126.5,-74.25"/>
-<text text-anchor="middle" x="99.75" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-42.98C44.8,-45.57 53.55,-48.65 62.1,-51.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.7,-54.89 71.29,-54.92 63.03,-48.29 60.7,-54.89"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="115.62,-19.25 83.88,-19.25 83.88,0 115.62,0 115.62,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-30.5C47.9,-26.95 61.18,-22.42 72.72,-18.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.74,-21.84 82.07,-15.31 71.48,-15.22 73.74,-21.84"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.03,-19.54C81.23,-28.15 85.47,-37.25 99.75,-37.25 107.56,-37.25 112.37,-34.53 114.17,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="117.67,-30.39 112.7,-21.03 110.75,-31.45 117.67,-30.39"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d45/gcd__recursive__euclidean_8cpp_source.html b/d4/d45/gcd__recursive__euclidean_8cpp_source.html
new file mode 100644
index 000000000..0c20f047c
--- /dev/null
+++ b/d4/d45/gcd__recursive__euclidean_8cpp_source.html
@@ -0,0 +1,182 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/gcd_recursive_euclidean.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d45/gcd__recursive__euclidean_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">gcd_recursive_euclidean.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/d45/gcd__recursive__euclidean_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="foldopen" id="foldopen00014" data-start="{" data-end="}">
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"><a class="line" href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">   14</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>(<span class="keywordtype">int</span> num1, <span class="keywordtype">int</span> num2) {</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="keywordflow">if</span> (num1 &lt;= 0 | num2 &lt;= 0) {</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>        <span class="keywordflow">throw</span> std::domain_error(<span class="stringliteral">&quot;Euclidean algorithm domain is for ints &gt; 0&quot;</span>);</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    }</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    <span class="keywordflow">if</span> (num1 == num2) {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        <span class="keywordflow">return</span> num1;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    }</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    <span class="comment">// Everything divides 0</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="keywordflow">if</span> (num1 == 0)</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        <span class="keywordflow">return</span> num2;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="keywordflow">if</span> (num2 == 0)</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        <span class="keywordflow">return</span> num1;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="comment">// base case</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">if</span> (num1 == num2)</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        <span class="keywordflow">return</span> num1;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="comment">// a is greater</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">if</span> (num1 &gt; num2)</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>(num1 - num2, num2);</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>(num1, num2 - num1);</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>}</div>
+</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="foldopen" id="foldopen00042" data-start="{" data-end="}">
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   42</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;gcd of 120,7 is &quot;</span> &lt;&lt; (<a class="code hl_function" href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>(120, 7)) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">try</span> {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;gcd of -120,10 is &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>(-120, 10) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::domain_error &amp;e) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Error handling was successful&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;gcd of 312,221 is &quot;</span> &lt;&lt; (<a class="code hl_function" href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>(312, 221)) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;gcd of 289,204 is &quot;</span> &lt;&lt; (<a class="code hl_function" href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>(289, 204)) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>}</div>
+</div>
+<div class="ttc" id="agcd__recursive__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition</b> <a href="#l00014">gcd_recursive_euclidean.cpp:14</a></div></div>
+<div class="ttc" id="agcd__recursive__euclidean_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00042">gcd_recursive_euclidean.cpp:42</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d4/d45/gcd__recursive__euclidean_8cpp.html">gcd_recursive_euclidean.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d48/hamming__distance_8cpp.html b/d4/d48/hamming__distance_8cpp.html
index a602d5f11..51905c682 100644
--- a/d4/d48/hamming__distance_8cpp.html
+++ b/d4/d48/hamming__distance_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: bit_manipulation/hamming_distance.cpp File Reference</title>
+<title>TheAlgorithms/C++: bit_manipulation/hamming_distance.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for hamming_distance.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d4b/hamming__distance_8cpp__incl.svg" width="255" height="126"><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">
+</div>
+<p><a href="../../d4/d48/hamming__distance_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></td></tr>
@@ -137,7 +156,7 @@ Functions</h2></td></tr>
 <tr class="separator:a65d845df3fecff7087a2126c7b72030b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:abfe6fbb2f3460a2623c96f283178a07a" id="r_abfe6fbb2f3460a2623c96f283178a07a"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abfe6fbb2f3460a2623c96f283178a07a">bit_manipulation::hamming_distance::hamming_distance</a> (uint64_t a, uint64_t b)</td></tr>
 <tr class="separator:abfe6fbb2f3460a2623c96f283178a07a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a40ba9fe8b5df5c268f0c7d677ff2fe80" id="r_a40ba9fe8b5df5c268f0c7d677ff2fe80"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a40ba9fe8b5df5c268f0c7d677ff2fe80">bit_manipulation::hamming_distance::hamming_distance</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;a, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;b)</td></tr>
+<tr class="memitem:a40ba9fe8b5df5c268f0c7d677ff2fe80" id="r_a40ba9fe8b5df5c268f0c7d677ff2fe80"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a40ba9fe8b5df5c268f0c7d677ff2fe80">bit_manipulation::hamming_distance::hamming_distance</a> (const std::string &amp;a, const std::string &amp;b)</td></tr>
 <tr class="separator:a40ba9fe8b5df5c268f0c7d677ff2fe80"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
 <tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to the test hamming distance.  <br /></td></tr>
@@ -150,6 +169,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Returns the <a href="https://en.wikipedia.org/wiki/Hamming_distance" target="_blank">Hamming distance</a> between two integers. </p>
 <p>To find hamming distance between two integers, we take their xor, which will have a set bit iff those bits differ in the two numbers. Hence, we return the number of such set bits.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/ravibitsgoa" target="_blank">Ravishankar Joshi</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d48/hamming__distance_8cpp_source.html">hamming_distance.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a65d845df3fecff7087a2126c7b72030b" name="a65d845df3fecff7087a2126c7b72030b"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a65d845df3fecff7087a2126c7b72030b">&#9670;&#160;</a></span>bitCount()</h2>
@@ -172,6 +193,8 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the number of set bits in the given number. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d48/hamming__distance_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../d4/d48/hamming__distance_8cpp_source.html">hamming_distance.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   35</span>                                  {</div>
 <div class="line"><span class="lineno">   36</span>    uint64_t count = 0;</div>
 <div class="line"><span class="lineno">   37</span>    <span class="keywordflow">while</span> (value) {       <span class="comment">// until all bits are zero</span></div>
@@ -182,12 +205,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   42</span>    }</div>
 <div class="line"><span class="lineno">   43</span>    <span class="keywordflow">return</span> count;</div>
 <div class="line"><span class="lineno">   44</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d48/hamming__distance_8cpp_a65d845df3fecff7087a2126c7b72030b_cgraph.svg" width="187" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a40ba9fe8b5df5c268f0c7d677ff2fe80" name="a40ba9fe8b5df5c268f0c7d677ff2fe80"></a>
@@ -199,12 +217,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">uint64_t bit_manipulation::hamming_distance::hamming_distance </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>b</em></span>&#160;)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>b</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -216,8 +234,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the number of characters differing between the two strings. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d48/hamming__distance_8cpp_source.html#l00060">60</a> of file <a class="el" href="../../d4/d48/hamming__distance_8cpp_source.html">hamming_distance.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   60</span>                                                                  {</div>
-<div class="line"><span class="lineno">   61</span>    assert(a.size() == b.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>());</div>
+<div class="line"><span class="lineno">   61</span>    assert(a.size() == b.size());</div>
 <div class="line"><span class="lineno">   62</span>    <span class="keywordtype">size_t</span> n = a.size();</div>
 <div class="line"><span class="lineno">   63</span>    uint64_t count = 0;</div>
 <div class="line"><span class="lineno">   64</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; n; i++) {</div>
@@ -225,13 +245,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   66</span>    }</div>
 <div class="line"><span class="lineno">   67</span>    <span class="keywordflow">return</span> count;</div>
 <div class="line"><span class="lineno">   68</span>}</div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d48/hamming__distance_8cpp_a40ba9fe8b5df5c268f0c7d677ff2fe80_cgraph.svg" width="364" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abfe6fbb2f3460a2623c96f283178a07a" name="abfe6fbb2f3460a2623c96f283178a07a"></a>
@@ -260,14 +274,11 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the number of bits differing between the two integers. </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   52</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a65d845df3fecff7087a2126c7b72030b">bitCount</a>(a ^ b); }</div>
-<div class="ttc" id="ahamming__distance_8cpp_html_a65d845df3fecff7087a2126c7b72030b"><div class="ttname"><a href="#a65d845df3fecff7087a2126c7b72030b">bit_manipulation::hamming_distance::bitCount</a></div><div class="ttdeci">uint64_t bitCount(uint64_t value)</div><div class="ttdef"><b>Definition</b> hamming_distance.cpp:35</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d48/hamming__distance_8cpp_abfe6fbb2f3460a2623c96f283178a07a_cgraph.svg" width="430" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d48/hamming__distance_8cpp_source.html#l00052">52</a> of file <a class="el" href="../../d4/d48/hamming__distance_8cpp_source.html">hamming_distance.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   52</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a65d845df3fecff7087a2126c7b72030b">bitCount</a>(a ^ b); }</div>
+<div class="ttc" id="ahamming__distance_8cpp_html_a65d845df3fecff7087a2126c7b72030b"><div class="ttname"><a href="#a65d845df3fecff7087a2126c7b72030b">bit_manipulation::hamming_distance::bitCount</a></div><div class="ttdeci">uint64_t bitCount(uint64_t value)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d48/hamming__distance_8cpp_source.html#l00035">hamming_distance.cpp:35</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -287,25 +298,20 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d48/hamming__distance_8cpp_source.html#l00100">100</a> of file <a class="el" href="../../d4/d48/hamming__distance_8cpp_source.html">hamming_distance.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  100</span>           {</div>
 <div class="line"><span class="lineno">  101</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();           <span class="comment">// execute the tests</span></div>
 <div class="line"><span class="lineno">  102</span>    uint64_t a = 11;  <span class="comment">// 1011 in binary</span></div>
 <div class="line"><span class="lineno">  103</span>    uint64_t b = 2;   <span class="comment">// 0010 in binary</span></div>
 <div class="line"><span class="lineno">  104</span> </div>
-<div class="line"><span class="lineno">  105</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hamming distance between &quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; b &lt;&lt; <span class="stringliteral">&quot; is &quot;</span></div>
+<div class="line"><span class="lineno">  105</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hamming distance between &quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; b &lt;&lt; <span class="stringliteral">&quot; is &quot;</span></div>
 <div class="line"><span class="lineno">  106</span>              &lt;&lt; <a class="code hl_function" href="#abfe6fbb2f3460a2623c96f283178a07a">bit_manipulation::hamming_distance::hamming_distance</a>(a, b)</div>
-<div class="line"><span class="lineno">  107</span>              &lt;&lt; <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">  107</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  108</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="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="ahamming__distance_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to the test hamming distance.</div><div class="ttdef"><b>Definition</b> hamming_distance.cpp:76</div></div>
-<div class="ttc" id="ahamming__distance_8cpp_html_abfe6fbb2f3460a2623c96f283178a07a"><div class="ttname"><a href="#abfe6fbb2f3460a2623c96f283178a07a">bit_manipulation::hamming_distance::hamming_distance</a></div><div class="ttdeci">uint64_t hamming_distance(uint64_t a, uint64_t b)</div><div class="ttdef"><b>Definition</b> hamming_distance.cpp:52</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d48/hamming__distance_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="180" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ahamming__distance_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to the test hamming distance.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d48/hamming__distance_8cpp_source.html#l00076">hamming_distance.cpp:76</a></div></div>
+<div class="ttc" id="ahamming__distance_8cpp_html_abfe6fbb2f3460a2623c96f283178a07a"><div class="ttname"><a href="#abfe6fbb2f3460a2623c96f283178a07a">bit_manipulation::hamming_distance::hamming_distance</a></div><div class="ttdeci">uint64_t hamming_distance(uint64_t a, uint64_t b)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d48/hamming__distance_8cpp_source.html#l00052">hamming_distance.cpp:52</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -333,6 +339,8 @@ Here is the call graph for this function:</div>
 
 <p>Function to the test hamming distance. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d48/hamming__distance_8cpp_source.html#l00076">76</a> of file <a class="el" href="../../d4/d48/hamming__distance_8cpp_source.html">hamming_distance.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   76</span>                   {</div>
 <div class="line"><span class="lineno">   77</span>    assert(bit_manipulation::hamming_distance::hamming_distance(11, 2) == 2);</div>
 <div class="line"><span class="lineno">   78</span>    assert(bit_manipulation::hamming_distance::hamming_distance(2, 0) == 1);</div>
diff --git a/d4/d48/hamming__distance_8cpp_a40ba9fe8b5df5c268f0c7d677ff2fe80_cgraph.map b/d4/d48/hamming__distance_8cpp_a40ba9fe8b5df5c268f0c7d677ff2fe80_cgraph.map
deleted file mode 100644
index c433bddd2..000000000
--- a/d4/d48/hamming__distance_8cpp_a40ba9fe8b5df5c268f0c7d677ff2fe80_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="bit_manipulation::hamming_distance::hamming_distance" name="bit_manipulation::hamming_distance::hamming_distance">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,200,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="248,13,359,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="200,23,232,23,232,28,200,28"/>
-</map>
diff --git a/d4/d48/hamming__distance_8cpp_a40ba9fe8b5df5c268f0c7d677ff2fe80_cgraph.md5 b/d4/d48/hamming__distance_8cpp_a40ba9fe8b5df5c268f0c7d677ff2fe80_cgraph.md5
deleted file mode 100644
index e59eb429a..000000000
--- a/d4/d48/hamming__distance_8cpp_a40ba9fe8b5df5c268f0c7d677ff2fe80_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-24dc5cc04da149f201c79cdfaef4a40d
\ No newline at end of file
diff --git a/d4/d48/hamming__distance_8cpp_a40ba9fe8b5df5c268f0c7d677ff2fe80_cgraph.svg b/d4/d48/hamming__distance_8cpp_a40ba9fe8b5df5c268f0c7d677ff2fe80_cgraph.svg
deleted file mode 100644
index a6c03e70e..000000000
--- a/d4/d48/hamming__distance_8cpp_a40ba9fe8b5df5c268f0c7d677ff2fe80_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: bit_manipulation::hamming_distance::hamming_distance Pages: 1 -->
-<svg width="273pt" height="39pt"
- viewBox="0.00 0.00 273.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>bit_manipulation::hamming_distance::hamming_distance</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="145.75,-30.5 0,-30.5 0,0 145.75,0 145.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::hamming</text>
-<text text-anchor="middle" x="72.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_distance::hamming_distance</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="265.25,-24.88 181.75,-24.88 181.75,-5.63 265.25,-5.63 265.25,-24.88"/>
-<text text-anchor="middle" x="223.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.01,-15.25C154.07,-15.25 162.15,-15.25 169.9,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.82,-18.75 179.82,-15.25 169.82,-11.75 169.82,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d48/hamming__distance_8cpp_a40ba9fe8b5df5c268f0c7d677ff2fe80_cgraph_org.svg b/d4/d48/hamming__distance_8cpp_a40ba9fe8b5df5c268f0c7d677ff2fe80_cgraph_org.svg
deleted file mode 100644
index 469f90a39..000000000
--- a/d4/d48/hamming__distance_8cpp_a40ba9fe8b5df5c268f0c7d677ff2fe80_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: bit_manipulation::hamming_distance::hamming_distance Pages: 1 -->
-<svg width="273pt" height="39pt"
- viewBox="0.00 0.00 273.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>bit_manipulation::hamming_distance::hamming_distance</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="145.75,-30.5 0,-30.5 0,0 145.75,0 145.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::hamming</text>
-<text text-anchor="middle" x="72.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_distance::hamming_distance</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="265.25,-24.88 181.75,-24.88 181.75,-5.63 265.25,-5.63 265.25,-24.88"/>
-<text text-anchor="middle" x="223.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.01,-15.25C154.07,-15.25 162.15,-15.25 169.9,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.82,-18.75 179.82,-15.25 169.82,-11.75 169.82,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d48/hamming__distance_8cpp_a65d845df3fecff7087a2126c7b72030b_cgraph.map b/d4/d48/hamming__distance_8cpp_a65d845df3fecff7087a2126c7b72030b_cgraph.map
deleted file mode 100644
index 89b8c6b13..000000000
--- a/d4/d48/hamming__distance_8cpp_a65d845df3fecff7087a2126c7b72030b_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="bit_manipulation::hamming_distance::bitCount" name="bit_manipulation::hamming_distance::bitCount">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,182,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="60,29,58,19,64,10,76,5,94,3,113,5,124,11,122,16,111,10,93,8,77,10,67,14,63,20,65,28"/>
-</map>
diff --git a/d4/d48/hamming__distance_8cpp_a65d845df3fecff7087a2126c7b72030b_cgraph.md5 b/d4/d48/hamming__distance_8cpp_a65d845df3fecff7087a2126c7b72030b_cgraph.md5
deleted file mode 100644
index 5eb2f5a19..000000000
--- a/d4/d48/hamming__distance_8cpp_a65d845df3fecff7087a2126c7b72030b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e2325341507fff258d02a33f8366e7d3
\ No newline at end of file
diff --git a/d4/d48/hamming__distance_8cpp_a65d845df3fecff7087a2126c7b72030b_cgraph.svg b/d4/d48/hamming__distance_8cpp_a65d845df3fecff7087a2126c7b72030b_cgraph.svg
deleted file mode 100644
index ab4016ce4..000000000
--- a/d4/d48/hamming__distance_8cpp_a65d845df3fecff7087a2126c7b72030b_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: bit_manipulation::hamming_distance::bitCount Pages: 1 -->
-<svg width="140pt" height="57pt"
- viewBox="0.00 0.00 140.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>bit_manipulation::hamming_distance::bitCount</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="132.25,-30.5 0,-30.5 0,0 132.25,0 132.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::hamming</text>
-<text text-anchor="middle" x="66.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_distance::bitCount</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.69,-30.99C37.91,-40.06 45.72,-48.5 66.12,-48.5 77.28,-48.5 84.68,-45.97 88.3,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.76,-42.82 89.39,-32.49 84.8,-42.04 91.76,-42.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d48/hamming__distance_8cpp_a65d845df3fecff7087a2126c7b72030b_cgraph_org.svg b/d4/d48/hamming__distance_8cpp_a65d845df3fecff7087a2126c7b72030b_cgraph_org.svg
deleted file mode 100644
index 875a7c93e..000000000
--- a/d4/d48/hamming__distance_8cpp_a65d845df3fecff7087a2126c7b72030b_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: bit_manipulation::hamming_distance::bitCount Pages: 1 -->
-<svg width="140pt" height="57pt"
- viewBox="0.00 0.00 140.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>bit_manipulation::hamming_distance::bitCount</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="132.25,-30.5 0,-30.5 0,0 132.25,0 132.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::hamming</text>
-<text text-anchor="middle" x="66.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_distance::bitCount</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.69,-30.99C37.91,-40.06 45.72,-48.5 66.12,-48.5 77.28,-48.5 84.68,-45.97 88.3,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.76,-42.82 89.39,-32.49 84.8,-42.04 91.76,-42.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d48/hamming__distance_8cpp_abfe6fbb2f3460a2623c96f283178a07a_cgraph.map b/d4/d48/hamming__distance_8cpp_abfe6fbb2f3460a2623c96f283178a07a_cgraph.map
deleted file mode 100644
index efc695529..000000000
--- a/d4/d48/hamming__distance_8cpp_abfe6fbb2f3460a2623c96f283178a07a_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="bit_manipulation::hamming_distance::hamming_distance" name="bit_manipulation::hamming_distance::hamming_distance">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,200,70"/>
-<area shape="rect" id="Node000002" href="$d4/d48/hamming__distance_8cpp.html#a65d845df3fecff7087a2126c7b72030b" title=" " alt="" coords="248,29,424,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="200,47,232,47,232,52,200,52"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="292,29,290,19,297,10,312,5,336,3,361,5,376,11,374,16,360,10,336,8,314,10,300,15,295,21,297,28"/>
-</map>
diff --git a/d4/d48/hamming__distance_8cpp_abfe6fbb2f3460a2623c96f283178a07a_cgraph.md5 b/d4/d48/hamming__distance_8cpp_abfe6fbb2f3460a2623c96f283178a07a_cgraph.md5
deleted file mode 100644
index 0ba06f765..000000000
--- a/d4/d48/hamming__distance_8cpp_abfe6fbb2f3460a2623c96f283178a07a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6d7185d87008d0b8f2bffd8c66de07aa
\ No newline at end of file
diff --git a/d4/d48/hamming__distance_8cpp_abfe6fbb2f3460a2623c96f283178a07a_cgraph.svg b/d4/d48/hamming__distance_8cpp_abfe6fbb2f3460a2623c96f283178a07a_cgraph.svg
deleted file mode 100644
index a71fd4402..000000000
--- a/d4/d48/hamming__distance_8cpp_abfe6fbb2f3460a2623c96f283178a07a_cgraph.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: bit_manipulation::hamming_distance::hamming_distance Pages: 1 -->
-<svg width="322pt" height="57pt"
- viewBox="0.00 0.00 322.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>bit_manipulation::hamming_distance::hamming_distance</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="145.75,-30.5 0,-30.5 0,0 145.75,0 145.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::hamming</text>
-<text text-anchor="middle" x="72.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_distance::hamming_distance</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d48/hamming__distance_8cpp.html#a65d845df3fecff7087a2126c7b72030b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="314,-30.5 181.75,-30.5 181.75,0 314,0 314,-30.5"/>
-<text text-anchor="start" x="189.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::hamming</text>
-<text text-anchor="middle" x="247.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_distance::bitCount</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.24,-15.25C154.08,-15.25 162.08,-15.25 169.97,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.9,-18.75 179.9,-15.25 169.9,-11.75 169.9,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.86,-30.99C210.54,-40.06 220.87,-48.5 247.88,-48.5 262.64,-48.5 272.42,-45.97 277.22,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="280.66,-42.89 278.66,-32.48 273.73,-41.86 280.66,-42.89"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d48/hamming__distance_8cpp_abfe6fbb2f3460a2623c96f283178a07a_cgraph_org.svg b/d4/d48/hamming__distance_8cpp_abfe6fbb2f3460a2623c96f283178a07a_cgraph_org.svg
deleted file mode 100644
index a6891ee1b..000000000
--- a/d4/d48/hamming__distance_8cpp_abfe6fbb2f3460a2623c96f283178a07a_cgraph_org.svg
+++ /dev/null
@@ -1,50 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: bit_manipulation::hamming_distance::hamming_distance Pages: 1 -->
-<svg width="322pt" height="57pt"
- viewBox="0.00 0.00 322.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>bit_manipulation::hamming_distance::hamming_distance</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="145.75,-30.5 0,-30.5 0,0 145.75,0 145.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::hamming</text>
-<text text-anchor="middle" x="72.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_distance::hamming_distance</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d48/hamming__distance_8cpp.html#a65d845df3fecff7087a2126c7b72030b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="314,-30.5 181.75,-30.5 181.75,0 314,0 314,-30.5"/>
-<text text-anchor="start" x="189.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::hamming</text>
-<text text-anchor="middle" x="247.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_distance::bitCount</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.24,-15.25C154.08,-15.25 162.08,-15.25 169.97,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.9,-18.75 179.9,-15.25 169.9,-11.75 169.9,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.86,-30.99C210.54,-40.06 220.87,-48.5 247.88,-48.5 262.64,-48.5 272.42,-45.97 277.22,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="280.66,-42.89 278.66,-32.48 273.73,-41.86 280.66,-42.89"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d48/hamming__distance_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d48/hamming__distance_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 0e20b5019..000000000
--- a/d4/d48/hamming__distance_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,35,87,27,88,33,56,40"/>
-<area shape="rect" id="Node000003" href="$d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function to the test hamming distance." alt="" coords="117,55,160,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,46,102,57,101,62,55,52"/>
-</map>
diff --git a/d4/d48/hamming__distance_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d48/hamming__distance_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 96d2615dc..000000000
--- a/d4/d48/hamming__distance_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8156614d9998c92253f52b2a792b2958
\ No newline at end of file
diff --git a/d4/d48/hamming__distance_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d48/hamming__distance_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index af6570683..000000000
--- a/d4/d48/hamming__distance_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="64pt"
- viewBox="0.00 0.00 134.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-56.25 73,-56.25 73,-37 126.5,-37 126.5,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.64,-33.65 53.16,-35.69 61.53,-37.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.71,-41.1 71.25,-40.03 62.34,-34.3 60.71,-41.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to the test hamming distance.">
-<polygon fill="white" stroke="#666666" points="116,-19.25 83.5,-19.25 83.5,0 116,0 116,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C47.72,-21.22 60.73,-18.26 72.13,-15.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.79,-19.11 81.77,-13.48 71.24,-12.28 72.79,-19.11"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d48/hamming__distance_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/d48/hamming__distance_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 6084cc422..000000000
--- a/d4/d48/hamming__distance_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="64pt"
- viewBox="0.00 0.00 134.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-56.25 73,-56.25 73,-37 126.5,-37 126.5,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.64,-33.65 53.16,-35.69 61.53,-37.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.71,-41.1 71.25,-40.03 62.34,-34.3 60.71,-41.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to the test hamming distance.">
-<polygon fill="white" stroke="#666666" points="116,-19.25 83.5,-19.25 83.5,0 116,0 116,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C47.72,-21.22 60.73,-18.26 72.13,-15.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.79,-19.11 81.77,-13.48 71.24,-12.28 72.79,-19.11"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d48/hamming__distance_8cpp_source.html b/d4/d48/hamming__distance_8cpp_source.html
new file mode 100644
index 000000000..0736e9c73
--- /dev/null
+++ b/d4/d48/hamming__distance_8cpp_source.html
@@ -0,0 +1,211 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: bit_manipulation/hamming_distance.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d48/hamming__distance_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">hamming_distance.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/d48/hamming__distance_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a> {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d4/d1c/namespacehamming__distance.html">hamming_distance</a> {</div>
+<div class="foldopen" id="foldopen00035" data-start="{" data-end="}">
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../d4/d48/hamming__distance_8cpp.html#a65d845df3fecff7087a2126c7b72030b">   35</a></span>uint64_t <a class="code hl_function" href="../../d4/d48/hamming__distance_8cpp.html#a65d845df3fecff7087a2126c7b72030b">bitCount</a>(uint64_t value) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    uint64_t count = 0;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">while</span> (value) {       <span class="comment">// until all bits are zero</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <span class="keywordflow">if</span> (value &amp; 1) {  <span class="comment">// check lower bit</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            count++;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        }</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        value &gt;&gt;= 1;  <span class="comment">// shift bits, removing lower bit</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">return</span> count;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>}</div>
+</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../d4/d48/hamming__distance_8cpp.html#abfe6fbb2f3460a2623c96f283178a07a">   52</a></span>uint64_t <a class="code hl_namespace" href="../../d4/d1c/namespacehamming__distance.html">hamming_distance</a>(uint64_t a, uint64_t b) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../d4/d48/hamming__distance_8cpp.html#a65d845df3fecff7087a2126c7b72030b">bitCount</a>(a ^ b); }</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="foldopen" id="foldopen00060" data-start="{" data-end="}">
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"><a class="line" href="../../d4/d48/hamming__distance_8cpp.html#a40ba9fe8b5df5c268f0c7d677ff2fe80">   60</a></span>uint64_t <a class="code hl_namespace" href="../../d4/d1c/namespacehamming__distance.html">hamming_distance</a>(<span class="keyword">const</span> std::string&amp; a, <span class="keyword">const</span> std::string&amp; b) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    assert(a.size() == b.size());</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordtype">size_t</span> n = a.size();</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    uint64_t count = 0;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        count += (b[i] != a[i]);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">return</span> count;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>}</div>
+</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>}  <span class="comment">// namespace hamming_distance</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>}  <span class="comment">// namespace bit_manipulation</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="foldopen" id="foldopen00076" data-start="{" data-end="}">
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"><a class="line" href="../../d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   76</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    assert(bit_manipulation::hamming_distance::hamming_distance(11, 2) == 2);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    assert(bit_manipulation::hamming_distance::hamming_distance(2, 0) == 1);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    assert(bit_manipulation::hamming_distance::hamming_distance(11, 0) == 3);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    assert(bit_manipulation::hamming_distance::hamming_distance(<span class="stringliteral">&quot;1101&quot;</span>,</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>                                                                <span class="stringliteral">&quot;1111&quot;</span>) == 1);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    assert(bit_manipulation::hamming_distance::hamming_distance(<span class="stringliteral">&quot;1111&quot;</span>,</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>                                                                <span class="stringliteral">&quot;1111&quot;</span>) == 0);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    assert(bit_manipulation::hamming_distance::hamming_distance(<span class="stringliteral">&quot;0000&quot;</span>,</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>                                                                <span class="stringliteral">&quot;1111&quot;</span>) == 4);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    assert(bit_manipulation::hamming_distance::hamming_distance(<span class="stringliteral">&quot;alpha&quot;</span>,</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>                                                                <span class="stringliteral">&quot;alphb&quot;</span>) == 1);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    assert(bit_manipulation::hamming_distance::hamming_distance(<span class="stringliteral">&quot;abcd&quot;</span>,</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>                                                                <span class="stringliteral">&quot;abcd&quot;</span>) == 0);</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    assert(bit_manipulation::hamming_distance::hamming_distance(<span class="stringliteral">&quot;dcba&quot;</span>,</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>                                                                <span class="stringliteral">&quot;abcd&quot;</span>) == 4);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>}</div>
+</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="foldopen" id="foldopen00100" data-start="{" data-end="}">
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"><a class="line" href="../../d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  100</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <a class="code hl_function" href="../../d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();           <span class="comment">// execute the tests</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    uint64_t a = 11;  <span class="comment">// 1011 in binary</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    uint64_t b = 2;   <span class="comment">// 0010 in binary</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hamming distance between &quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; b &lt;&lt; <span class="stringliteral">&quot; is &quot;</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>              &lt;&lt; bit_manipulation::hamming_distance::hamming_distance(a, b)</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>}</div>
+</div>
+<div class="ttc" id="ahamming__distance_8cpp_html_a65d845df3fecff7087a2126c7b72030b"><div class="ttname"><a href="../../d4/d48/hamming__distance_8cpp.html#a65d845df3fecff7087a2126c7b72030b">bit_manipulation::hamming_distance::bitCount</a></div><div class="ttdeci">uint64_t bitCount(uint64_t value)</div><div class="ttdef"><b>Definition</b> <a href="#l00035">hamming_distance.cpp:35</a></div></div>
+<div class="ttc" id="ahamming__distance_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to the test hamming distance.</div><div class="ttdef"><b>Definition</b> <a href="#l00076">hamming_distance.cpp:76</a></div></div>
+<div class="ttc" id="ahamming__distance_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00100">hamming_distance.cpp:100</a></div></div>
+<div class="ttc" id="anamespacebit__manipulation_html"><div class="ttname"><a href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacehamming__distance_html"><div class="ttname"><a href="../../d4/d1c/namespacehamming__distance.html">hamming_distance</a></div><div class="ttdoc">Functions for Hamming distance implementation.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_f3c4fbc4e901afa0a54d0623c5574aa7.html">bit_manipulation</a></li><li class="navelem"><a class="el" href="../../d4/d48/hamming__distance_8cpp.html">hamming_distance.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d4f/stooge__sort_8cpp.html b/d4/d4f/stooge__sort_8cpp.html
index f1d996350..9e73ed27e 100644
--- a/d4/d4f/stooge__sort_8cpp.html
+++ b/d4/d4f/stooge__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/stooge_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/stooge_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,10 +138,12 @@ Include dependency graph for stooge_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/daf/stooge__sort_8cpp__incl.svg" width="351" height="111"><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">
+</div>
+<p><a href="../../d4/d4f/stooge__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:ac23852832437dc68327efe9b1da2d91b" id="r_ac23852832437dc68327efe9b1da2d91b"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac23852832437dc68327efe9b1da2d91b">stoogeSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; *L, size_t i, size_t j)</td></tr>
+<tr class="memitem:ac23852832437dc68327efe9b1da2d91b" id="r_ac23852832437dc68327efe9b1da2d91b"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac23852832437dc68327efe9b1da2d91b">stoogeSort</a> (std::vector&lt; int &gt; *L, size_t i, size_t j)</td></tr>
 <tr class="memdesc:ac23852832437dc68327efe9b1da2d91b"><td class="mdescLeft">&#160;</td><td class="mdescRight">for IO operations  <br /></td></tr>
 <tr class="separator:ac23852832437dc68327efe9b1da2d91b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a1440a7779ac56f47a3f355ce4a8c7da0" id="r_a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a> ()</td></tr>
@@ -147,6 +166,8 @@ Functions</h2></td></tr>
 <li>sort last two thirds of the array</li>
 <li>sort first two thirds of the array It's time complexity is O(n^(log3/log1.5)), which is about O(n^2.7), which makes it to be not the most efficient sorting algorithm on the street on average. Space complexity is O(1). </li>
 </ul>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d4f/stooge__sort_8cpp_source.html">stooge_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -172,24 +193,20 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d4f/stooge__sort_8cpp_source.html#l00079">79</a> of file <a class="el" href="../../d4/d4f/stooge__sort_8cpp_source.html">stooge_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   79</span>           {</div>
 <div class="line"><span class="lineno">   80</span>    <a class="code hl_function" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();</div>
 <div class="line"><span class="lineno">   81</span>    <a class="code hl_function" href="#a0283886819c7c140a023582b7269e2d0">test2</a>();</div>
 <div class="line"><span class="lineno">   82</span>    <a class="code hl_function" href="#a6d0455dd5c30adda100e95f0423c786e">test3</a>();</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/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   85</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   86</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="astooge__sort_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">Function to test sorting algorithm, one element.</div><div class="ttdef"><b>Definition</b> stooge_sort.cpp:57</div></div>
-<div class="ttc" id="astooge__sort_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">Function to test sorting algorithm.</div><div class="ttdef"><b>Definition</b> stooge_sort.cpp:47</div></div>
-<div class="ttc" id="astooge__sort_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">Function to test sorting algorithm, repeating elements.</div><div class="ttdef"><b>Definition</b> stooge_sort.cpp:67</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="448" height="258"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astooge__sort_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">Function to test sorting algorithm, one element.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d4f/stooge__sort_8cpp_source.html#l00057">stooge_sort.cpp:57</a></div></div>
+<div class="ttc" id="astooge__sort_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">Function to test sorting algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d4f/stooge__sort_8cpp_source.html#l00047">stooge_sort.cpp:47</a></div></div>
+<div class="ttc" id="astooge__sort_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">Function to test sorting algorithm, repeating elements.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d4f/stooge__sort_8cpp_source.html#l00067">stooge_sort.cpp:67</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac23852832437dc68327efe9b1da2d91b" name="ac23852832437dc68327efe9b1da2d91b"></a>
@@ -201,7 +218,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void stoogeSort </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; *</td>          <td class="paramname"><span class="paramname"><em>L</em></span>, </td>
+          <td class="paramtype">std::vector&lt; int &gt; *</td>          <td class="paramname"><span class="paramname"><em>L</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -217,7 +234,7 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>for IO operations </p>
-<p>for vector for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></p>
+<p>for vector for assert for std::is_sorted</p>
 <p>The <a class="el" href="#ac23852832437dc68327efe9b1da2d91b" title="for IO operations">stoogeSort()</a> function is used for sorting the array. </p><dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramname">L</td><td>- vector of values (int) to be sorted in in place (ascending order) </td></tr>
@@ -227,12 +244,14 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d4f/stooge__sort_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../d4/d4f/stooge__sort_8cpp_source.html">stooge_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   28</span>                                                       {</div>
 <div class="line"><span class="lineno">   29</span>    <span class="keywordflow">if</span> (i &gt;= j) {</div>
 <div class="line"><span class="lineno">   30</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">   31</span>    }</div>
 <div class="line"><span class="lineno">   32</span>    <span class="keywordflow">if</span> ((*L)[i] &gt; (*L)[j]) {</div>
-<div class="line"><span class="lineno">   33</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>((*L)[i], (*L)[j]);</div>
+<div class="line"><span class="lineno">   33</span>        std::swap((*L)[i], (*L)[j]);</div>
 <div class="line"><span class="lineno">   34</span>    }</div>
 <div class="line"><span class="lineno">   35</span>    <span class="keywordflow">if</span> (j - i &gt; 1) {</div>
 <div class="line"><span class="lineno">   36</span>        <span class="keywordtype">size_t</span> third = (j - i + 1) / 3;</div>
@@ -241,14 +260,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   39</span>        <a class="code hl_function" href="#ac23852832437dc68327efe9b1da2d91b">stoogeSort</a>(L, i, j - third);</div>
 <div class="line"><span class="lineno">   40</span>    }</div>
 <div class="line"><span class="lineno">   41</span>}</div>
-<div class="ttc" id="astooge__sort_8cpp_html_ac23852832437dc68327efe9b1da2d91b"><div class="ttname"><a href="#ac23852832437dc68327efe9b1da2d91b">stoogeSort</a></div><div class="ttdeci">void stoogeSort(std::vector&lt; int &gt; *L, size_t i, size_t j)</div><div class="ttdoc">for IO operations</div><div class="ttdef"><b>Definition</b> stooge_sort.cpp:28</div></div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.svg" width="222" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astooge__sort_8cpp_html_ac23852832437dc68327efe9b1da2d91b"><div class="ttname"><a href="#ac23852832437dc68327efe9b1da2d91b">stoogeSort</a></div><div class="ttdeci">void stoogeSort(std::vector&lt; int &gt; *L, size_t i, size_t j)</div><div class="ttdoc">for IO operations</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d4f/stooge__sort_8cpp_source.html#l00028">stooge_sort.cpp:28</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1440a7779ac56f47a3f355ce4a8c7da0" name="a1440a7779ac56f47a3f355ce4a8c7da0"></a>
@@ -268,22 +281,14 @@ Here is the call graph for this function:</div>
 
 <p>Function to test sorting algorithm. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   47</span>             {</div>
-<div class="line"><span class="lineno">   48</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> L = { 8, 9, 10, 4, 3, 5, 1 };</div>
-<div class="line"><span class="lineno">   49</span>    <a class="code hl_function" href="#ac23852832437dc68327efe9b1da2d91b">stoogeSort</a>(&amp;L, 0, L.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() - 1);</div>
-<div class="line"><span class="lineno">   50</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(L), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(L)));</div>
-<div class="line"><span class="lineno">   51</span>}</div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(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>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg" width="351" height="258"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d4f/stooge__sort_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../d4/d4f/stooge__sort_8cpp_source.html">stooge_sort.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   47</span>             {</div>
+<div class="line"><span class="lineno">   48</span>    std::vector&lt;int&gt; L = { 8, 9, 10, 4, 3, 5, 1 };</div>
+<div class="line"><span class="lineno">   49</span>    <a class="code hl_function" href="#ac23852832437dc68327efe9b1da2d91b">stoogeSort</a>(&amp;L, 0, L.size() - 1);</div>
+<div class="line"><span class="lineno">   50</span>    assert(std::is_sorted(std::begin(L), std::end(L)));</div>
+<div class="line"><span class="lineno">   51</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0283886819c7c140a023582b7269e2d0" name="a0283886819c7c140a023582b7269e2d0"></a>
@@ -303,17 +308,14 @@ Here is the call graph for this function:</div>
 
 <p>Function to test sorting algorithm, one element. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   57</span>             {</div>
-<div class="line"><span class="lineno">   58</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> L = { -1 };</div>
-<div class="line"><span class="lineno">   59</span>    <a class="code hl_function" href="#ac23852832437dc68327efe9b1da2d91b">stoogeSort</a>(&amp;L, 0, L.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() - 1);</div>
-<div class="line"><span class="lineno">   60</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(L), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(L)));</div>
-<div class="line"><span class="lineno">   61</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg" width="351" height="258"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d4f/stooge__sort_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../d4/d4f/stooge__sort_8cpp_source.html">stooge_sort.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   57</span>             {</div>
+<div class="line"><span class="lineno">   58</span>    std::vector&lt;int&gt; L = { -1 };</div>
+<div class="line"><span class="lineno">   59</span>    <a class="code hl_function" href="#ac23852832437dc68327efe9b1da2d91b">stoogeSort</a>(&amp;L, 0, L.size() - 1);</div>
+<div class="line"><span class="lineno">   60</span>    assert(std::is_sorted(std::begin(L), std::end(L)));</div>
+<div class="line"><span class="lineno">   61</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6d0455dd5c30adda100e95f0423c786e" name="a6d0455dd5c30adda100e95f0423c786e"></a>
@@ -333,17 +335,14 @@ Here is the call graph for this function:</div>
 
 <p>Function to test sorting algorithm, repeating elements. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   67</span>             {</div>
-<div class="line"><span class="lineno">   68</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> L = { 1, 2, 5, 4, 1, 5 };</div>
-<div class="line"><span class="lineno">   69</span>    <a class="code hl_function" href="#ac23852832437dc68327efe9b1da2d91b">stoogeSort</a>(&amp;L, 0, L.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() - 1);</div>
-<div class="line"><span class="lineno">   70</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(L), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(L)));</div>
-<div class="line"><span class="lineno">   71</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg" width="351" height="258"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d4f/stooge__sort_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../d4/d4f/stooge__sort_8cpp_source.html">stooge_sort.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   67</span>             {</div>
+<div class="line"><span class="lineno">   68</span>    std::vector&lt;int&gt; L = { 1, 2, 5, 4, 1, 5 };</div>
+<div class="line"><span class="lineno">   69</span>    <a class="code hl_function" href="#ac23852832437dc68327efe9b1da2d91b">stoogeSort</a>(&amp;L, 0, L.size() - 1);</div>
+<div class="line"><span class="lineno">   70</span>    assert(std::is_sorted(std::begin(L), std::end(L)));</div>
+<div class="line"><span class="lineno">   71</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
deleted file mode 100644
index 114631d77..000000000
--- a/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="test2" name="test2">
-<area shape="rect" id="Node000001" title="Function to test sorting algorithm, one element." alt="" coords="5,104,56,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="122,5,200,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="40,102,66,72,102,40,108,36,111,41,105,44,70,75,44,105"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="127,55,196,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,105,112,83,114,88,57,110"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="111,104,212,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,114,95,114,95,120,56,120"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="104,153,219,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="57,124,112,145,110,150,55,129"/>
-<area shape="rect" id="Node000006" href="$d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b" title="for IO operations" alt="" coords="119,227,204,252"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="46,128,106,190,133,214,130,218,102,193,42,132"/>
-<area shape="poly" id="edge6_Node000006_Node000006" title=" " alt="" coords="138,227,134,218,137,209,146,202,161,200,178,203,186,209,183,214,175,208,161,205,148,207,141,212,140,218,143,225"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="267,227,345,252"/>
-<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="204,237,251,237,251,242,204,242"/>
-</map>
diff --git a/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
deleted file mode 100644
index 7d2e3fed4..000000000
--- a/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c223ed38e4dfca591485f3fa5632f4e8
\ No newline at end of file
diff --git a/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
deleted file mode 100644
index c8610384e..000000000
--- a/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
+++ /dev/null
@@ -1,164 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="263pt" height="193pt"
- viewBox="0.00 0.00 263.00 193.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 189.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test sorting algorithm, one element.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-111.25 0,-111.25 0,-92 37.75,-92 37.75,-111.25"/>
-<text text-anchor="middle" x="18.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146.38,-185.25 87.62,-185.25 87.62,-166 146.38,-166 146.38,-185.25"/>
-<text text-anchor="middle" x="117" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.3,-111.5C36.89,-123.7 54.65,-144.45 73.75,-157.62 75.1,-158.56 76.51,-159.46 77.96,-160.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.06,-163.28 86.55,-164.83 79.32,-157.08 76.06,-163.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="142.62,-148.25 91.38,-148.25 91.38,-129 142.62,-129 142.62,-148.25"/>
-<text text-anchor="middle" x="117" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-108.58C49.92,-113.19 66,-119.38 80.46,-124.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.11,-128.17 89.7,-128.5 81.62,-121.64 79.11,-128.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.62,-111.25 79.38,-111.25 79.38,-92 154.62,-92 154.62,-111.25"/>
-<text text-anchor="middle" x="117" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-101.62C46.42,-101.62 56.96,-101.62 67.52,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.38,-105.13 77.38,-101.63 67.38,-98.13 67.38,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-74.25 73.75,-74.25 73.75,-55 160.25,-55 160.25,-74.25"/>
-<text text-anchor="middle" x="117" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-94.67C49.66,-90.16 65.31,-84.14 79.52,-78.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.53,-82.03 88.6,-75.17 78.01,-75.5 80.53,-82.03"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="148.62,-19.25 85.38,-19.25 85.38,0 148.62,0 148.62,-19.25"/>
-<text text-anchor="middle" x="117" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stoogeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.75,-91.83C39.2,-80.42 57.25,-61.16 73.75,-45.62 80.41,-39.36 87.93,-32.79 94.77,-27.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.92,-29.77 102.36,-20.68 92.43,-24.4 96.92,-29.77"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.64,-19.54C94.63,-28.15 99.75,-37.25 117,-37.25 126.43,-37.25 132.24,-34.53 134.42,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.9,-30.22 132.64,-21.03 131.01,-31.5 137.9,-30.22"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255,-19.25 196.25,-19.25 196.25,0 255,0 255,-19.25"/>
-<text text-anchor="middle" x="225.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.84,-9.62C160,-9.62 172.78,-9.62 184.61,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.53,-13.13 194.53,-9.63 184.53,-6.13 184.53,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
deleted file mode 100644
index d27afbb89..000000000
--- a/d4/d4f/stooge__sort_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
+++ /dev/null
@@ -1,138 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="263pt" height="193pt"
- viewBox="0.00 0.00 263.00 193.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 189.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test sorting algorithm, one element.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-111.25 0,-111.25 0,-92 37.75,-92 37.75,-111.25"/>
-<text text-anchor="middle" x="18.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146.38,-185.25 87.62,-185.25 87.62,-166 146.38,-166 146.38,-185.25"/>
-<text text-anchor="middle" x="117" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.3,-111.5C36.89,-123.7 54.65,-144.45 73.75,-157.62 75.1,-158.56 76.51,-159.46 77.96,-160.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.06,-163.28 86.55,-164.83 79.32,-157.08 76.06,-163.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="142.62,-148.25 91.38,-148.25 91.38,-129 142.62,-129 142.62,-148.25"/>
-<text text-anchor="middle" x="117" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-108.58C49.92,-113.19 66,-119.38 80.46,-124.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.11,-128.17 89.7,-128.5 81.62,-121.64 79.11,-128.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.62,-111.25 79.38,-111.25 79.38,-92 154.62,-92 154.62,-111.25"/>
-<text text-anchor="middle" x="117" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-101.62C46.42,-101.62 56.96,-101.62 67.52,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.38,-105.13 77.38,-101.63 67.38,-98.13 67.38,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-74.25 73.75,-74.25 73.75,-55 160.25,-55 160.25,-74.25"/>
-<text text-anchor="middle" x="117" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-94.67C49.66,-90.16 65.31,-84.14 79.52,-78.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.53,-82.03 88.6,-75.17 78.01,-75.5 80.53,-82.03"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="148.62,-19.25 85.38,-19.25 85.38,0 148.62,0 148.62,-19.25"/>
-<text text-anchor="middle" x="117" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stoogeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.75,-91.83C39.2,-80.42 57.25,-61.16 73.75,-45.62 80.41,-39.36 87.93,-32.79 94.77,-27.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.92,-29.77 102.36,-20.68 92.43,-24.4 96.92,-29.77"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.64,-19.54C94.63,-28.15 99.75,-37.25 117,-37.25 126.43,-37.25 132.24,-34.53 134.42,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.9,-30.22 132.64,-21.03 131.01,-31.5 137.9,-30.22"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255,-19.25 196.25,-19.25 196.25,0 255,0 255,-19.25"/>
-<text text-anchor="middle" x="225.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.84,-9.62C160,-9.62 172.78,-9.62 184.61,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.53,-13.13 194.53,-9.63 184.53,-6.13 184.53,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
deleted file mode 100644
index e2a5d6a59..000000000
--- a/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="test1" name="test1">
-<area shape="rect" id="Node000001" title="Function to test sorting algorithm." alt="" coords="5,104,56,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="122,5,200,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="40,102,66,72,102,40,108,36,111,41,105,44,70,75,44,105"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="127,55,196,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,105,112,83,114,88,57,110"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="111,104,212,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,114,95,114,95,120,56,120"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="104,153,219,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="57,124,112,145,110,150,55,129"/>
-<area shape="rect" id="Node000006" href="$d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b" title="for IO operations" alt="" coords="119,227,204,252"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="46,128,106,190,133,214,130,218,102,193,42,132"/>
-<area shape="poly" id="edge6_Node000006_Node000006" title=" " alt="" coords="138,227,134,218,137,209,146,202,161,200,178,203,186,209,183,214,175,208,161,205,148,207,141,212,140,218,143,225"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="267,227,345,252"/>
-<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="204,237,251,237,251,242,204,242"/>
-</map>
diff --git a/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
deleted file mode 100644
index e339e268e..000000000
--- a/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e3143653521375eb3e99c8e3eee4ef27
\ No newline at end of file
diff --git a/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg b/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
deleted file mode 100644
index 5dc99c558..000000000
--- a/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
+++ /dev/null
@@ -1,164 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="263pt" height="193pt"
- viewBox="0.00 0.00 263.00 193.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 189.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test sorting algorithm.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-111.25 0,-111.25 0,-92 37.75,-92 37.75,-111.25"/>
-<text text-anchor="middle" x="18.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146.38,-185.25 87.62,-185.25 87.62,-166 146.38,-166 146.38,-185.25"/>
-<text text-anchor="middle" x="117" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.3,-111.5C36.89,-123.7 54.65,-144.45 73.75,-157.62 75.1,-158.56 76.51,-159.46 77.96,-160.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.06,-163.28 86.55,-164.83 79.32,-157.08 76.06,-163.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="142.62,-148.25 91.38,-148.25 91.38,-129 142.62,-129 142.62,-148.25"/>
-<text text-anchor="middle" x="117" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-108.58C49.92,-113.19 66,-119.38 80.46,-124.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.11,-128.17 89.7,-128.5 81.62,-121.64 79.11,-128.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.62,-111.25 79.38,-111.25 79.38,-92 154.62,-92 154.62,-111.25"/>
-<text text-anchor="middle" x="117" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-101.62C46.42,-101.62 56.96,-101.62 67.52,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.38,-105.13 77.38,-101.63 67.38,-98.13 67.38,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-74.25 73.75,-74.25 73.75,-55 160.25,-55 160.25,-74.25"/>
-<text text-anchor="middle" x="117" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-94.67C49.66,-90.16 65.31,-84.14 79.52,-78.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.53,-82.03 88.6,-75.17 78.01,-75.5 80.53,-82.03"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="148.62,-19.25 85.38,-19.25 85.38,0 148.62,0 148.62,-19.25"/>
-<text text-anchor="middle" x="117" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stoogeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.75,-91.83C39.2,-80.42 57.25,-61.16 73.75,-45.62 80.41,-39.36 87.93,-32.79 94.77,-27.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.92,-29.77 102.36,-20.68 92.43,-24.4 96.92,-29.77"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.64,-19.54C94.63,-28.15 99.75,-37.25 117,-37.25 126.43,-37.25 132.24,-34.53 134.42,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.9,-30.22 132.64,-21.03 131.01,-31.5 137.9,-30.22"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255,-19.25 196.25,-19.25 196.25,0 255,0 255,-19.25"/>
-<text text-anchor="middle" x="225.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.84,-9.62C160,-9.62 172.78,-9.62 184.61,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.53,-13.13 194.53,-9.63 184.53,-6.13 184.53,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
deleted file mode 100644
index e4fd5e725..000000000
--- a/d4/d4f/stooge__sort_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
+++ /dev/null
@@ -1,138 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="263pt" height="193pt"
- viewBox="0.00 0.00 263.00 193.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 189.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test sorting algorithm.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-111.25 0,-111.25 0,-92 37.75,-92 37.75,-111.25"/>
-<text text-anchor="middle" x="18.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146.38,-185.25 87.62,-185.25 87.62,-166 146.38,-166 146.38,-185.25"/>
-<text text-anchor="middle" x="117" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.3,-111.5C36.89,-123.7 54.65,-144.45 73.75,-157.62 75.1,-158.56 76.51,-159.46 77.96,-160.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.06,-163.28 86.55,-164.83 79.32,-157.08 76.06,-163.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="142.62,-148.25 91.38,-148.25 91.38,-129 142.62,-129 142.62,-148.25"/>
-<text text-anchor="middle" x="117" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-108.58C49.92,-113.19 66,-119.38 80.46,-124.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.11,-128.17 89.7,-128.5 81.62,-121.64 79.11,-128.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.62,-111.25 79.38,-111.25 79.38,-92 154.62,-92 154.62,-111.25"/>
-<text text-anchor="middle" x="117" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-101.62C46.42,-101.62 56.96,-101.62 67.52,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.38,-105.13 77.38,-101.63 67.38,-98.13 67.38,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-74.25 73.75,-74.25 73.75,-55 160.25,-55 160.25,-74.25"/>
-<text text-anchor="middle" x="117" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-94.67C49.66,-90.16 65.31,-84.14 79.52,-78.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.53,-82.03 88.6,-75.17 78.01,-75.5 80.53,-82.03"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="148.62,-19.25 85.38,-19.25 85.38,0 148.62,0 148.62,-19.25"/>
-<text text-anchor="middle" x="117" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stoogeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.75,-91.83C39.2,-80.42 57.25,-61.16 73.75,-45.62 80.41,-39.36 87.93,-32.79 94.77,-27.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.92,-29.77 102.36,-20.68 92.43,-24.4 96.92,-29.77"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.64,-19.54C94.63,-28.15 99.75,-37.25 117,-37.25 126.43,-37.25 132.24,-34.53 134.42,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.9,-30.22 132.64,-21.03 131.01,-31.5 137.9,-30.22"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255,-19.25 196.25,-19.25 196.25,0 255,0 255,-19.25"/>
-<text text-anchor="middle" x="225.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.84,-9.62C160,-9.62 172.78,-9.62 184.61,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.53,-13.13 194.53,-9.63 184.53,-6.13 184.53,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map b/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
deleted file mode 100644
index 4fb4d983e..000000000
--- a/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="test3" name="test3">
-<area shape="rect" id="Node000001" title="Function to test sorting algorithm, repeating elements." alt="" coords="5,104,56,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="122,5,200,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="40,102,66,72,102,40,108,36,111,41,105,44,70,75,44,105"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="127,55,196,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,105,112,83,114,88,57,110"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="111,104,212,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,114,95,114,95,120,56,120"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="104,153,219,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="57,124,112,145,110,150,55,129"/>
-<area shape="rect" id="Node000006" href="$d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b" title="for IO operations" alt="" coords="119,227,204,252"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="46,128,106,190,133,214,130,218,102,193,42,132"/>
-<area shape="poly" id="edge6_Node000006_Node000006" title=" " alt="" coords="138,227,134,218,137,209,146,202,161,200,178,203,186,209,183,214,175,208,161,205,148,207,141,212,140,218,143,225"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="267,227,345,252"/>
-<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="204,237,251,237,251,242,204,242"/>
-</map>
diff --git a/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 b/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
deleted file mode 100644
index 016ae8e6b..000000000
--- a/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f006ea9ed65c6dbabbab84c1b56ed201
\ No newline at end of file
diff --git a/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg b/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
deleted file mode 100644
index f0a6dbb78..000000000
--- a/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
+++ /dev/null
@@ -1,164 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<svg width="263pt" height="193pt"
- viewBox="0.00 0.00 263.00 193.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 189.25)">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test sorting algorithm, repeating elements.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-111.25 0,-111.25 0,-92 37.75,-92 37.75,-111.25"/>
-<text text-anchor="middle" x="18.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146.38,-185.25 87.62,-185.25 87.62,-166 146.38,-166 146.38,-185.25"/>
-<text text-anchor="middle" x="117" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.3,-111.5C36.89,-123.7 54.65,-144.45 73.75,-157.62 75.1,-158.56 76.51,-159.46 77.96,-160.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.06,-163.28 86.55,-164.83 79.32,-157.08 76.06,-163.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="142.62,-148.25 91.38,-148.25 91.38,-129 142.62,-129 142.62,-148.25"/>
-<text text-anchor="middle" x="117" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-108.58C49.92,-113.19 66,-119.38 80.46,-124.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.11,-128.17 89.7,-128.5 81.62,-121.64 79.11,-128.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.62,-111.25 79.38,-111.25 79.38,-92 154.62,-92 154.62,-111.25"/>
-<text text-anchor="middle" x="117" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-101.62C46.42,-101.62 56.96,-101.62 67.52,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.38,-105.13 77.38,-101.63 67.38,-98.13 67.38,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-74.25 73.75,-74.25 73.75,-55 160.25,-55 160.25,-74.25"/>
-<text text-anchor="middle" x="117" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-94.67C49.66,-90.16 65.31,-84.14 79.52,-78.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.53,-82.03 88.6,-75.17 78.01,-75.5 80.53,-82.03"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="148.62,-19.25 85.38,-19.25 85.38,0 148.62,0 148.62,-19.25"/>
-<text text-anchor="middle" x="117" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stoogeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.75,-91.83C39.2,-80.42 57.25,-61.16 73.75,-45.62 80.41,-39.36 87.93,-32.79 94.77,-27.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.92,-29.77 102.36,-20.68 92.43,-24.4 96.92,-29.77"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.64,-19.54C94.63,-28.15 99.75,-37.25 117,-37.25 126.43,-37.25 132.24,-34.53 134.42,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.9,-30.22 132.64,-21.03 131.01,-31.5 137.9,-30.22"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255,-19.25 196.25,-19.25 196.25,0 255,0 255,-19.25"/>
-<text text-anchor="middle" x="225.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.84,-9.62C160,-9.62 172.78,-9.62 184.61,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.53,-13.13 194.53,-9.63 184.53,-6.13 184.53,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg b/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
deleted file mode 100644
index 51e08b24e..000000000
--- a/d4/d4f/stooge__sort_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
+++ /dev/null
@@ -1,138 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<svg width="263pt" height="193pt"
- viewBox="0.00 0.00 263.00 193.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 189.25)">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test sorting algorithm, repeating elements.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-111.25 0,-111.25 0,-92 37.75,-92 37.75,-111.25"/>
-<text text-anchor="middle" x="18.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146.38,-185.25 87.62,-185.25 87.62,-166 146.38,-166 146.38,-185.25"/>
-<text text-anchor="middle" x="117" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.3,-111.5C36.89,-123.7 54.65,-144.45 73.75,-157.62 75.1,-158.56 76.51,-159.46 77.96,-160.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.06,-163.28 86.55,-164.83 79.32,-157.08 76.06,-163.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="142.62,-148.25 91.38,-148.25 91.38,-129 142.62,-129 142.62,-148.25"/>
-<text text-anchor="middle" x="117" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-108.58C49.92,-113.19 66,-119.38 80.46,-124.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.11,-128.17 89.7,-128.5 81.62,-121.64 79.11,-128.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.62,-111.25 79.38,-111.25 79.38,-92 154.62,-92 154.62,-111.25"/>
-<text text-anchor="middle" x="117" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-101.62C46.42,-101.62 56.96,-101.62 67.52,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.38,-105.13 77.38,-101.63 67.38,-98.13 67.38,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-74.25 73.75,-74.25 73.75,-55 160.25,-55 160.25,-74.25"/>
-<text text-anchor="middle" x="117" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-94.67C49.66,-90.16 65.31,-84.14 79.52,-78.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.53,-82.03 88.6,-75.17 78.01,-75.5 80.53,-82.03"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="148.62,-19.25 85.38,-19.25 85.38,0 148.62,0 148.62,-19.25"/>
-<text text-anchor="middle" x="117" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stoogeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.75,-91.83C39.2,-80.42 57.25,-61.16 73.75,-45.62 80.41,-39.36 87.93,-32.79 94.77,-27.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.92,-29.77 102.36,-20.68 92.43,-24.4 96.92,-29.77"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.64,-19.54C94.63,-28.15 99.75,-37.25 117,-37.25 126.43,-37.25 132.24,-34.53 134.42,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.9,-30.22 132.64,-21.03 131.01,-31.5 137.9,-30.22"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255,-19.25 196.25,-19.25 196.25,0 255,0 255,-19.25"/>
-<text text-anchor="middle" x="225.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.84,-9.62C160,-9.62 172.78,-9.62 184.61,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.53,-13.13 194.53,-9.63 184.53,-6.13 184.53,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.map b/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.map
deleted file mode 100644
index f3efc7763..000000000
--- a/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="stoogeSort" name="stoogeSort">
-<area shape="rect" id="Node000001" title="for IO operations" alt="" coords="5,29,90,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="25,30,21,21,23,11,32,5,48,3,64,5,72,12,69,16,61,10,47,8,34,10,28,14,26,20,30,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="138,29,216,55"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="90,40,122,40,122,45,90,45"/>
-</map>
diff --git a/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.md5 b/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.md5
deleted file mode 100644
index 6305f9f96..000000000
--- a/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-dd5d968647b0367e8b20d3fd0e91c9db
\ No newline at end of file
diff --git a/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.svg b/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.svg
deleted file mode 100644
index 874e8078d..000000000
--- a/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph.svg
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: stoogeSort Pages: 1 -->
-<svg width="166pt" height="45pt"
- viewBox="0.00 0.00 166.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>stoogeSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="for IO operations">
-<polygon fill="#999999" stroke="#666666" points="63.25,-19.25 0,-19.25 0,0 63.25,0 63.25,-19.25"/>
-<text text-anchor="middle" x="31.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stoogeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M16.44,-19.54C9.51,-28.15 14.57,-37.25 31.62,-37.25 40.95,-37.25 46.69,-34.53 48.84,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="52.32,-30.23 47.08,-21.03 45.44,-31.49 52.32,-30.23"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158,-19.25 99.25,-19.25 99.25,0 158,0 158,-19.25"/>
-<text text-anchor="middle" x="128.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.73,-9.62C71.37,-9.62 79.65,-9.62 87.63,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.51,-13.13 97.51,-9.63 87.51,-6.13 87.51,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph_org.svg b/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph_org.svg
deleted file mode 100644
index dedb65c75..000000000
--- a/d4/d4f/stooge__sort_8cpp_ac23852832437dc68327efe9b1da2d91b_cgraph_org.svg
+++ /dev/null
@@ -1,48 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: stoogeSort Pages: 1 -->
-<svg width="166pt" height="45pt"
- viewBox="0.00 0.00 166.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>stoogeSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="for IO operations">
-<polygon fill="#999999" stroke="#666666" points="63.25,-19.25 0,-19.25 0,0 63.25,0 63.25,-19.25"/>
-<text text-anchor="middle" x="31.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stoogeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M16.44,-19.54C9.51,-28.15 14.57,-37.25 31.62,-37.25 40.95,-37.25 46.69,-34.53 48.84,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="52.32,-30.23 47.08,-21.03 45.44,-31.49 52.32,-30.23"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158,-19.25 99.25,-19.25 99.25,0 158,0 158,-19.25"/>
-<text text-anchor="middle" x="128.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.73,-9.62C71.37,-9.62 79.65,-9.62 87.63,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.51,-13.13 97.51,-9.63 87.51,-6.13 87.51,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 598a914dd..000000000
--- a/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,32 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,128,55,154"/>
-<area shape="rect" id="Node000002" href="$d4/d4f/stooge__sort_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" title="Function to test sorting algorithm." alt="" coords="103,79,153,104"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,126,88,109,90,113,56,131"/>
-<area shape="rect" id="Node000009" href="$d4/d4f/stooge__sort_8cpp.html#a0283886819c7c140a023582b7269e2d0" title="Function to test sorting algorithm, one element." alt="" coords="103,128,153,154"/>
-<area shape="poly" id="edge9_Node000001_Node000009" title=" " alt="" coords="55,138,88,138,88,144,55,144"/>
-<area shape="rect" id="Node000010" href="$d4/d4f/stooge__sort_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" title="Function to test sorting algorithm, repeating elements." alt="" coords="103,177,153,203"/>
-<area shape="poly" id="edge15_Node000001_Node000010" title=" " alt="" coords="56,151,90,168,88,173,54,155"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="220,79,298,104"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,89,204,89,204,94,153,94"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="224,128,293,154"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="154,98,211,120,209,125,152,103"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="208,177,309,203"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="144,103,155,114,177,141,203,164,208,168,205,172,199,168,174,144,151,117,140,107"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="201,227,316,252"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="146,103,155,114,170,142,177,167,185,190,203,214,205,216,202,220,199,217,180,192,172,169,165,144,151,117,142,106"/>
-<area shape="rect" id="Node000007" href="$d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b" title="for IO operations" alt="" coords="216,29,301,55"/>
-<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="152,80,208,58,210,63,154,85"/>
-<area shape="poly" id="edge7_Node000007_Node000007" title=" " alt="" coords="236,30,232,21,234,11,243,5,259,3,275,5,284,12,280,16,273,10,259,8,245,10,238,14,237,20,241,28"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="364,29,443,55"/>
-<area shape="poly" id="edge8_Node000007_Node000008" title=" " alt="" coords="301,40,349,40,349,45,301,45"/>
-<area shape="poly" id="edge10_Node000009_Node000003" title=" " alt="" coords="152,129,208,108,210,113,154,134"/>
-<area shape="poly" id="edge11_Node000009_Node000004" title=" " alt="" coords="153,138,209,138,209,144,153,144"/>
-<area shape="poly" id="edge12_Node000009_Node000005" title=" " alt="" coords="154,148,210,169,208,174,152,153"/>
-<area shape="poly" id="edge13_Node000009_Node000006" title=" " alt="" coords="144,152,155,163,177,190,203,213,208,217,205,221,199,218,174,194,151,167,140,156"/>
-<area shape="poly" id="edge14_Node000009_Node000007" title=" " alt="" coords="140,126,151,115,174,88,199,64,205,60,208,65,203,68,177,92,155,119,144,130"/>
-<area shape="poly" id="edge16_Node000010_Node000003" title=" " alt="" coords="140,175,151,164,174,137,199,113,205,110,208,114,203,118,177,141,155,168,144,179"/>
-<area shape="poly" id="edge17_Node000010_Node000004" title=" " alt="" coords="152,178,209,157,211,162,154,183"/>
-<area shape="poly" id="edge18_Node000010_Node000005" title=" " alt="" coords="153,188,193,188,193,193,153,193"/>
-<area shape="poly" id="edge19_Node000010_Node000006" title=" " alt="" coords="154,197,210,218,208,223,152,202"/>
-<area shape="poly" id="edge20_Node000010_Node000007" title=" " alt="" coords="142,175,151,165,165,137,172,113,180,89,199,64,202,62,205,66,203,68,185,92,177,115,170,139,155,168,146,179"/>
-</map>
diff --git a/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index ed768440f..000000000
--- a/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ac3782b7c5d3c1ff4323d075c1cfcb8c
\ No newline at end of file
diff --git a/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 9b7f58d99..000000000
--- a/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,308 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="336pt" height="193pt"
- viewBox="0.00 0.00 336.00 193.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 189.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-93.25 0,-93.25 0,-74 37,-74 37,-93.25"/>
-<text text-anchor="middle" x="18.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d4f/stooge__sort_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title="Function to test sorting algorithm.">
-<polygon fill="white" stroke="#666666" points="110.75,-130.25 73,-130.25 73,-111 110.75,-111 110.75,-130.25"/>
-<text text-anchor="middle" x="91.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-92.77C44.89,-96.79 54.18,-101.6 62.84,-106.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.11,-109.14 71.6,-110.63 64.33,-102.92 61.11,-109.14"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d4/d4f/stooge__sort_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title="Function to test sorting algorithm, one element.">
-<polygon fill="white" stroke="#666666" points="110.75,-93.25 73,-93.25 73,-74 110.75,-74 110.75,-93.25"/>
-<text text-anchor="middle" x="91.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-83.62C44.55,-83.62 53.37,-83.62 61.69,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-87.13 71.43,-83.63 61.43,-80.13 61.43,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d4/d4f/stooge__sort_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" target="_top" xlink:title="Function to test sorting algorithm, repeating elements.">
-<polygon fill="white" stroke="#666666" points="110.75,-56.25 73,-56.25 73,-37 110.75,-37 110.75,-56.25"/>
-<text text-anchor="middle" x="91.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge15_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge15_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-74.48C44.89,-70.46 54.18,-65.65 62.84,-61.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.33,-64.33 71.6,-56.62 61.11,-58.11 64.33,-64.33"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.38,-130.25 160.62,-130.25 160.62,-111 219.38,-111 219.38,-130.25"/>
-<text text-anchor="middle" x="190" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-120.62C121.72,-120.62 135.83,-120.62 149.09,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.91,-124.13 158.91,-120.63 148.91,-117.13 148.91,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.62,-93.25 164.38,-93.25 164.38,-74 215.62,-74 215.62,-93.25"/>
-<text text-anchor="middle" x="190" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-113.67C122.92,-109.06 139,-102.87 153.46,-97.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.62,-100.61 162.7,-93.75 152.11,-94.08 154.62,-100.61"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.62,-56.25 152.38,-56.25 152.38,-37 227.62,-37 227.62,-56.25"/>
-<text text-anchor="middle" x="190" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.75,-110.76C105.36,-108.13 108.17,-105.28 110.75,-102.62 126.95,-85.93 127.65,-77.91 146.75,-64.62 148.1,-63.69 149.51,-62.78 150.95,-61.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.31,-65.15 159.53,-57.39 149.05,-58.96 152.31,-65.15"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.25,-19.25 146.75,-19.25 146.75,0 233.25,0 233.25,-19.25"/>
-<text text-anchor="middle" x="190" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.72,-110.88C106.21,-108.34 108.72,-105.5 110.75,-102.62 132.07,-72.42 120.03,-53.18 146.75,-27.62 147.38,-27.03 148.03,-26.44 148.7,-25.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.61,-28.81 157.01,-20.37 146.74,-22.98 150.61,-28.81"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="221.62,-167.25 158.38,-167.25 158.38,-148 221.62,-148 221.62,-167.25"/>
-<text text-anchor="middle" x="190" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">stoogeSort</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-127.58C122.66,-132.09 138.31,-138.11 152.52,-143.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.01,-146.75 161.6,-147.08 153.53,-140.22 151.01,-146.75"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.64,-167.54C167.63,-176.15 172.75,-185.25 190,-185.25 199.43,-185.25 205.24,-182.53 207.42,-178.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="210.9,-178.22 205.64,-169.03 204.01,-179.5 210.9,-178.22"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="328,-167.25 269.25,-167.25 269.25,-148 328,-148 328,-167.25"/>
-<text text-anchor="middle" x="298.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge8_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M221.84,-157.62C233,-157.62 245.78,-157.62 257.61,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.53,-161.13 267.53,-157.63 257.53,-154.13 257.53,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge10_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge10_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-90.58C122.66,-95.09 138.31,-101.11 152.52,-106.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.01,-109.75 161.6,-110.08 153.53,-103.22 151.01,-109.75"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node4 -->
-<g id="edge11_Node000009_Node000004" class="edge">
-<title>Node9&#45;&gt;Node4</title>
-<g id="a_edge11_Node000009_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-83.62C122.68,-83.62 138.37,-83.62 152.61,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.6,-87.13 162.6,-83.63 152.6,-80.13 152.6,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge12_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge12_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-76.67C122.66,-72.16 138.31,-66.14 152.52,-60.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.53,-64.03 161.6,-57.17 151.01,-57.5 153.53,-64.03"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node6 -->
-<g id="edge13_Node000009_Node000006" class="edge">
-<title>Node9&#45;&gt;Node6</title>
-<g id="a_edge13_Node000009_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.75,-73.76C105.36,-71.13 108.17,-68.28 110.75,-65.62 126.95,-48.93 127.65,-40.91 146.75,-27.62 148.1,-26.69 149.51,-25.78 150.95,-24.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.31,-28.15 159.53,-20.39 149.05,-21.96 152.31,-28.15"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge14_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge14_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.75,-93.49C105.36,-96.12 108.17,-98.97 110.75,-101.62 126.95,-118.32 127.65,-126.34 146.75,-139.62 148.1,-140.56 149.51,-141.47 150.95,-142.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.05,-145.29 159.53,-146.86 152.31,-139.1 149.05,-145.29"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node3 -->
-<g id="edge16_Node000010_Node000003" class="edge">
-<title>Node10&#45;&gt;Node3</title>
-<g id="a_edge16_Node000010_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.75,-56.49C105.36,-59.12 108.17,-61.97 110.75,-64.62 126.95,-81.32 127.65,-89.34 146.75,-102.62 148.1,-103.56 149.51,-104.47 150.95,-105.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.05,-108.29 159.53,-109.86 152.31,-102.1 149.05,-108.29"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node4 -->
-<g id="edge17_Node000010_Node000004" class="edge">
-<title>Node10&#45;&gt;Node4</title>
-<g id="a_edge17_Node000010_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-53.58C122.92,-58.19 139,-64.38 153.46,-69.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.11,-73.17 162.7,-73.5 154.62,-66.64 152.11,-73.17"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node5 -->
-<g id="edge18_Node000010_Node000005" class="edge">
-<title>Node10&#45;&gt;Node5</title>
-<g id="a_edge18_Node000010_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-46.62C119.42,-46.62 129.96,-46.62 140.52,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.38,-50.13 150.38,-46.63 140.38,-43.13 140.38,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node6 -->
-<g id="edge19_Node000010_Node000006" class="edge">
-<title>Node10&#45;&gt;Node6</title>
-<g id="a_edge19_Node000010_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-39.67C122.66,-35.16 138.31,-29.14 152.52,-23.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.53,-27.03 161.6,-20.17 151.01,-20.5 153.53,-27.03"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node7 -->
-<g id="edge20_Node000010_Node000007" class="edge">
-<title>Node10&#45;&gt;Node7</title>
-<g id="a_edge20_Node000010_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.72,-56.37C106.21,-58.91 108.72,-61.75 110.75,-64.62 132.07,-94.83 120.03,-114.07 146.75,-139.62 147.38,-140.22 148.03,-140.81 148.7,-141.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.74,-144.27 157.01,-146.88 150.61,-138.44 146.74,-144.27"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 9a354162c..000000000
--- a/d4/d4f/stooge__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,282 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="336pt" height="193pt"
- viewBox="0.00 0.00 336.00 193.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 189.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-93.25 0,-93.25 0,-74 37,-74 37,-93.25"/>
-<text text-anchor="middle" x="18.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d4f/stooge__sort_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title="Function to test sorting algorithm.">
-<polygon fill="white" stroke="#666666" points="110.75,-130.25 73,-130.25 73,-111 110.75,-111 110.75,-130.25"/>
-<text text-anchor="middle" x="91.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-92.77C44.89,-96.79 54.18,-101.6 62.84,-106.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.11,-109.14 71.6,-110.63 64.33,-102.92 61.11,-109.14"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d4/d4f/stooge__sort_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title="Function to test sorting algorithm, one element.">
-<polygon fill="white" stroke="#666666" points="110.75,-93.25 73,-93.25 73,-74 110.75,-74 110.75,-93.25"/>
-<text text-anchor="middle" x="91.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-83.62C44.55,-83.62 53.37,-83.62 61.69,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-87.13 71.43,-83.63 61.43,-80.13 61.43,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d4/d4f/stooge__sort_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" target="_top" xlink:title="Function to test sorting algorithm, repeating elements.">
-<polygon fill="white" stroke="#666666" points="110.75,-56.25 73,-56.25 73,-37 110.75,-37 110.75,-56.25"/>
-<text text-anchor="middle" x="91.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge15_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge15_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-74.48C44.89,-70.46 54.18,-65.65 62.84,-61.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.33,-64.33 71.6,-56.62 61.11,-58.11 64.33,-64.33"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.38,-130.25 160.62,-130.25 160.62,-111 219.38,-111 219.38,-130.25"/>
-<text text-anchor="middle" x="190" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-120.62C121.72,-120.62 135.83,-120.62 149.09,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.91,-124.13 158.91,-120.63 148.91,-117.13 148.91,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.62,-93.25 164.38,-93.25 164.38,-74 215.62,-74 215.62,-93.25"/>
-<text text-anchor="middle" x="190" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-113.67C122.92,-109.06 139,-102.87 153.46,-97.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.62,-100.61 162.7,-93.75 152.11,-94.08 154.62,-100.61"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.62,-56.25 152.38,-56.25 152.38,-37 227.62,-37 227.62,-56.25"/>
-<text text-anchor="middle" x="190" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.75,-110.76C105.36,-108.13 108.17,-105.28 110.75,-102.62 126.95,-85.93 127.65,-77.91 146.75,-64.62 148.1,-63.69 149.51,-62.78 150.95,-61.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.31,-65.15 159.53,-57.39 149.05,-58.96 152.31,-65.15"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.25,-19.25 146.75,-19.25 146.75,0 233.25,0 233.25,-19.25"/>
-<text text-anchor="middle" x="190" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.72,-110.88C106.21,-108.34 108.72,-105.5 110.75,-102.62 132.07,-72.42 120.03,-53.18 146.75,-27.62 147.38,-27.03 148.03,-26.44 148.7,-25.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.61,-28.81 157.01,-20.37 146.74,-22.98 150.61,-28.81"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="221.62,-167.25 158.38,-167.25 158.38,-148 221.62,-148 221.62,-167.25"/>
-<text text-anchor="middle" x="190" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">stoogeSort</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-127.58C122.66,-132.09 138.31,-138.11 152.52,-143.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.01,-146.75 161.6,-147.08 153.53,-140.22 151.01,-146.75"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.64,-167.54C167.63,-176.15 172.75,-185.25 190,-185.25 199.43,-185.25 205.24,-182.53 207.42,-178.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="210.9,-178.22 205.64,-169.03 204.01,-179.5 210.9,-178.22"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="328,-167.25 269.25,-167.25 269.25,-148 328,-148 328,-167.25"/>
-<text text-anchor="middle" x="298.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge8_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M221.84,-157.62C233,-157.62 245.78,-157.62 257.61,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.53,-161.13 267.53,-157.63 257.53,-154.13 257.53,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge10_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge10_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-90.58C122.66,-95.09 138.31,-101.11 152.52,-106.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.01,-109.75 161.6,-110.08 153.53,-103.22 151.01,-109.75"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node4 -->
-<g id="edge11_Node000009_Node000004" class="edge">
-<title>Node9&#45;&gt;Node4</title>
-<g id="a_edge11_Node000009_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-83.62C122.68,-83.62 138.37,-83.62 152.61,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.6,-87.13 162.6,-83.63 152.6,-80.13 152.6,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge12_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge12_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-76.67C122.66,-72.16 138.31,-66.14 152.52,-60.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.53,-64.03 161.6,-57.17 151.01,-57.5 153.53,-64.03"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node6 -->
-<g id="edge13_Node000009_Node000006" class="edge">
-<title>Node9&#45;&gt;Node6</title>
-<g id="a_edge13_Node000009_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.75,-73.76C105.36,-71.13 108.17,-68.28 110.75,-65.62 126.95,-48.93 127.65,-40.91 146.75,-27.62 148.1,-26.69 149.51,-25.78 150.95,-24.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.31,-28.15 159.53,-20.39 149.05,-21.96 152.31,-28.15"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge14_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge14_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.75,-93.49C105.36,-96.12 108.17,-98.97 110.75,-101.62 126.95,-118.32 127.65,-126.34 146.75,-139.62 148.1,-140.56 149.51,-141.47 150.95,-142.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.05,-145.29 159.53,-146.86 152.31,-139.1 149.05,-145.29"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node3 -->
-<g id="edge16_Node000010_Node000003" class="edge">
-<title>Node10&#45;&gt;Node3</title>
-<g id="a_edge16_Node000010_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.75,-56.49C105.36,-59.12 108.17,-61.97 110.75,-64.62 126.95,-81.32 127.65,-89.34 146.75,-102.62 148.1,-103.56 149.51,-104.47 150.95,-105.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.05,-108.29 159.53,-109.86 152.31,-102.1 149.05,-108.29"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node4 -->
-<g id="edge17_Node000010_Node000004" class="edge">
-<title>Node10&#45;&gt;Node4</title>
-<g id="a_edge17_Node000010_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-53.58C122.92,-58.19 139,-64.38 153.46,-69.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.11,-73.17 162.7,-73.5 154.62,-66.64 152.11,-73.17"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node5 -->
-<g id="edge18_Node000010_Node000005" class="edge">
-<title>Node10&#45;&gt;Node5</title>
-<g id="a_edge18_Node000010_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-46.62C119.42,-46.62 129.96,-46.62 140.52,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.38,-50.13 150.38,-46.63 140.38,-43.13 140.38,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node6 -->
-<g id="edge19_Node000010_Node000006" class="edge">
-<title>Node10&#45;&gt;Node6</title>
-<g id="a_edge19_Node000010_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-39.67C122.66,-35.16 138.31,-29.14 152.52,-23.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.53,-27.03 161.6,-20.17 151.01,-20.5 153.53,-27.03"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node7 -->
-<g id="edge20_Node000010_Node000007" class="edge">
-<title>Node10&#45;&gt;Node7</title>
-<g id="a_edge20_Node000010_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.72,-56.37C106.21,-58.91 108.72,-61.75 110.75,-64.62 132.07,-94.83 120.03,-114.07 146.75,-139.62 147.38,-140.22 148.03,-140.81 148.7,-141.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.74,-144.27 157.01,-146.88 150.61,-138.44 146.74,-144.27"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d4f/stooge__sort_8cpp_source.html b/d4/d4f/stooge__sort_8cpp_source.html
new file mode 100644
index 000000000..94ccc8aa4
--- /dev/null
+++ b/d4/d4f/stooge__sort_8cpp_source.html
@@ -0,0 +1,199 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/stooge_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d4f/stooge__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">stooge_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/d4f/stooge__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;vector&gt;</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;cassert&gt;</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="foldopen" id="foldopen00028" data-start="{" data-end="}">
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"><a class="line" href="../../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b">   28</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b">stoogeSort</a>(std::vector&lt;int&gt;* L, <span class="keywordtype">size_t</span> i, <span class="keywordtype">size_t</span> j) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordflow">if</span> (i &gt;= j) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    }</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordflow">if</span> ((*L)[i] &gt; (*L)[j]) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        std::swap((*L)[i], (*L)[j]);</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    }</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordflow">if</span> (j - i &gt; 1) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        <span class="keywordtype">size_t</span> third = (j - i + 1) / 3;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        <a class="code hl_function" href="../../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b">stoogeSort</a>(L, i, j - third);</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <a class="code hl_function" href="../../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b">stoogeSort</a>(L, i + third, j);</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        <a class="code hl_function" href="../../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b">stoogeSort</a>(L, i, j - third);</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    }</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>}</div>
+</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="foldopen" id="foldopen00047" data-start="{" data-end="}">
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="../../d4/d4f/stooge__sort_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">   47</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d4f/stooge__sort_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>() {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    std::vector&lt;int&gt; L = { 8, 9, 10, 4, 3, 5, 1 };</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <a class="code hl_function" href="../../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b">stoogeSort</a>(&amp;L, 0, L.size() - 1);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    assert(std::is_sorted(std::begin(L), std::end(L)));</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>}</div>
+</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="foldopen" id="foldopen00057" data-start="{" data-end="}">
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="../../d4/d4f/stooge__sort_8cpp.html#a0283886819c7c140a023582b7269e2d0">   57</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d4f/stooge__sort_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>() {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    std::vector&lt;int&gt; L = { -1 };</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <a class="code hl_function" href="../../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b">stoogeSort</a>(&amp;L, 0, L.size() - 1);</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    assert(std::is_sorted(std::begin(L), std::end(L)));</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>}</div>
+</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="foldopen" id="foldopen00067" data-start="{" data-end="}">
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../d4/d4f/stooge__sort_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">   67</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d4f/stooge__sort_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a>() {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    std::vector&lt;int&gt; L = { 1, 2, 5, 4, 1, 5 };</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <a class="code hl_function" href="../../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b">stoogeSort</a>(&amp;L, 0, L.size() - 1);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    assert(std::is_sorted(std::begin(L), std::end(L)));</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>}</div>
+</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="foldopen" id="foldopen00079" data-start="{" data-end="}">
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="../../d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   79</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <a class="code hl_function" href="../../d4/d4f/stooge__sort_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <a class="code hl_function" href="../../d4/d4f/stooge__sort_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>();</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <a class="code hl_function" href="../../d4/d4f/stooge__sort_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a>();</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>}</div>
+</div>
+<div class="ttc" id="astooge__sort_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../d4/d4f/stooge__sort_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">Function to test sorting algorithm, one element.</div><div class="ttdef"><b>Definition</b> <a href="#l00057">stooge_sort.cpp:57</a></div></div>
+<div class="ttc" id="astooge__sort_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d4/d4f/stooge__sort_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">Function to test sorting algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00047">stooge_sort.cpp:47</a></div></div>
+<div class="ttc" id="astooge__sort_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d4/d4f/stooge__sort_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">Function to test sorting algorithm, repeating elements.</div><div class="ttdef"><b>Definition</b> <a href="#l00067">stooge_sort.cpp:67</a></div></div>
+<div class="ttc" id="astooge__sort_8cpp_html_ac23852832437dc68327efe9b1da2d91b"><div class="ttname"><a href="../../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b">stoogeSort</a></div><div class="ttdeci">void stoogeSort(std::vector&lt; int &gt; *L, size_t i, size_t j)</div><div class="ttdoc">for IO operations</div><div class="ttdef"><b>Definition</b> <a href="#l00028">stooge_sort.cpp:28</a></div></div>
+<div class="ttc" id="astooge__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00079">stooge_sort.cpp:79</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d4/d4f/stooge__sort_8cpp.html">stooge_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.map b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.map
index e1baff9f2..5433b638c 100644
--- a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.map
+++ b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.map
@@ -1,17 +1,17 @@
 <map id="others::Cache::LFUCache&lt; K, V &gt;" name="others::Cache::LFUCache&lt; K, V &gt;">
 <area shape="rect" id="Node000001" title="LFUCache." alt="" coords="949,77,1123,118"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map.html" title=" " alt="" coords="668,17,829,87"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="668,17,829,87"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="845,64,949,81,948,86,844,70"/>
 <area shape="rect" id="Node000003" title=" " alt="" coords="5,22,44,47"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="59,21,67,20,97,20,326,18,427,19,556,25,668,37,667,43,555,31,427,24,326,23,97,25,68,25,60,27"/>
 <area shape="rect" id="Node000005" href="$de/d21/classothers_1_1_cache_1_1_d___node.html" title=" " alt="" coords="121,48,280,88"/>
 <area shape="poly" id="edge5_Node000005_Node000003" title=" " alt="" coords="59,38,121,50,120,55,58,43"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair.html" title=" " alt="" coords="402,40,555,96"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="402,40,555,96"/>
 <area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="571,60,667,54,668,59,571,65"/>
 <area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="296,65,402,65,402,71,296,71"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair.html" title=" " alt="" coords="402,119,555,190"/>
+<area shape="rect" id="Node000007" title=" " alt="" coords="402,119,555,190"/>
 <area shape="poly" id="edge8_Node000007_Node000005" title=" " alt="" coords="276,91,305,101,402,130,401,135,303,106,274,96"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map.html" title=" " alt="" coords="660,112,837,197"/>
+<area shape="rect" id="Node000006" title=" " alt="" coords="660,112,837,197"/>
 <area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="851,131,948,112,949,117,853,137"/>
 <area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="571,152,660,152,660,157,571,157"/>
 </map>
diff --git a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.md5 b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.md5
index e26e027b1..0bcf7fa04 100644
--- a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.md5
+++ b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.md5
@@ -1 +1 @@
-6ac5b9d32a99a7471b8fdd6c74403344
\ No newline at end of file
+54a5d646e4613c69cba1946caf09977f
\ No newline at end of file
diff --git a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.svg b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.svg
index 4b8b24640..5e7d9980c 100644
--- a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.svg
+++ b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph.svg
@@ -68,7 +68,7 @@ var sectionId = 'dynsection-0';
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="617.92,-135.62 496.92,-135.62 496.92,-82.62 617.92,-82.62 617.92,-135.62"/>
 <text text-anchor="start" x="504.92" y="-122.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
 <text text-anchor="start" x="504.92" y="-110.88" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, std::pair&lt; others</text>
@@ -129,7 +129,7 @@ var sectionId = 'dynsection-0';
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="412.55,-118 297.55,-118 297.55,-76.25 412.55,-76.25 412.55,-118"/>
 <text text-anchor="start" x="305.55" y="-104.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::pair&lt; others::</text>
 <text text-anchor="start" x="305.55" y="-93.25" font-family="Helvetica,sans-Serif" font-size="10.00">Cache::D_Node&lt; K, V</text>
@@ -160,7 +160,7 @@ var sectionId = 'dynsection-0';
 <!-- Node7 -->
 <g id="Node000007" class="node">
 <title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair.html" xlink:title=" ">
+<g id="a_Node000007"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="412.55,-58.62 297.55,-58.62 297.55,-5.62 412.55,-5.62 412.55,-58.62"/>
 <text text-anchor="start" x="305.55" y="-45.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::pair&lt; others::</text>
 <text text-anchor="start" x="305.55" y="-33.88" font-family="Helvetica,sans-Serif" font-size="10.00">Cache::D_Node&lt; K, V</text>
@@ -183,7 +183,7 @@ var sectionId = 'dynsection-0';
 <!-- Node6 -->
 <g id="Node000006" class="node">
 <title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map.html" xlink:title=" ">
+<g id="a_Node000006"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="623.55,-64.25 491.3,-64.25 491.3,0 623.55,0 623.55,-64.25"/>
 <text text-anchor="start" x="499.3" y="-50.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
 <text text-anchor="start" x="499.3" y="-39.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int, std::pair&lt; others</text>
diff --git a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph_org.svg b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph_org.svg
index 4d935beca..22bf8a5b6 100644
--- a/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph_org.svg
+++ b/d4/d53/classothers_1_1_cache_1_1_l_f_u_cache__coll__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="617.92,-135.62 496.92,-135.62 496.92,-82.62 617.92,-82.62 617.92,-135.62"/>
 <text text-anchor="start" x="504.92" y="-122.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
 <text text-anchor="start" x="504.92" y="-110.88" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; K, std::pair&lt; others</text>
@@ -82,7 +82,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="412.55,-118 297.55,-118 297.55,-76.25 412.55,-76.25 412.55,-118"/>
 <text text-anchor="start" x="305.55" y="-104.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::pair&lt; others::</text>
 <text text-anchor="start" x="305.55" y="-93.25" font-family="Helvetica,sans-Serif" font-size="10.00">Cache::D_Node&lt; K, V</text>
@@ -113,7 +113,7 @@
 <!-- Node7 -->
 <g id="Node000007" class="node">
 <title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair.html" xlink:title=" ">
+<g id="a_Node000007"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="412.55,-58.62 297.55,-58.62 297.55,-5.62 412.55,-5.62 412.55,-58.62"/>
 <text text-anchor="start" x="305.55" y="-45.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::pair&lt; others::</text>
 <text text-anchor="start" x="305.55" y="-33.88" font-family="Helvetica,sans-Serif" font-size="10.00">Cache::D_Node&lt; K, V</text>
@@ -136,7 +136,7 @@
 <!-- Node6 -->
 <g id="Node000006" class="node">
 <title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map.html" xlink:title=" ">
+<g id="a_Node000006"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="623.55,-64.25 491.3,-64.25 491.3,0 623.55,0 623.55,-64.25"/>
 <text text-anchor="start" x="499.3" y="-50.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
 <text text-anchor="start" x="499.3" y="-39.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int, std::pair&lt; others</text>
diff --git a/d4/d68/qr__decompose_8h.html b/d4/d68/qr__decompose_8h.html
index c78077bf2..f7c419a35 100644
--- a/d4/d68/qr__decompose_8h.html
+++ b/d4/d68/qr__decompose_8h.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/qr_decompose.h File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/qr_decompose.h File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -142,27 +159,29 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:adfbdf47277c8cfee229b05b72f1f7834" id="r_adfbdf47277c8cfee229b05b72f1f7834"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:adfbdf47277c8cfee229b05b72f1f7834"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834">qr_algorithm::operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; const &amp;v)</td></tr>
+<tr class="memitem:adfbdf47277c8cfee229b05b72f1f7834"><td class="memTemplItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834">qr_algorithm::operator&lt;&lt;</a> (std::ostream &amp;out, std::valarray&lt; std::valarray&lt; T &gt; &gt; const &amp;v)</td></tr>
 <tr class="separator:adfbdf47277c8cfee229b05b72f1f7834"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a257425cb2365359da51c6fe6741834d8" id="r_a257425cb2365359da51c6fe6741834d8"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a257425cb2365359da51c6fe6741834d8"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d2/d3b/namespaceqr__algorithm.html#a257425cb2365359da51c6fe6741834d8">qr_algorithm::operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; const &amp;v)</td></tr>
+<tr class="memitem:a257425cb2365359da51c6fe6741834d8"><td class="memTemplItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d2/d3b/namespaceqr__algorithm.html#a257425cb2365359da51c6fe6741834d8">qr_algorithm::operator&lt;&lt;</a> (std::ostream &amp;out, std::valarray&lt; T &gt; const &amp;v)</td></tr>
 <tr class="separator:a257425cb2365359da51c6fe6741834d8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a8ea313a1a1b5f9d0e3e332c29c6446ec" id="r_a8ea313a1a1b5f9d0e3e332c29c6446ec"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a8ea313a1a1b5f9d0e3e332c29c6446ec"><td class="memTemplItemLeft" align="right" valign="top">double&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec">qr_algorithm::vector_dot</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;a, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;b)</td></tr>
+<tr class="memitem:a8ea313a1a1b5f9d0e3e332c29c6446ec"><td class="memTemplItemLeft" align="right" valign="top">double&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec">qr_algorithm::vector_dot</a> (const std::valarray&lt; T &gt; &amp;a, const std::valarray&lt; T &gt; &amp;b)</td></tr>
 <tr class="separator:a8ea313a1a1b5f9d0e3e332c29c6446ec"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ad16da2183db22378435042f26af43d5f" id="r_ad16da2183db22378435042f26af43d5f"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ad16da2183db22378435042f26af43d5f"><td class="memTemplItemLeft" align="right" valign="top">double&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f">qr_algorithm::vector_mag</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;a)</td></tr>
+<tr class="memitem:ad16da2183db22378435042f26af43d5f"><td class="memTemplItemLeft" align="right" valign="top">double&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f">qr_algorithm::vector_mag</a> (const std::valarray&lt; T &gt; &amp;a)</td></tr>
 <tr class="separator:ad16da2183db22378435042f26af43d5f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a6d3c7dce1f142141f509d09f6c0e25dc" id="r_a6d3c7dce1f142141f509d09f6c0e25dc"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a6d3c7dce1f142141f509d09f6c0e25dc"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc">qr_algorithm::vector_proj</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;a, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;b)</td></tr>
+<tr class="memitem:a6d3c7dce1f142141f509d09f6c0e25dc"><td class="memTemplItemLeft" align="right" valign="top">std::valarray&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc">qr_algorithm::vector_proj</a> (const std::valarray&lt; T &gt; &amp;a, const std::valarray&lt; T &gt; &amp;b)</td></tr>
 <tr class="separator:a6d3c7dce1f142141f509d09f6c0e25dc"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a73ce637634fc49e1d10d190eb388ebf1" id="r_a73ce637634fc49e1d10d190eb388ebf1"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a73ce637634fc49e1d10d190eb388ebf1"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1">qr_algorithm::qr_decompose</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; *Q, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; *R)</td></tr>
+<tr class="memitem:a73ce637634fc49e1d10d190eb388ebf1"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1">qr_algorithm::qr_decompose</a> (const std::valarray&lt; std::valarray&lt; T &gt; &gt; &amp;A, std::valarray&lt; std::valarray&lt; T &gt; &gt; *Q, std::valarray&lt; std::valarray&lt; T &gt; &gt; *R)</td></tr>
 <tr class="separator:a73ce637634fc49e1d10d190eb388ebf1"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Library functions to compute <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> of a given matrix. </p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d68/qr__decompose_8h_source.html">qr_decompose.h</a>.</p>
 </div></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/d4/d68/qr__decompose_8h_source.html b/d4/d68/qr__decompose_8h_source.html
index 83f543006..21ea5a5fd 100644
--- a/d4/d68/qr__decompose_8h_source.html
+++ b/d4/d68/qr__decompose_8h_source.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/qr_decompose.h Source File</title>
+<title>TheAlgorithms/C++: numerical_methods/qr_decompose.h Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -107,14 +124,7 @@ $(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','../../'); initRe
   <div class="headertitle"><div class="title">qr_decompose.h</div></div>
 </div><!--header-->
 <div class="contents">
-<a href="../../d4/d68/qr__decompose_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * @file</span></div>
-<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * \brief Library functions to compute [QR</span></div>
-<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * decomposition](https://en.wikipedia.org/wiki/QR_decomposition) of a given</span></div>
-<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * matrix.</span></div>
-<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> * \author [Krishna Vedala](https://github.com/kvedala)</span></div>
-<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> */</span></div>
-<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<a href="../../d4/d68/qr__decompose_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
 <div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#ifndef NUMERICAL_METHODS_QR_DECOMPOSE_H_</span></div>
 <div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#define NUMERICAL_METHODS_QR_DECOMPOSE_H_</span></div>
 <div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
@@ -128,105 +138,70 @@ $(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','../../'); initRe
 <div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#ifdef _OPENMP</span></div>
 <div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;omp.h&gt;</span></div>
 <div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#endif</span></div>
-<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"></span> </div>
-<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"><a class="line" href="../../d2/d3b/namespaceqr__algorithm.html">   23</a></span><span class="comment">/** \namespace qr_algorithm</span></div>
-<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment"> * \brief Functions to compute [QR</span></div>
-<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment"> * decomposition](https://en.wikipedia.org/wiki/QR_decomposition) of any</span></div>
-<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment"> * rectangular matrix</span></div>
-<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment"> */</span></div>
-<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/d3b/namespaceqr__algorithm.html">qr_algorithm</a> {<span class="comment"></span></div>
-<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment"> * operator to print a matrix</span></div>
-<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/d3b/namespaceqr__algorithm.html">qr_algorithm</a> {</div>
 <div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00033" data-start="{" data-end="}">
-<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834">   33</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;<a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834">operator&lt;&lt;</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out,</div>
-<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>                         <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; <span class="keyword">const</span> &amp;v) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834">   33</a></span>std::ostream &amp;<a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834">operator&lt;&lt;</a>(std::ostream &amp;out,</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>                         std::valarray&lt;std::valarray&lt;T&gt;&gt; <span class="keyword">const</span> &amp;v) {</div>
 <div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> width = 12;</div>
 <div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keyword">const</span> <span class="keywordtype">char</span> separator = <span class="charliteral">&#39; &#39;</span>;</div>
 <div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
-<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    out.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">precision</a>(4);</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    out.precision(4);</div>
 <div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; v.size(); row++) {</div>
 <div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; v[row].size(); col++)</div>
-<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>            out &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::right</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(width) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">std::setfill</a>(separator)</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>            out &lt;&lt; std::right &lt;&lt; std::setw(width) &lt;&lt; std::setfill(separator)</div>
 <div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>                &lt;&lt; v[row][col];</div>
-<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        out &lt;&lt; <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"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        out &lt;&lt; std::endl;</div>
 <div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    }</div>
 <div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
 <div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keywordflow">return</span> out;</div>
 <div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>}</div>
 </div>
-<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="comment"></span> </div>
-<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="comment"> * operator to print a vector</span></div>
-<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
 <div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00053" data-start="{" data-end="}">
-<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../d2/d3b/namespaceqr__algorithm.html#a257425cb2365359da51c6fe6741834d8">   53</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;<a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834">operator&lt;&lt;</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> <span class="keyword">const</span> &amp;v) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../d2/d3b/namespaceqr__algorithm.html#a257425cb2365359da51c6fe6741834d8">   53</a></span>std::ostream &amp;<a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834">operator&lt;&lt;</a>(std::ostream &amp;out, std::valarray&lt;T&gt; <span class="keyword">const</span> &amp;v) {</div>
 <div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> width = 10;</div>
 <div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keyword">const</span> <span class="keywordtype">char</span> separator = <span class="charliteral">&#39; &#39;</span>;</div>
 <div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
-<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    out.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">precision</a>(4);</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    out.precision(4);</div>
 <div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; v.size(); row++) {</div>
-<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        out &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::right</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(width) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">std::setfill</a>(separator)</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        out &lt;&lt; std::right &lt;&lt; std::setw(width) &lt;&lt; std::setfill(separator)</div>
 <div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            &lt;&lt; v[row];</div>
 <div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    }</div>
 <div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
 <div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordflow">return</span> out;</div>
 <div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>}</div>
 </div>
-<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="comment"></span> </div>
-<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="comment"> * Compute dot product of two vectors of equal lengths</span></div>
-<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span><span class="comment"> *</span></div>
-<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="comment"> * If \f$\vec{a}=\left[a_0,a_1,a_2,...,a_L\right]\f$ and</span></div>
-<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="comment"> * \f$\vec{b}=\left[b_0,b_1,b_1,...,b_L\right]\f$ then</span></div>
-<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="comment"> * \f$\vec{a}\cdot\vec{b}=\displaystyle\sum_{i=0}^L a_i\times b_i\f$</span></div>
-<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="comment"> *</span></div>
-<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span><span class="comment"> * \returns \f$\vec{a}\cdot\vec{b}\f$</span></div>
-<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
 <div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00076" data-start="{" data-end="}">
-<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"><a class="line" href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec">   76</a></span><span class="keyword">inline</span> <span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec">vector_dot</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> &amp;a, <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> &amp;b) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"><a class="line" href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec">   76</a></span><span class="keyword">inline</span> <span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec">vector_dot</a>(<span class="keyword">const</span> std::valarray&lt;T&gt; &amp;a, <span class="keyword">const</span> std::valarray&lt;T&gt; &amp;b) {</div>
 <div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="keywordflow">return</span> (a * b).sum();</div>
 <div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="comment">// could also use following</span></div>
 <div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="comment">// return std::inner_product(std::begin(a), std::end(a), std::begin(b),</span></div>
 <div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="comment">// 0.f);</span></div>
 <div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>}</div>
 </div>
-<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span><span class="comment"></span> </div>
-<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span><span class="comment"> * Compute magnitude of vector.</span></div>
-<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span><span class="comment"> *</span></div>
-<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span><span class="comment"> * If \f$\vec{a}=\left[a_0,a_1,a_2,...,a_L\right]\f$ then</span></div>
-<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span><span class="comment"> * \f$\left|\vec{a}\right|=\sqrt{\displaystyle\sum_{i=0}^L a_i^2}\f$</span></div>
-<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span><span class="comment"> *</span></div>
-<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span><span class="comment"> * \returns \f$\left|\vec{a}\right|\f$</span></div>
-<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
 <div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00092" data-start="{" data-end="}">
-<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f">   92</a></span><span class="keyword">inline</span> <span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f">vector_mag</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> &amp;a) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f">   92</a></span><span class="keyword">inline</span> <span class="keywordtype">double</span> <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f">vector_mag</a>(<span class="keyword">const</span> std::valarray&lt;T&gt; &amp;a) {</div>
 <div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="keywordtype">double</span> dot = <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec">vector_dot</a>(a, a);</div>
-<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(dot);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keywordflow">return</span> std::sqrt(dot);</div>
 <div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>}</div>
 </div>
-<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span><span class="comment"></span> </div>
-<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span><span class="comment"> * Compute projection of vector \f$\vec{a}\f$ on \f$\vec{b}\f$ defined as</span></div>
-<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span><span class="comment"> * \f[\text{proj}_\vec{b}\vec{a}=\frac{\vec{a}\cdot\vec{b}}{\left|\vec{b}\right|^2}\vec{b}\f]</span></div>
-<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span><span class="comment"> *</span></div>
-<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span><span class="comment"> * \returns NULL if error, otherwise pointer to output</span></div>
-<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
 <div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00104" data-start="{" data-end="}">
-<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"><a class="line" href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc">  104</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc">vector_proj</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> &amp;a,</div>
-<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>                             <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> &amp;b) {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"><a class="line" href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc">  104</a></span>std::valarray&lt;T&gt; <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc">vector_proj</a>(<span class="keyword">const</span> std::valarray&lt;T&gt; &amp;a,</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>                             <span class="keyword">const</span> std::valarray&lt;T&gt; &amp;b) {</div>
 <div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="keywordtype">double</span> num = <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec">vector_dot</a>(a, b);</div>
 <div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <span class="keywordtype">double</span> deno = <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec">vector_dot</a>(b, b);</div>
-<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span><span class="comment"></span> </div>
-<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span><span class="comment">    /*! check for division by zero using machine epsilon */</span></div>
-<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordflow">if</span> (deno &lt;= <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">std::numeric_limits&lt;double&gt;::epsilon</a>()) {</div>
-<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;[&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;] Possible division by zero\n&quot;</span>;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordflow">if</span> (deno &lt;= std::numeric_limits&lt;double&gt;::epsilon()) {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;[&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;] Possible division by zero\n&quot;</span>;</div>
 <div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        <span class="keywordflow">return</span> a;  <span class="comment">// return vector a back</span></div>
 <div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    }</div>
 <div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
@@ -235,44 +210,19 @@ $(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','../../'); initRe
 <div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="keywordflow">return</span> b * scalar;</div>
 <div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>}</div>
 </div>
-<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span><span class="comment"></span> </div>
-<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span><span class="comment"> * Decompose matrix \f$A\f$ using [Gram-Schmidt</span></div>
-<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span><span class="comment"> *process](https://en.wikipedia.org/wiki/QR_decomposition).</span></div>
-<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span><span class="comment"> *</span></div>
-<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span><span class="comment"> * \f{eqnarray*}{</span></div>
-<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span><span class="comment"> * \text{given that}\quad A &amp;=&amp;</span></div>
-<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span><span class="comment"> *\left[\mathbf{a}_1,\mathbf{a}_2,\ldots,\mathbf{a}_{N-1},\right]\\</span></div>
-<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span><span class="comment"> * \text{where}\quad\mathbf{a}_i &amp;=&amp;</span></div>
-<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span><span class="comment"> * \left[a_{0i},a_{1i},a_{2i},\ldots,a_{(M-1)i}\right]^T\quad\ldots\mbox{(column</span></div>
-<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span><span class="comment"> * vectors)}\\</span></div>
-<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span><span class="comment"> * \text{then}\quad\mathbf{u}_i &amp;=&amp; \mathbf{a}_i</span></div>
-<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span><span class="comment"> *-\sum_{j=0}^{i-1}\text{proj}_{\mathbf{u}_j}\mathbf{a}_i\\</span></div>
-<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span><span class="comment"> * \mathbf{e}_i &amp;=&amp;\frac{\mathbf{u}_i}{\left|\mathbf{u}_i\right|}\\</span></div>
-<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span><span class="comment"> * Q &amp;=&amp; \begin{bmatrix}\mathbf{e}_0 &amp; \mathbf{e}_1 &amp; \mathbf{e}_2 &amp; \dots &amp;</span></div>
-<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span><span class="comment"> * \mathbf{e}_{N-1}\end{bmatrix}\\</span></div>
-<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span><span class="comment"> * R &amp;=&amp; \begin{bmatrix}\langle\mathbf{e}_0\,,\mathbf{a}_0\rangle &amp;</span></div>
-<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span><span class="comment"> * \langle\mathbf{e}_1\,,\mathbf{a}_1\rangle &amp;</span></div>
-<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span><span class="comment"> * \langle\mathbf{e}_2\,,\mathbf{a}_2\rangle &amp; \dots \\</span></div>
-<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span><span class="comment"> *                  0 &amp; \langle\mathbf{e}_1\,,\mathbf{a}_1\rangle &amp;</span></div>
-<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span><span class="comment"> * \langle\mathbf{e}_2\,,\mathbf{a}_2\rangle &amp; \dots\\</span></div>
-<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span><span class="comment"> *                  0 &amp; 0 &amp; \langle\mathbf{e}_2\,,\mathbf{a}_2\rangle &amp;</span></div>
-<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span><span class="comment"> * \dots\\ \vdots &amp; \vdots &amp; \vdots &amp; \ddots</span></div>
-<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span><span class="comment"> *      \end{bmatrix}\\</span></div>
-<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span><span class="comment"> * \f}</span></div>
-<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
 <div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00146" data-start="{" data-end="}">
 <div class="line"><a id="l00146" name="l00146"></a><span class="lineno"><a class="line" href="../../d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1">  146</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1">qr_decompose</a>(</div>
-<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; &amp;A, <span class="comment">/**&lt; input matrix to decompose */</span></div>
-<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; *Q,       <span class="comment">/**&lt; output decomposed matrix */</span></div>
-<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; *R        <span class="comment">/**&lt; output decomposed matrix */</span></div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    <span class="keyword">const</span> std::valarray&lt;std::valarray&lt;T&gt;&gt; &amp;A, </div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    std::valarray&lt;std::valarray&lt;T&gt;&gt; *Q,       </div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    std::valarray&lt;std::valarray&lt;T&gt;&gt; *R        </div>
 <div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>) {</div>
-<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> ROWS = A.size();        <span class="comment">// number of rows of A</span></div>
-<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> COLUMNS = A[0].size();  <span class="comment">// number of columns of A</span></div>
-<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> col_vector(ROWS);</div>
-<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> col_vector2(ROWS);</div>
-<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> tmp_vector(ROWS);</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    std::size_t ROWS = A.size();        <span class="comment">// number of rows of A</span></div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    std::size_t COLUMNS = A[0].size();  <span class="comment">// number of columns of A</span></div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    std::valarray&lt;T&gt; col_vector(ROWS);</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    std::valarray&lt;T&gt; col_vector2(ROWS);</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    std::valarray&lt;T&gt; tmp_vector(ROWS);</div>
 <div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span> </div>
 <div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; COLUMNS; i++) {</div>
 <div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>        <span class="comment">/* for each column =&gt; R is a square matrix of NxN */</span></div>
@@ -329,22 +279,12 @@ $(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','../../'); initRe
 <div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>}  <span class="comment">// namespace qr_algorithm</span></div>
 <div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span> </div>
 <div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span><span class="preprocessor">#endif  </span><span class="comment">// NUMERICAL_METHODS_QR_DECOMPOSE_H_</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::ostream</a></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="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::right</a></div><div class="ttdeci">T right(T... args)</div></div>
 <div class="ttc" id="anamespaceqr__algorithm_html"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html">qr_algorithm</a></div><div class="ttdoc">Functions to compute QR decomposition of any rectangular matrix.</div></div>
-<div class="ttc" id="anamespaceqr__algorithm_html_a6d3c7dce1f142141f509d09f6c0e25dc"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc">qr_algorithm::vector_proj</a></div><div class="ttdeci">std::valarray&lt; T &gt; vector_proj(const std::valarray&lt; T &gt; &amp;a, const std::valarray&lt; T &gt; &amp;b)</div><div class="ttdef"><b>Definition</b> qr_decompose.h:104</div></div>
-<div class="ttc" id="anamespaceqr__algorithm_html_a73ce637634fc49e1d10d190eb388ebf1"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1">qr_algorithm::qr_decompose</a></div><div class="ttdeci">void qr_decompose(const std::valarray&lt; std::valarray&lt; T &gt; &gt; &amp;A, std::valarray&lt; std::valarray&lt; T &gt; &gt; *Q, std::valarray&lt; std::valarray&lt; T &gt; &gt; *R)</div><div class="ttdef"><b>Definition</b> qr_decompose.h:146</div></div>
-<div class="ttc" id="anamespaceqr__algorithm_html_a8ea313a1a1b5f9d0e3e332c29c6446ec"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec">qr_algorithm::vector_dot</a></div><div class="ttdeci">double vector_dot(const std::valarray&lt; T &gt; &amp;a, const std::valarray&lt; T &gt; &amp;b)</div><div class="ttdef"><b>Definition</b> qr_decompose.h:76</div></div>
-<div class="ttc" id="anamespaceqr__algorithm_html_ad16da2183db22378435042f26af43d5f"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f">qr_algorithm::vector_mag</a></div><div class="ttdeci">double vector_mag(const std::valarray&lt; T &gt; &amp;a)</div><div class="ttdef"><b>Definition</b> qr_decompose.h:92</div></div>
-<div class="ttc" id="anamespaceqr__algorithm_html_adfbdf47277c8cfee229b05b72f1f7834"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834">qr_algorithm::operator&lt;&lt;</a></div><div class="ttdeci">std::ostream &amp; operator&lt;&lt;(std::ostream &amp;out, std::valarray&lt; std::valarray&lt; T &gt; &gt; const &amp;v)</div><div class="ttdef"><b>Definition</b> qr_decompose.h:33</div></div>
-<div class="ttc" id="anumeric_limits_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">std::numeric_limits</a></div></div>
-<div class="ttc" id="aprecision_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">std::ostream::precision</a></div><div class="ttdeci">T precision(T... args)</div></div>
-<div class="ttc" id="asetfill_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">std::setfill</a></div><div class="ttdeci">T setfill(T... args)</div></div>
-<div class="ttc" id="asetw_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a></div><div class="ttdeci">T setw(T... args)</div></div>
-<div class="ttc" id="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></div></div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
-<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></div></div>
+<div class="ttc" id="anamespaceqr__algorithm_html_a6d3c7dce1f142141f509d09f6c0e25dc"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc">qr_algorithm::vector_proj</a></div><div class="ttdeci">std::valarray&lt; T &gt; vector_proj(const std::valarray&lt; T &gt; &amp;a, const std::valarray&lt; T &gt; &amp;b)</div><div class="ttdef"><b>Definition</b> <a href="#l00104">qr_decompose.h:104</a></div></div>
+<div class="ttc" id="anamespaceqr__algorithm_html_a73ce637634fc49e1d10d190eb388ebf1"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1">qr_algorithm::qr_decompose</a></div><div class="ttdeci">void qr_decompose(const std::valarray&lt; std::valarray&lt; T &gt; &gt; &amp;A, std::valarray&lt; std::valarray&lt; T &gt; &gt; *Q, std::valarray&lt; std::valarray&lt; T &gt; &gt; *R)</div><div class="ttdef"><b>Definition</b> <a href="#l00146">qr_decompose.h:146</a></div></div>
+<div class="ttc" id="anamespaceqr__algorithm_html_a8ea313a1a1b5f9d0e3e332c29c6446ec"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec">qr_algorithm::vector_dot</a></div><div class="ttdeci">double vector_dot(const std::valarray&lt; T &gt; &amp;a, const std::valarray&lt; T &gt; &amp;b)</div><div class="ttdef"><b>Definition</b> <a href="#l00076">qr_decompose.h:76</a></div></div>
+<div class="ttc" id="anamespaceqr__algorithm_html_ad16da2183db22378435042f26af43d5f"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f">qr_algorithm::vector_mag</a></div><div class="ttdeci">double vector_mag(const std::valarray&lt; T &gt; &amp;a)</div><div class="ttdef"><b>Definition</b> <a href="#l00092">qr_decompose.h:92</a></div></div>
+<div class="ttc" id="anamespaceqr__algorithm_html_adfbdf47277c8cfee229b05b72f1f7834"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834">qr_algorithm::operator&lt;&lt;</a></div><div class="ttdeci">std::ostream &amp; operator&lt;&lt;(std::ostream &amp;out, std::valarray&lt; std::valarray&lt; T &gt; &gt; const &amp;v)</div><div class="ttdef"><b>Definition</b> <a href="#l00033">qr_decompose.h:33</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html
index b3f52cec3..4f3af8105 100644
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html
+++ b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: greedy_algorithms/boruvkas_minimum_spanning_tree.cpp File Reference</title>
+<title>TheAlgorithms/C++: greedy_algorithms/boruvkas_minimum_spanning_tree.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for boruvkas_minimum_spanning_tree.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d5d/boruvkas__minimum__spanning__tree_8cpp__incl.svg" width="335" height="126"><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">
+</div>
+<p><a href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></td></tr>
@@ -134,13 +153,13 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a95de0f5e70e83164dbd1b4c515565e84" id="r_a95de0f5e70e83164dbd1b4c515565e84"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a95de0f5e70e83164dbd1b4c515565e84">greedy_algorithms::boruvkas_minimum_spanning_tree::findParent</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; parent, const int v)</td></tr>
+<tr class="memitem:a95de0f5e70e83164dbd1b4c515565e84" id="r_a95de0f5e70e83164dbd1b4c515565e84"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a95de0f5e70e83164dbd1b4c515565e84">greedy_algorithms::boruvkas_minimum_spanning_tree::findParent</a> (std::vector&lt; std::pair&lt; int, int &gt; &gt; parent, const int v)</td></tr>
 <tr class="memdesc:a95de0f5e70e83164dbd1b4c515565e84"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursively returns the vertex's parent at the root of the tree.  <br /></td></tr>
 <tr class="separator:a95de0f5e70e83164dbd1b4c515565e84"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a94c615fc66b72e0adbcbcb99aabb1a59" id="r_a94c615fc66b72e0adbcbcb99aabb1a59"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a94c615fc66b72e0adbcbcb99aabb1a59">greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; adj)</td></tr>
+<tr class="memitem:a94c615fc66b72e0adbcbcb99aabb1a59" id="r_a94c615fc66b72e0adbcbcb99aabb1a59"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a94c615fc66b72e0adbcbcb99aabb1a59">greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas</a> (std::vector&lt; std::vector&lt; int &gt; &gt; adj)</td></tr>
 <tr class="memdesc:a94c615fc66b72e0adbcbcb99aabb1a59"><td class="mdescLeft">&#160;</td><td class="mdescRight">the implementation of boruvka's algorithm  <br /></td></tr>
 <tr class="separator:a94c615fc66b72e0adbcbcb99aabb1a59"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2311b22324cf09926726e4ce1309af8b" id="r_a2311b22324cf09926726e4ce1309af8b"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2311b22324cf09926726e4ce1309af8b">greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; adj)</td></tr>
+<tr class="memitem:a2311b22324cf09926726e4ce1309af8b" id="r_a2311b22324cf09926726e4ce1309af8b"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2311b22324cf09926726e4ce1309af8b">greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum</a> (std::vector&lt; std::vector&lt; int &gt; &gt; adj)</td></tr>
 <tr class="memdesc:a2311b22324cf09926726e4ce1309af8b"><td class="mdescLeft">&#160;</td><td class="mdescRight">counts the sum of edges in the given tree  <br /></td></tr>
 <tr class="separator:a2311b22324cf09926726e4ce1309af8b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
@@ -161,6 +180,8 @@ Functions</h2></td></tr>
 <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>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html">boruvkas_minimum_spanning_tree.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a94c615fc66b72e0adbcbcb99aabb1a59" name="a94c615fc66b72e0adbcbcb99aabb1a59"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a94c615fc66b72e0adbcbcb99aabb1a59">&#9670;&#160;</a></span>boruvkas()</h2>
@@ -169,9 +190,9 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas </td>
+          <td class="memname">std::vector&lt; std::vector&lt; int &gt; &gt; greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;</td>          <td class="paramname"><span class="paramname"><em>adj</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; int &gt; &gt;</td>          <td class="paramname"><span class="paramname"><em>adj</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -185,8 +206,10 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the MST as 2d vectors </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html#l00060">60</a> of file <a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html">boruvkas_minimum_spanning_tree.cpp</a>.</p>
 <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">   61</span>    <span class="keywordtype">size_t</span> size = adj.size();</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 &lt;= 1) {</div>
@@ -195,7 +218,7 @@ Functions</h2></td></tr>
 <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&lt;std::vector&lt;int&gt;</a>&gt; MST(size, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(size, INT_MAX));</div>
+<div class="line"><span class="lineno">   70</span>    std::vector&lt;std::vector&lt;int&gt;&gt; MST(size, std::vector&lt;int&gt;(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 &lt; 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>
@@ -204,7 +227,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   76</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&lt;std::pair&lt;int, int&gt;</a>&gt; 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">   79</span>    std::vector&lt;std::pair&lt;int, int&gt;&gt; parent(size, std::make_pair(0, 0));</div>
 <div class="line"><span class="lineno">   80</span> </div>
 <div class="line"><span class="lineno">   81</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
 <div class="line"><span class="lineno">   82</span>        parent[i].first =</div>
@@ -213,8 +236,8 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   85</span> </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 &gt; 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&lt;std::pair&lt;int, int&gt;</a>&gt; 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">   88</span>        std::vector&lt;std::pair&lt;int, int&gt;&gt; smallest_edge(</div>
+<div class="line"><span class="lineno">   89</span>            size, std::make_pair(-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>
@@ -233,7 +256,7 @@ Functions</h2></td></tr>
 <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">  108</span>                    <span class="keywordtype">int</span> end = 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">// 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>
@@ -244,7 +267,7 @@ Functions</h2></td></tr>
 <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">  119</span>                    end = 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] &lt; adj[start][end]) {</div>
 <div class="line"><span class="lineno">  122</span>                        smallest_edge[parentB].first = j;</div>
@@ -261,7 +284,7 @@ Functions</h2></td></tr>
 <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">  136</span>                <span class="keywordtype">int</span> end = 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>
@@ -286,25 +309,16 @@ Functions</h2></td></tr>
 <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">  161</span>                MST[start][end] = adj[start][end];</div>
+<div class="line"><span class="lineno">  162</span>                MST[end][start] = adj[end][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="#a95de0f5e70e83164dbd1b4c515565e84">greedy_algorithms::boruvkas_minimum_spanning_tree::findParent</a></div><div class="ttdeci">int findParent(std::vector&lt; std::pair&lt; int, int &gt; &gt; 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>
-<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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_cgraph.svg" width="446" height="191"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aboruvkas__minimum__spanning__tree_8cpp_html_a95de0f5e70e83164dbd1b4c515565e84"><div class="ttname"><a href="#a95de0f5e70e83164dbd1b4c515565e84">greedy_algorithms::boruvkas_minimum_spanning_tree::findParent</a></div><div class="ttdeci">int findParent(std::vector&lt; std::pair&lt; int, int &gt; &gt; 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> <a href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html#l00047">boruvkas_minimum_spanning_tree.cpp:47</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a95de0f5e70e83164dbd1b4c515565e84" name="a95de0f5e70e83164dbd1b4c515565e84"></a>
@@ -316,7 +330,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">int greedy_algorithms::boruvkas_minimum_spanning_tree::findParent </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt;</td>          <td class="paramname"><span class="paramname"><em>parent</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::pair&lt; int, int &gt; &gt;</td>          <td class="paramname"><span class="paramname"><em>parent</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -335,6 +349,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html">boruvkas_minimum_spanning_tree.cpp</a>.</p>
 <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="#a95de0f5e70e83164dbd1b4c515565e84">findParent</a>(parent, parent[v].first);</div>
@@ -342,12 +358,7 @@ Here is the call graph for this function:</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">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_cgraph.svg" width="204" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -367,17 +378,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html#l00224">224</a> of file <a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html">boruvkas_minimum_spanning_tree.cpp</a>.</p>
 <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="#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="#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">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="278" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aboruvkas__minimum__spanning__tree_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html#l00196">boruvkas_minimum_spanning_tree.cpp:196</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2311b22324cf09926726e4ce1309af8b" name="a2311b22324cf09926726e4ce1309af8b"></a>
@@ -389,7 +397,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">int greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;</td>          <td class="paramname"><span class="paramname"><em>adj</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; int &gt; &gt;</td>          <td class="paramname"><span class="paramname"><em>adj</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -403,8 +411,10 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html#l00175">175</a> of file <a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html">boruvkas_minimum_spanning_tree.cpp</a>.</p>
 <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">  176</span>    <span class="keywordtype">size_t</span> size = adj.size();</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>
@@ -417,13 +427,8 @@ Here is the call graph for this function:</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&lt; std::valarray&lt; T &gt; &gt; &amp;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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_cgraph.svg" width="368" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00232">vector_ops.hpp:232</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -451,18 +456,20 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html#l00196">196</a> of file <a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html">boruvkas_minimum_spanning_tree.cpp</a>.</p>
 <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> &lt;&lt; <span class="stringliteral">&quot;Starting tests...\n\n&quot;</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&lt;std::vector&lt;int&gt;</a>&gt; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> = {</div>
+<div class="line"><span class="lineno">  197</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Starting tests...\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  198</span>    std::vector&lt;std::vector&lt;int&gt;&gt; <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&lt;std::vector&lt;int&gt;</a>&gt; MST =</div>
+<div class="line"><span class="lineno">  203</span>    std::vector&lt;std::vector&lt;int&gt;&gt; MST =</div>
 <div class="line"><span class="lineno">  204</span>        <a class="code hl_function" href="#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> &lt;&lt; <span class="stringliteral">&quot;1st test passed!&quot;</span> &lt;&lt; <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">  207</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test passed!&quot;</span> &lt;&lt; std::endl;</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>
@@ -472,18 +479,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  214</span>    MST = <a class="code hl_function" href="#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> &lt;&lt; <span class="stringliteral">&quot;2nd test passed!&quot;</span> &lt;&lt; <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">  217</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test passed!&quot;</span> &lt;&lt; std::endl;</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="#a94c615fc66b72e0adbcbcb99aabb1a59">greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; boruvkas(std::vector&lt; std::vector&lt; int &gt; &gt; 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="aboruvkas__minimum__spanning__tree_8cpp_html_a94c615fc66b72e0adbcbcb99aabb1a59"><div class="ttname"><a href="#a94c615fc66b72e0adbcbcb99aabb1a59">greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; boruvkas(std::vector&lt; std::vector&lt; int &gt; &gt; adj)</div><div class="ttdoc">the implementation of boruvka's algorithm</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html#l00060">boruvkas_minimum_spanning_tree.cpp:60</a></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">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="180" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_cgraph.map b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_cgraph.map
deleted file mode 100644
index ddfe29bcc..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum" name="greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum">
-<area shape="rect" id="Node000001" title="counts the sum of edges in the given tree" alt="" coords="5,29,199,85"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="62,29,63,19,70,10,83,5,102,3,123,5,137,12,134,17,122,10,102,8,84,10,73,15,67,21,67,29"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="247,44,362,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="199,54,231,54,231,60,199,60"/>
-</map>
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_cgraph.md5 b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_cgraph.md5
deleted file mode 100644
index f2744d8c9..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8a1120308a991c31071e8097130ae40c
\ No newline at end of file
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_cgraph.svg b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_cgraph.svg
deleted file mode 100644
index d1e165757..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_cgraph.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum Pages: 1 -->
-<svg width="276pt" height="68pt"
- viewBox="0.00 0.00 275.50 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="counts the sum of edges in the given tree">
-<polygon fill="#999999" stroke="#666666" points="145,-41.75 0,-41.75 0,0 145,0 145,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">boruvkas_minimum_spanning</text>
-<text text-anchor="middle" x="72.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::test_findGraphSum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44.49,-42.07C41.82,-51.55 51.16,-59.75 72.5,-59.75 84.84,-59.75 93.16,-57.01 97.48,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.76,-54.1 100.1,-43.53 94.02,-52.21 100.76,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.5,-30.5 181,-30.5 181,-11.25 267.5,-11.25 267.5,-30.5"/>
-<text text-anchor="middle" x="224.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.3,-20.88C153.47,-20.88 161.69,-20.88 169.57,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.31,-24.38 179.31,-20.88 169.31,-17.38 169.31,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_cgraph_org.svg b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_cgraph_org.svg
deleted file mode 100644
index 7cd4833a4..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a2311b22324cf09926726e4ce1309af8b_cgraph_org.svg
+++ /dev/null
@@ -1,50 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum Pages: 1 -->
-<svg width="276pt" height="68pt"
- viewBox="0.00 0.00 275.50 67.75" 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 63.75)">
-<title>greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="counts the sum of edges in the given tree">
-<polygon fill="#999999" stroke="#666666" points="145,-41.75 0,-41.75 0,0 145,0 145,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">boruvkas_minimum_spanning</text>
-<text text-anchor="middle" x="72.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::test_findGraphSum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44.49,-42.07C41.82,-51.55 51.16,-59.75 72.5,-59.75 84.84,-59.75 93.16,-57.01 97.48,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.76,-54.1 100.1,-43.53 94.02,-52.21 100.76,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.5,-30.5 181,-30.5 181,-11.25 267.5,-11.25 267.5,-30.5"/>
-<text text-anchor="middle" x="224.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.3,-20.88C153.47,-20.88 161.69,-20.88 169.57,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.31,-24.38 179.31,-20.88 169.31,-17.38 169.31,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index 7cb2770b9..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,56,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="104,5,175,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,16,88,16,88,21,56,21"/>
-</map>
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 7d1efe276..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-28d1862cdfe14f019a67ed1d98a125f5
\ No newline at end of file
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index edd11c169..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 135.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-19.25 73.75,-19.25 73.75,0 127.25,0 127.25,-19.25"/>
-<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.14,-9.62 53.69,-9.62 62.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.84,-13.13 71.83,-9.63 61.83,-6.13 61.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index b8a400fd8..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 135.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-19.25 73.75,-19.25 73.75,0 127.25,0 127.25,-19.25"/>
-<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.14,-9.62 53.69,-9.62 62.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.84,-13.13 71.83,-9.63 61.83,-6.13 61.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_cgraph.map b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_cgraph.map
deleted file mode 100644
index 4c027c2a0..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas" name="greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas">
-<area shape="rect" id="Node000001" title="the implementation of boruvka&#39;s algorithm" alt="" coords="5,95,199,150"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="55,94,55,84,64,75,80,70,102,68,127,71,143,77,141,82,126,76,102,73,81,75,67,80,60,86,60,94"/>
-<area shape="rect" id="Node000002" href="$d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84" title="Recursively returns the vertex&#39;s parent at the root of the tree." alt="" coords="247,29,440,85"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="198,94,231,85,232,90,200,99"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="290,110,397,135"/>
-<area shape="poly" id="edge4_Node000001_Node000003" title=" " alt="" coords="199,120,274,120,274,125,199,125"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="286,159,401,185"/>
-<area shape="poly" id="edge5_Node000001_Node000004" title=" " alt="" coords="200,140,271,154,270,160,198,145"/>
-<area shape="poly" id="edge3_Node000002_Node000002" title=" " alt="" coords="296,29,297,19,305,10,321,5,343,3,369,5,384,12,382,17,367,10,343,8,322,10,308,15,302,21,301,29"/>
-</map>
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_cgraph.md5 b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_cgraph.md5
deleted file mode 100644
index 16d1255a9..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9e7b763d29712c318c2e38d23dc6d0ea
\ No newline at end of file
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_cgraph.svg b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_cgraph.svg
deleted file mode 100644
index b8d8ff547..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_cgraph.svg
+++ /dev/null
@@ -1,123 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas Pages: 1 -->
-<svg width="334pt" height="143pt"
- viewBox="0.00 0.00 334.00 142.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138.5)">
-<title>greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="the implementation of boruvka&#39;s algorithm">
-<polygon fill="#999999" stroke="#666666" points="145,-67.5 0,-67.5 0,-25.75 145,-25.75 145,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">boruvkas_minimum_spanning</text>
-<text text-anchor="middle" x="72.5" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::boruvkas</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.09,-67.82C35.91,-77.3 47.05,-85.5 72.5,-85.5 87.22,-85.5 97.14,-82.76 102.29,-78.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.57,-79.85 105.43,-69.25 98.93,-77.62 105.57,-79.85"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84" target="_top" xlink:title="Recursively returns the vertex&#39;s parent at the root of the tree.">
-<polygon fill="white" stroke="#666666" points="326,-116.5 181,-116.5 181,-74.75 326,-74.75 326,-116.5"/>
-<text text-anchor="start" x="189" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="189" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">boruvkas_minimum_spanning</text>
-<text text-anchor="middle" x="253.5" y="-80.5" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::findParent</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.27,-66.27C153.3,-68.47 161.52,-70.72 169.67,-72.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.68,-76.31 179.25,-75.57 170.53,-69.56 168.68,-76.31"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="293.75,-56.25 213.25,-56.25 213.25,-37 293.75,-37 293.75,-56.25"/>
-<text text-anchor="middle" x="253.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.27,-46.62C164.09,-46.62 184,-46.62 201.49,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.37,-50.13 211.37,-46.63 201.37,-43.13 201.37,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.75,-19.25 210.25,-19.25 210.25,0 296.75,0 296.75,-19.25"/>
-<text text-anchor="middle" x="253.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.27,-31.79C163.06,-28.11 181.81,-24.24 198.57,-20.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="199.26,-24.2 208.34,-18.75 197.84,-17.35 199.26,-24.2"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.09,-116.82C216.91,-126.3 228.05,-134.5 253.5,-134.5 268.22,-134.5 278.14,-131.76 283.29,-127.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.57,-128.85 286.43,-118.25 279.93,-126.62 286.57,-128.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_cgraph_org.svg b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_cgraph_org.svg
deleted file mode 100644
index b3ffba2cf..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a94c615fc66b72e0adbcbcb99aabb1a59_cgraph_org.svg
+++ /dev/null
@@ -1,97 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas Pages: 1 -->
-<svg width="334pt" height="143pt"
- viewBox="0.00 0.00 334.00 142.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138.5)">
-<title>greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="the implementation of boruvka&#39;s algorithm">
-<polygon fill="#999999" stroke="#666666" points="145,-67.5 0,-67.5 0,-25.75 145,-25.75 145,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">boruvkas_minimum_spanning</text>
-<text text-anchor="middle" x="72.5" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::boruvkas</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.09,-67.82C35.91,-77.3 47.05,-85.5 72.5,-85.5 87.22,-85.5 97.14,-82.76 102.29,-78.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.57,-79.85 105.43,-69.25 98.93,-77.62 105.57,-79.85"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84" target="_top" xlink:title="Recursively returns the vertex&#39;s parent at the root of the tree.">
-<polygon fill="white" stroke="#666666" points="326,-116.5 181,-116.5 181,-74.75 326,-74.75 326,-116.5"/>
-<text text-anchor="start" x="189" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="189" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">boruvkas_minimum_spanning</text>
-<text text-anchor="middle" x="253.5" y="-80.5" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::findParent</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.27,-66.27C153.3,-68.47 161.52,-70.72 169.67,-72.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.68,-76.31 179.25,-75.57 170.53,-69.56 168.68,-76.31"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="293.75,-56.25 213.25,-56.25 213.25,-37 293.75,-37 293.75,-56.25"/>
-<text text-anchor="middle" x="253.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.27,-46.62C164.09,-46.62 184,-46.62 201.49,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.37,-50.13 211.37,-46.63 201.37,-43.13 201.37,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.75,-19.25 210.25,-19.25 210.25,0 296.75,0 296.75,-19.25"/>
-<text text-anchor="middle" x="253.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.27,-31.79C163.06,-28.11 181.81,-24.24 198.57,-20.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="199.26,-24.2 208.34,-18.75 197.84,-17.35 199.26,-24.2"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.09,-116.82C216.91,-126.3 228.05,-134.5 253.5,-134.5 268.22,-134.5 278.14,-131.76 283.29,-127.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.57,-128.85 286.43,-118.25 279.93,-126.62 286.57,-128.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_cgraph.map b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_cgraph.map
deleted file mode 100644
index 62a0f8dff..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="greedy_algorithms::boruvkas_minimum_spanning_tree::findParent" name="greedy_algorithms::boruvkas_minimum_spanning_tree::findParent">
-<area shape="rect" id="Node000001" title="Recursively returns the vertex&#39;s parent at the root of the tree." alt="" coords="5,29,199,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="64,29,64,19,71,10,84,5,102,3,123,5,135,12,133,17,121,10,102,8,85,10,74,15,69,21,69,29"/>
-</map>
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_cgraph.md5 b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_cgraph.md5
deleted file mode 100644
index d79721445..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-50b318134bcd297687a8abc071c32abb
\ No newline at end of file
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_cgraph.svg b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_cgraph.svg
deleted file mode 100644
index 12f7f855c..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: greedy_algorithms::boruvkas_minimum_spanning_tree::findParent Pages: 1 -->
-<svg width="153pt" height="68pt"
- viewBox="0.00 0.00 153.00 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>greedy_algorithms::boruvkas_minimum_spanning_tree::findParent</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursively returns the vertex&#39;s parent at the root of the tree.">
-<polygon fill="#999999" stroke="#666666" points="145,-41.75 0,-41.75 0,0 145,0 145,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">boruvkas_minimum_spanning</text>
-<text text-anchor="middle" x="72.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::findParent</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.74,-42.07C43.19,-51.55 52.11,-59.75 72.5,-59.75 84.29,-59.75 92.24,-57.01 96.36,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.66,-54.1 98.87,-43.53 92.9,-52.28 99.66,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_cgraph_org.svg b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_cgraph_org.svg
deleted file mode 100644
index 8250ba00f..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_a95de0f5e70e83164dbd1b4c515565e84_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: greedy_algorithms::boruvkas_minimum_spanning_tree::findParent Pages: 1 -->
-<svg width="153pt" height="68pt"
- viewBox="0.00 0.00 153.00 67.75" 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 63.75)">
-<title>greedy_algorithms::boruvkas_minimum_spanning_tree::findParent</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursively returns the vertex&#39;s parent at the root of the tree.">
-<polygon fill="#999999" stroke="#666666" points="145,-41.75 0,-41.75 0,0 145,0 145,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">boruvkas_minimum_spanning</text>
-<text text-anchor="middle" x="72.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::findParent</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.74,-42.07C43.19,-51.55 52.11,-59.75 72.5,-59.75 84.29,-59.75 92.24,-57.01 96.36,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.66,-54.1 98.87,-43.53 92.9,-52.28 99.66,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 876ff74f1..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,5,153,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,88,16,88,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="201,5,272,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,16,185,16,185,21,153,21"/>
-</map>
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 537139629..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c0a28deaa757010a56447c9d4765ac93
\ No newline at end of file
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 942be1dc4..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="208pt" height="27pt"
- viewBox="0.00 0.00 208.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-9.62C44.55,-9.62 53.37,-9.62 61.69,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-13.13 71.43,-9.63 61.43,-6.13 61.43,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.25,-19.25 146.75,-19.25 146.75,0 200.25,0 200.25,-19.25"/>
-<text text-anchor="middle" x="173.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.94,-9.62C118.14,-9.62 126.69,-9.62 135.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.84,-13.13 144.83,-9.63 134.83,-6.13 134.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 10ac879ec..000000000
--- a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="208pt" height="27pt"
- viewBox="0.00 0.00 208.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-9.62C44.55,-9.62 53.37,-9.62 61.69,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-13.13 71.43,-9.63 61.43,-6.13 61.43,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.25,-19.25 146.75,-19.25 146.75,0 200.25,0 200.25,-19.25"/>
-<text text-anchor="middle" x="173.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.94,-9.62C118.14,-9.62 126.69,-9.62 135.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.84,-13.13 144.83,-9.63 134.83,-6.13 134.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html
new file mode 100644
index 000000000..bb82ed8a0
--- /dev/null
+++ b/d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html
@@ -0,0 +1,326 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: greedy_algorithms/boruvkas_minimum_spanning_tree.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">boruvkas_minimum_spanning_tree.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;climits&gt;</span>   </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a> {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d64/namespaceboruvkas__minimum__spanning__tree.html">boruvkas_minimum_spanning_tree</a> {</div>
+<div class="foldopen" id="foldopen00047" data-start="{" data-end="}">
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84">   47</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84">findParent</a>(std::vector&lt;std::pair&lt;int, int&gt;&gt; parent, <span class="keyword">const</span> <span class="keywordtype">int</span> v) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">if</span> (parent[v].first != v) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><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"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">return</span> parent[v].first;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>}</div>
+</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="foldopen" id="foldopen00060" data-start="{" data-end="}">
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"><a class="line" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59">   60</a></span>std::vector&lt;std::vector&lt;int&gt;&gt; <a class="code hl_function" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59">boruvkas</a>(std::vector&lt;std::vector&lt;int&gt;&gt; adj) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordtype">size_t</span> size = adj.size();</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordtype">size_t</span> total_groups = size;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="keywordflow">if</span> (size &lt;= 1) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <span class="keywordflow">return</span> adj;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="comment">// Stores the current Minimum Spanning Tree. As groups are combined, they</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="comment">// are added to the MST</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    std::vector&lt;std::vector&lt;int&gt;&gt; MST(size, std::vector&lt;int&gt;(size, INT_MAX));</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        MST[i][i] = 0;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    }</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="comment">// Step 1: Create a group for each vertex</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><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"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="comment">// to 0</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    std::vector&lt;std::pair&lt;int, int&gt;&gt; parent(size, std::make_pair(0, 0));</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        parent[i].first =</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            i;  <span class="comment">// Sets parent of each vertex to itself, depth remains 0</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    }</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="comment">// Repeat until all are in a single group</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="keywordflow">while</span> (total_groups &gt; 1) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        std::vector&lt;std::pair&lt;int, int&gt;&gt; smallest_edge(</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>            size, std::make_pair(-1, -1));  <span class="comment">// Pairing: start node, end node</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><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"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        <span class="comment">// the right half of the adj matrix</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; size; j++) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><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"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>                    <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>                }</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span> </div>
+<div class="line"><a id="l00099" name="l00099"></a><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"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>                <span class="comment">// they arent in the same group</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><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"><a id="l00102" name="l00102"></a><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"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>                <span class="keywordflow">if</span> (parentA != parentB) {</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>                    <span class="comment">// Grabs the start and end points for the first groups</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>                    <span class="comment">// current smallest edge</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>                    <span class="keywordtype">int</span> start = smallest_edge[parentA].first;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>                    <span class="keywordtype">int</span> end = smallest_edge[parentA].second;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="line"><a id="l00110" name="l00110"></a><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"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>                    <span class="comment">// smaller, records the new smallest</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>                    <span class="keywordflow">if</span> (start == -1 || adj[i][j] &lt; adj[start][end]) {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>                        smallest_edge[parentA].first = i;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>                        smallest_edge[parentA].second = j;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>                    }</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>                    <span class="comment">// Does the same for the second group</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>                    start = smallest_edge[parentB].first;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>                    end = smallest_edge[parentB].second;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>                    <span class="keywordflow">if</span> (start == -1 || adj[j][i] &lt; adj[start][end]) {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>                        smallest_edge[parentB].first = j;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>                        smallest_edge[parentB].second = i;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>                    }</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>                }</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>            }</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        }</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        <span class="comment">// Step 3: Combine the groups based off their smallest edge</span></div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>            <span class="comment">// Makes sure the smallest edge exists</span></div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>            <span class="keywordflow">if</span> (smallest_edge[i].first != -1) {</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>                <span class="comment">// Start and end points for the groups smallest edge</span></div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>                <span class="keywordtype">int</span> start = smallest_edge[i].first;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>                <span class="keywordtype">int</span> end = smallest_edge[i].second;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span> </div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>                <span class="comment">// Parents of the two groups - A is always itself</span></div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>                <span class="keywordtype">int</span> parentA = i;</div>
+<div class="line"><a id="l00140" name="l00140"></a><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"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>                <span class="comment">// Makes sure the two nodes dont share the same parent. Would</span></div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>                <span class="comment">// happen if the two groups have been</span></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>                <span class="comment">// merged previously through a common shortest edge</span></div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>                <span class="keywordflow">if</span> (parentA == parentB) {</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>                    <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>                }</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span> </div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>                <span class="comment">// Tries to balance the trees as much as possible as they are</span></div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>                <span class="comment">// merged. The parent of the shallower</span></div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>                <span class="comment">// tree will be pointed to the parent of the deeper tree.</span></div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>                <span class="keywordflow">if</span> (parent[parentA].second &lt; parent[parentB].second) {</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>                    parent[parentB].first = parentA;  <span class="comment">// New parent</span></div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>                    parent[parentB].second++;         <span class="comment">// Increase depth</span></div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>                } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>                    parent[parentA].first = parentB;</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>                    parent[parentA].second++;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>                }</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>                <span class="comment">// Add the connection to the MST, using both halves of the adj</span></div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>                <span class="comment">// matrix</span></div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>                MST[start][end] = adj[start][end];</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>                MST[end][start] = adj[end][start];</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>                total_groups--;  <span class="comment">// one fewer group</span></div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>            }</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>        }</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    }</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    <span class="keywordflow">return</span> MST;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>}</div>
+</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span> </div>
+<div class="foldopen" id="foldopen00175" data-start="{" data-end="}">
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"><a class="line" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a2311b22324cf09926726e4ce1309af8b">  175</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a2311b22324cf09926726e4ce1309af8b">test_findGraphSum</a>(std::vector&lt;std::vector&lt;int&gt;&gt; adj) {</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    <span class="keywordtype">size_t</span> size = adj.size();</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    <span class="keywordtype">int</span> sum = 0;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    <span class="comment">// Moves through one side of the adj matrix, counting the sums of each edge</span></div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; size; j++) {</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>            <span class="keywordflow">if</span> (adj[i][j] &lt; INT_MAX) {</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>                sum += adj[i][j];</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>            }</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        }</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    }</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    <span class="keywordflow">return</span> sum;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>}</div>
+</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>}  <span class="comment">// namespace boruvkas_minimum_spanning_tree</span></div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>}  <span class="comment">// namespace greedy_algorithms</span></div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span> </div>
+<div class="foldopen" id="foldopen00196" data-start="{" data-end="}">
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"><a class="line" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">  196</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Starting tests...\n\n&quot;</span>;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    std::vector&lt;std::vector&lt;int&gt;&gt; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> = {</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        {0, 5, INT_MAX, 3, INT_MAX}, {5, 0, 2, INT_MAX, 5},</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>        {INT_MAX, 2, 0, INT_MAX, 3}, {3, INT_MAX, INT_MAX, 0, INT_MAX},</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>        {INT_MAX, 5, 3, INT_MAX, 0},</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    };</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    std::vector&lt;std::vector&lt;int&gt;&gt; MST =</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>        greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>);</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    assert(greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum(</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>               MST) == 13);</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span> </div>
+<div class="line"><a id="l00209" name="l00209"></a><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"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>             {2, 0, 3, 8, 5},</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>             {0, 3, 0, 0, 7},</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>             {6, 8, 0, 0, 9},</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>             {0, 5, 7, 9, 0}};</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    MST = greedy_algorithms::boruvkas_minimum_spanning_tree::boruvkas(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>);</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    assert(greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum(</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>               MST) == 16);</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>}</div>
+</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span> </div>
+<div class="foldopen" id="foldopen00224" data-start="{" data-end="}">
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"><a class="line" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  224</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00225" name="l00225"></a><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"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>}</div>
+</div>
+<div class="ttc" id="aboruvkas__minimum__spanning__tree_8cpp_html_a2311b22324cf09926726e4ce1309af8b"><div class="ttname"><a href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a2311b22324cf09926726e4ce1309af8b">greedy_algorithms::boruvkas_minimum_spanning_tree::test_findGraphSum</a></div><div class="ttdeci">int test_findGraphSum(std::vector&lt; std::vector&lt; int &gt; &gt; adj)</div><div class="ttdoc">counts the sum of edges in the given tree</div><div class="ttdef"><b>Definition</b> <a href="#l00175">boruvkas_minimum_spanning_tree.cpp:175</a></div></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> <a href="#l00196">boruvkas_minimum_spanning_tree.cpp:196</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&lt; std::vector&lt; int &gt; &gt; boruvkas(std::vector&lt; std::vector&lt; int &gt; &gt; adj)</div><div class="ttdoc">the implementation of boruvka's algorithm</div><div class="ttdef"><b>Definition</b> <a href="#l00060">boruvkas_minimum_spanning_tree.cpp:60</a></div></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&lt; std::pair&lt; int, int &gt; &gt; 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> <a href="#l00047">boruvkas_minimum_spanning_tree.cpp:47</a></div></div>
+<div class="ttc" id="aboruvkas__minimum__spanning__tree_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00224">boruvkas_minimum_spanning_tree.cpp:224</a></div></div>
+<div class="ttc" id="anamespaceboruvkas__minimum__spanning__tree_html"><div class="ttname"><a href="../../d8/d64/namespaceboruvkas__minimum__spanning__tree.html">boruvkas_minimum_spanning_tree</a></div><div class="ttdoc">Functions for the [Borůvkas Algorithm](https://en.wikipedia.org/wiki/Borůvka's_algorithm) implementat...</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 class="ttc" id="anamespacegreedy__algorithms_html"><div class="ttname"><a href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></div><div class="ttdoc">for string class</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d1f/binary__addition_8cpp_source.html#l00027">binary_addition.cpp:27</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_0eaa691bd54ab0922ca7f50599de6d22.html">greedy_algorithms</a></li><li class="navelem"><a class="el" href="../../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html">boruvkas_minimum_spanning_tree.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d7a/shell__sort2_8cpp.html b/d4/d7a/shell__sort2_8cpp.html
index b9b817e03..3ce8d593b 100644
--- a/d4/d7a/shell__sort2_8cpp.html
+++ b/d4/d7a/shell__sort2_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/shell_sort2.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/shell_sort2.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for shell_sort2.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d86/shell__sort2_8cpp__incl.svg" width="488" height="111"><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">
+</div>
+<p><a href="../../d4/d7a/shell__sort2_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -146,7 +165,7 @@ Functions</h2></td></tr>
 <tr class="memitem:a4d76603c54d3dc56146e92d10a043924"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a4d76603c54d3dc56146e92d10a043924">sorting::shell_sort</a> (T(&amp;arr)[N])</td></tr>
 <tr class="separator:a4d76603c54d3dc56146e92d10a043924"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af2c5b92cbfe73f63f6074c61b0a45331" id="r_af2c5b92cbfe73f63f6074c61b0a45331"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:af2c5b92cbfe73f63f6074c61b0a45331"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331">sorting::shell_sort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *arr)</td></tr>
+<tr class="memitem:af2c5b92cbfe73f63f6074c61b0a45331"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331">sorting::shell_sort</a> (std::vector&lt; T &gt; *arr)</td></tr>
 <tr class="separator:af2c5b92cbfe73f63f6074c61b0a45331"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a7eb77daed2cf1513f6d68c47a1c2db1c" id="r_a7eb77daed2cf1513f6d68c47a1c2db1c"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
 <tr class="memitem:a7eb77daed2cf1513f6d68c47a1c2db1c"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a> (const void *a, const void *b)</td></tr>
@@ -161,6 +180,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Shell_sort" target="_blank">Shell sort</a> algorithm </p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html">shell_sort2.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a7eb77daed2cf1513f6d68c47a1c2db1c" name="a7eb77daed2cf1513f6d68c47a1c2db1c"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a7eb77daed2cf1513f6d68c47a1c2db1c">&#9670;&#160;</a></span>compare()</h2>
@@ -183,6 +204,8 @@ template&lt;typename T &gt; </div>
       </table>
 </div><div class="memdoc">
 <p>function to compare sorting using cstdlib's qsort </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html#l00087">87</a> of file <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html">shell_sort2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   87</span>                                          {</div>
 <div class="line"><span class="lineno">   88</span>    T arg1 = *<span class="keyword">static_cast&lt;</span><span class="keyword">const </span>T *<span class="keyword">&gt;</span>(a);</div>
 <div class="line"><span class="lineno">   89</span>    T arg2 = *<span class="keyword">static_cast&lt;</span><span class="keyword">const </span>T *<span class="keyword">&gt;</span>(b);</div>
@@ -218,28 +241,30 @@ template&lt;typename T &gt; </div>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html#l00183">183</a> of file <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html">shell_sort2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  183</span>                                 {</div>
 <div class="line"><span class="lineno">  184</span>    <span class="comment">// initialize random number generator - once per program</span></div>
-<div class="line"><span class="lineno">  185</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(NULL));</div>
+<div class="line"><span class="lineno">  185</span>    std::srand(std::time(NULL));</div>
 <div class="line"><span class="lineno">  186</span> </div>
 <div class="line"><span class="lineno">  187</span>    <a class="code hl_function" href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">test_int</a>(100);  <span class="comment">// test with sorting random array of 100 values</span></div>
-<div class="line"><span class="lineno">  188</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 - 100 int values - passed. \n&quot;</span>;</div>
+<div class="line"><span class="lineno">  188</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 - 100 int values - passed. \n&quot;</span>;</div>
 <div class="line"><span class="lineno">  189</span>    <a class="code hl_function" href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">test_int</a>(1000);  <span class="comment">// test with sorting random array of 1000 values</span></div>
-<div class="line"><span class="lineno">  190</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2 - 1000 int values - passed.\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  190</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 - 1000 int values - passed.\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  191</span>    <a class="code hl_function" href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">test_int</a>(10000);  <span class="comment">// test with sorting random array of 10000 values</span></div>
-<div class="line"><span class="lineno">  192</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3 - 10000 int values - passed.\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  192</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 - 10000 int values - passed.\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  193</span> </div>
 <div class="line"><span class="lineno">  194</span>    <a class="code hl_function" href="#a22ea0d1f7943ebb4371d31e44b465b6d">test_f</a>(100);  <span class="comment">// test with sorting random array of 100 values</span></div>
-<div class="line"><span class="lineno">  195</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 - 100 float values - passed. \n&quot;</span>;</div>
+<div class="line"><span class="lineno">  195</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 - 100 float values - passed. \n&quot;</span>;</div>
 <div class="line"><span class="lineno">  196</span>    <a class="code hl_function" href="#a22ea0d1f7943ebb4371d31e44b465b6d">test_f</a>(1000);  <span class="comment">// test with sorting random array of 1000 values</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> &lt;&lt; <span class="stringliteral">&quot;Test 2 - 1000 float values - passed.\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  197</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 - 1000 float values - passed.\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  198</span>    <a class="code hl_function" href="#a22ea0d1f7943ebb4371d31e44b465b6d">test_f</a>(10000);  <span class="comment">// test with sorting random array of 10000 values</span></div>
-<div class="line"><span class="lineno">  199</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3 - 10000 float values - passed.\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  199</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 - 10000 float values - passed.\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  200</span> </div>
 <div class="line"><span class="lineno">  201</span>    <span class="keywordtype">int</span> i, NUM_DATA;</div>
 <div class="line"><span class="lineno">  202</span> </div>
 <div class="line"><span class="lineno">  203</span>    <span class="keywordflow">if</span> (argc == 2)</div>
-<div class="line"><span class="lineno">  204</span>        NUM_DATA = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">atoi</a>(argv[1]);</div>
+<div class="line"><span class="lineno">  204</span>        NUM_DATA = atoi(argv[1]);</div>
 <div class="line"><span class="lineno">  205</span>    <span class="keywordflow">else</span></div>
 <div class="line"><span class="lineno">  206</span>        NUM_DATA = 200;</div>
 <div class="line"><span class="lineno">  207</span> </div>
@@ -248,47 +273,33 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  210</span>    <span class="comment">// int array2 = new int[NUM_DATA];</span></div>
 <div class="line"><span class="lineno">  211</span>    <span class="keywordtype">int</span> range = 1800;</div>
 <div class="line"><span class="lineno">  212</span> </div>
-<div class="line"><span class="lineno">  213</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">time</a>(NULL));</div>
+<div class="line"><span class="lineno">  213</span>    std::srand(time(NULL));</div>
 <div class="line"><span class="lineno">  214</span>    <span class="keywordflow">for</span> (i = 0; i &lt; NUM_DATA; i++) {</div>
 <div class="line"><span class="lineno">  215</span>        <span class="comment">// allocate random numbers in the given range</span></div>
-<div class="line"><span class="lineno">  216</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] = (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % range) - (range &gt;&gt; 1);</div>
+<div class="line"><span class="lineno">  216</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] = (std::rand() % range) - (range &gt;&gt; 1);</div>
 <div class="line"><span class="lineno">  217</span>    }</div>
 <div class="line"><span class="lineno">  218</span> </div>
-<div class="line"><span class="lineno">  219</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Unsorted original data: &quot;</span> &lt;&lt; <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">  219</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Unsorted original data: &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  220</span>    <a class="code hl_function" href="#a951127aea9d7e1e53ea9ae0868633246">show_data</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, NUM_DATA);</div>
-<div class="line"><span class="lineno">  221</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> start = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  221</span>    std::clock_t start = std::clock();</div>
 <div class="line"><span class="lineno">  222</span>    shell_sort(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, NUM_DATA);  <span class="comment">// perform sorting</span></div>
-<div class="line"><span class="lineno">  223</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  223</span>    std::clock_t end = std::clock();</div>
 <div class="line"><span class="lineno">  224</span> </div>
-<div class="line"><span class="lineno">  225</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  226</span>              &lt;&lt; <span class="stringliteral">&quot;Data Sorted using custom implementation: &quot;</span> &lt;&lt; <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">  225</span>    std::cout &lt;&lt; std::endl</div>
+<div class="line"><span class="lineno">  226</span>              &lt;&lt; <span class="stringliteral">&quot;Data Sorted using custom implementation: &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  227</span>    <a class="code hl_function" href="#a951127aea9d7e1e53ea9ae0868633246">show_data</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, NUM_DATA);</div>
 <div class="line"><span class="lineno">  228</span> </div>
-<div class="line"><span class="lineno">  229</span>    <span class="keywordtype">double</span> elapsed_time = (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> - start) * 1.f / CLOCKS_PER_SEC;</div>
-<div class="line"><span class="lineno">  230</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Time spent sorting: &quot;</span> &lt;&lt; elapsed_time &lt;&lt; <span class="stringliteral">&quot;s\n&quot;</span> &lt;&lt; <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">  229</span>    <span class="keywordtype">double</span> elapsed_time = (end - start) * 1.f / CLOCKS_PER_SEC;</div>
+<div class="line"><span class="lineno">  230</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Time spent sorting: &quot;</span> &lt;&lt; elapsed_time &lt;&lt; <span class="stringliteral">&quot;s\n&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  231</span> </div>
 <div class="line"><span class="lineno">  232</span>    <span class="keyword">delete</span>[] <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
 <div class="line"><span class="lineno">  233</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  234</span>}</div>
-<div class="ttc" id="aatoi_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">std::atoi</a></div><div class="ttdeci">T atoi(T... args)</div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="aclock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a></div><div class="ttdeci">T clock(T... args)</div></div>
-<div class="ttc" id="aclock_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a></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="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="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
-<div class="ttc" id="aquick__sort__3_8cpp_html_a07e5c62de28aeddea986890ce7ac1bda"><div class="ttname"><a href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">test_int</a></div><div class="ttdeci">static void test_int()</div><div class="ttdef"><b>Definition</b> quick_sort_3.cpp:138</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-<div class="ttc" id="ashell__sort2_8cpp_html_a22ea0d1f7943ebb4371d31e44b465b6d"><div class="ttname"><a href="#a22ea0d1f7943ebb4371d31e44b465b6d">test_f</a></div><div class="ttdeci">void test_f(const int NUM_DATA)</div><div class="ttdef"><b>Definition</b> shell_sort2.cpp:145</div></div>
-<div class="ttc" id="ashell__sort2_8cpp_html_a951127aea9d7e1e53ea9ae0868633246"><div class="ttname"><a href="#a951127aea9d7e1e53ea9ae0868633246">show_data</a></div><div class="ttdeci">void show_data(T *arr, size_t LEN)</div><div class="ttdef"><b>Definition</b> shell_sort2.cpp:18</div></div>
-<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="362" height="444"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="aquick__sort__3_8cpp_html_a07e5c62de28aeddea986890ce7ac1bda"><div class="ttname"><a href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">test_int</a></div><div class="ttdeci">static void test_int()</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d4c/quick__sort__3_8cpp_source.html#l00138">quick_sort_3.cpp:138</a></div></div>
+<div class="ttc" id="ashell__sort2_8cpp_html_a22ea0d1f7943ebb4371d31e44b465b6d"><div class="ttname"><a href="#a22ea0d1f7943ebb4371d31e44b465b6d">test_f</a></div><div class="ttdeci">void test_f(const int NUM_DATA)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d7a/shell__sort2_8cpp_source.html#l00145">shell_sort2.cpp:145</a></div></div>
+<div class="ttc" id="ashell__sort2_8cpp_html_a951127aea9d7e1e53ea9ae0868633246"><div class="ttname"><a href="#a951127aea9d7e1e53ea9ae0868633246">show_data</a></div><div class="ttdeci">void show_data(T *arr, size_t LEN)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d7a/shell__sort2_8cpp_source.html#l00018">shell_sort2.cpp:18</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a951127aea9d7e1e53ea9ae0868633246" name="a951127aea9d7e1e53ea9ae0868633246"></a>
@@ -318,20 +329,17 @@ template&lt;class T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html#l00018">18</a> of file <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html">shell_sort2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   18</span>                                   {</div>
 <div class="line"><span class="lineno">   19</span>    <span class="keywordtype">size_t</span> i;</div>
 <div class="line"><span class="lineno">   20</span> </div>
 <div class="line"><span class="lineno">   21</span>    <span class="keywordflow">for</span> (i = 0; i &lt; LEN; i++) {</div>
-<div class="line"><span class="lineno">   22</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><span class="lineno">   22</span>        std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
 <div class="line"><span class="lineno">   23</span>    }</div>
-<div class="line"><span class="lineno">   24</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   24</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   25</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.svg" width="215" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a63aaff7cabfa3da2da8b9477b5fad9d6" name="a63aaff7cabfa3da2da8b9477b5fad9d6"></a>
@@ -357,15 +365,12 @@ template&lt;typename T , size_t N&gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html">shell_sort2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   32</span>                            {</div>
 <div class="line"><span class="lineno">   33</span>    <a class="code hl_function" href="#a951127aea9d7e1e53ea9ae0868633246">show_data</a>(arr, N);</div>
 <div class="line"><span class="lineno">   34</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.svg" width="347" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a22ea0d1f7943ebb4371d31e44b465b6d" name="a22ea0d1f7943ebb4371d31e44b465b6d"></a>
@@ -382,7 +387,9 @@ Here is the call graph for this function:</div>
         </tr>
       </table>
 </div><div class="memdoc">
-<p>Test implementation of shell_sort on float arrays by comparing results against <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/qsort.html">std::qsort</a>. </p>
+<p>Test implementation of shell_sort on float arrays by comparing results against std::qsort. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html#l00145">145</a> of file <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html">shell_sort2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  145</span>                                {</div>
 <div class="line"><span class="lineno">  146</span>    <span class="comment">// int array = new int[NUM_DATA];</span></div>
 <div class="line"><span class="lineno">  147</span>    <span class="keywordtype">float</span> *<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> = <span class="keyword">new</span> <span class="keywordtype">float</span>[NUM_DATA];</div>
@@ -391,24 +398,24 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  150</span>    <span class="keywordtype">int</span> range = 1000;</div>
 <div class="line"><span class="lineno">  151</span> </div>
 <div class="line"><span class="lineno">  152</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; NUM_DATA; i++) {</div>
-<div class="line"><span class="lineno">  153</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] = data2[i] = ((<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % range) - (range &gt;&gt; 1)) / 100.;</div>
+<div class="line"><span class="lineno">  153</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] = data2[i] = ((std::rand() % range) - (range &gt;&gt; 1)) / 100.;</div>
 <div class="line"><span class="lineno">  154</span>    }</div>
 <div class="line"><span class="lineno">  155</span> </div>
 <div class="line"><span class="lineno">  156</span>    <span class="comment">/* sort using our implementation */</span></div>
-<div class="line"><span class="lineno">  157</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> start = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  157</span>    std::clock_t start = std::clock();</div>
 <div class="line"><span class="lineno">  158</span>    shell_sort(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, NUM_DATA);</div>
-<div class="line"><span class="lineno">  159</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
-<div class="line"><span class="lineno">  160</span>    <span class="keywordtype">double</span> elapsed_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> - start) / CLOCKS_PER_SEC;</div>
-<div class="line"><span class="lineno">  161</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Time spent sorting using shell_sort2: &quot;</span> &lt;&lt; elapsed_time</div>
+<div class="line"><span class="lineno">  159</span>    std::clock_t end = std::clock();</div>
+<div class="line"><span class="lineno">  160</span>    <span class="keywordtype">double</span> elapsed_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end - start) / CLOCKS_PER_SEC;</div>
+<div class="line"><span class="lineno">  161</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Time spent sorting using shell_sort2: &quot;</span> &lt;&lt; elapsed_time</div>
 <div class="line"><span class="lineno">  162</span>              &lt;&lt; <span class="stringliteral">&quot;s\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  163</span> </div>
 <div class="line"><span class="lineno">  164</span>    <span class="comment">/* sort using std::qsort */</span></div>
-<div class="line"><span class="lineno">  165</span>    start = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
-<div class="line"><span class="lineno">  166</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/qsort.html">std::qsort</a>(data2, NUM_DATA, <span class="keyword">sizeof</span>(data2[0]), <a class="code hl_struct" href="../../d1/db3/structcompare.html">compare&lt;float&gt;</a>);</div>
-<div class="line"><span class="lineno">  167</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  165</span>    start = std::clock();</div>
+<div class="line"><span class="lineno">  166</span>    std::qsort(data2, NUM_DATA, <span class="keyword">sizeof</span>(data2[0]), <a class="code hl_struct" href="../../d1/db3/structcompare.html">compare&lt;float&gt;</a>);</div>
+<div class="line"><span class="lineno">  167</span>    end = std::clock();</div>
 <div class="line"><span class="lineno">  168</span> </div>
-<div class="line"><span class="lineno">  169</span>    elapsed_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> - start) / CLOCKS_PER_SEC;</div>
-<div class="line"><span class="lineno">  170</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Time spent sorting using std::qsort: &quot;</span> &lt;&lt; elapsed_time</div>
+<div class="line"><span class="lineno">  169</span>    elapsed_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end - start) / CLOCKS_PER_SEC;</div>
+<div class="line"><span class="lineno">  170</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Time spent sorting using std::qsort: &quot;</span> &lt;&lt; elapsed_time</div>
 <div class="line"><span class="lineno">  171</span>              &lt;&lt; <span class="stringliteral">&quot;s\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  172</span> </div>
 <div class="line"><span class="lineno">  173</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; NUM_DATA; i++) {</div>
@@ -419,14 +426,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  178</span>    <span class="keyword">delete</span>[] <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
 <div class="line"><span class="lineno">  179</span>    <span class="keyword">delete</span>[] data2;</div>
 <div class="line"><span class="lineno">  180</span>}</div>
-<div class="ttc" id="aqsort_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/qsort.html">std::qsort</a></div><div class="ttdeci">T qsort(T... args)</div></div>
-<div class="ttc" id="astructcompare_html"><div class="ttname"><a href="../../d1/db3/structcompare.html">compare</a></div><div class="ttdef"><b>Definition</b> huffman.cpp:36</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg" width="192" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astructcompare_html"><div class="ttname"><a href="../../d1/db3/structcompare.html">compare</a></div><div class="ttdef"><b>Definition</b> <a href="../../d5/d8e/huffman_8cpp_source.html#l00036">huffman.cpp:36</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a895b313cb2671e8f712040460325573e" name="a895b313cb2671e8f712040460325573e"></a>
@@ -443,7 +444,9 @@ Here is the call graph for this function:</div>
         </tr>
       </table>
 </div><div class="memdoc">
-<p>Test implementation of shell_sort on integer arrays by comparing results against <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/qsort.html">std::qsort</a>. </p>
+<p>Test implementation of shell_sort on integer arrays by comparing results against std::qsort. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html#l00105">105</a> of file <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html">shell_sort2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  105</span>                                  {</div>
 <div class="line"><span class="lineno">  106</span>    <span class="comment">// int array = new int[NUM_DATA];</span></div>
 <div class="line"><span class="lineno">  107</span>    <span class="keywordtype">int</span> *<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> = <span class="keyword">new</span> <span class="keywordtype">int</span>[NUM_DATA];</div>
@@ -452,23 +455,23 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  110</span>    <span class="keywordtype">int</span> range = 1800;</div>
 <div class="line"><span class="lineno">  111</span> </div>
 <div class="line"><span class="lineno">  112</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; NUM_DATA; i++)</div>
-<div class="line"><span class="lineno">  113</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] = data2[i] = (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % range) - (range &gt;&gt; 1);</div>
+<div class="line"><span class="lineno">  113</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] = data2[i] = (std::rand() % range) - (range &gt;&gt; 1);</div>
 <div class="line"><span class="lineno">  114</span> </div>
 <div class="line"><span class="lineno">  115</span>    <span class="comment">/* sort using our implementation */</span></div>
-<div class="line"><span class="lineno">  116</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> start = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  116</span>    std::clock_t start = std::clock();</div>
 <div class="line"><span class="lineno">  117</span>    shell_sort(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, NUM_DATA);</div>
-<div class="line"><span class="lineno">  118</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
-<div class="line"><span class="lineno">  119</span>    <span class="keywordtype">double</span> elapsed_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> - start) / CLOCKS_PER_SEC;</div>
-<div class="line"><span class="lineno">  120</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Time spent sorting using shell_sort2: &quot;</span> &lt;&lt; elapsed_time</div>
+<div class="line"><span class="lineno">  118</span>    std::clock_t end = std::clock();</div>
+<div class="line"><span class="lineno">  119</span>    <span class="keywordtype">double</span> elapsed_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end - start) / CLOCKS_PER_SEC;</div>
+<div class="line"><span class="lineno">  120</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Time spent sorting using shell_sort2: &quot;</span> &lt;&lt; elapsed_time</div>
 <div class="line"><span class="lineno">  121</span>              &lt;&lt; <span class="stringliteral">&quot;s\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  122</span> </div>
 <div class="line"><span class="lineno">  123</span>    <span class="comment">/* sort using std::qsort */</span></div>
-<div class="line"><span class="lineno">  124</span>    start = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
-<div class="line"><span class="lineno">  125</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/qsort.html">std::qsort</a>(data2, NUM_DATA, <span class="keyword">sizeof</span>(data2[0]), <a class="code hl_struct" href="../../d1/db3/structcompare.html">compare&lt;int&gt;</a>);</div>
-<div class="line"><span class="lineno">  126</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  124</span>    start = std::clock();</div>
+<div class="line"><span class="lineno">  125</span>    std::qsort(data2, NUM_DATA, <span class="keyword">sizeof</span>(data2[0]), <a class="code hl_struct" href="../../d1/db3/structcompare.html">compare&lt;int&gt;</a>);</div>
+<div class="line"><span class="lineno">  126</span>    end = std::clock();</div>
 <div class="line"><span class="lineno">  127</span> </div>
-<div class="line"><span class="lineno">  128</span>    elapsed_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> - start) / CLOCKS_PER_SEC;</div>
-<div class="line"><span class="lineno">  129</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Time spent sorting using std::qsort: &quot;</span> &lt;&lt; elapsed_time</div>
+<div class="line"><span class="lineno">  128</span>    elapsed_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end - start) / CLOCKS_PER_SEC;</div>
+<div class="line"><span class="lineno">  129</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Time spent sorting using std::qsort: &quot;</span> &lt;&lt; elapsed_time</div>
 <div class="line"><span class="lineno">  130</span>              &lt;&lt; <span class="stringliteral">&quot;s\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  131</span> </div>
 <div class="line"><span class="lineno">  132</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; NUM_DATA; i++) {</div>
@@ -479,12 +482,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  137</span>    <span class="keyword">delete</span>[] <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
 <div class="line"><span class="lineno">  138</span>    <span class="keyword">delete</span>[] data2;</div>
 <div class="line"><span class="lineno">  139</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg" width="202" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
deleted file mode 100644
index 05417a73c..000000000
--- a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ /dev/null
@@ -1,34 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,165,55,191"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/clock.html#" title=" " alt="" coords="256,89,335,115"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="44,163,69,143,102,125,137,114,173,106,241,100,241,105,174,111,138,119,104,130,72,147,47,167"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="260,13,331,39"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="30,164,36,134,48,95,69,55,84,38,101,24,136,9,174,3,211,4,245,10,244,15,211,10,174,9,138,14,104,28,87,42,74,58,53,97,41,135,36,165"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="260,192,332,217"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="47,189,72,209,104,225,139,231,176,231,244,219,245,224,176,237,139,237,102,230,69,214,44,194"/>
-<area shape="rect" id="Node000005" href="$d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246" title=" " alt="" coords="103,38,187,64"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="37,163,64,125,101,81,111,72,114,76,105,85,68,128,42,166"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="105,189,184,215"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="56,180,91,188,89,193,55,186"/>
-<area shape="rect" id="Node000007" href="$d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d" title=" " alt="" coords="118,140,172,165"/>
-<area shape="poly" id="edge7_Node000001_Node000007" title=" " alt="" coords="55,170,102,159,103,164,56,175"/>
-<area shape="rect" id="Node000009" href="$d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda" title=" " alt="" coords="113,290,177,316"/>
-<area shape="poly" id="edge11_Node000001_Node000009" title=" " alt="" coords="42,189,68,227,105,269,114,279,111,282,101,273,64,230,37,192"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="109,340,181,365"/>
-<area shape="poly" id="edge18_Node000001_Node000014" title=" " alt="" coords="37,190,60,254,79,292,105,327,106,328,102,332,101,330,75,295,55,256,32,192"/>
-<area shape="poly" id="edge5_Node000005_Node000003" title=" " alt="" coords="187,42,244,32,245,37,188,47"/>
-<area shape="poly" id="edge8_Node000007_Node000002" title=" " alt="" coords="172,141,241,117,243,122,174,146"/>
-<area shape="poly" id="edge10_Node000007_Node000004" title=" " alt="" coords="174,159,246,185,244,190,172,164"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/qsort.html#" title=" " alt="" coords="258,140,334,165"/>
-<area shape="poly" id="edge9_Node000007_Node000008" title=" " alt="" coords="173,150,242,150,242,155,173,155"/>
-<area shape="poly" id="edge17_Node000009_Node000004" title=" " alt="" coords="162,288,185,269,208,247,234,226,244,221,246,225,236,231,212,251,189,273,166,292"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="256,241,335,267"/>
-<area shape="poly" id="edge12_Node000009_Node000010" title=" " alt="" coords="177,290,241,269,243,274,178,295"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="262,290,330,316"/>
-<area shape="poly" id="edge13_Node000009_Node000011" title=" " alt="" coords="178,301,246,301,246,306,178,306"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="246,340,346,365"/>
-<area shape="poly" id="edge14_Node000009_Node000012" title=" " alt="" coords="178,311,241,332,239,337,177,316"/>
-<area shape="rect" id="Node000013" href="$d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168" title=" " alt="" coords="235,413,356,439"/>
-<area shape="poly" id="edge15_Node000009_Node000013" title=" " alt="" coords="173,315,189,325,213,350,237,376,267,402,263,406,233,380,210,354,185,329,170,319"/>
-<area shape="poly" id="edge16_Node000013_Node000013" title=" " alt="" coords="270,414,265,404,268,395,278,389,296,386,314,389,324,396,321,400,312,394,296,392,280,394,272,398,270,404,274,411"/>
-</map>
diff --git a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
deleted file mode 100644
index d394921df..000000000
--- a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3718eeafe3303313216628b71622a785
\ No newline at end of file
diff --git a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
deleted file mode 100644
index 894a88f43..000000000
--- a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ /dev/null
@@ -1,326 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="271pt" height="333pt"
- viewBox="0.00 0.00 271.25 333.11" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 329.11)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-205.25 0,-205.25 0,-186 37,-186 37,-205.25"/>
-<text text-anchor="middle" x="18.5" y="-191.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.12,-262.25 188.38,-262.25 188.38,-243 247.12,-243 247.12,-262.25"/>
-<text text-anchor="middle" x="217.75" y="-248.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.04,-205.51C40.21,-214.43 56.46,-227.12 73,-233.62 106.4,-246.75 147.19,-251.15 176.77,-252.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.29,-255.96 186.4,-252.8 176.53,-248.96 176.29,-255.96"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="244.5,-319.25 191,-319.25 191,-300 244.5,-300 244.5,-319.25"/>
-<text text-anchor="middle" x="217.75" y="-305.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.66,-205.54C23.96,-228.66 35.72,-285.94 73,-309.62 104.57,-329.68 148.43,-326.26 179.38,-319.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.09,-323.4 189.09,-317.79 178.56,-316.57 180.09,-323.4"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="244.88,-185.25 190.62,-185.25 190.62,-166 244.88,-166 244.88,-185.25"/>
-<text text-anchor="middle" x="217.75" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.91,-185.5C40,-176.47 56.18,-163.87 73,-158.62 107.94,-147.72 149.66,-154.73 179.13,-162.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.14,-166.15 188.72,-165.6 180.11,-159.43 178.14,-166.15"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="136.25,-300.25 73,-300.25 73,-281 136.25,-281 136.25,-300.25"/>
-<text text-anchor="middle" x="104.62" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">show_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.7,-205.44C35,-219.75 53.54,-246.8 73,-266.62 75.31,-268.98 77.84,-271.3 80.44,-273.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.09,-276.12 88.08,-279.65 82.47,-270.66 78.09,-276.12"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="134.38,-187.25 74.88,-187.25 74.88,-168 134.38,-168 134.38,-187.25"/>
-<text text-anchor="middle" x="104.62" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.34,-191.81C45.02,-190.16 54.34,-188.17 63.53,-186.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.03,-189.68 73.08,-184.16 62.57,-182.83 64.03,-189.68"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125,-224.25 84.25,-224.25 84.25,-205 125,-205 125,-224.25"/>
-<text text-anchor="middle" x="104.62" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_f</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.34,-199.65C47.72,-202 61.09,-205.02 73.09,-207.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.05,-211.08 82.57,-209.87 73.59,-204.25 72.05,-211.08"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="128.75,-111.25 80.5,-111.25 80.5,-92 128.75,-92 128.75,-111.25"/>
-<text text-anchor="middle" x="104.62" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_int</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge11_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge11_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.73,-185.96C35.06,-171.86 53.65,-145.21 73,-125.62 75.31,-123.28 77.86,-120.96 80.46,-118.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.48,-121.6 88.1,-112.62 78.1,-116.14 82.48,-121.6"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="131.75,-74.25 77.5,-74.25 77.5,-55 131.75,-55 131.75,-74.25"/>
-<text text-anchor="middle" x="104.62" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node14 -->
-<g id="edge18_Node000001_Node000014" class="edge">
-<title>Node1&#45;&gt;Node14</title>
-<g id="a_edge18_Node000001_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.03,-185.74C27.85,-164.59 44,-114.34 73,-82.62 73.26,-82.34 73.52,-82.06 73.79,-81.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.83,-84.64 81.42,-75.64 71.44,-79.19 75.83,-84.64"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge5_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge5_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.58,-295.92C149.93,-298.2 165.64,-300.89 179.61,-303.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.9,-306.7 189.35,-304.94 180.08,-299.81 178.9,-306.7"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node2 -->
-<g id="edge8_Node000007_Node000002" class="edge">
-<title>Node7&#45;&gt;Node2</title>
-<g id="a_edge8_Node000007_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.49,-221.42C139.97,-226.37 160.05,-233.24 177.69,-239.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.26,-242.48 186.85,-242.4 178.52,-235.85 176.26,-242.48"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge10_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge10_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.49,-207.65C140.48,-202.39 161.49,-195.02 179.57,-188.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.66,-192 188.94,-185.38 178.35,-185.39 180.66,-192"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/qsort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.38,-224.25 189.12,-224.25 189.12,-205 246.38,-205 246.38,-224.25"/>
-<text text-anchor="middle" x="217.75" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::qsort</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge9_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.49,-214.62C139.86,-214.62 159.76,-214.62 177.31,-214.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.19,-218.13 187.19,-214.63 177.19,-211.13 177.19,-218.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node4 -->
-<g id="edge17_Node000009_Node000004" class="edge">
-<title>Node9&#45;&gt;Node4</title>
-<g id="a_edge17_Node000009_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.88,-111.73C124.32,-115.95 130.65,-120.95 136.25,-125.62 152.68,-139.34 154.06,-146.34 172.25,-157.62 174.67,-159.12 177.23,-160.54 179.86,-161.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.21,-164.98 188.76,-165.96 181.13,-158.61 178.21,-164.98"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.12,-148.25 188.38,-148.25 188.38,-129 247.12,-129 247.12,-148.25"/>
-<text text-anchor="middle" x="217.75" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge12_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge12_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.19,-109.47C143.17,-114.13 161.24,-120.14 177.34,-125.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.06,-128.77 186.65,-128.6 178.27,-122.12 176.06,-128.77"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.38,-111.25 192.12,-111.25 192.12,-92 243.38,-92 243.38,-111.25"/>
-<text text-anchor="middle" x="217.75" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge13_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge13_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.19,-101.62C144.1,-101.62 163.67,-101.62 180.53,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.16,-105.13 190.16,-101.63 180.16,-98.13 180.16,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.38,-74.25 180.12,-74.25 180.12,-55 255.38,-55 255.38,-74.25"/>
-<text text-anchor="middle" x="217.75" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node12 -->
-<g id="edge14_Node000009_Node000012" class="edge">
-<title>Node9&#45;&gt;Node12</title>
-<g id="a_edge14_Node000009_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.19,-93.78C142.75,-89.26 160.17,-83.46 175.9,-78.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.63,-81.67 185.01,-75.19 174.42,-75.03 176.63,-81.67"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263.25,-19.25 172.25,-19.25 172.25,0 263.25,0 263.25,-19.25"/>
-<text text-anchor="middle" x="217.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::quicksort</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node13 -->
-<g id="edge15_Node000009_Node000013" class="edge">
-<title>Node9&#45;&gt;Node13</title>
-<g id="a_edge15_Node000009_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.64,-91.58C128.61,-89.17 132.68,-86.47 136.25,-83.62 154.46,-69.14 155.17,-61.42 172.25,-45.62 179.33,-39.08 187.44,-32.32 194.77,-26.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.63,-29.45 202.33,-20.52 192.3,-23.95 196.63,-29.45"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node13 -->
-<g id="edge16_Node000013_Node000013" class="edge">
-<title>Node13&#45;&gt;Node13</title>
-<g id="a_edge16_Node000013_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M200.04,-19.54C191.96,-28.15 197.86,-37.25 217.75,-37.25 228.62,-37.25 235.32,-34.53 237.83,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="241.28,-30.07 235.78,-21.02 234.44,-31.53 241.28,-30.07"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
deleted file mode 100644
index e6f59c225..000000000
--- a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
+++ /dev/null
@@ -1,300 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="271pt" height="333pt"
- viewBox="0.00 0.00 271.25 333.11" 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 329.11)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-205.25 0,-205.25 0,-186 37,-186 37,-205.25"/>
-<text text-anchor="middle" x="18.5" y="-191.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.12,-262.25 188.38,-262.25 188.38,-243 247.12,-243 247.12,-262.25"/>
-<text text-anchor="middle" x="217.75" y="-248.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.04,-205.51C40.21,-214.43 56.46,-227.12 73,-233.62 106.4,-246.75 147.19,-251.15 176.77,-252.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.29,-255.96 186.4,-252.8 176.53,-248.96 176.29,-255.96"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="244.5,-319.25 191,-319.25 191,-300 244.5,-300 244.5,-319.25"/>
-<text text-anchor="middle" x="217.75" y="-305.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.66,-205.54C23.96,-228.66 35.72,-285.94 73,-309.62 104.57,-329.68 148.43,-326.26 179.38,-319.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.09,-323.4 189.09,-317.79 178.56,-316.57 180.09,-323.4"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="244.88,-185.25 190.62,-185.25 190.62,-166 244.88,-166 244.88,-185.25"/>
-<text text-anchor="middle" x="217.75" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.91,-185.5C40,-176.47 56.18,-163.87 73,-158.62 107.94,-147.72 149.66,-154.73 179.13,-162.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.14,-166.15 188.72,-165.6 180.11,-159.43 178.14,-166.15"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="136.25,-300.25 73,-300.25 73,-281 136.25,-281 136.25,-300.25"/>
-<text text-anchor="middle" x="104.62" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">show_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.7,-205.44C35,-219.75 53.54,-246.8 73,-266.62 75.31,-268.98 77.84,-271.3 80.44,-273.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.09,-276.12 88.08,-279.65 82.47,-270.66 78.09,-276.12"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="134.38,-187.25 74.88,-187.25 74.88,-168 134.38,-168 134.38,-187.25"/>
-<text text-anchor="middle" x="104.62" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.34,-191.81C45.02,-190.16 54.34,-188.17 63.53,-186.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.03,-189.68 73.08,-184.16 62.57,-182.83 64.03,-189.68"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125,-224.25 84.25,-224.25 84.25,-205 125,-205 125,-224.25"/>
-<text text-anchor="middle" x="104.62" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_f</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.34,-199.65C47.72,-202 61.09,-205.02 73.09,-207.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.05,-211.08 82.57,-209.87 73.59,-204.25 72.05,-211.08"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="128.75,-111.25 80.5,-111.25 80.5,-92 128.75,-92 128.75,-111.25"/>
-<text text-anchor="middle" x="104.62" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_int</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge11_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge11_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.73,-185.96C35.06,-171.86 53.65,-145.21 73,-125.62 75.31,-123.28 77.86,-120.96 80.46,-118.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.48,-121.6 88.1,-112.62 78.1,-116.14 82.48,-121.6"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="131.75,-74.25 77.5,-74.25 77.5,-55 131.75,-55 131.75,-74.25"/>
-<text text-anchor="middle" x="104.62" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node14 -->
-<g id="edge18_Node000001_Node000014" class="edge">
-<title>Node1&#45;&gt;Node14</title>
-<g id="a_edge18_Node000001_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.03,-185.74C27.85,-164.59 44,-114.34 73,-82.62 73.26,-82.34 73.52,-82.06 73.79,-81.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.83,-84.64 81.42,-75.64 71.44,-79.19 75.83,-84.64"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge5_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge5_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.58,-295.92C149.93,-298.2 165.64,-300.89 179.61,-303.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.9,-306.7 189.35,-304.94 180.08,-299.81 178.9,-306.7"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node2 -->
-<g id="edge8_Node000007_Node000002" class="edge">
-<title>Node7&#45;&gt;Node2</title>
-<g id="a_edge8_Node000007_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.49,-221.42C139.97,-226.37 160.05,-233.24 177.69,-239.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.26,-242.48 186.85,-242.4 178.52,-235.85 176.26,-242.48"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge10_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge10_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.49,-207.65C140.48,-202.39 161.49,-195.02 179.57,-188.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.66,-192 188.94,-185.38 178.35,-185.39 180.66,-192"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/qsort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.38,-224.25 189.12,-224.25 189.12,-205 246.38,-205 246.38,-224.25"/>
-<text text-anchor="middle" x="217.75" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::qsort</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge9_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.49,-214.62C139.86,-214.62 159.76,-214.62 177.31,-214.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.19,-218.13 187.19,-214.63 177.19,-211.13 177.19,-218.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node4 -->
-<g id="edge17_Node000009_Node000004" class="edge">
-<title>Node9&#45;&gt;Node4</title>
-<g id="a_edge17_Node000009_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.88,-111.73C124.32,-115.95 130.65,-120.95 136.25,-125.62 152.68,-139.34 154.06,-146.34 172.25,-157.62 174.67,-159.12 177.23,-160.54 179.86,-161.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.21,-164.98 188.76,-165.96 181.13,-158.61 178.21,-164.98"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.12,-148.25 188.38,-148.25 188.38,-129 247.12,-129 247.12,-148.25"/>
-<text text-anchor="middle" x="217.75" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge12_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge12_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.19,-109.47C143.17,-114.13 161.24,-120.14 177.34,-125.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.06,-128.77 186.65,-128.6 178.27,-122.12 176.06,-128.77"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.38,-111.25 192.12,-111.25 192.12,-92 243.38,-92 243.38,-111.25"/>
-<text text-anchor="middle" x="217.75" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge13_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge13_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.19,-101.62C144.1,-101.62 163.67,-101.62 180.53,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.16,-105.13 190.16,-101.63 180.16,-98.13 180.16,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.38,-74.25 180.12,-74.25 180.12,-55 255.38,-55 255.38,-74.25"/>
-<text text-anchor="middle" x="217.75" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node12 -->
-<g id="edge14_Node000009_Node000012" class="edge">
-<title>Node9&#45;&gt;Node12</title>
-<g id="a_edge14_Node000009_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.19,-93.78C142.75,-89.26 160.17,-83.46 175.9,-78.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.63,-81.67 185.01,-75.19 174.42,-75.03 176.63,-81.67"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263.25,-19.25 172.25,-19.25 172.25,0 263.25,0 263.25,-19.25"/>
-<text text-anchor="middle" x="217.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::quicksort</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node13 -->
-<g id="edge15_Node000009_Node000013" class="edge">
-<title>Node9&#45;&gt;Node13</title>
-<g id="a_edge15_Node000009_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.64,-91.58C128.61,-89.17 132.68,-86.47 136.25,-83.62 154.46,-69.14 155.17,-61.42 172.25,-45.62 179.33,-39.08 187.44,-32.32 194.77,-26.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.63,-29.45 202.33,-20.52 192.3,-23.95 196.63,-29.45"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node13 -->
-<g id="edge16_Node000013_Node000013" class="edge">
-<title>Node13&#45;&gt;Node13</title>
-<g id="a_edge16_Node000013_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M200.04,-19.54C191.96,-28.15 197.86,-37.25 217.75,-37.25 228.62,-37.25 235.32,-34.53 237.83,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="241.28,-30.07 235.78,-21.02 234.44,-31.53 241.28,-30.07"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.map b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.map
deleted file mode 100644
index 7b0e7926e..000000000
--- a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="test_f" name="test_f">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,60,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/clock.html#" title=" " alt="" coords="108,5,186,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="59,53,100,35,102,40,61,58"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/qsort.html#" title=" " alt="" coords="109,55,185,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="60,65,93,65,93,70,60,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="111,104,183,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="61,77,102,95,100,100,59,82"/>
-</map>
diff --git a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.md5 b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.md5
deleted file mode 100644
index 1b2c97fd3..000000000
--- a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0a0c68c6c25856ac1d1e01ab44449ce6
\ No newline at end of file
diff --git a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg
deleted file mode 100644
index 33abed718..000000000
--- a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_f Pages: 1 -->
-<svg width="144pt" height="101pt"
- viewBox="0.00 0.00 143.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test_f</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="40.75,-56.25 0,-56.25 0,-37 40.75,-37 40.75,-56.25"/>
-<text text-anchor="middle" x="20.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_f</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.5,-93.25 76.75,-93.25 76.75,-74 135.5,-74 135.5,-93.25"/>
-<text text-anchor="middle" x="106.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M41.22,-55.39C50.41,-59.45 61.58,-64.39 72,-68.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.52,-72.16 81.08,-73 73.34,-65.76 70.52,-72.16"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/qsort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="134.75,-56.25 77.5,-56.25 77.5,-37 134.75,-37 134.75,-56.25"/>
-<text text-anchor="middle" x="106.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::qsort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M41.22,-46.62C48.61,-46.62 57.26,-46.62 65.78,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.67,-50.13 75.67,-46.63 65.67,-43.13 65.67,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="133.25,-19.25 79,-19.25 79,0 133.25,0 133.25,-19.25"/>
-<text text-anchor="middle" x="106.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M41.22,-37.86C50.41,-33.8 61.58,-28.86 72,-24.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.34,-27.49 81.08,-20.25 70.52,-21.09 73.34,-27.49"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph_org.svg b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph_org.svg
deleted file mode 100644
index 433701491..000000000
--- a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_f Pages: 1 -->
-<svg width="144pt" height="101pt"
- viewBox="0.00 0.00 143.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test_f</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="40.75,-56.25 0,-56.25 0,-37 40.75,-37 40.75,-56.25"/>
-<text text-anchor="middle" x="20.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_f</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.5,-93.25 76.75,-93.25 76.75,-74 135.5,-74 135.5,-93.25"/>
-<text text-anchor="middle" x="106.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M41.22,-55.39C50.41,-59.45 61.58,-64.39 72,-68.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.52,-72.16 81.08,-73 73.34,-65.76 70.52,-72.16"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/qsort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="134.75,-56.25 77.5,-56.25 77.5,-37 134.75,-37 134.75,-56.25"/>
-<text text-anchor="middle" x="106.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::qsort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M41.22,-46.62C48.61,-46.62 57.26,-46.62 65.78,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.67,-50.13 75.67,-46.63 65.67,-43.13 65.67,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="133.25,-19.25 79,-19.25 79,0 133.25,0 133.25,-19.25"/>
-<text text-anchor="middle" x="106.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M41.22,-37.86C50.41,-33.8 61.58,-28.86 72,-24.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.34,-27.49 81.08,-20.25 70.52,-21.09 73.34,-27.49"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.map b/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.map
deleted file mode 100644
index ccab644f4..000000000
--- a/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="show_data" name="show_data">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,90,31"/>
-<area shape="rect" id="Node000002" href="$d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246" title=" " alt="" coords="138,5,222,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="90,16,122,16,122,21,90,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="270,5,341,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="223,16,254,16,254,21,223,21"/>
-</map>
diff --git a/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.md5 b/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.md5
deleted file mode 100644
index 8b5878dce..000000000
--- a/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-053ef847c20151f8ae5f0ee29525c1d0
\ No newline at end of file
diff --git a/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.svg b/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.svg
deleted file mode 100644
index 064e7cf53..000000000
--- a/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: show_data Pages: 1 -->
-<svg width="260pt" height="27pt"
- viewBox="0.00 0.00 260.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>show_data</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="63.25,-19.25 0,-19.25 0,0 63.25,0 63.25,-19.25"/>
-<text text-anchor="middle" x="31.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">show_data</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="162.5,-19.25 99.25,-19.25 99.25,0 162.5,0 162.5,-19.25"/>
-<text text-anchor="middle" x="130.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">show_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.66,-9.62C71.21,-9.62 79.4,-9.62 87.38,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.28,-13.13 97.28,-9.63 87.28,-6.13 87.28,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252,-19.25 198.5,-19.25 198.5,0 252,0 252,-19.25"/>
-<text text-anchor="middle" x="225.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.89,-9.62C170.57,-9.62 178.87,-9.62 186.82,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="186.58,-13.13 196.58,-9.63 186.58,-6.13 186.58,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph_org.svg b/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph_org.svg
deleted file mode 100644
index 908018736..000000000
--- a/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: show_data Pages: 1 -->
-<svg width="260pt" height="27pt"
- viewBox="0.00 0.00 260.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>show_data</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="63.25,-19.25 0,-19.25 0,0 63.25,0 63.25,-19.25"/>
-<text text-anchor="middle" x="31.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">show_data</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="162.5,-19.25 99.25,-19.25 99.25,0 162.5,0 162.5,-19.25"/>
-<text text-anchor="middle" x="130.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">show_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.66,-9.62C71.21,-9.62 79.4,-9.62 87.38,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.28,-13.13 97.28,-9.63 87.28,-6.13 87.28,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252,-19.25 198.5,-19.25 198.5,0 252,0 252,-19.25"/>
-<text text-anchor="middle" x="225.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.89,-9.62C170.57,-9.62 178.87,-9.62 186.82,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="186.58,-13.13 196.58,-9.63 186.58,-6.13 186.58,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.map b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.map
deleted file mode 100644
index 214f2df73..000000000
--- a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="test_int" name="test_int">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,70,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/clock.html#" title=" " alt="" coords="118,5,196,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="69,52,109,35,111,40,71,57"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/qsort.html#" title=" " alt="" coords="119,55,195,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="70,65,103,65,103,70,70,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="121,104,193,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="71,78,111,95,109,100,69,83"/>
-</map>
diff --git a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.md5 b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.md5
deleted file mode 100644
index 18567d6a4..000000000
--- a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2e4370564ea8b61716bd60fa4bae105c
\ No newline at end of file
diff --git a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg
deleted file mode 100644
index f6800657c..000000000
--- a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_int Pages: 1 -->
-<svg width="151pt" height="101pt"
- viewBox="0.00 0.00 151.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test_int</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="48.25,-56.25 0,-56.25 0,-37 48.25,-37 48.25,-56.25"/>
-<text text-anchor="middle" x="24.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_int</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143,-93.25 84.25,-93.25 84.25,-74 143,-74 143,-93.25"/>
-<text text-anchor="middle" x="113.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M48.57,-56.54C57.72,-60.41 68.38,-64.92 78.36,-69.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.84,-72.29 87.41,-72.96 79.57,-65.85 76.84,-72.29"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/qsort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="142.25,-56.25 85,-56.25 85,-37 142.25,-37 142.25,-56.25"/>
-<text text-anchor="middle" x="113.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::qsort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M48.57,-46.62C56.23,-46.62 64.95,-46.62 73.44,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.24,-50.13 83.24,-46.63 73.24,-43.13 73.24,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="140.75,-19.25 86.5,-19.25 86.5,0 140.75,0 140.75,-19.25"/>
-<text text-anchor="middle" x="113.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M48.57,-36.71C57.72,-32.84 68.38,-28.33 78.36,-24.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.57,-27.4 87.41,-20.29 76.84,-20.96 79.57,-27.4"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph_org.svg b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph_org.svg
deleted file mode 100644
index a4049cf15..000000000
--- a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_int Pages: 1 -->
-<svg width="151pt" height="101pt"
- viewBox="0.00 0.00 151.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test_int</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="48.25,-56.25 0,-56.25 0,-37 48.25,-37 48.25,-56.25"/>
-<text text-anchor="middle" x="24.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_int</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143,-93.25 84.25,-93.25 84.25,-74 143,-74 143,-93.25"/>
-<text text-anchor="middle" x="113.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M48.57,-56.54C57.72,-60.41 68.38,-64.92 78.36,-69.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.84,-72.29 87.41,-72.96 79.57,-65.85 76.84,-72.29"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/qsort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="142.25,-56.25 85,-56.25 85,-37 142.25,-37 142.25,-56.25"/>
-<text text-anchor="middle" x="113.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::qsort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M48.57,-46.62C56.23,-46.62 64.95,-46.62 73.44,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.24,-50.13 83.24,-46.63 73.24,-43.13 73.24,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="140.75,-19.25 86.5,-19.25 86.5,0 140.75,0 140.75,-19.25"/>
-<text text-anchor="middle" x="113.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M48.57,-36.71C57.72,-32.84 68.38,-28.33 78.36,-24.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.57,-27.4 87.41,-20.29 76.84,-20.96 79.57,-27.4"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.map b/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.map
deleted file mode 100644
index 7e4709acc..000000000
--- a/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="show_data" name="show_data">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,90,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="138,5,209,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="90,16,122,16,122,21,90,21"/>
-</map>
diff --git a/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.md5 b/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.md5
deleted file mode 100644
index c4c9dfcdc..000000000
--- a/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a08b06d83bd259837531a0f4b4b5e684
\ No newline at end of file
diff --git a/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.svg b/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.svg
deleted file mode 100644
index 7230962bd..000000000
--- a/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: show_data Pages: 1 -->
-<svg width="161pt" height="27pt"
- viewBox="0.00 0.00 160.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>show_data</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="63.25,-19.25 0,-19.25 0,0 63.25,0 63.25,-19.25"/>
-<text text-anchor="middle" x="31.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">show_data</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152.75,-19.25 99.25,-19.25 99.25,0 152.75,0 152.75,-19.25"/>
-<text text-anchor="middle" x="126" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.64,-9.62C71.32,-9.62 79.62,-9.62 87.57,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.33,-13.13 97.33,-9.63 87.33,-6.13 87.33,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph_org.svg b/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph_org.svg
deleted file mode 100644
index 97e27707e..000000000
--- a/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: show_data Pages: 1 -->
-<svg width="161pt" height="27pt"
- viewBox="0.00 0.00 160.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>show_data</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="63.25,-19.25 0,-19.25 0,0 63.25,0 63.25,-19.25"/>
-<text text-anchor="middle" x="31.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">show_data</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152.75,-19.25 99.25,-19.25 99.25,0 152.75,0 152.75,-19.25"/>
-<text text-anchor="middle" x="126" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.64,-9.62C71.32,-9.62 79.62,-9.62 87.57,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.33,-13.13 97.33,-9.63 87.33,-6.13 87.33,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d7a/shell__sort2_8cpp_source.html b/d4/d7a/shell__sort2_8cpp_source.html
new file mode 100644
index 000000000..584df074b
--- /dev/null
+++ b/d4/d7a/shell__sort2_8cpp_source.html
@@ -0,0 +1,362 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/shell_sort2.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d7a/shell__sort2_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">shell_sort2.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/d7a/shell__sort2_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;cstdlib&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;utility&gt;</span>  <span class="comment">// for std::swap</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
+<div class="foldopen" id="foldopen00018" data-start="{" data-end="}">
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"><a class="line" href="../../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246">   18</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246">show_data</a>(T *arr, <span class="keywordtype">size_t</span> LEN) {</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    <span class="keywordtype">size_t</span> i;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keywordflow">for</span> (i = 0; i &lt; LEN; i++) {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    }</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>}</div>
+</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keywordtype">size_t</span> N&gt;</div>
+<div class="foldopen" id="foldopen00032" data-start="{" data-end="}">
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../d4/d7a/shell__sort2_8cpp.html#a63aaff7cabfa3da2da8b9477b5fad9d6">   32</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246">show_data</a>(T (&amp;arr)[N]) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246">show_data</a>(arr, N);</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>}</div>
+</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00045" data-start="{" data-end="}">
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa">   45</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa">shell_sort</a>(T *arr, <span class="keywordtype">size_t</span> LEN) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> gaps[] = {701, 301, 132, 57, 23, 10, 4, 1};</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> gap_len = 8;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordtype">size_t</span> i, j, g;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordflow">for</span> (g = 0; g &lt; gap_len; g++) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> gap = gaps[g];</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        <span class="keywordflow">for</span> (i = gap; i &lt; LEN; i++) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            T tmp = arr[i];</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            <span class="keywordflow">for</span> (j = i; j &gt;= gap &amp;&amp; (arr[j - gap] - tmp) &gt; 0; j -= gap) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>                arr[j] = arr[j - gap];</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            }</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            arr[j] = tmp;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        }</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    }</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>}</div>
+</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keywordtype">size_t</span> N&gt;</div>
+<div class="foldopen" id="foldopen00067" data-start="{" data-end="}">
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#a4d76603c54d3dc56146e92d10a043924">   67</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa">shell_sort</a>(T (&amp;arr)[N]) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa">shell_sort</a>(arr, N);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>}</div>
+</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00075" data-start="{" data-end="}">
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331">   75</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa">shell_sort</a>(std::vector&lt;T&gt; *arr) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa">shell_sort</a>(arr-&gt;data(), arr-&gt;size());</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>}</div>
+</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span><span class="keyword">using </span><a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa">sorting::shell_sort</a>;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00087" data-start="{" data-end="}">
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"><a class="line" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">   87</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(<span class="keyword">const</span> <span class="keywordtype">void</span> *a, <span class="keyword">const</span> <span class="keywordtype">void</span> *b) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    T arg1 = *<span class="keyword">static_cast&lt;</span><span class="keyword">const </span>T *<span class="keyword">&gt;</span>(a);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    T arg2 = *<span class="keyword">static_cast&lt;</span><span class="keyword">const </span>T *<span class="keyword">&gt;</span>(b);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordflow">if</span> (arg1 &lt; arg2)</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="keywordflow">if</span> (arg1 &gt; arg2)</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="keywordflow">return</span> 1;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="comment">//  return (arg1 &gt; arg2) - (arg1 &lt; arg2); // possible shortcut</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="comment">//  return arg1 - arg2; // erroneous shortcut (fails if INT_MIN is present)</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>}</div>
+</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="foldopen" id="foldopen00105" data-start="{" data-end="}">
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"><a class="line" href="../../d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e">  105</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">test_int</a>(<span class="keyword">const</span> <span class="keywordtype">int</span> NUM_DATA) {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="comment">// int array = new int[NUM_DATA];</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <span class="keywordtype">int</span> *<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> = <span class="keyword">new</span> <span class="keywordtype">int</span>[NUM_DATA];</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="keywordtype">int</span> *data2 = <span class="keyword">new</span> <span class="keywordtype">int</span>[NUM_DATA];</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="comment">// int array2 = new int[NUM_DATA];</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordtype">int</span> range = 1800;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; NUM_DATA; i++)</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] = data2[i] = (std::rand() % range) - (range &gt;&gt; 1);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <span class="comment">/* sort using our implementation */</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::clock_t start = std::clock();</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    shell_sort(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, NUM_DATA);</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    std::clock_t end = std::clock();</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <span class="keywordtype">double</span> elapsed_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end - start) / CLOCKS_PER_SEC;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Time spent sorting using shell_sort2: &quot;</span> &lt;&lt; elapsed_time</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>              &lt;&lt; <span class="stringliteral">&quot;s\n&quot;</span>;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span> </div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    <span class="comment">/* sort using std::qsort */</span></div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    start = std::clock();</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    std::qsort(data2, NUM_DATA, <span class="keyword">sizeof</span>(data2[0]), <a class="code hl_struct" href="../../d1/db3/structcompare.html">compare&lt;int&gt;</a>);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    end = std::clock();</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span> </div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    elapsed_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end - start) / CLOCKS_PER_SEC;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Time spent sorting using std::qsort: &quot;</span> &lt;&lt; elapsed_time</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>              &lt;&lt; <span class="stringliteral">&quot;s\n&quot;</span>;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; NUM_DATA; i++) {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        assert(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] == data2[i]);  <span class="comment">// ensure that our sorting results match</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>                                      <span class="comment">// the standard results</span></div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    }</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span> </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <span class="keyword">delete</span>[] <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <span class="keyword">delete</span>[] data2;</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>}</div>
+</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span> </div>
+<div class="foldopen" id="foldopen00145" data-start="{" data-end="}">
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"><a class="line" href="../../d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d">  145</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d">test_f</a>(<span class="keyword">const</span> <span class="keywordtype">int</span> NUM_DATA) {</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    <span class="comment">// int array = new int[NUM_DATA];</span></div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    <span class="keywordtype">float</span> *<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> = <span class="keyword">new</span> <span class="keywordtype">float</span>[NUM_DATA];</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    <span class="keywordtype">float</span> *data2 = <span class="keyword">new</span> <span class="keywordtype">float</span>[NUM_DATA];</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    <span class="comment">// int array2 = new int[NUM_DATA];</span></div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    <span class="keywordtype">int</span> range = 1000;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; NUM_DATA; i++) {</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] = data2[i] = ((std::rand() % range) - (range &gt;&gt; 1)) / 100.;</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    }</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span> </div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    <span class="comment">/* sort using our implementation */</span></div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    std::clock_t start = std::clock();</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    shell_sort(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, NUM_DATA);</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    std::clock_t end = std::clock();</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    <span class="keywordtype">double</span> elapsed_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end - start) / CLOCKS_PER_SEC;</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Time spent sorting using shell_sort2: &quot;</span> &lt;&lt; elapsed_time</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>              &lt;&lt; <span class="stringliteral">&quot;s\n&quot;</span>;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span> </div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    <span class="comment">/* sort using std::qsort */</span></div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    start = std::clock();</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    std::qsort(data2, NUM_DATA, <span class="keyword">sizeof</span>(data2[0]), <a class="code hl_struct" href="../../d1/db3/structcompare.html">compare&lt;float&gt;</a>);</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    end = std::clock();</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span> </div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    elapsed_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end - start) / CLOCKS_PER_SEC;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Time spent sorting using std::qsort: &quot;</span> &lt;&lt; elapsed_time</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>              &lt;&lt; <span class="stringliteral">&quot;s\n&quot;</span>;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span> </div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; NUM_DATA; i++) {</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        assert(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] == data2[i]);  <span class="comment">// ensure that our sorting results match</span></div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>                                      <span class="comment">// the standard results</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    }</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span> </div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    <span class="keyword">delete</span>[] <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    <span class="keyword">delete</span>[] data2;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>}</div>
+</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span> </div>
+<div class="foldopen" id="foldopen00183" data-start="{" data-end="}">
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"><a class="line" href="../../d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">  183</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[]) {</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    <span class="comment">// initialize random number generator - once per program</span></div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    std::srand(std::time(NULL));</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span> </div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    <a class="code hl_function" href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">test_int</a>(100);  <span class="comment">// test with sorting random array of 100 values</span></div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 - 100 int values - passed. \n&quot;</span>;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    <a class="code hl_function" href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">test_int</a>(1000);  <span class="comment">// test with sorting random array of 1000 values</span></div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 - 1000 int values - passed.\n&quot;</span>;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    <a class="code hl_function" href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">test_int</a>(10000);  <span class="comment">// test with sorting random array of 10000 values</span></div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 - 10000 int values - passed.\n&quot;</span>;</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span> </div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    <a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d">test_f</a>(100);  <span class="comment">// test with sorting random array of 100 values</span></div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 - 100 float values - passed. \n&quot;</span>;</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    <a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d">test_f</a>(1000);  <span class="comment">// test with sorting random array of 1000 values</span></div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 - 1000 float values - passed.\n&quot;</span>;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    <a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d">test_f</a>(10000);  <span class="comment">// test with sorting random array of 10000 values</span></div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 - 10000 float values - passed.\n&quot;</span>;</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span> </div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    <span class="keywordtype">int</span> i, NUM_DATA;</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span> </div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    <span class="keywordflow">if</span> (argc == 2)</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>        NUM_DATA = atoi(argv[1]);</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>        NUM_DATA = 200;</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span> </div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    <span class="comment">// int array = new int[NUM_DATA];</span></div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    <span class="keywordtype">int</span> *<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> = <span class="keyword">new</span> <span class="keywordtype">int</span>[NUM_DATA];</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    <span class="comment">// int array2 = new int[NUM_DATA];</span></div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    <span class="keywordtype">int</span> range = 1800;</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span> </div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    std::srand(time(NULL));</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    <span class="keywordflow">for</span> (i = 0; i &lt; NUM_DATA; i++) {</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>        <span class="comment">// allocate random numbers in the given range</span></div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] = (std::rand() % range) - (range &gt;&gt; 1);</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    }</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span> </div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Unsorted original data: &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    <a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246">show_data</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, NUM_DATA);</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    std::clock_t start = std::clock();</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    shell_sort(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, NUM_DATA);  <span class="comment">// perform sorting</span></div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    std::clock_t end = std::clock();</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span> </div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    std::cout &lt;&lt; std::endl</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>              &lt;&lt; <span class="stringliteral">&quot;Data Sorted using custom implementation: &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    <a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246">show_data</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, NUM_DATA);</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span> </div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    <span class="keywordtype">double</span> elapsed_time = (end - start) * 1.f / CLOCKS_PER_SEC;</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Time spent sorting: &quot;</span> &lt;&lt; elapsed_time &lt;&lt; <span class="stringliteral">&quot;s\n&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span> </div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    <span class="keyword">delete</span>[] <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>}</div>
+</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+<div class="ttc" id="anamespacesorting_html_a5669396c6a6b1e14b97589b6e37980aa"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa">sorting::shell_sort</a></div><div class="ttdeci">void shell_sort(T *arr, size_t LEN)</div><div class="ttdef"><b>Definition</b> <a href="#l00045">shell_sort2.cpp:45</a></div></div>
+<div class="ttc" id="aquick__sort__3_8cpp_html_a07e5c62de28aeddea986890ce7ac1bda"><div class="ttname"><a href="../../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">test_int</a></div><div class="ttdeci">static void test_int()</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d4c/quick__sort__3_8cpp_source.html#l00138">quick_sort_3.cpp:138</a></div></div>
+<div class="ttc" id="ashell__sort2_8cpp_html_a22ea0d1f7943ebb4371d31e44b465b6d"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d">test_f</a></div><div class="ttdeci">void test_f(const int NUM_DATA)</div><div class="ttdef"><b>Definition</b> <a href="#l00145">shell_sort2.cpp:145</a></div></div>
+<div class="ttc" id="ashell__sort2_8cpp_html_a7eb77daed2cf1513f6d68c47a1c2db1c"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a></div><div class="ttdeci">int compare(const void *a, const void *b)</div><div class="ttdef"><b>Definition</b> <a href="#l00087">shell_sort2.cpp:87</a></div></div>
+<div class="ttc" id="ashell__sort2_8cpp_html_a951127aea9d7e1e53ea9ae0868633246"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246">show_data</a></div><div class="ttdeci">void show_data(T *arr, size_t LEN)</div><div class="ttdef"><b>Definition</b> <a href="#l00018">shell_sort2.cpp:18</a></div></div>
+<div class="ttc" id="astructcompare_html"><div class="ttname"><a href="../../d1/db3/structcompare.html">compare</a></div><div class="ttdef"><b>Definition</b> <a href="../../d5/d8e/huffman_8cpp_source.html#l00036">huffman.cpp:36</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d4/d7a/shell__sort2_8cpp.html">shell_sort2.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d83/sum__of__digits_8cpp.html b/d4/d83/sum__of__digits_8cpp.html
index 9a4127cd4..609cb9319 100644
--- a/d4/d83/sum__of__digits_8cpp.html
+++ b/d4/d83/sum__of__digits_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/sum_of_digits.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/sum_of_digits.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,7 +136,9 @@ Include dependency graph for sum_of_digits.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/dcd/sum__of__digits_8cpp__incl.svg" width="174" height="111"><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">
+</div>
+<p><a href="../../d4/d83/sum__of__digits_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a4619c78b6ad985713024f930f31c4395" id="r_a4619c78b6ad985713024f930f31c4395"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4619c78b6ad985713024f930f31c4395">sum_of_digits</a> (int num)</td></tr>
@@ -136,6 +155,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A C++ Program to find the Sum of Digits of input integer. </p>
 <p>Copyright 2020 </p><dl class="section author"><dt>Author</dt><dd>iamnambiar </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d83/sum__of__digits_8cpp_source.html">sum_of_digits.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -152,20 +173,15 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main Function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d83/sum__of__digits_8cpp_source.html#l00068">68</a> of file <a class="el" href="../../d4/d83/sum__of__digits_8cpp_source.html">sum_of_digits.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   68</span>           {</div>
 <div class="line"><span class="lineno">   69</span>    <a class="code hl_function" href="#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
-<div class="line"><span class="lineno">   70</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Success.&quot;</span> &lt;&lt; <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">   70</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Success.&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   71</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   72</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="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="asum__of__digits_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> sum_of_digits.cpp:58</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="428" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asum__of__digits_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d83/sum__of__digits_8cpp_source.html#l00058">sum_of_digits.cpp:58</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4619c78b6ad985713024f930f31c4395" name="a4619c78b6ad985713024f930f31c4395"></a>
@@ -190,6 +206,8 @@ Here is the call graph for this function:</div>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Sum of the digits of the integer.</dd></dl>
 <p>\detail First the algorithm check whether the num is negative or positive, if it is negative, then we neglect the negative sign. Next, the algorithm extract the last digit of num by dividing by 10 and extracting the remainder and this is added to the sum. The number is then divided by 10 to remove the last digit. This loop continues until num becomes 0. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d83/sum__of__digits_8cpp_source.html#l00023">23</a> of file <a class="el" href="../../d4/d83/sum__of__digits_8cpp_source.html">sum_of_digits.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   23</span>                           {</div>
 <div class="line"><span class="lineno">   24</span>    <span class="comment">// If num is negative then negative sign is neglected.</span></div>
 <div class="line"><span class="lineno">   25</span>    <span class="keywordflow">if</span> (num &lt; 0) {</div>
@@ -202,7 +220,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   32</span>    }</div>
 <div class="line"><span class="lineno">   33</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">   34</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&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:232</div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00232">vector_ops.hpp:232</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -221,20 +239,17 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Function for testing the <a class="el" href="#a4619c78b6ad985713024f930f31c4395">sum_of_digits()</a> with all the test cases. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d83/sum__of__digits_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d4/d83/sum__of__digits_8cpp_source.html">sum_of_digits.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   58</span>            {</div>
 <div class="line"><span class="lineno">   59</span>    <span class="comment">// First test.</span></div>
 <div class="line"><span class="lineno">   60</span>    <a class="code hl_function" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();</div>
 <div class="line"><span class="lineno">   61</span>    <span class="comment">// Second test.</span></div>
 <div class="line"><span class="lineno">   62</span>    <a class="code hl_function" href="#a0283886819c7c140a023582b7269e2d0">test2</a>();</div>
 <div class="line"><span class="lineno">   63</span>}</div>
-<div class="ttc" id="asum__of__digits_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> sum_of_digits.cpp:49</div></div>
-<div class="ttc" id="asum__of__digits_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition</b> sum_of_digits.cpp:40</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d83/sum__of__digits_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg" width="303" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asum__of__digits_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d83/sum__of__digits_8cpp_source.html#l00049">sum_of_digits.cpp:49</a></div></div>
+<div class="ttc" id="asum__of__digits_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d83/sum__of__digits_8cpp_source.html#l00040">sum_of_digits.cpp:40</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1440a7779ac56f47a3f355ce4a8c7da0" name="a1440a7779ac56f47a3f355ce4a8c7da0"></a>
@@ -252,17 +267,14 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Function for testing the <a class="el" href="#a4619c78b6ad985713024f930f31c4395">sum_of_digits()</a> function with a first test case of 119765 and assert statement. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d83/sum__of__digits_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../d4/d83/sum__of__digits_8cpp_source.html">sum_of_digits.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   40</span>             {</div>
 <div class="line"><span class="lineno">   41</span>    <span class="keywordtype">int</span> test_case_1 = <a class="code hl_function" href="#a4619c78b6ad985713024f930f31c4395">sum_of_digits</a>(119765);</div>
 <div class="line"><span class="lineno">   42</span>    assert(test_case_1 == 29);</div>
 <div class="line"><span class="lineno">   43</span>}</div>
-<div class="ttc" id="asum__of__digits_8cpp_html_a4619c78b6ad985713024f930f31c4395"><div class="ttname"><a href="#a4619c78b6ad985713024f930f31c4395">sum_of_digits</a></div><div class="ttdeci">int sum_of_digits(int num)</div><div class="ttdef"><b>Definition</b> sum_of_digits.cpp:23</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d83/sum__of__digits_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg" width="212" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asum__of__digits_8cpp_html_a4619c78b6ad985713024f930f31c4395"><div class="ttname"><a href="#a4619c78b6ad985713024f930f31c4395">sum_of_digits</a></div><div class="ttdeci">int sum_of_digits(int num)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d83/sum__of__digits_8cpp_source.html#l00023">sum_of_digits.cpp:23</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0283886819c7c140a023582b7269e2d0" name="a0283886819c7c140a023582b7269e2d0"></a>
@@ -280,16 +292,13 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Function for testing the <a class="el" href="#a4619c78b6ad985713024f930f31c4395">sum_of_digits()</a> function with a second test case of -12256 and assert statement. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d83/sum__of__digits_8cpp_source.html#l00049">49</a> of file <a class="el" href="../../d4/d83/sum__of__digits_8cpp_source.html">sum_of_digits.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   49</span>             {</div>
 <div class="line"><span class="lineno">   50</span>    <span class="keywordtype">int</span> test_case_2 = <a class="code hl_function" href="#a4619c78b6ad985713024f930f31c4395">sum_of_digits</a>(-12256);</div>
 <div class="line"><span class="lineno">   51</span>    assert(test_case_2 == 16);</div>
 <div class="line"><span class="lineno">   52</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d83/sum__of__digits_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg" width="212" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/d83/sum__of__digits_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/d4/d83/sum__of__digits_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
deleted file mode 100644
index f7ea7777c..000000000
--- a/d4/d83/sum__of__digits_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test2" name="test2">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,56,31"/>
-<area shape="rect" id="Node000002" href="$d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395" title=" " alt="" coords="104,5,206,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,16,88,16,88,21,56,21"/>
-</map>
diff --git a/d4/d83/sum__of__digits_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/d4/d83/sum__of__digits_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
deleted file mode 100644
index 8d0de61ed..000000000
--- a/d4/d83/sum__of__digits_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7f7b2d31bf24ecd5ad0eaa07b92299fd
\ No newline at end of file
diff --git a/d4/d83/sum__of__digits_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/d4/d83/sum__of__digits_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
deleted file mode 100644
index 2816c4ec8..000000000
--- a/d4/d83/sum__of__digits_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="159pt" height="27pt"
- viewBox="0.00 0.00 158.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.5,-19.25 73.75,-19.25 73.75,0 150.5,0 150.5,-19.25"/>
-<text text-anchor="middle" x="112.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sum_of_digits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.9,-9.62C44.98,-9.62 53.48,-9.62 62.14,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62,-13.13 72,-9.63 62,-6.13 62,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d83/sum__of__digits_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/d4/d83/sum__of__digits_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
deleted file mode 100644
index 778c575ff..000000000
--- a/d4/d83/sum__of__digits_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="159pt" height="27pt"
- viewBox="0.00 0.00 158.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.5,-19.25 73.75,-19.25 73.75,0 150.5,0 150.5,-19.25"/>
-<text text-anchor="middle" x="112.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sum_of_digits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.9,-9.62C44.98,-9.62 53.48,-9.62 62.14,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62,-13.13 72,-9.63 62,-6.13 62,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d83/sum__of__digits_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/d4/d83/sum__of__digits_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
deleted file mode 100644
index 0760dec61..000000000
--- a/d4/d83/sum__of__digits_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test1" name="test1">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,56,31"/>
-<area shape="rect" id="Node000002" href="$d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395" title=" " alt="" coords="104,5,206,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,16,88,16,88,21,56,21"/>
-</map>
diff --git a/d4/d83/sum__of__digits_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/d4/d83/sum__of__digits_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
deleted file mode 100644
index 64253899e..000000000
--- a/d4/d83/sum__of__digits_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5abf03389fd24f8276b8698078ffbc6c
\ No newline at end of file
diff --git a/d4/d83/sum__of__digits_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg b/d4/d83/sum__of__digits_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
deleted file mode 100644
index cb5b0aa8d..000000000
--- a/d4/d83/sum__of__digits_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="159pt" height="27pt"
- viewBox="0.00 0.00 158.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.5,-19.25 73.75,-19.25 73.75,0 150.5,0 150.5,-19.25"/>
-<text text-anchor="middle" x="112.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sum_of_digits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.9,-9.62C44.98,-9.62 53.48,-9.62 62.14,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62,-13.13 72,-9.63 62,-6.13 62,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d83/sum__of__digits_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/d4/d83/sum__of__digits_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
deleted file mode 100644
index b3023baf4..000000000
--- a/d4/d83/sum__of__digits_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="159pt" height="27pt"
- viewBox="0.00 0.00 158.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.5,-19.25 73.75,-19.25 73.75,0 150.5,0 150.5,-19.25"/>
-<text text-anchor="middle" x="112.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sum_of_digits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.9,-9.62C44.98,-9.62 53.48,-9.62 62.14,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62,-13.13 72,-9.63 62,-6.13 62,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d83/sum__of__digits_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map b/d4/d83/sum__of__digits_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
deleted file mode 100644
index c5a1b814a..000000000
--- a/d4/d83/sum__of__digits_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,49,56"/>
-<area shape="rect" id="Node000002" href="$d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" title=" " alt="" coords="97,5,147,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,35,81,26,82,31,50,40"/>
-<area shape="rect" id="Node000004" href="$d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0" title=" " alt="" coords="97,55,147,80"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="50,46,82,55,81,60,49,52"/>
-<area shape="rect" id="Node000003" href="$d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395" title=" " alt="" coords="195,31,297,56"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="148,21,180,27,179,33,147,26"/>
-<area shape="poly" id="edge4_Node000004_Node000003" title=" " alt="" coords="147,60,179,54,180,59,148,65"/>
-</map>
diff --git a/d4/d83/sum__of__digits_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5 b/d4/d83/sum__of__digits_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
deleted file mode 100644
index 714f50441..000000000
--- a/d4/d83/sum__of__digits_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7c6fa07aaf777999d3c62a29e8448dfc
\ No newline at end of file
diff --git a/d4/d83/sum__of__digits_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg b/d4/d83/sum__of__digits_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
deleted file mode 100644
index acd9fe9bc..000000000
--- a/d4/d83/sum__of__digits_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
+++ /dev/null
@@ -1,110 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="227pt" height="64pt"
- viewBox="0.00 0.00 227.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="106.25,-56.25 68.5,-56.25 68.5,-37 106.25,-37 106.25,-56.25"/>
-<text text-anchor="middle" x="87.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.94,-31.94C40.11,-33.91 48.85,-36.31 57.17,-38.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.03,-41.91 66.6,-41.19 57.88,-35.16 56.03,-41.91"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="106.25,-19.25 68.5,-19.25 68.5,0 106.25,0 106.25,-19.25"/>
-<text text-anchor="middle" x="87.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.94,-23.54C40.11,-21.67 48.85,-19.4 57.17,-17.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.8,-20.68 66.59,-14.78 56.04,-13.91 57.8,-20.68"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219,-37.25 142.25,-37.25 142.25,-18 219,-18 219,-37.25"/>
-<text text-anchor="middle" x="180.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">sum_of_digits</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.4,-42.87C113.56,-41.38 122.17,-39.59 130.93,-37.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.45,-41.23 140.53,-35.77 130.03,-34.38 131.45,-41.23"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.4,-13.18C113.56,-14.59 122.17,-16.29 130.93,-18.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.04,-21.41 140.53,-19.91 131.39,-14.54 130.04,-21.41"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d83/sum__of__digits_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg b/d4/d83/sum__of__digits_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
deleted file mode 100644
index 07d390b4b..000000000
--- a/d4/d83/sum__of__digits_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="227pt" height="64pt"
- viewBox="0.00 0.00 227.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="106.25,-56.25 68.5,-56.25 68.5,-37 106.25,-37 106.25,-56.25"/>
-<text text-anchor="middle" x="87.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.94,-31.94C40.11,-33.91 48.85,-36.31 57.17,-38.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.03,-41.91 66.6,-41.19 57.88,-35.16 56.03,-41.91"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="106.25,-19.25 68.5,-19.25 68.5,0 106.25,0 106.25,-19.25"/>
-<text text-anchor="middle" x="87.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.94,-23.54C40.11,-21.67 48.85,-19.4 57.17,-17.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.8,-20.68 66.59,-14.78 56.04,-13.91 57.8,-20.68"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219,-37.25 142.25,-37.25 142.25,-18 219,-18 219,-37.25"/>
-<text text-anchor="middle" x="180.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">sum_of_digits</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.4,-42.87C113.56,-41.38 122.17,-39.59 130.93,-37.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.45,-41.23 140.53,-35.77 130.03,-34.38 131.45,-41.23"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.4,-13.18C113.56,-14.59 122.17,-16.29 130.93,-18.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.04,-21.41 140.53,-19.91 131.39,-14.54 130.04,-21.41"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index a0988006c..000000000
--- a/d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,14 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,35,87,27,88,33,56,40"/>
-<area shape="rect" id="Node000003" href="$d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" title=" " alt="" coords="117,55,160,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,46,102,57,101,62,55,52"/>
-<area shape="rect" id="Node000004" href="$d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" title=" " alt="" coords="222,29,272,55"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="160,60,206,49,207,54,161,65"/>
-<area shape="rect" id="Node000006" href="$d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0" title=" " alt="" coords="222,79,272,104"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="161,70,207,80,206,85,160,75"/>
-<area shape="rect" id="Node000005" href="$d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395" title=" " alt="" coords="320,55,423,80"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="273,45,306,51,305,57,272,50"/>
-<area shape="poly" id="edge6_Node000006_Node000005" title=" " alt="" coords="272,84,305,78,306,83,273,89"/>
-</map>
diff --git a/d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index bbf7e1be0..000000000
--- a/d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a81ae16ff7bf8ee7ea663c7ccce4c436
\ No newline at end of file
diff --git a/d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 1cd306d7a..000000000
--- a/d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,146 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="321pt" height="82pt"
- viewBox="0.00 0.00 321.00 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-55.25 0,-55.25 0,-36 37,-36 37,-55.25"/>
-<text text-anchor="middle" x="18.5" y="-41.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-74.25 73,-74.25 73,-55 126.5,-55 126.5,-74.25"/>
-<text text-anchor="middle" x="99.75" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-49.94C44.64,-51.65 53.16,-53.69 61.53,-55.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.71,-59.1 71.25,-58.03 62.34,-52.3 60.71,-59.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116,-37.25 83.5,-37.25 83.5,-18 116,-18 116,-37.25"/>
-<text text-anchor="middle" x="99.75" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-41.54C47.72,-39.22 60.73,-36.26 72.13,-33.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.79,-37.11 81.77,-31.48 71.24,-30.28 72.79,-37.11"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.25,-56.25 162.5,-56.25 162.5,-37 200.25,-37 200.25,-56.25"/>
-<text text-anchor="middle" x="181.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.48,-31.38C126.34,-33.73 139.35,-36.84 151.06,-39.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.16,-43.01 160.7,-41.93 151.78,-36.2 150.16,-43.01"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.25,-19.25 162.5,-19.25 162.5,0 200.25,0 200.25,-19.25"/>
-<text text-anchor="middle" x="181.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.48,-24.07C126.34,-21.84 139.35,-18.9 151.06,-16.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.71,-19.69 160.69,-14.07 150.17,-12.87 151.71,-19.69"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="313,-37.25 236.25,-37.25 236.25,-18 313,-18 313,-37.25"/>
-<text text-anchor="middle" x="274.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">sum_of_digits</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M200.4,-42.87C207.56,-41.38 216.17,-39.59 224.93,-37.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.45,-41.23 234.53,-35.77 224.03,-34.38 225.45,-41.23"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge6_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge6_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M200.4,-13.18C207.56,-14.59 216.17,-16.29 224.93,-18.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.04,-21.41 234.53,-19.91 225.39,-14.54 224.04,-21.41"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 0a5e91c79..000000000
--- a/d4/d83/sum__of__digits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="321pt" height="82pt"
- viewBox="0.00 0.00 321.00 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-55.25 0,-55.25 0,-36 37,-36 37,-55.25"/>
-<text text-anchor="middle" x="18.5" y="-41.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-74.25 73,-74.25 73,-55 126.5,-55 126.5,-74.25"/>
-<text text-anchor="middle" x="99.75" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-49.94C44.64,-51.65 53.16,-53.69 61.53,-55.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.71,-59.1 71.25,-58.03 62.34,-52.3 60.71,-59.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116,-37.25 83.5,-37.25 83.5,-18 116,-18 116,-37.25"/>
-<text text-anchor="middle" x="99.75" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-41.54C47.72,-39.22 60.73,-36.26 72.13,-33.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.79,-37.11 81.77,-31.48 71.24,-30.28 72.79,-37.11"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.25,-56.25 162.5,-56.25 162.5,-37 200.25,-37 200.25,-56.25"/>
-<text text-anchor="middle" x="181.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.48,-31.38C126.34,-33.73 139.35,-36.84 151.06,-39.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.16,-43.01 160.7,-41.93 151.78,-36.2 150.16,-43.01"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.25,-19.25 162.5,-19.25 162.5,0 200.25,0 200.25,-19.25"/>
-<text text-anchor="middle" x="181.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.48,-24.07C126.34,-21.84 139.35,-18.9 151.06,-16.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.71,-19.69 160.69,-14.07 150.17,-12.87 151.71,-19.69"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="313,-37.25 236.25,-37.25 236.25,-18 313,-18 313,-37.25"/>
-<text text-anchor="middle" x="274.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">sum_of_digits</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M200.4,-42.87C207.56,-41.38 216.17,-39.59 224.93,-37.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.45,-41.23 234.53,-35.77 224.03,-34.38 225.45,-41.23"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge6_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge6_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M200.4,-13.18C207.56,-14.59 216.17,-16.29 224.93,-18.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.04,-21.41 234.53,-19.91 225.39,-14.54 224.04,-21.41"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d83/sum__of__digits_8cpp_source.html b/d4/d83/sum__of__digits_8cpp_source.html
new file mode 100644
index 000000000..8433fd4c4
--- /dev/null
+++ b/d4/d83/sum__of__digits_8cpp_source.html
@@ -0,0 +1,191 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/sum_of_digits.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d83/sum__of__digits_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">sum_of_digits.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/d83/sum__of__digits_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
+<div class="foldopen" id="foldopen00023" data-start="{" data-end="}">
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"><a class="line" href="../../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395">   23</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395">sum_of_digits</a>(<span class="keywordtype">int</span> num) {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="comment">// If num is negative then negative sign is neglected.</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="keywordflow">if</span> (num &lt; 0) {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        num = -1 * num;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    }</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="keywordtype">int</span> sum = 0;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordflow">while</span> (num &gt; 0) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        sum = sum + (num % 10);</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        num = num / 10;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    }</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordflow">return</span> sum;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>}</div>
+</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="foldopen" id="foldopen00040" data-start="{" data-end="}">
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">   40</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>() {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordtype">int</span> test_case_1 = <a class="code hl_function" href="../../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395">sum_of_digits</a>(119765);</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    assert(test_case_1 == 29);</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>}</div>
+</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="foldopen" id="foldopen00049" data-start="{" data-end="}">
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"><a class="line" href="../../d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0">   49</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>() {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordtype">int</span> test_case_2 = <a class="code hl_function" href="../../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395">sum_of_digits</a>(-12256);</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    assert(test_case_2 == 16);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>}</div>
+</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="foldopen" id="foldopen00058" data-start="{" data-end="}">
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">   58</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="comment">// First test.</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <a class="code hl_function" href="../../d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="comment">// Second test.</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <a class="code hl_function" href="../../d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>();</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>}</div>
+</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="foldopen" id="foldopen00068" data-start="{" data-end="}">
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"><a class="line" href="../../d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   68</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <a class="code hl_function" href="../../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Success.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>}</div>
+</div>
+<div class="ttc" id="asum__of__digits_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> <a href="#l00049">sum_of_digits.cpp:49</a></div></div>
+<div class="ttc" id="asum__of__digits_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition</b> <a href="#l00040">sum_of_digits.cpp:40</a></div></div>
+<div class="ttc" id="asum__of__digits_8cpp_html_a4619c78b6ad985713024f930f31c4395"><div class="ttname"><a href="../../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395">sum_of_digits</a></div><div class="ttdeci">int sum_of_digits(int num)</div><div class="ttdef"><b>Definition</b> <a href="#l00023">sum_of_digits.cpp:23</a></div></div>
+<div class="ttc" id="asum__of__digits_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00058">sum_of_digits.cpp:58</a></div></div>
+<div class="ttc" id="asum__of__digits_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00068">sum_of_digits.cpp:68</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d4/d83/sum__of__digits_8cpp.html">sum_of_digits.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d86/large__number_8h.html b/d4/d86/large__number_8h.html
index b2ff9aacd..2efc7bd95 100644
--- a/d4/d86/large__number_8h.html
+++ b/d4/d86/large__number_8h.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/large_number.h File Reference</title>
+<title>TheAlgorithms/C++: math/large_number.h File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -140,6 +157,8 @@ Classes</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Library to perform arithmatic operations on arbitrarily large numbers. </p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 </div></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/d4/d86/large__number_8h_source.html b/d4/d86/large__number_8h_source.html
index fa498b274..2b3fa6449 100644
--- a/d4/d86/large__number_8h_source.html
+++ b/d4/d86/large__number_8h_source.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/large_number.h Source File</title>
+<title>TheAlgorithms/C++: math/large_number.h Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -107,13 +124,7 @@ $(function(){initNavTree('d4/d86/large__number_8h_source.html','../../'); initRe
   <div class="headertitle"><div class="title">large_number.h</div></div>
 </div><!--header-->
 <div class="contents">
-<a href="../../d4/d86/large__number_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * @file</span></div>
-<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * @brief Library to perform arithmatic operations on arbitrarily large</span></div>
-<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * numbers.</span></div>
-<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * \author [Krishna Vedala](https://github.com/kvedala)</span></div>
-<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> */</span></div>
-<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<a href="../../d4/d86/large__number_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
 <div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#ifndef MATH_LARGE_NUMBER_H_</span></div>
 <div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#define MATH_LARGE_NUMBER_H_</span></div>
 <div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
@@ -123,18 +134,11 @@ $(function(){initNavTree('d4/d86/large__number_8h_source.html','../../'); initRe
 <div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
 <div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;type_traits&gt;</span></div>
 <div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
-<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment"></span> </div>
-<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment"> * Store large unsigned numbers as a C++ vector</span></div>
-<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment"> * The class provides convenience functions to add a</span></div>
-<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment"> * digit to the number, perform multiplication of</span></div>
-<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"> * large number with long unsigned integers.</span></div>
-<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"> **/</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
 <div class="foldopen" id="foldopen00024" data-start="{" data-end="};">
 <div class="line"><a id="l00024" name="l00024"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html">   24</a></span><span class="keyword">class </span><a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> {</div>
-<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> <span class="keyword">public</span>:<span class="comment"></span></div>
-<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment">    /**&lt; initializer with value = 1 */</span></div>
-<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">   27</a></span>    <a class="code hl_function" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>() { <a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(1); }</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">   27</a></span>    <a class="code hl_function" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>() { <a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.push_back(1); }</div>
 <div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
 <div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="comment">// /**&lt; initializer from an integer */</span></div>
 <div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="comment">// explicit large_number(uint64_t n) {</span></div>
@@ -144,8 +148,7 @@ $(function(){initNavTree('d4/d86/large__number_8h_source.html','../../'); initRe
 <div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="comment">//         carry /= 10;</span></div>
 <div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="comment">//     } while (carry != 0);</span></div>
 <div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="comment">// }</span></div>
-<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="comment"></span> </div>
-<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="comment">    /**&lt; initializer from an integer */</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
 <div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a">   39</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a">large_number</a>(<span class="keywordtype">int</span> n) {</div>
 <div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <span class="keywordtype">int</span> carry = n;</div>
 <div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        <span class="keywordflow">do</span> {</div>
@@ -153,123 +156,100 @@ $(function(){initNavTree('d4/d86/large__number_8h_source.html','../../'); initRe
 <div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>            carry /= 10;</div>
 <div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        } <span class="keywordflow">while</span> (carry != 0);</div>
 <div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    }</div>
-<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="comment"></span> </div>
-<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="comment">    /**&lt; initializer from another large_number */</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
 <div class="foldopen" id="foldopen00048" data-start="{" data-end="}">
 <div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872">   48</a></span>    <a class="code hl_function" href="../../db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872">large_number</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> &amp;a) : <a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>(a.<a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>) {}</div>
-<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="comment"></span> </div>
-<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="comment">    /**&lt; initializer from a vector */</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
 <div class="foldopen" id="foldopen00051" data-start="{" data-end="}">
-<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f">   51</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f">large_number</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;unsigned char&gt;</a> &amp;vec) : <a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>(vec) {}</div>
-<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="comment"></span> </div>
-<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="comment">    /**&lt; initializer from a string */</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f">   51</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f">large_number</a>(std::vector&lt;unsigned char&gt; &amp;vec) : <a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>(vec) {}</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
 <div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>(<span class="keywordtype">char</span> <span class="keyword">const</span> *number_str) {</div>
 <div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = strlen(number_str); i &gt; 0; i--) {</div>
 <div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            <span class="keywordtype">char</span> a = number_str[i - 1] - <span class="charliteral">&#39;0&#39;</span>;</div>
 <div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            <span class="keywordflow">if</span> (a &gt;= 0 &amp;&amp; a &lt;= 9)</div>
-<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>                <a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(a);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>                <a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.push_back(a);</div>
 <div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        }</div>
 <div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    }</div>
-<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="comment"></span> </div>
-<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="comment">     * Function to check implementation</span></div>
-<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span><span class="comment">     **/</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
 <div class="foldopen" id="foldopen00065" data-start="{" data-end="}">
 <div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9">   65</a></span>    <span class="keyword">static</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9">test</a>() {</div>
-<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;------ Checking `large_number` class implementations\t&quot;</span></div>
-<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>                  &lt;&lt; <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"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;------ Checking `large_number` class implementations\t&quot;</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>                  &lt;&lt; std::endl;</div>
 <div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> a(40);</div>
 <div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        <span class="comment">// 1. test multiplication</span></div>
 <div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        a *= 10;</div>
 <div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        <span class="keywordflow">if</span> (a != <a class="code hl_function" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>(400)) {</div>
-<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;\tFailed 1/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=400)&quot;</span> &lt;&lt; <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"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;\tFailed 1/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=400)&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        }</div>
-<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tPassed 1/6...&quot;</span>;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\tPassed 1/6...&quot;</span>;</div>
 <div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="comment">// 2. test compound addition with integer</span></div>
 <div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        a += 120;</div>
 <div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        <span class="keywordflow">if</span> (a != <a class="code hl_function" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>(520)) {</div>
-<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;\tFailed 2/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=520)&quot;</span> &lt;&lt; <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"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;\tFailed 2/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=520)&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        }</div>
-<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tPassed 2/6...&quot;</span>;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\tPassed 2/6...&quot;</span>;</div>
 <div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="comment">// 3. test compound multiplication again</span></div>
 <div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        a *= 10;</div>
 <div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        <span class="keywordflow">if</span> (a != <a class="code hl_function" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>(5200)) {</div>
-<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;\tFailed 3/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=5200)&quot;</span> &lt;&lt; <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"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;\tFailed 3/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=5200)&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        }</div>
-<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tPassed 3/6...&quot;</span>;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\tPassed 3/6...&quot;</span>;</div>
 <div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        <span class="comment">// 4. test increment (prefix)</span></div>
 <div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        ++a;</div>
 <div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        <span class="keywordflow">if</span> (a != <a class="code hl_function" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>(5201)) {</div>
-<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;\tFailed 4/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=5201)&quot;</span> &lt;&lt; <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"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;\tFailed 4/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=5201)&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        }</div>
-<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tPassed 4/6...&quot;</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\tPassed 4/6...&quot;</span>;</div>
 <div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        <span class="comment">// 5. test increment (postfix)</span></div>
 <div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        a++;</div>
 <div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        <span class="keywordflow">if</span> (a != <a class="code hl_function" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>(5202)) {</div>
-<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;\tFailed 5/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=5202)&quot;</span> &lt;&lt; <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"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;\tFailed 5/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=5202)&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        }</div>
-<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tPassed 5/6...&quot;</span>;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\tPassed 5/6...&quot;</span>;</div>
 <div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        <span class="comment">// 6. test addition with another large number</span></div>
 <div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        a = a + <a class="code hl_function" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>(<span class="stringliteral">&quot;7000000000000000000000000000000&quot;</span>);</div>
 <div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="keywordflow">if</span> (a != <a class="code hl_function" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>(<span class="stringliteral">&quot;7000000000000000000000000005202&quot;</span>)) {</div>
-<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;\tFailed 6/6 (&quot;</span> &lt;&lt; a</div>
-<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>                      &lt;&lt; <span class="stringliteral">&quot;!=7000000000000000000000000005202)&quot;</span> &lt;&lt; <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"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;\tFailed 6/6 (&quot;</span> &lt;&lt; a</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>                      &lt;&lt; <span class="stringliteral">&quot;!=7000000000000000000000000005202)&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        }</div>
-<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tPassed 6/6...&quot;</span> &lt;&lt; <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"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\tPassed 6/6...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    }</div>
 </div>
-<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span><span class="comment"></span> </div>
-<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span><span class="comment">     * add a digit at MSB to the large number</span></div>
-<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span><span class="comment">     **/</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
 <div class="foldopen" id="foldopen00118" data-start="{" data-end="}">
 <div class="line"><a id="l00118" name="l00118"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615">  118</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615">add_digit</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> value) {</div>
 <div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>        <span class="keywordflow">if</span> (value &gt; 9) {</div>
-<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;digit &gt; 9!!\n&quot;</span>;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;digit &gt; 9!!\n&quot;</span>;</div>
 <div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>            exit(EXIT_FAILURE);</div>
 <div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        }</div>
 <div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
-<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        <a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(value);</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        <a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.push_back(value);</div>
 <div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    }</div>
 </div>
-<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span><span class="comment"></span> </div>
-<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span><span class="comment">     * Get number of digits in the number</span></div>
-<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span><span class="comment">     **/</span></div>
-<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">  130</a></span>    <span class="keywordtype">size_t</span> <a class="code hl_function" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</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"><a id="l00131" name="l00131"></a><span class="lineno">  131</span><span class="comment"></span> </div>
-<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span><span class="comment">     * operator over load to access the</span></div>
-<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span><span class="comment">     * i^th digit conveniently and also</span></div>
-<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span><span class="comment">     * assign value to it</span></div>
-<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span><span class="comment">     **/</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">  130</a></span>    <span class="keywordtype">size_t</span> <a class="code hl_function" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.size(); }</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
 <div class="line"><a id="l00137" name="l00137"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08">  137</a></span>    <span class="keyword">inline</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> &amp;<a class="code hl_function" href="../../db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08">operator[]</a>(<span class="keywordtype">size_t</span> n) { <span class="keywordflow">return</span> this-&gt;<a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>[n]; }</div>
 <div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
 <div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <span class="keyword">inline</span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> &amp;<a class="code hl_function" href="../../db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08">operator[]</a>(<span class="keywordtype">size_t</span> n)<span class="keyword"> const </span>{</div>
 <div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        <span class="keywordflow">return</span> this-&gt;<a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>[n];</div>
 <div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    }</div>
-<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span><span class="comment"></span> </div>
-<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span><span class="comment">     * operator overload to compare two numbers</span></div>
-<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span><span class="comment">     **/</span></div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span> </div>
 <div class="foldopen" id="foldopen00146" data-start="{" data-end="};">
-<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a13282908dfc4888392ed3d1fc6aae492">  146</a></span>    <span class="keyword">friend</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;<a class="code hl_friend" href="../../db/d82/classlarge__number.html#a13282908dfc4888392ed3d1fc6aae492">operator&lt;&lt;</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> &amp;a) {</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a13282908dfc4888392ed3d1fc6aae492">  146</a></span>    <span class="keyword">friend</span> std::ostream &amp;<a class="code hl_friend" href="../../db/d82/classlarge__number.html#a13282908dfc4888392ed3d1fc6aae492">operator&lt;&lt;</a>(std::ostream &amp;out, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> &amp;a) {</div>
 <div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = a.num_digits(); i &gt; 0; i--)</div>
 <div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>            out &lt;&lt; static_cast&lt;int&gt;(a[i - 1]);</div>
 <div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        <span class="keywordflow">return</span> out;</div>
 <div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    }</div>
 </div>
-<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span><span class="comment"></span> </div>
-<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span><span class="comment">     * operator overload to compare two numbers</span></div>
-<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span><span class="comment">     **/</span></div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
 <div class="foldopen" id="foldopen00155" data-start="{" data-end="};">
 <div class="line"><a id="l00155" name="l00155"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca">  155</a></span>    <span class="keyword">friend</span> <span class="keywordtype">bool</span> <a class="code hl_friend" href="../../db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca">operator==</a>(<a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> <span class="keyword">const</span> &amp;a, <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> <span class="keyword">const</span> &amp;b) {</div>
 <div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>        <span class="keywordtype">size_t</span> N = a.num_digits();</div>
@@ -281,29 +261,20 @@ $(function(){initNavTree('d4/d86/large__number_8h_source.html','../../'); initRe
 <div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    }</div>
 </div>
-<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span><span class="comment"></span> </div>
-<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span><span class="comment">     * operator overload to compare two numbers</span></div>
-<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span><span class="comment">     **/</span></div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span> </div>
 <div class="foldopen" id="foldopen00168" data-start="{" data-end="};">
 <div class="line"><a id="l00168" name="l00168"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a72ae1ef050c4c28c50952ecab22d4b94">  168</a></span>    <span class="keyword">friend</span> <span class="keywordtype">bool</span> <a class="code hl_friend" href="../../db/d82/classlarge__number.html#a72ae1ef050c4c28c50952ecab22d4b94">operator!=</a>(<a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> <span class="keyword">const</span> &amp;a, <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> <span class="keyword">const</span> &amp;b) {</div>
 <div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>        <span class="keywordflow">return</span> !(a == b);</div>
 <div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    }</div>
 </div>
-<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span><span class="comment"></span> </div>
-<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span><span class="comment">     * operator overload to increment (prefix)</span></div>
-<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span><span class="comment">     **/</span></div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span> </div>
 <div class="foldopen" id="foldopen00175" data-start="{" data-end="}">
 <div class="line"><a id="l00175" name="l00175"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a4757697b1f7584b69e779a72abc4ae2a">  175</a></span>    <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> &amp;<a class="code hl_function" href="../../db/d82/classlarge__number.html#a4757697b1f7584b69e779a72abc4ae2a">operator++</a>() {</div>
 <div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        (*this) += 1;</div>
 <div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    }</div>
 </div>
-<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span><span class="comment"></span> </div>
-<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span><span class="comment">     * operator overload to increment (postfix)</span></div>
-<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span><span class="comment">     **/</span></div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span> </div>
 <div class="foldopen" id="foldopen00183" data-start="{" data-end="}">
 <div class="line"><a id="l00183" name="l00183"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a8d4364ee5a62964451d8cfee82649687">  183</a></span>    <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> &amp;<a class="code hl_function" href="../../db/d82/classlarge__number.html#a8d4364ee5a62964451d8cfee82649687">operator++</a>(<span class="keywordtype">int</span>) {</div>
 <div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>        <span class="keyword">static</span> <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> tmp(<a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>);</div>
@@ -311,15 +282,12 @@ $(function(){initNavTree('d4/d86/large__number_8h_source.html','../../'); initRe
 <div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        <span class="keywordflow">return</span> tmp;</div>
 <div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    }</div>
 </div>
-<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span><span class="comment"></span> </div>
-<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span><span class="comment">     * operator overload to add</span></div>
-<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span><span class="comment">     **/</span></div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span> </div>
 <div class="foldopen" id="foldopen00192" data-start="{" data-end="}">
 <div class="line"><a id="l00192" name="l00192"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf">  192</a></span>    <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> &amp;<a class="code hl_function" href="../../db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf">operator+=</a>(<a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> n) {</div>
 <div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        <span class="comment">// if adding with another large_number</span></div>
 <div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>        <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> *b = <span class="keyword">reinterpret_cast&lt;</span><a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> *<span class="keyword">&gt;</span>(&amp;n);</div>
-<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>        <span class="keyword">const</span> <span class="keywordtype">size_t</span> max_L = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(this-&gt;<a class="code hl_function" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>(), b-&gt;<a class="code hl_function" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>());</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>        <span class="keyword">const</span> <span class="keywordtype">size_t</span> max_L = std::max(this-&gt;<a class="code hl_function" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>(), b-&gt;<a class="code hl_function" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>());</div>
 <div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>        <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> carry = 0;</div>
 <div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>        <span class="keywordtype">size_t</span> i;</div>
 <div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>        <span class="keywordflow">for</span> (i = 0; i &lt; max_L || carry != 0; i++) {</div>
@@ -340,10 +308,7 @@ $(function(){initNavTree('d4/d86/large__number_8h_source.html','../../'); initRe
 <div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> &amp;<a class="code hl_function" href="../../db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf">operator+=</a>(<span class="keywordtype">int</span> n) { <span class="keywordflow">return</span> (*<span class="keyword">this</span>) += <a class="code hl_function" href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number</a>(n); }</div>
 <div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    <span class="comment">// large_number &amp;operator+=(uint64_t n) { return (*this) += large_number(n);</span></div>
 <div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    <span class="comment">// }</span></div>
-<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span><span class="comment"></span> </div>
-<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span><span class="comment">     * operator overload to perform addition</span></div>
-<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span><span class="comment">     **/</span></div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span> </div>
 <div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
 <div class="foldopen" id="foldopen00220" data-start="{" data-end="};">
 <div class="line"><a id="l00220" name="l00220"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#abbd52948bee1b16543f1dae19aa9dd46">  220</a></span>    <span class="keyword">friend</span> <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> &amp;<a class="code hl_friend" href="../../db/d82/classlarge__number.html#abbd52948bee1b16543f1dae19aa9dd46">operator+</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> &amp;a, <span class="keyword">const</span> T &amp;b) {</div>
@@ -352,48 +317,35 @@ $(function(){initNavTree('d4/d86/large__number_8h_source.html','../../'); initRe
 <div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>        <span class="keywordflow">return</span> c;</div>
 <div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    }</div>
 </div>
-<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span><span class="comment"></span> </div>
-<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span><span class="comment">     * assignment operator</span></div>
-<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span><span class="comment">     **/</span></div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span> </div>
 <div class="foldopen" id="foldopen00229" data-start="{" data-end="}">
 <div class="line"><a id="l00229" name="l00229"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b">  229</a></span>    <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> &amp;<a class="code hl_function" href="../../db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b">operator=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> &amp;b) {</div>
 <div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>        this-&gt;<a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a> = b.<a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>;</div>
 <div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    }</div>
 </div>
-<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span><span class="comment"></span> </div>
-<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span><span class="comment">     * operator overload to increment</span></div>
-<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span><span class="comment">     **/</span></div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span> </div>
 <div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
 <div class="foldopen" id="foldopen00238" data-start="{" data-end="}">
 <div class="line"><a id="l00238" name="l00238"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350">  238</a></span>    <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> &amp;<a class="code hl_function" href="../../db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350">operator*=</a>(<span class="keyword">const</span> T n) {</div>
-<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>        <span class="keyword">static_assert</span>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>,</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>        <span class="keyword">static_assert</span>(std::is_integral&lt;T&gt;::value,</div>
 <div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>                      <span class="stringliteral">&quot;Must be integer addition unsigned integer types.&quot;</span>);</div>
 <div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>        this-&gt;<a class="code hl_function" href="../../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc">multiply</a>(n);</div>
 <div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    }</div>
 </div>
-<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span><span class="comment"></span> </div>
-<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span><span class="comment">     * returns i^th digit as an ASCII character</span></div>
-<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span><span class="comment">     **/</span></div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span> </div>
 <div class="foldopen" id="foldopen00248" data-start="{" data-end="}">
 <div class="line"><a id="l00248" name="l00248"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac">  248</a></span>    <span class="keywordtype">char</span> <a class="code hl_function" href="../../db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac">digit_char</a>(<span class="keywordtype">size_t</span> i)<span class="keyword"> const </span>{</div>
 <div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>[<a class="code hl_function" href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>() - i - 1] + <span class="charliteral">&#39;0&#39;</span>;</div>
 <div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    }</div>
 </div>
 <div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span> </div>
-<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span> <span class="keyword">private</span>:<span class="comment"></span></div>
-<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span><span class="comment">     * multiply large number with another integer and</span></div>
-<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span><span class="comment">     * store the result in the same large number</span></div>
-<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span><span class="comment">     **/</span></div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span> <span class="keyword">private</span>:</div>
 <div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    <span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
 <div class="foldopen" id="foldopen00258" data-start="{" data-end="}">
 <div class="line"><a id="l00258" name="l00258"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc">  258</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc">multiply</a>(<span class="keyword">const</span> T n) {</div>
-<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>        <span class="keyword">static_assert</span>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>,</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>        <span class="keyword">static_assert</span>(std::is_integral&lt;T&gt;::value,</div>
 <div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>                      <span class="stringliteral">&quot;Can only have integer types.&quot;</span>);</div>
 <div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>        <span class="comment">// assert(!(std::is_signed&lt;T&gt;::value)); //, &quot;Implemented only for</span></div>
 <div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>        <span class="comment">// unsigned integer types.&quot;);</span></div>
@@ -419,42 +371,35 @@ $(function(){initNavTree('d4/d86/large__number_8h_source.html','../../'); initRe
 <div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>    }</div>
 </div>
 <div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span> </div>
-<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;unsigned char&gt;</a></div>
-<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">  285</a></span>        <a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>; <span class="comment">/**&lt; where individual digits are stored */</span></div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>    std::vector&lt;unsigned char&gt;</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"><a class="line" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">  285</a></span>        <a class="code hl_variable" href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>; </div>
 <div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>};</div>
 <div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span> </div>
 <div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span><span class="preprocessor">#endif  </span><span class="comment">// MATH_LARGE_NUMBER_H_</span></div>
 </div>
 </div>
 </div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="aclasslarge__number_html"><div class="ttname"><a href="../../db/d82/classlarge__number.html">large_number</a></div><div class="ttdef"><b>Definition</b> large_number.h:24</div></div>
-<div class="ttc" id="aclasslarge__number_html_a0b1efd203274e38a67b78937dfb9b872"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872">large_number::large_number</a></div><div class="ttdeci">large_number(const large_number &amp;a)</div><div class="ttdef"><b>Definition</b> large_number.h:48</div></div>
-<div class="ttc" id="aclasslarge__number_html_a10119a83839e65962621b73df46a5337"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number::large_number</a></div><div class="ttdeci">large_number()</div><div class="ttdef"><b>Definition</b> large_number.h:27</div></div>
-<div class="ttc" id="aclasslarge__number_html_a13282908dfc4888392ed3d1fc6aae492"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a13282908dfc4888392ed3d1fc6aae492">large_number::operator&lt;&lt;</a></div><div class="ttdeci">friend std::ostream &amp; operator&lt;&lt;(std::ostream &amp;out, const large_number &amp;a)</div><div class="ttdef"><b>Definition</b> large_number.h:146</div></div>
-<div class="ttc" id="aclasslarge__number_html_a2f5571e66305cf68bb8283e4aeda58bc"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc">large_number::multiply</a></div><div class="ttdeci">void multiply(const T n)</div><div class="ttdef"><b>Definition</b> large_number.h:258</div></div>
-<div class="ttc" id="aclasslarge__number_html_a4757697b1f7584b69e779a72abc4ae2a"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a4757697b1f7584b69e779a72abc4ae2a">large_number::operator++</a></div><div class="ttdeci">large_number &amp; operator++()</div><div class="ttdef"><b>Definition</b> large_number.h:175</div></div>
-<div class="ttc" id="aclasslarge__number_html_a60c436d1a1c5e3795d6177d3815ad615"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615">large_number::add_digit</a></div><div class="ttdeci">void add_digit(unsigned int value)</div><div class="ttdef"><b>Definition</b> large_number.h:118</div></div>
-<div class="ttc" id="aclasslarge__number_html_a72ae1ef050c4c28c50952ecab22d4b94"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a72ae1ef050c4c28c50952ecab22d4b94">large_number::operator!=</a></div><div class="ttdeci">friend bool operator!=(large_number const &amp;a, large_number const &amp;b)</div><div class="ttdef"><b>Definition</b> large_number.h:168</div></div>
-<div class="ttc" id="aclasslarge__number_html_a76ddf1ed1b00fb8c107ea56f7f91e42f"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f">large_number::large_number</a></div><div class="ttdeci">large_number(std::vector&lt; unsigned char &gt; &amp;vec)</div><div class="ttdef"><b>Definition</b> large_number.h:51</div></div>
-<div class="ttc" id="aclasslarge__number_html_a771e9b28cfddf1ad94668566e396e350"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350">large_number::operator*=</a></div><div class="ttdeci">large_number &amp; operator*=(const T n)</div><div class="ttdef"><b>Definition</b> large_number.h:238</div></div>
-<div class="ttc" id="aclasslarge__number_html_a7ba872b9a3ce1f3da6c06c5409663cca"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca">large_number::operator==</a></div><div class="ttdeci">friend bool operator==(large_number const &amp;a, large_number const &amp;b)</div><div class="ttdef"><b>Definition</b> large_number.h:155</div></div>
-<div class="ttc" id="aclasslarge__number_html_a8c381aa1ecc960cefd82ec72f59e0e08"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08">large_number::operator[]</a></div><div class="ttdeci">unsigned char &amp; operator[](size_t n)</div><div class="ttdef"><b>Definition</b> large_number.h:137</div></div>
-<div class="ttc" id="aclasslarge__number_html_a8d4364ee5a62964451d8cfee82649687"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a8d4364ee5a62964451d8cfee82649687">large_number::operator++</a></div><div class="ttdeci">large_number &amp; operator++(int)</div><div class="ttdef"><b>Definition</b> large_number.h:183</div></div>
-<div class="ttc" id="aclasslarge__number_html_a959c5c1a982949bbf98e1ea0f9afe6a9"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9">large_number::test</a></div><div class="ttdeci">static bool test()</div><div class="ttdef"><b>Definition</b> large_number.h:65</div></div>
-<div class="ttc" id="aclasslarge__number_html_aab5644405094740e34983cedfecb36cf"><div class="ttname"><a href="../../db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf">large_number::operator+=</a></div><div class="ttdeci">large_number &amp; operator+=(large_number n)</div><div class="ttdef"><b>Definition</b> large_number.h:192</div></div>
-<div class="ttc" id="aclasslarge__number_html_ab84f29685709cbb3b6fd29b7b4a7bc7b"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b">large_number::operator=</a></div><div class="ttdeci">large_number &amp; operator=(const large_number &amp;b)</div><div class="ttdef"><b>Definition</b> large_number.h:229</div></div>
-<div class="ttc" id="aclasslarge__number_html_abbd52948bee1b16543f1dae19aa9dd46"><div class="ttname"><a href="../../db/d82/classlarge__number.html#abbd52948bee1b16543f1dae19aa9dd46">large_number::operator+</a></div><div class="ttdeci">friend large_number &amp; operator+(const large_number &amp;a, const T &amp;b)</div><div class="ttdef"><b>Definition</b> large_number.h:220</div></div>
-<div class="ttc" id="aclasslarge__number_html_ac09a05ec4aafb4d9e0b4440d6f0e2a93"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">large_number::num_digits</a></div><div class="ttdeci">size_t num_digits() const</div><div class="ttdef"><b>Definition</b> large_number.h:130</div></div>
-<div class="ttc" id="aclasslarge__number_html_ae35a55607cf52c0b0d485f2129bd39ac"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac">large_number::digit_char</a></div><div class="ttdeci">char digit_char(size_t i) const</div><div class="ttdef"><b>Definition</b> large_number.h:248</div></div>
-<div class="ttc" id="aclasslarge__number_html_af2b3ec9c35842d3a46ac7326f268af57"><div class="ttname"><a href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">large_number::_digits</a></div><div class="ttdeci">std::vector&lt; unsigned char &gt; _digits</div><div class="ttdef"><b>Definition</b> large_number.h:285</div></div>
-<div class="ttc" id="aclasslarge__number_html_af4598f1f2794b5e17e10c25e0501e41a"><div class="ttname"><a href="../../db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a">large_number::large_number</a></div><div class="ttdeci">large_number(int n)</div><div class="ttdef"><b>Definition</b> large_number.h:39</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="ais_integral_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral</a></div></div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="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>
+<div class="ttc" id="aclasslarge__number_html"><div class="ttname"><a href="../../db/d82/classlarge__number.html">large_number</a></div><div class="ttdef"><b>Definition</b> <a href="#l00024">large_number.h:24</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_a0b1efd203274e38a67b78937dfb9b872"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872">large_number::large_number</a></div><div class="ttdeci">large_number(const large_number &amp;a)</div><div class="ttdef"><b>Definition</b> <a href="#l00048">large_number.h:48</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_a10119a83839e65962621b73df46a5337"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337">large_number::large_number</a></div><div class="ttdeci">large_number()</div><div class="ttdef"><b>Definition</b> <a href="#l00027">large_number.h:27</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_a13282908dfc4888392ed3d1fc6aae492"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a13282908dfc4888392ed3d1fc6aae492">large_number::operator&lt;&lt;</a></div><div class="ttdeci">friend std::ostream &amp; operator&lt;&lt;(std::ostream &amp;out, const large_number &amp;a)</div><div class="ttdef"><b>Definition</b> <a href="#l00146">large_number.h:146</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_a2f5571e66305cf68bb8283e4aeda58bc"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc">large_number::multiply</a></div><div class="ttdeci">void multiply(const T n)</div><div class="ttdef"><b>Definition</b> <a href="#l00258">large_number.h:258</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_a4757697b1f7584b69e779a72abc4ae2a"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a4757697b1f7584b69e779a72abc4ae2a">large_number::operator++</a></div><div class="ttdeci">large_number &amp; operator++()</div><div class="ttdef"><b>Definition</b> <a href="#l00175">large_number.h:175</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_a60c436d1a1c5e3795d6177d3815ad615"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615">large_number::add_digit</a></div><div class="ttdeci">void add_digit(unsigned int value)</div><div class="ttdef"><b>Definition</b> <a href="#l00118">large_number.h:118</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_a72ae1ef050c4c28c50952ecab22d4b94"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a72ae1ef050c4c28c50952ecab22d4b94">large_number::operator!=</a></div><div class="ttdeci">friend bool operator!=(large_number const &amp;a, large_number const &amp;b)</div><div class="ttdef"><b>Definition</b> <a href="#l00168">large_number.h:168</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_a76ddf1ed1b00fb8c107ea56f7f91e42f"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f">large_number::large_number</a></div><div class="ttdeci">large_number(std::vector&lt; unsigned char &gt; &amp;vec)</div><div class="ttdef"><b>Definition</b> <a href="#l00051">large_number.h:51</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_a771e9b28cfddf1ad94668566e396e350"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350">large_number::operator*=</a></div><div class="ttdeci">large_number &amp; operator*=(const T n)</div><div class="ttdef"><b>Definition</b> <a href="#l00238">large_number.h:238</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_a7ba872b9a3ce1f3da6c06c5409663cca"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca">large_number::operator==</a></div><div class="ttdeci">friend bool operator==(large_number const &amp;a, large_number const &amp;b)</div><div class="ttdef"><b>Definition</b> <a href="#l00155">large_number.h:155</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_a8c381aa1ecc960cefd82ec72f59e0e08"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08">large_number::operator[]</a></div><div class="ttdeci">unsigned char &amp; operator[](size_t n)</div><div class="ttdef"><b>Definition</b> <a href="#l00137">large_number.h:137</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_a8d4364ee5a62964451d8cfee82649687"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a8d4364ee5a62964451d8cfee82649687">large_number::operator++</a></div><div class="ttdeci">large_number &amp; operator++(int)</div><div class="ttdef"><b>Definition</b> <a href="#l00183">large_number.h:183</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_a959c5c1a982949bbf98e1ea0f9afe6a9"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9">large_number::test</a></div><div class="ttdeci">static bool test()</div><div class="ttdef"><b>Definition</b> <a href="#l00065">large_number.h:65</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_aab5644405094740e34983cedfecb36cf"><div class="ttname"><a href="../../db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf">large_number::operator+=</a></div><div class="ttdeci">large_number &amp; operator+=(large_number n)</div><div class="ttdef"><b>Definition</b> <a href="#l00192">large_number.h:192</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_ab84f29685709cbb3b6fd29b7b4a7bc7b"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b">large_number::operator=</a></div><div class="ttdeci">large_number &amp; operator=(const large_number &amp;b)</div><div class="ttdef"><b>Definition</b> <a href="#l00229">large_number.h:229</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_abbd52948bee1b16543f1dae19aa9dd46"><div class="ttname"><a href="../../db/d82/classlarge__number.html#abbd52948bee1b16543f1dae19aa9dd46">large_number::operator+</a></div><div class="ttdeci">friend large_number &amp; operator+(const large_number &amp;a, const T &amp;b)</div><div class="ttdef"><b>Definition</b> <a href="#l00220">large_number.h:220</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_ac09a05ec4aafb4d9e0b4440d6f0e2a93"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">large_number::num_digits</a></div><div class="ttdeci">size_t num_digits() const</div><div class="ttdef"><b>Definition</b> <a href="#l00130">large_number.h:130</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_ae35a55607cf52c0b0d485f2129bd39ac"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac">large_number::digit_char</a></div><div class="ttdeci">char digit_char(size_t i) const</div><div class="ttdef"><b>Definition</b> <a href="#l00248">large_number.h:248</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_af2b3ec9c35842d3a46ac7326f268af57"><div class="ttname"><a href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">large_number::_digits</a></div><div class="ttdeci">std::vector&lt; unsigned char &gt; _digits</div><div class="ttdef"><b>Definition</b> <a href="#l00285">large_number.h:285</a></div></div>
+<div class="ttc" id="aclasslarge__number_html_af4598f1f2794b5e17e10c25e0501e41a"><div class="ttname"><a href="../../db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a">large_number::large_number</a></div><div class="ttdeci">large_number(int n)</div><div class="ttdef"><b>Definition</b> <a href="#l00039">large_number.h:39</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/d4/d8b/gray__code_8cpp_source.html b/d4/d8b/gray__code_8cpp_source.html
new file mode 100644
index 000000000..2f6609ec3
--- /dev/null
+++ b/d4/d8b/gray__code_8cpp_source.html
@@ -0,0 +1,220 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: bit_manipulation/gray_code.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d8b/gray__code_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">gray_code.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;bitset&gt;</span>  </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cassert&gt;</span>  </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;vector&gt;</span>  </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a> {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../de/d9b/namespacegray__code.html">gray_code</a> {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>std::vector&lt;std::bitset&lt;32&gt;&gt; gray_code_generation(<span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    std::vector&lt;std::bitset&lt;32&gt;&gt; <a class="code hl_namespace" href="../../de/d9b/namespacegray__code.html">gray_code</a> = {};  <span class="comment">// Initialise empty vector</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="comment">// No Gray codes for non-positive values of n</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">if</span> (n &lt;= 0) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../de/d9b/namespacegray__code.html">gray_code</a>;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    }</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordtype">int</span> total_codes = 1 &lt;&lt; n;  <span class="comment">// Number of n-bit gray codes</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; total_codes; i++) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="keywordtype">int</span> gray_num = i ^ (i &gt;&gt; 1);  <span class="comment">// Gray code formula</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <a class="code hl_namespace" href="../../de/d9b/namespacegray__code.html">gray_code</a>.push_back(std::bitset&lt;32&gt;(gray_num));  <span class="comment">// Store the value</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    }</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../de/d9b/namespacegray__code.html">gray_code</a>;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>} </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>}  <span class="comment">// namespace gray_code</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>}  <span class="comment">// namespace bit_manipulation</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="keyword">static</span> <span class="keywordtype">void</span> test() { </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    std::vector&lt;std::bitset&lt;32&gt;&gt; gray_code_negative_1 = {};</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    std::vector&lt;std::bitset&lt;32&gt;&gt; gray_code_0 = {};</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    std::vector&lt;std::bitset&lt;32&gt;&gt; gray_code_1 = {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        std::bitset&lt;32&gt;(0), std::bitset&lt;32&gt;(1)</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    };</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    std::vector&lt;std::bitset&lt;32&gt;&gt; gray_code_2 = {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        std::bitset&lt;32&gt;(0), std::bitset&lt;32&gt;(1), std::bitset&lt;32&gt;(3), std::bitset&lt;32&gt;(2)</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    };</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::vector&lt;std::bitset&lt;32&gt;&gt; gray_code_3 = {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        std::bitset&lt;32&gt;(0), std::bitset&lt;32&gt;(1), std::bitset&lt;32&gt;(3), std::bitset&lt;32&gt;(2),</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        std::bitset&lt;32&gt;(6), std::bitset&lt;32&gt;(7), std::bitset&lt;32&gt;(5), std::bitset&lt;32&gt;(4)</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    };</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    std::vector&lt;std::bitset&lt;32&gt;&gt; gray_code_4 = {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        std::bitset&lt;32&gt;(0), std::bitset&lt;32&gt;(1), std::bitset&lt;32&gt;(3), std::bitset&lt;32&gt;(2),</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        std::bitset&lt;32&gt;(6), std::bitset&lt;32&gt;(7), std::bitset&lt;32&gt;(5), std::bitset&lt;32&gt;(4),</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        std::bitset&lt;32&gt;(12), std::bitset&lt;32&gt;(13), std::bitset&lt;32&gt;(15), std::bitset&lt;32&gt;(14),</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        std::bitset&lt;32&gt;(10), std::bitset&lt;32&gt;(11), std::bitset&lt;32&gt;(9), std::bitset&lt;32&gt;(8)</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    };</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    std::vector&lt;std::bitset&lt;32&gt;&gt; gray_code_5 = {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        std::bitset&lt;32&gt;(0), std::bitset&lt;32&gt;(1), std::bitset&lt;32&gt;(3), std::bitset&lt;32&gt;(2),</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        std::bitset&lt;32&gt;(6), std::bitset&lt;32&gt;(7), std::bitset&lt;32&gt;(5), std::bitset&lt;32&gt;(4),</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        std::bitset&lt;32&gt;(12), std::bitset&lt;32&gt;(13), std::bitset&lt;32&gt;(15), std::bitset&lt;32&gt;(14),</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        std::bitset&lt;32&gt;(10), std::bitset&lt;32&gt;(11), std::bitset&lt;32&gt;(9), std::bitset&lt;32&gt;(8),</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        std::bitset&lt;32&gt;(24), std::bitset&lt;32&gt;(25), std::bitset&lt;32&gt;(27), std::bitset&lt;32&gt;(26),</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        std::bitset&lt;32&gt;(30), std::bitset&lt;32&gt;(31), std::bitset&lt;32&gt;(29), std::bitset&lt;32&gt;(28),</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        std::bitset&lt;32&gt;(20), std::bitset&lt;32&gt;(21), std::bitset&lt;32&gt;(23), std::bitset&lt;32&gt;(22),</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        std::bitset&lt;32&gt;(18), std::bitset&lt;32&gt;(19), std::bitset&lt;32&gt;(17), std::bitset&lt;32&gt;(16)</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    };</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="comment">// invalid values for n</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    assert(bit_manipulation::gray_code::gray_code_generation(-1) == gray_code_negative_1);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    assert(bit_manipulation::gray_code::gray_code_generation(0) == gray_code_0);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="comment">// valid values for n</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    assert(bit_manipulation::gray_code::gray_code_generation(1) == gray_code_1);</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    assert(bit_manipulation::gray_code::gray_code_generation(2) == gray_code_2);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    assert(bit_manipulation::gray_code::gray_code_generation(3) == gray_code_3);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    assert(bit_manipulation::gray_code::gray_code_generation(4) == gray_code_4);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    assert(bit_manipulation::gray_code::gray_code_generation(5) == gray_code_5);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>}</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    test();  <span class="comment">//Run self-test implementation</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacebit__manipulation_html"><div class="ttname"><a href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacegray__code_html"><div class="ttname"><a href="../../de/d9b/namespacegray__code.html">gray_code</a></div><div class="ttdoc">Generate n-bit Gray code.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_f3c4fbc4e901afa0a54d0623c5574aa7.html">bit_manipulation</a></li><li class="navelem"><b>gray_code.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d8d/jarvis__algorithm_8cpp.html b/d4/d8d/jarvis__algorithm_8cpp.html
index 08802f48b..129e94f3b 100644
--- a/d4/d8d/jarvis__algorithm_8cpp.html
+++ b/d4/d8d/jarvis__algorithm_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: geometry/jarvis_algorithm.cpp File Reference</title>
+<title>TheAlgorithms/C++: geometry/jarvis_algorithm.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for jarvis_algorithm.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d73/jarvis__algorithm_8cpp__incl.svg" width="252" height="111"><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">
+</div>
+<p><a href="../../d4/d8d/jarvis__algorithm_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">geometry::jarvis::Point</a></td></tr>
@@ -133,7 +152,7 @@ Classes</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d5f/namespacegeometry.html">geometry</a></td></tr>
-<tr class="memdesc:d5/d5f/namespacegeometry"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a> <br /></td></tr>
+<tr class="memdesc:d5/d5f/namespacegeometry"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::swap <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/da7/namespacejarvis.html">jarvis</a></td></tr>
 <tr class="memdesc:d5/da7/namespacejarvis"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm" target="_blank">Jarvis’s</a> algorithm. <br /></td></tr>
@@ -156,6 +175,8 @@ Algorithm</h3>
 <p>For Example, If points = {{0, 3}, {2, 2}, {1, 1}, {2, 1}, {3, 0}, {0, 0}, {3, 3}};</p>
 <p>then the convex hull is (0, 3), (0, 0), (3, 0), (3, 3)</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/rishabh-997" target="_blank">Rishabh Agarwal</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html">jarvis_algorithm.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -172,17 +193,14 @@ Algorithm</h3>
       </table>
 </div><div class="memdoc">
 <p>Driver Code </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html#l00176">176</a> of file <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html">jarvis_algorithm.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  176</span>           {</div>
 <div class="line"><span class="lineno">  177</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
 <div class="line"><span class="lineno">  178</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  179</span>}</div>
-<div class="ttc" id="ajarvis__algorithm_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> jarvis_algorithm.cpp:151</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="623" height="130"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ajarvis__algorithm_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d8d/jarvis__algorithm_8cpp_source.html#l00151">jarvis_algorithm.cpp:151</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -208,8 +226,10 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Test function </p><dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html#l00151">151</a> of file <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html">jarvis_algorithm.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  151</span>                   {</div>
-<div class="line"><span class="lineno">  152</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;geometry::jarvis::Point&gt;</a> points = {{0, 3},</div>
+<div class="line"><span class="lineno">  152</span>    std::vector&lt;geometry::jarvis::Point&gt; points = {{0, 3},</div>
 <div class="line"><span class="lineno">  153</span>                                                   {2, 2},</div>
 <div class="line"><span class="lineno">  154</span>                                                   {1, 1},</div>
 <div class="line"><span class="lineno">  155</span>                                                   {2, 1},</div>
@@ -218,29 +238,21 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  158</span>                                                   {3, 3}</div>
 <div class="line"><span class="lineno">  159</span>    };</div>
 <div class="line"><span class="lineno">  160</span>    <a class="code hl_class" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a> hull(points);</div>
-<div class="line"><span class="lineno">  161</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;geometry::jarvis::Point&gt;</a> actualPoint;</div>
+<div class="line"><span class="lineno">  161</span>    std::vector&lt;geometry::jarvis::Point&gt; actualPoint;</div>
 <div class="line"><span class="lineno">  162</span>    actualPoint = hull.getConvexHull();</div>
 <div class="line"><span class="lineno">  163</span> </div>
-<div class="line"><span class="lineno">  164</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;geometry::jarvis::Point&gt;</a> expectedPoint = {{0, 3},</div>
+<div class="line"><span class="lineno">  164</span>    std::vector&lt;geometry::jarvis::Point&gt; expectedPoint = {{0, 3},</div>
 <div class="line"><span class="lineno">  165</span>                                                          {0, 0},</div>
 <div class="line"><span class="lineno">  166</span>                                                          {3, 0},</div>
 <div class="line"><span class="lineno">  167</span>                                                          {3, 3}};</div>
-<div class="line"><span class="lineno">  168</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; expectedPoint.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
+<div class="line"><span class="lineno">  168</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; expectedPoint.size(); i++) {</div>
 <div class="line"><span class="lineno">  169</span>        assert(actualPoint[i].x == expectedPoint[i].x);</div>
 <div class="line"><span class="lineno">  170</span>        assert(actualPoint[i].y == expectedPoint[i].y);</div>
 <div class="line"><span class="lineno">  171</span>    }</div>
-<div class="line"><span class="lineno">  172</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test implementations passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  172</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test implementations passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  173</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="aclassgeometry_1_1jarvis_1_1_convexhull_html"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a></div><div class="ttdef"><b>Definition</b> jarvis_algorithm.cpp:55</div></div>
-<div class="ttc" id="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>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="526" height="130"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a></div><div class="ttdef"><b>Definition</b> <a href="../../d4/d8d/jarvis__algorithm_8cpp_source.html#l00055">jarvis_algorithm.cpp:55</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 13698b449..000000000
--- a/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,70,49,96"/>
-<area shape="rect" id="Node000002" href="$d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1" title=" " alt="" coords="97,33,284,74"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,77,81,71,82,76,49,82"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="133,98,248,124"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="49,84,118,96,117,101,48,89"/>
-<area shape="rect" id="Node000003" href="$d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c" title=" " alt="" coords="332,5,519,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="284,40,316,36,317,41,285,45"/>
-<area shape="rect" id="Node000004" 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="348,70,503,96"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="285,63,333,69,333,74,284,68"/>
-</map>
diff --git a/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index b7f1289c0..000000000
--- a/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9911f2d557161e93b5d73e1aedae9637
\ No newline at end of file
diff --git a/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index a06f931ed..000000000
--- a/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,121 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="394pt" height="97pt"
- viewBox="0.00 0.00 393.50 96.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 92.88)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-40.25 0,-40.25 0,-21 32.5,-21 32.5,-40.25"/>
-<text text-anchor="middle" x="16.25" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209,-67.88 68.5,-67.88 68.5,-37.38 209,-37.38 209,-67.88"/>
-<text text-anchor="start" x="76.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
-<text text-anchor="middle" x="138.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::getConvexHull</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.51,-33.41C39.25,-34.64 47.73,-36.19 56.94,-37.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.07,-41.27 66.53,-39.62 57.32,-34.38 56.07,-41.27"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="182,-19.25 95.5,-19.25 95.5,0 182,0 182,-19.25"/>
-<text text-anchor="middle" x="138.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.51,-27.97C45.58,-25.69 65.21,-22.27 83.98,-18.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.45,-22.47 93.7,-17.3 83.25,-15.57 84.45,-22.47"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385.5,-88.88 245,-88.88 245,-58.38 385.5,-58.38 385.5,-88.88"/>
-<text text-anchor="start" x="253" y="-75.38" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
-<text text-anchor="middle" x="315.25" y="-64.12" font-family="Helvetica,sans-Serif" font-size="10.00">::orientation</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.47,-61.02C217.34,-61.96 225.41,-62.93 233.41,-63.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.79,-67.35 243.14,-65.07 233.63,-60.4 232.79,-67.35"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373.12,-40.25 257.38,-40.25 257.38,-21 373.12,-21 373.12,-40.25"/>
-<text text-anchor="middle" x="315.25" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.47,-43.84C221.41,-42.33 233.81,-40.77 245.72,-39.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="245.97,-42.76 255.46,-38.04 245.1,-35.82 245.97,-42.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index b9f20dcec..000000000
--- a/d4/d8d/jarvis__algorithm_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,95 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="394pt" height="97pt"
- viewBox="0.00 0.00 393.50 96.88" 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 92.88)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-40.25 0,-40.25 0,-21 32.5,-21 32.5,-40.25"/>
-<text text-anchor="middle" x="16.25" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209,-67.88 68.5,-67.88 68.5,-37.38 209,-37.38 209,-67.88"/>
-<text text-anchor="start" x="76.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
-<text text-anchor="middle" x="138.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::getConvexHull</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.51,-33.41C39.25,-34.64 47.73,-36.19 56.94,-37.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.07,-41.27 66.53,-39.62 57.32,-34.38 56.07,-41.27"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="182,-19.25 95.5,-19.25 95.5,0 182,0 182,-19.25"/>
-<text text-anchor="middle" x="138.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.51,-27.97C45.58,-25.69 65.21,-22.27 83.98,-18.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.45,-22.47 93.7,-17.3 83.25,-15.57 84.45,-22.47"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385.5,-88.88 245,-88.88 245,-58.38 385.5,-58.38 385.5,-88.88"/>
-<text text-anchor="start" x="253" y="-75.38" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
-<text text-anchor="middle" x="315.25" y="-64.12" font-family="Helvetica,sans-Serif" font-size="10.00">::orientation</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.47,-61.02C217.34,-61.96 225.41,-62.93 233.41,-63.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.79,-67.35 243.14,-65.07 233.63,-60.4 232.79,-67.35"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373.12,-40.25 257.38,-40.25 257.38,-21 373.12,-21 373.12,-40.25"/>
-<text text-anchor="middle" x="315.25" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.47,-43.84C221.41,-42.33 233.81,-40.77 245.72,-39.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="245.97,-42.76 255.46,-38.04 245.1,-35.82 245.97,-42.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 98e6afae9..000000000
--- a/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,70,55,96"/>
-<area shape="rect" id="Node000002" href="$d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title=" " alt="" coords="103,70,146,96"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,80,87,80,87,86,55,86"/>
-<area shape="rect" id="Node000003" href="$d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1" title=" " alt="" coords="194,33,381,74"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,77,178,71,179,76,146,82"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="230,98,345,124"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="146,84,215,96,214,101,146,89"/>
-<area shape="rect" id="Node000004" href="$d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c" title=" " alt="" coords="429,5,617,46"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="382,40,414,36,414,41,382,45"/>
-<area shape="rect" id="Node000005" 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="446,70,600,96"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="382,63,431,69,430,74,382,68"/>
-</map>
diff --git a/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 99a20d8f1..000000000
--- a/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ced6ffff34ac92f407e5f4c96fbbb484
\ No newline at end of file
diff --git a/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 912edbb91..000000000
--- a/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="467pt" height="97pt"
- viewBox="0.00 0.00 466.50 96.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 92.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-40.25 0,-40.25 0,-21 37,-21 37,-40.25"/>
-<text text-anchor="middle" x="18.5" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-40.25 73,-40.25 73,-21 105.5,-21 105.5,-40.25"/>
-<text text-anchor="middle" x="89.25" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-30.62C44.58,-30.62 53.31,-30.62 61.45,-30.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-34.13 71.2,-30.63 61.2,-27.13 61.2,-34.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282,-67.88 141.5,-67.88 141.5,-37.38 282,-37.38 282,-67.88"/>
-<text text-anchor="start" x="149.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
-<text text-anchor="middle" x="211.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::getConvexHull</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.51,-33.41C112.25,-34.64 120.73,-36.19 129.94,-37.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.07,-41.27 139.53,-39.62 130.32,-34.38 129.07,-41.27"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255,-19.25 168.5,-19.25 168.5,0 255,0 255,-19.25"/>
-<text text-anchor="middle" x="211.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.51,-27.97C118.58,-25.69 138.21,-22.27 156.98,-18.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.45,-22.47 166.7,-17.3 156.25,-15.57 157.45,-22.47"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="458.5,-88.88 318,-88.88 318,-58.38 458.5,-58.38 458.5,-88.88"/>
-<text text-anchor="start" x="326" y="-75.38" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
-<text text-anchor="middle" x="388.25" y="-64.12" font-family="Helvetica,sans-Serif" font-size="10.00">::orientation</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.47,-61.02C290.34,-61.96 298.41,-62.93 306.41,-63.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.79,-67.35 316.14,-65.07 306.63,-60.4 305.79,-67.35"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="446.12,-40.25 330.38,-40.25 330.38,-21 446.12,-21 446.12,-40.25"/>
-<text text-anchor="middle" x="388.25" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.47,-43.84C294.41,-42.33 306.81,-40.77 318.72,-39.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.97,-42.76 328.46,-38.04 318.1,-35.82 318.97,-42.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 8dd7512c3..000000000
--- a/d4/d8d/jarvis__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,113 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="467pt" height="97pt"
- viewBox="0.00 0.00 466.50 96.88" 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 92.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-40.25 0,-40.25 0,-21 37,-21 37,-40.25"/>
-<text text-anchor="middle" x="18.5" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-40.25 73,-40.25 73,-21 105.5,-21 105.5,-40.25"/>
-<text text-anchor="middle" x="89.25" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-30.62C44.58,-30.62 53.31,-30.62 61.45,-30.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-34.13 71.2,-30.63 61.2,-27.13 61.2,-34.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282,-67.88 141.5,-67.88 141.5,-37.38 282,-37.38 282,-67.88"/>
-<text text-anchor="start" x="149.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
-<text text-anchor="middle" x="211.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::getConvexHull</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.51,-33.41C112.25,-34.64 120.73,-36.19 129.94,-37.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.07,-41.27 139.53,-39.62 130.32,-34.38 129.07,-41.27"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255,-19.25 168.5,-19.25 168.5,0 255,0 255,-19.25"/>
-<text text-anchor="middle" x="211.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.51,-27.97C118.58,-25.69 138.21,-22.27 156.98,-18.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.45,-22.47 166.7,-17.3 156.25,-15.57 157.45,-22.47"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="458.5,-88.88 318,-88.88 318,-58.38 458.5,-58.38 458.5,-88.88"/>
-<text text-anchor="start" x="326" y="-75.38" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
-<text text-anchor="middle" x="388.25" y="-64.12" font-family="Helvetica,sans-Serif" font-size="10.00">::orientation</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.47,-61.02C290.34,-61.96 298.41,-62.93 306.41,-63.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.79,-67.35 316.14,-65.07 306.63,-60.4 305.79,-67.35"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="446.12,-40.25 330.38,-40.25 330.38,-21 446.12,-21 446.12,-40.25"/>
-<text text-anchor="middle" x="388.25" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.47,-43.84C294.41,-42.33 306.81,-40.77 318.72,-39.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.97,-42.76 328.46,-38.04 318.1,-35.82 318.97,-42.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d8d/jarvis__algorithm_8cpp_source.html b/d4/d8d/jarvis__algorithm_8cpp_source.html
new file mode 100644
index 000000000..ad8ec67cd
--- /dev/null
+++ b/d4/d8d/jarvis__algorithm_8cpp_source.html
@@ -0,0 +1,266 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: geometry/jarvis_algorithm.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d8d/jarvis__algorithm_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">jarvis_algorithm.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/d8d/jarvis__algorithm_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d5f/namespacegeometry.html">geometry</a> {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/da7/namespacejarvis.html">jarvis</a> {</div>
+<div class="foldopen" id="foldopen00047" data-start="{" data-end="};">
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">   47</a></span>        <span class="keyword">struct </span><a class="code hl_struct" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            <span class="keywordtype">int</span> x, y;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        };</div>
+</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="foldopen" id="foldopen00055" data-start="{" data-end="};">
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">   55</a></span>        <span class="keyword">class </span><a class="code hl_class" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">Convexhull</a> {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            std::vector&lt;Point&gt; points;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            <span class="keywordtype">int</span> size;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00066" data-start="{" data-end="}">
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"><a class="line" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870">   66</a></span>            <span class="keyword">explicit</span> <a class="code hl_function" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870">Convexhull</a>(<span class="keyword">const</span> std::vector&lt;Point&gt; &amp;pointList) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>                points = pointList;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                size = points.size();</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            }</div>
+</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="foldopen" id="foldopen00078" data-start="{" data-end="}">
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"><a class="line" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1">   78</a></span>            std::vector&lt;Point&gt; <a class="code hl_function" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1">getConvexHull</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>                <span class="comment">// Initialize Result</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>                std::vector&lt;Point&gt; hull;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>                <span class="comment">// Find the leftmost point</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>                <span class="keywordtype">int</span> leftmost_point = 0;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; size; i++) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>                    <span class="keywordflow">if</span> (points[i].x &lt; points[leftmost_point].x) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>                        leftmost_point = i;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>                    }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>                }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>                <span class="comment">// Start from leftmost point, keep moving counterclockwise</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>                <span class="comment">// until reach the start point again.  This loop runs O(h)</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>                <span class="comment">// times where h is number of points in result or output.</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>                <span class="keywordtype">int</span> p = leftmost_point, q = 0;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>                <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>                    <span class="comment">// Add current point to result</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>                    hull.push_back(points[p]);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>                    <span class="comment">// Search for a point &#39;q&#39; such that orientation(p, x, q)</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>                    <span class="comment">// is counterclockwise for all points &#39;x&#39;. The idea</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>                    <span class="comment">// is to keep track of last visited most counter clock-</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>                    <span class="comment">// wise point in q. If any point &#39;i&#39; is more counter clock-</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>                    <span class="comment">// wise than q, then update q.</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>                    q = (p + 1) % size;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>                    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>                        <span class="comment">// If i is more counterclockwise than current q, then</span></div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>                        <span class="comment">// update q</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>                        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c">orientation</a>(points[p], points[i], points[q]) == 2) {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>                            q = i;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>                        }</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>                    }</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span> </div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>                    <span class="comment">// Now q is the most counterclockwise with respect to p</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>                    <span class="comment">// Set p as q for next iteration, so that q is added to</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>                    <span class="comment">// result &#39;hull&#39;</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>                    p = q;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>                } <span class="keywordflow">while</span> (p != leftmost_point);        <span class="comment">// While we don&#39;t come to first point</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span> </div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>                <span class="keywordflow">return</span> hull;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>            }</div>
+</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="foldopen" id="foldopen00133" data-start="{" data-end="}">
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"><a class="line" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c">  133</a></span>            <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c">orientation</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> &amp;p, <span class="keyword">const</span> <a class="code hl_struct" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> &amp;q, <span class="keyword">const</span> <a class="code hl_struct" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> &amp;r) {</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>                <span class="keywordtype">int</span> val = (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span> </div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>                <span class="keywordflow">if</span> (val == 0) {</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>                    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>                }</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>                <span class="keywordflow">return</span> (val &gt; 0) ? 1 : 2;</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>            }</div>
+</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        };</div>
+</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span> </div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    } <span class="comment">// namespace jarvis</span></div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>} <span class="comment">// namespace geometry</span></div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span> </div>
+<div class="foldopen" id="foldopen00151" data-start="{" data-end="}">
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"><a class="line" href="../../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  151</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    std::vector&lt;geometry::jarvis::Point&gt; points = {{0, 3},</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>                                                   {2, 2},</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>                                                   {1, 1},</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>                                                   {2, 1},</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>                                                   {3, 0},</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>                                                   {0, 0},</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>                                                   {3, 3}</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    };</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    <a class="code hl_class" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a> hull(points);</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    std::vector&lt;geometry::jarvis::Point&gt; actualPoint;</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    actualPoint = hull.<a class="code hl_function" href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1">getConvexHull</a>();</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span> </div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    std::vector&lt;geometry::jarvis::Point&gt; expectedPoint = {{0, 3},</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>                                                          {0, 0},</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>                                                          {3, 0},</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>                                                          {3, 3}};</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; expectedPoint.size(); i++) {</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>        assert(actualPoint[i].x == expectedPoint[i].x);</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        assert(actualPoint[i].y == expectedPoint[i].y);</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    }</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test implementations passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>}</div>
+</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span> </div>
+<div class="foldopen" id="foldopen00176" data-start="{" data-end="}">
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"><a class="line" href="../../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  176</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    <a class="code hl_function" href="../../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>}</div>
+</div>
+<div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a></div><div class="ttdef"><b>Definition</b> <a href="#l00055">jarvis_algorithm.cpp:55</a></div></div>
+<div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html_a54df5f9a8f37170bd97c91127664655c"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c">geometry::jarvis::Convexhull::orientation</a></div><div class="ttdeci">static int orientation(const Point &amp;p, const Point &amp;q, const Point &amp;r)</div><div class="ttdef"><b>Definition</b> <a href="#l00133">jarvis_algorithm.cpp:133</a></div></div>
+<div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html_a8306e48040a8570e164c58d1c530f870"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870">geometry::jarvis::Convexhull::Convexhull</a></div><div class="ttdeci">Convexhull(const std::vector&lt; Point &gt; &amp;pointList)</div><div class="ttdef"><b>Definition</b> <a href="#l00066">jarvis_algorithm.cpp:66</a></div></div>
+<div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html_aeec46e86786ddd461464b07a77c4d5f1"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1">geometry::jarvis::Convexhull::getConvexHull</a></div><div class="ttdeci">std::vector&lt; Point &gt; getConvexHull() const</div><div class="ttdef"><b>Definition</b> <a href="#l00078">jarvis_algorithm.cpp:78</a></div></div>
+<div class="ttc" id="ajarvis__algorithm_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00151">jarvis_algorithm.cpp:151</a></div></div>
+<div class="ttc" id="ajarvis__algorithm_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00176">jarvis_algorithm.cpp:176</a></div></div>
+<div class="ttc" id="anamespacegeometry_html"><div class="ttname"><a href="../../d5/d5f/namespacegeometry.html">geometry</a></div><div class="ttdoc">for std::swap</div><div class="ttdef"><b>Definition</b> <a href="../../de/d89/graham__scan__functions_8hpp_source.html#l00052">graham_scan_functions.hpp:52</a></div></div>
+<div class="ttc" id="anamespacejarvis_html"><div class="ttname"><a href="../../d5/da7/namespacejarvis.html">jarvis</a></div><div class="ttdoc">Functions for Jarvis’s algorithm.</div></div>
+<div class="ttc" id="astructgeometry_1_1jarvis_1_1_point_html"><div class="ttname"><a href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">geometry::jarvis::Point</a></div><div class="ttdef"><b>Definition</b> <a href="#l00047">jarvis_algorithm.cpp:47</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_e3380d2178455503f266746fb14246a5.html">geometry</a></li><li class="navelem"><a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp.html">jarvis_algorithm.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html
index 8bb63553e..999fe3cbd 100644
--- a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html
+++ b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: bit_manipulation/travelling_salesman_using_bit_manipulation.cpp File Reference</title>
+<title>TheAlgorithms/C++: bit_manipulation/travelling_salesman_using_bit_manipulation.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for travelling_salesman_using_bit_manipulation.cpp:</di
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dc5/travelling__salesman__using__bit__manipulation_8cpp__incl.svg" width="510" height="126"><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">
+</div>
+<p><a href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></td></tr>
@@ -136,7 +155,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:ad08f082be02c3437c2fe89cb035fcee1" id="r_ad08f082be02c3437c2fe89cb035fcee1"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad08f082be02c3437c2fe89cb035fcee1">bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint32_t &gt; &gt; dist, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> setOfCities, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> city, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> n, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint32_t &gt; &gt; &amp;dp)</td></tr>
+<tr class="memitem:ad08f082be02c3437c2fe89cb035fcee1" id="r_ad08f082be02c3437c2fe89cb035fcee1"><td class="memItemLeft" align="right" valign="top">std::uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad08f082be02c3437c2fe89cb035fcee1">bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation</a> (std::vector&lt; std::vector&lt; uint32_t &gt; &gt; dist, std::uint64_t setOfCities, std::uint64_t city, std::uint64_t n, std::vector&lt; std::vector&lt; uint32_t &gt; &gt; &amp;dp)</td></tr>
 <tr class="memdesc:ad08f082be02c3437c2fe89cb035fcee1"><td class="mdescLeft">&#160;</td><td class="mdescRight">The function implements travellingSalesman using bitmanipulation.  <br /></td></tr>
 <tr class="separator:ad08f082be02c3437c2fe89cb035fcee1"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -152,6 +171,8 @@ Functions</h2></td></tr>
 <p>Explanation: INPUT -&gt; You are given with a adjacency matrix A = {} which contains the distance between two cities/node.</p>
 <p>OUTPUT -&gt; <a class="el" href="../../d4/d12/namespace_minimum.html" title="Implementation of Minimum Edit Distance algorithm.">Minimum</a> cost of whole tour from starting point</p>
 <p>Worst Case Time Complexity: O(n^2 * 2^n) Space complexity: O(n) </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Rytnix" target="_blank">Utkarsh Yadav</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html">travelling_salesman_using_bit_manipulation.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -170,17 +191,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html#l00139">139</a> of file <a class="el" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html">travelling_salesman_using_bit_manipulation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  139</span>           {</div>
 <div class="line"><span class="lineno">  140</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  141</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  142</span>}</div>
-<div class="ttc" id="atravelling__salesman__using__bit__manipulation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#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:100</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="315" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="atravelling__salesman__using__bit__manipulation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html#l00100">travelling_salesman_using_bit_manipulation.cpp:100</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -208,51 +226,45 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html#l00100">100</a> of file <a class="el" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html">travelling_salesman_using_bit_manipulation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  100</span>                   {</div>
 <div class="line"><span class="lineno">  101</span>    <span class="comment">// 1st test-case</span></div>
-<div class="line"><span class="lineno">  102</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;uint32_t&gt;</a>&gt; dist = {</div>
+<div class="line"><span class="lineno">  102</span>    std::vector&lt;std::vector&lt;uint32_t&gt;&gt; dist = {</div>
 <div class="line"><span class="lineno">  103</span>        {0, 20, 42, 35}, {20, 0, 30, 34}, {42, 30, 0, 12}, {35, 34, 12, 0}};</div>
-<div class="line"><span class="lineno">  104</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">  105</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;uint32_t&gt;</a>&gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(1 &lt;&lt; V, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a>(V, -1));</div>
+<div class="line"><span class="lineno">  104</span>    uint32_t V = dist.size();</div>
+<div class="line"><span class="lineno">  105</span>    std::vector&lt;std::vector&lt;uint32_t&gt;&gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(1 &lt;&lt; V, std::vector&lt;uint32_t&gt;(V, -1));</div>
 <div class="line"><span class="lineno">  106</span>    assert(bit_manipulation::travelling_salesman_using_bit_manipulation::</div>
 <div class="line"><span class="lineno">  107</span>               <a class="code hl_function" href="#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">  108</span>           97);</div>
-<div class="line"><span class="lineno">  109</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1st test-case: passed!&quot;</span></div>
+<div class="line"><span class="lineno">  109</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test-case: passed!&quot;</span></div>
 <div class="line"><span class="lineno">  110</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  111</span> </div>
 <div class="line"><span class="lineno">  112</span>    <span class="comment">// 2nd test-case</span></div>
 <div class="line"><span class="lineno">  113</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">  114</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">  115</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;uint32_t&gt;</a>&gt; dp1(1 &lt;&lt; V,</div>
-<div class="line"><span class="lineno">  116</span>                                           <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a>(V, -1));</div>
+<div class="line"><span class="lineno">  114</span>    V = dist.size();</div>
+<div class="line"><span class="lineno">  115</span>    std::vector&lt;std::vector&lt;uint32_t&gt;&gt; dp1(1 &lt;&lt; V,</div>
+<div class="line"><span class="lineno">  116</span>                                           std::vector&lt;uint32_t&gt;(V, -1));</div>
 <div class="line"><span class="lineno">  117</span>    assert(bit_manipulation::travelling_salesman_using_bit_manipulation::</div>
 <div class="line"><span class="lineno">  118</span>               <a class="code hl_function" href="#ad08f082be02c3437c2fe89cb035fcee1">travelling_salesman_using_bit_manipulation</a>(dist, 1, 0, V, dp1) ==</div>
 <div class="line"><span class="lineno">  119</span>           75);</div>
-<div class="line"><span class="lineno">  120</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2nd test-case: passed!&quot;</span></div>
+<div class="line"><span class="lineno">  120</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test-case: passed!&quot;</span></div>
 <div class="line"><span class="lineno">  121</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  122</span>    <span class="comment">// 3rd test-case</span></div>
 <div class="line"><span class="lineno">  123</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">  124</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">  125</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;uint32_t&gt;</a>&gt; dp2(1 &lt;&lt; V,</div>
-<div class="line"><span class="lineno">  126</span>                                           <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a>(V, -1));</div>
+<div class="line"><span class="lineno">  124</span>    V = dist.size();</div>
+<div class="line"><span class="lineno">  125</span>    std::vector&lt;std::vector&lt;uint32_t&gt;&gt; dp2(1 &lt;&lt; V,</div>
+<div class="line"><span class="lineno">  126</span>                                           std::vector&lt;uint32_t&gt;(V, -1));</div>
 <div class="line"><span class="lineno">  127</span>    assert(bit_manipulation::travelling_salesman_using_bit_manipulation::</div>
 <div class="line"><span class="lineno">  128</span>               <a class="code hl_function" href="#ad08f082be02c3437c2fe89cb035fcee1">travelling_salesman_using_bit_manipulation</a>(dist, 1, 0, V, dp2) ==</div>
 <div class="line"><span class="lineno">  129</span>           80);</div>
 <div class="line"><span class="lineno">  130</span> </div>
-<div class="line"><span class="lineno">  131</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;3rd test-case: passed!&quot;</span></div>
+<div class="line"><span class="lineno">  131</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test-case: passed!&quot;</span></div>
 <div class="line"><span class="lineno">  132</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  133</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="#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&lt; std::vector&lt; uint32_t &gt; &gt; dist, std::uint64_t setOfCities, std::uint64_t city, std::uint64_t n, std::vector&lt; std::vector&lt; uint32_t &gt; &gt; &amp;dp)</div><div class="ttdoc">The function implements travellingSalesman using bitmanipulation.</div><div class="ttdef"><b>Definition</b> travelling_salesman_using_bit_manipulation.cpp:53</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="218" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></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> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></div>
+<div class="ttc" id="atravelling__salesman__using__bit__manipulation_8cpp_html_ad08f082be02c3437c2fe89cb035fcee1"><div class="ttname"><a href="#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&lt; std::vector&lt; uint32_t &gt; &gt; dist, std::uint64_t setOfCities, std::uint64_t city, std::uint64_t n, std::vector&lt; std::vector&lt; uint32_t &gt; &gt; &amp;dp)</div><div class="ttdoc">The function implements travellingSalesman using bitmanipulation.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html#l00053">travelling_salesman_using_bit_manipulation.cpp:53</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad08f082be02c3437c2fe89cb035fcee1" name="ad08f082be02c3437c2fe89cb035fcee1"></a>
@@ -262,29 +274,29 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation </td>
+          <td class="memname">std::uint64_t bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint32_t &gt; &gt;</td>          <td class="paramname"><span class="paramname"><em>dist</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; uint32_t &gt; &gt;</td>          <td class="paramname"><span class="paramname"><em>dist</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a></td>          <td class="paramname"><span class="paramname"><em>setOfCities</em></span>, </td>
+          <td class="paramtype">std::uint64_t</td>          <td class="paramname"><span class="paramname"><em>setOfCities</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a></td>          <td class="paramname"><span class="paramname"><em>city</em></span>, </td>
+          <td class="paramtype">std::uint64_t</td>          <td class="paramname"><span class="paramname"><em>city</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a></td>          <td class="paramname"><span class="paramname"><em>n</em></span>, </td>
+          <td class="paramtype">std::uint64_t</td>          <td class="paramname"><span class="paramname"><em>n</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint32_t &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>dp</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; uint32_t &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>dp</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -301,6 +313,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html">travelling_salesman_using_bit_manipulation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   65</span>{</div>
 <div class="line"><span class="lineno">   66</span>    <span class="comment">// base case;</span></div>
 <div class="line"><span class="lineno">   67</span>    <span class="keywordflow">if</span> (setOfCities == (1 &lt;&lt; n) - 1) {  <span class="comment">// we have covered all the cities</span></div>
@@ -317,26 +331,19 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   78</span>        <span class="comment">// check if the city is visited or not.</span></div>
 <div class="line"><span class="lineno">   79</span>        <span class="keywordflow">if</span> ((setOfCities &amp; (1 &lt;&lt; choice)) ==</div>
 <div class="line"><span class="lineno">   80</span>            0) {  <span class="comment">// this means that this perticular city is not visited.</span></div>
-<div class="line"><span class="lineno">   81</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>            std::uint64_t subProb =</div>
 <div class="line"><span class="lineno">   82</span>                dist[city][choice] +</div>
 <div class="line"><span class="lineno">   83</span>                <a class="code hl_function" href="#ad08f082be02c3437c2fe89cb035fcee1">travelling_salesman_using_bit_manipulation</a>(</div>
 <div class="line"><span class="lineno">   84</span>                    dist, setOfCities | (1 &lt;&lt; choice), choice, n, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);</div>
 <div class="line"><span class="lineno">   85</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">   86</span>            <span class="comment">// city/node and choice which tells that where we are currently.</span></div>
-<div class="line"><span class="lineno">   87</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>            ans = std::min(ans, subProb);</div>
 <div class="line"><span class="lineno">   88</span>        }</div>
 <div class="line"><span class="lineno">   89</span>    }</div>
 <div class="line"><span class="lineno">   90</span>    <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[setOfCities][city] = ans;</div>
 <div class="line"><span class="lineno">   91</span>    <span class="keywordflow">return</span> ans;</div>
 <div class="line"><span class="lineno">   92</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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ad08f082be02c3437c2fe89cb035fcee1_cgraph.svg" width="351" height="106"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 009291648..000000000
--- a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="97,5,212,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 40db79339..000000000
--- a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ad06c70220ef3f706aa177ec927291e1
\ No newline at end of file
diff --git a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 566eff0e2..000000000
--- a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="163pt" height="27pt"
- viewBox="0.00 0.00 163.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155,-19.25 68.5,-19.25 68.5,0 155,0 155,-19.25"/>
-<text text-anchor="middle" x="111.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-9.62C39.55,-9.62 48.07,-9.62 56.93,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.74,-13.13 66.74,-9.63 56.74,-6.13 56.74,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 7fe8b65da..000000000
--- a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="163pt" height="27pt"
- viewBox="0.00 0.00 163.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155,-19.25 68.5,-19.25 68.5,0 155,0 155,-19.25"/>
-<text text-anchor="middle" x="111.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-9.62C39.55,-9.62 48.07,-9.62 56.93,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.74,-13.13 66.74,-9.63 56.74,-6.13 56.74,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ad08f082be02c3437c2fe89cb035fcee1_cgraph.map b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ad08f082be02c3437c2fe89cb035fcee1_cgraph.map
deleted file mode 100644
index 1c228f4c8..000000000
--- a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ad08f082be02c3437c2fe89cb035fcee1_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation" name="bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation">
-<area shape="rect" id="Node000001" title="The function implements travellingSalesman using bitmanipulation." alt="" coords="5,29,229,100"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="78,28,80,18,88,10,100,5,117,3,137,5,149,12,147,17,135,10,117,8,101,10,91,14,85,21,83,29"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="277,52,345,78"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="229,62,261,62,261,67,229,67"/>
-</map>
diff --git a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ad08f082be02c3437c2fe89cb035fcee1_cgraph.md5 b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ad08f082be02c3437c2fe89cb035fcee1_cgraph.md5
deleted file mode 100644
index 8c82cf09c..000000000
--- a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ad08f082be02c3437c2fe89cb035fcee1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e26425ec2b9290b120fb8e3d7ed8be1f
\ No newline at end of file
diff --git a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ad08f082be02c3437c2fe89cb035fcee1_cgraph.svg b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ad08f082be02c3437c2fe89cb035fcee1_cgraph.svg
deleted file mode 100644
index 2a824ec66..000000000
--- a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ad08f082be02c3437c2fe89cb035fcee1_cgraph.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation Pages: 1 -->
-<svg width="263pt" height="79pt"
- viewBox="0.00 0.00 262.75 79.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 75)">
-<title>bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The function implements travellingSalesman using bitmanipulation.">
-<polygon fill="#999999" stroke="#666666" points="167.5,-53 0,-53 0,0 167.5,0 167.5,-53"/>
-<text text-anchor="start" x="8" y="-39.5" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::travelling</text>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">_salesman_using_bit_manipulation</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::travelling_salesman_using_bit</text>
-<text text-anchor="middle" x="83.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_manipulation</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M56.52,-53.44C55.93,-63.11 65.01,-71 83.75,-71 94.88,-71 102.6,-68.22 106.91,-63.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.08,-65.44 110.43,-54.85 103.56,-62.91 110.08,-65.44"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-36.12 203.5,-36.12 203.5,-16.88 254.75,-16.88 254.75,-36.12"/>
-<text text-anchor="middle" x="229.12" y="-22.62" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.74,-26.5C176.09,-26.5 184.23,-26.5 191.7,-26.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.65,-30 201.65,-26.5 191.65,-23 191.65,-30"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ad08f082be02c3437c2fe89cb035fcee1_cgraph_org.svg b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ad08f082be02c3437c2fe89cb035fcee1_cgraph_org.svg
deleted file mode 100644
index 215671301..000000000
--- a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ad08f082be02c3437c2fe89cb035fcee1_cgraph_org.svg
+++ /dev/null
@@ -1,51 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation Pages: 1 -->
-<svg width="263pt" height="79pt"
- viewBox="0.00 0.00 262.75 79.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 75)">
-<title>bit_manipulation::travelling_salesman_using_bit_manipulation::travelling_salesman_using_bit_manipulation</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The function implements travellingSalesman using bitmanipulation.">
-<polygon fill="#999999" stroke="#666666" points="167.5,-53 0,-53 0,0 167.5,0 167.5,-53"/>
-<text text-anchor="start" x="8" y="-39.5" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::travelling</text>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">_salesman_using_bit_manipulation</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::travelling_salesman_using_bit</text>
-<text text-anchor="middle" x="83.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_manipulation</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M56.52,-53.44C55.93,-63.11 65.01,-71 83.75,-71 94.88,-71 102.6,-68.22 106.91,-63.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.08,-65.44 110.43,-54.85 103.56,-62.91 110.08,-65.44"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-36.12 203.5,-36.12 203.5,-16.88 254.75,-16.88 254.75,-36.12"/>
-<text text-anchor="middle" x="229.12" y="-22.62" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.74,-26.5C176.09,-26.5 184.23,-26.5 191.7,-26.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.65,-30 201.65,-26.5 191.65,-23 191.65,-30"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 25931d20e..000000000
--- a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="194,5,309,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,179,16,179,21,146,21"/>
-</map>
diff --git a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 6a0afaf42..000000000
--- a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ebf49c9ac4ebc2eed540a3549bde0729
\ No newline at end of file
diff --git a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 286befcef..000000000
--- a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="236pt" height="27pt"
- viewBox="0.00 0.00 236.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228,-19.25 141.5,-19.25 141.5,0 228,0 228,-19.25"/>
-<text text-anchor="middle" x="184.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-9.62C112.55,-9.62 121.07,-9.62 129.93,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.74,-13.13 139.74,-9.63 129.74,-6.13 129.74,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 44d0c2263..000000000
--- a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="236pt" height="27pt"
- viewBox="0.00 0.00 236.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228,-19.25 141.5,-19.25 141.5,0 228,0 228,-19.25"/>
-<text text-anchor="middle" x="184.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-9.62C112.55,-9.62 121.07,-9.62 129.93,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.74,-13.13 139.74,-9.63 129.74,-6.13 129.74,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html
new file mode 100644
index 000000000..be17e5174
--- /dev/null
+++ b/d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html
@@ -0,0 +1,240 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: bit_manipulation/travelling_salesman_using_bit_manipulation.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">travelling_salesman_using_bit_manipulation.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;limits&gt;</span>     </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a> {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="keyword">namespace </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="foldopen" id="foldopen00053" data-start="{" data-end="}">
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1">   53</a></span>std::uint64_t <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"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    std::vector&lt;std::vector&lt;uint32_t&gt;&gt;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        dist,  <span class="comment">// dist is the adjacency matrix containing the distance.</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>               <span class="comment">// setOfCities as a bit represent the cities/nodes. Ex: if</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>               <span class="comment">// setOfCities = 2 =&gt; 0010(in binary) means representing the</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>               <span class="comment">// city/node B if city/nodes are represented as D-&gt;C-&gt;B-&gt;A.</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    std::uint64_t setOfCities,</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    std::uint64_t city,  <span class="comment">// city is taken to track our current city/node</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>                         <span class="comment">// movement,where we are currently.</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    std::uint64_t n,     <span class="comment">// n is the no of cities we have.</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    std::vector&lt;std::vector&lt;uint32_t&gt;&gt;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        &amp;<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>)  <span class="comment">// dp is taken to memorize the state to avoid recomputition</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>{</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="comment">// base case;</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">if</span> (setOfCities == (1 &lt;&lt; n) - 1) {  <span class="comment">// we have covered all the cities</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</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"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>                               <span class="comment">// original city.</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    }</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keywordflow">if</span> (<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[setOfCities][city] != -1) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[setOfCities][city];</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    }</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="comment">// otherwise try all possible options</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    uint64_t ans = 2147483647;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> choice = 0; choice &lt; n; choice++) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        <span class="comment">// check if the city is visited or not.</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        <span class="keywordflow">if</span> ((setOfCities &amp; (1 &lt;&lt; choice)) ==</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>            0) {  <span class="comment">// this means that this perticular city is not visited.</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>            std::uint64_t subProb =</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>                dist[city][choice] +</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</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"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>                    dist, setOfCities | (1 &lt;&lt; choice), choice, n, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>            <span class="comment">// Here we are doing a recursive call to tsp with the updated set of</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            <span class="comment">// city/node and choice which tells that where we are currently.</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            ans = std::min(ans, subProb);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[setOfCities][city] = ans;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordflow">return</span> ans;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>}</div>
+</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>}  <span class="comment">// namespace travelling_salesman_using_bit_manipulation</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>}  <span class="comment">// namespace bit_manipulation</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="foldopen" id="foldopen00100" data-start="{" data-end="}">
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"><a class="line" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  100</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="comment">// 1st test-case</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    std::vector&lt;std::vector&lt;uint32_t&gt;&gt; dist = {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        {0, 20, 42, 35}, {20, 0, 30, 34}, {42, 30, 0, 12}, {35, 34, 12, 0}};</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    uint32_t V = dist.size();</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    std::vector&lt;std::vector&lt;uint32_t&gt;&gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(1 &lt;&lt; V, std::vector&lt;uint32_t&gt;(V, -1));</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    assert(bit_manipulation::travelling_salesman_using_bit_manipulation::</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>               travelling_salesman_using_bit_manipulation(dist, 1, 0, V, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>) ==</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>           97);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test-case: passed!&quot;</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="comment">// 2nd test-case</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    dist = {{0, 5, 10, 15}, {5, 0, 20, 30}, {10, 20, 0, 35}, {15, 30, 35, 0}};</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    V = dist.size();</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    std::vector&lt;std::vector&lt;uint32_t&gt;&gt; dp1(1 &lt;&lt; V,</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>                                           std::vector&lt;uint32_t&gt;(V, -1));</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    assert(bit_manipulation::travelling_salesman_using_bit_manipulation::</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>               travelling_salesman_using_bit_manipulation(dist, 1, 0, V, dp1) ==</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>           75);</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test-case: passed!&quot;</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="comment">// 3rd test-case</span></div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    dist = {{0, 10, 15, 20}, {10, 0, 35, 25}, {15, 35, 0, 30}, {20, 25, 30, 0}};</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    V = dist.size();</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    std::vector&lt;std::vector&lt;uint32_t&gt;&gt; dp2(1 &lt;&lt; V,</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>                                           std::vector&lt;uint32_t&gt;(V, -1));</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    assert(bit_manipulation::travelling_salesman_using_bit_manipulation::</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>               travelling_salesman_using_bit_manipulation(dist, 1, 0, V, dp2) ==</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>           80);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test-case: passed!&quot;</span></div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>}</div>
+</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="foldopen" id="foldopen00139" data-start="{" data-end="}">
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"><a class="line" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  139</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</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"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>}</div>
+</div>
+<div class="ttc" id="anamespacebit__manipulation_html"><div class="ttname"><a href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></div><div class="ttdoc">for assert</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> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></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> <a href="#l00100">travelling_salesman_using_bit_manipulation.cpp:100</a></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&lt; std::vector&lt; uint32_t &gt; &gt; dist, std::uint64_t setOfCities, std::uint64_t city, std::uint64_t n, std::vector&lt; std::vector&lt; uint32_t &gt; &gt; &amp;dp)</div><div class="ttdoc">The function implements travellingSalesman using bitmanipulation.</div><div class="ttdef"><b>Definition</b> <a href="#l00053">travelling_salesman_using_bit_manipulation.cpp:53</a></div></div>
+<div class="ttc" id="atravelling__salesman__using__bit__manipulation_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00139">travelling_salesman_using_bit_manipulation.cpp:139</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_f3c4fbc4e901afa0a54d0623c5574aa7.html">bit_manipulation</a></li><li class="navelem"><a class="el" href="../../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html">travelling_salesman_using_bit_manipulation.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d90/classdata__structures_1_1_skip_list.html b/d4/d90/classdata__structures_1_1_skip_list.html
index 53f2c15ab..37484c0f5 100644
--- a/d4/d90/classdata__structures_1_1_skip_list.html
+++ b/d4/d90/classdata__structures_1_1_skip_list.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::SkipList Class Reference</title>
+<title>TheAlgorithms/C++: data_structures::SkipList Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -134,17 +151,17 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a3e249c2c35a8b7f5ffd2d77fee60d650" id="r_a3e249c2c35a8b7f5ffd2d77fee60d650"><td class="memItemLeft" align="right" valign="top"><a id="a3e249c2c35a8b7f5ffd2d77fee60d650" name="a3e249c2c35a8b7f5ffd2d77fee60d650"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>level</b></td></tr>
-<tr class="memdesc:a3e249c2c35a8b7f5ffd2d77fee60d650"><td class="mdescLeft">&#160;</td><td class="mdescRight">Maximum level of the skiplist. <br /></td></tr>
+<tr class="memitem:a3e249c2c35a8b7f5ffd2d77fee60d650" id="r_a3e249c2c35a8b7f5ffd2d77fee60d650"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a></td></tr>
+<tr class="memdesc:a3e249c2c35a8b7f5ffd2d77fee60d650"><td class="mdescLeft">&#160;</td><td class="mdescRight">Maximum level of the skiplist.  <br /></td></tr>
 <tr class="separator:a3e249c2c35a8b7f5ffd2d77fee60d650"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad7e392386d7db622185d6f7c718e4f16" id="r_ad7e392386d7db622185d6f7c718e4f16"><td class="memItemLeft" align="right" valign="top"><a id="ad7e392386d7db622185d6f7c718e4f16" name="ad7e392386d7db622185d6f7c718e4f16"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d9/d49/structdata__structures_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>header</b></td></tr>
-<tr class="memdesc:ad7e392386d7db622185d6f7c718e4f16"><td class="mdescLeft">&#160;</td><td class="mdescRight">Pointer to the header node. <br /></td></tr>
+<tr class="memitem:ad7e392386d7db622185d6f7c718e4f16" id="r_ad7e392386d7db622185d6f7c718e4f16"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../d9/d49/structdata__structures_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad7e392386d7db622185d6f7c718e4f16">header</a></td></tr>
+<tr class="memdesc:ad7e392386d7db622185d6f7c718e4f16"><td class="mdescLeft">&#160;</td><td class="mdescRight">Pointer to the header node.  <br /></td></tr>
 <tr class="separator:ad7e392386d7db622185d6f7c718e4f16"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a class="el" href="../../d4/d90/classdata__structures_1_1_skip_list.html">SkipList</a> class implementation with basic methods </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a7ffc3688725b9d1ec6e5bb881a6e2ae4" name="a7ffc3688725b9d1ec6e5bb881a6e2ae4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a7ffc3688725b9d1ec6e5bb881a6e2ae4">&#9670;&#160;</a></span>SkipList()</h2>
@@ -169,21 +186,17 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>level</b></td></tr>
 </table>
 </div><div class="memdoc">
 <p>Skip List constructor. Initializes header, start <a class="el" href="../../d9/d49/structdata__structures_1_1_node.html">Node</a> for searching in the list </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   64</span>               {</div>
 <div class="line"><span class="lineno">   65</span>        <a class="code hl_variable" href="#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a> = 0;</div>
 <div class="line"><span class="lineno">   66</span>        <span class="comment">// Header initialization</span></div>
-<div class="line"><span class="lineno">   67</span>        <a class="code hl_variable" href="#ad7e392386d7db622185d6f7c718e4f16">header</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;Node&gt;</a>(-1, <a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">MAX_LEVEL</a>);</div>
+<div class="line"><span class="lineno">   67</span>        <a class="code hl_variable" href="#ad7e392386d7db622185d6f7c718e4f16">header</a> = std::make_shared&lt;Node&gt;(-1, <a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">MAX_LEVEL</a>);</div>
 <div class="line"><span class="lineno">   68</span>    }</div>
-<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a3e249c2c35a8b7f5ffd2d77fee60d650"><div class="ttname"><a href="#a3e249c2c35a8b7f5ffd2d77fee60d650">data_structures::SkipList::level</a></div><div class="ttdeci">int level</div><div class="ttdoc">Maximum level of the skiplist.</div><div class="ttdef"><b>Definition</b> skip_list.cpp:56</div></div>
-<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_ad7e392386d7db622185d6f7c718e4f16"><div class="ttname"><a href="#ad7e392386d7db622185d6f7c718e4f16">data_structures::SkipList::header</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; header</div><div class="ttdoc">Pointer to the header node.</div><div class="ttdef"><b>Definition</b> skip_list.cpp:57</div></div>
-<div class="ttc" id="amake_shared_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared</a></div><div class="ttdeci">T make_shared(T... args)</div></div>
-<div class="ttc" id="anamespacedata__structures_html_ac0d7e0be24da9f41bcb19745873c436a"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">data_structures::MAX_LEVEL</a></div><div class="ttdeci">constexpr int MAX_LEVEL</div><div class="ttdoc">Maximum level of skip list.</div><div class="ttdef"><b>Definition</b> skip_list.cpp:27</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.svg" width="351" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a3e249c2c35a8b7f5ffd2d77fee60d650"><div class="ttname"><a href="#a3e249c2c35a8b7f5ffd2d77fee60d650">data_structures::SkipList::level</a></div><div class="ttdeci">int level</div><div class="ttdoc">Maximum level of the skiplist.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d5a/skip__list_8cpp_source.html#l00056">skip_list.cpp:56</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_ad7e392386d7db622185d6f7c718e4f16"><div class="ttname"><a href="#ad7e392386d7db622185d6f7c718e4f16">data_structures::SkipList::header</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; header</div><div class="ttdoc">Pointer to the header node.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d5a/skip__list_8cpp_source.html#l00057">skip_list.cpp:57</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html_ac0d7e0be24da9f41bcb19745873c436a"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">data_structures::MAX_LEVEL</a></div><div class="ttdeci">constexpr int MAX_LEVEL</div><div class="ttdoc">Maximum level of skip list.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d5a/skip__list_8cpp_source.html#l00027">skip_list.cpp:27</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Function Documentation</h2>
@@ -215,11 +228,13 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html#l00133">133</a> of file <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  133</span>                                {</div>
-<div class="line"><span class="lineno">  134</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Node&gt;</a> x = <a class="code hl_variable" href="#ad7e392386d7db622185d6f7c718e4f16">header</a>;</div>
+<div class="line"><span class="lineno">  134</span>        std::shared_ptr&lt;Node&gt; x = <a class="code hl_variable" href="#ad7e392386d7db622185d6f7c718e4f16">header</a>;</div>
 <div class="line"><span class="lineno">  135</span> </div>
-<div class="line"><span class="lineno">  136</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::shared_ptr&lt;Node&gt;</a>, <a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">MAX_LEVEL</a> + 1&gt; <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>;</div>
-<div class="line"><span class="lineno">  137</span>        <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/fill.html">fill</a>(<span class="keyword">nullptr</span>);</div>
+<div class="line"><span class="lineno">  136</span>        std::array&lt;std::shared_ptr&lt;Node&gt;, <a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">MAX_LEVEL</a> + 1&gt; <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>;</div>
+<div class="line"><span class="lineno">  137</span>        <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>.fill(<span class="keyword">nullptr</span>);</div>
 <div class="line"><span class="lineno">  138</span> </div>
 <div class="line"><span class="lineno">  139</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = <a class="code hl_variable" href="#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a>; i &gt;= 0; i--) {</div>
 <div class="line"><span class="lineno">  140</span>            <span class="keywordflow">while</span> (x-&gt;forward[i] != <span class="keyword">nullptr</span> &amp;&amp; x-&gt;forward[i]-&gt;key &lt; key) {</div>
@@ -241,23 +256,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  156</span>            }</div>
 <div class="line"><span class="lineno">  157</span>            <span class="comment">/* Remove empty levels*/</span></div>
 <div class="line"><span class="lineno">  158</span>            <span class="keywordflow">while</span> (<a class="code hl_variable" href="#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a> &gt; 0 &amp;&amp; <a class="code hl_variable" href="#ad7e392386d7db622185d6f7c718e4f16">header</a>-&gt;forward[<a class="code hl_variable" href="#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a>] == <span class="keyword">nullptr</span>) <a class="code hl_variable" href="#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a>--;</div>
-<div class="line"><span class="lineno">  159</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Deleted&quot;</span> &lt;&lt; <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">  159</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Deleted&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  160</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  161</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Doesn&#39;t exist&quot;</span> &lt;&lt; <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">  161</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Doesn&#39;t exist&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  162</span>        }</div>
 <div class="line"><span class="lineno">  163</span>    }</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="afill_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/fill.html">std::array::fill</a></div><div class="ttdeci">T fill(T... args)</div></div>
-<div class="ttc" id="asegtree_8cpp_html_abd3e818681fb2e29cf08f4f60f82c8e0"><div class="ttname"><a href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a></div><div class="ttdeci">void update(std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos)</div><div class="ttdoc">Updates a range of the segment tree.</div><div class="ttdef"><b>Definition</b> segtree.cpp:103</div></div>
-<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.svg" width="323" height="159"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asegtree_8cpp_html_abd3e818681fb2e29cf08f4f60f82c8e0"><div class="ttname"><a href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a></div><div class="ttdeci">void update(std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos)</div><div class="ttdoc">Updates a range of the segment tree.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d45/segtree_8cpp_source.html#l00103">segtree.cpp:103</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a812611f80b8079268dbb19cc4e9bee5c" name="a812611f80b8079268dbb19cc4e9bee5c"></a>
@@ -283,25 +288,22 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Display skip list level </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html#l00191">191</a> of file <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  191</span>                       {</div>
-<div class="line"><span class="lineno">  192</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Displaying list:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  192</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Displaying list:\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  193</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= <a class="code hl_variable" href="#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a>; i++) {</div>
-<div class="line"><span class="lineno">  194</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Node&gt;</a> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_variable" href="#ad7e392386d7db622185d6f7c718e4f16">header</a>-&gt;forward[i];</div>
-<div class="line"><span class="lineno">  195</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Level &quot;</span> &lt;&lt; (i) &lt;&lt; <span class="stringliteral">&quot;: &quot;</span>;</div>
+<div class="line"><span class="lineno">  194</span>            std::shared_ptr&lt;Node&gt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_variable" href="#ad7e392386d7db622185d6f7c718e4f16">header</a>-&gt;forward[i];</div>
+<div class="line"><span class="lineno">  195</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Level &quot;</span> &lt;&lt; (i) &lt;&lt; <span class="stringliteral">&quot;: &quot;</span>;</div>
 <div class="line"><span class="lineno">  196</span>            <span class="keywordflow">while</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> != <span class="keyword">nullptr</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> &lt;&lt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;key &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  197</span>                std::cout &lt;&lt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;key &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">  198</span>                <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;forward[i];</div>
 <div class="line"><span class="lineno">  199</span>            }</div>
-<div class="line"><span class="lineno">  200</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  200</span>            std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  201</span>        }</div>
 <div class="line"><span class="lineno">  202</span>    }</div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.svg" width="296" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a40a4042bdf0b6683b5f21ae7854de8a9" name="a40a4042bdf0b6683b5f21ae7854de8a9"></a>
@@ -337,11 +339,13 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html#l00090">90</a> of file <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a>.</p>
 <div class="fragment"><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/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Inserting&quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot;...&quot;</span>;</div>
-<div class="line"><span class="lineno">   92</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Node&gt;</a> x = <a class="code hl_variable" href="#ad7e392386d7db622185d6f7c718e4f16">header</a>;</div>
-<div class="line"><span class="lineno">   93</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::shared_ptr&lt;Node&gt;</a>, <a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">MAX_LEVEL</a> + 1&gt; <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>;</div>
-<div class="line"><span class="lineno">   94</span>        <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/fill.html">fill</a>(<span class="keyword">nullptr</span>);</div>
+<div class="line"><span class="lineno">   91</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Inserting&quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot;...&quot;</span>;</div>
+<div class="line"><span class="lineno">   92</span>        std::shared_ptr&lt;Node&gt; x = <a class="code hl_variable" href="#ad7e392386d7db622185d6f7c718e4f16">header</a>;</div>
+<div class="line"><span class="lineno">   93</span>        std::array&lt;std::shared_ptr&lt;Node&gt;, <a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">MAX_LEVEL</a> + 1&gt; <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>;</div>
+<div class="line"><span class="lineno">   94</span>        <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>.fill(<span class="keyword">nullptr</span>);</div>
 <div class="line"><span class="lineno">   95</span> </div>
 <div class="line"><span class="lineno">   96</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = <a class="code hl_variable" href="#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a>; i &gt;= 0; i--) {</div>
 <div class="line"><span class="lineno">   97</span>            <span class="keywordflow">while</span> (x-&gt;forward[i] != <span class="keyword">nullptr</span> &amp;&amp; x-&gt;forward[i]-&gt;key &lt; key) {</div>
@@ -363,25 +367,20 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  113</span>                <a class="code hl_variable" href="#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a> = rlevel;</div>
 <div class="line"><span class="lineno">  114</span>            }</div>
 <div class="line"><span class="lineno">  115</span> </div>
-<div class="line"><span class="lineno">  116</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Node&gt;</a> n =</div>
-<div class="line"><span class="lineno">  117</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;Node&gt;</a>(key, rlevel, value);</div>
+<div class="line"><span class="lineno">  116</span>            std::shared_ptr&lt;Node&gt; n =</div>
+<div class="line"><span class="lineno">  117</span>                std::make_shared&lt;Node&gt;(key, rlevel, value);</div>
 <div class="line"><span class="lineno">  118</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= rlevel; i++) {</div>
 <div class="line"><span class="lineno">  119</span>                n-&gt;forward[i] = <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>[i]-&gt;forward[i];</div>
 <div class="line"><span class="lineno">  120</span>                <a class="code hl_function" href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0">update</a>[i]-&gt;forward[i] = n;</div>
 <div class="line"><span class="lineno">  121</span>            }</div>
-<div class="line"><span class="lineno">  122</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Inserted&quot;</span> &lt;&lt; <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">  122</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Inserted&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  123</span> </div>
 <div class="line"><span class="lineno">  124</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  125</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Exists&quot;</span> &lt;&lt; <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">  125</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Exists&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  126</span>        }</div>
 <div class="line"><span class="lineno">  127</span>    }</div>
-<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_aa3f3813e9896792fc86b296547689ba4"><div class="ttname"><a href="#aa3f3813e9896792fc86b296547689ba4">data_structures::SkipList::randomLevel</a></div><div class="ttdeci">int randomLevel()</div><div class="ttdef"><b>Definition</b> skip_list.cpp:75</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.svg" width="512" height="274"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_aa3f3813e9896792fc86b296547689ba4"><div class="ttname"><a href="#aa3f3813e9896792fc86b296547689ba4">data_structures::SkipList::randomLevel</a></div><div class="ttdeci">int randomLevel()</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d5a/skip__list_8cpp_source.html#l00075">skip_list.cpp:75</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa3f3813e9896792fc86b296547689ba4" name="aa3f3813e9896792fc86b296547689ba4"></a>
@@ -407,22 +406,18 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Returns random level of the skip list. Every higher level is 2 times less likely. </p><dl class="section return"><dt>Returns</dt><dd>random level for skip list </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html#l00075">75</a> of file <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   75</span>                      {</div>
 <div class="line"><span class="lineno">   76</span>        <span class="keywordtype">int</span> lvl = 0;</div>
-<div class="line"><span class="lineno">   77</span>        <span class="keywordflow">while</span> (<span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>()) / RAND_MAX &lt; <a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61">PROBABILITY</a> &amp;&amp;</div>
+<div class="line"><span class="lineno">   77</span>        <span class="keywordflow">while</span> (<span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(std::rand()) / RAND_MAX &lt; <a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61">PROBABILITY</a> &amp;&amp;</div>
 <div class="line"><span class="lineno">   78</span>               lvl &lt; <a class="code hl_variable" href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">MAX_LEVEL</a>) {</div>
 <div class="line"><span class="lineno">   79</span>            lvl++;</div>
 <div class="line"><span class="lineno">   80</span>        }</div>
 <div class="line"><span class="lineno">   81</span>        <span class="keywordflow">return</span> lvl;</div>
 <div class="line"><span class="lineno">   82</span>    }</div>
-<div class="ttc" id="anamespacedata__structures_html_a903639d8e6f955dd8d5c263781455d61"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61">data_structures::PROBABILITY</a></div><div class="ttdeci">constexpr float PROBABILITY</div><div class="ttdoc">Current probability for &quot;coin toss&quot;.</div><div class="ttdef"><b>Definition</b> skip_list.cpp:28</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.svg" width="298" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacedata__structures_html_a903639d8e6f955dd8d5c263781455d61"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61">data_structures::PROBABILITY</a></div><div class="ttdeci">constexpr float PROBABILITY</div><div class="ttdoc">Current probability for &quot;coin toss&quot;.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d5a/skip__list_8cpp_source.html#l00028">skip_list.cpp:28</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af2f3d4e15b1f47afac849c2e08a730f4" name="af2f3d4e15b1f47afac849c2e08a730f4"></a>
@@ -454,9 +449,11 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>pointer to the value of the node </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html#l00170">170</a> of file <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  170</span>                                 {</div>
-<div class="line"><span class="lineno">  171</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Node&gt;</a> x = <a class="code hl_variable" href="#ad7e392386d7db622185d6f7c718e4f16">header</a>;</div>
-<div class="line"><span class="lineno">  172</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Searching for &quot;</span> &lt;&lt; key &lt;&lt; <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">  171</span>        std::shared_ptr&lt;Node&gt; x = <a class="code hl_variable" href="#ad7e392386d7db622185d6f7c718e4f16">header</a>;</div>
+<div class="line"><span class="lineno">  172</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Searching for &quot;</span> &lt;&lt; key &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  173</span> </div>
 <div class="line"><span class="lineno">  174</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = <a class="code hl_variable" href="#a3e249c2c35a8b7f5ffd2d77fee60d650">level</a>; i &gt;= 0; i--) {</div>
 <div class="line"><span class="lineno">  175</span>            <span class="keywordflow">while</span> (x-&gt;forward[i] &amp;&amp; x-&gt;forward[i]-&gt;key &lt; key) x = x-&gt;forward[i];</div>
@@ -464,23 +461,71 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  177</span> </div>
 <div class="line"><span class="lineno">  178</span>        x = x-&gt;forward[0];</div>
 <div class="line"><span class="lineno">  179</span>        <span class="keywordflow">if</span> (x &amp;&amp; x-&gt;key == key) {</div>
-<div class="line"><span class="lineno">  180</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Found&quot;</span> &lt;&lt; <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">  180</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Found&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  181</span>            <span class="keywordflow">return</span> x-&gt;value;</div>
 <div class="line"><span class="lineno">  182</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  183</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Not Found&quot;</span> &lt;&lt; <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">  183</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Not Found&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  184</span>            <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  185</span>        }</div>
 <div class="line"><span class="lineno">  186</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d90/classdata__structures_1_1_skip_list_af2f3d4e15b1f47afac849c2e08a730f4_cgraph.svg" width="296" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="ad7e392386d7db622185d6f7c718e4f16" name="ad7e392386d7db622185d6f7c718e4f16"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ad7e392386d7db622185d6f7c718e4f16">&#9670;&#160;</a></span>header</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::shared_ptr&lt;<a class="el" href="../../d9/d49/structdata__structures_1_1_node.html">Node</a>&gt; data_structures::SkipList::header</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Pointer to the header node. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a3e249c2c35a8b7f5ffd2d77fee60d650" name="a3e249c2c35a8b7f5ffd2d77fee60d650"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a3e249c2c35a8b7f5ffd2d77fee60d650">&#9670;&#160;</a></span>level</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int data_structures::SkipList::level</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Maximum level of the skiplist. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html#l00056">56</a> of file <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../d0/d5a/skip__list_8cpp.html">skip_list.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.map b/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.map
deleted file mode 100644
index f92c9de1e..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="data_structures::SkipList::insertElement" name="data_structures::SkipList::insertElement">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,96,172,137"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="267,5,338,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="120,94,166,66,219,40,251,28,253,33,221,45,168,71,123,98"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/fill.html#" title=" " alt="" coords="254,55,352,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="172,95,239,79,240,85,173,100"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="240,104,366,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="172,114,225,114,225,120,172,120"/>
-<area shape="rect" id="Node000005" href="$d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4" title=" " alt="" coords="220,154,386,194"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="168,135,210,147,209,152,166,140"/>
-<area shape="rect" id="Node000007" href="$d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0" title="Updates a range of the segment tree." alt="" coords="273,243,333,268"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="120,135,221,204,267,232,264,237,218,208,117,140"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="434,161,506,187"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="386,172,418,172,418,177,386,177"/>
-<area shape="poly" id="edge7_Node000007_Node000007" title=" " alt="" coords="274,244,269,234,272,224,284,218,303,216,323,219,334,225,331,230,321,224,303,221,285,223,276,228,274,233,279,241"/>
-</map>
diff --git a/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.md5 b/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.md5
deleted file mode 100644
index 2adb36809..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ff8fdea3972c8209c5db017367ce3486
\ No newline at end of file
diff --git a/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.svg b/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.svg
deleted file mode 100644
index 4fc528e40..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph.svg
+++ /dev/null
@@ -1,166 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SkipList::insertElement Pages: 1 -->
-<svg width="384pt" height="205pt"
- viewBox="0.00 0.00 383.75 205.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 201.25)">
-<title>data_structures::SkipList::insertElement</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124.75,-128.88 0,-128.88 0,-98.38 124.75,-98.38 124.75,-128.88"/>
-<text text-anchor="start" x="8" y="-115.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="62.38" y="-104.12" font-family="Helvetica,sans-Serif" font-size="10.00">::insertElement</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.88,-197.25 196.38,-197.25 196.38,-178 249.88,-178 249.88,-197.25"/>
-<text text-anchor="middle" x="223.12" y="-183.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.96,-129.31C106.19,-141.57 134.39,-158.37 160.75,-169.62 168.47,-172.92 176.99,-175.84 185.16,-178.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.94,-181.61 194.51,-181 185.86,-174.88 183.94,-181.61"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/fill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.62,-160.25 186.62,-160.25 186.62,-141 259.62,-141 259.62,-160.25"/>
-<text text-anchor="middle" x="223.12" y="-146.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::fill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.21,-128.04C141.88,-131.92 159.64,-136.06 175.34,-139.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.36,-143.09 184.89,-141.95 175.95,-136.27 174.36,-143.09"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.12,-123.25 176.12,-123.25 176.12,-104 270.12,-104 270.12,-123.25"/>
-<text text-anchor="middle" x="223.12" y="-109.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.21,-113.62C138.14,-113.62 151.72,-113.62 164.49,-113.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.44,-117.13 174.44,-113.63 164.44,-110.13 164.44,-117.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.5,-85.88 160.75,-85.88 160.75,-55.38 285.5,-55.38 285.5,-85.88"/>
-<text text-anchor="start" x="168.75" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="223.12" y="-61.12" font-family="Helvetica,sans-Serif" font-size="10.00">::randomLevel</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.14,-97.98C131.53,-95.16 142.46,-92.2 153.14,-89.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.94,-92.72 162.68,-86.73 152.11,-85.96 153.94,-92.72"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0" target="_top" xlink:title="Updates a range of the segment tree.">
-<polygon fill="white" stroke="#666666" points="245.75,-19.25 200.5,-19.25 200.5,0 245.75,0 245.75,-19.25"/>
-<text text-anchor="middle" x="223.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.16,-98.08C104.73,-84.25 134.36,-63.64 160.75,-46.62 171.84,-39.47 184.28,-31.89 195.05,-25.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.64,-28.6 203.46,-20.49 193.07,-22.58 196.64,-28.6"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="375.75,-80.25 321.5,-80.25 321.5,-61 375.75,-61 375.75,-80.25"/>
-<text text-anchor="middle" x="348.62" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.88,-70.62C294.03,-70.62 302.18,-70.62 309.76,-70.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.62,-74.13 319.62,-70.63 309.62,-67.13 309.62,-74.13"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.48,-19.54C194.52,-28.15 201.06,-37.25 223.12,-37.25 235.19,-37.25 242.61,-34.53 245.4,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.83,-29.94 243.12,-21.01 242.02,-31.55 248.83,-29.94"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph_org.svg b/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph_org.svg
deleted file mode 100644
index 6b0d4d2dc..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_a40a4042bdf0b6683b5f21ae7854de8a9_cgraph_org.svg
+++ /dev/null
@@ -1,140 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SkipList::insertElement Pages: 1 -->
-<svg width="384pt" height="205pt"
- viewBox="0.00 0.00 383.75 205.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 201.25)">
-<title>data_structures::SkipList::insertElement</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124.75,-128.88 0,-128.88 0,-98.38 124.75,-98.38 124.75,-128.88"/>
-<text text-anchor="start" x="8" y="-115.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="62.38" y="-104.12" font-family="Helvetica,sans-Serif" font-size="10.00">::insertElement</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.88,-197.25 196.38,-197.25 196.38,-178 249.88,-178 249.88,-197.25"/>
-<text text-anchor="middle" x="223.12" y="-183.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.96,-129.31C106.19,-141.57 134.39,-158.37 160.75,-169.62 168.47,-172.92 176.99,-175.84 185.16,-178.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.94,-181.61 194.51,-181 185.86,-174.88 183.94,-181.61"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/fill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.62,-160.25 186.62,-160.25 186.62,-141 259.62,-141 259.62,-160.25"/>
-<text text-anchor="middle" x="223.12" y="-146.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::fill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.21,-128.04C141.88,-131.92 159.64,-136.06 175.34,-139.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.36,-143.09 184.89,-141.95 175.95,-136.27 174.36,-143.09"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.12,-123.25 176.12,-123.25 176.12,-104 270.12,-104 270.12,-123.25"/>
-<text text-anchor="middle" x="223.12" y="-109.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.21,-113.62C138.14,-113.62 151.72,-113.62 164.49,-113.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.44,-117.13 174.44,-113.63 164.44,-110.13 164.44,-117.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.5,-85.88 160.75,-85.88 160.75,-55.38 285.5,-55.38 285.5,-85.88"/>
-<text text-anchor="start" x="168.75" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="223.12" y="-61.12" font-family="Helvetica,sans-Serif" font-size="10.00">::randomLevel</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.14,-97.98C131.53,-95.16 142.46,-92.2 153.14,-89.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.94,-92.72 162.68,-86.73 152.11,-85.96 153.94,-92.72"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0" target="_top" xlink:title="Updates a range of the segment tree.">
-<polygon fill="white" stroke="#666666" points="245.75,-19.25 200.5,-19.25 200.5,0 245.75,0 245.75,-19.25"/>
-<text text-anchor="middle" x="223.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.16,-98.08C104.73,-84.25 134.36,-63.64 160.75,-46.62 171.84,-39.47 184.28,-31.89 195.05,-25.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.64,-28.6 203.46,-20.49 193.07,-22.58 196.64,-28.6"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="375.75,-80.25 321.5,-80.25 321.5,-61 375.75,-61 375.75,-80.25"/>
-<text text-anchor="middle" x="348.62" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.88,-70.62C294.03,-70.62 302.18,-70.62 309.76,-70.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.62,-74.13 319.62,-70.63 309.62,-67.13 309.62,-74.13"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.48,-19.54C194.52,-28.15 201.06,-37.25 223.12,-37.25 235.19,-37.25 242.61,-34.53 245.4,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.83,-29.94 243.12,-21.01 242.02,-31.55 248.83,-29.94"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.map b/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.map
deleted file mode 100644
index 82f00c5c8..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::SkipList::SkipList" name="data_structures::SkipList::SkipList">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,172,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="220,13,345,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="172,23,204,23,204,28,172,28"/>
-</map>
diff --git a/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.md5 b/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.md5
deleted file mode 100644
index a1c0e17fd..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c11614557089243886366727115b2ec0
\ No newline at end of file
diff --git a/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.svg b/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.svg
deleted file mode 100644
index 3c05d9af8..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SkipList::SkipList Pages: 1 -->
-<svg width="263pt" height="39pt"
- viewBox="0.00 0.00 262.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::SkipList::SkipList</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124.75,-30.5 0,-30.5 0,0 124.75,0 124.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="62.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SkipList</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-24.88 160.75,-24.88 160.75,-5.63 254.75,-5.63 254.75,-24.88"/>
-<text text-anchor="middle" x="207.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.01,-15.25C132.97,-15.25 141.09,-15.25 148.98,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.81,-18.75 158.81,-15.25 148.81,-11.75 148.81,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph_org.svg b/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph_org.svg
deleted file mode 100644
index 84f93bdf1..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_a7ffc3688725b9d1ec6e5bb881a6e2ae4_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SkipList::SkipList Pages: 1 -->
-<svg width="263pt" height="39pt"
- viewBox="0.00 0.00 262.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::SkipList::SkipList</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124.75,-30.5 0,-30.5 0,0 124.75,0 124.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="62.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SkipList</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-24.88 160.75,-24.88 160.75,-5.63 254.75,-5.63 254.75,-24.88"/>
-<text text-anchor="middle" x="207.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.01,-15.25C132.97,-15.25 141.09,-15.25 148.98,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.81,-18.75 158.81,-15.25 148.81,-11.75 148.81,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.map b/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.map
deleted file mode 100644
index ddd608fc1..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::SkipList::displayList" name="data_structures::SkipList::displayList">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,172,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="220,13,291,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="172,23,204,23,204,28,172,28"/>
-</map>
diff --git a/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.md5 b/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.md5
deleted file mode 100644
index 6bfb10fd9..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-94dcfce2656d2d13d8e6d7b2f9a2cf56
\ No newline at end of file
diff --git a/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.svg b/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.svg
deleted file mode 100644
index b2d1056b6..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SkipList::displayList Pages: 1 -->
-<svg width="222pt" height="39pt"
- viewBox="0.00 0.00 222.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::SkipList::displayList</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124.75,-30.5 0,-30.5 0,0 124.75,0 124.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="62.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::displayList</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.25,-24.88 160.75,-24.88 160.75,-5.63 214.25,-5.63 214.25,-24.88"/>
-<text text-anchor="middle" x="187.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.94,-15.25C133.14,-15.25 141.35,-15.25 148.97,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.87,-18.75 158.87,-15.25 148.87,-11.75 148.87,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph_org.svg b/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph_org.svg
deleted file mode 100644
index 41ad92cd4..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_a812611f80b8079268dbb19cc4e9bee5c_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SkipList::displayList Pages: 1 -->
-<svg width="222pt" height="39pt"
- viewBox="0.00 0.00 222.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::SkipList::displayList</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124.75,-30.5 0,-30.5 0,0 124.75,0 124.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="62.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::displayList</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.25,-24.88 160.75,-24.88 160.75,-5.63 214.25,-5.63 214.25,-24.88"/>
-<text text-anchor="middle" x="187.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.94,-15.25C133.14,-15.25 141.35,-15.25 148.97,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.87,-18.75 158.87,-15.25 148.87,-11.75 148.87,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.map b/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.map
deleted file mode 100644
index 3edad6b0f..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="data_structures::SkipList::deleteElement" name="data_structures::SkipList::deleteElement">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,47,172,88"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="233,5,304,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="164,44,217,29,219,34,166,49"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/fill.html#" title=" " alt="" coords="220,55,317,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="172,65,204,65,204,70,172,70"/>
-<area shape="rect" id="Node000004" href="$d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0" title="Updates a range of the segment tree." alt="" coords="238,128,298,154"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="141,86,225,120,223,125,139,91"/>
-<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="238,129,232,119,236,110,248,104,268,101,290,104,302,110,299,115,288,109,268,107,250,109,240,113,237,119,242,126"/>
-</map>
diff --git a/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.md5 b/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.md5
deleted file mode 100644
index c02d792e0..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5486892dffad714417c08971e46ed3d8
\ No newline at end of file
diff --git a/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.svg b/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.svg
deleted file mode 100644
index 6f4be620d..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SkipList::deleteElement Pages: 1 -->
-<svg width="242pt" height="119pt"
- viewBox="0.00 0.00 241.75 119.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 115.25)">
-<title>data_structures::SkipList::deleteElement</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124.75,-79.88 0,-79.88 0,-49.38 124.75,-49.38 124.75,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="62.38" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::deleteElement</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-111.25 170.5,-111.25 170.5,-92 224,-92 224,-111.25"/>
-<text text-anchor="middle" x="197.25" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.73,-80.32C133.16,-84.06 147.15,-87.95 159.44,-91.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.16,-94.65 168.73,-93.96 160.03,-87.91 158.16,-94.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/fill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.75,-74.25 160.75,-74.25 160.75,-55 233.75,-55 233.75,-74.25"/>
-<text text-anchor="middle" x="197.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::fill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.14,-64.62C133.16,-64.62 141.26,-64.62 148.98,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.84,-68.13 158.84,-64.63 148.84,-61.13 148.84,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0" target="_top" xlink:title="Updates a range of the segment tree.">
-<polygon fill="white" stroke="#666666" points="219.88,-19.25 174.62,-19.25 174.62,0 219.88,0 219.88,-19.25"/>
-<text text-anchor="middle" x="197.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.1,-49.01C120.85,-40.83 144.8,-30.92 163.73,-23.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.92,-26.38 172.83,-19.32 162.25,-19.91 164.92,-26.38"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.13,-19.54C166.5,-28.15 173.54,-37.25 197.25,-37.25 210.22,-37.25 218.2,-34.53 221.19,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.59,-29.83 218.74,-21 217.81,-31.56 224.59,-29.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph_org.svg b/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph_org.svg
deleted file mode 100644
index 6cc498bbc..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_a86925c53e139cc6c3f7df1e9003bb0b0_cgraph_org.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SkipList::deleteElement Pages: 1 -->
-<svg width="242pt" height="119pt"
- viewBox="0.00 0.00 241.75 119.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 115.25)">
-<title>data_structures::SkipList::deleteElement</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124.75,-79.88 0,-79.88 0,-49.38 124.75,-49.38 124.75,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="62.38" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::deleteElement</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-111.25 170.5,-111.25 170.5,-92 224,-92 224,-111.25"/>
-<text text-anchor="middle" x="197.25" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.73,-80.32C133.16,-84.06 147.15,-87.95 159.44,-91.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.16,-94.65 168.73,-93.96 160.03,-87.91 158.16,-94.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/fill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.75,-74.25 160.75,-74.25 160.75,-55 233.75,-55 233.75,-74.25"/>
-<text text-anchor="middle" x="197.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::fill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.14,-64.62C133.16,-64.62 141.26,-64.62 148.98,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.84,-68.13 158.84,-64.63 148.84,-61.13 148.84,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0" target="_top" xlink:title="Updates a range of the segment tree.">
-<polygon fill="white" stroke="#666666" points="219.88,-19.25 174.62,-19.25 174.62,0 219.88,0 219.88,-19.25"/>
-<text text-anchor="middle" x="197.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.1,-49.01C120.85,-40.83 144.8,-30.92 163.73,-23.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.92,-26.38 172.83,-19.32 162.25,-19.91 164.92,-26.38"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.13,-19.54C166.5,-28.15 173.54,-37.25 197.25,-37.25 210.22,-37.25 218.2,-34.53 221.19,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.59,-29.83 218.74,-21 217.81,-31.56 224.59,-29.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.map b/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.map
deleted file mode 100644
index e3442d2be..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::SkipList::randomLevel" name="data_structures::SkipList::randomLevel">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,172,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="220,13,292,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="172,23,204,23,204,28,172,28"/>
-</map>
diff --git a/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.md5 b/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.md5
deleted file mode 100644
index 886715470..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8c3f44aaa18b1da49d203d70e6abfa4f
\ No newline at end of file
diff --git a/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.svg b/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.svg
deleted file mode 100644
index dcbc6e5b3..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SkipList::randomLevel Pages: 1 -->
-<svg width="223pt" height="39pt"
- viewBox="0.00 0.00 223.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::SkipList::randomLevel</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124.75,-30.5 0,-30.5 0,0 124.75,0 124.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="62.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::randomLevel</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215,-24.88 160.75,-24.88 160.75,-5.63 215,-5.63 215,-24.88"/>
-<text text-anchor="middle" x="187.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.12,-15.25C133.28,-15.25 141.43,-15.25 149.01,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.87,-18.75 158.87,-15.25 148.87,-11.75 148.87,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph_org.svg b/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph_org.svg
deleted file mode 100644
index e7b8ec776..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_aa3f3813e9896792fc86b296547689ba4_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SkipList::randomLevel Pages: 1 -->
-<svg width="223pt" height="39pt"
- viewBox="0.00 0.00 223.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::SkipList::randomLevel</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124.75,-30.5 0,-30.5 0,0 124.75,0 124.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="62.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::randomLevel</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215,-24.88 160.75,-24.88 160.75,-5.63 215,-5.63 215,-24.88"/>
-<text text-anchor="middle" x="187.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.12,-15.25C133.28,-15.25 141.43,-15.25 149.01,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.87,-18.75 158.87,-15.25 148.87,-11.75 148.87,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d90/classdata__structures_1_1_skip_list_af2f3d4e15b1f47afac849c2e08a730f4_cgraph.map b/d4/d90/classdata__structures_1_1_skip_list_af2f3d4e15b1f47afac849c2e08a730f4_cgraph.map
deleted file mode 100644
index 011ed3e1a..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_af2f3d4e15b1f47afac849c2e08a730f4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::SkipList::searchElement" name="data_structures::SkipList::searchElement">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,172,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="220,13,291,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="172,23,204,23,204,28,172,28"/>
-</map>
diff --git a/d4/d90/classdata__structures_1_1_skip_list_af2f3d4e15b1f47afac849c2e08a730f4_cgraph.md5 b/d4/d90/classdata__structures_1_1_skip_list_af2f3d4e15b1f47afac849c2e08a730f4_cgraph.md5
deleted file mode 100644
index 48e48edac..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_af2f3d4e15b1f47afac849c2e08a730f4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f734a36732bf0d9026421b6968459c60
\ No newline at end of file
diff --git a/d4/d90/classdata__structures_1_1_skip_list_af2f3d4e15b1f47afac849c2e08a730f4_cgraph.svg b/d4/d90/classdata__structures_1_1_skip_list_af2f3d4e15b1f47afac849c2e08a730f4_cgraph.svg
deleted file mode 100644
index bb37b05a8..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_af2f3d4e15b1f47afac849c2e08a730f4_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SkipList::searchElement Pages: 1 -->
-<svg width="222pt" height="39pt"
- viewBox="0.00 0.00 222.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::SkipList::searchElement</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124.75,-30.5 0,-30.5 0,0 124.75,0 124.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="62.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::searchElement</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.25,-24.88 160.75,-24.88 160.75,-5.63 214.25,-5.63 214.25,-24.88"/>
-<text text-anchor="middle" x="187.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.94,-15.25C133.14,-15.25 141.35,-15.25 148.97,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.87,-18.75 158.87,-15.25 148.87,-11.75 148.87,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d90/classdata__structures_1_1_skip_list_af2f3d4e15b1f47afac849c2e08a730f4_cgraph_org.svg b/d4/d90/classdata__structures_1_1_skip_list_af2f3d4e15b1f47afac849c2e08a730f4_cgraph_org.svg
deleted file mode 100644
index 31fa89ebe..000000000
--- a/d4/d90/classdata__structures_1_1_skip_list_af2f3d4e15b1f47afac849c2e08a730f4_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SkipList::searchElement Pages: 1 -->
-<svg width="222pt" height="39pt"
- viewBox="0.00 0.00 222.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::SkipList::searchElement</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124.75,-30.5 0,-30.5 0,0 124.75,0 124.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
-<text text-anchor="middle" x="62.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::searchElement</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.25,-24.88 160.75,-24.88 160.75,-5.63 214.25,-5.63 214.25,-24.88"/>
-<text text-anchor="middle" x="187.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.94,-15.25C133.14,-15.25 141.35,-15.25 148.97,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.87,-18.75 158.87,-15.25 148.87,-11.75 148.87,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d91/namespacevector__cross.html b/d4/d91/namespacevector__cross.html
index 0d561c529..5aea5019a 100644
--- a/d4/d91/namespacevector__cross.html
+++ b/d4/d91/namespacevector__cross.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: vector_cross Namespace Reference</title>
+<title>TheAlgorithms/C++: vector_cross Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d4/d9a/classdata__structures_1_1_bitset__coll__graph.map b/d4/d9a/classdata__structures_1_1_bitset__coll__graph.map
index 546c94342..f09a208b1 100644
--- a/d4/d9a/classdata__structures_1_1_bitset__coll__graph.map
+++ b/d4/d9a/classdata__structures_1_1_bitset__coll__graph.map
@@ -1,8 +1,5 @@
 <map id="data_structures::Bitset" name="data_structures::Bitset">
-<area shape="rect" id="Node000001" title="Simple bitset implementation for bloom filter." alt="" coords="5,183,159,208"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="114,94,282,120"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="171,131,100,184,97,180,168,127"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/size_t.html" title=" " alt="" coords="9,5,91,31"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="45,46,41,81,44,119,58,154,75,181,71,184,53,156,38,120,35,81,40,45"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="85,37,178,91,176,96,82,41"/>
+<area shape="rect" id="Node000001" title="Simple bitset implementation for bloom filter." alt="" coords="13,94,166,120"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,5,174,31"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="92,47,92,94,87,94,87,47"/>
 </map>
diff --git a/d4/d9a/classdata__structures_1_1_bitset__coll__graph.md5 b/d4/d9a/classdata__structures_1_1_bitset__coll__graph.md5
index 6c63f74c1..71773321d 100644
--- a/d4/d9a/classdata__structures_1_1_bitset__coll__graph.md5
+++ b/d4/d9a/classdata__structures_1_1_bitset__coll__graph.md5
@@ -1 +1 @@
-1bab397f501643071d9df8c108a1600f
\ No newline at end of file
+d0fb9e05069d084f551a4339cc321ee5
\ No newline at end of file
diff --git a/d4/d9a/classdata__structures_1_1_bitset__coll__graph.svg b/d4/d9a/classdata__structures_1_1_bitset__coll__graph.svg
index 36fd561f2..0987b9124 100644
--- a/d4/d9a/classdata__structures_1_1_bitset__coll__graph.svg
+++ b/d4/d9a/classdata__structures_1_1_bitset__coll__graph.svg
@@ -4,8 +4,8 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: data_structures::Bitset Pages: 1 -->
-<svg width="216pt" height="160pt"
- viewBox="0.00 0.00 215.62 160.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="134pt" height="94pt"
+ viewBox="0.00 0.00 134.25 93.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
 <svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
@@ -17,23 +17,23 @@
 ]]></style>
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
 <svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 156.25)">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89.75)">
 <title>data_structures::Bitset</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="Simple bitset implementation for bloom filter.">
-<polygon fill="#999999" stroke="#666666" points="115,-19.25 0,-19.25 0,0 115,0 115,-19.25"/>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
+<polygon fill="#999999" stroke="#666666" points="120.62,-19.25 5.62,-19.25 5.62,0 120.62,0 120.62,-19.25"/>
+<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="207.62,-85.75 81.38,-85.75 81.38,-66.5 207.62,-66.5 207.62,-85.75"/>
-<text text-anchor="middle" x="144.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::size_t &gt;</text>
+<g id="a_Node000002"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="126.25,-85.75 0,-85.75 0,-66.5 126.25,-66.5 126.25,-85.75"/>
+<text text-anchor="middle" x="63.12" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::size_t &gt;</text>
 </a>
 </g>
 </g>
@@ -41,40 +41,11 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M123.34,-59.43C106.55,-46.99 83.67,-30.03 69.77,-19.73"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="121.07,-62.11 131.19,-65.26 125.24,-56.49 121.07,-62.11"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M63.12,-54.65C63.12,-42.82 63.12,-28.54 63.12,-19.52"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="59.63,-54.64 63.13,-64.64 66.63,-54.64 59.63,-54.64"/>
 </a>
 </g>
-<text text-anchor="middle" x="117.08" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="64.38,-152.25 2.62,-152.25 2.62,-133 64.38,-133 64.38,-152.25"/>
-<text text-anchor="middle" x="33.5" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node3&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M28.14,-121.93C24.82,-106.61 22.02,-84.91 26.75,-66.5 31.38,-48.48 43.18,-30.05 50.74,-19.51"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="24.63,-122.33 30.41,-131.21 31.43,-120.66 24.63,-122.33"/>
-</a>
-</g>
-<text text-anchor="middle" x="49.62" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> blockSize</text>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M58.72,-126.97C80.28,-114.44 110.62,-96.81 128.84,-86.23"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="57.13,-123.85 50.24,-131.9 60.65,-129.9 57.13,-123.85"/>
-</a>
-</g>
-<text text-anchor="middle" x="117.02" y="-105.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="74" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
 </g>
 </g>
 </svg>
diff --git a/d4/d9a/classdata__structures_1_1_bitset__coll__graph_org.svg b/d4/d9a/classdata__structures_1_1_bitset__coll__graph_org.svg
index d41216e3f..e9b55af62 100644
--- a/d4/d9a/classdata__structures_1_1_bitset__coll__graph_org.svg
+++ b/d4/d9a/classdata__structures_1_1_bitset__coll__graph_org.svg
@@ -4,25 +4,25 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: data_structures::Bitset Pages: 1 -->
-<svg width="216pt" height="160pt"
- viewBox="0.00 0.00 215.62 160.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 156.25)">
+<svg width="134pt" height="94pt"
+ viewBox="0.00 0.00 134.25 93.75" 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.75)">
 <title>data_structures::Bitset</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="Simple bitset implementation for bloom filter.">
-<polygon fill="#999999" stroke="#666666" points="115,-19.25 0,-19.25 0,0 115,0 115,-19.25"/>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
+<polygon fill="#999999" stroke="#666666" points="120.62,-19.25 5.62,-19.25 5.62,0 120.62,0 120.62,-19.25"/>
+<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="207.62,-85.75 81.38,-85.75 81.38,-66.5 207.62,-66.5 207.62,-85.75"/>
-<text text-anchor="middle" x="144.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::size_t &gt;</text>
+<g id="a_Node000002"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="126.25,-85.75 0,-85.75 0,-66.5 126.25,-66.5 126.25,-85.75"/>
+<text text-anchor="middle" x="63.12" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::size_t &gt;</text>
 </a>
 </g>
 </g>
@@ -30,40 +30,11 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M123.34,-59.43C106.55,-46.99 83.67,-30.03 69.77,-19.73"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="121.07,-62.11 131.19,-65.26 125.24,-56.49 121.07,-62.11"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M63.12,-54.65C63.12,-42.82 63.12,-28.54 63.12,-19.52"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="59.63,-54.64 63.13,-64.64 66.63,-54.64 59.63,-54.64"/>
 </a>
 </g>
-<text text-anchor="middle" x="117.08" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="64.38,-152.25 2.62,-152.25 2.62,-133 64.38,-133 64.38,-152.25"/>
-<text text-anchor="middle" x="33.5" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node3&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M28.14,-121.93C24.82,-106.61 22.02,-84.91 26.75,-66.5 31.38,-48.48 43.18,-30.05 50.74,-19.51"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="24.63,-122.33 30.41,-131.21 31.43,-120.66 24.63,-122.33"/>
-</a>
-</g>
-<text text-anchor="middle" x="49.62" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> blockSize</text>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M58.72,-126.97C80.28,-114.44 110.62,-96.81 128.84,-86.23"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="57.13,-123.85 50.24,-131.9 60.65,-129.9 57.13,-123.85"/>
-</a>
-</g>
-<text text-anchor="middle" x="117.02" y="-105.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="74" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
 </g>
 </g>
 </svg>
diff --git a/d4/d9c/primes__up__to__billion_8cpp.html b/d4/d9c/primes__up__to__billion_8cpp.html
index 4ff4ea67a..5e0e15763 100644
--- a/d4/d9c/primes__up__to__billion_8cpp.html
+++ b/d4/d9c/primes__up__to__billion_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/primes_up_to_billion.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/primes_up_to_billion.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for primes_up_to_billion.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dfd/primes__up__to__billion_8cpp__incl.svg" width="208" height="111"><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">
+</div>
+<p><a href="../../d4/d9c/primes__up__to__billion_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a031cada84819ed6426f58e4f7e81261c" id="r_a031cada84819ed6426f58e4f7e81261c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a031cada84819ed6426f58e4f7e81261c">Sieve</a> (int64_t n)</td></tr>
@@ -136,6 +155,8 @@ Variables</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Compute prime numbers upto 1 billion. </p>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../de/d9b/prime__numbers_8cpp.html" title="Get list of prime numbers.">prime_numbers.cpp</a> <a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html" title="Prime Numbers using Sieve of Eratosthenes">sieve_of_eratosthenes.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d9c/primes__up__to__billion_8cpp_source.html">primes_up_to_billion.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -152,27 +173,22 @@ Variables</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d9c/primes__up__to__billion_8cpp_source.html#l00026">26</a> of file <a class="el" href="../../d4/d9c/primes__up__to__billion_8cpp_source.html">primes_up_to_billion.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   26</span>           {</div>
 <div class="line"><span class="lineno">   27</span>    <a class="code hl_function" href="#a031cada84819ed6426f58e4f7e81261c">Sieve</a>(100000000);</div>
 <div class="line"><span class="lineno">   28</span>    int64_t n;</div>
-<div class="line"><span class="lineno">   29</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;  <span class="comment">// 10006187</span></div>
+<div class="line"><span class="lineno">   29</span>    std::cin &gt;&gt; n;  <span class="comment">// 10006187</span></div>
 <div class="line"><span class="lineno">   30</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a>[n] == <span class="charliteral">&#39;1&#39;</span>)</div>
-<div class="line"><span class="lineno">   31</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;YES\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   31</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;YES\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   32</span>    <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">   33</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;NO\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   33</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;NO\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   34</span> </div>
 <div class="line"><span class="lineno">   35</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   36</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="aprimes__up__to__billion_8cpp_html_a031cada84819ed6426f58e4f7e81261c"><div class="ttname"><a href="#a031cada84819ed6426f58e4f7e81261c">Sieve</a></div><div class="ttdeci">void Sieve(int64_t n)</div><div class="ttdef"><b>Definition</b> primes_up_to_billion.cpp:13</div></div>
-<div class="ttc" id="aprimes__up__to__billion_8cpp_html_ac0f4b77b901ddb15dab4c4dee1ac6e95"><div class="ttname"><a href="#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a></div><div class="ttdeci">char prime[100000000]</div><div class="ttdef"><b>Definition</b> primes_up_to_billion.cpp:10</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="163" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aprimes__up__to__billion_8cpp_html_a031cada84819ed6426f58e4f7e81261c"><div class="ttname"><a href="#a031cada84819ed6426f58e4f7e81261c">Sieve</a></div><div class="ttdeci">void Sieve(int64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d9c/primes__up__to__billion_8cpp_source.html#l00013">primes_up_to_billion.cpp:13</a></div></div>
+<div class="ttc" id="aprimes__up__to__billion_8cpp_html_ac0f4b77b901ddb15dab4c4dee1ac6e95"><div class="ttname"><a href="#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a></div><div class="ttdeci">char prime[100000000]</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d9c/primes__up__to__billion_8cpp_source.html#l00010">primes_up_to_billion.cpp:10</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a031cada84819ed6426f58e4f7e81261c" name="a031cada84819ed6426f58e4f7e81261c"></a>
@@ -190,8 +206,10 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Perform Sieve algorithm </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d9c/primes__up__to__billion_8cpp_source.html#l00013">13</a> of file <a class="el" href="../../d4/d9c/primes__up__to__billion_8cpp_source.html">primes_up_to_billion.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   13</span>                      {</div>
-<div class="line"><span class="lineno">   14</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/memset.html">memset</a>(<a class="code hl_variable" href="#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a>, <span class="charliteral">&#39;1&#39;</span>, <span class="keyword">sizeof</span>(<a class="code hl_variable" href="#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a>));  <span class="comment">// intitize &#39;1&#39; to every index</span></div>
+<div class="line"><span class="lineno">   14</span>    memset(<a class="code hl_variable" href="#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a>, <span class="charliteral">&#39;1&#39;</span>, <span class="keyword">sizeof</span>(<a class="code hl_variable" href="#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a>));  <span class="comment">// intitize &#39;1&#39; to every index</span></div>
 <div class="line"><span class="lineno">   15</span>    <a class="code hl_variable" href="#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a>[0] = <span class="charliteral">&#39;0&#39;</span>;                     <span class="comment">// 0 is not prime</span></div>
 <div class="line"><span class="lineno">   16</span>    <a class="code hl_variable" href="#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a>[1] = <span class="charliteral">&#39;0&#39;</span>;                     <span class="comment">// 1 is not prime</span></div>
 <div class="line"><span class="lineno">   17</span>    <span class="keywordflow">for</span> (int64_t p = 2; p * p &lt;= n; p++) {</div>
@@ -201,7 +219,6 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   21</span>        }</div>
 <div class="line"><span class="lineno">   22</span>    }</div>
 <div class="line"><span class="lineno">   23</span>}</div>
-<div class="ttc" id="amemset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/memset.html">std::memset</a></div><div class="ttdeci">T memset(T... args)</div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -219,6 +236,8 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 <p>array to store the primes </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d9c/primes__up__to__billion_8cpp_source.html#l00010">10</a> of file <a class="el" href="../../d4/d9c/primes__up__to__billion_8cpp_source.html">primes_up_to_billion.cpp</a>.</p>
+
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 353a4f892..000000000
--- a/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c" title=" " alt="" coords="103,5,157,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 2595db84c..000000000
--- a/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-438cd0f51219c3d0e22e59d01ceed794
\ No newline at end of file
diff --git a/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 9e13c0d36..000000000
--- a/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="122pt" height="27pt"
- viewBox="0.00 0.00 121.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="113.75,-19.25 73,-19.25 73,0 113.75,0 113.75,-19.25"/>
-<text text-anchor="middle" x="93.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Sieve</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-9.62C44.41,-9.62 53.06,-9.62 61.33,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.07,-13.13 71.07,-9.63 61.07,-6.13 61.07,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 4f181d4c6..000000000
--- a/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="122pt" height="27pt"
- viewBox="0.00 0.00 121.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="113.75,-19.25 73,-19.25 73,0 113.75,0 113.75,-19.25"/>
-<text text-anchor="middle" x="93.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Sieve</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-9.62C44.41,-9.62 53.06,-9.62 61.33,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.07,-13.13 71.07,-9.63 61.07,-6.13 61.07,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d9c/primes__up__to__billion_8cpp_source.html b/d4/d9c/primes__up__to__billion_8cpp_source.html
new file mode 100644
index 000000000..b6e34bdcc
--- /dev/null
+++ b/d4/d9c/primes__up__to__billion_8cpp_source.html
@@ -0,0 +1,173 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/primes_up_to_billion.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d9c/primes__up__to__billion_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">primes_up_to_billion.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/d9c/primes__up__to__billion_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"><a class="line" href="../../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">   10</a></span><span class="keywordtype">char</span> <a class="code hl_variable" href="../../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a>[100000000];</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="foldopen" id="foldopen00013" data-start="{" data-end="}">
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"><a class="line" href="../../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c">   13</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c">Sieve</a>(int64_t n) {</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    memset(<a class="code hl_variable" href="../../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a>, <span class="charliteral">&#39;1&#39;</span>, <span class="keyword">sizeof</span>(<a class="code hl_variable" href="../../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a>));  <span class="comment">// intitize &#39;1&#39; to every index</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <a class="code hl_variable" href="../../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a>[0] = <span class="charliteral">&#39;0&#39;</span>;                     <span class="comment">// 0 is not prime</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <a class="code hl_variable" href="../../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a>[1] = <span class="charliteral">&#39;0&#39;</span>;                     <span class="comment">// 1 is not prime</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="keywordflow">for</span> (int64_t p = 2; p * p &lt;= n; p++) {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a>[p] == <span class="charliteral">&#39;1&#39;</span>) {</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>            <span class="keywordflow">for</span> (int64_t i = p * p; i &lt;= n; i += p)</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>                <a class="code hl_variable" href="../../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a>[i] = <span class="charliteral">&#39;0&#39;</span>;  <span class="comment">// set all multiples of p to false</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        }</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    }</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>}</div>
+</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="foldopen" id="foldopen00026" data-start="{" data-end="}">
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"><a class="line" href="../../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   26</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <a class="code hl_function" href="../../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c">Sieve</a>(100000000);</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    int64_t n;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    std::cin &gt;&gt; n;  <span class="comment">// 10006187</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a>[n] == <span class="charliteral">&#39;1&#39;</span>)</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;YES\n&quot;</span>;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;NO\n&quot;</span>;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>}</div>
+</div>
+<div class="ttc" id="aprimes__up__to__billion_8cpp_html_a031cada84819ed6426f58e4f7e81261c"><div class="ttname"><a href="../../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c">Sieve</a></div><div class="ttdeci">void Sieve(int64_t n)</div><div class="ttdef"><b>Definition</b> <a href="#l00013">primes_up_to_billion.cpp:13</a></div></div>
+<div class="ttc" id="aprimes__up__to__billion_8cpp_html_ac0f4b77b901ddb15dab4c4dee1ac6e95"><div class="ttname"><a href="../../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a></div><div class="ttdeci">char prime[100000000]</div><div class="ttdef"><b>Definition</b> <a href="#l00010">primes_up_to_billion.cpp:10</a></div></div>
+<div class="ttc" id="aprimes__up__to__billion_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00026">primes_up_to_billion.cpp:26</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d4/d9c/primes__up__to__billion_8cpp.html">primes_up_to_billion.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp.html b/d4/d9d/sum__of__binomial__coefficient_8cpp.html
index 3fc64218f..02cfa3489 100644
--- a/d4/d9d/sum__of__binomial__coefficient_8cpp.html
+++ b/d4/d9d/sum__of__binomial__coefficient_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/sum_of_binomial_coefficient.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/sum_of_binomial_coefficient.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for sum_of_binomial_coefficient.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d59/sum__of__binomial__coefficient_8cpp__incl.svg" width="255" height="126"><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">
+</div>
+<p><a href="../../d4/d9d/sum__of__binomial__coefficient_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -142,6 +161,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Algorithm to find sum of binomial coefficients of a given positive integer. </p>
 <p>Given a positive integer n, the task is to find the sum of binomial coefficient i.e nC0 + nC1 + nC2 + ... + nCn-1 + nCn By induction, we can prove that the sum is equal to 2^n </p><dl class="section see"><dt>See also</dt><dd>more on <a href="https://en.wikipedia.org/wiki/Binomial_coefficient#Sums_of_the_binomial_coefficients">https://en.wikipedia.org/wiki/Binomial_coefficient#Sums_of_the_binomial_coefficients</a> </dd></dl>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/muskan0719" target="_blank">muskan0719</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d9d/sum__of__binomial__coefficient_8cpp_source.html">sum_of_binomial_coefficient.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -160,17 +181,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d9d/sum__of__binomial__coefficient_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../d4/d9d/sum__of__binomial__coefficient_8cpp_source.html">sum_of_binomial_coefficient.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   64</span>           {</div>
 <div class="line"><span class="lineno">   65</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the tests</span></div>
 <div class="line"><span class="lineno">   66</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   67</span>}</div>
-<div class="ttc" id="asum__of__binomial__coefficient_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> sum_of_binomial_coefficient.cpp:38</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="366" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asum__of__binomial__coefficient_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d9d/sum__of__binomial__coefficient_8cpp_source.html#l00038">sum_of_binomial_coefficient.cpp:38</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -196,36 +214,31 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Function for testing binomialCoeffSum function. test cases and assert statement. </p><dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d9d/sum__of__binomial__coefficient_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../d4/d9d/sum__of__binomial__coefficient_8cpp_source.html">sum_of_binomial_coefficient.cpp</a>.</p>
 <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> test_case_1 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(2);</div>
 <div class="line"><span class="lineno">   40</span>    assert(test_case_1 == 4);</div>
-<div class="line"><span class="lineno">   41</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test_case_1 Passed!&quot;</span> &lt;&lt; <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">   41</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test_case_1 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   42</span> </div>
 <div class="line"><span class="lineno">   43</span>    <span class="keywordtype">int</span> test_case_2 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(3);</div>
 <div class="line"><span class="lineno">   44</span>    assert(test_case_2 == 8);</div>
-<div class="line"><span class="lineno">   45</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test_case_2 Passed!&quot;</span> &lt;&lt; <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">   45</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test_case_2 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   46</span> </div>
 <div class="line"><span class="lineno">   47</span>    <span class="keywordtype">int</span> test_case_3 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(4);</div>
 <div class="line"><span class="lineno">   48</span>    assert(test_case_3 == 16);</div>
-<div class="line"><span class="lineno">   49</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test_case_3 Passed!&quot;</span> &lt;&lt; <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">   49</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test_case_3 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   50</span> </div>
 <div class="line"><span class="lineno">   51</span>    <span class="keywordtype">int</span> test_case_4 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(5);</div>
 <div class="line"><span class="lineno">   52</span>    assert(test_case_4 == 32);</div>
-<div class="line"><span class="lineno">   53</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test_case_4 Passed!&quot;</span> &lt;&lt; <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">   53</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test_case_4 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   54</span> </div>
 <div class="line"><span class="lineno">   55</span>    <span class="keywordtype">int</span> test_case_5 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(7);</div>
 <div class="line"><span class="lineno">   56</span>    assert(test_case_5 == 128);</div>
-<div class="line"><span class="lineno">   57</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test_case_5 Passed!&quot;</span> &lt;&lt; <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">   57</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test_case_5 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   58</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="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="anamespacemath_html_ae1ca505751f5a6d3977b86372cfe75ea"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a></div><div class="ttdeci">uint64_t binomialCoeffSum(uint64_t n)</div><div class="ttdef"><b>Definition</b> sum_of_binomial_coefficient.cpp:27</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="268" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemath_html_ae1ca505751f5a6d3977b86372cfe75ea"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a></div><div class="ttdeci">uint64_t binomialCoeffSum(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d9d/sum__of__binomial__coefficient_8cpp_source.html#l00027">sum_of_binomial_coefficient.cpp:27</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 120dc7f42..000000000
--- a/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,49,56"/>
-<area shape="rect" id="Node000002" href="$dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea" title=" " alt="" coords="97,5,262,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,37,83,32,84,37,50,43"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="144,55,215,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="50,44,129,57,128,62,49,49"/>
-</map>
diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 53f5b9701..000000000
--- a/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a43b995a69269dcfb655143cc2c79f12
\ No newline at end of file
diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 74670a1b6..000000000
--- a/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="201pt" height="64pt"
- viewBox="0.00 0.00 200.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="192.5,-56.25 68.5,-56.25 68.5,-37 192.5,-37 192.5,-56.25"/>
-<text text-anchor="middle" x="130.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::binomialCoeffSum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-30.27C39.99,-31.47 49,-33 58.62,-34.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.76,-38.03 68.2,-36.25 58.93,-31.13 57.76,-38.03"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="157.25,-19.25 103.75,-19.25 103.75,0 157.25,0 157.25,-19.25"/>
-<text text-anchor="middle" x="130.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-25.12C48.24,-22.66 72.31,-18.8 92.58,-15.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.86,-19.04 102.18,-14.01 91.75,-12.13 92.86,-19.04"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index aab6f6541..000000000
--- a/d4/d9d/sum__of__binomial__coefficient_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="201pt" height="64pt"
- viewBox="0.00 0.00 200.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="192.5,-56.25 68.5,-56.25 68.5,-37 192.5,-37 192.5,-56.25"/>
-<text text-anchor="middle" x="130.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::binomialCoeffSum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-30.27C39.99,-31.47 49,-33 58.62,-34.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.76,-38.03 68.2,-36.25 58.93,-31.13 57.76,-38.03"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="157.25,-19.25 103.75,-19.25 103.75,0 157.25,0 157.25,-19.25"/>
-<text text-anchor="middle" x="130.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-25.12C48.24,-22.66 72.31,-18.8 92.58,-15.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.86,-19.04 102.18,-14.01 91.75,-12.13 92.86,-19.04"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index d63da9e49..000000000
--- a/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title=" " alt="" coords="103,31,146,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,41,87,41,87,46,55,46"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea" title=" " alt="" coords="194,5,359,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,37,180,32,181,37,147,43"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="241,55,312,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="147,44,227,57,226,62,146,49"/>
-</map>
diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index c53717955..000000000
--- a/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-10482d3934ce2e583ee122670522d868
\ No newline at end of file
diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index a955f6c13..000000000
--- a/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="274pt" height="64pt"
- viewBox="0.00 0.00 273.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="265.5,-56.25 141.5,-56.25 141.5,-37 265.5,-37 265.5,-56.25"/>
-<text text-anchor="middle" x="203.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::binomialCoeffSum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-30.27C112.99,-31.47 122,-33 131.62,-34.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.76,-38.03 141.2,-36.25 131.93,-31.13 130.76,-38.03"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="230.25,-19.25 176.75,-19.25 176.75,0 230.25,0 230.25,-19.25"/>
-<text text-anchor="middle" x="203.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-25.12C121.24,-22.66 145.31,-18.8 165.58,-15.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.86,-19.04 175.18,-14.01 164.75,-12.13 165.86,-19.04"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index fd29283e6..000000000
--- a/d4/d9d/sum__of__binomial__coefficient_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="274pt" height="64pt"
- viewBox="0.00 0.00 273.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="265.5,-56.25 141.5,-56.25 141.5,-37 265.5,-37 265.5,-56.25"/>
-<text text-anchor="middle" x="203.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::binomialCoeffSum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-30.27C112.99,-31.47 122,-33 131.62,-34.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.76,-38.03 141.2,-36.25 131.93,-31.13 130.76,-38.03"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="230.25,-19.25 176.75,-19.25 176.75,0 230.25,0 230.25,-19.25"/>
-<text text-anchor="middle" x="203.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-25.12C121.24,-22.66 145.31,-18.8 165.58,-15.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.86,-19.04 175.18,-14.01 164.75,-12.13 165.86,-19.04"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d9d/sum__of__binomial__coefficient_8cpp_source.html b/d4/d9d/sum__of__binomial__coefficient_8cpp_source.html
new file mode 100644
index 000000000..4b51f852a
--- /dev/null
+++ b/d4/d9d/sum__of__binomial__coefficient_8cpp_source.html
@@ -0,0 +1,186 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/sum_of_binomial_coefficient.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d9d/sum__of__binomial__coefficient_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">sum_of_binomial_coefficient.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/d9d/sum__of__binomial__coefficient_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="foldopen" id="foldopen00027" data-start="{" data-end="}">
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">   27</a></span>uint64_t <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">binomialCoeffSum</a>(uint64_t n) {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="comment">// Calculating 2^n</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordflow">return</span> (1 &lt;&lt; n);</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>}</div>
+</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="foldopen" id="foldopen00038" data-start="{" data-end="}">
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="../../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   38</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordtype">int</span> test_case_1 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(2);</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    assert(test_case_1 == 4);</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test_case_1 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordtype">int</span> test_case_2 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(3);</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    assert(test_case_2 == 8);</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test_case_2 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordtype">int</span> test_case_3 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(4);</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    assert(test_case_3 == 16);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test_case_3 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordtype">int</span> test_case_4 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(5);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    assert(test_case_4 == 32);</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test_case_4 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordtype">int</span> test_case_5 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(7);</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    assert(test_case_5 == 128);</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test_case_5 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}</div>
+</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="foldopen" id="foldopen00064" data-start="{" data-end="}">
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   64</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <a class="code hl_function" href="../../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the tests</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>}</div>
+</div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_ae1ca505751f5a6d3977b86372cfe75ea"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a></div><div class="ttdeci">uint64_t binomialCoeffSum(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="#l00027">sum_of_binomial_coefficient.cpp:27</a></div></div>
+<div class="ttc" id="asum__of__binomial__coefficient_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00038">sum_of_binomial_coefficient.cpp:38</a></div></div>
+<div class="ttc" id="asum__of__binomial__coefficient_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00064">sum_of_binomial_coefficient.cpp:64</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d4/d9d/sum__of__binomial__coefficient_8cpp.html">sum_of_binomial_coefficient.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/d9f/selection__sort__recursive_8cpp.html b/d4/d9f/selection__sort__recursive_8cpp.html
index 078e0f832..321aa96f1 100644
--- a/d4/d9f/selection__sort__recursive_8cpp.html
+++ b/d4/d9f/selection__sort__recursive_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/selection_sort_recursive.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/selection_sort_recursive.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for selection_sort_recursive.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d44/selection__sort__recursive_8cpp__incl.svg" width="434" height="126"><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">
+</div>
+<p><a href="../../d4/d9f/selection__sort__recursive_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -136,11 +155,11 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a5454eeb691725ccac0f59df1e133f834" id="r_a5454eeb691725ccac0f59df1e133f834"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a5454eeb691725ccac0f59df1e133f834"><td class="memTemplItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5454eeb691725ccac0f59df1e133f834">sorting::selection_sort_recursive::findMinIndex</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;in_arr, uint64_t current_position=0)</td></tr>
+<tr class="memitem:a5454eeb691725ccac0f59df1e133f834"><td class="memTemplItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5454eeb691725ccac0f59df1e133f834">sorting::selection_sort_recursive::findMinIndex</a> (const std::vector&lt; T &gt; &amp;in_arr, uint64_t current_position=0)</td></tr>
 <tr class="memdesc:a5454eeb691725ccac0f59df1e133f834"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function finds the index of the minimum element.  <br /></td></tr>
 <tr class="separator:a5454eeb691725ccac0f59df1e133f834"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ab6f7b33a070e376e1f4374e534435e89" id="r_ab6f7b33a070e376e1f4374e534435e89"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ab6f7b33a070e376e1f4374e534435e89"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ab6f7b33a070e376e1f4374e534435e89">sorting::selection_sort_recursive::selectionSortRecursive</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;in_arr, uint64_t current_position=0)</td></tr>
+<tr class="memitem:ab6f7b33a070e376e1f4374e534435e89"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ab6f7b33a070e376e1f4374e534435e89">sorting::selection_sort_recursive::selectionSortRecursive</a> (std::vector&lt; T &gt; &amp;in_arr, uint64_t current_position=0)</td></tr>
 <tr class="memdesc:ab6f7b33a070e376e1f4374e534435e89"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function implements Selection sort.  <br /></td></tr>
 <tr class="separator:ab6f7b33a070e376e1f4374e534435e89"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -157,6 +176,8 @@ Functions</h2></td></tr>
 Implementation</h3>
 <p>FindMinIndex This function finds the minimum element of the array(list) recursively by simply comparing the minimum element of array reduced size by 1 and compares it to the last element of the array to find the minimum of the whole array.</p>
 <p>SelectionSortRecursive Just like selection sort, it divides the list into two parts (i.e.: sorted and unsorted) and finds the minimum of the unsorted array. By calling the <code>FindMinIndex</code> function, it swaps the minimum element with the first element of the list, and then solves recursively for the remaining unsorted list. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Tushar-K24" target="_blank">Tushar Khanduri</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/d9f/selection__sort__recursive_8cpp_source.html">selection_sort_recursive.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a5454eeb691725ccac0f59df1e133f834" name="a5454eeb691725ccac0f59df1e133f834"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a5454eeb691725ccac0f59df1e133f834">&#9670;&#160;</a></span>findMinIndex()</h2>
@@ -169,7 +190,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">uint64_t sorting::selection_sort_recursive::findMinIndex </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>in_arr</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>in_arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -194,8 +215,10 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>index of the minimum element </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d9f/selection__sort__recursive_8cpp_source.html#l00056">56</a> of file <a class="el" href="../../d4/d9f/selection__sort__recursive_8cpp_source.html">selection_sort_recursive.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   57</span>                                                     {</div>
-<div class="line"><span class="lineno">   58</span>    <span class="keywordflow">if</span> (current_position + 1 == in_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">   58</span>    <span class="keywordflow">if</span> (current_position + 1 == in_arr.size()) {</div>
 <div class="line"><span class="lineno">   59</span>        <span class="keywordflow">return</span> current_position;</div>
 <div class="line"><span class="lineno">   60</span>    }</div>
 <div class="line"><span class="lineno">   61</span>    uint64_t answer = <a class="code hl_function" href="#a5454eeb691725ccac0f59df1e133f834">findMinIndex</a>(in_arr, current_position + 1);</div>
@@ -204,14 +227,8 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   64</span>    }</div>
 <div class="line"><span class="lineno">   65</span>    <span class="keywordflow">return</span> answer;</div>
 <div class="line"><span class="lineno">   66</span>}</div>
-<div class="ttc" id="aselection__sort__recursive_8cpp_html_a5454eeb691725ccac0f59df1e133f834"><div class="ttname"><a href="#a5454eeb691725ccac0f59df1e133f834">sorting::selection_sort_recursive::findMinIndex</a></div><div class="ttdeci">uint64_t findMinIndex(const std::vector&lt; T &gt; &amp;in_arr, uint64_t current_position=0)</div><div class="ttdoc">The main function finds the index of the minimum element.</div><div class="ttdef"><b>Definition</b> selection_sort_recursive.cpp:56</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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d9f/selection__sort__recursive_8cpp_a5454eeb691725ccac0f59df1e133f834_cgraph.svg" width="367" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aselection__sort__recursive_8cpp_html_a5454eeb691725ccac0f59df1e133f834"><div class="ttname"><a href="#a5454eeb691725ccac0f59df1e133f834">sorting::selection_sort_recursive::findMinIndex</a></div><div class="ttdeci">uint64_t findMinIndex(const std::vector&lt; T &gt; &amp;in_arr, uint64_t current_position=0)</div><div class="ttdoc">The main function finds the index of the minimum element.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d9f/selection__sort__recursive_8cpp_source.html#l00056">selection_sort_recursive.cpp:56</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -231,17 +248,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d9f/selection__sort__recursive_8cpp_source.html#l00130">130</a> of file <a class="el" href="../../d4/d9f/selection__sort__recursive_8cpp_source.html">selection_sort_recursive.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  130</span>           {</div>
 <div class="line"><span class="lineno">  131</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  132</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  133</span>}</div>
-<div class="ttc" id="aselection__sort__recursive_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> selection_sort_recursive.cpp:95</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d9f/selection__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="300" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aselection__sort__recursive_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d9f/selection__sort__recursive_8cpp_source.html#l00095">selection_sort_recursive.cpp:95</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ab6f7b33a070e376e1f4374e534435e89" name="ab6f7b33a070e376e1f4374e534435e89"></a>
@@ -255,7 +269,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void sorting::selection_sort_recursive::selectionSortRecursive </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>in_arr</em></span>, </td>
+          <td class="paramtype">std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>in_arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -280,25 +294,21 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d9f/selection__sort__recursive_8cpp_source.html#l00076">76</a> of file <a class="el" href="../../d4/d9f/selection__sort__recursive_8cpp_source.html">selection_sort_recursive.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   77</span>                                                           {</div>
-<div class="line"><span class="lineno">   78</span>    <span class="keywordflow">if</span> (current_position == in_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">   78</span>    <span class="keywordflow">if</span> (current_position == in_arr.size()) {</div>
 <div class="line"><span class="lineno">   79</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">   80</span>    }</div>
 <div class="line"><span class="lineno">   81</span>    uint64_t min_element_idx =</div>
 <div class="line"><span class="lineno">   82</span>        selection_sort_recursive::findMinIndex(in_arr, current_position);</div>
 <div class="line"><span class="lineno">   83</span>    <span class="keywordflow">if</span> (min_element_idx != current_position) {</div>
-<div class="line"><span class="lineno">   84</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(in_arr[min_element_idx], in_arr[current_position]);</div>
+<div class="line"><span class="lineno">   84</span>        std::swap(in_arr[min_element_idx], in_arr[current_position]);</div>
 <div class="line"><span class="lineno">   85</span>    }</div>
 <div class="line"><span class="lineno">   86</span>    <a class="code hl_function" href="#ab6f7b33a070e376e1f4374e534435e89">selectionSortRecursive</a>(in_arr, current_position + 1);</div>
 <div class="line"><span class="lineno">   87</span>}</div>
-<div class="ttc" id="aselection__sort__recursive_8cpp_html_ab6f7b33a070e376e1f4374e534435e89"><div class="ttname"><a href="#ab6f7b33a070e376e1f4374e534435e89">sorting::selection_sort_recursive::selectionSortRecursive</a></div><div class="ttdeci">void selectionSortRecursive(std::vector&lt; T &gt; &amp;in_arr, uint64_t current_position=0)</div><div class="ttdoc">The main function implements Selection sort.</div><div class="ttdef"><b>Definition</b> selection_sort_recursive.cpp:76</div></div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d9f/selection__sort__recursive_8cpp_ab6f7b33a070e376e1f4374e534435e89_cgraph.svg" width="344" height="100"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aselection__sort__recursive_8cpp_html_ab6f7b33a070e376e1f4374e534435e89"><div class="ttname"><a href="#ab6f7b33a070e376e1f4374e534435e89">sorting::selection_sort_recursive::selectionSortRecursive</a></div><div class="ttdeci">void selectionSortRecursive(std::vector&lt; T &gt; &amp;in_arr, uint64_t current_position=0)</div><div class="ttdoc">The main function implements Selection sort.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d9f/selection__sort__recursive_8cpp_source.html#l00076">selection_sort_recursive.cpp:76</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -326,48 +336,39 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d9f/selection__sort__recursive_8cpp_source.html#l00095">95</a> of file <a class="el" href="../../d4/d9f/selection__sort__recursive_8cpp_source.html">selection_sort_recursive.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   95</span>                   {</div>
 <div class="line"><span class="lineno">   96</span>    <span class="comment">// 1st test</span></div>
 <div class="line"><span class="lineno">   97</span>    <span class="comment">// [1, 0, 2, 1] return [0, 1, 1, 2]</span></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&lt;uint64_t&gt;</a> array1 = {0, 1, 1, 2};</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> &lt;&lt; <span class="stringliteral">&quot;1st test... &quot;</span>;</div>
+<div class="line"><span class="lineno">   98</span>    std::vector&lt;uint64_t&gt; array1 = {0, 1, 1, 2};</div>
+<div class="line"><span class="lineno">   99</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test... &quot;</span>;</div>
 <div class="line"><span class="lineno">  100</span>    <a class="code hl_function" href="#ab6f7b33a070e376e1f4374e534435e89">sorting::selection_sort_recursive::selectionSortRecursive</a>(array1);</div>
-<div class="line"><span class="lineno">  101</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(array1), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(array1)));</div>
-<div class="line"><span class="lineno">  102</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  101</span>    assert(std::is_sorted(std::begin(array1), std::end(array1)));</div>
+<div class="line"><span class="lineno">  102</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  103</span>    <span class="comment">// 2nd test</span></div>
 <div class="line"><span class="lineno">  104</span>    <span class="comment">// [1, 0, 0, 1, 1, 0, 2, 1] return [0, 0, 0, 1, 1, 1, 1, 2]</span></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&lt;uint64_t&gt;</a> array2 = {1, 0, 0, 1, 1, 0, 2, 1};</div>
-<div class="line"><span class="lineno">  106</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2nd test... &quot;</span>;</div>
+<div class="line"><span class="lineno">  105</span>    std::vector&lt;uint64_t&gt; array2 = {1, 0, 0, 1, 1, 0, 2, 1};</div>
+<div class="line"><span class="lineno">  106</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test... &quot;</span>;</div>
 <div class="line"><span class="lineno">  107</span>    <a class="code hl_function" href="#ab6f7b33a070e376e1f4374e534435e89">sorting::selection_sort_recursive::selectionSortRecursive</a>(array2);</div>
-<div class="line"><span class="lineno">  108</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(array2), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(array2)));</div>
-<div class="line"><span class="lineno">  109</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  108</span>    assert(std::is_sorted(std::begin(array2), std::end(array2)));</div>
+<div class="line"><span class="lineno">  109</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  110</span>    <span class="comment">// 3rd test</span></div>
 <div class="line"><span class="lineno">  111</span>    <span class="comment">// [1, 1, 0, 0, 1, 2, 2, 0, 2, 1] return [0, 0, 0, 1, 1, 1, 1, 2, 2, 2]</span></div>
-<div class="line"><span class="lineno">  112</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> array3 = {1, 1, 0, 0, 1, 2, 2, 0, 2, 1};</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> &lt;&lt; <span class="stringliteral">&quot;3rd test... &quot;</span>;</div>
+<div class="line"><span class="lineno">  112</span>    std::vector&lt;uint64_t&gt; array3 = {1, 1, 0, 0, 1, 2, 2, 0, 2, 1};</div>
+<div class="line"><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test... &quot;</span>;</div>
 <div class="line"><span class="lineno">  114</span>    <a class="code hl_function" href="#ab6f7b33a070e376e1f4374e534435e89">sorting::selection_sort_recursive::selectionSortRecursive</a>(array3);</div>
-<div class="line"><span class="lineno">  115</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(array3), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(array3)));</div>
-<div class="line"><span class="lineno">  116</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  115</span>    assert(std::is_sorted(std::begin(array3), std::end(array3)));</div>
+<div class="line"><span class="lineno">  116</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  117</span>    <span class="comment">// 4th test</span></div>
 <div class="line"><span class="lineno">  118</span>    <span class="comment">// [2, 2, 2, 0, 0, 1, 1] return [0, 0, 1, 1, 2, 2, 2]</span></div>
-<div class="line"><span class="lineno">  119</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> array4 = {2, 2, 2, 0, 0, 1, 1};</div>
-<div class="line"><span class="lineno">  120</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;4th test... &quot;</span>;</div>
+<div class="line"><span class="lineno">  119</span>    std::vector&lt;uint64_t&gt; array4 = {2, 2, 2, 0, 0, 1, 1};</div>
+<div class="line"><span class="lineno">  120</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;4th test... &quot;</span>;</div>
 <div class="line"><span class="lineno">  121</span>    <a class="code hl_function" href="#ab6f7b33a070e376e1f4374e534435e89">sorting::selection_sort_recursive::selectionSortRecursive</a>(array4);</div>
-<div class="line"><span class="lineno">  122</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(array4), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(array4)));</div>
-<div class="line"><span class="lineno">  123</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  122</span>    assert(std::is_sorted(std::begin(array4), std::end(array4)));</div>
+<div class="line"><span class="lineno">  123</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  124</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="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</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="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d9f/selection__sort__recursive_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="203" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/d9f/selection__sort__recursive_8cpp_a5454eeb691725ccac0f59df1e133f834_cgraph.map b/d4/d9f/selection__sort__recursive_8cpp_a5454eeb691725ccac0f59df1e133f834_cgraph.map
deleted file mode 100644
index 333e28b62..000000000
--- a/d4/d9f/selection__sort__recursive_8cpp_a5454eeb691725ccac0f59df1e133f834_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="sorting::selection_sort_recursive::findMinIndex" name="sorting::selection_sort_recursive::findMinIndex">
-<area shape="rect" id="Node000001" title="The main function finds the index of the minimum element." alt="" coords="5,29,198,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="63,29,61,19,68,10,81,5,102,3,123,5,137,11,134,16,122,10,101,8,82,10,71,15,66,20,68,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="246,37,361,62"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="198,47,230,47,230,52,198,52"/>
-</map>
diff --git a/d4/d9f/selection__sort__recursive_8cpp_a5454eeb691725ccac0f59df1e133f834_cgraph.md5 b/d4/d9f/selection__sort__recursive_8cpp_a5454eeb691725ccac0f59df1e133f834_cgraph.md5
deleted file mode 100644
index 7057d2fce..000000000
--- a/d4/d9f/selection__sort__recursive_8cpp_a5454eeb691725ccac0f59df1e133f834_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-44c03285eda1fd17cabd68f0a8d5a823
\ No newline at end of file
diff --git a/d4/d9f/selection__sort__recursive_8cpp_a5454eeb691725ccac0f59df1e133f834_cgraph.svg b/d4/d9f/selection__sort__recursive_8cpp_a5454eeb691725ccac0f59df1e133f834_cgraph.svg
deleted file mode 100644
index b310df0c2..000000000
--- a/d4/d9f/selection__sort__recursive_8cpp_a5454eeb691725ccac0f59df1e133f834_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::selection_sort_recursive::findMinIndex Pages: 1 -->
-<svg width="275pt" height="57pt"
- viewBox="0.00 0.00 274.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>sorting::selection_sort_recursive::findMinIndex</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function finds the index of the minimum element.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-30.5 0,-30.5 0,0 144.25,0 144.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::selection</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sort_recursive::findMinIndex</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.3,-30.99C39.83,-40.06 48.77,-48.5 72.12,-48.5 84.9,-48.5 93.36,-45.97 97.51,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.96,-42.85 98.76,-32.49 94.01,-41.96 100.96,-42.85"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.75,-24.88 180.25,-24.88 180.25,-5.63 266.75,-5.63 266.75,-24.88"/>
-<text text-anchor="middle" x="223.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.75,-15.25C152.71,-15.25 160.71,-15.25 168.39,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.26,-18.75 178.26,-15.25 168.26,-11.75 168.26,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d9f/selection__sort__recursive_8cpp_a5454eeb691725ccac0f59df1e133f834_cgraph_org.svg b/d4/d9f/selection__sort__recursive_8cpp_a5454eeb691725ccac0f59df1e133f834_cgraph_org.svg
deleted file mode 100644
index 9426b91a1..000000000
--- a/d4/d9f/selection__sort__recursive_8cpp_a5454eeb691725ccac0f59df1e133f834_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::selection_sort_recursive::findMinIndex Pages: 1 -->
-<svg width="275pt" height="57pt"
- viewBox="0.00 0.00 274.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>sorting::selection_sort_recursive::findMinIndex</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function finds the index of the minimum element.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-30.5 0,-30.5 0,0 144.25,0 144.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::selection</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sort_recursive::findMinIndex</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.3,-30.99C39.83,-40.06 48.77,-48.5 72.12,-48.5 84.9,-48.5 93.36,-45.97 97.51,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.96,-42.85 98.76,-32.49 94.01,-41.96 100.96,-42.85"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.75,-24.88 180.25,-24.88 180.25,-5.63 266.75,-5.63 266.75,-24.88"/>
-<text text-anchor="middle" x="223.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.75,-15.25C152.71,-15.25 160.71,-15.25 168.39,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.26,-18.75 178.26,-15.25 168.26,-11.75 168.26,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d9f/selection__sort__recursive_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d4/d9f/selection__sort__recursive_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 61bfe74f5..000000000
--- a/d4/d9f/selection__sort__recursive_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,80,49,106"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="108,5,186,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="43,77,95,40,101,36,104,41,98,44,46,82"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="113,55,181,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="49,86,97,75,98,81,50,91"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="111,104,182,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="50,95,97,104,96,109,49,100"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="97,153,197,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="47,104,98,140,104,143,101,148,95,144,44,108"/>
-</map>
diff --git a/d4/d9f/selection__sort__recursive_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d4/d9f/selection__sort__recursive_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index fd351d130..000000000
--- a/d4/d9f/selection__sort__recursive_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-522e993d38257705e4c580d9bd207756
\ No newline at end of file
diff --git a/d4/d9f/selection__sort__recursive_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d4/d9f/selection__sort__recursive_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 7eb6dd32d..000000000
--- a/d4/d9f/selection__sort__recursive_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="152pt" height="138pt"
- viewBox="0.00 0.00 151.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-74.25 0,-74.25 0,-55 32.5,-55 32.5,-74.25"/>
-<text text-anchor="middle" x="16.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.5,-130.25 76.75,-130.25 76.75,-111 135.5,-111 135.5,-130.25"/>
-<text text-anchor="middle" x="106.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.44,-74.65C39.56,-82.73 54.5,-94.09 68.5,-102.62 69.94,-103.5 71.42,-104.37 72.93,-105.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.27,-108.3 81.75,-109.89 74.55,-102.12 71.27,-108.3"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="131.75,-93.25 80.5,-93.25 80.5,-74 131.75,-74 131.75,-93.25"/>
-<text text-anchor="middle" x="106.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-68.02C43.01,-70.2 56.49,-73.11 69.07,-75.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.26,-79.23 78.77,-77.93 69.74,-72.39 68.26,-79.23"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.88,-56.25 79.38,-56.25 79.38,-37 132.88,-37 132.88,-56.25"/>
-<text text-anchor="middle" x="106.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-61.41C42.79,-59.39 55.88,-56.71 68.22,-54.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.64,-57.67 77.73,-52.24 67.23,-50.81 68.64,-57.67"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.75,-19.25 68.5,-19.25 68.5,0 143.75,0 143.75,-19.25"/>
-<text text-anchor="middle" x="106.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.9,-54.57C40.03,-46.75 54.77,-35.88 68.5,-27.62 69.94,-26.76 71.43,-25.9 72.95,-25.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.56,-28.16 81.77,-20.4 71.29,-21.96 74.56,-28.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d9f/selection__sort__recursive_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d4/d9f/selection__sort__recursive_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1105d6fc6..000000000
--- a/d4/d9f/selection__sort__recursive_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="152pt" height="138pt"
- viewBox="0.00 0.00 151.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-74.25 0,-74.25 0,-55 32.5,-55 32.5,-74.25"/>
-<text text-anchor="middle" x="16.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.5,-130.25 76.75,-130.25 76.75,-111 135.5,-111 135.5,-130.25"/>
-<text text-anchor="middle" x="106.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.44,-74.65C39.56,-82.73 54.5,-94.09 68.5,-102.62 69.94,-103.5 71.42,-104.37 72.93,-105.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.27,-108.3 81.75,-109.89 74.55,-102.12 71.27,-108.3"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="131.75,-93.25 80.5,-93.25 80.5,-74 131.75,-74 131.75,-93.25"/>
-<text text-anchor="middle" x="106.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-68.02C43.01,-70.2 56.49,-73.11 69.07,-75.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.26,-79.23 78.77,-77.93 69.74,-72.39 68.26,-79.23"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.88,-56.25 79.38,-56.25 79.38,-37 132.88,-37 132.88,-56.25"/>
-<text text-anchor="middle" x="106.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-61.41C42.79,-59.39 55.88,-56.71 68.22,-54.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.64,-57.67 77.73,-52.24 67.23,-50.81 68.64,-57.67"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.75,-19.25 68.5,-19.25 68.5,0 143.75,0 143.75,-19.25"/>
-<text text-anchor="middle" x="106.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.9,-54.57C40.03,-46.75 54.77,-35.88 68.5,-27.62 69.94,-26.76 71.43,-25.9 72.95,-25.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.56,-28.16 81.77,-20.4 71.29,-21.96 74.56,-28.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d9f/selection__sort__recursive_8cpp_ab6f7b33a070e376e1f4374e534435e89_cgraph.map b/d4/d9f/selection__sort__recursive_8cpp_ab6f7b33a070e376e1f4374e534435e89_cgraph.map
deleted file mode 100644
index 1c9aa02ca..000000000
--- a/d4/d9f/selection__sort__recursive_8cpp_ab6f7b33a070e376e1f4374e534435e89_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="sorting::selection_sort_recursive::selectionSortRecursive" name="sorting::selection_sort_recursive::selectionSortRecursive">
-<area shape="rect" id="Node000001" title="The main function implements Selection sort." alt="" coords="5,29,176,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="53,29,53,19,60,10,73,5,91,3,111,5,123,12,121,17,109,10,90,8,74,10,63,14,58,21,58,29"/>
-<area shape="rect" id="Node000002" 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,19,339,45"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="176,43,208,39,209,44,176,48"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="242,68,320,94"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="176,65,227,72,226,77,176,71"/>
-</map>
diff --git a/d4/d9f/selection__sort__recursive_8cpp_ab6f7b33a070e376e1f4374e534435e89_cgraph.md5 b/d4/d9f/selection__sort__recursive_8cpp_ab6f7b33a070e376e1f4374e534435e89_cgraph.md5
deleted file mode 100644
index 7df41166f..000000000
--- a/d4/d9f/selection__sort__recursive_8cpp_ab6f7b33a070e376e1f4374e534435e89_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-53efe72f2aa79118dc40c26d008403a7
\ No newline at end of file
diff --git a/d4/d9f/selection__sort__recursive_8cpp_ab6f7b33a070e376e1f4374e534435e89_cgraph.svg b/d4/d9f/selection__sort__recursive_8cpp_ab6f7b33a070e376e1f4374e534435e89_cgraph.svg
deleted file mode 100644
index 78720958e..000000000
--- a/d4/d9f/selection__sort__recursive_8cpp_ab6f7b33a070e376e1f4374e534435e89_cgraph.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::selection_sort_recursive::selectionSortRecursive Pages: 1 -->
-<svg width="258pt" height="75pt"
- viewBox="0.00 0.00 258.25 74.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 70.5)">
-<title>sorting::selection_sort_recursive::selectionSortRecursive</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function implements Selection sort.">
-<polygon fill="#999999" stroke="#666666" points="127.75,-48.5 0,-48.5 0,-6.75 127.75,-6.75 127.75,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::selection</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sort_recursive::selection</text>
-<text text-anchor="middle" x="63.88" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">SortRecursive</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.46,-48.82C34.94,-58.3 43.75,-66.5 63.88,-66.5 75.51,-66.5 83.36,-63.76 87.43,-59.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.73,-60.84 89.9,-50.28 83.96,-59.05 90.73,-60.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="250.25,-56.25 163.75,-56.25 163.75,-37 250.25,-37 250.25,-56.25"/>
-<text text-anchor="middle" x="207" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.01,-36.12C136.09,-37.21 144.31,-38.32 152.23,-39.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.69,-42.84 162.07,-40.71 152.62,-35.91 151.69,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.38,-19.25 177.62,-19.25 177.62,0 236.38,0 236.38,-19.25"/>
-<text text-anchor="middle" x="207" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.01,-19.57C140.89,-17.93 154.1,-16.24 165.91,-14.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.2,-18.23 175.68,-13.49 165.31,-11.29 166.2,-18.23"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d9f/selection__sort__recursive_8cpp_ab6f7b33a070e376e1f4374e534435e89_cgraph_org.svg b/d4/d9f/selection__sort__recursive_8cpp_ab6f7b33a070e376e1f4374e534435e89_cgraph_org.svg
deleted file mode 100644
index c8ae51f25..000000000
--- a/d4/d9f/selection__sort__recursive_8cpp_ab6f7b33a070e376e1f4374e534435e89_cgraph_org.svg
+++ /dev/null
@@ -1,68 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::selection_sort_recursive::selectionSortRecursive Pages: 1 -->
-<svg width="258pt" height="75pt"
- viewBox="0.00 0.00 258.25 74.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 70.5)">
-<title>sorting::selection_sort_recursive::selectionSortRecursive</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function implements Selection sort.">
-<polygon fill="#999999" stroke="#666666" points="127.75,-48.5 0,-48.5 0,-6.75 127.75,-6.75 127.75,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::selection</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sort_recursive::selection</text>
-<text text-anchor="middle" x="63.88" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">SortRecursive</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.46,-48.82C34.94,-58.3 43.75,-66.5 63.88,-66.5 75.51,-66.5 83.36,-63.76 87.43,-59.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.73,-60.84 89.9,-50.28 83.96,-59.05 90.73,-60.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="250.25,-56.25 163.75,-56.25 163.75,-37 250.25,-37 250.25,-56.25"/>
-<text text-anchor="middle" x="207" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.01,-36.12C136.09,-37.21 144.31,-38.32 152.23,-39.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.69,-42.84 162.07,-40.71 152.62,-35.91 151.69,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.38,-19.25 177.62,-19.25 177.62,0 236.38,0 236.38,-19.25"/>
-<text text-anchor="middle" x="207" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.01,-19.57C140.89,-17.93 154.1,-16.24 165.91,-14.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.2,-18.23 175.68,-13.49 165.31,-11.29 166.2,-18.23"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d9f/selection__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d9f/selection__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 34df6e2ff..000000000
--- a/d4/d9f/selection__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,80,55,106"/>
-<area shape="rect" id="Node000002" href="$d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,80,146,106"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,90,87,90,87,96,55,96"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="205,5,283,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="140,77,193,40,199,36,201,41,195,44,143,82"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="210,55,278,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="146,86,194,75,195,81,147,91"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="208,104,280,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="147,95,194,104,193,109,146,100"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="194,153,294,179"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="144,104,195,140,201,143,199,148,193,144,141,108"/>
-</map>
diff --git a/d4/d9f/selection__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d9f/selection__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 01ee1e0d0..000000000
--- a/d4/d9f/selection__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e05a40458562fdd8e5b8e372b4bb3a4e
\ No newline at end of file
diff --git a/d4/d9f/selection__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d9f/selection__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 6a7f2c1d0..000000000
--- a/d4/d9f/selection__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="225pt" height="138pt"
- viewBox="0.00 0.00 224.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-74.25 73,-74.25 73,-55 105.5,-55 105.5,-74.25"/>
-<text text-anchor="middle" x="89.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-64.62C44.58,-64.62 53.31,-64.62 61.45,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-68.13 71.2,-64.63 61.2,-61.13 61.2,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="208.5,-130.25 149.75,-130.25 149.75,-111 208.5,-111 208.5,-130.25"/>
-<text text-anchor="middle" x="179.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.44,-74.65C112.56,-82.73 127.5,-94.09 141.5,-102.62 142.94,-103.5 144.42,-104.37 145.93,-105.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.27,-108.3 154.75,-109.89 147.55,-102.12 144.27,-108.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.75,-93.25 153.5,-93.25 153.5,-74 204.75,-74 204.75,-93.25"/>
-<text text-anchor="middle" x="179.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-68.02C116.01,-70.2 129.49,-73.11 142.07,-75.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.26,-79.23 151.77,-77.93 142.74,-72.39 141.26,-79.23"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="205.88,-56.25 152.38,-56.25 152.38,-37 205.88,-37 205.88,-56.25"/>
-<text text-anchor="middle" x="179.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-61.41C115.79,-59.39 128.88,-56.71 141.22,-54.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.64,-57.67 150.73,-52.24 140.23,-50.81 141.64,-57.67"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.75,-19.25 141.5,-19.25 141.5,0 216.75,0 216.75,-19.25"/>
-<text text-anchor="middle" x="179.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.9,-54.57C113.03,-46.75 127.77,-35.88 141.5,-27.62 142.94,-26.76 144.43,-25.9 145.95,-25.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.56,-28.16 154.77,-20.4 144.29,-21.96 147.56,-28.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/d9f/selection__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/d9f/selection__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 09e5d9d18..000000000
--- a/d4/d9f/selection__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="225pt" height="138pt"
- viewBox="0.00 0.00 224.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-74.25 73,-74.25 73,-55 105.5,-55 105.5,-74.25"/>
-<text text-anchor="middle" x="89.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-64.62C44.58,-64.62 53.31,-64.62 61.45,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-68.13 71.2,-64.63 61.2,-61.13 61.2,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="208.5,-130.25 149.75,-130.25 149.75,-111 208.5,-111 208.5,-130.25"/>
-<text text-anchor="middle" x="179.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.44,-74.65C112.56,-82.73 127.5,-94.09 141.5,-102.62 142.94,-103.5 144.42,-104.37 145.93,-105.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.27,-108.3 154.75,-109.89 147.55,-102.12 144.27,-108.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.75,-93.25 153.5,-93.25 153.5,-74 204.75,-74 204.75,-93.25"/>
-<text text-anchor="middle" x="179.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-68.02C116.01,-70.2 129.49,-73.11 142.07,-75.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.26,-79.23 151.77,-77.93 142.74,-72.39 141.26,-79.23"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="205.88,-56.25 152.38,-56.25 152.38,-37 205.88,-37 205.88,-56.25"/>
-<text text-anchor="middle" x="179.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-61.41C115.79,-59.39 128.88,-56.71 141.22,-54.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.64,-57.67 150.73,-52.24 140.23,-50.81 141.64,-57.67"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.75,-19.25 141.5,-19.25 141.5,0 216.75,0 216.75,-19.25"/>
-<text text-anchor="middle" x="179.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.9,-54.57C113.03,-46.75 127.77,-35.88 141.5,-27.62 142.94,-26.76 144.43,-25.9 145.95,-25.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.56,-28.16 154.77,-20.4 144.29,-21.96 147.56,-28.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/d9f/selection__sort__recursive_8cpp_source.html b/d4/d9f/selection__sort__recursive_8cpp_source.html
new file mode 100644
index 000000000..0abe39319
--- /dev/null
+++ b/d4/d9f/selection__sort__recursive_8cpp_source.html
@@ -0,0 +1,224 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/selection_sort_recursive.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/d9f/selection__sort__recursive_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">selection_sort_recursive.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/d9f/selection__sort__recursive_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;cassert&gt;</span>  </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/d4a/namespaceselection__sort__recursive.html">selection_sort_recursive</a> {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00056" data-start="{" data-end="}">
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="../../d4/d9f/selection__sort__recursive_8cpp.html#a5454eeb691725ccac0f59df1e133f834">   56</a></span>uint64_t <a class="code hl_function" href="../../d4/d9f/selection__sort__recursive_8cpp.html#a5454eeb691725ccac0f59df1e133f834">findMinIndex</a>(<span class="keyword">const</span> std::vector&lt;T&gt; &amp;in_arr,</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>                      uint64_t current_position = 0) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordflow">if</span> (current_position + 1 == in_arr.size()) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <span class="keywordflow">return</span> current_position;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    }</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    uint64_t answer = <a class="code hl_function" href="../../d4/d9f/selection__sort__recursive_8cpp.html#a5454eeb691725ccac0f59df1e133f834">findMinIndex</a>(in_arr, current_position + 1);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordflow">if</span> (in_arr[current_position] &lt; in_arr[answer]) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        answer = current_position;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordflow">return</span> answer;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>}</div>
+</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00076" data-start="{" data-end="}">
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"><a class="line" href="../../d4/d9f/selection__sort__recursive_8cpp.html#ab6f7b33a070e376e1f4374e534435e89">   76</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d9f/selection__sort__recursive_8cpp.html#ab6f7b33a070e376e1f4374e534435e89">selectionSortRecursive</a>(std::vector&lt;T&gt; &amp;in_arr,</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>                            uint64_t current_position = 0) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordflow">if</span> (current_position == in_arr.size()) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    }</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    uint64_t min_element_idx =</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        selection_sort_recursive::findMinIndex(in_arr, current_position);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordflow">if</span> (min_element_idx != current_position) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        std::swap(in_arr[min_element_idx], in_arr[current_position]);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    }</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <a class="code hl_function" href="../../d4/d9f/selection__sort__recursive_8cpp.html#ab6f7b33a070e376e1f4374e534435e89">selectionSortRecursive</a>(in_arr, current_position + 1);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>}</div>
+</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>}  <span class="comment">// namespace selection_sort_recursive</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="foldopen" id="foldopen00095" data-start="{" data-end="}">
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="../../d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   95</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="comment">// 1st test</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="comment">// [1, 0, 2, 1] return [0, 1, 1, 2]</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    std::vector&lt;uint64_t&gt; array1 = {0, 1, 1, 2};</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test... &quot;</span>;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    sorting::selection_sort_recursive::selectionSortRecursive(array1);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    assert(std::is_sorted(std::begin(array1), std::end(array1)));</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="comment">// 2nd test</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="comment">// [1, 0, 0, 1, 1, 0, 2, 1] return [0, 0, 0, 1, 1, 1, 1, 2]</span></div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    std::vector&lt;uint64_t&gt; array2 = {1, 0, 0, 1, 1, 0, 2, 1};</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test... &quot;</span>;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    sorting::selection_sort_recursive::selectionSortRecursive(array2);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    assert(std::is_sorted(std::begin(array2), std::end(array2)));</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="comment">// 3rd test</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <span class="comment">// [1, 1, 0, 0, 1, 2, 2, 0, 2, 1] return [0, 0, 0, 1, 1, 1, 1, 2, 2, 2]</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    std::vector&lt;uint64_t&gt; array3 = {1, 1, 0, 0, 1, 2, 2, 0, 2, 1};</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test... &quot;</span>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    sorting::selection_sort_recursive::selectionSortRecursive(array3);</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    assert(std::is_sorted(std::begin(array3), std::end(array3)));</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="comment">// 4th test</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <span class="comment">// [2, 2, 2, 0, 0, 1, 1] return [0, 0, 1, 1, 2, 2, 2]</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    std::vector&lt;uint64_t&gt; array4 = {2, 2, 2, 0, 0, 1, 1};</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;4th test... &quot;</span>;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    sorting::selection_sort_recursive::selectionSortRecursive(array4);</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    assert(std::is_sorted(std::begin(array4), std::end(array4)));</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>}</div>
+</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
+<div class="foldopen" id="foldopen00130" data-start="{" data-end="}">
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"><a class="line" href="../../d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  130</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <a class="code hl_function" href="../../d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>}</div>
+</div>
+<div class="ttc" id="anamespaceselection__sort__recursive_html"><div class="ttname"><a href="../../df/d4a/namespaceselection__sort__recursive.html">selection_sort_recursive</a></div><div class="ttdoc">Functions for the Selection sort implementation using recursion.</div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+<div class="ttc" id="aselection__sort__recursive_8cpp_html_a5454eeb691725ccac0f59df1e133f834"><div class="ttname"><a href="../../d4/d9f/selection__sort__recursive_8cpp.html#a5454eeb691725ccac0f59df1e133f834">sorting::selection_sort_recursive::findMinIndex</a></div><div class="ttdeci">uint64_t findMinIndex(const std::vector&lt; T &gt; &amp;in_arr, uint64_t current_position=0)</div><div class="ttdoc">The main function finds the index of the minimum element.</div><div class="ttdef"><b>Definition</b> <a href="#l00056">selection_sort_recursive.cpp:56</a></div></div>
+<div class="ttc" id="aselection__sort__recursive_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/d9f/selection__sort__recursive_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> <a href="#l00095">selection_sort_recursive.cpp:95</a></div></div>
+<div class="ttc" id="aselection__sort__recursive_8cpp_html_ab6f7b33a070e376e1f4374e534435e89"><div class="ttname"><a href="../../d4/d9f/selection__sort__recursive_8cpp.html#ab6f7b33a070e376e1f4374e534435e89">sorting::selection_sort_recursive::selectionSortRecursive</a></div><div class="ttdeci">void selectionSortRecursive(std::vector&lt; T &gt; &amp;in_arr, uint64_t current_position=0)</div><div class="ttdoc">The main function implements Selection sort.</div><div class="ttdef"><b>Definition</b> <a href="#l00076">selection_sort_recursive.cpp:76</a></div></div>
+<div class="ttc" id="aselection__sort__recursive_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00130">selection_sort_recursive.cpp:130</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d4/d9f/selection__sort__recursive_8cpp.html">selection_sort_recursive.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/da0/gcd__iterative__euclidean_8cpp.html b/d4/da0/gcd__iterative__euclidean_8cpp.html
index 31c3a06a5..385dc3ea1 100644
--- a/d4/da0/gcd__iterative__euclidean_8cpp.html
+++ b/d4/da0/gcd__iterative__euclidean_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/gcd_iterative_euclidean.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/gcd_iterative_euclidean.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,7 +136,9 @@ Include dependency graph for gcd_iterative_euclidean.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/deb/gcd__iterative__euclidean_8cpp__incl.svg" width="184" height="126"><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">
+</div>
+<p><a href="../../d4/da0/gcd__iterative__euclidean_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ae48807fa2b7000afae599e67f327545e" id="r_ae48807fa2b7000afae599e67f327545e"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae48807fa2b7000afae599e67f327545e">gcd</a> (int num1, int num2)</td></tr>
@@ -130,6 +149,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Compute the greatest common denominator of two integers using <em>iterative form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </p>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d4/d45/gcd__recursive__euclidean_8cpp.html" title="Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm">gcd_recursive_euclidean.cpp</a>, <a class="el" href="../../d1/d11/gcd__of__n__numbers_8cpp.html" title="This program aims at calculating the GCD of n numbers.">gcd_of_n_numbers.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/da0/gcd__iterative__euclidean_8cpp_source.html">gcd_iterative_euclidean.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae48807fa2b7000afae599e67f327545e" name="ae48807fa2b7000afae599e67f327545e"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae48807fa2b7000afae599e67f327545e">&#9670;&#160;</a></span>gcd()</h2>
@@ -150,9 +171,11 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>algorithm </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/da0/gcd__iterative__euclidean_8cpp_source.html#l00015">15</a> of file <a class="el" href="../../d4/da0/gcd__iterative__euclidean_8cpp_source.html">gcd_iterative_euclidean.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   15</span>                            {</div>
 <div class="line"><span class="lineno">   16</span>    <span class="keywordflow">if</span> (num1 &lt;= 0 | num2 &lt;= 0) {</div>
-<div class="line"><span class="lineno">   17</span>        <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/domain_error.html">std::domain_error</a>(<span class="stringliteral">&quot;Euclidean algorithm domain is for ints &gt; 0&quot;</span>);</div>
+<div class="line"><span class="lineno">   17</span>        <span class="keywordflow">throw</span> std::domain_error(<span class="stringliteral">&quot;Euclidean algorithm domain is for ints &gt; 0&quot;</span>);</div>
 <div class="line"><span class="lineno">   18</span>    }</div>
 <div class="line"><span class="lineno">   19</span> </div>
 <div class="line"><span class="lineno">   20</span>    <span class="keywordflow">if</span> (num1 == num2) {</div>
@@ -178,7 +201,6 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   40</span> </div>
 <div class="line"><span class="lineno">   41</span>    <span class="keywordflow">return</span> previous_remainder;</div>
 <div class="line"><span class="lineno">   42</span>}</div>
-<div class="ttc" id="adomain_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/domain_error.html">std::domain_error</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -197,27 +219,22 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/da0/gcd__iterative__euclidean_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../d4/da0/gcd__iterative__euclidean_8cpp_source.html">gcd_iterative_euclidean.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   47</span>           {</div>
-<div class="line"><span class="lineno">   48</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;gcd of 120,7 is &quot;</span> &lt;&lt; (<a class="code hl_function" href="#ae48807fa2b7000afae599e67f327545e">gcd</a>(120, 7)) &lt;&lt; <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">   48</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;gcd of 120,7 is &quot;</span> &lt;&lt; (<a class="code hl_function" href="#ae48807fa2b7000afae599e67f327545e">gcd</a>(120, 7)) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   49</span>    <span class="keywordflow">try</span> {</div>
-<div class="line"><span class="lineno">   50</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;gcd of -120,10 is &quot;</span> &lt;&lt; <a class="code hl_function" href="#ae48807fa2b7000afae599e67f327545e">gcd</a>(-120, 10) &lt;&lt; <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">   51</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/domain_error.html">std::domain_error</a> &amp;e) {</div>
-<div class="line"><span class="lineno">   52</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Error handling was successful&quot;</span> &lt;&lt; <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">   50</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;gcd of -120,10 is &quot;</span> &lt;&lt; <a class="code hl_function" href="#ae48807fa2b7000afae599e67f327545e">gcd</a>(-120, 10) &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   51</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::domain_error &amp;e) {</div>
+<div class="line"><span class="lineno">   52</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Error handling was successful&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   53</span>    }</div>
-<div class="line"><span class="lineno">   54</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;gcd of 312,221 is &quot;</span> &lt;&lt; (<a class="code hl_function" href="#ae48807fa2b7000afae599e67f327545e">gcd</a>(312, 221)) &lt;&lt; <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">   55</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;gcd of 289,204 is &quot;</span> &lt;&lt; (<a class="code hl_function" href="#ae48807fa2b7000afae599e67f327545e">gcd</a>(289, 204)) &lt;&lt; <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">   54</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;gcd of 312,221 is &quot;</span> &lt;&lt; (<a class="code hl_function" href="#ae48807fa2b7000afae599e67f327545e">gcd</a>(312, 221)) &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   55</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;gcd of 289,204 is &quot;</span> &lt;&lt; (<a class="code hl_function" href="#ae48807fa2b7000afae599e67f327545e">gcd</a>(289, 204)) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   56</span> </div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   58</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="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="agcd__iterative__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition</b> gcd_iterative_euclidean.cpp:15</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="180" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agcd__iterative__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/da0/gcd__iterative__euclidean_8cpp_source.html#l00015">gcd_iterative_euclidean.cpp:15</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 5e3697332..000000000
--- a/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,35,87,27,88,33,56,40"/>
-<area shape="rect" id="Node000003" href="$d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" title=" " alt="" coords="117,55,160,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,46,102,57,101,62,55,52"/>
-</map>
diff --git a/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index fd7c5967c..000000000
--- a/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b76dbb8fb5cb746041e0628f044ee012
\ No newline at end of file
diff --git a/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 2f290a11b..000000000
--- a/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="64pt"
- viewBox="0.00 0.00 134.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-56.25 73,-56.25 73,-37 126.5,-37 126.5,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.64,-33.65 53.16,-35.69 61.53,-37.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.71,-41.1 71.25,-40.03 62.34,-34.3 60.71,-41.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="115.62,-19.25 83.88,-19.25 83.88,0 115.62,0 115.62,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C47.79,-21.2 60.91,-18.22 72.36,-15.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.05,-19.05 82.03,-13.42 71.5,-12.22 73.05,-19.05"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 8a9d986a3..000000000
--- a/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="64pt"
- viewBox="0.00 0.00 134.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-56.25 73,-56.25 73,-37 126.5,-37 126.5,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.64,-33.65 53.16,-35.69 61.53,-37.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.71,-41.1 71.25,-40.03 62.34,-34.3 60.71,-41.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="115.62,-19.25 83.88,-19.25 83.88,0 115.62,0 115.62,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C47.79,-21.2 60.91,-18.22 72.36,-15.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.05,-19.05 82.03,-13.42 71.5,-12.22 73.05,-19.05"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/da0/gcd__iterative__euclidean_8cpp_source.html b/d4/da0/gcd__iterative__euclidean_8cpp_source.html
new file mode 100644
index 000000000..99acfbb87
--- /dev/null
+++ b/d4/da0/gcd__iterative__euclidean_8cpp_source.html
@@ -0,0 +1,188 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/gcd_iterative_euclidean.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/da0/gcd__iterative__euclidean_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">gcd_iterative_euclidean.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/da0/gcd__iterative__euclidean_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;stdexcept&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="foldopen" id="foldopen00015" data-start="{" data-end="}">
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"><a class="line" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">   15</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>(<span class="keywordtype">int</span> num1, <span class="keywordtype">int</span> num2) {</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <span class="keywordflow">if</span> (num1 &lt;= 0 | num2 &lt;= 0) {</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>        <span class="keywordflow">throw</span> std::domain_error(<span class="stringliteral">&quot;Euclidean algorithm domain is for ints &gt; 0&quot;</span>);</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    }</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="keywordflow">if</span> (num1 == num2) {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        <span class="keywordflow">return</span> num1;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    }</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="keywordtype">int</span> base_num = 0;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="keywordtype">int</span> previous_remainder = 1;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordflow">if</span> (num1 &gt; num2) {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        base_num = num1;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>        previous_remainder = num2;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        base_num = num2;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        previous_remainder = num1;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    }</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordflow">while</span> ((base_num % previous_remainder) != 0) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        <span class="keywordtype">int</span> old_base = base_num;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        base_num = previous_remainder;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        previous_remainder = old_base % previous_remainder;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    }</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">return</span> previous_remainder;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>}</div>
+</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="foldopen" id="foldopen00047" data-start="{" data-end="}">
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   47</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;gcd of 120,7 is &quot;</span> &lt;&lt; (<a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>(120, 7)) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">try</span> {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;gcd of -120,10 is &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>(-120, 10) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::domain_error &amp;e) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Error handling was successful&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    }</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;gcd of 312,221 is &quot;</span> &lt;&lt; (<a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>(312, 221)) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;gcd of 289,204 is &quot;</span> &lt;&lt; (<a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>(289, 204)) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}</div>
+</div>
+<div class="ttc" id="agcd__iterative__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition</b> <a href="#l00015">gcd_iterative_euclidean.cpp:15</a></div></div>
+<div class="ttc" id="agcd__iterative__euclidean_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00047">gcd_iterative_euclidean.cpp:47</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html">gcd_iterative_euclidean.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/da0/kadane_8cpp.html b/d4/da0/kadane_8cpp.html
index 3b5feb12d..8ce1a0fa6 100644
--- a/d4/da0/kadane_8cpp.html
+++ b/d4/da0/kadane_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/kadane.cpp File Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming/kadane.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for kadane.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d53/kadane_8cpp__incl.svg" width="240" height="126"><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">
+</div>
+<p><a href="../../d4/da0/kadane_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
@@ -134,7 +153,7 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:af3029007a422a914a85c0b0122f1c7b4" id="r_af3029007a422a914a85c0b0122f1c7b4"><td class="memTemplParams" colspan="2">template&lt;size_t N&gt; </td></tr>
-<tr class="memitem:af3029007a422a914a85c0b0122f1c7b4"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af3029007a422a914a85c0b0122f1c7b4">dynamic_programming::kadane::maxSubArray</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, N &gt; &amp;n)</td></tr>
+<tr class="memitem:af3029007a422a914a85c0b0122f1c7b4"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af3029007a422a914a85c0b0122f1c7b4">dynamic_programming::kadane::maxSubArray</a> (const std::array&lt; int, N &gt; &amp;n)</td></tr>
 <tr class="memdesc:af3029007a422a914a85c0b0122f1c7b4"><td class="mdescLeft">&#160;</td><td class="mdescRight">maxSubArray function is used to calculate the maximum sum subarray and returns the value of maximum sum which is stored in the variable max_sum  <br /></td></tr>
 <tr class="separator:af3029007a422a914a85c0b0122f1c7b4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
 Algorithm</h3>
 <p>The simple idea of the algorithm is to search for all positive contiguous segments of the array and keep track of maximum sum contiguous segment among all positive segments(curr_sum is used for this) Each time we get a positive sum we compare it with max_sum and update max_sum if it is greater than curr_sum</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/ayush523" target="_blank">Ayush Singh</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/da0/kadane_8cpp_source.html">kadane.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -166,25 +187,24 @@ Algorithm</h3>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/da0/kadane_8cpp_source.html#l00060">60</a> of file <a class="el" href="../../d4/da0/kadane_8cpp_source.html">kadane.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   60</span>           {</div>
 <div class="line"><span class="lineno">   61</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 5;</div>
-<div class="line"><span class="lineno">   62</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, N&gt;</a> n{};  <span class="comment">// declaring array</span></div>
+<div class="line"><span class="lineno">   62</span>    std::array&lt;int, N&gt; n{};  <span class="comment">// declaring array</span></div>
 <div class="line"><span class="lineno">   63</span>                             <span class="comment">// taking values of elements from user</span></div>
 <div class="line"><span class="lineno">   64</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n.size(); i++) {</div>
-<div class="line"><span class="lineno">   65</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter value of n[&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;]&quot;</span></div>
+<div class="line"><span class="lineno">   65</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter value of n[&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;]&quot;</span></div>
 <div class="line"><span class="lineno">   66</span>                  &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   67</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n[i];</div>
+<div class="line"><span class="lineno">   67</span>        std::cin &gt;&gt; n[i];</div>
 <div class="line"><span class="lineno">   68</span>    }</div>
 <div class="line"><span class="lineno">   69</span>    <span class="keywordtype">int</span> max_sum = dynamic_programming::kadane::maxSubArray&lt;N&gt;(</div>
 <div class="line"><span class="lineno">   70</span>        n);  <span class="comment">// calling maxSubArray function</span></div>
-<div class="line"><span class="lineno">   71</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Maximum subarray sum is &quot;</span> &lt;&lt; max_sum;  <span class="comment">// Printing the answer</span></div>
+<div class="line"><span class="lineno">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum subarray sum is &quot;</span> &lt;&lt; max_sum;  <span class="comment">// Printing the answer</span></div>
 <div class="line"><span class="lineno">   72</span> </div>
 <div class="line"><span class="lineno">   73</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   74</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -199,7 +219,7 @@ template&lt;size_t N&gt; </div>
         <tr>
           <td class="memname">int dynamic_programming::kadane::maxSubArray </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, N &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
+          <td class="paramtype">const std::array&lt; int, N &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -219,24 +239,20 @@ template&lt;size_t N&gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the value of maximum subarray sum </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/da0/kadane_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d4/da0/kadane_8cpp_source.html">kadane.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   42</span>                                           {</div>
 <div class="line"><span class="lineno">   43</span>    <span class="keywordtype">int</span> curr_sum =</div>
 <div class="line"><span class="lineno">   44</span>        0;  <span class="comment">// declaring a variable named as curr_sum and initialized it to 0</span></div>
 <div class="line"><span class="lineno">   45</span>    <span class="keywordtype">int</span> max_sum = INT_MIN;  <span class="comment">// Initialized max_sum to INT_MIN</span></div>
 <div class="line"><span class="lineno">   46</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : n) {  <span class="comment">// for loop to iterate over the elements of the array</span></div>
 <div class="line"><span class="lineno">   47</span>        curr_sum += n[i];</div>
-<div class="line"><span class="lineno">   48</span>        max_sum = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(max_sum, curr_sum);  <span class="comment">// getting the maximum value</span></div>
-<div class="line"><span class="lineno">   49</span>        curr_sum = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(curr_sum, 0);  <span class="comment">// updating the value of curr_sum</span></div>
+<div class="line"><span class="lineno">   48</span>        max_sum = std::max(max_sum, curr_sum);  <span class="comment">// getting the maximum value</span></div>
+<div class="line"><span class="lineno">   49</span>        curr_sum = std::max(curr_sum, 0);  <span class="comment">// updating the value of curr_sum</span></div>
 <div class="line"><span class="lineno">   50</span>    }</div>
 <div class="line"><span class="lineno">   51</span>    <span class="keywordflow">return</span> max_sum;  <span class="comment">// returning the value of max_sum</span></div>
 <div class="line"><span class="lineno">   52</span>}</div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.svg" width="290" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.map b/d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.map
deleted file mode 100644
index 851cec3a0..000000000
--- a/d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="dynamic_programming::kadane::maxSubArray" name="dynamic_programming::kadane::maxSubArray">
-<area shape="rect" id="Node000001" title="maxSubArray function is used to calculate the maximum sum subarray and returns the value of maximum s..." alt="" coords="5,29,164,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="53,29,51,19,57,11,68,5,85,3,103,5,113,11,111,16,101,10,84,8,69,10,60,14,57,20,58,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="212,37,284,62"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="164,47,196,47,196,52,164,52"/>
-</map>
diff --git a/d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.md5 b/d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.md5
deleted file mode 100644
index 373bfeaad..000000000
--- a/d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-48c388afe0d3daac622c444b3cdcdb4f
\ No newline at end of file
diff --git a/d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.svg b/d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.svg
deleted file mode 100644
index 9ffcf1a77..000000000
--- a/d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::kadane::maxSubArray Pages: 1 -->
-<svg width="217pt" height="57pt"
- viewBox="0.00 0.00 217.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>dynamic_programming::kadane::maxSubArray</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="maxSubArray function is used to calculate the maximum sum subarray and returns the value of maximum s...">
-<polygon fill="#999999" stroke="#666666" points="118.75,-30.5 0,-30.5 0,0 118.75,0 118.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="59.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::kadane::maxSubArray</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.67,-30.99C33.24,-40.06 40.47,-48.5 59.38,-48.5 69.71,-48.5 76.56,-45.97 79.92,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.38,-42.8 80.93,-32.49 76.41,-42.08 83.38,-42.8"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209,-24.88 154.75,-24.88 154.75,-5.63 209,-5.63 209,-24.88"/>
-<text text-anchor="middle" x="181.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.21,-15.25C127.29,-15.25 135.4,-15.25 142.96,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.8,-18.75 152.8,-15.25 142.8,-11.75 142.8,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph_org.svg b/d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph_org.svg
deleted file mode 100644
index 027c5cd14..000000000
--- a/d4/da0/kadane_8cpp_af3029007a422a914a85c0b0122f1c7b4_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::kadane::maxSubArray Pages: 1 -->
-<svg width="217pt" height="57pt"
- viewBox="0.00 0.00 217.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>dynamic_programming::kadane::maxSubArray</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="maxSubArray function is used to calculate the maximum sum subarray and returns the value of maximum s...">
-<polygon fill="#999999" stroke="#666666" points="118.75,-30.5 0,-30.5 0,0 118.75,0 118.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="59.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::kadane::maxSubArray</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.67,-30.99C33.24,-40.06 40.47,-48.5 59.38,-48.5 69.71,-48.5 76.56,-45.97 79.92,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.38,-42.8 80.93,-32.49 76.41,-42.08 83.38,-42.8"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209,-24.88 154.75,-24.88 154.75,-5.63 209,-5.63 209,-24.88"/>
-<text text-anchor="middle" x="181.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.21,-15.25C127.29,-15.25 135.4,-15.25 142.96,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.8,-18.75 152.8,-15.25 142.8,-11.75 142.8,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/da0/kadane_8cpp_source.html b/d4/da0/kadane_8cpp_source.html
new file mode 100644
index 000000000..44123375e
--- /dev/null
+++ b/d4/da0/kadane_8cpp_source.html
@@ -0,0 +1,181 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/kadane.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/da0/kadane_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">kadane.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/da0/kadane_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;array&gt;</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;climits&gt;</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a> {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/d74/namespacekadane.html">kadane</a> {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> N&gt;</div>
+<div class="foldopen" id="foldopen00042" data-start="{" data-end="}">
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../d4/da0/kadane_8cpp.html#af3029007a422a914a85c0b0122f1c7b4">   42</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/da0/kadane_8cpp.html#af3029007a422a914a85c0b0122f1c7b4">maxSubArray</a>(<span class="keyword">const</span> std::array&lt;int, N&gt; &amp;n) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordtype">int</span> curr_sum =</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        0;  <span class="comment">// declaring a variable named as curr_sum and initialized it to 0</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordtype">int</span> max_sum = INT_MIN;  <span class="comment">// Initialized max_sum to INT_MIN</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : n) {  <span class="comment">// for loop to iterate over the elements of the array</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        curr_sum += n[i];</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        max_sum = std::max(max_sum, curr_sum);  <span class="comment">// getting the maximum value</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        curr_sum = std::max(curr_sum, 0);  <span class="comment">// updating the value of curr_sum</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordflow">return</span> max_sum;  <span class="comment">// returning the value of max_sum</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>}</div>
+</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>}  <span class="comment">// namespace kadane</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>}  <span class="comment">// namespace dynamic_programming</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="foldopen" id="foldopen00060" data-start="{" data-end="}">
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"><a class="line" href="../../d4/da0/kadane_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   60</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/da0/kadane_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> N = 5;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    std::array&lt;int, N&gt; n{};  <span class="comment">// declaring array</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>                             <span class="comment">// taking values of elements from user</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n.size(); i++) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter value of n[&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;]&quot;</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>                  &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        std::cin &gt;&gt; n[i];</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordtype">int</span> max_sum = dynamic_programming::kadane::maxSubArray&lt;N&gt;(</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        n);  <span class="comment">// calling maxSubArray function</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum subarray sum is &quot;</span> &lt;&lt; max_sum;  <span class="comment">// Printing the answer</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>}</div>
+</div>
+<div class="ttc" id="akadane_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/da0/kadane_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00060">kadane.cpp:60</a></div></div>
+<div class="ttc" id="akadane_8cpp_html_af3029007a422a914a85c0b0122f1c7b4"><div class="ttname"><a href="../../d4/da0/kadane_8cpp.html#af3029007a422a914a85c0b0122f1c7b4">dynamic_programming::kadane::maxSubArray</a></div><div class="ttdeci">int maxSubArray(const std::array&lt; int, N &gt; &amp;n)</div><div class="ttdoc">maxSubArray function is used to calculate the maximum sum subarray and returns the value of maximum s...</div><div class="ttdef"><b>Definition</b> <a href="#l00042">kadane.cpp:42</a></div></div>
+<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
+<div class="ttc" id="anamespacekadane_html"><div class="ttname"><a href="../../d6/d74/namespacekadane.html">kadane</a></div><div class="ttdoc">Functions for Kadane algorithm.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../d4/da0/kadane_8cpp.html">kadane.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/db4/struct_segment_intersection.html b/d4/db4/struct_segment_intersection.html
index 1540ae55f..6cde34f2a 100644
--- a/d4/db4/struct_segment_intersection.html
+++ b/d4/db4/struct_segment_intersection.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: SegmentIntersection Struct Reference</title>
+<title>TheAlgorithms/C++: SegmentIntersection Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,6 +139,8 @@ Public Member Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>intersect returns true if segments of two line intersects and false if they do not. It calls the subroutines direction which computes the orientation. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00022">22</a> of file <a class="el" href="../../d8/d6c/line__segment__intersection_8cpp_source.html">line_segment_intersection.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="a3beb2ac1b35d67354f1dbaf9a971e655" name="a3beb2ac1b35d67354f1dbaf9a971e655"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a3beb2ac1b35d67354f1dbaf9a971e655">&#9670;&#160;</a></span>direction()</h2>
@@ -155,13 +174,15 @@ Public Member Functions</h2></td></tr>
 </table>
 </div><div class="memdoc">
 <p>We will find direction of line here respect to @first_point. Here @second_point and @third_point is first and second points of the line respectively. we want a method to determine which way a given angle these three points turns. If returned number is negative, then the angle is counter-clockwise. That means the line is going to right to left. We will fount angle as clockwise if the method returns positive number. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00063">63</a> of file <a class="el" href="../../d8/d6c/line__segment__intersection_8cpp_source.html">line_segment_intersection.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   64</span>                                            {</div>
 <div class="line"><span class="lineno">   65</span>        <span class="keywordflow">return</span> ((third_point.x - first_point.x) *</div>
 <div class="line"><span class="lineno">   66</span>                (second_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> - first_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>)) -</div>
 <div class="line"><span class="lineno">   67</span>               ((second_point.x - first_point.x) *</div>
 <div class="line"><span class="lineno">   68</span>                (third_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> - first_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>));</div>
 <div class="line"><span class="lineno">   69</span>    }</div>
-<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:14</div></div>
+<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00014">line_segment_intersection.cpp:14</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -201,6 +222,8 @@ Public Member Functions</h2></td></tr>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00023">23</a> of file <a class="el" href="../../d8/d6c/line__segment__intersection_8cpp_source.html">line_segment_intersection.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   24</span>                                                                {</div>
 <div class="line"><span class="lineno">   25</span>        <span class="keywordtype">int</span> direction1 = <a class="code hl_function" href="#a3beb2ac1b35d67354f1dbaf9a971e655">direction</a>(third_point, forth_point, first_point);</div>
 <div class="line"><span class="lineno">   26</span>        <span class="keywordtype">int</span> direction2 = <a class="code hl_function" href="#a3beb2ac1b35d67354f1dbaf9a971e655">direction</a>(third_point, forth_point, second_point);</div>
@@ -230,8 +253,8 @@ Public Member Functions</h2></td></tr>
 <div class="line"><span class="lineno">   50</span>        <span class="keywordflow">else</span></div>
 <div class="line"><span class="lineno">   51</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   52</span>    }</div>
-<div class="ttc" id="astruct_segment_intersection_html_a008941b2272866c64cdaf959afa939bf"><div class="ttname"><a href="#a008941b2272866c64cdaf959afa939bf">SegmentIntersection::on_segment</a></div><div class="ttdeci">bool on_segment(Point first_point, Point second_point, Point third_point)</div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:75</div></div>
-<div class="ttc" id="astruct_segment_intersection_html_a3beb2ac1b35d67354f1dbaf9a971e655"><div class="ttname"><a href="#a3beb2ac1b35d67354f1dbaf9a971e655">SegmentIntersection::direction</a></div><div class="ttdeci">int direction(Point first_point, Point second_point, Point third_point)</div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:63</div></div>
+<div class="ttc" id="astruct_segment_intersection_html_a008941b2272866c64cdaf959afa939bf"><div class="ttname"><a href="#a008941b2272866c64cdaf959afa939bf">SegmentIntersection::on_segment</a></div><div class="ttdeci">bool on_segment(Point first_point, Point second_point, Point third_point)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00075">line_segment_intersection.cpp:75</a></div></div>
+<div class="ttc" id="astruct_segment_intersection_html_a3beb2ac1b35d67354f1dbaf9a971e655"><div class="ttname"><a href="#a3beb2ac1b35d67354f1dbaf9a971e655">SegmentIntersection::direction</a></div><div class="ttdeci">int direction(Point first_point, Point second_point, Point third_point)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00063">line_segment_intersection.cpp:63</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -267,28 +290,23 @@ Public Member Functions</h2></td></tr>
 </table>
 </div><div class="memdoc">
 <p>This method determines whether a point known to be colinear with a segment lies on that segment. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00075">75</a> of file <a class="el" href="../../d8/d6c/line__segment__intersection_8cpp_source.html">line_segment_intersection.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   76</span>                                              {</div>
-<div class="line"><span class="lineno">   77</span>        <span class="keywordflow">if</span> (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(first_point.x, second_point.x) &lt;= third_point.x &amp;&amp;</div>
-<div class="line"><span class="lineno">   78</span>            third_point.x &lt;= <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(first_point.x, second_point.x) &amp;&amp;</div>
-<div class="line"><span class="lineno">   79</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(first_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>, second_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>) &lt;= third_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> &amp;&amp;</div>
-<div class="line"><span class="lineno">   80</span>            third_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> &lt;= <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(first_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>, second_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>))</div>
+<div class="line"><span class="lineno">   77</span>        <span class="keywordflow">if</span> (std::min(first_point.x, second_point.x) &lt;= third_point.x &amp;&amp;</div>
+<div class="line"><span class="lineno">   78</span>            third_point.x &lt;= std::max(first_point.x, second_point.x) &amp;&amp;</div>
+<div class="line"><span class="lineno">   79</span>            std::min(first_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>, second_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>) &lt;= third_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> &amp;&amp;</div>
+<div class="line"><span class="lineno">   80</span>            third_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> &lt;= std::max(first_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>, second_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>))</div>
 <div class="line"><span class="lineno">   81</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   82</span> </div>
 <div class="line"><span class="lineno">   83</span>        <span class="keywordflow">else</span></div>
 <div class="line"><span class="lineno">   84</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   85</span>    }</div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.svg" width="272" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>geometry/<a class="el" href="../../d8/d6c/line__segment__intersection_8cpp.html">line_segment_intersection.cpp</a></li>
+<li>geometry/<a class="el" href="../../d8/d6c/line__segment__intersection_8cpp_source.html">line_segment_intersection.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.map b/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.map
deleted file mode 100644
index 4774358db..000000000
--- a/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="SegmentIntersection::on_segment" name="SegmentIntersection::on_segment">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,23,147,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="195,5,267,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="147,29,179,24,180,29,148,35"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="197,55,265,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="148,52,181,57,181,62,147,57"/>
-</map>
diff --git a/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.md5 b/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.md5
deleted file mode 100644
index 38f4236f0..000000000
--- a/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2544310926a0fc4e8a5c1b7265ac5fdb
\ No newline at end of file
diff --git a/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.svg b/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.svg
deleted file mode 100644
index 76770e4a2..000000000
--- a/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: SegmentIntersection::on_segment Pages: 1 -->
-<svg width="204pt" height="64pt"
- viewBox="0.00 0.00 204.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>SegmentIntersection::on_segment</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="106,-42.88 0,-42.88 0,-12.37 106,-12.37 106,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">SegmentIntersection</text>
-<text text-anchor="middle" x="53" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::on_segment</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.25,-56.25 142,-56.25 142,-37 196.25,-37 196.25,-56.25"/>
-<text text-anchor="middle" x="169.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.39,-36.35C114.48,-37.69 122.7,-39.06 130.39,-40.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.63,-43.76 140.07,-41.95 130.78,-36.86 129.63,-43.76"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194.75,-19.25 143.5,-19.25 143.5,0 194.75,0 194.75,-19.25"/>
-<text text-anchor="middle" x="169.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.39,-19.36C114.97,-18.01 123.69,-16.63 131.78,-15.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.24,-18.83 141.57,-13.81 131.15,-11.91 132.24,-18.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph_org.svg b/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph_org.svg
deleted file mode 100644
index 5ae24e374..000000000
--- a/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: SegmentIntersection::on_segment Pages: 1 -->
-<svg width="204pt" height="64pt"
- viewBox="0.00 0.00 204.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>SegmentIntersection::on_segment</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="106,-42.88 0,-42.88 0,-12.37 106,-12.37 106,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">SegmentIntersection</text>
-<text text-anchor="middle" x="53" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::on_segment</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.25,-56.25 142,-56.25 142,-37 196.25,-37 196.25,-56.25"/>
-<text text-anchor="middle" x="169.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.39,-36.35C114.48,-37.69 122.7,-39.06 130.39,-40.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.63,-43.76 140.07,-41.95 130.78,-36.86 129.63,-43.76"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194.75,-19.25 143.5,-19.25 143.5,0 194.75,0 194.75,-19.25"/>
-<text text-anchor="middle" x="169.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.39,-19.36C114.97,-18.01 123.69,-16.63 131.78,-15.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.24,-18.83 141.57,-13.81 131.15,-11.91 132.24,-18.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/db6/reverse__binary__tree_8cpp.html b/d4/db6/reverse__binary__tree_8cpp.html
index 6b3673504..cf1e4c923 100644
--- a/d4/db6/reverse__binary__tree_8cpp.html
+++ b/d4/db6/reverse__binary__tree_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: operations_on_datastructures/reverse_binary_tree.cpp File Reference</title>
+<title>TheAlgorithms/C++: operations_on_datastructures/reverse_binary_tree.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for reverse_binary_tree.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/de3/reverse__binary__tree_8cpp__incl.svg" width="334" height="126"><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">
+</div>
+<p><a href="../../d4/db6/reverse__binary__tree_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">operations_on_datastructures::reverse_binary_tree::Node</a></td></tr>
@@ -136,7 +155,7 @@ Classes</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></td></tr>
-<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
+<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::vector <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/dc5/namespacereverse__binary__tree.html">reverse_binary_tree</a></td></tr>
 <tr class="memdesc:dc/dc5/namespacereverse__binary__tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the <a href="https://www.geeksforgeeks.org/reverse-tree-path/" target="_blank">Reverse a Binary Tree</a> implementation. <br /></td></tr>
@@ -166,6 +185,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation for the <a href="https://www.geeksforgeeks.org/reverse-tree-path/" target="_blank">Reversing a Binary Tree</a> recursively algorithm. </p>
 <p>A binary tree can be reversed by swapping the left and right child of a node at each node, starting from the root, and cascading below. This solution aims to provide an implementation of a recursive reversal of a binary tree. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/polarvoid" target="_blank">Alvin</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -184,17 +205,14 @@ Functions</h2></td></tr>
 
 <p>main function </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00270">270</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  270</span>           {</div>
 <div class="line"><span class="lineno">  271</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  272</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  273</span>}</div>
-<div class="ttc" id="areverse__binary__tree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of the Tree Reversal.</div><div class="ttdef"><b>Definition</b> reverse_binary_tree.cpp:260</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="287" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="areverse__binary__tree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of the Tree Reversal.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00260">reverse_binary_tree.cpp:260</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -224,20 +242,17 @@ Here is the call graph for this function:</div>
 <p>&lt; Single element test</p>
 <p>&lt; No element test</p>
 <p>&lt; Correct reversal test</p>
-<div class="fragment"><div class="line"><span class="lineno">  260</span>                   {</div>
-<div class="line"><span class="lineno">  261</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a>();  <span class="comment">///&lt; Single element test</span></div>
-<div class="line"><span class="lineno">  262</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a>();  <span class="comment">///&lt; No element test</span></div>
-<div class="line"><span class="lineno">  263</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a>();  <span class="comment">///&lt; Correct reversal test</span></div>
-<div class="line"><span class="lineno">  264</span>}</div>
-<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:75</div></div>
-<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check an invalid shift value.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:105</div></div>
-<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an empty vector.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:90</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="190" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00260">260</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  260</span>                   {</div>
+<div class="line"><span class="lineno">  261</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a>();  </div>
+<div class="line"><span class="lineno">  262</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a>();  </div>
+<div class="line"><span class="lineno">  263</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a>();  </div>
+<div class="line"><span class="lineno">  264</span>}</div>
+<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00075">array_left_rotation.cpp:75</a></div></div>
+<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check an invalid shift value.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00105">array_left_rotation.cpp:105</a></div></div>
+<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an empty vector.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00090">array_left_rotation.cpp:90</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 513af940c..000000000
--- a/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Function to test the correctness of the Tree Reversal." alt="" coords="5,55,49,80"/>
-<area shape="rect" id="Node000002" href="$d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" title="A Test to check an simple case." alt="" coords="97,5,184,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,56,94,35,96,40,50,61"/>
-<area shape="rect" id="Node000003" href="$d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" title="A Test to check an empty vector." alt="" coords="97,55,184,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="49,65,81,65,81,70,49,70"/>
-<area shape="rect" id="Node000004" href="$d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" title="A Test to check an invalid shift value." alt="" coords="97,104,184,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="50,74,96,95,94,100,48,79"/>
-</map>
diff --git a/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 395f0d66c..000000000
--- a/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-89afb8316765aced4aeb42408a152786
\ No newline at end of file
diff --git a/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index ddf331874..000000000
--- a/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="142pt" height="101pt"
- viewBox="0.00 0.00 142.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the correctness of the Tree Reversal.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-56.25 0,-56.25 0,-37 32.5,-37 32.5,-56.25"/>
-<text text-anchor="middle" x="16.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="134,-93.25 68.5,-93.25 68.5,-74 134,-74 134,-93.25"/>
-<text text-anchor="middle" x="101.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-53.58C42.57,-57.91 55.42,-63.64 67.3,-68.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.87,-72.13 76.43,-73.01 68.72,-65.74 65.87,-72.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="134,-56.25 68.5,-56.25 68.5,-37 134,-37 134,-56.25"/>
-<text text-anchor="middle" x="101.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-46.62C39.78,-46.62 48.31,-46.62 56.93,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.69,-50.13 66.69,-46.63 56.69,-43.13 56.69,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="134,-19.25 68.5,-19.25 68.5,0 134,0 134,-19.25"/>
-<text text-anchor="middle" x="101.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-39.67C42.57,-35.34 55.42,-29.61 67.3,-24.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.72,-27.51 76.43,-20.24 65.87,-21.12 68.72,-27.51"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index f762e1aee..000000000
--- a/d4/db6/reverse__binary__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="142pt" height="101pt"
- viewBox="0.00 0.00 142.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the correctness of the Tree Reversal.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-56.25 0,-56.25 0,-37 32.5,-37 32.5,-56.25"/>
-<text text-anchor="middle" x="16.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="134,-93.25 68.5,-93.25 68.5,-74 134,-74 134,-93.25"/>
-<text text-anchor="middle" x="101.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-53.58C42.57,-57.91 55.42,-63.64 67.3,-68.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.87,-72.13 76.43,-73.01 68.72,-65.74 65.87,-72.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="134,-56.25 68.5,-56.25 68.5,-37 134,-37 134,-56.25"/>
-<text text-anchor="middle" x="101.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-46.62C39.78,-46.62 48.31,-46.62 56.93,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.69,-50.13 66.69,-46.63 56.69,-43.13 56.69,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="134,-19.25 68.5,-19.25 68.5,0 134,0 134,-19.25"/>
-<text text-anchor="middle" x="101.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-39.67C42.57,-35.34 55.42,-29.61 67.3,-24.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.72,-27.51 76.43,-20.24 65.87,-21.12 68.72,-27.51"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index f1f6d069e..000000000
--- a/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="main function" alt="" coords="5,55,55,80"/>
-<area shape="rect" id="Node000002" href="$d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function to test the correctness of the Tree Reversal." alt="" coords="103,55,146,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,65,87,65,87,70,55,70"/>
-<area shape="rect" id="Node000003" href="$d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" title="A Test to check an simple case." alt="" coords="194,5,281,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="145,56,191,35,193,40,148,61"/>
-<area shape="rect" id="Node000004" href="$d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" title="A Test to check an empty vector." alt="" coords="194,55,281,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="146,65,179,65,179,70,146,70"/>
-<area shape="rect" id="Node000005" href="$d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" title="A Test to check an invalid shift value." alt="" coords="194,104,281,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="148,74,193,95,191,100,145,79"/>
-</map>
diff --git a/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 456e6ba72..000000000
--- a/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e07e69e93602db7aa4dab6f26b6ddceb
\ No newline at end of file
diff --git a/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 948e4d977..000000000
--- a/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="215pt" height="101pt"
- viewBox="0.00 0.00 215.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the correctness of the Tree Reversal.">
-<polygon fill="white" stroke="#666666" points="105.5,-56.25 73,-56.25 73,-37 105.5,-37 105.5,-56.25"/>
-<text text-anchor="middle" x="89.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-46.62C44.58,-46.62 53.31,-46.62 61.45,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-50.13 71.2,-46.63 61.2,-43.13 61.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="207,-93.25 141.5,-93.25 141.5,-74 207,-74 207,-93.25"/>
-<text text-anchor="middle" x="174.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-53.58C115.57,-57.91 128.42,-63.64 140.3,-68.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.87,-72.13 149.43,-73.01 141.72,-65.74 138.87,-72.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="207,-56.25 141.5,-56.25 141.5,-37 207,-37 207,-56.25"/>
-<text text-anchor="middle" x="174.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-46.62C112.78,-46.62 121.31,-46.62 129.93,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.69,-50.13 139.69,-46.63 129.69,-43.13 129.69,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="207,-19.25 141.5,-19.25 141.5,0 207,0 207,-19.25"/>
-<text text-anchor="middle" x="174.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-39.67C115.57,-35.34 128.42,-29.61 140.3,-24.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.72,-27.51 149.43,-20.24 138.87,-21.12 141.72,-27.51"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 883857e3f..000000000
--- a/d4/db6/reverse__binary__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="215pt" height="101pt"
- viewBox="0.00 0.00 215.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the correctness of the Tree Reversal.">
-<polygon fill="white" stroke="#666666" points="105.5,-56.25 73,-56.25 73,-37 105.5,-37 105.5,-56.25"/>
-<text text-anchor="middle" x="89.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-46.62C44.58,-46.62 53.31,-46.62 61.45,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-50.13 71.2,-46.63 61.2,-43.13 61.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="207,-93.25 141.5,-93.25 141.5,-74 207,-74 207,-93.25"/>
-<text text-anchor="middle" x="174.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-53.58C115.57,-57.91 128.42,-63.64 140.3,-68.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.87,-72.13 149.43,-73.01 141.72,-65.74 138.87,-72.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="207,-56.25 141.5,-56.25 141.5,-37 207,-37 207,-56.25"/>
-<text text-anchor="middle" x="174.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-46.62C112.78,-46.62 121.31,-46.62 129.93,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.69,-50.13 139.69,-46.63 129.69,-43.13 129.69,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="207,-19.25 141.5,-19.25 141.5,0 207,0 207,-19.25"/>
-<text text-anchor="middle" x="174.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-39.67C115.57,-35.34 128.42,-29.61 140.3,-24.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.72,-27.51 149.43,-20.24 138.87,-21.12 141.72,-27.51"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/db6/reverse__binary__tree_8cpp_source.html b/d4/db6/reverse__binary__tree_8cpp_source.html
new file mode 100644
index 000000000..0569fbd58
--- /dev/null
+++ b/d4/db6/reverse__binary__tree_8cpp_source.html
@@ -0,0 +1,359 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: operations_on_datastructures/reverse_binary_tree.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/db6/reverse__binary__tree_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">reverse_binary_tree.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/db6/reverse__binary__tree_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;queue&gt;</span>     </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a> {</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dc/dc5/namespacereverse__binary__tree.html">reverse_binary_tree</a> {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="foldopen" id="foldopen00034" data-start="{" data-end="};">
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">   34</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f">   35</a></span>    int64_t <a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f">data</a>;  </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352">   36</a></span>    <a class="code hl_struct" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a>* <a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352">left</a>;    </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">   37</a></span>    <a class="code hl_struct" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a>* <a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">right</a>;   </div>
+<div class="foldopen" id="foldopen00041" data-start="{" data-end="}">
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3">   41</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3">Node</a>(int64_t _data) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        <a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f">data</a> = _data;     </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        left = <span class="keyword">nullptr</span>;   </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">right</a> = <span class="keyword">nullptr</span>;  </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    }</div>
+</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>};</div>
+</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="foldopen" id="foldopen00052" data-start="{" data-end="};">
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">   52</a></span><span class="keyword">class </span><a class="code hl_class" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">BinaryTree</a> {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">   54</a></span>    <a class="code hl_struct" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a>* <a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>;  </div>
+<div class="foldopen" id="foldopen00065" data-start="{" data-end="}">
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">   65</a></span>    <a class="code hl_struct" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a>* <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(int64_t <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, <a class="code hl_struct" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a>* pivot) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="keywordflow">if</span> (pivot == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            <span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code hl_struct" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);  </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data &lt;= pivot-&gt;</a><a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            pivot-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352">left</a> =</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>                <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, pivot-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352">left</a>);  </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            pivot-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">right</a> =</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>                <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, pivot-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">right</a>);  </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        }</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="keywordflow">return</span> pivot;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00084" data-start="{" data-end="}">
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1">   84</a></span>    <a class="code hl_struct" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a>* <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(<a class="code hl_struct" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a>* pivot) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        <span class="keywordflow">if</span> (pivot == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            <span class="keywordflow">return</span> pivot;  </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        <a class="code hl_struct" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a>* temp = pivot-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352">left</a>;  </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        pivot-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352">left</a> = <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(pivot-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">right</a>);  </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        pivot-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">right</a> = <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(temp);         </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        <span class="keywordflow">return</span> pivot;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    }</div>
+</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56">BinaryTree</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">BinaryTree</a>&amp;) = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <a class="code hl_class" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">BinaryTree</a>&amp; operator=(<span class="keyword">const</span> <a class="code hl_class" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">BinaryTree</a>&amp;) = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56">  101</a></span>    <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56">BinaryTree</a>() { <a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <span class="keyword">nullptr</span>; }</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b">  105</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b">BinaryTree</a>(int64_t <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) { <a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <span class="keyword">new</span> <a class="code hl_struct" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>); }</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <a class="code hl_class" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">~BinaryTree</a>() {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        std::vector&lt;Node*&gt; nodes;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        nodes.emplace_back(<a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        <span class="keywordflow">while</span> (!nodes.empty()) {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>            <span class="keyword">const</span> <span class="keyword">auto</span> cur_node = nodes.back();</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>            nodes.pop_back();</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>            <span class="keywordflow">if</span> (cur_node) {</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>                nodes.emplace_back(cur_node-&gt;left);</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>                nodes.emplace_back(cur_node-&gt;right);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>                <span class="keyword">delete</span> cur_node;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>            }</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        }</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    }</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">  124</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">add</a>(int64_t <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) { <a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, <a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); }</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c">  128</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c">reverse</a>() { <a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(<a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); }</div>
+<div class="foldopen" id="foldopen00139" data-start="{" data-end="}">
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">  139</a></span>    std::vector&lt;int64_t&gt; <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>() {</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        std::vector&lt;int64_t&gt; <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;  </div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>            <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;  </div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        }</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        std::queue&lt;Node*&gt; nodes;  </div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        nodes.push(<a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>);         </div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        <span class="keywordflow">while</span> (!nodes.empty()) {</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>            <a class="code hl_struct" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a>* temp = nodes.front();  </div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>            <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>.push_back(temp-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f">data</a>);  </div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>            nodes.pop();                 </div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>            <span class="keywordflow">if</span> (temp-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352">left</a> != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>                nodes.push(temp-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352">left</a>);  </div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>            }</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>            <span class="keywordflow">if</span> (temp-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">right</a> != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>                nodes.push(temp-&gt;<a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">right</a>);  </div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>            }</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>        }  </div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00164" data-start="{" data-end="}">
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"><a class="line" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503">  164</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503">print</a>() {</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>()) {</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>            std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;  </div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>        }</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;  </div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    }</div>
+</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>};</div>
+</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span> </div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>}  <span class="comment">// namespace reverse_binary_tree</span></div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>}  <span class="comment">// namespace operations_on_datastructures</span></div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span> </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/df4/namespacetests.html">tests</a> {</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span><span class="keyword">using </span>operations_on_datastructures::reverse_binary_tree::</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    BinaryTree;  </div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">test1</a>() {</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    <a class="code hl_class" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">BinaryTree</a> bst;</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    std::vector&lt;int64_t&gt; pre_reversal, post_reversal;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 1\n&quot;</span>;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initializing tree with a single element (5)\n&quot;</span>;</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">add</a>(5);</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    pre_reversal = bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>();</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Before reversal: &quot;</span>;</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503">print</a>();</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;After reversal: &quot;</span>;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c">reverse</a>();</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    post_reversal = bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>();</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    assert(pre_reversal.size() ==</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>           post_reversal.size());  </div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    assert(pre_reversal.size() ==</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>           1);  </div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    assert(pre_reversal[0] ==</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>           post_reversal[0]);  </div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503">print</a>();</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>}</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">test2</a>() {</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    <a class="code hl_class" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">BinaryTree</a> bst;</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    std::vector&lt;int64_t&gt; pre_reversal, post_reversal;</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 2\n&quot;</span>;</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Creating empty tree (root points to NULL)\n&quot;</span>;</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    pre_reversal = bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>();</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Before reversal: &quot;</span>;</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503">print</a>();</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;After reversal: &quot;</span>;</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c">reverse</a>();</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    post_reversal = bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>();</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    assert(pre_reversal.size() ==</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>           post_reversal.size());  </div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    assert(pre_reversal.size() ==</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>           0);  </div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503">print</a>();</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>}</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">test3</a>() {</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    <a class="code hl_class" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">BinaryTree</a> bst;</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    std::vector&lt;int64_t&gt; pre_reversal, post_reversal;</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    std::vector&lt;int64_t&gt; pre_res = {4, 3, 6, 2, 5, 7, 1};</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    std::vector&lt;int64_t&gt; post_res = {4, 6, 3, 7, 5, 2, 1};</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 3\n&quot;</span>;</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Creating tree with elements (4, 6, 3, 2, 5, 7, 1)\n&quot;</span>;</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">add</a>(4);</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">add</a>(6);</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">add</a>(3);</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">add</a>(2);</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">add</a>(5);</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">add</a>(7);</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">add</a>(1);</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    pre_reversal = bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>();</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    assert(pre_reversal == pre_res);  </div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Before reversal: &quot;</span>;</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503">print</a>();</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;After reversal: &quot;</span>;</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c">reverse</a>();</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    post_reversal = bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>();</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    assert(post_reversal == post_res);  </div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    bst.<a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503">print</a>();</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>}</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>}  <span class="comment">// namespace tests</span></div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span> </div>
+<div class="foldopen" id="foldopen00260" data-start="{" data-end="}">
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"><a class="line" href="../../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  260</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a>();  </div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a>();  </div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a>();  </div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>}</div>
+</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span> </div>
+<div class="foldopen" id="foldopen00270" data-start="{" data-end="}">
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"><a class="line" href="../../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  270</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    <a class="code hl_function" href="../../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>}</div>
+</div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></div><div class="ttdoc">A Binary Tree class that implements a Binary Search Tree (BST) by default.</div><div class="ttdef"><b>Definition</b> <a href="#l00052">reverse_binary_tree.cpp:52</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_a1c0d27198372b36ef71bc58af8336b9c"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c">operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse</a></div><div class="ttdeci">void reverse()</div><div class="ttdef"><b>Definition</b> <a href="#l00128">reverse_binary_tree.cpp:128</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_a2e683b271d8d5cd63e0d09cf8aaa325c"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; get_level_order()</div><div class="ttdoc">Level order traversal of a tree consists of visiting its elements, top to bottom, left to right....</div><div class="ttdef"><b>Definition</b> <a href="#l00139">reverse_binary_tree.cpp:139</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_a534645d1aabdf1a7e5897c85376f173d"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">operations_on_datastructures::reverse_binary_tree::BinaryTree::add</a></div><div class="ttdeci">void add(int64_t data)</div><div class="ttdoc">Adds a new Node to the Binary Tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00124">reverse_binary_tree.cpp:124</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_a5cf972a2c994a4fa1a89fc77bd5ad503"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503">operations_on_datastructures::reverse_binary_tree::BinaryTree::print</a></div><div class="ttdeci">void print()</div><div class="ttdoc">Prints all of the elements in the tree to stdout level-by-level, using the get_level_order() function...</div><div class="ttdef"><b>Definition</b> <a href="#l00164">reverse_binary_tree.cpp:164</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_ab6a17a04aa93aaaef71e038e8cc2edeb"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">operations_on_datastructures::reverse_binary_tree::BinaryTree::root</a></div><div class="ttdeci">Node * root</div><div class="ttdoc">Pointer to root node of Binary Tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00054">reverse_binary_tree.cpp:54</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_abb44646a26a446efae7704c80efc011b"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b">operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree</a></div><div class="ttdeci">BinaryTree(int64_t data)</div><div class="ttdoc">Creates a BinaryTree with a root with an initial value.</div><div class="ttdef"><b>Definition</b> <a href="#l00105">reverse_binary_tree.cpp:105</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_abcb1cc8da7b6759dc92cbe0254697c56"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56">operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree</a></div><div class="ttdeci">BinaryTree()</div><div class="ttdoc">Creates a BinaryTree with a root pointing to NULL.</div><div class="ttdef"><b>Definition</b> <a href="#l00101">reverse_binary_tree.cpp:101</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_adb2b6be741b0500ee75d89b6d06b5d50"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">operations_on_datastructures::reverse_binary_tree::BinaryTree::insert</a></div><div class="ttdeci">Node * insert(int64_t data, Node *pivot)</div><div class="ttdoc">inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00065">reverse_binary_tree.cpp:65</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_af6f974381f523fdb981fc2d843bbf4a1"><div class="ttname"><a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1">operations_on_datastructures::reverse_binary_tree::BinaryTree::reverseBinaryTree</a></div><div class="ttdeci">Node * reverseBinaryTree(Node *pivot)</div><div class="ttdoc">Reverses a Binary Tree recursively by swapping the left and right subtrees and their children.</div><div class="ttdef"><b>Definition</b> <a href="#l00084">reverse_binary_tree.cpp:84</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="anamespaceoperations__on__datastructures_html"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></div><div class="ttdoc">for std::vector</div></div>
+<div class="ttc" id="anamespacereverse__binary__tree_html"><div class="ttname"><a href="../../dc/dc5/namespacereverse__binary__tree.html">reverse_binary_tree</a></div><div class="ttdoc">Functions for the Reverse a Binary Tree implementation.</div></div>
+<div class="ttc" id="anamespacetests_html"><div class="ttname"><a href="../../d9/df4/namespacetests.html">tests</a></div><div class="ttdoc">Testcases to check Union of Two Arrays.</div></div>
+<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00075">array_left_rotation.cpp:75</a></div></div>
+<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check an invalid shift value.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00105">array_left_rotation.cpp:105</a></div></div>
+<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an empty vector.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00090">array_left_rotation.cpp:90</a></div></div>
+<div class="ttc" id="areverse__binary__tree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of the Tree Reversal.</div><div class="ttdef"><b>Definition</b> <a href="#l00260">reverse_binary_tree.cpp:260</a></div></div>
+<div class="ttc" id="areverse__binary__tree_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition</b> <a href="#l00270">reverse_binary_tree.cpp:270</a></div></div>
+<div class="ttc" id="astructoperations__on__datastructures_1_1reverse__binary__tree_1_1_node_html"><div class="ttname"><a href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">operations_on_datastructures::reverse_binary_tree::Node</a></div><div class="ttdoc">A Node struct that represents a single node in a Binary Tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00034">reverse_binary_tree.cpp:34</a></div></div>
+<div class="ttc" id="astructoperations__on__datastructures_1_1reverse__binary__tree_1_1_node_html_a15dd7a0a7d9b1e8b2012c5161aecd6e3"><div class="ttname"><a href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3">operations_on_datastructures::reverse_binary_tree::Node::Node</a></div><div class="ttdeci">Node(int64_t _data)</div><div class="ttdoc">Creates a new Node with some initial data.</div><div class="ttdef"><b>Definition</b> <a href="#l00041">reverse_binary_tree.cpp:41</a></div></div>
+<div class="ttc" id="astructoperations__on__datastructures_1_1reverse__binary__tree_1_1_node_html_ab13a4dd92d54c11eca86edde3ef32256"><div class="ttname"><a href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">operations_on_datastructures::reverse_binary_tree::Node::right</a></div><div class="ttdeci">Node * right</div><div class="ttdoc">The Node's right child.</div><div class="ttdef"><b>Definition</b> <a href="#l00037">reverse_binary_tree.cpp:37</a></div></div>
+<div class="ttc" id="astructoperations__on__datastructures_1_1reverse__binary__tree_1_1_node_html_ae54953a75091532303bb08d55087077f"><div class="ttname"><a href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f">operations_on_datastructures::reverse_binary_tree::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The value of the Node.</div><div class="ttdef"><b>Definition</b> <a href="#l00035">reverse_binary_tree.cpp:35</a></div></div>
+<div class="ttc" id="astructoperations__on__datastructures_1_1reverse__binary__tree_1_1_node_html_aeb01a65e51df1e3bc5296cde8477c352"><div class="ttname"><a href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352">operations_on_datastructures::reverse_binary_tree::Node::left</a></div><div class="ttdeci">Node * left</div><div class="ttdoc">The Node's left child.</div><div class="ttdef"><b>Definition</b> <a href="#l00036">reverse_binary_tree.cpp:36</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><a class="el" href="../../d4/db6/reverse__binary__tree_8cpp.html">reverse_binary_tree.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/db6/struct_min_heap_node-members.html b/d4/db6/struct_min_heap_node-members.html
index 66bc491d9..adeabe0f5 100644
--- a/d4/db6/struct_min_heap_node-members.html
+++ b/d4/db6/struct_min_heap_node-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d4/db8/longest__substring__without__repeating__characters_8cpp.html b/d4/db8/longest__substring__without__repeating__characters_8cpp.html
index 4403f6634..835e3c322 100644
--- a/d4/db8/longest__substring__without__repeating__characters_8cpp.html
+++ b/d4/db8/longest__substring__without__repeating__characters_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/longest_substring_without_repeating_characters.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/longest_substring_without_repeating_characters.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for longest_substring_without_repeating_characters.cpp:
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/de5/longest__substring__without__repeating__characters_8cpp__incl.svg" width="463" height="126"><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">
+</div>
+<p><a href="../../d4/db8/longest__substring__without__repeating__characters_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d21/class_longest___substring.html">Longest_Substring</a></td></tr>
@@ -146,6 +165,8 @@ Functions</h2></td></tr>
 <p>Approach: 1) Initialize an unordered_map to track the frequency of characters. 2) Use a deque for pushing characters, and update the result deque (<code>res</code>) with the current deque (<code>temp</code>) whenever we find a longer substring. 3) Use a while loop to reduce the frequency from the front, incrementing <code>i</code>, and removing characters from the <code>temp</code> deque as we no longer need them. 4) Return <code>res.size()</code> as we are interested in the length of the longest substring.</p>
 <p>Time Complexity: O(N) Space Complexity: O(N)</p>
 <p>I hope this helps to understand. Thank you! </p><dl class="section author"><dt>Author</dt><dd><a href="../../github.com/ashish5kmax" target="_blank">Ashish Kumar Sahoo</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/db8/longest__substring__without__repeating__characters_8cpp_source.html">longest_substring_without_repeating_characters.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -164,17 +185,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on successful execution. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/db8/longest__substring__without__repeating__characters_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../d4/db8/longest__substring__without__repeating__characters_8cpp_source.html">longest_substring_without_repeating_characters.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  107</span>           {</div>
 <div class="line"><span class="lineno">  108</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  109</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  110</span>}</div>
-<div class="ttc" id="alongest__substring__without__repeating__characters_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> longest_substring_without_repeating_characters.cpp:92</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/db8/longest__substring__without__repeating__characters_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="579" height="192"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="alongest__substring__without__repeating__characters_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/db8/longest__substring__without__repeating__characters_8cpp_source.html#l00092">longest_substring_without_repeating_characters.cpp:92</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -202,6 +220,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/db8/longest__substring__without__repeating__characters_8cpp_source.html#l00092">92</a> of file <a class="el" href="../../d4/db8/longest__substring__without__repeating__characters_8cpp_source.html">longest_substring_without_repeating_characters.cpp</a>.</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_class" href="../../da/d21/class_longest___substring.html">Longest_Substring</a> soln;</div>
 <div class="line"><span class="lineno">   94</span>    assert(soln.<a class="code hl_function" href="../../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d">lengthOfLongestSubstring</a>(<span class="stringliteral">&quot;abcabcbb&quot;</span>) == 3);</div>
@@ -210,18 +230,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   97</span>    assert(soln.<a class="code hl_function" href="../../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d">lengthOfLongestSubstring</a>(<span class="stringliteral">&quot;&quot;</span>) == 0); <span class="comment">// Test case for empty string</span></div>
 <div class="line"><span class="lineno">   98</span>    assert(soln.<a class="code hl_function" href="../../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d">lengthOfLongestSubstring</a>(<span class="stringliteral">&quot;abcdef&quot;</span>) == 6); <span class="comment">// Test case for all unique characters</span></div>
 <div class="line"><span class="lineno">   99</span>    assert(soln.<a class="code hl_function" href="../../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d">lengthOfLongestSubstring</a>(<span class="stringliteral">&quot;a&quot;</span>) == 1); <span class="comment">// Single character</span></div>
-<div class="line"><span class="lineno">  100</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All test cases passed!&quot;</span> &lt;&lt; <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">  100</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  101</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="aclass_longest___substring_html"><div class="ttname"><a href="../../da/d21/class_longest___substring.html">Longest_Substring</a></div><div class="ttdoc">Class that solves the Longest Substring Without Repeating Characters problem.</div><div class="ttdef"><b>Definition</b> longest_substring_without_repeating_characters.cpp:37</div></div>
-<div class="ttc" id="aclass_longest___substring_html_af8a3672bc8d95e7da4f9a45e5e2e387d"><div class="ttname"><a href="../../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d">Longest_Substring::lengthOfLongestSubstring</a></div><div class="ttdeci">int lengthOfLongestSubstring(std::string s)</div><div class="ttdoc">Function to find the length of the longest substring without repeating characters.</div><div class="ttdef"><b>Definition</b> longest_substring_without_repeating_characters.cpp:44</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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/db8/longest__substring__without__repeating__characters_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="482" height="192"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclass_longest___substring_html"><div class="ttname"><a href="../../da/d21/class_longest___substring.html">Longest_Substring</a></div><div class="ttdoc">Class that solves the Longest Substring Without Repeating Characters problem.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/db8/longest__substring__without__repeating__characters_8cpp_source.html#l00037">longest_substring_without_repeating_characters.cpp:37</a></div></div>
+<div class="ttc" id="aclass_longest___substring_html_af8a3672bc8d95e7da4f9a45e5e2e387d"><div class="ttname"><a href="../../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d">Longest_Substring::lengthOfLongestSubstring</a></div><div class="ttdeci">int lengthOfLongestSubstring(std::string s)</div><div class="ttdoc">Function to find the length of the longest substring without repeating characters.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/db8/longest__substring__without__repeating__characters_8cpp_source.html#l00044">longest_substring_without_repeating_characters.cpp:44</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/db8/longest__substring__without__repeating__characters_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d4/db8/longest__substring__without__repeating__characters_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index a451ff9d1..000000000
--- a/d4/db8/longest__substring__without__repeating__characters_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,35,56,60"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="154,5,225,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,40,138,25,139,30,57,46"/>
-<area shape="rect" id="Node000003" href="$da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d" title="Function to find the length of the longest substring without repeating characters." alt="" coords="104,55,275,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="57,49,89,55,88,60,56,54"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="338,13,461,39"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="274,62,354,41,356,47,276,67"/>
-<area shape="poly" id="edge7_Node000003_Node000004" title=" " alt="" coords="245,52,322,33,324,38,246,57"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/deque/pop_front.html#" title=" " alt="" coords="328,63,472,88"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="275,73,312,73,312,78,275,78"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/deque/push_back.html#" title=" " alt="" coords="323,112,476,138"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="276,93,328,105,326,110,275,98"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/deque/size.html#" title=" " alt="" coords="342,161,457,187"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="225,94,271,121,324,148,338,153,336,158,322,153,269,126,222,99"/>
-</map>
diff --git a/d4/db8/longest__substring__without__repeating__characters_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d4/db8/longest__substring__without__repeating__characters_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index a26b6545b..000000000
--- a/d4/db8/longest__substring__without__repeating__characters_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ec4a64e645c08d440cf37b1dc5b42cb5
\ No newline at end of file
diff --git a/d4/db8/longest__substring__without__repeating__characters_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d4/db8/longest__substring__without__repeating__characters_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index 036bf0964..000000000
--- a/d4/db8/longest__substring__without__repeating__characters_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,165 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="361pt" height="144pt"
- viewBox="0.00 0.00 361.25 144.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 140.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-114.25 0,-114.25 0,-95 37.75,-95 37.75,-114.25"/>
-<text text-anchor="middle" x="18.88" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164.75,-136.25 111.25,-136.25 111.25,-117 164.75,-117 164.75,-136.25"/>
-<text text-anchor="middle" x="138" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.18,-108.06C54.6,-111.15 79.22,-115.77 99.77,-119.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.04,-123.06 109.52,-121.46 100.34,-116.18 99.04,-123.06"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d" target="_top" xlink:title="Function to find the length of the longest substring without repeating characters.">
-<polygon fill="white" stroke="#666666" points="202.25,-98.88 73.75,-98.88 73.75,-68.38 202.25,-68.38 202.25,-98.88"/>
-<text text-anchor="start" x="81.75" y="-85.38" font-family="Helvetica,sans-Serif" font-size="10.00">Longest_Substring::</text>
-<text text-anchor="middle" x="138" y="-74.12" font-family="Helvetica,sans-Serif" font-size="10.00">lengthOfLongestSubstring</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.18,-101.34C45.08,-100.11 53.44,-98.61 62.33,-97.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.67,-100.51 71.89,-95.3 61.43,-93.62 62.67,-100.51"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="341.62,-130.25 249.88,-130.25 249.88,-111 341.62,-111 341.62,-130.25"/>
-<text text-anchor="middle" x="295.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.35,-92.03C222.94,-96.62 244.93,-102.19 262.29,-107.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.94,-110.56 271.52,-110.15 263,-103.87 260.94,-110.56"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge7_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge7_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M179.92,-99.37C197.78,-104.37 219.01,-109.58 238.33,-113.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.46,-117.13 247.96,-115.75 238.89,-110.28 237.46,-117.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/pop_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="349.88,-93.25 241.62,-93.25 241.62,-74 349.88,-74 349.88,-93.25"/>
-<text text-anchor="middle" x="295.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::pop_front</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.35,-83.62C211.47,-83.62 220.86,-83.62 230.01,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.91,-87.13 239.91,-83.63 229.91,-80.13 229.91,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="353.25,-56.25 238.25,-56.25 238.25,-37 353.25,-37 353.25,-56.25"/>
-<text text-anchor="middle" x="295.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.35,-68.58C215.25,-65.51 228.69,-62.32 241.21,-59.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="242,-62.75 250.92,-57.04 240.39,-55.94 242,-62.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="338.62,-19.25 252.88,-19.25 252.88,0 338.62,0 338.62,-19.25"/>
-<text text-anchor="middle" x="295.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.56,-67.89C183.21,-55.76 211.77,-39.17 238.25,-27.62 241.6,-26.16 245.11,-24.76 248.66,-23.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="249.68,-26.79 257.95,-20.17 247.35,-20.18 249.68,-26.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/db8/longest__substring__without__repeating__characters_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d4/db8/longest__substring__without__repeating__characters_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index a939678c7..000000000
--- a/d4/db8/longest__substring__without__repeating__characters_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="361pt" height="144pt"
- viewBox="0.00 0.00 361.25 144.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 140.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-114.25 0,-114.25 0,-95 37.75,-95 37.75,-114.25"/>
-<text text-anchor="middle" x="18.88" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164.75,-136.25 111.25,-136.25 111.25,-117 164.75,-117 164.75,-136.25"/>
-<text text-anchor="middle" x="138" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.18,-108.06C54.6,-111.15 79.22,-115.77 99.77,-119.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.04,-123.06 109.52,-121.46 100.34,-116.18 99.04,-123.06"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d" target="_top" xlink:title="Function to find the length of the longest substring without repeating characters.">
-<polygon fill="white" stroke="#666666" points="202.25,-98.88 73.75,-98.88 73.75,-68.38 202.25,-68.38 202.25,-98.88"/>
-<text text-anchor="start" x="81.75" y="-85.38" font-family="Helvetica,sans-Serif" font-size="10.00">Longest_Substring::</text>
-<text text-anchor="middle" x="138" y="-74.12" font-family="Helvetica,sans-Serif" font-size="10.00">lengthOfLongestSubstring</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.18,-101.34C45.08,-100.11 53.44,-98.61 62.33,-97.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.67,-100.51 71.89,-95.3 61.43,-93.62 62.67,-100.51"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="341.62,-130.25 249.88,-130.25 249.88,-111 341.62,-111 341.62,-130.25"/>
-<text text-anchor="middle" x="295.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.35,-92.03C222.94,-96.62 244.93,-102.19 262.29,-107.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.94,-110.56 271.52,-110.15 263,-103.87 260.94,-110.56"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge7_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge7_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M179.92,-99.37C197.78,-104.37 219.01,-109.58 238.33,-113.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.46,-117.13 247.96,-115.75 238.89,-110.28 237.46,-117.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/pop_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="349.88,-93.25 241.62,-93.25 241.62,-74 349.88,-74 349.88,-93.25"/>
-<text text-anchor="middle" x="295.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::pop_front</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.35,-83.62C211.47,-83.62 220.86,-83.62 230.01,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.91,-87.13 239.91,-83.63 229.91,-80.13 229.91,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="353.25,-56.25 238.25,-56.25 238.25,-37 353.25,-37 353.25,-56.25"/>
-<text text-anchor="middle" x="295.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.35,-68.58C215.25,-65.51 228.69,-62.32 241.21,-59.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="242,-62.75 250.92,-57.04 240.39,-55.94 242,-62.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="338.62,-19.25 252.88,-19.25 252.88,0 338.62,0 338.62,-19.25"/>
-<text text-anchor="middle" x="295.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.56,-67.89C183.21,-55.76 211.77,-39.17 238.25,-27.62 241.6,-26.16 245.11,-24.76 248.66,-23.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="249.68,-26.79 257.95,-20.17 247.35,-20.18 249.68,-26.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/db8/longest__substring__without__repeating__characters_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/db8/longest__substring__without__repeating__characters_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 6ac5cd802..000000000
--- a/d4/db8/longest__substring__without__repeating__characters_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,18 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,35,55,60"/>
-<area shape="rect" id="Node000002" href="$d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,35,153,60"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,45,88,45,88,50,55,50"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="251,5,322,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,40,235,25,236,30,154,46"/>
-<area shape="rect" id="Node000004" href="$da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d" title="Function to find the length of the longest substring without repeating characters." alt="" coords="201,55,372,96"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="154,49,186,55,185,60,153,54"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="436,13,558,39"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="372,62,452,41,453,47,373,67"/>
-<area shape="poly" id="edge8_Node000004_Node000005" title=" " alt="" coords="342,52,420,33,421,38,343,57"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/deque/pop_front.html#" title=" " alt="" coords="425,63,569,88"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="372,73,409,73,409,78,372,78"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/deque/push_back.html#" title=" " alt="" coords="420,112,574,138"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="373,93,425,105,424,110,372,98"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/deque/size.html#" title=" " alt="" coords="440,161,554,187"/>
-<area shape="poly" id="edge7_Node000004_Node000008" title=" " alt="" coords="322,94,368,121,421,148,435,153,433,158,419,153,366,126,319,99"/>
-</map>
diff --git a/d4/db8/longest__substring__without__repeating__characters_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/db8/longest__substring__without__repeating__characters_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index cd17fb9e2..000000000
--- a/d4/db8/longest__substring__without__repeating__characters_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9a298f8fde636c70b4993bda1b8ba5bb
\ No newline at end of file
diff --git a/d4/db8/longest__substring__without__repeating__characters_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/db8/longest__substring__without__repeating__characters_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index c08e70978..000000000
--- a/d4/db8/longest__substring__without__repeating__characters_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,183 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="434pt" height="144pt"
- viewBox="0.00 0.00 434.25 144.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 140.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-114.25 0,-114.25 0,-95 37,-95 37,-114.25"/>
-<text text-anchor="middle" x="18.5" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-114.25 73,-114.25 73,-95 110.75,-95 110.75,-114.25"/>
-<text text-anchor="middle" x="91.88" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-104.62C44.55,-104.62 53.37,-104.62 61.69,-104.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-108.13 71.43,-104.63 61.43,-101.13 61.43,-108.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.75,-136.25 184.25,-136.25 184.25,-117 237.75,-117 237.75,-136.25"/>
-<text text-anchor="middle" x="211" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.18,-108.06C127.6,-111.15 152.22,-115.77 172.77,-119.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.04,-123.06 182.52,-121.46 173.34,-116.18 172.04,-123.06"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d" target="_top" xlink:title="Function to find the length of the longest substring without repeating characters.">
-<polygon fill="white" stroke="#666666" points="275.25,-98.88 146.75,-98.88 146.75,-68.38 275.25,-68.38 275.25,-98.88"/>
-<text text-anchor="start" x="154.75" y="-85.38" font-family="Helvetica,sans-Serif" font-size="10.00">Longest_Substring::</text>
-<text text-anchor="middle" x="211" y="-74.12" font-family="Helvetica,sans-Serif" font-size="10.00">lengthOfLongestSubstring</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.18,-101.34C118.08,-100.11 126.44,-98.61 135.33,-97.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.67,-100.51 144.89,-95.3 134.43,-93.62 135.67,-100.51"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="414.62,-130.25 322.88,-130.25 322.88,-111 414.62,-111 414.62,-130.25"/>
-<text text-anchor="middle" x="368.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.35,-92.03C295.94,-96.62 317.93,-102.19 335.29,-107.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.94,-110.56 344.52,-110.15 336,-103.87 333.94,-110.56"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge8_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge8_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M252.92,-99.37C270.78,-104.37 292.01,-109.58 311.33,-113.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="310.46,-117.13 320.96,-115.75 311.89,-110.28 310.46,-117.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/pop_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="422.88,-93.25 314.62,-93.25 314.62,-74 422.88,-74 422.88,-93.25"/>
-<text text-anchor="middle" x="368.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::pop_front</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.35,-83.62C284.47,-83.62 293.86,-83.62 303.01,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="302.91,-87.13 312.91,-83.63 302.91,-80.13 302.91,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="426.25,-56.25 311.25,-56.25 311.25,-37 426.25,-37 426.25,-56.25"/>
-<text text-anchor="middle" x="368.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.35,-68.58C288.25,-65.51 301.69,-62.32 314.21,-59.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315,-62.75 323.92,-57.04 313.39,-55.94 315,-62.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="411.62,-19.25 325.88,-19.25 325.88,0 411.62,0 411.62,-19.25"/>
-<text text-anchor="middle" x="368.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M236.56,-67.89C256.21,-55.76 284.77,-39.17 311.25,-27.62 314.6,-26.16 318.11,-24.76 321.66,-23.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.68,-26.79 330.95,-20.17 320.35,-20.18 322.68,-26.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/db8/longest__substring__without__repeating__characters_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d4/db8/longest__substring__without__repeating__characters_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index be17519b0..000000000
--- a/d4/db8/longest__substring__without__repeating__characters_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,157 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="434pt" height="144pt"
- viewBox="0.00 0.00 434.25 144.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 140.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-114.25 0,-114.25 0,-95 37,-95 37,-114.25"/>
-<text text-anchor="middle" x="18.5" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-114.25 73,-114.25 73,-95 110.75,-95 110.75,-114.25"/>
-<text text-anchor="middle" x="91.88" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-104.62C44.55,-104.62 53.37,-104.62 61.69,-104.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-108.13 71.43,-104.63 61.43,-101.13 61.43,-108.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.75,-136.25 184.25,-136.25 184.25,-117 237.75,-117 237.75,-136.25"/>
-<text text-anchor="middle" x="211" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.18,-108.06C127.6,-111.15 152.22,-115.77 172.77,-119.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.04,-123.06 182.52,-121.46 173.34,-116.18 172.04,-123.06"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d" target="_top" xlink:title="Function to find the length of the longest substring without repeating characters.">
-<polygon fill="white" stroke="#666666" points="275.25,-98.88 146.75,-98.88 146.75,-68.38 275.25,-68.38 275.25,-98.88"/>
-<text text-anchor="start" x="154.75" y="-85.38" font-family="Helvetica,sans-Serif" font-size="10.00">Longest_Substring::</text>
-<text text-anchor="middle" x="211" y="-74.12" font-family="Helvetica,sans-Serif" font-size="10.00">lengthOfLongestSubstring</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.18,-101.34C118.08,-100.11 126.44,-98.61 135.33,-97.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.67,-100.51 144.89,-95.3 134.43,-93.62 135.67,-100.51"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="414.62,-130.25 322.88,-130.25 322.88,-111 414.62,-111 414.62,-130.25"/>
-<text text-anchor="middle" x="368.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.35,-92.03C295.94,-96.62 317.93,-102.19 335.29,-107.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.94,-110.56 344.52,-110.15 336,-103.87 333.94,-110.56"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge8_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge8_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M252.92,-99.37C270.78,-104.37 292.01,-109.58 311.33,-113.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="310.46,-117.13 320.96,-115.75 311.89,-110.28 310.46,-117.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/pop_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="422.88,-93.25 314.62,-93.25 314.62,-74 422.88,-74 422.88,-93.25"/>
-<text text-anchor="middle" x="368.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::pop_front</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.35,-83.62C284.47,-83.62 293.86,-83.62 303.01,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="302.91,-87.13 312.91,-83.63 302.91,-80.13 302.91,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="426.25,-56.25 311.25,-56.25 311.25,-37 426.25,-37 426.25,-56.25"/>
-<text text-anchor="middle" x="368.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.35,-68.58C288.25,-65.51 301.69,-62.32 314.21,-59.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315,-62.75 323.92,-57.04 313.39,-55.94 315,-62.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="411.62,-19.25 325.88,-19.25 325.88,0 411.62,0 411.62,-19.25"/>
-<text text-anchor="middle" x="368.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M236.56,-67.89C256.21,-55.76 284.77,-39.17 311.25,-27.62 314.6,-26.16 318.11,-24.76 321.66,-23.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.68,-26.79 330.95,-20.17 320.35,-20.18 322.68,-26.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/db8/longest__substring__without__repeating__characters_8cpp_source.html b/d4/db8/longest__substring__without__repeating__characters_8cpp_source.html
new file mode 100644
index 000000000..61983e1fc
--- /dev/null
+++ b/d4/db8/longest__substring__without__repeating__characters_8cpp_source.html
@@ -0,0 +1,217 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/longest_substring_without_repeating_characters.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/db8/longest__substring__without__repeating__characters_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">longest_substring_without_repeating_characters.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/db8/longest__substring__without__repeating__characters_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;iostream&gt;</span>        <span class="comment">// for IO Operations</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;unordered_map&gt;</span>   <span class="comment">// for std::unordered_map</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;deque&gt;</span>           <span class="comment">// for std::deque</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;string&gt;</span>          <span class="comment">// for string class/string datatype which is taken as input</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;cassert&gt;</span>         <span class="comment">// for assert</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="};">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../da/d21/class_longest___substring.html">   37</a></span><span class="keyword">class </span><a class="code hl_class" href="../../da/d21/class_longest___substring.html">Longest_Substring</a> {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00044" data-start="{" data-end="}">
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="../../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d">   44</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d">lengthOfLongestSubstring</a>(std::string s) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="comment">// If the size of string is 1, then it will be the answer.</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">if</span> (s.size() == 1) <span class="keywordflow">return</span> 1;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="comment">// Map used to store the character frequency.</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        std::unordered_map&lt;char, int&gt; m;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordtype">int</span> n = s.length();</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        <span class="comment">// Deque to remove from back if repeating characters are present.</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        std::deque&lt;char&gt; temp;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        std::deque&lt;char&gt; res;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="keywordtype">int</span> i, j;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        <span class="comment">// Sliding window approach using two pointers.</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordflow">for</span> (i = 0, j = 0; i &lt; n &amp;&amp; j &lt; n;) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            m[s[j]]++;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            <span class="comment">// If repeating character found, update result and remove from the front.</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            <span class="keywordflow">if</span> (m[s[j]] &gt; 1) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>                <span class="keywordflow">if</span> (temp.size() &gt; res.size()) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>                    res = temp;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>                }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>                <span class="keywordflow">while</span> (m[s[j]] &gt; 1) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                    temp.pop_front();</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>                    m[s[i]]--;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>                    i++;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>                }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            }</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            <span class="comment">// Add the current character to the deque.</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            temp.push_back(s[j]);</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>            j++;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        <span class="comment">// Final check to update result.</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="keywordflow">if</span> (temp.size() &gt; res.size()) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>            res = temp;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        }</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        <span class="keywordflow">return</span> res.size();  <span class="comment">// Return the length of the longest substring.</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    }</div>
+</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>};</div>
+</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="foldopen" id="foldopen00092" data-start="{" data-end="}">
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="../../d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">   92</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <a class="code hl_class" href="../../da/d21/class_longest___substring.html">Longest_Substring</a> soln;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    assert(soln.<a class="code hl_function" href="../../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d">lengthOfLongestSubstring</a>(<span class="stringliteral">&quot;abcabcbb&quot;</span>) == 3);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    assert(soln.<a class="code hl_function" href="../../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d">lengthOfLongestSubstring</a>(<span class="stringliteral">&quot;bbbbb&quot;</span>) == 1);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    assert(soln.<a class="code hl_function" href="../../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d">lengthOfLongestSubstring</a>(<span class="stringliteral">&quot;pwwkew&quot;</span>) == 3);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    assert(soln.<a class="code hl_function" href="../../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d">lengthOfLongestSubstring</a>(<span class="stringliteral">&quot;&quot;</span>) == 0); <span class="comment">// Test case for empty string</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    assert(soln.<a class="code hl_function" href="../../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d">lengthOfLongestSubstring</a>(<span class="stringliteral">&quot;abcdef&quot;</span>) == 6); <span class="comment">// Test case for all unique characters</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    assert(soln.<a class="code hl_function" href="../../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d">lengthOfLongestSubstring</a>(<span class="stringliteral">&quot;a&quot;</span>) == 1); <span class="comment">// Single character</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>}</div>
+</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="foldopen" id="foldopen00107" data-start="{" data-end="}">
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"><a class="line" href="../../d4/db8/longest__substring__without__repeating__characters_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  107</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/db8/longest__substring__without__repeating__characters_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <a class="code hl_function" href="../../d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>}</div>
+</div>
+<div class="ttc" id="aclass_longest___substring_html"><div class="ttname"><a href="../../da/d21/class_longest___substring.html">Longest_Substring</a></div><div class="ttdoc">Class that solves the Longest Substring Without Repeating Characters problem.</div><div class="ttdef"><b>Definition</b> <a href="#l00037">longest_substring_without_repeating_characters.cpp:37</a></div></div>
+<div class="ttc" id="aclass_longest___substring_html_af8a3672bc8d95e7da4f9a45e5e2e387d"><div class="ttname"><a href="../../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d">Longest_Substring::lengthOfLongestSubstring</a></div><div class="ttdeci">int lengthOfLongestSubstring(std::string s)</div><div class="ttdoc">Function to find the length of the longest substring without repeating characters.</div><div class="ttdef"><b>Definition</b> <a href="#l00044">longest_substring_without_repeating_characters.cpp:44</a></div></div>
+<div class="ttc" id="alongest__substring__without__repeating__characters_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d4/db8/longest__substring__without__repeating__characters_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> <a href="#l00092">longest_substring_without_repeating_characters.cpp:92</a></div></div>
+<div class="ttc" id="alongest__substring__without__repeating__characters_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/db8/longest__substring__without__repeating__characters_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00107">longest_substring_without_repeating_characters.cpp:107</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../d4/db8/longest__substring__without__repeating__characters_8cpp.html">longest_substring_without_repeating_characters.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/db9/namespacencr__modulo__p.html b/d4/db9/namespacencr__modulo__p.html
index e371c3d7d..180b56cf0 100644
--- a/d4/db9/namespacencr__modulo__p.html
+++ b/d4/db9/namespacencr__modulo__p.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ncr_modulo_p Namespace Reference</title>
+<title>TheAlgorithms/C++: ncr_modulo_p Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d4/dcb/classstack__coll__graph.map b/d4/dcb/classstack__coll__graph.map
index e9fff77f7..325e7b916 100644
--- a/d4/dcb/classstack__coll__graph.map
+++ b/d4/dcb/classstack__coll__graph.map
@@ -1,15 +1,13 @@
 <map id="stack&lt; ValueType &gt;" name="stack&lt; ValueType &gt;">
-<area shape="rect" id="Node000001" title="for std::invalid_argument" alt="" coords="360,213,498,238"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="227,109,378,150"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="338,158,375,187,411,210,408,214,372,191,335,162"/>
-<area shape="rect" id="Node000003" href="$db/d8b/struct_node.html" title=" " alt="" coords="179,213,319,238"/>
-<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="286,164,258,214,253,211,282,162"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="243,197,248,173,268,149,272,152,252,175,248,198"/>
-<area shape="rect" id="Node000004" href="$db/d8b/struct_node.html" title=" " alt="" coords="13,116,149,142"/>
-<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="117,148,229,210,226,215,115,152"/>
-<area shape="poly" id="edge6_Node000004_Node000004" title=" " alt="" coords="166,120,176,129,168,138,150,141,149,136,165,133,171,129,163,125"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="5,5,157,46"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="84,61,84,116,78,116,78,61"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/size_t.html" title=" " alt="" coords="405,116,488,142"/>
-<area shape="poly" id="edge7_Node000001_Node000006" title=" " alt="" coords="444,158,434,213,429,212,439,157"/>
+<area shape="rect" id="Node000001" title="for std::invalid_argument" alt="" coords="5,213,143,238"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="78,109,230,150"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="97,161,85,175,77,194,76,213,71,212,72,193,80,172,94,158"/>
+<area shape="rect" id="Node000003" href="$db/d8b/struct_node.html" title=" " alt="" coords="167,213,306,238"/>
+<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="160,164,171,187,185,200,202,210,199,214,182,204,167,190,155,166"/>
+<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="220,201,201,175,177,152,181,148,205,172,224,198"/>
+<area shape="rect" id="Node000004" href="$db/d8b/struct_node.html" title=" " alt="" coords="254,116,390,142"/>
+<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="303,155,250,214,246,210,299,152"/>
+<area shape="poly" id="edge6_Node000004_Node000004" title=" " alt="" coords="407,120,417,129,409,138,391,141,390,136,406,133,412,129,404,125"/>
+<area shape="rect" id="Node000005" title=" " alt="" coords="246,5,398,46"/>
+<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="325,61,325,116,319,116,319,61"/>
 </map>
diff --git a/d4/dcb/classstack__coll__graph.md5 b/d4/dcb/classstack__coll__graph.md5
index 6759d082b..453c6e72c 100644
--- a/d4/dcb/classstack__coll__graph.md5
+++ b/d4/dcb/classstack__coll__graph.md5
@@ -1 +1 @@
-4b8921eaa0d0947d3209f9144af1d774
\ No newline at end of file
+82c39249e4353019f8c703f064c1c6c7
\ No newline at end of file
diff --git a/d4/dcb/classstack__coll__graph.svg b/d4/dcb/classstack__coll__graph.svg
index df336405d..33b1ace2b 100644
--- a/d4/dcb/classstack__coll__graph.svg
+++ b/d4/dcb/classstack__coll__graph.svg
@@ -4,8 +4,8 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: stack&lt; ValueType &gt; Pages: 1 -->
-<svg width="377pt" height="183pt"
- viewBox="0.00 0.00 377.25 182.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="336pt" height="183pt"
+ viewBox="0.00 0.00 336.38 182.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
 <svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
@@ -23,18 +23,18 @@
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="for std::invalid_argument">
-<polygon fill="#999999" stroke="#666666" points="369.25,-19.25 266.25,-19.25 266.25,0 369.25,0 369.25,-19.25"/>
-<text text-anchor="middle" x="317.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack&lt; ValueType &gt;</text>
+<polygon fill="#999999" stroke="#666666" points="103,-19.25 0,-19.25 0,0 103,0 103,-19.25"/>
+<text text-anchor="middle" x="51.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack&lt; ValueType &gt;</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279.5,-97 166,-97 166,-66.5 279.5,-66.5 279.5,-97"/>
-<text text-anchor="start" x="174" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Node</text>
-<text text-anchor="middle" x="222.75" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; value_type &gt; &gt;</text>
+<g id="a_Node000002"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="168.25,-97 54.75,-97 54.75,-66.5 168.25,-66.5 168.25,-97"/>
+<text text-anchor="start" x="62.75" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Node</text>
+<text text-anchor="middle" x="111.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; value_type &gt; &gt;</text>
 </a>
 </g>
 </g>
@@ -42,18 +42,18 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M248.41,-58.77C257.01,-51.68 266.77,-43.93 276,-37.25 284.64,-31 294.7,-24.56 302.79,-19.58"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="246.21,-56.05 240.78,-65.15 250.69,-61.42 246.21,-56.05"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M67.62,-59.27C63.86,-56.08 60.47,-52.5 57.75,-48.5 51.91,-39.9 50.86,-27.72 50.94,-19.51"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="65.51,-62.07 75.65,-65.12 69.63,-56.41 65.51,-62.07"/>
 </a>
 </g>
-<text text-anchor="middle" x="297.38" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> stackTop</text>
+<text text-anchor="middle" x="79.12" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> stackTop</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
 <g id="a_Node000003"><a xlink:href="../../db/d8b/struct_node.html" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235,-19.25 130.5,-19.25 130.5,0 235,0 235,-19.25"/>
-<text text-anchor="middle" x="182.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Node&lt; value_type &gt;</text>
+<polygon fill="white" stroke="#666666" points="225.75,-19.25 121.25,-19.25 121.25,0 225.75,0 225.75,-19.25"/>
+<text text-anchor="middle" x="173.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Node&lt; value_type &gt;</text>
 </a>
 </g>
 </g>
@@ -61,28 +61,28 @@
 <g id="edge3_Node000003_Node000002" class="edge">
 <title>Node2&#45;&gt;Node3</title>
 <g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M208.93,-56.52C201.59,-43.66 193.03,-28.64 187.75,-19.38"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="205.72,-57.95 213.71,-64.91 211.8,-54.48 205.72,-57.95"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M114.41,-55.12C116.08,-48.79 118.69,-42.37 122.75,-37.25 128.87,-29.53 137.85,-23.8 146.55,-19.68"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="111.04,-54.14 112.59,-64.62 117.91,-55.46 111.04,-54.14"/>
 </a>
 </g>
-<text text-anchor="middle" x="214.82" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> next</text>
+<text text-anchor="middle" x="133.62" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> next</text>
 </g>
 <!-- Node3&#45;&gt;Node2 -->
 <g id="edge2_Node000002_Node000003" class="edge">
 <title>Node3&#45;&gt;Node2</title>
 <g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M180.03,-30.75C180.03,-36.71 180.88,-43.09 183.5,-48.5 186.81,-55.33 192.32,-61.2 198.19,-66"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="183.5,-31.28 180.79,-21.04 176.52,-30.74 183.5,-31.28"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M162.58,-29.33C158.5,-35.68 153.62,-42.65 148.5,-48.5 143,-54.79 136.29,-60.98 130.1,-66.24"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="165.55,-31.17 167.77,-20.81 159.58,-27.53 165.55,-31.17"/>
 </a>
 </g>
-<text text-anchor="middle" x="190.62" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> ptr</text>
+<text text-anchor="middle" x="164.05" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> ptr</text>
 </g>
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
 <g id="a_Node000004"><a xlink:href="../../db/d8b/struct_node.html" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="107.88,-91.38 5.62,-91.38 5.62,-72.12 107.88,-72.12 107.88,-91.38"/>
-<text text-anchor="middle" x="56.75" y="-77.88" font-family="Helvetica,sans-Serif" font-size="10.00">Node&lt; ValueType &gt;</text>
+<polygon fill="white" stroke="#666666" points="288.62,-91.38 186.38,-91.38 186.38,-72.12 288.62,-72.12 288.62,-91.38"/>
+<text text-anchor="middle" x="237.5" y="-77.88" font-family="Helvetica,sans-Serif" font-size="10.00">Node&lt; ValueType &gt;</text>
 </a>
 </g>
 </g>
@@ -90,29 +90,29 @@
 <g id="edge4_Node000003_Node000004" class="edge">
 <title>Node4&#45;&gt;Node3</title>
 <g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M82.94,-66.17C108.15,-52.14 145.46,-31.38 166.6,-19.61"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="81.32,-63.07 74.29,-70.99 84.73,-69.19 81.32,-63.07"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M221.87,-63.62C209.2,-49.74 191.85,-30.73 181.74,-19.66"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="219.05,-65.72 228.37,-70.75 224.22,-61 219.05,-65.72"/>
 </a>
 </g>
-<text text-anchor="middle" x="145.62" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> next</text>
+<text text-anchor="middle" x="218.29" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> next</text>
 </g>
 <!-- Node4&#45;&gt;Node4 -->
 <g id="edge6_Node000004_Node000004" class="edge">
 <title>Node4&#45;&gt;Node4</title>
 <g id="a_edge6_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M119.38,-86.92C123.43,-85.71 125.88,-83.99 125.88,-81.75 125.88,-77.88 118.56,-75.55 108.3,-74.76"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="119.09,-83.42 109.79,-88.49 120.23,-90.33 119.09,-83.42"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M300.13,-86.92C304.18,-85.71 306.62,-83.99 306.62,-81.75 306.62,-77.88 299.31,-75.55 289.05,-74.76"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="299.84,-83.42 290.54,-88.49 300.98,-90.33 299.84,-83.42"/>
 </a>
 </g>
-<text text-anchor="middle" x="136.75" y="-77.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> next</text>
+<text text-anchor="middle" x="317.5" y="-77.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> next</text>
 </g>
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="113.5,-174.75 0,-174.75 0,-144.25 113.5,-144.25 113.5,-174.75"/>
-<text text-anchor="start" x="8" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Node</text>
-<text text-anchor="middle" x="56.75" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; ValueType &gt; &gt;</text>
+<g id="a_Node000005"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="294.25,-174.75 180.75,-174.75 180.75,-144.25 294.25,-144.25 294.25,-174.75"/>
+<text text-anchor="start" x="188.75" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Node</text>
+<text text-anchor="middle" x="237.5" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; ValueType &gt; &gt;</text>
 </a>
 </g>
 </g>
@@ -120,30 +120,11 @@
 <g id="edge5_Node000004_Node000005" class="edge">
 <title>Node5&#45;&gt;Node4</title>
 <g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M56.75,-132.73C56.75,-118.47 56.75,-101.66 56.75,-91.62"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="53.25,-132.38 56.75,-142.38 60.25,-132.38 53.25,-132.38"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M237.5,-132.73C237.5,-118.47 237.5,-101.66 237.5,-91.62"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="234,-132.38 237.5,-142.38 241,-132.38 234,-132.38"/>
 </a>
 </g>
-<text text-anchor="middle" x="67.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> next</text>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="361.62,-91.38 299.88,-91.38 299.88,-72.12 361.62,-72.12 361.62,-91.38"/>
-<text text-anchor="middle" x="330.75" y="-77.88" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node1 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node6&#45;&gt;Node1</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M327.05,-60.78C324.54,-47.24 321.34,-29.99 319.42,-19.66"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="323.56,-61.19 328.83,-70.38 330.45,-59.91 323.56,-61.19"/>
-</a>
-</g>
-<text text-anchor="middle" x="335.14" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> size</text>
+<text text-anchor="middle" x="248.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> next</text>
 </g>
 </g>
 </svg>
diff --git a/d4/dcb/classstack__coll__graph_org.svg b/d4/dcb/classstack__coll__graph_org.svg
index dc4befc08..4ce47adee 100644
--- a/d4/dcb/classstack__coll__graph_org.svg
+++ b/d4/dcb/classstack__coll__graph_org.svg
@@ -4,26 +4,26 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: stack&lt; ValueType &gt; Pages: 1 -->
-<svg width="377pt" height="183pt"
- viewBox="0.00 0.00 377.25 182.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="336pt" height="183pt"
+ viewBox="0.00 0.00 336.38 182.75" 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 178.75)">
 <title>stack&lt; ValueType &gt;</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="for std::invalid_argument">
-<polygon fill="#999999" stroke="#666666" points="369.25,-19.25 266.25,-19.25 266.25,0 369.25,0 369.25,-19.25"/>
-<text text-anchor="middle" x="317.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack&lt; ValueType &gt;</text>
+<polygon fill="#999999" stroke="#666666" points="103,-19.25 0,-19.25 0,0 103,0 103,-19.25"/>
+<text text-anchor="middle" x="51.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack&lt; ValueType &gt;</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279.5,-97 166,-97 166,-66.5 279.5,-66.5 279.5,-97"/>
-<text text-anchor="start" x="174" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Node</text>
-<text text-anchor="middle" x="222.75" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; value_type &gt; &gt;</text>
+<g id="a_Node000002"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="168.25,-97 54.75,-97 54.75,-66.5 168.25,-66.5 168.25,-97"/>
+<text text-anchor="start" x="62.75" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Node</text>
+<text text-anchor="middle" x="111.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; value_type &gt; &gt;</text>
 </a>
 </g>
 </g>
@@ -31,18 +31,18 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M248.41,-58.77C257.01,-51.68 266.77,-43.93 276,-37.25 284.64,-31 294.7,-24.56 302.79,-19.58"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="246.21,-56.05 240.78,-65.15 250.69,-61.42 246.21,-56.05"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M67.62,-59.27C63.86,-56.08 60.47,-52.5 57.75,-48.5 51.91,-39.9 50.86,-27.72 50.94,-19.51"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="65.51,-62.07 75.65,-65.12 69.63,-56.41 65.51,-62.07"/>
 </a>
 </g>
-<text text-anchor="middle" x="297.38" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> stackTop</text>
+<text text-anchor="middle" x="79.12" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> stackTop</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
 <g id="a_Node000003"><a xlink:href="../../db/d8b/struct_node.html" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235,-19.25 130.5,-19.25 130.5,0 235,0 235,-19.25"/>
-<text text-anchor="middle" x="182.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Node&lt; value_type &gt;</text>
+<polygon fill="white" stroke="#666666" points="225.75,-19.25 121.25,-19.25 121.25,0 225.75,0 225.75,-19.25"/>
+<text text-anchor="middle" x="173.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Node&lt; value_type &gt;</text>
 </a>
 </g>
 </g>
@@ -50,28 +50,28 @@
 <g id="edge3_Node000003_Node000002" class="edge">
 <title>Node2&#45;&gt;Node3</title>
 <g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M208.93,-56.52C201.59,-43.66 193.03,-28.64 187.75,-19.38"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="205.72,-57.95 213.71,-64.91 211.8,-54.48 205.72,-57.95"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M114.41,-55.12C116.08,-48.79 118.69,-42.37 122.75,-37.25 128.87,-29.53 137.85,-23.8 146.55,-19.68"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="111.04,-54.14 112.59,-64.62 117.91,-55.46 111.04,-54.14"/>
 </a>
 </g>
-<text text-anchor="middle" x="214.82" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> next</text>
+<text text-anchor="middle" x="133.62" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> next</text>
 </g>
 <!-- Node3&#45;&gt;Node2 -->
 <g id="edge2_Node000002_Node000003" class="edge">
 <title>Node3&#45;&gt;Node2</title>
 <g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M180.03,-30.75C180.03,-36.71 180.88,-43.09 183.5,-48.5 186.81,-55.33 192.32,-61.2 198.19,-66"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="183.5,-31.28 180.79,-21.04 176.52,-30.74 183.5,-31.28"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M162.58,-29.33C158.5,-35.68 153.62,-42.65 148.5,-48.5 143,-54.79 136.29,-60.98 130.1,-66.24"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="165.55,-31.17 167.77,-20.81 159.58,-27.53 165.55,-31.17"/>
 </a>
 </g>
-<text text-anchor="middle" x="190.62" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> ptr</text>
+<text text-anchor="middle" x="164.05" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> ptr</text>
 </g>
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
 <g id="a_Node000004"><a xlink:href="../../db/d8b/struct_node.html" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="107.88,-91.38 5.62,-91.38 5.62,-72.12 107.88,-72.12 107.88,-91.38"/>
-<text text-anchor="middle" x="56.75" y="-77.88" font-family="Helvetica,sans-Serif" font-size="10.00">Node&lt; ValueType &gt;</text>
+<polygon fill="white" stroke="#666666" points="288.62,-91.38 186.38,-91.38 186.38,-72.12 288.62,-72.12 288.62,-91.38"/>
+<text text-anchor="middle" x="237.5" y="-77.88" font-family="Helvetica,sans-Serif" font-size="10.00">Node&lt; ValueType &gt;</text>
 </a>
 </g>
 </g>
@@ -79,29 +79,29 @@
 <g id="edge4_Node000003_Node000004" class="edge">
 <title>Node4&#45;&gt;Node3</title>
 <g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M82.94,-66.17C108.15,-52.14 145.46,-31.38 166.6,-19.61"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="81.32,-63.07 74.29,-70.99 84.73,-69.19 81.32,-63.07"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M221.87,-63.62C209.2,-49.74 191.85,-30.73 181.74,-19.66"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="219.05,-65.72 228.37,-70.75 224.22,-61 219.05,-65.72"/>
 </a>
 </g>
-<text text-anchor="middle" x="145.62" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> next</text>
+<text text-anchor="middle" x="218.29" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> next</text>
 </g>
 <!-- Node4&#45;&gt;Node4 -->
 <g id="edge6_Node000004_Node000004" class="edge">
 <title>Node4&#45;&gt;Node4</title>
 <g id="a_edge6_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M119.38,-86.92C123.43,-85.71 125.88,-83.99 125.88,-81.75 125.88,-77.88 118.56,-75.55 108.3,-74.76"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="119.09,-83.42 109.79,-88.49 120.23,-90.33 119.09,-83.42"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M300.13,-86.92C304.18,-85.71 306.62,-83.99 306.62,-81.75 306.62,-77.88 299.31,-75.55 289.05,-74.76"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="299.84,-83.42 290.54,-88.49 300.98,-90.33 299.84,-83.42"/>
 </a>
 </g>
-<text text-anchor="middle" x="136.75" y="-77.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> next</text>
+<text text-anchor="middle" x="317.5" y="-77.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> next</text>
 </g>
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="113.5,-174.75 0,-174.75 0,-144.25 113.5,-144.25 113.5,-174.75"/>
-<text text-anchor="start" x="8" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Node</text>
-<text text-anchor="middle" x="56.75" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; ValueType &gt; &gt;</text>
+<g id="a_Node000005"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="294.25,-174.75 180.75,-174.75 180.75,-144.25 294.25,-144.25 294.25,-174.75"/>
+<text text-anchor="start" x="188.75" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Node</text>
+<text text-anchor="middle" x="237.5" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; ValueType &gt; &gt;</text>
 </a>
 </g>
 </g>
@@ -109,30 +109,11 @@
 <g id="edge5_Node000004_Node000005" class="edge">
 <title>Node5&#45;&gt;Node4</title>
 <g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M56.75,-132.73C56.75,-118.47 56.75,-101.66 56.75,-91.62"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="53.25,-132.38 56.75,-142.38 60.25,-132.38 53.25,-132.38"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M237.5,-132.73C237.5,-118.47 237.5,-101.66 237.5,-91.62"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="234,-132.38 237.5,-142.38 241,-132.38 234,-132.38"/>
 </a>
 </g>
-<text text-anchor="middle" x="67.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> next</text>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="361.62,-91.38 299.88,-91.38 299.88,-72.12 361.62,-72.12 361.62,-91.38"/>
-<text text-anchor="middle" x="330.75" y="-77.88" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node1 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node6&#45;&gt;Node1</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M327.05,-60.78C324.54,-47.24 321.34,-29.99 319.42,-19.66"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="323.56,-61.19 328.83,-70.38 330.45,-59.91 323.56,-61.19"/>
-</a>
-</g>
-<text text-anchor="middle" x="335.14" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> size</text>
+<text text-anchor="middle" x="248.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> next</text>
 </g>
 </g>
 </svg>
diff --git a/d4/dcd/namespacecircular__linked__list.html b/d4/dcd/namespacecircular__linked__list.html
index 7a3912005..127e9b735 100644
--- a/d4/dcd/namespacecircular__linked__list.html
+++ b/d4/dcd/namespacecircular__linked__list.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: circular_linked_list Namespace Reference</title>
+<title>TheAlgorithms/C++: circular_linked_list Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d4/dd2/namespacequadratic__probing.html b/d4/dd2/namespacequadratic__probing.html
index 0eb3881bf..d67a5691e 100644
--- a/d4/dd2/namespacequadratic__probing.html
+++ b/d4/dd2/namespacequadratic__probing.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: quadratic_probing Namespace Reference</title>
+<title>TheAlgorithms/C++: quadratic_probing Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -147,23 +164,17 @@ Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:a90f9d8a71e3f148b65bcc0c1c8a49c70" id="r_a90f9d8a71e3f148b65bcc0c1c8a49c70"><td class="memItemLeft" align="right" valign="top"><a id="a90f9d8a71e3f148b65bcc0c1c8a49c70" name="a90f9d8a71e3f148b65bcc0c1c8a49c70"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>notPresent</b></td></tr>
+<tr class="memitem:a90f9d8a71e3f148b65bcc0c1c8a49c70" id="r_a90f9d8a71e3f148b65bcc0c1c8a49c70"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a90f9d8a71e3f148b65bcc0c1c8a49c70">notPresent</a></td></tr>
 <tr class="separator:a90f9d8a71e3f148b65bcc0c1c8a49c70"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a149e32e186c3fac390ffa81dd6c73147" id="r_a149e32e186c3fac390ffa81dd6c73147"><td class="memItemLeft" align="right" valign="top"><a id="a149e32e186c3fac390ffa81dd6c73147" name="a149e32e186c3fac390ffa81dd6c73147"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../da/dd1/structquadratic__probing_1_1_entry.html">Entry</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>table</b></td></tr>
+<tr class="memitem:a149e32e186c3fac390ffa81dd6c73147" id="r_a149e32e186c3fac390ffa81dd6c73147"><td class="memItemLeft" align="right" valign="top">std::vector&lt; <a class="el" href="../../da/dd1/structquadratic__probing_1_1_entry.html">Entry</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a149e32e186c3fac390ffa81dd6c73147">table</a></td></tr>
 <tr class="separator:a149e32e186c3fac390ffa81dd6c73147"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2d5722a3b692eeb1b96615fba6a248f3" id="r_a2d5722a3b692eeb1b96615fba6a248f3"><td class="memItemLeft" align="right" valign="top"><a id="a2d5722a3b692eeb1b96615fba6a248f3" name="a2d5722a3b692eeb1b96615fba6a248f3"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>totalSize</b></td></tr>
+<tr class="memitem:a2d5722a3b692eeb1b96615fba6a248f3" id="r_a2d5722a3b692eeb1b96615fba6a248f3"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2d5722a3b692eeb1b96615fba6a248f3">totalSize</a></td></tr>
 <tr class="separator:a2d5722a3b692eeb1b96615fba6a248f3"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aaa4b6c021ba71ecdac8b23b45d55c774" id="r_aaa4b6c021ba71ecdac8b23b45d55c774"><td class="memItemLeft" align="right" valign="top"><a id="aaa4b6c021ba71ecdac8b23b45d55c774" name="aaa4b6c021ba71ecdac8b23b45d55c774"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>tomb</b> = -1</td></tr>
+<tr class="memitem:aaa4b6c021ba71ecdac8b23b45d55c774" id="r_aaa4b6c021ba71ecdac8b23b45d55c774"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aaa4b6c021ba71ecdac8b23b45d55c774">tomb</a> = -1</td></tr>
 <tr class="separator:aaa4b6c021ba71ecdac8b23b45d55c774"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a6c60d84648b0f7bf78789da196bcd2b3" id="r_a6c60d84648b0f7bf78789da196bcd2b3"><td class="memItemLeft" align="right" valign="top"><a id="a6c60d84648b0f7bf78789da196bcd2b3" name="a6c60d84648b0f7bf78789da196bcd2b3"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>size</b></td></tr>
+<tr class="memitem:a6c60d84648b0f7bf78789da196bcd2b3" id="r_a6c60d84648b0f7bf78789da196bcd2b3"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6c60d84648b0f7bf78789da196bcd2b3">size</a></td></tr>
 <tr class="separator:a6c60d84648b0f7bf78789da196bcd2b3"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad20bb8020424def88917e26979051fae" id="r_ad20bb8020424def88917e26979051fae"><td class="memItemLeft" align="right" valign="top"><a id="ad20bb8020424def88917e26979051fae" name="ad20bb8020424def88917e26979051fae"></a>
-bool&#160;</td><td class="memItemRight" valign="bottom"><b>rehashing</b></td></tr>
+<tr class="memitem:ad20bb8020424def88917e26979051fae" id="r_ad20bb8020424def88917e26979051fae"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad20bb8020424def88917e26979051fae">rehashing</a></td></tr>
 <tr class="separator:ad20bb8020424def88917e26979051fae"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -189,6 +200,8 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>rehashing</b></td></t
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00182">182</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  182</span>                  {</div>
 <div class="line"><span class="lineno">  183</span>    <span class="keywordtype">int</span> index = <a class="code hl_function" href="#ab431981b54c0bae1b2956f716aee1dcf">quadraticProbe</a>(key, <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">  184</span>    table[index].key = key;</div>
@@ -197,13 +210,8 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>rehashing</b></td></t
 <div class="line"><span class="lineno">  187</span>        rehash();</div>
 <div class="line"><span class="lineno">  188</span>    }</div>
 <div class="line"><span class="lineno">  189</span>}</div>
-<div class="ttc" id="anamespacequadratic__probing_html_ab431981b54c0bae1b2956f716aee1dcf"><div class="ttname"><a href="#ab431981b54c0bae1b2956f716aee1dcf">quadratic_probing::quadraticProbe</a></div><div class="ttdeci">int quadraticProbe(int key, bool searching)</div><div class="ttdef"><b>Definition</b> quadratic_probing_hash_table.cpp:56</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.svg" width="522" height="331"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacequadratic__probing_html_ab431981b54c0bae1b2956f716aee1dcf"><div class="ttname"><a href="#ab431981b54c0bae1b2956f716aee1dcf">quadratic_probing::quadraticProbe</a></div><div class="ttdeci">int quadraticProbe(int key, bool searching)</div><div class="ttdef"><b>Definition</b> <a href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00056">quadratic_probing_hash_table.cpp:56</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a312143ed316d48978084c025ff8d9768" name="a312143ed316d48978084c025ff8d9768"></a>
@@ -226,26 +234,21 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00207">207</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  207</span>                      {</div>
-<div class="line"><span class="lineno">  208</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initial table: &quot;</span>;</div>
+<div class="line"><span class="lineno">  208</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initial table: &quot;</span>;</div>
 <div class="line"><span class="lineno">  209</span>    display();</div>
-<div class="line"><span class="lineno">  210</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  211</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;hash of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; hashFxn(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
+<div class="line"><span class="lineno">  210</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  211</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;hash of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; hashFxn(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
 <div class="line"><span class="lineno">  212</span>              &lt;&lt; totalSize &lt;&lt; <span class="stringliteral">&quot; == &quot;</span> &lt;&lt; hashFxn(key) % totalSize;</div>
-<div class="line"><span class="lineno">  213</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  214</span>    <a class="code hl_function" href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a>(key);</div>
-<div class="line"><span class="lineno">  215</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;New table: &quot;</span>;</div>
+<div class="line"><span class="lineno">  215</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;New table: &quot;</span>;</div>
 <div class="line"><span class="lineno">  216</span>    display();</div>
 <div class="line"><span class="lineno">  217</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="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="auint128__t_8hpp_html_a3ff77262ffd6743df5b808d41382a6f3"><div class="ttname"><a href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a></div><div class="ttdeci">std::string add(const std::string &amp;first, const std::string &amp;second)</div><div class="ttdoc">Adding two string.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:38</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph.svg" width="100%" height="581"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="auint128__t_8hpp_html_a3ff77262ffd6743df5b808d41382a6f3"><div class="ttname"><a href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a></div><div class="ttdeci">std::string add(const std::string &amp;first, const std::string &amp;second)</div><div class="ttdoc">Adding two string.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00038">uint128_t.hpp:38</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a40d617ebf4d6ba21bcda8d8d1faa2357" name="a40d617ebf4d6ba21bcda8d8d1faa2357"></a>
@@ -263,26 +266,23 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Displays the table </p><dl class="section return"><dt>Returns</dt><dd>None </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00142">142</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  142</span>               {</div>
 <div class="line"><span class="lineno">  143</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; totalSize; i++) {</div>
 <div class="line"><span class="lineno">  144</span>        <span class="keywordflow">if</span> (table[i].key == notPresent) {</div>
-<div class="line"><span class="lineno">  145</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; Empty &quot;</span>;</div>
+<div class="line"><span class="lineno">  145</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; Empty &quot;</span>;</div>
 <div class="line"><span class="lineno">  146</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (table[i].key == tomb) {</div>
-<div class="line"><span class="lineno">  147</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; Tomb &quot;</span>;</div>
+<div class="line"><span class="lineno">  147</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; Tomb &quot;</span>;</div>
 <div class="line"><span class="lineno">  148</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  149</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
-<div class="line"><span class="lineno">  150</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; table[i].key;</div>
-<div class="line"><span class="lineno">  151</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  149</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  150</span>            std::cout &lt;&lt; table[i].key;</div>
+<div class="line"><span class="lineno">  151</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">  152</span>        }</div>
 <div class="line"><span class="lineno">  153</span>    }</div>
-<div class="line"><span class="lineno">  154</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  154</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  155</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph.svg" width="262" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5ceee4128d92ca4412040b7104d1299d" name="a5ceee4128d92ca4412040b7104d1299d"></a>
@@ -308,6 +308,8 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>if present, the entry instance </dd>
 <dd>
 if not present, a new instance </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00131">131</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  131</span>                    {</div>
 <div class="line"><span class="lineno">  132</span>    <span class="keywordtype">int</span> index = <a class="code hl_function" href="#ab431981b54c0bae1b2956f716aee1dcf">quadraticProbe</a>(key, <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">  133</span>    <span class="keywordflow">if</span> (index == notPresent) {</div>
@@ -315,13 +317,8 @@ if not present, a new instance </dd></dl>
 <div class="line"><span class="lineno">  135</span>    }</div>
 <div class="line"><span class="lineno">  136</span>    <span class="keywordflow">return</span> table[index];</div>
 <div class="line"><span class="lineno">  137</span>}</div>
-<div class="ttc" id="astructquadratic__probing_1_1_entry_html"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html">quadratic_probing::Entry</a></div><div class="ttdef"><b>Definition</b> quadratic_probing_hash_table.cpp:37</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph.svg" width="522" height="331"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astructquadratic__probing_1_1_entry_html"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html">quadratic_probing::Entry</a></div><div class="ttdef"><b>Definition</b> <a href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00037">quadratic_probing_hash_table.cpp:37</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2093d91dd3d377cf0a5c939e45dcefc7" name="a2093d91dd3d377cf0a5c939e45dcefc7"></a>
@@ -345,11 +342,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>hash of the key </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00046">46</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   46</span>                        {</div>
-<div class="line"><span class="lineno">   47</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash&lt;int&gt;</a> hash;</div>
+<div class="line"><span class="lineno">   47</span>    std::hash&lt;int&gt; hash;</div>
 <div class="line"><span class="lineno">   48</span>    <span class="keywordflow">return</span> hash(key);</div>
 <div class="line"><span class="lineno">   49</span>}</div>
-<div class="ttc" id="ahash_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -381,13 +379,15 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if key is present </dd>
 <dd>
 <code>false</code> if key is absent </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00106">106</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  106</span>                                            {</div>
 <div class="line"><span class="lineno">  107</span>    <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">key</a> == notPresent || entry.<a class="code hl_variable" href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">key</a> == tomb) {</div>
 <div class="line"><span class="lineno">  108</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  109</span>    }</div>
 <div class="line"><span class="lineno">  110</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  111</span>}</div>
-<div class="ttc" id="astructquadratic__probing_1_1_entry_html_a75f72858f08a2fc8b94402de98db12d8"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">quadratic_probing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition</b> quadratic_probing_hash_table.cpp:39</div></div>
+<div class="ttc" id="astructquadratic__probing_1_1_entry_html_a75f72858f08a2fc8b94402de98db12d8"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">quadratic_probing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition</b> <a href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00039">quadratic_probing_hash_table.cpp:39</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -416,13 +416,15 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00056">56</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   56</span>                                            {</div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordtype">int</span> hash = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(hashFxn(key));</div>
 <div class="line"><span class="lineno">   58</span>    <span class="keywordtype">int</span> i = 0;</div>
 <div class="line"><span class="lineno">   59</span>    <a class="code hl_struct" href="../../da/dd1/structquadratic__probing_1_1_entry.html">Entry</a> entry;</div>
 <div class="line"><span class="lineno">   60</span>    <span class="keywordflow">do</span> {</div>
 <div class="line"><span class="lineno">   61</span>        <span class="keywordtype">size_t</span> index =</div>
-<div class="line"><span class="lineno">   62</span>            (hash + <span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(i, 2)))) %</div>
+<div class="line"><span class="lineno">   62</span>            (hash + <span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(std::round(std::pow(i, 2)))) %</div>
 <div class="line"><span class="lineno">   63</span>            totalSize;</div>
 <div class="line"><span class="lineno">   64</span>        entry = table[index];</div>
 <div class="line"><span class="lineno">   65</span>        <span class="keywordflow">if</span> (searching) {</div>
@@ -430,45 +432,38 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   67</span>                <span class="keywordflow">return</span> notPresent;</div>
 <div class="line"><span class="lineno">   68</span>            }</div>
 <div class="line"><span class="lineno">   69</span>            <span class="keywordflow">if</span> (searchingProber(entry, key)) {</div>
-<div class="line"><span class="lineno">   70</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Found key!&quot;</span> &lt;&lt; <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">   70</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Found key!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   71</span>                <span class="keywordflow">return</span> index;</div>
 <div class="line"><span class="lineno">   72</span>            }</div>
-<div class="line"><span class="lineno">   73</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Found tombstone or equal hash, checking next&quot;</span></div>
-<div class="line"><span class="lineno">   74</span>                      &lt;&lt; <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">   73</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Found tombstone or equal hash, checking next&quot;</span></div>
+<div class="line"><span class="lineno">   74</span>                      &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   75</span>            i++;</div>
 <div class="line"><span class="lineno">   76</span>        } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">   77</span>            <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">putProber</a>(entry, key)) {</div>
 <div class="line"><span class="lineno">   78</span>                <span class="keywordflow">if</span> (!rehashing) {</div>
-<div class="line"><span class="lineno">   79</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Spot found!&quot;</span> &lt;&lt; <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">   79</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;Spot found!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   80</span>                }</div>
 <div class="line"><span class="lineno">   81</span>                <span class="keywordflow">return</span> index;</div>
 <div class="line"><span class="lineno">   82</span>            }</div>
 <div class="line"><span class="lineno">   83</span>            <span class="keywordflow">if</span> (!rehashing) {</div>
-<div class="line"><span class="lineno">   84</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Spot taken, looking at next (next index = &quot;</span></div>
+<div class="line"><span class="lineno">   84</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Spot taken, looking at next (next index = &quot;</span></div>
 <div class="line"><span class="lineno">   85</span>                          &lt;&lt; (<a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hash</a> + <span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(</div>
-<div class="line"><span class="lineno">   86</span>                                         <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(i + 1, 2)))) %</div>
+<div class="line"><span class="lineno">   86</span>                                         std::round(std::pow(i + 1, 2)))) %</div>
 <div class="line"><span class="lineno">   87</span>                                 totalSize</div>
-<div class="line"><span class="lineno">   88</span>                          &lt;&lt; <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">   88</span>                          &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   89</span>            }</div>
 <div class="line"><span class="lineno">   90</span>            i++;</div>
 <div class="line"><span class="lineno">   91</span>        }</div>
 <div class="line"><span class="lineno">   92</span>        <span class="keywordflow">if</span> (i == totalSize * 100) {</div>
-<div class="line"><span class="lineno">   93</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Quadratic probe failed (infinite loop)&quot;</span> &lt;&lt; <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">   93</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Quadratic probe failed (infinite loop)&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   94</span>            <span class="keywordflow">return</span> notPresent;</div>
 <div class="line"><span class="lineno">   95</span>        }</div>
 <div class="line"><span class="lineno">   96</span>    } <span class="keywordflow">while</span> (entry.<a class="code hl_variable" href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">key</a> != notPresent);</div>
 <div class="line"><span class="lineno">   97</span>    <span class="keywordflow">return</span> notPresent;</div>
 <div class="line"><span class="lineno">   98</span>}</div>
-<div class="ttc" id="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> md5.cpp:288</div></div>
-<div class="ttc" id="anamespacedouble__hashing_html_ac2adfce49ac57f6dbd1778d2c1ce0d2b"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">double_hashing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:120</div></div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-<div class="ttc" id="around_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a></div><div class="ttdeci">T round(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph.svg" width="322" height="331"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d96/md5_8cpp_source.html#l00288">md5.cpp:288</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_ac2adfce49ac57f6dbd1778d2c1ce0d2b"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">double_hashing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00120">double_hash_hash_table.cpp:120</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ada6f1f44f7e83b0094fbcbe170788486" name="ada6f1f44f7e83b0094fbcbe170788486"></a>
@@ -486,14 +481,16 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Rehashes the table into a bigger table </p><dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00160">160</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  160</span>              {</div>
 <div class="line"><span class="lineno">  161</span>    <span class="comment">// Necessary so wall of add info isn&#39;t printed all at once</span></div>
 <div class="line"><span class="lineno">  162</span>    rehashing = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  163</span>    <span class="keywordtype">int</span> oldSize = totalSize;</div>
-<div class="line"><span class="lineno">  164</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Entry&gt;</a> oldTable(table);</div>
+<div class="line"><span class="lineno">  164</span>    std::vector&lt;Entry&gt; oldTable(table);</div>
 <div class="line"><span class="lineno">  165</span>    <span class="comment">// Really this should use the next prime number greater than totalSize * 2</span></div>
 <div class="line"><span class="lineno">  166</span>    totalSize *= 2;</div>
-<div class="line"><span class="lineno">  167</span>    table = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Entry&gt;</a>(totalSize);</div>
+<div class="line"><span class="lineno">  167</span>    table = std::vector&lt;Entry&gt;(totalSize);</div>
 <div class="line"><span class="lineno">  168</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; oldSize; i++) {</div>
 <div class="line"><span class="lineno">  169</span>        <span class="keywordflow">if</span> (oldTable[i].key != -1 &amp;&amp; oldTable[i].key != notPresent) {</div>
 <div class="line"><span class="lineno">  170</span>            size--;  <span class="comment">// Size stays the same (add increments size)</span></div>
@@ -502,15 +499,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  173</span>    }</div>
 <div class="line"><span class="lineno">  174</span>    <span class="comment">// delete[] oldTable;</span></div>
 <div class="line"><span class="lineno">  175</span>    rehashing = <span class="keyword">false</span>;</div>
-<div class="line"><span class="lineno">  176</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Table was rehashed, new size is: &quot;</span> &lt;&lt; totalSize &lt;&lt; <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">  176</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Table was rehashed, new size is: &quot;</span> &lt;&lt; totalSize &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  177</span>}</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>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph.svg" width="100%" height="548"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a69fe1f7c36fe004ba83eef2ca82e7e30" name="a69fe1f7c36fe004ba83eef2ca82e7e30"></a>
@@ -533,23 +524,20 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00222">222</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  222</span>                          {</div>
-<div class="line"><span class="lineno">  223</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initial table: &quot;</span>;</div>
+<div class="line"><span class="lineno">  223</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initial table: &quot;</span>;</div>
 <div class="line"><span class="lineno">  224</span>    display();</div>
-<div class="line"><span class="lineno">  225</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  226</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;hash of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; hashFxn(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
+<div class="line"><span class="lineno">  225</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  226</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;hash of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; hashFxn(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
 <div class="line"><span class="lineno">  227</span>              &lt;&lt; totalSize &lt;&lt; <span class="stringliteral">&quot; == &quot;</span> &lt;&lt; hashFxn(key) % totalSize;</div>
-<div class="line"><span class="lineno">  228</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  228</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  229</span>    remove(key);</div>
-<div class="line"><span class="lineno">  230</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;New table: &quot;</span>;</div>
+<div class="line"><span class="lineno">  230</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;New table: &quot;</span>;</div>
 <div class="line"><span class="lineno">  231</span>    display();</div>
 <div class="line"><span class="lineno">  232</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph.svg" width="100%" height="548"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a07a0467b24102260fbb6b554c453c20a" name="a07a0467b24102260fbb6b554c453c20a"></a>
@@ -572,21 +560,18 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00194">194</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  194</span>                     {</div>
 <div class="line"><span class="lineno">  195</span>    <span class="keywordtype">int</span> index = <a class="code hl_function" href="#ab431981b54c0bae1b2956f716aee1dcf">quadraticProbe</a>(key, <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">  196</span>    <span class="keywordflow">if</span> (index == notPresent) {</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> &lt;&lt; <span class="stringliteral">&quot;key not found&quot;</span> &lt;&lt; <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">  197</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;key not found&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  198</span>    }</div>
 <div class="line"><span class="lineno">  199</span>    table[index].key = tomb;</div>
-<div class="line"><span class="lineno">  200</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Removal successful, leaving tombstone&quot;</span> &lt;&lt; <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">  200</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Removal successful, leaving tombstone&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  201</span>    size--;</div>
 <div class="line"><span class="lineno">  202</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph.svg" width="502" height="331"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aeb6bca8db4768226f8ea8291ea4f83f6" name="aeb6bca8db4768226f8ea8291ea4f83f6"></a>
@@ -617,6 +602,8 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if key matches the entry </dd>
 <dd>
 <code>false</code> if key does not match the entry </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00119">119</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  119</span>                                                  {</div>
 <div class="line"><span class="lineno">  120</span>    <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">key</a> == key) {</div>
 <div class="line"><span class="lineno">  121</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
@@ -624,6 +611,103 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  123</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  124</span>}</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Variable Documentation</h2>
+<a id="a90f9d8a71e3f148b65bcc0c1c8a49c70" name="a90f9d8a71e3f148b65bcc0c1c8a49c70"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a90f9d8a71e3f148b65bcc0c1c8a49c70">&#9670;&#160;</a></span>notPresent</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int quadratic_probing::notPresent</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ad20bb8020424def88917e26979051fae" name="ad20bb8020424def88917e26979051fae"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ad20bb8020424def88917e26979051fae">&#9670;&#160;</a></span>rehashing</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">bool quadratic_probing::rehashing</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a6c60d84648b0f7bf78789da196bcd2b3" name="a6c60d84648b0f7bf78789da196bcd2b3"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a6c60d84648b0f7bf78789da196bcd2b3">&#9670;&#160;</a></span>size</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int quadratic_probing::size</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a149e32e186c3fac390ffa81dd6c73147" name="a149e32e186c3fac390ffa81dd6c73147"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a149e32e186c3fac390ffa81dd6c73147">&#9670;&#160;</a></span>table</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;<a class="el" href="../../da/dd1/structquadratic__probing_1_1_entry.html">Entry</a>&gt; quadratic_probing::table</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<a id="aaa4b6c021ba71ecdac8b23b45d55c774" name="aaa4b6c021ba71ecdac8b23b45d55c774"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aaa4b6c021ba71ecdac8b23b45d55c774">&#9670;&#160;</a></span>tomb</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int quadratic_probing::tomb = -1</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a2d5722a3b692eeb1b96615fba6a248f3" name="a2d5722a3b692eeb1b96615fba6a248f3"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a2d5722a3b692eeb1b96615fba6a248f3">&#9670;&#160;</a></span>totalSize</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int quadratic_probing::totalSize</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00030">30</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
+
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.map b/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.map
deleted file mode 100644
index 43d2265bc..000000000
--- a/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="quadratic_probing::add" name="quadratic_probing::add">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,158,56"/>
-<area shape="rect" id="Node000002" href="$d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" title=" " alt="" coords="206,112,337,153"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="112,54,214,103,211,108,110,59"/>
-<area shape="rect" id="Node000009" href="$d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486" title=" " alt="" coords="206,23,337,64"/>
-<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="158,50,190,50,190,55,158,55"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="415,5,486,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="293,110,334,76,384,41,399,33,402,38,386,46,337,80,297,114"/>
-<area shape="rect" id="Node000004" href="$d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" title=" " alt="" coords="385,55,516,96"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="336,109,369,99,371,104,338,115"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="415,120,486,146"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="337,130,400,130,400,136,337,136"/>
-<area shape="rect" id="Node000006" href="$d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" title=" " alt="" coords="385,170,516,210"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="338,151,371,162,369,167,336,156"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/round.html#" title=" " alt="" coords="411,235,490,260"/>
-<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="297,152,337,186,386,220,398,226,395,231,384,224,334,190,293,156"/>
-<area shape="rect" id="Node000008" href="$d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" title=" " alt="" coords="385,284,516,325"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="287,152,328,210,356,242,387,271,391,274,387,278,383,275,352,245,324,213,283,155"/>
-<area shape="poly" id="edge9_Node000009_Node000001" title=" " alt="" coords="205,38,173,37,173,32,205,32"/>
-<area shape="poly" id="edge10_Node000009_Node000003" title=" " alt="" coords="337,32,400,23,400,28,338,37"/>
-</map>
diff --git a/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.md5 b/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.md5
deleted file mode 100644
index 6b7c04609..000000000
--- a/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-dc74bf59a51500375f1ffa89e1777b77
\ No newline at end of file
diff --git a/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.svg b/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.svg
deleted file mode 100644
index 9fc91e205..000000000
--- a/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph.svg
+++ /dev/null
@@ -1,214 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: quadratic_probing::add Pages: 1 -->
-<svg width="391pt" height="248pt"
- viewBox="0.00 0.00 391.25 247.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 243.88)">
-<title>quadratic_probing::add</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="114.25,-220.88 0,-220.88 0,-201.62 114.25,-201.62 114.25,-220.88"/>
-<text text-anchor="middle" x="57.12" y="-207.38" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::add</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.75,-159.5 150.25,-159.5 150.25,-129 248.75,-129 248.75,-159.5"/>
-<text text-anchor="start" x="158.25" y="-146" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="199.5" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">quadraticProbe</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.14,-201.22C99.24,-191.63 130.15,-176.87 155.48,-164.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.71,-168.08 164.22,-160.61 153.69,-161.76 156.71,-168.08"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.75,-226.5 150.25,-226.5 150.25,-196 248.75,-196 248.75,-226.5"/>
-<text text-anchor="start" x="158.25" y="-213" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="199.5" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">rehash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.41,-204.62C122.3,-204.48 130.44,-204.46 138.4,-204.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.31,-208.06 148.37,-204.76 138.45,-201.06 138.31,-208.06"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="360.75,-239.88 307.25,-239.88 307.25,-220.62 360.75,-220.62 360.75,-239.88"/>
-<text text-anchor="middle" x="334" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M217.15,-159.98C233.41,-174.71 259.34,-196.58 284.75,-211.25 288.4,-213.35 292.32,-215.32 296.3,-217.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.83,-220.32 305.4,-220.97 297.55,-213.87 294.83,-220.32"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-202.5 284.75,-202.5 284.75,-172 383.25,-172 383.25,-202.5"/>
-<text text-anchor="start" x="292.75" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="334" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.71,-159.9C256.84,-162.53 265.36,-165.3 273.73,-168.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.57,-171.32 283.16,-171.08 274.73,-164.66 272.57,-171.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="360.75,-153.88 307.25,-153.88 307.25,-134.62 360.75,-134.62 360.75,-153.88"/>
-<text text-anchor="middle" x="334" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.09,-144.25C264.59,-144.25 281.48,-144.25 296.02,-144.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.59,-147.75 305.59,-144.25 295.59,-140.75 295.59,-147.75"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-116.5 284.75,-116.5 284.75,-86 383.25,-86 383.25,-116.5"/>
-<text text-anchor="start" x="292.75" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="334" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">putProber</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.71,-128.6C256.84,-125.97 265.36,-123.2 273.73,-120.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="274.73,-123.84 283.16,-117.42 272.57,-117.18 274.73,-123.84"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="363.75,-67.88 304.25,-67.88 304.25,-48.62 363.75,-48.62 363.75,-67.88"/>
-<text text-anchor="middle" x="334" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M217.15,-128.52C233.41,-113.79 259.34,-91.92 284.75,-77.25 287.53,-75.65 290.47,-74.12 293.47,-72.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.64,-75.99 302.39,-68.76 291.82,-69.58 294.64,-75.99"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-30.5 284.75,-30.5 284.75,0 383.25,0 383.25,-30.5"/>
-<text text-anchor="start" x="292.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="334" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">searchingProber</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.94,-128.59C223.96,-106.37 252.17,-65.49 284.75,-39.25 285.7,-38.49 286.67,-37.74 287.67,-37.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.38,-40.07 295.86,-31.69 285.57,-34.2 289.38,-40.07"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node1 -->
-<g id="edge9_Node000009_Node000001" class="edge">
-<title>Node9&#45;&gt;Node1</title>
-<g id="a_edge9_Node000009_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M149.89,-217.71C142.11,-217.92 133.94,-218.02 125.82,-218"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.96,-214.5 115.93,-217.9 125.89,-221.5 125.96,-214.5"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge10_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge10_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.09,-218.22C264.59,-220.44 281.48,-222.86 296.02,-224.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.21,-228.37 305.61,-226.32 296.21,-221.44 295.21,-228.37"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph_org.svg b/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph_org.svg
deleted file mode 100644
index 4893320aa..000000000
--- a/d4/dd2/namespacequadratic__probing_a00ebcc6d39653eccc26f8432efbfc8d9_cgraph_org.svg
+++ /dev/null
@@ -1,188 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: quadratic_probing::add Pages: 1 -->
-<svg width="391pt" height="248pt"
- viewBox="0.00 0.00 391.25 247.88" 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 243.88)">
-<title>quadratic_probing::add</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="114.25,-220.88 0,-220.88 0,-201.62 114.25,-201.62 114.25,-220.88"/>
-<text text-anchor="middle" x="57.12" y="-207.38" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::add</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.75,-159.5 150.25,-159.5 150.25,-129 248.75,-129 248.75,-159.5"/>
-<text text-anchor="start" x="158.25" y="-146" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="199.5" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">quadraticProbe</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.14,-201.22C99.24,-191.63 130.15,-176.87 155.48,-164.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.71,-168.08 164.22,-160.61 153.69,-161.76 156.71,-168.08"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.75,-226.5 150.25,-226.5 150.25,-196 248.75,-196 248.75,-226.5"/>
-<text text-anchor="start" x="158.25" y="-213" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="199.5" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">rehash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.41,-204.62C122.3,-204.48 130.44,-204.46 138.4,-204.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.31,-208.06 148.37,-204.76 138.45,-201.06 138.31,-208.06"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="360.75,-239.88 307.25,-239.88 307.25,-220.62 360.75,-220.62 360.75,-239.88"/>
-<text text-anchor="middle" x="334" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M217.15,-159.98C233.41,-174.71 259.34,-196.58 284.75,-211.25 288.4,-213.35 292.32,-215.32 296.3,-217.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.83,-220.32 305.4,-220.97 297.55,-213.87 294.83,-220.32"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-202.5 284.75,-202.5 284.75,-172 383.25,-172 383.25,-202.5"/>
-<text text-anchor="start" x="292.75" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="334" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.71,-159.9C256.84,-162.53 265.36,-165.3 273.73,-168.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.57,-171.32 283.16,-171.08 274.73,-164.66 272.57,-171.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="360.75,-153.88 307.25,-153.88 307.25,-134.62 360.75,-134.62 360.75,-153.88"/>
-<text text-anchor="middle" x="334" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.09,-144.25C264.59,-144.25 281.48,-144.25 296.02,-144.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.59,-147.75 305.59,-144.25 295.59,-140.75 295.59,-147.75"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-116.5 284.75,-116.5 284.75,-86 383.25,-86 383.25,-116.5"/>
-<text text-anchor="start" x="292.75" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="334" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">putProber</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.71,-128.6C256.84,-125.97 265.36,-123.2 273.73,-120.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="274.73,-123.84 283.16,-117.42 272.57,-117.18 274.73,-123.84"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="363.75,-67.88 304.25,-67.88 304.25,-48.62 363.75,-48.62 363.75,-67.88"/>
-<text text-anchor="middle" x="334" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M217.15,-128.52C233.41,-113.79 259.34,-91.92 284.75,-77.25 287.53,-75.65 290.47,-74.12 293.47,-72.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.64,-75.99 302.39,-68.76 291.82,-69.58 294.64,-75.99"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-30.5 284.75,-30.5 284.75,0 383.25,0 383.25,-30.5"/>
-<text text-anchor="start" x="292.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="334" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">searchingProber</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.94,-128.59C223.96,-106.37 252.17,-65.49 284.75,-39.25 285.7,-38.49 286.67,-37.74 287.67,-37.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.38,-40.07 295.86,-31.69 285.57,-34.2 289.38,-40.07"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node1 -->
-<g id="edge9_Node000009_Node000001" class="edge">
-<title>Node9&#45;&gt;Node1</title>
-<g id="a_edge9_Node000009_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M149.89,-217.71C142.11,-217.92 133.94,-218.02 125.82,-218"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.96,-214.5 115.93,-217.9 125.89,-221.5 125.96,-214.5"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge10_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge10_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.09,-218.22C264.59,-220.44 281.48,-222.86 296.02,-224.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.21,-228.37 305.61,-226.32 296.21,-221.44 295.21,-228.37"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph.map b/d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph.map
deleted file mode 100644
index 559055103..000000000
--- a/d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph.map
+++ /dev/null
@@ -1,18 +0,0 @@
-<map id="quadratic_probing::remove" name="quadratic_probing::remove">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,84,137,125"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="394,5,465,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="137,86,378,28,380,33,138,92"/>
-<area shape="rect" id="Node000003" href="$d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" title=" " alt="" coords="185,112,316,153"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="138,112,170,118,169,123,137,118"/>
-<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="272,110,313,76,363,41,378,33,381,38,365,46,316,80,276,114"/>
-<area shape="rect" id="Node000004" href="$d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" title=" " alt="" coords="364,55,495,96"/>
-<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="315,109,348,99,350,104,317,115"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="394,120,465,146"/>
-<area shape="poly" id="edge5_Node000003_Node000005" title=" " alt="" coords="316,130,379,130,379,136,316,136"/>
-<area shape="rect" id="Node000006" href="$d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" title=" " alt="" coords="364,170,495,210"/>
-<area shape="poly" id="edge6_Node000003_Node000006" title=" " alt="" coords="317,151,350,162,348,167,315,156"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/round.html#" title=" " alt="" coords="390,235,469,260"/>
-<area shape="poly" id="edge7_Node000003_Node000007" title=" " alt="" coords="276,152,316,186,365,220,377,226,374,231,363,224,313,190,272,156"/>
-<area shape="rect" id="Node000008" href="$d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" title=" " alt="" coords="364,284,495,325"/>
-<area shape="poly" id="edge8_Node000003_Node000008" title=" " alt="" coords="266,152,307,210,335,242,366,271,370,274,366,278,362,275,331,245,303,213,262,155"/>
-</map>
diff --git a/d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph.md5 b/d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph.md5
deleted file mode 100644
index 68185fd87..000000000
--- a/d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6541cae966800e9a943149092a106bc3
\ No newline at end of file
diff --git a/d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph.svg b/d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph.svg
deleted file mode 100644
index 68771c170..000000000
--- a/d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph.svg
+++ /dev/null
@@ -1,187 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: quadratic_probing::remove Pages: 1 -->
-<svg width="376pt" height="248pt"
- viewBox="0.00 0.00 375.50 247.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 243.88)">
-<title>quadratic_probing::remove</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-180.5 0,-180.5 0,-150 98.5,-150 98.5,-180.5"/>
-<text text-anchor="start" x="8" y="-167" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="49.25" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">remove</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="345,-239.88 291.5,-239.88 291.5,-220.62 345,-220.62 345,-239.88"/>
-<text text-anchor="middle" x="318.25" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.91,-177.1C151.16,-189.82 233.01,-209.74 280.25,-221.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="279.17,-224.58 289.72,-223.55 280.83,-217.78 279.17,-224.58"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-159.5 134.5,-159.5 134.5,-129 233,-129 233,-159.5"/>
-<text text-anchor="start" x="142.5" y="-146" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="183.75" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">quadraticProbe</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.84,-157.55C106.67,-156.31 114.85,-155.01 122.91,-153.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.35,-157.21 132.68,-152.19 122.25,-150.29 123.35,-157.21"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.4,-159.98C217.66,-174.71 243.59,-196.58 269,-211.25 272.65,-213.35 276.57,-215.32 280.55,-217.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="279.08,-220.32 289.65,-220.97 281.8,-213.87 279.08,-220.32"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="367.5,-202.5 269,-202.5 269,-172 367.5,-172 367.5,-202.5"/>
-<text text-anchor="start" x="277" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="318.25" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M232.96,-159.9C241.09,-162.53 249.61,-165.3 257.98,-168.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="256.82,-171.32 267.41,-171.08 258.98,-164.66 256.82,-171.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="345,-153.88 291.5,-153.88 291.5,-134.62 345,-134.62 345,-153.88"/>
-<text text-anchor="middle" x="318.25" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge5_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge5_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M233.34,-144.25C248.84,-144.25 265.73,-144.25 280.27,-144.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="279.84,-147.75 289.84,-144.25 279.84,-140.75 279.84,-147.75"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="367.5,-116.5 269,-116.5 269,-86 367.5,-86 367.5,-116.5"/>
-<text text-anchor="start" x="277" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="318.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">putProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M232.96,-128.6C241.09,-125.97 249.61,-123.2 257.98,-120.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.98,-123.84 267.41,-117.42 256.82,-117.18 258.98,-123.84"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="348,-67.88 288.5,-67.88 288.5,-48.62 348,-48.62 348,-67.88"/>
-<text text-anchor="middle" x="318.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge7_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge7_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.4,-128.52C217.66,-113.79 243.59,-91.92 269,-77.25 271.78,-75.65 274.72,-74.12 277.72,-72.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.89,-75.99 286.64,-68.76 276.07,-69.58 278.89,-75.99"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="367.5,-30.5 269,-30.5 269,0 367.5,0 367.5,-30.5"/>
-<text text-anchor="start" x="277" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="318.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">searchingProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge8_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge8_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M194.19,-128.59C208.21,-106.37 236.42,-65.49 269,-39.25 269.95,-38.49 270.92,-37.74 271.92,-37.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.63,-40.07 280.11,-31.69 269.82,-34.2 273.63,-40.07"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph_org.svg b/d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph_org.svg
deleted file mode 100644
index f3c8f38ab..000000000
--- a/d4/dd2/namespacequadratic__probing_a07a0467b24102260fbb6b554c453c20a_cgraph_org.svg
+++ /dev/null
@@ -1,161 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: quadratic_probing::remove Pages: 1 -->
-<svg width="376pt" height="248pt"
- viewBox="0.00 0.00 375.50 247.88" 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 243.88)">
-<title>quadratic_probing::remove</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-180.5 0,-180.5 0,-150 98.5,-150 98.5,-180.5"/>
-<text text-anchor="start" x="8" y="-167" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="49.25" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">remove</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="345,-239.88 291.5,-239.88 291.5,-220.62 345,-220.62 345,-239.88"/>
-<text text-anchor="middle" x="318.25" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.91,-177.1C151.16,-189.82 233.01,-209.74 280.25,-221.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="279.17,-224.58 289.72,-223.55 280.83,-217.78 279.17,-224.58"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-159.5 134.5,-159.5 134.5,-129 233,-129 233,-159.5"/>
-<text text-anchor="start" x="142.5" y="-146" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="183.75" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">quadraticProbe</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.84,-157.55C106.67,-156.31 114.85,-155.01 122.91,-153.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.35,-157.21 132.68,-152.19 122.25,-150.29 123.35,-157.21"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.4,-159.98C217.66,-174.71 243.59,-196.58 269,-211.25 272.65,-213.35 276.57,-215.32 280.55,-217.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="279.08,-220.32 289.65,-220.97 281.8,-213.87 279.08,-220.32"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="367.5,-202.5 269,-202.5 269,-172 367.5,-172 367.5,-202.5"/>
-<text text-anchor="start" x="277" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="318.25" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M232.96,-159.9C241.09,-162.53 249.61,-165.3 257.98,-168.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="256.82,-171.32 267.41,-171.08 258.98,-164.66 256.82,-171.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="345,-153.88 291.5,-153.88 291.5,-134.62 345,-134.62 345,-153.88"/>
-<text text-anchor="middle" x="318.25" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge5_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge5_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M233.34,-144.25C248.84,-144.25 265.73,-144.25 280.27,-144.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="279.84,-147.75 289.84,-144.25 279.84,-140.75 279.84,-147.75"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="367.5,-116.5 269,-116.5 269,-86 367.5,-86 367.5,-116.5"/>
-<text text-anchor="start" x="277" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="318.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">putProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M232.96,-128.6C241.09,-125.97 249.61,-123.2 257.98,-120.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.98,-123.84 267.41,-117.42 256.82,-117.18 258.98,-123.84"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="348,-67.88 288.5,-67.88 288.5,-48.62 348,-48.62 348,-67.88"/>
-<text text-anchor="middle" x="318.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge7_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge7_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.4,-128.52C217.66,-113.79 243.59,-91.92 269,-77.25 271.78,-75.65 274.72,-74.12 277.72,-72.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.89,-75.99 286.64,-68.76 276.07,-69.58 278.89,-75.99"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="367.5,-30.5 269,-30.5 269,0 367.5,0 367.5,-30.5"/>
-<text text-anchor="start" x="277" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="318.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">searchingProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge8_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge8_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M194.19,-128.59C208.21,-106.37 236.42,-65.49 269,-39.25 269.95,-38.49 270.92,-37.74 271.92,-37.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.63,-40.07 280.11,-31.69 269.82,-34.2 273.63,-40.07"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph.map b/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph.map
deleted file mode 100644
index ccaeea043..000000000
--- a/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph.map
+++ /dev/null
@@ -1,28 +0,0 @@
-<map id="quadratic_probing::addInfo" name="quadratic_probing::addInfo">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,92,137,133"/>
-<area shape="rect" id="Node000002" href="$d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9" title=" " alt="" coords="185,128,337,153"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="138,119,170,124,169,129,137,125"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="594,49,666,74"/>
-<area shape="poly" id="edge14_Node000001_Node000004" title=" " alt="" coords="137,104,579,64,579,69,137,109"/>
-<area shape="rect" id="Node000005" href="$d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" title=" " alt="" coords="564,328,696,369"/>
-<area shape="poly" id="edge15_Node000001_Node000005" title=" " alt="" coords="116,131,186,163,391,250,562,319,560,324,389,255,184,168,114,136"/>
-<area shape="rect" id="Node000011" href="$d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357" title=" " alt="" coords="195,5,326,46"/>
-<area shape="poly" id="edge12_Node000001_Node000011" title=" " alt="" coords="117,89,200,50,202,55,119,94"/>
-<area shape="rect" id="Node000003" href="$d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" title=" " alt="" coords="385,185,516,226"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="301,151,376,177,374,182,300,156"/>
-<area shape="rect" id="Node000010" href="$d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486" title=" " alt="" coords="385,120,516,161"/>
-<area shape="poly" id="edge9_Node000002_Node000010" title=" " alt="" coords="337,147,369,147,369,152,337,152"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="498,183,514,170,530,149,537,127,545,106,563,84,579,73,582,77,566,88,550,108,542,129,535,151,518,174,501,187"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="472,225,513,268,566,313,573,318,570,322,563,317,509,272,468,228"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="594,98,666,124"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="493,182,515,170,538,152,563,134,579,126,581,131,566,139,542,156,518,175,496,187"/>
-<area shape="rect" id="Node000007" href="$d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" title=" " alt="" coords="564,148,696,189"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="516,189,548,183,549,188,517,195"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/round.html#" title=" " alt="" coords="590,213,670,238"/>
-<area shape="poly" id="edge7_Node000003_Node000008" title=" " alt="" coords="517,210,576,217,575,222,516,216"/>
-<area shape="rect" id="Node000009" href="$d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" title=" " alt="" coords="564,263,696,303"/>
-<area shape="poly" id="edge8_Node000003_Node000009" title=" " alt="" coords="501,224,568,253,566,258,499,229"/>
-<area shape="poly" id="edge10_Node000010_Node000002" title=" " alt="" coords="384,134,352,134,352,129,385,129"/>
-<area shape="poly" id="edge11_Node000010_Node000004" title=" " alt="" coords="492,117,563,83,578,77,580,82,565,88,494,122"/>
-<area shape="poly" id="edge13_Node000011_Node000004" title=" " alt="" coords="327,29,579,54,579,59,327,35"/>
-</map>
diff --git a/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph.md5 b/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph.md5
deleted file mode 100644
index 6d7454d60..000000000
--- a/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-defe70418bc2ffd9c1e976f17de4a471
\ No newline at end of file
diff --git a/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph.svg b/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph.svg
deleted file mode 100644
index 1d1675c97..000000000
--- a/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph.svg
+++ /dev/null
@@ -1,336 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: quadratic_probing::addInfo Pages: 1 -->
-<!--zoomable 281 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 526;
-var viewHeight = 281;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>quadratic_probing::addInfo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-207.5 0,-207.5 0,-177 98.5,-177 98.5,-207.5"/>
-<text text-anchor="start" x="8" y="-194" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="49.25" y="-182.75" font-family="Helvetica,sans-Serif" font-size="10.00">addInfo</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.75,-180.88 134.5,-180.88 134.5,-161.62 248.75,-161.62 248.75,-180.88"/>
-<text text-anchor="middle" x="191.62" y="-167.38" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.95,-184.96C106.7,-183.8 114.84,-182.59 122.93,-181.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.43,-184.84 132.8,-179.9 122.4,-177.92 123.43,-184.84"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="495.25,-239.88 441.75,-239.88 441.75,-220.62 495.25,-220.62 495.25,-239.88"/>
-<text text-anchor="middle" x="468.5" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge14_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge14_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.93,-196.68C183.21,-204.36 354.5,-219.96 430.15,-226.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.66,-230.32 439.94,-227.74 430.3,-223.35 429.66,-230.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="517.75,-30.5 419.25,-30.5 419.25,0 517.75,0 517.75,-30.5"/>
-<text text-anchor="start" x="427.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="468.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge15_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge15_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.07,-176.65C97.76,-169.09 117.03,-159.98 134.5,-152.25 233.73,-108.32 351.49,-60.98 417.04,-35.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="418.06,-38.4 426.08,-31.47 415.49,-31.89 418.06,-38.4"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="240.88,-272.5 142.38,-272.5 142.38,-242 240.88,-242 240.88,-272.5"/>
-<text text-anchor="start" x="150.38" y="-259" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="191.62" y="-247.75" font-family="Helvetica,sans-Serif" font-size="10.00">display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge12_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge12_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.23,-207.98C103.03,-216.69 126.59,-227.6 146.76,-236.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.04,-240 155.58,-241.02 147.98,-233.65 145.04,-240"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-137.5 284.75,-137.5 284.75,-107 383.25,-107 383.25,-137.5"/>
-<text text-anchor="start" x="292.75" y="-124" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="334" y="-112.75" font-family="Helvetica,sans-Serif" font-size="10.00">quadraticProbe</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M221.37,-161.22C237.47,-155.6 258.1,-148.39 277.24,-141.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.27,-145.06 286.56,-138.46 275.96,-138.45 278.27,-145.06"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-186.5 284.75,-186.5 284.75,-156 383.25,-156 383.25,-186.5"/>
-<text text-anchor="start" x="292.75" y="-173" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="334" y="-161.75" font-family="Helvetica,sans-Serif" font-size="10.00">rehash</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge9_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.91,-164.62C256.8,-164.48 264.94,-164.46 272.9,-164.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.81,-168.06 282.87,-164.76 272.95,-161.06 272.81,-168.06"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M370.89,-137.75C375.34,-140.53 379.6,-143.7 383.25,-147.25 406.92,-170.28 394.23,-190.7 419.25,-212.25 422.83,-215.34 426.99,-217.91 431.34,-220.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.66,-223.16 440.24,-223.76 432.35,-216.69 429.66,-223.16"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M348.44,-106.64C364.18,-89.01 391.61,-60.19 419.25,-40.25 420.97,-39.01 422.76,-37.79 424.6,-36.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="425.96,-39.87 432.73,-31.73 422.36,-33.87 425.96,-39.87"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="495.25,-202.88 441.75,-202.88 441.75,-183.62 495.25,-183.62 495.25,-202.88"/>
-<text text-anchor="middle" x="468.5" y="-189.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M367.08,-137.92C372.56,-140.87 378.14,-144.04 383.25,-147.25 400.19,-157.89 401.79,-164.5 419.25,-174.25 422.92,-176.3 426.87,-178.24 430.85,-180.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.4,-183.22 439.97,-183.85 432.1,-176.76 429.4,-183.22"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="517.75,-165.5 419.25,-165.5 419.25,-135 517.75,-135 517.75,-165.5"/>
-<text text-anchor="start" x="427.25" y="-152" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="468.5" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">putProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M383.59,-132.52C391.42,-134.17 399.6,-135.9 407.66,-137.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="406.93,-141.03 417.44,-139.67 408.38,-134.18 406.93,-141.03"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="498.25,-116.88 438.75,-116.88 438.75,-97.62 498.25,-97.62 498.25,-116.88"/>
-<text text-anchor="middle" x="468.5" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M383.59,-116.75C398.01,-115.12 413.64,-113.35 427.46,-111.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="427.53,-115.3 437.07,-110.69 426.74,-108.34 427.53,-115.3"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="517.75,-79.5 419.25,-79.5 419.25,-49 517.75,-49 517.75,-79.5"/>
-<text text-anchor="start" x="427.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="468.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">searchingProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M370.86,-106.55C386.32,-99.78 404.61,-91.78 421.09,-84.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="422.47,-87.78 430.23,-80.57 419.66,-81.37 422.47,-87.78"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node2 -->
-<g id="edge10_Node000010_Node000002" class="edge">
-<title>Node10&#45;&gt;Node2</title>
-<g id="a_edge10_Node000010_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M284.39,-177.71C276.61,-177.92 268.44,-178.02 260.32,-178"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.46,-174.5 250.43,-177.9 260.39,-181.5 260.46,-174.5"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node4 -->
-<g id="edge11_Node000010_Node000004" class="edge">
-<title>Node10&#45;&gt;Node4</title>
-<g id="a_edge11_Node000010_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M365.48,-186.96C381.35,-194.91 401.16,-204.49 419.25,-212.25 422.89,-213.81 426.72,-215.37 430.56,-216.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.27,-220.14 439.86,-220.45 431.77,-213.6 429.27,-220.14"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node4 -->
-<g id="edge13_Node000011_Node000004" class="edge">
-<title>Node11&#45;&gt;Node4</title>
-<g id="a_edge13_Node000011_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M241.13,-252.49C295.1,-247.18 381.12,-238.74 430.11,-233.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="430.32,-237.42 439.93,-232.96 429.64,-230.45 430.32,-237.42"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph_org.svg b/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph_org.svg
deleted file mode 100644
index 004d355ab..000000000
--- a/d4/dd2/namespacequadratic__probing_a312143ed316d48978084c025ff8d9768_cgraph_org.svg
+++ /dev/null
@@ -1,253 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: quadratic_probing::addInfo Pages: 1 -->
-<svg width="526pt" height="281pt"
- viewBox="0.00 0.00 525.75 280.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 276.5)">
-<title>quadratic_probing::addInfo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-207.5 0,-207.5 0,-177 98.5,-177 98.5,-207.5"/>
-<text text-anchor="start" x="8" y="-194" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="49.25" y="-182.75" font-family="Helvetica,sans-Serif" font-size="10.00">addInfo</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.75,-180.88 134.5,-180.88 134.5,-161.62 248.75,-161.62 248.75,-180.88"/>
-<text text-anchor="middle" x="191.62" y="-167.38" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.95,-184.96C106.7,-183.8 114.84,-182.59 122.93,-181.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.43,-184.84 132.8,-179.9 122.4,-177.92 123.43,-184.84"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="495.25,-239.88 441.75,-239.88 441.75,-220.62 495.25,-220.62 495.25,-239.88"/>
-<text text-anchor="middle" x="468.5" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge14_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge14_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.93,-196.68C183.21,-204.36 354.5,-219.96 430.15,-226.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.66,-230.32 439.94,-227.74 430.3,-223.35 429.66,-230.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="517.75,-30.5 419.25,-30.5 419.25,0 517.75,0 517.75,-30.5"/>
-<text text-anchor="start" x="427.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="468.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge15_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge15_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.07,-176.65C97.76,-169.09 117.03,-159.98 134.5,-152.25 233.73,-108.32 351.49,-60.98 417.04,-35.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="418.06,-38.4 426.08,-31.47 415.49,-31.89 418.06,-38.4"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="240.88,-272.5 142.38,-272.5 142.38,-242 240.88,-242 240.88,-272.5"/>
-<text text-anchor="start" x="150.38" y="-259" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="191.62" y="-247.75" font-family="Helvetica,sans-Serif" font-size="10.00">display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge12_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge12_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.23,-207.98C103.03,-216.69 126.59,-227.6 146.76,-236.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.04,-240 155.58,-241.02 147.98,-233.65 145.04,-240"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-137.5 284.75,-137.5 284.75,-107 383.25,-107 383.25,-137.5"/>
-<text text-anchor="start" x="292.75" y="-124" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="334" y="-112.75" font-family="Helvetica,sans-Serif" font-size="10.00">quadraticProbe</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M221.37,-161.22C237.47,-155.6 258.1,-148.39 277.24,-141.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.27,-145.06 286.56,-138.46 275.96,-138.45 278.27,-145.06"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-186.5 284.75,-186.5 284.75,-156 383.25,-156 383.25,-186.5"/>
-<text text-anchor="start" x="292.75" y="-173" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="334" y="-161.75" font-family="Helvetica,sans-Serif" font-size="10.00">rehash</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge9_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.91,-164.62C256.8,-164.48 264.94,-164.46 272.9,-164.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.81,-168.06 282.87,-164.76 272.95,-161.06 272.81,-168.06"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M370.89,-137.75C375.34,-140.53 379.6,-143.7 383.25,-147.25 406.92,-170.28 394.23,-190.7 419.25,-212.25 422.83,-215.34 426.99,-217.91 431.34,-220.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.66,-223.16 440.24,-223.76 432.35,-216.69 429.66,-223.16"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M348.44,-106.64C364.18,-89.01 391.61,-60.19 419.25,-40.25 420.97,-39.01 422.76,-37.79 424.6,-36.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="425.96,-39.87 432.73,-31.73 422.36,-33.87 425.96,-39.87"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="495.25,-202.88 441.75,-202.88 441.75,-183.62 495.25,-183.62 495.25,-202.88"/>
-<text text-anchor="middle" x="468.5" y="-189.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M367.08,-137.92C372.56,-140.87 378.14,-144.04 383.25,-147.25 400.19,-157.89 401.79,-164.5 419.25,-174.25 422.92,-176.3 426.87,-178.24 430.85,-180.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.4,-183.22 439.97,-183.85 432.1,-176.76 429.4,-183.22"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="517.75,-165.5 419.25,-165.5 419.25,-135 517.75,-135 517.75,-165.5"/>
-<text text-anchor="start" x="427.25" y="-152" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="468.5" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">putProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M383.59,-132.52C391.42,-134.17 399.6,-135.9 407.66,-137.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="406.93,-141.03 417.44,-139.67 408.38,-134.18 406.93,-141.03"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="498.25,-116.88 438.75,-116.88 438.75,-97.62 498.25,-97.62 498.25,-116.88"/>
-<text text-anchor="middle" x="468.5" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M383.59,-116.75C398.01,-115.12 413.64,-113.35 427.46,-111.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="427.53,-115.3 437.07,-110.69 426.74,-108.34 427.53,-115.3"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="517.75,-79.5 419.25,-79.5 419.25,-49 517.75,-49 517.75,-79.5"/>
-<text text-anchor="start" x="427.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="468.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">searchingProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M370.86,-106.55C386.32,-99.78 404.61,-91.78 421.09,-84.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="422.47,-87.78 430.23,-80.57 419.66,-81.37 422.47,-87.78"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node2 -->
-<g id="edge10_Node000010_Node000002" class="edge">
-<title>Node10&#45;&gt;Node2</title>
-<g id="a_edge10_Node000010_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M284.39,-177.71C276.61,-177.92 268.44,-178.02 260.32,-178"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.46,-174.5 250.43,-177.9 260.39,-181.5 260.46,-174.5"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node4 -->
-<g id="edge11_Node000010_Node000004" class="edge">
-<title>Node10&#45;&gt;Node4</title>
-<g id="a_edge11_Node000010_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M365.48,-186.96C381.35,-194.91 401.16,-204.49 419.25,-212.25 422.89,-213.81 426.72,-215.37 430.56,-216.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.27,-220.14 439.86,-220.45 431.77,-213.6 429.27,-220.14"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node4 -->
-<g id="edge13_Node000011_Node000004" class="edge">
-<title>Node11&#45;&gt;Node4</title>
-<g id="a_edge13_Node000011_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M241.13,-252.49C295.1,-247.18 381.12,-238.74 430.11,-233.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="430.32,-237.42 439.93,-232.96 429.64,-230.45 430.32,-237.42"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph.map b/d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph.map
deleted file mode 100644
index 69e796bda..000000000
--- a/d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="quadratic_probing::display" name="quadratic_probing::display">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,137,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="185,13,256,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="137,23,169,23,169,28,137,28"/>
-</map>
diff --git a/d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph.md5 b/d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph.md5
deleted file mode 100644
index 9b3c729b9..000000000
--- a/d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-183d42fa3ec4a1a09607bee1ad01ee38
\ No newline at end of file
diff --git a/d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph.svg b/d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph.svg
deleted file mode 100644
index 6ff73237d..000000000
--- a/d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: quadratic_probing::display Pages: 1 -->
-<svg width="196pt" height="39pt"
- viewBox="0.00 0.00 196.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>quadratic_probing::display</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">display</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="188,-24.88 134.5,-24.88 134.5,-5.63 188,-5.63 188,-24.88"/>
-<text text-anchor="middle" x="161.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.82,-15.25C106.92,-15.25 115.21,-15.25 122.98,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.75,-18.75 132.75,-15.25 122.75,-11.75 122.75,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph_org.svg b/d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph_org.svg
deleted file mode 100644
index 59f783fb2..000000000
--- a/d4/dd2/namespacequadratic__probing_a40d617ebf4d6ba21bcda8d8d1faa2357_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: quadratic_probing::display Pages: 1 -->
-<svg width="196pt" height="39pt"
- viewBox="0.00 0.00 196.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>quadratic_probing::display</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">display</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="188,-24.88 134.5,-24.88 134.5,-5.63 188,-5.63 188,-24.88"/>
-<text text-anchor="middle" x="161.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.82,-15.25C106.92,-15.25 115.21,-15.25 122.98,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.75,-18.75 132.75,-15.25 122.75,-11.75 122.75,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph.map b/d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph.map
deleted file mode 100644
index 77027120b..000000000
--- a/d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="quadratic_probing::find" name="quadratic_probing::find">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,149,158,175"/>
-<area shape="rect" id="Node000002" href="$d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" title=" " alt="" coords="206,142,337,182"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="158,160,190,160,190,165,158,165"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="415,5,486,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="286,140,326,91,354,65,384,41,399,32,402,37,386,46,357,69,330,95,290,143"/>
-<area shape="rect" id="Node000004" href="$d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" title=" " alt="" coords="385,55,516,96"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="314,139,392,101,395,105,317,144"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="415,120,486,146"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="337,149,400,138,400,144,338,154"/>
-<area shape="rect" id="Node000006" href="$d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" title=" " alt="" coords="385,170,516,210"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="338,170,370,175,369,180,337,175"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/round.html#" title=" " alt="" coords="411,235,490,260"/>
-<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="310,181,386,220,400,226,398,231,384,225,308,185"/>
-<area shape="rect" id="Node000008" href="$d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" title=" " alt="" coords="385,284,516,325"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="292,181,333,225,387,271,391,274,388,278,383,275,329,229,288,185"/>
-</map>
diff --git a/d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph.md5 b/d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph.md5
deleted file mode 100644
index b812d4ece..000000000
--- a/d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-eca36c0cce0e89940df6d276bbe73ca6
\ No newline at end of file
diff --git a/d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph.svg b/d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph.svg
deleted file mode 100644
index 44f3b2cfa..000000000
--- a/d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph.svg
+++ /dev/null
@@ -1,177 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: quadratic_probing::find Pages: 1 -->
-<svg width="391pt" height="248pt"
- viewBox="0.00 0.00 391.25 247.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 243.88)">
-<title>quadratic_probing::find</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="114.25,-131.88 0,-131.88 0,-112.62 114.25,-112.62 114.25,-131.88"/>
-<text text-anchor="middle" x="57.12" y="-118.38" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::find</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.75,-137.5 150.25,-137.5 150.25,-107 248.75,-107 248.75,-137.5"/>
-<text text-anchor="start" x="158.25" y="-124" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="199.5" y="-112.75" font-family="Helvetica,sans-Serif" font-size="10.00">quadraticProbe</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.41,-122.25C122.3,-122.25 130.44,-122.25 138.4,-122.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.37,-125.75 148.37,-122.25 138.37,-118.75 138.37,-125.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="360.75,-239.88 307.25,-239.88 307.25,-220.62 360.75,-220.62 360.75,-239.88"/>
-<text text-anchor="middle" x="334" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M211.71,-137.75C226.49,-157.25 254.25,-190.65 284.75,-211.25 288.42,-213.73 292.47,-215.96 296.6,-217.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.96,-221.04 305.53,-221.77 297.72,-214.61 294.96,-221.04"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-202.5 284.75,-202.5 284.75,-172 383.25,-172 383.25,-202.5"/>
-<text text-anchor="start" x="292.75" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="334" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M232.57,-137.98C250.15,-146.61 272.15,-157.4 291.07,-166.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.34,-169.73 299.86,-170.99 292.43,-163.45 289.34,-169.73"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="360.75,-153.88 307.25,-153.88 307.25,-134.62 360.75,-134.62 360.75,-153.88"/>
-<text text-anchor="middle" x="334" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.09,-130.32C264.59,-132.89 281.48,-135.7 296.02,-138.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.17,-141.52 305.61,-139.7 296.32,-134.61 295.17,-141.52"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-116.5 284.75,-116.5 284.75,-86 383.25,-86 383.25,-116.5"/>
-<text text-anchor="start" x="292.75" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="334" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">putProber</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.09,-114.55C256.92,-113.31 265.1,-112.01 273.16,-110.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.6,-114.21 282.93,-109.19 272.5,-107.29 273.6,-114.21"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="363.75,-67.88 304.25,-67.88 304.25,-48.62 363.75,-48.62 363.75,-67.88"/>
-<text text-anchor="middle" x="334" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M227.79,-106.64C244.09,-97.58 265.33,-86.22 284.75,-77.25 288.1,-75.7 291.62,-74.16 295.16,-72.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="296.38,-75.95 304.32,-68.93 293.74,-69.47 296.38,-75.95"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-30.5 284.75,-30.5 284.75,0 383.25,0 383.25,-30.5"/>
-<text text-anchor="start" x="292.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="334" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">searchingProber</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.57,-106.67C229.16,-88.77 256.67,-59.29 284.75,-39.25 285.93,-38.41 287.14,-37.58 288.38,-36.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="290.14,-39.79 296.92,-31.65 286.55,-33.79 290.14,-39.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph_org.svg b/d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph_org.svg
deleted file mode 100644
index d1056de66..000000000
--- a/d4/dd2/namespacequadratic__probing_a5ceee4128d92ca4412040b7104d1299d_cgraph_org.svg
+++ /dev/null
@@ -1,151 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: quadratic_probing::find Pages: 1 -->
-<svg width="391pt" height="248pt"
- viewBox="0.00 0.00 391.25 247.88" 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 243.88)">
-<title>quadratic_probing::find</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="114.25,-131.88 0,-131.88 0,-112.62 114.25,-112.62 114.25,-131.88"/>
-<text text-anchor="middle" x="57.12" y="-118.38" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::find</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.75,-137.5 150.25,-137.5 150.25,-107 248.75,-107 248.75,-137.5"/>
-<text text-anchor="start" x="158.25" y="-124" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="199.5" y="-112.75" font-family="Helvetica,sans-Serif" font-size="10.00">quadraticProbe</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.41,-122.25C122.3,-122.25 130.44,-122.25 138.4,-122.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.37,-125.75 148.37,-122.25 138.37,-118.75 138.37,-125.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="360.75,-239.88 307.25,-239.88 307.25,-220.62 360.75,-220.62 360.75,-239.88"/>
-<text text-anchor="middle" x="334" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M211.71,-137.75C226.49,-157.25 254.25,-190.65 284.75,-211.25 288.42,-213.73 292.47,-215.96 296.6,-217.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.96,-221.04 305.53,-221.77 297.72,-214.61 294.96,-221.04"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-202.5 284.75,-202.5 284.75,-172 383.25,-172 383.25,-202.5"/>
-<text text-anchor="start" x="292.75" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="334" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M232.57,-137.98C250.15,-146.61 272.15,-157.4 291.07,-166.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.34,-169.73 299.86,-170.99 292.43,-163.45 289.34,-169.73"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="360.75,-153.88 307.25,-153.88 307.25,-134.62 360.75,-134.62 360.75,-153.88"/>
-<text text-anchor="middle" x="334" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.09,-130.32C264.59,-132.89 281.48,-135.7 296.02,-138.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.17,-141.52 305.61,-139.7 296.32,-134.61 295.17,-141.52"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-116.5 284.75,-116.5 284.75,-86 383.25,-86 383.25,-116.5"/>
-<text text-anchor="start" x="292.75" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="334" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">putProber</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.09,-114.55C256.92,-113.31 265.1,-112.01 273.16,-110.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.6,-114.21 282.93,-109.19 272.5,-107.29 273.6,-114.21"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="363.75,-67.88 304.25,-67.88 304.25,-48.62 363.75,-48.62 363.75,-67.88"/>
-<text text-anchor="middle" x="334" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M227.79,-106.64C244.09,-97.58 265.33,-86.22 284.75,-77.25 288.1,-75.7 291.62,-74.16 295.16,-72.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="296.38,-75.95 304.32,-68.93 293.74,-69.47 296.38,-75.95"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-30.5 284.75,-30.5 284.75,0 383.25,0 383.25,-30.5"/>
-<text text-anchor="start" x="292.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="334" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">searchingProber</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.57,-106.67C229.16,-88.77 256.67,-59.29 284.75,-39.25 285.93,-38.41 287.14,-37.58 288.38,-36.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="290.14,-39.79 296.92,-31.65 286.55,-33.79 290.14,-39.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph.map b/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph.map
deleted file mode 100644
index bf3f09e03..000000000
--- a/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph.map
+++ /dev/null
@@ -1,25 +0,0 @@
-<map id="quadratic_probing::removalInfo" name="quadratic_probing::removalInfo">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,52,137,93"/>
-<area shape="rect" id="Node000002" href="$d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357" title=" " alt="" coords="364,23,495,64"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="137,65,348,47,349,53,137,70"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="573,5,645,31"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="137,49,184,37,270,19,339,10,407,7,495,9,558,12,558,17,495,14,407,13,339,15,271,24,185,42,138,55"/>
-<area shape="rect" id="Node000004" href="$d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" title=" " alt="" coords="543,284,675,325"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="111,91,186,130,375,213,538,276,536,281,373,218,184,135,108,96"/>
-<area shape="rect" id="Node000005" href="$d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a" title=" " alt="" coords="185,80,316,121"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="138,80,170,86,169,91,137,86"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="495,32,558,23,559,28,496,37"/>
-<area shape="poly" id="edge6_Node000005_Node000003" title=" " alt="" coords="316,100,403,94,449,86,494,73,508,66,518,58,542,40,558,32,560,37,545,44,521,62,511,70,496,78,451,91,403,100,316,105"/>
-<area shape="rect" id="Node000006" href="$d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" title=" " alt="" coords="364,138,495,178"/>
-<area shape="poly" id="edge7_Node000005_Node000006" title=" " alt="" coords="317,119,350,130,348,135,315,124"/>
-<area shape="poly" id="edge8_Node000006_Node000003" title=" " alt="" coords="471,135,493,118,508,98,516,79,524,60,542,40,557,30,560,35,545,44,529,63,521,81,513,100,497,121,474,139"/>
-<area shape="poly" id="edge9_Node000006_Node000004" title=" " alt="" coords="452,177,501,228,545,269,552,274,549,279,542,274,497,232,448,181"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="573,169,645,195"/>
-<area shape="poly" id="edge10_Node000006_Node000007" title=" " alt="" coords="496,164,559,173,558,178,495,170"/>
-<area shape="rect" id="Node000008" href="$d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" title=" " alt="" coords="543,219,675,260"/>
-<area shape="poly" id="edge11_Node000006_Node000008" title=" " alt="" coords="478,177,550,210,548,215,475,182"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/round.html#" title=" " alt="" coords="569,55,649,80"/>
-<area shape="poly" id="edge12_Node000006_Node000009" title=" " alt="" coords="464,135,542,90,556,84,558,89,545,95,467,140"/>
-<area shape="rect" id="Node000010" href="$d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" title=" " alt="" coords="543,104,675,145"/>
-<area shape="poly" id="edge13_Node000006_Node000010" title=" " alt="" coords="495,143,527,137,528,143,496,149"/>
-</map>
diff --git a/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph.md5 b/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph.md5
deleted file mode 100644
index c170e8454..000000000
--- a/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8a8c53963fe75a18e0c1a88fb155c5d0
\ No newline at end of file
diff --git a/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph.svg b/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph.svg
deleted file mode 100644
index 443668488..000000000
--- a/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph.svg
+++ /dev/null
@@ -1,309 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: quadratic_probing::removalInfo Pages: 1 -->
-<!--zoomable 248 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 510;
-var viewHeight = 248;
-var sectionId = 'dynsection-6';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>quadratic_probing::removalInfo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-204.5 0,-204.5 0,-174 98.5,-174 98.5,-204.5"/>
-<text text-anchor="start" x="8" y="-191" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="49.25" y="-179.75" font-family="Helvetica,sans-Serif" font-size="10.00">removalInfo</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="367.5,-226.5 269,-226.5 269,-196 367.5,-196 367.5,-226.5"/>
-<text text-anchor="start" x="277" y="-213" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="318.25" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.91,-193.26C143.52,-196.93 209.7,-202.39 257.5,-206.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.16,-209.81 267.41,-207.14 257.74,-202.83 257.16,-209.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="479.5,-239.88 426,-239.88 426,-220.62 479.5,-220.62 479.5,-239.88"/>
-<text text-anchor="middle" x="452.75" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.96,-204.91C110.53,-208.29 122.89,-211.63 134.5,-214.25 235.93,-237.11 263.57,-238.33 367.5,-235.25 382.87,-234.79 399.8,-233.87 414.42,-232.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.33,-236.46 424.07,-232.3 413.86,-229.47 414.33,-236.46"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="502,-30.5 403.5,-30.5 403.5,0 502,0 502,-30.5"/>
-<text text-anchor="start" x="411.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="452.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.96,-173.51C94.22,-164.51 115.28,-153.26 134.5,-144.25 225.59,-101.54 334.87,-58.93 398.49,-34.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.52,-38.31 407.65,-31.51 397.06,-31.75 399.52,-38.31"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-183.5 134.5,-183.5 134.5,-153 233,-153 233,-183.5"/>
-<text text-anchor="start" x="142.5" y="-170" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="183.75" y="-158.75" font-family="Helvetica,sans-Serif" font-size="10.00">remove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.84,-181.55C106.67,-180.31 114.85,-179.01 122.91,-177.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.35,-181.21 132.68,-176.19 122.25,-174.29 123.35,-181.21"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M367.84,-218.22C383.34,-220.44 400.23,-222.86 414.77,-224.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="413.96,-228.37 424.36,-226.32 414.96,-221.44 413.96,-228.37"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge6_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge6_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M233.18,-166.79C270.9,-167.17 323.99,-171.1 367.5,-187.25 385.76,-194.03 386.24,-203.22 403.5,-212.25 407.2,-214.19 411.16,-216.02 415.16,-217.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="413.7,-220.9 424.28,-221.32 416.27,-214.39 413.7,-220.9"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="367.5,-140.5 269,-140.5 269,-110 367.5,-110 367.5,-140.5"/>
-<text text-anchor="start" x="277" y="-127" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="318.25" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">quadraticProbe</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge7_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge7_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M232.96,-152.6C241.09,-149.97 249.61,-147.2 257.98,-144.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.98,-147.84 267.41,-141.42 256.82,-141.18 258.98,-147.84"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge8_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge8_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M350.18,-140.84C356.31,-144.73 362.42,-149.24 367.5,-154.25 389.11,-175.55 380.03,-193.03 403.5,-212.25 406.98,-215.1 410.96,-217.53 415.1,-219.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="413.58,-222.74 424.16,-223.38 416.29,-216.29 413.58,-222.74"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge9_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge9_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.46,-109.8C353.3,-88.43 388.52,-51.26 403.5,-40.25 405.21,-38.99 406.99,-37.76 408.82,-36.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="410.19,-39.83 416.93,-31.66 406.57,-33.84 410.19,-39.83"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="479.5,-116.88 426,-116.88 426,-97.62 479.5,-97.62 479.5,-116.88"/>
-<text text-anchor="middle" x="452.75" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge10_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge10_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M367.84,-118.65C383.34,-116.54 400.23,-114.25 414.77,-112.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.92,-115.79 424.36,-110.97 413.98,-108.85 414.92,-115.79"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="502,-79.5 403.5,-79.5 403.5,-49 502,-49 502,-79.5"/>
-<text text-anchor="start" x="411.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="452.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">putProber</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge11_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge11_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M353.37,-109.54C369.91,-101.93 389.97,-92.69 407.65,-84.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="408.75,-87.9 416.37,-80.54 405.82,-81.54 408.75,-87.9"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="482.5,-202.88 423,-202.88 423,-183.62 482.5,-183.62 482.5,-202.88"/>
-<text text-anchor="middle" x="452.75" y="-189.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge12_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge12_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M345.16,-140.9C365.48,-153.06 392.15,-168.76 403.5,-174.25 406.78,-175.84 410.23,-177.4 413.72,-178.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="412.16,-182.05 422.74,-182.63 414.83,-175.58 412.16,-182.05"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="502,-165.5 403.5,-165.5 403.5,-135 502,-135 502,-165.5"/>
-<text text-anchor="start" x="411.5" y="-152" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="452.75" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">searchingProber</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge13_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge13_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M367.84,-134.42C375.67,-135.89 383.85,-137.44 391.91,-138.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="391.21,-142.39 401.68,-140.8 392.51,-135.51 391.21,-142.39"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph_org.svg b/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph_org.svg
deleted file mode 100644
index 6f2a57a70..000000000
--- a/d4/dd2/namespacequadratic__probing_a69fe1f7c36fe004ba83eef2ca82e7e30_cgraph_org.svg
+++ /dev/null
@@ -1,226 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: quadratic_probing::removalInfo Pages: 1 -->
-<svg width="510pt" height="248pt"
- viewBox="0.00 0.00 510.00 247.88" 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 243.88)">
-<title>quadratic_probing::removalInfo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-204.5 0,-204.5 0,-174 98.5,-174 98.5,-204.5"/>
-<text text-anchor="start" x="8" y="-191" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="49.25" y="-179.75" font-family="Helvetica,sans-Serif" font-size="10.00">removalInfo</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="367.5,-226.5 269,-226.5 269,-196 367.5,-196 367.5,-226.5"/>
-<text text-anchor="start" x="277" y="-213" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="318.25" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.91,-193.26C143.52,-196.93 209.7,-202.39 257.5,-206.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.16,-209.81 267.41,-207.14 257.74,-202.83 257.16,-209.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="479.5,-239.88 426,-239.88 426,-220.62 479.5,-220.62 479.5,-239.88"/>
-<text text-anchor="middle" x="452.75" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.96,-204.91C110.53,-208.29 122.89,-211.63 134.5,-214.25 235.93,-237.11 263.57,-238.33 367.5,-235.25 382.87,-234.79 399.8,-233.87 414.42,-232.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.33,-236.46 424.07,-232.3 413.86,-229.47 414.33,-236.46"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="502,-30.5 403.5,-30.5 403.5,0 502,0 502,-30.5"/>
-<text text-anchor="start" x="411.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="452.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.96,-173.51C94.22,-164.51 115.28,-153.26 134.5,-144.25 225.59,-101.54 334.87,-58.93 398.49,-34.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.52,-38.31 407.65,-31.51 397.06,-31.75 399.52,-38.31"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-183.5 134.5,-183.5 134.5,-153 233,-153 233,-183.5"/>
-<text text-anchor="start" x="142.5" y="-170" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="183.75" y="-158.75" font-family="Helvetica,sans-Serif" font-size="10.00">remove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.84,-181.55C106.67,-180.31 114.85,-179.01 122.91,-177.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.35,-181.21 132.68,-176.19 122.25,-174.29 123.35,-181.21"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M367.84,-218.22C383.34,-220.44 400.23,-222.86 414.77,-224.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="413.96,-228.37 424.36,-226.32 414.96,-221.44 413.96,-228.37"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge6_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge6_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M233.18,-166.79C270.9,-167.17 323.99,-171.1 367.5,-187.25 385.76,-194.03 386.24,-203.22 403.5,-212.25 407.2,-214.19 411.16,-216.02 415.16,-217.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="413.7,-220.9 424.28,-221.32 416.27,-214.39 413.7,-220.9"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="367.5,-140.5 269,-140.5 269,-110 367.5,-110 367.5,-140.5"/>
-<text text-anchor="start" x="277" y="-127" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="318.25" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">quadraticProbe</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge7_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge7_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M232.96,-152.6C241.09,-149.97 249.61,-147.2 257.98,-144.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.98,-147.84 267.41,-141.42 256.82,-141.18 258.98,-147.84"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge8_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge8_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M350.18,-140.84C356.31,-144.73 362.42,-149.24 367.5,-154.25 389.11,-175.55 380.03,-193.03 403.5,-212.25 406.98,-215.1 410.96,-217.53 415.1,-219.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="413.58,-222.74 424.16,-223.38 416.29,-216.29 413.58,-222.74"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge9_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge9_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.46,-109.8C353.3,-88.43 388.52,-51.26 403.5,-40.25 405.21,-38.99 406.99,-37.76 408.82,-36.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="410.19,-39.83 416.93,-31.66 406.57,-33.84 410.19,-39.83"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="479.5,-116.88 426,-116.88 426,-97.62 479.5,-97.62 479.5,-116.88"/>
-<text text-anchor="middle" x="452.75" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge10_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge10_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M367.84,-118.65C383.34,-116.54 400.23,-114.25 414.77,-112.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.92,-115.79 424.36,-110.97 413.98,-108.85 414.92,-115.79"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="502,-79.5 403.5,-79.5 403.5,-49 502,-49 502,-79.5"/>
-<text text-anchor="start" x="411.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="452.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">putProber</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge11_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge11_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M353.37,-109.54C369.91,-101.93 389.97,-92.69 407.65,-84.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="408.75,-87.9 416.37,-80.54 405.82,-81.54 408.75,-87.9"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="482.5,-202.88 423,-202.88 423,-183.62 482.5,-183.62 482.5,-202.88"/>
-<text text-anchor="middle" x="452.75" y="-189.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge12_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge12_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M345.16,-140.9C365.48,-153.06 392.15,-168.76 403.5,-174.25 406.78,-175.84 410.23,-177.4 413.72,-178.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="412.16,-182.05 422.74,-182.63 414.83,-175.58 412.16,-182.05"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="502,-165.5 403.5,-165.5 403.5,-135 502,-135 502,-165.5"/>
-<text text-anchor="start" x="411.5" y="-152" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="452.75" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">searchingProber</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge13_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge13_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M367.84,-134.42C375.67,-135.89 383.85,-137.44 391.91,-138.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="391.21,-142.39 401.68,-140.8 392.51,-135.51 391.21,-142.39"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph.map b/d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph.map
deleted file mode 100644
index 6d2d9db95..000000000
--- a/d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="quadratic_probing::quadraticProbe" name="quadratic_probing::quadraticProbe">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,142,137,182"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="215,5,286,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="85,140,126,91,153,65,183,41,199,32,202,37,186,46,157,69,130,95,89,143"/>
-<area shape="rect" id="Node000003" href="$d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" title=" " alt="" coords="185,55,316,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="114,139,192,101,194,105,116,144"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="215,120,286,146"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="137,149,199,138,200,144,138,154"/>
-<area shape="rect" id="Node000005" href="$d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" title=" " alt="" coords="185,170,316,210"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="138,170,170,175,169,180,137,175"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/round.html#" title=" " alt="" coords="211,235,290,260"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="110,181,186,220,200,226,197,231,184,225,108,185"/>
-<area shape="rect" id="Node000007" href="$d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" title=" " alt="" coords="185,284,316,325"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="92,181,133,225,186,271,191,274,188,278,183,275,129,229,88,185"/>
-</map>
diff --git a/d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph.md5 b/d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph.md5
deleted file mode 100644
index 73cb5ee49..000000000
--- a/d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d7d75c1bbb12a095179e575fd31f0390
\ No newline at end of file
diff --git a/d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph.svg b/d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph.svg
deleted file mode 100644
index 88fb68e30..000000000
--- a/d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph.svg
+++ /dev/null
@@ -1,159 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: quadratic_probing::quadraticProbe Pages: 1 -->
-<svg width="241pt" height="248pt"
- viewBox="0.00 0.00 241.00 247.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 243.88)">
-<title>quadratic_probing::quadraticProbe</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-137.5 0,-137.5 0,-107 98.5,-107 98.5,-137.5"/>
-<text text-anchor="start" x="8" y="-124" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="49.25" y="-112.75" font-family="Helvetica,sans-Serif" font-size="10.00">quadraticProbe</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="210.5,-239.88 157,-239.88 157,-220.62 210.5,-220.62 210.5,-239.88"/>
-<text text-anchor="middle" x="183.75" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.46,-137.75C76.24,-157.25 104,-190.65 134.5,-211.25 138.17,-213.73 142.22,-215.96 146.35,-217.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.71,-221.04 155.28,-221.77 147.47,-214.61 144.71,-221.04"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-202.5 134.5,-202.5 134.5,-172 233,-172 233,-202.5"/>
-<text text-anchor="start" x="142.5" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="183.75" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.32,-137.98C99.9,-146.61 121.9,-157.4 140.82,-166.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.09,-169.73 149.61,-170.99 142.18,-163.45 139.09,-169.73"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="210.5,-153.88 157,-153.88 157,-134.62 210.5,-134.62 210.5,-153.88"/>
-<text text-anchor="middle" x="183.75" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.84,-130.32C114.34,-132.89 131.23,-135.7 145.77,-138.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.92,-141.52 155.36,-139.7 146.07,-134.61 144.92,-141.52"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-116.5 134.5,-116.5 134.5,-86 233,-86 233,-116.5"/>
-<text text-anchor="start" x="142.5" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="183.75" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">putProber</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.84,-114.55C106.67,-113.31 114.85,-112.01 122.91,-110.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.35,-114.21 132.68,-109.19 122.25,-107.29 123.35,-114.21"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="213.5,-67.88 154,-67.88 154,-48.62 213.5,-48.62 213.5,-67.88"/>
-<text text-anchor="middle" x="183.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.54,-106.64C93.84,-97.58 115.08,-86.22 134.5,-77.25 137.85,-75.7 141.37,-74.16 144.91,-72.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.13,-75.95 154.07,-68.93 143.49,-69.47 146.13,-75.95"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-30.5 134.5,-30.5 134.5,0 233,0 233,-30.5"/>
-<text text-anchor="start" x="142.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="183.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">searchingProber</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.32,-106.67C78.91,-88.77 106.42,-59.29 134.5,-39.25 135.68,-38.41 136.89,-37.58 138.13,-36.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.89,-39.79 146.67,-31.65 136.3,-33.79 139.89,-39.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph_org.svg b/d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph_org.svg
deleted file mode 100644
index 6625816a3..000000000
--- a/d4/dd2/namespacequadratic__probing_ab431981b54c0bae1b2956f716aee1dcf_cgraph_org.svg
+++ /dev/null
@@ -1,133 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: quadratic_probing::quadraticProbe Pages: 1 -->
-<svg width="241pt" height="248pt"
- viewBox="0.00 0.00 241.00 247.88" 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 243.88)">
-<title>quadratic_probing::quadraticProbe</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-137.5 0,-137.5 0,-107 98.5,-107 98.5,-137.5"/>
-<text text-anchor="start" x="8" y="-124" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="49.25" y="-112.75" font-family="Helvetica,sans-Serif" font-size="10.00">quadraticProbe</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="210.5,-239.88 157,-239.88 157,-220.62 210.5,-220.62 210.5,-239.88"/>
-<text text-anchor="middle" x="183.75" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.46,-137.75C76.24,-157.25 104,-190.65 134.5,-211.25 138.17,-213.73 142.22,-215.96 146.35,-217.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.71,-221.04 155.28,-221.77 147.47,-214.61 144.71,-221.04"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-202.5 134.5,-202.5 134.5,-172 233,-172 233,-202.5"/>
-<text text-anchor="start" x="142.5" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="183.75" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.32,-137.98C99.9,-146.61 121.9,-157.4 140.82,-166.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.09,-169.73 149.61,-170.99 142.18,-163.45 139.09,-169.73"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="210.5,-153.88 157,-153.88 157,-134.62 210.5,-134.62 210.5,-153.88"/>
-<text text-anchor="middle" x="183.75" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.84,-130.32C114.34,-132.89 131.23,-135.7 145.77,-138.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.92,-141.52 155.36,-139.7 146.07,-134.61 144.92,-141.52"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-116.5 134.5,-116.5 134.5,-86 233,-86 233,-116.5"/>
-<text text-anchor="start" x="142.5" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="183.75" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">putProber</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.84,-114.55C106.67,-113.31 114.85,-112.01 122.91,-110.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.35,-114.21 132.68,-109.19 122.25,-107.29 123.35,-114.21"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="213.5,-67.88 154,-67.88 154,-48.62 213.5,-48.62 213.5,-67.88"/>
-<text text-anchor="middle" x="183.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.54,-106.64C93.84,-97.58 115.08,-86.22 134.5,-77.25 137.85,-75.7 141.37,-74.16 144.91,-72.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.13,-75.95 154.07,-68.93 143.49,-69.47 146.13,-75.95"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-30.5 134.5,-30.5 134.5,0 233,0 233,-30.5"/>
-<text text-anchor="start" x="142.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="183.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">searchingProber</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.32,-106.67C78.91,-88.77 106.42,-59.29 134.5,-39.25 135.68,-38.41 136.89,-37.58 138.13,-36.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.89,-39.79 146.67,-31.65 136.3,-33.79 139.89,-39.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph.map b/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph.map
deleted file mode 100644
index 3ba98500f..000000000
--- a/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="quadratic_probing::rehash" name="quadratic_probing::rehash">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,80,137,121"/>
-<area shape="rect" id="Node000002" href="$d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9" title=" " alt="" coords="185,88,337,114"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="137,107,169,107,169,112,137,112"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="594,5,666,31"/>
-<area shape="poly" id="edge10_Node000001_Node000004" title=" " alt="" coords="136,83,184,73,404,40,579,20,579,26,405,46,185,78,137,88"/>
-<area shape="poly" id="edge9_Node000002_Node000001" title=" " alt="" coords="184,95,153,95,153,89,184,89"/>
-<area shape="rect" id="Node000003" href="$d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" title=" " alt="" coords="385,112,516,153"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="338,111,370,117,369,122,337,116"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="472,110,513,76,563,41,579,33,581,38,566,46,516,80,476,114"/>
-<area shape="rect" id="Node000005" href="$d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" title=" " alt="" coords="564,55,696,96"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="515,109,549,99,550,104,517,115"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="594,120,666,146"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="517,130,579,130,579,136,517,136"/>
-<area shape="rect" id="Node000007" href="$d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" title=" " alt="" coords="564,170,696,210"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="517,151,550,162,549,167,515,156"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/round.html#" title=" " alt="" coords="590,235,670,260"/>
-<area shape="poly" id="edge7_Node000003_Node000008" title=" " alt="" coords="476,152,516,186,566,220,577,226,575,231,563,224,513,190,472,156"/>
-<area shape="rect" id="Node000009" href="$d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" title=" " alt="" coords="564,284,696,325"/>
-<area shape="poly" id="edge8_Node000003_Node000009" title=" " alt="" coords="467,152,507,210,535,242,566,271,570,274,567,278,563,275,531,245,503,213,462,155"/>
-</map>
diff --git a/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph.md5 b/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph.md5
deleted file mode 100644
index 2e3c393bd..000000000
--- a/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-68aa2a1fd2c8d71126fc48a6daad021c
\ No newline at end of file
diff --git a/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph.svg b/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph.svg
deleted file mode 100644
index 49c45bf99..000000000
--- a/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph.svg
+++ /dev/null
@@ -1,271 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: quadratic_probing::rehash Pages: 1 -->
-<!--zoomable 248 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 526;
-var viewHeight = 248;
-var sectionId = 'dynsection-5';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>quadratic_probing::rehash</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-183.5 0,-183.5 0,-153 98.5,-153 98.5,-183.5"/>
-<text text-anchor="start" x="8" y="-170" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="49.25" y="-158.75" font-family="Helvetica,sans-Serif" font-size="10.00">rehash</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.75,-177.88 134.5,-177.88 134.5,-158.62 248.75,-158.62 248.75,-177.88"/>
-<text text-anchor="middle" x="191.62" y="-164.38" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.95,-161.79C106.7,-161.57 114.84,-161.48 122.93,-161.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.75,-165 132.79,-161.6 122.82,-158 122.75,-165"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="495.25,-239.88 441.75,-239.88 441.75,-220.62 495.25,-220.62 495.25,-239.88"/>
-<text text-anchor="middle" x="468.5" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge10_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge10_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.65,-179.98C110.35,-182.59 122.84,-185.19 134.5,-187.25 241.27,-206.14 368.69,-220.28 430.38,-226.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.66,-230.05 439.96,-227.57 430.37,-223.08 429.66,-230.05"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node1 -->
-<g id="edge9_Node000002_Node000001" class="edge">
-<title>Node2&#45;&gt;Node1</title>
-<g id="a_edge9_Node000002_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.3,-174.88C126.44,-175.02 118.33,-175.04 110.4,-174.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.53,-171.44 100.47,-174.74 110.39,-178.44 110.53,-171.44"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-159.5 284.75,-159.5 284.75,-129 383.25,-129 383.25,-159.5"/>
-<text text-anchor="start" x="292.75" y="-146" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="334" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">quadraticProbe</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.91,-158.63C256.9,-157.26 265.13,-155.85 273.18,-154.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.63,-157.95 282.89,-152.82 272.45,-151.05 273.63,-157.95"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M351.65,-159.98C367.91,-174.71 393.84,-196.58 419.25,-211.25 422.9,-213.35 426.82,-215.32 430.8,-217.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.33,-220.32 439.9,-220.97 432.05,-213.87 429.33,-220.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="517.75,-202.5 419.25,-202.5 419.25,-172 517.75,-172 517.75,-202.5"/>
-<text text-anchor="start" x="427.25" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="468.5" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M383.21,-159.9C391.34,-162.53 399.86,-165.3 408.23,-168.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="407.07,-171.32 417.66,-171.08 409.23,-164.66 407.07,-171.32"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="495.25,-153.88 441.75,-153.88 441.75,-134.62 495.25,-134.62 495.25,-153.88"/>
-<text text-anchor="middle" x="468.5" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M383.59,-144.25C399.09,-144.25 415.98,-144.25 430.52,-144.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="430.09,-147.75 440.09,-144.25 430.09,-140.75 430.09,-147.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="517.75,-116.5 419.25,-116.5 419.25,-86 517.75,-86 517.75,-116.5"/>
-<text text-anchor="start" x="427.25" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="468.5" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">putProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M383.21,-128.6C391.34,-125.97 399.86,-123.2 408.23,-120.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="409.23,-123.84 417.66,-117.42 407.07,-117.18 409.23,-123.84"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="498.25,-67.88 438.75,-67.88 438.75,-48.62 498.25,-48.62 498.25,-67.88"/>
-<text text-anchor="middle" x="468.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M351.65,-128.52C367.91,-113.79 393.84,-91.92 419.25,-77.25 422.03,-75.65 424.97,-74.12 427.97,-72.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.14,-75.99 436.89,-68.76 426.32,-69.58 429.14,-75.99"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="517.75,-30.5 419.25,-30.5 419.25,0 517.75,0 517.75,-30.5"/>
-<text text-anchor="start" x="427.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="468.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">searchingProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M344.44,-128.59C358.46,-106.37 386.67,-65.49 419.25,-39.25 420.2,-38.49 421.17,-37.74 422.17,-37.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.88,-40.07 430.36,-31.69 420.07,-34.2 423.88,-40.07"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph_org.svg b/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph_org.svg
deleted file mode 100644
index 47a34c5a2..000000000
--- a/d4/dd2/namespacequadratic__probing_ada6f1f44f7e83b0094fbcbe170788486_cgraph_org.svg
+++ /dev/null
@@ -1,188 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: quadratic_probing::rehash Pages: 1 -->
-<svg width="526pt" height="248pt"
- viewBox="0.00 0.00 525.75 247.88" 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 243.88)">
-<title>quadratic_probing::rehash</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-183.5 0,-183.5 0,-153 98.5,-153 98.5,-183.5"/>
-<text text-anchor="start" x="8" y="-170" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="49.25" y="-158.75" font-family="Helvetica,sans-Serif" font-size="10.00">rehash</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.75,-177.88 134.5,-177.88 134.5,-158.62 248.75,-158.62 248.75,-177.88"/>
-<text text-anchor="middle" x="191.62" y="-164.38" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.95,-161.79C106.7,-161.57 114.84,-161.48 122.93,-161.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.75,-165 132.79,-161.6 122.82,-158 122.75,-165"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="495.25,-239.88 441.75,-239.88 441.75,-220.62 495.25,-220.62 495.25,-239.88"/>
-<text text-anchor="middle" x="468.5" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge10_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge10_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.65,-179.98C110.35,-182.59 122.84,-185.19 134.5,-187.25 241.27,-206.14 368.69,-220.28 430.38,-226.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.66,-230.05 439.96,-227.57 430.37,-223.08 429.66,-230.05"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node1 -->
-<g id="edge9_Node000002_Node000001" class="edge">
-<title>Node2&#45;&gt;Node1</title>
-<g id="a_edge9_Node000002_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.3,-174.88C126.44,-175.02 118.33,-175.04 110.4,-174.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.53,-171.44 100.47,-174.74 110.39,-178.44 110.53,-171.44"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-159.5 284.75,-159.5 284.75,-129 383.25,-129 383.25,-159.5"/>
-<text text-anchor="start" x="292.75" y="-146" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="334" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">quadraticProbe</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.91,-158.63C256.9,-157.26 265.13,-155.85 273.18,-154.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.63,-157.95 282.89,-152.82 272.45,-151.05 273.63,-157.95"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M351.65,-159.98C367.91,-174.71 393.84,-196.58 419.25,-211.25 422.9,-213.35 426.82,-215.32 430.8,-217.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.33,-220.32 439.9,-220.97 432.05,-213.87 429.33,-220.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="517.75,-202.5 419.25,-202.5 419.25,-172 517.75,-172 517.75,-202.5"/>
-<text text-anchor="start" x="427.25" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="468.5" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M383.21,-159.9C391.34,-162.53 399.86,-165.3 408.23,-168.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="407.07,-171.32 417.66,-171.08 409.23,-164.66 407.07,-171.32"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="495.25,-153.88 441.75,-153.88 441.75,-134.62 495.25,-134.62 495.25,-153.88"/>
-<text text-anchor="middle" x="468.5" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M383.59,-144.25C399.09,-144.25 415.98,-144.25 430.52,-144.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="430.09,-147.75 440.09,-144.25 430.09,-140.75 430.09,-147.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="517.75,-116.5 419.25,-116.5 419.25,-86 517.75,-86 517.75,-116.5"/>
-<text text-anchor="start" x="427.25" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="468.5" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">putProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M383.21,-128.6C391.34,-125.97 399.86,-123.2 408.23,-120.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="409.23,-123.84 417.66,-117.42 407.07,-117.18 409.23,-123.84"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="498.25,-67.88 438.75,-67.88 438.75,-48.62 498.25,-48.62 498.25,-67.88"/>
-<text text-anchor="middle" x="468.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M351.65,-128.52C367.91,-113.79 393.84,-91.92 419.25,-77.25 422.03,-75.65 424.97,-74.12 427.97,-72.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.14,-75.99 436.89,-68.76 426.32,-69.58 429.14,-75.99"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="517.75,-30.5 419.25,-30.5 419.25,0 517.75,0 517.75,-30.5"/>
-<text text-anchor="start" x="427.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="468.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">searchingProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M344.44,-128.59C358.46,-106.37 386.67,-65.49 419.25,-39.25 420.2,-38.49 421.17,-37.74 422.17,-37.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.88,-40.07 430.36,-31.69 420.07,-34.2 423.88,-40.07"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html b/d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html
index e4ebed2f5..5f9034cc4 100644
--- a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html
+++ b/d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: geometry::jarvis::Convexhull Class Reference</title>
+<title>TheAlgorithms/C++: geometry::jarvis::Convexhull Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,9 +137,9 @@ Collaboration diagram for geometry::jarvis::Convexhull:</div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:a8306e48040a8570e164c58d1c530f870" id="r_a8306e48040a8570e164c58d1c530f870"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8306e48040a8570e164c58d1c530f870">Convexhull</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> &gt; &amp;pointList)</td></tr>
+<tr class="memitem:a8306e48040a8570e164c58d1c530f870" id="r_a8306e48040a8570e164c58d1c530f870"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8306e48040a8570e164c58d1c530f870">Convexhull</a> (const std::vector&lt; <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> &gt; &amp;pointList)</td></tr>
 <tr class="separator:a8306e48040a8570e164c58d1c530f870"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aeec46e86786ddd461464b07a77c4d5f1" id="r_aeec46e86786ddd461464b07a77c4d5f1"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aeec46e86786ddd461464b07a77c4d5f1">getConvexHull</a> () const</td></tr>
+<tr class="memitem:aeec46e86786ddd461464b07a77c4d5f1" id="r_aeec46e86786ddd461464b07a77c4d5f1"><td class="memItemLeft" align="right" valign="top">std::vector&lt; <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aeec46e86786ddd461464b07a77c4d5f1">getConvexHull</a> () const</td></tr>
 <tr class="separator:aeec46e86786ddd461464b07a77c4d5f1"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-static-methods" name="pub-static-methods"></a>
@@ -132,15 +149,15 @@ Static Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a835cd4cdc5a644abb84535197d753b02" id="r_a835cd4cdc5a644abb84535197d753b02"><td class="memItemLeft" align="right" valign="top"><a id="a835cd4cdc5a644abb84535197d753b02" name="a835cd4cdc5a644abb84535197d753b02"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>points</b></td></tr>
+<tr class="memitem:a835cd4cdc5a644abb84535197d753b02" id="r_a835cd4cdc5a644abb84535197d753b02"><td class="memItemLeft" align="right" valign="top">std::vector&lt; <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a835cd4cdc5a644abb84535197d753b02">points</a></td></tr>
 <tr class="separator:a835cd4cdc5a644abb84535197d753b02"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2272bb62c35af959953b0ea06b010036" id="r_a2272bb62c35af959953b0ea06b010036"><td class="memItemLeft" align="right" valign="top"><a id="a2272bb62c35af959953b0ea06b010036" name="a2272bb62c35af959953b0ea06b010036"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>size</b></td></tr>
+<tr class="memitem:a2272bb62c35af959953b0ea06b010036" id="r_a2272bb62c35af959953b0ea06b010036"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2272bb62c35af959953b0ea06b010036">size</a></td></tr>
 <tr class="separator:a2272bb62c35af959953b0ea06b010036"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Class which can be called from main and is globally available throughout the code </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html">jarvis_algorithm.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a8306e48040a8570e164c58d1c530f870" name="a8306e48040a8570e164c58d1c530f870"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a8306e48040a8570e164c58d1c530f870">&#9670;&#160;</a></span>Convexhull()</h2>
@@ -154,7 +171,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>size</b></td></tr>
         <tr>
           <td class="memname">geometry::jarvis::Convexhull::Convexhull </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>pointList</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>pointList</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -172,16 +189,13 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>size</b></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html#l00066">66</a> of file <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html">jarvis_algorithm.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   66</span>                                                                   {</div>
 <div class="line"><span class="lineno">   67</span>                points = pointList;</div>
 <div class="line"><span class="lineno">   68</span>                size = points.size();</div>
 <div class="line"><span class="lineno">   69</span>            }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph.svg" width="362" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Function Documentation</h2>
@@ -195,7 +209,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> &gt; geometry::jarvis::Convexhull::getConvexHull </td>
+          <td class="memname">std::vector&lt; <a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> &gt; geometry::jarvis::Convexhull::getConvexHull </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td> const</td>
@@ -209,9 +223,11 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 <p>Creates convex hull of a set of n points. There must be 3 points at least for the convex hull to exist</p>
 <dl class="section return"><dt>Returns</dt><dd>an vector array containing points in space which enclose all given points thus forming a hull </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html#l00078">78</a> of file <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html">jarvis_algorithm.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   78</span>                                                   {</div>
 <div class="line"><span class="lineno">   79</span>                <span class="comment">// Initialize Result</span></div>
-<div class="line"><span class="lineno">   80</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Point&gt;</a> hull;</div>
+<div class="line"><span class="lineno">   80</span>                std::vector&lt;Point&gt; hull;</div>
 <div class="line"><span class="lineno">   81</span> </div>
 <div class="line"><span class="lineno">   82</span>                <span class="comment">// Find the leftmost point</span></div>
 <div class="line"><span class="lineno">   83</span>                <span class="keywordtype">int</span> leftmost_point = 0;</div>
@@ -226,7 +242,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   92</span>                <span class="keywordtype">int</span> p = leftmost_point, q = 0;</div>
 <div class="line"><span class="lineno">   93</span>                <span class="keywordflow">do</span> {</div>
 <div class="line"><span class="lineno">   94</span>                    <span class="comment">// Add current point to result</span></div>
-<div class="line"><span class="lineno">   95</span>                    hull.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(points[p]);</div>
+<div class="line"><span class="lineno">   95</span>                    hull.push_back(points[p]);</div>
 <div class="line"><span class="lineno">   96</span> </div>
 <div class="line"><span class="lineno">   97</span>                    <span class="comment">// Search for a point &#39;q&#39; such that orientation(p, x, q)</span></div>
 <div class="line"><span class="lineno">   98</span>                    <span class="comment">// is counterclockwise for all points &#39;x&#39;. The idea</span></div>
@@ -251,15 +267,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  117</span> </div>
 <div class="line"><span class="lineno">  118</span>                <span class="keywordflow">return</span> hull;</div>
 <div class="line"><span class="lineno">  119</span>            }</div>
-<div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html_a54df5f9a8f37170bd97c91127664655c"><div class="ttname"><a href="#a54df5f9a8f37170bd97c91127664655c">geometry::jarvis::Convexhull::orientation</a></div><div class="ttdeci">static int orientation(const Point &amp;p, const Point &amp;q, const Point &amp;r)</div><div class="ttdef"><b>Definition</b> jarvis_algorithm.cpp:133</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull_aeec46e86786ddd461464b07a77c4d5f1_cgraph.svg" width="434" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html_a54df5f9a8f37170bd97c91127664655c"><div class="ttname"><a href="#a54df5f9a8f37170bd97c91127664655c">geometry::jarvis::Convexhull::orientation</a></div><div class="ttdeci">static int orientation(const Point &amp;p, const Point &amp;q, const Point &amp;r)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d8d/jarvis__algorithm_8cpp_source.html#l00133">jarvis_algorithm.cpp:133</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a54df5f9a8f37170bd97c91127664655c" name="a54df5f9a8f37170bd97c91127664655c"></a>
@@ -306,6 +315,8 @@ Here is the call graph for this function:</div>
 1 -&gt; Clock Wise </dd>
 <dd>
 2 -&gt; Anti Clock Wise </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html#l00133">133</a> of file <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html">jarvis_algorithm.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  133</span>                                                                                   {</div>
 <div class="line"><span class="lineno">  134</span>                <span class="keywordtype">int</span> val = (q.y - p.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>) * (r.x - q.x) - (q.x - p.x) * (r.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> - q.y);</div>
 <div class="line"><span class="lineno">  135</span> </div>
@@ -314,12 +325,61 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  138</span>                }</div>
 <div class="line"><span class="lineno">  139</span>                <span class="keywordflow">return</span> (val &gt; 0) ? 1 : 2;</div>
 <div class="line"><span class="lineno">  140</span>            }</div>
-<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:14</div></div>
+<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00014">line_segment_intersection.cpp:14</a></div></div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a835cd4cdc5a644abb84535197d753b02" name="a835cd4cdc5a644abb84535197d753b02"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a835cd4cdc5a644abb84535197d753b02">&#9670;&#160;</a></span>points</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;<a class="el" href="../../d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a>&gt; geometry::jarvis::Convexhull::points</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html#l00056">56</a> of file <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html">jarvis_algorithm.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a2272bb62c35af959953b0ea06b010036" name="a2272bb62c35af959953b0ea06b010036"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a2272bb62c35af959953b0ea06b010036">&#9670;&#160;</a></span>size</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int geometry::jarvis::Convexhull::size</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html">jarvis_algorithm.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>geometry/<a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp.html">jarvis_algorithm.cpp</a></li>
+<li>geometry/<a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html">jarvis_algorithm.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph.map b/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph.map
deleted file mode 100644
index 7cd03d7f9..000000000
--- a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="geometry::jarvis::Convexhull::Convexhull" name="geometry::jarvis::Convexhull::Convexhull">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,193,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="241,13,356,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="193,23,225,23,225,28,193,28"/>
-</map>
diff --git a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph.md5 b/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph.md5
deleted file mode 100644
index d9721da44..000000000
--- a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-338f0391ac008f02ef02520a335582e7
\ No newline at end of file
diff --git a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph.svg b/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph.svg
deleted file mode 100644
index 59e584694..000000000
--- a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: geometry::jarvis::Convexhull::Convexhull Pages: 1 -->
-<svg width="271pt" height="39pt"
- viewBox="0.00 0.00 271.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>geometry::jarvis::Convexhull::Convexhull</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="140.5,-30.5 0,-30.5 0,0 140.5,0 140.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
-<text text-anchor="middle" x="70.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Convexhull</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263,-24.88 176.5,-24.88 176.5,-5.63 263,-5.63 263,-24.88"/>
-<text text-anchor="middle" x="219.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.68,-15.25C148.81,-15.25 157.02,-15.25 164.89,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.64,-18.75 174.64,-15.25 164.64,-11.75 164.64,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph_org.svg b/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph_org.svg
deleted file mode 100644
index ed753ce9f..000000000
--- a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_a8306e48040a8570e164c58d1c530f870_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: geometry::jarvis::Convexhull::Convexhull Pages: 1 -->
-<svg width="271pt" height="39pt"
- viewBox="0.00 0.00 271.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>geometry::jarvis::Convexhull::Convexhull</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="140.5,-30.5 0,-30.5 0,0 140.5,0 140.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
-<text text-anchor="middle" x="70.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Convexhull</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263,-24.88 176.5,-24.88 176.5,-5.63 263,-5.63 263,-24.88"/>
-<text text-anchor="middle" x="219.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.68,-15.25C148.81,-15.25 157.02,-15.25 164.89,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.64,-18.75 174.64,-15.25 164.64,-11.75 164.64,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_aeec46e86786ddd461464b07a77c4d5f1_cgraph.map b/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_aeec46e86786ddd461464b07a77c4d5f1_cgraph.map
deleted file mode 100644
index fe57ac6e1..000000000
--- a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_aeec46e86786ddd461464b07a77c4d5f1_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="geometry::jarvis::Convexhull::getConvexHull" name="geometry::jarvis::Convexhull::getConvexHull">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,35,193,75"/>
-<area shape="rect" id="Node000002" href="$d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c" title=" " alt="" coords="241,5,428,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="193,41,225,37,226,42,194,46"/>
-<area shape="rect" id="Node000003" 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="257,70,412,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="194,64,242,69,241,75,193,69"/>
-</map>
diff --git a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_aeec46e86786ddd461464b07a77c4d5f1_cgraph.md5 b/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_aeec46e86786ddd461464b07a77c4d5f1_cgraph.md5
deleted file mode 100644
index f71bb1ca8..000000000
--- a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_aeec46e86786ddd461464b07a77c4d5f1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1efcceaf1056373d776ef1f37ef39a3e
\ No newline at end of file
diff --git a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_aeec46e86786ddd461464b07a77c4d5f1_cgraph.svg b/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_aeec46e86786ddd461464b07a77c4d5f1_cgraph.svg
deleted file mode 100644
index 08259576e..000000000
--- a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_aeec46e86786ddd461464b07a77c4d5f1_cgraph.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: geometry::jarvis::Convexhull::getConvexHull Pages: 1 -->
-<svg width="325pt" height="76pt"
- viewBox="0.00 0.00 325.00 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>geometry::jarvis::Convexhull::getConvexHull</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="140.5,-45.88 0,-45.88 0,-15.37 140.5,-15.37 140.5,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
-<text text-anchor="middle" x="70.25" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::getConvexHull</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="317,-67.88 176.5,-67.88 176.5,-37.38 317,-37.38 317,-67.88"/>
-<text text-anchor="start" x="184.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
-<text text-anchor="middle" x="246.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::orientation</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.97,-39.41C148.84,-40.41 156.91,-41.42 164.91,-42.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.28,-45.88 174.64,-43.66 165.16,-38.94 164.28,-45.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.62,-19.25 188.88,-19.25 188.88,0 304.62,0 304.62,-19.25"/>
-<text text-anchor="middle" x="246.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.97,-22.23C152.91,-20.8 165.31,-19.31 177.22,-17.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.45,-21.37 186.96,-16.7 176.61,-14.42 177.45,-21.37"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_aeec46e86786ddd461464b07a77c4d5f1_cgraph_org.svg b/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_aeec46e86786ddd461464b07a77c4d5f1_cgraph_org.svg
deleted file mode 100644
index c8a20f7ef..000000000
--- a/d4/dde/classgeometry_1_1jarvis_1_1_convexhull_aeec46e86786ddd461464b07a77c4d5f1_cgraph_org.svg
+++ /dev/null
@@ -1,59 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: geometry::jarvis::Convexhull::getConvexHull Pages: 1 -->
-<svg width="325pt" height="76pt"
- viewBox="0.00 0.00 325.00 75.88" 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 71.88)">
-<title>geometry::jarvis::Convexhull::getConvexHull</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="140.5,-45.88 0,-45.88 0,-15.37 140.5,-15.37 140.5,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
-<text text-anchor="middle" x="70.25" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::getConvexHull</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="317,-67.88 176.5,-67.88 176.5,-37.38 317,-37.38 317,-67.88"/>
-<text text-anchor="start" x="184.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
-<text text-anchor="middle" x="246.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::orientation</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.97,-39.41C148.84,-40.41 156.91,-41.42 164.91,-42.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.28,-45.88 174.64,-43.66 165.16,-38.94 164.28,-45.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.62,-19.25 188.88,-19.25 188.88,0 304.62,0 304.62,-19.25"/>
-<text text-anchor="middle" x="246.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.97,-22.23C152.91,-20.8 165.31,-19.31 177.22,-17.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.45,-21.37 186.96,-16.7 176.61,-14.42 177.45,-21.37"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/de6/namespacepostfix__expression.html b/d4/de6/namespacepostfix__expression.html
index f36d29fa5..ab7a9c779 100644
--- a/d4/de6/namespacepostfix__expression.html
+++ b/d4/de6/namespacepostfix__expression.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: postfix_expression Namespace Reference</title>
+<title>TheAlgorithms/C++: postfix_expression Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.map b/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.map
index 708af4509..be3d4884a 100644
--- a/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.map
+++ b/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.map
@@ -1,7 +1,5 @@
 <map id="hashing::sha256::Hash" name="hashing::sha256::Hash">
-<area shape="rect" id="Node000001" title="Contains hash array and functions to update it and convert it to a hexadecimal string." alt="" coords="5,198,161,223"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array.html" title=" " alt="" coords="21,94,145,135"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="86,150,86,197,80,197,80,150"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="36,5,130,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="86,46,86,93,80,93,80,46"/>
+<area shape="rect" id="Node000001" title="Contains hash array and functions to update it and convert it to a hexadecimal string." alt="" coords="5,109,161,135"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="21,5,145,46"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="86,61,86,109,80,109,80,61"/>
 </map>
diff --git a/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.md5 b/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.md5
index 7481c1a9f..dcc95552d 100644
--- a/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.md5
+++ b/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.md5
@@ -1 +1 @@
-b83f22d97dfcac6bc915a12d03c7771b
\ No newline at end of file
+8631aee97e3e9debd6c3751bb657ac77
\ No newline at end of file
diff --git a/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.svg b/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.svg
index bb8c5af12..c7259c01c 100644
--- a/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.svg
+++ b/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.svg
@@ -4,8 +4,8 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: hashing::sha256::Hash Pages: 1 -->
-<svg width="125pt" height="172pt"
- viewBox="0.00 0.00 124.50 171.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="125pt" height="105pt"
+ viewBox="0.00 0.00 124.50 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
 <svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
@@ -17,7 +17,7 @@
 ]]></style>
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
 <svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 167.5)">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 101)">
 <title>hashing::sha256::Hash</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="104.5,-97 12,-97 12,-66.5 104.5,-66.5 104.5,-97"/>
 <text text-anchor="start" x="20" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; uint32</text>
 <text text-anchor="middle" x="58.25" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">_t, 8 &gt;</text>
@@ -48,25 +48,6 @@
 </g>
 <text text-anchor="middle" x="70.25" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> hash</text>
 </g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="93.25,-163.5 23.25,-163.5 23.25,-144.25 93.25,-144.25 93.25,-163.5"/>
-<text text-anchor="middle" x="58.25" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint32_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M58.25,-132.67C58.25,-121.41 58.25,-107.64 58.25,-97.42"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="54.75,-132.48 58.25,-142.48 61.75,-132.48 54.75,-132.48"/>
-</a>
-</g>
-<text text-anchor="middle" x="79.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
 </g>
 </svg>
 </svg>
diff --git a/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph_org.svg b/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph_org.svg
index 73a048ff8..faee6e211 100644
--- a/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph_org.svg
+++ b/d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph_org.svg
@@ -4,9 +4,9 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: hashing::sha256::Hash Pages: 1 -->
-<svg width="125pt" height="172pt"
- viewBox="0.00 0.00 124.50 171.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 167.5)">
+<svg width="125pt" height="105pt"
+ viewBox="0.00 0.00 124.50 105.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 101)">
 <title>hashing::sha256::Hash</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="104.5,-97 12,-97 12,-66.5 104.5,-66.5 104.5,-97"/>
 <text text-anchor="start" x="20" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; uint32</text>
 <text text-anchor="middle" x="58.25" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">_t, 8 &gt;</text>
@@ -37,24 +37,5 @@
 </g>
 <text text-anchor="middle" x="70.25" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> hash</text>
 </g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="93.25,-163.5 23.25,-163.5 23.25,-144.25 93.25,-144.25 93.25,-163.5"/>
-<text text-anchor="middle" x="58.25" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint32_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M58.25,-132.67C58.25,-121.41 58.25,-107.64 58.25,-97.42"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="54.75,-132.48 58.25,-142.48 61.75,-132.48 54.75,-132.48"/>
-</a>
-</g>
-<text text-anchor="middle" x="79.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
 </g>
 </svg>
diff --git a/d4/ded/namespaceprobability.html b/d4/ded/namespaceprobability.html
index 240fd5b70..0ef501818 100644
--- a/d4/ded/namespaceprobability.html
+++ b/d4/ded/namespaceprobability.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: probability Namespace Reference</title>
+<title>TheAlgorithms/C++: probability Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -112,8 +129,8 @@ $(function(){initNavTree('d4/ded/namespaceprobability.html','../../'); initResiz
 <a href="#details">More...</a></p>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Probability algorithms. </p>
-<p>for assert for math functions for fixed size data types for time to initialize rng for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">std::numeric_limits</a> for random numbers for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
-<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> - needed in testing for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a> - needed in testing for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a> - used to manage sliding window for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset.html">std::multiset</a> - used to manage multi-value sorted sliding window values for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> - needed in testing </p>
+<p>for assert for math functions for fixed size data types for time to initialize rng for std::cout for std::numeric_limits for random numbers for std::vector</p>
+<p>for assert for std::rand - needed in testing for std::time - needed in testing for std::list - used to manage sliding window for std::multiset - used to manage multi-value sorted sliding window values for std::vector - needed in testing </p>
 </div></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/d4/def/kohonen__som__topology_8cpp.html b/d4/def/kohonen__som__topology_8cpp.html
index d115c042b..9ec6e60b3 100644
--- a/d4/def/kohonen__som__topology_8cpp.html
+++ b/d4/def/kohonen__som__topology_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: machine_learning/kohonen_som_topology.cpp File Reference</title>
+<title>TheAlgorithms/C++: machine_learning/kohonen_som_topology.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -131,7 +148,9 @@ Include dependency graph for kohonen_som_topology.cpp:</div>
 <div class="dyncontent">
 <div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/dcd/kohonen__som__topology_8cpp__incl.svg" width="100%" height="394"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
 </div>
-</div><table class="memberdecls">
+</div>
+<p><a href="../../d4/def/kohonen__som__topology_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></td></tr>
@@ -142,25 +161,25 @@ Namespaces</h2></td></tr>
 Functions</h2></td></tr>
 <tr class="memitem:gaf5ce14f026d6d231bef29161bac2b485" id="r_gaf5ce14f026d6d231bef29161bac2b485"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a> (double a, double b)</td></tr>
 <tr class="separator:gaf5ce14f026d6d231bef29161bac2b485"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:gabc90175770bf0d5853c466e14993a08c" id="r_gabc90175770bf0d5853c466e14993a08c"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c">save_2d_data</a> (const char *fname, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;X)</td></tr>
+<tr class="memitem:gabc90175770bf0d5853c466e14993a08c" id="r_gabc90175770bf0d5853c466e14993a08c"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c">save_2d_data</a> (const char *fname, const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</td></tr>
 <tr class="separator:gabc90175770bf0d5853c466e14993a08c"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ga60f9186ccb682724a8792a2bf81e9b9e" id="r_ga60f9186ccb682724a8792a2bf81e9b9e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e">get_min_2d</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;X, double *val, int *x_idx, int *y_idx)</td></tr>
+<tr class="memitem:ga60f9186ccb682724a8792a2bf81e9b9e" id="r_ga60f9186ccb682724a8792a2bf81e9b9e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e">get_min_2d</a> (const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X, double *val, int *x_idx, int *y_idx)</td></tr>
 <tr class="separator:ga60f9186ccb682724a8792a2bf81e9b9e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa72a53c88203fde278f1fe6c3afe5b07" id="r_aa72a53c88203fde278f1fe6c3afe5b07"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#aa72a53c88203fde278f1fe6c3afe5b07">machine_learning::save_u_matrix</a> (const char *fname, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &amp;W)</td></tr>
+<tr class="memitem:aa72a53c88203fde278f1fe6c3afe5b07" id="r_aa72a53c88203fde278f1fe6c3afe5b07"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#aa72a53c88203fde278f1fe6c3afe5b07">machine_learning::save_u_matrix</a> (const char *fname, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;W)</td></tr>
 <tr class="separator:aa72a53c88203fde278f1fe6c3afe5b07"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae868ad43698a1d69ba46ea3827d7d2c3" id="r_ae868ad43698a1d69ba46ea3827d7d2c3"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3">machine_learning::update_weights</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;X, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; *W, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *D, double alpha, int R)</td></tr>
+<tr class="memitem:ae868ad43698a1d69ba46ea3827d7d2c3" id="r_ae868ad43698a1d69ba46ea3827d7d2c3"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3">machine_learning::update_weights</a> (const std::valarray&lt; double &gt; &amp;X, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; *W, std::vector&lt; std::valarray&lt; double &gt; &gt; *D, double alpha, int R)</td></tr>
 <tr class="separator:ae868ad43698a1d69ba46ea3827d7d2c3"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ac43d294e21a0c4fa33c53757df054576" id="r_ac43d294e21a0c4fa33c53757df054576"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576">machine_learning::kohonen_som</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;X, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; *W, double alpha_min)</td></tr>
+<tr class="memitem:ac43d294e21a0c4fa33c53757df054576" id="r_ac43d294e21a0c4fa33c53757df054576"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576">machine_learning::kohonen_som</a> (const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; *W, double alpha_min)</td></tr>
 <tr class="separator:ac43d294e21a0c4fa33c53757df054576"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a48efb079040c7aaa3a4917a0e486cba9" id="r_a48efb079040c7aaa3a4917a0e486cba9"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a48efb079040c7aaa3a4917a0e486cba9">test_2d_classes</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
+<tr class="memitem:a48efb079040c7aaa3a4917a0e486cba9" id="r_a48efb079040c7aaa3a4917a0e486cba9"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a48efb079040c7aaa3a4917a0e486cba9">test_2d_classes</a> (std::vector&lt; std::valarray&lt; double &gt; &gt; *<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
 <tr class="separator:a48efb079040c7aaa3a4917a0e486cba9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a1440a7779ac56f47a3f355ce4a8c7da0" id="r_a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a> ()</td></tr>
 <tr class="separator:a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a1302662a56ebf67a21249270b017297e" id="r_a1302662a56ebf67a21249270b017297e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1302662a56ebf67a21249270b017297e">test_3d_classes1</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
+<tr class="memitem:a1302662a56ebf67a21249270b017297e" id="r_a1302662a56ebf67a21249270b017297e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1302662a56ebf67a21249270b017297e">test_3d_classes1</a> (std::vector&lt; std::valarray&lt; double &gt; &gt; *<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
 <tr class="separator:a1302662a56ebf67a21249270b017297e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a0283886819c7c140a023582b7269e2d0" id="r_a0283886819c7c140a023582b7269e2d0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0283886819c7c140a023582b7269e2d0">test2</a> ()</td></tr>
 <tr class="separator:a0283886819c7c140a023582b7269e2d0"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a4b7ab643f6a5002f991837de46f70653" id="r_a4b7ab643f6a5002f991837de46f70653"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4b7ab643f6a5002f991837de46f70653">test_3d_classes2</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
+<tr class="memitem:a4b7ab643f6a5002f991837de46f70653" id="r_a4b7ab643f6a5002f991837de46f70653"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4b7ab643f6a5002f991837de46f70653">test_3d_classes2</a> (std::vector&lt; std::valarray&lt; double &gt; &gt; *<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
 <tr class="separator:a4b7ab643f6a5002f991837de46f70653"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a6d0455dd5c30adda100e95f0423c786e" id="r_a6d0455dd5c30adda100e95f0423c786e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6d0455dd5c30adda100e95f0423c786e">test3</a> ()</td></tr>
 <tr class="separator:a6d0455dd5c30adda100e95f0423c786e"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -181,6 +200,8 @@ Variables</h2></td></tr>
 <dd>
 The compiled code is much slower when compiled with MS Visual C++ 2019 than with GCC on windows </dd></dl>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d9/d49/kohonen__som__trace_8cpp.html" title="Kohonen self organizing map (data tracing)">kohonen_som_trace.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a2256c10b16edba377b64a44b6c656908" name="a2256c10b16edba377b64a44b6c656908"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a2256c10b16edba377b64a44b6c656908">&#9670;&#160;</a></span>get_clock_diff()</h2>
@@ -209,6 +230,8 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>time difference in seconds </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00577">577</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  577</span>                                                      {</div>
 <div class="line"><span class="lineno">  578</span>    <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end_t - start_t) / CLOCKS_PER_SEC;</div>
 <div class="line"><span class="lineno">  579</span>}</div>
@@ -234,53 +257,45 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00582">582</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  582</span>                                {</div>
 <div class="line"><span class="lineno">  583</span><span class="preprocessor">#ifdef _OPENMP</span></div>
-<div class="line"><span class="lineno">  584</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Using OpenMP based parallelization\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  584</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Using OpenMP based parallelization\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  585</span><span class="preprocessor">#else</span></div>
-<div class="line"><span class="lineno">  586</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;NOT using OpenMP based parallelization\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  586</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;NOT using OpenMP based parallelization\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  587</span><span class="preprocessor">#endif</span></div>
 <div class="line"><span class="lineno">  588</span> </div>
-<div class="line"><span class="lineno">  589</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>));</div>
+<div class="line"><span class="lineno">  589</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
 <div class="line"><span class="lineno">  590</span> </div>
-<div class="line"><span class="lineno">  591</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> start_clk = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  591</span>    std::clock_t start_clk = std::clock();</div>
 <div class="line"><span class="lineno">  592</span>    <a class="code hl_function" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();</div>
-<div class="line"><span class="lineno">  593</span>    <span class="keyword">auto</span> end_clk = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
-<div class="line"><span class="lineno">  594</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 completed in &quot;</span> &lt;&lt; <a class="code hl_function" href="#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(start_clk, end_clk)</div>
+<div class="line"><span class="lineno">  593</span>    <span class="keyword">auto</span> end_clk = std::clock();</div>
+<div class="line"><span class="lineno">  594</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 completed in &quot;</span> &lt;&lt; <a class="code hl_function" href="#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(start_clk, end_clk)</div>
 <div class="line"><span class="lineno">  595</span>              &lt;&lt; <span class="stringliteral">&quot; sec\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  596</span> </div>
-<div class="line"><span class="lineno">  597</span>    start_clk = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  597</span>    start_clk = std::clock();</div>
 <div class="line"><span class="lineno">  598</span>    <a class="code hl_function" href="#a0283886819c7c140a023582b7269e2d0">test2</a>();</div>
-<div class="line"><span class="lineno">  599</span>    end_clk = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
-<div class="line"><span class="lineno">  600</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2 completed in &quot;</span> &lt;&lt; <a class="code hl_function" href="#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(start_clk, end_clk)</div>
+<div class="line"><span class="lineno">  599</span>    end_clk = std::clock();</div>
+<div class="line"><span class="lineno">  600</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 completed in &quot;</span> &lt;&lt; <a class="code hl_function" href="#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(start_clk, end_clk)</div>
 <div class="line"><span class="lineno">  601</span>              &lt;&lt; <span class="stringliteral">&quot; sec\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  602</span> </div>
-<div class="line"><span class="lineno">  603</span>    start_clk = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  603</span>    start_clk = std::clock();</div>
 <div class="line"><span class="lineno">  604</span>    <a class="code hl_function" href="#a6d0455dd5c30adda100e95f0423c786e">test3</a>();</div>
-<div class="line"><span class="lineno">  605</span>    end_clk = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
-<div class="line"><span class="lineno">  606</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3 completed in &quot;</span> &lt;&lt; <a class="code hl_function" href="#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(start_clk, end_clk)</div>
+<div class="line"><span class="lineno">  605</span>    end_clk = std::clock();</div>
+<div class="line"><span class="lineno">  606</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 completed in &quot;</span> &lt;&lt; <a class="code hl_function" href="#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(start_clk, end_clk)</div>
 <div class="line"><span class="lineno">  607</span>              &lt;&lt; <span class="stringliteral">&quot; sec\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  608</span> </div>
-<div class="line"><span class="lineno">  609</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div>
+<div class="line"><span class="lineno">  609</span>    std::cout</div>
 <div class="line"><span class="lineno">  610</span>        &lt;&lt; <span class="stringliteral">&quot;(Note: Calculated times include: creating test sets, training &quot;</span></div>
 <div class="line"><span class="lineno">  611</span>           <span class="stringliteral">&quot;model and writing files to disk.)\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  612</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  613</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="aclock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a></div><div class="ttdeci">T clock(T... args)</div></div>
-<div class="ttc" id="aclock_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a></div></div>
-<div class="ttc" id="akohonen__som__topology_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> kohonen_som_topology.cpp:451</div></div>
-<div class="ttc" id="akohonen__som__topology_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition</b> kohonen_som_topology.cpp:369</div></div>
-<div class="ttc" id="akohonen__som__topology_8cpp_html_a2256c10b16edba377b64a44b6c656908"><div class="ttname"><a href="#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a></div><div class="ttdeci">double get_clock_diff(clock_t start_t, clock_t end_t)</div><div class="ttdef"><b>Definition</b> kohonen_som_topology.cpp:577</div></div>
-<div class="ttc" id="akohonen__som__topology_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition</b> kohonen_som_topology.cpp:537</div></div>
-<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="akohonen__som__topology_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> <a href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00451">kohonen_som_topology.cpp:451</a></div></div>
+<div class="ttc" id="akohonen__som__topology_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition</b> <a href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00369">kohonen_som_topology.cpp:369</a></div></div>
+<div class="ttc" id="akohonen__som__topology_8cpp_html_a2256c10b16edba377b64a44b6c656908"><div class="ttname"><a href="#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a></div><div class="ttdeci">double get_clock_diff(clock_t start_t, clock_t end_t)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00577">kohonen_som_topology.cpp:577</a></div></div>
+<div class="ttc" id="akohonen__som__topology_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition</b> <a href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00537">kohonen_som_topology.cpp:537</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1440a7779ac56f47a3f355ce4a8c7da0" name="a1440a7779ac56f47a3f355ce4a8c7da0"></a>
@@ -302,21 +317,23 @@ Here is the call graph for this function:</div>
 <li><code>w11.csv</code>: initial random map</li>
 <li><code>w12.csv</code>: trained SOM map </li>
 </ul>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00369">369</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  369</span>             {</div>
 <div class="line"><span class="lineno">  370</span>    <span class="keywordtype">int</span> j = 0, <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 300;</div>
 <div class="line"><span class="lineno">  371</span>    <span class="keywordtype">int</span> features = 2;</div>
 <div class="line"><span class="lineno">  372</span>    <span class="keywordtype">int</span> num_out = 30;</div>
-<div class="line"><span class="lineno">  373</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; X(N);</div>
-<div class="line"><span class="lineno">  374</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;</a>&gt;&gt; W(num_out);</div>
-<div class="line"><span class="lineno">  375</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(num_out, N); i++) {</div>
+<div class="line"><span class="lineno">  373</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; X(N);</div>
+<div class="line"><span class="lineno">  374</span>    std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; W(num_out);</div>
+<div class="line"><span class="lineno">  375</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; std::max(num_out, N); i++) {</div>
 <div class="line"><span class="lineno">  376</span>        <span class="comment">// loop till max(N, num_out)</span></div>
 <div class="line"><span class="lineno">  377</span>        <span class="keywordflow">if</span> (i &lt; N) {  <span class="comment">// only add new arrays if i &lt; N</span></div>
-<div class="line"><span class="lineno">  378</span>            X[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(features);</div>
+<div class="line"><span class="lineno">  378</span>            X[i] = std::valarray&lt;double&gt;(features);</div>
 <div class="line"><span class="lineno">  379</span>        }</div>
 <div class="line"><span class="lineno">  380</span>        <span class="keywordflow">if</span> (i &lt; num_out) {  <span class="comment">// only add new arrays if i &lt; num_out</span></div>
-<div class="line"><span class="lineno">  381</span>            W[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt;(num_out);</div>
+<div class="line"><span class="lineno">  381</span>            W[i] = std::vector&lt;std::valarray&lt;double&gt;&gt;(num_out);</div>
 <div class="line"><span class="lineno">  382</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> &lt; num_out; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++) {</div>
-<div class="line"><span class="lineno">  383</span>                W[i][<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(features);</div>
+<div class="line"><span class="lineno">  383</span>                W[i][<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] = std::valarray&lt;double&gt;(features);</div>
 <div class="line"><span class="lineno">  384</span><span class="preprocessor">#ifdef _OPENMP</span></div>
 <div class="line"><span class="lineno">  385</span><span class="preprocessor">#pragma omp for</span></div>
 <div class="line"><span class="lineno">  386</span><span class="preprocessor">#endif</span></div>
@@ -334,20 +351,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  398</span>    kohonen_som(X, &amp;W, 1e-4);      <span class="comment">// train the SOM</span></div>
 <div class="line"><span class="lineno">  399</span>    save_u_matrix(<span class="stringliteral">&quot;w12.csv&quot;</span>, W);   <span class="comment">// save the resultant weights</span></div>
 <div class="line"><span class="lineno">  400</span>}</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-<div class="ttc" id="agroup__machine__learning_html_gabc90175770bf0d5853c466e14993a08c"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c">save_2d_data</a></div><div class="ttdeci">int save_2d_data(const char *fname, const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</div><div class="ttdef"><b>Definition</b> kohonen_som_topology.cpp:65</div></div>
-<div class="ttc" id="agroup__machine__learning_html_gaf5ce14f026d6d231bef29161bac2b485"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a></div><div class="ttdeci">double _random(double a, double b)</div><div class="ttdef"><b>Definition</b> kohonen_som_topology.cpp:53</div></div>
-<div class="ttc" id="akohonen__som__topology_8cpp_html_a48efb079040c7aaa3a4917a0e486cba9"><div class="ttname"><a href="#a48efb079040c7aaa3a4917a0e486cba9">test_2d_classes</a></div><div class="ttdeci">void test_2d_classes(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> kohonen_som_topology.cpp:330</div></div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
-<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg" width="546" height="287"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="agroup__machine__learning_html_gabc90175770bf0d5853c466e14993a08c"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c">save_2d_data</a></div><div class="ttdeci">int save_2d_data(const char *fname, const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00065">kohonen_som_topology.cpp:65</a></div></div>
+<div class="ttc" id="agroup__machine__learning_html_gaf5ce14f026d6d231bef29161bac2b485"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a></div><div class="ttdeci">double _random(double a, double b)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00053">kohonen_som_topology.cpp:53</a></div></div>
+<div class="ttc" id="akohonen__som__topology_8cpp_html_a48efb079040c7aaa3a4917a0e486cba9"><div class="ttname"><a href="#a48efb079040c7aaa3a4917a0e486cba9">test_2d_classes</a></div><div class="ttdeci">void test_2d_classes(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00330">kohonen_som_topology.cpp:330</a></div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0283886819c7c140a023582b7269e2d0" name="a0283886819c7c140a023582b7269e2d0"></a>
@@ -369,21 +378,23 @@ Here is the call graph for this function:</div>
 <li><code>w21.csv</code>: initial random map</li>
 <li><code>w22.csv</code>: trained SOM map </li>
 </ul>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00451">451</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  451</span>             {</div>
 <div class="line"><span class="lineno">  452</span>    <span class="keywordtype">int</span> j = 0, <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 300;</div>
 <div class="line"><span class="lineno">  453</span>    <span class="keywordtype">int</span> features = 3;</div>
 <div class="line"><span class="lineno">  454</span>    <span class="keywordtype">int</span> num_out = 30;</div>
-<div class="line"><span class="lineno">  455</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; X(N);</div>
-<div class="line"><span class="lineno">  456</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;</a>&gt;&gt; W(num_out);</div>
-<div class="line"><span class="lineno">  457</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(num_out, N); i++) {</div>
+<div class="line"><span class="lineno">  455</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; X(N);</div>
+<div class="line"><span class="lineno">  456</span>    std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; W(num_out);</div>
+<div class="line"><span class="lineno">  457</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; std::max(num_out, N); i++) {</div>
 <div class="line"><span class="lineno">  458</span>        <span class="comment">// loop till max(N, num_out)</span></div>
 <div class="line"><span class="lineno">  459</span>        <span class="keywordflow">if</span> (i &lt; N) {  <span class="comment">// only add new arrays if i &lt; N</span></div>
-<div class="line"><span class="lineno">  460</span>            X[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(features);</div>
+<div class="line"><span class="lineno">  460</span>            X[i] = std::valarray&lt;double&gt;(features);</div>
 <div class="line"><span class="lineno">  461</span>        }</div>
 <div class="line"><span class="lineno">  462</span>        <span class="keywordflow">if</span> (i &lt; num_out) {  <span class="comment">// only add new arrays if i &lt; num_out</span></div>
-<div class="line"><span class="lineno">  463</span>            W[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt;(num_out);</div>
+<div class="line"><span class="lineno">  463</span>            W[i] = std::vector&lt;std::valarray&lt;double&gt;&gt;(num_out);</div>
 <div class="line"><span class="lineno">  464</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> &lt; num_out; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++) {</div>
-<div class="line"><span class="lineno">  465</span>                W[i][<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(features);</div>
+<div class="line"><span class="lineno">  465</span>                W[i][<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] = std::valarray&lt;double&gt;(features);</div>
 <div class="line"><span class="lineno">  466</span><span class="preprocessor">#ifdef _OPENMP</span></div>
 <div class="line"><span class="lineno">  467</span><span class="preprocessor">#pragma omp for</span></div>
 <div class="line"><span class="lineno">  468</span><span class="preprocessor">#endif</span></div>
@@ -401,13 +412,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  480</span>    kohonen_som(X, &amp;W, 1e-4);      <span class="comment">// train the SOM</span></div>
 <div class="line"><span class="lineno">  481</span>    save_u_matrix(<span class="stringliteral">&quot;w22.csv&quot;</span>, W);   <span class="comment">// save the resultant weights</span></div>
 <div class="line"><span class="lineno">  482</span>}</div>
-<div class="ttc" id="akohonen__som__topology_8cpp_html_a1302662a56ebf67a21249270b017297e"><div class="ttname"><a href="#a1302662a56ebf67a21249270b017297e">test_3d_classes1</a></div><div class="ttdeci">void test_3d_classes1(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> kohonen_som_topology.cpp:411</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg" width="552" height="287"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="akohonen__som__topology_8cpp_html_a1302662a56ebf67a21249270b017297e"><div class="ttname"><a href="#a1302662a56ebf67a21249270b017297e">test_3d_classes1</a></div><div class="ttdeci">void test_3d_classes1(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00411">kohonen_som_topology.cpp:411</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6d0455dd5c30adda100e95f0423c786e" name="a6d0455dd5c30adda100e95f0423c786e"></a>
@@ -429,21 +435,23 @@ Here is the call graph for this function:</div>
 <li><code>w31.csv</code>: initial random map</li>
 <li><code>w32.csv</code>: trained SOM map </li>
 </ul>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00537">537</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  537</span>             {</div>
 <div class="line"><span class="lineno">  538</span>    <span class="keywordtype">int</span> j = 0, <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 500;</div>
 <div class="line"><span class="lineno">  539</span>    <span class="keywordtype">int</span> features = 3;</div>
 <div class="line"><span class="lineno">  540</span>    <span class="keywordtype">int</span> num_out = 30;</div>
-<div class="line"><span class="lineno">  541</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; X(N);</div>
-<div class="line"><span class="lineno">  542</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;</a>&gt;&gt; W(num_out);</div>
-<div class="line"><span class="lineno">  543</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(num_out, N); i++) {</div>
+<div class="line"><span class="lineno">  541</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; X(N);</div>
+<div class="line"><span class="lineno">  542</span>    std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; W(num_out);</div>
+<div class="line"><span class="lineno">  543</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; std::max(num_out, N); i++) {</div>
 <div class="line"><span class="lineno">  544</span>        <span class="comment">// loop till max(N, num_out)</span></div>
 <div class="line"><span class="lineno">  545</span>        <span class="keywordflow">if</span> (i &lt; N) {  <span class="comment">// only add new arrays if i &lt; N</span></div>
-<div class="line"><span class="lineno">  546</span>            X[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(features);</div>
+<div class="line"><span class="lineno">  546</span>            X[i] = std::valarray&lt;double&gt;(features);</div>
 <div class="line"><span class="lineno">  547</span>        }</div>
 <div class="line"><span class="lineno">  548</span>        <span class="keywordflow">if</span> (i &lt; num_out) {  <span class="comment">// only add new arrays if i &lt; num_out</span></div>
-<div class="line"><span class="lineno">  549</span>            W[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt;(num_out);</div>
+<div class="line"><span class="lineno">  549</span>            W[i] = std::vector&lt;std::valarray&lt;double&gt;&gt;(num_out);</div>
 <div class="line"><span class="lineno">  550</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> &lt; num_out; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++) {</div>
-<div class="line"><span class="lineno">  551</span>                W[i][<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(features);</div>
+<div class="line"><span class="lineno">  551</span>                W[i][<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] = std::valarray&lt;double&gt;(features);</div>
 <div class="line"><span class="lineno">  552</span><span class="preprocessor">#ifdef _OPENMP</span></div>
 <div class="line"><span class="lineno">  553</span><span class="preprocessor">#pragma omp for</span></div>
 <div class="line"><span class="lineno">  554</span><span class="preprocessor">#endif</span></div>
@@ -461,13 +469,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  566</span>    kohonen_som(X, &amp;W, 1e-4);      <span class="comment">// train the SOM</span></div>
 <div class="line"><span class="lineno">  567</span>    save_u_matrix(<span class="stringliteral">&quot;w32.csv&quot;</span>, W);   <span class="comment">// save the resultant weights</span></div>
 <div class="line"><span class="lineno">  568</span>}</div>
-<div class="ttc" id="akohonen__som__topology_8cpp_html_a4b7ab643f6a5002f991837de46f70653"><div class="ttname"><a href="#a4b7ab643f6a5002f991837de46f70653">test_3d_classes2</a></div><div class="ttdeci">void test_3d_classes2(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> kohonen_som_topology.cpp:493</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg" width="552" height="287"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="akohonen__som__topology_8cpp_html_a4b7ab643f6a5002f991837de46f70653"><div class="ttname"><a href="#a4b7ab643f6a5002f991837de46f70653">test_3d_classes2</a></div><div class="ttdeci">void test_3d_classes2(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00493">kohonen_som_topology.cpp:493</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a48efb079040c7aaa3a4917a0e486cba9" name="a48efb079040c7aaa3a4917a0e486cba9"></a>
@@ -479,7 +482,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void test_2d_classes </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; std::valarray&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -496,17 +499,19 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00330">330</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  330</span>                                                           {</div>
 <div class="line"><span class="lineno">  331</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>-&gt;size();</div>
 <div class="line"><span class="lineno">  332</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> R = 0.3;  <span class="comment">// radius of cluster</span></div>
 <div class="line"><span class="lineno">  333</span>    <span class="keywordtype">int</span> i = 0;</div>
 <div class="line"><span class="lineno">  334</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> num_classes = 4;</div>
-<div class="line"><span class="lineno">  335</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 2&gt;</a>, num_classes&gt; centres = {</div>
+<div class="line"><span class="lineno">  335</span>    std::array&lt;std::array&lt;double, 2&gt;, num_classes&gt; centres = {</div>
 <div class="line"><span class="lineno">  336</span>        <span class="comment">// centres of each class cluster</span></div>
-<div class="line"><span class="lineno">  337</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 2&gt;</a>({.5, .5}),   <span class="comment">// centre of class 1</span></div>
-<div class="line"><span class="lineno">  338</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 2&gt;</a>({.5, -.5}),  <span class="comment">// centre of class 2</span></div>
-<div class="line"><span class="lineno">  339</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 2&gt;</a>({-.5, .5}),  <span class="comment">// centre of class 3</span></div>
-<div class="line"><span class="lineno">  340</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 2&gt;</a>({-.5, -.5})  <span class="comment">// centre of class 4</span></div>
+<div class="line"><span class="lineno">  337</span>        std::array&lt;double, 2&gt;({.5, .5}),   <span class="comment">// centre of class 1</span></div>
+<div class="line"><span class="lineno">  338</span>        std::array&lt;double, 2&gt;({.5, -.5}),  <span class="comment">// centre of class 2</span></div>
+<div class="line"><span class="lineno">  339</span>        std::array&lt;double, 2&gt;({-.5, .5}),  <span class="comment">// centre of class 3</span></div>
+<div class="line"><span class="lineno">  340</span>        std::array&lt;double, 2&gt;({-.5, -.5})  <span class="comment">// centre of class 4</span></div>
 <div class="line"><span class="lineno">  341</span>    };</div>
 <div class="line"><span class="lineno">  342</span> </div>
 <div class="line"><span class="lineno">  343</span><span class="preprocessor">#ifdef _OPENMP</span></div>
@@ -514,7 +519,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  345</span><span class="preprocessor">#endif</span></div>
 <div class="line"><span class="lineno">  346</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
 <div class="line"><span class="lineno">  347</span>        <span class="comment">// select a random class for the point</span></div>
-<div class="line"><span class="lineno">  348</span>        <span class="keywordtype">int</span> cls = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % num_classes;</div>
+<div class="line"><span class="lineno">  348</span>        <span class="keywordtype">int</span> cls = std::rand() % num_classes;</div>
 <div class="line"><span class="lineno">  349</span> </div>
 <div class="line"><span class="lineno">  350</span>        <span class="comment">// create random coordinates (x,y,z) around the centre of the class</span></div>
 <div class="line"><span class="lineno">  351</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][0] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(centres[cls][0] - R, centres[cls][0] + R);</div>
@@ -526,15 +531,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  357</span><span class="comment">        */</span></div>
 <div class="line"><span class="lineno">  358</span>    }</div>
 <div class="line"><span class="lineno">  359</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/def/kohonen__som__topology_8cpp_a48efb079040c7aaa3a4917a0e486cba9_cgraph.svg" width="367" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1302662a56ebf67a21249270b017297e" name="a1302662a56ebf67a21249270b017297e"></a>
@@ -546,7 +544,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void test_3d_classes1 </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; std::valarray&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -563,17 +561,19 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00411">411</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  411</span>                                                            {</div>
 <div class="line"><span class="lineno">  412</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>-&gt;size();</div>
 <div class="line"><span class="lineno">  413</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> R = 0.3;  <span class="comment">// radius of cluster</span></div>
 <div class="line"><span class="lineno">  414</span>    <span class="keywordtype">int</span> i = 0;</div>
 <div class="line"><span class="lineno">  415</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> num_classes = 4;</div>
-<div class="line"><span class="lineno">  416</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 3&gt;</a>, num_classes&gt; centres = {</div>
+<div class="line"><span class="lineno">  416</span>    <span class="keyword">const</span> std::array&lt;std::array&lt;double, 3&gt;, num_classes&gt; centres = {</div>
 <div class="line"><span class="lineno">  417</span>        <span class="comment">// centres of each class cluster</span></div>
-<div class="line"><span class="lineno">  418</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({.5, .5, .5}),    <span class="comment">// centre of class 1</span></div>
-<div class="line"><span class="lineno">  419</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({.5, -.5, -.5}),  <span class="comment">// centre of class 2</span></div>
-<div class="line"><span class="lineno">  420</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({-.5, .5, .5}),   <span class="comment">// centre of class 3</span></div>
-<div class="line"><span class="lineno">  421</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({-.5, -.5 - .5})  <span class="comment">// centre of class 4</span></div>
+<div class="line"><span class="lineno">  418</span>        std::array&lt;double, 3&gt;({.5, .5, .5}),    <span class="comment">// centre of class 1</span></div>
+<div class="line"><span class="lineno">  419</span>        std::array&lt;double, 3&gt;({.5, -.5, -.5}),  <span class="comment">// centre of class 2</span></div>
+<div class="line"><span class="lineno">  420</span>        std::array&lt;double, 3&gt;({-.5, .5, .5}),   <span class="comment">// centre of class 3</span></div>
+<div class="line"><span class="lineno">  421</span>        std::array&lt;double, 3&gt;({-.5, -.5 - .5})  <span class="comment">// centre of class 4</span></div>
 <div class="line"><span class="lineno">  422</span>    };</div>
 <div class="line"><span class="lineno">  423</span> </div>
 <div class="line"><span class="lineno">  424</span><span class="preprocessor">#ifdef _OPENMP</span></div>
@@ -581,7 +581,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  426</span><span class="preprocessor">#endif</span></div>
 <div class="line"><span class="lineno">  427</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
 <div class="line"><span class="lineno">  428</span>        <span class="comment">// select a random class for the point</span></div>
-<div class="line"><span class="lineno">  429</span>        <span class="keywordtype">int</span> cls = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % num_classes;</div>
+<div class="line"><span class="lineno">  429</span>        <span class="keywordtype">int</span> cls = std::rand() % num_classes;</div>
 <div class="line"><span class="lineno">  430</span> </div>
 <div class="line"><span class="lineno">  431</span>        <span class="comment">// create random coordinates (x,y,z) around the centre of the class</span></div>
 <div class="line"><span class="lineno">  432</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][0] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(centres[cls][0] - R, centres[cls][0] + R);</div>
@@ -594,12 +594,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  439</span><span class="comment">        */</span></div>
 <div class="line"><span class="lineno">  440</span>    }</div>
 <div class="line"><span class="lineno">  441</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/def/kohonen__som__topology_8cpp_a1302662a56ebf67a21249270b017297e_cgraph.svg" width="374" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4b7ab643f6a5002f991837de46f70653" name="a4b7ab643f6a5002f991837de46f70653"></a>
@@ -611,7 +606,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void test_3d_classes2 </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; std::valarray&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -628,21 +623,23 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00493">493</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  493</span>                                                            {</div>
 <div class="line"><span class="lineno">  494</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>-&gt;size();</div>
 <div class="line"><span class="lineno">  495</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> R = 0.2;  <span class="comment">// radius of cluster</span></div>
 <div class="line"><span class="lineno">  496</span>    <span class="keywordtype">int</span> i = 0;</div>
 <div class="line"><span class="lineno">  497</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> num_classes = 8;</div>
-<div class="line"><span class="lineno">  498</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 3&gt;</a>, num_classes&gt; centres = {</div>
+<div class="line"><span class="lineno">  498</span>    <span class="keyword">const</span> std::array&lt;std::array&lt;double, 3&gt;, num_classes&gt; centres = {</div>
 <div class="line"><span class="lineno">  499</span>        <span class="comment">// centres of each class cluster</span></div>
-<div class="line"><span class="lineno">  500</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({.5, .5, .5}),    <span class="comment">// centre of class 1</span></div>
-<div class="line"><span class="lineno">  501</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({.5, .5, -.5}),   <span class="comment">// centre of class 2</span></div>
-<div class="line"><span class="lineno">  502</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({.5, -.5, .5}),   <span class="comment">// centre of class 3</span></div>
-<div class="line"><span class="lineno">  503</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({.5, -.5, -.5}),  <span class="comment">// centre of class 4</span></div>
-<div class="line"><span class="lineno">  504</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({-.5, .5, .5}),   <span class="comment">// centre of class 5</span></div>
-<div class="line"><span class="lineno">  505</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({-.5, .5, -.5}),  <span class="comment">// centre of class 6</span></div>
-<div class="line"><span class="lineno">  506</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({-.5, -.5, .5}),  <span class="comment">// centre of class 7</span></div>
-<div class="line"><span class="lineno">  507</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({-.5, -.5, -.5})  <span class="comment">// centre of class 8</span></div>
+<div class="line"><span class="lineno">  500</span>        std::array&lt;double, 3&gt;({.5, .5, .5}),    <span class="comment">// centre of class 1</span></div>
+<div class="line"><span class="lineno">  501</span>        std::array&lt;double, 3&gt;({.5, .5, -.5}),   <span class="comment">// centre of class 2</span></div>
+<div class="line"><span class="lineno">  502</span>        std::array&lt;double, 3&gt;({.5, -.5, .5}),   <span class="comment">// centre of class 3</span></div>
+<div class="line"><span class="lineno">  503</span>        std::array&lt;double, 3&gt;({.5, -.5, -.5}),  <span class="comment">// centre of class 4</span></div>
+<div class="line"><span class="lineno">  504</span>        std::array&lt;double, 3&gt;({-.5, .5, .5}),   <span class="comment">// centre of class 5</span></div>
+<div class="line"><span class="lineno">  505</span>        std::array&lt;double, 3&gt;({-.5, .5, -.5}),  <span class="comment">// centre of class 6</span></div>
+<div class="line"><span class="lineno">  506</span>        std::array&lt;double, 3&gt;({-.5, -.5, .5}),  <span class="comment">// centre of class 7</span></div>
+<div class="line"><span class="lineno">  507</span>        std::array&lt;double, 3&gt;({-.5, -.5, -.5})  <span class="comment">// centre of class 8</span></div>
 <div class="line"><span class="lineno">  508</span>    };</div>
 <div class="line"><span class="lineno">  509</span> </div>
 <div class="line"><span class="lineno">  510</span><span class="preprocessor">#ifdef _OPENMP</span></div>
@@ -650,7 +647,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  512</span><span class="preprocessor">#endif</span></div>
 <div class="line"><span class="lineno">  513</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
 <div class="line"><span class="lineno">  514</span>        <span class="comment">// select a random class for the point</span></div>
-<div class="line"><span class="lineno">  515</span>        <span class="keywordtype">int</span> cls = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % num_classes;</div>
+<div class="line"><span class="lineno">  515</span>        <span class="keywordtype">int</span> cls = std::rand() % num_classes;</div>
 <div class="line"><span class="lineno">  516</span> </div>
 <div class="line"><span class="lineno">  517</span>        <span class="comment">// create random coordinates (x,y,z) around the centre of the class</span></div>
 <div class="line"><span class="lineno">  518</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][0] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(centres[cls][0] - R, centres[cls][0] + R);</div>
@@ -663,12 +660,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  525</span><span class="comment">        */</span></div>
 <div class="line"><span class="lineno">  526</span>    }</div>
 <div class="line"><span class="lineno">  527</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/def/kohonen__som__topology_8cpp_a4b7ab643f6a5002f991837de46f70653_cgraph.svg" width="374" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
deleted file mode 100644
index 174e3c1e2..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
+++ /dev/null
@@ -1,23 +0,0 @@
-<map id="test2" name="test2">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,59,56,84"/>
-<area shape="rect" id="Node000002" href="$d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" title=" " alt="" coords="315,7,386,32"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="44,56,69,36,103,18,154,7,207,3,300,9,300,14,207,9,155,12,105,24,72,40,47,60"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="129,33,202,59"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,64,114,53,115,58,57,70"/>
-<area shape="rect" id="Node000005" href="$d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c" title=" " alt="" coords="114,157,216,183"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="51,83,135,146,132,150,48,87"/>
-<area shape="rect" id="Node000010" href="$d4/def/kohonen__som__topology_8cpp.html#a1302662a56ebf67a21249270b017297e" title=" " alt="" coords="104,83,227,108"/>
-<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="57,73,89,79,88,85,56,79"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="474,32,547,58"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="387,23,459,34,458,40,386,28"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="282,207,419,232"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="217,181,286,200,284,205,216,186"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="275,256,426,282"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="184,181,225,212,276,243,287,248,285,253,274,247,222,216,181,186"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="284,108,418,134"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="216,154,284,136,286,141,217,159"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/strerror.html#" title=" " alt="" coords="306,157,395,183"/>
-<area shape="poly" id="edge8_Node000005_Node000009" title=" " alt="" coords="217,168,291,168,291,173,217,173"/>
-<area shape="poly" id="edge10_Node000010_Node000002" title=" " alt="" coords="200,80,226,69,304,36,306,41,228,74,202,85"/>
-<area shape="poly" id="edge11_Node000010_Node000003" title=" " alt="" coords="227,84,459,50,459,55,228,89"/>
-</map>
diff --git a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
deleted file mode 100644
index 46f3a1793..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-299b3708f385a516638483bec9c8ae5f
\ No newline at end of file
diff --git a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
deleted file mode 100644
index 517c5e2f6..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
+++ /dev/null
@@ -1,227 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="414pt" height="215pt"
- viewBox="0.00 0.00 414.00 215.37" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 211.37)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-167.25 0,-167.25 0,-148 37.75,-148 37.75,-167.25"/>
-<text text-anchor="middle" x="18.88" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.75,-206.25 232.25,-206.25 232.25,-187 285.75,-187 285.75,-206.25"/>
-<text text-anchor="middle" x="259" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.94,-167.64C40.04,-176.93 56.53,-190.11 73.75,-195.62 122.76,-211.32 182.92,-207.68 220.88,-202.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.98,-206.33 230.41,-201.49 220.02,-199.4 220.98,-206.33"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="147.12,-186.25 92.88,-186.25 92.88,-167 147.12,-167 147.12,-186.25"/>
-<text text-anchor="middle" x="120" y="-172.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.06,-161.11C50.26,-163.45 66.78,-166.61 81.71,-169.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.75,-172.86 91.23,-171.3 82.07,-165.98 80.75,-172.86"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158.38,-93.25 81.62,-93.25 81.62,-74 158.38,-74 158.38,-93.25"/>
-<text text-anchor="middle" x="120" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_2d_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.24,-147.65C49.43,-135.56 76.93,-115.03 96.43,-100.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.39,-103.38 104.31,-94.59 94.21,-97.77 98.39,-103.38"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a1302662a56ebf67a21249270b017297e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="166.25,-149.25 73.75,-149.25 73.75,-130 166.25,-130 166.25,-149.25"/>
-<text text-anchor="middle" x="120" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3d_classes1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.06,-154.32C45.05,-153.05 53.46,-151.53 62.18,-149.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.6,-153.42 71.82,-148.19 61.35,-146.54 62.6,-153.42"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="406,-187.25 351.75,-187.25 351.75,-168 406,-168 406,-187.25"/>
-<text text-anchor="middle" x="378.88" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M286.16,-192.41C302,-189.86 322.46,-186.56 340.04,-183.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="340.57,-187.18 349.89,-182.14 339.46,-180.27 340.57,-187.18"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="310.5,-56.25 207.5,-56.25 207.5,-37 310.5,-37 310.5,-56.25"/>
-<text text-anchor="middle" x="259" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.44,-73.51C174.29,-69.23 192.97,-64.19 209.83,-59.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="210.41,-63.1 219.15,-57.12 208.58,-56.35 210.41,-63.1"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="315.75,-19.25 202.25,-19.25 202.25,0 315.75,0 315.75,-19.25"/>
-<text text-anchor="middle" x="259" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.97,-73.7C148.23,-61.45 175.82,-40.65 202.25,-27.62 204.98,-26.28 207.83,-25 210.74,-23.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="211.88,-27.11 219.99,-20.29 209.4,-20.56 211.88,-27.11"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="309.38,-130.25 208.62,-130.25 208.62,-111 309.38,-111 309.38,-130.25"/>
-<text text-anchor="middle" x="259" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.44,-93.74C174.29,-98.02 192.97,-103.06 209.83,-107.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.58,-110.9 219.15,-110.13 210.41,-104.15 208.58,-110.9"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strerror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.12,-93.25 225.88,-93.25 225.88,-74 292.12,-74 292.12,-93.25"/>
-<text text-anchor="middle" x="259" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strerror</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge8_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge8_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.8,-83.62C175.95,-83.62 196.34,-83.62 214.16,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.93,-87.13 223.93,-83.63 213.93,-80.13 213.93,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node2 -->
-<g id="edge10_Node000010_Node000002" class="edge">
-<title>Node10&#45;&gt;Node2</title>
-<g id="a_edge10_Node000010_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.41,-149.61C152.89,-152.19 159.84,-154.99 166.25,-157.62 185.6,-165.59 207.14,-174.73 224.48,-182.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.72,-185.21 233.29,-185.94 225.48,-178.78 222.72,-185.21"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node3 -->
-<g id="edge11_Node000010_Node000003" class="edge">
-<title>Node10&#45;&gt;Node3</title>
-<g id="a_edge11_Node000010_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M166.63,-146.37C216.1,-153.69 294.14,-165.24 340.24,-172.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="339.61,-175.5 350.01,-173.5 340.63,-168.58 339.61,-175.5"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
deleted file mode 100644
index 3a4104c4a..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
+++ /dev/null
@@ -1,201 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="414pt" height="215pt"
- viewBox="0.00 0.00 414.00 215.37" 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 211.37)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-167.25 0,-167.25 0,-148 37.75,-148 37.75,-167.25"/>
-<text text-anchor="middle" x="18.88" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.75,-206.25 232.25,-206.25 232.25,-187 285.75,-187 285.75,-206.25"/>
-<text text-anchor="middle" x="259" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.94,-167.64C40.04,-176.93 56.53,-190.11 73.75,-195.62 122.76,-211.32 182.92,-207.68 220.88,-202.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.98,-206.33 230.41,-201.49 220.02,-199.4 220.98,-206.33"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="147.12,-186.25 92.88,-186.25 92.88,-167 147.12,-167 147.12,-186.25"/>
-<text text-anchor="middle" x="120" y="-172.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.06,-161.11C50.26,-163.45 66.78,-166.61 81.71,-169.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.75,-172.86 91.23,-171.3 82.07,-165.98 80.75,-172.86"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158.38,-93.25 81.62,-93.25 81.62,-74 158.38,-74 158.38,-93.25"/>
-<text text-anchor="middle" x="120" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_2d_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.24,-147.65C49.43,-135.56 76.93,-115.03 96.43,-100.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.39,-103.38 104.31,-94.59 94.21,-97.77 98.39,-103.38"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a1302662a56ebf67a21249270b017297e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="166.25,-149.25 73.75,-149.25 73.75,-130 166.25,-130 166.25,-149.25"/>
-<text text-anchor="middle" x="120" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3d_classes1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.06,-154.32C45.05,-153.05 53.46,-151.53 62.18,-149.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.6,-153.42 71.82,-148.19 61.35,-146.54 62.6,-153.42"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="406,-187.25 351.75,-187.25 351.75,-168 406,-168 406,-187.25"/>
-<text text-anchor="middle" x="378.88" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M286.16,-192.41C302,-189.86 322.46,-186.56 340.04,-183.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="340.57,-187.18 349.89,-182.14 339.46,-180.27 340.57,-187.18"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="310.5,-56.25 207.5,-56.25 207.5,-37 310.5,-37 310.5,-56.25"/>
-<text text-anchor="middle" x="259" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.44,-73.51C174.29,-69.23 192.97,-64.19 209.83,-59.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="210.41,-63.1 219.15,-57.12 208.58,-56.35 210.41,-63.1"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="315.75,-19.25 202.25,-19.25 202.25,0 315.75,0 315.75,-19.25"/>
-<text text-anchor="middle" x="259" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.97,-73.7C148.23,-61.45 175.82,-40.65 202.25,-27.62 204.98,-26.28 207.83,-25 210.74,-23.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="211.88,-27.11 219.99,-20.29 209.4,-20.56 211.88,-27.11"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="309.38,-130.25 208.62,-130.25 208.62,-111 309.38,-111 309.38,-130.25"/>
-<text text-anchor="middle" x="259" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.44,-93.74C174.29,-98.02 192.97,-103.06 209.83,-107.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.58,-110.9 219.15,-110.13 210.41,-104.15 208.58,-110.9"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strerror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.12,-93.25 225.88,-93.25 225.88,-74 292.12,-74 292.12,-93.25"/>
-<text text-anchor="middle" x="259" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strerror</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge8_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge8_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.8,-83.62C175.95,-83.62 196.34,-83.62 214.16,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.93,-87.13 223.93,-83.63 213.93,-80.13 213.93,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node2 -->
-<g id="edge10_Node000010_Node000002" class="edge">
-<title>Node10&#45;&gt;Node2</title>
-<g id="a_edge10_Node000010_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.41,-149.61C152.89,-152.19 159.84,-154.99 166.25,-157.62 185.6,-165.59 207.14,-174.73 224.48,-182.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.72,-185.21 233.29,-185.94 225.48,-178.78 222.72,-185.21"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node3 -->
-<g id="edge11_Node000010_Node000003" class="edge">
-<title>Node10&#45;&gt;Node3</title>
-<g id="a_edge11_Node000010_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M166.63,-146.37C216.1,-153.69 294.14,-165.24 340.24,-172.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="339.61,-175.5 350.01,-173.5 340.63,-168.58 339.61,-175.5"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/def/kohonen__som__topology_8cpp_a1302662a56ebf67a21249270b017297e_cgraph.map b/d4/def/kohonen__som__topology_8cpp_a1302662a56ebf67a21249270b017297e_cgraph.map
deleted file mode 100644
index 8956b7d84..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a1302662a56ebf67a21249270b017297e_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="test_3d_classes1" name="test_3d_classes1">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,129,56"/>
-<area shape="rect" id="Node000002" href="$d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" title=" " alt="" coords="177,5,248,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="129,30,161,24,162,30,130,35"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="296,31,368,56"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="129,41,281,41,281,46,129,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="249,23,281,30,280,35,248,28"/>
-</map>
diff --git a/d4/def/kohonen__som__topology_8cpp_a1302662a56ebf67a21249270b017297e_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a1302662a56ebf67a21249270b017297e_cgraph.md5
deleted file mode 100644
index 228710298..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a1302662a56ebf67a21249270b017297e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8975dc7acf737f2068fc3727610b68c6
\ No newline at end of file
diff --git a/d4/def/kohonen__som__topology_8cpp_a1302662a56ebf67a21249270b017297e_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a1302662a56ebf67a21249270b017297e_cgraph.svg
deleted file mode 100644
index e0b8640dc..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a1302662a56ebf67a21249270b017297e_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_3d_classes1 Pages: 1 -->
-<svg width="280pt" height="46pt"
- viewBox="0.00 0.00 280.25 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>test_3d_classes1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="92.5,-19.25 0,-19.25 0,0 92.5,0 92.5,-19.25"/>
-<text text-anchor="middle" x="46.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3d_classes1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="182,-38.25 128.5,-38.25 128.5,-19 182,-19 182,-38.25"/>
-<text text-anchor="middle" x="155.25" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.94,-17.74C100.93,-19.16 109.17,-20.62 116.91,-21.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="116.22,-25.43 126.68,-23.73 117.45,-18.54 116.22,-25.43"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272.25,-19.25 218,-19.25 218,0 272.25,0 272.25,-19.25"/>
-<text text-anchor="middle" x="245.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.91,-9.62C127.41,-9.62 174.19,-9.62 206.54,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.24,-13.13 216.24,-9.63 206.24,-6.13 206.24,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.14,-23.03C189.71,-21.39 198.15,-19.57 206.3,-17.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.99,-21.23 216.03,-15.7 205.51,-14.39 206.99,-21.23"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/def/kohonen__som__topology_8cpp_a1302662a56ebf67a21249270b017297e_cgraph_org.svg b/d4/def/kohonen__som__topology_8cpp_a1302662a56ebf67a21249270b017297e_cgraph_org.svg
deleted file mode 100644
index 1c332acca..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a1302662a56ebf67a21249270b017297e_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_3d_classes1 Pages: 1 -->
-<svg width="280pt" height="46pt"
- viewBox="0.00 0.00 280.25 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>test_3d_classes1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="92.5,-19.25 0,-19.25 0,0 92.5,0 92.5,-19.25"/>
-<text text-anchor="middle" x="46.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3d_classes1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="182,-38.25 128.5,-38.25 128.5,-19 182,-19 182,-38.25"/>
-<text text-anchor="middle" x="155.25" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.94,-17.74C100.93,-19.16 109.17,-20.62 116.91,-21.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="116.22,-25.43 126.68,-23.73 117.45,-18.54 116.22,-25.43"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272.25,-19.25 218,-19.25 218,0 272.25,0 272.25,-19.25"/>
-<text text-anchor="middle" x="245.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.91,-9.62C127.41,-9.62 174.19,-9.62 206.54,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.24,-13.13 216.24,-9.63 206.24,-6.13 206.24,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.14,-23.03C189.71,-21.39 198.15,-19.57 206.3,-17.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.99,-21.23 216.03,-15.7 205.51,-14.39 206.99,-21.23"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
deleted file mode 100644
index 446b23b6d..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
+++ /dev/null
@@ -1,23 +0,0 @@
-<map id="test1" name="test1">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,58,56,84"/>
-<area shape="rect" id="Node000002" href="$d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" title=" " alt="" coords="308,6,379,32"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="44,56,69,35,103,18,152,7,203,3,293,8,293,14,203,9,153,12,105,23,72,40,47,60"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="126,33,198,59"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,64,110,53,111,58,57,69"/>
-<area shape="rect" id="Node000005" href="$d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c" title=" " alt="" coords="111,157,213,183"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="51,82,132,145,129,149,48,87"/>
-<area shape="rect" id="Node000010" href="$d4/def/kohonen__som__topology_8cpp.html#a48efb079040c7aaa3a4917a0e486cba9" title=" " alt="" coords="104,82,220,108"/>
-<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="57,73,89,79,88,84,56,78"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="467,32,540,57"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="380,22,452,34,451,39,379,28"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="275,206,412,232"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="213,181,279,199,278,204,211,186"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="268,256,419,281"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="180,181,219,211,269,242,280,247,278,252,267,247,216,216,177,185"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="276,108,411,133"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="211,154,278,136,279,141,213,159"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/strerror.html#" title=" " alt="" coords="300,157,388,183"/>
-<area shape="poly" id="edge8_Node000005_Node000009" title=" " alt="" coords="214,167,284,167,284,173,214,173"/>
-<area shape="poly" id="edge10_Node000010_Node000002" title=" " alt="" coords="194,79,219,69,296,36,298,41,221,74,196,84"/>
-<area shape="poly" id="edge11_Node000010_Node000003" title=" " alt="" coords="220,84,451,50,452,55,221,89"/>
-</map>
diff --git a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
deleted file mode 100644
index c70b6714e..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-131475ebe87aecd5e6f53346ebca5861
\ No newline at end of file
diff --git a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
deleted file mode 100644
index 7a2fc9c18..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
+++ /dev/null
@@ -1,227 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="409pt" height="215pt"
- viewBox="0.00 0.00 408.75 215.08" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 211.08)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-167.25 0,-167.25 0,-148 37.75,-148 37.75,-167.25"/>
-<text text-anchor="middle" x="18.88" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="280.5,-206.25 227,-206.25 227,-187 280.5,-187 280.5,-206.25"/>
-<text text-anchor="middle" x="253.75" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.94,-167.64C40.04,-176.93 56.53,-190.11 73.75,-195.62 120.89,-210.72 178.65,-207.42 215.58,-202.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.86,-206.26 225.3,-201.44 214.92,-199.33 215.86,-206.26"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="144.5,-186.25 90.25,-186.25 90.25,-167 144.5,-167 144.5,-186.25"/>
-<text text-anchor="middle" x="117.38" y="-172.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.03,-161.2C49.57,-163.47 64.95,-166.5 79.02,-169.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.95,-172.63 88.44,-171.12 79.3,-165.76 77.95,-172.63"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.75,-93.25 79,-93.25 79,-74 155.75,-74 155.75,-93.25"/>
-<text text-anchor="middle" x="117.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_2d_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.89,-147.65C48.57,-135.62 75.18,-115.22 94.14,-100.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.25,-103.47 102.06,-94.6 91.99,-97.91 96.25,-103.47"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a48efb079040c7aaa3a4917a0e486cba9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161,-149.25 73.75,-149.25 73.75,-130 161,-130 161,-149.25"/>
-<text text-anchor="middle" x="117.38" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_2d_classes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.03,-154.24C45.09,-152.92 53.59,-151.34 62.34,-149.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.8,-153.18 71.99,-147.9 61.52,-146.3 62.8,-153.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.75,-187.25 346.5,-187.25 346.5,-168 400.75,-168 400.75,-187.25"/>
-<text text-anchor="middle" x="373.62" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.91,-192.41C296.75,-189.86 317.21,-186.56 334.79,-183.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="335.32,-187.18 344.64,-182.14 334.21,-180.27 335.32,-187.18"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-56.25 202.25,-56.25 202.25,-37 305.25,-37 305.25,-56.25"/>
-<text text-anchor="middle" x="253.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.09,-73.51C170.5,-69.27 188.62,-64.28 205.03,-59.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.9,-63.15 214.62,-57.12 204.05,-56.41 205.9,-63.15"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="310.5,-19.25 197,-19.25 197,0 310.5,0 310.5,-19.25"/>
-<text text-anchor="middle" x="253.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.9,-73.67C144.6,-61.4 171.24,-40.57 197,-27.62 199.72,-26.26 202.56,-24.97 205.46,-23.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.62,-27.06 214.7,-20.21 204.11,-20.52 206.62,-27.06"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.12,-130.25 203.38,-130.25 203.38,-111 304.12,-111 304.12,-130.25"/>
-<text text-anchor="middle" x="253.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.09,-93.74C170.5,-97.98 188.62,-102.97 205.03,-107.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="204.05,-110.84 214.62,-110.13 205.9,-104.1 204.05,-110.84"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strerror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="286.88,-93.25 220.62,-93.25 220.62,-74 286.88,-74 286.88,-93.25"/>
-<text text-anchor="middle" x="253.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strerror</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge8_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge8_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.16,-83.62C172.56,-83.62 191.87,-83.62 208.9,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.74,-87.13 218.74,-83.63 208.74,-80.13 208.74,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node2 -->
-<g id="edge10_Node000010_Node000002" class="edge">
-<title>Node10&#45;&gt;Node2</title>
-<g id="a_edge10_Node000010_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.28,-149.71C148.38,-152.29 154.93,-155.06 161,-157.62 180.14,-165.73 201.51,-174.82 218.81,-182.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.03,-185.22 227.6,-185.92 219.77,-178.78 217.03,-185.22"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node3 -->
-<g id="edge11_Node000010_Node000003" class="edge">
-<title>Node10&#45;&gt;Node3</title>
-<g id="a_edge11_Node000010_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.22,-146.03C209.78,-153.29 288.2,-165.01 334.65,-171.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.11,-175.41 344.52,-173.42 335.14,-168.48 334.11,-175.41"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
deleted file mode 100644
index c2e2a7d3e..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
+++ /dev/null
@@ -1,201 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="409pt" height="215pt"
- viewBox="0.00 0.00 408.75 215.08" 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 211.08)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-167.25 0,-167.25 0,-148 37.75,-148 37.75,-167.25"/>
-<text text-anchor="middle" x="18.88" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="280.5,-206.25 227,-206.25 227,-187 280.5,-187 280.5,-206.25"/>
-<text text-anchor="middle" x="253.75" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.94,-167.64C40.04,-176.93 56.53,-190.11 73.75,-195.62 120.89,-210.72 178.65,-207.42 215.58,-202.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.86,-206.26 225.3,-201.44 214.92,-199.33 215.86,-206.26"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="144.5,-186.25 90.25,-186.25 90.25,-167 144.5,-167 144.5,-186.25"/>
-<text text-anchor="middle" x="117.38" y="-172.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.03,-161.2C49.57,-163.47 64.95,-166.5 79.02,-169.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.95,-172.63 88.44,-171.12 79.3,-165.76 77.95,-172.63"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.75,-93.25 79,-93.25 79,-74 155.75,-74 155.75,-93.25"/>
-<text text-anchor="middle" x="117.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_2d_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.89,-147.65C48.57,-135.62 75.18,-115.22 94.14,-100.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.25,-103.47 102.06,-94.6 91.99,-97.91 96.25,-103.47"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a48efb079040c7aaa3a4917a0e486cba9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161,-149.25 73.75,-149.25 73.75,-130 161,-130 161,-149.25"/>
-<text text-anchor="middle" x="117.38" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_2d_classes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.03,-154.24C45.09,-152.92 53.59,-151.34 62.34,-149.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.8,-153.18 71.99,-147.9 61.52,-146.3 62.8,-153.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.75,-187.25 346.5,-187.25 346.5,-168 400.75,-168 400.75,-187.25"/>
-<text text-anchor="middle" x="373.62" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.91,-192.41C296.75,-189.86 317.21,-186.56 334.79,-183.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="335.32,-187.18 344.64,-182.14 334.21,-180.27 335.32,-187.18"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-56.25 202.25,-56.25 202.25,-37 305.25,-37 305.25,-56.25"/>
-<text text-anchor="middle" x="253.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.09,-73.51C170.5,-69.27 188.62,-64.28 205.03,-59.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.9,-63.15 214.62,-57.12 204.05,-56.41 205.9,-63.15"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="310.5,-19.25 197,-19.25 197,0 310.5,0 310.5,-19.25"/>
-<text text-anchor="middle" x="253.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.9,-73.67C144.6,-61.4 171.24,-40.57 197,-27.62 199.72,-26.26 202.56,-24.97 205.46,-23.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.62,-27.06 214.7,-20.21 204.11,-20.52 206.62,-27.06"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.12,-130.25 203.38,-130.25 203.38,-111 304.12,-111 304.12,-130.25"/>
-<text text-anchor="middle" x="253.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.09,-93.74C170.5,-97.98 188.62,-102.97 205.03,-107.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="204.05,-110.84 214.62,-110.13 205.9,-104.1 204.05,-110.84"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strerror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="286.88,-93.25 220.62,-93.25 220.62,-74 286.88,-74 286.88,-93.25"/>
-<text text-anchor="middle" x="253.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strerror</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge8_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge8_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.16,-83.62C172.56,-83.62 191.87,-83.62 208.9,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.74,-87.13 218.74,-83.63 208.74,-80.13 208.74,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node2 -->
-<g id="edge10_Node000010_Node000002" class="edge">
-<title>Node10&#45;&gt;Node2</title>
-<g id="a_edge10_Node000010_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.28,-149.71C148.38,-152.29 154.93,-155.06 161,-157.62 180.14,-165.73 201.51,-174.82 218.81,-182.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.03,-185.22 227.6,-185.92 219.77,-178.78 217.03,-185.22"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node3 -->
-<g id="edge11_Node000010_Node000003" class="edge">
-<title>Node10&#45;&gt;Node3</title>
-<g id="a_edge11_Node000010_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.22,-146.03C209.78,-153.29 288.2,-165.01 334.65,-171.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.11,-175.41 344.52,-173.42 335.14,-168.48 334.11,-175.41"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
deleted file mode 100644
index 63877bd83..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
+++ /dev/null
@@ -1,51 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,159,55,184"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/clock.html#" title=" " alt="" coords="115,11,193,36"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="33,157,57,104,77,73,101,46,103,43,107,47,105,49,81,77,62,107,38,159"/>
-<area shape="rect" id="Node000003" href="$d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908" title=" " alt="" coords="103,60,205,86"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="39,157,66,127,101,95,106,91,109,96,104,99,69,130,43,160"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="114,109,194,135"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="54,159,104,139,107,144,56,164"/>
-<area shape="rect" id="Node000005" href="$d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" title=" " alt="" coords="129,159,179,184"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="55,169,113,169,113,174,55,174"/>
-<area shape="rect" id="Node000015" href="$d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0" title=" " alt="" coords="129,208,179,234"/>
-<area shape="poly" id="edge16_Node000001_Node000015" title=" " alt="" coords="56,179,115,203,113,208,54,184"/>
-<area shape="rect" id="Node000017" href="$d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" title=" " alt="" coords="129,257,179,283"/>
-<area shape="poly" id="edge23_Node000001_Node000017" title=" " alt="" coords="43,183,69,213,104,244,116,252,113,256,101,248,66,216,39,186"/>
-<area shape="rect" id="Node000019" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="118,307,190,332"/>
-<area shape="poly" id="edge30_Node000001_Node000019" title=" " alt="" coords="38,184,62,236,81,266,105,294,107,296,103,300,101,297,77,270,57,239,33,186"/>
-<area shape="rect" id="Node000006" href="$d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" title=" " alt="" coords="464,107,536,132"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="178,159,203,145,217,133,226,120,236,108,252,98,303,86,356,84,407,91,450,101,449,106,406,96,356,90,304,91,254,103,239,112,230,124,221,136,207,150,181,164"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="278,207,351,232"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="180,176,264,202,263,207,179,181"/>
-<area shape="rect" id="Node000009" href="$d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c" title=" " alt="" coords="264,357,366,383"/>
-<area shape="poly" id="edge8_Node000005_Node000009" title=" " alt="" coords="181,176,195,183,207,194,221,214,228,234,231,271,234,308,241,326,255,344,257,346,253,350,251,348,237,328,229,309,226,272,223,235,216,216,203,197,192,188,178,181"/>
-<area shape="rect" id="Node000014" href="$d4/def/kohonen__som__topology_8cpp.html#a48efb079040c7aaa3a4917a0e486cba9" title=" " alt="" coords="256,5,373,31"/>
-<area shape="poly" id="edge13_Node000005_Node000014" title=" " alt="" coords="178,161,203,146,220,122,227,98,234,74,251,48,265,37,268,41,255,52,239,76,232,100,225,124,207,149,181,166"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="624,132,696,158"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="537,122,608,134,608,139,536,128"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="431,295,569,320"/>
-<area shape="poly" id="edge9_Node000009_Node000010" title=" " alt="" coords="352,354,423,329,441,323,443,328,425,334,353,359"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="424,344,576,370"/>
-<area shape="poly" id="edge10_Node000009_Node000011" title=" " alt="" coords="366,364,409,361,409,366,367,369"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="433,393,567,419"/>
-<area shape="poly" id="edge11_Node000009_Node000012" title=" " alt="" coords="367,377,418,388,417,393,366,383"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/strerror.html#" title=" " alt="" coords="456,443,544,468"/>
-<area shape="poly" id="edge12_Node000009_Node000013" title=" " alt="" coords="338,381,378,405,425,429,442,436,440,441,423,434,375,410,335,386"/>
-<area shape="poly" id="edge14_Node000014_Node000006" title=" " alt="" coords="343,29,378,48,463,96,461,101,375,53,340,34"/>
-<area shape="poly" id="edge15_Node000014_Node000007" title=" " alt="" coords="374,28,470,53,577,92,629,121,626,125,575,97,469,58,373,33"/>
-<area shape="poly" id="edge17_Node000015_Node000006" title=" " alt="" coords="178,209,203,195,217,181,226,168,235,154,252,142,302,124,355,114,405,111,449,112,449,117,405,116,355,120,303,129,254,147,239,158,230,171,221,184,207,199,181,214"/>
-<area shape="poly" id="edge18_Node000015_Node000008" title=" " alt="" coords="180,218,263,217,263,223,180,223"/>
-<area shape="poly" id="edge19_Node000015_Node000009" title=" " alt="" coords="181,226,207,243,225,270,231,295,238,320,255,344,257,346,254,350,251,348,233,322,226,297,220,272,203,247,178,231"/>
-<area shape="rect" id="Node000016" href="$d4/def/kohonen__som__topology_8cpp.html#a1302662a56ebf67a21249270b017297e" title=" " alt="" coords="253,157,376,183"/>
-<area shape="poly" id="edge20_Node000015_Node000016" title=" " alt="" coords="179,210,256,186,258,191,180,216"/>
-<area shape="poly" id="edge21_Node000016_Node000006" title=" " alt="" coords="364,154,448,131,450,136,365,159"/>
-<area shape="poly" id="edge22_Node000016_Node000007" title=" " alt="" coords="377,163,608,146,609,151,377,168"/>
-<area shape="poly" id="edge24_Node000017_Node000006" title=" " alt="" coords="179,270,219,271,269,269,323,261,375,242,408,222,437,196,480,143,484,147,441,199,411,226,377,247,324,266,269,274,219,277,179,275"/>
-<area shape="poly" id="edge25_Node000017_Node000008" title=" " alt="" coords="179,260,263,233,264,238,180,265"/>
-<area shape="poly" id="edge26_Node000017_Node000009" title=" " alt="" coords="181,277,207,292,222,306,231,319,240,331,255,344,261,348,258,352,251,348,236,335,227,322,218,309,203,296,178,282"/>
-<area shape="rect" id="Node000018" href="$d4/def/kohonen__som__topology_8cpp.html#a4b7ab643f6a5002f991837de46f70653" title=" " alt="" coords="253,308,376,334"/>
-<area shape="poly" id="edge27_Node000017_Node000018" title=" " alt="" coords="180,275,258,300,256,305,179,281"/>
-<area shape="poly" id="edge28_Node000018_Node000006" title=" " alt="" coords="347,305,375,287,391,269,400,252,422,213,476,143,480,146,427,216,405,255,395,272,378,291,350,310"/>
-<area shape="poly" id="edge29_Node000018_Node000007" title=" " alt="" coords="341,305,618,163,620,168,343,310"/>
-</map>
diff --git a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
deleted file mode 100644
index 73082c94b..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b0fcb77e5bb35f6c3090530b72a0e2cd
\ No newline at end of file
diff --git a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
deleted file mode 100644
index 604163a70..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
+++ /dev/null
@@ -1,536 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 355 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 526;
-var viewHeight = 355;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-232.25 0,-232.25 0,-213 37,-213 37,-232.25"/>
-<text text-anchor="middle" x="18.5" y="-218.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="140.75,-343.25 82,-343.25 82,-324 140.75,-324 140.75,-343.25"/>
-<text text-anchor="middle" x="111.38" y="-329.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.95,-232.59C29.81,-251.14 46.8,-291.28 73,-315.62 73.61,-316.19 74.25,-316.75 74.9,-317.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.64,-319.99 82.89,-322.67 76.55,-314.18 72.64,-319.99"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149.75,-306.25 73,-306.25 73,-287 149.75,-287 149.75,-306.25"/>
-<text text-anchor="middle" x="111.38" y="-292.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_clock_diff</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.96,-232.36C36.57,-244.42 54.29,-265.03 73,-278.62 74.15,-279.46 75.34,-280.27 76.56,-281.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.58,-283.96 85,-285.87 78.05,-277.88 74.58,-283.96"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.12,-269.25 81.62,-269.25 81.62,-250 141.12,-250 141.12,-269.25"/>
-<text text-anchor="middle" x="111.38" y="-255.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.45,-229.94C48.2,-234.31 62.24,-240.03 75.12,-245.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.6,-248.43 84.18,-248.96 76.23,-241.95 73.6,-248.43"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="130.25,-232.25 92.5,-232.25 92.5,-213 130.25,-213 130.25,-232.25"/>
-<text text-anchor="middle" x="111.38" y="-218.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.45,-222.62C49.82,-222.62 66.54,-222.62 80.84,-222.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.63,-226.13 90.63,-222.63 80.63,-219.13 80.63,-226.13"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="130.25,-195.25 92.5,-195.25 92.5,-176 130.25,-176 130.25,-195.25"/>
-<text text-anchor="middle" x="111.38" y="-181.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node15 -->
-<g id="edge16_Node000001_Node000015" class="edge">
-<title>Node1&#45;&gt;Node15</title>
-<g id="a_edge16_Node000001_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.45,-215.31C50.07,-210.18 67.21,-203.2 81.7,-197.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.8,-200.63 90.75,-193.62 80.16,-194.15 82.8,-200.63"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="130.25,-158.25 92.5,-158.25 92.5,-139 130.25,-139 130.25,-158.25"/>
-<text text-anchor="middle" x="111.38" y="-144.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge23_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge23_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.96,-212.89C36.57,-200.83 54.29,-180.22 73,-166.62 75.82,-164.57 78.91,-162.65 82.07,-160.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.44,-164.12 90.79,-156.5 80.29,-157.87 83.44,-164.12"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.5,-121.25 84.25,-121.25 84.25,-102 138.5,-102 138.5,-121.25"/>
-<text text-anchor="middle" x="111.38" y="-107.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node19 -->
-<g id="edge30_Node000001_Node000019" class="edge">
-<title>Node1&#45;&gt;Node19</title>
-<g id="a_edge30_Node000001_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.95,-212.66C29.81,-194.11 46.8,-153.97 73,-129.62 73.61,-129.06 74.25,-128.5 74.9,-127.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.55,-131.07 82.89,-122.58 72.64,-125.26 76.55,-131.07"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.75,-271.25 344.25,-271.25 344.25,-252 397.75,-252 397.75,-271.25"/>
-<text text-anchor="middle" x="371" y="-257.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.52,-229.93C136.85,-232.85 143.85,-236.5 149.75,-240.62 168.04,-253.41 165.07,-267.23 185.75,-275.62 233.9,-295.18 294.9,-284.37 333.2,-273.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.76,-277.29 342.39,-271.14 331.81,-270.57 333.76,-277.29"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.12,-196.25 204.88,-196.25 204.88,-177 259.12,-177 259.12,-196.25"/>
-<text text-anchor="middle" x="232" y="-182.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.65,-217.08C147.4,-212 172.71,-204.32 193.72,-197.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.55,-201.34 203.11,-195.09 192.52,-194.65 194.55,-201.34"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.38,-83.25 193.62,-83.25 193.62,-64 270.38,-64 270.38,-83.25"/>
-<text text-anchor="middle" x="232" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_2d_data</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge8_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge8_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.68,-217.26C137.48,-214.47 144.74,-210.39 149.75,-204.62 184.31,-164.83 149.81,-130.18 185.75,-91.62 186.22,-91.12 186.7,-90.63 187.2,-90.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.03,-93.16 195.08,-84.46 184.92,-87.49 189.03,-93.16"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a48efb079040c7aaa3a4917a0e486cba9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275.62,-347.25 188.38,-347.25 188.38,-328 275.62,-328 275.62,-347.25"/>
-<text text-anchor="middle" x="232" y="-333.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_2d_classes</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node14 -->
-<g id="edge13_Node000005_Node000014" class="edge">
-<title>Node5&#45;&gt;Node14</title>
-<g id="a_edge13_Node000005_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.63,-228.55C137.26,-231.39 144.43,-235.35 149.75,-240.62 175.45,-266.09 160.55,-287.67 185.75,-313.62 188.71,-316.68 192.15,-319.42 195.77,-321.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="193.93,-324.85 204.32,-326.91 197.48,-318.82 193.93,-324.85"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="518,-252.25 463.75,-252.25 463.75,-233 518,-233 518,-252.25"/>
-<text text-anchor="middle" x="490.88" y="-238.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M398.16,-257.41C414,-254.86 434.46,-251.56 452.04,-248.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="452.57,-252.18 461.89,-247.14 451.46,-245.27 452.57,-252.18"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="422.5,-130.25 319.5,-130.25 319.5,-111 422.5,-111 422.5,-130.25"/>
-<text text-anchor="middle" x="371" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.38,-83.63C276.1,-89.32 296.24,-96.51 314.25,-102.62 318.46,-104.06 322.86,-105.52 327.27,-106.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.07,-110.27 336.67,-110.04 328.24,-103.61 326.07,-110.27"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="427.75,-93.25 314.25,-93.25 314.25,-74 427.75,-74 427.75,-93.25"/>
-<text text-anchor="middle" x="371" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge10_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge10_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.8,-76.38C280.67,-77.1 291.62,-77.9 302.54,-78.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="302.11,-82.18 312.34,-79.42 302.62,-75.2 302.11,-82.18"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="421.38,-56.25 320.62,-56.25 320.62,-37 421.38,-37 421.38,-56.25"/>
-<text text-anchor="middle" x="371" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node12 -->
-<g id="edge11_Node000009_Node000012" class="edge">
-<title>Node9&#45;&gt;Node12</title>
-<g id="a_edge11_Node000009_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.8,-66.18C282.62,-63.85 295.98,-61.21 308.98,-58.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.64,-62.09 318.78,-56.72 308.29,-55.22 309.64,-62.09"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strerror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="404.12,-19.25 337.88,-19.25 337.88,0 404.12,0 404.12,-19.25"/>
-<text text-anchor="middle" x="371" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strerror</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node13 -->
-<g id="edge12_Node000009_Node000013" class="edge">
-<title>Node9&#45;&gt;Node13</title>
-<g id="a_edge12_Node000009_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.39,-63.66C264.38,-53.61 290.35,-38.12 314.25,-27.62 318.27,-25.86 322.53,-24.18 326.82,-22.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.72,-25.99 336.02,-19.4 325.43,-19.38 327.72,-25.99"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node6 -->
-<g id="edge14_Node000014_Node000006" class="edge">
-<title>Node14&#45;&gt;Node6</title>
-<g id="a_edge14_Node000014_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M252,-327.7C260.11,-323.42 269.67,-318.33 278.25,-313.62 299.99,-301.7 324.4,-287.84 342.58,-277.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.25,-280.51 351.18,-272.49 340.76,-274.44 344.25,-280.51"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node7 -->
-<g id="edge15_Node000014_Node000007" class="edge">
-<title>Node14&#45;&gt;Node7</title>
-<g id="a_edge15_Node000014_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.93,-328.51C316.17,-319.17 377.5,-302.88 427.75,-280.62 441.2,-274.67 455.26,-266.27 466.6,-258.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="468.53,-261.81 474.89,-253.33 464.63,-255.99 468.53,-261.81"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node6 -->
-<g id="edge17_Node000015_Node000006" class="edge">
-<title>Node15&#45;&gt;Node6</title>
-<g id="a_edge17_Node000015_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.65,-192.76C136.99,-195.66 143.96,-199.34 149.75,-203.62 168.71,-217.66 164.66,-232.07 185.75,-242.62 232.4,-265.97 293.91,-267.36 332.72,-265.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="332.73,-268.75 342.48,-264.6 332.27,-261.77 332.73,-268.75"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node8 -->
-<g id="edge18_Node000015_Node000008" class="edge">
-<title>Node15&#45;&gt;Node8</title>
-<g id="a_edge18_Node000015_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.65,-185.78C147.24,-185.92 172.24,-186.13 193.13,-186.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="193.01,-189.8 203.04,-186.39 193.07,-182.81 193.01,-189.8"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node9 -->
-<g id="edge19_Node000015_Node000009" class="edge">
-<title>Node15&#45;&gt;Node9</title>
-<g id="a_edge19_Node000015_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.67,-179.74C137.31,-176.91 144.47,-172.94 149.75,-167.62 176.09,-141.11 158.49,-117.2 185.75,-91.62 186.37,-91.04 187.02,-90.47 187.68,-89.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.44,-92.96 195.89,-84.55 185.61,-87.1 189.44,-92.96"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a1302662a56ebf67a21249270b017297e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278.25,-233.25 185.75,-233.25 185.75,-214 278.25,-214 278.25,-233.25"/>
-<text text-anchor="middle" x="232" y="-219.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3d_classes1</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge20_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge20_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.65,-191.48C146.11,-196.43 168.88,-203.72 188.82,-210.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.51,-213.37 198.1,-213.08 189.64,-206.7 187.51,-213.37"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node6 -->
-<g id="edge21_Node000016_Node000006" class="edge">
-<title>Node16&#45;&gt;Node6</title>
-<g id="a_edge21_Node000016_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M269.35,-233.71C288.97,-239.15 313.13,-245.85 332.86,-251.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.87,-254.68 342.45,-253.98 333.74,-247.94 331.87,-254.68"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node7 -->
-<g id="edge22_Node000016_Node000007" class="edge">
-<title>Node16&#45;&gt;Node7</title>
-<g id="a_edge22_Node000016_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.63,-227C328.1,-230.66 406.14,-236.43 452.24,-239.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="451.77,-243.32 462,-240.56 452.29,-236.34 451.77,-243.32"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node6 -->
-<g id="edge24_Node000017_Node000006" class="edge">
-<title>Node17&#45;&gt;Node6</title>
-<g id="a_edge24_Node000017_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.41,-146.89C162.09,-144.65 229.06,-143.51 278.25,-167.62 312.9,-184.61 341.83,-220.21 357.46,-242.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="354.49,-244.25 363.01,-250.55 360.27,-240.31 354.49,-244.25"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node8 -->
-<g id="edge25_Node000017_Node000008" class="edge">
-<title>Node17&#45;&gt;Node8</title>
-<g id="a_edge25_Node000017_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.65,-154.48C147.4,-159.84 172.71,-167.95 193.72,-174.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.52,-177.97 203.11,-177.69 194.66,-171.31 192.52,-177.97"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node9 -->
-<g id="edge26_Node000017_Node000009" class="edge">
-<title>Node17&#45;&gt;Node9</title>
-<g id="a_edge26_Node000017_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.65,-141.49C136.99,-138.59 143.96,-134.91 149.75,-130.62 168.71,-116.59 166.31,-104.98 185.75,-91.62 187.28,-90.57 188.89,-89.57 190.54,-88.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.66,-91.97 199,-84.33 188.49,-85.72 191.66,-91.97"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a4b7ab643f6a5002f991837de46f70653" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278.25,-120.25 185.75,-120.25 185.75,-101 278.25,-101 278.25,-120.25"/>
-<text text-anchor="middle" x="232" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3d_classes2</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge27_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge27_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.65,-142.77C146.11,-137.82 168.88,-130.53 188.82,-124.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.64,-127.55 198.1,-121.17 187.51,-120.88 189.64,-127.55"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node6 -->
-<g id="edge28_Node000018_Node000006" class="edge">
-<title>Node18&#45;&gt;Node6</title>
-<g id="a_edge28_Node000018_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M257.5,-120.74C264.69,-124.43 272.23,-129.09 278.25,-134.62 300.03,-154.65 297.09,-166.52 314.25,-190.62 327.24,-208.88 343.12,-228.9 354.6,-243.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="351.75,-245.06 360.8,-250.57 357.16,-240.62 351.75,-245.06"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node7 -->
-<g id="edge29_Node000018_Node000007" class="edge">
-<title>Node18&#45;&gt;Node7</title>
-<g id="a_edge29_Node000018_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M252.31,-120.55C296.84,-143.43 407.01,-200.04 460.2,-227.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="458.5,-230.44 469,-231.9 461.7,-224.21 458.5,-230.44"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
deleted file mode 100644
index 16f9924cf..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
+++ /dev/null
@@ -1,453 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="526pt" height="355pt"
- viewBox="0.00 0.00 526.00 355.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 351.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-232.25 0,-232.25 0,-213 37,-213 37,-232.25"/>
-<text text-anchor="middle" x="18.5" y="-218.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="140.75,-343.25 82,-343.25 82,-324 140.75,-324 140.75,-343.25"/>
-<text text-anchor="middle" x="111.38" y="-329.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.95,-232.59C29.81,-251.14 46.8,-291.28 73,-315.62 73.61,-316.19 74.25,-316.75 74.9,-317.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.64,-319.99 82.89,-322.67 76.55,-314.18 72.64,-319.99"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149.75,-306.25 73,-306.25 73,-287 149.75,-287 149.75,-306.25"/>
-<text text-anchor="middle" x="111.38" y="-292.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_clock_diff</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.96,-232.36C36.57,-244.42 54.29,-265.03 73,-278.62 74.15,-279.46 75.34,-280.27 76.56,-281.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.58,-283.96 85,-285.87 78.05,-277.88 74.58,-283.96"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.12,-269.25 81.62,-269.25 81.62,-250 141.12,-250 141.12,-269.25"/>
-<text text-anchor="middle" x="111.38" y="-255.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.45,-229.94C48.2,-234.31 62.24,-240.03 75.12,-245.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.6,-248.43 84.18,-248.96 76.23,-241.95 73.6,-248.43"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="130.25,-232.25 92.5,-232.25 92.5,-213 130.25,-213 130.25,-232.25"/>
-<text text-anchor="middle" x="111.38" y="-218.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.45,-222.62C49.82,-222.62 66.54,-222.62 80.84,-222.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.63,-226.13 90.63,-222.63 80.63,-219.13 80.63,-226.13"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="130.25,-195.25 92.5,-195.25 92.5,-176 130.25,-176 130.25,-195.25"/>
-<text text-anchor="middle" x="111.38" y="-181.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node15 -->
-<g id="edge16_Node000001_Node000015" class="edge">
-<title>Node1&#45;&gt;Node15</title>
-<g id="a_edge16_Node000001_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.45,-215.31C50.07,-210.18 67.21,-203.2 81.7,-197.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.8,-200.63 90.75,-193.62 80.16,-194.15 82.8,-200.63"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="130.25,-158.25 92.5,-158.25 92.5,-139 130.25,-139 130.25,-158.25"/>
-<text text-anchor="middle" x="111.38" y="-144.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge23_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge23_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.96,-212.89C36.57,-200.83 54.29,-180.22 73,-166.62 75.82,-164.57 78.91,-162.65 82.07,-160.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.44,-164.12 90.79,-156.5 80.29,-157.87 83.44,-164.12"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.5,-121.25 84.25,-121.25 84.25,-102 138.5,-102 138.5,-121.25"/>
-<text text-anchor="middle" x="111.38" y="-107.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node19 -->
-<g id="edge30_Node000001_Node000019" class="edge">
-<title>Node1&#45;&gt;Node19</title>
-<g id="a_edge30_Node000001_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.95,-212.66C29.81,-194.11 46.8,-153.97 73,-129.62 73.61,-129.06 74.25,-128.5 74.9,-127.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.55,-131.07 82.89,-122.58 72.64,-125.26 76.55,-131.07"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.75,-271.25 344.25,-271.25 344.25,-252 397.75,-252 397.75,-271.25"/>
-<text text-anchor="middle" x="371" y="-257.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.52,-229.93C136.85,-232.85 143.85,-236.5 149.75,-240.62 168.04,-253.41 165.07,-267.23 185.75,-275.62 233.9,-295.18 294.9,-284.37 333.2,-273.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.76,-277.29 342.39,-271.14 331.81,-270.57 333.76,-277.29"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.12,-196.25 204.88,-196.25 204.88,-177 259.12,-177 259.12,-196.25"/>
-<text text-anchor="middle" x="232" y="-182.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.65,-217.08C147.4,-212 172.71,-204.32 193.72,-197.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.55,-201.34 203.11,-195.09 192.52,-194.65 194.55,-201.34"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.38,-83.25 193.62,-83.25 193.62,-64 270.38,-64 270.38,-83.25"/>
-<text text-anchor="middle" x="232" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_2d_data</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge8_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge8_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.68,-217.26C137.48,-214.47 144.74,-210.39 149.75,-204.62 184.31,-164.83 149.81,-130.18 185.75,-91.62 186.22,-91.12 186.7,-90.63 187.2,-90.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.03,-93.16 195.08,-84.46 184.92,-87.49 189.03,-93.16"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a48efb079040c7aaa3a4917a0e486cba9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275.62,-347.25 188.38,-347.25 188.38,-328 275.62,-328 275.62,-347.25"/>
-<text text-anchor="middle" x="232" y="-333.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_2d_classes</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node14 -->
-<g id="edge13_Node000005_Node000014" class="edge">
-<title>Node5&#45;&gt;Node14</title>
-<g id="a_edge13_Node000005_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.63,-228.55C137.26,-231.39 144.43,-235.35 149.75,-240.62 175.45,-266.09 160.55,-287.67 185.75,-313.62 188.71,-316.68 192.15,-319.42 195.77,-321.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="193.93,-324.85 204.32,-326.91 197.48,-318.82 193.93,-324.85"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="518,-252.25 463.75,-252.25 463.75,-233 518,-233 518,-252.25"/>
-<text text-anchor="middle" x="490.88" y="-238.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M398.16,-257.41C414,-254.86 434.46,-251.56 452.04,-248.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="452.57,-252.18 461.89,-247.14 451.46,-245.27 452.57,-252.18"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="422.5,-130.25 319.5,-130.25 319.5,-111 422.5,-111 422.5,-130.25"/>
-<text text-anchor="middle" x="371" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.38,-83.63C276.1,-89.32 296.24,-96.51 314.25,-102.62 318.46,-104.06 322.86,-105.52 327.27,-106.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.07,-110.27 336.67,-110.04 328.24,-103.61 326.07,-110.27"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="427.75,-93.25 314.25,-93.25 314.25,-74 427.75,-74 427.75,-93.25"/>
-<text text-anchor="middle" x="371" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge10_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge10_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.8,-76.38C280.67,-77.1 291.62,-77.9 302.54,-78.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="302.11,-82.18 312.34,-79.42 302.62,-75.2 302.11,-82.18"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="421.38,-56.25 320.62,-56.25 320.62,-37 421.38,-37 421.38,-56.25"/>
-<text text-anchor="middle" x="371" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node12 -->
-<g id="edge11_Node000009_Node000012" class="edge">
-<title>Node9&#45;&gt;Node12</title>
-<g id="a_edge11_Node000009_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.8,-66.18C282.62,-63.85 295.98,-61.21 308.98,-58.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.64,-62.09 318.78,-56.72 308.29,-55.22 309.64,-62.09"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strerror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="404.12,-19.25 337.88,-19.25 337.88,0 404.12,0 404.12,-19.25"/>
-<text text-anchor="middle" x="371" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strerror</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node13 -->
-<g id="edge12_Node000009_Node000013" class="edge">
-<title>Node9&#45;&gt;Node13</title>
-<g id="a_edge12_Node000009_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.39,-63.66C264.38,-53.61 290.35,-38.12 314.25,-27.62 318.27,-25.86 322.53,-24.18 326.82,-22.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.72,-25.99 336.02,-19.4 325.43,-19.38 327.72,-25.99"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node6 -->
-<g id="edge14_Node000014_Node000006" class="edge">
-<title>Node14&#45;&gt;Node6</title>
-<g id="a_edge14_Node000014_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M252,-327.7C260.11,-323.42 269.67,-318.33 278.25,-313.62 299.99,-301.7 324.4,-287.84 342.58,-277.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.25,-280.51 351.18,-272.49 340.76,-274.44 344.25,-280.51"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node7 -->
-<g id="edge15_Node000014_Node000007" class="edge">
-<title>Node14&#45;&gt;Node7</title>
-<g id="a_edge15_Node000014_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.93,-328.51C316.17,-319.17 377.5,-302.88 427.75,-280.62 441.2,-274.67 455.26,-266.27 466.6,-258.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="468.53,-261.81 474.89,-253.33 464.63,-255.99 468.53,-261.81"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node6 -->
-<g id="edge17_Node000015_Node000006" class="edge">
-<title>Node15&#45;&gt;Node6</title>
-<g id="a_edge17_Node000015_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.65,-192.76C136.99,-195.66 143.96,-199.34 149.75,-203.62 168.71,-217.66 164.66,-232.07 185.75,-242.62 232.4,-265.97 293.91,-267.36 332.72,-265.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="332.73,-268.75 342.48,-264.6 332.27,-261.77 332.73,-268.75"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node8 -->
-<g id="edge18_Node000015_Node000008" class="edge">
-<title>Node15&#45;&gt;Node8</title>
-<g id="a_edge18_Node000015_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.65,-185.78C147.24,-185.92 172.24,-186.13 193.13,-186.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="193.01,-189.8 203.04,-186.39 193.07,-182.81 193.01,-189.8"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node9 -->
-<g id="edge19_Node000015_Node000009" class="edge">
-<title>Node15&#45;&gt;Node9</title>
-<g id="a_edge19_Node000015_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.67,-179.74C137.31,-176.91 144.47,-172.94 149.75,-167.62 176.09,-141.11 158.49,-117.2 185.75,-91.62 186.37,-91.04 187.02,-90.47 187.68,-89.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.44,-92.96 195.89,-84.55 185.61,-87.1 189.44,-92.96"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a1302662a56ebf67a21249270b017297e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278.25,-233.25 185.75,-233.25 185.75,-214 278.25,-214 278.25,-233.25"/>
-<text text-anchor="middle" x="232" y="-219.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3d_classes1</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge20_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge20_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.65,-191.48C146.11,-196.43 168.88,-203.72 188.82,-210.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.51,-213.37 198.1,-213.08 189.64,-206.7 187.51,-213.37"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node6 -->
-<g id="edge21_Node000016_Node000006" class="edge">
-<title>Node16&#45;&gt;Node6</title>
-<g id="a_edge21_Node000016_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M269.35,-233.71C288.97,-239.15 313.13,-245.85 332.86,-251.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.87,-254.68 342.45,-253.98 333.74,-247.94 331.87,-254.68"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node7 -->
-<g id="edge22_Node000016_Node000007" class="edge">
-<title>Node16&#45;&gt;Node7</title>
-<g id="a_edge22_Node000016_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.63,-227C328.1,-230.66 406.14,-236.43 452.24,-239.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="451.77,-243.32 462,-240.56 452.29,-236.34 451.77,-243.32"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node6 -->
-<g id="edge24_Node000017_Node000006" class="edge">
-<title>Node17&#45;&gt;Node6</title>
-<g id="a_edge24_Node000017_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.41,-146.89C162.09,-144.65 229.06,-143.51 278.25,-167.62 312.9,-184.61 341.83,-220.21 357.46,-242.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="354.49,-244.25 363.01,-250.55 360.27,-240.31 354.49,-244.25"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node8 -->
-<g id="edge25_Node000017_Node000008" class="edge">
-<title>Node17&#45;&gt;Node8</title>
-<g id="a_edge25_Node000017_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.65,-154.48C147.4,-159.84 172.71,-167.95 193.72,-174.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.52,-177.97 203.11,-177.69 194.66,-171.31 192.52,-177.97"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node9 -->
-<g id="edge26_Node000017_Node000009" class="edge">
-<title>Node17&#45;&gt;Node9</title>
-<g id="a_edge26_Node000017_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.65,-141.49C136.99,-138.59 143.96,-134.91 149.75,-130.62 168.71,-116.59 166.31,-104.98 185.75,-91.62 187.28,-90.57 188.89,-89.57 190.54,-88.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.66,-91.97 199,-84.33 188.49,-85.72 191.66,-91.97"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a4b7ab643f6a5002f991837de46f70653" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278.25,-120.25 185.75,-120.25 185.75,-101 278.25,-101 278.25,-120.25"/>
-<text text-anchor="middle" x="232" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3d_classes2</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge27_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge27_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.65,-142.77C146.11,-137.82 168.88,-130.53 188.82,-124.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.64,-127.55 198.1,-121.17 187.51,-120.88 189.64,-127.55"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node6 -->
-<g id="edge28_Node000018_Node000006" class="edge">
-<title>Node18&#45;&gt;Node6</title>
-<g id="a_edge28_Node000018_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M257.5,-120.74C264.69,-124.43 272.23,-129.09 278.25,-134.62 300.03,-154.65 297.09,-166.52 314.25,-190.62 327.24,-208.88 343.12,-228.9 354.6,-243.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="351.75,-245.06 360.8,-250.57 357.16,-240.62 351.75,-245.06"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node7 -->
-<g id="edge29_Node000018_Node000007" class="edge">
-<title>Node18&#45;&gt;Node7</title>
-<g id="a_edge29_Node000018_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M252.31,-120.55C296.84,-143.43 407.01,-200.04 460.2,-227.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="458.5,-230.44 469,-231.9 461.7,-224.21 458.5,-230.44"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/def/kohonen__som__topology_8cpp_a48efb079040c7aaa3a4917a0e486cba9_cgraph.map b/d4/def/kohonen__som__topology_8cpp_a48efb079040c7aaa3a4917a0e486cba9_cgraph.map
deleted file mode 100644
index bd8b64e16..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a48efb079040c7aaa3a4917a0e486cba9_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="test_2d_classes" name="test_2d_classes">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,122,56"/>
-<area shape="rect" id="Node000002" href="$d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" title=" " alt="" coords="170,5,241,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="122,30,154,25,154,30,123,36"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="289,31,361,56"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="122,41,273,41,273,46,122,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="242,23,274,30,273,35,241,28"/>
-</map>
diff --git a/d4/def/kohonen__som__topology_8cpp_a48efb079040c7aaa3a4917a0e486cba9_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a48efb079040c7aaa3a4917a0e486cba9_cgraph.md5
deleted file mode 100644
index 7d11d4feb..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a48efb079040c7aaa3a4917a0e486cba9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-387a6fcea5ad5cae387b1a46960c4466
\ No newline at end of file
diff --git a/d4/def/kohonen__som__topology_8cpp_a48efb079040c7aaa3a4917a0e486cba9_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a48efb079040c7aaa3a4917a0e486cba9_cgraph.svg
deleted file mode 100644
index 5f3a59c20..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a48efb079040c7aaa3a4917a0e486cba9_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_2d_classes Pages: 1 -->
-<svg width="275pt" height="46pt"
- viewBox="0.00 0.00 275.00 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>test_2d_classes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="87.25,-19.25 0,-19.25 0,0 87.25,0 87.25,-19.25"/>
-<text text-anchor="middle" x="43.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_2d_classes</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-38.25 123.25,-38.25 123.25,-19 176.75,-19 176.75,-38.25"/>
-<text text-anchor="middle" x="150" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.68,-17.46C95.59,-18.9 103.78,-20.39 111.51,-21.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.82,-25.23 121.29,-23.58 112.07,-18.35 110.82,-25.23"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267,-19.25 212.75,-19.25 212.75,0 267,0 267,-19.25"/>
-<text text-anchor="middle" x="239.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.74,-9.62C121.68,-9.62 168.53,-9.62 201.04,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.8,-13.13 210.8,-9.63 200.8,-6.13 200.8,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.89,-23.03C184.46,-21.39 192.9,-19.57 201.05,-17.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.74,-21.23 210.78,-15.7 200.26,-14.39 201.74,-21.23"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/def/kohonen__som__topology_8cpp_a48efb079040c7aaa3a4917a0e486cba9_cgraph_org.svg b/d4/def/kohonen__som__topology_8cpp_a48efb079040c7aaa3a4917a0e486cba9_cgraph_org.svg
deleted file mode 100644
index 63a30d4ee..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a48efb079040c7aaa3a4917a0e486cba9_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_2d_classes Pages: 1 -->
-<svg width="275pt" height="46pt"
- viewBox="0.00 0.00 275.00 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>test_2d_classes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="87.25,-19.25 0,-19.25 0,0 87.25,0 87.25,-19.25"/>
-<text text-anchor="middle" x="43.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_2d_classes</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-38.25 123.25,-38.25 123.25,-19 176.75,-19 176.75,-38.25"/>
-<text text-anchor="middle" x="150" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.68,-17.46C95.59,-18.9 103.78,-20.39 111.51,-21.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.82,-25.23 121.29,-23.58 112.07,-18.35 110.82,-25.23"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267,-19.25 212.75,-19.25 212.75,0 267,0 267,-19.25"/>
-<text text-anchor="middle" x="239.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.74,-9.62C121.68,-9.62 168.53,-9.62 201.04,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.8,-13.13 210.8,-9.63 200.8,-6.13 200.8,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.89,-23.03C184.46,-21.39 192.9,-19.57 201.05,-17.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.74,-21.23 210.78,-15.7 200.26,-14.39 201.74,-21.23"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/def/kohonen__som__topology_8cpp_a4b7ab643f6a5002f991837de46f70653_cgraph.map b/d4/def/kohonen__som__topology_8cpp_a4b7ab643f6a5002f991837de46f70653_cgraph.map
deleted file mode 100644
index 054da4dc7..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a4b7ab643f6a5002f991837de46f70653_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="test_3d_classes2" name="test_3d_classes2">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,129,56"/>
-<area shape="rect" id="Node000002" href="$d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" title=" " alt="" coords="177,5,248,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="129,30,161,24,162,30,130,35"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="296,31,368,56"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="129,41,281,41,281,46,129,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="249,23,281,30,280,35,248,28"/>
-</map>
diff --git a/d4/def/kohonen__som__topology_8cpp_a4b7ab643f6a5002f991837de46f70653_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a4b7ab643f6a5002f991837de46f70653_cgraph.md5
deleted file mode 100644
index 1b7f93330..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a4b7ab643f6a5002f991837de46f70653_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2bddbfe9c5a913bf13fa165a6ced1485
\ No newline at end of file
diff --git a/d4/def/kohonen__som__topology_8cpp_a4b7ab643f6a5002f991837de46f70653_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a4b7ab643f6a5002f991837de46f70653_cgraph.svg
deleted file mode 100644
index 3871a02c8..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a4b7ab643f6a5002f991837de46f70653_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_3d_classes2 Pages: 1 -->
-<svg width="280pt" height="46pt"
- viewBox="0.00 0.00 280.25 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>test_3d_classes2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="92.5,-19.25 0,-19.25 0,0 92.5,0 92.5,-19.25"/>
-<text text-anchor="middle" x="46.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3d_classes2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="182,-38.25 128.5,-38.25 128.5,-19 182,-19 182,-38.25"/>
-<text text-anchor="middle" x="155.25" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.94,-17.74C100.93,-19.16 109.17,-20.62 116.91,-21.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="116.22,-25.43 126.68,-23.73 117.45,-18.54 116.22,-25.43"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272.25,-19.25 218,-19.25 218,0 272.25,0 272.25,-19.25"/>
-<text text-anchor="middle" x="245.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.91,-9.62C127.41,-9.62 174.19,-9.62 206.54,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.24,-13.13 216.24,-9.63 206.24,-6.13 206.24,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.14,-23.03C189.71,-21.39 198.15,-19.57 206.3,-17.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.99,-21.23 216.03,-15.7 205.51,-14.39 206.99,-21.23"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/def/kohonen__som__topology_8cpp_a4b7ab643f6a5002f991837de46f70653_cgraph_org.svg b/d4/def/kohonen__som__topology_8cpp_a4b7ab643f6a5002f991837de46f70653_cgraph_org.svg
deleted file mode 100644
index 185d45c52..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a4b7ab643f6a5002f991837de46f70653_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_3d_classes2 Pages: 1 -->
-<svg width="280pt" height="46pt"
- viewBox="0.00 0.00 280.25 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>test_3d_classes2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="92.5,-19.25 0,-19.25 0,0 92.5,0 92.5,-19.25"/>
-<text text-anchor="middle" x="46.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3d_classes2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="182,-38.25 128.5,-38.25 128.5,-19 182,-19 182,-38.25"/>
-<text text-anchor="middle" x="155.25" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.94,-17.74C100.93,-19.16 109.17,-20.62 116.91,-21.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="116.22,-25.43 126.68,-23.73 117.45,-18.54 116.22,-25.43"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272.25,-19.25 218,-19.25 218,0 272.25,0 272.25,-19.25"/>
-<text text-anchor="middle" x="245.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.91,-9.62C127.41,-9.62 174.19,-9.62 206.54,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.24,-13.13 216.24,-9.63 206.24,-6.13 206.24,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.14,-23.03C189.71,-21.39 198.15,-19.57 206.3,-17.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.99,-21.23 216.03,-15.7 205.51,-14.39 206.99,-21.23"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
deleted file mode 100644
index ae17fb976..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
+++ /dev/null
@@ -1,23 +0,0 @@
-<map id="test3" name="test3">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,59,56,84"/>
-<area shape="rect" id="Node000002" href="$d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" title=" " alt="" coords="315,7,386,32"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="44,56,69,36,103,18,154,7,207,3,300,9,300,14,207,9,155,12,105,24,72,40,47,60"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="129,33,202,59"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,64,114,53,115,58,57,70"/>
-<area shape="rect" id="Node000005" href="$d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c" title=" " alt="" coords="114,157,216,183"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="51,83,135,146,132,150,48,87"/>
-<area shape="rect" id="Node000010" href="$d4/def/kohonen__som__topology_8cpp.html#a4b7ab643f6a5002f991837de46f70653" title=" " alt="" coords="104,83,227,108"/>
-<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="57,73,89,79,88,85,56,79"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="474,32,547,58"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="387,23,459,34,458,40,386,28"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="282,207,419,232"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="217,181,286,200,284,205,216,186"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="275,256,426,282"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="184,181,225,212,276,243,287,248,285,253,274,247,222,216,181,186"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="284,108,418,134"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="216,154,284,136,286,141,217,159"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/strerror.html#" title=" " alt="" coords="306,157,395,183"/>
-<area shape="poly" id="edge8_Node000005_Node000009" title=" " alt="" coords="217,168,291,168,291,173,217,173"/>
-<area shape="poly" id="edge10_Node000010_Node000002" title=" " alt="" coords="200,80,226,69,304,36,306,41,228,74,202,85"/>
-<area shape="poly" id="edge11_Node000010_Node000003" title=" " alt="" coords="227,84,459,50,459,55,228,89"/>
-</map>
diff --git a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
deleted file mode 100644
index be5042411..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f583449a71a0ab406419ab37fdb60ed3
\ No newline at end of file
diff --git a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
deleted file mode 100644
index da6d59f58..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
+++ /dev/null
@@ -1,227 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<svg width="414pt" height="215pt"
- viewBox="0.00 0.00 414.00 215.37" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 211.37)">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-167.25 0,-167.25 0,-148 37.75,-148 37.75,-167.25"/>
-<text text-anchor="middle" x="18.88" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.75,-206.25 232.25,-206.25 232.25,-187 285.75,-187 285.75,-206.25"/>
-<text text-anchor="middle" x="259" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.94,-167.64C40.04,-176.93 56.53,-190.11 73.75,-195.62 122.76,-211.32 182.92,-207.68 220.88,-202.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.98,-206.33 230.41,-201.49 220.02,-199.4 220.98,-206.33"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="147.12,-186.25 92.88,-186.25 92.88,-167 147.12,-167 147.12,-186.25"/>
-<text text-anchor="middle" x="120" y="-172.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.06,-161.11C50.26,-163.45 66.78,-166.61 81.71,-169.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.75,-172.86 91.23,-171.3 82.07,-165.98 80.75,-172.86"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158.38,-93.25 81.62,-93.25 81.62,-74 158.38,-74 158.38,-93.25"/>
-<text text-anchor="middle" x="120" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_2d_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.24,-147.65C49.43,-135.56 76.93,-115.03 96.43,-100.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.39,-103.38 104.31,-94.59 94.21,-97.77 98.39,-103.38"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a4b7ab643f6a5002f991837de46f70653" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="166.25,-149.25 73.75,-149.25 73.75,-130 166.25,-130 166.25,-149.25"/>
-<text text-anchor="middle" x="120" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3d_classes2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.06,-154.32C45.05,-153.05 53.46,-151.53 62.18,-149.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.6,-153.42 71.82,-148.19 61.35,-146.54 62.6,-153.42"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="406,-187.25 351.75,-187.25 351.75,-168 406,-168 406,-187.25"/>
-<text text-anchor="middle" x="378.88" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M286.16,-192.41C302,-189.86 322.46,-186.56 340.04,-183.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="340.57,-187.18 349.89,-182.14 339.46,-180.27 340.57,-187.18"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="310.5,-56.25 207.5,-56.25 207.5,-37 310.5,-37 310.5,-56.25"/>
-<text text-anchor="middle" x="259" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.44,-73.51C174.29,-69.23 192.97,-64.19 209.83,-59.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="210.41,-63.1 219.15,-57.12 208.58,-56.35 210.41,-63.1"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="315.75,-19.25 202.25,-19.25 202.25,0 315.75,0 315.75,-19.25"/>
-<text text-anchor="middle" x="259" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.97,-73.7C148.23,-61.45 175.82,-40.65 202.25,-27.62 204.98,-26.28 207.83,-25 210.74,-23.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="211.88,-27.11 219.99,-20.29 209.4,-20.56 211.88,-27.11"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="309.38,-130.25 208.62,-130.25 208.62,-111 309.38,-111 309.38,-130.25"/>
-<text text-anchor="middle" x="259" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.44,-93.74C174.29,-98.02 192.97,-103.06 209.83,-107.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.58,-110.9 219.15,-110.13 210.41,-104.15 208.58,-110.9"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strerror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.12,-93.25 225.88,-93.25 225.88,-74 292.12,-74 292.12,-93.25"/>
-<text text-anchor="middle" x="259" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strerror</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge8_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge8_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.8,-83.62C175.95,-83.62 196.34,-83.62 214.16,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.93,-87.13 223.93,-83.63 213.93,-80.13 213.93,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node2 -->
-<g id="edge10_Node000010_Node000002" class="edge">
-<title>Node10&#45;&gt;Node2</title>
-<g id="a_edge10_Node000010_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.41,-149.61C152.89,-152.19 159.84,-154.99 166.25,-157.62 185.6,-165.59 207.14,-174.73 224.48,-182.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.72,-185.21 233.29,-185.94 225.48,-178.78 222.72,-185.21"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node3 -->
-<g id="edge11_Node000010_Node000003" class="edge">
-<title>Node10&#45;&gt;Node3</title>
-<g id="a_edge11_Node000010_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M166.63,-146.37C216.1,-153.69 294.14,-165.24 340.24,-172.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="339.61,-175.5 350.01,-173.5 340.63,-168.58 339.61,-175.5"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
deleted file mode 100644
index 360e28702..000000000
--- a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
+++ /dev/null
@@ -1,201 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<svg width="414pt" height="215pt"
- viewBox="0.00 0.00 414.00 215.37" 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 211.37)">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-167.25 0,-167.25 0,-148 37.75,-148 37.75,-167.25"/>
-<text text-anchor="middle" x="18.88" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.75,-206.25 232.25,-206.25 232.25,-187 285.75,-187 285.75,-206.25"/>
-<text text-anchor="middle" x="259" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.94,-167.64C40.04,-176.93 56.53,-190.11 73.75,-195.62 122.76,-211.32 182.92,-207.68 220.88,-202.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.98,-206.33 230.41,-201.49 220.02,-199.4 220.98,-206.33"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="147.12,-186.25 92.88,-186.25 92.88,-167 147.12,-167 147.12,-186.25"/>
-<text text-anchor="middle" x="120" y="-172.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.06,-161.11C50.26,-163.45 66.78,-166.61 81.71,-169.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.75,-172.86 91.23,-171.3 82.07,-165.98 80.75,-172.86"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158.38,-93.25 81.62,-93.25 81.62,-74 158.38,-74 158.38,-93.25"/>
-<text text-anchor="middle" x="120" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_2d_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.24,-147.65C49.43,-135.56 76.93,-115.03 96.43,-100.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.39,-103.38 104.31,-94.59 94.21,-97.77 98.39,-103.38"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d4/def/kohonen__som__topology_8cpp.html#a4b7ab643f6a5002f991837de46f70653" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="166.25,-149.25 73.75,-149.25 73.75,-130 166.25,-130 166.25,-149.25"/>
-<text text-anchor="middle" x="120" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3d_classes2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.06,-154.32C45.05,-153.05 53.46,-151.53 62.18,-149.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.6,-153.42 71.82,-148.19 61.35,-146.54 62.6,-153.42"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="406,-187.25 351.75,-187.25 351.75,-168 406,-168 406,-187.25"/>
-<text text-anchor="middle" x="378.88" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M286.16,-192.41C302,-189.86 322.46,-186.56 340.04,-183.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="340.57,-187.18 349.89,-182.14 339.46,-180.27 340.57,-187.18"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="310.5,-56.25 207.5,-56.25 207.5,-37 310.5,-37 310.5,-56.25"/>
-<text text-anchor="middle" x="259" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.44,-73.51C174.29,-69.23 192.97,-64.19 209.83,-59.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="210.41,-63.1 219.15,-57.12 208.58,-56.35 210.41,-63.1"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="315.75,-19.25 202.25,-19.25 202.25,0 315.75,0 315.75,-19.25"/>
-<text text-anchor="middle" x="259" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.97,-73.7C148.23,-61.45 175.82,-40.65 202.25,-27.62 204.98,-26.28 207.83,-25 210.74,-23.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="211.88,-27.11 219.99,-20.29 209.4,-20.56 211.88,-27.11"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="309.38,-130.25 208.62,-130.25 208.62,-111 309.38,-111 309.38,-130.25"/>
-<text text-anchor="middle" x="259" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.44,-93.74C174.29,-98.02 192.97,-103.06 209.83,-107.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.58,-110.9 219.15,-110.13 210.41,-104.15 208.58,-110.9"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strerror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.12,-93.25 225.88,-93.25 225.88,-74 292.12,-74 292.12,-93.25"/>
-<text text-anchor="middle" x="259" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strerror</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge8_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge8_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.8,-83.62C175.95,-83.62 196.34,-83.62 214.16,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.93,-87.13 223.93,-83.63 213.93,-80.13 213.93,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node2 -->
-<g id="edge10_Node000010_Node000002" class="edge">
-<title>Node10&#45;&gt;Node2</title>
-<g id="a_edge10_Node000010_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.41,-149.61C152.89,-152.19 159.84,-154.99 166.25,-157.62 185.6,-165.59 207.14,-174.73 224.48,-182.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.72,-185.21 233.29,-185.94 225.48,-178.78 222.72,-185.21"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node3 -->
-<g id="edge11_Node000010_Node000003" class="edge">
-<title>Node10&#45;&gt;Node3</title>
-<g id="a_edge11_Node000010_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M166.63,-146.37C216.1,-153.69 294.14,-165.24 340.24,-172.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="339.61,-175.5 350.01,-173.5 340.63,-168.58 339.61,-175.5"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/def/kohonen__som__topology_8cpp_source.html b/d4/def/kohonen__som__topology_8cpp_source.html
new file mode 100644
index 000000000..04cc68347
--- /dev/null
+++ b/d4/def/kohonen__som__topology_8cpp_source.html
@@ -0,0 +1,651 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: machine_learning/kohonen_som_topology.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/def/kohonen__som__topology_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">kohonen_som_topology.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d4/def/kohonen__som__topology_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#define _USE_MATH_DEFINES  </span><span class="comment">//&lt; required for MS Visual C++</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;array&gt;</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;cerrno&gt;</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;cstdlib&gt;</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;fstream&gt;</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#include &lt;valarray&gt;</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="preprocessor">#ifdef _OPENMP  </span><span class="comment">// check if OpenMP based parallellization is available</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#include &lt;omp.h&gt;</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="foldopen" id="foldopen00053" data-start="{" data-end="}">
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">   53</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(<span class="keywordtype">double</span> a, <span class="keywordtype">double</span> b) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">return</span> ((b - a) * (std::rand() % 100) / 100.f) + a;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>}</div>
+</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="foldopen" id="foldopen00065" data-start="{" data-end="}">
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c">   65</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c">save_2d_data</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> *fname,</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>                 <span class="keyword">const</span> std::vector&lt;std::valarray&lt;double&gt;&gt; &amp;X) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordtype">size_t</span> num_points = X.size();       <span class="comment">// number of rows</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keywordtype">size_t</span> num_features = X[0].size();  <span class="comment">// number of columns</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    std::ofstream fp;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    fp.open(fname);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keywordflow">if</span> (!fp.is_open()) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        <span class="comment">// error with opening file to write</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Error opening file &quot;</span> &lt;&lt; fname &lt;&lt; <span class="stringliteral">&quot;: &quot;</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>                  &lt;&lt; std::strerror(errno) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="comment">// for each point in the array</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; num_points; i++) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <span class="comment">// for each feature in the array</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; num_features; j++) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            fp &lt;&lt; X[i][j];               <span class="comment">// print the feature value</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            <span class="keywordflow">if</span> (j &lt; num_features - 1) {  <span class="comment">// if not the last feature</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>                fp &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;               <span class="comment">// suffix comma</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            }</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        <span class="keywordflow">if</span> (i &lt; num_points - 1) {  <span class="comment">// if not the last row</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>            fp &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;            <span class="comment">// start a new line</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    }</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    fp.close();</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>}</div>
+</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="foldopen" id="foldopen00105" data-start="{" data-end="}">
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"><a class="line" href="../../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e">  105</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e">get_min_2d</a>(<span class="keyword">const</span> std::vector&lt;std::valarray&lt;double&gt;&gt; &amp;X, <span class="keywordtype">double</span> *val,</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>                <span class="keywordtype">int</span> *x_idx, <span class="keywordtype">int</span> *y_idx) {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    val[0] = INFINITY;  <span class="comment">// initial min value</span></div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="keywordtype">size_t</span> N = X.size();</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N; i++) {  <span class="comment">// traverse each x-index</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        <span class="keyword">auto</span> result = std::min_element(std::begin(X[i]), std::end(X[i]));</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        <span class="keywordtype">double</span> d_min = *result;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        std::ptrdiff_t j = std::distance(std::begin(X[i]), result);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        <span class="keywordflow">if</span> (d_min &lt; val[0]) {  <span class="comment">// if a lower value is found</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>                               <span class="comment">// save the value and its index</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>            x_idx[0] = i;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>            y_idx[0] = j;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>            val[0] = d_min;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        }</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    }</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>}</div>
+</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d77/namespacemachine__learning.html">machine_learning</a> {</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a7220dbb7fa896d83bfb7a50e4fce1786">  129</a></span><span class="keyword">constexpr</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="../../d8/d77/namespacemachine__learning.html#a7220dbb7fa896d83bfb7a50e4fce1786">MIN_DISTANCE</a> = 1e-4;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="foldopen" id="foldopen00142" data-start="{" data-end="}">
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#aa72a53c88203fde278f1fe6c3afe5b07">  142</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa72a53c88203fde278f1fe6c3afe5b07">save_u_matrix</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> *fname,</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>                  <span class="keyword">const</span> std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; &amp;W) {</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    std::ofstream fp(fname);</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <span class="keywordflow">if</span> (!fp) {  <span class="comment">// error with fopen</span></div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;File error (&quot;</span> &lt;&lt; fname &lt;&lt; <span class="stringliteral">&quot;): &quot;</span> &lt;&lt; std::strerror(errno)</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>                  &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    }</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    <span class="comment">// neighborhood range</span></div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> R = 1;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span> </div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; W.size(); i++) {         <span class="comment">// for each x</span></div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; W[0].size(); j++) {  <span class="comment">// for each y</span></div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>            <span class="keywordtype">double</span> distance = 0.f;</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span> </div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>            <span class="keywordtype">int</span> from_x = std::max&lt;int&gt;(0, i - R);</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>            <span class="keywordtype">int</span> to_x = std::min&lt;int&gt;(W.size(), i + R + 1);</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>            <span class="keywordtype">int</span> from_y = std::max&lt;int&gt;(0, j - R);</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>            <span class="keywordtype">int</span> to_y = std::min&lt;int&gt;(W[0].size(), j + R + 1);</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>            <span class="keywordtype">int</span> l = 0, m = 0;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span><span class="preprocessor">#pragma omp parallel for reduction(+ : distance)</span></div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>            <span class="keywordflow">for</span> (l = from_x; l &lt; to_x; l++) {      <span class="comment">// scan neighborhoor in x</span></div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>                <span class="keywordflow">for</span> (m = from_y; m &lt; to_y; m++) {  <span class="comment">// scan neighborhood in y</span></div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>                    <span class="keyword">auto</span> d = W[i][j] - W[l][m];</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>                    <span class="keywordtype">double</span> d2 = std::pow(d, 2).sum();</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>                    distance += std::sqrt(d2);</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>                    <span class="comment">// distance += d2;</span></div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>                }</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>            }</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span> </div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>            distance /= R * R;          <span class="comment">// mean distance from neighbors</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>            fp &lt;&lt; distance;             <span class="comment">// print the mean separation</span></div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>            <span class="keywordflow">if</span> (j &lt; W[0].size() - 1) {  <span class="comment">// if not the last column</span></div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>                fp &lt;&lt; <span class="charliteral">&#39;,&#39;</span>;              <span class="comment">// suffix comma</span></div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>            }</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        }</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>        <span class="keywordflow">if</span> (i &lt; W.size() - 1) {  <span class="comment">// if not the last row</span></div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>            fp &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;          <span class="comment">// start a new line</span></div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>        }</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    }</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span> </div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    fp.close();</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>}</div>
+</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span> </div>
+<div class="foldopen" id="foldopen00200" data-start="{" data-end="}">
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3">  200</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3">update_weights</a>(<span class="keyword">const</span> std::valarray&lt;double&gt; &amp;X,</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>                      std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; *W,</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>                      std::vector&lt;std::valarray&lt;double&gt;&gt; *D, <span class="keywordtype">double</span> alpha,</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>                      <span class="keywordtype">int</span> R) {</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    <span class="keywordtype">int</span> x = 0, y = 0;</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    <span class="keywordtype">int</span> num_out_x = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(W-&gt;size());       <span class="comment">// output nodes - in X</span></div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    <span class="keywordtype">int</span> num_out_y = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(W[0][0].size());  <span class="comment">// output nodes - in Y</span></div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    <span class="comment">// int num_features = static_cast&lt;int&gt;(W[0][0][0].size());  //  features =</span></div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    <span class="comment">// in Z</span></div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    <span class="keywordtype">double</span> d_min = 0.f;</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span> </div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span><span class="preprocessor">#pragma omp for</span></div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    <span class="comment">// step 1: for each output point</span></div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    <span class="keywordflow">for</span> (x = 0; x &lt; num_out_x; x++) {</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>        <span class="keywordflow">for</span> (y = 0; y &lt; num_out_y; y++) {</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>            (*D)[x][y] = 0.f;</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>            <span class="comment">// compute Euclidian distance of each output</span></div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>            <span class="comment">// point from the current sample</span></div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>            <span class="keyword">auto</span> d = ((*W)[x][y] - X);</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>            (*D)[x][y] = (d * d).<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a>();</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>            (*D)[x][y] = std::sqrt((*D)[x][y]);</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>        }</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    }</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span> </div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    <span class="comment">// step 2:  get closest node i.e., node with snallest Euclidian distance</span></div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    <span class="comment">// to the current pattern</span></div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    <span class="keywordtype">int</span> d_min_x = 0, d_min_y = 0;</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e">get_min_2d</a>(*D, &amp;d_min, &amp;d_min_x, &amp;d_min_y);</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span> </div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    <span class="comment">// step 3a: get the neighborhood range</span></div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    <span class="keywordtype">int</span> from_x = std::max(0, d_min_x - R);</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    <span class="keywordtype">int</span> to_x = std::min(num_out_x, d_min_x + R + 1);</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    <span class="keywordtype">int</span> from_y = std::max(0, d_min_y - R);</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    <span class="keywordtype">int</span> to_y = std::min(num_out_y, d_min_y + R + 1);</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span> </div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    <span class="comment">// step 3b: update the weights of nodes in the</span></div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    <span class="comment">// neighborhood</span></div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span><span class="preprocessor">#pragma omp for</span></div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    <span class="keywordflow">for</span> (x = from_x; x &lt; to_x; x++) {</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>        <span class="keywordflow">for</span> (y = from_y; y &lt; to_y; y++) {</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>            <span class="comment">/* you can enable the following normalization if needed.</span></div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span><span class="comment">   personally, I found it detrimental to convergence */</span></div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>            <span class="comment">// const double s2pi = sqrt(2.f * M_PI);</span></div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>            <span class="comment">// double normalize = 1.f / (alpha * s2pi);</span></div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span> </div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>            <span class="comment">/* apply scaling inversely proportional to distance from the</span></div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span><span class="comment">               current node */</span></div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>            <span class="keywordtype">double</span> d2 =</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>                (d_min_x - x) * (d_min_x - x) + (d_min_y - y) * (d_min_y - y);</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>            <span class="keywordtype">double</span> scale_factor = std::exp(-d2 / (2.f * alpha * alpha));</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span> </div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>            (*W)[x][y] += (X - (*W)[x][y]) * alpha * scale_factor;</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>        }</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    }</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    <span class="keywordflow">return</span> d_min;</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>}</div>
+</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span> </div>
+<div class="foldopen" id="foldopen00269" data-start="{" data-end="}">
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576">  269</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576">kohonen_som</a>(<span class="keyword">const</span> std::vector&lt;std::valarray&lt;double&gt;&gt; &amp;X,</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>                 std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; *W,</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>                 <span class="keywordtype">double</span> alpha_min) {</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    <span class="keywordtype">size_t</span> num_samples = X.size();  <span class="comment">// number of rows</span></div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>    <span class="comment">// size_t num_features = X[0].size();  // number of columns</span></div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>    <span class="keywordtype">size_t</span> num_out = W-&gt;size();  <span class="comment">// output matrix size</span></div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    <span class="keywordtype">size_t</span> R = num_out &gt;&gt; 2, iter = 0;</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>    <span class="keywordtype">double</span> alpha = 1.f;</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span> </div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; D(num_out);</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; num_out; i++) D[i] = std::valarray&lt;double&gt;(num_out);</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span> </div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>    <span class="keywordtype">double</span> dmin = 1.f;        <span class="comment">// average minimum distance of all samples</span></div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>    <span class="keywordtype">double</span> past_dmin = 1.f;   <span class="comment">// average minimum distance of all samples</span></div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    <span class="keywordtype">double</span> dmin_ratio = 1.f;  <span class="comment">// change per step</span></div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span> </div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>    <span class="comment">// Loop alpha from 1 to slpha_min</span></div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>    <span class="keywordflow">for</span> (; alpha &gt; 0 &amp;&amp; dmin_ratio &gt; 1e-5; alpha -= 1e-4, iter++) {</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>        <span class="comment">// Loop for each sample pattern in the data set</span></div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> sample = 0; sample &lt; num_samples; sample++) {</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>            <span class="comment">// update weights for the current input pattern sample</span></div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>            dmin += <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3">update_weights</a>(X[sample], W, &amp;D, alpha, R);</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>        }</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span> </div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>        <span class="comment">// every 100th iteration, reduce the neighborhood range</span></div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>        <span class="keywordflow">if</span> (iter % 300 == 0 &amp;&amp; R &gt; 1) {</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>            R--;</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>        }</div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span> </div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>        dmin /= num_samples;</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span> </div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>        <span class="comment">// termination condition variable -&gt; % change in minimum distance</span></div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>        dmin_ratio = (past_dmin - dmin) / past_dmin;</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>        <span class="keywordflow">if</span> (dmin_ratio &lt; 0) {</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>            dmin_ratio = 1.f;</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>        }</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>        past_dmin = dmin;</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span> </div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;iter: &quot;</span> &lt;&lt; iter &lt;&lt; <span class="stringliteral">&quot;\t alpha: &quot;</span> &lt;&lt; alpha &lt;&lt; <span class="stringliteral">&quot;\t R: &quot;</span> &lt;&lt; R</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>                  &lt;&lt; <span class="stringliteral">&quot;\t d_min: &quot;</span> &lt;&lt; dmin_ratio &lt;&lt; <span class="stringliteral">&quot;\r&quot;</span>;</div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>    }</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span> </div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>}</div>
+</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span> </div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>}  <span class="comment">// namespace machine_learning</span></div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span> </div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span><span class="keyword">using </span><a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576">machine_learning::kohonen_som</a>;</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span><span class="keyword">using </span><a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa72a53c88203fde278f1fe6c3afe5b07">machine_learning::save_u_matrix</a>;</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span> </div>
+<div class="foldopen" id="foldopen00330" data-start="{" data-end="}">
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"><a class="line" href="../../d4/def/kohonen__som__topology_8cpp.html#a48efb079040c7aaa3a4917a0e486cba9">  330</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/def/kohonen__som__topology_8cpp.html#a48efb079040c7aaa3a4917a0e486cba9">test_2d_classes</a>(std::vector&lt;std::valarray&lt;double&gt;&gt; *<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> N = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>-&gt;size();</div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> R = 0.3;  <span class="comment">// radius of cluster</span></div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>    <span class="keywordtype">int</span> i = 0;</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> num_classes = 4;</div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>    std::array&lt;std::array&lt;double, 2&gt;, num_classes&gt; centres = {</div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>        <span class="comment">// centres of each class cluster</span></div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>        std::array&lt;double, 2&gt;({.5, .5}),   <span class="comment">// centre of class 1</span></div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>        std::array&lt;double, 2&gt;({.5, -.5}),  <span class="comment">// centre of class 2</span></div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>        std::array&lt;double, 2&gt;({-.5, .5}),  <span class="comment">// centre of class 3</span></div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>        std::array&lt;double, 2&gt;({-.5, -.5})  <span class="comment">// centre of class 4</span></div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>    };</div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span> </div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span><span class="preprocessor">#pragma omp for</span></div>
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>    <span class="keywordflow">for</span> (i = 0; i &lt; N; i++) {</div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>        <span class="comment">// select a random class for the point</span></div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>        <span class="keywordtype">int</span> cls = std::rand() % num_classes;</div>
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span> </div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>        <span class="comment">// create random coordinates (x,y,z) around the centre of the class</span></div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][0] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(centres[cls][0] - R, centres[cls][0] + R);</div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][1] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(centres[cls][1] - R, centres[cls][1] + R);</div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span> </div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>        <span class="comment">/* The follosing can also be used</span></div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span><span class="comment">        for (int j = 0; j &lt; 2; j++)</span></div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span><span class="comment">            data[i][j] = _random(centres[class][j] - R, centres[class][j] + R);</span></div>
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span><span class="comment">        */</span></div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>    }</div>
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>}</div>
+</div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span> </div>
+<div class="foldopen" id="foldopen00369" data-start="{" data-end="}">
+<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"><a class="line" href="../../d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">  369</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>() {</div>
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>    <span class="keywordtype">int</span> j = 0, N = 300;</div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>    <span class="keywordtype">int</span> features = 2;</div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>    <span class="keywordtype">int</span> num_out = 30;</div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; X(N);</div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>    std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; W(num_out);</div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; std::max(num_out, N); i++) {</div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>        <span class="comment">// loop till max(N, num_out)</span></div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>        <span class="keywordflow">if</span> (i &lt; N) {  <span class="comment">// only add new arrays if i &lt; N</span></div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>            X[i] = std::valarray&lt;double&gt;(features);</div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>        }</div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>        <span class="keywordflow">if</span> (i &lt; num_out) {  <span class="comment">// only add new arrays if i &lt; num_out</span></div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>            W[i] = std::vector&lt;std::valarray&lt;double&gt;&gt;(num_out);</div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; k &lt; num_out; k++) {</div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>                W[i][k] = std::valarray&lt;double&gt;(features);</div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span><span class="preprocessor">#pragma omp for</span></div>
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>                <span class="keywordflow">for</span> (j = 0; j &lt; features; j++) {</div>
+<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>                    <span class="comment">// preallocate with random initial weights</span></div>
+<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>                    W[i][k][j] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(-10, 10);</div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>                }</div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>            }</div>
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>        }</div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>    }</div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span> </div>
+<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>    <a class="code hl_function" href="../../d4/def/kohonen__som__topology_8cpp.html#a48efb079040c7aaa3a4917a0e486cba9">test_2d_classes</a>(&amp;X);  <span class="comment">// create test data around circumference of a circle</span></div>
+<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>    <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c">save_2d_data</a>(<span class="stringliteral">&quot;test1.csv&quot;</span>, X);  <span class="comment">// save test data points</span></div>
+<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>    save_u_matrix(<span class="stringliteral">&quot;w11.csv&quot;</span>, W);   <span class="comment">// save initial random weights</span></div>
+<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>    kohonen_som(X, &amp;W, 1e-4);      <span class="comment">// train the SOM</span></div>
+<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>    save_u_matrix(<span class="stringliteral">&quot;w12.csv&quot;</span>, W);   <span class="comment">// save the resultant weights</span></div>
+<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span>}</div>
+</div>
+<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span> </div>
+<div class="foldopen" id="foldopen00411" data-start="{" data-end="}">
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"><a class="line" href="../../d4/def/kohonen__som__topology_8cpp.html#a1302662a56ebf67a21249270b017297e">  411</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/def/kohonen__som__topology_8cpp.html#a1302662a56ebf67a21249270b017297e">test_3d_classes1</a>(std::vector&lt;std::valarray&lt;double&gt;&gt; *<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> N = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>-&gt;size();</div>
+<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> R = 0.3;  <span class="comment">// radius of cluster</span></div>
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>    <span class="keywordtype">int</span> i = 0;</div>
+<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> num_classes = 4;</div>
+<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>    <span class="keyword">const</span> std::array&lt;std::array&lt;double, 3&gt;, num_classes&gt; centres = {</div>
+<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>        <span class="comment">// centres of each class cluster</span></div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>        std::array&lt;double, 3&gt;({.5, .5, .5}),    <span class="comment">// centre of class 1</span></div>
+<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>        std::array&lt;double, 3&gt;({.5, -.5, -.5}),  <span class="comment">// centre of class 2</span></div>
+<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>        std::array&lt;double, 3&gt;({-.5, .5, .5}),   <span class="comment">// centre of class 3</span></div>
+<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>        std::array&lt;double, 3&gt;({-.5, -.5 - .5})  <span class="comment">// centre of class 4</span></div>
+<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>    };</div>
+<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span> </div>
+<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span><span class="preprocessor">#pragma omp for</span></div>
+<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>    <span class="keywordflow">for</span> (i = 0; i &lt; N; i++) {</div>
+<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>        <span class="comment">// select a random class for the point</span></div>
+<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span>        <span class="keywordtype">int</span> cls = std::rand() % num_classes;</div>
+<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span> </div>
+<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span>        <span class="comment">// create random coordinates (x,y,z) around the centre of the class</span></div>
+<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][0] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(centres[cls][0] - R, centres[cls][0] + R);</div>
+<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][1] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(centres[cls][1] - R, centres[cls][1] + R);</div>
+<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][2] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(centres[cls][2] - R, centres[cls][2] + R);</div>
+<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span> </div>
+<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>        <span class="comment">/* The follosing can also be used</span></div>
+<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span><span class="comment">        for (int j = 0; j &lt; 3; j++)</span></div>
+<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span><span class="comment">            data[i][j] = _random(centres[class][j] - R, centres[class][j] + R);</span></div>
+<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span><span class="comment">        */</span></div>
+<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>    }</div>
+<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>}</div>
+</div>
+<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span> </div>
+<div class="foldopen" id="foldopen00451" data-start="{" data-end="}">
+<div class="line"><a id="l00451" name="l00451"></a><span class="lineno"><a class="line" href="../../d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0">  451</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>() {</div>
+<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span>    <span class="keywordtype">int</span> j = 0, N = 300;</div>
+<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>    <span class="keywordtype">int</span> features = 3;</div>
+<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>    <span class="keywordtype">int</span> num_out = 30;</div>
+<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; X(N);</div>
+<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>    std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; W(num_out);</div>
+<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; std::max(num_out, N); i++) {</div>
+<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span>        <span class="comment">// loop till max(N, num_out)</span></div>
+<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span>        <span class="keywordflow">if</span> (i &lt; N) {  <span class="comment">// only add new arrays if i &lt; N</span></div>
+<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span>            X[i] = std::valarray&lt;double&gt;(features);</div>
+<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>        }</div>
+<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>        <span class="keywordflow">if</span> (i &lt; num_out) {  <span class="comment">// only add new arrays if i &lt; num_out</span></div>
+<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span>            W[i] = std::vector&lt;std::valarray&lt;double&gt;&gt;(num_out);</div>
+<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; k &lt; num_out; k++) {</div>
+<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span>                W[i][k] = std::valarray&lt;double&gt;(features);</div>
+<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span><span class="preprocessor">#pragma omp for</span></div>
+<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span>                <span class="keywordflow">for</span> (j = 0; j &lt; features; j++) {</div>
+<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span>                    <span class="comment">// preallocate with random initial weights</span></div>
+<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span>                    W[i][k][j] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(-10, 10);</div>
+<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>                }</div>
+<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span>            }</div>
+<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span>        }</div>
+<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span>    }</div>
+<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span> </div>
+<div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span>    <a class="code hl_function" href="../../d4/def/kohonen__som__topology_8cpp.html#a1302662a56ebf67a21249270b017297e">test_3d_classes1</a>(&amp;X);  <span class="comment">// create test data around circumference of a circle</span></div>
+<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>    <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c">save_2d_data</a>(<span class="stringliteral">&quot;test2.csv&quot;</span>, X);  <span class="comment">// save test data points</span></div>
+<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span>    save_u_matrix(<span class="stringliteral">&quot;w21.csv&quot;</span>, W);   <span class="comment">// save initial random weights</span></div>
+<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span>    kohonen_som(X, &amp;W, 1e-4);      <span class="comment">// train the SOM</span></div>
+<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span>    save_u_matrix(<span class="stringliteral">&quot;w22.csv&quot;</span>, W);   <span class="comment">// save the resultant weights</span></div>
+<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>}</div>
+</div>
+<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span> </div>
+<div class="foldopen" id="foldopen00493" data-start="{" data-end="}">
+<div class="line"><a id="l00493" name="l00493"></a><span class="lineno"><a class="line" href="../../d4/def/kohonen__som__topology_8cpp.html#a4b7ab643f6a5002f991837de46f70653">  493</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/def/kohonen__som__topology_8cpp.html#a4b7ab643f6a5002f991837de46f70653">test_3d_classes2</a>(std::vector&lt;std::valarray&lt;double&gt;&gt; *<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> N = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>-&gt;size();</div>
+<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> R = 0.2;  <span class="comment">// radius of cluster</span></div>
+<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span>    <span class="keywordtype">int</span> i = 0;</div>
+<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> num_classes = 8;</div>
+<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>    <span class="keyword">const</span> std::array&lt;std::array&lt;double, 3&gt;, num_classes&gt; centres = {</div>
+<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>        <span class="comment">// centres of each class cluster</span></div>
+<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span>        std::array&lt;double, 3&gt;({.5, .5, .5}),    <span class="comment">// centre of class 1</span></div>
+<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>        std::array&lt;double, 3&gt;({.5, .5, -.5}),   <span class="comment">// centre of class 2</span></div>
+<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span>        std::array&lt;double, 3&gt;({.5, -.5, .5}),   <span class="comment">// centre of class 3</span></div>
+<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>        std::array&lt;double, 3&gt;({.5, -.5, -.5}),  <span class="comment">// centre of class 4</span></div>
+<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span>        std::array&lt;double, 3&gt;({-.5, .5, .5}),   <span class="comment">// centre of class 5</span></div>
+<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span>        std::array&lt;double, 3&gt;({-.5, .5, -.5}),  <span class="comment">// centre of class 6</span></div>
+<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span>        std::array&lt;double, 3&gt;({-.5, -.5, .5}),  <span class="comment">// centre of class 7</span></div>
+<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span>        std::array&lt;double, 3&gt;({-.5, -.5, -.5})  <span class="comment">// centre of class 8</span></div>
+<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>    };</div>
+<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span> </div>
+<div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span><span class="preprocessor">#pragma omp for</span></div>
+<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span>    <span class="keywordflow">for</span> (i = 0; i &lt; N; i++) {</div>
+<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span>        <span class="comment">// select a random class for the point</span></div>
+<div class="line"><a id="l00515" name="l00515"></a><span class="lineno">  515</span>        <span class="keywordtype">int</span> cls = std::rand() % num_classes;</div>
+<div class="line"><a id="l00516" name="l00516"></a><span class="lineno">  516</span> </div>
+<div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span>        <span class="comment">// create random coordinates (x,y,z) around the centre of the class</span></div>
+<div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][0] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(centres[cls][0] - R, centres[cls][0] + R);</div>
+<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][1] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(centres[cls][1] - R, centres[cls][1] + R);</div>
+<div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][2] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(centres[cls][2] - R, centres[cls][2] + R);</div>
+<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span> </div>
+<div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span>        <span class="comment">/* The follosing can also be used</span></div>
+<div class="line"><a id="l00523" name="l00523"></a><span class="lineno">  523</span><span class="comment">        for (int j = 0; j &lt; 3; j++)</span></div>
+<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span><span class="comment">            data[i][j] = _random(centres[class][j] - R, centres[class][j] + R);</span></div>
+<div class="line"><a id="l00525" name="l00525"></a><span class="lineno">  525</span><span class="comment">        */</span></div>
+<div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span>    }</div>
+<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span>}</div>
+</div>
+<div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span> </div>
+<div class="foldopen" id="foldopen00537" data-start="{" data-end="}">
+<div class="line"><a id="l00537" name="l00537"></a><span class="lineno"><a class="line" href="../../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">  537</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a>() {</div>
+<div class="line"><a id="l00538" name="l00538"></a><span class="lineno">  538</span>    <span class="keywordtype">int</span> j = 0, N = 500;</div>
+<div class="line"><a id="l00539" name="l00539"></a><span class="lineno">  539</span>    <span class="keywordtype">int</span> features = 3;</div>
+<div class="line"><a id="l00540" name="l00540"></a><span class="lineno">  540</span>    <span class="keywordtype">int</span> num_out = 30;</div>
+<div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; X(N);</div>
+<div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span>    std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; W(num_out);</div>
+<div class="line"><a id="l00543" name="l00543"></a><span class="lineno">  543</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; std::max(num_out, N); i++) {</div>
+<div class="line"><a id="l00544" name="l00544"></a><span class="lineno">  544</span>        <span class="comment">// loop till max(N, num_out)</span></div>
+<div class="line"><a id="l00545" name="l00545"></a><span class="lineno">  545</span>        <span class="keywordflow">if</span> (i &lt; N) {  <span class="comment">// only add new arrays if i &lt; N</span></div>
+<div class="line"><a id="l00546" name="l00546"></a><span class="lineno">  546</span>            X[i] = std::valarray&lt;double&gt;(features);</div>
+<div class="line"><a id="l00547" name="l00547"></a><span class="lineno">  547</span>        }</div>
+<div class="line"><a id="l00548" name="l00548"></a><span class="lineno">  548</span>        <span class="keywordflow">if</span> (i &lt; num_out) {  <span class="comment">// only add new arrays if i &lt; num_out</span></div>
+<div class="line"><a id="l00549" name="l00549"></a><span class="lineno">  549</span>            W[i] = std::vector&lt;std::valarray&lt;double&gt;&gt;(num_out);</div>
+<div class="line"><a id="l00550" name="l00550"></a><span class="lineno">  550</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; k &lt; num_out; k++) {</div>
+<div class="line"><a id="l00551" name="l00551"></a><span class="lineno">  551</span>                W[i][k] = std::valarray&lt;double&gt;(features);</div>
+<div class="line"><a id="l00552" name="l00552"></a><span class="lineno">  552</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</span><span class="preprocessor">#pragma omp for</span></div>
+<div class="line"><a id="l00554" name="l00554"></a><span class="lineno">  554</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00555" name="l00555"></a><span class="lineno">  555</span>                <span class="keywordflow">for</span> (j = 0; j &lt; features; j++) {</div>
+<div class="line"><a id="l00556" name="l00556"></a><span class="lineno">  556</span>                    <span class="comment">// preallocate with random initial weights</span></div>
+<div class="line"><a id="l00557" name="l00557"></a><span class="lineno">  557</span>                    W[i][k][j] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(-10, 10);</div>
+<div class="line"><a id="l00558" name="l00558"></a><span class="lineno">  558</span>                }</div>
+<div class="line"><a id="l00559" name="l00559"></a><span class="lineno">  559</span>            }</div>
+<div class="line"><a id="l00560" name="l00560"></a><span class="lineno">  560</span>        }</div>
+<div class="line"><a id="l00561" name="l00561"></a><span class="lineno">  561</span>    }</div>
+<div class="line"><a id="l00562" name="l00562"></a><span class="lineno">  562</span> </div>
+<div class="line"><a id="l00563" name="l00563"></a><span class="lineno">  563</span>    <a class="code hl_function" href="../../d4/def/kohonen__som__topology_8cpp.html#a4b7ab643f6a5002f991837de46f70653">test_3d_classes2</a>(&amp;X);  <span class="comment">// create test data around circumference of a circle</span></div>
+<div class="line"><a id="l00564" name="l00564"></a><span class="lineno">  564</span>    <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c">save_2d_data</a>(<span class="stringliteral">&quot;test3.csv&quot;</span>, X);  <span class="comment">// save test data points</span></div>
+<div class="line"><a id="l00565" name="l00565"></a><span class="lineno">  565</span>    save_u_matrix(<span class="stringliteral">&quot;w31.csv&quot;</span>, W);   <span class="comment">// save initial random weights</span></div>
+<div class="line"><a id="l00566" name="l00566"></a><span class="lineno">  566</span>    kohonen_som(X, &amp;W, 1e-4);      <span class="comment">// train the SOM</span></div>
+<div class="line"><a id="l00567" name="l00567"></a><span class="lineno">  567</span>    save_u_matrix(<span class="stringliteral">&quot;w32.csv&quot;</span>, W);   <span class="comment">// save the resultant weights</span></div>
+<div class="line"><a id="l00568" name="l00568"></a><span class="lineno">  568</span>}</div>
+</div>
+<div class="line"><a id="l00569" name="l00569"></a><span class="lineno">  569</span> </div>
+<div class="foldopen" id="foldopen00577" data-start="{" data-end="}">
+<div class="line"><a id="l00577" name="l00577"></a><span class="lineno"><a class="line" href="../../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908">  577</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(clock_t start_t, clock_t end_t) {</div>
+<div class="line"><a id="l00578" name="l00578"></a><span class="lineno">  578</span>    <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end_t - start_t) / CLOCKS_PER_SEC;</div>
+<div class="line"><a id="l00579" name="l00579"></a><span class="lineno">  579</span>}</div>
+</div>
+<div class="line"><a id="l00580" name="l00580"></a><span class="lineno">  580</span> </div>
+<div class="foldopen" id="foldopen00582" data-start="{" data-end="}">
+<div class="line"><a id="l00582" name="l00582"></a><span class="lineno"><a class="line" href="../../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">  582</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> **argv) {</div>
+<div class="line"><a id="l00583" name="l00583"></a><span class="lineno">  583</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00584" name="l00584"></a><span class="lineno">  584</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Using OpenMP based parallelization\n&quot;</span>;</div>
+<div class="line"><a id="l00585" name="l00585"></a><span class="lineno">  585</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00586" name="l00586"></a><span class="lineno">  586</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;NOT using OpenMP based parallelization\n&quot;</span>;</div>
+<div class="line"><a id="l00587" name="l00587"></a><span class="lineno">  587</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00588" name="l00588"></a><span class="lineno">  588</span> </div>
+<div class="line"><a id="l00589" name="l00589"></a><span class="lineno">  589</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><a id="l00590" name="l00590"></a><span class="lineno">  590</span> </div>
+<div class="line"><a id="l00591" name="l00591"></a><span class="lineno">  591</span>    std::clock_t start_clk = std::clock();</div>
+<div class="line"><a id="l00592" name="l00592"></a><span class="lineno">  592</span>    <a class="code hl_function" href="../../d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();</div>
+<div class="line"><a id="l00593" name="l00593"></a><span class="lineno">  593</span>    <span class="keyword">auto</span> end_clk = std::clock();</div>
+<div class="line"><a id="l00594" name="l00594"></a><span class="lineno">  594</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 completed in &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(start_clk, end_clk)</div>
+<div class="line"><a id="l00595" name="l00595"></a><span class="lineno">  595</span>              &lt;&lt; <span class="stringliteral">&quot; sec\n&quot;</span>;</div>
+<div class="line"><a id="l00596" name="l00596"></a><span class="lineno">  596</span> </div>
+<div class="line"><a id="l00597" name="l00597"></a><span class="lineno">  597</span>    start_clk = std::clock();</div>
+<div class="line"><a id="l00598" name="l00598"></a><span class="lineno">  598</span>    <a class="code hl_function" href="../../d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>();</div>
+<div class="line"><a id="l00599" name="l00599"></a><span class="lineno">  599</span>    end_clk = std::clock();</div>
+<div class="line"><a id="l00600" name="l00600"></a><span class="lineno">  600</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 completed in &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(start_clk, end_clk)</div>
+<div class="line"><a id="l00601" name="l00601"></a><span class="lineno">  601</span>              &lt;&lt; <span class="stringliteral">&quot; sec\n&quot;</span>;</div>
+<div class="line"><a id="l00602" name="l00602"></a><span class="lineno">  602</span> </div>
+<div class="line"><a id="l00603" name="l00603"></a><span class="lineno">  603</span>    start_clk = std::clock();</div>
+<div class="line"><a id="l00604" name="l00604"></a><span class="lineno">  604</span>    <a class="code hl_function" href="../../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a>();</div>
+<div class="line"><a id="l00605" name="l00605"></a><span class="lineno">  605</span>    end_clk = std::clock();</div>
+<div class="line"><a id="l00606" name="l00606"></a><span class="lineno">  606</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 completed in &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(start_clk, end_clk)</div>
+<div class="line"><a id="l00607" name="l00607"></a><span class="lineno">  607</span>              &lt;&lt; <span class="stringliteral">&quot; sec\n&quot;</span>;</div>
+<div class="line"><a id="l00608" name="l00608"></a><span class="lineno">  608</span> </div>
+<div class="line"><a id="l00609" name="l00609"></a><span class="lineno">  609</span>    std::cout</div>
+<div class="line"><a id="l00610" name="l00610"></a><span class="lineno">  610</span>        &lt;&lt; <span class="stringliteral">&quot;(Note: Calculated times include: creating test sets, training &quot;</span></div>
+<div class="line"><a id="l00611" name="l00611"></a><span class="lineno">  611</span>           <span class="stringliteral">&quot;model and writing files to disk.)\n\n&quot;</span>;</div>
+<div class="line"><a id="l00612" name="l00612"></a><span class="lineno">  612</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00613" name="l00613"></a><span class="lineno">  613</span>}</div>
+</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="agroup__machine__learning_html_ga60f9186ccb682724a8792a2bf81e9b9e"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e">get_min_2d</a></div><div class="ttdeci">void get_min_2d(const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X, double *val, int *x_idx, int *y_idx)</div><div class="ttdef"><b>Definition</b> <a href="#l00105">kohonen_som_topology.cpp:105</a></div></div>
+<div class="ttc" id="agroup__machine__learning_html_gabc90175770bf0d5853c466e14993a08c"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c">save_2d_data</a></div><div class="ttdeci">int save_2d_data(const char *fname, const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</div><div class="ttdef"><b>Definition</b> <a href="#l00065">kohonen_som_topology.cpp:65</a></div></div>
+<div class="ttc" id="agroup__machine__learning_html_gaf5ce14f026d6d231bef29161bac2b485"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a></div><div class="ttdeci">double _random(double a, double b)</div><div class="ttdef"><b>Definition</b> <a href="#l00053">kohonen_som_topology.cpp:53</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="akohonen__som__topology_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> <a href="#l00451">kohonen_som_topology.cpp:451</a></div></div>
+<div class="ttc" id="akohonen__som__topology_8cpp_html_a1302662a56ebf67a21249270b017297e"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a1302662a56ebf67a21249270b017297e">test_3d_classes1</a></div><div class="ttdeci">void test_3d_classes1(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> <a href="#l00411">kohonen_som_topology.cpp:411</a></div></div>
+<div class="ttc" id="akohonen__som__topology_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition</b> <a href="#l00369">kohonen_som_topology.cpp:369</a></div></div>
+<div class="ttc" id="akohonen__som__topology_8cpp_html_a2256c10b16edba377b64a44b6c656908"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a></div><div class="ttdeci">double get_clock_diff(clock_t start_t, clock_t end_t)</div><div class="ttdef"><b>Definition</b> <a href="#l00577">kohonen_som_topology.cpp:577</a></div></div>
+<div class="ttc" id="akohonen__som__topology_8cpp_html_a48efb079040c7aaa3a4917a0e486cba9"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a48efb079040c7aaa3a4917a0e486cba9">test_2d_classes</a></div><div class="ttdeci">void test_2d_classes(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> <a href="#l00330">kohonen_som_topology.cpp:330</a></div></div>
+<div class="ttc" id="akohonen__som__topology_8cpp_html_a4b7ab643f6a5002f991837de46f70653"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a4b7ab643f6a5002f991837de46f70653">test_3d_classes2</a></div><div class="ttdeci">void test_3d_classes2(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> <a href="#l00493">kohonen_som_topology.cpp:493</a></div></div>
+<div class="ttc" id="akohonen__som__topology_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition</b> <a href="#l00537">kohonen_som_topology.cpp:537</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></div><div class="ttdoc">A* search algorithm</div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00232">vector_ops.hpp:232</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a7220dbb7fa896d83bfb7a50e4fce1786"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a7220dbb7fa896d83bfb7a50e4fce1786">machine_learning::MIN_DISTANCE</a></div><div class="ttdeci">constexpr double MIN_DISTANCE</div><div class="ttdef"><b>Definition</b> <a href="#l00129">kohonen_som_topology.cpp:129</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_aa72a53c88203fde278f1fe6c3afe5b07"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#aa72a53c88203fde278f1fe6c3afe5b07">machine_learning::save_u_matrix</a></div><div class="ttdeci">int save_u_matrix(const char *fname, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;W)</div><div class="ttdef"><b>Definition</b> <a href="#l00142">kohonen_som_topology.cpp:142</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_ac43d294e21a0c4fa33c53757df054576"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576">machine_learning::kohonen_som</a></div><div class="ttdeci">void kohonen_som(const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; *W, double alpha_min)</div><div class="ttdef"><b>Definition</b> <a href="#l00269">kohonen_som_topology.cpp:269</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_ae868ad43698a1d69ba46ea3827d7d2c3"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3">machine_learning::update_weights</a></div><div class="ttdeci">double update_weights(const std::valarray&lt; double &gt; &amp;X, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; *W, std::vector&lt; std::valarray&lt; double &gt; &gt; *D, double alpha, int R)</div><div class="ttdef"><b>Definition</b> <a href="#l00200">kohonen_som_topology.cpp:200</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_3343723ae086de42ee4ca9774da3a13f.html">machine_learning</a></li><li class="navelem"><a class="el" href="../../d4/def/kohonen__som__topology_8cpp.html">kohonen_som_topology.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/def/longest__common__subsequence_8cpp_source.html b/d4/def/longest__common__subsequence_8cpp_source.html
new file mode 100644
index 000000000..73278c208
--- /dev/null
+++ b/d4/def/longest__common__subsequence_8cpp_source.html
@@ -0,0 +1,204 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/longest_common_subsequence.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d4/def/longest__common__subsequence_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">longest_common_subsequence.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">// Longest common subsequence - Dynamic Programming</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="keywordtype">void</span> Print(<span class="keywordtype">int</span> trace[20][20], <span class="keywordtype">int</span> m, <span class="keywordtype">int</span> n, <span class="keywordtype">string</span> a) {</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span>    <span class="keywordflow">if</span> (m == 0 || n == 0) {</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    }</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    <span class="keywordflow">if</span> (trace[m][n] == 1) {</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>        Print(trace, m - 1, n - 1, a);</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>        cout &lt;&lt; a[m - 1];</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (trace[m][n] == 2) {</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>        Print(trace, m - 1, n, a);</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (trace[m][n] == 3) {</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>        Print(trace, m, n - 1, a);</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    }</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>}</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="keywordtype">int</span> lcs(<span class="keywordtype">string</span> a, <span class="keywordtype">string</span> b) {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keywordtype">int</span> m = a.length(), n = b.length();</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    std::vector&lt;std::vector&lt;int&gt; &gt; res(m + 1, std::vector&lt;int&gt;(n + 1));</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    <span class="keywordtype">int</span> trace[20][20];</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="comment">// fills up the arrays with zeros.</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; m + 1; i++) {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n + 1; j++) {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>            res[i][j] = 0;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>            trace[i][j] = 0;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        }</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    }</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; m + 1; ++i) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n + 1; ++j) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>            <span class="keywordflow">if</span> (i == 0 || j == 0) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>                res[i][j] = 0;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>                trace[i][j] = 0;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>            }</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (a[i - 1] == b[j - 1]) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>                res[i][j] = 1 + res[i - 1][j - 1];</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>                trace[i][j] = 1;  <span class="comment">// 1 means trace the matrix in upper left</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>                                  <span class="comment">// diagonal direction.</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>                <span class="keywordflow">if</span> (res[i - 1][j] &gt; res[i][j - 1]) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>                    res[i][j] = res[i - 1][j];</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>                    trace[i][j] =</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>                        2;  <span class="comment">// 2 means trace the matrix in upwards direction.</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>                } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>                    res[i][j] = res[i][j - 1];</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>                    trace[i][j] =</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>                        3;  <span class="comment">//  means trace the matrix in left direction.</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>                }</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    Print(trace, m, n, a);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordflow">return</span> res[m][n];</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>}</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordtype">string</span> a, b;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    cin &gt;&gt; a &gt;&gt; b;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    cout &lt;&lt; lcs(a, b);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><b>longest_common_subsequence.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html
index 3e648c295..b05cab0a5 100644
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html
+++ b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: machine_learning::neural_network::NeuralNetwork Class Reference</title>
+<title>TheAlgorithms/C++: machine_learning::neural_network::NeuralNetwork Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,7 @@ Collaboration diagram for machine_learning::neural_network::NeuralNetwork:</div>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:ae7cf126a3a8f9d20c81b21584d061a08" id="r_ae7cf126a3a8f9d20c81b21584d061a08"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae7cf126a3a8f9d20c81b21584d061a08">NeuralNetwork</a> ()=default</td></tr>
 <tr class="separator:ae7cf126a3a8f9d20c81b21584d061a08"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a62151b0398a2536be60d950e10ffe9a8" id="r_a62151b0398a2536be60d950e10ffe9a8"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a62151b0398a2536be60d950e10ffe9a8">NeuralNetwork</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &gt; &amp;config)</td></tr>
+<tr class="memitem:a62151b0398a2536be60d950e10ffe9a8" id="r_a62151b0398a2536be60d950e10ffe9a8"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a62151b0398a2536be60d950e10ffe9a8">NeuralNetwork</a> (const std::vector&lt; std::pair&lt; int, std::string &gt; &gt; &amp;config)</td></tr>
 <tr class="separator:a62151b0398a2536be60d950e10ffe9a8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a176b955c90ae57d7dbc3c63f27c84c75" id="r_a176b955c90ae57d7dbc3c63f27c84c75"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a176b955c90ae57d7dbc3c63f27c84c75">NeuralNetwork</a> (const <a class="el" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> &amp;model)=default</td></tr>
 <tr class="separator:a176b955c90ae57d7dbc3c63f27c84c75"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -134,42 +151,43 @@ Public Member Functions</h2></td></tr>
 <tr class="separator:a173bb71780af6953ec2e307a4c74b025"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a2c49bfebf9b859d5ceb26035d3003601" id="r_a2c49bfebf9b859d5ceb26035d3003601"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2c49bfebf9b859d5ceb26035d3003601">operator=</a> (<a class="el" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> &amp;&amp;)=default</td></tr>
 <tr class="separator:a2c49bfebf9b859d5ceb26035d3003601"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a650c677fd6512665741ddd9b7983275d" id="r_a650c677fd6512665741ddd9b7983275d"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt;, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a650c677fd6512665741ddd9b7983275d">get_XY_from_csv</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;file_name, const bool &amp;last_label, const bool &amp;normalize, const int &amp;slip_lines=1)</td></tr>
+<tr class="memitem:a650c677fd6512665741ddd9b7983275d" id="r_a650c677fd6512665741ddd9b7983275d"><td class="memItemLeft" align="right" valign="top">std::pair&lt; std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt;, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a650c677fd6512665741ddd9b7983275d">get_XY_from_csv</a> (const std::string &amp;file_name, const bool &amp;last_label, const bool &amp;normalize, const int &amp;slip_lines=1)</td></tr>
 <tr class="separator:a650c677fd6512665741ddd9b7983275d"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a3b9eac1824d365dce715fb17c33cb96f" id="r_a3b9eac1824d365dce715fb17c33cb96f"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3b9eac1824d365dce715fb17c33cb96f">single_predict</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;X)</td></tr>
+<tr class="memitem:a3b9eac1824d365dce715fb17c33cb96f" id="r_a3b9eac1824d365dce715fb17c33cb96f"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::valarray&lt; double &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3b9eac1824d365dce715fb17c33cb96f">single_predict</a> (const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</td></tr>
 <tr class="separator:a3b9eac1824d365dce715fb17c33cb96f"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a88bf9023ab3d4cdb61cf707c7cdfc86b" id="r_a88bf9023ab3d4cdb61cf707c7cdfc86b"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a88bf9023ab3d4cdb61cf707c7cdfc86b">batch_predict</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &amp;X)</td></tr>
+<tr class="memitem:a88bf9023ab3d4cdb61cf707c7cdfc86b" id="r_a88bf9023ab3d4cdb61cf707c7cdfc86b"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a88bf9023ab3d4cdb61cf707c7cdfc86b">batch_predict</a> (const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;X)</td></tr>
 <tr class="separator:a88bf9023ab3d4cdb61cf707c7cdfc86b"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2be1b52bb9f57486f9a436f35c9089c0" id="r_a2be1b52bb9f57486f9a436f35c9089c0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2be1b52bb9f57486f9a436f35c9089c0">fit</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &amp;X_, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &amp;Y_, const int &amp;epochs=100, const double &amp;learning_rate=0.01, const size_t &amp;batch_size=32, const bool &amp;shuffle=true)</td></tr>
+<tr class="memitem:a2be1b52bb9f57486f9a436f35c9089c0" id="r_a2be1b52bb9f57486f9a436f35c9089c0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2be1b52bb9f57486f9a436f35c9089c0">fit</a> (const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;X_, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;Y_, const int &amp;epochs=100, const double &amp;learning_rate=0.01, const size_t &amp;batch_size=32, const bool &amp;shuffle=true)</td></tr>
 <tr class="separator:a2be1b52bb9f57486f9a436f35c9089c0"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a5172a6791b9bd24f4232bab8d6b81fff" id="r_a5172a6791b9bd24f4232bab8d6b81fff"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5172a6791b9bd24f4232bab8d6b81fff">fit_from_csv</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;file_name, const bool &amp;last_label, const int &amp;epochs, const double &amp;learning_rate, const bool &amp;normalize, const int &amp;slip_lines=1, const size_t &amp;batch_size=32, const bool &amp;shuffle=true)</td></tr>
+<tr class="memitem:a5172a6791b9bd24f4232bab8d6b81fff" id="r_a5172a6791b9bd24f4232bab8d6b81fff"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5172a6791b9bd24f4232bab8d6b81fff">fit_from_csv</a> (const std::string &amp;file_name, const bool &amp;last_label, const int &amp;epochs, const double &amp;learning_rate, const bool &amp;normalize, const int &amp;slip_lines=1, const size_t &amp;batch_size=32, const bool &amp;shuffle=true)</td></tr>
 <tr class="separator:a5172a6791b9bd24f4232bab8d6b81fff"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aec648ea4f40bd71123b5f907a681dd8e" id="r_aec648ea4f40bd71123b5f907a681dd8e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aec648ea4f40bd71123b5f907a681dd8e">evaluate</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &amp;X, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &amp;Y)</td></tr>
+<tr class="memitem:aec648ea4f40bd71123b5f907a681dd8e" id="r_aec648ea4f40bd71123b5f907a681dd8e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aec648ea4f40bd71123b5f907a681dd8e">evaluate</a> (const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;X, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;Y)</td></tr>
 <tr class="separator:aec648ea4f40bd71123b5f907a681dd8e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a36494e26ff36d6e15c1022bb9a1ee848" id="r_a36494e26ff36d6e15c1022bb9a1ee848"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a36494e26ff36d6e15c1022bb9a1ee848">evaluate_from_csv</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;file_name, const bool &amp;last_label, const bool &amp;normalize, const int &amp;slip_lines=1)</td></tr>
+<tr class="memitem:a36494e26ff36d6e15c1022bb9a1ee848" id="r_a36494e26ff36d6e15c1022bb9a1ee848"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a36494e26ff36d6e15c1022bb9a1ee848">evaluate_from_csv</a> (const std::string &amp;file_name, const bool &amp;last_label, const bool &amp;normalize, const int &amp;slip_lines=1)</td></tr>
 <tr class="separator:a36494e26ff36d6e15c1022bb9a1ee848"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a4f14e473bb0722c6490b9dc8da5982aa" id="r_a4f14e473bb0722c6490b9dc8da5982aa"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4f14e473bb0722c6490b9dc8da5982aa">save_model</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;_file_name)</td></tr>
+<tr class="memitem:a4f14e473bb0722c6490b9dc8da5982aa" id="r_a4f14e473bb0722c6490b9dc8da5982aa"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4f14e473bb0722c6490b9dc8da5982aa">save_model</a> (const std::string &amp;_file_name)</td></tr>
 <tr class="separator:a4f14e473bb0722c6490b9dc8da5982aa"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a58ed20abf6ce3744535bd8b5bb9e741b" id="r_a58ed20abf6ce3744535bd8b5bb9e741b"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a58ed20abf6ce3744535bd8b5bb9e741b">load_model</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;file_name)</td></tr>
+<tr class="memitem:a58ed20abf6ce3744535bd8b5bb9e741b" id="r_a58ed20abf6ce3744535bd8b5bb9e741b"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a58ed20abf6ce3744535bd8b5bb9e741b">load_model</a> (const std::string &amp;file_name)</td></tr>
 <tr class="separator:a58ed20abf6ce3744535bd8b5bb9e741b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a61d30113d13304c664057118b92a5931" id="r_a61d30113d13304c664057118b92a5931"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a61d30113d13304c664057118b92a5931">summary</a> ()</td></tr>
 <tr class="separator:a61d30113d13304c664057118b92a5931"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
 Private Member Functions</h2></td></tr>
-<tr class="memitem:a4c4c6f63ab965317f9471518ee931b89" id="r_a4c4c6f63ab965317f9471518ee931b89"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4c4c6f63ab965317f9471518ee931b89">NeuralNetwork</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &gt; &amp;config, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &amp;kernels)</td></tr>
+<tr class="memitem:a4c4c6f63ab965317f9471518ee931b89" id="r_a4c4c6f63ab965317f9471518ee931b89"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4c4c6f63ab965317f9471518ee931b89">NeuralNetwork</a> (const std::vector&lt; std::pair&lt; int, std::string &gt; &gt; &amp;config, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;kernels)</td></tr>
 <tr class="separator:a4c4c6f63ab965317f9471518ee931b89"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a361a45f3c3d8347d79103bf182d0570b" id="r_a361a45f3c3d8347d79103bf182d0570b"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a361a45f3c3d8347d79103bf182d0570b">__detailed_single_prediction</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;X)</td></tr>
+<tr class="memitem:a361a45f3c3d8347d79103bf182d0570b" id="r_a361a45f3c3d8347d79103bf182d0570b"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a361a45f3c3d8347d79103bf182d0570b">__detailed_single_prediction</a> (const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</td></tr>
 <tr class="separator:a361a45f3c3d8347d79103bf182d0570b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a8c5a466131aa2ae6b7276185b0834053" id="r_a8c5a466131aa2ae6b7276185b0834053"><td class="memItemLeft" align="right" valign="top"><a id="a8c5a466131aa2ae6b7276185b0834053" name="a8c5a466131aa2ae6b7276185b0834053"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">neural_network::layers::DenseLayer</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>layers</b></td></tr>
+<tr class="memitem:a8c5a466131aa2ae6b7276185b0834053" id="r_a8c5a466131aa2ae6b7276185b0834053"><td class="memItemLeft" align="right" valign="top">std::vector&lt; <a class="el" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">neural_network::layers::DenseLayer</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8c5a466131aa2ae6b7276185b0834053">layers</a></td></tr>
 <tr class="separator:a8c5a466131aa2ae6b7276185b0834053"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a class="el" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> class is implements MLP. This class is used by actual user to create and train networks. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00247">247</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a4c4c6f63ab965317f9471518ee931b89" name="a4c4c6f63ab965317f9471518ee931b89"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a4c4c6f63ab965317f9471518ee931b89">&#9670;&#160;</a></span>NeuralNetwork() <span class="overload">[1/5]</span></h2>
@@ -183,12 +201,12 @@ Private Attributes</h2></td></tr>
         <tr>
           <td class="memname">machine_learning::neural_network::NeuralNetwork::NeuralNetwork </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>config</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::pair&lt; int, std::string &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>config</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>kernels</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>kernels</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -204,42 +222,34 @@ Private Attributes</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00256">256</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  258</span>                                                                  {</div>
 <div class="line"><span class="lineno">  259</span>        <span class="comment">// First layer should not have activation</span></div>
-<div class="line"><span class="lineno">  260</span>        <span class="keywordflow">if</span> (config.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>()-&gt;second != <span class="stringliteral">&quot;none&quot;</span>) {</div>
-<div class="line"><span class="lineno">  261</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><span class="lineno">  262</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div>
+<div class="line"><span class="lineno">  260</span>        <span class="keywordflow">if</span> (config.begin()-&gt;second != <span class="stringliteral">&quot;none&quot;</span>) {</div>
+<div class="line"><span class="lineno">  261</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><span class="lineno">  262</span>            std::cerr</div>
 <div class="line"><span class="lineno">  263</span>                &lt;&lt; <span class="stringliteral">&quot;First layer can&#39;t have activation other than none got &quot;</span></div>
-<div class="line"><span class="lineno">  264</span>                &lt;&lt; config.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>()-&gt;second;</div>
-<div class="line"><span class="lineno">  265</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <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">  266</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  264</span>                &lt;&lt; config.begin()-&gt;second;</div>
+<div class="line"><span class="lineno">  265</span>            std::cerr &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  266</span>            std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  267</span>        }</div>
 <div class="line"><span class="lineno">  268</span>        <span class="comment">// Network should have atleast two layers</span></div>
-<div class="line"><span class="lineno">  269</span>        <span class="keywordflow">if</span> (config.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() &lt;= 1) {</div>
-<div class="line"><span class="lineno">  270</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><span class="lineno">  271</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Invalid size of network, &quot;</span>;</div>
-<div class="line"><span class="lineno">  272</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Atleast two layers are required&quot;</span>;</div>
-<div class="line"><span class="lineno">  273</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  269</span>        <span class="keywordflow">if</span> (config.size() &lt;= 1) {</div>
+<div class="line"><span class="lineno">  270</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><span class="lineno">  271</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Invalid size of network, &quot;</span>;</div>
+<div class="line"><span class="lineno">  272</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Atleast two layers are required&quot;</span>;</div>
+<div class="line"><span class="lineno">  273</span>            std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  274</span>        }</div>
 <div class="line"><span class="lineno">  275</span>        <span class="comment">// Reconstructing all pretrained layers</span></div>
-<div class="line"><span class="lineno">  276</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; config.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
+<div class="line"><span class="lineno">  276</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; config.size(); i++) {</div>
 <div class="line"><span class="lineno">  277</span>            <a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>.emplace_back(neural_network::layers::DenseLayer(</div>
 <div class="line"><span class="lineno">  278</span>                config[i].first, config[i].second, kernels[i]));</div>
 <div class="line"><span class="lineno">  279</span>        }</div>
-<div class="line"><span class="lineno">  280</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;INFO: Network constructed successfully&quot;</span> &lt;&lt; <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">  280</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;INFO: Network constructed successfully&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  281</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::cerr</a></div></div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</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="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
 <div class="ttc" id="anamespacelayers_html"><div class="ttname"><a href="../../d5/d2c/namespacelayers.html">layers</a></div><div class="ttdoc">This namespace contains layers used in MLP.</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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4c6f63ab965317f9471518ee931b89_cgraph.svg" width="300" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae7cf126a3a8f9d20c81b21584d061a08" name="ae7cf126a3a8f9d20c81b21584d061a08"></a>
@@ -280,7 +290,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">machine_learning::neural_network::NeuralNetwork::NeuralNetwork </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>config</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; std::pair&lt; int, std::string &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>config</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -296,22 +306,24 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00313">313</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  314</span>                                                          {</div>
 <div class="line"><span class="lineno">  315</span>        <span class="comment">// First layer should not have activation</span></div>
-<div class="line"><span class="lineno">  316</span>        <span class="keywordflow">if</span> (config.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>()-&gt;second != <span class="stringliteral">&quot;none&quot;</span>) {</div>
-<div class="line"><span class="lineno">  317</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><span class="lineno">  318</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div>
+<div class="line"><span class="lineno">  316</span>        <span class="keywordflow">if</span> (config.begin()-&gt;second != <span class="stringliteral">&quot;none&quot;</span>) {</div>
+<div class="line"><span class="lineno">  317</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><span class="lineno">  318</span>            std::cerr</div>
 <div class="line"><span class="lineno">  319</span>                &lt;&lt; <span class="stringliteral">&quot;First layer can&#39;t have activation other than none got &quot;</span></div>
-<div class="line"><span class="lineno">  320</span>                &lt;&lt; config.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>()-&gt;second;</div>
-<div class="line"><span class="lineno">  321</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <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">  322</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  320</span>                &lt;&lt; config.begin()-&gt;second;</div>
+<div class="line"><span class="lineno">  321</span>            std::cerr &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  322</span>            std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  323</span>        }</div>
 <div class="line"><span class="lineno">  324</span>        <span class="comment">// Network should have atleast two layers</span></div>
-<div class="line"><span class="lineno">  325</span>        <span class="keywordflow">if</span> (config.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() &lt;= 1) {</div>
-<div class="line"><span class="lineno">  326</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><span class="lineno">  327</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Invalid size of network, &quot;</span>;</div>
-<div class="line"><span class="lineno">  328</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Atleast two layers are required&quot;</span>;</div>
-<div class="line"><span class="lineno">  329</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  325</span>        <span class="keywordflow">if</span> (config.size() &lt;= 1) {</div>
+<div class="line"><span class="lineno">  326</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><span class="lineno">  327</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Invalid size of network, &quot;</span>;</div>
+<div class="line"><span class="lineno">  328</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Atleast two layers are required&quot;</span>;</div>
+<div class="line"><span class="lineno">  329</span>            std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  330</span>        }</div>
 <div class="line"><span class="lineno">  331</span>        <span class="comment">// Separately creating first layer so it can have unit matrix</span></div>
 <div class="line"><span class="lineno">  332</span>        <span class="comment">// as kernel.</span></div>
@@ -319,19 +331,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  334</span>            config[0].first, config[0].second,</div>
 <div class="line"><span class="lineno">  335</span>            {config[0].first, config[0].first}, <span class="keyword">false</span>));</div>
 <div class="line"><span class="lineno">  336</span>        <span class="comment">// Creating remaining layers</span></div>
-<div class="line"><span class="lineno">  337</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 1; i &lt; config.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
+<div class="line"><span class="lineno">  337</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 1; i &lt; config.size(); i++) {</div>
 <div class="line"><span class="lineno">  338</span>            <a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>.push_back(neural_network::layers::DenseLayer(</div>
 <div class="line"><span class="lineno">  339</span>                config[i].first, config[i].second,</div>
 <div class="line"><span class="lineno">  340</span>                {config[i - 1].first, config[i].first}, <span class="keyword">true</span>));</div>
 <div class="line"><span class="lineno">  341</span>        }</div>
-<div class="line"><span class="lineno">  342</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;INFO: Network constructed successfully&quot;</span> &lt;&lt; <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">  342</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;INFO: Network constructed successfully&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  343</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a62151b0398a2536be60d950e10ffe9a8_cgraph.svg" width="300" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a176b955c90ae57d7dbc3c63f27c84c75" name="a176b955c90ae57d7dbc3c63f27c84c75"></a>
@@ -429,9 +436,9 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; machine_learning::neural_network::NeuralNetwork::__detailed_single_prediction </td>
+          <td class="memname">std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; machine_learning::neural_network::NeuralNetwork::__detailed_single_prediction </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -447,28 +454,23 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00289">289</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  289</span>                                                                          {</div>
-<div class="line"><span class="lineno">  290</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;</a>&gt;&gt; details;</div>
-<div class="line"><span class="lineno">  291</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; current_pass = X;</div>
-<div class="line"><span class="lineno">  292</span>        details.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(X);</div>
+<div class="line"><span class="lineno">  290</span>        std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; details;</div>
+<div class="line"><span class="lineno">  291</span>        std::vector&lt;std::valarray&lt;double&gt;&gt; current_pass = X;</div>
+<div class="line"><span class="lineno">  292</span>        details.emplace_back(X);</div>
 <div class="line"><span class="lineno">  293</span>        <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;l : <a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>) {</div>
 <div class="line"><span class="lineno">  294</span>            current_pass = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9">multiply</a>(current_pass, <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>.kernel);</div>
 <div class="line"><span class="lineno">  295</span>            current_pass = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">apply_function</a>(current_pass, <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>.activation_function);</div>
-<div class="line"><span class="lineno">  296</span>            details.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(current_pass);</div>
+<div class="line"><span class="lineno">  296</span>            details.emplace_back(current_pass);</div>
 <div class="line"><span class="lineno">  297</span>        }</div>
 <div class="line"><span class="lineno">  298</span>        <span class="keywordflow">return</span> details;</div>
 <div class="line"><span class="lineno">  299</span>    }</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:119</div></div>
-<div class="ttc" id="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a5342906d42b80fc6b6b3ad17bf00fcb9"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9">machine_learning::multiply</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; multiply(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:460</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_ad0bdc88e5f1be47c46c0f0c8ebf754bb"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">machine_learning::apply_function</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; apply_function(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, T(*func)(const T &amp;))</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:329</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>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a361a45f3c3d8347d79103bf182d0570b_cgraph.svg" width="100%" height="472"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00119">composite_simpson_rule.cpp:119</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a5342906d42b80fc6b6b3ad17bf00fcb9"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9">machine_learning::multiply</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; multiply(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00460">vector_ops.hpp:460</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_ad0bdc88e5f1be47c46c0f0c8ebf754bb"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">machine_learning::apply_function</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; apply_function(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, T(*func)(const T &amp;))</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00329">vector_ops.hpp:329</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a88bf9023ab3d4cdb61cf707c7cdfc86b" name="a88bf9023ab3d4cdb61cf707c7cdfc86b"></a>
@@ -481,9 +483,9 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; machine_learning::neural_network::NeuralNetwork::batch_predict </td>
+          <td class="memname">std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; machine_learning::neural_network::NeuralNetwork::batch_predict </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -500,23 +502,20 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>returns predicted values as vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00464">464</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  465</span>                                                            {</div>
 <div class="line"><span class="lineno">  466</span>        <span class="comment">// Store predicted values</span></div>
-<div class="line"><span class="lineno">  467</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;</a>&gt;&gt; predicted_batch(</div>
-<div class="line"><span class="lineno">  468</span>            X.<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">  469</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; X.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {  <span class="comment">// For every sample</span></div>
+<div class="line"><span class="lineno">  467</span>        std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; predicted_batch(</div>
+<div class="line"><span class="lineno">  468</span>            X.size());</div>
+<div class="line"><span class="lineno">  469</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; X.size(); i++) {  <span class="comment">// For every sample</span></div>
 <div class="line"><span class="lineno">  470</span>            <span class="comment">// Push predicted values</span></div>
 <div class="line"><span class="lineno">  471</span>            predicted_batch[i] = this-&gt;<a class="code hl_function" href="#a3b9eac1824d365dce715fb17c33cb96f">single_predict</a>(X[i]);</div>
 <div class="line"><span class="lineno">  472</span>        }</div>
 <div class="line"><span class="lineno">  473</span>        <span class="keywordflow">return</span> predicted_batch;  <span class="comment">// Return predicted values</span></div>
 <div class="line"><span class="lineno">  474</span>    }</div>
-<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a3b9eac1824d365dce715fb17c33cb96f"><div class="ttname"><a href="#a3b9eac1824d365dce715fb17c33cb96f">machine_learning::neural_network::NeuralNetwork::single_predict</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; double &gt; &gt; single_predict(const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</div><div class="ttdef"><b>Definition</b> neural_network.cpp:451</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph.svg" width="100%" height="472"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a3b9eac1824d365dce715fb17c33cb96f"><div class="ttname"><a href="#a3b9eac1824d365dce715fb17c33cb96f">machine_learning::neural_network::NeuralNetwork::single_predict</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; double &gt; &gt; single_predict(const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d58/neural__network_8cpp_source.html#l00451">neural_network.cpp:451</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aec648ea4f40bd71123b5f907a681dd8e" name="aec648ea4f40bd71123b5f907a681dd8e"></a>
@@ -531,12 +530,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void machine_learning::neural_network::NeuralNetwork::evaluate </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>Y</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>Y</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -552,12 +551,14 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00606">606</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  607</span>                                                                      {</div>
-<div class="line"><span class="lineno">  608</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;INFO: Evaluation Started&quot;</span> &lt;&lt; <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">  608</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;INFO: Evaluation Started&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  609</span>        <span class="keywordtype">double</span> acc = 0, loss = 0;  <span class="comment">// initialize performance metrics with zero</span></div>
-<div class="line"><span class="lineno">  610</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; X.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {  <span class="comment">// For every sample in input</span></div>
+<div class="line"><span class="lineno">  610</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; X.size(); i++) {  <span class="comment">// For every sample in input</span></div>
 <div class="line"><span class="lineno">  611</span>            <span class="comment">// Get predictions</span></div>
-<div class="line"><span class="lineno">  612</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; pred =</div>
+<div class="line"><span class="lineno">  612</span>            std::vector&lt;std::valarray&lt;double&gt;&gt; pred =</div>
 <div class="line"><span class="lineno">  613</span>                this-&gt;<a class="code hl_function" href="#a3b9eac1824d365dce715fb17c33cb96f">single_predict</a>(X[i]);</div>
 <div class="line"><span class="lineno">  614</span>            <span class="comment">// If predicted class is correct</span></div>
 <div class="line"><span class="lineno">  615</span>            <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">argmax</a>(pred) == <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">argmax</a>(Y[i])) {</div>
@@ -568,21 +569,16 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  620</span>                                       neural_network::util_functions::square) *</div>
 <div class="line"><span class="lineno">  621</span>                        0.5);</div>
 <div class="line"><span class="lineno">  622</span>        }</div>
-<div class="line"><span class="lineno">  623</span>        acc /= X.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();   <span class="comment">// Averaging accuracy</span></div>
-<div class="line"><span class="lineno">  624</span>        loss /= X.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();  <span class="comment">// Averaging loss</span></div>
+<div class="line"><span class="lineno">  623</span>        acc /= X.size();   <span class="comment">// Averaging accuracy</span></div>
+<div class="line"><span class="lineno">  624</span>        loss /= X.size();  <span class="comment">// Averaging loss</span></div>
 <div class="line"><span class="lineno">  625</span>        <span class="comment">// Prinitng performance of the model</span></div>
-<div class="line"><span class="lineno">  626</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Evaluation: Loss: &quot;</span> &lt;&lt; loss;</div>
-<div class="line"><span class="lineno">  627</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;, Accuracy: &quot;</span> &lt;&lt; acc &lt;&lt; <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">  626</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Evaluation: Loss: &quot;</span> &lt;&lt; loss;</div>
+<div class="line"><span class="lineno">  627</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;, Accuracy: &quot;</span> &lt;&lt; acc &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  628</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  629</span>    }</div>
-<div class="ttc" id="anamespacemachine__learning_html_a50480fccfb39de20ca47f1bf51ecb6ec"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">machine_learning::argmax</a></div><div class="ttdeci">size_t argmax(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:307</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;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>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="anamespacemachine__learning_html_a50480fccfb39de20ca47f1bf51ecb6ec"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">machine_learning::argmax</a></div><div class="ttdeci">size_t argmax(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00307">vector_ops.hpp:307</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00232">vector_ops.hpp:232</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a36494e26ff36d6e15c1022bb9a1ee848" name="a36494e26ff36d6e15c1022bb9a1ee848"></a>
@@ -597,7 +593,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void machine_learning::neural_network::NeuralNetwork::evaluate_from_csv </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>file_name</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>file_name</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -630,6 +626,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00638">638</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  639</span>                                                                             {</div>
 <div class="line"><span class="lineno">  640</span>        <span class="comment">// Getting training data from csv file</span></div>
 <div class="line"><span class="lineno">  641</span>        <span class="keyword">auto</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> =</div>
@@ -638,15 +636,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  644</span>        this-&gt;<a class="code hl_function" href="#aec648ea4f40bd71123b5f907a681dd8e">evaluate</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>.first, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>.second);</div>
 <div class="line"><span class="lineno">  645</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  646</span>    }</div>
-<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a650c677fd6512665741ddd9b7983275d"><div class="ttname"><a href="#a650c677fd6512665741ddd9b7983275d">machine_learning::neural_network::NeuralNetwork::get_XY_from_csv</a></div><div class="ttdeci">std::pair&lt; std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt;, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &gt; get_XY_from_csv(const std::string &amp;file_name, const bool &amp;last_label, const bool &amp;normalize, const int &amp;slip_lines=1)</div><div class="ttdef"><b>Definition</b> neural_network.cpp:382</div></div>
-<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_aec648ea4f40bd71123b5f907a681dd8e"><div class="ttname"><a href="#aec648ea4f40bd71123b5f907a681dd8e">machine_learning::neural_network::NeuralNetwork::evaluate</a></div><div class="ttdeci">void evaluate(const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;X, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;Y)</div><div class="ttdef"><b>Definition</b> neural_network.cpp:606</div></div>
-<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a650c677fd6512665741ddd9b7983275d"><div class="ttname"><a href="#a650c677fd6512665741ddd9b7983275d">machine_learning::neural_network::NeuralNetwork::get_XY_from_csv</a></div><div class="ttdeci">std::pair&lt; std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt;, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &gt; get_XY_from_csv(const std::string &amp;file_name, const bool &amp;last_label, const bool &amp;normalize, const int &amp;slip_lines=1)</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d58/neural__network_8cpp_source.html#l00382">neural_network.cpp:382</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_aec648ea4f40bd71123b5f907a681dd8e"><div class="ttname"><a href="#aec648ea4f40bd71123b5f907a681dd8e">machine_learning::neural_network::NeuralNetwork::evaluate</a></div><div class="ttdeci">void evaluate(const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;X, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;Y)</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d58/neural__network_8cpp_source.html#l00606">neural_network.cpp:606</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2be1b52bb9f57486f9a436f35c9089c0" name="a2be1b52bb9f57486f9a436f35c9089c0"></a>
@@ -661,12 +654,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void machine_learning::neural_network::NeuralNetwork::fit </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X_</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X_</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>Y_</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>Y_</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -706,38 +699,40 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00485">485</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  488</span>                                                                        {</div>
-<div class="line"><span class="lineno">  489</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;</a>&gt;&gt; X = X_, Y = Y_;</div>
+<div class="line"><span class="lineno">  489</span>        std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; X = X_, Y = Y_;</div>
 <div class="line"><span class="lineno">  490</span>        <span class="comment">// Both label and input data should have same size</span></div>
-<div class="line"><span class="lineno">  491</span>        <span class="keywordflow">if</span> (X.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() != Y.size()) {</div>
-<div class="line"><span class="lineno">  492</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><span class="lineno">  493</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;X and Y in fit have different sizes&quot;</span> &lt;&lt; <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">  494</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  491</span>        <span class="keywordflow">if</span> (X.size() != Y.size()) {</div>
+<div class="line"><span class="lineno">  492</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><span class="lineno">  493</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;X and Y in fit have different sizes&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  494</span>            std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  495</span>        }</div>
-<div class="line"><span class="lineno">  496</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;INFO: Training Started&quot;</span> &lt;&lt; <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">  496</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;INFO: Training Started&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  497</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> epoch = 1; epoch &lt;= epochs; epoch++) {  <span class="comment">// For every epoch</span></div>
 <div class="line"><span class="lineno">  498</span>            <span class="comment">// Shuffle X and Y if flag is set</span></div>
 <div class="line"><span class="lineno">  499</span>            <span class="keywordflow">if</span> (shuffle) {</div>
 <div class="line"><span class="lineno">  500</span>                <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f">equal_shuffle</a>(X, Y);</div>
 <div class="line"><span class="lineno">  501</span>            }</div>
 <div class="line"><span class="lineno">  502</span>            <span class="keyword">auto</span> start =</div>
-<div class="line"><span class="lineno">  503</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html">std::chrono::high_resolution_clock::now</a>();  <span class="comment">// Start clock</span></div>
+<div class="line"><span class="lineno">  503</span>                std::chrono::high_resolution_clock::now();  <span class="comment">// Start clock</span></div>
 <div class="line"><span class="lineno">  504</span>            <span class="keywordtype">double</span> loss = 0,</div>
 <div class="line"><span class="lineno">  505</span>                   acc = 0;  <span class="comment">// Initialize performance metrics with zero</span></div>
 <div class="line"><span class="lineno">  506</span>            <span class="comment">// For each starting index of batch</span></div>
-<div class="line"><span class="lineno">  507</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> batch_start = 0; batch_start &lt; X.<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">  507</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> batch_start = 0; batch_start &lt; X.size();</div>
 <div class="line"><span class="lineno">  508</span>                 batch_start += batch_size) {</div>
 <div class="line"><span class="lineno">  509</span>                <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = batch_start;</div>
-<div class="line"><span class="lineno">  510</span>                     i &lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(X.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(), batch_start + batch_size); i++) {</div>
-<div class="line"><span class="lineno">  511</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; grad, cur_error,</div>
+<div class="line"><span class="lineno">  510</span>                     i &lt; std::min(X.size(), batch_start + batch_size); i++) {</div>
+<div class="line"><span class="lineno">  511</span>                    std::vector&lt;std::valarray&lt;double&gt;&gt; grad, cur_error,</div>
 <div class="line"><span class="lineno">  512</span>                        predicted;</div>
 <div class="line"><span class="lineno">  513</span>                    <span class="keyword">auto</span> <a class="code hl_namespace" href="../../d5/d39/namespaceactivations.html">activations</a> = this-&gt;<a class="code hl_function" href="#a361a45f3c3d8347d79103bf182d0570b">__detailed_single_prediction</a>(X[i]);</div>
 <div class="line"><span class="lineno">  514</span>                    <span class="comment">// Gradients vector to store gradients for all layers</span></div>
 <div class="line"><span class="lineno">  515</span>                    <span class="comment">// They will be averaged and applied to kernel</span></div>
-<div class="line"><span class="lineno">  516</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;</a>&gt;&gt; gradients;</div>
-<div class="line"><span class="lineno">  517</span>                    gradients.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/resize.html">resize</a>(this-&gt;<a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>.size());</div>
+<div class="line"><span class="lineno">  516</span>                    std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; gradients;</div>
+<div class="line"><span class="lineno">  517</span>                    gradients.resize(this-&gt;<a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>.size());</div>
 <div class="line"><span class="lineno">  518</span>                    <span class="comment">// First initialize gradients to zero</span></div>
-<div class="line"><span class="lineno">  519</span>                    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; gradients.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
+<div class="line"><span class="lineno">  519</span>                    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; gradients.size(); i++) {</div>
 <div class="line"><span class="lineno">  520</span>                        <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e">zeroes_initialization</a>(</div>
 <div class="line"><span class="lineno">  521</span>                            gradients[i], <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(this-&gt;<a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>[i].kernel));</div>
 <div class="line"><span class="lineno">  522</span>                    }</div>
@@ -775,41 +770,32 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  554</span>                }</div>
 <div class="line"><span class="lineno">  555</span>            }</div>
 <div class="line"><span class="lineno">  556</span>            <span class="keyword">auto</span> stop =</div>
-<div class="line"><span class="lineno">  557</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html">std::chrono::high_resolution_clock::now</a>();  <span class="comment">// Stoping the clock</span></div>
+<div class="line"><span class="lineno">  557</span>                std::chrono::high_resolution_clock::now();  <span class="comment">// Stoping the clock</span></div>
 <div class="line"><span class="lineno">  558</span>            <span class="comment">// Calculate time taken by epoch</span></div>
 <div class="line"><span class="lineno">  559</span>            <span class="keyword">auto</span> duration =</div>
-<div class="line"><span class="lineno">  560</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html">std::chrono::duration_cast&lt;std::chrono::microseconds&gt;</a>(stop -</div>
+<div class="line"><span class="lineno">  560</span>                std::chrono::duration_cast&lt;std::chrono::microseconds&gt;(stop -</div>
 <div class="line"><span class="lineno">  561</span>                                                                      start);</div>
-<div class="line"><span class="lineno">  562</span>            loss /= X.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();        <span class="comment">// Averaging loss</span></div>
-<div class="line"><span class="lineno">  563</span>            acc /= X.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();         <span class="comment">// Averaging accuracy</span></div>
-<div class="line"><span class="lineno">  564</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>.precision(4);  <span class="comment">// set output precision to 4</span></div>
+<div class="line"><span class="lineno">  562</span>            loss /= X.size();        <span class="comment">// Averaging loss</span></div>
+<div class="line"><span class="lineno">  563</span>            acc /= X.size();         <span class="comment">// Averaging accuracy</span></div>
+<div class="line"><span class="lineno">  564</span>            std::cout.precision(4);  <span class="comment">// set output precision to 4</span></div>
 <div class="line"><span class="lineno">  565</span>            <span class="comment">// Printing training stats</span></div>
-<div class="line"><span class="lineno">  566</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Training: Epoch &quot;</span> &lt;&lt; epoch &lt;&lt; <span class="charliteral">&#39;/&#39;</span> &lt;&lt; epochs;</div>
-<div class="line"><span class="lineno">  567</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;, Loss: &quot;</span> &lt;&lt; loss;</div>
-<div class="line"><span class="lineno">  568</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;, Accuracy: &quot;</span> &lt;&lt; acc;</div>
-<div class="line"><span class="lineno">  569</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;, Taken time: &quot;</span> &lt;&lt; duration.count() / 1e6</div>
+<div class="line"><span class="lineno">  566</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Training: Epoch &quot;</span> &lt;&lt; epoch &lt;&lt; <span class="charliteral">&#39;/&#39;</span> &lt;&lt; epochs;</div>
+<div class="line"><span class="lineno">  567</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;, Loss: &quot;</span> &lt;&lt; loss;</div>
+<div class="line"><span class="lineno">  568</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;, Accuracy: &quot;</span> &lt;&lt; acc;</div>
+<div class="line"><span class="lineno">  569</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;, Taken time: &quot;</span> &lt;&lt; duration.count() / 1e6</div>
 <div class="line"><span class="lineno">  570</span>                      &lt;&lt; <span class="stringliteral">&quot; seconds&quot;</span>;</div>
-<div class="line"><span class="lineno">  571</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  571</span>            std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  572</span>        }</div>
 <div class="line"><span class="lineno">  573</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  574</span>    }</div>
-<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a361a45f3c3d8347d79103bf182d0570b"><div class="ttname"><a href="#a361a45f3c3d8347d79103bf182d0570b">machine_learning::neural_network::NeuralNetwork::__detailed_single_prediction</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; __detailed_single_prediction(const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</div><div class="ttdef"><b>Definition</b> neural_network.cpp:289</div></div>
-<div class="ttc" id="aduration_cast_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html">std::chrono::duration_cast</a></div><div class="ttdeci">T duration_cast(T... args)</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="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a361a45f3c3d8347d79103bf182d0570b"><div class="ttname"><a href="#a361a45f3c3d8347d79103bf182d0570b">machine_learning::neural_network::NeuralNetwork::__detailed_single_prediction</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; __detailed_single_prediction(const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d58/neural__network_8cpp_source.html#l00289">neural_network.cpp:289</a></div></div>
 <div class="ttc" id="anamespaceactivations_html"><div class="ttname"><a href="../../d5/d39/namespaceactivations.html">activations</a></div><div class="ttdoc">Various activation functions used in Neural network.</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a89fde571b38f9483576594f66572958a"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a">machine_learning::transpose</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; transpose(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:382</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_aa4bbf61e65f8cd297255fa94b983d078"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">machine_learning::get_shape</a></div><div class="ttdeci">std::pair&lt; size_t, size_t &gt; get_shape(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:247</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_ac1bdaa2a724b4ce6a6bb371a5dbe2e7e"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e">machine_learning::zeroes_initialization</a></div><div class="ttdeci">void zeroes_initialization(std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:213</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_acafa3e62b686aebdbad81c4f89913f43"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43">machine_learning::hadamard_product</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; hadamard_product(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:494</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_af801bf30591ca6b2c38ff4fed0ded23f"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f">machine_learning::equal_shuffle</a></div><div class="ttdeci">void equal_shuffle(std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;A, std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:136</div></div>
-<div class="ttc" id="anow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html">std::chrono::high_resolution_clock::now</a></div><div class="ttdeci">T now(T... args)</div></div>
-<div class="ttc" id="aresize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/resize.html">std::vector::resize</a></div><div class="ttdeci">T resize(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="anamespacemachine__learning_html_a89fde571b38f9483576594f66572958a"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a">machine_learning::transpose</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; transpose(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00382">vector_ops.hpp:382</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_aa4bbf61e65f8cd297255fa94b983d078"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">machine_learning::get_shape</a></div><div class="ttdeci">std::pair&lt; size_t, size_t &gt; get_shape(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00247">vector_ops.hpp:247</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_ac1bdaa2a724b4ce6a6bb371a5dbe2e7e"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e">machine_learning::zeroes_initialization</a></div><div class="ttdeci">void zeroes_initialization(std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00213">vector_ops.hpp:213</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_acafa3e62b686aebdbad81c4f89913f43"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43">machine_learning::hadamard_product</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; hadamard_product(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00494">vector_ops.hpp:494</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_af801bf30591ca6b2c38ff4fed0ded23f"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f">machine_learning::equal_shuffle</a></div><div class="ttdeci">void equal_shuffle(std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;A, std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00136">vector_ops.hpp:136</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5172a6791b9bd24f4232bab8d6b81fff" name="a5172a6791b9bd24f4232bab8d6b81fff"></a>
@@ -824,7 +810,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void machine_learning::neural_network::NeuralNetwork::fit_from_csv </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>file_name</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>file_name</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -881,6 +867,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00587">587</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  591</span>                                                  {</div>
 <div class="line"><span class="lineno">  592</span>        <span class="comment">// Getting training data from csv file</span></div>
 <div class="line"><span class="lineno">  593</span>        <span class="keyword">auto</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> =</div>
@@ -890,13 +878,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  597</span>                  shuffle);</div>
 <div class="line"><span class="lineno">  598</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  599</span>    }</div>
-<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a2be1b52bb9f57486f9a436f35c9089c0"><div class="ttname"><a href="#a2be1b52bb9f57486f9a436f35c9089c0">machine_learning::neural_network::NeuralNetwork::fit</a></div><div class="ttdeci">void fit(const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;X_, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;Y_, const int &amp;epochs=100, const double &amp;learning_rate=0.01, const size_t &amp;batch_size=32, const bool &amp;shuffle=true)</div><div class="ttdef"><b>Definition</b> neural_network.cpp:485</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a2be1b52bb9f57486f9a436f35c9089c0"><div class="ttname"><a href="#a2be1b52bb9f57486f9a436f35c9089c0">machine_learning::neural_network::NeuralNetwork::fit</a></div><div class="ttdeci">void fit(const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;X_, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;Y_, const int &amp;epochs=100, const double &amp;learning_rate=0.01, const size_t &amp;batch_size=32, const bool &amp;shuffle=true)</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d58/neural__network_8cpp_source.html#l00485">neural_network.cpp:485</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a650c677fd6512665741ddd9b7983275d" name="a650c677fd6512665741ddd9b7983275d"></a>
@@ -909,9 +892,9 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt;, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &gt; machine_learning::neural_network::NeuralNetwork::get_XY_from_csv </td>
+          <td class="memname">std::pair&lt; std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt;, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &gt; machine_learning::neural_network::NeuralNetwork::get_XY_from_csv </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>file_name</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>file_name</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -945,31 +928,33 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>returns pair of X and Y </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00382">382</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  383</span>                                                                      {</div>
-<div class="line"><span class="lineno">  384</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ifstream.html">std::ifstream</a> in_file;                          <span class="comment">// Ifstream to read file</span></div>
-<div class="line"><span class="lineno">  385</span>        in_file.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html">open</a>(file_name.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html">c_str</a>(), std::ios::in);  <span class="comment">// Open file</span></div>
+<div class="line"><span class="lineno">  384</span>        std::ifstream in_file;                          <span class="comment">// Ifstream to read file</span></div>
+<div class="line"><span class="lineno">  385</span>        in_file.open(file_name.c_str(), std::ios::in);  <span class="comment">// Open file</span></div>
 <div class="line"><span class="lineno">  386</span>        <span class="comment">// If there is any problem in opening file</span></div>
-<div class="line"><span class="lineno">  387</span>        <span class="keywordflow">if</span> (!in_file.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html">is_open</a>()) {</div>
-<div class="line"><span class="lineno">  388</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><span class="lineno">  389</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Unable to open file: &quot;</span> &lt;&lt; file_name &lt;&lt; <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">  390</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  387</span>        <span class="keywordflow">if</span> (!in_file.is_open()) {</div>
+<div class="line"><span class="lineno">  388</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><span class="lineno">  389</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Unable to open file: &quot;</span> &lt;&lt; file_name &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  390</span>            std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  391</span>        }</div>
-<div class="line"><span class="lineno">  392</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;</a>&gt;&gt; X,</div>
+<div class="line"><span class="lineno">  392</span>        std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt; X,</div>
 <div class="line"><span class="lineno">  393</span>            Y;             <span class="comment">// To store X and Y</span></div>
-<div class="line"><span class="lineno">  394</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> line;  <span class="comment">// To store each line</span></div>
+<div class="line"><span class="lineno">  394</span>        std::string line;  <span class="comment">// To store each line</span></div>
 <div class="line"><span class="lineno">  395</span>        <span class="comment">// Skip lines</span></div>
 <div class="line"><span class="lineno">  396</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; slip_lines; i++) {</div>
-<div class="line"><span class="lineno">  397</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html">std::getline</a>(in_file, line, <span class="charliteral">&#39;\n&#39;</span>);  <span class="comment">// Ignore line</span></div>
+<div class="line"><span class="lineno">  397</span>            std::getline(in_file, line, <span class="charliteral">&#39;\n&#39;</span>);  <span class="comment">// Ignore line</span></div>
 <div class="line"><span class="lineno">  398</span>        }</div>
 <div class="line"><span class="lineno">  399</span>        <span class="comment">// While file has information</span></div>
-<div class="line"><span class="lineno">  400</span>        <span class="keywordflow">while</span> (!in_file.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ios/eof.html">eof</a>() &amp;&amp; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html">std::getline</a>(in_file, line, <span class="charliteral">&#39;\n&#39;</span>)) {</div>
-<div class="line"><span class="lineno">  401</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> x_data,</div>
+<div class="line"><span class="lineno">  400</span>        <span class="keywordflow">while</span> (!in_file.eof() &amp;&amp; std::getline(in_file, line, <span class="charliteral">&#39;\n&#39;</span>)) {</div>
+<div class="line"><span class="lineno">  401</span>            std::valarray&lt;double&gt; x_data,</div>
 <div class="line"><span class="lineno">  402</span>                y_data;                  <span class="comment">// To store single sample and label</span></div>
-<div class="line"><span class="lineno">  403</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">std::stringstream</a> ss(line);  <span class="comment">// Constructing stringstream from line</span></div>
-<div class="line"><span class="lineno">  404</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> token;  <span class="comment">// To store each token in line (seprated by &#39;,&#39;)</span></div>
-<div class="line"><span class="lineno">  405</span>            <span class="keywordflow">while</span> (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html">std::getline</a>(ss, token, <span class="charliteral">&#39;,&#39;</span>)) {  <span class="comment">// For each token</span></div>
+<div class="line"><span class="lineno">  403</span>            std::stringstream ss(line);  <span class="comment">// Constructing stringstream from line</span></div>
+<div class="line"><span class="lineno">  404</span>            std::string token;  <span class="comment">// To store each token in line (seprated by &#39;,&#39;)</span></div>
+<div class="line"><span class="lineno">  405</span>            <span class="keywordflow">while</span> (std::getline(ss, token, <span class="charliteral">&#39;,&#39;</span>)) {  <span class="comment">// For each token</span></div>
 <div class="line"><span class="lineno">  406</span>                <span class="comment">// Insert numerical value of token in x_data</span></div>
-<div class="line"><span class="lineno">  407</span>                x_data = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd">insert_element</a>(x_data, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html">std::stod</a>(token));</div>
+<div class="line"><span class="lineno">  407</span>                x_data = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd">insert_element</a>(x_data, std::stod(token));</div>
 <div class="line"><span class="lineno">  408</span>            }</div>
 <div class="line"><span class="lineno">  409</span>            <span class="comment">// If label is in last column</span></div>
 <div class="line"><span class="lineno">  410</span>            <span class="keywordflow">if</span> (last_label) {</div>
@@ -996,40 +981,22 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  431</span>                x_data = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093">pop_front</a>(x_data);  <span class="comment">// Remove label from x_data</span></div>
 <div class="line"><span class="lineno">  432</span>            }</div>
 <div class="line"><span class="lineno">  433</span>            <span class="comment">// Push collected X_data and y_data in X and Y</span></div>
-<div class="line"><span class="lineno">  434</span>            X.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>({x_data});</div>
-<div class="line"><span class="lineno">  435</span>            Y.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>({y_data});</div>
+<div class="line"><span class="lineno">  434</span>            X.push_back({x_data});</div>
+<div class="line"><span class="lineno">  435</span>            Y.push_back({y_data});</div>
 <div class="line"><span class="lineno">  436</span>        }</div>
 <div class="line"><span class="lineno">  437</span>        <span class="comment">// Normalize training data if flag is set</span></div>
 <div class="line"><span class="lineno">  438</span>        <span class="keywordflow">if</span> (normalize) {</div>
 <div class="line"><span class="lineno">  439</span>            <span class="comment">// Scale data between 0 and 1 using min-max scaler</span></div>
 <div class="line"><span class="lineno">  440</span>            X = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26">minmax_scaler</a>(X, 0.01, 1.0);</div>
 <div class="line"><span class="lineno">  441</span>        }</div>
-<div class="line"><span class="lineno">  442</span>        in_file.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html">close</a>();         <span class="comment">// Closing file</span></div>
-<div class="line"><span class="lineno">  443</span>        <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">make_pair</a>(X, Y);  <span class="comment">// Return pair of X and Y</span></div>
+<div class="line"><span class="lineno">  442</span>        in_file.close();         <span class="comment">// Closing file</span></div>
+<div class="line"><span class="lineno">  443</span>        <span class="keywordflow">return</span> make_pair(X, Y);  <span class="comment">// Return pair of X and Y</span></div>
 <div class="line"><span class="lineno">  444</span>    }</div>
-<div class="ttc" id="abasic_ifstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ifstream.html">std::ifstream</a></div></div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="abasic_stringstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">std::stringstream</a></div></div>
-<div class="ttc" id="ac_str_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html">std::string::c_str</a></div><div class="ttdeci">T c_str(T... args)</div></div>
-<div class="ttc" id="aclose_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html">std::ifstream::close</a></div><div class="ttdeci">T close(T... args)</div></div>
-<div class="ttc" id="aeof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ios/eof.html">std::ifstream::eof</a></div><div class="ttdeci">T eof(T... args)</div></div>
-<div class="ttc" id="agetline_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html">std::getline</a></div><div class="ttdeci">T getline(T... args)</div></div>
-<div class="ttc" id="ais_open_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html">std::ifstream::is_open</a></div><div class="ttdeci">T is_open(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="anamespacemachine__learning_html_a496302e3371aa7b478cb7d5917904bdd"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd">machine_learning::insert_element</a></div><div class="ttdeci">std::valarray&lt; T &gt; insert_element(const std::valarray&lt; T &gt; &amp;A, const T &amp;ele)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:85</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a912cf68863063a38d6e63545be5eb093"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093">machine_learning::pop_front</a></div><div class="ttdeci">std::valarray&lt; T &gt; pop_front(const std::valarray&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:102</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_ac332d152078e96311e43ac5e7183ea26"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26">machine_learning::minmax_scaler</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; minmax_scaler(const std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;A, const T &amp;low, const T &amp;high)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:269</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_ae10178b082f0205c326550877d998e5d"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d">machine_learning::pop_back</a></div><div class="ttdeci">std::valarray&lt; T &gt; pop_back(const std::valarray&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:119</div></div>
-<div class="ttc" id="aopen_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html">std::ifstream::open</a></div><div class="ttdeci">T open(T... args)</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="astof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html">std::stod</a></div><div class="ttdeci">T stod(T... args)</div></div>
-<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="anamespacemachine__learning_html_a496302e3371aa7b478cb7d5917904bdd"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd">machine_learning::insert_element</a></div><div class="ttdeci">std::valarray&lt; T &gt; insert_element(const std::valarray&lt; T &gt; &amp;A, const T &amp;ele)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00085">vector_ops.hpp:85</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a912cf68863063a38d6e63545be5eb093"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093">machine_learning::pop_front</a></div><div class="ttdeci">std::valarray&lt; T &gt; pop_front(const std::valarray&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00102">vector_ops.hpp:102</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_ac332d152078e96311e43ac5e7183ea26"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26">machine_learning::minmax_scaler</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; minmax_scaler(const std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;A, const T &amp;low, const T &amp;high)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00269">vector_ops.hpp:269</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_ae10178b082f0205c326550877d998e5d"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d">machine_learning::pop_back</a></div><div class="ttdeci">std::valarray&lt; T &gt; pop_back(const std::valarray&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00119">vector_ops.hpp:119</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a58ed20abf6ce3744535bd8b5bb9e741b" name="a58ed20abf6ce3744535bd8b5bb9e741b"></a>
@@ -1044,7 +1011,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname"><a class="el" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> machine_learning::neural_network::NeuralNetwork::load_model </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>file_name</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>file_name</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -1061,50 +1028,47 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>instance of <a class="el" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> class with pretrained weights </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00732">732</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  732</span>                                                         {</div>
-<div class="line"><span class="lineno">  733</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ifstream.html">std::ifstream</a> in_file;            <span class="comment">// Ifstream to read file</span></div>
-<div class="line"><span class="lineno">  734</span>        in_file.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html">open</a>(file_name.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html">c_str</a>());  <span class="comment">// Openinig file</span></div>
+<div class="line"><span class="lineno">  733</span>        std::ifstream in_file;            <span class="comment">// Ifstream to read file</span></div>
+<div class="line"><span class="lineno">  734</span>        in_file.open(file_name.c_str());  <span class="comment">// Openinig file</span></div>
 <div class="line"><span class="lineno">  735</span>        <span class="comment">// If there is any problem in opening file</span></div>
-<div class="line"><span class="lineno">  736</span>        <span class="keywordflow">if</span> (!in_file.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html">is_open</a>()) {</div>
-<div class="line"><span class="lineno">  737</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><span class="lineno">  738</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Unable to open file: &quot;</span> &lt;&lt; file_name &lt;&lt; <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">  739</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  736</span>        <span class="keywordflow">if</span> (!in_file.is_open()) {</div>
+<div class="line"><span class="lineno">  737</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><span class="lineno">  738</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Unable to open file: &quot;</span> &lt;&lt; file_name &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  739</span>            std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  740</span>        }</div>
-<div class="line"><span class="lineno">  741</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::pair&lt;int, std::string&gt;</a>&gt; config;  <span class="comment">// To store config</span></div>
-<div class="line"><span class="lineno">  742</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;</a>&gt;&gt;</div>
+<div class="line"><span class="lineno">  741</span>        std::vector&lt;std::pair&lt;int, std::string&gt;&gt; config;  <span class="comment">// To store config</span></div>
+<div class="line"><span class="lineno">  742</span>        std::vector&lt;std::vector&lt;std::valarray&lt;double&gt;&gt;&gt;</div>
 <div class="line"><span class="lineno">  743</span>            kernels;  <span class="comment">// To store pretrained kernels</span></div>
 <div class="line"><span class="lineno">  744</span>        <span class="comment">// Loading model from saved file format</span></div>
 <div class="line"><span class="lineno">  745</span>        <span class="keywordtype">size_t</span> total_layers = 0;</div>
 <div class="line"><span class="lineno">  746</span>        in_file &gt;&gt; total_layers;</div>
 <div class="line"><span class="lineno">  747</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; total_layers; i++) {</div>
 <div class="line"><span class="lineno">  748</span>            <span class="keywordtype">int</span> neurons = 0;</div>
-<div class="line"><span class="lineno">  749</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> activation;</div>
+<div class="line"><span class="lineno">  749</span>            std::string activation;</div>
 <div class="line"><span class="lineno">  750</span>            <span class="keywordtype">size_t</span> shape_a = 0, shape_b = 0;</div>
-<div class="line"><span class="lineno">  751</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; kernel;</div>
+<div class="line"><span class="lineno">  751</span>            std::vector&lt;std::valarray&lt;double&gt;&gt; kernel;</div>
 <div class="line"><span class="lineno">  752</span>            in_file &gt;&gt; neurons &gt;&gt; activation &gt;&gt; shape_a &gt;&gt; shape_b;</div>
 <div class="line"><span class="lineno">  753</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> r = 0; r &lt; shape_a; r++) {</div>
-<div class="line"><span class="lineno">  754</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> row(shape_b);</div>
+<div class="line"><span class="lineno">  754</span>                std::valarray&lt;double&gt; row(shape_b);</div>
 <div class="line"><span class="lineno">  755</span>                <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> c = 0; c &lt; shape_b; c++) {</div>
 <div class="line"><span class="lineno">  756</span>                    in_file &gt;&gt; row[c];</div>
 <div class="line"><span class="lineno">  757</span>                }</div>
-<div class="line"><span class="lineno">  758</span>                kernel.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(row);</div>
+<div class="line"><span class="lineno">  758</span>                kernel.push_back(row);</div>
 <div class="line"><span class="lineno">  759</span>            }</div>
-<div class="line"><span class="lineno">  760</span>            config.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">make_pair</a>(neurons, activation));</div>
+<div class="line"><span class="lineno">  760</span>            config.emplace_back(make_pair(neurons, activation));</div>
 <div class="line"><span class="lineno">  761</span>            ;</div>
-<div class="line"><span class="lineno">  762</span>            kernels.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(kernel);</div>
+<div class="line"><span class="lineno">  762</span>            kernels.emplace_back(kernel);</div>
 <div class="line"><span class="lineno">  763</span>        }</div>
-<div class="line"><span class="lineno">  764</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;INFO: Model loaded successfully&quot;</span> &lt;&lt; <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">  765</span>        in_file.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html">close</a>();  <span class="comment">// Closing file</span></div>
+<div class="line"><span class="lineno">  764</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;INFO: Model loaded successfully&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  765</span>        in_file.close();  <span class="comment">// Closing file</span></div>
 <div class="line"><span class="lineno">  766</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#ae7cf126a3a8f9d20c81b21584d061a08">NeuralNetwork</a>(</div>
 <div class="line"><span class="lineno">  767</span>            config, kernels);  <span class="comment">// Return instance of NeuralNetwork class</span></div>
 <div class="line"><span class="lineno">  768</span>    }</div>
 <div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_ae7cf126a3a8f9d20c81b21584d061a08"><div class="ttname"><a href="#ae7cf126a3a8f9d20c81b21584d061a08">machine_learning::neural_network::NeuralNetwork::NeuralNetwork</a></div><div class="ttdeci">NeuralNetwork()=default</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph.svg" width="404" height="463"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a58a9614e4c6d4ca672d3358e99a3404f" name="a58a9614e4c6d4ca672d3358e99a3404f"></a>
@@ -1171,7 +1135,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void machine_learning::neural_network::NeuralNetwork::save_model </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>_file_name</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>_file_name</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -1215,88 +1179,44 @@ neural_network::layers::DenseLayer) kernel_value</p>
  -2.01336 -0.0219682 1.44145
  1.72853 -0.465264 -0.705373
  -0.908409 -0.740547 0.376416
- </pre><div class="fragment"><div class="line"><span class="lineno">  652</span>                                                 {</div>
-<div class="line"><span class="lineno">  653</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> file_name = _file_name;</div>
+ </pre>
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00652">652</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  652</span>                                                 {</div>
+<div class="line"><span class="lineno">  653</span>        std::string file_name = _file_name;</div>
 <div class="line"><span class="lineno">  654</span>        <span class="comment">// Adding &quot;.model&quot; extension if it is not already there in name</span></div>
-<div class="line"><span class="lineno">  655</span>        <span class="keywordflow">if</span> (file_name.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/find.html">find</a>(<span class="stringliteral">&quot;.model&quot;</span>) == file_name.npos) {</div>
+<div class="line"><span class="lineno">  655</span>        <span class="keywordflow">if</span> (file_name.find(<span class="stringliteral">&quot;.model&quot;</span>) == file_name.npos) {</div>
 <div class="line"><span class="lineno">  656</span>            file_name += <span class="stringliteral">&quot;.model&quot;</span>;</div>
 <div class="line"><span class="lineno">  657</span>        }</div>
-<div class="line"><span class="lineno">  658</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a> out_file;  <span class="comment">// Ofstream to write in file</span></div>
+<div class="line"><span class="lineno">  658</span>        std::ofstream out_file;  <span class="comment">// Ofstream to write in file</span></div>
 <div class="line"><span class="lineno">  659</span>        <span class="comment">// Open file in out|trunc mode</span></div>
-<div class="line"><span class="lineno">  660</span>        out_file.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html">open</a>(file_name.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html">c_str</a>(),</div>
+<div class="line"><span class="lineno">  660</span>        out_file.open(file_name.c_str(),</div>
 <div class="line"><span class="lineno">  661</span>                      std::ofstream::out | std::ofstream::trunc);</div>
 <div class="line"><span class="lineno">  662</span>        <span class="comment">// If there is any problem in opening file</span></div>
-<div class="line"><span class="lineno">  663</span>        <span class="keywordflow">if</span> (!out_file.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">is_open</a>()) {</div>
-<div class="line"><span class="lineno">  664</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><span class="lineno">  665</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Unable to open file: &quot;</span> &lt;&lt; file_name &lt;&lt; <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">  666</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
-<div class="line"><span class="lineno">  667</span>        }<span class="comment"></span></div>
-<div class="line"><span class="lineno">  668</span><span class="comment">        /**</span></div>
-<div class="line"><span class="lineno">  669</span><span class="comment">            Format in which model is saved:</span></div>
-<div class="line"><span class="lineno">  670</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  671</span><span class="comment">            total_layers</span></div>
-<div class="line"><span class="lineno">  672</span><span class="comment">            neurons(1st neural_network::layers::DenseLayer) activation_name(1st</span></div>
-<div class="line"><span class="lineno">  673</span><span class="comment">           neural_network::layers::DenseLayer) kernel_shape(1st</span></div>
-<div class="line"><span class="lineno">  674</span><span class="comment">           neural_network::layers::DenseLayer) kernel_values</span></div>
-<div class="line"><span class="lineno">  675</span><span class="comment">            .</span></div>
-<div class="line"><span class="lineno">  676</span><span class="comment">            .</span></div>
-<div class="line"><span class="lineno">  677</span><span class="comment">            .</span></div>
-<div class="line"><span class="lineno">  678</span><span class="comment">            neurons(Nth neural_network::layers::DenseLayer) activation_name(Nth</span></div>
-<div class="line"><span class="lineno">  679</span><span class="comment">           neural_network::layers::DenseLayer) kernel_shape(Nth</span></div>
-<div class="line"><span class="lineno">  680</span><span class="comment">           neural_network::layers::DenseLayer) kernel_value</span></div>
-<div class="line"><span class="lineno">  681</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  682</span><span class="comment">            For Example, pretrained model with 3 layers:</span></div>
-<div class="line"><span class="lineno">  683</span><span class="comment">            &lt;pre&gt;</span></div>
-<div class="line"><span class="lineno">  684</span><span class="comment">            3</span></div>
-<div class="line"><span class="lineno">  685</span><span class="comment">            4 none</span></div>
-<div class="line"><span class="lineno">  686</span><span class="comment">            4 4</span></div>
-<div class="line"><span class="lineno">  687</span><span class="comment">            1 0 0 0</span></div>
-<div class="line"><span class="lineno">  688</span><span class="comment">            0 1 0 0</span></div>
-<div class="line"><span class="lineno">  689</span><span class="comment">            0 0 1 0</span></div>
-<div class="line"><span class="lineno">  690</span><span class="comment">            0 0 0 1</span></div>
-<div class="line"><span class="lineno">  691</span><span class="comment">            6 relu</span></div>
-<div class="line"><span class="lineno">  692</span><span class="comment">            4 6</span></div>
-<div class="line"><span class="lineno">  693</span><span class="comment">            -1.88963 -3.61165 1.30757 -0.443906 -2.41039 -2.69653</span></div>
-<div class="line"><span class="lineno">  694</span><span class="comment">            -0.684753 0.0891452 0.795294 -2.39619 2.73377 0.318202</span></div>
-<div class="line"><span class="lineno">  695</span><span class="comment">            -2.91451 -4.43249 -0.804187 2.51995 -6.97524 -1.07049</span></div>
-<div class="line"><span class="lineno">  696</span><span class="comment">            -0.571531 -1.81689 -1.24485 1.92264 -2.81322 1.01741</span></div>
-<div class="line"><span class="lineno">  697</span><span class="comment">            3 sigmoid</span></div>
-<div class="line"><span class="lineno">  698</span><span class="comment">            6 3</span></div>
-<div class="line"><span class="lineno">  699</span><span class="comment">            0.390267 -0.391703 -0.0989607</span></div>
-<div class="line"><span class="lineno">  700</span><span class="comment">            0.499234 -0.564539 -0.28097</span></div>
-<div class="line"><span class="lineno">  701</span><span class="comment">            0.553386 -0.153974 -1.92493</span></div>
-<div class="line"><span class="lineno">  702</span><span class="comment">            -2.01336 -0.0219682 1.44145</span></div>
-<div class="line"><span class="lineno">  703</span><span class="comment">            1.72853 -0.465264 -0.705373</span></div>
-<div class="line"><span class="lineno">  704</span><span class="comment">            -0.908409 -0.740547 0.376416</span></div>
-<div class="line"><span class="lineno">  705</span><span class="comment">            &lt;/pre&gt;</span></div>
-<div class="line"><span class="lineno">  706</span><span class="comment">        */</span></div>
+<div class="line"><span class="lineno">  663</span>        <span class="keywordflow">if</span> (!out_file.is_open()) {</div>
+<div class="line"><span class="lineno">  664</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><span class="lineno">  665</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Unable to open file: &quot;</span> &lt;&lt; file_name &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  666</span>            std::exit(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  667</span>        }</div>
 <div class="line"><span class="lineno">  707</span>        <span class="comment">// Saving model in the same format</span></div>
 <div class="line"><span class="lineno">  708</span>        out_file &lt;&lt; <a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>.size();</div>
-<div class="line"><span class="lineno">  709</span>        out_file &lt;&lt; <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">  709</span>        out_file &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  710</span>        <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;layer : this-&gt;<a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>) {</div>
-<div class="line"><span class="lineno">  711</span>            out_file &lt;&lt; layer.neurons &lt;&lt; <span class="charliteral">&#39; &#39;</span> &lt;&lt; layer.activation &lt;&lt; <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">  711</span>            out_file &lt;&lt; layer.neurons &lt;&lt; <span class="charliteral">&#39; &#39;</span> &lt;&lt; layer.activation &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  712</span>            <span class="keyword">const</span> <span class="keyword">auto</span> shape = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(layer.kernel);</div>
-<div class="line"><span class="lineno">  713</span>            out_file &lt;&lt; shape.first &lt;&lt; <span class="charliteral">&#39; &#39;</span> &lt;&lt; shape.second &lt;&lt; <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">  713</span>            out_file &lt;&lt; shape.first &lt;&lt; <span class="charliteral">&#39; &#39;</span> &lt;&lt; shape.second &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  714</span>            <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;row : layer.kernel) {</div>
 <div class="line"><span class="lineno">  715</span>                <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;val : row) {</div>
 <div class="line"><span class="lineno">  716</span>                    out_file &lt;&lt; val &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
 <div class="line"><span class="lineno">  717</span>                }</div>
-<div class="line"><span class="lineno">  718</span>                out_file &lt;&lt; <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">  718</span>                out_file &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  719</span>            }</div>
 <div class="line"><span class="lineno">  720</span>        }</div>
-<div class="line"><span class="lineno">  721</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;INFO: Model saved successfully with name : &quot;</span>;</div>
-<div class="line"><span class="lineno">  722</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; file_name &lt;&lt; <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">  723</span>        out_file.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html">close</a>();  <span class="comment">// Closing file</span></div>
+<div class="line"><span class="lineno">  721</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;INFO: Model saved successfully with name : &quot;</span>;</div>
+<div class="line"><span class="lineno">  722</span>        std::cout &lt;&lt; file_name &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  723</span>        out_file.close();  <span class="comment">// Closing file</span></div>
 <div class="line"><span class="lineno">  724</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  725</span>    }</div>
-<div class="ttc" id="abasic_ofstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a></div></div>
-<div class="ttc" id="afind_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/find.html">std::string::find</a></div><div class="ttdeci">T find(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph.svg" width="535" height="400"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a3b9eac1824d365dce715fb17c33cb96f" name="a3b9eac1824d365dce715fb17c33cb96f"></a>
@@ -1309,9 +1229,9 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; machine_learning::neural_network::NeuralNetwork::single_predict </td>
+          <td class="memname">std::vector&lt; std::valarray&lt; double &gt; &gt; machine_learning::neural_network::NeuralNetwork::single_predict </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -1328,18 +1248,15 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>returns predictions as vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00451">451</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  452</span>                                                 {</div>
 <div class="line"><span class="lineno">  453</span>        <span class="comment">// Get activations of all layers</span></div>
 <div class="line"><span class="lineno">  454</span>        <span class="keyword">auto</span> <a class="code hl_namespace" href="../../d5/d39/namespaceactivations.html">activations</a> = this-&gt;<a class="code hl_function" href="#a361a45f3c3d8347d79103bf182d0570b">__detailed_single_prediction</a>(X);</div>
 <div class="line"><span class="lineno">  455</span>        <span class="comment">// Return activations of last layer (actual predicted values)</span></div>
 <div class="line"><span class="lineno">  456</span>        <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../d5/d39/namespaceactivations.html">activations</a>.back();</div>
 <div class="line"><span class="lineno">  457</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph.svg" width="100%" height="472"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a61d30113d13304c664057118b92a5931" name="a61d30113d13304c664057118b92a5931"></a>
@@ -1365,40 +1282,62 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Function to print summary of the network. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00773">773</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  773</span>                   {</div>
 <div class="line"><span class="lineno">  774</span>        <span class="comment">// Printing Summary</span></div>
-<div class="line"><span class="lineno">  775</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div>
+<div class="line"><span class="lineno">  775</span>        std::cout</div>
 <div class="line"><span class="lineno">  776</span>            &lt;&lt; <span class="stringliteral">&quot;===============================================================&quot;</span></div>
-<div class="line"><span class="lineno">  777</span>            &lt;&lt; <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">  778</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\t\t+ MODEL SUMMARY +\t\t\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  779</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div>
+<div class="line"><span class="lineno">  777</span>            &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  778</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\t\t+ MODEL SUMMARY +\t\t\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  779</span>        std::cout</div>
 <div class="line"><span class="lineno">  780</span>            &lt;&lt; <span class="stringliteral">&quot;===============================================================&quot;</span></div>
-<div class="line"><span class="lineno">  781</span>            &lt;&lt; <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">  781</span>            &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  782</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 1; i &lt;= <a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>.size(); i++) {  <span class="comment">// For every layer</span></div>
-<div class="line"><span class="lineno">  783</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;)&quot;</span>;</div>
-<div class="line"><span class="lineno">  784</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; Neurons : &quot;</span></div>
+<div class="line"><span class="lineno">  783</span>            std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;)&quot;</span>;</div>
+<div class="line"><span class="lineno">  784</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; Neurons : &quot;</span></div>
 <div class="line"><span class="lineno">  785</span>                      &lt;&lt; <a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>[i - 1].neurons;  <span class="comment">// number of neurons</span></div>
-<div class="line"><span class="lineno">  786</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;, Activation : &quot;</span></div>
+<div class="line"><span class="lineno">  786</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;, Activation : &quot;</span></div>
 <div class="line"><span class="lineno">  787</span>                      &lt;&lt; <a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>[i - 1].activation;  <span class="comment">// activation</span></div>
-<div class="line"><span class="lineno">  788</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;, kernel Shape : &quot;</span></div>
+<div class="line"><span class="lineno">  788</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;, kernel Shape : &quot;</span></div>
 <div class="line"><span class="lineno">  789</span>                      &lt;&lt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(<a class="code hl_namespace" href="../../d5/d2c/namespacelayers.html">layers</a>[i - 1].kernel);  <span class="comment">// kernel shape</span></div>
-<div class="line"><span class="lineno">  790</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  790</span>            std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  791</span>        }</div>
-<div class="line"><span class="lineno">  792</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div>
+<div class="line"><span class="lineno">  792</span>        std::cout</div>
 <div class="line"><span class="lineno">  793</span>            &lt;&lt; <span class="stringliteral">&quot;===============================================================&quot;</span></div>
-<div class="line"><span class="lineno">  794</span>            &lt;&lt; <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">  794</span>            &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  795</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  796</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph.svg" width="532" height="136"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a8c5a466131aa2ae6b7276185b0834053" name="a8c5a466131aa2ae6b7276185b0834053"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a8c5a466131aa2ae6b7276185b0834053">&#9670;&#160;</a></span>layers</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;<a class="el" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">neural_network::layers::DenseLayer</a>&gt; machine_learning::neural_network::NeuralNetwork::layers</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00249">249</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>machine_learning/<a class="el" href="../../d2/d58/neural__network_8cpp.html">neural_network.cpp</a></li>
+<li>machine_learning/<a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph.map b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph.map
deleted file mode 100644
index e83bca88f..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph.map
+++ /dev/null
@@ -1,77 +0,0 @@
-<map id="machine_learning::neural_network::NeuralNetwork::fit" name="machine_learning::neural_network::NeuralNetwork::fit">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,471,194,512"/>
-<area shape="rect" id="Node000002" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" title=" " alt="" coords="242,65,434,120"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="101,470,114,408,139,320,157,272,180,224,207,179,240,137,250,128,254,132,244,141,211,182,184,227,162,274,144,322,119,409,106,471"/>
-<area shape="rect" id="Node000003" href="$d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" title=" " alt="" coords="495,11,656,52"/>
-<area shape="poly" id="edge12_Node000001_Node000003" title=" " alt="" coords="97,471,100,390,106,335,117,274,134,212,159,152,194,97,216,72,240,50,267,33,296,20,358,6,421,3,480,8,479,14,421,9,359,11,298,25,269,38,243,55,219,76,198,100,164,154,139,214,122,275,111,335,105,390,103,471"/>
-<area shape="rect" id="Node000005" href="$d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" title=" " alt="" coords="488,221,663,247"/>
-<area shape="poly" id="edge38_Node000001_Node000005" title=" " alt="" coords="105,470,123,428,151,375,190,322,214,298,240,278,296,252,356,235,416,227,472,225,473,230,417,232,357,240,298,257,243,283,217,302,194,326,155,378,128,431,110,472"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="960,380,1031,405"/>
-<area shape="poly" id="edge22_Node000001_Node000006" title=" " alt="" coords="103,470,117,420,144,354,162,320,184,288,210,258,240,233,303,197,360,176,413,166,466,165,578,174,643,178,717,177,764,169,803,159,821,156,840,158,860,164,880,177,900,198,909,221,911,244,910,268,908,316,914,339,929,363,947,377,944,381,925,366,909,341,902,316,904,267,906,244,904,222,896,201,877,181,857,169,839,163,822,162,804,164,765,174,718,182,643,183,578,179,466,170,414,171,361,181,305,202,243,237,214,262,188,291,167,323,149,357,122,421,108,471"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="961,485,1030,511"/>
-<area shape="poly" id="edge30_Node000001_Node000007" title=" " alt="" coords="194,489,945,495,945,500,194,495"/>
-<area shape="rect" id="Node000008" href="$d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" title=" " alt="" coords="724,319,872,360"/>
-<area shape="poly" id="edge31_Node000001_Node000008" title=" " alt="" coords="119,468,170,423,204,400,241,382,301,362,364,348,491,331,610,326,708,329,708,334,610,331,491,336,365,353,303,367,243,387,207,405,174,427,122,472"/>
-<area shape="rect" id="Node000011" href="$d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec" title=" " alt="" coords="489,612,662,637"/>
-<area shape="poly" id="edge13_Node000001_Node000011" title=" " alt="" coords="195,506,310,531,435,565,533,603,531,608,433,570,309,536,194,511"/>
-<area shape="rect" id="Node000016" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/duration/duration_cast.html#" title=" " alt="" coords="252,428,424,453"/>
-<area shape="poly" id="edge21_Node000001_Node000016" title=" " alt="" coords="194,469,259,455,260,460,195,474"/>
-<area shape="rect" id="Node000017" href="$d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f" title=" " alt="" coords="717,835,879,876"/>
-<area shape="poly" id="edge23_Node000001_Node000017" title=" " alt="" coords="105,512,113,576,135,665,153,711,176,756,206,796,243,829,277,845,325,856,382,863,447,867,581,866,702,860,702,866,581,872,446,872,382,869,324,861,275,850,240,833,202,800,172,759,148,713,130,666,108,577,99,512"/>
-<area shape="rect" id="Node000022" href="$d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43" title=" " alt="" coords="482,376,669,417"/>
-<area shape="poly" id="edge32_Node000001_Node000022" title=" " alt="" coords="129,468,179,438,241,413,298,400,356,392,466,388,467,394,357,398,299,405,242,418,182,443,131,473"/>
-<area shape="rect" id="Node000023" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="304,580,372,605"/>
-<area shape="poly" id="edge37_Node000001_Node000023" title=" " alt="" coords="141,510,243,558,290,575,288,580,241,563,139,515"/>
-<area shape="rect" id="Node000024" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/high_resolution_clock/now.html#" title=" " alt="" coords="247,630,428,670"/>
-<area shape="poly" id="edge39_Node000001_Node000024" title=" " alt="" coords="121,510,173,562,207,591,243,616,252,620,249,625,240,620,203,595,169,566,117,514"/>
-<area shape="rect" id="Node000025" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="275,694,401,720"/>
-<area shape="poly" id="edge40_Node000001_Node000025" title=" " alt="" coords="113,511,132,548,161,593,198,640,243,680,261,689,259,694,240,684,194,644,156,597,127,550,108,513"/>
-<area shape="rect" id="Node000026" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="280,744,396,769"/>
-<area shape="poly" id="edge41_Node000001_Node000026" title=" " alt="" coords="109,511,126,557,153,617,192,678,216,706,243,730,266,743,264,748,240,735,212,710,188,682,148,619,121,559,104,513"/>
-<area shape="rect" id="Node000027" href="$d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" title=" " alt="" coords="260,793,416,819"/>
-<area shape="poly" id="edge42_Node000001_Node000027" title=" " alt="" coords="107,512,121,566,146,639,164,678,186,715,213,750,243,780,248,783,245,788,240,784,209,753,182,718,160,680,141,641,116,568,102,513"/>
-<area shape="rect" id="Node000028" href="$d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a" title=" " alt="" coords="482,276,669,301"/>
-<area shape="poly" id="edge43_Node000001_Node000028" title=" " alt="" coords="109,469,128,435,157,393,195,351,240,318,295,296,354,283,412,277,466,276,466,281,412,282,355,288,297,301,243,323,198,355,161,396,133,438,113,472"/>
-<area shape="rect" id="Node000029" href="$d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e" title=" " alt="" coords="253,894,422,934"/>
-<area shape="poly" id="edge46_Node000001_Node000029" title=" " alt="" coords="105,512,115,580,138,676,156,729,179,781,208,830,244,873,255,883,251,887,240,877,204,833,175,783,151,731,133,678,110,581,100,513"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="434,65,479,53,481,58,435,70"/>
-<area shape="rect" id="Node000004" 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="488,80,663,105"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="434,90,472,90,472,95,434,95"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="388,119,541,211,538,215,385,123"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="605,218,661,198,733,182,771,179,810,182,847,192,880,210,897,227,906,246,909,285,910,324,916,344,929,363,947,376,944,381,925,366,911,346,904,325,903,285,901,247,893,231,877,215,845,197,809,187,771,185,734,187,662,203,607,223"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="664,227,726,227,788,230,843,239,864,246,880,254,898,273,908,291,913,311,914,330,915,371,919,393,929,417,949,446,971,472,967,476,945,450,924,419,914,395,910,372,909,330,907,311,903,293,894,276,877,259,862,250,842,244,788,236,725,232,664,233"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="634,245,671,261,686,272,696,283,705,294,719,305,726,309,723,314,716,309,701,298,692,287,682,276,668,266,632,250"/>
-<area shape="rect" id="Node000010" 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="721,269,875,295"/>
-<area shape="poly" id="edge11_Node000005_Node000010" title=" " alt="" coords="639,245,721,263,720,268,638,250"/>
-<area shape="poly" id="edge8_Node000008_Node000006" title=" " alt="" coords="873,357,946,377,944,382,872,362"/>
-<area shape="poly" id="edge9_Node000008_Node000007" title=" " alt="" coords="826,358,968,473,964,477,823,362"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="942,326,1049,352"/>
-<area shape="poly" id="edge10_Node000008_Node000009" title=" " alt="" coords="872,337,926,337,926,342,872,342"/>
-<area shape="poly" id="edge17_Node000011_Node000006" title=" " alt="" coords="600,609,956,411,958,416,603,613"/>
-<area shape="poly" id="edge18_Node000011_Node000007" title=" " alt="" coords="662,614,767,596,823,583,878,565,923,543,963,518,966,522,926,547,880,570,825,588,768,602,663,619"/>
-<area shape="poly" id="edge19_Node000011_Node000008" title=" " alt="" coords="585,610,770,370,774,373,589,613"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="759,686,837,712"/>
-<area shape="poly" id="edge14_Node000011_Node000012" title=" " alt="" coords="613,636,718,673,744,681,743,686,716,678,612,641"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/distance.html#" title=" " alt="" coords="750,736,846,761"/>
-<area shape="poly" id="edge15_Node000011_Node000013" title=" " alt="" coords="594,636,647,678,682,701,719,722,736,730,734,735,716,727,679,706,644,682,590,640"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="764,785,832,811"/>
-<area shape="poly" id="edge16_Node000011_Node000014" title=" " alt="" coords="588,636,638,701,676,739,719,772,750,785,748,790,716,776,672,743,634,705,584,640"/>
-<area shape="rect" id="Node000015" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max_element.html#" title=" " alt="" coords="735,637,861,663"/>
-<area shape="poly" id="edge20_Node000011_Node000015" title=" " alt="" coords="663,632,720,638,719,644,662,637"/>
-<area shape="poly" id="edge24_Node000017_Node000006" title=" " alt="" coords="865,832,877,822,903,777,915,736,917,696,912,656,906,614,903,571,908,523,924,471,943,440,966,414,970,418,948,443,929,474,913,524,908,571,912,614,918,655,922,696,921,737,908,780,881,825,869,836"/>
-<area shape="poly" id="edge25_Node000017_Node000007" title=" " alt="" coords="863,832,877,821,893,799,909,767,940,683,985,525,990,526,945,685,914,769,897,802,881,825,867,836"/>
-<area shape="rect" id="Node000018" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/system_clock/now.html#" title=" " alt="" coords="927,806,1064,846"/>
-<area shape="poly" id="edge26_Node000017_Node000018" title=" " alt="" coords="879,841,911,836,912,841,879,846"/>
-<area shape="rect" id="Node000019" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="959,870,1032,896"/>
-<area shape="poly" id="edge27_Node000017_Node000019" title=" " alt="" coords="879,864,944,873,943,879,879,869"/>
-<area shape="rect" id="Node000020" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="956,920,1035,945"/>
-<area shape="poly" id="edge28_Node000017_Node000020" title=" " alt="" coords="848,874,928,906,942,911,940,916,926,911,846,879"/>
-<area shape="rect" id="Node000021" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="956,756,1034,781"/>
-<area shape="poly" id="edge29_Node000017_Node000021" title=" " alt="" coords="853,832,877,821,925,792,940,785,943,790,928,796,880,826,856,837"/>
-<area shape="poly" id="edge33_Node000022_Node000006" title=" " alt="" coords="670,393,944,390,944,396,670,398"/>
-<area shape="poly" id="edge34_Node000022_Node000007" title=" " alt="" coords="664,415,947,484,945,489,663,420"/>
-<area shape="poly" id="edge35_Node000022_Node000008" title=" " alt="" coords="656,373,708,360,709,365,658,378"/>
-<area shape="poly" id="edge36_Node000022_Node000010" title=" " alt="" coords="603,374,654,339,716,305,732,298,734,303,719,310,657,344,606,378"/>
-<area shape="poly" id="edge44_Node000028_Node000008" title=" " alt="" coords="636,299,709,316,708,322,635,305"/>
-<area shape="poly" id="edge45_Node000028_Node000010" title=" " alt="" coords="669,283,705,282,705,287,670,288"/>
-</map>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph.md5 b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph.md5
deleted file mode 100644
index cbdea01af..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6ea2ef462d7f61f6705629ad42e26b79
\ No newline at end of file
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph.svg
deleted file mode 100644
index a428b4c4b..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph.svg
+++ /dev/null
@@ -1,780 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::fit Pages: 1 -->
-<!--zoomable 713 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 802;
-var viewHeight = 713;
-var sectionId = 'dynsection-7';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>machine_learning::neural_network::NeuralNetwork::fit</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="141.25,-355.88 0,-355.88 0,-325.38 141.25,-325.38 141.25,-355.88"/>
-<text text-anchor="start" x="8" y="-342.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="middle" x="70.62" y="-331.12" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork::fit</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321.5,-660.5 177.25,-660.5 177.25,-618.75 321.5,-618.75 321.5,-660.5"/>
-<text text-anchor="start" x="185.25" y="-647" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="185.25" y="-635.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="249.38" y="-624.5" font-family="Helvetica,sans-Serif" font-size="10.00">::__detailed_single_prediction</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.86,-356.08C80.98,-400.26 106.98,-528.74 177.25,-604.62 179.61,-607.17 182.19,-609.55 184.92,-611.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.73,-614.51 192.89,-617.49 186.81,-608.82 182.73,-614.51"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="488.25,-700.88 367.25,-700.88 367.25,-670.38 488.25,-670.38 488.25,-700.88"/>
-<text text-anchor="start" x="375.25" y="-687.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::apply</text>
-<text text-anchor="middle" x="427.75" y="-676.12" font-family="Helvetica,sans-Serif" font-size="10.00">_function</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge12_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge12_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.08,-356C70.09,-409.68 74.81,-589.78 177.25,-669.62 227.19,-708.55 301.23,-708.31 355.68,-700.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="356.12,-704.37 365.5,-699.44 355.09,-697.45 356.12,-704.37"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="493.5,-543.25 362,-543.25 362,-524 493.5,-524 493.5,-543.25"/>
-<text text-anchor="middle" x="427.75" y="-529.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge38_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge38_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.91,-355.93C88.99,-388.37 121.91,-463.9 177.25,-498.62 228.77,-530.95 297.93,-538.49 350.37,-538.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.14,-542.13 360.11,-538.56 350.09,-535.13 350.14,-542.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="769.25,-424.25 715.75,-424.25 715.75,-405 769.25,-405 769.25,-424.25"/>
-<text text-anchor="middle" x="742.5" y="-410.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge22_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge22_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.09,-356.36C84.31,-394.04 113.18,-489.5 177.25,-532.62 309.69,-621.78 374.62,-565.28 534,-574.62 587.69,-577.77 612.47,-607.54 655,-574.62 705.47,-535.56 649.16,-483.81 691,-435.62 694.83,-431.21 699.74,-427.71 704.99,-424.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="706.14,-428.24 713.91,-421.04 703.34,-421.83 706.14,-428.24"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="768.12,-345.25 716.88,-345.25 716.88,-326 768.12,-326 768.12,-345.25"/>
-<text text-anchor="middle" x="742.5" y="-331.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge30_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge30_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.73,-340.1C283.07,-339.05 597.85,-336.7 704.98,-335.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="704.94,-339.4 714.91,-335.82 704.88,-332.4 704.94,-339.4"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="650.12,-469.88 538.88,-469.88 538.88,-439.38 650.12,-439.38 650.12,-469.88"/>
-<text text-anchor="start" x="546.88" y="-456.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="594.5" y="-445.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge31_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge31_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.34,-356.24C105.32,-375.23 140.3,-406.48 177.25,-420.62 294.14,-465.38 442.67,-465.23 527.01,-460.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="527.2,-463.89 536.96,-459.78 526.76,-456.9 527.2,-463.89"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="492.75,-250.25 362.75,-250.25 362.75,-231 492.75,-231 492.75,-250.25"/>
-<text text-anchor="middle" x="427.75" y="-236.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::argmax</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge13_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge13_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.65,-327.84C192.2,-317.85 261.78,-302.5 321.5,-283.62 346.71,-275.66 374.35,-264.26 394.97,-255.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.27,-258.45 403.98,-251.19 393.42,-252.06 396.27,-258.45"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="314,-388.25 184.75,-388.25 184.75,-369 314,-369 314,-388.25"/>
-<text text-anchor="middle" x="249.38" y="-374.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::duration_cast</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge21_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge21_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.74,-355.7C157.87,-359.17 174.85,-362.82 190.4,-366.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.45,-369.54 199.96,-368.22 190.92,-362.69 189.45,-369.54"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="655,-82.88 534,-82.88 534,-52.38 655,-52.38 655,-82.88"/>
-<text text-anchor="start" x="542" y="-69.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::equal</text>
-<text text-anchor="middle" x="594.5" y="-58.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge23_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge23_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.59,-325.13C76.37,-279.24 94.42,-143.6 177.25,-85.62 231.08,-47.95 418.17,-54.68 522.25,-61.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="521.86,-65.25 532.08,-62.46 522.35,-58.27 521.86,-65.25"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a xlink:href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="498,-426.88 357.5,-426.88 357.5,-396.38 498,-396.38 498,-426.88"/>
-<text text-anchor="start" x="365.5" y="-413.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::hadamard</text>
-<text text-anchor="middle" x="427.75" y="-402.12" font-family="Helvetica,sans-Serif" font-size="10.00">_product</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node22 -->
-<g id="edge32_Node000001_Node000022" class="edge">
-<title>Node1&#45;&gt;Node22</title>
-<g id="a_edge32_Node000001_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.46,-356.14C114,-369.8 146.17,-388.84 177.25,-397.62 232.06,-413.12 296.26,-416.4 345.81,-415.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.66,-419.43 355.6,-415.77 345.55,-412.43 345.66,-419.43"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275,-274.25 223.75,-274.25 223.75,-255 275,-255 275,-274.25"/>
-<text text-anchor="middle" x="249.38" y="-260.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node23 -->
-<g id="edge37_Node000001_Node000023" class="edge">
-<title>Node1&#45;&gt;Node23</title>
-<g id="a_edge37_Node000001_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.74,-325C121.69,-314.07 150.8,-299.54 177.25,-288.62 188.54,-283.96 201.1,-279.5 212.49,-275.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.52,-279.05 221.95,-272.63 211.36,-272.4 213.52,-279.05"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="317.38,-236.88 181.38,-236.88 181.38,-206.38 317.38,-206.38 317.38,-236.88"/>
-<text text-anchor="start" x="189.38" y="-223.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::high_resolution</text>
-<text text-anchor="middle" x="249.38" y="-212.12" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node24 -->
-<g id="edge39_Node000001_Node000024" class="edge">
-<title>Node1&#45;&gt;Node24</title>
-<g id="a_edge39_Node000001_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.14,-325.01C103.9,-304.22 139.77,-267.53 177.25,-245.62 179.4,-244.37 181.62,-243.17 183.9,-242.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.13,-245.3 192.76,-237.95 182.21,-238.94 185.13,-245.3"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.75,-188.25 202,-188.25 202,-169 296.75,-169 296.75,-188.25"/>
-<text text-anchor="middle" x="249.38" y="-174.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node25 -->
-<g id="edge40_Node000001_Node000025" class="edge">
-<title>Node1&#45;&gt;Node25</title>
-<g id="a_edge40_Node000001_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M78.72,-325C92.98,-295.4 128.01,-231.15 177.25,-197.62 181.46,-194.76 186.09,-192.32 190.9,-190.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.05,-193.56 200.21,-186.81 189.62,-186.99 192.05,-193.56"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.62,-151.25 206.12,-151.25 206.12,-132 292.62,-132 292.62,-151.25"/>
-<text text-anchor="middle" x="249.38" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node26 -->
-<g id="edge41_Node000001_Node000026" class="edge">
-<title>Node1&#45;&gt;Node26</title>
-<g id="a_edge41_Node000001_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.15,-324.98C87.19,-289.67 118.97,-203.49 177.25,-159.62 182.53,-155.65 188.59,-152.55 194.9,-150.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.78,-153.52 204.22,-147.13 193.63,-146.86 195.78,-153.52"/>
-</a>
-</g>
-</g>
-<!-- Node27 -->
-<g id="Node000027" class="node">
-<title>Node27</title>
-<g id="a_Node000027"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="307.62,-114.25 191.12,-114.25 191.12,-95 307.62,-95 307.62,-114.25"/>
-<text text-anchor="middle" x="249.38" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node27 -->
-<g id="edge42_Node000001_Node000027" class="edge">
-<title>Node1&#45;&gt;Node27</title>
-<g id="a_edge42_Node000001_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.51,-324.9C82.75,-284.64 110.25,-177.22 177.25,-122.62 178.39,-121.7 179.57,-120.82 180.78,-119.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.38,-123.1 189.39,-115.15 178.95,-117 182.38,-123.1"/>
-</a>
-</g>
-</g>
-<!-- Node28 -->
-<g id="Node000028" class="node">
-<title>Node28</title>
-<g id="a_Node000028"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="498,-502.25 357.5,-502.25 357.5,-483 498,-483 498,-502.25"/>
-<text text-anchor="middle" x="427.75" y="-488.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::transpose</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node28 -->
-<g id="edge43_Node000001_Node000028" class="edge">
-<title>Node1&#45;&gt;Node28</title>
-<g id="a_edge43_Node000001_Node000028"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.2,-356.2C93.78,-384.26 128.65,-442.8 177.25,-468.62 228.7,-495.96 294.57,-501.27 345.71,-500.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.65,-503.62 355.53,-499.8 345.42,-496.62 345.65,-503.62"/>
-</a>
-</g>
-</g>
-<!-- Node29 -->
-<g id="Node000029" class="node">
-<title>Node29</title>
-<g id="a_Node000029"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312.88,-38.88 185.88,-38.88 185.88,-8.37 312.88,-8.37 312.88,-38.88"/>
-<text text-anchor="start" x="193.88" y="-25.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::zeroes</text>
-<text text-anchor="middle" x="249.38" y="-14.12" font-family="Helvetica,sans-Serif" font-size="10.00">_initialization</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node29 -->
-<g id="edge46_Node000001_Node000029" class="edge">
-<title>Node1&#45;&gt;Node29</title>
-<g id="a_edge46_Node000001_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73,-324.89C77.96,-277.38 99.03,-133.68 177.25,-52.62 179.84,-49.94 182.72,-47.49 185.79,-45.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.55,-48.29 194.18,-40.03 183.84,-42.35 187.55,-48.29"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.86,-658.27C333.1,-661.2 344.72,-664.23 355.95,-667.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355,-670.53 365.56,-669.67 356.76,-663.75 355,-670.53"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="493.5,-649.25 362,-649.25 362,-630 493.5,-630 493.5,-649.25"/>
-<text text-anchor="middle" x="427.75" y="-635.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.86,-639.62C331.23,-639.62 340.86,-639.62 350.3,-639.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.19,-643.13 360.19,-639.63 350.19,-636.13 350.19,-643.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.64,-618.43C319.6,-598.02 370.18,-567.62 400.66,-549.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="402.11,-552.52 408.87,-544.37 398.5,-546.52 402.11,-552.52"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M450.62,-543.65C494.21,-561.97 593.07,-595.02 655,-549.62 697.86,-518.22 655.12,-474.82 691,-435.62 694.95,-431.31 699.91,-427.86 705.18,-425.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="706.34,-428.42 714.11,-421.22 703.55,-422 706.34,-428.42"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M493.84,-536.68C551.79,-538.01 631,-535.97 655,-516.62 698.69,-481.42 664.38,-445.01 691,-395.62 699.36,-380.12 712.17,-364.95 722.8,-353.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="725.15,-356.35 729.67,-346.77 720.16,-351.45 725.15,-356.35"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.64,-523.54C479.98,-520.42 489.59,-516.49 498,-511.62 516.78,-500.75 515.64,-490.2 534,-478.62 535.8,-477.49 537.67,-476.39 539.57,-475.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="540.72,-478.67 548.04,-471.01 537.54,-472.43 540.72,-478.67"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="652.38,-507.25 536.62,-507.25 536.62,-488 652.38,-488 652.38,-507.25"/>
-<text text-anchor="middle" x="594.5" y="-493.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge11_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge11_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M475.08,-523.5C494.02,-519.36 516.14,-514.53 536.09,-510.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="536.73,-513.61 545.75,-508.06 535.24,-506.77 536.73,-513.61"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge8_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge8_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M650.28,-439.62C668.43,-434.65 688.17,-429.23 704.64,-424.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="705.28,-428.18 714,-422.16 703.43,-421.43 705.28,-428.18"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge9_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge9_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M614.59,-439.07C641.95,-416.77 692.14,-375.86 720.51,-352.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="722.52,-355.61 728.06,-346.58 718.1,-350.18 722.52,-355.61"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="782.75,-464.25 702.25,-464.25 702.25,-445 782.75,-445 782.75,-464.25"/>
-<text text-anchor="middle" x="742.5" y="-450.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge10_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge10_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M650.28,-454.62C663.55,-454.62 677.67,-454.62 690.75,-454.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="690.4,-458.13 700.4,-454.63 690.4,-451.13 690.4,-458.13"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node6 -->
-<g id="edge17_Node000011_Node000006" class="edge">
-<title>Node11&#45;&gt;Node6</title>
-<g id="a_edge17_Node000011_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M446.92,-250.73C499.29,-279.87 650.85,-364.19 713.69,-399.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="711.91,-402.17 722.35,-403.97 715.31,-396.05 711.91,-402.17"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node7 -->
-<g id="edge18_Node000011_Node000007" class="edge">
-<title>Node11&#45;&gt;Node7</title>
-<g id="a_edge18_Node000011_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M492.81,-246.69C539.04,-252.52 602.33,-263.53 655,-283.62 678.26,-292.5 702.35,-307.55 719.19,-319.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="716.78,-321.76 726.96,-324.68 720.82,-316.05 716.78,-321.76"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node8 -->
-<g id="edge19_Node000011_Node000008" class="edge">
-<title>Node11&#45;&gt;Node8</title>
-<g id="a_edge19_Node000011_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M436.48,-250.66C461.17,-282.74 538.71,-383.45 574.74,-430.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="571.77,-432.14 580.65,-437.93 577.32,-427.87 571.77,-432.14"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="623.88,-194.25 565.12,-194.25 565.12,-175 623.88,-175 623.88,-194.25"/>
-<text text-anchor="middle" x="594.5" y="-180.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge14_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge14_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M455.44,-230.55C476.63,-222.66 507.08,-211.55 534,-202.62 540.37,-200.51 547.15,-198.37 553.77,-196.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="554.66,-199.72 563.2,-193.46 552.62,-193.02 554.66,-199.72"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="630.62,-157.25 558.38,-157.25 558.38,-138 630.62,-138 630.62,-157.25"/>
-<text text-anchor="middle" x="594.5" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node13 -->
-<g id="edge15_Node000011_Node000013" class="edge">
-<title>Node11&#45;&gt;Node13</title>
-<g id="a_edge15_Node000011_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M439.95,-230.74C458.37,-214.94 496.74,-183.92 534,-165.62 538.25,-163.54 542.79,-161.64 547.4,-159.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="548.4,-163.28 556.73,-156.74 546.14,-156.65 548.4,-163.28"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="620.12,-120.25 568.88,-120.25 568.88,-101 620.12,-101 620.12,-120.25"/>
-<text text-anchor="middle" x="594.5" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node14 -->
-<g id="edge16_Node000011_Node000014" class="edge">
-<title>Node11&#45;&gt;Node14</title>
-<g id="a_edge16_Node000011_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M435.37,-230.6C450.31,-208.76 488.87,-156.61 534,-128.62 541.19,-124.17 549.55,-120.75 557.7,-118.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="558.4,-121.6 567.08,-115.52 556.51,-114.86 558.4,-121.6"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="641.5,-231.25 547.5,-231.25 547.5,-212 641.5,-212 641.5,-231.25"/>
-<text text-anchor="middle" x="594.5" y="-217.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node15 -->
-<g id="edge20_Node000011_Node000015" class="edge">
-<title>Node11&#45;&gt;Node15</title>
-<g id="a_edge20_Node000011_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M492.92,-233.22C507.04,-231.6 521.9,-229.88 535.75,-228.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="536.06,-231.77 545.6,-227.15 535.26,-224.82 536.06,-231.77"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node6 -->
-<g id="edge24_Node000017_Node000006" class="edge">
-<title>Node17&#45;&gt;Node6</title>
-<g id="a_edge24_Node000017_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M646.34,-83.33C649.59,-85.71 652.54,-88.46 655,-91.62 727.49,-184.7 643.13,-246.8 691,-354.62 698.15,-370.73 710.97,-385.88 721.91,-396.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="719.41,-399.39 729.04,-403.8 724.27,-394.35 719.41,-399.39"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node7 -->
-<g id="edge25_Node000017_Node000007" class="edge">
-<title>Node17&#45;&gt;Node7</title>
-<g id="a_edge25_Node000017_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M644.8,-83.36C648.52,-85.75 651.99,-88.49 655,-91.62 686.95,-124.97 723.35,-262.04 736.46,-314.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="733.01,-315.41 738.79,-324.29 739.81,-313.75 733.01,-315.41"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="794,-104.88 691,-104.88 691,-74.38 794,-74.38 794,-104.88"/>
-<text text-anchor="start" x="699" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::system</text>
-<text text-anchor="middle" x="742.5" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge26_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge26_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M655.31,-76.64C663.33,-77.85 671.58,-79.09 679.65,-80.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="678.97,-83.74 689.38,-81.77 680.02,-76.82 678.97,-83.74"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="769.62,-56.25 715.38,-56.25 715.38,-37 769.62,-37 769.62,-56.25"/>
-<text text-anchor="middle" x="742.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node19 -->
-<g id="edge27_Node000017_Node000019" class="edge">
-<title>Node17&#45;&gt;Node19</title>
-<g id="a_edge27_Node000017_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M655.31,-59.02C671.71,-56.66 689.03,-54.17 703.81,-52.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="704.16,-55.53 713.56,-50.64 703.16,-48.6 704.16,-55.53"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="772.25,-19.25 712.75,-19.25 712.75,0 772.25,0 772.25,-19.25"/>
-<text text-anchor="middle" x="742.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node20 -->
-<g id="edge28_Node000017_Node000020" class="edge">
-<title>Node17&#45;&gt;Node20</title>
-<g id="a_edge28_Node000017_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M631.59,-51.96C649.39,-44.38 671.22,-35.29 691,-27.62 694.43,-26.3 698,-24.95 701.59,-23.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="702.67,-26.96 710.87,-20.25 700.28,-20.38 702.67,-26.96"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="771.88,-142.25 713.12,-142.25 713.12,-123 771.88,-123 771.88,-142.25"/>
-<text text-anchor="middle" x="742.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node21 -->
-<g id="edge29_Node000017_Node000021" class="edge">
-<title>Node17&#45;&gt;Node21</title>
-<g id="a_edge29_Node000017_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M636.86,-83.28C643.02,-85.9 649.23,-88.72 655,-91.62 671.75,-100.05 674.15,-105.4 691,-113.62 694.56,-115.36 698.32,-117.04 702.12,-118.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="700.8,-121.88 711.38,-122.33 703.39,-115.38 700.8,-121.88"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node6 -->
-<g id="edge33_Node000022_Node000006" class="edge">
-<title>Node22&#45;&gt;Node6</title>
-<g id="a_edge33_Node000022_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M498.16,-412.29C561.63,-412.9 653.14,-413.78 703.93,-414.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="703.78,-417.76 713.81,-414.36 703.85,-410.76 703.78,-417.76"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node7 -->
-<g id="edge34_Node000022_Node000007" class="edge">
-<title>Node22&#45;&gt;Node7</title>
-<g id="a_edge34_Node000022_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M493.55,-395.88C557.76,-380.28 653.77,-356.94 705.46,-344.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="706.03,-347.85 714.92,-342.08 704.38,-341.04 706.03,-347.85"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node8 -->
-<g id="edge35_Node000022_Node000008" class="edge">
-<title>Node22&#45;&gt;Node8</title>
-<g id="a_edge35_Node000022_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M488.69,-427.27C501.29,-430.56 514.64,-434.04 527.45,-437.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="526.5,-440.76 537.06,-439.89 528.27,-433.98 526.5,-440.76"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node10 -->
-<g id="edge36_Node000022_Node000010" class="edge">
-<title>Node22&#45;&gt;Node10</title>
-<g id="a_edge36_Node000022_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M449.59,-427.18C470.18,-441.99 503.01,-464.11 534,-478.62 537.81,-480.41 541.83,-482.09 545.91,-483.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="544.73,-486.95 555.32,-487.02 547.08,-480.36 544.73,-486.95"/>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node8 -->
-<g id="edge44_Node000028_Node000008" class="edge">
-<title>Node28&#45;&gt;Node8</title>
-<g id="a_edge44_Node000028_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M472.47,-482.54C489.36,-478.64 509.06,-474.1 527.6,-469.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="528.22,-473.27 537.18,-467.62 526.65,-466.45 528.22,-473.27"/>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node10 -->
-<g id="edge45_Node000028_Node000010" class="edge">
-<title>Node28&#45;&gt;Node10</title>
-<g id="a_edge45_Node000028_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M498.14,-494.73C506.95,-495 515.95,-495.27 524.75,-495.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="524.54,-499.03 534.64,-495.84 524.75,-492.04 524.54,-499.03"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph_org.svg
deleted file mode 100644
index 97f0c5923..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a2be1b52bb9f57486f9a436f35c9089c0_cgraph_org.svg
+++ /dev/null
@@ -1,697 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::fit Pages: 1 -->
-<svg width="802pt" height="713pt"
- viewBox="0.00 0.00 802.00 713.07" 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 709.07)">
-<title>machine_learning::neural_network::NeuralNetwork::fit</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="141.25,-355.88 0,-355.88 0,-325.38 141.25,-325.38 141.25,-355.88"/>
-<text text-anchor="start" x="8" y="-342.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="middle" x="70.62" y="-331.12" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork::fit</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321.5,-660.5 177.25,-660.5 177.25,-618.75 321.5,-618.75 321.5,-660.5"/>
-<text text-anchor="start" x="185.25" y="-647" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="185.25" y="-635.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="249.38" y="-624.5" font-family="Helvetica,sans-Serif" font-size="10.00">::__detailed_single_prediction</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.86,-356.08C80.98,-400.26 106.98,-528.74 177.25,-604.62 179.61,-607.17 182.19,-609.55 184.92,-611.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.73,-614.51 192.89,-617.49 186.81,-608.82 182.73,-614.51"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="488.25,-700.88 367.25,-700.88 367.25,-670.38 488.25,-670.38 488.25,-700.88"/>
-<text text-anchor="start" x="375.25" y="-687.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::apply</text>
-<text text-anchor="middle" x="427.75" y="-676.12" font-family="Helvetica,sans-Serif" font-size="10.00">_function</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge12_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge12_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.08,-356C70.09,-409.68 74.81,-589.78 177.25,-669.62 227.19,-708.55 301.23,-708.31 355.68,-700.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="356.12,-704.37 365.5,-699.44 355.09,-697.45 356.12,-704.37"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="493.5,-543.25 362,-543.25 362,-524 493.5,-524 493.5,-543.25"/>
-<text text-anchor="middle" x="427.75" y="-529.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge38_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge38_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.91,-355.93C88.99,-388.37 121.91,-463.9 177.25,-498.62 228.77,-530.95 297.93,-538.49 350.37,-538.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.14,-542.13 360.11,-538.56 350.09,-535.13 350.14,-542.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="769.25,-424.25 715.75,-424.25 715.75,-405 769.25,-405 769.25,-424.25"/>
-<text text-anchor="middle" x="742.5" y="-410.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge22_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge22_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.09,-356.36C84.31,-394.04 113.18,-489.5 177.25,-532.62 309.69,-621.78 374.62,-565.28 534,-574.62 587.69,-577.77 612.47,-607.54 655,-574.62 705.47,-535.56 649.16,-483.81 691,-435.62 694.83,-431.21 699.74,-427.71 704.99,-424.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="706.14,-428.24 713.91,-421.04 703.34,-421.83 706.14,-428.24"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="768.12,-345.25 716.88,-345.25 716.88,-326 768.12,-326 768.12,-345.25"/>
-<text text-anchor="middle" x="742.5" y="-331.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge30_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge30_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.73,-340.1C283.07,-339.05 597.85,-336.7 704.98,-335.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="704.94,-339.4 714.91,-335.82 704.88,-332.4 704.94,-339.4"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="650.12,-469.88 538.88,-469.88 538.88,-439.38 650.12,-439.38 650.12,-469.88"/>
-<text text-anchor="start" x="546.88" y="-456.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="594.5" y="-445.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge31_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge31_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.34,-356.24C105.32,-375.23 140.3,-406.48 177.25,-420.62 294.14,-465.38 442.67,-465.23 527.01,-460.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="527.2,-463.89 536.96,-459.78 526.76,-456.9 527.2,-463.89"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="492.75,-250.25 362.75,-250.25 362.75,-231 492.75,-231 492.75,-250.25"/>
-<text text-anchor="middle" x="427.75" y="-236.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::argmax</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge13_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge13_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.65,-327.84C192.2,-317.85 261.78,-302.5 321.5,-283.62 346.71,-275.66 374.35,-264.26 394.97,-255.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.27,-258.45 403.98,-251.19 393.42,-252.06 396.27,-258.45"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="314,-388.25 184.75,-388.25 184.75,-369 314,-369 314,-388.25"/>
-<text text-anchor="middle" x="249.38" y="-374.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::duration_cast</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge21_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge21_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.74,-355.7C157.87,-359.17 174.85,-362.82 190.4,-366.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.45,-369.54 199.96,-368.22 190.92,-362.69 189.45,-369.54"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="655,-82.88 534,-82.88 534,-52.38 655,-52.38 655,-82.88"/>
-<text text-anchor="start" x="542" y="-69.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::equal</text>
-<text text-anchor="middle" x="594.5" y="-58.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge23_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge23_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.59,-325.13C76.37,-279.24 94.42,-143.6 177.25,-85.62 231.08,-47.95 418.17,-54.68 522.25,-61.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="521.86,-65.25 532.08,-62.46 522.35,-58.27 521.86,-65.25"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a xlink:href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="498,-426.88 357.5,-426.88 357.5,-396.38 498,-396.38 498,-426.88"/>
-<text text-anchor="start" x="365.5" y="-413.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::hadamard</text>
-<text text-anchor="middle" x="427.75" y="-402.12" font-family="Helvetica,sans-Serif" font-size="10.00">_product</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node22 -->
-<g id="edge32_Node000001_Node000022" class="edge">
-<title>Node1&#45;&gt;Node22</title>
-<g id="a_edge32_Node000001_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.46,-356.14C114,-369.8 146.17,-388.84 177.25,-397.62 232.06,-413.12 296.26,-416.4 345.81,-415.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.66,-419.43 355.6,-415.77 345.55,-412.43 345.66,-419.43"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275,-274.25 223.75,-274.25 223.75,-255 275,-255 275,-274.25"/>
-<text text-anchor="middle" x="249.38" y="-260.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node23 -->
-<g id="edge37_Node000001_Node000023" class="edge">
-<title>Node1&#45;&gt;Node23</title>
-<g id="a_edge37_Node000001_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.74,-325C121.69,-314.07 150.8,-299.54 177.25,-288.62 188.54,-283.96 201.1,-279.5 212.49,-275.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.52,-279.05 221.95,-272.63 211.36,-272.4 213.52,-279.05"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="317.38,-236.88 181.38,-236.88 181.38,-206.38 317.38,-206.38 317.38,-236.88"/>
-<text text-anchor="start" x="189.38" y="-223.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::high_resolution</text>
-<text text-anchor="middle" x="249.38" y="-212.12" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node24 -->
-<g id="edge39_Node000001_Node000024" class="edge">
-<title>Node1&#45;&gt;Node24</title>
-<g id="a_edge39_Node000001_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.14,-325.01C103.9,-304.22 139.77,-267.53 177.25,-245.62 179.4,-244.37 181.62,-243.17 183.9,-242.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.13,-245.3 192.76,-237.95 182.21,-238.94 185.13,-245.3"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.75,-188.25 202,-188.25 202,-169 296.75,-169 296.75,-188.25"/>
-<text text-anchor="middle" x="249.38" y="-174.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node25 -->
-<g id="edge40_Node000001_Node000025" class="edge">
-<title>Node1&#45;&gt;Node25</title>
-<g id="a_edge40_Node000001_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M78.72,-325C92.98,-295.4 128.01,-231.15 177.25,-197.62 181.46,-194.76 186.09,-192.32 190.9,-190.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.05,-193.56 200.21,-186.81 189.62,-186.99 192.05,-193.56"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.62,-151.25 206.12,-151.25 206.12,-132 292.62,-132 292.62,-151.25"/>
-<text text-anchor="middle" x="249.38" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node26 -->
-<g id="edge41_Node000001_Node000026" class="edge">
-<title>Node1&#45;&gt;Node26</title>
-<g id="a_edge41_Node000001_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.15,-324.98C87.19,-289.67 118.97,-203.49 177.25,-159.62 182.53,-155.65 188.59,-152.55 194.9,-150.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.78,-153.52 204.22,-147.13 193.63,-146.86 195.78,-153.52"/>
-</a>
-</g>
-</g>
-<!-- Node27 -->
-<g id="Node000027" class="node">
-<title>Node27</title>
-<g id="a_Node000027"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="307.62,-114.25 191.12,-114.25 191.12,-95 307.62,-95 307.62,-114.25"/>
-<text text-anchor="middle" x="249.38" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node27 -->
-<g id="edge42_Node000001_Node000027" class="edge">
-<title>Node1&#45;&gt;Node27</title>
-<g id="a_edge42_Node000001_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.51,-324.9C82.75,-284.64 110.25,-177.22 177.25,-122.62 178.39,-121.7 179.57,-120.82 180.78,-119.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.38,-123.1 189.39,-115.15 178.95,-117 182.38,-123.1"/>
-</a>
-</g>
-</g>
-<!-- Node28 -->
-<g id="Node000028" class="node">
-<title>Node28</title>
-<g id="a_Node000028"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="498,-502.25 357.5,-502.25 357.5,-483 498,-483 498,-502.25"/>
-<text text-anchor="middle" x="427.75" y="-488.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::transpose</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node28 -->
-<g id="edge43_Node000001_Node000028" class="edge">
-<title>Node1&#45;&gt;Node28</title>
-<g id="a_edge43_Node000001_Node000028"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.2,-356.2C93.78,-384.26 128.65,-442.8 177.25,-468.62 228.7,-495.96 294.57,-501.27 345.71,-500.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.65,-503.62 355.53,-499.8 345.42,-496.62 345.65,-503.62"/>
-</a>
-</g>
-</g>
-<!-- Node29 -->
-<g id="Node000029" class="node">
-<title>Node29</title>
-<g id="a_Node000029"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312.88,-38.88 185.88,-38.88 185.88,-8.37 312.88,-8.37 312.88,-38.88"/>
-<text text-anchor="start" x="193.88" y="-25.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::zeroes</text>
-<text text-anchor="middle" x="249.38" y="-14.12" font-family="Helvetica,sans-Serif" font-size="10.00">_initialization</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node29 -->
-<g id="edge46_Node000001_Node000029" class="edge">
-<title>Node1&#45;&gt;Node29</title>
-<g id="a_edge46_Node000001_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73,-324.89C77.96,-277.38 99.03,-133.68 177.25,-52.62 179.84,-49.94 182.72,-47.49 185.79,-45.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.55,-48.29 194.18,-40.03 183.84,-42.35 187.55,-48.29"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.86,-658.27C333.1,-661.2 344.72,-664.23 355.95,-667.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355,-670.53 365.56,-669.67 356.76,-663.75 355,-670.53"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="493.5,-649.25 362,-649.25 362,-630 493.5,-630 493.5,-649.25"/>
-<text text-anchor="middle" x="427.75" y="-635.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.86,-639.62C331.23,-639.62 340.86,-639.62 350.3,-639.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.19,-643.13 360.19,-639.63 350.19,-636.13 350.19,-643.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.64,-618.43C319.6,-598.02 370.18,-567.62 400.66,-549.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="402.11,-552.52 408.87,-544.37 398.5,-546.52 402.11,-552.52"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M450.62,-543.65C494.21,-561.97 593.07,-595.02 655,-549.62 697.86,-518.22 655.12,-474.82 691,-435.62 694.95,-431.31 699.91,-427.86 705.18,-425.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="706.34,-428.42 714.11,-421.22 703.55,-422 706.34,-428.42"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M493.84,-536.68C551.79,-538.01 631,-535.97 655,-516.62 698.69,-481.42 664.38,-445.01 691,-395.62 699.36,-380.12 712.17,-364.95 722.8,-353.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="725.15,-356.35 729.67,-346.77 720.16,-351.45 725.15,-356.35"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.64,-523.54C479.98,-520.42 489.59,-516.49 498,-511.62 516.78,-500.75 515.64,-490.2 534,-478.62 535.8,-477.49 537.67,-476.39 539.57,-475.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="540.72,-478.67 548.04,-471.01 537.54,-472.43 540.72,-478.67"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="652.38,-507.25 536.62,-507.25 536.62,-488 652.38,-488 652.38,-507.25"/>
-<text text-anchor="middle" x="594.5" y="-493.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge11_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge11_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M475.08,-523.5C494.02,-519.36 516.14,-514.53 536.09,-510.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="536.73,-513.61 545.75,-508.06 535.24,-506.77 536.73,-513.61"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge8_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge8_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M650.28,-439.62C668.43,-434.65 688.17,-429.23 704.64,-424.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="705.28,-428.18 714,-422.16 703.43,-421.43 705.28,-428.18"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge9_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge9_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M614.59,-439.07C641.95,-416.77 692.14,-375.86 720.51,-352.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="722.52,-355.61 728.06,-346.58 718.1,-350.18 722.52,-355.61"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="782.75,-464.25 702.25,-464.25 702.25,-445 782.75,-445 782.75,-464.25"/>
-<text text-anchor="middle" x="742.5" y="-450.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge10_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge10_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M650.28,-454.62C663.55,-454.62 677.67,-454.62 690.75,-454.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="690.4,-458.13 700.4,-454.63 690.4,-451.13 690.4,-458.13"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node6 -->
-<g id="edge17_Node000011_Node000006" class="edge">
-<title>Node11&#45;&gt;Node6</title>
-<g id="a_edge17_Node000011_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M446.92,-250.73C499.29,-279.87 650.85,-364.19 713.69,-399.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="711.91,-402.17 722.35,-403.97 715.31,-396.05 711.91,-402.17"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node7 -->
-<g id="edge18_Node000011_Node000007" class="edge">
-<title>Node11&#45;&gt;Node7</title>
-<g id="a_edge18_Node000011_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M492.81,-246.69C539.04,-252.52 602.33,-263.53 655,-283.62 678.26,-292.5 702.35,-307.55 719.19,-319.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="716.78,-321.76 726.96,-324.68 720.82,-316.05 716.78,-321.76"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node8 -->
-<g id="edge19_Node000011_Node000008" class="edge">
-<title>Node11&#45;&gt;Node8</title>
-<g id="a_edge19_Node000011_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M436.48,-250.66C461.17,-282.74 538.71,-383.45 574.74,-430.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="571.77,-432.14 580.65,-437.93 577.32,-427.87 571.77,-432.14"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="623.88,-194.25 565.12,-194.25 565.12,-175 623.88,-175 623.88,-194.25"/>
-<text text-anchor="middle" x="594.5" y="-180.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge14_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge14_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M455.44,-230.55C476.63,-222.66 507.08,-211.55 534,-202.62 540.37,-200.51 547.15,-198.37 553.77,-196.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="554.66,-199.72 563.2,-193.46 552.62,-193.02 554.66,-199.72"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="630.62,-157.25 558.38,-157.25 558.38,-138 630.62,-138 630.62,-157.25"/>
-<text text-anchor="middle" x="594.5" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node13 -->
-<g id="edge15_Node000011_Node000013" class="edge">
-<title>Node11&#45;&gt;Node13</title>
-<g id="a_edge15_Node000011_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M439.95,-230.74C458.37,-214.94 496.74,-183.92 534,-165.62 538.25,-163.54 542.79,-161.64 547.4,-159.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="548.4,-163.28 556.73,-156.74 546.14,-156.65 548.4,-163.28"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="620.12,-120.25 568.88,-120.25 568.88,-101 620.12,-101 620.12,-120.25"/>
-<text text-anchor="middle" x="594.5" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node14 -->
-<g id="edge16_Node000011_Node000014" class="edge">
-<title>Node11&#45;&gt;Node14</title>
-<g id="a_edge16_Node000011_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M435.37,-230.6C450.31,-208.76 488.87,-156.61 534,-128.62 541.19,-124.17 549.55,-120.75 557.7,-118.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="558.4,-121.6 567.08,-115.52 556.51,-114.86 558.4,-121.6"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="641.5,-231.25 547.5,-231.25 547.5,-212 641.5,-212 641.5,-231.25"/>
-<text text-anchor="middle" x="594.5" y="-217.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node15 -->
-<g id="edge20_Node000011_Node000015" class="edge">
-<title>Node11&#45;&gt;Node15</title>
-<g id="a_edge20_Node000011_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M492.92,-233.22C507.04,-231.6 521.9,-229.88 535.75,-228.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="536.06,-231.77 545.6,-227.15 535.26,-224.82 536.06,-231.77"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node6 -->
-<g id="edge24_Node000017_Node000006" class="edge">
-<title>Node17&#45;&gt;Node6</title>
-<g id="a_edge24_Node000017_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M646.34,-83.33C649.59,-85.71 652.54,-88.46 655,-91.62 727.49,-184.7 643.13,-246.8 691,-354.62 698.15,-370.73 710.97,-385.88 721.91,-396.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="719.41,-399.39 729.04,-403.8 724.27,-394.35 719.41,-399.39"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node7 -->
-<g id="edge25_Node000017_Node000007" class="edge">
-<title>Node17&#45;&gt;Node7</title>
-<g id="a_edge25_Node000017_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M644.8,-83.36C648.52,-85.75 651.99,-88.49 655,-91.62 686.95,-124.97 723.35,-262.04 736.46,-314.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="733.01,-315.41 738.79,-324.29 739.81,-313.75 733.01,-315.41"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="794,-104.88 691,-104.88 691,-74.38 794,-74.38 794,-104.88"/>
-<text text-anchor="start" x="699" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::system</text>
-<text text-anchor="middle" x="742.5" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge26_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge26_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M655.31,-76.64C663.33,-77.85 671.58,-79.09 679.65,-80.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="678.97,-83.74 689.38,-81.77 680.02,-76.82 678.97,-83.74"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="769.62,-56.25 715.38,-56.25 715.38,-37 769.62,-37 769.62,-56.25"/>
-<text text-anchor="middle" x="742.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node19 -->
-<g id="edge27_Node000017_Node000019" class="edge">
-<title>Node17&#45;&gt;Node19</title>
-<g id="a_edge27_Node000017_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M655.31,-59.02C671.71,-56.66 689.03,-54.17 703.81,-52.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="704.16,-55.53 713.56,-50.64 703.16,-48.6 704.16,-55.53"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="772.25,-19.25 712.75,-19.25 712.75,0 772.25,0 772.25,-19.25"/>
-<text text-anchor="middle" x="742.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node20 -->
-<g id="edge28_Node000017_Node000020" class="edge">
-<title>Node17&#45;&gt;Node20</title>
-<g id="a_edge28_Node000017_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M631.59,-51.96C649.39,-44.38 671.22,-35.29 691,-27.62 694.43,-26.3 698,-24.95 701.59,-23.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="702.67,-26.96 710.87,-20.25 700.28,-20.38 702.67,-26.96"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="771.88,-142.25 713.12,-142.25 713.12,-123 771.88,-123 771.88,-142.25"/>
-<text text-anchor="middle" x="742.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node21 -->
-<g id="edge29_Node000017_Node000021" class="edge">
-<title>Node17&#45;&gt;Node21</title>
-<g id="a_edge29_Node000017_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M636.86,-83.28C643.02,-85.9 649.23,-88.72 655,-91.62 671.75,-100.05 674.15,-105.4 691,-113.62 694.56,-115.36 698.32,-117.04 702.12,-118.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="700.8,-121.88 711.38,-122.33 703.39,-115.38 700.8,-121.88"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node6 -->
-<g id="edge33_Node000022_Node000006" class="edge">
-<title>Node22&#45;&gt;Node6</title>
-<g id="a_edge33_Node000022_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M498.16,-412.29C561.63,-412.9 653.14,-413.78 703.93,-414.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="703.78,-417.76 713.81,-414.36 703.85,-410.76 703.78,-417.76"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node7 -->
-<g id="edge34_Node000022_Node000007" class="edge">
-<title>Node22&#45;&gt;Node7</title>
-<g id="a_edge34_Node000022_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M493.55,-395.88C557.76,-380.28 653.77,-356.94 705.46,-344.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="706.03,-347.85 714.92,-342.08 704.38,-341.04 706.03,-347.85"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node8 -->
-<g id="edge35_Node000022_Node000008" class="edge">
-<title>Node22&#45;&gt;Node8</title>
-<g id="a_edge35_Node000022_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M488.69,-427.27C501.29,-430.56 514.64,-434.04 527.45,-437.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="526.5,-440.76 537.06,-439.89 528.27,-433.98 526.5,-440.76"/>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node10 -->
-<g id="edge36_Node000022_Node000010" class="edge">
-<title>Node22&#45;&gt;Node10</title>
-<g id="a_edge36_Node000022_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M449.59,-427.18C470.18,-441.99 503.01,-464.11 534,-478.62 537.81,-480.41 541.83,-482.09 545.91,-483.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="544.73,-486.95 555.32,-487.02 547.08,-480.36 544.73,-486.95"/>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node8 -->
-<g id="edge44_Node000028_Node000008" class="edge">
-<title>Node28&#45;&gt;Node8</title>
-<g id="a_edge44_Node000028_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M472.47,-482.54C489.36,-478.64 509.06,-474.1 527.6,-469.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="528.22,-473.27 537.18,-467.62 526.65,-466.45 528.22,-473.27"/>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node10 -->
-<g id="edge45_Node000028_Node000010" class="edge">
-<title>Node28&#45;&gt;Node10</title>
-<g id="a_edge45_Node000028_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M498.14,-494.73C506.95,-495 515.95,-495.27 524.75,-495.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="524.54,-499.03 534.64,-495.84 524.75,-492.04 524.54,-499.03"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a361a45f3c3d8347d79103bf182d0570b_cgraph.map b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a361a45f3c3d8347d79103bf182d0570b_cgraph.map
deleted file mode 100644
index 1da111ffa..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a361a45f3c3d8347d79103bf182d0570b_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="machine_learning::neural_network::NeuralNetwork::__detailed_single_prediction" name="machine_learning::neural_network::NeuralNetwork::__detailed_single_prediction">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,198,111"/>
-<area shape="rect" id="Node000002" href="$d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" title=" " alt="" coords="253,5,414,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="197,57,237,47,238,52,199,62"/>
-<area shape="rect" id="Node000003" 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="246,70,421,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="198,80,230,80,230,86,198,86"/>
-<area shape="rect" id="Node000004" href="$d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" title=" " alt="" coords="246,120,421,145"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="199,101,255,113,254,118,197,106"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="689,37,761,62"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="394,116,420,106,433,97,443,87,453,77,468,69,521,53,577,45,674,43,674,48,577,50,522,58,470,73,456,81,447,91,437,101,422,111,396,121"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="691,144,759,169"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="422,135,675,151,675,156,421,140"/>
-<area shape="rect" id="Node000007" href="$d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" title=" " alt="" coords="472,83,620,123"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="421,118,456,113,457,118,422,123"/>
-<area shape="rect" id="Node000009" 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="469,198,623,224"/>
-<area shape="poly" id="edge10_Node000004_Node000009" title=" " alt="" coords="371,143,496,190,494,195,369,148"/>
-<area shape="poly" id="edge7_Node000007_Node000005" title=" " alt="" coords="616,80,674,62,676,67,617,85"/>
-<area shape="poly" id="edge8_Node000007_Node000006" title=" " alt="" coords="617,121,677,139,675,144,616,126"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="671,90,779,116"/>
-<area shape="poly" id="edge9_Node000007_Node000008" title=" " alt="" coords="621,100,656,100,656,106,621,106"/>
-</map>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a361a45f3c3d8347d79103bf182d0570b_cgraph.md5 b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a361a45f3c3d8347d79103bf182d0570b_cgraph.md5
deleted file mode 100644
index 317ae6a85..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a361a45f3c3d8347d79103bf182d0570b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-262e70b3746f9510ef2d6588b20ad6dd
\ No newline at end of file
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a361a45f3c3d8347d79103bf182d0570b_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a361a45f3c3d8347d79103bf182d0570b_cgraph.svg
deleted file mode 100644
index e239497bc..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a361a45f3c3d8347d79103bf182d0570b_cgraph.svg
+++ /dev/null
@@ -1,270 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::__detailed_single_prediction Pages: 1 -->
-<!--zoomable 172 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 588;
-var viewHeight = 172;
-var sectionId = 'dynsection-3';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>machine_learning::neural_network::NeuralNetwork::__detailed_single_prediction</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="144.25,-126.5 0,-126.5 0,-84.75 144.25,-84.75 144.25,-126.5"/>
-<text text-anchor="start" x="8" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="72.12" y="-90.5" font-family="Helvetica,sans-Serif" font-size="10.00">::__detailed_single_prediction</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306.5,-163.88 185.5,-163.88 185.5,-133.38 306.5,-133.38 306.5,-163.88"/>
-<text text-anchor="start" x="193.5" y="-150.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::apply</text>
-<text text-anchor="middle" x="246" y="-139.12" font-family="Helvetica,sans-Serif" font-size="10.00">_function</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.52,-123.49C154.31,-125.94 164.35,-128.45 174.12,-130.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173,-134.22 183.55,-133.25 174.7,-127.43 173,-134.22"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="311.75,-115.25 180.25,-115.25 180.25,-96 311.75,-96 311.75,-115.25"/>
-<text text-anchor="middle" x="246" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.52,-105.62C152.39,-105.62 160.43,-105.62 168.36,-105.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.36,-109.13 178.36,-105.63 168.36,-102.13 168.36,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="311.75,-78.25 180.25,-78.25 180.25,-59 311.75,-59 311.75,-78.25"/>
-<text text-anchor="middle" x="246" y="-64.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.52,-90.26C158.65,-87.21 173.31,-84.06 186.92,-81.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.56,-84.57 196.6,-79.04 186.09,-77.73 187.56,-84.57"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="566.5,-140.25 513,-140.25 513,-121 566.5,-121 566.5,-140.25"/>
-<text text-anchor="middle" x="539.75" y="-126.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.09,-78.7C298.85,-80.91 305.6,-83.53 311.75,-86.62 329.86,-95.73 328.87,-107.25 347.75,-114.62 398.17,-134.32 461.64,-135.44 501.21,-133.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="501.38,-137.14 511.17,-133.1 500.99,-130.15 501.38,-137.14"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="565.38,-60.25 514.12,-60.25 514.12,-41 565.38,-41 565.38,-60.25"/>
-<text text-anchor="middle" x="539.75" y="-46.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M312.11,-64.61C370.79,-60.99 454.92,-55.8 502.45,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="502.42,-56.37 512.19,-52.26 501.99,-49.39 502.42,-56.37"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="461.25,-105.88 350,-105.88 350,-75.38 461.25,-75.38 461.25,-105.88"/>
-<text text-anchor="start" x="358" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="405.62" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M312.02,-77.7C320.75,-78.92 329.71,-80.17 338.46,-81.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="337.91,-84.85 348.29,-82.76 338.87,-77.91 337.91,-84.85"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="463.5,-19.25 347.75,-19.25 347.75,0 463.5,0 463.5,-19.25"/>
-<text text-anchor="middle" x="405.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge10_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge10_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M273.74,-58.62C299.44,-49 338.52,-34.37 367.28,-23.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="368.2,-27 376.34,-20.21 365.75,-20.44 368.2,-27"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge7_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge7_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M458.47,-106.32C473.04,-110.73 488.58,-115.44 502.07,-119.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="500.82,-122.8 511.4,-122.35 502.84,-116.1 500.82,-122.8"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge8_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge8_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M458.47,-74.93C473.38,-70.42 489.3,-65.6 503.01,-61.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="503.92,-64.83 512.47,-58.58 501.89,-58.13 503.92,-64.83"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="580,-100.25 499.5,-100.25 499.5,-81 580,-81 580,-100.25"/>
-<text text-anchor="middle" x="539.75" y="-86.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge9_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M461.51,-90.62C470.19,-90.62 479.13,-90.62 487.71,-90.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="487.62,-94.13 497.62,-90.63 487.62,-87.13 487.62,-94.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classmachine__learning_1_1neural__network_1_1_neural_network_a361a45f3c3d8347d79103bf182d0570b_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a361a45f3c3d8347d79103bf182d0570b_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a361a45f3c3d8347d79103bf182d0570b_cgraph_org.svg
deleted file mode 100644
index 70ad32169..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a361a45f3c3d8347d79103bf182d0570b_cgraph_org.svg
+++ /dev/null
@@ -1,187 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::__detailed_single_prediction Pages: 1 -->
-<svg width="588pt" height="172pt"
- viewBox="0.00 0.00 588.00 171.88" 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 167.88)">
-<title>machine_learning::neural_network::NeuralNetwork::__detailed_single_prediction</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="144.25,-126.5 0,-126.5 0,-84.75 144.25,-84.75 144.25,-126.5"/>
-<text text-anchor="start" x="8" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="72.12" y="-90.5" font-family="Helvetica,sans-Serif" font-size="10.00">::__detailed_single_prediction</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306.5,-163.88 185.5,-163.88 185.5,-133.38 306.5,-133.38 306.5,-163.88"/>
-<text text-anchor="start" x="193.5" y="-150.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::apply</text>
-<text text-anchor="middle" x="246" y="-139.12" font-family="Helvetica,sans-Serif" font-size="10.00">_function</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.52,-123.49C154.31,-125.94 164.35,-128.45 174.12,-130.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173,-134.22 183.55,-133.25 174.7,-127.43 173,-134.22"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="311.75,-115.25 180.25,-115.25 180.25,-96 311.75,-96 311.75,-115.25"/>
-<text text-anchor="middle" x="246" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.52,-105.62C152.39,-105.62 160.43,-105.62 168.36,-105.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.36,-109.13 178.36,-105.63 168.36,-102.13 168.36,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="311.75,-78.25 180.25,-78.25 180.25,-59 311.75,-59 311.75,-78.25"/>
-<text text-anchor="middle" x="246" y="-64.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.52,-90.26C158.65,-87.21 173.31,-84.06 186.92,-81.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.56,-84.57 196.6,-79.04 186.09,-77.73 187.56,-84.57"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="566.5,-140.25 513,-140.25 513,-121 566.5,-121 566.5,-140.25"/>
-<text text-anchor="middle" x="539.75" y="-126.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.09,-78.7C298.85,-80.91 305.6,-83.53 311.75,-86.62 329.86,-95.73 328.87,-107.25 347.75,-114.62 398.17,-134.32 461.64,-135.44 501.21,-133.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="501.38,-137.14 511.17,-133.1 500.99,-130.15 501.38,-137.14"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="565.38,-60.25 514.12,-60.25 514.12,-41 565.38,-41 565.38,-60.25"/>
-<text text-anchor="middle" x="539.75" y="-46.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M312.11,-64.61C370.79,-60.99 454.92,-55.8 502.45,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="502.42,-56.37 512.19,-52.26 501.99,-49.39 502.42,-56.37"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="461.25,-105.88 350,-105.88 350,-75.38 461.25,-75.38 461.25,-105.88"/>
-<text text-anchor="start" x="358" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="405.62" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M312.02,-77.7C320.75,-78.92 329.71,-80.17 338.46,-81.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="337.91,-84.85 348.29,-82.76 338.87,-77.91 337.91,-84.85"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="463.5,-19.25 347.75,-19.25 347.75,0 463.5,0 463.5,-19.25"/>
-<text text-anchor="middle" x="405.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge10_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge10_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M273.74,-58.62C299.44,-49 338.52,-34.37 367.28,-23.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="368.2,-27 376.34,-20.21 365.75,-20.44 368.2,-27"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge7_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge7_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M458.47,-106.32C473.04,-110.73 488.58,-115.44 502.07,-119.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="500.82,-122.8 511.4,-122.35 502.84,-116.1 500.82,-122.8"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge8_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge8_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M458.47,-74.93C473.38,-70.42 489.3,-65.6 503.01,-61.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="503.92,-64.83 512.47,-58.58 501.89,-58.13 503.92,-64.83"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="580,-100.25 499.5,-100.25 499.5,-81 580,-81 580,-100.25"/>
-<text text-anchor="middle" x="539.75" y="-86.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge9_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M461.51,-90.62C470.19,-90.62 479.13,-90.62 487.71,-90.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="487.62,-94.13 497.62,-90.63 487.62,-87.13 487.62,-94.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph.map b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph.map
deleted file mode 100644
index f17bb6ae2..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph.map
+++ /dev/null
@@ -1,82 +0,0 @@
-<map id="machine_learning::neural_network::NeuralNetwork::evaluate_from_csv" name="machine_learning::neural_network::NeuralNetwork::evaluate_from_csv">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,522,175,578"/>
-<area shape="rect" id="Node000002" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e" title=" " alt="" coords="223,265,392,321"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="113,520,271,331,275,334,117,524"/>
-<area shape="rect" id="Node000019" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d" title=" " alt="" coords="669,754,838,810"/>
-<area shape="poly" id="edge25_Node000001_Node000019" title=" " alt="" coords="173,576,658,746,656,751,171,581"/>
-<area shape="rect" id="Node000003" href="$d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" title=" " alt="" coords="910,254,1072,294"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="392,291,609,290,895,277,895,283,609,295,392,297"/>
-<area shape="rect" id="Node000004" href="$d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec" title=" " alt="" coords="904,153,1078,179"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="336,262,382,226,410,209,439,196,497,178,557,165,678,151,792,149,889,153,889,158,792,154,678,157,558,171,498,183,441,201,412,214,385,230,339,266"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="1352,372,1424,398"/>
-<area shape="poly" id="edge14_Node000002_Node000008" title=" " alt="" coords="367,262,402,249,439,240,620,209,694,200,763,196,832,198,905,206,1085,240,1164,264,1239,297,1305,331,1355,361,1352,366,1302,336,1237,301,1162,269,1083,245,905,211,832,204,763,202,694,205,620,214,441,245,404,254,369,267"/>
-<area shape="rect" id="Node000013" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f" title=" " alt="" coords="440,356,609,411"/>
-<area shape="poly" id="edge15_Node000002_Node000013" title=" " alt="" coords="377,319,443,347,441,352,375,324"/>
-<area shape="rect" id="Node000018" href="$d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" title=" " alt="" coords="447,255,602,280"/>
-<area shape="poly" id="edge24_Node000002_Node000018" title=" " alt="" coords="392,280,431,276,432,281,393,286"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="1170,5,1248,31"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="1002,151,1054,98,1090,67,1131,40,1154,29,1156,34,1133,44,1094,71,1057,102,1005,155"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/distance.html#" title=" " alt="" coords="1161,55,1257,80"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="1013,150,1066,121,1131,89,1146,83,1148,88,1133,94,1068,125,1016,155"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="1175,104,1243,130"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="1051,150,1159,125,1160,130,1052,155"/>
-<area shape="poly" id="edge7_Node000004_Node000008" title=" " alt="" coords="1060,177,1188,208,1247,227,1288,247,1317,272,1342,301,1376,357,1372,360,1337,304,1313,275,1285,251,1245,232,1186,213,1058,182"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="1354,537,1422,563"/>
-<area shape="poly" id="edge8_Node000004_Node000009" title=" " alt="" coords="1011,177,1086,240,1190,347,1288,459,1311,489,1336,516,1350,527,1347,531,1333,520,1307,492,1284,463,1186,350,1082,244,1008,182"/>
-<area shape="rect" id="Node000010" href="$d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" title=" " alt="" coords="1135,472,1283,513"/>
-<area shape="poly" id="edge9_Node000004_Node000010" title=" " alt="" coords="1017,177,1052,204,1086,241,1099,263,1106,284,1113,321,1118,359,1134,402,1154,433,1177,459,1173,463,1150,436,1130,405,1113,360,1107,322,1101,285,1094,265,1082,244,1049,208,1014,182"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max_element.html#" title=" " alt="" coords="1146,153,1272,179"/>
-<area shape="poly" id="edge13_Node000004_Node000012" title=" " alt="" coords="1078,164,1131,164,1131,169,1078,169"/>
-<area shape="poly" id="edge10_Node000010_Node000008" title=" " alt="" coords="1253,470,1285,452,1355,405,1358,409,1288,456,1255,474"/>
-<area shape="poly" id="edge11_Node000010_Node000009" title=" " alt="" coords="1275,511,1340,532,1338,537,1274,516"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="1334,480,1442,506"/>
-<area shape="poly" id="edge12_Node000010_Node000011" title=" " alt="" coords="1284,490,1319,490,1319,496,1284,496"/>
-<area shape="rect" id="Node000014" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" title=" " alt="" coords="657,356,850,411"/>
-<area shape="poly" id="edge16_Node000013_Node000014" title=" " alt="" coords="610,381,642,381,642,386,610,386"/>
-<area shape="poly" id="edge17_Node000014_Node000003" title=" " alt="" coords="814,353,848,335,872,319,896,304,908,298,911,303,899,309,875,323,851,339,816,357"/>
-<area shape="rect" id="Node000015" 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="903,319,1078,344"/>
-<area shape="poly" id="edge18_Node000014_Node000015" title=" " alt="" coords="850,360,914,346,915,351,851,365"/>
-<area shape="rect" id="Node000016" href="$d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" title=" " alt="" coords="903,420,1078,446"/>
-<area shape="poly" id="edge19_Node000014_Node000016" title=" " alt="" coords="851,401,911,414,910,419,850,406"/>
-<area shape="poly" id="edge20_Node000016_Node000008" title=" " alt="" coords="1078,420,1337,388,1337,394,1079,425"/>
-<area shape="poly" id="edge21_Node000016_Node000009" title=" " alt="" coords="1065,444,1086,455,1102,472,1110,491,1117,508,1133,523,1184,544,1239,554,1292,556,1338,554,1339,559,1292,562,1239,559,1183,549,1131,527,1113,511,1105,493,1098,475,1082,459,1063,449"/>
-<area shape="poly" id="edge22_Node000016_Node000010" title=" " alt="" coords="1045,444,1085,454,1123,465,1122,470,1083,459,1044,449"/>
-<area shape="rect" id="Node000017" 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="1132,588,1286,614"/>
-<area shape="poly" id="edge23_Node000016_Node000017" title=" " alt="" coords="1069,444,1086,455,1098,469,1106,483,1112,511,1117,539,1123,553,1134,567,1149,578,1145,583,1130,571,1118,556,1112,541,1106,512,1101,485,1094,472,1082,459,1066,449"/>
-<area shape="poly" id="edge29_Node000019_Node000008" title=" " alt="" coords="753,753,761,681,783,585,802,535,826,486,857,442,896,405,931,389,979,378,1037,371,1101,369,1231,371,1337,378,1337,383,1231,376,1101,374,1038,377,980,383,932,394,899,410,861,446,830,489,806,537,788,587,767,682,759,754"/>
-<area shape="poly" id="edge31_Node000019_Node000009" title=" " alt="" coords="767,809,786,851,813,900,851,947,874,966,899,982,947,1002,988,1005,1031,997,1083,982,1149,961,1198,938,1240,905,1284,854,1307,820,1326,783,1355,705,1372,633,1381,578,1386,579,1378,634,1360,707,1331,785,1312,822,1288,857,1243,909,1200,943,1151,966,1085,987,1032,1003,989,1011,946,1007,896,987,871,971,847,950,809,903,781,853,762,811"/>
-<area shape="poly" id="edge45_Node000019_Node000017" title=" " alt="" coords="816,751,897,720,950,705,992,698,1033,689,1083,669,1107,651,1131,631,1155,618,1158,623,1133,635,1110,655,1085,674,1035,694,993,704,951,711,899,725,818,756"/>
-<area shape="rect" id="Node000020" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="931,633,1050,659"/>
-<area shape="poly" id="edge26_Node000019_Node000020" title=" " alt="" coords="786,752,836,713,896,676,927,662,930,667,899,681,839,718,789,756"/>
-<area shape="rect" id="Node000021" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/c_str.html#" title=" " alt="" coords="933,799,1049,824"/>
-<area shape="poly" id="edge27_Node000019_Node000021" title=" " alt="" coords="839,790,917,800,917,805,838,795"/>
-<area shape="rect" id="Node000022" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ifstream/close.html#" title=" " alt="" coords="924,848,1058,874"/>
-<area shape="poly" id="edge28_Node000019_Node000022" title=" " alt="" coords="825,808,899,834,920,841,919,846,897,839,823,813"/>
-<area shape="rect" id="Node000023" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ios/eof.html#" title=" " alt="" coords="931,897,1051,923"/>
-<area shape="poly" id="edge30_Node000019_Node000023" title=" " alt="" coords="788,808,838,847,899,884,917,891,915,896,896,889,835,852,784,812"/>
-<area shape="rect" id="Node000024" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/getline.html#" title=" " alt="" coords="948,947,1034,972"/>
-<area shape="poly" id="edge32_Node000019_Node000024" title=" " alt="" coords="776,809,827,872,861,905,899,933,934,948,932,953,896,938,857,909,823,876,771,812"/>
-<area shape="rect" id="Node000025" href="$d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd" title=" " alt="" coords="910,1047,1072,1088"/>
-<area shape="poly" id="edge33_Node000019_Node000025" title=" " alt="" coords="767,810,785,856,814,914,852,974,874,1002,899,1027,913,1037,910,1041,896,1031,870,1005,847,977,809,917,781,858,762,811"/>
-<area shape="rect" id="Node000026" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ifstream/is_open.html#" title=" " alt="" coords="917,1112,1064,1138"/>
-<area shape="poly" id="edge34_Node000019_Node000026" title=" " alt="" coords="762,810,775,870,801,948,819,989,841,1028,868,1065,899,1098,905,1102,902,1106,896,1101,864,1069,837,1031,814,991,796,950,770,871,757,811"/>
-<area shape="rect" id="Node000027" href="$d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26" title=" " alt="" coords="903,734,1079,774"/>
-<area shape="poly" id="edge35_Node000019_Node000027" title=" " alt="" coords="838,770,887,764,887,769,839,775"/>
-<area shape="rect" id="Node000031" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ifstream/open.html#" title=" " alt="" coords="926,1161,1056,1187"/>
-<area shape="poly" id="edge42_Node000019_Node000031" title=" " alt="" coords="760,810,770,879,794,971,812,1019,835,1066,864,1110,899,1148,913,1158,910,1162,896,1152,860,1113,831,1069,807,1021,789,972,765,880,755,811"/>
-<area shape="rect" id="Node000032" href="$d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d" title=" " alt="" coords="898,469,1084,495"/>
-<area shape="poly" id="edge43_Node000019_Node000032" title=" " alt="" coords="759,753,775,700,802,633,842,564,867,533,896,505,903,500,906,505,899,510,871,537,846,567,807,636,780,702,764,755"/>
-<area shape="rect" id="Node000033" href="$d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093" title=" " alt="" coords="915,519,1066,560"/>
-<area shape="poly" id="edge44_Node000019_Node000033" title=" " alt="" coords="765,752,785,712,813,663,851,613,896,569,901,566,904,570,899,574,855,616,818,666,789,714,769,755"/>
-<area shape="rect" id="Node000034" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/stof.html#" title=" " alt="" coords="955,584,1027,610"/>
-<area shape="poly" id="edge46_Node000019_Node000034" title=" " alt="" coords="770,753,821,685,856,649,896,619,939,602,940,607,899,623,860,653,825,689,774,756"/>
-<area shape="poly" id="edge36_Node000027_Node000008" title=" " alt="" coords="1072,731,1083,725,1097,713,1106,701,1115,688,1131,675,1153,663,1174,657,1213,654,1249,648,1266,639,1284,624,1300,606,1309,588,1316,552,1319,513,1323,491,1332,466,1365,409,1370,412,1337,469,1328,492,1324,514,1321,553,1314,589,1304,608,1288,628,1269,644,1250,653,1213,659,1175,662,1155,668,1133,679,1119,691,1110,704,1101,717,1085,730,1075,736"/>
-<area shape="poly" id="edge37_Node000027_Node000009" title=" " alt="" coords="1062,773,1085,784,1100,795,1109,806,1119,816,1133,824,1176,839,1212,847,1247,843,1285,824,1312,800,1334,770,1351,737,1363,702,1378,634,1384,579,1389,579,1384,635,1369,704,1356,739,1338,773,1316,803,1288,828,1248,849,1212,852,1175,844,1131,829,1115,820,1105,810,1096,799,1083,788,1060,778"/>
-<area shape="poly" id="edge38_Node000027_Node000010" title=" " alt="" coords="1019,731,1051,704,1082,670,1098,645,1106,623,1115,601,1130,574,1173,522,1177,526,1134,577,1120,603,1111,625,1102,647,1086,673,1055,707,1022,735"/>
-<area shape="rect" id="Node000028" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="1173,788,1245,814"/>
-<area shape="poly" id="edge39_Node000027_Node000028" title=" " alt="" coords="1080,770,1158,787,1157,793,1079,776"/>
-<area shape="rect" id="Node000029" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="1175,689,1243,715"/>
-<area shape="poly" id="edge40_Node000027_Node000029" title=" " alt="" coords="1078,731,1159,711,1160,716,1079,736"/>
-<area shape="rect" id="Node000030" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="1152,739,1267,764"/>
-<area shape="poly" id="edge41_Node000027_Node000030" title=" " alt="" coords="1079,750,1136,750,1136,755,1079,756"/>
-</map>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph.md5 b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph.md5
deleted file mode 100644
index 702e530b8..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0657e4ff13fb34124afd12d53920a909
\ No newline at end of file
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph.svg
deleted file mode 100644
index a0883dd28..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph.svg
+++ /dev/null
@@ -1,830 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::evaluate_from_csv Pages: 1 -->
-<!--zoomable 894 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 1085;
-var viewHeight = 894;
-var sectionId = 'dynsection-6';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>machine_learning::neural_network::NeuralNetwork::evaluate_from_csv</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-498.5 0,-498.5 0,-456.75 127,-456.75 127,-498.5"/>
-<text text-anchor="start" x="8" y="-485" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-473.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-462.5" font-family="Helvetica,sans-Serif" font-size="10.00">::evaluate_from_csv</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290,-691.5 163,-691.5 163,-649.75 290,-649.75 290,-691.5"/>
-<text text-anchor="start" x="171" y="-678" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="171" y="-666.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="226.5" y="-655.5" font-family="Helvetica,sans-Serif" font-size="10.00">::evaluate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.04,-498.65C110.75,-533.07 167.89,-601.56 200.73,-640.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="197.68,-642.74 206.77,-648.17 203.05,-638.25 197.68,-642.74"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="624.62,-324.5 497.62,-324.5 497.62,-282.75 624.62,-282.75 624.62,-324.5"/>
-<text text-anchor="start" x="505.62" y="-311" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="505.62" y="-299.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="561.12" y="-288.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_XY_from_csv</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node19 -->
-<g id="edge25_Node000001_Node000019" class="edge">
-<title>Node1&#45;&gt;Node19</title>
-<g id="a_edge25_Node000001_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.27,-456.29C217.08,-424.06 390.78,-363.08 488.57,-328.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="489.54,-332.12 497.81,-325.5 487.22,-325.51 489.54,-332.12"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="799.62,-699.88 678.62,-699.88 678.62,-669.38 799.62,-669.38 799.62,-699.88"/>
-<text text-anchor="start" x="686.62" y="-686.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::apply</text>
-<text text-anchor="middle" x="739.12" y="-675.12" font-family="Helvetica,sans-Serif" font-size="10.00">_function</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.21,-669.8C335.46,-669.41 398.01,-669.28 453,-670.62 526.04,-672.42 609.51,-676.79 667.18,-680.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="666.66,-683.65 676.85,-680.75 667.07,-676.66 666.66,-683.65"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="804.12,-775.25 674.12,-775.25 674.12,-756 804.12,-756 804.12,-775.25"/>
-<text text-anchor="middle" x="739.12" y="-761.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::argmax</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.23,-691.96C267.89,-708.78 296.4,-731.11 326,-741.62 438.02,-781.42 577.9,-779.72 662.51,-773.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="662.6,-777.1 672.31,-772.84 662.07,-770.12 662.6,-777.1"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1063.75,-611.25 1010.25,-611.25 1010.25,-592 1063.75,-592 1063.75,-611.25"/>
-<text text-anchor="middle" x="1037" y="-597.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge14_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge14_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M272.09,-691.82C288.63,-698.61 307.8,-705.24 326,-708.62 537.04,-747.92 599.52,-755.52 809,-708.62 887.61,-691.03 971.09,-643.03 1011.39,-617.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1013.07,-620.81 1019.63,-612.48 1009.31,-614.9 1013.07,-620.81"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="453,-623.5 326,-623.5 326,-581.75 453,-581.75 453,-623.5"/>
-<text text-anchor="start" x="334" y="-610" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="334" y="-598.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="389.5" y="-587.5" font-family="Helvetica,sans-Serif" font-size="10.00">::single_predict</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node13 -->
-<g id="edge15_Node000002_Node000013" class="edge">
-<title>Node2&#45;&gt;Node13</title>
-<g id="a_edge15_Node000002_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278,-649.3C293.66,-642.68 311.09,-635.32 327.38,-628.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.66,-631.7 336.51,-624.58 325.93,-625.25 328.66,-631.7"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="447.75,-699.25 331.25,-699.25 331.25,-680 447.75,-680 447.75,-699.25"/>
-<text text-anchor="middle" x="389.5" y="-685.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node18 -->
-<g id="edge24_Node000002_Node000018" class="edge">
-<title>Node2&#45;&gt;Node18</title>
-<g id="a_edge24_Node000002_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.21,-678.03C299.85,-679.16 309.86,-680.34 319.63,-681.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="319.11,-684.96 329.45,-682.66 319.93,-678.01 319.11,-684.96"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="932.25,-886.25 873.5,-886.25 873.5,-867 932.25,-867 932.25,-886.25"/>
-<text text-anchor="middle" x="902.88" y="-872.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M748.63,-775.54C765.28,-794.36 804.15,-835.45 845,-858.62 850.41,-861.69 856.4,-864.31 862.41,-866.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="861.1,-869.77 871.69,-869.59 863.3,-863.13 861.1,-869.77"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="939,-849.25 866.75,-849.25 866.75,-830 939,-830 939,-849.25"/>
-<text text-anchor="middle" x="902.88" y="-835.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M756.73,-775.73C777.02,-787.78 812.66,-808.01 845,-821.62 848.54,-823.12 852.26,-824.55 856.01,-825.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="854.59,-829.13 865.19,-829.09 856.87,-822.52 854.59,-829.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="928.5,-812.25 877.25,-812.25 877.25,-793 928.5,-793 928.5,-812.25"/>
-<text text-anchor="middle" x="902.88" y="-798.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M784.32,-775.74C809.89,-781.58 841.65,-788.85 865.71,-794.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="864.84,-797.74 875.37,-796.56 866.4,-790.92 864.84,-797.74"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M790.16,-755.52C846.32,-743.51 933.17,-722.68 960.75,-703.62 991.4,-682.45 1014.42,-644.67 1026.5,-621.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1029.51,-623.32 1030.86,-612.81 1023.25,-620.18 1029.51,-623.32"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1062.62,-487.25 1011.38,-487.25 1011.38,-468 1062.62,-468 1062.62,-487.25"/>
-<text text-anchor="middle" x="1037" y="-473.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge8_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge8_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M753.25,-755.61C767.44,-744.59 790.51,-726.12 809,-708.62 881.13,-640.37 895.13,-619.16 960.75,-544.62 977.22,-525.92 977.87,-517.9 996.75,-501.62 999.96,-498.85 1003.53,-496.2 1007.18,-493.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1008.9,-496.79 1015.5,-488.5 1005.17,-490.86 1008.9,-496.79"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="958.5,-535.88 847.25,-535.88 847.25,-505.38 958.5,-505.38 958.5,-535.88"/>
-<text text-anchor="start" x="855.25" y="-522.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="902.88" y="-511.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node10 -->
-<g id="edge9_Node000004_Node000010" class="edge">
-<title>Node4&#45;&gt;Node10</title>
-<g id="a_edge9_Node000004_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M757.33,-755.57C772.99,-745.57 795.64,-728.82 809,-708.62 839.95,-661.83 818.27,-636.96 845,-587.62 853.54,-571.86 866.22,-556.46 877.44,-544.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="879.82,-546.98 884.23,-537.35 874.77,-542.13 879.82,-546.98"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="949.88,-775.25 855.88,-775.25 855.88,-756 949.88,-756 949.88,-775.25"/>
-<text text-anchor="middle" x="902.88" y="-761.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node12 -->
-<g id="edge13_Node000004_Node000012" class="edge">
-<title>Node4&#45;&gt;Node12</title>
-<g id="a_edge13_Node000004_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M804.52,-765.62C817.6,-765.62 831.29,-765.62 844.13,-765.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="844.12,-769.13 854.12,-765.63 844.12,-762.13 844.12,-769.13"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node8 -->
-<g id="edge10_Node000010_Node000008" class="edge">
-<title>Node10&#45;&gt;Node8</title>
-<g id="a_edge10_Node000010_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M936.46,-536.3C944.52,-540.43 953.04,-545.02 960.75,-549.62 979.03,-560.54 998.8,-574.28 1013.49,-584.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1011.4,-587.71 1021.54,-590.78 1015.53,-582.06 1011.4,-587.71"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node9 -->
-<g id="edge11_Node000010_Node000009" class="edge">
-<title>Node10&#45;&gt;Node9</title>
-<g id="a_edge11_Node000010_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M951.95,-504.98C967.94,-499.77 985.46,-494.07 1000.34,-489.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1001.27,-492.61 1009.7,-486.18 999.11,-485.95 1001.27,-492.61"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1077.25,-530.25 996.75,-530.25 996.75,-511 1077.25,-511 1077.25,-530.25"/>
-<text text-anchor="middle" x="1037" y="-516.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge12_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge12_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M958.76,-520.62C967.44,-520.62 976.38,-520.62 984.96,-520.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="984.87,-524.13 994.87,-520.63 984.87,-517.13 984.87,-524.13"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="633.25,-623.5 489,-623.5 489,-581.75 633.25,-581.75 633.25,-623.5"/>
-<text text-anchor="start" x="497" y="-610" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="497" y="-598.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="561.12" y="-587.5" font-family="Helvetica,sans-Serif" font-size="10.00">::__detailed_single_prediction</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge16_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge16_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M453.18,-602.62C461.01,-602.62 469.1,-602.62 477.18,-602.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="477.03,-606.13 487.03,-602.63 477.03,-599.13 477.03,-606.13"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node3 -->
-<g id="edge17_Node000014_Node000003" class="edge">
-<title>Node14&#45;&gt;Node3</title>
-<g id="a_edge17_Node000014_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M607.29,-623.91C616,-628.27 624.98,-632.97 633.25,-637.62 649.79,-646.94 652.17,-652.33 669.25,-660.62 672.13,-662.02 675.12,-663.38 678.16,-664.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="676.66,-667.86 687.24,-668.39 679.29,-661.37 676.66,-667.86"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="804.88,-651.25 673.38,-651.25 673.38,-632 804.88,-632 804.88,-651.25"/>
-<text text-anchor="middle" x="739.12" y="-637.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge18_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge18_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M633.71,-618.49C649.72,-622.03 666.47,-625.75 681.76,-629.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="680.6,-632.46 691.12,-631.21 682.12,-625.63 680.6,-632.46"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="804.88,-575.25 673.38,-575.25 673.38,-556 804.88,-556 804.88,-575.25"/>
-<text text-anchor="middle" x="739.12" y="-561.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node16 -->
-<g id="edge19_Node000014_Node000016" class="edge">
-<title>Node14&#45;&gt;Node16</title>
-<g id="a_edge19_Node000014_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M633.71,-587.58C648.8,-584.4 664.56,-581.09 679.13,-578.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="679.46,-581.54 688.52,-576.05 678.02,-574.69 679.46,-581.54"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node8 -->
-<g id="edge20_Node000016_Node000008" class="edge">
-<title>Node16&#45;&gt;Node8</title>
-<g id="a_edge20_Node000016_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M805.06,-573.53C864.46,-580.75 950.26,-591.19 998.82,-597.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="998.18,-600.55 1008.53,-598.28 999.03,-593.6 998.18,-600.55"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node9 -->
-<g id="edge21_Node000016_Node000009" class="edge">
-<title>Node16&#45;&gt;Node9</title>
-<g id="a_edge21_Node000016_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M794.05,-555.55C799.34,-553.4 804.43,-550.79 809,-547.62 831.81,-531.82 821.03,-510.59 845,-496.62 892.95,-468.68 959.36,-469.05 999.91,-472.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="999.3,-476.18 1009.61,-473.73 1000.03,-469.22 999.3,-476.18"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node10 -->
-<g id="edge22_Node000016_Node000010" class="edge">
-<title>Node16&#45;&gt;Node10</title>
-<g id="a_edge22_Node000016_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M779.51,-555.53C789.17,-553 799.47,-550.26 809,-547.62 818.41,-545.03 828.33,-542.22 838.05,-539.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="838.81,-542.85 847.45,-536.72 836.87,-536.13 838.81,-542.85"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="960.75,-449.25 845,-449.25 845,-430 960.75,-430 960.75,-449.25"/>
-<text text-anchor="middle" x="902.88" y="-435.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge23_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge23_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M796.82,-555.53C801.21,-553.37 805.35,-550.77 809,-547.62 839.78,-521.13 816.2,-492.27 845,-463.62 848.33,-460.31 852.2,-457.43 856.31,-454.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="857.63,-458.18 864.88,-450.45 854.39,-451.97 857.63,-458.18"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node8 -->
-<g id="edge29_Node000019_Node000008" class="edge">
-<title>Node19&#45;&gt;Node8</title>
-<g id="a_edge29_Node000019_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M563.01,-324.97C566.5,-378.77 583.78,-520.21 669.25,-584.62 720.19,-623.02 915.67,-611.77 998.53,-605.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="998.73,-608.53 1008.4,-604.2 998.14,-601.55 998.73,-608.53"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node9 -->
-<g id="edge31_Node000019_Node000009" class="edge">
-<title>Node19&#45;&gt;Node9</title>
-<g id="a_edge31_Node000019_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M569.6,-282.51C583.2,-247.71 615.66,-179.42 669.25,-151.62 724.39,-123.03 749.38,-134.2 809,-151.62 885.83,-174.08 911.69,-185.38 960.75,-248.62 1011.07,-313.49 1028.46,-413.41 1033.84,-456.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1030.34,-456.79 1034.95,-466.33 1037.29,-455.99 1030.34,-456.79"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node17 -->
-<g id="edge45_Node000019_Node000017" class="edge">
-<title>Node19&#45;&gt;Node17</title>
-<g id="a_edge45_Node000019_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M609.07,-324.93C627.6,-332.92 649.22,-341.73 669.25,-348.62 730.11,-369.58 751.67,-357.37 809,-386.62 827.3,-395.96 827.36,-405.08 845,-415.62 850.72,-419.04 857.01,-422.21 863.26,-425.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="861.68,-428.19 872.25,-428.92 864.44,-421.76 861.68,-428.19"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="783.88,-415.25 694.38,-415.25 694.38,-396 783.88,-396 783.88,-415.25"/>
-<text text-anchor="middle" x="739.12" y="-401.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge26_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge26_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M586.71,-324.78C607.57,-341.91 638.88,-365.73 669.25,-381.62 676.5,-385.42 684.48,-388.83 692.36,-391.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="690.94,-395.01 701.53,-395.08 693.29,-388.42 690.94,-395.01"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="782.75,-291.25 695.5,-291.25 695.5,-272 782.75,-272 782.75,-291.25"/>
-<text text-anchor="middle" x="739.12" y="-277.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::c_str</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node21 -->
-<g id="edge27_Node000019_Node000021" class="edge">
-<title>Node19&#45;&gt;Node21</title>
-<g id="a_edge27_Node000019_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M624.67,-295.81C643.98,-293.39 665.08,-290.76 683.79,-288.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="684.1,-291.91 693.59,-287.19 683.23,-284.96 684.1,-291.91"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="789.12,-254.25 689.12,-254.25 689.12,-235 789.12,-235 789.12,-254.25"/>
-<text text-anchor="middle" x="739.12" y="-240.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node22 -->
-<g id="edge28_Node000019_Node000022" class="edge">
-<title>Node19&#45;&gt;Node22</title>
-<g id="a_edge28_Node000019_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M614.3,-282.34C631.64,-275.62 651.14,-268.44 669.25,-262.62 674.56,-260.92 680.13,-259.26 685.71,-257.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="686.22,-261.17 694.93,-255.15 684.36,-254.42 686.22,-261.17"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ios/eof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="784.25,-217.25 694,-217.25 694,-198 784.25,-198 784.25,-217.25"/>
-<text text-anchor="middle" x="739.12" y="-203.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::eof</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node23 -->
-<g id="edge30_Node000019_Node000023" class="edge">
-<title>Node19&#45;&gt;Node23</title>
-<g id="a_edge30_Node000019_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M585.56,-282.53C606.23,-264.96 637.86,-240.5 669.25,-225.62 673.52,-223.6 678.06,-221.78 682.68,-220.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="683.64,-223.51 692.09,-217.13 681.5,-216.85 683.64,-223.51"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="771.12,-180.25 707.12,-180.25 707.12,-161 771.12,-161 771.12,-180.25"/>
-<text text-anchor="middle" x="739.12" y="-166.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node24 -->
-<g id="edge32_Node000019_Node000024" class="edge">
-<title>Node19&#45;&gt;Node24</title>
-<g id="a_edge32_Node000019_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M576.14,-282.38C594.45,-256.33 628.95,-212.68 669.25,-188.62 677.32,-183.81 686.68,-180.26 695.84,-177.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="696.5,-181.1 705.36,-175.3 694.81,-174.31 696.5,-181.1"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="800,-104.88 678.25,-104.88 678.25,-74.38 800,-74.38 800,-104.88"/>
-<text text-anchor="start" x="686.25" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::insert</text>
-<text text-anchor="middle" x="739.12" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_element</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node25 -->
-<g id="edge33_Node000019_Node000025" class="edge">
-<title>Node19&#45;&gt;Node25</title>
-<g id="a_edge33_Node000019_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M569.26,-282.37C582.96,-244.57 616.34,-165.24 669.25,-118.62 672.4,-115.85 675.86,-113.31 679.5,-110.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="681.15,-114.07 688.14,-106.11 677.71,-107.98 681.15,-114.07"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="794.38,-56.25 683.88,-56.25 683.88,-37 794.38,-37 794.38,-56.25"/>
-<text text-anchor="middle" x="739.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node26 -->
-<g id="edge34_Node000019_Node000026" class="edge">
-<title>Node19&#45;&gt;Node26</title>
-<g id="a_edge34_Node000019_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M565.45,-282.56C573.89,-236.13 600.61,-124.45 669.25,-65.62 670.71,-64.38 672.24,-63.21 673.83,-62.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="675.2,-65.36 682.21,-57.41 671.77,-59.26 675.2,-65.36"/>
-</a>
-</g>
-</g>
-<!-- Node27 -->
-<g id="Node000027" class="node">
-<title>Node27</title>
-<g id="a_Node000027"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="805.25,-339.88 673,-339.88 673,-309.38 805.25,-309.38 805.25,-339.88"/>
-<text text-anchor="start" x="681" y="-326.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::minmax</text>
-<text text-anchor="middle" x="739.12" y="-315.12" font-family="Helvetica,sans-Serif" font-size="10.00">_scaler</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node27 -->
-<g id="edge35_Node000019_Node000027" class="edge">
-<title>Node19&#45;&gt;Node27</title>
-<g id="a_edge35_Node000019_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M624.67,-311.09C636.55,-312.51 649.1,-314 661.36,-315.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="660.66,-318.91 671,-316.62 661.49,-311.96 660.66,-318.91"/>
-</a>
-</g>
-</g>
-<!-- Node31 -->
-<g id="Node000031" class="node">
-<title>Node31</title>
-<g id="a_Node000031"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="788,-19.25 690.25,-19.25 690.25,0 788,0 788,-19.25"/>
-<text text-anchor="middle" x="739.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node31 -->
-<g id="edge42_Node000019_Node000031" class="edge">
-<title>Node19&#45;&gt;Node31</title>
-<g id="a_edge42_Node000019_Node000031"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M563.94,-282.34C569.53,-230.58 591.17,-97.23 669.25,-27.62 672.39,-24.83 675.9,-22.46 679.65,-20.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="680.83,-23.75 688.59,-16.54 678.02,-17.34 680.83,-23.75"/>
-</a>
-</g>
-</g>
-<!-- Node32 -->
-<g id="Node000032" class="node">
-<title>Node32</title>
-<g id="a_Node000032"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="809,-538.25 669.25,-538.25 669.25,-519 809,-519 809,-538.25"/>
-<text text-anchor="middle" x="739.12" y="-524.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node32 -->
-<g id="edge43_Node000019_Node000032" class="edge">
-<title>Node19&#45;&gt;Node32</title>
-<g id="a_edge43_Node000019_Node000032"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M567.06,-324.72C577.97,-366.54 608.14,-460.19 669.25,-509.62 670.95,-511 672.74,-512.28 674.61,-513.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="672.61,-516.36 683.09,-517.94 675.88,-510.17 672.61,-516.36"/>
-</a>
-</g>
-</g>
-<!-- Node33 -->
-<g id="Node000033" class="node">
-<title>Node33</title>
-<g id="a_Node000033"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="795.88,-500.88 682.38,-500.88 682.38,-470.38 795.88,-470.38 795.88,-500.88"/>
-<text text-anchor="start" x="690.38" y="-487.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop</text>
-<text text-anchor="middle" x="739.12" y="-476.12" font-family="Helvetica,sans-Serif" font-size="10.00">_front</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node33 -->
-<g id="edge44_Node000019_Node000033" class="edge">
-<title>Node19&#45;&gt;Node33</title>
-<g id="a_edge44_Node000019_Node000033"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M571.18,-325C586.52,-358.75 620.76,-424.37 669.25,-461.62 670.41,-462.51 671.6,-463.37 672.82,-464.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="670.99,-467.18 681.39,-469.2 674.52,-461.14 670.99,-467.18"/>
-</a>
-</g>
-</g>
-<!-- Node34 -->
-<g id="Node000034" class="node">
-<title>Node34</title>
-<g id="a_Node000034"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="766.25,-452.25 712,-452.25 712,-433 766.25,-433 766.25,-452.25"/>
-<text text-anchor="middle" x="739.12" y="-438.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stod</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node34 -->
-<g id="edge46_Node000019_Node000034" class="edge">
-<title>Node19&#45;&gt;Node34</title>
-<g id="a_edge46_Node000019_Node000034"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M574.95,-324.58C592.72,-351.82 627.41,-398.92 669.25,-424.62 678.68,-430.42 689.95,-434.36 700.61,-437.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="699.83,-440.46 710.35,-439.16 701.32,-433.61 699.83,-440.46"/>
-</a>
-</g>
-</g>
-<!-- Node27&#45;&gt;Node8 -->
-<g id="edge36_Node000027_Node000008" class="edge">
-<title>Node27&#45;&gt;Node8</title>
-<g id="a_edge36_Node000027_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M801.01,-340.3C803.77,-341.63 806.45,-343.07 809,-344.62 828.86,-356.74 825.35,-370.17 845,-382.62 890.74,-411.61 922.91,-381.89 960.75,-420.62 999.36,-460.15 973.76,-489.38 996.75,-539.62 1003.64,-554.68 1013.64,-570.42 1021.83,-582.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1018.91,-584.22 1027.56,-590.35 1024.62,-580.17 1018.91,-584.22"/>
-</a>
-</g>
-</g>
-<!-- Node27&#45;&gt;Node9 -->
-<g id="edge37_Node000027_Node000009" class="edge">
-<title>Node27&#45;&gt;Node9</title>
-<g id="a_edge37_Node000027_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M791.8,-308.92C797.74,-306.45 803.6,-303.68 809,-300.62 827.13,-290.37 825.42,-277.72 845,-270.62 893.37,-253.11 918.61,-241.11 960.75,-270.62 1022.19,-313.66 1033.65,-412.29 1035.66,-456.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1032.16,-456.12 1035.97,-466 1039.16,-455.9 1032.16,-456.12"/>
-</a>
-</g>
-</g>
-<!-- Node27&#45;&gt;Node10 -->
-<g id="edge38_Node000027_Node000010" class="edge">
-<title>Node27&#45;&gt;Node10</title>
-<g id="a_edge38_Node000027_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M761.33,-340.24C776.04,-351.84 795.36,-368.7 809,-386.62 830.67,-415.09 824.71,-429.16 845,-458.62 854.44,-472.33 866.74,-486.12 877.49,-497.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="874.74,-499.4 884.27,-504.03 879.71,-494.47 874.74,-499.4"/>
-</a>
-</g>
-</g>
-<!-- Node28 -->
-<g id="Node000028" class="node">
-<title>Node28</title>
-<g id="a_Node000028"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="930,-299.25 875.75,-299.25 875.75,-280 930,-280 930,-299.25"/>
-<text text-anchor="middle" x="902.88" y="-285.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node27&#45;&gt;Node28 -->
-<g id="edge39_Node000027_Node000028" class="edge">
-<title>Node27&#45;&gt;Node28</title>
-<g id="a_edge39_Node000027_Node000028"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M805.45,-310.49C825.49,-306.15 846.86,-301.53 864.37,-297.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="865.03,-301.18 874.06,-295.64 863.55,-294.34 865.03,-301.18"/>
-</a>
-</g>
-</g>
-<!-- Node29 -->
-<g id="Node000029" class="node">
-<title>Node29</title>
-<g id="a_Node000029"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="928.5,-373.25 877.25,-373.25 877.25,-354 928.5,-354 928.5,-373.25"/>
-<text text-anchor="middle" x="902.88" y="-359.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node27&#45;&gt;Node29 -->
-<g id="edge40_Node000027_Node000029" class="edge">
-<title>Node27&#45;&gt;Node29</title>
-<g id="a_edge40_Node000027_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M804.98,-340.26C825.75,-345.27 847.98,-350.63 865.9,-354.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="864.99,-358.33 875.53,-357.27 866.63,-351.53 864.99,-358.33"/>
-</a>
-</g>
-</g>
-<!-- Node30 -->
-<g id="Node000030" class="node">
-<title>Node30</title>
-<g id="a_Node000030"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="946.12,-336.25 859.62,-336.25 859.62,-317 946.12,-317 946.12,-336.25"/>
-<text text-anchor="middle" x="902.88" y="-322.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node27&#45;&gt;Node30 -->
-<g id="edge41_Node000027_Node000030" class="edge">
-<title>Node27&#45;&gt;Node30</title>
-<g id="a_edge41_Node000027_Node000030"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M805.45,-325.43C819.7,-325.61 834.61,-325.79 848.34,-325.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="847.99,-329.46 858.04,-326.08 848.08,-322.46 847.99,-329.46"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph_org.svg
deleted file mode 100644
index f1e66fb45..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a36494e26ff36d6e15c1022bb9a1ee848_cgraph_org.svg
+++ /dev/null
@@ -1,747 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::evaluate_from_csv Pages: 1 -->
-<svg width="1085pt" height="894pt"
- viewBox="0.00 0.00 1085.25 894.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 890.25)">
-<title>machine_learning::neural_network::NeuralNetwork::evaluate_from_csv</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-498.5 0,-498.5 0,-456.75 127,-456.75 127,-498.5"/>
-<text text-anchor="start" x="8" y="-485" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-473.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-462.5" font-family="Helvetica,sans-Serif" font-size="10.00">::evaluate_from_csv</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290,-691.5 163,-691.5 163,-649.75 290,-649.75 290,-691.5"/>
-<text text-anchor="start" x="171" y="-678" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="171" y="-666.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="226.5" y="-655.5" font-family="Helvetica,sans-Serif" font-size="10.00">::evaluate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.04,-498.65C110.75,-533.07 167.89,-601.56 200.73,-640.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="197.68,-642.74 206.77,-648.17 203.05,-638.25 197.68,-642.74"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="624.62,-324.5 497.62,-324.5 497.62,-282.75 624.62,-282.75 624.62,-324.5"/>
-<text text-anchor="start" x="505.62" y="-311" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="505.62" y="-299.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="561.12" y="-288.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_XY_from_csv</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node19 -->
-<g id="edge25_Node000001_Node000019" class="edge">
-<title>Node1&#45;&gt;Node19</title>
-<g id="a_edge25_Node000001_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.27,-456.29C217.08,-424.06 390.78,-363.08 488.57,-328.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="489.54,-332.12 497.81,-325.5 487.22,-325.51 489.54,-332.12"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="799.62,-699.88 678.62,-699.88 678.62,-669.38 799.62,-669.38 799.62,-699.88"/>
-<text text-anchor="start" x="686.62" y="-686.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::apply</text>
-<text text-anchor="middle" x="739.12" y="-675.12" font-family="Helvetica,sans-Serif" font-size="10.00">_function</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.21,-669.8C335.46,-669.41 398.01,-669.28 453,-670.62 526.04,-672.42 609.51,-676.79 667.18,-680.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="666.66,-683.65 676.85,-680.75 667.07,-676.66 666.66,-683.65"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="804.12,-775.25 674.12,-775.25 674.12,-756 804.12,-756 804.12,-775.25"/>
-<text text-anchor="middle" x="739.12" y="-761.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::argmax</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.23,-691.96C267.89,-708.78 296.4,-731.11 326,-741.62 438.02,-781.42 577.9,-779.72 662.51,-773.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="662.6,-777.1 672.31,-772.84 662.07,-770.12 662.6,-777.1"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1063.75,-611.25 1010.25,-611.25 1010.25,-592 1063.75,-592 1063.75,-611.25"/>
-<text text-anchor="middle" x="1037" y="-597.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge14_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge14_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M272.09,-691.82C288.63,-698.61 307.8,-705.24 326,-708.62 537.04,-747.92 599.52,-755.52 809,-708.62 887.61,-691.03 971.09,-643.03 1011.39,-617.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1013.07,-620.81 1019.63,-612.48 1009.31,-614.9 1013.07,-620.81"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="453,-623.5 326,-623.5 326,-581.75 453,-581.75 453,-623.5"/>
-<text text-anchor="start" x="334" y="-610" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="334" y="-598.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="389.5" y="-587.5" font-family="Helvetica,sans-Serif" font-size="10.00">::single_predict</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node13 -->
-<g id="edge15_Node000002_Node000013" class="edge">
-<title>Node2&#45;&gt;Node13</title>
-<g id="a_edge15_Node000002_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278,-649.3C293.66,-642.68 311.09,-635.32 327.38,-628.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.66,-631.7 336.51,-624.58 325.93,-625.25 328.66,-631.7"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="447.75,-699.25 331.25,-699.25 331.25,-680 447.75,-680 447.75,-699.25"/>
-<text text-anchor="middle" x="389.5" y="-685.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node18 -->
-<g id="edge24_Node000002_Node000018" class="edge">
-<title>Node2&#45;&gt;Node18</title>
-<g id="a_edge24_Node000002_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.21,-678.03C299.85,-679.16 309.86,-680.34 319.63,-681.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="319.11,-684.96 329.45,-682.66 319.93,-678.01 319.11,-684.96"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="932.25,-886.25 873.5,-886.25 873.5,-867 932.25,-867 932.25,-886.25"/>
-<text text-anchor="middle" x="902.88" y="-872.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M748.63,-775.54C765.28,-794.36 804.15,-835.45 845,-858.62 850.41,-861.69 856.4,-864.31 862.41,-866.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="861.1,-869.77 871.69,-869.59 863.3,-863.13 861.1,-869.77"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="939,-849.25 866.75,-849.25 866.75,-830 939,-830 939,-849.25"/>
-<text text-anchor="middle" x="902.88" y="-835.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M756.73,-775.73C777.02,-787.78 812.66,-808.01 845,-821.62 848.54,-823.12 852.26,-824.55 856.01,-825.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="854.59,-829.13 865.19,-829.09 856.87,-822.52 854.59,-829.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="928.5,-812.25 877.25,-812.25 877.25,-793 928.5,-793 928.5,-812.25"/>
-<text text-anchor="middle" x="902.88" y="-798.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M784.32,-775.74C809.89,-781.58 841.65,-788.85 865.71,-794.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="864.84,-797.74 875.37,-796.56 866.4,-790.92 864.84,-797.74"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M790.16,-755.52C846.32,-743.51 933.17,-722.68 960.75,-703.62 991.4,-682.45 1014.42,-644.67 1026.5,-621.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1029.51,-623.32 1030.86,-612.81 1023.25,-620.18 1029.51,-623.32"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1062.62,-487.25 1011.38,-487.25 1011.38,-468 1062.62,-468 1062.62,-487.25"/>
-<text text-anchor="middle" x="1037" y="-473.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge8_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge8_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M753.25,-755.61C767.44,-744.59 790.51,-726.12 809,-708.62 881.13,-640.37 895.13,-619.16 960.75,-544.62 977.22,-525.92 977.87,-517.9 996.75,-501.62 999.96,-498.85 1003.53,-496.2 1007.18,-493.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1008.9,-496.79 1015.5,-488.5 1005.17,-490.86 1008.9,-496.79"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="958.5,-535.88 847.25,-535.88 847.25,-505.38 958.5,-505.38 958.5,-535.88"/>
-<text text-anchor="start" x="855.25" y="-522.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="902.88" y="-511.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node10 -->
-<g id="edge9_Node000004_Node000010" class="edge">
-<title>Node4&#45;&gt;Node10</title>
-<g id="a_edge9_Node000004_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M757.33,-755.57C772.99,-745.57 795.64,-728.82 809,-708.62 839.95,-661.83 818.27,-636.96 845,-587.62 853.54,-571.86 866.22,-556.46 877.44,-544.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="879.82,-546.98 884.23,-537.35 874.77,-542.13 879.82,-546.98"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="949.88,-775.25 855.88,-775.25 855.88,-756 949.88,-756 949.88,-775.25"/>
-<text text-anchor="middle" x="902.88" y="-761.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node12 -->
-<g id="edge13_Node000004_Node000012" class="edge">
-<title>Node4&#45;&gt;Node12</title>
-<g id="a_edge13_Node000004_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M804.52,-765.62C817.6,-765.62 831.29,-765.62 844.13,-765.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="844.12,-769.13 854.12,-765.63 844.12,-762.13 844.12,-769.13"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node8 -->
-<g id="edge10_Node000010_Node000008" class="edge">
-<title>Node10&#45;&gt;Node8</title>
-<g id="a_edge10_Node000010_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M936.46,-536.3C944.52,-540.43 953.04,-545.02 960.75,-549.62 979.03,-560.54 998.8,-574.28 1013.49,-584.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1011.4,-587.71 1021.54,-590.78 1015.53,-582.06 1011.4,-587.71"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node9 -->
-<g id="edge11_Node000010_Node000009" class="edge">
-<title>Node10&#45;&gt;Node9</title>
-<g id="a_edge11_Node000010_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M951.95,-504.98C967.94,-499.77 985.46,-494.07 1000.34,-489.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1001.27,-492.61 1009.7,-486.18 999.11,-485.95 1001.27,-492.61"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="1077.25,-530.25 996.75,-530.25 996.75,-511 1077.25,-511 1077.25,-530.25"/>
-<text text-anchor="middle" x="1037" y="-516.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge12_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge12_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M958.76,-520.62C967.44,-520.62 976.38,-520.62 984.96,-520.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="984.87,-524.13 994.87,-520.63 984.87,-517.13 984.87,-524.13"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="633.25,-623.5 489,-623.5 489,-581.75 633.25,-581.75 633.25,-623.5"/>
-<text text-anchor="start" x="497" y="-610" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="497" y="-598.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="561.12" y="-587.5" font-family="Helvetica,sans-Serif" font-size="10.00">::__detailed_single_prediction</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge16_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge16_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M453.18,-602.62C461.01,-602.62 469.1,-602.62 477.18,-602.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="477.03,-606.13 487.03,-602.63 477.03,-599.13 477.03,-606.13"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node3 -->
-<g id="edge17_Node000014_Node000003" class="edge">
-<title>Node14&#45;&gt;Node3</title>
-<g id="a_edge17_Node000014_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M607.29,-623.91C616,-628.27 624.98,-632.97 633.25,-637.62 649.79,-646.94 652.17,-652.33 669.25,-660.62 672.13,-662.02 675.12,-663.38 678.16,-664.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="676.66,-667.86 687.24,-668.39 679.29,-661.37 676.66,-667.86"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="804.88,-651.25 673.38,-651.25 673.38,-632 804.88,-632 804.88,-651.25"/>
-<text text-anchor="middle" x="739.12" y="-637.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge18_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge18_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M633.71,-618.49C649.72,-622.03 666.47,-625.75 681.76,-629.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="680.6,-632.46 691.12,-631.21 682.12,-625.63 680.6,-632.46"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="804.88,-575.25 673.38,-575.25 673.38,-556 804.88,-556 804.88,-575.25"/>
-<text text-anchor="middle" x="739.12" y="-561.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node16 -->
-<g id="edge19_Node000014_Node000016" class="edge">
-<title>Node14&#45;&gt;Node16</title>
-<g id="a_edge19_Node000014_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M633.71,-587.58C648.8,-584.4 664.56,-581.09 679.13,-578.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="679.46,-581.54 688.52,-576.05 678.02,-574.69 679.46,-581.54"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node8 -->
-<g id="edge20_Node000016_Node000008" class="edge">
-<title>Node16&#45;&gt;Node8</title>
-<g id="a_edge20_Node000016_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M805.06,-573.53C864.46,-580.75 950.26,-591.19 998.82,-597.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="998.18,-600.55 1008.53,-598.28 999.03,-593.6 998.18,-600.55"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node9 -->
-<g id="edge21_Node000016_Node000009" class="edge">
-<title>Node16&#45;&gt;Node9</title>
-<g id="a_edge21_Node000016_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M794.05,-555.55C799.34,-553.4 804.43,-550.79 809,-547.62 831.81,-531.82 821.03,-510.59 845,-496.62 892.95,-468.68 959.36,-469.05 999.91,-472.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="999.3,-476.18 1009.61,-473.73 1000.03,-469.22 999.3,-476.18"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node10 -->
-<g id="edge22_Node000016_Node000010" class="edge">
-<title>Node16&#45;&gt;Node10</title>
-<g id="a_edge22_Node000016_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M779.51,-555.53C789.17,-553 799.47,-550.26 809,-547.62 818.41,-545.03 828.33,-542.22 838.05,-539.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="838.81,-542.85 847.45,-536.72 836.87,-536.13 838.81,-542.85"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="960.75,-449.25 845,-449.25 845,-430 960.75,-430 960.75,-449.25"/>
-<text text-anchor="middle" x="902.88" y="-435.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge23_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge23_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M796.82,-555.53C801.21,-553.37 805.35,-550.77 809,-547.62 839.78,-521.13 816.2,-492.27 845,-463.62 848.33,-460.31 852.2,-457.43 856.31,-454.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="857.63,-458.18 864.88,-450.45 854.39,-451.97 857.63,-458.18"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node8 -->
-<g id="edge29_Node000019_Node000008" class="edge">
-<title>Node19&#45;&gt;Node8</title>
-<g id="a_edge29_Node000019_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M563.01,-324.97C566.5,-378.77 583.78,-520.21 669.25,-584.62 720.19,-623.02 915.67,-611.77 998.53,-605.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="998.73,-608.53 1008.4,-604.2 998.14,-601.55 998.73,-608.53"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node9 -->
-<g id="edge31_Node000019_Node000009" class="edge">
-<title>Node19&#45;&gt;Node9</title>
-<g id="a_edge31_Node000019_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M569.6,-282.51C583.2,-247.71 615.66,-179.42 669.25,-151.62 724.39,-123.03 749.38,-134.2 809,-151.62 885.83,-174.08 911.69,-185.38 960.75,-248.62 1011.07,-313.49 1028.46,-413.41 1033.84,-456.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1030.34,-456.79 1034.95,-466.33 1037.29,-455.99 1030.34,-456.79"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node17 -->
-<g id="edge45_Node000019_Node000017" class="edge">
-<title>Node19&#45;&gt;Node17</title>
-<g id="a_edge45_Node000019_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M609.07,-324.93C627.6,-332.92 649.22,-341.73 669.25,-348.62 730.11,-369.58 751.67,-357.37 809,-386.62 827.3,-395.96 827.36,-405.08 845,-415.62 850.72,-419.04 857.01,-422.21 863.26,-425.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="861.68,-428.19 872.25,-428.92 864.44,-421.76 861.68,-428.19"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="783.88,-415.25 694.38,-415.25 694.38,-396 783.88,-396 783.88,-415.25"/>
-<text text-anchor="middle" x="739.12" y="-401.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge26_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge26_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M586.71,-324.78C607.57,-341.91 638.88,-365.73 669.25,-381.62 676.5,-385.42 684.48,-388.83 692.36,-391.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="690.94,-395.01 701.53,-395.08 693.29,-388.42 690.94,-395.01"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="782.75,-291.25 695.5,-291.25 695.5,-272 782.75,-272 782.75,-291.25"/>
-<text text-anchor="middle" x="739.12" y="-277.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::c_str</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node21 -->
-<g id="edge27_Node000019_Node000021" class="edge">
-<title>Node19&#45;&gt;Node21</title>
-<g id="a_edge27_Node000019_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M624.67,-295.81C643.98,-293.39 665.08,-290.76 683.79,-288.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="684.1,-291.91 693.59,-287.19 683.23,-284.96 684.1,-291.91"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="789.12,-254.25 689.12,-254.25 689.12,-235 789.12,-235 789.12,-254.25"/>
-<text text-anchor="middle" x="739.12" y="-240.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node22 -->
-<g id="edge28_Node000019_Node000022" class="edge">
-<title>Node19&#45;&gt;Node22</title>
-<g id="a_edge28_Node000019_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M614.3,-282.34C631.64,-275.62 651.14,-268.44 669.25,-262.62 674.56,-260.92 680.13,-259.26 685.71,-257.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="686.22,-261.17 694.93,-255.15 684.36,-254.42 686.22,-261.17"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ios/eof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="784.25,-217.25 694,-217.25 694,-198 784.25,-198 784.25,-217.25"/>
-<text text-anchor="middle" x="739.12" y="-203.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::eof</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node23 -->
-<g id="edge30_Node000019_Node000023" class="edge">
-<title>Node19&#45;&gt;Node23</title>
-<g id="a_edge30_Node000019_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M585.56,-282.53C606.23,-264.96 637.86,-240.5 669.25,-225.62 673.52,-223.6 678.06,-221.78 682.68,-220.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="683.64,-223.51 692.09,-217.13 681.5,-216.85 683.64,-223.51"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="771.12,-180.25 707.12,-180.25 707.12,-161 771.12,-161 771.12,-180.25"/>
-<text text-anchor="middle" x="739.12" y="-166.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node24 -->
-<g id="edge32_Node000019_Node000024" class="edge">
-<title>Node19&#45;&gt;Node24</title>
-<g id="a_edge32_Node000019_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M576.14,-282.38C594.45,-256.33 628.95,-212.68 669.25,-188.62 677.32,-183.81 686.68,-180.26 695.84,-177.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="696.5,-181.1 705.36,-175.3 694.81,-174.31 696.5,-181.1"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="800,-104.88 678.25,-104.88 678.25,-74.38 800,-74.38 800,-104.88"/>
-<text text-anchor="start" x="686.25" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::insert</text>
-<text text-anchor="middle" x="739.12" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_element</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node25 -->
-<g id="edge33_Node000019_Node000025" class="edge">
-<title>Node19&#45;&gt;Node25</title>
-<g id="a_edge33_Node000019_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M569.26,-282.37C582.96,-244.57 616.34,-165.24 669.25,-118.62 672.4,-115.85 675.86,-113.31 679.5,-110.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="681.15,-114.07 688.14,-106.11 677.71,-107.98 681.15,-114.07"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="794.38,-56.25 683.88,-56.25 683.88,-37 794.38,-37 794.38,-56.25"/>
-<text text-anchor="middle" x="739.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node26 -->
-<g id="edge34_Node000019_Node000026" class="edge">
-<title>Node19&#45;&gt;Node26</title>
-<g id="a_edge34_Node000019_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M565.45,-282.56C573.89,-236.13 600.61,-124.45 669.25,-65.62 670.71,-64.38 672.24,-63.21 673.83,-62.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="675.2,-65.36 682.21,-57.41 671.77,-59.26 675.2,-65.36"/>
-</a>
-</g>
-</g>
-<!-- Node27 -->
-<g id="Node000027" class="node">
-<title>Node27</title>
-<g id="a_Node000027"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="805.25,-339.88 673,-339.88 673,-309.38 805.25,-309.38 805.25,-339.88"/>
-<text text-anchor="start" x="681" y="-326.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::minmax</text>
-<text text-anchor="middle" x="739.12" y="-315.12" font-family="Helvetica,sans-Serif" font-size="10.00">_scaler</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node27 -->
-<g id="edge35_Node000019_Node000027" class="edge">
-<title>Node19&#45;&gt;Node27</title>
-<g id="a_edge35_Node000019_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M624.67,-311.09C636.55,-312.51 649.1,-314 661.36,-315.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="660.66,-318.91 671,-316.62 661.49,-311.96 660.66,-318.91"/>
-</a>
-</g>
-</g>
-<!-- Node31 -->
-<g id="Node000031" class="node">
-<title>Node31</title>
-<g id="a_Node000031"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="788,-19.25 690.25,-19.25 690.25,0 788,0 788,-19.25"/>
-<text text-anchor="middle" x="739.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node31 -->
-<g id="edge42_Node000019_Node000031" class="edge">
-<title>Node19&#45;&gt;Node31</title>
-<g id="a_edge42_Node000019_Node000031"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M563.94,-282.34C569.53,-230.58 591.17,-97.23 669.25,-27.62 672.39,-24.83 675.9,-22.46 679.65,-20.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="680.83,-23.75 688.59,-16.54 678.02,-17.34 680.83,-23.75"/>
-</a>
-</g>
-</g>
-<!-- Node32 -->
-<g id="Node000032" class="node">
-<title>Node32</title>
-<g id="a_Node000032"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="809,-538.25 669.25,-538.25 669.25,-519 809,-519 809,-538.25"/>
-<text text-anchor="middle" x="739.12" y="-524.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node32 -->
-<g id="edge43_Node000019_Node000032" class="edge">
-<title>Node19&#45;&gt;Node32</title>
-<g id="a_edge43_Node000019_Node000032"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M567.06,-324.72C577.97,-366.54 608.14,-460.19 669.25,-509.62 670.95,-511 672.74,-512.28 674.61,-513.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="672.61,-516.36 683.09,-517.94 675.88,-510.17 672.61,-516.36"/>
-</a>
-</g>
-</g>
-<!-- Node33 -->
-<g id="Node000033" class="node">
-<title>Node33</title>
-<g id="a_Node000033"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="795.88,-500.88 682.38,-500.88 682.38,-470.38 795.88,-470.38 795.88,-500.88"/>
-<text text-anchor="start" x="690.38" y="-487.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop</text>
-<text text-anchor="middle" x="739.12" y="-476.12" font-family="Helvetica,sans-Serif" font-size="10.00">_front</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node33 -->
-<g id="edge44_Node000019_Node000033" class="edge">
-<title>Node19&#45;&gt;Node33</title>
-<g id="a_edge44_Node000019_Node000033"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M571.18,-325C586.52,-358.75 620.76,-424.37 669.25,-461.62 670.41,-462.51 671.6,-463.37 672.82,-464.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="670.99,-467.18 681.39,-469.2 674.52,-461.14 670.99,-467.18"/>
-</a>
-</g>
-</g>
-<!-- Node34 -->
-<g id="Node000034" class="node">
-<title>Node34</title>
-<g id="a_Node000034"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="766.25,-452.25 712,-452.25 712,-433 766.25,-433 766.25,-452.25"/>
-<text text-anchor="middle" x="739.12" y="-438.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stod</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node34 -->
-<g id="edge46_Node000019_Node000034" class="edge">
-<title>Node19&#45;&gt;Node34</title>
-<g id="a_edge46_Node000019_Node000034"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M574.95,-324.58C592.72,-351.82 627.41,-398.92 669.25,-424.62 678.68,-430.42 689.95,-434.36 700.61,-437.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="699.83,-440.46 710.35,-439.16 701.32,-433.61 699.83,-440.46"/>
-</a>
-</g>
-</g>
-<!-- Node27&#45;&gt;Node8 -->
-<g id="edge36_Node000027_Node000008" class="edge">
-<title>Node27&#45;&gt;Node8</title>
-<g id="a_edge36_Node000027_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M801.01,-340.3C803.77,-341.63 806.45,-343.07 809,-344.62 828.86,-356.74 825.35,-370.17 845,-382.62 890.74,-411.61 922.91,-381.89 960.75,-420.62 999.36,-460.15 973.76,-489.38 996.75,-539.62 1003.64,-554.68 1013.64,-570.42 1021.83,-582.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1018.91,-584.22 1027.56,-590.35 1024.62,-580.17 1018.91,-584.22"/>
-</a>
-</g>
-</g>
-<!-- Node27&#45;&gt;Node9 -->
-<g id="edge37_Node000027_Node000009" class="edge">
-<title>Node27&#45;&gt;Node9</title>
-<g id="a_edge37_Node000027_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M791.8,-308.92C797.74,-306.45 803.6,-303.68 809,-300.62 827.13,-290.37 825.42,-277.72 845,-270.62 893.37,-253.11 918.61,-241.11 960.75,-270.62 1022.19,-313.66 1033.65,-412.29 1035.66,-456.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="1032.16,-456.12 1035.97,-466 1039.16,-455.9 1032.16,-456.12"/>
-</a>
-</g>
-</g>
-<!-- Node27&#45;&gt;Node10 -->
-<g id="edge38_Node000027_Node000010" class="edge">
-<title>Node27&#45;&gt;Node10</title>
-<g id="a_edge38_Node000027_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M761.33,-340.24C776.04,-351.84 795.36,-368.7 809,-386.62 830.67,-415.09 824.71,-429.16 845,-458.62 854.44,-472.33 866.74,-486.12 877.49,-497.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="874.74,-499.4 884.27,-504.03 879.71,-494.47 874.74,-499.4"/>
-</a>
-</g>
-</g>
-<!-- Node28 -->
-<g id="Node000028" class="node">
-<title>Node28</title>
-<g id="a_Node000028"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="930,-299.25 875.75,-299.25 875.75,-280 930,-280 930,-299.25"/>
-<text text-anchor="middle" x="902.88" y="-285.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node27&#45;&gt;Node28 -->
-<g id="edge39_Node000027_Node000028" class="edge">
-<title>Node27&#45;&gt;Node28</title>
-<g id="a_edge39_Node000027_Node000028"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M805.45,-310.49C825.49,-306.15 846.86,-301.53 864.37,-297.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="865.03,-301.18 874.06,-295.64 863.55,-294.34 865.03,-301.18"/>
-</a>
-</g>
-</g>
-<!-- Node29 -->
-<g id="Node000029" class="node">
-<title>Node29</title>
-<g id="a_Node000029"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="928.5,-373.25 877.25,-373.25 877.25,-354 928.5,-354 928.5,-373.25"/>
-<text text-anchor="middle" x="902.88" y="-359.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node27&#45;&gt;Node29 -->
-<g id="edge40_Node000027_Node000029" class="edge">
-<title>Node27&#45;&gt;Node29</title>
-<g id="a_edge40_Node000027_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M804.98,-340.26C825.75,-345.27 847.98,-350.63 865.9,-354.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="864.99,-358.33 875.53,-357.27 866.63,-351.53 864.99,-358.33"/>
-</a>
-</g>
-</g>
-<!-- Node30 -->
-<g id="Node000030" class="node">
-<title>Node30</title>
-<g id="a_Node000030"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="946.12,-336.25 859.62,-336.25 859.62,-317 946.12,-317 946.12,-336.25"/>
-<text text-anchor="middle" x="902.88" y="-322.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node27&#45;&gt;Node30 -->
-<g id="edge41_Node000027_Node000030" class="edge">
-<title>Node27&#45;&gt;Node30</title>
-<g id="a_edge41_Node000027_Node000030"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M805.45,-325.43C819.7,-325.61 834.61,-325.79 848.34,-325.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="847.99,-329.46 858.04,-326.08 848.08,-322.46 847.99,-329.46"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph.map b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph.map
deleted file mode 100644
index e00923c8b..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph.map
+++ /dev/null
@@ -1,23 +0,0 @@
-<map id="machine_learning::neural_network::NeuralNetwork::single_predict" name="machine_learning::neural_network::NeuralNetwork::single_predict">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,175,111"/>
-<area shape="rect" id="Node000002" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" title=" " alt="" coords="223,55,415,111"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="175,80,207,80,207,86,175,86"/>
-<area shape="rect" id="Node000003" href="$d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" title=" " alt="" coords="470,5,631,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="415,57,454,47,455,52,416,62"/>
-<area shape="rect" id="Node000004" 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="463,70,638,96"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="415,80,447,80,447,86,415,86"/>
-<area shape="rect" id="Node000005" href="$d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" title=" " alt="" coords="463,120,638,145"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="416,101,472,113,471,118,415,106"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="907,37,978,62"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="611,116,637,106,651,97,660,87,670,77,685,69,739,53,794,45,891,43,891,48,794,50,740,58,687,73,673,81,664,91,654,101,640,111,613,121"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="908,144,976,169"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="639,135,893,151,892,156,639,140"/>
-<area shape="rect" id="Node000008" href="$d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" title=" " alt="" coords="689,83,838,123"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="638,118,674,113,674,118,639,123"/>
-<area shape="rect" id="Node000010" 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="686,198,841,224"/>
-<area shape="poly" id="edge11_Node000005_Node000010" title=" " alt="" coords="589,143,713,190,711,195,587,148"/>
-<area shape="poly" id="edge8_Node000008_Node000006" title=" " alt="" coords="833,80,891,62,893,67,835,85"/>
-<area shape="poly" id="edge9_Node000008_Node000007" title=" " alt="" coords="835,121,894,139,893,144,833,126"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="889,90,996,116"/>
-<area shape="poly" id="edge10_Node000008_Node000009" title=" " alt="" coords="838,100,873,100,873,106,838,106"/>
-</map>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph.md5 b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph.md5
deleted file mode 100644
index 9f7d5127f..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0834b5b4875bc39d17f8856c8daba650
\ No newline at end of file
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph.svg
deleted file mode 100644
index 13d489781..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph.svg
+++ /dev/null
@@ -1,290 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::single_predict Pages: 1 -->
-<!--zoomable 172 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 751;
-var viewHeight = 172;
-var sectionId = 'dynsection-12';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>machine_learning::neural_network::NeuralNetwork::single_predict</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-126.5 0,-126.5 0,-84.75 127,-84.75 127,-126.5"/>
-<text text-anchor="start" x="8" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-90.5" font-family="Helvetica,sans-Serif" font-size="10.00">::single_predict</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="307.25,-126.5 163,-126.5 163,-84.75 307.25,-84.75 307.25,-126.5"/>
-<text text-anchor="start" x="171" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="171" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="235.12" y="-90.5" font-family="Helvetica,sans-Serif" font-size="10.00">::__detailed_single_prediction</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.18,-105.62C135.01,-105.62 143.1,-105.62 151.18,-105.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.03,-109.13 161.03,-105.63 151.03,-102.13 151.03,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="469.5,-163.88 348.5,-163.88 348.5,-133.38 469.5,-133.38 469.5,-163.88"/>
-<text text-anchor="start" x="356.5" y="-150.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::apply</text>
-<text text-anchor="middle" x="409" y="-139.12" font-family="Helvetica,sans-Serif" font-size="10.00">_function</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.52,-123.49C317.31,-125.94 327.35,-128.45 337.12,-130.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336,-134.22 346.55,-133.25 337.7,-127.43 336,-134.22"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="474.75,-115.25 343.25,-115.25 343.25,-96 474.75,-96 474.75,-115.25"/>
-<text text-anchor="middle" x="409" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.52,-105.62C315.39,-105.62 323.43,-105.62 331.36,-105.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.36,-109.13 341.36,-105.63 331.36,-102.13 331.36,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="474.75,-78.25 343.25,-78.25 343.25,-59 474.75,-59 474.75,-78.25"/>
-<text text-anchor="middle" x="409" y="-64.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.52,-90.26C321.65,-87.21 336.31,-84.06 349.92,-81.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.56,-84.57 359.6,-79.04 349.09,-77.73 350.56,-84.57"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="729.5,-140.25 676,-140.25 676,-121 729.5,-121 729.5,-140.25"/>
-<text text-anchor="middle" x="702.75" y="-126.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M455.09,-78.7C461.85,-80.91 468.6,-83.53 474.75,-86.62 492.86,-95.73 491.87,-107.25 510.75,-114.62 561.17,-134.32 624.64,-135.44 664.21,-133.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="664.38,-137.14 674.17,-133.1 663.99,-130.15 664.38,-137.14"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="728.38,-60.25 677.12,-60.25 677.12,-41 728.38,-41 728.38,-60.25"/>
-<text text-anchor="middle" x="702.75" y="-46.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M475.11,-64.61C533.79,-60.99 617.92,-55.8 665.45,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="665.42,-56.37 675.19,-52.26 664.99,-49.39 665.42,-56.37"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="624.25,-105.88 513,-105.88 513,-75.38 624.25,-75.38 624.25,-105.88"/>
-<text text-anchor="start" x="521" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="568.62" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M475.02,-77.7C483.75,-78.92 492.71,-80.17 501.46,-81.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="500.91,-84.85 511.29,-82.76 501.87,-77.91 500.91,-84.85"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="626.5,-19.25 510.75,-19.25 510.75,0 626.5,0 626.5,-19.25"/>
-<text text-anchor="middle" x="568.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge11_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge11_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M436.74,-58.62C462.44,-49 501.52,-34.37 530.28,-23.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="531.2,-27 539.34,-20.21 528.75,-20.44 531.2,-27"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge8_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge8_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M621.47,-106.32C636.04,-110.73 651.58,-115.44 665.07,-119.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="663.82,-122.8 674.4,-122.35 665.84,-116.1 663.82,-122.8"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge9_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge9_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M621.47,-74.93C636.38,-70.42 652.3,-65.6 666.01,-61.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="666.92,-64.83 675.47,-58.58 664.89,-58.13 666.92,-64.83"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="743,-100.25 662.5,-100.25 662.5,-81 743,-81 743,-100.25"/>
-<text text-anchor="middle" x="702.75" y="-86.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge10_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge10_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M624.51,-90.62C633.19,-90.62 642.13,-90.62 650.71,-90.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="650.62,-94.13 660.62,-90.63 650.62,-87.13 650.62,-94.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph_org.svg
deleted file mode 100644
index d49891863..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a3b9eac1824d365dce715fb17c33cb96f_cgraph_org.svg
+++ /dev/null
@@ -1,207 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::single_predict Pages: 1 -->
-<svg width="751pt" height="172pt"
- viewBox="0.00 0.00 751.00 171.88" 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 167.88)">
-<title>machine_learning::neural_network::NeuralNetwork::single_predict</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-126.5 0,-126.5 0,-84.75 127,-84.75 127,-126.5"/>
-<text text-anchor="start" x="8" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-90.5" font-family="Helvetica,sans-Serif" font-size="10.00">::single_predict</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="307.25,-126.5 163,-126.5 163,-84.75 307.25,-84.75 307.25,-126.5"/>
-<text text-anchor="start" x="171" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="171" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="235.12" y="-90.5" font-family="Helvetica,sans-Serif" font-size="10.00">::__detailed_single_prediction</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.18,-105.62C135.01,-105.62 143.1,-105.62 151.18,-105.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.03,-109.13 161.03,-105.63 151.03,-102.13 151.03,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="469.5,-163.88 348.5,-163.88 348.5,-133.38 469.5,-133.38 469.5,-163.88"/>
-<text text-anchor="start" x="356.5" y="-150.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::apply</text>
-<text text-anchor="middle" x="409" y="-139.12" font-family="Helvetica,sans-Serif" font-size="10.00">_function</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.52,-123.49C317.31,-125.94 327.35,-128.45 337.12,-130.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336,-134.22 346.55,-133.25 337.7,-127.43 336,-134.22"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="474.75,-115.25 343.25,-115.25 343.25,-96 474.75,-96 474.75,-115.25"/>
-<text text-anchor="middle" x="409" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.52,-105.62C315.39,-105.62 323.43,-105.62 331.36,-105.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.36,-109.13 341.36,-105.63 331.36,-102.13 331.36,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="474.75,-78.25 343.25,-78.25 343.25,-59 474.75,-59 474.75,-78.25"/>
-<text text-anchor="middle" x="409" y="-64.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.52,-90.26C321.65,-87.21 336.31,-84.06 349.92,-81.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.56,-84.57 359.6,-79.04 349.09,-77.73 350.56,-84.57"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="729.5,-140.25 676,-140.25 676,-121 729.5,-121 729.5,-140.25"/>
-<text text-anchor="middle" x="702.75" y="-126.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M455.09,-78.7C461.85,-80.91 468.6,-83.53 474.75,-86.62 492.86,-95.73 491.87,-107.25 510.75,-114.62 561.17,-134.32 624.64,-135.44 664.21,-133.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="664.38,-137.14 674.17,-133.1 663.99,-130.15 664.38,-137.14"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="728.38,-60.25 677.12,-60.25 677.12,-41 728.38,-41 728.38,-60.25"/>
-<text text-anchor="middle" x="702.75" y="-46.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M475.11,-64.61C533.79,-60.99 617.92,-55.8 665.45,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="665.42,-56.37 675.19,-52.26 664.99,-49.39 665.42,-56.37"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="624.25,-105.88 513,-105.88 513,-75.38 624.25,-75.38 624.25,-105.88"/>
-<text text-anchor="start" x="521" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="568.62" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M475.02,-77.7C483.75,-78.92 492.71,-80.17 501.46,-81.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="500.91,-84.85 511.29,-82.76 501.87,-77.91 500.91,-84.85"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="626.5,-19.25 510.75,-19.25 510.75,0 626.5,0 626.5,-19.25"/>
-<text text-anchor="middle" x="568.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge11_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge11_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M436.74,-58.62C462.44,-49 501.52,-34.37 530.28,-23.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="531.2,-27 539.34,-20.21 528.75,-20.44 531.2,-27"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge8_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge8_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M621.47,-106.32C636.04,-110.73 651.58,-115.44 665.07,-119.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="663.82,-122.8 674.4,-122.35 665.84,-116.1 663.82,-122.8"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge9_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge9_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M621.47,-74.93C636.38,-70.42 652.3,-65.6 666.01,-61.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="666.92,-64.83 675.47,-58.58 664.89,-58.13 666.92,-64.83"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="743,-100.25 662.5,-100.25 662.5,-81 743,-81 743,-100.25"/>
-<text text-anchor="middle" x="702.75" y="-86.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge10_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge10_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M624.51,-90.62C633.19,-90.62 642.13,-90.62 650.71,-90.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="650.62,-94.13 660.62,-90.63 650.62,-87.13 650.62,-94.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4c6f63ab965317f9471518ee931b89_cgraph.map b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4c6f63ab965317f9471518ee931b89_cgraph.map
deleted file mode 100644
index c1e5dc76e..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4c6f63ab965317f9471518ee931b89_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="machine_learning::neural_network::NeuralNetwork::NeuralNetwork" name="machine_learning::neural_network::NeuralNetwork::NeuralNetwork">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,16,175,71"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="223,5,294,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="175,28,207,23,208,28,176,33"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="224,55,292,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="176,53,209,58,208,63,175,58"/>
-</map>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4c6f63ab965317f9471518ee931b89_cgraph.md5 b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4c6f63ab965317f9471518ee931b89_cgraph.md5
deleted file mode 100644
index 71115796b..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4c6f63ab965317f9471518ee931b89_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-62e890387611f99b9b86bef292da3350
\ No newline at end of file
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4c6f63ab965317f9471518ee931b89_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4c6f63ab965317f9471518ee931b89_cgraph.svg
deleted file mode 100644
index 0dc21fc30..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4c6f63ab965317f9471518ee931b89_cgraph.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::NeuralNetwork Pages: 1 -->
-<svg width="225pt" height="64pt"
- viewBox="0.00 0.00 224.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>machine_learning::neural_network::NeuralNetwork::NeuralNetwork</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-48.5 0,-48.5 0,-6.75 127,-6.75 127,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::NeuralNetwork</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-56.25 163,-56.25 163,-37 216.5,-37 216.5,-56.25"/>
-<text text-anchor="middle" x="189.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.35,-37.24C135.67,-38.51 143.96,-39.78 151.65,-40.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.85,-44.37 161.26,-42.42 151.91,-37.45 150.85,-44.37"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.38,-19.25 164.12,-19.25 164.12,0 215.38,0 215.38,-19.25"/>
-<text text-anchor="middle" x="189.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.35,-18.52C135.91,-17.28 144.44,-16.04 152.31,-14.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.76,-18.38 162.16,-13.48 151.76,-11.45 152.76,-18.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4c6f63ab965317f9471518ee931b89_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4c6f63ab965317f9471518ee931b89_cgraph_org.svg
deleted file mode 100644
index 94e0d773d..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4c4c6f63ab965317f9471518ee931b89_cgraph_org.svg
+++ /dev/null
@@ -1,59 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::NeuralNetwork Pages: 1 -->
-<svg width="225pt" height="64pt"
- viewBox="0.00 0.00 224.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>machine_learning::neural_network::NeuralNetwork::NeuralNetwork</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-48.5 0,-48.5 0,-6.75 127,-6.75 127,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::NeuralNetwork</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-56.25 163,-56.25 163,-37 216.5,-37 216.5,-56.25"/>
-<text text-anchor="middle" x="189.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.35,-37.24C135.67,-38.51 143.96,-39.78 151.65,-40.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.85,-44.37 161.26,-42.42 151.91,-37.45 150.85,-44.37"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.38,-19.25 164.12,-19.25 164.12,0 215.38,0 215.38,-19.25"/>
-<text text-anchor="middle" x="189.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.35,-18.52C135.91,-17.28 144.44,-16.04 152.31,-14.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.76,-18.38 162.16,-13.48 151.76,-11.45 152.76,-18.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph.map b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph.map
deleted file mode 100644
index 3500910b9..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph.map
+++ /dev/null
@@ -1,23 +0,0 @@
-<map id="machine_learning::neural_network::NeuralNetwork::save_model" name="machine_learning::neural_network::NeuralNetwork::save_model">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,177,175,233"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/c_str.html#" title=" " alt="" coords="240,5,356,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="105,175,151,107,184,71,221,40,228,36,231,40,224,44,188,75,156,111,109,178"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="230,55,367,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="120,175,166,136,221,97,246,85,248,89,224,102,169,140,123,179"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="440,109,511,135"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="140,174,179,156,222,141,275,130,330,123,424,119,424,124,330,128,276,135,223,146,181,161,142,179"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="442,216,510,242"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="175,207,426,223,426,228,175,213"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/find.html#" title=" " alt="" coords="244,271,352,296"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="167,231,249,262,247,267,165,236"/>
-<area shape="rect" id="Node000007" href="$d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" title=" " alt="" coords="224,155,372,196"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="175,190,208,185,209,191,175,196"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="223,320,374,346"/>
-<area shape="poly" id="edge10_Node000001_Node000009" title=" " alt="" coords="122,231,168,270,224,307,234,311,231,316,221,311,165,274,119,235"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="231,369,366,395"/>
-<area shape="poly" id="edge11_Node000001_Node000010" title=" " alt="" coords="110,231,157,294,189,327,224,356,231,360,229,365,221,360,185,331,153,297,106,234"/>
-<area shape="poly" id="edge7_Node000007_Node000004" title=" " alt="" coords="367,152,425,135,426,140,369,157"/>
-<area shape="poly" id="edge8_Node000007_Node000005" title=" " alt="" coords="369,194,427,212,426,217,367,199"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="422,163,529,188"/>
-<area shape="poly" id="edge9_Node000007_Node000008" title=" " alt="" coords="373,173,406,173,406,178,373,178"/>
-</map>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph.md5 b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph.md5
deleted file mode 100644
index 1d8828b20..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7db6ab276d904631c1af8d29455dbb8e
\ No newline at end of file
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph.svg
deleted file mode 100644
index d24ddaecd..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph.svg
+++ /dev/null
@@ -1,230 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::save_model Pages: 1 -->
-<svg width="401pt" height="300pt"
- viewBox="0.00 0.00 401.00 300.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 296.25)">
-<title>machine_learning::neural_network::NeuralNetwork::save_model</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-163.5 0,-163.5 0,-121.75 127,-121.75 127,-163.5"/>
-<text text-anchor="start" x="8" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-127.5" font-family="Helvetica,sans-Serif" font-size="10.00">::save_model</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263.38,-292.25 176.12,-292.25 176.12,-273 263.38,-273 263.38,-292.25"/>
-<text text-anchor="middle" x="219.75" y="-278.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::c_str</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.33,-163.9C92.48,-191.08 123.96,-237.8 163,-264.62 164.58,-265.71 166.24,-266.74 167.95,-267.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.25,-270.77 176.78,-271.96 169.29,-264.47 166.25,-270.77"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.25,-255.25 168.25,-255.25 168.25,-236 271.25,-236 271.25,-255.25"/>
-<text text-anchor="middle" x="219.75" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.07,-163.67C106.23,-180.8 135.01,-204.8 163,-221.62 168.67,-225.03 174.91,-228.21 181.1,-231.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.42,-234.15 189.98,-234.96 182.22,-227.74 179.42,-234.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="379.5,-214.25 326,-214.25 326,-195 379.5,-195 379.5,-214.25"/>
-<text text-anchor="middle" x="352.75" y="-200.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.68,-163.79C119.64,-173.01 141.85,-182.98 163,-188.62 214.15,-202.27 275.6,-205.08 314.17,-205.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.1,-208.79 324.1,-205.28 314.1,-201.79 314.1,-208.79"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="378.38,-134.25 327.12,-134.25 327.12,-115 378.38,-115 378.38,-134.25"/>
-<text text-anchor="middle" x="352.75" y="-120.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.18,-138.7C184.86,-135.08 268.39,-129.85 315.64,-126.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.56,-130.4 325.32,-126.28 315.12,-123.41 315.56,-130.4"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.38,-93.25 179.12,-93.25 179.12,-74 260.38,-74 260.38,-93.25"/>
-<text text-anchor="middle" x="219.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.19,-121.32C140.72,-113.47 163.46,-104.77 181.92,-97.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.01,-101.04 191.1,-94.2 180.51,-94.5 183.01,-101.04"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275.38,-179.88 164.12,-179.88 164.12,-149.38 275.38,-149.38 275.38,-179.88"/>
-<text text-anchor="start" x="172.12" y="-166.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="219.75" y="-155.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.24,-151.57C135.61,-152.77 144.22,-153.99 152.65,-155.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.09,-158.65 162.49,-156.6 153.08,-151.72 152.09,-158.65"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="276.5,-56.25 163,-56.25 163,-37 276.5,-37 276.5,-56.25"/>
-<text text-anchor="middle" x="219.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge10_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge10_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.34,-121.52C105.29,-104.18 134.15,-80.05 163,-64.62 165.38,-63.35 167.87,-62.15 170.42,-61.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.71,-64.27 179.7,-57.3 169.11,-57.77 171.71,-64.27"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.12,-19.25 169.38,-19.25 169.38,0 270.12,0 270.12,-19.25"/>
-<text text-anchor="middle" x="219.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge11_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.2,-121.7C93.84,-95.98 125.36,-52.68 163,-27.62 164.78,-26.44 166.64,-25.33 168.56,-24.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.57,-27.68 177.15,-20.28 166.6,-21.34 169.57,-27.68"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge7_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge7_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M272.15,-180.32C286.48,-184.7 301.77,-189.36 315.07,-193.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.68,-196.66 324.26,-196.23 315.72,-189.96 313.68,-196.66"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge8_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge8_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M272.15,-148.93C286.82,-144.45 302.48,-139.67 316,-135.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.79,-138.96 325.33,-132.69 314.75,-132.26 316.79,-138.96"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="393,-174.25 312.5,-174.25 312.5,-155 393,-155 393,-174.25"/>
-<text text-anchor="middle" x="352.75" y="-160.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge9_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.55,-164.62C283.93,-164.62 292.56,-164.62 300.86,-164.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.8,-168.13 310.8,-164.63 300.8,-161.13 300.8,-168.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph_org.svg
deleted file mode 100644
index 85f683b2c..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a4f14e473bb0722c6490b9dc8da5982aa_cgraph_org.svg
+++ /dev/null
@@ -1,204 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::save_model Pages: 1 -->
-<svg width="401pt" height="300pt"
- viewBox="0.00 0.00 401.00 300.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 296.25)">
-<title>machine_learning::neural_network::NeuralNetwork::save_model</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-163.5 0,-163.5 0,-121.75 127,-121.75 127,-163.5"/>
-<text text-anchor="start" x="8" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-127.5" font-family="Helvetica,sans-Serif" font-size="10.00">::save_model</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263.38,-292.25 176.12,-292.25 176.12,-273 263.38,-273 263.38,-292.25"/>
-<text text-anchor="middle" x="219.75" y="-278.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::c_str</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.33,-163.9C92.48,-191.08 123.96,-237.8 163,-264.62 164.58,-265.71 166.24,-266.74 167.95,-267.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.25,-270.77 176.78,-271.96 169.29,-264.47 166.25,-270.77"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.25,-255.25 168.25,-255.25 168.25,-236 271.25,-236 271.25,-255.25"/>
-<text text-anchor="middle" x="219.75" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.07,-163.67C106.23,-180.8 135.01,-204.8 163,-221.62 168.67,-225.03 174.91,-228.21 181.1,-231.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.42,-234.15 189.98,-234.96 182.22,-227.74 179.42,-234.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="379.5,-214.25 326,-214.25 326,-195 379.5,-195 379.5,-214.25"/>
-<text text-anchor="middle" x="352.75" y="-200.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.68,-163.79C119.64,-173.01 141.85,-182.98 163,-188.62 214.15,-202.27 275.6,-205.08 314.17,-205.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.1,-208.79 324.1,-205.28 314.1,-201.79 314.1,-208.79"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="378.38,-134.25 327.12,-134.25 327.12,-115 378.38,-115 378.38,-134.25"/>
-<text text-anchor="middle" x="352.75" y="-120.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.18,-138.7C184.86,-135.08 268.39,-129.85 315.64,-126.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.56,-130.4 325.32,-126.28 315.12,-123.41 315.56,-130.4"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.38,-93.25 179.12,-93.25 179.12,-74 260.38,-74 260.38,-93.25"/>
-<text text-anchor="middle" x="219.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.19,-121.32C140.72,-113.47 163.46,-104.77 181.92,-97.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.01,-101.04 191.1,-94.2 180.51,-94.5 183.01,-101.04"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275.38,-179.88 164.12,-179.88 164.12,-149.38 275.38,-149.38 275.38,-179.88"/>
-<text text-anchor="start" x="172.12" y="-166.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="219.75" y="-155.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.24,-151.57C135.61,-152.77 144.22,-153.99 152.65,-155.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.09,-158.65 162.49,-156.6 153.08,-151.72 152.09,-158.65"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="276.5,-56.25 163,-56.25 163,-37 276.5,-37 276.5,-56.25"/>
-<text text-anchor="middle" x="219.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge10_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge10_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.34,-121.52C105.29,-104.18 134.15,-80.05 163,-64.62 165.38,-63.35 167.87,-62.15 170.42,-61.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.71,-64.27 179.7,-57.3 169.11,-57.77 171.71,-64.27"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.12,-19.25 169.38,-19.25 169.38,0 270.12,0 270.12,-19.25"/>
-<text text-anchor="middle" x="219.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge11_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.2,-121.7C93.84,-95.98 125.36,-52.68 163,-27.62 164.78,-26.44 166.64,-25.33 168.56,-24.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.57,-27.68 177.15,-20.28 166.6,-21.34 169.57,-27.68"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge7_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge7_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M272.15,-180.32C286.48,-184.7 301.77,-189.36 315.07,-193.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.68,-196.66 324.26,-196.23 315.72,-189.96 313.68,-196.66"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge8_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge8_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M272.15,-148.93C286.82,-144.45 302.48,-139.67 316,-135.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.79,-138.96 325.33,-132.69 314.75,-132.26 316.79,-138.96"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="393,-174.25 312.5,-174.25 312.5,-155 393,-155 393,-174.25"/>
-<text text-anchor="middle" x="352.75" y="-160.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge9_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.55,-164.62C283.93,-164.62 292.56,-164.62 300.86,-164.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.8,-168.13 310.8,-164.63 300.8,-161.13 300.8,-168.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph.map b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph.map
deleted file mode 100644
index 8f4c83753..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph.map
+++ /dev/null
@@ -1,115 +0,0 @@
-<map id="machine_learning::neural_network::NeuralNetwork::fit_from_csv" name="machine_learning::neural_network::NeuralNetwork::fit_from_csv">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,795,175,851"/>
-<area shape="rect" id="Node000002" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0" title=" " alt="" coords="223,520,411,560"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="112,793,287,571,291,575,116,796"/>
-<area shape="rect" id="Node000031" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d" title=" " alt="" coords="470,1079,640,1135"/>
-<area shape="poly" id="edge48_Node000001_Node000031" title=" " alt="" coords="139,849,496,1068,494,1073,136,853"/>
-<area shape="rect" id="Node000003" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" title=" " alt="" coords="459,123,651,179"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="319,519,332,458,357,372,375,326,398,280,425,236,457,196,467,186,471,190,461,199,429,239,403,282,380,328,362,374,337,459,324,520"/>
-<area shape="rect" id="Node000004" href="$d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" title=" " alt="" coords="712,66,874,107"/>
-<area shape="poly" id="edge13_Node000002_Node000004" title=" " alt="" coords="315,520,318,440,324,386,335,327,353,266,378,208,412,154,457,109,484,91,513,78,575,64,638,60,697,65,697,70,638,66,576,69,515,83,487,96,461,113,417,157,383,210,358,268,341,328,330,387,323,441,320,520"/>
-<area shape="rect" id="Node000006" href="$d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" title=" " alt="" coords="705,510,881,536"/>
-<area shape="poly" id="edge39_Node000002_Node000006" title=" " alt="" coords="362,517,408,500,458,487,512,479,555,478,652,487,727,503,726,508,651,492,555,483,513,485,460,492,410,505,364,522"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="1177,498,1248,524"/>
-<area shape="poly" id="edge23_Node000002_Node000007" title=" " alt="" coords="321,518,337,470,364,406,403,339,429,308,458,282,531,260,673,226,814,192,885,170,898,154,904,138,906,103,909,68,918,52,933,37,976,12,1017,3,1037,4,1058,11,1098,37,1109,51,1118,68,1129,113,1133,168,1134,227,1133,345,1137,394,1146,431,1164,461,1187,485,1183,489,1160,464,1142,433,1132,395,1128,345,1129,227,1128,168,1124,114,1113,70,1105,53,1094,41,1055,15,1036,10,1017,8,978,17,936,41,922,55,915,70,911,103,909,139,902,157,888,174,816,197,674,231,532,265,460,286,432,312,408,342,368,408,342,472,326,520"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="1178,629,1247,654"/>
-<area shape="poly" id="edge31_Node000002_Node000008" title=" " alt="" coords="412,558,459,567,664,594,865,614,1163,636,1163,641,865,619,663,599,459,572,411,564"/>
-<area shape="rect" id="Node000009" href="$d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" title=" " alt="" coords="941,386,1090,427"/>
-<area shape="poly" id="edge32_Node000002_Node000009" title=" " alt="" coords="336,518,388,470,421,446,458,426,519,400,572,383,620,372,667,368,764,370,887,381,926,386,925,392,886,387,764,375,667,373,621,378,573,388,520,405,460,431,424,450,391,475,339,521"/>
-<area shape="rect" id="Node000012" href="$d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec" title=" " alt="" coords="706,235,880,261"/>
-<area shape="poly" id="edge14_Node000002_Node000012" title=" " alt="" coords="324,518,343,480,372,431,410,381,457,338,513,306,573,283,634,266,690,255,691,261,635,271,575,288,515,311,461,342,414,384,377,434,348,482,329,521"/>
-<area shape="rect" id="Node000017" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/duration/duration_cast.html#" title=" " alt="" coords="469,502,641,528"/>
-<area shape="poly" id="edge22_Node000002_Node000017" title=" " alt="" coords="411,527,453,523,454,528,412,533"/>
-<area shape="rect" id="Node000018" href="$d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f" title=" " alt="" coords="935,1333,1096,1374"/>
-<area shape="poly" id="edge24_Node000002_Node000018" title=" " alt="" coords="320,561,321,630,327,736,342,868,370,1016,391,1092,417,1168,447,1241,484,1312,527,1378,578,1438,635,1490,701,1534,750,1556,793,1563,836,1556,885,1534,925,1504,957,1466,982,1424,999,1387,1004,1390,987,1427,962,1469,929,1508,888,1538,837,1561,793,1568,748,1561,698,1538,632,1494,574,1441,523,1381,480,1315,443,1244,412,1170,386,1094,365,1017,337,869,321,736,316,630,315,561"/>
-<area shape="rect" id="Node000023" href="$d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43" title=" " alt="" coords="699,396,887,436"/>
-<area shape="poly" id="edge33_Node000002_Node000023" title=" " alt="" coords="349,517,399,489,458,464,515,448,573,436,683,421,684,426,574,441,516,454,460,469,402,494,352,522"/>
-<area shape="rect" id="Node000024" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="981,705,1050,730"/>
-<area shape="poly" id="edge38_Node000002_Node000024" title=" " alt="" coords="343,559,395,597,427,617,460,632,528,656,600,674,742,699,870,711,966,715,965,720,870,716,742,704,599,679,527,661,458,637,424,621,392,602,340,563"/>
-<area shape="rect" id="Node000025" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/high_resolution_clock/now.html#" title=" " alt="" coords="464,704,646,744"/>
-<area shape="poly" id="edge40_Node000002_Node000025" title=" " alt="" coords="336,559,388,620,422,653,461,683,479,694,477,699,457,688,419,657,384,623,332,563"/>
-<area shape="rect" id="Node000026" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="492,769,618,794"/>
-<area shape="poly" id="edge41_Node000002_Node000026" title=" " alt="" coords="328,560,346,601,374,654,413,708,435,733,461,754,479,764,476,769,457,758,432,737,408,712,370,657,341,604,323,562"/>
-<area shape="rect" id="Node000027" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="958,957,1073,982"/>
-<area shape="poly" id="edge42_Node000002_Node000027" title=" " alt="" coords="323,561,334,621,357,702,375,744,398,785,426,823,461,854,489,872,515,886,566,899,615,901,664,895,714,887,767,883,824,887,888,906,903,914,913,924,922,934,936,943,947,948,945,953,933,948,919,938,909,928,900,919,886,911,823,892,767,888,714,892,665,900,615,906,566,905,513,891,486,877,457,858,422,826,394,788,371,747,352,703,329,622,318,562"/>
-<area shape="rect" id="Node000028" href="$d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" title=" " alt="" coords="478,818,633,844"/>
-<area shape="poly" id="edge43_Node000002_Node000028" title=" " alt="" coords="325,560,340,610,367,677,406,746,432,778,461,805,465,808,462,812,457,809,428,781,402,749,362,679,335,612,320,562"/>
-<area shape="rect" id="Node000029" href="$d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a" title=" " alt="" coords="699,461,887,486"/>
-<area shape="poly" id="edge44_Node000002_Node000029" title=" " alt="" coords="412,555,467,560,528,560,591,554,650,538,665,529,674,518,683,506,698,495,709,490,712,495,701,500,687,510,678,522,668,533,652,543,592,559,528,566,467,565,411,560"/>
-<area shape="rect" id="Node000030" href="$d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e" title=" " alt="" coords="470,8,640,48"/>
-<area shape="poly" id="edge47_Node000002_Node000030" title=" " alt="" coords="316,519,321,438,328,381,340,317,358,251,382,184,415,121,457,65,468,55,471,59,461,69,419,124,387,187,363,252,345,318,333,381,326,438,321,520"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="651,122,700,109,701,114,653,127"/>
-<area shape="rect" id="Node000005" 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="705,134,881,160"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="652,147,690,146,690,151,652,152"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="562,179,574,244,598,330,616,376,639,420,667,461,701,497,704,499,701,504,698,501,663,465,635,423,611,378,593,332,569,245,557,180"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="881,533,984,542,1040,542,1096,538,1161,524,1162,529,1096,543,1041,547,984,547,881,539"/>
-<area shape="poly" id="edge7_Node000006_Node000008" title=" " alt="" coords="842,534,1165,625,1163,631,841,539"/>
-<area shape="poly" id="edge8_Node000006_Node000009" title=" " alt="" coords="858,507,886,496,935,467,978,435,981,439,938,472,888,501,859,512"/>
-<area shape="rect" id="Node000011" 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="938,502,1092,528"/>
-<area shape="poly" id="edge12_Node000006_Node000011" title=" " alt="" coords="881,517,922,515,923,521,881,522"/>
-<area shape="poly" id="edge9_Node000009_Node000007" title=" " alt="" coords="1062,425,1097,443,1177,487,1174,492,1095,448,1060,430"/>
-<area shape="poly" id="edge10_Node000009_Node000008" title=" " alt="" coords="1073,426,1098,444,1116,466,1126,487,1134,509,1146,535,1196,614,1192,617,1142,537,1129,511,1121,489,1112,469,1094,447,1070,430"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="1159,394,1266,420"/>
-<area shape="poly" id="edge11_Node000009_Node000010" title=" " alt="" coords="1090,404,1144,404,1144,409,1090,409"/>
-<area shape="poly" id="edge18_Node000012_Node000007" title=" " alt="" coords="856,233,885,214,898,197,904,179,905,142,908,106,917,88,933,73,976,48,1017,39,1037,40,1057,47,1098,73,1108,85,1117,101,1127,142,1132,192,1133,246,1134,353,1138,398,1146,431,1165,461,1187,485,1183,489,1160,464,1142,433,1132,398,1129,353,1128,246,1126,192,1122,143,1112,103,1104,88,1094,77,1055,51,1036,46,1017,44,978,53,936,77,921,92,914,107,911,142,909,180,902,199,888,218,859,237"/>
-<area shape="poly" id="edge19_Node000012_Node000008" title=" " alt="" coords="873,259,929,274,989,297,1048,330,1074,350,1098,373,1113,394,1123,413,1130,450,1133,490,1146,535,1170,578,1195,615,1190,618,1165,581,1142,537,1128,491,1124,451,1118,415,1109,396,1094,377,1071,354,1045,334,987,302,927,279,872,264"/>
-<area shape="poly" id="edge20_Node000012_Node000009" title=" " alt="" coords="809,259,863,309,936,366,954,376,951,381,933,370,859,313,806,263"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="976,87,1054,113"/>
-<area shape="poly" id="edge15_Node000012_Node000013" title=" " alt="" coords="853,232,885,214,902,192,908,169,915,145,933,122,960,107,963,112,936,126,919,148,913,171,906,194,888,218,856,237"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/distance.html#" title=" " alt="" coords="967,137,1064,162"/>
-<area shape="poly" id="edge16_Node000012_Node000014" title=" " alt="" coords="843,232,885,214,899,203,909,193,918,182,933,171,951,163,954,168,936,176,922,186,913,196,903,207,888,218,845,237"/>
-<area shape="rect" id="Node000015" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="981,186,1050,212"/>
-<area shape="poly" id="edge17_Node000012_Node000015" title=" " alt="" coords="854,232,965,207,967,212,855,237"/>
-<area shape="rect" id="Node000016" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max_element.html#" title=" " alt="" coords="953,235,1078,261"/>
-<area shape="poly" id="edge21_Node000012_Node000016" title=" " alt="" coords="880,245,937,245,937,251,880,251"/>
-<area shape="poly" id="edge25_Node000018_Node000007" title=" " alt="" coords="1019,1332,1053,1191,1093,994,1101,937,1105,887,1107,802,1114,719,1124,671,1142,615,1163,571,1189,534,1193,537,1168,574,1146,617,1129,672,1119,719,1112,803,1110,888,1107,937,1099,995,1058,1192,1025,1333"/>
-<area shape="poly" id="edge26_Node000018_Node000008" title=" " alt="" coords="1074,1331,1094,1313,1108,1290,1121,1261,1144,1185,1162,1094,1177,995,1198,804,1207,670,1213,670,1203,804,1183,996,1168,1095,1149,1186,1126,1263,1113,1293,1098,1317,1078,1335"/>
-<area shape="rect" id="Node000019" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/system_clock/now.html#" title=" " alt="" coords="1144,1414,1281,1455"/>
-<area shape="poly" id="edge27_Node000018_Node000019" title=" " alt="" coords="1068,1372,1148,1406,1146,1411,1066,1377"/>
-<area shape="rect" id="Node000020" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="1176,1266,1249,1292"/>
-<area shape="poly" id="edge28_Node000018_Node000020" title=" " alt="" coords="1067,1330,1143,1300,1161,1294,1163,1299,1145,1305,1069,1335"/>
-<area shape="rect" id="Node000021" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="1173,1315,1252,1341"/>
-<area shape="poly" id="edge29_Node000018_Node000021" title=" " alt="" coords="1096,1340,1157,1333,1158,1338,1097,1346"/>
-<area shape="rect" id="Node000022" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="1174,1365,1252,1390"/>
-<area shape="poly" id="edge30_Node000018_Node000022" title=" " alt="" coords="1097,1361,1158,1368,1157,1374,1096,1366"/>
-<area shape="poly" id="edge34_Node000023_Node000007" title=" " alt="" coords="838,393,892,373,958,358,994,355,1029,355,1064,361,1097,372,1115,384,1125,398,1146,431,1192,485,1188,488,1142,434,1121,401,1111,388,1095,377,1063,366,1029,360,994,360,959,363,894,378,840,398"/>
-<area shape="poly" id="edge35_Node000023_Node000008" title=" " alt="" coords="888,429,1008,455,1060,470,1097,487,1120,509,1147,542,1197,614,1192,617,1143,546,1117,512,1095,492,1059,475,1006,460,886,434"/>
-<area shape="poly" id="edge36_Node000023_Node000009" title=" " alt="" coords="887,410,925,408,925,413,887,415"/>
-<area shape="poly" id="edge37_Node000023_Node000011" title=" " alt="" coords="863,435,888,446,912,463,936,481,962,493,960,498,933,485,909,467,885,450,861,439"/>
-<area shape="poly" id="edge45_Node000029_Node000009" title=" " alt="" coords="844,458,886,446,936,430,938,435,887,451,846,463"/>
-<area shape="poly" id="edge46_Node000029_Node000011" title=" " alt="" coords="866,484,928,496,927,501,865,490"/>
-<area shape="poly" id="edge52_Node000031_Node000007" title=" " alt="" coords="563,1078,586,1009,620,922,658,842,678,812,698,791,725,774,751,763,777,756,802,754,851,757,900,767,947,777,995,780,1019,777,1044,770,1069,758,1094,741,1108,727,1117,714,1125,685,1129,653,1142,615,1166,572,1191,535,1195,538,1171,575,1146,617,1134,654,1130,686,1122,716,1113,731,1098,745,1071,763,1046,775,1020,782,995,785,947,782,898,772,851,763,802,759,778,762,753,768,727,779,701,796,682,815,663,845,625,925,591,1011,568,1080"/>
-<area shape="poly" id="edge54_Node000031_Node000008" title=" " alt="" coords="573,1133,594,1167,622,1205,658,1241,701,1268,751,1288,793,1295,836,1289,885,1268,928,1243,967,1213,1003,1178,1034,1140,1063,1098,1088,1055,1130,964,1161,874,1183,791,1205,669,1211,670,1188,792,1166,876,1135,966,1093,1057,1067,1101,1039,1143,1007,1182,971,1217,931,1248,888,1273,837,1294,793,1300,749,1293,698,1273,655,1245,618,1209,589,1170,569,1136"/>
-<area shape="poly" id="edge68_Node000031_Node000011" title=" " alt="" coords="565,1078,639,888,697,748,729,711,764,677,839,616,912,567,972,533,975,538,915,572,842,620,767,681,733,715,702,751,643,890,570,1080"/>
-<area shape="rect" id="Node000032" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="733,921,853,946"/>
-<area shape="poly" id="edge49_Node000031_Node000032" title=" " alt="" coords="574,1077,625,1015,659,983,698,955,718,946,720,951,701,960,663,987,629,1019,578,1080"/>
-<area shape="rect" id="Node000033" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/c_str.html#" title=" " alt="" coords="735,970,851,996"/>
-<area shape="poly" id="edge50_Node000031_Node000033" title=" " alt="" coords="588,1076,638,1039,698,1004,719,996,721,1001,700,1009,641,1044,591,1081"/>
-<area shape="rect" id="Node000034" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ifstream/close.html#" title=" " alt="" coords="726,1019,860,1045"/>
-<area shape="poly" id="edge51_Node000031_Node000034" title=" " alt="" coords="632,1076,699,1054,721,1047,723,1052,700,1059,634,1081"/>
-<area shape="rect" id="Node000035" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ios/eof.html#" title=" " alt="" coords="733,1069,853,1094"/>
-<area shape="poly" id="edge53_Node000031_Node000035" title=" " alt="" coords="640,1095,717,1087,717,1092,640,1100"/>
-<area shape="rect" id="Node000036" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/getline.html#" title=" " alt="" coords="750,1118,836,1144"/>
-<area shape="poly" id="edge55_Node000031_Node000036" title=" " alt="" coords="640,1113,735,1122,735,1128,640,1118"/>
-<area shape="rect" id="Node000037" href="$d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd" title=" " alt="" coords="712,1168,874,1208"/>
-<area shape="poly" id="edge56_Node000031_Node000037" title=" " alt="" coords="640,1133,718,1160,716,1165,638,1138"/>
-<area shape="rect" id="Node000038" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ifstream/is_open.html#" title=" " alt="" coords="719,1233,867,1258"/>
-<area shape="poly" id="edge57_Node000031_Node000038" title=" " alt="" coords="586,1133,637,1177,701,1218,716,1225,714,1229,698,1222,634,1181,583,1137"/>
-<area shape="rect" id="Node000039" href="$d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26" title=" " alt="" coords="705,805,881,846"/>
-<area shape="poly" id="edge58_Node000031_Node000039" title=" " alt="" coords="572,1077,625,998,697,906,752,854,756,858,701,910,629,1001,576,1080"/>
-<area shape="rect" id="Node000041" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ifstream/open.html#" title=" " alt="" coords="728,1334,858,1360"/>
-<area shape="poly" id="edge65_Node000031_Node000041" title=" " alt="" coords="571,1134,591,1174,620,1222,657,1271,701,1313,722,1325,719,1330,698,1317,653,1274,615,1225,586,1176,566,1136"/>
-<area shape="rect" id="Node000042" href="$d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d" title=" " alt="" coords="700,1383,886,1409"/>
-<area shape="poly" id="edge66_Node000031_Node000042" title=" " alt="" coords="566,1134,582,1185,610,1249,649,1315,673,1344,701,1370,706,1373,702,1378,698,1374,669,1348,644,1318,605,1252,577,1187,561,1136"/>
-<area shape="rect" id="Node000043" href="$d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093" title=" " alt="" coords="717,1433,869,1474"/>
-<area shape="poly" id="edge67_Node000031_Node000043" title=" " alt="" coords="564,1135,578,1194,605,1270,623,1311,645,1350,671,1387,701,1420,706,1424,703,1428,698,1423,667,1390,640,1353,618,1313,600,1272,573,1195,559,1136"/>
-<area shape="rect" id="Node000044" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/stof.html#" title=" " alt="" coords="757,1498,829,1524"/>
-<area shape="poly" id="edge69_Node000031_Node000044" title=" " alt="" coords="561,1135,571,1205,594,1299,612,1349,636,1398,665,1444,701,1483,720,1496,743,1503,741,1508,718,1501,698,1488,661,1447,631,1401,607,1352,589,1301,566,1206,556,1135"/>
-<area shape="poly" id="edge59_Node000039_Node000007" title=" " alt="" coords="882,822,1006,812,1060,801,1080,794,1094,785,1112,766,1122,748,1126,729,1128,709,1129,666,1133,641,1142,615,1165,571,1190,534,1195,537,1170,574,1146,617,1138,643,1134,666,1133,709,1132,730,1127,749,1116,769,1098,789,1082,798,1061,806,1007,818,882,827"/>
-<area shape="poly" id="edge60_Node000039_Node000008" title=" " alt="" coords="858,844,912,856,973,862,1036,856,1066,848,1095,835,1117,820,1136,800,1167,755,1189,708,1202,668,1207,670,1194,710,1172,758,1140,804,1120,824,1097,840,1068,853,1037,862,973,867,911,861,857,849"/>
-<area shape="poly" id="edge61_Node000039_Node000009" title=" " alt="" coords="798,804,815,747,844,666,883,576,932,488,954,460,977,436,981,440,958,464,937,491,888,578,849,668,820,748,803,805"/>
-<area shape="poly" id="edge63_Node000039_Node000024" title=" " alt="" coords="836,802,972,735,975,740,838,807"/>
-<area shape="poly" id="edge64_Node000039_Node000027" title=" " alt="" coords="861,844,888,862,905,884,913,905,920,924,936,943,945,949,942,954,933,947,915,927,908,906,901,886,885,866,858,849"/>
-<area shape="rect" id="Node000040" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="979,907,1052,933"/>
-<area shape="poly" id="edge62_Node000039_Node000040" title=" " alt="" coords="847,844,888,862,936,886,966,899,964,904,934,891,886,867,845,849"/>
-</map>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph.md5 b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph.md5
deleted file mode 100644
index 3cb5af9f2..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7c052a2107eede254ebcd3a482fe0c3d
\ No newline at end of file
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph.svg
deleted file mode 100644
index 0f84e8b9a..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph.svg
+++ /dev/null
@@ -1,1129 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::fit_from_csv Pages: 1 -->
-<!--zoomable 1178 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 965;
-var viewHeight = 1178;
-var sectionId = 'dynsection-8';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>machine_learning::neural_network::NeuralNetwork::fit_from_csv</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-578.21 0,-578.21 0,-536.46 127,-536.46 127,-578.21"/>
-<text text-anchor="start" x="8" y="-564.71" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-553.46" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-542.21" font-family="Helvetica,sans-Serif" font-size="10.00">::fit_from_csv</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.25,-784.59 163,-784.59 163,-754.09 304.25,-754.09 304.25,-784.59"/>
-<text text-anchor="start" x="171" y="-771.09" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="middle" x="233.62" y="-759.84" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork::fit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.24,-578.44C112.52,-617.89 179.71,-702.61 213.04,-744.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="210.28,-746.8 219.24,-752.46 215.77,-742.45 210.28,-746.8"/>
-</a>
-</g>
-</g>
-<!-- Node31 -->
-<g id="Node000031" class="node">
-<title>Node31</title>
-<g id="a_Node000031"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="475.88,-365.21 348.88,-365.21 348.88,-323.46 475.88,-323.46 475.88,-365.21"/>
-<text text-anchor="start" x="356.88" y="-351.71" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="356.88" y="-340.46" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="412.38" y="-329.21" font-family="Helvetica,sans-Serif" font-size="10.00">::get_XY_from_csv</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node31 -->
-<g id="edge48_Node000001_Node000031" class="edge">
-<title>Node1&#45;&gt;Node31</title>
-<g id="a_edge48_Node000001_Node000031"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.03,-536.14C162.45,-497.19 297.38,-414.34 367.31,-371.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="368.75,-374.62 375.44,-366.4 365.09,-368.65 368.75,-374.62"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="484.5,-1082.21 340.25,-1082.21 340.25,-1040.46 484.5,-1040.46 484.5,-1082.21"/>
-<text text-anchor="start" x="348.25" y="-1068.71" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="348.25" y="-1057.46" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="412.38" y="-1046.21" font-family="Helvetica,sans-Serif" font-size="10.00">::__detailed_single_prediction</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.09,-785.01C244.7,-828.6 271.56,-952.86 340.25,-1026.34 342.62,-1028.87 345.21,-1031.24 347.95,-1033.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.77,-1036.2 355.94,-1039.16 349.83,-1030.51 345.77,-1036.2"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="651.25,-1124.59 530.25,-1124.59 530.25,-1094.09 651.25,-1094.09 651.25,-1124.59"/>
-<text text-anchor="start" x="538.25" y="-1111.09" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::apply</text>
-<text text-anchor="middle" x="590.75" y="-1099.84" font-family="Helvetica,sans-Serif" font-size="10.00">_function</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge13_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge13_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.22,-784.74C233.75,-837.66 240.09,-1013.13 340.25,-1091.34 390.18,-1130.33 464.22,-1130.73 518.68,-1123.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="519.06,-1127.34 528.49,-1122.5 518.1,-1120.4 519.06,-1127.34"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="656.5,-791.96 525,-791.96 525,-772.71 656.5,-772.71 656.5,-791.96"/>
-<text text-anchor="middle" x="590.75" y="-778.46" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge39_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge39_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M268.53,-784.93C288.86,-793.4 315.48,-803.02 340.25,-807.34 403.41,-818.35 420.82,-814.8 484.5,-807.34 495.51,-806.05 518.75,-800.63 540.6,-795.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="541.18,-798.63 550.02,-792.79 539.46,-791.85 541.18,-798.63"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="932.25,-800.96 878.75,-800.96 878.75,-781.71 932.25,-781.71 932.25,-800.96"/>
-<text text-anchor="middle" x="905.5" y="-787.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge23_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge23_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M238.65,-785.06C248.91,-821.87 279.63,-914.1 340.25,-961.34 354.78,-972.66 647.41,-1032.91 661,-1045.34 695.86,-1077.21 658.35,-1118.18 697,-1145.34 741,-1176.26 777.74,-1180.99 818,-1145.34 867.45,-1101.56 827.39,-910.78 854,-850.34 860.94,-834.56 873.54,-819.83 884.42,-809.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="886.67,-811.73 891.53,-802.31 881.86,-806.64 886.67,-811.73"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="931.12,-702.96 879.88,-702.96 879.88,-683.71 931.12,-683.71 931.12,-702.96"/>
-<text text-anchor="middle" x="905.5" y="-689.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge31_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge31_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.6,-753.64C316.46,-751.3 328.68,-749.09 340.25,-747.34 538.39,-717.32 778.34,-700.89 868.21,-695.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="868.35,-698.92 878.12,-694.83 867.93,-691.93 868.35,-698.92"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="813.12,-884.59 701.88,-884.59 701.88,-854.09 813.12,-854.09 813.12,-884.59"/>
-<text text-anchor="start" x="709.88" y="-871.09" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="757.5" y="-859.84" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge32_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge32_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.1,-784.82C268.08,-804.11 303.35,-836.57 340.25,-853.34 470.72,-912.62 518.25,-898.95 661,-886.34 670.46,-885.5 680.4,-884.21 690.13,-882.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="690.63,-886.17 699.93,-881.09 689.5,-879.26 690.63,-886.17"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="655.75,-997.96 525.75,-997.96 525.75,-978.71 655.75,-978.71 655.75,-997.96"/>
-<text text-anchor="middle" x="590.75" y="-984.46" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::argmax</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge14_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge14_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M241.11,-784.74C254.76,-815.26 289.47,-883.58 340.25,-919.34 391.69,-955.56 461.47,-972.8 514.16,-980.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="513.56,-984.44 523.97,-982.43 514.58,-977.51 513.56,-984.44"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="477,-797.96 347.75,-797.96 347.75,-778.71 477,-778.71 477,-797.96"/>
-<text text-anchor="middle" x="412.38" y="-784.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::duration_cast</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node17 -->
-<g id="edge22_Node000002_Node000017" class="edge">
-<title>Node2&#45;&gt;Node17</title>
-<g id="a_edge22_Node000002_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.74,-776.88C315.07,-777.99 325.75,-779.13 336.18,-780.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="335.55,-783.71 345.87,-781.3 336.3,-776.75 335.55,-783.71"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="818,-174.59 697,-174.59 697,-144.09 818,-144.09 818,-174.59"/>
-<text text-anchor="start" x="705" y="-161.09" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::equal</text>
-<text text-anchor="middle" x="757.5" y="-149.84" font-family="Helvetica,sans-Serif" font-size="10.00">_shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node18 -->
-<g id="edge24_Node000002_Node000018" class="edge">
-<title>Node2&#45;&gt;Node18</title>
-<g id="a_edge24_Node000002_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.26,-753.83C233.02,-661.09 240.38,-178.62 520.5,-22.34 575.03,8.08 605.64,6.55 661,-22.34 705.61,-45.62 733.62,-100.29 747.04,-133.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="743.73,-134.25 750.63,-142.29 750.25,-131.71 743.73,-134.25"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="661,-877.59 520.5,-877.59 520.5,-847.09 661,-847.09 661,-877.59"/>
-<text text-anchor="start" x="528.5" y="-864.09" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::hadamard</text>
-<text text-anchor="middle" x="590.75" y="-852.84" font-family="Helvetica,sans-Serif" font-size="10.00">_product</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node23 -->
-<g id="edge33_Node000002_Node000023" class="edge">
-<title>Node2&#45;&gt;Node23</title>
-<g id="a_edge33_Node000002_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.79,-784.87C279.57,-797.48 310.77,-814.71 340.25,-824.34 394.93,-842.19 459.14,-851.73 508.72,-856.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="508.23,-860.25 518.53,-857.74 508.91,-853.28 508.23,-860.25"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="783.12,-645.96 731.88,-645.96 731.88,-626.71 783.12,-626.71 783.12,-645.96"/>
-<text text-anchor="middle" x="757.5" y="-632.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node24 -->
-<g id="edge38_Node000002_Node000024" class="edge">
-<title>Node2&#45;&gt;Node24</title>
-<g id="a_edge38_Node000002_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M252.29,-753.8C272.2,-737.2 306.26,-711.52 340.25,-698.34 473.51,-646.68 646.15,-637.77 720.18,-636.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="720.14,-639.94 730.1,-636.3 720.05,-632.94 720.14,-639.94"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="480.38,-646.59 344.38,-646.59 344.38,-616.09 480.38,-616.09 480.38,-646.59"/>
-<text text-anchor="start" x="352.38" y="-633.09" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::high_resolution</text>
-<text text-anchor="middle" x="412.38" y="-621.84" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node25 -->
-<g id="edge40_Node000002_Node000025" class="edge">
-<title>Node2&#45;&gt;Node25</title>
-<g id="a_edge40_Node000002_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M246.33,-753.63C264.29,-730.47 300.73,-687.04 340.25,-660.34 344.71,-657.32 349.53,-654.54 354.49,-651.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.91,-655.19 363.43,-647.73 352.9,-648.87 355.91,-655.19"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="459.75,-597.96 365,-597.96 365,-578.71 459.75,-578.71 459.75,-597.96"/>
-<text text-anchor="middle" x="412.38" y="-584.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node26 -->
-<g id="edge41_Node000002_Node000026" class="edge">
-<title>Node2&#45;&gt;Node26</title>
-<g id="a_edge41_Node000002_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M240.34,-753.67C253.01,-721.16 286.69,-646.15 340.25,-607.34 344.55,-604.22 349.33,-601.62 354.32,-599.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.2,-602.84 363.35,-596.07 352.76,-596.29 355.2,-602.84"/>
-</a>
-</g>
-</g>
-<!-- Node27 -->
-<g id="Node000027" class="node">
-<title>Node27</title>
-<g id="a_Node000027"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="800.75,-456.96 714.25,-456.96 714.25,-437.71 800.75,-437.71 800.75,-456.96"/>
-<text text-anchor="middle" x="757.5" y="-443.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node27 -->
-<g id="edge42_Node000002_Node000027" class="edge">
-<title>Node2&#45;&gt;Node27</title>
-<g id="a_edge42_Node000002_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M236.38,-753.65C242.15,-710.26 264.71,-588.15 340.25,-532.34 455.75,-447.01 528.23,-548.07 661,-493.34 679.74,-485.61 679,-474.65 697,-465.34 699.69,-463.95 702.51,-462.64 705.4,-461.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="706.5,-464.75 714.6,-457.92 704.01,-458.2 706.5,-464.75"/>
-</a>
-</g>
-</g>
-<!-- Node28 -->
-<g id="Node000028" class="node">
-<title>Node28</title>
-<g id="a_Node000028"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="470.62,-560.96 354.12,-560.96 354.12,-541.71 470.62,-541.71 470.62,-560.96"/>
-<text text-anchor="middle" x="412.38" y="-547.46" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node28 -->
-<g id="edge43_Node000002_Node000028" class="edge">
-<title>Node2&#45;&gt;Node28</title>
-<g id="a_edge43_Node000002_Node000028"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M238.2,-753.79C247.74,-715.98 277.44,-618.73 340.25,-569.34 341.4,-568.43 342.6,-567.57 343.83,-566.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.41,-569.87 352.5,-562 342.05,-563.73 345.41,-569.87"/>
-</a>
-</g>
-</g>
-<!-- Node29 -->
-<g id="Node000029" class="node">
-<title>Node29</title>
-<g id="a_Node000029"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="661,-828.96 520.5,-828.96 520.5,-809.71 661,-809.71 661,-828.96"/>
-<text text-anchor="middle" x="590.75" y="-815.46" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::transpose</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node29 -->
-<g id="edge44_Node000002_Node000029" class="edge">
-<title>Node2&#45;&gt;Node29</title>
-<g id="a_edge44_Node000002_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.62,-756.35C356.09,-749.85 426.82,-747.41 484.5,-769.34 504.51,-776.95 501.62,-791.25 520.5,-801.34 523.18,-802.77 525.98,-804.09 528.86,-805.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="527.49,-808.54 538.08,-808.77 529.95,-801.98 527.49,-808.54"/>
-</a>
-</g>
-</g>
-<!-- Node30 -->
-<g id="Node000030" class="node">
-<title>Node30</title>
-<g id="a_Node000030"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="475.88,-1168.59 348.88,-1168.59 348.88,-1138.09 475.88,-1138.09 475.88,-1168.59"/>
-<text text-anchor="start" x="356.88" y="-1155.09" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::zeroes</text>
-<text text-anchor="middle" x="412.38" y="-1143.84" font-family="Helvetica,sans-Serif" font-size="10.00">_initialization</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node30 -->
-<g id="edge47_Node000002_Node000030" class="edge">
-<title>Node2&#45;&gt;Node30</title>
-<g id="a_edge47_Node000002_Node000030"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.71,-784.72C235.85,-838.61 246.75,-1021.2 340.25,-1124.34 342.59,-1126.92 345.2,-1129.28 347.99,-1131.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.89,-1134.25 356.18,-1136.8 349.73,-1128.39 345.89,-1134.25"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M484.86,-1080.79C496.85,-1084.06 509.27,-1087.44 521.18,-1090.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="519.93,-1093.96 530.49,-1093.21 521.76,-1087.21 519.93,-1093.96"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="656.5,-1073.96 525,-1073.96 525,-1054.71 656.5,-1054.71 656.5,-1073.96"/>
-<text text-anchor="middle" x="590.75" y="-1060.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M484.86,-1062.55C494.23,-1062.71 503.86,-1062.88 513.3,-1063.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="513.13,-1066.54 523.19,-1063.21 513.25,-1059.54 513.13,-1066.54"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.72,-1040.09C422.36,-990.3 445.97,-865.42 520.5,-800.34 521.3,-799.64 522.12,-798.97 522.96,-798.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="524.72,-801.35 531.41,-793.14 521.06,-795.39 524.72,-801.35"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M656.81,-772.36C702.14,-766.93 763.93,-762.57 818,-769.34 834.42,-771.39 852.19,-775.56 867.33,-779.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="866.29,-783.07 876.87,-782.45 868.22,-776.34 866.29,-783.07"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M627.32,-772.22C687.48,-755.1 808.64,-720.62 868.86,-703.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="869.59,-706.91 878.25,-700.81 867.67,-700.18 869.59,-706.91"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge8_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge8_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M639.88,-792.37C647.12,-794.58 654.37,-797.22 661,-800.34 686.49,-812.34 712.19,-831.4 730.51,-846.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="728.05,-848.96 737.96,-852.71 732.55,-843.6 728.05,-848.96"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="815.38,-797.96 699.62,-797.96 699.62,-778.71 815.38,-778.71 815.38,-797.96"/>
-<text text-anchor="middle" x="757.5" y="-784.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge12_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge12_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M656.86,-784.71C667.06,-785.08 677.62,-785.47 687.89,-785.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="687.69,-789.34 697.81,-786.2 687.95,-782.34 687.69,-789.34"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge9_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge9_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M791.73,-853.59C800.34,-849.39 809.56,-844.78 818,-840.34 838.24,-829.69 860.7,-816.94 877.66,-807.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="879.25,-810.23 886.13,-802.18 875.73,-804.18 879.25,-810.23"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node8 -->
-<g id="edge10_Node000009_Node000008" class="edge">
-<title>Node9&#45;&gt;Node8</title>
-<g id="a_edge10_Node000009_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M799.47,-853.67C806.15,-849.96 812.63,-845.53 818,-840.34 842.58,-816.57 836.78,-801.88 854,-772.34 866.11,-751.57 881.05,-728.48 891.53,-712.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="894.22,-714.92 896.85,-704.66 888.4,-711.04 894.22,-714.92"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="945.75,-878.96 865.25,-878.96 865.25,-859.71 945.75,-859.71 945.75,-878.96"/>
-<text text-anchor="middle" x="905.5" y="-865.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge11_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge11_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M813.28,-869.34C826.55,-869.34 840.67,-869.34 853.75,-869.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="853.4,-872.84 863.4,-869.34 853.4,-865.84 853.4,-872.84"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node7 -->
-<g id="edge18_Node000012_Node000007" class="edge">
-<title>Node12&#45;&gt;Node7</title>
-<g id="a_edge18_Node000012_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M639.43,-998.38C647.38,-1001.77 654.99,-1006.29 661,-1012.34 696.07,-1047.63 656.56,-1089.36 697,-1118.34 740.72,-1149.66 777.52,-1153.74 818,-1118.34 863.23,-1078.78 829.46,-905.19 854,-850.34 861.04,-834.61 873.64,-819.88 884.49,-809.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="886.74,-811.76 891.58,-802.34 881.92,-806.68 886.74,-811.76"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node8 -->
-<g id="edge19_Node000012_Node000008" class="edge">
-<title>Node12&#45;&gt;Node8</title>
-<g id="a_edge19_Node000012_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M650.52,-978.26C701.69,-966.47 774.33,-942.01 818,-893.34 855.47,-851.57 830.66,-823.36 854,-772.34 864,-750.48 879.26,-727.56 890.39,-712.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="893.02,-714.4 896.12,-704.27 887.38,-710.26 893.02,-714.4"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node9 -->
-<g id="edge20_Node000012_Node000009" class="edge">
-<title>Node12&#45;&gt;Node9</title>
-<g id="a_edge20_Node000012_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M601.51,-978.47C619.33,-960.83 658.8,-923.39 697,-898.34 701.22,-895.57 705.75,-892.9 710.35,-890.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="711.87,-893.52 719.11,-885.79 708.63,-887.32 711.87,-893.52"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="786.88,-1108.96 728.12,-1108.96 728.12,-1089.71 786.88,-1089.71 786.88,-1108.96"/>
-<text text-anchor="middle" x="757.5" y="-1095.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge15_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge15_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M636.9,-998.44C645.55,-1001.84 654.06,-1006.35 661,-1012.34 687.19,-1034.93 670.36,-1059.27 697,-1081.34 702.79,-1086.14 709.85,-1089.66 717.04,-1092.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="715.89,-1095.55 726.48,-1095.05 717.89,-1088.84 715.89,-1095.55"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="793.62,-1071.96 721.38,-1071.96 721.38,-1052.71 793.62,-1052.71 793.62,-1071.96"/>
-<text text-anchor="middle" x="757.5" y="-1058.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node14 -->
-<g id="edge16_Node000012_Node000014" class="edge">
-<title>Node12&#45;&gt;Node14</title>
-<g id="a_edge16_Node000012_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M629.24,-998.34C639.88,-1001.97 651.23,-1006.61 661,-1012.34 679.47,-1023.16 678.32,-1033.88 697,-1044.34 701.19,-1046.68 705.71,-1048.75 710.33,-1050.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="709.15,-1053.87 719.74,-1053.89 711.47,-1047.27 709.15,-1053.87"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="783.12,-1034.96 731.88,-1034.96 731.88,-1015.71 783.12,-1015.71 783.12,-1034.96"/>
-<text text-anchor="middle" x="757.5" y="-1021.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node15 -->
-<g id="edge17_Node000012_Node000015" class="edge">
-<title>Node12&#45;&gt;Node15</title>
-<g id="a_edge17_Node000012_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M636.77,-998.45C663.09,-1004.36 695.86,-1011.72 720.46,-1017.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="719.48,-1020.61 730,-1019.39 721.01,-1013.78 719.48,-1020.61"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="804.5,-997.96 710.5,-997.96 710.5,-978.71 804.5,-978.71 804.5,-997.96"/>
-<text text-anchor="middle" x="757.5" y="-984.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node16 -->
-<g id="edge21_Node000012_Node000016" class="edge">
-<title>Node12&#45;&gt;Node16</title>
-<g id="a_edge21_Node000012_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M655.92,-988.34C670.04,-988.34 684.9,-988.34 698.75,-988.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="698.59,-991.84 708.59,-988.34 698.59,-984.84 698.59,-991.84"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node7 -->
-<g id="edge25_Node000018_Node000007" class="edge">
-<title>Node18&#45;&gt;Node7</title>
-<g id="a_edge25_Node000018_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M762.49,-175.01C772.89,-216.23 801.15,-331.26 818,-428.34 839.76,-553.7 810.68,-592.71 854,-712.34 862.09,-734.69 877.38,-757.24 889.03,-772.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="886.16,-774.52 895.1,-780.2 891.66,-770.18 886.16,-774.52"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node8 -->
-<g id="edge26_Node000018_Node000008" class="edge">
-<title>Node18&#45;&gt;Node8</title>
-<g id="a_edge26_Node000018_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M803.05,-174.98C808.76,-178.6 814,-183.01 818,-188.34 877.01,-267.03 898.62,-586.62 903.41,-672.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="899.9,-672.14 903.93,-681.93 906.89,-671.76 899.9,-672.14"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="957,-113.59 854,-113.59 854,-83.09 957,-83.09 957,-113.59"/>
-<text text-anchor="start" x="862" y="-100.09" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::system</text>
-<text text-anchor="middle" x="905.5" y="-88.84" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node19 -->
-<g id="edge27_Node000018_Node000019" class="edge">
-<title>Node18&#45;&gt;Node19</title>
-<g id="a_edge27_Node000018_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M796.1,-143.63C814.49,-135.95 836.84,-126.61 856.45,-118.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="857.75,-121.66 865.63,-114.58 855.06,-115.2 857.75,-121.66"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="932.62,-224.96 878.38,-224.96 878.38,-205.71 932.62,-205.71 932.62,-224.96"/>
-<text text-anchor="middle" x="905.5" y="-211.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node20 -->
-<g id="edge28_Node000018_Node000020" class="edge">
-<title>Node18&#45;&gt;Node20</title>
-<g id="a_edge28_Node000018_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M796.94,-175C814.31,-181.99 835.13,-190.23 854,-197.34 858.36,-198.98 862.95,-200.67 867.5,-202.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="865.94,-205.48 876.54,-205.57 868.31,-198.9 865.94,-205.48"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="935.25,-187.96 875.75,-187.96 875.75,-168.71 935.25,-168.71 935.25,-187.96"/>
-<text text-anchor="middle" x="905.5" y="-174.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node21 -->
-<g id="edge29_Node000018_Node000021" class="edge">
-<title>Node18&#45;&gt;Node21</title>
-<g id="a_edge29_Node000018_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M818.31,-167.12C833.69,-169.12 849.88,-171.23 864.02,-173.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="863.48,-176.53 873.85,-174.35 864.39,-169.59 863.48,-176.53"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="934.88,-150.96 876.12,-150.96 876.12,-131.71 934.88,-131.71 934.88,-150.96"/>
-<text text-anchor="middle" x="905.5" y="-137.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node22 -->
-<g id="edge30_Node000018_Node000022" class="edge">
-<title>Node18&#45;&gt;Node22</title>
-<g id="a_edge30_Node000018_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M818.31,-151.97C833.81,-150.05 850.13,-148.04 864.36,-146.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="864.75,-149.77 874.24,-145.07 863.89,-142.82 864.75,-149.77"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node7 -->
-<g id="edge34_Node000023_Node000007" class="edge">
-<title>Node23&#45;&gt;Node7</title>
-<g id="a_edge34_Node000023_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M625.31,-878.02C671.07,-896.99 754.6,-922.95 818,-893.34 840.58,-882.79 837.9,-869.36 854,-850.34 865.55,-836.7 878.68,-821.36 888.65,-809.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="891.04,-812.34 894.9,-802.48 885.73,-807.78 891.04,-812.34"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node8 -->
-<g id="edge35_Node000023_Node000008" class="edge">
-<title>Node23&#45;&gt;Node8</title>
-<g id="a_edge35_Node000023_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M661.27,-850.72C717.85,-840.3 792.39,-824.12 818,-807.34 836.97,-794.91 872.88,-742.22 891.92,-713.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="894.8,-715.02 897.28,-704.72 888.92,-711.22 894.8,-715.02"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node9 -->
-<g id="edge36_Node000023_Node000009" class="edge">
-<title>Node23&#45;&gt;Node9</title>
-<g id="a_edge36_Node000023_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M661.14,-865.29C670.71,-865.69 680.51,-866.11 690.02,-866.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="689.79,-870.01 699.93,-866.94 690.09,-863.01 689.79,-870.01"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node11 -->
-<g id="edge37_Node000023_Node000011" class="edge">
-<title>Node23&#45;&gt;Node11</title>
-<g id="a_edge37_Node000023_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M642.41,-846.72C648.79,-844.19 655.13,-841.39 661,-838.34 678.51,-829.23 679.72,-821.88 697,-812.34 703.27,-808.88 710.15,-805.64 716.93,-802.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="718.07,-806.05 726,-799.02 715.42,-799.57 718.07,-806.05"/>
-</a>
-</g>
-</g>
-<!-- Node29&#45;&gt;Node9 -->
-<g id="edge45_Node000029_Node000009" class="edge">
-<title>Node29&#45;&gt;Node9</title>
-<g id="a_edge45_Node000029_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M629.58,-829.38C639.8,-832.18 650.85,-835.3 661,-838.34 673.27,-842.01 686.36,-846.13 698.8,-850.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="697.49,-853.39 708.08,-853.14 699.65,-846.73 697.49,-853.39"/>
-</a>
-</g>
-</g>
-<!-- Node29&#45;&gt;Node11 -->
-<g id="edge46_Node000029_Node000011" class="edge">
-<title>Node29&#45;&gt;Node11</title>
-<g id="a_edge46_Node000029_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M645.24,-809.27C660.06,-806.49 676.31,-803.43 691.69,-800.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="692.05,-804.03 701.23,-798.74 690.75,-797.15 692.05,-804.03"/>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node7 -->
-<g id="edge52_Node000031_Node000007" class="edge">
-<title>Node31&#45;&gt;Node7</title>
-<g id="a_edge52_Node000031_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M420.03,-365.36C437.06,-417.78 483.5,-552.07 520.5,-579.34 627.81,-658.41 713.34,-534.79 818,-617.34 853.45,-645.3 833.73,-671.99 854,-712.34 864.79,-733.82 879.93,-756.8 890.82,-772.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="887.75,-774.14 896.39,-780.27 893.47,-770.09 887.75,-774.14"/>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node8 -->
-<g id="edge54_Node000031_Node000008" class="edge">
-<title>Node31&#45;&gt;Node8</title>
-<g id="a_edge54_Node000031_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M424.1,-323.35C440.37,-294.11 474.37,-242.34 520.5,-221.34 577.33,-195.47 605.07,-193.56 661,-221.34 841.71,-311.08 891.4,-592.26 902.02,-672.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="898.54,-672.44 903.26,-681.92 905.49,-671.56 898.54,-672.44"/>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node11 -->
-<g id="edge68_Node000031_Node000011" class="edge">
-<title>Node31&#45;&gt;Node11</title>
-<g id="a_edge68_Node000031_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M421.4,-365.3C444.9,-426.59 512.45,-601.86 520.5,-612.34 578.38,-687.67 676.61,-746.39 726.1,-772.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="724.35,-775.94 734.83,-777.51 727.62,-769.75 724.35,-775.94"/>
-</a>
-</g>
-</g>
-<!-- Node32 -->
-<g id="Node000032" class="node">
-<title>Node32</title>
-<g id="a_Node000032"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="635.5,-483.96 546,-483.96 546,-464.71 635.5,-464.71 635.5,-483.96"/>
-<text text-anchor="middle" x="590.75" y="-470.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node32 -->
-<g id="edge49_Node000031_Node000032" class="edge">
-<title>Node31&#45;&gt;Node32</title>
-<g id="a_edge49_Node000031_Node000032"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M427.84,-365.48C446.36,-390.89 480.82,-433.04 520.5,-456.34 525.08,-459.03 530.06,-461.32 535.18,-463.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.78,-466.5 544.37,-466.35 536,-459.86 533.78,-466.5"/>
-</a>
-</g>
-</g>
-<!-- Node33 -->
-<g id="Node000033" class="node">
-<title>Node33</title>
-<g id="a_Node000033"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="634.38,-446.96 547.12,-446.96 547.12,-427.71 634.38,-427.71 634.38,-446.96"/>
-<text text-anchor="middle" x="590.75" y="-433.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::c_str</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node33 -->
-<g id="edge50_Node000031_Node000033" class="edge">
-<title>Node31&#45;&gt;Node33</title>
-<g id="a_edge50_Node000031_Node000033"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M438.2,-365.6C458.96,-382.39 489.99,-405.25 520.5,-419.34 525.39,-421.6 530.61,-423.6 535.9,-425.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="534.77,-428.7 545.36,-428.28 536.82,-422 534.77,-428.7"/>
-</a>
-</g>
-</g>
-<!-- Node34 -->
-<g id="Node000034" class="node">
-<title>Node34</title>
-<g id="a_Node000034"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="640.75,-409.96 540.75,-409.96 540.75,-390.71 640.75,-390.71 640.75,-409.96"/>
-<text text-anchor="middle" x="590.75" y="-396.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node34 -->
-<g id="edge51_Node000031_Node000034" class="edge">
-<title>Node31&#45;&gt;Node34</title>
-<g id="a_edge51_Node000031_Node000034"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.61,-365.67C486.66,-371.37 504.18,-377.33 520.5,-382.34 526,-384.03 531.78,-385.69 537.55,-387.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="536.55,-390.64 547.11,-389.87 538.37,-383.88 536.55,-390.64"/>
-</a>
-</g>
-</g>
-<!-- Node35 -->
-<g id="Node000035" class="node">
-<title>Node35</title>
-<g id="a_Node000035"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ios/eof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="635.88,-372.96 545.62,-372.96 545.62,-353.71 635.88,-353.71 635.88,-372.96"/>
-<text text-anchor="middle" x="590.75" y="-359.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::eof</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node35 -->
-<g id="edge53_Node000031_Node000035" class="edge">
-<title>Node31&#45;&gt;Node35</title>
-<g id="a_edge53_Node000031_Node000035"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M476.05,-351.09C494.91,-353.12 515.46,-355.34 533.84,-357.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.45,-360.79 543.77,-358.38 534.2,-353.83 533.45,-360.79"/>
-</a>
-</g>
-</g>
-<!-- Node36 -->
-<g id="Node000036" class="node">
-<title>Node36</title>
-<g id="a_Node000036"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="622.75,-335.96 558.75,-335.96 558.75,-316.71 622.75,-316.71 622.75,-335.96"/>
-<text text-anchor="middle" x="590.75" y="-322.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node36 -->
-<g id="edge55_Node000031_Node000036" class="edge">
-<title>Node31&#45;&gt;Node36</title>
-<g id="a_edge55_Node000031_Node000036"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M476.05,-337.94C499.61,-335.54 525.83,-332.86 547.15,-330.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="547.34,-334.19 556.93,-329.69 546.63,-327.22 547.34,-334.19"/>
-</a>
-</g>
-</g>
-<!-- Node37 -->
-<g id="Node000037" class="node">
-<title>Node37</title>
-<g id="a_Node000037"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="651.62,-298.59 529.88,-298.59 529.88,-268.09 651.62,-268.09 651.62,-298.59"/>
-<text text-anchor="start" x="537.88" y="-285.09" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::insert</text>
-<text text-anchor="middle" x="590.75" y="-273.84" font-family="Helvetica,sans-Serif" font-size="10.00">_element</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node37 -->
-<g id="edge56_Node000031_Node000037" class="edge">
-<title>Node31&#45;&gt;Node37</title>
-<g id="a_edge56_Node000031_Node000037"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M475.06,-323C494.08,-316.43 514.91,-309.22 533.54,-302.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="534.48,-306.16 542.79,-299.58 532.19,-299.54 534.48,-306.16"/>
-</a>
-</g>
-</g>
-<!-- Node38 -->
-<g id="Node000038" class="node">
-<title>Node38</title>
-<g id="a_Node000038"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="646,-249.96 535.5,-249.96 535.5,-230.71 646,-230.71 646,-249.96"/>
-<text text-anchor="middle" x="590.75" y="-236.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node38 -->
-<g id="edge57_Node000031_Node000038" class="edge">
-<title>Node31&#45;&gt;Node38</title>
-<g id="a_edge57_Node000031_Node000038"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M434.52,-323.23C454.91,-303.99 487.47,-276.09 520.5,-259.34 524.22,-257.45 528.15,-255.73 532.18,-254.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.25,-257.5 541.53,-250.9 530.94,-250.9 533.25,-257.5"/>
-</a>
-</g>
-</g>
-<!-- Node39 -->
-<g id="Node000039" class="node">
-<title>Node39</title>
-<g id="a_Node000039"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="656.88,-570.59 524.62,-570.59 524.62,-540.09 656.88,-540.09 656.88,-570.59"/>
-<text text-anchor="start" x="532.62" y="-557.09" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::minmax</text>
-<text text-anchor="middle" x="590.75" y="-545.84" font-family="Helvetica,sans-Serif" font-size="10.00">_scaler</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node39 -->
-<g id="edge58_Node000031_Node000039" class="edge">
-<title>Node31&#45;&gt;Node39</title>
-<g id="a_edge58_Node000031_Node000039"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M426.59,-365.66C445.61,-395.6 482.6,-451.15 520.5,-493.34 533.03,-507.29 548.45,-521.34 561.56,-532.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="559.13,-535.07 569.04,-538.82 563.63,-529.71 559.13,-535.07"/>
-</a>
-</g>
-</g>
-<!-- Node41 -->
-<g id="Node000041" class="node">
-<title>Node41</title>
-<g id="a_Node000041"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="639.62,-173.96 541.88,-173.96 541.88,-154.71 639.62,-154.71 639.62,-173.96"/>
-<text text-anchor="middle" x="590.75" y="-160.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node41 -->
-<g id="edge65_Node000031_Node000041" class="edge">
-<title>Node31&#45;&gt;Node41</title>
-<g id="a_edge65_Node000031_Node000041"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M422.5,-323.23C437.93,-289.89 472.29,-225.09 520.5,-188.34 525.37,-184.63 530.86,-181.46 536.55,-178.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="537.68,-182.09 545.56,-175 534.98,-175.63 537.68,-182.09"/>
-</a>
-</g>
-</g>
-<!-- Node42 -->
-<g id="Node000042" class="node">
-<title>Node42</title>
-<g id="a_Node000042"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="660.62,-136.96 520.88,-136.96 520.88,-117.71 660.62,-117.71 660.62,-136.96"/>
-<text text-anchor="middle" x="590.75" y="-123.46" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node42 -->
-<g id="edge66_Node000031_Node000042" class="edge">
-<title>Node31&#45;&gt;Node42</title>
-<g id="a_edge66_Node000031_Node000042"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M418.65,-323.25C429.98,-282.39 460.63,-192.35 520.5,-145.34 521.63,-144.45 522.79,-143.61 523.99,-142.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="525.34,-146.07 532.41,-138.18 521.96,-139.93 525.34,-146.07"/>
-</a>
-</g>
-</g>
-<!-- Node43 -->
-<g id="Node000043" class="node">
-<title>Node43</title>
-<g id="a_Node000043"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="647.5,-99.59 534,-99.59 534,-69.09 647.5,-69.09 647.5,-99.59"/>
-<text text-anchor="start" x="542" y="-86.09" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop</text>
-<text text-anchor="middle" x="590.75" y="-74.84" font-family="Helvetica,sans-Serif" font-size="10.00">_front</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node43 -->
-<g id="edge67_Node000031_Node000043" class="edge">
-<title>Node31&#45;&gt;Node43</title>
-<g id="a_edge67_Node000031_Node000043"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M417.17,-323.08C426.44,-277.26 454.49,-168.51 520.5,-108.34 521.73,-107.21 523.02,-106.14 524.36,-105.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="525.97,-108.24 532.49,-99.88 522.18,-102.36 525.97,-108.24"/>
-</a>
-</g>
-</g>
-<!-- Node44 -->
-<g id="Node000044" class="node">
-<title>Node44</title>
-<g id="a_Node000044"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="617.88,-50.96 563.62,-50.96 563.62,-31.71 617.88,-31.71 617.88,-50.96"/>
-<text text-anchor="middle" x="590.75" y="-37.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::stod</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node44 -->
-<g id="edge69_Node000031_Node000044" class="edge">
-<title>Node31&#45;&gt;Node44</title>
-<g id="a_edge69_Node000031_Node000044"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M414.97,-323.29C420.09,-270.77 440.84,-132.92 520.5,-60.34 529.21,-52.4 540.92,-47.74 552.24,-45.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="552.65,-48.49 561.81,-43.16 551.33,-41.62 552.65,-48.49"/>
-</a>
-</g>
-</g>
-<!-- Node39&#45;&gt;Node7 -->
-<g id="edge59_Node000039_Node000007" class="edge">
-<title>Node39&#45;&gt;Node7</title>
-<g id="a_edge59_Node000039_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M657.36,-555.91C715.46,-557.78 794.58,-564.12 818,-584.34 862.74,-622.95 829.82,-658.41 854,-712.34 863.83,-734.27 879.12,-757.18 890.3,-772.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="887.3,-774.48 896.06,-780.44 892.93,-770.31 887.3,-774.48"/>
-</a>
-</g>
-</g>
-<!-- Node39&#45;&gt;Node8 -->
-<g id="edge60_Node000039_Node000008" class="edge">
-<title>Node39&#45;&gt;Node8</title>
-<g id="a_edge60_Node000039_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M638.95,-539.68C687.27,-526.65 762.89,-514.82 818,-546.34 865.85,-573.7 889.85,-638.99 899.38,-672.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="895.91,-673.17 901.87,-681.94 902.68,-671.37 895.91,-673.17"/>
-</a>
-</g>
-</g>
-<!-- Node39&#45;&gt;Node9 -->
-<g id="edge61_Node000039_Node000009" class="edge">
-<title>Node39&#45;&gt;Node9</title>
-<g id="a_edge61_Node000039_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M596.1,-571.07C607.93,-612.26 643.46,-725.65 697,-807.34 706.19,-821.36 718.77,-835.01 730,-845.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="727.47,-848.35 737.15,-852.66 732.27,-843.25 727.47,-848.35"/>
-</a>
-</g>
-</g>
-<!-- Node39&#45;&gt;Node24 -->
-<g id="edge63_Node000039_Node000024" class="edge">
-<title>Node39&#45;&gt;Node24</title>
-<g id="a_edge63_Node000039_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M623.52,-570.96C653.16,-585.53 697.09,-607.13 726.24,-621.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="724.38,-624.45 734.9,-625.72 727.47,-618.17 724.38,-624.45"/>
-</a>
-</g>
-</g>
-<!-- Node39&#45;&gt;Node27 -->
-<g id="edge64_Node000039_Node000027" class="edge">
-<title>Node39&#45;&gt;Node27</title>
-<g id="a_edge64_Node000039_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M640.65,-539.59C647.94,-535.95 655.01,-531.56 661,-526.34 684.73,-505.65 672.24,-484.78 697,-465.34 699.11,-463.68 701.38,-462.17 703.74,-460.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="705.05,-464.06 712.56,-456.58 702.03,-457.75 705.05,-464.06"/>
-</a>
-</g>
-</g>
-<!-- Node40 -->
-<g id="Node000040" class="node">
-<title>Node40</title>
-<g id="a_Node000040"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="784.62,-493.96 730.38,-493.96 730.38,-474.71 784.62,-474.71 784.62,-493.96"/>
-<text text-anchor="middle" x="757.5" y="-480.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node39&#45;&gt;Node40 -->
-<g id="edge62_Node000039_Node000040" class="edge">
-<title>Node39&#45;&gt;Node40</title>
-<g id="a_edge62_Node000039_Node000040"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M630.41,-539.69C640.43,-535.48 651.17,-530.85 661,-526.34 677.26,-518.88 680.69,-515.69 697,-508.34 704.32,-505.04 712.23,-501.7 719.82,-498.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="720.87,-501.95 728.84,-494.97 718.25,-495.45 720.87,-501.95"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph_org.svg
deleted file mode 100644
index 81552627f..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a5172a6791b9bd24f4232bab8d6b81fff_cgraph_org.svg
+++ /dev/null
@@ -1,1046 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::fit_from_csv Pages: 1 -->
-<svg width="965pt" height="1178pt"
- viewBox="0.00 0.00 965.00 1178.45" 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 1174.45)">
-<title>machine_learning::neural_network::NeuralNetwork::fit_from_csv</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-578.21 0,-578.21 0,-536.46 127,-536.46 127,-578.21"/>
-<text text-anchor="start" x="8" y="-564.71" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-553.46" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-542.21" font-family="Helvetica,sans-Serif" font-size="10.00">::fit_from_csv</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.25,-784.59 163,-784.59 163,-754.09 304.25,-754.09 304.25,-784.59"/>
-<text text-anchor="start" x="171" y="-771.09" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="middle" x="233.62" y="-759.84" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork::fit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.24,-578.44C112.52,-617.89 179.71,-702.61 213.04,-744.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="210.28,-746.8 219.24,-752.46 215.77,-742.45 210.28,-746.8"/>
-</a>
-</g>
-</g>
-<!-- Node31 -->
-<g id="Node000031" class="node">
-<title>Node31</title>
-<g id="a_Node000031"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="475.88,-365.21 348.88,-365.21 348.88,-323.46 475.88,-323.46 475.88,-365.21"/>
-<text text-anchor="start" x="356.88" y="-351.71" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="356.88" y="-340.46" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="412.38" y="-329.21" font-family="Helvetica,sans-Serif" font-size="10.00">::get_XY_from_csv</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node31 -->
-<g id="edge48_Node000001_Node000031" class="edge">
-<title>Node1&#45;&gt;Node31</title>
-<g id="a_edge48_Node000001_Node000031"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.03,-536.14C162.45,-497.19 297.38,-414.34 367.31,-371.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="368.75,-374.62 375.44,-366.4 365.09,-368.65 368.75,-374.62"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="484.5,-1082.21 340.25,-1082.21 340.25,-1040.46 484.5,-1040.46 484.5,-1082.21"/>
-<text text-anchor="start" x="348.25" y="-1068.71" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="348.25" y="-1057.46" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="412.38" y="-1046.21" font-family="Helvetica,sans-Serif" font-size="10.00">::__detailed_single_prediction</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.09,-785.01C244.7,-828.6 271.56,-952.86 340.25,-1026.34 342.62,-1028.87 345.21,-1031.24 347.95,-1033.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.77,-1036.2 355.94,-1039.16 349.83,-1030.51 345.77,-1036.2"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="651.25,-1124.59 530.25,-1124.59 530.25,-1094.09 651.25,-1094.09 651.25,-1124.59"/>
-<text text-anchor="start" x="538.25" y="-1111.09" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::apply</text>
-<text text-anchor="middle" x="590.75" y="-1099.84" font-family="Helvetica,sans-Serif" font-size="10.00">_function</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge13_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge13_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.22,-784.74C233.75,-837.66 240.09,-1013.13 340.25,-1091.34 390.18,-1130.33 464.22,-1130.73 518.68,-1123.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="519.06,-1127.34 528.49,-1122.5 518.1,-1120.4 519.06,-1127.34"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="656.5,-791.96 525,-791.96 525,-772.71 656.5,-772.71 656.5,-791.96"/>
-<text text-anchor="middle" x="590.75" y="-778.46" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge39_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge39_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M268.53,-784.93C288.86,-793.4 315.48,-803.02 340.25,-807.34 403.41,-818.35 420.82,-814.8 484.5,-807.34 495.51,-806.05 518.75,-800.63 540.6,-795.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="541.18,-798.63 550.02,-792.79 539.46,-791.85 541.18,-798.63"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="932.25,-800.96 878.75,-800.96 878.75,-781.71 932.25,-781.71 932.25,-800.96"/>
-<text text-anchor="middle" x="905.5" y="-787.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge23_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge23_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M238.65,-785.06C248.91,-821.87 279.63,-914.1 340.25,-961.34 354.78,-972.66 647.41,-1032.91 661,-1045.34 695.86,-1077.21 658.35,-1118.18 697,-1145.34 741,-1176.26 777.74,-1180.99 818,-1145.34 867.45,-1101.56 827.39,-910.78 854,-850.34 860.94,-834.56 873.54,-819.83 884.42,-809.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="886.67,-811.73 891.53,-802.31 881.86,-806.64 886.67,-811.73"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="931.12,-702.96 879.88,-702.96 879.88,-683.71 931.12,-683.71 931.12,-702.96"/>
-<text text-anchor="middle" x="905.5" y="-689.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge31_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge31_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.6,-753.64C316.46,-751.3 328.68,-749.09 340.25,-747.34 538.39,-717.32 778.34,-700.89 868.21,-695.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="868.35,-698.92 878.12,-694.83 867.93,-691.93 868.35,-698.92"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="813.12,-884.59 701.88,-884.59 701.88,-854.09 813.12,-854.09 813.12,-884.59"/>
-<text text-anchor="start" x="709.88" y="-871.09" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="757.5" y="-859.84" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge32_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge32_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.1,-784.82C268.08,-804.11 303.35,-836.57 340.25,-853.34 470.72,-912.62 518.25,-898.95 661,-886.34 670.46,-885.5 680.4,-884.21 690.13,-882.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="690.63,-886.17 699.93,-881.09 689.5,-879.26 690.63,-886.17"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="655.75,-997.96 525.75,-997.96 525.75,-978.71 655.75,-978.71 655.75,-997.96"/>
-<text text-anchor="middle" x="590.75" y="-984.46" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::argmax</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge14_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge14_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M241.11,-784.74C254.76,-815.26 289.47,-883.58 340.25,-919.34 391.69,-955.56 461.47,-972.8 514.16,-980.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="513.56,-984.44 523.97,-982.43 514.58,-977.51 513.56,-984.44"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="477,-797.96 347.75,-797.96 347.75,-778.71 477,-778.71 477,-797.96"/>
-<text text-anchor="middle" x="412.38" y="-784.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::duration_cast</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node17 -->
-<g id="edge22_Node000002_Node000017" class="edge">
-<title>Node2&#45;&gt;Node17</title>
-<g id="a_edge22_Node000002_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.74,-776.88C315.07,-777.99 325.75,-779.13 336.18,-780.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="335.55,-783.71 345.87,-781.3 336.3,-776.75 335.55,-783.71"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="818,-174.59 697,-174.59 697,-144.09 818,-144.09 818,-174.59"/>
-<text text-anchor="start" x="705" y="-161.09" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::equal</text>
-<text text-anchor="middle" x="757.5" y="-149.84" font-family="Helvetica,sans-Serif" font-size="10.00">_shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node18 -->
-<g id="edge24_Node000002_Node000018" class="edge">
-<title>Node2&#45;&gt;Node18</title>
-<g id="a_edge24_Node000002_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.26,-753.83C233.02,-661.09 240.38,-178.62 520.5,-22.34 575.03,8.08 605.64,6.55 661,-22.34 705.61,-45.62 733.62,-100.29 747.04,-133.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="743.73,-134.25 750.63,-142.29 750.25,-131.71 743.73,-134.25"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="661,-877.59 520.5,-877.59 520.5,-847.09 661,-847.09 661,-877.59"/>
-<text text-anchor="start" x="528.5" y="-864.09" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::hadamard</text>
-<text text-anchor="middle" x="590.75" y="-852.84" font-family="Helvetica,sans-Serif" font-size="10.00">_product</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node23 -->
-<g id="edge33_Node000002_Node000023" class="edge">
-<title>Node2&#45;&gt;Node23</title>
-<g id="a_edge33_Node000002_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.79,-784.87C279.57,-797.48 310.77,-814.71 340.25,-824.34 394.93,-842.19 459.14,-851.73 508.72,-856.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="508.23,-860.25 518.53,-857.74 508.91,-853.28 508.23,-860.25"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="783.12,-645.96 731.88,-645.96 731.88,-626.71 783.12,-626.71 783.12,-645.96"/>
-<text text-anchor="middle" x="757.5" y="-632.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node24 -->
-<g id="edge38_Node000002_Node000024" class="edge">
-<title>Node2&#45;&gt;Node24</title>
-<g id="a_edge38_Node000002_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M252.29,-753.8C272.2,-737.2 306.26,-711.52 340.25,-698.34 473.51,-646.68 646.15,-637.77 720.18,-636.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="720.14,-639.94 730.1,-636.3 720.05,-632.94 720.14,-639.94"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="480.38,-646.59 344.38,-646.59 344.38,-616.09 480.38,-616.09 480.38,-646.59"/>
-<text text-anchor="start" x="352.38" y="-633.09" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::high_resolution</text>
-<text text-anchor="middle" x="412.38" y="-621.84" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node25 -->
-<g id="edge40_Node000002_Node000025" class="edge">
-<title>Node2&#45;&gt;Node25</title>
-<g id="a_edge40_Node000002_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M246.33,-753.63C264.29,-730.47 300.73,-687.04 340.25,-660.34 344.71,-657.32 349.53,-654.54 354.49,-651.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.91,-655.19 363.43,-647.73 352.9,-648.87 355.91,-655.19"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="459.75,-597.96 365,-597.96 365,-578.71 459.75,-578.71 459.75,-597.96"/>
-<text text-anchor="middle" x="412.38" y="-584.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node26 -->
-<g id="edge41_Node000002_Node000026" class="edge">
-<title>Node2&#45;&gt;Node26</title>
-<g id="a_edge41_Node000002_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M240.34,-753.67C253.01,-721.16 286.69,-646.15 340.25,-607.34 344.55,-604.22 349.33,-601.62 354.32,-599.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.2,-602.84 363.35,-596.07 352.76,-596.29 355.2,-602.84"/>
-</a>
-</g>
-</g>
-<!-- Node27 -->
-<g id="Node000027" class="node">
-<title>Node27</title>
-<g id="a_Node000027"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="800.75,-456.96 714.25,-456.96 714.25,-437.71 800.75,-437.71 800.75,-456.96"/>
-<text text-anchor="middle" x="757.5" y="-443.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node27 -->
-<g id="edge42_Node000002_Node000027" class="edge">
-<title>Node2&#45;&gt;Node27</title>
-<g id="a_edge42_Node000002_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M236.38,-753.65C242.15,-710.26 264.71,-588.15 340.25,-532.34 455.75,-447.01 528.23,-548.07 661,-493.34 679.74,-485.61 679,-474.65 697,-465.34 699.69,-463.95 702.51,-462.64 705.4,-461.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="706.5,-464.75 714.6,-457.92 704.01,-458.2 706.5,-464.75"/>
-</a>
-</g>
-</g>
-<!-- Node28 -->
-<g id="Node000028" class="node">
-<title>Node28</title>
-<g id="a_Node000028"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="470.62,-560.96 354.12,-560.96 354.12,-541.71 470.62,-541.71 470.62,-560.96"/>
-<text text-anchor="middle" x="412.38" y="-547.46" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node28 -->
-<g id="edge43_Node000002_Node000028" class="edge">
-<title>Node2&#45;&gt;Node28</title>
-<g id="a_edge43_Node000002_Node000028"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M238.2,-753.79C247.74,-715.98 277.44,-618.73 340.25,-569.34 341.4,-568.43 342.6,-567.57 343.83,-566.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.41,-569.87 352.5,-562 342.05,-563.73 345.41,-569.87"/>
-</a>
-</g>
-</g>
-<!-- Node29 -->
-<g id="Node000029" class="node">
-<title>Node29</title>
-<g id="a_Node000029"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="661,-828.96 520.5,-828.96 520.5,-809.71 661,-809.71 661,-828.96"/>
-<text text-anchor="middle" x="590.75" y="-815.46" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::transpose</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node29 -->
-<g id="edge44_Node000002_Node000029" class="edge">
-<title>Node2&#45;&gt;Node29</title>
-<g id="a_edge44_Node000002_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.62,-756.35C356.09,-749.85 426.82,-747.41 484.5,-769.34 504.51,-776.95 501.62,-791.25 520.5,-801.34 523.18,-802.77 525.98,-804.09 528.86,-805.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="527.49,-808.54 538.08,-808.77 529.95,-801.98 527.49,-808.54"/>
-</a>
-</g>
-</g>
-<!-- Node30 -->
-<g id="Node000030" class="node">
-<title>Node30</title>
-<g id="a_Node000030"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="475.88,-1168.59 348.88,-1168.59 348.88,-1138.09 475.88,-1138.09 475.88,-1168.59"/>
-<text text-anchor="start" x="356.88" y="-1155.09" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::zeroes</text>
-<text text-anchor="middle" x="412.38" y="-1143.84" font-family="Helvetica,sans-Serif" font-size="10.00">_initialization</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node30 -->
-<g id="edge47_Node000002_Node000030" class="edge">
-<title>Node2&#45;&gt;Node30</title>
-<g id="a_edge47_Node000002_Node000030"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.71,-784.72C235.85,-838.61 246.75,-1021.2 340.25,-1124.34 342.59,-1126.92 345.2,-1129.28 347.99,-1131.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.89,-1134.25 356.18,-1136.8 349.73,-1128.39 345.89,-1134.25"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M484.86,-1080.79C496.85,-1084.06 509.27,-1087.44 521.18,-1090.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="519.93,-1093.96 530.49,-1093.21 521.76,-1087.21 519.93,-1093.96"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="656.5,-1073.96 525,-1073.96 525,-1054.71 656.5,-1054.71 656.5,-1073.96"/>
-<text text-anchor="middle" x="590.75" y="-1060.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M484.86,-1062.55C494.23,-1062.71 503.86,-1062.88 513.3,-1063.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="513.13,-1066.54 523.19,-1063.21 513.25,-1059.54 513.13,-1066.54"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.72,-1040.09C422.36,-990.3 445.97,-865.42 520.5,-800.34 521.3,-799.64 522.12,-798.97 522.96,-798.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="524.72,-801.35 531.41,-793.14 521.06,-795.39 524.72,-801.35"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M656.81,-772.36C702.14,-766.93 763.93,-762.57 818,-769.34 834.42,-771.39 852.19,-775.56 867.33,-779.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="866.29,-783.07 876.87,-782.45 868.22,-776.34 866.29,-783.07"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M627.32,-772.22C687.48,-755.1 808.64,-720.62 868.86,-703.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="869.59,-706.91 878.25,-700.81 867.67,-700.18 869.59,-706.91"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge8_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge8_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M639.88,-792.37C647.12,-794.58 654.37,-797.22 661,-800.34 686.49,-812.34 712.19,-831.4 730.51,-846.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="728.05,-848.96 737.96,-852.71 732.55,-843.6 728.05,-848.96"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="815.38,-797.96 699.62,-797.96 699.62,-778.71 815.38,-778.71 815.38,-797.96"/>
-<text text-anchor="middle" x="757.5" y="-784.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge12_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge12_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M656.86,-784.71C667.06,-785.08 677.62,-785.47 687.89,-785.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="687.69,-789.34 697.81,-786.2 687.95,-782.34 687.69,-789.34"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge9_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge9_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M791.73,-853.59C800.34,-849.39 809.56,-844.78 818,-840.34 838.24,-829.69 860.7,-816.94 877.66,-807.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="879.25,-810.23 886.13,-802.18 875.73,-804.18 879.25,-810.23"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node8 -->
-<g id="edge10_Node000009_Node000008" class="edge">
-<title>Node9&#45;&gt;Node8</title>
-<g id="a_edge10_Node000009_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M799.47,-853.67C806.15,-849.96 812.63,-845.53 818,-840.34 842.58,-816.57 836.78,-801.88 854,-772.34 866.11,-751.57 881.05,-728.48 891.53,-712.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="894.22,-714.92 896.85,-704.66 888.4,-711.04 894.22,-714.92"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="945.75,-878.96 865.25,-878.96 865.25,-859.71 945.75,-859.71 945.75,-878.96"/>
-<text text-anchor="middle" x="905.5" y="-865.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge11_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge11_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M813.28,-869.34C826.55,-869.34 840.67,-869.34 853.75,-869.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="853.4,-872.84 863.4,-869.34 853.4,-865.84 853.4,-872.84"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node7 -->
-<g id="edge18_Node000012_Node000007" class="edge">
-<title>Node12&#45;&gt;Node7</title>
-<g id="a_edge18_Node000012_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M639.43,-998.38C647.38,-1001.77 654.99,-1006.29 661,-1012.34 696.07,-1047.63 656.56,-1089.36 697,-1118.34 740.72,-1149.66 777.52,-1153.74 818,-1118.34 863.23,-1078.78 829.46,-905.19 854,-850.34 861.04,-834.61 873.64,-819.88 884.49,-809.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="886.74,-811.76 891.58,-802.34 881.92,-806.68 886.74,-811.76"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node8 -->
-<g id="edge19_Node000012_Node000008" class="edge">
-<title>Node12&#45;&gt;Node8</title>
-<g id="a_edge19_Node000012_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M650.52,-978.26C701.69,-966.47 774.33,-942.01 818,-893.34 855.47,-851.57 830.66,-823.36 854,-772.34 864,-750.48 879.26,-727.56 890.39,-712.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="893.02,-714.4 896.12,-704.27 887.38,-710.26 893.02,-714.4"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node9 -->
-<g id="edge20_Node000012_Node000009" class="edge">
-<title>Node12&#45;&gt;Node9</title>
-<g id="a_edge20_Node000012_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M601.51,-978.47C619.33,-960.83 658.8,-923.39 697,-898.34 701.22,-895.57 705.75,-892.9 710.35,-890.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="711.87,-893.52 719.11,-885.79 708.63,-887.32 711.87,-893.52"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="786.88,-1108.96 728.12,-1108.96 728.12,-1089.71 786.88,-1089.71 786.88,-1108.96"/>
-<text text-anchor="middle" x="757.5" y="-1095.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge15_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge15_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M636.9,-998.44C645.55,-1001.84 654.06,-1006.35 661,-1012.34 687.19,-1034.93 670.36,-1059.27 697,-1081.34 702.79,-1086.14 709.85,-1089.66 717.04,-1092.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="715.89,-1095.55 726.48,-1095.05 717.89,-1088.84 715.89,-1095.55"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="793.62,-1071.96 721.38,-1071.96 721.38,-1052.71 793.62,-1052.71 793.62,-1071.96"/>
-<text text-anchor="middle" x="757.5" y="-1058.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node14 -->
-<g id="edge16_Node000012_Node000014" class="edge">
-<title>Node12&#45;&gt;Node14</title>
-<g id="a_edge16_Node000012_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M629.24,-998.34C639.88,-1001.97 651.23,-1006.61 661,-1012.34 679.47,-1023.16 678.32,-1033.88 697,-1044.34 701.19,-1046.68 705.71,-1048.75 710.33,-1050.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="709.15,-1053.87 719.74,-1053.89 711.47,-1047.27 709.15,-1053.87"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="783.12,-1034.96 731.88,-1034.96 731.88,-1015.71 783.12,-1015.71 783.12,-1034.96"/>
-<text text-anchor="middle" x="757.5" y="-1021.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node15 -->
-<g id="edge17_Node000012_Node000015" class="edge">
-<title>Node12&#45;&gt;Node15</title>
-<g id="a_edge17_Node000012_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M636.77,-998.45C663.09,-1004.36 695.86,-1011.72 720.46,-1017.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="719.48,-1020.61 730,-1019.39 721.01,-1013.78 719.48,-1020.61"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="804.5,-997.96 710.5,-997.96 710.5,-978.71 804.5,-978.71 804.5,-997.96"/>
-<text text-anchor="middle" x="757.5" y="-984.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node16 -->
-<g id="edge21_Node000012_Node000016" class="edge">
-<title>Node12&#45;&gt;Node16</title>
-<g id="a_edge21_Node000012_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M655.92,-988.34C670.04,-988.34 684.9,-988.34 698.75,-988.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="698.59,-991.84 708.59,-988.34 698.59,-984.84 698.59,-991.84"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node7 -->
-<g id="edge25_Node000018_Node000007" class="edge">
-<title>Node18&#45;&gt;Node7</title>
-<g id="a_edge25_Node000018_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M762.49,-175.01C772.89,-216.23 801.15,-331.26 818,-428.34 839.76,-553.7 810.68,-592.71 854,-712.34 862.09,-734.69 877.38,-757.24 889.03,-772.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="886.16,-774.52 895.1,-780.2 891.66,-770.18 886.16,-774.52"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node8 -->
-<g id="edge26_Node000018_Node000008" class="edge">
-<title>Node18&#45;&gt;Node8</title>
-<g id="a_edge26_Node000018_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M803.05,-174.98C808.76,-178.6 814,-183.01 818,-188.34 877.01,-267.03 898.62,-586.62 903.41,-672.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="899.9,-672.14 903.93,-681.93 906.89,-671.76 899.9,-672.14"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="957,-113.59 854,-113.59 854,-83.09 957,-83.09 957,-113.59"/>
-<text text-anchor="start" x="862" y="-100.09" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::system</text>
-<text text-anchor="middle" x="905.5" y="-88.84" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node19 -->
-<g id="edge27_Node000018_Node000019" class="edge">
-<title>Node18&#45;&gt;Node19</title>
-<g id="a_edge27_Node000018_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M796.1,-143.63C814.49,-135.95 836.84,-126.61 856.45,-118.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="857.75,-121.66 865.63,-114.58 855.06,-115.2 857.75,-121.66"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="932.62,-224.96 878.38,-224.96 878.38,-205.71 932.62,-205.71 932.62,-224.96"/>
-<text text-anchor="middle" x="905.5" y="-211.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node20 -->
-<g id="edge28_Node000018_Node000020" class="edge">
-<title>Node18&#45;&gt;Node20</title>
-<g id="a_edge28_Node000018_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M796.94,-175C814.31,-181.99 835.13,-190.23 854,-197.34 858.36,-198.98 862.95,-200.67 867.5,-202.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="865.94,-205.48 876.54,-205.57 868.31,-198.9 865.94,-205.48"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="935.25,-187.96 875.75,-187.96 875.75,-168.71 935.25,-168.71 935.25,-187.96"/>
-<text text-anchor="middle" x="905.5" y="-174.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node21 -->
-<g id="edge29_Node000018_Node000021" class="edge">
-<title>Node18&#45;&gt;Node21</title>
-<g id="a_edge29_Node000018_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M818.31,-167.12C833.69,-169.12 849.88,-171.23 864.02,-173.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="863.48,-176.53 873.85,-174.35 864.39,-169.59 863.48,-176.53"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="934.88,-150.96 876.12,-150.96 876.12,-131.71 934.88,-131.71 934.88,-150.96"/>
-<text text-anchor="middle" x="905.5" y="-137.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node22 -->
-<g id="edge30_Node000018_Node000022" class="edge">
-<title>Node18&#45;&gt;Node22</title>
-<g id="a_edge30_Node000018_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M818.31,-151.97C833.81,-150.05 850.13,-148.04 864.36,-146.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="864.75,-149.77 874.24,-145.07 863.89,-142.82 864.75,-149.77"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node7 -->
-<g id="edge34_Node000023_Node000007" class="edge">
-<title>Node23&#45;&gt;Node7</title>
-<g id="a_edge34_Node000023_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M625.31,-878.02C671.07,-896.99 754.6,-922.95 818,-893.34 840.58,-882.79 837.9,-869.36 854,-850.34 865.55,-836.7 878.68,-821.36 888.65,-809.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="891.04,-812.34 894.9,-802.48 885.73,-807.78 891.04,-812.34"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node8 -->
-<g id="edge35_Node000023_Node000008" class="edge">
-<title>Node23&#45;&gt;Node8</title>
-<g id="a_edge35_Node000023_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M661.27,-850.72C717.85,-840.3 792.39,-824.12 818,-807.34 836.97,-794.91 872.88,-742.22 891.92,-713.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="894.8,-715.02 897.28,-704.72 888.92,-711.22 894.8,-715.02"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node9 -->
-<g id="edge36_Node000023_Node000009" class="edge">
-<title>Node23&#45;&gt;Node9</title>
-<g id="a_edge36_Node000023_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M661.14,-865.29C670.71,-865.69 680.51,-866.11 690.02,-866.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="689.79,-870.01 699.93,-866.94 690.09,-863.01 689.79,-870.01"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node11 -->
-<g id="edge37_Node000023_Node000011" class="edge">
-<title>Node23&#45;&gt;Node11</title>
-<g id="a_edge37_Node000023_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M642.41,-846.72C648.79,-844.19 655.13,-841.39 661,-838.34 678.51,-829.23 679.72,-821.88 697,-812.34 703.27,-808.88 710.15,-805.64 716.93,-802.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="718.07,-806.05 726,-799.02 715.42,-799.57 718.07,-806.05"/>
-</a>
-</g>
-</g>
-<!-- Node29&#45;&gt;Node9 -->
-<g id="edge45_Node000029_Node000009" class="edge">
-<title>Node29&#45;&gt;Node9</title>
-<g id="a_edge45_Node000029_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M629.58,-829.38C639.8,-832.18 650.85,-835.3 661,-838.34 673.27,-842.01 686.36,-846.13 698.8,-850.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="697.49,-853.39 708.08,-853.14 699.65,-846.73 697.49,-853.39"/>
-</a>
-</g>
-</g>
-<!-- Node29&#45;&gt;Node11 -->
-<g id="edge46_Node000029_Node000011" class="edge">
-<title>Node29&#45;&gt;Node11</title>
-<g id="a_edge46_Node000029_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M645.24,-809.27C660.06,-806.49 676.31,-803.43 691.69,-800.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="692.05,-804.03 701.23,-798.74 690.75,-797.15 692.05,-804.03"/>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node7 -->
-<g id="edge52_Node000031_Node000007" class="edge">
-<title>Node31&#45;&gt;Node7</title>
-<g id="a_edge52_Node000031_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M420.03,-365.36C437.06,-417.78 483.5,-552.07 520.5,-579.34 627.81,-658.41 713.34,-534.79 818,-617.34 853.45,-645.3 833.73,-671.99 854,-712.34 864.79,-733.82 879.93,-756.8 890.82,-772.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="887.75,-774.14 896.39,-780.27 893.47,-770.09 887.75,-774.14"/>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node8 -->
-<g id="edge54_Node000031_Node000008" class="edge">
-<title>Node31&#45;&gt;Node8</title>
-<g id="a_edge54_Node000031_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M424.1,-323.35C440.37,-294.11 474.37,-242.34 520.5,-221.34 577.33,-195.47 605.07,-193.56 661,-221.34 841.71,-311.08 891.4,-592.26 902.02,-672.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="898.54,-672.44 903.26,-681.92 905.49,-671.56 898.54,-672.44"/>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node11 -->
-<g id="edge68_Node000031_Node000011" class="edge">
-<title>Node31&#45;&gt;Node11</title>
-<g id="a_edge68_Node000031_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M421.4,-365.3C444.9,-426.59 512.45,-601.86 520.5,-612.34 578.38,-687.67 676.61,-746.39 726.1,-772.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="724.35,-775.94 734.83,-777.51 727.62,-769.75 724.35,-775.94"/>
-</a>
-</g>
-</g>
-<!-- Node32 -->
-<g id="Node000032" class="node">
-<title>Node32</title>
-<g id="a_Node000032"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="635.5,-483.96 546,-483.96 546,-464.71 635.5,-464.71 635.5,-483.96"/>
-<text text-anchor="middle" x="590.75" y="-470.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node32 -->
-<g id="edge49_Node000031_Node000032" class="edge">
-<title>Node31&#45;&gt;Node32</title>
-<g id="a_edge49_Node000031_Node000032"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M427.84,-365.48C446.36,-390.89 480.82,-433.04 520.5,-456.34 525.08,-459.03 530.06,-461.32 535.18,-463.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.78,-466.5 544.37,-466.35 536,-459.86 533.78,-466.5"/>
-</a>
-</g>
-</g>
-<!-- Node33 -->
-<g id="Node000033" class="node">
-<title>Node33</title>
-<g id="a_Node000033"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="634.38,-446.96 547.12,-446.96 547.12,-427.71 634.38,-427.71 634.38,-446.96"/>
-<text text-anchor="middle" x="590.75" y="-433.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::c_str</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node33 -->
-<g id="edge50_Node000031_Node000033" class="edge">
-<title>Node31&#45;&gt;Node33</title>
-<g id="a_edge50_Node000031_Node000033"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M438.2,-365.6C458.96,-382.39 489.99,-405.25 520.5,-419.34 525.39,-421.6 530.61,-423.6 535.9,-425.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="534.77,-428.7 545.36,-428.28 536.82,-422 534.77,-428.7"/>
-</a>
-</g>
-</g>
-<!-- Node34 -->
-<g id="Node000034" class="node">
-<title>Node34</title>
-<g id="a_Node000034"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="640.75,-409.96 540.75,-409.96 540.75,-390.71 640.75,-390.71 640.75,-409.96"/>
-<text text-anchor="middle" x="590.75" y="-396.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node34 -->
-<g id="edge51_Node000031_Node000034" class="edge">
-<title>Node31&#45;&gt;Node34</title>
-<g id="a_edge51_Node000031_Node000034"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.61,-365.67C486.66,-371.37 504.18,-377.33 520.5,-382.34 526,-384.03 531.78,-385.69 537.55,-387.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="536.55,-390.64 547.11,-389.87 538.37,-383.88 536.55,-390.64"/>
-</a>
-</g>
-</g>
-<!-- Node35 -->
-<g id="Node000035" class="node">
-<title>Node35</title>
-<g id="a_Node000035"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ios/eof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="635.88,-372.96 545.62,-372.96 545.62,-353.71 635.88,-353.71 635.88,-372.96"/>
-<text text-anchor="middle" x="590.75" y="-359.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::eof</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node35 -->
-<g id="edge53_Node000031_Node000035" class="edge">
-<title>Node31&#45;&gt;Node35</title>
-<g id="a_edge53_Node000031_Node000035"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M476.05,-351.09C494.91,-353.12 515.46,-355.34 533.84,-357.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.45,-360.79 543.77,-358.38 534.2,-353.83 533.45,-360.79"/>
-</a>
-</g>
-</g>
-<!-- Node36 -->
-<g id="Node000036" class="node">
-<title>Node36</title>
-<g id="a_Node000036"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="622.75,-335.96 558.75,-335.96 558.75,-316.71 622.75,-316.71 622.75,-335.96"/>
-<text text-anchor="middle" x="590.75" y="-322.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node36 -->
-<g id="edge55_Node000031_Node000036" class="edge">
-<title>Node31&#45;&gt;Node36</title>
-<g id="a_edge55_Node000031_Node000036"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M476.05,-337.94C499.61,-335.54 525.83,-332.86 547.15,-330.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="547.34,-334.19 556.93,-329.69 546.63,-327.22 547.34,-334.19"/>
-</a>
-</g>
-</g>
-<!-- Node37 -->
-<g id="Node000037" class="node">
-<title>Node37</title>
-<g id="a_Node000037"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="651.62,-298.59 529.88,-298.59 529.88,-268.09 651.62,-268.09 651.62,-298.59"/>
-<text text-anchor="start" x="537.88" y="-285.09" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::insert</text>
-<text text-anchor="middle" x="590.75" y="-273.84" font-family="Helvetica,sans-Serif" font-size="10.00">_element</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node37 -->
-<g id="edge56_Node000031_Node000037" class="edge">
-<title>Node31&#45;&gt;Node37</title>
-<g id="a_edge56_Node000031_Node000037"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M475.06,-323C494.08,-316.43 514.91,-309.22 533.54,-302.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="534.48,-306.16 542.79,-299.58 532.19,-299.54 534.48,-306.16"/>
-</a>
-</g>
-</g>
-<!-- Node38 -->
-<g id="Node000038" class="node">
-<title>Node38</title>
-<g id="a_Node000038"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="646,-249.96 535.5,-249.96 535.5,-230.71 646,-230.71 646,-249.96"/>
-<text text-anchor="middle" x="590.75" y="-236.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node38 -->
-<g id="edge57_Node000031_Node000038" class="edge">
-<title>Node31&#45;&gt;Node38</title>
-<g id="a_edge57_Node000031_Node000038"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M434.52,-323.23C454.91,-303.99 487.47,-276.09 520.5,-259.34 524.22,-257.45 528.15,-255.73 532.18,-254.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.25,-257.5 541.53,-250.9 530.94,-250.9 533.25,-257.5"/>
-</a>
-</g>
-</g>
-<!-- Node39 -->
-<g id="Node000039" class="node">
-<title>Node39</title>
-<g id="a_Node000039"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="656.88,-570.59 524.62,-570.59 524.62,-540.09 656.88,-540.09 656.88,-570.59"/>
-<text text-anchor="start" x="532.62" y="-557.09" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::minmax</text>
-<text text-anchor="middle" x="590.75" y="-545.84" font-family="Helvetica,sans-Serif" font-size="10.00">_scaler</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node39 -->
-<g id="edge58_Node000031_Node000039" class="edge">
-<title>Node31&#45;&gt;Node39</title>
-<g id="a_edge58_Node000031_Node000039"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M426.59,-365.66C445.61,-395.6 482.6,-451.15 520.5,-493.34 533.03,-507.29 548.45,-521.34 561.56,-532.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="559.13,-535.07 569.04,-538.82 563.63,-529.71 559.13,-535.07"/>
-</a>
-</g>
-</g>
-<!-- Node41 -->
-<g id="Node000041" class="node">
-<title>Node41</title>
-<g id="a_Node000041"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="639.62,-173.96 541.88,-173.96 541.88,-154.71 639.62,-154.71 639.62,-173.96"/>
-<text text-anchor="middle" x="590.75" y="-160.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node41 -->
-<g id="edge65_Node000031_Node000041" class="edge">
-<title>Node31&#45;&gt;Node41</title>
-<g id="a_edge65_Node000031_Node000041"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M422.5,-323.23C437.93,-289.89 472.29,-225.09 520.5,-188.34 525.37,-184.63 530.86,-181.46 536.55,-178.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="537.68,-182.09 545.56,-175 534.98,-175.63 537.68,-182.09"/>
-</a>
-</g>
-</g>
-<!-- Node42 -->
-<g id="Node000042" class="node">
-<title>Node42</title>
-<g id="a_Node000042"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="660.62,-136.96 520.88,-136.96 520.88,-117.71 660.62,-117.71 660.62,-136.96"/>
-<text text-anchor="middle" x="590.75" y="-123.46" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node42 -->
-<g id="edge66_Node000031_Node000042" class="edge">
-<title>Node31&#45;&gt;Node42</title>
-<g id="a_edge66_Node000031_Node000042"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M418.65,-323.25C429.98,-282.39 460.63,-192.35 520.5,-145.34 521.63,-144.45 522.79,-143.61 523.99,-142.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="525.34,-146.07 532.41,-138.18 521.96,-139.93 525.34,-146.07"/>
-</a>
-</g>
-</g>
-<!-- Node43 -->
-<g id="Node000043" class="node">
-<title>Node43</title>
-<g id="a_Node000043"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="647.5,-99.59 534,-99.59 534,-69.09 647.5,-69.09 647.5,-99.59"/>
-<text text-anchor="start" x="542" y="-86.09" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop</text>
-<text text-anchor="middle" x="590.75" y="-74.84" font-family="Helvetica,sans-Serif" font-size="10.00">_front</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node43 -->
-<g id="edge67_Node000031_Node000043" class="edge">
-<title>Node31&#45;&gt;Node43</title>
-<g id="a_edge67_Node000031_Node000043"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M417.17,-323.08C426.44,-277.26 454.49,-168.51 520.5,-108.34 521.73,-107.21 523.02,-106.14 524.36,-105.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="525.97,-108.24 532.49,-99.88 522.18,-102.36 525.97,-108.24"/>
-</a>
-</g>
-</g>
-<!-- Node44 -->
-<g id="Node000044" class="node">
-<title>Node44</title>
-<g id="a_Node000044"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="617.88,-50.96 563.62,-50.96 563.62,-31.71 617.88,-31.71 617.88,-50.96"/>
-<text text-anchor="middle" x="590.75" y="-37.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::stod</text>
-</a>
-</g>
-</g>
-<!-- Node31&#45;&gt;Node44 -->
-<g id="edge69_Node000031_Node000044" class="edge">
-<title>Node31&#45;&gt;Node44</title>
-<g id="a_edge69_Node000031_Node000044"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M414.97,-323.29C420.09,-270.77 440.84,-132.92 520.5,-60.34 529.21,-52.4 540.92,-47.74 552.24,-45.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="552.65,-48.49 561.81,-43.16 551.33,-41.62 552.65,-48.49"/>
-</a>
-</g>
-</g>
-<!-- Node39&#45;&gt;Node7 -->
-<g id="edge59_Node000039_Node000007" class="edge">
-<title>Node39&#45;&gt;Node7</title>
-<g id="a_edge59_Node000039_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M657.36,-555.91C715.46,-557.78 794.58,-564.12 818,-584.34 862.74,-622.95 829.82,-658.41 854,-712.34 863.83,-734.27 879.12,-757.18 890.3,-772.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="887.3,-774.48 896.06,-780.44 892.93,-770.31 887.3,-774.48"/>
-</a>
-</g>
-</g>
-<!-- Node39&#45;&gt;Node8 -->
-<g id="edge60_Node000039_Node000008" class="edge">
-<title>Node39&#45;&gt;Node8</title>
-<g id="a_edge60_Node000039_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M638.95,-539.68C687.27,-526.65 762.89,-514.82 818,-546.34 865.85,-573.7 889.85,-638.99 899.38,-672.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="895.91,-673.17 901.87,-681.94 902.68,-671.37 895.91,-673.17"/>
-</a>
-</g>
-</g>
-<!-- Node39&#45;&gt;Node9 -->
-<g id="edge61_Node000039_Node000009" class="edge">
-<title>Node39&#45;&gt;Node9</title>
-<g id="a_edge61_Node000039_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M596.1,-571.07C607.93,-612.26 643.46,-725.65 697,-807.34 706.19,-821.36 718.77,-835.01 730,-845.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="727.47,-848.35 737.15,-852.66 732.27,-843.25 727.47,-848.35"/>
-</a>
-</g>
-</g>
-<!-- Node39&#45;&gt;Node24 -->
-<g id="edge63_Node000039_Node000024" class="edge">
-<title>Node39&#45;&gt;Node24</title>
-<g id="a_edge63_Node000039_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M623.52,-570.96C653.16,-585.53 697.09,-607.13 726.24,-621.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="724.38,-624.45 734.9,-625.72 727.47,-618.17 724.38,-624.45"/>
-</a>
-</g>
-</g>
-<!-- Node39&#45;&gt;Node27 -->
-<g id="edge64_Node000039_Node000027" class="edge">
-<title>Node39&#45;&gt;Node27</title>
-<g id="a_edge64_Node000039_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M640.65,-539.59C647.94,-535.95 655.01,-531.56 661,-526.34 684.73,-505.65 672.24,-484.78 697,-465.34 699.11,-463.68 701.38,-462.17 703.74,-460.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="705.05,-464.06 712.56,-456.58 702.03,-457.75 705.05,-464.06"/>
-</a>
-</g>
-</g>
-<!-- Node40 -->
-<g id="Node000040" class="node">
-<title>Node40</title>
-<g id="a_Node000040"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="784.62,-493.96 730.38,-493.96 730.38,-474.71 784.62,-474.71 784.62,-493.96"/>
-<text text-anchor="middle" x="757.5" y="-480.46" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node39&#45;&gt;Node40 -->
-<g id="edge62_Node000039_Node000040" class="edge">
-<title>Node39&#45;&gt;Node40</title>
-<g id="a_edge62_Node000039_Node000040"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M630.41,-539.69C640.43,-535.48 651.17,-530.85 661,-526.34 677.26,-518.88 680.69,-515.69 697,-508.34 704.32,-505.04 712.23,-501.7 719.82,-498.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="720.87,-501.95 728.84,-494.97 718.25,-495.45 720.87,-501.95"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph.map b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph.map
deleted file mode 100644
index ae8035045..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="machine_learning::neural_network::NeuralNetwork::load_model" name="machine_learning::neural_network::NeuralNetwork::load_model">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,188,175,243"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/c_str.html#" title=" " alt="" coords="252,5,368,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="103,186,122,152,148,113,182,74,221,40,236,32,239,36,224,44,186,77,153,116,126,155,107,189"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ifstream/close.html#" title=" " alt="" coords="244,55,377,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="112,185,159,136,189,111,221,89,231,84,234,89,224,94,192,115,163,140,116,189"/>
-<area shape="rect" id="Node000004" 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="223,104,398,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="134,185,175,161,222,138,238,132,240,137,224,143,178,165,136,189"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="275,153,346,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="174,194,259,175,260,180,175,199"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="276,203,344,228"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="175,213,261,213,261,218,175,218"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ifstream/is_open.html#" title=" " alt="" coords="237,252,384,278"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="175,232,236,246,235,251,174,237"/>
-<area shape="rect" id="Node000008" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ae7cf126a3a8f9d20c81b21584d061a08" title=" " alt="" coords="226,302,395,358"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="140,241,224,288,234,293,231,297,221,293,138,246"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ifstream/open.html#" title=" " alt="" coords="245,383,376,408"/>
-<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="110,242,157,306,188,339,224,368,235,374,232,379,221,372,185,343,153,309,106,245"/>
-<area shape="rect" id="Node000010" 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="233,432,388,458"/>
-<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="104,243,122,282,148,330,182,378,224,419,230,422,227,427,221,423,178,382,143,333,117,285,99,245"/>
-</map>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph.md5 b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph.md5
deleted file mode 100644
index 2ae8ac0cd..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-05206c19adb5e3bed13d2db798bc9b54
\ No newline at end of file
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph.svg
deleted file mode 100644
index dc273da6f..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph.svg
+++ /dev/null
@@ -1,213 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::load_model Pages: 1 -->
-<svg width="303pt" height="347pt"
- viewBox="0.00 0.00 302.50 347.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 343.25)">
-<title>machine_learning::neural_network::NeuralNetwork::load_model</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-202.5 0,-202.5 0,-160.75 127,-160.75 127,-202.5"/>
-<text text-anchor="start" x="8" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-166.5" font-family="Helvetica,sans-Serif" font-size="10.00">::load_model</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272.38,-339.25 185.12,-339.25 185.12,-320 272.38,-320 272.38,-339.25"/>
-<text text-anchor="middle" x="228.75" y="-325.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::c_str</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.75,-202.59C89.97,-231.51 121.31,-283.3 163,-311.62 166.49,-313.99 170.28,-316.05 174.22,-317.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.9,-321.08 183.48,-321.43 175.42,-314.55 172.9,-321.08"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278.75,-302.25 178.75,-302.25 178.75,-283 278.75,-283 278.75,-302.25"/>
-<text text-anchor="middle" x="228.75" y="-288.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.5,-202.85C99.57,-224.03 130.03,-256.01 163,-274.62 165.36,-275.96 167.82,-277.19 170.35,-278.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.03,-281.58 179.61,-282.03 171.62,-275.08 169.03,-281.58"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294.5,-265.25 163,-265.25 163,-246 294.5,-246 294.5,-265.25"/>
-<text text-anchor="middle" x="228.75" y="-251.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.2,-202.92C115.89,-214.39 140.11,-228.11 163,-237.62 166.83,-239.22 170.85,-240.72 174.93,-242.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.75,-245.42 184.35,-245.13 175.89,-238.75 173.75,-245.42"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-228.25 202,-228.25 202,-209 255.5,-209 255.5,-228.25"/>
-<text text-anchor="middle" x="228.75" y="-214.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.15,-195.82C148.59,-200.68 171.89,-205.96 190.66,-210.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.7,-213.59 200.23,-212.39 191.25,-206.76 189.7,-213.59"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.38,-191.25 203.12,-191.25 203.12,-172 254.38,-172 254.38,-191.25"/>
-<text text-anchor="middle" x="228.75" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.15,-181.62C148.94,-181.62 172.64,-181.62 191.56,-181.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.43,-185.13 201.43,-181.63 191.43,-178.13 191.43,-185.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="284,-154.25 173.5,-154.25 173.5,-135 284,-135 284,-154.25"/>
-<text text-anchor="middle" x="228.75" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.15,-167.43C142.05,-164.05 157.85,-160.47 172.4,-157.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.79,-160.67 181.77,-155.05 171.25,-153.84 172.79,-160.67"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ae7cf126a3a8f9d20c81b21584d061a08" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.25,-116.5 165.25,-116.5 165.25,-74.75 292.25,-74.75 292.25,-116.5"/>
-<text text-anchor="start" x="173.25" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="173.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="228.75" y="-80.5" font-family="Helvetica,sans-Serif" font-size="10.00">::NeuralNetwork</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.13,-160.42C118.67,-149.63 141.84,-136.52 163,-125.62 165.37,-124.4 167.8,-123.18 170.26,-121.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.68,-125.16 179.13,-117.63 168.61,-118.86 171.68,-125.16"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="277.62,-56.25 179.88,-56.25 179.88,-37 277.62,-37 277.62,-56.25"/>
-<text text-anchor="middle" x="228.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.05,-160.35C93.53,-134.24 124.89,-90.38 163,-65.62 165.54,-63.98 168.22,-62.47 171,-61.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.16,-64.4 179.96,-57.22 169.39,-57.97 172.16,-64.4"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="286.62,-19.25 170.88,-19.25 170.88,0 286.62,0 286.62,-19.25"/>
-<text text-anchor="middle" x="228.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.24,-160.44C85.53,-127.05 115.91,-62.43 163,-27.62 164.35,-26.63 165.75,-25.69 167.19,-24.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.58,-28.02 175.89,-20.34 165.39,-21.79 168.58,-28.02"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph_org.svg
deleted file mode 100644
index d8a28eabb..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a58ed20abf6ce3744535bd8b5bb9e741b_cgraph_org.svg
+++ /dev/null
@@ -1,187 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::load_model Pages: 1 -->
-<svg width="303pt" height="347pt"
- viewBox="0.00 0.00 302.50 347.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 343.25)">
-<title>machine_learning::neural_network::NeuralNetwork::load_model</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-202.5 0,-202.5 0,-160.75 127,-160.75 127,-202.5"/>
-<text text-anchor="start" x="8" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-166.5" font-family="Helvetica,sans-Serif" font-size="10.00">::load_model</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272.38,-339.25 185.12,-339.25 185.12,-320 272.38,-320 272.38,-339.25"/>
-<text text-anchor="middle" x="228.75" y="-325.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::c_str</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.75,-202.59C89.97,-231.51 121.31,-283.3 163,-311.62 166.49,-313.99 170.28,-316.05 174.22,-317.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.9,-321.08 183.48,-321.43 175.42,-314.55 172.9,-321.08"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278.75,-302.25 178.75,-302.25 178.75,-283 278.75,-283 278.75,-302.25"/>
-<text text-anchor="middle" x="228.75" y="-288.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.5,-202.85C99.57,-224.03 130.03,-256.01 163,-274.62 165.36,-275.96 167.82,-277.19 170.35,-278.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.03,-281.58 179.61,-282.03 171.62,-275.08 169.03,-281.58"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294.5,-265.25 163,-265.25 163,-246 294.5,-246 294.5,-265.25"/>
-<text text-anchor="middle" x="228.75" y="-251.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.2,-202.92C115.89,-214.39 140.11,-228.11 163,-237.62 166.83,-239.22 170.85,-240.72 174.93,-242.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.75,-245.42 184.35,-245.13 175.89,-238.75 173.75,-245.42"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-228.25 202,-228.25 202,-209 255.5,-209 255.5,-228.25"/>
-<text text-anchor="middle" x="228.75" y="-214.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.15,-195.82C148.59,-200.68 171.89,-205.96 190.66,-210.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.7,-213.59 200.23,-212.39 191.25,-206.76 189.7,-213.59"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.38,-191.25 203.12,-191.25 203.12,-172 254.38,-172 254.38,-191.25"/>
-<text text-anchor="middle" x="228.75" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.15,-181.62C148.94,-181.62 172.64,-181.62 191.56,-181.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.43,-185.13 201.43,-181.63 191.43,-178.13 191.43,-185.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="284,-154.25 173.5,-154.25 173.5,-135 284,-135 284,-154.25"/>
-<text text-anchor="middle" x="228.75" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.15,-167.43C142.05,-164.05 157.85,-160.47 172.4,-157.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.79,-160.67 181.77,-155.05 171.25,-153.84 172.79,-160.67"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ae7cf126a3a8f9d20c81b21584d061a08" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.25,-116.5 165.25,-116.5 165.25,-74.75 292.25,-74.75 292.25,-116.5"/>
-<text text-anchor="start" x="173.25" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="173.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="228.75" y="-80.5" font-family="Helvetica,sans-Serif" font-size="10.00">::NeuralNetwork</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.13,-160.42C118.67,-149.63 141.84,-136.52 163,-125.62 165.37,-124.4 167.8,-123.18 170.26,-121.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.68,-125.16 179.13,-117.63 168.61,-118.86 171.68,-125.16"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="277.62,-56.25 179.88,-56.25 179.88,-37 277.62,-37 277.62,-56.25"/>
-<text text-anchor="middle" x="228.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.05,-160.35C93.53,-134.24 124.89,-90.38 163,-65.62 165.54,-63.98 168.22,-62.47 171,-61.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.16,-64.4 179.96,-57.22 169.39,-57.97 172.16,-64.4"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="286.62,-19.25 170.88,-19.25 170.88,0 286.62,0 286.62,-19.25"/>
-<text text-anchor="middle" x="228.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.24,-160.44C85.53,-127.05 115.91,-62.43 163,-27.62 164.35,-26.63 165.75,-25.69 167.19,-24.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.58,-28.02 175.89,-20.34 165.39,-21.79 168.58,-28.02"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph.map b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph.map
deleted file mode 100644
index dbc06ddf7..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="machine_learning::neural_network::NeuralNetwork::summary" name="machine_learning::neural_network::NeuralNetwork::summary">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,16,175,71"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="437,5,508,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="175,35,421,19,422,24,175,41"/>
-<area shape="rect" id="Node000003" href="$d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" title=" " alt="" coords="223,51,371,92"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="175,52,208,57,207,62,175,58"/>
-<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="365,48,421,31,423,36,367,53"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="438,56,507,82"/>
-<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="372,68,423,67,423,72,372,73"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="419,105,526,131"/>
-<area shape="poly" id="edge5_Node000003_Node000005" title=" " alt="" coords="372,89,407,98,406,103,371,94"/>
-</map>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph.md5 b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph.md5
deleted file mode 100644
index ef14d36a1..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-42baa928187147659a54a5d0c9fdafa6
\ No newline at end of file
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph.svg
deleted file mode 100644
index 2463635cc..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph.svg
+++ /dev/null
@@ -1,131 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::summary Pages: 1 -->
-<svg width="399pt" height="102pt"
- viewBox="0.00 0.00 398.75 102.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 98.25)">
-<title>machine_learning::neural_network::NeuralNetwork::summary</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-86.5 0,-86.5 0,-44.75 127,-44.75 127,-86.5"/>
-<text text-anchor="start" x="8" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-50.5" font-family="Helvetica,sans-Serif" font-size="10.00">::summary</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="377.25,-94.25 323.75,-94.25 323.75,-75 377.25,-75 377.25,-94.25"/>
-<text text-anchor="middle" x="350.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.4,-69.82C183.95,-73.59 265.12,-79 312.07,-82.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="311.79,-85.62 322,-82.79 312.25,-78.63 311.79,-85.62"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.25,-59.88 163,-59.88 163,-29.38 274.25,-29.38 274.25,-59.88"/>
-<text text-anchor="start" x="171" y="-46.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="218.62" y="-35.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.22,-57.02C135.2,-55.93 143.37,-54.81 151.4,-53.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.67,-57.2 161.1,-52.38 150.72,-50.27 151.67,-57.2"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.58,-60.32C284.54,-64.62 299.41,-69.2 312.43,-73.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="311.3,-76.52 321.88,-76.12 313.36,-69.83 311.3,-76.52"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="376.12,-56.25 324.88,-56.25 324.88,-37 376.12,-37 376.12,-56.25"/>
-<text text-anchor="middle" x="350.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.7,-45.47C287.77,-45.67 301.38,-45.88 313.36,-46.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.14,-49.57 323.19,-46.22 313.25,-42.57 313.14,-49.57"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="390.75,-19.25 310.25,-19.25 310.25,0 390.75,0 390.75,-19.25"/>
-<text text-anchor="middle" x="350.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge5_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge5_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.7,-29.78C283.45,-27.42 292.45,-25 301.03,-22.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="301.81,-26.1 310.56,-20.12 299.99,-19.34 301.81,-26.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph_org.svg
deleted file mode 100644
index 8d8b40753..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a61d30113d13304c664057118b92a5931_cgraph_org.svg
+++ /dev/null
@@ -1,105 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::summary Pages: 1 -->
-<svg width="399pt" height="102pt"
- viewBox="0.00 0.00 398.75 102.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 98.25)">
-<title>machine_learning::neural_network::NeuralNetwork::summary</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-86.5 0,-86.5 0,-44.75 127,-44.75 127,-86.5"/>
-<text text-anchor="start" x="8" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-50.5" font-family="Helvetica,sans-Serif" font-size="10.00">::summary</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="377.25,-94.25 323.75,-94.25 323.75,-75 377.25,-75 377.25,-94.25"/>
-<text text-anchor="middle" x="350.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.4,-69.82C183.95,-73.59 265.12,-79 312.07,-82.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="311.79,-85.62 322,-82.79 312.25,-78.63 311.79,-85.62"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.25,-59.88 163,-59.88 163,-29.38 274.25,-29.38 274.25,-59.88"/>
-<text text-anchor="start" x="171" y="-46.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="218.62" y="-35.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.22,-57.02C135.2,-55.93 143.37,-54.81 151.4,-53.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.67,-57.2 161.1,-52.38 150.72,-50.27 151.67,-57.2"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.58,-60.32C284.54,-64.62 299.41,-69.2 312.43,-73.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="311.3,-76.52 321.88,-76.12 313.36,-69.83 311.3,-76.52"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="376.12,-56.25 324.88,-56.25 324.88,-37 376.12,-37 376.12,-56.25"/>
-<text text-anchor="middle" x="350.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.7,-45.47C287.77,-45.67 301.38,-45.88 313.36,-46.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.14,-49.57 323.19,-46.22 313.25,-42.57 313.14,-49.57"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="390.75,-19.25 310.25,-19.25 310.25,0 390.75,0 390.75,-19.25"/>
-<text text-anchor="middle" x="350.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge5_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge5_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.7,-29.78C283.45,-27.42 292.45,-25 301.03,-22.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="301.81,-26.1 310.56,-20.12 299.99,-19.34 301.81,-26.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a62151b0398a2536be60d950e10ffe9a8_cgraph.map b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a62151b0398a2536be60d950e10ffe9a8_cgraph.map
deleted file mode 100644
index c1e5dc76e..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a62151b0398a2536be60d950e10ffe9a8_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="machine_learning::neural_network::NeuralNetwork::NeuralNetwork" name="machine_learning::neural_network::NeuralNetwork::NeuralNetwork">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,16,175,71"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="223,5,294,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="175,28,207,23,208,28,176,33"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="224,55,292,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="176,53,209,58,208,63,175,58"/>
-</map>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a62151b0398a2536be60d950e10ffe9a8_cgraph.md5 b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a62151b0398a2536be60d950e10ffe9a8_cgraph.md5
deleted file mode 100644
index 71115796b..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a62151b0398a2536be60d950e10ffe9a8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-62e890387611f99b9b86bef292da3350
\ No newline at end of file
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a62151b0398a2536be60d950e10ffe9a8_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a62151b0398a2536be60d950e10ffe9a8_cgraph.svg
deleted file mode 100644
index 0dc21fc30..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a62151b0398a2536be60d950e10ffe9a8_cgraph.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::NeuralNetwork Pages: 1 -->
-<svg width="225pt" height="64pt"
- viewBox="0.00 0.00 224.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>machine_learning::neural_network::NeuralNetwork::NeuralNetwork</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-48.5 0,-48.5 0,-6.75 127,-6.75 127,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::NeuralNetwork</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-56.25 163,-56.25 163,-37 216.5,-37 216.5,-56.25"/>
-<text text-anchor="middle" x="189.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.35,-37.24C135.67,-38.51 143.96,-39.78 151.65,-40.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.85,-44.37 161.26,-42.42 151.91,-37.45 150.85,-44.37"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.38,-19.25 164.12,-19.25 164.12,0 215.38,0 215.38,-19.25"/>
-<text text-anchor="middle" x="189.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.35,-18.52C135.91,-17.28 144.44,-16.04 152.31,-14.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.76,-18.38 162.16,-13.48 151.76,-11.45 152.76,-18.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a62151b0398a2536be60d950e10ffe9a8_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a62151b0398a2536be60d950e10ffe9a8_cgraph_org.svg
deleted file mode 100644
index 94e0d773d..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a62151b0398a2536be60d950e10ffe9a8_cgraph_org.svg
+++ /dev/null
@@ -1,59 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::NeuralNetwork Pages: 1 -->
-<svg width="225pt" height="64pt"
- viewBox="0.00 0.00 224.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>machine_learning::neural_network::NeuralNetwork::NeuralNetwork</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-48.5 0,-48.5 0,-6.75 127,-6.75 127,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::NeuralNetwork</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-56.25 163,-56.25 163,-37 216.5,-37 216.5,-56.25"/>
-<text text-anchor="middle" x="189.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.35,-37.24C135.67,-38.51 143.96,-39.78 151.65,-40.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.85,-44.37 161.26,-42.42 151.91,-37.45 150.85,-44.37"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.38,-19.25 164.12,-19.25 164.12,0 215.38,0 215.38,-19.25"/>
-<text text-anchor="middle" x="189.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.35,-18.52C135.91,-17.28 144.44,-16.04 152.31,-14.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.76,-18.38 162.16,-13.48 151.76,-11.45 152.76,-18.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph.map b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph.map
deleted file mode 100644
index 3ffd948e6..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph.map
+++ /dev/null
@@ -1,47 +0,0 @@
-<map id="machine_learning::neural_network::NeuralNetwork::get_XY_from_csv" name="machine_learning::neural_network::NeuralNetwork::get_XY_from_csv">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,381,175,437"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="256,5,376,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="90,380,98,311,119,220,136,171,158,123,186,79,221,40,240,27,243,32,224,44,190,82,163,126,141,173,124,221,104,312,95,381"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/c_str.html#" title=" " alt="" coords="258,55,374,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="92,380,103,320,126,241,143,200,164,160,190,122,221,89,241,77,244,81,224,94,194,126,168,162,147,202,131,243,108,321,97,381"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ifstream/close.html#" title=" " alt="" coords="249,104,382,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="95,380,111,330,136,268,172,203,195,173,221,147,239,134,242,139,224,151,199,177,176,206,141,270,116,332,101,381"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="671,188,743,214"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="98,380,115,340,141,292,176,246,198,226,221,209,277,184,336,168,397,160,457,158,516,161,570,168,657,185,656,190,569,173,515,166,457,163,397,165,337,173,278,189,224,214,201,230,180,250,146,295,120,342,103,382"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ios/eof.html#" title=" " alt="" coords="256,224,376,250"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="107,379,154,319,185,287,221,260,240,251,242,255,224,264,189,291,158,322,111,382"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="673,403,741,428"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="126,435,170,465,224,489,329,516,373,524,415,527,456,525,500,518,604,489,647,466,682,437,685,441,650,471,606,494,501,524,457,530,415,532,373,529,328,522,222,494,168,470,123,439"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/getline.html#" title=" " alt="" coords="273,339,358,364"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="174,385,258,363,259,369,176,390"/>
-<area shape="rect" id="Node000009" href="$d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd" title=" " alt="" coords="235,388,397,429"/>
-<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="175,406,219,406,219,412,175,412"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ifstream/is_open.html#" title=" " alt="" coords="242,453,390,479"/>
-<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="176,428,248,446,247,452,174,433"/>
-<area shape="rect" id="Node000011" href="$d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26" title=" " alt="" coords="228,274,404,314"/>
-<area shape="poly" id="edge10_Node000001_Node000011" title=" " alt="" coords="129,378,173,350,221,324,233,318,236,323,224,329,176,355,132,383"/>
-<area shape="rect" id="Node000017" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ifstream/open.html#" title=" " alt="" coords="251,555,381,580"/>
-<area shape="poly" id="edge20_Node000001_Node000017" title=" " alt="" coords="116,435,163,485,192,511,224,533,251,547,249,551,221,538,189,515,159,489,112,439"/>
-<area shape="rect" id="Node000018" href="$d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d" title=" " alt="" coords="223,604,409,630"/>
-<area shape="poly" id="edge21_Node000001_Node000018" title=" " alt="" coords="106,436,125,472,151,514,184,556,224,591,231,595,228,599,221,595,180,559,147,517,120,474,101,438"/>
-<area shape="rect" id="Node000019" href="$d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093" title=" " alt="" coords="240,654,392,694"/>
-<area shape="poly" id="edge22_Node000001_Node000019" title=" " alt="" coords="102,436,119,481,144,536,180,592,201,617,224,640,229,644,226,648,221,644,197,621,175,595,140,538,114,483,97,438"/>
-<area shape="rect" id="Node000020" 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="239,719,393,744"/>
-<area shape="poly" id="edge23_Node000001_Node000020" title=" " alt="" coords="98,436,111,493,134,565,150,603,171,640,195,674,224,704,230,709,227,713,221,708,191,678,166,643,146,606,129,567,105,494,93,437"/>
-<area shape="rect" id="Node000021" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/stof.html#" title=" " alt="" coords="280,768,352,794"/>
-<area shape="poly" id="edge24_Node000001_Node000021" title=" " alt="" coords="96,437,105,502,127,588,143,634,165,678,192,719,224,755,244,767,266,774,264,779,241,772,221,759,187,722,160,681,138,636,122,590,100,503,91,437"/>
-<area shape="poly" id="edge11_Node000011_Node000005" title=" " alt="" coords="384,271,408,260,431,241,441,232,456,224,508,208,561,200,656,196,656,201,562,205,509,214,458,229,444,236,434,245,410,264,386,276"/>
-<area shape="poly" id="edge12_Node000011_Node000007" title=" " alt="" coords="392,313,411,324,426,341,435,358,443,374,458,388,508,408,561,418,613,421,657,419,657,424,613,426,560,423,506,413,456,392,438,377,430,361,422,344,407,328,389,317"/>
-<area shape="rect" id="Node000012" href="$d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" title=" " alt="" coords="457,338,605,378"/>
-<area shape="poly" id="edge13_Node000011_Node000012" title=" " alt="" coords="388,313,446,330,445,335,386,318"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="495,453,567,479"/>
-<area shape="poly" id="edge17_Node000011_Node000014" title=" " alt="" coords="395,313,411,324,423,338,430,352,436,379,442,406,448,419,459,432,482,448,479,453,455,436,444,422,437,408,431,380,425,354,418,341,407,328,392,317"/>
-<area shape="rect" id="Node000015" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="497,239,565,264"/>
-<area shape="poly" id="edge18_Node000011_Node000015" title=" " alt="" coords="404,274,481,259,482,264,405,279"/>
-<area shape="rect" id="Node000016" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="474,288,589,314"/>
-<area shape="poly" id="edge19_Node000011_Node000016" title=" " alt="" coords="404,294,458,296,458,301,404,300"/>
-<area shape="poly" id="edge14_Node000012_Node000005" title=" " alt="" coords="586,335,604,324,629,301,653,275,688,226,692,229,657,278,633,305,607,328,589,340"/>
-<area shape="poly" id="edge15_Node000012_Node000007" title=" " alt="" coords="596,376,659,397,658,402,595,382"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="653,345,761,371"/>
-<area shape="poly" id="edge16_Node000012_Node000013" title=" " alt="" coords="606,356,638,356,638,361,606,361"/>
-</map>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph.md5 b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph.md5
deleted file mode 100644
index de25de730..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-02784fa5ed412abf239cd074917faa9c
\ No newline at end of file
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph.svg
deleted file mode 100644
index a1dfe2783..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph.svg
+++ /dev/null
@@ -1,506 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::get_XY_from_csv Pages: 1 -->
-<!--zoomable 599 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 575;
-var viewHeight = 599;
-var sectionId = 'dynsection-9';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>machine_learning::neural_network::NeuralNetwork::get_XY_from_csv</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-309.5 0,-309.5 0,-267.75 127,-267.75 127,-309.5"/>
-<text text-anchor="start" x="8" y="-296" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-284.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-273.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_XY_from_csv</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="277.62,-591.25 188.12,-591.25 188.12,-572 277.62,-572 277.62,-591.25"/>
-<text text-anchor="middle" x="232.88" y="-577.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M65.62,-309.79C69.53,-361.27 86.88,-493.94 163,-563.62 167.22,-567.49 172.17,-570.55 177.44,-572.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.87,-576.11 186.46,-576.32 178.32,-569.55 175.87,-576.11"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="276.5,-554.25 189.25,-554.25 189.25,-535 276.5,-535 276.5,-554.25"/>
-<text text-anchor="middle" x="232.88" y="-540.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::c_str</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.95,-309.72C73.5,-356.21 95.75,-468 163,-526.62 167.43,-530.49 172.59,-533.53 178.05,-535.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.81,-539.21 187.4,-539.3 179.17,-532.62 176.81,-539.21"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282.88,-517.25 182.88,-517.25 182.88,-498 282.88,-498 282.88,-517.25"/>
-<text text-anchor="middle" x="232.88" y="-503.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.54,-309.79C80.05,-349.5 108.07,-435.53 163,-483.62 167.07,-487.19 171.71,-490.24 176.6,-492.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.99,-495.94 185.53,-496.93 177.9,-489.58 174.99,-495.94"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="553,-454.25 499.5,-454.25 499.5,-435 553,-435 553,-454.25"/>
-<text text-anchor="middle" x="526.25" y="-440.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.65,-309.82C84.21,-343.36 113.7,-407.82 163,-436.62 267.45,-497.64 419.38,-471.51 488.52,-454.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="488.96,-458.22 497.81,-452.39 487.26,-451.43 488.96,-458.22"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ios/eof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278,-427.25 187.75,-427.25 187.75,-408 278,-408 278,-427.25"/>
-<text text-anchor="middle" x="232.88" y="-413.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::eof</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.84,-309.75C94.68,-334.69 125.96,-375.67 163,-398.62 167.27,-401.27 171.91,-403.55 176.69,-405.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.3,-408.74 185.9,-408.84 177.68,-402.16 175.3,-408.74"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="551.88,-293.25 500.62,-293.25 500.62,-274 551.88,-274 551.88,-293.25"/>
-<text text-anchor="middle" x="526.25" y="-279.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.3,-267.42C108.14,-252.79 135.43,-234.58 163,-226.62 285.56,-191.26 329.09,-186 450,-226.62 472.9,-234.32 494.38,-252.05 508.48,-265.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="505.66,-267.84 515.19,-272.49 510.64,-262.92 505.66,-267.84"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.88,-341.25 200.88,-341.25 200.88,-322 264.88,-322 264.88,-341.25"/>
-<text text-anchor="middle" x="232.88" y="-327.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.3,-304.76C148.14,-310.11 170.82,-315.94 189.72,-320.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.64,-324.13 199.19,-323.23 190.38,-317.35 188.64,-324.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="293.75,-303.88 172,-303.88 172,-273.38 293.75,-273.38 293.75,-303.88"/>
-<text text-anchor="start" x="180" y="-290.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::insert</text>
-<text text-anchor="middle" x="232.88" y="-279.12" font-family="Helvetica,sans-Serif" font-size="10.00">_element</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.3,-288.62C138.11,-288.62 149.41,-288.62 160.43,-288.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.26,-292.13 170.26,-288.63 160.26,-285.13 160.26,-292.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="288.12,-255.25 177.62,-255.25 177.62,-236 288.12,-236 288.12,-255.25"/>
-<text text-anchor="middle" x="232.88" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.3,-272.49C145.26,-267.88 164.59,-262.91 181.68,-258.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.28,-261.98 191.09,-256.1 180.53,-255.2 182.28,-261.98"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="299,-389.88 166.75,-389.88 166.75,-359.38 299,-359.38 299,-389.88"/>
-<text text-anchor="start" x="174.75" y="-376.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::minmax</text>
-<text text-anchor="middle" x="232.88" y="-365.12" font-family="Helvetica,sans-Serif" font-size="10.00">_scaler</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.09,-309.74C113.14,-322.69 138.78,-338.97 163,-350.62 165.89,-352.01 168.88,-353.36 171.92,-354.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.42,-357.84 181.01,-358.35 173.05,-351.35 170.42,-357.84"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="281.75,-179.25 184,-179.25 184,-160 281.75,-160 281.75,-179.25"/>
-<text text-anchor="middle" x="232.88" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge20_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge20_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.66,-267.36C99.86,-246.07 130.42,-213.66 163,-193.62 169.31,-189.75 176.32,-186.39 183.4,-183.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.17,-186.96 192.31,-180.18 181.72,-180.41 184.17,-186.96"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="302.75,-142.25 163,-142.25 163,-123 302.75,-123 302.75,-142.25"/>
-<text text-anchor="middle" x="232.88" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node18 -->
-<g id="edge21_Node000001_Node000018" class="edge">
-<title>Node1&#45;&gt;Node18</title>
-<g id="a_edge21_Node000001_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.85,-267.31C88.4,-236.7 119.37,-180.68 163,-150.62 164.57,-149.54 166.21,-148.52 167.89,-147.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.11,-150.86 176.61,-143.38 166.08,-144.55 169.11,-150.86"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="289.62,-104.88 176.12,-104.88 176.12,-74.38 289.62,-74.38 289.62,-104.88"/>
-<text text-anchor="start" x="184.12" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop</text>
-<text text-anchor="middle" x="232.88" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node19 -->
-<g id="edge22_Node000001_Node000019" class="edge">
-<title>Node1&#45;&gt;Node19</title>
-<g id="a_edge22_Node000001_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.92,-267.34C83.02,-230.75 112.6,-155.8 163,-113.62 164.09,-112.71 165.22,-111.83 166.38,-110.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.89,-114.17 174.53,-105.91 164.19,-108.22 167.89,-114.17"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.75,-56.25 175,-56.25 175,-37 290.75,-37 290.75,-56.25"/>
-<text text-anchor="middle" x="232.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node20 -->
-<g id="edge23_Node000001_Node000020" class="edge">
-<title>Node1&#45;&gt;Node20</title>
-<g id="a_edge23_Node000001_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M67.67,-267.57C75.45,-223.31 99.72,-120.24 163,-65.62 164.45,-64.37 165.98,-63.2 167.57,-62.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.95,-65.35 175.93,-57.38 165.5,-59.25 168.95,-65.35"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260,-19.25 205.75,-19.25 205.75,0 260,0 260,-19.25"/>
-<text text-anchor="middle" x="232.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stod</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node21 -->
-<g id="edge24_Node000001_Node000021" class="edge">
-<title>Node1&#45;&gt;Node21</title>
-<g id="a_edge24_Node000001_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.09,-267.42C70.99,-217.74 90.28,-93.07 163,-27.62 171.68,-19.81 183.34,-15.31 194.59,-12.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.87,-16.26 204.1,-11.04 193.63,-9.37 194.87,-16.26"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge11_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge11_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M284.67,-390.31C290.89,-392.81 297.05,-395.59 302.75,-398.62 320.4,-408.03 320.12,-418.35 338.75,-425.62 387.68,-444.75 449.05,-447.31 487.73,-446.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="487.79,-450.09 497.69,-446.31 487.59,-443.09 487.79,-450.09"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node7 -->
-<g id="edge12_Node000011_Node000007" class="edge">
-<title>Node11&#45;&gt;Node7</title>
-<g id="a_edge12_Node000011_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M288.8,-358.93C293.72,-356.52 298.46,-353.76 302.75,-350.62 324.28,-334.89 315.53,-315.75 338.75,-302.62 385.48,-276.21 449.41,-275.95 488.98,-279.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="488.65,-282.58 498.93,-280.02 489.29,-275.61 488.65,-282.58"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="450,-341.88 338.75,-341.88 338.75,-311.38 450,-311.38 450,-341.88"/>
-<text text-anchor="start" x="346.75" y="-328.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="394.38" y="-317.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge13_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge13_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M286.1,-358.91C300.22,-354.66 315.65,-350.02 330.29,-345.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.29,-348.96 339.85,-342.73 329.27,-342.26 331.29,-348.96"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="421.5,-255.25 367.25,-255.25 367.25,-236 421.5,-236 421.5,-255.25"/>
-<text text-anchor="middle" x="394.38" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node14 -->
-<g id="edge17_Node000011_Node000014" class="edge">
-<title>Node11&#45;&gt;Node14</title>
-<g id="a_edge17_Node000011_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M291.28,-358.95C295.41,-356.55 299.3,-353.8 302.75,-350.62 331.74,-323.95 310.83,-297.42 338.75,-269.62 343.81,-264.59 350.1,-260.52 356.6,-257.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="357.67,-260.63 365.44,-253.42 354.87,-254.21 357.67,-260.63"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="420,-416.25 368.75,-416.25 368.75,-397 420,-397 420,-416.25"/>
-<text text-anchor="middle" x="394.38" y="-402.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node15 -->
-<g id="edge18_Node000011_Node000015" class="edge">
-<title>Node11&#45;&gt;Node15</title>
-<g id="a_edge18_Node000011_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.21,-387.73C319.06,-391.72 340.15,-395.95 357.32,-399.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="356.54,-402.81 367.04,-401.34 357.92,-395.94 356.54,-402.81"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="437.62,-379.25 351.12,-379.25 351.12,-360 437.62,-360 437.62,-379.25"/>
-<text text-anchor="middle" x="394.38" y="-365.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node16 -->
-<g id="edge19_Node000011_Node000016" class="edge">
-<title>Node11&#45;&gt;Node16</title>
-<g id="a_edge19_Node000011_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.21,-372.58C312.52,-372.16 326.37,-371.73 339.24,-371.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="339.33,-374.82 349.22,-371.01 339.11,-367.82 339.33,-374.82"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node5 -->
-<g id="edge14_Node000012_Node000005" class="edge">
-<title>Node12&#45;&gt;Node5</title>
-<g id="a_edge14_Node000012_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M436.87,-342.26C441.49,-344.75 445.97,-347.53 450,-350.62 477.11,-371.44 500.28,-404.01 513.49,-424.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="510.44,-426.55 518.67,-433.23 516.4,-422.88 510.44,-426.55"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node7 -->
-<g id="edge15_Node000012_Node000007" class="edge">
-<title>Node12&#45;&gt;Node7</title>
-<g id="a_edge15_Node000012_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M442.63,-310.98C458.24,-305.81 475.31,-300.16 489.87,-295.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="490.62,-298.78 499.01,-292.31 488.42,-292.13 490.62,-298.78"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="566.5,-336.25 486,-336.25 486,-317 566.5,-317 566.5,-336.25"/>
-<text text-anchor="middle" x="526.25" y="-322.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge16_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge16_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M450.45,-326.62C458.44,-326.62 466.64,-326.62 474.53,-326.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="474.32,-330.13 484.32,-326.63 474.32,-323.13 474.32,-330.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph_org.svg
deleted file mode 100644
index be05903fe..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a650c677fd6512665741ddd9b7983275d_cgraph_org.svg
+++ /dev/null
@@ -1,423 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::get_XY_from_csv Pages: 1 -->
-<svg width="575pt" height="599pt"
- viewBox="0.00 0.00 574.50 599.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 595.25)">
-<title>machine_learning::neural_network::NeuralNetwork::get_XY_from_csv</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-309.5 0,-309.5 0,-267.75 127,-267.75 127,-309.5"/>
-<text text-anchor="start" x="8" y="-296" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-284.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-273.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_XY_from_csv</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="277.62,-591.25 188.12,-591.25 188.12,-572 277.62,-572 277.62,-591.25"/>
-<text text-anchor="middle" x="232.88" y="-577.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M65.62,-309.79C69.53,-361.27 86.88,-493.94 163,-563.62 167.22,-567.49 172.17,-570.55 177.44,-572.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.87,-576.11 186.46,-576.32 178.32,-569.55 175.87,-576.11"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="276.5,-554.25 189.25,-554.25 189.25,-535 276.5,-535 276.5,-554.25"/>
-<text text-anchor="middle" x="232.88" y="-540.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::c_str</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.95,-309.72C73.5,-356.21 95.75,-468 163,-526.62 167.43,-530.49 172.59,-533.53 178.05,-535.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.81,-539.21 187.4,-539.3 179.17,-532.62 176.81,-539.21"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282.88,-517.25 182.88,-517.25 182.88,-498 282.88,-498 282.88,-517.25"/>
-<text text-anchor="middle" x="232.88" y="-503.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.54,-309.79C80.05,-349.5 108.07,-435.53 163,-483.62 167.07,-487.19 171.71,-490.24 176.6,-492.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.99,-495.94 185.53,-496.93 177.9,-489.58 174.99,-495.94"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="553,-454.25 499.5,-454.25 499.5,-435 553,-435 553,-454.25"/>
-<text text-anchor="middle" x="526.25" y="-440.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.65,-309.82C84.21,-343.36 113.7,-407.82 163,-436.62 267.45,-497.64 419.38,-471.51 488.52,-454.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="488.96,-458.22 497.81,-452.39 487.26,-451.43 488.96,-458.22"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ios/eof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278,-427.25 187.75,-427.25 187.75,-408 278,-408 278,-427.25"/>
-<text text-anchor="middle" x="232.88" y="-413.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::eof</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.84,-309.75C94.68,-334.69 125.96,-375.67 163,-398.62 167.27,-401.27 171.91,-403.55 176.69,-405.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.3,-408.74 185.9,-408.84 177.68,-402.16 175.3,-408.74"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="551.88,-293.25 500.62,-293.25 500.62,-274 551.88,-274 551.88,-293.25"/>
-<text text-anchor="middle" x="526.25" y="-279.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.3,-267.42C108.14,-252.79 135.43,-234.58 163,-226.62 285.56,-191.26 329.09,-186 450,-226.62 472.9,-234.32 494.38,-252.05 508.48,-265.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="505.66,-267.84 515.19,-272.49 510.64,-262.92 505.66,-267.84"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.88,-341.25 200.88,-341.25 200.88,-322 264.88,-322 264.88,-341.25"/>
-<text text-anchor="middle" x="232.88" y="-327.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.3,-304.76C148.14,-310.11 170.82,-315.94 189.72,-320.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.64,-324.13 199.19,-323.23 190.38,-317.35 188.64,-324.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="293.75,-303.88 172,-303.88 172,-273.38 293.75,-273.38 293.75,-303.88"/>
-<text text-anchor="start" x="180" y="-290.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::insert</text>
-<text text-anchor="middle" x="232.88" y="-279.12" font-family="Helvetica,sans-Serif" font-size="10.00">_element</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.3,-288.62C138.11,-288.62 149.41,-288.62 160.43,-288.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.26,-292.13 170.26,-288.63 160.26,-285.13 160.26,-292.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="288.12,-255.25 177.62,-255.25 177.62,-236 288.12,-236 288.12,-255.25"/>
-<text text-anchor="middle" x="232.88" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.3,-272.49C145.26,-267.88 164.59,-262.91 181.68,-258.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.28,-261.98 191.09,-256.1 180.53,-255.2 182.28,-261.98"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="299,-389.88 166.75,-389.88 166.75,-359.38 299,-359.38 299,-389.88"/>
-<text text-anchor="start" x="174.75" y="-376.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::minmax</text>
-<text text-anchor="middle" x="232.88" y="-365.12" font-family="Helvetica,sans-Serif" font-size="10.00">_scaler</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.09,-309.74C113.14,-322.69 138.78,-338.97 163,-350.62 165.89,-352.01 168.88,-353.36 171.92,-354.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.42,-357.84 181.01,-358.35 173.05,-351.35 170.42,-357.84"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="281.75,-179.25 184,-179.25 184,-160 281.75,-160 281.75,-179.25"/>
-<text text-anchor="middle" x="232.88" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ifstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge20_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge20_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.66,-267.36C99.86,-246.07 130.42,-213.66 163,-193.62 169.31,-189.75 176.32,-186.39 183.4,-183.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.17,-186.96 192.31,-180.18 181.72,-180.41 184.17,-186.96"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="302.75,-142.25 163,-142.25 163,-123 302.75,-123 302.75,-142.25"/>
-<text text-anchor="middle" x="232.88" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node18 -->
-<g id="edge21_Node000001_Node000018" class="edge">
-<title>Node1&#45;&gt;Node18</title>
-<g id="a_edge21_Node000001_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.85,-267.31C88.4,-236.7 119.37,-180.68 163,-150.62 164.57,-149.54 166.21,-148.52 167.89,-147.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.11,-150.86 176.61,-143.38 166.08,-144.55 169.11,-150.86"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="289.62,-104.88 176.12,-104.88 176.12,-74.38 289.62,-74.38 289.62,-104.88"/>
-<text text-anchor="start" x="184.12" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::pop</text>
-<text text-anchor="middle" x="232.88" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node19 -->
-<g id="edge22_Node000001_Node000019" class="edge">
-<title>Node1&#45;&gt;Node19</title>
-<g id="a_edge22_Node000001_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.92,-267.34C83.02,-230.75 112.6,-155.8 163,-113.62 164.09,-112.71 165.22,-111.83 166.38,-110.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.89,-114.17 174.53,-105.91 164.19,-108.22 167.89,-114.17"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.75,-56.25 175,-56.25 175,-37 290.75,-37 290.75,-56.25"/>
-<text text-anchor="middle" x="232.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node20 -->
-<g id="edge23_Node000001_Node000020" class="edge">
-<title>Node1&#45;&gt;Node20</title>
-<g id="a_edge23_Node000001_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M67.67,-267.57C75.45,-223.31 99.72,-120.24 163,-65.62 164.45,-64.37 165.98,-63.2 167.57,-62.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.95,-65.35 175.93,-57.38 165.5,-59.25 168.95,-65.35"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260,-19.25 205.75,-19.25 205.75,0 260,0 260,-19.25"/>
-<text text-anchor="middle" x="232.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stod</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node21 -->
-<g id="edge24_Node000001_Node000021" class="edge">
-<title>Node1&#45;&gt;Node21</title>
-<g id="a_edge24_Node000001_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.09,-267.42C70.99,-217.74 90.28,-93.07 163,-27.62 171.68,-19.81 183.34,-15.31 194.59,-12.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.87,-16.26 204.1,-11.04 193.63,-9.37 194.87,-16.26"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge11_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge11_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M284.67,-390.31C290.89,-392.81 297.05,-395.59 302.75,-398.62 320.4,-408.03 320.12,-418.35 338.75,-425.62 387.68,-444.75 449.05,-447.31 487.73,-446.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="487.79,-450.09 497.69,-446.31 487.59,-443.09 487.79,-450.09"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node7 -->
-<g id="edge12_Node000011_Node000007" class="edge">
-<title>Node11&#45;&gt;Node7</title>
-<g id="a_edge12_Node000011_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M288.8,-358.93C293.72,-356.52 298.46,-353.76 302.75,-350.62 324.28,-334.89 315.53,-315.75 338.75,-302.62 385.48,-276.21 449.41,-275.95 488.98,-279.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="488.65,-282.58 498.93,-280.02 489.29,-275.61 488.65,-282.58"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="450,-341.88 338.75,-341.88 338.75,-311.38 450,-311.38 450,-341.88"/>
-<text text-anchor="start" x="346.75" y="-328.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="394.38" y="-317.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge13_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge13_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M286.1,-358.91C300.22,-354.66 315.65,-350.02 330.29,-345.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.29,-348.96 339.85,-342.73 329.27,-342.26 331.29,-348.96"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="421.5,-255.25 367.25,-255.25 367.25,-236 421.5,-236 421.5,-255.25"/>
-<text text-anchor="middle" x="394.38" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node14 -->
-<g id="edge17_Node000011_Node000014" class="edge">
-<title>Node11&#45;&gt;Node14</title>
-<g id="a_edge17_Node000011_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M291.28,-358.95C295.41,-356.55 299.3,-353.8 302.75,-350.62 331.74,-323.95 310.83,-297.42 338.75,-269.62 343.81,-264.59 350.1,-260.52 356.6,-257.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="357.67,-260.63 365.44,-253.42 354.87,-254.21 357.67,-260.63"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="420,-416.25 368.75,-416.25 368.75,-397 420,-397 420,-416.25"/>
-<text text-anchor="middle" x="394.38" y="-402.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node15 -->
-<g id="edge18_Node000011_Node000015" class="edge">
-<title>Node11&#45;&gt;Node15</title>
-<g id="a_edge18_Node000011_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.21,-387.73C319.06,-391.72 340.15,-395.95 357.32,-399.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="356.54,-402.81 367.04,-401.34 357.92,-395.94 356.54,-402.81"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="437.62,-379.25 351.12,-379.25 351.12,-360 437.62,-360 437.62,-379.25"/>
-<text text-anchor="middle" x="394.38" y="-365.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node16 -->
-<g id="edge19_Node000011_Node000016" class="edge">
-<title>Node11&#45;&gt;Node16</title>
-<g id="a_edge19_Node000011_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.21,-372.58C312.52,-372.16 326.37,-371.73 339.24,-371.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="339.33,-374.82 349.22,-371.01 339.11,-367.82 339.33,-374.82"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node5 -->
-<g id="edge14_Node000012_Node000005" class="edge">
-<title>Node12&#45;&gt;Node5</title>
-<g id="a_edge14_Node000012_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M436.87,-342.26C441.49,-344.75 445.97,-347.53 450,-350.62 477.11,-371.44 500.28,-404.01 513.49,-424.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="510.44,-426.55 518.67,-433.23 516.4,-422.88 510.44,-426.55"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node7 -->
-<g id="edge15_Node000012_Node000007" class="edge">
-<title>Node12&#45;&gt;Node7</title>
-<g id="a_edge15_Node000012_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M442.63,-310.98C458.24,-305.81 475.31,-300.16 489.87,-295.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="490.62,-298.78 499.01,-292.31 488.42,-292.13 490.62,-298.78"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="566.5,-336.25 486,-336.25 486,-317 566.5,-317 566.5,-336.25"/>
-<text text-anchor="middle" x="526.25" y="-322.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge16_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge16_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M450.45,-326.62C458.44,-326.62 466.64,-326.62 474.53,-326.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="474.32,-330.13 484.32,-326.63 474.32,-323.13 474.32,-330.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph.map b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph.map
deleted file mode 100644
index 936121986..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph.map
+++ /dev/null
@@ -1,25 +0,0 @@
-<map id="machine_learning::neural_network::NeuralNetwork::batch_predict" name="machine_learning::neural_network::NeuralNetwork::batch_predict">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,175,111"/>
-<area shape="rect" id="Node000002" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f" title=" " alt="" coords="223,55,392,111"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="175,80,207,80,207,86,175,86"/>
-<area shape="rect" id="Node000003" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" title=" " alt="" coords="440,55,632,111"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="392,80,424,80,424,86,392,86"/>
-<area shape="rect" id="Node000004" href="$d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" title=" " alt="" coords="687,5,849,46"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="632,57,672,47,673,52,633,62"/>
-<area shape="rect" id="Node000005" 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="680,70,856,96"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="633,80,664,80,664,86,633,86"/>
-<area shape="rect" id="Node000006" href="$d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" title=" " alt="" coords="680,120,856,145"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="633,101,690,113,689,118,632,106"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="1124,37,1195,62"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="828,116,854,106,868,97,877,87,887,77,903,69,956,53,1011,45,1108,43,1108,48,1012,50,957,58,905,73,891,81,881,91,872,101,857,111,830,121"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="1126,144,1194,169"/>
-<area shape="poly" id="edge7_Node000006_Node000008" title=" " alt="" coords="856,135,1110,151,1110,156,856,140"/>
-<area shape="rect" id="Node000009" href="$d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" title=" " alt="" coords="907,83,1055,123"/>
-<area shape="poly" id="edge8_Node000006_Node000009" title=" " alt="" coords="856,118,891,113,892,118,856,123"/>
-<area shape="rect" id="Node000011" 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="904,198,1058,224"/>
-<area shape="poly" id="edge12_Node000006_Node000011" title=" " alt="" coords="806,143,931,190,929,195,804,148"/>
-<area shape="poly" id="edge9_Node000009_Node000007" title=" " alt="" coords="1051,80,1109,62,1110,67,1052,85"/>
-<area shape="poly" id="edge10_Node000009_Node000008" title=" " alt="" coords="1052,121,1111,139,1110,144,1051,126"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="1106,90,1213,116"/>
-<area shape="poly" id="edge11_Node000009_Node000010" title=" " alt="" coords="1055,100,1090,100,1090,106,1055,106"/>
-</map>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph.md5 b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph.md5
deleted file mode 100644
index e31923835..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0c068bff315bfbe9eb5d1ea27498d4ac
\ No newline at end of file
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph.svg
deleted file mode 100644
index 392746049..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph.svg
+++ /dev/null
@@ -1,310 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::batch_predict Pages: 1 -->
-<!--zoomable 172 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 914;
-var viewHeight = 172;
-var sectionId = 'dynsection-4';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>machine_learning::neural_network::NeuralNetwork::batch_predict</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-126.5 0,-126.5 0,-84.75 127,-84.75 127,-126.5"/>
-<text text-anchor="start" x="8" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-90.5" font-family="Helvetica,sans-Serif" font-size="10.00">::batch_predict</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290,-126.5 163,-126.5 163,-84.75 290,-84.75 290,-126.5"/>
-<text text-anchor="start" x="171" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="171" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="226.5" y="-90.5" font-family="Helvetica,sans-Serif" font-size="10.00">::single_predict</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.21,-105.62C135.13,-105.62 143.29,-105.62 151.37,-105.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.18,-109.13 161.18,-105.63 151.18,-102.13 151.18,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="470.25,-126.5 326,-126.5 326,-84.75 470.25,-84.75 470.25,-126.5"/>
-<text text-anchor="start" x="334" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="334" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="398.12" y="-90.5" font-family="Helvetica,sans-Serif" font-size="10.00">::__detailed_single_prediction</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.18,-105.62C298.01,-105.62 306.1,-105.62 314.18,-105.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.03,-109.13 324.03,-105.63 314.03,-102.13 314.03,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="632.5,-163.88 511.5,-163.88 511.5,-133.38 632.5,-133.38 632.5,-163.88"/>
-<text text-anchor="start" x="519.5" y="-150.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::apply</text>
-<text text-anchor="middle" x="572" y="-139.12" font-family="Helvetica,sans-Serif" font-size="10.00">_function</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.52,-123.49C480.31,-125.94 490.35,-128.45 500.12,-130.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="499,-134.22 509.55,-133.25 500.7,-127.43 499,-134.22"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="637.75,-115.25 506.25,-115.25 506.25,-96 637.75,-96 637.75,-115.25"/>
-<text text-anchor="middle" x="572" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.52,-105.62C478.39,-105.62 486.43,-105.62 494.36,-105.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="494.36,-109.13 504.36,-105.63 494.36,-102.13 494.36,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="637.75,-78.25 506.25,-78.25 506.25,-59 637.75,-59 637.75,-78.25"/>
-<text text-anchor="middle" x="572" y="-64.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.52,-90.26C484.65,-87.21 499.31,-84.06 512.92,-81.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="513.56,-84.57 522.6,-79.04 512.09,-77.73 513.56,-84.57"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="892.5,-140.25 839,-140.25 839,-121 892.5,-121 892.5,-140.25"/>
-<text text-anchor="middle" x="865.75" y="-126.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M618.09,-78.7C624.85,-80.91 631.6,-83.53 637.75,-86.62 655.86,-95.73 654.87,-107.25 673.75,-114.62 724.17,-134.32 787.64,-135.44 827.21,-133.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="827.38,-137.14 837.17,-133.1 826.99,-130.15 827.38,-137.14"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="891.38,-60.25 840.12,-60.25 840.12,-41 891.38,-41 891.38,-60.25"/>
-<text text-anchor="middle" x="865.75" y="-46.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M638.11,-64.61C696.79,-60.99 780.92,-55.8 828.45,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="828.42,-56.37 838.19,-52.26 827.99,-49.39 828.42,-56.37"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="787.25,-105.88 676,-105.88 676,-75.38 787.25,-75.38 787.25,-105.88"/>
-<text text-anchor="start" x="684" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="731.62" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge8_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge8_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M638.02,-77.7C646.75,-78.92 655.71,-80.17 664.46,-81.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="663.91,-84.85 674.29,-82.76 664.87,-77.91 663.91,-84.85"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="789.5,-19.25 673.75,-19.25 673.75,0 789.5,0 789.5,-19.25"/>
-<text text-anchor="middle" x="731.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge12_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge12_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M599.74,-58.62C625.44,-49 664.52,-34.37 693.28,-23.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="694.2,-27 702.34,-20.21 691.75,-20.44 694.2,-27"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge9_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge9_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M784.47,-106.32C799.04,-110.73 814.58,-115.44 828.07,-119.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="826.82,-122.8 837.4,-122.35 828.84,-116.1 826.82,-122.8"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node8 -->
-<g id="edge10_Node000009_Node000008" class="edge">
-<title>Node9&#45;&gt;Node8</title>
-<g id="a_edge10_Node000009_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M784.47,-74.93C799.38,-70.42 815.3,-65.6 829.01,-61.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="829.92,-64.83 838.47,-58.58 827.89,-58.13 829.92,-64.83"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="906,-100.25 825.5,-100.25 825.5,-81 906,-81 906,-100.25"/>
-<text text-anchor="middle" x="865.75" y="-86.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge11_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge11_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M787.51,-90.62C796.19,-90.62 805.13,-90.62 813.71,-90.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="813.62,-94.13 823.62,-90.63 813.62,-87.13 813.62,-94.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph_org.svg
deleted file mode 100644
index 07e562e8c..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_a88bf9023ab3d4cdb61cf707c7cdfc86b_cgraph_org.svg
+++ /dev/null
@@ -1,227 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::batch_predict Pages: 1 -->
-<svg width="914pt" height="172pt"
- viewBox="0.00 0.00 914.00 171.88" 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 167.88)">
-<title>machine_learning::neural_network::NeuralNetwork::batch_predict</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-126.5 0,-126.5 0,-84.75 127,-84.75 127,-126.5"/>
-<text text-anchor="start" x="8" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-90.5" font-family="Helvetica,sans-Serif" font-size="10.00">::batch_predict</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290,-126.5 163,-126.5 163,-84.75 290,-84.75 290,-126.5"/>
-<text text-anchor="start" x="171" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="171" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="226.5" y="-90.5" font-family="Helvetica,sans-Serif" font-size="10.00">::single_predict</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.21,-105.62C135.13,-105.62 143.29,-105.62 151.37,-105.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.18,-109.13 161.18,-105.63 151.18,-102.13 151.18,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="470.25,-126.5 326,-126.5 326,-84.75 470.25,-84.75 470.25,-126.5"/>
-<text text-anchor="start" x="334" y="-113" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="334" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="398.12" y="-90.5" font-family="Helvetica,sans-Serif" font-size="10.00">::__detailed_single_prediction</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.18,-105.62C298.01,-105.62 306.1,-105.62 314.18,-105.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.03,-109.13 324.03,-105.63 314.03,-102.13 314.03,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="632.5,-163.88 511.5,-163.88 511.5,-133.38 632.5,-133.38 632.5,-163.88"/>
-<text text-anchor="start" x="519.5" y="-150.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::apply</text>
-<text text-anchor="middle" x="572" y="-139.12" font-family="Helvetica,sans-Serif" font-size="10.00">_function</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.52,-123.49C480.31,-125.94 490.35,-128.45 500.12,-130.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="499,-134.22 509.55,-133.25 500.7,-127.43 499,-134.22"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="637.75,-115.25 506.25,-115.25 506.25,-96 637.75,-96 637.75,-115.25"/>
-<text text-anchor="middle" x="572" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.52,-105.62C478.39,-105.62 486.43,-105.62 494.36,-105.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="494.36,-109.13 504.36,-105.63 494.36,-102.13 494.36,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="637.75,-78.25 506.25,-78.25 506.25,-59 637.75,-59 637.75,-78.25"/>
-<text text-anchor="middle" x="572" y="-64.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.52,-90.26C484.65,-87.21 499.31,-84.06 512.92,-81.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="513.56,-84.57 522.6,-79.04 512.09,-77.73 513.56,-84.57"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="892.5,-140.25 839,-140.25 839,-121 892.5,-121 892.5,-140.25"/>
-<text text-anchor="middle" x="865.75" y="-126.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M618.09,-78.7C624.85,-80.91 631.6,-83.53 637.75,-86.62 655.86,-95.73 654.87,-107.25 673.75,-114.62 724.17,-134.32 787.64,-135.44 827.21,-133.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="827.38,-137.14 837.17,-133.1 826.99,-130.15 827.38,-137.14"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="891.38,-60.25 840.12,-60.25 840.12,-41 891.38,-41 891.38,-60.25"/>
-<text text-anchor="middle" x="865.75" y="-46.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M638.11,-64.61C696.79,-60.99 780.92,-55.8 828.45,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="828.42,-56.37 838.19,-52.26 827.99,-49.39 828.42,-56.37"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="787.25,-105.88 676,-105.88 676,-75.38 787.25,-75.38 787.25,-105.88"/>
-<text text-anchor="start" x="684" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="731.62" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge8_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge8_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M638.02,-77.7C646.75,-78.92 655.71,-80.17 664.46,-81.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="663.91,-84.85 674.29,-82.76 664.87,-77.91 663.91,-84.85"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="789.5,-19.25 673.75,-19.25 673.75,0 789.5,0 789.5,-19.25"/>
-<text text-anchor="middle" x="731.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge12_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge12_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M599.74,-58.62C625.44,-49 664.52,-34.37 693.28,-23.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="694.2,-27 702.34,-20.21 691.75,-20.44 694.2,-27"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge9_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge9_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M784.47,-106.32C799.04,-110.73 814.58,-115.44 828.07,-119.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="826.82,-122.8 837.4,-122.35 828.84,-116.1 826.82,-122.8"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node8 -->
-<g id="edge10_Node000009_Node000008" class="edge">
-<title>Node9&#45;&gt;Node8</title>
-<g id="a_edge10_Node000009_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M784.47,-74.93C799.38,-70.42 815.3,-65.6 829.01,-61.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="829.92,-64.83 838.47,-58.58 827.89,-58.13 829.92,-64.83"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="906,-100.25 825.5,-100.25 825.5,-81 906,-81 906,-100.25"/>
-<text text-anchor="middle" x="865.75" y="-86.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge11_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge11_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M787.51,-90.62C796.19,-90.62 805.13,-90.62 813.71,-90.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="813.62,-94.13 823.62,-90.63 813.62,-87.13 813.62,-94.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph.map b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph.map
deleted file mode 100644
index e4dff5019..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph.map
+++ /dev/null
@@ -1,42 +0,0 @@
-<map id="machine_learning::neural_network::NeuralNetwork::evaluate" name="machine_learning::neural_network::NeuralNetwork::evaluate">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,306,175,362"/>
-<area shape="rect" id="Node000002" href="$d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" title=" " alt="" coords="687,150,849,190"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="112,304,159,258,189,235,222,217,279,196,339,180,399,169,460,162,575,156,672,159,671,164,575,162,461,167,400,174,340,186,280,201,224,222,192,239,162,262,116,308"/>
-<area shape="rect" id="Node000003" href="$d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec" title=" " alt="" coords="681,321,855,347"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="175,332,666,332,666,337,175,337"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="1124,345,1195,371"/>
-<area shape="poly" id="edge13_Node000001_Node000007" title=" " alt="" coords="128,360,199,410,297,467,353,492,412,513,473,526,535,532,769,532,854,533,920,530,951,525,983,516,1057,480,1084,459,1108,434,1142,384,1146,387,1112,437,1088,463,1059,484,985,521,952,530,921,536,854,538,769,537,535,537,472,532,411,518,351,497,294,471,196,415,125,365"/>
-<area shape="rect" id="Node000012" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f" title=" " alt="" coords="223,232,392,287"/>
-<area shape="poly" id="edge14_Node000001_Node000012" title=" " alt="" coords="172,303,209,290,211,295,174,308"/>
-<area shape="rect" id="Node000017" href="$d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" title=" " alt="" coords="230,572,385,598"/>
-<area shape="poly" id="edge23_Node000001_Node000017" title=" " alt="" coords="104,361,121,403,147,454,182,506,224,551,243,563,240,567,221,555,177,509,143,456,116,405,99,363"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="942,321,1020,347"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="855,332,926,332,926,337,855,337"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/distance.html#" title=" " alt="" coords="933,371,1029,396"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="827,345,918,366,917,371,826,350"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="947,420,1015,446"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="791,345,842,375,905,406,933,417,931,422,903,411,840,380,789,350"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="780,346,800,371,828,402,864,433,905,456,946,470,981,475,1016,470,1057,456,1082,442,1105,423,1139,382,1144,386,1109,427,1085,446,1059,461,1017,475,981,480,945,475,903,461,861,437,824,406,796,374,776,349"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="1126,107,1194,132"/>
-<area shape="poly" id="edge7_Node000003_Node000008" title=" " alt="" coords="827,319,854,300,867,281,874,261,875,221,877,181,885,161,902,143,926,127,952,116,1007,104,1063,102,1111,107,1110,112,1062,108,1008,109,953,121,928,132,905,147,890,164,882,182,880,221,879,262,872,283,858,304,830,323"/>
-<area shape="rect" id="Node000009" href="$d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" title=" " alt="" coords="907,156,1055,197"/>
-<area shape="poly" id="edge8_Node000003_Node000009" title=" " alt="" coords="816,318,854,300,898,261,949,207,953,210,902,264,857,304,818,323"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max_element.html#" title=" " alt="" coords="918,272,1044,298"/>
-<area shape="poly" id="edge12_Node000003_Node000011" title=" " alt="" coords="826,318,907,299,908,304,827,323"/>
-<area shape="poly" id="edge9_Node000009_Node000007" title=" " alt="" coords="1033,195,1060,213,1087,242,1112,273,1147,330,1142,333,1107,276,1083,245,1056,218,1030,200"/>
-<area shape="poly" id="edge10_Node000009_Node000008" title=" " alt="" coords="1045,153,1110,132,1112,138,1047,159"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="1106,164,1213,190"/>
-<area shape="poly" id="edge11_Node000009_Node000010" title=" " alt="" coords="1055,174,1090,174,1090,180,1055,180"/>
-<area shape="rect" id="Node000013" href="$d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" title=" " alt="" coords="440,232,632,287"/>
-<area shape="poly" id="edge15_Node000012_Node000013" title=" " alt="" coords="392,257,424,257,424,262,392,262"/>
-<area shape="poly" id="edge16_Node000013_Node000002" title=" " alt="" coords="606,229,679,200,694,194,696,199,681,205,608,234"/>
-<area shape="rect" id="Node000014" 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="680,264,856,290"/>
-<area shape="poly" id="edge17_Node000013_Node000014" title=" " alt="" coords="633,264,665,266,665,272,632,269"/>
-<area shape="rect" id="Node000015" href="$d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" title=" " alt="" coords="680,215,856,240"/>
-<area shape="poly" id="edge18_Node000013_Node000015" title=" " alt="" coords="632,244,664,239,665,244,633,249"/>
-<area shape="poly" id="edge19_Node000015_Node000007" title=" " alt="" coords="856,220,904,221,956,227,1009,239,1059,257,1085,273,1108,292,1143,331,1139,335,1104,296,1082,277,1057,262,1007,244,955,232,904,227,856,225"/>
-<area shape="poly" id="edge20_Node000015_Node000008" title=" " alt="" coords="835,212,854,200,865,188,871,176,875,149,881,122,889,110,902,99,928,86,955,79,1012,76,1067,85,1113,98,1112,103,1065,90,1011,81,956,84,930,91,905,103,893,113,886,124,881,150,876,177,869,191,857,204,838,216"/>
-<area shape="poly" id="edge21_Node000015_Node000009" title=" " alt="" coords="824,211,891,195,892,201,826,217"/>
-<area shape="rect" id="Node000016" 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="904,5,1058,31"/>
-<area shape="poly" id="edge22_Node000015_Node000016" title=" " alt="" coords="837,212,854,200,868,182,875,164,878,127,881,89,888,68,902,48,915,37,919,41,906,52,892,71,886,90,883,127,880,165,873,185,858,204,840,216"/>
-</map>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph.md5 b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph.md5
deleted file mode 100644
index b5cd3bfa7..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-833b076a5fea53e2bc57a4235724ac49
\ No newline at end of file
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph.svg
deleted file mode 100644
index ae588bb56..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph.svg
+++ /dev/null
@@ -1,463 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::evaluate Pages: 1 -->
-<!--zoomable 452 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 914;
-var viewHeight = 452;
-var sectionId = 'dynsection-5';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>machine_learning::neural_network::NeuralNetwork::evaluate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-218.5 0,-218.5 0,-176.75 127,-176.75 127,-218.5"/>
-<text text-anchor="start" x="8" y="-205" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-193.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-182.5" font-family="Helvetica,sans-Serif" font-size="10.00">::evaluate</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="632.5,-335.88 511.5,-335.88 511.5,-305.38 632.5,-305.38 632.5,-335.88"/>
-<text text-anchor="start" x="519.5" y="-322.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::apply</text>
-<text text-anchor="middle" x="572" y="-311.12" font-family="Helvetica,sans-Serif" font-size="10.00">_function</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.58,-218.81C99.48,-239.32 129.6,-269.34 163,-283.62 273.39,-330.83 415.61,-331.87 499.67,-327.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="499.86,-330.6 509.63,-326.49 499.43,-323.61 499.86,-330.6"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="637,-207.25 507,-207.25 507,-188 637,-188 637,-207.25"/>
-<text text-anchor="middle" x="572" y="-193.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::argmax</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.37,-197.62C220.61,-197.62 395.28,-197.62 495.37,-197.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.09,-201.13 505.09,-197.63 495.09,-194.13 495.09,-201.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="892.5,-189.25 839,-189.25 839,-170 892.5,-170 892.5,-189.25"/>
-<text text-anchor="middle" x="865.75" y="-175.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge13_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge13_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.7,-176.45C144.6,-135.1 273.28,-47.62 397.12,-47.62 397.12,-47.62 397.12,-47.62 573,-47.62 670.77,-47.62 705.36,-36.83 789.5,-86.62 819.03,-104.1 841.78,-137.75 854.21,-159.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="851.14,-161.1 859.02,-168.19 857.28,-157.74 851.14,-161.1"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290,-274.5 163,-274.5 163,-232.75 290,-232.75 290,-274.5"/>
-<text text-anchor="start" x="171" y="-261" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="171" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="226.5" y="-238.5" font-family="Helvetica,sans-Serif" font-size="10.00">::single_predict</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge14_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge14_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.83,-218.96C134.83,-222.09 144.18,-225.34 153.38,-228.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.05,-231.78 162.65,-231.76 154.35,-225.17 152.05,-231.78"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="284.75,-19.25 168.25,-19.25 168.25,0 284.75,0 284.75,-19.25"/>
-<text text-anchor="middle" x="226.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge23_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge23_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.95,-176.45C85.13,-141.92 115.68,-73.34 163,-33.62 167.18,-30.12 171.92,-27.09 176.88,-24.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.27,-27.7 185.89,-20.35 175.35,-21.34 178.27,-27.7"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="761,-207.25 702.25,-207.25 702.25,-188 761,-188 761,-207.25"/>
-<text text-anchor="middle" x="731.62" y="-193.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M637.11,-197.62C655.22,-197.62 674.4,-197.62 690.64,-197.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="690.38,-201.13 700.38,-197.63 690.38,-194.13 690.38,-201.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="767.75,-170.25 695.5,-170.25 695.5,-151 767.75,-151 767.75,-170.25"/>
-<text text-anchor="middle" x="731.62" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M616.07,-187.51C637.09,-182.58 662.41,-176.64 683.89,-171.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="684.65,-175.01 693.58,-169.32 683.05,-168.2 684.65,-175.01"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="757.25,-133.25 706,-133.25 706,-114 757.25,-114 757.25,-133.25"/>
-<text text-anchor="middle" x="731.62" y="-119.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M588.55,-187.68C607.93,-175.6 642.32,-155.17 673.75,-141.62 680.43,-138.75 687.72,-136.09 694.79,-133.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="695.66,-137.15 704.15,-130.82 693.56,-130.48 695.66,-137.15"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M579.63,-187.8C593.96,-167.57 630.08,-121.7 673.75,-104.62 721.66,-85.89 741.96,-84.98 789.5,-104.62 816.56,-115.81 838.99,-141.96 852.13,-160.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="849.2,-162.13 857.75,-168.39 854.97,-158.17 849.2,-162.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="891.38,-368.25 840.12,-368.25 840.12,-349 891.38,-349 891.38,-368.25"/>
-<text text-anchor="middle" x="865.75" y="-354.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M617.09,-207.7C624.76,-211.09 632.08,-215.61 637.75,-221.62 675.36,-261.52 631.35,-304.85 673.75,-339.62 717.32,-375.36 786.67,-372.18 828.73,-365.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="829.03,-369.39 838.33,-364.32 827.9,-362.49 829.03,-369.39"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="787.25,-330.88 676,-330.88 676,-300.38 787.25,-300.38 787.25,-330.88"/>
-<text text-anchor="start" x="684" y="-317.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="731.62" y="-306.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M608.6,-207.67C618.47,-211.28 628.89,-215.9 637.75,-221.62 653.54,-231.82 687.17,-267.48 709.33,-291.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="706.61,-294.03 715.91,-299.09 711.8,-289.33 706.61,-294.03"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="778.62,-244.25 684.62,-244.25 684.62,-225 778.62,-225 778.62,-244.25"/>
-<text text-anchor="middle" x="731.62" y="-230.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node11 -->
-<g id="edge12_Node000003_Node000011" class="edge">
-<title>Node3&#45;&gt;Node11</title>
-<g id="a_edge12_Node000003_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M616.07,-207.74C634.75,-212.12 656.83,-217.3 676.59,-221.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="675.6,-225.3 686.13,-224.18 677.2,-218.49 675.6,-225.3"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge9_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge9_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M769.79,-300C776.73,-296.18 783.64,-291.71 789.5,-286.62 818.39,-261.55 841.84,-223.15 854.5,-199.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="857.56,-201.51 859.12,-191.03 851.37,-198.25 857.56,-201.51"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node8 -->
-<g id="edge10_Node000009_Node000008" class="edge">
-<title>Node9&#45;&gt;Node8</title>
-<g id="a_edge10_Node000009_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M780.7,-331.27C796.69,-336.48 814.21,-342.18 829.09,-347.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="827.86,-350.3 838.45,-350.07 830.02,-343.64 827.86,-350.3"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="906,-325.25 825.5,-325.25 825.5,-306 906,-306 906,-325.25"/>
-<text text-anchor="middle" x="865.75" y="-311.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge11_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge11_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M787.51,-315.62C796.19,-315.62 805.13,-315.62 813.71,-315.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="813.62,-319.13 823.62,-315.63 813.62,-312.13 813.62,-319.13"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="470.25,-274.5 326,-274.5 326,-232.75 470.25,-232.75 470.25,-274.5"/>
-<text text-anchor="start" x="334" y="-261" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="334" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="398.12" y="-238.5" font-family="Helvetica,sans-Serif" font-size="10.00">::__detailed_single_prediction</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge15_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge15_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.18,-253.62C298.01,-253.62 306.1,-253.62 314.18,-253.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.03,-257.13 324.03,-253.63 314.03,-250.13 314.03,-257.13"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node2 -->
-<g id="edge16_Node000013_Node000002" class="edge">
-<title>Node13&#45;&gt;Node2</title>
-<g id="a_edge16_Node000013_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M451.32,-274.9C468.75,-281.92 488.3,-289.7 506.25,-296.62 509.88,-298.03 513.64,-299.46 517.42,-300.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="516.09,-304.13 526.68,-304.37 518.55,-297.58 516.09,-304.13"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="637.75,-250.25 506.25,-250.25 506.25,-231 637.75,-231 637.75,-250.25"/>
-<text text-anchor="middle" x="572" y="-236.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge17_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge17_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.52,-248.22C478.48,-247.62 486.62,-247.01 494.64,-246.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="494.65,-249.91 504.36,-245.67 494.13,-242.93 494.65,-249.91"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="637.75,-287.25 506.25,-287.25 506.25,-268 637.75,-268 637.75,-287.25"/>
-<text text-anchor="middle" x="572" y="-273.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node15 -->
-<g id="edge18_Node000013_Node000015" class="edge">
-<title>Node13&#45;&gt;Node15</title>
-<g id="a_edge18_Node000013_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.52,-263.59C478.48,-264.71 486.62,-265.84 494.64,-266.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="493.98,-270.4 504.37,-268.32 494.95,-263.47 493.98,-270.4"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node7 -->
-<g id="edge19_Node000015_Node000007" class="edge">
-<title>Node15&#45;&gt;Node7</title>
-<g id="a_edge19_Node000015_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M638.06,-281.31C682.71,-281.29 742.2,-276.11 789.5,-253.62 815.61,-241.21 838.12,-215.99 851.55,-198.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="854.03,-201 857.14,-190.87 848.4,-196.84 854.03,-201"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node8 -->
-<g id="edge20_Node000015_Node000008" class="edge">
-<title>Node15&#45;&gt;Node8</title>
-<g id="a_edge20_Node000015_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M623.31,-287.64C628.53,-290.02 633.47,-292.97 637.75,-296.62 666.17,-320.9 642.17,-352.64 673.75,-372.62 721.39,-402.77 789.71,-386.84 830.42,-372.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="831.52,-375.97 839.71,-369.25 829.11,-369.4 831.52,-375.97"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node9 -->
-<g id="edge21_Node000015_Node000009" class="edge">
-<title>Node15&#45;&gt;Node9</title>
-<g id="a_edge21_Node000015_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M614.83,-287.71C630.09,-291.39 647.75,-295.64 664.6,-299.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="663.51,-303.05 674.06,-301.99 665.15,-296.24 663.51,-303.05"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="789.5,-444.25 673.75,-444.25 673.75,-425 789.5,-425 789.5,-444.25"/>
-<text text-anchor="middle" x="731.62" y="-430.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge22_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge22_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M625.09,-287.71C629.74,-290.09 634.07,-293.02 637.75,-296.62 675.7,-333.81 637.97,-371.34 673.75,-410.62 676.63,-413.78 679.98,-416.54 683.6,-418.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="681.88,-421.99 692.33,-423.78 685.28,-415.87 681.88,-421.99"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph_org.svg b/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph_org.svg
deleted file mode 100644
index 18af33906..000000000
--- a/d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network_aec648ea4f40bd71123b5f907a681dd8e_cgraph_org.svg
+++ /dev/null
@@ -1,380 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::NeuralNetwork::evaluate Pages: 1 -->
-<svg width="914pt" height="452pt"
- viewBox="0.00 0.00 914.00 452.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 448.25)">
-<title>machine_learning::neural_network::NeuralNetwork::evaluate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-218.5 0,-218.5 0,-176.75 127,-176.75 127,-218.5"/>
-<text text-anchor="start" x="8" y="-205" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-193.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="63.5" y="-182.5" font-family="Helvetica,sans-Serif" font-size="10.00">::evaluate</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="632.5,-335.88 511.5,-335.88 511.5,-305.38 632.5,-305.38 632.5,-335.88"/>
-<text text-anchor="start" x="519.5" y="-322.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::apply</text>
-<text text-anchor="middle" x="572" y="-311.12" font-family="Helvetica,sans-Serif" font-size="10.00">_function</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.58,-218.81C99.48,-239.32 129.6,-269.34 163,-283.62 273.39,-330.83 415.61,-331.87 499.67,-327.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="499.86,-330.6 509.63,-326.49 499.43,-323.61 499.86,-330.6"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="637,-207.25 507,-207.25 507,-188 637,-188 637,-207.25"/>
-<text text-anchor="middle" x="572" y="-193.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::argmax</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.37,-197.62C220.61,-197.62 395.28,-197.62 495.37,-197.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.09,-201.13 505.09,-197.63 495.09,-194.13 495.09,-201.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="892.5,-189.25 839,-189.25 839,-170 892.5,-170 892.5,-189.25"/>
-<text text-anchor="middle" x="865.75" y="-175.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge13_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge13_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.7,-176.45C144.6,-135.1 273.28,-47.62 397.12,-47.62 397.12,-47.62 397.12,-47.62 573,-47.62 670.77,-47.62 705.36,-36.83 789.5,-86.62 819.03,-104.1 841.78,-137.75 854.21,-159.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="851.14,-161.1 859.02,-168.19 857.28,-157.74 851.14,-161.1"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290,-274.5 163,-274.5 163,-232.75 290,-232.75 290,-274.5"/>
-<text text-anchor="start" x="171" y="-261" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="171" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="226.5" y="-238.5" font-family="Helvetica,sans-Serif" font-size="10.00">::single_predict</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge14_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge14_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.83,-218.96C134.83,-222.09 144.18,-225.34 153.38,-228.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.05,-231.78 162.65,-231.76 154.35,-225.17 152.05,-231.78"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="284.75,-19.25 168.25,-19.25 168.25,0 284.75,0 284.75,-19.25"/>
-<text text-anchor="middle" x="226.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge23_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge23_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.95,-176.45C85.13,-141.92 115.68,-73.34 163,-33.62 167.18,-30.12 171.92,-27.09 176.88,-24.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.27,-27.7 185.89,-20.35 175.35,-21.34 178.27,-27.7"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="761,-207.25 702.25,-207.25 702.25,-188 761,-188 761,-207.25"/>
-<text text-anchor="middle" x="731.62" y="-193.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M637.11,-197.62C655.22,-197.62 674.4,-197.62 690.64,-197.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="690.38,-201.13 700.38,-197.63 690.38,-194.13 690.38,-201.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="767.75,-170.25 695.5,-170.25 695.5,-151 767.75,-151 767.75,-170.25"/>
-<text text-anchor="middle" x="731.62" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M616.07,-187.51C637.09,-182.58 662.41,-176.64 683.89,-171.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="684.65,-175.01 693.58,-169.32 683.05,-168.2 684.65,-175.01"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="757.25,-133.25 706,-133.25 706,-114 757.25,-114 757.25,-133.25"/>
-<text text-anchor="middle" x="731.62" y="-119.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M588.55,-187.68C607.93,-175.6 642.32,-155.17 673.75,-141.62 680.43,-138.75 687.72,-136.09 694.79,-133.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="695.66,-137.15 704.15,-130.82 693.56,-130.48 695.66,-137.15"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M579.63,-187.8C593.96,-167.57 630.08,-121.7 673.75,-104.62 721.66,-85.89 741.96,-84.98 789.5,-104.62 816.56,-115.81 838.99,-141.96 852.13,-160.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="849.2,-162.13 857.75,-168.39 854.97,-158.17 849.2,-162.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="891.38,-368.25 840.12,-368.25 840.12,-349 891.38,-349 891.38,-368.25"/>
-<text text-anchor="middle" x="865.75" y="-354.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M617.09,-207.7C624.76,-211.09 632.08,-215.61 637.75,-221.62 675.36,-261.52 631.35,-304.85 673.75,-339.62 717.32,-375.36 786.67,-372.18 828.73,-365.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="829.03,-369.39 838.33,-364.32 827.9,-362.49 829.03,-369.39"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="787.25,-330.88 676,-330.88 676,-300.38 787.25,-300.38 787.25,-330.88"/>
-<text text-anchor="start" x="684" y="-317.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="731.62" y="-306.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M608.6,-207.67C618.47,-211.28 628.89,-215.9 637.75,-221.62 653.54,-231.82 687.17,-267.48 709.33,-291.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="706.61,-294.03 715.91,-299.09 711.8,-289.33 706.61,-294.03"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="778.62,-244.25 684.62,-244.25 684.62,-225 778.62,-225 778.62,-244.25"/>
-<text text-anchor="middle" x="731.62" y="-230.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node11 -->
-<g id="edge12_Node000003_Node000011" class="edge">
-<title>Node3&#45;&gt;Node11</title>
-<g id="a_edge12_Node000003_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M616.07,-207.74C634.75,-212.12 656.83,-217.3 676.59,-221.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="675.6,-225.3 686.13,-224.18 677.2,-218.49 675.6,-225.3"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge9_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge9_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M769.79,-300C776.73,-296.18 783.64,-291.71 789.5,-286.62 818.39,-261.55 841.84,-223.15 854.5,-199.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="857.56,-201.51 859.12,-191.03 851.37,-198.25 857.56,-201.51"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node8 -->
-<g id="edge10_Node000009_Node000008" class="edge">
-<title>Node9&#45;&gt;Node8</title>
-<g id="a_edge10_Node000009_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M780.7,-331.27C796.69,-336.48 814.21,-342.18 829.09,-347.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="827.86,-350.3 838.45,-350.07 830.02,-343.64 827.86,-350.3"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="906,-325.25 825.5,-325.25 825.5,-306 906,-306 906,-325.25"/>
-<text text-anchor="middle" x="865.75" y="-311.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge11_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge11_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M787.51,-315.62C796.19,-315.62 805.13,-315.62 813.71,-315.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="813.62,-319.13 823.62,-315.63 813.62,-312.13 813.62,-319.13"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="470.25,-274.5 326,-274.5 326,-232.75 470.25,-232.75 470.25,-274.5"/>
-<text text-anchor="start" x="334" y="-261" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="334" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::NeuralNetwork</text>
-<text text-anchor="middle" x="398.12" y="-238.5" font-family="Helvetica,sans-Serif" font-size="10.00">::__detailed_single_prediction</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge15_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge15_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.18,-253.62C298.01,-253.62 306.1,-253.62 314.18,-253.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.03,-257.13 324.03,-253.63 314.03,-250.13 314.03,-257.13"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node2 -->
-<g id="edge16_Node000013_Node000002" class="edge">
-<title>Node13&#45;&gt;Node2</title>
-<g id="a_edge16_Node000013_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M451.32,-274.9C468.75,-281.92 488.3,-289.7 506.25,-296.62 509.88,-298.03 513.64,-299.46 517.42,-300.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="516.09,-304.13 526.68,-304.37 518.55,-297.58 516.09,-304.13"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="637.75,-250.25 506.25,-250.25 506.25,-231 637.75,-231 637.75,-250.25"/>
-<text text-anchor="middle" x="572" y="-236.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge17_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge17_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.52,-248.22C478.48,-247.62 486.62,-247.01 494.64,-246.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="494.65,-249.91 504.36,-245.67 494.13,-242.93 494.65,-249.91"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="637.75,-287.25 506.25,-287.25 506.25,-268 637.75,-268 637.75,-287.25"/>
-<text text-anchor="middle" x="572" y="-273.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node15 -->
-<g id="edge18_Node000013_Node000015" class="edge">
-<title>Node13&#45;&gt;Node15</title>
-<g id="a_edge18_Node000013_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.52,-263.59C478.48,-264.71 486.62,-265.84 494.64,-266.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="493.98,-270.4 504.37,-268.32 494.95,-263.47 493.98,-270.4"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node7 -->
-<g id="edge19_Node000015_Node000007" class="edge">
-<title>Node15&#45;&gt;Node7</title>
-<g id="a_edge19_Node000015_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M638.06,-281.31C682.71,-281.29 742.2,-276.11 789.5,-253.62 815.61,-241.21 838.12,-215.99 851.55,-198.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="854.03,-201 857.14,-190.87 848.4,-196.84 854.03,-201"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node8 -->
-<g id="edge20_Node000015_Node000008" class="edge">
-<title>Node15&#45;&gt;Node8</title>
-<g id="a_edge20_Node000015_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M623.31,-287.64C628.53,-290.02 633.47,-292.97 637.75,-296.62 666.17,-320.9 642.17,-352.64 673.75,-372.62 721.39,-402.77 789.71,-386.84 830.42,-372.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="831.52,-375.97 839.71,-369.25 829.11,-369.4 831.52,-375.97"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node9 -->
-<g id="edge21_Node000015_Node000009" class="edge">
-<title>Node15&#45;&gt;Node9</title>
-<g id="a_edge21_Node000015_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M614.83,-287.71C630.09,-291.39 647.75,-295.64 664.6,-299.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="663.51,-303.05 674.06,-301.99 665.15,-296.24 663.51,-303.05"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="789.5,-444.25 673.75,-444.25 673.75,-425 789.5,-425 789.5,-444.25"/>
-<text text-anchor="middle" x="731.62" y="-430.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge22_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge22_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M625.09,-287.71C629.74,-290.09 634.07,-293.02 637.75,-296.62 675.7,-333.81 637.97,-371.34 673.75,-410.62 676.63,-413.78 679.98,-416.54 683.6,-418.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="681.88,-421.99 692.33,-423.78 685.28,-415.87 681.88,-421.99"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d4/dfb/namespacecycle__sort.html b/d4/dfb/namespacecycle__sort.html
index 3b1b44a6b..4842a6095 100644
--- a/d4/dfb/namespacecycle__sort.html
+++ b/d4/dfb/namespacecycle__sort.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: cycle_sort Namespace Reference</title>
+<title>TheAlgorithms/C++: cycle_sort Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d5/d02/namespacehorspool.html b/d5/d02/namespacehorspool.html
index d6c1a2ab8..44eb0a80d 100644
--- a/d5/d02/namespacehorspool.html
+++ b/d5/d02/namespacehorspool.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: horspool Namespace Reference</title>
+<title>TheAlgorithms/C++: horspool Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d5/d08/classgraph_1_1_graph__coll__graph.map b/d5/d08/classgraph_1_1_graph__coll__graph.map
index 133087bf7..dfb582bf4 100644
--- a/d5/d08/classgraph_1_1_graph__coll__graph.map
+++ b/d5/d08/classgraph_1_1_graph__coll__graph.map
@@ -1,9 +1,9 @@
 <map id="graph::Graph&lt; T &gt;" name="graph::Graph&lt; T &gt;">
 <area shape="rect" id="Node000001" title=" " alt="" coords="126,213,255,238"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/map.html" title=" " alt="" coords="5,109,147,150"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,109,147,150"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="99,161,123,187,161,210,159,214,119,191,95,164"/>
 <area shape="rect" id="Node000003" title=" " alt="" coords="57,5,95,31"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="79,47,79,109,73,109,73,47"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="171,109,328,150"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="171,109,328,150"/>
 <area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="231,164,200,214,196,211,227,162"/>
 </map>
diff --git a/d5/d08/classgraph_1_1_graph__coll__graph.md5 b/d5/d08/classgraph_1_1_graph__coll__graph.md5
index aadbb436c..36e6d11e8 100644
--- a/d5/d08/classgraph_1_1_graph__coll__graph.md5
+++ b/d5/d08/classgraph_1_1_graph__coll__graph.md5
@@ -1 +1 @@
-f4a0af6848acb60282c3cba3543ed8cb
\ No newline at end of file
+d2545ab05f3a6833b62bcbc9d3f20178
\ No newline at end of file
diff --git a/d5/d08/classgraph_1_1_graph__coll__graph.svg b/d5/d08/classgraph_1_1_graph__coll__graph.svg
index 55e4e7593..e217e751f 100644
--- a/d5/d08/classgraph_1_1_graph__coll__graph.svg
+++ b/d5/d08/classgraph_1_1_graph__coll__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="106,-97 0,-97 0,-66.5 106,-66.5 106,-97"/>
 <text text-anchor="start" x="8" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::map&lt; T, std::list</text>
 <text text-anchor="middle" x="53" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; T &gt; &gt;</text>
@@ -71,7 +71,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="242,-97 124,-97 124,-66.5 242,-66.5 242,-97"/>
 <text text-anchor="start" x="132" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="183" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
diff --git a/d5/d08/classgraph_1_1_graph__coll__graph_org.svg b/d5/d08/classgraph_1_1_graph__coll__graph_org.svg
index c3535d5f2..3f828ba14 100644
--- a/d5/d08/classgraph_1_1_graph__coll__graph_org.svg
+++ b/d5/d08/classgraph_1_1_graph__coll__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="106,-97 0,-97 0,-66.5 106,-66.5 106,-97"/>
 <text text-anchor="start" x="8" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::map&lt; T, std::list</text>
 <text text-anchor="middle" x="53" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; T &gt; &gt;</text>
@@ -60,7 +60,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="242,-97 124,-97 124,-66.5 242,-66.5 242,-97"/>
 <text text-anchor="start" x="132" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="183" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
diff --git a/d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html b/d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html
index f96455094..61d4bcf41 100644
--- a/d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html
+++ b/d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::trie_using_hashmap::Trie::Node Struct Reference</title>
+<title>TheAlgorithms/C++: data_structures::trie_using_hashmap::Trie::Node Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,15 +138,16 @@ Collaboration diagram for data_structures::trie_using_hashmap::Trie::Node:</div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a08212cdc99164b59da91b81f45e2f88e" id="r_a08212cdc99164b59da91b81f45e2f88e"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a>&lt; char16_t, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</a> &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a08212cdc99164b59da91b81f45e2f88e">children</a></td></tr>
+<tr class="memitem:a08212cdc99164b59da91b81f45e2f88e" id="r_a08212cdc99164b59da91b81f45e2f88e"><td class="memItemLeft" align="right" valign="top">std::unordered_map&lt; char16_t, std::shared_ptr&lt; <a class="el" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</a> &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a08212cdc99164b59da91b81f45e2f88e">children</a></td></tr>
 <tr class="separator:a08212cdc99164b59da91b81f45e2f88e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a3cdb077745d3dc97212d693132371219" id="r_a3cdb077745d3dc97212d693132371219"><td class="memItemLeft" align="right" valign="top"><a id="a3cdb077745d3dc97212d693132371219" name="a3cdb077745d3dc97212d693132371219"></a>
-bool&#160;</td><td class="memItemRight" valign="bottom"><b>word_end</b> = false</td></tr>
-<tr class="memdesc:a3cdb077745d3dc97212d693132371219"><td class="mdescLeft">&#160;</td><td class="mdescRight">boolean variable to represent the node end <br /></td></tr>
+<tr class="memitem:a3cdb077745d3dc97212d693132371219" id="r_a3cdb077745d3dc97212d693132371219"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3cdb077745d3dc97212d693132371219">word_end</a> = false</td></tr>
+<tr class="memdesc:a3cdb077745d3dc97212d693132371219"><td class="mdescLeft">&#160;</td><td class="mdescRight">boolean variable to represent the node end  <br /></td></tr>
 <tr class="separator:a3cdb077745d3dc97212d693132371219"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>struct representing a trie node. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html">trie_using_hashmap.cpp</a>.</p>
 </div><h2 class="groupheader">Member Data Documentation</h2>
 <a id="a08212cdc99164b59da91b81f45e2f88e" name="a08212cdc99164b59da91b81f45e2f88e"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a08212cdc99164b59da91b81f45e2f88e">&#9670;&#160;</a></span>children</h2>
@@ -138,16 +156,36 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>word_end</b> = false<
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a>&lt;char16_t, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt;<a class="el" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</a>&gt; &gt; data_structures::trie_using_hashmap::Trie::Node::children</td>
+          <td class="memname">std::unordered_map&lt;char16_t, std::shared_ptr&lt;<a class="el" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</a>&gt; &gt; data_structures::trie_using_hashmap::Trie::Node::children</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>unordered map with key type char16_t and value is a shared pointer type of <a class="el" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html" title="struct representing a trie node.">Node</a> </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00046">46</a> of file <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html">trie_using_hashmap.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a3cdb077745d3dc97212d693132371219" name="a3cdb077745d3dc97212d693132371219"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a3cdb077745d3dc97212d693132371219">&#9670;&#160;</a></span>word_end</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">bool data_structures::trie_using_hashmap::Trie::Node::word_end = false</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>boolean variable to represent the node end </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html">trie_using_hashmap.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp.html">trie_using_hashmap.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html">trie_using_hashmap.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d5/d15/classcll.html b/d5/d15/classcll.html
index 8d49c9ff6..c83db0d95 100644
--- a/d5/d15/classcll.html
+++ b/d5/d15/classcll.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: cll Class Reference</title>
+<title>TheAlgorithms/C++: cll Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -136,14 +153,15 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pro-attribs" name="pro-attribs"></a>
 Protected Attributes</h2></td></tr>
-<tr class="memitem:a852ab0b4ec38b8462df3f32ee6f11290" id="r_a852ab0b4ec38b8462df3f32ee6f11290"><td class="memItemLeft" align="right" valign="top"><a id="a852ab0b4ec38b8462df3f32ee6f11290" name="a852ab0b4ec38b8462df3f32ee6f11290"></a>
-<a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>head</b></td></tr>
+<tr class="memitem:a852ab0b4ec38b8462df3f32ee6f11290" id="r_a852ab0b4ec38b8462df3f32ee6f11290"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a852ab0b4ec38b8462df3f32ee6f11290">head</a></td></tr>
 <tr class="separator:a852ab0b4ec38b8462df3f32ee6f11290"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a23cbc56c51dafc17bd16cecd0f491731" id="r_a23cbc56c51dafc17bd16cecd0f491731"><td class="memItemLeft" align="right" valign="top"><a id="a23cbc56c51dafc17bd16cecd0f491731" name="a23cbc56c51dafc17bd16cecd0f491731"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
+<tr class="memitem:a23cbc56c51dafc17bd16cecd0f491731" id="r_a23cbc56c51dafc17bd16cecd0f491731"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a23cbc56c51dafc17bd16cecd0f491731">total</a></td></tr>
 <tr class="separator:a23cbc56c51dafc17bd16cecd0f491731"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
-<h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../d7/dba/cll_8h_source.html#l00017">17</a> of file <a class="el" href="../../d7/dba/cll_8h_source.html">cll.h</a>.</p>
+</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a3f09a4ec2bc5a211a8409693b4cab4f8" name="a3f09a4ec2bc5a211a8409693b4cab4f8"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a3f09a4ec2bc5a211a8409693b4cab4f8">&#9670;&#160;</a></span>cll()</h2>
 
@@ -158,6 +176,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d70/cll_8cpp_source.html#l00008">8</a> of file <a class="el" href="../../d1/d70/cll_8cpp_source.html">cll.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">    8</span>         {</div>
 <div class="line"><span class="lineno">    9</span>    head = NULL;</div>
 <div class="line"><span class="lineno">   10</span>    total = 0;</div>
@@ -179,6 +199,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d70/cll_8cpp_source.html#l00013">13</a> of file <a class="el" href="../../d1/d70/cll_8cpp_source.html">cll.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   13</span>          { <span class="comment">/* Desstructure, no need to fill */</span></div>
 <div class="line"><span class="lineno">   14</span>}</div>
 </div><!-- fragment -->
@@ -199,23 +221,24 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d70/cll_8cpp_source.html#l00017">17</a> of file <a class="el" href="../../d1/d70/cll_8cpp_source.html">cll.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   17</span>                  {</div>
 <div class="line"><span class="lineno">   18</span>    <span class="keywordflow">if</span> (head == NULL)</div>
-<div class="line"><span class="lineno">   19</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;List is empty !&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><span class="lineno">   19</span>        cout &lt;&lt; <span class="stringliteral">&quot;List is empty !&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">   20</span>    <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   21</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;CLL list: &quot;</span>;</div>
+<div class="line"><span class="lineno">   21</span>        cout &lt;&lt; <span class="stringliteral">&quot;CLL list: &quot;</span>;</div>
 <div class="line"><span class="lineno">   22</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *current = head;</div>
 <div class="line"><span class="lineno">   23</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; total; i++) {</div>
-<div class="line"><span class="lineno">   24</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; current-&gt;data &lt;&lt; <span class="stringliteral">&quot; -&gt; &quot;</span>;</div>
+<div class="line"><span class="lineno">   24</span>            cout &lt;&lt; current-&gt;data &lt;&lt; <span class="stringliteral">&quot; -&gt; &quot;</span>;</div>
 <div class="line"><span class="lineno">   25</span>            current = current-&gt;next;</div>
 <div class="line"><span class="lineno">   26</span>        }</div>
-<div class="line"><span class="lineno">   27</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; head-&gt;data &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
-<div class="line"><span class="lineno">   28</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;Total element: &quot;</span> &lt;&lt; total &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><span class="lineno">   27</span>        cout &lt;&lt; head-&gt;data &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><span class="lineno">   28</span>        cout &lt;&lt; <span class="stringliteral">&quot;Total element: &quot;</span> &lt;&lt; total &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">   29</span>    }</div>
 <div class="line"><span class="lineno">   30</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="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> matrix_exponentiation.cpp:36</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -233,9 +256,11 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d70/cll_8cpp_source.html#l00078">78</a> of file <a class="el" href="../../d1/d70/cll_8cpp_source.html">cll.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   78</span>                                    {</div>
 <div class="line"><span class="lineno">   79</span>    <span class="keywordflow">if</span> (head == NULL) {</div>
-<div class="line"><span class="lineno">   80</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;List is empty !&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><span class="lineno">   80</span>        cout &lt;&lt; <span class="stringliteral">&quot;List is empty !&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">   81</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   82</span>    } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">   83</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *current = head;</div>
@@ -264,6 +289,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d70/cll_8cpp_source.html#l00074">74</a> of file <a class="el" href="../../d1/d70/cll_8cpp_source.html">cll.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   74</span>{ <span class="keywordflow">return</span> total; }</div>
 </div><!-- fragment -->
 </div>
@@ -282,6 +309,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d70/cll_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../d1/d70/cll_8cpp_source.html">cll.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   33</span>                                   {</div>
 <div class="line"><span class="lineno">   34</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *newNode;</div>
 <div class="line"><span class="lineno">   35</span>    newNode = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
@@ -301,7 +330,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
 <div class="line"><span class="lineno">   49</span>    }</div>
 <div class="line"><span class="lineno">   50</span>    total++;</div>
 <div class="line"><span class="lineno">   51</span>}</div>
-<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -319,6 +348,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d70/cll_8cpp_source.html#l00054">54</a> of file <a class="el" href="../../d1/d70/cll_8cpp_source.html">cll.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   54</span>                                  {</div>
 <div class="line"><span class="lineno">   55</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *newNode;</div>
 <div class="line"><span class="lineno">   56</span>    newNode = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
@@ -354,6 +385,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d70/cll_8cpp_source.html#l00094">94</a> of file <a class="el" href="../../d1/d70/cll_8cpp_source.html">cll.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   94</span>{ <span class="keywordflow">return</span> head-&gt;data; }</div>
 </div><!-- fragment -->
 </div>
@@ -372,9 +405,11 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d70/cll_8cpp_source.html#l00098">98</a> of file <a class="el" href="../../d1/d70/cll_8cpp_source.html">cll.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   98</span>                     {</div>
 <div class="line"><span class="lineno">   99</span>    <span class="keywordflow">if</span> (head == NULL) {</div>
-<div class="line"><span class="lineno">  100</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;List is empty !&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><span class="lineno">  100</span>        cout &lt;&lt; <span class="stringliteral">&quot;List is empty !&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">  101</span>    } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">  102</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *current = head;</div>
 <div class="line"><span class="lineno">  103</span>        <span class="keywordflow">while</span> (current-&gt;next != head) {</div>
@@ -386,11 +421,60 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>total</b></td></tr>
 <div class="line"><span class="lineno">  109</span>    total--;</div>
 <div class="line"><span class="lineno">  110</span>}</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a852ab0b4ec38b8462df3f32ee6f11290" name="a852ab0b4ec38b8462df3f32ee6f11290"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a852ab0b4ec38b8462df3f32ee6f11290">&#9670;&#160;</a></span>head</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a>* cll::head</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/dba/cll_8h_source.html#l00040">40</a> of file <a class="el" href="../../d7/dba/cll_8h_source.html">cll.h</a>.</p>
+
+</div>
+</div>
+<a id="a23cbc56c51dafc17bd16cecd0f491731" name="a23cbc56c51dafc17bd16cecd0f491731"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a23cbc56c51dafc17bd16cecd0f491731">&#9670;&#160;</a></span>total</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int cll::total</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/dba/cll_8h_source.html#l00041">41</a> of file <a class="el" href="../../d7/dba/cll_8h_source.html">cll.h</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following files:<ul>
 <li>data_structures/cll/<a class="el" href="../../d7/dba/cll_8h_source.html">cll.h</a></li>
-<li>data_structures/cll/<b>cll.cpp</b></li>
+<li>data_structures/cll/<a class="el" href="../../d1/d70/cll_8cpp_source.html">cll.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html b/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html
index edb19791a..64e3b118b 100644
--- a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html
+++ b/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: bit_manipulation/next_higher_number_with_same_number_of_set_bits.cpp File Reference</title>
+<title>TheAlgorithms/C++: bit_manipulation/next_higher_number_with_same_number_of_set_bits.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for next_higher_number_with_same_number_of_set_bits.cpp
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/deb/next__higher__number__with__same__number__of__set__bits_8cpp__incl.svg" width="255" height="140"><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">
+</div>
+<p><a href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></td></tr>
@@ -144,6 +163,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>[Next higher number with same number of set bits] (<a href="https://www.geeksforgeeks.org/next-higher-number-with-same-number-of-set-bits/">https://www.geeksforgeeks.org/next-higher-number-with-same-number-of-set-bits/</a>) implementation </p>
 <p>Given a number x, find next number with same number of 1 bits in it’s binary representation. For example, consider x = 12, whose binary representation is 1100 (excluding leading zeros on 32 bit machine). It contains two logic 1 bits. The next higher number with two logic 1 bits is 17 (100012).</p>
 <p>A binary number consists of two digits. They are 0 &amp; 1. Digit 1 is known as set bit in computer terms. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Kunal766" target="_blank">Kunal Nayak</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html">next_higher_number_with_same_number_of_set_bits.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -162,17 +183,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html#l00098">98</a> of file <a class="el" href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html">next_higher_number_with_same_number_of_set_bits.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   98</span>           {</div>
 <div class="line"><span class="lineno">   99</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  100</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  101</span>}</div>
-<div class="ttc" id="anext__higher__number__with__same__number__of__set__bits_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> next_higher_number_with_same_number_of_set_bits.cpp:74</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="348" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anext__higher__number__with__same__number__of__set__bits_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html#l00074">next_higher_number_with_same_number_of_set_bits.cpp:74</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -200,6 +218,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html#l00074">74</a> of file <a class="el" href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html">next_higher_number_with_same_number_of_set_bits.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   74</span>                   {</div>
 <div class="line"><span class="lineno">   75</span>    <span class="comment">// x = 4 return 8</span></div>
 <div class="line"><span class="lineno">   76</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(4) == 8);</div>
@@ -218,17 +238,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   89</span>    <span class="comment">// x = 1024 return 2048</span></div>
 <div class="line"><span class="lineno">   90</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(1024) == 2048);</div>
 <div class="line"><span class="lineno">   91</span> </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> &lt;&lt; <span class="stringliteral">&quot;All test cases have successfully passed!&quot;</span> &lt;&lt; <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">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases have successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   93</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="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="anamespacebit__manipulation_html_a4b76571a2a04fa99c30a96eca9997f0e"><div class="ttname"><a href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a></div><div class="ttdeci">uint64_t next_higher_number(uint64_t x)</div><div class="ttdoc">The main function implements checking the next number.</div><div class="ttdef"><b>Definition</b> next_higher_number_with_same_number_of_set_bits.cpp:33</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="251" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacebit__manipulation_html_a4b76571a2a04fa99c30a96eca9997f0e"><div class="ttname"><a href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a></div><div class="ttdeci">uint64_t next_higher_number(uint64_t x)</div><div class="ttdoc">The main function implements checking the next number.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html#l00033">next_higher_number_with_same_number_of_set_bits.cpp:33</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 6bc70d309..000000000
--- a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,35,49,60"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="135,5,206,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,41,119,26,121,31,50,46"/>
-<area shape="rect" id="Node000003" href="$d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e" title="The main function implements checking the next number." alt="" coords="97,55,245,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="50,49,82,55,81,61,49,54"/>
-</map>
diff --git a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 44a3523b2..000000000
--- a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-88850cab1d66343ce66cdf5b4cc94862
\ No newline at end of file
diff --git a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 9b7ae2d7d..000000000
--- a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="188pt" height="76pt"
- viewBox="0.00 0.00 187.75 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-45.88 0,-45.88 0,-26.62 32.5,-26.62 32.5,-45.88"/>
-<text text-anchor="middle" x="16.25" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.88,-67.88 97.38,-67.88 97.38,-48.62 150.88,-48.62 150.88,-67.88"/>
-<text text-anchor="middle" x="124.12" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.87,-39.5C46.81,-42.39 67.77,-46.75 85.99,-50.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.19,-53.94 95.69,-52.55 86.61,-47.09 85.19,-53.94"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e" target="_top" xlink:title="The main function implements checking the next number.">
-<polygon fill="white" stroke="#666666" points="179.75,-30.5 68.5,-30.5 68.5,0 179.75,0 179.75,-30.5"/>
-<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::next</text>
-<text text-anchor="middle" x="124.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_higher_number</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.87,-33.15C39.66,-31.8 48.11,-30.13 57.11,-28.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.65,-31.8 66.78,-26.43 56.29,-24.94 57.65,-31.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 2ea184620..000000000
--- a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="188pt" height="76pt"
- viewBox="0.00 0.00 187.75 75.88" 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 71.88)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-45.88 0,-45.88 0,-26.62 32.5,-26.62 32.5,-45.88"/>
-<text text-anchor="middle" x="16.25" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.88,-67.88 97.38,-67.88 97.38,-48.62 150.88,-48.62 150.88,-67.88"/>
-<text text-anchor="middle" x="124.12" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.87,-39.5C46.81,-42.39 67.77,-46.75 85.99,-50.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.19,-53.94 95.69,-52.55 86.61,-47.09 85.19,-53.94"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e" target="_top" xlink:title="The main function implements checking the next number.">
-<polygon fill="white" stroke="#666666" points="179.75,-30.5 68.5,-30.5 68.5,0 179.75,0 179.75,-30.5"/>
-<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::next</text>
-<text text-anchor="middle" x="124.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_higher_number</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.87,-33.15C39.66,-31.8 48.11,-30.13 57.11,-28.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.65,-31.8 66.78,-26.43 56.29,-24.94 57.65,-31.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 5fe61a5fc..000000000
--- a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,35,55,60"/>
-<area shape="rect" id="Node000002" href="$d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,35,146,60"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,45,87,45,87,50,55,50"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="232,5,304,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,41,217,26,218,31,147,46"/>
-<area shape="rect" id="Node000004" href="$d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e" title="The main function implements checking the next number." alt="" coords="194,55,342,96"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="147,49,179,55,178,61,146,54"/>
-</map>
diff --git a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 53a3d5ef8..000000000
--- a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f26d8a8e0cdf8e54a9a3cc4ebce15bf8
\ No newline at end of file
diff --git a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index aa91b7293..000000000
--- a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="261pt" height="76pt"
- viewBox="0.00 0.00 260.75 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-45.88 0,-45.88 0,-26.62 37,-26.62 37,-45.88"/>
-<text text-anchor="middle" x="18.5" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-45.88 73,-45.88 73,-26.62 105.5,-26.62 105.5,-45.88"/>
-<text text-anchor="middle" x="89.25" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-36.25C44.58,-36.25 53.31,-36.25 61.45,-36.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-39.75 71.2,-36.25 61.2,-32.75 61.2,-39.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.88,-67.88 170.38,-67.88 170.38,-48.62 223.88,-48.62 223.88,-67.88"/>
-<text text-anchor="middle" x="197.12" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.87,-39.5C119.81,-42.39 140.77,-46.75 158.99,-50.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.19,-53.94 168.69,-52.55 159.61,-47.09 158.19,-53.94"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e" target="_top" xlink:title="The main function implements checking the next number.">
-<polygon fill="white" stroke="#666666" points="252.75,-30.5 141.5,-30.5 141.5,0 252.75,0 252.75,-30.5"/>
-<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::next</text>
-<text text-anchor="middle" x="197.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_higher_number</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.87,-33.15C112.66,-31.8 121.11,-30.13 130.11,-28.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.65,-31.8 139.78,-26.43 129.29,-24.94 130.65,-31.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index a3fcbdace..000000000
--- a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="261pt" height="76pt"
- viewBox="0.00 0.00 260.75 75.88" 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 71.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-45.88 0,-45.88 0,-26.62 37,-26.62 37,-45.88"/>
-<text text-anchor="middle" x="18.5" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-45.88 73,-45.88 73,-26.62 105.5,-26.62 105.5,-45.88"/>
-<text text-anchor="middle" x="89.25" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-36.25C44.58,-36.25 53.31,-36.25 61.45,-36.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-39.75 71.2,-36.25 61.2,-32.75 61.2,-39.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.88,-67.88 170.38,-67.88 170.38,-48.62 223.88,-48.62 223.88,-67.88"/>
-<text text-anchor="middle" x="197.12" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.87,-39.5C119.81,-42.39 140.77,-46.75 158.99,-50.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.19,-53.94 168.69,-52.55 159.61,-47.09 158.19,-53.94"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e" target="_top" xlink:title="The main function implements checking the next number.">
-<polygon fill="white" stroke="#666666" points="252.75,-30.5 141.5,-30.5 141.5,0 252.75,0 252.75,-30.5"/>
-<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::next</text>
-<text text-anchor="middle" x="197.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_higher_number</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.87,-33.15C112.66,-31.8 121.11,-30.13 130.11,-28.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.65,-31.8 139.78,-26.43 129.29,-24.94 130.65,-31.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html b/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html
new file mode 100644
index 000000000..edc5a9a45
--- /dev/null
+++ b/d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html
@@ -0,0 +1,215 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: bit_manipulation/next_higher_number_with_same_number_of_set_bits.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">next_higher_number_with_same_number_of_set_bits.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a> {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="foldopen" id="foldopen00033" data-start="{" data-end="}">
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">   33</a></span>uint64_t <a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">next_higher_number</a>(uint64_t x) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    uint64_t rightOne = 0;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    uint64_t nextHigherOneBit = 0;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    uint64_t rightOnesPattern = 0;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    uint64_t next = 0;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">if</span> (x) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        <span class="comment">// right most set bit</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        rightOne = x &amp; -<span class="keyword">static_cast&lt;</span><span class="keywordtype">signed</span><span class="keyword">&gt;</span>(x);</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="comment">// reset the pattern and set next higher bit</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="comment">// left part of x will be here</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        nextHigherOneBit = x + rightOne;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="comment">// nextHigherOneBit is now part [D] of the above explanation.</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="comment">// isolate the pattern</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        rightOnesPattern = x ^ nextHigherOneBit;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        <span class="comment">// right adjust pattern</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        rightOnesPattern = (rightOnesPattern) / rightOne;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        <span class="comment">// correction factor</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        rightOnesPattern &gt;&gt;= 2;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <span class="comment">// rightOnesPattern is now part [A] of the above explanation.</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="comment">// integrate new pattern (Add [D] and [A])</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        next = nextHigherOneBit | rightOnesPattern;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordflow">return</span> next;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>}</div>
+</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>}  <span class="comment">// namespace bit_manipulation</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="foldopen" id="foldopen00074" data-start="{" data-end="}">
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   74</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="comment">// x = 4 return 8</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(4) == 8);</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="comment">// x = 6 return 9</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(6) == 9);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="comment">// x = 13 return 14</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(13) == 14);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="comment">// x = 64 return 128</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(64) == 128);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="comment">// x = 15 return 23</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(15) == 23);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="comment">// x= 32 return 64</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(32) == 64);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="comment">// x = 97 return 98</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(97) == 98);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="comment">// x = 1024 return 2048</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a>(1024) == 2048);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases have successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00098" data-start="{" data-end="}">
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"><a class="line" href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   98</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <a class="code hl_function" href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>}</div>
+</div>
+<div class="ttc" id="anamespacebit__manipulation_html"><div class="ttname"><a href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacebit__manipulation_html_a4b76571a2a04fa99c30a96eca9997f0e"><div class="ttname"><a href="../../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e">bit_manipulation::next_higher_number</a></div><div class="ttdeci">uint64_t next_higher_number(uint64_t x)</div><div class="ttdoc">The main function implements checking the next number.</div><div class="ttdef"><b>Definition</b> <a href="#l00033">next_higher_number_with_same_number_of_set_bits.cpp:33</a></div></div>
+<div class="ttc" id="anext__higher__number__with__same__number__of__set__bits_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_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> <a href="#l00074">next_higher_number_with_same_number_of_set_bits.cpp:74</a></div></div>
+<div class="ttc" id="anext__higher__number__with__same__number__of__set__bits_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00098">next_higher_number_with_same_number_of_set_bits.cpp:98</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_f3c4fbc4e901afa0a54d0623c5574aa7.html">bit_manipulation</a></li><li class="navelem"><a class="el" href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html">next_higher_number_with_same_number_of_set_bits.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/d1e/tim__sort_8cpp_source.html b/d5/d1e/tim__sort_8cpp_source.html
new file mode 100644
index 000000000..cf10ac4c1
--- /dev/null
+++ b/d5/d1e/tim__sort_8cpp_source.html
@@ -0,0 +1,266 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/tim_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/d1e/tim__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">tim_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">// C++ program to perform TimSort.</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &lt;numeric&gt;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span> </div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="keyword">const</span> <span class="keywordtype">int</span> RUN = 32;</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment">// this function sorts array from left index to to right index which is of size</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment">// atmost RUN</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">insertionSort</a>(<span class="keywordtype">int</span> arr[], <span class="keywordtype">int</span> left, <span class="keywordtype">int</span> right) {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = left + 1; i &lt;= right; i++) {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>        <span class="keyword">const</span> <span class="keywordtype">int</span> temp = arr[i];</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>        <span class="keywordtype">int</span> j = i - 1;</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>        <span class="keywordflow">while</span> (j &gt;= left &amp;&amp; arr[j] &gt; temp) {</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>            arr[j + 1] = arr[j];</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>            j--;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        }</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        arr[j + 1] = temp;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    }</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>}</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment">// merge function merges the sorted runs</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d26/count__inversions_8cpp.html#aad643c14734394e784a75169cb58132f">merge</a>(<span class="keywordtype">int</span> arr[], <span class="keywordtype">int</span> l, <span class="keywordtype">int</span> m, <span class="keywordtype">int</span> r) {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="comment">// original array is broken in two parts, left and right array</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> len1 = m - <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> + 1, len2 = r - m;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordtype">int</span> *left = <span class="keyword">new</span> <span class="keywordtype">int</span>[len1], *right = <span class="keyword">new</span> <span class="keywordtype">int</span>[len2];</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; len1; i++) left[i] = arr[l + i];</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; len2; i++) right[i] = arr[m + 1 + i];</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordtype">int</span> i = 0;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordtype">int</span> j = 0;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="comment">// after comparing, we merge those two array in larger sub array</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">while</span> (i &lt; len1 &amp;&amp; j &lt; len2) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        <span class="keywordflow">if</span> (left[i] &lt;= right[j]) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>            arr[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] = left[i];</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            i++;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>            arr[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] = right[j];</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>            j++;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="comment">// copy remaining elements of left, if any</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">while</span> (i &lt; len1) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        arr[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] = left[i];</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        i++;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    }</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="comment">// copy remaining element of right, if any</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordflow">while</span> (j &lt; len2) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        arr[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] = right[j];</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        j++;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    }</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keyword">delete</span>[] left;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keyword">delete</span>[] right;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>}</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span><span class="comment">// iterative Timsort function to sort the array[0...n-1] (similar to merge sort)</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="keywordtype">void</span> timSort(<span class="keywordtype">int</span> arr[], <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="comment">// Sort individual subarrays of size RUN</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i += RUN)</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">insertionSort</a>(arr, i, std::min((i + 31), (n - 1)));</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="comment">// start merging from size RUN (or 32). It will merge to form size 64, then</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="comment">// 128, 256 and so on ....</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> size = RUN; size &lt; n; size = 2 * size) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        <span class="comment">// pick starting point of left sub array. We are going to merge</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        <span class="comment">// arr[left..left+size-1] and arr[left+size, left+2*size-1] After every</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        <span class="comment">// merge, we increase left by 2*size</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> left = 0; left &lt; n; left += 2 * size) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            <span class="comment">// find ending point of left sub array</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            <span class="comment">// mid+1 is starting point of right sub array</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            <span class="keyword">const</span> <span class="keywordtype">int</span> mid = std::min((left + size - 1), (n - 1));</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>            <span class="keyword">const</span> <span class="keywordtype">int</span> right = std::min((left + 2 * size - 1), (n - 1));</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>            <span class="comment">// merge sub array arr[left.....mid] &amp; arr[mid+1....right]</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            <a class="code hl_function" href="../../d2/d26/count__inversions_8cpp.html#aad643c14734394e784a75169cb58132f">merge</a>(arr, left, mid, right);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        }</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    }</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>}</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span><span class="comment">// utility function to print the Array</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767">printArray</a>(<span class="keywordtype">int</span> arr[], <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) printf(<span class="stringliteral">&quot;%d  &quot;</span>, arr[i]);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>}</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span><span class="keywordtype">void</span> <a class="code hl_namespace" href="../../d9/df4/namespacetests.html">tests</a>() {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="comment">// Case: array of length 65</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="keyword">constexpr</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 65;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keywordtype">int</span> arr[<a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>];</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    std::iota(arr, arr + N, 0);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::reverse(arr, arr + N);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    assert(!std::is_sorted(arr, arr + N));</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    timSort(arr, N);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    assert(std::is_sorted(arr, arr + N));</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>}</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span> </div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span><span class="comment">// Driver program to test above function</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <a class="code hl_namespace" href="../../d9/df4/namespacetests.html">tests</a>();  <span class="comment">// run self test implementations</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <span class="keywordtype">int</span> arr[] = {5, 21, 7, 23, 19};</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> n = <span class="keyword">sizeof</span>(arr) / <span class="keyword">sizeof</span>(arr[0]);</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    printf(<span class="stringliteral">&quot;Given Array is\n&quot;</span>);</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <a class="code hl_function" href="../../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767">printArray</a>(arr, n);</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    timSort(arr, n);</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span> </div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    printf(<span class="stringliteral">&quot;After Sorting Array is\n&quot;</span>);</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    <a class="code hl_function" href="../../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767">printArray</a>(arr, n);</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>}</div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00119">composite_simpson_rule.cpp:119</a></div></div>
+<div class="ttc" id="acount__inversions_8cpp_html_aad643c14734394e784a75169cb58132f"><div class="ttname"><a href="../../d2/d26/count__inversions_8cpp.html#aad643c14734394e784a75169cb58132f">sorting::inversion::merge</a></div><div class="ttdeci">uint32_t merge(T *arr, T *temp, uint32_t left, uint32_t mid, uint32_t right)</div><div class="ttdoc">Function to merge two sub-arrays.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d26/count__inversions_8cpp_source.html#l00085">count_inversions.cpp:85</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="aheap__sort_8cpp_html_a9ed3e1510afdf3edd06cf2b68769a767"><div class="ttname"><a href="../../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767">printArray</a></div><div class="ttdeci">void printArray(T *arr, int sz)</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d52/heap__sort_8cpp_source.html#l00037">heap_sort.cpp:37</a></div></div>
+<div class="ttc" id="anamespacesorting_html_a78cb2f3b97b6db2c062b2a1df05c9ea9"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a></div><div class="ttdeci">void insertionSort(T *arr, int n)</div><div class="ttdoc">Insertion Sort Function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d0d/insertion__sort_8cpp_source.html#l00059">insertion_sort.cpp:59</a></div></div>
+<div class="ttc" id="anamespacetests_html"><div class="ttname"><a href="../../d9/df4/namespacetests.html">tests</a></div><div class="ttdoc">Testcases to check Union of Two Arrays.</div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><b>tim_sort.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/d21/longest__increasing__subsequence__nlogn_8cpp_source.html b/d5/d21/longest__increasing__subsequence__nlogn_8cpp_source.html
new file mode 100644
index 000000000..a7d8c0bfc
--- /dev/null
+++ b/d5/d21/longest__increasing__subsequence__nlogn_8cpp_source.html
@@ -0,0 +1,183 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/longest_increasing_subsequence_nlogn.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/d21/longest__increasing__subsequence__nlogn_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">longest_increasing_subsequence_nlogn.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">// Program to calculate length of longest increasing subsequence in an array</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment">// in O(n log n)</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment">// tested on : https://cses.fi/problemset/task/1145/</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;set&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079">LIS</a>(<span class="keyword">const</span> std::vector&lt;int&gt;&amp; arr, <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    set&lt;int&gt; active;  <span class="comment">// The current built LIS.</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    active.insert(arr[0]);</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <span class="comment">// Loop through every element.</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>        <span class="keyword">auto</span> get = active.lower_bound(arr[i]);</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>        <span class="keywordflow">if</span> (get == active.end()) {</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>            active.insert(arr[i]);</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        }  <span class="comment">// current element is the greatest so LIS increases by 1.</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>            <span class="keywordtype">int</span> val = *get;  <span class="comment">// we find the position where arr[i] will be in the</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>                             <span class="comment">// LIS. If it is in the LIS already we do nothing</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>            <span class="keywordflow">if</span> (val &gt; arr[i]) {</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>                <span class="comment">// else we remove the bigger element and add a smaller element</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>                <span class="comment">// (which is arr[i]) and continue;</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>                active.erase(get);</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>                active.insert(arr[i]);</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>            }</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        }</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    }</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">return</span> active.size();  <span class="comment">// size of the LIS.</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>}</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> <span class="keyword">const</span>* argv[]) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordtype">int</span> n;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    cout &lt;&lt; <span class="stringliteral">&quot;Enter size of array: &quot;</span>;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    cin &gt;&gt; n;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    std::vector&lt;int&gt; a(n);</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    cout &lt;&lt; <span class="stringliteral">&quot;Enter array elements: &quot;</span>;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        cin &gt;&gt; a[i];</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    }</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    cout &lt;&lt; <a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079">LIS</a>(a, n) &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
+<div class="ttc" id="anamespacedynamic__programming_html_a0a2215194e58786c34db1ccaf8031079"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079">dynamic_programming::LIS</a></div><div class="ttdeci">uint64_t LIS(const std::vector&lt; uint64_t &gt; &amp;a, const uint32_t &amp;n)</div><div class="ttdoc">Calculate the longest increasing subsequence for the specified numbers.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d57/longest__increasing__subsequence_8cpp_source.html#l00040">longest_increasing_subsequence.cpp:40</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><b>longest_increasing_subsequence_nlogn.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/d25/bead__sort_8cpp_source.html b/d5/d25/bead__sort_8cpp_source.html
new file mode 100644
index 000000000..bf14c03c8
--- /dev/null
+++ b/d5/d25/bead__sort_8cpp_source.html
@@ -0,0 +1,195 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/bead_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/d25/bead__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">bead_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">// C++ program to implement gravity/bead sort</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;cstdio&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#define BEAD(i, j) beads[i * max + j]</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span> </div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment">// function to perform the above algorithm</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="keywordtype">void</span> beadSort(<span class="keywordtype">int</span> *a, <span class="keywordtype">int</span> len) {</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    <span class="comment">// Find the maximum element</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    <span class="keywordtype">int</span> max = a[0];</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; len; i++)</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>        <span class="keywordflow">if</span> (a[i] &gt; max)</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>            max = a[i];</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="comment">// allocating memory</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> *beads = <span class="keyword">new</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>[max * len];</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    memset(beads, 0, <span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(max) * len);</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    <span class="comment">// mark the beads</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; len; i++)</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; a[i]; j++) BEAD(i, j) = 1;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; max; j++) {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        <span class="comment">// count how many beads are on each post</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</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"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; len; i++) {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>            <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> += BEAD(i, j);</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>            BEAD(i, j) = 0;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>        }</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        <span class="comment">// Move beads down</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = len - sum; i &lt; len; i++) BEAD(i, j) = 1;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    }</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="comment">// Put sorted values in array using beads</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; len; i++) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        <span class="keywordtype">int</span> j;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <span class="keywordflow">for</span> (j = 0; j &lt; max &amp;&amp; BEAD(i, j); j++) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        }</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        a[i] = j;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keyword">delete</span>[] beads;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>}</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="comment">// driver function to test the algorithm</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordtype">int</span> a[] = {5, 3, 1, 7, 4, 1, 1, 20};</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordtype">int</span> len = <span class="keyword">sizeof</span>(a) / <span class="keyword">sizeof</span>(a[0]);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    beadSort(a, len);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; len; i++) printf(<span class="stringliteral">&quot;%d &quot;</span>, a[i]);</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00232">vector_ops.hpp:232</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><b>bead_sort.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html b/d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html
index a1558e643..87be879db 100644
--- a/d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html
+++ b/d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: std::is_unsigned&lt; uint128_t &gt; Struct Reference</title>
+<title>TheAlgorithms/C++: std::is_unsigned&lt; uint128_t &gt; Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -117,7 +134,10 @@ Collaboration diagram for std::is_unsigned&lt; uint128_t &gt;:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.svg" width="204" height="111"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
-<hr/>The documentation for this struct was generated from the following file:<ul>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00029">29</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
+</div><hr/>The documentation for this struct was generated from the following file:<ul>
 <li>ciphers/<a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a></li>
 </ul>
 </div><!-- contents -->
@@ -125,7 +145,7 @@ Collaboration diagram for std::is_unsigned&lt; uint128_t &gt;:</div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
-    <li class="navelem"><a class="el" href="../../d8/dcc/namespacestd.html">std</a></li><li class="navelem"><a class="el" href="../../d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html">is_unsigned&lt; uint128_t &gt;</a></li>
+    <li class="navelem"><b>std</b></li><li class="navelem"><a class="el" href="../../d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html">is_unsigned&lt; uint128_t &gt;</a></li>
     <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
   </ul>
 </div>
diff --git a/d5/d29/struct_min_heap_node.html b/d5/d29/struct_min_heap_node.html
index 3f671c00a..18f837592 100644
--- a/d5/d29/struct_min_heap_node.html
+++ b/d5/d29/struct_min_heap_node.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: MinHeapNode Struct Reference</title>
+<title>TheAlgorithms/C++: MinHeapNode Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,20 +141,19 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a3d422a54a6e8f8ebc7e386125a09d8e8" id="r_a3d422a54a6e8f8ebc7e386125a09d8e8"><td class="memItemLeft" align="right" valign="top"><a id="a3d422a54a6e8f8ebc7e386125a09d8e8" name="a3d422a54a6e8f8ebc7e386125a09d8e8"></a>
-char&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
+<tr class="memitem:a3d422a54a6e8f8ebc7e386125a09d8e8" id="r_a3d422a54a6e8f8ebc7e386125a09d8e8"><td class="memItemLeft" align="right" valign="top">char&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3d422a54a6e8f8ebc7e386125a09d8e8">data</a></td></tr>
 <tr class="separator:a3d422a54a6e8f8ebc7e386125a09d8e8"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a3b604fe2d4f56fcb78f8e0e02b0458fd" id="r_a3b604fe2d4f56fcb78f8e0e02b0458fd"><td class="memItemLeft" align="right" valign="top"><a id="a3b604fe2d4f56fcb78f8e0e02b0458fd" name="a3b604fe2d4f56fcb78f8e0e02b0458fd"></a>
-unsigned&#160;</td><td class="memItemRight" valign="bottom"><b>freq</b></td></tr>
+<tr class="memitem:a3b604fe2d4f56fcb78f8e0e02b0458fd" id="r_a3b604fe2d4f56fcb78f8e0e02b0458fd"><td class="memItemLeft" align="right" valign="top">unsigned&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3b604fe2d4f56fcb78f8e0e02b0458fd">freq</a></td></tr>
 <tr class="separator:a3b604fe2d4f56fcb78f8e0e02b0458fd"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad06549be842d9a2cacdb3e55b019e68c" id="r_ad06549be842d9a2cacdb3e55b019e68c"><td class="memItemLeft" align="right" valign="top"><a id="ad06549be842d9a2cacdb3e55b019e68c" name="ad06549be842d9a2cacdb3e55b019e68c"></a>
-<a class="el" href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>left</b></td></tr>
+<tr class="memitem:ad06549be842d9a2cacdb3e55b019e68c" id="r_ad06549be842d9a2cacdb3e55b019e68c"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad06549be842d9a2cacdb3e55b019e68c">left</a></td></tr>
 <tr class="separator:ad06549be842d9a2cacdb3e55b019e68c"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a6df054c3211ae8a8ec15a21e7d18343a" id="r_a6df054c3211ae8a8ec15a21e7d18343a"><td class="memItemLeft" align="right" valign="top"><a id="a6df054c3211ae8a8ec15a21e7d18343a" name="a6df054c3211ae8a8ec15a21e7d18343a"></a>
-<a class="el" href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>right</b></td></tr>
+<tr class="memitem:a6df054c3211ae8a8ec15a21e7d18343a" id="r_a6df054c3211ae8a8ec15a21e7d18343a"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6df054c3211ae8a8ec15a21e7d18343a">right</a></td></tr>
 <tr class="separator:a6df054c3211ae8a8ec15a21e7d18343a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
-<h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../d5/d8e/huffman_8cpp_source.html#l00007">7</a> of file <a class="el" href="../../d5/d8e/huffman_8cpp_source.html">huffman.cpp</a>.</p>
+</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a41f73e87e4ddf1fbe72ae0db2b4e674e" name="a41f73e87e4ddf1fbe72ae0db2b4e674e"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a41f73e87e4ddf1fbe72ae0db2b4e674e">&#9670;&#160;</a></span>MinHeapNode()</h2>
 
@@ -164,16 +180,83 @@ unsigned&#160;</td><td class="memItemRight" valign="bottom"><b>freq</b></td></tr
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d8e/huffman_8cpp_source.html#l00017">17</a> of file <a class="el" href="../../d5/d8e/huffman_8cpp_source.html">huffman.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   19</span>    {</div>
 <div class="line"><span class="lineno">   20</span>        left = right = NULL;</div>
 <div class="line"><span class="lineno">   21</span>        this-&gt;data = data;</div>
 <div class="line"><span class="lineno">   22</span>        this-&gt;freq = freq;</div>
 <div class="line"><span class="lineno">   23</span>    }</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a3d422a54a6e8f8ebc7e386125a09d8e8" name="a3d422a54a6e8f8ebc7e386125a09d8e8"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a3d422a54a6e8f8ebc7e386125a09d8e8">&#9670;&#160;</a></span>data</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">char MinHeapNode::data</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d8e/huffman_8cpp_source.html#l00009">9</a> of file <a class="el" href="../../d5/d8e/huffman_8cpp_source.html">huffman.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a3b604fe2d4f56fcb78f8e0e02b0458fd" name="a3b604fe2d4f56fcb78f8e0e02b0458fd"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a3b604fe2d4f56fcb78f8e0e02b0458fd">&#9670;&#160;</a></span>freq</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">unsigned MinHeapNode::freq</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d8e/huffman_8cpp_source.html#l00012">12</a> of file <a class="el" href="../../d5/d8e/huffman_8cpp_source.html">huffman.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ad06549be842d9a2cacdb3e55b019e68c" name="ad06549be842d9a2cacdb3e55b019e68c"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ad06549be842d9a2cacdb3e55b019e68c">&#9670;&#160;</a></span>left</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a>* MinHeapNode::left</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d8e/huffman_8cpp_source.html#l00015">15</a> of file <a class="el" href="../../d5/d8e/huffman_8cpp_source.html">huffman.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a6df054c3211ae8a8ec15a21e7d18343a" name="a6df054c3211ae8a8ec15a21e7d18343a"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a6df054c3211ae8a8ec15a21e7d18343a">&#9670;&#160;</a></span>right</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a> * MinHeapNode::right</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d8e/huffman_8cpp_source.html#l00015">15</a> of file <a class="el" href="../../d5/d8e/huffman_8cpp_source.html">huffman.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>greedy_algorithms/<b>huffman.cpp</b></li>
+<li>greedy_algorithms/<a class="el" href="../../d5/d8e/huffman_8cpp_source.html">huffman.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d5/d2c/namespacelayers.html b/d5/d2c/namespacelayers.html
index fe2cb8e1c..47093ad8e 100644
--- a/d5/d2c/namespacelayers.html
+++ b/d5/d2c/namespacelayers.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: layers Namespace Reference</title>
+<title>TheAlgorithms/C++: layers Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d5/d33/gram__schmidt_8cpp.html b/d5/d33/gram__schmidt_8cpp.html
index 2b4830d32..73247ec29 100644
--- a/d5/d33/gram__schmidt_8cpp.html
+++ b/d5/d33/gram__schmidt_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/gram_schmidt.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/gram_schmidt.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for gram_schmidt.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d96/gram__schmidt_8cpp__incl.svg" width="412" height="126"><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">
+</div>
+<p><a href="../../d5/d33/gram__schmidt_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr>
@@ -135,13 +154,13 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:ac4a4504924ecc9f12a2ebd80788ec01d" id="r_ac4a4504924ecc9f12a2ebd80788ec01d"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac4a4504924ecc9f12a2ebd80788ec01d">numerical_methods::gram_schmidt::dot_product</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;x, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;y, const int &amp;c)</td></tr>
+<tr class="memitem:ac4a4504924ecc9f12a2ebd80788ec01d" id="r_ac4a4504924ecc9f12a2ebd80788ec01d"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac4a4504924ecc9f12a2ebd80788ec01d">numerical_methods::gram_schmidt::dot_product</a> (const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</td></tr>
 <tr class="separator:ac4a4504924ecc9f12a2ebd80788ec01d"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8eeaafdde8b56f459aadc6013cf078bc" id="r_a8eeaafdde8b56f459aadc6013cf078bc"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8eeaafdde8b56f459aadc6013cf078bc">numerical_methods::gram_schmidt::projection</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;x, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;y, const int &amp;c)</td></tr>
+<tr class="memitem:a8eeaafdde8b56f459aadc6013cf078bc" id="r_a8eeaafdde8b56f459aadc6013cf078bc"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8eeaafdde8b56f459aadc6013cf078bc">numerical_methods::gram_schmidt::projection</a> (const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</td></tr>
 <tr class="separator:a8eeaafdde8b56f459aadc6013cf078bc"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae6b496dce691e04f7f95ba0f0d33a289" id="r_ae6b496dce691e04f7f95ba0f0d33a289"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae6b496dce691e04f7f95ba0f0d33a289">numerical_methods::gram_schmidt::display</a> (const int &amp;r, const int &amp;c, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt;, 20 &gt; &amp;B)</td></tr>
+<tr class="memitem:ae6b496dce691e04f7f95ba0f0d33a289" id="r_ae6b496dce691e04f7f95ba0f0d33a289"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae6b496dce691e04f7f95ba0f0d33a289">numerical_methods::gram_schmidt::display</a> (const int &amp;r, const int &amp;c, const std::array&lt; std::array&lt; double, 10 &gt;, 20 &gt; &amp;B)</td></tr>
 <tr class="separator:ae6b496dce691e04f7f95ba0f0d33a289"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0837468e1a653ed056e2cce3c914afa5" id="r_a0837468e1a653ed056e2cce3c914afa5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a> (int r, const int &amp;c, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt;, 20 &gt; &amp;A, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt;, 20 &gt; B)</td></tr>
+<tr class="memitem:a0837468e1a653ed056e2cce3c914afa5" id="r_a0837468e1a653ed056e2cce3c914afa5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a> (int r, const int &amp;c, const std::array&lt; std::array&lt; double, 10 &gt;, 20 &gt; &amp;A, std::array&lt; std::array&lt; double, 10 &gt;, 20 &gt; B)</td></tr>
 <tr class="separator:a0837468e1a653ed056e2cce3c914afa5"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
 <tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -158,6 +177,8 @@ Algorithm</h3>
 <p>For Example: In R2, Input LI Vectors={(3,1),(2,2)} then Orthogonal Vectors= {(3, 1),(-0.4, 1.2)}</p>
 <p>Have defined maximum dimension of vectors to be 10 and number of vectors taken is 20. Please do not give linearly dependent vectors</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Akanksha-Gupta920" target="_blank">Akanksha Gupta</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d5/d33/gram__schmidt_8cpp_source.html">gram_schmidt.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae6b496dce691e04f7f95ba0f0d33a289" name="ae6b496dce691e04f7f95ba0f0d33a289"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae6b496dce691e04f7f95ba0f0d33a289">&#9670;&#160;</a></span>display()</h2>
@@ -178,7 +199,7 @@ Algorithm</h3>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt;, 20 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
+          <td class="paramtype">const std::array&lt; std::array&lt; double, 10 &gt;, 20 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -192,16 +213,17 @@ Algorithm</h3>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d33/gram__schmidt_8cpp_source.html#l00101">101</a> of file <a class="el" href="../../d5/d33/gram__schmidt_8cpp_source.html">gram_schmidt.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  102</span>                                                          {</div>
 <div class="line"><span class="lineno">  103</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; r; ++i) {</div>
-<div class="line"><span class="lineno">  104</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Vector &quot;</span> &lt;&lt; i + 1 &lt;&lt; <span class="stringliteral">&quot;: &quot;</span>;</div>
+<div class="line"><span class="lineno">  104</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Vector &quot;</span> &lt;&lt; i + 1 &lt;&lt; <span class="stringliteral">&quot;: &quot;</span>;</div>
 <div class="line"><span class="lineno">  105</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; c; ++j) {</div>
-<div class="line"><span class="lineno">  106</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; B[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  106</span>            std::cout &lt;&lt; B[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</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> &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><span class="lineno">  108</span>        std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
 <div class="line"><span class="lineno">  109</span>    }</div>
 <div class="line"><span class="lineno">  110</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><!-- fragment -->
 </div>
 </div>
@@ -214,12 +236,12 @@ Algorithm</h3>
         <tr>
           <td class="memname">double numerical_methods::gram_schmidt::dot_product </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>x</em></span>, </td>
+          <td class="paramtype">const std::array&lt; double, 10 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>x</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
+          <td class="paramtype">const std::array&lt; double, 10 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -237,6 +259,8 @@ Algorithm</h3>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>sum </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d33/gram__schmidt_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d5/d33/gram__schmidt_8cpp_source.html">gram_schmidt.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   60</span>                                                                {</div>
 <div class="line"><span class="lineno">   61</span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> = 0;</div>
 <div class="line"><span class="lineno">   62</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; c; ++i) {</div>
@@ -244,13 +268,8 @@ Algorithm</h3>
 <div class="line"><span class="lineno">   64</span>    }</div>
 <div class="line"><span class="lineno">   65</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">   66</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&lt; std::valarray&lt; T &gt; &gt; &amp;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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d33/gram__schmidt_8cpp_ac4a4504924ecc9f12a2ebd80788ec01d_cgraph.svg" width="191" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00232">vector_ops.hpp:232</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0837468e1a653ed056e2cce3c914afa5" name="a0837468e1a653ed056e2cce3c914afa5"></a>
@@ -272,12 +291,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt;, 20 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">const std::array&lt; std::array&lt; double, 10 &gt;, 20 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt;, 20 &gt;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
+          <td class="paramtype">std::array&lt; std::array&lt; double, 10 &gt;, 20 &gt;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -300,9 +319,11 @@ Here is the call graph for this function:</div>
 <p>projected array created</p>
 <p>we take the projection with all the previous vector and add them.</p>
 <p>subtract total projection vector from the input vector</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d33/gram__schmidt_8cpp_source.html#l00121">121</a> of file <a class="el" href="../../d5/d33/gram__schmidt_8cpp_source.html">gram_schmidt.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  123</span>                                                        {</div>
-<div class="line"><span class="lineno">  124</span>    <span class="keywordflow">if</span> (c &lt; r) {  <span class="comment">/// we check whether appropriate dimensions are given or not.</span></div>
-<div class="line"><span class="lineno">  125</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Dimension of vector is less than number of vector, hence &quot;</span></div>
+<div class="line"><span class="lineno">  124</span>    <span class="keywordflow">if</span> (c &lt; r) {  </div>
+<div class="line"><span class="lineno">  125</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Dimension of vector is less than number of vector, hence &quot;</span></div>
 <div class="line"><span class="lineno">  126</span>                     <span class="stringliteral">&quot;\n first &quot;</span></div>
 <div class="line"><span class="lineno">  127</span>                  &lt;&lt; c &lt;&lt; <span class="stringliteral">&quot; vectors are orthogonalised\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  128</span>        r = c;</div>
@@ -313,55 +334,46 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  133</span>    <span class="keywordflow">while</span> (k &lt;= r) {</div>
 <div class="line"><span class="lineno">  134</span>        <span class="keywordflow">if</span> (k == 1) {</div>
 <div class="line"><span class="lineno">  135</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; c; j++)</div>
-<div class="line"><span class="lineno">  136</span>                B[0][j] = A[0][j];  <span class="comment">/// First vector is copied as it is.</span></div>
+<div class="line"><span class="lineno">  136</span>                B[0][j] = A[0][j];  </div>
 <div class="line"><span class="lineno">  137</span>        }</div>
 <div class="line"><span class="lineno">  138</span> </div>
 <div class="line"><span class="lineno">  139</span>        <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  140</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 10&gt;</a></div>
-<div class="line"><span class="lineno">  141</span>                all_projection{};  <span class="comment">/// array to store projections</span></div>
+<div class="line"><span class="lineno">  140</span>            std::array&lt;double, 10&gt;</div>
+<div class="line"><span class="lineno">  141</span>                all_projection{};  </div>
 <div class="line"><span class="lineno">  142</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; c; ++i) {</div>
-<div class="line"><span class="lineno">  143</span>                all_projection[i] = 0;  <span class="comment">/// First initialised to zero</span></div>
+<div class="line"><span class="lineno">  143</span>                all_projection[i] = 0;  </div>
 <div class="line"><span class="lineno">  144</span>            }</div>
 <div class="line"><span class="lineno">  145</span> </div>
 <div class="line"><span class="lineno">  146</span>            <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> = 1;</div>
 <div class="line"><span class="lineno">  147</span>            <span class="keywordflow">while</span> (l &lt; k) {</div>
-<div class="line"><span class="lineno">  148</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 10&gt;</a></div>
-<div class="line"><span class="lineno">  149</span>                    temp{};           <span class="comment">/// to store previous projected array</span></div>
-<div class="line"><span class="lineno">  150</span>                <span class="keywordtype">double</span> factor = NAN;  <span class="comment">/// to store the factor by which the</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  151</span><span class="comment">                                      /// previous array will change</span></div>
-<div class="line"><span class="lineno">  152</span><span class="comment"></span>                factor = <a class="code hl_function" href="#a8eeaafdde8b56f459aadc6013cf078bc">projection</a>(A[k - 1], B[l - 1], c);</div>
+<div class="line"><span class="lineno">  148</span>                std::array&lt;double, 10&gt;</div>
+<div class="line"><span class="lineno">  149</span>                    temp{};           </div>
+<div class="line"><span class="lineno">  150</span>                <span class="keywordtype">double</span> factor = NAN;  </div>
+<div class="line"><span class="lineno">  152</span>                factor = <a class="code hl_function" href="#a8eeaafdde8b56f459aadc6013cf078bc">projection</a>(A[k - 1], B[l - 1], c);</div>
 <div class="line"><span class="lineno">  153</span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; c; ++i) {</div>
-<div class="line"><span class="lineno">  154</span>                    temp[i] = B[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> - 1][i] * factor;  <span class="comment">/// projected array created</span></div>
+<div class="line"><span class="lineno">  154</span>                    temp[i] = B[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> - 1][i] * factor;  </div>
 <div class="line"><span class="lineno">  155</span>                }</div>
 <div class="line"><span class="lineno">  156</span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; c; ++j) {</div>
 <div class="line"><span class="lineno">  157</span>                    all_projection[j] =</div>
 <div class="line"><span class="lineno">  158</span>                        all_projection[j] +</div>
-<div class="line"><span class="lineno">  159</span>                        temp[j];  <span class="comment">/// we take the projection with all the</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  160</span><span class="comment">                                  /// previous vector and add them.</span></div>
-<div class="line"><span class="lineno">  161</span><span class="comment"></span>                }</div>
+<div class="line"><span class="lineno">  159</span>                        temp[j];  </div>
+<div class="line"><span class="lineno">  161</span>                }</div>
 <div class="line"><span class="lineno">  162</span>                <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>++;</div>
 <div class="line"><span class="lineno">  163</span>            }</div>
 <div class="line"><span class="lineno">  164</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; c; ++i) {</div>
 <div class="line"><span class="lineno">  165</span>                B[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> - 1][i] =</div>
 <div class="line"><span class="lineno">  166</span>                    A[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> - 1][i] -</div>
-<div class="line"><span class="lineno">  167</span>                    all_projection[i];  <span class="comment">/// subtract total projection vector</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  168</span><span class="comment">                                        /// from the input vector</span></div>
-<div class="line"><span class="lineno">  169</span><span class="comment"></span>            }</div>
+<div class="line"><span class="lineno">  167</span>                    all_projection[i];  </div>
+<div class="line"><span class="lineno">  169</span>            }</div>
 <div class="line"><span class="lineno">  170</span>        }</div>
 <div class="line"><span class="lineno">  171</span>        <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++;</div>
 <div class="line"><span class="lineno">  172</span>    }</div>
 <div class="line"><span class="lineno">  173</span>    display(r, c, B);  <span class="comment">// for displaying orthogoanlised vectors</span></div>
 <div class="line"><span class="lineno">  174</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:119</div></div>
-<div class="ttc" id="agram__schmidt_8cpp_html_a8eeaafdde8b56f459aadc6013cf078bc"><div class="ttname"><a href="#a8eeaafdde8b56f459aadc6013cf078bc">numerical_methods::gram_schmidt::projection</a></div><div class="ttdeci">double projection(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition</b> gram_schmidt.cpp:79</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d33/gram__schmidt_8cpp_a0837468e1a653ed056e2cce3c914afa5_cgraph.svg" width="647" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00119">composite_simpson_rule.cpp:119</a></div></div>
+<div class="ttc" id="agram__schmidt_8cpp_html_a8eeaafdde8b56f459aadc6013cf078bc"><div class="ttname"><a href="#a8eeaafdde8b56f459aadc6013cf078bc">numerical_methods::gram_schmidt::projection</a></div><div class="ttdeci">double projection(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d33/gram__schmidt_8cpp_source.html#l00079">gram_schmidt.cpp:79</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -387,59 +399,52 @@ Here is the call graph for this function:</div>
 <p>Input of vectors is taken</p>
 <p>To check whether vectors are orthogonal or not</p>
 <p>take make the process numerically stable, upper bound for the dot product take 0.1</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d33/gram__schmidt_8cpp_source.html#l00248">248</a> of file <a class="el" href="../../d5/d33/gram__schmidt_8cpp_source.html">gram_schmidt.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  248</span>           {</div>
 <div class="line"><span class="lineno">  249</span>    <span class="keywordtype">int</span> r = 0, c = 0;</div>
 <div class="line"><span class="lineno">  250</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// perform self tests</span></div>
-<div class="line"><span class="lineno">  251</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the dimension of your vectors\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  252</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; c;</div>
-<div class="line"><span class="lineno">  253</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the number of vectors you will enter\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  254</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; r;</div>
+<div class="line"><span class="lineno">  251</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the dimension of your vectors\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  252</span>    std::cin &gt;&gt; c;</div>
+<div class="line"><span class="lineno">  253</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of vectors you will enter\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  254</span>    std::cin &gt;&gt; r;</div>
 <div class="line"><span class="lineno">  255</span> </div>
-<div class="line"><span class="lineno">  256</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt;</div>
-<div class="line"><span class="lineno">  257</span>        A{};  <span class="comment">/// a 2-D array for storing all vectors</span></div>
-<div class="line"><span class="lineno">  258</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; B = {</div>
-<div class="line"><span class="lineno">  259</span>        {0}};  <span class="comment">/// a 2-D array for storing orthogonalised vectors</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  260</span><span class="comment">    /// storing vectors in array A</span></div>
-<div class="line"><span class="lineno">  261</span><span class="comment"></span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; r; ++i) {</div>
-<div class="line"><span class="lineno">  262</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter vector &quot;</span> &lt;&lt; i + 1</div>
-<div class="line"><span class="lineno">  263</span>                  &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;  <span class="comment">/// Input of vectors is taken</span></div>
+<div class="line"><span class="lineno">  256</span>    std::array&lt;std::array&lt;double, 10&gt;, 20&gt;</div>
+<div class="line"><span class="lineno">  257</span>        A{};  </div>
+<div class="line"><span class="lineno">  258</span>    std::array&lt;std::array&lt;double, 10&gt;, 20&gt; B = {</div>
+<div class="line"><span class="lineno">  259</span>        {0}};  </div>
+<div class="line"><span class="lineno">  261</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; r; ++i) {</div>
+<div class="line"><span class="lineno">  262</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter vector &quot;</span> &lt;&lt; i + 1</div>
+<div class="line"><span class="lineno">  263</span>                  &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;  </div>
 <div class="line"><span class="lineno">  264</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; c; ++j) {</div>
-<div class="line"><span class="lineno">  265</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Value &quot;</span> &lt;&lt; j + 1 &lt;&lt; <span class="stringliteral">&quot;th of vector: &quot;</span>;</div>
-<div class="line"><span class="lineno">  266</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; A[i][j];</div>
+<div class="line"><span class="lineno">  265</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Value &quot;</span> &lt;&lt; j + 1 &lt;&lt; <span class="stringliteral">&quot;th of vector: &quot;</span>;</div>
+<div class="line"><span class="lineno">  266</span>            std::cin &gt;&gt; A[i][j];</div>
 <div class="line"><span class="lineno">  267</span>        }</div>
-<div class="line"><span class="lineno">  268</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><span class="lineno">  268</span>        std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
 <div class="line"><span class="lineno">  269</span>    }</div>
 <div class="line"><span class="lineno">  270</span> </div>
 <div class="line"><span class="lineno">  271</span>    <a class="code hl_function" href="#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a>(r, c, A, B);</div>
 <div class="line"><span class="lineno">  272</span> </div>
 <div class="line"><span class="lineno">  273</span>    <span class="keywordtype">double</span> dot = 0;</div>
-<div class="line"><span class="lineno">  274</span>    <span class="keywordtype">int</span> flag = 1;  <span class="comment">/// To check whether vectors are orthogonal or  not</span></div>
+<div class="line"><span class="lineno">  274</span>    <span class="keywordtype">int</span> flag = 1;  </div>
 <div class="line"><span class="lineno">  275</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; r - 1; ++i) {</div>
 <div class="line"><span class="lineno">  276</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; r; ++j) {</div>
-<div class="line"><span class="lineno">  277</span>            dot = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">fabs</a>(</div>
+<div class="line"><span class="lineno">  277</span>            dot = fabs(</div>
 <div class="line"><span class="lineno">  278</span>                numerical_methods::gram_schmidt::dot_product(B[i], B[j], c));</div>
-<div class="line"><span class="lineno">  279</span>            <span class="keywordflow">if</span> (dot &gt; 0.1)  <span class="comment">/// take make the process numerically stable, upper</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  280</span><span class="comment">                            /// bound for the dot product take 0.1</span></div>
-<div class="line"><span class="lineno">  281</span><span class="comment"></span>            {</div>
+<div class="line"><span class="lineno">  279</span>            <span class="keywordflow">if</span> (dot &gt; 0.1)  </div>
+<div class="line"><span class="lineno">  281</span>            {</div>
 <div class="line"><span class="lineno">  282</span>                flag = 0;</div>
 <div class="line"><span class="lineno">  283</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  284</span>            }</div>
 <div class="line"><span class="lineno">  285</span>        }</div>
 <div class="line"><span class="lineno">  286</span>    }</div>
 <div class="line"><span class="lineno">  287</span>    <span class="keywordflow">if</span> (flag == 0)</div>
-<div class="line"><span class="lineno">  288</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  288</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  289</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  290</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="afabs_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">std::fabs</a></div><div class="ttdeci">T fabs(T... args)</div></div>
-<div class="ttc" id="agram__schmidt_8cpp_html_a0837468e1a653ed056e2cce3c914afa5"><div class="ttname"><a href="#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a></div><div class="ttdeci">void gram_schmidt(int r, const int &amp;c, const std::array&lt; std::array&lt; double, 10 &gt;, 20 &gt; &amp;A, std::array&lt; std::array&lt; double, 10 &gt;, 20 &gt; B)</div><div class="ttdef"><b>Definition</b> gram_schmidt.cpp:121</div></div>
-<div class="ttc" id="agram__schmidt_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> gram_schmidt.cpp:181</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d33/gram__schmidt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agram__schmidt_8cpp_html_a0837468e1a653ed056e2cce3c914afa5"><div class="ttname"><a href="#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a></div><div class="ttdeci">void gram_schmidt(int r, const int &amp;c, const std::array&lt; std::array&lt; double, 10 &gt;, 20 &gt; &amp;A, std::array&lt; std::array&lt; double, 10 &gt;, 20 &gt; B)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d33/gram__schmidt_8cpp_source.html#l00121">gram_schmidt.cpp:121</a></div></div>
+<div class="ttc" id="agram__schmidt_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d33/gram__schmidt_8cpp_source.html#l00181">gram_schmidt.cpp:181</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a8eeaafdde8b56f459aadc6013cf078bc" name="a8eeaafdde8b56f459aadc6013cf078bc"></a>
@@ -451,12 +456,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">double numerical_methods::gram_schmidt::projection </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>x</em></span>, </td>
+          <td class="paramtype">const std::array&lt; double, 10 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>x</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 10 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
+          <td class="paramtype">const std::array&lt; double, 10 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -478,24 +483,20 @@ Here is the call graph for this function:</div>
 <p>The dot product of two vectors is taken</p>
 <p>The norm of the second vector is taken.</p>
 <p>multiply that factor with every element in a 3rd vector, whose initial values are same as the 2nd vector.</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d33/gram__schmidt_8cpp_source.html#l00079">79</a> of file <a class="el" href="../../d5/d33/gram__schmidt_8cpp_source.html">gram_schmidt.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   80</span>                                                               {</div>
 <div class="line"><span class="lineno">   81</span>    <span class="keywordtype">double</span> dot =</div>
-<div class="line"><span class="lineno">   82</span>        <a class="code hl_function" href="#ac4a4504924ecc9f12a2ebd80788ec01d">dot_product</a>(x, y, c);  <span class="comment">/// The dot product of two vectors is taken</span></div>
+<div class="line"><span class="lineno">   82</span>        <a class="code hl_function" href="#ac4a4504924ecc9f12a2ebd80788ec01d">dot_product</a>(x, y, c);  </div>
 <div class="line"><span class="lineno">   83</span>    <span class="keywordtype">double</span> anorm =</div>
-<div class="line"><span class="lineno">   84</span>        <a class="code hl_function" href="#ac4a4504924ecc9f12a2ebd80788ec01d">dot_product</a>(y, y, c);  <span class="comment">/// The norm of the second vector is taken.</span></div>
+<div class="line"><span class="lineno">   84</span>        <a class="code hl_function" href="#ac4a4504924ecc9f12a2ebd80788ec01d">dot_product</a>(y, y, c);  </div>
 <div class="line"><span class="lineno">   85</span>    <span class="keywordtype">double</span> factor =</div>
 <div class="line"><span class="lineno">   86</span>        dot /</div>
-<div class="line"><span class="lineno">   87</span>        anorm;  <span class="comment">/// multiply that factor with every element in a 3rd vector,</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">   88</span><span class="comment">                /// whose initial values are same as the 2nd vector.</span></div>
-<div class="line"><span class="lineno">   89</span><span class="comment"></span>    <span class="keywordflow">return</span> factor;</div>
+<div class="line"><span class="lineno">   87</span>        anorm;  </div>
+<div class="line"><span class="lineno">   89</span>    <span class="keywordflow">return</span> factor;</div>
 <div class="line"><span class="lineno">   90</span>}</div>
-<div class="ttc" id="agram__schmidt_8cpp_html_ac4a4504924ecc9f12a2ebd80788ec01d"><div class="ttname"><a href="#ac4a4504924ecc9f12a2ebd80788ec01d">numerical_methods::gram_schmidt::dot_product</a></div><div class="ttdeci">double dot_product(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition</b> gram_schmidt.cpp:59</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d33/gram__schmidt_8cpp_a8eeaafdde8b56f459aadc6013cf078bc_cgraph.svg" width="406" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agram__schmidt_8cpp_html_ac4a4504924ecc9f12a2ebd80788ec01d"><div class="ttname"><a href="#ac4a4504924ecc9f12a2ebd80788ec01d">numerical_methods::gram_schmidt::dot_product</a></div><div class="ttdeci">double dot_product(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d33/gram__schmidt_8cpp_source.html#l00059">gram_schmidt.cpp:59</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -521,16 +522,18 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Test Function. Process has been tested for 3 Sample Inputs </p><dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d33/gram__schmidt_8cpp_source.html#l00181">181</a> of file <a class="el" href="../../d5/d33/gram__schmidt_8cpp_source.html">gram_schmidt.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  181</span>                   {</div>
-<div class="line"><span class="lineno">  182</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; a1 = {</div>
+<div class="line"><span class="lineno">  182</span>    std::array&lt;std::array&lt;double, 10&gt;, 20&gt; a1 = {</div>
 <div class="line"><span class="lineno">  183</span>        {{1, 0, 1, 0}, {1, 1, 1, 1}, {0, 1, 2, 1}}};</div>
-<div class="line"><span class="lineno">  184</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; b1 = {{0}};</div>
+<div class="line"><span class="lineno">  184</span>    std::array&lt;std::array&lt;double, 10&gt;, 20&gt; b1 = {{0}};</div>
 <div class="line"><span class="lineno">  185</span>    <span class="keywordtype">double</span> dot1 = 0;</div>
 <div class="line"><span class="lineno">  186</span>    <a class="code hl_function" href="#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a>(3, 4, a1, b1);</div>
 <div class="line"><span class="lineno">  187</span>    <span class="keywordtype">int</span> flag = 1;</div>
 <div class="line"><span class="lineno">  188</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 2; ++i) {</div>
 <div class="line"><span class="lineno">  189</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; 3; ++j) {</div>
-<div class="line"><span class="lineno">  190</span>            dot1 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">fabs</a>(</div>
+<div class="line"><span class="lineno">  190</span>            dot1 = fabs(</div>
 <div class="line"><span class="lineno">  191</span>                numerical_methods::gram_schmidt::dot_product(b1[i], b1[j], 4));</div>
 <div class="line"><span class="lineno">  192</span>            <span class="keywordflow">if</span> (dot1 &gt; 0.1) {</div>
 <div class="line"><span class="lineno">  193</span>                flag = 0;</div>
@@ -539,18 +542,18 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  196</span>        }</div>
 <div class="line"><span class="lineno">  197</span>    }</div>
 <div class="line"><span class="lineno">  198</span>    <span class="keywordflow">if</span> (flag == 0)</div>
-<div class="line"><span class="lineno">  199</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  199</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  200</span>    assert(flag == 1);</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> &lt;&lt; <span class="stringliteral">&quot;Passed Test Case 1\n &quot;</span>;</div>
+<div class="line"><span class="lineno">  201</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test Case 1\n &quot;</span>;</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/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; a2 = {{{3, 1}, {2, 2}}};</div>
-<div class="line"><span class="lineno">  204</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; b2 = {{0}};</div>
+<div class="line"><span class="lineno">  203</span>    std::array&lt;std::array&lt;double, 10&gt;, 20&gt; a2 = {{{3, 1}, {2, 2}}};</div>
+<div class="line"><span class="lineno">  204</span>    std::array&lt;std::array&lt;double, 10&gt;, 20&gt; b2 = {{0}};</div>
 <div class="line"><span class="lineno">  205</span>    <span class="keywordtype">double</span> dot2 = 0;</div>
 <div class="line"><span class="lineno">  206</span>    <a class="code hl_function" href="#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a>(2, 2, a2, b2);</div>
 <div class="line"><span class="lineno">  207</span>    flag = 1;</div>
 <div class="line"><span class="lineno">  208</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 1; ++i) {</div>
 <div class="line"><span class="lineno">  209</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; 2; ++j) {</div>
-<div class="line"><span class="lineno">  210</span>            dot2 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">fabs</a>(</div>
+<div class="line"><span class="lineno">  210</span>            dot2 = fabs(</div>
 <div class="line"><span class="lineno">  211</span>                numerical_methods::gram_schmidt::dot_product(b2[i], b2[j], 2));</div>
 <div class="line"><span class="lineno">  212</span>            <span class="keywordflow">if</span> (dot2 &gt; 0.1) {</div>
 <div class="line"><span class="lineno">  213</span>                flag = 0;</div>
@@ -559,18 +562,18 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  216</span>        }</div>
 <div class="line"><span class="lineno">  217</span>    }</div>
 <div class="line"><span class="lineno">  218</span>    <span class="keywordflow">if</span> (flag == 0)</div>
-<div class="line"><span class="lineno">  219</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  219</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  220</span>    assert(flag == 1);</div>
-<div class="line"><span class="lineno">  221</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test Case 2\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  221</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test Case 2\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  222</span> </div>
-<div class="line"><span class="lineno">  223</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; a3 = {{{1, 2, 2}, {-4, 3, 2}}};</div>
-<div class="line"><span class="lineno">  224</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; b3 = {{0}};</div>
+<div class="line"><span class="lineno">  223</span>    std::array&lt;std::array&lt;double, 10&gt;, 20&gt; a3 = {{{1, 2, 2}, {-4, 3, 2}}};</div>
+<div class="line"><span class="lineno">  224</span>    std::array&lt;std::array&lt;double, 10&gt;, 20&gt; b3 = {{0}};</div>
 <div class="line"><span class="lineno">  225</span>    <span class="keywordtype">double</span> dot3 = 0;</div>
 <div class="line"><span class="lineno">  226</span>    <a class="code hl_function" href="#a0837468e1a653ed056e2cce3c914afa5">numerical_methods::gram_schmidt::gram_schmidt</a>(2, 3, a3, b3);</div>
 <div class="line"><span class="lineno">  227</span>    flag = 1;</div>
 <div class="line"><span class="lineno">  228</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 1; ++i) {</div>
 <div class="line"><span class="lineno">  229</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; 2; ++j) {</div>
-<div class="line"><span class="lineno">  230</span>            dot3 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">fabs</a>(</div>
+<div class="line"><span class="lineno">  230</span>            dot3 = fabs(</div>
 <div class="line"><span class="lineno">  231</span>                numerical_methods::gram_schmidt::dot_product(b3[i], b3[j], 3));</div>
 <div class="line"><span class="lineno">  232</span>            <span class="keywordflow">if</span> (dot3 &gt; 0.1) {</div>
 <div class="line"><span class="lineno">  233</span>                flag = 0;</div>
@@ -579,9 +582,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  236</span>        }</div>
 <div class="line"><span class="lineno">  237</span>    }</div>
 <div class="line"><span class="lineno">  238</span>    <span class="keywordflow">if</span> (flag == 0)</div>
-<div class="line"><span class="lineno">  239</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  239</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  240</span>    assert(flag == 1);</div>
-<div class="line"><span class="lineno">  241</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test Case 3\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  241</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test Case 3\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  242</span>}</div>
 </div><!-- fragment -->
 </div>
diff --git a/d5/d33/gram__schmidt_8cpp_a0837468e1a653ed056e2cce3c914afa5_cgraph.map b/d5/d33/gram__schmidt_8cpp_a0837468e1a653ed056e2cce3c914afa5_cgraph.map
deleted file mode 100644
index 14688a703..000000000
--- a/d5/d33/gram__schmidt_8cpp_a0837468e1a653ed056e2cce3c914afa5_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="numerical_methods::gram_schmidt::gram_schmidt" name="numerical_methods::gram_schmidt::gram_schmidt">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,199,70"/>
-<area shape="rect" id="Node000002" href="$d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc" title=" " alt="" coords="247,29,414,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="199,47,231,47,231,52,199,52"/>
-<area shape="poly" id="edge4_Node000002_Node000002" title=" " alt="" coords="289,29,286,19,293,10,308,5,330,3,354,5,369,11,366,16,353,10,330,8,309,10,296,15,292,21,294,28"/>
-<area shape="rect" id="Node000003" href="$d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d" title=" " alt="" coords="462,29,641,70"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="414,47,446,47,446,52,414,52"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="510,29,508,19,515,10,529,5,552,3,576,5,590,11,588,16,574,10,552,8,531,10,518,15,513,21,515,28"/>
-</map>
diff --git a/d5/d33/gram__schmidt_8cpp_a0837468e1a653ed056e2cce3c914afa5_cgraph.md5 b/d5/d33/gram__schmidt_8cpp_a0837468e1a653ed056e2cce3c914afa5_cgraph.md5
deleted file mode 100644
index 5e5ff05aa..000000000
--- a/d5/d33/gram__schmidt_8cpp_a0837468e1a653ed056e2cce3c914afa5_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bd9b851c8245b97404000fce71dce0e9
\ No newline at end of file
diff --git a/d5/d33/gram__schmidt_8cpp_a0837468e1a653ed056e2cce3c914afa5_cgraph.svg b/d5/d33/gram__schmidt_8cpp_a0837468e1a653ed056e2cce3c914afa5_cgraph.svg
deleted file mode 100644
index 257ce6783..000000000
--- a/d5/d33/gram__schmidt_8cpp_a0837468e1a653ed056e2cce3c914afa5_cgraph.svg
+++ /dev/null
@@ -1,104 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::gram_schmidt::gram_schmidt Pages: 1 -->
-<svg width="485pt" height="57pt"
- viewBox="0.00 0.00 485.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>numerical_methods::gram_schmidt::gram_schmidt</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="145,-30.5 0,-30.5 0,0 145,0 145,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="72.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gram_schmidt::gram_schmidt</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306.5,-30.5 181,-30.5 181,0 306.5,0 306.5,-30.5"/>
-<text text-anchor="start" x="189" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="243.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gram_schmidt::projection</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.28,-15.25C153.3,-15.25 161.48,-15.25 169.52,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.25,-18.75 179.25,-15.25 169.25,-11.75 169.25,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge4_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge4_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.33,-30.99C208.33,-40.06 218.14,-48.5 243.75,-48.5 257.76,-48.5 267.04,-45.97 271.59,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="275.03,-42.87 272.95,-32.48 268.1,-41.9 275.03,-42.87"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="477,-30.5 342.5,-30.5 342.5,0 477,0 477,-30.5"/>
-<text text-anchor="start" x="350.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="409.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gram_schmidt::dot_product</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M306.75,-15.25C314.58,-15.25 322.67,-15.25 330.71,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="330.49,-18.75 340.49,-15.25 330.49,-11.75 330.49,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.33,-30.99C374.33,-40.06 384.14,-48.5 409.75,-48.5 423.76,-48.5 433.04,-45.97 437.59,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="441.03,-42.87 438.95,-32.48 434.1,-41.9 441.03,-42.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d33/gram__schmidt_8cpp_a0837468e1a653ed056e2cce3c914afa5_cgraph_org.svg b/d5/d33/gram__schmidt_8cpp_a0837468e1a653ed056e2cce3c914afa5_cgraph_org.svg
deleted file mode 100644
index c4422694b..000000000
--- a/d5/d33/gram__schmidt_8cpp_a0837468e1a653ed056e2cce3c914afa5_cgraph_org.svg
+++ /dev/null
@@ -1,78 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::gram_schmidt::gram_schmidt Pages: 1 -->
-<svg width="485pt" height="57pt"
- viewBox="0.00 0.00 485.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>numerical_methods::gram_schmidt::gram_schmidt</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="145,-30.5 0,-30.5 0,0 145,0 145,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="72.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gram_schmidt::gram_schmidt</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306.5,-30.5 181,-30.5 181,0 306.5,0 306.5,-30.5"/>
-<text text-anchor="start" x="189" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="243.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gram_schmidt::projection</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.28,-15.25C153.3,-15.25 161.48,-15.25 169.52,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.25,-18.75 179.25,-15.25 169.25,-11.75 169.25,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge4_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge4_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.33,-30.99C208.33,-40.06 218.14,-48.5 243.75,-48.5 257.76,-48.5 267.04,-45.97 271.59,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="275.03,-42.87 272.95,-32.48 268.1,-41.9 275.03,-42.87"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="477,-30.5 342.5,-30.5 342.5,0 477,0 477,-30.5"/>
-<text text-anchor="start" x="350.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="409.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gram_schmidt::dot_product</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M306.75,-15.25C314.58,-15.25 322.67,-15.25 330.71,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="330.49,-18.75 340.49,-15.25 330.49,-11.75 330.49,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.33,-30.99C374.33,-40.06 384.14,-48.5 409.75,-48.5 423.76,-48.5 433.04,-45.97 437.59,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="441.03,-42.87 438.95,-32.48 434.1,-41.9 441.03,-42.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d33/gram__schmidt_8cpp_a8eeaafdde8b56f459aadc6013cf078bc_cgraph.map b/d5/d33/gram__schmidt_8cpp_a8eeaafdde8b56f459aadc6013cf078bc_cgraph.map
deleted file mode 100644
index 22ad7940b..000000000
--- a/d5/d33/gram__schmidt_8cpp_a8eeaafdde8b56f459aadc6013cf078bc_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="numerical_methods::gram_schmidt::projection" name="numerical_methods::gram_schmidt::projection">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,173,70"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="47,29,45,19,52,10,67,5,89,3,113,5,127,11,125,16,112,10,89,8,68,10,55,15,50,21,52,28"/>
-<area shape="rect" id="Node000002" href="$d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d" title=" " alt="" coords="221,29,400,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="173,47,205,47,205,52,173,52"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="269,29,266,19,273,10,288,5,310,3,334,5,349,11,346,16,333,10,310,8,289,10,276,15,272,21,274,28"/>
-</map>
diff --git a/d5/d33/gram__schmidt_8cpp_a8eeaafdde8b56f459aadc6013cf078bc_cgraph.md5 b/d5/d33/gram__schmidt_8cpp_a8eeaafdde8b56f459aadc6013cf078bc_cgraph.md5
deleted file mode 100644
index fa7809c33..000000000
--- a/d5/d33/gram__schmidt_8cpp_a8eeaafdde8b56f459aadc6013cf078bc_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-70d6813c99a2b6643f436809d9496f78
\ No newline at end of file
diff --git a/d5/d33/gram__schmidt_8cpp_a8eeaafdde8b56f459aadc6013cf078bc_cgraph.svg b/d5/d33/gram__schmidt_8cpp_a8eeaafdde8b56f459aadc6013cf078bc_cgraph.svg
deleted file mode 100644
index 2844e17e6..000000000
--- a/d5/d33/gram__schmidt_8cpp_a8eeaafdde8b56f459aadc6013cf078bc_cgraph.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::gram_schmidt::projection Pages: 1 -->
-<svg width="304pt" height="57pt"
- viewBox="0.00 0.00 304.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>numerical_methods::gram_schmidt::projection</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="125.5,-30.5 0,-30.5 0,0 125.5,0 125.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="62.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gram_schmidt::projection</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.33,-30.99C27.33,-40.06 37.14,-48.5 62.75,-48.5 76.76,-48.5 86.04,-45.97 90.59,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.03,-42.87 91.95,-32.48 87.1,-41.9 94.03,-42.87"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296,-30.5 161.5,-30.5 161.5,0 296,0 296,-30.5"/>
-<text text-anchor="start" x="169.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="228.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gram_schmidt::dot_product</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.75,-15.25C133.58,-15.25 141.67,-15.25 149.71,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.49,-18.75 159.49,-15.25 149.49,-11.75 149.49,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.33,-30.99C193.33,-40.06 203.14,-48.5 228.75,-48.5 242.76,-48.5 252.04,-45.97 256.59,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.03,-42.87 257.95,-32.48 253.1,-41.9 260.03,-42.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d33/gram__schmidt_8cpp_a8eeaafdde8b56f459aadc6013cf078bc_cgraph_org.svg b/d5/d33/gram__schmidt_8cpp_a8eeaafdde8b56f459aadc6013cf078bc_cgraph_org.svg
deleted file mode 100644
index 1fbc913b0..000000000
--- a/d5/d33/gram__schmidt_8cpp_a8eeaafdde8b56f459aadc6013cf078bc_cgraph_org.svg
+++ /dev/null
@@ -1,59 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::gram_schmidt::projection Pages: 1 -->
-<svg width="304pt" height="57pt"
- viewBox="0.00 0.00 304.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>numerical_methods::gram_schmidt::projection</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="125.5,-30.5 0,-30.5 0,0 125.5,0 125.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="62.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gram_schmidt::projection</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.33,-30.99C27.33,-40.06 37.14,-48.5 62.75,-48.5 76.76,-48.5 86.04,-45.97 90.59,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.03,-42.87 91.95,-32.48 87.1,-41.9 94.03,-42.87"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296,-30.5 161.5,-30.5 161.5,0 296,0 296,-30.5"/>
-<text text-anchor="start" x="169.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="228.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gram_schmidt::dot_product</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.75,-15.25C133.58,-15.25 141.67,-15.25 149.71,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.49,-18.75 159.49,-15.25 149.49,-11.75 149.49,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.33,-30.99C193.33,-40.06 203.14,-48.5 228.75,-48.5 242.76,-48.5 252.04,-45.97 256.59,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.03,-42.87 257.95,-32.48 253.1,-41.9 260.03,-42.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d33/gram__schmidt_8cpp_ac4a4504924ecc9f12a2ebd80788ec01d_cgraph.map b/d5/d33/gram__schmidt_8cpp_ac4a4504924ecc9f12a2ebd80788ec01d_cgraph.map
deleted file mode 100644
index 51dc2b851..000000000
--- a/d5/d33/gram__schmidt_8cpp_ac4a4504924ecc9f12a2ebd80788ec01d_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="numerical_methods::gram_schmidt::dot_product" name="numerical_methods::gram_schmidt::dot_product">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,185,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="61,29,59,19,65,10,77,5,95,3,115,5,126,11,124,16,113,10,95,8,78,10,68,14,64,20,66,28"/>
-</map>
diff --git a/d5/d33/gram__schmidt_8cpp_ac4a4504924ecc9f12a2ebd80788ec01d_cgraph.md5 b/d5/d33/gram__schmidt_8cpp_ac4a4504924ecc9f12a2ebd80788ec01d_cgraph.md5
deleted file mode 100644
index fed1163a0..000000000
--- a/d5/d33/gram__schmidt_8cpp_ac4a4504924ecc9f12a2ebd80788ec01d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-21c6f10f501e2f1df25a491d53bc57e4
\ No newline at end of file
diff --git a/d5/d33/gram__schmidt_8cpp_ac4a4504924ecc9f12a2ebd80788ec01d_cgraph.svg b/d5/d33/gram__schmidt_8cpp_ac4a4504924ecc9f12a2ebd80788ec01d_cgraph.svg
deleted file mode 100644
index 90499dfa3..000000000
--- a/d5/d33/gram__schmidt_8cpp_ac4a4504924ecc9f12a2ebd80788ec01d_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::gram_schmidt::dot_product Pages: 1 -->
-<svg width="143pt" height="57pt"
- viewBox="0.00 0.00 142.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>numerical_methods::gram_schmidt::dot_product</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="134.5,-30.5 0,-30.5 0,0 134.5,0 134.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="67.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gram_schmidt::dot_product</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.42,-30.99C38.55,-40.06 46.5,-48.5 67.25,-48.5 78.6,-48.5 86.12,-45.97 89.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.26,-42.82 90.91,-32.49 86.3,-42.03 93.26,-42.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d33/gram__schmidt_8cpp_ac4a4504924ecc9f12a2ebd80788ec01d_cgraph_org.svg b/d5/d33/gram__schmidt_8cpp_ac4a4504924ecc9f12a2ebd80788ec01d_cgraph_org.svg
deleted file mode 100644
index 7ac72afbb..000000000
--- a/d5/d33/gram__schmidt_8cpp_ac4a4504924ecc9f12a2ebd80788ec01d_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::gram_schmidt::dot_product Pages: 1 -->
-<svg width="143pt" height="57pt"
- viewBox="0.00 0.00 142.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>numerical_methods::gram_schmidt::dot_product</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="134.5,-30.5 0,-30.5 0,0 134.5,0 134.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="67.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gram_schmidt::dot_product</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.42,-30.99C38.55,-40.06 46.5,-48.5 67.25,-48.5 78.6,-48.5 86.12,-45.97 89.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.26,-42.82 90.91,-32.49 86.3,-42.03 93.26,-42.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d33/gram__schmidt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/d33/gram__schmidt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 4dd8c13af..000000000
--- a/d5/d33/gram__schmidt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main Function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title=" " alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d5/d33/gram__schmidt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/d33/gram__schmidt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 85c24eac7..000000000
--- a/d5/d33/gram__schmidt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8cc10a9738c389f1f83a0de0740808e0
\ No newline at end of file
diff --git a/d5/d33/gram__schmidt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/d33/gram__schmidt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 4ff2dd482..000000000
--- a/d5/d33/gram__schmidt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main Function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d33/gram__schmidt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/d33/gram__schmidt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index c84e58c05..000000000
--- a/d5/d33/gram__schmidt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main Function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d33/gram__schmidt_8cpp_source.html b/d5/d33/gram__schmidt_8cpp_source.html
new file mode 100644
index 000000000..d4dd6bb7b
--- /dev/null
+++ b/d5/d33/gram__schmidt_8cpp_source.html
@@ -0,0 +1,354 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/gram_schmidt.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/d33/gram__schmidt_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">gram_schmidt.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d5/d33/gram__schmidt_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;array&gt;</span>     </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#include &lt;cmath&gt;</span>     </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#include &quot;math.h&quot;</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a> {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d4/d0f/namespacegram__schmidt.html">gram_schmidt</a> {</div>
+<div class="foldopen" id="foldopen00059" data-start="{" data-end="}">
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d">   59</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d">dot_product</a>(<span class="keyword">const</span> std::array&lt;double, 10&gt;&amp; x,</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>                   <span class="keyword">const</span> std::array&lt;double, 10&gt;&amp; y, <span class="keyword">const</span> <span class="keywordtype">int</span>&amp; c) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordtype">double</span> sum = 0;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; c; ++i) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        sum += x[i] * y[i];</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordflow">return</span> sum;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>}</div>
+</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="foldopen" id="foldopen00079" data-start="{" data-end="}">
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="../../d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc">   79</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc">projection</a>(<span class="keyword">const</span> std::array&lt;double, 10&gt;&amp; x,</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>                  <span class="keyword">const</span> std::array&lt;double, 10&gt;&amp; y, <span class="keyword">const</span> <span class="keywordtype">int</span>&amp; c) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keywordtype">double</span> dot =</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <a class="code hl_function" href="../../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d">dot_product</a>(x, y, c);  </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordtype">double</span> anorm =</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        <a class="code hl_function" href="../../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d">dot_product</a>(y, y, c);  </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keywordtype">double</span> factor =</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        dot /</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        anorm;  </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keywordflow">return</span> factor;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>}</div>
+</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="foldopen" id="foldopen00101" data-start="{" data-end="}">
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"><a class="line" href="../../d5/d33/gram__schmidt_8cpp.html#ae6b496dce691e04f7f95ba0f0d33a289">  101</a></span><span class="keywordtype">void</span> display(<span class="keyword">const</span> <span class="keywordtype">int</span>&amp; r, <span class="keyword">const</span> <span class="keywordtype">int</span>&amp; c,</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>             <span class="keyword">const</span> std::array&lt;std::array&lt;double, 10&gt;, 20&gt;&amp; B) {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; r; ++i) {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Vector &quot;</span> &lt;&lt; i + 1 &lt;&lt; <span class="stringliteral">&quot;: &quot;</span>;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; c; ++j) {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>            std::cout &lt;&lt; B[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        }</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    }</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>}</div>
+</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="foldopen" id="foldopen00121" data-start="{" data-end="}">
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"><a class="line" href="../../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5">  121</a></span><span class="keywordtype">void</span> <a class="code hl_namespace" href="../../d4/d0f/namespacegram__schmidt.html">gram_schmidt</a>(<span class="keywordtype">int</span> r, <span class="keyword">const</span> <span class="keywordtype">int</span>&amp; c,</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>                  <span class="keyword">const</span> std::array&lt;std::array&lt;double, 10&gt;, 20&gt;&amp; A,</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>                  std::array&lt;std::array&lt;double, 10&gt;, 20&gt; B) {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    <span class="keywordflow">if</span> (c &lt; r) {  </div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Dimension of vector is less than number of vector, hence &quot;</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>                     <span class="stringliteral">&quot;\n first &quot;</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>                  &lt;&lt; c &lt;&lt; <span class="stringliteral">&quot; vectors are orthogonalised\n&quot;</span>;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        r = c;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    }</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <span class="keywordtype">int</span> k = 1;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <span class="keywordflow">while</span> (k &lt;= r) {</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>        <span class="keywordflow">if</span> (k == 1) {</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; c; j++)</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>                B[0][j] = A[0][j];  </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        }</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>        <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>            std::array&lt;double, 10&gt;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>                all_projection{};  </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; c; ++i) {</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>                all_projection[i] = 0;  </div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>            }</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span> </div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>            <span class="keywordtype">int</span> l = 1;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>            <span class="keywordflow">while</span> (l &lt; k) {</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>                std::array&lt;double, 10&gt;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>                    temp{};           </div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>                <span class="keywordtype">double</span> factor = NAN;  </div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>                factor = <a class="code hl_function" href="../../d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc">projection</a>(A[k - 1], B[l - 1], c);</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; c; ++i) {</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>                    temp[i] = B[l - 1][i] * factor;  </div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>                }</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; c; ++j) {</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>                    all_projection[j] =</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>                        all_projection[j] +</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>                        temp[j];  </div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>                }</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>                l++;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>            }</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; c; ++i) {</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>                B[k - 1][i] =</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>                    A[k - 1][i] -</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>                    all_projection[i];  </div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>            }</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        }</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>        k++;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    }</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    display(r, c, B);  <span class="comment">// for displaying orthogoanlised vectors</span></div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>}</div>
+</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>}  <span class="comment">// namespace gram_schmidt</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>}  <span class="comment">// namespace numerical_methods</span></div>
+<div class="foldopen" id="foldopen00181" data-start="{" data-end="}">
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"><a class="line" href="../../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  181</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    std::array&lt;std::array&lt;double, 10&gt;, 20&gt; a1 = {</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>        {{1, 0, 1, 0}, {1, 1, 1, 1}, {0, 1, 2, 1}}};</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    std::array&lt;std::array&lt;double, 10&gt;, 20&gt; b1 = {{0}};</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    <span class="keywordtype">double</span> dot1 = 0;</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    numerical_methods::gram_schmidt::gram_schmidt(3, 4, a1, b1);</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    <span class="keywordtype">int</span> flag = 1;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 2; ++i) {</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; 3; ++j) {</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>            dot1 = fabs(</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>                numerical_methods::gram_schmidt::dot_product(b1[i], b1[j], 4));</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>            <span class="keywordflow">if</span> (dot1 &gt; 0.1) {</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>                flag = 0;</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>            }</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>        }</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    }</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    <span class="keywordflow">if</span> (flag == 0)</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span>;</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    assert(flag == 1);</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test Case 1\n &quot;</span>;</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span> </div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    std::array&lt;std::array&lt;double, 10&gt;, 20&gt; a2 = {{{3, 1}, {2, 2}}};</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    std::array&lt;std::array&lt;double, 10&gt;, 20&gt; b2 = {{0}};</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    <span class="keywordtype">double</span> dot2 = 0;</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    numerical_methods::gram_schmidt::gram_schmidt(2, 2, a2, b2);</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    flag = 1;</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 1; ++i) {</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; 2; ++j) {</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>            dot2 = fabs(</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>                numerical_methods::gram_schmidt::dot_product(b2[i], b2[j], 2));</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>            <span class="keywordflow">if</span> (dot2 &gt; 0.1) {</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>                flag = 0;</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>            }</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>        }</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    }</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    <span class="keywordflow">if</span> (flag == 0)</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span>;</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    assert(flag == 1);</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test Case 2\n&quot;</span>;</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span> </div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    std::array&lt;std::array&lt;double, 10&gt;, 20&gt; a3 = {{{1, 2, 2}, {-4, 3, 2}}};</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    std::array&lt;std::array&lt;double, 10&gt;, 20&gt; b3 = {{0}};</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    <span class="keywordtype">double</span> dot3 = 0;</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    numerical_methods::gram_schmidt::gram_schmidt(2, 3, a3, b3);</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    flag = 1;</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 1; ++i) {</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; 2; ++j) {</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>            dot3 = fabs(</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>                numerical_methods::gram_schmidt::dot_product(b3[i], b3[j], 3));</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>            <span class="keywordflow">if</span> (dot3 &gt; 0.1) {</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>                flag = 0;</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>            }</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>        }</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    }</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    <span class="keywordflow">if</span> (flag == 0)</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span>;</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    assert(flag == 1);</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test Case 3\n&quot;</span>;</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>}</div>
+</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span> </div>
+<div class="foldopen" id="foldopen00248" data-start="{" data-end="}">
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"><a class="line" href="../../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  248</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    <span class="keywordtype">int</span> r = 0, c = 0;</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    <a class="code hl_function" href="../../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// perform self tests</span></div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the dimension of your vectors\n&quot;</span>;</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    std::cin &gt;&gt; c;</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of vectors you will enter\n&quot;</span>;</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>    std::cin &gt;&gt; r;</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span> </div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    std::array&lt;std::array&lt;double, 10&gt;, 20&gt;</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>        A{};  </div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    std::array&lt;std::array&lt;double, 10&gt;, 20&gt; B = {</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>        {0}};  </div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; r; ++i) {</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter vector &quot;</span> &lt;&lt; i + 1</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>                  &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;  </div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; c; ++j) {</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Value &quot;</span> &lt;&lt; j + 1 &lt;&lt; <span class="stringliteral">&quot;th of vector: &quot;</span>;</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>            std::cin &gt;&gt; A[i][j];</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>        }</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>        std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>    }</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span> </div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    numerical_methods::gram_schmidt::gram_schmidt(r, c, A, B);</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span> </div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>    <span class="keywordtype">double</span> dot = 0;</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>    <span class="keywordtype">int</span> flag = 1;  </div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; r - 1; ++i) {</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; r; ++j) {</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>            dot = fabs(</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>                numerical_methods::gram_schmidt::dot_product(B[i], B[j], c));</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>            <span class="keywordflow">if</span> (dot &gt; 0.1)  </div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>            {</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>                flag = 0;</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>            }</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>        }</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>    }</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>    <span class="keywordflow">if</span> (flag == 0)</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span>;</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>}</div>
+</div>
+<div class="ttc" id="agram__schmidt_8cpp_html_a8eeaafdde8b56f459aadc6013cf078bc"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc">numerical_methods::gram_schmidt::projection</a></div><div class="ttdeci">double projection(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition</b> <a href="#l00079">gram_schmidt.cpp:79</a></div></div>
+<div class="ttc" id="agram__schmidt_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00181">gram_schmidt.cpp:181</a></div></div>
+<div class="ttc" id="agram__schmidt_8cpp_html_ac4a4504924ecc9f12a2ebd80788ec01d"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d">numerical_methods::gram_schmidt::dot_product</a></div><div class="ttdeci">double dot_product(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition</b> <a href="#l00059">gram_schmidt.cpp:59</a></div></div>
+<div class="ttc" id="agram__schmidt_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main Function.</div><div class="ttdef"><b>Definition</b> <a href="#l00248">gram_schmidt.cpp:248</a></div></div>
+<div class="ttc" id="anamespacegram__schmidt_html"><div class="ttname"><a href="../../d4/d0f/namespacegram__schmidt.html">gram_schmidt</a></div><div class="ttdoc">Functions for Gram Schmidt Orthogonalisation Process</div></div>
+<div class="ttc" id="anamespacenumerical__methods_html"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></div><div class="ttdoc">for assert</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../d5/d33/gram__schmidt_8cpp.html">gram_schmidt.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/d39/namespaceactivations.html b/d5/d39/namespaceactivations.html
index dcd1f173e..963b77027 100644
--- a/d5/d39/namespaceactivations.html
+++ b/d5/d39/namespaceactivations.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: activations Namespace Reference</title>
+<title>TheAlgorithms/C++: activations Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d5/d3c/namespacedata__structures.html b/d5/d3c/namespacedata__structures.html
index 3ad71ada8..f4227f5f6 100644
--- a/d5/d3c/namespacedata__structures.html
+++ b/d5/d3c/namespacedata__structures.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures Namespace Reference</title>
+<title>TheAlgorithms/C++: data_structures Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -146,59 +163,57 @@ Classes</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a271c753baf6dc5ac6f19fa03c5873eb4" id="r_a271c753baf6dc5ac6f19fa03c5873eb4"><td class="memItemLeft" align="right" valign="top">static <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a271c753baf6dc5ac6f19fa03c5873eb4">hashDJB2</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> const &amp;s)</td></tr>
+<tr class="memitem:a271c753baf6dc5ac6f19fa03c5873eb4" id="r_a271c753baf6dc5ac6f19fa03c5873eb4"><td class="memItemLeft" align="right" valign="top">static std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a271c753baf6dc5ac6f19fa03c5873eb4">hashDJB2</a> (std::string const &amp;s)</td></tr>
 <tr class="memdesc:a271c753baf6dc5ac6f19fa03c5873eb4"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="http://www.cse.yorku.ca/~oz/hash.html" target="_blank">Function djb2</a> to get hash for the given string.  <br /></td></tr>
 <tr class="separator:a271c753baf6dc5ac6f19fa03c5873eb4"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a35eb2bc3edbb52f9c5f0b1e51046ef15" id="r_a35eb2bc3edbb52f9c5f0b1e51046ef15"><td class="memItemLeft" align="right" valign="top">static <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a35eb2bc3edbb52f9c5f0b1e51046ef15">hashStr</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> const &amp;s)</td></tr>
+<tr class="memitem:a35eb2bc3edbb52f9c5f0b1e51046ef15" id="r_a35eb2bc3edbb52f9c5f0b1e51046ef15"><td class="memItemLeft" align="right" valign="top">static std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a35eb2bc3edbb52f9c5f0b1e51046ef15">hashStr</a> (std::string const &amp;s)</td></tr>
 <tr class="memdesc:a35eb2bc3edbb52f9c5f0b1e51046ef15"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://stackoverflow.com/questions/8317508/hash-function-for-a-string" target="_blank">Hash function</a>, to get hash for the given string.  <br /></td></tr>
 <tr class="separator:a35eb2bc3edbb52f9c5f0b1e51046ef15"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa6deb9d4a0f63ea97aef3dce4c6c6677" id="r_aa6deb9d4a0f63ea97aef3dce4c6c6677"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa6deb9d4a0f63ea97aef3dce4c6c6677">hashInt_1</a> (int x)</td></tr>
+<tr class="memitem:aa6deb9d4a0f63ea97aef3dce4c6c6677" id="r_aa6deb9d4a0f63ea97aef3dce4c6c6677"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa6deb9d4a0f63ea97aef3dce4c6c6677">hashInt_1</a> (int x)</td></tr>
 <tr class="memdesc:aa6deb9d4a0f63ea97aef3dce4c6c6677"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://stackoverflow.com/questions/664014/what-integer-hash-function-are-good-that-accepts-an-integer-hash-key" target="_blank">Hash function for test</a>  <br /></td></tr>
 <tr class="separator:aa6deb9d4a0f63ea97aef3dce4c6c6677"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a9ed236419034917c5270c1dccd220b5c" id="r_a9ed236419034917c5270c1dccd220b5c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9ed236419034917c5270c1dccd220b5c">hashInt_2</a> (int x)</td></tr>
+<tr class="memitem:a9ed236419034917c5270c1dccd220b5c" id="r_a9ed236419034917c5270c1dccd220b5c"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9ed236419034917c5270c1dccd220b5c">hashInt_2</a> (int x)</td></tr>
 <tr class="memdesc:a9ed236419034917c5270c1dccd220b5c"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://stackoverflow.com/questions/664014/what-integer-hash-function-are-good-that-accepts-an-integer-hash-key" target="_blank">Hash function for test</a>  <br /></td></tr>
 <tr class="separator:a9ed236419034917c5270c1dccd220b5c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:ac0d7e0be24da9f41bcb19745873c436a" id="r_ac0d7e0be24da9f41bcb19745873c436a"><td class="memItemLeft" align="right" valign="top"><a id="ac0d7e0be24da9f41bcb19745873c436a" name="ac0d7e0be24da9f41bcb19745873c436a"></a>
-constexpr int&#160;</td><td class="memItemRight" valign="bottom"><b>MAX_LEVEL</b> = 2</td></tr>
-<tr class="memdesc:ac0d7e0be24da9f41bcb19745873c436a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Maximum level of skip list. <br /></td></tr>
+<tr class="memitem:ac0d7e0be24da9f41bcb19745873c436a" id="r_ac0d7e0be24da9f41bcb19745873c436a"><td class="memItemLeft" align="right" valign="top">constexpr int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac0d7e0be24da9f41bcb19745873c436a">MAX_LEVEL</a> = 2</td></tr>
+<tr class="memdesc:ac0d7e0be24da9f41bcb19745873c436a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Maximum level of skip list.  <br /></td></tr>
 <tr class="separator:ac0d7e0be24da9f41bcb19745873c436a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a903639d8e6f955dd8d5c263781455d61" id="r_a903639d8e6f955dd8d5c263781455d61"><td class="memItemLeft" align="right" valign="top"><a id="a903639d8e6f955dd8d5c263781455d61" name="a903639d8e6f955dd8d5c263781455d61"></a>
-constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILITY</b> = 0.5</td></tr>
-<tr class="memdesc:a903639d8e6f955dd8d5c263781455d61"><td class="mdescLeft">&#160;</td><td class="mdescRight">Current probability for "coin toss". <br /></td></tr>
+<tr class="memitem:a903639d8e6f955dd8d5c263781455d61" id="r_a903639d8e6f955dd8d5c263781455d61"><td class="memItemLeft" align="right" valign="top">constexpr float&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a903639d8e6f955dd8d5c263781455d61">PROBABILITY</a> = 0.5</td></tr>
+<tr class="memdesc:a903639d8e6f955dd8d5c263781455d61"><td class="mdescLeft">&#160;</td><td class="mdescRight">Current probability for "coin toss".  <br /></td></tr>
 <tr class="separator:a903639d8e6f955dd8d5c263781455d61"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>for IO operations </p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>for std::vector</p>
 <p><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html" title="Class representation of a stack.">Stack</a> Data Structure Using the <a class="el" href="../../dc/db5/struct_queue.html">Queue</a> Data Structure.</p>
-<p>For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a>.</p>
+<p>For std::out_of_range.</p>
 <p>Data-structure algorithms.</p>
 <p>For assert.</p>
 <p>for managing dynamic storage</p>
 <p>Algorithms with data structures.</p>
 <p>for assert</p>
 <p>Data Structures algorithms.</p>
-<p>for assert for list of hash functions for bloom filter constructor for initializer_list for bloom filter constructor for testing on strings for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>for assert for list of hash functions for bloom filter constructor for initializer_list for bloom filter constructor for testing on strings for std::vector</p>
 <p>Data Structures algorithms</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for io operations</p>
+<p>for std::array for io operations</p>
 <p>Algorithms with data structures</p>
 <p>for assert for I/O operations</p>
 <p>Data Structures 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 <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a> and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for IO operations</p>
+<p>For IO operations For std::vector For std::min and std::max</p>
+<p>for std::array for IO operations</p>
 <p>Data Structures algorithms</p>
-<p>For std::assert For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a></p>
+<p>For std::assert For std::cout For std::unique_ptr</p>
 <p><a class="el" href="../../d5/d3c/namespacedata__structures.html" title="for IO operations">data_structures</a></p>
 <p>Using 2 Queues inside the <a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html" title="Class representation of a stack.">Stack</a> class, we can easily implement <a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html" title="Class representation of a stack.">Stack</a> data structure with heavy computation in push function.</p>
 <p>References used: <a href="https://www.studytonight.com/data-structures/stack-using-queue" target="_blank">StudyTonight</a> </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/tushar2407" target="_blank">tushar2407</a> for assert for IO operations for queue data structure</dd></dl>
 <p>Data structures algorithms</p>
 <p>For array For IO operations</p>
 <p>Data Structures</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html">std::to_string</a></p>
-<p>for assert for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a></p>
+<p>for std::array for assert for std::ofstream for std::cout for std::unique_ptr for std::queue for std::to_string</p>
+<p>for assert for IO operations for std::shared_ptr for std::stack for std::unordered_map</p>
 <p>Data structures algorithms </p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a271c753baf6dc5ac6f19fa03c5873eb4" name="a271c753baf6dc5ac6f19fa03c5873eb4"></a>
@@ -211,9 +226,9 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILIT
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname">static <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> data_structures::hashDJB2 </td>
+          <td class="memname">static std::size_t data_structures::hashDJB2 </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> const &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span></td><td>)</td>
+          <td class="paramtype">std::string const &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -232,14 +247,15 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILIT
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>hash for a string </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00166">166</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  166</span>                                              {</div>
-<div class="line"><span class="lineno">  167</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> hash = 5381;</div>
+<div class="line"><span class="lineno">  167</span>    std::size_t hash = 5381;</div>
 <div class="line"><span class="lineno">  168</span>    <span class="keywordflow">for</span> (<span class="keywordtype">char</span> c : s) {</div>
 <div class="line"><span class="lineno">  169</span>        hash = ((hash &lt;&lt; 5) + hash) + c;</div>
 <div class="line"><span class="lineno">  170</span>    }</div>
 <div class="line"><span class="lineno">  171</span>    <span class="keywordflow">return</span> hash;</div>
 <div class="line"><span class="lineno">  172</span>}</div>
-<div class="ttc" id="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -250,7 +266,7 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILIT
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> data_structures::hashInt_1 </td>
+          <td class="memname">std::size_t data_structures::hashInt_1 </td>
           <td>(</td>
           <td class="paramtype">int</td>          <td class="paramname"><span class="paramname"><em>x</em></span></td><td>)</td>
           <td></td>
@@ -266,6 +282,8 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILIT
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>hash for the <code>x</code> parameter </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00199">199</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  199</span>                           {</div>
 <div class="line"><span class="lineno">  200</span>    x = ((x &gt;&gt; 16) ^ x) * 0x45d9f3b;</div>
 <div class="line"><span class="lineno">  201</span>    x = ((x &gt;&gt; 16) ^ x) * 0x45d9f3b;</div>
@@ -282,7 +300,7 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILIT
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> data_structures::hashInt_2 </td>
+          <td class="memname">std::size_t data_structures::hashInt_2 </td>
           <td>(</td>
           <td class="paramtype">int</td>          <td class="paramname"><span class="paramname"><em>x</em></span></td><td>)</td>
           <td></td>
@@ -298,10 +316,12 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILIT
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>hash for the <code>x</code> parameter </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00213">213</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  213</span>                           {</div>
-<div class="line"><span class="lineno">  214</span>    <span class="keyword">auto</span> y = <span class="keyword">static_cast&lt;</span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a><span class="keyword">&gt;</span>(x);</div>
-<div class="line"><span class="lineno">  215</span>    y = (y ^ (y &gt;&gt; 30)) * <span class="keyword">static_cast&lt;</span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a><span class="keyword">&gt;</span>(0xbf58476d1ce4e5b9);</div>
-<div class="line"><span class="lineno">  216</span>    y = (y ^ (y &gt;&gt; 27)) * <span class="keyword">static_cast&lt;</span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a><span class="keyword">&gt;</span>(0x94d049bb133111eb);</div>
+<div class="line"><span class="lineno">  214</span>    <span class="keyword">auto</span> y = <span class="keyword">static_cast&lt;</span>std::size_t<span class="keyword">&gt;</span>(x);</div>
+<div class="line"><span class="lineno">  215</span>    y = (y ^ (y &gt;&gt; 30)) * <span class="keyword">static_cast&lt;</span>std::size_t<span class="keyword">&gt;</span>(0xbf58476d1ce4e5b9);</div>
+<div class="line"><span class="lineno">  216</span>    y = (y ^ (y &gt;&gt; 27)) * <span class="keyword">static_cast&lt;</span>std::size_t<span class="keyword">&gt;</span>(0x94d049bb133111eb);</div>
 <div class="line"><span class="lineno">  217</span>    y = y ^ (y &gt;&gt; 31);</div>
 <div class="line"><span class="lineno">  218</span>    <span class="keywordflow">return</span> y;</div>
 <div class="line"><span class="lineno">  219</span>}</div>
@@ -318,9 +338,9 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILIT
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname">static <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> data_structures::hashStr </td>
+          <td class="memname">static std::size_t data_structures::hashStr </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> const &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span></td><td>)</td>
+          <td class="paramtype">std::string const &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -339,16 +359,71 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILIT
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>hash for the given string </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00182">182</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  182</span>                                             {</div>
-<div class="line"><span class="lineno">  183</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> hash = 37;</div>
-<div class="line"><span class="lineno">  184</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> primeNum1 = 54059;</div>
-<div class="line"><span class="lineno">  185</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> primeNum2 = 76963;</div>
+<div class="line"><span class="lineno">  183</span>    std::size_t hash = 37;</div>
+<div class="line"><span class="lineno">  184</span>    std::size_t primeNum1 = 54059;</div>
+<div class="line"><span class="lineno">  185</span>    std::size_t primeNum2 = 76963;</div>
 <div class="line"><span class="lineno">  186</span>    <span class="keywordflow">for</span> (<span class="keywordtype">char</span> c : s) {</div>
 <div class="line"><span class="lineno">  187</span>        hash = (hash * primeNum1) ^ (c * primeNum2);</div>
 <div class="line"><span class="lineno">  188</span>    }</div>
 <div class="line"><span class="lineno">  189</span>    <span class="keywordflow">return</span> hash;</div>
 <div class="line"><span class="lineno">  190</span>}</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Variable Documentation</h2>
+<a id="ac0d7e0be24da9f41bcb19745873c436a" name="ac0d7e0be24da9f41bcb19745873c436a"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ac0d7e0be24da9f41bcb19745873c436a">&#9670;&#160;</a></span>MAX_LEVEL</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int data_structures::MAX_LEVEL = 2</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">constexpr</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Maximum level of skip list. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html#l00027">27</a> of file <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a903639d8e6f955dd8d5c263781455d61" name="a903639d8e6f955dd8d5c263781455d61"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a903639d8e6f955dd8d5c263781455d61">&#9670;&#160;</a></span>PROBABILITY</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">float data_structures::PROBABILITY = 0.5</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">constexpr</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Current probability for "coin toss". </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a>.</p>
+
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d5/d45/sublist__search_8cpp.html b/d5/d45/sublist__search_8cpp.html
index 3ec24b41d..e3bfbe1e0 100644
--- a/d5/d45/sublist__search_8cpp.html
+++ b/d5/d45/sublist__search_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: search/sublist_search.cpp File Reference</title>
+<title>TheAlgorithms/C++: search/sublist_search.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for sublist_search.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d92/sublist__search_8cpp__incl.svg" width="336" height="111"><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">
+</div>
+<p><a href="../../d5/d45/sublist__search_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a></td></tr>
@@ -147,7 +166,7 @@ Functions</h2></td></tr>
 <tr class="memitem:ad1028bc215281d62e344af99da57fab2" id="r_ad1028bc215281d62e344af99da57fab2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad1028bc215281d62e344af99da57fab2">search::sublist_search::printLinkedList</a> (<a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *start)</td></tr>
 <tr class="memdesc:ad1028bc215281d62e344af99da57fab2"><td class="mdescLeft">&#160;</td><td class="mdescRight">A simple function to print the linked list.  <br /></td></tr>
 <tr class="separator:ad1028bc215281d62e344af99da57fab2"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a70ca8d0267008e09cfa50b4e2ddfbe53" id="r_a70ca8d0267008e09cfa50b4e2ddfbe53"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
+<tr class="memitem:a70ca8d0267008e09cfa50b4e2ddfbe53" id="r_a70ca8d0267008e09cfa50b4e2ddfbe53"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a> (const std::vector&lt; uint64_t &gt; &amp;<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
 <tr class="memdesc:a70ca8d0267008e09cfa50b4e2ddfbe53"><td class="mdescLeft">&#160;</td><td class="mdescRight">Give a vector of data, it adds each element of vector in the linked list and return the address of head pointer.  <br /></td></tr>
 <tr class="separator:a70ca8d0267008e09cfa50b4e2ddfbe53"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aac16d28231a07fadec189f80937ac10d" id="r_aac16d28231a07fadec189f80937ac10d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aac16d28231a07fadec189f80937ac10d">search::sublist_search::deleteList</a> (<a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *const root)</td></tr>
@@ -178,6 +197,8 @@ Working</h3>
 <li>If the two values don't match, it goes to the next element of the second list. It does this until the two values match.</li>
 </ul>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/foo290" target="_blank">Nitin Sharma</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html">sublist_search.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="aac16d28231a07fadec189f80937ac10d" name="aac16d28231a07fadec189f80937ac10d"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aac16d28231a07fadec189f80937ac10d">&#9670;&#160;</a></span>deleteList()</h2>
@@ -193,6 +214,8 @@ Working</h3>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html#l00101">101</a> of file <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html">sublist_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  101</span>                                  {</div>
 <div class="line"><span class="lineno">  102</span>    <span class="keywordflow">if</span> (root != NULL) {</div>
 <div class="line"><span class="lineno">  103</span>        deleteList(root-&gt;next);</div>
@@ -234,56 +257,49 @@ Working</h3>
 <p>&lt; Sublist to be searched</p>
 <p>&lt; Main list in which sublist is to be searched</p>
 <p>&lt; boolean to check if the sublist exists or not</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html#l00360">360</a> of file <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html">sublist_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  360</span>                                 {</div>
 <div class="line"><span class="lineno">  361</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  362</span> </div>
-<div class="line"><span class="lineno">  363</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> mainlistData = {</div>
-<div class="line"><span class="lineno">  364</span>        2, 5, 6, 7, 8};  <span class="comment">///&lt; Main list in which sublist is to be searched</span></div>
-<div class="line"><span class="lineno">  365</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> sublistData = {6, 8};  <span class="comment">///&lt; Sublist to be searched</span></div>
+<div class="line"><span class="lineno">  363</span>    std::vector&lt;uint64_t&gt; mainlistData = {</div>
+<div class="line"><span class="lineno">  364</span>        2, 5, 6, 7, 8};  </div>
+<div class="line"><span class="lineno">  365</span>    std::vector&lt;uint64_t&gt; sublistData = {6, 8};  </div>
 <div class="line"><span class="lineno">  366</span> </div>
 <div class="line"><span class="lineno">  367</span>    <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *mainlistLL =</div>
 <div class="line"><span class="lineno">  368</span>        <a class="code hl_function" href="#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a>(mainlistData);</div>
 <div class="line"><span class="lineno">  369</span>    <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *sublistLL =</div>
 <div class="line"><span class="lineno">  370</span>        <a class="code hl_function" href="#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a>(</div>
-<div class="line"><span class="lineno">  371</span>            sublistData);  <span class="comment">///&lt; Main list in which sublist is to be</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  372</span><span class="comment">                           ///&lt; searched</span></div>
-<div class="line"><span class="lineno">  373</span><span class="comment"></span> </div>
+<div class="line"><span class="lineno">  371</span>            sublistData);  </div>
+<div class="line"><span class="lineno">  373</span> </div>
 <div class="line"><span class="lineno">  374</span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a> = <a class="code hl_function" href="#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a>(</div>
 <div class="line"><span class="lineno">  375</span>        sublistLL,</div>
-<div class="line"><span class="lineno">  376</span>        mainlistLL);  <span class="comment">///&lt; boolean to check if the sublist exists or not</span></div>
+<div class="line"><span class="lineno">  376</span>        mainlistLL);  </div>
 <div class="line"><span class="lineno">  377</span> </div>
-<div class="line"><span class="lineno">  378</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Sublist: &quot;</span> &lt;&lt; <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">  378</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sublist: &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  379</span>    <a class="code hl_function" href="#ad1028bc215281d62e344af99da57fab2">search::sublist_search::printLinkedList</a>(sublistLL);</div>
 <div class="line"><span class="lineno">  380</span> </div>
-<div class="line"><span class="lineno">  381</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Main list: &quot;</span> &lt;&lt; <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">  381</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Main list: &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  382</span>    <a class="code hl_function" href="#ad1028bc215281d62e344af99da57fab2">search::sublist_search::printLinkedList</a>(mainlistLL);</div>
-<div class="line"><span class="lineno">  383</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  383</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  384</span> </div>
 <div class="line"><span class="lineno">  385</span>    <span class="keywordflow">if</span> (exists) {</div>
-<div class="line"><span class="lineno">  386</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;[TRUE] - sublist found in main list\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  386</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;[TRUE] - sublist found in main list\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  387</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  388</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;[FALSE] - sublist NOT found in main list\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  388</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;[FALSE] - sublist NOT found in main list\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  389</span>    }</div>
 <div class="line"><span class="lineno">  390</span> </div>
 <div class="line"><span class="lineno">  391</span>    deleteList(mainlistLL);</div>
 <div class="line"><span class="lineno">  392</span>    deleteList(sublistLL);</div>
 <div class="line"><span class="lineno">  393</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  394</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="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="astructsearch_1_1sublist__search_1_1_node_html"><div class="ttname"><a href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a></div><div class="ttdoc">A Node structure representing a single link Node in a linked list.</div><div class="ttdef"><b>Definition</b> sublist_search.cpp:48</div></div>
-<div class="ttc" id="asublist__search_8cpp_html_a4faee403e2758aaab682ed6622ae218c"><div class="ttname"><a href="#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a></div><div class="ttdeci">bool sublistSearch(Node *sublist, Node *mainList)</div><div class="ttdoc">Main searching function.</div><div class="ttdef"><b>Definition</b> sublist_search.cpp:115</div></div>
-<div class="ttc" id="asublist__search_8cpp_html_a70ca8d0267008e09cfa50b4e2ddfbe53"><div class="ttname"><a href="#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a></div><div class="ttdeci">Node * makeLinkedList(const std::vector&lt; uint64_t &gt; &amp;data)</div><div class="ttdoc">Give a vector of data, it adds each element of vector in the linked list and return the address of he...</div><div class="ttdef"><b>Definition</b> sublist_search.cpp:74</div></div>
-<div class="ttc" id="asublist__search_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> sublist_search.cpp:349</div></div>
-<div class="ttc" id="asublist__search_8cpp_html_ad1028bc215281d62e344af99da57fab2"><div class="ttname"><a href="#ad1028bc215281d62e344af99da57fab2">search::sublist_search::printLinkedList</a></div><div class="ttdeci">void printLinkedList(Node *start)</div><div class="ttdoc">A simple function to print the linked list.</div><div class="ttdef"><b>Definition</b> sublist_search.cpp:58</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 class="ttc" id="aword__break_8cpp_html_a1cc9dd6e6190d10a010fdcdfe7a21a81"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">dynamic_programming::word_break::exists</a></div><div class="ttdeci">bool exists(const std::string &amp;str, const std::unordered_set&lt; std::string &gt; &amp;strSet)</div><div class="ttdoc">Function that checks if the string passed in param is present in the the unordered_set passed.</div><div class="ttdef"><b>Definition</b> word_break.cpp:60</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="100%" height="508"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="astructsearch_1_1sublist__search_1_1_node_html"><div class="ttname"><a href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a></div><div class="ttdoc">A Node structure representing a single link Node in a linked list.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d45/sublist__search_8cpp_source.html#l00048">sublist_search.cpp:48</a></div></div>
+<div class="ttc" id="asublist__search_8cpp_html_a4faee403e2758aaab682ed6622ae218c"><div class="ttname"><a href="#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a></div><div class="ttdeci">bool sublistSearch(Node *sublist, Node *mainList)</div><div class="ttdoc">Main searching function.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d45/sublist__search_8cpp_source.html#l00115">sublist_search.cpp:115</a></div></div>
+<div class="ttc" id="asublist__search_8cpp_html_a70ca8d0267008e09cfa50b4e2ddfbe53"><div class="ttname"><a href="#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a></div><div class="ttdeci">Node * makeLinkedList(const std::vector&lt; uint64_t &gt; &amp;data)</div><div class="ttdoc">Give a vector of data, it adds each element of vector in the linked list and return the address of he...</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d45/sublist__search_8cpp_source.html#l00074">sublist_search.cpp:74</a></div></div>
+<div class="ttc" id="asublist__search_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d45/sublist__search_8cpp_source.html#l00349">sublist_search.cpp:349</a></div></div>
+<div class="ttc" id="asublist__search_8cpp_html_ad1028bc215281d62e344af99da57fab2"><div class="ttname"><a href="#ad1028bc215281d62e344af99da57fab2">search::sublist_search::printLinkedList</a></div><div class="ttdeci">void printLinkedList(Node *start)</div><div class="ttdoc">A simple function to print the linked list.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d45/sublist__search_8cpp_source.html#l00058">sublist_search.cpp:58</a></div></div>
+<div class="ttc" id="aword__break_8cpp_html_a1cc9dd6e6190d10a010fdcdfe7a21a81"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">dynamic_programming::word_break::exists</a></div><div class="ttdeci">bool exists(const std::string &amp;str, const std::unordered_set&lt; std::string &gt; &amp;strSet)</div><div class="ttdoc">Function that checks if the string passed in param is present in the the unordered_set passed.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d84/word__break_8cpp_source.html#l00060">word_break.cpp:60</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a70ca8d0267008e09cfa50b4e2ddfbe53" name="a70ca8d0267008e09cfa50b4e2ddfbe53"></a>
@@ -295,7 +311,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname"><a class="el" href="../../db/d8b/struct_node.html">Node</a> * search::sublist_search::makeLinkedList </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; uint64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -310,10 +326,10 @@ Here is the call graph for this function:</div>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Node* A head pointer to the linked list. </dd></dl>
 <p>This is used in test cases for rapidly creating linked list with 100+ elements, instead of hard-coding 100 elements in test cases.</p>
-<div class="fragment"><div class="line"><span class="lineno">   74</span>                                                      {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   75</span><span class="comment">    /// This is used in test cases for rapidly creating linked list with 100+</span></div>
-<div class="line"><span class="lineno">   76</span><span class="comment">    /// elements, instead of hard-coding 100 elements in test cases.</span></div>
-<div class="line"><span class="lineno">   77</span><span class="comment"></span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *head = <span class="keyword">nullptr</span>;</div>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html#l00074">74</a> of file <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html">sublist_search.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   74</span>                                                      {</div>
+<div class="line"><span class="lineno">   77</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *head = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">   78</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *tail = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">   79</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
 <div class="line"><span class="lineno">   80</span>        <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>;</div>
@@ -329,16 +345,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   90</span>    }</div>
 <div class="line"><span class="lineno">   91</span>    <span class="keywordflow">return</span> head;</div>
 <div class="line"><span class="lineno">   92</span>}</div>
-<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
-<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
-<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d45/sublist__search_8cpp_a70ca8d0267008e09cfa50b4e2ddfbe53_cgraph.svg" width="163" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad1028bc215281d62e344af99da57fab2" name="ad1028bc215281d62e344af99da57fab2"></a>
@@ -364,19 +375,16 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html">sublist_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   58</span>                                  {</div>
 <div class="line"><span class="lineno">   59</span>    <span class="keywordflow">while</span> (start != <span class="keyword">nullptr</span>) {</div>
-<div class="line"><span class="lineno">   60</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;-&gt;&quot;</span> &lt;&lt; start-&gt;data;</div>
+<div class="line"><span class="lineno">   60</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;-&gt;&quot;</span> &lt;&lt; start-&gt;data;</div>
 <div class="line"><span class="lineno">   61</span>        start = start-&gt;next;</div>
 <div class="line"><span class="lineno">   62</span>    }</div>
-<div class="line"><span class="lineno">   63</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   63</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   64</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.svg" width="283" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4faee403e2758aaab682ed6622ae218c" name="a4faee403e2758aaab682ed6622ae218c"></a>
@@ -416,26 +424,24 @@ false if the sublist is NOT found </dd></dl>
 <p>set the target pointer again to stating point of target list.</p>
 <p>set the main pointer to the next element of the main list and repeat the algo.</p>
 <p>If the main list is exhausted, means sublist does not found, return false</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html#l00115">115</a> of file <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html">sublist_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  115</span>                                                  {</div>
 <div class="line"><span class="lineno">  116</span>    <span class="keywordflow">if</span> (sublist == <span class="keyword">nullptr</span> || mainList == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">  117</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  118</span>    }</div>
-<div class="line"><span class="lineno">  119</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  120</span><span class="comment">    /// Initialize target pointer to the head node of sublist.</span></div>
-<div class="line"><span class="lineno">  121</span><span class="comment"></span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *target_ptr = sublist;</div>
+<div class="line"><span class="lineno">  119</span> </div>
+<div class="line"><span class="lineno">  121</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *target_ptr = sublist;</div>
 <div class="line"><span class="lineno">  122</span> </div>
-<div class="line"><span class="lineno">  123</span>    <span class="keywordflow">while</span> (mainList != <span class="keyword">nullptr</span>) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  124</span><span class="comment">        /// Initialize main pointer to the current node of main list.</span></div>
-<div class="line"><span class="lineno">  125</span><span class="comment"></span>        <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *main_ptr = mainList;</div>
+<div class="line"><span class="lineno">  123</span>    <span class="keywordflow">while</span> (mainList != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><span class="lineno">  125</span>        <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *main_ptr = mainList;</div>
 <div class="line"><span class="lineno">  126</span> </div>
 <div class="line"><span class="lineno">  127</span>        <span class="keywordflow">while</span> (target_ptr != <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">  128</span>            <span class="keywordflow">if</span> (main_ptr == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">  129</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  130</span> </div>
-<div class="line"><span class="lineno">  131</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (main_ptr-&gt;data == target_ptr-&gt;data) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  132</span><span class="comment">                /// If the data of target node and main node is equal then move</span></div>
-<div class="line"><span class="lineno">  133</span><span class="comment">                /// to the next node of both lists.</span></div>
-<div class="line"><span class="lineno">  134</span><span class="comment"></span>                target_ptr = target_ptr-&gt;next;</div>
+<div class="line"><span class="lineno">  131</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (main_ptr-&gt;data == target_ptr-&gt;data) {</div>
+<div class="line"><span class="lineno">  134</span>                target_ptr = target_ptr-&gt;next;</div>
 <div class="line"><span class="lineno">  135</span>                main_ptr = main_ptr-&gt;next;</div>
 <div class="line"><span class="lineno">  136</span> </div>
 <div class="line"><span class="lineno">  137</span>            } <span class="keywordflow">else</span> {</div>
@@ -443,31 +449,18 @@ false if the sublist is NOT found </dd></dl>
 <div class="line"><span class="lineno">  139</span>            }</div>
 <div class="line"><span class="lineno">  140</span>        }</div>
 <div class="line"><span class="lineno">  141</span> </div>
-<div class="line"><span class="lineno">  142</span>        <span class="keywordflow">if</span> (target_ptr == <span class="keyword">nullptr</span>) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  143</span><span class="comment">            /// Is target pointer becomes null that means the target list is</span></div>
-<div class="line"><span class="lineno">  144</span><span class="comment">            /// been traversed without returning false. Which means the sublist</span></div>
-<div class="line"><span class="lineno">  145</span><span class="comment">            /// has been found and return ture.</span></div>
-<div class="line"><span class="lineno">  146</span><span class="comment"></span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><span class="lineno">  142</span>        <span class="keywordflow">if</span> (target_ptr == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><span class="lineno">  146</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  147</span>        }</div>
-<div class="line"><span class="lineno">  148</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  149</span><span class="comment">        /// set the target pointer again to stating point of target list.</span></div>
-<div class="line"><span class="lineno">  150</span><span class="comment"></span>        target_ptr = sublist;</div>
-<div class="line"><span class="lineno">  151</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  152</span><span class="comment">        /// set the main pointer to the next element of the main list and repeat</span></div>
-<div class="line"><span class="lineno">  153</span><span class="comment">        /// the algo.</span></div>
-<div class="line"><span class="lineno">  154</span><span class="comment"></span>        mainList = mainList-&gt;next;</div>
+<div class="line"><span class="lineno">  148</span> </div>
+<div class="line"><span class="lineno">  150</span>        target_ptr = sublist;</div>
+<div class="line"><span class="lineno">  151</span> </div>
+<div class="line"><span class="lineno">  154</span>        mainList = mainList-&gt;next;</div>
 <div class="line"><span class="lineno">  155</span>    }</div>
-<div class="line"><span class="lineno">  156</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  157</span><span class="comment">    /// If the main list is exhausted, means sublist does not found, return</span></div>
-<div class="line"><span class="lineno">  158</span><span class="comment">    /// false</span></div>
-<div class="line"><span class="lineno">  159</span><span class="comment"></span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><span class="lineno">  156</span> </div>
+<div class="line"><span class="lineno">  159</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  160</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.svg" width="163" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -495,18 +488,15 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html#l00349">349</a> of file <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html">sublist_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  349</span>                   {</div>
 <div class="line"><span class="lineno">  350</span>    <a class="code hl_class" href="../../d5/d58/class_test_cases.html">TestCases</a> tc;</div>
 <div class="line"><span class="lineno">  351</span>    tc.<a class="code hl_function" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a>();</div>
 <div class="line"><span class="lineno">  352</span>}</div>
-<div class="ttc" id="aclass_test_cases_html"><div class="ttname"><a href="../../d5/d58/class_test_cases.html">TestCases</a></div><div class="ttdoc">class encapsulating the necessary test cases</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:225</div></div>
-<div class="ttc" id="aclass_test_cases_html_aeabea90c02f9159e4a784bbf736e1e23"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">TestCases::runTests</a></div><div class="ttdeci">void runTests()</div><div class="ttdoc">Executes test cases.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:243</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="467"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclass_test_cases_html"><div class="ttname"><a href="../../d5/d58/class_test_cases.html">TestCases</a></div><div class="ttdoc">class encapsulating the necessary test cases</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00225">inorder_successor_of_bst.cpp:225</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_aeabea90c02f9159e4a784bbf736e1e23"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">TestCases::runTests</a></div><div class="ttdeci">void runTests()</div><div class="ttdoc">Executes test cases.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00243">inorder_successor_of_bst.cpp:243</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
deleted file mode 100644
index f10a66420..000000000
--- a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ /dev/null
@@ -1,25 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,43,55,69"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="749,119,820,145"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,45,145,18,204,7,264,3,465,3,535,6,588,18,639,39,702,70,732,87,759,107,755,111,729,92,700,74,637,44,586,23,534,12,465,8,264,8,204,13,146,24,55,50"/>
-<area shape="rect" id="Node000003" href="$d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,68,146,94"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,60,88,69,87,74,54,65"/>
-<area shape="rect" id="Node000004" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="194,119,336,145"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="148,87,214,111,212,116,146,92"/>
-<area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="289,116,332,96,384,80,473,67,543,67,614,79,702,100,738,111,736,116,700,105,613,84,543,73,473,72,385,85,334,101,292,121"/>
-<area shape="rect" id="Node000005" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="592,195,701,221"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="293,143,335,163,385,180,485,198,576,204,576,210,484,203,384,185,333,168,290,148"/>
-<area shape="rect" id="Node000006" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, printing inorder successor of last node." alt="" coords="384,95,544,121"/>
-<area shape="poly" id="edge7_Node000004_Node000006" title=" " alt="" coords="336,121,368,117,369,122,337,126"/>
-<area shape="rect" id="Node000007" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="384,144,544,170"/>
-<area shape="poly" id="edge10_Node000004_Node000007" title=" " alt="" coords="337,138,369,143,368,148,336,144"/>
-<area shape="rect" id="Node000008" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="384,246,544,272"/>
-<area shape="poly" id="edge13_Node000004_Node000008" title=" " alt="" coords="282,143,327,182,386,224,410,237,408,242,383,229,323,187,279,147"/>
-<area shape="poly" id="edge6_Node000005_Node000002" title=" " alt="" coords="670,192,745,150,748,155,673,197"/>
-<area shape="poly" id="edge8_Node000006_Node000002" title=" " alt="" coords="544,111,734,126,733,131,544,117"/>
-<area shape="poly" id="edge9_Node000006_Node000005" title=" " alt="" coords="519,119,545,130,586,155,621,183,618,187,583,160,542,134,517,124"/>
-<area shape="poly" id="edge11_Node000007_Node000002" title=" " alt="" coords="544,148,733,133,734,139,544,154"/>
-<area shape="poly" id="edge12_Node000007_Node000005" title=" " alt="" coords="514,168,584,188,582,193,512,173"/>
-<area shape="poly" id="edge14_Node000008_Node000002" title=" " alt="" coords="544,262,622,256,662,247,700,231,721,216,740,197,767,157,772,160,744,200,725,220,702,236,664,252,623,262,544,268"/>
-<area shape="poly" id="edge15_Node000008_Node000005" title=" " alt="" coords="512,243,582,223,584,228,514,248"/>
-</map>
diff --git a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
deleted file mode 100644
index 1684f5199..000000000
--- a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ca21cff5322a3f3b35dbb74be354718d
\ No newline at end of file
diff --git a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
deleted file mode 100644
index d9bbfb001..000000000
--- a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ /dev/null
@@ -1,302 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 208 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 619;
-var viewHeight = 208;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-171.25 0,-171.25 0,-152 37,-152 37,-171.25"/>
-<text text-anchor="middle" x="18.5" y="-157.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="611.25,-114.25 557.75,-114.25 557.75,-95 611.25,-95 611.25,-114.25"/>
-<text text-anchor="middle" x="584.5" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.05,-168.07C68.18,-178.91 135.32,-199.62 193.88,-199.62 193.88,-199.62 193.88,-199.62 345,-199.62 426.64,-199.62 448.34,-185.33 521.75,-149.62 536.85,-142.28 552.11,-131.2 563.68,-121.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="565.85,-124.63 571.29,-115.54 561.37,-119.25 565.85,-124.63"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-152.25 73,-152.25 73,-133 105.5,-133 105.5,-152.25"/>
-<text text-anchor="middle" x="89.25" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-156.73C44.67,-154.67 53.52,-152.22 61.73,-149.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.55,-153.36 71.25,-147.32 60.68,-146.61 62.55,-153.36"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
-<polygon fill="white" stroke="#666666" points="248.25,-114.25 141.5,-114.25 141.5,-95 248.25,-95 248.25,-114.25"/>
-<text text-anchor="middle" x="194.88" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.99,-136.85C119.21,-132 138.66,-124.87 155.9,-118.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.66,-122 164.85,-115.27 154.25,-115.43 156.66,-122"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.82,-114.64C231.21,-123.73 258.65,-136.48 284.25,-141.62 387.94,-162.46 418.88,-151.18 521.75,-126.62 530.62,-124.51 539.99,-121.56 548.68,-118.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="549.62,-121.89 557.81,-115.16 547.21,-115.32 549.62,-121.89"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="521.75,-57.25 439.75,-57.25 439.75,-38 521.75,-38 521.75,-57.25"/>
-<text text-anchor="middle" x="480.75" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.58,-94.56C232.07,-85.64 259.18,-73.07 284.25,-66.62 332.05,-54.34 388.28,-49.88 428.13,-48.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="428.05,-51.82 437.92,-47.98 427.81,-44.82 428.05,-51.82"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
-<polygon fill="white" stroke="#666666" points="403.75,-132.25 284.25,-132.25 284.25,-113 403.75,-113 403.75,-132.25"/>
-<text text-anchor="middle" x="344" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge7_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge7_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.57,-111.07C256.36,-112.03 264.49,-113.02 272.57,-114.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.07,-117.47 282.42,-115.21 272.92,-110.52 272.07,-117.47"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="403.75,-95.25 284.25,-95.25 284.25,-76 403.75,-76 403.75,-95.25"/>
-<text text-anchor="middle" x="344" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge10_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge10_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.57,-97.82C256.36,-96.81 264.49,-95.76 272.57,-94.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.95,-98.2 282.42,-93.45 272.06,-91.26 272.95,-98.2"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="403.75,-19.25 284.25,-19.25 284.25,0 403.75,0 403.75,-19.25"/>
-<text text-anchor="middle" x="344" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge13_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge13_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M206.28,-94.57C222.09,-79.71 253.56,-51.7 284.25,-33.62 290.09,-30.19 296.51,-27.01 302.9,-24.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.25,-27.41 312.12,-20.32 301.55,-20.95 304.25,-27.41"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge6_Node000005_Node000002" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge6_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M499.47,-57.55C514.99,-66.25 537.79,-79.02 555.73,-89.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="553.88,-92.05 564.32,-93.88 557.3,-85.94 553.88,-92.05"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node2 -->
-<g id="edge8_Node000006_Node000002" class="edge">
-<title>Node6&#45;&gt;Node2</title>
-<g id="a_edge8_Node000006_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M403.96,-118.18C448.46,-114.82 508.17,-110.31 546.25,-107.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="546.11,-110.96 555.82,-106.71 545.59,-103.98 546.11,-110.96"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge9_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge9_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M384.61,-112.55C391.16,-110.31 397.76,-107.67 403.75,-104.62 424.73,-93.96 445.94,-77.46 460.61,-64.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="462.86,-67.63 468.09,-58.42 458.26,-62.37 462.86,-67.63"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node2 -->
-<g id="edge11_Node000007_Node000002" class="edge">
-<title>Node7&#45;&gt;Node2</title>
-<g id="a_edge11_Node000007_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M403.96,-90.32C448.46,-93.87 508.17,-98.62 546.25,-101.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="545.57,-105.11 555.82,-102.42 546.13,-98.14 545.57,-105.11"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge12_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge12_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.76,-75.54C396.87,-71 416.11,-65.57 433.33,-60.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="434.16,-64.12 442.84,-58.03 432.26,-57.38 434.16,-64.12"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node2 -->
-<g id="edge14_Node000008_Node000002" class="edge">
-<title>Node8&#45;&gt;Node2</title>
-<g id="a_edge14_Node000008_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M404.04,-4.99C440.08,-4.73 485.96,-9.17 521.75,-28.62 545.01,-41.26 562.81,-66.64 573.2,-84.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="570.09,-86.2 577.96,-93.29 576.23,-82.84 570.09,-86.2"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge15_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge15_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.76,-19.71C396.87,-24.25 416.11,-29.68 433.33,-34.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="432.26,-37.87 442.84,-37.22 434.16,-31.13 432.26,-37.87"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
deleted file mode 100644
index 7198a0662..000000000
--- a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
+++ /dev/null
@@ -1,219 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="619pt" height="208pt"
- viewBox="0.00 0.00 619.25 207.62" 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 203.62)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-171.25 0,-171.25 0,-152 37,-152 37,-171.25"/>
-<text text-anchor="middle" x="18.5" y="-157.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="611.25,-114.25 557.75,-114.25 557.75,-95 611.25,-95 611.25,-114.25"/>
-<text text-anchor="middle" x="584.5" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.05,-168.07C68.18,-178.91 135.32,-199.62 193.88,-199.62 193.88,-199.62 193.88,-199.62 345,-199.62 426.64,-199.62 448.34,-185.33 521.75,-149.62 536.85,-142.28 552.11,-131.2 563.68,-121.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="565.85,-124.63 571.29,-115.54 561.37,-119.25 565.85,-124.63"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-152.25 73,-152.25 73,-133 105.5,-133 105.5,-152.25"/>
-<text text-anchor="middle" x="89.25" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-156.73C44.67,-154.67 53.52,-152.22 61.73,-149.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.55,-153.36 71.25,-147.32 60.68,-146.61 62.55,-153.36"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
-<polygon fill="white" stroke="#666666" points="248.25,-114.25 141.5,-114.25 141.5,-95 248.25,-95 248.25,-114.25"/>
-<text text-anchor="middle" x="194.88" y="-100.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.99,-136.85C119.21,-132 138.66,-124.87 155.9,-118.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.66,-122 164.85,-115.27 154.25,-115.43 156.66,-122"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.82,-114.64C231.21,-123.73 258.65,-136.48 284.25,-141.62 387.94,-162.46 418.88,-151.18 521.75,-126.62 530.62,-124.51 539.99,-121.56 548.68,-118.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="549.62,-121.89 557.81,-115.16 547.21,-115.32 549.62,-121.89"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="521.75,-57.25 439.75,-57.25 439.75,-38 521.75,-38 521.75,-57.25"/>
-<text text-anchor="middle" x="480.75" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.58,-94.56C232.07,-85.64 259.18,-73.07 284.25,-66.62 332.05,-54.34 388.28,-49.88 428.13,-48.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="428.05,-51.82 437.92,-47.98 427.81,-44.82 428.05,-51.82"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
-<polygon fill="white" stroke="#666666" points="403.75,-132.25 284.25,-132.25 284.25,-113 403.75,-113 403.75,-132.25"/>
-<text text-anchor="middle" x="344" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge7_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge7_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.57,-111.07C256.36,-112.03 264.49,-113.02 272.57,-114.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.07,-117.47 282.42,-115.21 272.92,-110.52 272.07,-117.47"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="403.75,-95.25 284.25,-95.25 284.25,-76 403.75,-76 403.75,-95.25"/>
-<text text-anchor="middle" x="344" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge10_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge10_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.57,-97.82C256.36,-96.81 264.49,-95.76 272.57,-94.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.95,-98.2 282.42,-93.45 272.06,-91.26 272.95,-98.2"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="403.75,-19.25 284.25,-19.25 284.25,0 403.75,0 403.75,-19.25"/>
-<text text-anchor="middle" x="344" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge13_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge13_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M206.28,-94.57C222.09,-79.71 253.56,-51.7 284.25,-33.62 290.09,-30.19 296.51,-27.01 302.9,-24.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.25,-27.41 312.12,-20.32 301.55,-20.95 304.25,-27.41"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge6_Node000005_Node000002" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge6_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M499.47,-57.55C514.99,-66.25 537.79,-79.02 555.73,-89.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="553.88,-92.05 564.32,-93.88 557.3,-85.94 553.88,-92.05"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node2 -->
-<g id="edge8_Node000006_Node000002" class="edge">
-<title>Node6&#45;&gt;Node2</title>
-<g id="a_edge8_Node000006_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M403.96,-118.18C448.46,-114.82 508.17,-110.31 546.25,-107.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="546.11,-110.96 555.82,-106.71 545.59,-103.98 546.11,-110.96"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge9_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge9_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M384.61,-112.55C391.16,-110.31 397.76,-107.67 403.75,-104.62 424.73,-93.96 445.94,-77.46 460.61,-64.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="462.86,-67.63 468.09,-58.42 458.26,-62.37 462.86,-67.63"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node2 -->
-<g id="edge11_Node000007_Node000002" class="edge">
-<title>Node7&#45;&gt;Node2</title>
-<g id="a_edge11_Node000007_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M403.96,-90.32C448.46,-93.87 508.17,-98.62 546.25,-101.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="545.57,-105.11 555.82,-102.42 546.13,-98.14 545.57,-105.11"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge12_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge12_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.76,-75.54C396.87,-71 416.11,-65.57 433.33,-60.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="434.16,-64.12 442.84,-58.03 432.26,-57.38 434.16,-64.12"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node2 -->
-<g id="edge14_Node000008_Node000002" class="edge">
-<title>Node8&#45;&gt;Node2</title>
-<g id="a_edge14_Node000008_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M404.04,-4.99C440.08,-4.73 485.96,-9.17 521.75,-28.62 545.01,-41.26 562.81,-66.64 573.2,-84.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="570.09,-86.2 577.96,-93.29 576.23,-82.84 570.09,-86.2"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge15_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge15_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.76,-19.71C396.87,-24.25 416.11,-29.68 433.33,-34.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="432.26,-37.87 442.84,-37.22 434.16,-31.13 432.26,-37.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.map b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.map
deleted file mode 100644
index 595de5a40..000000000
--- a/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="search::sublist_search::sublistSearch" name="search::sublist_search::sublistSearch">
-<area shape="rect" id="Node000001" title="Main searching function." alt="" coords="5,29,158,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="52,29,50,19,55,11,66,5,82,3,98,5,108,11,106,16,97,10,81,8,67,10,59,14,56,20,57,28"/>
-</map>
diff --git a/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.md5 b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.md5
deleted file mode 100644
index ffccce7d8..000000000
--- a/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f9ccc630e616ece532fccf944521db9c
\ No newline at end of file
diff --git a/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.svg b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.svg
deleted file mode 100644
index 71420a829..000000000
--- a/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: search::sublist_search::sublistSearch Pages: 1 -->
-<svg width="122pt" height="57pt"
- viewBox="0.00 0.00 122.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>search::sublist_search::sublistSearch</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main searching function.">
-<polygon fill="#999999" stroke="#666666" points="114.25,-30.5 0,-30.5 0,0 114.25,0 114.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">search::sublist_search</text>
-<text text-anchor="middle" x="57.13" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::sublistSearch</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.88,-30.99C32.75,-40.06 39.5,-48.5 57.13,-48.5 66.77,-48.5 73.15,-45.97 76.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.74,-42.78 77.22,-32.49 72.78,-42.11 79.74,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph_org.svg b/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph_org.svg
deleted file mode 100644
index 4cd5846c5..000000000
--- a/d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: search::sublist_search::sublistSearch Pages: 1 -->
-<svg width="122pt" height="57pt"
- viewBox="0.00 0.00 122.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>search::sublist_search::sublistSearch</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main searching function.">
-<polygon fill="#999999" stroke="#666666" points="114.25,-30.5 0,-30.5 0,0 114.25,0 114.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">search::sublist_search</text>
-<text text-anchor="middle" x="57.13" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::sublistSearch</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.88,-30.99C32.75,-40.06 39.5,-48.5 57.13,-48.5 66.77,-48.5 73.15,-45.97 76.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.74,-42.78 77.22,-32.49 72.78,-42.11 79.74,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d45/sublist__search_8cpp_a70ca8d0267008e09cfa50b4e2ddfbe53_cgraph.map b/d5/d45/sublist__search_8cpp_a70ca8d0267008e09cfa50b4e2ddfbe53_cgraph.map
deleted file mode 100644
index 0c9baa3bf..000000000
--- a/d5/d45/sublist__search_8cpp_a70ca8d0267008e09cfa50b4e2ddfbe53_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="search::sublist_search::makeLinkedList" name="search::sublist_search::makeLinkedList">
-<area shape="rect" id="Node000001" title="Give a vector of data, it adds each element of vector in the linked list and return the address of he..." alt="" coords="5,29,158,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="52,29,50,19,55,11,66,5,82,3,98,5,108,11,106,16,97,10,81,8,67,10,59,14,56,20,57,28"/>
-</map>
diff --git a/d5/d45/sublist__search_8cpp_a70ca8d0267008e09cfa50b4e2ddfbe53_cgraph.md5 b/d5/d45/sublist__search_8cpp_a70ca8d0267008e09cfa50b4e2ddfbe53_cgraph.md5
deleted file mode 100644
index ddf465382..000000000
--- a/d5/d45/sublist__search_8cpp_a70ca8d0267008e09cfa50b4e2ddfbe53_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-550ed494bc5fcd79642e630f5d0aa11a
\ No newline at end of file
diff --git a/d5/d45/sublist__search_8cpp_a70ca8d0267008e09cfa50b4e2ddfbe53_cgraph.svg b/d5/d45/sublist__search_8cpp_a70ca8d0267008e09cfa50b4e2ddfbe53_cgraph.svg
deleted file mode 100644
index 42580376e..000000000
--- a/d5/d45/sublist__search_8cpp_a70ca8d0267008e09cfa50b4e2ddfbe53_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: search::sublist_search::makeLinkedList Pages: 1 -->
-<svg width="122pt" height="57pt"
- viewBox="0.00 0.00 122.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>search::sublist_search::makeLinkedList</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Give a vector of data, it adds each element of vector in the linked list and return the address of he...">
-<polygon fill="#999999" stroke="#666666" points="114.25,-30.5 0,-30.5 0,0 114.25,0 114.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">search::sublist_search</text>
-<text text-anchor="middle" x="57.13" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::makeLinkedList</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.88,-30.99C32.75,-40.06 39.5,-48.5 57.13,-48.5 66.77,-48.5 73.15,-45.97 76.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.74,-42.78 77.22,-32.49 72.78,-42.11 79.74,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d45/sublist__search_8cpp_a70ca8d0267008e09cfa50b4e2ddfbe53_cgraph_org.svg b/d5/d45/sublist__search_8cpp_a70ca8d0267008e09cfa50b4e2ddfbe53_cgraph_org.svg
deleted file mode 100644
index 4c82cd34e..000000000
--- a/d5/d45/sublist__search_8cpp_a70ca8d0267008e09cfa50b4e2ddfbe53_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: search::sublist_search::makeLinkedList Pages: 1 -->
-<svg width="122pt" height="57pt"
- viewBox="0.00 0.00 122.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>search::sublist_search::makeLinkedList</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Give a vector of data, it adds each element of vector in the linked list and return the address of he...">
-<polygon fill="#999999" stroke="#666666" points="114.25,-30.5 0,-30.5 0,0 114.25,0 114.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">search::sublist_search</text>
-<text text-anchor="middle" x="57.13" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::makeLinkedList</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.88,-30.99C32.75,-40.06 39.5,-48.5 57.13,-48.5 66.77,-48.5 73.15,-45.97 76.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.74,-42.78 77.22,-32.49 72.78,-42.11 79.74,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index de38214d8..000000000
--- a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,22 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,92,49,117"/>
-<area shape="rect" id="Node000002" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="97,92,239,117"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,102,81,102,81,107,49,107"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="652,92,723,117"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="182,89,226,55,255,38,286,26,375,6,412,3,447,4,518,20,605,50,633,64,659,80,656,85,631,68,603,55,517,25,446,10,412,8,375,11,288,31,257,43,229,60,185,93"/>
-<area shape="rect" id="Node000004" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="494,92,604,117"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="239,102,479,102,479,107,239,107"/>
-<area shape="rect" id="Node000005" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, printing inorder successor of last node." alt="" coords="287,41,446,67"/>
-<area shape="poly" id="edge5_Node000002_Node000005" title=" " alt="" coords="221,88,298,69,299,74,222,94"/>
-<area shape="rect" id="Node000006" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="287,142,446,168"/>
-<area shape="poly" id="edge8_Node000002_Node000006" title=" " alt="" coords="222,115,299,135,298,141,221,121"/>
-<area shape="rect" id="Node000007" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="287,192,446,217"/>
-<area shape="poly" id="edge11_Node000002_Node000007" title=" " alt="" coords="188,116,232,147,288,178,301,183,299,188,286,183,230,151,185,120"/>
-<area shape="poly" id="edge4_Node000004_Node000003" title=" " alt="" coords="604,102,636,102,636,107,604,107"/>
-<area shape="poly" id="edge6_Node000005_Node000003" title=" " alt="" coords="447,56,523,64,604,77,637,85,636,90,603,82,523,69,446,61"/>
-<area shape="poly" id="edge7_Node000005_Node000004" title=" " alt="" coords="416,65,486,84,485,90,415,70"/>
-<area shape="poly" id="edge9_Node000006_Node000003" title=" " alt="" coords="446,148,523,140,603,127,636,119,637,124,604,132,523,145,447,153"/>
-<area shape="poly" id="edge10_Node000006_Node000004" title=" " alt="" coords="415,139,485,119,486,125,416,144"/>
-<area shape="poly" id="edge12_Node000007_Node000003" title=" " alt="" coords="446,190,523,174,603,149,652,123,655,128,605,154,524,179,447,195"/>
-<area shape="poly" id="edge13_Node000007_Node000004" title=" " alt="" coords="420,189,445,178,486,153,520,126,524,130,489,157,448,183,422,194"/>
-</map>
diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 8a5e67e52..000000000
--- a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d2c5c4cea9e9ad710f2e888f48c03542
\ No newline at end of file
diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 0f6139150..000000000
--- a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,275 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<!--zoomable 167 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 546;
-var viewHeight = 167;
-var sectionId = 'dynsection-5';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-94.25 0,-94.25 0,-75 32.5,-75 32.5,-94.25"/>
-<text text-anchor="middle" x="16.25" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
-<polygon fill="white" stroke="#666666" points="175.25,-94.25 68.5,-94.25 68.5,-75 175.25,-75 175.25,-94.25"/>
-<text text-anchor="middle" x="121.88" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.99,-84.62C39.68,-84.62 47.96,-84.62 56.74,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.53,-88.13 66.53,-84.63 56.53,-81.13 56.53,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="538.25,-94.25 484.75,-94.25 484.75,-75 538.25,-75 538.25,-94.25"/>
-<text text-anchor="middle" x="511.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.81,-94.72C149.53,-108.47 180.08,-132.44 211.25,-141.62 312.8,-171.53 349.58,-160.65 448.75,-123.62 463.08,-118.27 477.62,-109.3 488.99,-101.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="490.85,-104.29 496.86,-95.56 486.72,-98.64 490.85,-104.29"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="448.75,-94.25 366.75,-94.25 366.75,-75 448.75,-75 448.75,-94.25"/>
-<text text-anchor="middle" x="407.75" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.6,-84.62C226.92,-84.62 304.41,-84.62 355.29,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.16,-88.13 365.16,-84.63 355.16,-81.13 355.16,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
-<polygon fill="white" stroke="#666666" points="330.75,-132.25 211.25,-132.25 211.25,-113 330.75,-113 330.75,-132.25"/>
-<text text-anchor="middle" x="271" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.92,-94.71C179.69,-99.3 200.95,-104.79 219.89,-109.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.01,-113.07 229.57,-112.18 220.76,-106.29 219.01,-113.07"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="330.75,-56.25 211.25,-56.25 211.25,-37 330.75,-37 330.75,-56.25"/>
-<text text-anchor="middle" x="271" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge8_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge8_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.92,-74.54C179.69,-69.95 200.95,-64.46 219.89,-59.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.76,-62.96 229.57,-57.07 219.01,-56.18 220.76,-62.96"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="330.75,-19.25 211.25,-19.25 211.25,0 330.75,0 330.75,-19.25"/>
-<text text-anchor="middle" x="271" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge11_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge11_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.98,-74.52C152.67,-62.04 182.77,-40.86 211.25,-27.62 214.34,-26.19 217.58,-24.83 220.88,-23.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.84,-26.92 230.08,-20.26 219.48,-20.33 221.84,-26.92"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M448.96,-84.62C456.86,-84.62 465.11,-84.62 472.91,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="472.8,-88.13 482.8,-84.63 472.8,-81.13 472.8,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge6_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge6_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.95,-119.12C365.52,-116.37 409.9,-111.61 448.75,-103.62 456.81,-101.97 465.33,-99.7 473.38,-97.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="474.39,-100.65 482.9,-94.34 472.31,-93.97 474.39,-100.65"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge7_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge7_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.76,-112.54C323.87,-108 343.11,-102.57 360.33,-97.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="361.16,-101.12 369.84,-95.03 359.26,-94.38 361.16,-101.12"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge9_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge9_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.95,-50.13C365.52,-52.88 409.9,-57.64 448.75,-65.62 456.81,-67.28 465.33,-69.55 473.38,-71.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="472.31,-75.28 482.9,-74.91 474.39,-68.6 472.31,-75.28"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge10_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge10_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.76,-56.71C323.87,-61.25 343.11,-66.68 360.33,-71.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="359.26,-74.87 369.84,-74.22 361.16,-68.13 359.26,-74.87"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge12_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge12_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.99,-18.51C365.97,-24.86 410.75,-34.93 448.75,-49.62 461.64,-54.61 475.09,-61.95 486.13,-68.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="484.26,-71.58 494.6,-73.9 487.97,-65.64 484.26,-71.58"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge13_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge13_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M311.61,-19.7C318.16,-21.94 324.76,-24.58 330.75,-27.62 351.73,-38.29 372.94,-54.79 387.61,-67.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="385.26,-69.88 395.09,-73.83 389.86,-64.62 385.26,-69.88"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index e339729cd..000000000
--- a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,192 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="546pt" height="167pt"
- viewBox="0.00 0.00 546.25 167.01" 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 163.01)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-94.25 0,-94.25 0,-75 32.5,-75 32.5,-94.25"/>
-<text text-anchor="middle" x="16.25" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
-<polygon fill="white" stroke="#666666" points="175.25,-94.25 68.5,-94.25 68.5,-75 175.25,-75 175.25,-94.25"/>
-<text text-anchor="middle" x="121.88" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.99,-84.62C39.68,-84.62 47.96,-84.62 56.74,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.53,-88.13 66.53,-84.63 56.53,-81.13 56.53,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="538.25,-94.25 484.75,-94.25 484.75,-75 538.25,-75 538.25,-94.25"/>
-<text text-anchor="middle" x="511.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.81,-94.72C149.53,-108.47 180.08,-132.44 211.25,-141.62 312.8,-171.53 349.58,-160.65 448.75,-123.62 463.08,-118.27 477.62,-109.3 488.99,-101.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="490.85,-104.29 496.86,-95.56 486.72,-98.64 490.85,-104.29"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="448.75,-94.25 366.75,-94.25 366.75,-75 448.75,-75 448.75,-94.25"/>
-<text text-anchor="middle" x="407.75" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.6,-84.62C226.92,-84.62 304.41,-84.62 355.29,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.16,-88.13 365.16,-84.63 355.16,-81.13 355.16,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
-<polygon fill="white" stroke="#666666" points="330.75,-132.25 211.25,-132.25 211.25,-113 330.75,-113 330.75,-132.25"/>
-<text text-anchor="middle" x="271" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.92,-94.71C179.69,-99.3 200.95,-104.79 219.89,-109.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.01,-113.07 229.57,-112.18 220.76,-106.29 219.01,-113.07"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="330.75,-56.25 211.25,-56.25 211.25,-37 330.75,-37 330.75,-56.25"/>
-<text text-anchor="middle" x="271" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge8_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge8_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.92,-74.54C179.69,-69.95 200.95,-64.46 219.89,-59.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.76,-62.96 229.57,-57.07 219.01,-56.18 220.76,-62.96"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="330.75,-19.25 211.25,-19.25 211.25,0 330.75,0 330.75,-19.25"/>
-<text text-anchor="middle" x="271" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge11_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge11_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.98,-74.52C152.67,-62.04 182.77,-40.86 211.25,-27.62 214.34,-26.19 217.58,-24.83 220.88,-23.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.84,-26.92 230.08,-20.26 219.48,-20.33 221.84,-26.92"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M448.96,-84.62C456.86,-84.62 465.11,-84.62 472.91,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="472.8,-88.13 482.8,-84.63 472.8,-81.13 472.8,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge6_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge6_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.95,-119.12C365.52,-116.37 409.9,-111.61 448.75,-103.62 456.81,-101.97 465.33,-99.7 473.38,-97.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="474.39,-100.65 482.9,-94.34 472.31,-93.97 474.39,-100.65"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge7_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge7_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.76,-112.54C323.87,-108 343.11,-102.57 360.33,-97.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="361.16,-101.12 369.84,-95.03 359.26,-94.38 361.16,-101.12"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge9_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge9_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.95,-50.13C365.52,-52.88 409.9,-57.64 448.75,-65.62 456.81,-67.28 465.33,-69.55 473.38,-71.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="472.31,-75.28 482.9,-74.91 474.39,-68.6 472.31,-75.28"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge10_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge10_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.76,-56.71C323.87,-61.25 343.11,-66.68 360.33,-71.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="359.26,-74.87 369.84,-74.22 361.16,-68.13 359.26,-74.87"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge12_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge12_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.99,-18.51C365.97,-24.86 410.75,-34.93 448.75,-49.62 461.64,-54.61 475.09,-61.95 486.13,-68.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="484.26,-71.58 494.6,-73.9 487.97,-65.64 484.26,-71.58"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge13_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge13_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M311.61,-19.7C318.16,-21.94 324.76,-24.58 330.75,-27.62 351.73,-38.29 372.94,-54.79 387.61,-67.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="385.26,-69.88 395.09,-73.83 389.86,-64.62 385.26,-69.88"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.map b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.map
deleted file mode 100644
index 3c427c88f..000000000
--- a/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="search::sublist_search::printLinkedList" name="search::sublist_search::printLinkedList">
-<area shape="rect" id="Node000001" title="A simple function to print the linked list." alt="" coords="5,29,158,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="51,29,49,19,54,11,65,5,82,3,99,5,110,11,107,16,97,10,81,8,67,10,58,14,54,20,56,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="206,37,277,62"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="158,47,190,47,190,52,158,52"/>
-</map>
diff --git a/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.md5 b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.md5
deleted file mode 100644
index afaa5598d..000000000
--- a/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5e8147d99a2fd17885600c4d4d5f070d
\ No newline at end of file
diff --git a/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.svg b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.svg
deleted file mode 100644
index 31c2fe27e..000000000
--- a/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: search::sublist_search::printLinkedList Pages: 1 -->
-<svg width="212pt" height="57pt"
- viewBox="0.00 0.00 211.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>search::sublist_search::printLinkedList</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A simple function to print the linked list.">
-<polygon fill="#999999" stroke="#666666" points="114.25,-30.5 0,-30.5 0,0 114.25,0 114.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">search::sublist_search</text>
-<text text-anchor="middle" x="57.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::printLinkedList</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.88,-30.99C31.55,-40.06 38.63,-48.5 57.12,-48.5 67.24,-48.5 73.94,-45.97 77.23,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.69,-42.79 78.21,-32.49 73.72,-42.09 80.69,-42.79"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203.75,-24.88 150.25,-24.88 150.25,-5.63 203.75,-5.63 203.75,-24.88"/>
-<text text-anchor="middle" x="177" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.65,-15.25C122.71,-15.25 130.84,-15.25 138.42,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.28,-18.75 148.28,-15.25 138.28,-11.75 138.28,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph_org.svg b/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph_org.svg
deleted file mode 100644
index c13e14572..000000000
--- a/d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: search::sublist_search::printLinkedList Pages: 1 -->
-<svg width="212pt" height="57pt"
- viewBox="0.00 0.00 211.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>search::sublist_search::printLinkedList</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A simple function to print the linked list.">
-<polygon fill="#999999" stroke="#666666" points="114.25,-30.5 0,-30.5 0,0 114.25,0 114.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">search::sublist_search</text>
-<text text-anchor="middle" x="57.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::printLinkedList</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.88,-30.99C31.55,-40.06 38.63,-48.5 57.12,-48.5 67.24,-48.5 73.94,-45.97 77.23,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.69,-42.79 78.21,-32.49 73.72,-42.09 80.69,-42.79"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203.75,-24.88 150.25,-24.88 150.25,-5.63 203.75,-5.63 203.75,-24.88"/>
-<text text-anchor="middle" x="177" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.65,-15.25C122.71,-15.25 130.84,-15.25 138.42,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.28,-18.75 148.28,-15.25 138.28,-11.75 138.28,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d45/sublist__search_8cpp_source.html b/d5/d45/sublist__search_8cpp_source.html
new file mode 100644
index 000000000..83553ae51
--- /dev/null
+++ b/d5/d45/sublist__search_8cpp_source.html
@@ -0,0 +1,456 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: search/sublist_search.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/d45/sublist__search_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">sublist_search.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d5/d45/sublist__search_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a> {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/def/namespacesublist__search.html">sublist_search</a> {</div>
+<div class="foldopen" id="foldopen00048" data-start="{" data-end="};">
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">   48</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"><a class="line" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b">   49</a></span>    uint32_t <a class="code hl_variable" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b">data</a> = 0;  </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"><a class="line" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a">   50</a></span>    <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *<a class="code hl_variable" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a">next</a>{};       </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>};</div>
+</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="foldopen" id="foldopen00058" data-start="{" data-end="}">
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2">   58</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2">printLinkedList</a>(<a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *start) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">while</span> (start != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;-&gt;&quot;</span> &lt;&lt; start-&gt;data;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        start = start-&gt;next;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    }</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>}</div>
+</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="foldopen" id="foldopen00074" data-start="{" data-end="}">
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">   74</a></span><a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *<a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">makeLinkedList</a>(<span class="keyword">const</span> std::vector&lt;uint64_t&gt; &amp;<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *head = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *tail = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a>;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;data = i;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordflow">if</span> (head == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            head = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>            tail = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            tail-&gt;<a class="code hl_variable" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a">next</a> = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>            tail = tail-&gt;<a class="code hl_variable" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a">next</a>;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordflow">return</span> head;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>}</div>
+</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span><span class="comment"> * @brief This function dealocates memory related to the given list</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span><span class="comment"> * It recursively deletes all of the nodes of the input list.</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span><span class="comment"> * @param room the root/head of the input list</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span><span class="comment"> * @warning Plese note that the memory for each node has to be alocated using</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span><span class="comment"> * new.</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span><span class="keywordtype">void</span> deleteList(<a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *<span class="keyword">const</span> root) {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="keywordflow">if</span> (root != NULL) {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        deleteList(root-&gt;next);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        <span class="keyword">delete</span> root;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    }</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>}</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="foldopen" id="foldopen00115" data-start="{" data-end="}">
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"><a class="line" href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">  115</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">sublistSearch</a>(<a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *sublist, <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *mainList) {</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <span class="keywordflow">if</span> (sublist == <span class="keyword">nullptr</span> || mainList == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    }</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *target_ptr = sublist;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span> </div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    <span class="keywordflow">while</span> (mainList != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *main_ptr = mainList;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <span class="keywordflow">while</span> (target_ptr != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>            <span class="keywordflow">if</span> (main_ptr == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (main_ptr-&gt;<a class="code hl_variable" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b">data</a> == target_ptr-&gt;<a class="code hl_variable" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b">data</a>) {</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>                target_ptr = target_ptr-&gt;<a class="code hl_variable" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a">next</a>;</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>                main_ptr = main_ptr-&gt;<a class="code hl_variable" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a">next</a>;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span> </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>            }</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        }</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        <span class="keywordflow">if</span> (target_ptr == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        }</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span> </div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>        target_ptr = sublist;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        mainList = mainList-&gt;<a class="code hl_variable" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a">next</a>;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    }</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span> </div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>}</div>
+</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span> </div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>}  <span class="comment">// namespace sublist_search</span></div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>}  <span class="comment">// namespace search</span></div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span> </div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span><span class="keyword">class </span><a class="code hl_class" href="../../d5/d58/class_test_cases.html">TestCases</a> {</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00176" data-start="{" data-end="}">
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"><a class="line" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">  176</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(T msg) {</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        <span class="comment">// It&#39;s just to avoid writing cout and endl</span></div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;[TESTS] : ---&gt; &quot;</span> &lt;&lt; msg &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    }</div>
+</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span> </div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00186" data-start="{" data-end="}">
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"><a class="line" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">  186</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a>() {</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running Tests...&quot;</span>);</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span> </div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>();</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>();</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>();</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span> </div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Test Cases over!&quot;</span>);</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    }</div>
+</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span> </div>
+<div class="foldopen" id="foldopen00201" data-start="{" data-end="}">
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"><a class="line" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">  201</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>() {</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>        <span class="keyword">const</span> <span class="keywordtype">bool</span> expectedOutput = <span class="keyword">true</span>;  </div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span> </div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>            <span class="stringliteral">&quot;~&quot;</span>);</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 1 for sublist search Algorithm : &quot;</span>);</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;   EDGE CASE : Only contains one element&quot;</span>);</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span> </div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>        std::vector&lt;uint64_t&gt; sublistData = {</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>            6};  </div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>        std::vector&lt;uint64_t&gt; mainlistData = {</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>            2, 5, 6, 7,</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>            8};  </div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span> </div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>        <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *sublistLL =</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>            search::sublist_search::makeLinkedList(</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>                sublistData);  </div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>        <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *mainlistLL =</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>            search::sublist_search::makeLinkedList(</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>                mainlistData);  </div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span> </div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>        <span class="keywordtype">bool</span> exists = search::sublist_search::sublistSearch(</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>            sublistLL, mainlistLL);  </div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span> </div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>        assert(exists == expectedOutput);</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span> </div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 1 PASS!&quot;</span>);</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>            <span class="stringliteral">&quot;~&quot;</span>);</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span> </div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>        deleteList(mainlistLL);</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>        deleteList(sublistLL);</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    }</div>
+</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span> </div>
+<div class="foldopen" id="foldopen00244" data-start="{" data-end="}">
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"><a class="line" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">  244</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>() {</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>        <span class="keyword">const</span> <span class="keywordtype">bool</span> expectedOutput = <span class="keyword">true</span>;  </div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span> </div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>            <span class="stringliteral">&quot;~&quot;</span>);</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 2 for sublist search Algorithm : &quot;</span>);</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;   contains main list of 100 elements and sublist of 20&quot;</span>);</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span> </div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>        std::vector&lt;uint64_t&gt; sublistData(</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>            20);  </div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>        std::vector&lt;uint64_t&gt; mainlistData(</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>            100);  </div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span> </div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 100; i++) {</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>            mainlistData[i] = i + 1;</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>        }</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span> </div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>        <span class="keywordtype">int</span> temp = 0;</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 45; i &lt; 65; i++) {</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>            sublistData[temp] = i + 1;</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>            temp++;</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>        }</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span> </div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>        <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *sublistLL =</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>            search::sublist_search::makeLinkedList(</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>                sublistData);  </div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>        <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *mainlistLL =</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>            search::sublist_search::makeLinkedList(</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>                mainlistData);  </div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span> </div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>        <span class="keywordtype">bool</span> exists = search::sublist_search::sublistSearch(</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>            sublistLL, mainlistLL);  </div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span> </div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>        assert(exists == expectedOutput);</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span> </div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 2 PASS!&quot;</span>);</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>            <span class="stringliteral">&quot;~&quot;</span>);</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span> </div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>        deleteList(mainlistLL);</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>        deleteList(sublistLL);</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>    }</div>
+</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span> </div>
+<div class="foldopen" id="foldopen00298" data-start="{" data-end="}">
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"><a class="line" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">  298</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>() {</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>        <span class="keyword">const</span> <span class="keywordtype">bool</span> expectedOutput = <span class="keyword">false</span>;  </div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span> </div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>            <span class="stringliteral">&quot;~&quot;</span>);</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 3 for sublist search Algorithm : &quot;</span>);</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;   contains main list of 50 elements and sublist of 20&quot;</span>);</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span> </div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>        std::vector&lt;uint64_t&gt; sublistData(20);  </div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>        std::vector&lt;uint64_t&gt; mainlistData(</div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>            50);  </div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span> </div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 50; i++) {</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>            mainlistData.push_back(i + 1);</div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>        }</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span> </div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 45; i &lt; 65; i++) {</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>            sublistData.push_back(i + 1);</div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>        }</div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span> </div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>        <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *sublistLL =</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>            search::sublist_search::makeLinkedList(</div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>                sublistData);  </div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>        <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *mainlistLL =</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>            search::sublist_search::makeLinkedList(</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>                mainlistData);  </div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span> </div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>        <span class="keywordtype">bool</span> exists = search::sublist_search::sublistSearch(</div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>            sublistLL, mainlistLL);  </div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span> </div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>        assert(exists == expectedOutput);</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span> </div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 3 PASS!&quot;</span>);</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>        <a class="code hl_function" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>            <span class="stringliteral">&quot;~&quot;</span>);</div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span> </div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>        deleteList(mainlistLL);</div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>        deleteList(sublistLL);</div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>    }</div>
+</div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>};</div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span> </div>
+<div class="foldopen" id="foldopen00349" data-start="{" data-end="}">
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"><a class="line" href="../../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  349</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>    <a class="code hl_class" href="../../d5/d58/class_test_cases.html">TestCases</a> tc;</div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>    tc.<a class="code hl_function" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a>();</div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>}</div>
+</div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span> </div>
+<div class="foldopen" id="foldopen00360" data-start="{" data-end="}">
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"><a class="line" href="../../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">  360</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[]) {</div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>    <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span> </div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>    std::vector&lt;uint64_t&gt; mainlistData = {</div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>        2, 5, 6, 7, 8};  </div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>    std::vector&lt;uint64_t&gt; sublistData = {6, 8};  </div>
+<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span> </div>
+<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>    <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *mainlistLL =</div>
+<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>        search::sublist_search::makeLinkedList(mainlistData);</div>
+<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>    <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *sublistLL =</div>
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>        search::sublist_search::makeLinkedList(</div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>            sublistData);  </div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span> </div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>    <span class="keywordtype">bool</span> exists = search::sublist_search::sublistSearch(</div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>        sublistLL,</div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>        mainlistLL);  </div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span> </div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sublist: &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>    search::sublist_search::printLinkedList(sublistLL);</div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span> </div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Main list: &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>    search::sublist_search::printLinkedList(mainlistLL);</div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span> </div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>    <span class="keywordflow">if</span> (exists) {</div>
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;[TRUE] - sublist found in main list\n&quot;</span>;</div>
+<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;[FALSE] - sublist NOT found in main list\n&quot;</span>;</div>
+<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>    }</div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span> </div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>    deleteList(mainlistLL);</div>
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>    deleteList(sublistLL);</div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>}</div>
+</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="aclass_test_cases_html"><div class="ttname"><a href="../../d5/d58/class_test_cases.html">TestCases</a></div><div class="ttdoc">class encapsulating the necessary test cases</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00225">inorder_successor_of_bst.cpp:225</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_aa3aa3d5bf666f327ee8e2d11d397b06e"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">TestCases::log</a></div><div class="ttdeci">void log(T msg)</div><div class="ttdoc">A function to print given message on console.</div><div class="ttdef"><b>Definition</b> <a href="#l00176">sublist_search.cpp:176</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_abae0148985f159b582a385cf399254e3"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">TestCases::testCase_2</a></div><div class="ttdeci">void testCase_2()</div><div class="ttdoc">A test case which contains main list of 100 elements and sublist of 20.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00304">inorder_successor_of_bst.cpp:304</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_ac2636e8b5b9e053374c45bfcf0603008"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">TestCases::testCase_1</a></div><div class="ttdeci">void testCase_1()</div><div class="ttdoc">A test case contains edge case, printing inorder successor of last node.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00259">inorder_successor_of_bst.cpp:259</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_ad9f95c09931625b41e3be1f88d1e28c5"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">TestCases::testCase_3</a></div><div class="ttdeci">void testCase_3()</div><div class="ttdoc">A test case which contains main list of 50 elements and sublist of 20.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00345">inorder_successor_of_bst.cpp:345</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_aeabea90c02f9159e4a784bbf736e1e23"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">TestCases::runTests</a></div><div class="ttdeci">void runTests()</div><div class="ttdoc">Executes test cases.</div><div class="ttdef"><b>Definition</b> <a href="#l00186">sublist_search.cpp:186</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> <a href="../../df/dd5/binary__search_8cpp_source.html#l00047">binary_search.cpp:47</a></div></div>
+<div class="ttc" id="anamespacesublist__search_html"><div class="ttname"><a href="../../d9/def/namespacesublist__search.html">sublist_search</a></div><div class="ttdoc">Functions for the Sublist Search implementation.</div></div>
+<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+<div class="ttc" id="astructsearch_1_1sublist__search_1_1_node_html"><div class="ttname"><a href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a></div><div class="ttdoc">A Node structure representing a single link Node in a linked list.</div><div class="ttdef"><b>Definition</b> <a href="#l00048">sublist_search.cpp:48</a></div></div>
+<div class="ttc" id="astructsearch_1_1sublist__search_1_1_node_html_a912ae0b339da401fc33ad21494c60e2b"><div class="ttname"><a href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b">search::sublist_search::Node::data</a></div><div class="ttdeci">uint32_t data</div><div class="ttdoc">the key/value of the node</div><div class="ttdef"><b>Definition</b> <a href="#l00049">sublist_search.cpp:49</a></div></div>
+<div class="ttc" id="astructsearch_1_1sublist__search_1_1_node_html_afe96e03dd6a404480ab43d1e88363a7a"><div class="ttname"><a href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a">search::sublist_search::Node::next</a></div><div class="ttdeci">Node * next</div><div class="ttdoc">pointer to the next node</div><div class="ttdef"><b>Definition</b> <a href="#l00050">sublist_search.cpp:50</a></div></div>
+<div class="ttc" id="asublist__search_8cpp_html_a4faee403e2758aaab682ed6622ae218c"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a></div><div class="ttdeci">bool sublistSearch(Node *sublist, Node *mainList)</div><div class="ttdoc">Main searching function.</div><div class="ttdef"><b>Definition</b> <a href="#l00115">sublist_search.cpp:115</a></div></div>
+<div class="ttc" id="asublist__search_8cpp_html_a70ca8d0267008e09cfa50b4e2ddfbe53"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a></div><div class="ttdeci">Node * makeLinkedList(const std::vector&lt; uint64_t &gt; &amp;data)</div><div class="ttdoc">Give a vector of data, it adds each element of vector in the linked list and return the address of he...</div><div class="ttdef"><b>Definition</b> <a href="#l00074">sublist_search.cpp:74</a></div></div>
+<div class="ttc" id="asublist__search_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d45/sublist__search_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> <a href="#l00349">sublist_search.cpp:349</a></div></div>
+<div class="ttc" id="asublist__search_8cpp_html_ad1028bc215281d62e344af99da57fab2"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2">search::sublist_search::printLinkedList</a></div><div class="ttdeci">void printLinkedList(Node *start)</div><div class="ttdoc">A simple function to print the linked list.</div><div class="ttdef"><b>Definition</b> <a href="#l00058">sublist_search.cpp:58</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../d5/d45/sublist__search_8cpp.html">sublist_search.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/d46/classdata__structures_1_1trie__using__hashmap_1_1_trie-members.html b/d5/d46/classdata__structures_1_1trie__using__hashmap_1_1_trie-members.html
index 4463555dc..319ace1f5 100644
--- a/d5/d46/classdata__structures_1_1trie__using__hashmap_1_1_trie-members.html
+++ b/d5/d46/classdata__structures_1_1trie__using__hashmap_1_1_trie-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d5/d4c/group__sorting.html b/d5/d4c/group__sorting.html
index d4627fb12..dbc5061b9 100644
--- a/d5/d4c/group__sorting.html
+++ b/d5/d4c/group__sorting.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Sorting Algorithm</title>
+<title>TheAlgorithms/C++: Sorting Algorithm</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -144,7 +161,7 @@ Functions</h2></td></tr>
 <tr class="memitem:gae66f6b31b5ad750f1fe042a706a4e3d4" id="r_gae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
 <tr class="separator:gae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ga135e4c638e3bcf548bd122b5f49a3e72" id="r_ga135e4c638e3bcf548bd122b5f49a3e72"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ga135e4c638e3bcf548bd122b5f49a3e72"><td class="memTemplItemLeft" align="right" valign="top">static void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;arr)</td></tr>
+<tr class="memitem:ga135e4c638e3bcf548bd122b5f49a3e72"><td class="memTemplItemLeft" align="right" valign="top">static void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a> (const std::vector&lt; T &gt; &amp;arr)</td></tr>
 <tr class="memdesc:ga135e4c638e3bcf548bd122b5f49a3e72"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function used for printing the elements. Prints elements of the array after they're sorted using wiggle sort algorithm.  <br /></td></tr>
 <tr class="separator:ga135e4c638e3bcf548bd122b5f49a3e72"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:gaa8dca7b867074164d5f45b0f3851269d" id="r_gaa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#gaa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -175,7 +192,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">static void displayElements </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -193,33 +210,27 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
-<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html#a4">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp</a>.</dd>
+<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html#a1">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp</a>.</dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dcc/wiggle__sort_8cpp_source.html#l00086">86</a> of file <a class="el" href="../../d1/dcc/wiggle__sort_8cpp_source.html">wiggle_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   86</span>                                                     {</div>
-<div class="line"><span class="lineno">   87</span>    uint32_t size = 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">   87</span>    uint32_t size = arr.size();</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/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Sorted elements are as follows: &quot;</span>;</div>
+<div class="line"><span class="lineno">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted elements are as follows: &quot;</span>;</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/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;[&quot;</span>;</div>
+<div class="line"><span class="lineno">   91</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;[&quot;</span>;</div>
 <div class="line"><span class="lineno">   92</span> </div>
 <div class="line"><span class="lineno">   93</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
-<div class="line"><span class="lineno">   94</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; arr[i];</div>
+<div class="line"><span class="lineno">   94</span>        std::cout &lt;&lt; arr[i];</div>
 <div class="line"><span class="lineno">   95</span>        <span class="keywordflow">if</span> (i != size - 1) {</div>
-<div class="line"><span class="lineno">   96</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><span class="lineno">   96</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;, &quot;</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> </div>
-<div class="line"><span class="lineno">  100</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;]&quot;</span> &lt;&lt; <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">  100</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;]&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  101</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="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="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><!-- 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="../../d5/d4c/group__sorting_ga135e4c638e3bcf548bd122b5f49a3e72_cgraph.svg" width="292" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="gabd9a93f241c5c86f2ec0abf8b66b4145" name="gabd9a93f241c5c86f2ec0abf8b66b4145"></a>
@@ -247,6 +258,8 @@ template&lt;typename T &gt; </div>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d52/heap__sort_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d2/d52/heap__sort_8cpp_source.html">heap_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   58</span>                                   {</div>
 <div class="line"><span class="lineno">   59</span>    <span class="keywordtype">int</span> largest = i;</div>
 <div class="line"><span class="lineno">   60</span>    <span class="keywordtype">int</span> l = 2 * i + 1;</div>
@@ -259,11 +272,10 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   67</span>        largest = r;</div>
 <div class="line"><span class="lineno">   68</span> </div>
 <div class="line"><span class="lineno">   69</span>    <span class="keywordflow">if</span> (largest != i) {</div>
-<div class="line"><span class="lineno">   70</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(arr[i], arr[largest]);</div>
+<div class="line"><span class="lineno">   70</span>        std::swap(arr[i], arr[largest]);</div>
 <div class="line"><span class="lineno">   71</span>        heapify(arr, n, largest);</div>
 <div class="line"><span class="lineno">   72</span>    }</div>
 <div class="line"><span class="lineno">   73</span>}</div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -295,20 +307,17 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d52/heap__sort_8cpp_source.html#l00084">84</a> of file <a class="el" href="../../d2/d52/heap__sort_8cpp_source.html">heap_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   84</span>                             {</div>
 <div class="line"><span class="lineno">   85</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = n - 1; i &gt;= 0; i--) heapify(arr, n, i);</div>
 <div class="line"><span class="lineno">   86</span> </div>
 <div class="line"><span class="lineno">   87</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = n - 1; i &gt;= 0; i--) {</div>
-<div class="line"><span class="lineno">   88</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(arr[0], arr[i]);</div>
+<div class="line"><span class="lineno">   88</span>        std::swap(arr[0], arr[i]);</div>
 <div class="line"><span class="lineno">   89</span>        heapify(arr, i, 0);</div>
 <div class="line"><span class="lineno">   90</span>    }</div>
 <div class="line"><span class="lineno">   91</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d4c/group__sorting_ga29d28b140174dbdde7c9f5157758435f_cgraph.svg" width="211" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="gae66f6b31b5ad750f1fe042a706a4e3d4" name="gae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -327,29 +336,25 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 <p>Main function</p>
 <p>Driver Code </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html#l00090">90</a> of file <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html">merge_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   90</span>           {</div>
 <div class="line"><span class="lineno">   91</span>    <span class="keywordtype">int</span> size;</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> &lt;&lt; <span class="stringliteral">&quot;Enter the number of elements : &quot;</span>;</div>
-<div class="line"><span class="lineno">   93</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; size;</div>
+<div class="line"><span class="lineno">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of elements : &quot;</span>;</div>
+<div class="line"><span class="lineno">   93</span>    std::cin &gt;&gt; size;</div>
 <div class="line"><span class="lineno">   94</span>    <span class="keywordtype">int</span> *arr = <span class="keyword">new</span> <span class="keywordtype">int</span>[size];</div>
-<div class="line"><span class="lineno">   95</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the unsorted elements : &quot;</span>;</div>
+<div class="line"><span class="lineno">   95</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the unsorted elements : &quot;</span>;</div>
 <div class="line"><span class="lineno">   96</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
-<div class="line"><span class="lineno">   97</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; arr[i];</div>
+<div class="line"><span class="lineno">   97</span>        std::cin &gt;&gt; arr[i];</div>
 <div class="line"><span class="lineno">   98</span>    }</div>
 <div class="line"><span class="lineno">   99</span>    <a class="code hl_function" href="#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, 0, size - 1);</div>
-<div class="line"><span class="lineno">  100</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Sorted array : &quot;</span>;</div>
+<div class="line"><span class="lineno">  100</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted array : &quot;</span>;</div>
 <div class="line"><span class="lineno">  101</span>    show(arr, size);</div>
 <div class="line"><span class="lineno">  102</span>    <span class="keyword">delete</span>[] arr;</div>
 <div class="line"><span class="lineno">  103</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  104</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="agroup__sorting_html_gab6b14fea48d9841e29b9fc26be6e05d7"><div class="ttname"><a href="#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a></div><div class="ttdeci">void mergeSort(int *arr, int l, int r)</div><div class="ttdef"><b>Definition</b> merge_sort.cpp:71</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d4c/group__sorting_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="295" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agroup__sorting_html_gab6b14fea48d9841e29b9fc26be6e05d7"><div class="ttname"><a href="#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a></div><div class="ttdeci">void mergeSort(int *arr, int l, int r)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/df4/merge__sort_8cpp_source.html#l00071">merge_sort.cpp:71</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ga460c61cd948203b4816bef2accb3fc73" name="ga460c61cd948203b4816bef2accb3fc73"></a>
@@ -396,6 +401,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html">merge_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   33</span>                                          {</div>
 <div class="line"><span class="lineno">   34</span>    <span class="keywordtype">int</span> i, j, k;</div>
 <div class="line"><span class="lineno">   35</span>    <span class="keywordtype">int</span> n1 = m - l + 1;</div>
@@ -423,7 +430,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   57</span>    <span class="keyword">delete</span>[] L;</div>
 <div class="line"><span class="lineno">   58</span>    <span class="keyword">delete</span>[] R;</div>
 <div class="line"><span class="lineno">   59</span>}</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -459,6 +466,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html#l00071">71</a> of file <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html">merge_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   71</span>                                       {</div>
 <div class="line"><span class="lineno">   72</span>    <span class="keywordflow">if</span> (l &lt; r) {</div>
 <div class="line"><span class="lineno">   73</span>        <span class="keywordtype">int</span> m = l + (r - l) / 2;</div>
@@ -467,13 +476,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   76</span>        <a class="code hl_function" href="#ga460c61cd948203b4816bef2accb3fc73">merge</a>(arr, l, m, r);</div>
 <div class="line"><span class="lineno">   77</span>    }</div>
 <div class="line"><span class="lineno">   78</span>}</div>
-<div class="ttc" id="agroup__sorting_html_ga460c61cd948203b4816bef2accb3fc73"><div class="ttname"><a href="#ga460c61cd948203b4816bef2accb3fc73">merge</a></div><div class="ttdeci">void merge(int *arr, int l, int m, int r)</div><div class="ttdef"><b>Definition</b> merge_sort.cpp:33</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d4c/group__sorting_gab6b14fea48d9841e29b9fc26be6e05d7_cgraph.svg" width="198" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agroup__sorting_html_ga460c61cd948203b4816bef2accb3fc73"><div class="ttname"><a href="#ga460c61cd948203b4816bef2accb3fc73">merge</a></div><div class="ttdeci">void merge(int *arr, int l, int m, int r)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/df4/merge__sort_8cpp_source.html#l00033">merge_sort.cpp:33</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ga0a9a57a1f1bbba3d4822531d002b7e07" name="ga0a9a57a1f1bbba3d4822531d002b7e07"></a>
@@ -495,9 +499,11 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Utility function used to print the array after sorting </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html#l00084">84</a> of file <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html">merge_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   84</span>                              {</div>
-<div class="line"><span class="lineno">   85</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
-<div class="line"><span class="lineno">   86</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   85</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   86</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   87</span>}</div>
 </div><!-- fragment -->
 </div>
@@ -525,15 +531,17 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Test function </p><dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dcc/wiggle__sort_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../d1/dcc/wiggle__sort_8cpp_source.html">wiggle_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  107</span>                   {</div>
-<div class="line"><span class="lineno">  108</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>));  <span class="comment">// initialize random number generator</span></div>
+<div class="line"><span class="lineno">  108</span>    std::srand(std::time(<span class="keyword">nullptr</span>));  <span class="comment">// initialize random number generator</span></div>
 <div class="line"><span class="lineno">  109</span> </div>
-<div class="line"><span class="lineno">  110</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> data1(100);</div>
+<div class="line"><span class="lineno">  110</span>    std::vector&lt;float&gt; data1(100);</div>
 <div class="line"><span class="lineno">  111</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;d : data1) {  <span class="comment">// generate random numbers between -5.0 and 4.99</span></div>
-<div class="line"><span class="lineno">  112</span>        d = float(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 1000 - 500) / 100.f;</div>
+<div class="line"><span class="lineno">  112</span>        d = float(std::rand() % 1000 - 500) / 100.f;</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/container/vector.html">std::vector&lt;float&gt;</a> sorted = sorting::wiggle_sort::wiggleSort&lt;float&gt;(data1);</div>
+<div class="line"><span class="lineno">  115</span>    std::vector&lt;float&gt; sorted = sorting::wiggle_sort::wiggleSort&lt;float&gt;(data1);</div>
 <div class="line"><span class="lineno">  116</span> </div>
 <div class="line"><span class="lineno">  117</span>    <a class="code hl_function" href="#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a>(sorted);</div>
 <div class="line"><span class="lineno">  118</span> </div>
@@ -542,19 +550,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  121</span>               data1[j + 1] &gt;= data1[j + 2]);  <span class="comment">// check the validation condition</span></div>
 <div class="line"><span class="lineno">  122</span>    }</div>
 <div class="line"><span class="lineno">  123</span> </div>
-<div class="line"><span class="lineno">  124</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  124</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  125</span>}</div>
-<div class="ttc" id="agroup__sorting_html_ga135e4c638e3bcf548bd122b5f49a3e72"><div class="ttname"><a href="#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a></div><div class="ttdeci">static void displayElements(const std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Utility function used for printing the elements. Prints elements of the array after they're sorted us...</div><div class="ttdef"><b>Definition</b> wiggle_sort.cpp:86</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="383" height="236"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agroup__sorting_html_ga135e4c638e3bcf548bd122b5f49a3e72"><div class="ttname"><a href="#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a></div><div class="ttdeci">static void displayElements(const std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Utility function used for printing the elements. Prints elements of the array after they're sorted us...</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dcc/wiggle__sort_8cpp_source.html#l00086">wiggle_sort.cpp:86</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d5/d4c/group__sorting_ga135e4c638e3bcf548bd122b5f49a3e72_cgraph.map b/d5/d4c/group__sorting_ga135e4c638e3bcf548bd122b5f49a3e72_cgraph.map
deleted file mode 100644
index 673bd5acd..000000000
--- a/d5/d4c/group__sorting_ga135e4c638e3bcf548bd122b5f49a3e72_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="displayElements" name="displayElements">
-<area shape="rect" id="Node000001" title="Utility function used for printing the elements. Prints elements of the array after they&#39;re sorted us..." alt="" coords="5,31,123,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="193,5,264,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="123,32,177,23,178,29,124,37"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="171,55,286,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="124,49,156,54,155,59,123,55"/>
-</map>
diff --git a/d5/d4c/group__sorting_ga135e4c638e3bcf548bd122b5f49a3e72_cgraph.md5 b/d5/d4c/group__sorting_ga135e4c638e3bcf548bd122b5f49a3e72_cgraph.md5
deleted file mode 100644
index dcd04d46a..000000000
--- a/d5/d4c/group__sorting_ga135e4c638e3bcf548bd122b5f49a3e72_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1442fc5b3cf0c68c47301184d2ba4f06
\ No newline at end of file
diff --git a/d5/d4c/group__sorting_ga135e4c638e3bcf548bd122b5f49a3e72_cgraph.svg b/d5/d4c/group__sorting_ga135e4c638e3bcf548bd122b5f49a3e72_cgraph.svg
deleted file mode 100644
index 89eb840f8..000000000
--- a/d5/d4c/group__sorting_ga135e4c638e3bcf548bd122b5f49a3e72_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: displayElements Pages: 1 -->
-<svg width="219pt" height="64pt"
- viewBox="0.00 0.00 218.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>displayElements</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function used for printing the elements. Prints elements of the array after they&#39;re sorted us...">
-<polygon fill="#999999" stroke="#666666" points="88,-37.25 0,-37.25 0,-18 88,-18 88,-37.25"/>
-<text text-anchor="middle" x="44" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">displayElements</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194,-56.25 140.5,-56.25 140.5,-37 194,-37 194,-56.25"/>
-<text text-anchor="middle" x="167.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.43,-34.43C101.65,-36.5 116.05,-38.76 128.83,-40.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.12,-44.19 138.54,-42.28 129.2,-37.28 128.12,-44.19"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="210.5,-19.25 124,-19.25 124,0 210.5,0 210.5,-19.25"/>
-<text text-anchor="middle" x="167.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.43,-21.18C96.19,-20.03 104.36,-18.81 112.37,-17.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="112.65,-21.12 122.03,-16.19 111.63,-14.2 112.65,-21.12"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d4c/group__sorting_ga135e4c638e3bcf548bd122b5f49a3e72_cgraph_org.svg b/d5/d4c/group__sorting_ga135e4c638e3bcf548bd122b5f49a3e72_cgraph_org.svg
deleted file mode 100644
index 9adab3b25..000000000
--- a/d5/d4c/group__sorting_ga135e4c638e3bcf548bd122b5f49a3e72_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: displayElements Pages: 1 -->
-<svg width="219pt" height="64pt"
- viewBox="0.00 0.00 218.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>displayElements</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function used for printing the elements. Prints elements of the array after they&#39;re sorted us...">
-<polygon fill="#999999" stroke="#666666" points="88,-37.25 0,-37.25 0,-18 88,-18 88,-37.25"/>
-<text text-anchor="middle" x="44" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">displayElements</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194,-56.25 140.5,-56.25 140.5,-37 194,-37 194,-56.25"/>
-<text text-anchor="middle" x="167.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.43,-34.43C101.65,-36.5 116.05,-38.76 128.83,-40.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.12,-44.19 138.54,-42.28 129.2,-37.28 128.12,-44.19"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="210.5,-19.25 124,-19.25 124,0 210.5,0 210.5,-19.25"/>
-<text text-anchor="middle" x="167.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.43,-21.18C96.19,-20.03 104.36,-18.81 112.37,-17.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="112.65,-21.12 122.03,-16.19 111.63,-14.2 112.65,-21.12"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d4c/group__sorting_ga29d28b140174dbdde7c9f5157758435f_cgraph.map b/d5/d4c/group__sorting_ga29d28b140174dbdde7c9f5157758435f_cgraph.map
deleted file mode 100644
index 091c55e50..000000000
--- a/d5/d4c/group__sorting_ga29d28b140174dbdde7c9f5157758435f_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="heapSort" name="heapSort">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,79,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="127,5,205,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="79,16,111,16,111,21,79,21"/>
-</map>
diff --git a/d5/d4c/group__sorting_ga29d28b140174dbdde7c9f5157758435f_cgraph.md5 b/d5/d4c/group__sorting_ga29d28b140174dbdde7c9f5157758435f_cgraph.md5
deleted file mode 100644
index 630bbe4b8..000000000
--- a/d5/d4c/group__sorting_ga29d28b140174dbdde7c9f5157758435f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6ab57ead0e1fa927d2e6f118a7ddde2e
\ No newline at end of file
diff --git a/d5/d4c/group__sorting_ga29d28b140174dbdde7c9f5157758435f_cgraph.svg b/d5/d4c/group__sorting_ga29d28b140174dbdde7c9f5157758435f_cgraph.svg
deleted file mode 100644
index 08f5a8dac..000000000
--- a/d5/d4c/group__sorting_ga29d28b140174dbdde7c9f5157758435f_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: heapSort Pages: 1 -->
-<svg width="158pt" height="27pt"
- viewBox="0.00 0.00 157.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>heapSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="55,-19.25 0,-19.25 0,0 55,0 55,-19.25"/>
-<text text-anchor="middle" x="27.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">heapSort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149.75,-19.25 91,-19.25 91,0 149.75,0 149.75,-19.25"/>
-<text text-anchor="middle" x="120.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.27,-9.62C62.82,-9.62 71.19,-9.62 79.33,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.06,-13.13 89.06,-9.63 79.06,-6.13 79.06,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d4c/group__sorting_ga29d28b140174dbdde7c9f5157758435f_cgraph_org.svg b/d5/d4c/group__sorting_ga29d28b140174dbdde7c9f5157758435f_cgraph_org.svg
deleted file mode 100644
index 3504bf10f..000000000
--- a/d5/d4c/group__sorting_ga29d28b140174dbdde7c9f5157758435f_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: heapSort Pages: 1 -->
-<svg width="158pt" height="27pt"
- viewBox="0.00 0.00 157.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>heapSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="55,-19.25 0,-19.25 0,0 55,0 55,-19.25"/>
-<text text-anchor="middle" x="27.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">heapSort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149.75,-19.25 91,-19.25 91,0 149.75,0 149.75,-19.25"/>
-<text text-anchor="middle" x="120.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.27,-9.62C62.82,-9.62 71.19,-9.62 79.33,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.06,-13.13 89.06,-9.63 79.06,-6.13 79.06,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 5a557027e..000000000
--- a/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,107,49,132"/>
-<area shape="rect" id="Node000002" href="$d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72" title="Utility function used for printing the elements. Prints elements of the array after they&#39;re sorted us..." alt="" coords="97,5,214,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="37,104,63,77,95,48,112,37,115,41,98,52,66,81,41,108"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="262,55,377,80"/>
-<area shape="poly" id="edge5_Node000001_Node000004" title=" " alt="" coords="48,108,96,92,173,77,246,69,247,74,174,83,97,97,50,113"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="119,107,192,132"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="49,117,104,117,104,122,49,122"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="116,156,195,182"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="50,125,107,148,105,153,48,130"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="119,205,192,231"/>
-<area shape="poly" id="edge7_Node000001_Node000007" title=" " alt="" coords="40,131,64,161,98,192,107,197,104,202,95,196,60,165,36,134"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="284,5,355,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="215,16,268,16,268,21,215,21"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="202,29,261,47,259,52,200,34"/>
-</map>
diff --git a/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index a42f93232..000000000
--- a/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ad3d480613e96d531fd3d5a1d63bed59
\ No newline at end of file
diff --git a/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 1113ae328..000000000
--- a/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,164 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="287pt" height="177pt"
- viewBox="0.00 0.00 287.00 177.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 173.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-93.25 0,-93.25 0,-74 32.5,-74 32.5,-93.25"/>
-<text text-anchor="middle" x="16.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72" target="_top" xlink:title="Utility function used for printing the elements. Prints elements of the array after they&#39;re sorted us...">
-<polygon fill="white" stroke="#666666" points="156.5,-169.25 68.5,-169.25 68.5,-150 156.5,-150 156.5,-169.25"/>
-<text text-anchor="middle" x="112.5" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">displayElements</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.59,-93.66C35.18,-104.8 51.76,-122.88 68.5,-135.62 72.33,-138.54 76.55,-141.33 80.8,-143.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.9,-146.86 89.32,-148.77 82.37,-140.78 78.9,-146.86"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279,-132.25 192.5,-132.25 192.5,-113 279,-113 279,-132.25"/>
-<text text-anchor="middle" x="235.75" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.65,-90.42C42.68,-94.57 56.14,-99.63 68.5,-102.62 105.53,-111.58 148.21,-116.61 181.06,-119.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.49,-122.85 190.73,-120.15 181.04,-115.87 180.49,-122.85"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="139.62,-93.25 85.38,-93.25 85.38,-74 139.62,-74 139.62,-93.25"/>
-<text text-anchor="middle" x="112.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.81,-83.62C44.04,-83.62 59.68,-83.62 74.06,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.7,-87.13 83.7,-83.63 73.7,-80.13 73.7,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="142.25,-56.25 82.75,-56.25 82.75,-37 142.25,-37 142.25,-56.25"/>
-<text text-anchor="middle" x="112.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.81,-77.52C44.43,-72.96 60.77,-66.54 75.55,-60.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.52,-64.12 84.55,-57.21 73.96,-57.6 76.52,-64.12"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="139.62,-19.25 85.38,-19.25 85.38,0 139.62,0 139.62,-19.25"/>
-<text text-anchor="middle" x="112.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.19,-73.71C33.2,-61.46 49.96,-40.67 68.5,-27.62 70.54,-26.19 72.72,-24.83 74.97,-23.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.32,-26.8 83.72,-19.23 73.21,-20.53 76.32,-26.8"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.5,-169.25 209,-169.25 209,-150 262.5,-150 262.5,-169.25"/>
-<text text-anchor="middle" x="235.75" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.93,-159.62C170.15,-159.62 184.55,-159.62 197.33,-159.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="197.02,-163.13 207.02,-159.63 197.02,-156.13 197.02,-163.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.63,-149.51C160.27,-145.35 176.25,-140.48 190.84,-136.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.67,-139.43 200.21,-133.16 189.62,-132.74 191.67,-139.43"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 7162552cf..000000000
--- a/d5/d4c/group__sorting_gaa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,138 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="287pt" height="177pt"
- viewBox="0.00 0.00 287.00 177.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 173.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-93.25 0,-93.25 0,-74 32.5,-74 32.5,-93.25"/>
-<text text-anchor="middle" x="16.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72" target="_top" xlink:title="Utility function used for printing the elements. Prints elements of the array after they&#39;re sorted us...">
-<polygon fill="white" stroke="#666666" points="156.5,-169.25 68.5,-169.25 68.5,-150 156.5,-150 156.5,-169.25"/>
-<text text-anchor="middle" x="112.5" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">displayElements</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.59,-93.66C35.18,-104.8 51.76,-122.88 68.5,-135.62 72.33,-138.54 76.55,-141.33 80.8,-143.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.9,-146.86 89.32,-148.77 82.37,-140.78 78.9,-146.86"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279,-132.25 192.5,-132.25 192.5,-113 279,-113 279,-132.25"/>
-<text text-anchor="middle" x="235.75" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.65,-90.42C42.68,-94.57 56.14,-99.63 68.5,-102.62 105.53,-111.58 148.21,-116.61 181.06,-119.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.49,-122.85 190.73,-120.15 181.04,-115.87 180.49,-122.85"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="139.62,-93.25 85.38,-93.25 85.38,-74 139.62,-74 139.62,-93.25"/>
-<text text-anchor="middle" x="112.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.81,-83.62C44.04,-83.62 59.68,-83.62 74.06,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.7,-87.13 83.7,-83.63 73.7,-80.13 73.7,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="142.25,-56.25 82.75,-56.25 82.75,-37 142.25,-37 142.25,-56.25"/>
-<text text-anchor="middle" x="112.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.81,-77.52C44.43,-72.96 60.77,-66.54 75.55,-60.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.52,-64.12 84.55,-57.21 73.96,-57.6 76.52,-64.12"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="139.62,-19.25 85.38,-19.25 85.38,0 139.62,0 139.62,-19.25"/>
-<text text-anchor="middle" x="112.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.19,-73.71C33.2,-61.46 49.96,-40.67 68.5,-27.62 70.54,-26.19 72.72,-24.83 74.97,-23.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.32,-26.8 83.72,-19.23 73.21,-20.53 76.32,-26.8"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.5,-169.25 209,-169.25 209,-150 262.5,-150 262.5,-169.25"/>
-<text text-anchor="middle" x="235.75" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.93,-159.62C170.15,-159.62 184.55,-159.62 197.33,-159.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="197.02,-163.13 207.02,-159.63 197.02,-156.13 197.02,-163.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.63,-149.51C160.27,-145.35 176.25,-140.48 190.84,-136.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.67,-139.43 200.21,-133.16 189.62,-132.74 191.67,-139.43"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d4c/group__sorting_gab6b14fea48d9841e29b9fc26be6e05d7_cgraph.map b/d5/d4c/group__sorting_gab6b14fea48d9841e29b9fc26be6e05d7_cgraph.map
deleted file mode 100644
index 6c062200a..000000000
--- a/d5/d4c/group__sorting_gab6b14fea48d9841e29b9fc26be6e05d7_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="mergeSort" name="mergeSort">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,87,55"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="25,30,21,21,24,11,32,5,46,3,61,5,69,12,65,16,59,10,46,8,34,10,28,14,27,20,30,28"/>
-<area shape="rect" id="Node000002" href="$d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73" title=" " alt="" coords="135,29,192,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="87,40,119,40,119,45,87,45"/>
-</map>
diff --git a/d5/d4c/group__sorting_gab6b14fea48d9841e29b9fc26be6e05d7_cgraph.md5 b/d5/d4c/group__sorting_gab6b14fea48d9841e29b9fc26be6e05d7_cgraph.md5
deleted file mode 100644
index 5b7c8cbe5..000000000
--- a/d5/d4c/group__sorting_gab6b14fea48d9841e29b9fc26be6e05d7_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4b438d8d671d5122bcd72fe77cad63e9
\ No newline at end of file
diff --git a/d5/d4c/group__sorting_gab6b14fea48d9841e29b9fc26be6e05d7_cgraph.svg b/d5/d4c/group__sorting_gab6b14fea48d9841e29b9fc26be6e05d7_cgraph.svg
deleted file mode 100644
index 4ae0b3b38..000000000
--- a/d5/d4c/group__sorting_gab6b14fea48d9841e29b9fc26be6e05d7_cgraph.svg
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: mergeSort Pages: 1 -->
-<svg width="148pt" height="45pt"
- viewBox="0.00 0.00 148.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>mergeSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="61,-19.25 0,-19.25 0,0 61,0 61,-19.25"/>
-<text text-anchor="middle" x="30.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">mergeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M16.72,-19.54C10.44,-28.15 15.03,-37.25 30.5,-37.25 38.96,-37.25 44.17,-34.53 46.12,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="49.61,-30.32 44.52,-21.03 42.71,-31.47 49.61,-30.32"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="140,-19.25 97,-19.25 97,0 140,0 140,-19.25"/>
-<text text-anchor="middle" x="118.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">merge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.1,-9.62C68.84,-9.62 77.23,-9.62 85.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.02,-13.13 95.02,-9.63 85.02,-6.13 85.02,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d4c/group__sorting_gab6b14fea48d9841e29b9fc26be6e05d7_cgraph_org.svg b/d5/d4c/group__sorting_gab6b14fea48d9841e29b9fc26be6e05d7_cgraph_org.svg
deleted file mode 100644
index 3b0ea566d..000000000
--- a/d5/d4c/group__sorting_gab6b14fea48d9841e29b9fc26be6e05d7_cgraph_org.svg
+++ /dev/null
@@ -1,48 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: mergeSort Pages: 1 -->
-<svg width="148pt" height="45pt"
- viewBox="0.00 0.00 148.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>mergeSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="61,-19.25 0,-19.25 0,0 61,0 61,-19.25"/>
-<text text-anchor="middle" x="30.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">mergeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M16.72,-19.54C10.44,-28.15 15.03,-37.25 30.5,-37.25 38.96,-37.25 44.17,-34.53 46.12,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="49.61,-30.32 44.52,-21.03 42.71,-31.47 49.61,-30.32"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="140,-19.25 97,-19.25 97,0 140,0 140,-19.25"/>
-<text text-anchor="middle" x="118.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">merge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.1,-9.62C68.84,-9.62 77.23,-9.62 85.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.02,-13.13 95.02,-9.63 85.02,-6.13 85.02,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d4c/group__sorting_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/d4c/group__sorting_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 9060742d2..000000000
--- a/d5/d4c/group__sorting_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,55,55"/>
-<area shape="rect" id="Node000002" href="$d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7" title=" " alt="" coords="103,29,184,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,40,87,40,87,45,55,45"/>
-<area shape="poly" id="edge3_Node000002_Node000002" title=" " alt="" coords="123,30,119,21,122,11,130,5,143,3,158,5,165,12,162,16,155,10,143,8,132,10,126,14,125,20,128,28"/>
-<area shape="rect" id="Node000003" href="$d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73" title=" " alt="" coords="232,29,289,55"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="184,40,216,40,216,45,184,45"/>
-</map>
diff --git a/d5/d4c/group__sorting_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/d4c/group__sorting_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index f58d9b14f..000000000
--- a/d5/d4c/group__sorting_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8f13ff1903df0c1f0834faffb68915f2
\ No newline at end of file
diff --git a/d5/d4c/group__sorting_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/d4c/group__sorting_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 563172b5b..000000000
--- a/d5/d4c/group__sorting_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="221pt" height="45pt"
- viewBox="0.00 0.00 221.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="134,-19.25 73,-19.25 73,0 134,0 134,-19.25"/>
-<text text-anchor="middle" x="103.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">mergeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.1,-9.62C44.17,-9.62 52.64,-9.62 61.1,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.99,-13.13 70.99,-9.63 60.99,-6.13 60.99,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.19,-19.54C84.12,-28.15 88.56,-37.25 103.5,-37.25 111.67,-37.25 116.7,-34.53 118.59,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.08,-30.35 117.05,-21.03 115.17,-31.46 122.08,-30.35"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="213,-19.25 170,-19.25 170,0 213,0 213,-19.25"/>
-<text text-anchor="middle" x="191.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">merge</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.1,-9.62C141.84,-9.62 150.23,-9.62 158.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.02,-13.13 168.02,-9.63 158.02,-6.13 158.02,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d4c/group__sorting_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/d4c/group__sorting_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index a6e815ca2..000000000
--- a/d5/d4c/group__sorting_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="221pt" height="45pt"
- viewBox="0.00 0.00 221.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="134,-19.25 73,-19.25 73,0 134,0 134,-19.25"/>
-<text text-anchor="middle" x="103.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">mergeSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.1,-9.62C44.17,-9.62 52.64,-9.62 61.1,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.99,-13.13 70.99,-9.63 60.99,-6.13 60.99,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.19,-19.54C84.12,-28.15 88.56,-37.25 103.5,-37.25 111.67,-37.25 116.7,-34.53 118.59,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.08,-30.35 117.05,-21.03 115.17,-31.46 122.08,-30.35"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="213,-19.25 170,-19.25 170,0 213,0 213,-19.25"/>
-<text text-anchor="middle" x="191.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">merge</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.1,-9.62C141.84,-9.62 150.23,-9.62 158.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.02,-13.13 168.02,-9.63 158.02,-6.13 158.02,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d4d/structciphers_1_1elliptic__curve__key__exchange_1_1_point-members.html b/d5/d4d/structciphers_1_1elliptic__curve__key__exchange_1_1_point-members.html
index db85ff1a1..dc8b1e3d8 100644
--- a/d5/d4d/structciphers_1_1elliptic__curve__key__exchange_1_1_point-members.html
+++ b/d5/d4d/structciphers_1_1elliptic__curve__key__exchange_1_1_point-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d5/d55/classgraph_1_1_rooted_tree-members.html b/d5/d55/classgraph_1_1_rooted_tree-members.html
index af999c480..9c37c7142 100644
--- a/d5/d55/classgraph_1_1_rooted_tree-members.html
+++ b/d5/d55/classgraph_1_1_rooted_tree-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d5/d58/class_test_cases.html b/d5/d58/class_test_cases.html
index 5f351f2f5..4091e0f3d 100644
--- a/d5/d58/class_test_cases.html
+++ b/d5/d58/class_test_cases.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: TestCases Class Reference</title>
+<title>TheAlgorithms/C++: TestCases Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -172,6 +189,8 @@ Private Member Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>class encapsulating the necessary test cases </p>
 <p>a class containing the necessary test cases </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00225">225</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="aa3aa3d5bf666f327ee8e2d11d397b06e" name="aa3aa3d5bf666f327ee8e2d11d397b06e"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">&#9670;&#160;</a></span>log() <span class="overload">[1/3]</span></h2>
@@ -206,18 +225,13 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00233">233</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  233</span>                    {</div>
 <div class="line"><span class="lineno">  234</span>        <span class="comment">// It&#39;s just to avoid writing cout and endl</span></div>
-<div class="line"><span class="lineno">  235</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;[TESTS] : ---&gt; &quot;</span> &lt;&lt; msg &lt;&lt; <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">  235</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;[TESTS] : ---&gt; &quot;</span> &lt;&lt; msg &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  236</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="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><!-- 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="../../d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.svg" width="240" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa3aa3d5bf666f327ee8e2d11d397b06e" name="aa3aa3d5bf666f327ee8e2d11d397b06e"></a>
@@ -253,16 +267,13 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html#l00176">176</a> of file <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html">sublist_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  176</span>                    {</div>
 <div class="line"><span class="lineno">  177</span>        <span class="comment">// It&#39;s just to avoid writing cout and endl</span></div>
-<div class="line"><span class="lineno">  178</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;[TESTS] : ---&gt; &quot;</span> &lt;&lt; msg &lt;&lt; <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">  178</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;[TESTS] : ---&gt; &quot;</span> &lt;&lt; msg &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  179</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.svg" width="240" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa3aa3d5bf666f327ee8e2d11d397b06e" name="aa3aa3d5bf666f327ee8e2d11d397b06e"></a>
@@ -298,16 +309,13 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00189">189</a> of file <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html">random_pivot_quick_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  189</span>                    {</div>
 <div class="line"><span class="lineno">  190</span>        <span class="comment">// It&#39;s just to avoid writing cout and endl</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> &lt;&lt; <span class="stringliteral">&quot;[TESTS] : ---&gt; &quot;</span> &lt;&lt; msg &lt;&lt; <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">  191</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;[TESTS] : ---&gt; &quot;</span> &lt;&lt; msg &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  192</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.svg" width="240" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aeabea90c02f9159e4a784bbf736e1e23" name="aeabea90c02f9159e4a784bbf736e1e23"></a>
@@ -335,6 +343,8 @@ Here is the call graph for this function:</div>
 
 <p>Executes test cases. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00243">243</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  243</span>                    {</div>
 <div class="line"><span class="lineno">  244</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running Tests...&quot;</span>);</div>
 <div class="line"><span class="lineno">  245</span> </div>
@@ -343,18 +353,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  248</span>        <a class="code hl_function" href="#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>();</div>
 <div class="line"><span class="lineno">  249</span> </div>
 <div class="line"><span class="lineno">  250</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Test Cases over!&quot;</span>);</div>
-<div class="line"><span class="lineno">  251</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  251</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  252</span>    }</div>
-<div class="ttc" id="aclass_test_cases_html_aa3aa3d5bf666f327ee8e2d11d397b06e"><div class="ttname"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">TestCases::log</a></div><div class="ttdeci">void log(T msg)</div><div class="ttdoc">A function to print given message on console.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:233</div></div>
-<div class="ttc" id="aclass_test_cases_html_abae0148985f159b582a385cf399254e3"><div class="ttname"><a href="#abae0148985f159b582a385cf399254e3">TestCases::testCase_2</a></div><div class="ttdeci">void testCase_2()</div><div class="ttdoc">A test case which contains main list of 100 elements and sublist of 20.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:304</div></div>
-<div class="ttc" id="aclass_test_cases_html_ac2636e8b5b9e053374c45bfcf0603008"><div class="ttname"><a href="#ac2636e8b5b9e053374c45bfcf0603008">TestCases::testCase_1</a></div><div class="ttdeci">void testCase_1()</div><div class="ttdoc">A test case contains edge case, printing inorder successor of last node.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:259</div></div>
-<div class="ttc" id="aclass_test_cases_html_ad9f95c09931625b41e3be1f88d1e28c5"><div class="ttname"><a href="#ad9f95c09931625b41e3be1f88d1e28c5">TestCases::testCase_3</a></div><div class="ttdeci">void testCase_3()</div><div class="ttdoc">A test case which contains main list of 50 elements and sublist of 20.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:345</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg" width="638" height="223"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclass_test_cases_html_aa3aa3d5bf666f327ee8e2d11d397b06e"><div class="ttname"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">TestCases::log</a></div><div class="ttdeci">void log(T msg)</div><div class="ttdoc">A function to print given message on console.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00233">inorder_successor_of_bst.cpp:233</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_abae0148985f159b582a385cf399254e3"><div class="ttname"><a href="#abae0148985f159b582a385cf399254e3">TestCases::testCase_2</a></div><div class="ttdeci">void testCase_2()</div><div class="ttdoc">A test case which contains main list of 100 elements and sublist of 20.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00304">inorder_successor_of_bst.cpp:304</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_ac2636e8b5b9e053374c45bfcf0603008"><div class="ttname"><a href="#ac2636e8b5b9e053374c45bfcf0603008">TestCases::testCase_1</a></div><div class="ttdeci">void testCase_1()</div><div class="ttdoc">A test case contains edge case, printing inorder successor of last node.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00259">inorder_successor_of_bst.cpp:259</a></div></div>
+<div class="ttc" id="aclass_test_cases_html_ad9f95c09931625b41e3be1f88d1e28c5"><div class="ttname"><a href="#ad9f95c09931625b41e3be1f88d1e28c5">TestCases::testCase_3</a></div><div class="ttdeci">void testCase_3()</div><div class="ttdoc">A test case which contains main list of 50 elements and sublist of 20.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00345">inorder_successor_of_bst.cpp:345</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aeabea90c02f9159e4a784bbf736e1e23" name="aeabea90c02f9159e4a784bbf736e1e23"></a>
@@ -382,6 +387,8 @@ Here is the call graph for this function:</div>
 
 <p>Executes test cases. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html#l00186">186</a> of file <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html">sublist_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  186</span>                    {</div>
 <div class="line"><span class="lineno">  187</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running Tests...&quot;</span>);</div>
 <div class="line"><span class="lineno">  188</span> </div>
@@ -390,14 +397,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  191</span>        <a class="code hl_function" href="#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>();</div>
 <div class="line"><span class="lineno">  192</span> </div>
 <div class="line"><span class="lineno">  193</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Test Cases over!&quot;</span>);</div>
-<div class="line"><span class="lineno">  194</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  194</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  195</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg" width="638" height="223"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aeabea90c02f9159e4a784bbf736e1e23" name="aeabea90c02f9159e4a784bbf736e1e23"></a>
@@ -425,6 +427,8 @@ Here is the call graph for this function:</div>
 
 <p>Executes test cases. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00199">199</a> of file <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html">random_pivot_quick_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  199</span>                    {</div>
 <div class="line"><span class="lineno">  200</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running Tests...&quot;</span>);</div>
 <div class="line"><span class="lineno">  201</span> </div>
@@ -433,14 +437,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  204</span>        <a class="code hl_function" href="#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>();</div>
 <div class="line"><span class="lineno">  205</span> </div>
 <div class="line"><span class="lineno">  206</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Test Cases over!&quot;</span>);</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> &lt;&lt; <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">  207</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  208</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg" width="638" height="223"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac2636e8b5b9e053374c45bfcf0603008" name="ac2636e8b5b9e053374c45bfcf0603008"></a>
@@ -474,9 +473,11 @@ Here is the call graph for this function:</div>
 <p>&lt; Printing inorder to cross-verify.</p>
 <p>&lt; The inorder successor node for given data</p>
 <p>memory cleanup!</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00259">259</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  259</span>                      {</div>
 <div class="line"><span class="lineno">  260</span>        <span class="keyword">const</span> <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
-<div class="line"><span class="lineno">  261</span>            *expectedOutput = <span class="keyword">nullptr</span>;  <span class="comment">///&lt; Expected output of this test</span></div>
+<div class="line"><span class="lineno">  261</span>            *expectedOutput = <span class="keyword">nullptr</span>;  </div>
 <div class="line"><span class="lineno">  262</span> </div>
 <div class="line"><span class="lineno">  263</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
 <div class="line"><span class="lineno">  264</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 1 : &quot;</span>);</div>
@@ -486,44 +487,38 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  268</span> </div>
 <div class="line"><span class="lineno">  269</span>        <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a> *root =</div>
 <div class="line"><span class="lineno">  270</span>            <span class="keyword">nullptr</span>;</div>
-<div class="line"><span class="lineno">  271</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> node_data{</div>
-<div class="line"><span class="lineno">  272</span>            20, 3, 5, 6, 2, 23, 45, 78, 21};  <span class="comment">///&lt; Data to make nodes in BST</span></div>
+<div class="line"><span class="lineno">  271</span>        std::vector&lt;int64_t&gt; node_data{</div>
+<div class="line"><span class="lineno">  272</span>            20, 3, 5, 6, 2, 23, 45, 78, 21};  </div>
 <div class="line"><span class="lineno">  273</span> </div>
 <div class="line"><span class="lineno">  274</span>        root = <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a>(</div>
 <div class="line"><span class="lineno">  275</span>            root,</div>
-<div class="line"><span class="lineno">  276</span>            node_data);  <span class="comment">///&lt; Adding nodes to BST</span></div>
+<div class="line"><span class="lineno">  276</span>            node_data);  </div>
 <div class="line"><span class="lineno">  277</span> </div>
-<div class="line"><span class="lineno">  278</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Inorder sequence is : &quot;</span>;</div>
+<div class="line"><span class="lineno">  278</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Inorder sequence is : &quot;</span>;</div>
 <div class="line"><span class="lineno">  279</span>        <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a>(</div>
-<div class="line"><span class="lineno">  280</span>            root);  <span class="comment">///&lt; Printing inorder to cross-verify.</span></div>
-<div class="line"><span class="lineno">  281</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  280</span>            root);  </div>
+<div class="line"><span class="lineno">  281</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  282</span> </div>
 <div class="line"><span class="lineno">  283</span>        <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
 <div class="line"><span class="lineno">  284</span>            *inorderSuccessor = operations_on_datastructures::</div>
 <div class="line"><span class="lineno">  285</span>                inorder_traversal_of_bst::getInorderSuccessor(</div>
-<div class="line"><span class="lineno">  286</span>                    root, 78);  <span class="comment">///&lt; The inorder successor node for given data</span></div>
+<div class="line"><span class="lineno">  286</span>                    root, 78);  </div>
 <div class="line"><span class="lineno">  287</span> </div>
 <div class="line"><span class="lineno">  288</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
 <div class="line"><span class="lineno">  289</span>        assert(inorderSuccessor == expectedOutput);</div>
 <div class="line"><span class="lineno">  290</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
 <div class="line"><span class="lineno">  291</span> </div>
 <div class="line"><span class="lineno">  292</span>        <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a>(</div>
-<div class="line"><span class="lineno">  293</span>            root);  <span class="comment">/// memory cleanup!</span></div>
+<div class="line"><span class="lineno">  293</span>            root);  </div>
 <div class="line"><span class="lineno">  294</span> </div>
 <div class="line"><span class="lineno">  295</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 1 PASS!&quot;</span>);</div>
 <div class="line"><span class="lineno">  296</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
 <div class="line"><span class="lineno">  297</span>    }</div>
-<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div><div class="ttdoc">A Node structure representing a single node in BST.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:56</div></div>
-<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a05fe8a029e155c43e4efa598d4d089d9"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a></div><div class="ttdeci">Node * makeBST(Node *root, const std::vector&lt; int64_t &gt; &amp;data)</div><div class="ttdoc">This function is used in test cases to quickly create BST containing large data instead of hard codin...</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:155</div></div>
-<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a5d7266b934ca50c4f53e4f1e725d89a4"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a></div><div class="ttdeci">void printInorder(Node *root)</div><div class="ttdoc">Prints the BST in inorder traversal using recursion.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:136</div></div>
-<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a7b20eb99272665c1777949e26ab59589"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a></div><div class="ttdeci">void deallocate(Node *rootNode)</div><div class="ttdoc">This function clears the memory allocated to entire tree recursively. Its just for clean up the memor...</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:210</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg" width="447" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div><div class="ttdoc">A Node structure representing a single node in BST.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00056">inorder_successor_of_bst.cpp:56</a></div></div>
+<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a05fe8a029e155c43e4efa598d4d089d9"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a></div><div class="ttdeci">Node * makeBST(Node *root, const std::vector&lt; int64_t &gt; &amp;data)</div><div class="ttdoc">This function is used in test cases to quickly create BST containing large data instead of hard codin...</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00155">inorder_successor_of_bst.cpp:155</a></div></div>
+<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a5d7266b934ca50c4f53e4f1e725d89a4"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a></div><div class="ttdeci">void printInorder(Node *root)</div><div class="ttdoc">Prints the BST in inorder traversal using recursion.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00136">inorder_successor_of_bst.cpp:136</a></div></div>
+<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a7b20eb99272665c1777949e26ab59589"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a></div><div class="ttdeci">void deallocate(Node *rootNode)</div><div class="ttdoc">This function clears the memory allocated to entire tree recursively. Its just for clean up the memor...</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00210">inorder_successor_of_bst.cpp:210</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac2636e8b5b9e053374c45bfcf0603008" name="ac2636e8b5b9e053374c45bfcf0603008"></a>
@@ -557,8 +552,10 @@ Here is the call graph for this function:</div>
 <p>&lt; Sublist to be searched</p>
 <p>&lt; Main list in which sublist is to be searched</p>
 <p>&lt; boolean, if sublist exist or not</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html#l00201">201</a> of file <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html">sublist_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  201</span>                      {</div>
-<div class="line"><span class="lineno">  202</span>        <span class="keyword">const</span> <span class="keywordtype">bool</span> expectedOutput = <span class="keyword">true</span>;  <span class="comment">///&lt; Expected output of this test</span></div>
+<div class="line"><span class="lineno">  202</span>        <span class="keyword">const</span> <span class="keywordtype">bool</span> expectedOutput = <span class="keyword">true</span>;  </div>
 <div class="line"><span class="lineno">  203</span> </div>
 <div class="line"><span class="lineno">  204</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
 <div class="line"><span class="lineno">  205</span>            <span class="stringliteral">&quot;~&quot;</span>);</div>
@@ -566,22 +563,21 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  207</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
 <div class="line"><span class="lineno">  208</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;   EDGE CASE : Only contains one element&quot;</span>);</div>
 <div class="line"><span class="lineno">  209</span> </div>
-<div class="line"><span class="lineno">  210</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> sublistData = {</div>
-<div class="line"><span class="lineno">  211</span>            6};  <span class="comment">///&lt; Data to make linked list which will be the sublist</span></div>
-<div class="line"><span class="lineno">  212</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> mainlistData = {</div>
+<div class="line"><span class="lineno">  210</span>        std::vector&lt;uint64_t&gt; sublistData = {</div>
+<div class="line"><span class="lineno">  211</span>            6};  </div>
+<div class="line"><span class="lineno">  212</span>        std::vector&lt;uint64_t&gt; mainlistData = {</div>
 <div class="line"><span class="lineno">  213</span>            2, 5, 6, 7,</div>
-<div class="line"><span class="lineno">  214</span>            8};  <span class="comment">///&lt; Data to make linked list which will be the main list</span></div>
+<div class="line"><span class="lineno">  214</span>            8};  </div>
 <div class="line"><span class="lineno">  215</span> </div>
 <div class="line"><span class="lineno">  216</span>        <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *sublistLL =</div>
 <div class="line"><span class="lineno">  217</span>            <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a>(</div>
-<div class="line"><span class="lineno">  218</span>                sublistData);  <span class="comment">///&lt; Sublist to be searched</span></div>
+<div class="line"><span class="lineno">  218</span>                sublistData);  </div>
 <div class="line"><span class="lineno">  219</span>        <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *mainlistLL =</div>
 <div class="line"><span class="lineno">  220</span>            <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a>(</div>
-<div class="line"><span class="lineno">  221</span>                mainlistData);  <span class="comment">///&lt; Main list in which sublist is to be</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  222</span><span class="comment">                                ///&lt; searched</span></div>
-<div class="line"><span class="lineno">  223</span><span class="comment"></span> </div>
+<div class="line"><span class="lineno">  221</span>                mainlistData);  </div>
+<div class="line"><span class="lineno">  223</span> </div>
 <div class="line"><span class="lineno">  224</span>        <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a> = <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a>(</div>
-<div class="line"><span class="lineno">  225</span>            sublistLL, mainlistLL);  <span class="comment">///&lt; boolean, if sublist exist or not</span></div>
+<div class="line"><span class="lineno">  225</span>            sublistLL, mainlistLL);  </div>
 <div class="line"><span class="lineno">  226</span> </div>
 <div class="line"><span class="lineno">  227</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
 <div class="line"><span class="lineno">  228</span>        assert(exists == expectedOutput);</div>
@@ -594,16 +590,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  235</span>        deleteList(mainlistLL);</div>
 <div class="line"><span class="lineno">  236</span>        deleteList(sublistLL);</div>
 <div class="line"><span class="lineno">  237</span>    }</div>
-<div class="ttc" id="astructsearch_1_1sublist__search_1_1_node_html"><div class="ttname"><a href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a></div><div class="ttdoc">A Node structure representing a single link Node in a linked list.</div><div class="ttdef"><b>Definition</b> sublist_search.cpp:48</div></div>
-<div class="ttc" id="asublist__search_8cpp_html_a4faee403e2758aaab682ed6622ae218c"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a></div><div class="ttdeci">bool sublistSearch(Node *sublist, Node *mainList)</div><div class="ttdoc">Main searching function.</div><div class="ttdef"><b>Definition</b> sublist_search.cpp:115</div></div>
-<div class="ttc" id="asublist__search_8cpp_html_a70ca8d0267008e09cfa50b4e2ddfbe53"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a></div><div class="ttdeci">Node * makeLinkedList(const std::vector&lt; uint64_t &gt; &amp;data)</div><div class="ttdoc">Give a vector of data, it adds each element of vector in the linked list and return the address of he...</div><div class="ttdef"><b>Definition</b> sublist_search.cpp:74</div></div>
-<div class="ttc" id="aword__break_8cpp_html_a1cc9dd6e6190d10a010fdcdfe7a21a81"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">dynamic_programming::word_break::exists</a></div><div class="ttdeci">bool exists(const std::string &amp;str, const std::unordered_set&lt; std::string &gt; &amp;strSet)</div><div class="ttdoc">Function that checks if the string passed in param is present in the the unordered_set passed.</div><div class="ttdef"><b>Definition</b> word_break.cpp:60</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg" width="447" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astructsearch_1_1sublist__search_1_1_node_html"><div class="ttname"><a href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a></div><div class="ttdoc">A Node structure representing a single link Node in a linked list.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d45/sublist__search_8cpp_source.html#l00048">sublist_search.cpp:48</a></div></div>
+<div class="ttc" id="asublist__search_8cpp_html_a4faee403e2758aaab682ed6622ae218c"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a></div><div class="ttdeci">bool sublistSearch(Node *sublist, Node *mainList)</div><div class="ttdoc">Main searching function.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d45/sublist__search_8cpp_source.html#l00115">sublist_search.cpp:115</a></div></div>
+<div class="ttc" id="asublist__search_8cpp_html_a70ca8d0267008e09cfa50b4e2ddfbe53"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a></div><div class="ttdeci">Node * makeLinkedList(const std::vector&lt; uint64_t &gt; &amp;data)</div><div class="ttdoc">Give a vector of data, it adds each element of vector in the linked list and return the address of he...</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d45/sublist__search_8cpp_source.html#l00074">sublist_search.cpp:74</a></div></div>
+<div class="ttc" id="aword__break_8cpp_html_a1cc9dd6e6190d10a010fdcdfe7a21a81"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">dynamic_programming::word_break::exists</a></div><div class="ttdeci">bool exists(const std::string &amp;str, const std::unordered_set&lt; std::string &gt; &amp;strSet)</div><div class="ttdoc">Function that checks if the string passed in param is present in the the unordered_set passed.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d84/word__break_8cpp_source.html#l00060">word_break.cpp:60</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac2636e8b5b9e053374c45bfcf0603008" name="ac2636e8b5b9e053374c45bfcf0603008"></a>
@@ -631,6 +622,8 @@ Here is the call graph for this function:</div>
 
 <p>A test case with single input. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00214">214</a> of file <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html">random_pivot_quick_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  214</span>                      {</div>
 <div class="line"><span class="lineno">  215</span>        <span class="keyword">const</span> int64_t inputSize = 1;</div>
 <div class="line"><span class="lineno">  216</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
@@ -638,36 +631,27 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  218</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 1 for Random Pivot Quick Sort Algorithm : &quot;</span>);</div>
 <div class="line"><span class="lineno">  219</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
 <div class="line"><span class="lineno">  220</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;   EDGE CASE : Only contains one element&quot;</span>);</div>
-<div class="line"><span class="lineno">  221</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int64_t, inputSize&gt;</a> unsorted_arr{2};</div>
+<div class="line"><span class="lineno">  221</span>        std::array&lt;int64_t, inputSize&gt; unsorted_arr{2};</div>
 <div class="line"><span class="lineno">  222</span> </div>
 <div class="line"><span class="lineno">  223</span>        int64_t start = 0;</div>
-<div class="line"><span class="lineno">  224</span>        int64_t <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = unsorted_arr.size() - 1;  <span class="comment">// length - 1</span></div>
+<div class="line"><span class="lineno">  224</span>        int64_t end = unsorted_arr.size() - 1;  <span class="comment">// length - 1</span></div>
 <div class="line"><span class="lineno">  225</span> </div>
 <div class="line"><span class="lineno">  226</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running algorithm of data of length 50 ...&quot;</span>);</div>
-<div class="line"><span class="lineno">  227</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;int64_t, unsorted_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>()&gt; sorted_arr =</div>
+<div class="line"><span class="lineno">  227</span>        std::array&lt;int64_t, unsorted_arr.size()&gt; sorted_arr =</div>
 <div class="line"><span class="lineno">  228</span>            <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a>(unsorted_arr, start,</div>
 <div class="line"><span class="lineno">  229</span>                                                          end);</div>
 <div class="line"><span class="lineno">  230</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Algorithm finished!&quot;</span>);</div>
 <div class="line"><span class="lineno">  231</span> </div>
 <div class="line"><span class="lineno">  232</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
-<div class="line"><span class="lineno">  233</span>        assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(sorted_arr.begin(), sorted_arr.end()));</div>
+<div class="line"><span class="lineno">  233</span>        assert(std::is_sorted(sorted_arr.begin(), sorted_arr.end()));</div>
 <div class="line"><span class="lineno">  234</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
 <div class="line"><span class="lineno">  235</span> </div>
 <div class="line"><span class="lineno">  236</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 1 PASS!&quot;</span>);</div>
 <div class="line"><span class="lineno">  237</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
 <div class="line"><span class="lineno">  238</span>            <span class="stringliteral">&quot;~&quot;</span>);</div>
 <div class="line"><span class="lineno">  239</span>    }</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></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="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-<div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_a7d2e7465e7b5d54c2de6d5e9db1ea6a5"><div class="ttname"><a href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a></div><div class="ttdeci">std::array&lt; int64_t, size &gt; quickSortRP(std::array&lt; int64_t, size &gt; arr, int64_t start, int64_t end)</div><div class="ttdoc">Random pivot quick sort function. This function is the starting point of the algorithm.</div><div class="ttdef"><b>Definition</b> random_pivot_quick_sort.cpp:130</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/size.html">std::array::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg" width="447" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="arandom__pivot__quick__sort_8cpp_html_a7d2e7465e7b5d54c2de6d5e9db1ea6a5"><div class="ttname"><a href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a></div><div class="ttdeci">std::array&lt; int64_t, size &gt; quickSortRP(std::array&lt; int64_t, size &gt; arr, int64_t start, int64_t end)</div><div class="ttdoc">Random pivot quick sort function. This function is the starting point of the algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00130">random_pivot_quick_sort.cpp:130</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abae0148985f159b582a385cf399254e3" name="abae0148985f159b582a385cf399254e3"></a>
@@ -701,48 +685,45 @@ Here is the call graph for this function:</div>
 <p>&lt; Printing inorder to cross-verify.</p>
 <p>&lt; The inorder successor node for given data</p>
 <p>memory cleanup!</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00304">304</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  304</span>                      {</div>
-<div class="line"><span class="lineno">  305</span>        <span class="keyword">const</span> <span class="keywordtype">int</span> expectedOutput = 21;  <span class="comment">///&lt; Expected output of this test</span></div>
+<div class="line"><span class="lineno">  305</span>        <span class="keyword">const</span> <span class="keywordtype">int</span> expectedOutput = 21;  </div>
 <div class="line"><span class="lineno">  306</span> </div>
 <div class="line"><span class="lineno">  307</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
 <div class="line"><span class="lineno">  308</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 2 : &quot;</span>);</div>
 <div class="line"><span class="lineno">  309</span> </div>
 <div class="line"><span class="lineno">  310</span>        <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a> *root =</div>
 <div class="line"><span class="lineno">  311</span>            <span class="keyword">nullptr</span>;</div>
-<div class="line"><span class="lineno">  312</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> node_data{</div>
-<div class="line"><span class="lineno">  313</span>            20, 3, 5, 6, 2, 23, 45, 78, 21};  <span class="comment">///&lt; Data to make nodes in BST</span></div>
+<div class="line"><span class="lineno">  312</span>        std::vector&lt;int64_t&gt; node_data{</div>
+<div class="line"><span class="lineno">  313</span>            20, 3, 5, 6, 2, 23, 45, 78, 21};  </div>
 <div class="line"><span class="lineno">  314</span> </div>
 <div class="line"><span class="lineno">  315</span>        root = <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a>(</div>
 <div class="line"><span class="lineno">  316</span>            root,</div>
-<div class="line"><span class="lineno">  317</span>            node_data);  <span class="comment">///&lt; Adding nodes to BST</span></div>
+<div class="line"><span class="lineno">  317</span>            node_data);  </div>
 <div class="line"><span class="lineno">  318</span> </div>
-<div class="line"><span class="lineno">  319</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Inorder sequence is : &quot;</span>;</div>
+<div class="line"><span class="lineno">  319</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Inorder sequence is : &quot;</span>;</div>
 <div class="line"><span class="lineno">  320</span>        <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a>(</div>
-<div class="line"><span class="lineno">  321</span>            root);  <span class="comment">///&lt; Printing inorder to cross-verify.</span></div>
-<div class="line"><span class="lineno">  322</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  321</span>            root);  </div>
+<div class="line"><span class="lineno">  322</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  323</span> </div>
 <div class="line"><span class="lineno">  324</span>        <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
 <div class="line"><span class="lineno">  325</span>            *inorderSuccessor = operations_on_datastructures::</div>
 <div class="line"><span class="lineno">  326</span>                inorder_traversal_of_bst::getInorderSuccessor(</div>
-<div class="line"><span class="lineno">  327</span>                    root, 20);  <span class="comment">///&lt; The inorder successor node for given data</span></div>
+<div class="line"><span class="lineno">  327</span>                    root, 20);  </div>
 <div class="line"><span class="lineno">  328</span> </div>
 <div class="line"><span class="lineno">  329</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
 <div class="line"><span class="lineno">  330</span>        assert(inorderSuccessor-&gt;<a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a> == expectedOutput);</div>
 <div class="line"><span class="lineno">  331</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
 <div class="line"><span class="lineno">  332</span> </div>
 <div class="line"><span class="lineno">  333</span>        <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a>(</div>
-<div class="line"><span class="lineno">  334</span>            root);  <span class="comment">/// memory cleanup!</span></div>
+<div class="line"><span class="lineno">  334</span>            root);  </div>
 <div class="line"><span class="lineno">  335</span> </div>
 <div class="line"><span class="lineno">  336</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 2 PASS!&quot;</span>);</div>
 <div class="line"><span class="lineno">  337</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
 <div class="line"><span class="lineno">  338</span>    }</div>
-<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html_ae161f3e5ef33ade73429cab9291612e2"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">operations_on_datastructures::inorder_traversal_of_bst::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The key/value of the node.</div><div class="ttdef"><b>Definition</b> inorder_successor_of_bst.cpp:58</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.svg" width="447" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html_ae161f3e5ef33ade73429cab9291612e2"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">operations_on_datastructures::inorder_traversal_of_bst::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The key/value of the node.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00058">inorder_successor_of_bst.cpp:58</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abae0148985f159b582a385cf399254e3" name="abae0148985f159b582a385cf399254e3"></a>
@@ -778,8 +759,10 @@ Here is the call graph for this function:</div>
 <p>&lt; Sublist to be searched</p>
 <p>&lt; Main list in which sublist is to be searched</p>
 <p>&lt; boolean, if sublist exist or not</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html#l00244">244</a> of file <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html">sublist_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  244</span>                      {</div>
-<div class="line"><span class="lineno">  245</span>        <span class="keyword">const</span> <span class="keywordtype">bool</span> expectedOutput = <span class="keyword">true</span>;  <span class="comment">/// Expected output of this test</span></div>
+<div class="line"><span class="lineno">  245</span>        <span class="keyword">const</span> <span class="keywordtype">bool</span> expectedOutput = <span class="keyword">true</span>;  </div>
 <div class="line"><span class="lineno">  246</span> </div>
 <div class="line"><span class="lineno">  247</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
 <div class="line"><span class="lineno">  248</span>            <span class="stringliteral">&quot;~&quot;</span>);</div>
@@ -787,33 +770,30 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  250</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
 <div class="line"><span class="lineno">  251</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;   contains main list of 100 elements and sublist of 20&quot;</span>);</div>
 <div class="line"><span class="lineno">  252</span> </div>
-<div class="line"><span class="lineno">  253</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> sublistData(</div>
-<div class="line"><span class="lineno">  254</span>            20);  <span class="comment">///&lt; Data to make linked list which will be the sublist</span></div>
-<div class="line"><span class="lineno">  255</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> mainlistData(</div>
-<div class="line"><span class="lineno">  256</span>            100);  <span class="comment">///&lt; Main list in which sublist is to be searched</span></div>
+<div class="line"><span class="lineno">  253</span>        std::vector&lt;uint64_t&gt; sublistData(</div>
+<div class="line"><span class="lineno">  254</span>            20);  </div>
+<div class="line"><span class="lineno">  255</span>        std::vector&lt;uint64_t&gt; mainlistData(</div>
+<div class="line"><span class="lineno">  256</span>            100);  </div>
 <div class="line"><span class="lineno">  257</span> </div>
-<div class="line"><span class="lineno">  258</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 100; i++) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  259</span><span class="comment">            /// Inserts 100 elements in main list</span></div>
-<div class="line"><span class="lineno">  260</span><span class="comment"></span>            mainlistData[i] = i + 1;</div>
+<div class="line"><span class="lineno">  258</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 100; i++) {</div>
+<div class="line"><span class="lineno">  260</span>            mainlistData[i] = i + 1;</div>
 <div class="line"><span class="lineno">  261</span>        }</div>
 <div class="line"><span class="lineno">  262</span> </div>
 <div class="line"><span class="lineno">  263</span>        <span class="keywordtype">int</span> temp = 0;</div>
-<div class="line"><span class="lineno">  264</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 45; i &lt; 65; i++) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  265</span><span class="comment">            /// Inserts 20 elements in sublist</span></div>
-<div class="line"><span class="lineno">  266</span><span class="comment"></span>            sublistData[temp] = i + 1;</div>
+<div class="line"><span class="lineno">  264</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 45; i &lt; 65; i++) {</div>
+<div class="line"><span class="lineno">  266</span>            sublistData[temp] = i + 1;</div>
 <div class="line"><span class="lineno">  267</span>            temp++;</div>
 <div class="line"><span class="lineno">  268</span>        }</div>
 <div class="line"><span class="lineno">  269</span> </div>
 <div class="line"><span class="lineno">  270</span>        <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *sublistLL =</div>
 <div class="line"><span class="lineno">  271</span>            <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a>(</div>
-<div class="line"><span class="lineno">  272</span>                sublistData);  <span class="comment">///&lt; Sublist to be searched</span></div>
+<div class="line"><span class="lineno">  272</span>                sublistData);  </div>
 <div class="line"><span class="lineno">  273</span>        <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *mainlistLL =</div>
 <div class="line"><span class="lineno">  274</span>            <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a>(</div>
-<div class="line"><span class="lineno">  275</span>                mainlistData);  <span class="comment">///&lt; Main list in which sublist is to be</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  276</span><span class="comment">                                ///&lt; searched</span></div>
-<div class="line"><span class="lineno">  277</span><span class="comment"></span> </div>
+<div class="line"><span class="lineno">  275</span>                mainlistData);  </div>
+<div class="line"><span class="lineno">  277</span> </div>
 <div class="line"><span class="lineno">  278</span>        <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a> = <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a>(</div>
-<div class="line"><span class="lineno">  279</span>            sublistLL, mainlistLL);  <span class="comment">///&lt; boolean, if sublist exist or not</span></div>
+<div class="line"><span class="lineno">  279</span>            sublistLL, mainlistLL);  </div>
 <div class="line"><span class="lineno">  280</span> </div>
 <div class="line"><span class="lineno">  281</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
 <div class="line"><span class="lineno">  282</span>        assert(exists == expectedOutput);</div>
@@ -826,12 +806,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  289</span>        deleteList(mainlistLL);</div>
 <div class="line"><span class="lineno">  290</span>        deleteList(sublistLL);</div>
 <div class="line"><span class="lineno">  291</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.svg" width="447" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abae0148985f159b582a385cf399254e3" name="abae0148985f159b582a385cf399254e3"></a>
@@ -859,6 +834,8 @@ Here is the call graph for this function:</div>
 
 <p>A test case with input array of length 500. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00245">245</a> of file <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html">random_pivot_quick_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  245</span>                      {</div>
 <div class="line"><span class="lineno">  246</span>        <span class="keyword">const</span> int64_t inputSize = 500;</div>
 <div class="line"><span class="lineno">  247</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
@@ -866,33 +843,28 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  249</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
 <div class="line"><span class="lineno">  250</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;   BIG INPUT : Contains 500 elements and repeated elements&quot;</span>);</div>
 <div class="line"><span class="lineno">  251</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 2 for Random Pivot Quick Sort Algorithm : &quot;</span>);</div>
-<div class="line"><span class="lineno">  252</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int64_t, inputSize&gt;</a> unsorted_arr =</div>
+<div class="line"><span class="lineno">  252</span>        std::array&lt;int64_t, inputSize&gt; unsorted_arr =</div>
 <div class="line"><span class="lineno">  253</span>            sorting::random_pivot_quick_sort::generateUnsortedArray&lt;inputSize&gt;(</div>
 <div class="line"><span class="lineno">  254</span>                1, 10000);</div>
 <div class="line"><span class="lineno">  255</span> </div>
 <div class="line"><span class="lineno">  256</span>        int64_t start = 0;</div>
-<div class="line"><span class="lineno">  257</span>        int64_t <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = unsorted_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>() - 1;  <span class="comment">// length - 1</span></div>
+<div class="line"><span class="lineno">  257</span>        int64_t end = unsorted_arr.size() - 1;  <span class="comment">// length - 1</span></div>
 <div class="line"><span class="lineno">  258</span> </div>
 <div class="line"><span class="lineno">  259</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running algorithm of data of length 500 ...&quot;</span>);</div>
-<div class="line"><span class="lineno">  260</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;int64_t, unsorted_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>()&gt; sorted_arr =</div>
+<div class="line"><span class="lineno">  260</span>        std::array&lt;int64_t, unsorted_arr.size()&gt; sorted_arr =</div>
 <div class="line"><span class="lineno">  261</span>            <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a>(unsorted_arr, start,</div>
 <div class="line"><span class="lineno">  262</span>                                                          end);</div>
 <div class="line"><span class="lineno">  263</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Algorithm finished!&quot;</span>);</div>
 <div class="line"><span class="lineno">  264</span> </div>
 <div class="line"><span class="lineno">  265</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
-<div class="line"><span class="lineno">  266</span>        assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(sorted_arr.begin(), sorted_arr.end()));</div>
+<div class="line"><span class="lineno">  266</span>        assert(std::is_sorted(sorted_arr.begin(), sorted_arr.end()));</div>
 <div class="line"><span class="lineno">  267</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
 <div class="line"><span class="lineno">  268</span> </div>
 <div class="line"><span class="lineno">  269</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 2 PASS!&quot;</span>);</div>
 <div class="line"><span class="lineno">  270</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
 <div class="line"><span class="lineno">  271</span>            <span class="stringliteral">&quot;~&quot;</span>);</div>
 <div class="line"><span class="lineno">  272</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.svg" width="447" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad9f95c09931625b41e3be1f88d1e28c5" name="ad9f95c09931625b41e3be1f88d1e28c5"></a>
@@ -926,48 +898,45 @@ Here is the call graph for this function:</div>
 <p>&lt; Printing inorder to cross-verify.</p>
 <p>&lt; The inorder successor node for given data</p>
 <p>memory cleanup!</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00345">345</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  345</span>                      {</div>
-<div class="line"><span class="lineno">  346</span>        <span class="keyword">const</span> <span class="keywordtype">int</span> expectedOutput = 110;  <span class="comment">///&lt; Expected output of this test</span></div>
+<div class="line"><span class="lineno">  346</span>        <span class="keyword">const</span> <span class="keywordtype">int</span> expectedOutput = 110;  </div>
 <div class="line"><span class="lineno">  347</span> </div>
 <div class="line"><span class="lineno">  348</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
 <div class="line"><span class="lineno">  349</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 3 : &quot;</span>);</div>
 <div class="line"><span class="lineno">  350</span> </div>
 <div class="line"><span class="lineno">  351</span>        <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a> *root =</div>
 <div class="line"><span class="lineno">  352</span>            <span class="keyword">nullptr</span>;</div>
-<div class="line"><span class="lineno">  353</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> node_data{</div>
+<div class="line"><span class="lineno">  353</span>        std::vector&lt;int64_t&gt; node_data{</div>
 <div class="line"><span class="lineno">  354</span>            89,  67,  32, 56, 90, 123, 120,</div>
-<div class="line"><span class="lineno">  355</span>            110, 115, 6,  78, 7,  10};  <span class="comment">///&lt; Data to make nodes in BST</span></div>
+<div class="line"><span class="lineno">  355</span>            110, 115, 6,  78, 7,  10};  </div>
 <div class="line"><span class="lineno">  356</span> </div>
 <div class="line"><span class="lineno">  357</span>        root = <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a>(</div>
 <div class="line"><span class="lineno">  358</span>            root,</div>
-<div class="line"><span class="lineno">  359</span>            node_data);  <span class="comment">///&lt; Adding nodes to BST</span></div>
+<div class="line"><span class="lineno">  359</span>            node_data);  </div>
 <div class="line"><span class="lineno">  360</span> </div>
-<div class="line"><span class="lineno">  361</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Inorder sequence is : &quot;</span>;</div>
+<div class="line"><span class="lineno">  361</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Inorder sequence is : &quot;</span>;</div>
 <div class="line"><span class="lineno">  362</span>        <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a>(</div>
-<div class="line"><span class="lineno">  363</span>            root);  <span class="comment">///&lt; Printing inorder to cross-verify.</span></div>
-<div class="line"><span class="lineno">  364</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  363</span>            root);  </div>
+<div class="line"><span class="lineno">  364</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  365</span> </div>
 <div class="line"><span class="lineno">  366</span>        <a class="code hl_class" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
 <div class="line"><span class="lineno">  367</span>            *inorderSuccessor = operations_on_datastructures::</div>
 <div class="line"><span class="lineno">  368</span>                inorder_traversal_of_bst::getInorderSuccessor(</div>
-<div class="line"><span class="lineno">  369</span>                    root, 90);  <span class="comment">///&lt; The inorder successor node for given data</span></div>
+<div class="line"><span class="lineno">  369</span>                    root, 90);  </div>
 <div class="line"><span class="lineno">  370</span> </div>
 <div class="line"><span class="lineno">  371</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
 <div class="line"><span class="lineno">  372</span>        assert(inorderSuccessor-&gt;<a class="code hl_variable" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a> == expectedOutput);</div>
 <div class="line"><span class="lineno">  373</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
 <div class="line"><span class="lineno">  374</span> </div>
 <div class="line"><span class="lineno">  375</span>        <a class="code hl_function" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a>(</div>
-<div class="line"><span class="lineno">  376</span>            root);  <span class="comment">/// memory cleanup!</span></div>
+<div class="line"><span class="lineno">  376</span>            root);  </div>
 <div class="line"><span class="lineno">  377</span> </div>
 <div class="line"><span class="lineno">  378</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 3 PASS!&quot;</span>);</div>
 <div class="line"><span class="lineno">  379</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
 <div class="line"><span class="lineno">  380</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.svg" width="447" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad9f95c09931625b41e3be1f88d1e28c5" name="ad9f95c09931625b41e3be1f88d1e28c5"></a>
@@ -1003,8 +972,10 @@ Here is the call graph for this function:</div>
 <p>&lt; Sublist to be searched</p>
 <p>&lt; Main list in which sublist is to be searched</p>
 <p>&lt; boolean, if sublist exist or not</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html#l00298">298</a> of file <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html">sublist_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  298</span>                      {</div>
-<div class="line"><span class="lineno">  299</span>        <span class="keyword">const</span> <span class="keywordtype">bool</span> expectedOutput = <span class="keyword">false</span>;  <span class="comment">///&lt; Expected output of this test</span></div>
+<div class="line"><span class="lineno">  299</span>        <span class="keyword">const</span> <span class="keywordtype">bool</span> expectedOutput = <span class="keyword">false</span>;  </div>
 <div class="line"><span class="lineno">  300</span> </div>
 <div class="line"><span class="lineno">  301</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
 <div class="line"><span class="lineno">  302</span>            <span class="stringliteral">&quot;~&quot;</span>);</div>
@@ -1012,30 +983,27 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  304</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
 <div class="line"><span class="lineno">  305</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;   contains main list of 50 elements and sublist of 20&quot;</span>);</div>
 <div class="line"><span class="lineno">  306</span> </div>
-<div class="line"><span class="lineno">  307</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> sublistData(20);  <span class="comment">///&lt; Sublist to be searched</span></div>
-<div class="line"><span class="lineno">  308</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> mainlistData(</div>
-<div class="line"><span class="lineno">  309</span>            50);  <span class="comment">///&lt; Main list in which sublist is to be searched</span></div>
+<div class="line"><span class="lineno">  307</span>        std::vector&lt;uint64_t&gt; sublistData(20);  </div>
+<div class="line"><span class="lineno">  308</span>        std::vector&lt;uint64_t&gt; mainlistData(</div>
+<div class="line"><span class="lineno">  309</span>            50);  </div>
 <div class="line"><span class="lineno">  310</span> </div>
-<div class="line"><span class="lineno">  311</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 50; i++) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  312</span><span class="comment">            /// Inserts 100 elements in main list</span></div>
-<div class="line"><span class="lineno">  313</span><span class="comment"></span>            mainlistData.push_back(i + 1);</div>
+<div class="line"><span class="lineno">  311</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 50; i++) {</div>
+<div class="line"><span class="lineno">  313</span>            mainlistData.push_back(i + 1);</div>
 <div class="line"><span class="lineno">  314</span>        }</div>
 <div class="line"><span class="lineno">  315</span> </div>
-<div class="line"><span class="lineno">  316</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 45; i &lt; 65; i++) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  317</span><span class="comment">            /// Inserts 20 elements in sublist</span></div>
-<div class="line"><span class="lineno">  318</span><span class="comment"></span>            sublistData.push_back(i + 1);</div>
+<div class="line"><span class="lineno">  316</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 45; i &lt; 65; i++) {</div>
+<div class="line"><span class="lineno">  318</span>            sublistData.push_back(i + 1);</div>
 <div class="line"><span class="lineno">  319</span>        }</div>
 <div class="line"><span class="lineno">  320</span> </div>
 <div class="line"><span class="lineno">  321</span>        <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *sublistLL =</div>
 <div class="line"><span class="lineno">  322</span>            <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a>(</div>
-<div class="line"><span class="lineno">  323</span>                sublistData);  <span class="comment">///&lt; Sublist to be searched</span></div>
+<div class="line"><span class="lineno">  323</span>                sublistData);  </div>
 <div class="line"><span class="lineno">  324</span>        <a class="code hl_struct" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *mainlistLL =</div>
 <div class="line"><span class="lineno">  325</span>            <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53">search::sublist_search::makeLinkedList</a>(</div>
-<div class="line"><span class="lineno">  326</span>                mainlistData);  <span class="comment">///&lt; Main list in which sublist is to be</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  327</span><span class="comment">                                ///&lt; searched</span></div>
-<div class="line"><span class="lineno">  328</span><span class="comment"></span> </div>
+<div class="line"><span class="lineno">  326</span>                mainlistData);  </div>
+<div class="line"><span class="lineno">  328</span> </div>
 <div class="line"><span class="lineno">  329</span>        <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a> = <a class="code hl_function" href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a>(</div>
-<div class="line"><span class="lineno">  330</span>            sublistLL, mainlistLL);  <span class="comment">///&lt; boolean, if sublist exist or not</span></div>
+<div class="line"><span class="lineno">  330</span>            sublistLL, mainlistLL);  </div>
 <div class="line"><span class="lineno">  331</span> </div>
 <div class="line"><span class="lineno">  332</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
 <div class="line"><span class="lineno">  333</span>        assert(exists == expectedOutput);</div>
@@ -1048,12 +1016,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  340</span>        deleteList(mainlistLL);</div>
 <div class="line"><span class="lineno">  341</span>        deleteList(sublistLL);</div>
 <div class="line"><span class="lineno">  342</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.svg" width="447" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad9f95c09931625b41e3be1f88d1e28c5" name="ad9f95c09931625b41e3be1f88d1e28c5"></a>
@@ -1081,6 +1044,8 @@ Here is the call graph for this function:</div>
 
 <p>A test case with array of length 1000. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html#l00278">278</a> of file <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html">random_pivot_quick_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  278</span>                      {</div>
 <div class="line"><span class="lineno">  279</span>        <span class="keyword">const</span> int64_t inputSize = 1000;</div>
 <div class="line"><span class="lineno">  280</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
@@ -1088,39 +1053,34 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  282</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 3 for Random Pivot Quick Sort Algorithm : &quot;</span>);</div>
 <div class="line"><span class="lineno">  283</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
 <div class="line"><span class="lineno">  284</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;   LARGE INPUT : Contains 1000 elements and repeated elements&quot;</span>);</div>
-<div class="line"><span class="lineno">  285</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int64_t, inputSize&gt;</a> unsorted_arr =</div>
+<div class="line"><span class="lineno">  285</span>        std::array&lt;int64_t, inputSize&gt; unsorted_arr =</div>
 <div class="line"><span class="lineno">  286</span>            sorting::random_pivot_quick_sort::generateUnsortedArray&lt;inputSize&gt;(</div>
 <div class="line"><span class="lineno">  287</span>                1, 10000);</div>
 <div class="line"><span class="lineno">  288</span> </div>
 <div class="line"><span class="lineno">  289</span>        int64_t start = 0;</div>
-<div class="line"><span class="lineno">  290</span>        int64_t <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> = unsorted_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>() - 1;  <span class="comment">// length - 1</span></div>
+<div class="line"><span class="lineno">  290</span>        int64_t end = unsorted_arr.size() - 1;  <span class="comment">// length - 1</span></div>
 <div class="line"><span class="lineno">  291</span> </div>
 <div class="line"><span class="lineno">  292</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running algorithm...&quot;</span>);</div>
-<div class="line"><span class="lineno">  293</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;int64_t, unsorted_arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>()&gt; sorted_arr =</div>
+<div class="line"><span class="lineno">  293</span>        std::array&lt;int64_t, unsorted_arr.size()&gt; sorted_arr =</div>
 <div class="line"><span class="lineno">  294</span>            <a class="code hl_function" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5">sorting::random_pivot_quick_sort::quickSortRP</a>(unsorted_arr, start,</div>
 <div class="line"><span class="lineno">  295</span>                                                          end);</div>
 <div class="line"><span class="lineno">  296</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Algorithm finished!&quot;</span>);</div>
 <div class="line"><span class="lineno">  297</span> </div>
 <div class="line"><span class="lineno">  298</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
-<div class="line"><span class="lineno">  299</span>        assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(sorted_arr.begin(), sorted_arr.end()));</div>
+<div class="line"><span class="lineno">  299</span>        assert(std::is_sorted(sorted_arr.begin(), sorted_arr.end()));</div>
 <div class="line"><span class="lineno">  300</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
 <div class="line"><span class="lineno">  301</span> </div>
 <div class="line"><span class="lineno">  302</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 3 PASS!&quot;</span>);</div>
 <div class="line"><span class="lineno">  303</span>        <a class="code hl_function" href="#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span></div>
 <div class="line"><span class="lineno">  304</span>            <span class="stringliteral">&quot;~&quot;</span>);</div>
 <div class="line"><span class="lineno">  305</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.svg" width="447" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following files:<ul>
-<li>operations_on_datastructures/<a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp.html">inorder_successor_of_bst.cpp</a></li>
-<li>search/<a class="el" href="../../d5/d45/sublist__search_8cpp.html">sublist_search.cpp</a></li>
-<li>sorting/<a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp.html">random_pivot_quick_sort.cpp</a></li>
+<li>operations_on_datastructures/<a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a></li>
+<li>search/<a class="el" href="../../d5/d45/sublist__search_8cpp_source.html">sublist_search.cpp</a></li>
+<li>sorting/<a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp_source.html">random_pivot_quick_sort.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.map b/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.map
deleted file mode 100644
index 2c6389763..000000000
--- a/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="TestCases::log" name="TestCases::log">
-<area shape="rect" id="Node000001" title="A function to print64_t given message on console." alt="" coords="5,5,115,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="163,5,234,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="115,16,147,16,147,21,115,21"/>
-</map>
diff --git a/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.md5 b/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.md5
deleted file mode 100644
index 3d220ae26..000000000
--- a/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-472a31f53b1694bc6b3ddf9829dec746
\ No newline at end of file
diff --git a/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.svg b/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.svg
deleted file mode 100644
index 1ac36cd87..000000000
--- a/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: TestCases::log Pages: 1 -->
-<svg width="180pt" height="27pt"
- viewBox="0.00 0.00 179.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>TestCases::log</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function to print64_t given message on console.">
-<polygon fill="#999999" stroke="#666666" points="82,-19.25 0,-19.25 0,0 82,0 82,-19.25"/>
-<text text-anchor="middle" x="41" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="171.5,-19.25 118,-19.25 118,0 171.5,0 171.5,-19.25"/>
-<text text-anchor="middle" x="144.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.21,-9.62C90.11,-9.62 98.36,-9.62 106.16,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.05,-13.13 116.05,-9.63 106.05,-6.13 106.05,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph_org.svg b/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph_org.svg
deleted file mode 100644
index f091b6228..000000000
--- a/d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: TestCases::log Pages: 1 -->
-<svg width="180pt" height="27pt"
- viewBox="0.00 0.00 179.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>TestCases::log</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function to print64_t given message on console.">
-<polygon fill="#999999" stroke="#666666" points="82,-19.25 0,-19.25 0,0 82,0 82,-19.25"/>
-<text text-anchor="middle" x="41" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="171.5,-19.25 118,-19.25 118,0 171.5,0 171.5,-19.25"/>
-<text text-anchor="middle" x="144.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.21,-9.62C90.11,-9.62 98.36,-9.62 106.16,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.05,-13.13 116.05,-9.63 106.05,-6.13 106.05,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.map b/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.map
deleted file mode 100644
index 09e0c1101..000000000
--- a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="TestCases::testCase_2" name="TestCases::testCase_2">
-<area shape="rect" id="Node000001" title="A test case with input array of length 500." alt="" coords="5,55,165,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="217,5,318,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="135,51,201,33,203,38,136,57"/>
-<area shape="rect" id="Node000003" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="213,55,322,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="165,65,197,65,197,70,165,70"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="213,104,322,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="136,78,203,97,201,102,135,84"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="370,55,441,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="322,65,354,65,354,70,322,70"/>
-</map>
diff --git a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.md5 b/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.md5
deleted file mode 100644
index 6d64c2dbf..000000000
--- a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-78857dbee5e44ad287f008aac7722d72
\ No newline at end of file
diff --git a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.svg b/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.svg
deleted file mode 100644
index 77bc5ca68..000000000
--- a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: TestCases::testCase_2 Pages: 1 -->
-<svg width="335pt" height="101pt"
- viewBox="0.00 0.00 335.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>TestCases::testCase_2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A test case with input array of length 500.">
-<polygon fill="#999999" stroke="#666666" points="119.5,-56.25 0,-56.25 0,-37 119.5,-37 119.5,-56.25"/>
-<text text-anchor="middle" x="59.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.12,-93.25 158.88,-93.25 158.88,-74 234.12,-74 234.12,-93.25"/>
-<text text-anchor="middle" x="196.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.57,-56.74C113.02,-60.98 131.19,-65.97 147.65,-70.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.69,-73.85 157.26,-73.13 148.55,-67.1 146.69,-73.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="237.5,-56.25 155.5,-56.25 155.5,-37 237.5,-37 237.5,-56.25"/>
-<text text-anchor="middle" x="196.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.85,-46.62C127.74,-46.62 135.79,-46.62 143.54,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.52,-50.13 153.52,-46.63 143.52,-43.13 143.52,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.12,-19.25 155.88,-19.25 155.88,0 237.12,0 237.12,-19.25"/>
-<text text-anchor="middle" x="196.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.57,-36.51C113.02,-32.27 131.19,-27.28 147.65,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.55,-26.15 157.26,-20.12 146.69,-19.4 148.55,-26.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="327,-56.25 273.5,-56.25 273.5,-37 327,-37 327,-56.25"/>
-<text text-anchor="middle" x="300.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.71,-46.62C245.61,-46.62 253.86,-46.62 261.66,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.55,-50.13 271.55,-46.63 261.55,-43.13 261.55,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph_org.svg b/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph_org.svg
deleted file mode 100644
index 035ceb8e1..000000000
--- a/d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: TestCases::testCase_2 Pages: 1 -->
-<svg width="335pt" height="101pt"
- viewBox="0.00 0.00 335.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>TestCases::testCase_2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A test case with input array of length 500.">
-<polygon fill="#999999" stroke="#666666" points="119.5,-56.25 0,-56.25 0,-37 119.5,-37 119.5,-56.25"/>
-<text text-anchor="middle" x="59.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.12,-93.25 158.88,-93.25 158.88,-74 234.12,-74 234.12,-93.25"/>
-<text text-anchor="middle" x="196.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.57,-56.74C113.02,-60.98 131.19,-65.97 147.65,-70.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.69,-73.85 157.26,-73.13 148.55,-67.1 146.69,-73.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="237.5,-56.25 155.5,-56.25 155.5,-37 237.5,-37 237.5,-56.25"/>
-<text text-anchor="middle" x="196.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.85,-46.62C127.74,-46.62 135.79,-46.62 143.54,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.52,-50.13 153.52,-46.63 143.52,-43.13 143.52,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.12,-19.25 155.88,-19.25 155.88,0 237.12,0 237.12,-19.25"/>
-<text text-anchor="middle" x="196.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.57,-36.51C113.02,-32.27 131.19,-27.28 147.65,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.55,-26.15 157.26,-20.12 146.69,-19.4 148.55,-26.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="327,-56.25 273.5,-56.25 273.5,-37 327,-37 327,-56.25"/>
-<text text-anchor="middle" x="300.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.71,-46.62C245.61,-46.62 253.86,-46.62 261.66,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.55,-50.13 271.55,-46.63 261.55,-43.13 261.55,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.map b/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.map
deleted file mode 100644
index e918fcabf..000000000
--- a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="TestCases::testCase_1" name="TestCases::testCase_1">
-<area shape="rect" id="Node000001" title="A test case with single input." alt="" coords="5,55,165,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="217,5,318,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="135,51,201,33,203,38,136,57"/>
-<area shape="rect" id="Node000003" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="213,55,322,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="165,65,197,65,197,70,165,70"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="213,104,322,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="136,78,203,97,201,102,135,84"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="370,55,441,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="322,65,354,65,354,70,322,70"/>
-</map>
diff --git a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.md5 b/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.md5
deleted file mode 100644
index 406262b9d..000000000
--- a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-df2bf1478ef4c7655f58472e969ce0ba
\ No newline at end of file
diff --git a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg b/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg
deleted file mode 100644
index cd6ec9eb9..000000000
--- a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: TestCases::testCase_1 Pages: 1 -->
-<svg width="335pt" height="101pt"
- viewBox="0.00 0.00 335.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>TestCases::testCase_1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A test case with single input.">
-<polygon fill="#999999" stroke="#666666" points="119.5,-56.25 0,-56.25 0,-37 119.5,-37 119.5,-56.25"/>
-<text text-anchor="middle" x="59.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.12,-93.25 158.88,-93.25 158.88,-74 234.12,-74 234.12,-93.25"/>
-<text text-anchor="middle" x="196.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.57,-56.74C113.02,-60.98 131.19,-65.97 147.65,-70.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.69,-73.85 157.26,-73.13 148.55,-67.1 146.69,-73.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="237.5,-56.25 155.5,-56.25 155.5,-37 237.5,-37 237.5,-56.25"/>
-<text text-anchor="middle" x="196.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.85,-46.62C127.74,-46.62 135.79,-46.62 143.54,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.52,-50.13 153.52,-46.63 143.52,-43.13 143.52,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.12,-19.25 155.88,-19.25 155.88,0 237.12,0 237.12,-19.25"/>
-<text text-anchor="middle" x="196.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.57,-36.51C113.02,-32.27 131.19,-27.28 147.65,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.55,-26.15 157.26,-20.12 146.69,-19.4 148.55,-26.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="327,-56.25 273.5,-56.25 273.5,-37 327,-37 327,-56.25"/>
-<text text-anchor="middle" x="300.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.71,-46.62C245.61,-46.62 253.86,-46.62 261.66,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.55,-50.13 271.55,-46.63 261.55,-43.13 261.55,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph_org.svg b/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph_org.svg
deleted file mode 100644
index 6bb34ec04..000000000
--- a/d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: TestCases::testCase_1 Pages: 1 -->
-<svg width="335pt" height="101pt"
- viewBox="0.00 0.00 335.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>TestCases::testCase_1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A test case with single input.">
-<polygon fill="#999999" stroke="#666666" points="119.5,-56.25 0,-56.25 0,-37 119.5,-37 119.5,-56.25"/>
-<text text-anchor="middle" x="59.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.12,-93.25 158.88,-93.25 158.88,-74 234.12,-74 234.12,-93.25"/>
-<text text-anchor="middle" x="196.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.57,-56.74C113.02,-60.98 131.19,-65.97 147.65,-70.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.69,-73.85 157.26,-73.13 148.55,-67.1 146.69,-73.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="237.5,-56.25 155.5,-56.25 155.5,-37 237.5,-37 237.5,-56.25"/>
-<text text-anchor="middle" x="196.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.85,-46.62C127.74,-46.62 135.79,-46.62 143.54,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.52,-50.13 153.52,-46.63 143.52,-43.13 143.52,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.12,-19.25 155.88,-19.25 155.88,0 237.12,0 237.12,-19.25"/>
-<text text-anchor="middle" x="196.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.57,-36.51C113.02,-32.27 131.19,-27.28 147.65,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.55,-26.15 157.26,-20.12 146.69,-19.4 148.55,-26.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="327,-56.25 273.5,-56.25 273.5,-37 327,-37 327,-56.25"/>
-<text text-anchor="middle" x="300.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.71,-46.62C245.61,-46.62 253.86,-46.62 261.66,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.55,-50.13 271.55,-46.63 261.55,-43.13 261.55,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.map b/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.map
deleted file mode 100644
index eae43f1ec..000000000
--- a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="TestCases::testCase_3" name="TestCases::testCase_3">
-<area shape="rect" id="Node000001" title="A test case with array of length 1000." alt="" coords="5,55,165,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="217,5,318,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="135,51,201,33,203,38,136,57"/>
-<area shape="rect" id="Node000003" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="213,55,322,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="165,65,197,65,197,70,165,70"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="213,104,322,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="136,78,203,97,201,102,135,84"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="370,55,441,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="322,65,354,65,354,70,322,70"/>
-</map>
diff --git a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.md5 b/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.md5
deleted file mode 100644
index 4c830166c..000000000
--- a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8dcf04cd959dcded7893d85b03396686
\ No newline at end of file
diff --git a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.svg b/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.svg
deleted file mode 100644
index 067c9a793..000000000
--- a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: TestCases::testCase_3 Pages: 1 -->
-<svg width="335pt" height="101pt"
- viewBox="0.00 0.00 335.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>TestCases::testCase_3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A test case with array of length 1000.">
-<polygon fill="#999999" stroke="#666666" points="119.5,-56.25 0,-56.25 0,-37 119.5,-37 119.5,-56.25"/>
-<text text-anchor="middle" x="59.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.12,-93.25 158.88,-93.25 158.88,-74 234.12,-74 234.12,-93.25"/>
-<text text-anchor="middle" x="196.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.57,-56.74C113.02,-60.98 131.19,-65.97 147.65,-70.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.69,-73.85 157.26,-73.13 148.55,-67.1 146.69,-73.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="237.5,-56.25 155.5,-56.25 155.5,-37 237.5,-37 237.5,-56.25"/>
-<text text-anchor="middle" x="196.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.85,-46.62C127.74,-46.62 135.79,-46.62 143.54,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.52,-50.13 153.52,-46.63 143.52,-43.13 143.52,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.12,-19.25 155.88,-19.25 155.88,0 237.12,0 237.12,-19.25"/>
-<text text-anchor="middle" x="196.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.57,-36.51C113.02,-32.27 131.19,-27.28 147.65,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.55,-26.15 157.26,-20.12 146.69,-19.4 148.55,-26.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="327,-56.25 273.5,-56.25 273.5,-37 327,-37 327,-56.25"/>
-<text text-anchor="middle" x="300.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.71,-46.62C245.61,-46.62 253.86,-46.62 261.66,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.55,-50.13 271.55,-46.63 261.55,-43.13 261.55,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph_org.svg b/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph_org.svg
deleted file mode 100644
index 70606c92a..000000000
--- a/d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: TestCases::testCase_3 Pages: 1 -->
-<svg width="335pt" height="101pt"
- viewBox="0.00 0.00 335.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>TestCases::testCase_3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A test case with array of length 1000.">
-<polygon fill="#999999" stroke="#666666" points="119.5,-56.25 0,-56.25 0,-37 119.5,-37 119.5,-56.25"/>
-<text text-anchor="middle" x="59.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.12,-93.25 158.88,-93.25 158.88,-74 234.12,-74 234.12,-93.25"/>
-<text text-anchor="middle" x="196.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.57,-56.74C113.02,-60.98 131.19,-65.97 147.65,-70.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.69,-73.85 157.26,-73.13 148.55,-67.1 146.69,-73.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="237.5,-56.25 155.5,-56.25 155.5,-37 237.5,-37 237.5,-56.25"/>
-<text text-anchor="middle" x="196.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.85,-46.62C127.74,-46.62 135.79,-46.62 143.54,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.52,-50.13 153.52,-46.63 143.52,-43.13 143.52,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.12,-19.25 155.88,-19.25 155.88,0 237.12,0 237.12,-19.25"/>
-<text text-anchor="middle" x="196.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.57,-36.51C113.02,-32.27 131.19,-27.28 147.65,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.55,-26.15 157.26,-20.12 146.69,-19.4 148.55,-26.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="327,-56.25 273.5,-56.25 273.5,-37 327,-37 327,-56.25"/>
-<text text-anchor="middle" x="300.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.71,-46.62C245.61,-46.62 253.86,-46.62 261.66,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.55,-50.13 271.55,-46.63 261.55,-43.13 261.55,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.map b/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.map
deleted file mode 100644
index f0fb84fc9..000000000
--- a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.map
+++ /dev/null
@@ -1,20 +0,0 @@
-<map id="TestCases::runTests" name="TestCases::runTests">
-<area shape="rect" id="Node000001" title="Executes test cases." alt="" coords="5,92,148,117"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="560,92,632,117"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="91,89,135,55,164,38,195,26,283,6,320,3,356,4,427,20,513,50,542,64,567,80,565,85,539,68,511,55,425,25,355,10,321,8,284,11,196,31,166,43,138,60,94,93"/>
-<area shape="rect" id="Node000003" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="403,92,512,117"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="148,102,388,102,388,107,148,107"/>
-<area shape="rect" id="Node000004" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, printing inorder successor of last node." alt="" coords="196,41,355,67"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="129,88,207,69,208,74,131,94"/>
-<area shape="rect" id="Node000005" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="196,142,355,168"/>
-<area shape="poly" id="edge7_Node000001_Node000005" title=" " alt="" coords="131,115,208,135,207,141,129,121"/>
-<area shape="rect" id="Node000006" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="196,192,355,217"/>
-<area shape="poly" id="edge10_Node000001_Node000006" title=" " alt="" coords="97,116,141,147,197,178,210,183,207,188,194,183,138,151,94,120"/>
-<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="513,102,545,102,545,107,513,107"/>
-<area shape="poly" id="edge5_Node000004_Node000002" title=" " alt="" coords="356,56,432,64,513,77,546,85,545,90,512,82,431,69,355,61"/>
-<area shape="poly" id="edge6_Node000004_Node000003" title=" " alt="" coords="325,65,395,84,394,90,324,70"/>
-<area shape="poly" id="edge8_Node000005_Node000002" title=" " alt="" coords="355,148,431,140,512,127,545,119,546,124,513,132,432,145,356,153"/>
-<area shape="poly" id="edge9_Node000005_Node000003" title=" " alt="" coords="324,139,394,119,395,125,325,144"/>
-<area shape="poly" id="edge11_Node000006_Node000002" title=" " alt="" coords="355,190,432,174,511,149,561,123,563,128,513,154,433,179,356,195"/>
-<area shape="poly" id="edge12_Node000006_Node000003" title=" " alt="" coords="328,189,354,178,395,153,429,126,432,130,398,157,356,183,331,194"/>
-</map>
diff --git a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.md5 b/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.md5
deleted file mode 100644
index d32333847..000000000
--- a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-94cb50042479a210b2916ad6e70e644f
\ No newline at end of file
diff --git a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg b/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg
deleted file mode 100644
index 3edd4d489..000000000
--- a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg
+++ /dev/null
@@ -1,200 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: TestCases::runTests Pages: 1 -->
-<svg width="478pt" height="167pt"
- viewBox="0.00 0.00 477.75 167.01" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 163.01)">
-<title>TestCases::runTests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Executes test cases.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-94.25 0,-94.25 0,-75 106.75,-75 106.75,-94.25"/>
-<text text-anchor="middle" x="53.38" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="469.75,-94.25 416.25,-94.25 416.25,-75 469.75,-75 469.75,-94.25"/>
-<text text-anchor="middle" x="443" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M65.31,-94.72C81.03,-108.47 111.58,-132.44 142.75,-141.62 244.3,-171.53 281.08,-160.65 380.25,-123.62 394.58,-118.27 409.12,-109.3 420.49,-101.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="422.35,-104.29 428.36,-95.56 418.22,-98.64 422.35,-104.29"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="380.25,-94.25 298.25,-94.25 298.25,-75 380.25,-75 380.25,-94.25"/>
-<text text-anchor="middle" x="339.25" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.1,-84.62C158.42,-84.62 235.91,-84.62 286.79,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.66,-88.13 296.66,-84.63 286.66,-81.13 286.66,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
-<polygon fill="white" stroke="#666666" points="262.25,-132.25 142.75,-132.25 142.75,-113 262.25,-113 262.25,-132.25"/>
-<text text-anchor="middle" x="202.5" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.42,-94.71C111.19,-99.3 132.45,-104.79 151.39,-109.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.51,-113.07 161.07,-112.18 152.26,-106.29 150.51,-113.07"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="262.25,-56.25 142.75,-56.25 142.75,-37 262.25,-37 262.25,-56.25"/>
-<text text-anchor="middle" x="202.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge7_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge7_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.42,-74.54C111.19,-69.95 132.45,-64.46 151.39,-59.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.26,-62.96 161.07,-57.07 150.51,-56.18 152.26,-62.96"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="262.25,-19.25 142.75,-19.25 142.75,0 262.25,0 262.25,-19.25"/>
-<text text-anchor="middle" x="202.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge10_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge10_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M67.48,-74.52C84.17,-62.04 114.27,-40.86 142.75,-27.62 145.84,-26.19 149.08,-24.83 152.38,-23.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.34,-26.92 161.58,-20.26 150.98,-20.33 153.34,-26.92"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.46,-84.62C388.36,-84.62 396.61,-84.62 404.41,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.3,-88.13 414.3,-84.63 404.3,-81.13 404.3,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge5_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge5_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.45,-119.12C297.02,-116.37 341.4,-111.61 380.25,-103.62 388.31,-101.97 396.83,-99.7 404.88,-97.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="405.89,-100.65 414.4,-94.34 403.81,-93.97 405.89,-100.65"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge6_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge6_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M239.26,-112.54C255.37,-108 274.61,-102.57 291.83,-97.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="292.66,-101.12 301.34,-95.03 290.76,-94.38 292.66,-101.12"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge8_Node000005_Node000002" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge8_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.45,-50.13C297.02,-52.88 341.4,-57.64 380.25,-65.62 388.31,-67.28 396.83,-69.55 404.88,-71.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="403.81,-75.28 414.4,-74.91 405.89,-68.6 403.81,-75.28"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge9_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge9_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M239.26,-56.71C255.37,-61.25 274.61,-66.68 291.83,-71.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="290.76,-74.87 301.34,-74.22 292.66,-68.13 290.76,-74.87"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node2 -->
-<g id="edge11_Node000006_Node000002" class="edge">
-<title>Node6&#45;&gt;Node2</title>
-<g id="a_edge11_Node000006_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.49,-18.51C297.47,-24.86 342.25,-34.93 380.25,-49.62 393.14,-54.61 406.59,-61.95 417.63,-68.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="415.76,-71.58 426.1,-73.9 419.47,-65.64 415.76,-71.58"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge12_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge12_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.11,-19.7C249.66,-21.94 256.26,-24.58 262.25,-27.62 283.23,-38.29 304.44,-54.79 319.11,-67.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.76,-69.88 326.59,-73.83 321.36,-64.62 316.76,-69.88"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph_org.svg b/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph_org.svg
deleted file mode 100644
index 2d6b4713d..000000000
--- a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph_org.svg
+++ /dev/null
@@ -1,174 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: TestCases::runTests Pages: 1 -->
-<svg width="478pt" height="167pt"
- viewBox="0.00 0.00 477.75 167.01" 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 163.01)">
-<title>TestCases::runTests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Executes test cases.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-94.25 0,-94.25 0,-75 106.75,-75 106.75,-94.25"/>
-<text text-anchor="middle" x="53.38" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="469.75,-94.25 416.25,-94.25 416.25,-75 469.75,-75 469.75,-94.25"/>
-<text text-anchor="middle" x="443" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M65.31,-94.72C81.03,-108.47 111.58,-132.44 142.75,-141.62 244.3,-171.53 281.08,-160.65 380.25,-123.62 394.58,-118.27 409.12,-109.3 420.49,-101.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="422.35,-104.29 428.36,-95.56 418.22,-98.64 422.35,-104.29"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
-<polygon fill="white" stroke="#666666" points="380.25,-94.25 298.25,-94.25 298.25,-75 380.25,-75 380.25,-94.25"/>
-<text text-anchor="middle" x="339.25" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.1,-84.62C158.42,-84.62 235.91,-84.62 286.79,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.66,-88.13 296.66,-84.63 286.66,-81.13 286.66,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
-<polygon fill="white" stroke="#666666" points="262.25,-132.25 142.75,-132.25 142.75,-113 262.25,-113 262.25,-132.25"/>
-<text text-anchor="middle" x="202.5" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.42,-94.71C111.19,-99.3 132.45,-104.79 151.39,-109.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.51,-113.07 161.07,-112.18 152.26,-106.29 150.51,-113.07"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="262.25,-56.25 142.75,-56.25 142.75,-37 262.25,-37 262.25,-56.25"/>
-<text text-anchor="middle" x="202.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge7_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge7_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.42,-74.54C111.19,-69.95 132.45,-64.46 151.39,-59.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.26,-62.96 161.07,-57.07 150.51,-56.18 152.26,-62.96"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
-<polygon fill="white" stroke="#666666" points="262.25,-19.25 142.75,-19.25 142.75,0 262.25,0 262.25,-19.25"/>
-<text text-anchor="middle" x="202.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge10_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge10_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M67.48,-74.52C84.17,-62.04 114.27,-40.86 142.75,-27.62 145.84,-26.19 149.08,-24.83 152.38,-23.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.34,-26.92 161.58,-20.26 150.98,-20.33 153.34,-26.92"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.46,-84.62C388.36,-84.62 396.61,-84.62 404.41,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.3,-88.13 414.3,-84.63 404.3,-81.13 404.3,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge5_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge5_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.45,-119.12C297.02,-116.37 341.4,-111.61 380.25,-103.62 388.31,-101.97 396.83,-99.7 404.88,-97.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="405.89,-100.65 414.4,-94.34 403.81,-93.97 405.89,-100.65"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge6_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge6_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M239.26,-112.54C255.37,-108 274.61,-102.57 291.83,-97.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="292.66,-101.12 301.34,-95.03 290.76,-94.38 292.66,-101.12"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge8_Node000005_Node000002" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge8_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.45,-50.13C297.02,-52.88 341.4,-57.64 380.25,-65.62 388.31,-67.28 396.83,-69.55 404.88,-71.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="403.81,-75.28 414.4,-74.91 405.89,-68.6 403.81,-75.28"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge9_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge9_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M239.26,-56.71C255.37,-61.25 274.61,-66.68 291.83,-71.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="290.76,-74.87 301.34,-74.22 292.66,-68.13 290.76,-74.87"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node2 -->
-<g id="edge11_Node000006_Node000002" class="edge">
-<title>Node6&#45;&gt;Node2</title>
-<g id="a_edge11_Node000006_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.49,-18.51C297.47,-24.86 342.25,-34.93 380.25,-49.62 393.14,-54.61 406.59,-61.95 417.63,-68.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="415.76,-71.58 426.1,-73.9 419.47,-65.64 415.76,-71.58"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge12_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge12_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.11,-19.7C249.66,-21.94 256.26,-24.58 262.25,-27.62 283.23,-38.29 304.44,-54.79 319.11,-67.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.76,-69.88 326.59,-73.83 321.36,-64.62 316.76,-69.88"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d58/persistent__seg__tree__lazy__prop_8cpp.html b/d5/d58/persistent__seg__tree__lazy__prop_8cpp.html
index db3630f75..10d982bb5 100644
--- a/d5/d58/persistent__seg__tree__lazy__prop_8cpp.html
+++ b/d5/d58/persistent__seg__tree__lazy__prop_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: range_queries/persistent_seg_tree_lazy_prop.cpp File Reference</title>
+<title>TheAlgorithms/C++: range_queries/persistent_seg_tree_lazy_prop.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for persistent_seg_tree_lazy_prop.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d86/persistent__seg__tree__lazy__prop_8cpp__incl.svg" width="255" height="126"><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">
+</div>
+<p><a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html">range_queries::perSegTree</a></td></tr>
@@ -134,7 +153,7 @@ Classes</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d69/namespacerange__queries.html">range_queries</a></td></tr>
-<tr class="memdesc:dd/d69/namespacerange__queries"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
+<tr class="memdesc:dd/d69/namespacerange__queries"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::vector <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
@@ -150,6 +169,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Persistent_data_structure" target="_blank">Persistent segment tree with range updates (lazy propagation)</a> </p>
 <p>A normal segment tree facilitates making point updates and range queries in logarithmic time. Lazy propagation preserves the logarithmic time with range updates. So, a segment tree with lazy propagation enables doing range updates and range queries in logarithmic time, but it doesn't save any information about itself before the last update. A persistent data structure always preserves the previous version of itself when it is modified. That is, a new version of the segment tree is generated after every update. It saves all previous versions of itself (before every update) to facilitate doing range queries in any version. More memory is used ,but the logarithmic time is preserved because the new version points to the same nodes, that the previous version points to, that are not affected by the update. That is, only the nodes that are affected by the update and their ancestors are copied. The rest is copied using lazy propagation in the next queries. Thus preserving the logarithmic time because the number of nodes copied after any update is logarithmic.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/MSedra" target="_blank">Magdy Sedra</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -168,17 +189,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00318">318</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  318</span>           {</div>
 <div class="line"><span class="lineno">  319</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  320</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  321</span>}</div>
-<div class="ttc" id="apersistent__seg__tree__lazy__prop_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:268</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="540"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="apersistent__seg__tree__lazy__prop_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00268">persistent_seg_tree_lazy_prop.cpp:268</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -206,65 +224,59 @@ Here is the call graph for this function:</div>
 
 <p>Test implementations. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00268">268</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  268</span>                   {</div>
-<div class="line"><span class="lineno">  269</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> arr = {-5, 2, 3, 11, -2, 7, 0, 1};</div>
+<div class="line"><span class="lineno">  269</span>    std::vector&lt;int64_t&gt; arr = {-5, 2, 3, 11, -2, 7, 0, 1};</div>
 <div class="line"><span class="lineno">  270</span>    <a class="code hl_class" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html">range_queries::perSegTree</a> tree;</div>
-<div class="line"><span class="lineno">  271</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Elements before any updates are {&quot;</span>;</div>
-<div class="line"><span class="lineno">  272</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); ++i) {</div>
-<div class="line"><span class="lineno">  273</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; arr[i];</div>
+<div class="line"><span class="lineno">  271</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Elements before any updates are {&quot;</span>;</div>
+<div class="line"><span class="lineno">  272</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; arr.size(); ++i) {</div>
+<div class="line"><span class="lineno">  273</span>        std::cout &lt;&lt; arr[i];</div>
 <div class="line"><span class="lineno">  274</span>        <span class="keywordflow">if</span> (i != arr.size() - 1) {</div>
-<div class="line"><span class="lineno">  275</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><span class="lineno">  275</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
 <div class="line"><span class="lineno">  276</span>        }</div>
 <div class="line"><span class="lineno">  277</span>    }</div>
-<div class="line"><span class="lineno">  278</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;}\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  278</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;}\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  279</span>    tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(</div>
 <div class="line"><span class="lineno">  280</span>        arr);  <span class="comment">// constructing the original segment tree (version = 0)</span></div>
-<div class="line"><span class="lineno">  281</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Querying range sum on version 0 from index 2 to 4 = 3+11-2 = &quot;</span></div>
+<div class="line"><span class="lineno">  281</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Querying range sum on version 0 from index 2 to 4 = 3+11-2 = &quot;</span></div>
 <div class="line"><span class="lineno">  282</span>              &lt;&lt; tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(2, 4, 0) &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
-<div class="line"><span class="lineno">  283</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div>
+<div class="line"><span class="lineno">  283</span>    std::cout</div>
 <div class="line"><span class="lineno">  284</span>        &lt;&lt; <span class="stringliteral">&quot;Subtract 7 from all elements from index 1 to index 5 inclusive\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  285</span>    tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">update</a>(1, 5, -7);  <span class="comment">// subtracting 7 from index 1 to index 5</span></div>
-<div class="line"><span class="lineno">  286</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Elements of the segment tree whose version = 1 (after 1 &quot;</span></div>
+<div class="line"><span class="lineno">  286</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Elements of the segment tree whose version = 1 (after 1 &quot;</span></div>
 <div class="line"><span class="lineno">  287</span>                 <span class="stringliteral">&quot;update) are {&quot;</span>;</div>
 <div class="line"><span class="lineno">  288</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; arr.size(); ++i) {</div>
-<div class="line"><span class="lineno">  289</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(i, i, 1);</div>
+<div class="line"><span class="lineno">  289</span>        std::cout &lt;&lt; tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(i, i, 1);</div>
 <div class="line"><span class="lineno">  290</span>        <span class="keywordflow">if</span> (i != arr.size() - 1) {</div>
-<div class="line"><span class="lineno">  291</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><span class="lineno">  291</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
 <div class="line"><span class="lineno">  292</span>        }</div>
 <div class="line"><span class="lineno">  293</span>    }</div>
-<div class="line"><span class="lineno">  294</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;}\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  295</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Add 10 to all elements from index 0 to index 7 inclusive\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  294</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;}\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  295</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Add 10 to all elements from index 0 to index 7 inclusive\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  296</span>    tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">update</a>(0, 7, 10);  <span class="comment">// adding 10 to all elements</span></div>
-<div class="line"><span class="lineno">  297</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Elements of the segment tree whose version = 2 (after 2 &quot;</span></div>
+<div class="line"><span class="lineno">  297</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Elements of the segment tree whose version = 2 (after 2 &quot;</span></div>
 <div class="line"><span class="lineno">  298</span>                 <span class="stringliteral">&quot;updates) are {&quot;</span>;</div>
 <div class="line"><span class="lineno">  299</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; arr.size(); ++i) {</div>
-<div class="line"><span class="lineno">  300</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(i, i, 2);</div>
+<div class="line"><span class="lineno">  300</span>        std::cout &lt;&lt; tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(i, i, 2);</div>
 <div class="line"><span class="lineno">  301</span>        <span class="keywordflow">if</span> (i != arr.size() - 1) {</div>
-<div class="line"><span class="lineno">  302</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><span class="lineno">  302</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
 <div class="line"><span class="lineno">  303</span>        }</div>
 <div class="line"><span class="lineno">  304</span>    }</div>
-<div class="line"><span class="lineno">  305</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;}\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  306</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Number of segment trees (versions) now = &quot;</span> &lt;&lt; tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">size</a>()</div>
+<div class="line"><span class="lineno">  305</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;}\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  306</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Number of segment trees (versions) now = &quot;</span> &lt;&lt; tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">size</a>()</div>
 <div class="line"><span class="lineno">  307</span>              &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
-<div class="line"><span class="lineno">  308</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Querying range sum on version 0 from index 3 to 5 = 11-2+7 = &quot;</span></div>
+<div class="line"><span class="lineno">  308</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Querying range sum on version 0 from index 3 to 5 = 11-2+7 = &quot;</span></div>
 <div class="line"><span class="lineno">  309</span>              &lt;&lt; tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(3, 5, 0) &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
-<div class="line"><span class="lineno">  310</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Querying range sum on version 1 from index 3 to 5 = 4-9+0 = &quot;</span></div>
+<div class="line"><span class="lineno">  310</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Querying range sum on version 1 from index 3 to 5 = 4-9+0 = &quot;</span></div>
 <div class="line"><span class="lineno">  311</span>              &lt;&lt; tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(3, 5, 1) &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
 <div class="line"><span class="lineno">  312</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="aclassrange__queries_1_1per_seg_tree_html"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html">range_queries::perSegTree</a></div><div class="ttdoc">Range query here is range sum, but the code can be modified to make different queries like range max ...</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:39</div></div>
-<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a0fe4e431f3e09c274ecd7d2d58dcb865"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">range_queries::perSegTree::size</a></div><div class="ttdeci">uint32_t size()</div><div class="ttdoc">Getting the number of versions after updates so far which is equal to the size of the pointers vector...</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:255</div></div>
-<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a24487eda25123bc4d112e8430821a6c6"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">range_queries::perSegTree::update</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; update(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value, std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">Doing range update, checking at every node if it has some value to be propagated. All nodes affected ...</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:135</div></div>
-<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a6d3f2465a7c5803a1ff16c5378bcc5e4"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">range_queries::perSegTree::construct</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; construct(const uint32_t &amp;i, const uint32_t &amp;j)</div><div class="ttdoc">Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:106</div></div>
-<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_ae8ae4b1835e5e8aec32f68c5059ed4d4"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">range_queries::perSegTree::query</a></div><div class="ttdeci">int64_t query(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">Querying the range from index l to index r, checking at every node if it has some value to be propaga...</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:171</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>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="540"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html">range_queries::perSegTree</a></div><div class="ttdoc">Range query here is range sum, but the code can be modified to make different queries like range max ...</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00039">persistent_seg_tree_lazy_prop.cpp:39</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a0fe4e431f3e09c274ecd7d2d58dcb865"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">range_queries::perSegTree::size</a></div><div class="ttdeci">uint32_t size()</div><div class="ttdoc">Getting the number of versions after updates so far which is equal to the size of the pointers vector...</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00255">persistent_seg_tree_lazy_prop.cpp:255</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a24487eda25123bc4d112e8430821a6c6"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">range_queries::perSegTree::update</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; update(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value, std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">Doing range update, checking at every node if it has some value to be propagated. All nodes affected ...</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00135">persistent_seg_tree_lazy_prop.cpp:135</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a6d3f2465a7c5803a1ff16c5378bcc5e4"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">range_queries::perSegTree::construct</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; construct(const uint32_t &amp;i, const uint32_t &amp;j)</div><div class="ttdoc">Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00106">persistent_seg_tree_lazy_prop.cpp:106</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_ae8ae4b1835e5e8aec32f68c5059ed4d4"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">range_queries::perSegTree::query</a></div><div class="ttdeci">int64_t query(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">Querying the range from index l to index r, checking at every node if it has some value to be propaga...</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00171">persistent_seg_tree_lazy_prop.cpp:171</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 7d78f0d9f..000000000
--- a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,27 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Test implementations." alt="" coords="5,102,49,128"/>
-<area shape="rect" id="Node000002" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4" title="Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum..." alt="" coords="547,29,725,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="37,100,61,75,96,54,151,36,209,24,268,17,326,14,437,17,532,28,532,33,437,23,326,20,268,23,210,30,153,41,98,59,65,79,41,104"/>
-<area shape="rect" id="Node000004" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4" title="Querying the range from index l to index r, checking at every node if it has some value to be propaga..." alt="" coords="97,273,274,314"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="36,127,59,177,77,207,99,234,132,262,129,267,95,238,73,210,54,180,31,129"/>
-<area shape="rect" id="Node000007" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865" title="Getting the number of versions after updates so far which is equal to the size of the pointers vector..." alt="" coords="97,95,274,135"/>
-<area shape="poly" id="edge9_Node000001_Node000007" title=" " alt="" coords="49,112,81,112,81,118,49,118"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="353,65,468,90"/>
-<area shape="poly" id="edge11_Node000001_Node000008" title=" " alt="" coords="48,100,70,89,96,80,159,70,223,65,337,68,337,73,223,71,160,75,97,86,72,94,50,105"/>
-<area shape="rect" id="Node000009" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6" title="Doing range update, checking at every node if it has some value to be propagated. All nodes affected ..." alt="" coords="97,184,274,225"/>
-<area shape="poly" id="edge12_Node000001_Node000009" title=" " alt="" coords="51,125,136,174,133,178,48,129"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="598,29,596,19,602,10,616,5,636,3,658,5,671,11,668,16,656,10,636,8,617,10,606,15,601,20,603,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="773,137,898,162"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="680,68,796,127,793,132,677,73"/>
-<area shape="poly" id="edge8_Node000004_Node000004" title=" " alt="" coords="155,273,153,263,158,255,169,249,185,247,203,249,213,255,210,260,201,254,185,252,171,254,162,258,158,264,160,272"/>
-<area shape="rect" id="Node000005" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" title="If there is some value to be propagated to the passed node, value is added to the node and the childr..." alt="" coords="322,241,499,282"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="274,278,306,274,307,279,274,284"/>
-<area shape="rect" id="Node000006" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" title="Creating a new node with the same values of curr node." alt="" coords="547,187,725,227"/>
-<area shape="poly" id="edge6_Node000005_Node000006" title=" " alt="" coords="497,238,534,229,536,234,498,243"/>
-<area shape="poly" id="edge7_Node000006_Node000003" title=" " alt="" coords="708,184,773,165,774,170,710,189"/>
-<area shape="poly" id="edge10_Node000007_Node000008" title=" " alt="" coords="274,98,337,87,338,92,274,103"/>
-<area shape="poly" id="edge14_Node000009_Node000003" title=" " alt="" coords="274,190,322,184,560,164,757,151,757,157,560,170,322,190,275,195"/>
-<area shape="poly" id="edge13_Node000009_Node000005" title=" " alt="" coords="268,223,314,234,313,240,267,228"/>
-<area shape="poly" id="edge15_Node000009_Node000006" title=" " alt="" coords="275,202,532,204,532,209,275,208"/>
-<area shape="poly" id="edge16_Node000009_Node000009" title=" " alt="" coords="155,184,153,174,158,165,169,159,185,157,203,160,213,166,210,171,201,165,185,163,171,164,162,169,158,175,160,183"/>
-</map>
diff --git a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 273ef0195..000000000
--- a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7a9a92c2445557aa765b6182ca1decbf
\ No newline at end of file
diff --git a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 3c49d9ec3..000000000
--- a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,326 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<!--zoomable 240 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 678;
-var viewHeight = 240;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-158.88 0,-158.88 0,-139.62 32.5,-139.62 32.5,-158.88"/>
-<text text-anchor="middle" x="16.25" y="-145.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4" target="_top" xlink:title="Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...">
-<polygon fill="white" stroke="#666666" points="539.5,-213.5 406.5,-213.5 406.5,-183 539.5,-183 539.5,-213.5"/>
-<text text-anchor="start" x="414.5" y="-200" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="473" y="-188.75" font-family="Helvetica,sans-Serif" font-size="10.00">::construct</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.05,-159.17C34.16,-169.88 50.31,-186.33 68.5,-193.25 176.02,-234.16 311.61,-224.65 395.03,-212.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="395.33,-216.06 404.7,-211.11 394.29,-209.14 395.33,-216.06"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4" target="_top" xlink:title="Querying the range from index l to index r, checking at every node if it has some value to be propaga...">
-<polygon fill="white" stroke="#666666" points="201.5,-30.5 68.5,-30.5 68.5,0 201.5,0 201.5,-30.5"/>
-<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="135" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.02,-139.24C28.14,-121.36 44.98,-83.42 68.5,-58.25 75.87,-50.37 84.95,-43.24 93.99,-37.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.86,-40.12 102.42,-31.8 92.1,-34.21 95.86,-40.12"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865" target="_top" xlink:title="Getting the number of versions after updates so far which is equal to the size of the pointers vector...">
-<polygon fill="white" stroke="#666666" points="201.5,-164.5 68.5,-164.5 68.5,-134 201.5,-134 201.5,-164.5"/>
-<text text-anchor="start" x="76.5" y="-151" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="135" y="-139.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge9_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge9_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33,-149.25C39.6,-149.25 47.81,-149.25 56.68,-149.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.67,-152.75 66.67,-149.25 56.67,-145.75 56.67,-152.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="347.25,-186.88 260.75,-186.88 260.75,-167.62 347.25,-167.62 347.25,-186.88"/>
-<text text-anchor="middle" x="304" y="-173.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge11_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge11_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.78,-158.63C42.63,-164.04 55.87,-170.32 68.5,-173.25 129.15,-187.29 201,-185.99 249.04,-182.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="249.2,-186.16 258.91,-181.92 248.67,-179.18 249.2,-186.16"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6" target="_top" xlink:title="Doing range update, checking at every node if it has some value to be propagated. All nodes affected ...">
-<polygon fill="white" stroke="#666666" points="201.5,-97.5 68.5,-97.5 68.5,-67 201.5,-67 201.5,-97.5"/>
-<text text-anchor="start" x="76.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="135" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge12_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge12_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33,-140.21C49.33,-130.84 75.46,-115.85 97.04,-103.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.66,-106.57 105.59,-98.55 95.18,-100.5 98.66,-106.57"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M446.51,-213.99C441.1,-223.06 449.93,-231.5 473,-231.5 485.61,-231.5 493.97,-228.97 498.07,-225.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="501.52,-225.85 499.3,-215.49 494.57,-224.97 501.52,-225.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="669.5,-132.88 575.5,-132.88 575.5,-113.62 669.5,-113.62 669.5,-132.88"/>
-<text text-anchor="middle" x="622.5" y="-119.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M504.92,-182.53C530.5,-169.52 566.59,-151.17 591.82,-138.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="593.22,-141.55 600.55,-133.9 590.05,-135.31 593.22,-141.55"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge8_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge8_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.96,-30.99C109.66,-40.06 116.68,-48.5 135,-48.5 145.02,-48.5 151.66,-45.97 154.91,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.37,-42.79 155.89,-32.49 151.41,-42.09 158.37,-42.79"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" target="_top" xlink:title="If there is some value to be propagated to the passed node, value is added to the node and the childr...">
-<polygon fill="white" stroke="#666666" points="370.5,-54.5 237.5,-54.5 237.5,-24 370.5,-24 370.5,-54.5"/>
-<text text-anchor="start" x="245.5" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="304" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::lazy</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.52,-24.67C209.47,-25.81 217.65,-26.98 225.75,-28.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.22,-31.61 235.62,-29.57 226.22,-24.68 225.22,-31.61"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" target="_top" xlink:title="Creating a new node with the same values of curr node.">
-<polygon fill="white" stroke="#666666" points="539.5,-95.5 406.5,-95.5 406.5,-65 539.5,-65 539.5,-95.5"/>
-<text text-anchor="start" x="414.5" y="-82" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="473" y="-70.75" font-family="Helvetica,sans-Serif" font-size="10.00">::newKid</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M369.09,-54.98C378.28,-57.24 387.8,-59.58 397.17,-61.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.07,-65.21 406.61,-64.2 397.74,-58.41 396.07,-65.21"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge7_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge7_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M527.67,-95.9C543.58,-100.53 560.83,-105.56 576.16,-110.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="574.9,-113.31 585.48,-112.75 576.86,-106.59 574.9,-113.31"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge10_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge10_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.52,-160.24C217.25,-162.87 233.87,-165.66 249.01,-168.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.32,-171.63 258.76,-169.83 249.48,-164.73 248.32,-171.63"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge14_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge14_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.73,-91.2C213.62,-92.67 225.92,-94.09 237.5,-95.25 353.11,-106.86 488.76,-115.61 563.94,-120.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="563.33,-123.51 573.52,-120.59 563.74,-116.52 563.33,-123.51"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge13_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge13_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M196.76,-66.6C207.93,-63.73 219.68,-60.7 231.14,-57.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.73,-61.22 240.54,-55.33 229.98,-54.44 231.73,-61.22"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node6 -->
-<g id="edge15_Node000009_Node000006" class="edge">
-<title>Node9&#45;&gt;Node6</title>
-<g id="a_edge15_Node000009_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.98,-81.86C257.35,-81.53 336.5,-81.06 394.8,-80.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="394.68,-84.21 404.66,-80.65 394.63,-77.21 394.68,-84.21"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node9 -->
-<g id="edge16_Node000009_Node000009" class="edge">
-<title>Node9&#45;&gt;Node9</title>
-<g id="a_edge16_Node000009_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.96,-97.99C109.66,-107.06 116.68,-115.5 135,-115.5 145.02,-115.5 151.66,-112.97 154.91,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.37,-109.79 155.89,-99.49 151.41,-109.09 158.37,-109.79"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 2b844fa80..000000000
--- a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,243 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="678pt" height="240pt"
- viewBox="0.00 0.00 677.50 239.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 235.5)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-158.88 0,-158.88 0,-139.62 32.5,-139.62 32.5,-158.88"/>
-<text text-anchor="middle" x="16.25" y="-145.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4" target="_top" xlink:title="Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...">
-<polygon fill="white" stroke="#666666" points="539.5,-213.5 406.5,-213.5 406.5,-183 539.5,-183 539.5,-213.5"/>
-<text text-anchor="start" x="414.5" y="-200" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="473" y="-188.75" font-family="Helvetica,sans-Serif" font-size="10.00">::construct</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.05,-159.17C34.16,-169.88 50.31,-186.33 68.5,-193.25 176.02,-234.16 311.61,-224.65 395.03,-212.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="395.33,-216.06 404.7,-211.11 394.29,-209.14 395.33,-216.06"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4" target="_top" xlink:title="Querying the range from index l to index r, checking at every node if it has some value to be propaga...">
-<polygon fill="white" stroke="#666666" points="201.5,-30.5 68.5,-30.5 68.5,0 201.5,0 201.5,-30.5"/>
-<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="135" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.02,-139.24C28.14,-121.36 44.98,-83.42 68.5,-58.25 75.87,-50.37 84.95,-43.24 93.99,-37.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.86,-40.12 102.42,-31.8 92.1,-34.21 95.86,-40.12"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865" target="_top" xlink:title="Getting the number of versions after updates so far which is equal to the size of the pointers vector...">
-<polygon fill="white" stroke="#666666" points="201.5,-164.5 68.5,-164.5 68.5,-134 201.5,-134 201.5,-164.5"/>
-<text text-anchor="start" x="76.5" y="-151" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="135" y="-139.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge9_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge9_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33,-149.25C39.6,-149.25 47.81,-149.25 56.68,-149.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.67,-152.75 66.67,-149.25 56.67,-145.75 56.67,-152.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="347.25,-186.88 260.75,-186.88 260.75,-167.62 347.25,-167.62 347.25,-186.88"/>
-<text text-anchor="middle" x="304" y="-173.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge11_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge11_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.78,-158.63C42.63,-164.04 55.87,-170.32 68.5,-173.25 129.15,-187.29 201,-185.99 249.04,-182.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="249.2,-186.16 258.91,-181.92 248.67,-179.18 249.2,-186.16"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6" target="_top" xlink:title="Doing range update, checking at every node if it has some value to be propagated. All nodes affected ...">
-<polygon fill="white" stroke="#666666" points="201.5,-97.5 68.5,-97.5 68.5,-67 201.5,-67 201.5,-97.5"/>
-<text text-anchor="start" x="76.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="135" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge12_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge12_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33,-140.21C49.33,-130.84 75.46,-115.85 97.04,-103.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.66,-106.57 105.59,-98.55 95.18,-100.5 98.66,-106.57"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M446.51,-213.99C441.1,-223.06 449.93,-231.5 473,-231.5 485.61,-231.5 493.97,-228.97 498.07,-225.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="501.52,-225.85 499.3,-215.49 494.57,-224.97 501.52,-225.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="669.5,-132.88 575.5,-132.88 575.5,-113.62 669.5,-113.62 669.5,-132.88"/>
-<text text-anchor="middle" x="622.5" y="-119.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M504.92,-182.53C530.5,-169.52 566.59,-151.17 591.82,-138.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="593.22,-141.55 600.55,-133.9 590.05,-135.31 593.22,-141.55"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge8_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge8_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.96,-30.99C109.66,-40.06 116.68,-48.5 135,-48.5 145.02,-48.5 151.66,-45.97 154.91,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.37,-42.79 155.89,-32.49 151.41,-42.09 158.37,-42.79"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" target="_top" xlink:title="If there is some value to be propagated to the passed node, value is added to the node and the childr...">
-<polygon fill="white" stroke="#666666" points="370.5,-54.5 237.5,-54.5 237.5,-24 370.5,-24 370.5,-54.5"/>
-<text text-anchor="start" x="245.5" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="304" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::lazy</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.52,-24.67C209.47,-25.81 217.65,-26.98 225.75,-28.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.22,-31.61 235.62,-29.57 226.22,-24.68 225.22,-31.61"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" target="_top" xlink:title="Creating a new node with the same values of curr node.">
-<polygon fill="white" stroke="#666666" points="539.5,-95.5 406.5,-95.5 406.5,-65 539.5,-65 539.5,-95.5"/>
-<text text-anchor="start" x="414.5" y="-82" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="473" y="-70.75" font-family="Helvetica,sans-Serif" font-size="10.00">::newKid</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M369.09,-54.98C378.28,-57.24 387.8,-59.58 397.17,-61.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.07,-65.21 406.61,-64.2 397.74,-58.41 396.07,-65.21"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge7_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge7_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M527.67,-95.9C543.58,-100.53 560.83,-105.56 576.16,-110.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="574.9,-113.31 585.48,-112.75 576.86,-106.59 574.9,-113.31"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge10_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge10_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.52,-160.24C217.25,-162.87 233.87,-165.66 249.01,-168.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.32,-171.63 258.76,-169.83 249.48,-164.73 248.32,-171.63"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge14_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge14_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.73,-91.2C213.62,-92.67 225.92,-94.09 237.5,-95.25 353.11,-106.86 488.76,-115.61 563.94,-120.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="563.33,-123.51 573.52,-120.59 563.74,-116.52 563.33,-123.51"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge13_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge13_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M196.76,-66.6C207.93,-63.73 219.68,-60.7 231.14,-57.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.73,-61.22 240.54,-55.33 229.98,-54.44 231.73,-61.22"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node6 -->
-<g id="edge15_Node000009_Node000006" class="edge">
-<title>Node9&#45;&gt;Node6</title>
-<g id="a_edge15_Node000009_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.98,-81.86C257.35,-81.53 336.5,-81.06 394.8,-80.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="394.68,-84.21 404.66,-80.65 394.63,-77.21 394.68,-84.21"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node9 -->
-<g id="edge16_Node000009_Node000009" class="edge">
-<title>Node9&#45;&gt;Node9</title>
-<g id="a_edge16_Node000009_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.96,-97.99C109.66,-107.06 116.68,-115.5 135,-115.5 145.02,-115.5 151.66,-112.97 154.91,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.37,-109.79 155.89,-99.49 151.41,-109.09 158.37,-109.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 95f4be6bf..000000000
--- a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,29 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,102,55,128"/>
-<area shape="rect" id="Node000002" href="$d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Test implementations." alt="" coords="103,102,146,128"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,112,87,112,87,118,55,118"/>
-<area shape="rect" id="Node000003" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4" title="Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum..." alt="" coords="645,29,822,70"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="134,100,159,75,193,54,249,36,306,24,365,17,424,14,535,17,630,28,629,33,534,23,424,20,366,23,307,30,250,41,195,59,162,79,138,104"/>
-<area shape="rect" id="Node000005" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4" title="Querying the range from index l to index r, checking at every node if it has some value to be propaga..." alt="" coords="194,273,371,314"/>
-<area shape="poly" id="edge5_Node000002_Node000005" title=" " alt="" coords="133,127,157,177,174,207,196,234,230,262,226,267,192,238,170,210,152,180,128,129"/>
-<area shape="rect" id="Node000008" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865" title="Getting the number of versions after updates so far which is equal to the size of the pointers vector..." alt="" coords="194,95,371,135"/>
-<area shape="poly" id="edge10_Node000002_Node000008" title=" " alt="" coords="147,112,178,112,178,118,147,118"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="450,65,566,90"/>
-<area shape="poly" id="edge12_Node000002_Node000009" title=" " alt="" coords="145,100,168,89,193,80,256,70,321,65,435,68,435,73,321,71,257,75,195,86,170,94,148,105"/>
-<area shape="rect" id="Node000010" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6" title="Doing range update, checking at every node if it has some value to be propagated. All nodes affected ..." alt="" coords="194,184,371,225"/>
-<area shape="poly" id="edge13_Node000002_Node000010" title=" " alt="" coords="148,125,233,174,231,178,145,129"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="695,29,694,19,700,10,713,5,733,3,755,5,768,11,766,16,754,10,733,8,714,10,703,15,699,20,701,28"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="870,137,995,162"/>
-<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="777,68,893,127,891,132,775,73"/>
-<area shape="poly" id="edge9_Node000005_Node000005" title=" " alt="" coords="252,273,251,263,255,255,266,249,283,247,300,249,311,255,308,260,298,254,283,252,268,254,259,258,256,264,257,272"/>
-<area shape="rect" id="Node000006" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" title="If there is some value to be propagated to the passed node, value is added to the node and the childr..." alt="" coords="419,241,597,282"/>
-<area shape="poly" id="edge6_Node000005_Node000006" title=" " alt="" coords="371,278,403,274,404,279,372,284"/>
-<area shape="rect" id="Node000007" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" title="Creating a new node with the same values of curr node." alt="" coords="645,187,822,227"/>
-<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="594,238,632,229,633,234,595,243"/>
-<area shape="poly" id="edge8_Node000007_Node000004" title=" " alt="" coords="805,184,870,165,872,170,807,189"/>
-<area shape="poly" id="edge11_Node000008_Node000009" title=" " alt="" coords="371,98,434,87,435,92,372,103"/>
-<area shape="poly" id="edge15_Node000010_Node000004" title=" " alt="" coords="371,190,419,184,657,164,854,151,855,157,657,170,420,190,372,195"/>
-<area shape="poly" id="edge14_Node000010_Node000006" title=" " alt="" coords="366,223,412,234,410,240,364,228"/>
-<area shape="poly" id="edge16_Node000010_Node000007" title=" " alt="" coords="372,202,629,204,629,209,372,208"/>
-<area shape="poly" id="edge17_Node000010_Node000010" title=" " alt="" coords="252,184,251,174,255,165,266,159,283,157,300,160,311,166,308,171,298,165,283,163,268,164,259,169,256,175,257,183"/>
-</map>
diff --git a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 753a4dad7..000000000
--- a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-35c4a8a9055930783c7379923c027a39
\ No newline at end of file
diff --git a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 29ec4c206..000000000
--- a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,344 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 240 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 751;
-var viewHeight = 240;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-158.88 0,-158.88 0,-139.62 37,-139.62 37,-158.88"/>
-<text text-anchor="middle" x="18.5" y="-145.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-158.88 73,-158.88 73,-139.62 105.5,-139.62 105.5,-158.88"/>
-<text text-anchor="middle" x="89.25" y="-145.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-149.25C44.58,-149.25 53.31,-149.25 61.45,-149.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-152.75 71.2,-149.25 61.2,-145.75 61.2,-152.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4" target="_top" xlink:title="Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...">
-<polygon fill="white" stroke="#666666" points="612.5,-213.5 479.5,-213.5 479.5,-183 612.5,-183 612.5,-213.5"/>
-<text text-anchor="start" x="487.5" y="-200" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="546" y="-188.75" font-family="Helvetica,sans-Serif" font-size="10.00">::construct</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.05,-159.17C107.16,-169.88 123.31,-186.33 141.5,-193.25 249.02,-234.16 384.61,-224.65 468.03,-212.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="468.33,-216.06 477.7,-211.11 467.29,-209.14 468.33,-216.06"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4" target="_top" xlink:title="Querying the range from index l to index r, checking at every node if it has some value to be propaga...">
-<polygon fill="white" stroke="#666666" points="274.5,-30.5 141.5,-30.5 141.5,0 274.5,0 274.5,-30.5"/>
-<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="208" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::query</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.02,-139.24C101.14,-121.36 117.98,-83.42 141.5,-58.25 148.87,-50.37 157.95,-43.24 166.99,-37.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.86,-40.12 175.42,-31.8 165.1,-34.21 168.86,-40.12"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865" target="_top" xlink:title="Getting the number of versions after updates so far which is equal to the size of the pointers vector...">
-<polygon fill="white" stroke="#666666" points="274.5,-164.5 141.5,-164.5 141.5,-134 274.5,-134 274.5,-164.5"/>
-<text text-anchor="start" x="149.5" y="-151" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="208" y="-139.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge10_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge10_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106,-149.25C112.6,-149.25 120.81,-149.25 129.68,-149.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.67,-152.75 139.67,-149.25 129.67,-145.75 129.67,-152.75"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="420.25,-186.88 333.75,-186.88 333.75,-167.62 420.25,-167.62 420.25,-186.88"/>
-<text text-anchor="middle" x="377" y="-173.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge12_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge12_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.78,-158.63C115.63,-164.04 128.87,-170.32 141.5,-173.25 202.15,-187.29 274,-185.99 322.04,-182.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.2,-186.16 331.91,-181.92 321.67,-179.18 322.2,-186.16"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6" target="_top" xlink:title="Doing range update, checking at every node if it has some value to be propagated. All nodes affected ...">
-<polygon fill="white" stroke="#666666" points="274.5,-97.5 141.5,-97.5 141.5,-67 274.5,-67 274.5,-97.5"/>
-<text text-anchor="start" x="149.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="208" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::update</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge13_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge13_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106,-140.21C122.33,-130.84 148.46,-115.85 170.04,-103.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.66,-106.57 178.59,-98.55 168.18,-100.5 171.66,-106.57"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M519.51,-213.99C514.1,-223.06 522.93,-231.5 546,-231.5 558.61,-231.5 566.97,-228.97 571.07,-225.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="574.52,-225.85 572.3,-215.49 567.57,-224.97 574.52,-225.85"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="742.5,-132.88 648.5,-132.88 648.5,-113.62 742.5,-113.62 742.5,-132.88"/>
-<text text-anchor="middle" x="695.5" y="-119.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M577.92,-182.53C603.5,-169.52 639.59,-151.17 664.82,-138.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="666.22,-141.55 673.55,-133.9 663.05,-135.31 666.22,-141.55"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge9_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge9_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.96,-30.99C182.66,-40.06 189.68,-48.5 208,-48.5 218.02,-48.5 224.66,-45.97 227.91,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.37,-42.79 228.89,-32.49 224.41,-42.09 231.37,-42.79"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" target="_top" xlink:title="If there is some value to be propagated to the passed node, value is added to the node and the childr...">
-<polygon fill="white" stroke="#666666" points="443.5,-54.5 310.5,-54.5 310.5,-24 443.5,-24 443.5,-54.5"/>
-<text text-anchor="start" x="318.5" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="377" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::lazy</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.52,-24.67C282.47,-25.81 290.65,-26.98 298.75,-28.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.22,-31.61 308.62,-29.57 299.22,-24.68 298.22,-31.61"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" target="_top" xlink:title="Creating a new node with the same values of curr node.">
-<polygon fill="white" stroke="#666666" points="612.5,-95.5 479.5,-95.5 479.5,-65 612.5,-65 612.5,-95.5"/>
-<text text-anchor="start" x="487.5" y="-82" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="546" y="-70.75" font-family="Helvetica,sans-Serif" font-size="10.00">::newKid</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M442.09,-54.98C451.28,-57.24 460.8,-59.58 470.17,-61.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="469.07,-65.21 479.61,-64.2 470.74,-58.41 469.07,-65.21"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge8_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge8_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M600.67,-95.9C616.58,-100.53 633.83,-105.56 649.16,-110.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="647.9,-113.31 658.48,-112.75 649.86,-106.59 647.9,-113.31"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge11_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge11_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.52,-160.24C290.25,-162.87 306.87,-165.66 322.01,-168.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="321.32,-171.63 331.76,-169.83 322.48,-164.73 321.32,-171.63"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node4 -->
-<g id="edge15_Node000010_Node000004" class="edge">
-<title>Node10&#45;&gt;Node4</title>
-<g id="a_edge15_Node000010_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.73,-91.2C286.62,-92.67 298.92,-94.09 310.5,-95.25 426.11,-106.86 561.76,-115.61 636.94,-120.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="636.33,-123.51 646.52,-120.59 636.74,-116.52 636.33,-123.51"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node6 -->
-<g id="edge14_Node000010_Node000006" class="edge">
-<title>Node10&#45;&gt;Node6</title>
-<g id="a_edge14_Node000010_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M269.76,-66.6C280.93,-63.73 292.68,-60.7 304.14,-57.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.73,-61.22 313.54,-55.33 302.98,-54.44 304.73,-61.22"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node7 -->
-<g id="edge16_Node000010_Node000007" class="edge">
-<title>Node10&#45;&gt;Node7</title>
-<g id="a_edge16_Node000010_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.98,-81.86C330.35,-81.53 409.5,-81.06 467.8,-80.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="467.68,-84.21 477.66,-80.65 467.63,-77.21 467.68,-84.21"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node10 -->
-<g id="edge17_Node000010_Node000010" class="edge">
-<title>Node10&#45;&gt;Node10</title>
-<g id="a_edge17_Node000010_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.96,-97.99C182.66,-107.06 189.68,-115.5 208,-115.5 218.02,-115.5 224.66,-112.97 227.91,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.37,-109.79 228.89,-99.49 224.41,-109.09 231.37,-109.79"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 59961a0df..000000000
--- a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,261 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="751pt" height="240pt"
- viewBox="0.00 0.00 750.50 239.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 235.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-158.88 0,-158.88 0,-139.62 37,-139.62 37,-158.88"/>
-<text text-anchor="middle" x="18.5" y="-145.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-158.88 73,-158.88 73,-139.62 105.5,-139.62 105.5,-158.88"/>
-<text text-anchor="middle" x="89.25" y="-145.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-149.25C44.58,-149.25 53.31,-149.25 61.45,-149.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-152.75 71.2,-149.25 61.2,-145.75 61.2,-152.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4" target="_top" xlink:title="Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...">
-<polygon fill="white" stroke="#666666" points="612.5,-213.5 479.5,-213.5 479.5,-183 612.5,-183 612.5,-213.5"/>
-<text text-anchor="start" x="487.5" y="-200" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="546" y="-188.75" font-family="Helvetica,sans-Serif" font-size="10.00">::construct</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.05,-159.17C107.16,-169.88 123.31,-186.33 141.5,-193.25 249.02,-234.16 384.61,-224.65 468.03,-212.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="468.33,-216.06 477.7,-211.11 467.29,-209.14 468.33,-216.06"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4" target="_top" xlink:title="Querying the range from index l to index r, checking at every node if it has some value to be propaga...">
-<polygon fill="white" stroke="#666666" points="274.5,-30.5 141.5,-30.5 141.5,0 274.5,0 274.5,-30.5"/>
-<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="208" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::query</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.02,-139.24C101.14,-121.36 117.98,-83.42 141.5,-58.25 148.87,-50.37 157.95,-43.24 166.99,-37.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.86,-40.12 175.42,-31.8 165.1,-34.21 168.86,-40.12"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865" target="_top" xlink:title="Getting the number of versions after updates so far which is equal to the size of the pointers vector...">
-<polygon fill="white" stroke="#666666" points="274.5,-164.5 141.5,-164.5 141.5,-134 274.5,-134 274.5,-164.5"/>
-<text text-anchor="start" x="149.5" y="-151" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="208" y="-139.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge10_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge10_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106,-149.25C112.6,-149.25 120.81,-149.25 129.68,-149.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.67,-152.75 139.67,-149.25 129.67,-145.75 129.67,-152.75"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="420.25,-186.88 333.75,-186.88 333.75,-167.62 420.25,-167.62 420.25,-186.88"/>
-<text text-anchor="middle" x="377" y="-173.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge12_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge12_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.78,-158.63C115.63,-164.04 128.87,-170.32 141.5,-173.25 202.15,-187.29 274,-185.99 322.04,-182.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.2,-186.16 331.91,-181.92 321.67,-179.18 322.2,-186.16"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6" target="_top" xlink:title="Doing range update, checking at every node if it has some value to be propagated. All nodes affected ...">
-<polygon fill="white" stroke="#666666" points="274.5,-97.5 141.5,-97.5 141.5,-67 274.5,-67 274.5,-97.5"/>
-<text text-anchor="start" x="149.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="208" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::update</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge13_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge13_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106,-140.21C122.33,-130.84 148.46,-115.85 170.04,-103.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.66,-106.57 178.59,-98.55 168.18,-100.5 171.66,-106.57"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M519.51,-213.99C514.1,-223.06 522.93,-231.5 546,-231.5 558.61,-231.5 566.97,-228.97 571.07,-225.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="574.52,-225.85 572.3,-215.49 567.57,-224.97 574.52,-225.85"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="742.5,-132.88 648.5,-132.88 648.5,-113.62 742.5,-113.62 742.5,-132.88"/>
-<text text-anchor="middle" x="695.5" y="-119.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M577.92,-182.53C603.5,-169.52 639.59,-151.17 664.82,-138.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="666.22,-141.55 673.55,-133.9 663.05,-135.31 666.22,-141.55"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge9_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge9_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.96,-30.99C182.66,-40.06 189.68,-48.5 208,-48.5 218.02,-48.5 224.66,-45.97 227.91,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.37,-42.79 228.89,-32.49 224.41,-42.09 231.37,-42.79"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" target="_top" xlink:title="If there is some value to be propagated to the passed node, value is added to the node and the childr...">
-<polygon fill="white" stroke="#666666" points="443.5,-54.5 310.5,-54.5 310.5,-24 443.5,-24 443.5,-54.5"/>
-<text text-anchor="start" x="318.5" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="377" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::lazy</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.52,-24.67C282.47,-25.81 290.65,-26.98 298.75,-28.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.22,-31.61 308.62,-29.57 299.22,-24.68 298.22,-31.61"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" target="_top" xlink:title="Creating a new node with the same values of curr node.">
-<polygon fill="white" stroke="#666666" points="612.5,-95.5 479.5,-95.5 479.5,-65 612.5,-65 612.5,-95.5"/>
-<text text-anchor="start" x="487.5" y="-82" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="546" y="-70.75" font-family="Helvetica,sans-Serif" font-size="10.00">::newKid</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M442.09,-54.98C451.28,-57.24 460.8,-59.58 470.17,-61.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="469.07,-65.21 479.61,-64.2 470.74,-58.41 469.07,-65.21"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge8_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge8_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M600.67,-95.9C616.58,-100.53 633.83,-105.56 649.16,-110.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="647.9,-113.31 658.48,-112.75 649.86,-106.59 647.9,-113.31"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge11_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge11_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.52,-160.24C290.25,-162.87 306.87,-165.66 322.01,-168.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="321.32,-171.63 331.76,-169.83 322.48,-164.73 321.32,-171.63"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node4 -->
-<g id="edge15_Node000010_Node000004" class="edge">
-<title>Node10&#45;&gt;Node4</title>
-<g id="a_edge15_Node000010_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.73,-91.2C286.62,-92.67 298.92,-94.09 310.5,-95.25 426.11,-106.86 561.76,-115.61 636.94,-120.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="636.33,-123.51 646.52,-120.59 636.74,-116.52 636.33,-123.51"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node6 -->
-<g id="edge14_Node000010_Node000006" class="edge">
-<title>Node10&#45;&gt;Node6</title>
-<g id="a_edge14_Node000010_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M269.76,-66.6C280.93,-63.73 292.68,-60.7 304.14,-57.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.73,-61.22 313.54,-55.33 302.98,-54.44 304.73,-61.22"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node7 -->
-<g id="edge16_Node000010_Node000007" class="edge">
-<title>Node10&#45;&gt;Node7</title>
-<g id="a_edge16_Node000010_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.98,-81.86C330.35,-81.53 409.5,-81.06 467.8,-80.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="467.68,-84.21 477.66,-80.65 467.63,-77.21 467.68,-84.21"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node10 -->
-<g id="edge17_Node000010_Node000010" class="edge">
-<title>Node10&#45;&gt;Node10</title>
-<g id="a_edge17_Node000010_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.96,-97.99C182.66,-107.06 189.68,-115.5 208,-115.5 218.02,-115.5 224.66,-112.97 227.91,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.37,-109.79 228.89,-99.49 224.41,-109.09 231.37,-109.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html
new file mode 100644
index 000000000..5637ec3e5
--- /dev/null
+++ b/d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html
@@ -0,0 +1,371 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: range_queries/persistent_seg_tree_lazy_prop.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">persistent_seg_tree_lazy_prop.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;memory&gt;</span>    </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d69/namespacerange__queries.html">range_queries</a> {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="foldopen" id="foldopen00039" data-start="{" data-end="};">
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html">   39</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html">perSegTree</a> {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> <span class="keyword">private</span>:</div>
+<div class="foldopen" id="foldopen00041" data-start="{" data-end="};">
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">   41</a></span>    <span class="keyword">class </span><a class="code hl_class" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>     <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        std::shared_ptr&lt;Node&gt; left = <span class="keyword">nullptr</span>;   </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088">   44</a></span>        std::shared_ptr&lt;Node&gt; <a class="code hl_variable" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088">right</a> = <span class="keyword">nullptr</span>;  </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf">   45</a></span>        int64_t <a class="code hl_variable" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf">val</a> = 0,</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>                prop = 0;  </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    };</div>
+</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    uint32_t n = 0;  </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    std::vector&lt;std::shared_ptr&lt;Node&gt;&gt;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">   54</a></span>        <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>{};  </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">   57</a></span>    std::vector&lt;int64_t&gt; <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>{};  </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="foldopen" id="foldopen00065" data-start="{" data-end="}">
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817">   65</a></span>    std::shared_ptr&lt;Node&gt; <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817">newKid</a>(std::shared_ptr&lt;Node&gt; <span class="keyword">const</span> &amp;curr) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="keyword">auto</span> newNode = std::make_shared&lt;Node&gt;(<a class="code hl_class" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a>());</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        newNode-&gt;left = curr-&gt;left;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        newNode-&gt;right = curr-&gt;right;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        newNode-&gt;prop = curr-&gt;prop;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        newNode-&gt;val = curr-&gt;val;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        <span class="keywordflow">return</span> newNode;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    }</div>
+</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="foldopen" id="foldopen00083" data-start="{" data-end="}">
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79">   83</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79">lazy</a>(<span class="keyword">const</span> uint32_t &amp;i, <span class="keyword">const</span> uint32_t &amp;j,</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>              std::shared_ptr&lt;Node&gt; <span class="keyword">const</span> &amp;curr) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        <span class="keywordflow">if</span> (!curr-&gt;prop) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        curr-&gt;val += (j - i + 1) * curr-&gt;prop;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        <span class="keywordflow">if</span> (i != j) {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>            curr-&gt;left = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817">newKid</a>(curr-&gt;left);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>            curr-&gt;right = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817">newKid</a>(curr-&gt;right);</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>            curr-&gt;left-&gt;prop += curr-&gt;prop;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>            curr-&gt;right-&gt;prop += curr-&gt;prop;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        }</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        curr-&gt;prop = 0;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    }</div>
+</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="foldopen" id="foldopen00106" data-start="{" data-end="}">
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">  106</a></span>    std::shared_ptr&lt;Node&gt; <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(<span class="keyword">const</span> uint32_t &amp;i, <span class="keyword">const</span> uint32_t &amp;j) {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        <span class="keyword">auto</span> newNode = std::make_shared&lt;Node&gt;(<a class="code hl_class" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a>());</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <span class="keywordflow">if</span> (i == j) {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            newNode-&gt;val = <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>[i];</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>            uint32_t mid = i + (j - i) / 2;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>            <span class="keyword">auto</span> leftt = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(i, mid);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>            <span class="keyword">auto</span> right = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(mid + 1, j);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>            newNode-&gt;val = leftt-&gt;val + right-&gt;val;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>            newNode-&gt;left = leftt;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>            newNode-&gt;right = right;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        }</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        <span class="keywordflow">return</span> newNode;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    }</div>
+</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="foldopen" id="foldopen00135" data-start="{" data-end="}">
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">  135</a></span>    std::shared_ptr&lt;Node&gt; <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">update</a>(<span class="keyword">const</span> uint32_t &amp;i, <span class="keyword">const</span> uint32_t &amp;j,</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>                                 <span class="keyword">const</span> uint32_t &amp;l, <span class="keyword">const</span> uint32_t &amp;r,</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>                                 <span class="keyword">const</span> int64_t &amp;value,</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>                                 std::shared_ptr&lt;Node&gt; <span class="keyword">const</span> &amp;curr) {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>        <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79">lazy</a>(i, j, curr);</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        <span class="keywordflow">if</span> (i &gt;= l &amp;&amp; j &lt;= r) {</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>            std::shared_ptr&lt;Node&gt; newNode = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817">newKid</a>(curr);</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>            newNode-&gt;prop += value;</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>            <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79">lazy</a>(i, j, newNode);</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>            <span class="keywordflow">return</span> newNode;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        }</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        <span class="keywordflow">if</span> (i &gt; r || j &lt; l) {</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>            <span class="keywordflow">return</span> curr;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        }</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        <span class="keyword">auto</span> newNode = std::make_shared&lt;Node&gt;(<a class="code hl_class" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a>());</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>        uint32_t mid = i + (j - i) / 2;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>        newNode-&gt;left = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">update</a>(i, mid, l, r, value, curr-&gt;left);</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>        newNode-&gt;right = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">update</a>(mid + 1, j, l, r, value, curr-&gt;right);</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>        newNode-&gt;val = newNode-&gt;left-&gt;val + newNode-&gt;right-&gt;val;</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        <span class="keywordflow">return</span> newNode;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    }</div>
+</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span> </div>
+<div class="foldopen" id="foldopen00171" data-start="{" data-end="}">
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">  171</a></span>    int64_t <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(<span class="keyword">const</span> uint32_t &amp;i, <span class="keyword">const</span> uint32_t &amp;j, <span class="keyword">const</span> uint32_t &amp;l,</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>                  <span class="keyword">const</span> uint32_t &amp;r, std::shared_ptr&lt;Node&gt; <span class="keyword">const</span> &amp;curr) {</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>        <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79">lazy</a>(i, j, curr);</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        <span class="keywordflow">if</span> (j &lt; l || r &lt; i) {</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>            <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        }</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        <span class="keywordflow">if</span> (i &gt;= l &amp;&amp; j &lt;= r) {</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>            <span class="keywordflow">return</span> curr-&gt;val;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        }</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        uint32_t mid = i + (j - i) / 2;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(i, mid, l, r, curr-&gt;left) +</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>               <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(mid + 1, j, l, r, curr-&gt;right);</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    }</div>
+</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span> </div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00197" data-start="{" data-end="}">
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3">  197</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3">construct</a>(<span class="keyword">const</span> std::vector&lt;int64_t&gt;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>                       &amp;<a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>)  <span class="comment">// the segment tree will be built from the values</span></div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>                              <span class="comment">// in &quot;vec&quot;, &quot;vec&quot; is 0 indexed</span></div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    {</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>.empty()) {</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>        }</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>        n = <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>.size();</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>        this-&gt;vec = <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>;</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>        <span class="keyword">auto</span> root = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(0, n - 1);</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>        <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.push_back(root);</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    }</div>
+</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span> </div>
+<div class="foldopen" id="foldopen00219" data-start="{" data-end="}">
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d">  219</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d">update</a>(<span class="keyword">const</span> uint32_t &amp;l, <span class="keyword">const</span> uint32_t &amp;r,</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>                <span class="keyword">const</span> int64_t</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>                    &amp;value)  <span class="comment">// all elements from index &quot;l&quot; to index &quot;r&quot; would</span></div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>                             <span class="comment">// by updated by &quot;value&quot;, &quot;l&quot; and &quot;r&quot; are 0 indexed</span></div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    {</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>        <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.push_back(<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">update</a>(</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>            0, n - 1, l, r, value,</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>            <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>[<a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.size() -</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>                 1]));  <span class="comment">// saving the root pointer to the new segment tree</span></div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    }</div>
+</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span> </div>
+<div class="foldopen" id="foldopen00241" data-start="{" data-end="}">
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571">  241</a></span>    int64_t <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571">query</a>(</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>        <span class="keyword">const</span> uint32_t &amp;l, <span class="keyword">const</span> uint32_t &amp;r,</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>        <span class="keyword">const</span> uint32_t</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>            &amp;version)  <span class="comment">// querying the range from &quot;l&quot; to &quot;r&quot; in a segment tree</span></div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>                       <span class="comment">// after &quot;version&quot; updates, &quot;l&quot; and &quot;r&quot; are 0 indexed</span></div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    {</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(0, n - 1, l, r, <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>[version]);</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>    }</div>
+</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span> </div>
+<div class="foldopen" id="foldopen00255" data-start="{" data-end="}">
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">  255</a></span>    uint32_t <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">size</a>()  <span class="comment">// returns the number of segment trees (versions) , the</span></div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>                     <span class="comment">// number of updates done so far = returned value - 1</span></div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>                     <span class="comment">// ,because one of the trees is the original segment tree</span></div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    {</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.size();</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>    }</div>
+</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>};</div>
+</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>}  <span class="comment">// namespace range_queries</span></div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span> </div>
+<div class="foldopen" id="foldopen00268" data-start="{" data-end="}">
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"><a class="line" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  268</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>    std::vector&lt;int64_t&gt; arr = {-5, 2, 3, 11, -2, 7, 0, 1};</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    <a class="code hl_class" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html">range_queries::perSegTree</a> tree;</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Elements before any updates are {&quot;</span>;</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; arr.size(); ++i) {</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>        std::cout &lt;&lt; arr[i];</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>        <span class="keywordflow">if</span> (i != arr.size() - 1) {</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>        }</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>    }</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;}\n&quot;</span>;</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>    tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>        arr);  <span class="comment">// constructing the original segment tree (version = 0)</span></div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Querying range sum on version 0 from index 2 to 4 = 3+11-2 = &quot;</span></div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>              &lt;&lt; tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(2, 4, 0) &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    std::cout</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>        &lt;&lt; <span class="stringliteral">&quot;Subtract 7 from all elements from index 1 to index 5 inclusive\n&quot;</span>;</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>    tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">update</a>(1, 5, -7);  <span class="comment">// subtracting 7 from index 1 to index 5</span></div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Elements of the segment tree whose version = 1 (after 1 &quot;</span></div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>                 <span class="stringliteral">&quot;update) are {&quot;</span>;</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; arr.size(); ++i) {</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>        std::cout &lt;&lt; tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(i, i, 1);</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>        <span class="keywordflow">if</span> (i != arr.size() - 1) {</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>        }</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>    }</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;}\n&quot;</span>;</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Add 10 to all elements from index 0 to index 7 inclusive\n&quot;</span>;</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>    tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">update</a>(0, 7, 10);  <span class="comment">// adding 10 to all elements</span></div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Elements of the segment tree whose version = 2 (after 2 &quot;</span></div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>                 <span class="stringliteral">&quot;updates) are {&quot;</span>;</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; arr.size(); ++i) {</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>        std::cout &lt;&lt; tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(i, i, 2);</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>        <span class="keywordflow">if</span> (i != arr.size() - 1) {</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>        }</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>    }</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;}\n&quot;</span>;</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Number of segment trees (versions) now = &quot;</span> &lt;&lt; tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">size</a>()</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>              &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Querying range sum on version 0 from index 3 to 5 = 11-2+7 = &quot;</span></div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>              &lt;&lt; tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(3, 5, 0) &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Querying range sum on version 1 from index 3 to 5 = 4-9+0 = &quot;</span></div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>              &lt;&lt; tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(3, 5, 1) &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>}</div>
+</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span> </div>
+<div class="foldopen" id="foldopen00318" data-start="{" data-end="}">
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"><a class="line" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  318</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>    <a class="code hl_function" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>}</div>
+</div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_1_1_node_html"><div class="ttname"><a href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">range_queries::perSegTree::Node</a></div><div class="ttdef"><b>Definition</b> <a href="#l00041">persistent_seg_tree_lazy_prop.cpp:41</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_1_1_node_html_a9adb4639a0797e94a3e556b6b902c088"><div class="ttname"><a href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088">range_queries::perSegTree::Node::right</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; right</div><div class="ttdoc">pointer to the left node</div><div class="ttdef"><b>Definition</b> <a href="#l00044">persistent_seg_tree_lazy_prop.cpp:44</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_1_1_node_html_acc044f787c90b815773726d7fdfdaccf"><div class="ttname"><a href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf">range_queries::perSegTree::Node::val</a></div><div class="ttdeci">int64_t val</div><div class="ttdoc">pointer to the right node</div><div class="ttdef"><b>Definition</b> <a href="#l00045">persistent_seg_tree_lazy_prop.cpp:45</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html">range_queries::perSegTree</a></div><div class="ttdoc">Range query here is range sum, but the code can be modified to make different queries like range max ...</div><div class="ttdef"><b>Definition</b> <a href="#l00039">persistent_seg_tree_lazy_prop.cpp:39</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a0cec4b77d264521717cf9b0482c45817"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817">range_queries::perSegTree::newKid</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; newKid(std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">Creating a new node with the same values of curr node.</div><div class="ttdef"><b>Definition</b> <a href="#l00065">persistent_seg_tree_lazy_prop.cpp:65</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a0fe4e431f3e09c274ecd7d2d58dcb865"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">range_queries::perSegTree::size</a></div><div class="ttdeci">uint32_t size()</div><div class="ttdoc">Getting the number of versions after updates so far which is equal to the size of the pointers vector...</div><div class="ttdef"><b>Definition</b> <a href="#l00255">persistent_seg_tree_lazy_prop.cpp:255</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a1eac9cf0613dfc8e2b0195009dd5c9d5"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">range_queries::perSegTree::ptrs</a></div><div class="ttdeci">std::vector&lt; std::shared_ptr&lt; Node &gt; &gt; ptrs</div><div class="ttdoc">number of elements/leaf nodes in the segment tree</div><div class="ttdef"><b>Definition</b> <a href="#l00054">persistent_seg_tree_lazy_prop.cpp:54</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a24487eda25123bc4d112e8430821a6c6"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">range_queries::perSegTree::update</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; update(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value, std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">Doing range update, checking at every node if it has some value to be propagated. All nodes affected ...</div><div class="ttdef"><b>Definition</b> <a href="#l00135">persistent_seg_tree_lazy_prop.cpp:135</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a6d3f2465a7c5803a1ff16c5378bcc5e4"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">range_queries::perSegTree::construct</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; construct(const uint32_t &amp;i, const uint32_t &amp;j)</div><div class="ttdoc">Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...</div><div class="ttdef"><b>Definition</b> <a href="#l00106">persistent_seg_tree_lazy_prop.cpp:106</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a8ff495d2f389b4aaa54449c26c6078f3"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">range_queries::perSegTree::vec</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; vec</div><div class="ttdef"><b>Definition</b> <a href="#l00057">persistent_seg_tree_lazy_prop.cpp:57</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_ac83bcabf5a8db8b0d8d156a4c1bcd4c3"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3">range_queries::perSegTree::construct</a></div><div class="ttdeci">void construct(const std::vector&lt; int64_t &gt; &amp;vec)</div><div class="ttdoc">Constructing the segment tree with the values in the passed vector. Returned root pointer is pushed i...</div><div class="ttdef"><b>Definition</b> <a href="#l00197">persistent_seg_tree_lazy_prop.cpp:197</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_ace7f57935b3bb9446f11c239fd89ae79"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79">range_queries::perSegTree::lazy</a></div><div class="ttdeci">void lazy(const uint32_t &amp;i, const uint32_t &amp;j, std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">If there is some value to be propagated to the passed node, value is added to the node and the childr...</div><div class="ttdef"><b>Definition</b> <a href="#l00083">persistent_seg_tree_lazy_prop.cpp:83</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_ad484002bcb701820d55f32ea5d525571"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571">range_queries::perSegTree::query</a></div><div class="ttdeci">int64_t query(const uint32_t &amp;l, const uint32_t &amp;r, const uint32_t &amp;version)</div><div class="ttdoc">Querying the range from index l to index r, getting the sum of the elements whose index x satisfies l...</div><div class="ttdef"><b>Definition</b> <a href="#l00241">persistent_seg_tree_lazy_prop.cpp:241</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_ae8ae4b1835e5e8aec32f68c5059ed4d4"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">range_queries::perSegTree::query</a></div><div class="ttdeci">int64_t query(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">Querying the range from index l to index r, checking at every node if it has some value to be propaga...</div><div class="ttdef"><b>Definition</b> <a href="#l00171">persistent_seg_tree_lazy_prop.cpp:171</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_af87494e6cf012d28c4f5b9d1c15f9c5d"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d">range_queries::perSegTree::update</a></div><div class="ttdeci">void update(const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value)</div><div class="ttdoc">Doing range update by passing the left and right indexes of the range as well as the value to be adde...</div><div class="ttdef"><b>Definition</b> <a href="#l00219">persistent_seg_tree_lazy_prop.cpp:219</a></div></div>
+<div class="ttc" id="anamespacerange__queries_html"><div class="ttname"><a href="../../dd/d69/namespacerange__queries.html">range_queries</a></div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00028">fenwick_tree.cpp:28</a></div></div>
+<div class="ttc" id="apersistent__seg__tree__lazy__prop_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d58/persistent__seg__tree__lazy__prop_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> <a href="#l00268">persistent_seg_tree_lazy_prop.cpp:268</a></div></div>
+<div class="ttc" id="apersistent__seg__tree__lazy__prop_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00318">persistent_seg_tree_lazy_prop.cpp:318</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_074119ce3a874b57120c49a0cc4bb5ad.html">range_queries</a></li><li class="navelem"><a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html">persistent_seg_tree_lazy_prop.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/d5f/namespacegeometry.html b/d5/d5f/namespacegeometry.html
index 21786c617..91661d7cf 100644
--- a/d5/d5f/namespacegeometry.html
+++ b/d5/d5f/namespacegeometry.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: geometry Namespace Reference</title>
+<title>TheAlgorithms/C++: geometry Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -108,12 +125,12 @@ $(function(){initNavTree('d5/d5f/namespacegeometry.html','../../'); initResizabl
 </div><!--header-->
 <div class="contents">
 
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>  
+<p>for std::swap  
 <a href="#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/algorithm/swap.html">std::swap</a> </p>
+<div class="textblock"><p>for std::swap </p>
 <p>Geometry algorithms.</p>
-<p>for mathematics and datatype conversion for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
+<p>for mathematics and datatype conversion for IO operations for std::stack for std::vector </p>
 </div></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html b/d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html
index 98ebb1c1a..faa1013df 100644
--- a/d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html
+++ b/d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: range_queries::perSegTree::Node Class Reference</title>
+<title>TheAlgorithms/C++: range_queries::perSegTree::Node Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,23 +135,91 @@ Collaboration diagram for range_queries::perSegTree::Node:</div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:ab3e7bf5a91911c17907b30b250108013" id="r_ab3e7bf5a91911c17907b30b250108013"><td class="memItemLeft" align="right" valign="top"><a id="ab3e7bf5a91911c17907b30b250108013" name="ab3e7bf5a91911c17907b30b250108013"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>left</b> = nullptr</td></tr>
+<tr class="memitem:ab3e7bf5a91911c17907b30b250108013" id="r_ab3e7bf5a91911c17907b30b250108013"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab3e7bf5a91911c17907b30b250108013">left</a> = nullptr</td></tr>
 <tr class="separator:ab3e7bf5a91911c17907b30b250108013"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a9adb4639a0797e94a3e556b6b902c088" id="r_a9adb4639a0797e94a3e556b6b902c088"><td class="memItemLeft" align="right" valign="top"><a id="a9adb4639a0797e94a3e556b6b902c088" name="a9adb4639a0797e94a3e556b6b902c088"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>right</b> = nullptr</td></tr>
-<tr class="memdesc:a9adb4639a0797e94a3e556b6b902c088"><td class="mdescLeft">&#160;</td><td class="mdescRight">pointer to the left node <br /></td></tr>
+<tr class="memitem:a9adb4639a0797e94a3e556b6b902c088" id="r_a9adb4639a0797e94a3e556b6b902c088"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9adb4639a0797e94a3e556b6b902c088">right</a> = nullptr</td></tr>
+<tr class="memdesc:a9adb4639a0797e94a3e556b6b902c088"><td class="mdescLeft">&#160;</td><td class="mdescRight">pointer to the left node  <br /></td></tr>
 <tr class="separator:a9adb4639a0797e94a3e556b6b902c088"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:acc044f787c90b815773726d7fdfdaccf" id="r_acc044f787c90b815773726d7fdfdaccf"><td class="memItemLeft" align="right" valign="top"><a id="acc044f787c90b815773726d7fdfdaccf" name="acc044f787c90b815773726d7fdfdaccf"></a>
-int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>val</b> = 0</td></tr>
-<tr class="memdesc:acc044f787c90b815773726d7fdfdaccf"><td class="mdescLeft">&#160;</td><td class="mdescRight">pointer to the right node <br /></td></tr>
+<tr class="memitem:acc044f787c90b815773726d7fdfdaccf" id="r_acc044f787c90b815773726d7fdfdaccf"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acc044f787c90b815773726d7fdfdaccf">val</a> = 0</td></tr>
+<tr class="memdesc:acc044f787c90b815773726d7fdfdaccf"><td class="mdescLeft">&#160;</td><td class="mdescRight">pointer to the right node  <br /></td></tr>
 <tr class="separator:acc044f787c90b815773726d7fdfdaccf"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:adeb7de2a7341362c3c6edf4d48476656" id="r_adeb7de2a7341362c3c6edf4d48476656"><td class="memItemLeft" align="right" valign="top"><a id="adeb7de2a7341362c3c6edf4d48476656" name="adeb7de2a7341362c3c6edf4d48476656"></a>
-int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>prop</b> = 0</td></tr>
+<tr class="memitem:adeb7de2a7341362c3c6edf4d48476656" id="r_adeb7de2a7341362c3c6edf4d48476656"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adeb7de2a7341362c3c6edf4d48476656">prop</a> = 0</td></tr>
 <tr class="separator:adeb7de2a7341362c3c6edf4d48476656"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
+</div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="ab3e7bf5a91911c17907b30b250108013" name="ab3e7bf5a91911c17907b30b250108013"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ab3e7bf5a91911c17907b30b250108013">&#9670;&#160;</a></span>left</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::shared_ptr&lt;<a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a>&gt; range_queries::perSegTree::Node::left = nullptr</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00043">43</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
+
+</div>
+</div>
+<a id="adeb7de2a7341362c3c6edf4d48476656" name="adeb7de2a7341362c3c6edf4d48476656"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#adeb7de2a7341362c3c6edf4d48476656">&#9670;&#160;</a></span>prop</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int64_t range_queries::perSegTree::Node::prop = 0</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00046">46</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a9adb4639a0797e94a3e556b6b902c088" name="a9adb4639a0797e94a3e556b6b902c088"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a9adb4639a0797e94a3e556b6b902c088">&#9670;&#160;</a></span>right</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::shared_ptr&lt;<a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a>&gt; range_queries::perSegTree::Node::right = nullptr</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>pointer to the left node </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
+
+</div>
+</div>
+<a id="acc044f787c90b815773726d7fdfdaccf" name="acc044f787c90b815773726d7fdfdaccf"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#acc044f787c90b815773726d7fdfdaccf">&#9670;&#160;</a></span>val</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int64_t range_queries::perSegTree::Node::val = 0</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>pointer to the right node </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00045">45</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
+
+</div>
+</div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>range_queries/<a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html">persistent_seg_tree_lazy_prop.cpp</a></li>
+<li>range_queries/<a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d5/d67/bayes__theorem_8cpp.html b/d5/d67/bayes__theorem_8cpp.html
index 36bc08e87..599fe5627 100644
--- a/d5/d67/bayes__theorem_8cpp.html
+++ b/d5/d67/bayes__theorem_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: probability/bayes_theorem.cpp File Reference</title>
+<title>TheAlgorithms/C++: probability/bayes_theorem.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,7 +135,9 @@ Include dependency graph for bayes_theorem.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/db4/bayes__theorem_8cpp__incl.svg" width="210" height="111"><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">
+</div>
+<p><a href="../../d5/d67/bayes__theorem_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a655bfe51252468d232dc639a340656ba" id="r_a655bfe51252468d232dc639a340656ba"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a655bfe51252468d232dc639a340656ba">bayes_AgivenB</a> (double BgivenA, double A, double B)</td></tr>
@@ -132,6 +151,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Bayes%27_theorem" target="_blank">Bayes' theorem</a> </p>
 <p>Bayes' theorem allows one to find \(P(A|B)\) given \(P(B|A)\) or \(P(B|A)\) given \(P(A|B)\) and \(P(A)\) and \(P(B)\).<br  />
 Note that \(P(A|B)\) is read 'The probability of A given that the event B has occured'. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d5/d67/bayes__theorem_8cpp_source.html">bayes_theorem.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a655bfe51252468d232dc639a340656ba" name="a655bfe51252468d232dc639a340656ba"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a655bfe51252468d232dc639a340656ba">&#9670;&#160;</a></span>bayes_AgivenB()</h2>
@@ -157,6 +178,8 @@ Note that \(P(A|B)\) is read 'The probability of A given that the event B has oc
       </table>
 </div><div class="memdoc">
 <p>returns P(A|B) </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/bayes__theorem_8cpp_source.html#l00014">14</a> of file <a class="el" href="../../d5/d67/bayes__theorem_8cpp_source.html">bayes_theorem.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   14</span>                                                         {</div>
 <div class="line"><span class="lineno">   15</span>    <span class="keywordflow">return</span> (BgivenA * A) / B;</div>
 <div class="line"><span class="lineno">   16</span>}</div>
@@ -187,6 +210,8 @@ Note that \(P(A|B)\) is read 'The probability of A given that the event B has oc
       </table>
 </div><div class="memdoc">
 <p>returns P(B|A) </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/bayes__theorem_8cpp_source.html#l00020">20</a> of file <a class="el" href="../../d5/d67/bayes__theorem_8cpp_source.html">bayes_theorem.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   20</span>                                                         {</div>
 <div class="line"><span class="lineno">   21</span>    <span class="keywordflow">return</span> (AgivenB * B) / A;</div>
 <div class="line"><span class="lineno">   22</span>}</div>
@@ -208,25 +233,20 @@ Note that \(P(A|B)\) is read 'The probability of A given that the event B has oc
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/bayes__theorem_8cpp_source.html#l00026">26</a> of file <a class="el" href="../../d5/d67/bayes__theorem_8cpp_source.html">bayes_theorem.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   26</span>           {</div>
 <div class="line"><span class="lineno">   27</span>    <span class="keywordtype">double</span> A = 0.01;</div>
 <div class="line"><span class="lineno">   28</span>    <span class="keywordtype">double</span> B = 0.1;</div>
 <div class="line"><span class="lineno">   29</span>    <span class="keywordtype">double</span> BgivenA = 0.9;</div>
 <div class="line"><span class="lineno">   30</span>    <span class="keywordtype">double</span> AgivenB = <a class="code hl_function" href="#a655bfe51252468d232dc639a340656ba">bayes_AgivenB</a>(BgivenA, A, B);</div>
-<div class="line"><span class="lineno">   31</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;A given B = &quot;</span> &lt;&lt; AgivenB &lt;&lt; <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">   32</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;B given A = &quot;</span> &lt;&lt; <a class="code hl_function" href="#abb4f22dc05887c2259fdfc55c687598f">bayes_BgivenA</a>(AgivenB, A, B) &lt;&lt; <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">   31</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;A given B = &quot;</span> &lt;&lt; AgivenB &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   32</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;B given A = &quot;</span> &lt;&lt; <a class="code hl_function" href="#abb4f22dc05887c2259fdfc55c687598f">bayes_BgivenA</a>(AgivenB, A, B) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   33</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   34</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="abayes__theorem_8cpp_html_a655bfe51252468d232dc639a340656ba"><div class="ttname"><a href="#a655bfe51252468d232dc639a340656ba">bayes_AgivenB</a></div><div class="ttdeci">double bayes_AgivenB(double BgivenA, double A, double B)</div><div class="ttdef"><b>Definition</b> bayes_theorem.cpp:14</div></div>
-<div class="ttc" id="abayes__theorem_8cpp_html_abb4f22dc05887c2259fdfc55c687598f"><div class="ttname"><a href="#abb4f22dc05887c2259fdfc55c687598f">bayes_BgivenA</a></div><div class="ttdeci">double bayes_BgivenA(double AgivenB, double A, double B)</div><div class="ttdef"><b>Definition</b> bayes_theorem.cpp:20</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><!-- 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="../../d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="220" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="abayes__theorem_8cpp_html_a655bfe51252468d232dc639a340656ba"><div class="ttname"><a href="#a655bfe51252468d232dc639a340656ba">bayes_AgivenB</a></div><div class="ttdeci">double bayes_AgivenB(double BgivenA, double A, double B)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d67/bayes__theorem_8cpp_source.html#l00014">bayes_theorem.cpp:14</a></div></div>
+<div class="ttc" id="abayes__theorem_8cpp_html_abb4f22dc05887c2259fdfc55c687598f"><div class="ttname"><a href="#abb4f22dc05887c2259fdfc55c687598f">bayes_BgivenA</a></div><div class="ttdeci">double bayes_BgivenA(double AgivenB, double A, double B)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d67/bayes__theorem_8cpp_source.html#l00020">bayes_theorem.cpp:20</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 0b3ba520c..000000000
--- a/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,55,80"/>
-<area shape="rect" id="Node000002" href="$d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba" title=" " alt="" coords="103,5,215,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,56,109,34,111,39,56,61"/>
-<area shape="rect" id="Node000003" href="$d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f" title=" " alt="" coords="103,55,215,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,65,87,65,87,70,55,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="123,104,194,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,74,111,96,109,101,54,79"/>
-</map>
diff --git a/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 431257595..000000000
--- a/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-22c36dd5f8761c8e654da10dab22e10c
\ No newline at end of file
diff --git a/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index f65c304c4..000000000
--- a/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="165pt" height="101pt"
- viewBox="0.00 0.00 165.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="157.25,-93.25 73,-93.25 73,-74 157.25,-74 157.25,-93.25"/>
-<text text-anchor="middle" x="115.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">bayes_AgivenB</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.3,-53.58C48.82,-58.09 64.22,-64.11 78.21,-69.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.55,-72.69 87.14,-73.07 79.1,-66.17 76.55,-72.69"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="157.25,-56.25 73,-56.25 73,-37 157.25,-37 157.25,-56.25"/>
-<text text-anchor="middle" x="115.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">bayes_BgivenA</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.3,-46.62C44.3,-46.62 52.73,-46.62 61.41,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.34,-50.13 71.34,-46.63 61.34,-43.13 61.34,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.88,-19.25 88.38,-19.25 88.38,0 141.88,0 141.88,-19.25"/>
-<text text-anchor="middle" x="115.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.3,-39.67C48.82,-35.16 64.22,-29.14 78.21,-23.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.1,-27.08 87.14,-20.18 76.55,-20.56 79.1,-27.08"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index b2c2155ce..000000000
--- a/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="165pt" height="101pt"
- viewBox="0.00 0.00 165.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="157.25,-93.25 73,-93.25 73,-74 157.25,-74 157.25,-93.25"/>
-<text text-anchor="middle" x="115.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">bayes_AgivenB</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.3,-53.58C48.82,-58.09 64.22,-64.11 78.21,-69.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.55,-72.69 87.14,-73.07 79.1,-66.17 76.55,-72.69"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="157.25,-56.25 73,-56.25 73,-37 157.25,-37 157.25,-56.25"/>
-<text text-anchor="middle" x="115.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">bayes_BgivenA</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.3,-46.62C44.3,-46.62 52.73,-46.62 61.41,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.34,-50.13 71.34,-46.63 61.34,-43.13 61.34,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.88,-19.25 88.38,-19.25 88.38,0 141.88,0 141.88,-19.25"/>
-<text text-anchor="middle" x="115.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.3,-39.67C48.82,-35.16 64.22,-29.14 78.21,-23.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.1,-27.08 87.14,-20.18 76.55,-20.56 79.1,-27.08"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d67/bayes__theorem_8cpp_source.html b/d5/d67/bayes__theorem_8cpp_source.html
new file mode 100644
index 000000000..ec4f915d5
--- /dev/null
+++ b/d5/d67/bayes__theorem_8cpp_source.html
@@ -0,0 +1,166 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: probability/bayes_theorem.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/d67/bayes__theorem_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">bayes_theorem.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d5/d67/bayes__theorem_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="foldopen" id="foldopen00014" data-start="{" data-end="}">
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"><a class="line" href="../../d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba">   14</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba">bayes_AgivenB</a>(<span class="keywordtype">double</span> BgivenA, <span class="keywordtype">double</span> A, <span class="keywordtype">double</span> B) {</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="keywordflow">return</span> (BgivenA * A) / B;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>}</div>
+</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
+<div class="foldopen" id="foldopen00020" data-start="{" data-end="}">
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"><a class="line" href="../../d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f">   20</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f">bayes_BgivenA</a>(<span class="keywordtype">double</span> AgivenB, <span class="keywordtype">double</span> A, <span class="keywordtype">double</span> B) {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keywordflow">return</span> (AgivenB * B) / A;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>}</div>
+</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="foldopen" id="foldopen00026" data-start="{" data-end="}">
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"><a class="line" href="../../d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   26</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordtype">double</span> A = 0.01;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="keywordtype">double</span> B = 0.1;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordtype">double</span> BgivenA = 0.9;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordtype">double</span> AgivenB = <a class="code hl_function" href="../../d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba">bayes_AgivenB</a>(BgivenA, A, B);</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;A given B = &quot;</span> &lt;&lt; AgivenB &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;B given A = &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f">bayes_BgivenA</a>(AgivenB, A, B) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>}</div>
+</div>
+<div class="ttc" id="abayes__theorem_8cpp_html_a655bfe51252468d232dc639a340656ba"><div class="ttname"><a href="../../d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba">bayes_AgivenB</a></div><div class="ttdeci">double bayes_AgivenB(double BgivenA, double A, double B)</div><div class="ttdef"><b>Definition</b> <a href="#l00014">bayes_theorem.cpp:14</a></div></div>
+<div class="ttc" id="abayes__theorem_8cpp_html_abb4f22dc05887c2259fdfc55c687598f"><div class="ttname"><a href="../../d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f">bayes_BgivenA</a></div><div class="ttdeci">double bayes_BgivenA(double AgivenB, double A, double B)</div><div class="ttdef"><b>Definition</b> <a href="#l00020">bayes_theorem.cpp:20</a></div></div>
+<div class="ttc" id="abayes__theorem_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00026">bayes_theorem.cpp:26</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_82e494173a87936756866de2fa774307.html">probability</a></li><li class="navelem"><a class="el" href="../../d5/d67/bayes__theorem_8cpp.html">bayes_theorem.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/d67/complex__numbers_8cpp.html b/d5/d67/complex__numbers_8cpp.html
index 9dcc14ba0..504cce2d2 100644
--- a/d5/d67/complex__numbers_8cpp.html
+++ b/d5/d67/complex__numbers_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/complex_numbers.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/complex_numbers.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for complex_numbers.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d3d/complex__numbers_8cpp__incl.svg" width="527" height="111"><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">
+</div>
+<p><a href="../../d5/d67/complex__numbers_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d5a/class_complex.html">Complex</a></td></tr>
@@ -136,7 +155,7 @@ Functions</h2></td></tr>
 <tr class="memitem:a5a73e9d4e68af8cedb95bd0864054b89" id="r_a5a73e9d4e68af8cedb95bd0864054b89"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5a73e9d4e68af8cedb95bd0864054b89">operator==</a> (const <a class="el" href="../../da/d5a/class_complex.html">Complex</a> &amp;a, const <a class="el" href="../../da/d5a/class_complex.html">Complex</a> &amp;b)</td></tr>
 <tr class="memdesc:a5a73e9d4e68af8cedb95bd0864054b89"><td class="mdescLeft">&#160;</td><td class="mdescRight">Operator overload of '==' on <a class="el" href="../../da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> class. Logical Equal overload for our <a class="el" href="../../da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> class.  <br /></td></tr>
 <tr class="separator:a5a73e9d4e68af8cedb95bd0864054b89"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a44d5f25b573e870accdf26fd32b8484d" id="r_a44d5f25b573e870accdf26fd32b8484d"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a44d5f25b573e870accdf26fd32b8484d">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;os, const <a class="el" href="../../da/d5a/class_complex.html">Complex</a> &amp;num)</td></tr>
+<tr class="memitem:a44d5f25b573e870accdf26fd32b8484d" id="r_a44d5f25b573e870accdf26fd32b8484d"><td class="memItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a44d5f25b573e870accdf26fd32b8484d">operator&lt;&lt;</a> (std::ostream &amp;os, const <a class="el" href="../../da/d5a/class_complex.html">Complex</a> &amp;num)</td></tr>
 <tr class="memdesc:a44d5f25b573e870accdf26fd32b8484d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Operator overload of '&lt;&lt;' of ostream for <a class="el" href="../../da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> class. Overloaded insersion operator to accommodate the printing of our complex number in their standard form.  <br /></td></tr>
 <tr class="separator:a44d5f25b573e870accdf26fd32b8484d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a5d4d5b8250b50703de888514c8e7a7a0" id="r_a5d4d5b8250b50703de888514c8e7a7a0"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a> ()</td></tr>
@@ -151,6 +170,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>An implementation of <a class="el" href="../../da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> Number as Objects. </p>
 <dl class="section author"><dt>Author</dt><dd>tjgurwara99</dd></dl>
 <p>A basic implementation of <a class="el" href="../../da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> Number field as a class with operators overloaded to accommodate (mathematical) field operations. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a5d4d5b8250b50703de888514c8e7a7a0" name="a5d4d5b8250b50703de888514c8e7a7a0"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a5d4d5b8250b50703de888514c8e7a7a0">&#9670;&#160;</a></span>get_rand()</h2>
@@ -168,14 +189,10 @@ Functions</h2></td></tr>
 </div><div class="memdoc">
 
 <p>Function to get random numbers to generate our complex numbers for test. </p>
-<div class="fragment"><div class="line"><span class="lineno">  201</span>{ <span class="keywordflow">return</span> (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 100 - 50) / 100.f; }</div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-</div><!-- 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="../../d5/d67/complex__numbers_8cpp_a5d4d5b8250b50703de888514c8e7a7a0_cgraph.svg" width="203" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00201">201</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  201</span>{ <span class="keywordflow">return</span> (std::rand() % 100 - 50) / 100.f; }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -193,17 +210,14 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00268">268</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  268</span>           {</div>
 <div class="line"><span class="lineno">  269</span>    <a class="code hl_function" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
 <div class="line"><span class="lineno">  270</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  271</span>}</div>
-<div class="ttc" id="acomplex__numbers_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> complex_numbers.cpp:206</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="459" height="283"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomplex__numbers_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d67/complex__numbers_8cpp_source.html#l00206">complex_numbers.cpp:206</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a44d5f25b573e870accdf26fd32b8484d" name="a44d5f25b573e870accdf26fd32b8484d"></a>
@@ -213,9 +227,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; operator&lt;&lt; </td>
+          <td class="memname">std::ostream &amp; operator&lt;&lt; </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>os</em></span>, </td>
+          <td class="paramtype">std::ostream &amp;</td>          <td class="paramname"><span class="paramname"><em>os</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -233,6 +247,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00186">186</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  186</span>                                                           {</div>
 <div class="line"><span class="lineno">  187</span>    os &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; num.<a class="code hl_function" href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6">real</a>();</div>
 <div class="line"><span class="lineno">  188</span>    <span class="keywordflow">if</span> (num.<a class="code hl_function" href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">imag</a>() &lt; 0) {</div>
@@ -243,14 +259,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  193</span>    os &lt;&lt; <span class="stringliteral">&quot;i)&quot;</span>;</div>
 <div class="line"><span class="lineno">  194</span>    <span class="keywordflow">return</span> os;</div>
 <div class="line"><span class="lineno">  195</span>}</div>
-<div class="ttc" id="aclass_complex_html_a312e4b19146128408fb06e0150b0faf6"><div class="ttname"><a href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6">Complex::real</a></div><div class="ttdeci">double real() const</div><div class="ttdoc">Member function to get real value of our complex number. Member function (getter) to access the class...</div><div class="ttdef"><b>Definition</b> complex_numbers.cpp:64</div></div>
-<div class="ttc" id="aclass_complex_html_af8aacf982e2e6c142921bc850f6dc974"><div class="ttname"><a href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">Complex::imag</a></div><div class="ttdeci">double imag() const</div><div class="ttdoc">Member function to get imaginary value of our complex number. Member function (getter) to access the ...</div><div class="ttdef"><b>Definition</b> complex_numbers.cpp:70</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph.svg" width="252" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclass_complex_html_a312e4b19146128408fb06e0150b0faf6"><div class="ttname"><a href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6">Complex::real</a></div><div class="ttdeci">double real() const</div><div class="ttdoc">Member function to get real value of our complex number. Member function (getter) to access the class...</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d67/complex__numbers_8cpp_source.html#l00064">complex_numbers.cpp:64</a></div></div>
+<div class="ttc" id="aclass_complex_html_af8aacf982e2e6c142921bc850f6dc974"><div class="ttname"><a href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">Complex::imag</a></div><div class="ttdeci">double imag() const</div><div class="ttdoc">Member function to get imaginary value of our complex number. Member function (getter) to access the ...</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d67/complex__numbers_8cpp_source.html#l00070">complex_numbers.cpp:70</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5a73e9d4e68af8cedb95bd0864054b89" name="a5a73e9d4e68af8cedb95bd0864054b89"></a>
@@ -283,15 +294,12 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>'True' If real and imaginary parts of a and b are same </dd>
 <dd>
 'False' Otherwise. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00175">175</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  175</span>                                                    {</div>
 <div class="line"><span class="lineno">  176</span>    <span class="keywordflow">return</span> a.real() == b.<a class="code hl_function" href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6">real</a>() &amp;&amp; a.imag() == b.<a class="code hl_function" href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">imag</a>();</div>
 <div class="line"><span class="lineno">  177</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d67/complex__numbers_8cpp_a5a73e9d4e68af8cedb95bd0864054b89_cgraph.svg" width="252" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a88ec9ad42717780d6caaff9d3d6977f9" name="a88ec9ad42717780d6caaff9d3d6977f9"></a>
@@ -309,80 +317,70 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Tests Function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00206">206</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  206</span>             {</div>
-<div class="line"><span class="lineno">  207</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>));</div>
+<div class="line"><span class="lineno">  207</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
 <div class="line"><span class="lineno">  208</span>    <span class="keywordtype">double</span> x1 = <a class="code hl_function" href="#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a>(), y1 = <a class="code hl_function" href="#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a>(), x2 = <a class="code hl_function" href="#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a>(), y2 = <a class="code hl_function" href="#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a>();</div>
 <div class="line"><span class="lineno">  209</span>    <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> num1(x1, y1), num2(x2, y2);</div>
-<div class="line"><span class="lineno">  210</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> cnum1(x1, y1), cnum2(x2, y2);</div>
+<div class="line"><span class="lineno">  210</span>    std::complex&lt;double&gt; cnum1(x1, y1), cnum2(x2, y2);</div>
 <div class="line"><span class="lineno">  211</span>    <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
-<div class="line"><span class="lineno">  212</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> expected;</div>
+<div class="line"><span class="lineno">  212</span>    std::complex&lt;double&gt; expected;</div>
 <div class="line"><span class="lineno">  213</span>    <span class="comment">// Test for addition</span></div>
 <div class="line"><span class="lineno">  214</span>    <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = num1 + num2;</div>
 <div class="line"><span class="lineno">  215</span>    expected = cnum1 + cnum2;</div>
 <div class="line"><span class="lineno">  216</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;1 + 1i + 1 + 1i is equal to 2 + 2i but the addition doesn&#39;t &quot;</span></div>
 <div class="line"><span class="lineno">  217</span>                  <span class="stringliteral">&quot;add up \n&quot;</span>,</div>
-<div class="line"><span class="lineno">  218</span>            (<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.real() == expected.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">real</a>() &amp;&amp;</div>
-<div class="line"><span class="lineno">  219</span>             <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.imag() == expected.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">imag</a>())));</div>
-<div class="line"><span class="lineno">  220</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;First test passes.&quot;</span> &lt;&lt; <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>            (<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.real() == expected.real() &amp;&amp;</div>
+<div class="line"><span class="lineno">  219</span>             <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.imag() == expected.imag())));</div>
+<div class="line"><span class="lineno">  220</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;First test passes.&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  221</span>    <span class="comment">// Test for subtraction</span></div>
 <div class="line"><span class="lineno">  222</span>    <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = num1 - num2;</div>
 <div class="line"><span class="lineno">  223</span>    expected = cnum1 - cnum2;</div>
 <div class="line"><span class="lineno">  224</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;1 + 1i - 1 - 1i is equal to 0 but the program says &quot;</span></div>
 <div class="line"><span class="lineno">  225</span>                  <span class="stringliteral">&quot;otherwise. \n&quot;</span>,</div>
-<div class="line"><span class="lineno">  226</span>            (<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.real() == expected.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">real</a>() &amp;&amp;</div>
-<div class="line"><span class="lineno">  227</span>             <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.imag() == expected.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">imag</a>())));</div>
-<div class="line"><span class="lineno">  228</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Second test passes.&quot;</span> &lt;&lt; <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">  226</span>            (<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.real() == expected.real() &amp;&amp;</div>
+<div class="line"><span class="lineno">  227</span>             <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.imag() == expected.imag())));</div>
+<div class="line"><span class="lineno">  228</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Second test passes.&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  229</span>    <span class="comment">// Test for multiplication</span></div>
 <div class="line"><span class="lineno">  230</span>    <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = num1 * num2;</div>
 <div class="line"><span class="lineno">  231</span>    expected = cnum1 * cnum2;</div>
 <div class="line"><span class="lineno">  232</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;(1 + 1i) * (1 + 1i) is equal to 2i but the program says &quot;</span></div>
 <div class="line"><span class="lineno">  233</span>                  <span class="stringliteral">&quot;otherwise. \n&quot;</span>,</div>
-<div class="line"><span class="lineno">  234</span>            (<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.real() == expected.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">real</a>() &amp;&amp;</div>
-<div class="line"><span class="lineno">  235</span>             <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.imag() == expected.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">imag</a>())));</div>
-<div class="line"><span class="lineno">  236</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Third test passes.&quot;</span> &lt;&lt; <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">  234</span>            (<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.real() == expected.real() &amp;&amp;</div>
+<div class="line"><span class="lineno">  235</span>             <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.imag() == expected.imag())));</div>
+<div class="line"><span class="lineno">  236</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Third test passes.&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  237</span>    <span class="comment">// Test for division</span></div>
 <div class="line"><span class="lineno">  238</span>    <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = num1 / num2;</div>
 <div class="line"><span class="lineno">  239</span>    expected = cnum1 / cnum2;</div>
 <div class="line"><span class="lineno">  240</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;(1 + 1i) / (1 + 1i) is equal to 1 but the program says &quot;</span></div>
 <div class="line"><span class="lineno">  241</span>                  <span class="stringliteral">&quot;otherwise.\n&quot;</span>,</div>
-<div class="line"><span class="lineno">  242</span>            (<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.real() == expected.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">real</a>() &amp;&amp;</div>
-<div class="line"><span class="lineno">  243</span>             <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.imag() == expected.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">imag</a>())));</div>
-<div class="line"><span class="lineno">  244</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Fourth test passes.&quot;</span> &lt;&lt; <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">  242</span>            (<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.real() == expected.real() &amp;&amp;</div>
+<div class="line"><span class="lineno">  243</span>             <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.imag() == expected.imag())));</div>
+<div class="line"><span class="lineno">  244</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Fourth test passes.&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  245</span>    <span class="comment">// Test for conjugates</span></div>
 <div class="line"><span class="lineno">  246</span>    <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = ~num1;</div>
 <div class="line"><span class="lineno">  247</span>    expected = std::conj(cnum1);</div>
 <div class="line"><span class="lineno">  248</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;(1 + 1i) has a conjugate which is equal to (1 - 1i) but the &quot;</span></div>
 <div class="line"><span class="lineno">  249</span>                  <span class="stringliteral">&quot;program says otherwise.\n&quot;</span>,</div>
-<div class="line"><span class="lineno">  250</span>            (<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.real() == expected.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">real</a>() &amp;&amp;</div>
-<div class="line"><span class="lineno">  251</span>             <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.imag() == expected.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">imag</a>())));</div>
-<div class="line"><span class="lineno">  252</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Fifth test passes.\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  250</span>            (<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.real() == expected.real() &amp;&amp;</div>
+<div class="line"><span class="lineno">  251</span>             <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.imag() == expected.imag())));</div>
+<div class="line"><span class="lineno">  252</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Fifth test passes.\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  253</span>    <span class="comment">// Test for Argument of our complex number</span></div>
 <div class="line"><span class="lineno">  254</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;(1 + 1i) has argument PI / 4 but the program differs from &quot;</span></div>
 <div class="line"><span class="lineno">  255</span>                  <span class="stringliteral">&quot;the std::complex result.\n&quot;</span>,</div>
 <div class="line"><span class="lineno">  256</span>            (num1.arg() == std::arg(cnum1))));</div>
-<div class="line"><span class="lineno">  257</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Sixth test passes.\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  257</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sixth test passes.\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  258</span>    <span class="comment">// Test for absolute value of our complex number</span></div>
 <div class="line"><span class="lineno">  259</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;(1 + 1i) has absolute value sqrt(2) but the program differs &quot;</span></div>
 <div class="line"><span class="lineno">  260</span>                  <span class="stringliteral">&quot;from the std::complex result. \n&quot;</span>,</div>
 <div class="line"><span class="lineno">  261</span>            (num1.abs() == std::abs(cnum1))));</div>
-<div class="line"><span class="lineno">  262</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Seventh test passes.\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  262</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Seventh test passes.\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  263</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="aclass_complex_html"><div class="ttname"><a href="../../da/d5a/class_complex.html">Complex</a></div><div class="ttdoc">Class Complex to represent complex numbers as a field.</div><div class="ttdef"><b>Definition</b> complex_numbers.cpp:20</div></div>
-<div class="ttc" id="acomplex__numbers_8cpp_html_a5d4d5b8250b50703de888514c8e7a7a0"><div class="ttname"><a href="#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a></div><div class="ttdeci">double get_rand()</div><div class="ttdoc">Function to get random numbers to generate our complex numbers for test.</div><div class="ttdef"><b>Definition</b> complex_numbers.cpp:201</div></div>
-<div class="ttc" id="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></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="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-<div class="ttc" id="aimag_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">std::complex::imag</a></div><div class="ttdeci">T imag(T... args)</div></div>
-<div class="ttc" id="areal_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">std::complex::real</a></div><div class="ttdeci">T real(T... args)</div></div>
-<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg" width="362" height="283"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclass_complex_html"><div class="ttname"><a href="../../da/d5a/class_complex.html">Complex</a></div><div class="ttdoc">Class Complex to represent complex numbers as a field.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d67/complex__numbers_8cpp_source.html#l00020">complex_numbers.cpp:20</a></div></div>
+<div class="ttc" id="acomplex__numbers_8cpp_html_a5d4d5b8250b50703de888514c8e7a7a0"><div class="ttname"><a href="#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a></div><div class="ttdeci">double get_rand()</div><div class="ttdoc">Function to get random numbers to generate our complex numbers for test.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d67/complex__numbers_8cpp_source.html#l00201">complex_numbers.cpp:201</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph.map b/d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph.map
deleted file mode 100644
index 6abc166db..000000000
--- a/d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="operator&lt;&lt;" name="operator&lt;&lt;">
-<area shape="rect" id="Node000001" title="Operator overload of &#39;&lt;&lt;&#39; of ostream for Complex class. Overloaded insersion operator to accommodate ..." alt="" coords="5,31,90,56"/>
-<area shape="rect" id="Node000002" href="$da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974" title="Member function to get imaginary value of our complex number. Member function (getter) to access the ..." alt="" coords="138,5,247,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="89,34,122,28,123,33,90,39"/>
-<area shape="rect" id="Node000003" href="$da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6" title="Member function to get real value of our complex number. Member function (getter) to access the class..." alt="" coords="141,55,244,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="90,48,127,54,126,59,90,53"/>
-</map>
diff --git a/d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph.md5 b/d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph.md5
deleted file mode 100644
index 0a3617de7..000000000
--- a/d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-eba71bf1f050efe6ed924d50aaf86a2a
\ No newline at end of file
diff --git a/d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph.svg b/d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph.svg
deleted file mode 100644
index a9606ed55..000000000
--- a/d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator&lt;&lt; Pages: 1 -->
-<svg width="189pt" height="64pt"
- viewBox="0.00 0.00 189.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Operator overload of &#39;&lt;&lt;&#39; of ostream for Complex class. Overloaded insersion operator to accommodate ...">
-<polygon fill="#999999" stroke="#666666" points="63.25,-37.25 0,-37.25 0,-18 63.25,-18 63.25,-37.25"/>
-<text text-anchor="middle" x="31.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974" target="_top" xlink:title="Member function to get imaginary value of our complex number. Member function (getter) to access the ...">
-<polygon fill="white" stroke="#666666" points="181.25,-56.25 99.25,-56.25 99.25,-37 181.25,-37 181.25,-56.25"/>
-<text text-anchor="middle" x="140.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.47,-33.12C71.08,-34.48 79.44,-35.97 87.74,-37.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87,-40.87 97.45,-39.18 88.22,-33.98 87,-40.87"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6" target="_top" xlink:title="Member function to get real value of our complex number. Member function (getter) to access the class...">
-<polygon fill="white" stroke="#666666" points="178.62,-19.25 101.88,-19.25 101.88,0 178.62,0 178.62,-19.25"/>
-<text text-anchor="middle" x="140.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.47,-22.42C71.95,-20.99 81.36,-19.4 90.59,-17.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.9,-21.34 100.18,-16.22 89.73,-14.43 90.9,-21.34"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph_org.svg b/d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph_org.svg
deleted file mode 100644
index 496d70b4f..000000000
--- a/d5/d67/complex__numbers_8cpp_a44d5f25b573e870accdf26fd32b8484d_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator&lt;&lt; Pages: 1 -->
-<svg width="189pt" height="64pt"
- viewBox="0.00 0.00 189.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Operator overload of &#39;&lt;&lt;&#39; of ostream for Complex class. Overloaded insersion operator to accommodate ...">
-<polygon fill="#999999" stroke="#666666" points="63.25,-37.25 0,-37.25 0,-18 63.25,-18 63.25,-37.25"/>
-<text text-anchor="middle" x="31.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974" target="_top" xlink:title="Member function to get imaginary value of our complex number. Member function (getter) to access the ...">
-<polygon fill="white" stroke="#666666" points="181.25,-56.25 99.25,-56.25 99.25,-37 181.25,-37 181.25,-56.25"/>
-<text text-anchor="middle" x="140.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.47,-33.12C71.08,-34.48 79.44,-35.97 87.74,-37.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87,-40.87 97.45,-39.18 88.22,-33.98 87,-40.87"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6" target="_top" xlink:title="Member function to get real value of our complex number. Member function (getter) to access the class...">
-<polygon fill="white" stroke="#666666" points="178.62,-19.25 101.88,-19.25 101.88,0 178.62,0 178.62,-19.25"/>
-<text text-anchor="middle" x="140.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.47,-22.42C71.95,-20.99 81.36,-19.4 90.59,-17.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.9,-21.34 100.18,-16.22 89.73,-14.43 90.9,-21.34"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d67/complex__numbers_8cpp_a5a73e9d4e68af8cedb95bd0864054b89_cgraph.map b/d5/d67/complex__numbers_8cpp_a5a73e9d4e68af8cedb95bd0864054b89_cgraph.map
deleted file mode 100644
index 565058812..000000000
--- a/d5/d67/complex__numbers_8cpp_a5a73e9d4e68af8cedb95bd0864054b89_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="operator==" name="operator==">
-<area shape="rect" id="Node000001" title="Operator overload of &#39;==&#39; on Complex class. Logical Equal overload for our Complex class." alt="" coords="5,31,90,56"/>
-<area shape="rect" id="Node000002" href="$da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974" title="Member function to get imaginary value of our complex number. Member function (getter) to access the ..." alt="" coords="138,5,247,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="89,34,122,28,123,33,90,39"/>
-<area shape="rect" id="Node000003" href="$da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6" title="Member function to get real value of our complex number. Member function (getter) to access the class..." alt="" coords="141,55,244,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="90,48,127,54,126,59,90,53"/>
-</map>
diff --git a/d5/d67/complex__numbers_8cpp_a5a73e9d4e68af8cedb95bd0864054b89_cgraph.md5 b/d5/d67/complex__numbers_8cpp_a5a73e9d4e68af8cedb95bd0864054b89_cgraph.md5
deleted file mode 100644
index 6748bfd29..000000000
--- a/d5/d67/complex__numbers_8cpp_a5a73e9d4e68af8cedb95bd0864054b89_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fdff4f33221bbb28cae236f0f9638cad
\ No newline at end of file
diff --git a/d5/d67/complex__numbers_8cpp_a5a73e9d4e68af8cedb95bd0864054b89_cgraph.svg b/d5/d67/complex__numbers_8cpp_a5a73e9d4e68af8cedb95bd0864054b89_cgraph.svg
deleted file mode 100644
index dae35b921..000000000
--- a/d5/d67/complex__numbers_8cpp_a5a73e9d4e68af8cedb95bd0864054b89_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator== Pages: 1 -->
-<svg width="189pt" height="64pt"
- viewBox="0.00 0.00 189.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>operator==</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Operator overload of &#39;==&#39; on Complex class. Logical Equal overload for our Complex class.">
-<polygon fill="#999999" stroke="#666666" points="63.25,-37.25 0,-37.25 0,-18 63.25,-18 63.25,-37.25"/>
-<text text-anchor="middle" x="31.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator==</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974" target="_top" xlink:title="Member function to get imaginary value of our complex number. Member function (getter) to access the ...">
-<polygon fill="white" stroke="#666666" points="181.25,-56.25 99.25,-56.25 99.25,-37 181.25,-37 181.25,-56.25"/>
-<text text-anchor="middle" x="140.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.47,-33.12C71.08,-34.48 79.44,-35.97 87.74,-37.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87,-40.87 97.45,-39.18 88.22,-33.98 87,-40.87"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6" target="_top" xlink:title="Member function to get real value of our complex number. Member function (getter) to access the class...">
-<polygon fill="white" stroke="#666666" points="178.62,-19.25 101.88,-19.25 101.88,0 178.62,0 178.62,-19.25"/>
-<text text-anchor="middle" x="140.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.47,-22.42C71.95,-20.99 81.36,-19.4 90.59,-17.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.9,-21.34 100.18,-16.22 89.73,-14.43 90.9,-21.34"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d67/complex__numbers_8cpp_a5a73e9d4e68af8cedb95bd0864054b89_cgraph_org.svg b/d5/d67/complex__numbers_8cpp_a5a73e9d4e68af8cedb95bd0864054b89_cgraph_org.svg
deleted file mode 100644
index 97e3912cc..000000000
--- a/d5/d67/complex__numbers_8cpp_a5a73e9d4e68af8cedb95bd0864054b89_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator== Pages: 1 -->
-<svg width="189pt" height="64pt"
- viewBox="0.00 0.00 189.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>operator==</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Operator overload of &#39;==&#39; on Complex class. Logical Equal overload for our Complex class.">
-<polygon fill="#999999" stroke="#666666" points="63.25,-37.25 0,-37.25 0,-18 63.25,-18 63.25,-37.25"/>
-<text text-anchor="middle" x="31.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator==</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974" target="_top" xlink:title="Member function to get imaginary value of our complex number. Member function (getter) to access the ...">
-<polygon fill="white" stroke="#666666" points="181.25,-56.25 99.25,-56.25 99.25,-37 181.25,-37 181.25,-56.25"/>
-<text text-anchor="middle" x="140.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.47,-33.12C71.08,-34.48 79.44,-35.97 87.74,-37.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87,-40.87 97.45,-39.18 88.22,-33.98 87,-40.87"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6" target="_top" xlink:title="Member function to get real value of our complex number. Member function (getter) to access the class...">
-<polygon fill="white" stroke="#666666" points="178.62,-19.25 101.88,-19.25 101.88,0 178.62,0 178.62,-19.25"/>
-<text text-anchor="middle" x="140.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.47,-22.42C71.95,-20.99 81.36,-19.4 90.59,-17.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.9,-21.34 100.18,-16.22 89.73,-14.43 90.9,-21.34"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d67/complex__numbers_8cpp_a5d4d5b8250b50703de888514c8e7a7a0_cgraph.map b/d5/d67/complex__numbers_8cpp_a5d4d5b8250b50703de888514c8e7a7a0_cgraph.map
deleted file mode 100644
index b7964840b..000000000
--- a/d5/d67/complex__numbers_8cpp_a5d4d5b8250b50703de888514c8e7a7a0_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="get_rand" name="get_rand">
-<area shape="rect" id="Node000001" title="Function to get random numbers to generate our complex numbers for test." alt="" coords="5,5,77,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="125,5,197,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="77,16,109,16,109,21,77,21"/>
-</map>
diff --git a/d5/d67/complex__numbers_8cpp_a5d4d5b8250b50703de888514c8e7a7a0_cgraph.md5 b/d5/d67/complex__numbers_8cpp_a5d4d5b8250b50703de888514c8e7a7a0_cgraph.md5
deleted file mode 100644
index e1496f573..000000000
--- a/d5/d67/complex__numbers_8cpp_a5d4d5b8250b50703de888514c8e7a7a0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-49ccdd4e25c4f26002c9e44d917a5b55
\ No newline at end of file
diff --git a/d5/d67/complex__numbers_8cpp_a5d4d5b8250b50703de888514c8e7a7a0_cgraph.svg b/d5/d67/complex__numbers_8cpp_a5d4d5b8250b50703de888514c8e7a7a0_cgraph.svg
deleted file mode 100644
index f8d2864c0..000000000
--- a/d5/d67/complex__numbers_8cpp_a5d4d5b8250b50703de888514c8e7a7a0_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: get_rand Pages: 1 -->
-<svg width="152pt" height="27pt"
- viewBox="0.00 0.00 151.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>get_rand</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to get random numbers to generate our complex numbers for test.">
-<polygon fill="#999999" stroke="#666666" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
-<text text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_rand</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.75,-19.25 89.5,-19.25 89.5,0 143.75,0 143.75,-19.25"/>
-<text text-anchor="middle" x="116.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.64,-9.62C61.12,-9.62 69.45,-9.62 77.51,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.49,-13.13 87.49,-9.63 77.49,-6.13 77.49,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d67/complex__numbers_8cpp_a5d4d5b8250b50703de888514c8e7a7a0_cgraph_org.svg b/d5/d67/complex__numbers_8cpp_a5d4d5b8250b50703de888514c8e7a7a0_cgraph_org.svg
deleted file mode 100644
index 5ba931906..000000000
--- a/d5/d67/complex__numbers_8cpp_a5d4d5b8250b50703de888514c8e7a7a0_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: get_rand Pages: 1 -->
-<svg width="152pt" height="27pt"
- viewBox="0.00 0.00 151.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>get_rand</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to get random numbers to generate our complex numbers for test.">
-<polygon fill="#999999" stroke="#666666" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
-<text text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_rand</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.75,-19.25 89.5,-19.25 89.5,0 143.75,0 143.75,-19.25"/>
-<text text-anchor="middle" x="116.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.64,-9.62C61.12,-9.62 69.45,-9.62 77.51,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.49,-13.13 87.49,-9.63 77.49,-6.13 77.49,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map b/d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
deleted file mode 100644
index c0e181c4c..000000000
--- a/d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,129,56,155"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="134,5,206,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="36,128,61,85,80,61,102,40,118,30,121,35,105,44,84,65,65,88,40,130"/>
-<area shape="rect" id="Node000003" href="$d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0" title="Function to get random numbers to generate our complex numbers for test." alt="" coords="134,55,206,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="47,127,102,89,119,81,121,86,105,94,50,131"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/imag.html#" title=" " alt="" coords="104,104,236,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="56,135,88,129,89,134,57,140"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/real.html#" title=" " alt="" coords="107,153,232,179"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="57,144,92,150,91,155,56,149"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="130,203,210,228"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="50,153,105,189,117,195,115,200,102,194,47,158"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="134,252,206,278"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="41,154,66,196,84,219,105,239,121,248,118,253,102,243,80,222,61,199,36,157"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="284,55,356,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="206,65,269,65,269,70,206,70"/>
-</map>
diff --git a/d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 b/d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
deleted file mode 100644
index 21694ad42..000000000
--- a/d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a49d01e6663ce744609243a7e69b3192
\ No newline at end of file
diff --git a/d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg b/d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
deleted file mode 100644
index 52ab485ea..000000000
--- a/d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
+++ /dev/null
@@ -1,173 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="271pt" height="212pt"
- viewBox="0.00 0.00 271.25 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-111.25 0,-111.25 0,-92 37.75,-92 37.75,-111.25"/>
-<text text-anchor="middle" x="18.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.12,-204.25 96.62,-204.25 96.62,-185 150.12,-185 150.12,-204.25"/>
-<text text-anchor="middle" x="123.38" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.56,-111.58C32.53,-127.49 50.16,-158.65 73.75,-176.62 77.35,-179.37 81.42,-181.73 85.62,-183.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.21,-186.96 94.79,-187.53 86.88,-180.48 84.21,-186.96"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0" target="_top" xlink:title="Function to get random numbers to generate our complex numbers for test.">
-<polygon fill="white" stroke="#666666" points="150.12,-167.25 96.62,-167.25 96.62,-148 150.12,-148 150.12,-167.25"/>
-<text text-anchor="middle" x="123.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.12,-111.66C42.67,-119.96 58.56,-131.63 73.75,-139.62 77.63,-141.67 81.79,-143.58 85.98,-145.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.35,-148.46 94.94,-148.85 86.9,-141.94 84.35,-148.46"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173,-130.25 73.75,-130.25 73.75,-111 173,-111 173,-130.25"/>
-<text text-anchor="middle" x="123.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.2,-105.02C45.16,-106.31 53.53,-107.86 62.26,-109.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.46,-112.89 71.93,-111.27 62.74,-106.01 61.46,-112.89"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170.38,-93.25 76.38,-93.25 76.38,-74 170.38,-74 170.38,-93.25"/>
-<text text-anchor="middle" x="123.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.2,-98.41C45.82,-97.07 55.11,-95.44 64.72,-93.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.31,-97.2 74.55,-92.02 64.1,-90.31 65.31,-97.2"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="153.12,-56.25 93.62,-56.25 93.62,-37 153.12,-37 153.12,-56.25"/>
-<text text-anchor="middle" x="123.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.59,-91.55C43.16,-83.51 58.84,-72.35 73.75,-64.62 76.63,-63.13 79.67,-61.7 82.76,-60.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.98,-63.62 91.93,-56.61 81.34,-57.14 83.98,-63.62"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.5,-19.25 96.25,-19.25 96.25,0 150.5,0 150.5,-19.25"/>
-<text text-anchor="middle" x="123.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.73,-91.55C32.8,-75.78 50.44,-45.27 73.75,-27.62 77.32,-24.92 81.34,-22.59 85.5,-20.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.65,-23.9 94.56,-16.84 83.98,-17.43 86.65,-23.9"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263.25,-167.25 209,-167.25 209,-148 263.25,-148 263.25,-167.25"/>
-<text text-anchor="middle" x="236.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.62,-157.62C164.59,-157.62 182.01,-157.62 197.4,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="197.17,-161.13 207.17,-157.63 197.17,-154.13 197.17,-161.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg b/d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
deleted file mode 100644
index d450bcf4b..000000000
--- a/d5/d67/complex__numbers_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="271pt" height="212pt"
- viewBox="0.00 0.00 271.25 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-111.25 0,-111.25 0,-92 37.75,-92 37.75,-111.25"/>
-<text text-anchor="middle" x="18.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.12,-204.25 96.62,-204.25 96.62,-185 150.12,-185 150.12,-204.25"/>
-<text text-anchor="middle" x="123.38" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.56,-111.58C32.53,-127.49 50.16,-158.65 73.75,-176.62 77.35,-179.37 81.42,-181.73 85.62,-183.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.21,-186.96 94.79,-187.53 86.88,-180.48 84.21,-186.96"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0" target="_top" xlink:title="Function to get random numbers to generate our complex numbers for test.">
-<polygon fill="white" stroke="#666666" points="150.12,-167.25 96.62,-167.25 96.62,-148 150.12,-148 150.12,-167.25"/>
-<text text-anchor="middle" x="123.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.12,-111.66C42.67,-119.96 58.56,-131.63 73.75,-139.62 77.63,-141.67 81.79,-143.58 85.98,-145.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.35,-148.46 94.94,-148.85 86.9,-141.94 84.35,-148.46"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173,-130.25 73.75,-130.25 73.75,-111 173,-111 173,-130.25"/>
-<text text-anchor="middle" x="123.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.2,-105.02C45.16,-106.31 53.53,-107.86 62.26,-109.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.46,-112.89 71.93,-111.27 62.74,-106.01 61.46,-112.89"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170.38,-93.25 76.38,-93.25 76.38,-74 170.38,-74 170.38,-93.25"/>
-<text text-anchor="middle" x="123.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.2,-98.41C45.82,-97.07 55.11,-95.44 64.72,-93.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.31,-97.2 74.55,-92.02 64.1,-90.31 65.31,-97.2"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="153.12,-56.25 93.62,-56.25 93.62,-37 153.12,-37 153.12,-56.25"/>
-<text text-anchor="middle" x="123.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.59,-91.55C43.16,-83.51 58.84,-72.35 73.75,-64.62 76.63,-63.13 79.67,-61.7 82.76,-60.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.98,-63.62 91.93,-56.61 81.34,-57.14 83.98,-63.62"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.5,-19.25 96.25,-19.25 96.25,0 150.5,0 150.5,-19.25"/>
-<text text-anchor="middle" x="123.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.73,-91.55C32.8,-75.78 50.44,-45.27 73.75,-27.62 77.32,-24.92 81.34,-22.59 85.5,-20.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.65,-23.9 94.56,-16.84 83.98,-17.43 86.65,-23.9"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263.25,-167.25 209,-167.25 209,-148 263.25,-148 263.25,-167.25"/>
-<text text-anchor="middle" x="236.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.62,-157.62C164.59,-157.62 182.01,-157.62 197.4,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="197.17,-161.13 207.17,-157.63 197.17,-154.13 197.17,-161.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 22f4b3e39..000000000
--- a/d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,129,55,155"/>
-<area shape="rect" id="Node000002" href="$d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" title=" " alt="" coords="103,129,153,155"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,140,88,140,88,145,55,145"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="232,5,303,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="133,128,158,85,177,61,199,40,215,30,218,35,203,44,181,65,163,88,138,130"/>
-<area shape="rect" id="Node000004" href="$d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0" title="Function to get random numbers to generate our complex numbers for test." alt="" coords="232,55,303,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="144,127,200,89,216,81,218,86,202,94,147,131"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/imag.html#" title=" " alt="" coords="201,104,333,130"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="153,135,185,129,186,134,154,140"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/real.html#" title=" " alt="" coords="204,153,330,179"/>
-<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="154,144,189,150,188,155,153,149"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="228,203,307,228"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="148,153,202,189,214,195,212,200,200,194,145,158"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="231,252,303,278"/>
-<area shape="poly" id="edge8_Node000002_Node000009" title=" " alt="" coords="138,154,163,196,181,219,203,239,218,248,215,253,199,243,177,222,159,199,133,157"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="381,55,454,80"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="303,65,366,65,366,70,303,70"/>
-</map>
diff --git a/d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 1ec834f5c..000000000
--- a/d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-25e877a4d89474b28fedef1fbc719dc6
\ No newline at end of file
diff --git a/d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index c4e6a1b53..000000000
--- a/d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,191 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="344pt" height="212pt"
- viewBox="0.00 0.00 344.25 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-111.25 0,-111.25 0,-92 37,-92 37,-111.25"/>
-<text text-anchor="middle" x="18.5" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-111.25 73,-111.25 73,-92 110.75,-92 110.75,-111.25"/>
-<text text-anchor="middle" x="91.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-101.62C44.55,-101.62 53.37,-101.62 61.69,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-105.13 71.43,-101.63 61.43,-98.13 61.43,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.12,-204.25 169.62,-204.25 169.62,-185 223.12,-185 223.12,-204.25"/>
-<text text-anchor="middle" x="196.38" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.56,-111.58C105.53,-127.49 123.16,-158.65 146.75,-176.62 150.35,-179.37 154.42,-181.73 158.62,-183.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.21,-186.96 167.79,-187.53 159.88,-180.48 157.21,-186.96"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0" target="_top" xlink:title="Function to get random numbers to generate our complex numbers for test.">
-<polygon fill="white" stroke="#666666" points="223.12,-167.25 169.62,-167.25 169.62,-148 223.12,-148 223.12,-167.25"/>
-<text text-anchor="middle" x="196.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.12,-111.66C115.67,-119.96 131.56,-131.63 146.75,-139.62 150.63,-141.67 154.79,-143.58 158.98,-145.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.35,-148.46 167.94,-148.85 159.9,-141.94 157.35,-148.46"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246,-130.25 146.75,-130.25 146.75,-111 246,-111 246,-130.25"/>
-<text text-anchor="middle" x="196.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.2,-105.02C118.16,-106.31 126.53,-107.86 135.26,-109.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.46,-112.89 144.93,-111.27 135.74,-106.01 134.46,-112.89"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.38,-93.25 149.38,-93.25 149.38,-74 243.38,-74 243.38,-93.25"/>
-<text text-anchor="middle" x="196.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.2,-98.41C118.82,-97.07 128.11,-95.44 137.72,-93.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.31,-97.2 147.55,-92.02 137.1,-90.31 138.31,-97.2"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.12,-56.25 166.62,-56.25 166.62,-37 226.12,-37 226.12,-56.25"/>
-<text text-anchor="middle" x="196.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.59,-91.55C116.16,-83.51 131.84,-72.35 146.75,-64.62 149.63,-63.13 152.67,-61.7 155.76,-60.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.98,-63.62 164.93,-56.61 154.34,-57.14 156.98,-63.62"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.5,-19.25 169.25,-19.25 169.25,0 223.5,0 223.5,-19.25"/>
-<text text-anchor="middle" x="196.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.73,-91.55C105.8,-75.78 123.44,-45.27 146.75,-27.62 150.32,-24.92 154.34,-22.59 158.5,-20.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.65,-23.9 167.56,-16.84 156.98,-17.43 159.65,-23.9"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="336.25,-167.25 282,-167.25 282,-148 336.25,-148 336.25,-167.25"/>
-<text text-anchor="middle" x="309.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M223.62,-157.62C237.59,-157.62 255.01,-157.62 270.4,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="270.17,-161.13 280.17,-157.63 270.17,-154.13 270.17,-161.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 9aa46ef8f..000000000
--- a/d5/d67/complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,165 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="344pt" height="212pt"
- viewBox="0.00 0.00 344.25 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-111.25 0,-111.25 0,-92 37,-92 37,-111.25"/>
-<text text-anchor="middle" x="18.5" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-111.25 73,-111.25 73,-92 110.75,-92 110.75,-111.25"/>
-<text text-anchor="middle" x="91.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-101.62C44.55,-101.62 53.37,-101.62 61.69,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-105.13 71.43,-101.63 61.43,-98.13 61.43,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.12,-204.25 169.62,-204.25 169.62,-185 223.12,-185 223.12,-204.25"/>
-<text text-anchor="middle" x="196.38" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.56,-111.58C105.53,-127.49 123.16,-158.65 146.75,-176.62 150.35,-179.37 154.42,-181.73 158.62,-183.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.21,-186.96 167.79,-187.53 159.88,-180.48 157.21,-186.96"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0" target="_top" xlink:title="Function to get random numbers to generate our complex numbers for test.">
-<polygon fill="white" stroke="#666666" points="223.12,-167.25 169.62,-167.25 169.62,-148 223.12,-148 223.12,-167.25"/>
-<text text-anchor="middle" x="196.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.12,-111.66C115.67,-119.96 131.56,-131.63 146.75,-139.62 150.63,-141.67 154.79,-143.58 158.98,-145.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.35,-148.46 167.94,-148.85 159.9,-141.94 157.35,-148.46"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246,-130.25 146.75,-130.25 146.75,-111 246,-111 246,-130.25"/>
-<text text-anchor="middle" x="196.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.2,-105.02C118.16,-106.31 126.53,-107.86 135.26,-109.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.46,-112.89 144.93,-111.27 135.74,-106.01 134.46,-112.89"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.38,-93.25 149.38,-93.25 149.38,-74 243.38,-74 243.38,-93.25"/>
-<text text-anchor="middle" x="196.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.2,-98.41C118.82,-97.07 128.11,-95.44 137.72,-93.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.31,-97.2 147.55,-92.02 137.1,-90.31 138.31,-97.2"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.12,-56.25 166.62,-56.25 166.62,-37 226.12,-37 226.12,-56.25"/>
-<text text-anchor="middle" x="196.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.59,-91.55C116.16,-83.51 131.84,-72.35 146.75,-64.62 149.63,-63.13 152.67,-61.7 155.76,-60.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.98,-63.62 164.93,-56.61 154.34,-57.14 156.98,-63.62"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.5,-19.25 169.25,-19.25 169.25,0 223.5,0 223.5,-19.25"/>
-<text text-anchor="middle" x="196.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.73,-91.55C105.8,-75.78 123.44,-45.27 146.75,-27.62 150.32,-24.92 154.34,-22.59 158.5,-20.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.65,-23.9 167.56,-16.84 156.98,-17.43 159.65,-23.9"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="336.25,-167.25 282,-167.25 282,-148 336.25,-148 336.25,-167.25"/>
-<text text-anchor="middle" x="309.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M223.62,-157.62C237.59,-157.62 255.01,-157.62 270.4,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="270.17,-161.13 280.17,-157.63 270.17,-154.13 270.17,-161.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d67/complex__numbers_8cpp_source.html b/d5/d67/complex__numbers_8cpp_source.html
new file mode 100644
index 000000000..ec25004e7
--- /dev/null
+++ b/d5/d67/complex__numbers_8cpp_source.html
@@ -0,0 +1,340 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/complex_numbers.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/d67/complex__numbers_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">complex_numbers.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d5/d67/complex__numbers_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;complex&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;stdexcept&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="foldopen" id="foldopen00020" data-start="{" data-end="};">
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"><a class="line" href="../../da/d5a/class_complex.html">   20</a></span><span class="keyword">class </span><a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="comment">// The real value of the complex number</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    <span class="keywordtype">double</span> re;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    <span class="comment">// The imaginary value of the complex number</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="keywordtype">double</span> im;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00043" data-start="{" data-end="}">
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="../../da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867">   43</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867">Complex</a>(<span class="keywordtype">double</span> x = 0.f, <span class="keywordtype">double</span> y = 0.f, <span class="keywordtype">bool</span> is_polar = <span class="keyword">false</span>) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="keywordflow">if</span> (!is_polar) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>            re = x;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            im = y;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        re = x * std::cos(y);</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        im = x * std::sin(y);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    }</div>
+</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../da/d5a/class_complex.html#a466cd7b664cc6a864937ceb3dead1323">   58</a></span>    <a class="code hl_function" href="../../da/d5a/class_complex.html#a466cd7b664cc6a864937ceb3dead1323">Complex</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> &amp;other) : re(other.<a class="code hl_function" href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6">real</a>()), im(other.<a class="code hl_function" href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">imag</a>()) {}</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6">   64</a></span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6">real</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> this-&gt;re; }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"><a class="line" href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">   70</a></span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">imag</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> this-&gt;im; }</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="foldopen" id="foldopen00079" data-start="{" data-end="}">
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="../../da/d5a/class_complex.html#ae5b51b749ea4964104b9527af9d8f556">   79</a></span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../da/d5a/class_complex.html#ae5b51b749ea4964104b9527af9d8f556">abs</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="keywordflow">return</span> std::sqrt(this-&gt;re * this-&gt;re + this-&gt;im * this-&gt;im);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    }</div>
+</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"><a class="line" href="../../da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41">   87</a></span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41">arg</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> std::atan2(this-&gt;im, this-&gt;re); }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="foldopen" id="foldopen00095" data-start="{" data-end="}">
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="../../da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c">   95</a></span>    <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> <a class="code hl_function" href="../../da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c">operator+</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> &amp;other) {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> result(this-&gt;re + other.re, this-&gt;im + other.im);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    }</div>
+</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="foldopen" id="foldopen00106" data-start="{" data-end="}">
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"><a class="line" href="../../da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da">  106</a></span>    <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> <a class="code hl_function" href="../../da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da">operator-</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> &amp;other) {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> result(this-&gt;re - other.re, this-&gt;im - other.im);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    }</div>
+</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span> </div>
+<div class="foldopen" id="foldopen00117" data-start="{" data-end="}">
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"><a class="line" href="../../da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d">  117</a></span>    <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> <a class="code hl_function" href="../../da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d">operator*</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> &amp;other) {</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> result(this-&gt;re * other.re - this-&gt;im * other.im,</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>                       this-&gt;re * other.im + this-&gt;im * other.re);</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    }</div>
+</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span> </div>
+<div class="foldopen" id="foldopen00130" data-start="{" data-end="}">
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"><a class="line" href="../../da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d">  130</a></span>    <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> <a class="code hl_function" href="../../da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d">operator~</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> result(this-&gt;re, -(this-&gt;im));</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    }</div>
+</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="foldopen" id="foldopen00142" data-start="{" data-end="}">
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"><a class="line" href="../../da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90">  142</a></span>    <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> <a class="code hl_function" href="../../da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90">operator/</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> &amp;other) {</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> result = *<span class="keyword">this</span> * ~other;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        <span class="keywordtype">double</span> denominator =</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>            other.<a class="code hl_function" href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6">real</a>() * other.<a class="code hl_function" href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6">real</a>() + other.<a class="code hl_function" href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">imag</a>() * other.<a class="code hl_function" href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">imag</a>();</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        <span class="keywordflow">if</span> (denominator != 0) {</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>            result = <a class="code hl_function" href="../../da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867">Complex</a>(result.real() / denominator,</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>                             result.imag() / denominator);</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>            <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>            <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Undefined Value&quot;</span>);</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>        }</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    }</div>
+</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span> </div>
+<div class="foldopen" id="foldopen00160" data-start="{" data-end="}">
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"><a class="line" href="../../da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac">  160</a></span>    <span class="keyword">const</span> <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> &amp;<a class="code hl_function" href="../../da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac">operator=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> &amp;other) {</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        this-&gt;re = other.<a class="code hl_function" href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6">real</a>();</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        this-&gt;im = other.<a class="code hl_function" href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">imag</a>();</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    }</div>
+</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>};</div>
+</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span> </div>
+<div class="foldopen" id="foldopen00175" data-start="{" data-end="}">
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"><a class="line" href="../../d5/d67/complex__numbers_8cpp.html#a5a73e9d4e68af8cedb95bd0864054b89">  175</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d5/d67/complex__numbers_8cpp.html#a5a73e9d4e68af8cedb95bd0864054b89">operator==</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> &amp;a, <span class="keyword">const</span> <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> &amp;b) {</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    <span class="keywordflow">return</span> a.real() == b.<a class="code hl_function" href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6">real</a>() &amp;&amp; a.imag() == b.<a class="code hl_function" href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">imag</a>();</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>}</div>
+</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="foldopen" id="foldopen00186" data-start="{" data-end="}">
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"><a class="line" href="../../d5/d67/complex__numbers_8cpp.html#a44d5f25b573e870accdf26fd32b8484d">  186</a></span>std::ostream &amp;<a class="code hl_function" href="../../d5/d67/complex__numbers_8cpp.html#a44d5f25b573e870accdf26fd32b8484d">operator&lt;&lt;</a>(std::ostream &amp;os, <span class="keyword">const</span> <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> &amp;num) {</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    os &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; num.<a class="code hl_function" href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6">real</a>();</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    <span class="keywordflow">if</span> (num.<a class="code hl_function" href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">imag</a>() &lt; 0) {</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        os &lt;&lt; <span class="stringliteral">&quot; - &quot;</span> &lt;&lt; -num.<a class="code hl_function" href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">imag</a>();</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>        os &lt;&lt; <span class="stringliteral">&quot; + &quot;</span> &lt;&lt; num.<a class="code hl_function" href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">imag</a>();</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    }</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    os &lt;&lt; <span class="stringliteral">&quot;i)&quot;</span>;</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    <span class="keywordflow">return</span> os;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>}</div>
+</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span> </div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"><a class="line" href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">  201</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a>() { <span class="keywordflow">return</span> (std::rand() % 100 - 50) / 100.f; }</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span> </div>
+<div class="foldopen" id="foldopen00206" data-start="{" data-end="}">
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"><a class="line" href="../../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">  206</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>() {</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    <span class="keywordtype">double</span> x1 = <a class="code hl_function" href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a>(), y1 = <a class="code hl_function" href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a>(), x2 = <a class="code hl_function" href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a>(), y2 = <a class="code hl_function" href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a>();</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> num1(x1, y1), num2(x2, y2);</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    std::complex&lt;double&gt; cnum1(x1, y1), cnum2(x2, y2);</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> result;</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    std::complex&lt;double&gt; expected;</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    <span class="comment">// Test for addition</span></div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    result = num1 + num2;</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    expected = cnum1 + cnum2;</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;1 + 1i + 1 + 1i is equal to 2 + 2i but the addition doesn&#39;t &quot;</span></div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>                  <span class="stringliteral">&quot;add up \n&quot;</span>,</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>            (result.real() == expected.real() &amp;&amp;</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>             result.imag() == expected.imag())));</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;First test passes.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    <span class="comment">// Test for subtraction</span></div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    result = num1 - num2;</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    expected = cnum1 - cnum2;</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;1 + 1i - 1 - 1i is equal to 0 but the program says &quot;</span></div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>                  <span class="stringliteral">&quot;otherwise. \n&quot;</span>,</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>            (result.real() == expected.real() &amp;&amp;</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>             result.imag() == expected.imag())));</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Second test passes.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    <span class="comment">// Test for multiplication</span></div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    result = num1 * num2;</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    expected = cnum1 * cnum2;</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;(1 + 1i) * (1 + 1i) is equal to 2i but the program says &quot;</span></div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>                  <span class="stringliteral">&quot;otherwise. \n&quot;</span>,</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>            (result.real() == expected.real() &amp;&amp;</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>             result.imag() == expected.imag())));</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Third test passes.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    <span class="comment">// Test for division</span></div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    result = num1 / num2;</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    expected = cnum1 / cnum2;</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;(1 + 1i) / (1 + 1i) is equal to 1 but the program says &quot;</span></div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>                  <span class="stringliteral">&quot;otherwise.\n&quot;</span>,</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>            (result.real() == expected.real() &amp;&amp;</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>             result.imag() == expected.imag())));</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Fourth test passes.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    <span class="comment">// Test for conjugates</span></div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    result = ~num1;</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    expected = std::conj(cnum1);</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;(1 + 1i) has a conjugate which is equal to (1 - 1i) but the &quot;</span></div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>                  <span class="stringliteral">&quot;program says otherwise.\n&quot;</span>,</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>            (result.real() == expected.real() &amp;&amp;</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>             result.imag() == expected.imag())));</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Fifth test passes.\n&quot;</span>;</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    <span class="comment">// Test for Argument of our complex number</span></div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;(1 + 1i) has argument PI / 4 but the program differs from &quot;</span></div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>                  <span class="stringliteral">&quot;the std::complex result.\n&quot;</span>,</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>            (num1.arg() == std::arg(cnum1))));</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sixth test passes.\n&quot;</span>;</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    <span class="comment">// Test for absolute value of our complex number</span></div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;(1 + 1i) has absolute value sqrt(2) but the program differs &quot;</span></div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>                  <span class="stringliteral">&quot;from the std::complex result. \n&quot;</span>,</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>            (num1.abs() == std::abs(cnum1))));</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Seventh test passes.\n&quot;</span>;</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>}</div>
+</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span> </div>
+<div class="foldopen" id="foldopen00268" data-start="{" data-end="}">
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"><a class="line" href="../../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  268</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>    <a class="code hl_function" href="../../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>}</div>
+</div>
+<div class="ttc" id="aclass_complex_html"><div class="ttname"><a href="../../da/d5a/class_complex.html">Complex</a></div><div class="ttdoc">Class Complex to represent complex numbers as a field.</div><div class="ttdef"><b>Definition</b> <a href="#l00020">complex_numbers.cpp:20</a></div></div>
+<div class="ttc" id="aclass_complex_html_a312e4b19146128408fb06e0150b0faf6"><div class="ttname"><a href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6">Complex::real</a></div><div class="ttdeci">double real() const</div><div class="ttdoc">Member function to get real value of our complex number. Member function (getter) to access the class...</div><div class="ttdef"><b>Definition</b> <a href="#l00064">complex_numbers.cpp:64</a></div></div>
+<div class="ttc" id="aclass_complex_html_a36739619a07b5478bcd8a28ad2f8b7da"><div class="ttname"><a href="../../da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da">Complex::operator-</a></div><div class="ttdeci">Complex operator-(const Complex &amp;other)</div><div class="ttdoc">Operator overload of '-' on Complex class. Operator overload to be able to subtract two complex numbe...</div><div class="ttdef"><b>Definition</b> <a href="#l00106">complex_numbers.cpp:106</a></div></div>
+<div class="ttc" id="aclass_complex_html_a3cfc522c782726f49ee20af17b77f867"><div class="ttname"><a href="../../da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867">Complex::Complex</a></div><div class="ttdeci">Complex(double x=0.f, double y=0.f, bool is_polar=false)</div><div class="ttdoc">Complex Constructor which initialises our complex number.</div><div class="ttdef"><b>Definition</b> <a href="#l00043">complex_numbers.cpp:43</a></div></div>
+<div class="ttc" id="aclass_complex_html_a466cd7b664cc6a864937ceb3dead1323"><div class="ttname"><a href="../../da/d5a/class_complex.html#a466cd7b664cc6a864937ceb3dead1323">Complex::Complex</a></div><div class="ttdeci">Complex(const Complex &amp;other)</div><div class="ttdoc">Copy Constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00058">complex_numbers.cpp:58</a></div></div>
+<div class="ttc" id="aclass_complex_html_a4ac9f529d54cacf2969f2c7179b4c4ac"><div class="ttname"><a href="../../da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac">Complex::operator=</a></div><div class="ttdeci">const Complex &amp; operator=(const Complex &amp;other)</div><div class="ttdoc">Operator overload of '=' on Complex class. Operator overload to be able to copy RHS instance of Compl...</div><div class="ttdef"><b>Definition</b> <a href="#l00160">complex_numbers.cpp:160</a></div></div>
+<div class="ttc" id="aclass_complex_html_a820afcbb330df716577459d7a3aa3a1c"><div class="ttname"><a href="../../da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c">Complex::operator+</a></div><div class="ttdeci">Complex operator+(const Complex &amp;other)</div><div class="ttdoc">Operator overload of '+' on Complex class. Operator overload to be able to add two complex numbers.</div><div class="ttdef"><b>Definition</b> <a href="#l00095">complex_numbers.cpp:95</a></div></div>
+<div class="ttc" id="aclass_complex_html_a8d5427f6c42c15283031d73e1418c59d"><div class="ttname"><a href="../../da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d">Complex::operator~</a></div><div class="ttdeci">Complex operator~() const</div><div class="ttdoc">Operator overload of '~' on Complex class. Operator overload of the BITWISE NOT which gives us the co...</div><div class="ttdef"><b>Definition</b> <a href="#l00130">complex_numbers.cpp:130</a></div></div>
+<div class="ttc" id="aclass_complex_html_aa9b4a7d6083ca7040ddd4fe93db5c19d"><div class="ttname"><a href="../../da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d">Complex::operator*</a></div><div class="ttdeci">Complex operator*(const Complex &amp;other)</div><div class="ttdoc">Operator overload of '*' on Complex class. Operator overload to be able to multiple two complex numbe...</div><div class="ttdef"><b>Definition</b> <a href="#l00117">complex_numbers.cpp:117</a></div></div>
+<div class="ttc" id="aclass_complex_html_ac38437c10eb798f176c384a695171b90"><div class="ttname"><a href="../../da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90">Complex::operator/</a></div><div class="ttdeci">Complex operator/(const Complex &amp;other)</div><div class="ttdoc">Operator overload of '/' on Complex class. Operator overload to be able to divide two complex numbers...</div><div class="ttdef"><b>Definition</b> <a href="#l00142">complex_numbers.cpp:142</a></div></div>
+<div class="ttc" id="aclass_complex_html_ae1e03712837450549e0c9b4017533a41"><div class="ttname"><a href="../../da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41">Complex::arg</a></div><div class="ttdeci">double arg() const</div><div class="ttdoc">Member function to give the argument of our complex number.</div><div class="ttdef"><b>Definition</b> <a href="#l00087">complex_numbers.cpp:87</a></div></div>
+<div class="ttc" id="aclass_complex_html_ae5b51b749ea4964104b9527af9d8f556"><div class="ttname"><a href="../../da/d5a/class_complex.html#ae5b51b749ea4964104b9527af9d8f556">Complex::abs</a></div><div class="ttdeci">double abs() const</div><div class="ttdoc">Member function to give the modulus of our complex number. Member function to which gives the absolut...</div><div class="ttdef"><b>Definition</b> <a href="#l00079">complex_numbers.cpp:79</a></div></div>
+<div class="ttc" id="aclass_complex_html_af8aacf982e2e6c142921bc850f6dc974"><div class="ttname"><a href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">Complex::imag</a></div><div class="ttdeci">double imag() const</div><div class="ttdoc">Member function to get imaginary value of our complex number. Member function (getter) to access the ...</div><div class="ttdef"><b>Definition</b> <a href="#l00070">complex_numbers.cpp:70</a></div></div>
+<div class="ttc" id="acomplex__numbers_8cpp_html_a44d5f25b573e870accdf26fd32b8484d"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#a44d5f25b573e870accdf26fd32b8484d">operator&lt;&lt;</a></div><div class="ttdeci">std::ostream &amp; operator&lt;&lt;(std::ostream &amp;os, const Complex &amp;num)</div><div class="ttdoc">Operator overload of '&lt;&lt;' of ostream for Complex class. Overloaded insersion operator to accommodate ...</div><div class="ttdef"><b>Definition</b> <a href="#l00186">complex_numbers.cpp:186</a></div></div>
+<div class="ttc" id="acomplex__numbers_8cpp_html_a5a73e9d4e68af8cedb95bd0864054b89"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#a5a73e9d4e68af8cedb95bd0864054b89">operator==</a></div><div class="ttdeci">bool operator==(const Complex &amp;a, const Complex &amp;b)</div><div class="ttdoc">Operator overload of '==' on Complex class. Logical Equal overload for our Complex class.</div><div class="ttdef"><b>Definition</b> <a href="#l00175">complex_numbers.cpp:175</a></div></div>
+<div class="ttc" id="acomplex__numbers_8cpp_html_a5d4d5b8250b50703de888514c8e7a7a0"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">get_rand</a></div><div class="ttdeci">double get_rand()</div><div class="ttdoc">Function to get random numbers to generate our complex numbers for test.</div><div class="ttdef"><b>Definition</b> <a href="#l00201">complex_numbers.cpp:201</a></div></div>
+<div class="ttc" id="acomplex__numbers_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="#l00206">complex_numbers.cpp:206</a></div></div>
+<div class="ttc" id="acomplex__numbers_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00268">complex_numbers.cpp:268</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d5/d67/complex__numbers_8cpp.html">complex_numbers.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/d6e/classcatalan__numbers__coll__graph.map b/d5/d6e/classcatalan__numbers__coll__graph.map
index 0cb63e331..b5271c766 100644
--- a/d5/d6e/classcatalan__numbers__coll__graph.map
+++ b/d5/d6e/classcatalan__numbers__coll__graph.map
@@ -1,7 +1,5 @@
 <map id="catalan_numbers" name="catalan_numbers">
-<area shape="rect" id="Node000001" title="computes and caches Catalan numbers" alt="" coords="35,183,155,208"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="5,94,185,120"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="98,135,98,182,92,182,92,135"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="48,5,142,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="98,47,98,94,92,94,92,47"/>
+<area shape="rect" id="Node000001" title="computes and caches Catalan numbers" alt="" coords="8,109,129,135"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,5,132,46"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="71,61,71,109,66,109,66,61"/>
 </map>
diff --git a/d5/d6e/classcatalan__numbers__coll__graph.md5 b/d5/d6e/classcatalan__numbers__coll__graph.md5
index 950c4b5a2..131d01e51 100644
--- a/d5/d6e/classcatalan__numbers__coll__graph.md5
+++ b/d5/d6e/classcatalan__numbers__coll__graph.md5
@@ -1 +1 @@
-3ccad1fd2e73dc49c7f2b6cb324f18db
\ No newline at end of file
+aa97625a993f74af9da17cfc12c93640
\ No newline at end of file
diff --git a/d5/d6e/classcatalan__numbers__coll__graph.svg b/d5/d6e/classcatalan__numbers__coll__graph.svg
index e5451199d..259d11f0c 100644
--- a/d5/d6e/classcatalan__numbers__coll__graph.svg
+++ b/d5/d6e/classcatalan__numbers__coll__graph.svg
@@ -4,8 +4,8 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: catalan_numbers Pages: 1 -->
-<svg width="143pt" height="160pt"
- viewBox="0.00 0.00 142.50 160.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="103pt" height="105pt"
+ viewBox="0.00 0.00 102.75 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
 <svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
@@ -17,23 +17,24 @@
 ]]></style>
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
 <svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 156.25)">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 101)">
 <title>catalan_numbers</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="computes and caches Catalan numbers">
-<polygon fill="#999999" stroke="#666666" points="112.38,-19.25 22.12,-19.25 22.12,0 112.38,0 112.38,-19.25"/>
-<text text-anchor="middle" x="67.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">catalan_numbers</text>
+<polygon fill="#999999" stroke="#666666" points="92.5,-19.25 2.25,-19.25 2.25,0 92.5,0 92.5,-19.25"/>
+<text text-anchor="middle" x="47.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">catalan_numbers</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="134.5,-85.75 0,-85.75 0,-66.5 134.5,-66.5 134.5,-85.75"/>
-<text text-anchor="middle" x="67.25" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::uint64_t &gt;</text>
+<g id="a_Node000002"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="94.75,-97 0,-97 0,-66.5 94.75,-66.5 94.75,-97"/>
+<text text-anchor="start" x="8" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; value</text>
+<text text-anchor="middle" x="47.38" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">_type &gt;</text>
 </a>
 </g>
 </g>
@@ -41,30 +42,11 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M67.25,-54.65C67.25,-42.82 67.25,-28.54 67.25,-19.52"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="63.75,-54.64 67.25,-64.64 70.75,-54.64 63.75,-54.64"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M47.38,-54.98C47.38,-42.48 47.38,-28.27 47.38,-19.38"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="43.88,-54.71 47.38,-64.71 50.88,-54.71 43.88,-54.71"/>
 </a>
 </g>
-<text text-anchor="middle" x="83" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> known</text>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="102.25,-152.25 32.25,-152.25 32.25,-133 102.25,-133 102.25,-152.25"/>
-<text text-anchor="middle" x="67.25" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint64_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M67.25,-121.15C67.25,-109.32 67.25,-95.04 67.25,-86.02"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="63.75,-121.14 67.25,-131.14 70.75,-121.14 63.75,-121.14"/>
-</a>
-</g>
-<text text-anchor="middle" x="88.62" y="-105.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="63.12" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> known</text>
 </g>
 </g>
 </svg>
diff --git a/d5/d6e/classcatalan__numbers__coll__graph_org.svg b/d5/d6e/classcatalan__numbers__coll__graph_org.svg
index 6f920e1b5..3cc81c81d 100644
--- a/d5/d6e/classcatalan__numbers__coll__graph_org.svg
+++ b/d5/d6e/classcatalan__numbers__coll__graph_org.svg
@@ -4,25 +4,26 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: catalan_numbers Pages: 1 -->
-<svg width="143pt" height="160pt"
- viewBox="0.00 0.00 142.50 160.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 156.25)">
+<svg width="103pt" height="105pt"
+ viewBox="0.00 0.00 102.75 105.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 101)">
 <title>catalan_numbers</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="computes and caches Catalan numbers">
-<polygon fill="#999999" stroke="#666666" points="112.38,-19.25 22.12,-19.25 22.12,0 112.38,0 112.38,-19.25"/>
-<text text-anchor="middle" x="67.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">catalan_numbers</text>
+<polygon fill="#999999" stroke="#666666" points="92.5,-19.25 2.25,-19.25 2.25,0 92.5,0 92.5,-19.25"/>
+<text text-anchor="middle" x="47.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">catalan_numbers</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="134.5,-85.75 0,-85.75 0,-66.5 134.5,-66.5 134.5,-85.75"/>
-<text text-anchor="middle" x="67.25" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::uint64_t &gt;</text>
+<g id="a_Node000002"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="94.75,-97 0,-97 0,-66.5 94.75,-66.5 94.75,-97"/>
+<text text-anchor="start" x="8" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; value</text>
+<text text-anchor="middle" x="47.38" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">_type &gt;</text>
 </a>
 </g>
 </g>
@@ -30,30 +31,11 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M67.25,-54.65C67.25,-42.82 67.25,-28.54 67.25,-19.52"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="63.75,-54.64 67.25,-64.64 70.75,-54.64 63.75,-54.64"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M47.38,-54.98C47.38,-42.48 47.38,-28.27 47.38,-19.38"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="43.88,-54.71 47.38,-64.71 50.88,-54.71 43.88,-54.71"/>
 </a>
 </g>
-<text text-anchor="middle" x="83" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> known</text>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="102.25,-152.25 32.25,-152.25 32.25,-133 102.25,-133 102.25,-152.25"/>
-<text text-anchor="middle" x="67.25" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint64_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M67.25,-121.15C67.25,-109.32 67.25,-95.04 67.25,-86.02"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="63.75,-121.14 67.25,-131.14 70.75,-121.14 63.75,-121.14"/>
-</a>
-</g>
-<text text-anchor="middle" x="88.62" y="-105.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="63.12" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> known</text>
 </g>
 </g>
 </svg>
diff --git a/d5/d7a/largest__power_8cpp.html b/d5/d7a/largest__power_8cpp.html
index 2dc6ac381..9ba832870 100644
--- a/d5/d7a/largest__power_8cpp.html
+++ b/d5/d7a/largest__power_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/largest_power.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/largest_power.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for largest_power.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d7e/largest__power_8cpp__incl.svg" width="255" height="111"><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">
+</div>
+<p><a href="../../d5/d7a/largest__power_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -147,6 +166,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/uday6670" target="_blank">uday6670</a> </dd></dl>
 </li>
 </ul>
+
+<p class="definition">Definition in file <a class="el" href="../../d5/d7a/largest__power_8cpp_source.html">largest_power.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -165,17 +186,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d7a/largest__power_8cpp_source.html#l00074">74</a> of file <a class="el" href="../../d5/d7a/largest__power_8cpp_source.html">largest_power.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   74</span>           {</div>
 <div class="line"><span class="lineno">   75</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the tests</span></div>
 <div class="line"><span class="lineno">   76</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   77</span>}</div>
-<div class="ttc" id="alargest__power_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function for testing largestPower function. test cases and assert statement.</div><div class="ttdef"><b>Definition</b> largest_power.cpp:48</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="334" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="alargest__power_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function for testing largestPower function. test cases and assert statement.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d7a/largest__power_8cpp_source.html#l00048">largest_power.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -203,36 +221,31 @@ Here is the call graph for this function:</div>
 
 <p>Function for testing largestPower function. test cases and assert statement. </p>
 <dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d7a/largest__power_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../d5/d7a/largest__power_8cpp_source.html">largest_power.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   48</span>                   {</div>
 <div class="line"><span class="lineno">   49</span>    uint8_t test_case_1 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f">math::largestPower</a>(5, 2);</div>
 <div class="line"><span class="lineno">   50</span>    assert(test_case_1 == 3);</div>
-<div class="line"><span class="lineno">   51</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed!&quot;</span> &lt;&lt; <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">   51</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   52</span> </div>
 <div class="line"><span class="lineno">   53</span>    uint16_t test_case_2 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f">math::largestPower</a>(10, 3);</div>
 <div class="line"><span class="lineno">   54</span>    assert(test_case_2 == 4);</div>
-<div class="line"><span class="lineno">   55</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed!&quot;</span> &lt;&lt; <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">   55</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   56</span> </div>
 <div class="line"><span class="lineno">   57</span>    uint32_t test_case_3 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f">math::largestPower</a>(25, 5);</div>
 <div class="line"><span class="lineno">   58</span>    assert(test_case_3 == 6);</div>
-<div class="line"><span class="lineno">   59</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed!&quot;</span> &lt;&lt; <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">   59</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   60</span> </div>
 <div class="line"><span class="lineno">   61</span>    uint32_t test_case_4 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f">math::largestPower</a>(27, 2);</div>
 <div class="line"><span class="lineno">   62</span>    assert(test_case_4 == 23);</div>
-<div class="line"><span class="lineno">   63</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 4 Passed!&quot;</span> &lt;&lt; <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">   63</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   64</span> </div>
 <div class="line"><span class="lineno">   65</span>    uint16_t test_case_5 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f">math::largestPower</a>(7, 3);</div>
 <div class="line"><span class="lineno">   66</span>    assert(test_case_5 == 2);</div>
-<div class="line"><span class="lineno">   67</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 5 Passed!&quot;</span> &lt;&lt; <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">   67</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 5 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   68</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="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="anamespacemath_html_afa39ec943a4836c878e1614fd89b146f"><div class="ttname"><a href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f">math::largestPower</a></div><div class="ttdeci">uint64_t largestPower(uint32_t n, const uint16_t &amp;p)</div><div class="ttdoc">Function to calculate largest power.</div><div class="ttdef"><b>Definition</b> largest_power.cpp:29</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="236" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemath_html_afa39ec943a4836c878e1614fd89b146f"><div class="ttname"><a href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f">math::largestPower</a></div><div class="ttdeci">uint64_t largestPower(uint32_t n, const uint16_t &amp;p)</div><div class="ttdoc">Function to calculate largest power.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d7a/largest__power_8cpp_source.html#l00029">largest_power.cpp:29</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 1173bf426..000000000
--- a/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Function for testing largestPower function. test cases and assert statement." alt="" coords="5,31,49,56"/>
-<area shape="rect" id="Node000002" 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="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,37,112,25,113,30,50,42"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f" title="Function to calculate largest power." alt="" coords="97,55,231,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="50,45,82,50,81,56,49,50"/>
-</map>
diff --git a/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 87b403617..000000000
--- a/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-af66575909c8c22b7274cc9806008db3
\ No newline at end of file
diff --git a/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 6180aafcf..000000000
--- a/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="177pt" height="64pt"
- viewBox="0.00 0.00 177.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function for testing largestPower function. test cases and assert statement.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="145.62,-56.25 92.12,-56.25 92.12,-37 145.62,-37 145.62,-56.25"/>
-<text text-anchor="middle" x="118.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.97,-30.59C45.73,-33 64.23,-36.5 80.71,-39.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.74,-42.99 90.21,-41.4 81.04,-36.11 79.74,-42.99"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f" target="_top" xlink:title="Function to calculate largest power.">
-<polygon fill="white" stroke="#666666" points="169.25,-19.25 68.5,-19.25 68.5,0 169.25,0 169.25,-19.25"/>
-<text text-anchor="middle" x="118.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::largestPower</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.97,-24.81C39.81,-23.59 48.3,-22.07 57.24,-20.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.58,-23.97 66.81,-18.76 56.35,-17.08 57.58,-23.97"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index c226b3a86..000000000
--- a/d5/d7a/largest__power_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="177pt" height="64pt"
- viewBox="0.00 0.00 177.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function for testing largestPower function. test cases and assert statement.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="145.62,-56.25 92.12,-56.25 92.12,-37 145.62,-37 145.62,-56.25"/>
-<text text-anchor="middle" x="118.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.97,-30.59C45.73,-33 64.23,-36.5 80.71,-39.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.74,-42.99 90.21,-41.4 81.04,-36.11 79.74,-42.99"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f" target="_top" xlink:title="Function to calculate largest power.">
-<polygon fill="white" stroke="#666666" points="169.25,-19.25 68.5,-19.25 68.5,0 169.25,0 169.25,-19.25"/>
-<text text-anchor="middle" x="118.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::largestPower</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.97,-24.81C39.81,-23.59 48.3,-22.07 57.24,-20.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.58,-23.97 66.81,-18.76 56.35,-17.08 57.58,-23.97"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 482b75bdd..000000000
--- a/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function for testing largestPower function. test cases and assert statement." alt="" coords="103,31,146,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,41,87,41,87,46,55,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="226,5,297,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,37,210,25,211,30,147,42"/>
-<area shape="rect" id="Node000004" href="$dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f" title="Function to calculate largest power." alt="" coords="194,55,328,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="147,45,179,50,179,56,146,50"/>
-</map>
diff --git a/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index bbe62a731..000000000
--- a/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-998094c3a5307ffb21e9f95aab282852
\ No newline at end of file
diff --git a/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index d3f553519..000000000
--- a/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="250pt" height="64pt"
- viewBox="0.00 0.00 250.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function for testing largestPower function. test cases and assert statement.">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="218.62,-56.25 165.12,-56.25 165.12,-37 218.62,-37 218.62,-56.25"/>
-<text text-anchor="middle" x="191.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.97,-30.59C118.73,-33 137.23,-36.5 153.71,-39.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.74,-42.99 163.21,-41.4 154.04,-36.11 152.74,-42.99"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f" target="_top" xlink:title="Function to calculate largest power.">
-<polygon fill="white" stroke="#666666" points="242.25,-19.25 141.5,-19.25 141.5,0 242.25,0 242.25,-19.25"/>
-<text text-anchor="middle" x="191.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::largestPower</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.97,-24.81C112.81,-23.59 121.3,-22.07 130.24,-20.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.58,-23.97 139.81,-18.76 129.35,-17.08 130.58,-23.97"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 5b55ad0d8..000000000
--- a/d5/d7a/largest__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="250pt" height="64pt"
- viewBox="0.00 0.00 250.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function for testing largestPower function. test cases and assert statement.">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="218.62,-56.25 165.12,-56.25 165.12,-37 218.62,-37 218.62,-56.25"/>
-<text text-anchor="middle" x="191.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.97,-30.59C118.73,-33 137.23,-36.5 153.71,-39.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.74,-42.99 163.21,-41.4 154.04,-36.11 152.74,-42.99"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f" target="_top" xlink:title="Function to calculate largest power.">
-<polygon fill="white" stroke="#666666" points="242.25,-19.25 141.5,-19.25 141.5,0 242.25,0 242.25,-19.25"/>
-<text text-anchor="middle" x="191.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::largestPower</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.97,-24.81C112.81,-23.59 121.3,-22.07 130.24,-20.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.58,-23.97 139.81,-18.76 129.35,-17.08 130.58,-23.97"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d7a/largest__power_8cpp_source.html b/d5/d7a/largest__power_8cpp_source.html
new file mode 100644
index 000000000..9c3ffd10a
--- /dev/null
+++ b/d5/d7a/largest__power_8cpp_source.html
@@ -0,0 +1,193 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/largest_power.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/d7a/largest__power_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">largest_power.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d5/d7a/largest__power_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="foldopen" id="foldopen00029" data-start="{" data-end="}">
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f">   29</a></span>uint64_t <a class="code hl_function" href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f">largestPower</a>(uint32_t n, <span class="keyword">const</span> uint16_t&amp; p) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="comment">// Initialize result</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordtype">int</span> x = 0;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="comment">// Calculate result</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">while</span> (n) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        n /= p;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        x += n;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    }</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">return</span> x;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>}</div>
+</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="foldopen" id="foldopen00048" data-start="{" data-end="}">
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="../../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   48</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    uint8_t test_case_1 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f">math::largestPower</a>(5, 2);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    assert(test_case_1 == 3);</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    uint16_t test_case_2 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f">math::largestPower</a>(10, 3);</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    assert(test_case_2 == 4);</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    uint32_t test_case_3 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f">math::largestPower</a>(25, 5);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    assert(test_case_3 == 6);</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    uint32_t test_case_4 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f">math::largestPower</a>(27, 2);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    assert(test_case_4 == 23);</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    uint16_t test_case_5 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f">math::largestPower</a>(7, 3);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    assert(test_case_5 == 2);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 5 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>}</div>
+</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="foldopen" id="foldopen00074" data-start="{" data-end="}">
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="../../d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   74</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <a class="code hl_function" href="../../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the tests</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>}</div>
+</div>
+<div class="ttc" id="alargest__power_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function for testing largestPower function. test cases and assert statement.</div><div class="ttdef"><b>Definition</b> <a href="#l00048">largest_power.cpp:48</a></div></div>
+<div class="ttc" id="alargest__power_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00074">largest_power.cpp:74</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_afa39ec943a4836c878e1614fd89b146f"><div class="ttname"><a href="../../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f">math::largestPower</a></div><div class="ttdeci">uint64_t largestPower(uint32_t n, const uint16_t &amp;p)</div><div class="ttdoc">Function to calculate largest power.</div><div class="ttdef"><b>Definition</b> <a href="#l00029">largest_power.cpp:29</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d5/d7a/largest__power_8cpp.html">largest_power.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/d82/edit__distance_8cpp_source.html b/d5/d82/edit__distance_8cpp_source.html
new file mode 100644
index 000000000..d8079bc3e
--- /dev/null
+++ b/d5/d82/edit__distance_8cpp_source.html
@@ -0,0 +1,226 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/edit_distance.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/d82/edit__distance_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">edit_distance.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/* Given two strings str1 &amp; str2</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * and below operations that can</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * be performed on str1. Find</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * minimum number of edits</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * (operations) required to convert</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> * &#39;str1&#39; into &#39;str2&#39;/</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> * a. Insert</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> * b. Remove</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> * c. Replace</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment"> * All of the above operations are</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment"> * of equal cost</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;string&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="keywordtype">int</span> min(<span class="keywordtype">int</span> x, <span class="keywordtype">int</span> y, <span class="keywordtype">int</span> z) { <span class="keywordflow">return</span> min(min(x, y), z); }</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment">/* A Naive recursive C++ program to find</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"> * minimum number of operations to convert</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"> * str1 to str2.</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment"> * O(3^m)</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keywordtype">int</span> editDist(<span class="keywordtype">string</span> str1, <span class="keywordtype">string</span> str2, <span class="keywordtype">int</span> m, <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordflow">if</span> (m == 0)</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        <span class="keywordflow">return</span> n;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordflow">if</span> (n == 0)</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        <span class="keywordflow">return</span> m;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="comment">// If last characters are same then continue</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="comment">// for the rest of them.</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">if</span> (str1[m - 1] == str2[n - 1])</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        <span class="keywordflow">return</span> editDist(str1, str2, m - 1, n - 1);</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="comment">// If last not same, then 3 possibilities</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="comment">// a.Insert b.Remove c. Replace</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="comment">// Get min of three and continue for rest.</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">return</span> 1 + min(editDist(str1, str2, m, n - 1),</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>                   editDist(str1, str2, m - 1, n),</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>                   editDist(str1, str2, m - 1, n - 1));</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>}</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="comment">/* A DP based program</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="comment"> * O(m x n)</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="keywordtype">int</span> editDistDP(<span class="keywordtype">string</span> str1, <span class="keywordtype">string</span> str2, <span class="keywordtype">int</span> m, <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="comment">// Create Table for SubProblems</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    std::vector&lt;std::vector&lt;int&gt; &gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(m + 1, std::vector&lt;int&gt;(n + 1));</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="comment">// Fill d[][] in bottom up manner</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= m; i++) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt;= n; j++) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            <span class="comment">// If str1 empty. Then add all of str2</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            <span class="keywordflow">if</span> (i == 0)</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>                <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j] = j;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            <span class="comment">// If str2 empty. Then add all of str1</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (j == 0)</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>                <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j] = i;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            <span class="comment">// If character same. Recur for remaining</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str1[i - 1] == str2[j - 1])</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>                <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j] = <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i - 1][j - 1];</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j] = 1 + min(<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j - 1],     <span class="comment">// Insert</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>                                   <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i - 1][j],     <span class="comment">// Remove</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>                                   <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i - 1][j - 1]  <span class="comment">// Replace</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>                               );</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        }</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    }</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[m][n];</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>}</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keywordtype">string</span> str1 = <span class="stringliteral">&quot;sunday&quot;</span>;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordtype">string</span> str2 = <span class="stringliteral">&quot;saturday&quot;</span>;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    cout &lt;&lt; editDist(str1, str2, str1.length(), str2.length()) &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    cout &lt;&lt; editDistDP(str1, str2, str1.length(), str2.length()) &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</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> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><b>edit_distance.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/d83/lcm__sum_8cpp.html b/d5/d83/lcm__sum_8cpp.html
index 215a3327c..ea7d89c9f 100644
--- a/d5/d83/lcm__sum_8cpp.html
+++ b/d5/d83/lcm__sum_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/lcm_sum.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/lcm_sum.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for lcm_sum.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d52/lcm__sum_8cpp__incl.svg" width="336" height="111"><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">
+</div>
+<p><a href="../../d5/d83/lcm__sum_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -149,6 +168,8 @@ Functions</h2></td></tr>
 \mathrm{ETF}(d)) + 1\right) * n\right] \]
 </p>
 <p> where \mathrm{ETF}(i) represents Euler totient function of i. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/chestamittal" target="_blank">Chesta Mittal</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d5/d83/lcm__sum_8cpp_source.html">lcm_sum.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -167,17 +188,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d83/lcm__sum_8cpp_source.html#l00097">97</a> of file <a class="el" href="../../d5/d83/lcm__sum_8cpp_source.html">lcm_sum.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   97</span>           {</div>
 <div class="line"><span class="lineno">   98</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the tests</span></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="alcm__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> lcm_sum.cpp:66</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="alcm__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d83/lcm__sum_8cpp_source.html#l00066">lcm_sum.cpp:66</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -203,44 +221,39 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Function for testing lcmSum function. test cases and assert statement. </p><dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d83/lcm__sum_8cpp_source.html#l00066">66</a> of file <a class="el" href="../../d5/d83/lcm__sum_8cpp_source.html">lcm_sum.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   66</span>                   {</div>
 <div class="line"><span class="lineno">   67</span>    uint64_t n = 2;</div>
 <div class="line"><span class="lineno">   68</span>    uint64_t <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a> = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">math::lcmSum</a>(n);</div>
 <div class="line"><span class="lineno">   69</span>    assert(<a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a> == 4);</div>
-<div class="line"><span class="lineno">   70</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 1!&quot;</span> &lt;&lt; <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">   70</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 1!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   71</span> </div>
 <div class="line"><span class="lineno">   72</span>    n = 5;</div>
 <div class="line"><span class="lineno">   73</span>    uint64_t <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a> = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">math::lcmSum</a>(n);</div>
 <div class="line"><span class="lineno">   74</span>    assert(<a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a> == 55);</div>
-<div class="line"><span class="lineno">   75</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 2!&quot;</span> &lt;&lt; <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">   75</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 2!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   76</span> </div>
 <div class="line"><span class="lineno">   77</span>    n = 10;</div>
 <div class="line"><span class="lineno">   78</span>    uint64_t <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a> = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">math::lcmSum</a>(n);</div>
 <div class="line"><span class="lineno">   79</span>    assert(<a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a> == 320);</div>
-<div class="line"><span class="lineno">   80</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 3!&quot;</span> &lt;&lt; <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">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 3!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   81</span> </div>
 <div class="line"><span class="lineno">   82</span>    n = 11;</div>
 <div class="line"><span class="lineno">   83</span>    uint64_t test_4 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">math::lcmSum</a>(n);</div>
 <div class="line"><span class="lineno">   84</span>    assert(test_4 == 616);</div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 4!&quot;</span> &lt;&lt; <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">   85</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 4!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   86</span> </div>
 <div class="line"><span class="lineno">   87</span>    n = 15;</div>
 <div class="line"><span class="lineno">   88</span>    uint64_t test_5 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">math::lcmSum</a>(n);</div>
 <div class="line"><span class="lineno">   89</span>    assert(test_5 == 1110);</div>
-<div class="line"><span class="lineno">   90</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 5!&quot;</span> &lt;&lt; <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">   90</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 5!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   91</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="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="aheavy__light__decomposition_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:505</div></div>
-<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:549</div></div>
-<div class="ttc" id="aheavy__light__decomposition_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:592</div></div>
-<div class="ttc" id="anamespacemath_html_a04065193d190d605e1f0d0d93a87e244"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">math::lcmSum</a></div><div class="ttdeci">uint64_t lcmSum(const uint16_t &amp;num)</div><div class="ttdef"><b>Definition</b> lcm_sum.cpp:30</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00505">heavy_light_decomposition.cpp:505</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00549">heavy_light_decomposition.cpp:549</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00592">heavy_light_decomposition.cpp:592</a></div></div>
+<div class="ttc" id="anamespacemath_html_a04065193d190d605e1f0d0d93a87e244"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">math::lcmSum</a></div><div class="ttdeci">uint64_t lcmSum(const uint16_t &amp;num)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d83/lcm__sum_8cpp_source.html#l00030">lcm_sum.cpp:30</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 79a83ffd6..000000000
--- a/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,73 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,252,49,278"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="114,153,186,179"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="36,250,61,220,95,188,100,185,103,189,98,192,65,224,40,254"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244" title=" " alt="" coords="97,203,203,228"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="48,254,101,232,103,237,50,259"/>
-<area shape="rect" id="Node000004" href="$d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" title=" " alt="" coords="121,399,178,424"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="41,276,130,385,126,389,37,280"/>
-<area shape="rect" id="Node000024" href="$d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d" title=" " alt="" coords="121,252,178,278"/>
-<area shape="poly" id="edge31_Node000001_Node000024" title=" " alt="" coords="49,262,105,262,105,268,49,268"/>
-<area shape="rect" id="Node000025" href="$d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a" title=" " alt="" coords="121,301,178,327"/>
-<area shape="poly" id="edge39_Node000001_Node000025" title=" " alt="" coords="50,271,108,295,105,300,48,276"/>
-<area shape="rect" id="Node000005" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" title="Adds an undirected edge from node u to node v in the tree." alt="" coords="251,352,396,407"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="179,404,235,393,236,398,180,409"/>
-<area shape="rect" id="Node000006" 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="444,307,599,332"/>
-<area shape="poly" id="edge19_Node000004_Node000006" title=" " alt="" coords="158,424,170,452,190,487,217,521,252,548,292,566,326,574,359,569,395,548,414,527,423,505,425,481,422,456,419,430,419,404,426,377,442,350,455,339,459,343,446,353,431,379,425,404,425,430,428,456,430,481,428,506,419,530,398,552,361,574,326,579,290,571,250,553,214,525,186,490,166,454,153,426"/>
-<area shape="rect" id="Node000007" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" title="This function must be called after the tree adjacency list and node values are populated The function..." alt="" coords="251,613,396,669"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="158,424,192,500,219,548,253,593,262,601,258,605,249,596,215,551,187,503,153,426"/>
-<area shape="rect" id="Node000015" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" title="This function returns the sum of node values in the simple path from from node_1 to node_2." alt="" coords="251,482,396,538"/>
-<area shape="poly" id="edge20_Node000004_Node000015" title=" " alt="" coords="176,423,261,472,259,477,173,427"/>
-<area shape="rect" id="Node000020" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" title="Set the values for all the nodes." alt="" coords="251,221,396,277"/>
-<area shape="poly" id="edge26_Node000004_Node000020" title=" " alt="" coords="163,396,280,286,284,289,167,400"/>
-<area shape="rect" id="Node000021" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="464,203,579,228"/>
-<area shape="poly" id="edge28_Node000004_Node000021" title=" " alt="" coords="180,420,225,433,281,442,311,442,341,439,369,431,395,417,409,405,418,392,424,363,428,330,433,312,442,293,466,262,491,237,495,241,470,266,447,296,438,314,433,331,429,364,423,394,413,408,398,422,371,436,342,444,311,448,281,447,224,438,178,425"/>
-<area shape="rect" id="Node000022" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" title="This function updates the value at node with val." alt="" coords="251,90,396,146"/>
-<area shape="poly" id="edge29_Node000004_Node000022" title=" " alt="" coords="160,397,180,371,201,338,216,303,224,273,232,244,249,208,285,156,289,160,253,210,237,245,229,275,221,305,205,341,185,374,164,400"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="396,355,461,335,463,340,397,360"/>
-<area shape="rect" id="Node000008" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" title="Function that specifies the type of operation involved when segments are combined." alt="" coords="647,561,792,617"/>
-<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="397,634,493,626,598,613,631,607,632,612,599,618,493,632,397,640"/>
-<area shape="rect" id="Node000009" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)" alt="" coords="449,886,594,942"/>
-<area shape="poly" id="edge8_Node000007_Node000009" title=" " alt="" coords="340,668,382,753,412,802,446,849,472,874,468,878,442,852,408,805,377,755,335,671"/>
-<area shape="rect" id="Node000010" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" title="Utility function to lable the nodes so that heavy chains have a contigous lable." alt="" coords="449,548,594,603"/>
-<area shape="poly" id="edge10_Node000007_Node000010" title=" " alt="" coords="396,615,433,602,435,607,397,620"/>
-<area shape="rect" id="Node000011" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" title="Utility function to assign highest parent that can be reached though heavy chains." alt="" coords="449,702,594,758"/>
-<area shape="poly" id="edge12_Node000007_Node000011" title=" " alt="" coords="388,667,446,693,443,698,386,672"/>
-<area shape="rect" id="Node000012" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" title="This function must be called after the tree adjacency list and node values are populated The function..." alt="" coords="449,782,594,838"/>
-<area shape="poly" id="edge14_Node000007_Node000012" title=" " alt="" coords="348,668,391,717,446,768,451,772,447,776,443,772,387,721,344,671"/>
-<area shape="poly" id="edge9_Node000009_Node000009" title=" " alt="" coords="482,886,483,876,490,867,503,862,522,860,543,862,555,869,553,874,541,868,521,865,504,867,493,872,488,878,488,886"/>
-<area shape="poly" id="edge11_Node000010_Node000010" title=" " alt="" coords="482,547,483,537,490,529,503,523,522,521,543,524,555,531,553,535,541,529,521,526,504,528,493,533,488,539,488,547"/>
-<area shape="poly" id="edge13_Node000011_Node000011" title=" " alt="" coords="482,702,483,692,490,683,503,678,522,676,543,678,555,685,553,690,541,684,521,681,504,683,493,688,488,694,488,702"/>
-<area shape="rect" id="Node000013" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" title="Utility function to populate the t_par vector." alt="" coords="647,834,792,890"/>
-<area shape="poly" id="edge15_Node000012_Node000013" title=" " alt="" coords="595,827,633,837,631,842,594,832"/>
-<area shape="rect" id="Node000014" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" title="Utility function to compute sub&#45;tree sizes." alt="" coords="647,730,792,786"/>
-<area shape="poly" id="edge17_Node000012_Node000014" title=" " alt="" coords="594,789,631,779,633,784,595,794"/>
-<area shape="poly" id="edge16_Node000013_Node000013" title=" " alt="" coords="680,834,681,824,688,815,701,810,719,808,740,810,753,817,751,822,739,816,719,813,702,815,691,820,686,826,685,834"/>
-<area shape="poly" id="edge18_Node000014_Node000014" title=" " alt="" coords="680,730,681,720,688,711,701,706,719,704,740,706,753,713,751,718,739,712,719,709,702,711,691,716,686,722,685,730"/>
-<area shape="rect" id="Node000016" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" title="Utility function to break down a path query into two chain queries." alt="" coords="449,444,594,499"/>
-<area shape="poly" id="edge21_Node000015_Node000016" title=" " alt="" coords="396,494,433,486,434,491,397,499"/>
-<area shape="rect" id="Node000018" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" title="The function returns the least common ancestor of two nodes." alt="" coords="449,364,594,419"/>
-<area shape="poly" id="edge24_Node000015_Node000018" title=" " alt="" coords="367,480,395,461,443,429,450,425,453,430,446,434,398,466,370,484"/>
-<area shape="poly" id="edge22_Node000016_Node000008" title=" " alt="" coords="580,498,600,509,665,550,662,554,597,514,577,502"/>
-<area shape="rect" id="Node000017" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="680,459,758,484"/>
-<area shape="poly" id="edge23_Node000016_Node000017" title=" " alt="" coords="594,469,665,469,665,474,594,474"/>
-<area shape="rect" id="Node000019" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store..." alt="" coords="647,364,792,419"/>
-<area shape="poly" id="edge25_Node000018_Node000019" title=" " alt="" coords="594,389,631,389,631,394,594,394"/>
-<area shape="poly" id="edge27_Node000020_Node000021" title=" " alt="" coords="396,234,448,225,449,231,397,239"/>
-<area shape="rect" id="Node000023" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" title="Update the value at a node." alt="" coords="449,90,594,146"/>
-<area shape="poly" id="edge30_Node000022_Node000023" title=" " alt="" coords="397,116,434,116,434,121,397,121"/>
-<area shape="poly" id="edge32_Node000024_Node000005" title=" " alt="" coords="180,274,204,287,279,340,276,344,202,291,177,279"/>
-<area shape="poly" id="edge34_Node000024_Node000006" title=" " alt="" coords="177,255,201,239,214,218,220,197,220,155,220,134,222,114,231,94,249,76,287,54,324,47,360,54,398,76,416,94,426,113,431,132,431,152,432,194,436,216,447,240,469,269,494,295,490,298,465,273,442,242,431,218,427,195,426,152,425,133,421,115,412,97,395,80,358,59,324,52,289,59,253,80,236,97,228,115,225,135,225,155,225,198,219,221,205,243,180,259"/>
-<area shape="poly" id="edge33_Node000024_Node000007" title=" " alt="" coords="180,270,193,277,205,287,226,321,237,354,240,384,239,414,236,477,241,511,253,549,268,576,287,600,282,603,264,579,249,551,235,513,231,477,233,414,235,384,232,355,221,324,201,291,190,281,177,274"/>
-<area shape="poly" id="edge35_Node000024_Node000015" title=" " alt="" coords="181,271,205,287,226,320,234,351,239,382,253,418,289,469,285,472,249,421,234,384,229,352,222,322,201,291,178,275"/>
-<area shape="poly" id="edge36_Node000024_Node000020" title=" " alt="" coords="179,260,235,254,236,260,179,265"/>
-<area shape="poly" id="edge37_Node000024_Node000021" title=" " alt="" coords="178,255,191,248,201,239,217,213,223,186,222,159,219,133,216,106,218,80,228,56,249,32,287,10,323,3,359,11,398,32,413,46,422,60,428,91,431,123,436,140,446,157,464,176,485,192,482,196,461,180,442,160,432,142,426,124,423,92,417,62,409,49,395,36,357,16,323,8,289,15,253,36,232,58,223,82,222,106,224,132,228,159,228,186,222,214,205,243,194,253,180,260"/>
-<area shape="poly" id="edge38_Node000024_Node000022" title=" " alt="" coords="177,253,201,239,217,221,225,203,234,184,249,163,259,154,263,158,253,167,238,187,230,205,221,223,205,243,180,258"/>
-<area shape="poly" id="edge40_Node000025_Node000005" title=" " alt="" coords="180,322,237,344,235,349,178,327"/>
-<area shape="poly" id="edge42_Node000025_Node000006" title=" " alt="" coords="179,312,429,316,429,321,179,317"/>
-<area shape="poly" id="edge41_Node000025_Node000007" title=" " alt="" coords="165,326,186,352,205,385,222,431,229,468,236,505,253,549,288,600,284,603,249,552,231,507,224,469,217,432,201,387,181,355,161,329"/>
-<area shape="poly" id="edge43_Node000025_Node000015" title=" " alt="" coords="165,326,290,469,286,472,161,330"/>
-<area shape="poly" id="edge44_Node000025_Node000020" title=" " alt="" coords="178,301,235,279,237,284,180,306"/>
-<area shape="poly" id="edge45_Node000025_Node000021" title=" " alt="" coords="177,303,201,288,216,267,222,246,230,225,250,207,276,195,303,187,361,182,416,186,465,196,464,201,415,191,361,187,304,192,278,200,252,211,235,228,228,248,221,270,205,292,180,307"/>
-<area shape="poly" id="edge46_Node000025_Node000022" title=" " alt="" coords="178,304,201,288,213,273,220,258,226,228,231,197,237,181,249,163,257,155,261,158,253,167,242,183,236,199,231,229,225,260,218,276,205,292,180,308"/>
-</map>
diff --git a/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index d63a9339c..000000000
--- a/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-28377f0185718dd60dd31b426d893b3a
\ No newline at end of file
diff --git a/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index cb556e4f8..000000000
--- a/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,766 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<!--zoomable 711 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 598;
-var viewHeight = 711;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-517.5 0,-517.5 0,-498.25 32.5,-498.25 32.5,-517.5"/>
-<text text-anchor="middle" x="16.25" y="-504" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.12,-591.5 81.62,-591.5 81.62,-572.25 135.12,-572.25 135.12,-591.5"/>
-<text text-anchor="middle" x="108.38" y="-578" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.27,-517.68C33.36,-529.81 50.21,-550.49 68.5,-563.88 69.65,-564.71 70.84,-565.53 72.07,-566.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.13,-569.24 80.56,-571.1 73.56,-563.14 70.13,-569.24"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="148.25,-554.5 68.5,-554.5 68.5,-535.25 148.25,-535.25 148.25,-554.5"/>
-<text text-anchor="middle" x="108.38" y="-541" font-family="Helvetica,sans-Serif" font-size="10.00">math::lcmSum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.95,-514.32C43.85,-518.8 58.82,-524.94 72.47,-530.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.06,-533.75 81.64,-534.31 73.72,-527.27 71.06,-533.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-407.5 86.88,-407.5 86.88,-388.25 129.88,-388.25 129.88,-407.5"/>
-<text text-anchor="middle" x="108.38" y="-394" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.25,-498.11C40.24,-479.81 72.8,-440.07 92.12,-416.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.68,-418.9 98.31,-408.94 89.26,-414.46 94.68,-418.9"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-517.5 86.88,-517.5 86.88,-498.25 129.88,-498.25 129.88,-517.5"/>
-<text text-anchor="middle" x="108.38" y="-504" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node24 -->
-<g id="edge31_Node000001_Node000024" class="edge">
-<title>Node1&#45;&gt;Node24</title>
-<g id="a_edge31_Node000001_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.95,-507.88C44.53,-507.88 60.7,-507.88 75.01,-507.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.94,-511.38 84.94,-507.88 74.94,-504.38 74.94,-511.38"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-480.5 86.88,-480.5 86.88,-461.25 129.88,-461.25 129.88,-480.5"/>
-<text text-anchor="middle" x="108.38" y="-467" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node25 -->
-<g id="edge39_Node000001_Node000025" class="edge">
-<title>Node1&#45;&gt;Node25</title>
-<g id="a_edge39_Node000001_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.95,-501.43C44.76,-496.58 61.35,-489.77 75.87,-483.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.13,-487.08 85.05,-480.04 74.47,-480.6 77.13,-487.08"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" target="_top" xlink:title="Adds an undirected edge from node u to node v in the tree.">
-<polygon fill="white" stroke="#666666" points="293.25,-442.75 184.25,-442.75 184.25,-401 293.25,-401 293.25,-442.75"/>
-<text text-anchor="start" x="192.25" y="-429.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="192.25" y="-418" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="238.75" y="-406.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.29,-401.78C142.01,-403.98 157.33,-406.84 172.72,-409.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.92,-413.13 182.4,-411.53 173.21,-406.25 171.92,-413.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="445,-476.5 329.25,-476.5 329.25,-457.25 445,-457.25 445,-476.5"/>
-<text text-anchor="middle" x="387.12" y="-463" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge19_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge19_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.87,-388.03C121.22,-366.23 144.65,-314.16 184.25,-293.88 227.37,-271.79 255.18,-263.91 293.25,-293.88 346.78,-336.01 285.14,-390.96 329.25,-442.88 331.94,-446.04 335.12,-448.8 338.58,-451.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.53,-454.06 346.94,-456 340.01,-447.99 336.53,-454.06"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="293.25,-246.75 184.25,-246.75 184.25,-205 293.25,-205 293.25,-246.75"/>
-<text text-anchor="start" x="192.25" y="-233.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="192.25" y="-222" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="238.75" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::init</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.87,-387.89C121.71,-363.76 146.91,-301.29 184.25,-260.88 186.4,-258.54 188.74,-256.3 191.2,-254.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="193.09,-257.12 198.73,-248.15 188.73,-251.64 193.09,-257.12"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" target="_top" xlink:title="This function returns the sum of node values in the simple path from from node_1 to node_2.">
-<polygon fill="white" stroke="#666666" points="293.25,-344.75 184.25,-344.75 184.25,-303 293.25,-303 293.25,-344.75"/>
-<text text-anchor="start" x="192.25" y="-331.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="192.25" y="-320" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="238.75" y="-308.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::query</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node15 -->
-<g id="edge20_Node000004_Node000015" class="edge">
-<title>Node4&#45;&gt;Node15</title>
-<g id="a_edge20_Node000004_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.69,-387.9C143.14,-378.41 168.63,-363.72 191.04,-350.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.53,-353.98 199.44,-345.96 189.03,-347.92 192.53,-353.98"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" target="_top" xlink:title="Set the values for all the nodes.">
-<polygon fill="white" stroke="#666666" points="293.25,-540.75 184.25,-540.75 184.25,-499 293.25,-499 293.25,-540.75"/>
-<text text-anchor="start" x="192.25" y="-527.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="192.25" y="-516" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="238.75" y="-504.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::set_node_val</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node20 -->
-<g id="edge26_Node000004_Node000020" class="edge">
-<title>Node4&#45;&gt;Node20</title>
-<g id="a_edge26_Node000004_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.88,-407.86C138.77,-425.81 179.11,-464.14 207.31,-490.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="204.87,-493.46 214.53,-497.81 209.7,-488.39 204.87,-493.46"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="430.38,-554.5 343.88,-554.5 343.88,-535.25 430.38,-535.25 430.38,-554.5"/>
-<text text-anchor="middle" x="387.12" y="-541" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node21 -->
-<g id="edge28_Node000004_Node000021" class="edge">
-<title>Node4&#45;&gt;Node21</title>
-<g id="a_edge28_Node000004_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.35,-389.83C166.99,-377.24 243.51,-357.66 293.25,-391.88 330.11,-417.23 305.24,-448.12 329.25,-485.88 339.23,-501.56 353.84,-516.61 365.75,-527.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="363.29,-530.08 373.09,-534.11 367.95,-524.85 363.29,-530.08"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" target="_top" xlink:title="This function updates the value at node with val.">
-<polygon fill="white" stroke="#666666" points="293.25,-638.75 184.25,-638.75 184.25,-597 293.25,-597 293.25,-638.75"/>
-<text text-anchor="start" x="192.25" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="192.25" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="238.75" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::update</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node22 -->
-<g id="edge29_Node000004_Node000022" class="edge">
-<title>Node4&#45;&gt;Node22</title>
-<g id="a_edge29_Node000004_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.7,-407.68C126.24,-418.11 139.48,-435.35 148.25,-451.88 170.01,-492.86 161.62,-509.36 184.25,-549.88 191.71,-563.22 201.69,-576.71 211.01,-588.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.2,-590.2 217.32,-595.61 213.56,-585.7 208.2,-590.2"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.42,-438.38C309.57,-443.34 327.09,-448.73 342.51,-453.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="341.28,-456.75 351.87,-456.34 343.34,-450.06 341.28,-456.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="590,-285.75 481,-285.75 481,-244 590,-244 590,-285.75"/>
-<text text-anchor="start" x="489" y="-272.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="489" y="-261" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="535.5" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.57,-228.97C335.11,-231.82 393.92,-236.84 445,-244.88 453,-246.13 461.36,-247.68 469.61,-249.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="468.77,-252.76 479.28,-251.39 470.21,-245.91 468.77,-252.76"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" target="_top" xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="white" stroke="#666666" points="441.62,-41.75 332.62,-41.75 332.62,0 441.62,0 441.62,-41.75"/>
-<text text-anchor="start" x="340.62" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="340.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="387.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.94,-204.59C263.23,-172.94 292.93,-112.53 329.25,-68.88 334.94,-62.03 341.69,-55.39 348.52,-49.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.62,-52.16 355.97,-43.01 346.09,-46.82 350.62,-52.16"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" target="_top" xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="white" stroke="#666666" points="441.62,-295.75 332.62,-295.75 332.62,-254 441.62,-254 441.62,-295.75"/>
-<text text-anchor="start" x="340.62" y="-282.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="340.62" y="-271" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="387.12" y="-259.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node10 -->
-<g id="edge10_Node000007_Node000010" class="edge">
-<title>Node7&#45;&gt;Node10</title>
-<g id="a_edge10_Node000007_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.42,-243.84C302.57,-246.91 312.16,-250.11 321.55,-253.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.43,-256.57 331.02,-256.43 322.65,-249.94 320.43,-256.57"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" target="_top" xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="white" stroke="#666666" points="441.62,-179.75 332.62,-179.75 332.62,-138 441.62,-138 441.62,-179.75"/>
-<text text-anchor="start" x="340.62" y="-166.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="340.62" y="-155" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="387.12" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node11 -->
-<g id="edge12_Node000007_Node000011" class="edge">
-<title>Node7&#45;&gt;Node11</title>
-<g id="a_edge12_Node000007_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M286.06,-204.68C299.81,-198.38 315.03,-191.42 329.36,-184.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="330.6,-188.14 338.23,-180.8 327.68,-181.78 330.6,-188.14"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="441.62,-119.75 332.62,-119.75 332.62,-78 441.62,-78 441.62,-119.75"/>
-<text text-anchor="start" x="340.62" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="340.62" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="387.12" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node12 -->
-<g id="edge14_Node000007_Node000012" class="edge">
-<title>Node7&#45;&gt;Node12</title>
-<g id="a_edge14_Node000007_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.81,-204.61C272.49,-183.53 300.19,-151.22 329.25,-128.88 330.37,-128.01 331.52,-127.16 332.69,-126.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.33,-129.44 340.76,-121.01 330.48,-123.59 334.33,-129.44"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node9 -->
-<g id="edge9_Node000009_Node000009" class="edge">
-<title>Node9&#45;&gt;Node9</title>
-<g id="a_edge9_Node000009_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M359.74,-42.07C357.13,-51.55 366.26,-59.75 387.12,-59.75 399.19,-59.75 407.33,-57.01 411.54,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.84,-54.1 414.11,-43.53 408.09,-52.24 414.84,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node10 -->
-<g id="edge11_Node000010_Node000010" class="edge">
-<title>Node10&#45;&gt;Node10</title>
-<g id="a_edge11_Node000010_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M359.74,-296.07C357.13,-305.55 366.26,-313.75 387.12,-313.75 399.19,-313.75 407.33,-311.01 411.54,-306.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.84,-308.1 414.11,-297.53 408.09,-306.24 414.84,-308.1"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node11 -->
-<g id="edge13_Node000011_Node000011" class="edge">
-<title>Node11&#45;&gt;Node11</title>
-<g id="a_edge13_Node000011_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M359.74,-180.07C357.13,-189.55 366.26,-197.75 387.12,-197.75 399.19,-197.75 407.33,-195.01 411.54,-190.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.84,-192.1 414.11,-181.53 408.09,-190.24 414.84,-192.1"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="590,-80.75 481,-80.75 481,-39 590,-39 590,-80.75"/>
-<text text-anchor="start" x="489" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="489" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="535.5" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge15_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge15_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M441.8,-84.57C450.95,-82.14 460.53,-79.58 469.93,-77.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="470.61,-80.52 479.37,-74.56 468.81,-73.76 470.61,-80.52"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="590,-158.75 481,-158.75 481,-117 590,-117 590,-158.75"/>
-<text text-anchor="start" x="489" y="-145.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="489" y="-134" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="535.5" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node14 -->
-<g id="edge17_Node000012_Node000014" class="edge">
-<title>Node12&#45;&gt;Node14</title>
-<g id="a_edge17_Node000012_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M441.8,-113.18C450.95,-115.61 460.53,-118.17 469.93,-120.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="468.81,-123.99 479.37,-123.19 470.61,-117.23 468.81,-123.99"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node13 -->
-<g id="edge16_Node000013_Node000013" class="edge">
-<title>Node13&#45;&gt;Node13</title>
-<g id="a_edge16_Node000013_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M508.11,-81.07C505.51,-90.55 514.63,-98.75 535.5,-98.75 547.56,-98.75 555.7,-96.01 559.92,-91.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="563.21,-93.1 562.48,-82.53 556.46,-91.24 563.21,-93.1"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node14 -->
-<g id="edge18_Node000014_Node000014" class="edge">
-<title>Node14&#45;&gt;Node14</title>
-<g id="a_edge18_Node000014_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M508.11,-159.07C505.51,-168.55 514.63,-176.75 535.5,-176.75 547.56,-176.75 555.7,-174.01 559.92,-169.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="563.21,-171.1 562.48,-160.53 556.46,-169.24 563.21,-171.1"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" target="_top" xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="white" stroke="#666666" points="441.62,-373.75 332.62,-373.75 332.62,-332 441.62,-332 441.62,-373.75"/>
-<text text-anchor="start" x="340.62" y="-360.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="340.62" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="387.12" y="-337.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge21_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge21_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.42,-334.51C302.47,-336.3 311.95,-338.18 321.25,-340.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.48,-343.44 330.97,-341.95 321.84,-336.57 320.48,-343.44"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" target="_top" xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="white" stroke="#666666" points="441.62,-433.75 332.62,-433.75 332.62,-392 441.62,-392 441.62,-433.75"/>
-<text text-anchor="start" x="340.62" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="340.62" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="387.12" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node18 -->
-<g id="edge24_Node000015_Node000018" class="edge">
-<title>Node15&#45;&gt;Node18</title>
-<g id="a_edge24_Node000015_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M272.32,-345.12C279.23,-349.65 286.49,-354.41 293.25,-358.88 309.3,-369.47 312.72,-373.04 329.25,-382.88 331.08,-383.97 332.96,-385.06 334.87,-386.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="332.78,-389 343.21,-390.83 336.2,-382.89 332.78,-389"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node8 -->
-<g id="edge22_Node000016_Node000008" class="edge">
-<title>Node16&#45;&gt;Node8</title>
-<g id="a_edge22_Node000016_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M429.68,-331.51C434.88,-328.68 440.09,-325.75 445,-322.88 461.12,-313.43 478.43,-302.42 493.5,-292.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.36,-295.51 501.78,-287.08 491.5,-289.67 495.36,-295.51"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="564.88,-362.5 506.12,-362.5 506.12,-343.25 564.88,-343.25 564.88,-362.5"/>
-<text text-anchor="middle" x="535.5" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge23_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge23_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M441.8,-352.88C459.26,-352.88 478.33,-352.88 494.6,-352.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="494.38,-356.38 504.38,-352.88 494.38,-349.38 494.38,-356.38"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="590,-433.75 481,-433.75 481,-392 590,-392 590,-433.75"/>
-<text text-anchor="start" x="489" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="489" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="535.5" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node19 -->
-<g id="edge25_Node000018_Node000019" class="edge">
-<title>Node18&#45;&gt;Node19</title>
-<g id="a_edge25_Node000018_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M441.8,-412.88C450.85,-412.88 460.33,-412.88 469.62,-412.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="469.32,-416.38 479.32,-412.88 469.32,-409.38 469.32,-416.38"/>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node21 -->
-<g id="edge27_Node000020_Node000021" class="edge">
-<title>Node20&#45;&gt;Node21</title>
-<g id="a_edge27_Node000020_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.42,-529.04C306.04,-531.2 319.5,-533.5 332.13,-535.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.51,-539.1 341.96,-537.33 332.69,-532.2 331.51,-539.1"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" target="_top" xlink:title="Update the value at a node.">
-<polygon fill="white" stroke="#666666" points="441.62,-638.75 332.62,-638.75 332.62,-597 441.62,-597 441.62,-638.75"/>
-<text text-anchor="start" x="340.62" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="340.62" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="387.12" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::update</text>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node23 -->
-<g id="edge30_Node000022_Node000023" class="edge">
-<title>Node22&#45;&gt;Node23</title>
-<g id="a_edge30_Node000022_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.42,-617.88C302.47,-617.88 311.95,-617.88 321.25,-617.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.94,-621.38 330.94,-617.88 320.94,-614.38 320.94,-621.38"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node5 -->
-<g id="edge32_Node000024_Node000005" class="edge">
-<title>Node24&#45;&gt;Node5</title>
-<g id="a_edge32_Node000024_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.98,-499.34C136.01,-496.58 142.51,-493.33 148.25,-489.88 167.72,-478.16 187.99,-463.03 204.31,-450.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.19,-453.01 211.76,-444 201.79,-447.57 206.19,-453.01"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node6 -->
-<g id="edge34_Node000024_Node000006" class="edge">
-<title>Node24&#45;&gt;Node6</title>
-<g id="a_edge34_Node000024_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.08,-513.68C136.67,-516.43 143.49,-520.36 148.25,-525.88 185.19,-568.67 138.97,-614.03 184.25,-647.88 223.05,-676.88 254.45,-676.88 293.25,-647.88 338.53,-614.03 300.82,-574.74 329.25,-525.88 338.49,-510 352.87,-495.13 364.86,-484.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="367.04,-487.03 372.3,-477.83 362.45,-481.75 367.04,-487.03"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node7 -->
-<g id="edge33_Node000024_Node000007" class="edge">
-<title>Node24&#45;&gt;Node7</title>
-<g id="a_edge33_Node000024_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.01,-502.52C136.76,-499.79 143.69,-495.75 148.25,-489.88 202.51,-419.87 147.8,-374.6 184.25,-293.88 190.44,-280.16 199.99,-266.76 209.31,-255.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="211.78,-258.02 215.68,-248.17 206.49,-253.44 211.78,-258.02"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node15 -->
-<g id="edge35_Node000024_Node000015" class="edge">
-<title>Node24&#45;&gt;Node15</title>
-<g id="a_edge35_Node000024_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.28,-501.72C136.73,-498.97 143.41,-495.13 148.25,-489.88 179.7,-455.75 161.62,-432.39 184.25,-391.88 191.71,-378.53 201.69,-365.04 211.01,-353.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.56,-356.05 217.32,-346.14 208.2,-351.55 213.56,-356.05"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node20 -->
-<g id="edge36_Node000024_Node000020" class="edge">
-<title>Node24&#45;&gt;Node20</title>
-<g id="a_edge36_Node000024_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.29,-509.83C142.01,-510.93 157.33,-512.36 172.72,-513.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.09,-517.25 182.38,-514.7 172.75,-510.28 172.09,-517.25"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node21 -->
-<g id="edge37_Node000024_Node000021" class="edge">
-<title>Node24&#45;&gt;Node21</title>
-<g id="a_edge37_Node000024_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.27,-513.52C136.88,-516.26 143.65,-520.22 148.25,-525.88 192.87,-580.75 128.87,-636.89 184.25,-680.88 222.18,-711.01 253.29,-708.26 293.25,-680.88 329.81,-655.82 302.55,-623.26 329.25,-587.88 337.16,-577.39 348.28,-568.21 358.6,-561.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="360.38,-564.07 366.84,-555.67 356.55,-558.21 360.38,-564.07"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node22 -->
-<g id="edge38_Node000024_Node000022" class="edge">
-<title>Node24&#45;&gt;Node22</title>
-<g id="a_edge38_Node000024_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.06,-514.83C136.36,-517.61 143,-521.26 148.25,-525.88 170.77,-545.64 163.23,-561.52 184.25,-582.88 186.63,-585.29 189.2,-587.62 191.88,-589.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.48,-592.44 199.54,-595.77 193.75,-586.89 189.48,-592.44"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node5 -->
-<g id="edge40_Node000025_Node000005" class="edge">
-<title>Node25&#45;&gt;Node5</title>
-<g id="a_edge40_Node000025_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.29,-462.89C142.12,-458.38 157.63,-452.46 173.17,-446.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.38,-449.81 182.47,-442.98 171.88,-443.27 174.38,-449.81"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node6 -->
-<g id="edge42_Node000025_Node000006" class="edge">
-<title>Node25&#45;&gt;Node6</title>
-<g id="a_edge42_Node000025_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.18,-470.57C169.47,-470.01 256.16,-468.75 317.75,-467.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.48,-471.37 327.43,-467.72 317.38,-464.37 317.48,-471.37"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node7 -->
-<g id="edge41_Node000025_Node000007" class="edge">
-<title>Node25&#45;&gt;Node7</title>
-<g id="a_edge41_Node000025_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.25,-460.8C126.98,-450.42 140.14,-433.48 148.25,-416.88 173.25,-365.69 158.17,-344.51 184.25,-293.88 191.2,-280.39 200.99,-266.96 210.3,-255.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.81,-258.09 216.62,-248.21 207.48,-253.56 212.81,-258.09"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node15 -->
-<g id="edge43_Node000025_Node000015" class="edge">
-<title>Node25&#45;&gt;Node15</title>
-<g id="a_edge43_Node000025_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.2,-460.77C137.23,-438.98 182.76,-386.84 211.82,-353.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.25,-356.1 218.19,-346.27 208.98,-351.5 214.25,-356.1"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node20 -->
-<g id="edge44_Node000025_Node000020" class="edge">
-<title>Node25&#45;&gt;Node20</title>
-<g id="a_edge44_Node000025_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.29,-478.86C142.12,-483.37 157.63,-489.29 173.17,-495.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.88,-498.48 182.47,-498.77 174.38,-491.94 171.88,-498.48"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node21 -->
-<g id="edge45_Node000025_Node000021" class="edge">
-<title>Node25&#45;&gt;Node21</title>
-<g id="a_edge45_Node000025_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.15,-477.74C136.45,-480.51 143.07,-484.18 148.25,-488.88 171.59,-510 156.91,-534.27 184.25,-549.88 233.44,-577.96 300.95,-568.61 344.06,-557.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.76,-561.32 353.54,-555.38 342.98,-554.55 344.76,-561.32"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node22 -->
-<g id="edge46_Node000025_Node000022" class="edge">
-<title>Node25&#45;&gt;Node22</title>
-<g id="a_edge46_Node000025_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.24,-477.07C136.69,-479.82 143.38,-483.66 148.25,-488.88 178.79,-521.56 156.17,-548.05 184.25,-582.88 186.05,-585.11 188.03,-587.24 190.13,-589.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.74,-591.84 197.62,-595.67 192.28,-586.51 187.74,-591.84"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 9f970e70c..000000000
--- a/d5/d83/lcm__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,683 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="598pt" height="711pt"
- viewBox="0.00 0.00 598.00 710.62" 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 706.62)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-517.5 0,-517.5 0,-498.25 32.5,-498.25 32.5,-517.5"/>
-<text text-anchor="middle" x="16.25" y="-504" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.12,-591.5 81.62,-591.5 81.62,-572.25 135.12,-572.25 135.12,-591.5"/>
-<text text-anchor="middle" x="108.38" y="-578" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.27,-517.68C33.36,-529.81 50.21,-550.49 68.5,-563.88 69.65,-564.71 70.84,-565.53 72.07,-566.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.13,-569.24 80.56,-571.1 73.56,-563.14 70.13,-569.24"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="148.25,-554.5 68.5,-554.5 68.5,-535.25 148.25,-535.25 148.25,-554.5"/>
-<text text-anchor="middle" x="108.38" y="-541" font-family="Helvetica,sans-Serif" font-size="10.00">math::lcmSum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.95,-514.32C43.85,-518.8 58.82,-524.94 72.47,-530.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.06,-533.75 81.64,-534.31 73.72,-527.27 71.06,-533.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-407.5 86.88,-407.5 86.88,-388.25 129.88,-388.25 129.88,-407.5"/>
-<text text-anchor="middle" x="108.38" y="-394" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.25,-498.11C40.24,-479.81 72.8,-440.07 92.12,-416.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.68,-418.9 98.31,-408.94 89.26,-414.46 94.68,-418.9"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-517.5 86.88,-517.5 86.88,-498.25 129.88,-498.25 129.88,-517.5"/>
-<text text-anchor="middle" x="108.38" y="-504" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node24 -->
-<g id="edge31_Node000001_Node000024" class="edge">
-<title>Node1&#45;&gt;Node24</title>
-<g id="a_edge31_Node000001_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.95,-507.88C44.53,-507.88 60.7,-507.88 75.01,-507.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.94,-511.38 84.94,-507.88 74.94,-504.38 74.94,-511.38"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-480.5 86.88,-480.5 86.88,-461.25 129.88,-461.25 129.88,-480.5"/>
-<text text-anchor="middle" x="108.38" y="-467" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node25 -->
-<g id="edge39_Node000001_Node000025" class="edge">
-<title>Node1&#45;&gt;Node25</title>
-<g id="a_edge39_Node000001_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.95,-501.43C44.76,-496.58 61.35,-489.77 75.87,-483.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.13,-487.08 85.05,-480.04 74.47,-480.6 77.13,-487.08"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" target="_top" xlink:title="Adds an undirected edge from node u to node v in the tree.">
-<polygon fill="white" stroke="#666666" points="293.25,-442.75 184.25,-442.75 184.25,-401 293.25,-401 293.25,-442.75"/>
-<text text-anchor="start" x="192.25" y="-429.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="192.25" y="-418" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="238.75" y="-406.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.29,-401.78C142.01,-403.98 157.33,-406.84 172.72,-409.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.92,-413.13 182.4,-411.53 173.21,-406.25 171.92,-413.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="445,-476.5 329.25,-476.5 329.25,-457.25 445,-457.25 445,-476.5"/>
-<text text-anchor="middle" x="387.12" y="-463" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge19_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge19_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.87,-388.03C121.22,-366.23 144.65,-314.16 184.25,-293.88 227.37,-271.79 255.18,-263.91 293.25,-293.88 346.78,-336.01 285.14,-390.96 329.25,-442.88 331.94,-446.04 335.12,-448.8 338.58,-451.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.53,-454.06 346.94,-456 340.01,-447.99 336.53,-454.06"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="293.25,-246.75 184.25,-246.75 184.25,-205 293.25,-205 293.25,-246.75"/>
-<text text-anchor="start" x="192.25" y="-233.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="192.25" y="-222" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="238.75" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::init</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.87,-387.89C121.71,-363.76 146.91,-301.29 184.25,-260.88 186.4,-258.54 188.74,-256.3 191.2,-254.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="193.09,-257.12 198.73,-248.15 188.73,-251.64 193.09,-257.12"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" target="_top" xlink:title="This function returns the sum of node values in the simple path from from node_1 to node_2.">
-<polygon fill="white" stroke="#666666" points="293.25,-344.75 184.25,-344.75 184.25,-303 293.25,-303 293.25,-344.75"/>
-<text text-anchor="start" x="192.25" y="-331.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="192.25" y="-320" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="238.75" y="-308.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::query</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node15 -->
-<g id="edge20_Node000004_Node000015" class="edge">
-<title>Node4&#45;&gt;Node15</title>
-<g id="a_edge20_Node000004_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.69,-387.9C143.14,-378.41 168.63,-363.72 191.04,-350.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.53,-353.98 199.44,-345.96 189.03,-347.92 192.53,-353.98"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" target="_top" xlink:title="Set the values for all the nodes.">
-<polygon fill="white" stroke="#666666" points="293.25,-540.75 184.25,-540.75 184.25,-499 293.25,-499 293.25,-540.75"/>
-<text text-anchor="start" x="192.25" y="-527.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="192.25" y="-516" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="238.75" y="-504.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::set_node_val</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node20 -->
-<g id="edge26_Node000004_Node000020" class="edge">
-<title>Node4&#45;&gt;Node20</title>
-<g id="a_edge26_Node000004_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.88,-407.86C138.77,-425.81 179.11,-464.14 207.31,-490.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="204.87,-493.46 214.53,-497.81 209.7,-488.39 204.87,-493.46"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="430.38,-554.5 343.88,-554.5 343.88,-535.25 430.38,-535.25 430.38,-554.5"/>
-<text text-anchor="middle" x="387.12" y="-541" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node21 -->
-<g id="edge28_Node000004_Node000021" class="edge">
-<title>Node4&#45;&gt;Node21</title>
-<g id="a_edge28_Node000004_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.35,-389.83C166.99,-377.24 243.51,-357.66 293.25,-391.88 330.11,-417.23 305.24,-448.12 329.25,-485.88 339.23,-501.56 353.84,-516.61 365.75,-527.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="363.29,-530.08 373.09,-534.11 367.95,-524.85 363.29,-530.08"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" target="_top" xlink:title="This function updates the value at node with val.">
-<polygon fill="white" stroke="#666666" points="293.25,-638.75 184.25,-638.75 184.25,-597 293.25,-597 293.25,-638.75"/>
-<text text-anchor="start" x="192.25" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="192.25" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="238.75" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::update</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node22 -->
-<g id="edge29_Node000004_Node000022" class="edge">
-<title>Node4&#45;&gt;Node22</title>
-<g id="a_edge29_Node000004_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.7,-407.68C126.24,-418.11 139.48,-435.35 148.25,-451.88 170.01,-492.86 161.62,-509.36 184.25,-549.88 191.71,-563.22 201.69,-576.71 211.01,-588.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.2,-590.2 217.32,-595.61 213.56,-585.7 208.2,-590.2"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.42,-438.38C309.57,-443.34 327.09,-448.73 342.51,-453.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="341.28,-456.75 351.87,-456.34 343.34,-450.06 341.28,-456.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="590,-285.75 481,-285.75 481,-244 590,-244 590,-285.75"/>
-<text text-anchor="start" x="489" y="-272.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="489" y="-261" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="535.5" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.57,-228.97C335.11,-231.82 393.92,-236.84 445,-244.88 453,-246.13 461.36,-247.68 469.61,-249.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="468.77,-252.76 479.28,-251.39 470.21,-245.91 468.77,-252.76"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" target="_top" xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="white" stroke="#666666" points="441.62,-41.75 332.62,-41.75 332.62,0 441.62,0 441.62,-41.75"/>
-<text text-anchor="start" x="340.62" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="340.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="387.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.94,-204.59C263.23,-172.94 292.93,-112.53 329.25,-68.88 334.94,-62.03 341.69,-55.39 348.52,-49.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.62,-52.16 355.97,-43.01 346.09,-46.82 350.62,-52.16"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" target="_top" xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="white" stroke="#666666" points="441.62,-295.75 332.62,-295.75 332.62,-254 441.62,-254 441.62,-295.75"/>
-<text text-anchor="start" x="340.62" y="-282.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="340.62" y="-271" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="387.12" y="-259.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node10 -->
-<g id="edge10_Node000007_Node000010" class="edge">
-<title>Node7&#45;&gt;Node10</title>
-<g id="a_edge10_Node000007_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.42,-243.84C302.57,-246.91 312.16,-250.11 321.55,-253.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.43,-256.57 331.02,-256.43 322.65,-249.94 320.43,-256.57"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" target="_top" xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="white" stroke="#666666" points="441.62,-179.75 332.62,-179.75 332.62,-138 441.62,-138 441.62,-179.75"/>
-<text text-anchor="start" x="340.62" y="-166.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="340.62" y="-155" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="387.12" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node11 -->
-<g id="edge12_Node000007_Node000011" class="edge">
-<title>Node7&#45;&gt;Node11</title>
-<g id="a_edge12_Node000007_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M286.06,-204.68C299.81,-198.38 315.03,-191.42 329.36,-184.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="330.6,-188.14 338.23,-180.8 327.68,-181.78 330.6,-188.14"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="441.62,-119.75 332.62,-119.75 332.62,-78 441.62,-78 441.62,-119.75"/>
-<text text-anchor="start" x="340.62" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="340.62" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="387.12" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node12 -->
-<g id="edge14_Node000007_Node000012" class="edge">
-<title>Node7&#45;&gt;Node12</title>
-<g id="a_edge14_Node000007_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.81,-204.61C272.49,-183.53 300.19,-151.22 329.25,-128.88 330.37,-128.01 331.52,-127.16 332.69,-126.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.33,-129.44 340.76,-121.01 330.48,-123.59 334.33,-129.44"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node9 -->
-<g id="edge9_Node000009_Node000009" class="edge">
-<title>Node9&#45;&gt;Node9</title>
-<g id="a_edge9_Node000009_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M359.74,-42.07C357.13,-51.55 366.26,-59.75 387.12,-59.75 399.19,-59.75 407.33,-57.01 411.54,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.84,-54.1 414.11,-43.53 408.09,-52.24 414.84,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node10 -->
-<g id="edge11_Node000010_Node000010" class="edge">
-<title>Node10&#45;&gt;Node10</title>
-<g id="a_edge11_Node000010_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M359.74,-296.07C357.13,-305.55 366.26,-313.75 387.12,-313.75 399.19,-313.75 407.33,-311.01 411.54,-306.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.84,-308.1 414.11,-297.53 408.09,-306.24 414.84,-308.1"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node11 -->
-<g id="edge13_Node000011_Node000011" class="edge">
-<title>Node11&#45;&gt;Node11</title>
-<g id="a_edge13_Node000011_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M359.74,-180.07C357.13,-189.55 366.26,-197.75 387.12,-197.75 399.19,-197.75 407.33,-195.01 411.54,-190.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.84,-192.1 414.11,-181.53 408.09,-190.24 414.84,-192.1"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="590,-80.75 481,-80.75 481,-39 590,-39 590,-80.75"/>
-<text text-anchor="start" x="489" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="489" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="535.5" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge15_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge15_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M441.8,-84.57C450.95,-82.14 460.53,-79.58 469.93,-77.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="470.61,-80.52 479.37,-74.56 468.81,-73.76 470.61,-80.52"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="590,-158.75 481,-158.75 481,-117 590,-117 590,-158.75"/>
-<text text-anchor="start" x="489" y="-145.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="489" y="-134" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="535.5" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node14 -->
-<g id="edge17_Node000012_Node000014" class="edge">
-<title>Node12&#45;&gt;Node14</title>
-<g id="a_edge17_Node000012_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M441.8,-113.18C450.95,-115.61 460.53,-118.17 469.93,-120.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="468.81,-123.99 479.37,-123.19 470.61,-117.23 468.81,-123.99"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node13 -->
-<g id="edge16_Node000013_Node000013" class="edge">
-<title>Node13&#45;&gt;Node13</title>
-<g id="a_edge16_Node000013_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M508.11,-81.07C505.51,-90.55 514.63,-98.75 535.5,-98.75 547.56,-98.75 555.7,-96.01 559.92,-91.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="563.21,-93.1 562.48,-82.53 556.46,-91.24 563.21,-93.1"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node14 -->
-<g id="edge18_Node000014_Node000014" class="edge">
-<title>Node14&#45;&gt;Node14</title>
-<g id="a_edge18_Node000014_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M508.11,-159.07C505.51,-168.55 514.63,-176.75 535.5,-176.75 547.56,-176.75 555.7,-174.01 559.92,-169.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="563.21,-171.1 562.48,-160.53 556.46,-169.24 563.21,-171.1"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" target="_top" xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="white" stroke="#666666" points="441.62,-373.75 332.62,-373.75 332.62,-332 441.62,-332 441.62,-373.75"/>
-<text text-anchor="start" x="340.62" y="-360.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="340.62" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="387.12" y="-337.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge21_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge21_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.42,-334.51C302.47,-336.3 311.95,-338.18 321.25,-340.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.48,-343.44 330.97,-341.95 321.84,-336.57 320.48,-343.44"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" target="_top" xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="white" stroke="#666666" points="441.62,-433.75 332.62,-433.75 332.62,-392 441.62,-392 441.62,-433.75"/>
-<text text-anchor="start" x="340.62" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="340.62" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="387.12" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node18 -->
-<g id="edge24_Node000015_Node000018" class="edge">
-<title>Node15&#45;&gt;Node18</title>
-<g id="a_edge24_Node000015_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M272.32,-345.12C279.23,-349.65 286.49,-354.41 293.25,-358.88 309.3,-369.47 312.72,-373.04 329.25,-382.88 331.08,-383.97 332.96,-385.06 334.87,-386.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="332.78,-389 343.21,-390.83 336.2,-382.89 332.78,-389"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node8 -->
-<g id="edge22_Node000016_Node000008" class="edge">
-<title>Node16&#45;&gt;Node8</title>
-<g id="a_edge22_Node000016_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M429.68,-331.51C434.88,-328.68 440.09,-325.75 445,-322.88 461.12,-313.43 478.43,-302.42 493.5,-292.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.36,-295.51 501.78,-287.08 491.5,-289.67 495.36,-295.51"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="564.88,-362.5 506.12,-362.5 506.12,-343.25 564.88,-343.25 564.88,-362.5"/>
-<text text-anchor="middle" x="535.5" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge23_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge23_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M441.8,-352.88C459.26,-352.88 478.33,-352.88 494.6,-352.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="494.38,-356.38 504.38,-352.88 494.38,-349.38 494.38,-356.38"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="590,-433.75 481,-433.75 481,-392 590,-392 590,-433.75"/>
-<text text-anchor="start" x="489" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="489" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="535.5" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node19 -->
-<g id="edge25_Node000018_Node000019" class="edge">
-<title>Node18&#45;&gt;Node19</title>
-<g id="a_edge25_Node000018_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M441.8,-412.88C450.85,-412.88 460.33,-412.88 469.62,-412.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="469.32,-416.38 479.32,-412.88 469.32,-409.38 469.32,-416.38"/>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node21 -->
-<g id="edge27_Node000020_Node000021" class="edge">
-<title>Node20&#45;&gt;Node21</title>
-<g id="a_edge27_Node000020_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.42,-529.04C306.04,-531.2 319.5,-533.5 332.13,-535.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.51,-539.1 341.96,-537.33 332.69,-532.2 331.51,-539.1"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" target="_top" xlink:title="Update the value at a node.">
-<polygon fill="white" stroke="#666666" points="441.62,-638.75 332.62,-638.75 332.62,-597 441.62,-597 441.62,-638.75"/>
-<text text-anchor="start" x="340.62" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="340.62" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="387.12" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::update</text>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node23 -->
-<g id="edge30_Node000022_Node000023" class="edge">
-<title>Node22&#45;&gt;Node23</title>
-<g id="a_edge30_Node000022_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.42,-617.88C302.47,-617.88 311.95,-617.88 321.25,-617.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.94,-621.38 330.94,-617.88 320.94,-614.38 320.94,-621.38"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node5 -->
-<g id="edge32_Node000024_Node000005" class="edge">
-<title>Node24&#45;&gt;Node5</title>
-<g id="a_edge32_Node000024_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.98,-499.34C136.01,-496.58 142.51,-493.33 148.25,-489.88 167.72,-478.16 187.99,-463.03 204.31,-450.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.19,-453.01 211.76,-444 201.79,-447.57 206.19,-453.01"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node6 -->
-<g id="edge34_Node000024_Node000006" class="edge">
-<title>Node24&#45;&gt;Node6</title>
-<g id="a_edge34_Node000024_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.08,-513.68C136.67,-516.43 143.49,-520.36 148.25,-525.88 185.19,-568.67 138.97,-614.03 184.25,-647.88 223.05,-676.88 254.45,-676.88 293.25,-647.88 338.53,-614.03 300.82,-574.74 329.25,-525.88 338.49,-510 352.87,-495.13 364.86,-484.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="367.04,-487.03 372.3,-477.83 362.45,-481.75 367.04,-487.03"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node7 -->
-<g id="edge33_Node000024_Node000007" class="edge">
-<title>Node24&#45;&gt;Node7</title>
-<g id="a_edge33_Node000024_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.01,-502.52C136.76,-499.79 143.69,-495.75 148.25,-489.88 202.51,-419.87 147.8,-374.6 184.25,-293.88 190.44,-280.16 199.99,-266.76 209.31,-255.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="211.78,-258.02 215.68,-248.17 206.49,-253.44 211.78,-258.02"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node15 -->
-<g id="edge35_Node000024_Node000015" class="edge">
-<title>Node24&#45;&gt;Node15</title>
-<g id="a_edge35_Node000024_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.28,-501.72C136.73,-498.97 143.41,-495.13 148.25,-489.88 179.7,-455.75 161.62,-432.39 184.25,-391.88 191.71,-378.53 201.69,-365.04 211.01,-353.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.56,-356.05 217.32,-346.14 208.2,-351.55 213.56,-356.05"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node20 -->
-<g id="edge36_Node000024_Node000020" class="edge">
-<title>Node24&#45;&gt;Node20</title>
-<g id="a_edge36_Node000024_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.29,-509.83C142.01,-510.93 157.33,-512.36 172.72,-513.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.09,-517.25 182.38,-514.7 172.75,-510.28 172.09,-517.25"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node21 -->
-<g id="edge37_Node000024_Node000021" class="edge">
-<title>Node24&#45;&gt;Node21</title>
-<g id="a_edge37_Node000024_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.27,-513.52C136.88,-516.26 143.65,-520.22 148.25,-525.88 192.87,-580.75 128.87,-636.89 184.25,-680.88 222.18,-711.01 253.29,-708.26 293.25,-680.88 329.81,-655.82 302.55,-623.26 329.25,-587.88 337.16,-577.39 348.28,-568.21 358.6,-561.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="360.38,-564.07 366.84,-555.67 356.55,-558.21 360.38,-564.07"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node22 -->
-<g id="edge38_Node000024_Node000022" class="edge">
-<title>Node24&#45;&gt;Node22</title>
-<g id="a_edge38_Node000024_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.06,-514.83C136.36,-517.61 143,-521.26 148.25,-525.88 170.77,-545.64 163.23,-561.52 184.25,-582.88 186.63,-585.29 189.2,-587.62 191.88,-589.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.48,-592.44 199.54,-595.77 193.75,-586.89 189.48,-592.44"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node5 -->
-<g id="edge40_Node000025_Node000005" class="edge">
-<title>Node25&#45;&gt;Node5</title>
-<g id="a_edge40_Node000025_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.29,-462.89C142.12,-458.38 157.63,-452.46 173.17,-446.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.38,-449.81 182.47,-442.98 171.88,-443.27 174.38,-449.81"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node6 -->
-<g id="edge42_Node000025_Node000006" class="edge">
-<title>Node25&#45;&gt;Node6</title>
-<g id="a_edge42_Node000025_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.18,-470.57C169.47,-470.01 256.16,-468.75 317.75,-467.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.48,-471.37 327.43,-467.72 317.38,-464.37 317.48,-471.37"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node7 -->
-<g id="edge41_Node000025_Node000007" class="edge">
-<title>Node25&#45;&gt;Node7</title>
-<g id="a_edge41_Node000025_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.25,-460.8C126.98,-450.42 140.14,-433.48 148.25,-416.88 173.25,-365.69 158.17,-344.51 184.25,-293.88 191.2,-280.39 200.99,-266.96 210.3,-255.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.81,-258.09 216.62,-248.21 207.48,-253.56 212.81,-258.09"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node15 -->
-<g id="edge43_Node000025_Node000015" class="edge">
-<title>Node25&#45;&gt;Node15</title>
-<g id="a_edge43_Node000025_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.2,-460.77C137.23,-438.98 182.76,-386.84 211.82,-353.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.25,-356.1 218.19,-346.27 208.98,-351.5 214.25,-356.1"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node20 -->
-<g id="edge44_Node000025_Node000020" class="edge">
-<title>Node25&#45;&gt;Node20</title>
-<g id="a_edge44_Node000025_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.29,-478.86C142.12,-483.37 157.63,-489.29 173.17,-495.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.88,-498.48 182.47,-498.77 174.38,-491.94 171.88,-498.48"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node21 -->
-<g id="edge45_Node000025_Node000021" class="edge">
-<title>Node25&#45;&gt;Node21</title>
-<g id="a_edge45_Node000025_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.15,-477.74C136.45,-480.51 143.07,-484.18 148.25,-488.88 171.59,-510 156.91,-534.27 184.25,-549.88 233.44,-577.96 300.95,-568.61 344.06,-557.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.76,-561.32 353.54,-555.38 342.98,-554.55 344.76,-561.32"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node22 -->
-<g id="edge46_Node000025_Node000022" class="edge">
-<title>Node25&#45;&gt;Node22</title>
-<g id="a_edge46_Node000025_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.24,-477.07C136.69,-479.82 143.38,-483.66 148.25,-488.88 178.79,-521.56 156.17,-548.05 184.25,-582.88 186.05,-585.11 188.03,-587.24 190.13,-589.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.74,-591.84 197.62,-595.67 192.28,-586.51 187.74,-591.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 273ea2896..000000000
--- a/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,75 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,252,55,278"/>
-<area shape="rect" id="Node000002" href="$d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title=" " alt="" coords="103,252,146,278"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,262,87,262,87,268,55,268"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="212,153,283,179"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="133,250,158,220,192,188,197,185,200,189,196,192,162,224,137,254"/>
-<area shape="rect" id="Node000004" href="$dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244" title=" " alt="" coords="194,203,300,228"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="146,254,198,232,200,237,148,259"/>
-<area shape="rect" id="Node000005" href="$d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" title=" " alt="" coords="218,399,276,424"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="138,276,228,385,223,389,134,280"/>
-<area shape="rect" id="Node000025" href="$d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d" title=" " alt="" coords="218,252,276,278"/>
-<area shape="poly" id="edge32_Node000002_Node000025" title=" " alt="" coords="147,262,203,262,203,268,147,268"/>
-<area shape="rect" id="Node000026" href="$d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a" title=" " alt="" coords="218,301,276,327"/>
-<area shape="poly" id="edge40_Node000002_Node000026" title=" " alt="" coords="148,271,205,295,203,300,146,276"/>
-<area shape="rect" id="Node000006" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" title="Adds an undirected edge from node u to node v in the tree." alt="" coords="348,352,494,407"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="276,404,332,393,333,398,277,409"/>
-<area shape="rect" id="Node000007" 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="542,307,696,332"/>
-<area shape="poly" id="edge20_Node000005_Node000007" title=" " alt="" coords="256,424,268,452,287,487,315,521,350,548,389,566,424,574,457,569,492,548,512,527,520,505,522,481,520,456,517,430,517,404,523,377,540,350,552,339,556,343,544,353,528,379,522,404,522,430,525,456,527,481,526,506,516,530,495,552,459,574,423,579,387,571,347,553,311,525,283,490,263,454,251,426"/>
-<area shape="rect" id="Node000008" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" title="This function must be called after the tree adjacency list and node values are populated The function..." alt="" coords="348,613,494,669"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="256,424,289,500,316,548,350,593,359,601,356,605,346,596,312,551,284,503,251,426"/>
-<area shape="rect" id="Node000016" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" title="This function returns the sum of node values in the simple path from from node_1 to node_2." alt="" coords="348,482,494,538"/>
-<area shape="poly" id="edge21_Node000005_Node000016" title=" " alt="" coords="273,423,359,472,356,477,270,427"/>
-<area shape="rect" id="Node000021" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" title="Set the values for all the nodes." alt="" coords="348,221,494,277"/>
-<area shape="poly" id="edge27_Node000005_Node000021" title=" " alt="" coords="261,396,377,286,381,289,264,400"/>
-<area shape="rect" id="Node000022" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="561,203,676,228"/>
-<area shape="poly" id="edge29_Node000005_Node000022" title=" " alt="" coords="277,420,322,433,379,442,409,442,438,439,466,431,492,417,507,405,515,392,521,363,525,330,530,312,539,293,563,262,588,237,592,241,567,266,544,296,535,314,530,331,527,364,520,394,511,408,495,422,468,436,439,444,409,448,378,447,321,438,276,425"/>
-<area shape="rect" id="Node000023" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" title="This function updates the value at node with val." alt="" coords="348,90,494,146"/>
-<area shape="poly" id="edge30_Node000005_Node000023" title=" " alt="" coords="257,397,278,371,298,338,313,303,321,273,330,244,346,208,382,156,386,160,351,210,335,245,326,275,318,305,303,341,282,374,262,400"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="493,355,559,335,560,340,495,360"/>
-<area shape="rect" id="Node000009" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" title="Function that specifies the type of operation involved when segments are combined." alt="" coords="744,561,889,617"/>
-<area shape="poly" id="edge8_Node000008_Node000009" title=" " alt="" coords="494,634,590,626,696,613,728,607,729,612,696,618,591,632,494,640"/>
-<area shape="rect" id="Node000010" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)" alt="" coords="546,886,692,942"/>
-<area shape="poly" id="edge9_Node000008_Node000010" title=" " alt="" coords="437,668,479,753,509,802,544,849,569,874,565,878,540,852,505,805,475,755,432,671"/>
-<area shape="rect" id="Node000011" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" title="Utility function to lable the nodes so that heavy chains have a contigous lable." alt="" coords="546,548,692,603"/>
-<area shape="poly" id="edge11_Node000008_Node000011" title=" " alt="" coords="493,615,531,602,532,607,495,620"/>
-<area shape="rect" id="Node000012" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" title="Utility function to assign highest parent that can be reached though heavy chains." alt="" coords="546,702,692,758"/>
-<area shape="poly" id="edge13_Node000008_Node000012" title=" " alt="" coords="485,667,543,693,541,698,483,672"/>
-<area shape="rect" id="Node000013" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" title="This function must be called after the tree adjacency list and node values are populated The function..." alt="" coords="546,782,692,838"/>
-<area shape="poly" id="edge15_Node000008_Node000013" title=" " alt="" coords="446,668,488,717,543,768,548,772,545,776,540,772,485,721,442,671"/>
-<area shape="poly" id="edge10_Node000010_Node000010" title=" " alt="" coords="580,886,580,876,587,867,600,862,619,860,640,862,653,869,650,874,638,868,619,865,602,867,590,872,585,878,585,886"/>
-<area shape="poly" id="edge12_Node000011_Node000011" title=" " alt="" coords="580,547,580,537,587,529,600,523,619,521,640,524,653,531,650,535,638,529,619,526,602,528,590,533,585,539,585,547"/>
-<area shape="poly" id="edge14_Node000012_Node000012" title=" " alt="" coords="580,702,580,692,587,683,600,678,619,676,640,678,653,685,650,690,638,684,619,681,602,683,590,688,585,694,585,702"/>
-<area shape="rect" id="Node000014" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" title="Utility function to populate the t_par vector." alt="" coords="744,834,889,890"/>
-<area shape="poly" id="edge16_Node000013_Node000014" title=" " alt="" coords="692,827,730,837,729,842,691,832"/>
-<area shape="rect" id="Node000015" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" title="Utility function to compute sub&#45;tree sizes." alt="" coords="744,730,889,786"/>
-<area shape="poly" id="edge18_Node000013_Node000015" title=" " alt="" coords="691,789,729,779,730,784,692,794"/>
-<area shape="poly" id="edge17_Node000014_Node000014" title=" " alt="" coords="777,834,778,824,785,815,798,810,817,808,838,810,850,817,848,822,836,816,817,813,799,815,788,820,783,826,783,834"/>
-<area shape="poly" id="edge19_Node000015_Node000015" title=" " alt="" coords="777,730,778,720,785,711,798,706,817,704,838,706,850,713,848,718,836,712,817,709,799,711,788,716,783,722,783,730"/>
-<area shape="rect" id="Node000017" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" title="Utility function to break down a path query into two chain queries." alt="" coords="546,444,692,499"/>
-<area shape="poly" id="edge22_Node000016_Node000017" title=" " alt="" coords="493,494,530,486,532,491,494,499"/>
-<area shape="rect" id="Node000019" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" title="The function returns the least common ancestor of two nodes." alt="" coords="546,364,692,419"/>
-<area shape="poly" id="edge25_Node000016_Node000019" title=" " alt="" coords="464,480,492,461,540,429,548,425,551,430,543,434,495,466,467,484"/>
-<area shape="poly" id="edge23_Node000017_Node000009" title=" " alt="" coords="677,498,697,509,762,550,759,554,695,514,674,502"/>
-<area shape="rect" id="Node000018" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="778,459,856,484"/>
-<area shape="poly" id="edge24_Node000017_Node000018" title=" " alt="" coords="692,469,762,469,762,474,692,474"/>
-<area shape="rect" id="Node000020" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store..." alt="" coords="744,364,889,419"/>
-<area shape="poly" id="edge26_Node000019_Node000020" title=" " alt="" coords="692,389,729,389,729,394,692,394"/>
-<area shape="poly" id="edge28_Node000021_Node000022" title=" " alt="" coords="493,234,545,225,546,231,494,239"/>
-<area shape="rect" id="Node000024" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" title="Update the value at a node." alt="" coords="546,90,692,146"/>
-<area shape="poly" id="edge31_Node000023_Node000024" title=" " alt="" coords="494,116,531,116,531,121,494,121"/>
-<area shape="poly" id="edge33_Node000025_Node000006" title=" " alt="" coords="277,274,302,287,377,340,374,344,299,291,275,279"/>
-<area shape="poly" id="edge35_Node000025_Node000007" title=" " alt="" coords="275,255,298,239,312,218,317,197,317,155,317,134,320,114,329,94,347,76,385,54,421,47,457,54,495,76,514,94,524,113,528,132,529,152,529,194,534,216,544,240,566,269,591,295,587,298,562,273,539,242,529,218,524,195,523,152,523,133,519,115,509,97,492,80,455,59,421,52,387,59,350,80,333,97,325,115,322,135,323,155,323,198,316,221,302,243,278,259"/>
-<area shape="poly" id="edge34_Node000025_Node000008" title=" " alt="" coords="277,270,291,277,302,287,324,321,334,354,337,384,336,414,333,477,338,511,351,549,366,576,384,600,380,603,361,579,346,551,333,513,328,477,331,414,332,384,329,355,319,324,298,291,288,281,275,274"/>
-<area shape="poly" id="edge36_Node000025_Node000016" title=" " alt="" coords="278,271,302,287,324,320,331,351,337,382,351,418,386,469,382,472,346,421,331,384,326,352,319,322,298,291,275,275"/>
-<area shape="poly" id="edge37_Node000025_Node000021" title=" " alt="" coords="276,260,333,254,333,260,277,265"/>
-<area shape="poly" id="edge38_Node000025_Node000022" title=" " alt="" coords="275,255,288,248,298,239,314,213,320,186,320,159,316,133,314,106,315,80,325,56,347,32,384,10,420,3,457,11,495,32,510,46,519,60,525,91,529,123,534,140,544,157,562,176,582,192,579,196,558,180,540,160,529,142,523,124,520,92,514,62,506,49,492,36,455,16,420,8,386,15,350,36,330,58,321,82,319,106,322,132,325,159,325,186,319,214,302,243,291,253,278,260"/>
-<area shape="poly" id="edge39_Node000025_Node000023" title=" " alt="" coords="275,253,299,239,314,221,323,203,331,184,346,163,357,154,360,158,350,167,336,187,328,205,319,223,302,243,277,258"/>
-<area shape="poly" id="edge41_Node000026_Node000006" title=" " alt="" coords="277,322,335,344,333,349,275,327"/>
-<area shape="poly" id="edge43_Node000026_Node000007" title=" " alt="" coords="276,312,526,316,526,321,276,317"/>
-<area shape="poly" id="edge42_Node000026_Node000008" title=" " alt="" coords="262,326,283,352,303,385,320,431,326,468,333,505,351,549,385,600,381,603,346,552,328,507,321,469,314,432,298,387,278,355,258,329"/>
-<area shape="poly" id="edge44_Node000026_Node000016" title=" " alt="" coords="262,326,387,469,383,472,258,330"/>
-<area shape="poly" id="edge45_Node000026_Node000021" title=" " alt="" coords="275,301,333,279,335,284,277,306"/>
-<area shape="poly" id="edge46_Node000026_Node000022" title=" " alt="" coords="275,303,299,288,313,267,320,246,328,225,347,207,373,195,401,187,458,182,513,186,562,196,561,201,513,191,458,187,402,192,375,200,350,211,332,228,325,248,318,270,302,292,278,307"/>
-<area shape="poly" id="edge47_Node000026_Node000023" title=" " alt="" coords="275,304,299,288,310,273,317,258,323,228,328,197,335,181,346,163,354,155,358,158,350,167,340,183,333,199,328,229,322,260,315,276,302,292,278,308"/>
-</map>
diff --git a/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 2368eff14..000000000
--- a/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0b85e68f3e10681e864547e04fe383fb
\ No newline at end of file
diff --git a/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 6f59d6a2a..000000000
--- a/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,784 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 711 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 671;
-var viewHeight = 711;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-517.5 0,-517.5 0,-498.25 37,-498.25 37,-517.5"/>
-<text text-anchor="middle" x="18.5" y="-504" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-517.5 73,-517.5 73,-498.25 105.5,-498.25 105.5,-517.5"/>
-<text text-anchor="middle" x="89.25" y="-504" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-507.88C44.58,-507.88 53.31,-507.88 61.45,-507.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-511.38 71.2,-507.88 61.2,-504.38 61.2,-511.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="208.12,-591.5 154.62,-591.5 154.62,-572.25 208.12,-572.25 208.12,-591.5"/>
-<text text-anchor="middle" x="181.38" y="-578" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.27,-517.68C106.36,-529.81 123.21,-550.49 141.5,-563.88 142.65,-564.71 143.84,-565.53 145.07,-566.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.13,-569.24 153.56,-571.1 146.56,-563.14 143.13,-569.24"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221.25,-554.5 141.5,-554.5 141.5,-535.25 221.25,-535.25 221.25,-554.5"/>
-<text text-anchor="middle" x="181.38" y="-541" font-family="Helvetica,sans-Serif" font-size="10.00">math::lcmSum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.95,-514.32C116.85,-518.8 131.82,-524.94 145.47,-530.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.06,-533.75 154.64,-534.31 146.72,-527.27 144.06,-533.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="202.88,-407.5 159.88,-407.5 159.88,-388.25 202.88,-388.25 202.88,-407.5"/>
-<text text-anchor="middle" x="181.38" y="-394" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.25,-498.11C113.24,-479.81 145.8,-440.07 165.12,-416.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.68,-418.9 171.31,-408.94 162.26,-414.46 167.68,-418.9"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="202.88,-517.5 159.88,-517.5 159.88,-498.25 202.88,-498.25 202.88,-517.5"/>
-<text text-anchor="middle" x="181.38" y="-504" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node25 -->
-<g id="edge32_Node000002_Node000025" class="edge">
-<title>Node2&#45;&gt;Node25</title>
-<g id="a_edge32_Node000002_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.95,-507.88C117.53,-507.88 133.7,-507.88 148.01,-507.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.94,-511.38 157.94,-507.88 147.94,-504.38 147.94,-511.38"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="202.88,-480.5 159.88,-480.5 159.88,-461.25 202.88,-461.25 202.88,-480.5"/>
-<text text-anchor="middle" x="181.38" y="-467" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node26 -->
-<g id="edge40_Node000002_Node000026" class="edge">
-<title>Node2&#45;&gt;Node26</title>
-<g id="a_edge40_Node000002_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.95,-501.43C117.76,-496.58 134.35,-489.77 148.87,-483.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.13,-487.08 158.05,-480.04 147.47,-480.6 150.13,-487.08"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" target="_top" xlink:title="Adds an undirected edge from node u to node v in the tree.">
-<polygon fill="white" stroke="#666666" points="366.25,-442.75 257.25,-442.75 257.25,-401 366.25,-401 366.25,-442.75"/>
-<text text-anchor="start" x="265.25" y="-429.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="265.25" y="-418" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="311.75" y="-406.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.29,-401.78C215.01,-403.98 230.33,-406.84 245.72,-409.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.92,-413.13 255.4,-411.53 246.21,-406.25 244.92,-413.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="518,-476.5 402.25,-476.5 402.25,-457.25 518,-457.25 518,-476.5"/>
-<text text-anchor="middle" x="460.12" y="-463" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge20_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge20_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.87,-388.03C194.22,-366.23 217.65,-314.16 257.25,-293.88 300.37,-271.79 328.18,-263.91 366.25,-293.88 419.78,-336.01 358.14,-390.96 402.25,-442.88 404.94,-446.04 408.12,-448.8 411.58,-451.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="409.53,-454.06 419.94,-456 413.01,-447.99 409.53,-454.06"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="366.25,-246.75 257.25,-246.75 257.25,-205 366.25,-205 366.25,-246.75"/>
-<text text-anchor="start" x="265.25" y="-233.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="265.25" y="-222" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="311.75" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::init</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.87,-387.89C194.71,-363.76 219.91,-301.29 257.25,-260.88 259.4,-258.54 261.74,-256.3 264.2,-254.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.09,-257.12 271.73,-248.15 261.73,-251.64 266.09,-257.12"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" target="_top" xlink:title="This function returns the sum of node values in the simple path from from node_1 to node_2.">
-<polygon fill="white" stroke="#666666" points="366.25,-344.75 257.25,-344.75 257.25,-303 366.25,-303 366.25,-344.75"/>
-<text text-anchor="start" x="265.25" y="-331.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="265.25" y="-320" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="311.75" y="-308.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::query</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node16 -->
-<g id="edge21_Node000005_Node000016" class="edge">
-<title>Node5&#45;&gt;Node16</title>
-<g id="a_edge21_Node000005_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.69,-387.9C216.14,-378.41 241.63,-363.72 264.04,-350.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.53,-353.98 272.44,-345.96 262.03,-347.92 265.53,-353.98"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" target="_top" xlink:title="Set the values for all the nodes.">
-<polygon fill="white" stroke="#666666" points="366.25,-540.75 257.25,-540.75 257.25,-499 366.25,-499 366.25,-540.75"/>
-<text text-anchor="start" x="265.25" y="-527.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="265.25" y="-516" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="311.75" y="-504.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::set_node_val</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node21 -->
-<g id="edge27_Node000005_Node000021" class="edge">
-<title>Node5&#45;&gt;Node21</title>
-<g id="a_edge27_Node000005_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M192.88,-407.86C211.77,-425.81 252.11,-464.14 280.31,-490.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.87,-493.46 287.53,-497.81 282.7,-488.39 277.87,-493.46"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="503.38,-554.5 416.88,-554.5 416.88,-535.25 503.38,-535.25 503.38,-554.5"/>
-<text text-anchor="middle" x="460.12" y="-541" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node22 -->
-<g id="edge29_Node000005_Node000022" class="edge">
-<title>Node5&#45;&gt;Node22</title>
-<g id="a_edge29_Node000005_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.35,-389.83C239.99,-377.24 316.51,-357.66 366.25,-391.88 403.11,-417.23 378.24,-448.12 402.25,-485.88 412.23,-501.56 426.84,-516.61 438.75,-527.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="436.29,-530.08 446.09,-534.11 440.95,-524.85 436.29,-530.08"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" target="_top" xlink:title="This function updates the value at node with val.">
-<polygon fill="white" stroke="#666666" points="366.25,-638.75 257.25,-638.75 257.25,-597 366.25,-597 366.25,-638.75"/>
-<text text-anchor="start" x="265.25" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="265.25" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="311.75" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::update</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node23 -->
-<g id="edge30_Node000005_Node000023" class="edge">
-<title>Node5&#45;&gt;Node23</title>
-<g id="a_edge30_Node000005_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.7,-407.68C199.24,-418.11 212.48,-435.35 221.25,-451.88 243.01,-492.86 234.62,-509.36 257.25,-549.88 264.71,-563.22 274.69,-576.71 284.01,-588.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.2,-590.2 290.32,-595.61 286.56,-585.7 281.2,-590.2"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M366.42,-438.38C382.57,-443.34 400.09,-448.73 415.51,-453.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.28,-456.75 424.87,-456.34 416.34,-450.06 414.28,-456.75"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="663,-285.75 554,-285.75 554,-244 663,-244 663,-285.75"/>
-<text text-anchor="start" x="562" y="-272.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="562" y="-261" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="608.5" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge8_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge8_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M366.57,-228.97C408.11,-231.82 466.92,-236.84 518,-244.88 526,-246.13 534.36,-247.68 542.61,-249.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="541.77,-252.76 552.28,-251.39 543.21,-245.91 541.77,-252.76"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" target="_top" xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="white" stroke="#666666" points="514.62,-41.75 405.62,-41.75 405.62,0 514.62,0 514.62,-41.75"/>
-<text text-anchor="start" x="413.62" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="413.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="460.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge9_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge9_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.94,-204.59C336.23,-172.94 365.93,-112.53 402.25,-68.88 407.94,-62.03 414.69,-55.39 421.52,-49.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.62,-52.16 428.97,-43.01 419.09,-46.82 423.62,-52.16"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" target="_top" xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="white" stroke="#666666" points="514.62,-295.75 405.62,-295.75 405.62,-254 514.62,-254 514.62,-295.75"/>
-<text text-anchor="start" x="413.62" y="-282.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="413.62" y="-271" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="460.12" y="-259.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node11 -->
-<g id="edge11_Node000008_Node000011" class="edge">
-<title>Node8&#45;&gt;Node11</title>
-<g id="a_edge11_Node000008_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M366.42,-243.84C375.57,-246.91 385.16,-250.11 394.55,-253.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.43,-256.57 404.02,-256.43 395.65,-249.94 393.43,-256.57"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" target="_top" xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="white" stroke="#666666" points="514.62,-179.75 405.62,-179.75 405.62,-138 514.62,-138 514.62,-179.75"/>
-<text text-anchor="start" x="413.62" y="-166.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="413.62" y="-155" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="460.12" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node12 -->
-<g id="edge13_Node000008_Node000012" class="edge">
-<title>Node8&#45;&gt;Node12</title>
-<g id="a_edge13_Node000008_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M359.06,-204.68C372.81,-198.38 388.03,-191.42 402.36,-184.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="403.6,-188.14 411.23,-180.8 400.68,-181.78 403.6,-188.14"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="514.62,-119.75 405.62,-119.75 405.62,-78 514.62,-78 514.62,-119.75"/>
-<text text-anchor="start" x="413.62" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="413.62" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="460.12" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node13 -->
-<g id="edge15_Node000008_Node000013" class="edge">
-<title>Node8&#45;&gt;Node13</title>
-<g id="a_edge15_Node000008_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M328.81,-204.61C345.49,-183.53 373.19,-151.22 402.25,-128.88 403.37,-128.01 404.52,-127.16 405.69,-126.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="407.33,-129.44 413.76,-121.01 403.48,-123.59 407.33,-129.44"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node10 -->
-<g id="edge10_Node000010_Node000010" class="edge">
-<title>Node10&#45;&gt;Node10</title>
-<g id="a_edge10_Node000010_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M432.74,-42.07C430.13,-51.55 439.26,-59.75 460.12,-59.75 472.19,-59.75 480.33,-57.01 484.54,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="487.84,-54.1 487.11,-43.53 481.09,-52.24 487.84,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node11 -->
-<g id="edge12_Node000011_Node000011" class="edge">
-<title>Node11&#45;&gt;Node11</title>
-<g id="a_edge12_Node000011_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M432.74,-296.07C430.13,-305.55 439.26,-313.75 460.12,-313.75 472.19,-313.75 480.33,-311.01 484.54,-306.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="487.84,-308.1 487.11,-297.53 481.09,-306.24 487.84,-308.1"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node12 -->
-<g id="edge14_Node000012_Node000012" class="edge">
-<title>Node12&#45;&gt;Node12</title>
-<g id="a_edge14_Node000012_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M432.74,-180.07C430.13,-189.55 439.26,-197.75 460.12,-197.75 472.19,-197.75 480.33,-195.01 484.54,-190.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="487.84,-192.1 487.11,-181.53 481.09,-190.24 487.84,-192.1"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="663,-80.75 554,-80.75 554,-39 663,-39 663,-80.75"/>
-<text text-anchor="start" x="562" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="562" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="608.5" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge16_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge16_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M514.8,-84.57C523.95,-82.14 533.53,-79.58 542.93,-77.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="543.61,-80.52 552.37,-74.56 541.81,-73.76 543.61,-80.52"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="663,-158.75 554,-158.75 554,-117 663,-117 663,-158.75"/>
-<text text-anchor="start" x="562" y="-145.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="562" y="-134" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="608.5" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node15 -->
-<g id="edge18_Node000013_Node000015" class="edge">
-<title>Node13&#45;&gt;Node15</title>
-<g id="a_edge18_Node000013_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M514.8,-113.18C523.95,-115.61 533.53,-118.17 542.93,-120.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="541.81,-123.99 552.37,-123.19 543.61,-117.23 541.81,-123.99"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node14 -->
-<g id="edge17_Node000014_Node000014" class="edge">
-<title>Node14&#45;&gt;Node14</title>
-<g id="a_edge17_Node000014_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M581.11,-81.07C578.51,-90.55 587.63,-98.75 608.5,-98.75 620.56,-98.75 628.7,-96.01 632.92,-91.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="636.21,-93.1 635.48,-82.53 629.46,-91.24 636.21,-93.1"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node15 -->
-<g id="edge19_Node000015_Node000015" class="edge">
-<title>Node15&#45;&gt;Node15</title>
-<g id="a_edge19_Node000015_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M581.11,-159.07C578.51,-168.55 587.63,-176.75 608.5,-176.75 620.56,-176.75 628.7,-174.01 632.92,-169.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="636.21,-171.1 635.48,-160.53 629.46,-169.24 636.21,-171.1"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" target="_top" xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="white" stroke="#666666" points="514.62,-373.75 405.62,-373.75 405.62,-332 514.62,-332 514.62,-373.75"/>
-<text text-anchor="start" x="413.62" y="-360.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="413.62" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="460.12" y="-337.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge22_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge22_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M366.42,-334.51C375.47,-336.3 384.95,-338.18 394.25,-340.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.48,-343.44 403.97,-341.95 394.84,-336.57 393.48,-343.44"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" target="_top" xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="white" stroke="#666666" points="514.62,-433.75 405.62,-433.75 405.62,-392 514.62,-392 514.62,-433.75"/>
-<text text-anchor="start" x="413.62" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="413.62" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="460.12" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node19 -->
-<g id="edge25_Node000016_Node000019" class="edge">
-<title>Node16&#45;&gt;Node19</title>
-<g id="a_edge25_Node000016_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M345.32,-345.12C352.23,-349.65 359.49,-354.41 366.25,-358.88 382.3,-369.47 385.72,-373.04 402.25,-382.88 404.08,-383.97 405.96,-385.06 407.87,-386.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="405.78,-389 416.21,-390.83 409.2,-382.89 405.78,-389"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node9 -->
-<g id="edge23_Node000017_Node000009" class="edge">
-<title>Node17&#45;&gt;Node9</title>
-<g id="a_edge23_Node000017_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M502.68,-331.51C507.88,-328.68 513.09,-325.75 518,-322.88 534.12,-313.43 551.43,-302.42 566.5,-292.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="568.36,-295.51 574.78,-287.08 564.5,-289.67 568.36,-295.51"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="637.88,-362.5 579.12,-362.5 579.12,-343.25 637.88,-343.25 637.88,-362.5"/>
-<text text-anchor="middle" x="608.5" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge24_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge24_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M514.8,-352.88C532.26,-352.88 551.33,-352.88 567.6,-352.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="567.38,-356.38 577.38,-352.88 567.38,-349.38 567.38,-356.38"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="663,-433.75 554,-433.75 554,-392 663,-392 663,-433.75"/>
-<text text-anchor="start" x="562" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="562" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="608.5" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge26_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge26_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M514.8,-412.88C523.85,-412.88 533.33,-412.88 542.62,-412.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="542.32,-416.38 552.32,-412.88 542.32,-409.38 542.32,-416.38"/>
-</a>
-</g>
-</g>
-<!-- Node21&#45;&gt;Node22 -->
-<g id="edge28_Node000021_Node000022" class="edge">
-<title>Node21&#45;&gt;Node22</title>
-<g id="a_edge28_Node000021_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M366.42,-529.04C379.04,-531.2 392.5,-533.5 405.13,-535.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.51,-539.1 414.96,-537.33 405.69,-532.2 404.51,-539.1"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" target="_top" xlink:title="Update the value at a node.">
-<polygon fill="white" stroke="#666666" points="514.62,-638.75 405.62,-638.75 405.62,-597 514.62,-597 514.62,-638.75"/>
-<text text-anchor="start" x="413.62" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="413.62" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="460.12" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::update</text>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node24 -->
-<g id="edge31_Node000023_Node000024" class="edge">
-<title>Node23&#45;&gt;Node24</title>
-<g id="a_edge31_Node000023_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M366.42,-617.88C375.47,-617.88 384.95,-617.88 394.25,-617.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.94,-621.38 403.94,-617.88 393.94,-614.38 393.94,-621.38"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node6 -->
-<g id="edge33_Node000025_Node000006" class="edge">
-<title>Node25&#45;&gt;Node6</title>
-<g id="a_edge33_Node000025_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.98,-499.34C209.01,-496.58 215.51,-493.33 221.25,-489.88 240.72,-478.16 260.99,-463.03 277.31,-450.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="279.19,-453.01 284.76,-444 274.79,-447.57 279.19,-453.01"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node7 -->
-<g id="edge35_Node000025_Node000007" class="edge">
-<title>Node25&#45;&gt;Node7</title>
-<g id="a_edge35_Node000025_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.08,-513.68C209.67,-516.43 216.49,-520.36 221.25,-525.88 258.19,-568.67 211.97,-614.03 257.25,-647.88 296.05,-676.88 327.45,-676.88 366.25,-647.88 411.53,-614.03 373.82,-574.74 402.25,-525.88 411.49,-510 425.87,-495.13 437.86,-484.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="440.04,-487.03 445.3,-477.83 435.45,-481.75 440.04,-487.03"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node8 -->
-<g id="edge34_Node000025_Node000008" class="edge">
-<title>Node25&#45;&gt;Node8</title>
-<g id="a_edge34_Node000025_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.01,-502.52C209.76,-499.79 216.69,-495.75 221.25,-489.88 275.51,-419.87 220.8,-374.6 257.25,-293.88 263.44,-280.16 272.99,-266.76 282.31,-255.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.78,-258.02 288.68,-248.17 279.49,-253.44 284.78,-258.02"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node16 -->
-<g id="edge36_Node000025_Node000016" class="edge">
-<title>Node25&#45;&gt;Node16</title>
-<g id="a_edge36_Node000025_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.28,-501.72C209.73,-498.97 216.41,-495.13 221.25,-489.88 252.7,-455.75 234.62,-432.39 257.25,-391.88 264.71,-378.53 274.69,-365.04 284.01,-353.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.56,-356.05 290.32,-346.14 281.2,-351.55 286.56,-356.05"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node21 -->
-<g id="edge37_Node000025_Node000021" class="edge">
-<title>Node25&#45;&gt;Node21</title>
-<g id="a_edge37_Node000025_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.29,-509.83C215.01,-510.93 230.33,-512.36 245.72,-513.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="245.09,-517.25 255.38,-514.7 245.75,-510.28 245.09,-517.25"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node22 -->
-<g id="edge38_Node000025_Node000022" class="edge">
-<title>Node25&#45;&gt;Node22</title>
-<g id="a_edge38_Node000025_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.27,-513.52C209.88,-516.26 216.65,-520.22 221.25,-525.88 265.87,-580.75 201.87,-636.89 257.25,-680.88 295.18,-711.01 326.29,-708.26 366.25,-680.88 402.81,-655.82 375.55,-623.26 402.25,-587.88 410.16,-577.39 421.28,-568.21 431.6,-561.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="433.38,-564.07 439.84,-555.67 429.55,-558.21 433.38,-564.07"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node23 -->
-<g id="edge39_Node000025_Node000023" class="edge">
-<title>Node25&#45;&gt;Node23</title>
-<g id="a_edge39_Node000025_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.06,-514.83C209.36,-517.61 216,-521.26 221.25,-525.88 243.77,-545.64 236.23,-561.52 257.25,-582.88 259.63,-585.29 262.2,-587.62 264.88,-589.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.48,-592.44 272.54,-595.77 266.75,-586.89 262.48,-592.44"/>
-</a>
-</g>
-</g>
-<!-- Node26&#45;&gt;Node6 -->
-<g id="edge41_Node000026_Node000006" class="edge">
-<title>Node26&#45;&gt;Node6</title>
-<g id="a_edge41_Node000026_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.29,-462.89C215.12,-458.38 230.63,-452.46 246.17,-446.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="247.38,-449.81 255.47,-442.98 244.88,-443.27 247.38,-449.81"/>
-</a>
-</g>
-</g>
-<!-- Node26&#45;&gt;Node7 -->
-<g id="edge43_Node000026_Node000007" class="edge">
-<title>Node26&#45;&gt;Node7</title>
-<g id="a_edge43_Node000026_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.18,-470.57C242.47,-470.01 329.16,-468.75 390.75,-467.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="390.48,-471.37 400.43,-467.72 390.38,-464.37 390.48,-471.37"/>
-</a>
-</g>
-</g>
-<!-- Node26&#45;&gt;Node8 -->
-<g id="edge42_Node000026_Node000008" class="edge">
-<title>Node26&#45;&gt;Node8</title>
-<g id="a_edge42_Node000026_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.25,-460.8C199.98,-450.42 213.14,-433.48 221.25,-416.88 246.25,-365.69 231.17,-344.51 257.25,-293.88 264.2,-280.39 273.99,-266.96 283.3,-255.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.81,-258.09 289.62,-248.21 280.48,-253.56 285.81,-258.09"/>
-</a>
-</g>
-</g>
-<!-- Node26&#45;&gt;Node16 -->
-<g id="edge44_Node000026_Node000016" class="edge">
-<title>Node26&#45;&gt;Node16</title>
-<g id="a_edge44_Node000026_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.2,-460.77C210.23,-438.98 255.76,-386.84 284.82,-353.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.25,-356.1 291.19,-346.27 281.98,-351.5 287.25,-356.1"/>
-</a>
-</g>
-</g>
-<!-- Node26&#45;&gt;Node21 -->
-<g id="edge45_Node000026_Node000021" class="edge">
-<title>Node26&#45;&gt;Node21</title>
-<g id="a_edge45_Node000026_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.29,-478.86C215.12,-483.37 230.63,-489.29 246.17,-495.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.88,-498.48 255.47,-498.77 247.38,-491.94 244.88,-498.48"/>
-</a>
-</g>
-</g>
-<!-- Node26&#45;&gt;Node22 -->
-<g id="edge46_Node000026_Node000022" class="edge">
-<title>Node26&#45;&gt;Node22</title>
-<g id="a_edge46_Node000026_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.15,-477.74C209.45,-480.51 216.07,-484.18 221.25,-488.88 244.59,-510 229.91,-534.27 257.25,-549.88 306.44,-577.96 373.95,-568.61 417.06,-557.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="417.76,-561.32 426.54,-555.38 415.98,-554.55 417.76,-561.32"/>
-</a>
-</g>
-</g>
-<!-- Node26&#45;&gt;Node23 -->
-<g id="edge47_Node000026_Node000023" class="edge">
-<title>Node26&#45;&gt;Node23</title>
-<g id="a_edge47_Node000026_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.24,-477.07C209.69,-479.82 216.38,-483.66 221.25,-488.88 251.79,-521.56 229.17,-548.05 257.25,-582.88 259.05,-585.11 261.03,-587.24 263.13,-589.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.74,-591.84 270.62,-595.67 265.28,-586.51 260.74,-591.84"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 63472fcc4..000000000
--- a/d5/d83/lcm__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,701 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="671pt" height="711pt"
- viewBox="0.00 0.00 671.00 710.62" 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 706.62)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-517.5 0,-517.5 0,-498.25 37,-498.25 37,-517.5"/>
-<text text-anchor="middle" x="18.5" y="-504" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-517.5 73,-517.5 73,-498.25 105.5,-498.25 105.5,-517.5"/>
-<text text-anchor="middle" x="89.25" y="-504" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-507.88C44.58,-507.88 53.31,-507.88 61.45,-507.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-511.38 71.2,-507.88 61.2,-504.38 61.2,-511.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="208.12,-591.5 154.62,-591.5 154.62,-572.25 208.12,-572.25 208.12,-591.5"/>
-<text text-anchor="middle" x="181.38" y="-578" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.27,-517.68C106.36,-529.81 123.21,-550.49 141.5,-563.88 142.65,-564.71 143.84,-565.53 145.07,-566.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.13,-569.24 153.56,-571.1 146.56,-563.14 143.13,-569.24"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221.25,-554.5 141.5,-554.5 141.5,-535.25 221.25,-535.25 221.25,-554.5"/>
-<text text-anchor="middle" x="181.38" y="-541" font-family="Helvetica,sans-Serif" font-size="10.00">math::lcmSum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.95,-514.32C116.85,-518.8 131.82,-524.94 145.47,-530.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.06,-533.75 154.64,-534.31 146.72,-527.27 144.06,-533.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="202.88,-407.5 159.88,-407.5 159.88,-388.25 202.88,-388.25 202.88,-407.5"/>
-<text text-anchor="middle" x="181.38" y="-394" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.25,-498.11C113.24,-479.81 145.8,-440.07 165.12,-416.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.68,-418.9 171.31,-408.94 162.26,-414.46 167.68,-418.9"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="202.88,-517.5 159.88,-517.5 159.88,-498.25 202.88,-498.25 202.88,-517.5"/>
-<text text-anchor="middle" x="181.38" y="-504" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node25 -->
-<g id="edge32_Node000002_Node000025" class="edge">
-<title>Node2&#45;&gt;Node25</title>
-<g id="a_edge32_Node000002_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.95,-507.88C117.53,-507.88 133.7,-507.88 148.01,-507.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.94,-511.38 157.94,-507.88 147.94,-504.38 147.94,-511.38"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="202.88,-480.5 159.88,-480.5 159.88,-461.25 202.88,-461.25 202.88,-480.5"/>
-<text text-anchor="middle" x="181.38" y="-467" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node26 -->
-<g id="edge40_Node000002_Node000026" class="edge">
-<title>Node2&#45;&gt;Node26</title>
-<g id="a_edge40_Node000002_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.95,-501.43C117.76,-496.58 134.35,-489.77 148.87,-483.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.13,-487.08 158.05,-480.04 147.47,-480.6 150.13,-487.08"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" target="_top" xlink:title="Adds an undirected edge from node u to node v in the tree.">
-<polygon fill="white" stroke="#666666" points="366.25,-442.75 257.25,-442.75 257.25,-401 366.25,-401 366.25,-442.75"/>
-<text text-anchor="start" x="265.25" y="-429.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="265.25" y="-418" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="311.75" y="-406.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.29,-401.78C215.01,-403.98 230.33,-406.84 245.72,-409.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.92,-413.13 255.4,-411.53 246.21,-406.25 244.92,-413.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="518,-476.5 402.25,-476.5 402.25,-457.25 518,-457.25 518,-476.5"/>
-<text text-anchor="middle" x="460.12" y="-463" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge20_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge20_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.87,-388.03C194.22,-366.23 217.65,-314.16 257.25,-293.88 300.37,-271.79 328.18,-263.91 366.25,-293.88 419.78,-336.01 358.14,-390.96 402.25,-442.88 404.94,-446.04 408.12,-448.8 411.58,-451.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="409.53,-454.06 419.94,-456 413.01,-447.99 409.53,-454.06"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="366.25,-246.75 257.25,-246.75 257.25,-205 366.25,-205 366.25,-246.75"/>
-<text text-anchor="start" x="265.25" y="-233.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="265.25" y="-222" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="311.75" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::init</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.87,-387.89C194.71,-363.76 219.91,-301.29 257.25,-260.88 259.4,-258.54 261.74,-256.3 264.2,-254.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.09,-257.12 271.73,-248.15 261.73,-251.64 266.09,-257.12"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" target="_top" xlink:title="This function returns the sum of node values in the simple path from from node_1 to node_2.">
-<polygon fill="white" stroke="#666666" points="366.25,-344.75 257.25,-344.75 257.25,-303 366.25,-303 366.25,-344.75"/>
-<text text-anchor="start" x="265.25" y="-331.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="265.25" y="-320" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="311.75" y="-308.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::query</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node16 -->
-<g id="edge21_Node000005_Node000016" class="edge">
-<title>Node5&#45;&gt;Node16</title>
-<g id="a_edge21_Node000005_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.69,-387.9C216.14,-378.41 241.63,-363.72 264.04,-350.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.53,-353.98 272.44,-345.96 262.03,-347.92 265.53,-353.98"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" target="_top" xlink:title="Set the values for all the nodes.">
-<polygon fill="white" stroke="#666666" points="366.25,-540.75 257.25,-540.75 257.25,-499 366.25,-499 366.25,-540.75"/>
-<text text-anchor="start" x="265.25" y="-527.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="265.25" y="-516" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="311.75" y="-504.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::set_node_val</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node21 -->
-<g id="edge27_Node000005_Node000021" class="edge">
-<title>Node5&#45;&gt;Node21</title>
-<g id="a_edge27_Node000005_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M192.88,-407.86C211.77,-425.81 252.11,-464.14 280.31,-490.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.87,-493.46 287.53,-497.81 282.7,-488.39 277.87,-493.46"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="503.38,-554.5 416.88,-554.5 416.88,-535.25 503.38,-535.25 503.38,-554.5"/>
-<text text-anchor="middle" x="460.12" y="-541" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node22 -->
-<g id="edge29_Node000005_Node000022" class="edge">
-<title>Node5&#45;&gt;Node22</title>
-<g id="a_edge29_Node000005_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.35,-389.83C239.99,-377.24 316.51,-357.66 366.25,-391.88 403.11,-417.23 378.24,-448.12 402.25,-485.88 412.23,-501.56 426.84,-516.61 438.75,-527.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="436.29,-530.08 446.09,-534.11 440.95,-524.85 436.29,-530.08"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" target="_top" xlink:title="This function updates the value at node with val.">
-<polygon fill="white" stroke="#666666" points="366.25,-638.75 257.25,-638.75 257.25,-597 366.25,-597 366.25,-638.75"/>
-<text text-anchor="start" x="265.25" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="265.25" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="311.75" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::update</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node23 -->
-<g id="edge30_Node000005_Node000023" class="edge">
-<title>Node5&#45;&gt;Node23</title>
-<g id="a_edge30_Node000005_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.7,-407.68C199.24,-418.11 212.48,-435.35 221.25,-451.88 243.01,-492.86 234.62,-509.36 257.25,-549.88 264.71,-563.22 274.69,-576.71 284.01,-588.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.2,-590.2 290.32,-595.61 286.56,-585.7 281.2,-590.2"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M366.42,-438.38C382.57,-443.34 400.09,-448.73 415.51,-453.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.28,-456.75 424.87,-456.34 416.34,-450.06 414.28,-456.75"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="663,-285.75 554,-285.75 554,-244 663,-244 663,-285.75"/>
-<text text-anchor="start" x="562" y="-272.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="562" y="-261" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="608.5" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge8_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge8_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M366.57,-228.97C408.11,-231.82 466.92,-236.84 518,-244.88 526,-246.13 534.36,-247.68 542.61,-249.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="541.77,-252.76 552.28,-251.39 543.21,-245.91 541.77,-252.76"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" target="_top" xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="white" stroke="#666666" points="514.62,-41.75 405.62,-41.75 405.62,0 514.62,0 514.62,-41.75"/>
-<text text-anchor="start" x="413.62" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="413.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="460.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge9_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge9_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.94,-204.59C336.23,-172.94 365.93,-112.53 402.25,-68.88 407.94,-62.03 414.69,-55.39 421.52,-49.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.62,-52.16 428.97,-43.01 419.09,-46.82 423.62,-52.16"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" target="_top" xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="white" stroke="#666666" points="514.62,-295.75 405.62,-295.75 405.62,-254 514.62,-254 514.62,-295.75"/>
-<text text-anchor="start" x="413.62" y="-282.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="413.62" y="-271" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="460.12" y="-259.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node11 -->
-<g id="edge11_Node000008_Node000011" class="edge">
-<title>Node8&#45;&gt;Node11</title>
-<g id="a_edge11_Node000008_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M366.42,-243.84C375.57,-246.91 385.16,-250.11 394.55,-253.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.43,-256.57 404.02,-256.43 395.65,-249.94 393.43,-256.57"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" target="_top" xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="white" stroke="#666666" points="514.62,-179.75 405.62,-179.75 405.62,-138 514.62,-138 514.62,-179.75"/>
-<text text-anchor="start" x="413.62" y="-166.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="413.62" y="-155" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="460.12" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node12 -->
-<g id="edge13_Node000008_Node000012" class="edge">
-<title>Node8&#45;&gt;Node12</title>
-<g id="a_edge13_Node000008_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M359.06,-204.68C372.81,-198.38 388.03,-191.42 402.36,-184.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="403.6,-188.14 411.23,-180.8 400.68,-181.78 403.6,-188.14"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="514.62,-119.75 405.62,-119.75 405.62,-78 514.62,-78 514.62,-119.75"/>
-<text text-anchor="start" x="413.62" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="413.62" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="460.12" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node13 -->
-<g id="edge15_Node000008_Node000013" class="edge">
-<title>Node8&#45;&gt;Node13</title>
-<g id="a_edge15_Node000008_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M328.81,-204.61C345.49,-183.53 373.19,-151.22 402.25,-128.88 403.37,-128.01 404.52,-127.16 405.69,-126.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="407.33,-129.44 413.76,-121.01 403.48,-123.59 407.33,-129.44"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node10 -->
-<g id="edge10_Node000010_Node000010" class="edge">
-<title>Node10&#45;&gt;Node10</title>
-<g id="a_edge10_Node000010_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M432.74,-42.07C430.13,-51.55 439.26,-59.75 460.12,-59.75 472.19,-59.75 480.33,-57.01 484.54,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="487.84,-54.1 487.11,-43.53 481.09,-52.24 487.84,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node11 -->
-<g id="edge12_Node000011_Node000011" class="edge">
-<title>Node11&#45;&gt;Node11</title>
-<g id="a_edge12_Node000011_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M432.74,-296.07C430.13,-305.55 439.26,-313.75 460.12,-313.75 472.19,-313.75 480.33,-311.01 484.54,-306.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="487.84,-308.1 487.11,-297.53 481.09,-306.24 487.84,-308.1"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node12 -->
-<g id="edge14_Node000012_Node000012" class="edge">
-<title>Node12&#45;&gt;Node12</title>
-<g id="a_edge14_Node000012_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M432.74,-180.07C430.13,-189.55 439.26,-197.75 460.12,-197.75 472.19,-197.75 480.33,-195.01 484.54,-190.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="487.84,-192.1 487.11,-181.53 481.09,-190.24 487.84,-192.1"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="663,-80.75 554,-80.75 554,-39 663,-39 663,-80.75"/>
-<text text-anchor="start" x="562" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="562" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="608.5" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge16_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge16_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M514.8,-84.57C523.95,-82.14 533.53,-79.58 542.93,-77.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="543.61,-80.52 552.37,-74.56 541.81,-73.76 543.61,-80.52"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="663,-158.75 554,-158.75 554,-117 663,-117 663,-158.75"/>
-<text text-anchor="start" x="562" y="-145.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="562" y="-134" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="608.5" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node15 -->
-<g id="edge18_Node000013_Node000015" class="edge">
-<title>Node13&#45;&gt;Node15</title>
-<g id="a_edge18_Node000013_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M514.8,-113.18C523.95,-115.61 533.53,-118.17 542.93,-120.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="541.81,-123.99 552.37,-123.19 543.61,-117.23 541.81,-123.99"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node14 -->
-<g id="edge17_Node000014_Node000014" class="edge">
-<title>Node14&#45;&gt;Node14</title>
-<g id="a_edge17_Node000014_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M581.11,-81.07C578.51,-90.55 587.63,-98.75 608.5,-98.75 620.56,-98.75 628.7,-96.01 632.92,-91.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="636.21,-93.1 635.48,-82.53 629.46,-91.24 636.21,-93.1"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node15 -->
-<g id="edge19_Node000015_Node000015" class="edge">
-<title>Node15&#45;&gt;Node15</title>
-<g id="a_edge19_Node000015_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M581.11,-159.07C578.51,-168.55 587.63,-176.75 608.5,-176.75 620.56,-176.75 628.7,-174.01 632.92,-169.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="636.21,-171.1 635.48,-160.53 629.46,-169.24 636.21,-171.1"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" target="_top" xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="white" stroke="#666666" points="514.62,-373.75 405.62,-373.75 405.62,-332 514.62,-332 514.62,-373.75"/>
-<text text-anchor="start" x="413.62" y="-360.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="413.62" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="460.12" y="-337.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge22_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge22_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M366.42,-334.51C375.47,-336.3 384.95,-338.18 394.25,-340.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.48,-343.44 403.97,-341.95 394.84,-336.57 393.48,-343.44"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" target="_top" xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="white" stroke="#666666" points="514.62,-433.75 405.62,-433.75 405.62,-392 514.62,-392 514.62,-433.75"/>
-<text text-anchor="start" x="413.62" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="413.62" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="460.12" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node19 -->
-<g id="edge25_Node000016_Node000019" class="edge">
-<title>Node16&#45;&gt;Node19</title>
-<g id="a_edge25_Node000016_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M345.32,-345.12C352.23,-349.65 359.49,-354.41 366.25,-358.88 382.3,-369.47 385.72,-373.04 402.25,-382.88 404.08,-383.97 405.96,-385.06 407.87,-386.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="405.78,-389 416.21,-390.83 409.2,-382.89 405.78,-389"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node9 -->
-<g id="edge23_Node000017_Node000009" class="edge">
-<title>Node17&#45;&gt;Node9</title>
-<g id="a_edge23_Node000017_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M502.68,-331.51C507.88,-328.68 513.09,-325.75 518,-322.88 534.12,-313.43 551.43,-302.42 566.5,-292.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="568.36,-295.51 574.78,-287.08 564.5,-289.67 568.36,-295.51"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="637.88,-362.5 579.12,-362.5 579.12,-343.25 637.88,-343.25 637.88,-362.5"/>
-<text text-anchor="middle" x="608.5" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge24_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge24_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M514.8,-352.88C532.26,-352.88 551.33,-352.88 567.6,-352.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="567.38,-356.38 577.38,-352.88 567.38,-349.38 567.38,-356.38"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="663,-433.75 554,-433.75 554,-392 663,-392 663,-433.75"/>
-<text text-anchor="start" x="562" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="562" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="608.5" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge26_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge26_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M514.8,-412.88C523.85,-412.88 533.33,-412.88 542.62,-412.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="542.32,-416.38 552.32,-412.88 542.32,-409.38 542.32,-416.38"/>
-</a>
-</g>
-</g>
-<!-- Node21&#45;&gt;Node22 -->
-<g id="edge28_Node000021_Node000022" class="edge">
-<title>Node21&#45;&gt;Node22</title>
-<g id="a_edge28_Node000021_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M366.42,-529.04C379.04,-531.2 392.5,-533.5 405.13,-535.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.51,-539.1 414.96,-537.33 405.69,-532.2 404.51,-539.1"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" target="_top" xlink:title="Update the value at a node.">
-<polygon fill="white" stroke="#666666" points="514.62,-638.75 405.62,-638.75 405.62,-597 514.62,-597 514.62,-638.75"/>
-<text text-anchor="start" x="413.62" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="413.62" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="460.12" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::update</text>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node24 -->
-<g id="edge31_Node000023_Node000024" class="edge">
-<title>Node23&#45;&gt;Node24</title>
-<g id="a_edge31_Node000023_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M366.42,-617.88C375.47,-617.88 384.95,-617.88 394.25,-617.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.94,-621.38 403.94,-617.88 393.94,-614.38 393.94,-621.38"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node6 -->
-<g id="edge33_Node000025_Node000006" class="edge">
-<title>Node25&#45;&gt;Node6</title>
-<g id="a_edge33_Node000025_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.98,-499.34C209.01,-496.58 215.51,-493.33 221.25,-489.88 240.72,-478.16 260.99,-463.03 277.31,-450.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="279.19,-453.01 284.76,-444 274.79,-447.57 279.19,-453.01"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node7 -->
-<g id="edge35_Node000025_Node000007" class="edge">
-<title>Node25&#45;&gt;Node7</title>
-<g id="a_edge35_Node000025_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.08,-513.68C209.67,-516.43 216.49,-520.36 221.25,-525.88 258.19,-568.67 211.97,-614.03 257.25,-647.88 296.05,-676.88 327.45,-676.88 366.25,-647.88 411.53,-614.03 373.82,-574.74 402.25,-525.88 411.49,-510 425.87,-495.13 437.86,-484.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="440.04,-487.03 445.3,-477.83 435.45,-481.75 440.04,-487.03"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node8 -->
-<g id="edge34_Node000025_Node000008" class="edge">
-<title>Node25&#45;&gt;Node8</title>
-<g id="a_edge34_Node000025_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.01,-502.52C209.76,-499.79 216.69,-495.75 221.25,-489.88 275.51,-419.87 220.8,-374.6 257.25,-293.88 263.44,-280.16 272.99,-266.76 282.31,-255.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.78,-258.02 288.68,-248.17 279.49,-253.44 284.78,-258.02"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node16 -->
-<g id="edge36_Node000025_Node000016" class="edge">
-<title>Node25&#45;&gt;Node16</title>
-<g id="a_edge36_Node000025_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.28,-501.72C209.73,-498.97 216.41,-495.13 221.25,-489.88 252.7,-455.75 234.62,-432.39 257.25,-391.88 264.71,-378.53 274.69,-365.04 284.01,-353.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.56,-356.05 290.32,-346.14 281.2,-351.55 286.56,-356.05"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node21 -->
-<g id="edge37_Node000025_Node000021" class="edge">
-<title>Node25&#45;&gt;Node21</title>
-<g id="a_edge37_Node000025_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.29,-509.83C215.01,-510.93 230.33,-512.36 245.72,-513.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="245.09,-517.25 255.38,-514.7 245.75,-510.28 245.09,-517.25"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node22 -->
-<g id="edge38_Node000025_Node000022" class="edge">
-<title>Node25&#45;&gt;Node22</title>
-<g id="a_edge38_Node000025_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.27,-513.52C209.88,-516.26 216.65,-520.22 221.25,-525.88 265.87,-580.75 201.87,-636.89 257.25,-680.88 295.18,-711.01 326.29,-708.26 366.25,-680.88 402.81,-655.82 375.55,-623.26 402.25,-587.88 410.16,-577.39 421.28,-568.21 431.6,-561.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="433.38,-564.07 439.84,-555.67 429.55,-558.21 433.38,-564.07"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node23 -->
-<g id="edge39_Node000025_Node000023" class="edge">
-<title>Node25&#45;&gt;Node23</title>
-<g id="a_edge39_Node000025_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.06,-514.83C209.36,-517.61 216,-521.26 221.25,-525.88 243.77,-545.64 236.23,-561.52 257.25,-582.88 259.63,-585.29 262.2,-587.62 264.88,-589.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.48,-592.44 272.54,-595.77 266.75,-586.89 262.48,-592.44"/>
-</a>
-</g>
-</g>
-<!-- Node26&#45;&gt;Node6 -->
-<g id="edge41_Node000026_Node000006" class="edge">
-<title>Node26&#45;&gt;Node6</title>
-<g id="a_edge41_Node000026_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.29,-462.89C215.12,-458.38 230.63,-452.46 246.17,-446.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="247.38,-449.81 255.47,-442.98 244.88,-443.27 247.38,-449.81"/>
-</a>
-</g>
-</g>
-<!-- Node26&#45;&gt;Node7 -->
-<g id="edge43_Node000026_Node000007" class="edge">
-<title>Node26&#45;&gt;Node7</title>
-<g id="a_edge43_Node000026_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.18,-470.57C242.47,-470.01 329.16,-468.75 390.75,-467.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="390.48,-471.37 400.43,-467.72 390.38,-464.37 390.48,-471.37"/>
-</a>
-</g>
-</g>
-<!-- Node26&#45;&gt;Node8 -->
-<g id="edge42_Node000026_Node000008" class="edge">
-<title>Node26&#45;&gt;Node8</title>
-<g id="a_edge42_Node000026_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.25,-460.8C199.98,-450.42 213.14,-433.48 221.25,-416.88 246.25,-365.69 231.17,-344.51 257.25,-293.88 264.2,-280.39 273.99,-266.96 283.3,-255.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.81,-258.09 289.62,-248.21 280.48,-253.56 285.81,-258.09"/>
-</a>
-</g>
-</g>
-<!-- Node26&#45;&gt;Node16 -->
-<g id="edge44_Node000026_Node000016" class="edge">
-<title>Node26&#45;&gt;Node16</title>
-<g id="a_edge44_Node000026_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.2,-460.77C210.23,-438.98 255.76,-386.84 284.82,-353.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.25,-356.1 291.19,-346.27 281.98,-351.5 287.25,-356.1"/>
-</a>
-</g>
-</g>
-<!-- Node26&#45;&gt;Node21 -->
-<g id="edge45_Node000026_Node000021" class="edge">
-<title>Node26&#45;&gt;Node21</title>
-<g id="a_edge45_Node000026_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.29,-478.86C215.12,-483.37 230.63,-489.29 246.17,-495.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.88,-498.48 255.47,-498.77 247.38,-491.94 244.88,-498.48"/>
-</a>
-</g>
-</g>
-<!-- Node26&#45;&gt;Node22 -->
-<g id="edge46_Node000026_Node000022" class="edge">
-<title>Node26&#45;&gt;Node22</title>
-<g id="a_edge46_Node000026_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.15,-477.74C209.45,-480.51 216.07,-484.18 221.25,-488.88 244.59,-510 229.91,-534.27 257.25,-549.88 306.44,-577.96 373.95,-568.61 417.06,-557.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="417.76,-561.32 426.54,-555.38 415.98,-554.55 417.76,-561.32"/>
-</a>
-</g>
-</g>
-<!-- Node26&#45;&gt;Node23 -->
-<g id="edge47_Node000026_Node000023" class="edge">
-<title>Node26&#45;&gt;Node23</title>
-<g id="a_edge47_Node000026_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.24,-477.07C209.69,-479.82 216.38,-483.66 221.25,-488.88 251.79,-521.56 229.17,-548.05 257.25,-582.88 259.05,-585.11 261.03,-587.24 263.13,-589.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.74,-591.84 270.62,-595.67 265.28,-586.51 260.74,-591.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d83/lcm__sum_8cpp_source.html b/d5/d83/lcm__sum_8cpp_source.html
new file mode 100644
index 000000000..72565109a
--- /dev/null
+++ b/d5/d83/lcm__sum_8cpp_source.html
@@ -0,0 +1,219 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/lcm_sum.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/d83/lcm__sum_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">lcm_sum.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d5/d83/lcm__sum_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="foldopen" id="foldopen00030" data-start="{" data-end="}">
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">   30</a></span>uint64_t <a class="code hl_function" href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">lcmSum</a>(<span class="keyword">const</span> uint16_t&amp; num) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    uint64_t i = 0, j = 0;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    std::vector&lt;uint64_t&gt; eulerTotient(num + 1);</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    std::vector&lt;uint64_t&gt; sumOfEulerTotient(num + 1);</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="comment">// storing initial values in eulerTotient vector</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">for</span> (i = 1; i &lt;= num; i++) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        eulerTotient[i] = i;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    }</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="comment">// applying totient sieve</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">for</span> (i = 2; i &lt;= num; i++) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        <span class="keywordflow">if</span> (eulerTotient[i] == i) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>            <span class="keywordflow">for</span> (j = i; j &lt;= num; j += i) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>                eulerTotient[j] = eulerTotient[j] / i;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>                eulerTotient[j] = eulerTotient[j] * (i - 1);</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            }</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="comment">// computing sum of euler totients</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordflow">for</span> (i = 1; i &lt;= num; i++) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        <span class="keywordflow">for</span> (j = i; j &lt;= num; j += i) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            sumOfEulerTotient[j] += eulerTotient[i] * i;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">return</span> ((sumOfEulerTotient[num] + 1) * num) / 2;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}</div>
+</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="foldopen" id="foldopen00066" data-start="{" data-end="}">
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"><a class="line" href="../../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   66</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    uint64_t n = 2;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    uint64_t <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a> = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">math::lcmSum</a>(n);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    assert(<a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a> == 4);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 1!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    n = 5;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    uint64_t <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a> = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">math::lcmSum</a>(n);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    assert(<a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a> == 55);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 2!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    n = 10;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    uint64_t <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a> = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">math::lcmSum</a>(n);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    assert(<a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a> == 320);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 3!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    n = 11;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    uint64_t test_4 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">math::lcmSum</a>(n);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    assert(test_4 == 616);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 4!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    n = 15;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    uint64_t test_5 = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">math::lcmSum</a>(n);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    assert(test_5 == 1110);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 5!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>}</div>
+</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="foldopen" id="foldopen00097" data-start="{" data-end="}">
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"><a class="line" href="../../d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   97</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <a class="code hl_function" href="../../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the tests</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>}</div>
+</div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00505">heavy_light_decomposition.cpp:505</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00549">heavy_light_decomposition.cpp:549</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00592">heavy_light_decomposition.cpp:592</a></div></div>
+<div class="ttc" id="alcm__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00066">lcm_sum.cpp:66</a></div></div>
+<div class="ttc" id="alcm__sum_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00097">lcm_sum.cpp:97</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_a04065193d190d605e1f0d0d93a87e244"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">math::lcmSum</a></div><div class="ttdeci">uint64_t lcmSum(const uint16_t &amp;num)</div><div class="ttdef"><b>Definition</b> <a href="#l00030">lcm_sum.cpp:30</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d5/d83/lcm__sum_8cpp.html">lcm_sum.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
index 9fdac1077..922f9ed62 100644
--- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html
+++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Backtracking</title>
+<title>TheAlgorithms/C++: Backtracking</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d5/d89/namespacepalindrome__partitioning.html b/d5/d89/namespacepalindrome__partitioning.html
index f8cbd8355..30b26e3b4 100644
--- a/d5/d89/namespacepalindrome__partitioning.html
+++ b/d5/d89/namespacepalindrome__partitioning.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: palindrome_partitioning Namespace Reference</title>
+<title>TheAlgorithms/C++: palindrome_partitioning Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d5/d8a/classothers_1_1postfix__expression_1_1_stack.html b/d5/d8a/classothers_1_1postfix__expression_1_1_stack.html
index 0a8399c57..bbb6e6f45 100644
--- a/d5/d8a/classothers_1_1postfix__expression_1_1_stack.html
+++ b/d5/d8a/classothers_1_1postfix__expression_1_1_stack.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others::postfix_expression::Stack Class Reference</title>
+<title>TheAlgorithms/C++: others::postfix_expression::Stack Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,16 +138,17 @@ Collaboration diagram for others::postfix_expression::Stack:</div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:af06360122e20ce2ba32c574a27a20ba1" id="r_af06360122e20ce2ba32c574a27a20ba1"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; float, 20 &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af06360122e20ce2ba32c574a27a20ba1">stack</a> {}</td></tr>
+<tr class="memitem:af06360122e20ce2ba32c574a27a20ba1" id="r_af06360122e20ce2ba32c574a27a20ba1"><td class="memItemLeft" align="right" valign="top">std::array&lt; float, 20 &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af06360122e20ce2ba32c574a27a20ba1">stack</a> {}</td></tr>
 <tr class="memdesc:af06360122e20ce2ba32c574a27a20ba1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Array which will be used to store numbers in the input.  <br /></td></tr>
 <tr class="separator:af06360122e20ce2ba32c574a27a20ba1"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a6ae98710503b894b843d01cb69d5490c" id="r_a6ae98710503b894b843d01cb69d5490c"><td class="memItemLeft" align="right" valign="top"><a id="a6ae98710503b894b843d01cb69d5490c" name="a6ae98710503b894b843d01cb69d5490c"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>stackTop</b> = -1</td></tr>
-<tr class="memdesc:a6ae98710503b894b843d01cb69d5490c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Represents the index of the last value added to array. -1 means array is empty. <br /></td></tr>
+<tr class="memitem:a6ae98710503b894b843d01cb69d5490c" id="r_a6ae98710503b894b843d01cb69d5490c"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6ae98710503b894b843d01cb69d5490c">stackTop</a> = -1</td></tr>
+<tr class="memdesc:a6ae98710503b894b843d01cb69d5490c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Represents the index of the last value added to array. -1 means array is empty.  <br /></td></tr>
 <tr class="separator:a6ae98710503b894b843d01cb69d5490c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Creates an array to be used as stack for storing values. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html">postfix_evaluation.cpp</a>.</p>
 </div><h2 class="groupheader">Member Data Documentation</h2>
 <a id="af06360122e20ce2ba32c574a27a20ba1" name="af06360122e20ce2ba32c574a27a20ba1"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#af06360122e20ce2ba32c574a27a20ba1">&#9670;&#160;</a></span>stack</h2>
@@ -139,18 +157,38 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>stackTop</b> = -1</td>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;float, 20&gt; others::postfix_expression::Stack::stack {}</td>
+          <td class="memname">std::array&lt;float, 20&gt; others::postfix_expression::Stack::stack {}</td>
         </tr>
       </table>
 </div><div class="memdoc">
 
 <p>Array which will be used to store numbers in the input. </p>
-<div class="fragment"><div class="line"><span class="lineno">   34</span>{}; <span class="comment">///&lt; Array which will be used to store numbers in the input</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html">postfix_evaluation.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   34</span>{}; </div>
 </div><!-- fragment -->
+</div>
+</div>
+<a id="a6ae98710503b894b843d01cb69d5490c" name="a6ae98710503b894b843d01cb69d5490c"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a6ae98710503b894b843d01cb69d5490c">&#9670;&#160;</a></span>stackTop</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int others::postfix_expression::Stack::stackTop = -1</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Represents the index of the last value added to array. -1 means array is empty. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html">postfix_evaluation.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>others/<a class="el" href="../../d7/d75/postfix__evaluation_8cpp.html">postfix_evaluation.cpp</a></li>
+<li>others/<a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html">postfix_evaluation.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d5/d8a/trie__using__hashmap_8cpp.html b/d5/d8a/trie__using__hashmap_8cpp.html
index d6abe3106..f61e1ebed 100644
--- a/d5/d8a/trie__using__hashmap_8cpp.html
+++ b/d5/d8a/trie__using__hashmap_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/trie_using_hashmap.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/trie_using_hashmap.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -125,7 +142,9 @@ Include dependency graph for trie_using_hashmap.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dfd/trie__using__hashmap_8cpp__incl.svg" width="556" height="126"><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">
+</div>
+<p><a href="../../d5/d8a/trie__using__hashmap_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html">data_structures::trie_using_hashmap::Trie</a></td></tr>
@@ -157,6 +176,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure using HashMap for different characters and method for predicting words based on prefix. </p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/bharath000" target="_blank">Venkata Bharath</a></dd></dl>
 <p>The <a class="el" href="../../dd/d2f/class_trie.html">Trie</a> data structure is implemented using unordered map to use memory optimally, predict_words method is developed to recommend words based on a given prefix along with other methods insert, delete, search, startwith in trie. </p><dl class="section see"><dt>See also</dt><dd><a class="el" href="../../dc/d93/trie__modern_8cpp.html" title="A basic implementation of trie class to store only lower-case strings.">trie_modern.cpp</a> for difference </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html">trie_using_hashmap.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -175,17 +196,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00342">342</a> of file <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html">trie_using_hashmap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  342</span>           {</div>
 <div class="line"><span class="lineno">  343</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementaions</span></div>
 <div class="line"><span class="lineno">  344</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  345</span>}</div>
-<div class="ttc" id="atrie__using__hashmap_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> trie_using_hashmap.cpp:221</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="atrie__using__hashmap_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00221">trie_using_hashmap.cpp:221</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -213,6 +231,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00221">221</a> of file <a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp_source.html">trie_using_hashmap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  221</span>                   {</div>
 <div class="line"><span class="lineno">  222</span>    <a class="code hl_class" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html">data_structures::trie_using_hashmap::Trie</a> obj;</div>
 <div class="line"><span class="lineno">  223</span>    <span class="comment">// Inserting data into trie using the insert</span></div>
@@ -231,10 +251,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  236</span>    obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">insert</a>(<span class="stringliteral">&quot;Bounce&quot;</span>);</div>
 <div class="line"><span class="lineno">  237</span> </div>
 <div class="line"><span class="lineno">  238</span>    assert(!obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;appy&quot;</span>));</div>
-<div class="line"><span class="lineno">  239</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;appy is not a word in trie&quot;</span> &lt;&lt; <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">  239</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;appy is not a word in trie&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  240</span> </div>
 <div class="line"><span class="lineno">  241</span>    assert(!obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;car&quot;</span>));</div>
-<div class="line"><span class="lineno">  242</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;car is not a word in trie&quot;</span> &lt;&lt; <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">  242</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;car is not a word in trie&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  243</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;app&quot;</span>));</div>
 <div class="line"><span class="lineno">  244</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;apple&quot;</span>));</div>
 <div class="line"><span class="lineno">  245</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;apples&quot;</span>));</div>
@@ -248,7 +268,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  253</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;Bounce&quot;</span>));</div>
 <div class="line"><span class="lineno">  254</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;Apple&quot;</span>));</div>
 <div class="line"><span class="lineno">  255</span> </div>
-<div class="line"><span class="lineno">  256</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All the Inserted words are present in the trie&quot;</span> &lt;&lt; <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">  256</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All the Inserted words are present in the trie&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  257</span> </div>
 <div class="line"><span class="lineno">  258</span>    <span class="comment">// test for startwith prefix method</span></div>
 <div class="line"><span class="lineno">  259</span>    assert(!obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="stringliteral">&quot;approachs&quot;</span>));</div>
@@ -269,54 +289,54 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  274</span> </div>
 <div class="line"><span class="lineno">  275</span>    assert(!obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="stringliteral">&quot;C&quot;</span>));</div>
 <div class="line"><span class="lineno">  276</span> </div>
-<div class="line"><span class="lineno">  277</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All the tests passed for startwith method&quot;</span> &lt;&lt; <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">  277</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All the tests passed for startwith method&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  278</span> </div>
 <div class="line"><span class="lineno">  279</span>    <span class="comment">// test for predict_words/recommendation of words based on a given prefix</span></div>
 <div class="line"><span class="lineno">  280</span> </div>
-<div class="line"><span class="lineno">  281</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::string&gt;</a> pred_words = obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a>(<span class="stringliteral">&quot;a&quot;</span>);</div>
+<div class="line"><span class="lineno">  281</span>    std::vector&lt;std::string&gt; pred_words = obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a>(<span class="stringliteral">&quot;a&quot;</span>);</div>
 <div class="line"><span class="lineno">  282</span> </div>
-<div class="line"><span class="lineno">  283</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&amp; str : obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a>(<span class="stringliteral">&quot;a&quot;</span>)) {</div>
-<div class="line"><span class="lineno">  284</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; str &lt;&lt; <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">  283</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> std::string&amp; str : obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a>(<span class="stringliteral">&quot;a&quot;</span>)) {</div>
+<div class="line"><span class="lineno">  284</span>        std::cout &lt;&lt; str &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  285</span>    }</div>
-<div class="line"><span class="lineno">  286</span>    assert(pred_words.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() == 8);</div>
-<div class="line"><span class="lineno">  287</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Returned all words that start with prefix a &quot;</span> &lt;&lt; <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">  286</span>    assert(pred_words.size() == 8);</div>
+<div class="line"><span class="lineno">  287</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Returned all words that start with prefix a &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  288</span>    pred_words = obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a>(<span class="stringliteral">&quot;app&quot;</span>);</div>
 <div class="line"><span class="lineno">  289</span> </div>
-<div class="line"><span class="lineno">  290</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&amp; str : pred_words) {</div>
-<div class="line"><span class="lineno">  291</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; str &lt;&lt; <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">  290</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> std::string&amp; str : pred_words) {</div>
+<div class="line"><span class="lineno">  291</span>        std::cout &lt;&lt; str &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  292</span>    }</div>
 <div class="line"><span class="lineno">  293</span> </div>
 <div class="line"><span class="lineno">  294</span>    assert(pred_words.size() == 5);</div>
-<div class="line"><span class="lineno">  295</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Returned all words that start with prefix app &quot;</span> &lt;&lt; <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">  295</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Returned all words that start with prefix app &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  296</span>    pred_words = obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a>(<span class="stringliteral">&quot;A&quot;</span>);</div>
 <div class="line"><span class="lineno">  297</span> </div>
-<div class="line"><span class="lineno">  298</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&amp; str : pred_words) {</div>
-<div class="line"><span class="lineno">  299</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; str &lt;&lt; <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">  298</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> std::string&amp; str : pred_words) {</div>
+<div class="line"><span class="lineno">  299</span>        std::cout &lt;&lt; str &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  300</span>    }</div>
 <div class="line"><span class="lineno">  301</span> </div>
 <div class="line"><span class="lineno">  302</span>    assert(pred_words.size() == 1);</div>
-<div class="line"><span class="lineno">  303</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Returned all words that start with prefix A &quot;</span> &lt;&lt; <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">  303</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Returned all words that start with prefix A &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  304</span>    pred_words = obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a>(<span class="stringliteral">&quot;bu&quot;</span>);</div>
 <div class="line"><span class="lineno">  305</span> </div>
-<div class="line"><span class="lineno">  306</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&amp; str : pred_words) {</div>
-<div class="line"><span class="lineno">  307</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; str &lt;&lt; <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">  306</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> std::string&amp; str : pred_words) {</div>
+<div class="line"><span class="lineno">  307</span>        std::cout &lt;&lt; str &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  308</span>    }</div>
 <div class="line"><span class="lineno">  309</span> </div>
 <div class="line"><span class="lineno">  310</span>    assert(pred_words.size() == 2);</div>
-<div class="line"><span class="lineno">  311</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Returned all words that start with prefix bu &quot;</span> &lt;&lt; <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">  311</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Returned all words that start with prefix bu &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  312</span> </div>
 <div class="line"><span class="lineno">  313</span>    <span class="comment">// tests for delete method</span></div>
 <div class="line"><span class="lineno">  314</span> </div>
 <div class="line"><span class="lineno">  315</span>    obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75">delete_word</a>(<span class="stringliteral">&quot;app&quot;</span>);</div>
 <div class="line"><span class="lineno">  316</span>    assert(!obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;app&quot;</span>));</div>
-<div class="line"><span class="lineno">  317</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;word app is deleted sucessful&quot;</span> &lt;&lt; <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">  317</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;word app is deleted sucessful&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  318</span> </div>
 <div class="line"><span class="lineno">  319</span>    pred_words = obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a>(<span class="stringliteral">&quot;app&quot;</span>);</div>
-<div class="line"><span class="lineno">  320</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&amp; str : pred_words) {</div>
-<div class="line"><span class="lineno">  321</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; str &lt;&lt; <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">  320</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> std::string&amp; str : pred_words) {</div>
+<div class="line"><span class="lineno">  321</span>        std::cout &lt;&lt; str &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  322</span>    }</div>
 <div class="line"><span class="lineno">  323</span>    assert(pred_words.size() == 4);</div>
-<div class="line"><span class="lineno">  324</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;app is deleted sucessful&quot;</span> &lt;&lt; <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">  324</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;app is deleted sucessful&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  325</span> </div>
 <div class="line"><span class="lineno">  326</span>    <span class="comment">// test case for Chinese language</span></div>
 <div class="line"><span class="lineno">  327</span> </div>
@@ -325,27 +345,17 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  330</span>    pred_words = obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a>(<span class="stringliteral">&quot;h&quot;</span>);</div>
 <div class="line"><span class="lineno">  331</span> </div>
 <div class="line"><span class="lineno">  332</span>    assert(pred_words.size() == 0);</div>
-<div class="line"><span class="lineno">  333</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;No word starts with prefix h in trie&quot;</span> &lt;&lt; <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">  333</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;No word starts with prefix h in trie&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  334</span> </div>
-<div class="line"><span class="lineno">  335</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests passed&quot;</span> &lt;&lt; <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">  335</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  336</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="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html">data_structures::trie_using_hashmap::Trie</a></div><div class="ttdoc">Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...</div><div class="ttdef"><b>Definition</b> trie_using_hashmap.cpp:39</div></div>
-<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_abcae0a4456e7f583ce716e3ef466dfd2"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">data_structures::trie_using_hashmap::Trie::insert</a></div><div class="ttdeci">void insert(const std::string &amp;word)</div><div class="ttdoc">insert the string into the trie</div><div class="ttdef"><b>Definition</b> trie_using_hashmap.cpp:62</div></div>
-<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_ac0bf3d6791cba144b3f539835d835e75"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75">data_structures::trie_using_hashmap::Trie::delete_word</a></div><div class="ttdeci">void delete_word(std::string word)</div><div class="ttdoc">delete a word/string from a trie</div><div class="ttdef"><b>Definition</b> trie_using_hashmap.cpp:122</div></div>
-<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_ad71eb24207c28b546631802dba97310f"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">data_structures::trie_using_hashmap::Trie::search</a></div><div class="ttdeci">bool search(const std::string &amp;word)</div><div class="ttdoc">search a word/string inside the trie</div><div class="ttdef"><b>Definition</b> trie_using_hashmap.cpp:82</div></div>
-<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_ae15fdc7f2b5023992d87a711d78566c4"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">data_structures::trie_using_hashmap::Trie::predict_words</a></div><div class="ttdeci">std::vector&lt; std::string &gt; predict_words(const std::string &amp;prefix)</div><div class="ttdoc">predict/recommend a word that starts with a given prefix</div><div class="ttdef"><b>Definition</b> trie_using_hashmap.cpp:188</div></div>
-<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_af3aee573fbabd2c1510c0f74f842dd17"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">data_structures::trie_using_hashmap::Trie::startwith</a></div><div class="ttdeci">bool startwith(const std::string &amp;prefix)</div><div class="ttdoc">search a word/string that starts with a given prefix</div><div class="ttdef"><b>Definition</b> trie_using_hashmap.cpp:107</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="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>
-</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="../../d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="651" height="592"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html">data_structures::trie_using_hashmap::Trie</a></div><div class="ttdoc">Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00039">trie_using_hashmap.cpp:39</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_abcae0a4456e7f583ce716e3ef466dfd2"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">data_structures::trie_using_hashmap::Trie::insert</a></div><div class="ttdeci">void insert(const std::string &amp;word)</div><div class="ttdoc">insert the string into the trie</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00062">trie_using_hashmap.cpp:62</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_ac0bf3d6791cba144b3f539835d835e75"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75">data_structures::trie_using_hashmap::Trie::delete_word</a></div><div class="ttdeci">void delete_word(std::string word)</div><div class="ttdoc">delete a word/string from a trie</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00122">trie_using_hashmap.cpp:122</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_ad71eb24207c28b546631802dba97310f"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">data_structures::trie_using_hashmap::Trie::search</a></div><div class="ttdeci">bool search(const std::string &amp;word)</div><div class="ttdoc">search a word/string inside the trie</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00082">trie_using_hashmap.cpp:82</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_ae15fdc7f2b5023992d87a711d78566c4"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">data_structures::trie_using_hashmap::Trie::predict_words</a></div><div class="ttdeci">std::vector&lt; std::string &gt; predict_words(const std::string &amp;prefix)</div><div class="ttdoc">predict/recommend a word that starts with a given prefix</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00188">trie_using_hashmap.cpp:188</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_af3aee573fbabd2c1510c0f74f842dd17"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">data_structures::trie_using_hashmap::Trie::startwith</a></div><div class="ttdeci">bool startwith(const std::string &amp;prefix)</div><div class="ttdoc">search a word/string that starts with a given prefix</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d8a/trie__using__hashmap_8cpp_source.html#l00107">trie_using_hashmap.cpp:107</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index b5c3ffe01..000000000
--- a/d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,35 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,335,49,360"/>
-<area shape="rect" id="Node000002" href="$d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75" title="delete a word/string from a trie" alt="" coords="97,100,246,155"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="28,333,49,262,68,217,95,175,105,164,109,167,99,178,73,219,54,264,33,335"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="136,189,207,215"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="30,333,52,281,71,252,95,225,119,211,122,216,98,230,75,255,57,284,35,335"/>
-<area shape="rect" id="Node000009" href="$d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2" title="insert the string into the trie" alt="" coords="97,240,246,295"/>
-<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="48,333,95,305,103,301,106,306,98,310,51,337"/>
-<area shape="rect" id="Node000011" href="$d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4" title="predict/recommend a word that starts with a given prefix" alt="" coords="97,320,246,375"/>
-<area shape="poly" id="edge10_Node000001_Node000011" title=" " alt="" coords="49,345,81,345,81,350,49,350"/>
-<area shape="rect" id="Node000014" href="$d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f" title="search a word/string inside the trie" alt="" coords="97,400,246,455"/>
-<area shape="poly" id="edge15_Node000001_Node000014" title=" " alt="" coords="51,358,98,385,106,389,103,394,95,390,48,362"/>
-<area shape="rect" id="Node000015" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="114,480,229,506"/>
-<area shape="poly" id="edge16_Node000001_Node000015" title=" " alt="" coords="35,360,57,411,75,440,98,466,105,470,101,474,95,469,71,443,52,414,30,362"/>
-<area shape="rect" id="Node000016" href="$d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17" title="search a word/string that starts with a given prefix" alt="" coords="97,530,246,586"/>
-<area shape="poly" id="edge17_Node000001_Node000016" title=" " alt="" coords="33,360,52,432,71,476,99,517,100,518,96,522,95,520,67,479,47,434,28,361"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/back.html#" title=" " alt="" coords="311,5,426,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="205,97,246,67,293,40,304,35,306,39,295,45,249,72,209,101"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/stack/pop.html#" title=" " alt="" coords="314,55,423,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="245,102,308,83,310,88,247,107"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/pop_back.html#" title=" " alt="" coords="497,200,640,226"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="247,120,342,123,394,130,444,141,495,162,538,189,536,193,493,167,443,146,393,135,341,128,246,126"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/stack/push.html#" title=" " alt="" coords="311,156,426,182"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="247,141,297,151,296,156,246,146"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/stack/top.html#" title=" " alt="" coords="316,205,421,231"/>
-<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="221,154,295,192,309,197,307,202,293,197,218,158"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="306,255,431,280"/>
-<area shape="poly" id="edge9_Node000009_Node000010" title=" " alt="" coords="246,265,291,265,291,270,246,270"/>
-<area shape="rect" id="Node000012" href="$d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd" title="helper function to predict/recommend words that starts with a given prefix from the end of prefix&#39;s n..." alt="" coords="294,329,443,385"/>
-<area shape="poly" id="edge11_Node000011_Node000012" title=" " alt="" coords="246,348,279,350,278,355,246,354"/>
-<area shape="poly" id="edge13_Node000012_Node000005" title=" " alt="" coords="407,326,535,233,539,237,411,331"/>
-<area shape="poly" id="edge12_Node000012_Node000012" title=" " alt="" coords="330,328,330,319,337,310,350,304,369,302,390,305,402,312,400,317,388,310,369,308,351,309,340,314,335,321,335,329"/>
-<area shape="rect" id="Node000013" 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="491,344,646,370"/>
-<area shape="poly" id="edge14_Node000012_Node000013" title=" " alt="" coords="444,354,475,354,475,360,444,360"/>
-</map>
diff --git a/d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 5e90c690b..000000000
--- a/d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1e8da73b66afc80a5ad64f1f35a9935c
\ No newline at end of file
diff --git a/d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 3edb19daf..000000000
--- a/d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,347 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="488pt" height="444pt"
- viewBox="0.00 0.00 488.25 443.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 439.5)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-188.5 0,-188.5 0,-169.25 32.5,-169.25 32.5,-188.5"/>
-<text text-anchor="middle" x="16.25" y="-175" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75" target="_top" xlink:title="delete a word/string from a trie">
-<polygon fill="white" stroke="#666666" points="180.5,-364.75 68.5,-364.75 68.5,-323 180.5,-323 180.5,-364.75"/>
-<text text-anchor="start" x="76.5" y="-351.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="76.5" y="-340" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="124.5" y="-328.75" font-family="Helvetica,sans-Serif" font-size="10.00">::delete_word</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M19.14,-188.88C23.91,-211.89 38.26,-269.45 68.5,-306.88 70.92,-309.87 73.66,-312.72 76.57,-315.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.09,-317.89 84.02,-321.57 78.55,-312.5 74.09,-317.89"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.25,-297.5 97.75,-297.5 97.75,-278.25 151.25,-278.25 151.25,-297.5"/>
-<text text-anchor="middle" x="124.5" y="-284" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.28,-188.8C26.39,-207.22 41.94,-246.82 68.5,-268.88 73.78,-273.26 80.13,-276.65 86.6,-279.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.44,-282.57 96.03,-282.5 87.71,-275.95 85.44,-282.57"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2" target="_top" xlink:title="insert the string into the trie">
-<polygon fill="white" stroke="#666666" points="180.5,-259.75 68.5,-259.75 68.5,-218 180.5,-218 180.5,-259.75"/>
-<text text-anchor="start" x="76.5" y="-246.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="76.5" y="-235" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="124.5" y="-223.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.88,-188.19C43,-194.18 56.47,-202.08 68.5,-208.88 70.38,-209.94 72.3,-211.02 74.25,-212.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.3,-215.03 82.74,-216.82 75.69,-208.9 72.3,-215.03"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4" target="_top" xlink:title="predict/recommend a word that starts with a given prefix">
-<polygon fill="white" stroke="#666666" points="180.5,-199.75 68.5,-199.75 68.5,-158 180.5,-158 180.5,-199.75"/>
-<text text-anchor="start" x="76.5" y="-186.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="76.5" y="-175" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="124.5" y="-163.75" font-family="Helvetica,sans-Serif" font-size="10.00">::predict_words</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.93,-178.88C39.67,-178.88 48.04,-178.88 56.95,-178.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.93,-182.38 66.93,-178.88 56.93,-175.38 56.93,-182.38"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f" target="_top" xlink:title="search a word/string inside the trie">
-<polygon fill="white" stroke="#666666" points="180.5,-139.75 68.5,-139.75 68.5,-98 180.5,-98 180.5,-139.75"/>
-<text text-anchor="start" x="76.5" y="-126.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="76.5" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="124.5" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node14 -->
-<g id="edge15_Node000001_Node000014" class="edge">
-<title>Node1&#45;&gt;Node14</title>
-<g id="a_edge15_Node000001_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.88,-169.56C43,-163.57 56.47,-155.67 68.5,-148.88 70.38,-147.81 72.3,-146.73 74.25,-145.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.69,-148.85 82.74,-140.93 72.3,-142.72 75.69,-148.85"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="167.75,-79.5 81.25,-79.5 81.25,-60.25 167.75,-60.25 167.75,-79.5"/>
-<text text-anchor="middle" x="124.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node15 -->
-<g id="edge16_Node000001_Node000015" class="edge">
-<title>Node1&#45;&gt;Node15</title>
-<g id="a_edge16_Node000001_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.28,-168.95C26.39,-150.53 41.94,-110.93 68.5,-88.88 70,-87.63 71.58,-86.47 73.23,-85.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.79,-88.52 81.89,-80.65 71.43,-82.37 74.79,-88.52"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17" target="_top" xlink:title="search a word/string that starts with a given prefix">
-<polygon fill="white" stroke="#666666" points="180.5,-41.75 68.5,-41.75 68.5,0 180.5,0 180.5,-41.75"/>
-<text text-anchor="start" x="76.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="124.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::startwith</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge17_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge17_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M18.84,-169.02C23.05,-145.82 36.39,-87.03 68.5,-50.88 68.85,-50.48 69.21,-50.09 69.58,-49.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.76,-52.44 76.88,-43.17 67.09,-47.22 71.76,-52.44"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="315.75,-435.5 229.25,-435.5 229.25,-416.25 315.75,-416.25 315.75,-435.5"/>
-<text text-anchor="middle" x="272.5" y="-422" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.26,-365.12C168.8,-378.78 193.02,-396.11 216.5,-407.88 219.19,-409.22 222,-410.5 224.86,-411.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="223.38,-414.88 233.97,-415.21 225.89,-408.35 223.38,-414.88"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="313.12,-398.5 231.88,-398.5 231.88,-379.25 313.12,-379.25 313.12,-398.5"/>
-<text text-anchor="middle" x="272.5" y="-385" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.7,-360.89C196.27,-365.69 212.99,-370.84 227.79,-375.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.65,-378.71 237.23,-378.31 228.71,-372.02 226.65,-378.71"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="476.12,-289.5 368.62,-289.5 368.62,-270.25 476.12,-270.25 476.12,-289.5"/>
-<text text-anchor="middle" x="422.38" y="-276" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.92,-347.21C222.38,-348.14 280.05,-346.06 328.5,-331.88 354.27,-324.33 380.7,-308.6 398.75,-296.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="400.65,-299.35 406.85,-290.76 396.64,-293.61 400.65,-299.35"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="315.75,-322.5 229.25,-322.5 229.25,-303.25 315.75,-303.25 315.75,-322.5"/>
-<text text-anchor="middle" x="272.5" y="-309" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.7,-332.16C192.94,-329.56 205.89,-326.81 218.06,-324.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.44,-327.72 227.49,-322.22 216.98,-320.87 218.44,-327.72"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/top.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312,-285.5 233,-285.5 233,-266.25 312,-266.25 312,-285.5"/>
-<text text-anchor="middle" x="272.5" y="-272" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.6,-322.59C177.19,-313.05 197.48,-302.13 216.5,-293.88 219.82,-292.44 223.29,-291.04 226.81,-289.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.72,-293.11 235.96,-286.45 225.37,-286.52 227.72,-293.11"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="319.5,-248.5 225.5,-248.5 225.5,-229.25 319.5,-229.25 319.5,-248.5"/>
-<text text-anchor="middle" x="272.5" y="-235" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.7,-238.88C191.6,-238.88 203.08,-238.88 214.06,-238.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.76,-242.38 223.76,-238.88 213.76,-235.38 213.76,-242.38"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd" target="_top" xlink:title="helper function to predict/recommend words that starts with a given prefix from the end of prefix&#39;s n...">
-<polygon fill="white" stroke="#666666" points="328.5,-192.75 216.5,-192.75 216.5,-151 328.5,-151 328.5,-192.75"/>
-<text text-anchor="start" x="224.5" y="-179.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="224.5" y="-168" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="272.5" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_all_words</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge11_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge11_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.7,-176.23C188.6,-175.85 196.8,-175.46 204.89,-175.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="204.89,-178.57 214.71,-174.6 204.56,-171.58 204.89,-178.57"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node5 -->
-<g id="edge13_Node000012_Node000005" class="edge">
-<title>Node12&#45;&gt;Node5</title>
-<g id="a_edge13_Node000012_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.72,-193.21C330.93,-213.82 373.05,-244.58 398.79,-263.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.42,-265.98 406.56,-269.06 400.55,-260.33 396.42,-265.98"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node12 -->
-<g id="edge12_Node000012_Node000012" class="edge">
-<title>Node12&#45;&gt;Node12</title>
-<g id="a_edge12_Node000012_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.18,-193.07C242.58,-202.55 251.69,-210.75 272.5,-210.75 284.53,-210.75 292.65,-208.01 296.86,-203.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.15,-205.1 299.42,-194.53 293.4,-203.25 300.15,-205.1"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="480.25,-181.5 364.5,-181.5 364.5,-162.25 480.25,-162.25 480.25,-181.5"/>
-<text text-anchor="middle" x="422.38" y="-168" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge14_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge14_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M328.98,-171.88C336.69,-171.88 344.69,-171.88 352.6,-171.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.59,-175.38 362.59,-171.88 352.59,-168.38 352.59,-175.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index b68afc128..000000000
--- a/d5/d8a/trie__using__hashmap_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,321 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="488pt" height="444pt"
- viewBox="0.00 0.00 488.25 443.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 439.5)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-188.5 0,-188.5 0,-169.25 32.5,-169.25 32.5,-188.5"/>
-<text text-anchor="middle" x="16.25" y="-175" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75" target="_top" xlink:title="delete a word/string from a trie">
-<polygon fill="white" stroke="#666666" points="180.5,-364.75 68.5,-364.75 68.5,-323 180.5,-323 180.5,-364.75"/>
-<text text-anchor="start" x="76.5" y="-351.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="76.5" y="-340" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="124.5" y="-328.75" font-family="Helvetica,sans-Serif" font-size="10.00">::delete_word</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M19.14,-188.88C23.91,-211.89 38.26,-269.45 68.5,-306.88 70.92,-309.87 73.66,-312.72 76.57,-315.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.09,-317.89 84.02,-321.57 78.55,-312.5 74.09,-317.89"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.25,-297.5 97.75,-297.5 97.75,-278.25 151.25,-278.25 151.25,-297.5"/>
-<text text-anchor="middle" x="124.5" y="-284" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.28,-188.8C26.39,-207.22 41.94,-246.82 68.5,-268.88 73.78,-273.26 80.13,-276.65 86.6,-279.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.44,-282.57 96.03,-282.5 87.71,-275.95 85.44,-282.57"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2" target="_top" xlink:title="insert the string into the trie">
-<polygon fill="white" stroke="#666666" points="180.5,-259.75 68.5,-259.75 68.5,-218 180.5,-218 180.5,-259.75"/>
-<text text-anchor="start" x="76.5" y="-246.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="76.5" y="-235" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="124.5" y="-223.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.88,-188.19C43,-194.18 56.47,-202.08 68.5,-208.88 70.38,-209.94 72.3,-211.02 74.25,-212.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.3,-215.03 82.74,-216.82 75.69,-208.9 72.3,-215.03"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4" target="_top" xlink:title="predict/recommend a word that starts with a given prefix">
-<polygon fill="white" stroke="#666666" points="180.5,-199.75 68.5,-199.75 68.5,-158 180.5,-158 180.5,-199.75"/>
-<text text-anchor="start" x="76.5" y="-186.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="76.5" y="-175" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="124.5" y="-163.75" font-family="Helvetica,sans-Serif" font-size="10.00">::predict_words</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.93,-178.88C39.67,-178.88 48.04,-178.88 56.95,-178.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.93,-182.38 66.93,-178.88 56.93,-175.38 56.93,-182.38"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f" target="_top" xlink:title="search a word/string inside the trie">
-<polygon fill="white" stroke="#666666" points="180.5,-139.75 68.5,-139.75 68.5,-98 180.5,-98 180.5,-139.75"/>
-<text text-anchor="start" x="76.5" y="-126.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="76.5" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="124.5" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node14 -->
-<g id="edge15_Node000001_Node000014" class="edge">
-<title>Node1&#45;&gt;Node14</title>
-<g id="a_edge15_Node000001_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.88,-169.56C43,-163.57 56.47,-155.67 68.5,-148.88 70.38,-147.81 72.3,-146.73 74.25,-145.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.69,-148.85 82.74,-140.93 72.3,-142.72 75.69,-148.85"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="167.75,-79.5 81.25,-79.5 81.25,-60.25 167.75,-60.25 167.75,-79.5"/>
-<text text-anchor="middle" x="124.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node15 -->
-<g id="edge16_Node000001_Node000015" class="edge">
-<title>Node1&#45;&gt;Node15</title>
-<g id="a_edge16_Node000001_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.28,-168.95C26.39,-150.53 41.94,-110.93 68.5,-88.88 70,-87.63 71.58,-86.47 73.23,-85.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.79,-88.52 81.89,-80.65 71.43,-82.37 74.79,-88.52"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17" target="_top" xlink:title="search a word/string that starts with a given prefix">
-<polygon fill="white" stroke="#666666" points="180.5,-41.75 68.5,-41.75 68.5,0 180.5,0 180.5,-41.75"/>
-<text text-anchor="start" x="76.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="124.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::startwith</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge17_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge17_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M18.84,-169.02C23.05,-145.82 36.39,-87.03 68.5,-50.88 68.85,-50.48 69.21,-50.09 69.58,-49.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.76,-52.44 76.88,-43.17 67.09,-47.22 71.76,-52.44"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="315.75,-435.5 229.25,-435.5 229.25,-416.25 315.75,-416.25 315.75,-435.5"/>
-<text text-anchor="middle" x="272.5" y="-422" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.26,-365.12C168.8,-378.78 193.02,-396.11 216.5,-407.88 219.19,-409.22 222,-410.5 224.86,-411.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="223.38,-414.88 233.97,-415.21 225.89,-408.35 223.38,-414.88"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="313.12,-398.5 231.88,-398.5 231.88,-379.25 313.12,-379.25 313.12,-398.5"/>
-<text text-anchor="middle" x="272.5" y="-385" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.7,-360.89C196.27,-365.69 212.99,-370.84 227.79,-375.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.65,-378.71 237.23,-378.31 228.71,-372.02 226.65,-378.71"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="476.12,-289.5 368.62,-289.5 368.62,-270.25 476.12,-270.25 476.12,-289.5"/>
-<text text-anchor="middle" x="422.38" y="-276" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.92,-347.21C222.38,-348.14 280.05,-346.06 328.5,-331.88 354.27,-324.33 380.7,-308.6 398.75,-296.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="400.65,-299.35 406.85,-290.76 396.64,-293.61 400.65,-299.35"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="315.75,-322.5 229.25,-322.5 229.25,-303.25 315.75,-303.25 315.75,-322.5"/>
-<text text-anchor="middle" x="272.5" y="-309" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.7,-332.16C192.94,-329.56 205.89,-326.81 218.06,-324.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.44,-327.72 227.49,-322.22 216.98,-320.87 218.44,-327.72"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/top.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312,-285.5 233,-285.5 233,-266.25 312,-266.25 312,-285.5"/>
-<text text-anchor="middle" x="272.5" y="-272" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.6,-322.59C177.19,-313.05 197.48,-302.13 216.5,-293.88 219.82,-292.44 223.29,-291.04 226.81,-289.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.72,-293.11 235.96,-286.45 225.37,-286.52 227.72,-293.11"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="319.5,-248.5 225.5,-248.5 225.5,-229.25 319.5,-229.25 319.5,-248.5"/>
-<text text-anchor="middle" x="272.5" y="-235" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.7,-238.88C191.6,-238.88 203.08,-238.88 214.06,-238.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.76,-242.38 223.76,-238.88 213.76,-235.38 213.76,-242.38"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd" target="_top" xlink:title="helper function to predict/recommend words that starts with a given prefix from the end of prefix&#39;s n...">
-<polygon fill="white" stroke="#666666" points="328.5,-192.75 216.5,-192.75 216.5,-151 328.5,-151 328.5,-192.75"/>
-<text text-anchor="start" x="224.5" y="-179.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="224.5" y="-168" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="272.5" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_all_words</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge11_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge11_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.7,-176.23C188.6,-175.85 196.8,-175.46 204.89,-175.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="204.89,-178.57 214.71,-174.6 204.56,-171.58 204.89,-178.57"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node5 -->
-<g id="edge13_Node000012_Node000005" class="edge">
-<title>Node12&#45;&gt;Node5</title>
-<g id="a_edge13_Node000012_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.72,-193.21C330.93,-213.82 373.05,-244.58 398.79,-263.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.42,-265.98 406.56,-269.06 400.55,-260.33 396.42,-265.98"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node12 -->
-<g id="edge12_Node000012_Node000012" class="edge">
-<title>Node12&#45;&gt;Node12</title>
-<g id="a_edge12_Node000012_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.18,-193.07C242.58,-202.55 251.69,-210.75 272.5,-210.75 284.53,-210.75 292.65,-208.01 296.86,-203.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.15,-205.1 299.42,-194.53 293.4,-203.25 300.15,-205.1"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="480.25,-181.5 364.5,-181.5 364.5,-162.25 480.25,-162.25 480.25,-181.5"/>
-<text text-anchor="middle" x="422.38" y="-168" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge14_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge14_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M328.98,-171.88C336.69,-171.88 344.69,-171.88 352.6,-171.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.59,-175.38 362.59,-171.88 352.59,-168.38 352.59,-175.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 08af2e599..000000000
--- a/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,37 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,335,55,360"/>
-<area shape="rect" id="Node000002" href="$d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,335,146,360"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,345,87,345,87,350,55,350"/>
-<area shape="rect" id="Node000003" href="$d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75" title="delete a word/string from a trie" alt="" coords="194,100,343,155"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="126,333,146,262,165,217,192,175,203,164,207,167,196,178,170,219,151,264,131,335"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="233,189,304,215"/>
-<area shape="poly" id="edge8_Node000002_Node000009" title=" " alt="" coords="127,333,149,281,168,252,192,225,217,211,219,216,196,230,172,255,154,284,132,335"/>
-<area shape="rect" id="Node000010" href="$d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2" title="insert the string into the trie" alt="" coords="194,240,343,295"/>
-<area shape="poly" id="edge9_Node000002_Node000010" title=" " alt="" coords="145,333,193,305,200,301,203,306,195,310,148,337"/>
-<area shape="rect" id="Node000012" href="$d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4" title="predict/recommend a word that starts with a given prefix" alt="" coords="194,320,343,375"/>
-<area shape="poly" id="edge11_Node000002_Node000012" title=" " alt="" coords="147,345,179,345,179,350,147,350"/>
-<area shape="rect" id="Node000015" href="$d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f" title="search a word/string inside the trie" alt="" coords="194,400,343,455"/>
-<area shape="poly" id="edge16_Node000002_Node000015" title=" " alt="" coords="148,358,195,385,203,389,200,394,193,390,145,362"/>
-<area shape="rect" id="Node000016" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="211,480,326,506"/>
-<area shape="poly" id="edge17_Node000002_Node000016" title=" " alt="" coords="132,360,154,411,172,440,196,466,202,470,199,474,192,469,168,443,149,414,127,362"/>
-<area shape="rect" id="Node000017" href="$d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17" title="search a word/string that starts with a given prefix" alt="" coords="194,530,343,586"/>
-<area shape="poly" id="edge18_Node000002_Node000017" title=" " alt="" coords="130,360,149,432,169,476,196,517,197,518,193,522,192,520,164,479,144,434,125,361"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/back.html#" title=" " alt="" coords="408,5,524,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="303,97,343,67,390,40,401,35,404,39,393,45,346,72,306,101"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/stack/pop.html#" title=" " alt="" coords="412,55,520,80"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="343,102,406,83,407,88,344,107"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/pop_back.html#" title=" " alt="" coords="594,200,738,226"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="344,120,439,123,491,130,541,141,593,162,636,189,633,193,590,167,540,146,490,135,439,128,344,126"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/stack/push.html#" title=" " alt="" coords="408,156,524,182"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="344,141,394,151,393,156,343,146"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/stack/top.html#" title=" " alt="" coords="413,205,519,231"/>
-<area shape="poly" id="edge7_Node000003_Node000008" title=" " alt="" coords="318,154,392,192,406,197,404,202,390,197,316,158"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="403,255,529,280"/>
-<area shape="poly" id="edge10_Node000010_Node000011" title=" " alt="" coords="344,265,388,265,388,270,344,270"/>
-<area shape="rect" id="Node000013" href="$d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd" title="helper function to predict/recommend words that starts with a given prefix from the end of prefix&#39;s n..." alt="" coords="391,329,541,385"/>
-<area shape="poly" id="edge12_Node000012_Node000013" title=" " alt="" coords="344,348,376,350,376,355,343,354"/>
-<area shape="poly" id="edge14_Node000013_Node000006" title=" " alt="" coords="505,326,633,233,636,237,508,331"/>
-<area shape="poly" id="edge13_Node000013_Node000013" title=" " alt="" coords="427,328,427,319,434,310,447,304,466,302,487,305,500,312,497,317,485,310,466,308,449,309,438,314,432,321,432,329"/>
-<area shape="rect" id="Node000014" 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="589,344,743,370"/>
-<area shape="poly" id="edge15_Node000013_Node000014" title=" " alt="" coords="541,354,573,354,573,360,541,360"/>
-</map>
diff --git a/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index f8f44eb7c..000000000
--- a/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-844bc27b3f11120f54de131666dd007f
\ No newline at end of file
diff --git a/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index e21e5bce9..000000000
--- a/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,422 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 444 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 561;
-var viewHeight = 444;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-188.5 0,-188.5 0,-169.25 37,-169.25 37,-188.5"/>
-<text text-anchor="middle" x="18.5" y="-175" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-188.5 73,-188.5 73,-169.25 105.5,-169.25 105.5,-188.5"/>
-<text text-anchor="middle" x="89.25" y="-175" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-178.88C44.58,-178.88 53.31,-178.88 61.45,-178.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-182.38 71.2,-178.88 61.2,-175.38 61.2,-182.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75" target="_top" xlink:title="delete a word/string from a trie">
-<polygon fill="white" stroke="#666666" points="253.5,-364.75 141.5,-364.75 141.5,-323 253.5,-323 253.5,-364.75"/>
-<text text-anchor="start" x="149.5" y="-351.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="149.5" y="-340" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="197.5" y="-328.75" font-family="Helvetica,sans-Serif" font-size="10.00">::delete_word</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.14,-188.88C96.91,-211.89 111.26,-269.45 141.5,-306.88 143.92,-309.87 146.66,-312.72 149.57,-315.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.09,-317.89 157.02,-321.57 151.55,-312.5 147.09,-317.89"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224.25,-297.5 170.75,-297.5 170.75,-278.25 224.25,-278.25 224.25,-297.5"/>
-<text text-anchor="middle" x="197.5" y="-284" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.28,-188.8C99.39,-207.22 114.94,-246.82 141.5,-268.88 146.78,-273.26 153.13,-276.65 159.6,-279.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.44,-282.57 169.03,-282.5 160.71,-275.95 158.44,-282.57"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2" target="_top" xlink:title="insert the string into the trie">
-<polygon fill="white" stroke="#666666" points="253.5,-259.75 141.5,-259.75 141.5,-218 253.5,-218 253.5,-259.75"/>
-<text text-anchor="start" x="149.5" y="-246.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="149.5" y="-235" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="197.5" y="-223.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge9_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.88,-188.19C116,-194.18 129.47,-202.08 141.5,-208.88 143.38,-209.94 145.3,-211.02 147.25,-212.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.3,-215.03 155.74,-216.82 148.69,-208.9 145.3,-215.03"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4" target="_top" xlink:title="predict/recommend a word that starts with a given prefix">
-<polygon fill="white" stroke="#666666" points="253.5,-199.75 141.5,-199.75 141.5,-158 253.5,-158 253.5,-199.75"/>
-<text text-anchor="start" x="149.5" y="-186.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="149.5" y="-175" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="197.5" y="-163.75" font-family="Helvetica,sans-Serif" font-size="10.00">::predict_words</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge11_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge11_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.93,-178.88C112.67,-178.88 121.04,-178.88 129.95,-178.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.93,-182.38 139.93,-178.88 129.93,-175.38 129.93,-182.38"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f" target="_top" xlink:title="search a word/string inside the trie">
-<polygon fill="white" stroke="#666666" points="253.5,-139.75 141.5,-139.75 141.5,-98 253.5,-98 253.5,-139.75"/>
-<text text-anchor="start" x="149.5" y="-126.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="149.5" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="197.5" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node15 -->
-<g id="edge16_Node000002_Node000015" class="edge">
-<title>Node2&#45;&gt;Node15</title>
-<g id="a_edge16_Node000002_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.88,-169.56C116,-163.57 129.47,-155.67 141.5,-148.88 143.38,-147.81 145.3,-146.73 147.25,-145.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.69,-148.85 155.74,-140.93 145.3,-142.72 148.69,-148.85"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="240.75,-79.5 154.25,-79.5 154.25,-60.25 240.75,-60.25 240.75,-79.5"/>
-<text text-anchor="middle" x="197.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node16 -->
-<g id="edge17_Node000002_Node000016" class="edge">
-<title>Node2&#45;&gt;Node16</title>
-<g id="a_edge17_Node000002_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.28,-168.95C99.39,-150.53 114.94,-110.93 141.5,-88.88 143,-87.63 144.58,-86.47 146.23,-85.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.79,-88.52 154.89,-80.65 144.43,-82.37 147.79,-88.52"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17" target="_top" xlink:title="search a word/string that starts with a given prefix">
-<polygon fill="white" stroke="#666666" points="253.5,-41.75 141.5,-41.75 141.5,0 253.5,0 253.5,-41.75"/>
-<text text-anchor="start" x="149.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="197.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::startwith</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node17 -->
-<g id="edge18_Node000002_Node000017" class="edge">
-<title>Node2&#45;&gt;Node17</title>
-<g id="a_edge18_Node000002_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.84,-169.02C96.05,-145.82 109.39,-87.03 141.5,-50.88 141.85,-50.48 142.21,-50.09 142.58,-49.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.76,-52.44 149.88,-43.17 140.09,-47.22 144.76,-52.44"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="388.75,-435.5 302.25,-435.5 302.25,-416.25 388.75,-416.25 388.75,-435.5"/>
-<text text-anchor="middle" x="345.5" y="-422" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.26,-365.12C241.8,-378.78 266.02,-396.11 289.5,-407.88 292.19,-409.22 295,-410.5 297.86,-411.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="296.38,-414.88 306.97,-415.21 298.89,-408.35 296.38,-414.88"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="386.12,-398.5 304.88,-398.5 304.88,-379.25 386.12,-379.25 386.12,-398.5"/>
-<text text-anchor="middle" x="345.5" y="-385" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.7,-360.89C269.27,-365.69 285.99,-370.84 300.79,-375.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.65,-378.71 310.23,-378.31 301.71,-372.02 299.65,-378.71"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="549.12,-289.5 441.62,-289.5 441.62,-270.25 549.12,-270.25 549.12,-289.5"/>
-<text text-anchor="middle" x="495.38" y="-276" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.92,-347.21C295.38,-348.14 353.05,-346.06 401.5,-331.88 427.27,-324.33 453.7,-308.6 471.75,-296.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="473.65,-299.35 479.85,-290.76 469.64,-293.61 473.65,-299.35"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="388.75,-322.5 302.25,-322.5 302.25,-303.25 388.75,-303.25 388.75,-322.5"/>
-<text text-anchor="middle" x="345.5" y="-309" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.7,-332.16C265.94,-329.56 278.89,-326.81 291.06,-324.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.44,-327.72 300.49,-322.22 289.98,-320.87 291.44,-327.72"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/top.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385,-285.5 306,-285.5 306,-266.25 385,-266.25 385,-285.5"/>
-<text text-anchor="middle" x="345.5" y="-272" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M233.6,-322.59C250.19,-313.05 270.48,-302.13 289.5,-293.88 292.82,-292.44 296.29,-291.04 299.81,-289.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.72,-293.11 308.96,-286.45 298.37,-286.52 300.72,-293.11"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="392.5,-248.5 298.5,-248.5 298.5,-229.25 392.5,-229.25 392.5,-248.5"/>
-<text text-anchor="middle" x="345.5" y="-235" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge10_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge10_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.7,-238.88C264.6,-238.88 276.08,-238.88 287.06,-238.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.76,-242.38 296.76,-238.88 286.76,-235.38 286.76,-242.38"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd" target="_top" xlink:title="helper function to predict/recommend words that starts with a given prefix from the end of prefix&#39;s n...">
-<polygon fill="white" stroke="#666666" points="401.5,-192.75 289.5,-192.75 289.5,-151 401.5,-151 401.5,-192.75"/>
-<text text-anchor="start" x="297.5" y="-179.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="297.5" y="-168" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="345.5" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_all_words</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge12_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge12_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.7,-176.23C261.6,-175.85 269.8,-175.46 277.89,-175.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.89,-178.57 287.71,-174.6 277.56,-171.58 277.89,-178.57"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node6 -->
-<g id="edge14_Node000013_Node000006" class="edge">
-<title>Node13&#45;&gt;Node6</title>
-<g id="a_edge14_Node000013_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M375.72,-193.21C403.93,-213.82 446.05,-244.58 471.79,-263.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="469.42,-265.98 479.56,-269.06 473.55,-260.33 469.42,-265.98"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node13 -->
-<g id="edge13_Node000013_Node000013" class="edge">
-<title>Node13&#45;&gt;Node13</title>
-<g id="a_edge13_Node000013_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M318.18,-193.07C315.58,-202.55 324.69,-210.75 345.5,-210.75 357.53,-210.75 365.65,-208.01 369.86,-203.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="373.15,-205.1 372.42,-194.53 366.4,-203.25 373.15,-205.1"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="553.25,-181.5 437.5,-181.5 437.5,-162.25 553.25,-162.25 553.25,-181.5"/>
-<text text-anchor="middle" x="495.38" y="-168" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge15_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge15_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M401.98,-171.88C409.69,-171.88 417.69,-171.88 425.6,-171.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="425.59,-175.38 435.59,-171.88 425.59,-168.38 425.59,-175.38"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 8bd554612..000000000
--- a/d5/d8a/trie__using__hashmap_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,339 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="561pt" height="444pt"
- viewBox="0.00 0.00 561.25 443.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 439.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-188.5 0,-188.5 0,-169.25 37,-169.25 37,-188.5"/>
-<text text-anchor="middle" x="18.5" y="-175" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-188.5 73,-188.5 73,-169.25 105.5,-169.25 105.5,-188.5"/>
-<text text-anchor="middle" x="89.25" y="-175" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-178.88C44.58,-178.88 53.31,-178.88 61.45,-178.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-182.38 71.2,-178.88 61.2,-175.38 61.2,-182.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75" target="_top" xlink:title="delete a word/string from a trie">
-<polygon fill="white" stroke="#666666" points="253.5,-364.75 141.5,-364.75 141.5,-323 253.5,-323 253.5,-364.75"/>
-<text text-anchor="start" x="149.5" y="-351.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="149.5" y="-340" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="197.5" y="-328.75" font-family="Helvetica,sans-Serif" font-size="10.00">::delete_word</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.14,-188.88C96.91,-211.89 111.26,-269.45 141.5,-306.88 143.92,-309.87 146.66,-312.72 149.57,-315.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.09,-317.89 157.02,-321.57 151.55,-312.5 147.09,-317.89"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224.25,-297.5 170.75,-297.5 170.75,-278.25 224.25,-278.25 224.25,-297.5"/>
-<text text-anchor="middle" x="197.5" y="-284" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.28,-188.8C99.39,-207.22 114.94,-246.82 141.5,-268.88 146.78,-273.26 153.13,-276.65 159.6,-279.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.44,-282.57 169.03,-282.5 160.71,-275.95 158.44,-282.57"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2" target="_top" xlink:title="insert the string into the trie">
-<polygon fill="white" stroke="#666666" points="253.5,-259.75 141.5,-259.75 141.5,-218 253.5,-218 253.5,-259.75"/>
-<text text-anchor="start" x="149.5" y="-246.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="149.5" y="-235" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="197.5" y="-223.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge9_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.88,-188.19C116,-194.18 129.47,-202.08 141.5,-208.88 143.38,-209.94 145.3,-211.02 147.25,-212.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.3,-215.03 155.74,-216.82 148.69,-208.9 145.3,-215.03"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4" target="_top" xlink:title="predict/recommend a word that starts with a given prefix">
-<polygon fill="white" stroke="#666666" points="253.5,-199.75 141.5,-199.75 141.5,-158 253.5,-158 253.5,-199.75"/>
-<text text-anchor="start" x="149.5" y="-186.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="149.5" y="-175" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="197.5" y="-163.75" font-family="Helvetica,sans-Serif" font-size="10.00">::predict_words</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge11_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge11_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.93,-178.88C112.67,-178.88 121.04,-178.88 129.95,-178.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.93,-182.38 139.93,-178.88 129.93,-175.38 129.93,-182.38"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f" target="_top" xlink:title="search a word/string inside the trie">
-<polygon fill="white" stroke="#666666" points="253.5,-139.75 141.5,-139.75 141.5,-98 253.5,-98 253.5,-139.75"/>
-<text text-anchor="start" x="149.5" y="-126.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="149.5" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="197.5" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node15 -->
-<g id="edge16_Node000002_Node000015" class="edge">
-<title>Node2&#45;&gt;Node15</title>
-<g id="a_edge16_Node000002_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.88,-169.56C116,-163.57 129.47,-155.67 141.5,-148.88 143.38,-147.81 145.3,-146.73 147.25,-145.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.69,-148.85 155.74,-140.93 145.3,-142.72 148.69,-148.85"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="240.75,-79.5 154.25,-79.5 154.25,-60.25 240.75,-60.25 240.75,-79.5"/>
-<text text-anchor="middle" x="197.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node16 -->
-<g id="edge17_Node000002_Node000016" class="edge">
-<title>Node2&#45;&gt;Node16</title>
-<g id="a_edge17_Node000002_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.28,-168.95C99.39,-150.53 114.94,-110.93 141.5,-88.88 143,-87.63 144.58,-86.47 146.23,-85.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.79,-88.52 154.89,-80.65 144.43,-82.37 147.79,-88.52"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17" target="_top" xlink:title="search a word/string that starts with a given prefix">
-<polygon fill="white" stroke="#666666" points="253.5,-41.75 141.5,-41.75 141.5,0 253.5,0 253.5,-41.75"/>
-<text text-anchor="start" x="149.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="197.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::startwith</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node17 -->
-<g id="edge18_Node000002_Node000017" class="edge">
-<title>Node2&#45;&gt;Node17</title>
-<g id="a_edge18_Node000002_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.84,-169.02C96.05,-145.82 109.39,-87.03 141.5,-50.88 141.85,-50.48 142.21,-50.09 142.58,-49.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.76,-52.44 149.88,-43.17 140.09,-47.22 144.76,-52.44"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="388.75,-435.5 302.25,-435.5 302.25,-416.25 388.75,-416.25 388.75,-435.5"/>
-<text text-anchor="middle" x="345.5" y="-422" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.26,-365.12C241.8,-378.78 266.02,-396.11 289.5,-407.88 292.19,-409.22 295,-410.5 297.86,-411.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="296.38,-414.88 306.97,-415.21 298.89,-408.35 296.38,-414.88"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="386.12,-398.5 304.88,-398.5 304.88,-379.25 386.12,-379.25 386.12,-398.5"/>
-<text text-anchor="middle" x="345.5" y="-385" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.7,-360.89C269.27,-365.69 285.99,-370.84 300.79,-375.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.65,-378.71 310.23,-378.31 301.71,-372.02 299.65,-378.71"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="549.12,-289.5 441.62,-289.5 441.62,-270.25 549.12,-270.25 549.12,-289.5"/>
-<text text-anchor="middle" x="495.38" y="-276" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.92,-347.21C295.38,-348.14 353.05,-346.06 401.5,-331.88 427.27,-324.33 453.7,-308.6 471.75,-296.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="473.65,-299.35 479.85,-290.76 469.64,-293.61 473.65,-299.35"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="388.75,-322.5 302.25,-322.5 302.25,-303.25 388.75,-303.25 388.75,-322.5"/>
-<text text-anchor="middle" x="345.5" y="-309" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.7,-332.16C265.94,-329.56 278.89,-326.81 291.06,-324.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.44,-327.72 300.49,-322.22 289.98,-320.87 291.44,-327.72"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/top.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385,-285.5 306,-285.5 306,-266.25 385,-266.25 385,-285.5"/>
-<text text-anchor="middle" x="345.5" y="-272" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M233.6,-322.59C250.19,-313.05 270.48,-302.13 289.5,-293.88 292.82,-292.44 296.29,-291.04 299.81,-289.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.72,-293.11 308.96,-286.45 298.37,-286.52 300.72,-293.11"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="392.5,-248.5 298.5,-248.5 298.5,-229.25 392.5,-229.25 392.5,-248.5"/>
-<text text-anchor="middle" x="345.5" y="-235" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge10_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge10_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.7,-238.88C264.6,-238.88 276.08,-238.88 287.06,-238.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.76,-242.38 296.76,-238.88 286.76,-235.38 286.76,-242.38"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd" target="_top" xlink:title="helper function to predict/recommend words that starts with a given prefix from the end of prefix&#39;s n...">
-<polygon fill="white" stroke="#666666" points="401.5,-192.75 289.5,-192.75 289.5,-151 401.5,-151 401.5,-192.75"/>
-<text text-anchor="start" x="297.5" y="-179.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
-<text text-anchor="start" x="297.5" y="-168" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
-<text text-anchor="middle" x="345.5" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_all_words</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge12_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge12_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.7,-176.23C261.6,-175.85 269.8,-175.46 277.89,-175.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.89,-178.57 287.71,-174.6 277.56,-171.58 277.89,-178.57"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node6 -->
-<g id="edge14_Node000013_Node000006" class="edge">
-<title>Node13&#45;&gt;Node6</title>
-<g id="a_edge14_Node000013_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M375.72,-193.21C403.93,-213.82 446.05,-244.58 471.79,-263.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="469.42,-265.98 479.56,-269.06 473.55,-260.33 469.42,-265.98"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node13 -->
-<g id="edge13_Node000013_Node000013" class="edge">
-<title>Node13&#45;&gt;Node13</title>
-<g id="a_edge13_Node000013_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M318.18,-193.07C315.58,-202.55 324.69,-210.75 345.5,-210.75 357.53,-210.75 365.65,-208.01 369.86,-203.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="373.15,-205.1 372.42,-194.53 366.4,-203.25 373.15,-205.1"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="553.25,-181.5 437.5,-181.5 437.5,-162.25 553.25,-162.25 553.25,-181.5"/>
-<text text-anchor="middle" x="495.38" y="-168" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge15_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge15_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M401.98,-171.88C409.69,-171.88 417.69,-171.88 425.6,-171.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="425.59,-175.38 435.59,-171.88 425.59,-168.38 425.59,-175.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d8a/trie__using__hashmap_8cpp_source.html b/d5/d8a/trie__using__hashmap_8cpp_source.html
new file mode 100644
index 000000000..1b726c877
--- /dev/null
+++ b/d5/d8a/trie__using__hashmap_8cpp_source.html
@@ -0,0 +1,445 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/trie_using_hashmap.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/d8a/trie__using__hashmap_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">trie_using_hashmap.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d5/d8a/trie__using__hashmap_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cassert&gt;</span>        </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;iostream&gt;</span>       </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;memory&gt;</span>         </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;stack&gt;</span>          </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;unordered_map&gt;</span>  </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;vector&gt;</span>         </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d3c/namespacedata__structures.html">data_structures</a> {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d0a/namespacetrie__using__hashmap.html">trie_using_hashmap</a> {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="foldopen" id="foldopen00039" data-start="{" data-end="};">
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html">   39</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html">Trie</a> {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> <span class="keyword">private</span>:</div>
+<div class="foldopen" id="foldopen00044" data-start="{" data-end="};">
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">   44</a></span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Node</a> {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        std::unordered_map&lt;char16_t, std::shared_ptr&lt;Node&gt;&gt;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"><a class="line" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a08212cdc99164b59da91b81f45e2f88e">   46</a></span>            <a class="code hl_variable" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a08212cdc99164b59da91b81f45e2f88e">children</a>;  </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a3cdb077745d3dc97212d693132371219">   48</a></span>        <span class="keywordtype">bool</span> <a class="code hl_variable" href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a3cdb077745d3dc97212d693132371219">word_end</a> = <span class="keyword">false</span>;  </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    };</div>
+</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a832072498abeaa52ad43c4fc99cba248">   51</a></span>    std::shared_ptr&lt;Node&gt; <a class="code hl_variable" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a832072498abeaa52ad43c4fc99cba248">root_node</a> =</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        std::make_shared&lt;Node&gt;();  </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a092d0805a9e647c2048777dbe67b35ab">   56</a></span>    <a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a092d0805a9e647c2048777dbe67b35ab">Trie</a>() = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">   62</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">insert</a>(<span class="keyword">const</span> std::string&amp; word) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        std::shared_ptr&lt;Node&gt; curr = <a class="code hl_variable" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a832072498abeaa52ad43c4fc99cba248">root_node</a>;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        <span class="keywordflow">for</span> (<span class="keywordtype">char</span> ch : word) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            <span class="keywordflow">if</span> (curr-&gt;children.find(ch) == curr-&gt;children.end()) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>                curr-&gt;children[ch] = std::make_shared&lt;Node&gt;();</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            curr = curr-&gt;children[ch];</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        <span class="keywordflow">if</span> (!curr-&gt;word_end &amp;&amp; curr != <a class="code hl_variable" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a832072498abeaa52ad43c4fc99cba248">root_node</a>) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            curr-&gt;word_end = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        }</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    }</div>
+</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="foldopen" id="foldopen00082" data-start="{" data-end="}">
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">   82</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="keyword">const</span> std::string&amp; word) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        std::shared_ptr&lt;Node&gt; curr = <a class="code hl_variable" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a832072498abeaa52ad43c4fc99cba248">root_node</a>;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        <span class="keywordflow">for</span> (<span class="keywordtype">char</span> ch : word) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>            <span class="keywordflow">if</span> (curr-&gt;children.find(ch) == curr-&gt;children.end()) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>            curr = curr-&gt;children[ch];</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>            <span class="keywordflow">if</span> (!curr) {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>            }</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        }</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="keywordflow">if</span> (curr-&gt;word_end) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        }</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    }</div>
+</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="foldopen" id="foldopen00107" data-start="{" data-end="}">
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"><a class="line" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">  107</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="keyword">const</span> std::string&amp; prefix) {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        std::shared_ptr&lt;Node&gt; curr = <a class="code hl_variable" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a832072498abeaa52ad43c4fc99cba248">root_node</a>;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        <span class="keywordflow">for</span> (<span class="keywordtype">char</span> ch : prefix) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>            <span class="keywordflow">if</span> (curr-&gt;children.find(ch) == curr-&gt;children.end()) {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>            }</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>            curr = curr-&gt;children[ch];</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        }</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    }</div>
+</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span> </div>
+<div class="foldopen" id="foldopen00122" data-start="{" data-end="}">
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"><a class="line" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75">  122</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75">delete_word</a>(std::string word) {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        std::shared_ptr&lt;Node&gt; curr = <a class="code hl_variable" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a832072498abeaa52ad43c4fc99cba248">root_node</a>;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        std::stack&lt;std::shared_ptr&lt;Node&gt;&gt; nodes;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        <span class="keywordtype">int</span> cnt = 0;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        <span class="keywordflow">for</span> (<span class="keywordtype">char</span> ch : word) {</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>            <span class="keywordflow">if</span> (curr-&gt;children.find(ch) == curr-&gt;children.end()) {</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>                <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>            }</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>            <span class="keywordflow">if</span> (curr-&gt;word_end) {</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>                cnt++;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>            }</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span> </div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>            nodes.push(curr-&gt;children[ch]);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>            curr = curr-&gt;children[ch];</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        }</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        <span class="comment">// Delete only when it&#39;s a word, and it has children after</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>        <span class="comment">// or prefix in the line</span></div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>        <span class="keywordflow">if</span> (nodes.top()-&gt;word_end) {</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>            nodes.top()-&gt;word_end = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        }</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        <span class="comment">// Delete only when it has no children after</span></div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        <span class="comment">// and also no prefix in the line</span></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        <span class="keywordflow">while</span> (!(nodes.top()-&gt;word_end) &amp;&amp; nodes.top()-&gt;children.empty()) {</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>            nodes.pop();</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>            nodes.top()-&gt;children.erase(word.back());</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>            word.pop_back();</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        }</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    }</div>
+</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
+<div class="foldopen" id="foldopen00160" data-start="{" data-end="}">
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"><a class="line" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd">  160</a></span>    std::vector&lt;std::string&gt; <a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd">get_all_words</a>(std::vector&lt;std::string&gt; results,</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>                                           <span class="keyword">const</span> std::shared_ptr&lt;Node&gt;&amp; element,</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>                                           std::string prefix) {</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        <span class="keywordflow">if</span> (element-&gt;word_end) {</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>            results.push_back(prefix);</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>        }</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        <span class="keywordflow">if</span> (element-&gt;children.empty()) {</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>            <span class="keywordflow">return</span> results;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        }</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span>&amp; x : element-&gt;children) {</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>            std::string key = <span class="stringliteral">&quot;&quot;</span>;</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>            key = x.first;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>            prefix += key;</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span> </div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>            results =</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>                <a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd">get_all_words</a>(results, element-&gt;children[x.first], prefix);</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>            prefix.pop_back();</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        }</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span> </div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        <span class="keywordflow">return</span> results;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    }</div>
+</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span> </div>
+<div class="foldopen" id="foldopen00188" data-start="{" data-end="}">
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"><a class="line" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">  188</a></span>    std::vector&lt;std::string&gt; <a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a>(<span class="keyword">const</span> std::string&amp; prefix) {</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        std::vector&lt;std::string&gt; result;</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>        std::shared_ptr&lt;Node&gt; curr = <a class="code hl_variable" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a832072498abeaa52ad43c4fc99cba248">root_node</a>;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>        <span class="comment">// traversing until the end of the given prefix in trie</span></div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span> </div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        <span class="keywordflow">for</span> (<span class="keywordtype">char</span> ch : prefix) {</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>            <span class="keywordflow">if</span> (curr-&gt;children.find(ch) == curr-&gt;children.end()) {</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>                <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>            }</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span> </div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>            curr = curr-&gt;children[ch];</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        }</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span> </div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>        <span class="comment">// if the given prefix is the only word without children</span></div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>        <span class="keywordflow">if</span> (curr-&gt;word_end &amp;&amp; curr-&gt;children.empty()) {</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>            result.push_back(prefix);</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>            <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>        }</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span> </div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>        result = <a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd">get_all_words</a>(</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>            result, curr,</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>            prefix);  </div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span> </div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>        <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    }</div>
+</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>};</div>
+</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>}  <span class="comment">// namespace trie_using_hashmap</span></div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>}  <span class="comment">// namespace data_structures</span></div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span> </div>
+<div class="foldopen" id="foldopen00221" data-start="{" data-end="}">
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"><a class="line" href="../../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  221</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    <a class="code hl_class" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html">data_structures::trie_using_hashmap::Trie</a> obj;</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    <span class="comment">// Inserting data into trie using the insert</span></div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    <span class="comment">// method and testing it with search method</span></div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">insert</a>(<span class="stringliteral">&quot;app&quot;</span>);</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">insert</a>(<span class="stringliteral">&quot;abscond&quot;</span>);</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">insert</a>(<span class="stringliteral">&quot;about&quot;</span>);</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">insert</a>(<span class="stringliteral">&quot;apps&quot;</span>);</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">insert</a>(<span class="stringliteral">&quot;apen&quot;</span>);</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">insert</a>(<span class="stringliteral">&quot;apples&quot;</span>);</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">insert</a>(<span class="stringliteral">&quot;apple&quot;</span>);</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">insert</a>(<span class="stringliteral">&quot;approach&quot;</span>);</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">insert</a>(<span class="stringliteral">&quot;bus&quot;</span>);</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">insert</a>(<span class="stringliteral">&quot;buses&quot;</span>);</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">insert</a>(<span class="stringliteral">&quot;Apple&quot;</span>);</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">insert</a>(<span class="stringliteral">&quot;Bounce&quot;</span>);</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span> </div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    assert(!obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;appy&quot;</span>));</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;appy is not a word in trie&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span> </div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    assert(!obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;car&quot;</span>));</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;car is not a word in trie&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;app&quot;</span>));</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;apple&quot;</span>));</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;apples&quot;</span>));</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;apps&quot;</span>));</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;apen&quot;</span>));</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;approach&quot;</span>));</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;about&quot;</span>));</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;abscond&quot;</span>));</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;bus&quot;</span>));</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;buses&quot;</span>));</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;Bounce&quot;</span>));</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;Apple&quot;</span>));</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span> </div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All the Inserted words are present in the trie&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span> </div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    <span class="comment">// test for startwith prefix method</span></div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>    assert(!obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="stringliteral">&quot;approachs&quot;</span>));</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="stringliteral">&quot;approach&quot;</span>));</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="stringliteral">&quot;about&quot;</span>));</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    assert(!obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="stringliteral">&quot;appy&quot;</span>));</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="stringliteral">&quot;abscond&quot;</span>));</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="stringliteral">&quot;bus&quot;</span>));</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="stringliteral">&quot;buses&quot;</span>));</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="stringliteral">&quot;Bounce&quot;</span>));</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="stringliteral">&quot;Apple&quot;</span>));</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="stringliteral">&quot;abs&quot;</span>));</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="stringliteral">&quot;b&quot;</span>));</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="stringliteral">&quot;bus&quot;</span>));</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="stringliteral">&quot;Bo&quot;</span>));</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="stringliteral">&quot;A&quot;</span>));</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>    assert(!obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="stringliteral">&quot;Ca&quot;</span>));</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span> </div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    assert(!obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="stringliteral">&quot;C&quot;</span>));</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span> </div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All the tests passed for startwith method&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span> </div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>    <span class="comment">// test for predict_words/recommendation of words based on a given prefix</span></div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span> </div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>    std::vector&lt;std::string&gt; pred_words = obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a>(<span class="stringliteral">&quot;a&quot;</span>);</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span> </div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> std::string&amp; str : obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a>(<span class="stringliteral">&quot;a&quot;</span>)) {</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>        std::cout &lt;&lt; str &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>    }</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>    assert(pred_words.size() == 8);</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Returned all words that start with prefix a &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>    pred_words = obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a>(<span class="stringliteral">&quot;app&quot;</span>);</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span> </div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> std::string&amp; str : pred_words) {</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>        std::cout &lt;&lt; str &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>    }</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span> </div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>    assert(pred_words.size() == 5);</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Returned all words that start with prefix app &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>    pred_words = obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a>(<span class="stringliteral">&quot;A&quot;</span>);</div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span> </div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> std::string&amp; str : pred_words) {</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>        std::cout &lt;&lt; str &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>    }</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span> </div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>    assert(pred_words.size() == 1);</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Returned all words that start with prefix A &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>    pred_words = obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a>(<span class="stringliteral">&quot;bu&quot;</span>);</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span> </div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> std::string&amp; str : pred_words) {</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>        std::cout &lt;&lt; str &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>    }</div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span> </div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>    assert(pred_words.size() == 2);</div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Returned all words that start with prefix bu &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span> </div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>    <span class="comment">// tests for delete method</span></div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span> </div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>    obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75">delete_word</a>(<span class="stringliteral">&quot;app&quot;</span>);</div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>    assert(!obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">search</a>(<span class="stringliteral">&quot;app&quot;</span>));</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;word app is deleted sucessful&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span> </div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>    pred_words = obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a>(<span class="stringliteral">&quot;app&quot;</span>);</div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> std::string&amp; str : pred_words) {</div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>        std::cout &lt;&lt; str &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>    }</div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>    assert(pred_words.size() == 4);</div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;app is deleted sucessful&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span> </div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>    <span class="comment">// test case for Chinese language</span></div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span> </div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>    obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">insert</a>(<span class="stringliteral">&quot;苹果&quot;</span>);</div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>    assert(obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">startwith</a>(<span class="stringliteral">&quot;苹&quot;</span>));</div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>    pred_words = obj.<a class="code hl_function" href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">predict_words</a>(<span class="stringliteral">&quot;h&quot;</span>);</div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span> </div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>    assert(pred_words.size() == 0);</div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;No word starts with prefix h in trie&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span> </div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>}</div>
+</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span> </div>
+<div class="foldopen" id="foldopen00342" data-start="{" data-end="}">
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"><a class="line" href="../../d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  342</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>    <a class="code hl_function" href="../../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementaions</span></div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span>}</div>
+</div>
+<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html">data_structures::trie_using_hashmap::Trie</a></div><div class="ttdoc">Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...</div><div class="ttdef"><b>Definition</b> <a href="#l00039">trie_using_hashmap.cpp:39</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_a092d0805a9e647c2048777dbe67b35ab"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a092d0805a9e647c2048777dbe67b35ab">data_structures::trie_using_hashmap::Trie::Trie</a></div><div class="ttdeci">Trie()=default</div><div class="ttdoc">&lt; Constructor</div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_a7bbe538c8015e8ce158e7ed43f605ebd"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd">data_structures::trie_using_hashmap::Trie::get_all_words</a></div><div class="ttdeci">std::vector&lt; std::string &gt; get_all_words(std::vector&lt; std::string &gt; results, const std::shared_ptr&lt; Node &gt; &amp;element, std::string prefix)</div><div class="ttdoc">helper function to predict/recommend words that starts with a given prefix from the end of prefix's n...</div><div class="ttdef"><b>Definition</b> <a href="#l00160">trie_using_hashmap.cpp:160</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_a832072498abeaa52ad43c4fc99cba248"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a832072498abeaa52ad43c4fc99cba248">data_structures::trie_using_hashmap::Trie::root_node</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; root_node</div><div class="ttdoc">declaring root node of trie</div><div class="ttdef"><b>Definition</b> <a href="#l00051">trie_using_hashmap.cpp:51</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_abcae0a4456e7f583ce716e3ef466dfd2"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">data_structures::trie_using_hashmap::Trie::insert</a></div><div class="ttdeci">void insert(const std::string &amp;word)</div><div class="ttdoc">insert the string into the trie</div><div class="ttdef"><b>Definition</b> <a href="#l00062">trie_using_hashmap.cpp:62</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_ac0bf3d6791cba144b3f539835d835e75"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75">data_structures::trie_using_hashmap::Trie::delete_word</a></div><div class="ttdeci">void delete_word(std::string word)</div><div class="ttdoc">delete a word/string from a trie</div><div class="ttdef"><b>Definition</b> <a href="#l00122">trie_using_hashmap.cpp:122</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_ad71eb24207c28b546631802dba97310f"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f">data_structures::trie_using_hashmap::Trie::search</a></div><div class="ttdeci">bool search(const std::string &amp;word)</div><div class="ttdoc">search a word/string inside the trie</div><div class="ttdef"><b>Definition</b> <a href="#l00082">trie_using_hashmap.cpp:82</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_ae15fdc7f2b5023992d87a711d78566c4"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4">data_structures::trie_using_hashmap::Trie::predict_words</a></div><div class="ttdeci">std::vector&lt; std::string &gt; predict_words(const std::string &amp;prefix)</div><div class="ttdoc">predict/recommend a word that starts with a given prefix</div><div class="ttdef"><b>Definition</b> <a href="#l00188">trie_using_hashmap.cpp:188</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie__using__hashmap_1_1_trie_html_af3aee573fbabd2c1510c0f74f842dd17"><div class="ttname"><a href="../../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">data_structures::trie_using_hashmap::Trie::startwith</a></div><div class="ttdeci">bool startwith(const std::string &amp;prefix)</div><div class="ttdoc">search a word/string that starts with a given prefix</div><div class="ttdef"><b>Definition</b> <a href="#l00107">trie_using_hashmap.cpp:107</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html">data_structures</a></div><div class="ttdoc">for IO operations</div></div>
+<div class="ttc" id="anamespacetrie__using__hashmap_html"><div class="ttname"><a href="../../d7/d0a/namespacetrie__using__hashmap.html">trie_using_hashmap</a></div><div class="ttdoc">Functions for Trie data structure using hashmap implementation.</div></div>
+<div class="ttc" id="astructdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node_html"><div class="ttname"><a href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">data_structures::trie_using_hashmap::Trie::Node</a></div><div class="ttdoc">struct representing a trie node.</div><div class="ttdef"><b>Definition</b> <a href="#l00044">trie_using_hashmap.cpp:44</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node_html_a08212cdc99164b59da91b81f45e2f88e"><div class="ttname"><a href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a08212cdc99164b59da91b81f45e2f88e">data_structures::trie_using_hashmap::Trie::Node::children</a></div><div class="ttdeci">std::unordered_map&lt; char16_t, std::shared_ptr&lt; Node &gt; &gt; children</div><div class="ttdef"><b>Definition</b> <a href="#l00046">trie_using_hashmap.cpp:46</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node_html_a3cdb077745d3dc97212d693132371219"><div class="ttname"><a href="../../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a3cdb077745d3dc97212d693132371219">data_structures::trie_using_hashmap::Trie::Node::word_end</a></div><div class="ttdeci">bool word_end</div><div class="ttdoc">boolean variable to represent the node end</div><div class="ttdef"><b>Definition</b> <a href="#l00048">trie_using_hashmap.cpp:48</a></div></div>
+<div class="ttc" id="atrie__using__hashmap_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d8a/trie__using__hashmap_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> <a href="#l00221">trie_using_hashmap.cpp:221</a></div></div>
+<div class="ttc" id="atrie__using__hashmap_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00342">trie_using_hashmap.cpp:342</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d5/d8a/trie__using__hashmap_8cpp.html">trie_using_hashmap.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/d8b/structothers_1_1recursive__tree__traversals_1_1_node-members.html b/d5/d8b/structothers_1_1recursive__tree__traversals_1_1_node-members.html
index e314cd25d..cb7dc15e9 100644
--- a/d5/d8b/structothers_1_1recursive__tree__traversals_1_1_node-members.html
+++ b/d5/d8b/structothers_1_1recursive__tree__traversals_1_1_node-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d5/d8e/huffman_8cpp_source.html b/d5/d8e/huffman_8cpp_source.html
new file mode 100644
index 000000000..8dbb186e3
--- /dev/null
+++ b/d5/d8e/huffman_8cpp_source.html
@@ -0,0 +1,253 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: greedy_algorithms/huffman.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/d8e/huffman_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">huffman.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">// C++ program for Huffman Coding</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &lt;queue&gt;</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment">// A Huffman tree node</span></div>
+<div class="foldopen" id="foldopen00007" data-start="{" data-end="};">
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"><a class="line" href="../../d5/d29/struct_min_heap_node.html">    7</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a> {</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>    <span class="comment">// One of the input characters</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    <span class="keywordtype">char</span> data;</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    <span class="comment">// Frequency of the character</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="keywordtype">unsigned</span> freq;</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="comment">// Left and right child</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <a class="code hl_struct" href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a> *left, *right;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <a class="code hl_struct" href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a>(<span class="keywordtype">char</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, <span class="keywordtype">unsigned</span> freq)</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        left = right = NULL;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        this-&gt;data = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        this-&gt;freq = freq;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    }</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>};</div>
+</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keywordtype">void</span> deleteAll(<span class="keyword">const</span> <a class="code hl_struct" href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a>* <span class="keyword">const</span> root) {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordflow">if</span> (root) {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        deleteAll(root-&gt;left);</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>        deleteAll(root-&gt;right);</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        <span class="keyword">delete</span> root;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    }</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>}</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="comment">// For comparison of</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="comment">// two heap nodes (needed in min heap)</span></div>
+<div class="foldopen" id="foldopen00036" data-start="{" data-end="};">
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../d1/db3/structcompare.html">   36</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../d1/db3/structcompare.html">compare</a> {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordtype">bool</span> operator()(<span class="keyword">const</span> <a class="code hl_struct" href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a>* <span class="keyword">const</span> l,</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>                    <span class="keyword">const</span> <a class="code hl_struct" href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a>* <span class="keyword">const</span> r)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        <span class="keywordflow">return</span> l-&gt;freq &gt; r-&gt;freq;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    }</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>};</div>
+</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="comment">// Prints huffman codes from</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="comment">// the root of Huffman Tree.</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="keywordtype">void</span> printCodes(<span class="keyword">struct</span> <a class="code hl_struct" href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a>* root, <span class="keyword">const</span> <span class="keywordtype">string</span>&amp; str) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keywordflow">if</span> (!root)</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">if</span> (root-&gt;data != <span class="charliteral">&#39;$&#39;</span>)</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        cout &lt;&lt; root-&gt;data &lt;&lt; <span class="stringliteral">&quot;: &quot;</span> &lt;&lt; str &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    printCodes(root-&gt;left, str + <span class="stringliteral">&quot;0&quot;</span>);</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    printCodes(root-&gt;right, str + <span class="stringliteral">&quot;1&quot;</span>);</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>}</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="comment">// The main function that builds a Huffman Tree and</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="comment">// print codes by traversing the built Huffman Tree</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="keywordtype">void</span> HuffmanCodes(<span class="keyword">const</span> <span class="keywordtype">char</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[], <span class="keyword">const</span> <span class="keywordtype">int</span> freq[], <span class="keywordtype">int</span> size) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a> *left, *right;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="comment">// Create a min heap &amp; inserts all characters of data[]</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    priority_queue&lt;MinHeapNode*, vector&lt;MinHeapNode*&gt;, <a class="code hl_struct" href="../../d1/db3/structcompare.html">compare</a>&gt; minHeap;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i)</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        minHeap.push(<span class="keyword">new</span> <a class="code hl_struct" href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i], freq[i]));</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="comment">// Iterate while size of heap doesn&#39;t become 1</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keywordflow">while</span> (minHeap.size() != 1) {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        <span class="comment">// Extract the two minimum</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        <span class="comment">// freq items from min heap</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        left = minHeap.top();</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        minHeap.pop();</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        right = minHeap.top();</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        minHeap.pop();</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        <span class="comment">// Create a new internal node with</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        <span class="comment">// frequency equal to the sum of the</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        <span class="comment">// two nodes frequencies. Make the</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="comment">// two extracted node as left and right children</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <span class="comment">// of this new node. Add this node</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <span class="comment">// to the min heap &#39;$&#39; is a special value</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="comment">// for internal nodes, not used</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        <span class="keyword">auto</span>* <span class="keyword">const</span> top = <span class="keyword">new</span> <a class="code hl_struct" href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a>(<span class="charliteral">&#39;$&#39;</span>, left-&gt;freq + right-&gt;freq);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        top-&gt;left = left;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        top-&gt;right = right;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        minHeap.push(top);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="comment">// Print Huffman codes using</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="comment">// the Huffman tree built above</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    printCodes(minHeap.top(), <span class="stringliteral">&quot;&quot;</span>);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    deleteAll(minHeap.top());</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>}</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span><span class="comment">// Driver program to test above functions</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="keywordtype">char</span> arr[] = {<span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;b&#39;</span>, <span class="charliteral">&#39;c&#39;</span>, <span class="charliteral">&#39;d&#39;</span>, <span class="charliteral">&#39;e&#39;</span>, <span class="charliteral">&#39;f&#39;</span>};</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keywordtype">int</span> freq[] = {5, 9, 12, 13, 16, 45};</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="keywordtype">int</span> size = <span class="keyword">sizeof</span>(arr) / <span class="keyword">sizeof</span>(arr[0]);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    HuffmanCodes(arr, freq, size);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="astruct_min_heap_node_html"><div class="ttname"><a href="../../d5/d29/struct_min_heap_node.html">MinHeapNode</a></div><div class="ttdef"><b>Definition</b> <a href="#l00007">huffman.cpp:7</a></div></div>
+<div class="ttc" id="astructcompare_html"><div class="ttname"><a href="../../d1/db3/structcompare.html">compare</a></div><div class="ttdef"><b>Definition</b> <a href="#l00036">huffman.cpp:36</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_0eaa691bd54ab0922ca7f50599de6d22.html">greedy_algorithms</a></li><li class="navelem"><b>huffman.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/d90/palindrome__partitioning_8cpp.html b/d5/d90/palindrome__partitioning_8cpp.html
index 983a20353..2610b0060 100644
--- a/d5/d90/palindrome__partitioning_8cpp.html
+++ b/d5/d90/palindrome__partitioning_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/palindrome_partitioning.cpp File Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming/palindrome_partitioning.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for palindrome_partitioning.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d88/palindrome__partitioning_8cpp__incl.svg" width="432" height="126"><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">
+</div>
+<p><a href="../../d5/d90/palindrome__partitioning_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
@@ -135,7 +154,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a52ee22882858d2b1cf04293f02ed839a" id="r_a52ee22882858d2b1cf04293f02ed839a"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a52ee22882858d2b1cf04293f02ed839a">dynamic_programming::palindrome_partitioning::pal_part</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str)</td></tr>
+<tr class="memitem:a52ee22882858d2b1cf04293f02ed839a" id="r_a52ee22882858d2b1cf04293f02ed839a"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a52ee22882858d2b1cf04293f02ed839a">dynamic_programming::palindrome_partitioning::pal_part</a> (const std::string &amp;str)</td></tr>
 <tr class="separator:a52ee22882858d2b1cf04293f02ed839a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
 <tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test Function.  <br /></td></tr>
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Implements <a href="https://leetcode.com/problems/palindrome-partitioning-ii/" target="_blank">Palindrome Partitioning</a> algorithm, giving you the minimum number of partitions you need to make. </p>
 <p>palindrome partitioning uses dynamic programming and goes to all the possible partitions to find the minimum you are given a string and you need to give minimum number of partitions needed to divide it into a number of palindromes [Palindrome Partitioning] (<a href="https://www.geeksforgeeks.org/palindrome-partitioning-dp-17/">https://www.geeksforgeeks.org/palindrome-partitioning-dp-17/</a>) overall time complexity O(n^2) For example: example 1:- String : "nitik" Output : 2 =&gt; "n
 | iti | k" For example: example 2:- String : "ababbbabbababa" Output : 3 =&gt; "aba | b | bbabb | ababa" </p><dl class="section author"><dt>Author</dt><dd>[Sujay Kaushik] (<a href="https://github.com/sujaykaushik008">https://github.com/sujaykaushik008</a>) </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d5/d90/palindrome__partitioning_8cpp_source.html">palindrome_partitioning.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -166,17 +187,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d90/palindrome__partitioning_8cpp_source.html#l00128">128</a> of file <a class="el" href="../../d5/d90/palindrome__partitioning_8cpp_source.html">palindrome_partitioning.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  128</span>           {</div>
 <div class="line"><span class="lineno">  129</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the test</span></div>
 <div class="line"><span class="lineno">  130</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  131</span>}</div>
-<div class="ttc" id="apalindrome__partitioning_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test Function.</div><div class="ttdef"><b>Definition</b> palindrome_partitioning.cpp:98</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d90/palindrome__partitioning_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="apalindrome__partitioning_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test Function.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d90/palindrome__partitioning_8cpp_source.html#l00098">palindrome_partitioning.cpp:98</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a52ee22882858d2b1cf04293f02ed839a" name="a52ee22882858d2b1cf04293f02ed839a"></a>
@@ -188,7 +206,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">int dynamic_programming::palindrome_partitioning::pal_part </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -200,15 +218,17 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>minimum number of partitions </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d90/palindrome__partitioning_8cpp_source.html#l00045">45</a> of file <a class="el" href="../../d5/d90/palindrome__partitioning_8cpp_source.html">palindrome_partitioning.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   45</span>                                   {</div>
-<div class="line"><span class="lineno">   46</span>    <span class="keywordtype">int</span> n = str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
+<div class="line"><span class="lineno">   46</span>    <span class="keywordtype">int</span> n = str.size();</div>
 <div class="line"><span class="lineno">   47</span> </div>
 <div class="line"><span class="lineno">   48</span>    <span class="comment">// creating lookup table for minimum number of cuts</span></div>
-<div class="line"><span class="lineno">   49</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;int&gt;</a> &gt; cuts(n, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(n, 0));</div>
+<div class="line"><span class="lineno">   49</span>    std::vector&lt;std::vector&lt;int&gt; &gt; cuts(n, std::vector&lt;int&gt;(n, 0));</div>
 <div class="line"><span class="lineno">   50</span> </div>
 <div class="line"><span class="lineno">   51</span>    <span class="comment">// creating lookup table for palindrome checking</span></div>
-<div class="line"><span class="lineno">   52</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;bool&gt;</a> &gt; is_palindrome(n,</div>
-<div class="line"><span class="lineno">   53</span>                                                  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a>(n, <span class="keyword">false</span>));</div>
+<div class="line"><span class="lineno">   52</span>    std::vector&lt;std::vector&lt;bool&gt; &gt; is_palindrome(n,</div>
+<div class="line"><span class="lineno">   53</span>                                                  std::vector&lt;bool&gt;(n, <span class="keyword">false</span>));</div>
 <div class="line"><span class="lineno">   54</span> </div>
 <div class="line"><span class="lineno">   55</span>    <span class="comment">// initialization</span></div>
 <div class="line"><span class="lineno">   56</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
@@ -233,10 +253,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   75</span>                cuts[start_index][end_index] = 0;</div>
 <div class="line"><span class="lineno">   76</span>            } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">   77</span>                cuts[start_index][end_index] = INT_MAX;</div>
-<div class="line"><span class="lineno">   78</span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> partition = start_index; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/partition.html">partition</a> &lt;= end_index - 1;</div>
-<div class="line"><span class="lineno">   79</span>                     <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/partition.html">partition</a>++) {</div>
+<div class="line"><span class="lineno">   78</span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> partition = start_index; partition &lt;= end_index - 1;</div>
+<div class="line"><span class="lineno">   79</span>                     partition++) {</div>
 <div class="line"><span class="lineno">   80</span>                    cuts[start_index][end_index] =</div>
-<div class="line"><span class="lineno">   81</span>                        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(cuts[start_index][end_index],</div>
+<div class="line"><span class="lineno">   81</span>                        std::min(cuts[start_index][end_index],</div>
 <div class="line"><span class="lineno">   82</span>                                 cuts[start_index][partition] +</div>
 <div class="line"><span class="lineno">   83</span>                                     cuts[partition + 1][end_index] + 1);</div>
 <div class="line"><span class="lineno">   84</span>                }</div>
@@ -246,16 +266,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   88</span> </div>
 <div class="line"><span class="lineno">   89</span>    <span class="keywordflow">return</span> cuts[0][n - 1];</div>
 <div class="line"><span class="lineno">   90</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="apartition_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/partition.html">std::partition</a></div><div class="ttdeci">T partition(T... args)</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d90/palindrome__partitioning_8cpp_a52ee22882858d2b1cf04293f02ed839a_cgraph.svg" width="332" height="100"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -283,12 +294,14 @@ Here is the call graph for this function:</div>
 
 <p>Test Function. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d90/palindrome__partitioning_8cpp_source.html#l00098">98</a> of file <a class="el" href="../../d5/d90/palindrome__partitioning_8cpp_source.html">palindrome_partitioning.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   98</span>                   {</div>
 <div class="line"><span class="lineno">   99</span>    <span class="comment">// custom input vector</span></div>
-<div class="line"><span class="lineno">  100</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::string&gt;</a> custom_input{<span class="stringliteral">&quot;nitik&quot;</span>, <span class="stringliteral">&quot;ababbbabbababa&quot;</span>, <span class="stringliteral">&quot;abdc&quot;</span>};</div>
+<div class="line"><span class="lineno">  100</span>    std::vector&lt;std::string&gt; custom_input{<span class="stringliteral">&quot;nitik&quot;</span>, <span class="stringliteral">&quot;ababbbabbababa&quot;</span>, <span class="stringliteral">&quot;abdc&quot;</span>};</div>
 <div class="line"><span class="lineno">  101</span> </div>
 <div class="line"><span class="lineno">  102</span>    <span class="comment">// calculated output vector by pal_part Function</span></div>
-<div class="line"><span class="lineno">  103</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> calculated_output(3);</div>
+<div class="line"><span class="lineno">  103</span>    std::vector&lt;int&gt; calculated_output(3);</div>
 <div class="line"><span class="lineno">  104</span> </div>
 <div class="line"><span class="lineno">  105</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 3; i++) {</div>
 <div class="line"><span class="lineno">  106</span>        calculated_output[i] =</div>
@@ -297,7 +310,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  109</span>    }</div>
 <div class="line"><span class="lineno">  110</span> </div>
 <div class="line"><span class="lineno">  111</span>    <span class="comment">// expected output vector</span></div>
-<div class="line"><span class="lineno">  112</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> expected_output{2, 3, 3};</div>
+<div class="line"><span class="lineno">  112</span>    std::vector&lt;int&gt; expected_output{2, 3, 3};</div>
 <div class="line"><span class="lineno">  113</span> </div>
 <div class="line"><span class="lineno">  114</span>    <span class="comment">// Testing implementation via assert function</span></div>
 <div class="line"><span class="lineno">  115</span>    <span class="comment">// It will throw error if any of the expected test fails</span></div>
@@ -306,10 +319,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  118</span>        assert(expected_output[i] == calculated_output[i]);</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>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests passed successfully!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  121</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests passed successfully!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  122</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="apalindrome__partitioning_8cpp_html_a52ee22882858d2b1cf04293f02ed839a"><div class="ttname"><a href="#a52ee22882858d2b1cf04293f02ed839a">dynamic_programming::palindrome_partitioning::pal_part</a></div><div class="ttdeci">int pal_part(const std::string &amp;str)</div><div class="ttdef"><b>Definition</b> palindrome_partitioning.cpp:45</div></div>
+<div class="ttc" id="apalindrome__partitioning_8cpp_html_a52ee22882858d2b1cf04293f02ed839a"><div class="ttname"><a href="#a52ee22882858d2b1cf04293f02ed839a">dynamic_programming::palindrome_partitioning::pal_part</a></div><div class="ttdeci">int pal_part(const std::string &amp;str)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d90/palindrome__partitioning_8cpp_source.html#l00045">palindrome_partitioning.cpp:45</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/d5/d90/palindrome__partitioning_8cpp_a52ee22882858d2b1cf04293f02ed839a_cgraph.map b/d5/d90/palindrome__partitioning_8cpp_a52ee22882858d2b1cf04293f02ed839a_cgraph.map
deleted file mode 100644
index c6eccfedd..000000000
--- a/d5/d90/palindrome__partitioning_8cpp_a52ee22882858d2b1cf04293f02ed839a_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="dynamic_programming::palindrome_partitioning::pal_part" name="dynamic_programming::palindrome_partitioning::pal_part">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,168,85"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="50,29,50,19,57,10,69,5,87,3,106,5,118,12,116,17,105,10,86,8,70,10,60,14,55,21,55,29"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="237,19,306,45"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="168,43,221,36,222,41,169,49"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="216,68,327,94"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="169,65,201,69,200,75,168,70"/>
-</map>
diff --git a/d5/d90/palindrome__partitioning_8cpp_a52ee22882858d2b1cf04293f02ed839a_cgraph.md5 b/d5/d90/palindrome__partitioning_8cpp_a52ee22882858d2b1cf04293f02ed839a_cgraph.md5
deleted file mode 100644
index d535eaa4c..000000000
--- a/d5/d90/palindrome__partitioning_8cpp_a52ee22882858d2b1cf04293f02ed839a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-719eee5f1f6e5f0a5d443b74be5e869d
\ No newline at end of file
diff --git a/d5/d90/palindrome__partitioning_8cpp_a52ee22882858d2b1cf04293f02ed839a_cgraph.svg b/d5/d90/palindrome__partitioning_8cpp_a52ee22882858d2b1cf04293f02ed839a_cgraph.svg
deleted file mode 100644
index 9d68d7604..000000000
--- a/d5/d90/palindrome__partitioning_8cpp_a52ee22882858d2b1cf04293f02ed839a_cgraph.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::palindrome_partitioning::pal_part Pages: 1 -->
-<svg width="249pt" height="75pt"
- viewBox="0.00 0.00 249.25 74.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 70.5)">
-<title>dynamic_programming::palindrome_partitioning::pal_part</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="121.75,-48.5 0,-48.5 0,-6.75 121.75,-6.75 121.75,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">::palindrome_partitioning</text>
-<text text-anchor="middle" x="60.88" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::pal_part</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.29,-48.82C32.85,-58.3 41.38,-66.5 60.88,-66.5 72.15,-66.5 79.75,-63.76 83.69,-59.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.99,-60.84 86.08,-50.28 80.21,-59.1 86.99,-60.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="225.12,-56.25 173.88,-56.25 173.88,-37 225.12,-37 225.12,-56.25"/>
-<text text-anchor="middle" x="199.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.2,-36.01C135.85,-37.91 149.93,-39.87 162.23,-41.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.51,-45.01 171.89,-42.92 162.47,-38.08 161.51,-45.01"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="241.25,-19.25 157.75,-19.25 157.75,0 241.25,0 241.25,-19.25"/>
-<text text-anchor="middle" x="199.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.2,-19.68C130.17,-18.63 138.29,-17.56 146.12,-16.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.36,-20.02 155.82,-15.25 145.44,-13.08 146.36,-20.02"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d90/palindrome__partitioning_8cpp_a52ee22882858d2b1cf04293f02ed839a_cgraph_org.svg b/d5/d90/palindrome__partitioning_8cpp_a52ee22882858d2b1cf04293f02ed839a_cgraph_org.svg
deleted file mode 100644
index d882ef573..000000000
--- a/d5/d90/palindrome__partitioning_8cpp_a52ee22882858d2b1cf04293f02ed839a_cgraph_org.svg
+++ /dev/null
@@ -1,68 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::palindrome_partitioning::pal_part Pages: 1 -->
-<svg width="249pt" height="75pt"
- viewBox="0.00 0.00 249.25 74.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 70.5)">
-<title>dynamic_programming::palindrome_partitioning::pal_part</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="121.75,-48.5 0,-48.5 0,-6.75 121.75,-6.75 121.75,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">::palindrome_partitioning</text>
-<text text-anchor="middle" x="60.88" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::pal_part</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.29,-48.82C32.85,-58.3 41.38,-66.5 60.88,-66.5 72.15,-66.5 79.75,-63.76 83.69,-59.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.99,-60.84 86.08,-50.28 80.21,-59.1 86.99,-60.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="225.12,-56.25 173.88,-56.25 173.88,-37 225.12,-37 225.12,-56.25"/>
-<text text-anchor="middle" x="199.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.2,-36.01C135.85,-37.91 149.93,-39.87 162.23,-41.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.51,-45.01 171.89,-42.92 162.47,-38.08 161.51,-45.01"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="241.25,-19.25 157.75,-19.25 157.75,0 241.25,0 241.25,-19.25"/>
-<text text-anchor="middle" x="199.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.2,-19.68C130.17,-18.63 138.29,-17.56 146.12,-16.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.36,-20.02 155.82,-15.25 145.44,-13.08 146.36,-20.02"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d90/palindrome__partitioning_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/d90/palindrome__partitioning_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 46f19db3e..000000000
--- a/d5/d90/palindrome__partitioning_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Test Function." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d5/d90/palindrome__partitioning_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/d90/palindrome__partitioning_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 4088778dc..000000000
--- a/d5/d90/palindrome__partitioning_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b1af02f7aa5d4aaac336053792982527
\ No newline at end of file
diff --git a/d5/d90/palindrome__partitioning_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/d90/palindrome__partitioning_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 2821970f4..000000000
--- a/d5/d90/palindrome__partitioning_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test Function.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d90/palindrome__partitioning_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/d90/palindrome__partitioning_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 6284e3db9..000000000
--- a/d5/d90/palindrome__partitioning_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test Function.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d90/palindrome__partitioning_8cpp_source.html b/d5/d90/palindrome__partitioning_8cpp_source.html
new file mode 100644
index 000000000..68b8015ee
--- /dev/null
+++ b/d5/d90/palindrome__partitioning_8cpp_source.html
@@ -0,0 +1,238 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/palindrome_partitioning.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/d90/palindrome__partitioning_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">palindrome_partitioning.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d5/d90/palindrome__partitioning_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  <span class="comment">// for std::min</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cassert&gt;</span>    <span class="comment">// for std::assert</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;climits&gt;</span>    <span class="comment">// for INT_MAX</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;iostream&gt;</span>   <span class="comment">// for io operations</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;vector&gt;</span>     <span class="comment">// for std::vector</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a> {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d89/namespacepalindrome__partitioning.html">palindrome_partitioning</a> {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="foldopen" id="foldopen00045" data-start="{" data-end="}">
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="../../d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a">   45</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a">pal_part</a>(<span class="keyword">const</span> std::string &amp;str) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keywordtype">int</span> n = str.size();</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="comment">// creating lookup table for minimum number of cuts</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    std::vector&lt;std::vector&lt;int&gt; &gt; cuts(n, std::vector&lt;int&gt;(n, 0));</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="comment">// creating lookup table for palindrome checking</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    std::vector&lt;std::vector&lt;bool&gt; &gt; is_palindrome(n,</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>                                                  std::vector&lt;bool&gt;(n, <span class="keyword">false</span>));</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="comment">// initialization</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        is_palindrome[i][i] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        cuts[i][i] = 0;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    }</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> len = 2; len &lt;= n; len++) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> start_index = 0; start_index &lt; n - len + 1; start_index++) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            <span class="keywordtype">int</span> end_index = start_index + len - 1;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            <span class="keywordflow">if</span> (len == 2) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>                is_palindrome[start_index][end_index] =</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>                    (str[start_index] == str[end_index]);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>                is_palindrome[start_index][end_index] =</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>                    (str[start_index] == str[end_index]) &amp;&amp;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>                    is_palindrome[start_index + 1][end_index - 1];</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            }</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            <span class="keywordflow">if</span> (is_palindrome[start_index][end_index]) {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>                cuts[start_index][end_index] = 0;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>                cuts[start_index][end_index] = INT_MAX;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> partition = start_index; partition &lt;= end_index - 1;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>                     partition++) {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>                    cuts[start_index][end_index] =</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>                        std::min(cuts[start_index][end_index],</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>                                 cuts[start_index][partition] +</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>                                     cuts[partition + 1][end_index] + 1);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>                }</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>            }</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        }</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keywordflow">return</span> cuts[0][n - 1];</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>}</div>
+</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>}  <span class="comment">// namespace palindrome_partitioning</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>}  <span class="comment">// namespace dynamic_programming</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="foldopen" id="foldopen00098" data-start="{" data-end="}">
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"><a class="line" href="../../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   98</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="comment">// custom input vector</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    std::vector&lt;std::string&gt; custom_input{<span class="stringliteral">&quot;nitik&quot;</span>, <span class="stringliteral">&quot;ababbbabbababa&quot;</span>, <span class="stringliteral">&quot;abdc&quot;</span>};</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="comment">// calculated output vector by pal_part Function</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    std::vector&lt;int&gt; calculated_output(3);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 3; i++) {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        calculated_output[i] =</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>            dynamic_programming::palindrome_partitioning::pal_part(</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>                custom_input[i]);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    }</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span> </div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <span class="comment">// expected output vector</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    std::vector&lt;int&gt; expected_output{2, 3, 3};</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="comment">// Testing implementation via assert function</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <span class="comment">// It will throw error if any of the expected test fails</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <span class="comment">// Else it will give nothing</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 3; i++) {</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        assert(expected_output[i] == calculated_output[i]);</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    }</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests passed successfully!\n&quot;</span>;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>}</div>
+</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="foldopen" id="foldopen00128" data-start="{" data-end="}">
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"><a class="line" href="../../d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  128</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    <a class="code hl_function" href="../../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the test</span></div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>}</div>
+</div>
+<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
+<div class="ttc" id="anamespacepalindrome__partitioning_html"><div class="ttname"><a href="../../d5/d89/namespacepalindrome__partitioning.html">palindrome_partitioning</a></div><div class="ttdoc">Functions for Palindrome Partitioning algorithm.</div></div>
+<div class="ttc" id="apalindrome__partitioning_8cpp_html_a52ee22882858d2b1cf04293f02ed839a"><div class="ttname"><a href="../../d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a">dynamic_programming::palindrome_partitioning::pal_part</a></div><div class="ttdeci">int pal_part(const std::string &amp;str)</div><div class="ttdef"><b>Definition</b> <a href="#l00045">palindrome_partitioning.cpp:45</a></div></div>
+<div class="ttc" id="apalindrome__partitioning_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test Function.</div><div class="ttdef"><b>Definition</b> <a href="#l00098">palindrome_partitioning.cpp:98</a></div></div>
+<div class="ttc" id="apalindrome__partitioning_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00128">palindrome_partitioning.cpp:128</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../d5/d90/palindrome__partitioning_8cpp.html">palindrome_partitioning.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/d91/namespacesorting.html b/d5/d91/namespacesorting.html
index 1d84d4371..b83df6f21 100644
--- a/d5/d91/namespacesorting.html
+++ b/d5/d91/namespacesorting.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting Namespace Reference</title>
+<title>TheAlgorithms/C++: sorting Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -116,31 +133,31 @@ $(function(){initNavTree('d5/d91/namespacesorting.html','../../'); initResizable
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a034d8b276518a902962e87d3158b64fd" id="r_a034d8b276518a902962e87d3158b64fd"><td class="memTemplParams" colspan="2">template&lt;class T &gt; </td></tr>
-<tr class="memitem:a034d8b276518a902962e87d3158b64fd"><td class="memTemplItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a034d8b276518a902962e87d3158b64fd">binary_search</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;arr, T val, int64_t low, int64_t high)</td></tr>
+<tr class="memitem:a034d8b276518a902962e87d3158b64fd"><td class="memTemplItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a034d8b276518a902962e87d3158b64fd">binary_search</a> (std::vector&lt; T &gt; &amp;arr, T val, int64_t low, int64_t high)</td></tr>
 <tr class="memdesc:a034d8b276518a902962e87d3158b64fd"><td class="mdescLeft">&#160;</td><td class="mdescRight">Binary search function to find the most suitable pace for an element.  <br /></td></tr>
 <tr class="separator:a034d8b276518a902962e87d3158b64fd"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a5f4bc75cca6dd8294af2d0e328006c68" id="r_a5f4bc75cca6dd8294af2d0e328006c68"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a5f4bc75cca6dd8294af2d0e328006c68"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5f4bc75cca6dd8294af2d0e328006c68">insertionSort_binsrch</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;arr)</td></tr>
+<tr class="memitem:a5f4bc75cca6dd8294af2d0e328006c68"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5f4bc75cca6dd8294af2d0e328006c68">insertionSort_binsrch</a> (std::vector&lt; T &gt; &amp;arr)</td></tr>
 <tr class="memdesc:a5f4bc75cca6dd8294af2d0e328006c68"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insertion sort function to sort the vector.  <br /></td></tr>
 <tr class="separator:a5f4bc75cca6dd8294af2d0e328006c68"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a7bfe11bd4703eacd1dab93f25ec639c5" id="r_a7bfe11bd4703eacd1dab93f25ec639c5"><td class="memTemplParams" colspan="2">template&lt;typename T , size_t N&gt; </td></tr>
-<tr class="memitem:a7bfe11bd4703eacd1dab93f25ec639c5"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a7bfe11bd4703eacd1dab93f25ec639c5">shuffle</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; arr)</td></tr>
+<tr class="memitem:a7bfe11bd4703eacd1dab93f25ec639c5"><td class="memTemplItemLeft" align="right" valign="top">std::array&lt; T, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a7bfe11bd4703eacd1dab93f25ec639c5">shuffle</a> (std::array&lt; T, N &gt; arr)</td></tr>
 <tr class="separator:a7bfe11bd4703eacd1dab93f25ec639c5"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:affc6ee160142cd017f8c4b213437d0fd" id="r_affc6ee160142cd017f8c4b213437d0fd"><td class="memTemplParams" colspan="2">template&lt;typename T , size_t N&gt; </td></tr>
-<tr class="memitem:affc6ee160142cd017f8c4b213437d0fd"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#affc6ee160142cd017f8c4b213437d0fd">randomized_bogosort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; arr)</td></tr>
+<tr class="memitem:affc6ee160142cd017f8c4b213437d0fd"><td class="memTemplItemLeft" align="right" valign="top">std::array&lt; T, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#affc6ee160142cd017f8c4b213437d0fd">randomized_bogosort</a> (std::array&lt; T, N &gt; arr)</td></tr>
 <tr class="separator:affc6ee160142cd017f8c4b213437d0fd"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a2f8bc626eb57acae24a94636a23af6a1" id="r_a2f8bc626eb57acae24a94636a23af6a1"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
 <tr class="memitem:a2f8bc626eb57acae24a94636a23af6a1"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a2f8bc626eb57acae24a94636a23af6a1">gnomeSort</a> (T *arr, int size)</td></tr>
 <tr class="separator:a2f8bc626eb57acae24a94636a23af6a1"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa3677f87b5b4756bc77e9e34c5f27935" id="r_aa3677f87b5b4756bc77e9e34c5f27935"><td class="memTemplParams" colspan="2">template&lt;typename T , size_t size&gt; </td></tr>
-<tr class="memitem:aa3677f87b5b4756bc77e9e34c5f27935"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, size &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aa3677f87b5b4756bc77e9e34c5f27935">gnomeSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, size &gt; arr)</td></tr>
+<tr class="memitem:aa3677f87b5b4756bc77e9e34c5f27935"><td class="memTemplItemLeft" align="right" valign="top">std::array&lt; T, size &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aa3677f87b5b4756bc77e9e34c5f27935">gnomeSort</a> (std::array&lt; T, size &gt; arr)</td></tr>
 <tr class="separator:aa3677f87b5b4756bc77e9e34c5f27935"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a78cb2f3b97b6db2c062b2a1df05c9ea9" id="r_a78cb2f3b97b6db2c062b2a1df05c9ea9"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
 <tr class="memitem:a78cb2f3b97b6db2c062b2a1df05c9ea9"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a78cb2f3b97b6db2c062b2a1df05c9ea9">insertionSort</a> (T *arr, int n)</td></tr>
 <tr class="memdesc:a78cb2f3b97b6db2c062b2a1df05c9ea9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insertion Sort Function.  <br /></td></tr>
 <tr class="separator:a78cb2f3b97b6db2c062b2a1df05c9ea9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a8fe6bac9e03f58abcc2ce26ef3de1b5f" id="r_a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a8fe6bac9e03f58abcc2ce26ef3de1b5f">insertionSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *arr)</td></tr>
+<tr class="memitem:a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a8fe6bac9e03f58abcc2ce26ef3de1b5f">insertionSort</a> (std::vector&lt; T &gt; *arr)</td></tr>
 <tr class="memdesc:a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insertion Sort for a vector.  <br /></td></tr>
 <tr class="separator:a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa26de383227859210f14dcf12201a079" id="r_aa26de383227859210f14dcf12201a079"><td class="memTemplParams" colspan="2">template&lt;class Iterator &gt; </td></tr>
@@ -159,26 +176,26 @@ Functions</h2></td></tr>
 <tr class="memitem:ae97f4dd815654c4682f564afd718e824"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae97f4dd815654c4682f564afd718e824">non_recursive_merge_sort</a> (const Iterator first, const Iterator last)</td></tr>
 <tr class="memdesc:ae97f4dd815654c4682f564afd718e824"><td class="mdescLeft">&#160;</td><td class="mdescRight">bottom-up merge sort which sorts elements in a non-decreasing order  <br /></td></tr>
 <tr class="separator:ae97f4dd815654c4682f564afd718e824"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0e9e1b21a1684585e9e50f9afe4d53a3" id="r_a0e9e1b21a1684585e9e50f9afe4d53a3"><td class="memTemplParams" colspan="2">template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> N&gt; </td></tr>
-<tr class="memitem:a0e9e1b21a1684585e9e50f9afe4d53a3"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a0e9e1b21a1684585e9e50f9afe4d53a3">pigeonSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, N &gt; arr)</td></tr>
+<tr class="memitem:a0e9e1b21a1684585e9e50f9afe4d53a3" id="r_a0e9e1b21a1684585e9e50f9afe4d53a3"><td class="memTemplParams" colspan="2">template&lt;std::size_t N&gt; </td></tr>
+<tr class="memitem:a0e9e1b21a1684585e9e50f9afe4d53a3"><td class="memTemplItemLeft" align="right" valign="top">std::array&lt; int, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a0e9e1b21a1684585e9e50f9afe4d53a3">pigeonSort</a> (std::array&lt; int, N &gt; arr)</td></tr>
 <tr class="separator:a0e9e1b21a1684585e9e50f9afe4d53a3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a9f59fe72dacc1f1218ef3c303d843168" id="r_a9f59fe72dacc1f1218ef3c303d843168"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a9f59fe72dacc1f1218ef3c303d843168"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a9f59fe72dacc1f1218ef3c303d843168">quicksort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *arr, int32_t low, int32_t high)</td></tr>
+<tr class="memitem:a9f59fe72dacc1f1218ef3c303d843168"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a9f59fe72dacc1f1218ef3c303d843168">quicksort</a> (std::vector&lt; T &gt; *arr, int32_t low, int32_t high)</td></tr>
 <tr class="separator:a9f59fe72dacc1f1218ef3c303d843168"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a6eb67c2f91c98cf4464f75b5882022de" id="r_a6eb67c2f91c98cf4464f75b5882022de"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a6eb67c2f91c98cf4464f75b5882022de"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a6eb67c2f91c98cf4464f75b5882022de">quicksort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; arr, int32_t low, int32_t high)</td></tr>
+<tr class="memitem:a6eb67c2f91c98cf4464f75b5882022de"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a6eb67c2f91c98cf4464f75b5882022de">quicksort</a> (std::vector&lt; T &gt; arr, int32_t low, int32_t high)</td></tr>
 <tr class="separator:a6eb67c2f91c98cf4464f75b5882022de"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aac8f44b28b4aa96444383030b28f8b34" id="r_aac8f44b28b4aa96444383030b28f8b34"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aac8f44b28b4aa96444383030b28f8b34">partition</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;arr, int start, int end)</td></tr>
+<tr class="memitem:aac8f44b28b4aa96444383030b28f8b34" id="r_aac8f44b28b4aa96444383030b28f8b34"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aac8f44b28b4aa96444383030b28f8b34">partition</a> (std::vector&lt; int &gt; &amp;arr, int start, int end)</td></tr>
 <tr class="memdesc:aac8f44b28b4aa96444383030b28f8b34"><td class="mdescLeft">&#160;</td><td class="mdescRight">The partition function sorts the array from start to end and uses the last element as the pivot.  <br /></td></tr>
 <tr class="separator:aac8f44b28b4aa96444383030b28f8b34"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a263595fd9a0163b5b997b89fab3a0dc5" id="r_a263595fd9a0163b5b997b89fab3a0dc5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a263595fd9a0163b5b997b89fab3a0dc5">iterativeQuickSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;arr)</td></tr>
+<tr class="memitem:a263595fd9a0163b5b997b89fab3a0dc5" id="r_a263595fd9a0163b5b997b89fab3a0dc5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a263595fd9a0163b5b997b89fab3a0dc5">iterativeQuickSort</a> (std::vector&lt; int &gt; &amp;arr)</td></tr>
 <tr class="memdesc:a263595fd9a0163b5b997b89fab3a0dc5"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main sorting function.  <br /></td></tr>
 <tr class="separator:a263595fd9a0163b5b997b89fab3a0dc5"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae3a775d99dbbb94c130a973df0cfddcf" id="r_ae3a775d99dbbb94c130a973df0cfddcf"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ae3a775d99dbbb94c130a973df0cfddcf"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae3a775d99dbbb94c130a973df0cfddcf">recursive_bubble_sort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *nums, uint64_t n)</td></tr>
+<tr class="memitem:ae3a775d99dbbb94c130a973df0cfddcf"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae3a775d99dbbb94c130a973df0cfddcf">recursive_bubble_sort</a> (std::vector&lt; T &gt; *nums, uint64_t n)</td></tr>
 <tr class="memdesc:ae3a775d99dbbb94c130a973df0cfddcf"><td class="mdescLeft">&#160;</td><td class="mdescRight">This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is then dereferenced, so that the changes are reflected in the original vector. It also accepts a second parameter of type <code>int</code> and name <code>n</code>, which is the size of the array.  <br /></td></tr>
 <tr class="separator:ae3a775d99dbbb94c130a973df0cfddcf"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a06af4f0dae2de2a2ae5b797d7aa26755" id="r_a06af4f0dae2de2a2ae5b797d7aa26755"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a06af4f0dae2de2a2ae5b797d7aa26755">selectionSort</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;arr, uint64_t len)</td></tr>
+<tr class="memitem:a06af4f0dae2de2a2ae5b797d7aa26755" id="r_a06af4f0dae2de2a2ae5b797d7aa26755"><td class="memItemLeft" align="right" valign="top">std::vector&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a06af4f0dae2de2a2ae5b797d7aa26755">selectionSort</a> (const std::vector&lt; uint64_t &gt; &amp;arr, uint64_t len)</td></tr>
 <tr class="separator:a06af4f0dae2de2a2ae5b797d7aa26755"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a5669396c6a6b1e14b97589b6e37980aa" id="r_a5669396c6a6b1e14b97589b6e37980aa"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
 <tr class="memitem:a5669396c6a6b1e14b97589b6e37980aa"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5669396c6a6b1e14b97589b6e37980aa">shell_sort</a> (T *arr, size_t LEN)</td></tr>
@@ -187,7 +204,7 @@ Functions</h2></td></tr>
 <tr class="memitem:a4d76603c54d3dc56146e92d10a043924"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a4d76603c54d3dc56146e92d10a043924">shell_sort</a> (T(&amp;arr)[N])</td></tr>
 <tr class="separator:a4d76603c54d3dc56146e92d10a043924"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af2c5b92cbfe73f63f6074c61b0a45331" id="r_af2c5b92cbfe73f63f6074c61b0a45331"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:af2c5b92cbfe73f63f6074c61b0a45331"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af2c5b92cbfe73f63f6074c61b0a45331">shell_sort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *arr)</td></tr>
+<tr class="memitem:af2c5b92cbfe73f63f6074c61b0a45331"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af2c5b92cbfe73f63f6074c61b0a45331">shell_sort</a> (std::vector&lt; T &gt; *arr)</td></tr>
 <tr class="separator:af2c5b92cbfe73f63f6074c61b0a45331"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -197,35 +214,35 @@ Functions</h2></td></tr>
 <p>header files</p>
 <p>Sorting Algorithms.</p>
 <p>for std::assert</p>
-<p>for using <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>for using std::vector</p>
 <p>for assert</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>for std::vector</p>
 <p>Sorting algorithms.</p>
 <p>for algorithm functions for assert for IO operations</p>
 <p>Sorting algorithms</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a> for assert for IO implementations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></p>
+<p>for std::is_sorted for assert for IO implementations for std::string for std::pair, std::swap for std::vector, std::vector::push_back, std::vector::size</p>
 <p>for assert for typedef datatype uint64_t for IO operations</p>
 <p>Sorting algorithms</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a> 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::is_sorted, std::swap for io operations for std::vector</p>
 <p>Sorting algorithms</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a> and 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::is_sorted for std::swap and io operations for std::vector</p>
 <p>@breif Sorting algorithms</p>
 <p>Sorting algorithms</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a> for assert function in testing for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></p>
+<p>for std::is_sorted for assert function in testing for std::cout and std::endl</p>
 <p>Contains sorting algorithms</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a> 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::is_sorted for std::time for IO operations for std::vector</p>
 <p>Sorting algorithms</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a> for assert</p>
-<p>for collection of functions for a macro called assert which can be used to verify assumptions 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::cout for std::vector for std::stack for std::is_sorted for assert</p>
+<p>for collection of functions for a macro called assert which can be used to verify assumptions for io operations for std::vector</p>
 <p>Sorting algorithms</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted()</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap()</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for assert for initializing random number generator for IO operations</p>
+<p>for std::is_sorted(), std::swap() for std::array for assert for initializing random number generator for IO operations</p>
 <p>Sorting algorithms</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> 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::is_sorted for std::array for IO operations for std::vector</p>
 <p>Sorting algorithms</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a> 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 <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a> for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a> and io operations</p>
+<p>for std::is_sorted for IO operations for std::vector</p>
+<p>for std::is_sorted for assert for std::swap and io operations</p>
 <p>Sorting algorithms</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a> for assert for IO operations</p>
+<p>for std::is_sorted, std::swap for assert for IO operations</p>
 <p>Sorting algorithms </p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a034d8b276518a902962e87d3158b64fd" name="a034d8b276518a902962e87d3158b64fd"></a>
@@ -239,7 +256,7 @@ template&lt;class T &gt; </div>
         <tr>
           <td class="memname">int64_t sorting::binary_search </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
+          <td class="paramtype">std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -276,6 +293,8 @@ template&lt;class T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the index of most suitable position of val. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dcc/binary__insertion__sort_8cpp_source.html#l00063">63</a> of file <a class="el" href="../../d8/dcc/binary__insertion__sort_8cpp_source.html">binary_insertion_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   63</span>                                                                           {</div>
 <div class="line"><span class="lineno">   64</span>    <span class="keywordflow">if</span> (high &lt;= low) {</div>
 <div class="line"><span class="lineno">   65</span>        <span class="keywordflow">return</span> (val &gt; arr[low]) ? (low + 1) : low;</div>
@@ -284,18 +303,13 @@ template&lt;class T &gt; </div>
 <div class="line"><span class="lineno">   68</span>    <span class="keywordflow">if</span> (arr[mid] &gt; val) {</div>
 <div class="line"><span class="lineno">   69</span>        <span class="keywordflow">return</span> binary_search(arr, val, low, mid - 1);</div>
 <div class="line"><span class="lineno">   70</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (arr[mid] &lt; val) {</div>
-<div class="line"><span class="lineno">   71</span>        <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/binary_search.html">binary_search</a>(arr, val, mid + 1, high);</div>
+<div class="line"><span class="lineno">   71</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a034d8b276518a902962e87d3158b64fd">binary_search</a>(arr, val, mid + 1, high);</div>
 <div class="line"><span class="lineno">   72</span>    } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">   73</span>        <span class="keywordflow">return</span> mid + 1;</div>
 <div class="line"><span class="lineno">   74</span>    }</div>
 <div class="line"><span class="lineno">   75</span>}</div>
-<div class="ttc" id="abinary_search_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/binary_search.html">std::binary_search</a></div><div class="ttdeci">T binary_search(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d91/namespacesorting_a034d8b276518a902962e87d3158b64fd_cgraph.svg" width="160" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacesorting_html_a034d8b276518a902962e87d3158b64fd"><div class="ttname"><a href="#a034d8b276518a902962e87d3158b64fd">sorting::binary_search</a></div><div class="ttdeci">int64_t binary_search(std::vector&lt; T &gt; &amp;arr, T val, int64_t low, int64_t high)</div><div class="ttdoc">Binary search function to find the most suitable pace for an element.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dcc/binary__insertion__sort_8cpp_source.html#l00063">binary_insertion_sort.cpp:63</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa3677f87b5b4756bc77e9e34c5f27935" name="aa3677f87b5b4756bc77e9e34c5f27935"></a>
@@ -307,9 +321,9 @@ Here is the call graph for this function:</div>
 template&lt;typename T , size_t size&gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, size &gt; sorting::gnomeSort </td>
+          <td class="memname">std::array&lt; T, size &gt; sorting::gnomeSort </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, size &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
+          <td class="paramtype">std::array&lt; T, size &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -328,6 +342,8 @@ template&lt;typename T , size_t size&gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>array with elements sorted </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d21/gnome__sort_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../d2/d21/gnome__sort_8cpp_source.html">gnome_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>                                                   {</div>
 <div class="line"><span class="lineno">   63</span>    <span class="comment">// few easy cases</span></div>
 <div class="line"><span class="lineno">   64</span>    <span class="keywordflow">if</span> (size &lt;= 1) {</div>
@@ -340,19 +356,13 @@ template&lt;typename T , size_t size&gt; </div>
 <div class="line"><span class="lineno">   71</span>        <span class="keywordflow">if</span> ((index == 0) || (arr[index] &gt;= arr[index - 1])) {</div>
 <div class="line"><span class="lineno">   72</span>            index++;</div>
 <div class="line"><span class="lineno">   73</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   74</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(arr[index], arr[index - 1]);  <span class="comment">// swap</span></div>
+<div class="line"><span class="lineno">   74</span>            std::swap(arr[index], arr[index - 1]);  <span class="comment">// swap</span></div>
 <div class="line"><span class="lineno">   75</span>            index--;</div>
 <div class="line"><span class="lineno">   76</span>        }</div>
 <div class="line"><span class="lineno">   77</span>    }</div>
 <div class="line"><span class="lineno">   78</span>    <span class="keywordflow">return</span> arr;</div>
 <div class="line"><span class="lineno">   79</span>}</div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- 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="../../d5/d91/namespacesorting_aa3677f87b5b4756bc77e9e34c5f27935_cgraph.svg" width="268" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2f8bc626eb57acae24a94636a23af6a1" name="a2f8bc626eb57acae24a94636a23af6a1"></a>
@@ -382,6 +392,8 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d21/gnome__sort_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../d2/d21/gnome__sort_8cpp_source.html">gnome_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   34</span>                                 {</div>
 <div class="line"><span class="lineno">   35</span>    <span class="comment">// few easy cases</span></div>
 <div class="line"><span class="lineno">   36</span>    <span class="keywordflow">if</span> (size &lt;= 1) {</div>
@@ -394,17 +406,12 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   43</span>        <span class="keywordflow">if</span> ((index == 0) || (arr[index] &gt;= arr[index - 1])) {</div>
 <div class="line"><span class="lineno">   44</span>            index++;</div>
 <div class="line"><span class="lineno">   45</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   46</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(arr[index], arr[index - 1]);  <span class="comment">// swap</span></div>
+<div class="line"><span class="lineno">   46</span>            std::swap(arr[index], arr[index - 1]);  <span class="comment">// swap</span></div>
 <div class="line"><span class="lineno">   47</span>            index--;</div>
 <div class="line"><span class="lineno">   48</span>        }</div>
 <div class="line"><span class="lineno">   49</span>    }</div>
 <div class="line"><span class="lineno">   50</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d91/namespacesorting_a2f8bc626eb57acae24a94636a23af6a1_cgraph.svg" width="268" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a8fe6bac9e03f58abcc2ce26ef3de1b5f" name="a8fe6bac9e03f58abcc2ce26ef3de1b5f"></a>
@@ -418,7 +425,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void sorting::insertionSort </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -450,8 +457,10 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d0d/insertion__sort_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../dd/d0d/insertion__sort_8cpp_source.html">insertion_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   77</span>                                      {</div>
-<div class="line"><span class="lineno">   78</span>    <span class="keywordtype">size_t</span> n = arr-&gt;<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">   78</span>    <span class="keywordtype">size_t</span> n = arr-&gt;size();</div>
 <div class="line"><span class="lineno">   79</span> </div>
 <div class="line"><span class="lineno">   80</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 1; i &lt; n; i++) {</div>
 <div class="line"><span class="lineno">   81</span>        T temp = arr[0][i];</div>
@@ -463,13 +472,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   87</span>        arr[0][j + 1] = temp;</div>
 <div class="line"><span class="lineno">   88</span>    }</div>
 <div class="line"><span class="lineno">   89</span>}</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><!-- 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="../../d5/d91/namespacesorting_a8fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph.svg" width="316" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a78cb2f3b97b6db2c062b2a1df05c9ea9" name="a78cb2f3b97b6db2c062b2a1df05c9ea9"></a>
@@ -520,6 +523,8 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d0d/insertion__sort_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../dd/d0d/insertion__sort_8cpp_source.html">insertion_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   59</span>                                  {</div>
 <div class="line"><span class="lineno">   60</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; n; i++) {</div>
 <div class="line"><span class="lineno">   61</span>        T temp = arr[i];</div>
@@ -545,7 +550,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void sorting::insertionSort_binsrch </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -565,8 +570,10 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Void. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dcc/binary__insertion__sort_8cpp_source.html#l00084">84</a> of file <a class="el" href="../../d8/dcc/binary__insertion__sort_8cpp_source.html">binary_insertion_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   84</span>                                              {</div>
-<div class="line"><span class="lineno">   85</span>    int64_t 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">   85</span>    int64_t n = arr.size();</div>
 <div class="line"><span class="lineno">   86</span> </div>
 <div class="line"><span class="lineno">   87</span>    <span class="keywordflow">for</span> (int64_t i = 1; i &lt; n; i++) {</div>
 <div class="line"><span class="lineno">   88</span>        T key = arr[i];</div>
@@ -579,13 +586,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   95</span>        arr[j + 1] = key;</div>
 <div class="line"><span class="lineno">   96</span>    }</div>
 <div class="line"><span class="lineno">   97</span>}</div>
-<div class="ttc" id="anamespacesorting_html_a034d8b276518a902962e87d3158b64fd"><div class="ttname"><a href="#a034d8b276518a902962e87d3158b64fd">sorting::binary_search</a></div><div class="ttdeci">int64_t binary_search(std::vector&lt; T &gt; &amp;arr, T val, int64_t low, int64_t high)</div><div class="ttdoc">Binary search function to find the most suitable pace for an element.</div><div class="ttdef"><b>Definition</b> binary_insertion_sort.cpp:63</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d91/namespacesorting_a5f4bc75cca6dd8294af2d0e328006c68_cgraph.svg" width="350" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a263595fd9a0163b5b997b89fab3a0dc5" name="a263595fd9a0163b5b997b89fab3a0dc5"></a>
@@ -597,7 +598,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void sorting::iterativeQuickSort </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -611,10 +612,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d22/quick__sort__iterative_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d3/d22/quick__sort__iterative_8cpp_source.html">quick_sort_iterative.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   59</span>{</div>
-<div class="line"><span class="lineno">   60</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;int&gt;</a> <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;</div>
+<div class="line"><span class="lineno">   60</span>    std::stack&lt;int&gt; <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;</div>
 <div class="line"><span class="lineno">   61</span>    <span class="keywordtype">int</span> start = 0;</div>
-<div class="line"><span class="lineno">   62</span>    <span class="keywordtype">int</span> end = arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()-1;</div>
+<div class="line"><span class="lineno">   62</span>    <span class="keywordtype">int</span> end = arr.size()-1;</div>
 <div class="line"><span class="lineno">   63</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(start);</div>
 <div class="line"><span class="lineno">   64</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(end);</div>
 <div class="line"><span class="lineno">   65</span> </div>
@@ -640,18 +643,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   85</span>        }</div>
 <div class="line"><span class="lineno">   86</span>    }</div>
 <div class="line"><span class="lineno">   87</span>}</div>
-<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> stack.hpp:19</div></div>
-<div class="ttc" id="aclassstack_html_a3647fb4418890f19e0dc414b8092b8b0"><div class="ttname"><a href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition</b> stack.hpp:62</div></div>
-<div class="ttc" id="aclassstack_html_a90df277532c23519aa7ac3c08ed90a1d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack::push</a></div><div class="ttdeci">void push(const value_type &amp;item)</div><div class="ttdef"><b>Definition</b> stack.hpp:47</div></div>
-<div class="ttc" id="aclassstack_html_ae09630c4384903d187801921b2ddc709"><div class="ttname"><a href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">stack::top</a></div><div class="ttdeci">value_type top() const</div><div class="ttdef"><b>Definition</b> stack.hpp:56</div></div>
-<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition</b> paranthesis_matching.cpp:20</div></div>
-<div class="ttc" id="astack_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph.svg" width="520" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00019">stack.hpp:19</a></div></div>
+<div class="ttc" id="aclassstack_html_a3647fb4418890f19e0dc414b8092b8b0"><div class="ttname"><a href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00062">stack.hpp:62</a></div></div>
+<div class="ttc" id="aclassstack_html_a90df277532c23519aa7ac3c08ed90a1d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack::push</a></div><div class="ttdeci">void push(const value_type &amp;item)</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00047">stack.hpp:47</a></div></div>
+<div class="ttc" id="aclassstack_html_ae09630c4384903d187801921b2ddc709"><div class="ttname"><a href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">stack::top</a></div><div class="ttdeci">value_type top() const</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00056">stack.hpp:56</a></div></div>
+<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00020">paranthesis_matching.cpp:20</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa26de383227859210f14dcf12201a079" name="aa26de383227859210f14dcf12201a079"></a>
@@ -695,27 +692,23 @@ template&lt;class Iterator &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/db6/non__recursive__merge__sort_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../d0/db6/non__recursive__merge__sort_8cpp_source.html">non_recursive_merge_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   57</span>                                                               {</div>
 <div class="line"><span class="lineno">   58</span>    <span class="comment">// create 2 pointers to point at the buffer</span></div>
 <div class="line"><span class="lineno">   59</span>    <span class="keyword">auto</span> p(<span class="keyword">reinterpret_cast&lt;</span>std::remove_reference_t&lt;decltype(*l)<span class="keyword">&gt;</span>*&gt;(b)), c(p);</div>
 <div class="line"><span class="lineno">   60</span>    <span class="comment">// move the left part of the segment</span></div>
-<div class="line"><span class="lineno">   61</span>    <span class="keywordflow">for</span> (Iterator t(l); r != t; ++t) *p++ = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(*t);</div>
+<div class="line"><span class="lineno">   61</span>    <span class="keywordflow">for</span> (Iterator t(l); r != t; ++t) *p++ = std::move(*t);</div>
 <div class="line"><span class="lineno">   62</span>    <span class="comment">// while neither the buffer nor the right part has been exhausted</span></div>
 <div class="line"><span class="lineno">   63</span>    <span class="comment">// move the smallest element of the two back to the container</span></div>
-<div class="line"><span class="lineno">   64</span>    <span class="keywordflow">while</span> (e != r &amp;&amp; c != p) *l++ = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(*r &lt; *c ? *r++ : *c++);</div>
+<div class="line"><span class="lineno">   64</span>    <span class="keywordflow">while</span> (e != r &amp;&amp; c != p) *l++ = std::move(*r &lt; *c ? *r++ : *c++);</div>
 <div class="line"><span class="lineno">   65</span>    <span class="comment">// notice only one of the two following loops will be executed</span></div>
 <div class="line"><span class="lineno">   66</span>    <span class="comment">// while the right part hasn&#39;t bee exhausted, move it back</span></div>
-<div class="line"><span class="lineno">   67</span>    <span class="keywordflow">while</span> (e != r) *l++ = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(*r++);</div>
+<div class="line"><span class="lineno">   67</span>    <span class="keywordflow">while</span> (e != r) *l++ = std::move(*r++);</div>
 <div class="line"><span class="lineno">   68</span>    <span class="comment">// while the buffer hasn&#39;t bee exhausted, move it back</span></div>
-<div class="line"><span class="lineno">   69</span>    <span class="keywordflow">while</span> (c != p) *l++ = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(*c++);</div>
+<div class="line"><span class="lineno">   69</span>    <span class="keywordflow">while</span> (c != p) *l++ = std::move(*c++);</div>
 <div class="line"><span class="lineno">   70</span>}</div>
-<div class="ttc" id="amove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></div><div class="ttdeci">T move(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d91/namespacesorting_aa26de383227859210f14dcf12201a079_cgraph.svg" width="243" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae97f4dd815654c4682f564afd718e824" name="ae97f4dd815654c4682f564afd718e824"></a>
@@ -747,15 +740,12 @@ template&lt;class Iterator &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/db6/non__recursive__merge__sort_8cpp_source.html#l00086">86</a> of file <a class="el" href="../../d0/db6/non__recursive__merge__sort_8cpp_source.html">non_recursive_merge_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   86</span>                                                                         {</div>
 <div class="line"><span class="lineno">   87</span>    non_recursive_merge_sort(first, last, last - first);</div>
 <div class="line"><span class="lineno">   88</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg" width="638" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a140d913e42fb94176a0b2c8b29a80420" name="a140d913e42fb94176a0b2c8b29a80420"></a>
@@ -793,6 +783,8 @@ template&lt;class Iterator &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/db6/non__recursive__merge__sort_8cpp_source.html#l00025">25</a> of file <a class="el" href="../../d0/db6/non__recursive__merge__sort_8cpp_source.html">non_recursive_merge_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   26</span>                                              {</div>
 <div class="line"><span class="lineno">   27</span>    <span class="comment">// create a buffer large enough to store all elements</span></div>
 <div class="line"><span class="lineno">   28</span>    <span class="comment">// dynamically allocated to comply with cpplint</span></div>
@@ -815,13 +807,8 @@ template&lt;class Iterator &gt; </div>
 <div class="line"><span class="lineno">   45</span>    }</div>
 <div class="line"><span class="lineno">   46</span>    <span class="keyword">delete</span>[] buffer;</div>
 <div class="line"><span class="lineno">   47</span>}</div>
-<div class="ttc" id="agroup__sorting_html_ga460c61cd948203b4816bef2accb3fc73"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge</a></div><div class="ttdeci">void merge(int *arr, int l, int m, int r)</div><div class="ttdef"><b>Definition</b> merge_sort.cpp:33</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg" width="440" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agroup__sorting_html_ga460c61cd948203b4816bef2accb3fc73"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge</a></div><div class="ttdeci">void merge(int *arr, int l, int m, int r)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/df4/merge__sort_8cpp_source.html#l00033">merge_sort.cpp:33</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a27236b8d3df3832e1f1225576a122534" name="a27236b8d3df3832e1f1225576a122534"></a>
@@ -853,15 +840,12 @@ template&lt;class Iterator &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/db6/non__recursive__merge__sort_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../d0/db6/non__recursive__merge__sort_8cpp_source.html">non_recursive_merge_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   77</span>                                                                    {</div>
 <div class="line"><span class="lineno">   78</span>    non_recursive_merge_sort(first, first + n, n);</div>
 <div class="line"><span class="lineno">   79</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg" width="638" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aac8f44b28b4aa96444383030b28f8b34" name="aac8f44b28b4aa96444383030b28f8b34"></a>
@@ -873,7 +857,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">int sorting::partition </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
+          <td class="paramtype">std::vector&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -898,25 +882,22 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>int next index of the pivot </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d22/quick__sort__iterative_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../d3/d22/quick__sort__iterative_8cpp_source.html">quick_sort_iterative.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   34</span>{</div>
 <div class="line"><span class="lineno">   35</span>    <span class="keywordtype">int</span> pivot = arr[end];</div>
 <div class="line"><span class="lineno">   36</span>    <span class="keywordtype">int</span> index = start - 1;</div>
 <div class="line"><span class="lineno">   37</span> </div>
 <div class="line"><span class="lineno">   38</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = start; j &lt; end; j++) {</div>
 <div class="line"><span class="lineno">   39</span>        <span class="keywordflow">if</span> (arr[j] &lt;= pivot) {</div>
-<div class="line"><span class="lineno">   40</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(arr[++index], arr[j]);</div>
+<div class="line"><span class="lineno">   40</span>            std::swap(arr[++index], arr[j]);</div>
 <div class="line"><span class="lineno">   41</span>        }</div>
 <div class="line"><span class="lineno">   42</span>    }</div>
 <div class="line"><span class="lineno">   43</span> </div>
-<div class="line"><span class="lineno">   44</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(arr[index + 1], arr[end]);</div>
+<div class="line"><span class="lineno">   44</span>    std::swap(arr[index + 1], arr[end]);</div>
 <div class="line"><span class="lineno">   45</span>    <span class="keywordflow">return</span> index + 1;</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">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.svg" width="252" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0e9e1b21a1684585e9e50f9afe4d53a3" name="a0e9e1b21a1684585e9e50f9afe4d53a3"></a>
@@ -925,12 +906,12 @@ Here is the call graph for this function:</div>
 <div class="memitem">
 <div class="memproto">
 <div class="memtemplate">
-template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> N&gt; </div>
+template&lt;std::size_t N&gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, N &gt; sorting::pigeonSort </td>
+          <td class="memname">std::array&lt; int, N &gt; sorting::pigeonSort </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, N &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
+          <td class="paramtype">std::array&lt; int, N &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -942,10 +923,12 @@ template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>sorted array of elements </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html">pigeonhole_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   34</span>                                                  {</div>
 <div class="line"><span class="lineno">   35</span>    <span class="comment">// Finding min and max*</span></div>
-<div class="line"><span class="lineno">   36</span>    <span class="keyword">auto</span> min = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min_element.html">std::min_element</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr));</div>
-<div class="line"><span class="lineno">   37</span>    <span class="keyword">auto</span> max = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">std::max_element</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr));</div>
+<div class="line"><span class="lineno">   36</span>    <span class="keyword">auto</span> min = std::min_element(std::begin(arr), std::end(arr));</div>
+<div class="line"><span class="lineno">   37</span>    <span class="keyword">auto</span> max = std::max_element(std::begin(arr), std::end(arr));</div>
 <div class="line"><span class="lineno">   38</span> </div>
 <div class="line"><span class="lineno">   39</span>    <span class="comment">// Range refers to the number of holes required</span></div>
 <div class="line"><span class="lineno">   40</span>    <span class="keywordtype">int</span> range = *max - *min + 1;</div>
@@ -969,16 +952,7 @@ template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/
 <div class="line"><span class="lineno">   58</span> </div>
 <div class="line"><span class="lineno">   59</span>    <span class="keywordflow">return</span> arr;</div>
 <div class="line"><span class="lineno">   60</span>}</div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="amax_element_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">std::max_element</a></div><div class="ttdeci">T max_element(T... args)</div></div>
-<div class="ttc" id="amin_element_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min_element.html">std::min_element</a></div><div class="ttdeci">T min_element(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d91/namespacesorting_a0e9e1b21a1684585e9e50f9afe4d53a3_cgraph.svg" width="315" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a9f59fe72dacc1f1218ef3c303d843168" name="a9f59fe72dacc1f1218ef3c303d843168"></a>
@@ -992,7 +966,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void sorting::quicksort </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
+          <td class="paramtype">std::vector&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -1020,6 +994,8 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d4c/quick__sort__3_8cpp_source.html#l00094">94</a> of file <a class="el" href="../../d3/d4c/quick__sort__3_8cpp_source.html">quick_sort_3.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   94</span>                                                             {</div>
 <div class="line"><span class="lineno">   95</span>    <span class="keywordflow">if</span> (low &gt;= high) {  <span class="comment">// 1 or 0 elements</span></div>
 <div class="line"><span class="lineno">   96</span>        <span class="keywordflow">return</span>;</div>
@@ -1034,12 +1010,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  105</span>    quicksort(arr, low, i);</div>
 <div class="line"><span class="lineno">  106</span>    quicksort(arr, j, high);</div>
 <div class="line"><span class="lineno">  107</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d91/namespacesorting_a9f59fe72dacc1f1218ef3c303d843168_cgraph.svg" width="132" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6eb67c2f91c98cf4464f75b5882022de" name="a6eb67c2f91c98cf4464f75b5882022de"></a>
@@ -1051,9 +1022,9 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; sorting::quicksort </td>
+          <td class="memname">std::vector&lt; T &gt; sorting::quicksort </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
+          <td class="paramtype">std::vector&lt; T &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -1082,6 +1053,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>sorted array vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d4c/quick__sort__3_8cpp_source.html#l00119">119</a> of file <a class="el" href="../../d3/d4c/quick__sort__3_8cpp_source.html">quick_sort_3.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  119</span>                                                                    {</div>
 <div class="line"><span class="lineno">  120</span>    <span class="keywordflow">if</span> (low &gt;= high) {  <span class="comment">// 1 or 0 elements</span></div>
 <div class="line"><span class="lineno">  121</span>        <span class="keywordflow">return</span> arr;</div>
@@ -1098,12 +1071,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  132</span> </div>
 <div class="line"><span class="lineno">  133</span>    <span class="keywordflow">return</span> arr;</div>
 <div class="line"><span class="lineno">  134</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d91/namespacesorting_a6eb67c2f91c98cf4464f75b5882022de_cgraph.svg" width="302" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="affc6ee160142cd017f8c4b213437d0fd" name="affc6ee160142cd017f8c4b213437d0fd"></a>
@@ -1115,9 +1083,9 @@ Here is the call graph for this function:</div>
 template&lt;typename T , size_t N&gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; sorting::randomized_bogosort </td>
+          <td class="memname">std::array&lt; T, N &gt; sorting::randomized_bogosort </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
+          <td class="paramtype">std::array&lt; T, N &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -1136,25 +1104,18 @@ template&lt;typename T , size_t N&gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new array with elements sorted from a given array </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/ddb/bogo__sort_8cpp_source.html#l00052">52</a> of file <a class="el" href="../../d5/ddb/bogo__sort_8cpp_source.html">bogo_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   52</span>                                                          {</div>
 <div class="line"><span class="lineno">   53</span>    <span class="comment">// Untill array is not sorted</span></div>
-<div class="line"><span class="lineno">   54</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/random_device.html">std::random_device</a> random_device;</div>
-<div class="line"><span class="lineno">   55</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html">std::mt19937</a> generator(random_device());</div>
-<div class="line"><span class="lineno">   56</span>    <span class="keywordflow">while</span> (!<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/begin.html">begin</a>(), arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/end.html">end</a>())) {</div>
-<div class="line"><span class="lineno">   57</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html">std::shuffle</a>(arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/begin.html">begin</a>(), arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/end.html">end</a>(), generator);<span class="comment">// Shuffle the array</span></div>
+<div class="line"><span class="lineno">   54</span>    std::random_device random_device;</div>
+<div class="line"><span class="lineno">   55</span>    std::mt19937 generator(random_device());</div>
+<div class="line"><span class="lineno">   56</span>    <span class="keywordflow">while</span> (!std::is_sorted(arr.begin(), arr.end())) {</div>
+<div class="line"><span class="lineno">   57</span>        std::shuffle(arr.begin(), arr.end(), generator);<span class="comment">// Shuffle the array</span></div>
 <div class="line"><span class="lineno">   58</span>    }</div>
 <div class="line"><span class="lineno">   59</span>    <span class="keywordflow">return</span> arr;</div>
 <div class="line"><span class="lineno">   60</span>}</div>
-<div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-<div class="ttc" id="amersenne_twister_engine_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html">std::mt19937</a></div></div>
-<div class="ttc" id="arandom_device_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/random_device.html">std::random_device</a></div></div>
-<div class="ttc" id="arandom_shuffle_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html">std::shuffle</a></div><div class="ttdeci">T shuffle(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d91/namespacesorting_affc6ee160142cd017f8c4b213437d0fd_cgraph.svg" width="310" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae3a775d99dbbb94c130a973df0cfddcf" name="ae3a775d99dbbb94c130a973df0cfddcf"></a>
@@ -1168,7 +1129,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void sorting::recursive_bubble_sort </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>nums</em></span>, </td>
+          <td class="paramtype">std::vector&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>nums</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -1195,28 +1156,23 @@ template&lt;typename T &gt; </div>
 <p>&lt; base case; when size of the array is 1</p>
 <p>&lt; iterating over the entire array</p>
 <p>&lt; if a larger number appears before the smaller one, swap them.</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/df9/recursive__bubble__sort_8cpp_source.html#l00084">84</a> of file <a class="el" href="../../d3/df9/recursive__bubble__sort_8cpp_source.html">recursive_bubble_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   84</span>                                                           {</div>
-<div class="line"><span class="lineno">   85</span>    <span class="keywordflow">if</span> (n == 1) {  <span class="comment">//!&lt; base case; when size of the array is 1</span></div>
+<div class="line"><span class="lineno">   85</span>    <span class="keywordflow">if</span> (n == 1) {  </div>
 <div class="line"><span class="lineno">   86</span>        <span class="keywordflow">return</span>;</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>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n - 1; i++) {  <span class="comment">//!&lt; iterating over the entire array</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">   90</span><span class="comment">        //!&lt; if a larger number appears before the smaller one, swap them.</span></div>
-<div class="line"><span class="lineno">   91</span><span class="comment"></span>        <span class="keywordflow">if</span> ((*nums)[i] &gt; (*nums)[i + 1]) {</div>
-<div class="line"><span class="lineno">   92</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>((*nums)[i], (*nums)[i + 1]);</div>
+<div class="line"><span class="lineno">   89</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n - 1; i++) {  </div>
+<div class="line"><span class="lineno">   91</span>        <span class="keywordflow">if</span> ((*nums)[i] &gt; (*nums)[i + 1]) {</div>
+<div class="line"><span class="lineno">   92</span>            std::swap((*nums)[i], (*nums)[i + 1]);</div>
 <div class="line"><span class="lineno">   93</span>        }</div>
 <div class="line"><span class="lineno">   94</span>    }</div>
-<div class="line"><span class="lineno">   95</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   96</span><span class="comment">    //!&lt; calling the function after we have fixed the last element</span></div>
-<div class="line"><span class="lineno">   97</span><span class="comment"></span>    <a class="code hl_function" href="#ae3a775d99dbbb94c130a973df0cfddcf">recursive_bubble_sort</a>(nums, n - 1);</div>
+<div class="line"><span class="lineno">   95</span> </div>
+<div class="line"><span class="lineno">   97</span>    <a class="code hl_function" href="#ae3a775d99dbbb94c130a973df0cfddcf">recursive_bubble_sort</a>(nums, n - 1);</div>
 <div class="line"><span class="lineno">   98</span>}</div>
-<div class="ttc" id="anamespacesorting_html_ae3a775d99dbbb94c130a973df0cfddcf"><div class="ttname"><a href="#ae3a775d99dbbb94c130a973df0cfddcf">sorting::recursive_bubble_sort</a></div><div class="ttdeci">void recursive_bubble_sort(std::vector&lt; T &gt; *nums, uint64_t n)</div><div class="ttdoc">This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is t...</div><div class="ttdef"><b>Definition</b> recursive_bubble_sort.cpp:84</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d91/namespacesorting_ae3a775d99dbbb94c130a973df0cfddcf_cgraph.svg" width="259" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacesorting_html_ae3a775d99dbbb94c130a973df0cfddcf"><div class="ttname"><a href="#ae3a775d99dbbb94c130a973df0cfddcf">sorting::recursive_bubble_sort</a></div><div class="ttdeci">void recursive_bubble_sort(std::vector&lt; T &gt; *nums, uint64_t n)</div><div class="ttdoc">This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is t...</div><div class="ttdef"><b>Definition</b> <a href="../../d3/df9/recursive__bubble__sort_8cpp_source.html#l00084">recursive_bubble_sort.cpp:84</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a06af4f0dae2de2a2ae5b797d7aa26755" name="a06af4f0dae2de2a2ae5b797d7aa26755"></a>
@@ -1226,9 +1182,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; sorting::selectionSort </td>
+          <td class="memname">std::vector&lt; uint64_t &gt; sorting::selectionSort </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; uint64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -1237,10 +1193,12 @@ Here is the call graph for this function:</div>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d85/selection__sort__iterative_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../d9/d85/selection__sort__iterative_8cpp_source.html">selection_sort_iterative.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   49</span>                                                  {</div>
-<div class="line"><span class="lineno">   50</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> array(</div>
-<div class="line"><span class="lineno">   51</span>        arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(),</div>
-<div class="line"><span class="lineno">   52</span>        arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>());  <span class="comment">// declare a vector in which result will be stored</span></div>
+<div class="line"><span class="lineno">   50</span>    std::vector&lt;uint64_t&gt; array(</div>
+<div class="line"><span class="lineno">   51</span>        arr.begin(),</div>
+<div class="line"><span class="lineno">   52</span>        arr.end());  <span class="comment">// declare a vector in which result will be stored</span></div>
 <div class="line"><span class="lineno">   53</span>    <span class="keywordflow">for</span> (uint64_t it = 0; it &lt; len; ++it) {</div>
 <div class="line"><span class="lineno">   54</span>        uint64_t min = it;  <span class="comment">// set min value</span></div>
 <div class="line"><span class="lineno">   55</span>        <span class="keywordflow">for</span> (uint64_t it2 = it + 1; it2 &lt; len; ++it2) {</div>
@@ -1250,16 +1208,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   59</span>        }</div>
 <div class="line"><span class="lineno">   60</span> </div>
 <div class="line"><span class="lineno">   61</span>        <span class="keywordflow">if</span> (min != it) {  <span class="comment">// swap if min does not match to i</span></div>
-<div class="line"><span class="lineno">   62</span>            uint64_t tmp = array[<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a>];</div>
-<div class="line"><span class="lineno">   63</span>            array[<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a>] = array[it];</div>
+<div class="line"><span class="lineno">   62</span>            uint64_t tmp = array[min];</div>
+<div class="line"><span class="lineno">   63</span>            array[min] = array[it];</div>
 <div class="line"><span class="lineno">   64</span>            array[it] = tmp;</div>
 <div class="line"><span class="lineno">   65</span>        }</div>
 <div class="line"><span class="lineno">   66</span>    }</div>
 <div class="line"><span class="lineno">   67</span> </div>
 <div class="line"><span class="lineno">   68</span>    <span class="keywordflow">return</span> array;  <span class="comment">// return sorted vector</span></div>
 <div class="line"><span class="lineno">   69</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="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -1274,22 +1230,18 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void sorting::shell_sort </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
 </div><div class="memdoc">
-<p>function overload - when input array is of type <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>, simply send the data content and the data length to the above function. </p>
-<div class="fragment"><div class="line"><span class="lineno">   75</span>                                   {</div>
-<div class="line"><span class="lineno">   76</span>    shell_sort(arr-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/data.html">data</a>(), arr-&gt;<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">   77</span>}</div>
-<div class="ttc" id="adata_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/data.html">std::vector::data</a></div><div class="ttdeci">T data(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg" width="308" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
+<p>function overload - when input array is of type std::vector, simply send the data content and the data length to the above function. </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html#l00075">75</a> of file <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html">shell_sort2.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   75</span>                                   {</div>
+<div class="line"><span class="lineno">   76</span>    shell_sort(arr-&gt;data(), arr-&gt;size());</div>
+<div class="line"><span class="lineno">   77</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5669396c6a6b1e14b97589b6e37980aa" name="a5669396c6a6b1e14b97589b6e37980aa"></a>
@@ -1313,6 +1265,8 @@ template&lt;typename T &gt; </div>
       </table>
 </div><div class="memdoc">
 <p>Optimized algorithm - takes half the time by utilizing Mar </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html#l00045">45</a> of file <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html">shell_sort2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   45</span>                                    {</div>
 <div class="line"><span class="lineno">   46</span>    <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> gaps[] = {701, 301, 132, 57, 23, 10, 4, 1};</div>
 <div class="line"><span class="lineno">   47</span>    <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> gap_len = 8;</div>
@@ -1351,15 +1305,12 @@ template&lt;typename T , size_t N&gt; </div>
       </table>
 </div><div class="memdoc">
 <p>function overload - when input array is of a known length array type </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../d4/d7a/shell__sort2_8cpp_source.html">shell_sort2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   67</span>                             {</div>
 <div class="line"><span class="lineno">   68</span>    shell_sort(arr, N);</div>
 <div class="line"><span class="lineno">   69</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg" width="308" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7bfe11bd4703eacd1dab93f25ec639c5" name="a7bfe11bd4703eacd1dab93f25ec639c5"></a>
@@ -1371,9 +1322,9 @@ Here is the call graph for this function:</div>
 template&lt;typename T , size_t N&gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; sorting::shuffle </td>
+          <td class="memname">std::array&lt; T, N &gt; sorting::shuffle </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
+          <td class="paramtype">std::array&lt; T, N &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -1392,20 +1343,16 @@ template&lt;typename T , size_t N&gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new array with elements shuffled from a given array </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/ddb/bogo__sort_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../d5/ddb/bogo__sort_8cpp_source.html">bogo_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   37</span>                                              {</div>
 <div class="line"><span class="lineno">   38</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N; i++) {</div>
 <div class="line"><span class="lineno">   39</span>        <span class="comment">// Swaps i&#39;th  index with random index (less than array size)</span></div>
-<div class="line"><span class="lineno">   40</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(arr[i], arr[<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % N]);</div>
+<div class="line"><span class="lineno">   40</span>        std::swap(arr[i], arr[std::rand() % N]);</div>
 <div class="line"><span class="lineno">   41</span>    }</div>
 <div class="line"><span class="lineno">   42</span>    <span class="keywordflow">return</span> arr;</div>
 <div class="line"><span class="lineno">   43</span>}</div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-</div><!-- 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="../../d5/d91/namespacesorting_a7bfe11bd4703eacd1dab93f25ec639c5_cgraph.svg" width="244" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d5/d91/namespacesorting_a034d8b276518a902962e87d3158b64fd_cgraph.map b/d5/d91/namespacesorting_a034d8b276518a902962e87d3158b64fd_cgraph.map
deleted file mode 100644
index 7f1d53915..000000000
--- a/d5/d91/namespacesorting_a034d8b276518a902962e87d3158b64fd_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="sorting::binary_search" name="sorting::binary_search">
-<area shape="rect" id="Node000001" title="Binary search function to find the most suitable pace for an element." alt="" coords="5,29,155,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="54,30,49,21,52,11,63,5,80,3,98,5,108,12,105,16,96,10,80,8,65,10,57,15,55,20,59,28"/>
-</map>
diff --git a/d5/d91/namespacesorting_a034d8b276518a902962e87d3158b64fd_cgraph.md5 b/d5/d91/namespacesorting_a034d8b276518a902962e87d3158b64fd_cgraph.md5
deleted file mode 100644
index 8529407a5..000000000
--- a/d5/d91/namespacesorting_a034d8b276518a902962e87d3158b64fd_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9e5eb6fc0a3437434482e8b86d46572e
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_a034d8b276518a902962e87d3158b64fd_cgraph.svg b/d5/d91/namespacesorting_a034d8b276518a902962e87d3158b64fd_cgraph.svg
deleted file mode 100644
index cb9083cad..000000000
--- a/d5/d91/namespacesorting_a034d8b276518a902962e87d3158b64fd_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::binary_search Pages: 1 -->
-<svg width="120pt" height="45pt"
- viewBox="0.00 0.00 120.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>sorting::binary_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Binary search function to find the most suitable pace for an element.">
-<polygon fill="#999999" stroke="#666666" points="112,-19.25 0,-19.25 0,0 112,0 112,-19.25"/>
-<text text-anchor="middle" x="56" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::binary_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.47,-19.54C30.47,-28.15 36.31,-37.25 56,-37.25 66.77,-37.25 73.39,-34.53 75.88,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.34,-30.08 73.85,-21.02 72.49,-31.53 79.34,-30.08"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d91/namespacesorting_a034d8b276518a902962e87d3158b64fd_cgraph_org.svg b/d5/d91/namespacesorting_a034d8b276518a902962e87d3158b64fd_cgraph_org.svg
deleted file mode 100644
index 2976f43a6..000000000
--- a/d5/d91/namespacesorting_a034d8b276518a902962e87d3158b64fd_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::binary_search Pages: 1 -->
-<svg width="120pt" height="45pt"
- viewBox="0.00 0.00 120.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>sorting::binary_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Binary search function to find the most suitable pace for an element.">
-<polygon fill="#999999" stroke="#666666" points="112,-19.25 0,-19.25 0,0 112,0 112,-19.25"/>
-<text text-anchor="middle" x="56" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::binary_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.47,-19.54C30.47,-28.15 36.31,-37.25 56,-37.25 66.77,-37.25 73.39,-34.53 75.88,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.34,-30.08 73.85,-21.02 72.49,-31.53 79.34,-30.08"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d91/namespacesorting_a0e9e1b21a1684585e9e50f9afe4d53a3_cgraph.map b/d5/d91/namespacesorting_a0e9e1b21a1684585e9e50f9afe4d53a3_cgraph.map
deleted file mode 100644
index 36ed2a743..000000000
--- a/d5/d91/namespacesorting_a0e9e1b21a1684585e9e50f9afe4d53a3_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="sorting::pigeonSort" name="sorting::pigeonSort">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,80,136,106"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="207,5,286,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="99,77,183,40,195,35,197,40,185,45,101,82"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="212,55,280,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="136,81,196,72,197,77,137,86"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max_element.html#" title=" " alt="" coords="184,104,309,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="137,99,169,104,168,109,136,104"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min_element.html#" title=" " alt="" coords="186,153,307,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="102,104,185,140,197,145,195,150,183,145,100,109"/>
-</map>
diff --git a/d5/d91/namespacesorting_a0e9e1b21a1684585e9e50f9afe4d53a3_cgraph.md5 b/d5/d91/namespacesorting_a0e9e1b21a1684585e9e50f9afe4d53a3_cgraph.md5
deleted file mode 100644
index 2456666a0..000000000
--- a/d5/d91/namespacesorting_a0e9e1b21a1684585e9e50f9afe4d53a3_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6e52ffa0f0030e5c0df14d7cd39c3c1a
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_a0e9e1b21a1684585e9e50f9afe4d53a3_cgraph.svg b/d5/d91/namespacesorting_a0e9e1b21a1684585e9e50f9afe4d53a3_cgraph.svg
deleted file mode 100644
index 09071a9cf..000000000
--- a/d5/d91/namespacesorting_a0e9e1b21a1684585e9e50f9afe4d53a3_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::pigeonSort Pages: 1 -->
-<svg width="236pt" height="138pt"
- viewBox="0.00 0.00 235.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>sorting::pigeonSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="97.75,-74.25 0,-74.25 0,-55 97.75,-55 97.75,-74.25"/>
-<text text-anchor="middle" x="48.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pigeonSort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="210.12,-130.25 151.38,-130.25 151.38,-111 210.12,-111 210.12,-130.25"/>
-<text text-anchor="middle" x="180.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.11,-74.62C87.99,-82.47 112.24,-93.55 133.75,-102.62 136.71,-103.87 139.8,-105.14 142.9,-106.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.39,-109.57 151.98,-110.02 143.98,-103.07 141.39,-109.57"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="206.38,-93.25 155.12,-93.25 155.12,-74 206.38,-74 206.38,-93.25"/>
-<text text-anchor="middle" x="180.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.24,-71.7C113.22,-73.89 129.47,-76.27 143.49,-78.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.77,-81.75 153.17,-79.74 143.78,-74.83 142.77,-81.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.75,-56.25 133.75,-56.25 133.75,-37 227.75,-37 227.75,-56.25"/>
-<text text-anchor="middle" x="180.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.24,-57.92C106.08,-56.84 114.27,-55.7 122.3,-54.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.58,-58.08 132,-53.24 121.62,-51.15 122.58,-58.08"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.25,-19.25 135.25,-19.25 135.25,0 226.25,0 226.25,-19.25"/>
-<text text-anchor="middle" x="180.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.84,-54.63C88.7,-47.03 112.59,-36.43 133.75,-27.62 136.72,-26.39 139.81,-25.13 142.91,-23.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.99,-27.22 151.99,-20.27 141.41,-20.71 143.99,-27.22"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d91/namespacesorting_a0e9e1b21a1684585e9e50f9afe4d53a3_cgraph_org.svg b/d5/d91/namespacesorting_a0e9e1b21a1684585e9e50f9afe4d53a3_cgraph_org.svg
deleted file mode 100644
index 00d97d8b5..000000000
--- a/d5/d91/namespacesorting_a0e9e1b21a1684585e9e50f9afe4d53a3_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::pigeonSort Pages: 1 -->
-<svg width="236pt" height="138pt"
- viewBox="0.00 0.00 235.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>sorting::pigeonSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="97.75,-74.25 0,-74.25 0,-55 97.75,-55 97.75,-74.25"/>
-<text text-anchor="middle" x="48.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pigeonSort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="210.12,-130.25 151.38,-130.25 151.38,-111 210.12,-111 210.12,-130.25"/>
-<text text-anchor="middle" x="180.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.11,-74.62C87.99,-82.47 112.24,-93.55 133.75,-102.62 136.71,-103.87 139.8,-105.14 142.9,-106.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.39,-109.57 151.98,-110.02 143.98,-103.07 141.39,-109.57"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="206.38,-93.25 155.12,-93.25 155.12,-74 206.38,-74 206.38,-93.25"/>
-<text text-anchor="middle" x="180.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.24,-71.7C113.22,-73.89 129.47,-76.27 143.49,-78.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.77,-81.75 153.17,-79.74 143.78,-74.83 142.77,-81.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.75,-56.25 133.75,-56.25 133.75,-37 227.75,-37 227.75,-56.25"/>
-<text text-anchor="middle" x="180.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.24,-57.92C106.08,-56.84 114.27,-55.7 122.3,-54.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.58,-58.08 132,-53.24 121.62,-51.15 122.58,-58.08"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.25,-19.25 135.25,-19.25 135.25,0 226.25,0 226.25,-19.25"/>
-<text text-anchor="middle" x="180.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.84,-54.63C88.7,-47.03 112.59,-36.43 133.75,-27.62 136.72,-26.39 139.81,-25.13 142.91,-23.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.99,-27.22 151.99,-20.27 141.41,-20.71 143.99,-27.22"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.map b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.map
deleted file mode 100644
index fc210739e..000000000
--- a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="sorting::non_recursive_merge_sort" name="sorting::non_recursive_merge_sort">
-<area shape="rect" id="Node000001" title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order" alt="" coords="5,5,155,46"/>
-<area shape="rect" id="Node000002" href="$d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079" title="merges 2 sorted adjacent segments into a larger sorted segment" alt="" coords="203,13,307,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,23,187,23,187,28,155,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="355,13,434,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="308,23,339,23,339,28,308,28"/>
-</map>
diff --git a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.md5 b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.md5
deleted file mode 100644
index 1fa49c646..000000000
--- a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a3b514c723edd649aeae410f680d5978
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg
deleted file mode 100644
index 16480a49f..000000000
--- a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::non_recursive_merge_sort Pages: 1 -->
-<svg width="330pt" height="39pt"
- viewBox="0.00 0.00 329.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>sorting::non_recursive_merge_sort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order">
-<polygon fill="#999999" stroke="#666666" points="112,-30.5 0,-30.5 0,0 112,0 112,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::non_recursive</text>
-<text text-anchor="middle" x="56" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_merge_sort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079" target="_top" xlink:title="merges 2 sorted adjacent segments into a larger sorted segment">
-<polygon fill="white" stroke="#666666" points="226.25,-24.88 148,-24.88 148,-5.63 226.25,-5.63 226.25,-24.88"/>
-<text text-anchor="middle" x="187.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.14,-15.25C120.15,-15.25 128.36,-15.25 136.26,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.04,-18.75 146.04,-15.25 136.04,-11.75 136.04,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321.75,-24.88 262.25,-24.88 262.25,-5.63 321.75,-5.63 321.75,-24.88"/>
-<text text-anchor="middle" x="292" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M226.72,-15.25C234.45,-15.25 242.58,-15.25 250.37,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="250.32,-18.75 260.32,-15.25 250.32,-11.75 250.32,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph_org.svg b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph_org.svg
deleted file mode 100644
index fcac1a2b1..000000000
--- a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::non_recursive_merge_sort Pages: 1 -->
-<svg width="330pt" height="39pt"
- viewBox="0.00 0.00 329.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>sorting::non_recursive_merge_sort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order">
-<polygon fill="#999999" stroke="#666666" points="112,-30.5 0,-30.5 0,0 112,0 112,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::non_recursive</text>
-<text text-anchor="middle" x="56" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_merge_sort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079" target="_top" xlink:title="merges 2 sorted adjacent segments into a larger sorted segment">
-<polygon fill="white" stroke="#666666" points="226.25,-24.88 148,-24.88 148,-5.63 226.25,-5.63 226.25,-24.88"/>
-<text text-anchor="middle" x="187.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.14,-15.25C120.15,-15.25 128.36,-15.25 136.26,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.04,-18.75 146.04,-15.25 136.04,-11.75 136.04,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321.75,-24.88 262.25,-24.88 262.25,-5.63 321.75,-5.63 321.75,-24.88"/>
-<text text-anchor="middle" x="292" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M226.72,-15.25C234.45,-15.25 242.58,-15.25 250.37,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="250.32,-18.75 260.32,-15.25 250.32,-11.75 250.32,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph.map b/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph.map
deleted file mode 100644
index fec18d63f..000000000
--- a/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="sorting::iterativeQuickSort" name="sorting::iterativeQuickSort">
-<area shape="rect" id="Node000001" title="The main sorting function." alt="" coords="5,104,178,130"/>
-<area shape="rect" id="Node000002" href="$d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34" title="The partition function sorts the array from start to end and uses the last element as the pivot." alt="" coords="226,5,340,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="114,101,224,40,234,35,236,40,227,45,116,106"/>
-<area shape="rect" id="Node000004" href="$d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" title=" " alt="" coords="242,55,324,80"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="144,101,226,79,228,84,145,106"/>
-<area shape="rect" id="Node000005" href="$d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" title=" " alt="" coords="239,104,328,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="178,114,223,114,223,120,178,120"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="226,153,341,179"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="145,128,217,146,215,152,144,133"/>
-<area shape="rect" id="Node000008" href="$d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" title=" " alt="" coords="244,203,323,228"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="116,128,227,189,236,194,234,198,224,194,114,133"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="412,5,491,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="341,16,397,16,397,21,341,21"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="389,104,514,130"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="329,114,373,114,373,120,329,120"/>
-</map>
diff --git a/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph.md5 b/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph.md5
deleted file mode 100644
index 973aed750..000000000
--- a/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-294ca56a54bd9dc9c0c33ab45e58117f
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph.svg b/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph.svg
deleted file mode 100644
index eefba55e8..000000000
--- a/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph.svg
+++ /dev/null
@@ -1,173 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::iterativeQuickSort Pages: 1 -->
-<svg width="390pt" height="175pt"
- viewBox="0.00 0.00 389.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>sorting::iterativeQuickSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main sorting function.">
-<polygon fill="#999999" stroke="#666666" points="129.25,-93.25 0,-93.25 0,-74 129.25,-74 129.25,-93.25"/>
-<text text-anchor="middle" x="64.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::iterativeQuickSort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34" target="_top" xlink:title="The partition function sorts the array from start to end and uses the last element as the pivot.">
-<polygon fill="white" stroke="#666666" points="251.38,-167.25 165.62,-167.25 165.62,-148 251.38,-148 251.38,-167.25"/>
-<text text-anchor="middle" x="208.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::partition</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.25,-93.71C101.78,-105.39 135.34,-124.9 165.25,-139.62 167.52,-140.74 169.87,-141.86 172.25,-142.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.78,-146.13 181.34,-146.99 173.62,-139.73 170.78,-146.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="239.38,-130.25 177.62,-130.25 177.62,-111 239.38,-111 239.38,-130.25"/>
-<text text-anchor="middle" x="208.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.39,-93.74C123.6,-98.74 146.79,-104.79 166.31,-109.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.3,-113.24 175.86,-112.37 167.07,-106.46 165.3,-113.24"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242,-93.25 175,-93.25 175,-74 242,-74 242,-93.25"/>
-<text text-anchor="middle" x="208.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.51,-83.62C140.96,-83.62 152.66,-83.62 163.39,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.09,-87.13 173.09,-83.63 163.09,-80.13 163.09,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.75,-56.25 165.25,-56.25 165.25,-37 251.75,-37 251.75,-56.25"/>
-<text text-anchor="middle" x="208.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.39,-73.51C120.97,-69.19 140.52,-64.09 158.12,-59.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.52,-63.02 167.31,-57.11 156.75,-56.24 158.52,-63.02"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.25,-19.25 178.75,-19.25 178.75,0 238.25,0 238.25,-19.25"/>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.25,-73.54C101.78,-61.86 135.34,-42.35 165.25,-27.62 167.52,-26.51 169.87,-25.39 172.25,-24.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.62,-27.52 181.34,-20.26 170.78,-21.12 173.62,-27.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="364.12,-167.25 305.38,-167.25 305.38,-148 364.12,-148 364.12,-167.25"/>
-<text text-anchor="middle" x="334.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.57,-157.62C265.18,-157.62 280.23,-157.62 293.69,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.53,-161.13 303.53,-157.63 293.53,-154.13 293.53,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="381.75,-93.25 287.75,-93.25 287.75,-74 381.75,-74 381.75,-93.25"/>
-<text text-anchor="middle" x="334.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.47,-83.62C252.82,-83.62 264.57,-83.62 276.11,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="276.01,-87.13 286.01,-83.63 276.01,-80.13 276.01,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph_org.svg b/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph_org.svg
deleted file mode 100644
index e8003b69d..000000000
--- a/d5/d91/namespacesorting_a263595fd9a0163b5b997b89fab3a0dc5_cgraph_org.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::iterativeQuickSort Pages: 1 -->
-<svg width="390pt" height="175pt"
- viewBox="0.00 0.00 389.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>sorting::iterativeQuickSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main sorting function.">
-<polygon fill="#999999" stroke="#666666" points="129.25,-93.25 0,-93.25 0,-74 129.25,-74 129.25,-93.25"/>
-<text text-anchor="middle" x="64.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::iterativeQuickSort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34" target="_top" xlink:title="The partition function sorts the array from start to end and uses the last element as the pivot.">
-<polygon fill="white" stroke="#666666" points="251.38,-167.25 165.62,-167.25 165.62,-148 251.38,-148 251.38,-167.25"/>
-<text text-anchor="middle" x="208.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::partition</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.25,-93.71C101.78,-105.39 135.34,-124.9 165.25,-139.62 167.52,-140.74 169.87,-141.86 172.25,-142.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.78,-146.13 181.34,-146.99 173.62,-139.73 170.78,-146.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="239.38,-130.25 177.62,-130.25 177.62,-111 239.38,-111 239.38,-130.25"/>
-<text text-anchor="middle" x="208.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.39,-93.74C123.6,-98.74 146.79,-104.79 166.31,-109.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.3,-113.24 175.86,-112.37 167.07,-106.46 165.3,-113.24"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242,-93.25 175,-93.25 175,-74 242,-74 242,-93.25"/>
-<text text-anchor="middle" x="208.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.51,-83.62C140.96,-83.62 152.66,-83.62 163.39,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.09,-87.13 173.09,-83.63 163.09,-80.13 163.09,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.75,-56.25 165.25,-56.25 165.25,-37 251.75,-37 251.75,-56.25"/>
-<text text-anchor="middle" x="208.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.39,-73.51C120.97,-69.19 140.52,-64.09 158.12,-59.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.52,-63.02 167.31,-57.11 156.75,-56.24 158.52,-63.02"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.25,-19.25 178.75,-19.25 178.75,0 238.25,0 238.25,-19.25"/>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.25,-73.54C101.78,-61.86 135.34,-42.35 165.25,-27.62 167.52,-26.51 169.87,-25.39 172.25,-24.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.62,-27.52 181.34,-20.26 170.78,-21.12 173.62,-27.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="364.12,-167.25 305.38,-167.25 305.38,-148 364.12,-148 364.12,-167.25"/>
-<text text-anchor="middle" x="334.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.57,-157.62C265.18,-157.62 280.23,-157.62 293.69,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.53,-161.13 303.53,-157.63 293.53,-154.13 293.53,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="381.75,-93.25 287.75,-93.25 287.75,-74 381.75,-74 381.75,-93.25"/>
-<text text-anchor="middle" x="334.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.47,-83.62C252.82,-83.62 264.57,-83.62 276.11,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="276.01,-87.13 286.01,-83.63 276.01,-80.13 276.01,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.map b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.map
deleted file mode 100644
index 25f7a4538..000000000
--- a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="sorting::non_recursive_merge_sort" name="sorting::non_recursive_merge_sort">
-<area shape="rect" id="Node000001" title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order" alt="" coords="5,5,155,46"/>
-<area shape="rect" id="Node000002" href="$d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420" title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order" alt="" coords="203,5,352,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,23,187,23,187,28,155,28"/>
-<area shape="rect" id="Node000003" href="$d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079" title="merges 2 sorted adjacent segments into a larger sorted segment" alt="" coords="400,13,504,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="352,23,384,23,384,28,352,28"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="552,13,632,38"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="505,23,536,23,536,28,505,28"/>
-</map>
diff --git a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.md5 b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.md5
deleted file mode 100644
index 27c02640c..000000000
--- a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a19f33b868f3b01e094268cfb88500b5
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg
deleted file mode 100644
index 736fcade2..000000000
--- a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::non_recursive_merge_sort Pages: 1 -->
-<svg width="478pt" height="39pt"
- viewBox="0.00 0.00 477.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>sorting::non_recursive_merge_sort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order">
-<polygon fill="#999999" stroke="#666666" points="112,-30.5 0,-30.5 0,0 112,0 112,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::non_recursive</text>
-<text text-anchor="middle" x="56" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_merge_sort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420" target="_top" xlink:title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order">
-<polygon fill="white" stroke="#666666" points="260,-30.5 148,-30.5 148,0 260,0 260,-30.5"/>
-<text text-anchor="start" x="156" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::non_recursive</text>
-<text text-anchor="middle" x="204" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_merge_sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.2,-15.25C120.1,-15.25 128.3,-15.25 136.39,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.21,-18.75 146.21,-15.25 136.21,-11.75 136.21,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079" target="_top" xlink:title="merges 2 sorted adjacent segments into a larger sorted segment">
-<polygon fill="white" stroke="#666666" points="374.25,-24.88 296,-24.88 296,-5.63 374.25,-5.63 374.25,-24.88"/>
-<text text-anchor="middle" x="335.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.14,-15.25C268.15,-15.25 276.36,-15.25 284.26,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.04,-18.75 294.04,-15.25 284.04,-11.75 284.04,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="469.75,-24.88 410.25,-24.88 410.25,-5.63 469.75,-5.63 469.75,-24.88"/>
-<text text-anchor="middle" x="440" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M374.72,-15.25C382.45,-15.25 390.58,-15.25 398.37,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="398.32,-18.75 408.32,-15.25 398.32,-11.75 398.32,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph_org.svg b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph_org.svg
deleted file mode 100644
index 05ac41455..000000000
--- a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph_org.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::non_recursive_merge_sort Pages: 1 -->
-<svg width="478pt" height="39pt"
- viewBox="0.00 0.00 477.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>sorting::non_recursive_merge_sort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order">
-<polygon fill="#999999" stroke="#666666" points="112,-30.5 0,-30.5 0,0 112,0 112,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::non_recursive</text>
-<text text-anchor="middle" x="56" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_merge_sort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420" target="_top" xlink:title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order">
-<polygon fill="white" stroke="#666666" points="260,-30.5 148,-30.5 148,0 260,0 260,-30.5"/>
-<text text-anchor="start" x="156" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::non_recursive</text>
-<text text-anchor="middle" x="204" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_merge_sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.2,-15.25C120.1,-15.25 128.3,-15.25 136.39,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.21,-18.75 146.21,-15.25 136.21,-11.75 136.21,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079" target="_top" xlink:title="merges 2 sorted adjacent segments into a larger sorted segment">
-<polygon fill="white" stroke="#666666" points="374.25,-24.88 296,-24.88 296,-5.63 374.25,-5.63 374.25,-24.88"/>
-<text text-anchor="middle" x="335.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.14,-15.25C268.15,-15.25 276.36,-15.25 284.26,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.04,-18.75 294.04,-15.25 284.04,-11.75 284.04,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="469.75,-24.88 410.25,-24.88 410.25,-5.63 469.75,-5.63 469.75,-24.88"/>
-<text text-anchor="middle" x="440" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M374.72,-15.25C382.45,-15.25 390.58,-15.25 398.37,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="398.32,-18.75 408.32,-15.25 398.32,-11.75 398.32,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d91/namespacesorting_a2f8bc626eb57acae24a94636a23af6a1_cgraph.map b/d5/d91/namespacesorting_a2f8bc626eb57acae24a94636a23af6a1_cgraph.map
deleted file mode 100644
index d083f6677..000000000
--- a/d5/d91/namespacesorting_a2f8bc626eb57acae24a94636a23af6a1_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="sorting::gnomeSort" name="sorting::gnomeSort">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,137,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="185,5,263,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="137,16,169,16,169,21,137,21"/>
-</map>
diff --git a/d5/d91/namespacesorting_a2f8bc626eb57acae24a94636a23af6a1_cgraph.md5 b/d5/d91/namespacesorting_a2f8bc626eb57acae24a94636a23af6a1_cgraph.md5
deleted file mode 100644
index 7f80ba3df..000000000
--- a/d5/d91/namespacesorting_a2f8bc626eb57acae24a94636a23af6a1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-66291278c4e363df7acc7f8268ee6cb5
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_a2f8bc626eb57acae24a94636a23af6a1_cgraph.svg b/d5/d91/namespacesorting_a2f8bc626eb57acae24a94636a23af6a1_cgraph.svg
deleted file mode 100644
index 35625231a..000000000
--- a/d5/d91/namespacesorting_a2f8bc626eb57acae24a94636a23af6a1_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::gnomeSort Pages: 1 -->
-<svg width="201pt" height="27pt"
- viewBox="0.00 0.00 201.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>sorting::gnomeSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-19.25 0,-19.25 0,0 98.5,0 98.5,-19.25"/>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::gnomeSort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.25,-19.25 134.5,-19.25 134.5,0 193.25,0 193.25,-19.25"/>
-<text text-anchor="middle" x="163.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.99,-9.62C106.97,-9.62 115.15,-9.62 122.88,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.67,-13.13 132.67,-9.63 122.67,-6.13 122.67,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d91/namespacesorting_a2f8bc626eb57acae24a94636a23af6a1_cgraph_org.svg b/d5/d91/namespacesorting_a2f8bc626eb57acae24a94636a23af6a1_cgraph_org.svg
deleted file mode 100644
index e3570cb3b..000000000
--- a/d5/d91/namespacesorting_a2f8bc626eb57acae24a94636a23af6a1_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::gnomeSort Pages: 1 -->
-<svg width="201pt" height="27pt"
- viewBox="0.00 0.00 201.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>sorting::gnomeSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-19.25 0,-19.25 0,0 98.5,0 98.5,-19.25"/>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::gnomeSort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.25,-19.25 134.5,-19.25 134.5,0 193.25,0 193.25,-19.25"/>
-<text text-anchor="middle" x="163.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.99,-9.62C106.97,-9.62 115.15,-9.62 122.88,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.67,-13.13 132.67,-9.63 122.67,-6.13 122.67,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.map b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.map
deleted file mode 100644
index 5c9bef932..000000000
--- a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="sorting::shell_sort" name="sorting::shell_sort">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,130,31"/>
-<area shape="rect" id="Node000002" href="$d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa" title=" " alt="" coords="178,5,302,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="130,16,162,16,162,21,130,21"/>
-</map>
diff --git a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.md5 b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.md5
deleted file mode 100644
index 97f0a159b..000000000
--- a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-538fc8e222c1748c7c25300779c7c3dd
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg
deleted file mode 100644
index 70bd08d1b..000000000
--- a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::shell_sort Pages: 1 -->
-<svg width="231pt" height="27pt"
- viewBox="0.00 0.00 230.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>sorting::shell_sort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="93.25,-19.25 0,-19.25 0,0 93.25,0 93.25,-19.25"/>
-<text text-anchor="middle" x="46.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::shell_sort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222.5,-19.25 129.25,-19.25 129.25,0 222.5,0 222.5,-19.25"/>
-<text text-anchor="middle" x="175.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::shell_sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.57,-9.62C101.4,-9.62 109.63,-9.62 117.72,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="117.49,-13.13 127.49,-9.63 117.49,-6.13 117.49,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph_org.svg b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph_org.svg
deleted file mode 100644
index b1bfed0d7..000000000
--- a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::shell_sort Pages: 1 -->
-<svg width="231pt" height="27pt"
- viewBox="0.00 0.00 230.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>sorting::shell_sort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="93.25,-19.25 0,-19.25 0,0 93.25,0 93.25,-19.25"/>
-<text text-anchor="middle" x="46.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::shell_sort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222.5,-19.25 129.25,-19.25 129.25,0 222.5,0 222.5,-19.25"/>
-<text text-anchor="middle" x="175.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::shell_sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.57,-9.62C101.4,-9.62 109.63,-9.62 117.72,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="117.49,-13.13 127.49,-9.63 117.49,-6.13 117.49,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d91/namespacesorting_a5f4bc75cca6dd8294af2d0e328006c68_cgraph.map b/d5/d91/namespacesorting_a5f4bc75cca6dd8294af2d0e328006c68_cgraph.map
deleted file mode 100644
index 3df7b519f..000000000
--- a/d5/d91/namespacesorting_a5f4bc75cca6dd8294af2d0e328006c68_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="sorting::insertionSort_binsrch" name="sorting::insertionSort_binsrch">
-<area shape="rect" id="Node000001" title="Insertion sort function to sort the vector." alt="" coords="5,47,147,88"/>
-<area shape="rect" id="Node000002" href="$d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd" title="Binary search function to find the most suitable pace for an element." alt="" coords="195,29,344,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="147,56,179,51,180,57,148,61"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="212,79,327,104"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="148,74,197,80,196,85,147,79"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="237,30,231,21,234,11,248,5,269,3,293,5,305,12,303,17,292,10,269,8,249,10,238,15,236,20,241,27"/>
-</map>
diff --git a/d5/d91/namespacesorting_a5f4bc75cca6dd8294af2d0e328006c68_cgraph.md5 b/d5/d91/namespacesorting_a5f4bc75cca6dd8294af2d0e328006c68_cgraph.md5
deleted file mode 100644
index ff0f4f7b4..000000000
--- a/d5/d91/namespacesorting_a5f4bc75cca6dd8294af2d0e328006c68_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8ca8f55bdfbdc1715c5c6f498368c9ac
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_a5f4bc75cca6dd8294af2d0e328006c68_cgraph.svg b/d5/d91/namespacesorting_a5f4bc75cca6dd8294af2d0e328006c68_cgraph.svg
deleted file mode 100644
index 6dbf7e04f..000000000
--- a/d5/d91/namespacesorting_a5f4bc75cca6dd8294af2d0e328006c68_cgraph.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::insertionSort_binsrch Pages: 1 -->
-<svg width="262pt" height="82pt"
- viewBox="0.00 0.00 262.00 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>sorting::insertionSort_binsrch</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Insertion sort function to sort the vector.">
-<polygon fill="#999999" stroke="#666666" points="106,-42.88 0,-42.88 0,-12.37 106,-12.37 106,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
-<text text-anchor="middle" x="53" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_binsrch</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd" target="_top" xlink:title="Binary search function to find the most suitable pace for an element.">
-<polygon fill="white" stroke="#666666" points="254,-56.25 142,-56.25 142,-37 254,-37 254,-56.25"/>
-<text text-anchor="middle" x="198" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::binary_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.44,-34.59C114.24,-35.63 122.37,-36.71 130.41,-37.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.81,-41.23 140.19,-39.08 130.73,-34.29 129.81,-41.23"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="241.25,-19.25 154.75,-19.25 154.75,0 241.25,0 241.25,-19.25"/>
-<text text-anchor="middle" x="198" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.44,-21.02C118.4,-19.52 131.12,-17.92 143.14,-16.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.41,-19.9 152.9,-15.18 142.54,-12.95 143.41,-19.9"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.3,-56.54C164.94,-65.15 172.51,-74.25 198,-74.25 212.34,-74.25 221,-71.37 224,-67.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.42,-66.52 221.14,-57.99 220.72,-68.57 227.42,-66.52"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d91/namespacesorting_a5f4bc75cca6dd8294af2d0e328006c68_cgraph_org.svg b/d5/d91/namespacesorting_a5f4bc75cca6dd8294af2d0e328006c68_cgraph_org.svg
deleted file mode 100644
index 58e5badf6..000000000
--- a/d5/d91/namespacesorting_a5f4bc75cca6dd8294af2d0e328006c68_cgraph_org.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::insertionSort_binsrch Pages: 1 -->
-<svg width="262pt" height="82pt"
- viewBox="0.00 0.00 262.00 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>sorting::insertionSort_binsrch</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Insertion sort function to sort the vector.">
-<polygon fill="#999999" stroke="#666666" points="106,-42.88 0,-42.88 0,-12.37 106,-12.37 106,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
-<text text-anchor="middle" x="53" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_binsrch</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd" target="_top" xlink:title="Binary search function to find the most suitable pace for an element.">
-<polygon fill="white" stroke="#666666" points="254,-56.25 142,-56.25 142,-37 254,-37 254,-56.25"/>
-<text text-anchor="middle" x="198" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::binary_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.44,-34.59C114.24,-35.63 122.37,-36.71 130.41,-37.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.81,-41.23 140.19,-39.08 130.73,-34.29 129.81,-41.23"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="241.25,-19.25 154.75,-19.25 154.75,0 241.25,0 241.25,-19.25"/>
-<text text-anchor="middle" x="198" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.44,-21.02C118.4,-19.52 131.12,-17.92 143.14,-16.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.41,-19.9 152.9,-15.18 142.54,-12.95 143.41,-19.9"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.3,-56.54C164.94,-65.15 172.51,-74.25 198,-74.25 212.34,-74.25 221,-71.37 224,-67.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.42,-66.52 221.14,-57.99 220.72,-68.57 227.42,-66.52"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d91/namespacesorting_a6eb67c2f91c98cf4464f75b5882022de_cgraph.map b/d5/d91/namespacesorting_a6eb67c2f91c98cf4464f75b5882022de_cgraph.map
deleted file mode 100644
index d2cee588c..000000000
--- a/d5/d91/namespacesorting_a6eb67c2f91c98cf4464f75b5882022de_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="sorting::quicksort" name="sorting::quicksort">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,127,55"/>
-<area shape="rect" id="Node000002" href="$d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168" title=" " alt="" coords="175,29,296,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="127,40,159,40,159,45,127,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="207,30,201,21,204,11,216,5,235,3,256,5,267,12,264,16,254,10,235,8,218,10,208,15,206,20,211,28"/>
-</map>
diff --git a/d5/d91/namespacesorting_a6eb67c2f91c98cf4464f75b5882022de_cgraph.md5 b/d5/d91/namespacesorting_a6eb67c2f91c98cf4464f75b5882022de_cgraph.md5
deleted file mode 100644
index bc5a599d1..000000000
--- a/d5/d91/namespacesorting_a6eb67c2f91c98cf4464f75b5882022de_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bb958c6fdbb4348d841fc09cb505a221
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_a6eb67c2f91c98cf4464f75b5882022de_cgraph.svg b/d5/d91/namespacesorting_a6eb67c2f91c98cf4464f75b5882022de_cgraph.svg
deleted file mode 100644
index 7b6018aeb..000000000
--- a/d5/d91/namespacesorting_a6eb67c2f91c98cf4464f75b5882022de_cgraph.svg
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::quicksort Pages: 1 -->
-<svg width="226pt" height="45pt"
- viewBox="0.00 0.00 226.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>sorting::quicksort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="91,-19.25 0,-19.25 0,0 91,0 91,-19.25"/>
-<text text-anchor="middle" x="45.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::quicksort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="218,-19.25 127,-19.25 127,0 218,0 218,-19.25"/>
-<text text-anchor="middle" x="172.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::quicksort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.27,-9.62C99.08,-9.62 107.29,-9.62 115.36,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.1,-13.13 125.1,-9.63 115.1,-6.13 115.1,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.62,-19.54C143.55,-28.15 150.18,-37.25 172.5,-37.25 184.71,-37.25 192.22,-34.53 195.04,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.47,-29.92 192.73,-21.01 191.66,-31.55 198.47,-29.92"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d91/namespacesorting_a6eb67c2f91c98cf4464f75b5882022de_cgraph_org.svg b/d5/d91/namespacesorting_a6eb67c2f91c98cf4464f75b5882022de_cgraph_org.svg
deleted file mode 100644
index 3fb39cc84..000000000
--- a/d5/d91/namespacesorting_a6eb67c2f91c98cf4464f75b5882022de_cgraph_org.svg
+++ /dev/null
@@ -1,48 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::quicksort Pages: 1 -->
-<svg width="226pt" height="45pt"
- viewBox="0.00 0.00 226.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>sorting::quicksort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="91,-19.25 0,-19.25 0,0 91,0 91,-19.25"/>
-<text text-anchor="middle" x="45.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::quicksort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="218,-19.25 127,-19.25 127,0 218,0 218,-19.25"/>
-<text text-anchor="middle" x="172.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::quicksort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.27,-9.62C99.08,-9.62 107.29,-9.62 115.36,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.1,-13.13 125.1,-9.63 115.1,-6.13 115.1,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.62,-19.54C143.55,-28.15 150.18,-37.25 172.5,-37.25 184.71,-37.25 192.22,-34.53 195.04,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.47,-29.92 192.73,-21.01 191.66,-31.55 198.47,-29.92"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d91/namespacesorting_a7bfe11bd4703eacd1dab93f25ec639c5_cgraph.map b/d5/d91/namespacesorting_a7bfe11bd4703eacd1dab93f25ec639c5_cgraph.map
deleted file mode 100644
index f4cdd6ce7..000000000
--- a/d5/d91/namespacesorting_a7bfe11bd4703eacd1dab93f25ec639c5_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="sorting::shuffle" name="sorting::shuffle">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,113,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="164,5,236,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="112,31,148,25,149,30,113,36"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="161,55,239,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="113,50,146,56,145,61,113,55"/>
-</map>
diff --git a/d5/d91/namespacesorting_a7bfe11bd4703eacd1dab93f25ec639c5_cgraph.md5 b/d5/d91/namespacesorting_a7bfe11bd4703eacd1dab93f25ec639c5_cgraph.md5
deleted file mode 100644
index 28ff311a3..000000000
--- a/d5/d91/namespacesorting_a7bfe11bd4703eacd1dab93f25ec639c5_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2c26ed1e2386202b5b2eea35cc22c3bb
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_a7bfe11bd4703eacd1dab93f25ec639c5_cgraph.svg b/d5/d91/namespacesorting_a7bfe11bd4703eacd1dab93f25ec639c5_cgraph.svg
deleted file mode 100644
index 94ad2ada8..000000000
--- a/d5/d91/namespacesorting_a7bfe11bd4703eacd1dab93f25ec639c5_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::shuffle Pages: 1 -->
-<svg width="183pt" height="64pt"
- viewBox="0.00 0.00 183.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>sorting::shuffle</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="80.5,-37.25 0,-37.25 0,-18 80.5,-18 80.5,-37.25"/>
-<text text-anchor="middle" x="40.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173,-56.25 118.75,-56.25 118.75,-37 173,-37 173,-56.25"/>
-<text text-anchor="middle" x="145.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.72,-34.86C89.37,-36.45 98.51,-38.12 107.09,-39.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.4,-43.13 116.87,-41.49 107.66,-36.24 106.4,-43.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="175.25,-19.25 116.5,-19.25 116.5,0 175.25,0 175.25,-19.25"/>
-<text text-anchor="middle" x="145.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.72,-20.77C88.64,-19.39 96.96,-17.95 104.9,-16.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.4,-20.03 114.65,-14.87 104.2,-13.14 105.4,-20.03"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d91/namespacesorting_a7bfe11bd4703eacd1dab93f25ec639c5_cgraph_org.svg b/d5/d91/namespacesorting_a7bfe11bd4703eacd1dab93f25ec639c5_cgraph_org.svg
deleted file mode 100644
index 0cb122231..000000000
--- a/d5/d91/namespacesorting_a7bfe11bd4703eacd1dab93f25ec639c5_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::shuffle Pages: 1 -->
-<svg width="183pt" height="64pt"
- viewBox="0.00 0.00 183.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>sorting::shuffle</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="80.5,-37.25 0,-37.25 0,-18 80.5,-18 80.5,-37.25"/>
-<text text-anchor="middle" x="40.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173,-56.25 118.75,-56.25 118.75,-37 173,-37 173,-56.25"/>
-<text text-anchor="middle" x="145.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.72,-34.86C89.37,-36.45 98.51,-38.12 107.09,-39.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.4,-43.13 116.87,-41.49 107.66,-36.24 106.4,-43.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="175.25,-19.25 116.5,-19.25 116.5,0 175.25,0 175.25,-19.25"/>
-<text text-anchor="middle" x="145.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.72,-20.77C88.64,-19.39 96.96,-17.95 104.9,-16.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.4,-20.03 114.65,-14.87 104.2,-13.14 105.4,-20.03"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d91/namespacesorting_a8fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph.map b/d5/d91/namespacesorting_a8fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph.map
deleted file mode 100644
index c3aa69f63..000000000
--- a/d5/d91/namespacesorting_a8fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="sorting::insertionSort" name="sorting::insertionSort">
-<area shape="rect" id="Node000001" title="Insertion Sort for a vector." alt="" coords="5,5,147,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="195,5,310,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="147,16,179,16,179,21,147,21"/>
-</map>
diff --git a/d5/d91/namespacesorting_a8fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph.md5 b/d5/d91/namespacesorting_a8fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph.md5
deleted file mode 100644
index 280a03f96..000000000
--- a/d5/d91/namespacesorting_a8fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-394b5988b23c8fbc6684260818f4267c
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_a8fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph.svg b/d5/d91/namespacesorting_a8fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph.svg
deleted file mode 100644
index 0732a70c3..000000000
--- a/d5/d91/namespacesorting_a8fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::insertionSort Pages: 1 -->
-<svg width="237pt" height="27pt"
- viewBox="0.00 0.00 236.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>sorting::insertionSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Insertion Sort for a vector.">
-<polygon fill="#999999" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
-<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.5,-19.25 142,-19.25 142,0 228.5,0 228.5,-19.25"/>
-<text text-anchor="middle" x="185.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.23,-9.62C114.12,-9.62 122.28,-9.62 130.21,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.1,-13.13 140.1,-9.63 130.1,-6.13 130.1,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d91/namespacesorting_a8fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph_org.svg b/d5/d91/namespacesorting_a8fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph_org.svg
deleted file mode 100644
index 57c71ab80..000000000
--- a/d5/d91/namespacesorting_a8fe6bac9e03f58abcc2ce26ef3de1b5f_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::insertionSort Pages: 1 -->
-<svg width="237pt" height="27pt"
- viewBox="0.00 0.00 236.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>sorting::insertionSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Insertion Sort for a vector.">
-<polygon fill="#999999" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
-<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.5,-19.25 142,-19.25 142,0 228.5,0 228.5,-19.25"/>
-<text text-anchor="middle" x="185.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.23,-9.62C114.12,-9.62 122.28,-9.62 130.21,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.1,-13.13 140.1,-9.63 130.1,-6.13 130.1,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d91/namespacesorting_a9f59fe72dacc1f1218ef3c303d843168_cgraph.map b/d5/d91/namespacesorting_a9f59fe72dacc1f1218ef3c303d843168_cgraph.map
deleted file mode 100644
index 38eff22dd..000000000
--- a/d5/d91/namespacesorting_a9f59fe72dacc1f1218ef3c303d843168_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="sorting::quicksort" name="sorting::quicksort">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,127,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,30,41,21,43,11,52,5,66,3,81,5,89,12,86,16,79,10,66,8,54,10,47,14,46,20,49,28"/>
-</map>
diff --git a/d5/d91/namespacesorting_a9f59fe72dacc1f1218ef3c303d843168_cgraph.md5 b/d5/d91/namespacesorting_a9f59fe72dacc1f1218ef3c303d843168_cgraph.md5
deleted file mode 100644
index df244d3b0..000000000
--- a/d5/d91/namespacesorting_a9f59fe72dacc1f1218ef3c303d843168_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-72cec18d098ff6e9f3c3d7b4482cdf6e
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_a9f59fe72dacc1f1218ef3c303d843168_cgraph.svg b/d5/d91/namespacesorting_a9f59fe72dacc1f1218ef3c303d843168_cgraph.svg
deleted file mode 100644
index d4241f2ad..000000000
--- a/d5/d91/namespacesorting_a9f59fe72dacc1f1218ef3c303d843168_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::quicksort Pages: 1 -->
-<svg width="99pt" height="45pt"
- viewBox="0.00 0.00 99.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>sorting::quicksort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="91,-19.25 0,-19.25 0,0 91,0 91,-19.25"/>
-<text text-anchor="middle" x="45.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::quicksort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.25,-19.54C24.76,-28.15 29.5,-37.25 45.5,-37.25 54.25,-37.25 59.63,-34.53 61.65,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.14,-30.29 60,-21.03 58.24,-31.48 65.14,-30.29"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d91/namespacesorting_a9f59fe72dacc1f1218ef3c303d843168_cgraph_org.svg b/d5/d91/namespacesorting_a9f59fe72dacc1f1218ef3c303d843168_cgraph_org.svg
deleted file mode 100644
index f0b0d7cb5..000000000
--- a/d5/d91/namespacesorting_a9f59fe72dacc1f1218ef3c303d843168_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::quicksort Pages: 1 -->
-<svg width="99pt" height="45pt"
- viewBox="0.00 0.00 99.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>sorting::quicksort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="91,-19.25 0,-19.25 0,0 91,0 91,-19.25"/>
-<text text-anchor="middle" x="45.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::quicksort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.25,-19.54C24.76,-28.15 29.5,-37.25 45.5,-37.25 54.25,-37.25 59.63,-34.53 61.65,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.14,-30.29 60,-21.03 58.24,-31.48 65.14,-30.29"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d91/namespacesorting_aa26de383227859210f14dcf12201a079_cgraph.map b/d5/d91/namespacesorting_aa26de383227859210f14dcf12201a079_cgraph.map
deleted file mode 100644
index 1689921e8..000000000
--- a/d5/d91/namespacesorting_aa26de383227859210f14dcf12201a079_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="sorting::merge" name="sorting::merge">
-<area shape="rect" id="Node000001" title="merges 2 sorted adjacent segments into a larger sorted segment" alt="" coords="5,5,110,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="158,5,237,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="110,16,142,16,142,21,110,21"/>
-</map>
diff --git a/d5/d91/namespacesorting_aa26de383227859210f14dcf12201a079_cgraph.md5 b/d5/d91/namespacesorting_aa26de383227859210f14dcf12201a079_cgraph.md5
deleted file mode 100644
index 2cc262741..000000000
--- a/d5/d91/namespacesorting_aa26de383227859210f14dcf12201a079_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2b54499845ce678838597869b31fee63
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_aa26de383227859210f14dcf12201a079_cgraph.svg b/d5/d91/namespacesorting_aa26de383227859210f14dcf12201a079_cgraph.svg
deleted file mode 100644
index faccb5d64..000000000
--- a/d5/d91/namespacesorting_aa26de383227859210f14dcf12201a079_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::merge Pages: 1 -->
-<svg width="182pt" height="27pt"
- viewBox="0.00 0.00 181.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>sorting::merge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="merges 2 sorted adjacent segments into a larger sorted segment">
-<polygon fill="#999999" stroke="#666666" points="78.25,-19.25 0,-19.25 0,0 78.25,0 78.25,-19.25"/>
-<text text-anchor="middle" x="39.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173.75,-19.25 114.25,-19.25 114.25,0 173.75,0 173.75,-19.25"/>
-<text text-anchor="middle" x="144" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M78.72,-9.62C86.45,-9.62 94.58,-9.62 102.37,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.32,-13.13 112.32,-9.63 102.32,-6.13 102.32,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d91/namespacesorting_aa26de383227859210f14dcf12201a079_cgraph_org.svg b/d5/d91/namespacesorting_aa26de383227859210f14dcf12201a079_cgraph_org.svg
deleted file mode 100644
index 522eef85f..000000000
--- a/d5/d91/namespacesorting_aa26de383227859210f14dcf12201a079_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::merge Pages: 1 -->
-<svg width="182pt" height="27pt"
- viewBox="0.00 0.00 181.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>sorting::merge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="merges 2 sorted adjacent segments into a larger sorted segment">
-<polygon fill="#999999" stroke="#666666" points="78.25,-19.25 0,-19.25 0,0 78.25,0 78.25,-19.25"/>
-<text text-anchor="middle" x="39.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173.75,-19.25 114.25,-19.25 114.25,0 173.75,0 173.75,-19.25"/>
-<text text-anchor="middle" x="144" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M78.72,-9.62C86.45,-9.62 94.58,-9.62 102.37,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.32,-13.13 112.32,-9.63 102.32,-6.13 102.32,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d91/namespacesorting_aa3677f87b5b4756bc77e9e34c5f27935_cgraph.map b/d5/d91/namespacesorting_aa3677f87b5b4756bc77e9e34c5f27935_cgraph.map
deleted file mode 100644
index d083f6677..000000000
--- a/d5/d91/namespacesorting_aa3677f87b5b4756bc77e9e34c5f27935_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="sorting::gnomeSort" name="sorting::gnomeSort">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,137,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="185,5,263,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="137,16,169,16,169,21,137,21"/>
-</map>
diff --git a/d5/d91/namespacesorting_aa3677f87b5b4756bc77e9e34c5f27935_cgraph.md5 b/d5/d91/namespacesorting_aa3677f87b5b4756bc77e9e34c5f27935_cgraph.md5
deleted file mode 100644
index 7f80ba3df..000000000
--- a/d5/d91/namespacesorting_aa3677f87b5b4756bc77e9e34c5f27935_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-66291278c4e363df7acc7f8268ee6cb5
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_aa3677f87b5b4756bc77e9e34c5f27935_cgraph.svg b/d5/d91/namespacesorting_aa3677f87b5b4756bc77e9e34c5f27935_cgraph.svg
deleted file mode 100644
index 35625231a..000000000
--- a/d5/d91/namespacesorting_aa3677f87b5b4756bc77e9e34c5f27935_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::gnomeSort Pages: 1 -->
-<svg width="201pt" height="27pt"
- viewBox="0.00 0.00 201.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>sorting::gnomeSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-19.25 0,-19.25 0,0 98.5,0 98.5,-19.25"/>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::gnomeSort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.25,-19.25 134.5,-19.25 134.5,0 193.25,0 193.25,-19.25"/>
-<text text-anchor="middle" x="163.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.99,-9.62C106.97,-9.62 115.15,-9.62 122.88,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.67,-13.13 132.67,-9.63 122.67,-6.13 122.67,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d91/namespacesorting_aa3677f87b5b4756bc77e9e34c5f27935_cgraph_org.svg b/d5/d91/namespacesorting_aa3677f87b5b4756bc77e9e34c5f27935_cgraph_org.svg
deleted file mode 100644
index e3570cb3b..000000000
--- a/d5/d91/namespacesorting_aa3677f87b5b4756bc77e9e34c5f27935_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::gnomeSort Pages: 1 -->
-<svg width="201pt" height="27pt"
- viewBox="0.00 0.00 201.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>sorting::gnomeSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-19.25 0,-19.25 0,0 98.5,0 98.5,-19.25"/>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::gnomeSort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.25,-19.25 134.5,-19.25 134.5,0 193.25,0 193.25,-19.25"/>
-<text text-anchor="middle" x="163.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.99,-9.62C106.97,-9.62 115.15,-9.62 122.88,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.67,-13.13 132.67,-9.63 122.67,-6.13 122.67,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.map b/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.map
deleted file mode 100644
index f99841a95..000000000
--- a/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="sorting::partition" name="sorting::partition">
-<area shape="rect" id="Node000001" title="The partition function sorts the array from start to end and uses the last element as the pivot." alt="" coords="5,5,120,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="168,5,246,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="120,16,152,16,152,21,120,21"/>
-</map>
diff --git a/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.md5 b/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.md5
deleted file mode 100644
index 99907722e..000000000
--- a/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f199f7b9b09e1c37660325651551806f
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.svg b/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.svg
deleted file mode 100644
index ff2284828..000000000
--- a/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::partition Pages: 1 -->
-<svg width="189pt" height="27pt"
- viewBox="0.00 0.00 188.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>sorting::partition</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The partition function sorts the array from start to end and uses the last element as the pivot.">
-<polygon fill="#999999" stroke="#666666" points="85.75,-19.25 0,-19.25 0,0 85.75,0 85.75,-19.25"/>
-<text text-anchor="middle" x="42.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::partition</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="180.5,-19.25 121.75,-19.25 121.75,0 180.5,0 180.5,-19.25"/>
-<text text-anchor="middle" x="151.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.17,-9.62C94.01,-9.62 102.18,-9.62 109.95,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="109.84,-13.13 119.84,-9.63 109.84,-6.13 109.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph_org.svg b/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph_org.svg
deleted file mode 100644
index 7f08aa96a..000000000
--- a/d5/d91/namespacesorting_aac8f44b28b4aa96444383030b28f8b34_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::partition Pages: 1 -->
-<svg width="189pt" height="27pt"
- viewBox="0.00 0.00 188.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>sorting::partition</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The partition function sorts the array from start to end and uses the last element as the pivot.">
-<polygon fill="#999999" stroke="#666666" points="85.75,-19.25 0,-19.25 0,0 85.75,0 85.75,-19.25"/>
-<text text-anchor="middle" x="42.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::partition</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="180.5,-19.25 121.75,-19.25 121.75,0 180.5,0 180.5,-19.25"/>
-<text text-anchor="middle" x="151.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.17,-9.62C94.01,-9.62 102.18,-9.62 109.95,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="109.84,-13.13 119.84,-9.63 109.84,-6.13 109.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d91/namespacesorting_ae3a775d99dbbb94c130a973df0cfddcf_cgraph.map b/d5/d91/namespacesorting_ae3a775d99dbbb94c130a973df0cfddcf_cgraph.map
deleted file mode 100644
index 903e11e23..000000000
--- a/d5/d91/namespacesorting_ae3a775d99dbbb94c130a973df0cfddcf_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="sorting::recursive_bubble_sort" name="sorting::recursive_bubble_sort">
-<area shape="rect" id="Node000001" title="This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is t..." alt="" coords="5,29,127,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="37,29,36,20,40,11,51,5,66,3,83,5,92,12,89,16,81,10,66,8,52,10,44,14,41,20,42,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="175,37,253,62"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="127,47,159,47,159,52,127,52"/>
-</map>
diff --git a/d5/d91/namespacesorting_ae3a775d99dbbb94c130a973df0cfddcf_cgraph.md5 b/d5/d91/namespacesorting_ae3a775d99dbbb94c130a973df0cfddcf_cgraph.md5
deleted file mode 100644
index 2cb2f6496..000000000
--- a/d5/d91/namespacesorting_ae3a775d99dbbb94c130a973df0cfddcf_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f2124b990b16b9f6bc1b893fa3eea5a2
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_ae3a775d99dbbb94c130a973df0cfddcf_cgraph.svg b/d5/d91/namespacesorting_ae3a775d99dbbb94c130a973df0cfddcf_cgraph.svg
deleted file mode 100644
index c5cd71ecf..000000000
--- a/d5/d91/namespacesorting_ae3a775d99dbbb94c130a973df0cfddcf_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::recursive_bubble_sort Pages: 1 -->
-<svg width="194pt" height="57pt"
- viewBox="0.00 0.00 193.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>sorting::recursive_bubble_sort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is t...">
-<polygon fill="#999999" stroke="#666666" points="91,-30.5 0,-30.5 0,0 91,0 91,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::recursive</text>
-<text text-anchor="middle" x="45.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_bubble_sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.85,-30.99C21.84,-40.06 28.39,-48.5 45.5,-48.5 54.86,-48.5 61.05,-45.97 64.09,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.56,-42.78 65.01,-32.49 60.59,-42.12 67.56,-42.78"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="185.75,-24.88 127,-24.88 127,-5.63 185.75,-5.63 185.75,-24.88"/>
-<text text-anchor="middle" x="156.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.41,-15.25C99.35,-15.25 107.56,-15.25 115.35,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.24,-18.75 125.24,-15.25 115.24,-11.75 115.24,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d91/namespacesorting_ae3a775d99dbbb94c130a973df0cfddcf_cgraph_org.svg b/d5/d91/namespacesorting_ae3a775d99dbbb94c130a973df0cfddcf_cgraph_org.svg
deleted file mode 100644
index 4cb7b53b3..000000000
--- a/d5/d91/namespacesorting_ae3a775d99dbbb94c130a973df0cfddcf_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::recursive_bubble_sort Pages: 1 -->
-<svg width="194pt" height="57pt"
- viewBox="0.00 0.00 193.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>sorting::recursive_bubble_sort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This is an implementation of the recursive_bubble_sort. A vector is passed to the function which is t...">
-<polygon fill="#999999" stroke="#666666" points="91,-30.5 0,-30.5 0,0 91,0 91,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::recursive</text>
-<text text-anchor="middle" x="45.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_bubble_sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.85,-30.99C21.84,-40.06 28.39,-48.5 45.5,-48.5 54.86,-48.5 61.05,-45.97 64.09,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.56,-42.78 65.01,-32.49 60.59,-42.12 67.56,-42.78"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="185.75,-24.88 127,-24.88 127,-5.63 185.75,-5.63 185.75,-24.88"/>
-<text text-anchor="middle" x="156.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.41,-15.25C99.35,-15.25 107.56,-15.25 115.35,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.24,-18.75 125.24,-15.25 115.24,-11.75 115.24,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.map b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.map
deleted file mode 100644
index 25f7a4538..000000000
--- a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="sorting::non_recursive_merge_sort" name="sorting::non_recursive_merge_sort">
-<area shape="rect" id="Node000001" title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order" alt="" coords="5,5,155,46"/>
-<area shape="rect" id="Node000002" href="$d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420" title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order" alt="" coords="203,5,352,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,23,187,23,187,28,155,28"/>
-<area shape="rect" id="Node000003" href="$d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079" title="merges 2 sorted adjacent segments into a larger sorted segment" alt="" coords="400,13,504,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="352,23,384,23,384,28,352,28"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="552,13,632,38"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="505,23,536,23,536,28,505,28"/>
-</map>
diff --git a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.md5 b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.md5
deleted file mode 100644
index 27c02640c..000000000
--- a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a19f33b868f3b01e094268cfb88500b5
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg
deleted file mode 100644
index 736fcade2..000000000
--- a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::non_recursive_merge_sort Pages: 1 -->
-<svg width="478pt" height="39pt"
- viewBox="0.00 0.00 477.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>sorting::non_recursive_merge_sort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order">
-<polygon fill="#999999" stroke="#666666" points="112,-30.5 0,-30.5 0,0 112,0 112,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::non_recursive</text>
-<text text-anchor="middle" x="56" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_merge_sort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420" target="_top" xlink:title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order">
-<polygon fill="white" stroke="#666666" points="260,-30.5 148,-30.5 148,0 260,0 260,-30.5"/>
-<text text-anchor="start" x="156" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::non_recursive</text>
-<text text-anchor="middle" x="204" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_merge_sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.2,-15.25C120.1,-15.25 128.3,-15.25 136.39,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.21,-18.75 146.21,-15.25 136.21,-11.75 136.21,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079" target="_top" xlink:title="merges 2 sorted adjacent segments into a larger sorted segment">
-<polygon fill="white" stroke="#666666" points="374.25,-24.88 296,-24.88 296,-5.63 374.25,-5.63 374.25,-24.88"/>
-<text text-anchor="middle" x="335.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.14,-15.25C268.15,-15.25 276.36,-15.25 284.26,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.04,-18.75 294.04,-15.25 284.04,-11.75 284.04,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="469.75,-24.88 410.25,-24.88 410.25,-5.63 469.75,-5.63 469.75,-24.88"/>
-<text text-anchor="middle" x="440" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M374.72,-15.25C382.45,-15.25 390.58,-15.25 398.37,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="398.32,-18.75 408.32,-15.25 398.32,-11.75 398.32,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph_org.svg b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph_org.svg
deleted file mode 100644
index 05ac41455..000000000
--- a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph_org.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::non_recursive_merge_sort Pages: 1 -->
-<svg width="478pt" height="39pt"
- viewBox="0.00 0.00 477.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>sorting::non_recursive_merge_sort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order">
-<polygon fill="#999999" stroke="#666666" points="112,-30.5 0,-30.5 0,0 112,0 112,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::non_recursive</text>
-<text text-anchor="middle" x="56" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_merge_sort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420" target="_top" xlink:title="bottom&#45;up merge sort which sorts elements in a non&#45;decreasing order">
-<polygon fill="white" stroke="#666666" points="260,-30.5 148,-30.5 148,0 260,0 260,-30.5"/>
-<text text-anchor="start" x="156" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::non_recursive</text>
-<text text-anchor="middle" x="204" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_merge_sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.2,-15.25C120.1,-15.25 128.3,-15.25 136.39,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.21,-18.75 146.21,-15.25 136.21,-11.75 136.21,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079" target="_top" xlink:title="merges 2 sorted adjacent segments into a larger sorted segment">
-<polygon fill="white" stroke="#666666" points="374.25,-24.88 296,-24.88 296,-5.63 374.25,-5.63 374.25,-24.88"/>
-<text text-anchor="middle" x="335.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.14,-15.25C268.15,-15.25 276.36,-15.25 284.26,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.04,-18.75 294.04,-15.25 284.04,-11.75 284.04,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="469.75,-24.88 410.25,-24.88 410.25,-5.63 469.75,-5.63 469.75,-24.88"/>
-<text text-anchor="middle" x="440" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M374.72,-15.25C382.45,-15.25 390.58,-15.25 398.37,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="398.32,-18.75 408.32,-15.25 398.32,-11.75 398.32,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.map b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.map
deleted file mode 100644
index aa62acd95..000000000
--- a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="sorting::shell_sort" name="sorting::shell_sort">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,130,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/data.html#" title=" " alt="" coords="182,5,298,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="114,51,177,33,178,38,116,57"/>
-<area shape="rect" id="Node000003" href="$d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa" title=" " alt="" coords="178,55,302,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="130,65,162,65,162,70,130,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="182,104,298,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="116,78,178,97,177,102,114,84"/>
-</map>
diff --git a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5 b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5
deleted file mode 100644
index c952f3ff0..000000000
--- a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f728685de3c74cdc83b5b85362c1427c
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg
deleted file mode 100644
index ad70d399f..000000000
--- a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::shell_sort Pages: 1 -->
-<svg width="231pt" height="101pt"
- viewBox="0.00 0.00 230.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>sorting::shell_sort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="93.25,-56.25 0,-56.25 0,-37 93.25,-37 93.25,-56.25"/>
-<text text-anchor="middle" x="46.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::shell_sort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/data.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.5,-93.25 132.25,-93.25 132.25,-74 219.5,-74 219.5,-93.25"/>
-<text text-anchor="middle" x="175.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.4,-56.74C96.84,-60.94 113.81,-65.87 129.24,-70.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.11,-73.67 138.69,-73.1 130.07,-66.95 128.11,-73.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222.5,-56.25 129.25,-56.25 129.25,-37 222.5,-37 222.5,-56.25"/>
-<text text-anchor="middle" x="175.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::shell_sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.57,-46.62C101.4,-46.62 109.63,-46.62 117.72,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="117.49,-50.13 127.49,-46.63 117.49,-43.13 117.49,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.12,-19.25 132.62,-19.25 132.62,0 219.12,0 219.12,-19.25"/>
-<text text-anchor="middle" x="175.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.4,-36.51C96.84,-32.31 113.81,-27.38 129.24,-22.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.07,-26.3 138.69,-20.15 128.11,-19.58 130.07,-26.3"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph_org.svg b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph_org.svg
deleted file mode 100644
index 45ea466ba..000000000
--- a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::shell_sort Pages: 1 -->
-<svg width="231pt" height="101pt"
- viewBox="0.00 0.00 230.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>sorting::shell_sort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="93.25,-56.25 0,-56.25 0,-37 93.25,-37 93.25,-56.25"/>
-<text text-anchor="middle" x="46.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::shell_sort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/data.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.5,-93.25 132.25,-93.25 132.25,-74 219.5,-74 219.5,-93.25"/>
-<text text-anchor="middle" x="175.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.4,-56.74C96.84,-60.94 113.81,-65.87 129.24,-70.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.11,-73.67 138.69,-73.1 130.07,-66.95 128.11,-73.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222.5,-56.25 129.25,-56.25 129.25,-37 222.5,-37 222.5,-56.25"/>
-<text text-anchor="middle" x="175.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::shell_sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.57,-46.62C101.4,-46.62 109.63,-46.62 117.72,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="117.49,-50.13 127.49,-46.63 117.49,-43.13 117.49,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.12,-19.25 132.62,-19.25 132.62,0 219.12,0 219.12,-19.25"/>
-<text text-anchor="middle" x="175.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.4,-36.51C96.84,-32.31 113.81,-27.38 129.24,-22.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.07,-26.3 138.69,-20.15 128.11,-19.58 130.07,-26.3"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d91/namespacesorting_affc6ee160142cd017f8c4b213437d0fd_cgraph.map b/d5/d91/namespacesorting_affc6ee160142cd017f8c4b213437d0fd_cgraph.map
deleted file mode 100644
index e5ffdb7ec..000000000
--- a/d5/d91/namespacesorting_affc6ee160142cd017f8c4b213437d0fd_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="sorting::randomized_bogosort" name="sorting::randomized_bogosort">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,72,141,113"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/begin.html#" title=" " alt="" coords="189,5,304,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="120,70,188,40,198,35,200,40,190,45,122,74"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/end.html#" title=" " alt="" coords="194,55,299,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="141,80,178,75,178,80,142,86"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="196,104,296,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="142,100,181,105,180,110,141,105"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/random_shuffle.html#" title=" " alt="" coords="203,153,290,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="124,111,190,140,200,144,198,149,188,145,122,116"/>
-</map>
diff --git a/d5/d91/namespacesorting_affc6ee160142cd017f8c4b213437d0fd_cgraph.md5 b/d5/d91/namespacesorting_affc6ee160142cd017f8c4b213437d0fd_cgraph.md5
deleted file mode 100644
index 2d5bbd5ad..000000000
--- a/d5/d91/namespacesorting_affc6ee160142cd017f8c4b213437d0fd_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-02a1f133375f430cea6cc95537f936be
\ No newline at end of file
diff --git a/d5/d91/namespacesorting_affc6ee160142cd017f8c4b213437d0fd_cgraph.svg b/d5/d91/namespacesorting_affc6ee160142cd017f8c4b213437d0fd_cgraph.svg
deleted file mode 100644
index 35a304e19..000000000
--- a/d5/d91/namespacesorting_affc6ee160142cd017f8c4b213437d0fd_cgraph.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::randomized_bogosort Pages: 1 -->
-<svg width="232pt" height="138pt"
- viewBox="0.00 0.00 232.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>sorting::randomized_bogosort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="101.5,-79.88 0,-79.88 0,-49.38 101.5,-49.38 101.5,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::randomized</text>
-<text text-anchor="middle" x="50.75" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">_bogosort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-130.25 137.5,-130.25 137.5,-111 224,-111 224,-130.25"/>
-<text text-anchor="middle" x="180.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.75,-80.27C102.27,-87.17 120.77,-95.36 137.5,-102.62 140.12,-103.77 142.84,-104.94 145.58,-106.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.08,-109.28 154.65,-110 146.83,-102.85 144.08,-109.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-93.25 141.25,-93.25 141.25,-74 220.25,-74 220.25,-93.25"/>
-<text text-anchor="middle" x="180.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.97,-72.08C111.03,-73.42 120.48,-74.83 129.54,-76.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.85,-79.61 139.26,-77.61 129.88,-72.68 128.85,-79.61"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="218.38,-56.25 143.12,-56.25 143.12,-37 218.38,-37 218.38,-56.25"/>
-<text text-anchor="middle" x="180.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.97,-57.56C111.74,-56.19 121.95,-54.75 131.65,-53.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.82,-56.9 141.24,-52.04 130.85,-49.97 131.82,-56.9"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="213.12,-19.25 148.38,-19.25 148.38,0 213.12,0 213.12,-19.25"/>
-<text text-anchor="middle" x="180.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.03,-48.93C103.3,-42.33 121.26,-34.59 137.5,-27.62 140.13,-26.5 142.85,-25.33 145.59,-24.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.84,-27.43 154.66,-20.29 144.09,-21 146.84,-27.43"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d91/namespacesorting_affc6ee160142cd017f8c4b213437d0fd_cgraph_org.svg b/d5/d91/namespacesorting_affc6ee160142cd017f8c4b213437d0fd_cgraph_org.svg
deleted file mode 100644
index 4c49c9aa0..000000000
--- a/d5/d91/namespacesorting_affc6ee160142cd017f8c4b213437d0fd_cgraph_org.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::randomized_bogosort Pages: 1 -->
-<svg width="232pt" height="138pt"
- viewBox="0.00 0.00 232.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>sorting::randomized_bogosort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="101.5,-79.88 0,-79.88 0,-49.38 101.5,-49.38 101.5,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::randomized</text>
-<text text-anchor="middle" x="50.75" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">_bogosort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-130.25 137.5,-130.25 137.5,-111 224,-111 224,-130.25"/>
-<text text-anchor="middle" x="180.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.75,-80.27C102.27,-87.17 120.77,-95.36 137.5,-102.62 140.12,-103.77 142.84,-104.94 145.58,-106.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.08,-109.28 154.65,-110 146.83,-102.85 144.08,-109.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-93.25 141.25,-93.25 141.25,-74 220.25,-74 220.25,-93.25"/>
-<text text-anchor="middle" x="180.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.97,-72.08C111.03,-73.42 120.48,-74.83 129.54,-76.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.85,-79.61 139.26,-77.61 129.88,-72.68 128.85,-79.61"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="218.38,-56.25 143.12,-56.25 143.12,-37 218.38,-37 218.38,-56.25"/>
-<text text-anchor="middle" x="180.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.97,-57.56C111.74,-56.19 121.95,-54.75 131.65,-53.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.82,-56.9 141.24,-52.04 130.85,-49.97 131.82,-56.9"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="213.12,-19.25 148.38,-19.25 148.38,0 213.12,0 213.12,-19.25"/>
-<text text-anchor="middle" x="180.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.03,-48.93C103.3,-42.33 121.26,-34.59 137.5,-27.62 140.13,-26.5 142.85,-25.33 145.59,-24.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.84,-27.43 154.66,-20.29 144.09,-21 146.84,-27.43"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap.html b/d5/d95/structdata__structures_1_1treap_1_1_treap.html
index b0c53b8ea..d15547a38 100644
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap.html
+++ b/d5/d95/structdata__structures_1_1treap_1_1_treap.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::treap::Treap Struct Reference</title>
+<title>TheAlgorithms/C++: data_structures::treap::Treap Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -164,31 +181,31 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a3081969b2714a8101f7df28b1ce5ed2c" id="r_a3081969b2714a8101f7df28b1ce5ed2c"><td class="memItemLeft" align="right" valign="top"><a id="a3081969b2714a8101f7df28b1ce5ed2c" name="a3081969b2714a8101f7df28b1ce5ed2c"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>root</b> = 0</td></tr>
-<tr class="memdesc:a3081969b2714a8101f7df28b1ce5ed2c"><td class="mdescLeft">&#160;</td><td class="mdescRight">root of the treap <br /></td></tr>
+<tr class="memitem:a3081969b2714a8101f7df28b1ce5ed2c" id="r_a3081969b2714a8101f7df28b1ce5ed2c"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3081969b2714a8101f7df28b1ce5ed2c">root</a> = 0</td></tr>
+<tr class="memdesc:a3081969b2714a8101f7df28b1ce5ed2c"><td class="mdescLeft">&#160;</td><td class="mdescRight">root of the treap  <br /></td></tr>
 <tr class="separator:a3081969b2714a8101f7df28b1ce5ed2c"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a1ab082fe0aa95a238bbbc68ab6a72425" id="r_a1ab082fe0aa95a238bbbc68ab6a72425"><td class="memItemLeft" align="right" valign="top"><a id="a1ab082fe0aa95a238bbbc68ab6a72425" name="a1ab082fe0aa95a238bbbc68ab6a72425"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>treapCnt</b> = 0</td></tr>
-<tr class="memdesc:a1ab082fe0aa95a238bbbc68ab6a72425"><td class="mdescLeft">&#160;</td><td class="mdescRight">Total number of current nodes in the treap. <br /></td></tr>
+<tr class="memitem:a1ab082fe0aa95a238bbbc68ab6a72425" id="r_a1ab082fe0aa95a238bbbc68ab6a72425"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1ab082fe0aa95a238bbbc68ab6a72425">treapCnt</a> = 0</td></tr>
+<tr class="memdesc:a1ab082fe0aa95a238bbbc68ab6a72425"><td class="mdescLeft">&#160;</td><td class="mdescRight">Total number of current nodes in the treap.  <br /></td></tr>
 <tr class="separator:a1ab082fe0aa95a238bbbc68ab6a72425"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a32db3ba3b2630943faacd27b2ecd1b04" id="r_a32db3ba3b2630943faacd27b2ecd1b04"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a> = {}</td></tr>
+<tr class="memitem:a32db3ba3b2630943faacd27b2ecd1b04" id="r_a32db3ba3b2630943faacd27b2ecd1b04"><td class="memItemLeft" align="right" valign="top">std::array&lt; int, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a> = {}</td></tr>
 <tr class="memdesc:a32db3ba3b2630943faacd27b2ecd1b04"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../d9/d49/structdata__structures_1_1_node.html">Node</a> identifier.  <br /></td></tr>
 <tr class="separator:a32db3ba3b2630943faacd27b2ecd1b04"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8be70f0a25e53e870e97d8d23968d723" id="r_a8be70f0a25e53e870e97d8d23968d723"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8be70f0a25e53e870e97d8d23968d723">priority</a> = {}</td></tr>
+<tr class="memitem:a8be70f0a25e53e870e97d8d23968d723" id="r_a8be70f0a25e53e870e97d8d23968d723"><td class="memItemLeft" align="right" valign="top">std::array&lt; int, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8be70f0a25e53e870e97d8d23968d723">priority</a> = {}</td></tr>
 <tr class="memdesc:a8be70f0a25e53e870e97d8d23968d723"><td class="mdescLeft">&#160;</td><td class="mdescRight">Random priority.  <br /></td></tr>
 <tr class="separator:a8be70f0a25e53e870e97d8d23968d723"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ab99f68b79e1c4ff0f1cd6f2f0b6a545f" id="r_ab99f68b79e1c4ff0f1cd6f2f0b6a545f"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, 2 &gt;, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a></td></tr>
+<tr class="memitem:ab99f68b79e1c4ff0f1cd6f2f0b6a545f" id="r_ab99f68b79e1c4ff0f1cd6f2f0b6a545f"><td class="memItemLeft" align="right" valign="top">std::array&lt; std::array&lt; int, 2 &gt;, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a></td></tr>
 <tr class="separator:ab99f68b79e1c4ff0f1cd6f2f0b6a545f"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af7e6c6620ab32bc96633d101245fa919" id="r_af7e6c6620ab32bc96633d101245fa919"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af7e6c6620ab32bc96633d101245fa919">cnt</a></td></tr>
+<tr class="memitem:af7e6c6620ab32bc96633d101245fa919" id="r_af7e6c6620ab32bc96633d101245fa919"><td class="memItemLeft" align="right" valign="top">std::array&lt; int, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af7e6c6620ab32bc96633d101245fa919">cnt</a></td></tr>
 <tr class="memdesc:af7e6c6620ab32bc96633d101245fa919"><td class="mdescLeft">&#160;</td><td class="mdescRight">Maintains the subtree size for ranking query.  <br /></td></tr>
 <tr class="separator:af7e6c6620ab32bc96633d101245fa919"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af5f0b8263339485989f8a02ae026114c" id="r_af5f0b8263339485989f8a02ae026114c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af5f0b8263339485989f8a02ae026114c">size</a> = {}</td></tr>
+<tr class="memitem:af5f0b8263339485989f8a02ae026114c" id="r_af5f0b8263339485989f8a02ae026114c"><td class="memItemLeft" align="right" valign="top">std::array&lt; int, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af5f0b8263339485989f8a02ae026114c">size</a> = {}</td></tr>
 <tr class="memdesc:af5f0b8263339485989f8a02ae026114c"><td class="mdescLeft">&#160;</td><td class="mdescRight">The number of copies per node.  <br /></td></tr>
 <tr class="separator:af5f0b8263339485989f8a02ae026114c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Struct representation of the treap. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a5d200493aeaa02a269f6b6deda39a683" name="a5d200493aeaa02a269f6b6deda39a683"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a5d200493aeaa02a269f6b6deda39a683">&#9670;&#160;</a></span>Treap()</h2>
@@ -214,13 +231,15 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>treapCnt</b> = 0</td><
 </div><div class="memdoc">
 
 <p>Initialization. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   55</span>            : <a class="code hl_variable" href="#a1ab082fe0aa95a238bbbc68ab6a72425">treapCnt</a>(1) {</div>
 <div class="line"><span class="lineno">   56</span>        <a class="code hl_variable" href="#a8be70f0a25e53e870e97d8d23968d723">priority</a>[0] = INT32_MAX;</div>
 <div class="line"><span class="lineno">   57</span>        <a class="code hl_variable" href="#af5f0b8263339485989f8a02ae026114c">size</a>[0] = 0;</div>
 <div class="line"><span class="lineno">   58</span>    }</div>
-<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a1ab082fe0aa95a238bbbc68ab6a72425"><div class="ttname"><a href="#a1ab082fe0aa95a238bbbc68ab6a72425">data_structures::treap::Treap::treapCnt</a></div><div class="ttdeci">int treapCnt</div><div class="ttdoc">Total number of current nodes in the treap.</div><div class="ttdef"><b>Definition</b> treap.cpp:42</div></div>
-<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a8be70f0a25e53e870e97d8d23968d723"><div class="ttname"><a href="#a8be70f0a25e53e870e97d8d23968d723">data_structures::treap::Treap::priority</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; priority</div><div class="ttdoc">Random priority.</div><div class="ttdef"><b>Definition</b> treap.cpp:44</div></div>
-<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_af5f0b8263339485989f8a02ae026114c"><div class="ttname"><a href="#af5f0b8263339485989f8a02ae026114c">data_structures::treap::Treap::size</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; size</div><div class="ttdoc">The number of copies per node.</div><div class="ttdef"><b>Definition</b> treap.cpp:51</div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a1ab082fe0aa95a238bbbc68ab6a72425"><div class="ttname"><a href="#a1ab082fe0aa95a238bbbc68ab6a72425">data_structures::treap::Treap::treapCnt</a></div><div class="ttdeci">int treapCnt</div><div class="ttdoc">Total number of current nodes in the treap.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00042">treap.cpp:42</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a8be70f0a25e53e870e97d8d23968d723"><div class="ttname"><a href="#a8be70f0a25e53e870e97d8d23968d723">data_structures::treap::Treap::priority</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; priority</div><div class="ttdoc">Random priority.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00044">treap.cpp:44</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_af5f0b8263339485989f8a02ae026114c"><div class="ttname"><a href="#af5f0b8263339485989f8a02ae026114c">data_structures::treap::Treap::size</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; size</div><div class="ttdoc">The number of copies per node.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00051">treap.cpp:51</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -260,6 +279,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>treapCnt</b> = 0</td><
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00112">112</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  112</span>                               {</div>
 <div class="line"><span class="lineno">  113</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] == k) {</div>
 <div class="line"><span class="lineno">  114</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x] &gt; 1) {</div>
@@ -281,18 +302,13 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>treapCnt</b> = 0</td><
 <div class="line"><span class="lineno">  130</span>        }</div>
 <div class="line"><span class="lineno">  131</span>        <a class="code hl_function" href="#aae9facaede462ad924856c4d707646d7">update</a>(x);</div>
 <div class="line"><span class="lineno">  132</span>    }</div>
-<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a32db3ba3b2630943faacd27b2ecd1b04"><div class="ttname"><a href="#a32db3ba3b2630943faacd27b2ecd1b04">data_structures::treap::Treap::key</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; key</div><div class="ttdoc">Node identifier.</div><div class="ttdef"><b>Definition</b> treap.cpp:43</div></div>
-<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a75a48584a6560de20484fbba6229fd29"><div class="ttname"><a href="#a75a48584a6560de20484fbba6229fd29">data_structures::treap::Treap::rotate</a></div><div class="ttdeci">void rotate(int &amp;x, int t)</div><div class="ttdoc">Rotate without breaking the property of BST.</div><div class="ttdef"><b>Definition</b> treap.cpp:71</div></div>
-<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_aae9facaede462ad924856c4d707646d7"><div class="ttname"><a href="#aae9facaede462ad924856c4d707646d7">data_structures::treap::Treap::update</a></div><div class="ttdeci">void update(int x)</div><div class="ttdoc">Update the subtree size of the node.</div><div class="ttdef"><b>Definition</b> treap.cpp:63</div></div>
-<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ab99f68b79e1c4ff0f1cd6f2f0b6a545f"><div class="ttname"><a href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">data_structures::treap::Treap::childs</a></div><div class="ttdeci">std::array&lt; std::array&lt; int, 2 &gt;, maxNode &gt; childs</div><div class="ttdef"><b>Definition</b> treap.cpp:45</div></div>
-<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_aeb4bb0db68c7c04ef9498c88c3777887"><div class="ttname"><a href="#aeb4bb0db68c7c04ef9498c88c3777887">data_structures::treap::Treap::_erase</a></div><div class="ttdeci">void _erase(int &amp;x, int k)</div><div class="ttdoc">Erase a value from the specified subtree (internal method)</div><div class="ttdef"><b>Definition</b> treap.cpp:112</div></div>
-<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_af7e6c6620ab32bc96633d101245fa919"><div class="ttname"><a href="#af7e6c6620ab32bc96633d101245fa919">data_structures::treap::Treap::cnt</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; cnt</div><div class="ttdoc">Maintains the subtree size for ranking query.</div><div class="ttdef"><b>Definition</b> treap.cpp:49</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.svg" width="552" height="82"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a32db3ba3b2630943faacd27b2ecd1b04"><div class="ttname"><a href="#a32db3ba3b2630943faacd27b2ecd1b04">data_structures::treap::Treap::key</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; key</div><div class="ttdoc">Node identifier.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00043">treap.cpp:43</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a75a48584a6560de20484fbba6229fd29"><div class="ttname"><a href="#a75a48584a6560de20484fbba6229fd29">data_structures::treap::Treap::rotate</a></div><div class="ttdeci">void rotate(int &amp;x, int t)</div><div class="ttdoc">Rotate without breaking the property of BST.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00071">treap.cpp:71</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_aae9facaede462ad924856c4d707646d7"><div class="ttname"><a href="#aae9facaede462ad924856c4d707646d7">data_structures::treap::Treap::update</a></div><div class="ttdeci">void update(int x)</div><div class="ttdoc">Update the subtree size of the node.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00063">treap.cpp:63</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ab99f68b79e1c4ff0f1cd6f2f0b6a545f"><div class="ttname"><a href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">data_structures::treap::Treap::childs</a></div><div class="ttdeci">std::array&lt; std::array&lt; int, 2 &gt;, maxNode &gt; childs</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00045">treap.cpp:45</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_aeb4bb0db68c7c04ef9498c88c3777887"><div class="ttname"><a href="#aeb4bb0db68c7c04ef9498c88c3777887">data_structures::treap::Treap::_erase</a></div><div class="ttdeci">void _erase(int &amp;x, int k)</div><div class="ttdoc">Erase a value from the specified subtree (internal method)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00112">treap.cpp:112</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_af7e6c6620ab32bc96633d101245fa919"><div class="ttname"><a href="#af7e6c6620ab32bc96633d101245fa919">data_structures::treap::Treap::cnt</a></div><div class="ttdeci">std::array&lt; int, maxNode &gt; cnt</div><div class="ttdoc">Maintains the subtree size for ranking query.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00049">treap.cpp:49</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad08520c0617eb8dcfcbfa90d258aa6b2" name="ad08520c0617eb8dcfcbfa90d258aa6b2"></a>
@@ -331,6 +347,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The element ranked number k </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00139">139</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  139</span>                                 {</div>
 <div class="line"><span class="lineno">  140</span>        <span class="keywordflow">if</span> (k &lt;= <a class="code hl_variable" href="#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]]) {</div>
 <div class="line"><span class="lineno">  141</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="#ad08520c0617eb8dcfcbfa90d258aa6b2">_get_k_th</a>(<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0], k);</div>
@@ -341,14 +359,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  146</span>        }</div>
 <div class="line"><span class="lineno">  147</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#ad08520c0617eb8dcfcbfa90d258aa6b2">_get_k_th</a>(<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1], k);</div>
 <div class="line"><span class="lineno">  148</span>    }</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ad08520c0617eb8dcfcbfa90d258aa6b2"><div class="ttname"><a href="#ad08520c0617eb8dcfcbfa90d258aa6b2">data_structures::treap::Treap::_get_k_th</a></div><div class="ttdeci">int _get_k_th(int &amp;x, int k)</div><div class="ttdoc">Find the KTH largest value (internal method)</div><div class="ttdef"><b>Definition</b> treap.cpp:139</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.svg" width="159" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ad08520c0617eb8dcfcbfa90d258aa6b2"><div class="ttname"><a href="#ad08520c0617eb8dcfcbfa90d258aa6b2">data_structures::treap::Treap::_get_k_th</a></div><div class="ttdeci">int _get_k_th(int &amp;x, int k)</div><div class="ttdoc">Find the KTH largest value (internal method)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00139">treap.cpp:139</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a9a77d22f97add119123108211c6655ec" name="a9a77d22f97add119123108211c6655ec"></a>
@@ -387,6 +400,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The rank of element k </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00155">155</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  155</span>                                {</div>
 <div class="line"><span class="lineno">  156</span>        <span class="keywordflow">if</span> (!x) {</div>
 <div class="line"><span class="lineno">  157</span>            <span class="keywordflow">return</span> 0;</div>
@@ -399,13 +414,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  164</span>            <span class="keywordflow">return</span> <a class="code hl_variable" href="#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]] + <a class="code hl_variable" href="#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x] + <a class="code hl_function" href="#a9a77d22f97add119123108211c6655ec">_get_rank</a>(<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1], k);</div>
 <div class="line"><span class="lineno">  165</span>        }</div>
 <div class="line"><span class="lineno">  166</span>    }</div>
-<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a9a77d22f97add119123108211c6655ec"><div class="ttname"><a href="#a9a77d22f97add119123108211c6655ec">data_structures::treap::Treap::_get_rank</a></div><div class="ttdeci">int _get_rank(int x, int k)</div><div class="ttdoc">Query the rank of specified element (internal method)</div><div class="ttdef"><b>Definition</b> treap.cpp:155</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.svg" width="159" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a9a77d22f97add119123108211c6655ec"><div class="ttname"><a href="#a9a77d22f97add119123108211c6655ec">data_structures::treap::Treap::_get_rank</a></div><div class="ttdeci">int _get_rank(int x, int k)</div><div class="ttdoc">Query the rank of specified element (internal method)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00155">treap.cpp:155</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6a023a4f0c42fb8ed5b3368fba1a5f2c" name="a6a023a4f0c42fb8ed5b3368fba1a5f2c"></a>
@@ -443,6 +453,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00085">85</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   85</span>                                {</div>
 <div class="line"><span class="lineno">   86</span>        <span class="keywordflow">if</span> (x) {</div>
 <div class="line"><span class="lineno">   87</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] == k) {</div>
@@ -465,13 +477,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  104</span>        }</div>
 <div class="line"><span class="lineno">  105</span>        <a class="code hl_function" href="#aae9facaede462ad924856c4d707646d7">update</a>(x);</div>
 <div class="line"><span class="lineno">  106</span>    }</div>
-<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a6a023a4f0c42fb8ed5b3368fba1a5f2c"><div class="ttname"><a href="#a6a023a4f0c42fb8ed5b3368fba1a5f2c">data_structures::treap::Treap::_insert</a></div><div class="ttdeci">void _insert(int &amp;x, int k)</div><div class="ttdoc">Insert a value into the specified subtree (internal method)</div><div class="ttdef"><b>Definition</b> treap.cpp:85</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.svg" width="552" height="82"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a6a023a4f0c42fb8ed5b3368fba1a5f2c"><div class="ttname"><a href="#a6a023a4f0c42fb8ed5b3368fba1a5f2c">data_structures::treap::Treap::_insert</a></div><div class="ttdeci">void _insert(int &amp;x, int k)</div><div class="ttdoc">Insert a value into the specified subtree (internal method)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00085">treap.cpp:85</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a9ea2becd904e2e7d22f23a001b444469" name="a9ea2becd904e2e7d22f23a001b444469"></a>
@@ -504,14 +511,11 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">  208</span>{ <a class="code hl_function" href="#aeb4bb0db68c7c04ef9498c88c3777887">_erase</a>(<a class="code hl_variable" href="#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</div>
-<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a3081969b2714a8101f7df28b1ce5ed2c"><div class="ttname"><a href="#a3081969b2714a8101f7df28b1ce5ed2c">data_structures::treap::Treap::root</a></div><div class="ttdeci">int root</div><div class="ttdoc">root of the treap</div><div class="ttdef"><b>Definition</b> treap.cpp:41</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.svg" width="100%" height="361"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00208">208</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  208</span>{ <a class="code hl_function" href="#aeb4bb0db68c7c04ef9498c88c3777887">_erase</a>(<a class="code hl_variable" href="#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</div>
+<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a3081969b2714a8101f7df28b1ce5ed2c"><div class="ttname"><a href="#a3081969b2714a8101f7df28b1ce5ed2c">data_structures::treap::Treap::root</a></div><div class="ttdeci">int root</div><div class="ttdoc">root of the treap</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00041">treap.cpp:41</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ab2db3ad3aecc240011e0c8b8604d2c69" name="ab2db3ad3aecc240011e0c8b8604d2c69"></a>
@@ -545,13 +549,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The element ranked number x </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  214</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#ad08520c0617eb8dcfcbfa90d258aa6b2">_get_k_th</a>(<a class="code hl_variable" href="#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</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="../../d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.svg" width="356" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00214">214</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  214</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#ad08520c0617eb8dcfcbfa90d258aa6b2">_get_k_th</a>(<a class="code hl_variable" href="#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a767b28f9911fc32b8462862be058a4a4" name="a767b28f9911fc32b8462862be058a4a4"></a>
@@ -585,18 +586,19 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The successor </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00188">188</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  188</span>                        {</div>
-<div class="line"><span class="lineno">  189</span>        <span class="keywordtype">int</span> x = <a class="code hl_variable" href="#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a> = -1;</div>
+<div class="line"><span class="lineno">  189</span>        <span class="keywordtype">int</span> x = <a class="code hl_variable" href="#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, next = -1;</div>
 <div class="line"><span class="lineno">  190</span>        <span class="keywordflow">while</span> (x) {</div>
 <div class="line"><span class="lineno">  191</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x] &gt; k) {</div>
-<div class="line"><span class="lineno">  192</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a> = <a class="code hl_variable" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x], x = <a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0];</div>
+<div class="line"><span class="lineno">  192</span>                next = <a class="code hl_variable" href="#a32db3ba3b2630943faacd27b2ecd1b04">key</a>[x], x = <a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0];</div>
 <div class="line"><span class="lineno">  193</span>            } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">  194</span>                x = <a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1];</div>
 <div class="line"><span class="lineno">  195</span>            }</div>
 <div class="line"><span class="lineno">  196</span>        }</div>
-<div class="line"><span class="lineno">  197</span>        <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a>;</div>
+<div class="line"><span class="lineno">  197</span>        <span class="keywordflow">return</span> next;</div>
 <div class="line"><span class="lineno">  198</span>    }</div>
-<div class="ttc" id="anext_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/next.html">std::next</a></div><div class="ttdeci">T next(T... args)</div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -631,6 +633,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The predecessor </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00172">172</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  172</span>                               {</div>
 <div class="line"><span class="lineno">  173</span>        <span class="keywordtype">int</span> x = <a class="code hl_variable" href="#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, pre = -1;</div>
 <div class="line"><span class="lineno">  174</span>        <span class="keywordflow">while</span> (x) {</div>
@@ -676,13 +680,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The rank of element k </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  220</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a9a77d22f97add119123108211c6655ec">_get_rank</a>(<a class="code hl_variable" href="#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</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="../../d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.svg" width="356" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00220">220</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  220</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a9a77d22f97add119123108211c6655ec">_get_rank</a>(<a class="code hl_variable" href="#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5e884d2686aff501ef589b0d1185492f" name="a5e884d2686aff501ef589b0d1185492f"></a>
@@ -715,13 +716,10 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">  203</span>{ <a class="code hl_function" href="#a6a023a4f0c42fb8ed5b3368fba1a5f2c">_insert</a>(<a class="code hl_variable" href="#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.svg" width="100%" height="361"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00203">203</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  203</span>{ <a class="code hl_function" href="#a6a023a4f0c42fb8ed5b3368fba1a5f2c">_insert</a>(<a class="code hl_variable" href="#a3081969b2714a8101f7df28b1ce5ed2c">root</a>, k); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a75a48584a6560de20484fbba6229fd29" name="a75a48584a6560de20484fbba6229fd29"></a>
@@ -759,6 +757,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00071">71</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   71</span>                               {</div>
 <div class="line"><span class="lineno">   72</span>        <span class="keywordtype">int</span> y = <a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][t];</div>
 <div class="line"><span class="lineno">   73</span>        <a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][t] = <a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[y][1 - t];</div>
@@ -768,12 +768,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   77</span>        <a class="code hl_function" href="#aae9facaede462ad924856c4d707646d7">update</a>(y);</div>
 <div class="line"><span class="lineno">   78</span>        x = y;</div>
 <div class="line"><span class="lineno">   79</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.svg" width="356" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aae9facaede462ad924856c4d707646d7" name="aae9facaede462ad924856c4d707646d7"></a>
@@ -806,6 +801,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00063">63</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   63</span>                       {</div>
 <div class="line"><span class="lineno">   64</span>        <a class="code hl_variable" href="#af5f0b8263339485989f8a02ae026114c">size</a>[x] = <a class="code hl_variable" href="#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][0]] + <a class="code hl_variable" href="#af7e6c6620ab32bc96633d101245fa919">cnt</a>[x] + <a class="code hl_variable" href="#af5f0b8263339485989f8a02ae026114c">size</a>[<a class="code hl_variable" href="#ab99f68b79e1c4ff0f1cd6f2f0b6a545f">childs</a>[x][1]];</div>
 <div class="line"><span class="lineno">   65</span>    }</div>
@@ -820,15 +817,17 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;int, 2&gt;, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a>&gt; data_structures::treap::Treap::childs</td>
+          <td class="memname">std::array&lt;std::array&lt;int, 2&gt;, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a>&gt; data_structures::treap::Treap::childs</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <b>Initial value:</b><div class="fragment"><div class="line">= {</div>
 <div class="line">        {}}</div>
 </div><!-- fragment --><p>[i][0] represents the left child of node i, and [i][1] represents the right </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00045">45</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   45</span>                                                 {</div>
-<div class="line"><span class="lineno">   46</span>        {}};  <span class="comment">///&lt; [i][0] represents the</span></div>
+<div class="line"><span class="lineno">   46</span>        {}};  </div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -839,7 +838,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;int, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a>&gt; data_structures::treap::Treap::cnt</td>
+          <td class="memname">std::array&lt;int, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a>&gt; data_structures::treap::Treap::cnt</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -847,7 +846,9 @@ Here is the call graph for this function:</div>
 <div class="line">        {}</div>
 </div><!-- fragment -->
 <p>Maintains the subtree size for ranking query. </p>
-<div class="fragment"><div class="line"><span class="lineno">   50</span>        {};  <span class="comment">///&lt; Maintains the subtree size for ranking query</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00049">49</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   50</span>        {};  </div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -858,13 +859,15 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;int, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a>&gt; data_structures::treap::Treap::key = {}</td>
+          <td class="memname">std::array&lt;int, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a>&gt; data_structures::treap::Treap::key = {}</td>
         </tr>
       </table>
 </div><div class="memdoc">
 
 <p><a class="el" href="../../d9/d49/structdata__structures_1_1_node.html">Node</a> identifier. </p>
-<div class="fragment"><div class="line"><span class="lineno">   43</span>{};       <span class="comment">///&lt; Node identifier</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00043">43</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   43</span>{};       </div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -875,14 +878,34 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;int, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a>&gt; data_structures::treap::Treap::priority = {}</td>
+          <td class="memname">std::array&lt;int, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a>&gt; data_structures::treap::Treap::priority = {}</td>
         </tr>
       </table>
 </div><div class="memdoc">
 
 <p>Random priority. </p>
-<div class="fragment"><div class="line"><span class="lineno">   44</span>{};  <span class="comment">///&lt; Random priority</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   44</span>{};  </div>
 </div><!-- fragment -->
+</div>
+</div>
+<a id="a3081969b2714a8101f7df28b1ce5ed2c" name="a3081969b2714a8101f7df28b1ce5ed2c"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a3081969b2714a8101f7df28b1ce5ed2c">&#9670;&#160;</a></span>root</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int data_structures::treap::Treap::root = 0</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>root of the treap </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
+
 </div>
 </div>
 <a id="af5f0b8263339485989f8a02ae026114c" name="af5f0b8263339485989f8a02ae026114c"></a>
@@ -892,18 +915,38 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;int, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a>&gt; data_structures::treap::Treap::size = {}</td>
+          <td class="memname">std::array&lt;int, <a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a>&gt; data_structures::treap::Treap::size = {}</td>
         </tr>
       </table>
 </div><div class="memdoc">
 
 <p>The number of copies per node. </p>
-<div class="fragment"><div class="line"><span class="lineno">   51</span>{};  <span class="comment">///&lt; The number of copies per node</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00051">51</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   51</span>{};  </div>
 </div><!-- fragment -->
+</div>
+</div>
+<a id="a1ab082fe0aa95a238bbbc68ab6a72425" name="a1ab082fe0aa95a238bbbc68ab6a72425"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a1ab082fe0aa95a238bbbc68ab6a72425">&#9670;&#160;</a></span>treapCnt</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int data_structures::treap::Treap::treapCnt = 0</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Total number of current nodes in the treap. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../d0/dd2/treap_8cpp.html">treap.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.map b/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.map
deleted file mode 100644
index ce0741661..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="data_structures::treap::Treap::insert" name="data_structures::treap::Treap::insert">
-<area shape="rect" id="Node000001" title="Insert element (External method)" alt="" coords="5,35,154,75"/>
-<area shape="rect" id="Node000002" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c" title="Insert a value into the specified subtree (internal method)" alt="" coords="202,35,350,75"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="154,52,186,52,186,58,154,58"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="238,35,237,25,243,16,256,10,276,8,297,10,310,17,308,21,296,16,276,13,257,15,246,20,242,26,244,33"/>
-<area shape="rect" id="Node000003" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29" title="Rotate without breaking the property of BST." alt="" coords="398,5,546,46"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="350,41,382,36,383,42,351,47"/>
-<area shape="rect" id="Node000004" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" title="Update the subtree size of the node." alt="" coords="594,35,743,75"/>
-<area shape="poly" id="edge5_Node000002_Node000004" title=" " alt="" coords="351,54,398,55,546,55,578,55,579,60,546,60,398,60,351,60"/>
-<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="547,34,579,39,578,44,546,39"/>
-</map>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.md5 b/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.md5
deleted file mode 100644
index 392cf015e..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1a46824a3e78caf6cff3506bdeee7918
\ No newline at end of file
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.svg
deleted file mode 100644
index a2761ad54..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph.svg
+++ /dev/null
@@ -1,180 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::treap::Treap::insert Pages: 1 -->
-<!--zoomable 61 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 561;
-var viewHeight = 61;
-var sectionId = 'dynsection-8';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>data_structures::treap::Treap::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Insert element (External method)">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c" target="_top" xlink:title="Insert a value into the specified subtree (internal method)">
-<polygon fill="white" stroke="#666666" points="258.5,-30.5 147.25,-30.5 147.25,0 258.5,0 258.5,-30.5"/>
-<text text-anchor="start" x="155.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="202.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.54,-15.25C119.4,-15.25 127.56,-15.25 135.61,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.37,-18.75 145.37,-15.25 135.37,-11.75 135.37,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.78,-30.99C171.46,-40.06 180.15,-48.5 202.88,-48.5 215.3,-48.5 223.53,-45.97 227.57,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.02,-42.84 228.78,-32.49 224.07,-41.98 231.02,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29" target="_top" xlink:title="Rotate without breaking the property of BST.">
-<polygon fill="white" stroke="#666666" points="405.75,-52.5 294.5,-52.5 294.5,-22 405.75,-22 405.75,-52.5"/>
-<text text-anchor="start" x="302.5" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="350.12" y="-27.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::rotate</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.79,-23.57C266.65,-24.76 274.81,-25.99 282.86,-27.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.23,-30.66 292.64,-28.69 283.28,-23.74 282.23,-30.66"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" target="_top" xlink:title="Update the subtree size of the node.">
-<polygon fill="white" stroke="#666666" points="553,-30.5 441.75,-30.5 441.75,0 553,0 553,-30.5"/>
-<text text-anchor="start" x="449.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="497.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::update</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge5_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge5_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.98,-13.84C270.71,-13.59 283.01,-13.38 294.5,-13.25 343.94,-12.7 356.31,-12.7 405.75,-13.25 413.56,-13.34 421.74,-13.46 429.87,-13.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.68,-17.11 439.75,-13.81 429.82,-10.11 429.68,-17.11"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M406.04,-28.93C413.9,-27.74 422.06,-26.51 430.11,-25.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="430.53,-28.76 439.89,-23.81 429.48,-21.84 430.53,-28.76"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph_org.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph_org.svg
deleted file mode 100644
index 9128c2e05..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a5e884d2686aff501ef589b0d1185492f_cgraph_org.svg
+++ /dev/null
@@ -1,97 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::treap::Treap::insert Pages: 1 -->
-<svg width="561pt" height="61pt"
- viewBox="0.00 0.00 561.00 60.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 56.5)">
-<title>data_structures::treap::Treap::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Insert element (External method)">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c" target="_top" xlink:title="Insert a value into the specified subtree (internal method)">
-<polygon fill="white" stroke="#666666" points="258.5,-30.5 147.25,-30.5 147.25,0 258.5,0 258.5,-30.5"/>
-<text text-anchor="start" x="155.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="202.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.54,-15.25C119.4,-15.25 127.56,-15.25 135.61,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.37,-18.75 145.37,-15.25 135.37,-11.75 135.37,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.78,-30.99C171.46,-40.06 180.15,-48.5 202.88,-48.5 215.3,-48.5 223.53,-45.97 227.57,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.02,-42.84 228.78,-32.49 224.07,-41.98 231.02,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29" target="_top" xlink:title="Rotate without breaking the property of BST.">
-<polygon fill="white" stroke="#666666" points="405.75,-52.5 294.5,-52.5 294.5,-22 405.75,-22 405.75,-52.5"/>
-<text text-anchor="start" x="302.5" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="350.12" y="-27.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::rotate</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.79,-23.57C266.65,-24.76 274.81,-25.99 282.86,-27.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.23,-30.66 292.64,-28.69 283.28,-23.74 282.23,-30.66"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" target="_top" xlink:title="Update the subtree size of the node.">
-<polygon fill="white" stroke="#666666" points="553,-30.5 441.75,-30.5 441.75,0 553,0 553,-30.5"/>
-<text text-anchor="start" x="449.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="497.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::update</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge5_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge5_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.98,-13.84C270.71,-13.59 283.01,-13.38 294.5,-13.25 343.94,-12.7 356.31,-12.7 405.75,-13.25 413.56,-13.34 421.74,-13.46 429.87,-13.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.68,-17.11 439.75,-13.81 429.82,-10.11 429.68,-17.11"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M406.04,-28.93C413.9,-27.74 422.06,-26.51 430.11,-25.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="430.53,-28.76 439.89,-23.81 429.48,-21.84 430.53,-28.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.map b/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.map
deleted file mode 100644
index 3e3666734..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="data_structures::treap::Treap::_insert" name="data_structures::treap::Treap::_insert">
-<area shape="rect" id="Node000001" title="Insert a value into the specified subtree (internal method)" alt="" coords="5,35,154,75"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="42,35,40,25,46,16,60,10,80,8,101,10,114,17,111,21,99,16,79,13,61,15,50,20,46,26,47,33"/>
-<area shape="rect" id="Node000002" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29" title="Rotate without breaking the property of BST." alt="" coords="202,5,350,46"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="154,41,186,36,187,42,154,47"/>
-<area shape="rect" id="Node000003" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" title="Update the subtree size of the node." alt="" coords="398,35,546,75"/>
-<area shape="poly" id="edge4_Node000001_Node000003" title=" " alt="" coords="154,54,202,55,350,55,382,55,382,60,350,60,202,60,154,60"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="351,34,383,39,382,44,350,39"/>
-</map>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.md5 b/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.md5
deleted file mode 100644
index 93e8fc517..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6aea5124890c41a539bab76ffe58184c
\ No newline at end of file
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.svg
deleted file mode 100644
index a3ca476b1..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph.svg
+++ /dev/null
@@ -1,104 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::treap::Treap::_insert Pages: 1 -->
-<svg width="414pt" height="61pt"
- viewBox="0.00 0.00 413.75 60.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 56.5)">
-<title>data_structures::treap::Treap::_insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Insert a value into the specified subtree (internal method)">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.53,-30.99C24.21,-40.06 32.9,-48.5 55.62,-48.5 68.05,-48.5 76.28,-45.97 80.32,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.77,-42.84 81.53,-32.49 76.82,-41.98 83.77,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29" target="_top" xlink:title="Rotate without breaking the property of BST.">
-<polygon fill="white" stroke="#666666" points="258.5,-52.5 147.25,-52.5 147.25,-22 258.5,-22 258.5,-52.5"/>
-<text text-anchor="start" x="155.25" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="202.88" y="-27.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::rotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.54,-23.57C119.4,-24.76 127.56,-25.99 135.61,-27.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.98,-30.66 145.39,-28.69 136.03,-23.74 134.98,-30.66"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" target="_top" xlink:title="Update the subtree size of the node.">
-<polygon fill="white" stroke="#666666" points="405.75,-30.5 294.5,-30.5 294.5,0 405.75,0 405.75,-30.5"/>
-<text text-anchor="start" x="302.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="350.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.73,-13.84C123.46,-13.59 135.76,-13.38 147.25,-13.25 196.69,-12.7 209.06,-12.7 258.5,-13.25 266.31,-13.34 274.49,-13.46 282.62,-13.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.43,-17.11 292.5,-13.81 282.57,-10.11 282.43,-17.11"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.79,-28.93C266.65,-27.74 274.81,-26.51 282.86,-25.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="283.28,-28.76 292.64,-23.81 282.23,-21.84 283.28,-28.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph_org.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph_org.svg
deleted file mode 100644
index 62afdc393..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a6a023a4f0c42fb8ed5b3368fba1a5f2c_cgraph_org.svg
+++ /dev/null
@@ -1,78 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::treap::Treap::_insert Pages: 1 -->
-<svg width="414pt" height="61pt"
- viewBox="0.00 0.00 413.75 60.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 56.5)">
-<title>data_structures::treap::Treap::_insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Insert a value into the specified subtree (internal method)">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.53,-30.99C24.21,-40.06 32.9,-48.5 55.62,-48.5 68.05,-48.5 76.28,-45.97 80.32,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.77,-42.84 81.53,-32.49 76.82,-41.98 83.77,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29" target="_top" xlink:title="Rotate without breaking the property of BST.">
-<polygon fill="white" stroke="#666666" points="258.5,-52.5 147.25,-52.5 147.25,-22 258.5,-22 258.5,-52.5"/>
-<text text-anchor="start" x="155.25" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="202.88" y="-27.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::rotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.54,-23.57C119.4,-24.76 127.56,-25.99 135.61,-27.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.98,-30.66 145.39,-28.69 136.03,-23.74 134.98,-30.66"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" target="_top" xlink:title="Update the subtree size of the node.">
-<polygon fill="white" stroke="#666666" points="405.75,-30.5 294.5,-30.5 294.5,0 405.75,0 405.75,-30.5"/>
-<text text-anchor="start" x="302.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="350.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.73,-13.84C123.46,-13.59 135.76,-13.38 147.25,-13.25 196.69,-12.7 209.06,-12.7 258.5,-13.25 266.31,-13.34 274.49,-13.46 282.62,-13.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.43,-17.11 292.5,-13.81 282.57,-10.11 282.43,-17.11"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.79,-28.93C266.65,-27.74 274.81,-26.51 282.86,-25.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="283.28,-28.76 292.64,-23.81 282.23,-21.84 283.28,-28.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.map b/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.map
deleted file mode 100644
index 1a5f096db..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::treap::Treap::rotate" name="data_structures::treap::Treap::rotate">
-<area shape="rect" id="Node000001" title="Rotate without breaking the property of BST." alt="" coords="5,5,154,46"/>
-<area shape="rect" id="Node000002" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" title="Update the subtree size of the node." alt="" coords="202,5,350,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="154,23,186,23,186,28,154,28"/>
-</map>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.md5 b/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.md5
deleted file mode 100644
index 9befff215..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-141e105b296c4e1d000f3d879236f8f4
\ No newline at end of file
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.svg
deleted file mode 100644
index 13bbe842a..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::treap::Treap::rotate Pages: 1 -->
-<svg width="267pt" height="39pt"
- viewBox="0.00 0.00 266.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::treap::Treap::rotate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Rotate without breaking the property of BST.">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::rotate</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" target="_top" xlink:title="Update the subtree size of the node.">
-<polygon fill="white" stroke="#666666" points="258.5,-30.5 147.25,-30.5 147.25,0 258.5,0 258.5,-30.5"/>
-<text text-anchor="start" x="155.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="202.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.54,-15.25C119.4,-15.25 127.56,-15.25 135.61,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.37,-18.75 145.37,-15.25 135.37,-11.75 135.37,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph_org.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph_org.svg
deleted file mode 100644
index 7ed0caccb..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a75a48584a6560de20484fbba6229fd29_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::treap::Treap::rotate Pages: 1 -->
-<svg width="267pt" height="39pt"
- viewBox="0.00 0.00 266.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::treap::Treap::rotate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Rotate without breaking the property of BST.">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::rotate</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" target="_top" xlink:title="Update the subtree size of the node.">
-<polygon fill="white" stroke="#666666" points="258.5,-30.5 147.25,-30.5 147.25,0 258.5,0 258.5,-30.5"/>
-<text text-anchor="start" x="155.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="202.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.54,-15.25C119.4,-15.25 127.56,-15.25 135.61,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.37,-18.75 145.37,-15.25 135.37,-11.75 135.37,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.map b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.map
deleted file mode 100644
index 3805639ca..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="data_structures::treap::Treap::_get_rank" name="data_structures::treap::Treap::_get_rank">
-<area shape="rect" id="Node000001" title="Query the rank of specified element (internal method)" alt="" coords="5,29,154,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="51,29,49,19,54,11,64,5,80,3,96,5,106,12,103,16,94,10,79,8,66,10,58,14,54,20,56,28"/>
-</map>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.md5 b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.md5
deleted file mode 100644
index e2c6fbed7..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d9b488a761e056d27c66b0767cddacd7
\ No newline at end of file
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.svg
deleted file mode 100644
index b640d9912..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::treap::Treap::_get_rank Pages: 1 -->
-<svg width="119pt" height="57pt"
- viewBox="0.00 0.00 119.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>data_structures::treap::Treap::_get_rank</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Query the rank of specified element (internal method)">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_get_rank</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.91,-30.99C31.89,-40.06 38.46,-48.5 55.62,-48.5 65.01,-48.5 71.23,-45.97 74.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.74,-42.78 75.2,-32.49 70.77,-42.12 77.74,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph_org.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph_org.svg
deleted file mode 100644
index b2b80b26d..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9a77d22f97add119123108211c6655ec_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::treap::Treap::_get_rank Pages: 1 -->
-<svg width="119pt" height="57pt"
- viewBox="0.00 0.00 119.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>data_structures::treap::Treap::_get_rank</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Query the rank of specified element (internal method)">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_get_rank</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.91,-30.99C31.89,-40.06 38.46,-48.5 55.62,-48.5 65.01,-48.5 71.23,-45.97 74.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.74,-42.78 75.2,-32.49 70.77,-42.12 77.74,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.map b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.map
deleted file mode 100644
index be0472e7d..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="data_structures::treap::Treap::erase" name="data_structures::treap::Treap::erase">
-<area shape="rect" id="Node000001" title="Erase element (External method)" alt="" coords="5,35,154,75"/>
-<area shape="rect" id="Node000002" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887" title="Erase a value from the specified subtree (internal method)" alt="" coords="202,35,350,75"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="154,52,186,52,186,58,154,58"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="238,35,237,25,243,16,256,10,276,8,297,10,310,17,308,21,296,16,276,13,257,15,246,20,242,26,244,33"/>
-<area shape="rect" id="Node000003" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29" title="Rotate without breaking the property of BST." alt="" coords="398,5,546,46"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="350,41,382,36,383,42,351,47"/>
-<area shape="rect" id="Node000004" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" title="Update the subtree size of the node." alt="" coords="594,35,743,75"/>
-<area shape="poly" id="edge5_Node000002_Node000004" title=" " alt="" coords="351,54,398,55,546,55,578,55,579,60,546,60,398,60,351,60"/>
-<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="547,34,579,39,578,44,546,39"/>
-</map>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.md5 b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.md5
deleted file mode 100644
index 0d0e17029..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-279d1efdd96b7a5e236640771ec79a21
\ No newline at end of file
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.svg
deleted file mode 100644
index bbff6cc89..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph.svg
+++ /dev/null
@@ -1,180 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::treap::Treap::erase Pages: 1 -->
-<!--zoomable 61 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 561;
-var viewHeight = 61;
-var sectionId = 'dynsection-5';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>data_structures::treap::Treap::erase</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Erase element (External method)">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::erase</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887" target="_top" xlink:title="Erase a value from the specified subtree (internal method)">
-<polygon fill="white" stroke="#666666" points="258.5,-30.5 147.25,-30.5 147.25,0 258.5,0 258.5,-30.5"/>
-<text text-anchor="start" x="155.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="202.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.54,-15.25C119.4,-15.25 127.56,-15.25 135.61,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.37,-18.75 145.37,-15.25 135.37,-11.75 135.37,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.78,-30.99C171.46,-40.06 180.15,-48.5 202.88,-48.5 215.3,-48.5 223.53,-45.97 227.57,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.02,-42.84 228.78,-32.49 224.07,-41.98 231.02,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29" target="_top" xlink:title="Rotate without breaking the property of BST.">
-<polygon fill="white" stroke="#666666" points="405.75,-52.5 294.5,-52.5 294.5,-22 405.75,-22 405.75,-52.5"/>
-<text text-anchor="start" x="302.5" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="350.12" y="-27.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::rotate</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.79,-23.57C266.65,-24.76 274.81,-25.99 282.86,-27.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.23,-30.66 292.64,-28.69 283.28,-23.74 282.23,-30.66"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" target="_top" xlink:title="Update the subtree size of the node.">
-<polygon fill="white" stroke="#666666" points="553,-30.5 441.75,-30.5 441.75,0 553,0 553,-30.5"/>
-<text text-anchor="start" x="449.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="497.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::update</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge5_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge5_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.98,-13.84C270.71,-13.59 283.01,-13.38 294.5,-13.25 343.94,-12.7 356.31,-12.7 405.75,-13.25 413.56,-13.34 421.74,-13.46 429.87,-13.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.68,-17.11 439.75,-13.81 429.82,-10.11 429.68,-17.11"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M406.04,-28.93C413.9,-27.74 422.06,-26.51 430.11,-25.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="430.53,-28.76 439.89,-23.81 429.48,-21.84 430.53,-28.76"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph_org.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph_org.svg
deleted file mode 100644
index a03a50591..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_a9ea2becd904e2e7d22f23a001b444469_cgraph_org.svg
+++ /dev/null
@@ -1,97 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::treap::Treap::erase Pages: 1 -->
-<svg width="561pt" height="61pt"
- viewBox="0.00 0.00 561.00 60.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 56.5)">
-<title>data_structures::treap::Treap::erase</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Erase element (External method)">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::erase</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887" target="_top" xlink:title="Erase a value from the specified subtree (internal method)">
-<polygon fill="white" stroke="#666666" points="258.5,-30.5 147.25,-30.5 147.25,0 258.5,0 258.5,-30.5"/>
-<text text-anchor="start" x="155.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="202.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.54,-15.25C119.4,-15.25 127.56,-15.25 135.61,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.37,-18.75 145.37,-15.25 135.37,-11.75 135.37,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.78,-30.99C171.46,-40.06 180.15,-48.5 202.88,-48.5 215.3,-48.5 223.53,-45.97 227.57,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.02,-42.84 228.78,-32.49 224.07,-41.98 231.02,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29" target="_top" xlink:title="Rotate without breaking the property of BST.">
-<polygon fill="white" stroke="#666666" points="405.75,-52.5 294.5,-52.5 294.5,-22 405.75,-22 405.75,-52.5"/>
-<text text-anchor="start" x="302.5" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="350.12" y="-27.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::rotate</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.79,-23.57C266.65,-24.76 274.81,-25.99 282.86,-27.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.23,-30.66 292.64,-28.69 283.28,-23.74 282.23,-30.66"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" target="_top" xlink:title="Update the subtree size of the node.">
-<polygon fill="white" stroke="#666666" points="553,-30.5 441.75,-30.5 441.75,0 553,0 553,-30.5"/>
-<text text-anchor="start" x="449.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="497.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::update</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge5_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge5_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.98,-13.84C270.71,-13.59 283.01,-13.38 294.5,-13.25 343.94,-12.7 356.31,-12.7 405.75,-13.25 413.56,-13.34 421.74,-13.46 429.87,-13.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.68,-17.11 439.75,-13.81 429.82,-10.11 429.68,-17.11"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M406.04,-28.93C413.9,-27.74 422.06,-26.51 430.11,-25.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="430.53,-28.76 439.89,-23.81 429.48,-21.84 430.53,-28.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.map b/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.map
deleted file mode 100644
index a0b481d0e..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="data_structures::treap::Treap::get_k_th" name="data_structures::treap::Treap::get_k_th">
-<area shape="rect" id="Node000001" title="Get the KTH largest value (External method)" alt="" coords="5,29,154,70"/>
-<area shape="rect" id="Node000002" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2" title="Find the KTH largest value (internal method)" alt="" coords="202,29,350,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="154,47,186,47,186,52,154,52"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="238,29,237,19,243,10,256,5,276,3,297,5,310,11,308,16,296,10,276,8,257,10,246,15,242,20,244,28"/>
-</map>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.md5 b/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.md5
deleted file mode 100644
index 189703414..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2137a5563e5e268f19d3f2b6cfd31946
\ No newline at end of file
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.svg
deleted file mode 100644
index 4b90a5409..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::treap::Treap::get_k_th Pages: 1 -->
-<svg width="267pt" height="57pt"
- viewBox="0.00 0.00 266.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>data_structures::treap::Treap::get_k_th</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get the KTH largest value (External method)">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_k_th</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2" target="_top" xlink:title="Find the KTH largest value (internal method)">
-<polygon fill="white" stroke="#666666" points="258.5,-30.5 147.25,-30.5 147.25,0 258.5,0 258.5,-30.5"/>
-<text text-anchor="start" x="155.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="202.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_get_k_th</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.54,-15.25C119.4,-15.25 127.56,-15.25 135.61,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.37,-18.75 145.37,-15.25 135.37,-11.75 135.37,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.78,-30.99C171.46,-40.06 180.15,-48.5 202.88,-48.5 215.3,-48.5 223.53,-45.97 227.57,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.02,-42.84 228.78,-32.49 224.07,-41.98 231.02,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph_org.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph_org.svg
deleted file mode 100644
index b9724953e..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_ab2db3ad3aecc240011e0c8b8604d2c69_cgraph_org.svg
+++ /dev/null
@@ -1,50 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::treap::Treap::get_k_th Pages: 1 -->
-<svg width="267pt" height="57pt"
- viewBox="0.00 0.00 266.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>data_structures::treap::Treap::get_k_th</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get the KTH largest value (External method)">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_k_th</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2" target="_top" xlink:title="Find the KTH largest value (internal method)">
-<polygon fill="white" stroke="#666666" points="258.5,-30.5 147.25,-30.5 147.25,0 258.5,0 258.5,-30.5"/>
-<text text-anchor="start" x="155.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="202.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_get_k_th</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.54,-15.25C119.4,-15.25 127.56,-15.25 135.61,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.37,-18.75 145.37,-15.25 135.37,-11.75 135.37,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.78,-30.99C171.46,-40.06 180.15,-48.5 202.88,-48.5 215.3,-48.5 223.53,-45.97 227.57,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.02,-42.84 228.78,-32.49 224.07,-41.98 231.02,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.map b/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.map
deleted file mode 100644
index 05670976b..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="data_structures::treap::Treap::get_rank" name="data_structures::treap::Treap::get_rank">
-<area shape="rect" id="Node000001" title="Get the rank of specified element (External method)" alt="" coords="5,29,154,70"/>
-<area shape="rect" id="Node000002" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec" title="Query the rank of specified element (internal method)" alt="" coords="202,29,350,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="154,47,186,47,186,52,154,52"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="238,29,237,19,243,10,256,5,276,3,297,5,310,11,308,16,296,10,276,8,257,10,246,15,242,20,244,28"/>
-</map>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.md5 b/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.md5
deleted file mode 100644
index b9f947382..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4a12fb895227bd3b17723666a4988c25
\ No newline at end of file
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.svg
deleted file mode 100644
index 321a5f2e4..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::treap::Treap::get_rank Pages: 1 -->
-<svg width="267pt" height="57pt"
- viewBox="0.00 0.00 266.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>data_structures::treap::Treap::get_rank</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get the rank of specified element (External method)">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_rank</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec" target="_top" xlink:title="Query the rank of specified element (internal method)">
-<polygon fill="white" stroke="#666666" points="258.5,-30.5 147.25,-30.5 147.25,0 258.5,0 258.5,-30.5"/>
-<text text-anchor="start" x="155.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="202.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_get_rank</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.54,-15.25C119.4,-15.25 127.56,-15.25 135.61,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.37,-18.75 145.37,-15.25 135.37,-11.75 135.37,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.78,-30.99C171.46,-40.06 180.15,-48.5 202.88,-48.5 215.3,-48.5 223.53,-45.97 227.57,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.02,-42.84 228.78,-32.49 224.07,-41.98 231.02,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph_org.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph_org.svg
deleted file mode 100644
index a92e2560b..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_ac94e9d69305940f6d8804031455af039_cgraph_org.svg
+++ /dev/null
@@ -1,50 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::treap::Treap::get_rank Pages: 1 -->
-<svg width="267pt" height="57pt"
- viewBox="0.00 0.00 266.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>data_structures::treap::Treap::get_rank</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get the rank of specified element (External method)">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::get_rank</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec" target="_top" xlink:title="Query the rank of specified element (internal method)">
-<polygon fill="white" stroke="#666666" points="258.5,-30.5 147.25,-30.5 147.25,0 258.5,0 258.5,-30.5"/>
-<text text-anchor="start" x="155.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="202.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_get_rank</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.54,-15.25C119.4,-15.25 127.56,-15.25 135.61,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.37,-18.75 145.37,-15.25 135.37,-11.75 135.37,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.78,-30.99C171.46,-40.06 180.15,-48.5 202.88,-48.5 215.3,-48.5 223.53,-45.97 227.57,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.02,-42.84 228.78,-32.49 224.07,-41.98 231.02,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.map b/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.map
deleted file mode 100644
index f492e5bb1..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="data_structures::treap::Treap::_get_k_th" name="data_structures::treap::Treap::_get_k_th">
-<area shape="rect" id="Node000001" title="Find the KTH largest value (internal method)" alt="" coords="5,29,154,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="51,29,49,19,54,11,64,5,80,3,96,5,106,12,103,16,94,10,79,8,66,10,58,14,54,20,56,28"/>
-</map>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.md5 b/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.md5
deleted file mode 100644
index a9cff07a4..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-701e836f7db03f3519f099c17f8566d0
\ No newline at end of file
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.svg
deleted file mode 100644
index b51527f55..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::treap::Treap::_get_k_th Pages: 1 -->
-<svg width="119pt" height="57pt"
- viewBox="0.00 0.00 119.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>data_structures::treap::Treap::_get_k_th</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Find the KTH largest value (internal method)">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_get_k_th</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.91,-30.99C31.89,-40.06 38.46,-48.5 55.62,-48.5 65.01,-48.5 71.23,-45.97 74.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.74,-42.78 75.2,-32.49 70.77,-42.12 77.74,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph_org.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph_org.svg
deleted file mode 100644
index 5c73efaa9..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_ad08520c0617eb8dcfcbfa90d258aa6b2_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::treap::Treap::_get_k_th Pages: 1 -->
-<svg width="119pt" height="57pt"
- viewBox="0.00 0.00 119.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>data_structures::treap::Treap::_get_k_th</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Find the KTH largest value (internal method)">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_get_k_th</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.91,-30.99C31.89,-40.06 38.46,-48.5 55.62,-48.5 65.01,-48.5 71.23,-45.97 74.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.74,-42.78 75.2,-32.49 70.77,-42.12 77.74,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.map b/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.map
deleted file mode 100644
index 380034923..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="data_structures::treap::Treap::_erase" name="data_structures::treap::Treap::_erase">
-<area shape="rect" id="Node000001" title="Erase a value from the specified subtree (internal method)" alt="" coords="5,35,154,75"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="42,35,40,25,46,16,60,10,80,8,101,10,114,17,111,21,99,16,79,13,61,15,50,20,46,26,47,33"/>
-<area shape="rect" id="Node000002" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29" title="Rotate without breaking the property of BST." alt="" coords="202,5,350,46"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="154,41,186,36,187,42,154,47"/>
-<area shape="rect" id="Node000003" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" title="Update the subtree size of the node." alt="" coords="398,35,546,75"/>
-<area shape="poly" id="edge4_Node000001_Node000003" title=" " alt="" coords="154,54,202,55,350,55,382,55,382,60,350,60,202,60,154,60"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="351,34,383,39,382,44,350,39"/>
-</map>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.md5 b/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.md5
deleted file mode 100644
index 3f6810db4..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-24fe823850a2343f6112b4b25e58dc5d
\ No newline at end of file
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.svg
deleted file mode 100644
index 1a705b0c8..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph.svg
+++ /dev/null
@@ -1,104 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::treap::Treap::_erase Pages: 1 -->
-<svg width="414pt" height="61pt"
- viewBox="0.00 0.00 413.75 60.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 56.5)">
-<title>data_structures::treap::Treap::_erase</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Erase a value from the specified subtree (internal method)">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.53,-30.99C24.21,-40.06 32.9,-48.5 55.62,-48.5 68.05,-48.5 76.28,-45.97 80.32,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.77,-42.84 81.53,-32.49 76.82,-41.98 83.77,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29" target="_top" xlink:title="Rotate without breaking the property of BST.">
-<polygon fill="white" stroke="#666666" points="258.5,-52.5 147.25,-52.5 147.25,-22 258.5,-22 258.5,-52.5"/>
-<text text-anchor="start" x="155.25" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="202.88" y="-27.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::rotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.54,-23.57C119.4,-24.76 127.56,-25.99 135.61,-27.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.98,-30.66 145.39,-28.69 136.03,-23.74 134.98,-30.66"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" target="_top" xlink:title="Update the subtree size of the node.">
-<polygon fill="white" stroke="#666666" points="405.75,-30.5 294.5,-30.5 294.5,0 405.75,0 405.75,-30.5"/>
-<text text-anchor="start" x="302.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="350.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.73,-13.84C123.46,-13.59 135.76,-13.38 147.25,-13.25 196.69,-12.7 209.06,-12.7 258.5,-13.25 266.31,-13.34 274.49,-13.46 282.62,-13.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.43,-17.11 292.5,-13.81 282.57,-10.11 282.43,-17.11"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.79,-28.93C266.65,-27.74 274.81,-26.51 282.86,-25.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="283.28,-28.76 292.64,-23.81 282.23,-21.84 283.28,-28.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph_org.svg b/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph_org.svg
deleted file mode 100644
index 496d0c404..000000000
--- a/d5/d95/structdata__structures_1_1treap_1_1_treap_aeb4bb0db68c7c04ef9498c88c3777887_cgraph_org.svg
+++ /dev/null
@@ -1,78 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::treap::Treap::_erase Pages: 1 -->
-<svg width="414pt" height="61pt"
- viewBox="0.00 0.00 413.75 60.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 56.5)">
-<title>data_structures::treap::Treap::_erase</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Erase a value from the specified subtree (internal method)">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::_erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.53,-30.99C24.21,-40.06 32.9,-48.5 55.62,-48.5 68.05,-48.5 76.28,-45.97 80.32,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.77,-42.84 81.53,-32.49 76.82,-41.98 83.77,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29" target="_top" xlink:title="Rotate without breaking the property of BST.">
-<polygon fill="white" stroke="#666666" points="258.5,-52.5 147.25,-52.5 147.25,-22 258.5,-22 258.5,-52.5"/>
-<text text-anchor="start" x="155.25" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="202.88" y="-27.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::rotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.54,-23.57C119.4,-24.76 127.56,-25.99 135.61,-27.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.98,-30.66 145.39,-28.69 136.03,-23.74 134.98,-30.66"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7" target="_top" xlink:title="Update the subtree size of the node.">
-<polygon fill="white" stroke="#666666" points="405.75,-30.5 294.5,-30.5 294.5,0 405.75,0 405.75,-30.5"/>
-<text text-anchor="start" x="302.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
-<text text-anchor="middle" x="350.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.73,-13.84C123.46,-13.59 135.76,-13.38 147.25,-13.25 196.69,-12.7 209.06,-12.7 258.5,-13.25 266.31,-13.34 274.49,-13.46 282.62,-13.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.43,-17.11 292.5,-13.81 282.57,-10.11 282.43,-17.11"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.79,-28.93C266.65,-27.74 274.81,-26.51 282.86,-25.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="283.28,-28.76 292.64,-23.81 282.23,-21.84 283.28,-28.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d96/md5_8cpp.html b/d5/d96/md5_8cpp.html
index 4694c83c5..31b906ca7 100644
--- a/d5/d96/md5_8cpp.html
+++ b/d5/d96/md5_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: hashing/md5.cpp File Reference</title>
+<title>TheAlgorithms/C++: hashing/md5.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -126,7 +143,9 @@ Include dependency graph for md5.cpp:</div>
 <div class="dyncontent">
 <div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../dd/d0f/md5_8cpp__incl.svg" width="100%" height="383"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
 </div>
-</div><table class="memberdecls">
+</div>
+<p><a href="../../d5/d96/md5_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d0c/namespacehashing.html">hashing</a></td></tr>
@@ -138,7 +157,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:add2bf982d5dd64a45d13cba52c2b371d" id="r_add2bf982d5dd64a45d13cba52c2b371d"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#add2bf982d5dd64a45d13cba52c2b371d">hashing::md5::leftRotate32bits</a> (uint32_t n, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> rotate)</td></tr>
+<tr class="memitem:add2bf982d5dd64a45d13cba52c2b371d" id="r_add2bf982d5dd64a45d13cba52c2b371d"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#add2bf982d5dd64a45d13cba52c2b371d">hashing::md5::leftRotate32bits</a> (uint32_t n, std::size_t rotate)</td></tr>
 <tr class="memdesc:add2bf982d5dd64a45d13cba52c2b371d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Rotates the bits of a 32-bit unsigned integer.  <br /></td></tr>
 <tr class="separator:add2bf982d5dd64a45d13cba52c2b371d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af8e96bde0183c4b0a7ff04668f11e446" id="r_af8e96bde0183c4b0a7ff04668f11e446"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af8e96bde0183c4b0a7ff04668f11e446">hashing::md5::isBigEndian</a> ()</td></tr>
@@ -150,13 +169,13 @@ Functions</h2></td></tr>
 <tr class="memitem:a6be48c1e6e742f9bd329f501d61dcaef" id="r_a6be48c1e6e742f9bd329f501d61dcaef"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6be48c1e6e742f9bd329f501d61dcaef">hashing::md5::toLittleEndian64</a> (uint64_t n)</td></tr>
 <tr class="memdesc:a6be48c1e6e742f9bd329f501d61dcaef"><td class="mdescLeft">&#160;</td><td class="mdescRight">Sets 64-bit integer to little-endian if needed.  <br /></td></tr>
 <tr class="separator:a6be48c1e6e742f9bd329f501d61dcaef"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aaee69c6136a841043f956de32116e348" id="r_aaee69c6136a841043f956de32116e348"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aaee69c6136a841043f956de32116e348">hashing::md5::sig2hex</a> (void *sig)</td></tr>
+<tr class="memitem:aaee69c6136a841043f956de32116e348" id="r_aaee69c6136a841043f956de32116e348"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aaee69c6136a841043f956de32116e348">hashing::md5::sig2hex</a> (void *sig)</td></tr>
 <tr class="memdesc:aaee69c6136a841043f956de32116e348"><td class="mdescLeft">&#160;</td><td class="mdescRight">Transforms the 128-bit <a class="el" href="../../dd/d43/namespace_m_d5.html" title="Functions for the MD5 algorithm implementation.">MD5</a> signature into a 32 char hex string.  <br /></td></tr>
 <tr class="separator:aaee69c6136a841043f956de32116e348"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a5341431cef7fcfc33794326e1deb2425" id="r_a5341431cef7fcfc33794326e1deb2425"><td class="memItemLeft" align="right" valign="top">void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5341431cef7fcfc33794326e1deb2425">hashing::md5::hash_bs</a> (const void *input_bs, uint64_t input_size)</td></tr>
 <tr class="memdesc:a5341431cef7fcfc33794326e1deb2425"><td class="mdescLeft">&#160;</td><td class="mdescRight">The <a class="el" href="../../dd/d43/namespace_m_d5.html" title="Functions for the MD5 algorithm implementation.">MD5</a> algorithm itself, taking in a bytestring.  <br /></td></tr>
 <tr class="separator:a5341431cef7fcfc33794326e1deb2425"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a88705fab5f92adf3427b4cf76ff33edb" id="r_a88705fab5f92adf3427b4cf76ff33edb"><td class="memItemLeft" align="right" valign="top">void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;message)</td></tr>
+<tr class="memitem:a88705fab5f92adf3427b4cf76ff33edb" id="r_a88705fab5f92adf3427b4cf76ff33edb"><td class="memItemLeft" align="right" valign="top">void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a> (const std::string &amp;message)</td></tr>
 <tr class="memdesc:a88705fab5f92adf3427b4cf76ff33edb"><td class="mdescLeft">&#160;</td><td class="mdescRight">Converts the string to bytestring and calls the main algorithm.  <br /></td></tr>
 <tr class="separator:a88705fab5f92adf3427b4cf76ff33edb"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -183,6 +202,8 @@ Algorithm</h3>
 <p>First of all, all values are expected to be in [little endian] (<a href="https://en.wikipedia.org/wiki/Endianness">https://en.wikipedia.org/wiki/Endianness</a>). This is especially important when using part of the bytestring as an integer.</p>
 <p>The first step of the algorithm is to pad the message for its length to be a multiple of 64 (bytes). This is done by first adding 0x80 (10000000) and then only zeroes until the last 8 bytes must be filled, where then the 64 bit size of the input will be added</p>
 <p>Once this is done, the algo breaks down this padded message into 64 bytes chunks. Each chunk is used for one <em>round</em>, a round breaks the chunk into 16 blocks of 4 bytes. During these rounds the algorithm will update its 128 bit state (represented by 4 ints: A,B,C,D) For more precisions on these operations please see the <a href="https://en.wikipedia.org/wiki/MD5#Algorithm" target="_blank">Wikipedia aritcle</a>. The signature given by <a class="el" href="../../dd/d43/namespace_m_d5.html" title="Functions for the MD5 algorithm implementation.">MD5</a> is its 128 bit state once all rounds are done. </p><dl class="section note"><dt>Note</dt><dd>This is a simple implementation for a byte string but some implmenetations can work on bytestream, messages of unknown length. </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d5/d96/md5_8cpp_source.html">md5.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a88705fab5f92adf3427b4cf76ff33edb" name="a88705fab5f92adf3427b4cf76ff33edb"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a88705fab5f92adf3427b4cf76ff33edb">&#9670;&#160;</a></span>hash()</h2>
@@ -193,7 +214,7 @@ Algorithm</h3>
         <tr>
           <td class="memname">void * hashing::md5::hash </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>message</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>message</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -207,17 +228,13 @@ Algorithm</h3>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void* Pointer to the <a class="el" href="../../dd/d43/namespace_m_d5.html" title="Functions for the MD5 algorithm implementation.">MD5</a> signature </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  288</span>                                     {</div>
-<div class="line"><span class="lineno">  289</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="#a5341431cef7fcfc33794326e1deb2425">hash_bs</a>(&amp;message[0], message.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>());</div>
-<div class="line"><span class="lineno">  290</span>}</div>
-<div class="ttc" id="amd5_8cpp_html_a5341431cef7fcfc33794326e1deb2425"><div class="ttname"><a href="#a5341431cef7fcfc33794326e1deb2425">hashing::md5::hash_bs</a></div><div class="ttdeci">void * hash_bs(const void *input_bs, uint64_t input_size)</div><div class="ttdoc">The MD5 algorithm itself, taking in a bytestring.</div><div class="ttdef"><b>Definition</b> md5.cpp:139</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph.svg" width="100%" height="529"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d5/d96/md5_8cpp_source.html#l00288">288</a> of file <a class="el" href="../../d5/d96/md5_8cpp_source.html">md5.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  288</span>                                     {</div>
+<div class="line"><span class="lineno">  289</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="#a5341431cef7fcfc33794326e1deb2425">hash_bs</a>(&amp;message[0], message.size());</div>
+<div class="line"><span class="lineno">  290</span>}</div>
+<div class="ttc" id="amd5_8cpp_html_a5341431cef7fcfc33794326e1deb2425"><div class="ttname"><a href="#a5341431cef7fcfc33794326e1deb2425">hashing::md5::hash_bs</a></div><div class="ttdeci">void * hash_bs(const void *input_bs, uint64_t input_size)</div><div class="ttdoc">The MD5 algorithm itself, taking in a bytestring.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d96/md5_8cpp_source.html#l00139">md5.cpp:139</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5341431cef7fcfc33794326e1deb2425" name="a5341431cef7fcfc33794326e1deb2425"></a>
@@ -252,30 +269,22 @@ Here is the call graph for this function:</div>
 <div class="line"> </div>
 <div class="line"><span class="keywordflow">for</span> i <span class="keywordflow">in</span> range(64):</div>
 <div class="line">    print(floor(2**32 * abs(sin(i+1))))</div>
-</div><!-- fragment --><div class="fragment"><div class="line"><span class="lineno">  139</span>                                                         {</div>
+</div><!-- fragment -->
+<p class="definition">Definition at line <a class="el" href="../../d5/d96/md5_8cpp_source.html#l00139">139</a> of file <a class="el" href="../../d5/d96/md5_8cpp_source.html">md5.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  139</span>                                                         {</div>
 <div class="line"><span class="lineno">  140</span>    <span class="keyword">auto</span>* input = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>uint8_t*<span class="keyword">&gt;</span>(input_bs);</div>
 <div class="line"><span class="lineno">  141</span> </div>
 <div class="line"><span class="lineno">  142</span>    <span class="comment">// Step 0: Initial Data (Those are decided in the MD5 protocol)</span></div>
 <div class="line"><span class="lineno">  143</span>    <span class="comment">// s is the shift used in the leftrotate each round</span></div>
-<div class="line"><span class="lineno">  144</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;uint32_t, 64&gt;</a> s = {</div>
+<div class="line"><span class="lineno">  144</span>    std::array&lt;uint32_t, 64&gt; s = {</div>
 <div class="line"><span class="lineno">  145</span>        7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,</div>
 <div class="line"><span class="lineno">  146</span>        5, 9,  14, 20, 5, 9,  14, 20, 5, 9,  14, 20, 5, 9,  14, 20,</div>
 <div class="line"><span class="lineno">  147</span>        4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,</div>
 <div class="line"><span class="lineno">  148</span>        6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21};</div>
 <div class="line"><span class="lineno">  149</span>    <span class="comment">// K is pseudo-random values used each round</span></div>
 <div class="line"><span class="lineno">  150</span>    <span class="comment">// The values can be obtained by the following python code:</span></div>
-<div class="line"><span class="lineno">  151</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  152</span><span class="comment">    /**</span></div>
-<div class="line"><span class="lineno">  153</span><span class="comment">     * @brief Values of K are pseudo-random and used to &quot;salt&quot; each round</span></div>
-<div class="line"><span class="lineno">  154</span><span class="comment">     * The values can be obtained by the following python code</span></div>
-<div class="line"><span class="lineno">  155</span><span class="comment">     * @code{.py}</span></div>
-<div class="line"><span class="lineno">  156</span><span class="comment">     * from math import floor, sin</span></div>
-<div class="line"><span class="lineno">  157</span><span class="comment">     *</span></div>
-<div class="line"><span class="lineno">  158</span><span class="comment">     * for i in range(64):</span></div>
-<div class="line"><span class="lineno">  159</span><span class="comment">     *     print(floor(2**32 * abs(sin(i+1))))</span></div>
-<div class="line"><span class="lineno">  160</span><span class="comment">     * @endcode</span></div>
-<div class="line"><span class="lineno">  161</span><span class="comment">     */</span></div>
-<div class="line"><span class="lineno">  162</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;uint32_t, 64&gt;</a> K = {</div>
+<div class="line"><span class="lineno">  151</span> </div>
+<div class="line"><span class="lineno">  162</span>    std::array&lt;uint32_t, 64&gt; K = {</div>
 <div class="line"><span class="lineno">  163</span>        3614090360, 3905402710, 606105819,  3250441966, 4118548399, 1200080426,</div>
 <div class="line"><span class="lineno">  164</span>        2821735955, 4249261313, 1770035416, 2336552879, 4294925233, 2304563134,</div>
 <div class="line"><span class="lineno">  165</span>        1804603682, 4254626195, 2792965006, 1236535329, 4129170786, 3225465664,</div>
@@ -305,10 +314,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  189</span>        padded_message_size = input_size + 128 - (input_size % 64);</div>
 <div class="line"><span class="lineno">  190</span>    }</div>
 <div class="line"><span class="lineno">  191</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&lt;uint8_t&gt;</a> padded_message(padded_message_size);</div>
+<div class="line"><span class="lineno">  192</span>    std::vector&lt;uint8_t&gt; padded_message(padded_message_size);</div>
 <div class="line"><span class="lineno">  193</span> </div>
 <div class="line"><span class="lineno">  194</span>    <span class="comment">// Beginning of the padded message is the original message</span></div>
-<div class="line"><span class="lineno">  195</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/copy.html">std::copy</a>(input, input + input_size, padded_message.begin());</div>
+<div class="line"><span class="lineno">  195</span>    std::copy(input, input + input_size, padded_message.begin());</div>
 <div class="line"><span class="lineno">  196</span> </div>
 <div class="line"><span class="lineno">  197</span>    <span class="comment">// Afterwards comes a single 1 bit and then only zeroes</span></div>
 <div class="line"><span class="lineno">  198</span>    padded_message[input_size] = 1 &lt;&lt; 7;  <span class="comment">// 10000000</span></div>
@@ -329,7 +338,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  213</span>    }</div>
 <div class="line"><span class="lineno">  214</span> </div>
 <div class="line"><span class="lineno">  215</span>    <span class="comment">// Already allocate memory for blocks</span></div>
-<div class="line"><span class="lineno">  216</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;uint32_t, 16&gt;</a> blocks{};</div>
+<div class="line"><span class="lineno">  216</span>    std::array&lt;uint32_t, 16&gt; blocks{};</div>
 <div class="line"><span class="lineno">  217</span> </div>
 <div class="line"><span class="lineno">  218</span>    <span class="comment">// Rounds</span></div>
 <div class="line"><span class="lineno">  219</span>    <span class="keywordflow">for</span> (uint64_t chunk = 0; chunk * 64 &lt; padded_message_size; chunk++) {</div>
@@ -396,19 +405,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  280</span> </div>
 <div class="line"><span class="lineno">  281</span>    <span class="keywordflow">return</span> sig;</div>
 <div class="line"><span class="lineno">  282</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:115</div></div>
-<div class="ttc" id="acopy_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/copy.html">std::copy</a></div><div class="ttdeci">T copy(T... args)</div></div>
-<div class="ttc" id="amd5_8cpp_html_a694712c9665051ba52b686387b87a689"><div class="ttname"><a href="#a694712c9665051ba52b686387b87a689">hashing::md5::toLittleEndian32</a></div><div class="ttdeci">uint32_t toLittleEndian32(uint32_t n)</div><div class="ttdoc">Sets 32-bit integer to little-endian if needed.</div><div class="ttdef"><b>Definition</b> md5.cpp:90</div></div>
-<div class="ttc" id="amd5_8cpp_html_a6be48c1e6e742f9bd329f501d61dcaef"><div class="ttname"><a href="#a6be48c1e6e742f9bd329f501d61dcaef">hashing::md5::toLittleEndian64</a></div><div class="ttdeci">uint64_t toLittleEndian64(uint64_t n)</div><div class="ttdoc">Sets 64-bit integer to little-endian if needed.</div><div class="ttdef"><b>Definition</b> md5.cpp:103</div></div>
-<div class="ttc" id="amd5_8cpp_html_add2bf982d5dd64a45d13cba52c2b371d"><div class="ttname"><a href="#add2bf982d5dd64a45d13cba52c2b371d">hashing::md5::leftRotate32bits</a></div><div class="ttdeci">uint32_t leftRotate32bits(uint32_t n, std::size_t rotate)</div><div class="ttdoc">Rotates the bits of a 32-bit unsigned integer.</div><div class="ttdef"><b>Definition</b> md5.cpp:67</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d96/md5_8cpp_a5341431cef7fcfc33794326e1deb2425_cgraph.svg" width="640" height="306"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00115">composite_simpson_rule.cpp:115</a></div></div>
+<div class="ttc" id="amd5_8cpp_html_a694712c9665051ba52b686387b87a689"><div class="ttname"><a href="#a694712c9665051ba52b686387b87a689">hashing::md5::toLittleEndian32</a></div><div class="ttdeci">uint32_t toLittleEndian32(uint32_t n)</div><div class="ttdoc">Sets 32-bit integer to little-endian if needed.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d96/md5_8cpp_source.html#l00090">md5.cpp:90</a></div></div>
+<div class="ttc" id="amd5_8cpp_html_a6be48c1e6e742f9bd329f501d61dcaef"><div class="ttname"><a href="#a6be48c1e6e742f9bd329f501d61dcaef">hashing::md5::toLittleEndian64</a></div><div class="ttdeci">uint64_t toLittleEndian64(uint64_t n)</div><div class="ttdoc">Sets 64-bit integer to little-endian if needed.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d96/md5_8cpp_source.html#l00103">md5.cpp:103</a></div></div>
+<div class="ttc" id="amd5_8cpp_html_add2bf982d5dd64a45d13cba52c2b371d"><div class="ttname"><a href="#add2bf982d5dd64a45d13cba52c2b371d">hashing::md5::leftRotate32bits</a></div><div class="ttdeci">uint32_t leftRotate32bits(uint32_t n, std::size_t rotate)</div><div class="ttdoc">Rotates the bits of a 32-bit unsigned integer.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d96/md5_8cpp_source.html#l00067">md5.cpp:67</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac9e1a11f44135b890dd10a00e73b5661" name="ac9e1a11f44135b890dd10a00e73b5661"></a>
@@ -436,40 +437,31 @@ Here is the call graph for this function:</div>
 
 <p>Puts user in a loop where inputs can be given and <a class="el" href="../../dd/d43/namespace_m_d5.html" title="Functions for the MD5 algorithm implementation.">MD5</a> hash will be computed and printed. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d96/md5_8cpp_source.html#l00352">352</a> of file <a class="el" href="../../d5/d96/md5_8cpp_source.html">md5.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  352</span>                          {</div>
 <div class="line"><span class="lineno">  353</span>    <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
-<div class="line"><span class="lineno">  354</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> input;</div>
-<div class="line"><span class="lineno">  355</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter a message to be hashed (Ctrl-C to exit): &quot;</span></div>
-<div class="line"><span class="lineno">  356</span>                  &lt;&lt; <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">  357</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html">std::getline</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a>, input);</div>
+<div class="line"><span class="lineno">  354</span>        std::string input;</div>
+<div class="line"><span class="lineno">  355</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter a message to be hashed (Ctrl-C to exit): &quot;</span></div>
+<div class="line"><span class="lineno">  356</span>                  &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  357</span>        std::getline(std::cin, input);</div>
 <div class="line"><span class="lineno">  358</span>        <span class="keywordtype">void</span>* sig = <a class="code hl_function" href="#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a>(input);</div>
-<div class="line"><span class="lineno">  359</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hash is: &quot;</span> &lt;&lt; <a class="code hl_function" href="#aaee69c6136a841043f956de32116e348">hashing::md5::sig2hex</a>(sig) &lt;&lt; <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">  359</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Hash is: &quot;</span> &lt;&lt; <a class="code hl_function" href="#aaee69c6136a841043f956de32116e348">hashing::md5::sig2hex</a>(sig) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  360</span> </div>
 <div class="line"><span class="lineno">  361</span>        <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
-<div class="line"><span class="lineno">  362</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Want to enter another message? (y/n) &quot;</span>;</div>
-<div class="line"><span class="lineno">  363</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html">std::getline</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a>, input);</div>
-<div class="line"><span class="lineno">  364</span>            <span class="keywordflow">if</span> (input.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html">compare</a>(<span class="stringliteral">&quot;y&quot;</span>) == 0) {</div>
+<div class="line"><span class="lineno">  362</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Want to enter another message? (y/n) &quot;</span>;</div>
+<div class="line"><span class="lineno">  363</span>            std::getline(std::cin, input);</div>
+<div class="line"><span class="lineno">  364</span>            <span class="keywordflow">if</span> (input.compare(<span class="stringliteral">&quot;y&quot;</span>) == 0) {</div>
 <div class="line"><span class="lineno">  365</span>                <span class="keywordflow">break</span>;</div>
-<div class="line"><span class="lineno">  366</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (input.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html">compare</a>(<span class="stringliteral">&quot;n&quot;</span>) == 0) {</div>
+<div class="line"><span class="lineno">  366</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (input.compare(<span class="stringliteral">&quot;n&quot;</span>) == 0) {</div>
 <div class="line"><span class="lineno">  367</span>                <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  368</span>            }</div>
 <div class="line"><span class="lineno">  369</span>        }</div>
 <div class="line"><span class="lineno">  370</span>    }</div>
 <div class="line"><span class="lineno">  371</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="acompare_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html">std::string::compare</a></div><div class="ttdeci">T compare(T... args)</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="agetline_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html">std::getline</a></div><div class="ttdeci">T getline(T... args)</div></div>
-<div class="ttc" id="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> md5.cpp:288</div></div>
-<div class="ttc" id="amd5_8cpp_html_aaee69c6136a841043f956de32116e348"><div class="ttname"><a href="#aaee69c6136a841043f956de32116e348">hashing::md5::sig2hex</a></div><div class="ttdeci">std::string sig2hex(void *sig)</div><div class="ttdoc">Transforms the 128-bit MD5 signature into a 32 char hex string.</div><div class="ttdef"><b>Definition</b> md5.cpp:123</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d96/md5_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.svg" width="278" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d96/md5_8cpp_source.html#l00288">md5.cpp:288</a></div></div>
+<div class="ttc" id="amd5_8cpp_html_aaee69c6136a841043f956de32116e348"><div class="ttname"><a href="#aaee69c6136a841043f956de32116e348">hashing::md5::sig2hex</a></div><div class="ttdeci">std::string sig2hex(void *sig)</div><div class="ttdoc">Transforms the 128-bit MD5 signature into a 32 char hex string.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d96/md5_8cpp_source.html#l00123">md5.cpp:123</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af8e96bde0183c4b0a7ff04668f11e446" name="af8e96bde0183c4b0a7ff04668f11e446"></a>
@@ -492,20 +484,17 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>true IF integers are detected to work as big-endian </dd>
 <dd>
 false IF integers are detected to work as little-endian </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d96/md5_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../d5/d96/md5_8cpp_source.html">md5.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   77</span>                   {</div>
 <div class="line"><span class="lineno">   78</span>    <span class="keyword">union </span>{</div>
 <div class="line"><span class="lineno">   79</span>        uint32_t i;</div>
-<div class="line"><span class="lineno">   80</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;char, 4&gt;</a> c;</div>
+<div class="line"><span class="lineno">   80</span>        std::array&lt;char, 4&gt; c;</div>
 <div class="line"><span class="lineno">   81</span>    } bint = {0x01020304};</div>
 <div class="line"><span class="lineno">   82</span> </div>
 <div class="line"><span class="lineno">   83</span>    <span class="keywordflow">return</span> bint.c[0] == 1;</div>
 <div class="line"><span class="lineno">   84</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d96/md5_8cpp_af8e96bde0183c4b0a7ff04668f11e446_cgraph.svg" width="187" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="add2bf982d5dd64a45d13cba52c2b371d" name="add2bf982d5dd64a45d13cba52c2b371d"></a>
@@ -522,7 +511,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></td>          <td class="paramname"><span class="paramname"><em>rotate</em></span>&#160;)</td>
+          <td class="paramtype">std::size_t</td>          <td class="paramname"><span class="paramname"><em>rotate</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -536,16 +525,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>uint32_t The rotated integer </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   67</span>                                                        {</div>
-<div class="line"><span class="lineno">   68</span>    <span class="keywordflow">return</span> (n &lt;&lt; rotate) | (n &gt;&gt; (32 - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/rotate.html">rotate</a>));</div>
-<div class="line"><span class="lineno">   69</span>}</div>
-<div class="ttc" id="arotate_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/rotate.html">std::rotate</a></div><div class="ttdeci">T rotate(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d96/md5_8cpp_add2bf982d5dd64a45d13cba52c2b371d_cgraph.svg" width="211" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d5/d96/md5_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../d5/d96/md5_8cpp_source.html">md5.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   67</span>                                                        {</div>
+<div class="line"><span class="lineno">   68</span>    <span class="keywordflow">return</span> (n &lt;&lt; rotate) | (n &gt;&gt; (32 - rotate));</div>
+<div class="line"><span class="lineno">   69</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -565,6 +550,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d96/md5_8cpp_source.html#l00377">377</a> of file <a class="el" href="../../d5/d96/md5_8cpp_source.html">md5.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  377</span>           {</div>
 <div class="line"><span class="lineno">  378</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  379</span> </div>
@@ -573,14 +560,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  382</span>    <a class="code hl_function" href="#ac9e1a11f44135b890dd10a00e73b5661">interactive</a>();</div>
 <div class="line"><span class="lineno">  383</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  384</span>}</div>
-<div class="ttc" id="amd5_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations of well-known MD5 hashes.</div><div class="ttdef"><b>Definition</b> md5.cpp:298</div></div>
-<div class="ttc" id="amd5_8cpp_html_ac9e1a11f44135b890dd10a00e73b5661"><div class="ttname"><a href="#ac9e1a11f44135b890dd10a00e73b5661">interactive</a></div><div class="ttdeci">static void interactive()</div><div class="ttdoc">Puts user in a loop where inputs can be given and MD5 hash will be computed and printed.</div><div class="ttdef"><b>Definition</b> md5.cpp:352</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="375" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amd5_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations of well-known MD5 hashes.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d96/md5_8cpp_source.html#l00298">md5.cpp:298</a></div></div>
+<div class="ttc" id="amd5_8cpp_html_ac9e1a11f44135b890dd10a00e73b5661"><div class="ttname"><a href="#ac9e1a11f44135b890dd10a00e73b5661">interactive</a></div><div class="ttdeci">static void interactive()</div><div class="ttdoc">Puts user in a loop where inputs can be given and MD5 hash will be computed and printed.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d96/md5_8cpp_source.html#l00352">md5.cpp:352</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aaee69c6136a841043f956de32116e348" name="aaee69c6136a841043f956de32116e348"></a>
@@ -590,7 +572,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> hashing::md5::sig2hex </td>
+          <td class="memname">std::string hashing::md5::sig2hex </td>
           <td>(</td>
           <td class="paramtype">void *</td>          <td class="paramname"><span class="paramname"><em>sig</em></span></td><td>)</td>
           <td></td>
@@ -605,24 +587,20 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
-<dl class="section return"><dt>Returns</dt><dd><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> The hex signature </dd></dl>
+<dl class="section return"><dt>Returns</dt><dd>std::string The hex signature </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d96/md5_8cpp_source.html#l00123">123</a> of file <a class="el" href="../../d5/d96/md5_8cpp_source.html">md5.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  123</span>                             {</div>
 <div class="line"><span class="lineno">  124</span>    <span class="keyword">const</span> <span class="keywordtype">char</span>* hexChars = <span class="stringliteral">&quot;0123456789abcdef&quot;</span>;</div>
 <div class="line"><span class="lineno">  125</span>    <span class="keyword">auto</span>* intsig = <span class="keyword">static_cast&lt;</span>uint8_t*<span class="keyword">&gt;</span>(sig);</div>
-<div class="line"><span class="lineno">  126</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/hex.html">hex</a> = <span class="stringliteral">&quot;&quot;</span>;</div>
+<div class="line"><span class="lineno">  126</span>    std::string hex = <span class="stringliteral">&quot;&quot;</span>;</div>
 <div class="line"><span class="lineno">  127</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; 16; i++) {</div>
-<div class="line"><span class="lineno">  128</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/hex.html">hex</a>.push_back(hexChars[(intsig[i] &gt;&gt; 4) &amp; 0xF]);</div>
-<div class="line"><span class="lineno">  129</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/hex.html">hex</a>.push_back(hexChars[(intsig[i]) &amp; 0xF]);</div>
+<div class="line"><span class="lineno">  128</span>        hex.push_back(hexChars[(intsig[i] &gt;&gt; 4) &amp; 0xF]);</div>
+<div class="line"><span class="lineno">  129</span>        hex.push_back(hexChars[(intsig[i]) &amp; 0xF]);</div>
 <div class="line"><span class="lineno">  130</span>    }</div>
-<div class="line"><span class="lineno">  131</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/hex.html">hex</a>;</div>
+<div class="line"><span class="lineno">  131</span>    <span class="keywordflow">return</span> hex;</div>
 <div class="line"><span class="lineno">  132</span>}</div>
-<div class="ttc" id="ahex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/hex.html">std::hex</a></div><div class="ttdeci">T hex(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d96/md5_8cpp_aaee69c6136a841043f956de32116e348_cgraph.svg" width="163" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -650,12 +628,14 @@ Here is the call graph for this function:</div>
 
 <p>Self-test implementations of well-known <a class="el" href="../../dd/d43/namespace_m_d5.html" title="Functions for the MD5 algorithm implementation.">MD5</a> hashes. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d96/md5_8cpp_source.html#l00298">298</a> of file <a class="el" href="../../d5/d96/md5_8cpp_source.html">md5.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  298</span>                   {</div>
 <div class="line"><span class="lineno">  299</span>    <span class="comment">// Hashes empty string and stores signature</span></div>
 <div class="line"><span class="lineno">  300</span>    <span class="keywordtype">void</span>* sig = <a class="code hl_function" href="#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a>(<span class="stringliteral">&quot;&quot;</span>);</div>
-<div class="line"><span class="lineno">  301</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hashing empty string&quot;</span> &lt;&lt; <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">  301</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hashing empty string&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  302</span>    <span class="comment">// Prints signature hex representation</span></div>
-<div class="line"><span class="lineno">  303</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#aaee69c6136a841043f956de32116e348">hashing::md5::sig2hex</a>(sig) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  303</span>    std::cout &lt;&lt; <a class="code hl_function" href="#aaee69c6136a841043f956de32116e348">hashing::md5::sig2hex</a>(sig) &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  304</span>    <span class="comment">// Test with cassert whether sig is correct from the expected value</span></div>
 <div class="line"><span class="lineno">  305</span>    assert(hashing::md5::sig2hex(sig).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
 <div class="line"><span class="lineno">  306</span>               <span class="stringliteral">&quot;d41d8cd98f00b204e9800998ecf8427e&quot;</span>) == 0);</div>
@@ -663,10 +643,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  308</span>    <span class="comment">// Hashes &quot;The quick brown fox jumps over the lazy dog&quot; and stores signature</span></div>
 <div class="line"><span class="lineno">  309</span>    <span class="keywordtype">void</span>* sig2 =</div>
 <div class="line"><span class="lineno">  310</span>        <a class="code hl_function" href="#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a>(<span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog&quot;</span>);</div>
-<div class="line"><span class="lineno">  311</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hashing The quick brown fox jumps over the lazy dog&quot;</span></div>
-<div class="line"><span class="lineno">  312</span>              &lt;&lt; <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">  311</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hashing The quick brown fox jumps over the lazy dog&quot;</span></div>
+<div class="line"><span class="lineno">  312</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  313</span>    <span class="comment">// Prints signature hex representation</span></div>
-<div class="line"><span class="lineno">  314</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#aaee69c6136a841043f956de32116e348">hashing::md5::sig2hex</a>(sig2) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  314</span>    std::cout &lt;&lt; <a class="code hl_function" href="#aaee69c6136a841043f956de32116e348">hashing::md5::sig2hex</a>(sig2) &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  315</span>    <span class="comment">// Test with cassert whether sig is correct from the expected value</span></div>
 <div class="line"><span class="lineno">  316</span>    assert(hashing::md5::sig2hex(sig2).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
 <div class="line"><span class="lineno">  317</span>               <span class="stringliteral">&quot;9e107d9d372bb6826bd81d3542a419d6&quot;</span>) == 0);</div>
@@ -675,11 +655,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  320</span>    <span class="comment">// additional period) and stores signature</span></div>
 <div class="line"><span class="lineno">  321</span>    <span class="keywordtype">void</span>* sig3 =</div>
 <div class="line"><span class="lineno">  322</span>        <a class="code hl_function" href="#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a>(<span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog.&quot;</span>);</div>
-<div class="line"><span class="lineno">  323</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hashing &quot;</span></div>
+<div class="line"><span class="lineno">  323</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hashing &quot;</span></div>
 <div class="line"><span class="lineno">  324</span>                 <span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog.&quot;</span></div>
-<div class="line"><span class="lineno">  325</span>              &lt;&lt; <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">  325</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  326</span>    <span class="comment">// Prints signature hex representation</span></div>
-<div class="line"><span class="lineno">  327</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#aaee69c6136a841043f956de32116e348">hashing::md5::sig2hex</a>(sig3) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  327</span>    std::cout &lt;&lt; <a class="code hl_function" href="#aaee69c6136a841043f956de32116e348">hashing::md5::sig2hex</a>(sig3) &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  328</span>    <span class="comment">// Test with cassert whether sig is correct from the expected value</span></div>
 <div class="line"><span class="lineno">  329</span>    assert(hashing::md5::sig2hex(sig3).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
 <div class="line"><span class="lineno">  330</span>               <span class="stringliteral">&quot;e4d909c290d0fb1ca068ffaddf22cbd0&quot;</span>) == 0);</div>
@@ -688,23 +668,18 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  333</span>    <span class="comment">// and stores signature</span></div>
 <div class="line"><span class="lineno">  334</span>    <span class="keywordtype">void</span>* sig4 = <a class="code hl_function" href="#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a>(</div>
 <div class="line"><span class="lineno">  335</span>        <span class="stringliteral">&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789&quot;</span>);</div>
-<div class="line"><span class="lineno">  336</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div>
+<div class="line"><span class="lineno">  336</span>    std::cout</div>
 <div class="line"><span class="lineno">  337</span>        &lt;&lt; <span class="stringliteral">&quot;Hashing &quot;</span></div>
 <div class="line"><span class="lineno">  338</span>           <span class="stringliteral">&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789&quot;</span></div>
-<div class="line"><span class="lineno">  339</span>        &lt;&lt; <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">  339</span>        &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  340</span>    <span class="comment">// Prints signature hex representation</span></div>
-<div class="line"><span class="lineno">  341</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#aaee69c6136a841043f956de32116e348">hashing::md5::sig2hex</a>(sig4) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  341</span>    std::cout &lt;&lt; <a class="code hl_function" href="#aaee69c6136a841043f956de32116e348">hashing::md5::sig2hex</a>(sig4) &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  342</span>    <span class="comment">// Test with cassert whether sig is correct from the expected value</span></div>
 <div class="line"><span class="lineno">  343</span>    assert(hashing::md5::sig2hex(sig4).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
 <div class="line"><span class="lineno">  344</span>               <span class="stringliteral">&quot;d174ab98d277d9f5a5611c2c9f419d9f&quot;</span>) == 0);</div>
 <div class="line"><span class="lineno">  345</span>}</div>
-<div class="ttc" id="ashell__sort2_8cpp_html_a7eb77daed2cf1513f6d68c47a1c2db1c"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a></div><div class="ttdeci">int compare(const void *a, const void *b)</div><div class="ttdef"><b>Definition</b> shell_sort2.cpp:87</div></div>
-</div><!-- 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="../../d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ashell__sort2_8cpp_html_a7eb77daed2cf1513f6d68c47a1c2db1c"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a></div><div class="ttdeci">int compare(const void *a, const void *b)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d7a/shell__sort2_8cpp_source.html#l00087">shell_sort2.cpp:87</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a694712c9665051ba52b686387b87a689" name="a694712c9665051ba52b686387b87a689"></a>
@@ -730,6 +705,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>uint32_t param n with binary representation as little-endian </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d96/md5_8cpp_source.html#l00090">90</a> of file <a class="el" href="../../d5/d96/md5_8cpp_source.html">md5.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   90</span>                                      {</div>
 <div class="line"><span class="lineno">   91</span>    <span class="keywordflow">if</span> (!<a class="code hl_function" href="#af8e96bde0183c4b0a7ff04668f11e446">isBigEndian</a>()) {</div>
 <div class="line"><span class="lineno">   92</span>        <span class="keywordflow">return</span> ((n &lt;&lt; 24) &amp; 0xFF000000) | ((n &lt;&lt; 8) &amp; 0x00FF0000) |</div>
@@ -738,13 +715,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   95</span>    <span class="comment">// Machine works on little endian, no need to change anything</span></div>
 <div class="line"><span class="lineno">   96</span>    <span class="keywordflow">return</span> n;</div>
 <div class="line"><span class="lineno">   97</span>}</div>
-<div class="ttc" id="amd5_8cpp_html_af8e96bde0183c4b0a7ff04668f11e446"><div class="ttname"><a href="#af8e96bde0183c4b0a7ff04668f11e446">hashing::md5::isBigEndian</a></div><div class="ttdeci">bool isBigEndian()</div><div class="ttdoc">Checks whether integers are stored as big endian or not.</div><div class="ttdef"><b>Definition</b> md5.cpp:77</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d96/md5_8cpp_a694712c9665051ba52b686387b87a689_cgraph.svg" width="436" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amd5_8cpp_html_af8e96bde0183c4b0a7ff04668f11e446"><div class="ttname"><a href="#af8e96bde0183c4b0a7ff04668f11e446">hashing::md5::isBigEndian</a></div><div class="ttdeci">bool isBigEndian()</div><div class="ttdoc">Checks whether integers are stored as big endian or not.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d96/md5_8cpp_source.html#l00077">md5.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6be48c1e6e742f9bd329f501d61dcaef" name="a6be48c1e6e742f9bd329f501d61dcaef"></a>
@@ -770,6 +742,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>uint64_t param n with binary representation as little-endian </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d96/md5_8cpp_source.html#l00103">103</a> of file <a class="el" href="../../d5/d96/md5_8cpp_source.html">md5.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  103</span>                                      {</div>
 <div class="line"><span class="lineno">  104</span>    <span class="keywordflow">if</span> (!<a class="code hl_function" href="#af8e96bde0183c4b0a7ff04668f11e446">isBigEndian</a>()) {</div>
 <div class="line"><span class="lineno">  105</span>        <span class="keywordflow">return</span> ((n &lt;&lt; 56) &amp; 0xFF00000000000000) |</div>
@@ -785,12 +759,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  115</span>    <span class="comment">// Machine works on little endian, no need to change anything</span></div>
 <div class="line"><span class="lineno">  116</span>    <span class="keywordflow">return</span> n;</div>
 <div class="line"><span class="lineno">  117</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d96/md5_8cpp_a6be48c1e6e742f9bd329f501d61dcaef_cgraph.svg" width="436" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d5/d96/md5_8cpp_a5341431cef7fcfc33794326e1deb2425_cgraph.map b/d5/d96/md5_8cpp_a5341431cef7fcfc33794326e1deb2425_cgraph.map
deleted file mode 100644
index de6774bfb..000000000
--- a/d5/d96/md5_8cpp_a5341431cef7fcfc33794326e1deb2425_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="hashing::md5::hash_bs" name="hashing::md5::hash_bs">
-<area shape="rect" id="Node000001" title="The MD5 algorithm itself, taking in a bytestring." alt="" coords="5,128,162,154"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="46,129,39,119,43,110,58,103,84,101,111,104,125,111,123,116,110,109,83,107,60,109,47,113,44,119,50,126"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="249,5,371,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="96,125,143,83,174,60,209,40,233,30,235,35,211,45,177,64,146,87,100,129"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/copy.html#" title=" " alt="" coords="272,55,348,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="114,125,209,89,256,76,258,81,210,94,116,130"/>
-<area shape="rect" id="Node000004" href="$d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d" title="Rotates the bits of a 32&#45;bit unsigned integer." alt="" coords="210,128,410,154"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="162,138,195,138,195,144,162,144"/>
-<area shape="rect" id="Node000005" href="$d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689" title="Sets 32&#45;bit integer to little&#45;endian if needed." alt="" coords="210,201,410,227"/>
-<area shape="poly" id="edge6_Node000001_Node000005" title=" " alt="" coords="127,152,254,193,252,198,125,157"/>
-<area shape="rect" id="Node000007" href="$d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef" title="Sets 64&#45;bit integer to little&#45;endian if needed." alt="" coords="210,275,410,300"/>
-<area shape="poly" id="edge10_Node000001_Node000007" title=" " alt="" coords="101,152,149,192,211,237,264,265,261,270,208,242,145,196,98,156"/>
-<area shape="poly" id="edge5_Node000004_Node000004" title=" " alt="" coords="272,129,265,119,269,110,285,103,310,101,337,104,352,111,349,116,336,109,310,107,286,109,273,113,270,119,276,126"/>
-<area shape="poly" id="edge9_Node000005_Node000005" title=" " alt="" coords="272,203,265,193,269,183,285,177,310,175,337,177,352,184,349,189,336,182,310,180,286,182,273,187,270,192,276,199"/>
-<area shape="rect" id="Node000006" href="$d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446" title="Checks whether integers are stored as big endian or not." alt="" coords="458,239,634,264"/>
-<area shape="poly" id="edge7_Node000005_Node000006" title=" " alt="" coords="396,225,446,233,445,238,395,230"/>
-<area shape="poly" id="edge8_Node000006_Node000006" title=" " alt="" coords="507,240,499,230,504,220,520,214,546,212,575,215,590,221,587,226,574,220,546,217,521,219,508,224,505,229,511,237"/>
-<area shape="poly" id="edge11_Node000007_Node000006" title=" " alt="" coords="398,271,442,265,443,270,399,277"/>
-<area shape="poly" id="edge12_Node000007_Node000007" title=" " alt="" coords="272,276,265,266,269,256,285,250,310,248,337,251,352,258,349,262,336,256,310,253,286,255,273,260,270,265,276,273"/>
-</map>
diff --git a/d5/d96/md5_8cpp_a5341431cef7fcfc33794326e1deb2425_cgraph.md5 b/d5/d96/md5_8cpp_a5341431cef7fcfc33794326e1deb2425_cgraph.md5
deleted file mode 100644
index b198489d6..000000000
--- a/d5/d96/md5_8cpp_a5341431cef7fcfc33794326e1deb2425_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-be7c88e8e21a60bd7dab12b3e2235ac9
\ No newline at end of file
diff --git a/d5/d96/md5_8cpp_a5341431cef7fcfc33794326e1deb2425_cgraph.svg b/d5/d96/md5_8cpp_a5341431cef7fcfc33794326e1deb2425_cgraph.svg
deleted file mode 100644
index 6add760c2..000000000
--- a/d5/d96/md5_8cpp_a5341431cef7fcfc33794326e1deb2425_cgraph.svg
+++ /dev/null
@@ -1,209 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::md5::hash_bs Pages: 1 -->
-<svg width="480pt" height="229pt"
- viewBox="0.00 0.00 479.75 229.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 225.25)">
-<title>hashing::md5::hash_bs</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The MD5 algorithm itself, taking in a bytestring.">
-<polygon fill="#999999" stroke="#666666" points="117.25,-129.25 0,-129.25 0,-110 117.25,-110 117.25,-129.25"/>
-<text text-anchor="middle" x="58.62" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::hash_bs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.05,-129.54C19.93,-138.15 28.79,-147.25 58.62,-147.25 75.41,-147.25 85.56,-144.37 89.06,-140.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.38,-139.2 85.71,-130.96 85.79,-141.56 92.38,-139.2"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.25,-221.25 182.5,-221.25 182.5,-202 274.25,-202 274.25,-221.25"/>
-<text text-anchor="middle" x="228.38" y="-207.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.28,-129.67C85.24,-145.66 118.8,-176.83 153.25,-193.62 159.05,-196.45 165.32,-198.85 171.68,-200.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.36,-204.15 180.93,-203.56 172.3,-197.42 170.36,-204.15"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/copy.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="256.62,-184.25 200.12,-184.25 200.12,-165 256.62,-165 256.62,-184.25"/>
-<text text-anchor="middle" x="228.38" y="-170.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::copy</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.39,-129.65C101.16,-137.66 128.59,-148.8 153.25,-156.62 164.61,-160.23 177.14,-163.53 188.62,-166.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.66,-169.65 198.19,-168.51 189.25,-162.83 187.66,-169.65"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d" target="_top" xlink:title="Rotates the bits of a 32&#45;bit unsigned integer.">
-<polygon fill="white" stroke="#666666" points="303.12,-129.25 153.62,-129.25 153.62,-110 303.12,-110 303.12,-129.25"/>
-<text text-anchor="middle" x="228.38" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::leftRotate32bits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.36,-119.62C125.3,-119.62 133.6,-119.62 141.92,-119.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.73,-123.13 151.73,-119.63 141.73,-116.13 141.73,-123.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689" target="_top" xlink:title="Sets 32&#45;bit integer to little&#45;endian if needed.">
-<polygon fill="white" stroke="#666666" points="303.5,-74.25 153.25,-74.25 153.25,-55 303.5,-55 303.5,-74.25"/>
-<text text-anchor="middle" x="228.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::toLittleEndian32</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.39,-109.54C117.15,-100.77 156.15,-87.98 185.7,-78.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="186.67,-81.65 195.08,-75.21 184.49,-75 186.67,-81.65"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef" target="_top" xlink:title="Sets 64&#45;bit integer to little&#45;endian if needed.">
-<polygon fill="white" stroke="#666666" points="303.5,-19.25 153.25,-19.25 153.25,0 303.5,0 303.5,-19.25"/>
-<text text-anchor="middle" x="228.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::toLittleEndian64</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge10_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge10_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.57,-109.67C87.46,-94.62 121.31,-65.67 153.25,-45.62 165.75,-37.78 180.2,-30.42 193.01,-24.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.29,-27.68 201.93,-20.34 191.38,-21.31 194.29,-27.68"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.8,-129.54C189.68,-138.15 198.54,-147.25 228.38,-147.25 245.16,-147.25 255.31,-144.37 258.81,-140.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.13,-139.2 255.46,-130.96 255.54,-141.56 262.13,-139.2"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge9_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge9_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.8,-74.54C189.68,-83.15 198.54,-92.25 228.38,-92.25 245.16,-92.25 255.31,-89.37 258.81,-85.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.13,-84.2 255.46,-75.96 255.54,-86.56 262.13,-84.2"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446" target="_top" xlink:title="Checks whether integers are stored as big endian or not.">
-<polygon fill="white" stroke="#666666" points="471.75,-46.25 339.5,-46.25 339.5,-27 471.75,-27 471.75,-46.25"/>
-<text text-anchor="middle" x="405.62" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::isBigEndian</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge7_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge7_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.64,-54.52C304.8,-52.57 317.64,-50.52 330.12,-48.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="330.63,-51.99 339.95,-46.96 329.53,-45.08 330.63,-51.99"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge8_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge8_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M377.88,-46.54C365.22,-55.15 374.47,-64.25 405.62,-64.25 423.15,-64.25 433.75,-61.37 437.41,-57.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="440.69,-56.09 433.9,-47.96 434.13,-58.55 440.69,-56.09"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge11_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge11_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M294.63,-19.68C305.39,-21.34 316.64,-23.07 327.65,-24.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.11,-28.22 337.53,-26.29 328.18,-21.31 327.11,-28.22"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge12_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge12_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.8,-19.54C189.68,-28.15 198.54,-37.25 228.38,-37.25 245.16,-37.25 255.31,-34.37 258.81,-30.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.13,-29.2 255.46,-20.96 255.54,-31.56 262.13,-29.2"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d96/md5_8cpp_a5341431cef7fcfc33794326e1deb2425_cgraph_org.svg b/d5/d96/md5_8cpp_a5341431cef7fcfc33794326e1deb2425_cgraph_org.svg
deleted file mode 100644
index 6728b21d7..000000000
--- a/d5/d96/md5_8cpp_a5341431cef7fcfc33794326e1deb2425_cgraph_org.svg
+++ /dev/null
@@ -1,183 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::md5::hash_bs Pages: 1 -->
-<svg width="480pt" height="229pt"
- viewBox="0.00 0.00 479.75 229.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 225.25)">
-<title>hashing::md5::hash_bs</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The MD5 algorithm itself, taking in a bytestring.">
-<polygon fill="#999999" stroke="#666666" points="117.25,-129.25 0,-129.25 0,-110 117.25,-110 117.25,-129.25"/>
-<text text-anchor="middle" x="58.62" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::hash_bs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.05,-129.54C19.93,-138.15 28.79,-147.25 58.62,-147.25 75.41,-147.25 85.56,-144.37 89.06,-140.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.38,-139.2 85.71,-130.96 85.79,-141.56 92.38,-139.2"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.25,-221.25 182.5,-221.25 182.5,-202 274.25,-202 274.25,-221.25"/>
-<text text-anchor="middle" x="228.38" y="-207.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.28,-129.67C85.24,-145.66 118.8,-176.83 153.25,-193.62 159.05,-196.45 165.32,-198.85 171.68,-200.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.36,-204.15 180.93,-203.56 172.3,-197.42 170.36,-204.15"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/copy.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="256.62,-184.25 200.12,-184.25 200.12,-165 256.62,-165 256.62,-184.25"/>
-<text text-anchor="middle" x="228.38" y="-170.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::copy</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.39,-129.65C101.16,-137.66 128.59,-148.8 153.25,-156.62 164.61,-160.23 177.14,-163.53 188.62,-166.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.66,-169.65 198.19,-168.51 189.25,-162.83 187.66,-169.65"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d" target="_top" xlink:title="Rotates the bits of a 32&#45;bit unsigned integer.">
-<polygon fill="white" stroke="#666666" points="303.12,-129.25 153.62,-129.25 153.62,-110 303.12,-110 303.12,-129.25"/>
-<text text-anchor="middle" x="228.38" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::leftRotate32bits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.36,-119.62C125.3,-119.62 133.6,-119.62 141.92,-119.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.73,-123.13 151.73,-119.63 141.73,-116.13 141.73,-123.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689" target="_top" xlink:title="Sets 32&#45;bit integer to little&#45;endian if needed.">
-<polygon fill="white" stroke="#666666" points="303.5,-74.25 153.25,-74.25 153.25,-55 303.5,-55 303.5,-74.25"/>
-<text text-anchor="middle" x="228.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::toLittleEndian32</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.39,-109.54C117.15,-100.77 156.15,-87.98 185.7,-78.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="186.67,-81.65 195.08,-75.21 184.49,-75 186.67,-81.65"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef" target="_top" xlink:title="Sets 64&#45;bit integer to little&#45;endian if needed.">
-<polygon fill="white" stroke="#666666" points="303.5,-19.25 153.25,-19.25 153.25,0 303.5,0 303.5,-19.25"/>
-<text text-anchor="middle" x="228.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::toLittleEndian64</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge10_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge10_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.57,-109.67C87.46,-94.62 121.31,-65.67 153.25,-45.62 165.75,-37.78 180.2,-30.42 193.01,-24.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.29,-27.68 201.93,-20.34 191.38,-21.31 194.29,-27.68"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.8,-129.54C189.68,-138.15 198.54,-147.25 228.38,-147.25 245.16,-147.25 255.31,-144.37 258.81,-140.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.13,-139.2 255.46,-130.96 255.54,-141.56 262.13,-139.2"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge9_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge9_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.8,-74.54C189.68,-83.15 198.54,-92.25 228.38,-92.25 245.16,-92.25 255.31,-89.37 258.81,-85.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.13,-84.2 255.46,-75.96 255.54,-86.56 262.13,-84.2"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446" target="_top" xlink:title="Checks whether integers are stored as big endian or not.">
-<polygon fill="white" stroke="#666666" points="471.75,-46.25 339.5,-46.25 339.5,-27 471.75,-27 471.75,-46.25"/>
-<text text-anchor="middle" x="405.62" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::isBigEndian</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge7_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge7_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.64,-54.52C304.8,-52.57 317.64,-50.52 330.12,-48.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="330.63,-51.99 339.95,-46.96 329.53,-45.08 330.63,-51.99"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge8_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge8_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M377.88,-46.54C365.22,-55.15 374.47,-64.25 405.62,-64.25 423.15,-64.25 433.75,-61.37 437.41,-57.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="440.69,-56.09 433.9,-47.96 434.13,-58.55 440.69,-56.09"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge11_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge11_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M294.63,-19.68C305.39,-21.34 316.64,-23.07 327.65,-24.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.11,-28.22 337.53,-26.29 328.18,-21.31 327.11,-28.22"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge12_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge12_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.8,-19.54C189.68,-28.15 198.54,-37.25 228.38,-37.25 245.16,-37.25 255.31,-34.37 258.81,-30.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.13,-29.2 255.46,-20.96 255.54,-31.56 262.13,-29.2"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d96/md5_8cpp_a694712c9665051ba52b686387b87a689_cgraph.map b/d5/d96/md5_8cpp_a694712c9665051ba52b686387b87a689_cgraph.map
deleted file mode 100644
index 941690f64..000000000
--- a/d5/d96/md5_8cpp_a694712c9665051ba52b686387b87a689_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="hashing::md5::toLittleEndian32" name="hashing::md5::toLittleEndian32">
-<area shape="rect" id="Node000001" title="Sets 32&#45;bit integer to little&#45;endian if needed." alt="" coords="5,29,206,55"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="66,31,59,21,63,11,79,5,106,3,134,5,149,12,147,17,133,11,105,8,80,10,67,15,64,20,71,27"/>
-<area shape="rect" id="Node000002" href="$d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446" title="Checks whether integers are stored as big endian or not." alt="" coords="254,29,430,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="206,40,238,40,238,45,206,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="303,31,295,21,300,11,316,5,342,3,371,5,385,12,383,17,369,11,342,8,317,10,303,15,300,20,307,27"/>
-</map>
diff --git a/d5/d96/md5_8cpp_a694712c9665051ba52b686387b87a689_cgraph.md5 b/d5/d96/md5_8cpp_a694712c9665051ba52b686387b87a689_cgraph.md5
deleted file mode 100644
index f71c7b59e..000000000
--- a/d5/d96/md5_8cpp_a694712c9665051ba52b686387b87a689_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c01d2ab97a454a2b07471ba1a88971e8
\ No newline at end of file
diff --git a/d5/d96/md5_8cpp_a694712c9665051ba52b686387b87a689_cgraph.svg b/d5/d96/md5_8cpp_a694712c9665051ba52b686387b87a689_cgraph.svg
deleted file mode 100644
index 92f2874d4..000000000
--- a/d5/d96/md5_8cpp_a694712c9665051ba52b686387b87a689_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::md5::toLittleEndian32 Pages: 1 -->
-<svg width="327pt" height="45pt"
- viewBox="0.00 0.00 326.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>hashing::md5::toLittleEndian32</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Sets 32&#45;bit integer to little&#45;endian if needed.">
-<polygon fill="#999999" stroke="#666666" points="150.25,-19.25 0,-19.25 0,0 150.25,0 150.25,-19.25"/>
-<text text-anchor="middle" x="75.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::toLittleEndian32</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47.38,-19.54C34.72,-28.15 43.97,-37.25 75.12,-37.25 92.65,-37.25 103.25,-34.37 106.91,-30.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.19,-29.09 103.4,-20.96 103.63,-31.55 110.19,-29.09"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446" target="_top" xlink:title="Checks whether integers are stored as big endian or not.">
-<polygon fill="white" stroke="#666666" points="318.5,-19.25 186.25,-19.25 186.25,0 318.5,0 318.5,-19.25"/>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::isBigEndian</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.7,-9.62C158.59,-9.62 166.62,-9.62 174.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.49,-13.13 184.49,-9.63 174.49,-6.13 174.49,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.63,-19.54C211.97,-28.15 221.22,-37.25 252.38,-37.25 269.9,-37.25 280.5,-34.37 284.16,-30.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.44,-29.09 280.65,-20.96 280.88,-31.55 287.44,-29.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d96/md5_8cpp_a694712c9665051ba52b686387b87a689_cgraph_org.svg b/d5/d96/md5_8cpp_a694712c9665051ba52b686387b87a689_cgraph_org.svg
deleted file mode 100644
index 37ab14994..000000000
--- a/d5/d96/md5_8cpp_a694712c9665051ba52b686387b87a689_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::md5::toLittleEndian32 Pages: 1 -->
-<svg width="327pt" height="45pt"
- viewBox="0.00 0.00 326.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>hashing::md5::toLittleEndian32</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Sets 32&#45;bit integer to little&#45;endian if needed.">
-<polygon fill="#999999" stroke="#666666" points="150.25,-19.25 0,-19.25 0,0 150.25,0 150.25,-19.25"/>
-<text text-anchor="middle" x="75.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::toLittleEndian32</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47.38,-19.54C34.72,-28.15 43.97,-37.25 75.12,-37.25 92.65,-37.25 103.25,-34.37 106.91,-30.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.19,-29.09 103.4,-20.96 103.63,-31.55 110.19,-29.09"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446" target="_top" xlink:title="Checks whether integers are stored as big endian or not.">
-<polygon fill="white" stroke="#666666" points="318.5,-19.25 186.25,-19.25 186.25,0 318.5,0 318.5,-19.25"/>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::isBigEndian</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.7,-9.62C158.59,-9.62 166.62,-9.62 174.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.49,-13.13 184.49,-9.63 174.49,-6.13 174.49,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.63,-19.54C211.97,-28.15 221.22,-37.25 252.38,-37.25 269.9,-37.25 280.5,-34.37 284.16,-30.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.44,-29.09 280.65,-20.96 280.88,-31.55 287.44,-29.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d96/md5_8cpp_a6be48c1e6e742f9bd329f501d61dcaef_cgraph.map b/d5/d96/md5_8cpp_a6be48c1e6e742f9bd329f501d61dcaef_cgraph.map
deleted file mode 100644
index 81254cffd..000000000
--- a/d5/d96/md5_8cpp_a6be48c1e6e742f9bd329f501d61dcaef_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="hashing::md5::toLittleEndian64" name="hashing::md5::toLittleEndian64">
-<area shape="rect" id="Node000001" title="Sets 64&#45;bit integer to little&#45;endian if needed." alt="" coords="5,29,206,55"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="66,31,59,21,63,11,79,5,106,3,134,5,149,12,147,17,133,11,105,8,80,10,67,15,64,20,71,27"/>
-<area shape="rect" id="Node000002" href="$d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446" title="Checks whether integers are stored as big endian or not." alt="" coords="254,29,430,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="206,40,238,40,238,45,206,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="303,31,295,21,300,11,316,5,342,3,371,5,385,12,383,17,369,11,342,8,317,10,303,15,300,20,307,27"/>
-</map>
diff --git a/d5/d96/md5_8cpp_a6be48c1e6e742f9bd329f501d61dcaef_cgraph.md5 b/d5/d96/md5_8cpp_a6be48c1e6e742f9bd329f501d61dcaef_cgraph.md5
deleted file mode 100644
index 1cb51a61a..000000000
--- a/d5/d96/md5_8cpp_a6be48c1e6e742f9bd329f501d61dcaef_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2b5a385c7d739cb5d7c77c415b7f0722
\ No newline at end of file
diff --git a/d5/d96/md5_8cpp_a6be48c1e6e742f9bd329f501d61dcaef_cgraph.svg b/d5/d96/md5_8cpp_a6be48c1e6e742f9bd329f501d61dcaef_cgraph.svg
deleted file mode 100644
index 8ef3f16c1..000000000
--- a/d5/d96/md5_8cpp_a6be48c1e6e742f9bd329f501d61dcaef_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::md5::toLittleEndian64 Pages: 1 -->
-<svg width="327pt" height="45pt"
- viewBox="0.00 0.00 326.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>hashing::md5::toLittleEndian64</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Sets 64&#45;bit integer to little&#45;endian if needed.">
-<polygon fill="#999999" stroke="#666666" points="150.25,-19.25 0,-19.25 0,0 150.25,0 150.25,-19.25"/>
-<text text-anchor="middle" x="75.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::toLittleEndian64</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47.38,-19.54C34.72,-28.15 43.97,-37.25 75.12,-37.25 92.65,-37.25 103.25,-34.37 106.91,-30.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.19,-29.09 103.4,-20.96 103.63,-31.55 110.19,-29.09"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446" target="_top" xlink:title="Checks whether integers are stored as big endian or not.">
-<polygon fill="white" stroke="#666666" points="318.5,-19.25 186.25,-19.25 186.25,0 318.5,0 318.5,-19.25"/>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::isBigEndian</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.7,-9.62C158.59,-9.62 166.62,-9.62 174.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.49,-13.13 184.49,-9.63 174.49,-6.13 174.49,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.63,-19.54C211.97,-28.15 221.22,-37.25 252.38,-37.25 269.9,-37.25 280.5,-34.37 284.16,-30.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.44,-29.09 280.65,-20.96 280.88,-31.55 287.44,-29.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d96/md5_8cpp_a6be48c1e6e742f9bd329f501d61dcaef_cgraph_org.svg b/d5/d96/md5_8cpp_a6be48c1e6e742f9bd329f501d61dcaef_cgraph_org.svg
deleted file mode 100644
index 714171566..000000000
--- a/d5/d96/md5_8cpp_a6be48c1e6e742f9bd329f501d61dcaef_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::md5::toLittleEndian64 Pages: 1 -->
-<svg width="327pt" height="45pt"
- viewBox="0.00 0.00 326.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>hashing::md5::toLittleEndian64</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Sets 64&#45;bit integer to little&#45;endian if needed.">
-<polygon fill="#999999" stroke="#666666" points="150.25,-19.25 0,-19.25 0,0 150.25,0 150.25,-19.25"/>
-<text text-anchor="middle" x="75.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::toLittleEndian64</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47.38,-19.54C34.72,-28.15 43.97,-37.25 75.12,-37.25 92.65,-37.25 103.25,-34.37 106.91,-30.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.19,-29.09 103.4,-20.96 103.63,-31.55 110.19,-29.09"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446" target="_top" xlink:title="Checks whether integers are stored as big endian or not.">
-<polygon fill="white" stroke="#666666" points="318.5,-19.25 186.25,-19.25 186.25,0 318.5,0 318.5,-19.25"/>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::isBigEndian</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.7,-9.62C158.59,-9.62 166.62,-9.62 174.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.49,-13.13 184.49,-9.63 174.49,-6.13 174.49,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.63,-19.54C211.97,-28.15 221.22,-37.25 252.38,-37.25 269.9,-37.25 280.5,-34.37 284.16,-30.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.44,-29.09 280.65,-20.96 280.88,-31.55 287.44,-29.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph.map b/d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph.map
deleted file mode 100644
index 704aab855..000000000
--- a/d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph.map
+++ /dev/null
@@ -1,26 +0,0 @@
-<map id="hashing::md5::hash" name="hashing::md5::hash">
-<area shape="rect" id="Node000001" title="Converts the string to bytestring and calls the main algorithm." alt="" coords="5,153,141,179"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="40,154,34,145,38,135,51,129,73,127,97,129,109,136,106,141,95,134,73,132,53,134,42,139,39,144,45,151"/>
-<area shape="rect" id="Node000002" href="$d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425" title="The MD5 algorithm itself, taking in a bytestring." alt="" coords="189,128,345,154"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="141,155,173,150,174,156,142,160"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="211,177,322,203"/>
-<area shape="poly" id="edge15_Node000001_Node000009" title=" " alt="" coords="142,172,197,179,196,184,141,177"/>
-<area shape="poly" id="edge5_Node000002_Node000002" title=" " alt="" coords="234,129,228,119,232,110,245,103,267,101,291,104,303,111,300,116,289,109,267,107,246,109,236,113,233,119,239,126"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="432,5,554,31"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="279,125,326,83,358,60,392,40,417,30,419,35,394,45,361,64,329,87,283,129"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/copy.html#" title=" " alt="" coords="456,55,531,80"/>
-<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="298,125,392,89,439,76,441,81,394,94,299,130"/>
-<area shape="rect" id="Node000005" href="$d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d" title="Rotates the bits of a 32&#45;bit unsigned integer." alt="" coords="394,128,593,154"/>
-<area shape="poly" id="edge6_Node000002_Node000005" title=" " alt="" coords="345,138,378,138,378,144,345,144"/>
-<area shape="rect" id="Node000006" href="$d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689" title="Sets 32&#45;bit integer to little&#45;endian if needed." alt="" coords="393,201,593,227"/>
-<area shape="poly" id="edge8_Node000002_Node000006" title=" " alt="" coords="313,152,346,162,439,193,438,198,344,167,311,157"/>
-<area shape="rect" id="Node000008" href="$d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef" title="Sets 64&#45;bit integer to little&#45;endian if needed." alt="" coords="393,275,593,300"/>
-<area shape="poly" id="edge12_Node000002_Node000008" title=" " alt="" coords="328,152,347,163,364,181,372,200,380,219,395,238,416,253,440,266,437,271,413,258,391,241,375,222,367,202,359,184,343,167,325,157"/>
-<area shape="poly" id="edge7_Node000005_Node000005" title=" " alt="" coords="456,129,448,119,453,110,468,103,493,101,521,104,535,111,533,116,519,109,493,107,469,109,456,113,454,119,460,126"/>
-<area shape="poly" id="edge11_Node000006_Node000006" title=" " alt="" coords="456,203,448,193,453,183,468,177,493,175,521,177,535,184,533,189,519,182,493,180,469,182,456,187,454,192,460,199"/>
-<area shape="rect" id="Node000007" href="$d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446" title="Checks whether integers are stored as big endian or not." alt="" coords="641,239,818,264"/>
-<area shape="poly" id="edge9_Node000006_Node000007" title=" " alt="" coords="579,225,629,233,628,238,578,230"/>
-<area shape="poly" id="edge10_Node000007_Node000007" title=" " alt="" coords="690,240,683,230,687,220,703,214,730,212,758,215,773,221,771,226,757,220,729,217,704,219,691,224,688,229,695,237"/>
-<area shape="poly" id="edge13_Node000008_Node000007" title=" " alt="" coords="581,271,625,265,626,270,582,277"/>
-<area shape="poly" id="edge14_Node000008_Node000008" title=" " alt="" coords="456,276,448,266,453,256,468,250,493,248,521,251,535,258,533,262,519,256,493,253,469,255,456,260,454,265,460,273"/>
-</map>
diff --git a/d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph.md5 b/d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph.md5
deleted file mode 100644
index 813a945ad..000000000
--- a/d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-42343869a326a5a50dba42b9afa04178
\ No newline at end of file
diff --git a/d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph.svg b/d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph.svg
deleted file mode 100644
index b9adc27f5..000000000
--- a/d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph.svg
+++ /dev/null
@@ -1,311 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::md5::hash Pages: 1 -->
-<!--zoomable 229 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 617;
-var viewHeight = 229;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>hashing::md5::hash</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Converts the string to bytestring and calls the main algorithm.">
-<polygon fill="#999999" stroke="#666666" points="101.5,-110.25 0,-110.25 0,-91 101.5,-91 101.5,-110.25"/>
-<text text-anchor="middle" x="50.75" y="-96.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::hash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.99,-110.54C17.61,-119.15 25.2,-128.25 50.75,-128.25 65.12,-128.25 73.81,-125.37 76.82,-121.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.23,-120.52 73.95,-111.99 73.54,-122.57 80.23,-120.52"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425" target="_top" xlink:title="The MD5 algorithm itself, taking in a bytestring.">
-<polygon fill="white" stroke="#666666" points="254.75,-129.25 137.5,-129.25 137.5,-110 254.75,-110 254.75,-129.25"/>
-<text text-anchor="middle" x="196.12" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::hash_bs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.9,-107.27C109.78,-108.31 118.05,-109.41 126.26,-110.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.52,-113.93 135.9,-111.78 126.44,-106.99 125.52,-113.93"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.88,-92.25 154.38,-92.25 154.38,-73 237.88,-73 237.88,-92.25"/>
-<text text-anchor="middle" x="196.12" y="-78.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge15_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge15_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.9,-94.33C115.27,-92.65 129.75,-90.83 143.21,-89.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.26,-92.66 152.74,-87.95 142.38,-85.72 143.26,-92.66"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge5_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge5_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M173.37,-129.54C162.98,-138.15 170.57,-147.25 196.12,-147.25 210.5,-147.25 219.19,-144.37 222.19,-140.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.61,-139.52 219.33,-130.99 218.92,-141.57 225.61,-139.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="411.75,-221.25 320,-221.25 320,-202 411.75,-202 411.75,-221.25"/>
-<text text-anchor="middle" x="365.88" y="-207.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M206.78,-129.67C222.74,-145.66 256.3,-176.83 290.75,-193.62 296.55,-196.45 302.82,-198.85 309.18,-200.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.86,-204.15 318.43,-203.56 309.8,-197.42 307.86,-204.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/copy.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="394.12,-184.25 337.62,-184.25 337.62,-165 394.12,-165 394.12,-184.25"/>
-<text text-anchor="middle" x="365.88" y="-170.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::copy</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.89,-129.65C238.66,-137.66 266.09,-148.8 290.75,-156.62 302.11,-160.23 314.64,-163.53 326.12,-166.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.16,-169.65 335.69,-168.51 326.75,-162.83 325.16,-169.65"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d" target="_top" xlink:title="Rotates the bits of a 32&#45;bit unsigned integer.">
-<polygon fill="white" stroke="#666666" points="440.62,-129.25 291.12,-129.25 291.12,-110 440.62,-110 440.62,-129.25"/>
-<text text-anchor="middle" x="365.88" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::leftRotate32bits</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge6_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge6_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.86,-119.62C262.8,-119.62 271.1,-119.62 279.42,-119.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="279.23,-123.13 289.23,-119.63 279.23,-116.13 279.23,-123.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689" target="_top" xlink:title="Sets 32&#45;bit integer to little&#45;endian if needed.">
-<polygon fill="white" stroke="#666666" points="441,-74.25 290.75,-74.25 290.75,-55 441,-55 441,-74.25"/>
-<text text-anchor="middle" x="365.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::toLittleEndian32</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge8_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge8_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.77,-109.56C237.94,-107.01 246.67,-104.24 254.75,-101.62 278.01,-94.09 303.93,-85.39 324.78,-78.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.71,-81.71 334.05,-75.18 323.46,-75.08 325.71,-81.71"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef" target="_top" xlink:title="Sets 64&#45;bit integer to little&#45;endian if needed.">
-<polygon fill="white" stroke="#666666" points="441,-19.25 290.75,-19.25 290.75,0 441,0 441,-19.25"/>
-<text text-anchor="middle" x="365.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::toLittleEndian64</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge12_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge12_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M240.92,-109.59C245.84,-107.42 250.58,-104.8 254.75,-101.62 278.28,-83.69 268.62,-65.26 290.75,-45.62 300.68,-36.81 313.16,-29.66 325.02,-24.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.07,-27.48 333.83,-20.27 323.26,-21.07 326.07,-27.48"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge7_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge7_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M339.3,-129.54C327.18,-138.15 336.04,-147.25 365.88,-147.25 382.66,-147.25 392.81,-144.37 396.31,-140.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.63,-139.2 392.96,-130.96 393.04,-141.56 399.63,-139.2"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge11_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge11_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M339.3,-74.54C327.18,-83.15 336.04,-92.25 365.88,-92.25 382.66,-92.25 392.81,-89.37 396.31,-85.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.63,-84.2 392.96,-75.96 393.04,-86.56 399.63,-84.2"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446" target="_top" xlink:title="Checks whether integers are stored as big endian or not.">
-<polygon fill="white" stroke="#666666" points="609.25,-46.25 477,-46.25 477,-27 609.25,-27 609.25,-46.25"/>
-<text text-anchor="middle" x="543.12" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::isBigEndian</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge9_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge9_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M430.14,-54.52C442.3,-52.57 455.14,-50.52 467.62,-48.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="468.13,-51.99 477.45,-46.96 467.03,-45.08 468.13,-51.99"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge10_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge10_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M515.38,-46.54C502.72,-55.15 511.97,-64.25 543.12,-64.25 560.65,-64.25 571.25,-61.37 574.91,-57.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="578.19,-56.09 571.4,-47.96 571.63,-58.55 578.19,-56.09"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge13_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge13_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M432.13,-19.68C442.89,-21.34 454.14,-23.07 465.15,-24.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="464.61,-28.22 475.03,-26.29 465.68,-21.31 464.61,-28.22"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge14_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge14_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M339.3,-19.54C327.18,-28.15 336.04,-37.25 365.88,-37.25 382.66,-37.25 392.81,-34.37 396.31,-30.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.63,-29.2 392.96,-20.96 393.04,-31.56 399.63,-29.2"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph_org.svg b/d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph_org.svg
deleted file mode 100644
index 86466054e..000000000
--- a/d5/d96/md5_8cpp_a88705fab5f92adf3427b4cf76ff33edb_cgraph_org.svg
+++ /dev/null
@@ -1,228 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::md5::hash Pages: 1 -->
-<svg width="617pt" height="229pt"
- viewBox="0.00 0.00 617.25 229.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 225.25)">
-<title>hashing::md5::hash</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Converts the string to bytestring and calls the main algorithm.">
-<polygon fill="#999999" stroke="#666666" points="101.5,-110.25 0,-110.25 0,-91 101.5,-91 101.5,-110.25"/>
-<text text-anchor="middle" x="50.75" y="-96.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::hash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.99,-110.54C17.61,-119.15 25.2,-128.25 50.75,-128.25 65.12,-128.25 73.81,-125.37 76.82,-121.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.23,-120.52 73.95,-111.99 73.54,-122.57 80.23,-120.52"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425" target="_top" xlink:title="The MD5 algorithm itself, taking in a bytestring.">
-<polygon fill="white" stroke="#666666" points="254.75,-129.25 137.5,-129.25 137.5,-110 254.75,-110 254.75,-129.25"/>
-<text text-anchor="middle" x="196.12" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::hash_bs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.9,-107.27C109.78,-108.31 118.05,-109.41 126.26,-110.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.52,-113.93 135.9,-111.78 126.44,-106.99 125.52,-113.93"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.88,-92.25 154.38,-92.25 154.38,-73 237.88,-73 237.88,-92.25"/>
-<text text-anchor="middle" x="196.12" y="-78.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge15_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge15_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.9,-94.33C115.27,-92.65 129.75,-90.83 143.21,-89.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.26,-92.66 152.74,-87.95 142.38,-85.72 143.26,-92.66"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge5_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge5_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M173.37,-129.54C162.98,-138.15 170.57,-147.25 196.12,-147.25 210.5,-147.25 219.19,-144.37 222.19,-140.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.61,-139.52 219.33,-130.99 218.92,-141.57 225.61,-139.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="411.75,-221.25 320,-221.25 320,-202 411.75,-202 411.75,-221.25"/>
-<text text-anchor="middle" x="365.88" y="-207.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M206.78,-129.67C222.74,-145.66 256.3,-176.83 290.75,-193.62 296.55,-196.45 302.82,-198.85 309.18,-200.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.86,-204.15 318.43,-203.56 309.8,-197.42 307.86,-204.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/copy.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="394.12,-184.25 337.62,-184.25 337.62,-165 394.12,-165 394.12,-184.25"/>
-<text text-anchor="middle" x="365.88" y="-170.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::copy</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.89,-129.65C238.66,-137.66 266.09,-148.8 290.75,-156.62 302.11,-160.23 314.64,-163.53 326.12,-166.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.16,-169.65 335.69,-168.51 326.75,-162.83 325.16,-169.65"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d" target="_top" xlink:title="Rotates the bits of a 32&#45;bit unsigned integer.">
-<polygon fill="white" stroke="#666666" points="440.62,-129.25 291.12,-129.25 291.12,-110 440.62,-110 440.62,-129.25"/>
-<text text-anchor="middle" x="365.88" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::leftRotate32bits</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge6_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge6_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.86,-119.62C262.8,-119.62 271.1,-119.62 279.42,-119.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="279.23,-123.13 289.23,-119.63 279.23,-116.13 279.23,-123.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689" target="_top" xlink:title="Sets 32&#45;bit integer to little&#45;endian if needed.">
-<polygon fill="white" stroke="#666666" points="441,-74.25 290.75,-74.25 290.75,-55 441,-55 441,-74.25"/>
-<text text-anchor="middle" x="365.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::toLittleEndian32</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge8_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge8_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.77,-109.56C237.94,-107.01 246.67,-104.24 254.75,-101.62 278.01,-94.09 303.93,-85.39 324.78,-78.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.71,-81.71 334.05,-75.18 323.46,-75.08 325.71,-81.71"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef" target="_top" xlink:title="Sets 64&#45;bit integer to little&#45;endian if needed.">
-<polygon fill="white" stroke="#666666" points="441,-19.25 290.75,-19.25 290.75,0 441,0 441,-19.25"/>
-<text text-anchor="middle" x="365.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::toLittleEndian64</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge12_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge12_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M240.92,-109.59C245.84,-107.42 250.58,-104.8 254.75,-101.62 278.28,-83.69 268.62,-65.26 290.75,-45.62 300.68,-36.81 313.16,-29.66 325.02,-24.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.07,-27.48 333.83,-20.27 323.26,-21.07 326.07,-27.48"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge7_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge7_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M339.3,-129.54C327.18,-138.15 336.04,-147.25 365.88,-147.25 382.66,-147.25 392.81,-144.37 396.31,-140.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.63,-139.2 392.96,-130.96 393.04,-141.56 399.63,-139.2"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge11_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge11_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M339.3,-74.54C327.18,-83.15 336.04,-92.25 365.88,-92.25 382.66,-92.25 392.81,-89.37 396.31,-85.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.63,-84.2 392.96,-75.96 393.04,-86.56 399.63,-84.2"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446" target="_top" xlink:title="Checks whether integers are stored as big endian or not.">
-<polygon fill="white" stroke="#666666" points="609.25,-46.25 477,-46.25 477,-27 609.25,-27 609.25,-46.25"/>
-<text text-anchor="middle" x="543.12" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::isBigEndian</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge9_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge9_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M430.14,-54.52C442.3,-52.57 455.14,-50.52 467.62,-48.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="468.13,-51.99 477.45,-46.96 467.03,-45.08 468.13,-51.99"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge10_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge10_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M515.38,-46.54C502.72,-55.15 511.97,-64.25 543.12,-64.25 560.65,-64.25 571.25,-61.37 574.91,-57.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="578.19,-56.09 571.4,-47.96 571.63,-58.55 578.19,-56.09"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge13_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge13_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M432.13,-19.68C442.89,-21.34 454.14,-23.07 465.15,-24.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="464.61,-28.22 475.03,-26.29 465.68,-21.31 464.61,-28.22"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge14_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge14_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M339.3,-19.54C327.18,-28.15 336.04,-37.25 365.88,-37.25 382.66,-37.25 392.81,-34.37 396.31,-30.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.63,-29.2 392.96,-20.96 393.04,-31.56 399.63,-29.2"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 9c39312ce..000000000
--- a/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations of well&#45;known MD5 hashes." alt="" coords="5,31,49,56"/>
-<area shape="rect" id="Node000002" href="$d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,36,81,28,82,33,50,41"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,55,168,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="50,46,82,53,81,58,49,51"/>
-</map>
diff --git a/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 414249b3d..000000000
--- a/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9765448a7ce92ef05584fe32008f3e3a
\ No newline at end of file
diff --git a/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 486925d5f..000000000
--- a/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="64pt"
- viewBox="0.00 0.00 130.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations of well&#45;known MD5 hashes.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-56.25 68.5,-56.25 68.5,-37 122,-37 122,-56.25"/>
-<text text-anchor="middle" x="95.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">compare</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-31.47C39.86,-33.2 48.49,-35.33 57.03,-37.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.06,-40.81 66.61,-39.8 57.74,-34.01 56.06,-40.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-23.98C39.86,-22.34 48.49,-20.32 57.03,-18.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.66,-21.77 66.6,-16.09 56.07,-14.96 57.66,-21.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index dce4c17a3..000000000
--- a/d5/d96/md5_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="64pt"
- viewBox="0.00 0.00 130.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations of well&#45;known MD5 hashes.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-56.25 68.5,-56.25 68.5,-37 122,-37 122,-56.25"/>
-<text text-anchor="middle" x="95.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">compare</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-31.47C39.86,-33.2 48.49,-35.33 57.03,-37.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.06,-40.81 66.61,-39.8 57.74,-34.01 56.06,-40.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-23.98C39.86,-22.34 48.49,-20.32 57.03,-18.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.66,-21.77 66.6,-16.09 56.07,-14.96 57.66,-21.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d96/md5_8cpp_aaee69c6136a841043f956de32116e348_cgraph.map b/d5/d96/md5_8cpp_aaee69c6136a841043f956de32116e348_cgraph.map
deleted file mode 100644
index 224f1f7a4..000000000
--- a/d5/d96/md5_8cpp_aaee69c6136a841043f956de32116e348_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="hashing::md5::sig2hex" name="hashing::md5::sig2hex">
-<area shape="rect" id="Node000001" title="Transforms the 128&#45;bit MD5 signature into a 32 char hex string." alt="" coords="5,29,158,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="55,30,50,21,53,11,64,5,82,3,100,5,110,12,107,16,98,10,81,8,66,10,58,15,56,20,60,28"/>
-</map>
diff --git a/d5/d96/md5_8cpp_aaee69c6136a841043f956de32116e348_cgraph.md5 b/d5/d96/md5_8cpp_aaee69c6136a841043f956de32116e348_cgraph.md5
deleted file mode 100644
index 946983312..000000000
--- a/d5/d96/md5_8cpp_aaee69c6136a841043f956de32116e348_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cd1903e5a656c2a76bb6e49c1e03ed0c
\ No newline at end of file
diff --git a/d5/d96/md5_8cpp_aaee69c6136a841043f956de32116e348_cgraph.svg b/d5/d96/md5_8cpp_aaee69c6136a841043f956de32116e348_cgraph.svg
deleted file mode 100644
index f039a3480..000000000
--- a/d5/d96/md5_8cpp_aaee69c6136a841043f956de32116e348_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::md5::sig2hex Pages: 1 -->
-<svg width="122pt" height="45pt"
- viewBox="0.00 0.00 122.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>hashing::md5::sig2hex</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Transforms the 128&#45;bit MD5 signature into a 32 char hex string.">
-<polygon fill="#999999" stroke="#666666" points="114.25,-19.25 0,-19.25 0,0 114.25,0 114.25,-19.25"/>
-<text text-anchor="middle" x="57.13" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::sig2hex</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.24,-19.54C31.08,-28.15 37.04,-37.25 57.13,-37.25 68.11,-37.25 74.87,-34.53 77.4,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.86,-30.06 75.33,-21.02 74.01,-31.53 80.86,-30.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d96/md5_8cpp_aaee69c6136a841043f956de32116e348_cgraph_org.svg b/d5/d96/md5_8cpp_aaee69c6136a841043f956de32116e348_cgraph_org.svg
deleted file mode 100644
index 43da31988..000000000
--- a/d5/d96/md5_8cpp_aaee69c6136a841043f956de32116e348_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::md5::sig2hex Pages: 1 -->
-<svg width="122pt" height="45pt"
- viewBox="0.00 0.00 122.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>hashing::md5::sig2hex</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Transforms the 128&#45;bit MD5 signature into a 32 char hex string.">
-<polygon fill="#999999" stroke="#666666" points="114.25,-19.25 0,-19.25 0,0 114.25,0 114.25,-19.25"/>
-<text text-anchor="middle" x="57.13" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::sig2hex</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.24,-19.54C31.08,-28.15 37.04,-37.25 57.13,-37.25 68.11,-37.25 74.87,-34.53 77.4,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.86,-30.06 75.33,-21.02 74.01,-31.53 80.86,-30.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d96/md5_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.map b/d5/d96/md5_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.map
deleted file mode 100644
index b40f447c9..000000000
--- a/d5/d96/md5_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="interactive" name="interactive">
-<area shape="rect" id="Node000001" title="Puts user in a loop where inputs can be given and MD5 hash will be computed and printed." alt="" coords="5,55,87,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/compare.html#" title=" " alt="" coords="135,5,272,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="86,52,145,34,147,39,88,57"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="168,55,239,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="87,65,152,65,152,70,87,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/getline.html#" title=" " alt="" coords="161,104,246,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="88,78,147,96,145,101,86,83"/>
-</map>
diff --git a/d5/d96/md5_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.md5 b/d5/d96/md5_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.md5
deleted file mode 100644
index 775be8dae..000000000
--- a/d5/d96/md5_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9c819dac558f9ba4fe8967aecc9db5d3
\ No newline at end of file
diff --git a/d5/d96/md5_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.svg b/d5/d96/md5_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.svg
deleted file mode 100644
index 9676fc603..000000000
--- a/d5/d96/md5_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: interactive Pages: 1 -->
-<svg width="208pt" height="101pt"
- viewBox="0.00 0.00 208.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>interactive</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Puts user in a loop where inputs can be given and MD5 hash will be computed and printed.">
-<polygon fill="#999999" stroke="#666666" points="61,-56.25 0,-56.25 0,-37 61,-37 61,-56.25"/>
-<text text-anchor="middle" x="30.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">interactive</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200,-93.25 97,-93.25 97,-74 200,-74 200,-93.25"/>
-<text text-anchor="middle" x="148.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::compare</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.37,-56.15C74.75,-60.42 90.75,-65.52 105.32,-70.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="104.07,-73.45 114.66,-73.15 106.2,-66.78 104.07,-73.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="175.25,-56.25 121.75,-56.25 121.75,-37 175.25,-37 175.25,-56.25"/>
-<text text-anchor="middle" x="148.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.37,-46.62C76.14,-46.62 94.11,-46.62 109.81,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="109.77,-50.13 119.77,-46.63 109.77,-43.13 109.77,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="180.5,-19.25 116.5,-19.25 116.5,0 180.5,0 180.5,-19.25"/>
-<text text-anchor="middle" x="148.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.37,-37.1C74.75,-32.83 90.75,-27.73 105.32,-23.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.2,-26.47 114.66,-20.1 104.07,-19.8 106.2,-26.47"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d96/md5_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph_org.svg b/d5/d96/md5_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph_org.svg
deleted file mode 100644
index e6cffa3c1..000000000
--- a/d5/d96/md5_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: interactive Pages: 1 -->
-<svg width="208pt" height="101pt"
- viewBox="0.00 0.00 208.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>interactive</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Puts user in a loop where inputs can be given and MD5 hash will be computed and printed.">
-<polygon fill="#999999" stroke="#666666" points="61,-56.25 0,-56.25 0,-37 61,-37 61,-56.25"/>
-<text text-anchor="middle" x="30.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">interactive</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200,-93.25 97,-93.25 97,-74 200,-74 200,-93.25"/>
-<text text-anchor="middle" x="148.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::compare</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.37,-56.15C74.75,-60.42 90.75,-65.52 105.32,-70.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="104.07,-73.45 114.66,-73.15 106.2,-66.78 104.07,-73.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="175.25,-56.25 121.75,-56.25 121.75,-37 175.25,-37 175.25,-56.25"/>
-<text text-anchor="middle" x="148.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.37,-46.62C76.14,-46.62 94.11,-46.62 109.81,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="109.77,-50.13 119.77,-46.63 109.77,-43.13 109.77,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="180.5,-19.25 116.5,-19.25 116.5,0 180.5,0 180.5,-19.25"/>
-<text text-anchor="middle" x="148.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.37,-37.1C74.75,-32.83 90.75,-27.73 105.32,-23.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.2,-26.47 114.66,-20.1 104.07,-19.8 106.2,-26.47"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d96/md5_8cpp_add2bf982d5dd64a45d13cba52c2b371d_cgraph.map b/d5/d96/md5_8cpp_add2bf982d5dd64a45d13cba52c2b371d_cgraph.map
deleted file mode 100644
index a41c9eb5a..000000000
--- a/d5/d96/md5_8cpp_add2bf982d5dd64a45d13cba52c2b371d_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="hashing::md5::leftRotate32bits" name="hashing::md5::leftRotate32bits">
-<area shape="rect" id="Node000001" title="Rotates the bits of a 32&#45;bit unsigned integer." alt="" coords="5,29,205,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="72,30,65,21,69,11,83,5,105,3,130,5,142,12,139,17,128,10,105,8,84,10,73,15,70,20,76,27"/>
-</map>
diff --git a/d5/d96/md5_8cpp_add2bf982d5dd64a45d13cba52c2b371d_cgraph.md5 b/d5/d96/md5_8cpp_add2bf982d5dd64a45d13cba52c2b371d_cgraph.md5
deleted file mode 100644
index 09ea695f5..000000000
--- a/d5/d96/md5_8cpp_add2bf982d5dd64a45d13cba52c2b371d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f1c21ee080dcca47e1e0e8082f75a31e
\ No newline at end of file
diff --git a/d5/d96/md5_8cpp_add2bf982d5dd64a45d13cba52c2b371d_cgraph.svg b/d5/d96/md5_8cpp_add2bf982d5dd64a45d13cba52c2b371d_cgraph.svg
deleted file mode 100644
index 2dae3bcba..000000000
--- a/d5/d96/md5_8cpp_add2bf982d5dd64a45d13cba52c2b371d_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::md5::leftRotate32bits Pages: 1 -->
-<svg width="158pt" height="45pt"
- viewBox="0.00 0.00 157.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>hashing::md5::leftRotate32bits</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Rotates the bits of a 32&#45;bit unsigned integer.">
-<polygon fill="#999999" stroke="#666666" points="149.5,-19.25 0,-19.25 0,0 149.5,0 149.5,-19.25"/>
-<text text-anchor="middle" x="74.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::leftRotate32bits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M51.35,-19.54C40.67,-28.15 48.47,-37.25 74.75,-37.25 89.53,-37.25 98.47,-34.37 101.56,-30.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="104.96,-29.46 98.61,-20.98 98.28,-31.57 104.96,-29.46"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d96/md5_8cpp_add2bf982d5dd64a45d13cba52c2b371d_cgraph_org.svg b/d5/d96/md5_8cpp_add2bf982d5dd64a45d13cba52c2b371d_cgraph_org.svg
deleted file mode 100644
index 1dad53a4d..000000000
--- a/d5/d96/md5_8cpp_add2bf982d5dd64a45d13cba52c2b371d_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::md5::leftRotate32bits Pages: 1 -->
-<svg width="158pt" height="45pt"
- viewBox="0.00 0.00 157.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>hashing::md5::leftRotate32bits</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Rotates the bits of a 32&#45;bit unsigned integer.">
-<polygon fill="#999999" stroke="#666666" points="149.5,-19.25 0,-19.25 0,0 149.5,0 149.5,-19.25"/>
-<text text-anchor="middle" x="74.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::leftRotate32bits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M51.35,-19.54C40.67,-28.15 48.47,-37.25 74.75,-37.25 89.53,-37.25 98.47,-34.37 101.56,-30.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="104.96,-29.46 98.61,-20.98 98.28,-31.57 104.96,-29.46"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 7c6befadd..000000000
--- a/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,80,55,106"/>
-<area shape="rect" id="Node000002" href="$d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661" title="Puts user in a loop where inputs can be given and MD5 hash will be computed and printed." alt="" coords="103,55,184,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,85,87,77,88,83,55,90"/>
-<area shape="rect" id="Node000006" href="$d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations of well&#45;known MD5 hashes." alt="" coords="122,104,165,130"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="55,95,107,107,106,112,54,101"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/compare.html#" title=" " alt="" coords="232,5,369,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="184,52,242,34,244,39,185,57"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="265,104,336,130"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="185,78,251,99,249,104,184,83"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/getline.html#" title=" " alt="" coords="258,55,343,80"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="184,65,243,65,243,70,184,70"/>
-<area shape="poly" id="edge7_Node000006_Node000004" title=" " alt="" coords="166,114,250,114,250,120,166,120"/>
-<area shape="rect" id="Node000007" href="$d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" title=" " alt="" coords="265,153,336,179"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="166,121,251,148,250,153,165,126"/>
-</map>
diff --git a/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 75ced1c0f..000000000
--- a/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3d8b2b9cd69f1ea490052a32c17a74f8
\ No newline at end of file
diff --git a/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 3fc5b6846..000000000
--- a/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,164 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="281pt" height="138pt"
- viewBox="0.00 0.00 281.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661" target="_top" xlink:title="Puts user in a loop where inputs can be given and MD5 hash will be computed and printed.">
-<polygon fill="white" stroke="#666666" points="134,-93.25 73,-93.25 73,-74 134,-74 134,-93.25"/>
-<text text-anchor="middle" x="103.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">interactive</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.1,-68.65C44.25,-70.29 52.83,-72.25 61.39,-74.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.5,-77.6 71.03,-76.42 62.06,-70.78 60.5,-77.6"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations of well&#45;known MD5 hashes.">
-<polygon fill="white" stroke="#666666" points="119.75,-56.25 87.25,-56.25 87.25,-37 119.75,-37 119.75,-56.25"/>
-<text text-anchor="middle" x="103.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.1,-60.81C48.4,-58.36 63.27,-55.13 75.98,-52.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.37,-55.87 85.4,-50.33 74.89,-49.03 76.37,-55.87"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273,-130.25 170,-130.25 170,-111 273,-111 273,-130.25"/>
-<text text-anchor="middle" x="221.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::compare</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.37,-93.15C147.75,-97.42 163.75,-102.52 178.32,-107.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.07,-110.45 187.66,-110.15 179.2,-103.78 177.07,-110.45"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.25,-56.25 194.75,-56.25 194.75,-37 248.25,-37 248.25,-56.25"/>
-<text text-anchor="middle" x="221.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.37,-74.1C149.43,-69.29 167.82,-63.43 183.73,-58.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.38,-61.82 192.84,-55.45 182.25,-55.15 184.38,-61.82"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.5,-93.25 189.5,-93.25 189.5,-74 253.5,-74 253.5,-93.25"/>
-<text text-anchor="middle" x="221.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.37,-83.62C147.62,-83.62 163.44,-83.62 177.89,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.59,-87.13 187.59,-83.63 177.59,-80.13 177.59,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge7_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.14,-46.62C136.22,-46.62 161.83,-46.62 183.15,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.96,-50.13 192.96,-46.63 182.96,-43.13 182.96,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.25,-19.25 194.75,-19.25 194.75,0 248.25,0 248.25,-19.25"/>
-<text text-anchor="middle" x="221.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">compare</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.14,-41.64C136.36,-36.46 162.3,-28.19 183.74,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.57,-24.76 193.03,-18.39 182.44,-18.09 184.57,-24.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 5ef455162..000000000
--- a/d5/d96/md5_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,138 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="281pt" height="138pt"
- viewBox="0.00 0.00 281.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661" target="_top" xlink:title="Puts user in a loop where inputs can be given and MD5 hash will be computed and printed.">
-<polygon fill="white" stroke="#666666" points="134,-93.25 73,-93.25 73,-74 134,-74 134,-93.25"/>
-<text text-anchor="middle" x="103.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">interactive</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.1,-68.65C44.25,-70.29 52.83,-72.25 61.39,-74.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.5,-77.6 71.03,-76.42 62.06,-70.78 60.5,-77.6"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations of well&#45;known MD5 hashes.">
-<polygon fill="white" stroke="#666666" points="119.75,-56.25 87.25,-56.25 87.25,-37 119.75,-37 119.75,-56.25"/>
-<text text-anchor="middle" x="103.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.1,-60.81C48.4,-58.36 63.27,-55.13 75.98,-52.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.37,-55.87 85.4,-50.33 74.89,-49.03 76.37,-55.87"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273,-130.25 170,-130.25 170,-111 273,-111 273,-130.25"/>
-<text text-anchor="middle" x="221.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::compare</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.37,-93.15C147.75,-97.42 163.75,-102.52 178.32,-107.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.07,-110.45 187.66,-110.15 179.2,-103.78 177.07,-110.45"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.25,-56.25 194.75,-56.25 194.75,-37 248.25,-37 248.25,-56.25"/>
-<text text-anchor="middle" x="221.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.37,-74.1C149.43,-69.29 167.82,-63.43 183.73,-58.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.38,-61.82 192.84,-55.45 182.25,-55.15 184.38,-61.82"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.5,-93.25 189.5,-93.25 189.5,-74 253.5,-74 253.5,-93.25"/>
-<text text-anchor="middle" x="221.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.37,-83.62C147.62,-83.62 163.44,-83.62 177.89,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.59,-87.13 187.59,-83.63 177.59,-80.13 177.59,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge7_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.14,-46.62C136.22,-46.62 161.83,-46.62 183.15,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.96,-50.13 192.96,-46.63 182.96,-43.13 182.96,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.25,-19.25 194.75,-19.25 194.75,0 248.25,0 248.25,-19.25"/>
-<text text-anchor="middle" x="221.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">compare</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.14,-41.64C136.36,-36.46 162.3,-28.19 183.74,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.57,-24.76 193.03,-18.39 182.44,-18.09 184.57,-24.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d96/md5_8cpp_af8e96bde0183c4b0a7ff04668f11e446_cgraph.map b/d5/d96/md5_8cpp_af8e96bde0183c4b0a7ff04668f11e446_cgraph.map
deleted file mode 100644
index a27677de9..000000000
--- a/d5/d96/md5_8cpp_af8e96bde0183c4b0a7ff04668f11e446_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="hashing::md5::isBigEndian" name="hashing::md5::isBigEndian">
-<area shape="rect" id="Node000001" title="Checks whether integers are stored as big endian or not." alt="" coords="5,29,182,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="64,30,58,21,61,11,74,5,94,3,115,5,126,12,123,16,113,10,93,8,75,10,65,15,63,20,68,28"/>
-</map>
diff --git a/d5/d96/md5_8cpp_af8e96bde0183c4b0a7ff04668f11e446_cgraph.md5 b/d5/d96/md5_8cpp_af8e96bde0183c4b0a7ff04668f11e446_cgraph.md5
deleted file mode 100644
index 4369d834d..000000000
--- a/d5/d96/md5_8cpp_af8e96bde0183c4b0a7ff04668f11e446_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b9bfa35b267992551c1f7e55b1d470da
\ No newline at end of file
diff --git a/d5/d96/md5_8cpp_af8e96bde0183c4b0a7ff04668f11e446_cgraph.svg b/d5/d96/md5_8cpp_af8e96bde0183c4b0a7ff04668f11e446_cgraph.svg
deleted file mode 100644
index 210664496..000000000
--- a/d5/d96/md5_8cpp_af8e96bde0183c4b0a7ff04668f11e446_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::md5::isBigEndian Pages: 1 -->
-<svg width="140pt" height="45pt"
- viewBox="0.00 0.00 140.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>hashing::md5::isBigEndian</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Checks whether integers are stored as big endian or not.">
-<polygon fill="#999999" stroke="#666666" points="132.25,-19.25 0,-19.25 0,0 132.25,0 132.25,-19.25"/>
-<text text-anchor="middle" x="66.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::isBigEndian</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.42,-19.54C35.98,-28.15 42.88,-37.25 66.12,-37.25 78.84,-37.25 86.66,-34.53 89.6,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.01,-29.86 87.2,-21.01 86.22,-31.56 93.01,-29.86"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/d96/md5_8cpp_af8e96bde0183c4b0a7ff04668f11e446_cgraph_org.svg b/d5/d96/md5_8cpp_af8e96bde0183c4b0a7ff04668f11e446_cgraph_org.svg
deleted file mode 100644
index 77e3106a3..000000000
--- a/d5/d96/md5_8cpp_af8e96bde0183c4b0a7ff04668f11e446_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::md5::isBigEndian Pages: 1 -->
-<svg width="140pt" height="45pt"
- viewBox="0.00 0.00 140.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>hashing::md5::isBigEndian</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Checks whether integers are stored as big endian or not.">
-<polygon fill="#999999" stroke="#666666" points="132.25,-19.25 0,-19.25 0,0 132.25,0 132.25,-19.25"/>
-<text text-anchor="middle" x="66.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::md5::isBigEndian</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.42,-19.54C35.98,-28.15 42.88,-37.25 66.12,-37.25 78.84,-37.25 86.66,-34.53 89.6,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.01,-29.86 87.2,-21.01 86.22,-31.56 93.01,-29.86"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/d96/md5_8cpp_source.html b/d5/d96/md5_8cpp_source.html
new file mode 100644
index 000000000..f1be3d938
--- /dev/null
+++ b/d5/d96/md5_8cpp_source.html
@@ -0,0 +1,443 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: hashing/md5.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/d96/md5_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">md5.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d5/d96/md5_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#include &lt;array&gt;</span>      </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="preprocessor">#include &lt;cstring&gt;</span>    </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="preprocessor">#include &lt;string&gt;</span>     </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/d0c/namespacehashing.html">hashing</a> {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="keyword">namespace </span>md5 {</div>
+<div class="foldopen" id="foldopen00067" data-start="{" data-end="}">
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d">   67</a></span>uint32_t <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d">leftRotate32bits</a>(uint32_t n, std::size_t rotate) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keywordflow">return</span> (n &lt;&lt; rotate) | (n &gt;&gt; (32 - rotate));</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00077" data-start="{" data-end="}">
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446">   77</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446">isBigEndian</a>() {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keyword">union </span>{</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        uint32_t i;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        std::array&lt;char, 4&gt; c;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    } bint = {0x01020304};</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordflow">return</span> bint.c[0] == 1;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00090" data-start="{" data-end="}">
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="../../d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689">   90</a></span>uint32_t <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689">toLittleEndian32</a>(uint32_t n) {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446">isBigEndian</a>()) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        <span class="keywordflow">return</span> ((n &lt;&lt; 24) &amp; 0xFF000000) | ((n &lt;&lt; 8) &amp; 0x00FF0000) |</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>               ((n &gt;&gt; 8) &amp; 0x0000FF00) | ((n &gt;&gt; 24) &amp; 0x000000FF);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    }</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="comment">// Machine works on little endian, no need to change anything</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="keywordflow">return</span> n;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00103" data-start="{" data-end="}">
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"><a class="line" href="../../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef">  103</a></span>uint64_t <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef">toLittleEndian64</a>(uint64_t n) {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446">isBigEndian</a>()) {</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        <span class="keywordflow">return</span> ((n &lt;&lt; 56) &amp; 0xFF00000000000000) |</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>               ((n &lt;&lt; 40) &amp; 0x00FF000000000000) |</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>               ((n &lt;&lt; 24) &amp; 0x0000FF0000000000) |</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>               ((n &lt;&lt; 8) &amp; 0x000000FF00000000) |</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>               ((n &gt;&gt; 8) &amp; 0x00000000FF000000) |</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>               ((n &gt;&gt; 24) &amp; 0x0000000000FF0000) |</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>               ((n &gt;&gt; 40) &amp; 0x000000000000FF00) |</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>               ((n &gt;&gt; 56) &amp; 0x00000000000000FF);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        ;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    }</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <span class="comment">// Machine works on little endian, no need to change anything</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <span class="keywordflow">return</span> n;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00123" data-start="{" data-end="}">
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"><a class="line" href="../../d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348">  123</a></span>std::string <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348">sig2hex</a>(<span class="keywordtype">void</span>* sig) {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    <span class="keyword">const</span> <span class="keywordtype">char</span>* hexChars = <span class="stringliteral">&quot;0123456789abcdef&quot;</span>;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    <span class="keyword">auto</span>* intsig = <span class="keyword">static_cast&lt;</span>uint8_t*<span class="keyword">&gt;</span>(sig);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    std::string hex = <span class="stringliteral">&quot;&quot;</span>;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; 16; i++) {</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        hex.push_back(hexChars[(intsig[i] &gt;&gt; 4) &amp; 0xF]);</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        hex.push_back(hexChars[(intsig[i]) &amp; 0xF]);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    }</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <span class="keywordflow">return</span> hex;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00139" data-start="{" data-end="}">
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"><a class="line" href="../../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425">  139</a></span><span class="keywordtype">void</span>* <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425">hash_bs</a>(<span class="keyword">const</span> <span class="keywordtype">void</span>* input_bs, uint64_t input_size) {</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="keyword">auto</span>* input = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>uint8_t*<span class="keyword">&gt;</span>(input_bs);</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    <span class="comment">// Step 0: Initial Data (Those are decided in the MD5 protocol)</span></div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <span class="comment">// s is the shift used in the leftrotate each round</span></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    std::array&lt;uint32_t, 64&gt; s = {</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        5, 9,  14, 20, 5, 9,  14, 20, 5, 9,  14, 20, 5, 9,  14, 20,</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21};</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    <span class="comment">// K is pseudo-random values used each round</span></div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    <span class="comment">// The values can be obtained by the following python code:</span></div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    std::array&lt;uint32_t, 64&gt; K = {</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        3614090360, 3905402710, 606105819,  3250441966, 4118548399, 1200080426,</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>        2821735955, 4249261313, 1770035416, 2336552879, 4294925233, 2304563134,</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>        1804603682, 4254626195, 2792965006, 1236535329, 4129170786, 3225465664,</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        643717713,  3921069994, 3593408605, 38016083,   3634488961, 3889429448,</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>        568446438,  3275163606, 4107603335, 1163531501, 2850285829, 4243563512,</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        1735328473, 2368359562, 4294588738, 2272392833, 1839030562, 4259657740,</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>        2763975236, 1272893353, 4139469664, 3200236656, 681279174,  3936430074,</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        3572445317, 76029189,   3654602809, 3873151461, 530742520,  3299628645,</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>        4096336452, 1126891415, 2878612391, 4237533241, 1700485571, 2399980690,</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>        4293915773, 2240044497, 1873313359, 4264355552, 2734768916, 1309151649,</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>        4149444226, 3174756917, 718787259,  3951481745};</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span> </div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    <span class="comment">// The initial 128-bit state</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    uint32_t a0 = 0x67452301, A = 0;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    uint32_t b0 = 0xefcdab89, B = 0;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    uint32_t c0 = 0x98badcfe, C = 0;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    uint32_t d0 = 0x10325476, D = 0;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span> </div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    <span class="comment">// Step 1: Processing the bytestring</span></div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span> </div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    <span class="comment">// First compute the size the padded message will have</span></div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    <span class="comment">// so it is possible to allocate the right amount of memory</span></div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    uint64_t padded_message_size = 0;</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    <span class="keywordflow">if</span> (input_size % 64 &lt; 56) {</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>        padded_message_size = input_size + 64 - (input_size % 64);</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        padded_message_size = input_size + 128 - (input_size % 64);</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    }</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span> </div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    std::vector&lt;uint8_t&gt; padded_message(padded_message_size);</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span> </div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    <span class="comment">// Beginning of the padded message is the original message</span></div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    std::copy(input, input + input_size, padded_message.begin());</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span> </div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    <span class="comment">// Afterwards comes a single 1 bit and then only zeroes</span></div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    padded_message[input_size] = 1 &lt;&lt; 7;  <span class="comment">// 10000000</span></div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    <span class="keywordflow">for</span> (uint64_t i = input_size; i % 64 != 56; i++) {</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>        <span class="keywordflow">if</span> (i == input_size) {</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>            <span class="keywordflow">continue</span>;  <span class="comment">// pass first iteration</span></div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>        }</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>        padded_message[i] = 0;</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    }</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span> </div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    <span class="comment">// We then have to add the 64-bit size of the message at the end</span></div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    <span class="comment">// When there is a conversion from int to bytestring or vice-versa</span></div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    <span class="comment">// We always need to make sure it is little endian</span></div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    uint64_t input_bitsize_le = <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef">toLittleEndian64</a>(input_size * 8);</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; 8; i++) {</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>        padded_message[padded_message_size - 8 + i] =</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>            (input_bitsize_le &gt;&gt; (56 - 8 * i)) &amp; 0xFF;</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    }</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span> </div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    <span class="comment">// Already allocate memory for blocks</span></div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    std::array&lt;uint32_t, 16&gt; blocks{};</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span> </div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    <span class="comment">// Rounds</span></div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    <span class="keywordflow">for</span> (uint64_t chunk = 0; chunk * 64 &lt; padded_message_size; chunk++) {</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>        <span class="comment">// First, build the 16 32-bits blocks from the chunk</span></div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>        <span class="keywordflow">for</span> (uint8_t bid = 0; bid &lt; 16; bid++) {</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>            blocks[bid] = 0;</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span> </div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>            <span class="comment">// Having to build a 32-bit word from 4-bit words</span></div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>            <span class="comment">// Add each and shift them to the left</span></div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>            <span class="keywordflow">for</span> (uint8_t cid = 0; cid &lt; 4; cid++) {</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>                blocks[bid] = (blocks[bid] &lt;&lt; 8) +</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>                              padded_message[chunk * 64 + bid * 4 + cid];</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>            }</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>        }</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span> </div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>        A = a0;</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>        B = b0;</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>        C = c0;</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>        D = d0;</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span> </div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>        <span class="comment">// Main &quot;hashing&quot; loop</span></div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>        <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; 64; i++) {</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>            uint32_t F = 0, g = 0;</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>            <span class="keywordflow">if</span> (i &lt; 16) {</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>                F = (B &amp; C) | ((~B) &amp; D);</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>                g = i;</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (i &lt; 32) {</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>                F = (D &amp; B) | ((~D) &amp; C);</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>                g = (5 * i + 1) % 16;</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (i &lt; 48) {</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>                F = B ^ C ^ D;</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>                g = (3 * i + 5) % 16;</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>                F = C ^ (B | (~D));</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>                g = (7 * i) % 16;</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>            }</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span> </div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>            <span class="comment">// Update the accumulators</span></div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>            F += A + K[i] + <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689">toLittleEndian32</a>(blocks[g]);</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span> </div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>            A = D;</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>            D = C;</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>            C = B;</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>            B += <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d">leftRotate32bits</a>(F, s[i]);</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>        }</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>        <span class="comment">// Update the state with this chunk&#39;s hash</span></div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>        a0 += A;</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>        b0 += B;</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>        c0 += C;</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>        d0 += D;</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>    }</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span> </div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>    <span class="comment">// Build signature from state</span></div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    <span class="comment">// Note, any type could be used for the signature</span></div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    <span class="comment">// uint8_t was used to make the 16 bytes obvious</span></div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    <span class="comment">// The sig needs to be little endian</span></div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>    <span class="keyword">auto</span>* sig = <span class="keyword">new</span> uint8_t[16];</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; 4; i++) {</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>        sig[i] = (a0 &gt;&gt; (8 * i)) &amp; 0xFF;</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>        sig[i + 4] = (b0 &gt;&gt; (8 * i)) &amp; 0xFF;</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>        sig[i + 8] = (c0 &gt;&gt; (8 * i)) &amp; 0xFF;</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>        sig[i + 12] = (d0 &gt;&gt; (8 * i)) &amp; 0xFF;</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>    }</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span> </div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>    <span class="keywordflow">return</span> sig;</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00288" data-start="{" data-end="}">
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"><a class="line" href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">  288</a></span><span class="keywordtype">void</span>* <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hash</a>(<span class="keyword">const</span> std::string&amp; message) {</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425">hash_bs</a>(&amp;message[0], message.size());</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>}</div>
+</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>}  <span class="comment">// namespace md5</span></div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>}  <span class="comment">// namespace hashing</span></div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span> </div>
+<div class="foldopen" id="foldopen00298" data-start="{" data-end="}">
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"><a class="line" href="../../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  298</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>    <span class="comment">// Hashes empty string and stores signature</span></div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>    <span class="keywordtype">void</span>* sig = hashing::md5::hash(<span class="stringliteral">&quot;&quot;</span>);</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hashing empty string&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>    <span class="comment">// Prints signature hex representation</span></div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>    std::cout &lt;&lt; hashing::md5::sig2hex(sig) &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>    <span class="comment">// Test with cassert whether sig is correct from the expected value</span></div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>    assert(hashing::md5::sig2hex(sig).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>               <span class="stringliteral">&quot;d41d8cd98f00b204e9800998ecf8427e&quot;</span>) == 0);</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span> </div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>    <span class="comment">// Hashes &quot;The quick brown fox jumps over the lazy dog&quot; and stores signature</span></div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>    <span class="keywordtype">void</span>* sig2 =</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>        hashing::md5::hash(<span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog&quot;</span>);</div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hashing The quick brown fox jumps over the lazy dog&quot;</span></div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>    <span class="comment">// Prints signature hex representation</span></div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>    std::cout &lt;&lt; hashing::md5::sig2hex(sig2) &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>    <span class="comment">// Test with cassert whether sig is correct from the expected value</span></div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>    assert(hashing::md5::sig2hex(sig2).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>               <span class="stringliteral">&quot;9e107d9d372bb6826bd81d3542a419d6&quot;</span>) == 0);</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span> </div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>    <span class="comment">// Hashes &quot;The quick brown fox jumps over the lazy dog.&quot; (notice the</span></div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>    <span class="comment">// additional period) and stores signature</span></div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>    <span class="keywordtype">void</span>* sig3 =</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>        hashing::md5::hash(<span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog.&quot;</span>);</div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hashing &quot;</span></div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>                 <span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog.&quot;</span></div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>    <span class="comment">// Prints signature hex representation</span></div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>    std::cout &lt;&lt; hashing::md5::sig2hex(sig3) &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>    <span class="comment">// Test with cassert whether sig is correct from the expected value</span></div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>    assert(hashing::md5::sig2hex(sig3).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>               <span class="stringliteral">&quot;e4d909c290d0fb1ca068ffaddf22cbd0&quot;</span>) == 0);</div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span> </div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>    <span class="comment">// Hashes &quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789&quot;</span></div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>    <span class="comment">// and stores signature</span></div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>    <span class="keywordtype">void</span>* sig4 = hashing::md5::hash(</div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>        <span class="stringliteral">&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789&quot;</span>);</div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>    std::cout</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>        &lt;&lt; <span class="stringliteral">&quot;Hashing &quot;</span></div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>           <span class="stringliteral">&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789&quot;</span></div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>        &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>    <span class="comment">// Prints signature hex representation</span></div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>    std::cout &lt;&lt; hashing::md5::sig2hex(sig4) &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>    <span class="comment">// Test with cassert whether sig is correct from the expected value</span></div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>    assert(hashing::md5::sig2hex(sig4).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>               <span class="stringliteral">&quot;d174ab98d277d9f5a5611c2c9f419d9f&quot;</span>) == 0);</div>
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span>}</div>
+</div>
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span> </div>
+<div class="foldopen" id="foldopen00352" data-start="{" data-end="}">
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"><a class="line" href="../../d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661">  352</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661">interactive</a>() {</div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>    <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>        std::string input;</div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter a message to be hashed (Ctrl-C to exit): &quot;</span></div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>                  &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>        std::getline(std::cin, input);</div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>        <span class="keywordtype">void</span>* sig = hashing::md5::hash(input);</div>
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Hash is: &quot;</span> &lt;&lt; hashing::md5::sig2hex(sig) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span> </div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>        <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Want to enter another message? (y/n) &quot;</span>;</div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>            std::getline(std::cin, input);</div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>            <span class="keywordflow">if</span> (input.compare(<span class="stringliteral">&quot;y&quot;</span>) == 0) {</div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (input.compare(<span class="stringliteral">&quot;n&quot;</span>) == 0) {</div>
+<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>                <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>            }</div>
+<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>        }</div>
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>    }</div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>}</div>
+</div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span> </div>
+<div class="foldopen" id="foldopen00377" data-start="{" data-end="}">
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"><a class="line" href="../../d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  377</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>    <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span> </div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>    <span class="comment">// Launch interactive mode where user can input messages and see</span></div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>    <span class="comment">// their hash</span></div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>    <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661">interactive</a>();</div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>}</div>
+</div>
+<div class="ttc" id="amd5_8cpp_html_a5341431cef7fcfc33794326e1deb2425"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425">hashing::md5::hash_bs</a></div><div class="ttdeci">void * hash_bs(const void *input_bs, uint64_t input_size)</div><div class="ttdoc">The MD5 algorithm itself, taking in a bytestring.</div><div class="ttdef"><b>Definition</b> <a href="#l00139">md5.cpp:139</a></div></div>
+<div class="ttc" id="amd5_8cpp_html_a694712c9665051ba52b686387b87a689"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689">hashing::md5::toLittleEndian32</a></div><div class="ttdeci">uint32_t toLittleEndian32(uint32_t n)</div><div class="ttdoc">Sets 32-bit integer to little-endian if needed.</div><div class="ttdef"><b>Definition</b> <a href="#l00090">md5.cpp:90</a></div></div>
+<div class="ttc" id="amd5_8cpp_html_a6be48c1e6e742f9bd329f501d61dcaef"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef">hashing::md5::toLittleEndian64</a></div><div class="ttdeci">uint64_t toLittleEndian64(uint64_t n)</div><div class="ttdoc">Sets 64-bit integer to little-endian if needed.</div><div class="ttdef"><b>Definition</b> <a href="#l00103">md5.cpp:103</a></div></div>
+<div class="ttc" id="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00288">md5.cpp:288</a></div></div>
+<div class="ttc" id="amd5_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations of well-known MD5 hashes.</div><div class="ttdef"><b>Definition</b> <a href="#l00298">md5.cpp:298</a></div></div>
+<div class="ttc" id="amd5_8cpp_html_aaee69c6136a841043f956de32116e348"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348">hashing::md5::sig2hex</a></div><div class="ttdeci">std::string sig2hex(void *sig)</div><div class="ttdoc">Transforms the 128-bit MD5 signature into a 32 char hex string.</div><div class="ttdef"><b>Definition</b> <a href="#l00123">md5.cpp:123</a></div></div>
+<div class="ttc" id="amd5_8cpp_html_ac9e1a11f44135b890dd10a00e73b5661"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661">interactive</a></div><div class="ttdeci">static void interactive()</div><div class="ttdoc">Puts user in a loop where inputs can be given and MD5 hash will be computed and printed.</div><div class="ttdef"><b>Definition</b> <a href="#l00352">md5.cpp:352</a></div></div>
+<div class="ttc" id="amd5_8cpp_html_add2bf982d5dd64a45d13cba52c2b371d"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d">hashing::md5::leftRotate32bits</a></div><div class="ttdeci">uint32_t leftRotate32bits(uint32_t n, std::size_t rotate)</div><div class="ttdoc">Rotates the bits of a 32-bit unsigned integer.</div><div class="ttdef"><b>Definition</b> <a href="#l00067">md5.cpp:67</a></div></div>
+<div class="ttc" id="amd5_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00377">md5.cpp:377</a></div></div>
+<div class="ttc" id="amd5_8cpp_html_af8e96bde0183c4b0a7ff04668f11e446"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446">hashing::md5::isBigEndian</a></div><div class="ttdeci">bool isBigEndian()</div><div class="ttdoc">Checks whether integers are stored as big endian or not.</div><div class="ttdef"><b>Definition</b> <a href="#l00077">md5.cpp:77</a></div></div>
+<div class="ttc" id="anamespacehashing_html"><div class="ttname"><a href="../../d6/d0c/namespacehashing.html">hashing</a></div><div class="ttdoc">Used for assert.</div></div>
+<div class="ttc" id="ashell__sort2_8cpp_html_a7eb77daed2cf1513f6d68c47a1c2db1c"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a></div><div class="ttdeci">int compare(const void *a, const void *b)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d7a/shell__sort2_8cpp_source.html#l00087">shell_sort2.cpp:87</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_ece9b94c107bbaa1dd68197a8c9983b9.html">hashing</a></li><li class="navelem"><a class="el" href="../../d5/d96/md5_8cpp.html">md5.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/da1/structnode.html b/d5/da1/structnode.html
index 22bd7515f..b05d75c08 100644
--- a/d5/da1/structnode.html
+++ b/d5/da1/structnode.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: node Class Reference</title>
+<title>TheAlgorithms/C++: node Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,41 +141,33 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a707bf3f1eeeaf8974e7e8e90f7bfd6a1" id="r_a707bf3f1eeeaf8974e7e8e90f7bfd6a1"><td class="memItemLeft" align="right" valign="top"><a id="a707bf3f1eeeaf8974e7e8e90f7bfd6a1" name="a707bf3f1eeeaf8974e7e8e90f7bfd6a1"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>val</b></td></tr>
+<tr class="memitem:a707bf3f1eeeaf8974e7e8e90f7bfd6a1" id="r_a707bf3f1eeeaf8974e7e8e90f7bfd6a1"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a707bf3f1eeeaf8974e7e8e90f7bfd6a1">val</a></td></tr>
 <tr class="separator:a707bf3f1eeeaf8974e7e8e90f7bfd6a1"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a436f89bf12a16edd124786c8d1c7d719" id="r_a436f89bf12a16edd124786c8d1c7d719"><td class="memItemLeft" align="right" valign="top"><a id="a436f89bf12a16edd124786c8d1c7d719" name="a436f89bf12a16edd124786c8d1c7d719"></a>
-<a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>left</b></td></tr>
+<tr class="memitem:a436f89bf12a16edd124786c8d1c7d719" id="r_a436f89bf12a16edd124786c8d1c7d719"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a436f89bf12a16edd124786c8d1c7d719">left</a></td></tr>
 <tr class="separator:a436f89bf12a16edd124786c8d1c7d719"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:afafc72df7ea24f355ad3abb32a331689" id="r_afafc72df7ea24f355ad3abb32a331689"><td class="memItemLeft" align="right" valign="top"><a id="afafc72df7ea24f355ad3abb32a331689" name="afafc72df7ea24f355ad3abb32a331689"></a>
-<a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>right</b></td></tr>
+<tr class="memitem:afafc72df7ea24f355ad3abb32a331689" id="r_afafc72df7ea24f355ad3abb32a331689"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afafc72df7ea24f355ad3abb32a331689">right</a></td></tr>
 <tr class="separator:afafc72df7ea24f355ad3abb32a331689"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2d890bb9f6af0ffd73fe79b21124c2a2" id="r_a2d890bb9f6af0ffd73fe79b21124c2a2"><td class="memItemLeft" align="right" valign="top"><a id="a2d890bb9f6af0ffd73fe79b21124c2a2" name="a2d890bb9f6af0ffd73fe79b21124c2a2"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
+<tr class="memitem:a2d890bb9f6af0ffd73fe79b21124c2a2" id="r_a2d890bb9f6af0ffd73fe79b21124c2a2"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2d890bb9f6af0ffd73fe79b21124c2a2">data</a></td></tr>
 <tr class="separator:a2d890bb9f6af0ffd73fe79b21124c2a2"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8c3f191ddee56260d4bb85b0874052a1" id="r_a8c3f191ddee56260d4bb85b0874052a1"><td class="memItemLeft" align="right" valign="top"><a id="a8c3f191ddee56260d4bb85b0874052a1" name="a8c3f191ddee56260d4bb85b0874052a1"></a>
-struct <a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>next</b></td></tr>
+<tr class="memitem:a8c3f191ddee56260d4bb85b0874052a1" id="r_a8c3f191ddee56260d4bb85b0874052a1"><td class="memItemLeft" align="right" valign="top">struct <a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8c3f191ddee56260d4bb85b0874052a1">next</a></td></tr>
 <tr class="separator:a8c3f191ddee56260d4bb85b0874052a1"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aad210fa7c160a49f6b9a3ffee592a2bc" id="r_aad210fa7c160a49f6b9a3ffee592a2bc"><td class="memItemLeft" align="right" valign="top"><a id="aad210fa7c160a49f6b9a3ffee592a2bc" name="aad210fa7c160a49f6b9a3ffee592a2bc"></a>
-<a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>next</b></td></tr>
+<tr class="memitem:aad210fa7c160a49f6b9a3ffee592a2bc" id="r_aad210fa7c160a49f6b9a3ffee592a2bc"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aad210fa7c160a49f6b9a3ffee592a2bc">next</a></td></tr>
 <tr class="separator:aad210fa7c160a49f6b9a3ffee592a2bc"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2a6a75dd1a3224be152f121f87720e0e" id="r_a2a6a75dd1a3224be152f121f87720e0e"><td class="memItemLeft" align="right" valign="top"><a id="a2a6a75dd1a3224be152f121f87720e0e" name="a2a6a75dd1a3224be152f121f87720e0e"></a>
-<a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>prev</b></td></tr>
+<tr class="memitem:a2a6a75dd1a3224be152f121f87720e0e" id="r_a2a6a75dd1a3224be152f121f87720e0e"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2a6a75dd1a3224be152f121f87720e0e">prev</a></td></tr>
 <tr class="separator:a2a6a75dd1a3224be152f121f87720e0e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa1417e7fad3ebcf42dc0ec8b711f273d" id="r_aa1417e7fad3ebcf42dc0ec8b711f273d"><td class="memItemLeft" align="right" valign="top"><a id="aa1417e7fad3ebcf42dc0ec8b711f273d" name="aa1417e7fad3ebcf42dc0ec8b711f273d"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>key</b></td></tr>
+<tr class="memitem:aa1417e7fad3ebcf42dc0ec8b711f273d" id="r_aa1417e7fad3ebcf42dc0ec8b711f273d"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa1417e7fad3ebcf42dc0ec8b711f273d">key</a></td></tr>
 <tr class="separator:aa1417e7fad3ebcf42dc0ec8b711f273d"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a5e88137f1d0e2f7a940bccf4c3d3a4d3" id="r_a5e88137f1d0e2f7a940bccf4c3d3a4d3"><td class="memItemLeft" align="right" valign="top"><a id="a5e88137f1d0e2f7a940bccf4c3d3a4d3" name="a5e88137f1d0e2f7a940bccf4c3d3a4d3"></a>
-<a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>parent</b></td></tr>
+<tr class="memitem:a5e88137f1d0e2f7a940bccf4c3d3a4d3" id="r_a5e88137f1d0e2f7a940bccf4c3d3a4d3"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5e88137f1d0e2f7a940bccf4c3d3a4d3">parent</a></td></tr>
 <tr class="separator:a5e88137f1d0e2f7a940bccf4c3d3a4d3"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2e137abb123f9d896ab99c03b2b13bb0" id="r_a2e137abb123f9d896ab99c03b2b13bb0"><td class="memItemLeft" align="right" valign="top"><a id="a2e137abb123f9d896ab99c03b2b13bb0" name="a2e137abb123f9d896ab99c03b2b13bb0"></a>
-char&#160;</td><td class="memItemRight" valign="bottom"><b>color</b></td></tr>
+<tr class="memitem:a2e137abb123f9d896ab99c03b2b13bb0" id="r_a2e137abb123f9d896ab99c03b2b13bb0"><td class="memItemLeft" align="right" valign="top">char&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2e137abb123f9d896ab99c03b2b13bb0">color</a></td></tr>
 <tr class="separator:a2e137abb123f9d896ab99c03b2b13bb0"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af23d89eee1b0584d8eaf9a2e8d8f25ee" id="r_af23d89eee1b0584d8eaf9a2e8d8f25ee"><td class="memItemLeft" align="right" valign="top"><a id="af23d89eee1b0584d8eaf9a2e8d8f25ee" name="af23d89eee1b0584d8eaf9a2e8d8f25ee"></a>
-<a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>link</b></td></tr>
+<tr class="memitem:af23d89eee1b0584d8eaf9a2e8d8f25ee" id="r_af23d89eee1b0584d8eaf9a2e8d8f25ee"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af23d89eee1b0584d8eaf9a2e8d8f25ee">link</a></td></tr>
 <tr class="separator:af23d89eee1b0584d8eaf9a2e8d8f25ee"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
-<h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">11</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
+</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="aa2c7b5711cccdc70afa02d02bd6d2586" name="aa2c7b5711cccdc70afa02d02bd6d2586"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aa2c7b5711cccdc70afa02d02bd6d2586">&#9670;&#160;</a></span>node()</h2>
 
@@ -181,25 +190,204 @@ char&#160;</td><td class="memItemRight" valign="bottom"><b>color</b></td></tr>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dcc/selectionsortlinkedlist_8cpp_source.html#l00009">9</a> of file <a class="el" href="../../d9/dcc/selectionsortlinkedlist_8cpp_source.html">selectionsortlinkedlist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">    9</span>                {</div>
 <div class="line"><span class="lineno">   10</span>        data = d;</div>
-<div class="line"><span class="lineno">   11</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">link</a> = NULL;</div>
+<div class="line"><span class="lineno">   11</span>        <a class="code hl_typedef" href="../../d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6">link</a> = NULL;</div>
 <div class="line"><span class="lineno">   12</span>    }</div>
-<div class="ttc" id="alist_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_ad6fcd983304f85afa199d97a9b0ca9f6"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6">link</a></div><div class="ttdeci">struct list * link</div><div class="ttdoc">pointer to nodes</div></div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a2e137abb123f9d896ab99c03b2b13bb0" name="a2e137abb123f9d896ab99c03b2b13bb0"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a2e137abb123f9d896ab99c03b2b13bb0">&#9670;&#160;</a></span>color</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">char node::color</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00009">9</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a2d890bb9f6af0ffd73fe79b21124c2a2" name="a2d890bb9f6af0ffd73fe79b21124c2a2"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a2d890bb9f6af0ffd73fe79b21124c2a2">&#9670;&#160;</a></span>data</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int node::data</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html#l00004">4</a> of file <a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html">circular_queue_using_linked_list.cpp</a>.</p>
+
+</div>
+</div>
+<a id="aa1417e7fad3ebcf42dc0ec8b711f273d" name="aa1417e7fad3ebcf42dc0ec8b711f273d"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aa1417e7fad3ebcf42dc0ec8b711f273d">&#9670;&#160;</a></span>key</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int node::key</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00007">7</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a436f89bf12a16edd124786c8d1c7d719" name="a436f89bf12a16edd124786c8d1c7d719"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a436f89bf12a16edd124786c8d1c7d719">&#9670;&#160;</a></span>left</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a> * node::left</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00013">13</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
+
+</div>
+</div>
+<a id="af23d89eee1b0584d8eaf9a2e8d8f25ee" name="af23d89eee1b0584d8eaf9a2e8d8f25ee"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#af23d89eee1b0584d8eaf9a2e8d8f25ee">&#9670;&#160;</a></span>link</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a>* node::link</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dcc/selectionsortlinkedlist_8cpp_source.html#l00008">8</a> of file <a class="el" href="../../d9/dcc/selectionsortlinkedlist_8cpp_source.html">selectionsortlinkedlist.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a8c3f191ddee56260d4bb85b0874052a1" name="a8c3f191ddee56260d4bb85b0874052a1"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a8c3f191ddee56260d4bb85b0874052a1">&#9670;&#160;</a></span>next <span class="overload">[1/2]</span></h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a> * node::next</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html#l00005">5</a> of file <a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html">circular_queue_using_linked_list.cpp</a>.</p>
+
+</div>
+</div>
+<a id="aad210fa7c160a49f6b9a3ffee592a2bc" name="aad210fa7c160a49f6b9a3ffee592a2bc"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aad210fa7c160a49f6b9a3ffee592a2bc">&#9670;&#160;</a></span>next <span class="overload">[2/2]</span></h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a>* node::next</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/dba/cll_8h_source.html#l00014">14</a> of file <a class="el" href="../../d7/dba/cll_8h_source.html">cll.h</a>.</p>
+
+</div>
+</div>
+<a id="a5e88137f1d0e2f7a940bccf4c3d3a4d3" name="a5e88137f1d0e2f7a940bccf4c3d3a4d3"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a5e88137f1d0e2f7a940bccf4c3d3a4d3">&#9670;&#160;</a></span>parent</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a>* node::parent</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00008">8</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a2a6a75dd1a3224be152f121f87720e0e" name="a2a6a75dd1a3224be152f121f87720e0e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a2a6a75dd1a3224be152f121f87720e0e">&#9670;&#160;</a></span>prev</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a>* node::prev</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d85/doubly__linked__list_8cpp_source.html#l00007">7</a> of file <a class="el" href="../../d7/d85/doubly__linked__list_8cpp_source.html">doubly_linked_list.cpp</a>.</p>
+
+</div>
+</div>
+<a id="afafc72df7ea24f355ad3abb32a331689" name="afafc72df7ea24f355ad3abb32a331689"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#afafc72df7ea24f355ad3abb32a331689">&#9670;&#160;</a></span>right</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a> * node::right</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00014">14</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a707bf3f1eeeaf8974e7e8e90f7bfd6a1" name="a707bf3f1eeeaf8974e7e8e90f7bfd6a1"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a707bf3f1eeeaf8974e7e8e90f7bfd6a1">&#9670;&#160;</a></span>val</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int node::val</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00012">12</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following files:<ul>
-<li>data_structures/<a class="el" href="../../d3/d26/binary__search__tree_8cpp.html">binary_search_tree.cpp</a></li>
-<li>data_structures/<b>circular_queue_using_linked_list.cpp</b></li>
+<li>data_structures/<a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html">circular_queue_using_linked_list.cpp</a></li>
 <li>data_structures/cll/<a class="el" href="../../d7/dba/cll_8h_source.html">cll.h</a></li>
-<li>data_structures/<b>doubly_linked_list.cpp</b></li>
-<li>data_structures/<b>queue_using_linked_list.cpp</b></li>
-<li>data_structures/<b>rb_tree.cpp</b></li>
-<li>data_structures/<b>stack_using_linked_list.cpp</b></li>
-<li>data_structures/<b>tree.cpp</b></li>
-<li>operations_on_datastructures/<b>reverse_a_linked_list_using_recusion.cpp</b></li>
-<li>operations_on_datastructures/<b>selectionsortlinkedlist.cpp</b></li>
+<li>data_structures/<a class="el" href="../../d7/d85/doubly__linked__list_8cpp_source.html">doubly_linked_list.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d8/db7/queue__using__linked__list_8cpp_source.html">queue_using_linked_list.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d3/dea/stack__using__linked__list_8cpp_source.html">stack_using_linked_list.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d1/d12/tree_8cpp_source.html">tree.cpp</a></li>
+<li>operations_on_datastructures/<a class="el" href="../../d8/d30/reverse__a__linked__list__using__recusion_8cpp_source.html">reverse_a_linked_list_using_recusion.cpp</a></li>
+<li>operations_on_datastructures/<a class="el" href="../../d9/dcc/selectionsortlinkedlist_8cpp_source.html">selectionsortlinkedlist.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d5/da7/namespacejarvis.html b/d5/da7/namespacejarvis.html
index 215000c35..d0d795e52 100644
--- a/d5/da7/namespacejarvis.html
+++ b/d5/da7/namespacejarvis.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: jarvis Namespace Reference</title>
+<title>TheAlgorithms/C++: jarvis Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d5/dab/structdata__structures_1_1list__array_1_1list.html b/d5/dab/structdata__structures_1_1list__array_1_1list.html
index 5e2aab232..5e3150a54 100644
--- a/d5/dab/structdata__structures_1_1list__array_1_1list.html
+++ b/d5/dab/structdata__structures_1_1list__array_1_1list.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::list_array::list&lt; N &gt; Struct Template Reference</title>
+<title>TheAlgorithms/C++: data_structures::list_array::list&lt; N &gt; Struct Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -117,15 +134,15 @@ $(function(){initNavTree('d5/dab/structdata__structures_1_1list__array_1_1list.h
 <div class="dynheader">
 Collaboration diagram for data_structures::list_array::list&lt; N &gt;:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.svg" width="147" height="244"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.svg" width="147" height="155"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:a412bdb3910181f3c384d86aee7e217cf" id="r_a412bdb3910181f3c384d86aee7e217cf"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a412bdb3910181f3c384d86aee7e217cf">BinarySearch</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;first, const uint64_t &amp;last, const uint64_t &amp;val)</td></tr>
+<tr class="memitem:a412bdb3910181f3c384d86aee7e217cf" id="r_a412bdb3910181f3c384d86aee7e217cf"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a412bdb3910181f3c384d86aee7e217cf">BinarySearch</a> (const std::array&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;first, const uint64_t &amp;last, const uint64_t &amp;val)</td></tr>
 <tr class="memdesc:a412bdb3910181f3c384d86aee7e217cf"><td class="mdescLeft">&#160;</td><td class="mdescRight">Search an element in the list using binarySearch.  <br /></td></tr>
 <tr class="separator:a412bdb3910181f3c384d86aee7e217cf"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad202ae68fe8d98082afa9dafea9e22b9" id="r_ad202ae68fe8d98082afa9dafea9e22b9"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad202ae68fe8d98082afa9dafea9e22b9">LinearSearch</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;val) const</td></tr>
+<tr class="memitem:ad202ae68fe8d98082afa9dafea9e22b9" id="r_ad202ae68fe8d98082afa9dafea9e22b9"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad202ae68fe8d98082afa9dafea9e22b9">LinearSearch</a> (const std::array&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;val) const</td></tr>
 <tr class="memdesc:ad202ae68fe8d98082afa9dafea9e22b9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Search an element using linear search.  <br /></td></tr>
 <tr class="separator:ad202ae68fe8d98082afa9dafea9e22b9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a0b5d794b245ba8e126220171cc8ef7fb" id="r_a0b5d794b245ba8e126220171cc8ef7fb"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0b5d794b245ba8e126220171cc8ef7fb">search</a> (const uint64_t &amp;val)</td></tr>
@@ -145,18 +162,18 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a0c9737eb5b4938531d3633b4915e9e00" id="r_a0c9737eb5b4938531d3633b4915e9e00"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0c9737eb5b4938531d3633b4915e9e00">data</a> {}</td></tr>
+<tr class="memitem:a0c9737eb5b4938531d3633b4915e9e00" id="r_a0c9737eb5b4938531d3633b4915e9e00"><td class="memItemLeft" align="right" valign="top">std::array&lt; uint64_t, N &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0c9737eb5b4938531d3633b4915e9e00">data</a> {}</td></tr>
 <tr class="separator:a0c9737eb5b4938531d3633b4915e9e00"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad6835623d5397d0c22e68bf0cdd7c3dc" id="r_ad6835623d5397d0c22e68bf0cdd7c3dc"><td class="memItemLeft" align="right" valign="top"><a id="ad6835623d5397d0c22e68bf0cdd7c3dc" name="ad6835623d5397d0c22e68bf0cdd7c3dc"></a>
-uint64_t&#160;</td><td class="memItemRight" valign="bottom"><b>top</b> = 0</td></tr>
+<tr class="memitem:ad6835623d5397d0c22e68bf0cdd7c3dc" id="r_ad6835623d5397d0c22e68bf0cdd7c3dc"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad6835623d5397d0c22e68bf0cdd7c3dc">top</a> = 0</td></tr>
 <tr class="separator:ad6835623d5397d0c22e68bf0cdd7c3dc"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a02fb664c4f6f50459e103a1433f8a3d1" id="r_a02fb664c4f6f50459e103a1433f8a3d1"><td class="memItemLeft" align="right" valign="top"><a id="a02fb664c4f6f50459e103a1433f8a3d1" name="a02fb664c4f6f50459e103a1433f8a3d1"></a>
-bool&#160;</td><td class="memItemRight" valign="bottom"><b>isSorted</b> = false</td></tr>
+<tr class="memitem:a02fb664c4f6f50459e103a1433f8a3d1" id="r_a02fb664c4f6f50459e103a1433f8a3d1"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a02fb664c4f6f50459e103a1433f8a3d1">isSorted</a> = false</td></tr>
 <tr class="separator:a02fb664c4f6f50459e103a1433f8a3d1"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><div class="compoundTemplParams">template&lt;uint64_t N&gt;<br />
 struct data_structures::list_array::list&lt; N &gt;</div><p>Structure of List with supporting methods. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d00/list__array_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../d7/d00/list__array_8cpp_source.html">list_array.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="a412bdb3910181f3c384d86aee7e217cf" name="a412bdb3910181f3c384d86aee7e217cf"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a412bdb3910181f3c384d86aee7e217cf">&#9670;&#160;</a></span>BinarySearch()</h2>
@@ -172,7 +189,7 @@ template&lt;uint64_t N&gt; </div>
         <tr>
           <td class="memname">uint64_t <a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a>&lt; N &gt;::BinarySearch </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>dataArr</em></span>, </td>
+          <td class="paramtype">const std::array&lt; uint64_t, N &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>dataArr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -208,6 +225,8 @@ template&lt;uint64_t N&gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>index of element in the list if present else -1 </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d00/list__array_8cpp_source.html#l00049">49</a> of file <a class="el" href="../../d7/d00/list__array_8cpp_source.html">list_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   51</span>                                               {</div>
 <div class="line"><span class="lineno">   52</span>        <span class="comment">// If both pointer cross each other means no element present in the list</span></div>
 <div class="line"><span class="lineno">   53</span>        <span class="comment">// which is equal to the val</span></div>
@@ -227,17 +246,11 @@ template&lt;uint64_t N&gt; </div>
 <div class="line"><span class="lineno">   67</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (val &gt; dataArr[mid])</div>
 <div class="line"><span class="lineno">   68</span>            <span class="keywordflow">return</span> (<a class="code hl_function" href="#a412bdb3910181f3c384d86aee7e217cf">BinarySearch</a>(dataArr, mid + 1, last, val));</div>
 <div class="line"><span class="lineno">   69</span> </div>
-<div class="line"><span class="lineno">   70</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;:&quot;</span> &lt;&lt; __LINE__ &lt;&lt; <span class="stringliteral">&quot;: Undefined condition\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   70</span>        std::cerr &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;:&quot;</span> &lt;&lt; __LINE__ &lt;&lt; <span class="stringliteral">&quot;: Undefined condition\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   71</span>        <span class="keywordflow">return</span> -1;</div>
 <div class="line"><span class="lineno">   72</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::cerr</a></div></div>
-<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a412bdb3910181f3c384d86aee7e217cf"><div class="ttname"><a href="#a412bdb3910181f3c384d86aee7e217cf">data_structures::list_array::list::BinarySearch</a></div><div class="ttdeci">uint64_t BinarySearch(const std::array&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;first, const uint64_t &amp;last, const uint64_t &amp;val)</div><div class="ttdoc">Search an element in the list using binarySearch.</div><div class="ttdef"><b>Definition</b> list_array.cpp:49</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph.svg" width="179" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a412bdb3910181f3c384d86aee7e217cf"><div class="ttname"><a href="#a412bdb3910181f3c384d86aee7e217cf">data_structures::list_array::list::BinarySearch</a></div><div class="ttdeci">uint64_t BinarySearch(const std::array&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;first, const uint64_t &amp;last, const uint64_t &amp;val)</div><div class="ttdoc">Search an element in the list using binarySearch.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d00/list__array_8cpp_source.html#l00049">list_array.cpp:49</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa960d714d449612f25256850d72325f1" name="aa960d714d449612f25256850d72325f1"></a>
@@ -273,10 +286,12 @@ template&lt;uint64_t N&gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d00/list__array_8cpp_source.html#l00143">143</a> of file <a class="el" href="../../d7/d00/list__array_8cpp_source.html">list_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  143</span>                                     {</div>
 <div class="line"><span class="lineno">  144</span>        <span class="comment">// overflow check</span></div>
 <div class="line"><span class="lineno">  145</span>        <span class="keywordflow">if</span> (top == N) {</div>
-<div class="line"><span class="lineno">  146</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nOverflow&quot;</span>;</div>
+<div class="line"><span class="lineno">  146</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nOverflow&quot;</span>;</div>
 <div class="line"><span class="lineno">  147</span>            <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  148</span>        }</div>
 <div class="line"><span class="lineno">  149</span>        <span class="comment">// if list is not sorted, insert at the last</span></div>
@@ -324,7 +339,7 @@ template&lt;uint64_t N&gt; </div>
         <tr>
           <td class="memname">uint64_t <a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a>&lt; N &gt;::LinearSearch </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint64_t, N &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>dataArr</em></span>, </td>
+          <td class="paramtype">const std::array&lt; uint64_t, N &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>dataArr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -348,6 +363,8 @@ template&lt;uint64_t N&gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>index of element in the list if present else -1 </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d00/list__array_8cpp_source.html#l00080">80</a> of file <a class="el" href="../../d7/d00/list__array_8cpp_source.html">list_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   81</span>                                                     {</div>
 <div class="line"><span class="lineno">   82</span>        <span class="comment">// Going through each element in the list</span></div>
 <div class="line"><span class="lineno">   83</span>        <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; top; i++) {</div>
@@ -394,14 +411,16 @@ template&lt;uint64_t N&gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d00/list__array_8cpp_source.html#l00183">183</a> of file <a class="el" href="../../d7/d00/list__array_8cpp_source.html">list_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  183</span>                                     {</div>
 <div class="line"><span class="lineno">  184</span>        uint64_t pos = <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>(val);  <span class="comment">// search the index of the value</span></div>
 <div class="line"><span class="lineno">  185</span>        <span class="comment">// if search returns -1, element does not present in the list</span></div>
 <div class="line"><span class="lineno">  186</span>        <span class="keywordflow">if</span> (pos == -1) {</div>
-<div class="line"><span class="lineno">  187</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n Element does not present in the list &quot;</span>;</div>
+<div class="line"><span class="lineno">  187</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\n Element does not present in the list &quot;</span>;</div>
 <div class="line"><span class="lineno">  188</span>            <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  189</span>        }</div>
-<div class="line"><span class="lineno">  190</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span></div>
+<div class="line"><span class="lineno">  190</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span></div>
 <div class="line"><span class="lineno">  191</span>                  &lt;&lt; data[pos] &lt;&lt; <span class="stringliteral">&quot; deleted&quot;</span>;  <span class="comment">// print the appropriate message</span></div>
 <div class="line"><span class="lineno">  192</span>        <span class="comment">// shift all the element 1 left to fill vacant space</span></div>
 <div class="line"><span class="lineno">  193</span>        <span class="keywordflow">for</span> (uint64_t i = pos; i &lt; top; i++) {</div>
@@ -409,8 +428,8 @@ template&lt;uint64_t N&gt; </div>
 <div class="line"><span class="lineno">  195</span>        }</div>
 <div class="line"><span class="lineno">  196</span>        top--;  <span class="comment">// decrement the top variable to maintain last index</span></div>
 <div class="line"><span class="lineno">  197</span>    }</div>
-<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
-<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> binary_search.cpp:47</div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> <a href="../../df/dd5/binary__search_8cpp_source.html#l00047">binary_search.cpp:47</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -438,6 +457,8 @@ template&lt;uint64_t N&gt; </div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d00/list__array_8cpp_source.html#l00097">97</a> of file <a class="el" href="../../d7/d00/list__array_8cpp_source.html">list_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   97</span>                                         {</div>
 <div class="line"><span class="lineno">   98</span>        uint64_t pos;  <span class="comment">// pos variable to store index value of element.</span></div>
 <div class="line"><span class="lineno">   99</span>        <span class="comment">// if list is sorted, binary search works efficiently else linear search</span></div>
@@ -450,14 +471,14 @@ template&lt;uint64_t N&gt; </div>
 <div class="line"><span class="lineno">  106</span>        <span class="comment">// if index is equal to -1 means element does not present</span></div>
 <div class="line"><span class="lineno">  107</span>        <span class="comment">// else print the index of that element</span></div>
 <div class="line"><span class="lineno">  108</span>        <span class="keywordflow">if</span> (pos != -1) {</div>
-<div class="line"><span class="lineno">  109</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nElement found at position : &quot;</span> &lt;&lt; pos;</div>
+<div class="line"><span class="lineno">  109</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nElement found at position : &quot;</span> &lt;&lt; pos;</div>
 <div class="line"><span class="lineno">  110</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  111</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nElement not found&quot;</span>;</div>
+<div class="line"><span class="lineno">  111</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nElement not found&quot;</span>;</div>
 <div class="line"><span class="lineno">  112</span>        }</div>
 <div class="line"><span class="lineno">  113</span>        <span class="comment">// return the index of element or -1.</span></div>
 <div class="line"><span class="lineno">  114</span>        <span class="keywordflow">return</span> pos;</div>
 <div class="line"><span class="lineno">  115</span>    }</div>
-<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_ad202ae68fe8d98082afa9dafea9e22b9"><div class="ttname"><a href="#ad202ae68fe8d98082afa9dafea9e22b9">data_structures::list_array::list::LinearSearch</a></div><div class="ttdeci">uint64_t LinearSearch(const std::array&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;val) const</div><div class="ttdoc">Search an element using linear search.</div><div class="ttdef"><b>Definition</b> list_array.cpp:80</div></div>
+<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_ad202ae68fe8d98082afa9dafea9e22b9"><div class="ttname"><a href="#ad202ae68fe8d98082afa9dafea9e22b9">data_structures::list_array::list::LinearSearch</a></div><div class="ttdeci">uint64_t LinearSearch(const std::array&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;val) const</div><div class="ttdoc">Search an element using linear search.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d00/list__array_8cpp_source.html#l00080">list_array.cpp:80</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -488,11 +509,13 @@ template&lt;uint64_t N&gt; </div>
 
 <p>Utility function to print array. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d00/list__array_8cpp_source.html#l00203">203</a> of file <a class="el" href="../../d7/d00/list__array_8cpp_source.html">list_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  203</span>                {</div>
 <div class="line"><span class="lineno">  204</span>        <span class="comment">// Going through each element in the list</span></div>
-<div class="line"><span class="lineno">  205</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><span class="lineno">  205</span>        std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
 <div class="line"><span class="lineno">  206</span>        <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; top; i++) {</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> &lt;&lt; data[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;  <span class="comment">// print the element</span></div>
+<div class="line"><span class="lineno">  207</span>            std::cout &lt;&lt; data[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;  <span class="comment">// print the element</span></div>
 <div class="line"><span class="lineno">  208</span>        }</div>
 <div class="line"><span class="lineno">  209</span>    }</div>
 </div><!-- fragment -->
@@ -525,6 +548,8 @@ template&lt;uint64_t N&gt; </div>
 
 <p>Sort the list. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d00/list__array_8cpp_source.html#l00121">121</a> of file <a class="el" href="../../d7/d00/list__array_8cpp_source.html">list_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  121</span>                {</div>
 <div class="line"><span class="lineno">  122</span>        <span class="comment">// Going through each element in the list</span></div>
 <div class="line"><span class="lineno">  123</span>        <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; top; i++) {</div>
@@ -536,18 +561,12 @@ template&lt;uint64_t N&gt; </div>
 <div class="line"><span class="lineno">  129</span>                }</div>
 <div class="line"><span class="lineno">  130</span>            }</div>
 <div class="line"><span class="lineno">  131</span>            <span class="comment">// swap min value and element at the ith index</span></div>
-<div class="line"><span class="lineno">  132</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(data[min_idx], data[i]);</div>
+<div class="line"><span class="lineno">  132</span>            std::swap(data[min_idx], data[i]);</div>
 <div class="line"><span class="lineno">  133</span>        }</div>
 <div class="line"><span class="lineno">  134</span>        <span class="comment">// mark isSorted variable as true</span></div>
 <div class="line"><span class="lineno">  135</span>        isSorted = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  136</span>    }</div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- 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="../../d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph.svg" width="274" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
@@ -560,16 +579,54 @@ Here is the call graph for this function:</div>
 template&lt;uint64_t N&gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;uint64_t, N&gt; <a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a>&lt; N &gt;::data {}</td>
+          <td class="memname">std::array&lt;uint64_t, N&gt; <a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a>&lt; N &gt;::data {}</td>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d00/list__array_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../d7/d00/list__array_8cpp_source.html">list_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   38</span>{};  <span class="comment">// Array that implement list</span></div>
 </div><!-- fragment -->
+</div>
+</div>
+<a id="a02fb664c4f6f50459e103a1433f8a3d1" name="a02fb664c4f6f50459e103a1433f8a3d1"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a02fb664c4f6f50459e103a1433f8a3d1">&#9670;&#160;</a></span>isSorted</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;uint64_t N&gt; </div>
+      <table class="memname">
+        <tr>
+          <td class="memname">bool <a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a>&lt; N &gt;::isSorted = false</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d00/list__array_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../d7/d00/list__array_8cpp_source.html">list_array.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ad6835623d5397d0c22e68bf0cdd7c3dc" name="ad6835623d5397d0c22e68bf0cdd7c3dc"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ad6835623d5397d0c22e68bf0cdd7c3dc">&#9670;&#160;</a></span>top</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;uint64_t N&gt; </div>
+      <table class="memname">
+        <tr>
+          <td class="memname">uint64_t <a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a>&lt; N &gt;::top = 0</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d00/list__array_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../d7/d00/list__array_8cpp_source.html">list_array.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../d7/d00/list__array_8cpp.html">list_array.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d7/d00/list__array_8cpp_source.html">list_array.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph.map b/d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph.map
deleted file mode 100644
index de7c82604..000000000
--- a/d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::list_array::list::sort" name="data_structures::list_array::list::sort">
-<area shape="rect" id="Node000001" title="Sort the list." alt="" coords="5,5,142,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="190,13,268,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="142,23,174,23,174,28,142,28"/>
-</map>
diff --git a/d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph.md5 b/d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph.md5
deleted file mode 100644
index edc85e051..000000000
--- a/d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0e12ea6bae13862c91418a8e57c78cd0
\ No newline at end of file
diff --git a/d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph.svg b/d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph.svg
deleted file mode 100644
index 663683bc4..000000000
--- a/d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::list_array::list::sort Pages: 1 -->
-<svg width="205pt" height="39pt"
- viewBox="0.00 0.00 205.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::list_array::list::sort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Sort the list.">
-<polygon fill="#999999" stroke="#666666" points="102.25,-30.5 0,-30.5 0,0 102.25,0 102.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="51.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::sort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197,-24.88 138.25,-24.88 138.25,-5.63 197,-5.63 197,-24.88"/>
-<text text-anchor="middle" x="167.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.68,-15.25C110.72,-15.25 118.93,-15.25 126.68,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.48,-18.75 136.48,-15.25 126.48,-11.75 126.48,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph_org.svg b/d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph_org.svg
deleted file mode 100644
index 0e8713a19..000000000
--- a/d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::list_array::list::sort Pages: 1 -->
-<svg width="205pt" height="39pt"
- viewBox="0.00 0.00 205.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::list_array::list::sort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Sort the list.">
-<polygon fill="#999999" stroke="#666666" points="102.25,-30.5 0,-30.5 0,0 102.25,0 102.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="51.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::sort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197,-24.88 138.25,-24.88 138.25,-5.63 197,-5.63 197,-24.88"/>
-<text text-anchor="middle" x="167.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.68,-15.25C110.72,-15.25 118.93,-15.25 126.68,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.48,-18.75 136.48,-15.25 126.48,-11.75 126.48,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph.map b/d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph.map
deleted file mode 100644
index d0742eb0d..000000000
--- a/d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="data_structures::list_array::list::BinarySearch" name="data_structures::list_array::list::BinarySearch">
-<area shape="rect" id="Node000001" title="Search an element in the list using binarySearch." alt="" coords="5,29,174,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="57,29,55,19,61,11,72,5,90,3,108,5,119,11,116,16,106,10,89,8,74,10,64,14,61,20,62,28"/>
-</map>
diff --git a/d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph.md5 b/d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph.md5
deleted file mode 100644
index ad0c1a583..000000000
--- a/d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ad17b5d8ce4a021cd9018ddd10baa4ce
\ No newline at end of file
diff --git a/d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph.svg b/d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph.svg
deleted file mode 100644
index 4551275fe..000000000
--- a/d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::list_array::list::BinarySearch Pages: 1 -->
-<svg width="134pt" height="57pt"
- viewBox="0.00 0.00 134.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>data_structures::list_array::list::BinarySearch</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Search an element in the list using binarySearch.">
-<polygon fill="#999999" stroke="#666666" points="126.25,-30.5 0,-30.5 0,0 126.25,0 126.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::BinarySearch</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.75,-30.99C36.19,-40.06 43.65,-48.5 63.12,-48.5 73.78,-48.5 80.84,-45.97 84.3,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.75,-42.81 85.34,-32.49 80.79,-42.06 87.75,-42.81"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph_org.svg b/d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph_org.svg
deleted file mode 100644
index 141163e66..000000000
--- a/d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::list_array::list::BinarySearch Pages: 1 -->
-<svg width="134pt" height="57pt"
- viewBox="0.00 0.00 134.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>data_structures::list_array::list::BinarySearch</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Search an element in the list using binarySearch.">
-<polygon fill="#999999" stroke="#666666" points="126.25,-30.5 0,-30.5 0,0 126.25,0 126.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::BinarySearch</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.75,-30.99C36.19,-40.06 43.65,-48.5 63.12,-48.5 73.78,-48.5 80.84,-45.97 84.3,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.75,-42.81 85.34,-32.49 80.79,-42.06 87.75,-42.81"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/db0/adaline__learning_8cpp.html b/d5/db0/adaline__learning_8cpp.html
index 12c6ea2aa..90269401d 100644
--- a/d5/db0/adaline__learning_8cpp.html
+++ b/d5/db0/adaline__learning_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: machine_learning/adaline_learning.cpp File Reference</title>
+<title>TheAlgorithms/C++: machine_learning/adaline_learning.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -129,7 +146,9 @@ Include dependency graph for adaline_learning.cpp:</div>
 <div class="dyncontent">
 <div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d7/da7/adaline__learning_8cpp__incl.svg" width="100%" height="394"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
 </div>
-</div><table class="memberdecls">
+</div>
+<p><a href="../../d5/db0/adaline__learning_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d30/classmachine__learning_1_1adaline.html">machine_learning::adaline</a></td></tr>
@@ -167,6 +186,8 @@ Variables</h2></td></tr>
 \]
 </p>
 <p> where \(x_j\) are the input features of a sample, \(w_j\) are the coefficients of the linear function and \(\theta\) is a constant. If we know the \(w_j\), then for any given set of features, \(y\) can be computed. Computing the \(w_j\) is a supervised learning algorithm wherein a set of features and their corresponding outputs are given and weights are computed using stochastic gradient descent method. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html">adaline_learning.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a3c04138a5bfe5d72780bb7e82a18e627" name="a3c04138a5bfe5d72780bb7e82a18e627"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a3c04138a5bfe5d72780bb7e82a18e627">&#9670;&#160;</a></span>main()</h2>
@@ -187,43 +208,34 @@ Variables</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html#l00357">357</a> of file <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html">adaline_learning.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  357</span>                                {</div>
-<div class="line"><span class="lineno">  358</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>));  <span class="comment">// initialize random number generator</span></div>
+<div class="line"><span class="lineno">  358</span>    std::srand(std::time(<span class="keyword">nullptr</span>));  <span class="comment">// initialize random number generator</span></div>
 <div class="line"><span class="lineno">  359</span> </div>
 <div class="line"><span class="lineno">  360</span>    <span class="keywordtype">double</span> eta = 0.1;  <span class="comment">// default value of eta</span></div>
 <div class="line"><span class="lineno">  361</span>    <span class="keywordflow">if</span> (argc == 2) {   <span class="comment">// read eta value from commandline argument if present</span></div>
-<div class="line"><span class="lineno">  362</span>        eta = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strtof.html">strtof</a>(argv[1], <span class="keyword">nullptr</span>);</div>
+<div class="line"><span class="lineno">  362</span>        eta = strtof(argv[1], <span class="keyword">nullptr</span>);</div>
 <div class="line"><span class="lineno">  363</span>    }</div>
 <div class="line"><span class="lineno">  364</span> </div>
 <div class="line"><span class="lineno">  365</span>    <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>(eta);</div>
 <div class="line"><span class="lineno">  366</span> </div>
-<div class="line"><span class="lineno">  367</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Press ENTER to continue...&quot;</span> &lt;&lt; <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">  368</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a>.get();</div>
+<div class="line"><span class="lineno">  367</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Press ENTER to continue...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  368</span>    std::cin.get();</div>
 <div class="line"><span class="lineno">  369</span> </div>
 <div class="line"><span class="lineno">  370</span>    <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>(eta);</div>
 <div class="line"><span class="lineno">  371</span> </div>
-<div class="line"><span class="lineno">  372</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Press ENTER to continue...&quot;</span> &lt;&lt; <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">  373</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a>.get();</div>
+<div class="line"><span class="lineno">  372</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Press ENTER to continue...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  373</span>    std::cin.get();</div>
 <div class="line"><span class="lineno">  374</span> </div>
 <div class="line"><span class="lineno">  375</span>    <a class="code hl_function" href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a>(eta);</div>
 <div class="line"><span class="lineno">  376</span> </div>
 <div class="line"><span class="lineno">  377</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  378</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:187</div></div>
-<div class="ttc" id="adsu__path__compression_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-test implementations, 1st test.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:170</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="ahamiltons__cycle_8cpp_html_a0cc94918b6831f308d4fe4fa27f08299"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a></div><div class="ttdeci">static void test3()</div><div class="ttdef"><b>Definition</b> hamiltons_cycle.cpp:122</div></div>
-<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="astrtof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strtof.html">std::strtof</a></div><div class="ttdeci">T strtof(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00187">dsu_path_compression.cpp:187</a></div></div>
+<div class="ttc" id="adsu__path__compression_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-test implementations, 1st test.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00170">dsu_path_compression.cpp:170</a></div></div>
+<div class="ttc" id="ahamiltons__cycle_8cpp_html_a0cc94918b6831f308d4fe4fa27f08299"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a></div><div class="ttdeci">static void test3()</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d0c/hamiltons__cycle_8cpp_source.html#l00122">hamiltons_cycle.cpp:122</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a52053d88ea1bcbbed9aca67ab4eeb499" name="a52053d88ea1bcbbed9aca67ab4eeb499"></a>
@@ -246,46 +258,41 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html#l00224">224</a> of file <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html">adaline_learning.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  224</span>                              {</div>
 <div class="line"><span class="lineno">  225</span>    <a class="code hl_class" href="../../d6/d30/classmachine__learning_1_1adaline.html">adaline</a> ada(2, eta);  <span class="comment">// 2 features</span></div>
 <div class="line"><span class="lineno">  226</span> </div>
 <div class="line"><span class="lineno">  227</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 10;  <span class="comment">// number of sample points</span></div>
 <div class="line"><span class="lineno">  228</span> </div>
-<div class="line"><span class="lineno">  229</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::vector&lt;double&gt;</a>, <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>&gt; X = {</div>
-<div class="line"><span class="lineno">  230</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a>({0, 1}),   <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a>({1, -2}),</div>
-<div class="line"><span class="lineno">  231</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a>({2, 3}),   <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a>({3, -1}),</div>
-<div class="line"><span class="lineno">  232</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a>({4, 1}),   <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a>({6, -5}),</div>
-<div class="line"><span class="lineno">  233</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a>({-7, -3}), <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a>({-8, 5}),</div>
-<div class="line"><span class="lineno">  234</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a>({-9, 2}),  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a>({-10, -15})};</div>
-<div class="line"><span class="lineno">  235</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, N&gt;</a> y = {1,  -1, 1, -1, -1,</div>
+<div class="line"><span class="lineno">  229</span>    std::array&lt;std::vector&lt;double&gt;, <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>&gt; X = {</div>
+<div class="line"><span class="lineno">  230</span>        std::vector&lt;double&gt;({0, 1}),   std::vector&lt;double&gt;({1, -2}),</div>
+<div class="line"><span class="lineno">  231</span>        std::vector&lt;double&gt;({2, 3}),   std::vector&lt;double&gt;({3, -1}),</div>
+<div class="line"><span class="lineno">  232</span>        std::vector&lt;double&gt;({4, 1}),   std::vector&lt;double&gt;({6, -5}),</div>
+<div class="line"><span class="lineno">  233</span>        std::vector&lt;double&gt;({-7, -3}), std::vector&lt;double&gt;({-8, 5}),</div>
+<div class="line"><span class="lineno">  234</span>        std::vector&lt;double&gt;({-9, 2}),  std::vector&lt;double&gt;({-10, -15})};</div>
+<div class="line"><span class="lineno">  235</span>    std::array&lt;int, N&gt; y = {1,  -1, 1, -1, -1,</div>
 <div class="line"><span class="lineno">  236</span>                            -1, 1,  1, 1,  -1};  <span class="comment">// corresponding y-values</span></div>
 <div class="line"><span class="lineno">  237</span> </div>
-<div class="line"><span class="lineno">  238</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;------- Test 1 -------&quot;</span> &lt;&lt; <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">  239</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Model before fit: &quot;</span> &lt;&lt; ada &lt;&lt; <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">  238</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 1 -------&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  239</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Model before fit: &quot;</span> &lt;&lt; ada &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  240</span> </div>
 <div class="line"><span class="lineno">  241</span>    ada.fit&lt;<a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>&gt;(X, y);</div>
-<div class="line"><span class="lineno">  242</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Model after fit: &quot;</span> &lt;&lt; ada &lt;&lt; <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">  242</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Model after fit: &quot;</span> &lt;&lt; ada &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  243</span> </div>
 <div class="line"><span class="lineno">  244</span>    <span class="keywordtype">int</span> predict = ada.predict({5, -3});</div>
-<div class="line"><span class="lineno">  245</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Predict for x=(5,-3): &quot;</span> &lt;&lt; predict;</div>
+<div class="line"><span class="lineno">  245</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Predict for x=(5,-3): &quot;</span> &lt;&lt; predict;</div>
 <div class="line"><span class="lineno">  246</span>    assert(predict == -1);</div>
-<div class="line"><span class="lineno">  247</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; ...passed&quot;</span> &lt;&lt; <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">  247</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; ...passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  248</span> </div>
 <div class="line"><span class="lineno">  249</span>    predict = ada.predict({5, 8});</div>
-<div class="line"><span class="lineno">  250</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Predict for x=(5,8): &quot;</span> &lt;&lt; predict;</div>
+<div class="line"><span class="lineno">  250</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Predict for x=(5,8): &quot;</span> &lt;&lt; predict;</div>
 <div class="line"><span class="lineno">  251</span>    assert(predict == 1);</div>
-<div class="line"><span class="lineno">  252</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; ...passed&quot;</span> &lt;&lt; <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">  252</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; ...passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  253</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="aclassmachine__learning_1_1adaline_html"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html">machine_learning::adaline</a></div><div class="ttdef"><b>Definition</b> adaline_learning.cpp:46</div></div>
-<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</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>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.svg" width="100%" height="588"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassmachine__learning_1_1adaline_html"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html">machine_learning::adaline</a></div><div class="ttdef"><b>Definition</b> <a href="../../d5/db0/adaline__learning_8cpp_source.html#l00046">adaline_learning.cpp:46</a></div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a379f7488a305f2571f2932b319931f82" name="a379f7488a305f2571f2932b319931f82"></a>
@@ -308,52 +315,48 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html#l00262">262</a> of file <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html">adaline_learning.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  262</span>                              {</div>
 <div class="line"><span class="lineno">  263</span>    <a class="code hl_class" href="../../d6/d30/classmachine__learning_1_1adaline.html">adaline</a> ada(2, eta);  <span class="comment">// 2 features</span></div>
 <div class="line"><span class="lineno">  264</span> </div>
 <div class="line"><span class="lineno">  265</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 50;  <span class="comment">// number of sample points</span></div>
 <div class="line"><span class="lineno">  266</span> </div>
-<div class="line"><span class="lineno">  267</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::vector&lt;double&gt;</a>, <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>&gt; X;</div>
-<div class="line"><span class="lineno">  268</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, N&gt;</a> Y{};  <span class="comment">// corresponding y-values</span></div>
+<div class="line"><span class="lineno">  267</span>    std::array&lt;std::vector&lt;double&gt;, <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>&gt; X;</div>
+<div class="line"><span class="lineno">  268</span>    std::array&lt;int, N&gt; Y{};  <span class="comment">// corresponding y-values</span></div>
 <div class="line"><span class="lineno">  269</span> </div>
 <div class="line"><span class="lineno">  270</span>    <span class="comment">// generate sample points in the interval</span></div>
 <div class="line"><span class="lineno">  271</span>    <span class="comment">// [-range2/100 , (range2-1)/100]</span></div>
 <div class="line"><span class="lineno">  272</span>    <span class="keywordtype">int</span> range = 500;          <span class="comment">// sample points full-range</span></div>
 <div class="line"><span class="lineno">  273</span>    <span class="keywordtype">int</span> range2 = range &gt;&gt; 1;  <span class="comment">// sample points half-range</span></div>
 <div class="line"><span class="lineno">  274</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
-<div class="line"><span class="lineno">  275</span>        <span class="keywordtype">double</span> x0 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % range) - range2) / 100.f;</div>
-<div class="line"><span class="lineno">  276</span>        <span class="keywordtype">double</span> x1 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % range) - range2) / 100.f;</div>
-<div class="line"><span class="lineno">  277</span>        X[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a>({x0, x1});</div>
+<div class="line"><span class="lineno">  275</span>        <span class="keywordtype">double</span> x0 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
+<div class="line"><span class="lineno">  276</span>        <span class="keywordtype">double</span> x1 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
+<div class="line"><span class="lineno">  277</span>        X[i] = std::vector&lt;double&gt;({x0, x1});</div>
 <div class="line"><span class="lineno">  278</span>        Y[i] = (x0 + 3. * x1) &gt; -1 ? 1 : -1;</div>
 <div class="line"><span class="lineno">  279</span>    }</div>
 <div class="line"><span class="lineno">  280</span> </div>
-<div class="line"><span class="lineno">  281</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;------- Test 2 -------&quot;</span> &lt;&lt; <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">  282</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Model before fit: &quot;</span> &lt;&lt; ada &lt;&lt; <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">  281</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 2 -------&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  282</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Model before fit: &quot;</span> &lt;&lt; ada &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  283</span> </div>
 <div class="line"><span class="lineno">  284</span>    ada.fit(X, Y);</div>
-<div class="line"><span class="lineno">  285</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Model after fit: &quot;</span> &lt;&lt; ada &lt;&lt; <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">  285</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Model after fit: &quot;</span> &lt;&lt; ada &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  286</span> </div>
 <div class="line"><span class="lineno">  287</span>    <span class="keywordtype">int</span> N_test_cases = 5;</div>
 <div class="line"><span class="lineno">  288</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N_test_cases; i++) {</div>
-<div class="line"><span class="lineno">  289</span>        <span class="keywordtype">double</span> x0 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % range) - range2) / 100.f;</div>
-<div class="line"><span class="lineno">  290</span>        <span class="keywordtype">double</span> x1 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % range) - range2) / 100.f;</div>
+<div class="line"><span class="lineno">  289</span>        <span class="keywordtype">double</span> x0 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
+<div class="line"><span class="lineno">  290</span>        <span class="keywordtype">double</span> x1 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
 <div class="line"><span class="lineno">  291</span> </div>
 <div class="line"><span class="lineno">  292</span>        <span class="keywordtype">int</span> predict = ada.predict({x0, x1});</div>
 <div class="line"><span class="lineno">  293</span> </div>
-<div class="line"><span class="lineno">  294</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Predict for x=(&quot;</span> &lt;&lt; x0 &lt;&lt; <span class="stringliteral">&quot;,&quot;</span> &lt;&lt; x1 &lt;&lt; <span class="stringliteral">&quot;): &quot;</span> &lt;&lt; predict;</div>
+<div class="line"><span class="lineno">  294</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Predict for x=(&quot;</span> &lt;&lt; x0 &lt;&lt; <span class="stringliteral">&quot;,&quot;</span> &lt;&lt; x1 &lt;&lt; <span class="stringliteral">&quot;): &quot;</span> &lt;&lt; predict;</div>
 <div class="line"><span class="lineno">  295</span> </div>
 <div class="line"><span class="lineno">  296</span>        <span class="keywordtype">int</span> expected_val = (x0 + 3. * x1) &gt; -1 ? 1 : -1;</div>
 <div class="line"><span class="lineno">  297</span>        assert(predict == expected_val);</div>
-<div class="line"><span class="lineno">  298</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; ...passed&quot;</span> &lt;&lt; <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">  298</span>        std::cout &lt;&lt; <span class="stringliteral">&quot; ...passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  299</span>    }</div>
 <div class="line"><span class="lineno">  300</span>}</div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.svg" width="100%" height="588"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a992bdf1fdb0b9d414bcf7981d2d87aa9" name="a992bdf1fdb0b9d414bcf7981d2d87aa9"></a>
@@ -377,54 +380,51 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html#l00313">313</a> of file <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html">adaline_learning.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  313</span>                              {</div>
 <div class="line"><span class="lineno">  314</span>    <a class="code hl_class" href="../../d6/d30/classmachine__learning_1_1adaline.html">adaline</a> ada(6, eta);  <span class="comment">// 2 features</span></div>
 <div class="line"><span class="lineno">  315</span> </div>
 <div class="line"><span class="lineno">  316</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 100;  <span class="comment">// number of sample points</span></div>
 <div class="line"><span class="lineno">  317</span> </div>
-<div class="line"><span class="lineno">  318</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::vector&lt;double&gt;</a>, <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>&gt; X;</div>
-<div class="line"><span class="lineno">  319</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, N&gt;</a> Y{};  <span class="comment">// corresponding y-values</span></div>
+<div class="line"><span class="lineno">  318</span>    std::array&lt;std::vector&lt;double&gt;, <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>&gt; X;</div>
+<div class="line"><span class="lineno">  319</span>    std::array&lt;int, N&gt; Y{};  <span class="comment">// corresponding y-values</span></div>
 <div class="line"><span class="lineno">  320</span> </div>
 <div class="line"><span class="lineno">  321</span>    <span class="comment">// generate sample points in the interval</span></div>
 <div class="line"><span class="lineno">  322</span>    <span class="comment">// [-range2/100 , (range2-1)/100]</span></div>
 <div class="line"><span class="lineno">  323</span>    <span class="keywordtype">int</span> range = 200;          <span class="comment">// sample points full-range</span></div>
 <div class="line"><span class="lineno">  324</span>    <span class="keywordtype">int</span> range2 = range &gt;&gt; 1;  <span class="comment">// sample points half-range</span></div>
 <div class="line"><span class="lineno">  325</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
-<div class="line"><span class="lineno">  326</span>        <span class="keywordtype">double</span> x0 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % range) - range2) / 100.f;</div>
-<div class="line"><span class="lineno">  327</span>        <span class="keywordtype">double</span> x1 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % range) - range2) / 100.f;</div>
-<div class="line"><span class="lineno">  328</span>        <span class="keywordtype">double</span> x2 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % range) - range2) / 100.f;</div>
-<div class="line"><span class="lineno">  329</span>        X[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a>({x0, x1, x2, x0 * x0, x1 * x1, x2 * x2});</div>
+<div class="line"><span class="lineno">  326</span>        <span class="keywordtype">double</span> x0 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
+<div class="line"><span class="lineno">  327</span>        <span class="keywordtype">double</span> x1 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
+<div class="line"><span class="lineno">  328</span>        <span class="keywordtype">double</span> x2 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
+<div class="line"><span class="lineno">  329</span>        X[i] = std::vector&lt;double&gt;({x0, x1, x2, x0 * x0, x1 * x1, x2 * x2});</div>
 <div class="line"><span class="lineno">  330</span>        Y[i] = ((x0 * x0) + (x1 * x1) + (x2 * x2)) &lt;= 1.f ? 1 : -1;</div>
 <div class="line"><span class="lineno">  331</span>    }</div>
 <div class="line"><span class="lineno">  332</span> </div>
-<div class="line"><span class="lineno">  333</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;------- Test 3 -------&quot;</span> &lt;&lt; <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">  334</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Model before fit: &quot;</span> &lt;&lt; ada &lt;&lt; <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">  333</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 3 -------&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  334</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Model before fit: &quot;</span> &lt;&lt; ada &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  335</span> </div>
 <div class="line"><span class="lineno">  336</span>    ada.fit(X, Y);</div>
-<div class="line"><span class="lineno">  337</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Model after fit: &quot;</span> &lt;&lt; ada &lt;&lt; <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">  337</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Model after fit: &quot;</span> &lt;&lt; ada &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  338</span> </div>
 <div class="line"><span class="lineno">  339</span>    <span class="keywordtype">int</span> N_test_cases = 5;</div>
 <div class="line"><span class="lineno">  340</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N_test_cases; i++) {</div>
-<div class="line"><span class="lineno">  341</span>        <span class="keywordtype">double</span> x0 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % range) - range2) / 100.f;</div>
-<div class="line"><span class="lineno">  342</span>        <span class="keywordtype">double</span> x1 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % range) - range2) / 100.f;</div>
-<div class="line"><span class="lineno">  343</span>        <span class="keywordtype">double</span> x2 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % range) - range2) / 100.f;</div>
+<div class="line"><span class="lineno">  341</span>        <span class="keywordtype">double</span> x0 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
+<div class="line"><span class="lineno">  342</span>        <span class="keywordtype">double</span> x1 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
+<div class="line"><span class="lineno">  343</span>        <span class="keywordtype">double</span> x2 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
 <div class="line"><span class="lineno">  344</span> </div>
 <div class="line"><span class="lineno">  345</span>        <span class="keywordtype">int</span> predict = ada.predict({x0, x1, x2, x0 * x0, x1 * x1, x2 * x2});</div>
 <div class="line"><span class="lineno">  346</span> </div>
-<div class="line"><span class="lineno">  347</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Predict for x=(&quot;</span> &lt;&lt; x0 &lt;&lt; <span class="stringliteral">&quot;,&quot;</span> &lt;&lt; x1 &lt;&lt; <span class="stringliteral">&quot;,&quot;</span> &lt;&lt; x2</div>
+<div class="line"><span class="lineno">  347</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Predict for x=(&quot;</span> &lt;&lt; x0 &lt;&lt; <span class="stringliteral">&quot;,&quot;</span> &lt;&lt; x1 &lt;&lt; <span class="stringliteral">&quot;,&quot;</span> &lt;&lt; x2</div>
 <div class="line"><span class="lineno">  348</span>                  &lt;&lt; <span class="stringliteral">&quot;): &quot;</span> &lt;&lt; predict;</div>
 <div class="line"><span class="lineno">  349</span> </div>
 <div class="line"><span class="lineno">  350</span>        <span class="keywordtype">int</span> expected_val = ((x0 * x0) + (x1 * x1) + (x2 * x2)) &lt;= 1.f ? 1 : -1;</div>
 <div class="line"><span class="lineno">  351</span>        assert(predict == expected_val);</div>
-<div class="line"><span class="lineno">  352</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; ...passed&quot;</span> &lt;&lt; <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">  352</span>        std::cout &lt;&lt; <span class="stringliteral">&quot; ...passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  353</span>    }</div>
 <div class="line"><span class="lineno">  354</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.svg" width="100%" height="588"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.map b/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.map
deleted file mode 100644
index 85ced03e6..000000000
--- a/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.map
+++ /dev/null
@@ -1,29 +0,0 @@
-<map id="test2" name="test2">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,115,56,140"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="803,5,874,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="44,112,70,92,103,74,169,50,226,34,278,25,327,19,430,16,561,10,683,8,787,12,787,17,683,13,561,15,430,21,327,25,279,30,228,40,171,56,105,79,73,97,48,116"/>
-<area shape="rect" id="Node000003" href="$d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5" title=" " alt="" coords="104,89,294,115"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,121,94,115,95,121,57,126"/>
-<area shape="rect" id="Node000006" href="$d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3" title=" " alt="" coords="342,160,513,201"/>
-<area shape="poly" id="edge14_Node000001_Node000006" title=" " alt="" coords="56,128,327,165,326,170,56,133"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="163,191,235,216"/>
-<area shape="poly" id="edge15_Node000001_Node000012" title=" " alt="" coords="52,138,105,169,149,186,147,191,103,174,49,143"/>
-<area shape="rect" id="Node000004" href="$d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56" title=" " alt="" coords="561,24,733,65"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="294,87,342,81,546,55,546,60,342,86,295,92"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="781,59,896,84"/>
-<area shape="poly" id="edge13_Node000003_Node000005" title=" " alt="" coords="294,95,733,74,765,73,765,78,733,79,295,100"/>
-<area shape="poly" id="edge6_Node000003_Node000006" title=" " alt="" coords="241,113,295,132,354,152,352,157,293,137,239,118"/>
-<area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="733,30,787,23,787,28,734,35"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="734,54,766,59,765,64,733,59"/>
-<area shape="poly" id="edge10_Node000006_Node000004" title=" " alt="" coords="461,158,598,72,601,76,464,162"/>
-<area shape="rect" id="Node000007" href="$d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325" title=" " alt="" coords="561,338,733,378"/>
-<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="445,200,493,261,526,294,563,324,569,328,566,333,560,328,522,298,489,264,441,203"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="587,140,707,166"/>
-<area shape="poly" id="edge8_Node000006_Node000008" title=" " alt="" coords="513,167,572,160,573,165,514,173"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="586,189,708,215"/>
-<area shape="poly" id="edge9_Node000006_Node000009" title=" " alt="" coords="514,186,571,192,570,197,513,192"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="591,239,703,264"/>
-<area shape="poly" id="edge11_Node000006_Node000010" title=" " alt="" coords="487,199,562,225,583,231,581,236,561,230,485,204"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/inner_product.html#" title=" " alt="" coords="584,288,710,314"/>
-<area shape="poly" id="edge12_Node000006_Node000011" title=" " alt="" coords="454,200,502,238,563,274,575,280,572,285,560,279,499,242,451,204"/>
-</map>
diff --git a/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.md5 b/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.md5
deleted file mode 100644
index c4b72a4e0..000000000
--- a/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fcfb426b22da23ecec76dd183714e158
\ No newline at end of file
diff --git a/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.svg b/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.svg
deleted file mode 100644
index eafce6520..000000000
--- a/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.svg
+++ /dev/null
@@ -1,341 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<!--zoomable 288 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 676;
-var viewHeight = 288;
-var sectionId = 'dynsection-3';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-197.88 0,-197.88 0,-178.62 37.75,-178.62 37.75,-197.88"/>
-<text text-anchor="middle" x="18.88" y="-184.38" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="651.5,-279.88 598,-279.88 598,-260.62 651.5,-260.62 651.5,-279.88"/>
-<text text-anchor="middle" x="624.75" y="-266.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.51,-198.11C40.77,-207.01 57.15,-219.68 73.75,-226.25 216.99,-282.9 263.33,-263.56 417,-274.25 476,-278.36 544.68,-275.52 586.15,-272.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="586.34,-276.47 596.09,-272.34 585.89,-269.49 586.34,-276.47"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-216.88 73.75,-216.88 73.75,-197.62 216.5,-197.62 216.5,-216.88"/>
-<text text-anchor="middle" x="145.12" y="-203.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline::fit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.21,-191.05C46.22,-192.28 56.22,-193.81 66.85,-195.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.18,-198.87 76.59,-196.92 67.24,-191.95 66.18,-198.87"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="381,-163.5 252.5,-163.5 252.5,-133 381,-133 381,-163.5"/>
-<text text-anchor="start" x="260.5" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="316.75" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">::predict</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge14_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge14_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-185.81C77.34,-180.48 172.91,-167.56 240.93,-158.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="241.08,-161.88 250.52,-157.07 240.14,-154.94 241.08,-161.88"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="172.25,-140.88 118,-140.88 118,-121.62 172.25,-121.62 172.25,-140.88"/>
-<text text-anchor="middle" x="145.12" y="-127.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge15_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge15_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.02,-178.39C44.62,-171.3 59.65,-161.87 73.75,-155.25 84.16,-150.36 95.84,-145.97 106.65,-142.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="107.64,-145.68 116.07,-139.26 105.48,-139.02 107.64,-145.68"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="545.5,-265.5 417,-265.5 417,-235 545.5,-235 545.5,-265.5"/>
-<text text-anchor="start" x="425" y="-252" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="481.25" y="-240.75" font-family="Helvetica,sans-Serif" font-size="10.00">::check_size_match</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.79,-216.59C228.71,-218.16 240.95,-219.76 252.5,-221.25 303.59,-227.86 361.15,-235.19 405.62,-240.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="405.06,-244.28 415.42,-242.07 405.94,-237.34 405.06,-244.28"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="668,-239.88 581.5,-239.88 581.5,-220.62 668,-220.62 668,-239.88"/>
-<text text-anchor="middle" x="624.75" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge13_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge13_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.83,-210.54C296.65,-214.27 430.41,-220.57 545.5,-226.25 553.35,-226.64 561.64,-227.05 569.78,-227.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="569.43,-230.95 579.6,-227.97 569.79,-223.96 569.43,-230.95"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.94,-197.16C188.47,-192.9 203.21,-187.86 216.5,-183.25 230.94,-178.24 246.55,-172.77 261.01,-167.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.12,-170.99 270.38,-164.36 259.79,-164.39 262.12,-170.99"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M545.96,-259.26C559.75,-261.2 573.9,-263.2 586.28,-264.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="585.65,-268.4 596.05,-266.33 586.63,-261.47 585.65,-268.4"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M545.96,-241.24C553.95,-240.12 562.05,-238.97 569.87,-237.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="570.15,-241.36 579.56,-236.5 569.17,-234.43 570.15,-241.36"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge10_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge10_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M342.78,-163.96C370.34,-181.26 414.81,-209.18 445.68,-228.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="443.57,-231.36 453.91,-233.71 447.3,-225.43 443.57,-231.36"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="545.5,-30.5 417,-30.5 417,0 545.5,0 545.5,-30.5"/>
-<text text-anchor="start" x="425" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="481.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::activation</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M328.18,-132.76C344.57,-109.49 378.49,-65.45 417,-39.25 418.57,-38.18 420.19,-37.15 421.86,-36.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.21,-39.41 430.4,-31.62 419.93,-33.22 423.21,-39.41"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="526,-178.88 436.5,-178.88 436.5,-159.62 526,-159.62 526,-178.88"/>
-<text text-anchor="middle" x="481.25" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge8_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge8_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.04,-156.43C395.67,-158.32 411.11,-160.32 425.35,-162.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="424.6,-165.59 434.96,-163.4 425.49,-158.64 424.6,-165.59"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="527.12,-141.88 435.38,-141.88 435.38,-122.62 527.12,-122.62 527.12,-141.88"/>
-<text text-anchor="middle" x="481.25" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge9_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge9_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.04,-142.02C395.11,-140.63 409.92,-139.17 423.7,-137.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.87,-141.32 433.48,-136.86 423.18,-134.35 423.87,-141.32"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="523.38,-104.88 439.12,-104.88 439.12,-85.62 523.38,-85.62 523.38,-104.88"/>
-<text text-anchor="middle" x="481.25" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge11_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge11_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M360.55,-132.51C377.98,-126.27 398.37,-119.18 417,-113.25 422.04,-111.65 427.32,-110.03 432.6,-108.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="433.27,-111.92 441.89,-105.76 431.31,-105.2 433.27,-111.92"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="528.25,-67.88 434.25,-67.88 434.25,-48.62 528.25,-48.62 528.25,-67.88"/>
-<text text-anchor="middle" x="481.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::inner_product</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge12_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge12_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M335.17,-132.65C354.09,-116.46 385.79,-91.42 417,-76.25 419.94,-74.82 423.01,-73.49 426.14,-72.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="427.31,-75.55 435.54,-68.88 424.95,-68.96 427.31,-75.55"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph_org.svg b/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph_org.svg
deleted file mode 100644
index 5108d8928..000000000
--- a/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph_org.svg
+++ /dev/null
@@ -1,258 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="676pt" height="288pt"
- viewBox="0.00 0.00 676.00 287.88" 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 283.88)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-197.88 0,-197.88 0,-178.62 37.75,-178.62 37.75,-197.88"/>
-<text text-anchor="middle" x="18.88" y="-184.38" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="651.5,-279.88 598,-279.88 598,-260.62 651.5,-260.62 651.5,-279.88"/>
-<text text-anchor="middle" x="624.75" y="-266.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.51,-198.11C40.77,-207.01 57.15,-219.68 73.75,-226.25 216.99,-282.9 263.33,-263.56 417,-274.25 476,-278.36 544.68,-275.52 586.15,-272.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="586.34,-276.47 596.09,-272.34 585.89,-269.49 586.34,-276.47"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-216.88 73.75,-216.88 73.75,-197.62 216.5,-197.62 216.5,-216.88"/>
-<text text-anchor="middle" x="145.12" y="-203.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline::fit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.21,-191.05C46.22,-192.28 56.22,-193.81 66.85,-195.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.18,-198.87 76.59,-196.92 67.24,-191.95 66.18,-198.87"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="381,-163.5 252.5,-163.5 252.5,-133 381,-133 381,-163.5"/>
-<text text-anchor="start" x="260.5" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="316.75" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">::predict</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge14_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge14_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-185.81C77.34,-180.48 172.91,-167.56 240.93,-158.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="241.08,-161.88 250.52,-157.07 240.14,-154.94 241.08,-161.88"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="172.25,-140.88 118,-140.88 118,-121.62 172.25,-121.62 172.25,-140.88"/>
-<text text-anchor="middle" x="145.12" y="-127.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge15_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge15_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.02,-178.39C44.62,-171.3 59.65,-161.87 73.75,-155.25 84.16,-150.36 95.84,-145.97 106.65,-142.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="107.64,-145.68 116.07,-139.26 105.48,-139.02 107.64,-145.68"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="545.5,-265.5 417,-265.5 417,-235 545.5,-235 545.5,-265.5"/>
-<text text-anchor="start" x="425" y="-252" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="481.25" y="-240.75" font-family="Helvetica,sans-Serif" font-size="10.00">::check_size_match</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.79,-216.59C228.71,-218.16 240.95,-219.76 252.5,-221.25 303.59,-227.86 361.15,-235.19 405.62,-240.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="405.06,-244.28 415.42,-242.07 405.94,-237.34 405.06,-244.28"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="668,-239.88 581.5,-239.88 581.5,-220.62 668,-220.62 668,-239.88"/>
-<text text-anchor="middle" x="624.75" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge13_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge13_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.83,-210.54C296.65,-214.27 430.41,-220.57 545.5,-226.25 553.35,-226.64 561.64,-227.05 569.78,-227.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="569.43,-230.95 579.6,-227.97 569.79,-223.96 569.43,-230.95"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.94,-197.16C188.47,-192.9 203.21,-187.86 216.5,-183.25 230.94,-178.24 246.55,-172.77 261.01,-167.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.12,-170.99 270.38,-164.36 259.79,-164.39 262.12,-170.99"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M545.96,-259.26C559.75,-261.2 573.9,-263.2 586.28,-264.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="585.65,-268.4 596.05,-266.33 586.63,-261.47 585.65,-268.4"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M545.96,-241.24C553.95,-240.12 562.05,-238.97 569.87,-237.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="570.15,-241.36 579.56,-236.5 569.17,-234.43 570.15,-241.36"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge10_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge10_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M342.78,-163.96C370.34,-181.26 414.81,-209.18 445.68,-228.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="443.57,-231.36 453.91,-233.71 447.3,-225.43 443.57,-231.36"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="545.5,-30.5 417,-30.5 417,0 545.5,0 545.5,-30.5"/>
-<text text-anchor="start" x="425" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="481.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::activation</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M328.18,-132.76C344.57,-109.49 378.49,-65.45 417,-39.25 418.57,-38.18 420.19,-37.15 421.86,-36.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.21,-39.41 430.4,-31.62 419.93,-33.22 423.21,-39.41"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="526,-178.88 436.5,-178.88 436.5,-159.62 526,-159.62 526,-178.88"/>
-<text text-anchor="middle" x="481.25" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge8_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge8_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.04,-156.43C395.67,-158.32 411.11,-160.32 425.35,-162.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="424.6,-165.59 434.96,-163.4 425.49,-158.64 424.6,-165.59"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="527.12,-141.88 435.38,-141.88 435.38,-122.62 527.12,-122.62 527.12,-141.88"/>
-<text text-anchor="middle" x="481.25" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge9_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge9_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.04,-142.02C395.11,-140.63 409.92,-139.17 423.7,-137.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.87,-141.32 433.48,-136.86 423.18,-134.35 423.87,-141.32"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="523.38,-104.88 439.12,-104.88 439.12,-85.62 523.38,-85.62 523.38,-104.88"/>
-<text text-anchor="middle" x="481.25" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge11_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge11_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M360.55,-132.51C377.98,-126.27 398.37,-119.18 417,-113.25 422.04,-111.65 427.32,-110.03 432.6,-108.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="433.27,-111.92 441.89,-105.76 431.31,-105.2 433.27,-111.92"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="528.25,-67.88 434.25,-67.88 434.25,-48.62 528.25,-48.62 528.25,-67.88"/>
-<text text-anchor="middle" x="481.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::inner_product</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge12_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge12_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M335.17,-132.65C354.09,-116.46 385.79,-91.42 417,-76.25 419.94,-74.82 423.01,-73.49 426.14,-72.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="427.31,-75.55 435.54,-68.88 424.95,-68.96 427.31,-75.55"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
deleted file mode 100644
index 4b74a5ea5..000000000
--- a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
+++ /dev/null
@@ -1,50 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,205,55,231"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="107,81,178,107"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="36,204,62,162,101,116,102,115,106,119,105,120,66,165,41,206"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="103,131,182,156"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="48,203,101,165,105,163,108,167,104,170,51,207"/>
-<area shape="rect" id="Node000004" href="$d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" title="Self&#45;test implementations, 1st test." alt="" coords="117,180,168,206"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="55,210,101,199,103,204,56,215"/>
-<area shape="rect" id="Node000015" href="$d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" title="Self&#45;implementations, 2nd test." alt="" coords="117,229,168,255"/>
-<area shape="poly" id="edge19_Node000001_Node000015" title=" " alt="" coords="56,221,103,231,101,236,55,226"/>
-<area shape="rect" id="Node000016" href="$dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299" title=" " alt="" coords="117,279,168,304"/>
-<area shape="poly" id="edge22_Node000001_Node000016" title=" " alt="" coords="51,229,104,265,108,268,105,272,101,270,48,234"/>
-<area shape="rect" id="Node000020" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="106,328,178,354"/>
-<area shape="poly" id="edge28_Node000001_Node000020" title=" " alt="" coords="41,230,67,270,105,315,106,316,102,320,101,319,62,274,36,233"/>
-<area shape="rect" id="Node000005" href="$dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" title="prints the minimum, maximum and size of the set to which i belongs to" alt="" coords="250,104,318,130"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="167,177,244,135,246,140,169,182"/>
-<area shape="rect" id="Node000010" href="$dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="232,229,336,255"/>
-<area shape="poly" id="edge12_Node000004_Node000010" title=" " alt="" coords="169,199,232,221,230,226,167,204"/>
-<area shape="rect" id="Node000006" href="$dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" title="A utility function that returns the max element of the set to which i belongs to." alt="" coords="413,5,514,31"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="298,101,336,71,385,40,397,34,400,39,388,45,339,75,302,106"/>
-<area shape="rect" id="Node000008" href="$dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" title="A utility function that returns the min element of the set to which i belongs to." alt="" coords="415,55,512,80"/>
-<area shape="poly" id="edge8_Node000005_Node000008" title=" " alt="" coords="318,105,399,82,401,87,319,110"/>
-<area shape="rect" id="Node000009" href="$dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" title="A utility function that returns the size of the set to which i belongs to." alt="" coords="426,104,501,130"/>
-<area shape="poly" id="edge10_Node000005_Node000009" title=" " alt="" coords="319,114,411,114,411,120,319,120"/>
-<area shape="rect" id="Node000007" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="589,104,680,130"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="515,28,542,40,579,65,611,91,607,95,576,69,539,45,513,33"/>
-<area shape="poly" id="edge7_Node000007_Node000007" title=" " alt="" coords="605,105,600,95,603,86,615,80,634,77,655,80,666,87,663,91,653,85,634,83,617,85,607,89,605,95,610,102"/>
-<area shape="poly" id="edge9_Node000008_Node000007" title=" " alt="" coords="512,78,574,97,573,102,510,84"/>
-<area shape="poly" id="edge11_Node000009_Node000007" title=" " alt="" coords="501,114,573,114,573,120,501,120"/>
-<area shape="poly" id="edge13_Node000010_Node000007" title=" " alt="" coords="336,237,433,223,488,209,539,189,577,166,608,139,612,143,580,170,542,194,489,214,434,228,337,242"/>
-<area shape="rect" id="Node000011" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="416,255,511,280"/>
-<area shape="poly" id="edge14_Node000010_Node000011" title=" " alt="" coords="337,247,402,256,401,261,336,252"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="598,367,670,392"/>
-<area shape="poly" id="edge16_Node000010_Node000012" title=" " alt="" coords="311,253,387,290,464,317,542,341,587,358,585,363,540,346,462,322,385,295,308,258"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="429,356,498,382"/>
-<area shape="poly" id="edge17_Node000010_Node000013" title=" " alt="" coords="299,254,336,293,388,335,416,350,414,354,385,339,333,297,295,257"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="424,153,503,179"/>
-<area shape="poly" id="edge18_Node000010_Node000014" title=" " alt="" coords="315,226,385,196,415,183,417,188,387,201,317,231"/>
-<area shape="poly" id="edge15_Node000011_Node000007" title=" " alt="" coords="506,252,539,233,563,212,584,188,616,142,620,145,588,191,566,216,542,238,508,256"/>
-<area shape="poly" id="edge20_Node000015_Node000005" title=" " alt="" coords="165,227,180,216,223,177,259,140,263,144,227,181,184,220,168,231"/>
-<area shape="poly" id="edge21_Node000015_Node000010" title=" " alt="" coords="168,240,217,240,217,245,168,245"/>
-<area shape="rect" id="Node000017" href="$dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" title=" " alt="" coords="230,429,338,455"/>
-<area shape="poly" id="edge23_Node000016_Node000017" title=" " alt="" coords="169,303,184,314,232,365,268,414,264,418,228,369,180,317,166,307"/>
-<area shape="rect" id="Node000018" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="435,429,492,455"/>
-<area shape="poly" id="edge24_Node000017_Node000018" title=" " alt="" coords="339,440,420,440,420,445,339,445"/>
-<area shape="rect" id="Node000019" 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="386,479,541,504"/>
-<area shape="poly" id="edge27_Node000017_Node000019" title=" " alt="" coords="334,453,400,471,399,477,333,458"/>
-<area shape="poly" id="edge26_Node000018_Node000012" title=" " alt="" coords="491,429,583,395,585,400,493,434"/>
-<area shape="poly" id="edge25_Node000018_Node000018" title=" " alt="" coords="434,430,429,421,432,411,444,405,464,403,484,405,495,412,492,416,483,410,463,408,446,410,436,415,434,420,439,428"/>
-</map>
diff --git a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
deleted file mode 100644
index 77313d312..000000000
--- a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6dfe015302b9069ea6e1a20b0cc50326
\ No newline at end of file
diff --git a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
deleted file mode 100644
index ba7330e3f..000000000
--- a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
+++ /dev/null
@@ -1,527 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 382 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 514;
-var viewHeight = 382;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-224.25 0,-224.25 0,-205 37,-205 37,-224.25"/>
-<text text-anchor="middle" x="18.5" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.5,-317.25 76,-317.25 76,-298 129.5,-298 129.5,-317.25"/>
-<text text-anchor="middle" x="102.75" y="-303.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.87,-224.55C33.51,-239.86 51.69,-269.56 73,-289.62 73.39,-289.99 73.78,-290.35 74.18,-290.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.03,-293.46 82.12,-296.69 76.24,-287.87 72.03,-293.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-280.25 73,-280.25 73,-261 132.5,-261 132.5,-280.25"/>
-<text text-anchor="middle" x="102.75" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.98,-224.53C43.71,-232.33 59.16,-243.39 73,-252.62 73.86,-253.2 74.73,-253.78 75.62,-254.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.64,-257.25 83.95,-259.69 77.42,-251.35 73.64,-257.25"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title="Self&#45;test implementations, 1st test.">
-<polygon fill="white" stroke="#666666" points="121.62,-243.25 83.88,-243.25 83.88,-224 121.62,-224 121.62,-243.25"/>
-<text text-anchor="middle" x="102.75" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-218.75C47.62,-221.12 60.79,-224.16 72.54,-226.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.65,-230.26 82.18,-229.1 73.22,-223.44 71.65,-230.26"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title="Self&#45;implementations, 2nd test.">
-<polygon fill="white" stroke="#666666" points="121.62,-206.25 83.88,-206.25 83.88,-187 121.62,-187 121.62,-206.25"/>
-<text text-anchor="middle" x="102.75" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node15 -->
-<g id="edge19_Node000001_Node000015" class="edge">
-<title>Node1&#45;&gt;Node15</title>
-<g id="a_edge19_Node000001_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-210.72C47.62,-208.47 60.79,-205.59 72.54,-203.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.15,-206.47 82.18,-200.91 71.66,-199.63 73.15,-206.47"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="121.62,-169.25 83.88,-169.25 83.88,-150 121.62,-150 121.62,-169.25"/>
-<text text-anchor="middle" x="102.75" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge22_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge22_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.46,-204.71C44.19,-197.16 59.42,-186.57 73,-177.62 74.01,-176.96 75.04,-176.29 76.08,-175.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.72,-178.72 84.27,-170.4 73.96,-172.82 77.72,-178.72"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-132.25 75.62,-132.25 75.62,-113 129.88,-113 129.88,-132.25"/>
-<text text-anchor="middle" x="102.75" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node20 -->
-<g id="edge28_Node000001_Node000020" class="edge">
-<title>Node1&#45;&gt;Node20</title>
-<g id="a_edge28_Node000001_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.04,-204.59C33.78,-189.42 51.93,-160.34 73,-140.62 73.39,-140.26 73.78,-139.9 74.19,-139.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.24,-142.38 82.13,-133.57 72.04,-136.79 76.24,-142.38"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
-<polygon fill="white" stroke="#666666" points="234.75,-300.25 183.5,-300.25 183.5,-281 234.75,-281 234.75,-300.25"/>
-<text text-anchor="middle" x="209.12" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.93,-243.55C137.92,-252.29 161.46,-265.14 179.9,-275.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.02,-278.17 188.47,-279.89 181.38,-272.03 178.02,-278.17"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="248.25,-206.25 170,-206.25 170,-187 248.25,-187 248.25,-206.25"/>
-<text text-anchor="middle" x="209.12" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node10 -->
-<g id="edge12_Node000004_Node000010" class="edge">
-<title>Node4&#45;&gt;Node10</title>
-<g id="a_edge12_Node000004_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.93,-227.18C134.93,-222.57 152.92,-216.19 169.11,-210.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.26,-213.76 178.51,-207.12 167.92,-207.16 170.26,-213.76"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="381.25,-374.25 306,-374.25 306,-355 381.25,-355 381.25,-374.25"/>
-<text text-anchor="middle" x="343.62" y="-360.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M221.12,-300.63C235.19,-312.96 260.72,-333.85 285.75,-346.62 288.65,-348.1 291.69,-349.49 294.8,-350.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.5,-354.04 304.09,-354.3 295.97,-347.49 293.5,-354.04"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="379.75,-337.25 307.5,-337.25 307.5,-318 379.75,-318 379.75,-337.25"/>
-<text text-anchor="middle" x="343.62" y="-323.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge8_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge8_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.05,-297.58C252.19,-302.37 275.48,-308.87 296,-314.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.03,-317.97 305.6,-317.29 296.91,-311.23 295.03,-317.97"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="371.5,-300.25 315.75,-300.25 315.75,-281 371.5,-281 371.5,-300.25"/>
-<text text-anchor="middle" x="343.62" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge10_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge10_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.05,-290.62C254.49,-290.62 281.84,-290.62 304.1,-290.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.02,-294.13 314.02,-290.63 304.02,-287.13 304.02,-294.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="506,-300.25 437.5,-300.25 437.5,-281 506,-281 506,-300.25"/>
-<text text-anchor="middle" x="471.75" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.56,-355.16C388.38,-352.79 395.3,-349.96 401.5,-346.62 420.53,-336.39 439.42,-320.64 452.65,-308.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="454.89,-311.15 459.74,-301.73 450.08,-306.07 454.89,-311.15"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M451.69,-300.54C442.54,-309.15 449.23,-318.25 471.75,-318.25 484.07,-318.25 491.65,-315.53 494.49,-311.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="497.91,-310.91 492.16,-302.01 491.11,-312.55 497.91,-310.91"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge9_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge9_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M379.09,-317.51C393.64,-313.24 410.78,-308.22 426.27,-303.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="427.14,-307.07 435.75,-300.89 425.17,-300.35 427.14,-307.07"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge11_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge11_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M371.99,-290.62C387.68,-290.62 407.77,-290.62 425.72,-290.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="425.63,-294.13 435.63,-290.63 425.63,-287.13 425.63,-294.13"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node7 -->
-<g id="edge13_Node000010_Node000007" class="edge">
-<title>Node10&#45;&gt;Node7</title>
-<g id="a_edge13_Node000010_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.48,-198.82C288.37,-202.32 351.81,-211.35 401.5,-234.62 421.3,-243.9 440.35,-260.01 453.44,-272.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="450.86,-274.94 460.41,-279.51 455.79,-269.98 450.86,-274.94"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="379,-187.25 308.25,-187.25 308.25,-168 379,-168 379,-187.25"/>
-<text text-anchor="middle" x="343.62" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge14_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge14_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.45,-191.13C263.58,-188.96 281.09,-186.45 296.87,-184.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.1,-187.69 306.51,-182.8 296.11,-180.76 297.1,-187.69"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="498.88,-103.25 444.62,-103.25 444.62,-84 498.88,-84 498.88,-103.25"/>
-<text text-anchor="middle" x="471.75" y="-89.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node12 -->
-<g id="edge16_Node000010_Node000012" class="edge">
-<title>Node10&#45;&gt;Node12</title>
-<g id="a_edge16_Node000010_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.11,-186.64C243.21,-178.48 265.51,-166.98 285.75,-158.62 335.8,-137.97 350.54,-138.91 401.5,-120.62 412.61,-116.64 424.63,-112.05 435.48,-107.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="436.45,-111.19 444.46,-104.26 433.88,-104.67 436.45,-111.19"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="369.25,-111.25 318,-111.25 318,-92 369.25,-92 369.25,-111.25"/>
-<text text-anchor="middle" x="343.62" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node13 -->
-<g id="edge17_Node000010_Node000013" class="edge">
-<title>Node10&#45;&gt;Node13</title>
-<g id="a_edge17_Node000010_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M218.54,-186.74C231.64,-171.84 258.27,-143.49 285.75,-125.62 292.33,-121.35 299.8,-117.55 307.11,-114.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="308.29,-117.61 316.19,-110.56 305.61,-111.15 308.29,-117.61"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373,-263.25 314.25,-263.25 314.25,-244 373,-244 373,-263.25"/>
-<text text-anchor="middle" x="343.62" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node14 -->
-<g id="edge18_Node000010_Node000014" class="edge">
-<title>Node10&#45;&gt;Node14</title>
-<g id="a_edge18_Node000010_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M232.93,-206.66C247.92,-213.24 267.98,-222 285.75,-229.62 292.96,-232.72 300.7,-236.01 308.08,-239.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="306.55,-242.28 317.13,-242.94 309.27,-235.83 306.55,-242.28"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node7 -->
-<g id="edge15_Node000011_Node000007" class="edge">
-<title>Node11&#45;&gt;Node7</title>
-<g id="a_edge15_Node000011_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M376.29,-187.65C384.96,-191.25 394.02,-195.88 401.5,-201.62 426.53,-220.83 447.49,-251.13 459.59,-270.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="456.5,-272.59 464.59,-279.42 462.53,-269.03 456.5,-272.59"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node5 -->
-<g id="edge20_Node000015_Node000005" class="edge">
-<title>Node15&#45;&gt;Node5</title>
-<g id="a_edge20_Node000015_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.21,-206.67C125.05,-209.11 129,-211.83 132.5,-214.62 154.63,-232.29 177.17,-255.8 191.81,-271.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.18,-274.28 198.45,-279.41 194.41,-269.62 189.18,-274.28"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node10 -->
-<g id="edge21_Node000015_Node000010" class="edge">
-<title>Node15&#45;&gt;Node10</title>
-<g id="a_edge21_Node000015_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.93,-196.62C132.14,-196.62 145.42,-196.62 158.49,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.33,-200.13 168.33,-196.63 158.33,-193.13 158.33,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.75,-56.25 168.5,-56.25 168.5,-37 249.75,-37 249.75,-56.25"/>
-<text text-anchor="middle" x="209.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">hamilton_cycle</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge23_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge23_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.75,-149.67C125.48,-147.26 129.25,-144.53 132.5,-141.62 158.07,-118.79 181.68,-86.62 195.49,-66.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.34,-68.23 200.95,-57.96 192.51,-64.37 198.34,-68.23"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="364.75,-56.25 322.5,-56.25 322.5,-37 364.75,-37 364.75,-56.25"/>
-<text text-anchor="middle" x="343.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge24_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge24_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M250.24,-46.62C269.64,-46.62 292.6,-46.62 310.78,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="310.71,-50.13 320.71,-46.63 310.71,-43.13 310.71,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="401.5,-19.25 285.75,-19.25 285.75,0 401.5,0 401.5,-19.25"/>
-<text text-anchor="middle" x="343.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node19 -->
-<g id="edge27_Node000017_Node000019" class="edge">
-<title>Node17&#45;&gt;Node19</title>
-<g id="a_edge27_Node000017_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M246.33,-36.51C261.52,-32.27 279.39,-27.28 295.58,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="296.31,-26.19 305,-20.13 294.43,-19.45 296.31,-26.19"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node12 -->
-<g id="edge26_Node000018_Node000012" class="edge">
-<title>Node18&#45;&gt;Node12</title>
-<g id="a_edge26_Node000018_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M365.17,-54.28C383.77,-61.21 411.59,-71.58 434.01,-79.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="432.51,-83.11 443.1,-83.32 434.95,-76.55 432.51,-83.11"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node18 -->
-<g id="edge25_Node000018_Node000018" class="edge">
-<title>Node18&#45;&gt;Node18</title>
-<g id="a_edge25_Node000018_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M323.57,-56.54C314.42,-65.15 321.1,-74.25 343.62,-74.25 355.94,-74.25 363.52,-71.53 366.37,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="369.79,-66.91 364.04,-58.01 362.98,-68.55 369.79,-66.91"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
deleted file mode 100644
index a957c8ca1..000000000
--- a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
+++ /dev/null
@@ -1,444 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="514pt" height="382pt"
- viewBox="0.00 0.00 514.00 382.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 378.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-224.25 0,-224.25 0,-205 37,-205 37,-224.25"/>
-<text text-anchor="middle" x="18.5" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.5,-317.25 76,-317.25 76,-298 129.5,-298 129.5,-317.25"/>
-<text text-anchor="middle" x="102.75" y="-303.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.87,-224.55C33.51,-239.86 51.69,-269.56 73,-289.62 73.39,-289.99 73.78,-290.35 74.18,-290.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.03,-293.46 82.12,-296.69 76.24,-287.87 72.03,-293.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-280.25 73,-280.25 73,-261 132.5,-261 132.5,-280.25"/>
-<text text-anchor="middle" x="102.75" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.98,-224.53C43.71,-232.33 59.16,-243.39 73,-252.62 73.86,-253.2 74.73,-253.78 75.62,-254.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.64,-257.25 83.95,-259.69 77.42,-251.35 73.64,-257.25"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title="Self&#45;test implementations, 1st test.">
-<polygon fill="white" stroke="#666666" points="121.62,-243.25 83.88,-243.25 83.88,-224 121.62,-224 121.62,-243.25"/>
-<text text-anchor="middle" x="102.75" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-218.75C47.62,-221.12 60.79,-224.16 72.54,-226.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.65,-230.26 82.18,-229.1 73.22,-223.44 71.65,-230.26"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title="Self&#45;implementations, 2nd test.">
-<polygon fill="white" stroke="#666666" points="121.62,-206.25 83.88,-206.25 83.88,-187 121.62,-187 121.62,-206.25"/>
-<text text-anchor="middle" x="102.75" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node15 -->
-<g id="edge19_Node000001_Node000015" class="edge">
-<title>Node1&#45;&gt;Node15</title>
-<g id="a_edge19_Node000001_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-210.72C47.62,-208.47 60.79,-205.59 72.54,-203.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.15,-206.47 82.18,-200.91 71.66,-199.63 73.15,-206.47"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="121.62,-169.25 83.88,-169.25 83.88,-150 121.62,-150 121.62,-169.25"/>
-<text text-anchor="middle" x="102.75" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge22_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge22_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.46,-204.71C44.19,-197.16 59.42,-186.57 73,-177.62 74.01,-176.96 75.04,-176.29 76.08,-175.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.72,-178.72 84.27,-170.4 73.96,-172.82 77.72,-178.72"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-132.25 75.62,-132.25 75.62,-113 129.88,-113 129.88,-132.25"/>
-<text text-anchor="middle" x="102.75" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node20 -->
-<g id="edge28_Node000001_Node000020" class="edge">
-<title>Node1&#45;&gt;Node20</title>
-<g id="a_edge28_Node000001_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.04,-204.59C33.78,-189.42 51.93,-160.34 73,-140.62 73.39,-140.26 73.78,-139.9 74.19,-139.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.24,-142.38 82.13,-133.57 72.04,-136.79 76.24,-142.38"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
-<polygon fill="white" stroke="#666666" points="234.75,-300.25 183.5,-300.25 183.5,-281 234.75,-281 234.75,-300.25"/>
-<text text-anchor="middle" x="209.12" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.93,-243.55C137.92,-252.29 161.46,-265.14 179.9,-275.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.02,-278.17 188.47,-279.89 181.38,-272.03 178.02,-278.17"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="248.25,-206.25 170,-206.25 170,-187 248.25,-187 248.25,-206.25"/>
-<text text-anchor="middle" x="209.12" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node10 -->
-<g id="edge12_Node000004_Node000010" class="edge">
-<title>Node4&#45;&gt;Node10</title>
-<g id="a_edge12_Node000004_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.93,-227.18C134.93,-222.57 152.92,-216.19 169.11,-210.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.26,-213.76 178.51,-207.12 167.92,-207.16 170.26,-213.76"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="381.25,-374.25 306,-374.25 306,-355 381.25,-355 381.25,-374.25"/>
-<text text-anchor="middle" x="343.62" y="-360.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M221.12,-300.63C235.19,-312.96 260.72,-333.85 285.75,-346.62 288.65,-348.1 291.69,-349.49 294.8,-350.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.5,-354.04 304.09,-354.3 295.97,-347.49 293.5,-354.04"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="379.75,-337.25 307.5,-337.25 307.5,-318 379.75,-318 379.75,-337.25"/>
-<text text-anchor="middle" x="343.62" y="-323.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge8_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge8_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.05,-297.58C252.19,-302.37 275.48,-308.87 296,-314.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.03,-317.97 305.6,-317.29 296.91,-311.23 295.03,-317.97"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="371.5,-300.25 315.75,-300.25 315.75,-281 371.5,-281 371.5,-300.25"/>
-<text text-anchor="middle" x="343.62" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge10_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge10_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.05,-290.62C254.49,-290.62 281.84,-290.62 304.1,-290.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.02,-294.13 314.02,-290.63 304.02,-287.13 304.02,-294.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="506,-300.25 437.5,-300.25 437.5,-281 506,-281 506,-300.25"/>
-<text text-anchor="middle" x="471.75" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.56,-355.16C388.38,-352.79 395.3,-349.96 401.5,-346.62 420.53,-336.39 439.42,-320.64 452.65,-308.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="454.89,-311.15 459.74,-301.73 450.08,-306.07 454.89,-311.15"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M451.69,-300.54C442.54,-309.15 449.23,-318.25 471.75,-318.25 484.07,-318.25 491.65,-315.53 494.49,-311.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="497.91,-310.91 492.16,-302.01 491.11,-312.55 497.91,-310.91"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge9_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge9_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M379.09,-317.51C393.64,-313.24 410.78,-308.22 426.27,-303.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="427.14,-307.07 435.75,-300.89 425.17,-300.35 427.14,-307.07"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge11_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge11_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M371.99,-290.62C387.68,-290.62 407.77,-290.62 425.72,-290.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="425.63,-294.13 435.63,-290.63 425.63,-287.13 425.63,-294.13"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node7 -->
-<g id="edge13_Node000010_Node000007" class="edge">
-<title>Node10&#45;&gt;Node7</title>
-<g id="a_edge13_Node000010_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.48,-198.82C288.37,-202.32 351.81,-211.35 401.5,-234.62 421.3,-243.9 440.35,-260.01 453.44,-272.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="450.86,-274.94 460.41,-279.51 455.79,-269.98 450.86,-274.94"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="379,-187.25 308.25,-187.25 308.25,-168 379,-168 379,-187.25"/>
-<text text-anchor="middle" x="343.62" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge14_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge14_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.45,-191.13C263.58,-188.96 281.09,-186.45 296.87,-184.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.1,-187.69 306.51,-182.8 296.11,-180.76 297.1,-187.69"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="498.88,-103.25 444.62,-103.25 444.62,-84 498.88,-84 498.88,-103.25"/>
-<text text-anchor="middle" x="471.75" y="-89.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node12 -->
-<g id="edge16_Node000010_Node000012" class="edge">
-<title>Node10&#45;&gt;Node12</title>
-<g id="a_edge16_Node000010_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.11,-186.64C243.21,-178.48 265.51,-166.98 285.75,-158.62 335.8,-137.97 350.54,-138.91 401.5,-120.62 412.61,-116.64 424.63,-112.05 435.48,-107.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="436.45,-111.19 444.46,-104.26 433.88,-104.67 436.45,-111.19"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="369.25,-111.25 318,-111.25 318,-92 369.25,-92 369.25,-111.25"/>
-<text text-anchor="middle" x="343.62" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node13 -->
-<g id="edge17_Node000010_Node000013" class="edge">
-<title>Node10&#45;&gt;Node13</title>
-<g id="a_edge17_Node000010_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M218.54,-186.74C231.64,-171.84 258.27,-143.49 285.75,-125.62 292.33,-121.35 299.8,-117.55 307.11,-114.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="308.29,-117.61 316.19,-110.56 305.61,-111.15 308.29,-117.61"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373,-263.25 314.25,-263.25 314.25,-244 373,-244 373,-263.25"/>
-<text text-anchor="middle" x="343.62" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node14 -->
-<g id="edge18_Node000010_Node000014" class="edge">
-<title>Node10&#45;&gt;Node14</title>
-<g id="a_edge18_Node000010_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M232.93,-206.66C247.92,-213.24 267.98,-222 285.75,-229.62 292.96,-232.72 300.7,-236.01 308.08,-239.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="306.55,-242.28 317.13,-242.94 309.27,-235.83 306.55,-242.28"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node7 -->
-<g id="edge15_Node000011_Node000007" class="edge">
-<title>Node11&#45;&gt;Node7</title>
-<g id="a_edge15_Node000011_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M376.29,-187.65C384.96,-191.25 394.02,-195.88 401.5,-201.62 426.53,-220.83 447.49,-251.13 459.59,-270.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="456.5,-272.59 464.59,-279.42 462.53,-269.03 456.5,-272.59"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node5 -->
-<g id="edge20_Node000015_Node000005" class="edge">
-<title>Node15&#45;&gt;Node5</title>
-<g id="a_edge20_Node000015_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.21,-206.67C125.05,-209.11 129,-211.83 132.5,-214.62 154.63,-232.29 177.17,-255.8 191.81,-271.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.18,-274.28 198.45,-279.41 194.41,-269.62 189.18,-274.28"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node10 -->
-<g id="edge21_Node000015_Node000010" class="edge">
-<title>Node15&#45;&gt;Node10</title>
-<g id="a_edge21_Node000015_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.93,-196.62C132.14,-196.62 145.42,-196.62 158.49,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.33,-200.13 168.33,-196.63 158.33,-193.13 158.33,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.75,-56.25 168.5,-56.25 168.5,-37 249.75,-37 249.75,-56.25"/>
-<text text-anchor="middle" x="209.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">hamilton_cycle</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge23_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge23_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.75,-149.67C125.48,-147.26 129.25,-144.53 132.5,-141.62 158.07,-118.79 181.68,-86.62 195.49,-66.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.34,-68.23 200.95,-57.96 192.51,-64.37 198.34,-68.23"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="364.75,-56.25 322.5,-56.25 322.5,-37 364.75,-37 364.75,-56.25"/>
-<text text-anchor="middle" x="343.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge24_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge24_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M250.24,-46.62C269.64,-46.62 292.6,-46.62 310.78,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="310.71,-50.13 320.71,-46.63 310.71,-43.13 310.71,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="401.5,-19.25 285.75,-19.25 285.75,0 401.5,0 401.5,-19.25"/>
-<text text-anchor="middle" x="343.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node19 -->
-<g id="edge27_Node000017_Node000019" class="edge">
-<title>Node17&#45;&gt;Node19</title>
-<g id="a_edge27_Node000017_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M246.33,-36.51C261.52,-32.27 279.39,-27.28 295.58,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="296.31,-26.19 305,-20.13 294.43,-19.45 296.31,-26.19"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node12 -->
-<g id="edge26_Node000018_Node000012" class="edge">
-<title>Node18&#45;&gt;Node12</title>
-<g id="a_edge26_Node000018_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M365.17,-54.28C383.77,-61.21 411.59,-71.58 434.01,-79.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="432.51,-83.11 443.1,-83.32 434.95,-76.55 432.51,-83.11"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node18 -->
-<g id="edge25_Node000018_Node000018" class="edge">
-<title>Node18&#45;&gt;Node18</title>
-<g id="a_edge25_Node000018_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M323.57,-56.54C314.42,-65.15 321.1,-74.25 343.62,-74.25 355.94,-74.25 363.52,-71.53 366.37,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="369.79,-66.91 364.04,-58.01 362.98,-68.55 369.79,-66.91"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.map b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.map
deleted file mode 100644
index dae75d523..000000000
--- a/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.map
+++ /dev/null
@@ -1,27 +0,0 @@
-<map id="test1" name="test1">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,89,56,115"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="803,5,874,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,90,103,74,277,35,415,15,554,8,733,10,787,12,787,18,733,15,554,13,415,20,278,40,104,79,57,95"/>
-<area shape="rect" id="Node000003" href="$d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5" title=" " alt="" coords="104,89,294,115"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,100,88,100,88,105,56,105"/>
-<area shape="rect" id="Node000006" href="$d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3" title=" " alt="" coords="342,160,513,201"/>
-<area shape="poly" id="edge14_Node000001_Node000006" title=" " alt="" coords="57,109,104,125,219,149,327,166,326,172,218,155,103,130,55,114"/>
-<area shape="rect" id="Node000004" href="$d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56" title=" " alt="" coords="561,24,733,65"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="294,87,342,81,546,55,546,60,342,86,295,92"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="781,59,896,84"/>
-<area shape="poly" id="edge13_Node000003_Node000005" title=" " alt="" coords="294,95,733,74,765,73,765,78,733,79,295,100"/>
-<area shape="poly" id="edge6_Node000003_Node000006" title=" " alt="" coords="239,113,353,152,351,157,238,118"/>
-<area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="733,30,787,23,787,28,734,35"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="734,54,766,59,765,64,733,59"/>
-<area shape="poly" id="edge10_Node000006_Node000004" title=" " alt="" coords="461,158,598,72,601,76,464,162"/>
-<area shape="rect" id="Node000007" href="$d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325" title=" " alt="" coords="561,338,733,378"/>
-<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="445,200,493,261,526,294,563,324,569,328,566,333,560,328,522,298,489,264,441,203"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="587,140,707,166"/>
-<area shape="poly" id="edge8_Node000006_Node000008" title=" " alt="" coords="513,167,572,160,573,165,514,173"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="586,189,708,215"/>
-<area shape="poly" id="edge9_Node000006_Node000009" title=" " alt="" coords="514,186,571,192,570,197,513,192"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="591,239,703,264"/>
-<area shape="poly" id="edge11_Node000006_Node000010" title=" " alt="" coords="487,199,562,225,583,231,581,236,561,230,485,204"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/inner_product.html#" title=" " alt="" coords="584,288,710,314"/>
-<area shape="poly" id="edge12_Node000006_Node000011" title=" " alt="" coords="454,200,502,238,563,274,575,280,572,285,560,279,499,242,451,204"/>
-</map>
diff --git a/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.md5 b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.md5
deleted file mode 100644
index c1fed1ca2..000000000
--- a/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cf3525d24cd5b53bc1cbf5cdc43627d2
\ No newline at end of file
diff --git a/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.svg b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.svg
deleted file mode 100644
index 0b0390bd1..000000000
--- a/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.svg
+++ /dev/null
@@ -1,323 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<!--zoomable 288 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 676;
-var viewHeight = 288;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-216.88 0,-216.88 0,-197.62 37.75,-197.62 37.75,-216.88"/>
-<text text-anchor="middle" x="18.88" y="-203.38" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="651.5,-279.88 598,-279.88 598,-260.62 651.5,-260.62 651.5,-279.88"/>
-<text text-anchor="middle" x="624.75" y="-266.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.05,-214.68C48.37,-218.64 61.61,-223.29 73.75,-226.25 278.51,-276.14 334.82,-279.63 545.5,-274.25 558.83,-273.91 573.42,-273.24 586.35,-272.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="586.38,-276.06 596.17,-272 585.99,-269.07 586.38,-276.06"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-216.88 73.75,-216.88 73.75,-197.62 216.5,-197.62 216.5,-216.88"/>
-<text text-anchor="middle" x="145.12" y="-203.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline::fit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.21,-207.25C45,-207.25 53.2,-207.25 62.01,-207.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.91,-210.75 71.91,-207.25 61.91,-203.75 61.91,-210.75"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="381,-163.5 252.5,-163.5 252.5,-133 381,-133 381,-163.5"/>
-<text text-anchor="start" x="260.5" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="316.75" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">::predict</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge14_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge14_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.08,-199.93C48.41,-196.01 61.65,-191.36 73.75,-188.25 129.02,-174.05 192.74,-163.76 240.92,-157.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="241.24,-160.66 250.69,-155.86 240.31,-153.72 241.24,-160.66"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="545.5,-265.5 417,-265.5 417,-235 545.5,-235 545.5,-265.5"/>
-<text text-anchor="start" x="425" y="-252" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="481.25" y="-240.75" font-family="Helvetica,sans-Serif" font-size="10.00">::check_size_match</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.79,-216.59C228.71,-218.16 240.95,-219.76 252.5,-221.25 303.59,-227.86 361.15,-235.19 405.62,-240.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="405.06,-244.28 415.42,-242.07 405.94,-237.34 405.06,-244.28"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="668,-239.88 581.5,-239.88 581.5,-220.62 668,-220.62 668,-239.88"/>
-<text text-anchor="middle" x="624.75" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge13_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge13_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.83,-210.54C296.65,-214.27 430.41,-220.57 545.5,-226.25 553.35,-226.64 561.64,-227.05 569.78,-227.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="569.43,-230.95 579.6,-227.97 569.79,-223.96 569.43,-230.95"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.9,-197.24C198.12,-189.17 231.47,-177.56 259.9,-167.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.79,-171.07 269.09,-164.48 258.49,-164.46 260.79,-171.07"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M545.96,-259.26C559.75,-261.2 573.9,-263.2 586.28,-264.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="585.65,-268.4 596.05,-266.33 586.63,-261.47 585.65,-268.4"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M545.96,-241.24C553.95,-240.12 562.05,-238.97 569.87,-237.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="570.15,-241.36 579.56,-236.5 569.17,-234.43 570.15,-241.36"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge10_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge10_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M342.78,-163.96C370.34,-181.26 414.81,-209.18 445.68,-228.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="443.57,-231.36 453.91,-233.71 447.3,-225.43 443.57,-231.36"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="545.5,-30.5 417,-30.5 417,0 545.5,0 545.5,-30.5"/>
-<text text-anchor="start" x="425" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="481.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::activation</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M328.18,-132.76C344.57,-109.49 378.49,-65.45 417,-39.25 418.57,-38.18 420.19,-37.15 421.86,-36.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.21,-39.41 430.4,-31.62 419.93,-33.22 423.21,-39.41"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="526,-178.88 436.5,-178.88 436.5,-159.62 526,-159.62 526,-178.88"/>
-<text text-anchor="middle" x="481.25" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge8_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge8_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.04,-156.43C395.67,-158.32 411.11,-160.32 425.35,-162.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="424.6,-165.59 434.96,-163.4 425.49,-158.64 424.6,-165.59"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="527.12,-141.88 435.38,-141.88 435.38,-122.62 527.12,-122.62 527.12,-141.88"/>
-<text text-anchor="middle" x="481.25" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge9_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge9_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.04,-142.02C395.11,-140.63 409.92,-139.17 423.7,-137.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.87,-141.32 433.48,-136.86 423.18,-134.35 423.87,-141.32"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="523.38,-104.88 439.12,-104.88 439.12,-85.62 523.38,-85.62 523.38,-104.88"/>
-<text text-anchor="middle" x="481.25" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge11_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge11_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M360.55,-132.51C377.98,-126.27 398.37,-119.18 417,-113.25 422.04,-111.65 427.32,-110.03 432.6,-108.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="433.27,-111.92 441.89,-105.76 431.31,-105.2 433.27,-111.92"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="528.25,-67.88 434.25,-67.88 434.25,-48.62 528.25,-48.62 528.25,-67.88"/>
-<text text-anchor="middle" x="481.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::inner_product</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge12_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge12_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M335.17,-132.65C354.09,-116.46 385.79,-91.42 417,-76.25 419.94,-74.82 423.01,-73.49 426.14,-72.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="427.31,-75.55 435.54,-68.88 424.95,-68.96 427.31,-75.55"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph_org.svg b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph_org.svg
deleted file mode 100644
index 9d846db53..000000000
--- a/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph_org.svg
+++ /dev/null
@@ -1,240 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="676pt" height="288pt"
- viewBox="0.00 0.00 676.00 287.88" 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 283.88)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-216.88 0,-216.88 0,-197.62 37.75,-197.62 37.75,-216.88"/>
-<text text-anchor="middle" x="18.88" y="-203.38" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="651.5,-279.88 598,-279.88 598,-260.62 651.5,-260.62 651.5,-279.88"/>
-<text text-anchor="middle" x="624.75" y="-266.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.05,-214.68C48.37,-218.64 61.61,-223.29 73.75,-226.25 278.51,-276.14 334.82,-279.63 545.5,-274.25 558.83,-273.91 573.42,-273.24 586.35,-272.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="586.38,-276.06 596.17,-272 585.99,-269.07 586.38,-276.06"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-216.88 73.75,-216.88 73.75,-197.62 216.5,-197.62 216.5,-216.88"/>
-<text text-anchor="middle" x="145.12" y="-203.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline::fit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.21,-207.25C45,-207.25 53.2,-207.25 62.01,-207.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.91,-210.75 71.91,-207.25 61.91,-203.75 61.91,-210.75"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="381,-163.5 252.5,-163.5 252.5,-133 381,-133 381,-163.5"/>
-<text text-anchor="start" x="260.5" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="316.75" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">::predict</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge14_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge14_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.08,-199.93C48.41,-196.01 61.65,-191.36 73.75,-188.25 129.02,-174.05 192.74,-163.76 240.92,-157.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="241.24,-160.66 250.69,-155.86 240.31,-153.72 241.24,-160.66"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="545.5,-265.5 417,-265.5 417,-235 545.5,-235 545.5,-265.5"/>
-<text text-anchor="start" x="425" y="-252" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="481.25" y="-240.75" font-family="Helvetica,sans-Serif" font-size="10.00">::check_size_match</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.79,-216.59C228.71,-218.16 240.95,-219.76 252.5,-221.25 303.59,-227.86 361.15,-235.19 405.62,-240.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="405.06,-244.28 415.42,-242.07 405.94,-237.34 405.06,-244.28"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="668,-239.88 581.5,-239.88 581.5,-220.62 668,-220.62 668,-239.88"/>
-<text text-anchor="middle" x="624.75" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge13_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge13_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.83,-210.54C296.65,-214.27 430.41,-220.57 545.5,-226.25 553.35,-226.64 561.64,-227.05 569.78,-227.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="569.43,-230.95 579.6,-227.97 569.79,-223.96 569.43,-230.95"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.9,-197.24C198.12,-189.17 231.47,-177.56 259.9,-167.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.79,-171.07 269.09,-164.48 258.49,-164.46 260.79,-171.07"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M545.96,-259.26C559.75,-261.2 573.9,-263.2 586.28,-264.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="585.65,-268.4 596.05,-266.33 586.63,-261.47 585.65,-268.4"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M545.96,-241.24C553.95,-240.12 562.05,-238.97 569.87,-237.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="570.15,-241.36 579.56,-236.5 569.17,-234.43 570.15,-241.36"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge10_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge10_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M342.78,-163.96C370.34,-181.26 414.81,-209.18 445.68,-228.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="443.57,-231.36 453.91,-233.71 447.3,-225.43 443.57,-231.36"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="545.5,-30.5 417,-30.5 417,0 545.5,0 545.5,-30.5"/>
-<text text-anchor="start" x="425" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="481.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::activation</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M328.18,-132.76C344.57,-109.49 378.49,-65.45 417,-39.25 418.57,-38.18 420.19,-37.15 421.86,-36.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.21,-39.41 430.4,-31.62 419.93,-33.22 423.21,-39.41"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="526,-178.88 436.5,-178.88 436.5,-159.62 526,-159.62 526,-178.88"/>
-<text text-anchor="middle" x="481.25" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge8_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge8_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.04,-156.43C395.67,-158.32 411.11,-160.32 425.35,-162.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="424.6,-165.59 434.96,-163.4 425.49,-158.64 424.6,-165.59"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="527.12,-141.88 435.38,-141.88 435.38,-122.62 527.12,-122.62 527.12,-141.88"/>
-<text text-anchor="middle" x="481.25" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge9_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge9_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.04,-142.02C395.11,-140.63 409.92,-139.17 423.7,-137.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.87,-141.32 433.48,-136.86 423.18,-134.35 423.87,-141.32"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="523.38,-104.88 439.12,-104.88 439.12,-85.62 523.38,-85.62 523.38,-104.88"/>
-<text text-anchor="middle" x="481.25" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge11_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge11_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M360.55,-132.51C377.98,-126.27 398.37,-119.18 417,-113.25 422.04,-111.65 427.32,-110.03 432.6,-108.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="433.27,-111.92 441.89,-105.76 431.31,-105.2 433.27,-111.92"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="528.25,-67.88 434.25,-67.88 434.25,-48.62 528.25,-48.62 528.25,-67.88"/>
-<text text-anchor="middle" x="481.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::inner_product</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge12_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge12_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M335.17,-132.65C354.09,-116.46 385.79,-91.42 417,-76.25 419.94,-74.82 423.01,-73.49 426.14,-72.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="427.31,-75.55 435.54,-68.88 424.95,-68.96 427.31,-75.55"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.map b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.map
deleted file mode 100644
index 31862bb10..000000000
--- a/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.map
+++ /dev/null
@@ -1,29 +0,0 @@
-<map id="test3" name="test3">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,115,56,140"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="803,5,874,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="44,112,70,92,103,74,169,50,226,34,278,25,327,19,430,16,561,10,683,8,787,12,787,17,683,13,561,15,430,21,327,25,279,30,228,40,171,56,105,79,73,97,48,116"/>
-<area shape="rect" id="Node000003" href="$d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5" title=" " alt="" coords="104,89,294,115"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,121,94,115,95,121,57,126"/>
-<area shape="rect" id="Node000006" href="$d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3" title=" " alt="" coords="342,160,513,201"/>
-<area shape="poly" id="edge14_Node000001_Node000006" title=" " alt="" coords="56,128,327,165,326,170,56,133"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="163,191,235,216"/>
-<area shape="poly" id="edge15_Node000001_Node000012" title=" " alt="" coords="52,138,105,169,149,186,147,191,103,174,49,143"/>
-<area shape="rect" id="Node000004" href="$d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56" title=" " alt="" coords="561,24,733,65"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="294,87,342,81,546,55,546,60,342,86,295,92"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="781,59,896,84"/>
-<area shape="poly" id="edge13_Node000003_Node000005" title=" " alt="" coords="294,95,733,74,765,73,765,78,733,79,295,100"/>
-<area shape="poly" id="edge6_Node000003_Node000006" title=" " alt="" coords="241,113,295,132,354,152,352,157,293,137,239,118"/>
-<area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="733,30,787,23,787,28,734,35"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="734,54,766,59,765,64,733,59"/>
-<area shape="poly" id="edge10_Node000006_Node000004" title=" " alt="" coords="461,158,598,72,601,76,464,162"/>
-<area shape="rect" id="Node000007" href="$d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325" title=" " alt="" coords="561,338,733,378"/>
-<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="445,200,493,261,526,294,563,324,569,328,566,333,560,328,522,298,489,264,441,203"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="587,140,707,166"/>
-<area shape="poly" id="edge8_Node000006_Node000008" title=" " alt="" coords="513,167,572,160,573,165,514,173"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="586,189,708,215"/>
-<area shape="poly" id="edge9_Node000006_Node000009" title=" " alt="" coords="514,186,571,192,570,197,513,192"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="591,239,703,264"/>
-<area shape="poly" id="edge11_Node000006_Node000010" title=" " alt="" coords="487,199,562,225,583,231,581,236,561,230,485,204"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/inner_product.html#" title=" " alt="" coords="584,288,710,314"/>
-<area shape="poly" id="edge12_Node000006_Node000011" title=" " alt="" coords="454,200,502,238,563,274,575,280,572,285,560,279,499,242,451,204"/>
-</map>
diff --git a/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.md5 b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.md5
deleted file mode 100644
index 4c72180c8..000000000
--- a/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bd70dfdb0f4914f285981a0b39b336f8
\ No newline at end of file
diff --git a/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.svg b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.svg
deleted file mode 100644
index f5b534de6..000000000
--- a/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.svg
+++ /dev/null
@@ -1,341 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<!--zoomable 288 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 676;
-var viewHeight = 288;
-var sectionId = 'dynsection-4';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-197.88 0,-197.88 0,-178.62 37.75,-178.62 37.75,-197.88"/>
-<text text-anchor="middle" x="18.88" y="-184.38" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="651.5,-279.88 598,-279.88 598,-260.62 651.5,-260.62 651.5,-279.88"/>
-<text text-anchor="middle" x="624.75" y="-266.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.51,-198.11C40.77,-207.01 57.15,-219.68 73.75,-226.25 216.99,-282.9 263.33,-263.56 417,-274.25 476,-278.36 544.68,-275.52 586.15,-272.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="586.34,-276.47 596.09,-272.34 585.89,-269.49 586.34,-276.47"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-216.88 73.75,-216.88 73.75,-197.62 216.5,-197.62 216.5,-216.88"/>
-<text text-anchor="middle" x="145.12" y="-203.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline::fit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.21,-191.05C46.22,-192.28 56.22,-193.81 66.85,-195.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.18,-198.87 76.59,-196.92 67.24,-191.95 66.18,-198.87"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="381,-163.5 252.5,-163.5 252.5,-133 381,-133 381,-163.5"/>
-<text text-anchor="start" x="260.5" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="316.75" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">::predict</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge14_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge14_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-185.81C77.34,-180.48 172.91,-167.56 240.93,-158.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="241.08,-161.88 250.52,-157.07 240.14,-154.94 241.08,-161.88"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="172.25,-140.88 118,-140.88 118,-121.62 172.25,-121.62 172.25,-140.88"/>
-<text text-anchor="middle" x="145.12" y="-127.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge15_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge15_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.02,-178.39C44.62,-171.3 59.65,-161.87 73.75,-155.25 84.16,-150.36 95.84,-145.97 106.65,-142.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="107.64,-145.68 116.07,-139.26 105.48,-139.02 107.64,-145.68"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="545.5,-265.5 417,-265.5 417,-235 545.5,-235 545.5,-265.5"/>
-<text text-anchor="start" x="425" y="-252" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="481.25" y="-240.75" font-family="Helvetica,sans-Serif" font-size="10.00">::check_size_match</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.79,-216.59C228.71,-218.16 240.95,-219.76 252.5,-221.25 303.59,-227.86 361.15,-235.19 405.62,-240.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="405.06,-244.28 415.42,-242.07 405.94,-237.34 405.06,-244.28"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="668,-239.88 581.5,-239.88 581.5,-220.62 668,-220.62 668,-239.88"/>
-<text text-anchor="middle" x="624.75" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge13_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge13_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.83,-210.54C296.65,-214.27 430.41,-220.57 545.5,-226.25 553.35,-226.64 561.64,-227.05 569.78,-227.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="569.43,-230.95 579.6,-227.97 569.79,-223.96 569.43,-230.95"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.94,-197.16C188.47,-192.9 203.21,-187.86 216.5,-183.25 230.94,-178.24 246.55,-172.77 261.01,-167.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.12,-170.99 270.38,-164.36 259.79,-164.39 262.12,-170.99"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M545.96,-259.26C559.75,-261.2 573.9,-263.2 586.28,-264.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="585.65,-268.4 596.05,-266.33 586.63,-261.47 585.65,-268.4"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M545.96,-241.24C553.95,-240.12 562.05,-238.97 569.87,-237.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="570.15,-241.36 579.56,-236.5 569.17,-234.43 570.15,-241.36"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge10_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge10_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M342.78,-163.96C370.34,-181.26 414.81,-209.18 445.68,-228.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="443.57,-231.36 453.91,-233.71 447.3,-225.43 443.57,-231.36"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="545.5,-30.5 417,-30.5 417,0 545.5,0 545.5,-30.5"/>
-<text text-anchor="start" x="425" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="481.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::activation</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M328.18,-132.76C344.57,-109.49 378.49,-65.45 417,-39.25 418.57,-38.18 420.19,-37.15 421.86,-36.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.21,-39.41 430.4,-31.62 419.93,-33.22 423.21,-39.41"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="526,-178.88 436.5,-178.88 436.5,-159.62 526,-159.62 526,-178.88"/>
-<text text-anchor="middle" x="481.25" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge8_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge8_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.04,-156.43C395.67,-158.32 411.11,-160.32 425.35,-162.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="424.6,-165.59 434.96,-163.4 425.49,-158.64 424.6,-165.59"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="527.12,-141.88 435.38,-141.88 435.38,-122.62 527.12,-122.62 527.12,-141.88"/>
-<text text-anchor="middle" x="481.25" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge9_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge9_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.04,-142.02C395.11,-140.63 409.92,-139.17 423.7,-137.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.87,-141.32 433.48,-136.86 423.18,-134.35 423.87,-141.32"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="523.38,-104.88 439.12,-104.88 439.12,-85.62 523.38,-85.62 523.38,-104.88"/>
-<text text-anchor="middle" x="481.25" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge11_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge11_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M360.55,-132.51C377.98,-126.27 398.37,-119.18 417,-113.25 422.04,-111.65 427.32,-110.03 432.6,-108.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="433.27,-111.92 441.89,-105.76 431.31,-105.2 433.27,-111.92"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="528.25,-67.88 434.25,-67.88 434.25,-48.62 528.25,-48.62 528.25,-67.88"/>
-<text text-anchor="middle" x="481.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::inner_product</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge12_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge12_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M335.17,-132.65C354.09,-116.46 385.79,-91.42 417,-76.25 419.94,-74.82 423.01,-73.49 426.14,-72.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="427.31,-75.55 435.54,-68.88 424.95,-68.96 427.31,-75.55"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph_org.svg b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph_org.svg
deleted file mode 100644
index b04259469..000000000
--- a/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph_org.svg
+++ /dev/null
@@ -1,258 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<svg width="676pt" height="288pt"
- viewBox="0.00 0.00 676.00 287.88" 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 283.88)">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-197.88 0,-197.88 0,-178.62 37.75,-178.62 37.75,-197.88"/>
-<text text-anchor="middle" x="18.88" y="-184.38" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="651.5,-279.88 598,-279.88 598,-260.62 651.5,-260.62 651.5,-279.88"/>
-<text text-anchor="middle" x="624.75" y="-266.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.51,-198.11C40.77,-207.01 57.15,-219.68 73.75,-226.25 216.99,-282.9 263.33,-263.56 417,-274.25 476,-278.36 544.68,-275.52 586.15,-272.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="586.34,-276.47 596.09,-272.34 585.89,-269.49 586.34,-276.47"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-216.88 73.75,-216.88 73.75,-197.62 216.5,-197.62 216.5,-216.88"/>
-<text text-anchor="middle" x="145.12" y="-203.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline::fit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.21,-191.05C46.22,-192.28 56.22,-193.81 66.85,-195.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.18,-198.87 76.59,-196.92 67.24,-191.95 66.18,-198.87"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="381,-163.5 252.5,-163.5 252.5,-133 381,-133 381,-163.5"/>
-<text text-anchor="start" x="260.5" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="316.75" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">::predict</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge14_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge14_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-185.81C77.34,-180.48 172.91,-167.56 240.93,-158.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="241.08,-161.88 250.52,-157.07 240.14,-154.94 241.08,-161.88"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="172.25,-140.88 118,-140.88 118,-121.62 172.25,-121.62 172.25,-140.88"/>
-<text text-anchor="middle" x="145.12" y="-127.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge15_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge15_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.02,-178.39C44.62,-171.3 59.65,-161.87 73.75,-155.25 84.16,-150.36 95.84,-145.97 106.65,-142.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="107.64,-145.68 116.07,-139.26 105.48,-139.02 107.64,-145.68"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="545.5,-265.5 417,-265.5 417,-235 545.5,-235 545.5,-265.5"/>
-<text text-anchor="start" x="425" y="-252" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="481.25" y="-240.75" font-family="Helvetica,sans-Serif" font-size="10.00">::check_size_match</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.79,-216.59C228.71,-218.16 240.95,-219.76 252.5,-221.25 303.59,-227.86 361.15,-235.19 405.62,-240.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="405.06,-244.28 415.42,-242.07 405.94,-237.34 405.06,-244.28"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="668,-239.88 581.5,-239.88 581.5,-220.62 668,-220.62 668,-239.88"/>
-<text text-anchor="middle" x="624.75" y="-226.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge13_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge13_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.83,-210.54C296.65,-214.27 430.41,-220.57 545.5,-226.25 553.35,-226.64 561.64,-227.05 569.78,-227.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="569.43,-230.95 579.6,-227.97 569.79,-223.96 569.43,-230.95"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.94,-197.16C188.47,-192.9 203.21,-187.86 216.5,-183.25 230.94,-178.24 246.55,-172.77 261.01,-167.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.12,-170.99 270.38,-164.36 259.79,-164.39 262.12,-170.99"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M545.96,-259.26C559.75,-261.2 573.9,-263.2 586.28,-264.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="585.65,-268.4 596.05,-266.33 586.63,-261.47 585.65,-268.4"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M545.96,-241.24C553.95,-240.12 562.05,-238.97 569.87,-237.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="570.15,-241.36 579.56,-236.5 569.17,-234.43 570.15,-241.36"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge10_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge10_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M342.78,-163.96C370.34,-181.26 414.81,-209.18 445.68,-228.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="443.57,-231.36 453.91,-233.71 447.3,-225.43 443.57,-231.36"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="545.5,-30.5 417,-30.5 417,0 545.5,0 545.5,-30.5"/>
-<text text-anchor="start" x="425" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="481.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::activation</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M328.18,-132.76C344.57,-109.49 378.49,-65.45 417,-39.25 418.57,-38.18 420.19,-37.15 421.86,-36.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.21,-39.41 430.4,-31.62 419.93,-33.22 423.21,-39.41"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="526,-178.88 436.5,-178.88 436.5,-159.62 526,-159.62 526,-178.88"/>
-<text text-anchor="middle" x="481.25" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge8_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge8_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.04,-156.43C395.67,-158.32 411.11,-160.32 425.35,-162.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="424.6,-165.59 434.96,-163.4 425.49,-158.64 424.6,-165.59"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="527.12,-141.88 435.38,-141.88 435.38,-122.62 527.12,-122.62 527.12,-141.88"/>
-<text text-anchor="middle" x="481.25" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge9_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge9_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.04,-142.02C395.11,-140.63 409.92,-139.17 423.7,-137.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.87,-141.32 433.48,-136.86 423.18,-134.35 423.87,-141.32"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="523.38,-104.88 439.12,-104.88 439.12,-85.62 523.38,-85.62 523.38,-104.88"/>
-<text text-anchor="middle" x="481.25" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge11_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge11_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M360.55,-132.51C377.98,-126.27 398.37,-119.18 417,-113.25 422.04,-111.65 427.32,-110.03 432.6,-108.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="433.27,-111.92 441.89,-105.76 431.31,-105.2 433.27,-111.92"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="528.25,-67.88 434.25,-67.88 434.25,-48.62 528.25,-48.62 528.25,-67.88"/>
-<text text-anchor="middle" x="481.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::inner_product</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge12_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge12_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M335.17,-132.65C354.09,-116.46 385.79,-91.42 417,-76.25 419.94,-74.82 423.01,-73.49 426.14,-72.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="427.31,-75.55 435.54,-68.88 424.95,-68.96 427.31,-75.55"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/db0/adaline__learning_8cpp_source.html b/d5/db0/adaline__learning_8cpp_source.html
new file mode 100644
index 000000000..662686ae3
--- /dev/null
+++ b/d5/db0/adaline__learning_8cpp_source.html
@@ -0,0 +1,449 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: machine_learning/adaline_learning.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/db0/adaline__learning_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">adaline_learning.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d5/db0/adaline__learning_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;array&gt;</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;climits&gt;</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#include &lt;cstdlib&gt;</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#include &lt;numeric&gt;</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1">   40</a></span><span class="keyword">constexpr</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1">MAX_ITER</a> = 500;  <span class="comment">// INT_MAX</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d77/namespacemachine__learning.html">machine_learning</a> {</div>
+<div class="foldopen" id="foldopen00046" data-start="{" data-end="};">
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"><a class="line" href="../../d6/d30/classmachine__learning_1_1adaline.html">   46</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d6/d30/classmachine__learning_1_1adaline.html">adaline</a> {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00055" data-start="{" data-end="}">
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c">   55</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c">adaline</a>(<span class="keywordtype">int</span> num_features, <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda">eta</a> = 0.01f,</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>                     <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3">accuracy</a> = 1e-5)</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        : <a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda">eta</a>(<a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda">eta</a>), <a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3">accuracy</a>(<a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3">accuracy</a>) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda">eta</a> &lt;= 0) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;learning rate should be positive and nonzero&quot;</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>                      &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            std::exit(EXIT_FAILURE);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        }</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        <a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492">weights</a> = std::vector&lt;double&gt;(</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            num_features +</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            1);  <span class="comment">// additional weight is for the constant bias term</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        <span class="comment">// initialize with random weights in the range [-50, 49]</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        <span class="keywordflow">for</span> (<span class="keywordtype">double</span> &amp;weight : <a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>) weight = 1.f;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        <span class="comment">// weights[i] = (static_cast&lt;double&gt;(std::rand() % 100) - 50);</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    }</div>
+</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="foldopen" id="foldopen00076" data-start="{" data-end="};">
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"><a class="line" href="../../d6/d30/classmachine__learning_1_1adaline.html#ae347040516e995c8fb8ca2e5c0496daa">   76</a></span>    <span class="keyword">friend</span> std::ostream &amp;<a class="code hl_friend" href="../../d6/d30/classmachine__learning_1_1adaline.html#ae347040516e995c8fb8ca2e5c0496daa">operator&lt;&lt;</a>(std::ostream &amp;out, <span class="keyword">const</span> <a class="code hl_class" href="../../d6/d30/classmachine__learning_1_1adaline.html">adaline</a> &amp;ada) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        out &lt;&lt; <span class="stringliteral">&quot;&lt;&quot;</span>;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; ada.<a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>.size(); i++) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            out &lt;&lt; ada.<a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>[i];</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>            <span class="keywordflow">if</span> (i &lt; ada.<a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>.size() - 1) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>                out &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>            }</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        }</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        out &lt;&lt; <span class="stringliteral">&quot;&gt;&quot;</span>;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        <span class="keywordflow">return</span> out;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    }</div>
+</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="foldopen" id="foldopen00095" data-start="{" data-end="}">
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3">   95</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3">predict</a>(<span class="keyword">const</span> std::vector&lt;double&gt; &amp;x, <span class="keywordtype">double</span> *out = <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56">check_size_match</a>(x)) {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        }</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        <span class="keywordtype">double</span> y = <a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>.back();  <span class="comment">// assign bias value</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        <span class="comment">// for (int i = 0; i &lt; x.size(); i++) y += x[i] * weights[i];</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        y = std::inner_product(x.begin(), x.end(), <a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>.begin(), y);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        <span class="keywordflow">if</span> (out != <span class="keyword">nullptr</span>) {  <span class="comment">// if out variable is provided</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>            *out = y;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        }</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325">activation</a>(y);  <span class="comment">// quantizer: apply ADALINE threshold function</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    }</div>
+</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="foldopen" id="foldopen00119" data-start="{" data-end="}">
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"><a class="line" href="../../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5">  119</a></span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5">fit</a>(<span class="keyword">const</span> std::vector&lt;double&gt; &amp;x, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;y) {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56">check_size_match</a>(x)) {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>            <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        }</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        <span class="comment">/* output of the model with current weights */</span></div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        <span class="keywordtype">int</span> p = <a class="code hl_function" href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3">predict</a>(x);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        <span class="keywordtype">int</span> prediction_error = y - p;  <span class="comment">// error in estimation</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <span class="keywordtype">double</span> correction_factor = <a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda">eta</a> * prediction_error;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        <span class="comment">/* update each weight, the last weight is the bias term */</span></div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; x.size(); i++) {</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>            <a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>[i] += correction_factor * x[i];</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        }</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        <a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>[x.size()] += correction_factor;  <span class="comment">// update bias</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>        <span class="keywordflow">return</span> correction_factor;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    }</div>
+</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span> </div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> N&gt;</div>
+<div class="foldopen" id="foldopen00145" data-start="{" data-end="}">
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"><a class="line" href="../../d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91">  145</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91">fit</a>(std::array&lt;std::vector&lt;double&gt;, N&gt; <span class="keyword">const</span> &amp;X,</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>             std::array&lt;int, N&gt; <span class="keyword">const</span> &amp;Y) {</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        <span class="keywordtype">double</span> avg_pred_error = 1.f;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span> </div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        <span class="keywordtype">int</span> iter = 0;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>        <span class="keywordflow">for</span> (iter = 0; (iter &lt; <a class="code hl_variable" href="../../d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1">MAX_ITER</a>) &amp;&amp; (avg_pred_error &gt; <a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3">accuracy</a>);</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>             iter++) {</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>            avg_pred_error = 0.f;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span> </div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>            <span class="comment">// perform fit for each sample</span></div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N; i++) {</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>                <span class="keywordtype">double</span> err = <a class="code hl_function" href="../../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5">fit</a>(X[i], Y[i]);</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>                avg_pred_error += std::abs(err);</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>            }</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>            avg_pred_error /= N;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span> </div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>            <span class="comment">// Print updates every 200th iteration</span></div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>            <span class="comment">// if (iter % 100 == 0)</span></div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\tIter &quot;</span> &lt;&lt; iter &lt;&lt; <span class="stringliteral">&quot;: Training weights: &quot;</span> &lt;&lt; *<span class="keyword">this</span></div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>                      &lt;&lt; <span class="stringliteral">&quot;\tAvg error: &quot;</span> &lt;&lt; avg_pred_error &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>        }</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span> </div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>        <span class="keywordflow">if</span> (iter &lt; <a class="code hl_variable" href="../../d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1">MAX_ITER</a>) {</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Converged after &quot;</span> &lt;&lt; iter &lt;&lt; <span class="stringliteral">&quot; iterations.&quot;</span></div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>                      &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Did not converge after &quot;</span> &lt;&lt; iter &lt;&lt; <span class="stringliteral">&quot; iterations.&quot;</span></div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>                      &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>        }</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    }</div>
+</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span> </div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"><a class="line" href="../../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325">  186</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325">activation</a>(<span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> x &gt; 0 ? 1 : -1; }</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span> </div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span> <span class="keyword">private</span>:</div>
+<div class="foldopen" id="foldopen00196" data-start="{" data-end="}">
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"><a class="line" href="../../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56">  196</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56">check_size_match</a>(<span class="keyword">const</span> std::vector&lt;double&gt; &amp;x) {</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>        <span class="keywordflow">if</span> (x.size() != (<a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>.size() - 1)) {</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>            std::cerr &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;: &quot;</span></div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>                      &lt;&lt; <span class="stringliteral">&quot;Number of features in x does not match the feature &quot;</span></div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>                         <span class="stringliteral">&quot;dimension in model!&quot;</span></div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>                      &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>        }</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    }</div>
+</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span> </div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"><a class="line" href="../../d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda">  207</a></span>    <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda">eta</a>;             </div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"><a class="line" href="../../d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3">  208</a></span>    <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3">accuracy</a>;        </div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"><a class="line" href="../../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492">  209</a></span>    std::vector&lt;double&gt; <a class="code hl_variable" href="../../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>;  </div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>};</div>
+</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span> </div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>}  <span class="comment">// namespace machine_learning</span></div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span> </div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span><span class="keyword">using </span><a class="code hl_class" href="../../d6/d30/classmachine__learning_1_1adaline.html">machine_learning::adaline</a>;</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span> </div>
+<div class="foldopen" id="foldopen00224" data-start="{" data-end="}">
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"><a class="line" href="../../d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499">  224</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>(<span class="keywordtype">double</span> eta = 0.01) {</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    <a class="code hl_class" href="../../d6/d30/classmachine__learning_1_1adaline.html">adaline</a> ada(2, eta);  <span class="comment">// 2 features</span></div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span> </div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> N = 10;  <span class="comment">// number of sample points</span></div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span> </div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    std::array&lt;std::vector&lt;double&gt;, N&gt; X = {</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>        std::vector&lt;double&gt;({0, 1}),   std::vector&lt;double&gt;({1, -2}),</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>        std::vector&lt;double&gt;({2, 3}),   std::vector&lt;double&gt;({3, -1}),</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>        std::vector&lt;double&gt;({4, 1}),   std::vector&lt;double&gt;({6, -5}),</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>        std::vector&lt;double&gt;({-7, -3}), std::vector&lt;double&gt;({-8, 5}),</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>        std::vector&lt;double&gt;({-9, 2}),  std::vector&lt;double&gt;({-10, -15})};</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    std::array&lt;int, N&gt; y = {1,  -1, 1, -1, -1,</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>                            -1, 1,  1, 1,  -1};  <span class="comment">// corresponding y-values</span></div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span> </div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 1 -------&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Model before fit: &quot;</span> &lt;&lt; ada &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span> </div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    ada.<a class="code hl_function" href="../../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5">fit</a>&lt;N&gt;(X, y);</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Model after fit: &quot;</span> &lt;&lt; ada &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span> </div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    <span class="keywordtype">int</span> predict = ada.<a class="code hl_function" href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3">predict</a>({5, -3});</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Predict for x=(5,-3): &quot;</span> &lt;&lt; predict;</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    assert(predict == -1);</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; ...passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span> </div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    predict = ada.<a class="code hl_function" href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3">predict</a>({5, 8});</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Predict for x=(5,8): &quot;</span> &lt;&lt; predict;</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    assert(predict == 1);</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; ...passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>}</div>
+</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span> </div>
+<div class="foldopen" id="foldopen00262" data-start="{" data-end="}">
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"><a class="line" href="../../d5/db0/adaline__learning_8cpp.html#a379f7488a305f2571f2932b319931f82">  262</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>(<span class="keywordtype">double</span> eta = 0.01) {</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>    <a class="code hl_class" href="../../d6/d30/classmachine__learning_1_1adaline.html">adaline</a> ada(2, eta);  <span class="comment">// 2 features</span></div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span> </div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> N = 50;  <span class="comment">// number of sample points</span></div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span> </div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>    std::array&lt;std::vector&lt;double&gt;, N&gt; X;</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>    std::array&lt;int, N&gt; Y{};  <span class="comment">// corresponding y-values</span></div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span> </div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    <span class="comment">// generate sample points in the interval</span></div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    <span class="comment">// [-range2/100 , (range2-1)/100]</span></div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    <span class="keywordtype">int</span> range = 500;          <span class="comment">// sample points full-range</span></div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>    <span class="keywordtype">int</span> range2 = range &gt;&gt; 1;  <span class="comment">// sample points half-range</span></div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N; i++) {</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>        <span class="keywordtype">double</span> x0 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>        <span class="keywordtype">double</span> x1 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>        X[i] = std::vector&lt;double&gt;({x0, x1});</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>        Y[i] = (x0 + 3. * x1) &gt; -1 ? 1 : -1;</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>    }</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span> </div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 2 -------&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Model before fit: &quot;</span> &lt;&lt; ada &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span> </div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>    ada.<a class="code hl_function" href="../../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5">fit</a>(X, Y);</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Model after fit: &quot;</span> &lt;&lt; ada &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span> </div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>    <span class="keywordtype">int</span> N_test_cases = 5;</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N_test_cases; i++) {</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>        <span class="keywordtype">double</span> x0 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>        <span class="keywordtype">double</span> x1 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span> </div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>        <span class="keywordtype">int</span> predict = ada.<a class="code hl_function" href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3">predict</a>({x0, x1});</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span> </div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Predict for x=(&quot;</span> &lt;&lt; x0 &lt;&lt; <span class="stringliteral">&quot;,&quot;</span> &lt;&lt; x1 &lt;&lt; <span class="stringliteral">&quot;): &quot;</span> &lt;&lt; predict;</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span> </div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>        <span class="keywordtype">int</span> expected_val = (x0 + 3. * x1) &gt; -1 ? 1 : -1;</div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>        assert(predict == expected_val);</div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>        std::cout &lt;&lt; <span class="stringliteral">&quot; ...passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>    }</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>}</div>
+</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span> </div>
+<div class="foldopen" id="foldopen00313" data-start="{" data-end="}">
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"><a class="line" href="../../d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9">  313</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a>(<span class="keywordtype">double</span> eta = 0.01) {</div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>    <a class="code hl_class" href="../../d6/d30/classmachine__learning_1_1adaline.html">adaline</a> ada(6, eta);  <span class="comment">// 2 features</span></div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span> </div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> N = 100;  <span class="comment">// number of sample points</span></div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span> </div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>    std::array&lt;std::vector&lt;double&gt;, N&gt; X;</div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>    std::array&lt;int, N&gt; Y{};  <span class="comment">// corresponding y-values</span></div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span> </div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>    <span class="comment">// generate sample points in the interval</span></div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>    <span class="comment">// [-range2/100 , (range2-1)/100]</span></div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>    <span class="keywordtype">int</span> range = 200;          <span class="comment">// sample points full-range</span></div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>    <span class="keywordtype">int</span> range2 = range &gt;&gt; 1;  <span class="comment">// sample points half-range</span></div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N; i++) {</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>        <span class="keywordtype">double</span> x0 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>        <span class="keywordtype">double</span> x1 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>        <span class="keywordtype">double</span> x2 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>        X[i] = std::vector&lt;double&gt;({x0, x1, x2, x0 * x0, x1 * x1, x2 * x2});</div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>        Y[i] = ((x0 * x0) + (x1 * x1) + (x2 * x2)) &lt;= 1.f ? 1 : -1;</div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>    }</div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span> </div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 3 -------&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Model before fit: &quot;</span> &lt;&lt; ada &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span> </div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>    ada.<a class="code hl_function" href="../../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5">fit</a>(X, Y);</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Model after fit: &quot;</span> &lt;&lt; ada &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span> </div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>    <span class="keywordtype">int</span> N_test_cases = 5;</div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N_test_cases; i++) {</div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>        <span class="keywordtype">double</span> x0 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>        <span class="keywordtype">double</span> x1 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>        <span class="keywordtype">double</span> x2 = (<span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range) - range2) / 100.f;</div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span> </div>
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span>        <span class="keywordtype">int</span> predict = ada.<a class="code hl_function" href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3">predict</a>({x0, x1, x2, x0 * x0, x1 * x1, x2 * x2});</div>
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span> </div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Predict for x=(&quot;</span> &lt;&lt; x0 &lt;&lt; <span class="stringliteral">&quot;,&quot;</span> &lt;&lt; x1 &lt;&lt; <span class="stringliteral">&quot;,&quot;</span> &lt;&lt; x2</div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>                  &lt;&lt; <span class="stringliteral">&quot;): &quot;</span> &lt;&lt; predict;</div>
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span> </div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>        <span class="keywordtype">int</span> expected_val = ((x0 * x0) + (x1 * x1) + (x2 * x2)) &lt;= 1.f ? 1 : -1;</div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>        assert(predict == expected_val);</div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>        std::cout &lt;&lt; <span class="stringliteral">&quot; ...passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>    }</div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>}</div>
+</div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span> </div>
+<div class="foldopen" id="foldopen00357" data-start="{" data-end="}">
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"><a class="line" href="../../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">  357</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> **argv) {</div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>    std::srand(std::time(<span class="keyword">nullptr</span>));  <span class="comment">// initialize random number generator</span></div>
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span> </div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>    <span class="keywordtype">double</span> eta = 0.1;  <span class="comment">// default value of eta</span></div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>    <span class="keywordflow">if</span> (argc == 2) {   <span class="comment">// read eta value from commandline argument if present</span></div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>        eta = strtof(argv[1], <span class="keyword">nullptr</span>);</div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>    }</div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span> </div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>    <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>(eta);</div>
+<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span> </div>
+<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Press ENTER to continue...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>    std::cin.get();</div>
+<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span> </div>
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>    <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>(eta);</div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span> </div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Press ENTER to continue...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>    std::cin.get();</div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span> </div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>    <a class="code hl_function" href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a>(eta);</div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span> </div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>}</div>
+</div>
+<div class="ttc" id="aclassmachine__learning_1_1adaline_html"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html">machine_learning::adaline</a></div><div class="ttdef"><b>Definition</b> <a href="#l00046">adaline_learning.cpp:46</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a082f758fb55fe19f22b3df66f89b2325"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325">machine_learning::adaline::activation</a></div><div class="ttdeci">int activation(double x)</div><div class="ttdef"><b>Definition</b> <a href="#l00186">adaline_learning.cpp:186</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a0acbe32aaab897e7939e5b0454035b8c"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c">machine_learning::adaline::adaline</a></div><div class="ttdeci">adaline(int num_features, const double eta=0.01f, const double accuracy=1e-5)</div><div class="ttdef"><b>Definition</b> <a href="#l00055">adaline_learning.cpp:55</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a28160d17e492597a2f112e0d38551cda"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda">machine_learning::adaline::eta</a></div><div class="ttdeci">const double eta</div><div class="ttdoc">learning rate of the algorithm</div><div class="ttdef"><b>Definition</b> <a href="#l00207">adaline_learning.cpp:207</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a4cd8fe438032fedaa66f93bfd66f5492"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492">machine_learning::adaline::weights</a></div><div class="ttdeci">std::vector&lt; double &gt; weights</div><div class="ttdoc">weights of the neural network</div><div class="ttdef"><b>Definition</b> <a href="#l00209">adaline_learning.cpp:209</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a74e3c6c037b67895014414c5d75465e5"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5">machine_learning::adaline::fit</a></div><div class="ttdeci">double fit(const std::vector&lt; double &gt; &amp;x, const int &amp;y)</div><div class="ttdef"><b>Definition</b> <a href="#l00119">adaline_learning.cpp:119</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a8d61f9ed872eef26bca39388cbda6a91"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91">machine_learning::adaline::fit</a></div><div class="ttdeci">void fit(std::array&lt; std::vector&lt; double &gt;, N &gt; const &amp;X, std::array&lt; int, N &gt; const &amp;Y)</div><div class="ttdef"><b>Definition</b> <a href="#l00145">adaline_learning.cpp:145</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1adaline_html_aa23d60262f917f35836ef4b1c1d9f7d3"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3">machine_learning::adaline::accuracy</a></div><div class="ttdeci">const double accuracy</div><div class="ttdoc">model fit convergence accuracy</div><div class="ttdef"><b>Definition</b> <a href="#l00208">adaline_learning.cpp:208</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1adaline_html_ab11242d9ad5b03a75911e29b04f78fd3"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3">machine_learning::adaline::predict</a></div><div class="ttdeci">int predict(const std::vector&lt; double &gt; &amp;x, double *out=nullptr)</div><div class="ttdef"><b>Definition</b> <a href="#l00095">adaline_learning.cpp:95</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1adaline_html_ac8a9c2aaaa63b0f27ea176857e1e7d56"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56">machine_learning::adaline::check_size_match</a></div><div class="ttdeci">bool check_size_match(const std::vector&lt; double &gt; &amp;x)</div><div class="ttdef"><b>Definition</b> <a href="#l00196">adaline_learning.cpp:196</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1adaline_html_ae347040516e995c8fb8ca2e5c0496daa"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#ae347040516e995c8fb8ca2e5c0496daa">machine_learning::adaline::operator&lt;&lt;</a></div><div class="ttdeci">friend std::ostream &amp; operator&lt;&lt;(std::ostream &amp;out, const adaline &amp;ada)</div><div class="ttdef"><b>Definition</b> <a href="#l00076">adaline_learning.cpp:76</a></div></div>
+<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00187">dsu_path_compression.cpp:187</a></div></div>
+<div class="ttc" id="adsu__path__compression_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-test implementations, 1st test.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00170">dsu_path_compression.cpp:170</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="agroup__machine__learning_html_ga5118e5cbc4f0886e27b3a7a2544dded1"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1">MAX_ITER</a></div><div class="ttdeci">constexpr int MAX_ITER</div><div class="ttdef"><b>Definition</b> <a href="#l00040">adaline_learning.cpp:40</a></div></div>
+<div class="ttc" id="ahamiltons__cycle_8cpp_html_a0cc94918b6831f308d4fe4fa27f08299"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a></div><div class="ttdeci">static void test3()</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d0c/hamiltons__cycle_8cpp_source.html#l00122">hamiltons_cycle.cpp:122</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></div><div class="ttdoc">A* search algorithm</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_3343723ae086de42ee4ca9774da3a13f.html">machine_learning</a></li><li class="navelem"><a class="el" href="../../d5/db0/adaline__learning_8cpp.html">adaline_learning.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html b/d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html
index eb907676b..0b5a44312 100644
--- a/d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html
+++ b/d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: operations_on_datastructures::inorder_traversal_of_bst::Node Class Reference</title>
+<title>TheAlgorithms/C++: operations_on_datastructures::inorder_traversal_of_bst::Node Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,23 +138,77 @@ Collaboration diagram for operations_on_datastructures::inorder_traversal_of_bst
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:ae161f3e5ef33ade73429cab9291612e2" id="r_ae161f3e5ef33ade73429cab9291612e2"><td class="memItemLeft" align="right" valign="top"><a id="ae161f3e5ef33ade73429cab9291612e2" name="ae161f3e5ef33ade73429cab9291612e2"></a>
-int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
-<tr class="memdesc:ae161f3e5ef33ade73429cab9291612e2"><td class="mdescLeft">&#160;</td><td class="mdescRight">The key/value of the node. <br /></td></tr>
+<tr class="memitem:ae161f3e5ef33ade73429cab9291612e2" id="r_ae161f3e5ef33ade73429cab9291612e2"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae161f3e5ef33ade73429cab9291612e2">data</a></td></tr>
+<tr class="memdesc:ae161f3e5ef33ade73429cab9291612e2"><td class="mdescLeft">&#160;</td><td class="mdescRight">The key/value of the node.  <br /></td></tr>
 <tr class="separator:ae161f3e5ef33ade73429cab9291612e2"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a9ccef4c746b7226488b014f5bac4789a" id="r_a9ccef4c746b7226488b014f5bac4789a"><td class="memItemLeft" align="right" valign="top"><a id="a9ccef4c746b7226488b014f5bac4789a" name="a9ccef4c746b7226488b014f5bac4789a"></a>
-<a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>left</b></td></tr>
-<tr class="memdesc:a9ccef4c746b7226488b014f5bac4789a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Pointer to Left child. <br /></td></tr>
+<tr class="memitem:a9ccef4c746b7226488b014f5bac4789a" id="r_a9ccef4c746b7226488b014f5bac4789a"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9ccef4c746b7226488b014f5bac4789a">left</a></td></tr>
+<tr class="memdesc:a9ccef4c746b7226488b014f5bac4789a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Pointer to Left child.  <br /></td></tr>
 <tr class="separator:a9ccef4c746b7226488b014f5bac4789a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a9b4ae6f5179a1c8ecfd563811a59e6c0" id="r_a9b4ae6f5179a1c8ecfd563811a59e6c0"><td class="memItemLeft" align="right" valign="top"><a id="a9b4ae6f5179a1c8ecfd563811a59e6c0" name="a9b4ae6f5179a1c8ecfd563811a59e6c0"></a>
-<a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>right</b></td></tr>
-<tr class="memdesc:a9b4ae6f5179a1c8ecfd563811a59e6c0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Pointer to right child. <br /></td></tr>
+<tr class="memitem:a9b4ae6f5179a1c8ecfd563811a59e6c0" id="r_a9b4ae6f5179a1c8ecfd563811a59e6c0"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9b4ae6f5179a1c8ecfd563811a59e6c0">right</a></td></tr>
+<tr class="memdesc:a9b4ae6f5179a1c8ecfd563811a59e6c0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Pointer to right child.  <br /></td></tr>
 <tr class="separator:a9b4ae6f5179a1c8ecfd563811a59e6c0"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>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. </p>
-</div><hr/>The documentation for this class was generated from the following file:<ul>
-<li>operations_on_datastructures/<a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp.html">inorder_successor_of_bst.cpp</a></li>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00056">56</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
+</div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="ae161f3e5ef33ade73429cab9291612e2" name="ae161f3e5ef33ade73429cab9291612e2"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ae161f3e5ef33ade73429cab9291612e2">&#9670;&#160;</a></span>data</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int64_t operations_on_datastructures::inorder_traversal_of_bst::Node::data</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>The key/value of the node. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a9ccef4c746b7226488b014f5bac4789a" name="a9ccef4c746b7226488b014f5bac4789a"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a9ccef4c746b7226488b014f5bac4789a">&#9670;&#160;</a></span>left</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><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::Node::left</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Pointer to Left child. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a9b4ae6f5179a1c8ecfd563811a59e6c0" name="a9b4ae6f5179a1c8ecfd563811a59e6c0"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a9b4ae6f5179a1c8ecfd563811a59e6c0">&#9670;&#160;</a></span>right</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><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::Node::right</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Pointer to right child. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00060">60</a> of file <a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a>.</p>
+
+</div>
+</div>
+<hr/>The documentation for this class was generated from the following file:<ul>
+<li>operations_on_datastructures/<a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html">inorder_successor_of_bst.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d5/db5/set__kth__bit_8cpp.html b/d5/db5/set__kth__bit_8cpp.html
index 444ac2a89..022e2448c 100644
--- a/d5/db5/set__kth__bit_8cpp.html
+++ b/d5/db5/set__kth__bit_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: bit_manipulation/set_kth_bit.cpp File Reference</title>
+<title>TheAlgorithms/C++: bit_manipulation/set_kth_bit.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for set_kth_bit.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d43/set__kth__bit_8cpp__incl.svg" width="255" height="126"><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">
+</div>
+<p><a href="../../d5/db5/set__kth__bit_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></td></tr>
@@ -133,7 +152,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:ad4d0ffd9331242c42a28834ee19f5fd9" id="r_ad4d0ffd9331242c42a28834ee19f5fd9"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad4d0ffd9331242c42a28834ee19f5fd9">bit_manipulation::set_kth_bit::setKthBit</a> (std ::int64_t N, std ::int64_t k)</td></tr>
+<tr class="memitem:ad4d0ffd9331242c42a28834ee19f5fd9" id="r_ad4d0ffd9331242c42a28834ee19f5fd9"><td class="memItemLeft" align="right" valign="top">std::uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad4d0ffd9331242c42a28834ee19f5fd9">bit_manipulation::set_kth_bit::setKthBit</a> (std ::int64_t N, std ::int64_t k)</td></tr>
 <tr class="memdesc:ad4d0ffd9331242c42a28834ee19f5fd9"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function implements set kth bit.  <br /></td></tr>
 <tr class="separator:ad4d0ffd9331242c42a28834ee19f5fd9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
 <p>Given a number N and a value K. From the right, set the Kth bit in the binary representation of N. The position of Least Significant Bit(or last bit) is 0, the second last bit is 1 and so on. in it.</p>
 <p>A binary number consists of two digits. They are 0 &amp; 1. Digit 1 is known as set bit in computer terms. Worst Case Time Complexity: O(1) Space complexity: O(1)</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/aman2000raj" target="_blank">Aman Raj</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d5/db5/set__kth__bit_8cpp_source.html">set_kth_bit.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -166,17 +187,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/db5/set__kth__bit_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../d5/db5/set__kth__bit_8cpp_source.html">set_kth_bit.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   77</span>           {</div>
 <div class="line"><span class="lineno">   78</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   79</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   80</span>}</div>
-<div class="ttc" id="aset__kth__bit_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> set_kth_bit.cpp:61</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/db5/set__kth__bit_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aset__kth__bit_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/db5/set__kth__bit_8cpp_source.html#l00061">set_kth_bit.cpp:61</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad4d0ffd9331242c42a28834ee19f5fd9" name="ad4d0ffd9331242c42a28834ee19f5fd9"></a>
@@ -186,7 +204,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> bit_manipulation::set_kth_bit::setKthBit </td>
+          <td class="memname">std::uint64_t bit_manipulation::set_kth_bit::setKthBit </td>
           <td>(</td>
           <td class="paramtype">std ::int64_t</td>          <td class="paramname"><span class="paramname"><em>N</em></span>, </td>
         </tr>
@@ -206,6 +224,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>returns an integer after setting the K'th bit in N </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/db5/set__kth__bit_8cpp_source.html#l00043">43</a> of file <a class="el" href="../../d5/db5/set__kth__bit_8cpp_source.html">set_kth_bit.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   44</span>                                       {  <span class="comment">// int64_t is preferred over int so</span></div>
 <div class="line"><span class="lineno">   45</span>                                            <span class="comment">// that no Overflow can be there.</span></div>
 <div class="line"><span class="lineno">   46</span> </div>
@@ -216,8 +236,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   51</span>    <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> | pos;  <span class="comment">// by taking or with the pos and the N we set the bit of N</span></div>
 <div class="line"><span class="lineno">   52</span>                     <span class="comment">// at kth position.</span></div>
 <div class="line"><span class="lineno">   53</span>}</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -246,6 +266,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/db5/set__kth__bit_8cpp_source.html#l00061">61</a> of file <a class="el" href="../../d5/db5/set__kth__bit_8cpp_source.html">set_kth_bit.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   61</span>                   {</div>
 <div class="line"><span class="lineno">   62</span>    <span class="comment">// n = 10,2 return 14</span></div>
 <div class="line"><span class="lineno">   63</span>    assert(bit_manipulation::set_kth_bit::setKthBit(10, 2) == 14);</div>
@@ -256,16 +278,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   68</span>    <span class="comment">// n = 123 return 123</span></div>
 <div class="line"><span class="lineno">   69</span>    assert(bit_manipulation::set_kth_bit::setKthBit(123, 3) == 123);</div>
 <div class="line"><span class="lineno">   70</span> </div>
-<div class="line"><span class="lineno">   71</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All test cases successfully passed!&quot;</span> &lt;&lt; <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">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   72</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="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><!-- 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="../../d5/db5/set__kth__bit_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d5/db5/set__kth__bit_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d5/db5/set__kth__bit_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index e85e01374..000000000
--- a/d5/db5/set__kth__bit_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/d5/db5/set__kth__bit_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/db5/set__kth__bit_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 5901bc148..000000000
--- a/d5/db5/set__kth__bit_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-729fb887ee50b6291b0542ba0592a5c7
\ No newline at end of file
diff --git a/d5/db5/set__kth__bit_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/db5/set__kth__bit_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 2e04695b9..000000000
--- a/d5/db5/set__kth__bit_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/db5/set__kth__bit_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d5/db5/set__kth__bit_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1813bd719..000000000
--- a/d5/db5/set__kth__bit_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/db5/set__kth__bit_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/db5/set__kth__bit_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index d52d529cf..000000000
--- a/d5/db5/set__kth__bit_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/d5/db5/set__kth__bit_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/db5/set__kth__bit_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index bf7698871..000000000
--- a/d5/db5/set__kth__bit_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-87002529987fcecc37678ed1d22b7eed
\ No newline at end of file
diff --git a/d5/db5/set__kth__bit_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/db5/set__kth__bit_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index e37116d26..000000000
--- a/d5/db5/set__kth__bit_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/db5/set__kth__bit_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/db5/set__kth__bit_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 4d60ead47..000000000
--- a/d5/db5/set__kth__bit_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/db5/set__kth__bit_8cpp_source.html b/d5/db5/set__kth__bit_8cpp_source.html
new file mode 100644
index 000000000..c6f40add5
--- /dev/null
+++ b/d5/db5/set__kth__bit_8cpp_source.html
@@ -0,0 +1,184 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: bit_manipulation/set_kth_bit.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/db5/set__kth__bit_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">set_kth_bit.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d5/db5/set__kth__bit_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a> {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="keyword">namespace </span>set_kth_bit {</div>
+<div class="foldopen" id="foldopen00043" data-start="{" data-end="}">
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="../../d5/db5/set__kth__bit_8cpp.html#ad4d0ffd9331242c42a28834ee19f5fd9">   43</a></span>std::uint64_t <a class="code hl_namespace" href="../../d8/d88/namespaceset_kth_bit.html">setKthBit</a>(std ::int64_t N,</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>                        std ::int64_t k) {  <span class="comment">// int64_t is preferred over int so</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>                                            <span class="comment">// that no Overflow can be there.</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordtype">int</span> pos =</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        1 &lt;&lt; k;  <span class="comment">// &quot;pos&quot; variable is used to store 1 at kth postion and</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>                 <span class="comment">// rest bits are 0. in binary representation of number &#39;n&#39;</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordflow">return</span> N | pos;  <span class="comment">// by taking or with the pos and the N we set the bit of N</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>                     <span class="comment">// at kth position.</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>}</div>
+</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>}  <span class="comment">// namespace set_kth_bit</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>}  <span class="comment">// namespace bit_manipulation</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="foldopen" id="foldopen00061" data-start="{" data-end="}">
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"><a class="line" href="../../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   61</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="comment">// n = 10,2 return 14</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    assert(bit_manipulation::set_kth_bit::setKthBit(10, 2) == 14);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="comment">// n = 25,1 return 27</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    assert(bit_manipulation::set_kth_bit::setKthBit(25, 1) == 27);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="comment">// n = 400001,5 return 400033</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    assert(bit_manipulation::set_kth_bit::setKthBit(400001, 5) == 400033);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="comment">// n = 123 return 123</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    assert(bit_manipulation::set_kth_bit::setKthBit(123, 3) == 123);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00077" data-start="{" data-end="}">
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   77</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <a class="code hl_function" href="../../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>}</div>
+</div>
+<div class="ttc" id="anamespacebit__manipulation_html"><div class="ttname"><a href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespaceset_kth_bit_html"><div class="ttname"><a href="../../d8/d88/namespaceset_kth_bit.html">setKthBit</a></div><div class="ttdoc">Functions for the [From the right, set the Kth bit in the binary representation of N] (https://practi...</div></div>
+<div class="ttc" id="aset__kth__bit_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/db5/set__kth__bit_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> <a href="#l00061">set_kth_bit.cpp:61</a></div></div>
+<div class="ttc" id="aset__kth__bit_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00077">set_kth_bit.cpp:77</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_f3c4fbc4e901afa0a54d0623c5574aa7.html">bit_manipulation</a></li><li class="navelem"><a class="el" href="../../d5/db5/set__kth__bit_8cpp.html">set_kth_bit.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/db8/namespacemincoins__topdown.html b/d5/db8/namespacemincoins__topdown.html
index 5f2f18745..0cc5758fb 100644
--- a/d5/db8/namespacemincoins__topdown.html
+++ b/d5/db8/namespacemincoins__topdown.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: mincoins_topdown Namespace Reference</title>
+<title>TheAlgorithms/C++: mincoins_topdown Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d5/dc3/structdata__structures_1_1_node__coll__graph.map b/d5/dc3/structdata__structures_1_1_node__coll__graph.map
index 5e50391d3..c26648662 100644
--- a/d5/dc3/structdata__structures_1_1_node__coll__graph.map
+++ b/d5/dc3/structdata__structures_1_1_node__coll__graph.map
@@ -1,8 +1,8 @@
 <map id="data_structures::Node" name="data_structures::Node">
 <area shape="rect" id="Node000001" title=" " alt="" coords="63,5,213,31"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="5,94,151,135"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="5,94,151,135"/>
 <area shape="poly" id="edge3_Node000003_Node000001" title=" " alt="" coords="124,45,93,95,88,92,120,43"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="59,198,220,253"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="59,198,220,253"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="166,183,170,173,174,133,167,94,155,59,143,33,147,30,160,57,173,92,180,133,175,174,171,185"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="99,147,126,196,122,199,94,150"/>
 </map>
diff --git a/d5/dc3/structdata__structures_1_1_node__coll__graph.md5 b/d5/dc3/structdata__structures_1_1_node__coll__graph.md5
index 31f708eec..465c6f618 100644
--- a/d5/dc3/structdata__structures_1_1_node__coll__graph.md5
+++ b/d5/dc3/structdata__structures_1_1_node__coll__graph.md5
@@ -1 +1 @@
-a0d0e34c0298ccbb58e6470d3f095a29
\ No newline at end of file
+0be2da0b9820cc925e324f5b711e445a
\ No newline at end of file
diff --git a/d5/dc3/structdata__structures_1_1_node__coll__graph.svg b/d5/dc3/structdata__structures_1_1_node__coll__graph.svg
index b5dae6829..f601a30a4 100644
--- a/d5/dc3/structdata__structures_1_1_node__coll__graph.svg
+++ b/d5/dc3/structdata__structures_1_1_node__coll__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="109,-119.5 0,-119.5 0,-89 109,-89 109,-119.5"/>
 <text text-anchor="start" x="8" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; data</text>
 <text text-anchor="middle" x="54.5" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">_structures::Node &gt;</text>
@@ -51,7 +51,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="160.62,-41.75 40.38,-41.75 40.38,0 160.62,0 160.62,-41.75"/>
 <text text-anchor="start" x="48.38" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::shared</text>
 <text text-anchor="start" x="48.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_ptr&lt; data_structures::</text>
diff --git a/d5/dc3/structdata__structures_1_1_node__coll__graph_org.svg b/d5/dc3/structdata__structures_1_1_node__coll__graph_org.svg
index 105df7f96..f0de980ce 100644
--- a/d5/dc3/structdata__structures_1_1_node__coll__graph_org.svg
+++ b/d5/dc3/structdata__structures_1_1_node__coll__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="109,-119.5 0,-119.5 0,-89 109,-89 109,-119.5"/>
 <text text-anchor="start" x="8" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; data</text>
 <text text-anchor="middle" x="54.5" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">_structures::Node &gt;</text>
@@ -40,7 +40,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="160.62,-41.75 40.38,-41.75 40.38,0 160.62,0 160.62,-41.75"/>
 <text text-anchor="start" x="48.38" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::shared</text>
 <text text-anchor="start" x="48.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_ptr&lt; data_structures::</text>
diff --git a/d5/dc5/morrisinorder_8cpp_source.html b/d5/dc5/morrisinorder_8cpp_source.html
new file mode 100644
index 000000000..5c45b253c
--- /dev/null
+++ b/d5/dc5/morrisinorder_8cpp_source.html
@@ -0,0 +1,244 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/morrisinorder.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/dc5/morrisinorder_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">morrisinorder.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;queue&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment">/**************************</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment">    @author shrutisheoran</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment">**************************/</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
+<div class="foldopen" id="foldopen00010" data-start="{" data-end="};">
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"><a class="line" href="../../d9/d90/struct_btree.html">   10</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../d9/d90/struct_btree.html">Btree</a> {</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    <span class="keywordtype">int</span> data;</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../d9/d90/struct_btree.html">Btree</a> *left;   <span class="comment">// Pointer to left subtree</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../d9/d90/struct_btree.html">Btree</a> *right;  <span class="comment">// Pointer to right subtree</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>};</div>
+</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>(<a class="code hl_struct" href="../../d9/d90/struct_btree.html">Btree</a> **root, <span class="keywordtype">int</span> d) {</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <a class="code hl_struct" href="../../d9/d90/struct_btree.html">Btree</a> *nn = <span class="keyword">new</span> <a class="code hl_struct" href="../../d9/d90/struct_btree.html">Btree</a>();  <span class="comment">// Creating new node</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    nn-&gt;data = d;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    nn-&gt;left = NULL;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    nn-&gt;right = NULL;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keywordflow">if</span> (*root == NULL) {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        *root = nn;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        queue&lt;Btree *&gt; q;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        <span class="comment">// Adding root node to queue</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        q.push(*root);</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        <span class="keywordflow">while</span> (!q.empty()) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>            <a class="code hl_struct" href="../../d9/d90/struct_btree.html">Btree</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = q.front();</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>            <span class="comment">// Removing parent node from queue</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>            q.pop();</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>            <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left)</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>                <span class="comment">// Adding left child of removed node to queue</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>                q.push(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left);</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>            <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>                <span class="comment">// Adding new node if no left child is present</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>                <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left = nn;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>                <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            }</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>            <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right)</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>                <span class="comment">// Adding right child of removed node to queue</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>                q.push(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right);</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>            <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>                <span class="comment">// Adding new node if no right child is present</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>                <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right = nn;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>                <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>}</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="keywordtype">void</span> morrisInorder(<a class="code hl_struct" href="../../d9/d90/struct_btree.html">Btree</a> *root) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <a class="code hl_struct" href="../../d9/d90/struct_btree.html">Btree</a> *curr = root;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <a class="code hl_struct" href="../../d9/d90/struct_btree.html">Btree</a> *temp;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordflow">while</span> (curr) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        <span class="keywordflow">if</span> (curr-&gt;left == NULL) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            cout &lt;&lt; curr-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>            <span class="comment">// If left of current node is NULL then curr is shifted to right</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            curr = curr-&gt;right;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            <span class="comment">// Left of current node is stored in temp</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            temp = curr-&gt;left;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            <span class="comment">// Moving to extreme right of temp</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            <span class="keywordflow">while</span> (temp-&gt;right &amp;&amp; temp-&gt;right != curr) temp = temp-&gt;right;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            <span class="comment">// If extreme right is null it is made to point to currrent node</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            <span class="comment">// (will be used for backtracking)</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            <span class="keywordflow">if</span> (temp-&gt;right == NULL) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                temp-&gt;right = curr;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>                <span class="comment">// current node is made to point its left subtree</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>                curr = curr-&gt;left;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>            }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            <span class="comment">// If extreme right already points to currrent node it it set to</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            <span class="comment">// null</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (temp-&gt;right == curr) {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>                cout &lt;&lt; curr-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>                temp-&gt;right = NULL;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>                <span class="comment">// current node is made to point its right subtree</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>                curr = curr-&gt;right;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        }</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    }</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>}</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span><span class="keywordtype">void</span> deleteAll(<span class="keyword">const</span> <a class="code hl_struct" href="../../d9/d90/struct_btree.html">Btree</a> *<span class="keyword">const</span> root) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keywordflow">if</span> (root) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        deleteAll(root-&gt;left);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        deleteAll(root-&gt;right);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        <span class="keyword">delete</span> root;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>}</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="comment">// Testing morrisInorder funtion</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <a class="code hl_struct" href="../../d9/d90/struct_btree.html">Btree</a> *root = NULL;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keywordtype">int</span> i;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="keywordflow">for</span> (i = 1; i &lt;= 7; i++) <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>(&amp;root, i);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    cout &lt;&lt; <span class="stringliteral">&quot;Morris Inorder: &quot;</span>;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    morrisInorder(root);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    deleteAll(root);</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>}</div>
+<div class="ttc" id="aavltree_8cpp_html_a2473fe7416332495b2678ebe89652e4b"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a></div><div class="ttdeci">node * insert(node *root, int item)</div><div class="ttdoc">inserts a new element into AVL tree</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00092">avltree.cpp:92</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="astruct_btree_html"><div class="ttname"><a href="../../d9/d90/struct_btree.html">Btree</a></div><div class="ttdef"><b>Definition</b> <a href="#l00010">morrisinorder.cpp:10</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><b>morrisinorder.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/dca/classrange__queries_1_1per_seg_tree_1_1_node-members.html b/d5/dca/classrange__queries_1_1per_seg_tree_1_1_node-members.html
index 59c3b3223..cd84cb877 100644
--- a/d5/dca/classrange__queries_1_1per_seg_tree_1_1_node-members.html
+++ b/d5/dca/classrange__queries_1_1per_seg_tree_1_1_node-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d5/dd0/namespacephysics.html b/d5/dd0/namespacephysics.html
index 03a98bd53..65e43fa6a 100644
--- a/d5/dd0/namespacephysics.html
+++ b/d5/dd0/namespacephysics.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: physics Namespace Reference</title>
+<title>TheAlgorithms/C++: physics Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -112,7 +129,7 @@ $(function(){initNavTree('d5/dd0/namespacephysics.html','../../'); initResizable
 <a href="#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 <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow()</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin()</a>, and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos()</a></p>
+<p>for std::pow(), std::sin(), and std::cos()</p>
 <p>Physics algorithms </p>
 </div></div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d5/ddb/bogo__sort_8cpp.html b/d5/ddb/bogo__sort_8cpp.html
index 499d6960c..113549ad5 100644
--- a/d5/ddb/bogo__sort_8cpp.html
+++ b/d5/ddb/bogo__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/bogo_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/bogo_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for bogo_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../de/df7/bogo__sort_8cpp__incl.svg" width="432" height="111"><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">
+</div>
+<p><a href="../../d5/ddb/bogo__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -133,13 +152,13 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a7bfe11bd4703eacd1dab93f25ec639c5" id="r_a7bfe11bd4703eacd1dab93f25ec639c5"><td class="memTemplParams" colspan="2">template&lt;typename T , size_t N&gt; </td></tr>
-<tr class="memitem:a7bfe11bd4703eacd1dab93f25ec639c5"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a7bfe11bd4703eacd1dab93f25ec639c5">sorting::shuffle</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; arr)</td></tr>
+<tr class="memitem:a7bfe11bd4703eacd1dab93f25ec639c5"><td class="memTemplItemLeft" align="right" valign="top">std::array&lt; T, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a7bfe11bd4703eacd1dab93f25ec639c5">sorting::shuffle</a> (std::array&lt; T, N &gt; arr)</td></tr>
 <tr class="separator:a7bfe11bd4703eacd1dab93f25ec639c5"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:affc6ee160142cd017f8c4b213437d0fd" id="r_affc6ee160142cd017f8c4b213437d0fd"><td class="memTemplParams" colspan="2">template&lt;typename T , size_t N&gt; </td></tr>
-<tr class="memitem:affc6ee160142cd017f8c4b213437d0fd"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd">sorting::randomized_bogosort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; arr)</td></tr>
+<tr class="memitem:affc6ee160142cd017f8c4b213437d0fd"><td class="memTemplItemLeft" align="right" valign="top">std::array&lt; T, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd">sorting::randomized_bogosort</a> (std::array&lt; T, N &gt; arr)</td></tr>
 <tr class="separator:affc6ee160142cd017f8c4b213437d0fd"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae8adaeff66471f9ed84f2e673b38a859" id="r_ae8adaeff66471f9ed84f2e673b38a859"><td class="memTemplParams" colspan="2">template&lt;typename T , size_t N&gt; </td></tr>
-<tr class="memitem:ae8adaeff66471f9ed84f2e673b38a859"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae8adaeff66471f9ed84f2e673b38a859">show_array</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; &amp;arr)</td></tr>
+<tr class="memitem:ae8adaeff66471f9ed84f2e673b38a859"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae8adaeff66471f9ed84f2e673b38a859">show_array</a> (const std::array&lt; T, N &gt; &amp;arr)</td></tr>
 <tr class="separator:ae8adaeff66471f9ed84f2e673b38a859"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae1a3968e7947464bee7714f6d43b7002" id="r_ae1a3968e7947464bee7714f6d43b7002"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae1a3968e7947464bee7714f6d43b7002">test</a> ()</td></tr>
 <tr class="separator:ae1a3968e7947464bee7714f6d43b7002"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -153,6 +172,8 @@ Functions</h2></td></tr>
 Algorithm</h3>
 <p>Shuffle the array untill array is sorted.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/imdeep2905" target="_blank">Deep Raval</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d5/ddb/bogo__sort_8cpp_source.html">bogo_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -169,28 +190,24 @@ Algorithm</h3>
       </table>
 </div><div class="memdoc">
 <p>Driver Code </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/ddb/bogo__sort_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../d5/ddb/bogo__sort_8cpp_source.html">bogo_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  107</span>           {</div>
 <div class="line"><span class="lineno">  108</span>    <span class="comment">// Testing</span></div>
 <div class="line"><span class="lineno">  109</span>    <a class="code hl_function" href="#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
 <div class="line"><span class="lineno">  110</span>    <span class="comment">// Example Usage</span></div>
 <div class="line"><span class="lineno">  111</span>    std::array &lt;int, 5&gt; arr = {3, 7, 10, 4, 1}; <span class="comment">// Defining array which we want to sort</span></div>
-<div class="line"><span class="lineno">  112</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Original Array : &quot;</span>;</div>
+<div class="line"><span class="lineno">  112</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original Array : &quot;</span>;</div>
 <div class="line"><span class="lineno">  113</span>    <a class="code hl_function" href="#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr);</div>
 <div class="line"><span class="lineno">  114</span>    arr = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd">sorting::randomized_bogosort</a>(arr); <span class="comment">// Callling bogo sort on it</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> &lt;&lt; <span class="stringliteral">&quot;Sorted Array : &quot;</span>;</div>
+<div class="line"><span class="lineno">  115</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted Array : &quot;</span>;</div>
 <div class="line"><span class="lineno">  116</span>    <a class="code hl_function" href="#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr); <span class="comment">// Printing sorted array</span></div>
 <div class="line"><span class="lineno">  117</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  118</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="abogo__sort_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> bogo_sort.cpp:81</div></div>
-<div class="ttc" id="abogo__sort_8cpp_html_ae8adaeff66471f9ed84f2e673b38a859"><div class="ttname"><a href="#ae8adaeff66471f9ed84f2e673b38a859">show_array</a></div><div class="ttdeci">void show_array(const std::array&lt; T, N &gt; &amp;arr)</div><div class="ttdef"><b>Definition</b> bogo_sort.cpp:71</div></div>
-<div class="ttc" id="anamespacesorting_html_affc6ee160142cd017f8c4b213437d0fd"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd">sorting::randomized_bogosort</a></div><div class="ttdeci">std::array&lt; T, N &gt; randomized_bogosort(std::array&lt; T, N &gt; arr)</div><div class="ttdef"><b>Definition</b> bogo_sort.cpp:52</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="499" height="298"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="abogo__sort_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d5/ddb/bogo__sort_8cpp_source.html#l00081">bogo_sort.cpp:81</a></div></div>
+<div class="ttc" id="abogo__sort_8cpp_html_ae8adaeff66471f9ed84f2e673b38a859"><div class="ttname"><a href="#ae8adaeff66471f9ed84f2e673b38a859">show_array</a></div><div class="ttdeci">void show_array(const std::array&lt; T, N &gt; &amp;arr)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/ddb/bogo__sort_8cpp_source.html#l00071">bogo_sort.cpp:71</a></div></div>
+<div class="ttc" id="anamespacesorting_html_affc6ee160142cd017f8c4b213437d0fd"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd">sorting::randomized_bogosort</a></div><div class="ttdeci">std::array&lt; T, N &gt; randomized_bogosort(std::array&lt; T, N &gt; arr)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/ddb/bogo__sort_8cpp_source.html#l00052">bogo_sort.cpp:52</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae8adaeff66471f9ed84f2e673b38a859" name="ae8adaeff66471f9ed84f2e673b38a859"></a>
@@ -204,7 +221,7 @@ template&lt;typename T , size_t N&gt; </div>
         <tr>
           <td class="memname">void show_array </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
+          <td class="paramtype">const std::array&lt; T, N &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -222,11 +239,13 @@ template&lt;typename T , size_t N&gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/ddb/bogo__sort_8cpp_source.html#l00071">71</a> of file <a class="el" href="../../d5/ddb/bogo__sort_8cpp_source.html">bogo_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   71</span>                                             {</div>
 <div class="line"><span class="lineno">   72</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x : arr) {</div>
-<div class="line"><span class="lineno">   73</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; x &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><span class="lineno">   73</span>        std::cout &lt;&lt; x &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
 <div class="line"><span class="lineno">   74</span>    }</div>
-<div class="line"><span class="lineno">   75</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><span class="lineno">   75</span>    std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
 <div class="line"><span class="lineno">   76</span>}</div>
 </div><!-- fragment -->
 </div>
@@ -246,38 +265,33 @@ template&lt;typename T , size_t N&gt; </div>
       </table>
 </div><div class="memdoc">
 <p>Function to test above algorithm </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/ddb/bogo__sort_8cpp_source.html#l00081">81</a> of file <a class="el" href="../../d5/ddb/bogo__sort_8cpp_source.html">bogo_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   81</span>            {</div>
 <div class="line"><span class="lineno">   82</span>    <span class="comment">// Test 1</span></div>
 <div class="line"><span class="lineno">   83</span>    std::array &lt;int, 5&gt; arr1;</div>
 <div class="line"><span class="lineno">   84</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> &amp;x : arr1) {</div>
-<div class="line"><span class="lineno">   85</span>        x = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 100;</div>
+<div class="line"><span class="lineno">   85</span>        x = std::rand() % 100;</div>
 <div class="line"><span class="lineno">   86</span>    }</div>
-<div class="line"><span class="lineno">   87</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Original Array : &quot;</span>;</div>
+<div class="line"><span class="lineno">   87</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original Array : &quot;</span>;</div>
 <div class="line"><span class="lineno">   88</span>    <a class="code hl_function" href="#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr1);</div>
 <div class="line"><span class="lineno">   89</span>    arr1 = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd">sorting::randomized_bogosort</a>(arr1);</div>
-<div class="line"><span class="lineno">   90</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Sorted Array : &quot;</span>;</div>
+<div class="line"><span class="lineno">   90</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted Array : &quot;</span>;</div>
 <div class="line"><span class="lineno">   91</span>    <a class="code hl_function" href="#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr1);</div>
-<div class="line"><span class="lineno">   92</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr1.begin(), arr1.end()));</div>
+<div class="line"><span class="lineno">   92</span>    assert(std::is_sorted(arr1.begin(), arr1.end()));</div>
 <div class="line"><span class="lineno">   93</span>    <span class="comment">// Test 2</span></div>
 <div class="line"><span class="lineno">   94</span>    std::array &lt;int, 5&gt; arr2;</div>
 <div class="line"><span class="lineno">   95</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> &amp;x : arr2) {</div>
-<div class="line"><span class="lineno">   96</span>        x = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 100;</div>
+<div class="line"><span class="lineno">   96</span>        x = std::rand() % 100;</div>
 <div class="line"><span class="lineno">   97</span>    }</div>
-<div class="line"><span class="lineno">   98</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Original Array : &quot;</span>;</div>
+<div class="line"><span class="lineno">   98</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original Array : &quot;</span>;</div>
 <div class="line"><span class="lineno">   99</span>    <a class="code hl_function" href="#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr2);</div>
 <div class="line"><span class="lineno">  100</span>    arr2 = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd">sorting::randomized_bogosort</a>(arr2);</div>
-<div class="line"><span class="lineno">  101</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Sorted Array : &quot;</span>;</div>
+<div class="line"><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted Array : &quot;</span>;</div>
 <div class="line"><span class="lineno">  102</span>    <a class="code hl_function" href="#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr2);</div>
-<div class="line"><span class="lineno">  103</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr2.begin(), arr2.end()));</div>
+<div class="line"><span class="lineno">  103</span>    assert(std::is_sorted(arr2.begin(), arr2.end()));</div>
 <div class="line"><span class="lineno">  104</span>}</div>
-<div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-</div><!-- 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="../../d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg" width="402" height="299"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map b/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
deleted file mode 100644
index e16536cb1..000000000
--- a/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
+++ /dev/null
@@ -1,20 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,140,49,166"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/begin.html#" title=" " alt="" coords="280,5,395,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="32,138,55,97,73,75,95,57,136,37,180,25,224,17,265,14,265,19,225,23,181,30,138,42,98,62,77,79,59,100,36,141"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/end.html#" title=" " alt="" coords="285,57,390,83"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="37,137,61,112,95,89,139,75,185,66,270,62,270,68,185,72,141,80,98,94,65,116,41,141"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="288,164,388,190"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,152,272,169,272,174,49,157"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="128,219,200,244"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="48,164,98,197,121,209,118,214,95,202,45,169"/>
-<area shape="rect" id="Node000006" href="$d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd" title=" " alt="" coords="97,103,232,144"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="48,146,81,139,82,144,49,151"/>
-<area shape="rect" id="Node000008" href="$d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859" title=" " alt="" coords="120,268,208,294"/>
-<area shape="poly" id="edge10_Node000001_Node000008" title=" " alt="" coords="36,165,59,209,77,234,98,255,108,261,105,265,95,259,73,237,55,212,31,168"/>
-<area shape="poly" id="edge6_Node000006_Node000002" title=" " alt="" coords="192,101,279,43,291,36,294,40,281,47,195,105"/>
-<area shape="poly" id="edge7_Node000006_Node000003" title=" " alt="" coords="232,100,278,86,280,91,233,105"/>
-<area shape="poly" id="edge8_Node000006_Node000004" title=" " alt="" coords="233,142,280,156,278,161,232,147"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/random_shuffle.html#" title=" " alt="" coords="294,111,381,136"/>
-<area shape="poly" id="edge9_Node000006_Node000007" title=" " alt="" coords="233,121,279,121,279,126,233,126"/>
-</map>
diff --git a/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5 b/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
deleted file mode 100644
index 02e5c4b6f..000000000
--- a/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-21c8ef6f1e1ea84dd135836927655b56
\ No newline at end of file
diff --git a/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg b/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
deleted file mode 100644
index 0d7f976cf..000000000
--- a/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
+++ /dev/null
@@ -1,201 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="301pt" height="224pt"
- viewBox="0.00 0.00 300.50 224.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 220.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-115.25 0,-115.25 0,-96 32.5,-96 32.5,-115.25"/>
-<text text-anchor="middle" x="16.25" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.5,-216.25 206,-216.25 206,-197 292.5,-197 292.5,-216.25"/>
-<text text-anchor="middle" x="249.25" y="-202.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.54,-115.66C28.77,-131.25 44.94,-161.03 68.5,-175.62 106.31,-199.06 156.75,-206.11 194.57,-207.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.26,-211.19 204.36,-207.99 194.47,-204.2 194.26,-211.19"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="288.75,-177.25 209.75,-177.25 209.75,-158 288.75,-158 288.75,-177.25"/>
-<text text-anchor="middle" x="249.25" y="-163.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.05,-115.75C34.15,-126.72 50.3,-143.71 68.5,-151.62 109.64,-169.51 160.99,-172.4 198.26,-171.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="197.97,-174.98 207.84,-171.12 197.72,-167.98 197.97,-174.98"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="286.88,-97.25 211.62,-97.25 211.62,-78 286.88,-78 286.88,-97.25"/>
-<text text-anchor="middle" x="249.25" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.77,-104.42C66.43,-101.79 147.39,-95.48 199.92,-91.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.12,-94.89 209.81,-90.62 199.57,-87.91 200.12,-94.89"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146.38,-56.25 92.12,-56.25 92.12,-37 146.38,-37 146.38,-56.25"/>
-<text text-anchor="middle" x="119.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.81,-95.54C40.94,-88.22 55.26,-78.28 68.5,-70.62 73.9,-67.5 79.76,-64.42 85.5,-61.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.75,-64.84 94.23,-57.34 83.7,-58.54 86.75,-64.84"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170,-142.88 68.5,-142.88 68.5,-112.38 170,-112.38 170,-142.88"/>
-<text text-anchor="start" x="76.5" y="-129.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::randomized</text>
-<text text-anchor="middle" x="119.25" y="-118.12" font-family="Helvetica,sans-Serif" font-size="10.00">_bogosort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.59,-108.97C39.42,-110.45 47.94,-112.31 56.95,-114.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.1,-117.67 66.62,-116.38 57.59,-110.83 56.1,-117.67"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152.38,-19.25 86.12,-19.25 86.12,0 152.38,0 152.38,-19.25"/>
-<text text-anchor="middle" x="119.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">show_array</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge10_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge10_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.34,-95.51C28.51,-79.01 44.85,-46.3 68.5,-27.62 70.74,-25.86 73.17,-24.25 75.71,-22.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.02,-26.05 84.51,-18.56 73.98,-19.74 77.02,-26.05"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node2 -->
-<g id="edge6_Node000006_Node000002" class="edge">
-<title>Node6&#45;&gt;Node2</title>
-<g id="a_edge6_Node000006_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.78,-143.14C157.78,-155.65 182.82,-173.28 206,-186.62 209,-188.35 212.17,-190.06 215.37,-191.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.66,-194.76 224.18,-196.03 216.75,-188.48 213.66,-194.76"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge7_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge7_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.47,-143.32C181.92,-146.9 193.99,-150.67 205.12,-154.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="203.84,-157.41 214.42,-157.05 205.92,-150.73 203.84,-157.41"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge8_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.47,-111.93C181.92,-108.35 193.99,-104.58 205.12,-101.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.92,-104.52 214.42,-98.2 203.84,-97.84 205.92,-104.52"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="281.62,-137.25 216.88,-137.25 216.88,-118 281.62,-118 281.62,-137.25"/>
-<text text-anchor="middle" x="249.25" y="-123.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge9_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge9_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.47,-127.62C182.01,-127.62 194.18,-127.62 205.37,-127.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.11,-131.13 215.11,-127.63 205.11,-124.13 205.11,-131.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg b/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
deleted file mode 100644
index 8399a13d9..000000000
--- a/d5/ddb/bogo__sort_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
+++ /dev/null
@@ -1,175 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="301pt" height="224pt"
- viewBox="0.00 0.00 300.50 224.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 220.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-115.25 0,-115.25 0,-96 32.5,-96 32.5,-115.25"/>
-<text text-anchor="middle" x="16.25" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.5,-216.25 206,-216.25 206,-197 292.5,-197 292.5,-216.25"/>
-<text text-anchor="middle" x="249.25" y="-202.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.54,-115.66C28.77,-131.25 44.94,-161.03 68.5,-175.62 106.31,-199.06 156.75,-206.11 194.57,-207.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.26,-211.19 204.36,-207.99 194.47,-204.2 194.26,-211.19"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="288.75,-177.25 209.75,-177.25 209.75,-158 288.75,-158 288.75,-177.25"/>
-<text text-anchor="middle" x="249.25" y="-163.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.05,-115.75C34.15,-126.72 50.3,-143.71 68.5,-151.62 109.64,-169.51 160.99,-172.4 198.26,-171.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="197.97,-174.98 207.84,-171.12 197.72,-167.98 197.97,-174.98"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="286.88,-97.25 211.62,-97.25 211.62,-78 286.88,-78 286.88,-97.25"/>
-<text text-anchor="middle" x="249.25" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.77,-104.42C66.43,-101.79 147.39,-95.48 199.92,-91.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.12,-94.89 209.81,-90.62 199.57,-87.91 200.12,-94.89"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146.38,-56.25 92.12,-56.25 92.12,-37 146.38,-37 146.38,-56.25"/>
-<text text-anchor="middle" x="119.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.81,-95.54C40.94,-88.22 55.26,-78.28 68.5,-70.62 73.9,-67.5 79.76,-64.42 85.5,-61.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.75,-64.84 94.23,-57.34 83.7,-58.54 86.75,-64.84"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170,-142.88 68.5,-142.88 68.5,-112.38 170,-112.38 170,-142.88"/>
-<text text-anchor="start" x="76.5" y="-129.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::randomized</text>
-<text text-anchor="middle" x="119.25" y="-118.12" font-family="Helvetica,sans-Serif" font-size="10.00">_bogosort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.59,-108.97C39.42,-110.45 47.94,-112.31 56.95,-114.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.1,-117.67 66.62,-116.38 57.59,-110.83 56.1,-117.67"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152.38,-19.25 86.12,-19.25 86.12,0 152.38,0 152.38,-19.25"/>
-<text text-anchor="middle" x="119.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">show_array</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge10_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge10_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.34,-95.51C28.51,-79.01 44.85,-46.3 68.5,-27.62 70.74,-25.86 73.17,-24.25 75.71,-22.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.02,-26.05 84.51,-18.56 73.98,-19.74 77.02,-26.05"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node2 -->
-<g id="edge6_Node000006_Node000002" class="edge">
-<title>Node6&#45;&gt;Node2</title>
-<g id="a_edge6_Node000006_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.78,-143.14C157.78,-155.65 182.82,-173.28 206,-186.62 209,-188.35 212.17,-190.06 215.37,-191.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.66,-194.76 224.18,-196.03 216.75,-188.48 213.66,-194.76"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge7_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge7_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.47,-143.32C181.92,-146.9 193.99,-150.67 205.12,-154.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="203.84,-157.41 214.42,-157.05 205.92,-150.73 203.84,-157.41"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge8_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.47,-111.93C181.92,-108.35 193.99,-104.58 205.12,-101.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.92,-104.52 214.42,-98.2 203.84,-97.84 205.92,-104.52"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="281.62,-137.25 216.88,-137.25 216.88,-118 281.62,-118 281.62,-137.25"/>
-<text text-anchor="middle" x="249.25" y="-123.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge9_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge9_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.47,-127.62C182.01,-127.62 194.18,-127.62 205.37,-127.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.11,-131.13 215.11,-127.63 205.11,-124.13 205.11,-131.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 8cb1ca3d9..000000000
--- a/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,24 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,152,55,178"/>
-<area shape="rect" id="Node000002" href="$d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd" title=" " alt="" coords="194,51,329,92"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,153,194,96,196,101,56,158"/>
-<area shape="rect" id="Node000007" href="$d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859" title=" " alt="" coords="218,267,306,292"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="54,176,117,213,195,253,207,258,205,263,193,258,114,217,51,181"/>
-<area shape="rect" id="Node000008" href="$d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" title=" " alt="" coords="103,152,146,178"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="55,162,87,162,87,168,55,168"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/begin.html#" title=" " alt="" coords="377,161,493,187"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="291,90,332,119,379,148,387,152,384,157,376,152,329,123,288,94"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/end.html#" title=" " alt="" coords="382,5,488,31"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="329,48,375,34,377,39,331,53"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="385,112,485,138"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="331,90,377,104,375,109,329,95"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/random_shuffle.html#" title=" " alt="" coords="392,59,478,84"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="330,69,376,69,376,74,330,74"/>
-<area shape="poly" id="edge12_Node000008_Node000002" title=" " alt="" coords="139,149,192,108,208,98,211,102,196,112,143,154"/>
-<area shape="poly" id="edge8_Node000008_Node000003" title=" " alt="" coords="146,163,362,169,361,175,146,168"/>
-<area shape="poly" id="edge9_Node000008_Node000004" title=" " alt="" coords="126,151,133,126,146,94,166,63,192,37,235,17,280,7,326,4,367,5,367,11,326,9,281,12,236,22,196,42,170,66,151,97,138,127,131,152"/>
-<area shape="poly" id="edge10_Node000008_Node000005" title=" " alt="" coords="146,157,194,148,369,127,370,132,194,153,147,162"/>
-<area shape="poly" id="edge13_Node000008_Node000007" title=" " alt="" coords="135,176,158,214,176,235,196,253,205,259,202,264,192,258,172,239,154,218,130,179"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="226,217,298,243"/>
-<area shape="poly" id="edge11_Node000008_Node000009" title=" " alt="" coords="148,173,195,196,220,208,218,213,193,201,145,177"/>
-</map>
diff --git a/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 9e9c6ca38..000000000
--- a/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4ee35df350acc050b7d1adcc496f2419
\ No newline at end of file
diff --git a/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index e7a657641..000000000
--- a/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,237 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="374pt" height="223pt"
- viewBox="0.00 0.00 373.50 223.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 219.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-105.25 0,-105.25 0,-86 37,-86 37,-105.25"/>
-<text text-anchor="middle" x="18.5" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243,-180.88 141.5,-180.88 141.5,-150.38 243,-150.38 243,-180.88"/>
-<text text-anchor="start" x="149.5" y="-167.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::randomized</text>
-<text text-anchor="middle" x="192.25" y="-156.12" font-family="Helvetica,sans-Serif" font-size="10.00">_bogosort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-102.85C61.78,-112.86 107.05,-131.31 142.18,-145.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.74,-148.82 151.32,-149.35 143.39,-142.34 140.74,-148.82"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="225.38,-19.25 159.12,-19.25 159.12,0 225.38,0 225.38,-19.25"/>
-<text text-anchor="middle" x="192.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">show_array</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.64,-85.52C58.59,-71.41 102.23,-45.53 141.5,-27.62 144.4,-26.3 147.43,-25.01 150.49,-23.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.48,-27.13 159.53,-20.25 148.94,-20.61 151.48,-27.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-105.25 73,-105.25 73,-86 105.5,-86 105.5,-105.25"/>
-<text text-anchor="middle" x="89.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-95.62C44.58,-95.62 53.31,-95.62 61.45,-95.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-99.13 71.2,-95.63 61.2,-92.13 61.2,-99.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="365.5,-98.25 279,-98.25 279,-79 365.5,-79 365.5,-98.25"/>
-<text text-anchor="middle" x="322.25" y="-84.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.3,-150.12C230.23,-137.46 255.41,-119.6 279,-106.62 280.94,-105.56 282.95,-104.51 285.01,-103.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.42,-106.7 294.02,-99.31 283.47,-100.35 286.42,-106.7"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="361.75,-215.25 282.75,-215.25 282.75,-196 361.75,-196 361.75,-215.25"/>
-<text text-anchor="middle" x="322.25" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.47,-181.32C254.92,-184.9 266.99,-188.67 278.12,-192.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="276.84,-195.41 287.42,-195.05 278.92,-188.73 276.84,-195.41"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="359.88,-135.25 284.62,-135.25 284.62,-116 359.88,-116 359.88,-135.25"/>
-<text text-anchor="middle" x="322.25" y="-121.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.47,-149.93C254.92,-146.35 266.99,-142.58 278.12,-139.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.92,-142.52 287.42,-136.2 276.84,-135.84 278.92,-142.52"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="354.62,-175.25 289.88,-175.25 289.88,-156 354.62,-156 354.62,-175.25"/>
-<text text-anchor="middle" x="322.25" y="-161.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.47,-165.62C255.01,-165.62 267.18,-165.62 278.37,-165.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.11,-169.13 288.11,-165.63 278.11,-162.13 278.11,-169.13"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node2 -->
-<g id="edge12_Node000008_Node000002" class="edge">
-<title>Node8&#45;&gt;Node2</title>
-<g id="a_edge12_Node000008_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.68,-105.58C111.83,-114.21 127.22,-126.83 141.5,-136.62 145.15,-139.13 149.03,-141.64 152.95,-144.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.98,-146.97 161.36,-149.14 154.6,-140.98 150.98,-146.97"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node3 -->
-<g id="edge8_Node000008_Node000003" class="edge">
-<title>Node8&#45;&gt;Node3</title>
-<g id="a_edge8_Node000008_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.77,-95.15C138.21,-94.17 214.57,-91.86 267.09,-90.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="267.17,-93.77 277.06,-89.96 266.95,-86.77 267.17,-93.77"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge9_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge9_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.43,-105.71C97.32,-125.62 111.19,-169.76 141.5,-189.62 179.78,-214.71 232.9,-216.38 271.46,-213.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="271.31,-216.72 280.92,-212.26 270.63,-209.75 271.31,-216.72"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge10_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge10_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.87,-99.43C115.98,-101.78 129.46,-104.7 141.5,-106.62 185.82,-113.7 236.72,-118.8 273.02,-121.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.5,-125.39 282.76,-122.74 273.08,-118.42 272.5,-125.39"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge13_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge13_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.2,-85.87C103.08,-71.23 119.86,-43.61 141.5,-27.62 143.68,-26.01 146.02,-24.53 148.46,-23.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.91,-26.36 157.45,-18.92 146.91,-20.04 149.91,-26.36"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.38,-56.25 165.12,-56.25 165.12,-37 219.38,-37 219.38,-56.25"/>
-<text text-anchor="middle" x="192.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge11_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge11_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.94,-87.95C116.08,-82.99 129.56,-76.41 141.5,-70.62 147.58,-67.68 154.08,-64.53 160.31,-61.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.57,-64.8 169.06,-57.3 158.53,-58.5 161.57,-64.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index a7e187b73..000000000
--- a/d5/ddb/bogo__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,211 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="374pt" height="223pt"
- viewBox="0.00 0.00 373.50 223.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 219.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-105.25 0,-105.25 0,-86 37,-86 37,-105.25"/>
-<text text-anchor="middle" x="18.5" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243,-180.88 141.5,-180.88 141.5,-150.38 243,-150.38 243,-180.88"/>
-<text text-anchor="start" x="149.5" y="-167.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::randomized</text>
-<text text-anchor="middle" x="192.25" y="-156.12" font-family="Helvetica,sans-Serif" font-size="10.00">_bogosort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-102.85C61.78,-112.86 107.05,-131.31 142.18,-145.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.74,-148.82 151.32,-149.35 143.39,-142.34 140.74,-148.82"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="225.38,-19.25 159.12,-19.25 159.12,0 225.38,0 225.38,-19.25"/>
-<text text-anchor="middle" x="192.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">show_array</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.64,-85.52C58.59,-71.41 102.23,-45.53 141.5,-27.62 144.4,-26.3 147.43,-25.01 150.49,-23.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.48,-27.13 159.53,-20.25 148.94,-20.61 151.48,-27.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-105.25 73,-105.25 73,-86 105.5,-86 105.5,-105.25"/>
-<text text-anchor="middle" x="89.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-95.62C44.58,-95.62 53.31,-95.62 61.45,-95.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-99.13 71.2,-95.63 61.2,-92.13 61.2,-99.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="365.5,-98.25 279,-98.25 279,-79 365.5,-79 365.5,-98.25"/>
-<text text-anchor="middle" x="322.25" y="-84.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.3,-150.12C230.23,-137.46 255.41,-119.6 279,-106.62 280.94,-105.56 282.95,-104.51 285.01,-103.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.42,-106.7 294.02,-99.31 283.47,-100.35 286.42,-106.7"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="361.75,-215.25 282.75,-215.25 282.75,-196 361.75,-196 361.75,-215.25"/>
-<text text-anchor="middle" x="322.25" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.47,-181.32C254.92,-184.9 266.99,-188.67 278.12,-192.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="276.84,-195.41 287.42,-195.05 278.92,-188.73 276.84,-195.41"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="359.88,-135.25 284.62,-135.25 284.62,-116 359.88,-116 359.88,-135.25"/>
-<text text-anchor="middle" x="322.25" y="-121.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.47,-149.93C254.92,-146.35 266.99,-142.58 278.12,-139.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.92,-142.52 287.42,-136.2 276.84,-135.84 278.92,-142.52"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="354.62,-175.25 289.88,-175.25 289.88,-156 354.62,-156 354.62,-175.25"/>
-<text text-anchor="middle" x="322.25" y="-161.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.47,-165.62C255.01,-165.62 267.18,-165.62 278.37,-165.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.11,-169.13 288.11,-165.63 278.11,-162.13 278.11,-169.13"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node2 -->
-<g id="edge12_Node000008_Node000002" class="edge">
-<title>Node8&#45;&gt;Node2</title>
-<g id="a_edge12_Node000008_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.68,-105.58C111.83,-114.21 127.22,-126.83 141.5,-136.62 145.15,-139.13 149.03,-141.64 152.95,-144.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.98,-146.97 161.36,-149.14 154.6,-140.98 150.98,-146.97"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node3 -->
-<g id="edge8_Node000008_Node000003" class="edge">
-<title>Node8&#45;&gt;Node3</title>
-<g id="a_edge8_Node000008_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.77,-95.15C138.21,-94.17 214.57,-91.86 267.09,-90.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="267.17,-93.77 277.06,-89.96 266.95,-86.77 267.17,-93.77"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge9_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge9_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.43,-105.71C97.32,-125.62 111.19,-169.76 141.5,-189.62 179.78,-214.71 232.9,-216.38 271.46,-213.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="271.31,-216.72 280.92,-212.26 270.63,-209.75 271.31,-216.72"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge10_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge10_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.87,-99.43C115.98,-101.78 129.46,-104.7 141.5,-106.62 185.82,-113.7 236.72,-118.8 273.02,-121.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.5,-125.39 282.76,-122.74 273.08,-118.42 272.5,-125.39"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge13_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge13_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.2,-85.87C103.08,-71.23 119.86,-43.61 141.5,-27.62 143.68,-26.01 146.02,-24.53 148.46,-23.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.91,-26.36 157.45,-18.92 146.91,-20.04 149.91,-26.36"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.38,-56.25 165.12,-56.25 165.12,-37 219.38,-37 219.38,-56.25"/>
-<text text-anchor="middle" x="192.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge11_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge11_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.94,-87.95C116.08,-82.99 129.56,-76.41 141.5,-70.62 147.58,-67.68 154.08,-64.53 160.31,-61.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.57,-64.8 169.06,-57.3 158.53,-58.5 161.57,-64.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/ddb/bogo__sort_8cpp_source.html b/d5/ddb/bogo__sort_8cpp_source.html
new file mode 100644
index 000000000..1f292807e
--- /dev/null
+++ b/d5/ddb/bogo__sort_8cpp_source.html
@@ -0,0 +1,228 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/bogo_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/ddb/bogo__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">bogo_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d5/ddb/bogo__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;array&gt;</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;random&gt;</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keywordtype">size_t</span> N&gt;</div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="}">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#a7bfe11bd4703eacd1dab93f25ec639c5">   37</a></span>std::array &lt;T, N&gt; <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a7bfe11bd4703eacd1dab93f25ec639c5">shuffle</a> (std::array &lt;T, N&gt; arr) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N; i++) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        <span class="comment">// Swaps i&#39;th  index with random index (less than array size)</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        std::swap(arr[i], arr[std::rand() % N]);</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    }</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">return</span> arr;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>}</div>
+</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keywordtype">size_t</span> N&gt;</div>
+<div class="foldopen" id="foldopen00052" data-start="{" data-end="}">
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd">   52</a></span>std::array &lt;T, N&gt; <a class="code hl_function" href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd">randomized_bogosort</a> (std::array &lt;T, N&gt; arr) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="comment">// Untill array is not sorted</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    std::random_device random_device;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    std::mt19937 generator(random_device());</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">while</span> (!std::is_sorted(arr.begin(), arr.end())) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        std::shuffle(arr.begin(), arr.end(), generator);<span class="comment">// Shuffle the array</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">return</span> arr;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>}</div>
+</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keywordtype">size_t</span> N&gt;</div>
+<div class="foldopen" id="foldopen00071" data-start="{" data-end="}">
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"><a class="line" href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859">   71</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859">show_array</a> (<span class="keyword">const</span> std::array &lt;T, N&gt; &amp;arr) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x : arr) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        std::cout &lt;&lt; x &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    }</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>}</div>
+</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="foldopen" id="foldopen00081" data-start="{" data-end="}">
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="../../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">   81</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="comment">// Test 1</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    std::array &lt;int, 5&gt; arr1;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> &amp;x : arr1) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        x = std::rand() % 100;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    }</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original Array : &quot;</span>;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <a class="code hl_function" href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr1);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    arr1 = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd">sorting::randomized_bogosort</a>(arr1);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted Array : &quot;</span>;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <a class="code hl_function" href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr1);</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    assert(std::is_sorted(arr1.begin(), arr1.end()));</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="comment">// Test 2</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    std::array &lt;int, 5&gt; arr2;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> &amp;x : arr2) {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        x = std::rand() % 100;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    }</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original Array : &quot;</span>;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <a class="code hl_function" href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr2);</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    arr2 = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd">sorting::randomized_bogosort</a>(arr2);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted Array : &quot;</span>;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <a class="code hl_function" href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr2);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    assert(std::is_sorted(arr2.begin(), arr2.end()));</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>}</div>
+</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
+<div class="foldopen" id="foldopen00107" data-start="{" data-end="}">
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"><a class="line" href="../../d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  107</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="comment">// Testing</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <a class="code hl_function" href="../../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="comment">// Example Usage</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::array &lt;int, 5&gt; arr = {3, 7, 10, 4, 1}; <span class="comment">// Defining array which we want to sort</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original Array : &quot;</span>;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <a class="code hl_function" href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    arr = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd">sorting::randomized_bogosort</a>(arr); <span class="comment">// Callling bogo sort on it</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted Array : &quot;</span>;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <a class="code hl_function" href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859">show_array</a>(arr); <span class="comment">// Printing sorted array</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>}</div>
+</div>
+<div class="ttc" id="abogo__sort_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00081">bogo_sort.cpp:81</a></div></div>
+<div class="ttc" id="abogo__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00107">bogo_sort.cpp:107</a></div></div>
+<div class="ttc" id="abogo__sort_8cpp_html_ae8adaeff66471f9ed84f2e673b38a859"><div class="ttname"><a href="../../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859">show_array</a></div><div class="ttdeci">void show_array(const std::array&lt; T, N &gt; &amp;arr)</div><div class="ttdef"><b>Definition</b> <a href="#l00071">bogo_sort.cpp:71</a></div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+<div class="ttc" id="anamespacesorting_html_a7bfe11bd4703eacd1dab93f25ec639c5"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a7bfe11bd4703eacd1dab93f25ec639c5">sorting::shuffle</a></div><div class="ttdeci">std::array&lt; T, N &gt; shuffle(std::array&lt; T, N &gt; arr)</div><div class="ttdef"><b>Definition</b> <a href="#l00037">bogo_sort.cpp:37</a></div></div>
+<div class="ttc" id="anamespacesorting_html_affc6ee160142cd017f8c4b213437d0fd"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd">sorting::randomized_bogosort</a></div><div class="ttdeci">std::array&lt; T, N &gt; randomized_bogosort(std::array&lt; T, N &gt; arr)</div><div class="ttdef"><b>Definition</b> <a href="#l00052">bogo_sort.cpp:52</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d5/ddb/bogo__sort_8cpp.html">bogo_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/ddb/classothers_1_1_cache_1_1_d___node-members.html b/d5/ddb/classothers_1_1_cache_1_1_d___node-members.html
index e9be37226..2063933ab 100644
--- a/d5/ddb/classothers_1_1_cache_1_1_d___node-members.html
+++ b/d5/ddb/classothers_1_1_cache_1_1_d___node-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d5/ddf/struct_btree-members.html b/d5/ddf/struct_btree-members.html
index 19b86a957..32d909699 100644
--- a/d5/ddf/struct_btree-members.html
+++ b/d5/ddf/struct_btree-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d5/de0/classuint128__t-members.html b/d5/de0/classuint128__t-members.html
index 3b519e487..b23a713a3 100644
--- a/d5/de0/classuint128__t-members.html
+++ b/d5/de0/classuint128__t-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d5/de2/structtower-members.html b/d5/de2/structtower-members.html
index f7108991c..28212de77 100644
--- a/d5/de2/structtower-members.html
+++ b/d5/de2/structtower-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d5/de6/classgreedy__algorithms_1_1_binary_addition-members.html b/d5/de6/classgreedy__algorithms_1_1_binary_addition-members.html
index c6c4fc2b1..21061fa98 100644
--- a/d5/de6/classgreedy__algorithms_1_1_binary_addition-members.html
+++ b/d5/de6/classgreedy__algorithms_1_1_binary_addition-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d5/dec/classgraph_1_1topological__sort_1_1_graph.html b/d5/dec/classgraph_1_1topological__sort_1_1_graph.html
index 95f0c57c2..1bed0843e 100644
--- a/d5/dec/classgraph_1_1topological__sort_1_1_graph.html
+++ b/d5/dec/classgraph_1_1topological__sort_1_1_graph.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph::topological_sort::Graph Class Reference</title>
+<title>TheAlgorithms/C++: graph::topological_sort::Graph Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -128,7 +145,7 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:a57036210706a45b9363563252393a345" id="r_a57036210706a45b9363563252393a345"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a57036210706a45b9363563252393a345">addEdge</a> (int u, int v)</td></tr>
 <tr class="memdesc:a57036210706a45b9363563252393a345"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that adds an edge between two nodes or vertices of graph.  <br /></td></tr>
 <tr class="separator:a57036210706a45b9363563252393a345"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a5e84b175ef768ff58eaeededd43e8368" id="r_a5e84b175ef768ff58eaeededd43e8368"><td class="memItemLeft" align="right" valign="top">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5e84b175ef768ff58eaeededd43e8368">getAdjacencyList</a> () const</td></tr>
+<tr class="memitem:a5e84b175ef768ff58eaeededd43e8368" id="r_a5e84b175ef768ff58eaeededd43e8368"><td class="memItemLeft" align="right" valign="top">const std::vector&lt; std::vector&lt; int &gt; &gt; &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5e84b175ef768ff58eaeededd43e8368">getAdjacencyList</a> () const</td></tr>
 <tr class="memdesc:a5e84b175ef768ff58eaeededd43e8368"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the adjacency list of the graph.  <br /></td></tr>
 <tr class="separator:a5e84b175ef768ff58eaeededd43e8368"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ad22018e4f4f80aecb0538044bb83d096" id="r_ad22018e4f4f80aecb0538044bb83d096"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad22018e4f4f80aecb0538044bb83d096">getNumNodes</a> () const</td></tr>
@@ -137,15 +154,15 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:ad397d1dfbb62c7b612baeebe8cc83057" id="r_ad397d1dfbb62c7b612baeebe8cc83057"><td class="memItemLeft" align="right" valign="top"><a id="ad397d1dfbb62c7b612baeebe8cc83057" name="ad397d1dfbb62c7b612baeebe8cc83057"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>n</b></td></tr>
+<tr class="memitem:ad397d1dfbb62c7b612baeebe8cc83057" id="r_ad397d1dfbb62c7b612baeebe8cc83057"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad397d1dfbb62c7b612baeebe8cc83057">n</a></td></tr>
 <tr class="separator:ad397d1dfbb62c7b612baeebe8cc83057"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ab54b59df8e4d8f2bd1eed7c478ac6756" id="r_ab54b59df8e4d8f2bd1eed7c478ac6756"><td class="memItemLeft" align="right" valign="top"><a id="ab54b59df8e4d8f2bd1eed7c478ac6756" name="ab54b59df8e4d8f2bd1eed7c478ac6756"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>adj</b></td></tr>
+<tr class="memitem:ab54b59df8e4d8f2bd1eed7c478ac6756" id="r_ab54b59df8e4d8f2bd1eed7c478ac6756"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab54b59df8e4d8f2bd1eed7c478ac6756">adj</a></td></tr>
 <tr class="separator:ab54b59df8e4d8f2bd1eed7c478ac6756"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Class that represents a directed graph and provides methods for manipulating the graph. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html">topological_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a75a849f80a66304e7da39b3ccd6129d6" name="a75a849f80a66304e7da39b3ccd6129d6"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a75a849f80a66304e7da39b3ccd6129d6">&#9670;&#160;</a></span>Graph()</h2>
@@ -177,6 +194,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>n</b></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html">topological_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   48</span>: n(nodes), adj(nodes) {}</div>
 </div><!-- fragment -->
 </div>
@@ -217,14 +236,10 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>n</b></td></tr>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">   55</span>{ adj[u].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(v); }</div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-</div><!-- 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="../../d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.svg" width="366" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html">topological_sort.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   55</span>{ adj[u].push_back(v); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5e84b175ef768ff58eaeededd43e8368" name="a5e84b175ef768ff58eaeededd43e8368"></a>
@@ -237,7 +252,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; &amp; graph::topological_sort::Graph::getAdjacencyList </td>
+          <td class="memname">const std::vector&lt; std::vector&lt; int &gt; &gt; &amp; graph::topological_sort::Graph::getAdjacencyList </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td> const</td>
@@ -252,6 +267,8 @@ Here is the call graph for this function:</div>
 
 <p>Get the adjacency list of the graph. </p>
 <dl class="section return"><dt>Returns</dt><dd>A reference to the adjacency list </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html#l00061">61</a> of file <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html">topological_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   61</span>                                                              {</div>
 <div class="line"><span class="lineno">   62</span>        <span class="keywordflow">return</span> adj;</div>
 <div class="line"><span class="lineno">   63</span>    }</div>
@@ -283,12 +300,63 @@ Here is the call graph for this function:</div>
 
 <p>Get the number of nodes in the graph. </p>
 <dl class="section return"><dt>Returns</dt><dd>The number of nodes </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html#l00069">69</a> of file <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html">topological_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   69</span>{ <span class="keywordflow">return</span> n; }</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="ab54b59df8e4d8f2bd1eed7c478ac6756" name="ab54b59df8e4d8f2bd1eed7c478ac6756"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ab54b59df8e4d8f2bd1eed7c478ac6756">&#9670;&#160;</a></span>adj</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::vector&lt;int&gt; &gt; graph::topological_sort::Graph::adj</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html">topological_sort.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ad397d1dfbb62c7b612baeebe8cc83057" name="ad397d1dfbb62c7b612baeebe8cc83057"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ad397d1dfbb62c7b612baeebe8cc83057">&#9670;&#160;</a></span>n</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int graph::topological_sort::Graph::n</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html">topological_sort.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>graph/<a class="el" href="../../d8/db9/topological__sort_8cpp.html">topological_sort.cpp</a></li>
+<li>graph/<a class="el" href="../../d8/db9/topological__sort_8cpp_source.html">topological_sort.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.map b/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.map
deleted file mode 100644
index 95ad6e2b1..000000000
--- a/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="graph::topological_sort::Graph::addEdge" name="graph::topological_sort::Graph::addEdge">
-<area shape="rect" id="Node000001" title="Function that adds an edge between two nodes or vertices of graph." alt="" coords="5,5,158,46"/>
-<area shape="rect" id="Node000002" 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="206,13,360,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="158,23,190,23,190,28,158,28"/>
-</map>
diff --git a/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.md5 b/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.md5
deleted file mode 100644
index 24e04d4e0..000000000
--- a/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1b7f4d729ecbe66b97fdd869ae62df4d
\ No newline at end of file
diff --git a/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.svg b/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.svg
deleted file mode 100644
index 7b98bf8e0..000000000
--- a/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::topological_sort::Graph::addEdge Pages: 1 -->
-<svg width="274pt" height="39pt"
- viewBox="0.00 0.00 274.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>graph::topological_sort::Graph::addEdge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that adds an edge between two nodes or vertices of graph.">
-<polygon fill="#999999" stroke="#666666" points="114.25,-30.5 0,-30.5 0,0 114.25,0 114.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::topological</text>
-<text text-anchor="middle" x="57.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sort::Graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-24.88 150.25,-24.88 150.25,-5.63 266,-5.63 266,-24.88"/>
-<text text-anchor="middle" x="208.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.46,-15.25C122.41,-15.25 130.66,-15.25 138.81,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.71,-18.75 148.71,-15.25 138.71,-11.75 138.71,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph_org.svg b/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph_org.svg
deleted file mode 100644
index 6f9b78ead..000000000
--- a/d5/dec/classgraph_1_1topological__sort_1_1_graph_a57036210706a45b9363563252393a345_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::topological_sort::Graph::addEdge Pages: 1 -->
-<svg width="274pt" height="39pt"
- viewBox="0.00 0.00 274.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>graph::topological_sort::Graph::addEdge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that adds an edge between two nodes or vertices of graph.">
-<polygon fill="#999999" stroke="#666666" points="114.25,-30.5 0,-30.5 0,0 114.25,0 114.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::topological</text>
-<text text-anchor="middle" x="57.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sort::Graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-24.88 150.25,-24.88 150.25,-5.63 266,-5.63 266,-24.88"/>
-<text text-anchor="middle" x="208.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.46,-15.25C122.41,-15.25 130.66,-15.25 138.81,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.71,-18.75 148.71,-15.25 138.71,-11.75 138.71,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/def/stairs__pattern_8cpp.html b/d5/def/stairs__pattern_8cpp.html
index 9ea645c7f..196484df6 100644
--- a/d5/def/stairs__pattern_8cpp.html
+++ b/d5/def/stairs__pattern_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/stairs_pattern.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/stairs_pattern.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,7 +135,9 @@ Include dependency graph for stairs_pattern.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dd4/stairs__pattern_8cpp__incl.svg" width="176" height="111"><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">
+</div>
+<p><a href="../../d5/def/stairs__pattern_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
@@ -135,6 +154,8 @@ Functions</h2></td></tr>
  \*\*\*\*\*\*
 \*\*\*\*\*\*\*\*
         </pre><p> where number of pairs line is given by user </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d5/def/stairs__pattern_8cpp_source.html">stairs_pattern.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -151,35 +172,29 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/def/stairs__pattern_8cpp_source.html#l00017">17</a> of file <a class="el" href="../../d5/def/stairs__pattern_8cpp_source.html">stairs_pattern.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   17</span>           {</div>
 <div class="line"><span class="lineno">   18</span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>, st = 2, x, r, z, n, sp;</div>
-<div class="line"><span class="lineno">   19</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter number of pair - &quot;</span>;</div>
-<div class="line"><span class="lineno">   20</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; x;</div>
+<div class="line"><span class="lineno">   19</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter number of pair - &quot;</span>;</div>
+<div class="line"><span class="lineno">   20</span>    std::cin &gt;&gt; x;</div>
 <div class="line"><span class="lineno">   21</span>    z = x;</div>
 <div class="line"><span class="lineno">   22</span>    <span class="keywordflow">for</span> (r = 1; r &lt;= x; r++) {</div>
 <div class="line"><span class="lineno">   23</span>        z = z - 1;</div>
 <div class="line"><span class="lineno">   24</span>        <span class="keywordflow">for</span> (n = 1; n &lt;= 2; n++) {</div>
 <div class="line"><span class="lineno">   25</span>            <span class="keywordflow">for</span> (sp = 1; sp &lt;= z; sp++) {</div>
-<div class="line"><span class="lineno">   26</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   26</span>                std::cout &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   27</span>            }</div>
 <div class="line"><span class="lineno">   28</span>            <span class="keywordflow">for</span> (l = 1; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> &lt;= st; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>++) {</div>
-<div class="line"><span class="lineno">   29</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\\*&quot;</span>;</div>
+<div class="line"><span class="lineno">   29</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\\*&quot;</span>;</div>
 <div class="line"><span class="lineno">   30</span>            }</div>
-<div class="line"><span class="lineno">   31</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   31</span>            std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   32</span>        }</div>
 <div class="line"><span class="lineno">   33</span>        st = st + 2;</div>
 <div class="line"><span class="lineno">   34</span>    }</div>
 <div class="line"><span class="lineno">   35</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:119</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><!-- 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="../../d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="180" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00119">composite_simpson_rule.cpp:119</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 490da38cb..000000000
--- a/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 2f2fe09b6..000000000
--- a/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fa87532068062fd8189cade55ca11658
\ No newline at end of file
diff --git a/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 5c76e5177..000000000
--- a/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 134.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-9.62C44.56,-9.62 52.97,-9.62 61.25,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.21,-13.13 71.21,-9.63 61.21,-6.13 61.21,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 575e4300e..000000000
--- a/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 134.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-9.62C44.56,-9.62 52.97,-9.62 61.25,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.21,-13.13 71.21,-9.63 61.21,-6.13 61.21,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/def/stairs__pattern_8cpp_source.html b/d5/def/stairs__pattern_8cpp_source.html
new file mode 100644
index 000000000..705e57253
--- /dev/null
+++ b/d5/def/stairs__pattern_8cpp_source.html
@@ -0,0 +1,162 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/stairs_pattern.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/def/stairs__pattern_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">stairs_pattern.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d5/def/stairs__pattern_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="foldopen" id="foldopen00017" data-start="{" data-end="}">
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"><a class="line" href="../../d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   17</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="keywordtype">int</span> l, st = 2, x, r, z, n, sp;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter number of pair - &quot;</span>;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    std::cin &gt;&gt; x;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    z = x;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    <span class="keywordflow">for</span> (r = 1; r &lt;= x; r++) {</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        z = z - 1;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        <span class="keywordflow">for</span> (n = 1; n &lt;= 2; n++) {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>            <span class="keywordflow">for</span> (sp = 1; sp &lt;= z; sp++) {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>                std::cout &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>            }</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>            <span class="keywordflow">for</span> (l = 1; l &lt;= st; l++) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\\*&quot;</span>;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>            }</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>            std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        }</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        st = st + 2;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    }</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>}</div>
+</div>
+<div class="ttc" id="astairs__pattern_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00017">stairs_pattern.cpp:17</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../d5/def/stairs__pattern_8cpp.html">stairs_pattern.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.map b/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.map
index ef415d8d6..d407d02f8 100644
--- a/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.map
+++ b/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.map
@@ -1,6 +1,6 @@
 <map id="divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;" name="divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;">
 <area shape="rect" id="Node000001" title="Matrix class." alt="" coords="5,198,175,253"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="11,94,169,135"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="11,94,169,135"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="93,150,93,197,87,197,87,150"/>
 <area shape="rect" id="Node000003" title=" " alt="" coords="71,5,109,31"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="93,46,93,93,87,93,87,46"/>
diff --git a/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.md5 b/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.md5
index 00a430e58..d6e39fd5f 100644
--- a/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.md5
+++ b/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.md5
@@ -1 +1 @@
-1ce33d930a5524844e630f176be3475a
\ No newline at end of file
+84fcf3e5e2cf4c8d25416dd59deff794
\ No newline at end of file
diff --git a/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.svg b/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.svg
index f17526a83..89e663c7e 100644
--- a/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.svg
+++ b/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph.svg
@@ -33,7 +33,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="122.5,-119.5 4.5,-119.5 4.5,-89 122.5,-89 122.5,-119.5"/>
 <text text-anchor="start" x="12.5" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="63.5" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; T &gt; &gt;</text>
diff --git a/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph_org.svg b/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph_org.svg
index b2208b5f1..0f50820f9 100644
--- a/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph_org.svg
+++ b/d5/df1/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix__coll__graph_org.svg
@@ -22,7 +22,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="122.5,-119.5 4.5,-119.5 4.5,-89 122.5,-89 122.5,-119.5"/>
 <text text-anchor="start" x="12.5" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="63.5" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; T &gt; &gt;</text>
diff --git a/d5/df4/merge__sort_8cpp.html b/d5/df4/merge__sort_8cpp.html
index 800cc781b..7d80e61af 100644
--- a/d5/df4/merge__sort_8cpp.html
+++ b/d5/df4/merge__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/merge_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/merge_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,7 +135,9 @@ Include dependency graph for merge_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d5f/merge__sort_8cpp__incl.svg" width="166" height="111"><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">
+</div>
+<p><a href="../../d5/df4/merge__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ga460c61cd948203b4816bef2accb3fc73" id="r_ga460c61cd948203b4816bef2accb3fc73"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge</a> (int *arr, int l, int m, int r)</td></tr>
@@ -134,6 +153,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Merge_sort" target="_blank">Merege Sort Algorithm (MEREGE SORT)</a> implementation </p>
 <dl class="section author"><dt>Author</dt><dd><a href="http://github.com/ayaankhan98" target="_blank">Ayaan Khan</a></dd></dl>
 <p>Merge Sort is an efficient, general purpose, comparison based sorting algorithm. Merge Sort is a divide and conquer algorithm </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d5/df4/merge__sort_8cpp_source.html">merge_sort.cpp</a>.</p>
 </div></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/d5/df4/merge__sort_8cpp_source.html b/d5/df4/merge__sort_8cpp_source.html
new file mode 100644
index 000000000..40b9101cb
--- /dev/null
+++ b/d5/df4/merge__sort_8cpp_source.html
@@ -0,0 +1,208 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/merge_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/df4/merge__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">merge_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d5/df4/merge__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
+<div class="foldopen" id="foldopen00033" data-start="{" data-end="}">
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">   33</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge</a>(<span class="keywordtype">int</span> *arr, <span class="keywordtype">int</span> l, <span class="keywordtype">int</span> m, <span class="keywordtype">int</span> r) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordtype">int</span> i, j, k;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordtype">int</span> n1 = m - l + 1;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordtype">int</span> n2 = r - m;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordtype">int</span> *L = <span class="keyword">new</span> <span class="keywordtype">int</span>[n1], *R = <span class="keyword">new</span> <span class="keywordtype">int</span>[n2];</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">for</span> (i = 0; i &lt; n1; i++) L[i] = arr[l + i];</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">for</span> (j = 0; j &lt; n2; j++) R[j] = arr[m + 1 + j];</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    i = 0;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    j = 0;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    k = l;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keywordflow">while</span> (i &lt; n1 || j &lt; n2) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="keywordflow">if</span> (j &gt;= n2 || (i &lt; n1 &amp;&amp; L[i] &lt;= R[j])) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            arr[k] = L[i];</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            i++;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>            arr[k] = R[j];</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            j++;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        }</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        k++;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keyword">delete</span>[] L;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keyword">delete</span>[] R;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>}</div>
+</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="foldopen" id="foldopen00071" data-start="{" data-end="}">
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"><a class="line" href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">   71</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(<span class="keywordtype">int</span> *arr, <span class="keywordtype">int</span> l, <span class="keywordtype">int</span> r) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keywordflow">if</span> (l &lt; r) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        <span class="keywordtype">int</span> m = l + (r - l) / 2;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        <a class="code hl_function" href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, l, m);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        <a class="code hl_function" href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, m + 1, r);</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <a class="code hl_function" href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge</a>(arr, l, m, r);</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>}</div>
+</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="foldopen" id="foldopen00084" data-start="{" data-end="}">
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"><a class="line" href="../../d5/d4c/group__sorting.html#ga0a9a57a1f1bbba3d4822531d002b7e07">   84</a></span><span class="keywordtype">void</span> show(<span class="keywordtype">int</span> *arr, <span class="keywordtype">int</span> size) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>}</div>
+</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="foldopen" id="foldopen00090" data-start="{" data-end="}">
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="../../d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4">   90</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordtype">int</span> size;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of elements : &quot;</span>;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    std::cin &gt;&gt; size;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keywordtype">int</span> *arr = <span class="keyword">new</span> <span class="keywordtype">int</span>[size];</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the unsorted elements : &quot;</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        std::cin &gt;&gt; arr[i];</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    }</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <a class="code hl_function" href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(arr, 0, size - 1);</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted array : &quot;</span>;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    show(arr, size);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="keyword">delete</span>[] arr;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>}</div>
+</div>
+<div class="ttc" id="agroup__sorting_html_ga460c61cd948203b4816bef2accb3fc73"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge</a></div><div class="ttdeci">void merge(int *arr, int l, int m, int r)</div><div class="ttdef"><b>Definition</b> <a href="#l00033">merge_sort.cpp:33</a></div></div>
+<div class="ttc" id="agroup__sorting_html_gab6b14fea48d9841e29b9fc26be6e05d7"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a></div><div class="ttdeci">void mergeSort(int *arr, int l, int r)</div><div class="ttdef"><b>Definition</b> <a href="#l00071">merge_sort.cpp:71</a></div></div>
+<div class="ttc" id="agroup__sorting_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00090">merge_sort.cpp:90</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d5/df4/merge__sort_8cpp.html">merge_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d5/df6/check__amicable__pair_8cpp.html b/d5/df6/check__amicable__pair_8cpp.html
index 0e007c170..a4dd95935 100644
--- a/d5/df6/check__amicable__pair_8cpp.html
+++ b/d5/df6/check__amicable__pair_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/check_amicable_pair.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/check_amicable_pair.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for check_amicable_pair.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d0c/check__amicable__pair_8cpp__incl.svg" width="171" height="126"><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">
+</div>
+<p><a href="../../d5/df6/check__amicable__pair_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -147,6 +166,8 @@ Functions</h2></td></tr>
 <p>An Amicable Pair is two positive integers such that the sum of the proper divisor for each number is equal to the other number.</p>
 <dl class="section note"><dt>Note</dt><dd>Remember that a proper divisor is any positive whole number that divides into a selected number, apart from the selected number itself, and returns a positive integer. for example 1, 2 and 5 are all proper divisors of 10.</dd></dl>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/iamnambiar" target="_blank">iamnambiar</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d5/df6/check__amicable__pair_8cpp_source.html">check_amicable_pair.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -165,17 +186,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/df6/check__amicable__pair_8cpp_source.html#l00081">81</a> of file <a class="el" href="../../d5/df6/check__amicable__pair_8cpp_source.html">check_amicable_pair.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   81</span>           {</div>
 <div class="line"><span class="lineno">   82</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// perform self-tests implementations</span></div>
 <div class="line"><span class="lineno">   83</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   84</span>}</div>
-<div class="ttc" id="acheck__amicable__pair_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> check_amicable_pair.cpp:67</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="536" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acheck__amicable__pair_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/df6/check__amicable__pair_8cpp_source.html#l00067">check_amicable_pair.cpp:67</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -203,6 +221,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/df6/check__amicable__pair_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../d5/df6/check__amicable__pair_8cpp_source.html">check_amicable_pair.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   67</span>                    {</div>
 <div class="line"><span class="lineno">   68</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a>(220, 284) == <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">   69</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a>(6368, 6232) == <span class="keyword">true</span>);</div>
@@ -210,17 +230,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   71</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a>(17296, 18416) == <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">   72</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a>(18416, 17296) == <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">   73</span> </div>
-<div class="line"><span class="lineno">   74</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!&quot;</span> &lt;&lt; <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">   74</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   75</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="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="anamespacemath_html_a8e6eede206201db0d1dbb618fa969bec"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a></div><div class="ttdeci">bool are_amicable(int x, int y)</div><div class="ttdoc">Function to check whether the pair is amicable or not.</div><div class="ttdef"><b>Definition</b> check_amicable_pair.cpp:58</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="439" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemath_html_a8e6eede206201db0d1dbb618fa969bec"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a></div><div class="ttdeci">bool are_amicable(int x, int y)</div><div class="ttdoc">Function to check whether the pair is amicable or not.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/df6/check__amicable__pair_8cpp_source.html#l00058">check_amicable_pair.cpp:58</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index 2d46347d5..000000000
--- a/d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,31,56,56"/>
-<area shape="rect" id="Node000002" href="$dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec" title="Function to check whether the pair is amicable or not." alt="" coords="104,5,239,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,36,88,30,89,36,56,42"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="136,55,207,80"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,45,121,56,120,62,55,50"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" title="Function to calculate the sum of all the proper divisor of an integer." alt="" coords="287,5,433,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="239,16,272,16,272,21,239,21"/>
-</map>
diff --git a/d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 238f4e4b3..000000000
--- a/d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-91b553d09597618c6169583635e22eff
\ No newline at end of file
diff --git a/d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index bcdb2c7af..000000000
--- a/d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="329pt" height="64pt"
- viewBox="0.00 0.00 329.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec" target="_top" xlink:title="Function to check whether the pair is amicable or not.">
-<polygon fill="white" stroke="#666666" points="175.25,-56.25 73.75,-56.25 73.75,-37 175.25,-37 175.25,-56.25"/>
-<text text-anchor="middle" x="124.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::are_amicable</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.93,-30.93C45.02,-32.23 53.6,-33.81 62.56,-35.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.65,-38.84 72.11,-37.2 62.91,-31.96 61.65,-38.84"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.25,-19.25 97.75,-19.25 97.75,0 151.25,0 151.25,-19.25"/>
-<text text-anchor="middle" x="124.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.93,-24.49C51.31,-22.17 70.01,-18.92 86.52,-16.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.76,-19.56 96.01,-14.4 85.56,-12.66 86.76,-19.56"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" target="_top" xlink:title="Function to calculate the sum of all the proper divisor of an integer.">
-<polygon fill="white" stroke="#666666" points="321,-56.25 211.25,-56.25 211.25,-37 321,-37 321,-56.25"/>
-<text text-anchor="middle" x="266.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sum_of_divisor</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.51,-46.62C183.38,-46.62 191.62,-46.62 199.78,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="199.69,-50.13 209.69,-46.63 199.69,-43.13 199.69,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index bc5db503a..000000000
--- a/d5/df6/check__amicable__pair_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="329pt" height="64pt"
- viewBox="0.00 0.00 329.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec" target="_top" xlink:title="Function to check whether the pair is amicable or not.">
-<polygon fill="white" stroke="#666666" points="175.25,-56.25 73.75,-56.25 73.75,-37 175.25,-37 175.25,-56.25"/>
-<text text-anchor="middle" x="124.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::are_amicable</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.93,-30.93C45.02,-32.23 53.6,-33.81 62.56,-35.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.65,-38.84 72.11,-37.2 62.91,-31.96 61.65,-38.84"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.25,-19.25 97.75,-19.25 97.75,0 151.25,0 151.25,-19.25"/>
-<text text-anchor="middle" x="124.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.93,-24.49C51.31,-22.17 70.01,-18.92 86.52,-16.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.76,-19.56 96.01,-14.4 85.56,-12.66 86.76,-19.56"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" target="_top" xlink:title="Function to calculate the sum of all the proper divisor of an integer.">
-<polygon fill="white" stroke="#666666" points="321,-56.25 211.25,-56.25 211.25,-37 321,-37 321,-56.25"/>
-<text text-anchor="middle" x="266.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sum_of_divisor</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.51,-46.62C183.38,-46.62 191.62,-46.62 199.78,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="199.69,-50.13 209.69,-46.63 199.69,-43.13 199.69,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index fcc37fc9b..000000000
--- a/d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,31,153,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,41,88,41,88,46,55,46"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec" title="Function to check whether the pair is amicable or not." alt="" coords="201,5,336,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,36,186,30,187,36,154,42"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="233,55,304,80"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="154,45,218,56,218,62,153,50"/>
-<area shape="rect" id="Node000004" href="$dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" title="Function to calculate the sum of all the proper divisor of an integer." alt="" coords="384,5,531,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="337,16,369,16,369,21,337,21"/>
-</map>
diff --git a/d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index b62d41ae1..000000000
--- a/d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d20519596209338efb9b7411bd2f01be
\ No newline at end of file
diff --git a/d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index a8edf235c..000000000
--- a/d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="402pt" height="64pt"
- viewBox="0.00 0.00 402.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-37.25 73,-37.25 73,-18 110.75,-18 110.75,-37.25"/>
-<text text-anchor="middle" x="91.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-27.62C44.55,-27.62 53.37,-27.62 61.69,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-31.13 71.43,-27.63 61.43,-24.13 61.43,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec" target="_top" xlink:title="Function to check whether the pair is amicable or not.">
-<polygon fill="white" stroke="#666666" points="248.25,-56.25 146.75,-56.25 146.75,-37 248.25,-37 248.25,-56.25"/>
-<text text-anchor="middle" x="197.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::are_amicable</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.93,-30.93C118.02,-32.23 126.6,-33.81 135.56,-35.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.65,-38.84 145.11,-37.2 135.91,-31.96 134.65,-38.84"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224.25,-19.25 170.75,-19.25 170.75,0 224.25,0 224.25,-19.25"/>
-<text text-anchor="middle" x="197.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.93,-24.49C124.31,-22.17 143.01,-18.92 159.52,-16.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.76,-19.56 169.01,-14.4 158.56,-12.66 159.76,-19.56"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" target="_top" xlink:title="Function to calculate the sum of all the proper divisor of an integer.">
-<polygon fill="white" stroke="#666666" points="394,-56.25 284.25,-56.25 284.25,-37 394,-37 394,-56.25"/>
-<text text-anchor="middle" x="339.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sum_of_divisor</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.51,-46.62C256.38,-46.62 264.62,-46.62 272.78,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.69,-50.13 282.69,-46.63 272.69,-43.13 272.69,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index abfe04f5e..000000000
--- a/d5/df6/check__amicable__pair_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="402pt" height="64pt"
- viewBox="0.00 0.00 402.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-37.25 73,-37.25 73,-18 110.75,-18 110.75,-37.25"/>
-<text text-anchor="middle" x="91.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-27.62C44.55,-27.62 53.37,-27.62 61.69,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-31.13 71.43,-27.63 61.43,-24.13 61.43,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec" target="_top" xlink:title="Function to check whether the pair is amicable or not.">
-<polygon fill="white" stroke="#666666" points="248.25,-56.25 146.75,-56.25 146.75,-37 248.25,-37 248.25,-56.25"/>
-<text text-anchor="middle" x="197.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::are_amicable</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.93,-30.93C118.02,-32.23 126.6,-33.81 135.56,-35.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.65,-38.84 145.11,-37.2 135.91,-31.96 134.65,-38.84"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224.25,-19.25 170.75,-19.25 170.75,0 224.25,0 224.25,-19.25"/>
-<text text-anchor="middle" x="197.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.93,-24.49C124.31,-22.17 143.01,-18.92 159.52,-16.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.76,-19.56 169.01,-14.4 158.56,-12.66 159.76,-19.56"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" target="_top" xlink:title="Function to calculate the sum of all the proper divisor of an integer.">
-<polygon fill="white" stroke="#666666" points="394,-56.25 284.25,-56.25 284.25,-37 394,-37 394,-56.25"/>
-<text text-anchor="middle" x="339.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sum_of_divisor</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.51,-46.62C256.38,-46.62 264.62,-46.62 272.78,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.69,-50.13 282.69,-46.63 272.69,-43.13 272.69,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d5/df6/check__amicable__pair_8cpp_source.html b/d5/df6/check__amicable__pair_8cpp_source.html
new file mode 100644
index 000000000..399420329
--- /dev/null
+++ b/d5/df6/check__amicable__pair_8cpp_source.html
@@ -0,0 +1,194 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/check_amicable_pair.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d5/df6/check__amicable__pair_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">check_amicable_pair.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d5/df6/check__amicable__pair_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="foldopen" id="foldopen00031" data-start="{" data-end="}">
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a">   31</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a">sum_of_divisor</a>(<span class="keywordtype">int</span> num) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="comment">// Variable to store the sum of all proper divisors.</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordtype">int</span> sum = 1;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="comment">// Below loop condition helps to reduce Time complexity by a factor of</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="comment">// square root of the number.</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> div = 2; div * div &lt;= num; ++div) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        <span class="comment">// Check &#39;div&#39; is divisor of &#39;num&#39;.</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <span class="keywordflow">if</span> (num % div == 0) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            <span class="comment">// If both divisor are same, add once to &#39;sum&#39;</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>            <span class="keywordflow">if</span> (div == (num / div)) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>                sum += div;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>                <span class="comment">// If both divisor are not the same, add both to &#39;sum&#39;.</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>                sum += (div + (num / div));</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>            }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        }</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">return</span> sum;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>}</div>
+</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="foldopen" id="foldopen00058" data-start="{" data-end="}">
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">   58</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">are_amicable</a>(<span class="keywordtype">int</span> x, <span class="keywordtype">int</span> y) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">return</span> (<a class="code hl_function" href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a">sum_of_divisor</a>(x) == y) &amp;&amp; (<a class="code hl_function" href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a">sum_of_divisor</a>(y) == x);</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>}</div>
+</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="foldopen" id="foldopen00067" data-start="{" data-end="}">
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">   67</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a>(220, 284) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a>(6368, 6232) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a>(458, 232) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a>(17296, 18416) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a>(18416, 17296) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>}</div>
+</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="foldopen" id="foldopen00081" data-start="{" data-end="}">
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="../../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   81</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <a class="code hl_function" href="../../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// perform self-tests implementations</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>}</div>
+</div>
+<div class="ttc" id="acheck__amicable__pair_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_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> <a href="#l00067">check_amicable_pair.cpp:67</a></div></div>
+<div class="ttc" id="acheck__amicable__pair_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00081">check_amicable_pair.cpp:81</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_a8e6eede206201db0d1dbb618fa969bec"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec">math::are_amicable</a></div><div class="ttdeci">bool are_amicable(int x, int y)</div><div class="ttdoc">Function to check whether the pair is amicable or not.</div><div class="ttdef"><b>Definition</b> <a href="#l00058">check_amicable_pair.cpp:58</a></div></div>
+<div class="ttc" id="anamespacemath_html_af05567415a9ea36c254b54e3d5a2152a"><div class="ttname"><a href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a">math::sum_of_divisor</a></div><div class="ttdeci">int sum_of_divisor(int num)</div><div class="ttdoc">Function to calculate the sum of all the proper divisor of an integer.</div><div class="ttdef"><b>Definition</b> <a href="#l00031">check_amicable_pair.cpp:31</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d5/df6/check__amicable__pair_8cpp.html">check_amicable_pair.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/d02/file__linter_8py_source.html b/d6/d02/file__linter_8py_source.html
new file mode 100644
index 000000000..d5448544a
--- /dev/null
+++ b/d6/d02/file__linter_8py_source.html
@@ -0,0 +1,176 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: scripts/file_linter.py Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/d02/file__linter_8py_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">file_linter.py</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="keyword">import</span> os</div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="keyword">import</span> subprocess</div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="keyword">import</span> sys</div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span>print(<span class="stringliteral">&quot;Python {}.{}.{}&quot;</span>.format(*sys.version_info))  <span class="comment"># Python 3.8</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="keyword">with</span> open(<span class="stringliteral">&quot;git_diff.txt&quot;</span>) <span class="keyword">as</span> in_file:</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span>    modified_files = sorted(in_file.read().splitlines())</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>    print(<span class="stringliteral">&quot;{} files were modified.&quot;</span>.format(len(modified_files)))</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    cpp_exts = tuple(<span class="stringliteral">&quot;.c .c++ .cc .cpp .cu .cuh .cxx .h .h++ .hh .hpp .hxx&quot;</span>.split())</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    cpp_files = [file <span class="keywordflow">for</span> file <span class="keywordflow">in</span> modified_files <span class="keywordflow">if</span> file.lower().endswith(cpp_exts)]</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    print(f<span class="stringliteral">&quot;{len(cpp_files)} C++ files were modified.&quot;</span>)</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <span class="keywordflow">if</span> <span class="keywordflow">not</span> cpp_files:</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>        sys.exit(0)</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>        subprocess.run([<span class="stringliteral">&quot;clang-tidy&quot;</span>, <span class="stringliteral">&quot;--fix&quot;</span>, <span class="stringliteral">&quot;-p=build&quot;</span>, <span class="stringliteral">&quot;--extra-arg=-std=c++11&quot;</span>, *cpp_files, <span class="stringliteral">&quot;--&quot;</span>], </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>            check=<span class="keyword">True</span>, text=<span class="keyword">True</span>, stderr=subprocess.STDOUT)</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        subprocess.run([<span class="stringliteral">&quot;clang-format&quot;</span>, <span class="stringliteral">&quot;-i&quot;</span>, <span class="stringliteral">&quot;-style=file&quot;</span>, *cpp_files], </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>            check=<span class="keyword">True</span>, text=<span class="keyword">True</span>, stderr=subprocess.STDOUT)</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        upper_files = [file <span class="keywordflow">for</span> file <span class="keywordflow">in</span> cpp_files <span class="keywordflow">if</span> file != file.lower()]</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        <span class="keywordflow">if</span> upper_files:</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>            print(f<span class="stringliteral">&quot;{len(upper_files)} files contain uppercase characters:&quot;</span>)</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>            print(<span class="stringliteral">&quot;\n&quot;</span>.join(upper_files) + <span class="stringliteral">&quot;\n&quot;</span>)</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        space_files = [file <span class="keywordflow">for</span> file <span class="keywordflow">in</span> cpp_files <span class="keywordflow">if</span> <span class="stringliteral">&quot; &quot;</span> <span class="keywordflow">in</span> file <span class="keywordflow">or</span> <span class="stringliteral">&quot;-&quot;</span> <span class="keywordflow">in</span> file]</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        <span class="keywordflow">if</span> space_files:</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>            print(f<span class="stringliteral">&quot;{len(space_files)} files contain space or dash characters:&quot;</span>)</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>            print(<span class="stringliteral">&quot;\n&quot;</span>.join(space_files) + <span class="stringliteral">&quot;\n&quot;</span>)</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        nodir_files = [file <span class="keywordflow">for</span> file <span class="keywordflow">in</span> cpp_files <span class="keywordflow">if</span> file.count(os.sep) != 1]</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        <span class="keywordflow">if</span> nodir_files:</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>            print(f<span class="stringliteral">&quot;{len(nodir_files)} files are not in one and only one directory:&quot;</span>)</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>            print(<span class="stringliteral">&quot;\n&quot;</span>.join(nodir_files) + <span class="stringliteral">&quot;\n&quot;</span>)</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        bad_files = len(upper_files + space_files + nodir_files)</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <span class="keywordflow">if</span> bad_files:</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            sys.exit(bad_files)</div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_53e6fa9553ac22a5646d2a2b2d7b97a1.html">scripts</a></li><li class="navelem"><b>file_linter.py</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html b/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html
index ed9582bb6..65cc7dae2 100644
--- a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html
+++ b/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::queue_using_array::Queue_Array Class Reference</title>
+<title>TheAlgorithms/C++: data_structures::queue_using_array::Queue_Array Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -117,7 +134,7 @@ $(function(){initNavTree('d6/d04/classdata__structures_1_1queue__using__array_1_
 <div class="dynheader">
 Collaboration diagram for data_structures::queue_using_array::Queue_Array:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.svg" width="191" height="244"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.svg" width="191" height="155"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
@@ -140,12 +157,14 @@ Private Attributes</h2></td></tr>
 <tr class="memitem:a9883dfcceede9a42227d2d313ae86f85" id="r_a9883dfcceede9a42227d2d313ae86f85"><td class="memItemLeft" align="right" valign="top">int8_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9883dfcceede9a42227d2d313ae86f85">rear</a> {-1}</td></tr>
 <tr class="memdesc:a9883dfcceede9a42227d2d313ae86f85"><td class="mdescLeft">&#160;</td><td class="mdescRight">Index of tail of the array.  <br /></td></tr>
 <tr class="separator:a9883dfcceede9a42227d2d313ae86f85"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae69a0bf6c9921b37c516c8a4d2fb904d" id="r_ae69a0bf6c9921b37c516c8a4d2fb904d"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int16_t, <a class="el" href="../../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">max_size</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a> {}</td></tr>
+<tr class="memitem:ae69a0bf6c9921b37c516c8a4d2fb904d" id="r_ae69a0bf6c9921b37c516c8a4d2fb904d"><td class="memItemLeft" align="right" valign="top">std::array&lt; int16_t, <a class="el" href="../../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">max_size</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a> {}</td></tr>
 <tr class="memdesc:ae69a0bf6c9921b37c516c8a4d2fb904d"><td class="mdescLeft">&#160;</td><td class="mdescRight">All stored data.  <br /></td></tr>
 <tr class="separator:ae69a0bf6c9921b37c516c8a4d2fb904d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" title="Queue_Array class containing the main data and also index of head and tail of the array.">Queue_Array</a> class containing the main data and also index of head and tail of the array. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html">queue_using_array.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="a2aaf88c9954ef3ab686f8e4bfbd87622" name="a2aaf88c9954ef3ab686f8e4bfbd87622"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a2aaf88c9954ef3ab686f8e4bfbd87622">&#9670;&#160;</a></span>dequeue()</h2>
@@ -165,31 +184,26 @@ Private Attributes</h2></td></tr>
 <p>Delete element from back of the queue. </p>
 <p>Remove element that is located at the first of the queue.</p>
 <dl class="section return"><dt>Returns</dt><dd>data that is deleted if queue is not empty </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html#l00076">76</a> of file <a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html">queue_using_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   76</span>                         {</div>
 <div class="line"><span class="lineno">   77</span>    int8_t d{0};</div>
 <div class="line"><span class="lineno">   78</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == -1) {</div>
-<div class="line"><span class="lineno">   79</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nstack is empty &quot;</span>;</div>
+<div class="line"><span class="lineno">   79</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nstack is empty &quot;</span>;</div>
 <div class="line"><span class="lineno">   80</span>        <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   81</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == <a class="code hl_variable" href="#a9883dfcceede9a42227d2d313ae86f85">rear</a>) {</div>
-<div class="line"><span class="lineno">   82</span>        d = <a class="code hl_variable" href="#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/at.html">at</a>(<a class="code hl_variable" href="#a2f676f2f249eb36dfd49711a03e9e67e">front</a>);</div>
+<div class="line"><span class="lineno">   82</span>        d = <a class="code hl_variable" href="#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.at(<a class="code hl_variable" href="#a2f676f2f249eb36dfd49711a03e9e67e">front</a>);</div>
 <div class="line"><span class="lineno">   83</span>        <a class="code hl_variable" href="#a2f676f2f249eb36dfd49711a03e9e67e">front</a> = <a class="code hl_variable" href="#a9883dfcceede9a42227d2d313ae86f85">rear</a> = -1;</div>
 <div class="line"><span class="lineno">   84</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   85</span>        d = <a class="code hl_variable" href="#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/at.html">at</a>(<a class="code hl_variable" href="#a2f676f2f249eb36dfd49711a03e9e67e">front</a>++);</div>
+<div class="line"><span class="lineno">   85</span>        d = <a class="code hl_variable" href="#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.at(<a class="code hl_variable" href="#a2f676f2f249eb36dfd49711a03e9e67e">front</a>++);</div>
 <div class="line"><span class="lineno">   86</span>    }</div>
 <div class="line"><span class="lineno">   87</span> </div>
 <div class="line"><span class="lineno">   88</span>    <span class="keywordflow">return</span> d;</div>
 <div class="line"><span class="lineno">   89</span>}</div>
-<div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/at.html">std::array::at</a></div><div class="ttdeci">T at(T... args)</div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a2f676f2f249eb36dfd49711a03e9e67e"><div class="ttname"><a href="#a2f676f2f249eb36dfd49711a03e9e67e">data_structures::queue_using_array::Queue_Array::front</a></div><div class="ttdeci">int8_t front</div><div class="ttdoc">Index of head of the array.</div><div class="ttdef"><b>Definition</b> queue_using_array.cpp:50</div></div>
-<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a9883dfcceede9a42227d2d313ae86f85"><div class="ttname"><a href="#a9883dfcceede9a42227d2d313ae86f85">data_structures::queue_using_array::Queue_Array::rear</a></div><div class="ttdeci">int8_t rear</div><div class="ttdoc">Index of tail of the array.</div><div class="ttdef"><b>Definition</b> queue_using_array.cpp:51</div></div>
-<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_ae69a0bf6c9921b37c516c8a4d2fb904d"><div class="ttname"><a href="#ae69a0bf6c9921b37c516c8a4d2fb904d">data_structures::queue_using_array::Queue_Array::arr</a></div><div class="ttdeci">std::array&lt; int16_t, max_size &gt; arr</div><div class="ttdoc">All stored data.</div><div class="ttdef"><b>Definition</b> queue_using_array.cpp:52</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph.svg" width="334" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a2f676f2f249eb36dfd49711a03e9e67e"><div class="ttname"><a href="#a2f676f2f249eb36dfd49711a03e9e67e">data_structures::queue_using_array::Queue_Array::front</a></div><div class="ttdeci">int8_t front</div><div class="ttdoc">Index of head of the array.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/df0/queue__using__array_8cpp_source.html#l00050">queue_using_array.cpp:50</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a9883dfcceede9a42227d2d313ae86f85"><div class="ttname"><a href="#a9883dfcceede9a42227d2d313ae86f85">data_structures::queue_using_array::Queue_Array::rear</a></div><div class="ttdeci">int8_t rear</div><div class="ttdoc">Index of tail of the array.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/df0/queue__using__array_8cpp_source.html#l00051">queue_using_array.cpp:51</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_ae69a0bf6c9921b37c516c8a4d2fb904d"><div class="ttname"><a href="#ae69a0bf6c9921b37c516c8a4d2fb904d">data_structures::queue_using_array::Queue_Array::arr</a></div><div class="ttdeci">std::array&lt; int16_t, max_size &gt; arr</div><div class="ttdoc">All stored data.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/df0/queue__using__array_8cpp_source.html#l00052">queue_using_array.cpp:52</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a688b7ea064739ea9fa66bf64bf4ae631" name="a688b7ea064739ea9fa66bf64bf4ae631"></a>
@@ -209,19 +223,16 @@ Here is the call graph for this function:</div>
 
 <p>Show all saved data. </p>
 <p>Utility function to show all elements in the queue. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html#l00094">94</a> of file <a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html">queue_using_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   94</span>                                {</div>
 <div class="line"><span class="lineno">   95</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == -1) {</div>
-<div class="line"><span class="lineno">   96</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nStack is empty&quot;</span>;</div>
+<div class="line"><span class="lineno">   96</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nStack is empty&quot;</span>;</div>
 <div class="line"><span class="lineno">   97</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   98</span>        <span class="keywordflow">for</span> (int16_t i{<a class="code hl_variable" href="#a2f676f2f249eb36dfd49711a03e9e67e">front</a>}; i &lt;= <a class="code hl_variable" href="#a9883dfcceede9a42227d2d313ae86f85">rear</a>; ++i) <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_variable" href="#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/at.html">at</a>(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   98</span>        <span class="keywordflow">for</span> (int16_t i{<a class="code hl_variable" href="#a2f676f2f249eb36dfd49711a03e9e67e">front</a>}; i &lt;= <a class="code hl_variable" href="#a9883dfcceede9a42227d2d313ae86f85">rear</a>; ++i) std::cout &lt;&lt; <a class="code hl_variable" href="#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.at(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   99</span>    }</div>
 <div class="line"><span class="lineno">  100</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph.svg" width="334" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4dc64488c36f84d927365fa8d1933663" name="a4dc64488c36f84d927365fa8d1933663"></a>
@@ -247,25 +258,21 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html">queue_using_array.cpp</a>.</p>
 <div class="fragment"><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_variable" href="#a9883dfcceede9a42227d2d313ae86f85">rear</a> == <a class="code hl_variable" href="#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>() - 1) {</div>
-<div class="line"><span class="lineno">   61</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nStack is full&quot;</span>;</div>
+<div class="line"><span class="lineno">   60</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a9883dfcceede9a42227d2d313ae86f85">rear</a> == <a class="code hl_variable" href="#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.size() - 1) {</div>
+<div class="line"><span class="lineno">   61</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nStack is full&quot;</span>;</div>
 <div class="line"><span class="lineno">   62</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == -1 &amp;&amp; <a class="code hl_variable" href="#a9883dfcceede9a42227d2d313ae86f85">rear</a> == -1) {</div>
 <div class="line"><span class="lineno">   63</span>        <a class="code hl_variable" href="#a2f676f2f249eb36dfd49711a03e9e67e">front</a> = 0;</div>
 <div class="line"><span class="lineno">   64</span>        <a class="code hl_variable" href="#a9883dfcceede9a42227d2d313ae86f85">rear</a> = 0;</div>
 <div class="line"><span class="lineno">   65</span>        <a class="code hl_variable" href="#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>[<a class="code hl_variable" href="#a9883dfcceede9a42227d2d313ae86f85">rear</a>] = ele;</div>
-<div class="line"><span class="lineno">   66</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a9883dfcceede9a42227d2d313ae86f85">rear</a> &lt; <a class="code hl_variable" href="#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>()) {</div>
+<div class="line"><span class="lineno">   66</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a9883dfcceede9a42227d2d313ae86f85">rear</a> &lt; <a class="code hl_variable" href="#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.size()) {</div>
 <div class="line"><span class="lineno">   67</span>        ++<a class="code hl_variable" href="#a9883dfcceede9a42227d2d313ae86f85">rear</a>;</div>
 <div class="line"><span class="lineno">   68</span>        <a class="code hl_variable" href="#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>[<a class="code hl_variable" href="#a9883dfcceede9a42227d2d313ae86f85">rear</a>] = ele;</div>
 <div class="line"><span class="lineno">   69</span>    }</div>
 <div class="line"><span class="lineno">   70</span>}</div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/size.html">std::array::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph.svg" width="347" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
@@ -279,7 +286,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;int16_t, <a class="el" href="../../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">max_size</a>&gt; data_structures::queue_using_array::Queue_Array::arr {}</td>
+          <td class="memname">std::array&lt;int16_t, <a class="el" href="../../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">max_size</a>&gt; data_structures::queue_using_array::Queue_Array::arr {}</td>
         </tr>
       </table>
   </td>
@@ -290,7 +297,9 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>All stored data. </p>
-<div class="fragment"><div class="line"><span class="lineno">   52</span>{};  <span class="comment">///&lt; All stored data</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html#l00052">52</a> of file <a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html">queue_using_array.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   52</span>{};  </div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -315,7 +324,9 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>Index of head of the array. </p>
-<div class="fragment"><div class="line"><span class="lineno">   50</span>{-1};                     <span class="comment">///&lt; Index of head of the array</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html#l00050">50</a> of file <a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html">queue_using_array.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   50</span>{-1};                     </div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -340,12 +351,14 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>Index of tail of the array. </p>
-<div class="fragment"><div class="line"><span class="lineno">   51</span>{-1};                      <span class="comment">///&lt; Index of tail of the array</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html#l00051">51</a> of file <a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html">queue_using_array.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   51</span>{-1};                      </div>
 </div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../d8/df0/queue__using__array_8cpp.html">queue_using_array.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html">queue_using_array.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph.map b/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph.map
deleted file mode 100644
index c34ade34b..000000000
--- a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::queue_using_array::Queue_Array::dequeue" name="data_structures::queue_using_array::Queue_Array::dequeue">
-<area shape="rect" id="Node000001" title="Delete element from back of the queue." alt="" coords="5,5,185,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/at.html#" title=" " alt="" coords="233,20,328,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="185,30,217,30,217,36,185,36"/>
-</map>
diff --git a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph.md5 b/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph.md5
deleted file mode 100644
index e2c577ebf..000000000
--- a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6b05ad09da2502fd73e8fe20d258420f
\ No newline at end of file
diff --git a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph.svg b/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph.svg
deleted file mode 100644
index f7bf7ffb5..000000000
--- a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::queue_using_array::Queue_Array::dequeue Pages: 1 -->
-<svg width="250pt" height="50pt"
- viewBox="0.00 0.00 250.00 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>data_structures::queue_using_array::Queue_Array::dequeue</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Delete element from back of the queue.">
-<polygon fill="#999999" stroke="#666666" points="134.5,-41.75 0,-41.75 0,0 134.5,0 134.5,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::queue</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array::Queue_Array</text>
-<text text-anchor="middle" x="67.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::dequeue</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242,-30.5 170.5,-30.5 170.5,-11.25 242,-11.25 242,-30.5"/>
-<text text-anchor="middle" x="206.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.74,-20.88C142.89,-20.88 151.08,-20.88 158.84,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.73,-24.38 168.73,-20.88 158.73,-17.38 158.73,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph_org.svg b/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph_org.svg
deleted file mode 100644
index d59c2c701..000000000
--- a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::queue_using_array::Queue_Array::dequeue Pages: 1 -->
-<svg width="250pt" height="50pt"
- viewBox="0.00 0.00 250.00 49.75" 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.75)">
-<title>data_structures::queue_using_array::Queue_Array::dequeue</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Delete element from back of the queue.">
-<polygon fill="#999999" stroke="#666666" points="134.5,-41.75 0,-41.75 0,0 134.5,0 134.5,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::queue</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array::Queue_Array</text>
-<text text-anchor="middle" x="67.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::dequeue</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242,-30.5 170.5,-30.5 170.5,-11.25 242,-11.25 242,-30.5"/>
-<text text-anchor="middle" x="206.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.74,-20.88C142.89,-20.88 151.08,-20.88 158.84,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.73,-24.38 168.73,-20.88 158.73,-17.38 158.73,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph.map b/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph.map
deleted file mode 100644
index 8456902d9..000000000
--- a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::queue_using_array::Queue_Array::enqueue" name="data_structures::queue_using_array::Queue_Array::enqueue">
-<area shape="rect" id="Node000001" title="Add element to the first of the queue." alt="" coords="5,5,185,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="233,20,341,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="185,30,217,30,217,36,185,36"/>
-</map>
diff --git a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph.md5 b/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph.md5
deleted file mode 100644
index 1cbc01997..000000000
--- a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-aba6c8f1488540a1d9356bd27844ecb9
\ No newline at end of file
diff --git a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph.svg b/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph.svg
deleted file mode 100644
index b65b94a95..000000000
--- a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::queue_using_array::Queue_Array::enqueue Pages: 1 -->
-<svg width="260pt" height="50pt"
- viewBox="0.00 0.00 259.75 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>data_structures::queue_using_array::Queue_Array::enqueue</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Add element to the first of the queue.">
-<polygon fill="#999999" stroke="#666666" points="134.5,-41.75 0,-41.75 0,0 134.5,0 134.5,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::queue</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array::Queue_Array</text>
-<text text-anchor="middle" x="67.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::enqueue</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.75,-30.5 170.5,-30.5 170.5,-11.25 251.75,-11.25 251.75,-30.5"/>
-<text text-anchor="middle" x="211.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.62,-20.88C142.66,-20.88 150.79,-20.88 158.58,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.57,-24.38 168.57,-20.88 158.57,-17.38 158.57,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph_org.svg b/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph_org.svg
deleted file mode 100644
index 61ed56a94..000000000
--- a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::queue_using_array::Queue_Array::enqueue Pages: 1 -->
-<svg width="260pt" height="50pt"
- viewBox="0.00 0.00 259.75 49.75" 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.75)">
-<title>data_structures::queue_using_array::Queue_Array::enqueue</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Add element to the first of the queue.">
-<polygon fill="#999999" stroke="#666666" points="134.5,-41.75 0,-41.75 0,0 134.5,0 134.5,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::queue</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array::Queue_Array</text>
-<text text-anchor="middle" x="67.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::enqueue</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.75,-30.5 170.5,-30.5 170.5,-11.25 251.75,-11.25 251.75,-30.5"/>
-<text text-anchor="middle" x="211.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.62,-20.88C142.66,-20.88 150.79,-20.88 158.58,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.57,-24.38 168.57,-20.88 158.57,-17.38 158.57,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph.map b/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph.map
deleted file mode 100644
index 78ad99ff8..000000000
--- a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::queue_using_array::Queue_Array::display" name="data_structures::queue_using_array::Queue_Array::display">
-<area shape="rect" id="Node000001" title="Show all saved data." alt="" coords="5,5,185,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/at.html#" title=" " alt="" coords="233,20,328,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="185,30,217,30,217,36,185,36"/>
-</map>
diff --git a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph.md5 b/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph.md5
deleted file mode 100644
index a28941acd..000000000
--- a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8ddee84f4ba616875dc3fd739384a968
\ No newline at end of file
diff --git a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph.svg b/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph.svg
deleted file mode 100644
index 59e08b398..000000000
--- a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::queue_using_array::Queue_Array::display Pages: 1 -->
-<svg width="250pt" height="50pt"
- viewBox="0.00 0.00 250.00 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>data_structures::queue_using_array::Queue_Array::display</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Show all saved data.">
-<polygon fill="#999999" stroke="#666666" points="134.5,-41.75 0,-41.75 0,0 134.5,0 134.5,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::queue</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array::Queue_Array</text>
-<text text-anchor="middle" x="67.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::display</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242,-30.5 170.5,-30.5 170.5,-11.25 242,-11.25 242,-30.5"/>
-<text text-anchor="middle" x="206.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.74,-20.88C142.89,-20.88 151.08,-20.88 158.84,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.73,-24.38 168.73,-20.88 158.73,-17.38 158.73,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph_org.svg b/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph_org.svg
deleted file mode 100644
index 9bec23bc6..000000000
--- a/d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::queue_using_array::Queue_Array::display Pages: 1 -->
-<svg width="250pt" height="50pt"
- viewBox="0.00 0.00 250.00 49.75" 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.75)">
-<title>data_structures::queue_using_array::Queue_Array::display</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Show all saved data.">
-<polygon fill="#999999" stroke="#666666" points="134.5,-41.75 0,-41.75 0,0 134.5,0 134.5,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::queue</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array::Queue_Array</text>
-<text text-anchor="middle" x="67.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::display</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242,-30.5 170.5,-30.5 170.5,-11.25 242,-11.25 242,-30.5"/>
-<text text-anchor="middle" x="206.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.74,-20.88C142.89,-20.88 151.08,-20.88 158.84,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.73,-24.38 168.73,-20.88 158.73,-17.38 158.73,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d05/reverse__a__linked__list_8cpp.html b/d6/d05/reverse__a__linked__list_8cpp.html
index 553130af7..23de3304d 100644
--- a/d6/d05/reverse__a__linked__list_8cpp.html
+++ b/d6/d05/reverse__a__linked__list_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/reverse_a_linked_list.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/reverse_a_linked_list.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for reverse_a_linked_list.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/da2/reverse__a__linked__list_8cpp__incl.svg" width="240" height="126"><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">
+</div>
+<p><a href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">data_structures::linked_list::Node</a></td></tr>
@@ -163,6 +182,8 @@ Algorithm</h3>
 <p>Values can be added by iterating to the end of a list (by following the pointers) starting from the first link. Whichever link points to null is considered the last link and is pointed to the new value.</p>
 <p>Linked List can be reversed by using 3 pointers: current, previous, and next_node; we keep iterating until the last node. Meanwhile, before changing to the next of current, we store it in the next_node pointer, now we store the prev pointer in the current of next, this is where the actual reversal happens. And then we move the prev and current pointers one step forward. Then the head node is made to point to the last node (prev pointer) after completion of an iteration.</p>
 <p><a href="https://drive.google.com/file/d/1pM5COF0wx-wermnNy_svtyZquaCUP2xS/view?usp=sharing" target="_blank">A graphic explanation and view of what's happening behind the scenes</a> </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a7f80d9712cc7d77399dcacb4c2917511" name="a7f80d9712cc7d77399dcacb4c2917511"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a7f80d9712cc7d77399dcacb4c2917511">&#9670;&#160;</a></span>copy_all_nodes()</h2>
@@ -187,6 +208,8 @@ Algorithm</h3>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>pointer to the first node/head of the copied list or nullptr </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   53</span>                                             {</div>
 <div class="line"><span class="lineno">   54</span>    <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
 <div class="line"><span class="lineno">   55</span>        <span class="comment">// NOLINTNEXTLINE(cppcoreguidelines-owning-memory)</span></div>
@@ -197,15 +220,10 @@ Algorithm</h3>
 <div class="line"><span class="lineno">   60</span>    }</div>
 <div class="line"><span class="lineno">   61</span>    <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">   62</span>}</div>
-<div class="ttc" id="areverse__a__linked__list_8cpp_html_a7f80d9712cc7d77399dcacb4c2917511"><div class="ttname"><a href="#a7f80d9712cc7d77399dcacb4c2917511">data_structures::linked_list::copy_all_nodes</a></div><div class="ttdeci">Node * copy_all_nodes(const Node *const node)</div><div class="ttdoc">creates a deep copy of a list starting at the input node</div><div class="ttdef"><b>Definition</b> reverse_a_linked_list.cpp:53</div></div>
-<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d05/reverse__a__linked__list_8cpp_a7f80d9712cc7d77399dcacb4c2917511_cgraph.svg" width="164" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="areverse__a__linked__list_8cpp_html_a7f80d9712cc7d77399dcacb4c2917511"><div class="ttname"><a href="#a7f80d9712cc7d77399dcacb4c2917511">data_structures::linked_list::copy_all_nodes</a></div><div class="ttdeci">Node * copy_all_nodes(const Node *const node)</div><div class="ttdoc">creates a deep copy of a list starting at the input node</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00053">reverse_a_linked_list.cpp:53</a></div></div>
+<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -225,19 +243,16 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00301">301</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  301</span>           {</div>
 <div class="line"><span class="lineno">  302</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  303</span>    test_copy_constructor();</div>
 <div class="line"><span class="lineno">  304</span>    test_assignment_operator();</div>
 <div class="line"><span class="lineno">  305</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  306</span>}</div>
-<div class="ttc" id="areverse__a__linked__list_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> reverse_a_linked_list.cpp:228</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="555" height="298"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="areverse__a__linked__list_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00228">reverse_a_linked_list.cpp:228</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -265,6 +280,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00228">228</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  228</span>                   {</div>
 <div class="line"><span class="lineno">  229</span>    <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a> L;</div>
 <div class="line"><span class="lineno">  230</span>    <span class="comment">// 1st test</span></div>
@@ -286,22 +303,15 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  246</span>    assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">traverse</a>(4) == 15);</div>
 <div class="line"><span class="lineno">  247</span>    assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">traverse</a>(5) == 12);</div>
 <div class="line"><span class="lineno">  248</span>    assert(L.<a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a>() == 11);</div>
-<div class="line"><span class="lineno">  249</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!&quot;</span> &lt;&lt; <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">  249</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  250</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="aclassdata__structures_1_1linked__list_1_1list_html"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a></div><div class="ttdef"><b>Definition</b> reverse_a_linked_list.cpp:68</div></div>
-<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a2b951a3f1123b9b2f4891ec96aa76d69"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">data_structures::linked_list::list::traverse</a></div><div class="ttdeci">int32_t traverse(int32_t index) const</div><div class="ttdoc">Utility function to find the i th element of the list.</div><div class="ttdef"><b>Definition</b> reverse_a_linked_list.cpp:168</div></div>
-<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a9785d1478e59f5a90288b2928a7094d6"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6">data_structures::linked_list::list::top</a></div><div class="ttdeci">int32_t top() const</div><div class="ttdoc">Utility function to find the top element of the list.</div><div class="ttdef"><b>Definition</b> reverse_a_linked_list.cpp:142</div></div>
-<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_aa69707af46eb6d410eb3a54ee58e1ed1"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">data_structures::linked_list::list::insert</a></div><div class="ttdeci">void insert(int32_t new_elem)</div><div class="ttdoc">Utility function that adds a new element at the end of the list.</div><div class="ttdef"><b>Definition</b> reverse_a_linked_list.cpp:99</div></div>
-<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_ac466ec086c0835822467bd3d8f3ab90e"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e">data_structures::linked_list::list::reverseList</a></div><div class="ttdeci">void reverseList()</div><div class="ttdoc">Utility function for reversing a list.</div><div class="ttdef"><b>Definition</b> reverse_a_linked_list.cpp:125</div></div>
-<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_af39bcc08641ce0c813023f364a9a9015"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">data_structures::linked_list::list::last</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; last</div><div class="ttdoc">last link on the list</div><div class="ttdef"><b>Definition</b> linked_list.cpp:84</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><!-- 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="../../d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="458" height="298"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a></div><div class="ttdef"><b>Definition</b> <a href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00068">reverse_a_linked_list.cpp:68</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a2b951a3f1123b9b2f4891ec96aa76d69"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">data_structures::linked_list::list::traverse</a></div><div class="ttdeci">int32_t traverse(int32_t index) const</div><div class="ttdoc">Utility function to find the i th element of the list.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00168">reverse_a_linked_list.cpp:168</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a9785d1478e59f5a90288b2928a7094d6"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6">data_structures::linked_list::list::top</a></div><div class="ttdeci">int32_t top() const</div><div class="ttdoc">Utility function to find the top element of the list.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00142">reverse_a_linked_list.cpp:142</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_aa69707af46eb6d410eb3a54ee58e1ed1"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">data_structures::linked_list::list::insert</a></div><div class="ttdeci">void insert(int32_t new_elem)</div><div class="ttdoc">Utility function that adds a new element at the end of the list.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00099">reverse_a_linked_list.cpp:99</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_ac466ec086c0835822467bd3d8f3ab90e"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e">data_structures::linked_list::list::reverseList</a></div><div class="ttdeci">void reverseList()</div><div class="ttdoc">Utility function for reversing a list.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00125">reverse_a_linked_list.cpp:125</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_af39bcc08641ce0c813023f364a9a9015"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">data_structures::linked_list::list::last</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; last</div><div class="ttdoc">last link on the list</div><div class="ttdef"><b>Definition</b> <a href="../../da/dc3/linked__list_8cpp_source.html#l00084">linked_list.cpp:84</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a29e92f516e1606aa6743fc992aab35be" name="a29e92f516e1606aa6743fc992aab35be"></a>
@@ -318,6 +328,8 @@ Here is the call graph for this function:</div>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00274">274</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  274</span>                                {</div>
 <div class="line"><span class="lineno">  275</span>    <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a> L;</div>
 <div class="line"><span class="lineno">  276</span>    <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a> otherList;</div>
@@ -357,6 +369,8 @@ Here is the call graph for this function:</div>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00252">252</a> of file <a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp_source.html">reverse_a_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  252</span>                             {</div>
 <div class="line"><span class="lineno">  253</span>    <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a> L;</div>
 <div class="line"><span class="lineno">  254</span>    L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">insert</a>(10);</div>
diff --git a/d6/d05/reverse__a__linked__list_8cpp_a7f80d9712cc7d77399dcacb4c2917511_cgraph.map b/d6/d05/reverse__a__linked__list_8cpp_a7f80d9712cc7d77399dcacb4c2917511_cgraph.map
deleted file mode 100644
index 44e689e9d..000000000
--- a/d6/d05/reverse__a__linked__list_8cpp_a7f80d9712cc7d77399dcacb4c2917511_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="data_structures::linked_list::copy_all_nodes" name="data_structures::linked_list::copy_all_nodes">
-<area shape="rect" id="Node000001" title="creates a deep copy of a list starting at the input node" alt="" coords="5,29,159,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="52,29,51,19,56,11,66,5,82,3,99,5,109,11,106,16,97,10,82,8,68,10,59,14,56,20,57,28"/>
-</map>
diff --git a/d6/d05/reverse__a__linked__list_8cpp_a7f80d9712cc7d77399dcacb4c2917511_cgraph.md5 b/d6/d05/reverse__a__linked__list_8cpp_a7f80d9712cc7d77399dcacb4c2917511_cgraph.md5
deleted file mode 100644
index 74fcac592..000000000
--- a/d6/d05/reverse__a__linked__list_8cpp_a7f80d9712cc7d77399dcacb4c2917511_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-31540bd9d768c115ca99272c317bd227
\ No newline at end of file
diff --git a/d6/d05/reverse__a__linked__list_8cpp_a7f80d9712cc7d77399dcacb4c2917511_cgraph.svg b/d6/d05/reverse__a__linked__list_8cpp_a7f80d9712cc7d77399dcacb4c2917511_cgraph.svg
deleted file mode 100644
index bac738c13..000000000
--- a/d6/d05/reverse__a__linked__list_8cpp_a7f80d9712cc7d77399dcacb4c2917511_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::copy_all_nodes Pages: 1 -->
-<svg width="123pt" height="57pt"
- viewBox="0.00 0.00 123.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>data_structures::linked_list::copy_all_nodes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="creates a deep copy of a list starting at the input node">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::copy_all_nodes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.12,-30.99C32.96,-40.06 39.76,-48.5 57.5,-48.5 67.2,-48.5 73.63,-45.97 76.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.25,-42.78 77.73,-32.49 73.28,-42.11 80.25,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d05/reverse__a__linked__list_8cpp_a7f80d9712cc7d77399dcacb4c2917511_cgraph_org.svg b/d6/d05/reverse__a__linked__list_8cpp_a7f80d9712cc7d77399dcacb4c2917511_cgraph_org.svg
deleted file mode 100644
index 2749d7a16..000000000
--- a/d6/d05/reverse__a__linked__list_8cpp_a7f80d9712cc7d77399dcacb4c2917511_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::copy_all_nodes Pages: 1 -->
-<svg width="123pt" height="57pt"
- viewBox="0.00 0.00 123.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>data_structures::linked_list::copy_all_nodes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="creates a deep copy of a list starting at the input node">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::copy_all_nodes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.12,-30.99C32.96,-40.06 39.76,-48.5 57.5,-48.5 67.2,-48.5 73.63,-45.97 76.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.25,-42.78 77.73,-32.49 73.28,-42.11 80.25,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index c092d04ba..000000000
--- a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,18 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,128,49,154"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="138,5,209,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="32,126,56,85,74,61,95,41,122,27,124,32,98,46,77,65,60,88,37,129"/>
-<area shape="rect" id="Node000003" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1" title="Utility function that adds a new element at the end of the list." alt="" coords="97,55,250,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="48,128,96,106,110,100,112,105,98,111,50,133"/>
-<area shape="rect" id="Node000006" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e" title="Utility function for reversing a list." alt="" coords="97,120,250,161"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="49,138,81,138,81,144,49,144"/>
-<area shape="rect" id="Node000007" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6" title="Utility function to find the top element of the list." alt="" coords="97,186,250,226"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="50,148,98,170,112,177,110,182,96,175,48,153"/>
-<area shape="rect" id="Node000008" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69" title="Utility function to find the i th element of the list." alt="" coords="97,251,250,292"/>
-<area shape="poly" id="edge8_Node000001_Node000008" title=" " alt="" coords="37,153,61,193,78,216,98,236,104,241,101,245,95,240,74,220,56,196,32,156"/>
-<area shape="rect" id="Node000004" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" title=" " alt="" coords="298,148,451,189"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="224,94,251,106,319,139,317,144,249,111,222,99"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/error/exception/what.html#" title=" " alt="" coords="306,63,444,88"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="250,73,290,73,290,78,250,78"/>
-<area shape="poly" id="edge7_Node000007_Node000004" title=" " alt="" coords="250,189,283,183,284,188,251,195"/>
-</map>
diff --git a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 4907df4d2..000000000
--- a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8b09f52951a2cd99de27db96b5f33b8f
\ No newline at end of file
diff --git a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index c20d4c185..000000000
--- a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,187 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="343pt" height="223pt"
- viewBox="0.00 0.00 342.50 222.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 218.88)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-122.88 0,-122.88 0,-103.62 32.5,-103.62 32.5,-122.88"/>
-<text text-anchor="middle" x="16.25" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152.75,-214.88 99.25,-214.88 99.25,-195.62 152.75,-195.62 152.75,-214.88"/>
-<text text-anchor="middle" x="126" y="-201.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.71,-123.28C29.18,-138.95 45.67,-169.2 68.5,-186.25 74.32,-190.6 81.2,-193.99 88.12,-196.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.85,-199.89 97.44,-199.69 89.04,-193.24 86.85,-199.89"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1" target="_top" xlink:title="Utility function that adds a new element at the end of the list.">
-<polygon fill="white" stroke="#666666" points="183.5,-177.5 68.5,-177.5 68.5,-147 183.5,-147 183.5,-177.5"/>
-<text text-anchor="start" x="76.5" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="126" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.91,-120.69C43.04,-125.47 56.52,-131.79 68.5,-137.25 71.97,-138.83 75.57,-140.46 79.2,-142.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.44,-145.13 88,-146.01 80.3,-138.74 77.44,-145.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e" target="_top" xlink:title="Utility function for reversing a list.">
-<polygon fill="white" stroke="#666666" points="183.5,-128.5 68.5,-128.5 68.5,-98 183.5,-98 183.5,-128.5"/>
-<text text-anchor="start" x="76.5" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="126" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::reverseList</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-113.25C39.47,-113.25 47.95,-113.25 57.01,-113.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.75,-116.75 66.75,-113.25 56.75,-109.75 56.75,-116.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6" target="_top" xlink:title="Utility function to find the top element of the list.">
-<polygon fill="white" stroke="#666666" points="183.5,-79.5 68.5,-79.5 68.5,-49 183.5,-49 183.5,-79.5"/>
-<text text-anchor="start" x="76.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="126" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::top</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.91,-105.81C43.04,-101.03 56.52,-94.71 68.5,-89.25 71.97,-87.67 75.57,-86.04 79.2,-84.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.3,-87.76 88,-80.49 77.44,-81.37 80.3,-87.76"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69" target="_top" xlink:title="Utility function to find the i th element of the list.">
-<polygon fill="white" stroke="#666666" points="183.5,-30.5 68.5,-30.5 68.5,0 183.5,0 183.5,-30.5"/>
-<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="126" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::traverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge8_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.03,-103.22C29.82,-87.81 46.6,-58.24 68.5,-40.25 69.95,-39.06 71.47,-37.91 73.04,-36.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.51,-40.02 81.18,-31.78 70.83,-34.06 74.51,-40.02"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="334.5,-107.5 219.5,-107.5 219.5,-77 334.5,-77 334.5,-107.5"/>
-<text text-anchor="start" x="227.5" y="-94" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="277" y="-82.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.95,-146.57C169.8,-143.53 176.88,-140.32 183.5,-137.25 200.24,-129.48 218.54,-120.64 234.42,-112.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="235.66,-116.16 243.1,-108.61 232.58,-109.88 235.66,-116.16"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="328.88,-171.88 225.12,-171.88 225.12,-152.62 328.88,-152.62 328.88,-171.88"/>
-<text text-anchor="middle" x="277" y="-158.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::bad_alloc::what</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.76,-162.25C193.45,-162.25 203.57,-162.25 213.41,-162.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.26,-165.75 223.26,-162.25 213.26,-158.75 213.26,-165.75"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge7_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge7_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.76,-74.92C191.78,-76.42 200.11,-77.99 208.31,-79.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="207.44,-82.93 217.91,-81.33 208.73,-76.05 207.44,-82.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index cc8d46a09..000000000
--- a/d6/d05/reverse__a__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,161 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="343pt" height="223pt"
- viewBox="0.00 0.00 342.50 222.88" 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 218.88)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-122.88 0,-122.88 0,-103.62 32.5,-103.62 32.5,-122.88"/>
-<text text-anchor="middle" x="16.25" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152.75,-214.88 99.25,-214.88 99.25,-195.62 152.75,-195.62 152.75,-214.88"/>
-<text text-anchor="middle" x="126" y="-201.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.71,-123.28C29.18,-138.95 45.67,-169.2 68.5,-186.25 74.32,-190.6 81.2,-193.99 88.12,-196.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.85,-199.89 97.44,-199.69 89.04,-193.24 86.85,-199.89"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1" target="_top" xlink:title="Utility function that adds a new element at the end of the list.">
-<polygon fill="white" stroke="#666666" points="183.5,-177.5 68.5,-177.5 68.5,-147 183.5,-147 183.5,-177.5"/>
-<text text-anchor="start" x="76.5" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="126" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.91,-120.69C43.04,-125.47 56.52,-131.79 68.5,-137.25 71.97,-138.83 75.57,-140.46 79.2,-142.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.44,-145.13 88,-146.01 80.3,-138.74 77.44,-145.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e" target="_top" xlink:title="Utility function for reversing a list.">
-<polygon fill="white" stroke="#666666" points="183.5,-128.5 68.5,-128.5 68.5,-98 183.5,-98 183.5,-128.5"/>
-<text text-anchor="start" x="76.5" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="126" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::reverseList</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-113.25C39.47,-113.25 47.95,-113.25 57.01,-113.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.75,-116.75 66.75,-113.25 56.75,-109.75 56.75,-116.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6" target="_top" xlink:title="Utility function to find the top element of the list.">
-<polygon fill="white" stroke="#666666" points="183.5,-79.5 68.5,-79.5 68.5,-49 183.5,-49 183.5,-79.5"/>
-<text text-anchor="start" x="76.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="126" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::top</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.91,-105.81C43.04,-101.03 56.52,-94.71 68.5,-89.25 71.97,-87.67 75.57,-86.04 79.2,-84.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.3,-87.76 88,-80.49 77.44,-81.37 80.3,-87.76"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69" target="_top" xlink:title="Utility function to find the i th element of the list.">
-<polygon fill="white" stroke="#666666" points="183.5,-30.5 68.5,-30.5 68.5,0 183.5,0 183.5,-30.5"/>
-<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="126" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::traverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge8_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.03,-103.22C29.82,-87.81 46.6,-58.24 68.5,-40.25 69.95,-39.06 71.47,-37.91 73.04,-36.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.51,-40.02 81.18,-31.78 70.83,-34.06 74.51,-40.02"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="334.5,-107.5 219.5,-107.5 219.5,-77 334.5,-77 334.5,-107.5"/>
-<text text-anchor="start" x="227.5" y="-94" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="277" y="-82.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.95,-146.57C169.8,-143.53 176.88,-140.32 183.5,-137.25 200.24,-129.48 218.54,-120.64 234.42,-112.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="235.66,-116.16 243.1,-108.61 232.58,-109.88 235.66,-116.16"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="328.88,-171.88 225.12,-171.88 225.12,-152.62 328.88,-152.62 328.88,-171.88"/>
-<text text-anchor="middle" x="277" y="-158.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::bad_alloc::what</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.76,-162.25C193.45,-162.25 203.57,-162.25 213.41,-162.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.26,-165.75 223.26,-162.25 213.26,-158.75 213.26,-165.75"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge7_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge7_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.76,-74.92C191.78,-76.42 200.11,-77.99 208.31,-79.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="207.44,-82.93 217.91,-81.33 208.73,-76.05 207.44,-82.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 8a1cbb1b5..000000000
--- a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,20 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,128,55,154"/>
-<area shape="rect" id="Node000002" href="$d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,128,146,154"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,138,87,138,87,144,55,144"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="235,5,306,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="129,126,153,85,171,61,192,41,219,27,221,32,196,46,175,65,157,88,134,129"/>
-<area shape="rect" id="Node000004" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1" title="Utility function that adds a new element at the end of the list." alt="" coords="194,55,347,96"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="145,128,193,106,207,100,209,105,195,111,148,133"/>
-<area shape="rect" id="Node000007" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e" title="Utility function for reversing a list." alt="" coords="194,120,347,161"/>
-<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="146,138,179,138,179,144,146,144"/>
-<area shape="rect" id="Node000008" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6" title="Utility function to find the top element of the list." alt="" coords="194,186,347,226"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="148,148,195,170,209,177,207,182,193,175,145,153"/>
-<area shape="rect" id="Node000009" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69" title="Utility function to find the i th element of the list." alt="" coords="194,251,347,292"/>
-<area shape="poly" id="edge9_Node000002_Node000009" title=" " alt="" coords="134,153,158,193,175,216,196,236,202,241,198,245,192,240,171,220,154,196,130,156"/>
-<area shape="rect" id="Node000005" href="$d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" title=" " alt="" coords="395,148,549,189"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="321,94,348,106,416,139,414,144,346,111,319,99"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/error/exception/what.html#" title=" " alt="" coords="403,63,541,88"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="348,73,387,73,387,78,348,78"/>
-<area shape="poly" id="edge8_Node000008_Node000005" title=" " alt="" coords="347,189,380,183,381,188,348,195"/>
-</map>
diff --git a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 854e1bfcf..000000000
--- a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9878e208d86d7c923f061ecf3cb81ba8
\ No newline at end of file
diff --git a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 5bc086abf..000000000
--- a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,205 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="416pt" height="223pt"
- viewBox="0.00 0.00 415.50 222.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 218.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-122.88 0,-122.88 0,-103.62 37,-103.62 37,-122.88"/>
-<text text-anchor="middle" x="18.5" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-122.88 73,-122.88 73,-103.62 105.5,-103.62 105.5,-122.88"/>
-<text text-anchor="middle" x="89.25" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-113.25C44.58,-113.25 53.31,-113.25 61.45,-113.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-116.75 71.2,-113.25 61.2,-109.75 61.2,-116.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="225.75,-214.88 172.25,-214.88 172.25,-195.62 225.75,-195.62 225.75,-214.88"/>
-<text text-anchor="middle" x="199" y="-201.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.71,-123.28C102.18,-138.95 118.67,-169.2 141.5,-186.25 147.32,-190.6 154.2,-193.99 161.12,-196.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.85,-199.89 170.44,-199.69 162.04,-193.24 159.85,-199.89"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1" target="_top" xlink:title="Utility function that adds a new element at the end of the list.">
-<polygon fill="white" stroke="#666666" points="256.5,-177.5 141.5,-177.5 141.5,-147 256.5,-147 256.5,-177.5"/>
-<text text-anchor="start" x="149.5" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="199" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.91,-120.69C116.04,-125.47 129.52,-131.79 141.5,-137.25 144.97,-138.83 148.57,-140.46 152.2,-142.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.44,-145.13 161,-146.01 153.3,-138.74 150.44,-145.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e" target="_top" xlink:title="Utility function for reversing a list.">
-<polygon fill="white" stroke="#666666" points="256.5,-128.5 141.5,-128.5 141.5,-98 256.5,-98 256.5,-128.5"/>
-<text text-anchor="start" x="149.5" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="199" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::reverseList</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-113.25C112.47,-113.25 120.95,-113.25 130.01,-113.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.75,-116.75 139.75,-113.25 129.75,-109.75 129.75,-116.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6" target="_top" xlink:title="Utility function to find the top element of the list.">
-<polygon fill="white" stroke="#666666" points="256.5,-79.5 141.5,-79.5 141.5,-49 256.5,-49 256.5,-79.5"/>
-<text text-anchor="start" x="149.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="199" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::top</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.91,-105.81C116.04,-101.03 129.52,-94.71 141.5,-89.25 144.97,-87.67 148.57,-86.04 152.2,-84.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.3,-87.76 161,-80.49 150.44,-81.37 153.3,-87.76"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69" target="_top" xlink:title="Utility function to find the i th element of the list.">
-<polygon fill="white" stroke="#666666" points="256.5,-30.5 141.5,-30.5 141.5,0 256.5,0 256.5,-30.5"/>
-<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="199" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::traverse</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge9_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge9_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.03,-103.22C102.82,-87.81 119.6,-58.24 141.5,-40.25 142.95,-39.06 144.47,-37.91 146.04,-36.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.51,-40.02 154.18,-31.78 143.83,-34.06 147.51,-40.02"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="407.5,-107.5 292.5,-107.5 292.5,-77 407.5,-77 407.5,-107.5"/>
-<text text-anchor="start" x="300.5" y="-94" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="350" y="-82.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.95,-146.57C242.8,-143.53 249.88,-140.32 256.5,-137.25 273.24,-129.48 291.54,-120.64 307.42,-112.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="308.66,-116.16 316.1,-108.61 305.58,-109.88 308.66,-116.16"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="401.88,-171.88 298.12,-171.88 298.12,-152.62 401.88,-152.62 401.88,-171.88"/>
-<text text-anchor="middle" x="350" y="-158.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::bad_alloc::what</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.76,-162.25C266.45,-162.25 276.57,-162.25 286.41,-162.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.26,-165.75 296.26,-162.25 286.26,-158.75 286.26,-165.75"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge8_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge8_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.76,-74.92C264.78,-76.42 273.11,-77.99 281.31,-79.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="280.44,-82.93 290.91,-81.33 281.73,-76.05 280.44,-82.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 2cce4ec06..000000000
--- a/d6/d05/reverse__a__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,179 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="416pt" height="223pt"
- viewBox="0.00 0.00 415.50 222.88" 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 218.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-122.88 0,-122.88 0,-103.62 37,-103.62 37,-122.88"/>
-<text text-anchor="middle" x="18.5" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-122.88 73,-122.88 73,-103.62 105.5,-103.62 105.5,-122.88"/>
-<text text-anchor="middle" x="89.25" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-113.25C44.58,-113.25 53.31,-113.25 61.45,-113.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-116.75 71.2,-113.25 61.2,-109.75 61.2,-116.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="225.75,-214.88 172.25,-214.88 172.25,-195.62 225.75,-195.62 225.75,-214.88"/>
-<text text-anchor="middle" x="199" y="-201.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.71,-123.28C102.18,-138.95 118.67,-169.2 141.5,-186.25 147.32,-190.6 154.2,-193.99 161.12,-196.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.85,-199.89 170.44,-199.69 162.04,-193.24 159.85,-199.89"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1" target="_top" xlink:title="Utility function that adds a new element at the end of the list.">
-<polygon fill="white" stroke="#666666" points="256.5,-177.5 141.5,-177.5 141.5,-147 256.5,-147 256.5,-177.5"/>
-<text text-anchor="start" x="149.5" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="199" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.91,-120.69C116.04,-125.47 129.52,-131.79 141.5,-137.25 144.97,-138.83 148.57,-140.46 152.2,-142.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.44,-145.13 161,-146.01 153.3,-138.74 150.44,-145.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e" target="_top" xlink:title="Utility function for reversing a list.">
-<polygon fill="white" stroke="#666666" points="256.5,-128.5 141.5,-128.5 141.5,-98 256.5,-98 256.5,-128.5"/>
-<text text-anchor="start" x="149.5" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="199" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::reverseList</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-113.25C112.47,-113.25 120.95,-113.25 130.01,-113.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.75,-116.75 139.75,-113.25 129.75,-109.75 129.75,-116.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6" target="_top" xlink:title="Utility function to find the top element of the list.">
-<polygon fill="white" stroke="#666666" points="256.5,-79.5 141.5,-79.5 141.5,-49 256.5,-49 256.5,-79.5"/>
-<text text-anchor="start" x="149.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="199" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::top</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.91,-105.81C116.04,-101.03 129.52,-94.71 141.5,-89.25 144.97,-87.67 148.57,-86.04 152.2,-84.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.3,-87.76 161,-80.49 150.44,-81.37 153.3,-87.76"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69" target="_top" xlink:title="Utility function to find the i th element of the list.">
-<polygon fill="white" stroke="#666666" points="256.5,-30.5 141.5,-30.5 141.5,0 256.5,0 256.5,-30.5"/>
-<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="199" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::traverse</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge9_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge9_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.03,-103.22C102.82,-87.81 119.6,-58.24 141.5,-40.25 142.95,-39.06 144.47,-37.91 146.04,-36.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.51,-40.02 154.18,-31.78 143.83,-34.06 147.51,-40.02"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="407.5,-107.5 292.5,-107.5 292.5,-77 407.5,-77 407.5,-107.5"/>
-<text text-anchor="start" x="300.5" y="-94" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="350" y="-82.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::list::isEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.95,-146.57C242.8,-143.53 249.88,-140.32 256.5,-137.25 273.24,-129.48 291.54,-120.64 307.42,-112.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="308.66,-116.16 316.1,-108.61 305.58,-109.88 308.66,-116.16"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="401.88,-171.88 298.12,-171.88 298.12,-152.62 401.88,-152.62 401.88,-171.88"/>
-<text text-anchor="middle" x="350" y="-158.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::bad_alloc::what</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.76,-162.25C266.45,-162.25 276.57,-162.25 286.41,-162.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.26,-165.75 296.26,-162.25 286.26,-158.75 286.26,-165.75"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge8_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge8_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.76,-74.92C264.78,-76.42 273.11,-77.99 281.31,-79.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="280.44,-82.93 290.91,-81.33 281.73,-76.05 280.44,-82.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d05/reverse__a__linked__list_8cpp_source.html b/d6/d05/reverse__a__linked__list_8cpp_source.html
new file mode 100644
index 000000000..e1013c816
--- /dev/null
+++ b/d6/d05/reverse__a__linked__list_8cpp_source.html
@@ -0,0 +1,400 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/reverse_a_linked_list.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/d05/reverse__a__linked__list_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">reverse_a_linked_list.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/d05/reverse__a__linked__list_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;new&gt;</span>       </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d3c/namespacedata__structures.html">data_structures</a> {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d3/db0/namespacelinked__list.html">linked_list</a> {</div>
+<div class="foldopen" id="foldopen00042" data-start="{" data-end="};">
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">   42</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a> {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    int32_t val;  </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">   45</a></span>    <a class="code hl_class" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a>* <a class="code hl_variable" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">next</a>;   </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>};</div>
+</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="foldopen" id="foldopen00053" data-start="{" data-end="}">
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511">   53</a></span><a class="code hl_class" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a>* <a class="code hl_function" href="../../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511">copy_all_nodes</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a>* <span class="keyword">const</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="comment">// NOLINTNEXTLINE(cppcoreguidelines-owning-memory)</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        <a class="code hl_class" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a>* res = <span class="keyword">new</span> <a class="code hl_class" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a>();</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        res-&gt;val = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;val;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        res-&gt;<a class="code hl_variable" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">next</a> = <a class="code hl_function" href="../../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511">copy_all_nodes</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next);</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <span class="keywordflow">return</span> res;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    }</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>}</div>
+</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="comment">// NOLINTNEXTLINE(cppcoreguidelines-special-member-functions)</span></div>
+<div class="foldopen" id="foldopen00068" data-start="{" data-end="};">
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"><a class="line" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">   68</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <a class="code hl_class" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a>* head = <span class="keyword">nullptr</span>;  <span class="comment">// link before the actual first element</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac614ed8f1953f5486fab1cd6d7aa0500">delete_all_nodes</a>();</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keywordtype">void</span> copy_all_nodes_from_list(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a>&amp; other);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>() <span class="keyword">const</span>;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">insert</a>(int32_t new_elem);</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e">reverseList</a>();</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a1313837c0e9ec67fd9fbd17987e2d615">display</a>() <span class="keyword">const</span>;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    int32_t <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6">top</a>() <span class="keyword">const</span>;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    int32_t <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a>() <span class="keyword">const</span>;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    int32_t <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">traverse</a>(int32_t index) <span class="keyword">const</span>;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">~list</a>();</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826">list</a>() = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826">list</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a>&amp; other);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a>&amp; <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#adb04f732911fcfd30f7177b367c6af41">operator=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a>&amp; other);</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>};</div>
+</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"><a class="line" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a73c52b2243a6c9501af65756123e7149">   93</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897">list::isEmpty</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> head == <span class="keyword">nullptr</span>; }</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="foldopen" id="foldopen00099" data-start="{" data-end="}">
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"><a class="line" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">   99</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">list::insert</a>(int32_t n) {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="keywordflow">try</span> {</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        <span class="comment">// NOLINTNEXTLINE(cppcoreguidelines-owning-memory)</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        <a class="code hl_class" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a>* new_node = <span class="keyword">new</span> <a class="code hl_class" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a>();</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        <a class="code hl_class" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a>* temp = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        new_node-&gt;val = n;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        new_node-&gt;<a class="code hl_variable" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">next</a> = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>            head = new_node;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            temp = head;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>            <span class="keywordflow">while</span> (temp-&gt;<a class="code hl_variable" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">next</a> != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>                temp = temp-&gt;<a class="code hl_variable" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">next</a>;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>            }</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>            temp-&gt;<a class="code hl_variable" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">next</a> = new_node;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        }</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    } <span class="keywordflow">catch</span> (std::bad_alloc&amp; exception) {</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;bad_alloc detected: &quot;</span> &lt;&lt; exception.what() &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    }</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>}</div>
+</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
+<div class="foldopen" id="foldopen00125" data-start="{" data-end="}">
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"><a class="line" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e">  125</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e">list::reverseList</a>() {</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <a class="code hl_class" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a>* curr = head;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    <a class="code hl_class" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a>* prev = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    <a class="code hl_class" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a>* next_node = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    <span class="keywordflow">while</span> (curr != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        next_node = curr-&gt;<a class="code hl_variable" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">next</a>;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        curr-&gt;<a class="code hl_variable" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">next</a> = prev;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        prev = curr;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        curr = next_node;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    }</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    head = prev;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>}</div>
+</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span> </div>
+<div class="foldopen" id="foldopen00142" data-start="{" data-end="}">
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"><a class="line" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6">  142</a></span>int32_t <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6">list::top</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        <span class="keywordflow">return</span> head-&gt;val;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;List is empty&quot;</span>);</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    }</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>}</div>
+</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>int32_t <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">list::last</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>        <a class="code hl_class" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a>* t = head;</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>        <span class="keywordflow">while</span> (t-&gt;<a class="code hl_variable" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">next</a> != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>            t = t-&gt;<a class="code hl_variable" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">next</a>;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>        }</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        <span class="keywordflow">return</span> t-&gt;val;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        <span class="keywordflow">throw</span> std::logic_error(<span class="stringliteral">&quot;List is empty&quot;</span>);</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    }</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>}</div>
+<div class="foldopen" id="foldopen00168" data-start="{" data-end="}">
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"><a class="line" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">  168</a></span>int32_t <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">list::traverse</a>(int32_t index)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    <a class="code hl_class" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a>* current = head;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span> </div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    <span class="keywordtype">int</span> count = 0;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <span class="keywordflow">while</span> (current != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>        <span class="keywordflow">if</span> (count == index) {</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>            <span class="keywordflow">return</span> (current-&gt;val);</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        }</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        count++;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        current = current-&gt;<a class="code hl_variable" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">next</a>;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    }</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span> </div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    <span class="comment">/* if we get to this line,the caller was asking for a non-existent element</span></div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span><span class="comment">    so we assert fail */</span></div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    exit(1);</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>}</div>
+</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span> </div>
+<div class="foldopen" id="foldopen00188" data-start="{" data-end="}">
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"><a class="line" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac614ed8f1953f5486fab1cd6d7aa0500">  188</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac614ed8f1953f5486fab1cd6d7aa0500">list::delete_all_nodes</a>() {</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    <span class="keywordflow">while</span> (head != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>        <span class="keyword">const</span> <span class="keyword">auto</span> tmp_node = head-&gt;<a class="code hl_variable" href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">next</a>;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>        <span class="keyword">delete</span> head;</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>        head = tmp_node;</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    }</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>}</div>
+</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span> </div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>list::~list() { <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac614ed8f1953f5486fab1cd6d7aa0500">delete_all_nodes</a>(); }</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span> </div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span><span class="keywordtype">void</span> list::copy_all_nodes_from_list(<span class="keyword">const</span> <a class="code hl_struct" href="../../d8/d10/structlist.html">list</a>&amp; other) {</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    assert(<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>());</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    head = copy_all_nodes(other.head);</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>}</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span> </div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"><a class="line" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a326ac4f721f7b74d5ed4f418a67b8d38">  206</a></span><a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826">list::list</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a>&amp; other) { copy_all_nodes_from_list(other); }</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span> </div>
+<div class="foldopen" id="foldopen00211" data-start="{" data-end="}">
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"><a class="line" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#adb04f732911fcfd30f7177b367c6af41">  211</a></span><a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a>&amp; <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#adb04f732911fcfd30f7177b367c6af41">list::operator=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a>&amp; other) {</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    <span class="keywordflow">if</span> (<span class="keyword">this</span> == &amp;other) {</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    }</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac614ed8f1953f5486fab1cd6d7aa0500">delete_all_nodes</a>();</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span> </div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    copy_all_nodes_from_list(other);</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>}</div>
+</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span> </div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>}  <span class="comment">// namespace linked_list</span></div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>}  <span class="comment">// namespace data_structures</span></div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span> </div>
+<div class="foldopen" id="foldopen00228" data-start="{" data-end="}">
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"><a class="line" href="../../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  228</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a> L;</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    <span class="comment">// 1st test</span></div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">insert</a>(11);</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">insert</a>(12);</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">insert</a>(15);</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">insert</a>(10);</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">insert</a>(-12);</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">insert</a>(-20);</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">insert</a>(18);</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6">top</a>() == 11);</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    assert(L.<a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a>() == 18);</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e">reverseList</a>();</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    <span class="comment">// Reversal Testing</span></div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6">top</a>() == 18);</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">traverse</a>(1) == -20);</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">traverse</a>(2) == -12);</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">traverse</a>(3) == 10);</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">traverse</a>(4) == 15);</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">traverse</a>(5) == 12);</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>    assert(L.<a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a>() == 11);</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>}</div>
+</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span> </div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span><span class="keywordtype">void</span> test_copy_constructor() {</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a> L;</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>    L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">insert</a>(10);</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>    L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">insert</a>(20);</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">insert</a>(30);</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a> otherList(L);</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    otherList.insert(40);</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span> </div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>    L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">insert</a>(400);</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span> </div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6">top</a>() == 10);</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>    assert(otherList.top() == 10);</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>    assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">traverse</a>(1) == 20);</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>    assert(otherList.traverse(1) == 20);</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span> </div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>    assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">traverse</a>(2) == 30);</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>    assert(otherList.traverse(2) == 30);</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span> </div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    assert(L.<a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a>() == 400);</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    assert(otherList.last() == 40);</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>}</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span> </div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span><span class="keywordtype">void</span> test_assignment_operator() {</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a> L;</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>    <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a> otherList;</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>    L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">insert</a>(10);</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>    L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">insert</a>(20);</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>    L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">insert</a>(30);</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>    otherList = L;</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span> </div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>    otherList.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">insert</a>(40);</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">insert</a>(400);</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span> </div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>    assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6">top</a>() == 10);</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>    assert(otherList.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6">top</a>() == 10);</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>    assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">traverse</a>(1) == 20);</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>    assert(otherList.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">traverse</a>(1) == 20);</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span> </div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>    assert(L.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">traverse</a>(2) == 30);</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>    assert(otherList.<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">traverse</a>(2) == 30);</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span> </div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>    assert(L.<a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a>() == 400);</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>    assert(otherList.<a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a>() == 40);</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>}</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span> </div>
+<div class="foldopen" id="foldopen00301" data-start="{" data-end="}">
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"><a class="line" href="../../d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  301</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>    <a class="code hl_function" href="../../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>    test_copy_constructor();</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>    test_assignment_operator();</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>}</div>
+</div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1_node_html"><div class="ttname"><a href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">data_structures::linked_list::Node</a></div><div class="ttdef"><b>Definition</b> <a href="#l00042">reverse_a_linked_list.cpp:42</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1_node_html_acfccd7b52c91d91300c5b317e5ec7a6e"><div class="ttname"><a href="../../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e">data_structures::linked_list::Node::next</a></div><div class="ttdeci">Node * next</div><div class="ttdoc">value of the current link</div><div class="ttdef"><b>Definition</b> <a href="#l00045">reverse_a_linked_list.cpp:45</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a></div><div class="ttdef"><b>Definition</b> <a href="#l00068">reverse_a_linked_list.cpp:68</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a1313837c0e9ec67fd9fbd17987e2d615"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a1313837c0e9ec67fd9fbd17987e2d615">data_structures::linked_list::list::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition</b> <a href="../../da/dc3/linked__list_8cpp_source.html#l00181">linked_list.cpp:181</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a2b951a3f1123b9b2f4891ec96aa76d69"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">data_structures::linked_list::list::traverse</a></div><div class="ttdeci">int32_t traverse(int32_t index) const</div><div class="ttdoc">Utility function to find the i th element of the list.</div><div class="ttdef"><b>Definition</b> <a href="#l00168">reverse_a_linked_list.cpp:168</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a454ab4918f579869dfed4bb420a3f897"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897">data_structures::linked_list::list::isEmpty</a></div><div class="ttdeci">bool isEmpty()</div><div class="ttdef"><b>Definition</b> <a href="../../da/dc3/linked__list_8cpp_source.html#l00111">linked_list.cpp:111</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a50e209b55b83622254177050945e7826"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826">data_structures::linked_list::list::list</a></div><div class="ttdeci">list()</div><div class="ttdef"><b>Definition</b> <a href="../../da/dc3/linked__list_8cpp_source.html#l00089">linked_list.cpp:89</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a9785d1478e59f5a90288b2928a7094d6"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6">data_structures::linked_list::list::top</a></div><div class="ttdeci">int32_t top() const</div><div class="ttdoc">Utility function to find the top element of the list.</div><div class="ttdef"><b>Definition</b> <a href="#l00142">reverse_a_linked_list.cpp:142</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_aa69707af46eb6d410eb3a54ee58e1ed1"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1">data_structures::linked_list::list::insert</a></div><div class="ttdeci">void insert(int32_t new_elem)</div><div class="ttdoc">Utility function that adds a new element at the end of the list.</div><div class="ttdef"><b>Definition</b> <a href="#l00099">reverse_a_linked_list.cpp:99</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_ac466ec086c0835822467bd3d8f3ab90e"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e">data_structures::linked_list::list::reverseList</a></div><div class="ttdeci">void reverseList()</div><div class="ttdoc">Utility function for reversing a list.</div><div class="ttdef"><b>Definition</b> <a href="#l00125">reverse_a_linked_list.cpp:125</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_ac614ed8f1953f5486fab1cd6d7aa0500"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac614ed8f1953f5486fab1cd6d7aa0500">data_structures::linked_list::list::delete_all_nodes</a></div><div class="ttdeci">void delete_all_nodes()</div><div class="ttdoc">calls delete operator on every node in the represented list</div><div class="ttdef"><b>Definition</b> <a href="#l00188">reverse_a_linked_list.cpp:188</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_adb04f732911fcfd30f7177b367c6af41"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#adb04f732911fcfd30f7177b367c6af41">data_structures::linked_list::list::operator=</a></div><div class="ttdeci">list &amp; operator=(const list &amp;other)</div><div class="ttdoc">assignment operator creating a deep copy of every node of the input</div><div class="ttdef"><b>Definition</b> <a href="#l00211">reverse_a_linked_list.cpp:211</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_af39bcc08641ce0c813023f364a9a9015"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">data_structures::linked_list::list::last</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; last</div><div class="ttdoc">last link on the list</div><div class="ttdef"><b>Definition</b> <a href="../../da/dc3/linked__list_8cpp_source.html#l00084">linked_list.cpp:84</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html">data_structures</a></div><div class="ttdoc">for IO operations</div></div>
+<div class="ttc" id="anamespacelinked__list_html"><div class="ttname"><a href="../../d3/db0/namespacelinked__list.html">linked_list</a></div><div class="ttdoc">Functions for singly linked list algorithm.</div></div>
+<div class="ttc" id="areverse__a__linked__list_8cpp_html_a7f80d9712cc7d77399dcacb4c2917511"><div class="ttname"><a href="../../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511">data_structures::linked_list::copy_all_nodes</a></div><div class="ttdeci">Node * copy_all_nodes(const Node *const node)</div><div class="ttdoc">creates a deep copy of a list starting at the input node</div><div class="ttdef"><b>Definition</b> <a href="#l00053">reverse_a_linked_list.cpp:53</a></div></div>
+<div class="ttc" id="areverse__a__linked__list_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d6/d05/reverse__a__linked__list_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> <a href="#l00228">reverse_a_linked_list.cpp:228</a></div></div>
+<div class="ttc" id="areverse__a__linked__list_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00301">reverse_a_linked_list.cpp:301</a></div></div>
+<div class="ttc" id="astructlist_html"><div class="ttname"><a href="../../d8/d10/structlist.html">list</a></div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00029">hash_search.cpp:29</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d6/d05/reverse__a__linked__list_8cpp.html">reverse_a_linked_list.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/d0c/namespacehashing.html b/d6/d0c/namespacehashing.html
index 51d8b76f0..1d1e14b1c 100644
--- a/d6/d0c/namespacehashing.html
+++ b/d6/d0c/namespacehashing.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: hashing Namespace Reference</title>
+<title>TheAlgorithms/C++: hashing Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -112,13 +129,13 @@ $(function(){initNavTree('d6/d0c/namespacehashing.html','../../'); initResizable
 <a href="#details">More...</a></p>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Used for assert. </p>
-<p>For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>.</p>
+<p>For std::vector.</p>
 <p>For assert.</p>
-<p>Used for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/copy.html">std::copy</a> Used for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> Used for std::memcopy Used for IO operations Used for strings Used for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>Used for std::copy Used for std::array Used for std::memcopy Used for IO operations Used for strings Used for std::vector</p>
 <p>Hashing algorithms</p>
-<p>For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/copy.html">std::copy</a> For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> For std::memcopy For IO operations For strings For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>For std::copy For std::array For std::memcopy For IO operations For strings For std::vector</p>
 <p>Hashing algorithms</p>
-<p>For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> For assert For uint8_t, uint32_t and uint64_t data types For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">std::setfill</a> and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a> For IO operations For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">std::stringstream</a> For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></p>
+<p>For std::array For assert For uint8_t, uint32_t and uint64_t data types For std::setfill and std::setw For IO operations For std::stringstream For std::move</p>
 <p>Hashing algorithms </p>
 </div></div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d6/d10/cut__rod_8cpp.html b/d6/d10/cut__rod_8cpp.html
index f24a72273..d4d228230 100644
--- a/d6/d10/cut__rod_8cpp.html
+++ b/d6/d10/cut__rod_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/cut_rod.cpp File Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming/cut_rod.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for cut_rod.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/da4/cut__rod_8cpp__incl.svg" width="412" height="126"><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">
+</div>
+<p><a href="../../d6/d10/cut__rod_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
@@ -136,7 +155,7 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a1cc523a30c18c63eac58220c3c494cfa" id="r_a1cc523a30c18c63eac58220c3c494cfa"><td class="memTemplParams" colspan="2">template&lt;size_t T&gt; </td></tr>
-<tr class="memitem:a1cc523a30c18c63eac58220c3c494cfa"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a1cc523a30c18c63eac58220c3c494cfa">dynamic_programming::cut_rod::maxProfitByCuttingRod</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, T &gt; &amp;price, const uint64_t &amp;n)</td></tr>
+<tr class="memitem:a1cc523a30c18c63eac58220c3c494cfa"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a1cc523a30c18c63eac58220c3c494cfa">dynamic_programming::cut_rod::maxProfitByCuttingRod</a> (const std::array&lt; int, T &gt; &amp;price, const uint64_t &amp;n)</td></tr>
 <tr class="memdesc:a1cc523a30c18c63eac58220c3c494cfa"><td class="mdescLeft">&#160;</td><td class="mdescRight">Cuts the rod in different pieces and stores the maximum profit for each piece of the rod.  <br /></td></tr>
 <tr class="separator:a1cc523a30c18c63eac58220c3c494cfa"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -155,6 +174,8 @@ Algorithm</h3>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Anmol3299" target="_blank">Anmol</a> </dd>
 <dd>
 <a href="https://github.com/Pardeep009" target="_blank">Pardeep</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/d10/cut__rod_8cpp_source.html">cut_rod.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -173,18 +194,15 @@ Algorithm</h3>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d10/cut__rod_8cpp_source.html#l00111">111</a> of file <a class="el" href="../../d6/d10/cut__rod_8cpp_source.html">cut_rod.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  111</span>           {</div>
 <div class="line"><span class="lineno">  112</span>    <span class="comment">// Testing</span></div>
 <div class="line"><span class="lineno">  113</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
 <div class="line"><span class="lineno">  114</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  115</span>}</div>
-<div class="ttc" id="acut__rod_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test above algorithm.</div><div class="ttdef"><b>Definition</b> cut_rod.cpp:72</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d10/cut__rod_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acut__rod_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test above algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d10/cut__rod_8cpp_source.html#l00072">cut_rod.cpp:72</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1cc523a30c18c63eac58220c3c494cfa" name="a1cc523a30c18c63eac58220c3c494cfa"></a>
@@ -198,7 +216,7 @@ template&lt;size_t T&gt; </div>
         <tr>
           <td class="memname">int dynamic_programming::cut_rod::maxProfitByCuttingRod </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>price</em></span>, </td>
+          <td class="paramtype">const std::array&lt; int, T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>price</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -229,6 +247,8 @@ template&lt;size_t T&gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d10/cut__rod_8cpp_source.html#l00045">45</a> of file <a class="el" href="../../d6/d10/cut__rod_8cpp_source.html">cut_rod.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   45</span>                                                                            {</div>
 <div class="line"><span class="lineno">   46</span>    <span class="keywordtype">int</span> *profit =</div>
 <div class="line"><span class="lineno">   47</span>        <span class="keyword">new</span> <span class="keywordtype">int</span>[n + 1];  <span class="comment">// profit[i] will hold maximum profit for i inch rod</span></div>
@@ -241,7 +261,7 @@ template&lt;size_t T&gt; </div>
 <div class="line"><span class="lineno">   54</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 1; i &lt;= n; i++) {</div>
 <div class="line"><span class="lineno">   55</span>        <span class="keywordtype">int</span> q = INT_MIN;</div>
 <div class="line"><span class="lineno">   56</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 1; j &lt;= i; j++) {</div>
-<div class="line"><span class="lineno">   57</span>            q = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(q, price[j - 1] + profit[i - j]);</div>
+<div class="line"><span class="lineno">   57</span>            q = std::max(q, price[j - 1] + profit[i - j]);</div>
 <div class="line"><span class="lineno">   58</span>        }</div>
 <div class="line"><span class="lineno">   59</span>        profit[i] = q;</div>
 <div class="line"><span class="lineno">   60</span>    }</div>
@@ -249,13 +269,7 @@ template&lt;size_t T&gt; </div>
 <div class="line"><span class="lineno">   62</span>    <span class="keyword">delete</span>[] profit;</div>
 <div class="line"><span class="lineno">   63</span>    <span class="keywordflow">return</span> ans;  <span class="comment">// returning maximum profit</span></div>
 <div class="line"><span class="lineno">   64</span>}</div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-</div><!-- 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="../../d6/d10/cut__rod_8cpp_a1cc523a30c18c63eac58220c3c494cfa_cgraph.svg" width="350" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -283,20 +297,22 @@ Here is the call graph for this function:</div>
 
 <p>Function to test above algorithm. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d10/cut__rod_8cpp_source.html#l00072">72</a> of file <a class="el" href="../../d6/d10/cut__rod_8cpp_source.html">cut_rod.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   72</span>                   {</div>
 <div class="line"><span class="lineno">   73</span>    <span class="comment">// Test 1</span></div>
 <div class="line"><span class="lineno">   74</span>    <span class="keyword">const</span> int16_t n1 = 8;                                         <span class="comment">// size of rod</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/array.html">std::array&lt;int32_t, n1&gt;</a> price1 = {1, 2, 4, 6, 8, 45, 21, 9};  <span class="comment">// price array</span></div>
+<div class="line"><span class="lineno">   75</span>    std::array&lt;int32_t, n1&gt; price1 = {1, 2, 4, 6, 8, 45, 21, 9};  <span class="comment">// price array</span></div>
 <div class="line"><span class="lineno">   76</span>    <span class="keyword">const</span> int64_t max_profit1 =</div>
 <div class="line"><span class="lineno">   77</span>        <a class="code hl_function" href="#a1cc523a30c18c63eac58220c3c494cfa">dynamic_programming::cut_rod::maxProfitByCuttingRod</a>(price1, n1);</div>
 <div class="line"><span class="lineno">   78</span>    <span class="keyword">const</span> int64_t expected_max_profit1 = 47;</div>
 <div class="line"><span class="lineno">   79</span>    assert(max_profit1 == expected_max_profit1);</div>
-<div class="line"><span class="lineno">   80</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Maximum profit with &quot;</span> &lt;&lt; n1 &lt;&lt; <span class="stringliteral">&quot; inch road is &quot;</span> &lt;&lt; max_profit1</div>
-<div class="line"><span class="lineno">   81</span>              &lt;&lt; <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">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum profit with &quot;</span> &lt;&lt; n1 &lt;&lt; <span class="stringliteral">&quot; inch road is &quot;</span> &lt;&lt; max_profit1</div>
+<div class="line"><span class="lineno">   81</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   82</span> </div>
 <div class="line"><span class="lineno">   83</span>    <span class="comment">// Test 2</span></div>
 <div class="line"><span class="lineno">   84</span>    <span class="keyword">const</span> int16_t n2 = 30;  <span class="comment">// size of rod</span></div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int32_t, n2&gt;</a> price2 = {</div>
+<div class="line"><span class="lineno">   85</span>    std::array&lt;int32_t, n2&gt; price2 = {</div>
 <div class="line"><span class="lineno">   86</span>        1,  5,  8,  9,  10, 17, 17, 20, 24, 30,  <span class="comment">// price array</span></div>
 <div class="line"><span class="lineno">   87</span>        31, 32, 33, 34, 35, 36, 37, 38, 39, 40,</div>
 <div class="line"><span class="lineno">   88</span>        41, 42, 43, 44, 45, 46, 47, 48, 49, 50};</div>
@@ -305,28 +321,20 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   91</span>        <a class="code hl_function" href="#a1cc523a30c18c63eac58220c3c494cfa">dynamic_programming::cut_rod::maxProfitByCuttingRod</a>(price2, n2);</div>
 <div class="line"><span class="lineno">   92</span>    <span class="keyword">const</span> int32_t expected_max_profit2 = 90;</div>
 <div class="line"><span class="lineno">   93</span>    assert(max_profit2 == expected_max_profit2);</div>
-<div class="line"><span class="lineno">   94</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Maximum profit with &quot;</span> &lt;&lt; n2 &lt;&lt; <span class="stringliteral">&quot; inch road is &quot;</span> &lt;&lt; max_profit2</div>
-<div class="line"><span class="lineno">   95</span>              &lt;&lt; <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">   94</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum profit with &quot;</span> &lt;&lt; n2 &lt;&lt; <span class="stringliteral">&quot; inch road is &quot;</span> &lt;&lt; max_profit2</div>
+<div class="line"><span class="lineno">   95</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   96</span>    <span class="comment">// Test 3</span></div>
 <div class="line"><span class="lineno">   97</span>    <span class="keyword">const</span> int16_t n3 = 5;                                 <span class="comment">// size of rod</span></div>
-<div class="line"><span class="lineno">   98</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int32_t, n3&gt;</a> price3 = {2, 9, 17, 23, 45};  <span class="comment">// price array</span></div>
+<div class="line"><span class="lineno">   98</span>    std::array&lt;int32_t, n3&gt; price3 = {2, 9, 17, 23, 45};  <span class="comment">// price array</span></div>
 <div class="line"><span class="lineno">   99</span>    <span class="keyword">const</span> int64_t max_profit3 =</div>
 <div class="line"><span class="lineno">  100</span>        <a class="code hl_function" href="#a1cc523a30c18c63eac58220c3c494cfa">dynamic_programming::cut_rod::maxProfitByCuttingRod</a>(price3, n3);</div>
 <div class="line"><span class="lineno">  101</span>    <span class="keyword">const</span> int64_t expected_max_profit3 = 45;</div>
 <div class="line"><span class="lineno">  102</span>    assert(max_profit3 == expected_max_profit3);</div>
-<div class="line"><span class="lineno">  103</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Maximum profit with &quot;</span> &lt;&lt; n3 &lt;&lt; <span class="stringliteral">&quot; inch road is &quot;</span> &lt;&lt; max_profit3</div>
-<div class="line"><span class="lineno">  104</span>              &lt;&lt; <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">  103</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum profit with &quot;</span> &lt;&lt; n3 &lt;&lt; <span class="stringliteral">&quot; inch road is &quot;</span> &lt;&lt; max_profit3</div>
+<div class="line"><span class="lineno">  104</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  105</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="acut__rod_8cpp_html_a1cc523a30c18c63eac58220c3c494cfa"><div class="ttname"><a href="#a1cc523a30c18c63eac58220c3c494cfa">dynamic_programming::cut_rod::maxProfitByCuttingRod</a></div><div class="ttdeci">int maxProfitByCuttingRod(const std::array&lt; int, T &gt; &amp;price, const uint64_t &amp;n)</div><div class="ttdoc">Cuts the rod in different pieces and stores the maximum profit for each piece of the rod.</div><div class="ttdef"><b>Definition</b> cut_rod.cpp:45</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><!-- 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="../../d6/d10/cut__rod_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acut__rod_8cpp_html_a1cc523a30c18c63eac58220c3c494cfa"><div class="ttname"><a href="#a1cc523a30c18c63eac58220c3c494cfa">dynamic_programming::cut_rod::maxProfitByCuttingRod</a></div><div class="ttdeci">int maxProfitByCuttingRod(const std::array&lt; int, T &gt; &amp;price, const uint64_t &amp;n)</div><div class="ttdoc">Cuts the rod in different pieces and stores the maximum profit for each piece of the rod.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d10/cut__rod_8cpp_source.html#l00045">cut_rod.cpp:45</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d6/d10/cut__rod_8cpp_a1cc523a30c18c63eac58220c3c494cfa_cgraph.map b/d6/d10/cut__rod_8cpp_a1cc523a30c18c63eac58220c3c494cfa_cgraph.map
deleted file mode 100644
index 552e6e23d..000000000
--- a/d6/d10/cut__rod_8cpp_a1cc523a30c18c63eac58220c3c494cfa_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="dynamic_programming::cut_rod::maxProfitByCuttingRod" name="dynamic_programming::cut_rod::maxProfitByCuttingRod">
-<area shape="rect" id="Node000001" title="Cuts the rod in different pieces and stores the maximum profit for each piece of the rod." alt="" coords="5,29,224,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="78,29,76,19,82,10,95,5,115,3,136,5,148,11,146,16,134,10,114,8,96,10,85,15,81,20,83,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="272,37,344,62"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="224,47,256,47,256,52,224,52"/>
-</map>
diff --git a/d6/d10/cut__rod_8cpp_a1cc523a30c18c63eac58220c3c494cfa_cgraph.md5 b/d6/d10/cut__rod_8cpp_a1cc523a30c18c63eac58220c3c494cfa_cgraph.md5
deleted file mode 100644
index 33b1ed081..000000000
--- a/d6/d10/cut__rod_8cpp_a1cc523a30c18c63eac58220c3c494cfa_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4c2f3445a4586254e2f5e7cc754e54c5
\ No newline at end of file
diff --git a/d6/d10/cut__rod_8cpp_a1cc523a30c18c63eac58220c3c494cfa_cgraph.svg b/d6/d10/cut__rod_8cpp_a1cc523a30c18c63eac58220c3c494cfa_cgraph.svg
deleted file mode 100644
index df364f558..000000000
--- a/d6/d10/cut__rod_8cpp_a1cc523a30c18c63eac58220c3c494cfa_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::cut_rod::maxProfitByCuttingRod Pages: 1 -->
-<svg width="262pt" height="57pt"
- viewBox="0.00 0.00 262.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>dynamic_programming::cut_rod::maxProfitByCuttingRod</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Cuts the rod in different pieces and stores the maximum profit for each piece of the rod.">
-<polygon fill="#999999" stroke="#666666" points="163.75,-30.5 0,-30.5 0,0 163.75,0 163.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="81.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::cut_rod::maxProfitByCuttingRod</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M56.18,-30.99C50.94,-40.06 59.5,-48.5 81.88,-48.5 94.11,-48.5 102.22,-45.97 106.19,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="109.64,-42.84 107.38,-32.49 102.69,-41.99 109.64,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254,-24.88 199.75,-24.88 199.75,-5.63 254,-5.63 254,-24.88"/>
-<text text-anchor="middle" x="226.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.98,-15.25C172.24,-15.25 180.32,-15.25 187.78,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.77,-18.75 197.77,-15.25 187.77,-11.75 187.77,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d10/cut__rod_8cpp_a1cc523a30c18c63eac58220c3c494cfa_cgraph_org.svg b/d6/d10/cut__rod_8cpp_a1cc523a30c18c63eac58220c3c494cfa_cgraph_org.svg
deleted file mode 100644
index 764de6dc4..000000000
--- a/d6/d10/cut__rod_8cpp_a1cc523a30c18c63eac58220c3c494cfa_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::cut_rod::maxProfitByCuttingRod Pages: 1 -->
-<svg width="262pt" height="57pt"
- viewBox="0.00 0.00 262.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>dynamic_programming::cut_rod::maxProfitByCuttingRod</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Cuts the rod in different pieces and stores the maximum profit for each piece of the rod.">
-<polygon fill="#999999" stroke="#666666" points="163.75,-30.5 0,-30.5 0,0 163.75,0 163.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="81.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::cut_rod::maxProfitByCuttingRod</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M56.18,-30.99C50.94,-40.06 59.5,-48.5 81.88,-48.5 94.11,-48.5 102.22,-45.97 106.19,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="109.64,-42.84 107.38,-32.49 102.69,-41.99 109.64,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254,-24.88 199.75,-24.88 199.75,-5.63 254,-5.63 254,-24.88"/>
-<text text-anchor="middle" x="226.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.98,-15.25C172.24,-15.25 180.32,-15.25 187.78,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.77,-18.75 197.77,-15.25 187.77,-11.75 187.77,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d10/cut__rod_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d6/d10/cut__rod_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 969cbc190..000000000
--- a/d6/d10/cut__rod_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Function to test above algorithm." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/d6/d10/cut__rod_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d6/d10/cut__rod_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 3beec0a15..000000000
--- a/d6/d10/cut__rod_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bfed022ee432c6caf8dedaa8aacf402d
\ No newline at end of file
diff --git a/d6/d10/cut__rod_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d6/d10/cut__rod_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 474b95828..000000000
--- a/d6/d10/cut__rod_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test above algorithm.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d10/cut__rod_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d6/d10/cut__rod_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 21269f1f3..000000000
--- a/d6/d10/cut__rod_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test above algorithm.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d10/cut__rod_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d10/cut__rod_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index d9f61fcbd..000000000
--- a/d6/d10/cut__rod_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function to test above algorithm." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/d6/d10/cut__rod_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d10/cut__rod_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 282d51a22..000000000
--- a/d6/d10/cut__rod_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b03bd7e53f8dd0e0de312ce97e201ca1
\ No newline at end of file
diff --git a/d6/d10/cut__rod_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d10/cut__rod_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index fb5cbf488..000000000
--- a/d6/d10/cut__rod_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test above algorithm.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d10/cut__rod_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/d10/cut__rod_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 45a7bf100..000000000
--- a/d6/d10/cut__rod_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test above algorithm.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d10/cut__rod_8cpp_source.html b/d6/d10/cut__rod_8cpp_source.html
new file mode 100644
index 000000000..2a48a8527
--- /dev/null
+++ b/d6/d10/cut__rod_8cpp_source.html
@@ -0,0 +1,220 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/cut_rod.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/d10/cut__rod_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">cut_rod.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/d10/cut__rod_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;array&gt;</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;climits&gt;</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a> {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d36/namespacecut__rod.html">cut_rod</a> {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> T&gt;</div>
+<div class="foldopen" id="foldopen00045" data-start="{" data-end="}">
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="../../d6/d10/cut__rod_8cpp.html#a1cc523a30c18c63eac58220c3c494cfa">   45</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/d10/cut__rod_8cpp.html#a1cc523a30c18c63eac58220c3c494cfa">maxProfitByCuttingRod</a>(<span class="keyword">const</span> std::array&lt;int, T&gt; &amp;price, <span class="keyword">const</span> uint64_t &amp;n) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keywordtype">int</span> *profit =</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="keyword">new</span> <span class="keywordtype">int</span>[n + 1];  <span class="comment">// profit[i] will hold maximum profit for i inch rod</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    profit[0] = 0;  <span class="comment">// if length of rod is zero, then no profit</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="comment">// outer loop will select size of rod, starting from 1 inch to n inch rod.</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="comment">// inner loop will evaluate the maximum profit we can get for i inch rod by</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="comment">// making every possible cut on it and will store it in profit[i].</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 1; i &lt;= n; i++) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="keywordtype">int</span> q = INT_MIN;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 1; j &lt;= i; j++) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            q = std::max(q, price[j - 1] + profit[i - j]);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        profit[i] = q;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    }</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keyword">const</span> int16_t ans = profit[n];</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keyword">delete</span>[] profit;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordflow">return</span> ans;  <span class="comment">// returning maximum profit</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>}</div>
+</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>}  <span class="comment">// namespace cut_rod</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>}  <span class="comment">// namespace dynamic_programming</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="foldopen" id="foldopen00072" data-start="{" data-end="}">
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"><a class="line" href="../../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   72</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="comment">// Test 1</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keyword">const</span> int16_t n1 = 8;                                         <span class="comment">// size of rod</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    std::array&lt;int32_t, n1&gt; price1 = {1, 2, 4, 6, 8, 45, 21, 9};  <span class="comment">// price array</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keyword">const</span> int64_t max_profit1 =</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        dynamic_programming::cut_rod::maxProfitByCuttingRod(price1, n1);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keyword">const</span> int64_t expected_max_profit1 = 47;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    assert(max_profit1 == expected_max_profit1);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum profit with &quot;</span> &lt;&lt; n1 &lt;&lt; <span class="stringliteral">&quot; inch road is &quot;</span> &lt;&lt; max_profit1</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="comment">// Test 2</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="keyword">const</span> int16_t n2 = 30;  <span class="comment">// size of rod</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::array&lt;int32_t, n2&gt; price2 = {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        1,  5,  8,  9,  10, 17, 17, 20, 24, 30,  <span class="comment">// price array</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        31, 32, 33, 34, 35, 36, 37, 38, 39, 40,</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        41, 42, 43, 44, 45, 46, 47, 48, 49, 50};</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="keyword">const</span> int64_t max_profit2 =</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        dynamic_programming::cut_rod::maxProfitByCuttingRod(price2, n2);</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keyword">const</span> int32_t expected_max_profit2 = 90;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    assert(max_profit2 == expected_max_profit2);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum profit with &quot;</span> &lt;&lt; n2 &lt;&lt; <span class="stringliteral">&quot; inch road is &quot;</span> &lt;&lt; max_profit2</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="comment">// Test 3</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="keyword">const</span> int16_t n3 = 5;                                 <span class="comment">// size of rod</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    std::array&lt;int32_t, n3&gt; price3 = {2, 9, 17, 23, 45};  <span class="comment">// price array</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="keyword">const</span> int64_t max_profit3 =</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        dynamic_programming::cut_rod::maxProfitByCuttingRod(price3, n3);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keyword">const</span> int64_t expected_max_profit3 = 45;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    assert(max_profit3 == expected_max_profit3);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum profit with &quot;</span> &lt;&lt; n3 &lt;&lt; <span class="stringliteral">&quot; inch road is &quot;</span> &lt;&lt; max_profit3</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>}</div>
+</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="foldopen" id="foldopen00111" data-start="{" data-end="}">
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"><a class="line" href="../../d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  111</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="comment">// Testing</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <a class="code hl_function" href="../../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>}</div>
+</div>
+<div class="ttc" id="acut__rod_8cpp_html_a1cc523a30c18c63eac58220c3c494cfa"><div class="ttname"><a href="../../d6/d10/cut__rod_8cpp.html#a1cc523a30c18c63eac58220c3c494cfa">dynamic_programming::cut_rod::maxProfitByCuttingRod</a></div><div class="ttdeci">int maxProfitByCuttingRod(const std::array&lt; int, T &gt; &amp;price, const uint64_t &amp;n)</div><div class="ttdoc">Cuts the rod in different pieces and stores the maximum profit for each piece of the rod.</div><div class="ttdef"><b>Definition</b> <a href="#l00045">cut_rod.cpp:45</a></div></div>
+<div class="ttc" id="acut__rod_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test above algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00072">cut_rod.cpp:72</a></div></div>
+<div class="ttc" id="acut__rod_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00111">cut_rod.cpp:111</a></div></div>
+<div class="ttc" id="anamespacecut__rod_html"><div class="ttname"><a href="../../d8/d36/namespacecut__rod.html">cut_rod</a></div><div class="ttdoc">Implementation of cutting a rod problem.</div></div>
+<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../d6/d10/cut__rod_8cpp.html">cut_rod.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/d1a/dnf__sort_8cpp.html b/d6/d1a/dnf__sort_8cpp.html
index 8af4909e0..1761224c0 100644
--- a/d6/d1a/dnf__sort_8cpp.html
+++ b/d6/d1a/dnf__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/dnf_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/dnf_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for dnf_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d14/dnf__sort_8cpp__incl.svg" width="434" height="111"><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">
+</div>
+<p><a href="../../d6/d1a/dnf__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -136,7 +155,7 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a621767fe711db64fe57a2ac4987b11f0" id="r_a621767fe711db64fe57a2ac4987b11f0"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a621767fe711db64fe57a2ac4987b11f0"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a621767fe711db64fe57a2ac4987b11f0">sorting::dnf_sort::dnfSort</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;in_arr)</td></tr>
+<tr class="memitem:a621767fe711db64fe57a2ac4987b11f0"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a621767fe711db64fe57a2ac4987b11f0">sorting::dnf_sort::dnfSort</a> (const std::vector&lt; T &gt; &amp;in_arr)</td></tr>
 <tr class="memdesc:a621767fe711db64fe57a2ac4987b11f0"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function implements DNF sort.  <br /></td></tr>
 <tr class="separator:a621767fe711db64fe57a2ac4987b11f0"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -149,6 +168,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of the <a href="https://www.geeksforgeeks.org/sort-an-array-of-0s-1s-and-2s/" target="_blank">DNF sort</a> implementation. </p>
 <p>C++ program to sort an array with 0, 1 and 2 in a single pass(DNF sort). Since one traversal of the array is there hence it works in O(n) time complexity. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/heysujal" target="_blank">Sujal Gupta</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/d1a/dnf__sort_8cpp_source.html">dnf_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a621767fe711db64fe57a2ac4987b11f0" name="a621767fe711db64fe57a2ac4987b11f0"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a621767fe711db64fe57a2ac4987b11f0">&#9670;&#160;</a></span>dnfSort()</h2>
@@ -159,9 +180,9 @@ Functions</h2></td></tr>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; sorting::dnf_sort::dnfSort </td>
+          <td class="memname">std::vector&lt; T &gt; sorting::dnf_sort::dnfSort </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>in_arr</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>in_arr</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -182,8 +203,10 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d1a/dnf__sort_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../d6/d1a/dnf__sort_8cpp_source.html">dnf_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   39</span>                                                 {</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&lt;T&gt;</a> arr(in_arr);</div>
+<div class="line"><span class="lineno">   40</span>    std::vector&lt;T&gt; arr(in_arr);</div>
 <div class="line"><span class="lineno">   41</span>    uint64_t lo = 0;</div>
 <div class="line"><span class="lineno">   42</span>    uint64_t hi = arr.size() - 1;</div>
 <div class="line"><span class="lineno">   43</span>    uint64_t mid = 0;</div>
@@ -194,7 +217,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   48</span>        <span class="keywordflow">switch</span> (arr[mid]) {</div>
 <div class="line"><span class="lineno">   49</span>            <span class="comment">// If the element is 0</span></div>
 <div class="line"><span class="lineno">   50</span>            <span class="keywordflow">case</span> 0:</div>
-<div class="line"><span class="lineno">   51</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(arr[lo++], arr[mid++]);</div>
+<div class="line"><span class="lineno">   51</span>                std::swap(arr[lo++], arr[mid++]);</div>
 <div class="line"><span class="lineno">   52</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">   53</span> </div>
 <div class="line"><span class="lineno">   54</span>            <span class="comment">// If the element is 1 .</span></div>
@@ -204,20 +227,13 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   58</span> </div>
 <div class="line"><span class="lineno">   59</span>            <span class="comment">// If the element is 2</span></div>
 <div class="line"><span class="lineno">   60</span>            <span class="keywordflow">case</span> 2:</div>
-<div class="line"><span class="lineno">   61</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(arr[mid], arr[hi--]);</div>
+<div class="line"><span class="lineno">   61</span>                std::swap(arr[mid], arr[hi--]);</div>
 <div class="line"><span class="lineno">   62</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">   63</span>        }</div>
 <div class="line"><span class="lineno">   64</span>    }</div>
 <div class="line"><span class="lineno">   65</span>    <span class="keywordflow">return</span> arr;</div>
 <div class="line"><span class="lineno">   66</span>}</div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d1a/dnf__sort_8cpp_a621767fe711db64fe57a2ac4987b11f0_cgraph.svg" width="298" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -237,17 +253,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d1a/dnf__sort_8cpp_source.html#l00109">109</a> of file <a class="el" href="../../d6/d1a/dnf__sort_8cpp_source.html">dnf_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  109</span>           {</div>
 <div class="line"><span class="lineno">  110</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the test</span></div>
 <div class="line"><span class="lineno">  111</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  112</span>}</div>
-<div class="ttc" id="adnf__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> dnf_sort.cpp:74</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d1a/dnf__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="300" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="adnf__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d1a/dnf__sort_8cpp_source.html#l00074">dnf_sort.cpp:74</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -275,48 +288,40 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d1a/dnf__sort_8cpp_source.html#l00074">74</a> of file <a class="el" href="../../d6/d1a/dnf__sort_8cpp_source.html">dnf_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   74</span>                   {</div>
 <div class="line"><span class="lineno">   75</span>    <span class="comment">// 1st test</span></div>
 <div class="line"><span class="lineno">   76</span>    <span class="comment">// [1, 0, 2, 1] return [0, 1, 1, 2]</span></div>
-<div class="line"><span class="lineno">   77</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> array1 = {0, 1, 1, 2};</div>
-<div class="line"><span class="lineno">   78</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</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&lt;uint64_t&gt;</a> arr1 = <a class="code hl_function" href="#a621767fe711db64fe57a2ac4987b11f0">sorting::dnf_sort::dnfSort</a>(array1);</div>
-<div class="line"><span class="lineno">   80</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr1), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr1)));</div>
-<div class="line"><span class="lineno">   81</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   77</span>    std::vector&lt;uint64_t&gt; array1 = {0, 1, 1, 2};</div>
+<div class="line"><span class="lineno">   78</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
+<div class="line"><span class="lineno">   79</span>    std::vector&lt;uint64_t&gt; arr1 = <a class="code hl_function" href="#a621767fe711db64fe57a2ac4987b11f0">sorting::dnf_sort::dnfSort</a>(array1);</div>
+<div class="line"><span class="lineno">   80</span>    assert(std::is_sorted(std::begin(arr1), std::end(arr1)));</div>
+<div class="line"><span class="lineno">   81</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   82</span>    <span class="comment">// 2nd test</span></div>
 <div class="line"><span class="lineno">   83</span>    <span class="comment">// [1, 0, 0, 1, 1, 0, 2, 1] return [0, 0, 0, 1, 1, 1, 1, 2]</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&lt;uint64_t&gt;</a> array2 = {1, 0, 0, 1, 1, 0, 2, 1};</div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</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&lt;uint64_t&gt;</a> arr2 = <a class="code hl_function" href="#a621767fe711db64fe57a2ac4987b11f0">sorting::dnf_sort::dnfSort</a>(array2);</div>
-<div class="line"><span class="lineno">   87</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr2), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr2)));</div>
-<div class="line"><span class="lineno">   88</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   84</span>    std::vector&lt;uint64_t&gt; array2 = {1, 0, 0, 1, 1, 0, 2, 1};</div>
+<div class="line"><span class="lineno">   85</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
+<div class="line"><span class="lineno">   86</span>    std::vector&lt;uint64_t&gt; arr2 = <a class="code hl_function" href="#a621767fe711db64fe57a2ac4987b11f0">sorting::dnf_sort::dnfSort</a>(array2);</div>
+<div class="line"><span class="lineno">   87</span>    assert(std::is_sorted(std::begin(arr2), std::end(arr2)));</div>
+<div class="line"><span class="lineno">   88</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   89</span>    <span class="comment">// 3rd test</span></div>
 <div class="line"><span class="lineno">   90</span>    <span class="comment">// [1, 1, 0, 0, 1, 2, 2, 0, 2, 1] return [0, 0, 0, 1, 1, 1, 1, 2, 2, 2]</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&lt;uint64_t&gt;</a> array3 = {1, 1, 0, 0, 1, 2, 2, 0, 2, 1};</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> &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</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&lt;uint64_t&gt;</a> arr3 = <a class="code hl_function" href="#a621767fe711db64fe57a2ac4987b11f0">sorting::dnf_sort::dnfSort</a>(array3);</div>
-<div class="line"><span class="lineno">   94</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr3), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr3)));</div>
-<div class="line"><span class="lineno">   95</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   91</span>    std::vector&lt;uint64_t&gt; array3 = {1, 1, 0, 0, 1, 2, 2, 0, 2, 1};</div>
+<div class="line"><span class="lineno">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
+<div class="line"><span class="lineno">   93</span>    std::vector&lt;uint64_t&gt; arr3 = <a class="code hl_function" href="#a621767fe711db64fe57a2ac4987b11f0">sorting::dnf_sort::dnfSort</a>(array3);</div>
+<div class="line"><span class="lineno">   94</span>    assert(std::is_sorted(std::begin(arr3), std::end(arr3)));</div>
+<div class="line"><span class="lineno">   95</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   96</span>    <span class="comment">// 4th test</span></div>
 <div class="line"><span class="lineno">   97</span>    <span class="comment">// [2, 2, 2, 0, 0, 1, 1] return [0, 0, 1, 1, 2, 2, 2]</span></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&lt;uint64_t&gt;</a> array4 = {2, 2, 2, 0, 0, 1, 1};</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> &lt;&lt; <span class="stringliteral">&quot;Test 4... &quot;</span>;</div>
-<div class="line"><span class="lineno">  100</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> arr4 = <a class="code hl_function" href="#a621767fe711db64fe57a2ac4987b11f0">sorting::dnf_sort::dnfSort</a>(array4);</div>
-<div class="line"><span class="lineno">  101</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr4), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr4)));</div>
-<div class="line"><span class="lineno">  102</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   98</span>    std::vector&lt;uint64_t&gt; array4 = {2, 2, 2, 0, 0, 1, 1};</div>
+<div class="line"><span class="lineno">   99</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4... &quot;</span>;</div>
+<div class="line"><span class="lineno">  100</span>    std::vector&lt;uint64_t&gt; arr4 = <a class="code hl_function" href="#a621767fe711db64fe57a2ac4987b11f0">sorting::dnf_sort::dnfSort</a>(array4);</div>
+<div class="line"><span class="lineno">  101</span>    assert(std::is_sorted(std::begin(arr4), std::end(arr4)));</div>
+<div class="line"><span class="lineno">  102</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  103</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="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="adnf__sort_8cpp_html_a621767fe711db64fe57a2ac4987b11f0"><div class="ttname"><a href="#a621767fe711db64fe57a2ac4987b11f0">sorting::dnf_sort::dnfSort</a></div><div class="ttdeci">std::vector&lt; T &gt; dnfSort(const std::vector&lt; T &gt; &amp;in_arr)</div><div class="ttdoc">The main function implements DNF sort.</div><div class="ttdef"><b>Definition</b> dnf_sort.cpp:39</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="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="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d1a/dnf__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="203" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="adnf__sort_8cpp_html_a621767fe711db64fe57a2ac4987b11f0"><div class="ttname"><a href="#a621767fe711db64fe57a2ac4987b11f0">sorting::dnf_sort::dnfSort</a></div><div class="ttdeci">std::vector&lt; T &gt; dnfSort(const std::vector&lt; T &gt; &amp;in_arr)</div><div class="ttdoc">The main function implements DNF sort.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d1a/dnf__sort_8cpp_source.html#l00039">dnf_sort.cpp:39</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d6/d1a/dnf__sort_8cpp_a621767fe711db64fe57a2ac4987b11f0_cgraph.map b/d6/d1a/dnf__sort_8cpp_a621767fe711db64fe57a2ac4987b11f0_cgraph.map
deleted file mode 100644
index cce786143..000000000
--- a/d6/d1a/dnf__sort_8cpp_a621767fe711db64fe57a2ac4987b11f0_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="sorting::dnf_sort::dnfSort" name="sorting::dnf_sort::dnfSort">
-<area shape="rect" id="Node000001" title="The main function implements DNF sort." alt="" coords="5,29,129,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="35,29,33,19,38,11,50,5,67,3,85,5,96,11,94,16,84,10,67,8,51,10,42,14,38,20,40,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="177,12,292,37"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="129,38,161,33,162,38,130,43"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="195,61,274,86"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="130,56,180,63,180,69,129,61"/>
-</map>
diff --git a/d6/d1a/dnf__sort_8cpp_a621767fe711db64fe57a2ac4987b11f0_cgraph.md5 b/d6/d1a/dnf__sort_8cpp_a621767fe711db64fe57a2ac4987b11f0_cgraph.md5
deleted file mode 100644
index fd2100ae4..000000000
--- a/d6/d1a/dnf__sort_8cpp_a621767fe711db64fe57a2ac4987b11f0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fc7ec0c88a23cc75fa8d989fd7bfc67d
\ No newline at end of file
diff --git a/d6/d1a/dnf__sort_8cpp_a621767fe711db64fe57a2ac4987b11f0_cgraph.svg b/d6/d1a/dnf__sort_8cpp_a621767fe711db64fe57a2ac4987b11f0_cgraph.svg
deleted file mode 100644
index 5ae50edce..000000000
--- a/d6/d1a/dnf__sort_8cpp_a621767fe711db64fe57a2ac4987b11f0_cgraph.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::dnf_sort::dnfSort Pages: 1 -->
-<svg width="223pt" height="69pt"
- viewBox="0.00 0.00 223.00 68.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64.88)">
-<title>sorting::dnf_sort::dnfSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function implements DNF sort.">
-<polygon fill="#999999" stroke="#666666" points="92.5,-42.88 0,-42.88 0,-12.37 92.5,-12.37 92.5,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::dnf_sort::</text>
-<text text-anchor="middle" x="46.25" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">dnfSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.01,-43.36C19.47,-52.43 26.89,-60.88 46.25,-60.88 56.84,-60.88 63.86,-58.35 67.3,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.75,-55.18 68.33,-44.87 63.79,-54.44 70.75,-55.18"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215,-56.25 128.5,-56.25 128.5,-37 215,-37 215,-56.25"/>
-<text text-anchor="middle" x="171.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.89,-34.65C100.73,-35.85 108.95,-37.12 116.99,-38.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="116.26,-41.78 126.67,-39.84 117.32,-34.86 116.26,-41.78"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.12,-19.25 142.38,-19.25 142.38,0 201.12,0 201.12,-19.25"/>
-<text text-anchor="middle" x="171.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.89,-20.97C105.38,-19.15 118.83,-17.19 130.97,-15.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.25,-18.92 140.64,-14.01 130.24,-11.99 131.25,-18.92"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d1a/dnf__sort_8cpp_a621767fe711db64fe57a2ac4987b11f0_cgraph_org.svg b/d6/d1a/dnf__sort_8cpp_a621767fe711db64fe57a2ac4987b11f0_cgraph_org.svg
deleted file mode 100644
index 8f1b186fd..000000000
--- a/d6/d1a/dnf__sort_8cpp_a621767fe711db64fe57a2ac4987b11f0_cgraph_org.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::dnf_sort::dnfSort Pages: 1 -->
-<svg width="223pt" height="69pt"
- viewBox="0.00 0.00 223.00 68.88" 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 64.88)">
-<title>sorting::dnf_sort::dnfSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function implements DNF sort.">
-<polygon fill="#999999" stroke="#666666" points="92.5,-42.88 0,-42.88 0,-12.37 92.5,-12.37 92.5,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::dnf_sort::</text>
-<text text-anchor="middle" x="46.25" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">dnfSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.01,-43.36C19.47,-52.43 26.89,-60.88 46.25,-60.88 56.84,-60.88 63.86,-58.35 67.3,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.75,-55.18 68.33,-44.87 63.79,-54.44 70.75,-55.18"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215,-56.25 128.5,-56.25 128.5,-37 215,-37 215,-56.25"/>
-<text text-anchor="middle" x="171.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.89,-34.65C100.73,-35.85 108.95,-37.12 116.99,-38.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="116.26,-41.78 126.67,-39.84 117.32,-34.86 116.26,-41.78"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.12,-19.25 142.38,-19.25 142.38,0 201.12,0 201.12,-19.25"/>
-<text text-anchor="middle" x="171.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.89,-20.97C105.38,-19.15 118.83,-17.19 130.97,-15.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.25,-18.92 140.64,-14.01 130.24,-11.99 131.25,-18.92"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d1a/dnf__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d6/d1a/dnf__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 61bfe74f5..000000000
--- a/d6/d1a/dnf__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,80,49,106"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="108,5,186,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="43,77,95,40,101,36,104,41,98,44,46,82"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="113,55,181,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="49,86,97,75,98,81,50,91"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="111,104,182,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="50,95,97,104,96,109,49,100"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="97,153,197,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="47,104,98,140,104,143,101,148,95,144,44,108"/>
-</map>
diff --git a/d6/d1a/dnf__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d6/d1a/dnf__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index fd351d130..000000000
--- a/d6/d1a/dnf__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-522e993d38257705e4c580d9bd207756
\ No newline at end of file
diff --git a/d6/d1a/dnf__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d6/d1a/dnf__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 7eb6dd32d..000000000
--- a/d6/d1a/dnf__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="152pt" height="138pt"
- viewBox="0.00 0.00 151.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-74.25 0,-74.25 0,-55 32.5,-55 32.5,-74.25"/>
-<text text-anchor="middle" x="16.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.5,-130.25 76.75,-130.25 76.75,-111 135.5,-111 135.5,-130.25"/>
-<text text-anchor="middle" x="106.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.44,-74.65C39.56,-82.73 54.5,-94.09 68.5,-102.62 69.94,-103.5 71.42,-104.37 72.93,-105.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.27,-108.3 81.75,-109.89 74.55,-102.12 71.27,-108.3"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="131.75,-93.25 80.5,-93.25 80.5,-74 131.75,-74 131.75,-93.25"/>
-<text text-anchor="middle" x="106.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-68.02C43.01,-70.2 56.49,-73.11 69.07,-75.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.26,-79.23 78.77,-77.93 69.74,-72.39 68.26,-79.23"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.88,-56.25 79.38,-56.25 79.38,-37 132.88,-37 132.88,-56.25"/>
-<text text-anchor="middle" x="106.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-61.41C42.79,-59.39 55.88,-56.71 68.22,-54.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.64,-57.67 77.73,-52.24 67.23,-50.81 68.64,-57.67"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.75,-19.25 68.5,-19.25 68.5,0 143.75,0 143.75,-19.25"/>
-<text text-anchor="middle" x="106.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.9,-54.57C40.03,-46.75 54.77,-35.88 68.5,-27.62 69.94,-26.76 71.43,-25.9 72.95,-25.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.56,-28.16 81.77,-20.4 71.29,-21.96 74.56,-28.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d1a/dnf__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d6/d1a/dnf__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1105d6fc6..000000000
--- a/d6/d1a/dnf__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="152pt" height="138pt"
- viewBox="0.00 0.00 151.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-74.25 0,-74.25 0,-55 32.5,-55 32.5,-74.25"/>
-<text text-anchor="middle" x="16.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.5,-130.25 76.75,-130.25 76.75,-111 135.5,-111 135.5,-130.25"/>
-<text text-anchor="middle" x="106.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.44,-74.65C39.56,-82.73 54.5,-94.09 68.5,-102.62 69.94,-103.5 71.42,-104.37 72.93,-105.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.27,-108.3 81.75,-109.89 74.55,-102.12 71.27,-108.3"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="131.75,-93.25 80.5,-93.25 80.5,-74 131.75,-74 131.75,-93.25"/>
-<text text-anchor="middle" x="106.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-68.02C43.01,-70.2 56.49,-73.11 69.07,-75.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.26,-79.23 78.77,-77.93 69.74,-72.39 68.26,-79.23"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.88,-56.25 79.38,-56.25 79.38,-37 132.88,-37 132.88,-56.25"/>
-<text text-anchor="middle" x="106.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-61.41C42.79,-59.39 55.88,-56.71 68.22,-54.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.64,-57.67 77.73,-52.24 67.23,-50.81 68.64,-57.67"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.75,-19.25 68.5,-19.25 68.5,0 143.75,0 143.75,-19.25"/>
-<text text-anchor="middle" x="106.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.9,-54.57C40.03,-46.75 54.77,-35.88 68.5,-27.62 69.94,-26.76 71.43,-25.9 72.95,-25.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.56,-28.16 81.77,-20.4 71.29,-21.96 74.56,-28.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d1a/dnf__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d1a/dnf__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 61988d7f5..000000000
--- a/d6/d1a/dnf__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,80,55,106"/>
-<area shape="rect" id="Node000002" href="$d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,80,146,106"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,90,87,90,87,96,55,96"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="205,5,283,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="140,77,193,40,199,36,201,41,195,44,143,82"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="210,55,278,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="146,86,194,75,195,81,147,91"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="208,104,280,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="147,95,194,104,193,109,146,100"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="194,153,294,179"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="144,104,195,140,201,143,199,148,193,144,141,108"/>
-</map>
diff --git a/d6/d1a/dnf__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d1a/dnf__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index e69a218de..000000000
--- a/d6/d1a/dnf__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-18d598829767c6966dc51c1de83ff728
\ No newline at end of file
diff --git a/d6/d1a/dnf__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d1a/dnf__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index b995b2645..000000000
--- a/d6/d1a/dnf__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="225pt" height="138pt"
- viewBox="0.00 0.00 224.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-74.25 73,-74.25 73,-55 105.5,-55 105.5,-74.25"/>
-<text text-anchor="middle" x="89.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-64.62C44.58,-64.62 53.31,-64.62 61.45,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-68.13 71.2,-64.63 61.2,-61.13 61.2,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="208.5,-130.25 149.75,-130.25 149.75,-111 208.5,-111 208.5,-130.25"/>
-<text text-anchor="middle" x="179.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.44,-74.65C112.56,-82.73 127.5,-94.09 141.5,-102.62 142.94,-103.5 144.42,-104.37 145.93,-105.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.27,-108.3 154.75,-109.89 147.55,-102.12 144.27,-108.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.75,-93.25 153.5,-93.25 153.5,-74 204.75,-74 204.75,-93.25"/>
-<text text-anchor="middle" x="179.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-68.02C116.01,-70.2 129.49,-73.11 142.07,-75.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.26,-79.23 151.77,-77.93 142.74,-72.39 141.26,-79.23"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="205.88,-56.25 152.38,-56.25 152.38,-37 205.88,-37 205.88,-56.25"/>
-<text text-anchor="middle" x="179.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-61.41C115.79,-59.39 128.88,-56.71 141.22,-54.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.64,-57.67 150.73,-52.24 140.23,-50.81 141.64,-57.67"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.75,-19.25 141.5,-19.25 141.5,0 216.75,0 216.75,-19.25"/>
-<text text-anchor="middle" x="179.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.9,-54.57C113.03,-46.75 127.77,-35.88 141.5,-27.62 142.94,-26.76 144.43,-25.9 145.95,-25.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.56,-28.16 154.77,-20.4 144.29,-21.96 147.56,-28.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d1a/dnf__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/d1a/dnf__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 55a387e0b..000000000
--- a/d6/d1a/dnf__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="225pt" height="138pt"
- viewBox="0.00 0.00 224.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-74.25 73,-74.25 73,-55 105.5,-55 105.5,-74.25"/>
-<text text-anchor="middle" x="89.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-64.62C44.58,-64.62 53.31,-64.62 61.45,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-68.13 71.2,-64.63 61.2,-61.13 61.2,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="208.5,-130.25 149.75,-130.25 149.75,-111 208.5,-111 208.5,-130.25"/>
-<text text-anchor="middle" x="179.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.44,-74.65C112.56,-82.73 127.5,-94.09 141.5,-102.62 142.94,-103.5 144.42,-104.37 145.93,-105.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.27,-108.3 154.75,-109.89 147.55,-102.12 144.27,-108.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.75,-93.25 153.5,-93.25 153.5,-74 204.75,-74 204.75,-93.25"/>
-<text text-anchor="middle" x="179.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-68.02C116.01,-70.2 129.49,-73.11 142.07,-75.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.26,-79.23 151.77,-77.93 142.74,-72.39 141.26,-79.23"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="205.88,-56.25 152.38,-56.25 152.38,-37 205.88,-37 205.88,-56.25"/>
-<text text-anchor="middle" x="179.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-61.41C115.79,-59.39 128.88,-56.71 141.22,-54.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.64,-57.67 150.73,-52.24 140.23,-50.81 141.64,-57.67"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.75,-19.25 141.5,-19.25 141.5,0 216.75,0 216.75,-19.25"/>
-<text text-anchor="middle" x="179.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.9,-54.57C113.03,-46.75 127.77,-35.88 141.5,-27.62 142.94,-26.76 144.43,-25.9 145.95,-25.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.56,-28.16 154.77,-20.4 144.29,-21.96 147.56,-28.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d1a/dnf__sort_8cpp_source.html b/d6/d1a/dnf__sort_8cpp_source.html
new file mode 100644
index 000000000..74406d597
--- /dev/null
+++ b/d6/d1a/dnf__sort_8cpp_source.html
@@ -0,0 +1,224 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/dnf_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/d1a/dnf__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">dnf_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/d1a/dnf__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/d75/namespacednf__sort.html">dnf_sort</a> {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00039" data-start="{" data-end="}">
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../d6/d1a/dnf__sort_8cpp.html#a621767fe711db64fe57a2ac4987b11f0">   39</a></span>std::vector&lt;T&gt; <a class="code hl_function" href="../../d6/d1a/dnf__sort_8cpp.html#a621767fe711db64fe57a2ac4987b11f0">dnfSort</a>(<span class="keyword">const</span> std::vector&lt;T&gt; &amp;in_arr) {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    std::vector&lt;T&gt; arr(in_arr);</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    uint64_t lo = 0;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    uint64_t hi = arr.size() - 1;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    uint64_t mid = 0;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="comment">// Iterate till all the elements</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="comment">// are sorted</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">while</span> (mid &lt;= hi) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="keywordflow">switch</span> (arr[mid]) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            <span class="comment">// If the element is 0</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>            <span class="keywordflow">case</span> 0:</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>                std::swap(arr[lo++], arr[mid++]);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            <span class="comment">// If the element is 1 .</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            <span class="keywordflow">case</span> 1:</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>                mid++;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            <span class="comment">// If the element is 2</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            <span class="keywordflow">case</span> 2:</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>                std::swap(arr[mid], arr[hi--]);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordflow">return</span> arr;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>}</div>
+</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>}  <span class="comment">// namespace dnf_sort</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="foldopen" id="foldopen00074" data-start="{" data-end="}">
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="../../d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   74</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="comment">// 1st test</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="comment">// [1, 0, 2, 1] return [0, 1, 1, 2]</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    std::vector&lt;uint64_t&gt; array1 = {0, 1, 1, 2};</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    std::vector&lt;uint64_t&gt; arr1 = sorting::dnf_sort::dnfSort(array1);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    assert(std::is_sorted(std::begin(arr1), std::end(arr1)));</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="comment">// 2nd test</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="comment">// [1, 0, 0, 1, 1, 0, 2, 1] return [0, 0, 0, 1, 1, 1, 1, 2]</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::vector&lt;uint64_t&gt; array2 = {1, 0, 0, 1, 1, 0, 2, 1};</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    std::vector&lt;uint64_t&gt; arr2 = sorting::dnf_sort::dnfSort(array2);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    assert(std::is_sorted(std::begin(arr2), std::end(arr2)));</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="comment">// 3rd test</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="comment">// [1, 1, 0, 0, 1, 2, 2, 0, 2, 1] return [0, 0, 0, 1, 1, 1, 1, 2, 2, 2]</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    std::vector&lt;uint64_t&gt; array3 = {1, 1, 0, 0, 1, 2, 2, 0, 2, 1};</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    std::vector&lt;uint64_t&gt; arr3 = sorting::dnf_sort::dnfSort(array3);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    assert(std::is_sorted(std::begin(arr3), std::end(arr3)));</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="comment">// 4th test</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="comment">// [2, 2, 2, 0, 0, 1, 1] return [0, 0, 1, 1, 2, 2, 2]</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    std::vector&lt;uint64_t&gt; array4 = {2, 2, 2, 0, 0, 1, 1};</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4... &quot;</span>;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    std::vector&lt;uint64_t&gt; arr4 = sorting::dnf_sort::dnfSort(array4);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    assert(std::is_sorted(std::begin(arr4), std::end(arr4)));</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>}</div>
+</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="foldopen" id="foldopen00109" data-start="{" data-end="}">
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"><a class="line" href="../../d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  109</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <a class="code hl_function" href="../../d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the test</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>}</div>
+</div>
+<div class="ttc" id="adnf__sort_8cpp_html_a621767fe711db64fe57a2ac4987b11f0"><div class="ttname"><a href="../../d6/d1a/dnf__sort_8cpp.html#a621767fe711db64fe57a2ac4987b11f0">sorting::dnf_sort::dnfSort</a></div><div class="ttdeci">std::vector&lt; T &gt; dnfSort(const std::vector&lt; T &gt; &amp;in_arr)</div><div class="ttdoc">The main function implements DNF sort.</div><div class="ttdef"><b>Definition</b> <a href="#l00039">dnf_sort.cpp:39</a></div></div>
+<div class="ttc" id="adnf__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d6/d1a/dnf__sort_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> <a href="#l00074">dnf_sort.cpp:74</a></div></div>
+<div class="ttc" id="adnf__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00109">dnf_sort.cpp:109</a></div></div>
+<div class="ttc" id="anamespacednf__sort_html"><div class="ttname"><a href="../../d9/d75/namespacednf__sort.html">dnf_sort</a></div><div class="ttdoc">Functions for the DNF sort implementation.</div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d6/d1a/dnf__sort_8cpp.html">dnf_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/d1f/class_complex-members.html b/d6/d1f/class_complex-members.html
index 874297386..b9b9a1160 100644
--- a/d6/d1f/class_complex-members.html
+++ b/d6/d1f/class_complex-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d6/d26/classciphers_1_1_hill_cipher.html b/d6/d26/classciphers_1_1_hill_cipher.html
index 0ab010bd9..712fbc15b 100644
--- a/d6/d26/classciphers_1_1_hill_cipher.html
+++ b/d6/d26/classciphers_1_1_hill_cipher.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ciphers::HillCipher Class Reference</title>
+<title>TheAlgorithms/C++: ciphers::HillCipher Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,13 +140,13 @@ Static Public Member Functions</h2></td></tr>
 <tr class="memitem:ab02c7563889bf1e363deb8e21967b706" id="r_ab02c7563889bf1e363deb8e21967b706"><td class="memItemLeft" align="right" valign="top">static <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab02c7563889bf1e363deb8e21967b706">generate_decryption_key</a> (<a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; int &gt; const &amp;encrypt_key)</td></tr>
 <tr class="memdesc:ab02c7563889bf1e363deb8e21967b706"><td class="mdescLeft">&#160;</td><td class="mdescRight">Generate decryption matrix from an encryption matrix key.  <br /></td></tr>
 <tr class="separator:ab02c7563889bf1e363deb8e21967b706"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a405b0a28d66a61239d3565d5256f9cb5" id="r_a405b0a28d66a61239d3565d5256f9cb5"><td class="memItemLeft" align="right" valign="top">static <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; int &gt;, <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a405b0a28d66a61239d3565d5256f9cb5">generate_keys</a> (size_t size, int limit1=0, int limit2=10)</td></tr>
+<tr class="memitem:a405b0a28d66a61239d3565d5256f9cb5" id="r_a405b0a28d66a61239d3565d5256f9cb5"><td class="memItemLeft" align="right" valign="top">static std::pair&lt; <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; int &gt;, <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a405b0a28d66a61239d3565d5256f9cb5">generate_keys</a> (size_t size, int limit1=0, int limit2=10)</td></tr>
 <tr class="memdesc:a405b0a28d66a61239d3565d5256f9cb5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Generate encryption and decryption key pair.  <br /></td></tr>
 <tr class="separator:a405b0a28d66a61239d3565d5256f9cb5"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa8bbb6e4a5749f6008b06602d5103917" id="r_aa8bbb6e4a5749f6008b06602d5103917"><td class="memItemLeft" align="right" valign="top">static const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8bbb6e4a5749f6008b06602d5103917">encrypt_text</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text, const <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; int &gt; &amp;encrypt_key)</td></tr>
+<tr class="memitem:aa8bbb6e4a5749f6008b06602d5103917" id="r_aa8bbb6e4a5749f6008b06602d5103917"><td class="memItemLeft" align="right" valign="top">static const std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8bbb6e4a5749f6008b06602d5103917">encrypt_text</a> (const std::string &amp;text, const <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; int &gt; &amp;encrypt_key)</td></tr>
 <tr class="memdesc:aa8bbb6e4a5749f6008b06602d5103917"><td class="mdescLeft">&#160;</td><td class="mdescRight">Encrypt a given text using a given key.  <br /></td></tr>
 <tr class="separator:aa8bbb6e4a5749f6008b06602d5103917"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a427acfac1dbff3f48a2b071d449d965b" id="r_a427acfac1dbff3f48a2b071d449d965b"><td class="memItemLeft" align="right" valign="top">static const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a427acfac1dbff3f48a2b071d449d965b">decrypt_text</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text, const <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; int &gt; &amp;decrypt_key)</td></tr>
+<tr class="memitem:a427acfac1dbff3f48a2b071d449d965b" id="r_a427acfac1dbff3f48a2b071d449d965b"><td class="memItemLeft" align="right" valign="top">static const std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a427acfac1dbff3f48a2b071d449d965b">decrypt_text</a> (const std::string &amp;text, const <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; int &gt; &amp;decrypt_key)</td></tr>
 <tr class="memdesc:a427acfac1dbff3f48a2b071d449d965b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Decrypt a given text using a given key.  <br /></td></tr>
 <tr class="separator:a427acfac1dbff3f48a2b071d449d965b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
@@ -147,7 +164,7 @@ Static Private Member Functions</h2></td></tr>
 <tr class="memitem:a7760f3665651a0a37937c79c62f219c0"><td class="memTemplItemLeft" align="right" valign="top">static const T&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a7760f3665651a0a37937c79c62f219c0">gcd</a> (T a, T b)</td></tr>
 <tr class="memdesc:a7760f3665651a0a37937c79c62f219c0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute <a href="https://en.wikipedia.org/wiki/Greatest_common_divisor" target="_blank">GCD</a> of two integers using Euler's algorithm.  <br /></td></tr>
 <tr class="separator:a7760f3665651a0a37937c79c62f219c0"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad36cbcc7a458b3f3a2af0c4aa1126590" id="r_ad36cbcc7a458b3f3a2af0c4aa1126590"><td class="memItemLeft" align="right" valign="top">static const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; uint8_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad36cbcc7a458b3f3a2af0c4aa1126590">mat_mul</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; uint8_t &gt; &amp;vector, const <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; int &gt; &amp;key)</td></tr>
+<tr class="memitem:ad36cbcc7a458b3f3a2af0c4aa1126590" id="r_ad36cbcc7a458b3f3a2af0c4aa1126590"><td class="memItemLeft" align="right" valign="top">static const std::valarray&lt; uint8_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad36cbcc7a458b3f3a2af0c4aa1126590">mat_mul</a> (const std::valarray&lt; uint8_t &gt; &amp;vector, const <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; int &gt; &amp;key)</td></tr>
 <tr class="memdesc:ad36cbcc7a458b3f3a2af0c4aa1126590"><td class="mdescLeft">&#160;</td><td class="mdescRight">helper function to perform vector multiplication with encryption or decryption matrix  <br /></td></tr>
 <tr class="separator:ad36cbcc7a458b3f3a2af0c4aa1126590"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a12f727cca9e21f9539cd74b6603adf0c" id="r_a12f727cca9e21f9539cd74b6603adf0c"><td class="memItemLeft" align="right" valign="top">static char&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a12f727cca9e21f9539cd74b6603adf0c">get_idx_char</a> (const uint8_t idx)</td></tr>
@@ -156,7 +173,7 @@ Static Private Member Functions</h2></td></tr>
 <tr class="memitem:ae77cad522fa44b8c985779a7188d2f41" id="r_ae77cad522fa44b8c985779a7188d2f41"><td class="memItemLeft" align="right" valign="top">static uint8_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae77cad522fa44b8c985779a7188d2f41">get_char_idx</a> (const char ch)</td></tr>
 <tr class="memdesc:ae77cad522fa44b8c985779a7188d2f41"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the index of a character in the <a class="el" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">STRKEY</a>.  <br /></td></tr>
 <tr class="separator:ae77cad522fa44b8c985779a7188d2f41"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad667fa0860977f6d6d443fa1dbcd80aa" id="r_ad667fa0860977f6d6d443fa1dbcd80aa"><td class="memItemLeft" align="right" valign="top">static const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad667fa0860977f6d6d443fa1dbcd80aa">codec</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text, const <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; int &gt; &amp;key)</td></tr>
+<tr class="memitem:ad667fa0860977f6d6d443fa1dbcd80aa" id="r_ad667fa0860977f6d6d443fa1dbcd80aa"><td class="memItemLeft" align="right" valign="top">static const std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad667fa0860977f6d6d443fa1dbcd80aa">codec</a> (const std::string &amp;text, const <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; int &gt; &amp;key)</td></tr>
 <tr class="memdesc:ad667fa0860977f6d6d443fa1dbcd80aa"><td class="mdescLeft">&#160;</td><td class="mdescRight">Convenience function to perform block cipher operations. The operations are identical for both encryption and decryption.  <br /></td></tr>
 <tr class="separator:ad667fa0860977f6d6d443fa1dbcd80aa"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a2eb58750b978a93ac5e6eb29e3e570b7" id="r_a2eb58750b978a93ac5e6eb29e3e570b7"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
@@ -167,6 +184,8 @@ Static Private Member Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Hill_cipher" target="_blank">Hill Cipher</a> algorithm. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00082">82</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="ad667fa0860977f6d6d443fa1dbcd80aa" name="ad667fa0860977f6d6d443fa1dbcd80aa"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ad667fa0860977f6d6d443fa1dbcd80aa">&#9670;&#160;</a></span>codec()</h2>
@@ -178,9 +197,9 @@ Static Private Member Functions</h2></td></tr>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname">static const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ciphers::HillCipher::codec </td>
+          <td class="memname">static const std::string ciphers::HillCipher::codec </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -204,16 +223,18 @@ Static Private Member Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>encrypted/decrypted output </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00211">211</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  212</span>                                                           {</div>
-<div class="line"><span class="lineno">  213</span>        <span class="keywordtype">size_t</span> text_len = text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>();</div>
-<div class="line"><span class="lineno">  214</span>        <span class="keywordtype">size_t</span> key_len = key.<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">  213</span>        <span class="keywordtype">size_t</span> text_len = text.length();</div>
+<div class="line"><span class="lineno">  214</span>        <span class="keywordtype">size_t</span> key_len = key.size();</div>
 <div class="line"><span class="lineno">  215</span> </div>
 <div class="line"><span class="lineno">  216</span>        <span class="comment">// length of output string must be a multiple of key_len</span></div>
 <div class="line"><span class="lineno">  217</span>        <span class="comment">// create output string and initialize with &#39;\0&#39; character</span></div>
 <div class="line"><span class="lineno">  218</span>        <span class="keywordtype">size_t</span> L2 = text_len % key_len == 0</div>
 <div class="line"><span class="lineno">  219</span>                        ? text_len</div>
 <div class="line"><span class="lineno">  220</span>                        : text_len + key_len - (text_len % key_len);</div>
-<div class="line"><span class="lineno">  221</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> coded_text(L2, <span class="charliteral">&#39;\0&#39;</span>);</div>
+<div class="line"><span class="lineno">  221</span>        std::string coded_text(L2, <span class="charliteral">&#39;\0&#39;</span>);</div>
 <div class="line"><span class="lineno">  222</span> </div>
 <div class="line"><span class="lineno">  223</span>        <span class="comment">// temporary array for batch processing</span></div>
 <div class="line"><span class="lineno">  224</span>        <span class="keywordtype">int</span> i;</div>
@@ -221,7 +242,7 @@ Static Private Member Functions</h2></td></tr>
 <div class="line"><span class="lineno">  226</span><span class="preprocessor">#pragma parallel omp for private(i)</span></div>
 <div class="line"><span class="lineno">  227</span><span class="preprocessor">#endif</span></div>
 <div class="line"><span class="lineno">  228</span>        <span class="keywordflow">for</span> (i = 0; i &lt; L2 - key_len + 1; i += key_len) {</div>
-<div class="line"><span class="lineno">  229</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;uint8_t&gt;</a> batch_int(key_len);</div>
+<div class="line"><span class="lineno">  229</span>            std::valarray&lt;uint8_t&gt; batch_int(key_len);</div>
 <div class="line"><span class="lineno">  230</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; key_len; j++) {</div>
 <div class="line"><span class="lineno">  231</span>                batch_int[j] = <a class="code hl_function" href="#ae77cad522fa44b8c985779a7188d2f41">get_char_idx</a>(text[i + j]);</div>
 <div class="line"><span class="lineno">  232</span>            }</div>
@@ -236,18 +257,10 @@ Static Private Member Functions</h2></td></tr>
 <div class="line"><span class="lineno">  241</span> </div>
 <div class="line"><span class="lineno">  242</span>        <span class="keywordflow">return</span> coded_text;</div>
 <div class="line"><span class="lineno">  243</span>    }</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_ad36cbcc7a458b3f3a2af0c4aa1126590"><div class="ttname"><a href="#ad36cbcc7a458b3f3a2af0c4aa1126590">ciphers::HillCipher::mat_mul</a></div><div class="ttdeci">static const std::valarray&lt; uint8_t &gt; mat_mul(const std::valarray&lt; uint8_t &gt; &amp;vector, const matrix&lt; int &gt; &amp;key)</div><div class="ttdoc">helper function to perform vector multiplication with encryption or decryption matrix</div><div class="ttdef"><b>Definition</b> hill_cipher.cpp:160</div></div>
-<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_ae77cad522fa44b8c985779a7188d2f41"><div class="ttname"><a href="#ae77cad522fa44b8c985779a7188d2f41">ciphers::HillCipher::get_char_idx</a></div><div class="ttdeci">static uint8_t get_char_idx(const char ch)</div><div class="ttdoc">Get the index of a character in the STRKEY.</div><div class="ttdef"><b>Definition</b> hill_cipher.cpp:191</div></div>
-<div class="ttc" id="anamespaceciphers_html_ab9aec0ccf4b6809f652bb540be87c216"><div class="ttname"><a href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">ciphers::STRKEY</a></div><div class="ttdeci">static const char * STRKEY</div><div class="ttdef"><b>Definition</b> hill_cipher.cpp:74</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::length</a></div><div class="ttdeci">T length(T... args)</div></div>
-<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d26/classciphers_1_1_hill_cipher_ad667fa0860977f6d6d443fa1dbcd80aa_cgraph.svg" width="479" height="188"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_ad36cbcc7a458b3f3a2af0c4aa1126590"><div class="ttname"><a href="#ad36cbcc7a458b3f3a2af0c4aa1126590">ciphers::HillCipher::mat_mul</a></div><div class="ttdeci">static const std::valarray&lt; uint8_t &gt; mat_mul(const std::valarray&lt; uint8_t &gt; &amp;vector, const matrix&lt; int &gt; &amp;key)</div><div class="ttdoc">helper function to perform vector multiplication with encryption or decryption matrix</div><div class="ttdef"><b>Definition</b> <a href="../../d7/db9/hill__cipher_8cpp_source.html#l00160">hill_cipher.cpp:160</a></div></div>
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_ae77cad522fa44b8c985779a7188d2f41"><div class="ttname"><a href="#ae77cad522fa44b8c985779a7188d2f41">ciphers::HillCipher::get_char_idx</a></div><div class="ttdeci">static uint8_t get_char_idx(const char ch)</div><div class="ttdoc">Get the index of a character in the STRKEY.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/db9/hill__cipher_8cpp_source.html#l00191">hill_cipher.cpp:191</a></div></div>
+<div class="ttc" id="anamespaceciphers_html_ab9aec0ccf4b6809f652bb540be87c216"><div class="ttname"><a href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">ciphers::STRKEY</a></div><div class="ttdeci">static const char * STRKEY</div><div class="ttdef"><b>Definition</b> <a href="../../d7/db9/hill__cipher_8cpp_source.html#l00074">hill_cipher.cpp:74</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a427acfac1dbff3f48a2b071d449d965b" name="a427acfac1dbff3f48a2b071d449d965b"></a>
@@ -260,9 +273,9 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname">static const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ciphers::HillCipher::decrypt_text </td>
+          <td class="memname">static const std::string ciphers::HillCipher::decrypt_text </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -286,16 +299,13 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>decrypted text </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00458">458</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  459</span>                                                                          {</div>
 <div class="line"><span class="lineno">  460</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#ad667fa0860977f6d6d443fa1dbcd80aa">codec</a>(text, decrypt_key);</div>
 <div class="line"><span class="lineno">  461</span>    }</div>
-<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_ad667fa0860977f6d6d443fa1dbcd80aa"><div class="ttname"><a href="#ad667fa0860977f6d6d443fa1dbcd80aa">ciphers::HillCipher::codec</a></div><div class="ttdeci">static const std::string codec(const std::string &amp;text, const matrix&lt; int &gt; &amp;key)</div><div class="ttdoc">Convenience function to perform block cipher operations. The operations are identical for both encryp...</div><div class="ttdef"><b>Definition</b> hill_cipher.cpp:211</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d26/classciphers_1_1_hill_cipher_a427acfac1dbff3f48a2b071d449d965b_cgraph.svg" width="655" height="188"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_ad667fa0860977f6d6d443fa1dbcd80aa"><div class="ttname"><a href="#ad667fa0860977f6d6d443fa1dbcd80aa">ciphers::HillCipher::codec</a></div><div class="ttdeci">static const std::string codec(const std::string &amp;text, const matrix&lt; int &gt; &amp;key)</div><div class="ttdoc">Convenience function to perform block cipher operations. The operations are identical for both encryp...</div><div class="ttdef"><b>Definition</b> <a href="../../d7/db9/hill__cipher_8cpp_source.html#l00211">hill_cipher.cpp:211</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8bbb6e4a5749f6008b06602d5103917" name="aa8bbb6e4a5749f6008b06602d5103917"></a>
@@ -308,9 +318,9 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname">static const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ciphers::HillCipher::encrypt_text </td>
+          <td class="memname">static const std::string ciphers::HillCipher::encrypt_text </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -334,15 +344,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>encrypted text </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00446">446</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  447</span>                                                                          {</div>
 <div class="line"><span class="lineno">  448</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#ad667fa0860977f6d6d443fa1dbcd80aa">codec</a>(text, encrypt_key);</div>
 <div class="line"><span class="lineno">  449</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d26/classciphers_1_1_hill_cipher_aa8bbb6e4a5749f6008b06602d5103917_cgraph.svg" width="655" height="188"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7760f3665651a0a37937c79c62f219c0" name="a7760f3665651a0a37937c79c62f219c0"></a>
@@ -383,9 +390,11 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>GCD of \(a\) and \(b\) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00139">139</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  139</span>                                 {</div>
 <div class="line"><span class="lineno">  140</span>        <span class="keywordflow">if</span> (b &gt; a)  <span class="comment">// ensure always a &lt; b</span></div>
-<div class="line"><span class="lineno">  141</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(a, b);</div>
+<div class="line"><span class="lineno">  141</span>            std::swap(a, b);</div>
 <div class="line"><span class="lineno">  142</span> </div>
 <div class="line"><span class="lineno">  143</span>        <span class="keywordflow">while</span> (b != 0) {</div>
 <div class="line"><span class="lineno">  144</span>            T tmp = b;</div>
@@ -395,13 +404,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  148</span> </div>
 <div class="line"><span class="lineno">  149</span>        <span class="keywordflow">return</span> a;</div>
 <div class="line"><span class="lineno">  150</span>    }</div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- 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="../../d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph.svg" width="295" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ab02c7563889bf1e363deb8e21967b706" name="ab02c7563889bf1e363deb8e21967b706"></a>
@@ -435,16 +438,18 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Decryption martix </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00372">372</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  372</span>                                                                               {</div>
-<div class="line"><span class="lineno">  373</span>        <span class="keywordtype">size_t</span> size = encrypt_key.<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">  374</span>        <span class="keywordtype">int</span> L = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strlen.html">std::strlen</a>(<a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">STRKEY</a>);</div>
+<div class="line"><span class="lineno">  373</span>        <span class="keywordtype">size_t</span> size = encrypt_key.size();</div>
+<div class="line"><span class="lineno">  374</span>        <span class="keywordtype">int</span> L = std::strlen(<a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">STRKEY</a>);</div>
 <div class="line"><span class="lineno">  375</span> </div>
-<div class="line"><span class="lineno">  376</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;int&gt;</a> decrypt_key(size, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;int&gt;</a>(size));</div>
+<div class="line"><span class="lineno">  376</span>        <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> decrypt_key(size, std::valarray&lt;int&gt;(size));</div>
 <div class="line"><span class="lineno">  377</span>        <span class="keywordtype">int</span> det_encrypt = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(<a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(encrypt_key));</div>
 <div class="line"><span class="lineno">  378</span> </div>
 <div class="line"><span class="lineno">  379</span>        <span class="keywordtype">int</span> mat_determinant = det_encrypt &lt; 0 ? det_encrypt % L : det_encrypt;</div>
 <div class="line"><span class="lineno">  380</span> </div>
-<div class="line"><span class="lineno">  381</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;double&gt;</a> tmp_inverse = <a class="code hl_function" href="#a2eb58750b978a93ac5e6eb29e3e570b7">get_inverse</a>(encrypt_key);</div>
+<div class="line"><span class="lineno">  381</span>        <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;double&gt;</a> tmp_inverse = <a class="code hl_function" href="#a2eb58750b978a93ac5e6eb29e3e570b7">get_inverse</a>(encrypt_key);</div>
 <div class="line"><span class="lineno">  382</span>        <span class="keywordtype">double</span> d2 = <a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(decrypt_key);</div>
 <div class="line"><span class="lineno">  383</span> </div>
 <div class="line"><span class="lineno">  384</span>        <span class="comment">// find co-prime factor for inversion</span></div>
@@ -457,8 +462,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  391</span>        }</div>
 <div class="line"><span class="lineno">  392</span> </div>
 <div class="line"><span class="lineno">  393</span>        <span class="keywordflow">if</span> (det_inv == -1) {</div>
-<div class="line"><span class="lineno">  394</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Could not find a co-prime for inversion\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  395</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  394</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Could not find a co-prime for inversion\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  395</span>            std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  396</span>        }</div>
 <div class="line"><span class="lineno">  397</span> </div>
 <div class="line"><span class="lineno">  398</span>        mat_determinant = det_inv * det_encrypt;</div>
@@ -470,25 +475,16 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  404</span><span class="preprocessor">#endif</span></div>
 <div class="line"><span class="lineno">  405</span>        <span class="keywordflow">for</span> (i = 0; i &lt; size; i++) {</div>
 <div class="line"><span class="lineno">  406</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; size; j++) {</div>
-<div class="line"><span class="lineno">  407</span>                <span class="keywordtype">int</span> temp = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(tmp_inverse[i][j] * mat_determinant);</div>
+<div class="line"><span class="lineno">  407</span>                <span class="keywordtype">int</span> temp = std::round(tmp_inverse[i][j] * mat_determinant);</div>
 <div class="line"><span class="lineno">  408</span>                decrypt_key[i][j] = modulo(temp, L);</div>
 <div class="line"><span class="lineno">  409</span>            }</div>
 <div class="line"><span class="lineno">  410</span>        }</div>
 <div class="line"><span class="lineno">  411</span>        <span class="keywordflow">return</span> decrypt_key;</div>
 <div class="line"><span class="lineno">  412</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::cerr</a></div></div>
-<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a2eb58750b978a93ac5e6eb29e3e570b7"><div class="ttname"><a href="#a2eb58750b978a93ac5e6eb29e3e570b7">ciphers::HillCipher::get_inverse</a></div><div class="ttdeci">static matrix&lt; double &gt; get_inverse(matrix&lt; T &gt; const &amp;A)</div><div class="ttdef"><b>Definition</b> hill_cipher.cpp:251</div></div>
-<div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
-<div class="ttc" id="alu__decomposition_8h_html_a3108d43bd32c6fb3b3c158476c51ba7f"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a></div><div class="ttdeci">double determinant_lu(const matrix&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> lu_decomposition.h:90</div></div>
-<div class="ttc" id="around_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a></div><div class="ttdeci">T round(T... args)</div></div>
-<div class="ttc" id="astrlen_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strlen.html">std::strlen</a></div><div class="ttdeci">T strlen(T... args)</div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d6/d26/classciphers_1_1_hill_cipher_ab02c7563889bf1e363deb8e21967b706_cgraph.svg" width="100%" height="564"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a2eb58750b978a93ac5e6eb29e3e570b7"><div class="ttname"><a href="#a2eb58750b978a93ac5e6eb29e3e570b7">ciphers::HillCipher::get_inverse</a></div><div class="ttdeci">static matrix&lt; double &gt; get_inverse(matrix&lt; T &gt; const &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d7/db9/hill__cipher_8cpp_source.html#l00251">hill_cipher.cpp:251</a></div></div>
+<div class="ttc" id="alu__decomposition_8h_html_a3108d43bd32c6fb3b3c158476c51ba7f"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a></div><div class="ttdeci">double determinant_lu(const matrix&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbe/lu__decomposition_8h_source.html#l00090">lu_decomposition.h:90</a></div></div>
+<div class="ttc" id="alu__decomposition_8h_html_ac029b636b353cefbb18b2fcc71e427e4"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; matrix</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbe/lu__decomposition_8h_source.html#l00019">lu_decomposition.h:19</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a642f70fb54cb50b00fb6df7c3f2b120e" name="a642f70fb54cb50b00fb6df7c3f2b120e"></a>
@@ -537,12 +533,14 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Encryption martix </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00340">340</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  341</span>                                                                {</div>
-<div class="line"><span class="lineno">  342</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;int&gt;</a> encrypt_key(size, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;int&gt;</a>(size));</div>
-<div class="line"><span class="lineno">  343</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;int&gt;</a> min_mat = encrypt_key;</div>
+<div class="line"><span class="lineno">  342</span>        <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> encrypt_key(size, std::valarray&lt;int&gt;(size));</div>
+<div class="line"><span class="lineno">  343</span>        <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> min_mat = encrypt_key;</div>
 <div class="line"><span class="lineno">  344</span>        <span class="keywordtype">int</span> mat_determinant = -1;  <span class="comment">// because matrix has only ints, the</span></div>
 <div class="line"><span class="lineno">  345</span>                                   <span class="comment">// determinant will also be an int</span></div>
-<div class="line"><span class="lineno">  346</span>        <span class="keywordtype">int</span> L = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strlen.html">std::strlen</a>(<a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">STRKEY</a>);</div>
+<div class="line"><span class="lineno">  346</span>        <span class="keywordtype">int</span> L = std::strlen(<a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">STRKEY</a>);</div>
 <div class="line"><span class="lineno">  347</span> </div>
 <div class="line"><span class="lineno">  348</span>        <span class="keywordtype">double</span> dd;</div>
 <div class="line"><span class="lineno">  349</span>        <span class="keywordflow">do</span> {</div>
@@ -555,21 +553,15 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  356</span>                mat_determinant = (mat_determinant % L);</div>
 <div class="line"><span class="lineno">  357</span>        } <span class="keywordflow">while</span> (std::abs(dd) &gt; 1e3 ||  <span class="comment">// while ill-defined</span></div>
 <div class="line"><span class="lineno">  358</span>                 dd &lt; 0.1 ||  <span class="comment">// while singular or negative determinant</span></div>
-<div class="line"><span class="lineno">  359</span>                 !<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/isfinite.html">std::isfinite</a>(dd) ||  <span class="comment">// while determinant is not finite</span></div>
+<div class="line"><span class="lineno">  359</span>                 !std::isfinite(dd) ||  <span class="comment">// while determinant is not finite</span></div>
 <div class="line"><span class="lineno">  360</span>                 <a class="code hl_function" href="#a7760f3665651a0a37937c79c62f219c0">gcd</a>(mat_determinant, L) != 1);  <span class="comment">// while no common factors</span></div>
 <div class="line"><span class="lineno">  361</span>        <span class="comment">// std::cout &lt;&lt;</span></div>
 <div class="line"><span class="lineno">  362</span> </div>
 <div class="line"><span class="lineno">  363</span>        <span class="keywordflow">return</span> encrypt_key;</div>
 <div class="line"><span class="lineno">  364</span>    }</div>
-<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a629be41c1ab78850963e4ce14e1d11d9"><div class="ttname"><a href="#a629be41c1ab78850963e4ce14e1d11d9">ciphers::HillCipher::rand_range</a></div><div class="ttdeci">static const T2 rand_range(T1 a, T1 b)</div><div class="ttdoc">Function to generate a random integer in a given interval.</div><div class="ttdef"><b>Definition</b> hill_cipher.cpp:93</div></div>
-<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a7760f3665651a0a37937c79c62f219c0"><div class="ttname"><a href="#a7760f3665651a0a37937c79c62f219c0">ciphers::HillCipher::gcd</a></div><div class="ttdeci">static const T gcd(T a, T b)</div><div class="ttdoc">Compute GCD of two integers using Euler's algorithm.</div><div class="ttdef"><b>Definition</b> hill_cipher.cpp:139</div></div>
-<div class="ttc" id="aisfinite_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/isfinite.html">std::isfinite</a></div><div class="ttdeci">T isfinite(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d26/classciphers_1_1_hill_cipher_a642f70fb54cb50b00fb6df7c3f2b120e_cgraph.svg" width="518" height="200"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a629be41c1ab78850963e4ce14e1d11d9"><div class="ttname"><a href="#a629be41c1ab78850963e4ce14e1d11d9">ciphers::HillCipher::rand_range</a></div><div class="ttdeci">static const T2 rand_range(T1 a, T1 b)</div><div class="ttdoc">Function to generate a random integer in a given interval.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/db9/hill__cipher_8cpp_source.html#l00093">hill_cipher.cpp:93</a></div></div>
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a7760f3665651a0a37937c79c62f219c0"><div class="ttname"><a href="#a7760f3665651a0a37937c79c62f219c0">ciphers::HillCipher::gcd</a></div><div class="ttdeci">static const T gcd(T a, T b)</div><div class="ttdoc">Compute GCD of two integers using Euler's algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/db9/hill__cipher_8cpp_source.html#l00139">hill_cipher.cpp:139</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a405b0a28d66a61239d3565d5256f9cb5" name="a405b0a28d66a61239d3565d5256f9cb5"></a>
@@ -582,7 +574,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname">static <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; int &gt;, <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; int &gt; &gt; ciphers::HillCipher::generate_keys </td>
+          <td class="memname">static std::pair&lt; <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; int &gt;, <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; int &gt; &gt; ciphers::HillCipher::generate_keys </td>
           <td>(</td>
           <td class="paramtype">size_t</td>          <td class="paramname"><span class="paramname"><em>size</em></span>, </td>
         </tr>
@@ -613,28 +605,24 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
-<dl class="section return"><dt>Returns</dt><dd><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt;matrix&lt;int&gt;, matrix&lt;int&gt;&gt; encryption and decryption keys as a pair</dd></dl>
+<dl class="section return"><dt>Returns</dt><dd>std::pair&lt;matrix&lt;int&gt;, matrix&lt;int&gt;&gt; encryption and decryption keys as a pair</dd></dl>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="#a642f70fb54cb50b00fb6df7c3f2b120e" title="Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid...">generate_encryption_key</a> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00425">425</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  427</span>                                                                              {</div>
-<div class="line"><span class="lineno">  428</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;int&gt;</a> encrypt_key = <a class="code hl_function" href="#a642f70fb54cb50b00fb6df7c3f2b120e">generate_encryption_key</a>(size);</div>
-<div class="line"><span class="lineno">  429</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;int&gt;</a> decrypt_key = <a class="code hl_function" href="#ab02c7563889bf1e363deb8e21967b706">generate_decryption_key</a>(encrypt_key);</div>
+<div class="line"><span class="lineno">  428</span>        <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> encrypt_key = <a class="code hl_function" href="#a642f70fb54cb50b00fb6df7c3f2b120e">generate_encryption_key</a>(size);</div>
+<div class="line"><span class="lineno">  429</span>        <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> decrypt_key = <a class="code hl_function" href="#ab02c7563889bf1e363deb8e21967b706">generate_decryption_key</a>(encrypt_key);</div>
 <div class="line"><span class="lineno">  430</span>        <span class="keywordtype">double</span> det2 = <a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(decrypt_key);</div>
 <div class="line"><span class="lineno">  431</span>        <span class="keywordflow">while</span> (std::abs(det2) &lt; 0.1 || std::abs(det2) &gt; 1e3) {</div>
 <div class="line"><span class="lineno">  432</span>            encrypt_key = <a class="code hl_function" href="#a642f70fb54cb50b00fb6df7c3f2b120e">generate_encryption_key</a>(size, limit1, limit2);</div>
 <div class="line"><span class="lineno">  433</span>            decrypt_key = <a class="code hl_function" href="#ab02c7563889bf1e363deb8e21967b706">generate_decryption_key</a>(encrypt_key);</div>
 <div class="line"><span class="lineno">  434</span>            det2 = <a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(decrypt_key);</div>
 <div class="line"><span class="lineno">  435</span>        }</div>
-<div class="line"><span class="lineno">  436</span>        <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(encrypt_key, decrypt_key);</div>
+<div class="line"><span class="lineno">  436</span>        <span class="keywordflow">return</span> std::make_pair(encrypt_key, decrypt_key);</div>
 <div class="line"><span class="lineno">  437</span>    }</div>
-<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a642f70fb54cb50b00fb6df7c3f2b120e"><div class="ttname"><a href="#a642f70fb54cb50b00fb6df7c3f2b120e">ciphers::HillCipher::generate_encryption_key</a></div><div class="ttdeci">static matrix&lt; int &gt; generate_encryption_key(size_t size, int limit1=0, int limit2=10)</div><div class="ttdoc">Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid...</div><div class="ttdef"><b>Definition</b> hill_cipher.cpp:340</div></div>
-<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_ab02c7563889bf1e363deb8e21967b706"><div class="ttname"><a href="#ab02c7563889bf1e363deb8e21967b706">ciphers::HillCipher::generate_decryption_key</a></div><div class="ttdeci">static matrix&lt; int &gt; generate_decryption_key(matrix&lt; int &gt; const &amp;encrypt_key)</div><div class="ttdoc">Generate decryption matrix from an encryption matrix key.</div><div class="ttdef"><b>Definition</b> hill_cipher.cpp:372</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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d6/d26/classciphers_1_1_hill_cipher_a405b0a28d66a61239d3565d5256f9cb5_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a642f70fb54cb50b00fb6df7c3f2b120e"><div class="ttname"><a href="#a642f70fb54cb50b00fb6df7c3f2b120e">ciphers::HillCipher::generate_encryption_key</a></div><div class="ttdeci">static matrix&lt; int &gt; generate_encryption_key(size_t size, int limit1=0, int limit2=10)</div><div class="ttdoc">Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid...</div><div class="ttdef"><b>Definition</b> <a href="../../d7/db9/hill__cipher_8cpp_source.html#l00340">hill_cipher.cpp:340</a></div></div>
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_ab02c7563889bf1e363deb8e21967b706"><div class="ttname"><a href="#ab02c7563889bf1e363deb8e21967b706">ciphers::HillCipher::generate_decryption_key</a></div><div class="ttdeci">static matrix&lt; int &gt; generate_decryption_key(matrix&lt; int &gt; const &amp;encrypt_key)</div><div class="ttdoc">Generate decryption matrix from an encryption matrix key.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/db9/hill__cipher_8cpp_source.html#l00372">hill_cipher.cpp:372</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae77cad522fa44b8c985779a7188d2f41" name="ae77cad522fa44b8c985779a7188d2f41"></a>
@@ -668,23 +656,20 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>index of character </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00191">191</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  191</span>                                                      {</div>
-<div class="line"><span class="lineno">  192</span>        <span class="keywordtype">size_t</span> L = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strlen.html">std::strlen</a>(<a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">STRKEY</a>);</div>
+<div class="line"><span class="lineno">  192</span>        <span class="keywordtype">size_t</span> L = std::strlen(<a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">STRKEY</a>);</div>
 <div class="line"><span class="lineno">  193</span> </div>
 <div class="line"><span class="lineno">  194</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> idx = 0; idx &lt;= L; idx++)</div>
 <div class="line"><span class="lineno">  195</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">STRKEY</a>[idx] == ch)</div>
 <div class="line"><span class="lineno">  196</span>                <span class="keywordflow">return</span> idx;</div>
 <div class="line"><span class="lineno">  197</span> </div>
-<div class="line"><span class="lineno">  198</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;:&quot;</span> &lt;&lt; __LINE__ &lt;&lt; <span class="stringliteral">&quot;: (&quot;</span> &lt;&lt; ch</div>
+<div class="line"><span class="lineno">  198</span>        std::cerr &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;:&quot;</span> &lt;&lt; __LINE__ &lt;&lt; <span class="stringliteral">&quot;: (&quot;</span> &lt;&lt; ch</div>
 <div class="line"><span class="lineno">  199</span>                  &lt;&lt; <span class="stringliteral">&quot;) Should not reach here!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  200</span>        <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  201</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d26/classciphers_1_1_hill_cipher_ae77cad522fa44b8c985779a7188d2f41_cgraph.svg" width="267" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a12f727cca9e21f9539cd74b6603adf0c" name="a12f727cca9e21f9539cd74b6603adf0c"></a>
@@ -718,6 +703,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>character at the index </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00183">183</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  183</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">STRKEY</a>[idx]; }</div>
 </div><!-- fragment -->
 </div>
@@ -747,11 +734,13 @@ template&lt;typename T &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>Get matrix inverse using Row-transformations. Given matrix must be a square and non-singular. </p><dl class="section return"><dt>Returns</dt><dd>inverse matrix </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00251">251</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  251</span>                                                          {</div>
 <div class="line"><span class="lineno">  252</span>        <span class="comment">// Assuming A is square matrix</span></div>
-<div class="line"><span class="lineno">  253</span>        <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 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">  253</span>        <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = A.size();</div>
 <div class="line"><span class="lineno">  254</span> </div>
-<div class="line"><span class="lineno">  255</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;double&gt;</a> inverse(N, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(N));</div>
+<div class="line"><span class="lineno">  255</span>        <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;double&gt;</a> inverse(N, std::valarray&lt;double&gt;(N));</div>
 <div class="line"><span class="lineno">  256</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; row++) {</div>
 <div class="line"><span class="lineno">  257</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; col++) {</div>
 <div class="line"><span class="lineno">  258</span>                <span class="comment">// create identity matrix</span></div>
@@ -759,13 +748,13 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  260</span>            }</div>
 <div class="line"><span class="lineno">  261</span>        }</div>
 <div class="line"><span class="lineno">  262</span> </div>
-<div class="line"><span class="lineno">  263</span>        <span class="keywordflow">if</span> (A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() != A[0].size()) {</div>
-<div class="line"><span class="lineno">  264</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;A must be a square matrix!&quot;</span> &lt;&lt; <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">  263</span>        <span class="keywordflow">if</span> (A.size() != A[0].size()) {</div>
+<div class="line"><span class="lineno">  264</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;A must be a square matrix!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  265</span>            <span class="keywordflow">return</span> inverse;</div>
 <div class="line"><span class="lineno">  266</span>        }</div>
 <div class="line"><span class="lineno">  267</span> </div>
 <div class="line"><span class="lineno">  268</span>        <span class="comment">// preallocate a temporary matrix identical to A</span></div>
-<div class="line"><span class="lineno">  269</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;double&gt;</a> temp(N, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(N));</div>
+<div class="line"><span class="lineno">  269</span>        <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;double&gt;</a> temp(N, std::valarray&lt;double&gt;(N));</div>
 <div class="line"><span class="lineno">  270</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; row++) {</div>
 <div class="line"><span class="lineno">  271</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; col++)</div>
 <div class="line"><span class="lineno">  272</span>                temp[row][col] = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(A[row][col]);</div>
@@ -790,7 +779,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  291</span> </div>
 <div class="line"><span class="lineno">  292</span>            <span class="keywordflow">if</span> (temp[row][row] == 0) {</div>
 <div class="line"><span class="lineno">  293</span>                <span class="comment">// Probably a low-rank matrix and hence singular</span></div>
-<div class="line"><span class="lineno">  294</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Low-rank matrix, no inverse!&quot;</span> &lt;&lt; <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">  294</span>                std::cerr &lt;&lt; <span class="stringliteral">&quot;Low-rank matrix, no inverse!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  295</span>                <span class="keywordflow">return</span> inverse;</div>
 <div class="line"><span class="lineno">  296</span>            }</div>
 <div class="line"><span class="lineno">  297</span> </div>
@@ -810,14 +799,8 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  311</span> </div>
 <div class="line"><span class="lineno">  312</span>        <span class="keywordflow">return</span> inverse;</div>
 <div class="line"><span class="lineno">  313</span>    }</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="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d26/classciphers_1_1_hill_cipher_a2eb58750b978a93ac5e6eb29e3e570b7_cgraph.svg" width="303" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad36cbcc7a458b3f3a2af0c4aa1126590" name="ad36cbcc7a458b3f3a2af0c4aa1126590"></a>
@@ -830,9 +813,9 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname">static const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; uint8_t &gt; ciphers::HillCipher::mat_mul </td>
+          <td class="memname">static const std::valarray&lt; uint8_t &gt; ciphers::HillCipher::mat_mul </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; uint8_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>vector</em></span>, </td>
+          <td class="paramtype">const std::valarray&lt; uint8_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>vector</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -856,12 +839,14 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>corresponding encrypted or decrypted text </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00160">160</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  161</span>                                                                    {</div>
-<div class="line"><span class="lineno">  162</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;uint8_t&gt;</a> out(vector);  <span class="comment">// make a copy</span></div>
+<div class="line"><span class="lineno">  162</span>        std::valarray&lt;uint8_t&gt; out(vector);  <span class="comment">// make a copy</span></div>
 <div class="line"><span class="lineno">  163</span> </div>
-<div class="line"><span class="lineno">  164</span>        <span class="keywordtype">size_t</span> L = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strlen.html">std::strlen</a>(<a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">STRKEY</a>);</div>
+<div class="line"><span class="lineno">  164</span>        <span class="keywordtype">size_t</span> L = std::strlen(<a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">STRKEY</a>);</div>
 <div class="line"><span class="lineno">  165</span> </div>
-<div class="line"><span class="lineno">  166</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; key.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
+<div class="line"><span class="lineno">  166</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; key.size(); i++) {</div>
 <div class="line"><span class="lineno">  167</span>            <span class="keywordtype">int</span> tmp = 0;</div>
 <div class="line"><span class="lineno">  168</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; vector.size(); j++) {</div>
 <div class="line"><span class="lineno">  169</span>                tmp += key[i][j] * vector[j];</div>
@@ -871,12 +856,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  173</span> </div>
 <div class="line"><span class="lineno">  174</span>        <span class="keywordflow">return</span> out;</div>
 <div class="line"><span class="lineno">  175</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d26/classciphers_1_1_hill_cipher_ad36cbcc7a458b3f3a2af0c4aa1126590_cgraph.svg" width="303" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a63e7b8e92dff8b9260d6d21c31ecebd0" name="a63e7b8e92dff8b9260d6d21c31ecebd0"></a>
@@ -905,6 +885,8 @@ Here is the call graph for this function:</div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00315">315</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  315</span>                                    {</div>
 <div class="line"><span class="lineno">  316</span>        <span class="keywordtype">int</span> ret = a % b;</div>
 <div class="line"><span class="lineno">  317</span>        <span class="keywordflow">if</span> (ret &lt; 0)</div>
@@ -966,6 +948,8 @@ template&lt;typename T1 , typename T2 &gt; </div>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>determinant of generated random matrix</dd></dl>
 <dl class="section warning"><dt>Warning</dt><dd>There will need to be a balance between the matrix size and the range of random numbers. If the matrix is large, the range of random numbers must be small to have a well defined keys. Or if the matrix is smaller, the random numbers range can be larger. For an 8x8 matrix, range should be no more than \([0,10]\) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00119">119</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  119</span>                                                        {</div>
 <div class="line"><span class="lineno">  120</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e">M</a>-&gt;size(); i++) {</div>
 <div class="line"><span class="lineno">  121</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e">M</a>[0][0].size(); j++) {</div>
@@ -975,13 +959,8 @@ template&lt;typename T1 , typename T2 &gt; </div>
 <div class="line"><span class="lineno">  125</span> </div>
 <div class="line"><span class="lineno">  126</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(*M);</div>
 <div class="line"><span class="lineno">  127</span>    }</div>
-<div class="ttc" id="asparse__table_8cpp_html_af7db62f21983565c64d5d42d2a49888e"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e">data_structures::sparse_table::M</a></div><div class="ttdeci">constexpr uint8_t M</div><div class="ttdoc">ceil(log2(N)).</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:49</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph.svg" width="650" height="148"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asparse__table_8cpp_html_af7db62f21983565c64d5d42d2a49888e"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e">data_structures::sparse_table::M</a></div><div class="ttdeci">constexpr uint8_t M</div><div class="ttdoc">ceil(log2(N)).</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00049">sparse_table.cpp:49</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a629be41c1ab78850963e4ce14e1d11d9" name="a629be41c1ab78850963e4ce14e1d11d9"></a>
@@ -1028,24 +1007,20 @@ template&lt;typename T1 , typename T2 &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>random integer in the interval \([a,b)\) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00093">93</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   93</span>                                           {</div>
 <div class="line"><span class="lineno">   94</span>        <span class="comment">// generate random number between 0 and 1</span></div>
-<div class="line"><span class="lineno">   95</span>        <span class="keywordtype">long</span> <span class="keywordtype">double</span> r = <span class="keyword">static_cast&lt;</span><span class="keywordtype">long</span> <span class="keywordtype">double</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>()) / RAND_MAX;</div>
+<div class="line"><span class="lineno">   95</span>        <span class="keywordtype">long</span> <span class="keywordtype">double</span> r = <span class="keyword">static_cast&lt;</span><span class="keywordtype">long</span> <span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand()) / RAND_MAX;</div>
 <div class="line"><span class="lineno">   96</span> </div>
 <div class="line"><span class="lineno">   97</span>        <span class="comment">// scale and return random number as integer</span></div>
 <div class="line"><span class="lineno">   98</span>        <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>T2<span class="keyword">&gt;</span>(r * (b - a) + a);</div>
 <div class="line"><span class="lineno">   99</span>    }</div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-</div><!-- 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="../../d6/d26/classciphers_1_1_hill_cipher_a629be41c1ab78850963e4ce14e1d11d9_cgraph.svg" width="260" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>ciphers/<a class="el" href="../../d7/db9/hill__cipher_8cpp.html">hill_cipher.cpp</a></li>
+<li>ciphers/<a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a2eb58750b978a93ac5e6eb29e3e570b7_cgraph.map b/d6/d26/classciphers_1_1_hill_cipher_a2eb58750b978a93ac5e6eb29e3e570b7_cgraph.map
deleted file mode 100644
index 120afcea7..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a2eb58750b978a93ac5e6eb29e3e570b7_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="ciphers::HillCipher::get_inverse" name="ciphers::HillCipher::get_inverse">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,23,134,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="204,5,275,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="134,31,188,23,189,28,134,37"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="182,55,297,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="134,50,167,55,166,60,134,55"/>
-</map>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a2eb58750b978a93ac5e6eb29e3e570b7_cgraph.md5 b/d6/d26/classciphers_1_1_hill_cipher_a2eb58750b978a93ac5e6eb29e3e570b7_cgraph.md5
deleted file mode 100644
index 1cfa6b85e..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a2eb58750b978a93ac5e6eb29e3e570b7_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b7092b9587ff23e1db173c94b5e751f8
\ No newline at end of file
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a2eb58750b978a93ac5e6eb29e3e570b7_cgraph.svg b/d6/d26/classciphers_1_1_hill_cipher_a2eb58750b978a93ac5e6eb29e3e570b7_cgraph.svg
deleted file mode 100644
index 040328323..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a2eb58750b978a93ac5e6eb29e3e570b7_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::get_inverse Pages: 1 -->
-<svg width="227pt" height="64pt"
- viewBox="0.00 0.00 226.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>ciphers::HillCipher::get_inverse</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="96.25,-42.88 0,-42.88 0,-12.37 96.25,-12.37 96.25,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="48.12" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::get_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="202.25,-56.25 148.75,-56.25 148.75,-37 202.25,-37 202.25,-56.25"/>
-<text text-anchor="middle" x="175.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-34.81C110.01,-36.85 124.5,-39.05 137.29,-40.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.56,-44.42 146.98,-42.45 137.61,-37.49 136.56,-44.42"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="218.75,-19.25 132.25,-19.25 132.25,0 218.75,0 218.75,-19.25"/>
-<text text-anchor="middle" x="175.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-20.82C104.44,-19.68 112.71,-18.5 120.77,-17.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="121.08,-20.83 130.48,-15.95 120.08,-13.9 121.08,-20.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a2eb58750b978a93ac5e6eb29e3e570b7_cgraph_org.svg b/d6/d26/classciphers_1_1_hill_cipher_a2eb58750b978a93ac5e6eb29e3e570b7_cgraph_org.svg
deleted file mode 100644
index 787dc4c03..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a2eb58750b978a93ac5e6eb29e3e570b7_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::get_inverse Pages: 1 -->
-<svg width="227pt" height="64pt"
- viewBox="0.00 0.00 226.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>ciphers::HillCipher::get_inverse</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="96.25,-42.88 0,-42.88 0,-12.37 96.25,-12.37 96.25,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="48.12" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::get_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="202.25,-56.25 148.75,-56.25 148.75,-37 202.25,-37 202.25,-56.25"/>
-<text text-anchor="middle" x="175.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-34.81C110.01,-36.85 124.5,-39.05 137.29,-40.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.56,-44.42 146.98,-42.45 137.61,-37.49 136.56,-44.42"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="218.75,-19.25 132.25,-19.25 132.25,0 218.75,0 218.75,-19.25"/>
-<text text-anchor="middle" x="175.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-20.82C104.44,-19.68 112.71,-18.5 120.77,-17.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="121.08,-20.83 130.48,-15.95 120.08,-13.9 121.08,-20.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a405b0a28d66a61239d3565d5256f9cb5_cgraph.map b/d6/d26/classciphers_1_1_hill_cipher_a405b0a28d66a61239d3565d5256f9cb5_cgraph.map
deleted file mode 100644
index 029003254..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a405b0a28d66a61239d3565d5256f9cb5_cgraph.map
+++ /dev/null
@@ -1,40 +0,0 @@
-<map id="ciphers::HillCipher::generate_keys" name="ciphers::HillCipher::generate_keys">
-<area shape="rect" id="Node000001" title="Generate encryption and decryption key pair." alt="" coords="5,262,134,302"/>
-<area shape="rect" id="Node000002" href="$d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" title=" " alt="" coords="430,56,536,82"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="92,259,132,226,180,193,244,159,310,129,425,85,427,90,312,134,246,164,183,198,135,231,95,263"/>
-<area shape="rect" id="Node000005" href="$d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706" title="Generate decryption matrix from an encryption matrix key." alt="" coords="182,207,356,248"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="133,262,177,250,178,255,135,267"/>
-<area shape="rect" id="Node000011" href="$d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e" title="Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid..." alt="" coords="182,339,356,380"/>
-<area shape="poly" id="edge14_Node000001_Node000011" title=" " alt="" coords="125,301,201,330,199,335,123,306"/>
-<area shape="rect" id="Node000017" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="215,404,322,430"/>
-<area shape="poly" id="edge21_Node000001_Node000017" title=" " alt="" coords="89,301,129,346,155,369,183,389,201,398,199,403,180,394,151,373,125,350,85,305"/>
-<area shape="rect" id="Node000003" href="$d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" title=" " alt="" coords="609,5,732,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="532,53,605,33,606,38,534,58"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="780,81,895,107"/>
-<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="537,70,764,86,764,92,536,75"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="702,29,795,72,792,77,700,34"/>
-<area shape="poly" id="edge6_Node000005_Node000002" title=" " alt="" coords="288,205,348,146,402,99,426,86,429,90,406,103,351,150,292,209"/>
-<area shape="poly" id="edge12_Node000005_Node000004" title=" " alt="" coords="345,204,354,199,369,185,377,171,386,156,403,143,432,131,470,122,567,107,672,98,764,94,764,99,672,104,567,113,471,127,433,136,405,147,390,159,382,173,373,188,358,203,348,209"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="448,157,517,183"/>
-<area shape="poly" id="edge7_Node000005_Node000006" title=" " alt="" coords="346,204,433,181,434,186,348,209"/>
-<area shape="rect" id="Node000007" href="$d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7" title=" " alt="" coords="418,207,547,248"/>
-<area shape="poly" id="edge8_Node000005_Node000007" title=" " alt="" coords="357,225,403,225,403,230,357,230"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/round.html#" title=" " alt="" coords="443,272,522,298"/>
-<area shape="poly" id="edge11_Node000005_Node000009" title=" " alt="" coords="348,246,429,268,427,273,346,251"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/strlen.html#" title=" " alt="" coords="443,321,522,347"/>
-<area shape="poly" id="edge13_Node000005_Node000010" title=" " alt="" coords="301,246,349,277,405,308,429,317,427,322,403,313,346,282,298,251"/>
-<area shape="poly" id="edge10_Node000007_Node000004" title=" " alt="" coords="544,204,731,136,791,111,793,116,733,141,546,209"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="635,215,706,240"/>
-<area shape="poly" id="edge9_Node000007_Node000008" title=" " alt="" coords="547,225,619,225,619,230,547,230"/>
-<area shape="poly" id="edge20_Node000011_Node000010" title=" " alt="" coords="356,346,427,338,428,343,357,352"/>
-<area shape="rect" id="Node000012" href="$d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0" title="Compute GCD of two integers using Euler&#39;s algorithm." alt="" coords="404,371,561,396"/>
-<area shape="poly" id="edge15_Node000011_Node000012" title=" " alt="" coords="357,367,389,370,388,376,356,372"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/isfinite.html#" title=" " alt="" coords="440,420,525,446"/>
-<area shape="poly" id="edge17_Node000011_Node000014" title=" " alt="" coords="328,378,405,406,426,413,424,418,403,411,326,383"/>
-<area shape="rect" id="Node000015" href="$d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9" title="Function to generate a random integer in a given interval." alt="" coords="418,470,547,510"/>
-<area shape="poly" id="edge18_Node000011_Node000015" title=" " alt="" coords="340,378,358,389,374,407,383,423,391,440,406,456,410,459,407,464,402,460,386,443,378,426,370,410,354,394,337,383"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="631,371,710,396"/>
-<area shape="poly" id="edge16_Node000012_Node000013" title=" " alt="" coords="562,381,616,381,616,386,562,386"/>
-<area shape="rect" id="Node000016" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="634,477,707,503"/>
-<area shape="poly" id="edge19_Node000015_Node000016" title=" " alt="" coords="547,488,619,488,619,493,547,493"/>
-</map>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a405b0a28d66a61239d3565d5256f9cb5_cgraph.md5 b/d6/d26/classciphers_1_1_hill_cipher_a405b0a28d66a61239d3565d5256f9cb5_cgraph.md5
deleted file mode 100644
index 73dd1c4c1..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a405b0a28d66a61239d3565d5256f9cb5_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-13b0558e7de47d803b7a6770926956f5
\ No newline at end of file
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a405b0a28d66a61239d3565d5256f9cb5_cgraph.svg b/d6/d26/classciphers_1_1_hill_cipher_a405b0a28d66a61239d3565d5256f9cb5_cgraph.svg
deleted file mode 100644
index 086ae4980..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a405b0a28d66a61239d3565d5256f9cb5_cgraph.svg
+++ /dev/null
@@ -1,442 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::generate_keys Pages: 1 -->
-<!--zoomable 387 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 675;
-var viewHeight = 387;
-var sectionId = 'dynsection-6';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>ciphers::HillCipher::generate_keys</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Generate encryption and decryption key pair.">
-<polygon fill="#999999" stroke="#666666" points="96.25,-186.5 0,-186.5 0,-156 96.25,-156 96.25,-186.5"/>
-<text text-anchor="start" x="8" y="-173" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="48.12" y="-161.75" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_keys</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.88,-340.88 318.12,-340.88 318.12,-321.62 397.88,-321.62 397.88,-340.88"/>
-<text text-anchor="middle" x="358" y="-327.38" font-family="Helvetica,sans-Serif" font-size="10.00">determinant_lu</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.31,-186.88C82.48,-201.03 107.79,-221.82 132.25,-236.25 192.75,-271.95 269.17,-301.26 315.51,-317.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.3,-320.77 324.9,-320.73 316.59,-314.15 314.3,-320.77"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706" target="_top" xlink:title="Generate decryption matrix from an encryption matrix key.">
-<polygon fill="white" stroke="#666666" points="263,-227.5 132.25,-227.5 132.25,-197 263,-197 263,-227.5"/>
-<text text-anchor="start" x="140.25" y="-214" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="197.62" y="-202.75" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_decryption_key</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.61,-184.45C107.03,-187.35 118.26,-190.47 129.29,-193.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.19,-196.86 138.76,-196.17 130.07,-190.12 128.19,-196.86"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e" target="_top" xlink:title="Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid...">
-<polygon fill="white" stroke="#666666" points="263,-128.5 132.25,-128.5 132.25,-98 263,-98 263,-128.5"/>
-<text text-anchor="start" x="140.25" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="197.62" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_encryption_key</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge14_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge14_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.04,-155.55C106.59,-148.66 127.39,-140.47 146.01,-133.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.24,-136.43 155.27,-129.51 144.68,-129.91 147.24,-136.43"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.88,-79.88 157.38,-79.88 157.38,-60.62 237.88,-60.62 237.88,-79.88"/>
-<text text-anchor="middle" x="197.62" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge21_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge21_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M60.91,-155.63C75.65,-137.17 102.57,-106.75 132.25,-89.25 136.6,-86.68 141.33,-84.44 146.17,-82.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.22,-85.83 155.45,-79.17 144.86,-79.24 147.22,-85.83"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="544.75,-378.88 453,-378.88 453,-359.62 544.75,-359.62 544.75,-378.88"/>
-<text text-anchor="middle" x="498.88" y="-365.38" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M395.85,-341.33C412.54,-345.9 432.48,-351.36 450.29,-356.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="449.3,-359.59 459.87,-358.85 451.15,-352.84 449.3,-359.59"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="667.25,-321.88 580.75,-321.88 580.75,-302.62 667.25,-302.62 667.25,-321.88"/>
-<text text-anchor="middle" x="624" y="-308.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M398.24,-328.43C443.55,-325.17 518.34,-319.78 569.08,-316.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="569.25,-319.63 578.97,-315.42 568.75,-312.65 569.25,-319.63"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M521.6,-359.19C540.86,-350.28 569.22,-337.15 591.06,-327.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="592.51,-330.22 600.11,-322.84 589.57,-323.87 592.51,-330.22"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge6_Node000005_Node000002" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge6_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.58,-227.72C236.73,-251.42 280.48,-295.24 299,-307.25 304.45,-310.78 310.5,-313.97 316.58,-316.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.79,-319.82 325.35,-320.56 317.55,-313.39 314.79,-319.82"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge12_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge12_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.63,-227.95C258.18,-229.28 260.65,-230.71 263,-232.25 283.54,-245.76 277.3,-262.69 299,-274.25 344.56,-298.52 489.51,-307.49 569.21,-310.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="568.84,-314.14 578.96,-311.02 569.1,-307.14 568.84,-314.14"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.62,-264.88 332.38,-264.88 332.38,-245.62 383.62,-245.62 383.62,-264.88"/>
-<text text-anchor="middle" x="358" y="-251.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge7_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge7_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.25,-227.9C277.88,-233.77 301.84,-240.27 320.97,-245.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="319.87,-248.8 330.44,-248.04 321.71,-242.04 319.87,-248.8"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="406.12,-227.5 309.88,-227.5 309.88,-197 406.12,-197 406.12,-227.5"/>
-<text text-anchor="start" x="317.88" y="-214" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="358" y="-202.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge8_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge8_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.5,-212.25C274.91,-212.25 286.73,-212.25 297.98,-212.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.93,-215.75 307.93,-212.25 297.93,-208.75 297.93,-215.75"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387.75,-178.88 328.25,-178.88 328.25,-159.62 387.75,-159.62 387.75,-178.88"/>
-<text text-anchor="middle" x="358" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge11_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge11_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.25,-196.6C276.47,-191.12 298.71,-185.08 317.14,-180.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.88,-183.5 326.61,-177.5 316.05,-176.74 317.88,-183.5"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387.75,-141.88 328.25,-141.88 328.25,-122.62 387.75,-122.62 387.75,-141.88"/>
-<text text-anchor="middle" x="358" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge13_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge13_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.44,-196.52C240.19,-182.84 270.48,-163.23 299,-150.25 304.7,-147.66 310.87,-145.3 317,-143.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.95,-146.57 326.41,-140.19 315.82,-139.91 317.95,-146.57"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge10_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge10_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M404.67,-227.97C442.43,-241.14 497.34,-260.72 544.75,-279.25 559.59,-285.05 575.86,-291.84 589.69,-297.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="588.23,-300.93 598.8,-301.66 590.99,-294.49 588.23,-300.93"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="525.62,-221.88 472.12,-221.88 472.12,-202.62 525.62,-202.62 525.62,-221.88"/>
-<text text-anchor="middle" x="498.88" y="-208.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge9_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M406.4,-212.25C423.98,-212.25 443.66,-212.25 460.25,-212.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="460.2,-215.75 470.2,-212.25 460.2,-208.75 460.2,-215.75"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node10 -->
-<g id="edge20_Node000011_Node000010" class="edge">
-<title>Node11&#45;&gt;Node10</title>
-<g id="a_edge20_Node000011_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.5,-121.03C281.51,-123.19 300.54,-125.48 316.7,-127.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.05,-130.86 326.4,-128.58 316.89,-123.91 316.05,-130.86"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0" target="_top" xlink:title="Compute GCD of two integers using Euler&#39;s algorithm.">
-<polygon fill="white" stroke="#666666" points="417,-104.88 299,-104.88 299,-85.62 417,-85.62 417,-104.88"/>
-<text text-anchor="middle" x="358" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher::gcd</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge15_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge15_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.5,-105.88C271.3,-104.99 279.3,-104.08 287.17,-103.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.54,-106.67 297.08,-102.06 286.75,-99.71 287.54,-106.67"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isfinite.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="390,-67.88 326,-67.88 326,-48.62 390,-48.62 390,-67.88"/>
-<text text-anchor="middle" x="358" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::isfinite</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node14 -->
-<g id="edge17_Node000011_Node000014" class="edge">
-<title>Node11&#45;&gt;Node14</title>
-<g id="a_edge17_Node000011_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M241,-97.51C265.68,-88.37 293.09,-78.26 299,-76.25 304.1,-74.52 309.47,-72.76 314.8,-71.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.67,-74.46 324.15,-68.12 313.57,-67.78 315.67,-74.46"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9" target="_top" xlink:title="Function to generate a random integer in a given interval.">
-<polygon fill="white" stroke="#666666" points="406.12,-30.5 309.88,-30.5 309.88,0 406.12,0 406.12,-30.5"/>
-<text text-anchor="start" x="317.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="358" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::rand_range</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node15 -->
-<g id="edge18_Node000011_Node000015" class="edge">
-<title>Node11&#45;&gt;Node15</title>
-<g id="a_edge18_Node000011_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.69,-97.52C254.4,-95.1 258.92,-92.36 263,-89.25 284.77,-72.64 277.53,-56.24 299,-39.25 300.11,-38.37 301.25,-37.53 302.42,-36.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="303.88,-39.91 310.59,-31.71 300.23,-33.94 303.88,-39.91"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="528.25,-104.88 469.5,-104.88 469.5,-85.62 528.25,-85.62 528.25,-104.88"/>
-<text text-anchor="middle" x="498.88" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge16_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge16_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M417.49,-95.25C431.09,-95.25 445.26,-95.25 457.84,-95.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.84,-98.75 467.84,-95.25 457.84,-91.75 457.84,-98.75"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="526,-24.88 471.75,-24.88 471.75,-5.63 526,-5.63 526,-24.88"/>
-<text text-anchor="middle" x="498.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge19_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge19_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M406.4,-15.25C423.86,-15.25 443.38,-15.25 459.89,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="459.8,-18.75 469.8,-15.25 459.8,-11.75 459.8,-18.75"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classciphers_1_1_hill_cipher_a405b0a28d66a61239d3565d5256f9cb5_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a405b0a28d66a61239d3565d5256f9cb5_cgraph_org.svg b/d6/d26/classciphers_1_1_hill_cipher_a405b0a28d66a61239d3565d5256f9cb5_cgraph_org.svg
deleted file mode 100644
index 085e2db38..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a405b0a28d66a61239d3565d5256f9cb5_cgraph_org.svg
+++ /dev/null
@@ -1,359 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::generate_keys Pages: 1 -->
-<svg width="675pt" height="387pt"
- viewBox="0.00 0.00 675.25 386.88" 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 382.88)">
-<title>ciphers::HillCipher::generate_keys</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Generate encryption and decryption key pair.">
-<polygon fill="#999999" stroke="#666666" points="96.25,-186.5 0,-186.5 0,-156 96.25,-156 96.25,-186.5"/>
-<text text-anchor="start" x="8" y="-173" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="48.12" y="-161.75" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_keys</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.88,-340.88 318.12,-340.88 318.12,-321.62 397.88,-321.62 397.88,-340.88"/>
-<text text-anchor="middle" x="358" y="-327.38" font-family="Helvetica,sans-Serif" font-size="10.00">determinant_lu</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.31,-186.88C82.48,-201.03 107.79,-221.82 132.25,-236.25 192.75,-271.95 269.17,-301.26 315.51,-317.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.3,-320.77 324.9,-320.73 316.59,-314.15 314.3,-320.77"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706" target="_top" xlink:title="Generate decryption matrix from an encryption matrix key.">
-<polygon fill="white" stroke="#666666" points="263,-227.5 132.25,-227.5 132.25,-197 263,-197 263,-227.5"/>
-<text text-anchor="start" x="140.25" y="-214" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="197.62" y="-202.75" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_decryption_key</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.61,-184.45C107.03,-187.35 118.26,-190.47 129.29,-193.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.19,-196.86 138.76,-196.17 130.07,-190.12 128.19,-196.86"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e" target="_top" xlink:title="Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid...">
-<polygon fill="white" stroke="#666666" points="263,-128.5 132.25,-128.5 132.25,-98 263,-98 263,-128.5"/>
-<text text-anchor="start" x="140.25" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="197.62" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_encryption_key</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge14_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge14_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.04,-155.55C106.59,-148.66 127.39,-140.47 146.01,-133.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.24,-136.43 155.27,-129.51 144.68,-129.91 147.24,-136.43"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.88,-79.88 157.38,-79.88 157.38,-60.62 237.88,-60.62 237.88,-79.88"/>
-<text text-anchor="middle" x="197.62" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge21_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge21_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M60.91,-155.63C75.65,-137.17 102.57,-106.75 132.25,-89.25 136.6,-86.68 141.33,-84.44 146.17,-82.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.22,-85.83 155.45,-79.17 144.86,-79.24 147.22,-85.83"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="544.75,-378.88 453,-378.88 453,-359.62 544.75,-359.62 544.75,-378.88"/>
-<text text-anchor="middle" x="498.88" y="-365.38" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M395.85,-341.33C412.54,-345.9 432.48,-351.36 450.29,-356.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="449.3,-359.59 459.87,-358.85 451.15,-352.84 449.3,-359.59"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="667.25,-321.88 580.75,-321.88 580.75,-302.62 667.25,-302.62 667.25,-321.88"/>
-<text text-anchor="middle" x="624" y="-308.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M398.24,-328.43C443.55,-325.17 518.34,-319.78 569.08,-316.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="569.25,-319.63 578.97,-315.42 568.75,-312.65 569.25,-319.63"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M521.6,-359.19C540.86,-350.28 569.22,-337.15 591.06,-327.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="592.51,-330.22 600.11,-322.84 589.57,-323.87 592.51,-330.22"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge6_Node000005_Node000002" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge6_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.58,-227.72C236.73,-251.42 280.48,-295.24 299,-307.25 304.45,-310.78 310.5,-313.97 316.58,-316.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.79,-319.82 325.35,-320.56 317.55,-313.39 314.79,-319.82"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge12_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge12_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.63,-227.95C258.18,-229.28 260.65,-230.71 263,-232.25 283.54,-245.76 277.3,-262.69 299,-274.25 344.56,-298.52 489.51,-307.49 569.21,-310.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="568.84,-314.14 578.96,-311.02 569.1,-307.14 568.84,-314.14"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.62,-264.88 332.38,-264.88 332.38,-245.62 383.62,-245.62 383.62,-264.88"/>
-<text text-anchor="middle" x="358" y="-251.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge7_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge7_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.25,-227.9C277.88,-233.77 301.84,-240.27 320.97,-245.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="319.87,-248.8 330.44,-248.04 321.71,-242.04 319.87,-248.8"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="406.12,-227.5 309.88,-227.5 309.88,-197 406.12,-197 406.12,-227.5"/>
-<text text-anchor="start" x="317.88" y="-214" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="358" y="-202.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge8_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge8_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.5,-212.25C274.91,-212.25 286.73,-212.25 297.98,-212.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.93,-215.75 307.93,-212.25 297.93,-208.75 297.93,-215.75"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387.75,-178.88 328.25,-178.88 328.25,-159.62 387.75,-159.62 387.75,-178.88"/>
-<text text-anchor="middle" x="358" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge11_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge11_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.25,-196.6C276.47,-191.12 298.71,-185.08 317.14,-180.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.88,-183.5 326.61,-177.5 316.05,-176.74 317.88,-183.5"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387.75,-141.88 328.25,-141.88 328.25,-122.62 387.75,-122.62 387.75,-141.88"/>
-<text text-anchor="middle" x="358" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge13_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge13_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.44,-196.52C240.19,-182.84 270.48,-163.23 299,-150.25 304.7,-147.66 310.87,-145.3 317,-143.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.95,-146.57 326.41,-140.19 315.82,-139.91 317.95,-146.57"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge10_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge10_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M404.67,-227.97C442.43,-241.14 497.34,-260.72 544.75,-279.25 559.59,-285.05 575.86,-291.84 589.69,-297.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="588.23,-300.93 598.8,-301.66 590.99,-294.49 588.23,-300.93"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="525.62,-221.88 472.12,-221.88 472.12,-202.62 525.62,-202.62 525.62,-221.88"/>
-<text text-anchor="middle" x="498.88" y="-208.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge9_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M406.4,-212.25C423.98,-212.25 443.66,-212.25 460.25,-212.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="460.2,-215.75 470.2,-212.25 460.2,-208.75 460.2,-215.75"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node10 -->
-<g id="edge20_Node000011_Node000010" class="edge">
-<title>Node11&#45;&gt;Node10</title>
-<g id="a_edge20_Node000011_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.5,-121.03C281.51,-123.19 300.54,-125.48 316.7,-127.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.05,-130.86 326.4,-128.58 316.89,-123.91 316.05,-130.86"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0" target="_top" xlink:title="Compute GCD of two integers using Euler&#39;s algorithm.">
-<polygon fill="white" stroke="#666666" points="417,-104.88 299,-104.88 299,-85.62 417,-85.62 417,-104.88"/>
-<text text-anchor="middle" x="358" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher::gcd</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge15_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge15_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.5,-105.88C271.3,-104.99 279.3,-104.08 287.17,-103.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.54,-106.67 297.08,-102.06 286.75,-99.71 287.54,-106.67"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isfinite.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="390,-67.88 326,-67.88 326,-48.62 390,-48.62 390,-67.88"/>
-<text text-anchor="middle" x="358" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::isfinite</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node14 -->
-<g id="edge17_Node000011_Node000014" class="edge">
-<title>Node11&#45;&gt;Node14</title>
-<g id="a_edge17_Node000011_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M241,-97.51C265.68,-88.37 293.09,-78.26 299,-76.25 304.1,-74.52 309.47,-72.76 314.8,-71.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.67,-74.46 324.15,-68.12 313.57,-67.78 315.67,-74.46"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9" target="_top" xlink:title="Function to generate a random integer in a given interval.">
-<polygon fill="white" stroke="#666666" points="406.12,-30.5 309.88,-30.5 309.88,0 406.12,0 406.12,-30.5"/>
-<text text-anchor="start" x="317.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="358" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::rand_range</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node15 -->
-<g id="edge18_Node000011_Node000015" class="edge">
-<title>Node11&#45;&gt;Node15</title>
-<g id="a_edge18_Node000011_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.69,-97.52C254.4,-95.1 258.92,-92.36 263,-89.25 284.77,-72.64 277.53,-56.24 299,-39.25 300.11,-38.37 301.25,-37.53 302.42,-36.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="303.88,-39.91 310.59,-31.71 300.23,-33.94 303.88,-39.91"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="528.25,-104.88 469.5,-104.88 469.5,-85.62 528.25,-85.62 528.25,-104.88"/>
-<text text-anchor="middle" x="498.88" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge16_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge16_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M417.49,-95.25C431.09,-95.25 445.26,-95.25 457.84,-95.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.84,-98.75 467.84,-95.25 457.84,-91.75 457.84,-98.75"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="526,-24.88 471.75,-24.88 471.75,-5.63 526,-5.63 526,-24.88"/>
-<text text-anchor="middle" x="498.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge19_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge19_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M406.4,-15.25C423.86,-15.25 443.38,-15.25 459.89,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="459.8,-18.75 469.8,-15.25 459.8,-11.75 459.8,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a427acfac1dbff3f48a2b071d449d965b_cgraph.map b/d6/d26/classciphers_1_1_hill_cipher_a427acfac1dbff3f48a2b071d449d965b_cgraph.map
deleted file mode 100644
index 8db607829..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a427acfac1dbff3f48a2b071d449d965b_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="ciphers::HillCipher::decrypt_text" name="ciphers::HillCipher::decrypt_text">
-<area shape="rect" id="Node000001" title="Decrypt a given text using a given key." alt="" coords="5,92,134,133"/>
-<area shape="rect" id="Node000002" href="$d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa" title="Convenience function to perform block cipher operations. The operations are identical for both encryp..." alt="" coords="182,92,310,133"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="134,110,166,110,166,115,134,115"/>
-<area shape="rect" id="Node000003" href="$d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41" title="Get the index of a character in the STRKEY." alt="" coords="358,5,486,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="288,89,364,51,367,56,290,94"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="361,70,483,96"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="310,99,346,93,346,98,311,104"/>
-<area shape="rect" id="Node000006" href="$d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590" title="helper function to perform vector multiplication with encryption or decryption matrix" alt="" coords="358,120,486,161"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="311,120,343,125,342,130,310,125"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="534,154,650,180"/>
-<area shape="poly" id="edge8_Node000002_Node000007" title=" " alt="" coords="277,131,315,153,359,170,399,177,441,180,518,176,519,181,441,185,398,182,357,175,313,158,275,135"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/strlen.html#" title=" " alt="" coords="552,101,632,126"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="466,44,488,55,554,91,552,95,485,60,464,49"/>
-<area shape="poly" id="edge7_Node000006_Node000004" title=" " alt="" coords="486,128,537,120,538,125,487,133"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="487,148,519,153,519,158,486,153"/>
-</map>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a427acfac1dbff3f48a2b071d449d965b_cgraph.md5 b/d6/d26/classciphers_1_1_hill_cipher_a427acfac1dbff3f48a2b071d449d965b_cgraph.md5
deleted file mode 100644
index e097a053b..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a427acfac1dbff3f48a2b071d449d965b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1e9fd15602774b3f85972e8c3ced99fb
\ No newline at end of file
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a427acfac1dbff3f48a2b071d449d965b_cgraph.svg b/d6/d26/classciphers_1_1_hill_cipher_a427acfac1dbff3f48a2b071d449d965b_cgraph.svg
deleted file mode 100644
index 244f22720..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a427acfac1dbff3f48a2b071d449d965b_cgraph.svg
+++ /dev/null
@@ -1,177 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::decrypt_text Pages: 1 -->
-<svg width="491pt" height="141pt"
- viewBox="0.00 0.00 491.25 141.11" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 137.11)">
-<title>ciphers::HillCipher::decrypt_text</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Decrypt a given text using a given key.">
-<polygon fill="#999999" stroke="#666666" points="96.25,-68.11 0,-68.11 0,-37.61 96.25,-37.61 96.25,-68.11"/>
-<text text-anchor="start" x="8" y="-54.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="48.12" y="-43.36" font-family="Helvetica,sans-Serif" font-size="10.00">::decrypt_text</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa" target="_top" xlink:title="Convenience function to perform block cipher operations. The operations are identical for both encryp...">
-<polygon fill="white" stroke="#666666" points="228.5,-68.11 132.25,-68.11 132.25,-37.61 228.5,-37.61 228.5,-68.11"/>
-<text text-anchor="start" x="140.25" y="-54.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="180.38" y="-43.36" font-family="Helvetica,sans-Serif" font-size="10.00">::codec</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-52.86C104.33,-52.86 112.51,-52.86 120.56,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.29,-56.36 130.29,-52.86 120.29,-49.36 120.29,-56.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41" target="_top" xlink:title="Get the index of a character in the STRKEY.">
-<polygon fill="white" stroke="#666666" points="360.75,-133.11 264.5,-133.11 264.5,-102.61 360.75,-102.61 360.75,-133.11"/>
-<text text-anchor="start" x="272.5" y="-119.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="312.62" y="-108.36" font-family="Helvetica,sans-Serif" font-size="10.00">::get_char_idx</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M212.9,-68.59C230.1,-77.17 251.61,-87.9 270.15,-97.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="268.52,-100.26 279.03,-101.59 271.65,-93.99 268.52,-100.26"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.5,-84.48 266.75,-84.48 266.75,-65.23 358.5,-65.23 358.5,-84.48"/>
-<text text-anchor="middle" x="312.62" y="-70.98" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.77,-60.86C237.46,-62.33 246.61,-63.87 255.53,-65.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.72,-68.79 265.16,-67.01 255.89,-61.89 254.72,-68.79"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590" target="_top" xlink:title="helper function to perform vector multiplication with encryption or decryption matrix">
-<polygon fill="white" stroke="#666666" points="360.75,-47.11 264.5,-47.11 264.5,-16.61 360.75,-16.61 360.75,-47.11"/>
-<text text-anchor="start" x="272.5" y="-33.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="312.62" y="-22.36" font-family="Helvetica,sans-Serif" font-size="10.00">::mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.77,-45.21C236.58,-43.96 244.76,-42.64 252.81,-41.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.24,-44.81 262.56,-39.77 252.13,-37.9 253.24,-44.81"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="483.25,-21.48 396.75,-21.48 396.75,-2.23 483.25,-2.23 483.25,-21.48"/>
-<text text-anchor="middle" x="440" y="-7.98" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge8_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge8_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.05,-37.21C219.13,-26.61 242.07,-13.54 264.5,-7.86 303.96,2.14 350.05,0.54 384.95,-3.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="384.48,-6.7 394.82,-4.4 385.31,0.25 384.48,-6.7"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="469.75,-61.48 410.25,-61.48 410.25,-42.23 469.75,-42.23 469.75,-61.48"/>
-<text text-anchor="middle" x="440" y="-47.98" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M344.6,-102.2C349.99,-99.44 355.54,-96.58 360.75,-93.86 377.35,-85.17 395.82,-75.27 410.65,-67.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="412.26,-70.37 419.39,-62.53 408.93,-64.21 412.26,-70.37"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge7_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M361.02,-39.42C373.53,-41.41 386.9,-43.54 398.98,-45.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="398.17,-48.89 408.59,-47 399.27,-41.97 398.17,-48.89"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M361.02,-24.29C368.94,-23.03 377.21,-21.71 385.27,-20.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="385.66,-23.91 394.98,-18.88 384.56,-17 385.66,-23.91"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a427acfac1dbff3f48a2b071d449d965b_cgraph_org.svg b/d6/d26/classciphers_1_1_hill_cipher_a427acfac1dbff3f48a2b071d449d965b_cgraph_org.svg
deleted file mode 100644
index de31e53ce..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a427acfac1dbff3f48a2b071d449d965b_cgraph_org.svg
+++ /dev/null
@@ -1,151 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::decrypt_text Pages: 1 -->
-<svg width="491pt" height="141pt"
- viewBox="0.00 0.00 491.25 141.11" 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 137.11)">
-<title>ciphers::HillCipher::decrypt_text</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Decrypt a given text using a given key.">
-<polygon fill="#999999" stroke="#666666" points="96.25,-68.11 0,-68.11 0,-37.61 96.25,-37.61 96.25,-68.11"/>
-<text text-anchor="start" x="8" y="-54.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="48.12" y="-43.36" font-family="Helvetica,sans-Serif" font-size="10.00">::decrypt_text</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa" target="_top" xlink:title="Convenience function to perform block cipher operations. The operations are identical for both encryp...">
-<polygon fill="white" stroke="#666666" points="228.5,-68.11 132.25,-68.11 132.25,-37.61 228.5,-37.61 228.5,-68.11"/>
-<text text-anchor="start" x="140.25" y="-54.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="180.38" y="-43.36" font-family="Helvetica,sans-Serif" font-size="10.00">::codec</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-52.86C104.33,-52.86 112.51,-52.86 120.56,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.29,-56.36 130.29,-52.86 120.29,-49.36 120.29,-56.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41" target="_top" xlink:title="Get the index of a character in the STRKEY.">
-<polygon fill="white" stroke="#666666" points="360.75,-133.11 264.5,-133.11 264.5,-102.61 360.75,-102.61 360.75,-133.11"/>
-<text text-anchor="start" x="272.5" y="-119.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="312.62" y="-108.36" font-family="Helvetica,sans-Serif" font-size="10.00">::get_char_idx</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M212.9,-68.59C230.1,-77.17 251.61,-87.9 270.15,-97.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="268.52,-100.26 279.03,-101.59 271.65,-93.99 268.52,-100.26"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.5,-84.48 266.75,-84.48 266.75,-65.23 358.5,-65.23 358.5,-84.48"/>
-<text text-anchor="middle" x="312.62" y="-70.98" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.77,-60.86C237.46,-62.33 246.61,-63.87 255.53,-65.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.72,-68.79 265.16,-67.01 255.89,-61.89 254.72,-68.79"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590" target="_top" xlink:title="helper function to perform vector multiplication with encryption or decryption matrix">
-<polygon fill="white" stroke="#666666" points="360.75,-47.11 264.5,-47.11 264.5,-16.61 360.75,-16.61 360.75,-47.11"/>
-<text text-anchor="start" x="272.5" y="-33.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="312.62" y="-22.36" font-family="Helvetica,sans-Serif" font-size="10.00">::mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.77,-45.21C236.58,-43.96 244.76,-42.64 252.81,-41.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.24,-44.81 262.56,-39.77 252.13,-37.9 253.24,-44.81"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="483.25,-21.48 396.75,-21.48 396.75,-2.23 483.25,-2.23 483.25,-21.48"/>
-<text text-anchor="middle" x="440" y="-7.98" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge8_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge8_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.05,-37.21C219.13,-26.61 242.07,-13.54 264.5,-7.86 303.96,2.14 350.05,0.54 384.95,-3.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="384.48,-6.7 394.82,-4.4 385.31,0.25 384.48,-6.7"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="469.75,-61.48 410.25,-61.48 410.25,-42.23 469.75,-42.23 469.75,-61.48"/>
-<text text-anchor="middle" x="440" y="-47.98" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M344.6,-102.2C349.99,-99.44 355.54,-96.58 360.75,-93.86 377.35,-85.17 395.82,-75.27 410.65,-67.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="412.26,-70.37 419.39,-62.53 408.93,-64.21 412.26,-70.37"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge7_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M361.02,-39.42C373.53,-41.41 386.9,-43.54 398.98,-45.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="398.17,-48.89 408.59,-47 399.27,-41.97 398.17,-48.89"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M361.02,-24.29C368.94,-23.03 377.21,-21.71 385.27,-20.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="385.66,-23.91 394.98,-18.88 384.56,-17 385.66,-23.91"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a629be41c1ab78850963e4ce14e1d11d9_cgraph.map b/d6/d26/classciphers_1_1_hill_cipher_a629be41c1ab78850963e4ce14e1d11d9_cgraph.map
deleted file mode 100644
index a1e4ee1f4..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a629be41c1ab78850963e4ce14e1d11d9_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="ciphers::HillCipher::rand_range" name="ciphers::HillCipher::rand_range">
-<area shape="rect" id="Node000001" title="Function to generate a random integer in a given interval." alt="" coords="5,5,134,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="182,13,254,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="134,23,166,23,166,28,134,28"/>
-</map>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a629be41c1ab78850963e4ce14e1d11d9_cgraph.md5 b/d6/d26/classciphers_1_1_hill_cipher_a629be41c1ab78850963e4ce14e1d11d9_cgraph.md5
deleted file mode 100644
index 0e8a0fa7a..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a629be41c1ab78850963e4ce14e1d11d9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8f33398272a72d7d18d0c0dbf5a4dd76
\ No newline at end of file
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a629be41c1ab78850963e4ce14e1d11d9_cgraph.svg b/d6/d26/classciphers_1_1_hill_cipher_a629be41c1ab78850963e4ce14e1d11d9_cgraph.svg
deleted file mode 100644
index 3b0270843..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a629be41c1ab78850963e4ce14e1d11d9_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::rand_range Pages: 1 -->
-<svg width="195pt" height="39pt"
- viewBox="0.00 0.00 194.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>ciphers::HillCipher::rand_range</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to generate a random integer in a given interval.">
-<polygon fill="#999999" stroke="#666666" points="96.25,-30.5 0,-30.5 0,0 96.25,0 96.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="48.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::rand_range</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="186.5,-24.88 132.25,-24.88 132.25,-5.63 186.5,-5.63 186.5,-24.88"/>
-<text text-anchor="middle" x="159.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.73,-15.25C104.74,-15.25 112.97,-15.25 120.69,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.42,-18.75 130.42,-15.25 120.42,-11.75 120.42,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a629be41c1ab78850963e4ce14e1d11d9_cgraph_org.svg b/d6/d26/classciphers_1_1_hill_cipher_a629be41c1ab78850963e4ce14e1d11d9_cgraph_org.svg
deleted file mode 100644
index d89feef13..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a629be41c1ab78850963e4ce14e1d11d9_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::rand_range Pages: 1 -->
-<svg width="195pt" height="39pt"
- viewBox="0.00 0.00 194.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>ciphers::HillCipher::rand_range</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to generate a random integer in a given interval.">
-<polygon fill="#999999" stroke="#666666" points="96.25,-30.5 0,-30.5 0,0 96.25,0 96.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="48.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::rand_range</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="186.5,-24.88 132.25,-24.88 132.25,-5.63 186.5,-5.63 186.5,-24.88"/>
-<text text-anchor="middle" x="159.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.73,-15.25C104.74,-15.25 112.97,-15.25 120.69,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.42,-18.75 130.42,-15.25 120.42,-11.75 120.42,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a642f70fb54cb50b00fb6df7c3f2b120e_cgraph.map b/d6/d26/classciphers_1_1_hill_cipher_a642f70fb54cb50b00fb6df7c3f2b120e_cgraph.map
deleted file mode 100644
index 0b6792975..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a642f70fb54cb50b00fb6df7c3f2b120e_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="ciphers::HillCipher::generate_encryption_key" name="ciphers::HillCipher::generate_encryption_key">
-<area shape="rect" id="Node000001" title="Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid..." alt="" coords="5,76,180,117"/>
-<area shape="rect" id="Node000002" href="$d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0" title="Compute GCD of two integers using Euler&#39;s algorithm." alt="" coords="228,5,385,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="141,74,227,40,244,34,246,39,229,45,143,79"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/isfinite.html#" title=" " alt="" coords="264,55,349,80"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="180,82,248,73,249,78,181,87"/>
-<area shape="rect" id="Node000005" href="$d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9" title="Function to generate a random integer in a given interval." alt="" coords="242,104,370,145"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="181,106,227,112,226,117,180,111"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/strlen.html#" title=" " alt="" coords="267,169,346,195"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="138,115,229,154,253,163,251,168,227,159,136,120"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="433,5,511,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="385,16,418,16,418,21,385,21"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="436,112,508,138"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="371,122,421,122,421,128,371,128"/>
-</map>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a642f70fb54cb50b00fb6df7c3f2b120e_cgraph.md5 b/d6/d26/classciphers_1_1_hill_cipher_a642f70fb54cb50b00fb6df7c3f2b120e_cgraph.md5
deleted file mode 100644
index 18c385f04..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a642f70fb54cb50b00fb6df7c3f2b120e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0ce67b441b24c75245a673faf5d7575e
\ No newline at end of file
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a642f70fb54cb50b00fb6df7c3f2b120e_cgraph.svg b/d6/d26/classciphers_1_1_hill_cipher_a642f70fb54cb50b00fb6df7c3f2b120e_cgraph.svg
deleted file mode 100644
index 447347f31..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a642f70fb54cb50b00fb6df7c3f2b120e_cgraph.svg
+++ /dev/null
@@ -1,157 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::generate_encryption_key Pages: 1 -->
-<svg width="388pt" height="150pt"
- viewBox="0.00 0.00 387.50 150.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 146.25)">
-<title>ciphers::HillCipher::generate_encryption_key</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid...">
-<polygon fill="#999999" stroke="#666666" points="130.75,-88.88 0,-88.88 0,-58.38 130.75,-58.38 130.75,-88.88"/>
-<text text-anchor="start" x="8" y="-75.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="65.38" y="-64.12" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_encryption_key</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0" target="_top" xlink:title="Compute GCD of two integers using Euler&#39;s algorithm.">
-<polygon fill="white" stroke="#666666" points="284.75,-142.25 166.75,-142.25 166.75,-123 284.75,-123 284.75,-142.25"/>
-<text text-anchor="middle" x="225.75" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher::gcd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.32,-89.19C121.32,-97.2 145.13,-106.87 166.75,-114.62 170.93,-116.12 175.3,-117.62 179.69,-119.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.51,-122.36 189.1,-122.09 180.65,-115.7 178.51,-122.36"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isfinite.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257.75,-105.25 193.75,-105.25 193.75,-86 257.75,-86 257.75,-105.25"/>
-<text text-anchor="middle" x="225.75" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::isfinite</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.25,-82.64C148.57,-85.04 166.84,-87.58 182.59,-89.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.67,-93.17 192.06,-91.08 182.64,-86.24 181.67,-93.17"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9" target="_top" xlink:title="Function to generate a random integer in a given interval.">
-<polygon fill="white" stroke="#666666" points="273.88,-67.88 177.62,-67.88 177.62,-37.38 273.88,-37.38 273.88,-67.88"/>
-<text text-anchor="start" x="185.62" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="225.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::rand_range</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.25,-65.02C142.78,-63.49 154.73,-61.91 166.08,-60.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.24,-63.91 175.69,-59.13 165.31,-56.98 166.24,-63.91"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-19.25 196,-19.25 196,0 255.5,0 255.5,-19.25"/>
-<text text-anchor="middle" x="225.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.01,-57.95C118.46,-48.87 143.77,-37.51 166.75,-28.62 172.56,-26.38 178.75,-24.16 184.85,-22.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.8,-25.46 194.19,-18.98 183.6,-18.81 185.8,-25.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="379.5,-142.25 320.75,-142.25 320.75,-123 379.5,-123 379.5,-142.25"/>
-<text text-anchor="middle" x="350.12" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.07,-132.62C293.25,-132.62 301.49,-132.62 309.22,-132.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="308.96,-136.13 318.96,-132.63 308.96,-129.13 308.96,-136.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="377.25,-62.25 323,-62.25 323,-43 377.25,-43 377.25,-62.25"/>
-<text text-anchor="middle" x="350.12" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.06,-52.62C286.47,-52.62 299.69,-52.62 311.51,-52.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="311.28,-56.13 321.28,-52.63 311.28,-49.13 311.28,-56.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a642f70fb54cb50b00fb6df7c3f2b120e_cgraph_org.svg b/d6/d26/classciphers_1_1_hill_cipher_a642f70fb54cb50b00fb6df7c3f2b120e_cgraph_org.svg
deleted file mode 100644
index bba4a1109..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a642f70fb54cb50b00fb6df7c3f2b120e_cgraph_org.svg
+++ /dev/null
@@ -1,131 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::generate_encryption_key Pages: 1 -->
-<svg width="388pt" height="150pt"
- viewBox="0.00 0.00 387.50 150.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 146.25)">
-<title>ciphers::HillCipher::generate_encryption_key</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid...">
-<polygon fill="#999999" stroke="#666666" points="130.75,-88.88 0,-88.88 0,-58.38 130.75,-58.38 130.75,-88.88"/>
-<text text-anchor="start" x="8" y="-75.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="65.38" y="-64.12" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_encryption_key</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0" target="_top" xlink:title="Compute GCD of two integers using Euler&#39;s algorithm.">
-<polygon fill="white" stroke="#666666" points="284.75,-142.25 166.75,-142.25 166.75,-123 284.75,-123 284.75,-142.25"/>
-<text text-anchor="middle" x="225.75" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher::gcd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.32,-89.19C121.32,-97.2 145.13,-106.87 166.75,-114.62 170.93,-116.12 175.3,-117.62 179.69,-119.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.51,-122.36 189.1,-122.09 180.65,-115.7 178.51,-122.36"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isfinite.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257.75,-105.25 193.75,-105.25 193.75,-86 257.75,-86 257.75,-105.25"/>
-<text text-anchor="middle" x="225.75" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::isfinite</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.25,-82.64C148.57,-85.04 166.84,-87.58 182.59,-89.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.67,-93.17 192.06,-91.08 182.64,-86.24 181.67,-93.17"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9" target="_top" xlink:title="Function to generate a random integer in a given interval.">
-<polygon fill="white" stroke="#666666" points="273.88,-67.88 177.62,-67.88 177.62,-37.38 273.88,-37.38 273.88,-67.88"/>
-<text text-anchor="start" x="185.62" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="225.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::rand_range</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.25,-65.02C142.78,-63.49 154.73,-61.91 166.08,-60.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.24,-63.91 175.69,-59.13 165.31,-56.98 166.24,-63.91"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-19.25 196,-19.25 196,0 255.5,0 255.5,-19.25"/>
-<text text-anchor="middle" x="225.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.01,-57.95C118.46,-48.87 143.77,-37.51 166.75,-28.62 172.56,-26.38 178.75,-24.16 184.85,-22.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.8,-25.46 194.19,-18.98 183.6,-18.81 185.8,-25.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="379.5,-142.25 320.75,-142.25 320.75,-123 379.5,-123 379.5,-142.25"/>
-<text text-anchor="middle" x="350.12" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.07,-132.62C293.25,-132.62 301.49,-132.62 309.22,-132.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="308.96,-136.13 318.96,-132.63 308.96,-129.13 308.96,-136.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="377.25,-62.25 323,-62.25 323,-43 377.25,-43 377.25,-62.25"/>
-<text text-anchor="middle" x="350.12" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.06,-52.62C286.47,-52.62 299.69,-52.62 311.51,-52.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="311.28,-56.13 321.28,-52.63 311.28,-49.13 311.28,-56.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph.map b/d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph.map
deleted file mode 100644
index 3d08bfbb7..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph.map
+++ /dev/null
@@ -1,14 +0,0 @@
-<map id="ciphers::HillCipher::rand_range" name="ciphers::HillCipher::rand_range">
-<area shape="rect" id="Node000001" title="Function overload to fill a matrix with random integers in a given interval." alt="" coords="5,74,134,114"/>
-<area shape="rect" id="Node000002" href="$d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" title=" " alt="" coords="193,52,299,78"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="134,81,177,74,178,79,134,86"/>
-<area shape="rect" id="Node000005" href="$d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9" title="Function to generate a random integer in a given interval." alt="" coords="182,102,310,142"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="134,102,167,107,166,112,134,107"/>
-<area shape="rect" id="Node000003" href="$d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" title=" " alt="" coords="358,5,480,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="296,49,353,33,354,38,297,54"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="528,31,644,56"/>
-<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="299,59,513,45,513,51,300,64"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="481,25,513,30,512,35,480,30"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="383,109,455,135"/>
-<area shape="poly" id="edge6_Node000005_Node000006" title=" " alt="" coords="310,120,368,120,368,125,310,125"/>
-</map>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph.md5 b/d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph.md5
deleted file mode 100644
index 8fac02d42..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-26747933d9c87e5e1103a29c2b37738b
\ No newline at end of file
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph.svg b/d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph.svg
deleted file mode 100644
index f3fd3e900..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph.svg
+++ /dev/null
@@ -1,148 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::rand_range Pages: 1 -->
-<svg width="487pt" height="111pt"
- viewBox="0.00 0.00 486.75 110.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 106.88)">
-<title>ciphers::HillCipher::rand_range</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function overload to fill a matrix with random integers in a given interval.">
-<polygon fill="#999999" stroke="#666666" points="96.25,-51.5 0,-51.5 0,-21 96.25,-21 96.25,-51.5"/>
-<text text-anchor="start" x="8" y="-38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="48.12" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">::rand_range</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-67.88 140.5,-67.88 140.5,-48.62 220.25,-48.62 220.25,-67.88"/>
-<text text-anchor="middle" x="180.38" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">determinant_lu</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-44.25C107.09,-46.04 118.35,-47.94 129.04,-49.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.42,-53.19 138.87,-51.41 129.59,-46.29 128.42,-53.19"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9" target="_top" xlink:title="Function to generate a random integer in a given interval.">
-<polygon fill="white" stroke="#666666" points="228.5,-30.5 132.25,-30.5 132.25,0 228.5,0 228.5,-30.5"/>
-<text text-anchor="start" x="140.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="180.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::rand_range</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-28.61C104.33,-27.35 112.51,-26.03 120.56,-24.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.99,-28.21 130.31,-23.16 119.88,-21.3 120.99,-28.21"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="356.25,-102.88 264.5,-102.88 264.5,-83.62 356.25,-83.62 356.25,-102.88"/>
-<text text-anchor="middle" x="310.38" y="-89.38" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M218.4,-68.37C231.8,-72.04 247.13,-76.23 261.34,-80.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.41,-83.49 270.98,-82.75 262.25,-76.74 260.41,-83.49"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="478.75,-83.88 392.25,-83.88 392.25,-64.62 478.75,-64.62 478.75,-83.88"/>
-<text text-anchor="middle" x="435.5" y="-70.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.65,-60.73C263.62,-63.45 332.78,-67.82 380.77,-70.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="380.47,-74.34 390.67,-71.48 380.91,-67.36 380.47,-74.34"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M356.52,-86.28C364.36,-85.07 372.58,-83.81 380.62,-82.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="380.97,-86.05 390.32,-81.07 379.9,-79.13 380.97,-86.05"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="337.5,-24.88 283.25,-24.88 283.25,-5.63 337.5,-5.63 337.5,-24.88"/>
-<text text-anchor="middle" x="310.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.67,-15.25C242.88,-15.25 258.28,-15.25 271.77,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="271.55,-18.75 281.55,-15.25 271.55,-11.75 271.55,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph_org.svg b/d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph_org.svg
deleted file mode 100644
index c0aab8fc1..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a716d0313141499d16f57c0c107f04395_cgraph_org.svg
+++ /dev/null
@@ -1,122 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::rand_range Pages: 1 -->
-<svg width="487pt" height="111pt"
- viewBox="0.00 0.00 486.75 110.88" 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 106.88)">
-<title>ciphers::HillCipher::rand_range</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function overload to fill a matrix with random integers in a given interval.">
-<polygon fill="#999999" stroke="#666666" points="96.25,-51.5 0,-51.5 0,-21 96.25,-21 96.25,-51.5"/>
-<text text-anchor="start" x="8" y="-38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="48.12" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">::rand_range</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-67.88 140.5,-67.88 140.5,-48.62 220.25,-48.62 220.25,-67.88"/>
-<text text-anchor="middle" x="180.38" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">determinant_lu</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-44.25C107.09,-46.04 118.35,-47.94 129.04,-49.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.42,-53.19 138.87,-51.41 129.59,-46.29 128.42,-53.19"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9" target="_top" xlink:title="Function to generate a random integer in a given interval.">
-<polygon fill="white" stroke="#666666" points="228.5,-30.5 132.25,-30.5 132.25,0 228.5,0 228.5,-30.5"/>
-<text text-anchor="start" x="140.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="180.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::rand_range</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-28.61C104.33,-27.35 112.51,-26.03 120.56,-24.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.99,-28.21 130.31,-23.16 119.88,-21.3 120.99,-28.21"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="356.25,-102.88 264.5,-102.88 264.5,-83.62 356.25,-83.62 356.25,-102.88"/>
-<text text-anchor="middle" x="310.38" y="-89.38" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M218.4,-68.37C231.8,-72.04 247.13,-76.23 261.34,-80.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.41,-83.49 270.98,-82.75 262.25,-76.74 260.41,-83.49"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="478.75,-83.88 392.25,-83.88 392.25,-64.62 478.75,-64.62 478.75,-83.88"/>
-<text text-anchor="middle" x="435.5" y="-70.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.65,-60.73C263.62,-63.45 332.78,-67.82 380.77,-70.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="380.47,-74.34 390.67,-71.48 380.91,-67.36 380.47,-74.34"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M356.52,-86.28C364.36,-85.07 372.58,-83.81 380.62,-82.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="380.97,-86.05 390.32,-81.07 379.9,-79.13 380.97,-86.05"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="337.5,-24.88 283.25,-24.88 283.25,-5.63 337.5,-5.63 337.5,-24.88"/>
-<text text-anchor="middle" x="310.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.67,-15.25C242.88,-15.25 258.28,-15.25 271.77,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="271.55,-18.75 281.55,-15.25 271.55,-11.75 271.55,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph.map b/d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph.map
deleted file mode 100644
index 9b27db6f1..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="ciphers::HillCipher::gcd" name="ciphers::HillCipher::gcd">
-<area shape="rect" id="Node000001" title="Compute GCD of two integers using Euler&#39;s algorithm." alt="" coords="5,5,163,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="211,5,289,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="163,16,195,16,195,21,163,21"/>
-</map>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph.md5 b/d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph.md5
deleted file mode 100644
index 137ae192d..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9522b1abdd2e3aa1fc1b2bb1cf1b3219
\ No newline at end of file
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph.svg b/d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph.svg
deleted file mode 100644
index 2d1629e8f..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::gcd Pages: 1 -->
-<svg width="221pt" height="27pt"
- viewBox="0.00 0.00 220.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>ciphers::HillCipher::gcd</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compute GCD of two integers using Euler&#39;s algorithm.">
-<polygon fill="#999999" stroke="#666666" points="118,-19.25 0,-19.25 0,0 118,0 118,-19.25"/>
-<text text-anchor="middle" x="59" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher::gcd</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="212.75,-19.25 154,-19.25 154,0 212.75,0 212.75,-19.25"/>
-<text text-anchor="middle" x="183.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.32,-9.62C126.5,-9.62 134.74,-9.62 142.47,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.21,-13.13 152.21,-9.63 142.21,-6.13 142.21,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph_org.svg b/d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph_org.svg
deleted file mode 100644
index 5a4775e53..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_a7760f3665651a0a37937c79c62f219c0_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::gcd Pages: 1 -->
-<svg width="221pt" height="27pt"
- viewBox="0.00 0.00 220.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>ciphers::HillCipher::gcd</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compute GCD of two integers using Euler&#39;s algorithm.">
-<polygon fill="#999999" stroke="#666666" points="118,-19.25 0,-19.25 0,0 118,0 118,-19.25"/>
-<text text-anchor="middle" x="59" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher::gcd</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="212.75,-19.25 154,-19.25 154,0 212.75,0 212.75,-19.25"/>
-<text text-anchor="middle" x="183.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.32,-9.62C126.5,-9.62 134.74,-9.62 142.47,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.21,-13.13 152.21,-9.63 142.21,-6.13 142.21,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_aa8bbb6e4a5749f6008b06602d5103917_cgraph.map b/d6/d26/classciphers_1_1_hill_cipher_aa8bbb6e4a5749f6008b06602d5103917_cgraph.map
deleted file mode 100644
index 6ac05c5ba..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_aa8bbb6e4a5749f6008b06602d5103917_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="ciphers::HillCipher::encrypt_text" name="ciphers::HillCipher::encrypt_text">
-<area shape="rect" id="Node000001" title="Encrypt a given text using a given key." alt="" coords="5,92,134,133"/>
-<area shape="rect" id="Node000002" href="$d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa" title="Convenience function to perform block cipher operations. The operations are identical for both encryp..." alt="" coords="182,92,310,133"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="134,110,166,110,166,115,134,115"/>
-<area shape="rect" id="Node000003" href="$d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41" title="Get the index of a character in the STRKEY." alt="" coords="358,5,486,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="288,89,364,51,367,56,290,94"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="361,70,483,96"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="310,99,346,93,346,98,311,104"/>
-<area shape="rect" id="Node000006" href="$d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590" title="helper function to perform vector multiplication with encryption or decryption matrix" alt="" coords="358,120,486,161"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="311,120,343,125,342,130,310,125"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="534,154,650,180"/>
-<area shape="poly" id="edge8_Node000002_Node000007" title=" " alt="" coords="277,131,315,153,359,170,399,177,441,180,518,176,519,181,441,185,398,182,357,175,313,158,275,135"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/strlen.html#" title=" " alt="" coords="552,101,632,126"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="466,44,488,55,554,91,552,95,485,60,464,49"/>
-<area shape="poly" id="edge7_Node000006_Node000004" title=" " alt="" coords="486,128,537,120,538,125,487,133"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="487,148,519,153,519,158,486,153"/>
-</map>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_aa8bbb6e4a5749f6008b06602d5103917_cgraph.md5 b/d6/d26/classciphers_1_1_hill_cipher_aa8bbb6e4a5749f6008b06602d5103917_cgraph.md5
deleted file mode 100644
index b1c80fb9d..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_aa8bbb6e4a5749f6008b06602d5103917_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3d7eecba584093d810d2849b78a5ac8e
\ No newline at end of file
diff --git a/d6/d26/classciphers_1_1_hill_cipher_aa8bbb6e4a5749f6008b06602d5103917_cgraph.svg b/d6/d26/classciphers_1_1_hill_cipher_aa8bbb6e4a5749f6008b06602d5103917_cgraph.svg
deleted file mode 100644
index 017d2166a..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_aa8bbb6e4a5749f6008b06602d5103917_cgraph.svg
+++ /dev/null
@@ -1,177 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::encrypt_text Pages: 1 -->
-<svg width="491pt" height="141pt"
- viewBox="0.00 0.00 491.25 141.11" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 137.11)">
-<title>ciphers::HillCipher::encrypt_text</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Encrypt a given text using a given key.">
-<polygon fill="#999999" stroke="#666666" points="96.25,-68.11 0,-68.11 0,-37.61 96.25,-37.61 96.25,-68.11"/>
-<text text-anchor="start" x="8" y="-54.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="48.12" y="-43.36" font-family="Helvetica,sans-Serif" font-size="10.00">::encrypt_text</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa" target="_top" xlink:title="Convenience function to perform block cipher operations. The operations are identical for both encryp...">
-<polygon fill="white" stroke="#666666" points="228.5,-68.11 132.25,-68.11 132.25,-37.61 228.5,-37.61 228.5,-68.11"/>
-<text text-anchor="start" x="140.25" y="-54.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="180.38" y="-43.36" font-family="Helvetica,sans-Serif" font-size="10.00">::codec</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-52.86C104.33,-52.86 112.51,-52.86 120.56,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.29,-56.36 130.29,-52.86 120.29,-49.36 120.29,-56.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41" target="_top" xlink:title="Get the index of a character in the STRKEY.">
-<polygon fill="white" stroke="#666666" points="360.75,-133.11 264.5,-133.11 264.5,-102.61 360.75,-102.61 360.75,-133.11"/>
-<text text-anchor="start" x="272.5" y="-119.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="312.62" y="-108.36" font-family="Helvetica,sans-Serif" font-size="10.00">::get_char_idx</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M212.9,-68.59C230.1,-77.17 251.61,-87.9 270.15,-97.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="268.52,-100.26 279.03,-101.59 271.65,-93.99 268.52,-100.26"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.5,-84.48 266.75,-84.48 266.75,-65.23 358.5,-65.23 358.5,-84.48"/>
-<text text-anchor="middle" x="312.62" y="-70.98" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.77,-60.86C237.46,-62.33 246.61,-63.87 255.53,-65.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.72,-68.79 265.16,-67.01 255.89,-61.89 254.72,-68.79"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590" target="_top" xlink:title="helper function to perform vector multiplication with encryption or decryption matrix">
-<polygon fill="white" stroke="#666666" points="360.75,-47.11 264.5,-47.11 264.5,-16.61 360.75,-16.61 360.75,-47.11"/>
-<text text-anchor="start" x="272.5" y="-33.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="312.62" y="-22.36" font-family="Helvetica,sans-Serif" font-size="10.00">::mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.77,-45.21C236.58,-43.96 244.76,-42.64 252.81,-41.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.24,-44.81 262.56,-39.77 252.13,-37.9 253.24,-44.81"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="483.25,-21.48 396.75,-21.48 396.75,-2.23 483.25,-2.23 483.25,-21.48"/>
-<text text-anchor="middle" x="440" y="-7.98" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge8_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge8_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.05,-37.21C219.13,-26.61 242.07,-13.54 264.5,-7.86 303.96,2.14 350.05,0.54 384.95,-3.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="384.48,-6.7 394.82,-4.4 385.31,0.25 384.48,-6.7"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="469.75,-61.48 410.25,-61.48 410.25,-42.23 469.75,-42.23 469.75,-61.48"/>
-<text text-anchor="middle" x="440" y="-47.98" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M344.6,-102.2C349.99,-99.44 355.54,-96.58 360.75,-93.86 377.35,-85.17 395.82,-75.27 410.65,-67.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="412.26,-70.37 419.39,-62.53 408.93,-64.21 412.26,-70.37"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge7_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M361.02,-39.42C373.53,-41.41 386.9,-43.54 398.98,-45.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="398.17,-48.89 408.59,-47 399.27,-41.97 398.17,-48.89"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M361.02,-24.29C368.94,-23.03 377.21,-21.71 385.27,-20.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="385.66,-23.91 394.98,-18.88 384.56,-17 385.66,-23.91"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_aa8bbb6e4a5749f6008b06602d5103917_cgraph_org.svg b/d6/d26/classciphers_1_1_hill_cipher_aa8bbb6e4a5749f6008b06602d5103917_cgraph_org.svg
deleted file mode 100644
index 32cc56905..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_aa8bbb6e4a5749f6008b06602d5103917_cgraph_org.svg
+++ /dev/null
@@ -1,151 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::encrypt_text Pages: 1 -->
-<svg width="491pt" height="141pt"
- viewBox="0.00 0.00 491.25 141.11" 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 137.11)">
-<title>ciphers::HillCipher::encrypt_text</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Encrypt a given text using a given key.">
-<polygon fill="#999999" stroke="#666666" points="96.25,-68.11 0,-68.11 0,-37.61 96.25,-37.61 96.25,-68.11"/>
-<text text-anchor="start" x="8" y="-54.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="48.12" y="-43.36" font-family="Helvetica,sans-Serif" font-size="10.00">::encrypt_text</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa" target="_top" xlink:title="Convenience function to perform block cipher operations. The operations are identical for both encryp...">
-<polygon fill="white" stroke="#666666" points="228.5,-68.11 132.25,-68.11 132.25,-37.61 228.5,-37.61 228.5,-68.11"/>
-<text text-anchor="start" x="140.25" y="-54.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="180.38" y="-43.36" font-family="Helvetica,sans-Serif" font-size="10.00">::codec</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-52.86C104.33,-52.86 112.51,-52.86 120.56,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.29,-56.36 130.29,-52.86 120.29,-49.36 120.29,-56.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41" target="_top" xlink:title="Get the index of a character in the STRKEY.">
-<polygon fill="white" stroke="#666666" points="360.75,-133.11 264.5,-133.11 264.5,-102.61 360.75,-102.61 360.75,-133.11"/>
-<text text-anchor="start" x="272.5" y="-119.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="312.62" y="-108.36" font-family="Helvetica,sans-Serif" font-size="10.00">::get_char_idx</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M212.9,-68.59C230.1,-77.17 251.61,-87.9 270.15,-97.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="268.52,-100.26 279.03,-101.59 271.65,-93.99 268.52,-100.26"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.5,-84.48 266.75,-84.48 266.75,-65.23 358.5,-65.23 358.5,-84.48"/>
-<text text-anchor="middle" x="312.62" y="-70.98" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.77,-60.86C237.46,-62.33 246.61,-63.87 255.53,-65.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.72,-68.79 265.16,-67.01 255.89,-61.89 254.72,-68.79"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590" target="_top" xlink:title="helper function to perform vector multiplication with encryption or decryption matrix">
-<polygon fill="white" stroke="#666666" points="360.75,-47.11 264.5,-47.11 264.5,-16.61 360.75,-16.61 360.75,-47.11"/>
-<text text-anchor="start" x="272.5" y="-33.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="312.62" y="-22.36" font-family="Helvetica,sans-Serif" font-size="10.00">::mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.77,-45.21C236.58,-43.96 244.76,-42.64 252.81,-41.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.24,-44.81 262.56,-39.77 252.13,-37.9 253.24,-44.81"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="483.25,-21.48 396.75,-21.48 396.75,-2.23 483.25,-2.23 483.25,-21.48"/>
-<text text-anchor="middle" x="440" y="-7.98" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge8_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge8_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.05,-37.21C219.13,-26.61 242.07,-13.54 264.5,-7.86 303.96,2.14 350.05,0.54 384.95,-3.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="384.48,-6.7 394.82,-4.4 385.31,0.25 384.48,-6.7"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="469.75,-61.48 410.25,-61.48 410.25,-42.23 469.75,-42.23 469.75,-61.48"/>
-<text text-anchor="middle" x="440" y="-47.98" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M344.6,-102.2C349.99,-99.44 355.54,-96.58 360.75,-93.86 377.35,-85.17 395.82,-75.27 410.65,-67.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="412.26,-70.37 419.39,-62.53 408.93,-64.21 412.26,-70.37"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge7_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M361.02,-39.42C373.53,-41.41 386.9,-43.54 398.98,-45.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="398.17,-48.89 408.59,-47 399.27,-41.97 398.17,-48.89"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M361.02,-24.29C368.94,-23.03 377.21,-21.71 385.27,-20.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="385.66,-23.91 394.98,-18.88 384.56,-17 385.66,-23.91"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_ab02c7563889bf1e363deb8e21967b706_cgraph.map b/d6/d26/classciphers_1_1_hill_cipher_ab02c7563889bf1e363deb8e21967b706_cgraph.map
deleted file mode 100644
index 6b19da8d2..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_ab02c7563889bf1e363deb8e21967b706_cgraph.map
+++ /dev/null
@@ -1,22 +0,0 @@
-<map id="ciphers::HillCipher::generate_decryption_key" name="ciphers::HillCipher::generate_decryption_key">
-<area shape="rect" id="Node000001" title="Generate decryption matrix from an encryption matrix key." alt="" coords="5,179,180,220"/>
-<area shape="rect" id="Node000002" href="$d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" title=" " alt="" coords="239,56,345,82"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="118,176,167,139,226,99,247,87,250,91,229,103,170,143,121,181"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="574,81,690,107"/>
-<area shape="poly" id="edge10_Node000001_Node000004" title=" " alt="" coords="136,176,179,158,227,142,315,123,405,109,558,95,559,100,405,115,316,128,228,147,181,163,138,181"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="258,157,326,183"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="180,184,242,175,243,180,180,189"/>
-<area shape="rect" id="Node000006" href="$d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7" title=" " alt="" coords="228,207,356,248"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="180,209,213,214,212,219,180,214"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/round.html#" title=" " alt="" coords="252,272,332,298"/>
-<area shape="poly" id="edge9_Node000001_Node000008" title=" " alt="" coords="141,218,229,257,244,263,241,268,227,262,138,223"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/strlen.html#" title=" " alt="" coords="252,321,332,347"/>
-<area shape="poly" id="edge11_Node000001_Node000009" title=" " alt="" coords="116,218,166,263,229,308,239,313,237,318,226,312,162,267,113,222"/>
-<area shape="rect" id="Node000003" href="$d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" title=" " alt="" coords="404,5,526,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="338,53,404,33,405,38,339,58"/>
-<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="346,70,559,86,559,91,345,75"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="497,29,589,72,587,77,494,34"/>
-<area shape="poly" id="edge8_Node000006_Node000004" title=" " alt="" coords="348,204,525,136,585,111,587,116,527,141,350,209"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="430,215,501,240"/>
-<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="356,225,414,225,414,230,356,230"/>
-</map>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_ab02c7563889bf1e363deb8e21967b706_cgraph.md5 b/d6/d26/classciphers_1_1_hill_cipher_ab02c7563889bf1e363deb8e21967b706_cgraph.md5
deleted file mode 100644
index 99a3d4069..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_ab02c7563889bf1e363deb8e21967b706_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-912120f7e679f32f580e4a45945f40ee
\ No newline at end of file
diff --git a/d6/d26/classciphers_1_1_hill_cipher_ab02c7563889bf1e363deb8e21967b706_cgraph.svg b/d6/d26/classciphers_1_1_hill_cipher_ab02c7563889bf1e363deb8e21967b706_cgraph.svg
deleted file mode 100644
index 4faf88d32..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_ab02c7563889bf1e363deb8e21967b706_cgraph.svg
+++ /dev/null
@@ -1,277 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::generate_decryption_key Pages: 1 -->
-<!--zoomable 264 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 521;
-var viewHeight = 264;
-var sectionId = 'dynsection-4';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>ciphers::HillCipher::generate_decryption_key</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Generate decryption matrix from an encryption matrix key.">
-<polygon fill="#999999" stroke="#666666" points="130.75,-125.88 0,-125.88 0,-95.38 130.75,-95.38 130.75,-125.88"/>
-<text text-anchor="start" x="8" y="-112.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="65.38" y="-101.12" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_decryption_key</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-218.25 175,-218.25 175,-199 254.75,-199 254.75,-218.25"/>
-<text text-anchor="middle" x="214.88" y="-204.75" font-family="Helvetica,sans-Serif" font-size="10.00">determinant_lu</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.7,-126.36C105.44,-142.07 137.28,-166.43 166.75,-184.62 171.7,-187.68 177.09,-190.7 182.39,-193.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.51,-196.47 191.01,-197.91 183.7,-190.24 180.51,-196.47"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="513.25,-199.25 426.75,-199.25 426.75,-180 513.25,-180 513.25,-199.25"/>
-<text text-anchor="middle" x="470" y="-185.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge10_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge10_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.63,-126.34C117.96,-135.1 143.26,-145.47 166.75,-151.62 251.82,-173.93 353.9,-183.29 415,-187.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.58,-190.59 424.77,-187.7 415,-183.61 414.58,-190.59"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="240.5,-142.25 189.25,-142.25 189.25,-123 240.5,-123 240.5,-142.25"/>
-<text text-anchor="middle" x="214.88" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.07,-120.27C147.04,-122.66 163.57,-125.12 177.64,-127.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.89,-130.65 187.3,-128.66 177.92,-123.72 176.89,-130.65"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263,-104.88 166.75,-104.88 166.75,-74.38 263,-74.38 263,-104.88"/>
-<text text-anchor="start" x="174.75" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="214.88" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::get_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.07,-101.41C139.08,-100.27 147.23,-99.11 155.15,-97.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.62,-101.45 165.02,-96.58 154.63,-94.52 155.62,-101.45"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="244.62,-56.25 185.12,-56.25 185.12,-37 244.62,-37 244.62,-56.25"/>
-<text text-anchor="middle" x="214.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge9_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge9_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.61,-94.89C119.95,-86.1 144.61,-75.05 166.75,-65.62 170.35,-64.09 174.12,-62.52 177.88,-60.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.02,-64.29 186.96,-57.27 176.38,-57.8 179.02,-64.29"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="244.62,-19.25 185.12,-19.25 185.12,0 244.62,0 244.62,-19.25"/>
-<text text-anchor="middle" x="214.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge11_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge11_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.84,-95.05C100.57,-76.88 133.74,-46.87 166.75,-27.62 169.2,-26.2 171.78,-24.84 174.43,-23.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.63,-26.86 183.39,-19.64 172.83,-20.45 175.63,-26.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="390.75,-256.25 299,-256.25 299,-237 390.75,-237 390.75,-256.25"/>
-<text text-anchor="middle" x="344.88" y="-242.75" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.84,-218.71C265.01,-223.21 283.08,-228.58 299.31,-233.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.16,-236.7 308.74,-236.2 300.15,-229.99 298.16,-236.7"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.15,-205.68C298.12,-202.45 367.28,-197.26 415.27,-193.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="415.46,-197.15 425.17,-192.92 414.93,-190.17 415.46,-197.15"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M367.6,-236.57C386.86,-227.65 415.22,-214.52 437.06,-204.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="438.51,-207.6 446.11,-200.22 435.57,-201.24 438.51,-207.6"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge8_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.08,-105.34C293.59,-118.68 345.66,-138.48 390.75,-156.62 405.43,-162.53 421.55,-169.28 435.33,-175.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="433.84,-178.31 444.41,-179.01 436.58,-171.87 433.84,-178.31"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="371.62,-99.25 318.12,-99.25 318.12,-80 371.62,-80 371.62,-99.25"/>
-<text text-anchor="middle" x="344.88" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.17,-89.62C277.49,-89.62 293.02,-89.62 306.58,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="306.41,-93.13 316.41,-89.63 306.41,-86.13 306.41,-93.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classciphers_1_1_hill_cipher_ab02c7563889bf1e363deb8e21967b706_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_ab02c7563889bf1e363deb8e21967b706_cgraph_org.svg b/d6/d26/classciphers_1_1_hill_cipher_ab02c7563889bf1e363deb8e21967b706_cgraph_org.svg
deleted file mode 100644
index b118ec9ca..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_ab02c7563889bf1e363deb8e21967b706_cgraph_org.svg
+++ /dev/null
@@ -1,194 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::generate_decryption_key Pages: 1 -->
-<svg width="521pt" height="264pt"
- viewBox="0.00 0.00 521.25 264.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 260.25)">
-<title>ciphers::HillCipher::generate_decryption_key</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Generate decryption matrix from an encryption matrix key.">
-<polygon fill="#999999" stroke="#666666" points="130.75,-125.88 0,-125.88 0,-95.38 130.75,-95.38 130.75,-125.88"/>
-<text text-anchor="start" x="8" y="-112.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="65.38" y="-101.12" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_decryption_key</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-218.25 175,-218.25 175,-199 254.75,-199 254.75,-218.25"/>
-<text text-anchor="middle" x="214.88" y="-204.75" font-family="Helvetica,sans-Serif" font-size="10.00">determinant_lu</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.7,-126.36C105.44,-142.07 137.28,-166.43 166.75,-184.62 171.7,-187.68 177.09,-190.7 182.39,-193.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.51,-196.47 191.01,-197.91 183.7,-190.24 180.51,-196.47"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="513.25,-199.25 426.75,-199.25 426.75,-180 513.25,-180 513.25,-199.25"/>
-<text text-anchor="middle" x="470" y="-185.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge10_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge10_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.63,-126.34C117.96,-135.1 143.26,-145.47 166.75,-151.62 251.82,-173.93 353.9,-183.29 415,-187.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.58,-190.59 424.77,-187.7 415,-183.61 414.58,-190.59"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="240.5,-142.25 189.25,-142.25 189.25,-123 240.5,-123 240.5,-142.25"/>
-<text text-anchor="middle" x="214.88" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.07,-120.27C147.04,-122.66 163.57,-125.12 177.64,-127.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.89,-130.65 187.3,-128.66 177.92,-123.72 176.89,-130.65"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263,-104.88 166.75,-104.88 166.75,-74.38 263,-74.38 263,-104.88"/>
-<text text-anchor="start" x="174.75" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="214.88" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::get_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.07,-101.41C139.08,-100.27 147.23,-99.11 155.15,-97.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.62,-101.45 165.02,-96.58 154.63,-94.52 155.62,-101.45"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="244.62,-56.25 185.12,-56.25 185.12,-37 244.62,-37 244.62,-56.25"/>
-<text text-anchor="middle" x="214.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge9_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge9_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.61,-94.89C119.95,-86.1 144.61,-75.05 166.75,-65.62 170.35,-64.09 174.12,-62.52 177.88,-60.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.02,-64.29 186.96,-57.27 176.38,-57.8 179.02,-64.29"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="244.62,-19.25 185.12,-19.25 185.12,0 244.62,0 244.62,-19.25"/>
-<text text-anchor="middle" x="214.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge11_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge11_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.84,-95.05C100.57,-76.88 133.74,-46.87 166.75,-27.62 169.2,-26.2 171.78,-24.84 174.43,-23.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.63,-26.86 183.39,-19.64 172.83,-20.45 175.63,-26.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="390.75,-256.25 299,-256.25 299,-237 390.75,-237 390.75,-256.25"/>
-<text text-anchor="middle" x="344.88" y="-242.75" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.84,-218.71C265.01,-223.21 283.08,-228.58 299.31,-233.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.16,-236.7 308.74,-236.2 300.15,-229.99 298.16,-236.7"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.15,-205.68C298.12,-202.45 367.28,-197.26 415.27,-193.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="415.46,-197.15 425.17,-192.92 414.93,-190.17 415.46,-197.15"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M367.6,-236.57C386.86,-227.65 415.22,-214.52 437.06,-204.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="438.51,-207.6 446.11,-200.22 435.57,-201.24 438.51,-207.6"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge8_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge8_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.08,-105.34C293.59,-118.68 345.66,-138.48 390.75,-156.62 405.43,-162.53 421.55,-169.28 435.33,-175.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="433.84,-178.31 444.41,-179.01 436.58,-171.87 433.84,-178.31"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="371.62,-99.25 318.12,-99.25 318.12,-80 371.62,-80 371.62,-99.25"/>
-<text text-anchor="middle" x="344.88" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.17,-89.62C277.49,-89.62 293.02,-89.62 306.58,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="306.41,-93.13 316.41,-89.63 306.41,-86.13 306.41,-93.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_ad36cbcc7a458b3f3a2af0c4aa1126590_cgraph.map b/d6/d26/classciphers_1_1_hill_cipher_ad36cbcc7a458b3f3a2af0c4aa1126590_cgraph.map
deleted file mode 100644
index 6f5f67a01..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_ad36cbcc7a458b3f3a2af0c4aa1126590_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="ciphers::HillCipher::mat_mul" name="ciphers::HillCipher::mat_mul">
-<area shape="rect" id="Node000001" title="helper function to perform vector multiplication with encryption or decryption matrix" alt="" coords="5,23,134,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="182,5,297,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="134,31,166,26,167,32,134,37"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/strlen.html#" title=" " alt="" coords="200,55,279,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="134,50,185,57,184,62,134,55"/>
-</map>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_ad36cbcc7a458b3f3a2af0c4aa1126590_cgraph.md5 b/d6/d26/classciphers_1_1_hill_cipher_ad36cbcc7a458b3f3a2af0c4aa1126590_cgraph.md5
deleted file mode 100644
index 6d8515304..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_ad36cbcc7a458b3f3a2af0c4aa1126590_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-09476af234198747f53d062967c0e7b6
\ No newline at end of file
diff --git a/d6/d26/classciphers_1_1_hill_cipher_ad36cbcc7a458b3f3a2af0c4aa1126590_cgraph.svg b/d6/d26/classciphers_1_1_hill_cipher_ad36cbcc7a458b3f3a2af0c4aa1126590_cgraph.svg
deleted file mode 100644
index ade278b80..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_ad36cbcc7a458b3f3a2af0c4aa1126590_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::mat_mul Pages: 1 -->
-<svg width="227pt" height="64pt"
- viewBox="0.00 0.00 226.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>ciphers::HillCipher::mat_mul</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="helper function to perform vector multiplication with encryption or decryption matrix">
-<polygon fill="#999999" stroke="#666666" points="96.25,-42.88 0,-42.88 0,-12.37 96.25,-12.37 96.25,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="48.12" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="218.75,-56.25 132.25,-56.25 132.25,-37 218.75,-37 218.75,-56.25"/>
-<text text-anchor="middle" x="175.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-34.81C104.44,-36.01 112.71,-37.26 120.77,-38.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.07,-41.92 130.48,-39.95 121.12,-35 120.07,-41.92"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="205.25,-19.25 145.75,-19.25 145.75,0 205.25,0 205.25,-19.25"/>
-<text text-anchor="middle" x="175.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-20.82C109.03,-19.02 122.4,-17.1 134.48,-15.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.69,-18.88 144.09,-13.99 133.69,-11.95 134.69,-18.88"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_ad36cbcc7a458b3f3a2af0c4aa1126590_cgraph_org.svg b/d6/d26/classciphers_1_1_hill_cipher_ad36cbcc7a458b3f3a2af0c4aa1126590_cgraph_org.svg
deleted file mode 100644
index 521c1213c..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_ad36cbcc7a458b3f3a2af0c4aa1126590_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::mat_mul Pages: 1 -->
-<svg width="227pt" height="64pt"
- viewBox="0.00 0.00 226.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>ciphers::HillCipher::mat_mul</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="helper function to perform vector multiplication with encryption or decryption matrix">
-<polygon fill="#999999" stroke="#666666" points="96.25,-42.88 0,-42.88 0,-12.37 96.25,-12.37 96.25,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="48.12" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="218.75,-56.25 132.25,-56.25 132.25,-37 218.75,-37 218.75,-56.25"/>
-<text text-anchor="middle" x="175.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-34.81C104.44,-36.01 112.71,-37.26 120.77,-38.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.07,-41.92 130.48,-39.95 121.12,-35 120.07,-41.92"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="205.25,-19.25 145.75,-19.25 145.75,0 205.25,0 205.25,-19.25"/>
-<text text-anchor="middle" x="175.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-20.82C109.03,-19.02 122.4,-17.1 134.48,-15.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.69,-18.88 144.09,-13.99 133.69,-11.95 134.69,-18.88"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_ad667fa0860977f6d6d443fa1dbcd80aa_cgraph.map b/d6/d26/classciphers_1_1_hill_cipher_ad667fa0860977f6d6d443fa1dbcd80aa_cgraph.map
deleted file mode 100644
index cc6ccbaf3..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_ad667fa0860977f6d6d443fa1dbcd80aa_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="ciphers::HillCipher::codec" name="ciphers::HillCipher::codec">
-<area shape="rect" id="Node000001" title="Convenience function to perform block cipher operations. The operations are identical for both encryp..." alt="" coords="5,92,134,133"/>
-<area shape="rect" id="Node000002" href="$d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41" title="Get the index of a character in the STRKEY." alt="" coords="182,5,310,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="112,89,188,51,190,56,114,94"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="185,70,307,96"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="134,99,169,93,170,98,134,104"/>
-<area shape="rect" id="Node000005" href="$d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590" title="helper function to perform vector multiplication with encryption or decryption matrix" alt="" coords="182,120,310,161"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="134,120,167,125,166,130,134,125"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="358,154,473,180"/>
-<area shape="poly" id="edge7_Node000001_Node000006" title=" " alt="" coords="101,131,139,153,182,170,223,177,264,180,342,176,342,181,264,185,222,182,181,175,136,158,98,135"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/strlen.html#" title=" " alt="" coords="376,101,455,126"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="290,44,311,55,378,91,375,95,309,60,287,49"/>
-<area shape="poly" id="edge6_Node000005_Node000003" title=" " alt="" coords="310,128,361,120,361,125,311,133"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="311,148,343,153,342,158,310,153"/>
-</map>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_ad667fa0860977f6d6d443fa1dbcd80aa_cgraph.md5 b/d6/d26/classciphers_1_1_hill_cipher_ad667fa0860977f6d6d443fa1dbcd80aa_cgraph.md5
deleted file mode 100644
index 868d8d96d..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_ad667fa0860977f6d6d443fa1dbcd80aa_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6f3cbf785e4364067f878f2539597eb4
\ No newline at end of file
diff --git a/d6/d26/classciphers_1_1_hill_cipher_ad667fa0860977f6d6d443fa1dbcd80aa_cgraph.svg b/d6/d26/classciphers_1_1_hill_cipher_ad667fa0860977f6d6d443fa1dbcd80aa_cgraph.svg
deleted file mode 100644
index 295d7c7da..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_ad667fa0860977f6d6d443fa1dbcd80aa_cgraph.svg
+++ /dev/null
@@ -1,158 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::codec Pages: 1 -->
-<svg width="359pt" height="141pt"
- viewBox="0.00 0.00 359.00 141.11" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 137.11)">
-<title>ciphers::HillCipher::codec</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Convenience function to perform block cipher operations. The operations are identical for both encryp...">
-<polygon fill="#999999" stroke="#666666" points="96.25,-68.11 0,-68.11 0,-37.61 96.25,-37.61 96.25,-68.11"/>
-<text text-anchor="start" x="8" y="-54.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="48.12" y="-43.36" font-family="Helvetica,sans-Serif" font-size="10.00">::codec</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41" target="_top" xlink:title="Get the index of a character in the STRKEY.">
-<polygon fill="white" stroke="#666666" points="228.5,-133.11 132.25,-133.11 132.25,-102.61 228.5,-102.61 228.5,-133.11"/>
-<text text-anchor="start" x="140.25" y="-119.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="180.38" y="-108.36" font-family="Helvetica,sans-Serif" font-size="10.00">::get_char_idx</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.65,-68.59C97.85,-77.17 119.36,-87.9 137.9,-97.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.27,-100.26 146.78,-101.59 139.4,-93.99 136.27,-100.26"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.25,-84.48 134.5,-84.48 134.5,-65.23 226.25,-65.23 226.25,-84.48"/>
-<text text-anchor="middle" x="180.38" y="-70.98" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-60.86C105.21,-62.33 114.36,-63.87 123.28,-65.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.47,-68.79 132.91,-67.01 123.64,-61.89 122.47,-68.79"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590" target="_top" xlink:title="helper function to perform vector multiplication with encryption or decryption matrix">
-<polygon fill="white" stroke="#666666" points="228.5,-47.11 132.25,-47.11 132.25,-16.61 228.5,-16.61 228.5,-47.11"/>
-<text text-anchor="start" x="140.25" y="-33.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="180.38" y="-22.36" font-family="Helvetica,sans-Serif" font-size="10.00">::mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-45.21C104.33,-43.96 112.51,-42.64 120.56,-41.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.99,-44.81 130.31,-39.77 119.88,-37.9 120.99,-44.81"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="351,-21.48 264.5,-21.48 264.5,-2.23 351,-2.23 351,-21.48"/>
-<text text-anchor="middle" x="307.75" y="-7.98" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.8,-37.21C86.88,-26.61 109.82,-13.54 132.25,-7.86 171.71,2.14 217.8,0.54 252.7,-3.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="252.23,-6.7 262.57,-4.4 253.06,0.25 252.23,-6.7"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="337.5,-61.48 278,-61.48 278,-42.23 337.5,-42.23 337.5,-61.48"/>
-<text text-anchor="middle" x="307.75" y="-47.98" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M212.35,-102.2C217.74,-99.44 223.29,-96.58 228.5,-93.86 245.1,-85.17 263.57,-75.27 278.4,-67.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="280.01,-70.37 287.14,-62.53 276.68,-64.21 280.01,-70.37"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge6_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge6_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.77,-39.42C241.28,-41.41 254.65,-43.54 266.73,-45.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.92,-48.89 276.34,-47 267.02,-41.97 265.92,-48.89"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.77,-24.29C236.69,-23.03 244.96,-21.71 253.02,-20.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.41,-23.91 262.73,-18.88 252.31,-17 253.41,-23.91"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_ad667fa0860977f6d6d443fa1dbcd80aa_cgraph_org.svg b/d6/d26/classciphers_1_1_hill_cipher_ad667fa0860977f6d6d443fa1dbcd80aa_cgraph_org.svg
deleted file mode 100644
index e40e4d683..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_ad667fa0860977f6d6d443fa1dbcd80aa_cgraph_org.svg
+++ /dev/null
@@ -1,132 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::codec Pages: 1 -->
-<svg width="359pt" height="141pt"
- viewBox="0.00 0.00 359.00 141.11" 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 137.11)">
-<title>ciphers::HillCipher::codec</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Convenience function to perform block cipher operations. The operations are identical for both encryp...">
-<polygon fill="#999999" stroke="#666666" points="96.25,-68.11 0,-68.11 0,-37.61 96.25,-37.61 96.25,-68.11"/>
-<text text-anchor="start" x="8" y="-54.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="48.12" y="-43.36" font-family="Helvetica,sans-Serif" font-size="10.00">::codec</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41" target="_top" xlink:title="Get the index of a character in the STRKEY.">
-<polygon fill="white" stroke="#666666" points="228.5,-133.11 132.25,-133.11 132.25,-102.61 228.5,-102.61 228.5,-133.11"/>
-<text text-anchor="start" x="140.25" y="-119.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="180.38" y="-108.36" font-family="Helvetica,sans-Serif" font-size="10.00">::get_char_idx</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.65,-68.59C97.85,-77.17 119.36,-87.9 137.9,-97.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.27,-100.26 146.78,-101.59 139.4,-93.99 136.27,-100.26"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.25,-84.48 134.5,-84.48 134.5,-65.23 226.25,-65.23 226.25,-84.48"/>
-<text text-anchor="middle" x="180.38" y="-70.98" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-60.86C105.21,-62.33 114.36,-63.87 123.28,-65.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.47,-68.79 132.91,-67.01 123.64,-61.89 122.47,-68.79"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590" target="_top" xlink:title="helper function to perform vector multiplication with encryption or decryption matrix">
-<polygon fill="white" stroke="#666666" points="228.5,-47.11 132.25,-47.11 132.25,-16.61 228.5,-16.61 228.5,-47.11"/>
-<text text-anchor="start" x="140.25" y="-33.61" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="180.38" y="-22.36" font-family="Helvetica,sans-Serif" font-size="10.00">::mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-45.21C104.33,-43.96 112.51,-42.64 120.56,-41.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.99,-44.81 130.31,-39.77 119.88,-37.9 120.99,-44.81"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="351,-21.48 264.5,-21.48 264.5,-2.23 351,-2.23 351,-21.48"/>
-<text text-anchor="middle" x="307.75" y="-7.98" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.8,-37.21C86.88,-26.61 109.82,-13.54 132.25,-7.86 171.71,2.14 217.8,0.54 252.7,-3.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="252.23,-6.7 262.57,-4.4 253.06,0.25 252.23,-6.7"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="337.5,-61.48 278,-61.48 278,-42.23 337.5,-42.23 337.5,-61.48"/>
-<text text-anchor="middle" x="307.75" y="-47.98" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M212.35,-102.2C217.74,-99.44 223.29,-96.58 228.5,-93.86 245.1,-85.17 263.57,-75.27 278.4,-67.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="280.01,-70.37 287.14,-62.53 276.68,-64.21 280.01,-70.37"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge6_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge6_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.77,-39.42C241.28,-41.41 254.65,-43.54 266.73,-45.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.92,-48.89 276.34,-47 267.02,-41.97 265.92,-48.89"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.77,-24.29C236.69,-23.03 244.96,-21.71 253.02,-20.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.41,-23.91 262.73,-18.88 252.31,-17 253.41,-23.91"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_ae77cad522fa44b8c985779a7188d2f41_cgraph.map b/d6/d26/classciphers_1_1_hill_cipher_ae77cad522fa44b8c985779a7188d2f41_cgraph.map
deleted file mode 100644
index 61dade0b2..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_ae77cad522fa44b8c985779a7188d2f41_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="ciphers::HillCipher::get_char_idx" name="ciphers::HillCipher::get_char_idx">
-<area shape="rect" id="Node000001" title="Get the index of a character in the STRKEY." alt="" coords="5,5,134,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/strlen.html#" title=" " alt="" coords="182,13,261,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="134,23,166,23,166,28,134,28"/>
-</map>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_ae77cad522fa44b8c985779a7188d2f41_cgraph.md5 b/d6/d26/classciphers_1_1_hill_cipher_ae77cad522fa44b8c985779a7188d2f41_cgraph.md5
deleted file mode 100644
index e97ec9ebb..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_ae77cad522fa44b8c985779a7188d2f41_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-96b430abeee89a28af9838ad7cee68ff
\ No newline at end of file
diff --git a/d6/d26/classciphers_1_1_hill_cipher_ae77cad522fa44b8c985779a7188d2f41_cgraph.svg b/d6/d26/classciphers_1_1_hill_cipher_ae77cad522fa44b8c985779a7188d2f41_cgraph.svg
deleted file mode 100644
index f6bc420b9..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_ae77cad522fa44b8c985779a7188d2f41_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::get_char_idx Pages: 1 -->
-<svg width="200pt" height="39pt"
- viewBox="0.00 0.00 199.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>ciphers::HillCipher::get_char_idx</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get the index of a character in the STRKEY.">
-<polygon fill="#999999" stroke="#666666" points="96.25,-30.5 0,-30.5 0,0 96.25,0 96.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="48.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_char_idx</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191.75,-24.88 132.25,-24.88 132.25,-5.63 191.75,-5.63 191.75,-24.88"/>
-<text text-anchor="middle" x="162" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.57,-15.25C104.56,-15.25 112.78,-15.25 120.57,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.46,-18.75 130.46,-15.25 120.46,-11.75 120.46,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d26/classciphers_1_1_hill_cipher_ae77cad522fa44b8c985779a7188d2f41_cgraph_org.svg b/d6/d26/classciphers_1_1_hill_cipher_ae77cad522fa44b8c985779a7188d2f41_cgraph_org.svg
deleted file mode 100644
index a42fd8a51..000000000
--- a/d6/d26/classciphers_1_1_hill_cipher_ae77cad522fa44b8c985779a7188d2f41_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::HillCipher::get_char_idx Pages: 1 -->
-<svg width="200pt" height="39pt"
- viewBox="0.00 0.00 199.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>ciphers::HillCipher::get_char_idx</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get the index of a character in the STRKEY.">
-<polygon fill="#999999" stroke="#666666" points="96.25,-30.5 0,-30.5 0,0 96.25,0 96.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="48.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_char_idx</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191.75,-24.88 132.25,-24.88 132.25,-5.63 191.75,-5.63 191.75,-24.88"/>
-<text text-anchor="middle" x="162" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.57,-15.25C104.56,-15.25 112.78,-15.25 120.57,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.46,-18.75 130.46,-15.25 120.46,-11.75 120.46,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d26/house__robber_8cpp.html b/d6/d26/house__robber_8cpp.html
index b617cb1a7..0bb2ce94e 100644
--- a/d6/d26/house__robber_8cpp.html
+++ b/d6/d26/house__robber_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/house_robber.cpp File Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming/house_robber.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for house_robber.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/dd7/house__robber_8cpp__incl.svg" width="419" height="126"><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">
+</div>
+<p><a href="../../d6/d26/house__robber_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
@@ -135,7 +154,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a1e497c3e3f169afe5baaae6a5d40cbc8" id="r_a1e497c3e3f169afe5baaae6a5d40cbc8"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1e497c3e3f169afe5baaae6a5d40cbc8">dynamic_programming::house_robber::houseRobber</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint32_t &gt; &amp;money, const uint32_t &amp;n)</td></tr>
+<tr class="memitem:a1e497c3e3f169afe5baaae6a5d40cbc8" id="r_a1e497c3e3f169afe5baaae6a5d40cbc8"><td class="memItemLeft" align="right" valign="top">std::uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1e497c3e3f169afe5baaae6a5d40cbc8">dynamic_programming::house_robber::houseRobber</a> (const std::vector&lt; uint32_t &gt; &amp;money, const uint32_t &amp;n)</td></tr>
 <tr class="memdesc:a1e497c3e3f169afe5baaae6a5d40cbc8"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function that implements the House Robber algorithm using dynamic programming.  <br /></td></tr>
 <tr class="separator:a1e497c3e3f169afe5baaae6a5d40cbc8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of <a href="https://labuladong.gitbook.io/algo-en/i.-dynamic-programming/houserobber" target="_blank">House Robber Problem</a> algorithm. </p>
 <p><a class="el" href="../../dd/d4f/class_solution.html">Solution</a> of House robber problem uses a dynamic programming concept that works in \(O(n)\) time and works in \(O(1)\) space. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Swastyy" target="_blank">Swastika Gupta</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/d26/house__robber_8cpp_source.html">house_robber.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a1e497c3e3f169afe5baaae6a5d40cbc8" name="a1e497c3e3f169afe5baaae6a5d40cbc8"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a1e497c3e3f169afe5baaae6a5d40cbc8">&#9670;&#160;</a></span>houseRobber()</h2>
@@ -156,9 +177,9 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> dynamic_programming::house_robber::houseRobber </td>
+          <td class="memname">std::uint32_t dynamic_programming::house_robber::houseRobber </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>money</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; uint32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>money</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -177,6 +198,8 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>maximum amount of money that can be robbed </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d26/house__robber_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../d6/d26/house__robber_8cpp_source.html">house_robber.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   37</span>                                             {</div>
 <div class="line"><span class="lineno">   38</span>    <span class="keywordflow">if</span> (n == 0) {  <span class="comment">// if there is no house</span></div>
 <div class="line"><span class="lineno">   39</span>        <span class="keywordflow">return</span> 0;</div>
@@ -186,26 +209,20 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   43</span>    }</div>
 <div class="line"><span class="lineno">   44</span>    <span class="keywordflow">if</span> (n == 2) {  <span class="comment">// if there are two houses, one with the maximum amount of</span></div>
 <div class="line"><span class="lineno">   45</span>                   <span class="comment">// money will be robbed</span></div>
-<div class="line"><span class="lineno">   46</span>        <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(money[0], money[1]);</div>
+<div class="line"><span class="lineno">   46</span>        <span class="keywordflow">return</span> std::max(money[0], money[1]);</div>
 <div class="line"><span class="lineno">   47</span>    }</div>
 <div class="line"><span class="lineno">   48</span>    uint32_t max_value = 0;  <span class="comment">// contains maximum stolen value at the end</span></div>
 <div class="line"><span class="lineno">   49</span>    uint32_t value1 = money[0];</div>
-<div class="line"><span class="lineno">   50</span>    uint32_t value2 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(money[0], money[1]);</div>
+<div class="line"><span class="lineno">   50</span>    uint32_t value2 = std::max(money[0], money[1]);</div>
 <div class="line"><span class="lineno">   51</span>    <span class="keywordflow">for</span> (uint32_t i = 2; i &lt; n; i++) {</div>
-<div class="line"><span class="lineno">   52</span>        max_value = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(money[i] + value1, value2);</div>
+<div class="line"><span class="lineno">   52</span>        max_value = std::max(money[i] + value1, value2);</div>
 <div class="line"><span class="lineno">   53</span>        value1 = value2;</div>
 <div class="line"><span class="lineno">   54</span>        value2 = max_value;</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="keywordflow">return</span> max_value;</div>
 <div class="line"><span class="lineno">   58</span>}</div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-</div><!-- 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="../../d6/d26/house__robber_8cpp_a1e497c3e3f169afe5baaae6a5d40cbc8_cgraph.svg" width="324" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -225,17 +242,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d26/house__robber_8cpp_source.html#l00111">111</a> of file <a class="el" href="../../d6/d26/house__robber_8cpp_source.html">house_robber.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  111</span>           {</div>
 <div class="line"><span class="lineno">  112</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  113</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  114</span>}</div>
-<div class="ttc" id="ahouse__robber_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> house_robber.cpp:66</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d26/house__robber_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="315" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ahouse__robber_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d26/house__robber_8cpp_source.html#l00066">house_robber.cpp:66</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -263,56 +277,49 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d26/house__robber_8cpp_source.html#l00066">66</a> of file <a class="el" href="../../d6/d26/house__robber_8cpp_source.html">house_robber.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   66</span>                   {</div>
 <div class="line"><span class="lineno">   67</span>    <span class="comment">// Test 1</span></div>
 <div class="line"><span class="lineno">   68</span>    <span class="comment">// [1, 2, 3, 1] return 4</span></div>
-<div class="line"><span class="lineno">   69</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a> array1 = {1, 2, 3, 1};</div>
-<div class="line"><span class="lineno">   70</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
+<div class="line"><span class="lineno">   69</span>    std::vector&lt;uint32_t&gt; array1 = {1, 2, 3, 1};</div>
+<div class="line"><span class="lineno">   70</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
 <div class="line"><span class="lineno">   71</span>    assert(</div>
-<div class="line"><span class="lineno">   72</span>        dynamic_programming::house_robber::houseRobber(array1, array1.<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>        dynamic_programming::house_robber::houseRobber(array1, array1.size()) ==</div>
 <div class="line"><span class="lineno">   73</span>        4);  <span class="comment">// here the two non-adjacent houses that are robbed are first and</span></div>
 <div class="line"><span class="lineno">   74</span>             <span class="comment">// third with total sum money as 4</span></div>
-<div class="line"><span class="lineno">   75</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   75</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   76</span> </div>
 <div class="line"><span class="lineno">   77</span>    <span class="comment">// Test 2</span></div>
 <div class="line"><span class="lineno">   78</span>    <span class="comment">// [6, 7, 1, 3, 8, 2, 4] return 19</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&lt;uint32_t&gt;</a> array2 = {6, 7, 1, 3, 8, 2, 4};</div>
-<div class="line"><span class="lineno">   80</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
+<div class="line"><span class="lineno">   79</span>    std::vector&lt;uint32_t&gt; array2 = {6, 7, 1, 3, 8, 2, 4};</div>
+<div class="line"><span class="lineno">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
 <div class="line"><span class="lineno">   81</span>    assert(</div>
-<div class="line"><span class="lineno">   82</span>        dynamic_programming::house_robber::houseRobber(array2, array2.<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">   82</span>        dynamic_programming::house_robber::houseRobber(array2, array2.size()) ==</div>
 <div class="line"><span class="lineno">   83</span>        19);  <span class="comment">// here the four non-adjacent houses that are robbed are first,</span></div>
 <div class="line"><span class="lineno">   84</span>              <span class="comment">// third, fifth and seventh with total sum money as 19</span></div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   85</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   86</span> </div>
 <div class="line"><span class="lineno">   87</span>    <span class="comment">// Test 3</span></div>
 <div class="line"><span class="lineno">   88</span>    <span class="comment">// [] return 0</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&lt;uint32_t&gt;</a> array3 = {};</div>
-<div class="line"><span class="lineno">   90</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
+<div class="line"><span class="lineno">   89</span>    std::vector&lt;uint32_t&gt; array3 = {};</div>
+<div class="line"><span class="lineno">   90</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
 <div class="line"><span class="lineno">   91</span>    assert(</div>
-<div class="line"><span class="lineno">   92</span>        dynamic_programming::house_robber::houseRobber(array3, array3.<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">   92</span>        dynamic_programming::house_robber::houseRobber(array3, array3.size()) ==</div>
 <div class="line"><span class="lineno">   93</span>        0);  <span class="comment">// since there is no house no money can be robbed</span></div>
-<div class="line"><span class="lineno">   94</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   94</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   95</span> </div>
 <div class="line"><span class="lineno">   96</span>    <span class="comment">// Test 4</span></div>
 <div class="line"><span class="lineno">   97</span>    <span class="comment">// [2,7,9,3,1] return 12</span></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&lt;uint32_t&gt;</a> array4 = {2, 7, 9, 3, 1};</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> &lt;&lt; <span class="stringliteral">&quot;Test 4... &quot;</span>;</div>
+<div class="line"><span class="lineno">   98</span>    std::vector&lt;uint32_t&gt; array4 = {2, 7, 9, 3, 1};</div>
+<div class="line"><span class="lineno">   99</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4... &quot;</span>;</div>
 <div class="line"><span class="lineno">  100</span>    assert(</div>
-<div class="line"><span class="lineno">  101</span>        dynamic_programming::house_robber::houseRobber(array4, array4.<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">  101</span>        dynamic_programming::house_robber::houseRobber(array4, array4.size()) ==</div>
 <div class="line"><span class="lineno">  102</span>        12);  <span class="comment">// here the three non-adjacent houses that are robbed are first,</span></div>
 <div class="line"><span class="lineno">  103</span>              <span class="comment">// third and fifth with total sum money as 12</span></div>
-<div class="line"><span class="lineno">  104</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  104</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  105</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="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="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>
-</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="../../d6/d26/house__robber_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="218" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d6/d26/house__robber_8cpp_a1e497c3e3f169afe5baaae6a5d40cbc8_cgraph.map b/d6/d26/house__robber_8cpp_a1e497c3e3f169afe5baaae6a5d40cbc8_cgraph.map
deleted file mode 100644
index e2f5757b1..000000000
--- a/d6/d26/house__robber_8cpp_a1e497c3e3f169afe5baaae6a5d40cbc8_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="dynamic_programming::house_robber::houseRobber" name="dynamic_programming::house_robber::houseRobber">
-<area shape="rect" id="Node000001" title="The main function that implements the House Robber algorithm using dynamic programming." alt="" coords="5,29,198,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="67,29,65,19,71,10,83,5,102,3,121,5,133,11,130,16,120,10,101,8,85,10,74,14,70,20,72,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="246,37,318,62"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="198,47,230,47,230,52,198,52"/>
-</map>
diff --git a/d6/d26/house__robber_8cpp_a1e497c3e3f169afe5baaae6a5d40cbc8_cgraph.md5 b/d6/d26/house__robber_8cpp_a1e497c3e3f169afe5baaae6a5d40cbc8_cgraph.md5
deleted file mode 100644
index 7cc55d50c..000000000
--- a/d6/d26/house__robber_8cpp_a1e497c3e3f169afe5baaae6a5d40cbc8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2c4f1cfa3cc678a8aebf3f6ec7c49071
\ No newline at end of file
diff --git a/d6/d26/house__robber_8cpp_a1e497c3e3f169afe5baaae6a5d40cbc8_cgraph.svg b/d6/d26/house__robber_8cpp_a1e497c3e3f169afe5baaae6a5d40cbc8_cgraph.svg
deleted file mode 100644
index 2a11e495a..000000000
--- a/d6/d26/house__robber_8cpp_a1e497c3e3f169afe5baaae6a5d40cbc8_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::house_robber::houseRobber Pages: 1 -->
-<svg width="243pt" height="57pt"
- viewBox="0.00 0.00 242.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>dynamic_programming::house_robber::houseRobber</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function that implements the House Robber algorithm using dynamic programming.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-30.5 0,-30.5 0,0 144.25,0 144.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::house_robber::houseRobber</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M48.16,-30.99C43.27,-40.06 51.26,-48.5 72.12,-48.5 83.54,-48.5 91.1,-45.97 94.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.26,-42.82 95.92,-32.49 91.3,-42.03 98.26,-42.82"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.5,-24.88 180.25,-24.88 180.25,-5.63 234.5,-5.63 234.5,-24.88"/>
-<text text-anchor="middle" x="207.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.43,-15.25C152.71,-15.25 160.9,-15.25 168.48,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.29,-18.75 178.29,-15.25 168.29,-11.75 168.29,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d26/house__robber_8cpp_a1e497c3e3f169afe5baaae6a5d40cbc8_cgraph_org.svg b/d6/d26/house__robber_8cpp_a1e497c3e3f169afe5baaae6a5d40cbc8_cgraph_org.svg
deleted file mode 100644
index 0cf61d109..000000000
--- a/d6/d26/house__robber_8cpp_a1e497c3e3f169afe5baaae6a5d40cbc8_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::house_robber::houseRobber Pages: 1 -->
-<svg width="243pt" height="57pt"
- viewBox="0.00 0.00 242.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>dynamic_programming::house_robber::houseRobber</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function that implements the House Robber algorithm using dynamic programming.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-30.5 0,-30.5 0,0 144.25,0 144.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::house_robber::houseRobber</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M48.16,-30.99C43.27,-40.06 51.26,-48.5 72.12,-48.5 83.54,-48.5 91.1,-45.97 94.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.26,-42.82 95.92,-32.49 91.3,-42.03 98.26,-42.82"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.5,-24.88 180.25,-24.88 180.25,-5.63 234.5,-5.63 234.5,-24.88"/>
-<text text-anchor="middle" x="207.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.43,-15.25C152.71,-15.25 160.9,-15.25 168.48,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.29,-18.75 178.29,-15.25 168.29,-11.75 168.29,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d26/house__robber_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d6/d26/house__robber_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index b91b36709..000000000
--- a/d6/d26/house__robber_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,31,49,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="119,5,190,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,37,103,26,104,31,49,42"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="97,55,212,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="49,45,82,51,81,56,48,50"/>
-</map>
diff --git a/d6/d26/house__robber_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d6/d26/house__robber_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 32293e2cd..000000000
--- a/d6/d26/house__robber_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9ede37fefc7d80f72bb03b7e9e2bb88e
\ No newline at end of file
diff --git a/d6/d26/house__robber_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d6/d26/house__robber_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index d0d037cc6..000000000
--- a/d6/d26/house__robber_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="163pt" height="64pt"
- viewBox="0.00 0.00 163.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.5,-56.25 85,-56.25 85,-37 138.5,-37 138.5,-56.25"/>
-<text text-anchor="middle" x="111.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-30.76C43.82,-33.02 59.34,-36.18 73.61,-39.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.69,-42.46 83.19,-41.02 74.09,-35.6 72.69,-42.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155,-19.25 68.5,-19.25 68.5,0 155,0 155,-19.25"/>
-<text text-anchor="middle" x="111.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-24.65C39.62,-23.32 48.25,-21.66 57.23,-19.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.6,-23.42 66.76,-18.09 56.28,-16.55 57.6,-23.42"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d26/house__robber_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d6/d26/house__robber_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 4c2518914..000000000
--- a/d6/d26/house__robber_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="163pt" height="64pt"
- viewBox="0.00 0.00 163.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.5,-56.25 85,-56.25 85,-37 138.5,-37 138.5,-56.25"/>
-<text text-anchor="middle" x="111.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-30.76C43.82,-33.02 59.34,-36.18 73.61,-39.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.69,-42.46 83.19,-41.02 74.09,-35.6 72.69,-42.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155,-19.25 68.5,-19.25 68.5,0 155,0 155,-19.25"/>
-<text text-anchor="middle" x="111.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-24.65C39.62,-23.32 48.25,-21.66 57.23,-19.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.6,-23.42 66.76,-18.09 56.28,-16.55 57.6,-23.42"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d26/house__robber_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d26/house__robber_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index c6ceed5f8..000000000
--- a/d6/d26/house__robber_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,31,146,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,41,87,41,87,46,55,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="216,5,287,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,37,200,26,201,31,147,42"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="194,55,309,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="147,45,179,51,178,56,146,50"/>
-</map>
diff --git a/d6/d26/house__robber_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d26/house__robber_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 6652c867c..000000000
--- a/d6/d26/house__robber_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0455030d8fb2cb38ca91c4a746ec34c6
\ No newline at end of file
diff --git a/d6/d26/house__robber_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d26/house__robber_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index ce11b3f74..000000000
--- a/d6/d26/house__robber_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="236pt" height="64pt"
- viewBox="0.00 0.00 236.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="211.5,-56.25 158,-56.25 158,-37 211.5,-37 211.5,-56.25"/>
-<text text-anchor="middle" x="184.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-30.76C116.82,-33.02 132.34,-36.18 146.61,-39.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.69,-42.46 156.19,-41.02 147.09,-35.6 145.69,-42.46"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228,-19.25 141.5,-19.25 141.5,0 228,0 228,-19.25"/>
-<text text-anchor="middle" x="184.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-24.65C112.62,-23.32 121.25,-21.66 130.23,-19.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.6,-23.42 139.76,-18.09 129.28,-16.55 130.6,-23.42"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d26/house__robber_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/d26/house__robber_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 99127cc2b..000000000
--- a/d6/d26/house__robber_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="236pt" height="64pt"
- viewBox="0.00 0.00 236.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="211.5,-56.25 158,-56.25 158,-37 211.5,-37 211.5,-56.25"/>
-<text text-anchor="middle" x="184.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-30.76C116.82,-33.02 132.34,-36.18 146.61,-39.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.69,-42.46 156.19,-41.02 147.09,-35.6 145.69,-42.46"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228,-19.25 141.5,-19.25 141.5,0 228,0 228,-19.25"/>
-<text text-anchor="middle" x="184.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-24.65C112.62,-23.32 121.25,-21.66 130.23,-19.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.6,-23.42 139.76,-18.09 129.28,-16.55 130.6,-23.42"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d26/house__robber_8cpp_source.html b/d6/d26/house__robber_8cpp_source.html
new file mode 100644
index 000000000..f1f762fb5
--- /dev/null
+++ b/d6/d26/house__robber_8cpp_source.html
@@ -0,0 +1,227 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/house_robber.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/d26/house__robber_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">house_robber.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/d26/house__robber_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;climits&gt;</span>   </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cstdint&gt;</span>   </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a> {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/de1/namespacehouse__robber.html">house_robber</a> {</div>
+<div class="foldopen" id="foldopen00036" data-start="{" data-end="}">
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../d6/d26/house__robber_8cpp.html#a1e497c3e3f169afe5baaae6a5d40cbc8">   36</a></span>std::uint32_t <a class="code hl_function" href="../../d6/d26/house__robber_8cpp.html#a1e497c3e3f169afe5baaae6a5d40cbc8">houseRobber</a>(<span class="keyword">const</span> std::vector&lt;uint32_t&gt; &amp;money,</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>                          <span class="keyword">const</span> uint32_t &amp;n) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">if</span> (n == 0) {  <span class="comment">// if there is no house</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    }</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">if</span> (n == 1) {  <span class="comment">// if there is only one house</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        <span class="keywordflow">return</span> money[0];</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">if</span> (n == 2) {  <span class="comment">// if there are two houses, one with the maximum amount of</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>                   <span class="comment">// money will be robbed</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">return</span> std::max(money[0], money[1]);</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    uint32_t max_value = 0;  <span class="comment">// contains maximum stolen value at the end</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    uint32_t value1 = money[0];</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    uint32_t value2 = std::max(money[0], money[1]);</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordflow">for</span> (uint32_t i = 2; i &lt; n; i++) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        max_value = std::max(money[i] + value1, value2);</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        value1 = value2;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        value2 = max_value;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">return</span> max_value;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}</div>
+</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>}  <span class="comment">// namespace house_robber</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>}  <span class="comment">// namespace dynamic_programming</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="foldopen" id="foldopen00066" data-start="{" data-end="}">
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"><a class="line" href="../../d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   66</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="comment">// Test 1</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="comment">// [1, 2, 3, 1] return 4</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    std::vector&lt;uint32_t&gt; array1 = {1, 2, 3, 1};</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    assert(</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        dynamic_programming::house_robber::houseRobber(array1, array1.size()) ==</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        4);  <span class="comment">// here the two non-adjacent houses that are robbed are first and</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>             <span class="comment">// third with total sum money as 4</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="comment">// Test 2</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="comment">// [6, 7, 1, 3, 8, 2, 4] return 19</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    std::vector&lt;uint32_t&gt; array2 = {6, 7, 1, 3, 8, 2, 4};</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    assert(</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        dynamic_programming::house_robber::houseRobber(array2, array2.size()) ==</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        19);  <span class="comment">// here the four non-adjacent houses that are robbed are first,</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>              <span class="comment">// third, fifth and seventh with total sum money as 19</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="comment">// Test 3</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="comment">// [] return 0</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::vector&lt;uint32_t&gt; array3 = {};</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    assert(</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        dynamic_programming::house_robber::houseRobber(array3, array3.size()) ==</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        0);  <span class="comment">// since there is no house no money can be robbed</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="comment">// Test 4</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="comment">// [2,7,9,3,1] return 12</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    std::vector&lt;uint32_t&gt; array4 = {2, 7, 9, 3, 1};</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4... &quot;</span>;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    assert(</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        dynamic_programming::house_robber::houseRobber(array4, array4.size()) ==</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        12);  <span class="comment">// here the three non-adjacent houses that are robbed are first,</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>              <span class="comment">// third and fifth with total sum money as 12</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>}</div>
+</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="foldopen" id="foldopen00111" data-start="{" data-end="}">
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"><a class="line" href="../../d6/d26/house__robber_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  111</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/d26/house__robber_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <a class="code hl_function" href="../../d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>}</div>
+</div>
+<div class="ttc" id="ahouse__robber_8cpp_html_a1e497c3e3f169afe5baaae6a5d40cbc8"><div class="ttname"><a href="../../d6/d26/house__robber_8cpp.html#a1e497c3e3f169afe5baaae6a5d40cbc8">dynamic_programming::house_robber::houseRobber</a></div><div class="ttdeci">std::uint32_t houseRobber(const std::vector&lt; uint32_t &gt; &amp;money, const uint32_t &amp;n)</div><div class="ttdoc">The main function that implements the House Robber algorithm using dynamic programming.</div><div class="ttdef"><b>Definition</b> <a href="#l00036">house_robber.cpp:36</a></div></div>
+<div class="ttc" id="ahouse__robber_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d6/d26/house__robber_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> <a href="#l00066">house_robber.cpp:66</a></div></div>
+<div class="ttc" id="ahouse__robber_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d26/house__robber_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00111">house_robber.cpp:111</a></div></div>
+<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
+<div class="ttc" id="anamespacehouse__robber_html"><div class="ttname"><a href="../../d2/de1/namespacehouse__robber.html">house_robber</a></div><div class="ttdoc">Functions for the House Robber algorithm.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../d6/d26/house__robber_8cpp.html">house_robber.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.map b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.map
index d6223e6f3..2b285b148 100644
--- a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.map
+++ b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.map
@@ -4,7 +4,7 @@
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="74,46,74,331,68,331,68,46"/>
 <area shape="rect" id="Node000004" href="$dd/db6/structbinary__search__tree_1_1bst__node.html" title="A struct to represent a node in the Binary Search Tree." alt="" coords="87,94,218,135"/>
 <area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="93,41,137,92,133,95,89,44"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/unique_ptr.html" title=" " alt="" coords="88,213,257,253"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="88,213,257,253"/>
 <area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="148,267,90,333,86,329,144,263"/>
 <area shape="poly" id="edge5_Node000004_Node000003" title=" " alt="" coords="164,197,153,135,158,134,169,197"/>
 <area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="141,150,139,169,141,188,155,211,151,214,136,190,133,169,136,150"/>
diff --git a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.md5 b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.md5
index 8ef4cdc2c..1dc87ca44 100644
--- a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.md5
+++ b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.md5
@@ -1 +1 @@
-455a4be07dce015dea0fc6a1abe2e4e6
\ No newline at end of file
+16a770c4a032637eaec70d055bcf747a
\ No newline at end of file
diff --git a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.svg b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.svg
index 4ed606680..1e732e41c 100644
--- a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.svg
+++ b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph.svg
@@ -71,7 +71,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="188.75,-119.5 61.75,-119.5 61.75,-89 188.75,-89 188.75,-119.5"/>
 <text text-anchor="start" x="69.75" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr&lt; binary</text>
 <text text-anchor="middle" x="125.25" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search_tree::bst_node &gt;</text>
diff --git a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph_org.svg b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph_org.svg
index 91490815c..45be56787 100644
--- a/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph_org.svg
+++ b/d6/d2b/structbinary__search__tree_1_1bst__node__coll__graph_org.svg
@@ -60,7 +60,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="188.75,-119.5 61.75,-119.5 61.75,-89 188.75,-89 188.75,-119.5"/>
 <text text-anchor="start" x="69.75" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr&lt; binary</text>
 <text text-anchor="middle" x="125.25" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search_tree::bst_node &gt;</text>
diff --git a/d6/d2c/caesar__cipher_8cpp.html b/d6/d2c/caesar__cipher_8cpp.html
index b18682b84..3c9152533 100644
--- a/d6/d2c/caesar__cipher_8cpp.html
+++ b/d6/d2c/caesar__cipher_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ciphers/caesar_cipher.cpp File Reference</title>
+<title>TheAlgorithms/C++: ciphers/caesar_cipher.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for caesar_cipher.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d33/caesar__cipher_8cpp__incl.svg" width="248" height="111"><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">
+</div>
+<p><a href="../../d6/d2c/caesar__cipher_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d4e/namespaceciphers.html">ciphers</a></td></tr>
@@ -133,9 +152,9 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:ac3381121289548640b1c27a58a8524c3" id="r_ac3381121289548640b1c27a58a8524c3"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac3381121289548640b1c27a58a8524c3">ciphers::caesar::encrypt</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text, const int &amp;shift)</td></tr>
+<tr class="memitem:ac3381121289548640b1c27a58a8524c3" id="r_ac3381121289548640b1c27a58a8524c3"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac3381121289548640b1c27a58a8524c3">ciphers::caesar::encrypt</a> (const std::string &amp;text, const int &amp;shift)</td></tr>
 <tr class="separator:ac3381121289548640b1c27a58a8524c3"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a355e69511cd2006b5c4c80ae95b71056" id="r_a355e69511cd2006b5c4c80ae95b71056"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a355e69511cd2006b5c4c80ae95b71056">ciphers::caesar::decrypt</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text, const int &amp;shift)</td></tr>
+<tr class="memitem:a355e69511cd2006b5c4c80ae95b71056" id="r_a355e69511cd2006b5c4c80ae95b71056"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a355e69511cd2006b5c4c80ae95b71056">ciphers::caesar::decrypt</a> (const std::string &amp;text, const int &amp;shift)</td></tr>
 <tr class="separator:a355e69511cd2006b5c4c80ae95b71056"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae1a3968e7947464bee7714f6d43b7002" id="r_ae1a3968e7947464bee7714f6d43b7002"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae1a3968e7947464bee7714f6d43b7002">test</a> ()</td></tr>
 <tr class="separator:ae1a3968e7947464bee7714f6d43b7002"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -155,6 +174,8 @@ Algorithm</h3>
 </p>
 <dl class="section note"><dt>Note</dt><dd>This program implements caesar cipher for only uppercase English alphabet characters (i.e. A-Z).</dd></dl>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/imdeep2905" target="_blank">Deep Raval</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/d2c/caesar__cipher_8cpp_source.html">caesar_cipher.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a355e69511cd2006b5c4c80ae95b71056" name="a355e69511cd2006b5c4c80ae95b71056"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a355e69511cd2006b5c4c80ae95b71056">&#9670;&#160;</a></span>decrypt()</h2>
@@ -163,9 +184,9 @@ Algorithm</h3>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ciphers::caesar::decrypt </td>
+          <td class="memname">std::string ciphers::caesar::decrypt </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -182,8 +203,10 @@ Algorithm</h3>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new decrypted text </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00081">81</a> of file <a class="el" href="../../d6/d2c/caesar__cipher_8cpp_source.html">caesar_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   81</span>                                                                    {</div>
-<div class="line"><span class="lineno">   82</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> decrypted_text = <span class="stringliteral">&quot;&quot;</span>; <span class="comment">// Empty string to store decrypted text</span></div>
+<div class="line"><span class="lineno">   82</span>            std::string decrypted_text = <span class="stringliteral">&quot;&quot;</span>; <span class="comment">// Empty string to store decrypted text</span></div>
 <div class="line"><span class="lineno">   83</span>            <span class="keywordflow">for</span> (<span class="keywordtype">char</span> c : text) { <span class="comment">// Going through each character</span></div>
 <div class="line"><span class="lineno">   84</span>                <span class="keywordtype">int</span> place_value = get_value(c); <span class="comment">// Getting value of character (i.e. 0-25)</span></div>
 <div class="line"><span class="lineno">   85</span>                place_value = (place_value - shift) % 26;<span class="comment">// Applying decryption formula</span></div>
@@ -195,8 +218,7 @@ Algorithm</h3>
 <div class="line"><span class="lineno">   91</span>            }</div>
 <div class="line"><span class="lineno">   92</span>            <span class="keywordflow">return</span> decrypted_text; <span class="comment">// Returning decrypted text</span></div>
 <div class="line"><span class="lineno">   93</span>        }</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="asha256_8cpp_html_a9e98c180d32b04aab6f767cb0c13e1da"><div class="ttname"><a href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da">hashing::sha256::get_char</a></div><div class="ttdeci">char get_char(const std::string &amp;input, std::size_t pos)</div><div class="ttdoc">Returns the character at pos after the input is padded.</div><div class="ttdef"><b>Definition</b> sha256.cpp:170</div></div>
+<div class="ttc" id="asha256_8cpp_html_a9e98c180d32b04aab6f767cb0c13e1da"><div class="ttname"><a href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da">hashing::sha256::get_char</a></div><div class="ttdeci">char get_char(const std::string &amp;input, std::size_t pos)</div><div class="ttdoc">Returns the character at pos after the input is padded.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d08/sha256_8cpp_source.html#l00170">sha256.cpp:170</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -207,9 +229,9 @@ Algorithm</h3>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ciphers::caesar::encrypt </td>
+          <td class="memname">std::string ciphers::caesar::encrypt </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -226,8 +248,10 @@ Algorithm</h3>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new encrypted text </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00065">65</a> of file <a class="el" href="../../d6/d2c/caesar__cipher_8cpp_source.html">caesar_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   65</span>                                                                    {</div>
-<div class="line"><span class="lineno">   66</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> encrypted_text = <span class="stringliteral">&quot;&quot;</span>; <span class="comment">// Empty string to store encrypted text</span></div>
+<div class="line"><span class="lineno">   66</span>            std::string encrypted_text = <span class="stringliteral">&quot;&quot;</span>; <span class="comment">// Empty string to store encrypted text</span></div>
 <div class="line"><span class="lineno">   67</span>            <span class="keywordflow">for</span> (<span class="keywordtype">char</span> c : text) { <span class="comment">// Going through each character</span></div>
 <div class="line"><span class="lineno">   68</span>                <span class="keywordtype">int</span> place_value = get_value(c); <span class="comment">// Getting value of character (i.e. 0-25)</span></div>
 <div class="line"><span class="lineno">   69</span>                place_value = (place_value + shift) % 26; <span class="comment">// Applying encryption formula</span></div>
@@ -254,18 +278,15 @@ Algorithm</h3>
       </table>
 </div><div class="memdoc">
 <p>Driver Code </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00120">120</a> of file <a class="el" href="../../d6/d2c/caesar__cipher_8cpp_source.html">caesar_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  120</span>           {</div>
 <div class="line"><span class="lineno">  121</span>    <span class="comment">// Testing</span></div>
 <div class="line"><span class="lineno">  122</span>    <a class="code hl_function" href="#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
 <div class="line"><span class="lineno">  123</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  124</span>}</div>
-<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> caesar_cipher.cpp:100</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d2c/caesar__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00100">caesar_cipher.cpp:100</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae1a3968e7947464bee7714f6d43b7002" name="ae1a3968e7947464bee7714f6d43b7002"></a>
@@ -283,34 +304,29 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Function to test above algorithm </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00100">100</a> of file <a class="el" href="../../d6/d2c/caesar__cipher_8cpp_source.html">caesar_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  100</span>            {</div>
 <div class="line"><span class="lineno">  101</span>    <span class="comment">// Test 1</span></div>
-<div class="line"><span class="lineno">  102</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> text1 = <span class="stringliteral">&quot;ALANTURING&quot;</span>;</div>
-<div class="line"><span class="lineno">  103</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> encrypted1 = <a class="code hl_function" href="#ac3381121289548640b1c27a58a8524c3">ciphers::caesar::encrypt</a>(text1, 17);</div>
-<div class="line"><span class="lineno">  104</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> decrypted1 = <a class="code hl_function" href="#a355e69511cd2006b5c4c80ae95b71056">ciphers::caesar::decrypt</a>(encrypted1, 17);</div>
+<div class="line"><span class="lineno">  102</span>    std::string text1 = <span class="stringliteral">&quot;ALANTURING&quot;</span>;</div>
+<div class="line"><span class="lineno">  103</span>    std::string encrypted1 = <a class="code hl_function" href="#ac3381121289548640b1c27a58a8524c3">ciphers::caesar::encrypt</a>(text1, 17);</div>
+<div class="line"><span class="lineno">  104</span>    std::string decrypted1 = <a class="code hl_function" href="#a355e69511cd2006b5c4c80ae95b71056">ciphers::caesar::decrypt</a>(encrypted1, 17);</div>
 <div class="line"><span class="lineno">  105</span>    assert(text1 == decrypted1);</div>
-<div class="line"><span class="lineno">  106</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text1;</div>
-<div class="line"><span class="lineno">  107</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; , Encrypted text (with shift = 21) : &quot;</span> &lt;&lt; encrypted1;</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> &lt;&lt; <span class="stringliteral">&quot; , Decrypted text : &quot;</span>&lt;&lt; decrypted1 &lt;&lt; <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">  106</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text1;</div>
+<div class="line"><span class="lineno">  107</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Encrypted text (with shift = 21) : &quot;</span> &lt;&lt; encrypted1;</div>
+<div class="line"><span class="lineno">  108</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Decrypted text : &quot;</span>&lt;&lt; decrypted1 &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  109</span>    <span class="comment">// Test 2</span></div>
-<div class="line"><span class="lineno">  110</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> text2 = <span class="stringliteral">&quot;HELLOWORLD&quot;</span>;</div>
-<div class="line"><span class="lineno">  111</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> encrypted2 = <a class="code hl_function" href="#ac3381121289548640b1c27a58a8524c3">ciphers::caesar::encrypt</a>(text2, 1729);</div>
-<div class="line"><span class="lineno">  112</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> decrypted2 = <a class="code hl_function" href="#a355e69511cd2006b5c4c80ae95b71056">ciphers::caesar::decrypt</a>(encrypted2, 1729);</div>
+<div class="line"><span class="lineno">  110</span>    std::string text2 = <span class="stringliteral">&quot;HELLOWORLD&quot;</span>;</div>
+<div class="line"><span class="lineno">  111</span>    std::string encrypted2 = <a class="code hl_function" href="#ac3381121289548640b1c27a58a8524c3">ciphers::caesar::encrypt</a>(text2, 1729);</div>
+<div class="line"><span class="lineno">  112</span>    std::string decrypted2 = <a class="code hl_function" href="#a355e69511cd2006b5c4c80ae95b71056">ciphers::caesar::decrypt</a>(encrypted2, 1729);</div>
 <div class="line"><span class="lineno">  113</span>    assert(text2 == decrypted2);</div>
-<div class="line"><span class="lineno">  114</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text2;</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> &lt;&lt; <span class="stringliteral">&quot; , Encrypted text (with shift = 1729) : &quot;</span> &lt;&lt; encrypted2;</div>
-<div class="line"><span class="lineno">  116</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; , Decrypted text : &quot;</span>&lt;&lt; decrypted2 &lt;&lt; <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">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text2;</div>
+<div class="line"><span class="lineno">  115</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Encrypted text (with shift = 1729) : &quot;</span> &lt;&lt; encrypted2;</div>
+<div class="line"><span class="lineno">  116</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Decrypted text : &quot;</span>&lt;&lt; decrypted2 &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  117</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="acaesar__cipher_8cpp_html_a355e69511cd2006b5c4c80ae95b71056"><div class="ttname"><a href="#a355e69511cd2006b5c4c80ae95b71056">ciphers::caesar::decrypt</a></div><div class="ttdeci">std::string decrypt(const std::string &amp;text, const int &amp;shift)</div><div class="ttdef"><b>Definition</b> caesar_cipher.cpp:81</div></div>
-<div class="ttc" id="acaesar__cipher_8cpp_html_ac3381121289548640b1c27a58a8524c3"><div class="ttname"><a href="#ac3381121289548640b1c27a58a8524c3">ciphers::caesar::encrypt</a></div><div class="ttdeci">std::string encrypt(const std::string &amp;text, const int &amp;shift)</div><div class="ttdef"><b>Definition</b> caesar_cipher.cpp:65</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><!-- 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="../../d6/d2c/caesar__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acaesar__cipher_8cpp_html_a355e69511cd2006b5c4c80ae95b71056"><div class="ttname"><a href="#a355e69511cd2006b5c4c80ae95b71056">ciphers::caesar::decrypt</a></div><div class="ttdeci">std::string decrypt(const std::string &amp;text, const int &amp;shift)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00081">caesar_cipher.cpp:81</a></div></div>
+<div class="ttc" id="acaesar__cipher_8cpp_html_ac3381121289548640b1c27a58a8524c3"><div class="ttname"><a href="#ac3381121289548640b1c27a58a8524c3">ciphers::caesar::encrypt</a></div><div class="ttdeci">std::string encrypt(const std::string &amp;text, const int &amp;shift)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00065">caesar_cipher.cpp:65</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d6/d2c/caesar__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map b/d6/d2c/caesar__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
deleted file mode 100644
index ab849b4e9..000000000
--- a/d6/d2c/caesar__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/d6/d2c/caesar__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5 b/d6/d2c/caesar__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
deleted file mode 100644
index 027bb45f5..000000000
--- a/d6/d2c/caesar__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a1d13d80069df469bd6cb7baa71c0ea1
\ No newline at end of file
diff --git a/d6/d2c/caesar__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg b/d6/d2c/caesar__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
deleted file mode 100644
index 74b7e7dc5..000000000
--- a/d6/d2c/caesar__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d2c/caesar__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg b/d6/d2c/caesar__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
deleted file mode 100644
index b7b979de9..000000000
--- a/d6/d2c/caesar__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d2c/caesar__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d2c/caesar__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 080c958ce..000000000
--- a/d6/d2c/caesar__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" title=" " alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/d6/d2c/caesar__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d2c/caesar__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 80154e768..000000000
--- a/d6/d2c/caesar__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-22083543b42ff9ad7f02def3bde5ed30
\ No newline at end of file
diff --git a/d6/d2c/caesar__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d2c/caesar__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index fb05a15ef..000000000
--- a/d6/d2c/caesar__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d2c/caesar__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/d2c/caesar__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index ac9a935ae..000000000
--- a/d6/d2c/caesar__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d2c/caesar__cipher_8cpp_source.html b/d6/d2c/caesar__cipher_8cpp_source.html
new file mode 100644
index 000000000..7f6fa5976
--- /dev/null
+++ b/d6/d2c/caesar__cipher_8cpp_source.html
@@ -0,0 +1,219 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: ciphers/caesar_cipher.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/d2c/caesar__cipher_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">caesar_cipher.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/d2c/caesar__cipher_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;string&gt;</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/d4e/namespaceciphers.html">ciphers</a> {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d81/namespacecaesar.html">caesar</a> {   </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        <span class="keyword">namespace </span>{</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>            <span class="keyword">inline</span> <span class="keywordtype">char</span> <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da">get_char</a>(<span class="keyword">const</span> <span class="keywordtype">int</span> x) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>                <span class="comment">// By adding 65 we are scaling 0-25 to 65-90. </span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>                <span class="comment">// Which are in fact ASCII values of A-Z. </span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>                <span class="keywordflow">return</span> char(x + 65); </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            }</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            <span class="keyword">inline</span> <span class="keywordtype">int</span> get_value(<span class="keyword">const</span> <span class="keywordtype">char</span> c) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>                <span class="comment">// A-Z have ASCII values in range 65-90.</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>                <span class="comment">// Hence subtracting 65 will scale them to 0-25.</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>                <span class="keywordflow">return</span> int(c - 65);</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            }</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        } <span class="comment">// Unnamed namespace</span></div>
+<div class="foldopen" id="foldopen00065" data-start="{" data-end="}">
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="../../d6/d2c/caesar__cipher_8cpp.html#ac3381121289548640b1c27a58a8524c3">   65</a></span>        std::string encrypt (<span class="keyword">const</span> std::string &amp;text, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;shift) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            std::string encrypted_text = <span class="stringliteral">&quot;&quot;</span>; <span class="comment">// Empty string to store encrypted text</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            <span class="keywordflow">for</span> (<span class="keywordtype">char</span> c : text) { <span class="comment">// Going through each character</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                <span class="keywordtype">int</span> place_value = get_value(c); <span class="comment">// Getting value of character (i.e. 0-25)</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>                place_value = (place_value + shift) % 26; <span class="comment">// Applying encryption formula</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>                <span class="keywordtype">char</span> new_char = get_char(place_value); <span class="comment">// Getting new character from new value (i.e. A-Z)</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>                encrypted_text += new_char; <span class="comment">// Appending encrypted character</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            }</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            <span class="keywordflow">return</span> encrypted_text; <span class="comment">// Returning encrypted text</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        }</div>
+</div>
+<div class="foldopen" id="foldopen00081" data-start="{" data-end="}">
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="../../d6/d2c/caesar__cipher_8cpp.html#a355e69511cd2006b5c4c80ae95b71056">   81</a></span>        std::string decrypt (<span class="keyword">const</span> std::string &amp;text, <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;shift) {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>            std::string decrypted_text = <span class="stringliteral">&quot;&quot;</span>; <span class="comment">// Empty string to store decrypted text</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            <span class="keywordflow">for</span> (<span class="keywordtype">char</span> c : text) { <span class="comment">// Going through each character</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>                <span class="keywordtype">int</span> place_value = get_value(c); <span class="comment">// Getting value of character (i.e. 0-25)</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>                place_value = (place_value - shift) % 26;<span class="comment">// Applying decryption formula</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>                <span class="keywordflow">if</span>(place_value &lt; 0) { <span class="comment">// Handling case where remainder is negative </span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>                    place_value = place_value + 26;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>                }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>                <span class="keywordtype">char</span> new_char = get_char(place_value); <span class="comment">// Getting original character from decrypted value (i.e. A-Z)</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>                decrypted_text += new_char; <span class="comment">// Appending decrypted character</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>            }</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>            <span class="keywordflow">return</span> decrypted_text; <span class="comment">// Returning decrypted text</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        }</div>
+</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    } <span class="comment">// namespace caesar</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>} <span class="comment">// namespace ciphers</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="foldopen" id="foldopen00100" data-start="{" data-end="}">
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"><a class="line" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">  100</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="comment">// Test 1</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    std::string text1 = <span class="stringliteral">&quot;ALANTURING&quot;</span>;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    std::string encrypted1 = ciphers::caesar::encrypt(text1, 17);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::string decrypted1 = ciphers::caesar::decrypt(encrypted1, 17);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    assert(text1 == decrypted1);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text1;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Encrypted text (with shift = 21) : &quot;</span> &lt;&lt; encrypted1;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Decrypted text : &quot;</span>&lt;&lt; decrypted1 &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="comment">// Test 2</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    std::string text2 = <span class="stringliteral">&quot;HELLOWORLD&quot;</span>;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::string encrypted2 = ciphers::caesar::encrypt(text2, 1729);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    std::string decrypted2 = ciphers::caesar::decrypt(encrypted2, 1729);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    assert(text2 == decrypted2);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text2;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Encrypted text (with shift = 1729) : &quot;</span> &lt;&lt; encrypted2;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Decrypted text : &quot;</span>&lt;&lt; decrypted2 &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>}</div>
+</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="foldopen" id="foldopen00120" data-start="{" data-end="}">
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"><a class="line" href="../../d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  120</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="comment">// Testing</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>}</div>
+</div>
+<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00100">caesar_cipher.cpp:100</a></div></div>
+<div class="ttc" id="acaesar__cipher_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00120">caesar_cipher.cpp:120</a></div></div>
+<div class="ttc" id="anamespacecaesar_html"><div class="ttname"><a href="../../dd/d81/namespacecaesar.html">caesar</a></div><div class="ttdoc">Functions for Caesar cipher algorithm.</div></div>
+<div class="ttc" id="anamespaceciphers_html"><div class="ttname"><a href="../../d6/d4e/namespaceciphers.html">ciphers</a></div><div class="ttdoc">Algorithms for encryption and decryption.</div></div>
+<div class="ttc" id="asha256_8cpp_html_a9e98c180d32b04aab6f767cb0c13e1da"><div class="ttname"><a href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da">hashing::sha256::get_char</a></div><div class="ttdeci">char get_char(const std::string &amp;input, std::size_t pos)</div><div class="ttdoc">Returns the character at pos after the input is padded.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d08/sha256_8cpp_source.html#l00170">sha256.cpp:170</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_4d6e05837bf820fb089a8a8cdf2f42b7.html">ciphers</a></li><li class="navelem"><a class="el" href="../../d6/d2c/caesar__cipher_8cpp.html">caesar_cipher.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/d2d/modular__inverse__simple_8cpp.html b/d6/d2d/modular__inverse__simple_8cpp.html
index 721b286f0..94f238ee9 100644
--- a/d6/d2d/modular__inverse__simple_8cpp.html
+++ b/d6/d2d/modular__inverse__simple_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/modular_inverse_simple.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/modular_inverse_simple.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for modular_inverse_simple.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d13/modular__inverse__simple_8cpp__incl.svg" width="255" height="126"><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">
+</div>
+<p><a href="../../d6/d2d/modular__inverse__simple_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a618b198f74a88ab0023355b3a05d9ad6" id="r_a618b198f74a88ab0023355b3a05d9ad6"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a618b198f74a88ab0023355b3a05d9ad6">imod</a> (uint64_t x, uint64_t y)</td></tr>
@@ -136,6 +155,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Simple implementation of <a href="https://en.wikipedia.org/wiki/Modular_multiplicative_inverse" target="_blank">modular multiplicative inverse</a> </p>
 <p>this algorithm calculates the modular inverse x^{-1} \mod y iteratively </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/d2d/modular__inverse__simple_8cpp_source.html">modular_inverse_simple.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a618b198f74a88ab0023355b3a05d9ad6" name="a618b198f74a88ab0023355b3a05d9ad6"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a618b198f74a88ab0023355b3a05d9ad6">&#9670;&#160;</a></span>imod()</h2>
@@ -166,6 +187,8 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the modular inverse </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d2d/modular__inverse__simple_8cpp_source.html#l00021">21</a> of file <a class="el" href="../../d6/d2d/modular__inverse__simple_8cpp_source.html">modular_inverse_simple.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   21</span>                                      {</div>
 <div class="line"><span class="lineno">   22</span>    uint64_t aux = 0;  <span class="comment">// auxiliary variable</span></div>
 <div class="line"><span class="lineno">   23</span>    uint64_t itr = 0;  <span class="comment">// iteration counter</span></div>
@@ -197,16 +220,13 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d2d/modular__inverse__simple_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d6/d2d/modular__inverse__simple_8cpp_source.html">modular_inverse_simple.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   59</span>           {</div>
 <div class="line"><span class="lineno">   60</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   61</span>};</div>
-<div class="ttc" id="amodular__inverse__simple_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">self-test implementations</div><div class="ttdef"><b>Definition</b> modular_inverse_simple.cpp:37</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d2d/modular__inverse__simple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="250" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amodular__inverse__simple_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">self-test implementations</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2d/modular__inverse__simple_8cpp_source.html#l00037">modular_inverse_simple.cpp:37</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -234,32 +254,28 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d2d/modular__inverse__simple_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../d6/d2d/modular__inverse__simple_8cpp_source.html">modular_inverse_simple.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   37</span>                   {</div>
-<div class="line"><span class="lineno">   38</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;First case testing... \n&quot;</span>;</div>
+<div class="line"><span class="lineno">   38</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;First case testing... \n&quot;</span>;</div>
 <div class="line"><span class="lineno">   39</span>    <span class="comment">// for a = 3 and b = 11 return 4</span></div>
 <div class="line"><span class="lineno">   40</span>    assert(<a class="code hl_function" href="#a618b198f74a88ab0023355b3a05d9ad6">imod</a>(3, 11) == 4);</div>
-<div class="line"><span class="lineno">   41</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPassed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   41</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   42</span> </div>
-<div class="line"><span class="lineno">   43</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Second case testing... \n&quot;</span>;</div>
+<div class="line"><span class="lineno">   43</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Second case testing... \n&quot;</span>;</div>
 <div class="line"><span class="lineno">   44</span>    <span class="comment">// for a = 3 and b = 26 return 9</span></div>
 <div class="line"><span class="lineno">   45</span>    assert(<a class="code hl_function" href="#a618b198f74a88ab0023355b3a05d9ad6">imod</a>(3, 26) == 9);</div>
-<div class="line"><span class="lineno">   46</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPassed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   46</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   47</span> </div>
-<div class="line"><span class="lineno">   48</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Third case testing... \n&quot;</span>;</div>
+<div class="line"><span class="lineno">   48</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Third case testing... \n&quot;</span>;</div>
 <div class="line"><span class="lineno">   49</span>    <span class="comment">// for a = 7 and b = 26 return 15</span></div>
 <div class="line"><span class="lineno">   50</span>    assert(<a class="code hl_function" href="#a618b198f74a88ab0023355b3a05d9ad6">imod</a>(7, 26) == 15);</div>
-<div class="line"><span class="lineno">   51</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPassed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   51</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   52</span> </div>
-<div class="line"><span class="lineno">   53</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nAll test cases have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   53</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nAll test cases have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   54</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="amodular__inverse__simple_8cpp_html_a618b198f74a88ab0023355b3a05d9ad6"><div class="ttname"><a href="#a618b198f74a88ab0023355b3a05d9ad6">imod</a></div><div class="ttdeci">uint64_t imod(uint64_t x, uint64_t y)</div><div class="ttdoc">for assert</div><div class="ttdef"><b>Definition</b> modular_inverse_simple.cpp:21</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d2d/modular__inverse__simple_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amodular__inverse__simple_8cpp_html_a618b198f74a88ab0023355b3a05d9ad6"><div class="ttname"><a href="#a618b198f74a88ab0023355b3a05d9ad6">imod</a></div><div class="ttdeci">uint64_t imod(uint64_t x, uint64_t y)</div><div class="ttdoc">for assert</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2d/modular__inverse__simple_8cpp_source.html#l00021">modular_inverse_simple.cpp:21</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d6/d2d/modular__inverse__simple_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d6/d2d/modular__inverse__simple_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index d3f8146dd..000000000
--- a/d6/d2d/modular__inverse__simple_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="self&#45;test implementations" alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="$d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6" title="for assert" alt="" coords="97,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/d6/d2d/modular__inverse__simple_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d6/d2d/modular__inverse__simple_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 5fc1c27f4..000000000
--- a/d6/d2d/modular__inverse__simple_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fbc8d68de96efc0106d4060c9e36751e
\ No newline at end of file
diff --git a/d6/d2d/modular__inverse__simple_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d6/d2d/modular__inverse__simple_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index a3d8b3ca5..000000000
--- a/d6/d2d/modular__inverse__simple_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="self&#45;test implementations">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6" target="_top" xlink:title="for assert">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 68.5,-19.25 68.5,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="87" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">imod</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.85,-9.62C39.88,-9.62 48.41,-9.62 56.57,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.52,-13.13 66.52,-9.63 56.52,-6.13 56.52,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d2d/modular__inverse__simple_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d6/d2d/modular__inverse__simple_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 4688ba046..000000000
--- a/d6/d2d/modular__inverse__simple_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="self&#45;test implementations">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6" target="_top" xlink:title="for assert">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 68.5,-19.25 68.5,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="87" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">imod</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.85,-9.62C39.88,-9.62 48.41,-9.62 56.57,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.52,-13.13 66.52,-9.63 56.52,-6.13 56.52,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d2d/modular__inverse__simple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d2d/modular__inverse__simple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 979049f6a..000000000
--- a/d6/d2d/modular__inverse__simple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="self&#45;test implementations" alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="$d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6" title="for assert" alt="" coords="194,5,243,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/d6/d2d/modular__inverse__simple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d2d/modular__inverse__simple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 9cfc14253..000000000
--- a/d6/d2d/modular__inverse__simple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8b83b67a2084fe8f4843131e415507fa
\ No newline at end of file
diff --git a/d6/d2d/modular__inverse__simple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d2d/modular__inverse__simple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 1e7bded6d..000000000
--- a/d6/d2d/modular__inverse__simple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="187pt" height="27pt"
- viewBox="0.00 0.00 186.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="self&#45;test implementations">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6" target="_top" xlink:title="for assert">
-<polygon fill="white" stroke="#666666" points="178.5,-19.25 141.5,-19.25 141.5,0 178.5,0 178.5,-19.25"/>
-<text text-anchor="middle" x="160" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">imod</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.85,-9.62C112.88,-9.62 121.41,-9.62 129.57,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.52,-13.13 139.52,-9.63 129.52,-6.13 129.52,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d2d/modular__inverse__simple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/d2d/modular__inverse__simple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 91168489f..000000000
--- a/d6/d2d/modular__inverse__simple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="187pt" height="27pt"
- viewBox="0.00 0.00 186.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="self&#45;test implementations">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6" target="_top" xlink:title="for assert">
-<polygon fill="white" stroke="#666666" points="178.5,-19.25 141.5,-19.25 141.5,0 178.5,0 178.5,-19.25"/>
-<text text-anchor="middle" x="160" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">imod</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.85,-9.62C112.88,-9.62 121.41,-9.62 129.57,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.52,-13.13 139.52,-9.63 129.52,-6.13 129.52,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d2d/modular__inverse__simple_8cpp_source.html b/d6/d2d/modular__inverse__simple_8cpp_source.html
new file mode 100644
index 000000000..46713e132
--- /dev/null
+++ b/d6/d2d/modular__inverse__simple_8cpp_source.html
@@ -0,0 +1,184 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/modular_inverse_simple.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/d2d/modular__inverse__simple_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">modular_inverse_simple.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/d2d/modular__inverse__simple_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="foldopen" id="foldopen00021" data-start="{" data-end="}">
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"><a class="line" href="../../d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6">   21</a></span>uint64_t <a class="code hl_function" href="../../d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6">imod</a>(uint64_t x, uint64_t y) {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    uint64_t aux = 0;  <span class="comment">// auxiliary variable</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    uint64_t itr = 0;  <span class="comment">// iteration counter</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="keywordflow">do</span> {  <span class="comment">// run the algorithm while not find the inverse</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        aux = y * itr + 1;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        itr++;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    } <span class="keywordflow">while</span> (aux % x);  <span class="comment">// while module aux % x non-zero</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">return</span> aux / x;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>}</div>
+</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="}">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   37</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;First case testing... \n&quot;</span>;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="comment">// for a = 3 and b = 11 return 4</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    assert(<a class="code hl_function" href="../../d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6">imod</a>(3, 11) == 4);</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed!\n&quot;</span>;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Second case testing... \n&quot;</span>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="comment">// for a = 3 and b = 26 return 9</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    assert(<a class="code hl_function" href="../../d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6">imod</a>(3, 26) == 9);</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed!\n&quot;</span>;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Third case testing... \n&quot;</span>;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="comment">// for a = 7 and b = 26 return 15</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    assert(<a class="code hl_function" href="../../d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6">imod</a>(7, 26) == 15);</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed!\n&quot;</span>;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nAll test cases have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00059" data-start="{" data-end="}">
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   59</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <a class="code hl_function" href="../../d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>};</div>
+</div>
+<div class="ttc" id="amodular__inverse__simple_8cpp_html_a618b198f74a88ab0023355b3a05d9ad6"><div class="ttname"><a href="../../d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6">imod</a></div><div class="ttdeci">uint64_t imod(uint64_t x, uint64_t y)</div><div class="ttdoc">for assert</div><div class="ttdef"><b>Definition</b> <a href="#l00021">modular_inverse_simple.cpp:21</a></div></div>
+<div class="ttc" id="amodular__inverse__simple_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d6/d2d/modular__inverse__simple_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> <a href="#l00037">modular_inverse_simple.cpp:37</a></div></div>
+<div class="ttc" id="amodular__inverse__simple_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00059">modular_inverse_simple.cpp:59</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d6/d2d/modular__inverse__simple_8cpp.html">modular_inverse_simple.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/d2e/fenwick__tree_8cpp.html b/d6/d2e/fenwick__tree_8cpp.html
index 7c826dec0..77025e4b7 100644
--- a/d6/d2e/fenwick__tree_8cpp.html
+++ b/d6/d2e/fenwick__tree_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: range_queries/fenwick_tree.cpp File Reference</title>
+<title>TheAlgorithms/C++: range_queries/fenwick_tree.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for fenwick_tree.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/dda/fenwick__tree_8cpp__incl.svg" width="252" height="126"><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">
+</div>
+<p><a href="../../d6/d2e/fenwick__tree_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html">range_queries::fenwick_tree</a></td></tr>
@@ -132,7 +151,7 @@ Classes</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d69/namespacerange__queries.html">range_queries</a></td></tr>
-<tr class="memdesc:dd/d69/namespacerange__queries"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
+<tr class="memdesc:dd/d69/namespacerange__queries"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::vector <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
@@ -151,6 +170,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/mateusz-grzegorzek" target="_blank">Mateusz Grzegorzek</a> </dd>
 <dd>
 <a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html">fenwick_tree.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -169,17 +190,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00132">132</a> of file <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html">fenwick_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  132</span>           {</div>
 <div class="line"><span class="lineno">  133</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  134</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  135</span>}</div>
-<div class="ttc" id="afenwick__tree_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> fenwick_tree.cpp:114</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d6/d2e/fenwick__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="388"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="afenwick__tree_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00114">fenwick_tree.cpp:114</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -207,8 +225,10 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00114">114</a> of file <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html">fenwick_tree.cpp</a>.</p>
 <div class="fragment"><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/container/vector.html">std::vector&lt;int&gt;</a> arr = {1, 2, 3, 4, 5};</div>
+<div class="line"><span class="lineno">  115</span>    std::vector&lt;int&gt; arr = {1, 2, 3, 4, 5};</div>
 <div class="line"><span class="lineno">  116</span>    <a class="code hl_class" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html">range_queries::fenwick_tree</a> fenwick_tree(arr);</div>
 <div class="line"><span class="lineno">  117</span> </div>
 <div class="line"><span class="lineno">  118</span>    assert(fenwick_tree.sum_range(0, 0) == 1);</div>
@@ -218,17 +238,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  122</span>    assert(fenwick_tree.sum_range(0, 4) == 15);</div>
 <div class="line"><span class="lineno">  123</span> </div>
 <div class="line"><span class="lineno">  124</span>    fenwick_tree.update(0, 6);</div>
-<div class="line"><span class="lineno">  125</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  125</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  126</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="aclassrange__queries_1_1fenwick__tree_html"><div class="ttname"><a href="../../de/d0d/classrange__queries_1_1fenwick__tree.html">range_queries::fenwick_tree</a></div><div class="ttdoc">The class that initializes the Fenwick Tree.</div><div class="ttdef"><b>Definition</b> fenwick_tree.cpp:32</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>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d6/d2e/fenwick__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="100%" height="388"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html"><div class="ttname"><a href="../../de/d0d/classrange__queries_1_1fenwick__tree.html">range_queries::fenwick_tree</a></div><div class="ttdoc">The class that initializes the Fenwick Tree.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00032">fenwick_tree.cpp:32</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d6/d2e/fenwick__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d6/d2e/fenwick__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index 76aee4966..000000000
--- a/d6/d2e/fenwick__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,46,56,72"/>
-<area shape="rect" id="Node000002" href="$de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe" title="Returns the prefix sum in range from L to R." alt="" coords="104,8,259,49"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,51,88,45,89,50,57,57"/>
-<area shape="rect" id="Node000005" href="$de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9" title="Updates the value of an element in original array and accordingly updates the values in BIT array." alt="" coords="307,71,462,111"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="56,59,292,80,291,85,56,64"/>
-<area shape="rect" id="Node000003" href="$de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd" title="Returns the sum of elements in range from 0 to ID." alt="" coords="307,5,462,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="259,25,291,24,291,30,259,30"/>
-<area shape="rect" id="Node000004" href="$de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801" title="Returns the highest power of two which is not more than x." alt="" coords="510,39,666,79"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="463,36,495,41,494,46,462,41"/>
-<area shape="poly" id="edge5_Node000005_Node000004" title=" " alt="" coords="462,76,494,71,495,76,463,81"/>
-</map>
diff --git a/d6/d2e/fenwick__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d6/d2e/fenwick__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 35be29257..000000000
--- a/d6/d2e/fenwick__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-801f348fab4dd2587848853a07163bf5
\ No newline at end of file
diff --git a/d6/d2e/fenwick__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d6/d2e/fenwick__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index 2eb6ff00c..000000000
--- a/d6/d2e/fenwick__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,189 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<!--zoomable 88 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 503;
-var viewHeight = 88;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-48.88 0,-48.88 0,-29.62 37.75,-29.62 37.75,-48.88"/>
-<text text-anchor="middle" x="18.88" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe" target="_top" xlink:title="Returns the prefix sum in range from L to R.">
-<polygon fill="white" stroke="#666666" points="190.25,-77.5 73.75,-77.5 73.75,-47 190.25,-47 190.25,-77.5"/>
-<text text-anchor="start" x="81.75" y="-64" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="132" y="-52.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::sum_range</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.23,-43.05C45.24,-44.5 53.71,-46.25 62.66,-48.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.74,-51.49 72.25,-50.09 63.16,-44.64 61.74,-51.49"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9" target="_top" xlink:title="Updates the value of an element in original array and accordingly updates the values in BIT array.">
-<polygon fill="white" stroke="#666666" points="342.75,-30.5 226.25,-30.5 226.25,0 342.75,0 342.75,-30.5"/>
-<text text-anchor="start" x="234.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="284.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38,-37.6C73.84,-34.34 155.46,-26.91 214.78,-21.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.8,-25.02 224.44,-20.63 214.17,-18.05 214.8,-25.02"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd" target="_top" xlink:title="Returns the sum of elements in range from 0 to ID.">
-<polygon fill="white" stroke="#666666" points="342.75,-79.5 226.25,-79.5 226.25,-49 342.75,-49 342.75,-79.5"/>
-<text text-anchor="start" x="234.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="284.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::sum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.33,-63.01C198.23,-63.12 206.42,-63.23 214.5,-63.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.27,-66.83 224.32,-63.46 214.37,-59.83 214.27,-66.83"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801" target="_top" xlink:title="Returns the highest power of two which is not more than x.">
-<polygon fill="white" stroke="#666666" points="495.25,-54.5 378.75,-54.5 378.75,-24 495.25,-24 495.25,-54.5"/>
-<text text-anchor="start" x="386.75" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="437" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::offset</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M342.83,-54.73C350.73,-53.41 358.92,-52.05 367,-50.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="367.55,-54.17 376.84,-49.08 366.4,-47.26 367.55,-54.17"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge5_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge5_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M342.83,-24.39C350.73,-25.65 358.92,-26.96 367,-28.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="366.41,-31.7 376.84,-29.82 367.52,-24.78 366.41,-31.7"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="fenwick__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d2e/fenwick__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d6/d2e/fenwick__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index 1eace9c1a..000000000
--- a/d6/d2e/fenwick__tree_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,106 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="503pt" height="88pt"
- viewBox="0.00 0.00 503.25 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-48.88 0,-48.88 0,-29.62 37.75,-29.62 37.75,-48.88"/>
-<text text-anchor="middle" x="18.88" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe" target="_top" xlink:title="Returns the prefix sum in range from L to R.">
-<polygon fill="white" stroke="#666666" points="190.25,-77.5 73.75,-77.5 73.75,-47 190.25,-47 190.25,-77.5"/>
-<text text-anchor="start" x="81.75" y="-64" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="132" y="-52.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::sum_range</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.23,-43.05C45.24,-44.5 53.71,-46.25 62.66,-48.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.74,-51.49 72.25,-50.09 63.16,-44.64 61.74,-51.49"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9" target="_top" xlink:title="Updates the value of an element in original array and accordingly updates the values in BIT array.">
-<polygon fill="white" stroke="#666666" points="342.75,-30.5 226.25,-30.5 226.25,0 342.75,0 342.75,-30.5"/>
-<text text-anchor="start" x="234.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="284.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38,-37.6C73.84,-34.34 155.46,-26.91 214.78,-21.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.8,-25.02 224.44,-20.63 214.17,-18.05 214.8,-25.02"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd" target="_top" xlink:title="Returns the sum of elements in range from 0 to ID.">
-<polygon fill="white" stroke="#666666" points="342.75,-79.5 226.25,-79.5 226.25,-49 342.75,-49 342.75,-79.5"/>
-<text text-anchor="start" x="234.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="284.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::sum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.33,-63.01C198.23,-63.12 206.42,-63.23 214.5,-63.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.27,-66.83 224.32,-63.46 214.37,-59.83 214.27,-66.83"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801" target="_top" xlink:title="Returns the highest power of two which is not more than x.">
-<polygon fill="white" stroke="#666666" points="495.25,-54.5 378.75,-54.5 378.75,-24 495.25,-24 495.25,-54.5"/>
-<text text-anchor="start" x="386.75" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="437" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::offset</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M342.83,-54.73C350.73,-53.41 358.92,-52.05 367,-50.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="367.55,-54.17 376.84,-49.08 366.4,-47.26 367.55,-54.17"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge5_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge5_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M342.83,-24.39C350.73,-25.65 358.92,-26.96 367,-28.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="366.41,-31.7 376.84,-29.82 367.52,-24.78 366.41,-31.7"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d2e/fenwick__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d2e/fenwick__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 0b49a430b..000000000
--- a/d6/d2e/fenwick__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,14 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,46,55,72"/>
-<area shape="rect" id="Node000002" href="$d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,46,153,72"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,56,88,56,88,62,55,62"/>
-<area shape="rect" id="Node000003" href="$de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe" title="Returns the prefix sum in range from L to R." alt="" coords="201,8,356,49"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,51,186,45,187,50,154,57"/>
-<area shape="rect" id="Node000006" href="$de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9" title="Updates the value of an element in original array and accordingly updates the values in BIT array." alt="" coords="404,71,560,111"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="154,59,389,80,389,85,153,64"/>
-<area shape="rect" id="Node000004" href="$de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd" title="Returns the sum of elements in range from 0 to ID." alt="" coords="404,5,560,46"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="356,25,389,24,389,30,356,30"/>
-<area shape="rect" id="Node000005" href="$de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801" title="Returns the highest power of two which is not more than x." alt="" coords="608,39,763,79"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="560,36,592,41,592,46,559,41"/>
-<area shape="poly" id="edge6_Node000006_Node000005" title=" " alt="" coords="559,76,592,71,592,76,560,81"/>
-</map>
diff --git a/d6/d2e/fenwick__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d2e/fenwick__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index d47a6e656..000000000
--- a/d6/d2e/fenwick__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7615878d501bf0fd90c054122b1f0fad
\ No newline at end of file
diff --git a/d6/d2e/fenwick__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d2e/fenwick__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 3e48fb462..000000000
--- a/d6/d2e/fenwick__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,207 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 88 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 576;
-var viewHeight = 88;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-48.88 0,-48.88 0,-29.62 37,-29.62 37,-48.88"/>
-<text text-anchor="middle" x="18.5" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-48.88 73,-48.88 73,-29.62 110.75,-29.62 110.75,-48.88"/>
-<text text-anchor="middle" x="91.88" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-39.25C44.55,-39.25 53.37,-39.25 61.69,-39.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-42.75 71.43,-39.25 61.43,-35.75 61.43,-42.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe" target="_top" xlink:title="Returns the prefix sum in range from L to R.">
-<polygon fill="white" stroke="#666666" points="263.25,-77.5 146.75,-77.5 146.75,-47 263.25,-47 263.25,-77.5"/>
-<text text-anchor="start" x="154.75" y="-64" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="205" y="-52.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::sum_range</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.23,-43.05C118.24,-44.5 126.71,-46.25 135.66,-48.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.74,-51.49 145.25,-50.09 136.16,-44.64 134.74,-51.49"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9" target="_top" xlink:title="Updates the value of an element in original array and accordingly updates the values in BIT array.">
-<polygon fill="white" stroke="#666666" points="415.75,-30.5 299.25,-30.5 299.25,0 415.75,0 415.75,-30.5"/>
-<text text-anchor="start" x="307.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="357.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::update</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111,-37.6C146.84,-34.34 228.46,-26.91 287.78,-21.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.8,-25.02 297.44,-20.63 287.17,-18.05 287.8,-25.02"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd" target="_top" xlink:title="Returns the sum of elements in range from 0 to ID.">
-<polygon fill="white" stroke="#666666" points="415.75,-79.5 299.25,-79.5 299.25,-49 415.75,-49 415.75,-79.5"/>
-<text text-anchor="start" x="307.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="357.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::sum</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.33,-63.01C271.23,-63.12 279.42,-63.23 287.5,-63.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.27,-66.83 297.32,-63.46 287.37,-59.83 287.27,-66.83"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801" target="_top" xlink:title="Returns the highest power of two which is not more than x.">
-<polygon fill="white" stroke="#666666" points="568.25,-54.5 451.75,-54.5 451.75,-24 568.25,-24 568.25,-54.5"/>
-<text text-anchor="start" x="459.75" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="510" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::offset</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.83,-54.73C423.73,-53.41 431.92,-52.05 440,-50.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="440.55,-54.17 449.84,-49.08 439.4,-47.26 440.55,-54.17"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge6_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge6_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.83,-24.39C423.73,-25.65 431.92,-26.96 440,-28.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="439.41,-31.7 449.84,-29.82 440.52,-24.78 439.41,-31.7"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="fenwick__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d2e/fenwick__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/d2e/fenwick__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 6c310bcab..000000000
--- a/d6/d2e/fenwick__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,124 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="576pt" height="88pt"
- viewBox="0.00 0.00 576.25 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-48.88 0,-48.88 0,-29.62 37,-29.62 37,-48.88"/>
-<text text-anchor="middle" x="18.5" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-48.88 73,-48.88 73,-29.62 110.75,-29.62 110.75,-48.88"/>
-<text text-anchor="middle" x="91.88" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-39.25C44.55,-39.25 53.37,-39.25 61.69,-39.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-42.75 71.43,-39.25 61.43,-35.75 61.43,-42.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe" target="_top" xlink:title="Returns the prefix sum in range from L to R.">
-<polygon fill="white" stroke="#666666" points="263.25,-77.5 146.75,-77.5 146.75,-47 263.25,-47 263.25,-77.5"/>
-<text text-anchor="start" x="154.75" y="-64" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="205" y="-52.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::sum_range</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.23,-43.05C118.24,-44.5 126.71,-46.25 135.66,-48.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.74,-51.49 145.25,-50.09 136.16,-44.64 134.74,-51.49"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9" target="_top" xlink:title="Updates the value of an element in original array and accordingly updates the values in BIT array.">
-<polygon fill="white" stroke="#666666" points="415.75,-30.5 299.25,-30.5 299.25,0 415.75,0 415.75,-30.5"/>
-<text text-anchor="start" x="307.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="357.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::update</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111,-37.6C146.84,-34.34 228.46,-26.91 287.78,-21.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.8,-25.02 297.44,-20.63 287.17,-18.05 287.8,-25.02"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd" target="_top" xlink:title="Returns the sum of elements in range from 0 to ID.">
-<polygon fill="white" stroke="#666666" points="415.75,-79.5 299.25,-79.5 299.25,-49 415.75,-49 415.75,-79.5"/>
-<text text-anchor="start" x="307.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="357.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::sum</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.33,-63.01C271.23,-63.12 279.42,-63.23 287.5,-63.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.27,-66.83 297.32,-63.46 287.37,-59.83 287.27,-66.83"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801" target="_top" xlink:title="Returns the highest power of two which is not more than x.">
-<polygon fill="white" stroke="#666666" points="568.25,-54.5 451.75,-54.5 451.75,-24 568.25,-24 568.25,-54.5"/>
-<text text-anchor="start" x="459.75" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="510" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::offset</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.83,-54.73C423.73,-53.41 431.92,-52.05 440,-50.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="440.55,-54.17 449.84,-49.08 439.4,-47.26 440.55,-54.17"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge6_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge6_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.83,-24.39C423.73,-25.65 431.92,-26.96 440,-28.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="439.41,-31.7 449.84,-29.82 440.52,-24.78 439.41,-31.7"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d2e/fenwick__tree_8cpp_source.html b/d6/d2e/fenwick__tree_8cpp_source.html
new file mode 100644
index 000000000..0cfb40abf
--- /dev/null
+++ b/d6/d2e/fenwick__tree_8cpp_source.html
@@ -0,0 +1,228 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: range_queries/fenwick_tree.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/d2e/fenwick__tree_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">fenwick_tree.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/d2e/fenwick__tree_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="foldopen" id="foldopen00028" data-start="{" data-end="}">
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"><a class="line" href="../../dd/d69/namespacerange__queries.html">   28</a></span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d69/namespacerange__queries.html">range_queries</a> {</div>
+<div class="foldopen" id="foldopen00032" data-start="{" data-end="};">
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html">   32</a></span><span class="keyword">class </span><a class="code hl_class" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html">fenwick_tree</a> {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6">   33</a></span>    <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6">n</a> = 0;            </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#af7b7a8c1c5724ed8683d7e28bef526e6">   34</a></span>    std::vector&lt;int&gt; <a class="code hl_variable" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#af7b7a8c1c5724ed8683d7e28bef526e6">bit</a>{};  </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801">   41</a></span>    <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801">offset</a>(<span class="keywordtype">int</span> x) { <span class="keywordflow">return</span> (x &amp; (-x)); }</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00050" data-start="{" data-end="}">
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"><a class="line" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a5ea37183524553bbf2234a36a44a4b9a">   50</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a5ea37183524553bbf2234a36a44a4b9a">fenwick_tree</a>(<span class="keyword">const</span> std::vector&lt;T&gt;&amp; arr) : <a class="code hl_variable" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6">n</a>(arr.size()) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        <a class="code hl_variable" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#af7b7a8c1c5724ed8683d7e28bef526e6">bit</a>.assign(<a class="code hl_variable" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6">n</a> + 1, 0);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_variable" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6">n</a>; ++i) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            <a class="code hl_function" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9">update</a>(i, arr[i]);</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    }</div>
+</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c">   64</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c">fenwick_tree</a>(T x) : <a class="code hl_variable" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6">n</a>(x) { <a class="code hl_variable" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#af7b7a8c1c5724ed8683d7e28bef526e6">bit</a>.assign(<a class="code hl_variable" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6">n</a> + 1, 0); }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00075" data-start="{" data-end="}">
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9">   75</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9">update</a>(T <span class="keywordtype">id</span>, T val) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="keywordtype">id</span>++;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        <span class="keywordflow">while</span> (<span class="keywordtype">id</span> &lt;= <a class="code hl_variable" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6">n</a>) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            <a class="code hl_variable" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#af7b7a8c1c5724ed8683d7e28bef526e6">bit</a>[id] += val;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            <span class="keywordtype">id</span> += <a class="code hl_function" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801">offset</a>(<span class="keywordtype">id</span>);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        }</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    }</div>
+</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00090" data-start="{" data-end="}">
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd">   90</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd">sum</a>(T <span class="keywordtype">id</span>) {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        <span class="keywordtype">id</span>++;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        T res = 0;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        <span class="keywordflow">while</span> (<span class="keywordtype">id</span> &gt; 0) {</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>            res += <a class="code hl_variable" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#af7b7a8c1c5724ed8683d7e28bef526e6">bit</a>[id];</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>            <span class="keywordtype">id</span> -= <a class="code hl_function" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801">offset</a>(<span class="keywordtype">id</span>);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        <span class="keywordflow">return</span> res;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    }</div>
+</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"><a class="line" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe">  106</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe">sum_range</a>(<span class="keywordtype">int</span> l, <span class="keywordtype">int</span> r) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd">sum</a>(r) - <a class="code hl_function" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd">sum</a>(l - 1); }</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>};</div>
+</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>}  <span class="comment">// namespace range_queries</span></div>
+</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="foldopen" id="foldopen00114" data-start="{" data-end="}">
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"><a class="line" href="../../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">  114</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    std::vector&lt;int&gt; arr = {1, 2, 3, 4, 5};</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <a class="code hl_class" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html">range_queries::fenwick_tree</a> fenwick_tree(arr);</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span> </div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    assert(fenwick_tree.<a class="code hl_function" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe">sum_range</a>(0, 0) == 1);</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    assert(fenwick_tree.<a class="code hl_function" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe">sum_range</a>(0, 1) == 3);</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    assert(fenwick_tree.<a class="code hl_function" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe">sum_range</a>(0, 2) == 6);</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    assert(fenwick_tree.<a class="code hl_function" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe">sum_range</a>(0, 3) == 10);</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    assert(fenwick_tree.<a class="code hl_function" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe">sum_range</a>(0, 4) == 15);</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    fenwick_tree.<a class="code hl_function" href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9">update</a>(0, 6);</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>}</div>
+</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span> </div>
+<div class="foldopen" id="foldopen00132" data-start="{" data-end="}">
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"><a class="line" href="../../d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  132</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <a class="code hl_function" href="../../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>}</div>
+</div>
+<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html"><div class="ttname"><a href="../../de/d0d/classrange__queries_1_1fenwick__tree.html">range_queries::fenwick_tree</a></div><div class="ttdoc">The class that initializes the Fenwick Tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00032">fenwick_tree.cpp:32</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html_a0914a4b1401a7c427de91c92885724fe"><div class="ttname"><a href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe">range_queries::fenwick_tree::sum_range</a></div><div class="ttdeci">int sum_range(int l, int r)</div><div class="ttdoc">Returns the prefix sum in range from L to R.</div><div class="ttdef"><b>Definition</b> <a href="#l00106">fenwick_tree.cpp:106</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html_a19dea5e88bbd7683a719030623315de9"><div class="ttname"><a href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9">range_queries::fenwick_tree::update</a></div><div class="ttdeci">void update(T id, T val)</div><div class="ttdoc">Updates the value of an element in original array and accordingly updates the values in BIT array.</div><div class="ttdef"><b>Definition</b> <a href="#l00075">fenwick_tree.cpp:75</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html_a1fa0559d987fde0044761b17b35f5abd"><div class="ttname"><a href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd">range_queries::fenwick_tree::sum</a></div><div class="ttdeci">int sum(T id)</div><div class="ttdoc">Returns the sum of elements in range from 0 to ID.</div><div class="ttdef"><b>Definition</b> <a href="#l00090">fenwick_tree.cpp:90</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html_a5ea37183524553bbf2234a36a44a4b9a"><div class="ttname"><a href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a5ea37183524553bbf2234a36a44a4b9a">range_queries::fenwick_tree::fenwick_tree</a></div><div class="ttdeci">fenwick_tree(const std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Class Constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00050">fenwick_tree.cpp:50</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html_ab492ebf07cab0e3c32d277ad986de801"><div class="ttname"><a href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801">range_queries::fenwick_tree::offset</a></div><div class="ttdeci">int offset(int x)</div><div class="ttdoc">Returns the highest power of two which is not more than x.</div><div class="ttdef"><b>Definition</b> <a href="#l00041">fenwick_tree.cpp:41</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html_aef7ba885b91af093e9e514358fa0f36c"><div class="ttname"><a href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c">range_queries::fenwick_tree::fenwick_tree</a></div><div class="ttdeci">fenwick_tree(T x)</div><div class="ttdoc">Class Constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00064">fenwick_tree.cpp:64</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html_af7b7a8c1c5724ed8683d7e28bef526e6"><div class="ttname"><a href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#af7b7a8c1c5724ed8683d7e28bef526e6">range_queries::fenwick_tree::bit</a></div><div class="ttdeci">std::vector&lt; int &gt; bit</div><div class="ttdoc">Array that represents Binary Indexed Tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00034">fenwick_tree.cpp:34</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html_af9f543aa5976b8cc5422490b3d6250c6"><div class="ttname"><a href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6">range_queries::fenwick_tree::n</a></div><div class="ttdeci">size_t n</div><div class="ttdoc">No. of elements present in input array.</div><div class="ttdef"><b>Definition</b> <a href="#l00033">fenwick_tree.cpp:33</a></div></div>
+<div class="ttc" id="afenwick__tree_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d6/d2e/fenwick__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> <a href="#l00114">fenwick_tree.cpp:114</a></div></div>
+<div class="ttc" id="afenwick__tree_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00132">fenwick_tree.cpp:132</a></div></div>
+<div class="ttc" id="anamespacerange__queries_html"><div class="ttname"><a href="../../dd/d69/namespacerange__queries.html">range_queries</a></div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition</b> <a href="#l00028">fenwick_tree.cpp:28</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_074119ce3a874b57120c49a0cc4bb5ad.html">range_queries</a></li><li class="navelem"><a class="el" href="../../d6/d2e/fenwick__tree_8cpp.html">fenwick_tree.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/d30/classmachine__learning_1_1adaline.html b/d6/d30/classmachine__learning_1_1adaline.html
index 0669207cd..8b0a2519f 100644
--- a/d6/d30/classmachine__learning_1_1adaline.html
+++ b/d6/d30/classmachine__learning_1_1adaline.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: machine_learning::adaline Class Reference</title>
+<title>TheAlgorithms/C++: machine_learning::adaline Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,42 +140,42 @@ Collaboration diagram for machine_learning::adaline:</div>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:a0acbe32aaab897e7939e5b0454035b8c" id="r_a0acbe32aaab897e7939e5b0454035b8c"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0acbe32aaab897e7939e5b0454035b8c">adaline</a> (int num_features, const double <a class="el" href="#a28160d17e492597a2f112e0d38551cda">eta</a>=0.01f, const double <a class="el" href="#aa23d60262f917f35836ef4b1c1d9f7d3">accuracy</a>=1e-5)</td></tr>
 <tr class="separator:a0acbe32aaab897e7939e5b0454035b8c"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ab11242d9ad5b03a75911e29b04f78fd3" id="r_ab11242d9ad5b03a75911e29b04f78fd3"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab11242d9ad5b03a75911e29b04f78fd3">predict</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; double &gt; &amp;x, double *out=nullptr)</td></tr>
+<tr class="memitem:ab11242d9ad5b03a75911e29b04f78fd3" id="r_ab11242d9ad5b03a75911e29b04f78fd3"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab11242d9ad5b03a75911e29b04f78fd3">predict</a> (const std::vector&lt; double &gt; &amp;x, double *out=nullptr)</td></tr>
 <tr class="separator:ab11242d9ad5b03a75911e29b04f78fd3"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a74e3c6c037b67895014414c5d75465e5" id="r_a74e3c6c037b67895014414c5d75465e5"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a74e3c6c037b67895014414c5d75465e5">fit</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; double &gt; &amp;x, const int &amp;y)</td></tr>
+<tr class="memitem:a74e3c6c037b67895014414c5d75465e5" id="r_a74e3c6c037b67895014414c5d75465e5"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a74e3c6c037b67895014414c5d75465e5">fit</a> (const std::vector&lt; double &gt; &amp;x, const int &amp;y)</td></tr>
 <tr class="separator:a74e3c6c037b67895014414c5d75465e5"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a8d61f9ed872eef26bca39388cbda6a91" id="r_a8d61f9ed872eef26bca39388cbda6a91"><td class="memTemplParams" colspan="2">template&lt;size_t N&gt; </td></tr>
-<tr class="memitem:a8d61f9ed872eef26bca39388cbda6a91"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a8d61f9ed872eef26bca39388cbda6a91">fit</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; double &gt;, N &gt; const &amp;X, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, N &gt; const &amp;Y)</td></tr>
+<tr class="memitem:a8d61f9ed872eef26bca39388cbda6a91"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a8d61f9ed872eef26bca39388cbda6a91">fit</a> (std::array&lt; std::vector&lt; double &gt;, N &gt; const &amp;X, std::array&lt; int, N &gt; const &amp;Y)</td></tr>
 <tr class="separator:a8d61f9ed872eef26bca39388cbda6a91"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a082f758fb55fe19f22b3df66f89b2325" id="r_a082f758fb55fe19f22b3df66f89b2325"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a082f758fb55fe19f22b3df66f89b2325">activation</a> (double x)</td></tr>
 <tr class="separator:a082f758fb55fe19f22b3df66f89b2325"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
 Private Member Functions</h2></td></tr>
-<tr class="memitem:ac8a9c2aaaa63b0f27ea176857e1e7d56" id="r_ac8a9c2aaaa63b0f27ea176857e1e7d56"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac8a9c2aaaa63b0f27ea176857e1e7d56">check_size_match</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; double &gt; &amp;x)</td></tr>
+<tr class="memitem:ac8a9c2aaaa63b0f27ea176857e1e7d56" id="r_ac8a9c2aaaa63b0f27ea176857e1e7d56"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac8a9c2aaaa63b0f27ea176857e1e7d56">check_size_match</a> (const std::vector&lt; double &gt; &amp;x)</td></tr>
 <tr class="separator:ac8a9c2aaaa63b0f27ea176857e1e7d56"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a28160d17e492597a2f112e0d38551cda" id="r_a28160d17e492597a2f112e0d38551cda"><td class="memItemLeft" align="right" valign="top"><a id="a28160d17e492597a2f112e0d38551cda" name="a28160d17e492597a2f112e0d38551cda"></a>
-const double&#160;</td><td class="memItemRight" valign="bottom"><b>eta</b></td></tr>
-<tr class="memdesc:a28160d17e492597a2f112e0d38551cda"><td class="mdescLeft">&#160;</td><td class="mdescRight">learning rate of the algorithm <br /></td></tr>
+<tr class="memitem:a28160d17e492597a2f112e0d38551cda" id="r_a28160d17e492597a2f112e0d38551cda"><td class="memItemLeft" align="right" valign="top">const double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a28160d17e492597a2f112e0d38551cda">eta</a></td></tr>
+<tr class="memdesc:a28160d17e492597a2f112e0d38551cda"><td class="mdescLeft">&#160;</td><td class="mdescRight">learning rate of the algorithm  <br /></td></tr>
 <tr class="separator:a28160d17e492597a2f112e0d38551cda"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa23d60262f917f35836ef4b1c1d9f7d3" id="r_aa23d60262f917f35836ef4b1c1d9f7d3"><td class="memItemLeft" align="right" valign="top"><a id="aa23d60262f917f35836ef4b1c1d9f7d3" name="aa23d60262f917f35836ef4b1c1d9f7d3"></a>
-const double&#160;</td><td class="memItemRight" valign="bottom"><b>accuracy</b></td></tr>
-<tr class="memdesc:aa23d60262f917f35836ef4b1c1d9f7d3"><td class="mdescLeft">&#160;</td><td class="mdescRight">model fit convergence accuracy <br /></td></tr>
+<tr class="memitem:aa23d60262f917f35836ef4b1c1d9f7d3" id="r_aa23d60262f917f35836ef4b1c1d9f7d3"><td class="memItemLeft" align="right" valign="top">const double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa23d60262f917f35836ef4b1c1d9f7d3">accuracy</a></td></tr>
+<tr class="memdesc:aa23d60262f917f35836ef4b1c1d9f7d3"><td class="mdescLeft">&#160;</td><td class="mdescRight">model fit convergence accuracy  <br /></td></tr>
 <tr class="separator:aa23d60262f917f35836ef4b1c1d9f7d3"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a4cd8fe438032fedaa66f93bfd66f5492" id="r_a4cd8fe438032fedaa66f93bfd66f5492"><td class="memItemLeft" align="right" valign="top"><a id="a4cd8fe438032fedaa66f93bfd66f5492" name="a4cd8fe438032fedaa66f93bfd66f5492"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; double &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>weights</b></td></tr>
-<tr class="memdesc:a4cd8fe438032fedaa66f93bfd66f5492"><td class="mdescLeft">&#160;</td><td class="mdescRight">weights of the neural network <br /></td></tr>
+<tr class="memitem:a4cd8fe438032fedaa66f93bfd66f5492" id="r_a4cd8fe438032fedaa66f93bfd66f5492"><td class="memItemLeft" align="right" valign="top">std::vector&lt; double &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4cd8fe438032fedaa66f93bfd66f5492">weights</a></td></tr>
+<tr class="memdesc:a4cd8fe438032fedaa66f93bfd66f5492"><td class="mdescLeft">&#160;</td><td class="mdescRight">weights of the neural network  <br /></td></tr>
 <tr class="separator:a4cd8fe438032fedaa66f93bfd66f5492"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="friends" name="friends"></a>
 Friends</h2></td></tr>
-<tr class="memitem:ae347040516e995c8fb8ca2e5c0496daa" id="r_ae347040516e995c8fb8ca2e5c0496daa"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae347040516e995c8fb8ca2e5c0496daa">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, const <a class="el" href="../../d6/d30/classmachine__learning_1_1adaline.html">adaline</a> &amp;ada)</td></tr>
+<tr class="memitem:ae347040516e995c8fb8ca2e5c0496daa" id="r_ae347040516e995c8fb8ca2e5c0496daa"><td class="memItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae347040516e995c8fb8ca2e5c0496daa">operator&lt;&lt;</a> (std::ostream &amp;out, const <a class="el" href="../../d6/d30/classmachine__learning_1_1adaline.html">adaline</a> &amp;ada)</td></tr>
 <tr class="separator:ae347040516e995c8fb8ca2e5c0496daa"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
-<h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html#l00046">46</a> of file <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html">adaline_learning.cpp</a>.</p>
+</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a0acbe32aaab897e7939e5b0454035b8c" name="a0acbe32aaab897e7939e5b0454035b8c"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0acbe32aaab897e7939e5b0454035b8c">&#9670;&#160;</a></span>adaline()</h2>
 
@@ -198,14 +215,16 @@ Friends</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html">adaline_learning.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   57</span>        : <a class="code hl_variable" href="#a28160d17e492597a2f112e0d38551cda">eta</a>(<a class="code hl_variable" href="#a28160d17e492597a2f112e0d38551cda">eta</a>), <a class="code hl_variable" href="#aa23d60262f917f35836ef4b1c1d9f7d3">accuracy</a>(<a class="code hl_variable" href="#aa23d60262f917f35836ef4b1c1d9f7d3">accuracy</a>) {</div>
 <div class="line"><span class="lineno">   58</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a28160d17e492597a2f112e0d38551cda">eta</a> &lt;= 0) {</div>
-<div class="line"><span class="lineno">   59</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;learning rate should be positive and nonzero&quot;</span></div>
-<div class="line"><span class="lineno">   60</span>                      &lt;&lt; <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">   61</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">   59</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;learning rate should be positive and nonzero&quot;</span></div>
+<div class="line"><span class="lineno">   60</span>                      &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   61</span>            std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">   62</span>        }</div>
 <div class="line"><span class="lineno">   63</span> </div>
-<div class="line"><span class="lineno">   64</span>        <a class="code hl_variable" href="#a4cd8fe438032fedaa66f93bfd66f5492">weights</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a>(</div>
+<div class="line"><span class="lineno">   64</span>        <a class="code hl_variable" href="#a4cd8fe438032fedaa66f93bfd66f5492">weights</a> = std::vector&lt;double&gt;(</div>
 <div class="line"><span class="lineno">   65</span>            num_features +</div>
 <div class="line"><span class="lineno">   66</span>            1);  <span class="comment">// additional weight is for the constant bias term</span></div>
 <div class="line"><span class="lineno">   67</span> </div>
@@ -213,19 +232,10 @@ Friends</h2></td></tr>
 <div class="line"><span class="lineno">   69</span>        <span class="keywordflow">for</span> (<span class="keywordtype">double</span> &amp;weight : <a class="code hl_variable" href="#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>) weight = 1.f;</div>
 <div class="line"><span class="lineno">   70</span>        <span class="comment">// weights[i] = (static_cast&lt;double&gt;(std::rand() % 100) - 50);</span></div>
 <div class="line"><span class="lineno">   71</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::cerr</a></div></div>
-<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a28160d17e492597a2f112e0d38551cda"><div class="ttname"><a href="#a28160d17e492597a2f112e0d38551cda">machine_learning::adaline::eta</a></div><div class="ttdeci">const double eta</div><div class="ttdoc">learning rate of the algorithm</div><div class="ttdef"><b>Definition</b> adaline_learning.cpp:207</div></div>
-<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a4cd8fe438032fedaa66f93bfd66f5492"><div class="ttname"><a href="#a4cd8fe438032fedaa66f93bfd66f5492">machine_learning::adaline::weights</a></div><div class="ttdeci">std::vector&lt; double &gt; weights</div><div class="ttdoc">weights of the neural network</div><div class="ttdef"><b>Definition</b> adaline_learning.cpp:209</div></div>
-<div class="ttc" id="aclassmachine__learning_1_1adaline_html_aa23d60262f917f35836ef4b1c1d9f7d3"><div class="ttname"><a href="#aa23d60262f917f35836ef4b1c1d9f7d3">machine_learning::adaline::accuracy</a></div><div class="ttdeci">const double accuracy</div><div class="ttdoc">model fit convergence accuracy</div><div class="ttdef"><b>Definition</b> adaline_learning.cpp:208</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="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.svg" width="302" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a28160d17e492597a2f112e0d38551cda"><div class="ttname"><a href="#a28160d17e492597a2f112e0d38551cda">machine_learning::adaline::eta</a></div><div class="ttdeci">const double eta</div><div class="ttdoc">learning rate of the algorithm</div><div class="ttdef"><b>Definition</b> <a href="../../d5/db0/adaline__learning_8cpp_source.html#l00207">adaline_learning.cpp:207</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a4cd8fe438032fedaa66f93bfd66f5492"><div class="ttname"><a href="#a4cd8fe438032fedaa66f93bfd66f5492">machine_learning::adaline::weights</a></div><div class="ttdeci">std::vector&lt; double &gt; weights</div><div class="ttdoc">weights of the neural network</div><div class="ttdef"><b>Definition</b> <a href="../../d5/db0/adaline__learning_8cpp_source.html#l00209">adaline_learning.cpp:209</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1adaline_html_aa23d60262f917f35836ef4b1c1d9f7d3"><div class="ttname"><a href="#aa23d60262f917f35836ef4b1c1d9f7d3">machine_learning::adaline::accuracy</a></div><div class="ttdeci">const double accuracy</div><div class="ttdoc">model fit convergence accuracy</div><div class="ttdef"><b>Definition</b> <a href="../../d5/db0/adaline__learning_8cpp_source.html#l00208">adaline_learning.cpp:208</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Function Documentation</h2>
@@ -266,6 +276,8 @@ f(x) = \begin{cases}
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>activation output </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html#l00186">186</a> of file <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html">adaline_learning.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  186</span>{ <span class="keywordflow">return</span> x &gt; 0 ? 1 : -1; }</div>
 </div><!-- fragment -->
 </div>
@@ -282,7 +294,7 @@ f(x) = \begin{cases}
         <tr>
           <td class="memname">bool machine_learning::adaline::check_size_match </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>x</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>x</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -301,23 +313,19 @@ f(x) = \begin{cases}
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> size matches </dd>
 <dd>
 <code>false</code> size does not match </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html#l00196">196</a> of file <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html">adaline_learning.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  196</span>                                                      {</div>
-<div class="line"><span class="lineno">  197</span>        <span class="keywordflow">if</span> (x.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() != (<a class="code hl_variable" href="#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() - 1)) {</div>
-<div class="line"><span class="lineno">  198</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;: &quot;</span></div>
+<div class="line"><span class="lineno">  197</span>        <span class="keywordflow">if</span> (x.size() != (<a class="code hl_variable" href="#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>.size() - 1)) {</div>
+<div class="line"><span class="lineno">  198</span>            std::cerr &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;: &quot;</span></div>
 <div class="line"><span class="lineno">  199</span>                      &lt;&lt; <span class="stringliteral">&quot;Number of features in x does not match the feature &quot;</span></div>
 <div class="line"><span class="lineno">  200</span>                         <span class="stringliteral">&quot;dimension in model!&quot;</span></div>
-<div class="line"><span class="lineno">  201</span>                      &lt;&lt; <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">  201</span>                      &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  202</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  203</span>        }</div>
 <div class="line"><span class="lineno">  204</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  205</span>    }</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><!-- 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="../../d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.svg" width="346" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a74e3c6c037b67895014414c5d75465e5" name="a74e3c6c037b67895014414c5d75465e5"></a>
@@ -332,7 +340,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">double machine_learning::adaline::fit </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>x</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>x</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -354,6 +362,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>correction factor </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html#l00119">119</a> of file <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html">adaline_learning.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  119</span>                                                         {</div>
 <div class="line"><span class="lineno">  120</span>        <span class="keywordflow">if</span> (!<a class="code hl_function" href="#ac8a9c2aaaa63b0f27ea176857e1e7d56">check_size_match</a>(x)) {</div>
 <div class="line"><span class="lineno">  121</span>            <span class="keywordflow">return</span> 0;</div>
@@ -365,21 +375,16 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  127</span>        <span class="keywordtype">double</span> correction_factor = <a class="code hl_variable" href="#a28160d17e492597a2f112e0d38551cda">eta</a> * prediction_error;</div>
 <div class="line"><span class="lineno">  128</span> </div>
 <div class="line"><span class="lineno">  129</span>        <span class="comment">/* update each weight, the last weight is the bias term */</span></div>
-<div class="line"><span class="lineno">  130</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; x.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
+<div class="line"><span class="lineno">  130</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; x.size(); i++) {</div>
 <div class="line"><span class="lineno">  131</span>            <a class="code hl_variable" href="#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>[i] += correction_factor * x[i];</div>
 <div class="line"><span class="lineno">  132</span>        }</div>
-<div class="line"><span class="lineno">  133</span>        <a class="code hl_variable" href="#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>[x.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()] += correction_factor;  <span class="comment">// update bias</span></div>
+<div class="line"><span class="lineno">  133</span>        <a class="code hl_variable" href="#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>[x.size()] += correction_factor;  <span class="comment">// update bias</span></div>
 <div class="line"><span class="lineno">  134</span> </div>
 <div class="line"><span class="lineno">  135</span>        <span class="keywordflow">return</span> correction_factor;</div>
 <div class="line"><span class="lineno">  136</span>    }</div>
-<div class="ttc" id="aclassmachine__learning_1_1adaline_html_ab11242d9ad5b03a75911e29b04f78fd3"><div class="ttname"><a href="#ab11242d9ad5b03a75911e29b04f78fd3">machine_learning::adaline::predict</a></div><div class="ttdeci">int predict(const std::vector&lt; double &gt; &amp;x, double *out=nullptr)</div><div class="ttdef"><b>Definition</b> adaline_learning.cpp:95</div></div>
-<div class="ttc" id="aclassmachine__learning_1_1adaline_html_ac8a9c2aaaa63b0f27ea176857e1e7d56"><div class="ttname"><a href="#ac8a9c2aaaa63b0f27ea176857e1e7d56">machine_learning::adaline::check_size_match</a></div><div class="ttdeci">bool check_size_match(const std::vector&lt; double &gt; &amp;x)</div><div class="ttdef"><b>Definition</b> adaline_learning.cpp:196</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.svg" width="100%" height="570"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassmachine__learning_1_1adaline_html_ab11242d9ad5b03a75911e29b04f78fd3"><div class="ttname"><a href="#ab11242d9ad5b03a75911e29b04f78fd3">machine_learning::adaline::predict</a></div><div class="ttdeci">int predict(const std::vector&lt; double &gt; &amp;x, double *out=nullptr)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/db0/adaline__learning_8cpp_source.html#l00095">adaline_learning.cpp:95</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1adaline_html_ac8a9c2aaaa63b0f27ea176857e1e7d56"><div class="ttname"><a href="#ac8a9c2aaaa63b0f27ea176857e1e7d56">machine_learning::adaline::check_size_match</a></div><div class="ttdeci">bool check_size_match(const std::vector&lt; double &gt; &amp;x)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/db0/adaline__learning_8cpp_source.html#l00196">adaline_learning.cpp:196</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a8d61f9ed872eef26bca39388cbda6a91" name="a8d61f9ed872eef26bca39388cbda6a91"></a>
@@ -396,12 +401,12 @@ template&lt;size_t N&gt; </div>
         <tr>
           <td class="memname">void machine_learning::adaline::fit </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; double &gt;, N &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>, </td>
+          <td class="paramtype">std::array&lt; std::vector&lt; double &gt;, N &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, N &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>Y</em></span>&#160;)</td>
+          <td class="paramtype">std::array&lt; int, N &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>Y</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -417,6 +422,8 @@ template&lt;size_t N&gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html#l00145">145</a> of file <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html">adaline_learning.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  146</span>                                        {</div>
 <div class="line"><span class="lineno">  147</span>        <span class="keywordtype">double</span> avg_pred_error = 1.f;</div>
 <div class="line"><span class="lineno">  148</span> </div>
@@ -434,27 +441,22 @@ template&lt;size_t N&gt; </div>
 <div class="line"><span class="lineno">  160</span> </div>
 <div class="line"><span class="lineno">  161</span>            <span class="comment">// Print updates every 200th iteration</span></div>
 <div class="line"><span class="lineno">  162</span>            <span class="comment">// if (iter % 100 == 0)</span></div>
-<div class="line"><span class="lineno">  163</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tIter &quot;</span> &lt;&lt; iter &lt;&lt; <span class="stringliteral">&quot;: Training weights: &quot;</span> &lt;&lt; *<span class="keyword">this</span></div>
-<div class="line"><span class="lineno">  164</span>                      &lt;&lt; <span class="stringliteral">&quot;\tAvg error: &quot;</span> &lt;&lt; avg_pred_error &lt;&lt; <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">  163</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\tIter &quot;</span> &lt;&lt; iter &lt;&lt; <span class="stringliteral">&quot;: Training weights: &quot;</span> &lt;&lt; *<span class="keyword">this</span></div>
+<div class="line"><span class="lineno">  164</span>                      &lt;&lt; <span class="stringliteral">&quot;\tAvg error: &quot;</span> &lt;&lt; avg_pred_error &lt;&lt; std::endl;</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">if</span> (iter &lt; <a class="code hl_variable" href="../../d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1">MAX_ITER</a>) {</div>
-<div class="line"><span class="lineno">  168</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Converged after &quot;</span> &lt;&lt; iter &lt;&lt; <span class="stringliteral">&quot; iterations.&quot;</span></div>
-<div class="line"><span class="lineno">  169</span>                      &lt;&lt; <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">  168</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Converged after &quot;</span> &lt;&lt; iter &lt;&lt; <span class="stringliteral">&quot; iterations.&quot;</span></div>
+<div class="line"><span class="lineno">  169</span>                      &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  170</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  171</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Did not converge after &quot;</span> &lt;&lt; iter &lt;&lt; <span class="stringliteral">&quot; iterations.&quot;</span></div>
-<div class="line"><span class="lineno">  172</span>                      &lt;&lt; <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">  171</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Did not converge after &quot;</span> &lt;&lt; iter &lt;&lt; <span class="stringliteral">&quot; iterations.&quot;</span></div>
+<div class="line"><span class="lineno">  172</span>                      &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  173</span>        }</div>
 <div class="line"><span class="lineno">  174</span>    }</div>
-<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a74e3c6c037b67895014414c5d75465e5"><div class="ttname"><a href="#a74e3c6c037b67895014414c5d75465e5">machine_learning::adaline::fit</a></div><div class="ttdeci">double fit(const std::vector&lt; double &gt; &amp;x, const int &amp;y)</div><div class="ttdef"><b>Definition</b> adaline_learning.cpp:119</div></div>
-<div class="ttc" id="agroup__machine__learning_html_ga5118e5cbc4f0886e27b3a7a2544dded1"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1">MAX_ITER</a></div><div class="ttdeci">constexpr int MAX_ITER</div><div class="ttdef"><b>Definition</b> adaline_learning.cpp:40</div></div>
-<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a74e3c6c037b67895014414c5d75465e5"><div class="ttname"><a href="#a74e3c6c037b67895014414c5d75465e5">machine_learning::adaline::fit</a></div><div class="ttdeci">double fit(const std::vector&lt; double &gt; &amp;x, const int &amp;y)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/db0/adaline__learning_8cpp_source.html#l00119">adaline_learning.cpp:119</a></div></div>
+<div class="ttc" id="agroup__machine__learning_html_ga5118e5cbc4f0886e27b3a7a2544dded1"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1">MAX_ITER</a></div><div class="ttdeci">constexpr int MAX_ITER</div><div class="ttdef"><b>Definition</b> <a href="../../d5/db0/adaline__learning_8cpp_source.html#l00040">adaline_learning.cpp:40</a></div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ab11242d9ad5b03a75911e29b04f78fd3" name="ab11242d9ad5b03a75911e29b04f78fd3"></a>
@@ -469,7 +471,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">int machine_learning::adaline::predict </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>x</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>x</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -491,15 +493,17 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>model prediction output </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html#l00095">95</a> of file <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html">adaline_learning.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   95</span>                                                                   {</div>
 <div class="line"><span class="lineno">   96</span>        <span class="keywordflow">if</span> (!<a class="code hl_function" href="#ac8a9c2aaaa63b0f27ea176857e1e7d56">check_size_match</a>(x)) {</div>
 <div class="line"><span class="lineno">   97</span>            <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   98</span>        }</div>
 <div class="line"><span class="lineno">   99</span> </div>
-<div class="line"><span class="lineno">  100</span>        <span class="keywordtype">double</span> y = <a class="code hl_variable" href="#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/back.html">back</a>();  <span class="comment">// assign bias value</span></div>
+<div class="line"><span class="lineno">  100</span>        <span class="keywordtype">double</span> y = <a class="code hl_variable" href="#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>.back();  <span class="comment">// assign bias value</span></div>
 <div class="line"><span class="lineno">  101</span> </div>
 <div class="line"><span class="lineno">  102</span>        <span class="comment">// for (int i = 0; i &lt; x.size(); i++) y += x[i] * weights[i];</span></div>
-<div class="line"><span class="lineno">  103</span>        y = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html">std::inner_product</a>(x.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), x.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>(), <a class="code hl_variable" href="#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), y);</div>
+<div class="line"><span class="lineno">  103</span>        y = std::inner_product(x.begin(), x.end(), <a class="code hl_variable" href="#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>.begin(), y);</div>
 <div class="line"><span class="lineno">  104</span> </div>
 <div class="line"><span class="lineno">  105</span>        <span class="keywordflow">if</span> (out != <span class="keyword">nullptr</span>) {  <span class="comment">// if out variable is provided</span></div>
 <div class="line"><span class="lineno">  106</span>            *out = y;</div>
@@ -507,17 +511,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  108</span> </div>
 <div class="line"><span class="lineno">  109</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a082f758fb55fe19f22b3df66f89b2325">activation</a>(y);  <span class="comment">// quantizer: apply ADALINE threshold function</span></div>
 <div class="line"><span class="lineno">  110</span>    }</div>
-<div class="ttc" id="aback_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/back.html">std::vector::back</a></div><div class="ttdeci">T back(T... args)</div></div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a082f758fb55fe19f22b3df66f89b2325"><div class="ttname"><a href="#a082f758fb55fe19f22b3df66f89b2325">machine_learning::adaline::activation</a></div><div class="ttdeci">int activation(double x)</div><div class="ttdef"><b>Definition</b> adaline_learning.cpp:186</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="ainner_product_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html">std::inner_product</a></div><div class="ttdeci">T inner_product(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.svg" width="566" height="315"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a082f758fb55fe19f22b3df66f89b2325"><div class="ttname"><a href="#a082f758fb55fe19f22b3df66f89b2325">machine_learning::adaline::activation</a></div><div class="ttdeci">int activation(double x)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/db0/adaline__learning_8cpp_source.html#l00186">adaline_learning.cpp:186</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Friends And Related Symbol Documentation</h2>
@@ -531,9 +526,9 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; operator&lt;&lt; </td>
+          <td class="memname">std::ostream &amp; operator&lt;&lt; </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
+          <td class="paramtype">std::ostream &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -548,11 +543,13 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Operator to print the weights of the model </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html#l00076">76</a> of file <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html">adaline_learning.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   76</span>                                                                       {</div>
 <div class="line"><span class="lineno">   77</span>        out &lt;&lt; <span class="stringliteral">&quot;&lt;&quot;</span>;</div>
-<div class="line"><span class="lineno">   78</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; ada.<a class="code hl_variable" href="#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
+<div class="line"><span class="lineno">   78</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; ada.<a class="code hl_variable" href="#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>.size(); i++) {</div>
 <div class="line"><span class="lineno">   79</span>            out &lt;&lt; ada.<a class="code hl_variable" href="#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>[i];</div>
-<div class="line"><span class="lineno">   80</span>            <span class="keywordflow">if</span> (i &lt; ada.<a class="code hl_variable" href="#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() - 1) {</div>
+<div class="line"><span class="lineno">   80</span>            <span class="keywordflow">if</span> (i &lt; ada.<a class="code hl_variable" href="#a4cd8fe438032fedaa66f93bfd66f5492">weights</a>.size() - 1) {</div>
 <div class="line"><span class="lineno">   81</span>                out &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
 <div class="line"><span class="lineno">   82</span>            }</div>
 <div class="line"><span class="lineno">   83</span>        }</div>
@@ -560,10 +557,89 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   85</span>        <span class="keywordflow">return</span> out;</div>
 <div class="line"><span class="lineno">   86</span>    }</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="aa23d60262f917f35836ef4b1c1d9f7d3" name="aa23d60262f917f35836ef4b1c1d9f7d3"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aa23d60262f917f35836ef4b1c1d9f7d3">&#9670;&#160;</a></span>accuracy</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">const double machine_learning::adaline::accuracy</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>model fit convergence accuracy </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html#l00208">208</a> of file <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html">adaline_learning.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a28160d17e492597a2f112e0d38551cda" name="a28160d17e492597a2f112e0d38551cda"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a28160d17e492597a2f112e0d38551cda">&#9670;&#160;</a></span>eta</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">const double machine_learning::adaline::eta</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>learning rate of the algorithm </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html#l00207">207</a> of file <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html">adaline_learning.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a4cd8fe438032fedaa66f93bfd66f5492" name="a4cd8fe438032fedaa66f93bfd66f5492"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a4cd8fe438032fedaa66f93bfd66f5492">&#9670;&#160;</a></span>weights</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;double&gt; machine_learning::adaline::weights</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>weights of the neural network </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html#l00209">209</a> of file <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html">adaline_learning.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>machine_learning/<a class="el" href="../../d5/db0/adaline__learning_8cpp.html">adaline_learning.cpp</a></li>
+<li>machine_learning/<a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html">adaline_learning.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.map b/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.map
deleted file mode 100644
index b6af92c4f..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="machine_learning::adaline::adaline" name="machine_learning::adaline::adaline">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,23,177,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="225,5,296,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="177,28,209,23,210,28,178,33"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="226,55,294,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="178,53,211,58,210,63,177,58"/>
-</map>
diff --git a/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.md5 b/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.md5
deleted file mode 100644
index 6c775c279..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cf0075b633519d84a8808709a068b858
\ No newline at end of file
diff --git a/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.svg b/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.svg
deleted file mode 100644
index ebaadfa19..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::adaline::adaline Pages: 1 -->
-<svg width="226pt" height="64pt"
- viewBox="0.00 0.00 226.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>machine_learning::adaline::adaline</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="128.5,-42.88 0,-42.88 0,-12.37 128.5,-12.37 128.5,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="64.25" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::adaline</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="218,-56.25 164.5,-56.25 164.5,-37 218,-37 218,-56.25"/>
-<text text-anchor="middle" x="191.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.85,-37.29C137.18,-38.56 145.48,-39.82 153.17,-40.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.37,-44.41 162.79,-42.45 153.43,-37.49 152.37,-44.41"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.88,-19.25 165.62,-19.25 165.62,0 216.88,0 216.88,-19.25"/>
-<text text-anchor="middle" x="191.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.85,-18.47C137.42,-17.23 145.96,-16 153.83,-14.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.28,-18.34 163.68,-13.45 153.28,-11.41 154.28,-18.34"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph_org.svg b/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph_org.svg
deleted file mode 100644
index d2c20ad5d..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::adaline::adaline Pages: 1 -->
-<svg width="226pt" height="64pt"
- viewBox="0.00 0.00 226.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>machine_learning::adaline::adaline</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="128.5,-42.88 0,-42.88 0,-12.37 128.5,-12.37 128.5,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="64.25" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::adaline</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="218,-56.25 164.5,-56.25 164.5,-37 218,-37 218,-56.25"/>
-<text text-anchor="middle" x="191.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.85,-37.29C137.18,-38.56 145.48,-39.82 153.17,-40.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.37,-44.41 162.79,-42.45 153.43,-37.49 152.37,-44.41"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.88,-19.25 165.62,-19.25 165.62,0 216.88,0 216.88,-19.25"/>
-<text text-anchor="middle" x="191.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.85,-18.47C137.42,-17.23 145.96,-16 153.83,-14.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.28,-18.34 163.68,-13.45 153.28,-11.41 154.28,-18.34"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.map b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.map
deleted file mode 100644
index a4a1e42e1..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.map
+++ /dev/null
@@ -1,23 +0,0 @@
-<map id="machine_learning::adaline::fit" name="machine_learning::adaline::fit">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,59,196,84"/>
-<area shape="rect" id="Node000002" href="$d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56" title=" " alt="" coords="463,51,634,92"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="196,69,447,69,447,74,196,74"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="682,5,798,31"/>
-<area shape="poly" id="edge11_Node000001_Node000004" title=" " alt="" coords="196,56,243,50,475,31,667,19,667,24,476,36,244,55,196,61"/>
-<area shape="rect" id="Node000005" href="$d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3" title=" " alt="" coords="244,158,415,198"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="131,82,272,149,269,153,129,87"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="704,59,776,84"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="635,69,689,69,689,74,635,74"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="623,48,676,33,677,38,625,53"/>
-<area shape="poly" id="edge8_Node000005_Node000002" title=" " alt="" coords="363,155,462,101,474,96,476,101,464,106,365,160"/>
-<area shape="rect" id="Node000006" href="$d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325" title=" " alt="" coords="463,215,634,256"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="410,196,454,208,453,213,409,202"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="489,280,608,306"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="358,197,406,231,464,265,481,272,479,277,462,270,403,236,355,201"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="488,329,610,355"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="347,197,395,257,427,289,464,316,474,321,472,326,462,320,424,293,391,260,343,201"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="492,116,605,142"/>
-<area shape="poly" id="edge9_Node000005_Node000009" title=" " alt="" coords="414,156,477,142,478,147,416,162"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/inner_product.html#" title=" " alt="" coords="486,165,611,191"/>
-<area shape="poly" id="edge10_Node000005_Node000010" title=" " alt="" coords="415,176,471,176,471,181,415,181"/>
-</map>
diff --git a/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.md5 b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.md5
deleted file mode 100644
index af67806ed..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c49a3c1aaf4ca8babec86e4e8ac4dcbb
\ No newline at end of file
diff --git a/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.svg b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.svg
deleted file mode 100644
index 75b05fa79..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.svg
+++ /dev/null
@@ -1,287 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::adaline::fit Pages: 1 -->
-<!--zoomable 270 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 602;
-var viewHeight = 270;
-var sectionId = 'dynsection-3';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>machine_learning::adaline::fit</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="142.75,-222.25 0,-222.25 0,-203 142.75,-203 142.75,-222.25"/>
-<text text-anchor="middle" x="71.38" y="-208.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline::fit</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="471.75,-227.88 343.25,-227.88 343.25,-197.38 471.75,-197.38 471.75,-227.88"/>
-<text text-anchor="start" x="351.25" y="-214.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="407.5" y="-203.12" font-family="Helvetica,sans-Serif" font-size="10.00">::check_size_match</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M143.23,-212.62C198.52,-212.62 275.13,-212.62 331.46,-212.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.29,-216.13 341.29,-212.63 331.29,-209.13 331.29,-216.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="594.25,-262.25 507.75,-262.25 507.75,-243 594.25,-243 594.25,-262.25"/>
-<text text-anchor="middle" x="551" y="-248.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge11_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge11_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.97,-222.53C154.9,-224.03 167.17,-225.46 178.75,-226.62 291.49,-237.98 423.98,-245.98 496.26,-249.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.65,-253.36 505.82,-250.4 496.02,-246.37 495.65,-253.36"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="307.25,-147.88 178.75,-147.88 178.75,-117.38 307.25,-117.38 307.25,-147.88"/>
-<text text-anchor="start" x="186.75" y="-134.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="243" y="-123.12" font-family="Helvetica,sans-Serif" font-size="10.00">::predict</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.52,-202.65C119.75,-190.28 165.15,-168.87 198.86,-152.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="199.99,-156.31 207.54,-148.88 197.01,-149.98 199.99,-156.31"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="577.75,-222.25 524.25,-222.25 524.25,-203 577.75,-203 577.75,-222.25"/>
-<text text-anchor="middle" x="551" y="-208.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M472.21,-212.62C486,-212.62 500.15,-212.62 512.53,-212.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="512.28,-216.13 522.28,-212.63 512.28,-209.13 512.28,-216.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M464.02,-228.32C477.07,-232.01 490.85,-235.91 503.47,-239.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="502.17,-242.74 512.75,-242.09 504.08,-236.01 502.17,-242.74"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge8_Node000005_Node000002" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge8_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M269.15,-148.21C288.88,-160.1 317.27,-176.45 343.25,-188.62 346.14,-189.98 349.13,-191.32 352.17,-192.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.61,-195.77 361.19,-196.37 353.3,-189.3 350.61,-195.77"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="471.75,-104.88 343.25,-104.88 343.25,-74.38 471.75,-74.38 471.75,-104.88"/>
-<text text-anchor="start" x="351.25" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="407.5" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::activation</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.13,-116.98C313.88,-114.13 325.19,-111.14 336.23,-108.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.91,-111.66 345.68,-105.72 335.12,-104.89 336.91,-111.66"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="452.25,-56.25 362.75,-56.25 362.75,-37 452.25,-37 452.25,-56.25"/>
-<text text-anchor="middle" x="407.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.09,-117.16C282.33,-102.2 313.38,-79.79 343.25,-65.62 347.22,-63.74 351.41,-62 355.68,-60.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="356.61,-63.78 364.91,-57.19 354.31,-57.17 356.61,-63.78"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="453.38,-19.25 361.62,-19.25 361.62,0 453.38,0 453.38,-19.25"/>
-<text text-anchor="middle" x="407.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.57,-116.93C270.89,-93.91 304.43,-51.18 343.25,-27.62 345.68,-26.15 348.24,-24.79 350.88,-23.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.03,-26.85 359.95,-19.8 349.37,-20.38 352.03,-26.85"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="449.62,-179.25 365.38,-179.25 365.38,-160 449.62,-160 449.62,-179.25"/>
-<text text-anchor="middle" x="407.5" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge9_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge9_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.29,-147.04C322.77,-150.56 339.17,-154.29 354.08,-157.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="353.15,-161.07 363.67,-159.87 354.7,-154.24 353.15,-161.07"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="454.5,-142.25 360.5,-142.25 360.5,-123 454.5,-123 454.5,-142.25"/>
-<text text-anchor="middle" x="407.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::inner_product</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge10_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge10_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.29,-132.62C321.08,-132.62 335.59,-132.62 349.13,-132.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.72,-136.13 358.72,-132.63 348.72,-129.13 348.72,-136.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph_org.svg b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph_org.svg
deleted file mode 100644
index 1109fa92a..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph_org.svg
+++ /dev/null
@@ -1,204 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::adaline::fit Pages: 1 -->
-<svg width="602pt" height="270pt"
- viewBox="0.00 0.00 602.25 270.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 266.25)">
-<title>machine_learning::adaline::fit</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="142.75,-222.25 0,-222.25 0,-203 142.75,-203 142.75,-222.25"/>
-<text text-anchor="middle" x="71.38" y="-208.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline::fit</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="471.75,-227.88 343.25,-227.88 343.25,-197.38 471.75,-197.38 471.75,-227.88"/>
-<text text-anchor="start" x="351.25" y="-214.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="407.5" y="-203.12" font-family="Helvetica,sans-Serif" font-size="10.00">::check_size_match</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M143.23,-212.62C198.52,-212.62 275.13,-212.62 331.46,-212.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.29,-216.13 341.29,-212.63 331.29,-209.13 331.29,-216.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="594.25,-262.25 507.75,-262.25 507.75,-243 594.25,-243 594.25,-262.25"/>
-<text text-anchor="middle" x="551" y="-248.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge11_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge11_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.97,-222.53C154.9,-224.03 167.17,-225.46 178.75,-226.62 291.49,-237.98 423.98,-245.98 496.26,-249.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.65,-253.36 505.82,-250.4 496.02,-246.37 495.65,-253.36"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="307.25,-147.88 178.75,-147.88 178.75,-117.38 307.25,-117.38 307.25,-147.88"/>
-<text text-anchor="start" x="186.75" y="-134.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="243" y="-123.12" font-family="Helvetica,sans-Serif" font-size="10.00">::predict</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.52,-202.65C119.75,-190.28 165.15,-168.87 198.86,-152.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="199.99,-156.31 207.54,-148.88 197.01,-149.98 199.99,-156.31"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="577.75,-222.25 524.25,-222.25 524.25,-203 577.75,-203 577.75,-222.25"/>
-<text text-anchor="middle" x="551" y="-208.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M472.21,-212.62C486,-212.62 500.15,-212.62 512.53,-212.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="512.28,-216.13 522.28,-212.63 512.28,-209.13 512.28,-216.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M464.02,-228.32C477.07,-232.01 490.85,-235.91 503.47,-239.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="502.17,-242.74 512.75,-242.09 504.08,-236.01 502.17,-242.74"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge8_Node000005_Node000002" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge8_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M269.15,-148.21C288.88,-160.1 317.27,-176.45 343.25,-188.62 346.14,-189.98 349.13,-191.32 352.17,-192.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.61,-195.77 361.19,-196.37 353.3,-189.3 350.61,-195.77"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="471.75,-104.88 343.25,-104.88 343.25,-74.38 471.75,-74.38 471.75,-104.88"/>
-<text text-anchor="start" x="351.25" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="407.5" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::activation</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.13,-116.98C313.88,-114.13 325.19,-111.14 336.23,-108.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.91,-111.66 345.68,-105.72 335.12,-104.89 336.91,-111.66"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="452.25,-56.25 362.75,-56.25 362.75,-37 452.25,-37 452.25,-56.25"/>
-<text text-anchor="middle" x="407.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.09,-117.16C282.33,-102.2 313.38,-79.79 343.25,-65.62 347.22,-63.74 351.41,-62 355.68,-60.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="356.61,-63.78 364.91,-57.19 354.31,-57.17 356.61,-63.78"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="453.38,-19.25 361.62,-19.25 361.62,0 453.38,0 453.38,-19.25"/>
-<text text-anchor="middle" x="407.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.57,-116.93C270.89,-93.91 304.43,-51.18 343.25,-27.62 345.68,-26.15 348.24,-24.79 350.88,-23.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.03,-26.85 359.95,-19.8 349.37,-20.38 352.03,-26.85"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="449.62,-179.25 365.38,-179.25 365.38,-160 449.62,-160 449.62,-179.25"/>
-<text text-anchor="middle" x="407.5" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge9_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge9_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.29,-147.04C322.77,-150.56 339.17,-154.29 354.08,-157.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="353.15,-161.07 363.67,-159.87 354.7,-154.24 353.15,-161.07"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="454.5,-142.25 360.5,-142.25 360.5,-123 454.5,-123 454.5,-142.25"/>
-<text text-anchor="middle" x="407.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::inner_product</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge10_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge10_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.29,-132.62C321.08,-132.62 335.59,-132.62 349.13,-132.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.72,-136.13 358.72,-132.63 348.72,-129.13 348.72,-136.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph.map b/d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph.map
deleted file mode 100644
index dfe8dca3d..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph.map
+++ /dev/null
@@ -1,26 +0,0 @@
-<map id="machine_learning::adaline::fit" name="machine_learning::adaline::fit">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,165,196,191"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="943,328,1014,354"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="123,162,174,135,247,100,338,63,442,31,552,9,609,4,665,4,720,9,774,22,826,41,874,69,902,94,925,123,942,156,956,190,972,258,978,312,973,313,967,259,951,192,937,158,920,126,898,97,871,74,823,46,772,27,719,15,665,9,609,9,553,14,443,36,340,68,249,105,176,140,126,167"/>
-<area shape="rect" id="Node000003" href="$d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5" title=" " alt="" coords="244,268,434,294"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="134,189,294,259,292,264,132,194"/>
-<area shape="rect" id="Node000004" href="$d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56" title=" " alt="" coords="701,347,873,388"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="410,292,686,345,685,351,409,297"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="921,381,1036,407"/>
-<area shape="poly" id="edge13_Node000003_Node000005" title=" " alt="" coords="367,292,420,317,483,342,591,377,702,397,749,401,787,401,873,397,905,396,905,401,873,402,787,406,749,406,701,402,589,382,481,347,418,322,365,297"/>
-<area shape="rect" id="Node000006" href="$d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3" title=" " alt="" coords="482,232,653,273"/>
-<area shape="poly" id="edge6_Node000003_Node000006" title=" " alt="" coords="434,266,466,262,467,268,434,272"/>
-<area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="873,353,927,345,927,350,874,358"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="874,377,906,381,905,387,873,382"/>
-<area shape="poly" id="edge10_Node000006_Node000004" title=" " alt="" coords="600,271,647,302,703,333,713,338,711,343,700,338,645,307,597,276"/>
-<area shape="rect" id="Node000007" href="$d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325" title=" " alt="" coords="701,232,873,273"/>
-<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="653,250,686,250,686,255,653,255"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="727,297,847,323"/>
-<area shape="poly" id="edge8_Node000006_Node000008" title=" " alt="" coords="649,271,721,290,720,295,647,276"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="726,84,848,110"/>
-<area shape="poly" id="edge9_Node000006_Node000009" title=" " alt="" coords="582,230,630,175,663,144,700,118,710,113,713,118,703,123,667,149,634,178,586,234"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="731,133,843,159"/>
-<area shape="poly" id="edge11_Node000006_Node000010" title=" " alt="" coords="596,230,643,198,700,168,715,162,717,167,702,172,646,203,599,234"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/inner_product.html#" title=" " alt="" coords="724,183,850,208"/>
-<area shape="poly" id="edge12_Node000006_Node000011" title=" " alt="" coords="647,229,720,210,721,215,649,234"/>
-</map>
diff --git a/d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph.md5 b/d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph.md5
deleted file mode 100644
index 7753a2fa8..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a00f04c002fc001b47814b2df6fff8f4
\ No newline at end of file
diff --git a/d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph.svg b/d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph.svg
deleted file mode 100644
index c62d8d26b..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph.svg
+++ /dev/null
@@ -1,314 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::adaline::fit Pages: 1 -->
-<!--zoomable 309 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 781;
-var viewHeight = 309;
-var sectionId = 'dynsection-4';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>machine_learning::adaline::fit</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="142.75,-181.25 0,-181.25 0,-162 142.75,-162 142.75,-181.25"/>
-<text text-anchor="middle" x="71.38" y="-167.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline::fit</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="756.5,-59.25 703,-59.25 703,-40 756.5,-40 756.5,-59.25"/>
-<text text-anchor="middle" x="729.75" y="-45.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.43,-181.64C163.76,-223.84 464.09,-379.32 650.5,-251.62 711.24,-210.02 724.84,-113.93 727.88,-71.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="731.37,-71.21 728.44,-61.03 724.39,-70.82 731.37,-71.21"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321.5,-104.25 178.75,-104.25 178.75,-85 321.5,-85 321.5,-104.25"/>
-<text text-anchor="middle" x="250.12" y="-90.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline::fit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.48,-161.56C126.18,-148.19 180.62,-124.47 215.77,-109.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="216.85,-112.5 224.62,-105.3 214.06,-106.08 216.85,-112.5"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="650.5,-44.88 522,-44.88 522,-14.37 650.5,-14.37 650.5,-44.88"/>
-<text text-anchor="start" x="530" y="-31.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="586.25" y="-20.12" font-family="Helvetica,sans-Serif" font-size="10.00">::check_size_match</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.97,-84.54C358.56,-73.73 447.34,-56.45 510.49,-44.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="510.94,-47.65 520.08,-42.3 509.6,-40.78 510.94,-47.65"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="773,-19.25 686.5,-19.25 686.5,0 773,0 773,-19.25"/>
-<text text-anchor="middle" x="729.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge13_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge13_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.69,-84.51C291.71,-73.95 326.3,-57.45 357.5,-46.62 428.68,-21.92 447.21,-14.8 522,-5.62 578.69,1.33 593.41,-4.17 650.5,-5.62 658.36,-5.83 666.65,-6.14 674.79,-6.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="674.45,-9.99 684.61,-6.98 674.79,-3 674.45,-9.99"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="486,-130.88 357.5,-130.88 357.5,-100.38 486,-100.38 486,-130.88"/>
-<text text-anchor="start" x="365.5" y="-117.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="421.75" y="-106.12" font-family="Helvetica,sans-Serif" font-size="10.00">::predict</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.59,-103.35C329.57,-104.34 337.72,-105.35 345.76,-106.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.16,-109.79 355.51,-107.55 346.02,-102.85 345.16,-109.79"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M650.96,-38.63C664.75,-40.58 678.9,-42.58 691.28,-44.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="690.65,-47.78 701.05,-45.71 691.63,-40.84 690.65,-47.78"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M650.96,-20.62C658.95,-19.49 667.05,-18.35 674.87,-17.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="675.15,-20.74 684.56,-15.87 674.17,-13.81 675.15,-20.74"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge10_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge10_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M444.88,-100.04C464.53,-86.63 494.34,-67.35 522,-53.62 524.67,-52.3 527.43,-51 530.24,-49.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="531.34,-53.08 539.15,-45.93 528.58,-46.64 531.34,-53.08"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="650.5,-130.88 522,-130.88 522,-100.38 650.5,-100.38 650.5,-130.88"/>
-<text text-anchor="start" x="530" y="-117.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="586.25" y="-106.12" font-family="Helvetica,sans-Serif" font-size="10.00">::activation</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.04,-115.62C493.98,-115.62 502.15,-115.62 510.24,-115.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="510.08,-119.13 520.08,-115.63 510.08,-112.13 510.08,-119.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="631,-82.25 541.5,-82.25 541.5,-63 631,-63 631,-82.25"/>
-<text text-anchor="middle" x="586.25" y="-68.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge8_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge8_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M481.88,-99.98C499.74,-95.25 519.15,-90.12 536.28,-85.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="536.93,-89.03 545.7,-83.09 535.14,-82.27 536.93,-89.03"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="632.12,-242.25 540.38,-242.25 540.38,-223 632.12,-223 632.12,-242.25"/>
-<text text-anchor="middle" x="586.25" y="-228.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge9_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge9_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M434.09,-131.12C450.87,-152.96 484.43,-192.58 522,-214.62 524.46,-216.07 527.03,-217.4 529.68,-218.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="528.2,-221.8 538.78,-222.31 530.83,-215.31 528.2,-221.8"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="628.38,-205.25 544.12,-205.25 544.12,-186 628.38,-186 628.38,-205.25"/>
-<text text-anchor="middle" x="586.25" y="-191.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge11_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge11_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M443.84,-131.26C463.3,-145.07 493.4,-164.93 522,-177.62 525.55,-179.2 529.28,-180.68 533.07,-182.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="531.8,-185.32 542.39,-185.17 534.02,-178.68 531.8,-185.32"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="633.25,-168.25 539.25,-168.25 539.25,-149 633.25,-149 633.25,-168.25"/>
-<text text-anchor="middle" x="586.25" y="-154.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::inner_product</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge12_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge12_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M481.88,-131.27C499.74,-136 519.15,-141.13 536.28,-145.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="535.14,-148.98 545.7,-148.16 536.93,-142.22 535.14,-148.98"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph_org.svg b/d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph_org.svg
deleted file mode 100644
index a684fbed4..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_a8d61f9ed872eef26bca39388cbda6a91_cgraph_org.svg
+++ /dev/null
@@ -1,231 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::adaline::fit Pages: 1 -->
-<svg width="781pt" height="309pt"
- viewBox="0.00 0.00 781.00 309.18" 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 305.18)">
-<title>machine_learning::adaline::fit</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="142.75,-181.25 0,-181.25 0,-162 142.75,-162 142.75,-181.25"/>
-<text text-anchor="middle" x="71.38" y="-167.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline::fit</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="756.5,-59.25 703,-59.25 703,-40 756.5,-40 756.5,-59.25"/>
-<text text-anchor="middle" x="729.75" y="-45.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.43,-181.64C163.76,-223.84 464.09,-379.32 650.5,-251.62 711.24,-210.02 724.84,-113.93 727.88,-71.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="731.37,-71.21 728.44,-61.03 724.39,-70.82 731.37,-71.21"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321.5,-104.25 178.75,-104.25 178.75,-85 321.5,-85 321.5,-104.25"/>
-<text text-anchor="middle" x="250.12" y="-90.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline::fit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.48,-161.56C126.18,-148.19 180.62,-124.47 215.77,-109.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="216.85,-112.5 224.62,-105.3 214.06,-106.08 216.85,-112.5"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="650.5,-44.88 522,-44.88 522,-14.37 650.5,-14.37 650.5,-44.88"/>
-<text text-anchor="start" x="530" y="-31.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="586.25" y="-20.12" font-family="Helvetica,sans-Serif" font-size="10.00">::check_size_match</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.97,-84.54C358.56,-73.73 447.34,-56.45 510.49,-44.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="510.94,-47.65 520.08,-42.3 509.6,-40.78 510.94,-47.65"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="773,-19.25 686.5,-19.25 686.5,0 773,0 773,-19.25"/>
-<text text-anchor="middle" x="729.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge13_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge13_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.69,-84.51C291.71,-73.95 326.3,-57.45 357.5,-46.62 428.68,-21.92 447.21,-14.8 522,-5.62 578.69,1.33 593.41,-4.17 650.5,-5.62 658.36,-5.83 666.65,-6.14 674.79,-6.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="674.45,-9.99 684.61,-6.98 674.79,-3 674.45,-9.99"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="486,-130.88 357.5,-130.88 357.5,-100.38 486,-100.38 486,-130.88"/>
-<text text-anchor="start" x="365.5" y="-117.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="421.75" y="-106.12" font-family="Helvetica,sans-Serif" font-size="10.00">::predict</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.59,-103.35C329.57,-104.34 337.72,-105.35 345.76,-106.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.16,-109.79 355.51,-107.55 346.02,-102.85 345.16,-109.79"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M650.96,-38.63C664.75,-40.58 678.9,-42.58 691.28,-44.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="690.65,-47.78 701.05,-45.71 691.63,-40.84 690.65,-47.78"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M650.96,-20.62C658.95,-19.49 667.05,-18.35 674.87,-17.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="675.15,-20.74 684.56,-15.87 674.17,-13.81 675.15,-20.74"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge10_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge10_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M444.88,-100.04C464.53,-86.63 494.34,-67.35 522,-53.62 524.67,-52.3 527.43,-51 530.24,-49.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="531.34,-53.08 539.15,-45.93 528.58,-46.64 531.34,-53.08"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="650.5,-130.88 522,-130.88 522,-100.38 650.5,-100.38 650.5,-130.88"/>
-<text text-anchor="start" x="530" y="-117.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="586.25" y="-106.12" font-family="Helvetica,sans-Serif" font-size="10.00">::activation</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.04,-115.62C493.98,-115.62 502.15,-115.62 510.24,-115.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="510.08,-119.13 520.08,-115.63 510.08,-112.13 510.08,-119.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="631,-82.25 541.5,-82.25 541.5,-63 631,-63 631,-82.25"/>
-<text text-anchor="middle" x="586.25" y="-68.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge8_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge8_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M481.88,-99.98C499.74,-95.25 519.15,-90.12 536.28,-85.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="536.93,-89.03 545.7,-83.09 535.14,-82.27 536.93,-89.03"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="632.12,-242.25 540.38,-242.25 540.38,-223 632.12,-223 632.12,-242.25"/>
-<text text-anchor="middle" x="586.25" y="-228.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge9_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge9_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M434.09,-131.12C450.87,-152.96 484.43,-192.58 522,-214.62 524.46,-216.07 527.03,-217.4 529.68,-218.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="528.2,-221.8 538.78,-222.31 530.83,-215.31 528.2,-221.8"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="628.38,-205.25 544.12,-205.25 544.12,-186 628.38,-186 628.38,-205.25"/>
-<text text-anchor="middle" x="586.25" y="-191.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge11_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge11_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M443.84,-131.26C463.3,-145.07 493.4,-164.93 522,-177.62 525.55,-179.2 529.28,-180.68 533.07,-182.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="531.8,-185.32 542.39,-185.17 534.02,-178.68 531.8,-185.32"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="633.25,-168.25 539.25,-168.25 539.25,-149 633.25,-149 633.25,-168.25"/>
-<text text-anchor="middle" x="586.25" y="-154.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::inner_product</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge12_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge12_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M481.88,-131.27C499.74,-136 519.15,-141.13 536.28,-145.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="535.14,-148.98 545.7,-148.16 536.93,-142.22 535.14,-148.98"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.map b/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.map
deleted file mode 100644
index daf1a25a3..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="machine_learning::adaline::predict" name="machine_learning::adaline::predict">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,141,177,182"/>
-<area shape="rect" id="Node000002" href="$d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325" title=" " alt="" coords="225,5,396,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="113,139,161,98,223,55,232,51,235,55,226,60,165,102,116,143"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="251,70,370,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="138,138,224,104,243,98,245,103,226,110,140,143"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="249,120,372,145"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="176,148,233,140,234,145,177,153"/>
-<area shape="rect" id="Node000005" href="$d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56" title=" " alt="" coords="225,169,396,210"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="177,170,209,174,209,179,176,175"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="254,234,366,260"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="136,180,226,219,247,227,245,232,224,224,134,185"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/inner_product.html#" title=" " alt="" coords="248,284,373,309"/>
-<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="113,180,162,226,193,249,226,270,237,275,235,280,223,275,190,254,158,230,110,184"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="466,153,537,178"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="396,176,450,169,451,175,397,182"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="444,202,559,228"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="397,198,429,203,428,208,396,204"/>
-</map>
diff --git a/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.md5 b/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.md5
deleted file mode 100644
index e4f56fa77..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-dc776e0fa383e85de2be079430ef8adf
\ No newline at end of file
diff --git a/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.svg b/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.svg
deleted file mode 100644
index 27d38aef1..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.svg
+++ /dev/null
@@ -1,194 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::adaline::predict Pages: 1 -->
-<svg width="424pt" height="236pt"
- viewBox="0.00 0.00 423.50 235.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 231.88)">
-<title>machine_learning::adaline::predict</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="128.5,-125.88 0,-125.88 0,-95.38 128.5,-95.38 128.5,-125.88"/>
-<text text-anchor="start" x="8" y="-112.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="64.25" y="-101.12" font-family="Helvetica,sans-Serif" font-size="10.00">::predict</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="293,-227.88 164.5,-227.88 164.5,-197.38 293,-197.38 293,-227.88"/>
-<text text-anchor="start" x="172.5" y="-214.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="228.75" y="-203.12" font-family="Helvetica,sans-Serif" font-size="10.00">::activation</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.68,-126.13C100.5,-143.24 132.83,-170.73 164.5,-188.62 166.66,-189.85 168.89,-191.03 171.18,-192.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.48,-195.24 180.03,-196.28 172.43,-188.89 169.48,-195.24"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273.5,-179.25 184,-179.25 184,-160 273.5,-160 273.5,-179.25"/>
-<text text-anchor="middle" x="228.75" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.24,-126.23C119.08,-134.34 142.84,-144.1 164.5,-151.62 169.18,-153.25 174.08,-154.84 179.01,-156.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.7,-159.63 188.28,-159.14 179.71,-152.92 177.7,-159.63"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.62,-142.25 182.88,-142.25 182.88,-123 274.62,-123 274.62,-142.25"/>
-<text text-anchor="middle" x="228.75" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.54,-119.19C142.61,-121.1 157.42,-123.1 171.2,-124.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.6,-128.42 180.98,-126.29 171.54,-121.48 170.6,-128.42"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="293,-104.88 164.5,-104.88 164.5,-74.38 293,-74.38 293,-104.88"/>
-<text text-anchor="start" x="172.5" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="228.75" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::check_size_match</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.54,-102.45C136.48,-101.42 144.65,-100.36 152.74,-99.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.13,-102.8 162.59,-98.05 152.23,-95.86 153.13,-102.8"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.88,-56.25 186.62,-56.25 186.62,-37 270.88,-37 270.88,-56.25"/>
-<text text-anchor="middle" x="228.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.98,-94.93C116.24,-85.73 141.47,-74.26 164.5,-65.62 169.6,-63.71 174.98,-61.86 180.37,-60.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.41,-63.44 189.9,-57.11 179.31,-56.76 181.41,-63.44"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275.75,-19.25 181.75,-19.25 181.75,0 275.75,0 275.75,-19.25"/>
-<text text-anchor="middle" x="228.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::inner_product</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.58,-95.19C97.67,-76.59 130.55,-45.6 164.5,-27.62 167.15,-26.22 169.93,-24.92 172.77,-23.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.75,-27.07 181.86,-20.25 171.27,-20.53 173.75,-27.07"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="399,-117.25 345.5,-117.25 345.5,-98 399,-98 399,-117.25"/>
-<text text-anchor="middle" x="372.25" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.46,-97.73C307.25,-99.48 321.4,-101.28 333.78,-102.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.18,-106.31 343.54,-104.1 334.06,-99.37 333.18,-106.31"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415.5,-80.25 329,-80.25 329,-61 415.5,-61 415.5,-80.25"/>
-<text text-anchor="middle" x="372.25" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.46,-81.07C301.45,-80 309.55,-78.91 317.37,-77.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.61,-81.36 327.06,-76.56 316.68,-74.42 317.61,-81.36"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph_org.svg b/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph_org.svg
deleted file mode 100644
index f06d745d9..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph_org.svg
+++ /dev/null
@@ -1,168 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::adaline::predict Pages: 1 -->
-<svg width="424pt" height="236pt"
- viewBox="0.00 0.00 423.50 235.88" 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 231.88)">
-<title>machine_learning::adaline::predict</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="128.5,-125.88 0,-125.88 0,-95.38 128.5,-95.38 128.5,-125.88"/>
-<text text-anchor="start" x="8" y="-112.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="64.25" y="-101.12" font-family="Helvetica,sans-Serif" font-size="10.00">::predict</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="293,-227.88 164.5,-227.88 164.5,-197.38 293,-197.38 293,-227.88"/>
-<text text-anchor="start" x="172.5" y="-214.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="228.75" y="-203.12" font-family="Helvetica,sans-Serif" font-size="10.00">::activation</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.68,-126.13C100.5,-143.24 132.83,-170.73 164.5,-188.62 166.66,-189.85 168.89,-191.03 171.18,-192.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.48,-195.24 180.03,-196.28 172.43,-188.89 169.48,-195.24"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273.5,-179.25 184,-179.25 184,-160 273.5,-160 273.5,-179.25"/>
-<text text-anchor="middle" x="228.75" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.24,-126.23C119.08,-134.34 142.84,-144.1 164.5,-151.62 169.18,-153.25 174.08,-154.84 179.01,-156.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.7,-159.63 188.28,-159.14 179.71,-152.92 177.7,-159.63"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.62,-142.25 182.88,-142.25 182.88,-123 274.62,-123 274.62,-142.25"/>
-<text text-anchor="middle" x="228.75" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.54,-119.19C142.61,-121.1 157.42,-123.1 171.2,-124.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.6,-128.42 180.98,-126.29 171.54,-121.48 170.6,-128.42"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="293,-104.88 164.5,-104.88 164.5,-74.38 293,-74.38 293,-104.88"/>
-<text text-anchor="start" x="172.5" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="228.75" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::check_size_match</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.54,-102.45C136.48,-101.42 144.65,-100.36 152.74,-99.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.13,-102.8 162.59,-98.05 152.23,-95.86 153.13,-102.8"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.88,-56.25 186.62,-56.25 186.62,-37 270.88,-37 270.88,-56.25"/>
-<text text-anchor="middle" x="228.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.98,-94.93C116.24,-85.73 141.47,-74.26 164.5,-65.62 169.6,-63.71 174.98,-61.86 180.37,-60.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.41,-63.44 189.9,-57.11 179.31,-56.76 181.41,-63.44"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275.75,-19.25 181.75,-19.25 181.75,0 275.75,0 275.75,-19.25"/>
-<text text-anchor="middle" x="228.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::inner_product</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.58,-95.19C97.67,-76.59 130.55,-45.6 164.5,-27.62 167.15,-26.22 169.93,-24.92 172.77,-23.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.75,-27.07 181.86,-20.25 171.27,-20.53 173.75,-27.07"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="399,-117.25 345.5,-117.25 345.5,-98 399,-98 399,-117.25"/>
-<text text-anchor="middle" x="372.25" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.46,-97.73C307.25,-99.48 321.4,-101.28 333.78,-102.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.18,-106.31 343.54,-104.1 334.06,-99.37 333.18,-106.31"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415.5,-80.25 329,-80.25 329,-61 415.5,-61 415.5,-80.25"/>
-<text text-anchor="middle" x="372.25" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.46,-81.07C301.45,-80 309.55,-78.91 317.37,-77.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.61,-81.36 327.06,-76.56 316.68,-74.42 317.61,-81.36"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.map b/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.map
deleted file mode 100644
index 677c8982d..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="machine_learning::adaline::check_size_match" name="machine_learning::adaline::check_size_match">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,23,177,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="247,5,318,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="177,29,231,22,231,28,178,35"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="225,55,340,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="178,52,209,56,209,61,177,57"/>
-</map>
diff --git a/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.md5 b/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.md5
deleted file mode 100644
index 96fa0c088..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-687c722905fad03ee469c90c45e530d7
\ No newline at end of file
diff --git a/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.svg b/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.svg
deleted file mode 100644
index b30aa6d19..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::adaline::check_size_match Pages: 1 -->
-<svg width="259pt" height="64pt"
- viewBox="0.00 0.00 259.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>machine_learning::adaline::check_size_match</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="128.5,-42.88 0,-42.88 0,-12.37 128.5,-12.37 128.5,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="64.25" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::check_size_match</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.5,-56.25 181,-56.25 181,-37 234.5,-37 234.5,-56.25"/>
-<text text-anchor="middle" x="207.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.96,-36.18C142.75,-38.03 156.9,-39.93 169.28,-41.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.67,-45.04 179.04,-42.9 169.6,-38.1 168.67,-45.04"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251,-19.25 164.5,-19.25 164.5,0 251,0 251,-19.25"/>
-<text text-anchor="middle" x="207.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.96,-19.52C136.95,-18.5 145.05,-17.47 152.87,-16.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.08,-19.98 162.56,-15.25 152.19,-13.04 153.08,-19.98"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph_org.svg b/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph_org.svg
deleted file mode 100644
index 74a3d3e1c..000000000
--- a/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::adaline::check_size_match Pages: 1 -->
-<svg width="259pt" height="64pt"
- viewBox="0.00 0.00 259.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>machine_learning::adaline::check_size_match</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="128.5,-42.88 0,-42.88 0,-12.37 128.5,-12.37 128.5,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::adaline</text>
-<text text-anchor="middle" x="64.25" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::check_size_match</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.5,-56.25 181,-56.25 181,-37 234.5,-37 234.5,-56.25"/>
-<text text-anchor="middle" x="207.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.96,-36.18C142.75,-38.03 156.9,-39.93 169.28,-41.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.67,-45.04 179.04,-42.9 169.6,-38.1 168.67,-45.04"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251,-19.25 164.5,-19.25 164.5,0 251,0 251,-19.25"/>
-<text text-anchor="middle" x="207.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.96,-19.52C136.95,-18.5 145.05,-17.47 152.87,-16.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.08,-19.98 162.56,-15.25 152.19,-13.04 153.08,-19.98"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d38/find__non__repeating__number_8cpp.html b/d6/d38/find__non__repeating__number_8cpp.html
index 8da8c378b..96ccaf78a 100644
--- a/d6/d38/find__non__repeating__number_8cpp.html
+++ b/d6/d38/find__non__repeating__number_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: bit_manipulation/find_non_repeating_number.cpp File Reference</title>
+<title>TheAlgorithms/C++: bit_manipulation/find_non_repeating_number.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for find_non_repeating_number.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dc0/find__non__repeating__number_8cpp__incl.svg" width="252" height="126"><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">
+</div>
+<p><a href="../../d6/d38/find__non__repeating__number_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></td></tr>
@@ -133,7 +152,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:ac5ca4c0be0967b4dd572507f50451ae3" id="r_ac5ca4c0be0967b4dd572507f50451ae3"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac5ca4c0be0967b4dd572507f50451ae3">bit_manipulation::find_non_repeating_integer::find_non_repeating_integer</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;nums)</td></tr>
+<tr class="memitem:ac5ca4c0be0967b4dd572507f50451ae3" id="r_ac5ca4c0be0967b4dd572507f50451ae3"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac5ca4c0be0967b4dd572507f50451ae3">bit_manipulation::find_non_repeating_integer::find_non_repeating_integer</a> (const std::vector&lt; int &gt; &amp;nums)</td></tr>
 <tr class="memdesc:ac5ca4c0be0967b4dd572507f50451ae3"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function implements find single number.  <br /></td></tr>
 <tr class="separator:ac5ca4c0be0967b4dd572507f50451ae3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
 <p>Given an array of integers in which all of the numbers occur exactly twice except one integer which occurs only once. Find the non-repeating integer.</p>
 <p>Worst Case Time Complexity: O(n) Space complexity: O(1)</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/literalEval" target="_blank">Ravidev Pandey</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/d38/find__non__repeating__number_8cpp_source.html">find_non_repeating_number.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ac5ca4c0be0967b4dd572507f50451ae3" name="ac5ca4c0be0967b4dd572507f50451ae3"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ac5ca4c0be0967b4dd572507f50451ae3">&#9670;&#160;</a></span>find_non_repeating_integer()</h2>
@@ -158,7 +179,7 @@ Functions</h2></td></tr>
         <tr>
           <td class="memname">int64_t bit_manipulation::find_non_repeating_integer::find_non_repeating_integer </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>nums</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>nums</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -172,6 +193,8 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>returns the integer that occurs only once </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d38/find__non__repeating__number_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../d6/d38/find__non__repeating__number_8cpp_source.html">find_non_repeating_number.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   39</span>                                                               {</div>
 <div class="line"><span class="lineno">   40</span>    <span class="comment">// The idea is based on the property of XOR.</span></div>
 <div class="line"><span class="lineno">   41</span>    <span class="comment">// We know that &#39;a&#39; XOR &#39;a&#39; is &#39;0&#39; and &#39;0&#39; XOR &#39;b&#39;</span></div>
@@ -208,17 +231,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d38/find__non__repeating__number_8cpp_source.html#l00085">85</a> of file <a class="el" href="../../d6/d38/find__non__repeating__number_8cpp_source.html">find_non_repeating_number.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   85</span>           {</div>
 <div class="line"><span class="lineno">   86</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   87</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   88</span>}</div>
-<div class="ttc" id="afind__non__repeating__number_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> find_non_repeating_number.cpp:62</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afind__non__repeating__number_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d38/find__non__repeating__number_8cpp_source.html#l00062">find_non_repeating_number.cpp:62</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -246,12 +266,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d38/find__non__repeating__number_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../d6/d38/find__non__repeating__number_8cpp_source.html">find_non_repeating_number.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>                   {</div>
 <div class="line"><span class="lineno">   63</span>    <span class="comment">// n = 10,2 return 14</span></div>
 <div class="line"><span class="lineno">   64</span> </div>
-<div class="line"><span class="lineno">   65</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> nums_one{1, 1, 2, 2, 4, 5, 5};</div>
-<div class="line"><span class="lineno">   66</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> nums_two{203, 3434, 4545, 3434, 4545};</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&lt;int&gt;</a> nums_three{90, 1, 3, 90, 3};</div>
+<div class="line"><span class="lineno">   65</span>    std::vector&lt;int&gt; nums_one{1, 1, 2, 2, 4, 5, 5};</div>
+<div class="line"><span class="lineno">   66</span>    std::vector&lt;int&gt; nums_two{203, 3434, 4545, 3434, 4545};</div>
+<div class="line"><span class="lineno">   67</span>    std::vector&lt;int&gt; nums_three{90, 1, 3, 90, 3};</div>
 <div class="line"><span class="lineno">   68</span> </div>
 <div class="line"><span class="lineno">   69</span>    assert(bit_manipulation::find_non_repeating_integer::</div>
 <div class="line"><span class="lineno">   70</span>               <a class="code hl_namespace" href="../../d2/da7/namespacefind__non__repeating__integer.html">find_non_repeating_integer</a>(nums_one) ==</div>
@@ -263,18 +285,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   76</span>               <a class="code hl_namespace" href="../../d2/da7/namespacefind__non__repeating__integer.html">find_non_repeating_integer</a>(nums_three) ==</div>
 <div class="line"><span class="lineno">   77</span>           1);  <span class="comment">// 1 is non repeating</span></div>
 <div class="line"><span class="lineno">   78</span> </div>
-<div class="line"><span class="lineno">   79</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All test cases successfully passed!&quot;</span> &lt;&lt; <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">   79</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   80</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="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="anamespacefind__non__repeating__integer_html"><div class="ttname"><a href="../../d2/da7/namespacefind__non__repeating__integer.html">find_non_repeating_integer</a></div><div class="ttdoc">Functions to find the non repeating integer in an array of repeating integers. Single Number</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index e85e01374..000000000
--- a/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 5901bc148..000000000
--- a/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-729fb887ee50b6291b0542ba0592a5c7
\ No newline at end of file
diff --git a/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 2e04695b9..000000000
--- a/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1813bd719..000000000
--- a/d6/d38/find__non__repeating__number_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 6f2ff56f0..000000000
--- a/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index c29e1871f..000000000
--- a/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0d64525989fc6e5894a4c117b1c204e1
\ No newline at end of file
diff --git a/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 464e03753..000000000
--- a/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index c504e2bb0..000000000
--- a/d6/d38/find__non__repeating__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d38/find__non__repeating__number_8cpp_source.html b/d6/d38/find__non__repeating__number_8cpp_source.html
new file mode 100644
index 000000000..1fdb586ba
--- /dev/null
+++ b/d6/d38/find__non__repeating__number_8cpp_source.html
@@ -0,0 +1,196 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: bit_manipulation/find_non_repeating_number.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/d38/find__non__repeating__number_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">find_non_repeating_number.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/d38/find__non__repeating__number_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a> {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/da7/namespacefind__non__repeating__integer.html">find_non_repeating_integer</a> {</div>
+<div class="foldopen" id="foldopen00039" data-start="{" data-end="}">
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../d6/d38/find__non__repeating__number_8cpp.html#ac5ca4c0be0967b4dd572507f50451ae3">   39</a></span>int64_t <a class="code hl_namespace" href="../../d2/da7/namespacefind__non__repeating__integer.html">find_non_repeating_integer</a>(<span class="keyword">const</span> std::vector&lt;int&gt;&amp; nums) {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="comment">// The idea is based on the property of XOR.</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="comment">// We know that &#39;a&#39; XOR &#39;a&#39; is &#39;0&#39; and &#39;0&#39; XOR &#39;b&#39;</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="comment">// is b.</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="comment">// Using this, if we XOR all the elements of the array,</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="comment">// the repeating elements will give &#39;0&#39; and this &#39;0&#39;</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="comment">// with the single number will give the number itself.</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordtype">int</span> _xor = 0;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span>&amp; num: nums) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        _xor ^= num;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">return</span> _xor;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>}</div>
+</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>}  <span class="comment">// namespace find_non_repeating_integer</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>}  <span class="comment">// namespace bit_manipulation</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   62</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="comment">// n = 10,2 return 14</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    std::vector&lt;int&gt; nums_one{1, 1, 2, 2, 4, 5, 5};</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    std::vector&lt;int&gt; nums_two{203, 3434, 4545, 3434, 4545};</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    std::vector&lt;int&gt; nums_three{90, 1, 3, 90, 3};</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    assert(bit_manipulation::find_non_repeating_integer::</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>               <a class="code hl_namespace" href="../../d2/da7/namespacefind__non__repeating__integer.html">find_non_repeating_integer</a>(nums_one) ==</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>           4);  <span class="comment">// 4 is non repeating</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    assert(bit_manipulation::find_non_repeating_integer::</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>               <a class="code hl_namespace" href="../../d2/da7/namespacefind__non__repeating__integer.html">find_non_repeating_integer</a>(nums_two) ==</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>           203);  <span class="comment">// 203 is non repeating</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    assert(bit_manipulation::find_non_repeating_integer::</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>               <a class="code hl_namespace" href="../../d2/da7/namespacefind__non__repeating__integer.html">find_non_repeating_integer</a>(nums_three) ==</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>           1);  <span class="comment">// 1 is non repeating</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00085" data-start="{" data-end="}">
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"><a class="line" href="../../d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   85</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <a class="code hl_function" href="../../d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>}</div>
+</div>
+<div class="ttc" id="afind__non__repeating__number_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d6/d38/find__non__repeating__number_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> <a href="#l00062">find_non_repeating_number.cpp:62</a></div></div>
+<div class="ttc" id="afind__non__repeating__number_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00085">find_non_repeating_number.cpp:85</a></div></div>
+<div class="ttc" id="anamespacebit__manipulation_html"><div class="ttname"><a href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacefind__non__repeating__integer_html"><div class="ttname"><a href="../../d2/da7/namespacefind__non__repeating__integer.html">find_non_repeating_integer</a></div><div class="ttdoc">Functions to find the non repeating integer in an array of repeating integers. Single Number</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_f3c4fbc4e901afa0a54d0623c5574aa7.html">bit_manipulation</a></li><li class="navelem"><a class="el" href="../../d6/d38/find__non__repeating__number_8cpp.html">find_non_repeating_number.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/d42/miller__rabin_8cpp.html b/d6/d42/miller__rabin_8cpp.html
index 86409e1c6..70cf34e2b 100644
--- a/d6/d42/miller__rabin_8cpp.html
+++ b/d6/d42/miller__rabin_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/miller_rabin.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/miller_rabin.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,14 +135,16 @@ Include dependency graph for miller_rabin.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dcc/miller__rabin_8cpp__incl.svg" width="342" height="111"><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">
+</div>
+<p><a href="../../d6/d42/miller__rabin_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a091662a787d5ad4866713021f580fddb" id="r_a091662a787d5ad4866713021f580fddb"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a091662a787d5ad4866713021f580fddb"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a091662a787d5ad4866713021f580fddb">reverse_binary</a> (T num)</td></tr>
+<tr class="memitem:a091662a787d5ad4866713021f580fddb"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a091662a787d5ad4866713021f580fddb">reverse_binary</a> (T num)</td></tr>
 <tr class="separator:a091662a787d5ad4866713021f580fddb"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ad6c2c67ea416d0e80003a88623f98b29" id="r_ad6c2c67ea416d0e80003a88623f98b29"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ad6c2c67ea416d0e80003a88623f98b29"><td class="memTemplItemLeft" align="right" valign="top">T&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ad6c2c67ea416d0e80003a88623f98b29">modular_exponentiation</a> (T base, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;rev_binary_exponent, T mod)</td></tr>
+<tr class="memitem:ad6c2c67ea416d0e80003a88623f98b29"><td class="memTemplItemLeft" align="right" valign="top">T&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ad6c2c67ea416d0e80003a88623f98b29">modular_exponentiation</a> (T base, const std::vector&lt; T &gt; &amp;rev_binary_exponent, T mod)</td></tr>
 <tr class="separator:ad6c2c67ea416d0e80003a88623f98b29"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a6f9c31c1047aa3191676d64571d4c506" id="r_a6f9c31c1047aa3191676d64571d4c506"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
 <tr class="memitem:a6f9c31c1047aa3191676d64571d4c506"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a6f9c31c1047aa3191676d64571d4c506">miller_test</a> (T d, T num)</td></tr>
@@ -141,6 +160,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Copyright 2020 </p><dl class="section author"><dt>Author</dt><dd>tjgurwara99</dd></dl>
 <p>A basic implementation of Miller-Rabin primality test. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/d42/miller__rabin_8cpp_source.html">miller_rabin.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -157,17 +178,14 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d42/miller__rabin_8cpp_source.html#l00183">183</a> of file <a class="el" href="../../d6/d42/miller__rabin_8cpp_source.html">miller_rabin.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  183</span>           {</div>
 <div class="line"><span class="lineno">  184</span>    <a class="code hl_function" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
 <div class="line"><span class="lineno">  185</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  186</span>}</div>
-<div class="ttc" id="amiller__rabin_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> miller_rabin.cpp:157</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="465"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="amiller__rabin_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d42/miller__rabin_8cpp_source.html#l00157">miller_rabin.cpp:157</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a901288288ef5ebe8e97414cc30797cce" name="a901288288ef5ebe8e97414cc30797cce"></a>
@@ -201,6 +219,8 @@ template&lt;typename T &gt; </div>
 <dd>
 'true' if num is (probably) prime</dd></dl>
 <p>\detail First we check whether the num input is less than 4, if so we can determine whether this is a prime or composite by checking for 2 and 3. Next we check whether this num is odd (as all primes greater than 2 are odd). Next we write our num in the following format \(num = 2^r \cdot d + 1\). After finding r and d for our input num, we use for loop repeat number of times inside which we check the miller conditions using the function miller_test. If miller_test returns false then the number is composite After the loop finishes completely without issuing a false return call, we can conclude that this number is probably prime. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d42/miller__rabin_8cpp_source.html#l00125">125</a> of file <a class="el" href="../../d6/d42/miller__rabin_8cpp_source.html">miller_rabin.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  125</span>                                                   {</div>
 <div class="line"><span class="lineno">  126</span>    <span class="keywordflow">if</span> (num &lt;= 4) {</div>
 <div class="line"><span class="lineno">  127</span>        <span class="comment">// If num == 2 or num == 3 then prime</span></div>
@@ -228,13 +248,8 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  149</span>    }</div>
 <div class="line"><span class="lineno">  150</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  151</span>}</div>
-<div class="ttc" id="amiller__rabin_8cpp_html_a6f9c31c1047aa3191676d64571d4c506"><div class="ttname"><a href="#a6f9c31c1047aa3191676d64571d4c506">miller_test</a></div><div class="ttdeci">bool miller_test(T d, T num)</div><div class="ttdef"><b>Definition</b> miller_rabin.cpp:73</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph.svg" width="100%" height="465"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="amiller__rabin_8cpp_html_a6f9c31c1047aa3191676d64571d4c506"><div class="ttname"><a href="#a6f9c31c1047aa3191676d64571d4c506">miller_test</a></div><div class="ttdeci">bool miller_test(T d, T num)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d42/miller__rabin_8cpp_source.html#l00073">miller_rabin.cpp:73</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6f9c31c1047aa3191676d64571d4c506" name="a6f9c31c1047aa3191676d64571d4c506"></a>
@@ -267,17 +282,19 @@ template&lt;typename T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>'false' if n is composite </dd>
 <dd>
 'true' if n is (probably) prime. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d42/miller__rabin_8cpp_source.html#l00073">73</a> of file <a class="el" href="../../d6/d42/miller__rabin_8cpp_source.html">miller_rabin.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   73</span>                             {</div>
 <div class="line"><span class="lineno">   74</span>    <span class="comment">// random number seed</span></div>
-<div class="line"><span class="lineno">   75</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/random_device.html">std::random_device</a> rd_seed;</div>
+<div class="line"><span class="lineno">   75</span>    std::random_device rd_seed;</div>
 <div class="line"><span class="lineno">   76</span>    <span class="comment">// random number generator</span></div>
-<div class="line"><span class="lineno">   77</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html">std::mt19937</a> gen(rd_seed());</div>
+<div class="line"><span class="lineno">   77</span>    std::mt19937 gen(rd_seed());</div>
 <div class="line"><span class="lineno">   78</span>    <span class="comment">// Uniformly distributed range [2, num - 2] for random numbers</span></div>
-<div class="line"><span class="lineno">   79</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution.html">std::uniform_int_distribution&lt;&gt;</a> distribution(2, num - 2);</div>
+<div class="line"><span class="lineno">   79</span>    std::uniform_int_distribution&lt;&gt; distribution(2, num - 2);</div>
 <div class="line"><span class="lineno">   80</span>    <span class="comment">// Random number generated in the range [2, num -2].</span></div>
 <div class="line"><span class="lineno">   81</span>    T random = distribution(gen);</div>
 <div class="line"><span class="lineno">   82</span>    <span class="comment">// vector for reverse binary of the power</span></div>
-<div class="line"><span class="lineno">   83</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a> = <a class="code hl_function" href="#a091662a787d5ad4866713021f580fddb">reverse_binary</a>(d);</div>
+<div class="line"><span class="lineno">   83</span>    std::vector&lt;T&gt; <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a> = <a class="code hl_function" href="#a091662a787d5ad4866713021f580fddb">reverse_binary</a>(d);</div>
 <div class="line"><span class="lineno">   84</span>    <span class="comment">// x = random ^ d % num</span></div>
 <div class="line"><span class="lineno">   85</span>    T x = <a class="code hl_function" href="#ad6c2c67ea416d0e80003a88623f98b29">modular_exponentiation</a>(random, <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a>, num);</div>
 <div class="line"><span class="lineno">   86</span>    <span class="comment">// miller conditions</span></div>
@@ -297,19 +314,10 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  100</span>    }</div>
 <div class="line"><span class="lineno">  101</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  102</span>}</div>
-<div class="ttc" id="amersenne_twister_engine_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html">std::mt19937</a></div></div>
-<div class="ttc" id="amiller__rabin_8cpp_html_a091662a787d5ad4866713021f580fddb"><div class="ttname"><a href="#a091662a787d5ad4866713021f580fddb">reverse_binary</a></div><div class="ttdeci">std::vector&lt; T &gt; reverse_binary(T num)</div><div class="ttdef"><b>Definition</b> miller_rabin.cpp:19</div></div>
-<div class="ttc" id="amiller__rabin_8cpp_html_ad6c2c67ea416d0e80003a88623f98b29"><div class="ttname"><a href="#ad6c2c67ea416d0e80003a88623f98b29">modular_exponentiation</a></div><div class="ttdeci">T modular_exponentiation(T base, const std::vector&lt; T &gt; &amp;rev_binary_exponent, T mod)</div><div class="ttdef"><b>Definition</b> miller_rabin.cpp:43</div></div>
-<div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae249a2af508aa94266023ce8aa81426f"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a></div><div class="ttdeci">void power(int x, int n)</div><div class="ttdef"><b>Definition</b> power_for_huge_numbers.cpp:56</div></div>
-<div class="ttc" id="arandom_device_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/random_device.html">std::random_device</a></div></div>
-<div class="ttc" id="auniform_int_distribution_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution.html">std::uniform_int_distribution</a></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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d42/miller__rabin_8cpp_a6f9c31c1047aa3191676d64571d4c506_cgraph.svg" width="476" height="220"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amiller__rabin_8cpp_html_a091662a787d5ad4866713021f580fddb"><div class="ttname"><a href="#a091662a787d5ad4866713021f580fddb">reverse_binary</a></div><div class="ttdeci">std::vector&lt; T &gt; reverse_binary(T num)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d42/miller__rabin_8cpp_source.html#l00019">miller_rabin.cpp:19</a></div></div>
+<div class="ttc" id="amiller__rabin_8cpp_html_ad6c2c67ea416d0e80003a88623f98b29"><div class="ttname"><a href="#ad6c2c67ea416d0e80003a88623f98b29">modular_exponentiation</a></div><div class="ttdeci">T modular_exponentiation(T base, const std::vector&lt; T &gt; &amp;rev_binary_exponent, T mod)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d42/miller__rabin_8cpp_source.html#l00043">miller_rabin.cpp:43</a></div></div>
+<div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae249a2af508aa94266023ce8aa81426f"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a></div><div class="ttdeci">void power(int x, int n)</div><div class="ttdef"><b>Definition</b> <a href="../../df/def/power__for__huge__numbers_8cpp_source.html#l00056">power_for_huge_numbers.cpp:56</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad6c2c67ea416d0e80003a88623f98b29" name="ad6c2c67ea416d0e80003a88623f98b29"></a>
@@ -328,7 +336,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>rev_binary_exponent</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>rev_binary_exponent</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -347,34 +355,28 @@ template&lt;typename T &gt; </div>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>r the modular exponentiation of \(a^{n} \equiv r \mod{m}\) where \(n\) is the base 10 representation of rev_binary_exponent and  \(m = mod
 \) parameter. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d42/miller__rabin_8cpp_source.html#l00043">43</a> of file <a class="el" href="../../d6/d42/miller__rabin_8cpp_source.html">miller_rabin.cpp</a>.</p>
 <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> (mod == 1)</div>
 <div class="line"><span class="lineno">   46</span>        <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   47</span>    T b = 1;</div>
-<div class="line"><span class="lineno">   48</span>    <span class="keywordflow">if</span> (rev_binary_exponent.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() == 0)</div>
+<div class="line"><span class="lineno">   48</span>    <span class="keywordflow">if</span> (rev_binary_exponent.size() == 0)</div>
 <div class="line"><span class="lineno">   49</span>        <span class="keywordflow">return</span> b;</div>
 <div class="line"><span class="lineno">   50</span>    T A = base;</div>
 <div class="line"><span class="lineno">   51</span>    <span class="keywordflow">if</span> (rev_binary_exponent[0] == 1)</div>
 <div class="line"><span class="lineno">   52</span>        b = base;</div>
 <div class="line"><span class="lineno">   53</span> </div>
 <div class="line"><span class="lineno">   54</span>    <span class="keywordflow">for</span> (<span class="keyword">typename</span> std::vector&lt;T&gt;::const_iterator it =</div>
-<div class="line"><span class="lineno">   55</span>             rev_binary_exponent.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">cbegin</a>() + 1;</div>
-<div class="line"><span class="lineno">   56</span>         it != rev_binary_exponent.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">cend</a>(); ++it) {</div>
+<div class="line"><span class="lineno">   55</span>             rev_binary_exponent.cbegin() + 1;</div>
+<div class="line"><span class="lineno">   56</span>         it != rev_binary_exponent.cend(); ++it) {</div>
 <div class="line"><span class="lineno">   57</span>        A = A * A % mod;</div>
 <div class="line"><span class="lineno">   58</span>        <span class="keywordflow">if</span> (*it == 1)</div>
 <div class="line"><span class="lineno">   59</span>            b = A * b % mod;</div>
 <div class="line"><span class="lineno">   60</span>    }</div>
 <div class="line"><span class="lineno">   61</span>    <span class="keywordflow">return</span> b;</div>
 <div class="line"><span class="lineno">   62</span>}</div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::cbegin</a></div><div class="ttdeci">T cbegin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::cend</a></div><div class="ttdeci">T cend(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><!-- 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="../../d6/d42/miller__rabin_8cpp_ad6c2c67ea416d0e80003a88623f98b29_cgraph.svg" width="347" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a091662a787d5ad4866713021f580fddb" name="a091662a787d5ad4866713021f580fddb"></a>
@@ -386,7 +388,7 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; reverse_binary </td>
+          <td class="memname">std::vector&lt; T &gt; reverse_binary </td>
           <td>(</td>
           <td class="paramtype">T</td>          <td class="paramname"><span class="paramname"><em>num</em></span></td><td>)</td>
           <td></td>
@@ -400,8 +402,10 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>result vector of the number input in reverse binary </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d42/miller__rabin_8cpp_source.html#l00019">19</a> of file <a class="el" href="../../d6/d42/miller__rabin_8cpp_source.html">miller_rabin.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   19</span>                                   {</div>
-<div class="line"><span class="lineno">   20</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
+<div class="line"><span class="lineno">   20</span>    std::vector&lt;T&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   21</span>    T temp = num;</div>
 <div class="line"><span class="lineno">   22</span>    <span class="keywordflow">while</span> (temp &gt; 0) {</div>
 <div class="line"><span class="lineno">   23</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(temp % 2);</div>
@@ -409,7 +413,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   25</span>    }</div>
 <div class="line"><span class="lineno">   26</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   27</span>}</div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -428,37 +432,32 @@ template&lt;typename T &gt; </div>
       </table>
 </div><div class="memdoc">
 <p>Functions for testing the <a class="el" href="#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test()</a> function with some assert statements. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d42/miller__rabin_8cpp_source.html#l00157">157</a> of file <a class="el" href="../../d6/d42/miller__rabin_8cpp_source.html">miller_rabin.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  157</span>             {</div>
 <div class="line"><span class="lineno">  158</span>    <span class="comment">// First test on 2</span></div>
 <div class="line"><span class="lineno">  159</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;2 is prime but function says otherwise.\n&quot;</span>,</div>
 <div class="line"><span class="lineno">  160</span>            <a class="code hl_function" href="#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a>(2, 1) == <span class="keyword">true</span>));</div>
-<div class="line"><span class="lineno">  161</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;First test passes.&quot;</span> &lt;&lt; <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">  161</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;First test passes.&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  162</span>    <span class="comment">// Second test on 5</span></div>
 <div class="line"><span class="lineno">  163</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;5 should be prime but the function says otherwise.\n&quot;</span>,</div>
 <div class="line"><span class="lineno">  164</span>            <a class="code hl_function" href="#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a>(5, 3) == <span class="keyword">true</span>));</div>
-<div class="line"><span class="lineno">  165</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Second test passes.&quot;</span> &lt;&lt; <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">  165</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Second test passes.&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  166</span>    <span class="comment">// Third test on 23</span></div>
 <div class="line"><span class="lineno">  167</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;23 should be prime but the function says otherwise.\n&quot;</span>,</div>
 <div class="line"><span class="lineno">  168</span>            <a class="code hl_function" href="#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a>(23, 3) == <span class="keyword">true</span>));</div>
-<div class="line"><span class="lineno">  169</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Third test passes.&quot;</span> &lt;&lt; <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">  169</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Third test passes.&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  170</span>    <span class="comment">// Fourth test on 16</span></div>
 <div class="line"><span class="lineno">  171</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;16 is not a prime but the function says otherwise.\n&quot;</span>,</div>
 <div class="line"><span class="lineno">  172</span>            <a class="code hl_function" href="#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a>(16, 3) == <span class="keyword">false</span>));</div>
-<div class="line"><span class="lineno">  173</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Fourth test passes.&quot;</span> &lt;&lt; <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">  173</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Fourth test passes.&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  174</span>    <span class="comment">// Fifth test on 27</span></div>
 <div class="line"><span class="lineno">  175</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;27 is not a prime but the function says otherwise.\n&quot;</span>,</div>
 <div class="line"><span class="lineno">  176</span>            <a class="code hl_function" href="#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a>(27, 3) == <span class="keyword">false</span>));</div>
-<div class="line"><span class="lineno">  177</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Fifth test passes.&quot;</span> &lt;&lt; <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">  177</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Fifth test passes.&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  178</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="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="amiller__rabin_8cpp_html_a901288288ef5ebe8e97414cc30797cce"><div class="ttname"><a href="#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a></div><div class="ttdeci">bool miller_rabin_primality_test(T num, T repeats)</div><div class="ttdef"><b>Definition</b> miller_rabin.cpp:125</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg" width="100%" height="465"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="amiller__rabin_8cpp_html_a901288288ef5ebe8e97414cc30797cce"><div class="ttname"><a href="#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a></div><div class="ttdeci">bool miller_rabin_primality_test(T num, T repeats)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d42/miller__rabin_8cpp_source.html#l00125">miller_rabin.cpp:125</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d6/d42/miller__rabin_8cpp_a6f9c31c1047aa3191676d64571d4c506_cgraph.map b/d6/d42/miller__rabin_8cpp_a6f9c31c1047aa3191676d64571d4c506_cgraph.map
deleted file mode 100644
index 71594e238..000000000
--- a/d6/d42/miller__rabin_8cpp_a6f9c31c1047aa3191676d64571d4c506_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="miller_test" name="miller_test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,140,87,166"/>
-<area shape="rect" id="Node000002" href="$d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29" title=" " alt="" coords="135,79,293,104"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="83,137,161,108,163,113,85,142"/>
-<area shape="rect" id="Node000006" href="$df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" title=" " alt="" coords="186,140,242,166"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="87,150,170,150,170,156,87,156"/>
-<area shape="rect" id="Node000008" href="$d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb" title=" " alt="" coords="161,189,267,215"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="88,162,154,182,152,187,87,167"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="341,5,470,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="248,76,340,40,354,34,356,39,342,45,250,81"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="346,55,465,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="293,79,330,74,331,80,294,84"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="348,104,463,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="294,99,333,105,333,110,293,105"/>
-<area shape="rect" id="Node000007" href="$df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" title=" " alt="" coords="372,153,439,179"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="242,152,357,160,357,165,242,157"/>
-</map>
diff --git a/d6/d42/miller__rabin_8cpp_a6f9c31c1047aa3191676d64571d4c506_cgraph.md5 b/d6/d42/miller__rabin_8cpp_a6f9c31c1047aa3191676d64571d4c506_cgraph.md5
deleted file mode 100644
index 270c9e590..000000000
--- a/d6/d42/miller__rabin_8cpp_a6f9c31c1047aa3191676d64571d4c506_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-267ddd45fdd681498a1c50db1763b60d
\ No newline at end of file
diff --git a/d6/d42/miller__rabin_8cpp_a6f9c31c1047aa3191676d64571d4c506_cgraph.svg b/d6/d42/miller__rabin_8cpp_a6f9c31c1047aa3191676d64571d4c506_cgraph.svg
deleted file mode 100644
index b0ff784e2..000000000
--- a/d6/d42/miller__rabin_8cpp_a6f9c31c1047aa3191676d64571d4c506_cgraph.svg
+++ /dev/null
@@ -1,173 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: miller_test Pages: 1 -->
-<svg width="357pt" height="165pt"
- viewBox="0.00 0.00 356.75 165.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 161.25)">
-<title>miller_test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="61,-56.25 0,-56.25 0,-37 61,-37 61,-56.25"/>
-<text text-anchor="middle" x="30.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">miller_test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.75,-102.25 97,-102.25 97,-83 215.75,-83 215.75,-102.25"/>
-<text text-anchor="middle" x="156.38" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">modular_exponentiation</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M58.68,-56.72C75.95,-63.13 98.54,-71.52 117.55,-78.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="116.24,-81.83 126.83,-82.03 118.68,-75.26 116.24,-81.83"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.5,-56.25 135.25,-56.25 135.25,-37 177.5,-37 177.5,-56.25"/>
-<text text-anchor="middle" x="156.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.49,-46.62C80.25,-46.62 104.41,-46.62 123.52,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.45,-50.13 133.45,-46.63 123.45,-43.13 123.45,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.25,-19.25 116.5,-19.25 116.5,0 196.25,0 196.25,-19.25"/>
-<text text-anchor="middle" x="156.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_binary</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.49,-37.67C76.26,-33.25 94.38,-27.84 110.75,-22.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.7,-26.32 120.28,-20.11 109.7,-19.61 111.7,-26.32"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="348.75,-157.25 251.75,-157.25 251.75,-138 348.75,-138 348.75,-157.25"/>
-<text text-anchor="middle" x="300.25" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cbegin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.58,-102.6C201.57,-110.09 228.27,-120.57 251.75,-129.62 255.12,-130.93 258.64,-132.27 262.15,-133.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.59,-136.77 271.19,-137.05 263.08,-130.22 260.59,-136.77"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="345,-120.25 255.5,-120.25 255.5,-101 345,-101 345,-120.25"/>
-<text text-anchor="middle" x="300.25" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cend</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M215.9,-100.05C225.13,-101.22 234.65,-102.43 243.81,-103.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.31,-107.06 253.67,-104.84 244.19,-100.11 243.31,-107.06"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="343.5,-83.25 257,-83.25 257,-64 343.5,-64 343.5,-83.25"/>
-<text text-anchor="middle" x="300.25" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M215.9,-84.79C225.78,-83.46 235.98,-82.1 245.72,-80.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="245.95,-84.29 255.39,-79.5 245.02,-77.36 245.95,-84.29"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.12,-46.25 275.38,-46.25 275.38,-27 325.12,-27 325.12,-46.25"/>
-<text text-anchor="middle" x="300.25" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.7,-45.19C200.13,-43.61 236.63,-41.04 263.8,-39.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="263.92,-42.62 273.65,-38.43 263.43,-35.64 263.92,-42.62"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d42/miller__rabin_8cpp_a6f9c31c1047aa3191676d64571d4c506_cgraph_org.svg b/d6/d42/miller__rabin_8cpp_a6f9c31c1047aa3191676d64571d4c506_cgraph_org.svg
deleted file mode 100644
index 618999d77..000000000
--- a/d6/d42/miller__rabin_8cpp_a6f9c31c1047aa3191676d64571d4c506_cgraph_org.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: miller_test Pages: 1 -->
-<svg width="357pt" height="165pt"
- viewBox="0.00 0.00 356.75 165.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 161.25)">
-<title>miller_test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="61,-56.25 0,-56.25 0,-37 61,-37 61,-56.25"/>
-<text text-anchor="middle" x="30.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">miller_test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.75,-102.25 97,-102.25 97,-83 215.75,-83 215.75,-102.25"/>
-<text text-anchor="middle" x="156.38" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">modular_exponentiation</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M58.68,-56.72C75.95,-63.13 98.54,-71.52 117.55,-78.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="116.24,-81.83 126.83,-82.03 118.68,-75.26 116.24,-81.83"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.5,-56.25 135.25,-56.25 135.25,-37 177.5,-37 177.5,-56.25"/>
-<text text-anchor="middle" x="156.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.49,-46.62C80.25,-46.62 104.41,-46.62 123.52,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.45,-50.13 133.45,-46.63 123.45,-43.13 123.45,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.25,-19.25 116.5,-19.25 116.5,0 196.25,0 196.25,-19.25"/>
-<text text-anchor="middle" x="156.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_binary</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.49,-37.67C76.26,-33.25 94.38,-27.84 110.75,-22.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.7,-26.32 120.28,-20.11 109.7,-19.61 111.7,-26.32"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="348.75,-157.25 251.75,-157.25 251.75,-138 348.75,-138 348.75,-157.25"/>
-<text text-anchor="middle" x="300.25" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cbegin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.58,-102.6C201.57,-110.09 228.27,-120.57 251.75,-129.62 255.12,-130.93 258.64,-132.27 262.15,-133.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.59,-136.77 271.19,-137.05 263.08,-130.22 260.59,-136.77"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="345,-120.25 255.5,-120.25 255.5,-101 345,-101 345,-120.25"/>
-<text text-anchor="middle" x="300.25" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cend</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M215.9,-100.05C225.13,-101.22 234.65,-102.43 243.81,-103.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.31,-107.06 253.67,-104.84 244.19,-100.11 243.31,-107.06"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="343.5,-83.25 257,-83.25 257,-64 343.5,-64 343.5,-83.25"/>
-<text text-anchor="middle" x="300.25" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M215.9,-84.79C225.78,-83.46 235.98,-82.1 245.72,-80.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="245.95,-84.29 255.39,-79.5 245.02,-77.36 245.95,-84.29"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.12,-46.25 275.38,-46.25 275.38,-27 325.12,-27 325.12,-46.25"/>
-<text text-anchor="middle" x="300.25" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.7,-45.19C200.13,-43.61 236.63,-41.04 263.8,-39.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="263.92,-42.62 273.65,-38.43 263.43,-35.64 263.92,-42.62"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map b/d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
deleted file mode 100644
index c8ce32b5f..000000000
--- a/d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
+++ /dev/null
@@ -1,23 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,116,56,142"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="154,91,226,116"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,122,138,109,139,114,57,128"/>
-<area shape="rect" id="Node000003" href="$d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce" title=" " alt="" coords="104,140,276,166"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="57,130,88,135,88,140,56,135"/>
-<area shape="rect" id="Node000004" href="$d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506" title=" " alt="" coords="324,140,405,166"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="276,150,309,150,309,156,276,156"/>
-<area shape="rect" id="Node000005" href="$d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29" title=" " alt="" coords="453,79,612,104"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="401,137,480,108,482,113,403,142"/>
-<area shape="rect" id="Node000009" href="$df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" title=" " alt="" coords="504,140,561,166"/>
-<area shape="poly" id="edge8_Node000004_Node000009" title=" " alt="" coords="406,150,489,150,489,156,406,156"/>
-<area shape="rect" id="Node000011" href="$d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb" title=" " alt="" coords="479,189,586,215"/>
-<area shape="poly" id="edge10_Node000004_Node000011" title=" " alt="" coords="407,162,472,182,471,187,405,167"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="660,5,789,31"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="566,76,659,40,673,34,674,39,661,45,568,81"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="665,55,784,80"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="612,79,649,74,649,80,612,84"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="667,104,782,130"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="612,99,652,105,651,110,612,105"/>
-<area shape="rect" id="Node000010" href="$df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" title=" " alt="" coords="691,153,758,179"/>
-<area shape="poly" id="edge9_Node000009_Node000010" title=" " alt="" coords="561,152,676,160,676,165,561,157"/>
-</map>
diff --git a/d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 b/d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
deleted file mode 100644
index fd96d52d9..000000000
--- a/d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-51f802b0a4a49342f7be04b0df158f14
\ No newline at end of file
diff --git a/d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg b/d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
deleted file mode 100644
index ae7937c76..000000000
--- a/d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
+++ /dev/null
@@ -1,284 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<!--zoomable 165 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 596;
-var viewHeight = 165;
-var sectionId = 'dynsection-5';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-74.25 0,-74.25 0,-55 37.75,-55 37.75,-74.25"/>
-<text text-anchor="middle" x="18.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.12,-93.25 111.62,-93.25 111.62,-74 165.12,-74 165.12,-93.25"/>
-<text text-anchor="middle" x="138.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.23,-67.59C54.71,-70.26 79.41,-74.25 100.03,-77.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.37,-81.03 109.8,-79.17 100.49,-74.12 99.37,-81.03"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203,-56.25 73.75,-56.25 73.75,-37 203,-37 203,-56.25"/>
-<text text-anchor="middle" x="138.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">miller_rabin_primality_test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.23,-61.81C45.04,-60.77 53.25,-59.51 62,-58.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.45,-61.64 71.8,-56.67 61.39,-54.73 62.45,-61.64"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="300,-56.25 239,-56.25 239,-37 300,-37 300,-56.25"/>
-<text text-anchor="middle" x="269.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">miller_test</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.18,-46.62C211.45,-46.62 219.74,-46.62 227.5,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.29,-50.13 237.29,-46.63 227.29,-43.13 227.29,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="454.75,-102.25 336,-102.25 336,-83 454.75,-83 454.75,-102.25"/>
-<text text-anchor="middle" x="395.38" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">modular_exponentiation</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.68,-56.72C314.95,-63.13 337.54,-71.52 356.55,-78.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.24,-81.83 365.83,-82.03 357.68,-75.26 355.24,-81.83"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="416.5,-56.25 374.25,-56.25 374.25,-37 416.5,-37 416.5,-56.25"/>
-<text text-anchor="middle" x="395.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge8_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge8_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M300.49,-46.62C319.25,-46.62 343.41,-46.62 362.52,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="362.45,-50.13 372.45,-46.63 362.45,-43.13 362.45,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="435.25,-19.25 355.5,-19.25 355.5,0 435.25,0 435.25,-19.25"/>
-<text text-anchor="middle" x="395.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_binary</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node11 -->
-<g id="edge10_Node000004_Node000011" class="edge">
-<title>Node4&#45;&gt;Node11</title>
-<g id="a_edge10_Node000004_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M300.49,-37.67C315.26,-33.25 333.38,-27.84 349.75,-22.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.7,-26.32 359.28,-20.11 348.7,-19.61 350.7,-26.32"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="587.75,-157.25 490.75,-157.25 490.75,-138 587.75,-138 587.75,-157.25"/>
-<text text-anchor="middle" x="539.25" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cbegin</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M421.58,-102.6C440.57,-110.09 467.27,-120.57 490.75,-129.62 494.12,-130.93 497.64,-132.27 501.15,-133.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="499.59,-136.77 510.19,-137.05 502.08,-130.22 499.59,-136.77"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="584,-120.25 494.5,-120.25 494.5,-101 584,-101 584,-120.25"/>
-<text text-anchor="middle" x="539.25" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cend</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M454.9,-100.05C464.13,-101.22 473.65,-102.43 482.81,-103.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="482.31,-107.06 492.67,-104.84 483.19,-100.11 482.31,-107.06"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="582.5,-83.25 496,-83.25 496,-64 582.5,-64 582.5,-83.25"/>
-<text text-anchor="middle" x="539.25" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M454.9,-84.79C464.78,-83.46 474.98,-82.1 484.72,-80.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="484.95,-84.29 494.39,-79.5 484.02,-77.36 484.95,-84.29"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="564.12,-46.25 514.38,-46.25 514.38,-27 564.12,-27 564.12,-46.25"/>
-<text text-anchor="middle" x="539.25" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M416.7,-45.19C439.13,-43.61 475.63,-41.04 502.8,-39.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="502.92,-42.62 512.65,-38.43 502.43,-35.64 502.92,-42.62"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg b/d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
deleted file mode 100644
index 62518b78b..000000000
--- a/d6/d42/miller__rabin_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
+++ /dev/null
@@ -1,201 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="596pt" height="165pt"
- viewBox="0.00 0.00 595.75 165.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 161.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-74.25 0,-74.25 0,-55 37.75,-55 37.75,-74.25"/>
-<text text-anchor="middle" x="18.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.12,-93.25 111.62,-93.25 111.62,-74 165.12,-74 165.12,-93.25"/>
-<text text-anchor="middle" x="138.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.23,-67.59C54.71,-70.26 79.41,-74.25 100.03,-77.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.37,-81.03 109.8,-79.17 100.49,-74.12 99.37,-81.03"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203,-56.25 73.75,-56.25 73.75,-37 203,-37 203,-56.25"/>
-<text text-anchor="middle" x="138.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">miller_rabin_primality_test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.23,-61.81C45.04,-60.77 53.25,-59.51 62,-58.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.45,-61.64 71.8,-56.67 61.39,-54.73 62.45,-61.64"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="300,-56.25 239,-56.25 239,-37 300,-37 300,-56.25"/>
-<text text-anchor="middle" x="269.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">miller_test</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.18,-46.62C211.45,-46.62 219.74,-46.62 227.5,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.29,-50.13 237.29,-46.63 227.29,-43.13 227.29,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="454.75,-102.25 336,-102.25 336,-83 454.75,-83 454.75,-102.25"/>
-<text text-anchor="middle" x="395.38" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">modular_exponentiation</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.68,-56.72C314.95,-63.13 337.54,-71.52 356.55,-78.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.24,-81.83 365.83,-82.03 357.68,-75.26 355.24,-81.83"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="416.5,-56.25 374.25,-56.25 374.25,-37 416.5,-37 416.5,-56.25"/>
-<text text-anchor="middle" x="395.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge8_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge8_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M300.49,-46.62C319.25,-46.62 343.41,-46.62 362.52,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="362.45,-50.13 372.45,-46.63 362.45,-43.13 362.45,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="435.25,-19.25 355.5,-19.25 355.5,0 435.25,0 435.25,-19.25"/>
-<text text-anchor="middle" x="395.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_binary</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node11 -->
-<g id="edge10_Node000004_Node000011" class="edge">
-<title>Node4&#45;&gt;Node11</title>
-<g id="a_edge10_Node000004_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M300.49,-37.67C315.26,-33.25 333.38,-27.84 349.75,-22.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.7,-26.32 359.28,-20.11 348.7,-19.61 350.7,-26.32"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="587.75,-157.25 490.75,-157.25 490.75,-138 587.75,-138 587.75,-157.25"/>
-<text text-anchor="middle" x="539.25" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cbegin</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M421.58,-102.6C440.57,-110.09 467.27,-120.57 490.75,-129.62 494.12,-130.93 497.64,-132.27 501.15,-133.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="499.59,-136.77 510.19,-137.05 502.08,-130.22 499.59,-136.77"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="584,-120.25 494.5,-120.25 494.5,-101 584,-101 584,-120.25"/>
-<text text-anchor="middle" x="539.25" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cend</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M454.9,-100.05C464.13,-101.22 473.65,-102.43 482.81,-103.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="482.31,-107.06 492.67,-104.84 483.19,-100.11 482.31,-107.06"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="582.5,-83.25 496,-83.25 496,-64 582.5,-64 582.5,-83.25"/>
-<text text-anchor="middle" x="539.25" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M454.9,-84.79C464.78,-83.46 474.98,-82.1 484.72,-80.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="484.95,-84.29 494.39,-79.5 484.02,-77.36 484.95,-84.29"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="564.12,-46.25 514.38,-46.25 514.38,-27 564.12,-27 564.12,-46.25"/>
-<text text-anchor="middle" x="539.25" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M416.7,-45.19C439.13,-43.61 475.63,-41.04 502.8,-39.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="502.92,-42.62 512.65,-38.43 502.43,-35.64 502.92,-42.62"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph.map b/d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph.map
deleted file mode 100644
index 5e6d0a19b..000000000
--- a/d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="miller_rabin_primality_test" name="miller_rabin_primality_test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,140,178,166"/>
-<area shape="rect" id="Node000002" href="$d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506" title=" " alt="" coords="226,140,307,166"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="178,150,210,150,210,156,178,156"/>
-<area shape="rect" id="Node000003" href="$d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29" title=" " alt="" coords="355,79,513,104"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="303,137,381,108,383,113,305,142"/>
-<area shape="rect" id="Node000007" href="$df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" title=" " alt="" coords="406,140,462,166"/>
-<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="308,150,390,150,390,156,308,156"/>
-<area shape="rect" id="Node000009" href="$d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb" title=" " alt="" coords="381,189,487,215"/>
-<area shape="poly" id="edge8_Node000002_Node000009" title=" " alt="" coords="308,162,374,182,373,187,307,167"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="561,5,691,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="468,76,560,40,574,34,576,39,562,45,470,81"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="566,55,686,80"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="513,79,550,74,551,80,514,84"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="568,104,684,130"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="514,99,554,105,553,110,513,105"/>
-<area shape="rect" id="Node000008" href="$df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" title=" " alt="" coords="593,153,659,179"/>
-<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="463,152,578,160,577,165,462,157"/>
-</map>
diff --git a/d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph.md5 b/d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph.md5
deleted file mode 100644
index ccd7705a0..000000000
--- a/d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9f3ee2bfd6a09861db5895973a6587cf
\ No newline at end of file
diff --git a/d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph.svg b/d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph.svg
deleted file mode 100644
index 984807fdf..000000000
--- a/d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph.svg
+++ /dev/null
@@ -1,248 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: miller_rabin_primality_test Pages: 1 -->
-<!--zoomable 165 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 522;
-var viewHeight = 165;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>miller_rabin_primality_test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="129.25,-56.25 0,-56.25 0,-37 129.25,-37 129.25,-56.25"/>
-<text text-anchor="middle" x="64.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">miller_rabin_primality_test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.25,-56.25 165.25,-56.25 165.25,-37 226.25,-37 226.25,-56.25"/>
-<text text-anchor="middle" x="195.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">miller_test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.43,-46.62C137.7,-46.62 145.99,-46.62 153.75,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.54,-50.13 163.54,-46.63 153.54,-43.13 153.54,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="381,-102.25 262.25,-102.25 262.25,-83 381,-83 381,-102.25"/>
-<text text-anchor="middle" x="321.62" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">modular_exponentiation</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M223.93,-56.72C241.2,-63.13 263.79,-71.52 282.8,-78.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.49,-81.83 292.08,-82.03 283.93,-75.26 281.49,-81.83"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="342.75,-56.25 300.5,-56.25 300.5,-37 342.75,-37 342.75,-56.25"/>
-<text text-anchor="middle" x="321.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M226.74,-46.62C245.5,-46.62 269.66,-46.62 288.77,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.7,-50.13 298.7,-46.63 288.7,-43.13 288.7,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="361.5,-19.25 281.75,-19.25 281.75,0 361.5,0 361.5,-19.25"/>
-<text text-anchor="middle" x="321.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_binary</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M226.74,-37.67C241.51,-33.25 259.63,-27.84 276,-22.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="276.95,-26.32 285.53,-20.11 274.95,-19.61 276.95,-26.32"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="514,-157.25 417,-157.25 417,-138 514,-138 514,-157.25"/>
-<text text-anchor="middle" x="465.5" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cbegin</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M347.83,-102.6C366.82,-110.09 393.52,-120.57 417,-129.62 420.37,-130.93 423.89,-132.27 427.4,-133.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="425.84,-136.77 436.44,-137.05 428.33,-130.22 425.84,-136.77"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="510.25,-120.25 420.75,-120.25 420.75,-101 510.25,-101 510.25,-120.25"/>
-<text text-anchor="middle" x="465.5" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cend</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.15,-100.05C390.38,-101.22 399.9,-102.43 409.06,-103.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="408.56,-107.06 418.92,-104.84 409.44,-100.11 408.56,-107.06"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="508.75,-83.25 422.25,-83.25 422.25,-64 508.75,-64 508.75,-83.25"/>
-<text text-anchor="middle" x="465.5" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.15,-84.79C391.03,-83.46 401.23,-82.1 410.97,-80.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="411.2,-84.29 420.64,-79.5 410.27,-77.36 411.2,-84.29"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="490.38,-46.25 440.62,-46.25 440.62,-27 490.38,-27 490.38,-46.25"/>
-<text text-anchor="middle" x="465.5" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M342.95,-45.19C365.38,-43.61 401.88,-41.04 429.05,-39.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.17,-42.62 438.9,-38.43 428.68,-35.64 429.17,-42.62"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph_org.svg b/d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph_org.svg
deleted file mode 100644
index 10e3c737e..000000000
--- a/d6/d42/miller__rabin_8cpp_a901288288ef5ebe8e97414cc30797cce_cgraph_org.svg
+++ /dev/null
@@ -1,165 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: miller_rabin_primality_test Pages: 1 -->
-<svg width="522pt" height="165pt"
- viewBox="0.00 0.00 522.00 165.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 161.25)">
-<title>miller_rabin_primality_test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="129.25,-56.25 0,-56.25 0,-37 129.25,-37 129.25,-56.25"/>
-<text text-anchor="middle" x="64.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">miller_rabin_primality_test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.25,-56.25 165.25,-56.25 165.25,-37 226.25,-37 226.25,-56.25"/>
-<text text-anchor="middle" x="195.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">miller_test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.43,-46.62C137.7,-46.62 145.99,-46.62 153.75,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.54,-50.13 163.54,-46.63 153.54,-43.13 153.54,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="381,-102.25 262.25,-102.25 262.25,-83 381,-83 381,-102.25"/>
-<text text-anchor="middle" x="321.62" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">modular_exponentiation</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M223.93,-56.72C241.2,-63.13 263.79,-71.52 282.8,-78.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.49,-81.83 292.08,-82.03 283.93,-75.26 281.49,-81.83"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="342.75,-56.25 300.5,-56.25 300.5,-37 342.75,-37 342.75,-56.25"/>
-<text text-anchor="middle" x="321.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M226.74,-46.62C245.5,-46.62 269.66,-46.62 288.77,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.7,-50.13 298.7,-46.63 288.7,-43.13 288.7,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="361.5,-19.25 281.75,-19.25 281.75,0 361.5,0 361.5,-19.25"/>
-<text text-anchor="middle" x="321.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_binary</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M226.74,-37.67C241.51,-33.25 259.63,-27.84 276,-22.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="276.95,-26.32 285.53,-20.11 274.95,-19.61 276.95,-26.32"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="514,-157.25 417,-157.25 417,-138 514,-138 514,-157.25"/>
-<text text-anchor="middle" x="465.5" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cbegin</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M347.83,-102.6C366.82,-110.09 393.52,-120.57 417,-129.62 420.37,-130.93 423.89,-132.27 427.4,-133.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="425.84,-136.77 436.44,-137.05 428.33,-130.22 425.84,-136.77"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="510.25,-120.25 420.75,-120.25 420.75,-101 510.25,-101 510.25,-120.25"/>
-<text text-anchor="middle" x="465.5" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cend</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.15,-100.05C390.38,-101.22 399.9,-102.43 409.06,-103.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="408.56,-107.06 418.92,-104.84 409.44,-100.11 408.56,-107.06"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="508.75,-83.25 422.25,-83.25 422.25,-64 508.75,-64 508.75,-83.25"/>
-<text text-anchor="middle" x="465.5" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.15,-84.79C391.03,-83.46 401.23,-82.1 410.97,-80.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="411.2,-84.29 420.64,-79.5 410.27,-77.36 411.2,-84.29"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="490.38,-46.25 440.62,-46.25 440.62,-27 490.38,-27 490.38,-46.25"/>
-<text text-anchor="middle" x="465.5" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M342.95,-45.19C365.38,-43.61 401.88,-41.04 429.05,-39.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="429.17,-42.62 438.9,-38.43 428.68,-35.64 429.17,-42.62"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d42/miller__rabin_8cpp_ad6c2c67ea416d0e80003a88623f98b29_cgraph.map b/d6/d42/miller__rabin_8cpp_ad6c2c67ea416d0e80003a88623f98b29_cgraph.map
deleted file mode 100644
index a795e0d88..000000000
--- a/d6/d42/miller__rabin_8cpp_ad6c2c67ea416d0e80003a88623f98b29_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="modular_exponentiation" name="modular_exponentiation">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,164,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="212,5,341,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="137,51,208,33,210,38,138,57"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="217,55,336,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="164,65,201,65,201,70,164,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="219,104,334,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="138,78,210,97,208,102,137,84"/>
-</map>
diff --git a/d6/d42/miller__rabin_8cpp_ad6c2c67ea416d0e80003a88623f98b29_cgraph.md5 b/d6/d42/miller__rabin_8cpp_ad6c2c67ea416d0e80003a88623f98b29_cgraph.md5
deleted file mode 100644
index 7697989bb..000000000
--- a/d6/d42/miller__rabin_8cpp_ad6c2c67ea416d0e80003a88623f98b29_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-68460772f12262321b360a8d1ce9244e
\ No newline at end of file
diff --git a/d6/d42/miller__rabin_8cpp_ad6c2c67ea416d0e80003a88623f98b29_cgraph.svg b/d6/d42/miller__rabin_8cpp_ad6c2c67ea416d0e80003a88623f98b29_cgraph.svg
deleted file mode 100644
index b57ae2e0f..000000000
--- a/d6/d42/miller__rabin_8cpp_ad6c2c67ea416d0e80003a88623f98b29_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: modular_exponentiation Pages: 1 -->
-<svg width="260pt" height="101pt"
- viewBox="0.00 0.00 259.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>modular_exponentiation</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="118.75,-56.25 0,-56.25 0,-37 118.75,-37 118.75,-56.25"/>
-<text text-anchor="middle" x="59.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">modular_exponentiation</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.75,-93.25 154.75,-93.25 154.75,-74 251.75,-74 251.75,-93.25"/>
-<text text-anchor="middle" x="203.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cbegin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.14,-56.74C115.72,-61.06 135.27,-66.16 152.87,-70.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.5,-74.01 162.06,-73.14 153.27,-67.23 151.5,-74.01"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248,-56.25 158.5,-56.25 158.5,-37 248,-37 248,-56.25"/>
-<text text-anchor="middle" x="203.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cend</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.9,-46.62C128.13,-46.62 137.65,-46.62 146.81,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.65,-50.13 156.65,-46.63 146.65,-43.13 146.65,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.5,-19.25 160,-19.25 160,0 246.5,0 246.5,-19.25"/>
-<text text-anchor="middle" x="203.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.14,-36.51C115.72,-32.19 135.27,-27.09 152.87,-22.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.27,-26.02 162.06,-20.11 151.5,-19.24 153.27,-26.02"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d42/miller__rabin_8cpp_ad6c2c67ea416d0e80003a88623f98b29_cgraph_org.svg b/d6/d42/miller__rabin_8cpp_ad6c2c67ea416d0e80003a88623f98b29_cgraph_org.svg
deleted file mode 100644
index 941f1998e..000000000
--- a/d6/d42/miller__rabin_8cpp_ad6c2c67ea416d0e80003a88623f98b29_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: modular_exponentiation Pages: 1 -->
-<svg width="260pt" height="101pt"
- viewBox="0.00 0.00 259.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>modular_exponentiation</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="118.75,-56.25 0,-56.25 0,-37 118.75,-37 118.75,-56.25"/>
-<text text-anchor="middle" x="59.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">modular_exponentiation</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.75,-93.25 154.75,-93.25 154.75,-74 251.75,-74 251.75,-93.25"/>
-<text text-anchor="middle" x="203.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cbegin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.14,-56.74C115.72,-61.06 135.27,-66.16 152.87,-70.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.5,-74.01 162.06,-73.14 153.27,-67.23 151.5,-74.01"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248,-56.25 158.5,-56.25 158.5,-37 248,-37 248,-56.25"/>
-<text text-anchor="middle" x="203.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cend</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.9,-46.62C128.13,-46.62 137.65,-46.62 146.81,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.65,-50.13 156.65,-46.63 146.65,-43.13 146.65,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.5,-19.25 160,-19.25 160,0 246.5,0 246.5,-19.25"/>
-<text text-anchor="middle" x="203.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.14,-36.51C115.72,-32.19 135.27,-27.09 152.87,-22.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.27,-26.02 162.06,-20.11 151.5,-19.24 153.27,-26.02"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index dbf3bc2fa..000000000
--- a/d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,25 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,116,55,142"/>
-<area shape="rect" id="Node000002" href="$d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" title=" " alt="" coords="103,116,153,142"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,126,88,126,88,132,55,132"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="252,91,323,116"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,122,236,109,236,114,154,128"/>
-<area shape="rect" id="Node000004" href="$d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce" title=" " alt="" coords="201,140,373,166"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="154,130,186,135,185,140,153,135"/>
-<area shape="rect" id="Node000005" href="$d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506" title=" " alt="" coords="421,140,503,166"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="374,150,406,150,406,156,374,156"/>
-<area shape="rect" id="Node000006" href="$d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29" title=" " alt="" coords="551,79,709,104"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="499,137,577,108,579,113,501,142"/>
-<area shape="rect" id="Node000010" href="$df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" title=" " alt="" coords="602,140,658,166"/>
-<area shape="poly" id="edge9_Node000005_Node000010" title=" " alt="" coords="503,150,586,150,586,156,503,156"/>
-<area shape="rect" id="Node000012" href="$d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb" title=" " alt="" coords="577,189,683,215"/>
-<area shape="poly" id="edge11_Node000005_Node000012" title=" " alt="" coords="504,162,570,182,568,187,503,167"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="757,5,886,31"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="664,76,756,40,770,34,772,39,758,45,666,81"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="762,55,881,80"/>
-<area shape="poly" id="edge7_Node000006_Node000008" title=" " alt="" coords="709,79,746,74,747,80,710,84"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="764,104,879,130"/>
-<area shape="poly" id="edge8_Node000006_Node000009" title=" " alt="" coords="710,99,749,105,749,110,709,105"/>
-<area shape="rect" id="Node000011" href="$df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" title=" " alt="" coords="788,153,855,179"/>
-<area shape="poly" id="edge10_Node000010_Node000011" title=" " alt="" coords="658,152,773,160,773,165,658,157"/>
-</map>
diff --git a/d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index d94f21074..000000000
--- a/d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8721f89a10e662e97d49be3c6c56c607
\ No newline at end of file
diff --git a/d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 1d80860d6..000000000
--- a/d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,302 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 165 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 669;
-var viewHeight = 165;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-74.25 73,-74.25 73,-55 110.75,-55 110.75,-74.25"/>
-<text text-anchor="middle" x="91.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-64.62C44.55,-64.62 53.37,-64.62 61.69,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-68.13 71.43,-64.63 61.43,-61.13 61.43,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.12,-93.25 184.62,-93.25 184.62,-74 238.12,-74 238.12,-93.25"/>
-<text text-anchor="middle" x="211.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.23,-67.59C127.71,-70.26 152.41,-74.25 173.03,-77.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.37,-81.03 182.8,-79.17 173.49,-74.12 172.37,-81.03"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="276,-56.25 146.75,-56.25 146.75,-37 276,-37 276,-56.25"/>
-<text text-anchor="middle" x="211.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">miller_rabin_primality_test</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.23,-61.81C118.04,-60.77 126.25,-59.51 135,-58.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.45,-61.64 144.8,-56.67 134.39,-54.73 135.45,-61.64"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373,-56.25 312,-56.25 312,-37 373,-37 373,-56.25"/>
-<text text-anchor="middle" x="342.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">miller_test</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M276.18,-46.62C284.45,-46.62 292.74,-46.62 300.5,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.29,-50.13 310.29,-46.63 300.29,-43.13 300.29,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="527.75,-102.25 409,-102.25 409,-83 527.75,-83 527.75,-102.25"/>
-<text text-anchor="middle" x="468.38" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">modular_exponentiation</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M370.68,-56.72C387.95,-63.13 410.54,-71.52 429.55,-78.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="428.24,-81.83 438.83,-82.03 430.68,-75.26 428.24,-81.83"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="489.5,-56.25 447.25,-56.25 447.25,-37 489.5,-37 489.5,-56.25"/>
-<text text-anchor="middle" x="468.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge9_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge9_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M373.49,-46.62C392.25,-46.62 416.41,-46.62 435.52,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="435.45,-50.13 445.45,-46.63 435.45,-43.13 435.45,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="508.25,-19.25 428.5,-19.25 428.5,0 508.25,0 508.25,-19.25"/>
-<text text-anchor="middle" x="468.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_binary</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node12 -->
-<g id="edge11_Node000005_Node000012" class="edge">
-<title>Node5&#45;&gt;Node12</title>
-<g id="a_edge11_Node000005_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M373.49,-37.67C388.26,-33.25 406.38,-27.84 422.75,-22.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.7,-26.32 432.28,-20.11 421.7,-19.61 423.7,-26.32"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="660.75,-157.25 563.75,-157.25 563.75,-138 660.75,-138 660.75,-157.25"/>
-<text text-anchor="middle" x="612.25" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cbegin</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M494.58,-102.6C513.57,-110.09 540.27,-120.57 563.75,-129.62 567.12,-130.93 570.64,-132.27 574.15,-133.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="572.59,-136.77 583.19,-137.05 575.08,-130.22 572.59,-136.77"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="657,-120.25 567.5,-120.25 567.5,-101 657,-101 657,-120.25"/>
-<text text-anchor="middle" x="612.25" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cend</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M527.9,-100.05C537.13,-101.22 546.65,-102.43 555.81,-103.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="555.31,-107.06 565.67,-104.84 556.19,-100.11 555.31,-107.06"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="655.5,-83.25 569,-83.25 569,-64 655.5,-64 655.5,-83.25"/>
-<text text-anchor="middle" x="612.25" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge8_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge8_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M527.9,-84.79C537.78,-83.46 547.98,-82.1 557.72,-80.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="557.95,-84.29 567.39,-79.5 557.02,-77.36 557.95,-84.29"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="637.12,-46.25 587.38,-46.25 587.38,-27 637.12,-27 637.12,-46.25"/>
-<text text-anchor="middle" x="612.25" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge10_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge10_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M489.7,-45.19C512.13,-43.61 548.63,-41.04 575.8,-39.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="575.92,-42.62 585.65,-38.43 575.43,-35.64 575.92,-42.62"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index e7a427181..000000000
--- a/d6/d42/miller__rabin_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,219 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="669pt" height="165pt"
- viewBox="0.00 0.00 668.75 165.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 161.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-74.25 73,-74.25 73,-55 110.75,-55 110.75,-74.25"/>
-<text text-anchor="middle" x="91.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-64.62C44.55,-64.62 53.37,-64.62 61.69,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-68.13 71.43,-64.63 61.43,-61.13 61.43,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.12,-93.25 184.62,-93.25 184.62,-74 238.12,-74 238.12,-93.25"/>
-<text text-anchor="middle" x="211.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.23,-67.59C127.71,-70.26 152.41,-74.25 173.03,-77.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.37,-81.03 182.8,-79.17 173.49,-74.12 172.37,-81.03"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="276,-56.25 146.75,-56.25 146.75,-37 276,-37 276,-56.25"/>
-<text text-anchor="middle" x="211.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">miller_rabin_primality_test</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.23,-61.81C118.04,-60.77 126.25,-59.51 135,-58.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.45,-61.64 144.8,-56.67 134.39,-54.73 135.45,-61.64"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373,-56.25 312,-56.25 312,-37 373,-37 373,-56.25"/>
-<text text-anchor="middle" x="342.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">miller_test</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M276.18,-46.62C284.45,-46.62 292.74,-46.62 300.5,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.29,-50.13 310.29,-46.63 300.29,-43.13 300.29,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="527.75,-102.25 409,-102.25 409,-83 527.75,-83 527.75,-102.25"/>
-<text text-anchor="middle" x="468.38" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">modular_exponentiation</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M370.68,-56.72C387.95,-63.13 410.54,-71.52 429.55,-78.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="428.24,-81.83 438.83,-82.03 430.68,-75.26 428.24,-81.83"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="489.5,-56.25 447.25,-56.25 447.25,-37 489.5,-37 489.5,-56.25"/>
-<text text-anchor="middle" x="468.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge9_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge9_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M373.49,-46.62C392.25,-46.62 416.41,-46.62 435.52,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="435.45,-50.13 445.45,-46.63 435.45,-43.13 435.45,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="508.25,-19.25 428.5,-19.25 428.5,0 508.25,0 508.25,-19.25"/>
-<text text-anchor="middle" x="468.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_binary</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node12 -->
-<g id="edge11_Node000005_Node000012" class="edge">
-<title>Node5&#45;&gt;Node12</title>
-<g id="a_edge11_Node000005_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M373.49,-37.67C388.26,-33.25 406.38,-27.84 422.75,-22.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.7,-26.32 432.28,-20.11 421.7,-19.61 423.7,-26.32"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="660.75,-157.25 563.75,-157.25 563.75,-138 660.75,-138 660.75,-157.25"/>
-<text text-anchor="middle" x="612.25" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cbegin</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M494.58,-102.6C513.57,-110.09 540.27,-120.57 563.75,-129.62 567.12,-130.93 570.64,-132.27 574.15,-133.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="572.59,-136.77 583.19,-137.05 575.08,-130.22 572.59,-136.77"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="657,-120.25 567.5,-120.25 567.5,-101 657,-101 657,-120.25"/>
-<text text-anchor="middle" x="612.25" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::cend</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M527.9,-100.05C537.13,-101.22 546.65,-102.43 555.81,-103.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="555.31,-107.06 565.67,-104.84 556.19,-100.11 555.31,-107.06"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="655.5,-83.25 569,-83.25 569,-64 655.5,-64 655.5,-83.25"/>
-<text text-anchor="middle" x="612.25" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge8_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge8_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M527.9,-84.79C537.78,-83.46 547.98,-82.1 557.72,-80.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="557.95,-84.29 567.39,-79.5 557.02,-77.36 557.95,-84.29"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="637.12,-46.25 587.38,-46.25 587.38,-27 637.12,-27 637.12,-46.25"/>
-<text text-anchor="middle" x="612.25" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge10_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge10_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M489.7,-45.19C512.13,-43.61 548.63,-41.04 575.8,-39.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="575.92,-42.62 585.65,-38.43 575.43,-35.64 575.92,-42.62"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d42/miller__rabin_8cpp_source.html b/d6/d42/miller__rabin_8cpp_source.html
new file mode 100644
index 000000000..9b7cc7941
--- /dev/null
+++ b/d6/d42/miller__rabin_8cpp_source.html
@@ -0,0 +1,283 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/miller_rabin.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/d42/miller__rabin_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">miller_rabin.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/d42/miller__rabin_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;random&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00019" data-start="{" data-end="}">
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"><a class="line" href="../../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb">   19</a></span>std::vector&lt;T&gt; <a class="code hl_function" href="../../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb">reverse_binary</a>(T num) {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    std::vector&lt;T&gt; result;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    T temp = num;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    <span class="keywordflow">while</span> (temp &gt; 0) {</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        result.push_back(temp % 2);</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        temp = temp / 2;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    }</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>}</div>
+</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00043" data-start="{" data-end="}">
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="../../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29">   43</a></span>T <a class="code hl_function" href="../../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29">modular_exponentiation</a>(T base, <span class="keyword">const</span> std::vector&lt;T&gt; &amp;rev_binary_exponent,</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>                         T mod) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordflow">if</span> (mod == 1)</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    T b = 1;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">if</span> (rev_binary_exponent.size() == 0)</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        <span class="keywordflow">return</span> b;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    T A = base;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordflow">if</span> (rev_binary_exponent[0] == 1)</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        b = base;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">for</span> (<span class="keyword">typename</span> std::vector&lt;T&gt;::const_iterator it =</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>             rev_binary_exponent.cbegin() + 1;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>         it != rev_binary_exponent.cend(); ++it) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        A = A * A % mod;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordflow">if</span> (*it == 1)</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            b = A * b % mod;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    }</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">return</span> b;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>}</div>
+</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00073" data-start="{" data-end="}">
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"><a class="line" href="../../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506">   73</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506">miller_test</a>(T d, T num) {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="comment">// random number seed</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    std::random_device rd_seed;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="comment">// random number generator</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    std::mt19937 gen(rd_seed());</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="comment">// Uniformly distributed range [2, num - 2] for random numbers</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    std::uniform_int_distribution&lt;&gt; distribution(2, num - 2);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="comment">// Random number generated in the range [2, num -2].</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    T random = distribution(gen);</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="comment">// vector for reverse binary of the power</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    std::vector&lt;T&gt; <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a> = <a class="code hl_function" href="../../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb">reverse_binary</a>(d);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="comment">// x = random ^ d % num</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    T x = <a class="code hl_function" href="../../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29">modular_exponentiation</a>(random, <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a>, num);</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="comment">// miller conditions</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="keywordflow">if</span> (x == 1 || x == num - 1) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordflow">while</span> (d != num - 1) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        x = (x * x) % num;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        d *= 2;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="keywordflow">if</span> (x == 1) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        <span class="keywordflow">if</span> (x == num - 1) {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        }</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    }</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>}</div>
+</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00125" data-start="{" data-end="}">
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"><a class="line" href="../../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce">  125</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a>(T num, T repeats) {</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <span class="keywordflow">if</span> (num &lt;= 4) {</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <span class="comment">// If num == 2 or num == 3 then prime</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        <span class="keywordflow">if</span> (num == 2 || num == 3) {</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        }</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    }</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <span class="comment">// If num is even then not prime</span></div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <span class="keywordflow">if</span> (num % 2 == 0) {</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    }</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <span class="comment">// Finding d and r in num = 2^r * d + 1</span></div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    T d = num - 1, r = 0;</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="keywordflow">while</span> (d % 2 == 0) {</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        d = d / 2;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        r++;</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    }</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span> </div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <span class="keywordflow">for</span> (T i = 0; i &lt; repeats; ++i) {</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506">miller_test</a>(d, num)) {</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        }</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    }</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>}</div>
+</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span> </div>
+<div class="foldopen" id="foldopen00157" data-start="{" data-end="}">
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"><a class="line" href="../../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">  157</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>() {</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    <span class="comment">// First test on 2</span></div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;2 is prime but function says otherwise.\n&quot;</span>,</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>            <a class="code hl_function" href="../../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a>(2, 1) == <span class="keyword">true</span>));</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;First test passes.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    <span class="comment">// Second test on 5</span></div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;5 should be prime but the function says otherwise.\n&quot;</span>,</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>            <a class="code hl_function" href="../../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a>(5, 3) == <span class="keyword">true</span>));</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Second test passes.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    <span class="comment">// Third test on 23</span></div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;23 should be prime but the function says otherwise.\n&quot;</span>,</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>            <a class="code hl_function" href="../../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a>(23, 3) == <span class="keyword">true</span>));</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Third test passes.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    <span class="comment">// Fourth test on 16</span></div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;16 is not a prime but the function says otherwise.\n&quot;</span>,</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>            <a class="code hl_function" href="../../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a>(16, 3) == <span class="keyword">false</span>));</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Fourth test passes.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    <span class="comment">// Fifth test on 27</span></div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;27 is not a prime but the function says otherwise.\n&quot;</span>,</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>            <a class="code hl_function" href="../../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a>(27, 3) == <span class="keyword">false</span>));</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Fifth test passes.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>}</div>
+</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span> </div>
+<div class="foldopen" id="foldopen00183" data-start="{" data-end="}">
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"><a class="line" href="../../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  183</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    <a class="code hl_function" href="../../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>}</div>
+</div>
+<div class="ttc" id="amiller__rabin_8cpp_html_a091662a787d5ad4866713021f580fddb"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb">reverse_binary</a></div><div class="ttdeci">std::vector&lt; T &gt; reverse_binary(T num)</div><div class="ttdef"><b>Definition</b> <a href="#l00019">miller_rabin.cpp:19</a></div></div>
+<div class="ttc" id="amiller__rabin_8cpp_html_a6f9c31c1047aa3191676d64571d4c506"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506">miller_test</a></div><div class="ttdeci">bool miller_test(T d, T num)</div><div class="ttdef"><b>Definition</b> <a href="#l00073">miller_rabin.cpp:73</a></div></div>
+<div class="ttc" id="amiller__rabin_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="#l00157">miller_rabin.cpp:157</a></div></div>
+<div class="ttc" id="amiller__rabin_8cpp_html_a901288288ef5ebe8e97414cc30797cce"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a></div><div class="ttdeci">bool miller_rabin_primality_test(T num, T repeats)</div><div class="ttdef"><b>Definition</b> <a href="#l00125">miller_rabin.cpp:125</a></div></div>
+<div class="ttc" id="amiller__rabin_8cpp_html_ad6c2c67ea416d0e80003a88623f98b29"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29">modular_exponentiation</a></div><div class="ttdeci">T modular_exponentiation(T base, const std::vector&lt; T &gt; &amp;rev_binary_exponent, T mod)</div><div class="ttdef"><b>Definition</b> <a href="#l00043">miller_rabin.cpp:43</a></div></div>
+<div class="ttc" id="amiller__rabin_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00183">miller_rabin.cpp:183</a></div></div>
+<div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae249a2af508aa94266023ce8aa81426f"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a></div><div class="ttdeci">void power(int x, int n)</div><div class="ttdef"><b>Definition</b> <a href="../../df/def/power__for__huge__numbers_8cpp_source.html#l00056">power_for_huge_numbers.cpp:56</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d6/d42/miller__rabin_8cpp.html">miller_rabin.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html b/d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html
index e63a23d58..20c20af23 100644
--- a/d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html
+++ b/d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ciphers::elliptic_curve_key_exchange::Point Struct Reference</title>
+<title>TheAlgorithms/C++: ciphers::elliptic_curve_key_exchange::Point Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -129,22 +146,22 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a5a9b500ad760794b44a8d62cf9715a50" id="r_a5a9b500ad760794b44a8d62cf9715a50"><td class="memItemLeft" align="right" valign="top"><a id="a5a9b500ad760794b44a8d62cf9715a50" name="a5a9b500ad760794b44a8d62cf9715a50"></a>
-<a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a>&#160;</td><td class="memItemRight" valign="bottom"><b>x</b></td></tr>
+<tr class="memitem:a5a9b500ad760794b44a8d62cf9715a50" id="r_a5a9b500ad760794b44a8d62cf9715a50"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5a9b500ad760794b44a8d62cf9715a50">x</a></td></tr>
 <tr class="separator:a5a9b500ad760794b44a8d62cf9715a50"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a548819c1a4b751b181d0aee0aa0c6f16" id="r_a548819c1a4b751b181d0aee0aa0c6f16"><td class="memItemLeft" align="right" valign="top"><a id="a548819c1a4b751b181d0aee0aa0c6f16" name="a548819c1a4b751b181d0aee0aa0c6f16"></a>
-<a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a>&#160;</td><td class="memItemRight" valign="bottom"><b>y</b></td></tr>
+<tr class="memitem:a548819c1a4b751b181d0aee0aa0c6f16" id="r_a548819c1a4b751b181d0aee0aa0c6f16"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a548819c1a4b751b181d0aee0aa0c6f16">y</a></td></tr>
 <tr class="separator:a548819c1a4b751b181d0aee0aa0c6f16"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="friends" name="friends"></a>
 Friends</h2></td></tr>
-<tr class="memitem:af2142b27241b28f835e8ce78d7d6463c" id="r_af2142b27241b28f835e8ce78d7d6463c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af2142b27241b28f835e8ce78d7d6463c">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;op, const <a class="el" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> &amp;p)</td></tr>
+<tr class="memitem:af2142b27241b28f835e8ce78d7d6463c" id="r_af2142b27241b28f835e8ce78d7d6463c"><td class="memItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af2142b27241b28f835e8ce78d7d6463c">operator&lt;&lt;</a> (std::ostream &amp;op, const <a class="el" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> &amp;p)</td></tr>
 <tr class="memdesc:af2142b27241b28f835e8ce78d7d6463c"><td class="mdescLeft">&#160;</td><td class="mdescRight">ostream operator for printing <a class="el" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" title="Definition of struct Point.">Point</a>  <br /></td></tr>
 <tr class="separator:af2142b27241b28f835e8ce78d7d6463c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Definition of struct <a class="el" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" title="Definition of struct Point.">Point</a>. </p>
 <p>Definition of <a class="el" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" title="Definition of struct Point.">Point</a> in the curve. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00046">46</a> of file <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html">elliptic_curve_key_exchange.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="a5084e9ca27837662c31d4dc003815446" name="a5084e9ca27837662c31d4dc003815446"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a5084e9ca27837662c31d4dc003815446">&#9670;&#160;</a></span>operator==()</h2>
@@ -178,8 +195,10 @@ Friends</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if x and y are both equal with <a class="el" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" title="Definition of struct Point.">Point</a> p, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html">elliptic_curve_key_exchange.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   55</span>{ <span class="keywordflow">return</span> x == p.x &amp;&amp; y == p.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>; }</div>
-<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:14</div></div>
+<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00014">line_segment_intersection.cpp:14</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -194,9 +213,9 @@ Friends</h2></td></tr>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; operator&lt;&lt; </td>
+          <td class="memname">std::ostream &amp; operator&lt;&lt; </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>op</em></span>, </td>
+          <td class="paramtype">std::ostream &amp;</td>          <td class="paramname"><span class="paramname"><em>op</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -220,15 +239,50 @@ Friends</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>op, the ostream object </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00063">63</a> of file <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html">elliptic_curve_key_exchange.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   63</span>                                                                  {</div>
 <div class="line"><span class="lineno">   64</span>        op &lt;&lt; p.x &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; p.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>;</div>
 <div class="line"><span class="lineno">   65</span>        <span class="keywordflow">return</span> op;</div>
 <div class="line"><span class="lineno">   66</span>    }</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a5a9b500ad760794b44a8d62cf9715a50" name="a5a9b500ad760794b44a8d62cf9715a50"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a5a9b500ad760794b44a8d62cf9715a50">&#9670;&#160;</a></span>x</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a> ciphers::elliptic_curve_key_exchange::Point::x</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html">elliptic_curve_key_exchange.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a548819c1a4b751b181d0aee0aa0c6f16" name="a548819c1a4b751b181d0aee0aa0c6f16"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a548819c1a4b751b181d0aee0aa0c6f16">&#9670;&#160;</a></span>y</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d1/d83/classuint256__t.html">uint256_t</a> ciphers::elliptic_curve_key_exchange::Point::y</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html">elliptic_curve_key_exchange.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>ciphers/<a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html">elliptic_curve_key_exchange.cpp</a></li>
+<li>ciphers/<a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html">elliptic_curve_key_exchange.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.map b/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.map
index 910f880e2..a987cd5e6 100644
--- a/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.map
+++ b/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.map
@@ -1,14 +1,12 @@
 <map id="range_queries::perSegTree" name="range_queries::perSegTree">
-<area shape="rect" id="Node000001" title="Range query here is range sum, but the code can be modified to make different queries like range max ..." alt="" coords="549,94,726,119"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="264,5,475,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="489,63,588,91,587,96,487,68"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="5,63,159,118"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="173,61,182,59,263,44,264,49,183,64,174,66"/>
-<area shape="rect" id="Node000004" href="$d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" title=" " alt="" coords="281,88,458,128"/>
-<area shape="poly" id="edge4_Node000004_Node000003" title=" " alt="" coords="175,93,280,100,280,105,174,99"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="288,135,236,141,182,137,135,121,137,116,183,132,235,136,287,129"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="296,158,442,183"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="441,151,580,117,581,122,442,156"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="39,168,125,194"/>
-<area shape="poly" id="edge6_Node000005_Node000006" title=" " alt="" coords="141,179,240,178,296,174,296,179,240,183,141,184"/>
+<area shape="rect" id="Node000001" title="Range query here is range sum, but the code can be modified to make different queries like range max ..." alt="" coords="549,127,726,153"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="264,5,475,61"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="460,65,476,71,606,124,604,129,474,76,458,69"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="5,67,159,122"/>
+<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="173,62,182,60,263,44,264,49,183,65,174,67"/>
+<area shape="rect" id="Node000004" href="$d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" title=" " alt="" coords="281,85,458,126"/>
+<area shape="poly" id="edge4_Node000004_Node000003" title=" " alt="" coords="175,95,280,99,280,105,174,101"/>
+<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="287,132,240,141,211,145,182,141,135,125,137,120,183,136,211,139,239,136,286,127"/>
+<area shape="rect" id="Node000005" title=" " alt="" coords="296,150,442,175"/>
+<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="458,152,548,145,549,150,458,158"/>
 </map>
diff --git a/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.md5 b/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.md5
index f354bd5f8..5cf135f7b 100644
--- a/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.md5
+++ b/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.md5
@@ -1 +1 @@
-21fe6e10a1700715b03416cf980098cc
\ No newline at end of file
+d383430c7943689f9d46498de044199d
\ No newline at end of file
diff --git a/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.svg b/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.svg
index a1d29a48e..2ef00caea 100644
--- a/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.svg
+++ b/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.svg
@@ -4,7 +4,7 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: range_queries::perSegTree Pages: 1 -->
-<!--zoomable 150 -->
+<!--zoomable 136 -->
 
 <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)">
 
@@ -48,7 +48,7 @@
 </defs>
 <script type="application/ecmascript">
 var viewWidth = 549;
-var viewHeight = 150;
+var viewHeight = 136;
 var sectionId = 'dynsection-0';
 </script>
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
@@ -59,19 +59,19 @@ var sectionId = 'dynsection-0';
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="Range query here is range sum, but the code can be modified to make different queries like range max ...">
-<polygon fill="#999999" stroke="#666666" points="540.75,-75.25 407.75,-75.25 407.75,-56 540.75,-56 540.75,-75.25"/>
-<text text-anchor="middle" x="474.25" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
+<polygon fill="#999999" stroke="#666666" points="540.75,-36.25 407.75,-36.25 407.75,-17 540.75,-17 540.75,-36.25"/>
+<text text-anchor="middle" x="474.25" y="-22.75" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="352.25,-141.5 193.75,-141.5 193.75,-99.75 352.25,-99.75 352.25,-141.5"/>
-<text text-anchor="start" x="201.75" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::shared</text>
-<text text-anchor="start" x="201.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">_ptr&lt; range_queries::perSegTree</text>
-<text text-anchor="middle" x="273" y="-105.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Node &gt; &gt;</text>
+<g id="a_Node000002"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="352.25,-127.5 193.75,-127.5 193.75,-85.75 352.25,-85.75 352.25,-127.5"/>
+<text text-anchor="start" x="201.75" y="-114" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::shared</text>
+<text text-anchor="start" x="201.75" y="-102.75" font-family="Helvetica,sans-Serif" font-size="10.00">_ptr&lt; range_queries::perSegTree</text>
+<text text-anchor="middle" x="273" y="-91.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Node &gt; &gt;</text>
 </a>
 </g>
 </g>
@@ -79,20 +79,20 @@ var sectionId = 'dynsection-0';
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M362.11,-96.3C388.41,-89.04 415.8,-81.48 436.81,-75.68"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="361.49,-92.84 352.78,-98.88 363.35,-99.59 361.49,-92.84"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M340.57,-81.24C344.53,-79.69 348.44,-78.14 352.25,-76.62 386.25,-63.09 425.34,-46.8 449.67,-36.58"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="339.52,-77.89 331.47,-84.78 342.06,-84.41 339.52,-77.89"/>
 </a>
 </g>
-<text text-anchor="middle" x="380" y="-94.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> ptrs</text>
+<text text-anchor="middle" x="380" y="-70.39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> ptrs</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="115,-98.5 0,-98.5 0,-56.75 115,-56.75 115,-98.5"/>
-<text text-anchor="start" x="8" y="-85" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; range</text>
-<text text-anchor="start" x="8" y="-73.75" font-family="Helvetica,sans-Serif" font-size="10.00">_queries::perSegTree::</text>
-<text text-anchor="middle" x="57.5" y="-62.5" font-family="Helvetica,sans-Serif" font-size="10.00">Node &gt;</text>
+<g id="a_Node000003"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="115,-81.5 0,-81.5 0,-39.75 115,-39.75 115,-81.5"/>
+<text text-anchor="start" x="8" y="-68" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; range</text>
+<text text-anchor="start" x="8" y="-56.75" font-family="Helvetica,sans-Serif" font-size="10.00">_queries::perSegTree::</text>
+<text text-anchor="middle" x="57.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">Node &gt;</text>
 </a>
 </g>
 </g>
@@ -100,19 +100,19 @@ var sectionId = 'dynsection-0';
 <g id="edge2_Node000002_Node000003" class="edge">
 <title>Node3&#45;&gt;Node2</title>
 <g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M126.13,-98.03C128.44,-98.59 130.74,-99.12 133,-99.62 152.42,-103.94 173.56,-107.63 193.36,-110.67"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="127.26,-94.7 116.7,-95.63 125.53,-101.49 127.26,-94.7"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M126.11,-82.9C128.43,-83.51 130.73,-84.08 133,-84.62 152.37,-89.25 173.49,-93.16 193.29,-96.34"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="127.22,-79.58 116.65,-80.29 125.36,-86.32 127.22,-79.58"/>
 </a>
 </g>
-<text text-anchor="middle" x="154.38" y="-109.42" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="154.38" y="-94.93" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
 </g>
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
 <g id="a_Node000004"><a xlink:href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="339.5,-79.88 206.5,-79.88 206.5,-49.38 339.5,-49.38 339.5,-79.88"/>
-<text text-anchor="start" x="214.5" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="273" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::Node</text>
+<polygon fill="white" stroke="#bfbfbf" points="339.5,-67.88 206.5,-67.88 206.5,-37.38 339.5,-37.38 339.5,-67.88"/>
+<text text-anchor="start" x="214.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
+<text text-anchor="middle" x="273" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::Node</text>
 </a>
 </g>
 </g>
@@ -120,29 +120,29 @@ var sectionId = 'dynsection-0';
 <g id="edge4_Node000004_Node000003" class="edge">
 <title>Node3&#45;&gt;Node4</title>
 <g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M126.84,-73.46C152.24,-71.92 180.98,-70.17 206.15,-68.63"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="126.71,-69.96 116.94,-74.07 127.14,-76.95 126.71,-69.96"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M126.84,-58.06C152.24,-57.11 180.98,-56.04 206.15,-55.09"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="126.81,-54.56 116.95,-58.43 127.07,-61.56 126.81,-54.56"/>
 </a>
 </g>
-<text text-anchor="middle" x="154.38" y="-86.05" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> left</text>
-<text text-anchor="middle" x="154.38" y="-74.8" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">right</text>
+<text text-anchor="middle" x="154.38" y="-70.81" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> left</text>
+<text text-anchor="middle" x="154.38" y="-59.56" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">right</text>
 </g>
 <!-- Node4&#45;&gt;Node3 -->
 <g id="edge3_Node000003_Node000004" class="edge">
 <title>Node4&#45;&gt;Node3</title>
 <g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M211.55,-46.52C187.04,-41.59 158.54,-38.93 133,-44.38 121.23,-46.88 109.06,-51.39 98.05,-56.3"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="210.51,-49.87 221.03,-48.6 212.01,-43.04 210.51,-49.87"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M211.08,-34.14C199.45,-31.32 187.31,-28.87 175.75,-27.38 156.91,-24.94 151.58,-23.42 133,-27.38 121.23,-29.88 109.06,-34.39 98.05,-39.3"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="210.01,-37.47 220.56,-36.55 211.73,-30.69 210.01,-37.47"/>
 </a>
 </g>
-<text text-anchor="middle" x="154.38" y="-46.12" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> ptr</text>
+<text text-anchor="middle" x="154.38" y="-29.12" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> ptr</text>
 </g>
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="327.88,-27.25 218.12,-27.25 218.12,-8 327.88,-8 327.88,-27.25"/>
-<text text-anchor="middle" x="273" y="-13.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int64_t &gt;</text>
+<g id="a_Node000005"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="327.88,-19.25 218.12,-19.25 218.12,0 327.88,0 327.88,-19.25"/>
+<text text-anchor="middle" x="273" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int64_t &gt;</text>
 </a>
 </g>
 </g>
@@ -150,30 +150,11 @@ var sectionId = 'dynsection-0';
 <g id="edge5_Node000001_Node000005" class="edge">
 <title>Node5&#45;&gt;Node1</title>
 <g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M326.96,-30.38C359.7,-38.27 401.13,-48.25 431.54,-55.58"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="327.78,-26.98 317.24,-28.04 326.14,-33.79 327.78,-26.98"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M339.64,-15.23C361.39,-17.08 385.6,-19.15 407.36,-21"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="339.95,-11.74 329.69,-14.38 339.36,-18.71 339.95,-11.74"/>
 </a>
 </g>
-<text text-anchor="middle" x="380" y="-46.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> vec</text>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="89.88,-19.25 25.12,-19.25 25.12,0 89.88,0 89.88,-19.25"/>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::int64_t</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M101.75,-9.19C123.89,-9.15 151.27,-9.38 175.75,-10.38 189.4,-10.93 204.11,-11.87 217.83,-12.89"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="101.86,-5.69 91.88,-9.23 101.89,-12.69 101.86,-5.69"/>
-</a>
-</g>
-<text text-anchor="middle" x="154.38" y="-12.12" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="380" y="-20.89" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> vec</text>
 </g>
 </g>
 </svg>
diff --git a/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph_org.svg b/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph_org.svg
index bced1c641..06fd5c108 100644
--- a/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph_org.svg
+++ b/d6/d47/classrange__queries_1_1per_seg_tree__coll__graph_org.svg
@@ -4,27 +4,27 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: range_queries::perSegTree Pages: 1 -->
-<svg width="549pt" height="150pt"
- viewBox="0.00 0.00 548.75 149.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 145.5)">
+<svg width="549pt" height="136pt"
+ viewBox="0.00 0.00 548.75 135.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 131.5)">
 <title>range_queries::perSegTree</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="Range query here is range sum, but the code can be modified to make different queries like range max ...">
-<polygon fill="#999999" stroke="#666666" points="540.75,-75.25 407.75,-75.25 407.75,-56 540.75,-56 540.75,-75.25"/>
-<text text-anchor="middle" x="474.25" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
+<polygon fill="#999999" stroke="#666666" points="540.75,-36.25 407.75,-36.25 407.75,-17 540.75,-17 540.75,-36.25"/>
+<text text-anchor="middle" x="474.25" y="-22.75" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="352.25,-141.5 193.75,-141.5 193.75,-99.75 352.25,-99.75 352.25,-141.5"/>
-<text text-anchor="start" x="201.75" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::shared</text>
-<text text-anchor="start" x="201.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">_ptr&lt; range_queries::perSegTree</text>
-<text text-anchor="middle" x="273" y="-105.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Node &gt; &gt;</text>
+<g id="a_Node000002"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="352.25,-127.5 193.75,-127.5 193.75,-85.75 352.25,-85.75 352.25,-127.5"/>
+<text text-anchor="start" x="201.75" y="-114" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::shared</text>
+<text text-anchor="start" x="201.75" y="-102.75" font-family="Helvetica,sans-Serif" font-size="10.00">_ptr&lt; range_queries::perSegTree</text>
+<text text-anchor="middle" x="273" y="-91.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Node &gt; &gt;</text>
 </a>
 </g>
 </g>
@@ -32,20 +32,20 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M362.11,-96.3C388.41,-89.04 415.8,-81.48 436.81,-75.68"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="361.49,-92.84 352.78,-98.88 363.35,-99.59 361.49,-92.84"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M340.57,-81.24C344.53,-79.69 348.44,-78.14 352.25,-76.62 386.25,-63.09 425.34,-46.8 449.67,-36.58"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="339.52,-77.89 331.47,-84.78 342.06,-84.41 339.52,-77.89"/>
 </a>
 </g>
-<text text-anchor="middle" x="380" y="-94.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> ptrs</text>
+<text text-anchor="middle" x="380" y="-70.39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> ptrs</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="115,-98.5 0,-98.5 0,-56.75 115,-56.75 115,-98.5"/>
-<text text-anchor="start" x="8" y="-85" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; range</text>
-<text text-anchor="start" x="8" y="-73.75" font-family="Helvetica,sans-Serif" font-size="10.00">_queries::perSegTree::</text>
-<text text-anchor="middle" x="57.5" y="-62.5" font-family="Helvetica,sans-Serif" font-size="10.00">Node &gt;</text>
+<g id="a_Node000003"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="115,-81.5 0,-81.5 0,-39.75 115,-39.75 115,-81.5"/>
+<text text-anchor="start" x="8" y="-68" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; range</text>
+<text text-anchor="start" x="8" y="-56.75" font-family="Helvetica,sans-Serif" font-size="10.00">_queries::perSegTree::</text>
+<text text-anchor="middle" x="57.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">Node &gt;</text>
 </a>
 </g>
 </g>
@@ -53,19 +53,19 @@
 <g id="edge2_Node000002_Node000003" class="edge">
 <title>Node3&#45;&gt;Node2</title>
 <g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M126.13,-98.03C128.44,-98.59 130.74,-99.12 133,-99.62 152.42,-103.94 173.56,-107.63 193.36,-110.67"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="127.26,-94.7 116.7,-95.63 125.53,-101.49 127.26,-94.7"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M126.11,-82.9C128.43,-83.51 130.73,-84.08 133,-84.62 152.37,-89.25 173.49,-93.16 193.29,-96.34"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="127.22,-79.58 116.65,-80.29 125.36,-86.32 127.22,-79.58"/>
 </a>
 </g>
-<text text-anchor="middle" x="154.38" y="-109.42" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="154.38" y="-94.93" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
 </g>
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
 <g id="a_Node000004"><a xlink:href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="339.5,-79.88 206.5,-79.88 206.5,-49.38 339.5,-49.38 339.5,-79.88"/>
-<text text-anchor="start" x="214.5" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="273" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::Node</text>
+<polygon fill="white" stroke="#bfbfbf" points="339.5,-67.88 206.5,-67.88 206.5,-37.38 339.5,-37.38 339.5,-67.88"/>
+<text text-anchor="start" x="214.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
+<text text-anchor="middle" x="273" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::Node</text>
 </a>
 </g>
 </g>
@@ -73,29 +73,29 @@
 <g id="edge4_Node000004_Node000003" class="edge">
 <title>Node3&#45;&gt;Node4</title>
 <g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M126.84,-73.46C152.24,-71.92 180.98,-70.17 206.15,-68.63"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="126.71,-69.96 116.94,-74.07 127.14,-76.95 126.71,-69.96"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M126.84,-58.06C152.24,-57.11 180.98,-56.04 206.15,-55.09"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="126.81,-54.56 116.95,-58.43 127.07,-61.56 126.81,-54.56"/>
 </a>
 </g>
-<text text-anchor="middle" x="154.38" y="-86.05" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> left</text>
-<text text-anchor="middle" x="154.38" y="-74.8" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">right</text>
+<text text-anchor="middle" x="154.38" y="-70.81" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> left</text>
+<text text-anchor="middle" x="154.38" y="-59.56" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">right</text>
 </g>
 <!-- Node4&#45;&gt;Node3 -->
 <g id="edge3_Node000003_Node000004" class="edge">
 <title>Node4&#45;&gt;Node3</title>
 <g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M211.55,-46.52C187.04,-41.59 158.54,-38.93 133,-44.38 121.23,-46.88 109.06,-51.39 98.05,-56.3"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="210.51,-49.87 221.03,-48.6 212.01,-43.04 210.51,-49.87"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M211.08,-34.14C199.45,-31.32 187.31,-28.87 175.75,-27.38 156.91,-24.94 151.58,-23.42 133,-27.38 121.23,-29.88 109.06,-34.39 98.05,-39.3"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="210.01,-37.47 220.56,-36.55 211.73,-30.69 210.01,-37.47"/>
 </a>
 </g>
-<text text-anchor="middle" x="154.38" y="-46.12" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> ptr</text>
+<text text-anchor="middle" x="154.38" y="-29.12" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> ptr</text>
 </g>
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="327.88,-27.25 218.12,-27.25 218.12,-8 327.88,-8 327.88,-27.25"/>
-<text text-anchor="middle" x="273" y="-13.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int64_t &gt;</text>
+<g id="a_Node000005"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="327.88,-19.25 218.12,-19.25 218.12,0 327.88,0 327.88,-19.25"/>
+<text text-anchor="middle" x="273" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int64_t &gt;</text>
 </a>
 </g>
 </g>
@@ -103,30 +103,11 @@
 <g id="edge5_Node000001_Node000005" class="edge">
 <title>Node5&#45;&gt;Node1</title>
 <g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M326.96,-30.38C359.7,-38.27 401.13,-48.25 431.54,-55.58"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="327.78,-26.98 317.24,-28.04 326.14,-33.79 327.78,-26.98"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M339.64,-15.23C361.39,-17.08 385.6,-19.15 407.36,-21"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="339.95,-11.74 329.69,-14.38 339.36,-18.71 339.95,-11.74"/>
 </a>
 </g>
-<text text-anchor="middle" x="380" y="-46.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> vec</text>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="89.88,-19.25 25.12,-19.25 25.12,0 89.88,0 89.88,-19.25"/>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::int64_t</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M101.75,-9.19C123.89,-9.15 151.27,-9.38 175.75,-10.38 189.4,-10.93 204.11,-11.87 217.83,-12.89"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="101.86,-5.69 91.88,-9.23 101.89,-12.69 101.86,-5.69"/>
-</a>
-</g>
-<text text-anchor="middle" x="154.38" y="-12.12" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="380" y="-20.89" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> vec</text>
 </g>
 </g>
 </svg>
diff --git a/d6/d4a/addition__rule_8cpp.html b/d6/d4a/addition__rule_8cpp.html
index 8c52dfc16..afa348ee6 100644
--- a/d6/d4a/addition__rule_8cpp.html
+++ b/d6/d4a/addition__rule_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: probability/addition_rule.cpp File Reference</title>
+<title>TheAlgorithms/C++: probability/addition_rule.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,7 +135,9 @@ Include dependency graph for addition_rule.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d26/addition__rule_8cpp__incl.svg" width="140" height="126"><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">
+</div>
+<p><a href="../../d6/d4a/addition__rule_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a4adfd055c758546456d440ee9133555d" id="r_a4adfd055c758546456d440ee9133555d"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4adfd055c758546456d440ee9133555d">addition_rule_independent</a> (double A, double B)</td></tr>
@@ -130,6 +149,8 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Addition rule of probabilities. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/d4a/addition__rule_8cpp_source.html">addition_rule.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a565ffcbbdbe496ced37250bc8dc36bc0" name="a565ffcbbdbe496ced37250bc8dc36bc0"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a565ffcbbdbe496ced37250bc8dc36bc0">&#9670;&#160;</a></span>addition_rule_dependent()</h2>
@@ -155,6 +176,8 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Calculates the probability of the events A or B for dependent events note that if value of B_given_A is unknown, use chainrule to find it \parama [in] A probability of event A \parama [in] B probability of event B \parama [in] B_given_A probability of event B condition A </p><dl class="section return"><dt>Returns</dt><dd>probability of A and B </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d4a/addition__rule_8cpp_source.html#l00025">25</a> of file <a class="el" href="../../d6/d4a/addition__rule_8cpp_source.html">addition_rule.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   25</span>                                                                     {</div>
 <div class="line"><span class="lineno">   26</span>    <span class="keywordflow">return</span> (A + B) - (A * B_given_A);</div>
 <div class="line"><span class="lineno">   27</span>}</div>
@@ -180,6 +203,8 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>calculates the probability of the independent events A or B for independent events \parama [in] A probability of event A \parama [in] B probability of event B </p><dl class="section return"><dt>Returns</dt><dd>probability of A and B </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d4a/addition__rule_8cpp_source.html#l00014">14</a> of file <a class="el" href="../../d6/d4a/addition__rule_8cpp_source.html">addition_rule.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   14</span>                                                     {</div>
 <div class="line"><span class="lineno">   15</span>    <span class="keywordflow">return</span> (A + B) - (A * B);</div>
 <div class="line"><span class="lineno">   16</span>}</div>
@@ -201,29 +226,24 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d4a/addition__rule_8cpp_source.html#l00030">30</a> of file <a class="el" href="../../d6/d4a/addition__rule_8cpp_source.html">addition_rule.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   30</span>           {</div>
 <div class="line"><span class="lineno">   31</span>    <span class="keywordtype">double</span> A = 0.5;</div>
 <div class="line"><span class="lineno">   32</span>    <span class="keywordtype">double</span> B = 0.25;</div>
 <div class="line"><span class="lineno">   33</span>    <span class="keywordtype">double</span> B_given_A = 0.05;</div>
 <div class="line"><span class="lineno">   34</span> </div>
-<div class="line"><span class="lineno">   35</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;independent P(A or B) = &quot;</span> &lt;&lt; <a class="code hl_function" href="#a4adfd055c758546456d440ee9133555d">addition_rule_independent</a>(A, B)</div>
-<div class="line"><span class="lineno">   36</span>              &lt;&lt; <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">   35</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;independent P(A or B) = &quot;</span> &lt;&lt; <a class="code hl_function" href="#a4adfd055c758546456d440ee9133555d">addition_rule_independent</a>(A, B)</div>
+<div class="line"><span class="lineno">   36</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   37</span> </div>
-<div class="line"><span class="lineno">   38</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;dependent P(A or B) = &quot;</span></div>
-<div class="line"><span class="lineno">   39</span>              &lt;&lt; <a class="code hl_function" href="#a565ffcbbdbe496ced37250bc8dc36bc0">addition_rule_dependent</a>(A, B, B_given_A) &lt;&lt; <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">   38</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;dependent P(A or B) = &quot;</span></div>
+<div class="line"><span class="lineno">   39</span>              &lt;&lt; <a class="code hl_function" href="#a565ffcbbdbe496ced37250bc8dc36bc0">addition_rule_dependent</a>(A, B, B_given_A) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   40</span> </div>
 <div class="line"><span class="lineno">   41</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   42</span>}</div>
-<div class="ttc" id="aaddition__rule_8cpp_html_a4adfd055c758546456d440ee9133555d"><div class="ttname"><a href="#a4adfd055c758546456d440ee9133555d">addition_rule_independent</a></div><div class="ttdeci">double addition_rule_independent(double A, double B)</div><div class="ttdef"><b>Definition</b> addition_rule.cpp:14</div></div>
-<div class="ttc" id="aaddition__rule_8cpp_html_a565ffcbbdbe496ced37250bc8dc36bc0"><div class="ttname"><a href="#a565ffcbbdbe496ced37250bc8dc36bc0">addition_rule_dependent</a></div><div class="ttdeci">double addition_rule_dependent(double A, double B, double B_given_A)</div><div class="ttdef"><b>Definition</b> addition_rule.cpp:25</div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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><!-- 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="../../d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="280" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aaddition__rule_8cpp_html_a4adfd055c758546456d440ee9133555d"><div class="ttname"><a href="#a4adfd055c758546456d440ee9133555d">addition_rule_independent</a></div><div class="ttdeci">double addition_rule_independent(double A, double B)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d4a/addition__rule_8cpp_source.html#l00014">addition_rule.cpp:14</a></div></div>
+<div class="ttc" id="aaddition__rule_8cpp_html_a565ffcbbdbe496ced37250bc8dc36bc0"><div class="ttname"><a href="#a565ffcbbdbe496ced37250bc8dc36bc0">addition_rule_dependent</a></div><div class="ttdeci">double addition_rule_dependent(double A, double B, double B_given_A)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d4a/addition__rule_8cpp_source.html#l00025">addition_rule.cpp:25</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 28ad5e89c..000000000
--- a/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,55,80"/>
-<area shape="rect" id="Node000002" href="$d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0" title=" " alt="" coords="108,5,269,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,56,102,40,123,33,124,38,103,45,56,61"/>
-<area shape="rect" id="Node000003" href="$d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d" title=" " alt="" coords="103,55,274,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,65,87,65,87,70,55,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="153,104,224,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,74,103,90,139,101,137,106,102,95,54,79"/>
-</map>
diff --git a/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index defb73c95..000000000
--- a/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-10255a50036a153f8a25c64a9fab24ec
\ No newline at end of file
diff --git a/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 25915aeed..000000000
--- a/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="210pt" height="101pt"
- viewBox="0.00 0.00 209.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.75,-93.25 76.75,-93.25 76.75,-74 197.75,-74 197.75,-93.25"/>
-<text text-anchor="middle" x="137.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">addition_rule_dependent</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.24,-53.25C47.61,-57.04 60.98,-61.79 73,-65.62 78.04,-67.23 83.32,-68.85 88.6,-70.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.31,-73.69 97.89,-73.13 89.27,-66.97 87.31,-73.69"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.5,-56.25 73,-56.25 73,-37 201.5,-37 201.5,-56.25"/>
-<text text-anchor="middle" x="137.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">addition_rule_independent</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.49,-46.62C44.28,-46.62 52.5,-46.62 61.27,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.08,-50.13 71.08,-46.63 61.08,-43.13 61.08,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164,-19.25 110.5,-19.25 110.5,0 164,0 164,-19.25"/>
-<text text-anchor="middle" x="137.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.24,-40C47.61,-36.21 60.98,-31.46 73,-27.62 81.47,-24.92 90.64,-22.19 99.3,-19.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.16,-23.11 108.83,-17.02 98.26,-16.37 100.16,-23.11"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index c8020199e..000000000
--- a/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="210pt" height="101pt"
- viewBox="0.00 0.00 209.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.75,-93.25 76.75,-93.25 76.75,-74 197.75,-74 197.75,-93.25"/>
-<text text-anchor="middle" x="137.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">addition_rule_dependent</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.24,-53.25C47.61,-57.04 60.98,-61.79 73,-65.62 78.04,-67.23 83.32,-68.85 88.6,-70.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.31,-73.69 97.89,-73.13 89.27,-66.97 87.31,-73.69"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.5,-56.25 73,-56.25 73,-37 201.5,-37 201.5,-56.25"/>
-<text text-anchor="middle" x="137.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">addition_rule_independent</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.49,-46.62C44.28,-46.62 52.5,-46.62 61.27,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.08,-50.13 71.08,-46.63 61.08,-43.13 61.08,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164,-19.25 110.5,-19.25 110.5,0 164,0 164,-19.25"/>
-<text text-anchor="middle" x="137.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.24,-40C47.61,-36.21 60.98,-31.46 73,-27.62 81.47,-24.92 90.64,-22.19 99.3,-19.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.16,-23.11 108.83,-17.02 98.26,-16.37 100.16,-23.11"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d4a/addition__rule_8cpp_source.html b/d6/d4a/addition__rule_8cpp_source.html
new file mode 100644
index 000000000..55da00aeb
--- /dev/null
+++ b/d6/d4a/addition__rule_8cpp_source.html
@@ -0,0 +1,170 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: probability/addition_rule.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/d4a/addition__rule_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">addition_rule.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/d4a/addition__rule_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span> </div>
+<div class="foldopen" id="foldopen00014" data-start="{" data-end="}">
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"><a class="line" href="../../d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d">   14</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d">addition_rule_independent</a>(<span class="keywordtype">double</span> A, <span class="keywordtype">double</span> B) {</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="keywordflow">return</span> (A + B) - (A * B);</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>}</div>
+</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
+<div class="foldopen" id="foldopen00025" data-start="{" data-end="}">
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"><a class="line" href="../../d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0">   25</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0">addition_rule_dependent</a>(<span class="keywordtype">double</span> A, <span class="keywordtype">double</span> B, <span class="keywordtype">double</span> B_given_A) {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="keywordflow">return</span> (A + B) - (A * B_given_A);</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>}</div>
+</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="foldopen" id="foldopen00030" data-start="{" data-end="}">
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"><a class="line" href="../../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   30</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordtype">double</span> A = 0.5;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordtype">double</span> B = 0.25;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordtype">double</span> B_given_A = 0.05;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;independent P(A or B) = &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d">addition_rule_independent</a>(A, B)</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;dependent P(A or B) = &quot;</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>              &lt;&lt; <a class="code hl_function" href="../../d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0">addition_rule_dependent</a>(A, B, B_given_A) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>}</div>
+</div>
+<div class="ttc" id="aaddition__rule_8cpp_html_a4adfd055c758546456d440ee9133555d"><div class="ttname"><a href="../../d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d">addition_rule_independent</a></div><div class="ttdeci">double addition_rule_independent(double A, double B)</div><div class="ttdef"><b>Definition</b> <a href="#l00014">addition_rule.cpp:14</a></div></div>
+<div class="ttc" id="aaddition__rule_8cpp_html_a565ffcbbdbe496ced37250bc8dc36bc0"><div class="ttname"><a href="../../d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0">addition_rule_dependent</a></div><div class="ttdeci">double addition_rule_dependent(double A, double B, double B_given_A)</div><div class="ttdef"><b>Definition</b> <a href="#l00025">addition_rule.cpp:25</a></div></div>
+<div class="ttc" id="aaddition__rule_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00030">addition_rule.cpp:30</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_82e494173a87936756866de2fa774307.html">probability</a></li><li class="navelem"><a class="el" href="../../d6/d4a/addition__rule_8cpp.html">addition_rule.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/d4e/easter_8cpp_source.html b/d6/d4e/easter_8cpp_source.html
new file mode 100644
index 000000000..887758015
--- /dev/null
+++ b/d6/d4e/easter_8cpp_source.html
@@ -0,0 +1,251 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/easter.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/d4e/easter_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">easter.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * @file</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * @brief Determines the [Date of</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * Easter](https://en.wikipedia.org/wiki/Date_of_Easter) after 1582</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> * @details</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> * The date of Easter is determined in each year through a calculation known as</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> * &quot;computus.&quot; Easter is celebrated on the first Sunday after the Paschal full</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> * moon, which is the first full moon on or after 21 March. Determining this</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment"> * date in advance requires a correlation between the lunar months and the solar</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment"> * year, while also accounting for the month, date, and weekday of the Julian or</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment"> * Gregorian calendar. The complexity of the algorithm arises because of the</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment"> * desire to associate the date of Easter with the date of the Jewish feast of</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment"> * Passover which, Christians believe, is when Jesus was crucified.</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment"> * @author [AlternateWalls](https://github.com/AlternateWalls)</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment"> * @brief Contains information for Easter date</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment"> */</span></div>
+<div class="foldopen" id="foldopen00027" data-start="{" data-end="};">
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../d1/df6/class_easter_year_month_day.html">   27</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d1/df6/class_easter_year_month_day.html">EasterYearMonthDay</a> {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../d1/df6/class_easter_year_month_day.html#a28d3cd09391390250932b7fb58fe61dc">   29</a></span>    uint64_t <a class="code hl_variable" href="../../d1/df6/class_easter_year_month_day.html#a28d3cd09391390250932b7fb58fe61dc">year</a>;   </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"><a class="line" href="../../d1/df6/class_easter_year_month_day.html#a01a068eae0b6fa8f86f5f60c2840bbde">   30</a></span>    uint64_t <a class="code hl_variable" href="../../d1/df6/class_easter_year_month_day.html#a01a068eae0b6fa8f86f5f60c2840bbde">month</a>;  </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="../../d1/df6/class_easter_year_month_day.html#ade0b934e5b1af24e19ff959673b2ec51">   31</a></span>    uint64_t <a class="code hl_variable" href="../../d1/df6/class_easter_year_month_day.html#ade0b934e5b1af24e19ff959673b2ec51">day</a>;    </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <a class="code hl_class" href="../../d1/df6/class_easter_year_month_day.html">EasterYearMonthDay</a>(uint64_t newYear, uint64_t newMonth, uint64_t newDay) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        <a class="code hl_variable" href="../../d1/df6/class_easter_year_month_day.html#a28d3cd09391390250932b7fb58fe61dc">year</a> = newYear;  <span class="comment">// Assigns year to class</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        <a class="code hl_variable" href="../../d1/df6/class_easter_year_month_day.html#a01a068eae0b6fa8f86f5f60c2840bbde">month</a> = newMonth;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        <a class="code hl_variable" href="../../d1/df6/class_easter_year_month_day.html#ade0b934e5b1af24e19ff959673b2ec51">day</a> = newDay;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    }</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>};</div>
+</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="comment"> * @brief Function that finds the month and day of Easter</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="comment"> * @params param1 An int &quot;y&quot; of the year you want to find Easter on after</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="comment"> * 1582</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="comment"> * @returns An instance of the easterYearMonthDay calss that contains the</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="comment"> * information (Ex. 420 - 4/20 or April 20th)</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><a class="code hl_class" href="../../d1/df6/class_easter_year_month_day.html">EasterYearMonthDay</a> findEaster(uint64_t y) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">if</span> (y &gt; 1582) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        uint64_t a = y % 19;   <span class="comment">// Year&#39;s location on Metonic Calendar</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        uint64_t b = y / 100;  <span class="comment">// Century index</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        uint64_t c = y % 100;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        uint64_t d = b / 4;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        uint64_t e = b % 4;  <span class="comment">// Takes into account leap years</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        uint64_t <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">f</a> = (b + 8) / 25;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        uint64_t <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a> = (b - <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">f</a> + 1) / 3;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        uint64_t <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = (19 * a + b - d - <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a> + 15) %</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>                     30;  <span class="comment">// Days from Mar. 21st until the full moon</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        uint64_t i = c / 4;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        uint64_t <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = c % 4;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        uint64_t r =</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            (32 + 2 * e + 2 * i - <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> - <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>) %</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            7;  <span class="comment">// The number of days from Paschal full moon to next Sunday</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        uint64_t m = (a + 11 * <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> + 22 * r) / 451;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        uint64_t n = (<a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> + r - 7 * m + 114) / 31;  <span class="comment">// Month of Easter</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        uint64_t p = (<a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> + r - 7 * m + 114) % 31;  <span class="comment">// p + 1 is the day of Easter</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <span class="comment">// Assign values</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        <a class="code hl_class" href="../../d1/df6/class_easter_year_month_day.html">EasterYearMonthDay</a> date(</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            y, n, p + 1);  <span class="comment">// Assign values to new instance of class</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        <span class="comment">// Return date</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        <span class="keywordflow">return</span> date;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        <a class="code hl_class" href="../../d1/df6/class_easter_year_month_day.html">EasterYearMonthDay</a> date(0, 0, 0);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="comment">// Return date</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        <span class="keywordflow">return</span> date;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    }</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>}</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="comment">// 2003 | April 20th</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    assert(findEaster(2003).month == 4);  <span class="comment">// Should return true</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    assert(findEaster(2003).day == 20);   <span class="comment">// Should return true</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="comment">// 1910 | March 27th</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    assert(findEaster(1910).month == 3);  <span class="comment">// Should return true</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    assert(findEaster(1910).day == 27);   <span class="comment">// Should return true</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="comment">// 1877 | April 1st</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    assert(findEaster(1877).month != 3);  <span class="comment">// Should return true</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    assert(findEaster(1877).day != 22);   <span class="comment">// Should return true</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="comment">// 1400 | Invalid date</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    assert(findEaster(1400).month == 0);  <span class="comment">// Should return true</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    assert(findEaster(1400).day == 0);    <span class="comment">// Should return true</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>}</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>}</div>
+<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00100">caesar_cipher.cpp:100</a></div></div>
+<div class="ttc" id="aclass_easter_year_month_day_html"><div class="ttname"><a href="../../d1/df6/class_easter_year_month_day.html">EasterYearMonthDay</a></div><div class="ttdoc">for assert</div><div class="ttdef"><b>Definition</b> <a href="#l00027">easter.cpp:27</a></div></div>
+<div class="ttc" id="aclass_easter_year_month_day_html_a01a068eae0b6fa8f86f5f60c2840bbde"><div class="ttname"><a href="../../d1/df6/class_easter_year_month_day.html#a01a068eae0b6fa8f86f5f60c2840bbde">EasterYearMonthDay::month</a></div><div class="ttdeci">uint64_t month</div><div class="ttdoc">month Easter is on</div><div class="ttdef"><b>Definition</b> <a href="#l00030">easter.cpp:30</a></div></div>
+<div class="ttc" id="aclass_easter_year_month_day_html_a28d3cd09391390250932b7fb58fe61dc"><div class="ttname"><a href="../../d1/df6/class_easter_year_month_day.html#a28d3cd09391390250932b7fb58fe61dc">EasterYearMonthDay::year</a></div><div class="ttdeci">uint64_t year</div><div class="ttdoc">year Easter is on</div><div class="ttdef"><b>Definition</b> <a href="#l00029">easter.cpp:29</a></div></div>
+<div class="ttc" id="aclass_easter_year_month_day_html_ade0b934e5b1af24e19ff959673b2ec51"><div class="ttname"><a href="../../d1/df6/class_easter_year_month_day.html#ade0b934e5b1af24e19ff959673b2ec51">EasterYearMonthDay::day</a></div><div class="ttdeci">uint64_t day</div><div class="ttdoc">day Easter is on</div><div class="ttdef"><b>Definition</b> <a href="#l00031">easter.cpp:31</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00115">composite_simpson_rule.cpp:115</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a4251b4df4748a0b9c43a48f61bdd2397"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">numerical_methods::simpson_method::f</a></div><div class="ttdeci">double f(double x)</div><div class="ttdoc">A function f(x) that will be used to test the method.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00113">composite_simpson_rule.cpp:113</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00045">hash_search.cpp:45</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><b>easter.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/d4e/namespaceciphers.html b/d6/d4e/namespaceciphers.html
index ddd3b06c1..f96b72232 100644
--- a/d6/d4e/namespaceciphers.html
+++ b/d6/d4e/namespaceciphers.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ciphers Namespace Reference</title>
+<title>TheAlgorithms/C++: ciphers Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -136,11 +153,11 @@ Variables</h2></td></tr>
 <div class="textblock"><p>Algorithms for encryption and decryption. </p>
 <p>for IO operations</p>
 <p><a href="https://en.wikipedia.org/wiki/Base64" target="_blank">Base64 Encoding and Decoding</a></p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/transform.html">std::transform</a> and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/replace.html">std::replace</a> for assert for uint8_t for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">std::stringstream</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
-<p>for assert for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a></p>
+<p>for std::string</p>
+<p>for std::transform and std::replace for assert for uint8_t for IO operations for std::map for std::stringstream for std::string for std::vector</p>
+<p>for assert for IO operations for std::map</p>
 <p>Algorithms for encryption and decryption</p>
-<p>In programming, <a href="https://en.wikipedia.org/wiki/Base64" target="_blank">Base64</a> is a group of binary-to-text encoding schemes that represent binary data (more specifically, a sequence of 8-bit bytes) in an ASCII string format by translating the data into a radix-64 representation. The term Base64 originates from a specific MIME content transfer encoding. Each non-final Base64 digit represents exactly 6 bits of data. Three 8-bit bytes (i.e., a total of 24 bits) can therefore be represented by four 6-bit Base64 digits. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AshishYUO" target="_blank">Ashish Daulatabad</a> for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></code> for <code>assert</code> operations for IO operations</dd></dl>
+<p>In programming, <a href="https://en.wikipedia.org/wiki/Base64" target="_blank">Base64</a> is a group of binary-to-text encoding schemes that represent binary data (more specifically, a sequence of 8-bit bytes) in an ASCII string format by translating the data into a radix-64 representation. The term Base64 originates from a specific MIME content transfer encoding. Each non-final Base64 digit represents exactly 6 bits of data. Three 8-bit bytes (i.e., a total of 24 bits) can therefore be represented by four 6-bit Base64 digits. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AshishYUO" target="_blank">Ashish Daulatabad</a> for <code>std::array</code> for <code>assert</code> operations for IO operations</dd></dl>
 <p>Cipher algorithms</p>
 <p>for assert for 256-bit integer</p>
 <p>Cipher algorithms </p>
@@ -169,6 +186,8 @@ Variables</h2></td></tr>
 <div class="line">    <span class="stringliteral">&quot;*()_+`-=[]{}|;&#39;:\&quot;,./&lt;&gt;?\\\r\n \0&quot;</span></div>
 </div><!-- fragment --><p>dictionary of characters that can be encrypted and decrypted </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00074">74</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
+
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html b/d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html
index 07dd492b5..0163c449e 100644
--- a/d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html
+++ b/d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: /Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/iterative_factorial.cpp</title>
+<title>TheAlgorithms/C++: /Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/iterative_factorial.cpp</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,55 +127,17 @@ $(function(){initNavTree('d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plu
 <p>5! = 5 * 4 * 3 * 2 * 1</p>
 <p>Recursive implementation of factorial pseudocode:</p>
 <p>function factorial(n): if n == 1: return 1 else: return factorial(n-1)</p>
-<div class="fragment"><div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @file</span></div>
-<div class="line"><span class="comment"> * @brief Iterative implementation of</span></div>
-<div class="line"><span class="comment"> * [Factorial](https://en.wikipedia.org/wiki/Factorial)</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * @author [Renjian-buchai](https://github.com/Renjian-buchai)</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * @details Calculates factorial iteratively.</span></div>
-<div class="line"><span class="comment"> * \f[n! = n\times(n-1)\times(n-2)\times(n-3)\times\ldots\times3\times2\times1</span></div>
-<div class="line"><span class="comment"> *       = n\times(n-1)!\f]</span></div>
-<div class="line"><span class="comment"> * for example:</span></div>
-<div class="line"><span class="comment"> * \f$4! = 4\times3! = 4\times3\times2\times1 = 24\f$</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * @example</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * 5! = 5 * 4 * 3 * 2 * 1</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * Recursive implementation of factorial pseudocode:</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * function factorial(n):</span></div>
-<div class="line"><span class="comment"> *     if n == 1:</span></div>
-<div class="line"><span class="comment"> *         return 1</span></div>
-<div class="line"><span class="comment"> *     else:</span></div>
-<div class="line"><span class="comment"> *         return factorial(n-1)</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> */</span></div>
+<div class="fragment"><div class="line"> </div>
+<div class="line"><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><span class="preprocessor">#include &lt;cstdint&gt;</span>    </div>
+<div class="line"><span class="preprocessor">#include &lt;exception&gt;</span>  </div>
+<div class="line"><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
 <div class="line"> </div>
-<div class="line"><span class="preprocessor">#include &lt;cassert&gt;</span>    <span class="comment">/// for assert</span></div>
-<div class="line"><span class="preprocessor">#include &lt;cstdint&gt;</span>    <span class="comment">/// for integral types</span></div>
-<div class="line"><span class="preprocessor">#include &lt;exception&gt;</span>  <span class="comment">/// for std::invalid_argument</span></div>
-<div class="line"><span class="preprocessor">#include &lt;iostream&gt;</span>   <span class="comment">/// for std::cout</span></div>
-<div class="line"><span class="comment"></span> </div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @namespace</span></div>
-<div class="line"><span class="comment"> * @brief Mathematical algorithms</span></div>
-<div class="line"><span class="comment"> */</span></div>
 <div class="line"><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
-<div class="line"><span class="comment"></span> </div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @brief Calculates the factorial iteratively.</span></div>
-<div class="line"><span class="comment"> * @param n Nth factorial.</span></div>
-<div class="line"><span class="comment"> * @return Factorial.</span></div>
-<div class="line"><span class="comment"> * @note 0! = 1.</span></div>
-<div class="line"><span class="comment"> * @warning Maximum=20 because there are no 128-bit integers in C++. 21!</span></div>
-<div class="line"><span class="comment"> * returns 1.419e+19, which is not 21! but (21! % UINT64_MAX).</span></div>
-<div class="line"><span class="comment"> */</span></div>
+<div class="line"> </div>
 <div class="line">uint64_t <a id="a0" name="a0"></a><a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">iterativeFactorial</a>(uint8_t n) {</div>
 <div class="line">    <span class="keywordflow">if</span> (n &gt; 20) {</div>
-<div class="line">        <span class="keywordflow">throw</span> <a id="_a1" name="_a1"></a><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>(<span class="stringliteral">&quot;Maximum n value is 20&quot;</span>);</div>
+<div class="line">        <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Maximum n value is 20&quot;</span>);</div>
 <div class="line">    }</div>
 <div class="line"> </div>
 <div class="line">    <span class="comment">// 1 because it is the identity number of multiplication.</span></div>
@@ -173,72 +152,62 @@ $(function(){initNavTree('d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plu
 <div class="line">}</div>
 <div class="line"> </div>
 <div class="line">}  <span class="comment">// namespace math</span></div>
-<div class="line"><span class="comment"></span> </div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @brief Self-test implementations to test iterativeFactorial function.</span></div>
-<div class="line"><span class="comment"> * @note There is 1 special case: 0! = 1.</span></div>
-<div class="line"><span class="comment"> */</span></div>
-<div class="line"><span class="keyword">static</span> <span class="keywordtype">void</span> <a id="a2" name="a2"></a><a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"> </div>
+<div class="line"><span class="keyword">static</span> <span class="keywordtype">void</span> <a id="a1" name="a1"></a><a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
 <div class="line">    <span class="comment">// Special case test</span></div>
-<div class="line">    <a id="_a3" name="_a3"></a><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Exception case test \n&quot;</span></div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;Exception case test \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;Input: 0 \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;Expected output: 1 \n\n&quot;</span>;</div>
 <div class="line">    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a>(0) == 1);</div>
 <div class="line"> </div>
 <div class="line">    <span class="comment">// Base case</span></div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Base case test \n&quot;</span></div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;Base case test \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;Input: 1 \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;Expected output: 1 \n\n&quot;</span>;</div>
 <div class="line">    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a>(1) == 1);</div>
 <div class="line"> </div>
 <div class="line">    <span class="comment">// Small case</span></div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Small number case test \n&quot;</span></div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;Small number case test \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;Input: 5 \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;Expected output: 120 \n\n&quot;</span>;</div>
 <div class="line">    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a>(5) == 120);</div>
 <div class="line"> </div>
 <div class="line">    <span class="comment">// Medium case</span></div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Medium number case test \n&quot;</span></div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;Medium number case test \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;Input: 10 \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;Expected output: 3628800 \n\n&quot;</span>;</div>
 <div class="line">    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a>(10) == 3628800);</div>
 <div class="line"> </div>
 <div class="line">    <span class="comment">// Maximum case</span></div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Maximum case test \n&quot;</span></div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum case test \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;Input: 20 \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;Expected output: 2432902008176640000\n\n&quot;</span>;</div>
 <div class="line">    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a>(20) == 2432902008176640000);</div>
 <div class="line"> </div>
 <div class="line">    <span class="comment">// Exception test</span></div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Exception test \n&quot;</span></div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;Exception test \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;Input: 21 \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;Expected output: Exception thrown \n&quot;</span>;</div>
 <div class="line"> </div>
 <div class="line">    <span class="keywordtype">bool</span> wasExceptionThrown = <span class="keyword">false</span>;</div>
 <div class="line">    <span class="keywordflow">try</span> {</div>
 <div class="line">        <a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a>(21);</div>
-<div class="line">    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>&amp;) {</div>
+<div class="line">    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::invalid_argument&amp;) {</div>
 <div class="line">        wasExceptionThrown = <span class="keyword">true</span>;</div>
 <div class="line">    }</div>
 <div class="line">    assert(wasExceptionThrown);</div>
 <div class="line"> </div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have passed successfully.\n&quot;</span>;</div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have passed successfully.\n&quot;</span>;</div>
 <div class="line">}</div>
-<div class="line"><span class="comment"></span> </div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @brief Main function</span></div>
-<div class="line"><span class="comment"> * @returns 0 on exit</span></div>
-<div class="line"><span class="comment"> */</span></div>
-<div class="line"><span class="keywordtype">int</span> <a id="a4" name="a4"></a><a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"> </div>
+<div class="line"><span class="keywordtype">int</span> <a id="a2" name="a2"></a><a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
 <div class="line">    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Run self-test implementation</span></div>
 <div class="line">    <span class="keywordflow">return</span> 0;</div>
 <div class="line">}</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="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> generate_parentheses.cpp:82</div></div>
-<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> generate_parentheses.cpp:110</div></div>
-<div class="ttc" id="ainvalid_argument_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00082">generate_parentheses.cpp:82</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
 <div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
-<div class="ttc" id="anamespacemath_html_a2565c745aac2f9561cc6fd9e56d9b77a"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a></div><div class="ttdeci">uint64_t iterativeFactorial(uint8_t n)</div><div class="ttdoc">Calculates the factorial iteratively.</div><div class="ttdef"><b>Definition</b> iterative_factorial.cpp:47</div></div>
+<div class="ttc" id="anamespacemath_html_a2565c745aac2f9561cc6fd9e56d9b77a"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a></div><div class="ttdeci">uint64_t iterativeFactorial(uint8_t n)</div><div class="ttdoc">Calculates the factorial iteratively.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d9f/iterative__factorial_8cpp_source.html#l00047">iterative_factorial.cpp:47</a></div></div>
 </div><!-- fragment --> </div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/d6/d53/namespaceword__break.html b/d6/d53/namespaceword__break.html
index 59f8c1c64..096426b76 100644
--- a/d6/d53/namespaceword__break.html
+++ b/d6/d53/namespaceword__break.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: word_break Namespace Reference</title>
+<title>TheAlgorithms/C++: word_break Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d6/d57/array__right__rotation_8cpp.html b/d6/d57/array__right__rotation_8cpp.html
index abae592ef..9784440ec 100644
--- a/d6/d57/array__right__rotation_8cpp.html
+++ b/d6/d57/array__right__rotation_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: operations_on_datastructures/array_right_rotation.cpp File Reference</title>
+<title>TheAlgorithms/C++: operations_on_datastructures/array_right_rotation.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,11 +138,13 @@ Include dependency graph for array_right_rotation.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/df4/array__right__rotation_8cpp__incl.svg" width="252" height="126"><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">
+</div>
+<p><a href="../../d6/d57/array__right__rotation_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></td></tr>
-<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
+<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::vector <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html">tests</a></td></tr>
 <tr class="memdesc:d9/df4/namespacetests"><td class="mdescLeft">&#160;</td><td class="mdescRight">Testcases to check Union of Two Arrays. <br /></td></tr>
@@ -133,10 +152,10 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a6109193567a5b7e36a27f2b4865fce20" id="r_a6109193567a5b7e36a27f2b4865fce20"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures::print</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;array)</td></tr>
+<tr class="memitem:a6109193567a5b7e36a27f2b4865fce20" id="r_a6109193567a5b7e36a27f2b4865fce20"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures::print</a> (const std::vector&lt; int32_t &gt; &amp;array)</td></tr>
 <tr class="memdesc:a6109193567a5b7e36a27f2b4865fce20"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints the values of a vector sequentially, ending with a newline character.  <br /></td></tr>
 <tr class="separator:a6109193567a5b7e36a27f2b4865fce20"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a1bfb8711f49e591eb168ccaa3df6fb86" id="r_a1bfb8711f49e591eb168ccaa3df6fb86"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86">operations_on_datastructures::shift_right</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;array, size_t shift)</td></tr>
+<tr class="memitem:a1bfb8711f49e591eb168ccaa3df6fb86" id="r_a1bfb8711f49e591eb168ccaa3df6fb86"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86">operations_on_datastructures::shift_right</a> (const std::vector&lt; int32_t &gt; &amp;array, size_t shift)</td></tr>
 <tr class="memdesc:a1bfb8711f49e591eb168ccaa3df6fb86"><td class="mdescLeft">&#160;</td><td class="mdescRight">Shifts the given vector to the right by the shift amount and returns a new vector with the result. The original vector is not mutated.  <br /></td></tr>
 <tr class="separator:a1bfb8711f49e591eb168ccaa3df6fb86"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a167c24bd817469ae47358d12e034f2d5" id="r_a167c24bd817469ae47358d12e034f2d5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a> ()</td></tr>
@@ -165,6 +184,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Implementation for the <a href="https://www.javatpoint.com/program-to-right-rotate-the-elements-of-an-array" target="_blank">Array right Rotation</a> algorithm. </p>
 <p>Shifting an array to the right involves moving each element of the array so that it occupies a position of a certain shift value after its current one. This implementation uses a result vector and does not mutate the input. </p><dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d9/d14/array__left__rotation_8cpp.html" title="Implementation for the Array Left Rotation algorithm.">array_left_rotation.cpp</a> </dd></dl>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/polarvoid" target="_blank">Alvin</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/d57/array__right__rotation_8cpp_source.html">array_right_rotation.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -183,17 +204,14 @@ Functions</h2></td></tr>
 
 <p>main function </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d57/array__right__rotation_8cpp_source.html#l00172">172</a> of file <a class="el" href="../../d6/d57/array__right__rotation_8cpp_source.html">array_right_rotation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  172</span>           {</div>
 <div class="line"><span class="lineno">  173</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  174</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  175</span>}</div>
-<div class="ttc" id="aarray__right__rotation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of shift_right() function.</div><div class="ttdef"><b>Definition</b> array_right_rotation.cpp:160</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="490" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aarray__right__rotation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of shift_right() function.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d57/array__right__rotation_8cpp_source.html#l00160">array_right_rotation.cpp:160</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -221,6 +239,8 @@ Here is the call graph for this function:</div>
 
 <p>Function to test the correctness of shift_right() function. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d57/array__right__rotation_8cpp_source.html#l00160">160</a> of file <a class="el" href="../../d6/d57/array__right__rotation_8cpp_source.html">array_right_rotation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  160</span>                   {</div>
 <div class="line"><span class="lineno">  161</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a>();</div>
 <div class="line"><span class="lineno">  162</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a>();</div>
@@ -228,17 +248,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  164</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a>();</div>
 <div class="line"><span class="lineno">  165</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a>();</div>
 <div class="line"><span class="lineno">  166</span>}</div>
-<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:75</div></div>
-<div class="ttc" id="anamespacetests_html_a2b9769e44683dcb67fe1083ad91e134d"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a></div><div class="ttdeci">void test4()</div><div class="ttdoc">A Test to check a very large input.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:120</div></div>
-<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check an invalid shift value.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:105</div></div>
-<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an empty vector.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:90</div></div>
-<div class="ttc" id="anamespacetests_html_af7b81d7a1534216af6a36a80135beb86"><div class="ttname"><a href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a></div><div class="ttdeci">void test5()</div><div class="ttdoc">A Test to check a shift of zero.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:143</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="392" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00075">array_left_rotation.cpp:75</a></div></div>
+<div class="ttc" id="anamespacetests_html_a2b9769e44683dcb67fe1083ad91e134d"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a></div><div class="ttdeci">void test4()</div><div class="ttdoc">A Test to check a very large input.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00120">array_left_rotation.cpp:120</a></div></div>
+<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check an invalid shift value.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00105">array_left_rotation.cpp:105</a></div></div>
+<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an empty vector.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00090">array_left_rotation.cpp:90</a></div></div>
+<div class="ttc" id="anamespacetests_html_af7b81d7a1534216af6a36a80135beb86"><div class="ttname"><a href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a></div><div class="ttdeci">void test5()</div><div class="ttdoc">A Test to check a shift of zero.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00143">array_left_rotation.cpp:143</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 35f9d6430..000000000
--- a/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Function to test the correctness of shift_right() function." alt="" coords="5,104,49,130"/>
-<area shape="rect" id="Node000002" href="$d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" title="A Test to check an simple case." alt="" coords="97,5,184,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="36,102,61,72,95,40,98,38,101,42,98,44,65,76,40,105"/>
-<area shape="rect" id="Node000003" href="$d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" title="A Test to check an empty vector." alt="" coords="97,55,184,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="48,105,94,85,96,90,50,110"/>
-<area shape="rect" id="Node000004" href="$d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" title="A Test to check an invalid shift value." alt="" coords="97,104,184,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,114,81,114,81,120,49,120"/>
-<area shape="rect" id="Node000005" href="$d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" title="A Test to check a very large input." alt="" coords="97,153,184,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="50,124,96,144,94,149,48,129"/>
-<area shape="rect" id="Node000007" href="$d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" title="A Test to check a shift of zero." alt="" coords="97,203,184,228"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="40,128,65,158,98,189,101,191,98,196,95,194,61,162,36,132"/>
-<area shape="rect" id="Node000006" 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="232,153,386,179"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="184,164,216,164,216,169,184,169"/>
-</map>
diff --git a/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 29b3dd5db..000000000
--- a/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-619a37a3d7e91b1a15d9706cfa37e874
\ No newline at end of file
diff --git a/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 0688a3cfa..000000000
--- a/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,155 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="294pt" height="175pt"
- viewBox="0.00 0.00 293.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the correctness of shift_right() function.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-93.25 0,-93.25 0,-74 32.5,-74 32.5,-93.25"/>
-<text text-anchor="middle" x="16.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="134,-167.25 68.5,-167.25 68.5,-148 134,-148 134,-167.25"/>
-<text text-anchor="middle" x="101.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.78,-93.61C34.13,-105.55 50.98,-125.66 68.5,-139.62 69.17,-140.16 69.86,-140.68 70.56,-141.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.61,-144.11 78.89,-146.67 72.45,-138.26 68.61,-144.11"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="134,-130.25 68.5,-130.25 68.5,-111 134,-111 134,-130.25"/>
-<text text-anchor="middle" x="101.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-90.58C42.57,-94.91 55.42,-100.64 67.3,-105.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.87,-109.13 76.43,-110.01 68.72,-102.74 65.87,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="134,-93.25 68.5,-93.25 68.5,-74 134,-74 134,-93.25"/>
-<text text-anchor="middle" x="101.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-83.62C39.78,-83.62 48.31,-83.62 56.93,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.69,-87.13 66.69,-83.63 56.69,-80.13 56.69,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="134,-56.25 68.5,-56.25 68.5,-37 134,-37 134,-56.25"/>
-<text text-anchor="middle" x="101.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-76.67C42.57,-72.34 55.42,-66.61 67.3,-61.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.72,-64.51 76.43,-57.24 65.87,-58.12 68.72,-64.51"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="134,-19.25 68.5,-19.25 68.5,0 134,0 134,-19.25"/>
-<text text-anchor="middle" x="101.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.78,-73.64C34.13,-61.7 50.98,-41.59 68.5,-27.62 69.17,-27.09 69.86,-26.57 70.56,-26.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.45,-28.99 78.89,-20.58 68.61,-23.14 72.45,-28.99"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.75,-56.25 170,-56.25 170,-37 285.75,-37 285.75,-56.25"/>
-<text text-anchor="middle" x="227.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-46.62C141.78,-46.62 149.98,-46.62 158.32,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.23,-50.13 168.23,-46.63 158.23,-43.13 158.23,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index d65a605a3..000000000
--- a/d6/d57/array__right__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,129 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="294pt" height="175pt"
- viewBox="0.00 0.00 293.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the correctness of shift_right() function.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-93.25 0,-93.25 0,-74 32.5,-74 32.5,-93.25"/>
-<text text-anchor="middle" x="16.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="134,-167.25 68.5,-167.25 68.5,-148 134,-148 134,-167.25"/>
-<text text-anchor="middle" x="101.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.78,-93.61C34.13,-105.55 50.98,-125.66 68.5,-139.62 69.17,-140.16 69.86,-140.68 70.56,-141.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.61,-144.11 78.89,-146.67 72.45,-138.26 68.61,-144.11"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="134,-130.25 68.5,-130.25 68.5,-111 134,-111 134,-130.25"/>
-<text text-anchor="middle" x="101.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-90.58C42.57,-94.91 55.42,-100.64 67.3,-105.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.87,-109.13 76.43,-110.01 68.72,-102.74 65.87,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="134,-93.25 68.5,-93.25 68.5,-74 134,-74 134,-93.25"/>
-<text text-anchor="middle" x="101.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-83.62C39.78,-83.62 48.31,-83.62 56.93,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.69,-87.13 66.69,-83.63 56.69,-80.13 56.69,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="134,-56.25 68.5,-56.25 68.5,-37 134,-37 134,-56.25"/>
-<text text-anchor="middle" x="101.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-76.67C42.57,-72.34 55.42,-66.61 67.3,-61.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.72,-64.51 76.43,-57.24 65.87,-58.12 68.72,-64.51"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="134,-19.25 68.5,-19.25 68.5,0 134,0 134,-19.25"/>
-<text text-anchor="middle" x="101.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.78,-73.64C34.13,-61.7 50.98,-41.59 68.5,-27.62 69.17,-27.09 69.86,-26.57 70.56,-26.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.45,-28.99 78.89,-20.58 68.61,-23.14 72.45,-28.99"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.75,-56.25 170,-56.25 170,-37 285.75,-37 285.75,-56.25"/>
-<text text-anchor="middle" x="227.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-46.62C141.78,-46.62 149.98,-46.62 158.32,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.23,-50.13 168.23,-46.63 158.23,-43.13 158.23,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 40e3d11a0..000000000
--- a/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="main function" alt="" coords="5,104,55,130"/>
-<area shape="rect" id="Node000002" href="$d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function to test the correctness of shift_right() function." alt="" coords="103,104,146,130"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,114,87,114,87,120,55,120"/>
-<area shape="rect" id="Node000003" href="$d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" title="A Test to check an simple case." alt="" coords="194,5,281,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="134,102,159,72,192,40,195,38,198,42,196,44,163,76,138,105"/>
-<area shape="rect" id="Node000004" href="$d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" title="A Test to check an empty vector." alt="" coords="194,55,281,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="145,105,191,85,193,90,148,110"/>
-<area shape="rect" id="Node000005" href="$d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" title="A Test to check an invalid shift value." alt="" coords="194,104,281,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="146,114,179,114,179,120,146,120"/>
-<area shape="rect" id="Node000006" href="$d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" title="A Test to check a very large input." alt="" coords="194,153,281,179"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="148,124,193,144,191,149,145,129"/>
-<area shape="rect" id="Node000008" href="$d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" title="A Test to check a shift of zero." alt="" coords="194,203,281,228"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="138,128,163,158,196,189,198,191,195,196,192,194,159,162,134,132"/>
-<area shape="rect" id="Node000007" 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="329,153,484,179"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="282,164,314,164,314,169,282,169"/>
-</map>
diff --git a/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index ce3c66be4..000000000
--- a/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d714541d183582b84a75bef8aa137ad3
\ No newline at end of file
diff --git a/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 5daa89b76..000000000
--- a/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,173 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="367pt" height="175pt"
- viewBox="0.00 0.00 366.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-93.25 0,-93.25 0,-74 37,-74 37,-93.25"/>
-<text text-anchor="middle" x="18.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the correctness of shift_right() function.">
-<polygon fill="white" stroke="#666666" points="105.5,-93.25 73,-93.25 73,-74 105.5,-74 105.5,-93.25"/>
-<text text-anchor="middle" x="89.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-83.62C44.58,-83.62 53.31,-83.62 61.45,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-87.13 71.2,-83.63 61.2,-80.13 61.2,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="207,-167.25 141.5,-167.25 141.5,-148 207,-148 207,-167.25"/>
-<text text-anchor="middle" x="174.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.78,-93.61C107.13,-105.55 123.98,-125.66 141.5,-139.62 142.17,-140.16 142.86,-140.68 143.56,-141.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.61,-144.11 151.89,-146.67 145.45,-138.26 141.61,-144.11"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="207,-130.25 141.5,-130.25 141.5,-111 207,-111 207,-130.25"/>
-<text text-anchor="middle" x="174.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-90.58C115.57,-94.91 128.42,-100.64 140.3,-105.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.87,-109.13 149.43,-110.01 141.72,-102.74 138.87,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="207,-93.25 141.5,-93.25 141.5,-74 207,-74 207,-93.25"/>
-<text text-anchor="middle" x="174.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-83.62C112.78,-83.62 121.31,-83.62 129.93,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.69,-87.13 139.69,-83.63 129.69,-80.13 129.69,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="207,-56.25 141.5,-56.25 141.5,-37 207,-37 207,-56.25"/>
-<text text-anchor="middle" x="174.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-76.67C115.57,-72.34 128.42,-66.61 140.3,-61.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.72,-64.51 149.43,-57.24 138.87,-58.12 141.72,-64.51"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="207,-19.25 141.5,-19.25 141.5,0 207,0 207,-19.25"/>
-<text text-anchor="middle" x="174.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.78,-73.64C107.13,-61.7 123.98,-41.59 141.5,-27.62 142.17,-27.09 142.86,-26.57 143.56,-26.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.45,-28.99 151.89,-20.58 141.61,-23.14 145.45,-28.99"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.75,-56.25 243,-56.25 243,-37 358.75,-37 358.75,-56.25"/>
-<text text-anchor="middle" x="300.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-46.62C214.78,-46.62 222.98,-46.62 231.32,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.23,-50.13 241.23,-46.63 231.23,-43.13 231.23,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 031e9d8d5..000000000
--- a/d6/d57/array__right__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="367pt" height="175pt"
- viewBox="0.00 0.00 366.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-93.25 0,-93.25 0,-74 37,-74 37,-93.25"/>
-<text text-anchor="middle" x="18.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the correctness of shift_right() function.">
-<polygon fill="white" stroke="#666666" points="105.5,-93.25 73,-93.25 73,-74 105.5,-74 105.5,-93.25"/>
-<text text-anchor="middle" x="89.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-83.62C44.58,-83.62 53.31,-83.62 61.45,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-87.13 71.2,-83.63 61.2,-80.13 61.2,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="207,-167.25 141.5,-167.25 141.5,-148 207,-148 207,-167.25"/>
-<text text-anchor="middle" x="174.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.78,-93.61C107.13,-105.55 123.98,-125.66 141.5,-139.62 142.17,-140.16 142.86,-140.68 143.56,-141.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.61,-144.11 151.89,-146.67 145.45,-138.26 141.61,-144.11"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="207,-130.25 141.5,-130.25 141.5,-111 207,-111 207,-130.25"/>
-<text text-anchor="middle" x="174.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-90.58C115.57,-94.91 128.42,-100.64 140.3,-105.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.87,-109.13 149.43,-110.01 141.72,-102.74 138.87,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="207,-93.25 141.5,-93.25 141.5,-74 207,-74 207,-93.25"/>
-<text text-anchor="middle" x="174.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-83.62C112.78,-83.62 121.31,-83.62 129.93,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.69,-87.13 139.69,-83.63 129.69,-80.13 129.69,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="207,-56.25 141.5,-56.25 141.5,-37 207,-37 207,-56.25"/>
-<text text-anchor="middle" x="174.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-76.67C115.57,-72.34 128.42,-66.61 140.3,-61.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.72,-64.51 149.43,-57.24 138.87,-58.12 141.72,-64.51"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="207,-19.25 141.5,-19.25 141.5,0 207,0 207,-19.25"/>
-<text text-anchor="middle" x="174.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.78,-73.64C107.13,-61.7 123.98,-41.59 141.5,-27.62 142.17,-27.09 142.86,-26.57 143.56,-26.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.45,-28.99 151.89,-20.58 141.61,-23.14 145.45,-28.99"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.75,-56.25 243,-56.25 243,-37 358.75,-37 358.75,-56.25"/>
-<text text-anchor="middle" x="300.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-46.62C214.78,-46.62 222.98,-46.62 231.32,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.23,-50.13 241.23,-46.63 231.23,-43.13 231.23,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d57/array__right__rotation_8cpp_source.html b/d6/d57/array__right__rotation_8cpp_source.html
new file mode 100644
index 000000000..caff944fe
--- /dev/null
+++ b/d6/d57/array__right__rotation_8cpp_source.html
@@ -0,0 +1,265 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: operations_on_datastructures/array_right_rotation.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/d57/array__right__rotation_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">array_right_rotation.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/d57/array__right__rotation_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a> {</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">print</a>(<span class="keyword">const</span> std::vector&lt;int32_t&gt; &amp;array) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordflow">for</span> (int32_t i : array) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;  </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    }</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;  </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>}</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="foldopen" id="foldopen00047" data-start="{" data-end="}">
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="../../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86">   47</a></span>std::vector&lt;int32_t&gt; <a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86">shift_right</a>(<span class="keyword">const</span> std::vector&lt;int32_t&gt; &amp;array,</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>                                 <span class="keywordtype">size_t</span> shift) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">if</span> (array.size() &lt;= shift) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordflow">return</span> {};  </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    std::vector&lt;int32_t&gt; res(array.size());  </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = shift; i &lt; array.size(); i++) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        res[i] = array[i - shift];  </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; shift; i++) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        res[i] =</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>            array[array.size() - shift + i];  </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    }</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">return</span> res;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>}</div>
+</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>}  <span class="comment">// namespace operations_on_datastructures</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/df4/namespacetests.html">tests</a> {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="keyword">using </span><a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures::print</a>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="keyword">using </span><a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86">operations_on_datastructures::shift_right</a>;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">test1</a>() {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 1\n&quot;</span>;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {1, 2, 3, 4, 5}\n&quot;</span>;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {4, 5, 1, 2, 3}\n&quot;</span>;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    std::vector&lt;int32_t&gt; arr = {1, 2, 3, 4, 5};</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    std::vector&lt;int32_t&gt; res = shift_right(arr, 2);</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    std::vector&lt;int32_t&gt; expected = {4, 5, 1, 2, 3};</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    assert(res == expected);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    print(res);  </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>}</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">test2</a>() {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 2\n&quot;</span>;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {}\n&quot;</span>;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {}\n&quot;</span>;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    std::vector&lt;int32_t&gt; arr = {};</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    std::vector&lt;int32_t&gt; res = shift_right(arr, 2);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    std::vector&lt;int32_t&gt; expected = {};</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    assert(res == expected);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    print(res);  </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>}</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">test3</a>() {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 3\n&quot;</span>;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {1, 2, 3, 4, 5}\n&quot;</span>;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {}\n&quot;</span>;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    std::vector&lt;int32_t&gt; arr = {1, 2, 3, 4, 5};</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::vector&lt;int32_t&gt; res = shift_right(arr, 7);  </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    std::vector&lt;int32_t&gt; expected = {};</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    assert(res == expected);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    print(res);  </div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>}</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">test4</a>() {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 4\n&quot;</span>;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {2, 4, ..., 420}\n&quot;</span>;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {420, 2, 4, ..., 418}\n&quot;</span>;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    std::vector&lt;int32_t&gt; arr;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= 210; i++) {</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        arr.push_back(i * 2);</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    }</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    print(arr);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    std::vector&lt;int32_t&gt; res = shift_right(arr, 1);</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    std::vector&lt;int32_t&gt; expected;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    expected.push_back(420);</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 209; i++) {</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>        expected.push_back(arr[i]);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    }</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    assert(res == expected);</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    print(res);  </div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>}</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">test5</a>() {</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 5\n&quot;</span>;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {1, 2, 3, 4, 5}\n&quot;</span>;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {1, 2, 3, 4, 5}\n&quot;</span>;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    std::vector&lt;int32_t&gt; arr = {1, 2, 3, 4, 5};</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    std::vector&lt;int32_t&gt; res = shift_right(arr, 0);</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    assert(res == arr);</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    print(res);  </div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>}</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>}  <span class="comment">// namespace tests</span></div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span> </div>
+<div class="foldopen" id="foldopen00160" data-start="{" data-end="}">
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"><a class="line" href="../../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  160</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a>();</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a>();</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a>();</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a>();</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a>();</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>}</div>
+</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span> </div>
+<div class="foldopen" id="foldopen00172" data-start="{" data-end="}">
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"><a class="line" href="../../d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  172</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    <a class="code hl_function" href="../../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>}</div>
+</div>
+<div class="ttc" id="aarray__right__rotation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of shift_right() function.</div><div class="ttdef"><b>Definition</b> <a href="#l00160">array_right_rotation.cpp:160</a></div></div>
+<div class="ttc" id="aarray__right__rotation_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition</b> <a href="#l00172">array_right_rotation.cpp:172</a></div></div>
+<div class="ttc" id="anamespaceoperations__on__datastructures_html"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></div><div class="ttdoc">for std::vector</div></div>
+<div class="ttc" id="anamespaceoperations__on__datastructures_html_a1bfb8711f49e591eb168ccaa3df6fb86"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86">operations_on_datastructures::shift_right</a></div><div class="ttdeci">std::vector&lt; int32_t &gt; shift_right(const std::vector&lt; int32_t &gt; &amp;array, size_t shift)</div><div class="ttdoc">Shifts the given vector to the right by the shift amount and returns a new vector with the result....</div><div class="ttdef"><b>Definition</b> <a href="#l00047">array_right_rotation.cpp:47</a></div></div>
+<div class="ttc" id="anamespaceoperations__on__datastructures_html_a6109193567a5b7e36a27f2b4865fce20"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures::print</a></div><div class="ttdeci">void print(const std::vector&lt; int32_t &gt; &amp;array)</div><div class="ttdoc">Prints the values of a vector sequentially, ending with a newline character.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00029">array_left_rotation.cpp:29</a></div></div>
+<div class="ttc" id="anamespacetests_html"><div class="ttname"><a href="../../d9/df4/namespacetests.html">tests</a></div><div class="ttdoc">Testcases to check Union of Two Arrays.</div></div>
+<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00075">array_left_rotation.cpp:75</a></div></div>
+<div class="ttc" id="anamespacetests_html_a2b9769e44683dcb67fe1083ad91e134d"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a></div><div class="ttdeci">void test4()</div><div class="ttdoc">A Test to check a very large input.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00120">array_left_rotation.cpp:120</a></div></div>
+<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check an invalid shift value.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00105">array_left_rotation.cpp:105</a></div></div>
+<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an empty vector.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00090">array_left_rotation.cpp:90</a></div></div>
+<div class="ttc" id="anamespacetests_html_af7b81d7a1534216af6a36a80135beb86"><div class="ttname"><a href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a></div><div class="ttdeci">void test5()</div><div class="ttdoc">A Test to check a shift of zero.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00143">array_left_rotation.cpp:143</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><a class="el" href="../../d6/d57/array__right__rotation_8cpp.html">array_right_rotation.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/d60/group__ode.html b/d6/d60/group__ode.html
index efdb49550..9f77a9604 100644
--- a/d6/d60/group__ode.html
+++ b/d6/d60/group__ode.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Ordinary Differential Equations</title>
+<title>TheAlgorithms/C++: Ordinary Differential Equations</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -112,22 +129,22 @@ $(function(){initNavTree('d6/d60/group__ode.html','../../'); initResizable(true)
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:ga195d23bbdfcb80e83c9cda45c9ad5723" id="r_ga195d23bbdfcb80e83c9cda45c9ad5723"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ga195d23bbdfcb80e83c9cda45c9ad5723">forward_euler_step</a> (const double dx, const double x, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *y, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *dy)</td></tr>
+<tr class="memitem:ga195d23bbdfcb80e83c9cda45c9ad5723" id="r_ga195d23bbdfcb80e83c9cda45c9ad5723"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ga195d23bbdfcb80e83c9cda45c9ad5723">forward_euler_step</a> (const double dx, const double x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</td></tr>
 <tr class="memdesc:ga195d23bbdfcb80e83c9cda45c9ad5723"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute next step approximation using the forward-Euler method.  <br /></td></tr>
 <tr class="separator:ga195d23bbdfcb80e83c9cda45c9ad5723"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:gae0509f8843e2bc42de2abbd00a14b7b9" id="r_gae0509f8843e2bc42de2abbd00a14b7b9"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#gae0509f8843e2bc42de2abbd00a14b7b9">forward_euler</a> (double dx, double x0, double x_max, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *y, bool save_to_file=false)</td></tr>
+<tr class="memitem:gae0509f8843e2bc42de2abbd00a14b7b9" id="r_gae0509f8843e2bc42de2abbd00a14b7b9"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#gae0509f8843e2bc42de2abbd00a14b7b9">forward_euler</a> (double dx, double x0, double x_max, std::valarray&lt; double &gt; *y, bool save_to_file=false)</td></tr>
 <tr class="memdesc:gae0509f8843e2bc42de2abbd00a14b7b9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute approximation using the forward-Euler method in the given limits.  <br /></td></tr>
 <tr class="separator:gae0509f8843e2bc42de2abbd00a14b7b9"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ga8c319db420c3d97a83e9dcca803b6812" id="r_ga8c319db420c3d97a83e9dcca803b6812"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ga8c319db420c3d97a83e9dcca803b6812">midpoint_euler_step</a> (const double dx, const double &amp;x, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *y, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *dy)</td></tr>
+<tr class="memitem:ga8c319db420c3d97a83e9dcca803b6812" id="r_ga8c319db420c3d97a83e9dcca803b6812"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ga8c319db420c3d97a83e9dcca803b6812">midpoint_euler_step</a> (const double dx, const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</td></tr>
 <tr class="memdesc:ga8c319db420c3d97a83e9dcca803b6812"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute next step approximation using the midpoint-Euler method.  <br /></td></tr>
 <tr class="separator:ga8c319db420c3d97a83e9dcca803b6812"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ga36ff0710861ca39d957046c0b09b2985" id="r_ga36ff0710861ca39d957046c0b09b2985"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ga36ff0710861ca39d957046c0b09b2985">midpoint_euler</a> (double dx, double x0, double x_max, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *y, bool save_to_file=false)</td></tr>
+<tr class="memitem:ga36ff0710861ca39d957046c0b09b2985" id="r_ga36ff0710861ca39d957046c0b09b2985"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ga36ff0710861ca39d957046c0b09b2985">midpoint_euler</a> (double dx, double x0, double x_max, std::valarray&lt; double &gt; *y, bool save_to_file=false)</td></tr>
 <tr class="memdesc:ga36ff0710861ca39d957046c0b09b2985"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute approximation using the midpoint-Euler method in the given limits.  <br /></td></tr>
 <tr class="separator:ga36ff0710861ca39d957046c0b09b2985"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ga827bf009831ddc477c5fa8891d5cb35f" id="r_ga827bf009831ddc477c5fa8891d5cb35f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ga827bf009831ddc477c5fa8891d5cb35f">semi_implicit_euler_step</a> (const double dx, const double &amp;x, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *y, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *dy)</td></tr>
+<tr class="memitem:ga827bf009831ddc477c5fa8891d5cb35f" id="r_ga827bf009831ddc477c5fa8891d5cb35f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ga827bf009831ddc477c5fa8891d5cb35f">semi_implicit_euler_step</a> (const double dx, const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</td></tr>
 <tr class="memdesc:ga827bf009831ddc477c5fa8891d5cb35f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute next step approximation using the semi-implicit-Euler method.  <br /></td></tr>
 <tr class="separator:ga827bf009831ddc477c5fa8891d5cb35f"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ga3874d294ab00fe9ce8731c5b7991a089" id="r_ga3874d294ab00fe9ce8731c5b7991a089"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ga3874d294ab00fe9ce8731c5b7991a089">semi_implicit_euler</a> (double dx, double x0, double x_max, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *y, bool save_to_file=false)</td></tr>
+<tr class="memitem:ga3874d294ab00fe9ce8731c5b7991a089" id="r_ga3874d294ab00fe9ce8731c5b7991a089"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ga3874d294ab00fe9ce8731c5b7991a089">semi_implicit_euler</a> (double dx, double x0, double x_max, std::valarray&lt; double &gt; *y, bool save_to_file=false)</td></tr>
 <tr class="memdesc:ga3874d294ab00fe9ce8731c5b7991a089"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute approximation using the semi-implicit-Euler method in the given limits.  <br /></td></tr>
 <tr class="separator:ga3874d294ab00fe9ce8731c5b7991a089"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
@@ -158,7 +175,7 @@ Functions</h2></td></tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
+          <td class="paramtype">std::valarray&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -180,25 +197,27 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>time taken for computation in seconds </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dd3/ode__forward__euler_8cpp_source.html#l00102">102</a> of file <a class="el" href="../../db/dd3/ode__forward__euler_8cpp_source.html">ode_forward_euler.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  103</span>                                                                        {</div>
-<div class="line"><span class="lineno">  104</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> dy = *y;</div>
+<div class="line"><span class="lineno">  104</span>    std::valarray&lt;double&gt; dy = *y;</div>
 <div class="line"><span class="lineno">  105</span> </div>
-<div class="line"><span class="lineno">  106</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a> fp;</div>
+<div class="line"><span class="lineno">  106</span>    std::ofstream fp;</div>
 <div class="line"><span class="lineno">  107</span>    <span class="keywordflow">if</span> (save_to_file) {</div>
-<div class="line"><span class="lineno">  108</span>        fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html">open</a>(<span class="stringliteral">&quot;forward_euler.csv&quot;</span>, std::ofstream::out);</div>
-<div class="line"><span class="lineno">  109</span>        <span class="keywordflow">if</span> (!fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">is_open</a>()) {</div>
-<div class="line"><span class="lineno">  110</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/perror.html">std::perror</a>(<span class="stringliteral">&quot;Error! &quot;</span>);</div>
+<div class="line"><span class="lineno">  108</span>        fp.open(<span class="stringliteral">&quot;forward_euler.csv&quot;</span>, std::ofstream::out);</div>
+<div class="line"><span class="lineno">  109</span>        <span class="keywordflow">if</span> (!fp.is_open()) {</div>
+<div class="line"><span class="lineno">  110</span>            std::perror(<span class="stringliteral">&quot;Error! &quot;</span>);</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> </div>
-<div class="line"><span class="lineno">  114</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> L = y-&gt;size();</div>
+<div class="line"><span class="lineno">  114</span>    std::size_t L = y-&gt;size();</div>
 <div class="line"><span class="lineno">  115</span> </div>
 <div class="line"><span class="lineno">  116</span>    <span class="comment">/* start integration */</span></div>
-<div class="line"><span class="lineno">  117</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> t1 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  117</span>    std::clock_t t1 = std::clock();</div>
 <div class="line"><span class="lineno">  118</span>    <span class="keywordtype">double</span> x = x0;</div>
 <div class="line"><span class="lineno">  119</span> </div>
 <div class="line"><span class="lineno">  120</span>    <span class="keywordflow">do</span> {  <span class="comment">// iterate for each step of independent variable</span></div>
-<div class="line"><span class="lineno">  121</span>        <span class="keywordflow">if</span> (save_to_file &amp;&amp; fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">is_open</a>()) {</div>
+<div class="line"><span class="lineno">  121</span>        <span class="keywordflow">if</span> (save_to_file &amp;&amp; fp.is_open()) {</div>
 <div class="line"><span class="lineno">  122</span>            <span class="comment">// write to file</span></div>
 <div class="line"><span class="lineno">  123</span>            fp &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
 <div class="line"><span class="lineno">  124</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; L - 1; i++) {</div>
@@ -211,30 +230,16 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  131</span>        x += dx;                            <span class="comment">// update step</span></div>
 <div class="line"><span class="lineno">  132</span>    } <span class="keywordflow">while</span> (x &lt;= x_max);  <span class="comment">// till upper limit of independent variable</span></div>
 <div class="line"><span class="lineno">  133</span>    <span class="comment">/* end of integration */</span></div>
-<div class="line"><span class="lineno">  134</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> t2 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  134</span>    std::clock_t t2 = std::clock();</div>
 <div class="line"><span class="lineno">  135</span> </div>
-<div class="line"><span class="lineno">  136</span>    <span class="keywordflow">if</span> (fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">is_open</a>()) {</div>
-<div class="line"><span class="lineno">  137</span>        fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html">close</a>();</div>
+<div class="line"><span class="lineno">  136</span>    <span class="keywordflow">if</span> (fp.is_open()) {</div>
+<div class="line"><span class="lineno">  137</span>        fp.close();</div>
 <div class="line"><span class="lineno">  138</span>    }</div>
 <div class="line"><span class="lineno">  139</span> </div>
 <div class="line"><span class="lineno">  140</span>    <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(t2 - t1) / CLOCKS_PER_SEC;</div>
 <div class="line"><span class="lineno">  141</span>}</div>
-<div class="ttc" id="abasic_ofstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a></div></div>
-<div class="ttc" id="aclock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a></div><div class="ttdeci">T clock(T... args)</div></div>
-<div class="ttc" id="aclock_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a></div></div>
-<div class="ttc" id="aclose_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html">std::ofstream::close</a></div><div class="ttdeci">T close(T... args)</div></div>
-<div class="ttc" id="agroup__ode_html_ga195d23bbdfcb80e83c9cda45c9ad5723"><div class="ttname"><a href="#ga195d23bbdfcb80e83c9cda45c9ad5723">forward_euler_step</a></div><div class="ttdeci">void forward_euler_step(const double dx, const double x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Compute next step approximation using the forward-Euler method.</div><div class="ttdef"><b>Definition</b> ode_forward_euler.cpp:86</div></div>
-<div class="ttc" id="ais_open_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">std::ofstream::is_open</a></div><div class="ttdeci">T is_open(T... args)</div></div>
-<div class="ttc" id="aopen_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html">std::ofstream::open</a></div><div class="ttdeci">T open(T... args)</div></div>
-<div class="ttc" id="aperror_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/c/perror.html">std::perror</a></div><div class="ttdeci">T perror(T... args)</div></div>
-<div class="ttc" id="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></div></div>
-<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.svg" width="426" height="283"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agroup__ode_html_ga195d23bbdfcb80e83c9cda45c9ad5723"><div class="ttname"><a href="#ga195d23bbdfcb80e83c9cda45c9ad5723">forward_euler_step</a></div><div class="ttdeci">void forward_euler_step(const double dx, const double x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Compute next step approximation using the forward-Euler method.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dd3/ode__forward__euler_8cpp_source.html#l00086">ode_forward_euler.cpp:86</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ga195d23bbdfcb80e83c9cda45c9ad5723" name="ga195d23bbdfcb80e83c9cda45c9ad5723"></a>
@@ -256,12 +261,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
+          <td class="paramtype">std::valarray&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>dy</em></span>&#160;)</td>
+          <td class="paramtype">std::valarray&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>dy</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -279,17 +284,14 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dd3/ode__forward__euler_8cpp_source.html#l00086">86</a> of file <a class="el" href="../../db/dd3/ode__forward__euler_8cpp_source.html">ode_forward_euler.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   87</span>                                                                         {</div>
 <div class="line"><span class="lineno">   88</span>    <a class="code hl_function" href="../../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a>(x, y, dy);</div>
 <div class="line"><span class="lineno">   89</span>    *y += *dy * dx;</div>
 <div class="line"><span class="lineno">   90</span>}</div>
-<div class="ttc" id="aode__forward__euler_8cpp_html_abaeae8f62a018d197f0187a1c80a90fe"><div class="ttname"><a href="../../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a></div><div class="ttdeci">void problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Problem statement for a system with first-order differential equations. Updates the system differenti...</div><div class="ttdef"><b>Definition</b> ode_forward_euler.cpp:54</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d60/group__ode_ga195d23bbdfcb80e83c9cda45c9ad5723_cgraph.svg" width="258" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aode__forward__euler_8cpp_html_abaeae8f62a018d197f0187a1c80a90fe"><div class="ttname"><a href="../../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a></div><div class="ttdeci">void problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Problem statement for a system with first-order differential equations. Updates the system differenti...</div><div class="ttdef"><b>Definition</b> <a href="../../db/dd3/ode__forward__euler_8cpp_source.html#l00054">ode_forward_euler.cpp:54</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ga36ff0710861ca39d957046c0b09b2985" name="ga36ff0710861ca39d957046c0b09b2985"></a>
@@ -316,7 +318,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
+          <td class="paramtype">std::valarray&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -338,24 +340,26 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>time taken for computation in seconds </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dd3/ode__midpoint__euler_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../d6/dd3/ode__midpoint__euler_8cpp_source.html">ode_midpoint_euler.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  108</span>                                                                         {</div>
-<div class="line"><span class="lineno">  109</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> dy = y[0];</div>
+<div class="line"><span class="lineno">  109</span>    std::valarray&lt;double&gt; dy = y[0];</div>
 <div class="line"><span class="lineno">  110</span> </div>
-<div class="line"><span class="lineno">  111</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a> fp;</div>
+<div class="line"><span class="lineno">  111</span>    std::ofstream fp;</div>
 <div class="line"><span class="lineno">  112</span>    <span class="keywordflow">if</span> (save_to_file) {</div>
-<div class="line"><span class="lineno">  113</span>        fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html">open</a>(<span class="stringliteral">&quot;midpoint_euler.csv&quot;</span>, std::ofstream::out);</div>
-<div class="line"><span class="lineno">  114</span>        <span class="keywordflow">if</span> (!fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">is_open</a>()) {</div>
-<div class="line"><span class="lineno">  115</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/perror.html">std::perror</a>(<span class="stringliteral">&quot;Error! &quot;</span>);</div>
+<div class="line"><span class="lineno">  113</span>        fp.open(<span class="stringliteral">&quot;midpoint_euler.csv&quot;</span>, std::ofstream::out);</div>
+<div class="line"><span class="lineno">  114</span>        <span class="keywordflow">if</span> (!fp.is_open()) {</div>
+<div class="line"><span class="lineno">  115</span>            std::perror(<span class="stringliteral">&quot;Error! &quot;</span>);</div>
 <div class="line"><span class="lineno">  116</span>        }</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>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> L = y-&gt;size();</div>
+<div class="line"><span class="lineno">  119</span>    std::size_t L = y-&gt;size();</div>
 <div class="line"><span class="lineno">  120</span> </div>
 <div class="line"><span class="lineno">  121</span>    <span class="comment">/* start integration */</span></div>
-<div class="line"><span class="lineno">  122</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> t1 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  122</span>    std::clock_t t1 = std::clock();</div>
 <div class="line"><span class="lineno">  123</span>    <span class="keywordtype">double</span> x = x0;</div>
 <div class="line"><span class="lineno">  124</span>    <span class="keywordflow">do</span> {  <span class="comment">// iterate for each step of independent variable</span></div>
-<div class="line"><span class="lineno">  125</span>        <span class="keywordflow">if</span> (save_to_file &amp;&amp; fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">is_open</a>()) {</div>
+<div class="line"><span class="lineno">  125</span>        <span class="keywordflow">if</span> (save_to_file &amp;&amp; fp.is_open()) {</div>
 <div class="line"><span class="lineno">  126</span>            <span class="comment">// write to file</span></div>
 <div class="line"><span class="lineno">  127</span>            fp &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
 <div class="line"><span class="lineno">  128</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; L - 1; i++) {</div>
@@ -368,20 +372,15 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  135</span>        x += dx;                             <span class="comment">// update step</span></div>
 <div class="line"><span class="lineno">  136</span>    } <span class="keywordflow">while</span> (x &lt;= x_max);  <span class="comment">// till upper limit of independent variable</span></div>
 <div class="line"><span class="lineno">  137</span>    <span class="comment">/* end of integration */</span></div>
-<div class="line"><span class="lineno">  138</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> t2 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  138</span>    std::clock_t t2 = std::clock();</div>
 <div class="line"><span class="lineno">  139</span> </div>
-<div class="line"><span class="lineno">  140</span>    <span class="keywordflow">if</span> (fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">is_open</a>())</div>
-<div class="line"><span class="lineno">  141</span>        fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html">close</a>();</div>
+<div class="line"><span class="lineno">  140</span>    <span class="keywordflow">if</span> (fp.is_open())</div>
+<div class="line"><span class="lineno">  141</span>        fp.close();</div>
 <div class="line"><span class="lineno">  142</span> </div>
 <div class="line"><span class="lineno">  143</span>    <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(t2 - t1) / CLOCKS_PER_SEC;</div>
 <div class="line"><span class="lineno">  144</span>}</div>
-<div class="ttc" id="agroup__ode_html_ga8c319db420c3d97a83e9dcca803b6812"><div class="ttname"><a href="#ga8c319db420c3d97a83e9dcca803b6812">midpoint_euler_step</a></div><div class="ttdeci">void midpoint_euler_step(const double dx, const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Compute next step approximation using the midpoint-Euler method.</div><div class="ttdef"><b>Definition</b> ode_midpoint_euler.cpp:85</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.svg" width="431" height="283"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agroup__ode_html_ga8c319db420c3d97a83e9dcca803b6812"><div class="ttname"><a href="#ga8c319db420c3d97a83e9dcca803b6812">midpoint_euler_step</a></div><div class="ttdeci">void midpoint_euler_step(const double dx, const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Compute next step approximation using the midpoint-Euler method.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/dd3/ode__midpoint__euler_8cpp_source.html#l00085">ode_midpoint_euler.cpp:85</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ga8c319db420c3d97a83e9dcca803b6812" name="ga8c319db420c3d97a83e9dcca803b6812"></a>
@@ -403,12 +402,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
+          <td class="paramtype">std::valarray&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>dy</em></span>&#160;)</td>
+          <td class="paramtype">std::valarray&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>dy</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -427,23 +426,20 @@ y_n + \frac{1}{2}dx\,f\left(x_n,y_n\right)\right)\]
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dd3/ode__midpoint__euler_8cpp_source.html#l00085">85</a> of file <a class="el" href="../../d6/dd3/ode__midpoint__euler_8cpp_source.html">ode_midpoint_euler.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   86</span>                                                                          {</div>
 <div class="line"><span class="lineno">   87</span>    <a class="code hl_function" href="../../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a>(x, y, dy);</div>
 <div class="line"><span class="lineno">   88</span>    <span class="keywordtype">double</span> tmp_x = x + 0.5 * dx;</div>
 <div class="line"><span class="lineno">   89</span> </div>
-<div class="line"><span class="lineno">   90</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> tmp_y = y[0] + dy[0] * (0.5 * dx);</div>
+<div class="line"><span class="lineno">   90</span>    std::valarray&lt;double&gt; tmp_y = y[0] + dy[0] * (0.5 * dx);</div>
 <div class="line"><span class="lineno">   91</span> </div>
 <div class="line"><span class="lineno">   92</span>    <a class="code hl_function" href="../../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a>(tmp_x, &amp;tmp_y, dy);</div>
 <div class="line"><span class="lineno">   93</span> </div>
 <div class="line"><span class="lineno">   94</span>    y[0] += dy[0] * dx;</div>
 <div class="line"><span class="lineno">   95</span>}</div>
-<div class="ttc" id="aode__midpoint__euler_8cpp_html_abaeae8f62a018d197f0187a1c80a90fe"><div class="ttname"><a href="../../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a></div><div class="ttdeci">void problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Problem statement for a system with first-order differential equations. Updates the system differenti...</div><div class="ttdef"><b>Definition</b> ode_midpoint_euler.cpp:53</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.svg" width="264" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aode__midpoint__euler_8cpp_html_abaeae8f62a018d197f0187a1c80a90fe"><div class="ttname"><a href="../../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a></div><div class="ttdeci">void problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Problem statement for a system with first-order differential equations. Updates the system differenti...</div><div class="ttdef"><b>Definition</b> <a href="../../d6/dd3/ode__midpoint__euler_8cpp_source.html#l00053">ode_midpoint_euler.cpp:53</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ga3874d294ab00fe9ce8731c5b7991a089" name="ga3874d294ab00fe9ce8731c5b7991a089"></a>
@@ -470,7 +466,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
+          <td class="paramtype">std::valarray&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -492,24 +488,26 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>time taken for computation in seconds </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d06/ode__semi__implicit__euler_8cpp_source.html#l00103">103</a> of file <a class="el" href="../../d3/d06/ode__semi__implicit__euler_8cpp_source.html">ode_semi_implicit_euler.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  105</span>                                                      {</div>
-<div class="line"><span class="lineno">  106</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> dy = y[0];</div>
+<div class="line"><span class="lineno">  106</span>    std::valarray&lt;double&gt; dy = y[0];</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_ofstream.html">std::ofstream</a> fp;</div>
+<div class="line"><span class="lineno">  108</span>    std::ofstream fp;</div>
 <div class="line"><span class="lineno">  109</span>    <span class="keywordflow">if</span> (save_to_file) {</div>
-<div class="line"><span class="lineno">  110</span>        fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html">open</a>(<span class="stringliteral">&quot;semi_implicit_euler.csv&quot;</span>, std::ofstream::out);</div>
-<div class="line"><span class="lineno">  111</span>        <span class="keywordflow">if</span> (!fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">is_open</a>()) {</div>
-<div class="line"><span class="lineno">  112</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/perror.html">std::perror</a>(<span class="stringliteral">&quot;Error! &quot;</span>);</div>
+<div class="line"><span class="lineno">  110</span>        fp.open(<span class="stringliteral">&quot;semi_implicit_euler.csv&quot;</span>, std::ofstream::out);</div>
+<div class="line"><span class="lineno">  111</span>        <span class="keywordflow">if</span> (!fp.is_open()) {</div>
+<div class="line"><span class="lineno">  112</span>            std::perror(<span class="stringliteral">&quot;Error! &quot;</span>);</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> </div>
-<div class="line"><span class="lineno">  116</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> L = y-&gt;size();</div>
+<div class="line"><span class="lineno">  116</span>    std::size_t L = y-&gt;size();</div>
 <div class="line"><span class="lineno">  117</span> </div>
 <div class="line"><span class="lineno">  118</span>    <span class="comment">/* start integration */</span></div>
-<div class="line"><span class="lineno">  119</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> t1 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  119</span>    std::clock_t t1 = std::clock();</div>
 <div class="line"><span class="lineno">  120</span>    <span class="keywordtype">double</span> x = x0;</div>
 <div class="line"><span class="lineno">  121</span>    <span class="keywordflow">do</span> {  <span class="comment">// iterate for each step of independent variable</span></div>
-<div class="line"><span class="lineno">  122</span>        <span class="keywordflow">if</span> (save_to_file &amp;&amp; fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">is_open</a>()) {</div>
+<div class="line"><span class="lineno">  122</span>        <span class="keywordflow">if</span> (save_to_file &amp;&amp; fp.is_open()) {</div>
 <div class="line"><span class="lineno">  123</span>            <span class="comment">// write to file</span></div>
 <div class="line"><span class="lineno">  124</span>            fp &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
 <div class="line"><span class="lineno">  125</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; L - 1; i++) {</div>
@@ -522,20 +520,15 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  132</span>        x += dx;                                  <span class="comment">// update step</span></div>
 <div class="line"><span class="lineno">  133</span>    } <span class="keywordflow">while</span> (x &lt;= x_max);  <span class="comment">// till upper limit of independent variable</span></div>
 <div class="line"><span class="lineno">  134</span>    <span class="comment">/* end of integration */</span></div>
-<div class="line"><span class="lineno">  135</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> t2 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  135</span>    std::clock_t t2 = std::clock();</div>
 <div class="line"><span class="lineno">  136</span> </div>
-<div class="line"><span class="lineno">  137</span>    <span class="keywordflow">if</span> (fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">is_open</a>())</div>
-<div class="line"><span class="lineno">  138</span>        fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html">close</a>();</div>
+<div class="line"><span class="lineno">  137</span>    <span class="keywordflow">if</span> (fp.is_open())</div>
+<div class="line"><span class="lineno">  138</span>        fp.close();</div>
 <div class="line"><span class="lineno">  139</span> </div>
 <div class="line"><span class="lineno">  140</span>    <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(t2 - t1) / CLOCKS_PER_SEC;</div>
 <div class="line"><span class="lineno">  141</span>}</div>
-<div class="ttc" id="agroup__ode_html_ga827bf009831ddc477c5fa8891d5cb35f"><div class="ttname"><a href="#ga827bf009831ddc477c5fa8891d5cb35f">semi_implicit_euler_step</a></div><div class="ttdeci">void semi_implicit_euler_step(const double dx, const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Compute next step approximation using the semi-implicit-Euler method.</div><div class="ttdef"><b>Definition</b> ode_semi_implicit_euler.cpp:82</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.svg" width="471" height="283"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agroup__ode_html_ga827bf009831ddc477c5fa8891d5cb35f"><div class="ttname"><a href="#ga827bf009831ddc477c5fa8891d5cb35f">semi_implicit_euler_step</a></div><div class="ttdeci">void semi_implicit_euler_step(const double dx, const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Compute next step approximation using the semi-implicit-Euler method.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d06/ode__semi__implicit__euler_8cpp_source.html#l00082">ode_semi_implicit_euler.cpp:82</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ga827bf009831ddc477c5fa8891d5cb35f" name="ga827bf009831ddc477c5fa8891d5cb35f"></a>
@@ -557,12 +550,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
+          <td class="paramtype">std::valarray&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>dy</em></span>&#160;)</td>
+          <td class="paramtype">std::valarray&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>dy</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -580,6 +573,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d06/ode__semi__implicit__euler_8cpp_source.html#l00082">82</a> of file <a class="el" href="../../d3/d06/ode__semi__implicit__euler_8cpp_source.html">ode_semi_implicit_euler.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   84</span>                                                       {</div>
 <div class="line"><span class="lineno">   85</span>    <a class="code hl_function" href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a>(x, y, dy);         <span class="comment">// update dy once</span></div>
 <div class="line"><span class="lineno">   86</span>    y[0][0] += dx * dy[0][0];  <span class="comment">// update y0</span></div>
@@ -588,13 +583,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   89</span>    dy[0][0] = 0.f;      <span class="comment">// ignore y0</span></div>
 <div class="line"><span class="lineno">   90</span>    y[0] += dy[0] * dx;  <span class="comment">// update remaining using new dy</span></div>
 <div class="line"><span class="lineno">   91</span>}</div>
-<div class="ttc" id="aode__semi__implicit__euler_8cpp_html_abaeae8f62a018d197f0187a1c80a90fe"><div class="ttname"><a href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a></div><div class="ttdeci">void problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Problem statement for a system with first-order differential equations. Updates the system differenti...</div><div class="ttdef"><b>Definition</b> ode_semi_implicit_euler.cpp:53</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.svg" width="291" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aode__semi__implicit__euler_8cpp_html_abaeae8f62a018d197f0187a1c80a90fe"><div class="ttname"><a href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a></div><div class="ttdeci">void problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Problem statement for a system with first-order differential equations. Updates the system differenti...</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d06/ode__semi__implicit__euler_8cpp_source.html#l00053">ode_semi_implicit_euler.cpp:53</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d6/d60/group__ode_ga195d23bbdfcb80e83c9cda45c9ad5723_cgraph.map b/d6/d60/group__ode_ga195d23bbdfcb80e83c9cda45c9ad5723_cgraph.map
deleted file mode 100644
index 4f1014536..000000000
--- a/d6/d60/group__ode_ga195d23bbdfcb80e83c9cda45c9ad5723_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="forward_euler_step" name="forward_euler_step">
-<area shape="rect" id="Node000001" title="Compute next step approximation using the forward&#45;Euler method." alt="" coords="5,5,137,31"/>
-<area shape="rect" id="Node000002" href="$db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti..." alt="" coords="185,5,252,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="137,16,169,16,169,21,137,21"/>
-</map>
diff --git a/d6/d60/group__ode_ga195d23bbdfcb80e83c9cda45c9ad5723_cgraph.md5 b/d6/d60/group__ode_ga195d23bbdfcb80e83c9cda45c9ad5723_cgraph.md5
deleted file mode 100644
index 9c852f762..000000000
--- a/d6/d60/group__ode_ga195d23bbdfcb80e83c9cda45c9ad5723_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cb3185196d1be42071ff897ec2de5e12
\ No newline at end of file
diff --git a/d6/d60/group__ode_ga195d23bbdfcb80e83c9cda45c9ad5723_cgraph.svg b/d6/d60/group__ode_ga195d23bbdfcb80e83c9cda45c9ad5723_cgraph.svg
deleted file mode 100644
index d56d7136c..000000000
--- a/d6/d60/group__ode_ga195d23bbdfcb80e83c9cda45c9ad5723_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: forward_euler_step Pages: 1 -->
-<svg width="193pt" height="27pt"
- viewBox="0.00 0.00 193.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>forward_euler_step</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compute next step approximation using the forward&#45;Euler method.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-19.25 0,-19.25 0,0 98.5,0 98.5,-19.25"/>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">forward_euler_step</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" target="_top" xlink:title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti...">
-<polygon fill="white" stroke="#666666" points="185,-19.25 134.5,-19.25 134.5,0 185,0 185,-19.25"/>
-<text text-anchor="middle" x="159.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">problem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.79,-9.62C106.79,-9.62 114.95,-9.62 122.58,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.51,-13.13 132.51,-9.63 122.51,-6.13 122.51,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d60/group__ode_ga195d23bbdfcb80e83c9cda45c9ad5723_cgraph_org.svg b/d6/d60/group__ode_ga195d23bbdfcb80e83c9cda45c9ad5723_cgraph_org.svg
deleted file mode 100644
index 5d0d14780..000000000
--- a/d6/d60/group__ode_ga195d23bbdfcb80e83c9cda45c9ad5723_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: forward_euler_step Pages: 1 -->
-<svg width="193pt" height="27pt"
- viewBox="0.00 0.00 193.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>forward_euler_step</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compute next step approximation using the forward&#45;Euler method.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-19.25 0,-19.25 0,0 98.5,0 98.5,-19.25"/>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">forward_euler_step</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" target="_top" xlink:title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti...">
-<polygon fill="white" stroke="#666666" points="185,-19.25 134.5,-19.25 134.5,0 185,0 185,-19.25"/>
-<text text-anchor="middle" x="159.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">problem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.79,-9.62C106.79,-9.62 114.95,-9.62 122.58,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.51,-13.13 132.51,-9.63 122.51,-6.13 122.51,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.map b/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.map
deleted file mode 100644
index e1b170f37..000000000
--- a/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="midpoint_euler" name="midpoint_euler">
-<area shape="rect" id="Node000001" title="Compute approximation using the midpoint&#45;Euler method in the given limits." alt="" coords="5,129,111,155"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/clock.html#" title=" " alt="" coords="195,5,274,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="67,127,104,85,129,61,157,40,179,29,182,34,160,44,132,65,107,88,71,131"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="166,55,303,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="82,126,158,89,172,83,174,88,160,94,84,131"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="159,104,310,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="111,132,143,127,143,133,111,137"/>
-<area shape="rect" id="Node000005" href="$d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812" title="Compute next step approximation using the midpoint&#45;Euler method." alt="" coords="166,153,303,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="111,147,151,152,150,157,111,152"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="167,203,302,228"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="85,153,160,189,174,195,173,200,158,194,83,158"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/c/perror.html#" title=" " alt="" coords="194,252,274,278"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="71,154,108,195,132,218,160,239,181,249,179,253,157,243,129,223,104,199,67,157"/>
-<area shape="rect" id="Node000006" href="$d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti..." alt="" coords="358,153,425,179"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="304,164,343,164,343,169,304,169"/>
-</map>
diff --git a/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.md5 b/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.md5
deleted file mode 100644
index 8445e4502..000000000
--- a/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e5a47d978f06f541dc209a8a2d08e40c
\ No newline at end of file
diff --git a/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.svg b/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.svg
deleted file mode 100644
index 8d49b962d..000000000
--- a/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.svg
+++ /dev/null
@@ -1,173 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: midpoint_euler Pages: 1 -->
-<svg width="323pt" height="212pt"
- viewBox="0.00 0.00 323.00 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>midpoint_euler</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compute approximation using the midpoint&#45;Euler method in the given limits.">
-<polygon fill="#999999" stroke="#666666" points="79,-111.25 0,-111.25 0,-92 79,-92 79,-111.25"/>
-<text text-anchor="middle" x="39.5" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_euler</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.12,-204.25 142.38,-204.25 142.38,-185 201.12,-185 201.12,-204.25"/>
-<text text-anchor="middle" x="171.75" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47.84,-111.63C60.04,-127.61 86.06,-158.86 115,-176.62 120.02,-179.71 125.62,-182.31 131.28,-184.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.08,-187.79 140.67,-187.73 132.35,-181.17 130.08,-187.79"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.25,-167.25 120.25,-167.25 120.25,-148 223.25,-148 223.25,-167.25"/>
-<text text-anchor="middle" x="171.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M58.19,-111.66C73.05,-119.84 95.01,-131.36 115,-139.62 118.54,-141.09 122.24,-142.51 125.98,-143.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.51,-147.06 135.1,-147.03 126.8,-140.45 124.51,-147.06"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.5,-130.25 115,-130.25 115,-111 228.5,-111 228.5,-130.25"/>
-<text text-anchor="middle" x="171.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.23,-107.27C86.86,-108.39 95.07,-109.59 103.33,-110.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.68,-114.23 113.08,-112.21 103.69,-107.31 102.68,-114.23"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812" target="_top" xlink:title="Compute next step approximation using the midpoint&#45;Euler method.">
-<polygon fill="white" stroke="#666666" points="223.25,-93.25 120.25,-93.25 120.25,-74 223.25,-74 223.25,-93.25"/>
-<text text-anchor="middle" x="171.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_euler_step</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.23,-96.27C88.49,-94.99 98.61,-93.59 108.63,-92.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.93,-95.7 118.36,-90.86 107.98,-88.77 108.93,-95.7"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222.12,-56.25 121.38,-56.25 121.38,-37 222.12,-37 222.12,-56.25"/>
-<text text-anchor="middle" x="171.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M58.82,-91.57C73.69,-83.64 95.34,-72.63 115,-64.62 118.59,-63.16 122.36,-61.73 126.15,-60.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.11,-63.74 135.42,-57.17 124.83,-57.12 127.11,-63.74"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/perror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.88,-19.25 141.62,-19.25 141.62,0 201.88,0 201.88,-19.25"/>
-<text text-anchor="middle" x="171.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::perror</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47.87,-91.76C60.12,-76 86.2,-45.17 115,-27.62 119.87,-24.66 125.28,-22.13 130.76,-19.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.54,-23.42 139.83,-16.83 129.24,-16.81 131.54,-23.42"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" target="_top" xlink:title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti...">
-<polygon fill="white" stroke="#666666" points="315,-93.25 264.5,-93.25 264.5,-74 315,-74 315,-93.25"/>
-<text text-anchor="middle" x="289.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">problem</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M223.63,-83.62C233.56,-83.62 243.77,-83.62 253.08,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="252.78,-87.13 262.78,-83.63 252.78,-80.13 252.78,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph_org.svg b/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph_org.svg
deleted file mode 100644
index ae6451f32..000000000
--- a/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph_org.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: midpoint_euler Pages: 1 -->
-<svg width="323pt" height="212pt"
- viewBox="0.00 0.00 323.00 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>midpoint_euler</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compute approximation using the midpoint&#45;Euler method in the given limits.">
-<polygon fill="#999999" stroke="#666666" points="79,-111.25 0,-111.25 0,-92 79,-92 79,-111.25"/>
-<text text-anchor="middle" x="39.5" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_euler</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.12,-204.25 142.38,-204.25 142.38,-185 201.12,-185 201.12,-204.25"/>
-<text text-anchor="middle" x="171.75" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47.84,-111.63C60.04,-127.61 86.06,-158.86 115,-176.62 120.02,-179.71 125.62,-182.31 131.28,-184.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.08,-187.79 140.67,-187.73 132.35,-181.17 130.08,-187.79"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.25,-167.25 120.25,-167.25 120.25,-148 223.25,-148 223.25,-167.25"/>
-<text text-anchor="middle" x="171.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M58.19,-111.66C73.05,-119.84 95.01,-131.36 115,-139.62 118.54,-141.09 122.24,-142.51 125.98,-143.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.51,-147.06 135.1,-147.03 126.8,-140.45 124.51,-147.06"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.5,-130.25 115,-130.25 115,-111 228.5,-111 228.5,-130.25"/>
-<text text-anchor="middle" x="171.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.23,-107.27C86.86,-108.39 95.07,-109.59 103.33,-110.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.68,-114.23 113.08,-112.21 103.69,-107.31 102.68,-114.23"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812" target="_top" xlink:title="Compute next step approximation using the midpoint&#45;Euler method.">
-<polygon fill="white" stroke="#666666" points="223.25,-93.25 120.25,-93.25 120.25,-74 223.25,-74 223.25,-93.25"/>
-<text text-anchor="middle" x="171.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_euler_step</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.23,-96.27C88.49,-94.99 98.61,-93.59 108.63,-92.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.93,-95.7 118.36,-90.86 107.98,-88.77 108.93,-95.7"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222.12,-56.25 121.38,-56.25 121.38,-37 222.12,-37 222.12,-56.25"/>
-<text text-anchor="middle" x="171.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M58.82,-91.57C73.69,-83.64 95.34,-72.63 115,-64.62 118.59,-63.16 122.36,-61.73 126.15,-60.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.11,-63.74 135.42,-57.17 124.83,-57.12 127.11,-63.74"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/perror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.88,-19.25 141.62,-19.25 141.62,0 201.88,0 201.88,-19.25"/>
-<text text-anchor="middle" x="171.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::perror</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47.87,-91.76C60.12,-76 86.2,-45.17 115,-27.62 119.87,-24.66 125.28,-22.13 130.76,-19.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.54,-23.42 139.83,-16.83 129.24,-16.81 131.54,-23.42"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" target="_top" xlink:title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti...">
-<polygon fill="white" stroke="#666666" points="315,-93.25 264.5,-93.25 264.5,-74 315,-74 315,-93.25"/>
-<text text-anchor="middle" x="289.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">problem</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M223.63,-83.62C233.56,-83.62 243.77,-83.62 253.08,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="252.78,-87.13 262.78,-83.63 252.78,-80.13 252.78,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.map b/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.map
deleted file mode 100644
index 9475717eb..000000000
--- a/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="semi_implicit_euler" name="semi_implicit_euler">
-<area shape="rect" id="Node000001" title="Compute approximation using the semi&#45;implicit&#45;Euler method in the given limits." alt="" coords="5,129,138,155"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/clock.html#" title=" " alt="" coords="229,5,307,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="82,127,124,84,153,60,184,40,213,28,215,33,187,45,156,65,128,88,86,131"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="199,55,336,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="99,126,185,89,202,83,204,88,187,94,101,131"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="192,104,344,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="138,131,176,126,177,131,138,136"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="201,153,335,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="138,148,186,153,185,159,138,153"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/c/perror.html#" title=" " alt="" coords="228,203,308,228"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="102,153,187,189,214,198,212,203,185,194,100,158"/>
-<area shape="rect" id="Node000007" href="$d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f" title="Compute next step approximation using the semi&#45;implicit&#45;Euler method." alt="" coords="186,252,350,278"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="86,153,128,195,156,218,187,239,197,244,195,248,184,243,153,223,125,199,82,157"/>
-<area shape="rect" id="Node000008" href="$d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti..." alt="" coords="398,252,465,278"/>
-<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="350,262,382,262,382,268,350,268"/>
-</map>
diff --git a/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.md5 b/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.md5
deleted file mode 100644
index 7e0f4c53b..000000000
--- a/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-89ac11e94a38f4b9ee7b6e77e36c6731
\ No newline at end of file
diff --git a/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.svg b/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.svg
deleted file mode 100644
index e96ea2a83..000000000
--- a/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.svg
+++ /dev/null
@@ -1,173 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: semi_implicit_euler Pages: 1 -->
-<svg width="353pt" height="212pt"
- viewBox="0.00 0.00 353.00 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>semi_implicit_euler</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compute approximation using the semi&#45;implicit&#45;Euler method in the given limits.">
-<polygon fill="#999999" stroke="#666666" points="99.25,-111.25 0,-111.25 0,-92 99.25,-92 99.25,-111.25"/>
-<text text-anchor="middle" x="49.62" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">semi_implicit_euler</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.25,-204.25 167.5,-204.25 167.5,-185 226.25,-185 226.25,-204.25"/>
-<text text-anchor="middle" x="196.88" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M59.22,-111.66C73.44,-127.68 103.5,-158.99 135.25,-176.62 141.75,-180.24 149.06,-183.2 156.29,-185.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.05,-188.88 165.63,-188.39 157.05,-182.17 155.05,-188.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.38,-167.25 145.38,-167.25 145.38,-148 248.38,-148 248.38,-167.25"/>
-<text text-anchor="middle" x="196.88" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.83,-111.62C87.78,-119.77 112.75,-131.28 135.25,-139.62 139.42,-141.17 143.78,-142.68 148.17,-144.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.04,-147.43 157.62,-147.1 149.14,-140.75 147.04,-147.43"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.62,-130.25 140.12,-130.25 140.12,-111 253.62,-111 253.62,-130.25"/>
-<text text-anchor="middle" x="196.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.4,-108C108.7,-109.22 118.58,-110.51 128.35,-111.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.84,-115.25 138.21,-113.08 128.75,-108.31 127.84,-115.25"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.25,-93.25 146.5,-93.25 146.5,-74 247.25,-74 247.25,-93.25"/>
-<text text-anchor="middle" x="196.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.4,-95.58C110.89,-94.16 123.28,-92.62 135.22,-91.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.5,-94.63 144.99,-89.93 134.63,-87.69 135.5,-94.63"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/perror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227,-56.25 166.75,-56.25 166.75,-37 227,-37 227,-56.25"/>
-<text text-anchor="middle" x="196.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::perror</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.54,-91.61C88.49,-83.72 113.11,-72.72 135.25,-64.62 141.81,-62.23 148.86,-59.91 155.75,-57.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.32,-61.26 164.89,-55.03 154.31,-54.55 156.32,-61.26"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f" target="_top" xlink:title="Compute next step approximation using the semi&#45;implicit&#45;Euler method.">
-<polygon fill="white" stroke="#666666" points="258.5,-19.25 135.25,-19.25 135.25,0 258.5,0 258.5,-19.25"/>
-<text text-anchor="middle" x="196.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">semi_implicit_euler_step</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M59.24,-91.73C73.51,-75.93 103.63,-45.05 135.25,-27.62 137.73,-26.26 140.33,-24.98 143,-23.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.08,-27.13 152.1,-20.2 141.51,-20.62 144.08,-27.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" target="_top" xlink:title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti...">
-<polygon fill="white" stroke="#666666" points="345,-19.25 294.5,-19.25 294.5,0 345,0 345,-19.25"/>
-<text text-anchor="middle" x="319.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">problem</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.67,-9.62C266.92,-9.62 275.17,-9.62 282.79,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.65,-13.13 292.65,-9.63 282.65,-6.13 282.65,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph_org.svg b/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph_org.svg
deleted file mode 100644
index 90721e449..000000000
--- a/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph_org.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: semi_implicit_euler Pages: 1 -->
-<svg width="353pt" height="212pt"
- viewBox="0.00 0.00 353.00 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>semi_implicit_euler</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compute approximation using the semi&#45;implicit&#45;Euler method in the given limits.">
-<polygon fill="#999999" stroke="#666666" points="99.25,-111.25 0,-111.25 0,-92 99.25,-92 99.25,-111.25"/>
-<text text-anchor="middle" x="49.62" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">semi_implicit_euler</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.25,-204.25 167.5,-204.25 167.5,-185 226.25,-185 226.25,-204.25"/>
-<text text-anchor="middle" x="196.88" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M59.22,-111.66C73.44,-127.68 103.5,-158.99 135.25,-176.62 141.75,-180.24 149.06,-183.2 156.29,-185.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.05,-188.88 165.63,-188.39 157.05,-182.17 155.05,-188.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.38,-167.25 145.38,-167.25 145.38,-148 248.38,-148 248.38,-167.25"/>
-<text text-anchor="middle" x="196.88" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.83,-111.62C87.78,-119.77 112.75,-131.28 135.25,-139.62 139.42,-141.17 143.78,-142.68 148.17,-144.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.04,-147.43 157.62,-147.1 149.14,-140.75 147.04,-147.43"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.62,-130.25 140.12,-130.25 140.12,-111 253.62,-111 253.62,-130.25"/>
-<text text-anchor="middle" x="196.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.4,-108C108.7,-109.22 118.58,-110.51 128.35,-111.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.84,-115.25 138.21,-113.08 128.75,-108.31 127.84,-115.25"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.25,-93.25 146.5,-93.25 146.5,-74 247.25,-74 247.25,-93.25"/>
-<text text-anchor="middle" x="196.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.4,-95.58C110.89,-94.16 123.28,-92.62 135.22,-91.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.5,-94.63 144.99,-89.93 134.63,-87.69 135.5,-94.63"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/perror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227,-56.25 166.75,-56.25 166.75,-37 227,-37 227,-56.25"/>
-<text text-anchor="middle" x="196.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::perror</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.54,-91.61C88.49,-83.72 113.11,-72.72 135.25,-64.62 141.81,-62.23 148.86,-59.91 155.75,-57.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.32,-61.26 164.89,-55.03 154.31,-54.55 156.32,-61.26"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f" target="_top" xlink:title="Compute next step approximation using the semi&#45;implicit&#45;Euler method.">
-<polygon fill="white" stroke="#666666" points="258.5,-19.25 135.25,-19.25 135.25,0 258.5,0 258.5,-19.25"/>
-<text text-anchor="middle" x="196.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">semi_implicit_euler_step</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M59.24,-91.73C73.51,-75.93 103.63,-45.05 135.25,-27.62 137.73,-26.26 140.33,-24.98 143,-23.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.08,-27.13 152.1,-20.2 141.51,-20.62 144.08,-27.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" target="_top" xlink:title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti...">
-<polygon fill="white" stroke="#666666" points="345,-19.25 294.5,-19.25 294.5,0 345,0 345,-19.25"/>
-<text text-anchor="middle" x="319.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">problem</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.67,-9.62C266.92,-9.62 275.17,-9.62 282.79,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.65,-13.13 292.65,-9.63 282.65,-6.13 282.65,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.map b/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.map
deleted file mode 100644
index d5343b2e7..000000000
--- a/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="semi_implicit_euler_step" name="semi_implicit_euler_step">
-<area shape="rect" id="Node000001" title="Compute next step approximation using the semi&#45;implicit&#45;Euler method." alt="" coords="5,5,170,31"/>
-<area shape="rect" id="Node000002" href="$d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti..." alt="" coords="218,5,285,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="170,16,202,16,202,21,170,21"/>
-</map>
diff --git a/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.md5 b/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.md5
deleted file mode 100644
index 179ba4d8e..000000000
--- a/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4660a10cbd4a893aaeaa474039834fe4
\ No newline at end of file
diff --git a/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.svg b/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.svg
deleted file mode 100644
index 266e576ed..000000000
--- a/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: semi_implicit_euler_step Pages: 1 -->
-<svg width="218pt" height="27pt"
- viewBox="0.00 0.00 217.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>semi_implicit_euler_step</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compute next step approximation using the semi&#45;implicit&#45;Euler method.">
-<polygon fill="#999999" stroke="#666666" points="123.25,-19.25 0,-19.25 0,0 123.25,0 123.25,-19.25"/>
-<text text-anchor="middle" x="61.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">semi_implicit_euler_step</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" target="_top" xlink:title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti...">
-<polygon fill="white" stroke="#666666" points="209.75,-19.25 159.25,-19.25 159.25,0 209.75,0 209.75,-19.25"/>
-<text text-anchor="middle" x="184.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">problem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M123.42,-9.62C131.67,-9.62 139.92,-9.62 147.54,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.4,-13.13 157.4,-9.63 147.4,-6.13 147.4,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph_org.svg b/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph_org.svg
deleted file mode 100644
index 57b97a155..000000000
--- a/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: semi_implicit_euler_step Pages: 1 -->
-<svg width="218pt" height="27pt"
- viewBox="0.00 0.00 217.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>semi_implicit_euler_step</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compute next step approximation using the semi&#45;implicit&#45;Euler method.">
-<polygon fill="#999999" stroke="#666666" points="123.25,-19.25 0,-19.25 0,0 123.25,0 123.25,-19.25"/>
-<text text-anchor="middle" x="61.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">semi_implicit_euler_step</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" target="_top" xlink:title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti...">
-<polygon fill="white" stroke="#666666" points="209.75,-19.25 159.25,-19.25 159.25,0 209.75,0 209.75,-19.25"/>
-<text text-anchor="middle" x="184.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">problem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M123.42,-9.62C131.67,-9.62 139.92,-9.62 147.54,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.4,-13.13 157.4,-9.63 147.4,-6.13 147.4,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.map b/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.map
deleted file mode 100644
index 8b5ea1b7d..000000000
--- a/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="midpoint_euler_step" name="midpoint_euler_step">
-<area shape="rect" id="Node000001" title="Compute next step approximation using the midpoint&#45;Euler method." alt="" coords="5,5,143,31"/>
-<area shape="rect" id="Node000002" href="$d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti..." alt="" coords="191,5,258,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="143,16,175,16,175,21,143,21"/>
-</map>
diff --git a/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.md5 b/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.md5
deleted file mode 100644
index 909d7c966..000000000
--- a/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-50249a404ff33f160b928354e9fd6d48
\ No newline at end of file
diff --git a/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.svg b/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.svg
deleted file mode 100644
index cf7e977b8..000000000
--- a/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: midpoint_euler_step Pages: 1 -->
-<svg width="198pt" height="27pt"
- viewBox="0.00 0.00 197.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>midpoint_euler_step</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compute next step approximation using the midpoint&#45;Euler method.">
-<polygon fill="#999999" stroke="#666666" points="103,-19.25 0,-19.25 0,0 103,0 103,-19.25"/>
-<text text-anchor="middle" x="51.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_euler_step</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" target="_top" xlink:title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti...">
-<polygon fill="white" stroke="#666666" points="189.5,-19.25 139,-19.25 139,0 189.5,0 189.5,-19.25"/>
-<text text-anchor="middle" x="164.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">problem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.34,-9.62C111.4,-9.62 119.59,-9.62 127.22,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.13,-13.13 137.13,-9.63 127.13,-6.13 127.13,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph_org.svg b/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph_org.svg
deleted file mode 100644
index b0b3b2c33..000000000
--- a/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: midpoint_euler_step Pages: 1 -->
-<svg width="198pt" height="27pt"
- viewBox="0.00 0.00 197.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>midpoint_euler_step</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compute next step approximation using the midpoint&#45;Euler method.">
-<polygon fill="#999999" stroke="#666666" points="103,-19.25 0,-19.25 0,0 103,0 103,-19.25"/>
-<text text-anchor="middle" x="51.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_euler_step</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" target="_top" xlink:title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti...">
-<polygon fill="white" stroke="#666666" points="189.5,-19.25 139,-19.25 139,0 189.5,0 189.5,-19.25"/>
-<text text-anchor="middle" x="164.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">problem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.34,-9.62C111.4,-9.62 119.59,-9.62 127.22,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.13,-13.13 137.13,-9.63 127.13,-6.13 127.13,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.map b/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.map
deleted file mode 100644
index 852fab09f..000000000
--- a/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="forward_euler" name="forward_euler">
-<area shape="rect" id="Node000001" title="Compute approximation using the forward&#45;Euler method in the given limits." alt="" coords="5,129,105,155"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/clock.html#" title=" " alt="" coords="189,5,268,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="64,127,99,85,124,61,151,40,173,29,175,34,154,44,127,65,103,88,68,131"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="160,55,297,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="78,126,152,89,166,83,168,88,154,94,80,131"/>
-<area shape="rect" id="Node000004" href="$d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723" title="Compute next step approximation using the forward&#45;Euler method." alt="" coords="163,104,294,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="105,132,147,126,148,131,106,138"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="153,153,304,179"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="106,146,138,151,137,156,105,152"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="161,203,296,228"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="81,153,154,189,168,195,166,200,152,194,79,158"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/c/perror.html#" title=" " alt="" coords="188,252,268,278"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="68,154,103,195,127,219,154,239,175,249,172,254,151,243,124,223,99,199,64,157"/>
-<area shape="rect" id="Node000005" href="$db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti..." alt="" coords="352,104,419,130"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="294,114,337,114,337,120,294,120"/>
-</map>
diff --git a/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.md5 b/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.md5
deleted file mode 100644
index 6c700e2c2..000000000
--- a/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9c4801aafe8e9891caa331ab22e1efa3
\ No newline at end of file
diff --git a/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.svg b/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.svg
deleted file mode 100644
index 08c1bb94c..000000000
--- a/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.svg
+++ /dev/null
@@ -1,173 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: forward_euler Pages: 1 -->
-<svg width="319pt" height="212pt"
- viewBox="0.00 0.00 318.50 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>forward_euler</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compute approximation using the forward&#45;Euler method in the given limits.">
-<polygon fill="#999999" stroke="#666666" points="74.5,-111.25 0,-111.25 0,-92 74.5,-92 74.5,-111.25"/>
-<text text-anchor="middle" x="37.25" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">forward_euler</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.62,-204.25 137.88,-204.25 137.88,-185 196.62,-185 196.62,-204.25"/>
-<text text-anchor="middle" x="167.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.29,-111.64C57.03,-127.63 82.13,-158.91 110.5,-176.62 115.49,-179.74 121.08,-182.37 126.74,-184.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.53,-187.86 136.13,-187.8 127.81,-181.24 125.53,-187.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="218.75,-167.25 115.75,-167.25 115.75,-148 218.75,-148 218.75,-167.25"/>
-<text text-anchor="middle" x="167.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.36,-111.7C69.75,-119.91 91.04,-131.44 110.5,-139.62 114.03,-141.11 117.73,-142.55 121.46,-143.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="119.98,-147.11 130.58,-147.1 122.29,-140.5 119.98,-147.11"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723" target="_top" xlink:title="Compute next step approximation using the forward&#45;Euler method.">
-<polygon fill="white" stroke="#666666" points="216.5,-130.25 118,-130.25 118,-111 216.5,-111 216.5,-130.25"/>
-<text text-anchor="middle" x="167.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">forward_euler_step</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.93,-107.07C84.8,-108.53 95.74,-110.16 106.51,-111.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.72,-115.18 116.13,-113.19 106.75,-108.25 105.72,-115.18"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-93.25 110.5,-93.25 110.5,-74 224,-74 224,-93.25"/>
-<text text-anchor="middle" x="167.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.93,-96.47C82.55,-95.4 90.8,-94.23 99.13,-93.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.56,-96.54 108.97,-91.68 98.58,-89.61 99.56,-96.54"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="217.62,-56.25 116.88,-56.25 116.88,-37 217.62,-37 217.62,-56.25"/>
-<text text-anchor="middle" x="167.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.98,-91.53C70.38,-83.58 91.36,-72.55 110.5,-64.62 114.04,-63.16 117.74,-61.74 121.48,-60.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.3,-63.79 130.6,-57.21 120,-57.18 122.3,-63.79"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/perror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.38,-19.25 137.12,-19.25 137.12,0 197.38,0 197.38,-19.25"/>
-<text text-anchor="middle" x="167.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::perror</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.32,-91.74C57.11,-75.98 82.27,-45.12 110.5,-27.62 115.35,-24.62 120.74,-22.07 126.22,-19.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127,-23.35 135.29,-16.75 124.69,-16.74 127,-23.35"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" target="_top" xlink:title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti...">
-<polygon fill="white" stroke="#666666" points="310.5,-130.25 260,-130.25 260,-111 310.5,-111 310.5,-130.25"/>
-<text text-anchor="middle" x="285.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">problem</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.77,-120.62C227.39,-120.62 238.45,-120.62 248.46,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.14,-124.13 258.14,-120.63 248.14,-117.13 248.14,-124.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph_org.svg b/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph_org.svg
deleted file mode 100644
index 17190c836..000000000
--- a/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph_org.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: forward_euler Pages: 1 -->
-<svg width="319pt" height="212pt"
- viewBox="0.00 0.00 318.50 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>forward_euler</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compute approximation using the forward&#45;Euler method in the given limits.">
-<polygon fill="#999999" stroke="#666666" points="74.5,-111.25 0,-111.25 0,-92 74.5,-92 74.5,-111.25"/>
-<text text-anchor="middle" x="37.25" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">forward_euler</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.62,-204.25 137.88,-204.25 137.88,-185 196.62,-185 196.62,-204.25"/>
-<text text-anchor="middle" x="167.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.29,-111.64C57.03,-127.63 82.13,-158.91 110.5,-176.62 115.49,-179.74 121.08,-182.37 126.74,-184.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.53,-187.86 136.13,-187.8 127.81,-181.24 125.53,-187.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="218.75,-167.25 115.75,-167.25 115.75,-148 218.75,-148 218.75,-167.25"/>
-<text text-anchor="middle" x="167.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.36,-111.7C69.75,-119.91 91.04,-131.44 110.5,-139.62 114.03,-141.11 117.73,-142.55 121.46,-143.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="119.98,-147.11 130.58,-147.1 122.29,-140.5 119.98,-147.11"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723" target="_top" xlink:title="Compute next step approximation using the forward&#45;Euler method.">
-<polygon fill="white" stroke="#666666" points="216.5,-130.25 118,-130.25 118,-111 216.5,-111 216.5,-130.25"/>
-<text text-anchor="middle" x="167.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">forward_euler_step</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.93,-107.07C84.8,-108.53 95.74,-110.16 106.51,-111.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.72,-115.18 116.13,-113.19 106.75,-108.25 105.72,-115.18"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-93.25 110.5,-93.25 110.5,-74 224,-74 224,-93.25"/>
-<text text-anchor="middle" x="167.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.93,-96.47C82.55,-95.4 90.8,-94.23 99.13,-93.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.56,-96.54 108.97,-91.68 98.58,-89.61 99.56,-96.54"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="217.62,-56.25 116.88,-56.25 116.88,-37 217.62,-37 217.62,-56.25"/>
-<text text-anchor="middle" x="167.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.98,-91.53C70.38,-83.58 91.36,-72.55 110.5,-64.62 114.04,-63.16 117.74,-61.74 121.48,-60.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.3,-63.79 130.6,-57.21 120,-57.18 122.3,-63.79"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/perror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.38,-19.25 137.12,-19.25 137.12,0 197.38,0 197.38,-19.25"/>
-<text text-anchor="middle" x="167.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::perror</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.32,-91.74C57.11,-75.98 82.27,-45.12 110.5,-27.62 115.35,-24.62 120.74,-22.07 126.22,-19.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127,-23.35 135.29,-16.75 124.69,-16.74 127,-23.35"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" target="_top" xlink:title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti...">
-<polygon fill="white" stroke="#666666" points="310.5,-130.25 260,-130.25 260,-111 310.5,-111 310.5,-130.25"/>
-<text text-anchor="middle" x="285.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">problem</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.77,-120.62C227.39,-120.62 238.45,-120.62 248.46,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.14,-124.13 258.14,-120.63 248.14,-117.13 248.14,-124.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d74/library__sort_8cpp_source.html b/d6/d74/library__sort_8cpp_source.html
new file mode 100644
index 000000000..310940a96
--- /dev/null
+++ b/d6/d74/library__sort_8cpp_source.html
@@ -0,0 +1,232 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/library_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/d74/library__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">library_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="keywordtype">void</span> librarySort(<span class="keywordtype">int</span> *index, <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span>    <span class="keywordtype">int</span> lib_size, index_pos,</div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span>        *gaps,        <span class="comment">// gaps</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span>        *library[2];  <span class="comment">// libraries</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    <span class="keywordtype">bool</span> target_lib, *numbered;</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 2; i++) library[i] = <span class="keyword">new</span> <span class="keywordtype">int</span>[n];</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    gaps = <span class="keyword">new</span> <span class="keywordtype">int</span>[n + 1];</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    numbered = <span class="keyword">new</span> <span class="keywordtype">bool</span>[n + 1];</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    lib_size = 1;</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    index_pos = 1;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    target_lib = 0;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    library[target_lib][0] = index[0];</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keywordflow">while</span> (index_pos &lt; n) {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        <span class="comment">// binary search</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        <span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a> = std::distance(</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>            library[target_lib],</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>            std::lower_bound(library[target_lib],</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>                             library[target_lib] + lib_size, index[index_pos]));</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        <span class="comment">// if there is no gap to insert a new index ...</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        <span class="keywordflow">if</span> (numbered[<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>] == <span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>            <span class="keywordtype">int</span> prov_size = 0, next_target_lib = !target_lib;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>            <span class="comment">// update library and clear gaps</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= n; i++) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>                <span class="keywordflow">if</span> (numbered[i] == <span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>                    library[next_target_lib][prov_size] = gaps[i];</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>                    prov_size++;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>                    numbered[i] = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>                }</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>                <span class="keywordflow">if</span> (i &lt;= lib_size) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>                    library[next_target_lib][prov_size] =</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>                        library[target_lib][i];</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>                    prov_size++;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>                }</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            target_lib = next_target_lib;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>            lib_size = prov_size - 1;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            numbered[<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            gaps[<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>] = index[index_pos];</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            index_pos++;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordtype">int</span> index_pos_for_output = 0;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; index_pos_for_output &lt; n; i++) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        <span class="keywordflow">if</span> (numbered[i] == <span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            <span class="comment">// std::cout &lt;&lt; gaps[i] &lt;&lt; std::endl;</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            index[index_pos_for_output] = gaps[i];</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            index_pos_for_output++;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="keywordflow">if</span> (i &lt; lib_size) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            <span class="comment">// std::cout &lt;&lt; library[target_lib][i] &lt;&lt; std::endl;</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            index[index_pos_for_output] = library[target_lib][i];</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            index_pos_for_output++;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        }</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keyword">delete</span>[] numbered;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keyword">delete</span>[] gaps;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 2; ++i) {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        <span class="keyword">delete</span>[] library[i];</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    }</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>}</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="comment">// ---example--</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keywordtype">int</span> index_ex[] = {-6, 5, 9, 1, 9, 1, 0, 1, -8, 4, -12};</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordtype">int</span> n_ex = <span class="keyword">sizeof</span>(index_ex) / <span class="keyword">sizeof</span>(index_ex[0]);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    librarySort(index_ex, n_ex);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;sorted array :&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n_ex; i++) std::cout &lt;&lt; index_ex[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="comment">/* --output--</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span><span class="comment">    sorted array :</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span><span class="comment">    -12 -8 -6 0 1 1 1 4 5 9 9</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span><span class="comment">    */</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>}</div>
+<div class="ttc" id="aavltree_8cpp_html_a2473fe7416332495b2678ebe89652e4b"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a></div><div class="ttdeci">node * insert(node *root, int item)</div><div class="ttdoc">inserts a new element into AVL tree</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00092">avltree.cpp:92</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><b>library_sort.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/d74/namespacekadane.html b/d6/d74/namespacekadane.html
index d74ab75f2..0c989840f 100644
--- a/d6/d74/namespacekadane.html
+++ b/d6/d74/namespacekadane.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: kadane Namespace Reference</title>
+<title>TheAlgorithms/C++: kadane Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d6/d7a/golden__search__extrema_8cpp.html b/d6/d7a/golden__search__extrema_8cpp.html
index e34c75165..9bf5d95ca 100644
--- a/d6/d7a/golden__search__extrema_8cpp.html
+++ b/d6/d7a/golden__search__extrema_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/golden_search_extrema.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/golden_search_extrema.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,20 +141,20 @@ Include dependency graph for golden_search_extrema.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d94/golden__search__extrema_8cpp__incl.svg" width="515" height="126"><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">
+</div>
+<p><a href="../../d6/d7a/golden__search__extrema_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="define-members" name="define-members"></a>
 Macros</h2></td></tr>
-<tr class="memitem:a525335710b53cb064ca56b936120431e" id="r_a525335710b53cb064ca56b936120431e"><td class="memItemLeft" align="right" valign="top"><a id="a525335710b53cb064ca56b936120431e" name="a525335710b53cb064ca56b936120431e"></a>
-#define&#160;</td><td class="memItemRight" valign="bottom"><b>_USE_MATH_DEFINES</b></td></tr>
+<tr class="memitem:a525335710b53cb064ca56b936120431e" id="r_a525335710b53cb064ca56b936120431e"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a525335710b53cb064ca56b936120431e">_USE_MATH_DEFINES</a></td></tr>
 <tr class="separator:a525335710b53cb064ca56b936120431e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a002b2f4894492820fe708b1b7e7c5e70" id="r_a002b2f4894492820fe708b1b7e7c5e70"><td class="memItemLeft" align="right" valign="top"><a id="a002b2f4894492820fe708b1b7e7c5e70" name="a002b2f4894492820fe708b1b7e7c5e70"></a>
-#define&#160;</td><td class="memItemRight" valign="bottom"><b>EPSILON</b>&#160;&#160;&#160;1e-7</td></tr>
-<tr class="memdesc:a002b2f4894492820fe708b1b7e7c5e70"><td class="mdescLeft">&#160;</td><td class="mdescRight">solution accuracy limit <br /></td></tr>
+<tr class="memitem:a002b2f4894492820fe708b1b7e7c5e70" id="r_a002b2f4894492820fe708b1b7e7c5e70"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>&#160;&#160;&#160;1e-7</td></tr>
+<tr class="memdesc:a002b2f4894492820fe708b1b7e7c5e70"><td class="mdescLeft">&#160;</td><td class="mdescRight">solution accuracy limit  <br /></td></tr>
 <tr class="separator:a002b2f4894492820fe708b1b7e7c5e70"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a1aa76a6d5fd4d333f9072beff1dc486b" id="r_a1aa76a6d5fd4d333f9072beff1dc486b"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; double(double)&gt; &amp;f, double lim_a, double lim_b)</td></tr>
+<tr class="memitem:a1aa76a6d5fd4d333f9072beff1dc486b" id="r_a1aa76a6d5fd4d333f9072beff1dc486b"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a> (const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b)</td></tr>
 <tr class="memdesc:a1aa76a6d5fd4d333f9072beff1dc486b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the minima of a function in the given interval. To get the maxima, simply negate the function. The golden ratio used here is:  <br /></td></tr>
 <tr class="separator:a1aa76a6d5fd4d333f9072beff1dc486b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a1440a7779ac56f47a3f355ce4a8c7da0" id="r_a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a> ()</td></tr>
@@ -159,7 +176,44 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Find extrema of a univariate real function in a given interval using <a href="https://en.wikipedia.org/wiki/Golden-section_search" target="_blank">golden section search algorithm</a>. </p>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../db/d01/brent__method__extrema_8cpp.html" title="Find real extrema of a univariate real function in a given interval using Brent&#39;s method.">brent_method_extrema.cpp</a> </dd></dl>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
-</div><h2 class="groupheader">Function Documentation</h2>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/d7a/golden__search__extrema_8cpp_source.html">golden_search_extrema.cpp</a>.</p>
+</div><h2 class="groupheader">Macro Definition Documentation</h2>
+<a id="a525335710b53cb064ca56b936120431e" name="a525335710b53cb064ca56b936120431e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a525335710b53cb064ca56b936120431e">&#9670;&#160;</a></span>_USE_MATH_DEFINES</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">#define _USE_MATH_DEFINES</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d7a/golden__search__extrema_8cpp_source.html#l00010">10</a> of file <a class="el" href="../../d6/d7a/golden__search__extrema_8cpp_source.html">golden_search_extrema.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a002b2f4894492820fe708b1b7e7c5e70" name="a002b2f4894492820fe708b1b7e7c5e70"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a002b2f4894492820fe708b1b7e7c5e70">&#9670;&#160;</a></span>EPSILON</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">#define EPSILON&#160;&#160;&#160;1e-7</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>solution accuracy limit </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d7a/golden__search__extrema_8cpp_source.html#l00018">18</a> of file <a class="el" href="../../d6/d7a/golden__search__extrema_8cpp_source.html">golden_search_extrema.cpp</a>.</p>
+
+</div>
+</div>
+<h2 class="groupheader">Function Documentation</h2>
 <a id="a1aa76a6d5fd4d333f9072beff1dc486b" name="a1aa76a6d5fd4d333f9072beff1dc486b"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a1aa76a6d5fd4d333f9072beff1dc486b">&#9670;&#160;</a></span>get_minima()</h2>
 
@@ -169,7 +223,7 @@ Functions</h2></td></tr>
         <tr>
           <td class="memname">double get_minima </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; double(double)&gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>f</em></span>, </td>
+          <td class="paramtype">const std::function&lt; double(double)&gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>f</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -198,19 +252,21 @@ k=\frac{3-\sqrt{5}}{2} \approx 0.381966\ldots\]
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>local minima found in the interval </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d7a/golden__search__extrema_8cpp_source.html#l00030">30</a> of file <a class="el" href="../../d6/d7a/golden__search__extrema_8cpp_source.html">golden_search_extrema.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   31</span>                                {</div>
 <div class="line"><span class="lineno">   32</span>    uint32_t iters = 0;</div>
 <div class="line"><span class="lineno">   33</span>    <span class="keywordtype">double</span> c, d;</div>
-<div class="line"><span class="lineno">   34</span>    <span class="keywordtype">double</span> prev_mean, mean = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html">std::numeric_limits&lt;double&gt;::infinity</a>();</div>
+<div class="line"><span class="lineno">   34</span>    <span class="keywordtype">double</span> prev_mean, mean = std::numeric_limits&lt;double&gt;::infinity();</div>
 <div class="line"><span class="lineno">   35</span> </div>
 <div class="line"><span class="lineno">   36</span>    <span class="comment">// golden ratio value</span></div>
-<div class="line"><span class="lineno">   37</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> M_GOLDEN_RATIO = (1.f + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(5.f)) / 2.f;</div>
+<div class="line"><span class="lineno">   37</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> M_GOLDEN_RATIO = (1.f + std::sqrt(5.f)) / 2.f;</div>
 <div class="line"><span class="lineno">   38</span> </div>
 <div class="line"><span class="lineno">   39</span>    <span class="comment">// ensure that lim_a &lt; lim_b</span></div>
 <div class="line"><span class="lineno">   40</span>    <span class="keywordflow">if</span> (lim_a &gt; lim_b) {</div>
-<div class="line"><span class="lineno">   41</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(lim_a, lim_b);</div>
+<div class="line"><span class="lineno">   41</span>        std::swap(lim_a, lim_b);</div>
 <div class="line"><span class="lineno">   42</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (std::abs(lim_a - lim_b) &lt;= <a class="code hl_define" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>) {</div>
-<div class="line"><span class="lineno">   43</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Search range must be greater than &quot;</span> &lt;&lt; <a class="code hl_define" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   43</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Search range must be greater than &quot;</span> &lt;&lt; <a class="code hl_define" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   44</span>        <span class="keywordflow">return</span> lim_a;</div>
 <div class="line"><span class="lineno">   45</span>    }</div>
 <div class="line"><span class="lineno">   46</span> </div>
@@ -236,21 +292,12 @@ k=\frac{3-\sqrt{5}}{2} \approx 0.381966\ldots\]
 <div class="line"><span class="lineno">   66</span>        <span class="comment">// continue till the interval width is greater than sqrt(system epsilon)</span></div>
 <div class="line"><span class="lineno">   67</span>    } <span class="keywordflow">while</span> (std::abs(lim_a - lim_b) &gt; <a class="code hl_define" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>);</div>
 <div class="line"><span class="lineno">   68</span> </div>
-<div class="line"><span class="lineno">   69</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; (iters: &quot;</span> &lt;&lt; iters &lt;&lt; <span class="stringliteral">&quot;) &quot;</span>;</div>
+<div class="line"><span class="lineno">   69</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; (iters: &quot;</span> &lt;&lt; iters &lt;&lt; <span class="stringliteral">&quot;) &quot;</span>;</div>
 <div class="line"><span class="lineno">   70</span>    <span class="keywordflow">return</span> prev_mean;</div>
 <div class="line"><span class="lineno">   71</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::cerr</a></div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a4251b4df4748a0b9c43a48f61bdd2397"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">numerical_methods::simpson_method::f</a></div><div class="ttdeci">double f(double x)</div><div class="ttdoc">A function f(x) that will be used to test the method.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:113</div></div>
-<div class="ttc" id="agolden__search__extrema_8cpp_html_a002b2f4894492820fe708b1b7e7c5e70"><div class="ttname"><a href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div><div class="ttdeci">#define EPSILON</div><div class="ttdoc">solution accuracy limit</div><div class="ttdef"><b>Definition</b> golden_search_extrema.cpp:18</div></div>
-<div class="ttc" id="ainfinity_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html">std::numeric_limits::infinity</a></div><div class="ttdeci">T infinity(T... args)</div></div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- 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="../../d6/d7a/golden__search__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.svg" width="279" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a4251b4df4748a0b9c43a48f61bdd2397"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">numerical_methods::simpson_method::f</a></div><div class="ttdeci">double f(double x)</div><div class="ttdoc">A function f(x) that will be used to test the method.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00113">composite_simpson_rule.cpp:113</a></div></div>
+<div class="ttc" id="agolden__search__extrema_8cpp_html_a002b2f4894492820fe708b1b7e7c5e70"><div class="ttname"><a href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div><div class="ttdeci">#define EPSILON</div><div class="ttdoc">solution accuracy limit</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d7a/golden__search__extrema_8cpp_source.html#l00018">golden_search_extrema.cpp:18</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -268,10 +315,12 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d7a/golden__search__extrema_8cpp_source.html#l00140">140</a> of file <a class="el" href="../../d6/d7a/golden__search__extrema_8cpp_source.html">golden_search_extrema.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  140</span>           {</div>
-<div class="line"><span class="lineno">  141</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>.precision(9);</div>
+<div class="line"><span class="lineno">  141</span>    std::cout.precision(9);</div>
 <div class="line"><span class="lineno">  142</span> </div>
-<div class="line"><span class="lineno">  143</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Computations performed with machine epsilon: &quot;</span> &lt;&lt; <a class="code hl_define" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div>
+<div class="line"><span class="lineno">  143</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Computations performed with machine epsilon: &quot;</span> &lt;&lt; <a class="code hl_define" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div>
 <div class="line"><span class="lineno">  144</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  145</span> </div>
 <div class="line"><span class="lineno">  146</span>    <a class="code hl_function" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();</div>
@@ -280,15 +329,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  149</span> </div>
 <div class="line"><span class="lineno">  150</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  151</span>}</div>
-<div class="ttc" id="agolden__search__extrema_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">Test function to find maxima for the function  in the interval    Expected result: .</div><div class="ttdef"><b>Definition</b> golden_search_extrema.cpp:101</div></div>
-<div class="ttc" id="agolden__search__extrema_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">Test function to find minima for the function  in the interval    Expected result = 2.</div><div class="ttdef"><b>Definition</b> golden_search_extrema.cpp:79</div></div>
-<div class="ttc" id="agolden__search__extrema_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">Test function to find maxima for the function  in the interval    Expected result: .</div><div class="ttdef"><b>Definition</b> golden_search_extrema.cpp:124</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d7a/golden__search__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="475" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agolden__search__extrema_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">Test function to find maxima for the function  in the interval    Expected result: .</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d7a/golden__search__extrema_8cpp_source.html#l00101">golden_search_extrema.cpp:101</a></div></div>
+<div class="ttc" id="agolden__search__extrema_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">Test function to find minima for the function  in the interval    Expected result = 2.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d7a/golden__search__extrema_8cpp_source.html#l00079">golden_search_extrema.cpp:79</a></div></div>
+<div class="ttc" id="agolden__search__extrema_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">Test function to find maxima for the function  in the interval    Expected result: .</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d7a/golden__search__extrema_8cpp_source.html#l00124">golden_search_extrema.cpp:124</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1440a7779ac56f47a3f355ce4a8c7da0" name="a1440a7779ac56f47a3f355ce4a8c7da0"></a>
@@ -308,29 +352,25 @@ Here is the call graph for this function:</div>
 
 <p>Test function to find minima for the function \(f(x)= (x-2)^2\) in the interval \([1,5]\) <br  />
  Expected result = 2. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d7a/golden__search__extrema_8cpp_source.html#l00079">79</a> of file <a class="el" href="../../d6/d7a/golden__search__extrema_8cpp_source.html">golden_search_extrema.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   79</span>             {</div>
 <div class="line"><span class="lineno">   80</span>    <span class="comment">// define the function to minimize as a lambda function</span></div>
-<div class="line"><span class="lineno">   81</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt;double(<span class="keywordtype">double</span>)&gt; f1 = [](<span class="keywordtype">double</span> x) {</div>
+<div class="line"><span class="lineno">   81</span>    std::function&lt;double(<span class="keywordtype">double</span>)&gt; f1 = [](<span class="keywordtype">double</span> x) {</div>
 <div class="line"><span class="lineno">   82</span>        <span class="keywordflow">return</span> (x - 2) * (x - 2);</div>
 <div class="line"><span class="lineno">   83</span>    };</div>
 <div class="line"><span class="lineno">   84</span> </div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1.... &quot;</span>;</div>
+<div class="line"><span class="lineno">   85</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1.... &quot;</span>;</div>
 <div class="line"><span class="lineno">   86</span> </div>
 <div class="line"><span class="lineno">   87</span>    <span class="keywordtype">double</span> minima = <a class="code hl_function" href="#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a>(f1, 1, 5);</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/io/basic_ostream.html">std::cout</a> &lt;&lt; minima &lt;&lt; <span class="stringliteral">&quot;...&quot;</span>;</div>
+<div class="line"><span class="lineno">   89</span>    std::cout &lt;&lt; minima &lt;&lt; <span class="stringliteral">&quot;...&quot;</span>;</div>
 <div class="line"><span class="lineno">   90</span> </div>
 <div class="line"><span class="lineno">   91</span>    assert(std::abs(minima - 2) &lt; <a class="code hl_define" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>);</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> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   93</span>}</div>
-<div class="ttc" id="afunction_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a></div></div>
-<div class="ttc" id="agolden__search__extrema_8cpp_html_a1aa76a6d5fd4d333f9072beff1dc486b"><div class="ttname"><a href="#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a></div><div class="ttdeci">double get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b)</div><div class="ttdoc">Get the minima of a function in the given interval. To get the maxima, simply negate the function....</div><div class="ttdef"><b>Definition</b> golden_search_extrema.cpp:30</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d7a/golden__search__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg" width="378" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agolden__search__extrema_8cpp_html_a1aa76a6d5fd4d333f9072beff1dc486b"><div class="ttname"><a href="#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a></div><div class="ttdeci">double get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b)</div><div class="ttdoc">Get the minima of a function in the given interval. To get the maxima, simply negate the function....</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d7a/golden__search__extrema_8cpp_source.html#l00030">golden_search_extrema.cpp:30</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0283886819c7c140a023582b7269e2d0" name="a0283886819c7c140a023582b7269e2d0"></a>
@@ -350,29 +390,25 @@ Here is the call graph for this function:</div>
 
 <p>Test function to find <em>maxima</em> for the function \(f(x)= x^{\frac{1}{x}}\) in the interval \([-2,10]\) <br  />
  Expected result: \(e\approx 2.71828182845904509\). </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d7a/golden__search__extrema_8cpp_source.html#l00101">101</a> of file <a class="el" href="../../d6/d7a/golden__search__extrema_8cpp_source.html">golden_search_extrema.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  101</span>             {</div>
 <div class="line"><span class="lineno">  102</span>    <span class="comment">// define the function to maximize as a lambda function</span></div>
 <div class="line"><span class="lineno">  103</span>    <span class="comment">// since we are maximixing, we negated the function return value</span></div>
-<div class="line"><span class="lineno">  104</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt;double(<span class="keywordtype">double</span>)&gt; func = [](<span class="keywordtype">double</span> x) {</div>
-<div class="line"><span class="lineno">  105</span>        <span class="keywordflow">return</span> -<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(x, 1.f / x);</div>
+<div class="line"><span class="lineno">  104</span>    std::function&lt;double(<span class="keywordtype">double</span>)&gt; func = [](<span class="keywordtype">double</span> x) {</div>
+<div class="line"><span class="lineno">  105</span>        <span class="keywordflow">return</span> -std::pow(x, 1.f / x);</div>
 <div class="line"><span class="lineno">  106</span>    };</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> &lt;&lt; <span class="stringliteral">&quot;Test 2.... &quot;</span>;</div>
+<div class="line"><span class="lineno">  108</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2.... &quot;</span>;</div>
 <div class="line"><span class="lineno">  109</span> </div>
 <div class="line"><span class="lineno">  110</span>    <span class="keywordtype">double</span> minima = <a class="code hl_function" href="#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a>(func, -2, 10);</div>
 <div class="line"><span class="lineno">  111</span> </div>
-<div class="line"><span class="lineno">  112</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; minima &lt;&lt; <span class="stringliteral">&quot; (&quot;</span> &lt;&lt; M_E &lt;&lt; <span class="stringliteral">&quot;)...&quot;</span>;</div>
+<div class="line"><span class="lineno">  112</span>    std::cout &lt;&lt; minima &lt;&lt; <span class="stringliteral">&quot; (&quot;</span> &lt;&lt; M_E &lt;&lt; <span class="stringliteral">&quot;)...&quot;</span>;</div>
 <div class="line"><span class="lineno">  113</span> </div>
 <div class="line"><span class="lineno">  114</span>    assert(std::abs(minima - M_E) &lt; <a class="code hl_define" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>);</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> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  115</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  116</span>}</div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d7a/golden__search__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg" width="378" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6d0455dd5c30adda100e95f0423c786e" name="a6d0455dd5c30adda100e95f0423c786e"></a>
@@ -392,27 +428,23 @@ Here is the call graph for this function:</div>
 
 <p>Test function to find <em>maxima</em> for the function \(f(x)= \cos x\) in the interval \([0,12]\) <br  />
  Expected result: \(\pi\approx 3.14159265358979312\). </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d7a/golden__search__extrema_8cpp_source.html#l00124">124</a> of file <a class="el" href="../../d6/d7a/golden__search__extrema_8cpp_source.html">golden_search_extrema.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  124</span>             {</div>
 <div class="line"><span class="lineno">  125</span>    <span class="comment">// define the function to maximize as a lambda function</span></div>
 <div class="line"><span class="lineno">  126</span>    <span class="comment">// since we are maximixing, we negated the function return value</span></div>
-<div class="line"><span class="lineno">  127</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt;double(<span class="keywordtype">double</span>)&gt; func = [](<span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a>(x); };</div>
+<div class="line"><span class="lineno">  127</span>    std::function&lt;double(<span class="keywordtype">double</span>)&gt; func = [](<span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> std::cos(x); };</div>
 <div class="line"><span class="lineno">  128</span> </div>
-<div class="line"><span class="lineno">  129</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3.... &quot;</span>;</div>
+<div class="line"><span class="lineno">  129</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3.... &quot;</span>;</div>
 <div class="line"><span class="lineno">  130</span> </div>
 <div class="line"><span class="lineno">  131</span>    <span class="keywordtype">double</span> minima = <a class="code hl_function" href="#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a>(func, -4, 12);</div>
 <div class="line"><span class="lineno">  132</span> </div>
-<div class="line"><span class="lineno">  133</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; minima &lt;&lt; <span class="stringliteral">&quot; (&quot;</span> &lt;&lt; M_PI &lt;&lt; <span class="stringliteral">&quot;)...&quot;</span>;</div>
+<div class="line"><span class="lineno">  133</span>    std::cout &lt;&lt; minima &lt;&lt; <span class="stringliteral">&quot; (&quot;</span> &lt;&lt; M_PI &lt;&lt; <span class="stringliteral">&quot;)...&quot;</span>;</div>
 <div class="line"><span class="lineno">  134</span> </div>
 <div class="line"><span class="lineno">  135</span>    assert(std::abs(minima - M_PI) &lt; <a class="code hl_define" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>);</div>
-<div class="line"><span class="lineno">  136</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  136</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  137</span>}</div>
-<div class="ttc" id="acos_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a></div><div class="ttdeci">T cos(T... args)</div></div>
-</div><!-- 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="../../d6/d7a/golden__search__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg" width="378" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d6/d7a/golden__search__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/d6/d7a/golden__search__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
deleted file mode 100644
index e73d0863f..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="test2" name="test2">
-<area shape="rect" id="Node000001" title="Test function to find maxima for the function &#160;in the interval &#160;&#160;&#160;Expected result: ." alt="" coords="5,96,56,121"/>
-<area shape="rect" id="Node000002" href="$d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" title="Get the minima of a function in the given interval. To get the maxima, simply negate the function...." alt="" coords="104,70,192,96"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,100,88,93,89,98,57,106"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="112,120,184,145"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="57,111,97,119,96,125,56,116"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/numeric_limits/infinity.html#" title=" " alt="" coords="240,5,371,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="185,67,232,49,234,54,186,72"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="271,70,340,96"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="192,80,256,80,256,86,192,86"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="266,120,345,145"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="192,94,253,113,251,118,191,99"/>
-</map>
diff --git a/d6/d7a/golden__search__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/d6/d7a/golden__search__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
deleted file mode 100644
index e6f54d845..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e617e5ed265c3778b69e3bd67b7b784e
\ No newline at end of file
diff --git a/d6/d7a/golden__search__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/d6/d7a/golden__search__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
deleted file mode 100644
index 806925d27..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
+++ /dev/null
@@ -1,138 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="283pt" height="113pt"
- viewBox="0.00 0.00 282.50 112.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 108.88)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test function to find maxima for the function &#160;in the interval &#160;&#160;&#160;Expected result: .">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" target="_top" xlink:title="Get the minima of a function in the given interval. To get the maxima, simply negate the function....">
-<polygon fill="white" stroke="#666666" points="140,-56.25 73.75,-56.25 73.75,-37 140,-37 140,-56.25"/>
-<text text-anchor="middle" x="106.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-31.65C45.24,-33.23 53.75,-35.11 62.29,-37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-40.39 71.95,-39.13 62.94,-33.55 61.43,-40.39"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="133.62,-19.25 80.12,-19.25 80.12,0 133.62,0 133.62,-19.25"/>
-<text text-anchor="middle" x="106.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-23.81C47.02,-21.94 58.08,-19.63 68.66,-17.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.28,-20.86 78.35,-15.39 67.85,-14.01 69.28,-20.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.5,-104.88 176,-104.88 176,-74.38 274.5,-74.38 274.5,-104.88"/>
-<text text-anchor="start" x="184" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits</text>
-<text text-anchor="middle" x="225.25" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::infinity</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.16,-56.71C145.86,-60.66 158.53,-65.34 170.91,-69.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.64,-73.18 180.23,-73.36 172.06,-66.61 169.64,-73.18"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.25,-56.25 199.25,-56.25 199.25,-37 251.25,-37 251.25,-56.25"/>
-<text text-anchor="middle" x="225.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.29,-46.62C155.08,-46.62 172.66,-46.62 187.9,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.5,-50.13 197.5,-46.63 187.5,-43.13 187.5,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.62,-19.25 195.88,-19.25 195.88,0 254.62,0 254.62,-19.25"/>
-<text text-anchor="middle" x="225.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.67,-36.51C153.62,-32.08 170.13,-26.83 184.84,-22.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.76,-25.54 194.23,-19.17 183.64,-18.86 185.76,-25.54"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d7a/golden__search__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/d6/d7a/golden__search__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
deleted file mode 100644
index adf285261..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
+++ /dev/null
@@ -1,112 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="283pt" height="113pt"
- viewBox="0.00 0.00 282.50 112.88" 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 108.88)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test function to find maxima for the function &#160;in the interval &#160;&#160;&#160;Expected result: .">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" target="_top" xlink:title="Get the minima of a function in the given interval. To get the maxima, simply negate the function....">
-<polygon fill="white" stroke="#666666" points="140,-56.25 73.75,-56.25 73.75,-37 140,-37 140,-56.25"/>
-<text text-anchor="middle" x="106.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-31.65C45.24,-33.23 53.75,-35.11 62.29,-37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-40.39 71.95,-39.13 62.94,-33.55 61.43,-40.39"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="133.62,-19.25 80.12,-19.25 80.12,0 133.62,0 133.62,-19.25"/>
-<text text-anchor="middle" x="106.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-23.81C47.02,-21.94 58.08,-19.63 68.66,-17.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.28,-20.86 78.35,-15.39 67.85,-14.01 69.28,-20.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.5,-104.88 176,-104.88 176,-74.38 274.5,-74.38 274.5,-104.88"/>
-<text text-anchor="start" x="184" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits</text>
-<text text-anchor="middle" x="225.25" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::infinity</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.16,-56.71C145.86,-60.66 158.53,-65.34 170.91,-69.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.64,-73.18 180.23,-73.36 172.06,-66.61 169.64,-73.18"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.25,-56.25 199.25,-56.25 199.25,-37 251.25,-37 251.25,-56.25"/>
-<text text-anchor="middle" x="225.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.29,-46.62C155.08,-46.62 172.66,-46.62 187.9,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.5,-50.13 197.5,-46.63 187.5,-43.13 187.5,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.62,-19.25 195.88,-19.25 195.88,0 254.62,0 254.62,-19.25"/>
-<text text-anchor="middle" x="225.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.67,-36.51C153.62,-32.08 170.13,-26.83 184.84,-22.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.76,-25.54 194.23,-19.17 183.64,-18.86 185.76,-25.54"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d7a/golden__search__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/d6/d7a/golden__search__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
deleted file mode 100644
index d4d16f021..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="test1" name="test1">
-<area shape="rect" id="Node000001" title="Test function to find minima for the function &#160;in the interval &#160;&#160;&#160;Expected result = 2." alt="" coords="5,70,56,96"/>
-<area shape="rect" id="Node000002" href="$d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" title="Get the minima of a function in the given interval. To get the maxima, simply negate the function...." alt="" coords="104,70,192,96"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,80,88,80,88,86,56,86"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/numeric_limits/infinity.html#" title=" " alt="" coords="240,5,371,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="185,67,232,49,234,54,186,72"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="271,70,340,96"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="192,80,256,80,256,86,192,86"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="266,120,345,145"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="192,94,253,113,251,118,191,99"/>
-</map>
diff --git a/d6/d7a/golden__search__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/d6/d7a/golden__search__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
deleted file mode 100644
index ec0b67755..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9a95ea3efc42196f587b59f13d148dd1
\ No newline at end of file
diff --git a/d6/d7a/golden__search__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg b/d6/d7a/golden__search__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
deleted file mode 100644
index 1d5ee00e9..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="283pt" height="113pt"
- viewBox="0.00 0.00 282.50 112.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 108.88)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test function to find minima for the function &#160;in the interval &#160;&#160;&#160;Expected result = 2.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-56.25 0,-56.25 0,-37 37.75,-37 37.75,-56.25"/>
-<text text-anchor="middle" x="18.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" target="_top" xlink:title="Get the minima of a function in the given interval. To get the maxima, simply negate the function....">
-<polygon fill="white" stroke="#666666" points="140,-56.25 73.75,-56.25 73.75,-37 140,-37 140,-56.25"/>
-<text text-anchor="middle" x="106.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-46.62C45.16,-46.62 53.56,-46.62 62.01,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.91,-50.13 71.91,-46.63 61.91,-43.13 61.91,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.5,-104.88 176,-104.88 176,-74.38 274.5,-74.38 274.5,-104.88"/>
-<text text-anchor="start" x="184" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits</text>
-<text text-anchor="middle" x="225.25" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::infinity</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.16,-56.71C145.86,-60.66 158.53,-65.34 170.91,-69.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.64,-73.18 180.23,-73.36 172.06,-66.61 169.64,-73.18"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.25,-56.25 199.25,-56.25 199.25,-37 251.25,-37 251.25,-56.25"/>
-<text text-anchor="middle" x="225.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.29,-46.62C155.08,-46.62 172.66,-46.62 187.9,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.5,-50.13 197.5,-46.63 187.5,-43.13 187.5,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.62,-19.25 195.88,-19.25 195.88,0 254.62,0 254.62,-19.25"/>
-<text text-anchor="middle" x="225.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.67,-36.51C153.62,-32.08 170.13,-26.83 184.84,-22.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.76,-25.54 194.23,-19.17 183.64,-18.86 185.76,-25.54"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d7a/golden__search__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/d6/d7a/golden__search__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
deleted file mode 100644
index 9490d4d73..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="283pt" height="113pt"
- viewBox="0.00 0.00 282.50 112.88" 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 108.88)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test function to find minima for the function &#160;in the interval &#160;&#160;&#160;Expected result = 2.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-56.25 0,-56.25 0,-37 37.75,-37 37.75,-56.25"/>
-<text text-anchor="middle" x="18.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" target="_top" xlink:title="Get the minima of a function in the given interval. To get the maxima, simply negate the function....">
-<polygon fill="white" stroke="#666666" points="140,-56.25 73.75,-56.25 73.75,-37 140,-37 140,-56.25"/>
-<text text-anchor="middle" x="106.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-46.62C45.16,-46.62 53.56,-46.62 62.01,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.91,-50.13 71.91,-46.63 61.91,-43.13 61.91,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.5,-104.88 176,-104.88 176,-74.38 274.5,-74.38 274.5,-104.88"/>
-<text text-anchor="start" x="184" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits</text>
-<text text-anchor="middle" x="225.25" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::infinity</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.16,-56.71C145.86,-60.66 158.53,-65.34 170.91,-69.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.64,-73.18 180.23,-73.36 172.06,-66.61 169.64,-73.18"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.25,-56.25 199.25,-56.25 199.25,-37 251.25,-37 251.25,-56.25"/>
-<text text-anchor="middle" x="225.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.29,-46.62C155.08,-46.62 172.66,-46.62 187.9,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.5,-50.13 197.5,-46.63 187.5,-43.13 187.5,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.62,-19.25 195.88,-19.25 195.88,0 254.62,0 254.62,-19.25"/>
-<text text-anchor="middle" x="225.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.67,-36.51C153.62,-32.08 170.13,-26.83 184.84,-22.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.76,-25.54 194.23,-19.17 183.64,-18.86 185.76,-25.54"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d7a/golden__search__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.map b/d6/d7a/golden__search__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.map
deleted file mode 100644
index 7a3d22872..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="get_minima" name="get_minima">
-<area shape="rect" id="Node000001" title="Get the minima of a function in the given interval. To get the maxima, simply negate the function...." alt="" coords="5,70,94,96"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/numeric_limits/infinity.html#" title=" " alt="" coords="142,5,273,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="86,67,134,49,136,54,88,72"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="173,70,242,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="94,80,158,80,158,86,94,86"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="168,120,246,145"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="94,94,154,113,153,118,92,99"/>
-</map>
diff --git a/d6/d7a/golden__search__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.md5 b/d6/d7a/golden__search__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.md5
deleted file mode 100644
index 2db69c789..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cf939fa12ff88e0676cc991d48e244de
\ No newline at end of file
diff --git a/d6/d7a/golden__search__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.svg b/d6/d7a/golden__search__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.svg
deleted file mode 100644
index 982a2bf66..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: get_minima Pages: 1 -->
-<svg width="209pt" height="113pt"
- viewBox="0.00 0.00 208.75 112.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 108.88)">
-<title>get_minima</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get the minima of a function in the given interval. To get the maxima, simply negate the function....">
-<polygon fill="#999999" stroke="#666666" points="66.25,-56.25 0,-56.25 0,-37 66.25,-37 66.25,-56.25"/>
-<text text-anchor="middle" x="33.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.75,-104.88 102.25,-104.88 102.25,-74.38 200.75,-74.38 200.75,-104.88"/>
-<text text-anchor="start" x="110.25" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits</text>
-<text text-anchor="middle" x="151.5" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::infinity</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.41,-56.71C72.11,-60.66 84.78,-65.34 97.16,-69.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.89,-73.18 106.48,-73.36 98.31,-66.61 95.89,-73.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.5,-56.25 125.5,-56.25 125.5,-37 177.5,-37 177.5,-56.25"/>
-<text text-anchor="middle" x="151.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.54,-46.62C81.33,-46.62 98.91,-46.62 114.15,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="113.75,-50.13 123.75,-46.63 113.75,-43.13 113.75,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="180.88,-19.25 122.12,-19.25 122.12,0 180.88,0 180.88,-19.25"/>
-<text text-anchor="middle" x="151.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M65.92,-36.51C79.87,-32.08 96.38,-26.83 111.09,-22.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="112.01,-25.54 120.48,-19.17 109.89,-18.86 112.01,-25.54"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d7a/golden__search__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph_org.svg b/d6/d7a/golden__search__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph_org.svg
deleted file mode 100644
index ba6f32a2d..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph_org.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: get_minima Pages: 1 -->
-<svg width="209pt" height="113pt"
- viewBox="0.00 0.00 208.75 112.88" 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 108.88)">
-<title>get_minima</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get the minima of a function in the given interval. To get the maxima, simply negate the function....">
-<polygon fill="#999999" stroke="#666666" points="66.25,-56.25 0,-56.25 0,-37 66.25,-37 66.25,-56.25"/>
-<text text-anchor="middle" x="33.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.75,-104.88 102.25,-104.88 102.25,-74.38 200.75,-74.38 200.75,-104.88"/>
-<text text-anchor="start" x="110.25" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits</text>
-<text text-anchor="middle" x="151.5" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::infinity</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.41,-56.71C72.11,-60.66 84.78,-65.34 97.16,-69.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.89,-73.18 106.48,-73.36 98.31,-66.61 95.89,-73.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.5,-56.25 125.5,-56.25 125.5,-37 177.5,-37 177.5,-56.25"/>
-<text text-anchor="middle" x="151.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.54,-46.62C81.33,-46.62 98.91,-46.62 114.15,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="113.75,-50.13 123.75,-46.63 113.75,-43.13 113.75,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="180.88,-19.25 122.12,-19.25 122.12,0 180.88,0 180.88,-19.25"/>
-<text text-anchor="middle" x="151.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M65.92,-36.51C79.87,-32.08 96.38,-26.83 111.09,-22.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="112.01,-25.54 120.48,-19.17 109.89,-18.86 112.01,-25.54"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d7a/golden__search__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map b/d6/d7a/golden__search__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
deleted file mode 100644
index 52f5d1c68..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="test3" name="test3">
-<area shape="rect" id="Node000001" title="Test function to find maxima for the function &#160;in the interval &#160;&#160;&#160;Expected result: ." alt="" coords="5,46,56,72"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/cos.html#" title=" " alt="" coords="114,21,182,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,51,98,42,99,47,57,56"/>
-<area shape="rect" id="Node000003" href="$d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" title="Get the minima of a function in the given interval. To get the maxima, simply negate the function...." alt="" coords="104,70,192,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="57,61,89,68,88,73,56,67"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/numeric_limits/infinity.html#" title=" " alt="" coords="240,5,371,46"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="185,67,232,49,234,54,186,72"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="271,70,340,96"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="192,80,256,80,256,86,192,86"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="266,120,345,145"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="192,94,253,113,251,118,191,99"/>
-</map>
diff --git a/d6/d7a/golden__search__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 b/d6/d7a/golden__search__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
deleted file mode 100644
index e3d0e9e97..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b646ec3d2d445c4068e5c7659cca0b93
\ No newline at end of file
diff --git a/d6/d7a/golden__search__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg b/d6/d7a/golden__search__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
deleted file mode 100644
index ff636bc3b..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
+++ /dev/null
@@ -1,138 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<svg width="283pt" height="113pt"
- viewBox="0.00 0.00 282.50 112.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 108.88)">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test function to find maxima for the function &#160;in the interval &#160;&#160;&#160;Expected result: .">
-<polygon fill="#999999" stroke="#666666" points="37.75,-74.25 0,-74.25 0,-55 37.75,-55 37.75,-74.25"/>
-<text text-anchor="middle" x="18.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-93.25 81.25,-93.25 81.25,-74 132.5,-74 132.5,-93.25"/>
-<text text-anchor="middle" x="106.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-68.65C47.34,-70.69 58.86,-73.24 69.78,-75.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.81,-79.02 79.33,-77.76 70.33,-72.19 68.81,-79.02"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" target="_top" xlink:title="Get the minima of a function in the given interval. To get the maxima, simply negate the function....">
-<polygon fill="white" stroke="#666666" points="140,-56.25 73.75,-56.25 73.75,-37 140,-37 140,-56.25"/>
-<text text-anchor="middle" x="106.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-60.81C45.24,-59.32 53.75,-57.53 62.29,-55.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.87,-59.2 71.94,-53.73 61.44,-52.35 62.87,-59.2"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.5,-104.88 176,-104.88 176,-74.38 274.5,-74.38 274.5,-104.88"/>
-<text text-anchor="start" x="184" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits</text>
-<text text-anchor="middle" x="225.25" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::infinity</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.16,-56.71C145.86,-60.66 158.53,-65.34 170.91,-69.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.64,-73.18 180.23,-73.36 172.06,-66.61 169.64,-73.18"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.25,-56.25 199.25,-56.25 199.25,-37 251.25,-37 251.25,-56.25"/>
-<text text-anchor="middle" x="225.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.29,-46.62C155.08,-46.62 172.66,-46.62 187.9,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.5,-50.13 197.5,-46.63 187.5,-43.13 187.5,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.62,-19.25 195.88,-19.25 195.88,0 254.62,0 254.62,-19.25"/>
-<text text-anchor="middle" x="225.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.67,-36.51C153.62,-32.08 170.13,-26.83 184.84,-22.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.76,-25.54 194.23,-19.17 183.64,-18.86 185.76,-25.54"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d7a/golden__search__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg b/d6/d7a/golden__search__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
deleted file mode 100644
index 0ed76db1b..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
+++ /dev/null
@@ -1,112 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<svg width="283pt" height="113pt"
- viewBox="0.00 0.00 282.50 112.88" 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 108.88)">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test function to find maxima for the function &#160;in the interval &#160;&#160;&#160;Expected result: .">
-<polygon fill="#999999" stroke="#666666" points="37.75,-74.25 0,-74.25 0,-55 37.75,-55 37.75,-74.25"/>
-<text text-anchor="middle" x="18.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-93.25 81.25,-93.25 81.25,-74 132.5,-74 132.5,-93.25"/>
-<text text-anchor="middle" x="106.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-68.65C47.34,-70.69 58.86,-73.24 69.78,-75.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.81,-79.02 79.33,-77.76 70.33,-72.19 68.81,-79.02"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" target="_top" xlink:title="Get the minima of a function in the given interval. To get the maxima, simply negate the function....">
-<polygon fill="white" stroke="#666666" points="140,-56.25 73.75,-56.25 73.75,-37 140,-37 140,-56.25"/>
-<text text-anchor="middle" x="106.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-60.81C45.24,-59.32 53.75,-57.53 62.29,-55.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.87,-59.2 71.94,-53.73 61.44,-52.35 62.87,-59.2"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.5,-104.88 176,-104.88 176,-74.38 274.5,-74.38 274.5,-104.88"/>
-<text text-anchor="start" x="184" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits</text>
-<text text-anchor="middle" x="225.25" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::infinity</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.16,-56.71C145.86,-60.66 158.53,-65.34 170.91,-69.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.64,-73.18 180.23,-73.36 172.06,-66.61 169.64,-73.18"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.25,-56.25 199.25,-56.25 199.25,-37 251.25,-37 251.25,-56.25"/>
-<text text-anchor="middle" x="225.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.29,-46.62C155.08,-46.62 172.66,-46.62 187.9,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.5,-50.13 197.5,-46.63 187.5,-43.13 187.5,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.62,-19.25 195.88,-19.25 195.88,0 254.62,0 254.62,-19.25"/>
-<text text-anchor="middle" x="225.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.67,-36.51C153.62,-32.08 170.13,-26.83 184.84,-22.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.76,-25.54 194.23,-19.17 183.64,-18.86 185.76,-25.54"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d7a/golden__search__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d7a/golden__search__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index ed0d4ef63..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,23 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,70,55,96"/>
-<area shape="rect" id="Node000002" href="$d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" title="Test function to find minima for the function &#160;in the interval &#160;&#160;&#160;Expected result = 2." alt="" coords="103,70,153,96"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,80,88,80,88,86,55,86"/>
-<area shape="rect" id="Node000007" href="$d6/d7a/golden__search__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0" title="Test function to find maxima for the function &#160;in the interval &#160;&#160;&#160;Expected result: ." alt="" coords="103,21,153,46"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="54,68,88,51,90,55,56,73"/>
-<area shape="rect" id="Node000009" href="$d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" title="Test function to find maxima for the function &#160;in the interval &#160;&#160;&#160;Expected result: ." alt="" coords="103,120,153,145"/>
-<area shape="poly" id="edge9_Node000001_Node000009" title=" " alt="" coords="56,93,90,111,88,115,54,98"/>
-<area shape="rect" id="Node000003" href="$d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" title="Get the minima of a function in the given interval. To get the maxima, simply negate the function...." alt="" coords="201,70,289,96"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,80,185,80,185,86,153,86"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/numeric_limits/infinity.html#" title=" " alt="" coords="337,5,469,46"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="282,67,330,49,331,54,284,72"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="368,70,438,96"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="290,80,353,80,353,86,290,86"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="364,120,442,145"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="290,94,350,113,348,118,288,99"/>
-<area shape="poly" id="edge7_Node000007_Node000003" title=" " alt="" coords="155,42,200,61,198,66,152,47"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="210,21,281,46"/>
-<area shape="poly" id="edge8_Node000007_Node000008" title=" " alt="" coords="153,31,194,31,194,36,153,36"/>
-<area shape="poly" id="edge11_Node000009_Node000003" title=" " alt="" coords="152,119,198,100,200,105,155,124"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/cos.html#" title=" " alt="" coords="211,120,279,145"/>
-<area shape="poly" id="edge10_Node000009_Node000010" title=" " alt="" coords="153,130,195,130,195,135,153,135"/>
-</map>
diff --git a/d6/d7a/golden__search__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d7a/golden__search__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 23beb04c4..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f75e9e5636fd78b12fdac9912af94db8
\ No newline at end of file
diff --git a/d6/d7a/golden__search__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d7a/golden__search__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index d80cbe87f..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,228 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="356pt" height="113pt"
- viewBox="0.00 0.00 355.50 112.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 108.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title="Test function to find minima for the function &#160;in the interval &#160;&#160;&#160;Expected result = 2.">
-<polygon fill="white" stroke="#666666" points="110.75,-56.25 73,-56.25 73,-37 110.75,-37 110.75,-56.25"/>
-<text text-anchor="middle" x="91.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-46.62C44.55,-46.62 53.37,-46.62 61.69,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-50.13 71.43,-46.63 61.43,-43.13 61.43,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d6/d7a/golden__search__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title="Test function to find maxima for the function &#160;in the interval &#160;&#160;&#160;Expected result: .">
-<polygon fill="white" stroke="#666666" points="110.75,-93.25 73,-93.25 73,-74 110.75,-74 110.75,-93.25"/>
-<text text-anchor="middle" x="91.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-55.77C44.89,-59.79 54.18,-64.6 62.84,-69.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.11,-72.14 71.6,-73.63 64.33,-65.92 61.11,-72.14"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" target="_top" xlink:title="Test function to find maxima for the function &#160;in the interval &#160;&#160;&#160;Expected result: .">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-37.48C44.89,-33.46 54.18,-28.65 62.84,-24.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.33,-27.33 71.6,-19.62 61.11,-21.11 64.33,-27.33"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" target="_top" xlink:title="Get the minima of a function in the given interval. To get the maxima, simply negate the function....">
-<polygon fill="white" stroke="#666666" points="213,-56.25 146.75,-56.25 146.75,-37 213,-37 213,-56.25"/>
-<text text-anchor="middle" x="179.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-46.62C118.16,-46.62 126.56,-46.62 135.01,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.91,-50.13 144.91,-46.63 134.91,-43.13 134.91,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="347.5,-104.88 249,-104.88 249,-74.38 347.5,-74.38 347.5,-104.88"/>
-<text text-anchor="start" x="257" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits</text>
-<text text-anchor="middle" x="298.25" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::infinity</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M208.16,-56.71C218.86,-60.66 231.53,-65.34 243.91,-69.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="242.64,-73.18 253.23,-73.36 245.06,-66.61 242.64,-73.18"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.25,-56.25 272.25,-56.25 272.25,-37 324.25,-37 324.25,-56.25"/>
-<text text-anchor="middle" x="298.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.29,-46.62C228.08,-46.62 245.66,-46.62 260.9,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.5,-50.13 270.5,-46.63 260.5,-43.13 260.5,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="327.62,-19.25 268.88,-19.25 268.88,0 327.62,0 327.62,-19.25"/>
-<text text-anchor="middle" x="298.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M212.67,-36.51C226.62,-32.08 243.13,-26.83 257.84,-22.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.76,-25.54 267.23,-19.17 256.64,-18.86 258.76,-25.54"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge7_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge7_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-75.78C121,-71.52 133.55,-66.13 145.14,-61.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.23,-64.48 154.03,-57.31 143.47,-58.05 146.23,-64.48"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="206.62,-93.25 153.12,-93.25 153.12,-74 206.62,-74 206.62,-93.25"/>
-<text text-anchor="middle" x="179.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge8_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-83.62C119.93,-83.62 130.84,-83.62 141.32,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.32,-87.13 151.32,-83.63 141.32,-80.13 141.32,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge11_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge11_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-17.47C121,-21.73 133.55,-27.12 145.14,-32.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.47,-35.2 154.03,-35.94 146.23,-28.77 143.47,-35.2"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="205.5,-19.25 154.25,-19.25 154.25,0 205.5,0 205.5,-19.25"/>
-<text text-anchor="middle" x="179.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge10_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge10_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-9.62C120.24,-9.62 131.62,-9.62 142.43,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.3,-13.13 152.3,-9.63 142.3,-6.13 142.3,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d7a/golden__search__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/d7a/golden__search__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 0ccb4eb7d..000000000
--- a/d6/d7a/golden__search__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,202 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="356pt" height="113pt"
- viewBox="0.00 0.00 355.50 112.88" 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 108.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title="Test function to find minima for the function &#160;in the interval &#160;&#160;&#160;Expected result = 2.">
-<polygon fill="white" stroke="#666666" points="110.75,-56.25 73,-56.25 73,-37 110.75,-37 110.75,-56.25"/>
-<text text-anchor="middle" x="91.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-46.62C44.55,-46.62 53.37,-46.62 61.69,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-50.13 71.43,-46.63 61.43,-43.13 61.43,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d6/d7a/golden__search__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title="Test function to find maxima for the function &#160;in the interval &#160;&#160;&#160;Expected result: .">
-<polygon fill="white" stroke="#666666" points="110.75,-93.25 73,-93.25 73,-74 110.75,-74 110.75,-93.25"/>
-<text text-anchor="middle" x="91.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-55.77C44.89,-59.79 54.18,-64.6 62.84,-69.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.11,-72.14 71.6,-73.63 64.33,-65.92 61.11,-72.14"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" target="_top" xlink:title="Test function to find maxima for the function &#160;in the interval &#160;&#160;&#160;Expected result: .">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-37.48C44.89,-33.46 54.18,-28.65 62.84,-24.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.33,-27.33 71.6,-19.62 61.11,-21.11 64.33,-27.33"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" target="_top" xlink:title="Get the minima of a function in the given interval. To get the maxima, simply negate the function....">
-<polygon fill="white" stroke="#666666" points="213,-56.25 146.75,-56.25 146.75,-37 213,-37 213,-56.25"/>
-<text text-anchor="middle" x="179.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-46.62C118.16,-46.62 126.56,-46.62 135.01,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.91,-50.13 144.91,-46.63 134.91,-43.13 134.91,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="347.5,-104.88 249,-104.88 249,-74.38 347.5,-74.38 347.5,-104.88"/>
-<text text-anchor="start" x="257" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits</text>
-<text text-anchor="middle" x="298.25" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::infinity</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M208.16,-56.71C218.86,-60.66 231.53,-65.34 243.91,-69.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="242.64,-73.18 253.23,-73.36 245.06,-66.61 242.64,-73.18"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.25,-56.25 272.25,-56.25 272.25,-37 324.25,-37 324.25,-56.25"/>
-<text text-anchor="middle" x="298.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.29,-46.62C228.08,-46.62 245.66,-46.62 260.9,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.5,-50.13 270.5,-46.63 260.5,-43.13 260.5,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="327.62,-19.25 268.88,-19.25 268.88,0 327.62,0 327.62,-19.25"/>
-<text text-anchor="middle" x="298.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M212.67,-36.51C226.62,-32.08 243.13,-26.83 257.84,-22.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.76,-25.54 267.23,-19.17 256.64,-18.86 258.76,-25.54"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge7_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge7_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-75.78C121,-71.52 133.55,-66.13 145.14,-61.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.23,-64.48 154.03,-57.31 143.47,-58.05 146.23,-64.48"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="206.62,-93.25 153.12,-93.25 153.12,-74 206.62,-74 206.62,-93.25"/>
-<text text-anchor="middle" x="179.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge8_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-83.62C119.93,-83.62 130.84,-83.62 141.32,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.32,-87.13 151.32,-83.63 141.32,-80.13 141.32,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge11_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge11_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-17.47C121,-21.73 133.55,-27.12 145.14,-32.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.47,-35.2 154.03,-35.94 146.23,-28.77 143.47,-35.2"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="205.5,-19.25 154.25,-19.25 154.25,0 205.5,0 205.5,-19.25"/>
-<text text-anchor="middle" x="179.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge10_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge10_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-9.62C120.24,-9.62 131.62,-9.62 142.43,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.3,-13.13 152.3,-9.63 142.3,-6.13 142.3,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d7a/golden__search__extrema_8cpp_source.html b/d6/d7a/golden__search__extrema_8cpp_source.html
new file mode 100644
index 000000000..e9b38c57c
--- /dev/null
+++ b/d6/d7a/golden__search__extrema_8cpp_source.html
@@ -0,0 +1,267 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/golden_search_extrema.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/d7a/golden__search__extrema_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">golden_search_extrema.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/d7a/golden__search__extrema_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#define _USE_MATH_DEFINES  </span><span class="comment">//&lt; required for MS Visual C++</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;functional&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;limits&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"><a class="line" href="../../d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">   18</a></span><span class="preprocessor">#define EPSILON 1e-7  </span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="foldopen" id="foldopen00030" data-start="{" data-end="}">
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"><a class="line" href="../../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">   30</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a>(<span class="keyword">const</span> std::function&lt;<span class="keywordtype">double</span>(<span class="keywordtype">double</span>)&gt; &amp;f, <span class="keywordtype">double</span> lim_a,</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>                  <span class="keywordtype">double</span> lim_b) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    uint32_t iters = 0;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordtype">double</span> c, d;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordtype">double</span> prev_mean, mean = std::numeric_limits&lt;double&gt;::infinity();</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="comment">// golden ratio value</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> M_GOLDEN_RATIO = (1.f + std::sqrt(5.f)) / 2.f;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="comment">// ensure that lim_a &lt; lim_b</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">if</span> (lim_a &gt; lim_b) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        std::swap(lim_a, lim_b);</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (std::abs(lim_a - lim_b) &lt;= <a class="code hl_define" href="../../d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Search range must be greater than &quot;</span> &lt;&lt; <a class="code hl_define" href="../../d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="keywordflow">return</span> lim_a;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        prev_mean = mean;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="comment">// compute the section ratio width</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        <span class="keywordtype">double</span> ratio = (lim_b - lim_a) / M_GOLDEN_RATIO;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        c = lim_b - ratio;  <span class="comment">// right-side section start</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        d = lim_a + ratio;  <span class="comment">// left-side section end</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="keywordflow">if</span> (f(c) &lt; f(d)) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            <span class="comment">// select left section</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            lim_b = d;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            <span class="comment">// selct right section</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            lim_a = c;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        }</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        mean = (lim_a + lim_b) / 2.f;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        iters++;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="comment">// continue till the interval width is greater than sqrt(system epsilon)</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    } <span class="keywordflow">while</span> (std::abs(lim_a - lim_b) &gt; <a class="code hl_define" href="../../d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; (iters: &quot;</span> &lt;&lt; iters &lt;&lt; <span class="stringliteral">&quot;) &quot;</span>;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keywordflow">return</span> prev_mean;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>}</div>
+</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="foldopen" id="foldopen00079" data-start="{" data-end="}">
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="../../d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">   79</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>() {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="comment">// define the function to minimize as a lambda function</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    std::function&lt;double(<span class="keywordtype">double</span>)&gt; f1 = [](<span class="keywordtype">double</span> x) {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <span class="keywordflow">return</span> (x - 2) * (x - 2);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    };</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1.... &quot;</span>;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="keywordtype">double</span> minima = <a class="code hl_function" href="../../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a>(f1, 1, 5);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::cout &lt;&lt; minima &lt;&lt; <span class="stringliteral">&quot;...&quot;</span>;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    assert(std::abs(minima - 2) &lt; <a class="code hl_define" href="../../d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>);</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>}</div>
+</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="foldopen" id="foldopen00101" data-start="{" data-end="}">
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"><a class="line" href="../../d6/d7a/golden__search__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0">  101</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d7a/golden__search__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>() {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="comment">// define the function to maximize as a lambda function</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="comment">// since we are maximixing, we negated the function return value</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::function&lt;double(<span class="keywordtype">double</span>)&gt; func = [](<span class="keywordtype">double</span> x) {</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        <span class="keywordflow">return</span> -std::pow(x, 1.f / x);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    };</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2.... &quot;</span>;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordtype">double</span> minima = <a class="code hl_function" href="../../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a>(func, -2, 10);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    std::cout &lt;&lt; minima &lt;&lt; <span class="stringliteral">&quot; (&quot;</span> &lt;&lt; M_E &lt;&lt; <span class="stringliteral">&quot;)...&quot;</span>;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    assert(std::abs(minima - M_E) &lt; <a class="code hl_define" href="../../d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>);</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>}</div>
+</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span> </div>
+<div class="foldopen" id="foldopen00124" data-start="{" data-end="}">
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"><a class="line" href="../../d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">  124</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a>() {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    <span class="comment">// define the function to maximize as a lambda function</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <span class="comment">// since we are maximixing, we negated the function return value</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    std::function&lt;double(<span class="keywordtype">double</span>)&gt; func = [](<span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> std::cos(x); };</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3.... &quot;</span>;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <span class="keywordtype">double</span> minima = <a class="code hl_function" href="../../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a>(func, -4, 12);</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    std::cout &lt;&lt; minima &lt;&lt; <span class="stringliteral">&quot; (&quot;</span> &lt;&lt; M_PI &lt;&lt; <span class="stringliteral">&quot;)...&quot;</span>;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    assert(std::abs(minima - M_PI) &lt; <a class="code hl_define" href="../../d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>);</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>}</div>
+</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
+<div class="foldopen" id="foldopen00140" data-start="{" data-end="}">
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"><a class="line" href="../../d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  140</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    std::cout.precision(9);</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span> </div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Computations performed with machine epsilon: &quot;</span> &lt;&lt; <a class="code hl_define" href="../../d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span> </div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    <a class="code hl_function" href="../../d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    <a class="code hl_function" href="../../d6/d7a/golden__search__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>();</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    <a class="code hl_function" href="../../d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a>();</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span> </div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>}</div>
+</div>
+<div class="ttc" id="agolden__search__extrema_8cpp_html_a002b2f4894492820fe708b1b7e7c5e70"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div><div class="ttdeci">#define EPSILON</div><div class="ttdoc">solution accuracy limit</div><div class="ttdef"><b>Definition</b> <a href="#l00018">golden_search_extrema.cpp:18</a></div></div>
+<div class="ttc" id="agolden__search__extrema_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">Test function to find maxima for the function  in the interval    Expected result: .</div><div class="ttdef"><b>Definition</b> <a href="#l00101">golden_search_extrema.cpp:101</a></div></div>
+<div class="ttc" id="agolden__search__extrema_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">Test function to find minima for the function  in the interval    Expected result = 2.</div><div class="ttdef"><b>Definition</b> <a href="#l00079">golden_search_extrema.cpp:79</a></div></div>
+<div class="ttc" id="agolden__search__extrema_8cpp_html_a1aa76a6d5fd4d333f9072beff1dc486b"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a></div><div class="ttdeci">double get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b)</div><div class="ttdoc">Get the minima of a function in the given interval. To get the maxima, simply negate the function....</div><div class="ttdef"><b>Definition</b> <a href="#l00030">golden_search_extrema.cpp:30</a></div></div>
+<div class="ttc" id="agolden__search__extrema_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">Test function to find maxima for the function  in the interval    Expected result: .</div><div class="ttdef"><b>Definition</b> <a href="#l00124">golden_search_extrema.cpp:124</a></div></div>
+<div class="ttc" id="agolden__search__extrema_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00140">golden_search_extrema.cpp:140</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../d6/d7a/golden__search__extrema_8cpp.html">golden_search_extrema.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/d80/double__hash__hash__table_8cpp.html b/d6/d80/double__hash__hash__table_8cpp.html
index 195eced74..f883e4b2b 100644
--- a/d6/d80/double__hash__hash__table_8cpp.html
+++ b/d6/d80/double__hash__hash__table_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: hashing/double_hash_hash_table.cpp File Reference</title>
+<title>TheAlgorithms/C++: hashing/double_hash_hash_table.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for double_hash_hash_table.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dda/double__hash__hash__table_8cpp__incl.svg" width="255" height="126"><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">
+</div>
+<p><a href="../../d6/d80/double__hash__hash__table_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">double_hashing::Entry</a></td></tr>
@@ -138,8 +157,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="typedef-members" name="typedef-members"></a>
 Typedefs</h2></td></tr>
-<tr class="memitem:a92054ec26cd6907c163fb00a596bebdd" id="r_a92054ec26cd6907c163fb00a596bebdd"><td class="memItemLeft" align="right" valign="top"><a id="a92054ec26cd6907c163fb00a596bebdd" name="a92054ec26cd6907c163fb00a596bebdd"></a>
-using&#160;</td><td class="memItemRight" valign="bottom"><b>double_hashing::Entry</b> = struct Entry</td></tr>
+<tr class="memitem:a92054ec26cd6907c163fb00a596bebdd" id="r_a92054ec26cd6907c163fb00a596bebdd"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a92054ec26cd6907c163fb00a596bebdd">double_hashing::Entry</a> = struct Entry</td></tr>
 <tr class="separator:a92054ec26cd6907c163fb00a596bebdd"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
@@ -151,7 +169,7 @@ Functions</h2></td></tr>
 <tr class="memitem:a79a9c914a6c68275b3640303d7faad8a" id="r_a79a9c914a6c68275b3640303d7faad8a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a">double_hashing::add</a> (int key)</td></tr>
 <tr class="separator:a79a9c914a6c68275b3640303d7faad8a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a0d90726ed1de7b3d2ae261baed048003" id="r_a0d90726ed1de7b3d2ae261baed048003"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">double_hashing::hashFxn</a> (int key)</td></tr>
-<tr class="memdesc:a0d90726ed1de7b3d2ae261baed048003"><td class="mdescLeft">&#160;</td><td class="mdescRight">Hash a key. Uses the STL library's <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash()</a></code> function.  <br /></td></tr>
+<tr class="memdesc:a0d90726ed1de7b3d2ae261baed048003"><td class="mdescLeft">&#160;</td><td class="mdescRight">Hash a key. Uses the STL library's <code>std::hash()</code> function.  <br /></td></tr>
 <tr class="separator:a0d90726ed1de7b3d2ae261baed048003"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a33968a1178289ab61445dd4000df7082" id="r_a33968a1178289ab61445dd4000df7082"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082">double_hashing::otherHashFxn</a> (int key)</td></tr>
 <tr class="memdesc:a33968a1178289ab61445dd4000df7082"><td class="mdescLeft">&#160;</td><td class="mdescRight">Used for second hash function.  <br /></td></tr>
@@ -174,23 +192,17 @@ Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:a77d33a0c49294b9ec22ad86eeff79585" id="r_a77d33a0c49294b9ec22ad86eeff79585"><td class="memItemLeft" align="right" valign="top"><a id="a77d33a0c49294b9ec22ad86eeff79585" name="a77d33a0c49294b9ec22ad86eeff79585"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>double_hashing::notPresent</b></td></tr>
+<tr class="memitem:a77d33a0c49294b9ec22ad86eeff79585" id="r_a77d33a0c49294b9ec22ad86eeff79585"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a77d33a0c49294b9ec22ad86eeff79585">double_hashing::notPresent</a></td></tr>
 <tr class="separator:a77d33a0c49294b9ec22ad86eeff79585"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0e2ff0f9cfc7b54e60a6561f792d8b26" id="r_a0e2ff0f9cfc7b54e60a6561f792d8b26"><td class="memItemLeft" align="right" valign="top"><a id="a0e2ff0f9cfc7b54e60a6561f792d8b26" name="a0e2ff0f9cfc7b54e60a6561f792d8b26"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>double_hashing::table</b></td></tr>
+<tr class="memitem:a0e2ff0f9cfc7b54e60a6561f792d8b26" id="r_a0e2ff0f9cfc7b54e60a6561f792d8b26"><td class="memItemLeft" align="right" valign="top">std::vector&lt; <a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a0e2ff0f9cfc7b54e60a6561f792d8b26">double_hashing::table</a></td></tr>
 <tr class="separator:a0e2ff0f9cfc7b54e60a6561f792d8b26"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a60a52265027518b25655d730f960013a" id="r_a60a52265027518b25655d730f960013a"><td class="memItemLeft" align="right" valign="top"><a id="a60a52265027518b25655d730f960013a" name="a60a52265027518b25655d730f960013a"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>double_hashing::totalSize</b></td></tr>
+<tr class="memitem:a60a52265027518b25655d730f960013a" id="r_a60a52265027518b25655d730f960013a"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a60a52265027518b25655d730f960013a">double_hashing::totalSize</a></td></tr>
 <tr class="separator:a60a52265027518b25655d730f960013a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a4e9a7219d34e781e4e73d74a968b26c1" id="r_a4e9a7219d34e781e4e73d74a968b26c1"><td class="memItemLeft" align="right" valign="top"><a id="a4e9a7219d34e781e4e73d74a968b26c1" name="a4e9a7219d34e781e4e73d74a968b26c1"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>double_hashing::tomb</b> = -1</td></tr>
+<tr class="memitem:a4e9a7219d34e781e4e73d74a968b26c1" id="r_a4e9a7219d34e781e4e73d74a968b26c1"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a4e9a7219d34e781e4e73d74a968b26c1">double_hashing::tomb</a> = -1</td></tr>
 <tr class="separator:a4e9a7219d34e781e4e73d74a968b26c1"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a5f5323b52037218cf5ae888778b7f980" id="r_a5f5323b52037218cf5ae888778b7f980"><td class="memItemLeft" align="right" valign="top"><a id="a5f5323b52037218cf5ae888778b7f980" name="a5f5323b52037218cf5ae888778b7f980"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>double_hashing::size</b></td></tr>
+<tr class="memitem:a5f5323b52037218cf5ae888778b7f980" id="r_a5f5323b52037218cf5ae888778b7f980"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#a5f5323b52037218cf5ae888778b7f980">double_hashing::size</a></td></tr>
 <tr class="separator:a5f5323b52037218cf5ae888778b7f980"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae5d042a7f6038a2ec9e5718d0c7fb31f" id="r_ae5d042a7f6038a2ec9e5718d0c7fb31f"><td class="memItemLeft" align="right" valign="top"><a id="ae5d042a7f6038a2ec9e5718d0c7fb31f" name="ae5d042a7f6038a2ec9e5718d0c7fb31f"></a>
-bool&#160;</td><td class="memItemRight" valign="bottom"><b>double_hashing::rehashing</b></td></tr>
+<tr class="memitem:ae5d042a7f6038a2ec9e5718d0c7fb31f" id="r_ae5d042a7f6038a2ec9e5718d0c7fb31f"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d65/namespacedouble__hashing.html#ae5d042a7f6038a2ec9e5718d0c7fb31f">double_hashing::rehashing</a></td></tr>
 <tr class="separator:ae5d042a7f6038a2ec9e5718d0c7fb31f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -199,6 +211,8 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>double_hashing::rehas
 <dd>
 <a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
 <dl class="section note"><dt>Note</dt><dd>The implementation can be optimized by using OOP style. </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -215,46 +229,48 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>double_hashing::rehas
       </table>
 </div><div class="memdoc">
 <p>Main program </p><dl class="section return"><dt>Returns</dt><dd>0 on success </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00250">250</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  250</span>           {</div>
 <div class="line"><span class="lineno">  251</span>    <span class="keywordtype">int</span> cmd = 0, <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hash</a> = 0, key = 0;</div>
-<div class="line"><span class="lineno">  252</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the initial size of Hash Table. = &quot;</span>;</div>
-<div class="line"><span class="lineno">  253</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; totalSize;</div>
-<div class="line"><span class="lineno">  254</span>    table = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Entry&gt;</a>(totalSize);</div>
+<div class="line"><span class="lineno">  252</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the initial size of Hash Table. = &quot;</span>;</div>
+<div class="line"><span class="lineno">  253</span>    std::cin &gt;&gt; totalSize;</div>
+<div class="line"><span class="lineno">  254</span>    table = std::vector&lt;Entry&gt;(totalSize);</div>
 <div class="line"><span class="lineno">  255</span>    <span class="keywordtype">bool</span> loop = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  256</span>    <span class="keywordflow">while</span> (loop) {</div>
-<div class="line"><span class="lineno">  257</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  258</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;PLEASE CHOOSE -&quot;</span> &lt;&lt; <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">  259</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1. Add key. (Numeric only)&quot;</span> &lt;&lt; <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">  260</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2. Remove key.&quot;</span> &lt;&lt; <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">  261</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;3. Find key.&quot;</span> &lt;&lt; <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">  262</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;4. Generate Hash. (Numeric only)&quot;</span> &lt;&lt; <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">  263</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;5. Display Hash table.&quot;</span> &lt;&lt; <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">  264</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;6. Exit.&quot;</span> &lt;&lt; <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">  265</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; cmd;</div>
+<div class="line"><span class="lineno">  257</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  258</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;PLEASE CHOOSE -&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  259</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;1. Add key. (Numeric only)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  260</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;2. Remove key.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  261</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;3. Find key.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  262</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;4. Generate Hash. (Numeric only)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  263</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;5. Display Hash table.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  264</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;6. Exit.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  265</span>        std::cin &gt;&gt; cmd;</div>
 <div class="line"><span class="lineno">  266</span>        <span class="keywordflow">switch</span> (cmd) {</div>
 <div class="line"><span class="lineno">  267</span>            <span class="keywordflow">case</span> 1:</div>
-<div class="line"><span class="lineno">  268</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter key to add = &quot;</span>;</div>
-<div class="line"><span class="lineno">  269</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; key;</div>
+<div class="line"><span class="lineno">  268</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter key to add = &quot;</span>;</div>
+<div class="line"><span class="lineno">  269</span>                std::cin &gt;&gt; key;</div>
 <div class="line"><span class="lineno">  270</span>                <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560">double_hashing::addInfo</a>(key);</div>
 <div class="line"><span class="lineno">  271</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  272</span>            <span class="keywordflow">case</span> 2:</div>
-<div class="line"><span class="lineno">  273</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter key to remove = &quot;</span>;</div>
-<div class="line"><span class="lineno">  274</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; key;</div>
+<div class="line"><span class="lineno">  273</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter key to remove = &quot;</span>;</div>
+<div class="line"><span class="lineno">  274</span>                std::cin &gt;&gt; key;</div>
 <div class="line"><span class="lineno">  275</span>                <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824">double_hashing::removalInfo</a>(key);</div>
 <div class="line"><span class="lineno">  276</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  277</span>            <span class="keywordflow">case</span> 3: {</div>
-<div class="line"><span class="lineno">  278</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter key to search = &quot;</span>;</div>
-<div class="line"><span class="lineno">  279</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; key;</div>
+<div class="line"><span class="lineno">  278</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter key to search = &quot;</span>;</div>
+<div class="line"><span class="lineno">  279</span>                std::cin &gt;&gt; key;</div>
 <div class="line"><span class="lineno">  280</span>                <a class="code hl_struct" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> entry = table[<a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">double_hashing::doubleHash</a>(key, <span class="keyword">true</span>)];</div>
 <div class="line"><span class="lineno">  281</span>                <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a> == double_hashing::notPresent) {</div>
-<div class="line"><span class="lineno">  282</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Key not present&quot;</span>;</div>
+<div class="line"><span class="lineno">  282</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;Key not present&quot;</span>;</div>
 <div class="line"><span class="lineno">  283</span>                }</div>
 <div class="line"><span class="lineno">  284</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  285</span>            }</div>
 <div class="line"><span class="lineno">  286</span>            <span class="keywordflow">case</span> 4:</div>
-<div class="line"><span class="lineno">  287</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter element to generate hash = &quot;</span>;</div>
-<div class="line"><span class="lineno">  288</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; key;</div>
-<div class="line"><span class="lineno">  289</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hash of &quot;</span> &lt;&lt; key</div>
+<div class="line"><span class="lineno">  287</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter element to generate hash = &quot;</span>;</div>
+<div class="line"><span class="lineno">  288</span>                std::cin &gt;&gt; key;</div>
+<div class="line"><span class="lineno">  289</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Hash of &quot;</span> &lt;&lt; key</div>
 <div class="line"><span class="lineno">  290</span>                          &lt;&lt; <span class="stringliteral">&quot; is = &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">double_hashing::hashFxn</a>(key);</div>
 <div class="line"><span class="lineno">  291</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  292</span>            <span class="keywordflow">case</span> 5:</div>
@@ -265,28 +281,19 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>double_hashing::rehas
 <div class="line"><span class="lineno">  297</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  298</span>                <span class="comment">// delete[] table;</span></div>
 <div class="line"><span class="lineno">  299</span>        }</div>
-<div class="line"><span class="lineno">  300</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  300</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  301</span>    }</div>
 <div class="line"><span class="lineno">  302</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  303</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> md5.cpp:288</div></div>
-<div class="ttc" id="anamespacedouble__hashing_html_a0d90726ed1de7b3d2ae261baed048003"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">double_hashing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdoc">Hash a key. Uses the STL library's std::hash() function.</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:47</div></div>
-<div class="ttc" id="anamespacedouble__hashing_html_a1e901418c759627557eff359b8db38cd"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">double_hashing::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:143</div></div>
-<div class="ttc" id="anamespacedouble__hashing_html_a5d06e4598569526294f10104875f6824"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824">double_hashing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:227</div></div>
-<div class="ttc" id="anamespacedouble__hashing_html_a8f8ff4fb018e1bb32d67d8a1885d3200"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">double_hashing::doubleHash</a></div><div class="ttdeci">int doubleHash(int key, bool searching)</div><div class="ttdoc">Performs double hashing to resolve collisions.</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:71</div></div>
-<div class="ttc" id="anamespacedouble__hashing_html_a9c652b2e467e5d250dfe3bed83b12560"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560">double_hashing::addInfo</a></div><div class="ttdeci">void addInfo(int key)</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:212</div></div>
-<div class="ttc" id="astructdouble__hashing_1_1_entry_html"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html">double_hashing::Entry</a></div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:36</div></div>
-<div class="ttc" id="astructdouble__hashing_1_1_entry_html_ae114967c89dbba3b754dc4976bba3248"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">double_hashing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:38</div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d6/d80/double__hash__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d96/md5_8cpp_source.html#l00288">md5.cpp:288</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_a0d90726ed1de7b3d2ae261baed048003"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">double_hashing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdoc">Hash a key. Uses the STL library's std::hash() function.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00047">double_hash_hash_table.cpp:47</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_a1e901418c759627557eff359b8db38cd"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">double_hashing::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00143">double_hash_hash_table.cpp:143</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_a5d06e4598569526294f10104875f6824"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824">double_hashing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00227">double_hash_hash_table.cpp:227</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_a8f8ff4fb018e1bb32d67d8a1885d3200"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">double_hashing::doubleHash</a></div><div class="ttdeci">int doubleHash(int key, bool searching)</div><div class="ttdoc">Performs double hashing to resolve collisions.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00071">double_hash_hash_table.cpp:71</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_a9c652b2e467e5d250dfe3bed83b12560"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560">double_hashing::addInfo</a></div><div class="ttdeci">void addInfo(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00212">double_hash_hash_table.cpp:212</a></div></div>
+<div class="ttc" id="astructdouble__hashing_1_1_entry_html"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html">double_hashing::Entry</a></div><div class="ttdef"><b>Definition</b> <a href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00036">double_hash_hash_table.cpp:36</a></div></div>
+<div class="ttc" id="astructdouble__hashing_1_1_entry_html_ae114967c89dbba3b754dc4976bba3248"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">double_hashing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00038">double_hash_hash_table.cpp:38</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d6/d80/double__hash__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d80/double__hash__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 3fc042877..000000000
--- a/d6/d80/double__hash__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,41 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,164,55,189"/>
-<area shape="rect" id="Node000002" href="$d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560" title=" " alt="" coords="115,188,278,213"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,177,100,184,99,189,55,183"/>
-<area shape="rect" id="Node000004" href="$d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200" title="Performs double hashing to resolve collisions." alt="" coords="548,290,737,316"/>
-<area shape="poly" id="edge17_Node000001_Node000004" title=" " alt="" coords="48,188,73,207,104,223,158,242,215,258,329,280,439,293,533,299,532,305,438,299,329,286,213,263,156,247,102,228,70,211,44,192"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="850,138,921,164"/>
-<area shape="poly" id="edge18_Node000001_Node000005" title=" " alt="" coords="35,162,59,120,78,96,101,77,161,45,214,32,338,22,451,8,541,3,584,6,630,13,680,26,738,46,773,63,807,83,861,126,857,130,804,88,771,67,736,51,678,31,628,18,584,11,541,8,452,14,338,27,214,37,163,50,104,81,82,100,64,123,40,164"/>
-<area shape="rect" id="Node000006" href="$d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" title="Hash a key. Uses the STL library&#39;s std::hash() function." alt="" coords="801,392,970,417"/>
-<area shape="poly" id="edge19_Node000001_Node000006" title=" " alt="" coords="39,189,63,233,82,258,104,280,162,320,214,349,262,368,311,380,416,393,549,404,671,411,785,408,785,414,671,416,548,410,415,399,310,386,261,373,211,353,159,324,101,284,78,262,59,236,35,191"/>
-<area shape="rect" id="Node000011" href="$d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd" title=" " alt="" coords="339,37,499,63"/>
-<area shape="poly" id="edge16_Node000001_Node000011" title=" " alt="" coords="45,161,70,142,102,123,157,101,215,84,323,60,324,65,216,89,159,106,104,128,73,146,48,165"/>
-<area shape="rect" id="Node000012" href="$d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824" title=" " alt="" coords="103,138,290,164"/>
-<area shape="poly" id="edge20_Node000001_Node000012" title=" " alt="" coords="55,170,93,164,94,170,56,175"/>
-<area shape="rect" id="Node000003" href="$d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a" title=" " alt="" coords="349,188,489,213"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="278,198,334,198,334,203,278,203"/>
-<area shape="poly" id="edge14_Node000002_Node000005" title=" " alt="" coords="256,211,349,228,469,241,535,244,603,243,671,237,736,225,768,214,799,201,852,170,854,175,801,205,770,219,737,230,671,242,603,248,535,249,469,247,348,233,255,217"/>
-<area shape="poly" id="edge15_Node000002_Node000006" title=" " alt="" coords="219,211,274,245,354,289,449,334,549,370,609,384,671,393,785,402,785,407,670,398,608,389,548,375,447,339,351,294,271,250,217,216"/>
-<area shape="poly" id="edge12_Node000002_Node000011" title=" " alt="" coords="266,185,289,174,304,163,314,152,336,124,391,71,394,75,340,128,318,155,307,167,291,179,268,189"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="457,211,501,230,604,280,601,285,499,235,455,216"/>
-<area shape="rect" id="Node000010" href="$d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d" title=" " alt="" coords="563,189,722,215"/>
-<area shape="poly" id="edge9_Node000003_Node000010" title=" " alt="" coords="490,207,548,207,548,213,490,212"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="697,287,735,269,750,256,759,243,768,229,783,213,844,170,847,174,786,217,773,232,764,246,754,259,738,273,699,292"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="696,314,738,333,753,344,762,356,772,367,786,377,800,383,798,388,783,381,768,370,758,359,749,348,735,337,694,319"/>
-<area shape="rect" id="Node000007" href="$d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" title="Used for second hash function." alt="" coords="785,228,986,253"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="691,287,784,262,812,255,813,260,785,267,692,292"/>
-<area shape="rect" id="Node000008" href="$d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" title=" " alt="" coords="798,277,973,303"/>
-<area shape="poly" id="edge7_Node000004_Node000008" title=" " alt="" coords="737,295,782,293,782,298,737,301"/>
-<area shape="rect" id="Node000009" href="$d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" title=" " alt="" coords="798,327,973,367"/>
-<area shape="poly" id="edge8_Node000004_Node000009" title=" " alt="" coords="718,314,783,326,782,331,717,319"/>
-<area shape="poly" id="edge10_Node000010_Node000003" title=" " alt="" coords="563,195,505,195,505,190,563,190"/>
-<area shape="poly" id="edge11_Node000010_Node000005" title=" " alt="" coords="707,186,834,159,835,164,708,191"/>
-<area shape="poly" id="edge13_Node000011_Node000005" title=" " alt="" coords="500,48,613,56,676,65,737,79,798,102,850,128,848,133,796,107,736,84,675,71,613,61,500,53"/>
-<area shape="poly" id="edge22_Node000012_Node000005" title=" " alt="" coords="258,135,338,123,450,116,537,115,737,130,835,141,834,146,736,135,537,121,450,121,338,128,259,140"/>
-<area shape="poly" id="edge23_Node000012_Node000006" title=" " alt="" coords="268,162,291,173,307,185,317,198,326,211,340,224,382,250,418,265,455,279,502,299,525,314,549,326,808,385,807,390,547,331,523,318,499,304,453,284,416,270,379,255,336,228,322,214,312,201,303,189,289,177,266,167"/>
-<area shape="poly" id="edge21_Node000012_Node000011" title=" " alt="" coords="222,135,337,79,368,66,370,71,339,84,224,140"/>
-<area shape="rect" id="Node000013" href="$d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931" title=" " alt="" coords="338,138,500,164"/>
-<area shape="poly" id="edge24_Node000012_Node000013" title=" " alt="" coords="290,148,322,148,322,154,290,154"/>
-<area shape="poly" id="edge25_Node000013_Node000004" title=" " alt="" coords="480,162,502,173,518,185,528,198,550,225,613,279,610,283,546,229,524,201,514,189,499,177,477,167"/>
-<area shape="poly" id="edge26_Node000013_Node000005" title=" " alt="" coords="501,148,834,148,834,154,501,154"/>
-</map>
diff --git a/d6/d80/double__hash__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d80/double__hash__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 33cec17e1..000000000
--- a/d6/d80/double__hash__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2c7198d19a085ddc392dbbebb54fec17
\ No newline at end of file
diff --git a/d6/d80/double__hash__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d80/double__hash__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 2b4023d74..000000000
--- a/d6/d80/double__hash__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,447 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 317 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 744;
-var viewHeight = 317;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-190.25 0,-190.25 0,-171 37,-171 37,-190.25"/>
-<text text-anchor="middle" x="18.5" y="-176.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.12,-172.25 82.38,-172.25 82.38,-153 204.12,-153 204.12,-172.25"/>
-<text text-anchor="middle" x="143.25" y="-158.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::addInfo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-178.01C46.55,-176.66 58.45,-174.91 70.91,-173.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.07,-176.6 80.46,-171.69 70.05,-169.67 71.07,-176.6"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200" target="_top" xlink:title="Performs double hashing to resolve collisions.">
-<polygon fill="white" stroke="#666666" points="548.5,-95.25 407.25,-95.25 407.25,-76 548.5,-76 548.5,-95.25"/>
-<text text-anchor="middle" x="477.88" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::doubleHash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge17_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge17_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.5,-170.71C40.74,-162.08 56.81,-149.98 73,-143.62 179.28,-101.93 311.82,-89.75 395.43,-86.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="395.51,-89.94 405.38,-86.09 395.26,-82.95 395.51,-89.94"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="686.75,-209.25 633.25,-209.25 633.25,-190 686.75,-190 686.75,-209.25"/>
-<text text-anchor="middle" x="660" y="-195.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge18_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge18_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.96,-190.66C31.6,-206.62 48.74,-237.61 73,-253.62 140.22,-297.98 169.49,-285.45 249.5,-294.62 381.76,-309.79 423.67,-322.89 548.5,-276.62 584.43,-263.31 619.65,-235.48 640.34,-217.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="642.59,-219.86 647.65,-210.55 637.89,-214.68 642.59,-219.86"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="723.5,-19.25 596.5,-19.25 596.5,0 723.5,0 723.5,-19.25"/>
-<text text-anchor="middle" x="660" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge19_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge19_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.7,-170.6C31.18,-153.9 48.37,-120.41 73,-101.62 195.7,-8.04 253.8,-23.97 407.25,-7.62 466.72,-1.29 534.55,-2.3 584.8,-4.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="584.54,-8.1 594.7,-5.1 584.89,-1.11 584.54,-8.1"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="370.5,-285.25 250.25,-285.25 250.25,-266 370.5,-266 370.5,-285.25"/>
-<text text-anchor="middle" x="310.38" y="-271.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge16_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge16_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.61,-190.45C40.91,-199.08 57.03,-211.36 73,-218.62 126,-242.75 190.51,-257.42 238.74,-265.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.08,-269.27 248.52,-267.48 239.24,-262.36 238.08,-269.27"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="213.5,-209.25 73,-209.25 73,-190 213.5,-190 213.5,-209.25"/>
-<text text-anchor="middle" x="143.25" y="-195.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::removalInfo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge20_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge20_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-183.39C45.29,-184.62 55.24,-186.16 65.83,-187.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.12,-191.23 75.54,-189.3 66.19,-184.31 65.12,-191.23"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="363,-172.25 257.75,-172.25 257.75,-153 363,-153 363,-172.25"/>
-<text text-anchor="middle" x="310.38" y="-158.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::add</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.33,-162.62C217.95,-162.62 232.45,-162.62 246.19,-162.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246,-166.13 256,-162.63 246,-159.13 246,-166.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge14_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge14_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.49,-152.55C262.29,-136.86 420.12,-111.47 548.5,-142.62 580.77,-150.46 614.16,-169.46 635.67,-183.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="633.69,-186.27 643.95,-188.89 637.57,-180.44 633.69,-186.27"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge15_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge15_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.46,-152.68C198.63,-127.65 306.93,-61.99 407.25,-33.62 465.48,-17.16 533.98,-11.47 584.82,-9.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="584.63,-13.23 594.52,-9.43 584.42,-6.23 584.63,-13.23"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge12_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge12_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M196.22,-172.7C202.25,-174.86 208.15,-177.47 213.5,-180.62 233.53,-192.45 233.07,-202.15 249.5,-218.62 262.91,-232.07 278.45,-246.84 290.33,-257.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.81,-260.4 297.51,-264.67 292.58,-255.28 287.81,-260.4"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M337.81,-152.58C348.3,-148.45 360.43,-143.5 371.25,-138.62 397.54,-126.79 426.79,-111.98 447.83,-101.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="449.45,-104.13 456.68,-96.39 446.2,-97.93 449.45,-104.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="537.25,-171.25 418.5,-171.25 418.5,-152 537.25,-152 537.25,-171.25"/>
-<text text-anchor="middle" x="477.88" y="-157.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::rehash</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node10 -->
-<g id="edge9_Node000003_Node000010" class="edge">
-<title>Node3&#45;&gt;Node10</title>
-<g id="a_edge9_Node000003_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M363.29,-156C377.19,-155.5 392.44,-155.29 407.13,-155.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="406.68,-158.87 416.71,-155.47 406.75,-151.87 406.68,-158.87"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M519.63,-95.65C529.57,-99.15 539.83,-103.73 548.5,-109.62 568.83,-123.45 565.97,-135.46 584.5,-151.62 598.5,-163.83 615.86,-175.2 630.3,-183.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="628.49,-186.8 638.9,-188.79 632,-180.75 628.49,-186.8"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M516.98,-75.62C527.58,-72.01 538.83,-67.38 548.5,-61.62 567.15,-50.52 565.41,-38.95 584.5,-28.62 587.95,-26.76 591.59,-25.07 595.33,-23.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="596.43,-26.87 604.64,-20.17 594.05,-20.29 596.43,-26.87"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" target="_top" xlink:title="Used for second hash function.">
-<polygon fill="white" stroke="#666666" points="735.5,-142.25 584.5,-142.25 584.5,-123 735.5,-123 735.5,-142.25"/>
-<text text-anchor="middle" x="660" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::otherHashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M514.49,-95.7C534.94,-101.41 561.12,-108.59 584.5,-114.62 591.26,-116.37 598.39,-118.16 605.44,-119.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="604.38,-123.24 614.92,-122.21 606.04,-116.44 604.38,-123.24"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="725.75,-105.25 594.25,-105.25 594.25,-86 725.75,-86 725.75,-105.25"/>
-<text text-anchor="middle" x="660" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M548.77,-89.51C559.78,-90.12 571.22,-90.75 582.37,-91.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="582.17,-94.86 592.35,-91.92 582.56,-87.88 582.17,-94.86"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="725.75,-67.88 594.25,-67.88 594.25,-37.38 725.75,-37.38 725.75,-67.88"/>
-<text text-anchor="start" x="602.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::searching</text>
-<text text-anchor="middle" x="660" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge8_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge8_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M533.9,-75.54C549.28,-72.73 566.28,-69.61 582.66,-66.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="583.18,-70.07 592.38,-64.83 581.92,-63.19 583.18,-70.07"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node3 -->
-<g id="edge10_Node000010_Node000003" class="edge">
-<title>Node10&#45;&gt;Node3</title>
-<g id="a_edge10_Node000010_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M418.23,-168.47C404.09,-168.87 388.91,-168.99 374.57,-168.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="374.86,-165.33 364.8,-168.65 374.74,-172.33 374.86,-165.33"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node5 -->
-<g id="edge11_Node000010_Node000005" class="edge">
-<title>Node10&#45;&gt;Node5</title>
-<g id="a_edge11_Node000010_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M526.67,-171.71C556.49,-178 594.31,-185.98 621.87,-191.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="621.02,-195.19 631.52,-193.83 622.46,-188.34 621.02,-195.19"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge13_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge13_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M370.87,-275.15C419.45,-273.45 489.49,-267.98 548.5,-251.62 578.7,-243.26 610.87,-227.21 632.66,-215.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="634.17,-218.32 641.15,-210.35 630.72,-212.22 634.17,-218.32"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node5 -->
-<g id="edge22_Node000012_Node000005" class="edge">
-<title>Node12&#45;&gt;Node5</title>
-<g id="a_edge22_Node000012_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.12,-209.74C208.48,-213.31 229.9,-216.87 249.5,-218.62 381.88,-230.48 415.99,-223.86 548.5,-213.62 573.06,-211.73 600.55,-208.25 621.96,-205.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="622.28,-208.73 631.68,-203.84 621.28,-201.8 622.28,-208.73"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node6 -->
-<g id="edge23_Node000012_Node000006" class="edge">
-<title>Node12&#45;&gt;Node6</title>
-<g id="a_edge23_Node000012_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M196.22,-189.55C202.25,-187.39 208.15,-184.78 213.5,-181.62 233.53,-169.8 230.64,-157.24 249.5,-143.62 297.95,-108.66 318.05,-113.82 371.25,-86.62 387.55,-78.3 390.15,-73.16 407.25,-66.62 416.39,-63.13 530.24,-37.87 601.67,-22.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="602.25,-25.63 611.27,-20.07 600.75,-18.79 602.25,-25.63"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node11 -->
-<g id="edge21_Node000012_Node000011" class="edge">
-<title>Node12&#45;&gt;Node11</title>
-<g id="a_edge21_Node000012_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.43,-209.66C184.37,-220.49 218.98,-237.99 249.5,-251.62 256.87,-254.92 264.83,-258.25 272.47,-261.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="270.97,-264.52 281.55,-264.99 273.57,-258.02 270.97,-264.52"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="371.25,-209.25 249.5,-209.25 249.5,-190 371.25,-190 371.25,-209.25"/>
-<text text-anchor="middle" x="310.38" y="-195.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::remove</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge24_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge24_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.8,-199.62C221.68,-199.62 229.71,-199.62 237.62,-199.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.55,-203.13 247.55,-199.63 237.55,-196.13 237.55,-203.13"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node4 -->
-<g id="edge25_Node000013_Node000004" class="edge">
-<title>Node13&#45;&gt;Node4</title>
-<g id="a_edge25_Node000013_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M354.78,-189.61C360.54,-187.43 366.19,-184.79 371.25,-181.62 391.25,-169.12 390.08,-158.8 407.25,-142.62 422.4,-128.35 440.64,-113.49 454.65,-102.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="456.62,-105.43 462.39,-96.54 452.34,-99.89 456.62,-105.43"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node5 -->
-<g id="edge26_Node000013_Node000005" class="edge">
-<title>Node13&#45;&gt;Node5</title>
-<g id="a_edge26_Node000013_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M371.53,-199.62C443.49,-199.62 561.74,-199.62 621.67,-199.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="621.34,-203.13 631.34,-199.63 621.34,-196.13 621.34,-203.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="double__hash__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d80/double__hash__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/d80/double__hash__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 58ca2494a..000000000
--- a/d6/d80/double__hash__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,364 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="744pt" height="317pt"
- viewBox="0.00 0.00 743.50 316.96" 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 312.96)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-190.25 0,-190.25 0,-171 37,-171 37,-190.25"/>
-<text text-anchor="middle" x="18.5" y="-176.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.12,-172.25 82.38,-172.25 82.38,-153 204.12,-153 204.12,-172.25"/>
-<text text-anchor="middle" x="143.25" y="-158.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::addInfo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-178.01C46.55,-176.66 58.45,-174.91 70.91,-173.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.07,-176.6 80.46,-171.69 70.05,-169.67 71.07,-176.6"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200" target="_top" xlink:title="Performs double hashing to resolve collisions.">
-<polygon fill="white" stroke="#666666" points="548.5,-95.25 407.25,-95.25 407.25,-76 548.5,-76 548.5,-95.25"/>
-<text text-anchor="middle" x="477.88" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::doubleHash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge17_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge17_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.5,-170.71C40.74,-162.08 56.81,-149.98 73,-143.62 179.28,-101.93 311.82,-89.75 395.43,-86.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="395.51,-89.94 405.38,-86.09 395.26,-82.95 395.51,-89.94"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="686.75,-209.25 633.25,-209.25 633.25,-190 686.75,-190 686.75,-209.25"/>
-<text text-anchor="middle" x="660" y="-195.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge18_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge18_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.96,-190.66C31.6,-206.62 48.74,-237.61 73,-253.62 140.22,-297.98 169.49,-285.45 249.5,-294.62 381.76,-309.79 423.67,-322.89 548.5,-276.62 584.43,-263.31 619.65,-235.48 640.34,-217.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="642.59,-219.86 647.65,-210.55 637.89,-214.68 642.59,-219.86"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="723.5,-19.25 596.5,-19.25 596.5,0 723.5,0 723.5,-19.25"/>
-<text text-anchor="middle" x="660" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge19_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge19_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.7,-170.6C31.18,-153.9 48.37,-120.41 73,-101.62 195.7,-8.04 253.8,-23.97 407.25,-7.62 466.72,-1.29 534.55,-2.3 584.8,-4.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="584.54,-8.1 594.7,-5.1 584.89,-1.11 584.54,-8.1"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="370.5,-285.25 250.25,-285.25 250.25,-266 370.5,-266 370.5,-285.25"/>
-<text text-anchor="middle" x="310.38" y="-271.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge16_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge16_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.61,-190.45C40.91,-199.08 57.03,-211.36 73,-218.62 126,-242.75 190.51,-257.42 238.74,-265.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.08,-269.27 248.52,-267.48 239.24,-262.36 238.08,-269.27"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="213.5,-209.25 73,-209.25 73,-190 213.5,-190 213.5,-209.25"/>
-<text text-anchor="middle" x="143.25" y="-195.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::removalInfo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge20_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge20_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-183.39C45.29,-184.62 55.24,-186.16 65.83,-187.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.12,-191.23 75.54,-189.3 66.19,-184.31 65.12,-191.23"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="363,-172.25 257.75,-172.25 257.75,-153 363,-153 363,-172.25"/>
-<text text-anchor="middle" x="310.38" y="-158.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::add</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.33,-162.62C217.95,-162.62 232.45,-162.62 246.19,-162.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246,-166.13 256,-162.63 246,-159.13 246,-166.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge14_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge14_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.49,-152.55C262.29,-136.86 420.12,-111.47 548.5,-142.62 580.77,-150.46 614.16,-169.46 635.67,-183.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="633.69,-186.27 643.95,-188.89 637.57,-180.44 633.69,-186.27"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge15_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge15_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.46,-152.68C198.63,-127.65 306.93,-61.99 407.25,-33.62 465.48,-17.16 533.98,-11.47 584.82,-9.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="584.63,-13.23 594.52,-9.43 584.42,-6.23 584.63,-13.23"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge12_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge12_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M196.22,-172.7C202.25,-174.86 208.15,-177.47 213.5,-180.62 233.53,-192.45 233.07,-202.15 249.5,-218.62 262.91,-232.07 278.45,-246.84 290.33,-257.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.81,-260.4 297.51,-264.67 292.58,-255.28 287.81,-260.4"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M337.81,-152.58C348.3,-148.45 360.43,-143.5 371.25,-138.62 397.54,-126.79 426.79,-111.98 447.83,-101.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="449.45,-104.13 456.68,-96.39 446.2,-97.93 449.45,-104.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="537.25,-171.25 418.5,-171.25 418.5,-152 537.25,-152 537.25,-171.25"/>
-<text text-anchor="middle" x="477.88" y="-157.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::rehash</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node10 -->
-<g id="edge9_Node000003_Node000010" class="edge">
-<title>Node3&#45;&gt;Node10</title>
-<g id="a_edge9_Node000003_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M363.29,-156C377.19,-155.5 392.44,-155.29 407.13,-155.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="406.68,-158.87 416.71,-155.47 406.75,-151.87 406.68,-158.87"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M519.63,-95.65C529.57,-99.15 539.83,-103.73 548.5,-109.62 568.83,-123.45 565.97,-135.46 584.5,-151.62 598.5,-163.83 615.86,-175.2 630.3,-183.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="628.49,-186.8 638.9,-188.79 632,-180.75 628.49,-186.8"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M516.98,-75.62C527.58,-72.01 538.83,-67.38 548.5,-61.62 567.15,-50.52 565.41,-38.95 584.5,-28.62 587.95,-26.76 591.59,-25.07 595.33,-23.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="596.43,-26.87 604.64,-20.17 594.05,-20.29 596.43,-26.87"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082" target="_top" xlink:title="Used for second hash function.">
-<polygon fill="white" stroke="#666666" points="735.5,-142.25 584.5,-142.25 584.5,-123 735.5,-123 735.5,-142.25"/>
-<text text-anchor="middle" x="660" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::otherHashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M514.49,-95.7C534.94,-101.41 561.12,-108.59 584.5,-114.62 591.26,-116.37 598.39,-118.16 605.44,-119.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="604.38,-123.24 614.92,-122.21 606.04,-116.44 604.38,-123.24"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="725.75,-105.25 594.25,-105.25 594.25,-86 725.75,-86 725.75,-105.25"/>
-<text text-anchor="middle" x="660" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M548.77,-89.51C559.78,-90.12 571.22,-90.75 582.37,-91.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="582.17,-94.86 592.35,-91.92 582.56,-87.88 582.17,-94.86"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="725.75,-67.88 594.25,-67.88 594.25,-37.38 725.75,-37.38 725.75,-67.88"/>
-<text text-anchor="start" x="602.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::searching</text>
-<text text-anchor="middle" x="660" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge8_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge8_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M533.9,-75.54C549.28,-72.73 566.28,-69.61 582.66,-66.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="583.18,-70.07 592.38,-64.83 581.92,-63.19 583.18,-70.07"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node3 -->
-<g id="edge10_Node000010_Node000003" class="edge">
-<title>Node10&#45;&gt;Node3</title>
-<g id="a_edge10_Node000010_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M418.23,-168.47C404.09,-168.87 388.91,-168.99 374.57,-168.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="374.86,-165.33 364.8,-168.65 374.74,-172.33 374.86,-165.33"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node5 -->
-<g id="edge11_Node000010_Node000005" class="edge">
-<title>Node10&#45;&gt;Node5</title>
-<g id="a_edge11_Node000010_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M526.67,-171.71C556.49,-178 594.31,-185.98 621.87,-191.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="621.02,-195.19 631.52,-193.83 622.46,-188.34 621.02,-195.19"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge13_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge13_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M370.87,-275.15C419.45,-273.45 489.49,-267.98 548.5,-251.62 578.7,-243.26 610.87,-227.21 632.66,-215.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="634.17,-218.32 641.15,-210.35 630.72,-212.22 634.17,-218.32"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node5 -->
-<g id="edge22_Node000012_Node000005" class="edge">
-<title>Node12&#45;&gt;Node5</title>
-<g id="a_edge22_Node000012_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.12,-209.74C208.48,-213.31 229.9,-216.87 249.5,-218.62 381.88,-230.48 415.99,-223.86 548.5,-213.62 573.06,-211.73 600.55,-208.25 621.96,-205.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="622.28,-208.73 631.68,-203.84 621.28,-201.8 622.28,-208.73"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node6 -->
-<g id="edge23_Node000012_Node000006" class="edge">
-<title>Node12&#45;&gt;Node6</title>
-<g id="a_edge23_Node000012_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M196.22,-189.55C202.25,-187.39 208.15,-184.78 213.5,-181.62 233.53,-169.8 230.64,-157.24 249.5,-143.62 297.95,-108.66 318.05,-113.82 371.25,-86.62 387.55,-78.3 390.15,-73.16 407.25,-66.62 416.39,-63.13 530.24,-37.87 601.67,-22.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="602.25,-25.63 611.27,-20.07 600.75,-18.79 602.25,-25.63"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node11 -->
-<g id="edge21_Node000012_Node000011" class="edge">
-<title>Node12&#45;&gt;Node11</title>
-<g id="a_edge21_Node000012_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.43,-209.66C184.37,-220.49 218.98,-237.99 249.5,-251.62 256.87,-254.92 264.83,-258.25 272.47,-261.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="270.97,-264.52 281.55,-264.99 273.57,-258.02 270.97,-264.52"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="371.25,-209.25 249.5,-209.25 249.5,-190 371.25,-190 371.25,-209.25"/>
-<text text-anchor="middle" x="310.38" y="-195.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::remove</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge24_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge24_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.8,-199.62C221.68,-199.62 229.71,-199.62 237.62,-199.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.55,-203.13 247.55,-199.63 237.55,-196.13 237.55,-203.13"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node4 -->
-<g id="edge25_Node000013_Node000004" class="edge">
-<title>Node13&#45;&gt;Node4</title>
-<g id="a_edge25_Node000013_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M354.78,-189.61C360.54,-187.43 366.19,-184.79 371.25,-181.62 391.25,-169.12 390.08,-158.8 407.25,-142.62 422.4,-128.35 440.64,-113.49 454.65,-102.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="456.62,-105.43 462.39,-96.54 452.34,-99.89 456.62,-105.43"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node5 -->
-<g id="edge26_Node000013_Node000005" class="edge">
-<title>Node13&#45;&gt;Node5</title>
-<g id="a_edge26_Node000013_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M371.53,-199.62C443.49,-199.62 561.74,-199.62 621.67,-199.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="621.34,-203.13 631.34,-199.63 621.34,-196.13 621.34,-203.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d80/double__hash__hash__table_8cpp_source.html b/d6/d80/double__hash__hash__table_8cpp_source.html
new file mode 100644
index 000000000..694b3edd3
--- /dev/null
+++ b/d6/d80/double__hash__hash__table_8cpp_source.html
@@ -0,0 +1,412 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: hashing/double_hash_hash_table.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/d80/double__hash__hash__table_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">double_hash_hash_table.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/d80/double__hash__hash__table_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;memory&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/d65/namespacedouble__hashing.html">double_hashing</a> {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment">// fwd declarations</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="keyword">using </span><a class="code hl_struct" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> = <span class="keyword">struct </span><a class="code hl_struct" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a>;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">putProber</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a>&amp; entry, <span class="keywordtype">int</span> key);</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6">searchingProber</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a>&amp; entry, <span class="keywordtype">int</span> key);</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a">add</a>(<span class="keywordtype">int</span> key);</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment">// Undocumented globals</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keywordtype">int</span> notPresent;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>std::vector&lt;Entry&gt; table;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keywordtype">int</span> totalSize;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keywordtype">int</span> tomb = -1;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keywordtype">int</span> size;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keywordtype">bool</span> rehashing;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="foldopen" id="foldopen00036" data-start="{" data-end="};">
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../d9/dde/structdouble__hashing_1_1_entry.html">   36</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475">   37</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475">Entry</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a> = notPresent) : <a class="code hl_variable" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a>(<a class="code hl_variable" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a>) {}  </div>
+<div class="foldopen" id="foldopen00038" data-start="{" data-end="};">
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">   38</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a>;                                            </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>};</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="foldopen" id="foldopen00047" data-start="{" data-end="}">
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">   47</a></span><span class="keywordtype">size_t</span> <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(<span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    std::hash&lt;int&gt; hash;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">return</span> hash(key);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>}</div>
+</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="foldopen" id="foldopen00058" data-start="{" data-end="}">
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082">   58</a></span><span class="keywordtype">size_t</span> <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082">otherHashFxn</a>(<span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    std::hash&lt;int&gt; hash;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">return</span> 1 + (7 - (hash(key) % 7));</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>}</div>
+</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="foldopen" id="foldopen00071" data-start="{" data-end="}">
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"><a class="line" href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">   71</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">doubleHash</a>(<span class="keywordtype">int</span> key, <span class="keywordtype">bool</span> searching) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keywordtype">int</span> hash = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(<a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key));</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordtype">int</span> i = 0;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <a class="code hl_struct" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> entry;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="keywordtype">int</span> index =</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(hash + (i * <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082">otherHashFxn</a>(key))) % totalSize;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        entry = table[index];</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        <span class="keywordflow">if</span> (searching) {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>            <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a> == notPresent) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>                <span class="keywordflow">return</span> notPresent;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>            }</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6">searchingProber</a>(entry, key)) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Found key!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>                <span class="keywordflow">return</span> index;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            }</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Found tombstone or equal hash, checking next&quot;</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>                      &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>            i++;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>            <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">putProber</a>(entry, key)) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>                <span class="keywordflow">if</span> (!rehashing) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;Spot found!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>                }</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>                <span class="keywordflow">return</span> index;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            <span class="keywordflow">if</span> (!rehashing) {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Spot taken, looking at next (next index:&quot;</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>                          &lt;&lt; <span class="stringliteral">&quot; &quot;</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>                          &lt;&lt; <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(hash + (i * <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082">otherHashFxn</a>(key))) %</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>                                 totalSize</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>                          &lt;&lt; <span class="stringliteral">&quot;)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>            }</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>            i++;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        }</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="keywordflow">if</span> (i == totalSize * 100) {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;DoubleHash probe failed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>            <span class="keywordflow">return</span> notPresent;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        }</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    } <span class="keywordflow">while</span> (entry.<a class="code hl_variable" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a> != notPresent);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <span class="keywordflow">return</span> notPresent;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>}</div>
+</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
+<div class="foldopen" id="foldopen00120" data-start="{" data-end="}">
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"><a class="line" href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">  120</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">putProber</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a>&amp; entry, <span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a> == notPresent || entry.<a class="code hl_variable" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a> == tomb) {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    }</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>}</div>
+</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
+<div class="foldopen" id="foldopen00133" data-start="{" data-end="}">
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"><a class="line" href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6">  133</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6">searchingProber</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a>&amp; entry, <span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a> == key) {</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    }</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>}</div>
+</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span> </div>
+<div class="foldopen" id="foldopen00143" data-start="{" data-end="}">
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"><a class="line" href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">  143</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">display</a>() {</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; totalSize; i++) {</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        <span class="keywordflow">if</span> (table[i].key == notPresent) {</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; Empty &quot;</span>;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (table[i].key == tomb) {</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; Tomb &quot;</span>;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>            std::cout &lt;&lt; table[i].key;</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>        }</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    }</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>}</div>
+</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span> </div>
+<div class="foldopen" id="foldopen00161" data-start="{" data-end="}">
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"><a class="line" href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d">  161</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d">rehash</a>() {</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    <span class="comment">// Necessary so wall of add info isn&#39;t printed all at once</span></div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    rehashing = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    <span class="keywordtype">int</span> oldSize = totalSize;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    std::vector&lt;Entry&gt; oldTable(table);</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    <span class="comment">// Really this should use the next prime number greater than totalSize * 2</span></div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    table = std::vector&lt;Entry&gt;(totalSize * 2);</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    totalSize *= 2;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; oldSize; i++) {</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        <span class="keywordflow">if</span> (oldTable[i].key != -1 &amp;&amp; oldTable[i].key != notPresent) {</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>            size--;  <span class="comment">// Size stays the same (add increments size)</span></div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>            <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a">add</a>(oldTable[i].key);</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>        }</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    }</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    <span class="comment">// delete[] oldTable;</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    <span class="comment">// oldTable.reset();</span></div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span> </div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    rehashing = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Table was rehashed, new size is: &quot;</span> &lt;&lt; totalSize &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>}</div>
+</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span> </div>
+<div class="foldopen" id="foldopen00185" data-start="{" data-end="}">
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"><a class="line" href="../../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a">  185</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a">add</a>(<span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    <span class="comment">// auto* entry = new Entry();</span></div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    <span class="comment">// entry-&gt;key = key;</span></div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    <span class="keywordtype">int</span> index = <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">doubleHash</a>(key, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    table[index].key = key;</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    <span class="comment">// Load factor greater than 0.5 causes resizing</span></div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    <span class="keywordflow">if</span> (++size / <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(totalSize) &gt;= 0.5) {</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>        <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d">rehash</a>();</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    }</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>}</div>
+</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span> </div>
+<div class="foldopen" id="foldopen00199" data-start="{" data-end="}">
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"><a class="line" href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931">  199</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931">remove</a>(<span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    <span class="keywordtype">int</span> index = <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">doubleHash</a>(key, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    <span class="keywordflow">if</span> (index == notPresent) {</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;key not found&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    }</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    table[index].key = tomb;</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Removal successful, leaving tombstone&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    size--;</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>}</div>
+</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span> </div>
+<div class="foldopen" id="foldopen00212" data-start="{" data-end="}">
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"><a class="line" href="../../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560">  212</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560">addInfo</a>(<span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initial table: &quot;</span>;</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">display</a>();</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;hash of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>              &lt;&lt; totalSize &lt;&lt; <span class="stringliteral">&quot; == &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) % totalSize;</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a">add</a>(key);</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;New table: &quot;</span>;</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">display</a>();</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>}</div>
+</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span> </div>
+<div class="foldopen" id="foldopen00227" data-start="{" data-end="}">
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"><a class="line" href="../../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824">  227</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824">removalInfo</a>(<span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initial table: &quot;</span>;</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">display</a>();</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;hash of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>              &lt;&lt; totalSize &lt;&lt; <span class="stringliteral">&quot; == &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">hashFxn</a>(key) % totalSize;</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931">remove</a>(key);</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;New table: &quot;</span>;</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">display</a>();</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>}</div>
+</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>}  <span class="comment">// namespace double_hashing</span></div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span><span class="keyword">using </span><a class="code hl_struct" href="../../d9/dde/structdouble__hashing_1_1_entry.html">double_hashing::Entry</a>;</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span><span class="keyword">using </span>double_hashing::table;</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span><span class="keyword">using </span>double_hashing::totalSize;</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span> </div>
+<div class="foldopen" id="foldopen00250" data-start="{" data-end="}">
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"><a class="line" href="../../d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  250</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    <span class="keywordtype">int</span> cmd = 0, hash = 0, key = 0;</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the initial size of Hash Table. = &quot;</span>;</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    std::cin &gt;&gt; totalSize;</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>    table = std::vector&lt;Entry&gt;(totalSize);</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>    <span class="keywordtype">bool</span> loop = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    <span class="keywordflow">while</span> (loop) {</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;PLEASE CHOOSE -&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;1. Add key. (Numeric only)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;2. Remove key.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;3. Find key.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;4. Generate Hash. (Numeric only)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;5. Display Hash table.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;6. Exit.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>        std::cin &gt;&gt; cmd;</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>        <span class="keywordflow">switch</span> (cmd) {</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>            <span class="keywordflow">case</span> 1:</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter key to add = &quot;</span>;</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>                std::cin &gt;&gt; key;</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>                <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560">double_hashing::addInfo</a>(key);</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>            <span class="keywordflow">case</span> 2:</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter key to remove = &quot;</span>;</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>                std::cin &gt;&gt; key;</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>                <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824">double_hashing::removalInfo</a>(key);</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>            <span class="keywordflow">case</span> 3: {</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter key to search = &quot;</span>;</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>                std::cin &gt;&gt; key;</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>                <a class="code hl_struct" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> entry = table[<a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">double_hashing::doubleHash</a>(key, <span class="keyword">true</span>)];</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>                <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">key</a> == double_hashing::notPresent) {</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;Key not present&quot;</span>;</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>                }</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>            }</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>            <span class="keywordflow">case</span> 4:</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter element to generate hash = &quot;</span>;</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>                std::cin &gt;&gt; key;</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Hash of &quot;</span> &lt;&lt; key</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>                          &lt;&lt; <span class="stringliteral">&quot; is = &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">double_hashing::hashFxn</a>(key);</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>            <span class="keywordflow">case</span> 5:</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>                <a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">double_hashing::display</a>();</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>            <span class="keywordflow">default</span>:</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>                loop = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>                <span class="comment">// delete[] table;</span></div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>        }</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>    }</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>}</div>
+</div>
+</div>
+</div>
+<div class="ttc" id="adouble__hash__hash__table_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00250">double_hash_hash_table.cpp:250</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html">double_hashing</a></div><div class="ttdoc">An implementation of hash table using double hashing algorithm.</div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_a0d90726ed1de7b3d2ae261baed048003"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003">double_hashing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdoc">Hash a key. Uses the STL library's std::hash() function.</div><div class="ttdef"><b>Definition</b> <a href="#l00047">double_hash_hash_table.cpp:47</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_a1e901418c759627557eff359b8db38cd"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd">double_hashing::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition</b> <a href="#l00143">double_hash_hash_table.cpp:143</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_a28083ecac6eb94b643281875c8665931"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931">double_hashing::remove</a></div><div class="ttdeci">void remove(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00199">double_hash_hash_table.cpp:199</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_a29f543e2626bad58907661e1e45028a6"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6">double_hashing::searchingProber</a></div><div class="ttdeci">bool searchingProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00133">double_hash_hash_table.cpp:133</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_a33968a1178289ab61445dd4000df7082"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082">double_hashing::otherHashFxn</a></div><div class="ttdeci">size_t otherHashFxn(int key)</div><div class="ttdoc">Used for second hash function.</div><div class="ttdef"><b>Definition</b> <a href="#l00058">double_hash_hash_table.cpp:58</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_a5d06e4598569526294f10104875f6824"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824">double_hashing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00227">double_hash_hash_table.cpp:227</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_a79a9c914a6c68275b3640303d7faad8a"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a">double_hashing::add</a></div><div class="ttdeci">void add(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00185">double_hash_hash_table.cpp:185</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_a8f8ff4fb018e1bb32d67d8a1885d3200"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200">double_hashing::doubleHash</a></div><div class="ttdeci">int doubleHash(int key, bool searching)</div><div class="ttdoc">Performs double hashing to resolve collisions.</div><div class="ttdef"><b>Definition</b> <a href="#l00071">double_hash_hash_table.cpp:71</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_a9c652b2e467e5d250dfe3bed83b12560"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560">double_hashing::addInfo</a></div><div class="ttdeci">void addInfo(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00212">double_hash_hash_table.cpp:212</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_ac2adfce49ac57f6dbd1778d2c1ce0d2b"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">double_hashing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00120">double_hash_hash_table.cpp:120</a></div></div>
+<div class="ttc" id="anamespacedouble__hashing_html_af4981819aae8bc7e7beeaef02615e30d"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d">double_hashing::rehash</a></div><div class="ttdeci">void rehash()</div><div class="ttdef"><b>Definition</b> <a href="#l00161">double_hash_hash_table.cpp:161</a></div></div>
+<div class="ttc" id="astructdouble__hashing_1_1_entry_html"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html">double_hashing::Entry</a></div><div class="ttdef"><b>Definition</b> <a href="#l00036">double_hash_hash_table.cpp:36</a></div></div>
+<div class="ttc" id="astructdouble__hashing_1_1_entry_html_a287b92112b6b43b34808a93778873475"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475">double_hashing::Entry::Entry</a></div><div class="ttdeci">Entry(int key=notPresent)</div><div class="ttdoc">constructor</div><div class="ttdef"><b>Definition</b> <a href="#l00037">double_hash_hash_table.cpp:37</a></div></div>
+<div class="ttc" id="astructdouble__hashing_1_1_entry_html_ae114967c89dbba3b754dc4976bba3248"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248">double_hashing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition</b> <a href="#l00038">double_hash_hash_table.cpp:38</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_ece9b94c107bbaa1dd68197a8c9983b9.html">hashing</a></li><li class="navelem"><a class="el" href="../../d6/d80/double__hash__hash__table_8cpp.html">double_hash_hash_table.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/d84/classhashing_1_1sha256_1_1_hash.html b/d6/d84/classhashing_1_1sha256_1_1_hash.html
index 9fdef9f36..aba9fce68 100644
--- a/d6/d84/classhashing_1_1sha256_1_1_hash.html
+++ b/d6/d84/classhashing_1_1sha256_1_1_hash.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: hashing::sha256::Hash Class Reference</title>
+<title>TheAlgorithms/C++: hashing::sha256::Hash Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -117,25 +134,27 @@ $(function(){initNavTree('d6/d84/classhashing_1_1sha256_1_1_hash.html','../../')
 <div class="dynheader">
 Collaboration diagram for hashing::sha256::Hash:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.svg" width="167" height="230"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/ded/classhashing_1_1sha256_1_1_hash__coll__graph.svg" width="167" height="140"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:a0896c27ac39c780e0ee62417fdd0b9d3" id="r_a0896c27ac39c780e0ee62417fdd0b9d3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0896c27ac39c780e0ee62417fdd0b9d3">update</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint32_t, 64 &gt; &amp;blocks)</td></tr>
+<tr class="memitem:a0896c27ac39c780e0ee62417fdd0b9d3" id="r_a0896c27ac39c780e0ee62417fdd0b9d3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0896c27ac39c780e0ee62417fdd0b9d3">update</a> (const std::array&lt; uint32_t, 64 &gt; &amp;blocks)</td></tr>
 <tr class="memdesc:a0896c27ac39c780e0ee62417fdd0b9d3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Updates the hash array.  <br /></td></tr>
 <tr class="separator:a0896c27ac39c780e0ee62417fdd0b9d3"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a4581f503a263d8e928e5716d54477e08" id="r_a4581f503a263d8e928e5716d54477e08"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4581f503a263d8e928e5716d54477e08">to_string</a> () const</td></tr>
+<tr class="memitem:a4581f503a263d8e928e5716d54477e08" id="r_a4581f503a263d8e928e5716d54477e08"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4581f503a263d8e928e5716d54477e08">to_string</a> () const</td></tr>
 <tr class="memdesc:a4581f503a263d8e928e5716d54477e08"><td class="mdescLeft">&#160;</td><td class="mdescRight">Convert the hash to a hexadecimal string.  <br /></td></tr>
 <tr class="separator:a4581f503a263d8e928e5716d54477e08"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:ae6bacea3aec06351f4dfa5fa7b9fb13d" id="r_ae6bacea3aec06351f4dfa5fa7b9fb13d"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint32_t, 8 &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae6bacea3aec06351f4dfa5fa7b9fb13d">hash</a></td></tr>
+<tr class="memitem:ae6bacea3aec06351f4dfa5fa7b9fb13d" id="r_ae6bacea3aec06351f4dfa5fa7b9fb13d"><td class="memItemLeft" align="right" valign="top">std::array&lt; uint32_t, 8 &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae6bacea3aec06351f4dfa5fa7b9fb13d">hash</a></td></tr>
 <tr class="separator:ae6bacea3aec06351f4dfa5fa7b9fb13d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Contains hash array and functions to update it and convert it to a hexadecimal string. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d08/sha256_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../d4/d08/sha256_8cpp_source.html">sha256.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="a4581f503a263d8e928e5716d54477e08" name="a4581f503a263d8e928e5716d54477e08"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a4581f503a263d8e928e5716d54477e08">&#9670;&#160;</a></span>to_string()</h2>
@@ -144,7 +163,7 @@ Private Attributes</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> hashing::sha256::Hash::to_string </td>
+          <td class="memname">std::string hashing::sha256::Hash::to_string </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td> const</td>
@@ -153,25 +172,17 @@ Private Attributes</h2></td></tr>
 </div><div class="memdoc">
 
 <p>Convert the hash to a hexadecimal string. </p>
-<dl class="section return"><dt>Returns</dt><dd><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> Final hash value </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  130</span>                                {</div>
-<div class="line"><span class="lineno">  131</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">std::stringstream</a> ss;</div>
-<div class="line"><span class="lineno">  132</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; 8; ++i) {</div>
-<div class="line"><span class="lineno">  133</span>        ss &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/hex.html">std::hex</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">std::setfill</a>(<span class="charliteral">&#39;0&#39;</span>) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(8) &lt;&lt; hash[i];</div>
-<div class="line"><span class="lineno">  134</span>    }</div>
-<div class="line"><span class="lineno">  135</span>    <span class="keywordflow">return</span> ss.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html">str</a>();</div>
-<div class="line"><span class="lineno">  136</span>}</div>
-<div class="ttc" id="abasic_stringstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">std::stringstream</a></div></div>
-<div class="ttc" id="ahex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/hex.html">std::hex</a></div><div class="ttdeci">T hex(T... args)</div></div>
-<div class="ttc" id="asetfill_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">std::setfill</a></div><div class="ttdeci">T setfill(T... args)</div></div>
-<div class="ttc" id="asetw_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a></div><div class="ttdeci">T setw(T... args)</div></div>
-<div class="ttc" id="astr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html">std::stringstream::str</a></div><div class="ttdeci">T str(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d84/classhashing_1_1sha256_1_1_hash_a4581f503a263d8e928e5716d54477e08_cgraph.svg" width="356" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
+<dl class="section return"><dt>Returns</dt><dd>std::string Final hash value </dd></dl>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d08/sha256_8cpp_source.html#l00130">130</a> of file <a class="el" href="../../d4/d08/sha256_8cpp_source.html">sha256.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  130</span>                                {</div>
+<div class="line"><span class="lineno">  131</span>    std::stringstream ss;</div>
+<div class="line"><span class="lineno">  132</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; 8; ++i) {</div>
+<div class="line"><span class="lineno">  133</span>        ss &lt;&lt; std::hex &lt;&lt; std::setfill(<span class="charliteral">&#39;0&#39;</span>) &lt;&lt; std::setw(8) &lt;&lt; hash[i];</div>
+<div class="line"><span class="lineno">  134</span>    }</div>
+<div class="line"><span class="lineno">  135</span>    <span class="keywordflow">return</span> ss.str();</div>
+<div class="line"><span class="lineno">  136</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0896c27ac39c780e0ee62417fdd0b9d3" name="a0896c27ac39c780e0ee62417fdd0b9d3"></a>
@@ -183,7 +194,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void hashing::sha256::Hash::update </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint32_t, 64 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>blocks</em></span></td><td>)</td>
+          <td class="paramtype">const std::array&lt; uint32_t, 64 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>blocks</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -197,10 +208,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d08/sha256_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../d4/d08/sha256_8cpp_source.html">sha256.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   67</span>                                                      {</div>
 <div class="line"><span class="lineno">   68</span>    <span class="comment">// Initialize array of round constants with first 32 bits of the fractional</span></div>
 <div class="line"><span class="lineno">   69</span>    <span class="comment">// parts of the cube roots of the first 64 primes 2..311</span></div>
-<div class="line"><span class="lineno">   70</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;uint32_t, 64&gt;</a> round_constants = {</div>
+<div class="line"><span class="lineno">   70</span>    <span class="keyword">const</span> std::array&lt;uint32_t, 64&gt; round_constants = {</div>
 <div class="line"><span class="lineno">   71</span>        0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5, 0x3956C25B, 0x59F111F1,</div>
 <div class="line"><span class="lineno">   72</span>        0x923F82A4, 0xAB1C5ED5, 0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,</div>
 <div class="line"><span class="lineno">   73</span>        0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174, 0xE49B69C1, 0xEFBE4786,</div>
@@ -255,17 +268,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  122</span>    hash[6] += <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>;</div>
 <div class="line"><span class="lineno">  123</span>    hash[7] += <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>;</div>
 <div class="line"><span class="lineno">  124</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:115</div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a4251b4df4748a0b9c43a48f61bdd2397"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">numerical_methods::simpson_method::f</a></div><div class="ttdeci">double f(double x)</div><div class="ttdoc">A function f(x) that will be used to test the method.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:113</div></div>
-<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> hash_search.cpp:45</div></div>
-<div class="ttc" id="asha256_8cpp_html_adbcd504103c342a4da718f8fce6ff06c"><div class="ttname"><a href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c">hashing::sha256::right_rotate</a></div><div class="ttdeci">uint32_t right_rotate(uint32_t n, size_t rotate)</div><div class="ttdoc">Rotates the bits of a 32-bit unsigned integer.</div><div class="ttdef"><b>Definition</b> sha256.cpp:58</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d84/classhashing_1_1sha256_1_1_hash_a0896c27ac39c780e0ee62417fdd0b9d3_cgraph.svg" width="364" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00115">composite_simpson_rule.cpp:115</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a4251b4df4748a0b9c43a48f61bdd2397"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">numerical_methods::simpson_method::f</a></div><div class="ttdeci">double f(double x)</div><div class="ttdoc">A function f(x) that will be used to test the method.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00113">composite_simpson_rule.cpp:113</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00045">hash_search.cpp:45</a></div></div>
+<div class="ttc" id="asha256_8cpp_html_adbcd504103c342a4da718f8fce6ff06c"><div class="ttname"><a href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c">hashing::sha256::right_rotate</a></div><div class="ttdeci">uint32_t right_rotate(uint32_t n, size_t rotate)</div><div class="ttdoc">Rotates the bits of a 32-bit unsigned integer.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d08/sha256_8cpp_source.html#l00058">sha256.cpp:58</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
@@ -279,7 +286,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;uint32_t, 8&gt; hashing::sha256::Hash::hash</td>
+          <td class="memname">std::array&lt;uint32_t, 8&gt; hashing::sha256::Hash::hash</td>
         </tr>
       </table>
   </td>
@@ -291,14 +298,16 @@ Here is the call graph for this function:</div>
 <b>Initial value:</b><div class="fragment"><div class="line">= {0x6A09E667, 0xBB67AE85, 0x3C6EF372,</div>
 <div class="line">                                    0xA54FF53A, 0x510E527F, 0x9B05688C,</div>
 <div class="line">                                    0x1F83D9AB, 0x5BE0CD19}</div>
-</div><!-- fragment --><div class="fragment"><div class="line"><span class="lineno">   43</span>                                 {0x6A09E667, 0xBB67AE85, 0x3C6EF372,</div>
+</div><!-- fragment -->
+<p class="definition">Definition at line <a class="el" href="../../d4/d08/sha256_8cpp_source.html#l00043">43</a> of file <a class="el" href="../../d4/d08/sha256_8cpp_source.html">sha256.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   43</span>                                 {0x6A09E667, 0xBB67AE85, 0x3C6EF372,</div>
 <div class="line"><span class="lineno">   44</span>                                    0xA54FF53A, 0x510E527F, 0x9B05688C,</div>
 <div class="line"><span class="lineno">   45</span>                                    0x1F83D9AB, 0x5BE0CD19};</div>
 </div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>hashing/<a class="el" href="../../d4/d08/sha256_8cpp.html">sha256.cpp</a></li>
+<li>hashing/<a class="el" href="../../d4/d08/sha256_8cpp_source.html">sha256.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d6/d84/classhashing_1_1sha256_1_1_hash_a0896c27ac39c780e0ee62417fdd0b9d3_cgraph.map b/d6/d84/classhashing_1_1sha256_1_1_hash_a0896c27ac39c780e0ee62417fdd0b9d3_cgraph.map
deleted file mode 100644
index c92f6882c..000000000
--- a/d6/d84/classhashing_1_1sha256_1_1_hash_a0896c27ac39c780e0ee62417fdd0b9d3_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="hashing::sha256::Hash::update" name="hashing::sha256::Hash::update">
-<area shape="rect" id="Node000001" title="Updates the hash array." alt="" coords="5,39,161,80"/>
-<area shape="rect" id="Node000002" href="$d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" title=" " alt="" coords="264,5,303,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="161,41,248,23,249,28,162,46"/>
-<area shape="rect" id="Node000003" href="$d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c" title="Rotates the bits of a 32&#45;bit unsigned integer." alt="" coords="209,79,358,120"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="162,72,194,79,193,84,161,78"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="245,79,243,69,250,60,263,55,283,53,305,55,318,61,316,66,304,60,283,58,264,60,253,64,249,70,250,78"/>
-</map>
diff --git a/d6/d84/classhashing_1_1sha256_1_1_hash_a0896c27ac39c780e0ee62417fdd0b9d3_cgraph.md5 b/d6/d84/classhashing_1_1sha256_1_1_hash_a0896c27ac39c780e0ee62417fdd0b9d3_cgraph.md5
deleted file mode 100644
index 73a938fd8..000000000
--- a/d6/d84/classhashing_1_1sha256_1_1_hash_a0896c27ac39c780e0ee62417fdd0b9d3_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a407f26e659d1a6adf3d7306909d2352
\ No newline at end of file
diff --git a/d6/d84/classhashing_1_1sha256_1_1_hash_a0896c27ac39c780e0ee62417fdd0b9d3_cgraph.svg b/d6/d84/classhashing_1_1sha256_1_1_hash_a0896c27ac39c780e0ee62417fdd0b9d3_cgraph.svg
deleted file mode 100644
index 56b4e0b8c..000000000
--- a/d6/d84/classhashing_1_1sha256_1_1_hash_a0896c27ac39c780e0ee62417fdd0b9d3_cgraph.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha256::Hash::update Pages: 1 -->
-<svg width="273pt" height="94pt"
- viewBox="0.00 0.00 272.50 93.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89.88)">
-<title>hashing::sha256::Hash::update</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Updates the hash array.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-60.5 0,-60.5 0,-30 116.5,-30 116.5,-60.5"/>
-<text text-anchor="start" x="8" y="-47" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::Hash</text>
-<text text-anchor="middle" x="58.25" y="-35.75" font-family="Helvetica,sans-Serif" font-size="10.00">::update</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222.9,-85.88 194.1,-85.88 194.1,-66.62 222.9,-66.62 222.9,-85.88"/>
-<text text-anchor="middle" x="208.5" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.99,-57.32C139.72,-62.08 164.6,-67.28 182.52,-71.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.71,-74.43 192.21,-73.05 183.14,-67.58 181.71,-74.43"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c" target="_top" xlink:title="Rotates the bits of a 32&#45;bit unsigned integer.">
-<polygon fill="white" stroke="#666666" points="264.5,-30.5 152.5,-30.5 152.5,0 264.5,0 264.5,-30.5"/>
-<text text-anchor="start" x="160.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::right</text>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_rotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.99,-33.57C124.84,-31.98 132.94,-30.34 140.93,-28.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.51,-32.17 150.62,-26.76 140.12,-25.31 141.51,-32.17"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M181.88,-30.99C176.44,-40.06 185.32,-48.5 208.5,-48.5 221.18,-48.5 229.58,-45.97 233.7,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.14,-42.85 234.93,-32.49 230.2,-41.97 237.14,-42.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d84/classhashing_1_1sha256_1_1_hash_a0896c27ac39c780e0ee62417fdd0b9d3_cgraph_org.svg b/d6/d84/classhashing_1_1sha256_1_1_hash_a0896c27ac39c780e0ee62417fdd0b9d3_cgraph_org.svg
deleted file mode 100644
index 7442dacc0..000000000
--- a/d6/d84/classhashing_1_1sha256_1_1_hash_a0896c27ac39c780e0ee62417fdd0b9d3_cgraph_org.svg
+++ /dev/null
@@ -1,68 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha256::Hash::update Pages: 1 -->
-<svg width="273pt" height="94pt"
- viewBox="0.00 0.00 272.50 93.88" 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.88)">
-<title>hashing::sha256::Hash::update</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Updates the hash array.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-60.5 0,-60.5 0,-30 116.5,-30 116.5,-60.5"/>
-<text text-anchor="start" x="8" y="-47" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::Hash</text>
-<text text-anchor="middle" x="58.25" y="-35.75" font-family="Helvetica,sans-Serif" font-size="10.00">::update</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222.9,-85.88 194.1,-85.88 194.1,-66.62 222.9,-66.62 222.9,-85.88"/>
-<text text-anchor="middle" x="208.5" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.99,-57.32C139.72,-62.08 164.6,-67.28 182.52,-71.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.71,-74.43 192.21,-73.05 183.14,-67.58 181.71,-74.43"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c" target="_top" xlink:title="Rotates the bits of a 32&#45;bit unsigned integer.">
-<polygon fill="white" stroke="#666666" points="264.5,-30.5 152.5,-30.5 152.5,0 264.5,0 264.5,-30.5"/>
-<text text-anchor="start" x="160.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::right</text>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_rotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.99,-33.57C124.84,-31.98 132.94,-30.34 140.93,-28.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.51,-32.17 150.62,-26.76 140.12,-25.31 141.51,-32.17"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M181.88,-30.99C176.44,-40.06 185.32,-48.5 208.5,-48.5 221.18,-48.5 229.58,-45.97 233.7,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.14,-42.85 234.93,-32.49 230.2,-41.97 237.14,-42.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d84/classhashing_1_1sha256_1_1_hash_a4581f503a263d8e928e5716d54477e08_cgraph.map b/d6/d84/classhashing_1_1sha256_1_1_hash_a4581f503a263d8e928e5716d54477e08_cgraph.map
deleted file mode 100644
index 8d6c5043d..000000000
--- a/d6/d84/classhashing_1_1sha256_1_1_hash_a4581f503a263d8e928e5716d54477e08_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="hashing::sha256::Hash::to_string" name="hashing::sha256::Hash::to_string">
-<area shape="rect" id="Node000001" title="Convert the hash to a hexadecimal string." alt="" coords="5,72,161,113"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/hex.html#" title=" " alt="" coords="246,5,314,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="133,69,208,40,230,32,232,37,210,45,135,74"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setfill.html#" title=" " alt="" coords="241,55,319,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="161,80,225,72,225,77,161,85"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setw.html#" title=" " alt="" coords="242,104,318,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="161,100,227,108,227,113,161,105"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_stringstream/str.html#" title=" " alt="" coords="209,153,351,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="137,111,210,140,225,145,224,150,208,145,135,116"/>
-</map>
diff --git a/d6/d84/classhashing_1_1sha256_1_1_hash_a4581f503a263d8e928e5716d54477e08_cgraph.md5 b/d6/d84/classhashing_1_1sha256_1_1_hash_a4581f503a263d8e928e5716d54477e08_cgraph.md5
deleted file mode 100644
index f1205631d..000000000
--- a/d6/d84/classhashing_1_1sha256_1_1_hash_a4581f503a263d8e928e5716d54477e08_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d42c38695811fff7f1e1d2f2620acfde
\ No newline at end of file
diff --git a/d6/d84/classhashing_1_1sha256_1_1_hash_a4581f503a263d8e928e5716d54477e08_cgraph.svg b/d6/d84/classhashing_1_1sha256_1_1_hash_a4581f503a263d8e928e5716d54477e08_cgraph.svg
deleted file mode 100644
index e1c082342..000000000
--- a/d6/d84/classhashing_1_1sha256_1_1_hash_a4581f503a263d8e928e5716d54477e08_cgraph.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha256::Hash::to_string Pages: 1 -->
-<svg width="267pt" height="138pt"
- viewBox="0.00 0.00 267.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>hashing::sha256::Hash::to_string</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Convert the hash to a hexadecimal string.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-79.88 0,-79.88 0,-49.38 116.5,-49.38 116.5,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::Hash</text>
-<text text-anchor="middle" x="58.25" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::to_string</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/hex.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.5,-130.25 180.25,-130.25 180.25,-111 231.5,-111 231.5,-130.25"/>
-<text text-anchor="middle" x="205.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::hex</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.27,-80.27C113.31,-87.32 133.84,-95.62 152.5,-102.62 157.93,-104.66 163.71,-106.74 169.37,-108.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.97,-111.94 178.57,-111.9 170.26,-105.33 167.97,-111.94"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235.25,-93.25 176.5,-93.25 176.5,-74 235.25,-74 235.25,-93.25"/>
-<text text-anchor="middle" x="205.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.8,-72.13C132.86,-74.23 149.96,-76.46 164.78,-78.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.23,-81.85 174.6,-79.68 165.14,-74.91 164.23,-81.85"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.12,-56.25 177.62,-56.25 177.62,-37 234.12,-37 234.12,-56.25"/>
-<text text-anchor="middle" x="205.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.8,-57.51C133.4,-55.46 151.11,-53.27 166.26,-51.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.29,-54.92 175.78,-50.22 165.43,-47.97 166.29,-54.92"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.25,-19.25 152.5,-19.25 152.5,0 259.25,0 259.25,-19.25"/>
-<text text-anchor="middle" x="205.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stringstream::str</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.66,-48.92C114.43,-42.18 134.37,-34.33 152.5,-27.62 156.33,-26.21 160.34,-24.76 164.35,-23.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.16,-26.77 173.45,-20.16 162.85,-20.16 165.16,-26.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d84/classhashing_1_1sha256_1_1_hash_a4581f503a263d8e928e5716d54477e08_cgraph_org.svg b/d6/d84/classhashing_1_1sha256_1_1_hash_a4581f503a263d8e928e5716d54477e08_cgraph_org.svg
deleted file mode 100644
index fc01bf340..000000000
--- a/d6/d84/classhashing_1_1sha256_1_1_hash_a4581f503a263d8e928e5716d54477e08_cgraph_org.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha256::Hash::to_string Pages: 1 -->
-<svg width="267pt" height="138pt"
- viewBox="0.00 0.00 267.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>hashing::sha256::Hash::to_string</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Convert the hash to a hexadecimal string.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-79.88 0,-79.88 0,-49.38 116.5,-49.38 116.5,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::Hash</text>
-<text text-anchor="middle" x="58.25" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::to_string</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/hex.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.5,-130.25 180.25,-130.25 180.25,-111 231.5,-111 231.5,-130.25"/>
-<text text-anchor="middle" x="205.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::hex</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.27,-80.27C113.31,-87.32 133.84,-95.62 152.5,-102.62 157.93,-104.66 163.71,-106.74 169.37,-108.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.97,-111.94 178.57,-111.9 170.26,-105.33 167.97,-111.94"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235.25,-93.25 176.5,-93.25 176.5,-74 235.25,-74 235.25,-93.25"/>
-<text text-anchor="middle" x="205.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.8,-72.13C132.86,-74.23 149.96,-76.46 164.78,-78.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.23,-81.85 174.6,-79.68 165.14,-74.91 164.23,-81.85"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.12,-56.25 177.62,-56.25 177.62,-37 234.12,-37 234.12,-56.25"/>
-<text text-anchor="middle" x="205.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.8,-57.51C133.4,-55.46 151.11,-53.27 166.26,-51.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.29,-54.92 175.78,-50.22 165.43,-47.97 166.29,-54.92"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.25,-19.25 152.5,-19.25 152.5,0 259.25,0 259.25,-19.25"/>
-<text text-anchor="middle" x="205.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stringstream::str</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.66,-48.92C114.43,-42.18 134.37,-34.33 152.5,-27.62 156.33,-26.21 160.34,-24.76 164.35,-23.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.16,-26.77 173.45,-20.16 162.85,-20.16 165.16,-26.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d84/namespaceutils.html b/d6/d84/namespaceutils.html
index 68faafb30..e3f3d7731 100644
--- a/d6/d84/namespaceutils.html
+++ b/d6/d84/namespaceutils.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: utils Namespace Reference</title>
+<title>TheAlgorithms/C++: utils Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d6/d8d/namespacemorse.html b/d6/d8d/namespacemorse.html
index 7a96ef5ac..0470b597c 100644
--- a/d6/d8d/namespacemorse.html
+++ b/d6/d8d/namespacemorse.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: morse Namespace Reference</title>
+<title>TheAlgorithms/C++: morse Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d6/d9d/large__factorial_8cpp.html b/d6/d9d/large__factorial_8cpp.html
index 1bd3f4218..2526abcd5 100644
--- a/d6/d9d/large__factorial_8cpp.html
+++ b/d6/d9d/large__factorial_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/large_factorial.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/large_factorial.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for large_factorial.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d59/large__factorial_8cpp__incl.svg" width="639" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 </div>
-</div><table class="memberdecls">
+</div>
+<p><a href="../../d6/d9d/large__factorial_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a3f93b60e229b6683e24c4754a7106ee8" id="r_a3f93b60e229b6683e24c4754a7106ee8"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3f93b60e229b6683e24c4754a7106ee8">test1</a> ()</td></tr>
@@ -135,6 +154,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Compute factorial of any arbitratily large number/. </p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d9/d00/factorial_8cpp.html" title="Find the factorial of a given number.">factorial.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/d9d/large__factorial_8cpp_source.html">large_factorial.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">&#9670;&#160;</a></span>main()</h2>
@@ -155,29 +176,31 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main program </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d9d/large__factorial_8cpp_source.html#l00089">89</a> of file <a class="el" href="../../d6/d9d/large__factorial_8cpp_source.html">large_factorial.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   89</span>                                 {</div>
 <div class="line"><span class="lineno">   90</span>    <span class="keywordtype">int</span> number, i;</div>
 <div class="line"><span class="lineno">   91</span> </div>
 <div class="line"><span class="lineno">   92</span>    <span class="keywordflow">if</span> (argc == 2) {</div>
-<div class="line"><span class="lineno">   93</span>        number = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">atoi</a>(argv[1]);</div>
+<div class="line"><span class="lineno">   93</span>        number = atoi(argv[1]);</div>
 <div class="line"><span class="lineno">   94</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   95</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the value of n(n starts from 0 ): &quot;</span>;</div>
-<div class="line"><span class="lineno">   96</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; number;</div>
+<div class="line"><span class="lineno">   95</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the value of n(n starts from 0 ): &quot;</span>;</div>
+<div class="line"><span class="lineno">   96</span>        std::cin &gt;&gt; number;</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>    <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  100</span> </div>
-<div class="line"><span class="lineno">  101</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> start_time = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  101</span>    std::clock_t start_time = std::clock();</div>
 <div class="line"><span class="lineno">  102</span>    <span class="keywordflow">for</span> (i = 2; i &lt;= number; i++) <span class="comment">/* Multiply every number from 2 thru N */</span></div>
 <div class="line"><span class="lineno">  103</span>        result *= i;</div>
-<div class="line"><span class="lineno">  104</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> end_time = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  104</span>    std::clock_t end_time = std::clock();</div>
 <div class="line"><span class="lineno">  105</span>    <span class="keywordtype">double</span> time_taken =</div>
 <div class="line"><span class="lineno">  106</span>        <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end_time - start_time) / CLOCKS_PER_SEC;</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> &lt;&lt; number &lt;&lt; <span class="stringliteral">&quot;! = &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> &lt;&lt; <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">  109</span>              &lt;&lt; <span class="stringliteral">&quot;Number of digits: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.num_digits() &lt;&lt; <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">  110</span>              &lt;&lt; <span class="stringliteral">&quot;Time taken: &quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/fixed.html">std::scientific</a> &lt;&lt; time_taken &lt;&lt; <span class="stringliteral">&quot; s&quot;</span></div>
-<div class="line"><span class="lineno">  111</span>              &lt;&lt; <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">  108</span>    std::cout &lt;&lt; number &lt;&lt; <span class="stringliteral">&quot;! = &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> &lt;&lt; std::endl</div>
+<div class="line"><span class="lineno">  109</span>              &lt;&lt; <span class="stringliteral">&quot;Number of digits: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.num_digits() &lt;&lt; std::endl</div>
+<div class="line"><span class="lineno">  110</span>              &lt;&lt; <span class="stringliteral">&quot;Time taken: &quot;</span> &lt;&lt; std::scientific &lt;&lt; time_taken &lt;&lt; <span class="stringliteral">&quot; s&quot;</span></div>
+<div class="line"><span class="lineno">  111</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  112</span> </div>
 <div class="line"><span class="lineno">  113</span>    <a class="code hl_function" href="#a3f93b60e229b6683e24c4754a7106ee8">test1</a>();</div>
 <div class="line"><span class="lineno">  114</span>    <a class="code hl_function" href="#a76aae4778fbe89a3d59fd61fbc050cfa">test2</a>();</div>
@@ -185,23 +208,11 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  116</span> </div>
 <div class="line"><span class="lineno">  117</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  118</span>}</div>
-<div class="ttc" id="aatoi_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">std::atoi</a></div><div class="ttdeci">T atoi(T... args)</div></div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="aclasslarge__number_html"><div class="ttname"><a href="../../db/d82/classlarge__number.html">large_number</a></div><div class="ttdef"><b>Definition</b> large_number.h:24</div></div>
-<div class="ttc" id="aclock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a></div><div class="ttdeci">T clock(T... args)</div></div>
-<div class="ttc" id="aclock_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a></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="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-<div class="ttc" id="afixed_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/fixed.html">std::scientific</a></div><div class="ttdeci">T scientific(T... args)</div></div>
-<div class="ttc" id="alarge__factorial_8cpp_html_a3f93b60e229b6683e24c4754a7106ee8"><div class="ttname"><a href="#a3f93b60e229b6683e24c4754a7106ee8">test1</a></div><div class="ttdeci">bool test1()</div><div class="ttdef"><b>Definition</b> large_factorial.cpp:17</div></div>
-<div class="ttc" id="alarge__factorial_8cpp_html_a76aae4778fbe89a3d59fd61fbc050cfa"><div class="ttname"><a href="#a76aae4778fbe89a3d59fd61fbc050cfa">test2</a></div><div class="ttdeci">bool test2()</div><div class="ttdef"><b>Definition</b> large_factorial.cpp:54</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="327" height="236"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclasslarge__number_html"><div class="ttname"><a href="../../db/d82/classlarge__number.html">large_number</a></div><div class="ttdef"><b>Definition</b> <a href="../../d4/d86/large__number_8h_source.html#l00024">large_number.h:24</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+<div class="ttc" id="alarge__factorial_8cpp_html_a3f93b60e229b6683e24c4754a7106ee8"><div class="ttname"><a href="#a3f93b60e229b6683e24c4754a7106ee8">test1</a></div><div class="ttdeci">bool test1()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d9d/large__factorial_8cpp_source.html#l00017">large_factorial.cpp:17</a></div></div>
+<div class="ttc" id="alarge__factorial_8cpp_html_a76aae4778fbe89a3d59fd61fbc050cfa"><div class="ttname"><a href="#a76aae4778fbe89a3d59fd61fbc050cfa">test2</a></div><div class="ttdeci">bool test2()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d9d/large__factorial_8cpp_source.html#l00054">large_factorial.cpp:54</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a3f93b60e229b6683e24c4754a7106ee8" name="a3f93b60e229b6683e24c4754a7106ee8"></a>
@@ -219,8 +230,10 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Test implementation for 10! Result must be 3628800. </p><dl class="section return"><dt>Returns</dt><dd>True if test pass else False </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d9d/large__factorial_8cpp_source.html#l00017">17</a> of file <a class="el" href="../../d6/d9d/large__factorial_8cpp_source.html">large_factorial.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   17</span>             {</div>
-<div class="line"><span class="lineno">   18</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;---- Check 1\t&quot;</span>;</div>
+<div class="line"><span class="lineno">   18</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;---- Check 1\t&quot;</span>;</div>
 <div class="line"><span class="lineno">   19</span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i, number = 10;</div>
 <div class="line"><span class="lineno">   20</span>    <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   21</span>    <span class="keywordflow">for</span> (i = 2; i &lt;= number; i++) <span class="comment">/* Multiply every number from 2 thru N */</span></div>
@@ -229,32 +242,26 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   24</span>    <span class="keyword">const</span> <span class="keywordtype">char</span> *known_reslt = <span class="stringliteral">&quot;3628800&quot;</span>;</div>
 <div class="line"><span class="lineno">   25</span> </div>
 <div class="line"><span class="lineno">   26</span>    <span class="comment">/* check 1 */</span></div>
-<div class="line"><span class="lineno">   27</span>    <span class="keywordflow">if</span> (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strlen.html">strlen</a>(known_reslt) != <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.num_digits()) {</div>
-<div class="line"><span class="lineno">   28</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Result lengths dont match! &quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strlen.html">strlen</a>(known_reslt)</div>
-<div class="line"><span class="lineno">   29</span>                  &lt;&lt; <span class="stringliteral">&quot; != &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.num_digits() &lt;&lt; <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">   27</span>    <span class="keywordflow">if</span> (strlen(known_reslt) != <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.num_digits()) {</div>
+<div class="line"><span class="lineno">   28</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Result lengths dont match! &quot;</span> &lt;&lt; strlen(known_reslt)</div>
+<div class="line"><span class="lineno">   29</span>                  &lt;&lt; <span class="stringliteral">&quot; != &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.num_digits() &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   30</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   31</span>    }</div>
 <div class="line"><span class="lineno">   32</span> </div>
 <div class="line"><span class="lineno">   33</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.num_digits();</div>
 <div class="line"><span class="lineno">   34</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
 <div class="line"><span class="lineno">   35</span>        <span class="keywordflow">if</span> (known_reslt[i] != <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.digit_char(i)) {</div>
-<div class="line"><span class="lineno">   36</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;^th digit mismatch! &quot;</span> &lt;&lt; known_reslt[i]</div>
-<div class="line"><span class="lineno">   37</span>                      &lt;&lt; <span class="stringliteral">&quot; != &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.digit_char(i) &lt;&lt; <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">   36</span>            std::cerr &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;^th digit mismatch! &quot;</span> &lt;&lt; known_reslt[i]</div>
+<div class="line"><span class="lineno">   37</span>                      &lt;&lt; <span class="stringliteral">&quot; != &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.digit_char(i) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   38</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   39</span>        }</div>
 <div class="line"><span class="lineno">   40</span>    }</div>
 <div class="line"><span class="lineno">   41</span> </div>
-<div class="line"><span class="lineno">   42</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; <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">   42</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   43</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   44</span>}</div>
-<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
-<div class="ttc" id="astrlen_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strlen.html">std::strlen</a></div><div class="ttdeci">T strlen(T... args)</div></div>
-</div><!-- 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="../../d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.svg" width="180" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a76aae4778fbe89a3d59fd61fbc050cfa" name="a76aae4778fbe89a3d59fd61fbc050cfa"></a>
@@ -275,8 +282,10 @@ Here is the call graph for this function:</div>
 <div class="line">9993229915608941463976156518286253697920827223758251185210916864000000</div>
 <div class="line">000000000000000000</div>
 </div><!-- fragment --> <dl class="section return"><dt>Returns</dt><dd>True if test pass else False </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d9d/large__factorial_8cpp_source.html#l00054">54</a> of file <a class="el" href="../../d6/d9d/large__factorial_8cpp_source.html">large_factorial.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   54</span>             {</div>
-<div class="line"><span class="lineno">   55</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;---- Check 2\t&quot;</span>;</div>
+<div class="line"><span class="lineno">   55</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;---- Check 2\t&quot;</span>;</div>
 <div class="line"><span class="lineno">   56</span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i, number = 100;</div>
 <div class="line"><span class="lineno">   57</span>    <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   58</span>    <span class="keywordflow">for</span> (i = 2; i &lt;= number; i++) <span class="comment">/* Multiply every number from 2 thru N */</span></div>
@@ -288,30 +297,25 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   64</span>        <span class="stringliteral">&quot;000000000000000000&quot;</span>;</div>
 <div class="line"><span class="lineno">   65</span> </div>
 <div class="line"><span class="lineno">   66</span>    <span class="comment">/* check 1 */</span></div>
-<div class="line"><span class="lineno">   67</span>    <span class="keywordflow">if</span> (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strlen.html">strlen</a>(known_reslt) != <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.num_digits()) {</div>
-<div class="line"><span class="lineno">   68</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Result lengths dont match! &quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strlen.html">strlen</a>(known_reslt)</div>
-<div class="line"><span class="lineno">   69</span>                  &lt;&lt; <span class="stringliteral">&quot; != &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.num_digits() &lt;&lt; <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">   67</span>    <span class="keywordflow">if</span> (strlen(known_reslt) != <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.num_digits()) {</div>
+<div class="line"><span class="lineno">   68</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Result lengths dont match! &quot;</span> &lt;&lt; strlen(known_reslt)</div>
+<div class="line"><span class="lineno">   69</span>                  &lt;&lt; <span class="stringliteral">&quot; != &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.num_digits() &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   70</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   71</span>    }</div>
 <div class="line"><span class="lineno">   72</span> </div>
 <div class="line"><span class="lineno">   73</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.num_digits();</div>
 <div class="line"><span class="lineno">   74</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
 <div class="line"><span class="lineno">   75</span>        <span class="keywordflow">if</span> (known_reslt[i] != <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.digit_char(i)) {</div>
-<div class="line"><span class="lineno">   76</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;^th digit mismatch! &quot;</span> &lt;&lt; known_reslt[i]</div>
-<div class="line"><span class="lineno">   77</span>                      &lt;&lt; <span class="stringliteral">&quot; != &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.digit_char(i) &lt;&lt; <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">   76</span>            std::cerr &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;^th digit mismatch! &quot;</span> &lt;&lt; known_reslt[i]</div>
+<div class="line"><span class="lineno">   77</span>                      &lt;&lt; <span class="stringliteral">&quot; != &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.digit_char(i) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   78</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   79</span>        }</div>
 <div class="line"><span class="lineno">   80</span>    }</div>
 <div class="line"><span class="lineno">   81</span> </div>
-<div class="line"><span class="lineno">   82</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; <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">   82</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   83</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   84</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.svg" width="180" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
deleted file mode 100644
index 1e7f0820d..000000000
--- a/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,107,55,132"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/clock.html#" title=" " alt="" coords="113,5,192,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="41,105,101,48,115,38,118,42,104,52,45,108"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="250,156,321,182"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="54,106,84,95,122,86,163,84,203,92,239,114,267,142,264,146,236,118,201,97,162,89,123,92,86,100,56,111"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/fixed.html#" title=" " alt="" coords="103,107,202,132"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="55,117,87,117,87,122,55,122"/>
-<area shape="rect" id="Node000005" href="$d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8" title=" " alt="" coords="127,156,178,182"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="56,127,114,151,112,156,54,132"/>
-<area shape="rect" id="Node000006" href="$d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa" title=" " alt="" coords="127,205,178,231"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="43,131,69,161,104,192,115,199,112,203,101,196,66,164,39,134"/>
-<area shape="poly" id="edge5_Node000005_Node000003" title=" " alt="" coords="178,166,235,166,235,172,178,172"/>
-<area shape="poly" id="edge7_Node000006_Node000003" title=" " alt="" coords="177,207,235,185,237,190,179,212"/>
-</map>
diff --git a/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
deleted file mode 100644
index 9df960541..000000000
--- a/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9ae1761f5ea9d6db00149f47d44b634a
\ No newline at end of file
diff --git a/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
deleted file mode 100644
index 11541d54d..000000000
--- a/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ /dev/null
@@ -1,155 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="245pt" height="177pt"
- viewBox="0.00 0.00 245.00 177.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 173.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-93.25 0,-93.25 0,-74 37,-74 37,-93.25"/>
-<text text-anchor="middle" x="18.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="139.62,-169.25 80.88,-169.25 80.88,-150 139.62,-150 139.62,-169.25"/>
-<text text-anchor="middle" x="110.25" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.48,-93.39C38.73,-104.28 56.25,-122.14 73,-135.62 76.31,-138.29 79.92,-140.95 83.53,-143.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.4,-146.25 91.66,-148.89 85.28,-140.43 81.4,-146.25"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237,-56.25 183.5,-56.25 183.5,-37 237,-37 237,-56.25"/>
-<text text-anchor="middle" x="210.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.09,-91.68C62.35,-102.05 109.98,-117.1 147.5,-102.62 166.84,-95.16 183.87,-78.52 195.12,-65.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="197.74,-67.63 201.29,-57.65 192.29,-63.24 197.74,-67.63"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/fixed.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="147.5,-93.25 73,-93.25 73,-74 147.5,-74 147.5,-93.25"/>
-<text text-anchor="middle" x="110.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::scientific</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-83.62C44.26,-83.62 52.72,-83.62 61.33,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.11,-87.13 71.11,-83.63 61.11,-80.13 61.11,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.12,-56.25 91.38,-56.25 91.38,-37 129.12,-37 129.12,-56.25"/>
-<text text-anchor="middle" x="110.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-76.31C49.61,-71.21 66.39,-64.29 80.65,-58.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.63,-61.8 89.54,-54.75 78.96,-55.33 81.63,-61.8"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.12,-19.25 91.38,-19.25 91.38,0 129.12,0 129.12,-19.25"/>
-<text text-anchor="middle" x="110.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.98,-73.92C36.63,-61.9 54.38,-41.34 73,-27.62 75.51,-25.78 78.24,-24.03 81.04,-22.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.64,-25.51 89.87,-17.77 79.39,-19.31 82.64,-25.51"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge5_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge5_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.22,-46.62C141.17,-46.62 157.3,-46.62 171.94,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.75,-50.13 181.75,-46.63 171.75,-43.13 171.75,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge7_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge7_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.22,-16.41C141.41,-21.01 157.94,-27.25 172.81,-32.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.26,-36.02 181.85,-36.28 173.73,-29.47 171.26,-36.02"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
deleted file mode 100644
index 6388eef64..000000000
--- a/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
+++ /dev/null
@@ -1,129 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="245pt" height="177pt"
- viewBox="0.00 0.00 245.00 177.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 173.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-93.25 0,-93.25 0,-74 37,-74 37,-93.25"/>
-<text text-anchor="middle" x="18.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="139.62,-169.25 80.88,-169.25 80.88,-150 139.62,-150 139.62,-169.25"/>
-<text text-anchor="middle" x="110.25" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.48,-93.39C38.73,-104.28 56.25,-122.14 73,-135.62 76.31,-138.29 79.92,-140.95 83.53,-143.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.4,-146.25 91.66,-148.89 85.28,-140.43 81.4,-146.25"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237,-56.25 183.5,-56.25 183.5,-37 237,-37 237,-56.25"/>
-<text text-anchor="middle" x="210.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.09,-91.68C62.35,-102.05 109.98,-117.1 147.5,-102.62 166.84,-95.16 183.87,-78.52 195.12,-65.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="197.74,-67.63 201.29,-57.65 192.29,-63.24 197.74,-67.63"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/fixed.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="147.5,-93.25 73,-93.25 73,-74 147.5,-74 147.5,-93.25"/>
-<text text-anchor="middle" x="110.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::scientific</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-83.62C44.26,-83.62 52.72,-83.62 61.33,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.11,-87.13 71.11,-83.63 61.11,-80.13 61.11,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.12,-56.25 91.38,-56.25 91.38,-37 129.12,-37 129.12,-56.25"/>
-<text text-anchor="middle" x="110.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-76.31C49.61,-71.21 66.39,-64.29 80.65,-58.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.63,-61.8 89.54,-54.75 78.96,-55.33 81.63,-61.8"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.12,-19.25 91.38,-19.25 91.38,0 129.12,0 129.12,-19.25"/>
-<text text-anchor="middle" x="110.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.98,-73.92C36.63,-61.9 54.38,-41.34 73,-27.62 75.51,-25.78 78.24,-24.03 81.04,-22.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.64,-25.51 89.87,-17.77 79.39,-19.31 82.64,-25.51"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge5_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge5_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.22,-46.62C141.17,-46.62 157.3,-46.62 171.94,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.75,-50.13 181.75,-46.63 171.75,-43.13 171.75,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge7_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge7_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.22,-16.41C141.41,-21.01 157.94,-27.25 172.81,-32.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.26,-36.02 181.85,-36.28 173.73,-29.47 171.26,-36.02"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.map b/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.map
deleted file mode 100644
index c45916312..000000000
--- a/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test1" name="test1">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,56,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="104,5,175,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,16,88,16,88,21,56,21"/>
-</map>
diff --git a/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.md5 b/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.md5
deleted file mode 100644
index 737ebf09c..000000000
--- a/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c82d94cab4d14bbd1876c473e3df25a1
\ No newline at end of file
diff --git a/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.svg b/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.svg
deleted file mode 100644
index 10c6a759b..000000000
--- a/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 135.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-19.25 73.75,-19.25 73.75,0 127.25,0 127.25,-19.25"/>
-<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.14,-9.62 53.69,-9.62 62.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.84,-13.13 71.83,-9.63 61.83,-6.13 61.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph_org.svg b/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph_org.svg
deleted file mode 100644
index 3f3c94efb..000000000
--- a/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 135.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-19.25 73.75,-19.25 73.75,0 127.25,0 127.25,-19.25"/>
-<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.14,-9.62 53.69,-9.62 62.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.84,-13.13 71.83,-9.63 61.83,-6.13 61.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.map b/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.map
deleted file mode 100644
index 5f8ade4d6..000000000
--- a/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test2" name="test2">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,56,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="104,5,175,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,16,88,16,88,21,56,21"/>
-</map>
diff --git a/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.md5 b/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.md5
deleted file mode 100644
index 22c916591..000000000
--- a/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-10e4e477c026513c1f33e3869f15052d
\ No newline at end of file
diff --git a/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.svg b/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.svg
deleted file mode 100644
index 45eacaf27..000000000
--- a/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 135.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-19.25 73.75,-19.25 73.75,0 127.25,0 127.25,-19.25"/>
-<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.14,-9.62 53.69,-9.62 62.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.84,-13.13 71.83,-9.63 61.83,-6.13 61.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph_org.svg b/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph_org.svg
deleted file mode 100644
index 6ccbed777..000000000
--- a/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 135.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-19.25 73.75,-19.25 73.75,0 127.25,0 127.25,-19.25"/>
-<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.14,-9.62 53.69,-9.62 62.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.84,-13.13 71.83,-9.63 61.83,-6.13 61.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/d9d/large__factorial_8cpp_source.html b/d6/d9d/large__factorial_8cpp_source.html
new file mode 100644
index 000000000..c254e3dff
--- /dev/null
+++ b/d6/d9d/large__factorial_8cpp_source.html
@@ -0,0 +1,246 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/large_factorial.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/d9d/large__factorial_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">large_factorial.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/d9d/large__factorial_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &quot;<a class="code" href="../../d4/d86/large__number_8h.html">./large_number.h</a>&quot;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="foldopen" id="foldopen00017" data-start="{" data-end="}">
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"><a class="line" href="../../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8">   17</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8">test1</a>() {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;---- Check 1\t&quot;</span>;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i, number = 10;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> result;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keywordflow">for</span> (i = 2; i &lt;= number; i++) <span class="comment">/* Multiply every number from 2 thru N */</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        result *= i;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="keyword">const</span> <span class="keywordtype">char</span> *known_reslt = <span class="stringliteral">&quot;3628800&quot;</span>;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="comment">/* check 1 */</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordflow">if</span> (strlen(known_reslt) != result.num_digits()) {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Result lengths dont match! &quot;</span> &lt;&lt; strlen(known_reslt)</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>                  &lt;&lt; <span class="stringliteral">&quot; != &quot;</span> &lt;&lt; result.num_digits() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    }</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> N = result.num_digits();</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">for</span> (i = 0; i &lt; N; i++) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        <span class="keywordflow">if</span> (known_reslt[i] != result.digit_char(i)) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>            std::cerr &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;^th digit mismatch! &quot;</span> &lt;&lt; known_reslt[i]</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>                      &lt;&lt; <span class="stringliteral">&quot; != &quot;</span> &lt;&lt; result.digit_char(i) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        }</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    }</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>}</div>
+</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="foldopen" id="foldopen00054" data-start="{" data-end="}">
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="../../d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa">   54</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa">test2</a>() {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;---- Check 2\t&quot;</span>;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i, number = 100;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> result;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordflow">for</span> (i = 2; i &lt;= number; i++) <span class="comment">/* Multiply every number from 2 thru N */</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        result *= i;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keyword">const</span> <span class="keywordtype">char</span> *known_reslt =</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="stringliteral">&quot;9332621544394415268169923885626670049071596826438162146859296389521759&quot;</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="stringliteral">&quot;9993229915608941463976156518286253697920827223758251185210916864000000&quot;</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        <span class="stringliteral">&quot;000000000000000000&quot;</span>;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="comment">/* check 1 */</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">if</span> (strlen(known_reslt) != result.num_digits()) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Result lengths dont match! &quot;</span> &lt;&lt; strlen(known_reslt)</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>                  &lt;&lt; <span class="stringliteral">&quot; != &quot;</span> &lt;&lt; result.num_digits() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> N = result.num_digits();</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keywordflow">for</span> (i = 0; i &lt; N; i++) {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        <span class="keywordflow">if</span> (known_reslt[i] != result.digit_char(i)) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>            std::cerr &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;^th digit mismatch! &quot;</span> &lt;&lt; known_reslt[i]</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>                      &lt;&lt; <span class="stringliteral">&quot; != &quot;</span> &lt;&lt; result.digit_char(i) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    }</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>}</div>
+</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="foldopen" id="foldopen00089" data-start="{" data-end="}">
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"><a class="line" href="../../d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">   89</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[]) {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="keywordtype">int</span> number, i;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keywordflow">if</span> (argc == 2) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        number = atoi(argv[1]);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the value of n(n starts from 0 ): &quot;</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        std::cin &gt;&gt; number;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    }</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span> </div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> result;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    std::clock_t start_time = std::clock();</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="keywordflow">for</span> (i = 2; i &lt;= number; i++) <span class="comment">/* Multiply every number from 2 thru N */</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        result *= i;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::clock_t end_time = std::clock();</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="keywordtype">double</span> time_taken =</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end_time - start_time) / CLOCKS_PER_SEC;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    std::cout &lt;&lt; number &lt;&lt; <span class="stringliteral">&quot;! = &quot;</span> &lt;&lt; result &lt;&lt; std::endl</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>              &lt;&lt; <span class="stringliteral">&quot;Number of digits: &quot;</span> &lt;&lt; result.num_digits() &lt;&lt; std::endl</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>              &lt;&lt; <span class="stringliteral">&quot;Time taken: &quot;</span> &lt;&lt; std::scientific &lt;&lt; time_taken &lt;&lt; <span class="stringliteral">&quot; s&quot;</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <a class="code hl_function" href="../../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8">test1</a>();</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <a class="code hl_function" href="../../d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa">test2</a>();</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    result.test();</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>}</div>
+</div>
+<div class="ttc" id="aclasslarge__number_html"><div class="ttname"><a href="../../db/d82/classlarge__number.html">large_number</a></div><div class="ttdef"><b>Definition</b> <a href="../../d4/d86/large__number_8h_source.html#l00024">large_number.h:24</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="alarge__factorial_8cpp_html_a3f93b60e229b6683e24c4754a7106ee8"><div class="ttname"><a href="../../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8">test1</a></div><div class="ttdeci">bool test1()</div><div class="ttdef"><b>Definition</b> <a href="#l00017">large_factorial.cpp:17</a></div></div>
+<div class="ttc" id="alarge__factorial_8cpp_html_a76aae4778fbe89a3d59fd61fbc050cfa"><div class="ttname"><a href="../../d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa">test2</a></div><div class="ttdeci">bool test2()</div><div class="ttdef"><b>Definition</b> <a href="#l00054">large_factorial.cpp:54</a></div></div>
+<div class="ttc" id="alarge__number_8h_html"><div class="ttname"><a href="../../d4/d86/large__number_8h.html">large_number.h</a></div><div class="ttdoc">Library to perform arithmatic operations on arbitrarily large numbers.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d6/d9d/large__factorial_8cpp.html">large_factorial.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.map b/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.map
index 95183a5ff..2eb834511 100644
--- a/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.map
+++ b/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.map
@@ -1,5 +1,5 @@
 <map id="machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info" name="machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info">
 <area shape="rect" id="Node000001" title="Struct that handles all the information related to the current state." alt="" coords="8,94,175,150"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="5,5,178,31"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,5,178,31"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="94,47,94,93,89,93,89,47"/>
 </map>
diff --git a/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.md5 b/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.md5
index bd39038a7..ac0210835 100644
--- a/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.md5
+++ b/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.md5
@@ -1 +1 @@
-d66a84d1b8a4a1b579ae25383f9596ac
\ No newline at end of file
+7366219303860b3d8c01928e0541c81e
\ No newline at end of file
diff --git a/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.svg b/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.svg
index eb539d500..1c77811b6 100644
--- a/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.svg
+++ b/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph.svg
@@ -33,7 +33,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="129.25,-108.25 0,-108.25 0,-89 129.25,-89 129.25,-108.25"/>
 <text text-anchor="middle" x="64.62" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Puzzle &gt;</text>
 </a>
diff --git a/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph_org.svg b/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph_org.svg
index 99aee1b3f..914fb177c 100644
--- a/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph_org.svg
+++ b/d6/d9e/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info__coll__graph_org.svg
@@ -22,7 +22,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="129.25,-108.25 0,-108.25 0,-89 129.25,-89 129.25,-108.25"/>
 <text text-anchor="middle" x="64.62" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Puzzle &gt;</text>
 </a>
diff --git a/d6/da2/namespacevigenere.html b/d6/da2/namespacevigenere.html
index 3aafeb955..f5ca9ddb9 100644
--- a/d6/da2/namespacevigenere.html
+++ b/d6/da2/namespacevigenere.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: vigenere Namespace Reference</title>
+<title>TheAlgorithms/C++: vigenere Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d6/da9/odd__even__sort_8cpp_source.html b/d6/da9/odd__even__sort_8cpp_source.html
new file mode 100644
index 000000000..ec5a62634
--- /dev/null
+++ b/d6/da9/odd__even__sort_8cpp_source.html
@@ -0,0 +1,191 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/odd_even_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/da9/odd__even__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">odd_even_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/* C++ implementation Odd Even Sort */</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span> </div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="keywordtype">void</span> oddEven(vector&lt;int&gt; &amp;arr, <span class="keywordtype">int</span> size) {</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>    <span class="keywordtype">bool</span> sorted = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    <span class="keywordflow">while</span> (!sorted) {</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>        sorted = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; size - 1; i += 2)  <span class="comment">// Odd</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>        {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>            <span class="keywordflow">if</span> (arr[i] &gt; arr[i + 1]) {</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>                swap(arr[i], arr[i + 1]);</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>                sorted = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>            }</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>        }</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size - 1; i += 2)  <span class="comment">// Even</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>            <span class="keywordflow">if</span> (arr[i] &gt; arr[i + 1]) {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>                swap(arr[i], arr[i + 1]);</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>                sorted = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>            }</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        }</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    }</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>}</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keywordtype">void</span> show(vector&lt;int&gt; A, <span class="keywordtype">int</span> size) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordtype">int</span> i;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordflow">for</span> (i = 0; i &lt; size; i++) cout &lt;&lt; A[i] &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>}</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordtype">int</span> size, temp;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the number of elements : &quot;</span>;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    cin &gt;&gt; size;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    vector&lt;int&gt; arr;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the unsorted elements : \n&quot;</span>;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        cin &gt;&gt; temp;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        arr.push_back(temp);</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    }</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    oddEven(arr, size);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    cout &lt;&lt; <span class="stringliteral">&quot;Sorted array\n&quot;</span>;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    show(arr, size);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><b>odd_even_sort.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/dab/namespacetree__234.html b/d6/dab/namespacetree__234.html
index bb3ede97d..91bc5c818 100644
--- a/d6/dab/namespacetree__234.html
+++ b/d6/dab/namespacetree__234.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: tree_234 Namespace Reference</title>
+<title>TheAlgorithms/C++: tree_234 Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html b/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html
index 8e47be331..30300e51c 100644
--- a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html
+++ b/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others::lru_cache::LRUCache Class Reference</title>
+<title>TheAlgorithms/C++: others::lru_cache::LRUCache Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -117,7 +134,7 @@ $(function(){initNavTree('d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html'
 <div class="dynheader">
 Collaboration diagram for others::lru_cache::LRUCache:</div>
 <div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.svg" width="100%" height="378"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.svg" width="636" height="107"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
@@ -140,17 +157,14 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a1aafd0444b410e0fcb66287e9954c893" id="r_a1aafd0444b410e0fcb66287e9954c893"><td class="memItemLeft" align="right" valign="top"><a id="a1aafd0444b410e0fcb66287e9954c893" name="a1aafd0444b410e0fcb66287e9954c893"></a>
-uint64_t&#160;</td><td class="memItemRight" valign="bottom"><b>pageFrame</b></td></tr>
-<tr class="memdesc:a1aafd0444b410e0fcb66287e9954c893"><td class="mdescLeft">&#160;</td><td class="mdescRight">Page frame, or total size of the cache. <br /></td></tr>
+<tr class="memitem:a1aafd0444b410e0fcb66287e9954c893" id="r_a1aafd0444b410e0fcb66287e9954c893"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1aafd0444b410e0fcb66287e9954c893">pageFrame</a></td></tr>
+<tr class="memdesc:a1aafd0444b410e0fcb66287e9954c893"><td class="mdescLeft">&#160;</td><td class="mdescRight">Page frame, or total size of the cache.  <br /></td></tr>
 <tr class="separator:a1aafd0444b410e0fcb66287e9954c893"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a3ee3560a6b90e6f50f6e063d690ba8e8" id="r_a3ee3560a6b90e6f50f6e063d690ba8e8"><td class="memItemLeft" align="right" valign="top"><a id="a3ee3560a6b90e6f50f6e063d690ba8e8" name="a3ee3560a6b90e6f50f6e063d690ba8e8"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>cache</b></td></tr>
-<tr class="memdesc:a3ee3560a6b90e6f50f6e063d690ba8e8"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../db/dde/namespaceothers_1_1_cache.html" title="Cache algorithm.">Cache</a> linked list (using the STL) <br /></td></tr>
+<tr class="memitem:a3ee3560a6b90e6f50f6e063d690ba8e8" id="r_a3ee3560a6b90e6f50f6e063d690ba8e8"><td class="memItemLeft" align="right" valign="top">std::list&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a></td></tr>
+<tr class="memdesc:a3ee3560a6b90e6f50f6e063d690ba8e8"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../db/dde/namespaceothers_1_1_cache.html" title="Cache algorithm.">Cache</a> linked list (using the STL)  <br /></td></tr>
 <tr class="separator:a3ee3560a6b90e6f50f6e063d690ba8e8"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa4d6db56109af196ffc7e5f72bc9907c" id="r_aa4d6db56109af196ffc7e5f72bc9907c"><td class="memItemLeft" align="right" valign="top"><a id="aa4d6db56109af196ffc7e5f72bc9907c" name="aa4d6db56109af196ffc7e5f72bc9907c"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a>&lt; uint64_t, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt; uint64_t &gt;::iterator &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>pageMap</b></td></tr>
-<tr class="memdesc:aa4d6db56109af196ffc7e5f72bc9907c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Hash map containing pages and their addresses. <br /></td></tr>
+<tr class="memitem:aa4d6db56109af196ffc7e5f72bc9907c" id="r_aa4d6db56109af196ffc7e5f72bc9907c"><td class="memItemLeft" align="right" valign="top">std::unordered_map&lt; uint64_t, std::list&lt; uint64_t &gt;::iterator &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa4d6db56109af196ffc7e5f72bc9907c">pageMap</a></td></tr>
+<tr class="memdesc:aa4d6db56109af196ffc7e5f72bc9907c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Hash map containing pages and their addresses.  <br /></td></tr>
 <tr class="separator:aa4d6db56109af196ffc7e5f72bc9907c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a5f33913e7ddfbb38062362e7bd859154" id="r_a5f33913e7ddfbb38062362e7bd859154"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5f33913e7ddfbb38062362e7bd859154">hits</a></td></tr>
 <tr class="memdesc:a5f33913e7ddfbb38062362e7bd859154"><td class="mdescLeft">&#160;</td><td class="mdescRight">was found in cache.  <br /></td></tr>
@@ -160,6 +174,8 @@ uint64_t&#160;</td><td class="memItemRight" valign="bottom"><b>pageFrame</b></td
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>LRU cache class. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html#l00068">68</a> of file <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html">lru_cache.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a41c9b6f1693b8a316cc4a2d8c9149ba4" name="a41c9b6f1693b8a316cc4a2d8c9149ba4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a41c9b6f1693b8a316cc4a2d8c9149ba4">&#9670;&#160;</a></span>LRUCache()</h2>
@@ -191,8 +207,10 @@ uint64_t&#160;</td><td class="memItemRight" valign="bottom"><b>pageFrame</b></td
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html#l00085">85</a> of file <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html">lru_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   85</span>{ <a class="code hl_variable" href="#a1aafd0444b410e0fcb66287e9954c893">pageFrame</a> = pf; }</div>
-<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_a1aafd0444b410e0fcb66287e9954c893"><div class="ttname"><a href="#a1aafd0444b410e0fcb66287e9954c893">others::lru_cache::LRUCache::pageFrame</a></div><div class="ttdeci">uint64_t pageFrame</div><div class="ttdoc">Page frame, or total size of the cache.</div><div class="ttdef"><b>Definition</b> lru_cache.cpp:69</div></div>
+<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_a1aafd0444b410e0fcb66287e9954c893"><div class="ttname"><a href="#a1aafd0444b410e0fcb66287e9954c893">others::lru_cache::LRUCache::pageFrame</a></div><div class="ttdeci">uint64_t pageFrame</div><div class="ttdoc">Page frame, or total size of the cache.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db3/lru__cache_8cpp_source.html#l00069">lru_cache.cpp:69</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -222,21 +240,16 @@ uint64_t&#160;</td><td class="memItemRight" valign="bottom"><b>pageFrame</b></td
 
 <p>A function to display the current cache. </p>
 <dl class="section return"><dt>Returns</dt><dd>Void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html#l00121">121</a> of file <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html">lru_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  121</span>                   {</div>
 <div class="line"><span class="lineno">  122</span>        <span class="keywordflow">for</span> (uint64_t &amp;it : <a class="code hl_variable" href="#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>) {</div>
-<div class="line"><span class="lineno">  123</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; it &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  123</span>            std::cout &lt;&lt; it &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">  124</span>        }</div>
-<div class="line"><span class="lineno">  125</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  125</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  126</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="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_a3ee3560a6b90e6f50f6e063d690ba8e8"><div class="ttname"><a href="#a3ee3560a6b90e6f50f6e063d690ba8e8">others::lru_cache::LRUCache::cache</a></div><div class="ttdeci">std::list&lt; uint64_t &gt; cache</div><div class="ttdoc">Cache linked list (using the STL)</div><div class="ttdef"><b>Definition</b> lru_cache.cpp:70</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><!-- 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="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_aad506b1c1a3cd5b93cc7e497626bfb53_cgraph.svg" width="266" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_a3ee3560a6b90e6f50f6e063d690ba8e8"><div class="ttname"><a href="#a3ee3560a6b90e6f50f6e063d690ba8e8">others::lru_cache::LRUCache::cache</a></div><div class="ttdeci">std::list&lt; uint64_t &gt; cache</div><div class="ttdoc">Cache linked list (using the STL)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db3/lru__cache_8cpp_source.html#l00070">lru_cache.cpp:70</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa24a141455b9fbcbec22392c28d04933" name="aa24a141455b9fbcbec22392c28d04933"></a>
@@ -264,8 +277,10 @@ Here is the call graph for this function:</div>
 
 <p>A function to get page hits. </p>
 <dl class="section return"><dt>Returns</dt><dd>int </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html#l00131">131</a> of file <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html">lru_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  131</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a5f33913e7ddfbb38062362e7bd859154">hits</a>; }</div>
-<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_a5f33913e7ddfbb38062362e7bd859154"><div class="ttname"><a href="#a5f33913e7ddfbb38062362e7bd859154">others::lru_cache::LRUCache::hits</a></div><div class="ttdeci">uint64_t hits</div><div class="ttdoc">was found in cache.</div><div class="ttdef"><b>Definition</b> lru_cache.cpp:74</div></div>
+<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_a5f33913e7ddfbb38062362e7bd859154"><div class="ttname"><a href="#a5f33913e7ddfbb38062362e7bd859154">others::lru_cache::LRUCache::hits</a></div><div class="ttdeci">uint64_t hits</div><div class="ttdoc">was found in cache.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db3/lru__cache_8cpp_source.html#l00074">lru_cache.cpp:74</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -294,8 +309,10 @@ Here is the call graph for this function:</div>
 
 <p>A function to get page fault. </p>
 <dl class="section return"><dt>Returns</dt><dd>int </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html#l00136">136</a> of file <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html">lru_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  136</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a09cbe562b0c396329607f5d388d57c9c">pageFault</a>; }</div>
-<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_a09cbe562b0c396329607f5d388d57c9c"><div class="ttname"><a href="#a09cbe562b0c396329607f5d388d57c9c">others::lru_cache::LRUCache::pageFault</a></div><div class="ttdeci">uint64_t pageFault</div><div class="ttdef"><b>Definition</b> lru_cache.cpp:77</div></div>
+<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_a09cbe562b0c396329607f5d388d57c9c"><div class="ttname"><a href="#a09cbe562b0c396329607f5d388d57c9c">others::lru_cache::LRUCache::pageFault</a></div><div class="ttdeci">uint64_t pageFault</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db3/lru__cache_8cpp_source.html#l00077">lru_cache.cpp:77</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -331,48 +348,63 @@ Here is the call graph for this function:</div>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
 <p>&lt; Increase the page fault by one.</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html#l00092">92</a> of file <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html">lru_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   92</span>                              {</div>
 <div class="line"><span class="lineno">   93</span>        <span class="comment">// If the page requested not in cache.</span></div>
-<div class="line"><span class="lineno">   94</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#aa4d6db56109af196ffc7e5f72bc9907c">pageMap</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">find</a>(page) == <a class="code hl_variable" href="#aa4d6db56109af196ffc7e5f72bc9907c">pageMap</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">end</a>()) {</div>
-<div class="line"><span class="lineno">   95</span>            <a class="code hl_variable" href="#a09cbe562b0c396329607f5d388d57c9c">pageFault</a>++;  <span class="comment">///&lt; Increase the page fault by one.</span></div>
+<div class="line"><span class="lineno">   94</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#aa4d6db56109af196ffc7e5f72bc9907c">pageMap</a>.find(page) == <a class="code hl_variable" href="#aa4d6db56109af196ffc7e5f72bc9907c">pageMap</a>.end()) {</div>
+<div class="line"><span class="lineno">   95</span>            <a class="code hl_variable" href="#a09cbe562b0c396329607f5d388d57c9c">pageFault</a>++;  </div>
 <div class="line"><span class="lineno">   96</span> </div>
 <div class="line"><span class="lineno">   97</span>            <span class="comment">// Check if the cache is full</span></div>
-<div class="line"><span class="lineno">   98</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/size.html">size</a>() == <a class="code hl_variable" href="#a1aafd0444b410e0fcb66287e9954c893">pageFrame</a>) {</div>
+<div class="line"><span class="lineno">   98</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>.size() == <a class="code hl_variable" href="#a1aafd0444b410e0fcb66287e9954c893">pageFrame</a>) {</div>
 <div class="line"><span class="lineno">   99</span>                <span class="comment">// delete the last page from cache</span></div>
-<div class="line"><span class="lineno">  100</span>                uint64_t lastPage = <a class="code hl_variable" href="#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/back.html">back</a>();</div>
-<div class="line"><span class="lineno">  101</span>                <a class="code hl_variable" href="#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/pop_back.html">pop_back</a>();</div>
-<div class="line"><span class="lineno">  102</span>                <a class="code hl_variable" href="#aa4d6db56109af196ffc7e5f72bc9907c">pageMap</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/erase.html">erase</a>(lastPage);</div>
+<div class="line"><span class="lineno">  100</span>                uint64_t lastPage = <a class="code hl_variable" href="#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>.back();</div>
+<div class="line"><span class="lineno">  101</span>                <a class="code hl_variable" href="#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>.pop_back();</div>
+<div class="line"><span class="lineno">  102</span>                <a class="code hl_variable" href="#aa4d6db56109af196ffc7e5f72bc9907c">pageMap</a>.erase(lastPage);</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">// The requested page is in the cache</span></div>
 <div class="line"><span class="lineno">  106</span>        <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">  107</span>            <a class="code hl_variable" href="#a5f33913e7ddfbb38062362e7bd859154">hits</a>++;</div>
 <div class="line"><span class="lineno">  108</span>            <span class="comment">// present in cache, erase from current position to bring in front</span></div>
-<div class="line"><span class="lineno">  109</span>            <a class="code hl_variable" href="#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/erase.html">erase</a>(<a class="code hl_variable" href="#aa4d6db56109af196ffc7e5f72bc9907c">pageMap</a>[page]);</div>
+<div class="line"><span class="lineno">  109</span>            <a class="code hl_variable" href="#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>.erase(<a class="code hl_variable" href="#aa4d6db56109af196ffc7e5f72bc9907c">pageMap</a>[page]);</div>
 <div class="line"><span class="lineno">  110</span>        }</div>
 <div class="line"><span class="lineno">  111</span>        <span class="comment">// Push it in the front of the cache and update the page reference in</span></div>
 <div class="line"><span class="lineno">  112</span>        <span class="comment">// page map.</span></div>
-<div class="line"><span class="lineno">  113</span>        <a class="code hl_variable" href="#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/push_front.html">push_front</a>(page);</div>
-<div class="line"><span class="lineno">  114</span>        <a class="code hl_variable" href="#aa4d6db56109af196ffc7e5f72bc9907c">pageMap</a>[page] = <a class="code hl_variable" href="#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/begin.html">begin</a>();</div>
+<div class="line"><span class="lineno">  113</span>        <a class="code hl_variable" href="#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>.push_front(page);</div>
+<div class="line"><span class="lineno">  114</span>        <a class="code hl_variable" href="#aa4d6db56109af196ffc7e5f72bc9907c">pageMap</a>[page] = <a class="code hl_variable" href="#a3ee3560a6b90e6f50f6e063d690ba8e8">cache</a>.begin();</div>
 <div class="line"><span class="lineno">  115</span>    }</div>
-<div class="ttc" id="aback_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/back.html">std::list::back</a></div><div class="ttdeci">T back(T... args)</div></div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/begin.html">std::list::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_aa4d6db56109af196ffc7e5f72bc9907c"><div class="ttname"><a href="#aa4d6db56109af196ffc7e5f72bc9907c">others::lru_cache::LRUCache::pageMap</a></div><div class="ttdeci">std::unordered_map&lt; uint64_t, std::list&lt; uint64_t &gt;::iterator &gt; pageMap</div><div class="ttdoc">Hash map containing pages and their addresses.</div><div class="ttdef"><b>Definition</b> lru_cache.cpp:72</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">std::unordered_map::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="aerase_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map/erase.html">std::unordered_map::erase</a></div><div class="ttdeci">T erase(T... args)</div></div>
-<div class="ttc" id="afind_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">std::unordered_map::find</a></div><div class="ttdeci">T find(T... args)</div></div>
-<div class="ttc" id="apop_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/pop_back.html">std::list::pop_back</a></div><div class="ttdeci">T pop_back(T... args)</div></div>
-<div class="ttc" id="apush_front_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/push_front.html">std::list::push_front</a></div><div class="ttdeci">T push_front(T... args)</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/size.html">std::list::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_a7dbf04bf7e1472c48639694f0b110602_cgraph.svg" width="354" height="463"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassothers_1_1lru__cache_1_1_l_r_u_cache_html_aa4d6db56109af196ffc7e5f72bc9907c"><div class="ttname"><a href="#aa4d6db56109af196ffc7e5f72bc9907c">others::lru_cache::LRUCache::pageMap</a></div><div class="ttdeci">std::unordered_map&lt; uint64_t, std::list&lt; uint64_t &gt;::iterator &gt; pageMap</div><div class="ttdoc">Hash map containing pages and their addresses.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/db3/lru__cache_8cpp_source.html#l00072">lru_cache.cpp:72</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
+<a id="a3ee3560a6b90e6f50f6e063d690ba8e8" name="a3ee3560a6b90e6f50f6e063d690ba8e8"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a3ee3560a6b90e6f50f6e063d690ba8e8">&#9670;&#160;</a></span>cache</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::list&lt;uint64_t&gt; others::lru_cache::LRUCache::cache</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p><a class="el" href="../../db/dde/namespaceothers_1_1_cache.html" title="Cache algorithm.">Cache</a> linked list (using the STL) </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html#l00070">70</a> of file <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html">lru_cache.cpp</a>.</p>
+
+</div>
+</div>
 <a id="a5f33913e7ddfbb38062362e7bd859154" name="a5f33913e7ddfbb38062362e7bd859154"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a5f33913e7ddfbb38062362e7bd859154">&#9670;&#160;</a></span>hits</h2>
 
@@ -398,6 +430,8 @@ Here is the call graph for this function:</div>
 <p>was found in cache. </p>
 <p>Total number of hits, or total number of times a page </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html#l00074">74</a> of file <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html">lru_cache.cpp</a>.</p>
+
 </div>
 </div>
 <a id="a09cbe562b0c396329607f5d388d57c9c" name="a09cbe562b0c396329607f5d388d57c9c"></a>
@@ -421,10 +455,64 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 <p>Total number of miss/page fault, or total number of times a page was not found in cache </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html">lru_cache.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a1aafd0444b410e0fcb66287e9954c893" name="a1aafd0444b410e0fcb66287e9954c893"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a1aafd0444b410e0fcb66287e9954c893">&#9670;&#160;</a></span>pageFrame</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">uint64_t others::lru_cache::LRUCache::pageFrame</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Page frame, or total size of the cache. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html#l00069">69</a> of file <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html">lru_cache.cpp</a>.</p>
+
+</div>
+</div>
+<a id="aa4d6db56109af196ffc7e5f72bc9907c" name="aa4d6db56109af196ffc7e5f72bc9907c"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aa4d6db56109af196ffc7e5f72bc9907c">&#9670;&#160;</a></span>pageMap</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::unordered_map&lt;uint64_t, std::list&lt;uint64_t&gt;::iterator&gt; others::lru_cache::LRUCache::pageMap</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Hash map containing pages and their addresses. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html#l00072">72</a> of file <a class="el" href="../../d3/db3/lru__cache_8cpp_source.html">lru_cache.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>others/<a class="el" href="../../d3/db3/lru__cache_8cpp.html">lru_cache.cpp</a></li>
+<li>others/<a class="el" href="../../d3/db3/lru__cache_8cpp_source.html">lru_cache.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_a7dbf04bf7e1472c48639694f0b110602_cgraph.map b/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_a7dbf04bf7e1472c48639694f0b110602_cgraph.map
deleted file mode 100644
index b9f7a1c49..000000000
--- a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_a7dbf04bf7e1472c48639694f0b110602_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="others::lru_cache::LRUCache::refer" name="others::lru_cache::LRUCache::refer">
-<area shape="rect" id="Node000001" title="Refer to a page, or request a page from memory." alt="" coords="5,203,135,244"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/back.html#" title=" " alt="" coords="215,5,316,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="76,202,90,167,112,123,143,78,181,40,199,29,202,34,184,44,147,82,117,126,95,169,81,204"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/begin.html#" title=" " alt="" coords="214,55,317,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="81,201,121,146,149,115,181,89,198,80,201,85,184,94,153,119,125,149,85,204"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/end.html#" title=" " alt="" coords="183,104,348,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="92,201,132,169,181,138,194,133,196,138,184,143,135,173,96,205"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/erase.html#" title=" " alt="" coords="213,153,318,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="134,202,203,181,205,187,136,207"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/erase.html#" title=" " alt="" coords="197,203,334,244"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="135,221,182,221,182,226,135,226"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/find.html#" title=" " alt="" coords="197,268,334,309"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="134,242,189,261,187,266,132,247"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/pop_back.html#" title=" " alt="" coords="201,333,330,359"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="92,242,132,281,184,319,197,325,195,330,181,323,129,285,88,246"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/push_front.html#" title=" " alt="" coords="199,383,332,408"/>
-<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="84,243,122,306,151,340,184,369,191,373,188,378,181,374,147,344,118,309,79,245"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/size.html#" title=" " alt="" coords="217,432,314,458"/>
-<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="80,243,93,281,115,329,145,377,184,419,204,430,201,435,181,423,141,380,110,331,88,283,75,245"/>
-</map>
diff --git a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_a7dbf04bf7e1472c48639694f0b110602_cgraph.md5 b/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_a7dbf04bf7e1472c48639694f0b110602_cgraph.md5
deleted file mode 100644
index 0cbffcaf4..000000000
--- a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_a7dbf04bf7e1472c48639694f0b110602_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bbd6ca0cbda91d099128a3402b773d6f
\ No newline at end of file
diff --git a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_a7dbf04bf7e1472c48639694f0b110602_cgraph.svg b/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_a7dbf04bf7e1472c48639694f0b110602_cgraph.svg
deleted file mode 100644
index 99205a7ec..000000000
--- a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_a7dbf04bf7e1472c48639694f0b110602_cgraph.svg
+++ /dev/null
@@ -1,212 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::lru_cache::LRUCache::refer Pages: 1 -->
-<svg width="265pt" height="347pt"
- viewBox="0.00 0.00 265.00 347.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 343.25)">
-<title>others::lru_cache::LRUCache::refer</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Refer to a page, or request a page from memory.">
-<polygon fill="#999999" stroke="#666666" points="97,-190.88 0,-190.88 0,-160.38 97,-160.38 97,-190.88"/>
-<text text-anchor="start" x="8" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="48.5" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::refer</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.62,-339.25 157.38,-339.25 157.38,-320 232.62,-320 232.62,-339.25"/>
-<text text-anchor="middle" x="195" y="-325.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M54.79,-191.25C65.18,-219.58 90.99,-279.45 133,-311.62 137.05,-314.73 141.63,-317.3 146.42,-319.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.08,-322.67 155.67,-322.89 147.53,-316.11 145.08,-322.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.75,-302.25 156.25,-302.25 156.25,-283 233.75,-283 233.75,-302.25"/>
-<text text-anchor="middle" x="195" y="-288.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M58.47,-191.13C71.9,-212.98 99.3,-252.62 133,-274.62 136.9,-277.17 141.17,-279.37 145.59,-281.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.03,-284.41 154.62,-284.62 146.46,-277.85 144.03,-284.41"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257,-265.25 133,-265.25 133,-246 257,-246 257,-265.25"/>
-<text text-anchor="middle" x="195" y="-251.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.54,-191.13C82.63,-205.04 107.96,-225.13 133,-237.62 135.87,-239.06 138.88,-240.4 141.95,-241.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.54,-244.86 151.13,-245.02 142.96,-238.29 140.54,-244.86"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.12,-228.25 155.88,-228.25 155.88,-209 234.12,-209 234.12,-228.25"/>
-<text text-anchor="middle" x="195" y="-214.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.22,-189.82C113.91,-194.79 132.6,-200.35 149.06,-205.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.02,-208.59 158.6,-208.09 150.01,-201.88 148.02,-208.59"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.12,-190.88 143.88,-190.88 143.88,-160.38 246.12,-160.38 246.12,-190.88"/>
-<text text-anchor="start" x="151.88" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="195" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">::erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.22,-175.62C108.55,-175.62 120.81,-175.62 132.66,-175.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.34,-179.13 142.34,-175.63 132.34,-172.13 132.34,-179.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.12,-141.88 143.88,-141.88 143.88,-111.38 246.12,-111.38 246.12,-141.88"/>
-<text text-anchor="start" x="151.88" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="195" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.62,-159.99C108.78,-155.52 123.29,-150.6 137.02,-145.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.04,-149.3 146.39,-142.77 135.8,-142.67 138.04,-149.3"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.12,-93.25 146.88,-93.25 146.88,-74 243.12,-74 243.12,-93.25"/>
-<text text-anchor="middle" x="195" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.42,-160.09C78.92,-143.67 105.44,-118.05 133,-102.62 136.15,-100.86 139.48,-99.24 142.89,-97.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.86,-101.14 151.9,-94.24 141.31,-94.62 143.86,-101.14"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245,-56.25 145,-56.25 145,-37 245,-37 245,-56.25"/>
-<text text-anchor="middle" x="195" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M56.95,-160.22C69.36,-136.19 96.54,-89.91 133,-64.62 134.56,-63.54 136.18,-62.53 137.86,-61.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.04,-64.88 146.52,-57.38 136,-58.58 139.04,-64.88"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.12,-19.25 158.88,-19.25 158.88,0 231.12,0 231.12,-19.25"/>
-<text text-anchor="middle" x="195" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.94,-160.06C63.35,-129.88 88.21,-63.26 133,-27.62 137.48,-24.06 142.64,-21.21 148.02,-18.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.87,-22.33 157.11,-15.68 146.52,-15.74 148.87,-22.33"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_a7dbf04bf7e1472c48639694f0b110602_cgraph_org.svg b/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_a7dbf04bf7e1472c48639694f0b110602_cgraph_org.svg
deleted file mode 100644
index 72f5ab5d1..000000000
--- a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_a7dbf04bf7e1472c48639694f0b110602_cgraph_org.svg
+++ /dev/null
@@ -1,186 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::lru_cache::LRUCache::refer Pages: 1 -->
-<svg width="265pt" height="347pt"
- viewBox="0.00 0.00 265.00 347.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 343.25)">
-<title>others::lru_cache::LRUCache::refer</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Refer to a page, or request a page from memory.">
-<polygon fill="#999999" stroke="#666666" points="97,-190.88 0,-190.88 0,-160.38 97,-160.38 97,-190.88"/>
-<text text-anchor="start" x="8" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="48.5" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::refer</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.62,-339.25 157.38,-339.25 157.38,-320 232.62,-320 232.62,-339.25"/>
-<text text-anchor="middle" x="195" y="-325.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M54.79,-191.25C65.18,-219.58 90.99,-279.45 133,-311.62 137.05,-314.73 141.63,-317.3 146.42,-319.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.08,-322.67 155.67,-322.89 147.53,-316.11 145.08,-322.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.75,-302.25 156.25,-302.25 156.25,-283 233.75,-283 233.75,-302.25"/>
-<text text-anchor="middle" x="195" y="-288.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M58.47,-191.13C71.9,-212.98 99.3,-252.62 133,-274.62 136.9,-277.17 141.17,-279.37 145.59,-281.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.03,-284.41 154.62,-284.62 146.46,-277.85 144.03,-284.41"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257,-265.25 133,-265.25 133,-246 257,-246 257,-265.25"/>
-<text text-anchor="middle" x="195" y="-251.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.54,-191.13C82.63,-205.04 107.96,-225.13 133,-237.62 135.87,-239.06 138.88,-240.4 141.95,-241.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.54,-244.86 151.13,-245.02 142.96,-238.29 140.54,-244.86"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.12,-228.25 155.88,-228.25 155.88,-209 234.12,-209 234.12,-228.25"/>
-<text text-anchor="middle" x="195" y="-214.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.22,-189.82C113.91,-194.79 132.6,-200.35 149.06,-205.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.02,-208.59 158.6,-208.09 150.01,-201.88 148.02,-208.59"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.12,-190.88 143.88,-190.88 143.88,-160.38 246.12,-160.38 246.12,-190.88"/>
-<text text-anchor="start" x="151.88" y="-177.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="195" y="-166.12" font-family="Helvetica,sans-Serif" font-size="10.00">::erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.22,-175.62C108.55,-175.62 120.81,-175.62 132.66,-175.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.34,-179.13 142.34,-175.63 132.34,-172.13 132.34,-179.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.12,-141.88 143.88,-141.88 143.88,-111.38 246.12,-111.38 246.12,-141.88"/>
-<text text-anchor="start" x="151.88" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="195" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.62,-159.99C108.78,-155.52 123.29,-150.6 137.02,-145.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.04,-149.3 146.39,-142.77 135.8,-142.67 138.04,-149.3"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.12,-93.25 146.88,-93.25 146.88,-74 243.12,-74 243.12,-93.25"/>
-<text text-anchor="middle" x="195" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.42,-160.09C78.92,-143.67 105.44,-118.05 133,-102.62 136.15,-100.86 139.48,-99.24 142.89,-97.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.86,-101.14 151.9,-94.24 141.31,-94.62 143.86,-101.14"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245,-56.25 145,-56.25 145,-37 245,-37 245,-56.25"/>
-<text text-anchor="middle" x="195" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M56.95,-160.22C69.36,-136.19 96.54,-89.91 133,-64.62 134.56,-63.54 136.18,-62.53 137.86,-61.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.04,-64.88 146.52,-57.38 136,-58.58 139.04,-64.88"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.12,-19.25 158.88,-19.25 158.88,0 231.12,0 231.12,-19.25"/>
-<text text-anchor="middle" x="195" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.94,-160.06C63.35,-129.88 88.21,-63.26 133,-27.62 137.48,-24.06 142.64,-21.21 148.02,-18.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.87,-22.33 157.11,-15.68 146.52,-15.74 148.87,-22.33"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_aad506b1c1a3cd5b93cc7e497626bfb53_cgraph.map b/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_aad506b1c1a3cd5b93cc7e497626bfb53_cgraph.map
deleted file mode 100644
index 45db5bd8d..000000000
--- a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_aad506b1c1a3cd5b93cc7e497626bfb53_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="others::lru_cache::LRUCache::display" name="others::lru_cache::LRUCache::display">
-<area shape="rect" id="Node000001" title="A function to display the current cache." alt="" coords="5,5,141,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="189,13,260,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="141,23,173,23,173,28,141,28"/>
-</map>
diff --git a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_aad506b1c1a3cd5b93cc7e497626bfb53_cgraph.md5 b/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_aad506b1c1a3cd5b93cc7e497626bfb53_cgraph.md5
deleted file mode 100644
index b8beb7c4e..000000000
--- a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_aad506b1c1a3cd5b93cc7e497626bfb53_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-aacae8045e9b08b2917d2655f49834fe
\ No newline at end of file
diff --git a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_aad506b1c1a3cd5b93cc7e497626bfb53_cgraph.svg b/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_aad506b1c1a3cd5b93cc7e497626bfb53_cgraph.svg
deleted file mode 100644
index e5b987fe8..000000000
--- a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_aad506b1c1a3cd5b93cc7e497626bfb53_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::lru_cache::LRUCache::display Pages: 1 -->
-<svg width="199pt" height="39pt"
- viewBox="0.00 0.00 199.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>others::lru_cache::LRUCache::display</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function to display the current cache.">
-<polygon fill="#999999" stroke="#666666" points="101.5,-30.5 0,-30.5 0,0 101.5,0 101.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::display</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191,-24.88 137.5,-24.88 137.5,-5.63 191,-5.63 191,-24.88"/>
-<text text-anchor="middle" x="164.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.95,-15.25C109.92,-15.25 118.04,-15.25 125.65,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.59,-18.75 135.59,-15.25 125.59,-11.75 125.59,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_aad506b1c1a3cd5b93cc7e497626bfb53_cgraph_org.svg b/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_aad506b1c1a3cd5b93cc7e497626bfb53_cgraph_org.svg
deleted file mode 100644
index ec94c9105..000000000
--- a/d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache_aad506b1c1a3cd5b93cc7e497626bfb53_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::lru_cache::LRUCache::display Pages: 1 -->
-<svg width="199pt" height="39pt"
- viewBox="0.00 0.00 199.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>others::lru_cache::LRUCache::display</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function to display the current cache.">
-<polygon fill="#999999" stroke="#666666" points="101.5,-30.5 0,-30.5 0,0 101.5,0 101.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache::display</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191,-24.88 137.5,-24.88 137.5,-5.63 191,-5.63 191,-24.88"/>
-<text text-anchor="middle" x="164.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.95,-15.25C109.92,-15.25 118.04,-15.25 125.65,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.59,-18.75 135.59,-15.25 125.59,-11.75 125.59,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/db0/binomial__dist_8cpp.html b/d6/db0/binomial__dist_8cpp.html
index 5e6069888..a70a13250 100644
--- a/d6/db0/binomial__dist_8cpp.html
+++ b/d6/db0/binomial__dist_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: probability/binomial_dist.cpp File Reference</title>
+<title>TheAlgorithms/C++: probability/binomial_dist.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,7 +136,9 @@ Include dependency graph for binomial_dist.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d56/binomial__dist_8cpp__incl.svg" width="163" height="126"><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">
+</div>
+<p><a href="../../d6/db0/binomial__dist_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a4416a7bc7fa87201883c54cdc4c82813" id="r_a4416a7bc7fa87201883c54cdc4c82813"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4416a7bc7fa87201883c54cdc4c82813">binomial_expected</a> (double n, double p)</td></tr>
@@ -145,6 +164,8 @@ Functions</h2></td></tr>
 <li>p : probability of success</li>
 <li>x : desired successes </li>
 </ul>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/db0/binomial__dist_8cpp_source.html">binomial_dist.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a4416a7bc7fa87201883c54cdc4c82813" name="a4416a7bc7fa87201883c54cdc4c82813"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a4416a7bc7fa87201883c54cdc4c82813">&#9670;&#160;</a></span>binomial_expected()</h2>
@@ -172,6 +193,8 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>\(\mu=np\) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/db0/binomial__dist_8cpp_source.html#l00022">22</a> of file <a class="el" href="../../d6/db0/binomial__dist_8cpp_source.html">binomial_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   22</span>{ <span class="keywordflow">return</span> n * p; }</div>
 </div><!-- fragment -->
 </div>
@@ -207,23 +230,18 @@ Functions</h2></td></tr>
 <p>calculates the probability of a result within a range (inclusive, inclusive) </p><dl class="section return"><dt>Returns</dt><dd>\(\displaystyle \left.P(n,p)\right|_{x_0}^{x_1} =
 \sum_{i=x_0}^{x_1} P(i)
 =\sum_{i=x_0}^{x_1} {n\choose i} p^i (1-p)^{n-i}\) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/db0/binomial__dist_8cpp_source.html#l00074">74</a> of file <a class="el" href="../../d6/db0/binomial__dist_8cpp_source.html">binomial_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   75</span>                                                    {</div>
 <div class="line"><span class="lineno">   76</span>    <span class="keywordtype">double</span> <a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a> = 0;</div>
-<div class="line"><span class="lineno">   77</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = lower_bound; i &lt;= <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/upper_bound.html">upper_bound</a>; i++) {</div>
-<div class="line"><span class="lineno">   78</span>        <a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a> += <a class="code hl_function" href="#a78d36635232e54b5d71fcbf1eac9a49a">nCr</a>(n, i) * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(p, i) * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(1 - p, n - i);</div>
+<div class="line"><span class="lineno">   77</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = lower_bound; i &lt;= upper_bound; i++) {</div>
+<div class="line"><span class="lineno">   78</span>        <a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a> += <a class="code hl_function" href="#a78d36635232e54b5d71fcbf1eac9a49a">nCr</a>(n, i) * std::pow(p, i) * std::pow(1 - p, n - i);</div>
 <div class="line"><span class="lineno">   79</span>    }</div>
 <div class="line"><span class="lineno">   80</span>    <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a>;</div>
 <div class="line"><span class="lineno">   81</span>}</div>
-<div class="ttc" id="abinomial__dist_8cpp_html_a78d36635232e54b5d71fcbf1eac9a49a"><div class="ttname"><a href="#a78d36635232e54b5d71fcbf1eac9a49a">nCr</a></div><div class="ttdeci">double nCr(double n, double r)</div><div class="ttdef"><b>Definition</b> binomial_dist.cpp:47</div></div>
+<div class="ttc" id="abinomial__dist_8cpp_html_a78d36635232e54b5d71fcbf1eac9a49a"><div class="ttname"><a href="#a78d36635232e54b5d71fcbf1eac9a49a">nCr</a></div><div class="ttdeci">double nCr(double n, double r)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/db0/binomial__dist_8cpp_source.html#l00047">binomial_dist.cpp:47</a></div></div>
 <div class="ttc" id="anamespaceprobability_html"><div class="ttname"><a href="../../d4/ded/namespaceprobability.html">probability</a></div><div class="ttdoc">Probability algorithms.</div></div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-<div class="ttc" id="aupper_bound_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/upper_bound.html">std::upper_bound</a></div><div class="ttdeci">T upper_bound(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.svg" width="308" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af09e51f513cee647d41192ab0a872cdc" name="af09e51f513cee647d41192ab0a872cdc"></a>
@@ -252,17 +270,13 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>\(\sigma = \sqrt{\sigma^2} = \sqrt{n\cdot p\cdot (1-p)}\) </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   36</span>                                                       {</div>
-<div class="line"><span class="lineno">   37</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(<a class="code hl_function" href="#acd4dd4558031e4c5d045c801f73d8861">binomial_variance</a>(n, p));</div>
-<div class="line"><span class="lineno">   38</span>}</div>
-<div class="ttc" id="abinomial__dist_8cpp_html_acd4dd4558031e4c5d045c801f73d8861"><div class="ttname"><a href="#acd4dd4558031e4c5d045c801f73d8861">binomial_variance</a></div><div class="ttdeci">double binomial_variance(double n, double p)</div><div class="ttdef"><b>Definition</b> binomial_dist.cpp:29</div></div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.svg" width="370" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d6/db0/binomial__dist_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../d6/db0/binomial__dist_8cpp_source.html">binomial_dist.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   36</span>                                                       {</div>
+<div class="line"><span class="lineno">   37</span>    <span class="keywordflow">return</span> std::sqrt(<a class="code hl_function" href="#acd4dd4558031e4c5d045c801f73d8861">binomial_variance</a>(n, p));</div>
+<div class="line"><span class="lineno">   38</span>}</div>
+<div class="ttc" id="abinomial__dist_8cpp_html_acd4dd4558031e4c5d045c801f73d8861"><div class="ttname"><a href="#acd4dd4558031e4c5d045c801f73d8861">binomial_variance</a></div><div class="ttdeci">double binomial_variance(double n, double p)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/db0/binomial__dist_8cpp_source.html#l00029">binomial_dist.cpp:29</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="acd4dd4558031e4c5d045c801f73d8861" name="acd4dd4558031e4c5d045c801f73d8861"></a>
@@ -291,6 +305,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>\(\sigma^2 = n\cdot p\cdot (1-p)\) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/db0/binomial__dist_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../d6/db0/binomial__dist_8cpp_source.html">binomial_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   29</span>{ <span class="keywordflow">return</span> n * p * (1 - p); }</div>
 </div><!-- fragment -->
 </div>
@@ -319,15 +335,12 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>calculates the probability of exactly x successes </p><dl class="section return"><dt>Returns</dt><dd>\(\displaystyle P(n,p,x) = {n\choose x} p^x (1-p)^{n-x}\) </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   65</span>                                                          {</div>
-<div class="line"><span class="lineno">   66</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="#a78d36635232e54b5d71fcbf1eac9a49a">nCr</a>(n, x) * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(p, x) * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(1 - p, n - x);</div>
-<div class="line"><span class="lineno">   67</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.svg" width="284" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d6/db0/binomial__dist_8cpp_source.html#l00065">65</a> of file <a class="el" href="../../d6/db0/binomial__dist_8cpp_source.html">binomial_dist.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   65</span>                                                          {</div>
+<div class="line"><span class="lineno">   66</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="#a78d36635232e54b5d71fcbf1eac9a49a">nCr</a>(n, x) * std::pow(p, x) * std::pow(1 - p, n - x);</div>
+<div class="line"><span class="lineno">   67</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -345,35 +358,30 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/db0/binomial__dist_8cpp_source.html#l00084">84</a> of file <a class="el" href="../../d6/db0/binomial__dist_8cpp_source.html">binomial_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   84</span>           {</div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;expected value : &quot;</span> &lt;&lt; <a class="code hl_function" href="#a4416a7bc7fa87201883c54cdc4c82813">binomial_expected</a>(100, 0.5)</div>
-<div class="line"><span class="lineno">   86</span>              &lt;&lt; <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">   85</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;expected value : &quot;</span> &lt;&lt; <a class="code hl_function" href="#a4416a7bc7fa87201883c54cdc4c82813">binomial_expected</a>(100, 0.5)</div>
+<div class="line"><span class="lineno">   86</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   87</span> </div>
-<div class="line"><span class="lineno">   88</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;variance : &quot;</span> &lt;&lt; <a class="code hl_function" href="#acd4dd4558031e4c5d045c801f73d8861">binomial_variance</a>(100, 0.5) &lt;&lt; <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">   88</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;variance : &quot;</span> &lt;&lt; <a class="code hl_function" href="#acd4dd4558031e4c5d045c801f73d8861">binomial_variance</a>(100, 0.5) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   89</span> </div>
-<div class="line"><span class="lineno">   90</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;standard deviation : &quot;</span></div>
-<div class="line"><span class="lineno">   91</span>              &lt;&lt; <a class="code hl_function" href="#af09e51f513cee647d41192ab0a872cdc">binomial_standard_deviation</a>(100, 0.5) &lt;&lt; <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">   90</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;standard deviation : &quot;</span></div>
+<div class="line"><span class="lineno">   91</span>              &lt;&lt; <a class="code hl_function" href="#af09e51f513cee647d41192ab0a872cdc">binomial_standard_deviation</a>(100, 0.5) &lt;&lt; std::endl;</div>
 <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/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;exactly 30 successes : &quot;</span> &lt;&lt; <a class="code hl_function" href="#a19ae0a6a2bd200fd1eb0e31b2bf4cc76">binomial_x_successes</a>(100, 0.5, 30)</div>
-<div class="line"><span class="lineno">   94</span>              &lt;&lt; <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">   93</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;exactly 30 successes : &quot;</span> &lt;&lt; <a class="code hl_function" href="#a19ae0a6a2bd200fd1eb0e31b2bf4cc76">binomial_x_successes</a>(100, 0.5, 30)</div>
+<div class="line"><span class="lineno">   94</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   95</span> </div>
-<div class="line"><span class="lineno">   96</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;45 or more successes : &quot;</span></div>
-<div class="line"><span class="lineno">   97</span>              &lt;&lt; <a class="code hl_function" href="#a76ed6ce71415fb400b65f0656cef3d25">binomial_range_successes</a>(100, 0.5, 45, 100) &lt;&lt; <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">   96</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;45 or more successes : &quot;</span></div>
+<div class="line"><span class="lineno">   97</span>              &lt;&lt; <a class="code hl_function" href="#a76ed6ce71415fb400b65f0656cef3d25">binomial_range_successes</a>(100, 0.5, 45, 100) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   98</span> </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="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="abinomial__dist_8cpp_html_a19ae0a6a2bd200fd1eb0e31b2bf4cc76"><div class="ttname"><a href="#a19ae0a6a2bd200fd1eb0e31b2bf4cc76">binomial_x_successes</a></div><div class="ttdeci">double binomial_x_successes(double n, double p, double x)</div><div class="ttdef"><b>Definition</b> binomial_dist.cpp:65</div></div>
-<div class="ttc" id="abinomial__dist_8cpp_html_a4416a7bc7fa87201883c54cdc4c82813"><div class="ttname"><a href="#a4416a7bc7fa87201883c54cdc4c82813">binomial_expected</a></div><div class="ttdeci">double binomial_expected(double n, double p)</div><div class="ttdef"><b>Definition</b> binomial_dist.cpp:22</div></div>
-<div class="ttc" id="abinomial__dist_8cpp_html_a76ed6ce71415fb400b65f0656cef3d25"><div class="ttname"><a href="#a76ed6ce71415fb400b65f0656cef3d25">binomial_range_successes</a></div><div class="ttdeci">double binomial_range_successes(double n, double p, double lower_bound, double upper_bound)</div><div class="ttdef"><b>Definition</b> binomial_dist.cpp:74</div></div>
-<div class="ttc" id="abinomial__dist_8cpp_html_af09e51f513cee647d41192ab0a872cdc"><div class="ttname"><a href="#af09e51f513cee647d41192ab0a872cdc">binomial_standard_deviation</a></div><div class="ttdeci">double binomial_standard_deviation(double n, double p)</div><div class="ttdef"><b>Definition</b> binomial_dist.cpp:36</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><!-- 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="../../d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="467" height="286"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="abinomial__dist_8cpp_html_a19ae0a6a2bd200fd1eb0e31b2bf4cc76"><div class="ttname"><a href="#a19ae0a6a2bd200fd1eb0e31b2bf4cc76">binomial_x_successes</a></div><div class="ttdeci">double binomial_x_successes(double n, double p, double x)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/db0/binomial__dist_8cpp_source.html#l00065">binomial_dist.cpp:65</a></div></div>
+<div class="ttc" id="abinomial__dist_8cpp_html_a4416a7bc7fa87201883c54cdc4c82813"><div class="ttname"><a href="#a4416a7bc7fa87201883c54cdc4c82813">binomial_expected</a></div><div class="ttdeci">double binomial_expected(double n, double p)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/db0/binomial__dist_8cpp_source.html#l00022">binomial_dist.cpp:22</a></div></div>
+<div class="ttc" id="abinomial__dist_8cpp_html_a76ed6ce71415fb400b65f0656cef3d25"><div class="ttname"><a href="#a76ed6ce71415fb400b65f0656cef3d25">binomial_range_successes</a></div><div class="ttdeci">double binomial_range_successes(double n, double p, double lower_bound, double upper_bound)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/db0/binomial__dist_8cpp_source.html#l00074">binomial_dist.cpp:74</a></div></div>
+<div class="ttc" id="abinomial__dist_8cpp_html_af09e51f513cee647d41192ab0a872cdc"><div class="ttname"><a href="#af09e51f513cee647d41192ab0a872cdc">binomial_standard_deviation</a></div><div class="ttdeci">double binomial_standard_deviation(double n, double p)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/db0/binomial__dist_8cpp_source.html#l00036">binomial_dist.cpp:36</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a78d36635232e54b5d71fcbf1eac9a49a" name="a78d36635232e54b5d71fcbf1eac9a49a"></a>
@@ -404,6 +412,8 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>\(\displaystyle {n\choose r} =
 \frac{n!}{r!(n-r)!} = \frac{n\times(n-1)\times(n-2)\times\cdots(n-r)}{r!}
 \) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/db0/binomial__dist_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../d6/db0/binomial__dist_8cpp_source.html">binomial_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   47</span>                               {</div>
 <div class="line"><span class="lineno">   48</span>    <span class="keywordtype">double</span> numerator = n;</div>
 <div class="line"><span class="lineno">   49</span>    <span class="keywordtype">double</span> denominator = r;</div>
diff --git a/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.map b/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.map
deleted file mode 100644
index 6f7b6195b..000000000
--- a/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="binomial_x_successes" name="binomial_x_successes">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,159,56"/>
-<area shape="rect" id="Node000002" href="$d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a" title=" " alt="" coords="221,5,264,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,29,205,21,206,26,159,34"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="207,55,278,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="159,52,192,57,191,63,159,58"/>
-</map>
diff --git a/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.md5 b/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.md5
deleted file mode 100644
index 5cde5127a..000000000
--- a/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-80d540e520d99d1142ca1474af9ff891
\ No newline at end of file
diff --git a/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.svg b/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.svg
deleted file mode 100644
index 618bb43ce..000000000
--- a/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binomial_x_successes Pages: 1 -->
-<svg width="213pt" height="64pt"
- viewBox="0.00 0.00 212.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>binomial_x_successes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="115,-37.25 0,-37.25 0,-18 115,-18 115,-37.25"/>
-<text text-anchor="middle" x="57.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">binomial_x_successes</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.62,-56.25 161.88,-56.25 161.88,-37 193.62,-37 193.62,-56.25"/>
-<text text-anchor="middle" x="177.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">nCr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.2,-36.74C127.47,-38.71 139.88,-40.7 150.31,-42.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.59,-45.81 160.02,-43.94 150.71,-38.9 149.59,-45.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.5,-19.25 151,-19.25 151,0 204.5,0 204.5,-19.25"/>
-<text text-anchor="middle" x="177.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.2,-18.99C123.47,-17.74 131.8,-16.47 139.54,-15.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.91,-18.77 149.27,-13.81 138.85,-11.85 139.91,-18.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph_org.svg b/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph_org.svg
deleted file mode 100644
index d4e5a3a90..000000000
--- a/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binomial_x_successes Pages: 1 -->
-<svg width="213pt" height="64pt"
- viewBox="0.00 0.00 212.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>binomial_x_successes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="115,-37.25 0,-37.25 0,-18 115,-18 115,-37.25"/>
-<text text-anchor="middle" x="57.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">binomial_x_successes</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.62,-56.25 161.88,-56.25 161.88,-37 193.62,-37 193.62,-56.25"/>
-<text text-anchor="middle" x="177.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">nCr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.2,-36.74C127.47,-38.71 139.88,-40.7 150.31,-42.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.59,-45.81 160.02,-43.94 150.71,-38.9 149.59,-45.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.5,-19.25 151,-19.25 151,0 204.5,0 204.5,-19.25"/>
-<text text-anchor="middle" x="177.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.2,-18.99C123.47,-17.74 131.8,-16.47 139.54,-15.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.91,-18.77 149.27,-13.81 138.85,-11.85 139.91,-18.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.map b/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.map
deleted file mode 100644
index f92f9aeda..000000000
--- a/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="binomial_range_successes" name="binomial_range_successes">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,184,56"/>
-<area shape="rect" id="Node000002" href="$d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a" title=" " alt="" coords="246,5,288,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="184,28,231,21,231,26,184,33"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="232,55,303,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="184,53,217,58,216,63,184,59"/>
-</map>
diff --git a/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.md5 b/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.md5
deleted file mode 100644
index 5be3ca919..000000000
--- a/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a65a244aa38ec11aa07df0740aad2c99
\ No newline at end of file
diff --git a/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.svg b/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.svg
deleted file mode 100644
index c954a94ac..000000000
--- a/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binomial_range_successes Pages: 1 -->
-<svg width="231pt" height="64pt"
- viewBox="0.00 0.00 231.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>binomial_range_successes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="133.75,-37.25 0,-37.25 0,-18 133.75,-18 133.75,-37.25"/>
-<text text-anchor="middle" x="66.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">binomial_range_successes</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="212.38,-56.25 180.62,-56.25 180.62,-37 212.38,-37 212.38,-56.25"/>
-<text text-anchor="middle" x="196.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">nCr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.93,-37.46C146.43,-39.32 158.82,-41.16 169.17,-42.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.37,-46.12 178.77,-44.13 169.4,-39.2 168.37,-46.12"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.25,-19.25 169.75,-19.25 169.75,0 223.25,0 223.25,-19.25"/>
-<text text-anchor="middle" x="196.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.93,-18.31C142.33,-17.12 150.68,-15.95 158.39,-14.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.63,-18.36 168.04,-13.5 157.65,-11.43 158.63,-18.36"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph_org.svg b/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph_org.svg
deleted file mode 100644
index 6ee32fb40..000000000
--- a/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binomial_range_successes Pages: 1 -->
-<svg width="231pt" height="64pt"
- viewBox="0.00 0.00 231.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>binomial_range_successes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="133.75,-37.25 0,-37.25 0,-18 133.75,-18 133.75,-37.25"/>
-<text text-anchor="middle" x="66.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">binomial_range_successes</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="212.38,-56.25 180.62,-56.25 180.62,-37 212.38,-37 212.38,-56.25"/>
-<text text-anchor="middle" x="196.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">nCr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.93,-37.46C146.43,-39.32 158.82,-41.16 169.17,-42.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.37,-46.12 178.77,-44.13 169.4,-39.2 168.37,-46.12"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.25,-19.25 169.75,-19.25 169.75,0 223.25,0 223.25,-19.25"/>
-<text text-anchor="middle" x="196.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.93,-18.31C142.33,-17.12 150.68,-15.95 158.39,-14.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.63,-18.36 168.04,-13.5 157.65,-11.43 158.63,-18.36"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index bdf773d72..000000000
--- a/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,24 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,129,55,155"/>
-<area shape="rect" id="Node000002" href="$d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813" title=" " alt="" coords="131,5,260,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="35,128,59,84,78,60,101,40,115,32,118,37,104,44,82,64,64,87,39,130"/>
-<area shape="rect" id="Node000003" href="$d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25" title=" " alt="" coords="106,55,284,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="45,127,71,107,101,89,115,83,117,88,104,94,74,112,48,131"/>
-<area shape="rect" id="Node000006" href="$d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc" title=" " alt="" coords="103,205,288,231"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="51,153,104,184,136,197,134,202,101,189,49,158"/>
-<area shape="rect" id="Node000007" href="$d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861" title=" " alt="" coords="336,155,461,180"/>
-<area shape="poly" id="edge8_Node000001_Node000007" title=" " alt="" coords="55,141,321,160,320,165,55,146"/>
-<area shape="rect" id="Node000009" href="$d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76" title=" " alt="" coords="119,104,272,130"/>
-<area shape="poly" id="edge9_Node000001_Node000009" title=" " alt="" coords="55,136,103,128,103,134,55,141"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="160,255,231,280"/>
-<area shape="poly" id="edge12_Node000001_Node000010" title=" " alt="" coords="39,154,64,198,82,221,104,241,124,252,145,259,144,264,122,257,101,246,78,225,59,201,35,157"/>
-<area shape="rect" id="Node000004" href="$d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a" title=" " alt="" coords="378,55,420,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="285,65,362,65,362,70,285,70"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="363,104,434,130"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="252,78,349,102,348,107,251,84"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="249,202,329,182,330,187,251,207"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="364,205,433,231"/>
-<area shape="poly" id="edge7_Node000006_Node000008" title=" " alt="" coords="288,216,348,216,348,221,288,221"/>
-<area shape="poly" id="edge10_Node000009_Node000004" title=" " alt="" coords="251,101,362,73,363,79,252,106"/>
-<area shape="poly" id="edge11_Node000009_Node000005" title=" " alt="" coords="273,114,348,114,348,120,273,120"/>
-</map>
diff --git a/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index e231a025d..000000000
--- a/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7ed96ad2678933c1a3dbb3502ba42449
\ No newline at end of file
diff --git a/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 90316d211..000000000
--- a/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,236 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="350pt" height="214pt"
- viewBox="0.00 0.00 350.00 214.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 210.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-113.25 0,-113.25 0,-94 37,-94 37,-113.25"/>
-<text text-anchor="middle" x="18.5" y="-99.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191,-206.25 94,-206.25 94,-187 191,-187 191,-206.25"/>
-<text text-anchor="middle" x="142.5" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">binomial_expected</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.82,-113.59C31.37,-129.79 48.52,-161.73 73,-178.62 76.18,-180.82 79.62,-182.75 83.19,-184.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.57,-187.56 92.16,-188.05 84.19,-181.07 81.57,-187.56"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209.38,-169.25 75.62,-169.25 75.62,-150 209.38,-150 209.38,-169.25"/>
-<text text-anchor="middle" x="142.5" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">binomial_range_successes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.05,-113.71C41.39,-122.27 57.31,-134.29 73,-141.62 76.29,-143.16 79.72,-144.58 83.24,-145.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.89,-149.13 92.48,-149.02 84.13,-142.5 81.89,-149.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="212,-56.25 73,-56.25 73,-37 212,-37 212,-56.25"/>
-<text text-anchor="middle" x="142.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">binomial_standard_deviation</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.56,-93.79C44.08,-86.72 59.01,-77.29 73,-70.62 80.75,-66.93 89.23,-63.5 97.5,-60.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.48,-63.83 106.74,-57.2 96.15,-57.23 98.48,-63.83"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="342,-94.25 248,-94.25 248,-75 342,-75 342,-94.25"/>
-<text text-anchor="middle" x="295" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">binomial_variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge8_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.09,-102.41C76.52,-99.68 173.47,-92.97 236.35,-88.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.43,-92.12 246.16,-87.94 235.94,-85.14 236.43,-92.12"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200,-132.25 85,-132.25 85,-113 200,-113 200,-132.25"/>
-<text text-anchor="middle" x="142.5" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">binomial_x_successes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.24,-106.39C47.05,-107.92 59.93,-109.92 73.29,-112"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.64,-115.44 83.06,-113.52 73.72,-108.53 72.64,-115.44"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="169.25,-19.25 115.75,-19.25 115.75,0 169.25,0 169.25,-19.25"/>
-<text text-anchor="middle" x="142.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge12_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge12_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.78,-93.53C31.28,-77.11 48.35,-44.75 73,-27.62 82.22,-21.22 93.57,-17.09 104.37,-14.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="104.74,-17.93 113.82,-12.47 103.32,-11.08 104.74,-17.93"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="310.88,-169.25 279.12,-169.25 279.12,-150 310.88,-150 310.88,-169.25"/>
-<text text-anchor="middle" x="295" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">nCr</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.51,-159.62C230.03,-159.62 251.48,-159.62 267.63,-159.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="267.33,-163.13 277.33,-159.63 267.33,-156.13 267.33,-163.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321.75,-132.25 268.25,-132.25 268.25,-113 321.75,-113 321.75,-132.25"/>
-<text text-anchor="middle" x="295" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.62,-149.51C207.3,-143.94 235.23,-137.07 257.19,-131.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.72,-135.15 266.59,-129.36 256.05,-128.35 257.72,-135.15"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.44,-56.71C201.71,-61.32 223.57,-66.84 243.02,-71.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="242.12,-75.14 252.67,-74.19 243.83,-68.35 242.12,-75.14"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321,-56.25 269,-56.25 269,-37 321,-37 321,-56.25"/>
-<text text-anchor="middle" x="295" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M212.14,-46.62C227.73,-46.62 243.7,-46.62 257.35,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.17,-50.13 267.17,-46.63 257.17,-43.13 257.17,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node4 -->
-<g id="edge10_Node000009_Node000004" class="edge">
-<title>Node9&#45;&gt;Node4</title>
-<g id="a_edge10_Node000009_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.62,-132.74C211.16,-139.26 244.87,-147.55 267.81,-153.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.71,-156.52 277.25,-155.51 268.38,-149.72 266.71,-156.52"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge11_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge11_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M200.4,-122.62C219.33,-122.62 239.92,-122.62 256.96,-122.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="256.6,-126.13 266.6,-122.63 256.6,-119.13 256.6,-126.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 1025ff012..000000000
--- a/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,210 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="350pt" height="214pt"
- viewBox="0.00 0.00 350.00 214.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 210.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-113.25 0,-113.25 0,-94 37,-94 37,-113.25"/>
-<text text-anchor="middle" x="18.5" y="-99.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191,-206.25 94,-206.25 94,-187 191,-187 191,-206.25"/>
-<text text-anchor="middle" x="142.5" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">binomial_expected</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.82,-113.59C31.37,-129.79 48.52,-161.73 73,-178.62 76.18,-180.82 79.62,-182.75 83.19,-184.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.57,-187.56 92.16,-188.05 84.19,-181.07 81.57,-187.56"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209.38,-169.25 75.62,-169.25 75.62,-150 209.38,-150 209.38,-169.25"/>
-<text text-anchor="middle" x="142.5" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">binomial_range_successes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.05,-113.71C41.39,-122.27 57.31,-134.29 73,-141.62 76.29,-143.16 79.72,-144.58 83.24,-145.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.89,-149.13 92.48,-149.02 84.13,-142.5 81.89,-149.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="212,-56.25 73,-56.25 73,-37 212,-37 212,-56.25"/>
-<text text-anchor="middle" x="142.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">binomial_standard_deviation</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.56,-93.79C44.08,-86.72 59.01,-77.29 73,-70.62 80.75,-66.93 89.23,-63.5 97.5,-60.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.48,-63.83 106.74,-57.2 96.15,-57.23 98.48,-63.83"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="342,-94.25 248,-94.25 248,-75 342,-75 342,-94.25"/>
-<text text-anchor="middle" x="295" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">binomial_variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge8_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.09,-102.41C76.52,-99.68 173.47,-92.97 236.35,-88.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.43,-92.12 246.16,-87.94 235.94,-85.14 236.43,-92.12"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200,-132.25 85,-132.25 85,-113 200,-113 200,-132.25"/>
-<text text-anchor="middle" x="142.5" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">binomial_x_successes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.24,-106.39C47.05,-107.92 59.93,-109.92 73.29,-112"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.64,-115.44 83.06,-113.52 73.72,-108.53 72.64,-115.44"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="169.25,-19.25 115.75,-19.25 115.75,0 169.25,0 169.25,-19.25"/>
-<text text-anchor="middle" x="142.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge12_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge12_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.78,-93.53C31.28,-77.11 48.35,-44.75 73,-27.62 82.22,-21.22 93.57,-17.09 104.37,-14.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="104.74,-17.93 113.82,-12.47 103.32,-11.08 104.74,-17.93"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="310.88,-169.25 279.12,-169.25 279.12,-150 310.88,-150 310.88,-169.25"/>
-<text text-anchor="middle" x="295" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">nCr</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.51,-159.62C230.03,-159.62 251.48,-159.62 267.63,-159.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="267.33,-163.13 277.33,-159.63 267.33,-156.13 267.33,-163.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321.75,-132.25 268.25,-132.25 268.25,-113 321.75,-113 321.75,-132.25"/>
-<text text-anchor="middle" x="295" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.62,-149.51C207.3,-143.94 235.23,-137.07 257.19,-131.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.72,-135.15 266.59,-129.36 256.05,-128.35 257.72,-135.15"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.44,-56.71C201.71,-61.32 223.57,-66.84 243.02,-71.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="242.12,-75.14 252.67,-74.19 243.83,-68.35 242.12,-75.14"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321,-56.25 269,-56.25 269,-37 321,-37 321,-56.25"/>
-<text text-anchor="middle" x="295" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M212.14,-46.62C227.73,-46.62 243.7,-46.62 257.35,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.17,-50.13 267.17,-46.63 257.17,-43.13 257.17,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node4 -->
-<g id="edge10_Node000009_Node000004" class="edge">
-<title>Node9&#45;&gt;Node4</title>
-<g id="a_edge10_Node000009_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.62,-132.74C211.16,-139.26 244.87,-147.55 267.81,-153.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.71,-156.52 277.25,-155.51 268.38,-149.72 266.71,-156.52"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge11_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge11_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M200.4,-122.62C219.33,-122.62 239.92,-122.62 256.96,-122.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="256.6,-126.13 266.6,-122.63 256.6,-119.13 256.6,-126.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.map b/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.map
deleted file mode 100644
index 1ff8c7e6f..000000000
--- a/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="binomial_standard_deviation" name="binomial_standard_deviation">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,191,56"/>
-<area shape="rect" id="Node000002" href="$d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861" title=" " alt="" coords="239,5,364,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="191,29,223,25,224,30,191,35"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="267,55,336,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="191,52,251,59,251,64,191,57"/>
-</map>
diff --git a/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.md5 b/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.md5
deleted file mode 100644
index e9e37946b..000000000
--- a/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a41de9c07507b5b36bfe2578d1a27471
\ No newline at end of file
diff --git a/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.svg b/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.svg
deleted file mode 100644
index d857034a8..000000000
--- a/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binomial_standard_deviation Pages: 1 -->
-<svg width="277pt" height="64pt"
- viewBox="0.00 0.00 277.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>binomial_standard_deviation</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="139,-37.25 0,-37.25 0,-18 139,-18 139,-37.25"/>
-<text text-anchor="middle" x="69.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">binomial_standard_deviation</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269,-56.25 175,-56.25 175,-37 269,-37 269,-56.25"/>
-<text text-anchor="middle" x="222" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">binomial_variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.14,-36.29C147.27,-37.32 155.5,-38.36 163.45,-39.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.99,-42.83 173.35,-40.61 163.87,-35.88 162.99,-42.83"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248,-19.25 196,-19.25 196,0 248,0 248,-19.25"/>
-<text text-anchor="middle" x="222" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.14,-19.42C154.73,-17.55 170.7,-15.64 184.35,-14.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.66,-17.5 194.18,-12.83 183.83,-10.55 184.66,-17.5"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph_org.svg b/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph_org.svg
deleted file mode 100644
index 2a15a0a2c..000000000
--- a/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binomial_standard_deviation Pages: 1 -->
-<svg width="277pt" height="64pt"
- viewBox="0.00 0.00 277.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>binomial_standard_deviation</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="139,-37.25 0,-37.25 0,-18 139,-18 139,-37.25"/>
-<text text-anchor="middle" x="69.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">binomial_standard_deviation</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269,-56.25 175,-56.25 175,-37 269,-37 269,-56.25"/>
-<text text-anchor="middle" x="222" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">binomial_variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.14,-36.29C147.27,-37.32 155.5,-38.36 163.45,-39.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.99,-42.83 173.35,-40.61 163.87,-35.88 162.99,-42.83"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248,-19.25 196,-19.25 196,0 248,0 248,-19.25"/>
-<text text-anchor="middle" x="222" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.14,-19.42C154.73,-17.55 170.7,-15.64 184.35,-14.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.66,-17.5 194.18,-12.83 183.83,-10.55 184.66,-17.5"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/db0/binomial__dist_8cpp_source.html b/d6/db0/binomial__dist_8cpp_source.html
new file mode 100644
index 000000000..e4dd9c3df
--- /dev/null
+++ b/d6/db0/binomial__dist_8cpp_source.html
@@ -0,0 +1,212 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: probability/binomial_dist.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/db0/binomial__dist_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">binomial_dist.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/db0/binomial__dist_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"><a class="line" href="../../d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813">   22</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813">binomial_expected</a>(<span class="keywordtype">double</span> n, <span class="keywordtype">double</span> p) { <span class="keywordflow">return</span> n * p; }</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861">   29</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861">binomial_variance</a>(<span class="keywordtype">double</span> n, <span class="keywordtype">double</span> p) { <span class="keywordflow">return</span> n * p * (1 - p); }</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="foldopen" id="foldopen00036" data-start="{" data-end="}">
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc">   36</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc">binomial_standard_deviation</a>(<span class="keywordtype">double</span> n, <span class="keywordtype">double</span> p) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">return</span> std::sqrt(<a class="code hl_function" href="../../d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861">binomial_variance</a>(n, p));</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>}</div>
+</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="foldopen" id="foldopen00047" data-start="{" data-end="}">
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="../../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a">   47</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a">nCr</a>(<span class="keywordtype">double</span> n, <span class="keywordtype">double</span> r) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordtype">double</span> numerator = n;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordtype">double</span> denominator = r;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = n - 1; i &gt;= ((n - r) + 1); i--) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        numerator *= i;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    }</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; r; i++) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        denominator *= i;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    }</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">return</span> numerator / denominator;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>}</div>
+</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="foldopen" id="foldopen00065" data-start="{" data-end="}">
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="../../d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76">   65</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76">binomial_x_successes</a>(<span class="keywordtype">double</span> n, <span class="keywordtype">double</span> p, <span class="keywordtype">double</span> x) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a">nCr</a>(n, x) * std::pow(p, x) * std::pow(1 - p, n - x);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>}</div>
+</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="foldopen" id="foldopen00074" data-start="{" data-end="}">
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="../../d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25">   74</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25">binomial_range_successes</a>(<span class="keywordtype">double</span> n, <span class="keywordtype">double</span> p, <span class="keywordtype">double</span> lower_bound,</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>                                <span class="keywordtype">double</span> upper_bound) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keywordtype">double</span> <a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a> = 0;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = lower_bound; i &lt;= upper_bound; i++) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        <a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a> += <a class="code hl_function" href="../../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a">nCr</a>(n, i) * std::pow(p, i) * std::pow(1 - p, n - i);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a>;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>}</div>
+</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="foldopen" id="foldopen00084" data-start="{" data-end="}">
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"><a class="line" href="../../d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   84</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;expected value : &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813">binomial_expected</a>(100, 0.5)</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;variance : &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861">binomial_variance</a>(100, 0.5) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;standard deviation : &quot;</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>              &lt;&lt; <a class="code hl_function" href="../../d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc">binomial_standard_deviation</a>(100, 0.5) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;exactly 30 successes : &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76">binomial_x_successes</a>(100, 0.5, 30)</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;45 or more successes : &quot;</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>              &lt;&lt; <a class="code hl_function" href="../../d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25">binomial_range_successes</a>(100, 0.5, 45, 100) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span> </div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>}</div>
+</div>
+<div class="ttc" id="abinomial__dist_8cpp_html_a19ae0a6a2bd200fd1eb0e31b2bf4cc76"><div class="ttname"><a href="../../d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76">binomial_x_successes</a></div><div class="ttdeci">double binomial_x_successes(double n, double p, double x)</div><div class="ttdef"><b>Definition</b> <a href="#l00065">binomial_dist.cpp:65</a></div></div>
+<div class="ttc" id="abinomial__dist_8cpp_html_a4416a7bc7fa87201883c54cdc4c82813"><div class="ttname"><a href="../../d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813">binomial_expected</a></div><div class="ttdeci">double binomial_expected(double n, double p)</div><div class="ttdef"><b>Definition</b> <a href="#l00022">binomial_dist.cpp:22</a></div></div>
+<div class="ttc" id="abinomial__dist_8cpp_html_a76ed6ce71415fb400b65f0656cef3d25"><div class="ttname"><a href="../../d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25">binomial_range_successes</a></div><div class="ttdeci">double binomial_range_successes(double n, double p, double lower_bound, double upper_bound)</div><div class="ttdef"><b>Definition</b> <a href="#l00074">binomial_dist.cpp:74</a></div></div>
+<div class="ttc" id="abinomial__dist_8cpp_html_a78d36635232e54b5d71fcbf1eac9a49a"><div class="ttname"><a href="../../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a">nCr</a></div><div class="ttdeci">double nCr(double n, double r)</div><div class="ttdef"><b>Definition</b> <a href="#l00047">binomial_dist.cpp:47</a></div></div>
+<div class="ttc" id="abinomial__dist_8cpp_html_acd4dd4558031e4c5d045c801f73d8861"><div class="ttname"><a href="../../d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861">binomial_variance</a></div><div class="ttdeci">double binomial_variance(double n, double p)</div><div class="ttdef"><b>Definition</b> <a href="#l00029">binomial_dist.cpp:29</a></div></div>
+<div class="ttc" id="abinomial__dist_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00084">binomial_dist.cpp:84</a></div></div>
+<div class="ttc" id="abinomial__dist_8cpp_html_af09e51f513cee647d41192ab0a872cdc"><div class="ttname"><a href="../../d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc">binomial_standard_deviation</a></div><div class="ttdeci">double binomial_standard_deviation(double n, double p)</div><div class="ttdef"><b>Definition</b> <a href="#l00036">binomial_dist.cpp:36</a></div></div>
+<div class="ttc" id="anamespaceprobability_html"><div class="ttname"><a href="../../d4/ded/namespaceprobability.html">probability</a></div><div class="ttdoc">Probability algorithms.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_82e494173a87936756866de2fa774307.html">probability</a></li><li class="navelem"><a class="el" href="../../d6/db0/binomial__dist_8cpp.html">binomial_dist.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/db7/classdata__structures_1_1_skip_list-members.html b/d6/db7/classdata__structures_1_1_skip_list-members.html
index 25fe5929a..50e35cb9c 100644
--- a/d6/db7/classdata__structures_1_1_skip_list-members.html
+++ b/d6/db7/classdata__structures_1_1_skip_list-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d6/db8/inv__sqrt_8cpp.html b/d6/db8/inv__sqrt_8cpp.html
index 7f1eea8ab..79a5a69fc 100644
--- a/d6/db8/inv__sqrt_8cpp.html
+++ b/d6/db8/inv__sqrt_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/inv_sqrt.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/inv_sqrt.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,12 +139,14 @@ Include dependency graph for inv_sqrt.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d53/inv__sqrt_8cpp__incl.svg" width="412" height="111"><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">
+</div>
+<p><a href="../../d6/db8/inv__sqrt_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ad219034bf5fba657f5035ec5a1d50f52" id="r_ad219034bf5fba657f5035ec5a1d50f52"><td class="memTemplParams" colspan="2">template&lt;typename T  = double, char iterations = 2&gt; </td></tr>
 <tr class="memitem:ad219034bf5fba657f5035ec5a1d50f52"><td class="memTemplItemLeft" align="right" valign="top">T&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt</a> (T x)</td></tr>
-<tr class="memdesc:ad219034bf5fba657f5035ec5a1d50f52"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></code>  <br /></td></tr>
+<tr class="memdesc:ad219034bf5fba657f5035ec5a1d50f52"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <code>std::sqrt</code>  <br /></td></tr>
 <tr class="separator:ad219034bf5fba657f5035ec5a1d50f52"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa2703e5cf3fecde8becd9066b9666b97" id="r_aa2703e5cf3fecde8becd9066b9666b97"><td class="memTemplParams" colspan="2">template&lt;typename T  = double&gt; </td></tr>
 <tr class="memitem:aa2703e5cf3fecde8becd9066b9666b97"><td class="memTemplItemLeft" align="right" valign="top">T&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt</a> (T number)</td></tr>
@@ -143,6 +162,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of <a href="https://medium.com/hard-mode/the-legendary-fast-inverse-square-root-e51fee3b49d9" target="_blank">the inverse square root Root</a>. </p>
 <p>Two implementation to calculate inverse inverse root, from Quake III Arena (C++ version) and with a standard library (<code>cmath</code>). This algorithm is used to calculate shadows in Quake III Arena. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/db8/inv__sqrt_8cpp_source.html">inv_sqrt.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ad219034bf5fba657f5035ec5a1d50f52" name="ad219034bf5fba657f5035ec5a1d50f52"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ad219034bf5fba657f5035ec5a1d50f52">&#9670;&#160;</a></span>Fast_InvSqrt()</h2>
@@ -169,7 +190,7 @@ template&lt;typename T  = double, char iterations = 2&gt; </div>
 </table>
 </div><div class="memdoc">
 
-<p>for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></code> </p>
+<p>for <code>std::sqrt</code> </p>
 <p>for assert for IO operations for numeric_limits</p>
 <p>This is the function that calculates the fast inverse square root. The following code is the fast inverse square root implementation from Quake III Arena (Adapted for C++). More information can be found at <a href="https://en.wikipedia.org/wiki/Fast_inverse_square_root" target="_blank">Wikipedia</a> </p><dl class="tparams"><dt>Template Parameters</dt><dd>
   <table class="tparams">
@@ -185,9 +206,11 @@ template&lt;typename T  = double, char iterations = 2&gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the inverse square root </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/db8/inv__sqrt_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../d6/db8/inv__sqrt_8cpp_source.html">inv_sqrt.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   28</span>                           {</div>
-<div class="line"><span class="lineno">   29</span>    <span class="keyword">using </span>Tint = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/conditional.html">std::conditional</a>&lt;<span class="keyword">sizeof</span>(T) == 8, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a>,</div>
-<div class="line"><span class="lineno">   30</span>                                           <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a>&gt;::type;</div>
+<div class="line"><span class="lineno">   29</span>    <span class="keyword">using </span>Tint = <span class="keyword">typename</span> std::conditional&lt;<span class="keyword">sizeof</span>(T) == 8, std::int64_t,</div>
+<div class="line"><span class="lineno">   30</span>                                           std::int32_t&gt;::type;</div>
 <div class="line"><span class="lineno">   31</span>    T y = x;</div>
 <div class="line"><span class="lineno">   32</span>    T x2 = y * 0.5;</div>
 <div class="line"><span class="lineno">   33</span> </div>
@@ -205,8 +228,6 @@ template&lt;typename T  = double, char iterations = 2&gt; </div>
 <div class="line"><span class="lineno">   45</span>    }</div>
 <div class="line"><span class="lineno">   46</span>    <span class="keywordflow">return</span> y;</div>
 <div class="line"><span class="lineno">   47</span>}</div>
-<div class="ttc" id="aconditional_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/conditional.html">std::conditional</a></div></div>
-<div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -227,34 +248,29 @@ template&lt;typename T  = double, char iterations = 2&gt; </div>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/db8/inv__sqrt_8cpp_source.html#l00087">87</a> of file <a class="el" href="../../d6/db8/inv__sqrt_8cpp_source.html">inv_sqrt.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   87</span>           {</div>
 <div class="line"><span class="lineno">   88</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
-<div class="line"><span class="lineno">   89</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The Fast inverse square root of 36 is: &quot;</span></div>
-<div class="line"><span class="lineno">   90</span>              &lt;&lt; <a class="code hl_function" href="#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt&lt;float, 1&gt;</a>(36.0f) &lt;&lt; <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">   91</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The Fast inverse square root of 36 is: &quot;</span></div>
+<div class="line"><span class="lineno">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The Fast inverse square root of 36 is: &quot;</span></div>
+<div class="line"><span class="lineno">   90</span>              &lt;&lt; <a class="code hl_function" href="#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt&lt;float, 1&gt;</a>(36.0f) &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   91</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The Fast inverse square root of 36 is: &quot;</span></div>
 <div class="line"><span class="lineno">   92</span>              &lt;&lt; <a class="code hl_function" href="#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt&lt;double, 2&gt;</a>(36.0f) &lt;&lt; <span class="stringliteral">&quot; (2 iterations)&quot;</span></div>
-<div class="line"><span class="lineno">   93</span>              &lt;&lt; <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">   94</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The Fast inverse square root of 100 is: &quot;</span></div>
+<div class="line"><span class="lineno">   93</span>              &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   94</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The Fast inverse square root of 100 is: &quot;</span></div>
 <div class="line"><span class="lineno">   95</span>              &lt;&lt; <a class="code hl_function" href="#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt</a>(100.0f)</div>
 <div class="line"><span class="lineno">   96</span>              &lt;&lt; <span class="stringliteral">&quot; (With default template type and iterations: double, 2)&quot;</span></div>
-<div class="line"><span class="lineno">   97</span>              &lt;&lt; <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">   98</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The Standard inverse square root of 36 is: &quot;</span></div>
-<div class="line"><span class="lineno">   99</span>              &lt;&lt; <a class="code hl_function" href="#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt&lt;float&gt;</a>(36.0f) &lt;&lt; <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">  100</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The Standard inverse square root of 100 is: &quot;</span></div>
+<div class="line"><span class="lineno">   97</span>              &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   98</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The Standard inverse square root of 36 is: &quot;</span></div>
+<div class="line"><span class="lineno">   99</span>              &lt;&lt; <a class="code hl_function" href="#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt&lt;float&gt;</a>(36.0f) &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  100</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The Standard inverse square root of 100 is: &quot;</span></div>
 <div class="line"><span class="lineno">  101</span>              &lt;&lt; <a class="code hl_function" href="#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt</a>(100.0f)</div>
-<div class="line"><span class="lineno">  102</span>              &lt;&lt; <span class="stringliteral">&quot; (With default template type: double)&quot;</span> &lt;&lt; <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">  102</span>              &lt;&lt; <span class="stringliteral">&quot; (With default template type: double)&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  103</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="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="ainv__sqrt_8cpp_html_aa2703e5cf3fecde8becd9066b9666b97"><div class="ttname"><a href="#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt</a></div><div class="ttdeci">T Standard_InvSqrt(T number)</div><div class="ttdoc">This is the function that calculates the fast inverse square root. The following code is the fast inv...</div><div class="ttdef"><b>Definition</b> inv_sqrt.cpp:59</div></div>
-<div class="ttc" id="ainv__sqrt_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> inv_sqrt.cpp:68</div></div>
-<div class="ttc" id="ainv__sqrt_8cpp_html_ad219034bf5fba657f5035ec5a1d50f52"><div class="ttname"><a href="#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt</a></div><div class="ttdeci">T Fast_InvSqrt(T x)</div><div class="ttdoc">for std::sqrt</div><div class="ttdef"><b>Definition</b> inv_sqrt.cpp:28</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/db8/inv__sqrt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="350" height="187"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ainv__sqrt_8cpp_html_aa2703e5cf3fecde8becd9066b9666b97"><div class="ttname"><a href="#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt</a></div><div class="ttdeci">T Standard_InvSqrt(T number)</div><div class="ttdoc">This is the function that calculates the fast inverse square root. The following code is the fast inv...</div><div class="ttdef"><b>Definition</b> <a href="../../d6/db8/inv__sqrt_8cpp_source.html#l00059">inv_sqrt.cpp:59</a></div></div>
+<div class="ttc" id="ainv__sqrt_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/db8/inv__sqrt_8cpp_source.html#l00068">inv_sqrt.cpp:68</a></div></div>
+<div class="ttc" id="ainv__sqrt_8cpp_html_ad219034bf5fba657f5035ec5a1d50f52"><div class="ttname"><a href="#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt</a></div><div class="ttdeci">T Fast_InvSqrt(T x)</div><div class="ttdoc">for std::sqrt</div><div class="ttdef"><b>Definition</b> <a href="../../d6/db8/inv__sqrt_8cpp_source.html#l00028">inv_sqrt.cpp:28</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa2703e5cf3fecde8becd9066b9666b97" name="aa2703e5cf3fecde8becd9066b9666b97"></a>
@@ -288,11 +304,12 @@ template&lt;typename T  = double&gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the inverse square root </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/db8/inv__sqrt_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d6/db8/inv__sqrt_8cpp_source.html">inv_sqrt.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   59</span>                             {</div>
-<div class="line"><span class="lineno">   60</span>    T squareRoot = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">sqrt</a>(number);</div>
+<div class="line"><span class="lineno">   60</span>    T squareRoot = sqrt(number);</div>
 <div class="line"><span class="lineno">   61</span>    <span class="keywordflow">return</span> 1.0f / squareRoot;</div>
 <div class="line"><span class="lineno">   62</span>}</div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -321,27 +338,23 @@ template&lt;typename T  = double&gt; </div>
 
 <p>Self-test implementations. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/db8/inv__sqrt_8cpp_source.html#l00068">68</a> of file <a class="el" href="../../d6/db8/inv__sqrt_8cpp_source.html">inv_sqrt.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   68</span>                   {</div>
 <div class="line"><span class="lineno">   69</span>    <span class="keyword">const</span> <span class="keywordtype">float</span> epsilon = 1e-3f;</div>
 <div class="line"><span class="lineno">   70</span> </div>
 <div class="line"><span class="lineno">   71</span>    <span class="comment">/* Tests with multiple values */</span></div>
-<div class="line"><span class="lineno">   72</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">std::fabs</a>(<a class="code hl_function" href="#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt&lt;float&gt;</a>(100.0f) - 0.0998449f) &lt; epsilon);</div>
-<div class="line"><span class="lineno">   73</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">std::fabs</a>(<a class="code hl_function" href="#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt&lt;double&gt;</a>(36.0f) - 0.166667f) &lt; epsilon);</div>
-<div class="line"><span class="lineno">   74</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">std::fabs</a>(<a class="code hl_function" href="#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt</a>(12.0f) - 0.288423f) &lt; epsilon);</div>
-<div class="line"><span class="lineno">   75</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">std::fabs</a>(<a class="code hl_function" href="#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt&lt;double&gt;</a>(5.0f) - 0.447141f) &lt; epsilon);</div>
+<div class="line"><span class="lineno">   72</span>    assert(std::fabs(<a class="code hl_function" href="#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt&lt;float&gt;</a>(100.0f) - 0.0998449f) &lt; epsilon);</div>
+<div class="line"><span class="lineno">   73</span>    assert(std::fabs(<a class="code hl_function" href="#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt&lt;double&gt;</a>(36.0f) - 0.166667f) &lt; epsilon);</div>
+<div class="line"><span class="lineno">   74</span>    assert(std::fabs(<a class="code hl_function" href="#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt</a>(12.0f) - 0.288423f) &lt; epsilon);</div>
+<div class="line"><span class="lineno">   75</span>    assert(std::fabs(<a class="code hl_function" href="#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt&lt;double&gt;</a>(5.0f) - 0.447141f) &lt; epsilon);</div>
 <div class="line"><span class="lineno">   76</span> </div>
-<div class="line"><span class="lineno">   77</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">std::fabs</a>(<a class="code hl_function" href="#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt&lt;float, 1&gt;</a>(100.0f) - 0.0998449f) &lt; epsilon);</div>
-<div class="line"><span class="lineno">   78</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">std::fabs</a>(<a class="code hl_function" href="#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt&lt;double, 1&gt;</a>(36.0f) - 0.166667f) &lt; epsilon);</div>
-<div class="line"><span class="lineno">   79</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">std::fabs</a>(<a class="code hl_function" href="#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt</a>(12.0f) - 0.288423) &lt; epsilon);</div>
-<div class="line"><span class="lineno">   80</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">std::fabs</a>(<a class="code hl_function" href="#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt&lt;double&gt;</a>(5.0f) - 0.447141) &lt; epsilon);</div>
+<div class="line"><span class="lineno">   77</span>    assert(std::fabs(<a class="code hl_function" href="#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt&lt;float, 1&gt;</a>(100.0f) - 0.0998449f) &lt; epsilon);</div>
+<div class="line"><span class="lineno">   78</span>    assert(std::fabs(<a class="code hl_function" href="#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt&lt;double, 1&gt;</a>(36.0f) - 0.166667f) &lt; epsilon);</div>
+<div class="line"><span class="lineno">   79</span>    assert(std::fabs(<a class="code hl_function" href="#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt</a>(12.0f) - 0.288423) &lt; epsilon);</div>
+<div class="line"><span class="lineno">   80</span>    assert(std::fabs(<a class="code hl_function" href="#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt&lt;double&gt;</a>(5.0f) - 0.447141) &lt; epsilon);</div>
 <div class="line"><span class="lineno">   81</span>}</div>
-<div class="ttc" id="afabs_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">std::fabs</a></div><div class="ttdeci">T fabs(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/db8/inv__sqrt_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="224" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d6/db8/inv__sqrt_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d6/db8/inv__sqrt_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index c455f4080..000000000
--- a/d6/db8/inv__sqrt_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,55,49,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/fabs.html#" title=" " alt="" coords="122,5,194,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,57,106,35,108,40,50,62"/>
-<area shape="rect" id="Node000003" href="$d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52" title="for std::sqrt" alt="" coords="110,55,206,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="49,65,94,65,94,70,49,70"/>
-<area shape="rect" id="Node000004" href="$d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97" title="This is the function that calculates the fast inverse square root. The following code is the fast inv..." alt="" coords="97,104,219,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="50,73,108,95,106,100,48,78"/>
-</map>
diff --git a/d6/db8/inv__sqrt_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d6/db8/inv__sqrt_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 23ffbadeb..000000000
--- a/d6/db8/inv__sqrt_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-06769312eaeb707d415e3f0b084fcecd
\ No newline at end of file
diff --git a/d6/db8/inv__sqrt_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d6/db8/inv__sqrt_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index e945cbd8c..000000000
--- a/d6/db8/inv__sqrt_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="168pt" height="101pt"
- viewBox="0.00 0.00 168.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-56.25 0,-56.25 0,-37 32.5,-37 32.5,-56.25"/>
-<text text-anchor="middle" x="16.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.5,-93.25 87.25,-93.25 87.25,-74 141.5,-74 141.5,-93.25"/>
-<text text-anchor="middle" x="114.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::fabs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-52.57C44.48,-57.11 61.22,-63.55 76.4,-69.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.09,-72.64 85.68,-72.96 77.6,-66.1 75.09,-72.64"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52" target="_top" xlink:title="for std::sqrt">
-<polygon fill="white" stroke="#666666" points="150.5,-56.25 78.25,-56.25 78.25,-37 150.5,-37 150.5,-56.25"/>
-<text text-anchor="middle" x="114.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">Fast_InvSqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-46.62C42.04,-46.62 54.5,-46.62 66.83,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.51,-50.13 76.51,-46.63 66.51,-43.13 66.51,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97" target="_top" xlink:title="This is the function that calculates the fast inverse square root. The following code is the fast inv...">
-<polygon fill="white" stroke="#666666" points="160.25,-19.25 68.5,-19.25 68.5,0 160.25,0 160.25,-19.25"/>
-<text text-anchor="middle" x="114.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Standard_InvSqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-40.68C44.48,-36.14 61.22,-29.7 76.4,-23.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.6,-27.15 85.68,-20.29 75.09,-20.61 77.6,-27.15"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/db8/inv__sqrt_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d6/db8/inv__sqrt_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index d29df9354..000000000
--- a/d6/db8/inv__sqrt_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="168pt" height="101pt"
- viewBox="0.00 0.00 168.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-56.25 0,-56.25 0,-37 32.5,-37 32.5,-56.25"/>
-<text text-anchor="middle" x="16.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.5,-93.25 87.25,-93.25 87.25,-74 141.5,-74 141.5,-93.25"/>
-<text text-anchor="middle" x="114.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::fabs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-52.57C44.48,-57.11 61.22,-63.55 76.4,-69.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.09,-72.64 85.68,-72.96 77.6,-66.1 75.09,-72.64"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52" target="_top" xlink:title="for std::sqrt">
-<polygon fill="white" stroke="#666666" points="150.5,-56.25 78.25,-56.25 78.25,-37 150.5,-37 150.5,-56.25"/>
-<text text-anchor="middle" x="114.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">Fast_InvSqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-46.62C42.04,-46.62 54.5,-46.62 66.83,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.51,-50.13 76.51,-46.63 66.51,-43.13 66.51,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97" target="_top" xlink:title="This is the function that calculates the fast inverse square root. The following code is the fast inv...">
-<polygon fill="white" stroke="#666666" points="160.25,-19.25 68.5,-19.25 68.5,0 160.25,0 160.25,-19.25"/>
-<text text-anchor="middle" x="114.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Standard_InvSqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-40.68C44.48,-36.14 61.22,-29.7 76.4,-23.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.6,-27.15 85.68,-20.29 75.09,-20.61 77.6,-27.15"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/db8/inv__sqrt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/db8/inv__sqrt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 0e99660c3..000000000
--- a/d6/db8/inv__sqrt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,81,55,107"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,79,104,38,108,43,51,83"/>
-<area shape="rect" id="Node000003" href="$d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52" title="for std::sqrt" alt="" coords="235,57,331,83"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,89,219,73,220,79,55,95"/>
-<area shape="rect" id="Node000004" href="$d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97" title="This is the function that calculates the fast inverse square root. The following code is the fast inv..." alt="" coords="222,156,344,182"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="47,105,72,125,104,142,155,157,207,164,206,169,154,162,102,147,69,130,44,109"/>
-<area shape="rect" id="Node000005" href="$d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="117,107,160,132"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="56,97,102,108,101,114,55,103"/>
-<area shape="poly" id="edge6_Node000005_Node000003" title=" " alt="" coords="160,110,228,86,230,91,162,115"/>
-<area shape="poly" id="edge7_Node000005_Node000004" title=" " alt="" coords="162,124,230,148,228,153,160,129"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/fabs.html#" title=" " alt="" coords="247,107,319,132"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="161,117,231,117,231,122,161,122"/>
-</map>
diff --git a/d6/db8/inv__sqrt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/db8/inv__sqrt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index d56341161..000000000
--- a/d6/db8/inv__sqrt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-737c1b9ea92d0445059fc576a7c498c9
\ No newline at end of file
diff --git a/d6/db8/inv__sqrt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/db8/inv__sqrt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 1ebcd3772..000000000
--- a/d6/db8/inv__sqrt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,155 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="262pt" height="140pt"
- viewBox="0.00 0.00 262.25 140.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 136.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-75.25 0,-75.25 0,-56 37,-56 37,-75.25"/>
-<text text-anchor="middle" x="18.5" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-132.25 73,-132.25 73,-113 126.5,-113 126.5,-132.25"/>
-<text text-anchor="middle" x="99.75" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.3,-75.55C44.94,-83.92 61.83,-96.07 75.54,-105.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.45,-108.74 83.61,-111.74 77.53,-103.05 73.45,-108.74"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52" target="_top" xlink:title="for std::sqrt">
-<polygon fill="white" stroke="#666666" points="244.5,-93.25 172.25,-93.25 172.25,-74 244.5,-74 244.5,-93.25"/>
-<text text-anchor="middle" x="208.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">Fast_InvSqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.17,-67.32C65.19,-70 120.72,-75.32 160.75,-79.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.31,-82.63 170.6,-80.1 160.98,-75.66 160.31,-82.63"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97" target="_top" xlink:title="This is the function that calculates the fast inverse square root. The following code is the fast inv...">
-<polygon fill="white" stroke="#666666" points="254.25,-19.25 162.5,-19.25 162.5,0 254.25,0 254.25,-19.25"/>
-<text text-anchor="middle" x="208.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Standard_InvSqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.04,-55.74C40.22,-46.83 56.46,-34.14 73,-27.62 97.48,-17.98 126.21,-13.32 150.8,-11.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.93,-14.64 160.63,-10.4 150.4,-7.66 150.93,-14.64"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="116,-56.25 83.5,-56.25 83.5,-37 116,-37 116,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-61.31C47.72,-58.86 60.73,-55.74 72.13,-53.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.86,-56.43 81.77,-50.7 71.23,-49.62 72.86,-56.43"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge6_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge6_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.48,-52.08C129.92,-56.75 149.82,-63.65 167.59,-69.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.27,-73.06 176.86,-73.04 168.56,-66.45 166.27,-73.06"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge7_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge7_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.48,-41.17C129.92,-36.5 149.82,-29.6 167.59,-23.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.56,-26.8 176.86,-20.21 166.27,-20.19 168.56,-26.8"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235.5,-56.25 181.25,-56.25 181.25,-37 235.5,-37 235.5,-56.25"/>
-<text text-anchor="middle" x="208.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::fabs</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.48,-46.62C130.36,-46.62 151.14,-46.62 169.34,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.31,-50.13 179.31,-46.63 169.31,-43.13 169.31,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/db8/inv__sqrt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/db8/inv__sqrt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index a5637cecb..000000000
--- a/d6/db8/inv__sqrt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,129 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="262pt" height="140pt"
- viewBox="0.00 0.00 262.25 140.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 136.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-75.25 0,-75.25 0,-56 37,-56 37,-75.25"/>
-<text text-anchor="middle" x="18.5" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-132.25 73,-132.25 73,-113 126.5,-113 126.5,-132.25"/>
-<text text-anchor="middle" x="99.75" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.3,-75.55C44.94,-83.92 61.83,-96.07 75.54,-105.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.45,-108.74 83.61,-111.74 77.53,-103.05 73.45,-108.74"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52" target="_top" xlink:title="for std::sqrt">
-<polygon fill="white" stroke="#666666" points="244.5,-93.25 172.25,-93.25 172.25,-74 244.5,-74 244.5,-93.25"/>
-<text text-anchor="middle" x="208.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">Fast_InvSqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.17,-67.32C65.19,-70 120.72,-75.32 160.75,-79.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.31,-82.63 170.6,-80.1 160.98,-75.66 160.31,-82.63"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97" target="_top" xlink:title="This is the function that calculates the fast inverse square root. The following code is the fast inv...">
-<polygon fill="white" stroke="#666666" points="254.25,-19.25 162.5,-19.25 162.5,0 254.25,0 254.25,-19.25"/>
-<text text-anchor="middle" x="208.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Standard_InvSqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.04,-55.74C40.22,-46.83 56.46,-34.14 73,-27.62 97.48,-17.98 126.21,-13.32 150.8,-11.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.93,-14.64 160.63,-10.4 150.4,-7.66 150.93,-14.64"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="116,-56.25 83.5,-56.25 83.5,-37 116,-37 116,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-61.31C47.72,-58.86 60.73,-55.74 72.13,-53.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.86,-56.43 81.77,-50.7 71.23,-49.62 72.86,-56.43"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge6_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge6_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.48,-52.08C129.92,-56.75 149.82,-63.65 167.59,-69.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.27,-73.06 176.86,-73.04 168.56,-66.45 166.27,-73.06"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge7_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge7_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.48,-41.17C129.92,-36.5 149.82,-29.6 167.59,-23.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.56,-26.8 176.86,-20.21 166.27,-20.19 168.56,-26.8"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235.5,-56.25 181.25,-56.25 181.25,-37 235.5,-37 235.5,-56.25"/>
-<text text-anchor="middle" x="208.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::fabs</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.48,-46.62C130.36,-46.62 151.14,-46.62 169.34,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.31,-50.13 179.31,-46.63 169.31,-43.13 169.31,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/db8/inv__sqrt_8cpp_source.html b/d6/db8/inv__sqrt_8cpp_source.html
new file mode 100644
index 000000000..d75b714e2
--- /dev/null
+++ b/d6/db8/inv__sqrt_8cpp_source.html
@@ -0,0 +1,215 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/inv_sqrt.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/db8/inv__sqrt_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">inv_sqrt.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/db8/inv__sqrt_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cmath&gt;</span>     </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;limits&gt;</span>    </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T = <span class="keywordtype">double</span>, <span class="keywordtype">char</span> iterations = 2&gt;</div>
+<div class="foldopen" id="foldopen00028" data-start="{" data-end="}">
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"><a class="line" href="../../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52">   28</a></span><span class="keyword">inline</span> T <a class="code hl_function" href="../../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt</a>(T x) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keyword">using </span>Tint = <span class="keyword">typename</span> std::conditional&lt;<span class="keyword">sizeof</span>(T) == 8, std::int64_t,</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>                                           std::int32_t&gt;::type;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    T y = x;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    T x2 = y * 0.5;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    Tint i =</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        *<span class="keyword">reinterpret_cast&lt;</span>Tint *<span class="keyword">&gt;</span>(&amp;y);  <span class="comment">// Store floating-point bits in integer</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    i = (<span class="keyword">sizeof</span>(T) == 8 ? 0x5fe6eb50c7b537a9 : 0x5f3759df) -</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        (i &gt;&gt; 1);  <span class="comment">// Initial guess for Newton&#39;s method</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    y = *<span class="keyword">reinterpret_cast&lt;</span>T *<span class="keyword">&gt;</span>(&amp;i);  <span class="comment">// Convert new bits into float</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    y = y * (1.5 - (x2 * y * y));  <span class="comment">// 1st iteration Newton&#39;s method</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">if</span> (iterations == 2) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        y = y * (1.5 - (x2 * y * y));  <span class="comment">// 2nd iteration, the more exact result</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keywordflow">return</span> y;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>}</div>
+</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T = <span class="keywordtype">double</span>&gt;</div>
+<div class="foldopen" id="foldopen00059" data-start="{" data-end="}">
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97">   59</a></span>T <a class="code hl_function" href="../../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt</a>(T number) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    T squareRoot = sqrt(number);</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">return</span> 1.0f / squareRoot;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>}</div>
+</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="foldopen" id="foldopen00068" data-start="{" data-end="}">
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"><a class="line" href="../../d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   68</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keyword">const</span> <span class="keywordtype">float</span> epsilon = 1e-3f;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="comment">/* Tests with multiple values */</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    assert(std::fabs(<a class="code hl_function" href="../../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt&lt;float&gt;</a>(100.0f) - 0.0998449f) &lt; epsilon);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    assert(std::fabs(<a class="code hl_function" href="../../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt&lt;double&gt;</a>(36.0f) - 0.166667f) &lt; epsilon);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    assert(std::fabs(<a class="code hl_function" href="../../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt</a>(12.0f) - 0.288423f) &lt; epsilon);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    assert(std::fabs(<a class="code hl_function" href="../../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt&lt;double&gt;</a>(5.0f) - 0.447141f) &lt; epsilon);</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    assert(std::fabs(<a class="code hl_function" href="../../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt&lt;float, 1&gt;</a>(100.0f) - 0.0998449f) &lt; epsilon);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    assert(std::fabs(<a class="code hl_function" href="../../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt&lt;double, 1&gt;</a>(36.0f) - 0.166667f) &lt; epsilon);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    assert(std::fabs(<a class="code hl_function" href="../../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt</a>(12.0f) - 0.288423) &lt; epsilon);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    assert(std::fabs(<a class="code hl_function" href="../../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt&lt;double&gt;</a>(5.0f) - 0.447141) &lt; epsilon);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>}</div>
+</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="foldopen" id="foldopen00087" data-start="{" data-end="}">
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"><a class="line" href="../../d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   87</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <a class="code hl_function" href="../../d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The Fast inverse square root of 36 is: &quot;</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>              &lt;&lt; <a class="code hl_function" href="../../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt&lt;float, 1&gt;</a>(36.0f) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The Fast inverse square root of 36 is: &quot;</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>              &lt;&lt; <a class="code hl_function" href="../../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt&lt;double, 2&gt;</a>(36.0f) &lt;&lt; <span class="stringliteral">&quot; (2 iterations)&quot;</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The Fast inverse square root of 100 is: &quot;</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>              &lt;&lt; <a class="code hl_function" href="../../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt</a>(100.0f)</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>              &lt;&lt; <span class="stringliteral">&quot; (With default template type and iterations: double, 2)&quot;</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The Standard inverse square root of 36 is: &quot;</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>              &lt;&lt; <a class="code hl_function" href="../../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt&lt;float&gt;</a>(36.0f) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The Standard inverse square root of 100 is: &quot;</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>              &lt;&lt; <a class="code hl_function" href="../../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt</a>(100.0f)</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>              &lt;&lt; <span class="stringliteral">&quot; (With default template type: double)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>}</div>
+</div>
+<div class="ttc" id="ainv__sqrt_8cpp_html_aa2703e5cf3fecde8becd9066b9666b97"><div class="ttname"><a href="../../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97">Standard_InvSqrt</a></div><div class="ttdeci">T Standard_InvSqrt(T number)</div><div class="ttdoc">This is the function that calculates the fast inverse square root. The following code is the fast inv...</div><div class="ttdef"><b>Definition</b> <a href="#l00059">inv_sqrt.cpp:59</a></div></div>
+<div class="ttc" id="ainv__sqrt_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d6/db8/inv__sqrt_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> <a href="#l00068">inv_sqrt.cpp:68</a></div></div>
+<div class="ttc" id="ainv__sqrt_8cpp_html_ad219034bf5fba657f5035ec5a1d50f52"><div class="ttname"><a href="../../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52">Fast_InvSqrt</a></div><div class="ttdeci">T Fast_InvSqrt(T x)</div><div class="ttdoc">for std::sqrt</div><div class="ttdef"><b>Definition</b> <a href="#l00028">inv_sqrt.cpp:28</a></div></div>
+<div class="ttc" id="ainv__sqrt_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00087">inv_sqrt.cpp:87</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d6/db8/inv__sqrt_8cpp.html">inv_sqrt.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/dba/jump__game_8cpp.html b/d6/dba/jump__game_8cpp.html
index 56701a7d9..524e36542 100644
--- a/d6/dba/jump__game_8cpp.html
+++ b/d6/dba/jump__game_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: greedy_algorithms/jump_game.cpp File Reference</title>
+<title>TheAlgorithms/C++: greedy_algorithms/jump_game.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for jump_game.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d79/jump__game_8cpp__incl.svg" width="252" height="126"><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">
+</div>
+<p><a href="../../d6/dba/jump__game_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></td></tr>
@@ -130,7 +149,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a33e3819aa9ffec0e380383c52603b502" id="r_a33e3819aa9ffec0e380383c52603b502"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;nums)</td></tr>
+<tr class="memitem:a33e3819aa9ffec0e380383c52603b502" id="r_a33e3819aa9ffec0e380383c52603b502"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a> (const std::vector&lt; int &gt; &amp;nums)</td></tr>
 <tr class="memdesc:a33e3819aa9ffec0e380383c52603b502"><td class="mdescLeft">&#160;</td><td class="mdescRight">Checks whether the given element (default is <code>1</code>) can jump to the last index.  <br /></td></tr>
 <tr class="separator:a33e3819aa9ffec0e380383c52603b502"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -146,6 +165,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/rakshaa2000" target="_blank">Rakshaa Viswanathan</a> </dd>
 <dd>
 <a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/dba/jump__game_8cpp_source.html">jump_game.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -164,17 +185,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dba/jump__game_8cpp_source.html#l00071">71</a> of file <a class="el" href="../../d6/dba/jump__game_8cpp_source.html">jump_game.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   71</span>           {</div>
 <div class="line"><span class="lineno">   72</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   73</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   74</span>}</div>
-<div class="ttc" id="ajump__game_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the above algorithm.</div><div class="ttdef"><b>Definition</b> jump_game.cpp:57</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="499" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ajump__game_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the above algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/dba/jump__game_8cpp_source.html#l00057">jump_game.cpp:57</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -202,24 +220,19 @@ Here is the call graph for this function:</div>
 
 <p>Function to test the above algorithm. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   57</span>                   {</div>
-<div class="line"><span class="lineno">   58</span>    assert(<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>({4, 3, 1, 0, 5})));</div>
-<div class="line"><span class="lineno">   59</span>    assert(!<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>({3, 2, 1, 0, 4})));</div>
-<div class="line"><span class="lineno">   60</span>    assert(<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>({5, 9, 4, 7, 15, 3})));</div>
-<div class="line"><span class="lineno">   61</span>    assert(!<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>({1, 0, 5, 8, 12})));</div>
-<div class="line"><span class="lineno">   62</span>    assert(<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>({2, 1, 4, 7})));</div>
-<div class="line"><span class="lineno">   63</span> </div>
-<div class="line"><span class="lineno">   64</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   65</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="anamespacegreedy__algorithms_html_a33e3819aa9ffec0e380383c52603b502"><div class="ttname"><a href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a></div><div class="ttdeci">bool can_jump(const std::vector&lt; int &gt; &amp;nums)</div><div class="ttdoc">Checks whether the given element (default is 1) can jump to the last index.</div><div class="ttdef"><b>Definition</b> jump_game.cpp:42</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="402" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d6/dba/jump__game_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../d6/dba/jump__game_8cpp_source.html">jump_game.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   57</span>                   {</div>
+<div class="line"><span class="lineno">   58</span>    assert(<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(std::vector&lt;int&gt;({4, 3, 1, 0, 5})));</div>
+<div class="line"><span class="lineno">   59</span>    assert(!<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(std::vector&lt;int&gt;({3, 2, 1, 0, 4})));</div>
+<div class="line"><span class="lineno">   60</span>    assert(<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(std::vector&lt;int&gt;({5, 9, 4, 7, 15, 3})));</div>
+<div class="line"><span class="lineno">   61</span>    assert(!<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(std::vector&lt;int&gt;({1, 0, 5, 8, 12})));</div>
+<div class="line"><span class="lineno">   62</span>    assert(<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(std::vector&lt;int&gt;({2, 1, 4, 7})));</div>
+<div class="line"><span class="lineno">   63</span> </div>
+<div class="line"><span class="lineno">   64</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   65</span>}</div>
+<div class="ttc" id="anamespacegreedy__algorithms_html_a33e3819aa9ffec0e380383c52603b502"><div class="ttname"><a href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a></div><div class="ttdeci">bool can_jump(const std::vector&lt; int &gt; &amp;nums)</div><div class="ttdoc">Checks whether the given element (default is 1) can jump to the last index.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/dba/jump__game_8cpp_source.html#l00042">jump_game.cpp:42</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 52f436c83..000000000
--- a/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Function to test the above algorithm." alt="" coords="5,13,49,38"/>
-<area shape="rect" id="Node000002" href="$d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502" title="Checks whether the given element (default is 1) can jump to the last index." alt="" coords="97,5,232,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,23,81,23,81,28,49,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="280,13,395,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="233,23,264,23,264,28,233,28"/>
-</map>
diff --git a/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 8de68fe40..000000000
--- a/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-70ce6bd1bf4944aea6051b9d04b969c5
\ No newline at end of file
diff --git a/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 1480507ff..000000000
--- a/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="301pt" height="39pt"
- viewBox="0.00 0.00 300.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the above algorithm.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-24.88 0,-24.88 0,-5.63 32.5,-5.63 32.5,-24.88"/>
-<text text-anchor="middle" x="16.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502" target="_top" xlink:title="Checks whether the given element (default is 1) can jump to the last index.">
-<polygon fill="white" stroke="#666666" points="170,-30.5 68.5,-30.5 68.5,0 170,0 170,-30.5"/>
-<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="119.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">can_jump</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.59,-15.25C39.34,-15.25 47.76,-15.25 56.66,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.59,-18.75 66.59,-15.25 56.59,-11.75 56.59,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.5,-24.88 206,-24.88 206,-5.63 292.5,-5.63 292.5,-24.88"/>
-<text text-anchor="middle" x="249.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.47,-15.25C178.28,-15.25 186.38,-15.25 194.27,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.11,-18.75 204.11,-15.25 194.11,-11.75 194.11,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index bdee01ddc..000000000
--- a/d6/dba/jump__game_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="301pt" height="39pt"
- viewBox="0.00 0.00 300.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the above algorithm.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-24.88 0,-24.88 0,-5.63 32.5,-5.63 32.5,-24.88"/>
-<text text-anchor="middle" x="16.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502" target="_top" xlink:title="Checks whether the given element (default is 1) can jump to the last index.">
-<polygon fill="white" stroke="#666666" points="170,-30.5 68.5,-30.5 68.5,0 170,0 170,-30.5"/>
-<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="119.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">can_jump</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.59,-15.25C39.34,-15.25 47.76,-15.25 56.66,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.59,-18.75 66.59,-15.25 56.59,-11.75 56.59,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.5,-24.88 206,-24.88 206,-5.63 292.5,-5.63 292.5,-24.88"/>
-<text text-anchor="middle" x="249.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.47,-15.25C178.28,-15.25 186.38,-15.25 194.27,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.11,-18.75 204.11,-15.25 194.11,-11.75 194.11,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 5255277dd..000000000
--- a/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,13,55,38"/>
-<area shape="rect" id="Node000002" href="$d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function to test the above algorithm." alt="" coords="103,13,146,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,23,87,23,87,28,55,28"/>
-<area shape="rect" id="Node000003" href="$d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502" title="Checks whether the given element (default is 1) can jump to the last index." alt="" coords="194,5,329,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,23,178,23,178,28,146,28"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="377,13,493,38"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="330,23,362,23,362,28,330,28"/>
-</map>
diff --git a/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index cc9a7785f..000000000
--- a/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d507de48ae0db31fa3506a26c91e1225
\ No newline at end of file
diff --git a/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 2fd379086..000000000
--- a/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="374pt" height="39pt"
- viewBox="0.00 0.00 373.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-24.88 0,-24.88 0,-5.63 37,-5.63 37,-24.88"/>
-<text text-anchor="middle" x="18.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the above algorithm.">
-<polygon fill="white" stroke="#666666" points="105.5,-24.88 73,-24.88 73,-5.63 105.5,-5.63 105.5,-24.88"/>
-<text text-anchor="middle" x="89.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-15.25C44.58,-15.25 53.31,-15.25 61.45,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-18.75 71.2,-15.25 61.2,-11.75 61.2,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502" target="_top" xlink:title="Checks whether the given element (default is 1) can jump to the last index.">
-<polygon fill="white" stroke="#666666" points="243,-30.5 141.5,-30.5 141.5,0 243,0 243,-30.5"/>
-<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="192.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">can_jump</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.59,-15.25C112.34,-15.25 120.76,-15.25 129.66,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.59,-18.75 139.59,-15.25 129.59,-11.75 129.59,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="365.5,-24.88 279,-24.88 279,-5.63 365.5,-5.63 365.5,-24.88"/>
-<text text-anchor="middle" x="322.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.47,-15.25C251.28,-15.25 259.38,-15.25 267.27,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="267.11,-18.75 277.11,-15.25 267.11,-11.75 267.11,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 67d9863b9..000000000
--- a/d6/dba/jump__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="374pt" height="39pt"
- viewBox="0.00 0.00 373.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-24.88 0,-24.88 0,-5.63 37,-5.63 37,-24.88"/>
-<text text-anchor="middle" x="18.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the above algorithm.">
-<polygon fill="white" stroke="#666666" points="105.5,-24.88 73,-24.88 73,-5.63 105.5,-5.63 105.5,-24.88"/>
-<text text-anchor="middle" x="89.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-15.25C44.58,-15.25 53.31,-15.25 61.45,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-18.75 71.2,-15.25 61.2,-11.75 61.2,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502" target="_top" xlink:title="Checks whether the given element (default is 1) can jump to the last index.">
-<polygon fill="white" stroke="#666666" points="243,-30.5 141.5,-30.5 141.5,0 243,0 243,-30.5"/>
-<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="192.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">can_jump</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.59,-15.25C112.34,-15.25 120.76,-15.25 129.66,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.59,-18.75 139.59,-15.25 129.59,-11.75 129.59,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="365.5,-24.88 279,-24.88 279,-5.63 365.5,-5.63 365.5,-24.88"/>
-<text text-anchor="middle" x="322.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.47,-15.25C251.28,-15.25 259.38,-15.25 267.27,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="267.11,-18.75 277.11,-15.25 267.11,-11.75 267.11,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/dba/jump__game_8cpp_source.html b/d6/dba/jump__game_8cpp_source.html
new file mode 100644
index 000000000..65075b826
--- /dev/null
+++ b/d6/dba/jump__game_8cpp_source.html
@@ -0,0 +1,178 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: greedy_algorithms/jump_game.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/dba/jump__game_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">jump_game.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/dba/jump__game_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a> {</div>
+<div class="foldopen" id="foldopen00042" data-start="{" data-end="}">
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">   42</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">can_jump</a>(<span class="keyword">const</span> std::vector&lt;int&gt; &amp;nums) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordtype">size_t</span> lastPos = nums.size() - 1;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = lastPos; i != <span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(-1); i--) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="keywordflow">if</span> (i + nums[i] &gt;= lastPos) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            lastPos = i;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">return</span> lastPos == 0;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>}</div>
+</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>}  <span class="comment">// namespace greedy_algorithms</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="foldopen" id="foldopen00057" data-start="{" data-end="}">
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="../../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   57</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    assert(<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(std::vector&lt;int&gt;({4, 3, 1, 0, 5})));</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    assert(!<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(std::vector&lt;int&gt;({3, 2, 1, 0, 4})));</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    assert(<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(std::vector&lt;int&gt;({5, 9, 4, 7, 15, 3})));</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    assert(!<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(std::vector&lt;int&gt;({1, 0, 5, 8, 12})));</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    assert(<a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a>(std::vector&lt;int&gt;({2, 1, 4, 7})));</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>}</div>
+</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="foldopen" id="foldopen00071" data-start="{" data-end="}">
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"><a class="line" href="../../d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   71</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <a class="code hl_function" href="../../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>}</div>
+</div>
+<div class="ttc" id="ajump__game_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the above algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00057">jump_game.cpp:57</a></div></div>
+<div class="ttc" id="ajump__game_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00071">jump_game.cpp:71</a></div></div>
+<div class="ttc" id="anamespacegreedy__algorithms_html"><div class="ttname"><a href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></div><div class="ttdoc">for string class</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d1f/binary__addition_8cpp_source.html#l00027">binary_addition.cpp:27</a></div></div>
+<div class="ttc" id="anamespacegreedy__algorithms_html_a33e3819aa9ffec0e380383c52603b502"><div class="ttname"><a href="../../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502">greedy_algorithms::can_jump</a></div><div class="ttdeci">bool can_jump(const std::vector&lt; int &gt; &amp;nums)</div><div class="ttdoc">Checks whether the given element (default is 1) can jump to the last index.</div><div class="ttdef"><b>Definition</b> <a href="#l00042">jump_game.cpp:42</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_0eaa691bd54ab0922ca7f50599de6d22.html">greedy_algorithms</a></li><li class="navelem"><a class="el" href="../../d6/dba/jump__game_8cpp.html">jump_game.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.map b/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.map
index ded283dd9..c412ccaf1 100644
--- a/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.map
+++ b/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.map
@@ -1,5 +1,5 @@
 <map id="range_queries::fenwick_tree" name="range_queries::fenwick_tree">
 <area shape="rect" id="Node000001" title="The class that initializes the Fenwick Tree." alt="" coords="5,94,190,120"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="37,5,158,31"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="37,5,158,31"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="100,47,100,94,95,94,95,47"/>
 </map>
diff --git a/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.md5 b/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.md5
index 8548dd910..6606c5a8e 100644
--- a/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.md5
+++ b/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.md5
@@ -1 +1 @@
-6172a27841c2b1e2b194fc7da073a46c
\ No newline at end of file
+9240516b870ce87dac4c9be867a2ae20
\ No newline at end of file
diff --git a/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.svg b/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.svg
index 09caa7142..8f95d4cfd 100644
--- a/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.svg
+++ b/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="114.62,-85.75 23.62,-85.75 23.62,-66.5 114.62,-66.5 114.62,-85.75"/>
 <text text-anchor="middle" x="69.12" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
diff --git a/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph_org.svg b/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph_org.svg
index c1468372e..e4c5742f9 100644
--- a/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph_org.svg
+++ b/d6/dbe/classrange__queries_1_1fenwick__tree__coll__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="114.62,-85.75 23.62,-85.75 23.62,-66.5 114.62,-66.5 114.62,-85.75"/>
 <text text-anchor="middle" x="69.12" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
diff --git a/d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html b/d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html
index 261a06419..d7fc04c7f 100644
--- a/d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html
+++ b/d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math::ncr_modulo_p::NCRModuloP Class Reference</title>
+<title>TheAlgorithms/C++: math::ncr_modulo_p::NCRModuloP Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,7 +135,7 @@ $(function(){initNavTree('d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.
 <div class="dynheader">
 Collaboration diagram for math::ncr_modulo_p::NCRModuloP:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.svg" width="158" height="230"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.svg" width="158" height="140"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
@@ -132,22 +149,22 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-static-methods" name="pri-static-methods"></a>
 Static Private Member Functions</h2></td></tr>
-<tr class="memitem:ab5744fa589f6a48f9fe7bca13dbe661f" id="r_ab5744fa589f6a48f9fe7bca13dbe661f"><td class="memItemLeft" align="right" valign="top">static <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab5744fa589f6a48f9fe7bca13dbe661f">computeFactorialsMod</a> (const int64_t &amp;max_arg_val, const int64_t &amp;mod)</td></tr>
+<tr class="memitem:ab5744fa589f6a48f9fe7bca13dbe661f" id="r_ab5744fa589f6a48f9fe7bca13dbe661f"><td class="memItemLeft" align="right" valign="top">static std::vector&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab5744fa589f6a48f9fe7bca13dbe661f">computeFactorialsMod</a> (const int64_t &amp;max_arg_val, const int64_t &amp;mod)</td></tr>
 <tr class="memdesc:ab5744fa589f6a48f9fe7bca13dbe661f"><td class="mdescLeft">&#160;</td><td class="mdescRight">stores precomputed factorial(i) % p value  <br /></td></tr>
 <tr class="separator:ab5744fa589f6a48f9fe7bca13dbe661f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a60df0311c9b2aafa8e91c4ee65b7e0e8" id="r_a60df0311c9b2aafa8e91c4ee65b7e0e8"><td class="memItemLeft" align="right" valign="top"><a id="a60df0311c9b2aafa8e91c4ee65b7e0e8" name="a60df0311c9b2aafa8e91c4ee65b7e0e8"></a>
-const int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>p</b> = 0</td></tr>
+<tr class="memitem:a60df0311c9b2aafa8e91c4ee65b7e0e8" id="r_a60df0311c9b2aafa8e91c4ee65b7e0e8"><td class="memItemLeft" align="right" valign="top">const int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a60df0311c9b2aafa8e91c4ee65b7e0e8">p</a> = 0</td></tr>
 <tr class="separator:a60df0311c9b2aafa8e91c4ee65b7e0e8"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a738a5f59bb3560c81cdb7f43bcfe9fec" id="r_a738a5f59bb3560c81cdb7f43bcfe9fec"><td class="memItemLeft" align="right" valign="top"><a id="a738a5f59bb3560c81cdb7f43bcfe9fec" name="a738a5f59bb3560c81cdb7f43bcfe9fec"></a>
-const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>fac</b></td></tr>
-<tr class="memdesc:a738a5f59bb3560c81cdb7f43bcfe9fec"><td class="mdescLeft">&#160;</td><td class="mdescRight">the p from (nCr % p) <br /></td></tr>
+<tr class="memitem:a738a5f59bb3560c81cdb7f43bcfe9fec" id="r_a738a5f59bb3560c81cdb7f43bcfe9fec"><td class="memItemLeft" align="right" valign="top">const std::vector&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a738a5f59bb3560c81cdb7f43bcfe9fec">fac</a></td></tr>
+<tr class="memdesc:a738a5f59bb3560c81cdb7f43bcfe9fec"><td class="mdescLeft">&#160;</td><td class="mdescRight">the p from (nCr % p)  <br /></td></tr>
 <tr class="separator:a738a5f59bb3560c81cdb7f43bcfe9fec"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Class which contains all methods required for calculating nCr mod p. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html#l00079">79</a> of file <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html">ncr_modulo_p.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a94b07e7dc61d8d7a1e9c5a28988e72f9" name="a94b07e7dc61d8d7a1e9c5a28988e72f9"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a94b07e7dc61d8d7a1e9c5a28988e72f9">&#9670;&#160;</a></span>NCRModuloP()</h2>
@@ -177,9 +194,11 @@ const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/co
 </div><div class="memdoc">
 
 <p>constructs an <a class="el" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" title="Class which contains all methods required for calculating nCr mod p.">NCRModuloP</a> object allowing to compute (nCr)p for inputs from 0 to size </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html">ncr_modulo_p.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  108</span>        : p(p), <a class="code hl_variable" href="#a738a5f59bb3560c81cdb7f43bcfe9fec">fac</a>(<a class="code hl_function" href="#ab5744fa589f6a48f9fe7bca13dbe661f">computeFactorialsMod</a>(size, p)) {}</div>
-<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html_a738a5f59bb3560c81cdb7f43bcfe9fec"><div class="ttname"><a href="#a738a5f59bb3560c81cdb7f43bcfe9fec">math::ncr_modulo_p::NCRModuloP::fac</a></div><div class="ttdeci">const std::vector&lt; int64_t &gt; fac</div><div class="ttdoc">the p from (nCr % p)</div><div class="ttdef"><b>Definition</b> ncr_modulo_p.cpp:83</div></div>
-<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html_ab5744fa589f6a48f9fe7bca13dbe661f"><div class="ttname"><a href="#ab5744fa589f6a48f9fe7bca13dbe661f">math::ncr_modulo_p::NCRModuloP::computeFactorialsMod</a></div><div class="ttdeci">static std::vector&lt; int64_t &gt; computeFactorialsMod(const int64_t &amp;max_arg_val, const int64_t &amp;mod)</div><div class="ttdoc">stores precomputed factorial(i) % p value</div><div class="ttdef"><b>Definition</b> ncr_modulo_p.cpp:92</div></div>
+<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html_a738a5f59bb3560c81cdb7f43bcfe9fec"><div class="ttname"><a href="#a738a5f59bb3560c81cdb7f43bcfe9fec">math::ncr_modulo_p::NCRModuloP::fac</a></div><div class="ttdeci">const std::vector&lt; int64_t &gt; fac</div><div class="ttdoc">the p from (nCr % p)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dab/ncr__modulo__p_8cpp_source.html#l00083">ncr_modulo_p.cpp:83</a></div></div>
+<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html_ab5744fa589f6a48f9fe7bca13dbe661f"><div class="ttname"><a href="#ab5744fa589f6a48f9fe7bca13dbe661f">math::ncr_modulo_p::NCRModuloP::computeFactorialsMod</a></div><div class="ttdeci">static std::vector&lt; int64_t &gt; computeFactorialsMod(const int64_t &amp;max_arg_val, const int64_t &amp;mod)</div><div class="ttdoc">stores precomputed factorial(i) % p value</div><div class="ttdef"><b>Definition</b> <a href="../../de/dab/ncr__modulo__p_8cpp_source.html#l00092">ncr_modulo_p.cpp:92</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -194,7 +213,7 @@ const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/co
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname">static <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; math::ncr_modulo_p::NCRModuloP::computeFactorialsMod </td>
+          <td class="memname">static std::vector&lt; int64_t &gt; math::ncr_modulo_p::NCRModuloP::computeFactorialsMod </td>
           <td>(</td>
           <td class="paramtype">const int64_t &amp;</td>          <td class="paramname"><span class="paramname"><em>max_arg_val</em></span>, </td>
         </tr>
@@ -220,15 +239,16 @@ const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/co
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>vector storing factorials of the numbers 0, ..., max_arg_val reduced modulo mod </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html#l00092">92</a> of file <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html">ncr_modulo_p.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   93</span>                                                                         {</div>
-<div class="line"><span class="lineno">   94</span>        <span class="keyword">auto</span> res = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a>(max_arg_val + 1);</div>
+<div class="line"><span class="lineno">   94</span>        <span class="keyword">auto</span> res = std::vector&lt;int64_t&gt;(max_arg_val + 1);</div>
 <div class="line"><span class="lineno">   95</span>        res[0] = 1;</div>
 <div class="line"><span class="lineno">   96</span>        <span class="keywordflow">for</span> (int64_t i = 1; i &lt;= max_arg_val; i++) {</div>
 <div class="line"><span class="lineno">   97</span>            res[i] = (res[i - 1] * i) % mod;</div>
 <div class="line"><span class="lineno">   98</span>        }</div>
 <div class="line"><span class="lineno">   99</span>        <span class="keywordflow">return</span> res;</div>
 <div class="line"><span class="lineno">  100</span>    }</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>
 </div>
@@ -268,6 +288,8 @@ const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/co
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the value nCr % p </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html#l00116">116</a> of file <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html">ncr_modulo_p.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  116</span>                                                          {</div>
 <div class="line"><span class="lineno">  117</span>        <span class="comment">// Base cases</span></div>
 <div class="line"><span class="lineno">  118</span>        <span class="keywordflow">if</span> (r &gt; n) {</div>
@@ -288,10 +310,61 @@ const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/co
 <div class="line"><span class="lineno">  133</span>        <span class="keywordflow">return</span> (<a class="code hl_variable" href="#a738a5f59bb3560c81cdb7f43bcfe9fec">fac</a>[n] * denominator_inv) % p;</div>
 <div class="line"><span class="lineno">  134</span>    }</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a738a5f59bb3560c81cdb7f43bcfe9fec" name="a738a5f59bb3560c81cdb7f43bcfe9fec"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a738a5f59bb3560c81cdb7f43bcfe9fec">&#9670;&#160;</a></span>fac</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">const std::vector&lt;int64_t&gt; math::ncr_modulo_p::NCRModuloP::fac</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>the p from (nCr % p) </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html#l00083">83</a> of file <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html">ncr_modulo_p.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a60df0311c9b2aafa8e91c4ee65b7e0e8" name="a60df0311c9b2aafa8e91c4ee65b7e0e8"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a60df0311c9b2aafa8e91c4ee65b7e0e8">&#9670;&#160;</a></span>p</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">const int64_t math::ncr_modulo_p::NCRModuloP::p = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html#l00081">81</a> of file <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html">ncr_modulo_p.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>math/<a class="el" href="../../de/dab/ncr__modulo__p_8cpp.html">ncr_modulo_p.cpp</a></li>
+<li>math/<a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html">ncr_modulo_p.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d6/dc9/classcatalan__numbers-members.html b/d6/dc9/classcatalan__numbers-members.html
index 3dffc8c70..47abe184f 100644
--- a/d6/dc9/classcatalan__numbers-members.html
+++ b/d6/dc9/classcatalan__numbers-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html b/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html
index ad80e04c8..eff21d454 100644
--- a/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html
+++ b/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: CONTRIBUTION GUIDELINES</title>
+<title>TheAlgorithms/C++: CONTRIBUTION GUIDELINES</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d6/dce/classgraph_1_1topological__sort_1_1_graph-members.html b/d6/dce/classgraph_1_1topological__sort_1_1_graph-members.html
index 7168f7f78..67def8e53 100644
--- a/d6/dce/classgraph_1_1topological__sort_1_1_graph-members.html
+++ b/d6/dce/classgraph_1_1topological__sort_1_1_graph-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d6/dce/rabin__karp_8cpp.html b/d6/dce/rabin__karp_8cpp.html
index a29da8c57..3a428980c 100644
--- a/d6/dce/rabin__karp_8cpp.html
+++ b/d6/dce/rabin__karp_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: strings/rabin_karp.cpp File Reference</title>
+<title>TheAlgorithms/C++: strings/rabin_karp.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for rabin_karp.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d86/rabin__karp_8cpp__incl.svg" width="336" height="111"><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">
+</div>
+<p><a href="../../d6/dce/rabin__karp_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html">string_search</a></td></tr>
@@ -132,27 +151,47 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="define-members" name="define-members"></a>
 Macros</h2></td></tr>
-<tr class="memitem:ac4add2a227a10511e0128d63952030e8" id="r_ac4add2a227a10511e0128d63952030e8"><td class="memItemLeft" align="right" valign="top"><a id="ac4add2a227a10511e0128d63952030e8" name="ac4add2a227a10511e0128d63952030e8"></a>
-#define&#160;</td><td class="memItemRight" valign="bottom"><b>PRIME</b>&#160;&#160;&#160;5</td></tr>
-<tr class="memdesc:ac4add2a227a10511e0128d63952030e8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prime modulus for hash functions. <br /></td></tr>
+<tr class="memitem:ac4add2a227a10511e0128d63952030e8" id="r_ac4add2a227a10511e0128d63952030e8"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac4add2a227a10511e0128d63952030e8">PRIME</a>&#160;&#160;&#160;5</td></tr>
+<tr class="memdesc:ac4add2a227a10511e0128d63952030e8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prime modulus for hash functions.  <br /></td></tr>
 <tr class="separator:ac4add2a227a10511e0128d63952030e8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a8fb0bc932ba8b582c9f4c71338d050f8" id="r_a8fb0bc932ba8b582c9f4c71338d050f8"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8">string_search::create_hash</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;s, int n)</td></tr>
+<tr class="memitem:a8fb0bc932ba8b582c9f4c71338d050f8" id="r_a8fb0bc932ba8b582c9f4c71338d050f8"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8">string_search::create_hash</a> (const std::string &amp;s, int n)</td></tr>
 <tr class="separator:a8fb0bc932ba8b582c9f4c71338d050f8"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aed769d565b705a9b3e0eb1ec74088893" id="r_aed769d565b705a9b3e0eb1ec74088893"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893">string_search::recalculate_hash</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;s, int old_index, int new_index, int64_t old_hash, int patLength)</td></tr>
+<tr class="memitem:aed769d565b705a9b3e0eb1ec74088893" id="r_aed769d565b705a9b3e0eb1ec74088893"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893">string_search::recalculate_hash</a> (const std::string &amp;s, int old_index, int new_index, int64_t old_hash, int patLength)</td></tr>
 <tr class="separator:aed769d565b705a9b3e0eb1ec74088893"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aebe07cea289a13142503d98be7df11fd" id="r_aebe07cea289a13142503d98be7df11fd"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd">string_search::check_if_equal</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str1, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str2, int start1, int end1, int start2, int end2)</td></tr>
+<tr class="memitem:aebe07cea289a13142503d98be7df11fd" id="r_aebe07cea289a13142503d98be7df11fd"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd">string_search::check_if_equal</a> (const std::string &amp;str1, const std::string &amp;str2, int start1, int end1, int start2, int end2)</td></tr>
 <tr class="separator:aebe07cea289a13142503d98be7df11fd"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a21c673d56cbf67b1d2ee4d869185b7d9" id="r_a21c673d56cbf67b1d2ee4d869185b7d9"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html#a21c673d56cbf67b1d2ee4d869185b7d9">string_search::rabin_karp</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;pat)</td></tr>
+<tr class="memitem:a21c673d56cbf67b1d2ee4d869185b7d9" id="r_a21c673d56cbf67b1d2ee4d869185b7d9"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html#a21c673d56cbf67b1d2ee4d869185b7d9">string_search::rabin_karp</a> (const std::string &amp;str, const std::string &amp;pat)</td></tr>
 <tr class="separator:a21c673d56cbf67b1d2ee4d869185b7d9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a840291bc02cba5474a4cb46a9b9566fe" id="r_a840291bc02cba5474a4cb46a9b9566fe"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a840291bc02cba5474a4cb46a9b9566fe">main</a> (void)</td></tr>
 <tr class="separator:a840291bc02cba5474a4cb46a9b9566fe"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>The <a href="https://en.wikipedia.org/wiki/Rabin–Karp_algorithm" target="_blank">Rabin-Karp Algorithm</a> for finding a pattern within a piece of text with complexity O(n + m) </p>
-</div><h2 class="groupheader">Function Documentation</h2>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html">rabin_karp.cpp</a>.</p>
+</div><h2 class="groupheader">Macro Definition Documentation</h2>
+<a id="ac4add2a227a10511e0128d63952030e8" name="ac4add2a227a10511e0128d63952030e8"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ac4add2a227a10511e0128d63952030e8">&#9670;&#160;</a></span>PRIME</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">#define PRIME&#160;&#160;&#160;5</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Prime modulus for hash functions. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html#l00016">16</a> of file <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html">rabin_karp.cpp</a>.</p>
+
+</div>
+</div>
+<h2 class="groupheader">Function Documentation</h2>
 <a id="a840291bc02cba5474a4cb46a9b9566fe" name="a840291bc02cba5474a4cb46a9b9566fe"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a840291bc02cba5474a4cb46a9b9566fe">&#9670;&#160;</a></span>main()</h2>
 
@@ -168,6 +207,8 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html#l00105">105</a> of file <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html">rabin_karp.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  105</span>               {</div>
 <div class="line"><span class="lineno">  106</span>    assert(rabin_karp(<span class="stringliteral">&quot;helloWorld&quot;</span>, <span class="stringliteral">&quot;world&quot;</span>) == -1);</div>
 <div class="line"><span class="lineno">  107</span>    assert(rabin_karp(<span class="stringliteral">&quot;helloWorld&quot;</span>, <span class="stringliteral">&quot;World&quot;</span>) == 5);</div>
diff --git a/d6/dce/rabin__karp_8cpp_source.html b/d6/dce/rabin__karp_8cpp_source.html
new file mode 100644
index 000000000..30ff0d4e3
--- /dev/null
+++ b/d6/dce/rabin__karp_8cpp_source.html
@@ -0,0 +1,226 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: strings/rabin_karp.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/dce/rabin__karp_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">rabin_karp.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/dce/rabin__karp_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#ifdef _MSC_VER</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;string&gt;</span>  <span class="comment">// use this for MS Visucal C++</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"><a class="line" href="../../d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8">   16</a></span><span class="preprocessor">#define PRIME 5  </span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/d03/namespacestring__search.html">string_search</a> {</div>
+<div class="foldopen" id="foldopen00025" data-start="{" data-end="}">
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"><a class="line" href="../../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8">   25</a></span>int64_t <a class="code hl_function" href="../../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8">create_hash</a>(<span class="keyword">const</span> std::string&amp; s, <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    int64_t result = 0;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        result += (int64_t)(s[i] * (int64_t)pow(<a class="code hl_define" href="../../d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8">PRIME</a>, i));</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    }</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>}</div>
+</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="foldopen" id="foldopen00042" data-start="{" data-end="}">
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893">   42</a></span>int64_t <a class="code hl_function" href="../../d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893">recalculate_hash</a>(<span class="keyword">const</span> std::string&amp; s, <span class="keywordtype">int</span> old_index, <span class="keywordtype">int</span> new_index,</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>                         int64_t old_hash, <span class="keywordtype">int</span> patLength) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    int64_t new_hash = old_hash - s[old_index];</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    new_hash /= <a class="code hl_define" href="../../d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8">PRIME</a>;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    new_hash += (int64_t)(s[new_index] * (int64_t)pow(<a class="code hl_define" href="../../d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8">PRIME</a>, patLength - 1));</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">return</span> new_hash;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>}</div>
+</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="foldopen" id="foldopen00060" data-start="{" data-end="}">
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"><a class="line" href="../../d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd">   60</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd">check_if_equal</a>(<span class="keyword">const</span> std::string&amp; str1, <span class="keyword">const</span> std::string&amp; str2,</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>                    <span class="keywordtype">int</span> start1, <span class="keywordtype">int</span> end1, <span class="keywordtype">int</span> start2, <span class="keywordtype">int</span> end2) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordflow">if</span> (end1 - start1 != end2 - start2) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordflow">while</span> (start1 &lt;= end1 &amp;&amp; start2 &lt;= end2) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="keywordflow">if</span> (str1[start1] != str2[start2]) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        start1++;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        start2++;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>}</div>
+</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="foldopen" id="foldopen00083" data-start="{" data-end="}">
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"><a class="line" href="../../d9/d03/namespacestring__search.html#a21c673d56cbf67b1d2ee4d869185b7d9">   83</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d03/namespacestring__search.html#a21c673d56cbf67b1d2ee4d869185b7d9">rabin_karp</a>(<span class="keyword">const</span> std::string&amp; str, <span class="keyword">const</span> std::string&amp; pat) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    int64_t pat_hash = <a class="code hl_function" href="../../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8">create_hash</a>(pat, pat.size());</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    int64_t str_hash = <a class="code hl_function" href="../../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8">create_hash</a>(str, pat.size());</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= str.size() - pat.size(); ++i) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        <span class="keywordflow">if</span> (pat_hash == str_hash &amp;&amp;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>            <a class="code hl_function" href="../../d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd">check_if_equal</a>(str, pat, i, i + pat.size() - 1, 0,</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>                           pat.size() - 1)) {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>            <span class="keywordflow">return</span> i;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        }</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        <span class="keywordflow">if</span> (i &lt; str.size() - pat.size()) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>            str_hash =</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>                <a class="code hl_function" href="../../d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893">recalculate_hash</a>(str, i, i + pat.size(), str_hash, pat.size());</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        }</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="keywordflow">return</span> -1;  <span class="comment">// return -1 if given pattern not found</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>}</div>
+</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>}  <span class="comment">// namespace string_search</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span><span class="keyword">using </span><a class="code hl_function" href="../../d9/d03/namespacestring__search.html#a21c673d56cbf67b1d2ee4d869185b7d9">string_search::rabin_karp</a>;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
+<div class="foldopen" id="foldopen00105" data-start="{" data-end="}">
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"><a class="line" href="../../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">  105</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">main</a>(<span class="keywordtype">void</span>) {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    assert(rabin_karp(<span class="stringliteral">&quot;helloWorld&quot;</span>, <span class="stringliteral">&quot;world&quot;</span>) == -1);</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    assert(rabin_karp(<span class="stringliteral">&quot;helloWorld&quot;</span>, <span class="stringliteral">&quot;World&quot;</span>) == 5);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    assert(rabin_karp(<span class="stringliteral">&quot;this_is_c++&quot;</span>, <span class="stringliteral">&quot;c++&quot;</span>) == 8);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    assert(rabin_karp(<span class="stringliteral">&quot;happy_coding&quot;</span>, <span class="stringliteral">&quot;happy&quot;</span>) == 0);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>}</div>
+</div>
+<div class="ttc" id="anamespacestring__search_html"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html">string_search</a></div><div class="ttdoc">String search algorithms.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d7d/brute__force__string__searching_8cpp_source.html#l00013">brute_force_string_searching.cpp:13</a></div></div>
+<div class="ttc" id="anamespacestring__search_html_a21c673d56cbf67b1d2ee4d869185b7d9"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html#a21c673d56cbf67b1d2ee4d869185b7d9">string_search::rabin_karp</a></div><div class="ttdeci">int rabin_karp(const std::string &amp;str, const std::string &amp;pat)</div><div class="ttdef"><b>Definition</b> <a href="#l00083">rabin_karp.cpp:83</a></div></div>
+<div class="ttc" id="anamespacestring__search_html_a8fb0bc932ba8b582c9f4c71338d050f8"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8">string_search::create_hash</a></div><div class="ttdeci">int64_t create_hash(const std::string &amp;s, int n)</div><div class="ttdef"><b>Definition</b> <a href="#l00025">rabin_karp.cpp:25</a></div></div>
+<div class="ttc" id="anamespacestring__search_html_aebe07cea289a13142503d98be7df11fd"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd">string_search::check_if_equal</a></div><div class="ttdeci">bool check_if_equal(const std::string &amp;str1, const std::string &amp;str2, int start1, int end1, int start2, int end2)</div><div class="ttdef"><b>Definition</b> <a href="#l00060">rabin_karp.cpp:60</a></div></div>
+<div class="ttc" id="anamespacestring__search_html_aed769d565b705a9b3e0eb1ec74088893"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893">string_search::recalculate_hash</a></div><div class="ttdeci">int64_t recalculate_hash(const std::string &amp;s, int old_index, int new_index, int64_t old_hash, int patLength)</div><div class="ttdef"><b>Definition</b> <a href="#l00042">rabin_karp.cpp:42</a></div></div>
+<div class="ttc" id="arabin__karp_8cpp_html_a840291bc02cba5474a4cb46a9b9566fe"><div class="ttname"><a href="../../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">main</a></div><div class="ttdeci">int main(void)</div><div class="ttdef"><b>Definition</b> <a href="#l00105">rabin_karp.cpp:105</a></div></div>
+<div class="ttc" id="arabin__karp_8cpp_html_ac4add2a227a10511e0128d63952030e8"><div class="ttname"><a href="../../d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8">PRIME</a></div><div class="ttdeci">#define PRIME</div><div class="ttdoc">Prime modulus for hash functions.</div><div class="ttdef"><b>Definition</b> <a href="#l00016">rabin_karp.cpp:16</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_73a3cc5065b223eb41b02873c0e19f0e.html">strings</a></li><li class="navelem"><a class="el" href="../../d6/dce/rabin__karp_8cpp.html">rabin_karp.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/dd3/ode__midpoint__euler_8cpp.html b/d6/dd3/ode__midpoint__euler_8cpp.html
index c7967f579..51cccd378 100644
--- a/d6/dd3/ode__midpoint__euler_8cpp.html
+++ b/d6/dd3/ode__midpoint__euler_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/ode_midpoint_euler.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/ode_midpoint_euler.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,22 +139,24 @@ Include dependency graph for ode_midpoint_euler.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/dd5/ode__midpoint__euler_8cpp__incl.svg" width="423" height="126"><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">
+</div>
+<p><a href="../../d6/dd3/ode__midpoint__euler_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:abaeae8f62a018d197f0187a1c80a90fe" id="r_abaeae8f62a018d197f0187a1c80a90fe"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abaeae8f62a018d197f0187a1c80a90fe">problem</a> (const double &amp;x, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *y, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *dy)</td></tr>
+<tr class="memitem:abaeae8f62a018d197f0187a1c80a90fe" id="r_abaeae8f62a018d197f0187a1c80a90fe"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abaeae8f62a018d197f0187a1c80a90fe">problem</a> (const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</td></tr>
 <tr class="memdesc:abaeae8f62a018d197f0187a1c80a90fe"><td class="mdescLeft">&#160;</td><td class="mdescRight">Problem statement for a system with first-order differential equations. Updates the system differential variables.  <br /></td></tr>
 <tr class="separator:abaeae8f62a018d197f0187a1c80a90fe"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af3adf7b092a87868917ee5fb4255192b" id="r_af3adf7b092a87868917ee5fb4255192b"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af3adf7b092a87868917ee5fb4255192b">exact_solution</a> (const double &amp;x, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *y)</td></tr>
+<tr class="memitem:af3adf7b092a87868917ee5fb4255192b" id="r_af3adf7b092a87868917ee5fb4255192b"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af3adf7b092a87868917ee5fb4255192b">exact_solution</a> (const double &amp;x, std::valarray&lt; double &gt; *y)</td></tr>
 <tr class="memdesc:af3adf7b092a87868917ee5fb4255192b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Exact solution of the problem. Used for solution comparison.  <br /></td></tr>
 <tr class="separator:af3adf7b092a87868917ee5fb4255192b"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ga8c319db420c3d97a83e9dcca803b6812" id="r_ga8c319db420c3d97a83e9dcca803b6812"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812">midpoint_euler_step</a> (const double dx, const double &amp;x, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *y, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *dy)</td></tr>
+<tr class="memitem:ga8c319db420c3d97a83e9dcca803b6812" id="r_ga8c319db420c3d97a83e9dcca803b6812"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812">midpoint_euler_step</a> (const double dx, const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</td></tr>
 <tr class="memdesc:ga8c319db420c3d97a83e9dcca803b6812"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute next step approximation using the midpoint-Euler method.  <br /></td></tr>
 <tr class="separator:ga8c319db420c3d97a83e9dcca803b6812"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ga36ff0710861ca39d957046c0b09b2985" id="r_ga36ff0710861ca39d957046c0b09b2985"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985">midpoint_euler</a> (double dx, double x0, double x_max, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *y, bool save_to_file=false)</td></tr>
+<tr class="memitem:ga36ff0710861ca39d957046c0b09b2985" id="r_ga36ff0710861ca39d957046c0b09b2985"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985">midpoint_euler</a> (double dx, double x0, double x_max, std::valarray&lt; double &gt; *y, bool save_to_file=false)</td></tr>
 <tr class="memdesc:ga36ff0710861ca39d957046c0b09b2985"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute approximation using the midpoint-Euler method in the given limits.  <br /></td></tr>
 <tr class="separator:ga36ff0710861ca39d957046c0b09b2985"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa13517b8e5de1b75592052db7f7e237f" id="r_aa13517b8e5de1b75592052db7f7e237f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a> (const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;Y0)</td></tr>
+<tr class="memitem:aa13517b8e5de1b75592052db7f7e237f" id="r_aa13517b8e5de1b75592052db7f7e237f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a> (const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0)</td></tr>
 <tr class="separator:aa13517b8e5de1b75592052db7f7e237f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a0ddf1224851353fc92bfbff6f499fa97" id="r_a0ddf1224851353fc92bfbff6f499fa97"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0ddf1224851353fc92bfbff6f499fa97">main</a> (int argc, char *argv[])</td></tr>
 <tr class="separator:a0ddf1224851353fc92bfbff6f499fa97"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -164,6 +183,8 @@ Functions</h2></td></tr>
 <div class="line">dy[0] = y[1];</div>
 <div class="line">dy[1] = mu * (1.f - y[0] * y[0]) * y[1] - y[0];</div>
 </div><!-- fragment --> <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../db/dd3/ode__forward__euler_8cpp.html" title="Solve a multivariable first order ordinary differential equation (ODEs) using forward Euler method">ode_forward_euler.cpp</a>, <a class="el" href="../../d3/d06/ode__semi__implicit__euler_8cpp.html" title="Solve a multivariable first order ordinary differential equation (ODEs) using semi implicit Euler met...">ode_semi_implicit_euler.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/dd3/ode__midpoint__euler_8cpp_source.html">ode_midpoint_euler.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="af3adf7b092a87868917ee5fb4255192b" name="af3adf7b092a87868917ee5fb4255192b"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#af3adf7b092a87868917ee5fb4255192b">&#9670;&#160;</a></span>exact_solution()</h2>
@@ -179,7 +200,7 @@ Functions</h2></td></tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>&#160;)</td>
+          <td class="paramtype">std::valarray&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -192,18 +213,13 @@ Functions</h2></td></tr>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">   66</span>                                                             {</div>
-<div class="line"><span class="lineno">   67</span>    y[0][0] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a>(x);</div>
-<div class="line"><span class="lineno">   68</span>    y[0][1] = -<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a>(x);</div>
-<div class="line"><span class="lineno">   69</span>}</div>
-<div class="ttc" id="acos_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a></div><div class="ttdeci">T cos(T... args)</div></div>
-<div class="ttc" id="asin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a></div><div class="ttdeci">T sin(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg" width="232" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d6/dd3/ode__midpoint__euler_8cpp_source.html#l00066">66</a> of file <a class="el" href="../../d6/dd3/ode__midpoint__euler_8cpp_source.html">ode_midpoint_euler.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   66</span>                                                             {</div>
+<div class="line"><span class="lineno">   67</span>    y[0][0] = std::cos(x);</div>
+<div class="line"><span class="lineno">   68</span>    y[0][1] = -std::sin(x);</div>
+<div class="line"><span class="lineno">   69</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
@@ -225,41 +241,34 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Main Function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dd3/ode__midpoint__euler_8cpp_source.html#l00192">192</a> of file <a class="el" href="../../d6/dd3/ode__midpoint__euler_8cpp_source.html">ode_midpoint_euler.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  192</span>                                 {</div>
 <div class="line"><span class="lineno">  193</span>    <span class="keywordtype">double</span> X0 = 0.f;                       <span class="comment">/* initial value of x0 */</span></div>
 <div class="line"><span class="lineno">  194</span>    <span class="keywordtype">double</span> X_MAX = 10.F;                   <span class="comment">/* upper limit of integration */</span></div>
-<div class="line"><span class="lineno">  195</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> Y0 = {1.f, 0.f}; <span class="comment">/* initial value Y = y(x = x_0) */</span></div>
+<div class="line"><span class="lineno">  195</span>    std::valarray&lt;double&gt; Y0 = {1.f, 0.f}; <span class="comment">/* initial value Y = y(x = x_0) */</span></div>
 <div class="line"><span class="lineno">  196</span>    <span class="keywordtype">double</span> step_size;</div>
 <div class="line"><span class="lineno">  197</span> </div>
 <div class="line"><span class="lineno">  198</span>    <span class="keywordflow">if</span> (argc == 1) {</div>
-<div class="line"><span class="lineno">  199</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter the step size: &quot;</span>;</div>
-<div class="line"><span class="lineno">  200</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; step_size;</div>
+<div class="line"><span class="lineno">  199</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the step size: &quot;</span>;</div>
+<div class="line"><span class="lineno">  200</span>        std::cin &gt;&gt; step_size;</div>
 <div class="line"><span class="lineno">  201</span>    } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">  202</span>        <span class="comment">// use commandline argument as independent variable step size</span></div>
-<div class="line"><span class="lineno">  203</span>        step_size = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a>(argv[1]);</div>
+<div class="line"><span class="lineno">  203</span>        step_size = std::atof(argv[1]);</div>
 <div class="line"><span class="lineno">  204</span>    }</div>
 <div class="line"><span class="lineno">  205</span> </div>
 <div class="line"><span class="lineno">  206</span>    <span class="comment">// get approximate solution</span></div>
 <div class="line"><span class="lineno">  207</span>    <span class="keywordtype">double</span> total_time = <a class="code hl_function" href="../../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985">midpoint_euler</a>(step_size, X0, X_MAX, &amp;Y0, <span class="keyword">true</span>);</div>
-<div class="line"><span class="lineno">  208</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tTime = &quot;</span> &lt;&lt; total_time &lt;&lt; <span class="stringliteral">&quot; ms\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  208</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tTime = &quot;</span> &lt;&lt; total_time &lt;&lt; <span class="stringliteral">&quot; ms\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  209</span> </div>
 <div class="line"><span class="lineno">  210</span>    <span class="comment">/* compute exact solution for comparion */</span></div>
 <div class="line"><span class="lineno">  211</span>    <a class="code hl_function" href="#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a>(X0, X_MAX, step_size, Y0);</div>
 <div class="line"><span class="lineno">  212</span> </div>
 <div class="line"><span class="lineno">  213</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  214</span>}</div>
-<div class="ttc" id="aatof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a></div><div class="ttdeci">T atof(T... args)</div></div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="agroup__ode_html_ga36ff0710861ca39d957046c0b09b2985"><div class="ttname"><a href="../../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985">midpoint_euler</a></div><div class="ttdeci">double midpoint_euler(double dx, double x0, double x_max, std::valarray&lt; double &gt; *y, bool save_to_file=false)</div><div class="ttdoc">Compute approximation using the midpoint-Euler method in the given limits.</div><div class="ttdef"><b>Definition</b> ode_midpoint_euler.cpp:107</div></div>
-<div class="ttc" id="aode__midpoint__euler_8cpp_html_aa13517b8e5de1b75592052db7f7e237f"><div class="ttname"><a href="#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a></div><div class="ttdeci">void save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0)</div><div class="ttdef"><b>Definition</b> ode_midpoint_euler.cpp:156</div></div>
-<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="564" height="356"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agroup__ode_html_ga36ff0710861ca39d957046c0b09b2985"><div class="ttname"><a href="../../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985">midpoint_euler</a></div><div class="ttdeci">double midpoint_euler(double dx, double x0, double x_max, std::valarray&lt; double &gt; *y, bool save_to_file=false)</div><div class="ttdoc">Compute approximation using the midpoint-Euler method in the given limits.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/dd3/ode__midpoint__euler_8cpp_source.html#l00107">ode_midpoint_euler.cpp:107</a></div></div>
+<div class="ttc" id="aode__midpoint__euler_8cpp_html_aa13517b8e5de1b75592052db7f7e237f"><div class="ttname"><a href="#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a></div><div class="ttdeci">void save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/dd3/ode__midpoint__euler_8cpp_source.html#l00156">ode_midpoint_euler.cpp:156</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abaeae8f62a018d197f0187a1c80a90fe" name="abaeae8f62a018d197f0187a1c80a90fe"></a>
@@ -276,12 +285,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
+          <td class="paramtype">std::valarray&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>dy</em></span>&#160;)</td>
+          <td class="paramtype">std::valarray&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>dy</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -296,6 +305,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dd3/ode__midpoint__euler_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../d6/dd3/ode__midpoint__euler_8cpp_source.html">ode_midpoint_euler.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   54</span>                                      {</div>
 <div class="line"><span class="lineno">   55</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> omega = 1.F;             <span class="comment">// some const for the problem</span></div>
 <div class="line"><span class="lineno">   56</span>    dy[0][0] = y[0][1];                   <span class="comment">// x dot</span></div>
@@ -328,7 +339,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>Y0</em></span>&#160;)</td>
+          <td class="paramtype">const std::valarray&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>Y0</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -342,18 +353,20 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dd3/ode__midpoint__euler_8cpp_source.html#l00156">156</a> of file <a class="el" href="../../d6/dd3/ode__midpoint__euler_8cpp_source.html">ode_midpoint_euler.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  158</span>                                                        {</div>
 <div class="line"><span class="lineno">  159</span>    <span class="keywordtype">double</span> x = X0;</div>
-<div class="line"><span class="lineno">  160</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> y = Y0;</div>
+<div class="line"><span class="lineno">  160</span>    std::valarray&lt;double&gt; y = Y0;</div>
 <div class="line"><span class="lineno">  161</span> </div>
-<div class="line"><span class="lineno">  162</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a> fp(<span class="stringliteral">&quot;exact.csv&quot;</span>, std::ostream::out);</div>
+<div class="line"><span class="lineno">  162</span>    std::ofstream fp(<span class="stringliteral">&quot;exact.csv&quot;</span>, std::ostream::out);</div>
 <div class="line"><span class="lineno">  163</span>    <span class="keywordflow">if</span> (!fp.is_open()) {</div>
-<div class="line"><span class="lineno">  164</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/perror.html">std::perror</a>(<span class="stringliteral">&quot;Error! &quot;</span>);</div>
+<div class="line"><span class="lineno">  164</span>        std::perror(<span class="stringliteral">&quot;Error! &quot;</span>);</div>
 <div class="line"><span class="lineno">  165</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  166</span>    }</div>
-<div class="line"><span class="lineno">  167</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Finding exact solution\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  167</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Finding exact solution\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  168</span> </div>
-<div class="line"><span class="lineno">  169</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> t1 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  169</span>    std::clock_t t1 = std::clock();</div>
 <div class="line"><span class="lineno">  170</span>    <span class="keywordflow">do</span> {</div>
 <div class="line"><span class="lineno">  171</span>        fp &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
 <div class="line"><span class="lineno">  172</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; y.size() - 1; i++) {</div>
@@ -366,23 +379,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  179</span>        x += step_size;</div>
 <div class="line"><span class="lineno">  180</span>    } <span class="keywordflow">while</span> (x &lt;= X_MAX);</div>
 <div class="line"><span class="lineno">  181</span> </div>
-<div class="line"><span class="lineno">  182</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> t2 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  182</span>    std::clock_t t2 = std::clock();</div>
 <div class="line"><span class="lineno">  183</span>    <span class="keywordtype">double</span> total_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(t2 - t1) / CLOCKS_PER_SEC;</div>
-<div class="line"><span class="lineno">  184</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tTime = &quot;</span> &lt;&lt; total_time &lt;&lt; <span class="stringliteral">&quot; ms\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  184</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tTime = &quot;</span> &lt;&lt; total_time &lt;&lt; <span class="stringliteral">&quot; ms\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  185</span> </div>
 <div class="line"><span class="lineno">  186</span>    fp.close();</div>
 <div class="line"><span class="lineno">  187</span>}</div>
-<div class="ttc" id="abasic_ofstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a></div></div>
-<div class="ttc" id="aclock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a></div><div class="ttdeci">T clock(T... args)</div></div>
-<div class="ttc" id="aclock_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a></div></div>
-<div class="ttc" id="aode__midpoint__euler_8cpp_html_af3adf7b092a87868917ee5fb4255192b"><div class="ttname"><a href="#af3adf7b092a87868917ee5fb4255192b">exact_solution</a></div><div class="ttdeci">void exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y)</div><div class="ttdoc">Exact solution of the problem. Used for solution comparison.</div><div class="ttdef"><b>Definition</b> ode_midpoint_euler.cpp:66</div></div>
-<div class="ttc" id="aperror_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/c/perror.html">std::perror</a></div><div class="ttdeci">T perror(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg" width="467" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aode__midpoint__euler_8cpp_html_af3adf7b092a87868917ee5fb4255192b"><div class="ttname"><a href="#af3adf7b092a87868917ee5fb4255192b">exact_solution</a></div><div class="ttdeci">void exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y)</div><div class="ttdoc">Exact solution of the problem. Used for solution comparison.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/dd3/ode__midpoint__euler_8cpp_source.html#l00066">ode_midpoint_euler.cpp:66</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
deleted file mode 100644
index 4a0f4fbf1..000000000
--- a/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ /dev/null
@@ -1,33 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,128,55,154"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/atof.html#" title=" " alt="" coords="138,79,208,104"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,130,102,113,123,106,124,111,104,118,56,135"/>
-<area shape="rect" id="Node000003" href="$d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985" title="Compute approximation using the midpoint&#45;Euler method in the given limits." alt="" coords="120,177,226,203"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,147,104,164,120,169,118,174,102,169,54,152"/>
-<area shape="rect" id="Node000011" href="$d6/dd3/ode__midpoint__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f" title=" " alt="" coords="103,128,243,154"/>
-<area shape="poly" id="edge10_Node000001_Node000011" title=" " alt="" coords="55,138,87,138,87,144,55,144"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/clock.html#" title=" " alt="" coords="328,227,406,252"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="227,201,313,223,312,228,225,206"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="298,79,435,104"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="221,174,242,164,256,152,265,139,274,126,289,113,297,109,300,113,293,118,278,130,269,142,260,155,244,168,223,179"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="291,128,442,154"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="225,174,298,155,299,161,227,179"/>
-<area shape="rect" id="Node000007" href="$d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812" title="Compute next step approximation using the midpoint&#45;Euler method." alt="" coords="298,325,435,351"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="185,202,228,255,258,286,292,312,300,316,297,321,290,316,255,290,224,259,181,205"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="300,276,434,302"/>
-<area shape="poly" id="edge8_Node000003_Node000009" title=" " alt="" coords="193,201,237,231,292,262,304,268,302,273,290,267,234,236,190,206"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/c/perror.html#" title=" " alt="" coords="326,177,407,203"/>
-<area shape="poly" id="edge9_Node000003_Node000010" title=" " alt="" coords="226,188,311,188,311,193,226,193"/>
-<area shape="rect" id="Node000008" href="$d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti..." alt="" coords="491,325,558,351"/>
-<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="436,336,475,336,475,341,436,341"/>
-<area shape="poly" id="edge11_Node000011_Node000004" title=" " alt="" coords="223,152,244,163,260,176,269,189,278,201,292,213,314,224,311,229,290,218,274,205,265,192,256,179,242,167,221,157"/>
-<area shape="poly" id="edge12_Node000011_Node000005" title=" " alt="" coords="226,125,298,106,299,111,227,130"/>
-<area shape="poly" id="edge16_Node000011_Node000006" title=" " alt="" coords="243,138,275,138,275,144,243,144"/>
-<area shape="poly" id="edge17_Node000011_Node000010" title=" " alt="" coords="227,152,312,174,311,179,226,157"/>
-<area shape="rect" id="Node000012" href="$d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b" title="Exact solution of the problem. Used for solution comparison." alt="" coords="314,29,419,55"/>
-<area shape="poly" id="edge13_Node000011_Node000012" title=" " alt="" coords="221,125,242,115,256,102,265,90,274,77,289,64,298,59,301,64,293,68,278,81,269,93,260,106,244,119,223,130"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/cos.html#" title=" " alt="" coords="490,55,559,80"/>
-<area shape="poly" id="edge14_Node000012_Node000013" title=" " alt="" coords="420,48,475,57,475,62,419,53"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sin.html#" title=" " alt="" coords="492,5,557,31"/>
-<area shape="poly" id="edge15_Node000012_Node000014" title=" " alt="" coords="419,32,477,23,477,28,420,37"/>
-</map>
diff --git a/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
deleted file mode 100644
index f1e66e06a..000000000
--- a/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f8d64a3f65249c1e5500ab07ba6c76ed
\ No newline at end of file
diff --git a/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
deleted file mode 100644
index de40c9c9d..000000000
--- a/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ /dev/null
@@ -1,317 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="423pt" height="267pt"
- viewBox="0.00 0.00 423.00 267.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 263.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-167.25 0,-167.25 0,-148 37,-148 37,-167.25"/>
-<text text-anchor="middle" x="18.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/atof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.62,-204.25 99.62,-204.25 99.62,-185 151.62,-185 151.62,-204.25"/>
-<text text-anchor="middle" x="125.62" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::atof</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-163.98C47.72,-167.69 61.1,-172.44 73,-176.62 78.05,-178.4 83.38,-180.27 88.62,-182.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.12,-185.28 97.72,-185.27 89.43,-178.68 87.12,-185.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985" target="_top" xlink:title="Compute approximation using the midpoint&#45;Euler method in the given limits.">
-<polygon fill="white" stroke="#666666" points="165.12,-130.25 86.12,-130.25 86.12,-111 165.12,-111 165.12,-130.25"/>
-<text text-anchor="middle" x="125.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_euler</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-151.27C47.72,-147.56 61.1,-142.81 73,-138.62 76.9,-137.25 80.97,-135.83 85.03,-134.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.96,-137.79 94.24,-131.19 83.65,-131.18 85.96,-137.79"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d6/dd3/ode__midpoint__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="178.25,-167.25 73,-167.25 73,-148 178.25,-148 178.25,-167.25"/>
-<text text-anchor="middle" x="125.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.33,-157.62C44.25,-157.62 52.63,-157.62 61.41,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.17,-161.13 71.17,-157.63 61.17,-154.13 61.17,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="300.38,-93.25 241.62,-93.25 241.62,-74 300.38,-74 300.38,-93.25"/>
-<text text-anchor="middle" x="271" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M165.42,-110.61C185.48,-105.44 209.93,-99.13 230.14,-93.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.91,-97.33 239.71,-91.44 229.16,-90.55 230.91,-97.33"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="322.5,-204.25 219.5,-204.25 219.5,-185 322.5,-185 322.5,-204.25"/>
-<text text-anchor="middle" x="271" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.66,-130.68C168.09,-132.9 173.47,-135.53 178.25,-138.62 197.79,-151.26 194.57,-164.22 214.25,-176.62 216.09,-177.78 218.01,-178.88 219.99,-179.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.27,-182.97 228.82,-183.89 221.14,-176.58 218.27,-182.97"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="327.75,-167.25 214.25,-167.25 214.25,-148 327.75,-148 327.75,-167.25"/>
-<text text-anchor="middle" x="271" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M165.42,-130.64C182.24,-134.98 202.14,-140.11 220.04,-144.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.15,-148.12 229.7,-147.23 220.9,-141.34 219.15,-148.12"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812" target="_top" xlink:title="Compute next step approximation using the midpoint&#45;Euler method.">
-<polygon fill="white" stroke="#666666" points="322.5,-19.25 219.5,-19.25 219.5,0 322.5,0 322.5,-19.25"/>
-<text text-anchor="middle" x="271" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_euler_step</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.36,-110.66C146.63,-91.74 178.06,-50.5 214.25,-27.62 216.09,-26.46 218.01,-25.37 219.98,-24.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.14,-27.66 228.81,-20.35 218.26,-21.28 221.14,-27.66"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321.38,-56.25 220.62,-56.25 220.62,-37 321.38,-37 321.38,-56.25"/>
-<text text-anchor="middle" x="271" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.95,-110.56C156.61,-98.35 186.32,-77.79 214.25,-64.62 217.18,-63.24 220.25,-61.93 223.37,-60.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.5,-63.99 232.66,-57.24 222.07,-57.43 224.5,-63.99"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/perror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="301.12,-130.25 240.88,-130.25 240.88,-111 301.12,-111 301.12,-130.25"/>
-<text text-anchor="middle" x="271" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::perror</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node10 -->
-<g id="edge9_Node000003_Node000010" class="edge">
-<title>Node3&#45;&gt;Node10</title>
-<g id="a_edge9_Node000003_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M165.42,-120.62C185.25,-120.62 209.36,-120.62 229.44,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.21,-124.13 239.21,-120.63 229.21,-117.13 229.21,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" target="_top" xlink:title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti...">
-<polygon fill="white" stroke="#666666" points="414.62,-19.25 364.12,-19.25 364.12,0 414.62,0 414.62,-19.25"/>
-<text text-anchor="middle" x="389.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">problem</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M322.71,-9.62C332.7,-9.62 342.99,-9.62 352.37,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.17,-13.13 362.17,-9.63 352.17,-6.13 352.17,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node4 -->
-<g id="edge11_Node000011_Node000004" class="edge">
-<title>Node11&#45;&gt;Node4</title>
-<g id="a_edge11_Node000011_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.66,-147.57C168.09,-145.35 173.47,-142.72 178.25,-139.62 197.79,-126.99 194.57,-114.03 214.25,-101.62 219.23,-98.49 224.81,-95.85 230.46,-93.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.54,-96.97 239.85,-90.41 229.26,-90.35 231.54,-96.97"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge12_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge12_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M165.8,-167.74C182.48,-172.04 202.13,-177.11 219.85,-181.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.85,-185.04 229.4,-184.15 220.6,-178.26 218.85,-185.04"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node6 -->
-<g id="edge16_Node000011_Node000006" class="edge">
-<title>Node11&#45;&gt;Node6</title>
-<g id="a_edge16_Node000011_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M178.39,-157.62C186.24,-157.62 194.43,-157.62 202.56,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.44,-161.13 212.44,-157.63 202.44,-154.13 202.44,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node10 -->
-<g id="edge17_Node000011_Node000010" class="edge">
-<title>Node11&#45;&gt;Node10</title>
-<g id="a_edge17_Node000011_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M165.8,-147.51C185.58,-142.41 209.54,-136.23 229.5,-131.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.15,-134.52 238.96,-128.64 228.4,-127.75 230.15,-134.52"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b" target="_top" xlink:title="Exact solution of the problem. Used for solution comparison.">
-<polygon fill="white" stroke="#666666" points="310.5,-241.25 231.5,-241.25 231.5,-222 310.5,-222 310.5,-241.25"/>
-<text text-anchor="middle" x="271" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge13_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge13_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.66,-167.68C168.09,-169.9 173.47,-172.53 178.25,-175.62 197.79,-188.26 194.57,-201.22 214.25,-213.62 216.27,-214.9 218.38,-216.09 220.56,-217.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.14,-220.39 229.7,-221.24 221.97,-213.99 219.14,-220.39"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415,-222.25 363.75,-222.25 363.75,-203 415,-203 415,-222.25"/>
-<text text-anchor="middle" x="389.38" y="-208.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge14_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge14_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M310.75,-225.3C324.15,-223.11 339.1,-220.67 352.28,-218.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.52,-222.03 361.82,-216.96 351.39,-215.12 352.52,-222.03"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="413.5,-259.25 365.25,-259.25 365.25,-240 413.5,-240 413.5,-259.25"/>
-<text text-anchor="middle" x="389.38" y="-245.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node14 -->
-<g id="edge15_Node000012_Node000014" class="edge">
-<title>Node12&#45;&gt;Node14</title>
-<g id="a_edge15_Node000012_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M310.75,-237.62C324.66,-239.77 340.25,-242.18 353.78,-244.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="353.14,-247.72 363.56,-245.79 354.21,-240.8 353.14,-247.72"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
deleted file mode 100644
index f207a4954..000000000
--- a/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
+++ /dev/null
@@ -1,291 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="423pt" height="267pt"
- viewBox="0.00 0.00 423.00 267.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 263.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-167.25 0,-167.25 0,-148 37,-148 37,-167.25"/>
-<text text-anchor="middle" x="18.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/atof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.62,-204.25 99.62,-204.25 99.62,-185 151.62,-185 151.62,-204.25"/>
-<text text-anchor="middle" x="125.62" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::atof</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-163.98C47.72,-167.69 61.1,-172.44 73,-176.62 78.05,-178.4 83.38,-180.27 88.62,-182.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.12,-185.28 97.72,-185.27 89.43,-178.68 87.12,-185.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985" target="_top" xlink:title="Compute approximation using the midpoint&#45;Euler method in the given limits.">
-<polygon fill="white" stroke="#666666" points="165.12,-130.25 86.12,-130.25 86.12,-111 165.12,-111 165.12,-130.25"/>
-<text text-anchor="middle" x="125.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_euler</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-151.27C47.72,-147.56 61.1,-142.81 73,-138.62 76.9,-137.25 80.97,-135.83 85.03,-134.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.96,-137.79 94.24,-131.19 83.65,-131.18 85.96,-137.79"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d6/dd3/ode__midpoint__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="178.25,-167.25 73,-167.25 73,-148 178.25,-148 178.25,-167.25"/>
-<text text-anchor="middle" x="125.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.33,-157.62C44.25,-157.62 52.63,-157.62 61.41,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.17,-161.13 71.17,-157.63 61.17,-154.13 61.17,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="300.38,-93.25 241.62,-93.25 241.62,-74 300.38,-74 300.38,-93.25"/>
-<text text-anchor="middle" x="271" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M165.42,-110.61C185.48,-105.44 209.93,-99.13 230.14,-93.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.91,-97.33 239.71,-91.44 229.16,-90.55 230.91,-97.33"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="322.5,-204.25 219.5,-204.25 219.5,-185 322.5,-185 322.5,-204.25"/>
-<text text-anchor="middle" x="271" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.66,-130.68C168.09,-132.9 173.47,-135.53 178.25,-138.62 197.79,-151.26 194.57,-164.22 214.25,-176.62 216.09,-177.78 218.01,-178.88 219.99,-179.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.27,-182.97 228.82,-183.89 221.14,-176.58 218.27,-182.97"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="327.75,-167.25 214.25,-167.25 214.25,-148 327.75,-148 327.75,-167.25"/>
-<text text-anchor="middle" x="271" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M165.42,-130.64C182.24,-134.98 202.14,-140.11 220.04,-144.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.15,-148.12 229.7,-147.23 220.9,-141.34 219.15,-148.12"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812" target="_top" xlink:title="Compute next step approximation using the midpoint&#45;Euler method.">
-<polygon fill="white" stroke="#666666" points="322.5,-19.25 219.5,-19.25 219.5,0 322.5,0 322.5,-19.25"/>
-<text text-anchor="middle" x="271" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_euler_step</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.36,-110.66C146.63,-91.74 178.06,-50.5 214.25,-27.62 216.09,-26.46 218.01,-25.37 219.98,-24.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.14,-27.66 228.81,-20.35 218.26,-21.28 221.14,-27.66"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321.38,-56.25 220.62,-56.25 220.62,-37 321.38,-37 321.38,-56.25"/>
-<text text-anchor="middle" x="271" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.95,-110.56C156.61,-98.35 186.32,-77.79 214.25,-64.62 217.18,-63.24 220.25,-61.93 223.37,-60.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.5,-63.99 232.66,-57.24 222.07,-57.43 224.5,-63.99"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/perror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="301.12,-130.25 240.88,-130.25 240.88,-111 301.12,-111 301.12,-130.25"/>
-<text text-anchor="middle" x="271" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::perror</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node10 -->
-<g id="edge9_Node000003_Node000010" class="edge">
-<title>Node3&#45;&gt;Node10</title>
-<g id="a_edge9_Node000003_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M165.42,-120.62C185.25,-120.62 209.36,-120.62 229.44,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.21,-124.13 239.21,-120.63 229.21,-117.13 229.21,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" target="_top" xlink:title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti...">
-<polygon fill="white" stroke="#666666" points="414.62,-19.25 364.12,-19.25 364.12,0 414.62,0 414.62,-19.25"/>
-<text text-anchor="middle" x="389.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">problem</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M322.71,-9.62C332.7,-9.62 342.99,-9.62 352.37,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.17,-13.13 362.17,-9.63 352.17,-6.13 352.17,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node4 -->
-<g id="edge11_Node000011_Node000004" class="edge">
-<title>Node11&#45;&gt;Node4</title>
-<g id="a_edge11_Node000011_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.66,-147.57C168.09,-145.35 173.47,-142.72 178.25,-139.62 197.79,-126.99 194.57,-114.03 214.25,-101.62 219.23,-98.49 224.81,-95.85 230.46,-93.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.54,-96.97 239.85,-90.41 229.26,-90.35 231.54,-96.97"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge12_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge12_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M165.8,-167.74C182.48,-172.04 202.13,-177.11 219.85,-181.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.85,-185.04 229.4,-184.15 220.6,-178.26 218.85,-185.04"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node6 -->
-<g id="edge16_Node000011_Node000006" class="edge">
-<title>Node11&#45;&gt;Node6</title>
-<g id="a_edge16_Node000011_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M178.39,-157.62C186.24,-157.62 194.43,-157.62 202.56,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.44,-161.13 212.44,-157.63 202.44,-154.13 202.44,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node10 -->
-<g id="edge17_Node000011_Node000010" class="edge">
-<title>Node11&#45;&gt;Node10</title>
-<g id="a_edge17_Node000011_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M165.8,-147.51C185.58,-142.41 209.54,-136.23 229.5,-131.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.15,-134.52 238.96,-128.64 228.4,-127.75 230.15,-134.52"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b" target="_top" xlink:title="Exact solution of the problem. Used for solution comparison.">
-<polygon fill="white" stroke="#666666" points="310.5,-241.25 231.5,-241.25 231.5,-222 310.5,-222 310.5,-241.25"/>
-<text text-anchor="middle" x="271" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge13_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge13_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.66,-167.68C168.09,-169.9 173.47,-172.53 178.25,-175.62 197.79,-188.26 194.57,-201.22 214.25,-213.62 216.27,-214.9 218.38,-216.09 220.56,-217.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.14,-220.39 229.7,-221.24 221.97,-213.99 219.14,-220.39"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415,-222.25 363.75,-222.25 363.75,-203 415,-203 415,-222.25"/>
-<text text-anchor="middle" x="389.38" y="-208.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge14_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge14_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M310.75,-225.3C324.15,-223.11 339.1,-220.67 352.28,-218.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.52,-222.03 361.82,-216.96 351.39,-215.12 352.52,-222.03"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="413.5,-259.25 365.25,-259.25 365.25,-240 413.5,-240 413.5,-259.25"/>
-<text text-anchor="middle" x="389.38" y="-245.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node14 -->
-<g id="edge15_Node000012_Node000014" class="edge">
-<title>Node12&#45;&gt;Node14</title>
-<g id="a_edge15_Node000012_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M310.75,-237.62C324.66,-239.77 340.25,-242.18 353.78,-244.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="353.14,-247.72 363.56,-245.79 354.21,-240.8 353.14,-247.72"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map b/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map
deleted file mode 100644
index b2f875ae8..000000000
--- a/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="save_exact_solution" name="save_exact_solution">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,104,146,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/clock.html#" title=" " alt="" coords="230,5,308,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="93,101,137,71,193,40,215,31,217,36,195,45,140,76,96,106"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="201,55,338,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="128,101,200,82,202,87,130,106"/>
-<area shape="rect" id="Node000004" href="$d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b" title="Exact solution of the problem. Used for solution comparison." alt="" coords="217,104,322,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="146,114,201,114,201,120,146,120"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="194,153,345,179"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="130,128,202,146,200,151,128,133"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/c/perror.html#" title=" " alt="" coords="229,203,310,228"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="96,128,140,158,195,189,215,198,213,202,193,194,137,163,93,132"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/cos.html#" title=" " alt="" coords="393,80,461,106"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="322,106,377,98,378,103,323,111"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sin.html#" title=" " alt="" coords="395,129,459,155"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="323,123,380,132,379,137,322,128"/>
-</map>
diff --git a/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 b/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5
deleted file mode 100644
index 66433eb22..000000000
--- a/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2e9cdf85203730494d04c3d869209e7d
\ No newline at end of file
diff --git a/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg b/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg
deleted file mode 100644
index 7608f3318..000000000
--- a/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg
+++ /dev/null
@@ -1,173 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: save_exact_solution Pages: 1 -->
-<svg width="350pt" height="175pt"
- viewBox="0.00 0.00 350.00 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>save_exact_solution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="105.25,-93.25 0,-93.25 0,-74 105.25,-74 105.25,-93.25"/>
-<text text-anchor="middle" x="52.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.38,-167.25 168.62,-167.25 168.62,-148 227.38,-148 227.38,-167.25"/>
-<text text-anchor="middle" x="198" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.95,-93.69C83.61,-105.9 113.32,-126.46 141.25,-139.62 146.46,-142.08 152.1,-144.33 157.72,-146.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.35,-149.58 166.95,-149.45 158.58,-142.95 156.35,-149.58"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-130.25 146.5,-130.25 146.5,-111 249.5,-111 249.5,-130.25"/>
-<text text-anchor="middle" x="198" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.8,-93.74C109.48,-98.04 129.13,-103.11 146.85,-107.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.85,-111.04 156.4,-110.15 147.6,-104.26 145.85,-111.04"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b" target="_top" xlink:title="Exact solution of the problem. Used for solution comparison.">
-<polygon fill="white" stroke="#666666" points="237.5,-93.25 158.5,-93.25 158.5,-74 237.5,-74 237.5,-93.25"/>
-<text text-anchor="middle" x="198" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.39,-83.62C118.91,-83.62 133.46,-83.62 146.9,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.85,-87.13 156.85,-83.63 146.85,-80.13 146.85,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-56.25 141.25,-56.25 141.25,-37 254.75,-37 254.75,-56.25"/>
-<text text-anchor="middle" x="198" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.8,-73.51C109.48,-69.21 129.13,-64.14 146.85,-59.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.6,-62.99 156.4,-57.1 145.85,-56.21 147.6,-62.99"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/perror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.12,-19.25 167.88,-19.25 167.88,0 228.12,0 228.12,-19.25"/>
-<text text-anchor="middle" x="198" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::perror</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.95,-73.56C83.61,-61.35 113.32,-40.79 141.25,-27.62 146.17,-25.31 151.46,-23.17 156.76,-21.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.74,-24.61 166.09,-18.08 155.49,-17.98 157.74,-24.61"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="342,-111.25 290.75,-111.25 290.75,-92 342,-92 342,-111.25"/>
-<text text-anchor="middle" x="316.38" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.75,-89.62C251.15,-91.69 266.1,-94 279.28,-96.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.4,-99.45 288.82,-97.52 279.47,-92.53 278.4,-99.45"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="340.5,-74.25 292.25,-74.25 292.25,-55 340.5,-55 340.5,-74.25"/>
-<text text-anchor="middle" x="316.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.75,-77.3C251.66,-75.03 267.25,-72.48 280.78,-70.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.25,-73.74 290.56,-68.68 280.13,-66.83 281.25,-73.74"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph_org.svg b/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph_org.svg
deleted file mode 100644
index 3a8e21692..000000000
--- a/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph_org.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: save_exact_solution Pages: 1 -->
-<svg width="350pt" height="175pt"
- viewBox="0.00 0.00 350.00 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>save_exact_solution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="105.25,-93.25 0,-93.25 0,-74 105.25,-74 105.25,-93.25"/>
-<text text-anchor="middle" x="52.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.38,-167.25 168.62,-167.25 168.62,-148 227.38,-148 227.38,-167.25"/>
-<text text-anchor="middle" x="198" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.95,-93.69C83.61,-105.9 113.32,-126.46 141.25,-139.62 146.46,-142.08 152.1,-144.33 157.72,-146.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.35,-149.58 166.95,-149.45 158.58,-142.95 156.35,-149.58"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-130.25 146.5,-130.25 146.5,-111 249.5,-111 249.5,-130.25"/>
-<text text-anchor="middle" x="198" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.8,-93.74C109.48,-98.04 129.13,-103.11 146.85,-107.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.85,-111.04 156.4,-110.15 147.6,-104.26 145.85,-111.04"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b" target="_top" xlink:title="Exact solution of the problem. Used for solution comparison.">
-<polygon fill="white" stroke="#666666" points="237.5,-93.25 158.5,-93.25 158.5,-74 237.5,-74 237.5,-93.25"/>
-<text text-anchor="middle" x="198" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.39,-83.62C118.91,-83.62 133.46,-83.62 146.9,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.85,-87.13 156.85,-83.63 146.85,-80.13 146.85,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-56.25 141.25,-56.25 141.25,-37 254.75,-37 254.75,-56.25"/>
-<text text-anchor="middle" x="198" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.8,-73.51C109.48,-69.21 129.13,-64.14 146.85,-59.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.6,-62.99 156.4,-57.1 145.85,-56.21 147.6,-62.99"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/perror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.12,-19.25 167.88,-19.25 167.88,0 228.12,0 228.12,-19.25"/>
-<text text-anchor="middle" x="198" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::perror</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.95,-73.56C83.61,-61.35 113.32,-40.79 141.25,-27.62 146.17,-25.31 151.46,-23.17 156.76,-21.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.74,-24.61 166.09,-18.08 155.49,-17.98 157.74,-24.61"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="342,-111.25 290.75,-111.25 290.75,-92 342,-92 342,-111.25"/>
-<text text-anchor="middle" x="316.38" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.75,-89.62C251.15,-91.69 266.1,-94 279.28,-96.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.4,-99.45 288.82,-97.52 279.47,-92.53 278.4,-99.45"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="340.5,-74.25 292.25,-74.25 292.25,-55 340.5,-55 340.5,-74.25"/>
-<text text-anchor="middle" x="316.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.75,-77.3C251.66,-75.03 267.25,-72.48 280.78,-70.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.25,-73.74 290.56,-68.68 280.13,-66.83 281.25,-73.74"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map b/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map
deleted file mode 100644
index 20ef8b76a..000000000
--- a/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="exact_solution" name="exact_solution">
-<area shape="rect" id="Node000001" title="Exact solution of the problem. Used for solution comparison." alt="" coords="5,31,111,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/cos.html#" title=" " alt="" coords="159,5,227,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="111,31,143,25,144,30,112,36"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sin.html#" title=" " alt="" coords="161,55,225,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="112,50,146,56,145,62,111,56"/>
-</map>
diff --git a/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 b/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5
deleted file mode 100644
index bfa5784f3..000000000
--- a/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-775f69ca4eafdff6467315705aafdd17
\ No newline at end of file
diff --git a/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg b/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg
deleted file mode 100644
index 85206d2ac..000000000
--- a/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: exact_solution Pages: 1 -->
-<svg width="174pt" height="64pt"
- viewBox="0.00 0.00 174.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>exact_solution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Exact solution of the problem. Used for solution comparison.">
-<polygon fill="#999999" stroke="#666666" points="79,-37.25 0,-37.25 0,-18 79,-18 79,-37.25"/>
-<text text-anchor="middle" x="39.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="166.25,-56.25 115,-56.25 115,-37 166.25,-37 166.25,-56.25"/>
-<text text-anchor="middle" x="140.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.39,-35.08C87.34,-36.6 95.66,-38.2 103.51,-39.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.58,-43.09 113.06,-41.53 103.9,-36.21 102.58,-43.09"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164.75,-19.25 116.5,-19.25 116.5,0 164.75,0 164.75,-19.25"/>
-<text text-anchor="middle" x="140.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.39,-20.56C87.8,-19.04 96.63,-17.43 104.87,-15.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.3,-19.42 114.51,-14.19 104.05,-12.53 105.3,-19.42"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph_org.svg b/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph_org.svg
deleted file mode 100644
index b49865b04..000000000
--- a/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: exact_solution Pages: 1 -->
-<svg width="174pt" height="64pt"
- viewBox="0.00 0.00 174.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>exact_solution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Exact solution of the problem. Used for solution comparison.">
-<polygon fill="#999999" stroke="#666666" points="79,-37.25 0,-37.25 0,-18 79,-18 79,-37.25"/>
-<text text-anchor="middle" x="39.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="166.25,-56.25 115,-56.25 115,-37 166.25,-37 166.25,-56.25"/>
-<text text-anchor="middle" x="140.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.39,-35.08C87.34,-36.6 95.66,-38.2 103.51,-39.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.58,-43.09 113.06,-41.53 103.9,-36.21 102.58,-43.09"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164.75,-19.25 116.5,-19.25 116.5,0 164.75,0 164.75,-19.25"/>
-<text text-anchor="middle" x="140.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.39,-20.56C87.8,-19.04 96.63,-17.43 104.87,-15.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.3,-19.42 114.51,-14.19 104.05,-12.53 105.3,-19.42"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/dd3/ode__midpoint__euler_8cpp_source.html b/d6/dd3/ode__midpoint__euler_8cpp_source.html
new file mode 100644
index 000000000..fae318a74
--- /dev/null
+++ b/d6/dd3/ode__midpoint__euler_8cpp_source.html
@@ -0,0 +1,281 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/ode_midpoint_euler.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/dd3/ode__midpoint__euler_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">ode_midpoint_euler.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/dd3/ode__midpoint__euler_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="preprocessor">#include &lt;fstream&gt;</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#include &lt;valarray&gt;</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="foldopen" id="foldopen00053" data-start="{" data-end="}">
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">   53</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x, std::valarray&lt;double&gt; *y,</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>             std::valarray&lt;double&gt; *dy) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> omega = 1.F;             <span class="comment">// some const for the problem</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    dy[0][0] = y[0][1];                   <span class="comment">// x dot</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    dy[0][1] = -omega * omega * y[0][0];  <span class="comment">// y dot</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}</div>
+</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="foldopen" id="foldopen00066" data-start="{" data-end="}">
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"><a class="line" href="../../d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b">   66</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b">exact_solution</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x, std::valarray&lt;double&gt; *y) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    y[0][0] = std::cos(x);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    y[0][1] = -std::sin(x);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>}</div>
+</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="foldopen" id="foldopen00085" data-start="{" data-end="}">
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"><a class="line" href="../../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812">   85</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812">midpoint_euler_step</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> dx, <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x,</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>                         std::valarray&lt;double&gt; *y, std::valarray&lt;double&gt; *dy) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <a class="code hl_function" href="../../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a>(x, y, dy);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keywordtype">double</span> tmp_x = x + 0.5 * dx;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    std::valarray&lt;double&gt; tmp_y = y[0] + dy[0] * (0.5 * dx);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <a class="code hl_function" href="../../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a>(tmp_x, &amp;tmp_y, dy);</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    y[0] += dy[0] * dx;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>}</div>
+</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="foldopen" id="foldopen00107" data-start="{" data-end="}">
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"><a class="line" href="../../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985">  107</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985">midpoint_euler</a>(<span class="keywordtype">double</span> dx, <span class="keywordtype">double</span> x0, <span class="keywordtype">double</span> x_max,</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>                      std::valarray&lt;double&gt; *y, <span class="keywordtype">bool</span> save_to_file = <span class="keyword">false</span>) {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    std::valarray&lt;double&gt; dy = y[0];</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span> </div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::ofstream fp;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="keywordflow">if</span> (save_to_file) {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        fp.open(<span class="stringliteral">&quot;midpoint_euler.csv&quot;</span>, std::ofstream::out);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        <span class="keywordflow">if</span> (!fp.is_open()) {</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>            std::perror(<span class="stringliteral">&quot;Error! &quot;</span>);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        }</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    }</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    std::size_t L = y-&gt;size();</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="comment">/* start integration */</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    std::clock_t t1 = std::clock();</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    <span class="keywordtype">double</span> x = x0;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    <span class="keywordflow">do</span> {  <span class="comment">// iterate for each step of independent variable</span></div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        <span class="keywordflow">if</span> (save_to_file &amp;&amp; fp.is_open()) {</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>            <span class="comment">// write to file</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>            fp &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; L - 1; i++) {</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>                fp &lt;&lt; y[0][i] &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>            }</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>            fp &lt;&lt; y[0][L - 1] &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        }</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span> </div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>        <a class="code hl_function" href="../../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812">midpoint_euler_step</a>(dx, x, y, &amp;dy);  <span class="comment">// perform integration</span></div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>        x += dx;                             <span class="comment">// update step</span></div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    } <span class="keywordflow">while</span> (x &lt;= x_max);  <span class="comment">// till upper limit of independent variable</span></div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <span class="comment">/* end of integration */</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    std::clock_t t2 = std::clock();</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span> </div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="keywordflow">if</span> (fp.is_open())</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        fp.close();</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span> </div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(t2 - t1) / CLOCKS_PER_SEC;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>}</div>
+</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span> </div>
+<div class="foldopen" id="foldopen00156" data-start="{" data-end="}">
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"><a class="line" href="../../d6/dd3/ode__midpoint__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f">  156</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/dd3/ode__midpoint__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> &amp;X0, <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;X_MAX,</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>                         <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;step_size,</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>                         <span class="keyword">const</span> std::valarray&lt;double&gt; &amp;Y0) {</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    <span class="keywordtype">double</span> x = X0;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    std::valarray&lt;double&gt; y = Y0;</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span> </div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    std::ofstream fp(<span class="stringliteral">&quot;exact.csv&quot;</span>, std::ostream::out);</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    <span class="keywordflow">if</span> (!fp.is_open()) {</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>        std::perror(<span class="stringliteral">&quot;Error! &quot;</span>);</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    }</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Finding exact solution\n&quot;</span>;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span> </div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    std::clock_t t1 = std::clock();</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>        fp &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; y.size() - 1; i++) {</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>            fp &lt;&lt; y[i] &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        }</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        fp &lt;&lt; y[y.size() - 1] &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        <a class="code hl_function" href="../../d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b">exact_solution</a>(x, &amp;y);</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        x += step_size;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    } <span class="keywordflow">while</span> (x &lt;= X_MAX);</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span> </div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    std::clock_t t2 = std::clock();</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    <span class="keywordtype">double</span> total_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(t2 - t1) / CLOCKS_PER_SEC;</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tTime = &quot;</span> &lt;&lt; total_time &lt;&lt; <span class="stringliteral">&quot; ms\n&quot;</span>;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span> </div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    fp.close();</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>}</div>
+</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span> </div>
+<div class="foldopen" id="foldopen00192" data-start="{" data-end="}">
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"><a class="line" href="../../d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">  192</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[]) {</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    <span class="keywordtype">double</span> X0 = 0.f;                       <span class="comment">/* initial value of x0 */</span></div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    <span class="keywordtype">double</span> X_MAX = 10.F;                   <span class="comment">/* upper limit of integration */</span></div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    std::valarray&lt;double&gt; Y0 = {1.f, 0.f}; <span class="comment">/* initial value Y = y(x = x_0) */</span></div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    <span class="keywordtype">double</span> step_size;</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span> </div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    <span class="keywordflow">if</span> (argc == 1) {</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the step size: &quot;</span>;</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>        std::cin &gt;&gt; step_size;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>        <span class="comment">// use commandline argument as independent variable step size</span></div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>        step_size = std::atof(argv[1]);</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    }</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span> </div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    <span class="comment">// get approximate solution</span></div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    <span class="keywordtype">double</span> total_time = <a class="code hl_function" href="../../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985">midpoint_euler</a>(step_size, X0, X_MAX, &amp;Y0, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tTime = &quot;</span> &lt;&lt; total_time &lt;&lt; <span class="stringliteral">&quot; ms\n&quot;</span>;</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span> </div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    <span class="comment">/* compute exact solution for comparion */</span></div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    <a class="code hl_function" href="../../d6/dd3/ode__midpoint__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a>(X0, X_MAX, step_size, Y0);</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span> </div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>}</div>
+</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="agroup__ode_html_ga36ff0710861ca39d957046c0b09b2985"><div class="ttname"><a href="../../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985">midpoint_euler</a></div><div class="ttdeci">double midpoint_euler(double dx, double x0, double x_max, std::valarray&lt; double &gt; *y, bool save_to_file=false)</div><div class="ttdoc">Compute approximation using the midpoint-Euler method in the given limits.</div><div class="ttdef"><b>Definition</b> <a href="#l00107">ode_midpoint_euler.cpp:107</a></div></div>
+<div class="ttc" id="agroup__ode_html_ga8c319db420c3d97a83e9dcca803b6812"><div class="ttname"><a href="../../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812">midpoint_euler_step</a></div><div class="ttdeci">void midpoint_euler_step(const double dx, const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Compute next step approximation using the midpoint-Euler method.</div><div class="ttdef"><b>Definition</b> <a href="#l00085">ode_midpoint_euler.cpp:85</a></div></div>
+<div class="ttc" id="aode__midpoint__euler_8cpp_html_aa13517b8e5de1b75592052db7f7e237f"><div class="ttname"><a href="../../d6/dd3/ode__midpoint__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a></div><div class="ttdeci">void save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0)</div><div class="ttdef"><b>Definition</b> <a href="#l00156">ode_midpoint_euler.cpp:156</a></div></div>
+<div class="ttc" id="aode__midpoint__euler_8cpp_html_abaeae8f62a018d197f0187a1c80a90fe"><div class="ttname"><a href="../../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a></div><div class="ttdeci">void problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Problem statement for a system with first-order differential equations. Updates the system differenti...</div><div class="ttdef"><b>Definition</b> <a href="#l00053">ode_midpoint_euler.cpp:53</a></div></div>
+<div class="ttc" id="aode__midpoint__euler_8cpp_html_af3adf7b092a87868917ee5fb4255192b"><div class="ttname"><a href="../../d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b">exact_solution</a></div><div class="ttdeci">void exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y)</div><div class="ttdoc">Exact solution of the problem. Used for solution comparison.</div><div class="ttdef"><b>Definition</b> <a href="#l00066">ode_midpoint_euler.cpp:66</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../d6/dd3/ode__midpoint__euler_8cpp.html">ode_midpoint_euler.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/dd6/namespacestring.html b/d6/dd6/namespacestring.html
index e38289033..9c5e183e0 100644
--- a/d6/dd6/namespacestring.html
+++ b/d6/dd6/namespacestring.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: string Namespace Reference</title>
+<title>TheAlgorithms/C++: string Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,7 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>string manipulation algorithms </p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque.html">std::deque</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
+<p>for std::array for assert for std::size_t for std::deque for std::cout and std::endl for std::string for std::vector </p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ac2a35302e6bed93c4b2c6f55a21a5632" name="ac2a35302e6bed93c4b2c6f55a21a5632"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ac2a35302e6bed93c4b2c6f55a21a5632">&#9670;&#160;</a></span>duval()</h2>
@@ -155,6 +172,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the 0-indexed position of the least cyclic shift of the sequence </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d09/duval_8cpp_source.html#l00049">49</a> of file <a class="el" href="../../db/d09/duval_8cpp_source.html">duval.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   49</span>                         {</div>
 <div class="line"><span class="lineno">   50</span>    <span class="keywordtype">size_t</span> n = s.size();</div>
 <div class="line"><span class="lineno">   51</span>    <span class="keywordtype">size_t</span> i = 0, ans = 0;</div>
@@ -176,7 +195,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   67</span>    <span class="keywordflow">return</span> ans;</div>
 <div class="line"><span class="lineno">   68</span>    <span class="comment">// returns 0-indexed position of the least cyclic shift</span></div>
 <div class="line"><span class="lineno">   69</span>}</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/d6/dd8/is__graph__bipartite_8cpp.html b/d6/dd8/is__graph__bipartite_8cpp.html
index f0e4f0bf4..cd06c5ea9 100644
--- a/d6/dd8/is__graph__bipartite_8cpp.html
+++ b/d6/dd8/is__graph__bipartite_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph/is_graph_bipartite.cpp File Reference</title>
+<title>TheAlgorithms/C++: graph/is_graph_bipartite.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for is_graph_bipartite.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d50/is__graph__bipartite_8cpp__incl.svg" width="244" height="111"><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">
+</div>
+<p><a href="../../d6/dd8/is__graph__bipartite_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html">graph::is_graph_bipartite::Graph</a></td></tr>
@@ -163,6 +182,8 @@ Example - Here is a graph G2 with 3 vertices and is not bipartite
      3
 
 </pre><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AkVaya" target="_blank">Akshat Vaya</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html">is_graph_bipartite.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -180,17 +201,14 @@ Example - Here is a graph G2 with 3 vertices and is not bipartite
 </div><div class="memdoc">
 <p>Main function </p>
 <p>Testing</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html#l00168">168</a> of file <a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html">is_graph_bipartite.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  168</span>           {</div>
-<div class="line"><span class="lineno">  169</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">/// Testing</span></div>
+<div class="line"><span class="lineno">  169</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  </div>
 <div class="line"><span class="lineno">  170</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  171</span>}</div>
-<div class="ttc" id="ais__graph__bipartite_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> is_graph_bipartite.cpp:136</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/dd8/is__graph__bipartite_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="566" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ais__graph__bipartite_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/dd8/is__graph__bipartite_8cpp_source.html#l00136">is_graph_bipartite.cpp:136</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -221,42 +239,35 @@ Here is the call graph for this function:</div>
 <p>creating graph G2 with 3 vertices</p>
 <p>adding edges to the graphs as per the illustrated example</p>
 <p>checking whether the graphs are bipartite or not</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html#l00136">136</a> of file <a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html">is_graph_bipartite.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  136</span>                   {</div>
 <div class="line"><span class="lineno">  137</span>    <a class="code hl_class" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html">graph::is_graph_bipartite::Graph</a> G1(</div>
-<div class="line"><span class="lineno">  138</span>        5);  <span class="comment">/// creating graph G1 with 5 vertices</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  139</span><span class="comment">    /// adding edges to the graphs as per the illustrated example</span></div>
-<div class="line"><span class="lineno">  140</span><span class="comment"></span>    G1.addEdge(1, 2);</div>
+<div class="line"><span class="lineno">  138</span>        5);  </div>
+<div class="line"><span class="lineno">  140</span>    G1.addEdge(1, 2);</div>
 <div class="line"><span class="lineno">  141</span>    G1.addEdge(1, 3);</div>
 <div class="line"><span class="lineno">  142</span>    G1.addEdge(3, 4);</div>
 <div class="line"><span class="lineno">  143</span>    G1.addEdge(4, 5);</div>
 <div class="line"><span class="lineno">  144</span> </div>
 <div class="line"><span class="lineno">  145</span>    <a class="code hl_class" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html">graph::is_graph_bipartite::Graph</a> G2(</div>
-<div class="line"><span class="lineno">  146</span>        3);  <span class="comment">/// creating graph G2 with 3 vertices</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  147</span><span class="comment">    /// adding edges to the graphs as per the illustrated example</span></div>
-<div class="line"><span class="lineno">  148</span><span class="comment"></span>    G2.addEdge(1, 2);</div>
+<div class="line"><span class="lineno">  146</span>        3);  </div>
+<div class="line"><span class="lineno">  148</span>    G2.addEdge(1, 2);</div>
 <div class="line"><span class="lineno">  149</span>    G2.addEdge(1, 3);</div>
 <div class="line"><span class="lineno">  150</span>    G2.addEdge(2, 3);</div>
-<div class="line"><span class="lineno">  151</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  152</span><span class="comment">    /// checking whether the graphs are bipartite or not</span></div>
-<div class="line"><span class="lineno">  153</span><span class="comment"></span>    <span class="keywordflow">if</span> (G1.is_bipartite()) {</div>
-<div class="line"><span class="lineno">  154</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The given graph G1 is a bipartite graph\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  151</span> </div>
+<div class="line"><span class="lineno">  153</span>    <span class="keywordflow">if</span> (G1.is_bipartite()) {</div>
+<div class="line"><span class="lineno">  154</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;The given graph G1 is a bipartite graph\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  155</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  156</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The given graph G1 is not a bipartite graph\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  156</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;The given graph G1 is not a bipartite graph\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  157</span>    }</div>
 <div class="line"><span class="lineno">  158</span>    <span class="keywordflow">if</span> (G2.is_bipartite()) {</div>
-<div class="line"><span class="lineno">  159</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The given graph G2 is a bipartite graph\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  159</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;The given graph G2 is a bipartite graph\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  160</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  161</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The given graph G2 is not a bipartite graph\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  161</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;The given graph G2 is not a bipartite graph\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  162</span>    }</div>
 <div class="line"><span class="lineno">  163</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="aclassgraph_1_1is__graph__bipartite_1_1_graph_html"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html">graph::is_graph_bipartite::Graph</a></div><div class="ttdoc">Class for representing graph as an adjacency list.</div><div class="ttdef"><b>Definition</b> is_graph_bipartite.cpp:51</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/dd8/is__graph__bipartite_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="468" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html">graph::is_graph_bipartite::Graph</a></div><div class="ttdoc">Class for representing graph as an adjacency list.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/dd8/is__graph__bipartite_8cpp_source.html#l00051">is_graph_bipartite.cpp:51</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d6/dd8/is__graph__bipartite_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d6/dd8/is__graph__bipartite_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 1d9fd5f18..000000000
--- a/d6/dd8/is__graph__bipartite_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,46,49,72"/>
-<area shape="rect" id="Node000002" href="$de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b" title="Function that add an edge between two nodes or vertices of graph." alt="" coords="97,5,260,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,52,81,45,82,50,50,57"/>
-<area shape="rect" id="Node000004" href="$de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad475f8b838693812f7569a490729f373" title="function to add edges to our graph" alt="" coords="97,71,260,111"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="50,61,82,68,81,73,48,66"/>
-<area shape="rect" id="Node000003" 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="308,13,462,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="260,23,293,23,293,28,260,28"/>
-</map>
diff --git a/d6/dd8/is__graph__bipartite_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d6/dd8/is__graph__bipartite_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index b2f9081e6..000000000
--- a/d6/dd8/is__graph__bipartite_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-14b9adb15c2d657b8e1616f5c859a245
\ No newline at end of file
diff --git a/d6/dd8/is__graph__bipartite_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d6/dd8/is__graph__bipartite_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 4de458d26..000000000
--- a/d6/dd8/is__graph__bipartite_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="351pt" height="88pt"
- viewBox="0.00 0.00 350.75 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-48.88 0,-48.88 0,-29.62 32.5,-29.62 32.5,-48.88"/>
-<text text-anchor="middle" x="16.25" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b" target="_top" xlink:title="Function that add an edge between two nodes or vertices of graph.">
-<polygon fill="white" stroke="#666666" points="191,-79.5 68.5,-79.5 68.5,-49 191,-49 191,-79.5"/>
-<text text-anchor="start" x="76.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">graph::is_graph_bipartite</text>
-<text text-anchor="middle" x="129.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.75,-42.73C39.48,-44.23 47.87,-46.11 56.88,-48.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.1,-51.55 66.62,-50.32 57.63,-44.72 56.1,-51.55"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad475f8b838693812f7569a490729f373" target="_top" xlink:title="function to add edges to our graph">
-<polygon fill="white" stroke="#666666" points="191,-30.5 68.5,-30.5 68.5,0 191,0 191,-30.5"/>
-<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::is_graph_bipartite</text>
-<text text-anchor="middle" x="129.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Graph::is_bipartite</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.75,-35.91C39.48,-34.47 47.87,-32.66 56.88,-30.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.58,-34.15 66.62,-28.62 56.1,-27.31 57.58,-34.15"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="342.75,-73.88 227,-73.88 227,-54.62 342.75,-54.62 342.75,-73.88"/>
-<text text-anchor="middle" x="284.88" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-64.25C199.22,-64.25 207.42,-64.25 215.49,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.28,-67.75 225.28,-64.25 215.28,-60.75 215.28,-67.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/dd8/is__graph__bipartite_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d6/dd8/is__graph__bipartite_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 20b342a44..000000000
--- a/d6/dd8/is__graph__bipartite_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="351pt" height="88pt"
- viewBox="0.00 0.00 350.75 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-48.88 0,-48.88 0,-29.62 32.5,-29.62 32.5,-48.88"/>
-<text text-anchor="middle" x="16.25" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b" target="_top" xlink:title="Function that add an edge between two nodes or vertices of graph.">
-<polygon fill="white" stroke="#666666" points="191,-79.5 68.5,-79.5 68.5,-49 191,-49 191,-79.5"/>
-<text text-anchor="start" x="76.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">graph::is_graph_bipartite</text>
-<text text-anchor="middle" x="129.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.75,-42.73C39.48,-44.23 47.87,-46.11 56.88,-48.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.1,-51.55 66.62,-50.32 57.63,-44.72 56.1,-51.55"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad475f8b838693812f7569a490729f373" target="_top" xlink:title="function to add edges to our graph">
-<polygon fill="white" stroke="#666666" points="191,-30.5 68.5,-30.5 68.5,0 191,0 191,-30.5"/>
-<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::is_graph_bipartite</text>
-<text text-anchor="middle" x="129.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Graph::is_bipartite</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.75,-35.91C39.48,-34.47 47.87,-32.66 56.88,-30.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.58,-34.15 66.62,-28.62 56.1,-27.31 57.58,-34.15"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="342.75,-73.88 227,-73.88 227,-54.62 342.75,-54.62 342.75,-73.88"/>
-<text text-anchor="middle" x="284.88" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-64.25C199.22,-64.25 207.42,-64.25 215.49,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.28,-67.75 225.28,-64.25 215.28,-60.75 215.28,-67.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/dd8/is__graph__bipartite_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/dd8/is__graph__bipartite_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index b3af03d5f..000000000
--- a/d6/dd8/is__graph__bipartite_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,46,55,72"/>
-<area shape="rect" id="Node000002" href="$d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title=" " alt="" coords="103,46,146,72"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,56,87,56,87,62,55,62"/>
-<area shape="rect" id="Node000003" href="$de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b" title="Function that add an edge between two nodes or vertices of graph." alt="" coords="194,5,357,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,52,178,45,179,50,147,57"/>
-<area shape="rect" id="Node000005" href="$de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad475f8b838693812f7569a490729f373" title="function to add edges to our graph" alt="" coords="194,71,357,111"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="147,61,179,68,178,73,146,66"/>
-<area shape="rect" id="Node000004" 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="405,13,560,38"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="358,23,390,23,390,28,358,28"/>
-</map>
diff --git a/d6/dd8/is__graph__bipartite_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/dd8/is__graph__bipartite_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 23a87b6f3..000000000
--- a/d6/dd8/is__graph__bipartite_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cb226527b5b64e9643b8de208c92faa0
\ No newline at end of file
diff --git a/d6/dd8/is__graph__bipartite_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/dd8/is__graph__bipartite_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 630a9a8ec..000000000
--- a/d6/dd8/is__graph__bipartite_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,121 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="424pt" height="88pt"
- viewBox="0.00 0.00 423.75 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-48.88 0,-48.88 0,-29.62 37,-29.62 37,-48.88"/>
-<text text-anchor="middle" x="18.5" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-48.88 73,-48.88 73,-29.62 105.5,-29.62 105.5,-48.88"/>
-<text text-anchor="middle" x="89.25" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-39.25C44.58,-39.25 53.31,-39.25 61.45,-39.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-42.75 71.2,-39.25 61.2,-35.75 61.2,-42.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b" target="_top" xlink:title="Function that add an edge between two nodes or vertices of graph.">
-<polygon fill="white" stroke="#666666" points="264,-79.5 141.5,-79.5 141.5,-49 264,-49 264,-79.5"/>
-<text text-anchor="start" x="149.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">graph::is_graph_bipartite</text>
-<text text-anchor="middle" x="202.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.75,-42.73C112.48,-44.23 120.87,-46.11 129.88,-48.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.1,-51.55 139.62,-50.32 130.63,-44.72 129.1,-51.55"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad475f8b838693812f7569a490729f373" target="_top" xlink:title="function to add edges to our graph">
-<polygon fill="white" stroke="#666666" points="264,-30.5 141.5,-30.5 141.5,0 264,0 264,-30.5"/>
-<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::is_graph_bipartite</text>
-<text text-anchor="middle" x="202.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Graph::is_bipartite</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.75,-35.91C112.48,-34.47 120.87,-32.66 129.88,-30.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.58,-34.15 139.62,-28.62 129.1,-27.31 130.58,-34.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415.75,-73.88 300,-73.88 300,-54.62 415.75,-54.62 415.75,-73.88"/>
-<text text-anchor="middle" x="357.88" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.27,-64.25C272.22,-64.25 280.42,-64.25 288.49,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.28,-67.75 298.28,-64.25 288.28,-60.75 288.28,-67.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d6/dd8/is__graph__bipartite_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d6/dd8/is__graph__bipartite_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index e0ac1b600..000000000
--- a/d6/dd8/is__graph__bipartite_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,95 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="424pt" height="88pt"
- viewBox="0.00 0.00 423.75 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-48.88 0,-48.88 0,-29.62 37,-29.62 37,-48.88"/>
-<text text-anchor="middle" x="18.5" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-48.88 73,-48.88 73,-29.62 105.5,-29.62 105.5,-48.88"/>
-<text text-anchor="middle" x="89.25" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-39.25C44.58,-39.25 53.31,-39.25 61.45,-39.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-42.75 71.2,-39.25 61.2,-35.75 61.2,-42.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b" target="_top" xlink:title="Function that add an edge between two nodes or vertices of graph.">
-<polygon fill="white" stroke="#666666" points="264,-79.5 141.5,-79.5 141.5,-49 264,-49 264,-79.5"/>
-<text text-anchor="start" x="149.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">graph::is_graph_bipartite</text>
-<text text-anchor="middle" x="202.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.75,-42.73C112.48,-44.23 120.87,-46.11 129.88,-48.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.1,-51.55 139.62,-50.32 130.63,-44.72 129.1,-51.55"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad475f8b838693812f7569a490729f373" target="_top" xlink:title="function to add edges to our graph">
-<polygon fill="white" stroke="#666666" points="264,-30.5 141.5,-30.5 141.5,0 264,0 264,-30.5"/>
-<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::is_graph_bipartite</text>
-<text text-anchor="middle" x="202.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Graph::is_bipartite</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.75,-35.91C112.48,-34.47 120.87,-32.66 129.88,-30.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.58,-34.15 139.62,-28.62 129.1,-27.31 130.58,-34.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415.75,-73.88 300,-73.88 300,-54.62 415.75,-54.62 415.75,-73.88"/>
-<text text-anchor="middle" x="357.88" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.27,-64.25C272.22,-64.25 280.42,-64.25 288.49,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.28,-67.75 298.28,-64.25 288.28,-60.75 288.28,-67.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d6/dd8/is__graph__bipartite_8cpp_source.html b/d6/dd8/is__graph__bipartite_8cpp_source.html
new file mode 100644
index 000000000..96ec90b91
--- /dev/null
+++ b/d6/dd8/is__graph__bipartite_8cpp_source.html
@@ -0,0 +1,250 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/is_graph_bipartite.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d6/dd8/is__graph__bipartite_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">is_graph_bipartite.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d6/dd8/is__graph__bipartite_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#include &lt;queue&gt;</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../de/d83/namespaceis__graph__bipartite.html">is_graph_bipartite</a> {</div>
+<div class="foldopen" id="foldopen00051" data-start="{" data-end="};">
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html">   51</a></span><span class="keyword">class </span><a class="code hl_class" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html">Graph</a> {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef">   53</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef">n</a>;  </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    std::vector&lt;std::vector&lt;int&gt; &gt;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ab0efcfa04fff8616aff0062522d1483f">   56</a></span>        <a class="code hl_variable" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ab0efcfa04fff8616aff0062522d1483f">adj</a>;  </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6">   58</a></span>    std::vector&lt;int&gt; <a class="code hl_variable" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6">side</a>;  </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00065" data-start="{" data-end="}">
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3">   65</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3">Graph</a>(<span class="keywordtype">int</span> size) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <a class="code hl_variable" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef">n</a> = size;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <a class="code hl_variable" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ab0efcfa04fff8616aff0062522d1483f">adj</a>.resize(<a class="code hl_variable" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef">n</a>);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        <a class="code hl_variable" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6">side</a>.resize(<a class="code hl_variable" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef">n</a>, -1);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    }</div>
+</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b">addEdge</a>(<span class="keywordtype">int</span> u, <span class="keywordtype">int</span> v);  </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordtype">bool</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <a class="code hl_function" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad475f8b838693812f7569a490729f373">is_bipartite</a>();  </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>};</div>
+</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="foldopen" id="foldopen00083" data-start="{" data-end="}">
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"><a class="line" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b">   83</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b">Graph::addEdge</a>(<span class="keywordtype">int</span> u, <span class="keywordtype">int</span> v) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <a class="code hl_variable" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ab0efcfa04fff8616aff0062522d1483f">adj</a>[u - 1].push_back(v - 1);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <a class="code hl_variable" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ab0efcfa04fff8616aff0062522d1483f">adj</a>[v - 1].push_back(u - 1);</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>}</div>
+</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="foldopen" id="foldopen00106" data-start="{" data-end="}">
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"><a class="line" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad475f8b838693812f7569a490729f373">  106</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad475f8b838693812f7569a490729f373">Graph::is_bipartite</a>() {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <span class="keywordtype">bool</span> check = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    std::queue&lt;int&gt; q;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> current_edge = 0; current_edge &lt; <a class="code hl_variable" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef">n</a>; ++current_edge) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6">side</a>[current_edge] == -1) {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>            q.push(current_edge);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>            <a class="code hl_variable" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6">side</a>[current_edge] = 0;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>            <span class="keywordflow">while</span> (q.size()) {</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>                <span class="keywordtype">int</span> current = q.front();</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>                q.pop();</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>                <span class="keywordflow">for</span> (<span class="keyword">auto</span> neighbour : <a class="code hl_variable" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ab0efcfa04fff8616aff0062522d1483f">adj</a>[current]) {</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>                    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6">side</a>[neighbour] == -1) {</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>                        <a class="code hl_variable" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6">side</a>[neighbour] = (1 ^ <a class="code hl_variable" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6">side</a>[current]);</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>                        q.push(neighbour);</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>                    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>                        check &amp;= (<a class="code hl_variable" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6">side</a>[neighbour] != <a class="code hl_variable" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6">side</a>[current]);</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>                    }</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>                }</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>            }</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        }</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    }</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    <span class="keywordflow">return</span> check;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>}</div>
+</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>}  <span class="comment">// namespace is_graph_bipartite</span></div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>}  <span class="comment">// namespace graph</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
+<div class="foldopen" id="foldopen00136" data-start="{" data-end="}">
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"><a class="line" href="../../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  136</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <a class="code hl_class" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html">graph::is_graph_bipartite::Graph</a> G1(</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>        5);  </div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    G1.<a class="code hl_function" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b">addEdge</a>(1, 2);</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    G1.<a class="code hl_function" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b">addEdge</a>(1, 3);</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    G1.<a class="code hl_function" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b">addEdge</a>(3, 4);</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    G1.<a class="code hl_function" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b">addEdge</a>(4, 5);</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span> </div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <a class="code hl_class" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html">graph::is_graph_bipartite::Graph</a> G2(</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        3);  </div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    G2.<a class="code hl_function" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b">addEdge</a>(1, 2);</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    G2.<a class="code hl_function" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b">addEdge</a>(1, 3);</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    G2.<a class="code hl_function" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b">addEdge</a>(2, 3);</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    <span class="keywordflow">if</span> (G1.<a class="code hl_function" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad475f8b838693812f7569a490729f373">is_bipartite</a>()) {</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;The given graph G1 is a bipartite graph\n&quot;</span>;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;The given graph G1 is not a bipartite graph\n&quot;</span>;</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    }</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    <span class="keywordflow">if</span> (G2.<a class="code hl_function" href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad475f8b838693812f7569a490729f373">is_bipartite</a>()) {</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;The given graph G2 is a bipartite graph\n&quot;</span>;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;The given graph G2 is not a bipartite graph\n&quot;</span>;</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    }</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>}</div>
+</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span> </div>
+<div class="foldopen" id="foldopen00168" data-start="{" data-end="}">
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"><a class="line" href="../../d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  168</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    <a class="code hl_function" href="../../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  </div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>}</div>
+</div>
+<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html">graph::is_graph_bipartite::Graph</a></div><div class="ttdoc">Class for representing graph as an adjacency list.</div><div class="ttdef"><b>Definition</b> <a href="#l00051">is_graph_bipartite.cpp:51</a></div></div>
+<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_a6aef65b40347c4606662cad4dd2e14d3"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3">graph::is_graph_bipartite::Graph::Graph</a></div><div class="ttdeci">Graph(int size)</div><div class="ttdoc">Constructor that initializes the graph on creation.</div><div class="ttdef"><b>Definition</b> <a href="#l00065">is_graph_bipartite.cpp:65</a></div></div>
+<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_a816cda7e563198f778fd32e03992763b"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b">graph::is_graph_bipartite::Graph::addEdge</a></div><div class="ttdeci">void addEdge(int u, int v)</div><div class="ttdoc">Function that add an edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition</b> <a href="#l00083">is_graph_bipartite.cpp:83</a></div></div>
+<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_a9d10768f927baa8a4d4a5ffce295b6b6"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6">graph::is_graph_bipartite::Graph::side</a></div><div class="ttdeci">std::vector&lt; int &gt; side</div><div class="ttdoc">stores the side of the vertex</div><div class="ttdef"><b>Definition</b> <a href="#l00058">is_graph_bipartite.cpp:58</a></div></div>
+<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_ab0efcfa04fff8616aff0062522d1483f"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ab0efcfa04fff8616aff0062522d1483f">graph::is_graph_bipartite::Graph::adj</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; adj</div><div class="ttdoc">adj stores the graph as an adjacency list</div><div class="ttdef"><b>Definition</b> <a href="#l00056">is_graph_bipartite.cpp:56</a></div></div>
+<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_ad475f8b838693812f7569a490729f373"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad475f8b838693812f7569a490729f373">graph::is_graph_bipartite::Graph::is_bipartite</a></div><div class="ttdeci">bool is_bipartite()</div><div class="ttdoc">function to add edges to our graph</div><div class="ttdef"><b>Definition</b> <a href="#l00106">is_graph_bipartite.cpp:106</a></div></div>
+<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_aefea7ee87a708298c486d5a38ac628ef"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef">graph::is_graph_bipartite::Graph::n</a></div><div class="ttdeci">int n</div><div class="ttdoc">size of the graph</div><div class="ttdef"><b>Definition</b> <a href="#l00053">is_graph_bipartite.cpp:53</a></div></div>
+<div class="ttc" id="ais__graph__bipartite_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00136">is_graph_bipartite.cpp:136</a></div></div>
+<div class="ttc" id="ais__graph__bipartite_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00168">is_graph_bipartite.cpp:168</a></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 class="ttc" id="anamespaceis__graph__bipartite_html"><div class="ttname"><a href="../../de/d83/namespaceis__graph__bipartite.html">is_graph_bipartite</a></div><div class="ttdoc">Functions for checking whether a graph is bipartite or not.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp.html">is_graph_bipartite.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.map b/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.map
index d7dd79417..c595e3dc4 100644
--- a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.map
+++ b/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.map
@@ -1,5 +1,5 @@
 <map id="std::is_integral&lt; uint128_t &gt;" name="std::is_integral&lt; uint128_t &gt;">
 <area shape="rect" id="Node000001" title=" " alt="" coords="5,79,189,105"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integral_constant.html" title=" " alt="" coords="46,5,148,31"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="46,5,148,31"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="100,46,100,79,94,79,94,46"/>
 </map>
diff --git a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.md5 b/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.md5
index 02d792f20..10a023df0 100644
--- a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.md5
+++ b/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.md5
@@ -1 +1 @@
-ae61aae73f537f6171eb63e089015b91
\ No newline at end of file
+d8e72a5cac00bd09a7e428aa97dcd5b4
\ No newline at end of file
diff --git a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.svg b/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.svg
index e8bf7b111..a60440e80 100644
--- a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.svg
+++ b/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="106.75,-74.5 30.75,-74.5 30.75,-55.25 106.75,-55.25 106.75,-74.5"/>
 <text text-anchor="middle" x="68.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph_org.svg b/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph_org.svg
index b0db0f467..ad39e9932 100644
--- a/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph_org.svg
+++ b/d6/df6/structstd_1_1is__integral_3_01uint128__t_01_4__inherit__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="106.75,-74.5 30.75,-74.5 30.75,-55.25 106.75,-55.25 106.75,-74.5"/>
 <text text-anchor="middle" x="68.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/d6/df8/classdata__structures_1_1_bitset-members.html b/d6/df8/classdata__structures_1_1_bitset-members.html
index fdc93cb29..83e515015 100644
--- a/d6/df8/classdata__structures_1_1_bitset-members.html
+++ b/d6/df8/classdata__structures_1_1_bitset-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d7/d00/list__array_8cpp.html b/d7/d00/list__array_8cpp.html
index 79d846ee4..a9f7a2358 100644
--- a/d7/d00/list__array_8cpp.html
+++ b/d7/d00/list__array_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/list_array.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/list_array.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for list_array.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d4d/list__array_8cpp__incl.svg" width="330" height="126"><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">
+</div>
+<p><a href="../../d7/d00/list__array_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list&lt; N &gt;</a></td></tr>
@@ -154,6 +173,8 @@ Functions</h2></td></tr>
 <h3><a class="anchor" id="autotoc_md42"></a>
 Algorithm</h3>
 <p>It implements various method like insert, sort, search etc. efficiently. You can select the operation and methods will do the rest work for you. You can insert element, sort them in order, search efficiently, delete values and print the list. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d7/d00/list__array_8cpp_source.html">list_array.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -172,17 +193,14 @@ Algorithm</h3>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d00/list__array_8cpp_source.html#l00260">260</a> of file <a class="el" href="../../d7/d00/list__array_8cpp_source.html">list_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  260</span>           {</div>
 <div class="line"><span class="lineno">  261</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Execute the tests</span></div>
 <div class="line"><span class="lineno">  262</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  263</span>}</div>
-<div class="ttc" id="alist__array_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> list_array.cpp:218</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d00/list__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="463" height="248"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="alist__array_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d00/list__array_8cpp_source.html#l00218">list_array.cpp:218</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -210,6 +228,8 @@ Here is the call graph for this function:</div>
 
 <p>Test implementations. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d00/list__array_8cpp_source.html#l00218">218</a> of file <a class="el" href="../../d7/d00/list__array_8cpp_source.html">list_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  218</span>                   {</div>
 <div class="line"><span class="lineno">  219</span>    <a class="code hl_struct" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list&lt;50&gt;</a> L;</div>
 <div class="line"><span class="lineno">  220</span> </div>
@@ -247,17 +267,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  252</span>    assert(L.search(12) == 2);</div>
 <div class="line"><span class="lineno">  253</span>    assert(L.search(50) == -1);  <span class="comment">// search for the non-existing element</span></div>
 <div class="line"><span class="lineno">  254</span>}</div>
-<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a></div><div class="ttdoc">Structure of List with supporting methods.</div><div class="ttdef"><b>Definition</b> list_array.cpp:37</div></div>
-<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a0b7acf65026df1e9dd13eebf309dda5e"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e">data_structures::list_array::list::show</a></div><div class="ttdeci">void show()</div><div class="ttdoc">Utility function to print array.</div><div class="ttdef"><b>Definition</b> list_array.cpp:203</div></div>
-<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a133635ad53bd89e3947ca02448819180"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180">data_structures::list_array::list::sort</a></div><div class="ttdeci">void sort()</div><div class="ttdoc">Sort the list.</div><div class="ttdef"><b>Definition</b> list_array.cpp:121</div></div>
-<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a98f7d9079c0868e0f4e67d5c52174fb6"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6">data_structures::list_array::list::remove</a></div><div class="ttdeci">void remove(const uint64_t &amp;val)</div><div class="ttdoc">To remove the element from the list.</div><div class="ttdef"><b>Definition</b> list_array.cpp:183</div></div>
-<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_aa960d714d449612f25256850d72325f1"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1">data_structures::list_array::list::insert</a></div><div class="ttdeci">void insert(const uint64_t &amp;val)</div><div class="ttdoc">Insert the new element in the list.</div><div class="ttdef"><b>Definition</b> list_array.cpp:143</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="366" height="248"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a></div><div class="ttdoc">Structure of List with supporting methods.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d00/list__array_8cpp_source.html#l00037">list_array.cpp:37</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a0b7acf65026df1e9dd13eebf309dda5e"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e">data_structures::list_array::list::show</a></div><div class="ttdeci">void show()</div><div class="ttdoc">Utility function to print array.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d00/list__array_8cpp_source.html#l00203">list_array.cpp:203</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a133635ad53bd89e3947ca02448819180"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180">data_structures::list_array::list::sort</a></div><div class="ttdeci">void sort()</div><div class="ttdoc">Sort the list.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d00/list__array_8cpp_source.html#l00121">list_array.cpp:121</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a98f7d9079c0868e0f4e67d5c52174fb6"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6">data_structures::list_array::list::remove</a></div><div class="ttdeci">void remove(const uint64_t &amp;val)</div><div class="ttdoc">To remove the element from the list.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d00/list__array_8cpp_source.html#l00183">list_array.cpp:183</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_aa960d714d449612f25256850d72325f1"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1">data_structures::list_array::list::insert</a></div><div class="ttdeci">void insert(const uint64_t &amp;val)</div><div class="ttdoc">Insert the new element in the list.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d00/list__array_8cpp_source.html#l00143">list_array.cpp:143</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 3d8ed4fe1..000000000
--- a/d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Test implementations." alt="" coords="5,112,49,137"/>
-<area shape="rect" id="Node000002" href="$d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1" title="Insert the new element in the list." alt="" coords="97,5,233,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="38,109,63,84,95,57,103,52,106,56,98,61,67,88,42,113"/>
-<area shape="rect" id="Node000003" href="$d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6" title="To remove the element from the list." alt="" coords="97,71,233,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="48,117,81,109,83,114,50,122"/>
-<area shape="rect" id="Node000004" href="$d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e" title="Utility function to print array." alt="" coords="97,136,233,177"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,127,82,134,81,140,48,132"/>
-<area shape="rect" id="Node000005" href="$d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180" title="Sort the list." alt="" coords="97,201,233,242"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="42,136,67,161,98,186,106,191,103,195,95,190,64,165,39,140"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="281,209,359,234"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="234,219,266,219,266,224,234,224"/>
-</map>
diff --git a/d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index fcd96c0a1..000000000
--- a/d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fb3f8e6e511d96db884e17640088a06a
\ No newline at end of file
diff --git a/d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 9c775735f..000000000
--- a/d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,141 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="274pt" height="186pt"
- viewBox="0.00 0.00 273.50 185.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 181.5)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-97.88 0,-97.88 0,-78.62 32.5,-78.62 32.5,-97.88"/>
-<text text-anchor="middle" x="16.25" y="-84.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1" target="_top" xlink:title="Insert the new element in the list.">
-<polygon fill="white" stroke="#666666" points="170.75,-177.5 68.5,-177.5 68.5,-147 170.75,-147 170.75,-177.5"/>
-<text text-anchor="start" x="76.5" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="119.62" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.95,-98.19C35.6,-108.79 51.99,-125.64 68.5,-137.25 70.29,-138.51 72.15,-139.74 74.06,-140.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.15,-143.87 82.55,-145.87 75.66,-137.82 72.15,-143.87"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6" target="_top" xlink:title="To remove the element from the list.">
-<polygon fill="white" stroke="#666666" points="170.75,-128.5 68.5,-128.5 68.5,-98 170.75,-98 170.75,-128.5"/>
-<text text-anchor="start" x="76.5" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="119.62" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::remove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.65,-92.05C39.57,-93.76 48.25,-95.89 57.4,-98.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.27,-101.48 66.82,-100.47 57.95,-94.68 56.27,-101.48"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e" target="_top" xlink:title="Utility function to print array.">
-<polygon fill="white" stroke="#666666" points="170.75,-79.5 68.5,-79.5 68.5,-49 170.75,-49 170.75,-79.5"/>
-<text text-anchor="start" x="76.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="119.62" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::show</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.65,-84.6C39.5,-82.98 48.06,-80.96 57.1,-78.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.89,-82.23 66.82,-76.52 56.28,-75.41 57.89,-82.23"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180" target="_top" xlink:title="Sort the list.">
-<polygon fill="white" stroke="#666666" points="170.75,-30.5 68.5,-30.5 68.5,0 170.75,0 170.75,-30.5"/>
-<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="119.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.35,-78.15C36.07,-67.75 52.29,-51.53 68.5,-40.25 70.3,-39 72.16,-37.78 74.08,-36.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.67,-39.71 82.58,-31.67 72.17,-33.64 75.67,-39.71"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="265.5,-24.88 206.75,-24.88 206.75,-5.63 265.5,-5.63 265.5,-24.88"/>
-<text text-anchor="middle" x="236.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M171.18,-15.25C179.22,-15.25 187.43,-15.25 195.18,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.98,-18.75 204.98,-15.25 194.98,-11.75 194.98,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 2ecd944b2..000000000
--- a/d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,115 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="274pt" height="186pt"
- viewBox="0.00 0.00 273.50 185.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 181.5)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-97.88 0,-97.88 0,-78.62 32.5,-78.62 32.5,-97.88"/>
-<text text-anchor="middle" x="16.25" y="-84.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1" target="_top" xlink:title="Insert the new element in the list.">
-<polygon fill="white" stroke="#666666" points="170.75,-177.5 68.5,-177.5 68.5,-147 170.75,-147 170.75,-177.5"/>
-<text text-anchor="start" x="76.5" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="119.62" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.95,-98.19C35.6,-108.79 51.99,-125.64 68.5,-137.25 70.29,-138.51 72.15,-139.74 74.06,-140.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.15,-143.87 82.55,-145.87 75.66,-137.82 72.15,-143.87"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6" target="_top" xlink:title="To remove the element from the list.">
-<polygon fill="white" stroke="#666666" points="170.75,-128.5 68.5,-128.5 68.5,-98 170.75,-98 170.75,-128.5"/>
-<text text-anchor="start" x="76.5" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="119.62" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::remove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.65,-92.05C39.57,-93.76 48.25,-95.89 57.4,-98.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.27,-101.48 66.82,-100.47 57.95,-94.68 56.27,-101.48"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e" target="_top" xlink:title="Utility function to print array.">
-<polygon fill="white" stroke="#666666" points="170.75,-79.5 68.5,-79.5 68.5,-49 170.75,-49 170.75,-79.5"/>
-<text text-anchor="start" x="76.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="119.62" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::show</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.65,-84.6C39.5,-82.98 48.06,-80.96 57.1,-78.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.89,-82.23 66.82,-76.52 56.28,-75.41 57.89,-82.23"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180" target="_top" xlink:title="Sort the list.">
-<polygon fill="white" stroke="#666666" points="170.75,-30.5 68.5,-30.5 68.5,0 170.75,0 170.75,-30.5"/>
-<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="119.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.35,-78.15C36.07,-67.75 52.29,-51.53 68.5,-40.25 70.3,-39 72.16,-37.78 74.08,-36.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.67,-39.71 82.58,-31.67 72.17,-33.64 75.67,-39.71"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="265.5,-24.88 206.75,-24.88 206.75,-5.63 265.5,-5.63 265.5,-24.88"/>
-<text text-anchor="middle" x="236.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M171.18,-15.25C179.22,-15.25 187.43,-15.25 195.18,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.98,-18.75 204.98,-15.25 194.98,-11.75 194.98,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d00/list__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d7/d00/list__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index d97700340..000000000
--- a/d7/d00/list__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,112,55,137"/>
-<area shape="rect" id="Node000002" href="$d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Test implementations." alt="" coords="103,112,146,137"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,122,87,122,87,127,55,127"/>
-<area shape="rect" id="Node000003" href="$d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1" title="Insert the new element in the list." alt="" coords="194,5,330,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="135,109,160,84,192,57,200,52,203,56,196,61,164,88,139,113"/>
-<area shape="rect" id="Node000004" href="$d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6" title="To remove the element from the list." alt="" coords="194,71,330,111"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="146,117,179,109,180,114,147,122"/>
-<area shape="rect" id="Node000005" href="$d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e" title="Utility function to print array." alt="" coords="194,136,330,177"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="147,127,179,134,178,140,146,132"/>
-<area shape="rect" id="Node000006" href="$d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180" title="Sort the list." alt="" coords="194,201,330,242"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="140,136,164,161,196,186,203,191,200,195,192,190,161,165,136,140"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="378,209,457,234"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="331,219,363,219,363,224,331,224"/>
-</map>
diff --git a/d7/d00/list__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d7/d00/list__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index d1b0869b4..000000000
--- a/d7/d00/list__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c3a55bec8ac4da41b293c846a45cd754
\ No newline at end of file
diff --git a/d7/d00/list__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d7/d00/list__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index c4e6b2b8c..000000000
--- a/d7/d00/list__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,159 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="347pt" height="186pt"
- viewBox="0.00 0.00 346.50 185.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 181.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-97.88 0,-97.88 0,-78.62 37,-78.62 37,-97.88"/>
-<text text-anchor="middle" x="18.5" y="-84.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-97.88 73,-97.88 73,-78.62 105.5,-78.62 105.5,-97.88"/>
-<text text-anchor="middle" x="89.25" y="-84.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-88.25C44.58,-88.25 53.31,-88.25 61.45,-88.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-91.75 71.2,-88.25 61.2,-84.75 61.2,-91.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1" target="_top" xlink:title="Insert the new element in the list.">
-<polygon fill="white" stroke="#666666" points="243.75,-177.5 141.5,-177.5 141.5,-147 243.75,-147 243.75,-177.5"/>
-<text text-anchor="start" x="149.5" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="192.62" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.95,-98.19C108.6,-108.79 124.99,-125.64 141.5,-137.25 143.29,-138.51 145.15,-139.74 147.06,-140.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.15,-143.87 155.55,-145.87 148.66,-137.82 145.15,-143.87"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6" target="_top" xlink:title="To remove the element from the list.">
-<polygon fill="white" stroke="#666666" points="243.75,-128.5 141.5,-128.5 141.5,-98 243.75,-98 243.75,-128.5"/>
-<text text-anchor="start" x="149.5" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="192.62" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::remove</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.65,-92.05C112.57,-93.76 121.25,-95.89 130.4,-98.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.27,-101.48 139.82,-100.47 130.95,-94.68 129.27,-101.48"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e" target="_top" xlink:title="Utility function to print array.">
-<polygon fill="white" stroke="#666666" points="243.75,-79.5 141.5,-79.5 141.5,-49 243.75,-49 243.75,-79.5"/>
-<text text-anchor="start" x="149.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="192.62" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::show</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.65,-84.6C112.5,-82.98 121.06,-80.96 130.1,-78.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.89,-82.23 139.82,-76.52 129.28,-75.41 130.89,-82.23"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180" target="_top" xlink:title="Sort the list.">
-<polygon fill="white" stroke="#666666" points="243.75,-30.5 141.5,-30.5 141.5,0 243.75,0 243.75,-30.5"/>
-<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="192.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::sort</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.35,-78.15C109.07,-67.75 125.29,-51.53 141.5,-40.25 143.3,-39 145.16,-37.78 147.08,-36.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.67,-39.71 155.58,-31.67 145.17,-33.64 148.67,-39.71"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="338.5,-24.88 279.75,-24.88 279.75,-5.63 338.5,-5.63 338.5,-24.88"/>
-<text text-anchor="middle" x="309.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M244.18,-15.25C252.22,-15.25 260.43,-15.25 268.18,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="267.98,-18.75 277.98,-15.25 267.98,-11.75 267.98,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d00/list__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d7/d00/list__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 2478f46f0..000000000
--- a/d7/d00/list__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,133 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="347pt" height="186pt"
- viewBox="0.00 0.00 346.50 185.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 181.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-97.88 0,-97.88 0,-78.62 37,-78.62 37,-97.88"/>
-<text text-anchor="middle" x="18.5" y="-84.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-97.88 73,-97.88 73,-78.62 105.5,-78.62 105.5,-97.88"/>
-<text text-anchor="middle" x="89.25" y="-84.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-88.25C44.58,-88.25 53.31,-88.25 61.45,-88.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-91.75 71.2,-88.25 61.2,-84.75 61.2,-91.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1" target="_top" xlink:title="Insert the new element in the list.">
-<polygon fill="white" stroke="#666666" points="243.75,-177.5 141.5,-177.5 141.5,-147 243.75,-147 243.75,-177.5"/>
-<text text-anchor="start" x="149.5" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="192.62" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.95,-98.19C108.6,-108.79 124.99,-125.64 141.5,-137.25 143.29,-138.51 145.15,-139.74 147.06,-140.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.15,-143.87 155.55,-145.87 148.66,-137.82 145.15,-143.87"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6" target="_top" xlink:title="To remove the element from the list.">
-<polygon fill="white" stroke="#666666" points="243.75,-128.5 141.5,-128.5 141.5,-98 243.75,-98 243.75,-128.5"/>
-<text text-anchor="start" x="149.5" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="192.62" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::remove</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.65,-92.05C112.57,-93.76 121.25,-95.89 130.4,-98.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.27,-101.48 139.82,-100.47 130.95,-94.68 129.27,-101.48"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e" target="_top" xlink:title="Utility function to print array.">
-<polygon fill="white" stroke="#666666" points="243.75,-79.5 141.5,-79.5 141.5,-49 243.75,-49 243.75,-79.5"/>
-<text text-anchor="start" x="149.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="192.62" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::show</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.65,-84.6C112.5,-82.98 121.06,-80.96 130.1,-78.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.89,-82.23 139.82,-76.52 129.28,-75.41 130.89,-82.23"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180" target="_top" xlink:title="Sort the list.">
-<polygon fill="white" stroke="#666666" points="243.75,-30.5 141.5,-30.5 141.5,0 243.75,0 243.75,-30.5"/>
-<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
-<text text-anchor="middle" x="192.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::sort</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.35,-78.15C109.07,-67.75 125.29,-51.53 141.5,-40.25 143.3,-39 145.16,-37.78 147.08,-36.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.67,-39.71 155.58,-31.67 145.17,-33.64 148.67,-39.71"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="338.5,-24.88 279.75,-24.88 279.75,-5.63 338.5,-5.63 338.5,-24.88"/>
-<text text-anchor="middle" x="309.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M244.18,-15.25C252.22,-15.25 260.43,-15.25 268.18,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="267.98,-18.75 277.98,-15.25 267.98,-11.75 267.98,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d00/list__array_8cpp_source.html b/d7/d00/list__array_8cpp_source.html
new file mode 100644
index 000000000..b3059c32d
--- /dev/null
+++ b/d7/d00/list__array_8cpp_source.html
@@ -0,0 +1,364 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/list_array.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/d00/list__array_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">list_array.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d7/d00/list__array_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;array&gt;</span>     </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d3c/namespacedata__structures.html">data_structures</a> {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/d27/namespacelist__array.html">list_array</a> {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="keyword">template</span> &lt;u<span class="keywordtype">int</span>64_t N&gt;</div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="};">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">   37</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">list</a> {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    std::array&lt;uint64_t, N&gt; data{};  <span class="comment">// Array that implement list</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    uint64_t top = 0;                <span class="comment">// Pointer to the last element</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordtype">bool</span> isSorted = <span class="keyword">false</span>;           <span class="comment">// indicator whether list is sorted or not</span></div>
+<div class="foldopen" id="foldopen00049" data-start="{" data-end="}">
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"><a class="line" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf">   49</a></span>    uint64_t <a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf">BinarySearch</a>(<span class="keyword">const</span> std::array&lt;uint64_t, N&gt; &amp;dataArr,</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>                          <span class="keyword">const</span> uint64_t &amp;first, <span class="keyword">const</span> uint64_t &amp;last,</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>                          <span class="keyword">const</span> uint64_t &amp;val) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        <span class="comment">// If both pointer cross each other means no element present in the list</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        <span class="comment">// which is equal to the val</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <span class="keywordflow">if</span> (last &lt; first) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        uint64_t mid = (first + last) / 2;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="comment">// check whether current mid pointer value is equal to element or not</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <span class="keywordflow">if</span> (dataArr[mid] == val)</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            <span class="keywordflow">return</span> mid;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="comment">// if current mid value is greater than  element we have to search in</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="comment">// first half</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (val &lt; dataArr[mid])</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            <span class="keywordflow">return</span> (<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf">BinarySearch</a>(dataArr, first, mid - 1, val));</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <span class="comment">// if current mid value is greater than  element we have to search in</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="comment">// second half</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (val &gt; dataArr[mid])</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            <span class="keywordflow">return</span> (<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf">BinarySearch</a>(dataArr, mid + 1, last, val));</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        std::cerr &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;:&quot;</span> &lt;&lt; __LINE__ &lt;&lt; <span class="stringliteral">&quot;: Undefined condition\n&quot;</span>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    }</div>
+</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="foldopen" id="foldopen00080" data-start="{" data-end="}">
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9">   80</a></span>    uint64_t <a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9">LinearSearch</a>(<span class="keyword">const</span> std::array&lt;uint64_t, N&gt; &amp;dataArr,</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>                          <span class="keyword">const</span> uint64_t &amp;val)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <span class="comment">// Going through each element in the list</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; top; i++) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            <span class="keywordflow">if</span> (dataArr[i] == val) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>                <span class="keywordflow">return</span> i;  <span class="comment">// element found at ith index</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            }</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        <span class="comment">// element is not present in the list</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    }</div>
+</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="comment">/*</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span><span class="comment">     * @brief Parent function of binarySearch and linearSearch methods</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span><span class="comment">     * @param val element that will be searched</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span><span class="comment">     * @return index of element in the list if present else -1</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    uint64_t <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>(<span class="keyword">const</span> uint64_t &amp;val) {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        uint64_t pos;  <span class="comment">// pos variable to store index value of element.</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        <span class="comment">// if list is sorted, binary search works efficiently else linear search</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        <span class="comment">// is the only option</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        <span class="keywordflow">if</span> (isSorted) {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>            pos = <a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf">BinarySearch</a>(data, 0, top - 1, val);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>            pos = <a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9">LinearSearch</a>(data, val);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        }</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="comment">// if index is equal to -1 means element does not present</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        <span class="comment">// else print the index of that element</span></div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <span class="keywordflow">if</span> (pos != -1) {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nElement found at position : &quot;</span> &lt;&lt; pos;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nElement not found&quot;</span>;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        }</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        <span class="comment">// return the index of element or -1.</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        <span class="keywordflow">return</span> pos;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    }</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="foldopen" id="foldopen00121" data-start="{" data-end="}">
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"><a class="line" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180">  121</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180">sort</a>() {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        <span class="comment">// Going through each element in the list</span></div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; top; i++) {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>            uint64_t min_idx = i;  <span class="comment">// Initialize the min variable</span></div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>            <span class="keywordflow">for</span> (uint64_t j = i + 1; j &lt; top; j++) {</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>                <span class="comment">// check whether any element less than current min value</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>                <span class="keywordflow">if</span> (data[j] &lt; data[min_idx]) {</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>                    min_idx = j;  <span class="comment">// update index accordingly</span></div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>                }</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>            }</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>            <span class="comment">// swap min value and element at the ith index</span></div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>            std::swap(data[min_idx], data[i]);</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        }</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>        <span class="comment">// mark isSorted variable as true</span></div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>        isSorted = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    }</div>
+</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span> </div>
+<div class="foldopen" id="foldopen00143" data-start="{" data-end="}">
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"><a class="line" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1">  143</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1">insert</a>(<span class="keyword">const</span> uint64_t &amp;val) {</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        <span class="comment">// overflow check</span></div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        <span class="keywordflow">if</span> (top == N) {</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nOverflow&quot;</span>;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        }</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        <span class="comment">// if list is not sorted, insert at the last</span></div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>        <span class="comment">// otherwise place it to correct position</span></div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>        <span class="keywordflow">if</span> (!isSorted) {</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>            data[top] = val;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>            top++;</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>            uint64_t pos = 0;  <span class="comment">// Initialize the index variable</span></div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>            <span class="comment">// Going through each element and find correct position for element</span></div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>            <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; top - 1; i++) {</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>                <span class="comment">// check for the correct position</span></div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>                <span class="keywordflow">if</span> (data[i] &lt;= val &amp;&amp; val &lt;= data[i + 1]) {</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>                    pos = i + 1;  <span class="comment">// assign correct pos to the index var</span></div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>                    <span class="keywordflow">break</span>;        <span class="comment">// to get out from the loop</span></div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>                }</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>            }</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>            <span class="comment">// if all elements are smaller than the element</span></div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>            <span class="keywordflow">if</span> (pos == 0) {</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>                pos = top - 1;</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>            }</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>            <span class="comment">// shift all element to make a room for new element</span></div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>            <span class="keywordflow">for</span> (uint64_t i = top; i &gt; pos; i--) {</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>                data[i] = data[i - 1];</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>            }</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>            top++;  <span class="comment">// Increment the value of top.</span></div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>            data[pos] =</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>                val;  <span class="comment">// Assign the value to the correct index in the array</span></div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        }</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    }</div>
+</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span> </div>
+<div class="foldopen" id="foldopen00183" data-start="{" data-end="}">
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"><a class="line" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6">  183</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6">remove</a>(<span class="keyword">const</span> uint64_t &amp;val) {</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>        uint64_t pos = <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>(val);  <span class="comment">// search the index of the value</span></div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        <span class="comment">// if search returns -1, element does not present in the list</span></div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        <span class="keywordflow">if</span> (pos == -1) {</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\n Element does not present in the list &quot;</span>;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        }</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span></div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>                  &lt;&lt; data[pos] &lt;&lt; <span class="stringliteral">&quot; deleted&quot;</span>;  <span class="comment">// print the appropriate message</span></div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>        <span class="comment">// shift all the element 1 left to fill vacant space</span></div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        <span class="keywordflow">for</span> (uint64_t i = pos; i &lt; top; i++) {</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>            <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i + 1];</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>        }</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>        top--;  <span class="comment">// decrement the top variable to maintain last index</span></div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    }</div>
+</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span> </div>
+<div class="foldopen" id="foldopen00203" data-start="{" data-end="}">
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"><a class="line" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e">  203</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e">show</a>() {</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>        <span class="comment">// Going through each element in the list</span></div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>        std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>        <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; top; i++) {</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>            std::cout &lt;&lt; data[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;  <span class="comment">// print the element</span></div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>        }</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    }</div>
+</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>};  <span class="comment">// structure list</span></div>
+</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>}  <span class="comment">// namespace list_array</span></div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>}  <span class="comment">// namespace data_structures</span></div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span> </div>
+<div class="foldopen" id="foldopen00218" data-start="{" data-end="}">
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"><a class="line" href="../../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  218</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    <a class="code hl_struct" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list&lt;50&gt;</a> L;</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span> </div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    <span class="comment">// Insert testing</span></div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    L.<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1">insert</a>(11);</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    L.<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1">insert</a>(12);</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    assert(L.top == 2);</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    L.<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1">insert</a>(15);</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    L.<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1">insert</a>(10);</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    L.<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1">insert</a>(12);</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    L.<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1">insert</a>(20);</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    L.<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1">insert</a>(18);</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    assert(L.top == 7);</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    L.<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e">show</a>();  <span class="comment">// To print the array</span></div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span> </div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    <span class="comment">// Remove testing</span></div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    L.<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6">remove</a>(12);  <span class="comment">// Remove Duplicate value in the list</span></div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    L.<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6">remove</a>(15);  <span class="comment">// Remove the existing value in the list</span></div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    assert(L.top == 5);</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    L.<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6">remove</a>(50);  <span class="comment">// Try to remove the non-existing value in the list</span></div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    assert(L.top == 5);</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span> </div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    <span class="comment">// LinearSearch testing</span></div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    assert(L.search(11) == 0);  <span class="comment">// search for the existing element</span></div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    assert(L.search(12) == 2);</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    assert(L.search(50) == -1);  <span class="comment">// search for the non-existing element</span></div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span> </div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    <span class="comment">// Sort testing</span></div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    L.<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180">sort</a>();</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    assert(L.isSorted == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>    L.<a class="code hl_function" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e">show</a>();</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span> </div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    <span class="comment">// BinarySearch testing</span></div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    assert(L.search(11) == 1);  <span class="comment">// search for the existing element</span></div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    assert(L.search(12) == 2);</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    assert(L.search(50) == -1);  <span class="comment">// search for the non-existing element</span></div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>}</div>
+</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span> </div>
+<div class="foldopen" id="foldopen00260" data-start="{" data-end="}">
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"><a class="line" href="../../d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  260</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>    <a class="code hl_function" href="../../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Execute the tests</span></div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>}</div>
+</div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="alist__array_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d7/d00/list__array_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> <a href="#l00218">list_array.cpp:218</a></div></div>
+<div class="ttc" id="alist__array_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00260">list_array.cpp:260</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html">data_structures</a></div><div class="ttdoc">for IO operations</div></div>
+<div class="ttc" id="anamespacelist__array_html"><div class="ttname"><a href="../../d9/d27/namespacelist__array.html">list_array</a></div><div class="ttdoc">Functions for Dynamic Array algorithm.</div></div>
+<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> <a href="../../df/dd5/binary__search_8cpp_source.html#l00047">binary_search.cpp:47</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a></div><div class="ttdoc">Structure of List with supporting methods.</div><div class="ttdef"><b>Definition</b> <a href="#l00037">list_array.cpp:37</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a0b7acf65026df1e9dd13eebf309dda5e"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e">data_structures::list_array::list::show</a></div><div class="ttdeci">void show()</div><div class="ttdoc">Utility function to print array.</div><div class="ttdef"><b>Definition</b> <a href="#l00203">list_array.cpp:203</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a133635ad53bd89e3947ca02448819180"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180">data_structures::list_array::list::sort</a></div><div class="ttdeci">void sort()</div><div class="ttdoc">Sort the list.</div><div class="ttdef"><b>Definition</b> <a href="#l00121">list_array.cpp:121</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a412bdb3910181f3c384d86aee7e217cf"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf">data_structures::list_array::list::BinarySearch</a></div><div class="ttdeci">uint64_t BinarySearch(const std::array&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;first, const uint64_t &amp;last, const uint64_t &amp;val)</div><div class="ttdoc">Search an element in the list using binarySearch.</div><div class="ttdef"><b>Definition</b> <a href="#l00049">list_array.cpp:49</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a98f7d9079c0868e0f4e67d5c52174fb6"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6">data_structures::list_array::list::remove</a></div><div class="ttdeci">void remove(const uint64_t &amp;val)</div><div class="ttdoc">To remove the element from the list.</div><div class="ttdef"><b>Definition</b> <a href="#l00183">list_array.cpp:183</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_aa960d714d449612f25256850d72325f1"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1">data_structures::list_array::list::insert</a></div><div class="ttdeci">void insert(const uint64_t &amp;val)</div><div class="ttdoc">Insert the new element in the list.</div><div class="ttdef"><b>Definition</b> <a href="#l00143">list_array.cpp:143</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_ad202ae68fe8d98082afa9dafea9e22b9"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9">data_structures::list_array::list::LinearSearch</a></div><div class="ttdeci">uint64_t LinearSearch(const std::array&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;val) const</div><div class="ttdoc">Search an element using linear search.</div><div class="ttdef"><b>Definition</b> <a href="#l00080">list_array.cpp:80</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d7/d00/list__array_8cpp.html">list_array.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/d07/bidirectional__dijkstra_8cpp.html b/d7/d07/bidirectional__dijkstra_8cpp.html
index 46a1d06d7..d3d456ada 100644
--- a/d7/d07/bidirectional__dijkstra_8cpp.html
+++ b/d7/d07/bidirectional__dijkstra_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph/bidirectional_dijkstra.cpp File Reference</title>
+<title>TheAlgorithms/C++: graph/bidirectional_dijkstra.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -126,7 +143,9 @@ Include dependency graph for bidirectional_dijkstra.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/df6/bidirectional__dijkstra_8cpp__incl.svg" width="570" height="126"><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">
+</div>
+<p><a href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></td></tr>
@@ -138,13 +157,13 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a69172365aebde9be1997157f6f80e0cf" id="r_a69172365aebde9be1997157f6f80e0cf"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj1, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj2, uint64_t u, uint64_t v, uint64_t w)</td></tr>
+<tr class="memitem:a69172365aebde9be1997157f6f80e0cf" id="r_a69172365aebde9be1997157f6f80e0cf"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a> (std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj1, std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj2, uint64_t u, uint64_t v, uint64_t w)</td></tr>
 <tr class="memdesc:a69172365aebde9be1997157f6f80e0cf"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that add edge between two nodes or vertices of graph.  <br /></td></tr>
 <tr class="separator:a69172365aebde9be1997157f6f80e0cf"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a22f1b7277e1dd4190f25014b48487ce6" id="r_a22f1b7277e1dd4190f25014b48487ce6"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a22f1b7277e1dd4190f25014b48487ce6">graph::bidirectional_dijkstra::Shortest_Path_Distance</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;workset_, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &gt; &amp;distance_)</td></tr>
+<tr class="memitem:a22f1b7277e1dd4190f25014b48487ce6" id="r_a22f1b7277e1dd4190f25014b48487ce6"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a22f1b7277e1dd4190f25014b48487ce6">graph::bidirectional_dijkstra::Shortest_Path_Distance</a> (const std::vector&lt; uint64_t &gt; &amp;workset_, const std::vector&lt; std::vector&lt; uint64_t &gt; &gt; &amp;distance_)</td></tr>
 <tr class="memdesc:a22f1b7277e1dd4190f25014b48487ce6"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function returns the shortest distance from the source to the target if there is path between vertices 's' and 't'.  <br /></td></tr>
 <tr class="separator:a22f1b7277e1dd4190f25014b48487ce6"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a1b2df3d52a403ad46523ab90d3a723c1" id="r_a1b2df3d52a403ad46523ab90d3a723c1"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1b2df3d52a403ad46523ab90d3a723c1">graph::bidirectional_dijkstra::Bidijkstra</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj1, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj2, uint64_t s, uint64_t t)</td></tr>
+<tr class="memitem:a1b2df3d52a403ad46523ab90d3a723c1" id="r_a1b2df3d52a403ad46523ab90d3a723c1"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1b2df3d52a403ad46523ab90d3a723c1">graph::bidirectional_dijkstra::Bidijkstra</a> (std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj1, std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj2, uint64_t s, uint64_t t)</td></tr>
 <tr class="memdesc:a1b2df3d52a403ad46523ab90d3a723c1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and returns the shortest distance of target from the source.  <br /></td></tr>
 <tr class="separator:a1b2df3d52a403ad46523ab90d3a723c1"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
@@ -156,7 +175,7 @@ Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:a330a2b0a904f01802ada1f8f3b28e76c" id="r_a330a2b0a904f01802ada1f8f3b28e76c"><td class="memItemLeft" align="right" valign="top">constexpr int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a330a2b0a904f01802ada1f8f3b28e76c">INF</a> = <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">std::numeric_limits</a>&lt;int64_t&gt;::max()</td></tr>
+<tr class="memitem:a330a2b0a904f01802ada1f8f3b28e76c" id="r_a330a2b0a904f01802ada1f8f3b28e76c"><td class="memItemLeft" align="right" valign="top">constexpr int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a330a2b0a904f01802ada1f8f3b28e76c">INF</a> = std::numeric_limits&lt;int64_t&gt;::max()</td></tr>
 <tr class="memdesc:a330a2b0a904f01802ada1f8f3b28e76c"><td class="mdescLeft">&#160;</td><td class="mdescRight">for assert  <br /></td></tr>
 <tr class="separator:a330a2b0a904f01802ada1f8f3b28e76c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
@@ -164,6 +183,8 @@ Variables</h2></td></tr>
 <div class="textblock"><p>[Bidirectional Dijkstra Shortest Path Algorithm] (<a href="https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra">https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra</a>) </p>
 <dl class="section author"><dt>Author</dt><dd><a href="http://github.com/Marinovsky" target="_blank">Marinovksy</a></dd></dl>
 <p>This is basically the same Dijkstra Algorithm but faster because it goes from the source to the target and from target to the source and stops when finding a vertex visited already by the direct search or the reverse one. Here some simulations of it: <a href="https://www.youtube.com/watch?v=DINCL5cd_w0&t=24s">https://www.youtube.com/watch?v=DINCL5cd_w0&amp;t=24s</a> </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html">bidirectional_dijkstra.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a69172365aebde9be1997157f6f80e0cf" name="a69172365aebde9be1997157f6f80e0cf"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a69172365aebde9be1997157f6f80e0cf">&#9670;&#160;</a></span>addEdge()</h2>
@@ -174,12 +195,12 @@ Variables</h2></td></tr>
         <tr>
           <td class="memname">void graph::bidirectional_dijkstra::addEdge </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint64_t, uint64_t &gt; &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj1</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj1</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint64_t, uint64_t &gt; &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj2</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj2</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -209,18 +230,14 @@ Variables</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00046">46</a> of file <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html">bidirectional_dijkstra.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   48</span>                                                 {</div>
-<div class="line"><span class="lineno">   49</span>    (*adj1)[u - 1].push_back(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(v - 1, w));</div>
-<div class="line"><span class="lineno">   50</span>    (*adj2)[v - 1].push_back(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(u - 1, w));</div>
+<div class="line"><span class="lineno">   49</span>    (*adj1)[u - 1].push_back(std::make_pair(v - 1, w));</div>
+<div class="line"><span class="lineno">   50</span>    (*adj2)[v - 1].push_back(std::make_pair(u - 1, w));</div>
 <div class="line"><span class="lineno">   51</span>    <span class="comment">// (*adj)[v - 1].push_back(std::make_pair(u - 1, w));</span></div>
 <div class="line"><span class="lineno">   52</span>}</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><!-- 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="../../d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph.svg" width="296" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1b2df3d52a403ad46523ab90d3a723c1" name="a1b2df3d52a403ad46523ab90d3a723c1"></a>
@@ -232,12 +249,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">int graph::bidirectional_dijkstra::Bidijkstra </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint64_t, uint64_t &gt; &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj1</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj1</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint64_t, uint64_t &gt; &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj2</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj2</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -285,123 +302,87 @@ Here is the call graph for this function:</div>
 <p>for all the reachable vertex from the currently exploring vertex we will try to minimize the distance</p>
 <p>minimizing distances</p>
 <p>check if currentNode has already been visited</p>
-<div class="fragment"><div class="line"><span class="lineno">   89</span>                                       {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   90</span><span class="comment">    /// n denotes the number of vertices in graph</span></div>
-<div class="line"><span class="lineno">   91</span><span class="comment"></span>    uint64_t n = adj1-&gt;<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">   92</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   93</span><span class="comment">    /// setting all the distances initially to INF</span></div>
-<div class="line"><span class="lineno">   94</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;uint64_t&gt;</a>&gt; dist(2, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a>(n, <a class="code hl_variable" href="#a330a2b0a904f01802ada1f8f3b28e76c">INF</a>));</div>
-<div class="line"><span class="lineno">   95</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   96</span><span class="comment">    /// creating a a vector of min heap using priority queue</span></div>
-<div class="line"><span class="lineno">   97</span><span class="comment">    /// pq[0] contains the min heap for the direct search</span></div>
-<div class="line"><span class="lineno">   98</span><span class="comment">    /// pq[1] contains the min heap for the reverse search</span></div>
-<div class="line"><span class="lineno">   99</span><span class="comment"></span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  100</span><span class="comment">    /// first element of pair contains the distance</span></div>
-<div class="line"><span class="lineno">  101</span><span class="comment">    /// second element of pair contains the vertex</span></div>
-<div class="line"><span class="lineno">  102</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;</div>
-<div class="line"><span class="lineno">  103</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue&lt;std::pair&lt;uint64_t, uint64_t&gt;</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&lt;std::pair&lt;uint64_t, uint64_t&gt;</a>&gt;,</div>
-<div class="line"><span class="lineno">  105</span>                            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/greater.html">std::greater&lt;std::pair&lt;uint64_t, uint64_t&gt;</a>&gt;&gt;&gt;</div>
-<div class="line"><span class="lineno">  106</span>        pq(2);<span class="comment"></span></div>
-<div class="line"><span class="lineno">  107</span><span class="comment">    /// vector for store the nodes or vertices in the shortest path</span></div>
-<div class="line"><span class="lineno">  108</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> workset(n);<span class="comment"></span></div>
-<div class="line"><span class="lineno">  109</span><span class="comment">    /// vector for store the nodes or vertices visited</span></div>
-<div class="line"><span class="lineno">  110</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a> visited(n);</div>
-<div class="line"><span class="lineno">  111</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  112</span><span class="comment">    /// pushing the source vertex &#39;s&#39; with 0 distance in pq[0] min heap</span></div>
-<div class="line"><span class="lineno">  113</span><span class="comment"></span>    pq[0].push(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(0, s));</div>
-<div class="line"><span class="lineno">  114</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  115</span><span class="comment">    /// marking the distance of source as 0</span></div>
-<div class="line"><span class="lineno">  116</span><span class="comment"></span>    dist[0][s] = 0;</div>
-<div class="line"><span class="lineno">  117</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  118</span><span class="comment">    /// pushing the target vertex &#39;t&#39; with 0 distance in pq[1] min heap</span></div>
-<div class="line"><span class="lineno">  119</span><span class="comment"></span>    pq[1].push(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(0, t));</div>
-<div class="line"><span class="lineno">  120</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  121</span><span class="comment">    /// marking the distance of target as 0</span></div>
-<div class="line"><span class="lineno">  122</span><span class="comment"></span>    dist[1][t] = 0;</div>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00087">87</a> of file <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html">bidirectional_dijkstra.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   89</span>                                       {</div>
+<div class="line"><span class="lineno">   91</span>    uint64_t n = adj1-&gt;size();</div>
+<div class="line"><span class="lineno">   92</span> </div>
+<div class="line"><span class="lineno">   94</span>    std::vector&lt;std::vector&lt;uint64_t&gt;&gt; dist(2, std::vector&lt;uint64_t&gt;(n, <a class="code hl_variable" href="#a330a2b0a904f01802ada1f8f3b28e76c">INF</a>));</div>
+<div class="line"><span class="lineno">   95</span> </div>
+<div class="line"><span class="lineno">   99</span> </div>
+<div class="line"><span class="lineno">  102</span>    std::vector&lt;</div>
+<div class="line"><span class="lineno">  103</span>        std::priority_queue&lt;std::pair&lt;uint64_t, uint64_t&gt;,</div>
+<div class="line"><span class="lineno">  104</span>                            std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;,</div>
+<div class="line"><span class="lineno">  105</span>                            std::greater&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;&gt;&gt;</div>
+<div class="line"><span class="lineno">  106</span>        pq(2);</div>
+<div class="line"><span class="lineno">  108</span>    std::vector&lt;uint64_t&gt; workset(n);</div>
+<div class="line"><span class="lineno">  110</span>    std::vector&lt;bool&gt; visited(n);</div>
+<div class="line"><span class="lineno">  111</span> </div>
+<div class="line"><span class="lineno">  113</span>    pq[0].push(std::make_pair(0, s));</div>
+<div class="line"><span class="lineno">  114</span> </div>
+<div class="line"><span class="lineno">  116</span>    dist[0][s] = 0;</div>
+<div class="line"><span class="lineno">  117</span> </div>
+<div class="line"><span class="lineno">  119</span>    pq[1].push(std::make_pair(0, t));</div>
+<div class="line"><span class="lineno">  120</span> </div>
+<div class="line"><span class="lineno">  122</span>    dist[1][t] = 0;</div>
 <div class="line"><span class="lineno">  123</span> </div>
-<div class="line"><span class="lineno">  124</span>    <span class="keywordflow">while</span> (<span class="keyword">true</span>) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  125</span><span class="comment">        /// direct search</span></div>
-<div class="line"><span class="lineno">  126</span><span class="comment"></span> </div>
+<div class="line"><span class="lineno">  124</span>    <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
+<div class="line"><span class="lineno">  126</span> </div>
 <div class="line"><span class="lineno">  127</span>        <span class="comment">// If pq[0].size() is equal to zero then the node/ vertex is not</span></div>
 <div class="line"><span class="lineno">  128</span>        <span class="comment">// reachable from s</span></div>
 <div class="line"><span class="lineno">  129</span>        <span class="keywordflow">if</span> (pq[0].size() == 0) {</div>
 <div class="line"><span class="lineno">  130</span>            <span class="keywordflow">break</span>;</div>
-<div class="line"><span class="lineno">  131</span>        }<span class="comment"></span></div>
-<div class="line"><span class="lineno">  132</span><span class="comment">        /// second element of pair denotes the node / vertex</span></div>
-<div class="line"><span class="lineno">  133</span><span class="comment"></span>        uint64_t currentNode = pq[0].top().second;</div>
-<div class="line"><span class="lineno">  134</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  135</span><span class="comment">        /// first element of pair denotes the distance</span></div>
-<div class="line"><span class="lineno">  136</span><span class="comment"></span>        uint64_t currentDist = pq[0].top().first;</div>
+<div class="line"><span class="lineno">  131</span>        }</div>
+<div class="line"><span class="lineno">  133</span>        uint64_t currentNode = pq[0].top().second;</div>
+<div class="line"><span class="lineno">  134</span> </div>
+<div class="line"><span class="lineno">  136</span>        uint64_t currentDist = pq[0].top().first;</div>
 <div class="line"><span class="lineno">  137</span> </div>
 <div class="line"><span class="lineno">  138</span>        pq[0].pop();</div>
-<div class="line"><span class="lineno">  139</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  140</span><span class="comment">        /// for all the reachable vertex from the currently exploring vertex</span></div>
-<div class="line"><span class="lineno">  141</span><span class="comment">        /// we will try to minimize the distance</span></div>
-<div class="line"><span class="lineno">  142</span><span class="comment"></span>        <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;int, int&gt;</a> edge : (*adj1)[currentNode]) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  143</span><span class="comment">            /// minimizing distances</span></div>
-<div class="line"><span class="lineno">  144</span><span class="comment"></span>            <span class="keywordflow">if</span> (currentDist + edge.second &lt; dist[0][edge.first]) {</div>
+<div class="line"><span class="lineno">  139</span> </div>
+<div class="line"><span class="lineno">  142</span>        <span class="keywordflow">for</span> (std::pair&lt;int, int&gt; edge : (*adj1)[currentNode]) {</div>
+<div class="line"><span class="lineno">  144</span>            <span class="keywordflow">if</span> (currentDist + edge.second &lt; dist[0][edge.first]) {</div>
 <div class="line"><span class="lineno">  145</span>                dist[0][edge.first] = currentDist + edge.second;</div>
-<div class="line"><span class="lineno">  146</span>                pq[0].push(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(dist[0][edge.first], edge.first));</div>
+<div class="line"><span class="lineno">  146</span>                pq[0].push(std::make_pair(dist[0][edge.first], edge.first));</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">// store the processed node/ vertex</span></div>
 <div class="line"><span class="lineno">  150</span>        workset.push_back(currentNode);</div>
-<div class="line"><span class="lineno">  151</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  152</span><span class="comment">        /// check if currentNode has already been visited</span></div>
-<div class="line"><span class="lineno">  153</span><span class="comment"></span>        <span class="keywordflow">if</span> (visited[currentNode] == 1) {</div>
+<div class="line"><span class="lineno">  151</span> </div>
+<div class="line"><span class="lineno">  153</span>        <span class="keywordflow">if</span> (visited[currentNode] == 1) {</div>
 <div class="line"><span class="lineno">  154</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="#a22f1b7277e1dd4190f25014b48487ce6">Shortest_Path_Distance</a>(workset, dist);</div>
 <div class="line"><span class="lineno">  155</span>        }</div>
-<div class="line"><span class="lineno">  156</span>        visited[currentNode] = <span class="keyword">true</span>;<span class="comment"></span></div>
-<div class="line"><span class="lineno">  157</span><span class="comment">        /// reversed search</span></div>
-<div class="line"><span class="lineno">  158</span><span class="comment"></span> </div>
+<div class="line"><span class="lineno">  156</span>        visited[currentNode] = <span class="keyword">true</span>;</div>
+<div class="line"><span class="lineno">  158</span> </div>
 <div class="line"><span class="lineno">  159</span>        <span class="comment">// If pq[1].size() is equal to zero then the node/ vertex is not</span></div>
 <div class="line"><span class="lineno">  160</span>        <span class="comment">// reachable from t</span></div>
 <div class="line"><span class="lineno">  161</span>        <span class="keywordflow">if</span> (pq[1].size() == 0) {</div>
 <div class="line"><span class="lineno">  162</span>            <span class="keywordflow">break</span>;</div>
-<div class="line"><span class="lineno">  163</span>        }<span class="comment"></span></div>
-<div class="line"><span class="lineno">  164</span><span class="comment">        /// second element of pair denotes the node / vertex</span></div>
-<div class="line"><span class="lineno">  165</span><span class="comment"></span>        currentNode = pq[1].top().second;</div>
-<div class="line"><span class="lineno">  166</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  167</span><span class="comment">        /// first element of pair denotes the distance</span></div>
-<div class="line"><span class="lineno">  168</span><span class="comment"></span>        currentDist = pq[1].top().first;</div>
+<div class="line"><span class="lineno">  163</span>        }</div>
+<div class="line"><span class="lineno">  165</span>        currentNode = pq[1].top().second;</div>
+<div class="line"><span class="lineno">  166</span> </div>
+<div class="line"><span class="lineno">  168</span>        currentDist = pq[1].top().first;</div>
 <div class="line"><span class="lineno">  169</span> </div>
 <div class="line"><span class="lineno">  170</span>        pq[1].pop();</div>
-<div class="line"><span class="lineno">  171</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  172</span><span class="comment">        /// for all the reachable vertex from the currently exploring vertex</span></div>
-<div class="line"><span class="lineno">  173</span><span class="comment">        /// we will try to minimize the distance</span></div>
-<div class="line"><span class="lineno">  174</span><span class="comment"></span>        <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;int, int&gt;</a> edge : (*adj2)[currentNode]) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  175</span><span class="comment">            /// minimizing distances</span></div>
-<div class="line"><span class="lineno">  176</span><span class="comment"></span>            <span class="keywordflow">if</span> (currentDist + edge.second &lt; dist[1][edge.first]) {</div>
+<div class="line"><span class="lineno">  171</span> </div>
+<div class="line"><span class="lineno">  174</span>        <span class="keywordflow">for</span> (std::pair&lt;int, int&gt; edge : (*adj2)[currentNode]) {</div>
+<div class="line"><span class="lineno">  176</span>            <span class="keywordflow">if</span> (currentDist + edge.second &lt; dist[1][edge.first]) {</div>
 <div class="line"><span class="lineno">  177</span>                dist[1][edge.first] = currentDist + edge.second;</div>
-<div class="line"><span class="lineno">  178</span>                pq[1].push(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(dist[1][edge.first], edge.first));</div>
+<div class="line"><span class="lineno">  178</span>                pq[1].push(std::make_pair(dist[1][edge.first], edge.first));</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="comment">// store the processed node/ vertex</span></div>
-<div class="line"><span class="lineno">  182</span>        workset.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(currentNode);</div>
-<div class="line"><span class="lineno">  183</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  184</span><span class="comment">        /// check if currentNode has already been visited</span></div>
-<div class="line"><span class="lineno">  185</span><span class="comment"></span>        <span class="keywordflow">if</span> (visited[currentNode] == 1) {</div>
+<div class="line"><span class="lineno">  182</span>        workset.push_back(currentNode);</div>
+<div class="line"><span class="lineno">  183</span> </div>
+<div class="line"><span class="lineno">  185</span>        <span class="keywordflow">if</span> (visited[currentNode] == 1) {</div>
 <div class="line"><span class="lineno">  186</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="#a22f1b7277e1dd4190f25014b48487ce6">Shortest_Path_Distance</a>(workset, dist);</div>
 <div class="line"><span class="lineno">  187</span>        }</div>
 <div class="line"><span class="lineno">  188</span>        visited[currentNode] = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  189</span>    }</div>
 <div class="line"><span class="lineno">  190</span>    <span class="keywordflow">return</span> -1;</div>
 <div class="line"><span class="lineno">  191</span>}</div>
-<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a22f1b7277e1dd4190f25014b48487ce6"><div class="ttname"><a href="#a22f1b7277e1dd4190f25014b48487ce6">graph::bidirectional_dijkstra::Shortest_Path_Distance</a></div><div class="ttdeci">uint64_t Shortest_Path_Distance(const std::vector&lt; uint64_t &gt; &amp;workset_, const std::vector&lt; std::vector&lt; uint64_t &gt; &gt; &amp;distance_)</div><div class="ttdoc">This function returns the shortest distance from the source to the target if there is path between ve...</div><div class="ttdef"><b>Definition</b> bidirectional_dijkstra.cpp:62</div></div>
-<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a330a2b0a904f01802ada1f8f3b28e76c"><div class="ttname"><a href="#a330a2b0a904f01802ada1f8f3b28e76c">INF</a></div><div class="ttdeci">constexpr int64_t INF</div><div class="ttdoc">for assert</div><div class="ttdef"><b>Definition</b> bidirectional_dijkstra.cpp:24</div></div>
-<div class="ttc" id="agreater_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/functional/greater.html">std::greater</a></div></div>
-<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
-<div class="ttc" id="apriority_queue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a></div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="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>
-</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="../../d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph.svg" width="352" height="191"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a22f1b7277e1dd4190f25014b48487ce6"><div class="ttname"><a href="#a22f1b7277e1dd4190f25014b48487ce6">graph::bidirectional_dijkstra::Shortest_Path_Distance</a></div><div class="ttdeci">uint64_t Shortest_Path_Distance(const std::vector&lt; uint64_t &gt; &amp;workset_, const std::vector&lt; std::vector&lt; uint64_t &gt; &gt; &amp;distance_)</div><div class="ttdoc">This function returns the shortest distance from the source to the target if there is path between ve...</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00062">bidirectional_dijkstra.cpp:62</a></div></div>
+<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a330a2b0a904f01802ada1f8f3b28e76c"><div class="ttname"><a href="#a330a2b0a904f01802ada1f8f3b28e76c">INF</a></div><div class="ttdeci">constexpr int64_t INF</div><div class="ttdoc">for assert</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00024">bidirectional_dijkstra.cpp:24</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -421,64 +402,58 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00249">249</a> of file <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html">bidirectional_dijkstra.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  249</span>           {</div>
 <div class="line"><span class="lineno">  250</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// running predefined tests</span></div>
 <div class="line"><span class="lineno">  251</span>    uint64_t vertices = uint64_t();</div>
 <div class="line"><span class="lineno">  252</span>    uint64_t edges = uint64_t();</div>
-<div class="line"><span class="lineno">  253</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the number of vertices : &quot;</span>;</div>
-<div class="line"><span class="lineno">  254</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; vertices;</div>
-<div class="line"><span class="lineno">  255</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the number of edges : &quot;</span>;</div>
-<div class="line"><span class="lineno">  256</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; edges;</div>
+<div class="line"><span class="lineno">  253</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of vertices : &quot;</span>;</div>
+<div class="line"><span class="lineno">  254</span>    std::cin &gt;&gt; vertices;</div>
+<div class="line"><span class="lineno">  255</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of edges : &quot;</span>;</div>
+<div class="line"><span class="lineno">  256</span>    std::cin &gt;&gt; edges;</div>
 <div class="line"><span class="lineno">  257</span> </div>
-<div class="line"><span class="lineno">  258</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;</a>&gt;&gt; adj1(</div>
-<div class="line"><span class="lineno">  259</span>        vertices, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;uint64_t, uint64_t&gt;</a>&gt;());</div>
-<div class="line"><span class="lineno">  260</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;</a>&gt;&gt; adj2(</div>
-<div class="line"><span class="lineno">  261</span>        vertices, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;uint64_t, uint64_t&gt;</a>&gt;());</div>
+<div class="line"><span class="lineno">  258</span>    std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;&gt; adj1(</div>
+<div class="line"><span class="lineno">  259</span>        vertices, std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;());</div>
+<div class="line"><span class="lineno">  260</span>    std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;&gt; adj2(</div>
+<div class="line"><span class="lineno">  261</span>        vertices, std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;());</div>
 <div class="line"><span class="lineno">  262</span> </div>
 <div class="line"><span class="lineno">  263</span>    uint64_t u = uint64_t(), v = uint64_t(), w = uint64_t();</div>
-<div class="line"><span class="lineno">  264</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the edges by three integers in this form: u v w &quot;</span></div>
-<div class="line"><span class="lineno">  265</span>              &lt;&lt; <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">  266</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Example: if there is and edge between node 1 and node 4 with &quot;</span></div>
+<div class="line"><span class="lineno">  264</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the edges by three integers in this form: u v w &quot;</span></div>
+<div class="line"><span class="lineno">  265</span>              &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  266</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Example: if there is and edge between node 1 and node 4 with &quot;</span></div>
 <div class="line"><span class="lineno">  267</span>                 <span class="stringliteral">&quot;weight 7 enter: 1 4 7, and then press enter&quot;</span></div>
-<div class="line"><span class="lineno">  268</span>              &lt;&lt; <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">  268</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  269</span>    <span class="keywordflow">while</span> (edges--) {</div>
-<div class="line"><span class="lineno">  270</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; u &gt;&gt; v &gt;&gt; w;</div>
+<div class="line"><span class="lineno">  270</span>        std::cin &gt;&gt; u &gt;&gt; v &gt;&gt; w;</div>
 <div class="line"><span class="lineno">  271</span>        <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&amp;adj1, &amp;adj2, u, v, w);</div>
 <div class="line"><span class="lineno">  272</span>        <span class="keywordflow">if</span> (edges != 0) {</div>
-<div class="line"><span class="lineno">  273</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the next edge&quot;</span> &lt;&lt; <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">  273</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the next edge&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  274</span>        }</div>
 <div class="line"><span class="lineno">  275</span>    }</div>
 <div class="line"><span class="lineno">  276</span> </div>
 <div class="line"><span class="lineno">  277</span>    uint64_t s = uint64_t(), t = uint64_t();</div>
-<div class="line"><span class="lineno">  278</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div>
+<div class="line"><span class="lineno">  278</span>    std::cout</div>
 <div class="line"><span class="lineno">  279</span>        &lt;&lt; <span class="stringliteral">&quot;Enter the source node and the target node separated by a space&quot;</span></div>
-<div class="line"><span class="lineno">  280</span>        &lt;&lt; <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">  281</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Example: If the source node is 5 and the target node is 6 &quot;</span></div>
+<div class="line"><span class="lineno">  280</span>        &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  281</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Example: If the source node is 5 and the target node is 6 &quot;</span></div>
 <div class="line"><span class="lineno">  282</span>                 <span class="stringliteral">&quot;enter: 5 6 and press enter&quot;</span></div>
-<div class="line"><span class="lineno">  283</span>              &lt;&lt; <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">  284</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; s &gt;&gt; t;</div>
+<div class="line"><span class="lineno">  283</span>              &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  284</span>    std::cin &gt;&gt; s &gt;&gt; t;</div>
 <div class="line"><span class="lineno">  285</span>    <span class="keywordtype">int</span> dist =</div>
 <div class="line"><span class="lineno">  286</span>        <a class="code hl_function" href="#a1b2df3d52a403ad46523ab90d3a723c1">graph::bidirectional_dijkstra::Bidijkstra</a>(&amp;adj1, &amp;adj2, s - 1, t - 1);</div>
 <div class="line"><span class="lineno">  287</span>    <span class="keywordflow">if</span> (dist == -1) {</div>
-<div class="line"><span class="lineno">  288</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Target not reachable from source&quot;</span> &lt;&lt; <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">  288</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Target not reachable from source&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  289</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  290</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Shortest Path Distance : &quot;</span> &lt;&lt; dist &lt;&lt; <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">  290</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Shortest Path Distance : &quot;</span> &lt;&lt; dist &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  291</span>    }</div>
 <div class="line"><span class="lineno">  292</span> </div>
 <div class="line"><span class="lineno">  293</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  294</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a1b2df3d52a403ad46523ab90d3a723c1"><div class="ttname"><a href="#a1b2df3d52a403ad46523ab90d3a723c1">graph::bidirectional_dijkstra::Bidijkstra</a></div><div class="ttdeci">int Bidijkstra(std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj1, std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj2, uint64_t s, uint64_t t)</div><div class="ttdoc">Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...</div><div class="ttdef"><b>Definition</b> bidirectional_dijkstra.cpp:87</div></div>
-<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Function to test the provided algorithm above.</div><div class="ttdef"><b>Definition</b> bidirectional_dijkstra.cpp:200</div></div>
-<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a69172365aebde9be1997157f6f80e0cf"><div class="ttname"><a href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a></div><div class="ttdeci">void addEdge(std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj1, std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj2, uint64_t u, uint64_t v, uint64_t w)</div><div class="ttdoc">Function that add edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition</b> bidirectional_dijkstra.cpp:46</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><!-- 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="../../d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="278" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a1b2df3d52a403ad46523ab90d3a723c1"><div class="ttname"><a href="#a1b2df3d52a403ad46523ab90d3a723c1">graph::bidirectional_dijkstra::Bidijkstra</a></div><div class="ttdeci">int Bidijkstra(std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj1, std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj2, uint64_t s, uint64_t t)</div><div class="ttdoc">Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00087">bidirectional_dijkstra.cpp:87</a></div></div>
+<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Function to test the provided algorithm above.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00200">bidirectional_dijkstra.cpp:200</a></div></div>
+<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a69172365aebde9be1997157f6f80e0cf"><div class="ttname"><a href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a></div><div class="ttdeci">void addEdge(std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj1, std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj2, uint64_t u, uint64_t v, uint64_t w)</div><div class="ttdoc">Function that add edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00046">bidirectional_dijkstra.cpp:46</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a22f1b7277e1dd4190f25014b48487ce6" name="a22f1b7277e1dd4190f25014b48487ce6"></a>
@@ -490,12 +465,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">uint64_t graph::bidirectional_dijkstra::Shortest_Path_Distance </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>workset_</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; uint64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>workset_</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>distance_</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; uint64_t &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>distance_</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -508,22 +483,18 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html">bidirectional_dijkstra.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   64</span>                                                     {</div>
-<div class="line"><span class="lineno">   65</span>    int64_t <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">distance</a> = <a class="code hl_variable" href="#a330a2b0a904f01802ada1f8f3b28e76c">INF</a>;</div>
+<div class="line"><span class="lineno">   65</span>    int64_t distance = <a class="code hl_variable" href="#a330a2b0a904f01802ada1f8f3b28e76c">INF</a>;</div>
 <div class="line"><span class="lineno">   66</span>    <span class="keywordflow">for</span> (uint64_t i : workset_) {</div>
 <div class="line"><span class="lineno">   67</span>        <span class="keywordflow">if</span> (distance_[0][i] + distance_[1][i] &lt; distance) {</div>
-<div class="line"><span class="lineno">   68</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">distance</a> = distance_[0][i] + distance_[1][i];</div>
+<div class="line"><span class="lineno">   68</span>            distance = distance_[0][i] + distance_[1][i];</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">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">distance</a>;</div>
+<div class="line"><span class="lineno">   71</span>    <span class="keywordflow">return</span> distance;</div>
 <div class="line"><span class="lineno">   72</span>}</div>
-<div class="ttc" id="adistance_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/distance.html">std::distance</a></div><div class="ttdeci">T distance(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph.svg" width="172" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -551,13 +522,15 @@ Here is the call graph for this function:</div>
 
 <p>Function to test the provided algorithm above. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00200">200</a> of file <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html">bidirectional_dijkstra.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  200</span>                    {</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> &lt;&lt; <span class="stringliteral">&quot;Initiatinig Predefined Tests...&quot;</span> &lt;&lt; <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>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initiating Test 1...&quot;</span> &lt;&lt; <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">  203</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;</a>&gt;&gt; adj1_1(</div>
-<div class="line"><span class="lineno">  204</span>        4, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;uint64_t, uint64_t&gt;</a>&gt;());</div>
-<div class="line"><span class="lineno">  205</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;</a>&gt;&gt; adj1_2(</div>
-<div class="line"><span class="lineno">  206</span>        4, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;uint64_t, uint64_t&gt;</a>&gt;());</div>
+<div class="line"><span class="lineno">  201</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiatinig Predefined Tests...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  202</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 1...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  203</span>    std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;&gt; adj1_1(</div>
+<div class="line"><span class="lineno">  204</span>        4, std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;());</div>
+<div class="line"><span class="lineno">  205</span>    std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;&gt; adj1_2(</div>
+<div class="line"><span class="lineno">  206</span>        4, std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;());</div>
 <div class="line"><span class="lineno">  207</span>    <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&amp;adj1_1, &amp;adj1_2, 1, 2, 1);</div>
 <div class="line"><span class="lineno">  208</span>    <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&amp;adj1_1, &amp;adj1_2, 4, 1, 2);</div>
 <div class="line"><span class="lineno">  209</span>    <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&amp;adj1_1, &amp;adj1_2, 2, 3, 2);</div>
@@ -566,18 +539,18 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  212</span>    uint64_t s = 1, t = 3;</div>
 <div class="line"><span class="lineno">  213</span>    assert(graph::bidirectional_dijkstra::Bidijkstra(&amp;adj1_1, &amp;adj1_2, s - 1,</div>
 <div class="line"><span class="lineno">  214</span>                                                     t - 1) == 3);</div>
-<div class="line"><span class="lineno">  215</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed...&quot;</span> &lt;&lt; <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">  215</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  216</span> </div>
 <div class="line"><span class="lineno">  217</span>    s = 4, t = 3;</div>
-<div class="line"><span class="lineno">  218</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initiating Test 2...&quot;</span> &lt;&lt; <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>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 2...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  219</span>    assert(graph::bidirectional_dijkstra::Bidijkstra(&amp;adj1_1, &amp;adj1_2, s - 1,</div>
 <div class="line"><span class="lineno">  220</span>                                                     t - 1) == 5);</div>
-<div class="line"><span class="lineno">  221</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed...&quot;</span> &lt;&lt; <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">  221</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  222</span> </div>
-<div class="line"><span class="lineno">  223</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;</a>&gt;&gt; adj2_1(</div>
-<div class="line"><span class="lineno">  224</span>        5, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;uint64_t, uint64_t&gt;</a>&gt;());</div>
-<div class="line"><span class="lineno">  225</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;</a>&gt;&gt; adj2_2(</div>
-<div class="line"><span class="lineno">  226</span>        5, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;uint64_t, uint64_t&gt;</a>&gt;());</div>
+<div class="line"><span class="lineno">  223</span>    std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;&gt; adj2_1(</div>
+<div class="line"><span class="lineno">  224</span>        5, std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;());</div>
+<div class="line"><span class="lineno">  225</span>    std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;&gt; adj2_2(</div>
+<div class="line"><span class="lineno">  226</span>        5, std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;());</div>
 <div class="line"><span class="lineno">  227</span>    <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&amp;adj2_1, &amp;adj2_2, 1, 2, 4);</div>
 <div class="line"><span class="lineno">  228</span>    <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&amp;adj2_1, &amp;adj2_2, 1, 3, 2);</div>
 <div class="line"><span class="lineno">  229</span>    <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&amp;adj2_1, &amp;adj2_2, 2, 3, 2);</div>
@@ -589,18 +562,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  235</span>    <a class="code hl_function" href="#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a>(&amp;adj2_1, &amp;adj2_2, 3, 4, 4);</div>
 <div class="line"><span class="lineno">  236</span> </div>
 <div class="line"><span class="lineno">  237</span>    s = 1, t = 5;</div>
-<div class="line"><span class="lineno">  238</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initiating Test 3...&quot;</span> &lt;&lt; <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">  238</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 3...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  239</span>    assert(graph::bidirectional_dijkstra::Bidijkstra(&amp;adj2_1, &amp;adj2_2, s - 1,</div>
 <div class="line"><span class="lineno">  240</span>                                                     t - 1) == 6);</div>
-<div class="line"><span class="lineno">  241</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed...&quot;</span> &lt;&lt; <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">  242</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All Test Passed...&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  241</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  242</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All Test Passed...&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  243</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="180" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Variable Documentation</h2>
@@ -614,7 +582,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname">int64_t INF = <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">std::numeric_limits</a>&lt;int64_t&gt;::max()</td>
+          <td class="memname">int64_t INF = std::numeric_limits&lt;int64_t&gt;::max()</td>
         </tr>
       </table>
   </td>
@@ -627,6 +595,8 @@ Here is the call graph for this function:</div>
 <p>for assert </p>
 <p>for io operations for variable INF for the priority_queue of distances for make_pair function for store the graph, the distances, and the path </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00024">24</a> of file <a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html">bidirectional_dijkstra.cpp</a>.</p>
+
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph.map b/d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph.map
deleted file mode 100644
index a8ba6296d..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="graph::bidirectional_dijkstra::Bidijkstra" name="graph::bidirectional_dijkstra::Bidijkstra">
-<area shape="rect" id="Node000001" title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return..." alt="" coords="5,47,138,88"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="34,47,33,37,39,28,52,23,72,21,93,23,105,29,103,34,91,28,71,26,53,28,42,32,38,38,40,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="213,5,320,31"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="137,48,198,33,199,38,139,53"/>
-<area shape="rect" id="Node000003" 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="189,55,344,80"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="138,65,174,65,174,70,138,70"/>
-<area shape="rect" id="Node000004" href="$d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6" title="This function returns the shortest distance from the source to the target if there is path between ve..." alt="" coords="186,129,347,185"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="119,86,191,120,189,124,117,91"/>
-<area shape="poly" id="edge5_Node000004_Node000004" title=" " alt="" coords="228,128,228,119,235,110,248,104,266,102,287,105,300,112,297,117,285,110,266,108,249,109,238,114,233,120,233,129"/>
-</map>
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph.md5 b/d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph.md5
deleted file mode 100644
index 8a97ca726..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5fe745616c70ad3a84beb96a1c074a4b
\ No newline at end of file
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph.svg b/d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph.svg
deleted file mode 100644
index c6363fe85..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph.svg
+++ /dev/null
@@ -1,122 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::bidirectional_dijkstra::Bidijkstra Pages: 1 -->
-<svg width="264pt" height="143pt"
- viewBox="0.00 0.00 264.25 142.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138.5)">
-<title>graph::bidirectional_dijkstra::Bidijkstra</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...">
-<polygon fill="#999999" stroke="#666666" points="99.25,-103.12 0,-103.12 0,-72.62 99.25,-72.62 99.25,-103.12"/>
-<text text-anchor="start" x="8" y="-89.62" font-family="Helvetica,sans-Serif" font-size="10.00">graph::bidirectional</text>
-<text text-anchor="middle" x="49.62" y="-78.38" font-family="Helvetica,sans-Serif" font-size="10.00">_dijkstra::Bidijkstra</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.73,-103.61C18.45,-112.68 27.08,-121.12 49.62,-121.12 61.96,-121.12 70.12,-118.6 74.13,-114.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.58,-115.47 75.33,-105.11 70.63,-114.61 77.58,-115.47"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236,-134.5 155.5,-134.5 155.5,-115.25 236,-115.25 236,-134.5"/>
-<text text-anchor="middle" x="195.75" y="-121" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.42,-100.4C114,-104.14 130,-108.25 144.65,-112.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.54,-115.34 154.09,-114.44 145.28,-108.56 143.54,-115.34"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.62,-97.5 137.88,-97.5 137.88,-78.25 253.62,-78.25 253.62,-97.5"/>
-<text text-anchor="middle" x="195.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.42,-87.88C108.03,-87.88 117.14,-87.88 126.18,-87.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.03,-91.38 136.03,-87.88 126.03,-84.38 126.03,-91.38"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6" target="_top" xlink:title="This function returns the shortest distance from the source to the target if there is path between ve...">
-<polygon fill="white" stroke="#666666" points="256.25,-41.75 135.25,-41.75 135.25,0 256.25,0 256.25,-41.75"/>
-<text text-anchor="start" x="143.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">graph::bidirectional</text>
-<text text-anchor="start" x="143.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_dijkstra::Shortest_Path</text>
-<text text-anchor="middle" x="195.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_Distance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.42,-72.17C100.56,-64.66 120.31,-55.48 138.61,-46.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.93,-50.22 147.52,-42.83 136.98,-43.87 139.93,-50.22"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M168.78,-42.07C166.21,-51.55 175.2,-59.75 195.75,-59.75 207.63,-59.75 215.65,-57.01 219.8,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="223.09,-54.1 222.33,-43.53 216.34,-52.27 223.09,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph_org.svg b/d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph_org.svg
deleted file mode 100644
index 4747f2a8a..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_a1b2df3d52a403ad46523ab90d3a723c1_cgraph_org.svg
+++ /dev/null
@@ -1,96 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::bidirectional_dijkstra::Bidijkstra Pages: 1 -->
-<svg width="264pt" height="143pt"
- viewBox="0.00 0.00 264.25 142.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138.5)">
-<title>graph::bidirectional_dijkstra::Bidijkstra</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...">
-<polygon fill="#999999" stroke="#666666" points="99.25,-103.12 0,-103.12 0,-72.62 99.25,-72.62 99.25,-103.12"/>
-<text text-anchor="start" x="8" y="-89.62" font-family="Helvetica,sans-Serif" font-size="10.00">graph::bidirectional</text>
-<text text-anchor="middle" x="49.62" y="-78.38" font-family="Helvetica,sans-Serif" font-size="10.00">_dijkstra::Bidijkstra</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.73,-103.61C18.45,-112.68 27.08,-121.12 49.62,-121.12 61.96,-121.12 70.12,-118.6 74.13,-114.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.58,-115.47 75.33,-105.11 70.63,-114.61 77.58,-115.47"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236,-134.5 155.5,-134.5 155.5,-115.25 236,-115.25 236,-134.5"/>
-<text text-anchor="middle" x="195.75" y="-121" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.42,-100.4C114,-104.14 130,-108.25 144.65,-112.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.54,-115.34 154.09,-114.44 145.28,-108.56 143.54,-115.34"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.62,-97.5 137.88,-97.5 137.88,-78.25 253.62,-78.25 253.62,-97.5"/>
-<text text-anchor="middle" x="195.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.42,-87.88C108.03,-87.88 117.14,-87.88 126.18,-87.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.03,-91.38 136.03,-87.88 126.03,-84.38 126.03,-91.38"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6" target="_top" xlink:title="This function returns the shortest distance from the source to the target if there is path between ve...">
-<polygon fill="white" stroke="#666666" points="256.25,-41.75 135.25,-41.75 135.25,0 256.25,0 256.25,-41.75"/>
-<text text-anchor="start" x="143.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">graph::bidirectional</text>
-<text text-anchor="start" x="143.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_dijkstra::Shortest_Path</text>
-<text text-anchor="middle" x="195.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_Distance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.42,-72.17C100.56,-64.66 120.31,-55.48 138.61,-46.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.93,-50.22 147.52,-42.83 136.98,-43.87 139.93,-50.22"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M168.78,-42.07C166.21,-51.55 175.2,-59.75 195.75,-59.75 207.63,-59.75 215.65,-57.01 219.8,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="223.09,-54.1 222.33,-43.53 216.34,-52.27 223.09,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph.map b/d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph.map
deleted file mode 100644
index 0d0c18e10..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="graph::bidirectional_dijkstra::Shortest_Path_Distance" name="graph::bidirectional_dijkstra::Shortest_Path_Distance">
-<area shape="rect" id="Node000001" title="This function returns the shortest distance from the source to the target if there is path between ve..." alt="" coords="5,29,167,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="54,29,54,19,60,10,71,5,86,3,103,5,114,12,111,16,101,10,86,8,72,10,63,14,59,21,59,29"/>
-</map>
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph.md5 b/d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph.md5
deleted file mode 100644
index 50011698b..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a8ebd0a4e86c84fe053726670c672d91
\ No newline at end of file
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph.svg b/d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph.svg
deleted file mode 100644
index f721962e5..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::bidirectional_dijkstra::Shortest_Path_Distance Pages: 1 -->
-<svg width="129pt" height="68pt"
- viewBox="0.00 0.00 129.00 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>graph::bidirectional_dijkstra::Shortest_Path_Distance</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function returns the shortest distance from the source to the target if there is path between ve...">
-<polygon fill="#999999" stroke="#666666" points="121,-41.75 0,-41.75 0,0 121,0 121,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">graph::bidirectional</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_dijkstra::Shortest_Path</text>
-<text text-anchor="middle" x="60.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_Distance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.17,-42.07C36.04,-51.55 43.48,-59.75 60.5,-59.75 70.07,-59.75 76.61,-57.16 80.13,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.52,-54.08 82.48,-43.54 76.71,-52.43 83.52,-54.08"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph_org.svg b/d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph_org.svg
deleted file mode 100644
index 29c2ae911..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_a22f1b7277e1dd4190f25014b48487ce6_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::bidirectional_dijkstra::Shortest_Path_Distance Pages: 1 -->
-<svg width="129pt" height="68pt"
- viewBox="0.00 0.00 129.00 67.75" 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 63.75)">
-<title>graph::bidirectional_dijkstra::Shortest_Path_Distance</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function returns the shortest distance from the source to the target if there is path between ve...">
-<polygon fill="#999999" stroke="#666666" points="121,-41.75 0,-41.75 0,0 121,0 121,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">graph::bidirectional</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_dijkstra::Shortest_Path</text>
-<text text-anchor="middle" x="60.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_Distance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.17,-42.07C36.04,-51.55 43.48,-59.75 60.5,-59.75 70.07,-59.75 76.61,-57.16 80.13,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.52,-54.08 82.48,-43.54 76.71,-52.43 83.52,-54.08"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index 90c7ffe6e..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Function to test the provided algorithm above." alt="" coords="5,5,56,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="104,5,175,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,16,88,16,88,21,56,21"/>
-</map>
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 02019e5ee..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c13dbf6a6a6cfdf3af15523329fdd387
\ No newline at end of file
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index e6c8cd8c5..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 135.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the provided algorithm above.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-19.25 73.75,-19.25 73.75,0 127.25,0 127.25,-19.25"/>
-<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.14,-9.62 53.69,-9.62 62.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.84,-13.13 71.83,-9.63 61.83,-6.13 61.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index dba07e9b1..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 135.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the provided algorithm above.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-19.25 73.75,-19.25 73.75,0 127.25,0 127.25,-19.25"/>
-<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.14,-9.62 53.69,-9.62 62.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.84,-13.13 71.83,-9.63 61.83,-6.13 61.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph.map b/d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph.map
deleted file mode 100644
index ef6f6fb5a..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="graph::bidirectional_dijkstra::addEdge" name="graph::bidirectional_dijkstra::addEdge">
-<area shape="rect" id="Node000001" title="Function that add edge between two nodes or vertices of graph." alt="" coords="5,29,136,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="38,29,37,19,42,11,53,5,71,3,89,5,100,11,97,16,87,10,70,8,55,10,46,14,42,20,44,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="184,37,291,62"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="136,47,168,47,168,52,136,52"/>
-</map>
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph.md5 b/d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph.md5
deleted file mode 100644
index 7b61ac721..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-952ea0752779778358ff71ee6129bd22
\ No newline at end of file
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph.svg b/d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph.svg
deleted file mode 100644
index 68ce06336..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::bidirectional_dijkstra::addEdge Pages: 1 -->
-<svg width="222pt" height="57pt"
- viewBox="0.00 0.00 222.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>graph::bidirectional_dijkstra::addEdge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that add edge between two nodes or vertices of graph.">
-<polygon fill="#999999" stroke="#666666" points="97.75,-30.5 0,-30.5 0,0 97.75,0 97.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::bidirectional</text>
-<text text-anchor="middle" x="48.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dijkstra::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.7,-30.99C22.18,-40.06 29.57,-48.5 48.88,-48.5 59.43,-48.5 66.43,-45.97 69.86,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.31,-42.8 70.89,-32.49 66.35,-42.07 73.31,-42.8"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.25,-24.88 133.75,-24.88 133.75,-5.63 214.25,-5.63 214.25,-24.88"/>
-<text text-anchor="middle" x="174" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.18,-15.25C106.06,-15.25 114.24,-15.25 122.17,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.05,-18.75 132.05,-15.25 122.05,-11.75 122.05,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph_org.svg b/d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph_org.svg
deleted file mode 100644
index fa5a159ab..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_a69172365aebde9be1997157f6f80e0cf_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::bidirectional_dijkstra::addEdge Pages: 1 -->
-<svg width="222pt" height="57pt"
- viewBox="0.00 0.00 222.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>graph::bidirectional_dijkstra::addEdge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that add edge between two nodes or vertices of graph.">
-<polygon fill="#999999" stroke="#666666" points="97.75,-30.5 0,-30.5 0,0 97.75,0 97.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::bidirectional</text>
-<text text-anchor="middle" x="48.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dijkstra::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.7,-30.99C22.18,-40.06 29.57,-48.5 48.88,-48.5 59.43,-48.5 66.43,-45.97 69.86,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.31,-42.8 70.89,-32.49 66.35,-42.07 73.31,-42.8"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.25,-24.88 133.75,-24.88 133.75,-5.63 214.25,-5.63 214.25,-24.88"/>
-<text text-anchor="middle" x="174" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.18,-15.25C106.06,-15.25 114.24,-15.25 122.17,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.05,-18.75 132.05,-15.25 122.05,-11.75 122.05,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index ca270708e..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="201,5,272,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,185,16,185,21,55,21"/>
-<area shape="rect" id="Node000003" href="$d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Function to test the provided algorithm above." alt="" coords="103,31,153,56"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,22,89,31,87,36,54,27"/>
-<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="153,35,185,27,186,33,154,40"/>
-</map>
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 02cfdf1d6..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4a17190c36fea127cb6c7203d4d6b355
\ No newline at end of file
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index ab747bef2..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="208pt" height="46pt"
- viewBox="0.00 0.00 208.25 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-38.25 0,-38.25 0,-19 37,-19 37,-38.25"/>
-<text text-anchor="middle" x="18.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.25,-38.25 146.75,-38.25 146.75,-19 200.25,-19 200.25,-38.25"/>
-<text text-anchor="middle" x="173.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-28.62C61.19,-28.62 104,-28.62 135.07,-28.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.83,-32.13 144.83,-28.63 134.83,-25.13 134.83,-32.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Function to test the provided algorithm above.">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-23.93C44.64,-21.93 53.57,-19.56 61.98,-17.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.71,-20.74 71.48,-14.79 60.91,-13.98 62.71,-20.74"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.94,-13.94C118.22,-15.67 126.89,-17.74 135.39,-19.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.34,-23.12 144.88,-22.03 135.96,-16.31 134.34,-23.12"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 2283fe3d5..000000000
--- a/d7/d07/bidirectional__dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="208pt" height="46pt"
- viewBox="0.00 0.00 208.25 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-38.25 0,-38.25 0,-19 37,-19 37,-38.25"/>
-<text text-anchor="middle" x="18.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.25,-38.25 146.75,-38.25 146.75,-19 200.25,-19 200.25,-38.25"/>
-<text text-anchor="middle" x="173.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-28.62C61.19,-28.62 104,-28.62 135.07,-28.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.83,-32.13 144.83,-28.63 134.83,-25.13 134.83,-32.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Function to test the provided algorithm above.">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-23.93C44.64,-21.93 53.57,-19.56 61.98,-17.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.71,-20.74 71.48,-14.79 60.91,-13.98 62.71,-20.74"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.94,-13.94C118.22,-15.67 126.89,-17.74 135.39,-19.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.34,-23.12 144.88,-22.03 135.96,-16.31 134.34,-23.12"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d07/bidirectional__dijkstra_8cpp_source.html b/d7/d07/bidirectional__dijkstra_8cpp_source.html
new file mode 100644
index 000000000..8e8e4343f
--- /dev/null
+++ b/d7/d07/bidirectional__dijkstra_8cpp_source.html
@@ -0,0 +1,359 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/bidirectional_dijkstra.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/d07/bidirectional__dijkstra_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">bidirectional_dijkstra.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d7/d07/bidirectional__dijkstra_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;limits&gt;</span>    </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;queue&gt;</span>     </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;utility&gt;</span>   </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"><a class="line" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">   24</a></span><span class="keyword">constexpr</span> int64_t <a class="code hl_variable" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a> = std::numeric_limits&lt;int64_t&gt;::max();</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d4/d13/namespacebidirectional__dijkstra.html">bidirectional_dijkstra</a> {</div>
+<div class="foldopen" id="foldopen00046" data-start="{" data-end="}">
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"><a class="line" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a69172365aebde9be1997157f6f80e0cf">   46</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a69172365aebde9be1997157f6f80e0cf">addEdge</a>(std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;&gt; *adj1,</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>             std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;&gt; *adj2,</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>             uint64_t u, uint64_t v, uint64_t w) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    (*adj1)[u - 1].push_back(std::make_pair(v - 1, w));</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    (*adj2)[v - 1].push_back(std::make_pair(u - 1, w));</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="comment">// (*adj)[v - 1].push_back(std::make_pair(u - 1, w));</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6">   62</a></span>uint64_t <a class="code hl_function" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6">Shortest_Path_Distance</a>(</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keyword">const</span> std::vector&lt;uint64_t&gt; &amp;workset_,</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="keyword">const</span> std::vector&lt;std::vector&lt;uint64_t&gt;&gt; &amp;distance_) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    int64_t distance = <a class="code hl_variable" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a>;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">for</span> (uint64_t i : workset_) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <span class="keywordflow">if</span> (distance_[0][i] + distance_[1][i] &lt; distance) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            distance = distance_[0][i] + distance_[1][i];</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    }</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordflow">return</span> distance;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>}</div>
+</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="foldopen" id="foldopen00087" data-start="{" data-end="}">
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"><a class="line" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a1b2df3d52a403ad46523ab90d3a723c1">   87</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a1b2df3d52a403ad46523ab90d3a723c1">Bidijkstra</a>(std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;&gt; *adj1,</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>               std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;&gt; *adj2,</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>               uint64_t s, uint64_t t) {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    uint64_t n = adj1-&gt;size();</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    std::vector&lt;std::vector&lt;uint64_t&gt;&gt; dist(2, std::vector&lt;uint64_t&gt;(n, <a class="code hl_variable" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a>));</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    std::vector&lt;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        std::priority_queue&lt;std::pair&lt;uint64_t, uint64_t&gt;,</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>                            std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;,</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>                            std::greater&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;&gt;&gt;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        pq(2);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    std::vector&lt;uint64_t&gt; workset(n);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    std::vector&lt;bool&gt; visited(n);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    pq[0].push(std::make_pair(0, s));</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    dist[0][s] = 0;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span> </div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    pq[1].push(std::make_pair(0, t));</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    dist[1][t] = 0;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <span class="comment">// If pq[0].size() is equal to zero then the node/ vertex is not</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        <span class="comment">// reachable from s</span></div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        <span class="keywordflow">if</span> (pq[0].size() == 0) {</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        }</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        uint64_t currentNode = pq[0].top().second;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        uint64_t currentDist = pq[0].top().first;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span> </div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>        pq[0].pop();</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        <span class="keywordflow">for</span> (std::pair&lt;int, int&gt; edge : (*adj1)[currentNode]) {</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>            <span class="keywordflow">if</span> (currentDist + edge.second &lt; dist[0][edge.first]) {</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>                dist[0][edge.first] = currentDist + edge.second;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>                pq[0].push(std::make_pair(dist[0][edge.first], edge.first));</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>            }</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        }</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        <span class="comment">// store the processed node/ vertex</span></div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>        workset.push_back(currentNode);</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>        <span class="keywordflow">if</span> (visited[currentNode] == 1) {</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6">Shortest_Path_Distance</a>(workset, dist);</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>        }</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>        visited[currentNode] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span> </div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        <span class="comment">// If pq[1].size() is equal to zero then the node/ vertex is not</span></div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>        <span class="comment">// reachable from t</span></div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        <span class="keywordflow">if</span> (pq[1].size() == 0) {</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        }</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>        currentNode = pq[1].top().second;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span> </div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        currentDist = pq[1].top().first;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span> </div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        pq[1].pop();</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span> </div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        <span class="keywordflow">for</span> (std::pair&lt;int, int&gt; edge : (*adj2)[currentNode]) {</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>            <span class="keywordflow">if</span> (currentDist + edge.second &lt; dist[1][edge.first]) {</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>                dist[1][edge.first] = currentDist + edge.second;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>                pq[1].push(std::make_pair(dist[1][edge.first], edge.first));</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>            }</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        }</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>        <span class="comment">// store the processed node/ vertex</span></div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>        workset.push_back(currentNode);</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span> </div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        <span class="keywordflow">if</span> (visited[currentNode] == 1) {</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6">Shortest_Path_Distance</a>(workset, dist);</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>        }</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>        visited[currentNode] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    }</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>}</div>
+</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>}  <span class="comment">// namespace bidirectional_dijkstra</span></div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>}  <span class="comment">// namespace graph</span></div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span> </div>
+<div class="foldopen" id="foldopen00200" data-start="{" data-end="}">
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"><a class="line" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">  200</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiatinig Predefined Tests...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 1...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;&gt; adj1_1(</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>        4, std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;());</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;&gt; adj1_2(</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>        4, std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;());</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    graph::bidirectional_dijkstra::addEdge(&amp;adj1_1, &amp;adj1_2, 1, 2, 1);</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    graph::bidirectional_dijkstra::addEdge(&amp;adj1_1, &amp;adj1_2, 4, 1, 2);</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    graph::bidirectional_dijkstra::addEdge(&amp;adj1_1, &amp;adj1_2, 2, 3, 2);</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    graph::bidirectional_dijkstra::addEdge(&amp;adj1_1, &amp;adj1_2, 1, 3, 5);</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span> </div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    uint64_t s = 1, t = 3;</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    assert(graph::bidirectional_dijkstra::Bidijkstra(&amp;adj1_1, &amp;adj1_2, s - 1,</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>                                                     t - 1) == 3);</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span> </div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    s = 4, t = 3;</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 2...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    assert(graph::bidirectional_dijkstra::Bidijkstra(&amp;adj1_1, &amp;adj1_2, s - 1,</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>                                                     t - 1) == 5);</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span> </div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;&gt; adj2_1(</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>        5, std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;());</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;&gt; adj2_2(</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>        5, std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;());</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    graph::bidirectional_dijkstra::addEdge(&amp;adj2_1, &amp;adj2_2, 1, 2, 4);</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    graph::bidirectional_dijkstra::addEdge(&amp;adj2_1, &amp;adj2_2, 1, 3, 2);</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    graph::bidirectional_dijkstra::addEdge(&amp;adj2_1, &amp;adj2_2, 2, 3, 2);</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    graph::bidirectional_dijkstra::addEdge(&amp;adj2_1, &amp;adj2_2, 3, 2, 1);</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    graph::bidirectional_dijkstra::addEdge(&amp;adj2_1, &amp;adj2_2, 2, 4, 2);</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    graph::bidirectional_dijkstra::addEdge(&amp;adj2_1, &amp;adj2_2, 3, 5, 4);</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    graph::bidirectional_dijkstra::addEdge(&amp;adj2_1, &amp;adj2_2, 5, 4, 1);</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    graph::bidirectional_dijkstra::addEdge(&amp;adj2_1, &amp;adj2_2, 2, 5, 3);</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    graph::bidirectional_dijkstra::addEdge(&amp;adj2_1, &amp;adj2_2, 3, 4, 4);</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span> </div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    s = 1, t = 5;</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 3...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    assert(graph::bidirectional_dijkstra::Bidijkstra(&amp;adj2_1, &amp;adj2_2, s - 1,</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>                                                     t - 1) == 6);</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All Test Passed...&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>}</div>
+</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span> </div>
+<div class="foldopen" id="foldopen00249" data-start="{" data-end="}">
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"><a class="line" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  249</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    <a class="code hl_function" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// running predefined tests</span></div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    uint64_t vertices = uint64_t();</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    uint64_t edges = uint64_t();</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of vertices : &quot;</span>;</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>    std::cin &gt;&gt; vertices;</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of edges : &quot;</span>;</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    std::cin &gt;&gt; edges;</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span> </div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;&gt; adj1(</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>        vertices, std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;());</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>    std::vector&lt;std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;&gt; adj2(</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>        vertices, std::vector&lt;std::pair&lt;uint64_t, uint64_t&gt;&gt;());</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span> </div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>    uint64_t u = uint64_t(), v = uint64_t(), w = uint64_t();</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the edges by three integers in this form: u v w &quot;</span></div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Example: if there is and edge between node 1 and node 4 with &quot;</span></div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>                 <span class="stringliteral">&quot;weight 7 enter: 1 4 7, and then press enter&quot;</span></div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>    <span class="keywordflow">while</span> (edges--) {</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>        std::cin &gt;&gt; u &gt;&gt; v &gt;&gt; w;</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>        graph::bidirectional_dijkstra::addEdge(&amp;adj1, &amp;adj2, u, v, w);</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>        <span class="keywordflow">if</span> (edges != 0) {</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the next edge&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>        }</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    }</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span> </div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>    uint64_t s = uint64_t(), t = uint64_t();</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>    std::cout</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>        &lt;&lt; <span class="stringliteral">&quot;Enter the source node and the target node separated by a space&quot;</span></div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>        &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Example: If the source node is 5 and the target node is 6 &quot;</span></div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>                 <span class="stringliteral">&quot;enter: 5 6 and press enter&quot;</span></div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>    std::cin &gt;&gt; s &gt;&gt; t;</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>    <span class="keywordtype">int</span> dist =</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>        graph::bidirectional_dijkstra::Bidijkstra(&amp;adj1, &amp;adj2, s - 1, t - 1);</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>    <span class="keywordflow">if</span> (dist == -1) {</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Target not reachable from source&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Shortest Path Distance : &quot;</span> &lt;&lt; dist &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>    }</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span> </div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>}</div>
+</div>
+<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a1b2df3d52a403ad46523ab90d3a723c1"><div class="ttname"><a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a1b2df3d52a403ad46523ab90d3a723c1">graph::bidirectional_dijkstra::Bidijkstra</a></div><div class="ttdeci">int Bidijkstra(std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj1, std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj2, uint64_t s, uint64_t t)</div><div class="ttdoc">Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...</div><div class="ttdef"><b>Definition</b> <a href="#l00087">bidirectional_dijkstra.cpp:87</a></div></div>
+<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a22f1b7277e1dd4190f25014b48487ce6"><div class="ttname"><a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6">graph::bidirectional_dijkstra::Shortest_Path_Distance</a></div><div class="ttdeci">uint64_t Shortest_Path_Distance(const std::vector&lt; uint64_t &gt; &amp;workset_, const std::vector&lt; std::vector&lt; uint64_t &gt; &gt; &amp;distance_)</div><div class="ttdoc">This function returns the shortest distance from the source to the target if there is path between ve...</div><div class="ttdef"><b>Definition</b> <a href="#l00062">bidirectional_dijkstra.cpp:62</a></div></div>
+<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a330a2b0a904f01802ada1f8f3b28e76c"><div class="ttname"><a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a></div><div class="ttdeci">constexpr int64_t INF</div><div class="ttdoc">for assert</div><div class="ttdef"><b>Definition</b> <a href="#l00024">bidirectional_dijkstra.cpp:24</a></div></div>
+<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Function to test the provided algorithm above.</div><div class="ttdef"><b>Definition</b> <a href="#l00200">bidirectional_dijkstra.cpp:200</a></div></div>
+<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a69172365aebde9be1997157f6f80e0cf"><div class="ttname"><a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a69172365aebde9be1997157f6f80e0cf">graph::bidirectional_dijkstra::addEdge</a></div><div class="ttdeci">void addEdge(std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj1, std::vector&lt; std::vector&lt; std::pair&lt; uint64_t, uint64_t &gt; &gt; &gt; *adj2, uint64_t u, uint64_t v, uint64_t w)</div><div class="ttdoc">Function that add edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition</b> <a href="#l00046">bidirectional_dijkstra.cpp:46</a></div></div>
+<div class="ttc" id="abidirectional__dijkstra_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00249">bidirectional_dijkstra.cpp:249</a></div></div>
+<div class="ttc" id="anamespacebidirectional__dijkstra_html"><div class="ttname"><a href="../../d4/d13/namespacebidirectional__dijkstra.html">bidirectional_dijkstra</a></div><div class="ttdoc">Functions for [Bidirectional Dijkstra Shortest Path] (https://www.coursera.org/learn/algorithms-on-gr...</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><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a class="el" href="../../d7/d07/bidirectional__dijkstra_8cpp.html">bidirectional_dijkstra.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/d08/namespacegraph__coloring.html b/d7/d08/namespacegraph__coloring.html
index dbe00a5c5..3abb7ebeb 100644
--- a/d7/d08/namespacegraph__coloring.html
+++ b/d7/d08/namespacegraph__coloring.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph_coloring Namespace Reference</title>
+<title>TheAlgorithms/C++: graph_coloring Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d7/d0a/namespacetrie__using__hashmap.html b/d7/d0a/namespacetrie__using__hashmap.html
index a412c8137..7d6bc8dc5 100644
--- a/d7/d0a/namespacetrie__using__hashmap.html
+++ b/d7/d0a/namespacetrie__using__hashmap.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: trie_using_hashmap Namespace Reference</title>
+<title>TheAlgorithms/C++: trie_using_hashmap Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.map b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.map
index b7592410d..b29e6ccff 100644
--- a/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.map
+++ b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.map
@@ -1,8 +1,8 @@
 <map id="data_structures::SkipList" name="data_structures::SkipList">
 <area shape="rect" id="Node000001" title=" " alt="" coords="5,124,172,150"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="204,5,349,46"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="204,5,349,46"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="231,56,111,126,108,121,228,52"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="196,109,357,165"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="196,109,357,165"/>
 <area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="279,62,279,109,274,109,274,62"/>
 <area shape="rect" id="Node000003" href="$d9/d49/structdata__structures_1_1_node.html" title=" " alt="" coords="265,228,416,253"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="361,215,367,203,375,177,377,156,374,136,366,110,357,91,343,75,311,49,315,45,347,71,361,88,371,108,379,134,382,156,380,178,372,205,366,217"/>
diff --git a/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.md5 b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.md5
index 2c8fba603..0a1b1386c 100644
--- a/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.md5
+++ b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.md5
@@ -1 +1 @@
-7d591c73646989cdb4b5e3b2b2f2f914
\ No newline at end of file
+37e3d822cecb05c3a54ba3a940c694c6
\ No newline at end of file
diff --git a/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.svg b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.svg
index d298d7729..e2403636c 100644
--- a/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.svg
+++ b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="257.88,-186 148.88,-186 148.88,-155.5 257.88,-155.5 257.88,-186"/>
 <text text-anchor="start" x="156.88" y="-172.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; data</text>
 <text text-anchor="middle" x="203.38" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">_structures::Node &gt;</text>
@@ -51,7 +51,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="263.5,-108.25 143.25,-108.25 143.25,-66.5 263.5,-66.5 263.5,-108.25"/>
 <text text-anchor="start" x="151.25" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::shared</text>
 <text text-anchor="start" x="151.25" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">_ptr&lt; data_structures::</text>
diff --git a/d7/d0b/classdata__structures_1_1_skip_list__coll__graph_org.svg b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph_org.svg
index cc32468d9..65d127bfb 100644
--- a/d7/d0b/classdata__structures_1_1_skip_list__coll__graph_org.svg
+++ b/d7/d0b/classdata__structures_1_1_skip_list__coll__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="257.88,-186 148.88,-186 148.88,-155.5 257.88,-155.5 257.88,-186"/>
 <text text-anchor="start" x="156.88" y="-172.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; data</text>
 <text text-anchor="middle" x="203.38" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">_structures::Node &gt;</text>
@@ -40,7 +40,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="263.5,-108.25 143.25,-108.25 143.25,-66.5 263.5,-66.5 263.5,-108.25"/>
 <text text-anchor="start" x="151.25" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::shared</text>
 <text text-anchor="start" x="151.25" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">_ptr&lt; data_structures::</text>
diff --git a/d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html b/d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html
index 47977b51c..82139b747 100644
--- a/d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html
+++ b/d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Guidelines for reviewers and maintainers</title>
+<title>TheAlgorithms/C++: Guidelines for reviewers and maintainers</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d7/d21/classstack__linked_list-members.html b/d7/d21/classstack__linked_list-members.html
index c74430833..a1ca76968 100644
--- a/d7/d21/classstack__linked_list-members.html
+++ b/d7/d21/classstack__linked_list-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d7/d24/nqueen__print__all__solutions_8cpp.html b/d7/d24/nqueen__print__all__solutions_8cpp.html
index 85dd75c53..80bd0a160 100644
--- a/d7/d24/nqueen__print__all__solutions_8cpp.html
+++ b/d7/d24/nqueen__print__all__solutions_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: backtracking/nqueen_print_all_solutions.cpp File Reference</title>
+<title>TheAlgorithms/C++: backtracking/nqueen_print_all_solutions.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for nqueen_print_all_solutions.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/db5/nqueen__print__all__solutions_8cpp__incl.svg" width="168" height="126"><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">
+</div>
+<p><a href="../../d7/d24/nqueen__print__all__solutions_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html">backtracking</a></td></tr>
@@ -133,15 +152,15 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:aebd5e11fab6dab282efccfb61beb0bd9" id="r_aebd5e11fab6dab282efccfb61beb0bd9"><td class="memTemplParams" colspan="2">template&lt;size_t n&gt; </td></tr>
-<tr class="memitem:aebd5e11fab6dab282efccfb61beb0bd9"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aebd5e11fab6dab282efccfb61beb0bd9">backtracking::n_queens_all_solutions::PrintSol</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; &amp;board)</td></tr>
+<tr class="memitem:aebd5e11fab6dab282efccfb61beb0bd9"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aebd5e11fab6dab282efccfb61beb0bd9">backtracking::n_queens_all_solutions::PrintSol</a> (const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board)</td></tr>
 <tr class="memdesc:aebd5e11fab6dab282efccfb61beb0bd9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to print matrix.  <br /></td></tr>
 <tr class="separator:aebd5e11fab6dab282efccfb61beb0bd9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aea343d8a72a39c9a4c0fbcbc362f2648" id="r_aea343d8a72a39c9a4c0fbcbc362f2648"><td class="memTemplParams" colspan="2">template&lt;size_t n&gt; </td></tr>
-<tr class="memitem:aea343d8a72a39c9a4c0fbcbc362f2648"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aea343d8a72a39c9a4c0fbcbc362f2648">backtracking::n_queens_all_solutions::CanIMove</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; &amp;board, int row, int col)</td></tr>
+<tr class="memitem:aea343d8a72a39c9a4c0fbcbc362f2648"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aea343d8a72a39c9a4c0fbcbc362f2648">backtracking::n_queens_all_solutions::CanIMove</a> (const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board, int row, int col)</td></tr>
 <tr class="memdesc:aea343d8a72a39c9a4c0fbcbc362f2648"><td class="mdescLeft">&#160;</td><td class="mdescRight">Check if a queen can be placed on the matrix.  <br /></td></tr>
 <tr class="separator:aea343d8a72a39c9a4c0fbcbc362f2648"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:acc809c055f335011de0d9030034c7108" id="r_acc809c055f335011de0d9030034c7108"><td class="memTemplParams" colspan="2">template&lt;size_t n&gt; </td></tr>
-<tr class="memitem:acc809c055f335011de0d9030034c7108"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#acc809c055f335011de0d9030034c7108">backtracking::n_queens_all_solutions::NQueenSol</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; board, int col)</td></tr>
+<tr class="memitem:acc809c055f335011de0d9030034c7108"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#acc809c055f335011de0d9030034c7108">backtracking::n_queens_all_solutions::NQueenSol</a> (std::array&lt; std::array&lt; int, n &gt;, n &gt; board, int col)</td></tr>
 <tr class="memdesc:acc809c055f335011de0d9030034c7108"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function to solve the N Queens problem.  <br /></td></tr>
 <tr class="separator:acc809c055f335011de0d9030034c7108"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
@@ -153,6 +172,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Himani2000" target="_blank">Himani Negi</a> </dd>
 <dd>
 <a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d7/d24/nqueen__print__all__solutions_8cpp_source.html">nqueen_print_all_solutions.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="aea343d8a72a39c9a4c0fbcbc362f2648" name="aea343d8a72a39c9a4c0fbcbc362f2648"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aea343d8a72a39c9a4c0fbcbc362f2648">&#9670;&#160;</a></span>CanIMove()</h2>
@@ -165,7 +186,7 @@ template&lt;size_t n&gt; </div>
         <tr>
           <td class="memname">bool backtracking::n_queens_all_solutions::CanIMove </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>board</em></span>, </td>
+          <td class="paramtype">const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>board</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -201,21 +222,20 @@ template&lt;size_t n&gt; </div>
 <p>check in the row</p>
 <p>check the first diagonal</p>
 <p>check the second diagonal</p>
-<div class="fragment"><div class="line"><span class="lineno">   52</span>                       {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   53</span><span class="comment">    /// check in the row</span></div>
-<div class="line"><span class="lineno">   54</span><span class="comment"></span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; col; i++) {</div>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d24/nqueen__print__all__solutions_8cpp_source.html#l00051">51</a> of file <a class="el" href="../../d7/d24/nqueen__print__all__solutions_8cpp_source.html">nqueen_print_all_solutions.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   52</span>                       {</div>
+<div class="line"><span class="lineno">   54</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; col; i++) {</div>
 <div class="line"><span class="lineno">   55</span>        <span class="keywordflow">if</span> (board[row][i] == 1) {</div>
 <div class="line"><span class="lineno">   56</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   57</span>        }</div>
-<div class="line"><span class="lineno">   58</span>    }<span class="comment"></span></div>
-<div class="line"><span class="lineno">   59</span><span class="comment">    /// check the first diagonal</span></div>
-<div class="line"><span class="lineno">   60</span><span class="comment"></span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = row, j = col; i &gt;= 0 &amp;&amp; j &gt;= 0; i--, j--) {</div>
+<div class="line"><span class="lineno">   58</span>    }</div>
+<div class="line"><span class="lineno">   60</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = row, j = col; i &gt;= 0 &amp;&amp; j &gt;= 0; i--, j--) {</div>
 <div class="line"><span class="lineno">   61</span>        <span class="keywordflow">if</span> (board[i][j] == 1) {</div>
 <div class="line"><span class="lineno">   62</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   63</span>        }</div>
-<div class="line"><span class="lineno">   64</span>    }<span class="comment"></span></div>
-<div class="line"><span class="lineno">   65</span><span class="comment">    /// check the second diagonal</span></div>
-<div class="line"><span class="lineno">   66</span><span class="comment"></span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = row, j = col; i &lt;= n - 1 &amp;&amp; j &gt;= 0; i++, j--) {</div>
+<div class="line"><span class="lineno">   64</span>    }</div>
+<div class="line"><span class="lineno">   66</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = row, j = col; i &lt;= n - 1 &amp;&amp; j &gt;= 0; i++, j--) {</div>
 <div class="line"><span class="lineno">   67</span>        <span class="keywordflow">if</span> (board[i][j] == 1) {</div>
 <div class="line"><span class="lineno">   68</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   69</span>        }</div>
@@ -242,14 +262,15 @@ template&lt;size_t n&gt; </div>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d24/nqueen__print__all__solutions_8cpp_source.html#l00101">101</a> of file <a class="el" href="../../d7/d24/nqueen__print__all__solutions_8cpp_source.html">nqueen_print_all_solutions.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  101</span>           {</div>
 <div class="line"><span class="lineno">  102</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> n = 4;</div>
-<div class="line"><span class="lineno">  103</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;int, n&gt;</a>, n&gt; board{0};</div>
+<div class="line"><span class="lineno">  103</span>    std::array&lt;std::array&lt;int, n&gt;, n&gt; board{0};</div>
 <div class="line"><span class="lineno">  104</span> </div>
 <div class="line"><span class="lineno">  105</span>    <a class="code hl_function" href="#acc809c055f335011de0d9030034c7108">backtracking::n_queens_all_solutions::NQueenSol</a>(board, 0);</div>
 <div class="line"><span class="lineno">  106</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="anqueen__print__all__solutions_8cpp_html_acc809c055f335011de0d9030034c7108"><div class="ttname"><a href="#acc809c055f335011de0d9030034c7108">backtracking::n_queens_all_solutions::NQueenSol</a></div><div class="ttdeci">void NQueenSol(std::array&lt; std::array&lt; int, n &gt;, n &gt; board, int col)</div><div class="ttdoc">Main function to solve the N Queens problem.</div><div class="ttdef"><b>Definition</b> nqueen_print_all_solutions.cpp:81</div></div>
+<div class="ttc" id="anqueen__print__all__solutions_8cpp_html_acc809c055f335011de0d9030034c7108"><div class="ttname"><a href="#acc809c055f335011de0d9030034c7108">backtracking::n_queens_all_solutions::NQueenSol</a></div><div class="ttdeci">void NQueenSol(std::array&lt; std::array&lt; int, n &gt;, n &gt; board, int col)</div><div class="ttdoc">Main function to solve the N Queens problem.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d24/nqueen__print__all__solutions_8cpp_source.html#l00081">nqueen_print_all_solutions.cpp:81</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -264,7 +285,7 @@ template&lt;size_t n&gt; </div>
         <tr>
           <td class="memname">void backtracking::n_queens_all_solutions::NQueenSol </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt;</td>          <td class="paramname"><span class="paramname"><em>board</em></span>, </td>
+          <td class="paramtype">std::array&lt; std::array&lt; int, n &gt;, n &gt;</td>          <td class="paramname"><span class="paramname"><em>board</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -288,6 +309,8 @@ template&lt;size_t n&gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d24/nqueen__print__all__solutions_8cpp_source.html#l00081">81</a> of file <a class="el" href="../../d7/d24/nqueen__print__all__solutions_8cpp_source.html">nqueen_print_all_solutions.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   81</span>                                                             {</div>
 <div class="line"><span class="lineno">   82</span>    <span class="keywordflow">if</span> (col &gt;= n) {</div>
 <div class="line"><span class="lineno">   83</span>        <a class="code hl_function" href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905">PrintSol</a>(board);</div>
@@ -301,9 +324,9 @@ template&lt;size_t n&gt; </div>
 <div class="line"><span class="lineno">   91</span>        }</div>
 <div class="line"><span class="lineno">   92</span>    }</div>
 <div class="line"><span class="lineno">   93</span>}</div>
-<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a04090463be4942a69ea91fe7386da905"><div class="ttname"><a href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905">backtracking::n_queens_optimized::PrintSol</a></div><div class="ttdeci">void PrintSol(const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board)</div><div class="ttdef"><b>Definition</b> n_queens_all_solution_optimised.cpp:30</div></div>
-<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a23c0547e4fd1708e6fb643b08327a60f"><div class="ttname"><a href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f">backtracking::n_queens_optimized::NQueenSol</a></div><div class="ttdeci">void NQueenSol(std::array&lt; std::array&lt; int, n &gt;, n &gt; board, int col)</div><div class="ttdef"><b>Definition</b> n_queens_all_solution_optimised.cpp:89</div></div>
-<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a9e48455584a4faa33e83dd1891efd9b9"><div class="ttname"><a href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9">backtracking::n_queens_optimized::CanIMove</a></div><div class="ttdeci">bool CanIMove(const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board, int row, int col)</div><div class="ttdef"><b>Definition</b> n_queens_all_solution_optimised.cpp:59</div></div>
+<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a04090463be4942a69ea91fe7386da905"><div class="ttname"><a href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905">backtracking::n_queens_optimized::PrintSol</a></div><div class="ttdeci">void PrintSol(const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board)</div><div class="ttdef"><b>Definition</b> <a href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html#l00030">n_queens_all_solution_optimised.cpp:30</a></div></div>
+<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a23c0547e4fd1708e6fb643b08327a60f"><div class="ttname"><a href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f">backtracking::n_queens_optimized::NQueenSol</a></div><div class="ttdeci">void NQueenSol(std::array&lt; std::array&lt; int, n &gt;, n &gt; board, int col)</div><div class="ttdef"><b>Definition</b> <a href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html#l00089">n_queens_all_solution_optimised.cpp:89</a></div></div>
+<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a9e48455584a4faa33e83dd1891efd9b9"><div class="ttname"><a href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9">backtracking::n_queens_optimized::CanIMove</a></div><div class="ttdeci">bool CanIMove(const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board, int row, int col)</div><div class="ttdef"><b>Definition</b> <a href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html#l00059">n_queens_all_solution_optimised.cpp:59</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -318,7 +341,7 @@ template&lt;size_t n&gt; </div>
         <tr>
           <td class="memname">void backtracking::n_queens_all_solutions::PrintSol </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>board</em></span></td><td>)</td>
+          <td class="paramtype">const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>board</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -337,23 +360,18 @@ template&lt;size_t n&gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d24/nqueen__print__all__solutions_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../d7/d24/nqueen__print__all__solutions_8cpp_source.html">nqueen_print_all_solutions.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   31</span>                                                          {</div>
 <div class="line"><span class="lineno">   32</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
 <div class="line"><span class="lineno">   33</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
-<div class="line"><span class="lineno">   34</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; board[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   34</span>            std::cout &lt;&lt; board[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   35</span>        }</div>
-<div class="line"><span class="lineno">   36</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   36</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   37</span>    }</div>
-<div class="line"><span class="lineno">   38</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   38</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   39</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="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><!-- 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="../../d7/d24/nqueen__print__all__solutions_8cpp_aebd5e11fab6dab282efccfb61beb0bd9_cgraph.svg" width="290" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d7/d24/nqueen__print__all__solutions_8cpp_aebd5e11fab6dab282efccfb61beb0bd9_cgraph.map b/d7/d24/nqueen__print__all__solutions_8cpp_aebd5e11fab6dab282efccfb61beb0bd9_cgraph.map
deleted file mode 100644
index 20464f214..000000000
--- a/d7/d24/nqueen__print__all__solutions_8cpp_aebd5e11fab6dab282efccfb61beb0bd9_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="backtracking::n_queens_all_solutions::PrintSol" name="backtracking::n_queens_all_solutions::PrintSol">
-<area shape="rect" id="Node000001" title="Utility function to print matrix." alt="" coords="5,5,165,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="213,13,284,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="165,23,197,23,197,28,165,28"/>
-</map>
diff --git a/d7/d24/nqueen__print__all__solutions_8cpp_aebd5e11fab6dab282efccfb61beb0bd9_cgraph.md5 b/d7/d24/nqueen__print__all__solutions_8cpp_aebd5e11fab6dab282efccfb61beb0bd9_cgraph.md5
deleted file mode 100644
index ef322a165..000000000
--- a/d7/d24/nqueen__print__all__solutions_8cpp_aebd5e11fab6dab282efccfb61beb0bd9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8a158d3db0024949bfd06cf0c45cd518
\ No newline at end of file
diff --git a/d7/d24/nqueen__print__all__solutions_8cpp_aebd5e11fab6dab282efccfb61beb0bd9_cgraph.svg b/d7/d24/nqueen__print__all__solutions_8cpp_aebd5e11fab6dab282efccfb61beb0bd9_cgraph.svg
deleted file mode 100644
index a47d07cad..000000000
--- a/d7/d24/nqueen__print__all__solutions_8cpp_aebd5e11fab6dab282efccfb61beb0bd9_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::n_queens_all_solutions::PrintSol Pages: 1 -->
-<svg width="217pt" height="39pt"
- viewBox="0.00 0.00 217.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>backtracking::n_queens_all_solutions::PrintSol</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to print matrix.">
-<polygon fill="#999999" stroke="#666666" points="119.5,-30.5 0,-30.5 0,0 119.5,0 119.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::n_queens</text>
-<text text-anchor="middle" x="59.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_all_solutions::PrintSol</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209,-24.88 155.5,-24.88 155.5,-5.63 209,-5.63 209,-24.88"/>
-<text text-anchor="middle" x="182.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.94,-15.25C128.07,-15.25 136.22,-15.25 143.8,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.65,-18.75 153.65,-15.25 143.65,-11.75 143.65,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d24/nqueen__print__all__solutions_8cpp_aebd5e11fab6dab282efccfb61beb0bd9_cgraph_org.svg b/d7/d24/nqueen__print__all__solutions_8cpp_aebd5e11fab6dab282efccfb61beb0bd9_cgraph_org.svg
deleted file mode 100644
index cfb6fdc67..000000000
--- a/d7/d24/nqueen__print__all__solutions_8cpp_aebd5e11fab6dab282efccfb61beb0bd9_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::n_queens_all_solutions::PrintSol Pages: 1 -->
-<svg width="217pt" height="39pt"
- viewBox="0.00 0.00 217.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>backtracking::n_queens_all_solutions::PrintSol</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to print matrix.">
-<polygon fill="#999999" stroke="#666666" points="119.5,-30.5 0,-30.5 0,0 119.5,0 119.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::n_queens</text>
-<text text-anchor="middle" x="59.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_all_solutions::PrintSol</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209,-24.88 155.5,-24.88 155.5,-5.63 209,-5.63 209,-24.88"/>
-<text text-anchor="middle" x="182.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.94,-15.25C128.07,-15.25 136.22,-15.25 143.8,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.65,-18.75 153.65,-15.25 143.65,-11.75 143.65,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d24/nqueen__print__all__solutions_8cpp_source.html b/d7/d24/nqueen__print__all__solutions_8cpp_source.html
new file mode 100644
index 000000000..96e00c050
--- /dev/null
+++ b/d7/d24/nqueen__print__all__solutions_8cpp_source.html
@@ -0,0 +1,209 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: backtracking/nqueen_print_all_solutions.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/d24/nqueen__print__all__solutions_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">nqueen_print_all_solutions.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d7/d24/nqueen__print__all__solutions_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;array&gt;</span>     </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../db/dc0/namespacebacktracking.html">backtracking</a> {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/d44/namespacen__queens__all__solutions.html">n_queens_all_solutions</a> {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> n&gt;</div>
+<div class="foldopen" id="foldopen00031" data-start="{" data-end="}">
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="../../d7/d24/nqueen__print__all__solutions_8cpp.html#aebd5e11fab6dab282efccfb61beb0bd9">   31</a></span><span class="keywordtype">void</span> PrintSol(<span class="keyword">const</span> std::array&lt;std::array&lt;int, n&gt;, n&gt;&amp; board) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>            std::cout &lt;&lt; board[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        }</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    }</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>}</div>
+</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> n&gt;</div>
+<div class="foldopen" id="foldopen00051" data-start="{" data-end="}">
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="../../d7/d24/nqueen__print__all__solutions_8cpp.html#aea343d8a72a39c9a4c0fbcbc362f2648">   51</a></span><span class="keywordtype">bool</span> CanIMove(<span class="keyword">const</span> std::array&lt;std::array&lt;int, n&gt;, n&gt;&amp; board, <span class="keywordtype">int</span> row,</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>              <span class="keywordtype">int</span> col) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; col; i++) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="keywordflow">if</span> (board[row][i] == 1) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        }</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    }</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = row, j = col; i &gt;= 0 &amp;&amp; j &gt;= 0; i--, j--) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="keywordflow">if</span> (board[i][j] == 1) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = row, j = col; i &lt;= n - 1 &amp;&amp; j &gt;= 0; i++, j--) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <span class="keywordflow">if</span> (board[i][j] == 1) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    }</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>}</div>
+</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> n&gt;</div>
+<div class="foldopen" id="foldopen00081" data-start="{" data-end="}">
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="../../d7/d24/nqueen__print__all__solutions_8cpp.html#acc809c055f335011de0d9030034c7108">   81</a></span><span class="keywordtype">void</span> NQueenSol(std::array&lt;std::array&lt;int, n&gt;, n&gt; board, <span class="keywordtype">int</span> col) {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">if</span> (col &gt;= n) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        PrintSol(board);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    }</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        <span class="keywordflow">if</span> (CanIMove(board, i, col)) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>            board[i][col] = 1;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>            NQueenSol(board, col + 1);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>            board[i][col] = 0;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        }</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    }</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>}</div>
+</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>}  <span class="comment">// namespace n_queens_all_solutions</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>}  <span class="comment">// namespace backtracking</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="foldopen" id="foldopen00101" data-start="{" data-end="}">
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"><a class="line" href="../../d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  101</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> n = 4;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    std::array&lt;std::array&lt;int, n&gt;, n&gt; board{0};</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    backtracking::n_queens_all_solutions::NQueenSol(board, 0);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>}</div>
+</div>
+<div class="ttc" id="anamespacebacktracking_html"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html">backtracking</a></div><div class="ttdoc">for vector container</div></div>
+<div class="ttc" id="anamespacen__queens__all__solutions_html"><div class="ttname"><a href="../../df/d44/namespacen__queens__all__solutions.html">n_queens_all_solutions</a></div><div class="ttdoc">Functions for the Eight Queens puzzle with all solutions.</div></div>
+<div class="ttc" id="anqueen__print__all__solutions_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00101">nqueen_print_all_solutions.cpp:101</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a class="el" href="../../d7/d24/nqueen__print__all__solutions_8cpp.html">nqueen_print_all_solutions.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/d31/classqueue__coll__graph.map b/d7/d31/classqueue__coll__graph.map
index 21224da7d..ac9941ba4 100644
--- a/d7/d31/classqueue__coll__graph.map
+++ b/d7/d31/classqueue__coll__graph.map
@@ -1,12 +1,10 @@
 <map id="queue&lt; ValueType &gt;" name="queue&lt; ValueType &gt;">
-<area shape="rect" id="Node000001" title=" " alt="" coords="90,301,230,327"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="5,198,169,223"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="107,234,154,299,149,302,102,237"/>
+<area shape="rect" id="Node000001" title=" " alt="" coords="17,301,157,327"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,198,169,223"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="90,239,90,301,84,301,84,239"/>
 <area shape="rect" id="Node000003" href="$db/d8b/struct_node.html" title=" " alt="" coords="19,109,155,135"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="90,150,90,197,84,197,84,150"/>
 <area shape="poly" id="edge4_Node000003_Node000003" title=" " alt="" coords="172,114,182,122,174,130,156,132,155,127,171,125,177,122,169,118"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="11,5,163,46"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="11,5,163,46"/>
 <area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="90,61,90,109,84,109,84,61"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/size_t.html" title=" " alt="" coords="192,198,275,223"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="227,239,206,279,181,303,177,299,202,276,223,237"/>
 </map>
diff --git a/d7/d31/classqueue__coll__graph.md5 b/d7/d31/classqueue__coll__graph.md5
index de1800c81..81123d93b 100644
--- a/d7/d31/classqueue__coll__graph.md5
+++ b/d7/d31/classqueue__coll__graph.md5
@@ -1 +1 @@
-539641bb1192127b843f1b74ac2ccde0
\ No newline at end of file
+5ec1ceaaeb3e1bd04ad856d677c1e8fd
\ No newline at end of file
diff --git a/d7/d31/classqueue__coll__graph.svg b/d7/d31/classqueue__coll__graph.svg
index cdbce2d38..2089d9575 100644
--- a/d7/d31/classqueue__coll__graph.svg
+++ b/d7/d31/classqueue__coll__graph.svg
@@ -4,8 +4,8 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: queue&lt; ValueType &gt; Pages: 1 -->
-<svg width="210pt" height="249pt"
- viewBox="0.00 0.00 210.12 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="160pt" height="249pt"
+ viewBox="0.00 0.00 160.12 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
 <svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
@@ -23,15 +23,15 @@
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="168.88,-19.25 63.62,-19.25 63.62,0 168.88,0 168.88,-19.25"/>
-<text text-anchor="middle" x="116.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue&lt; ValueType &gt;</text>
+<polygon fill="#999999" stroke="#666666" points="113.88,-19.25 8.62,-19.25 8.62,0 113.88,0 113.88,-19.25"/>
+<text text-anchor="middle" x="61.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue&lt; ValueType &gt;</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="122.5,-97 0,-97 0,-77.75 122.5,-77.75 122.5,-97"/>
 <text text-anchor="middle" x="61.25" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Node &gt;</text>
 </a>
@@ -41,12 +41,12 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M74.35,-68.33C85.5,-52.97 101.05,-31.55 109.73,-19.6"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="71.71,-66.01 68.66,-76.16 77.37,-70.13 71.71,-66.01"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M61.25,-66.1C61.25,-50.95 61.25,-30.98 61.25,-19.6"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="57.75,-65.87 61.25,-75.87 64.75,-65.87 57.75,-65.87"/>
 </a>
 </g>
-<text text-anchor="middle" x="122.77" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> queueFront</text>
-<text text-anchor="middle" x="122.77" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">queueRear</text>
+<text text-anchor="middle" x="87.12" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> queueFront</text>
+<text text-anchor="middle" x="87.12" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">queueRear</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
@@ -80,7 +80,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="118,-241.25 4.5,-241.25 4.5,-210.75 118,-210.75 118,-241.25"/>
 <text text-anchor="start" x="12.5" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Node</text>
 <text text-anchor="middle" x="61.25" y="-216.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; ValueType &gt; &gt;</text>
@@ -97,25 +97,6 @@
 </g>
 <text text-anchor="middle" x="72.12" y="-183.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> next</text>
 </g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="202.12,-97 140.38,-97 140.38,-77.75 202.12,-77.75 202.12,-97"/>
-<text text-anchor="middle" x="171.25" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node5&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M164.84,-66.58C161.19,-57.13 155.99,-45.99 149.25,-37.25 144.04,-30.49 136.77,-24.38 130.39,-19.74"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="161.51,-67.66 168.13,-75.93 168.11,-65.34 161.51,-67.66"/>
-</a>
-</g>
-<text text-anchor="middle" x="172.14" y="-44.62" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> size</text>
-</g>
 </g>
 </svg>
 </svg>
diff --git a/d7/d31/classqueue__coll__graph_org.svg b/d7/d31/classqueue__coll__graph_org.svg
index e10d95332..2ad7cff43 100644
--- a/d7/d31/classqueue__coll__graph_org.svg
+++ b/d7/d31/classqueue__coll__graph_org.svg
@@ -4,23 +4,23 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: queue&lt; ValueType &gt; Pages: 1 -->
-<svg width="210pt" height="249pt"
- viewBox="0.00 0.00 210.12 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="160pt" height="249pt"
+ viewBox="0.00 0.00 160.12 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 <g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
 <title>queue&lt; ValueType &gt;</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="168.88,-19.25 63.62,-19.25 63.62,0 168.88,0 168.88,-19.25"/>
-<text text-anchor="middle" x="116.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue&lt; ValueType &gt;</text>
+<polygon fill="#999999" stroke="#666666" points="113.88,-19.25 8.62,-19.25 8.62,0 113.88,0 113.88,-19.25"/>
+<text text-anchor="middle" x="61.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue&lt; ValueType &gt;</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="122.5,-97 0,-97 0,-77.75 122.5,-77.75 122.5,-97"/>
 <text text-anchor="middle" x="61.25" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Node &gt;</text>
 </a>
@@ -30,12 +30,12 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M74.35,-68.33C85.5,-52.97 101.05,-31.55 109.73,-19.6"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="71.71,-66.01 68.66,-76.16 77.37,-70.13 71.71,-66.01"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M61.25,-66.1C61.25,-50.95 61.25,-30.98 61.25,-19.6"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="57.75,-65.87 61.25,-75.87 64.75,-65.87 57.75,-65.87"/>
 </a>
 </g>
-<text text-anchor="middle" x="122.77" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> queueFront</text>
-<text text-anchor="middle" x="122.77" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">queueRear</text>
+<text text-anchor="middle" x="87.12" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> queueFront</text>
+<text text-anchor="middle" x="87.12" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">queueRear</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
@@ -69,7 +69,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="118,-241.25 4.5,-241.25 4.5,-210.75 118,-210.75 118,-241.25"/>
 <text text-anchor="start" x="12.5" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Node</text>
 <text text-anchor="middle" x="61.25" y="-216.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; ValueType &gt; &gt;</text>
@@ -86,24 +86,5 @@
 </g>
 <text text-anchor="middle" x="72.12" y="-183.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> next</text>
 </g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="202.12,-97 140.38,-97 140.38,-77.75 202.12,-77.75 202.12,-97"/>
-<text text-anchor="middle" x="171.25" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node5&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M164.84,-66.58C161.19,-57.13 155.99,-45.99 149.25,-37.25 144.04,-30.49 136.77,-24.38 130.39,-19.74"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="161.51,-67.66 168.13,-75.93 168.11,-65.34 161.51,-67.66"/>
-</a>
-</g>
-<text text-anchor="middle" x="172.14" y="-44.62" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> size</text>
-</g>
 </g>
 </svg>
diff --git a/d7/d35/matrix__exponentiation_8cpp.html b/d7/d35/matrix__exponentiation_8cpp.html
index 23d0bfe10..ec16ebae1 100644
--- a/d7/d35/matrix__exponentiation_8cpp.html
+++ b/d7/d35/matrix__exponentiation_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/matrix_exponentiation.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/matrix_exponentiation.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for matrix_exponentiation.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d30/matrix__exponentiation_8cpp__incl.svg" width="224" height="111"><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">
+</div>
+<p><a href="../../d7/d35/matrix__exponentiation_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="define-members" name="define-members"></a>
 Macros</h2></td></tr>
 <tr class="memitem:ae1d1ec9482079231e898236e2b23c9ba" id="r_ae1d1ec9482079231e898236e2b23c9ba"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a>&#160;&#160;&#160;int64_t</td></tr>
@@ -130,15 +149,14 @@ Macros</h2></td></tr>
 <tr class="separator:a600eaf353befc174637855795f12d258"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a276c5a0e984cf60015b27252fe04fe6b" id="r_a276c5a0e984cf60015b27252fe04fe6b"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a276c5a0e984cf60015b27252fe04fe6b">pb</a>&#160;&#160;&#160;push_back</td></tr>
 <tr class="separator:a276c5a0e984cf60015b27252fe04fe6b"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aca7d5718ab8c38506adb3bef2469b319" id="r_aca7d5718ab8c38506adb3bef2469b319"><td class="memItemLeft" align="right" valign="top"><a id="aca7d5718ab8c38506adb3bef2469b319" name="aca7d5718ab8c38506adb3bef2469b319"></a>
-#define&#160;</td><td class="memItemRight" valign="bottom"><b>MOD</b>&#160;&#160;&#160;1000000007</td></tr>
+<tr class="memitem:aca7d5718ab8c38506adb3bef2469b319" id="r_aca7d5718ab8c38506adb3bef2469b319"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aca7d5718ab8c38506adb3bef2469b319">MOD</a>&#160;&#160;&#160;1000000007</td></tr>
 <tr class="separator:aca7d5718ab8c38506adb3bef2469b319"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a357cfbebfdc47a237a2862fe146af252" id="r_a357cfbebfdc47a237a2862fe146af252"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a357cfbebfdc47a237a2862fe146af252">multiply</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt; &amp;B)</td></tr>
+<tr class="memitem:a357cfbebfdc47a237a2862fe146af252" id="r_a357cfbebfdc47a237a2862fe146af252"><td class="memItemLeft" align="right" valign="top">vector&lt; vector&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a357cfbebfdc47a237a2862fe146af252">multiply</a> (const vector&lt; vector&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt; &amp;A, const vector&lt; vector&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt; &amp;B)</td></tr>
 <tr class="separator:a357cfbebfdc47a237a2862fe146af252"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a702a9fc90e79b05b863cc4efa26ae2ec" id="r_a702a9fc90e79b05b863cc4efa26ae2ec"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a702a9fc90e79b05b863cc4efa26ae2ec">power</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt; &amp;A, <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> p)</td></tr>
+<tr class="memitem:a702a9fc90e79b05b863cc4efa26ae2ec" id="r_a702a9fc90e79b05b863cc4efa26ae2ec"><td class="memItemLeft" align="right" valign="top">vector&lt; vector&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a702a9fc90e79b05b863cc4efa26ae2ec">power</a> (const vector&lt; vector&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt; &amp;A, <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> p)</td></tr>
 <tr class="separator:a702a9fc90e79b05b863cc4efa26ae2ec"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ad8389ed58fd0ec66df248014775ad1fa" id="r_ad8389ed58fd0ec66df248014775ad1fa"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad8389ed58fd0ec66df248014775ad1fa">ans</a> (<a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> n)</td></tr>
 <tr class="separator:ad8389ed58fd0ec66df248014775ad1fa"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -149,10 +167,9 @@ Functions</h2></td></tr>
 Variables</h2></td></tr>
 <tr class="memitem:a9977ad12548c4a49dee9dc3f0685aa54" id="r_a9977ad12548c4a49dee9dc3f0685aa54"><td class="memItemLeft" align="right" valign="top"><a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a></td></tr>
 <tr class="separator:a9977ad12548c4a49dee9dc3f0685aa54"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a35b7c98af53ad2ec18658679ad7d43de" id="r_a35b7c98af53ad2ec18658679ad7d43de"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a35b7c98af53ad2ec18658679ad7d43de">fib_b</a></td></tr>
+<tr class="memitem:a35b7c98af53ad2ec18658679ad7d43de" id="r_a35b7c98af53ad2ec18658679ad7d43de"><td class="memItemLeft" align="right" valign="top">vector&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a35b7c98af53ad2ec18658679ad7d43de">fib_b</a></td></tr>
 <tr class="separator:a35b7c98af53ad2ec18658679ad7d43de"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0cbd1162483ef7eccd5b947b2e01b1ab" id="r_a0cbd1162483ef7eccd5b947b2e01b1ab"><td class="memItemLeft" align="right" valign="top"><a id="a0cbd1162483ef7eccd5b947b2e01b1ab" name="a0cbd1162483ef7eccd5b947b2e01b1ab"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>fib_c</b></td></tr>
+<tr class="memitem:a0cbd1162483ef7eccd5b947b2e01b1ab" id="r_a0cbd1162483ef7eccd5b947b2e01b1ab"><td class="memItemLeft" align="right" valign="top">vector&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0cbd1162483ef7eccd5b947b2e01b1ab">fib_c</a></td></tr>
 <tr class="separator:a0cbd1162483ef7eccd5b947b2e01b1ab"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -172,6 +189,8 @@ This way you can find the \(10^{18}\) fibonacci numberMOD. I have given a genera
 <li>Multiply with F to get the last matrix of size (1 \(\times\)k).</li>
 </ol>
 <p>The first element of this matrix is the required result. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html">matrix_exponentiation.cpp</a>.</p>
 </div><h2 class="groupheader">Macro Definition Documentation</h2>
 <a id="a600eaf353befc174637855795f12d258" name="a600eaf353befc174637855795f12d258"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a600eaf353befc174637855795f12d258">&#9670;&#160;</a></span>endl</h2>
@@ -184,7 +203,9 @@ This way you can find the \(10^{18}\) fibonacci numberMOD. I have given a genera
         </tr>
       </table>
 </div><div class="memdoc">
-<p>shorthand definition for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></code> </p>
+<p>shorthand definition for <code>std::endl</code> </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html">matrix_exponentiation.cpp</a>.</p>
 
 </div>
 </div>
@@ -201,6 +222,24 @@ This way you can find the \(10^{18}\) fibonacci numberMOD. I have given a genera
 </div><div class="memdoc">
 <p>shorthand definition for <code>int64_t</code> </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html">matrix_exponentiation.cpp</a>.</p>
+
+</div>
+</div>
+<a id="aca7d5718ab8c38506adb3bef2469b319" name="aca7d5718ab8c38506adb3bef2469b319"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aca7d5718ab8c38506adb3bef2469b319">&#9670;&#160;</a></span>MOD</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">#define MOD&#160;&#160;&#160;1000000007</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html">matrix_exponentiation.cpp</a>.</p>
+
 </div>
 </div>
 <a id="a276c5a0e984cf60015b27252fe04fe6b" name="a276c5a0e984cf60015b27252fe04fe6b"></a>
@@ -216,6 +255,8 @@ This way you can find the \(10^{18}\) fibonacci numberMOD. I have given a genera
 </div><div class="memdoc">
 <p>shorthand definition for <code>int64_t</code> </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html">matrix_exponentiation.cpp</a>.</p>
+
 </div>
 </div>
 <h2 class="groupheader">Function Documentation</h2>
@@ -240,17 +281,19 @@ This way you can find the \(10^{18}\) fibonacci numberMOD. I have given a genera
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>\(n^\text{th}\) Fibonacci number </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00091">91</a> of file <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html">matrix_exponentiation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   91</span>             {</div>
 <div class="line"><span class="lineno">   92</span>    <span class="keywordflow">if</span> (n == 0)</div>
 <div class="line"><span class="lineno">   93</span>        <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   94</span>    <span class="keywordflow">if</span> (n &lt;= <a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>)</div>
 <div class="line"><span class="lineno">   95</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="#a35b7c98af53ad2ec18658679ad7d43de">fib_b</a>[n - 1];</div>
 <div class="line"><span class="lineno">   96</span>    <span class="comment">// F1</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">vector&lt;ll&gt;</a> F1(<a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> + 1);</div>
+<div class="line"><span class="lineno">   97</span>    vector&lt;ll&gt; F1(<a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> + 1);</div>
 <div class="line"><span class="lineno">   98</span>    <span class="keywordflow">for</span> (ll i = 1; i &lt;= <a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) F1[i] = <a class="code hl_variable" href="#a35b7c98af53ad2ec18658679ad7d43de">fib_b</a>[i - 1];</div>
 <div class="line"><span class="lineno">   99</span> </div>
 <div class="line"><span class="lineno">  100</span>    <span class="comment">// Transpose matrix</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">vector&lt;vector&lt;ll&gt;</a>&gt; T(<a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> + 1, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;ll&gt;</a>(<a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> + 1));</div>
+<div class="line"><span class="lineno">  101</span>    vector&lt;vector&lt;ll&gt;&gt; T(<a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> + 1, vector&lt;ll&gt;(<a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> + 1));</div>
 <div class="line"><span class="lineno">  102</span>    <span class="keywordflow">for</span> (ll i = 1; i &lt;= <a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) {</div>
 <div class="line"><span class="lineno">  103</span>        <span class="keywordflow">for</span> (ll j = 1; j &lt;= <a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; j++) {</div>
 <div class="line"><span class="lineno">  104</span>            <span class="keywordflow">if</span> (i &lt; <a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>) {</div>
@@ -273,16 +316,10 @@ This way you can find the \(10^{18}\) fibonacci numberMOD. I have given a genera
 <div class="line"><span class="lineno">  121</span>    }</div>
 <div class="line"><span class="lineno">  122</span>    <span class="keywordflow">return</span> res;</div>
 <div class="line"><span class="lineno">  123</span>}</div>
-<div class="ttc" id="amatrix__exponentiation_8cpp_html_a35b7c98af53ad2ec18658679ad7d43de"><div class="ttname"><a href="#a35b7c98af53ad2ec18658679ad7d43de">fib_b</a></div><div class="ttdeci">vector&lt; ll &gt; fib_b</div><div class="ttdef"><b>Definition</b> matrix_exponentiation.cpp:50</div></div>
-<div class="ttc" id="amatrix__exponentiation_8cpp_html_a702a9fc90e79b05b863cc4efa26ae2ec"><div class="ttname"><a href="#a702a9fc90e79b05b863cc4efa26ae2ec">power</a></div><div class="ttdeci">vector&lt; vector&lt; ll &gt; &gt; power(const vector&lt; vector&lt; ll &gt; &gt; &amp;A, ll p)</div><div class="ttdef"><b>Definition</b> matrix_exponentiation.cpp:76</div></div>
-<div class="ttc" id="amatrix__exponentiation_8cpp_html_a9977ad12548c4a49dee9dc3f0685aa54"><div class="ttname"><a href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a></div><div class="ttdeci">ll mat_size</div><div class="ttdef"><b>Definition</b> matrix_exponentiation.cpp:45</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d35/matrix__exponentiation_8cpp_ad8389ed58fd0ec66df248014775ad1fa_cgraph.svg" width="272" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a35b7c98af53ad2ec18658679ad7d43de"><div class="ttname"><a href="#a35b7c98af53ad2ec18658679ad7d43de">fib_b</a></div><div class="ttdeci">vector&lt; ll &gt; fib_b</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00050">matrix_exponentiation.cpp:50</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a702a9fc90e79b05b863cc4efa26ae2ec"><div class="ttname"><a href="#a702a9fc90e79b05b863cc4efa26ae2ec">power</a></div><div class="ttdeci">vector&lt; vector&lt; ll &gt; &gt; power(const vector&lt; vector&lt; ll &gt; &gt; &amp;A, ll p)</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00076">matrix_exponentiation.cpp:76</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a9977ad12548c4a49dee9dc3f0685aa54"><div class="ttname"><a href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a></div><div class="ttdeci">ll mat_size</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00045">matrix_exponentiation.cpp:45</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -300,32 +337,32 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00126">126</a> of file <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html">matrix_exponentiation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  126</span>           {</div>
-<div class="line"><span class="lineno">  127</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">cin</a>.tie(0);</div>
-<div class="line"><span class="lineno">  128</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a>.tie(0);</div>
+<div class="line"><span class="lineno">  127</span>    cin.tie(0);</div>
+<div class="line"><span class="lineno">  128</span>    cout.tie(0);</div>
 <div class="line"><span class="lineno">  129</span>    ll t;</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_istream.html">cin</a> &gt;&gt; t;</div>
+<div class="line"><span class="lineno">  130</span>    cin &gt;&gt; t;</div>
 <div class="line"><span class="lineno">  131</span>    ll i, j, x;</div>
 <div class="line"><span class="lineno">  132</span>    <span class="keywordflow">while</span> (t--) {</div>
-<div class="line"><span class="lineno">  133</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">cin</a> &gt;&gt; <a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>;</div>
+<div class="line"><span class="lineno">  133</span>        cin &gt;&gt; <a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>;</div>
 <div class="line"><span class="lineno">  134</span>        <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) {</div>
-<div class="line"><span class="lineno">  135</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">cin</a> &gt;&gt; x;</div>
+<div class="line"><span class="lineno">  135</span>            cin &gt;&gt; x;</div>
 <div class="line"><span class="lineno">  136</span>            <a class="code hl_variable" href="#a35b7c98af53ad2ec18658679ad7d43de">fib_b</a>.pb(x);</div>
 <div class="line"><span class="lineno">  137</span>        }</div>
 <div class="line"><span class="lineno">  138</span>        <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) {</div>
-<div class="line"><span class="lineno">  139</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">cin</a> &gt;&gt; x;</div>
+<div class="line"><span class="lineno">  139</span>            cin &gt;&gt; x;</div>
 <div class="line"><span class="lineno">  140</span>            fib_c.pb(x);</div>
 <div class="line"><span class="lineno">  141</span>        }</div>
-<div class="line"><span class="lineno">  142</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">cin</a> &gt;&gt; x;</div>
-<div class="line"><span class="lineno">  143</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; ans(x) &lt;&lt; <a class="code hl_define" href="#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><span class="lineno">  142</span>        cin &gt;&gt; x;</div>
+<div class="line"><span class="lineno">  143</span>        cout &lt;&lt; ans(x) &lt;&lt; <a class="code hl_define" href="#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">  144</span>        <a class="code hl_variable" href="#a35b7c98af53ad2ec18658679ad7d43de">fib_b</a>.clear();</div>
 <div class="line"><span class="lineno">  145</span>        fib_c.clear();</div>
 <div class="line"><span class="lineno">  146</span>    }</div>
 <div class="line"><span class="lineno">  147</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  148</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> matrix_exponentiation.cpp:36</div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -336,14 +373,14 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt; multiply </td>
+          <td class="memname">vector&lt; vector&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt; multiply </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">const vector&lt; vector&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
+          <td class="paramtype">const vector&lt; vector&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -357,8 +394,10 @@ Here is the call graph for this function:</div>
 </dl>
 <dl class="section note"><dt>Note</dt><dd>\(p=n\) </dd></dl>
 <dl class="section return"><dt>Returns</dt><dd>matrix of dimension (m \(\times\)q) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html">matrix_exponentiation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   58</span>                                                         {</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">vector&lt;vector&lt;ll&gt;</a>&gt; C(<a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> + 1, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;ll&gt;</a>(<a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> + 1));</div>
+<div class="line"><span class="lineno">   59</span>    vector&lt;vector&lt;ll&gt;&gt; C(<a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> + 1, vector&lt;ll&gt;(<a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> + 1));</div>
 <div class="line"><span class="lineno">   60</span>    <span class="keywordflow">for</span> (ll i = 1; i &lt;= <a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) {</div>
 <div class="line"><span class="lineno">   61</span>        <span class="keywordflow">for</span> (ll j = 1; j &lt;= <a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; j++) {</div>
 <div class="line"><span class="lineno">   62</span>            <span class="keywordflow">for</span> (ll z = 1; z &lt;= <a class="code hl_variable" href="#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; z++) {</div>
@@ -378,9 +417,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt; power </td>
+          <td class="memname">vector&lt; vector&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt; power </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">const vector&lt; vector&lt; <a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a> &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -398,23 +437,20 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>matrix of same dimension as A </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00076">76</a> of file <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html">matrix_exponentiation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   76</span>                                                            {</div>
 <div class="line"><span class="lineno">   77</span>    <span class="keywordflow">if</span> (p == 1)</div>
 <div class="line"><span class="lineno">   78</span>        <span class="keywordflow">return</span> A;</div>
 <div class="line"><span class="lineno">   79</span>    <span class="keywordflow">if</span> (p % 2 == 1) {</div>
 <div class="line"><span class="lineno">   80</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a357cfbebfdc47a237a2862fe146af252">multiply</a>(A, <a class="code hl_function" href="#a702a9fc90e79b05b863cc4efa26ae2ec">power</a>(A, p - 1));</div>
 <div class="line"><span class="lineno">   81</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   82</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;vector&lt;ll&gt;</a>&gt; X = <a class="code hl_function" href="#a702a9fc90e79b05b863cc4efa26ae2ec">power</a>(A, p / 2);</div>
+<div class="line"><span class="lineno">   82</span>        vector&lt;vector&lt;ll&gt;&gt; X = <a class="code hl_function" href="#a702a9fc90e79b05b863cc4efa26ae2ec">power</a>(A, p / 2);</div>
 <div class="line"><span class="lineno">   83</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a357cfbebfdc47a237a2862fe146af252">multiply</a>(X, X);</div>
 <div class="line"><span class="lineno">   84</span>    }</div>
 <div class="line"><span class="lineno">   85</span>}</div>
-<div class="ttc" id="amatrix__exponentiation_8cpp_html_a357cfbebfdc47a237a2862fe146af252"><div class="ttname"><a href="#a357cfbebfdc47a237a2862fe146af252">multiply</a></div><div class="ttdeci">vector&lt; vector&lt; ll &gt; &gt; multiply(const vector&lt; vector&lt; ll &gt; &gt; &amp;A, const vector&lt; vector&lt; ll &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> matrix_exponentiation.cpp:57</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d35/matrix__exponentiation_8cpp_a702a9fc90e79b05b863cc4efa26ae2ec_cgraph.svg" width="182" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a357cfbebfdc47a237a2862fe146af252"><div class="ttname"><a href="#a357cfbebfdc47a237a2862fe146af252">multiply</a></div><div class="ttdeci">vector&lt; vector&lt; ll &gt; &gt; multiply(const vector&lt; vector&lt; ll &gt; &gt; &amp;A, const vector&lt; vector&lt; ll &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00057">matrix_exponentiation.cpp:57</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Variable Documentation</h2>
@@ -425,12 +461,30 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt;<a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a>&gt; fib_b</td>
+          <td class="memname">vector&lt;<a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a>&gt; fib_b</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>global vector variables used in the <a class="el" href="#ad8389ed58fd0ec66df248014775ad1fa">ans</a> function. </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000008">Todo</a></b></dt><dd>@stepfencurryxiao add documetnation </dd></dl>
 
+<p class="definition">Definition at line <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00050">50</a> of file <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html">matrix_exponentiation.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a0cbd1162483ef7eccd5b947b2e01b1ab" name="a0cbd1162483ef7eccd5b947b2e01b1ab"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a0cbd1162483ef7eccd5b947b2e01b1ab">&#9670;&#160;</a></span>fib_c</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">vector&lt;<a class="el" href="#ae1d1ec9482079231e898236e2b23c9ba">ll</a>&gt; fib_c</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00050">50</a> of file <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html">matrix_exponentiation.cpp</a>.</p>
+
 </div>
 </div>
 <a id="a9977ad12548c4a49dee9dc3f0685aa54" name="a9977ad12548c4a49dee9dc3f0685aa54"></a>
@@ -446,6 +500,8 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 <p>global variable mat_size </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000007">Todo</a></b></dt><dd>@stepfencurryxiao add documetnation </dd></dl>
 
+<p class="definition">Definition at line <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00045">45</a> of file <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp_source.html">matrix_exponentiation.cpp</a>.</p>
+
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d7/d35/matrix__exponentiation_8cpp_a702a9fc90e79b05b863cc4efa26ae2ec_cgraph.map b/d7/d35/matrix__exponentiation_8cpp_a702a9fc90e79b05b863cc4efa26ae2ec_cgraph.map
deleted file mode 100644
index e01c434b7..000000000
--- a/d7/d35/matrix__exponentiation_8cpp_a702a9fc90e79b05b863cc4efa26ae2ec_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="power" name="power">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,62,55"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="14,30,10,21,13,11,21,5,34,3,47,5,55,12,51,16,45,10,33,8,23,10,17,14,16,20,19,28"/>
-<area shape="rect" id="Node000002" href="$d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252" title=" " alt="" coords="110,29,176,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="62,40,94,40,94,45,62,45"/>
-</map>
diff --git a/d7/d35/matrix__exponentiation_8cpp_a702a9fc90e79b05b863cc4efa26ae2ec_cgraph.md5 b/d7/d35/matrix__exponentiation_8cpp_a702a9fc90e79b05b863cc4efa26ae2ec_cgraph.md5
deleted file mode 100644
index c067cb56d..000000000
--- a/d7/d35/matrix__exponentiation_8cpp_a702a9fc90e79b05b863cc4efa26ae2ec_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-65ddbcc1d4d01a612f5db988fa1562c7
\ No newline at end of file
diff --git a/d7/d35/matrix__exponentiation_8cpp_a702a9fc90e79b05b863cc4efa26ae2ec_cgraph.svg b/d7/d35/matrix__exponentiation_8cpp_a702a9fc90e79b05b863cc4efa26ae2ec_cgraph.svg
deleted file mode 100644
index a94d6e344..000000000
--- a/d7/d35/matrix__exponentiation_8cpp_a702a9fc90e79b05b863cc4efa26ae2ec_cgraph.svg
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: power Pages: 1 -->
-<svg width="136pt" height="45pt"
- viewBox="0.00 0.00 136.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>power</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="42.25,-19.25 0,-19.25 0,0 42.25,0 42.25,-19.25"/>
-<text text-anchor="middle" x="21.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M8.29,-19.54C2.43,-28.15 6.71,-37.25 21.12,-37.25 29.01,-37.25 33.86,-34.53 35.68,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="39.18,-30.38 34.19,-21.03 32.26,-31.45 39.18,-30.38"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="128,-19.25 78.25,-19.25 78.25,0 128,0 128,-19.25"/>
-<text text-anchor="middle" x="103.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.73,-9.62C50.03,-9.62 58.46,-9.62 66.65,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.38,-13.13 76.38,-9.63 66.38,-6.13 66.38,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d35/matrix__exponentiation_8cpp_a702a9fc90e79b05b863cc4efa26ae2ec_cgraph_org.svg b/d7/d35/matrix__exponentiation_8cpp_a702a9fc90e79b05b863cc4efa26ae2ec_cgraph_org.svg
deleted file mode 100644
index 1f256d879..000000000
--- a/d7/d35/matrix__exponentiation_8cpp_a702a9fc90e79b05b863cc4efa26ae2ec_cgraph_org.svg
+++ /dev/null
@@ -1,48 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: power Pages: 1 -->
-<svg width="136pt" height="45pt"
- viewBox="0.00 0.00 136.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>power</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="42.25,-19.25 0,-19.25 0,0 42.25,0 42.25,-19.25"/>
-<text text-anchor="middle" x="21.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M8.29,-19.54C2.43,-28.15 6.71,-37.25 21.12,-37.25 29.01,-37.25 33.86,-34.53 35.68,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="39.18,-30.38 34.19,-21.03 32.26,-31.45 39.18,-30.38"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="128,-19.25 78.25,-19.25 78.25,0 128,0 128,-19.25"/>
-<text text-anchor="middle" x="103.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.73,-9.62C50.03,-9.62 58.46,-9.62 66.65,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.38,-13.13 76.38,-9.63 66.38,-6.13 66.38,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d35/matrix__exponentiation_8cpp_ad8389ed58fd0ec66df248014775ad1fa_cgraph.map b/d7/d35/matrix__exponentiation_8cpp_ad8389ed58fd0ec66df248014775ad1fa_cgraph.map
deleted file mode 100644
index 779bc0003..000000000
--- a/d7/d35/matrix__exponentiation_8cpp_ad8389ed58fd0ec66df248014775ad1fa_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="ans" name="ans">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,48,55"/>
-<area shape="rect" id="Node000002" href="$d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec" title=" " alt="" coords="96,29,152,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,40,80,40,80,45,48,45"/>
-<area shape="poly" id="edge3_Node000002_Node000002" title=" " alt="" coords="106,30,103,21,105,12,112,5,124,3,136,5,143,12,139,16,134,10,124,8,114,10,110,14,108,20,111,28"/>
-<area shape="rect" id="Node000003" href="$d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252" title=" " alt="" coords="200,29,266,55"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,40,185,40,185,45,153,45"/>
-</map>
diff --git a/d7/d35/matrix__exponentiation_8cpp_ad8389ed58fd0ec66df248014775ad1fa_cgraph.md5 b/d7/d35/matrix__exponentiation_8cpp_ad8389ed58fd0ec66df248014775ad1fa_cgraph.md5
deleted file mode 100644
index 2eac9fefb..000000000
--- a/d7/d35/matrix__exponentiation_8cpp_ad8389ed58fd0ec66df248014775ad1fa_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3212ee3797216d0e85687aead969692d
\ No newline at end of file
diff --git a/d7/d35/matrix__exponentiation_8cpp_ad8389ed58fd0ec66df248014775ad1fa_cgraph.svg b/d7/d35/matrix__exponentiation_8cpp_ad8389ed58fd0ec66df248014775ad1fa_cgraph.svg
deleted file mode 100644
index 37630d58c..000000000
--- a/d7/d35/matrix__exponentiation_8cpp_ad8389ed58fd0ec66df248014775ad1fa_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ans Pages: 1 -->
-<svg width="204pt" height="45pt"
- viewBox="0.00 0.00 203.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>ans</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="31.75,-19.25 0,-19.25 0,0 31.75,0 31.75,-19.25"/>
-<text text-anchor="middle" x="15.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ans</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110,-19.25 67.75,-19.25 67.75,0 110,0 110,-19.25"/>
-<text text-anchor="middle" x="88.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.93,-9.62C38.96,-9.62 47.61,-9.62 55.99,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="55.94,-13.13 65.94,-9.63 55.94,-6.13 55.94,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.45,-19.54C72.23,-28.15 76.04,-37.25 88.88,-37.25 95.89,-37.25 100.21,-34.53 101.83,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.34,-30.47 100.51,-21.04 98.41,-31.42 105.34,-30.47"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.75,-19.25 146,-19.25 146,0 195.75,0 195.75,-19.25"/>
-<text text-anchor="middle" x="170.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.48,-9.62C117.78,-9.62 126.21,-9.62 134.4,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.13,-13.13 144.13,-9.63 134.13,-6.13 134.13,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d35/matrix__exponentiation_8cpp_ad8389ed58fd0ec66df248014775ad1fa_cgraph_org.svg b/d7/d35/matrix__exponentiation_8cpp_ad8389ed58fd0ec66df248014775ad1fa_cgraph_org.svg
deleted file mode 100644
index aa4516d7f..000000000
--- a/d7/d35/matrix__exponentiation_8cpp_ad8389ed58fd0ec66df248014775ad1fa_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ans Pages: 1 -->
-<svg width="204pt" height="45pt"
- viewBox="0.00 0.00 203.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>ans</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="31.75,-19.25 0,-19.25 0,0 31.75,0 31.75,-19.25"/>
-<text text-anchor="middle" x="15.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ans</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110,-19.25 67.75,-19.25 67.75,0 110,0 110,-19.25"/>
-<text text-anchor="middle" x="88.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.93,-9.62C38.96,-9.62 47.61,-9.62 55.99,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="55.94,-13.13 65.94,-9.63 55.94,-6.13 55.94,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.45,-19.54C72.23,-28.15 76.04,-37.25 88.88,-37.25 95.89,-37.25 100.21,-34.53 101.83,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.34,-30.47 100.51,-21.04 98.41,-31.42 105.34,-30.47"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.75,-19.25 146,-19.25 146,0 195.75,0 195.75,-19.25"/>
-<text text-anchor="middle" x="170.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.48,-9.62C117.78,-9.62 126.21,-9.62 134.4,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.13,-13.13 144.13,-9.63 134.13,-6.13 134.13,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d35/matrix__exponentiation_8cpp_source.html b/d7/d35/matrix__exponentiation_8cpp_source.html
new file mode 100644
index 000000000..0d815283e
--- /dev/null
+++ b/d7/d35/matrix__exponentiation_8cpp_source.html
@@ -0,0 +1,251 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/matrix_exponentiation.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/d35/matrix__exponentiation_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">matrix_exponentiation.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d7/d35/matrix__exponentiation_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">using </span>std::cin;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">using </span>std::cout;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keyword">using </span>std::vector;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../d7/d35/matrix__exponentiation_8cpp.html#ae1d1ec9482079231e898236e2b23c9ba">   33</a></span><span class="preprocessor">#define ll int64_t</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">   36</a></span><span class="preprocessor">#define endl std::endl</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../d7/d35/matrix__exponentiation_8cpp.html#a276c5a0e984cf60015b27252fe04fe6b">   39</a></span><span class="preprocessor">#define pb push_back</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="preprocessor">#define MOD 1000000007</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">   45</a></span>ll <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"><a class="line" href="../../d7/d35/matrix__exponentiation_8cpp.html#a35b7c98af53ad2ec18658679ad7d43de">   50</a></span>vector&lt;ll&gt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a35b7c98af53ad2ec18658679ad7d43de">fib_b</a>, fib_c;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="foldopen" id="foldopen00057" data-start="{" data-end="}">
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="../../d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252">   57</a></span>vector&lt;vector&lt;ll&gt;&gt; <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252">multiply</a>(<span class="keyword">const</span> vector&lt;vector&lt;ll&gt;&gt; &amp;A,</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>                            <span class="keyword">const</span> vector&lt;vector&lt;ll&gt;&gt; &amp;B) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    vector&lt;vector&lt;ll&gt;&gt; C(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> + 1, vector&lt;ll&gt;(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> + 1));</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">for</span> (ll i = 1; i &lt;= <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="keywordflow">for</span> (ll j = 1; j &lt;= <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; j++) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            <span class="keywordflow">for</span> (ll z = 1; z &lt;= <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; z++) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>                C[i][j] = (C[i][j] + (A[i][z] * B[z][j]) % MOD) % MOD;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">return</span> C;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>}</div>
+</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="foldopen" id="foldopen00076" data-start="{" data-end="}">
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"><a class="line" href="../../d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec">   76</a></span>vector&lt;vector&lt;ll&gt;&gt; <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec">power</a>(<span class="keyword">const</span> vector&lt;vector&lt;ll&gt;&gt; &amp;A, ll p) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="keywordflow">if</span> (p == 1)</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        <span class="keywordflow">return</span> A;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keywordflow">if</span> (p % 2 == 1) {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252">multiply</a>(A, <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec">power</a>(A, p - 1));</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        vector&lt;vector&lt;ll&gt;&gt; X = <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec">power</a>(A, p / 2);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252">multiply</a>(X, X);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    }</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>}</div>
+</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="foldopen" id="foldopen00091" data-start="{" data-end="}">
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"><a class="line" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">   91</a></span>ll ans(ll n) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keywordflow">if</span> (n == 0)</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keywordflow">if</span> (n &lt;= <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>)</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a35b7c98af53ad2ec18658679ad7d43de">fib_b</a>[n - 1];</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="comment">// F1</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    vector&lt;ll&gt; F1(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> + 1);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keywordflow">for</span> (ll i = 1; i &lt;= <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) F1[i] = <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a35b7c98af53ad2ec18658679ad7d43de">fib_b</a>[i - 1];</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="comment">// Transpose matrix</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    vector&lt;vector&lt;ll&gt;&gt; T(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> + 1, vector&lt;ll&gt;(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> + 1));</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="keywordflow">for</span> (ll i = 1; i &lt;= <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        <span class="keywordflow">for</span> (ll j = 1; j &lt;= <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; j++) {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>            <span class="keywordflow">if</span> (i &lt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>) {</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>                <span class="keywordflow">if</span> (j == i + 1)</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>                    T[i][j] = 1;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>                <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>                    T[i][j] = 0;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>                <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>            }</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>            T[i][j] = fib_c[<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> - j];</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        }</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    }</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="comment">// T^n-1</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    T = <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec">power</a>(T, n - 1);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="comment">// T*F1</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    ll res = 0;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <span class="keywordflow">for</span> (ll i = 1; i &lt;= <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        res = (res + (T[1][i] * F1[i]) % MOD) % MOD;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    }</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="keywordflow">return</span> res;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>}</div>
+</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
+<div class="foldopen" id="foldopen00126" data-start="{" data-end="}">
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"><a class="line" href="../../d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  126</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    cin.tie(0);</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    cout.tie(0);</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    ll t;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    cin &gt;&gt; t;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    ll i, j, x;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="keywordflow">while</span> (t--) {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        cin &gt;&gt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>        <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) {</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>            cin &gt;&gt; x;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>            <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a35b7c98af53ad2ec18658679ad7d43de">fib_b</a>.pb(x);</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        }</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>        <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>            cin &gt;&gt; x;</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>            fib_c.pb(x);</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        }</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        cin &gt;&gt; x;</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        cout &lt;&lt; ans(x) &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a35b7c98af53ad2ec18658679ad7d43de">fib_b</a>.clear();</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        fib_c.clear();</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    }</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>}</div>
+</div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a357cfbebfdc47a237a2862fe146af252"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252">multiply</a></div><div class="ttdeci">vector&lt; vector&lt; ll &gt; &gt; multiply(const vector&lt; vector&lt; ll &gt; &gt; &amp;A, const vector&lt; vector&lt; ll &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> <a href="#l00057">matrix_exponentiation.cpp:57</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a35b7c98af53ad2ec18658679ad7d43de"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a35b7c98af53ad2ec18658679ad7d43de">fib_b</a></div><div class="ttdeci">vector&lt; ll &gt; fib_b</div><div class="ttdef"><b>Definition</b> <a href="#l00050">matrix_exponentiation.cpp:50</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="#l00036">matrix_exponentiation.cpp:36</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a702a9fc90e79b05b863cc4efa26ae2ec"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec">power</a></div><div class="ttdeci">vector&lt; vector&lt; ll &gt; &gt; power(const vector&lt; vector&lt; ll &gt; &gt; &amp;A, ll p)</div><div class="ttdef"><b>Definition</b> <a href="#l00076">matrix_exponentiation.cpp:76</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a9977ad12548c4a49dee9dc3f0685aa54"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a></div><div class="ttdeci">ll mat_size</div><div class="ttdef"><b>Definition</b> <a href="#l00045">matrix_exponentiation.cpp:45</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00126">matrix_exponentiation.cpp:126</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../d7/d35/matrix__exponentiation_8cpp.html">matrix_exponentiation.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/d37/magic__sequence_8cpp_source.html b/d7/d37/magic__sequence_8cpp_source.html
new file mode 100644
index 000000000..8d0cf8b71
--- /dev/null
+++ b/d7/d37/magic__sequence_8cpp_source.html
@@ -0,0 +1,237 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: backtracking/magic_sequence.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/d37/magic__sequence_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">magic_sequence.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * @brief [Magic sequence](https://www.csplib.org/Problems/prob019/)</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * implementation</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * @details Solve the magic sequence problem with backtracking</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> * &quot;A magic sequence of length $n$ is a sequence of integers $x_0</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> * \ldots x_{n-1}$ between $0$ and $n-1$, such that for all $i$</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> * in $0$ to $n-1$, the number $i$ occurs exactly $x_i$ times in</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment"> * the sequence. For instance, $6,2,1,0,0,0,1,0,0,0$ is a magic</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment"> * sequence since $0$ occurs $6$ times in it, $1$ occurs twice, etc.&quot;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment"> * Quote taken from the [CSPLib](https://www.csplib.org/Problems/prob019/)</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment"> * website</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment"> * @author [Jxtopher](https://github.com/Jxtopher)</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;list&gt;</span>       </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;numeric&gt;</span>    </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../db/dc0/namespacebacktracking.html">backtracking</a> {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d93/namespacemagic__sequence.html">magic_sequence</a> {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="keyword">using </span>sequence_t =</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    std::vector&lt;unsigned int&gt;;  </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="keywordtype">void</span> print(<span class="keyword">const</span> sequence_t&amp; s) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; item : s) std::cout &lt;&lt; item &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>}</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="keywordtype">bool</span> is_magic(<span class="keyword">const</span> sequence_t&amp; s) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i &lt; s.size(); i++) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="keywordflow">if</span> (std::count(s.cbegin(), s.cend(), i) != s[i]) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        }</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>}</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="keywordtype">bool</span> filtering(<span class="keyword">const</span> sequence_t&amp; s, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> depth) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keywordflow">return</span> std::accumulate(s.cbegin(), s.cbegin() + depth,</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>                           <span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">&gt;</span>(0)) &lt;= s.size();</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>}</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9">solve</a>(sequence_t* s, std::list&lt;sequence_t&gt;* ret, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> depth = 0) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keywordflow">if</span> (depth == s-&gt;size()) {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <span class="keywordflow">if</span> (is_magic(*s)) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            ret-&gt;push_back(*s);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        }</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i &lt; s-&gt;size(); i++) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            (*s)[depth] = i;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>            <span class="keywordflow">if</span> (filtering(*s, depth + 1)) {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>                <a class="code hl_function" href="../../d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9">solve</a>(s, ret, depth + 1);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>            }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        }</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    }</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>}</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>}  <span class="comment">// namespace magic_sequence</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>}  <span class="comment">// namespace backtracking</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span><span class="keyword">static</span> <span class="keywordtype">void</span> test() {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="comment">// test a valid magic sequence</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    backtracking::magic_sequence::sequence_t s_magic = {6, 2, 1, 0, 0,</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>                                                        0, 1, 0, 0, 0};</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    assert(backtracking::magic_sequence::is_magic(s_magic));</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="comment">// test a non-valid magic sequence</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    backtracking::magic_sequence::sequence_t s_not_magic = {5, 2, 1, 0, 0,</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>                                                            0, 1, 0, 0, 0};</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    assert(!backtracking::magic_sequence::is_magic(s_not_magic));</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>}</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    test();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="comment">// solve magic sequences of size 2 to 11 and print the solutions</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 2; i &lt; 12; i++) {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Solution for n = &quot;</span> &lt;&lt; i &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        <span class="comment">// valid magic sequence list</span></div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        std::list&lt;backtracking::magic_sequence::sequence_t&gt; list_of_solutions;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        <span class="comment">// initialization of a sequence</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        backtracking::magic_sequence::sequence_t s1(i, i);</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        <span class="comment">// launch of solving the problem</span></div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        backtracking::magic_sequence::solve(&amp;s1, &amp;list_of_solutions);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        <span class="comment">// print solutions</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; item : list_of_solutions) {</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>            backtracking::magic_sequence::print(item);</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        }</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    }</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="aknight__tour_8cpp_html_aaa47356d98676cf5315d978f741e29c9"><div class="ttname"><a href="../../d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9">backtracking::knight_tour::solve</a></div><div class="ttdeci">bool solve(int x, int y, int mov, std::array&lt; std::array&lt; int, V &gt;, V &gt; &amp;sol, const std::array&lt; int, V &gt; &amp;xmov, std::array&lt; int, V &gt; &amp;ymov)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d2a/knight__tour_8cpp_source.html#l00057">knight_tour.cpp:57</a></div></div>
+<div class="ttc" id="anamespacebacktracking_html"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html">backtracking</a></div><div class="ttdoc">for vector container</div></div>
+<div class="ttc" id="anamespacemagic__sequence_html"><div class="ttname"><a href="../../d8/d93/namespacemagic__sequence.html">magic_sequence</a></div><div class="ttdoc">Functions for the Magic sequence implementation.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><b>magic_sequence.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html b/d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html
new file mode 100644
index 000000000..d7bfd0469
--- /dev/null
+++ b/d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html
@@ -0,0 +1,224 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/bridge_finding_with_tarjan_algorithm.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">bridge_finding_with_tarjan_algorithm.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> *  Copyright : 2020 , MIT</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> *  Author : Amit Kumar (offamitkumar)</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> *  Last Modified Date: May 24, 2020</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  <span class="comment">//  for min &amp; max</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;iostream&gt;</span>   <span class="comment">//  for cout</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;vector&gt;</span>     <span class="comment">//  for std::vector</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="foldopen" id="foldopen00011" data-start="{" data-end="};">
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"><a class="line" href="../../dd/d4f/class_solution.html">   11</a></span><span class="keyword">class </span><a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a> {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    std::vector&lt;std::vector&lt;int&gt;&gt; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>;</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    std::vector&lt;int&gt; in_time, out_time;</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordtype">int</span> timer = 0;</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    std::vector&lt;std::vector&lt;int&gt;&gt; bridge;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    std::vector&lt;bool&gt; visited;</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="keywordtype">void</span> dfs(<span class="keywordtype">int</span> current_node, <span class="keywordtype">int</span> parent) {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        visited.at(current_node) = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        in_time[current_node] = out_time[current_node] = timer++;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; itr : <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[current_node]) {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>            <span class="keywordflow">if</span> (itr == parent) {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>                <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>            }</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>            <span class="keywordflow">if</span> (!visited[itr]) {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>                dfs(itr, current_node);</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>                <span class="keywordflow">if</span> (out_time[itr] &gt; in_time[current_node]) {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>                    bridge.push_back({itr, current_node});</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>                }</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>            }</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>            out_time[current_node] =</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>                std::min(out_time[current_node], out_time[itr]);</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        }</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    }</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    std::vector&lt;std::vector&lt;int&gt;&gt; search_bridges(</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        <span class="keywordtype">int</span> n, <span class="keyword">const</span> std::vector&lt;std::vector&lt;int&gt;&gt;&amp; connections) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        timer = 0;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.resize(n);</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        in_time.assign(n, 0);</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        visited.assign(n, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        out_time.assign(n, 0);</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; itr : connections) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>            <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.at(itr[0]).push_back(itr[1]);</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>            <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.at(itr[1]).push_back(itr[0]);</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        }</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        dfs(0, -1);</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="keywordflow">return</span> bridge;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>};</div>
+</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a> s1;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordtype">int</span> number_of_node = 5;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    std::vector&lt;std::vector&lt;int&gt;&gt; <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>.push_back({0, 1});</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>.push_back({1, 3});</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>.push_back({1, 2});</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>.push_back({2, 4});</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="comment">/*</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span><span class="comment">     *     0 &lt;--&gt; 1 &lt;---&gt; 2</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="comment">     *            ^       ^</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="comment">     *            |       |</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="comment">     *            |       |</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span><span class="comment">     *            \/     \/</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="comment">     *            3       4</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="comment">     *    In this graph there are 4 bridges [0,2] , [2,4] , [3,5] , [1,2]</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span><span class="comment">     *    I assumed that the graph is bi-directional and connected.</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    std::vector&lt;std::vector&lt;int&gt;&gt; bridges =</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        s1.search_bridges(number_of_node, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    std::cout &lt;&lt; bridges.size() &lt;&lt; <span class="stringliteral">&quot; bridges found!\n&quot;</span>;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; itr : bridges) {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        std::cout &lt;&lt; itr[0] &lt;&lt; <span class="stringliteral">&quot; --&gt; &quot;</span> &lt;&lt; itr[1] &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    }</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>}</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="aclass_solution_html"><div class="ttname"><a href="../../dd/d4f/class_solution.html">Solution</a></div><div class="ttdef"><b>Definition</b> <a href="#l00011">bridge_finding_with_tarjan_algorithm.cpp:11</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></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 class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><b>bridge_finding_with_tarjan_algorithm.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/d3f/namespacetravelling_salesman__bitmanipulation.html b/d7/d3f/namespacetravelling_salesman__bitmanipulation.html
index d61aebefc..bf5da499f 100644
--- a/d7/d3f/namespacetravelling_salesman__bitmanipulation.html
+++ b/d7/d3f/namespacetravelling_salesman__bitmanipulation.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: travellingSalesman_bitmanipulation Namespace Reference</title>
+<title>TheAlgorithms/C++: travellingSalesman_bitmanipulation Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d7/d40/class_solution__coll__graph.map b/d7/d40/class_solution__coll__graph.map
index 7fb3a5ca3..b15317252 100644
--- a/d7/d40/class_solution__coll__graph.map
+++ b/d7/d40/class_solution__coll__graph.map
@@ -1,9 +1,9 @@
 <map id="Solution" name="Solution">
 <area shape="rect" id="Node000001" title=" " alt="" coords="214,124,282,150"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="5,5,163,46"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,5,163,46"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="128,53,231,121,228,126,125,57"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="187,13,309,38"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="187,13,309,38"/>
 <area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="251,54,251,124,245,124,245,54"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="333,13,464,38"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="333,13,464,38"/>
 <area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="374,50,306,102,269,126,267,121,302,98,371,46"/>
 </map>
diff --git a/d7/d40/class_solution__coll__graph.md5 b/d7/d40/class_solution__coll__graph.md5
index 11eb31d24..eda9d2f03 100644
--- a/d7/d40/class_solution__coll__graph.md5
+++ b/d7/d40/class_solution__coll__graph.md5
@@ -1 +1 @@
-296f5ae6bbda45b09b885758cafab953
\ No newline at end of file
+c0f21a4686a54bfbb42c01f7b60525c8
\ No newline at end of file
diff --git a/d7/d40/class_solution__coll__graph.svg b/d7/d40/class_solution__coll__graph.svg
index a88f99bf8..363559927 100644
--- a/d7/d40/class_solution__coll__graph.svg
+++ b/d7/d40/class_solution__coll__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="118,-108.25 0,-108.25 0,-77.75 118,-77.75 118,-108.25"/>
 <text text-anchor="start" x="8" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="59" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -52,7 +52,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="227.5,-102.62 136.5,-102.62 136.5,-83.38 227.5,-83.38 227.5,-102.62"/>
 <text text-anchor="middle" x="182" y="-89.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
@@ -72,7 +72,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="344.25,-102.62 245.75,-102.62 245.75,-83.38 344.25,-83.38 344.25,-102.62"/>
 <text text-anchor="middle" x="295" y="-89.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; bool &gt;</text>
 </a>
diff --git a/d7/d40/class_solution__coll__graph_org.svg b/d7/d40/class_solution__coll__graph_org.svg
index ea5258087..9ed730a4c 100644
--- a/d7/d40/class_solution__coll__graph_org.svg
+++ b/d7/d40/class_solution__coll__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="118,-108.25 0,-108.25 0,-77.75 118,-77.75 118,-108.25"/>
 <text text-anchor="start" x="8" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="59" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -41,7 +41,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="227.5,-102.62 136.5,-102.62 136.5,-83.38 227.5,-83.38 227.5,-102.62"/>
 <text text-anchor="middle" x="182" y="-89.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
@@ -61,7 +61,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="344.25,-102.62 245.75,-102.62 245.75,-83.38 344.25,-83.38 344.25,-102.62"/>
 <text text-anchor="middle" x="295" y="-89.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; bool &gt;</text>
 </a>
diff --git a/d7/d43/stack__using__queue_8cpp_source.html b/d7/d43/stack__using__queue_8cpp_source.html
new file mode 100644
index 000000000..16b2cc44f
--- /dev/null
+++ b/d7/d43/stack__using__queue_8cpp_source.html
@@ -0,0 +1,222 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/stack_using_queue.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/d43/stack__using__queue_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">stack_using_queue.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;queue&gt;</span>     </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d3c/namespacedata__structures.html">data_structures</a> {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/d1c/namespacestack__using__queue.html">stack_using_queue</a> {</div>
+<div class="foldopen" id="foldopen00031" data-start="{" data-end="};">
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html">   31</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html">Stack</a> {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6">   32</a></span>    std::queue&lt;int64_t&gt; <a class="code hl_variable" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>;       </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323">   33</a></span>    std::queue&lt;int64_t&gt; <a class="code hl_variable" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323">auxiliary_q</a>;  </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b">   35</a></span>    uint32_t <a class="code hl_variable" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b">current_size</a> = 0;        </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7">   41</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7">top</a>() { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>.front(); }</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="foldopen" id="foldopen00048" data-start="{" data-end="}">
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2">   48</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2">push</a>(<span class="keywordtype">int</span> val) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        <a class="code hl_variable" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323">auxiliary_q</a>.push(val);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordflow">while</span> (!<a class="code hl_variable" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>.empty()) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>            <a class="code hl_variable" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323">auxiliary_q</a>.push(<a class="code hl_variable" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>.front());</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            <a class="code hl_variable" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>.pop();</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        }</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        swap(<a class="code hl_variable" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>, <a class="code hl_variable" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323">auxiliary_q</a>);</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <a class="code hl_variable" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b">current_size</a>++;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    }</div>
+</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb">   62</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb">pop</a>() {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>.empty()) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <a class="code hl_variable" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>.pop();</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <a class="code hl_variable" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b">current_size</a>--;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    }</div>
+</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">   74</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">size</a>() { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b">current_size</a>; }</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>};</div>
+</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>}  <span class="comment">// namespace stack_using_queue</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>}  <span class="comment">// namespace data_structures</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <a class="code hl_struct" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html">data_structures::stack_using_queue::Stack</a> s;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    s.<a class="code hl_function" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2">push</a>(1);  </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    s.<a class="code hl_function" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2">push</a>(2);  </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    s.<a class="code hl_function" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2">push</a>(3);  </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    assert(s.<a class="code hl_function" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">size</a>() == 3);  </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    assert(s.<a class="code hl_function" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7">top</a>() == 3);  </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    s.<a class="code hl_function" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb">pop</a>();               </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    assert(s.<a class="code hl_function" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7">top</a>() == 2);  </div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    s.<a class="code hl_function" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb">pop</a>();  </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    assert(s.<a class="code hl_function" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7">top</a>() == 1);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span> </div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    s.<a class="code hl_function" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2">push</a>(5);             </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    assert(s.<a class="code hl_function" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7">top</a>() == 5);  </div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    s.<a class="code hl_function" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb">pop</a>();               </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    assert(s.<a class="code hl_function" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7">top</a>() == 1);  </div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    assert(s.<a class="code hl_function" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">size</a>() == 1);  </div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>}</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>}</div>
+<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00100">caesar_cipher.cpp:100</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html">data_structures</a></div><div class="ttdoc">for IO operations</div></div>
+<div class="ttc" id="anamespacestack__using__queue_html"><div class="ttname"><a href="../../df/d1c/namespacestack__using__queue.html">stack_using_queue</a></div><div class="ttdoc">Functions for the Stack Using Queue implementation.</div></div>
+<div class="ttc" id="astructdata__structures_1_1stack__using__queue_1_1_stack_html"><div class="ttname"><a href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html">data_structures::stack_using_queue::Stack</a></div><div class="ttdoc">Stack Class implementation for basic methods of Stack Data Structure.</div><div class="ttdef"><b>Definition</b> <a href="#l00031">stack_using_queue.cpp:31</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1stack__using__queue_1_1_stack_html_a2f80f87fc6f6ded938426698bba89323"><div class="ttname"><a href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323">data_structures::stack_using_queue::Stack::auxiliary_q</a></div><div class="ttdeci">std::queue&lt; int64_t &gt; auxiliary_q</div><div class="ttdef"><b>Definition</b> <a href="#l00033">stack_using_queue.cpp:33</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1stack__using__queue_1_1_stack_html_a5540434e1b41245205eee86f664906f7"><div class="ttname"><a href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7">data_structures::stack_using_queue::Stack::top</a></div><div class="ttdeci">int top()</div><div class="ttdef"><b>Definition</b> <a href="#l00041">stack_using_queue.cpp:41</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1stack__using__queue_1_1_stack_html_abdd461689df4983a3ad3b05d853cf5eb"><div class="ttname"><a href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb">data_structures::stack_using_queue::Stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdoc">Removes the topmost element from the stack.</div><div class="ttdef"><b>Definition</b> <a href="#l00062">stack_using_queue.cpp:62</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1stack__using__queue_1_1_stack_html_ac0ddec9ab8f778dad23ec446d7a77b39"><div class="ttname"><a href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">data_structures::stack_using_queue::Stack::size</a></div><div class="ttdeci">int size()</div><div class="ttdoc">Utility function to return the current size of the stack.</div><div class="ttdef"><b>Definition</b> <a href="#l00074">stack_using_queue.cpp:74</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1stack__using__queue_1_1_stack_html_acf8ca54d5dd6676f255fff3dedacc7c6"><div class="ttname"><a href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6">data_structures::stack_using_queue::Stack::main_q</a></div><div class="ttdeci">std::queue&lt; int64_t &gt; main_q</div><div class="ttdoc">stores the current state of the stack</div><div class="ttdef"><b>Definition</b> <a href="#l00032">stack_using_queue.cpp:32</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1stack__using__queue_1_1_stack_html_af04a8f3536a52d8c9916086b656eefc2"><div class="ttname"><a href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2">data_structures::stack_using_queue::Stack::push</a></div><div class="ttdeci">void push(int val)</div><div class="ttdoc">Inserts an element to the top of the stack.</div><div class="ttdef"><b>Definition</b> <a href="#l00048">stack_using_queue.cpp:48</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1stack__using__queue_1_1_stack_html_afdfd2f4418c70b1bda50f2c3e416d80b"><div class="ttname"><a href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b">data_structures::stack_using_queue::Stack::current_size</a></div><div class="ttdeci">uint32_t current_size</div><div class="ttdoc">stores the current size of the stack</div><div class="ttdef"><b>Definition</b> <a href="#l00035">stack_using_queue.cpp:35</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><b>stack_using_queue.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/d47/namespace_x_o_r.html b/d7/d47/namespace_x_o_r.html
index 07822b330..c150b0463 100644
--- a/d7/d47/namespace_x_o_r.html
+++ b/d7/d47/namespace_x_o_r.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: XOR Namespace Reference</title>
+<title>TheAlgorithms/C++: XOR Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html b/d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html
index db9e8ec56..9861bd176 100644
--- a/d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html
+++ b/d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: std::is_integral&lt; uint256_t &gt; Struct Reference</title>
+<title>TheAlgorithms/C++: std::is_integral&lt; uint256_t &gt; Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -117,7 +134,10 @@ Collaboration diagram for std::is_integral&lt; uint256_t &gt;:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.svg" width="195" height="111"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
-<hr/>The documentation for this struct was generated from the following file:<ul>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00021">21</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
+</div><hr/>The documentation for this struct was generated from the following file:<ul>
 <li>ciphers/<a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a></li>
 </ul>
 </div><!-- contents -->
@@ -125,7 +145,7 @@ Collaboration diagram for std::is_integral&lt; uint256_t &gt;:</div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
-    <li class="navelem"><a class="el" href="../../d8/dcc/namespacestd.html">std</a></li><li class="navelem"><a class="el" href="../../d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html">is_integral&lt; uint256_t &gt;</a></li>
+    <li class="navelem"><b>std</b></li><li class="navelem"><a class="el" href="../../d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html">is_integral&lt; uint256_t &gt;</a></li>
     <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
   </ul>
 </div>
diff --git a/d7/d48/structgeometry_1_1grahamscan_1_1_point.html b/d7/d48/structgeometry_1_1grahamscan_1_1_point.html
index 3205ef5ed..0d31712ff 100644
--- a/d7/d48/structgeometry_1_1grahamscan_1_1_point.html
+++ b/d7/d48/structgeometry_1_1grahamscan_1_1_point.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: geometry::grahamscan::Point Struct Reference</title>
+<title>TheAlgorithms/C++: geometry::grahamscan::Point Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -113,13 +130,47 @@ $(function(){initNavTree('d7/d48/structgeometry_1_1grahamscan_1_1_point.html','.
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:acfa2c929b3637a69ffa51fa6e2c9476b" id="r_acfa2c929b3637a69ffa51fa6e2c9476b"><td class="memItemLeft" align="right" valign="top"><a id="acfa2c929b3637a69ffa51fa6e2c9476b" name="acfa2c929b3637a69ffa51fa6e2c9476b"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>x</b></td></tr>
+<tr class="memitem:acfa2c929b3637a69ffa51fa6e2c9476b" id="r_acfa2c929b3637a69ffa51fa6e2c9476b"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acfa2c929b3637a69ffa51fa6e2c9476b">x</a></td></tr>
 <tr class="separator:acfa2c929b3637a69ffa51fa6e2c9476b"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a6905580704aa56167ba6ff886289d5f7" id="r_a6905580704aa56167ba6ff886289d5f7"><td class="memItemLeft" align="right" valign="top"><a id="a6905580704aa56167ba6ff886289d5f7" name="a6905580704aa56167ba6ff886289d5f7"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>y</b></td></tr>
+<tr class="memitem:a6905580704aa56167ba6ff886289d5f7" id="r_a6905580704aa56167ba6ff886289d5f7"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6905580704aa56167ba6ff886289d5f7">y</a></td></tr>
 <tr class="separator:a6905580704aa56167ba6ff886289d5f7"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../de/d89/graham__scan__functions_8hpp_source.html#l00064">64</a> of file <a class="el" href="../../de/d89/graham__scan__functions_8hpp_source.html">graham_scan_functions.hpp</a>.</p>
+</div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="acfa2c929b3637a69ffa51fa6e2c9476b" name="acfa2c929b3637a69ffa51fa6e2c9476b"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#acfa2c929b3637a69ffa51fa6e2c9476b">&#9670;&#160;</a></span>x</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int geometry::grahamscan::Point::x</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/d89/graham__scan__functions_8hpp_source.html#l00065">65</a> of file <a class="el" href="../../de/d89/graham__scan__functions_8hpp_source.html">graham_scan_functions.hpp</a>.</p>
+
+</div>
+</div>
+<a id="a6905580704aa56167ba6ff886289d5f7" name="a6905580704aa56167ba6ff886289d5f7"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a6905580704aa56167ba6ff886289d5f7">&#9670;&#160;</a></span>y</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int geometry::grahamscan::Point::y</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/d89/graham__scan__functions_8hpp_source.html#l00065">65</a> of file <a class="el" href="../../de/d89/graham__scan__functions_8hpp_source.html">graham_scan_functions.hpp</a>.</p>
+
+</div>
+</div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
 <li>geometry/<a class="el" href="../../de/d89/graham__scan__functions_8hpp_source.html">graham_scan_functions.hpp</a></li>
 </ul>
diff --git a/d7/d4c/namespacek__nearest__neighbors.html b/d7/d4c/namespacek__nearest__neighbors.html
index 1c376fea1..a8609b9c5 100644
--- a/d7/d4c/namespacek__nearest__neighbors.html
+++ b/d7/d4c/namespacek__nearest__neighbors.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: k_nearest_neighbors Namespace Reference</title>
+<title>TheAlgorithms/C++: k_nearest_neighbors Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d7/d50/namespacemodular__inverse__fermat.html b/d7/d50/namespacemodular__inverse__fermat.html
index b885ae2db..dca14d674 100644
--- a/d7/d50/namespacemodular__inverse__fermat.html
+++ b/d7/d50/namespacemodular__inverse__fermat.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: modular_inverse_fermat Namespace Reference</title>
+<title>TheAlgorithms/C++: modular_inverse_fermat Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d7/d56/count__bits__flip_8cpp.html b/d7/d56/count__bits__flip_8cpp.html
index 28956595a..ee08bc6e9 100644
--- a/d7/d56/count__bits__flip_8cpp.html
+++ b/d7/d56/count__bits__flip_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: bit_manipulation/count_bits_flip.cpp File Reference</title>
+<title>TheAlgorithms/C++: bit_manipulation/count_bits_flip.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for count_bits_flip.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dcc/count__bits__flip_8cpp__incl.svg" width="255" height="126"><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">
+</div>
+<p><a href="../../d7/d56/count__bits__flip_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></td></tr>
@@ -133,7 +152,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a2548486b6c3b80101e768562e687ef7b" id="r_a2548486b6c3b80101e768562e687ef7b"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2548486b6c3b80101e768562e687ef7b">bit_manipulation::count_bits_flip::countBitsFlip</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> A, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> B)</td></tr>
+<tr class="memitem:a2548486b6c3b80101e768562e687ef7b" id="r_a2548486b6c3b80101e768562e687ef7b"><td class="memItemLeft" align="right" valign="top">std::uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2548486b6c3b80101e768562e687ef7b">bit_manipulation::count_bits_flip::countBitsFlip</a> (std::int64_t A, std::int64_t B)</td></tr>
 <tr class="memdesc:a2548486b6c3b80101e768562e687ef7b"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function implements count of bits flip required.  <br /></td></tr>
 <tr class="separator:a2548486b6c3b80101e768562e687ef7b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -149,6 +168,8 @@ Functions</h2></td></tr>
 <p>Explanation:</p>
 <p>A = 01010 B = 10100 As we can see, the bits of A that need to be flipped are 01010. If we flipthese bits, we get 10100, which is B.</p>
 <p>Worst Case Time Complexity: O(log n) Space complexity: O(1) </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/yashrajyash" target="_blank">Yash Raj Singh</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d7/d56/count__bits__flip_8cpp_source.html">count_bits_flip.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a2548486b6c3b80101e768562e687ef7b" name="a2548486b6c3b80101e768562e687ef7b"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a2548486b6c3b80101e768562e687ef7b">&#9670;&#160;</a></span>countBitsFlip()</h2>
@@ -157,14 +178,14 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> bit_manipulation::count_bits_flip::countBitsFlip </td>
+          <td class="memname">std::uint64_t bit_manipulation::count_bits_flip::countBitsFlip </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a></td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">std::int64_t</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a></td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
+          <td class="paramtype">std::int64_t</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -178,6 +199,8 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>total number of bits needed to be flipped to convert A to B </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d56/count__bits__flip_8cpp_source.html#l00043">43</a> of file <a class="el" href="../../d7/d56/count__bits__flip_8cpp_source.html">count_bits_flip.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   45</span>                  {  <span class="comment">// int64_t is preferred over int so that</span></div>
 <div class="line"><span class="lineno">   46</span>                       <span class="comment">// no Overflow can be there.</span></div>
 <div class="line"><span class="lineno">   47</span> </div>
@@ -191,12 +214,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   55</span>    }</div>
 <div class="line"><span class="lineno">   56</span>    <span class="keywordflow">return</span> count;</div>
 <div class="line"><span class="lineno">   57</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d56/count__bits__flip_8cpp_a2548486b6c3b80101e768562e687ef7b_cgraph.svg" width="168" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -216,17 +234,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d56/count__bits__flip_8cpp_source.html#l00086">86</a> of file <a class="el" href="../../d7/d56/count__bits__flip_8cpp_source.html">count_bits_flip.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   86</span>           {</div>
 <div class="line"><span class="lineno">   87</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   88</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   89</span>}</div>
-<div class="ttc" id="acount__bits__flip_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> count_bits_flip.cpp:65</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d56/count__bits__flip_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acount__bits__flip_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d56/count__bits__flip_8cpp_source.html#l00065">count_bits_flip.cpp:65</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -254,6 +269,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d56/count__bits__flip_8cpp_source.html#l00065">65</a> of file <a class="el" href="../../d7/d56/count__bits__flip_8cpp_source.html">count_bits_flip.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   65</span>                   {</div>
 <div class="line"><span class="lineno">   66</span>    <span class="comment">// A = 10, B = 20 return 4</span></div>
 <div class="line"><span class="lineno">   67</span>    assert(bit_manipulation::count_bits_flip::countBitsFlip(10, 20) == 4);</div>
@@ -269,16 +286,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   77</span>    assert(bit_manipulation::count_bits_flip::countBitsFlip(21, 22) == 2);</div>
 <div class="line"><span class="lineno">   78</span>    <span class="comment">// A = 7, B = 786 return 5</span></div>
 <div class="line"><span class="lineno">   79</span>    assert(bit_manipulation::count_bits_flip::countBitsFlip(7, 786) == 5);</div>
-<div class="line"><span class="lineno">   80</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All test cases successfully passed!&quot;</span> &lt;&lt; <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">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   81</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="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><!-- 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="../../d7/d56/count__bits__flip_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d7/d56/count__bits__flip_8cpp_a2548486b6c3b80101e768562e687ef7b_cgraph.map b/d7/d56/count__bits__flip_8cpp_a2548486b6c3b80101e768562e687ef7b_cgraph.map
deleted file mode 100644
index c07f74216..000000000
--- a/d7/d56/count__bits__flip_8cpp_a2548486b6c3b80101e768562e687ef7b_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="bit_manipulation::count_bits_flip::countBitsFlip" name="bit_manipulation::count_bits_flip::countBitsFlip">
-<area shape="rect" id="Node000001" title="The main function implements count of bits flip required." alt="" coords="5,29,163,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="53,29,52,19,57,11,68,5,84,3,101,5,112,11,109,16,100,10,84,8,69,10,61,14,57,20,59,28"/>
-</map>
diff --git a/d7/d56/count__bits__flip_8cpp_a2548486b6c3b80101e768562e687ef7b_cgraph.md5 b/d7/d56/count__bits__flip_8cpp_a2548486b6c3b80101e768562e687ef7b_cgraph.md5
deleted file mode 100644
index b15b11f85..000000000
--- a/d7/d56/count__bits__flip_8cpp_a2548486b6c3b80101e768562e687ef7b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-66813d089c1440d0037be34f98226a52
\ No newline at end of file
diff --git a/d7/d56/count__bits__flip_8cpp_a2548486b6c3b80101e768562e687ef7b_cgraph.svg b/d7/d56/count__bits__flip_8cpp_a2548486b6c3b80101e768562e687ef7b_cgraph.svg
deleted file mode 100644
index 6e174479c..000000000
--- a/d7/d56/count__bits__flip_8cpp_a2548486b6c3b80101e768562e687ef7b_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: bit_manipulation::count_bits_flip::countBitsFlip Pages: 1 -->
-<svg width="126pt" height="57pt"
- viewBox="0.00 0.00 126.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>bit_manipulation::count_bits_flip::countBitsFlip</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function implements count of bits flip required.">
-<polygon fill="#999999" stroke="#666666" points="118,-30.5 0,-30.5 0,0 118,0 118,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::count</text>
-<text text-anchor="middle" x="59" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_bits_flip::countBitsFlip</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.09,-30.99C33.82,-40.06 40.79,-48.5 59,-48.5 68.96,-48.5 75.55,-45.97 78.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.25,-42.79 79.76,-32.49 75.28,-42.09 82.25,-42.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d56/count__bits__flip_8cpp_a2548486b6c3b80101e768562e687ef7b_cgraph_org.svg b/d7/d56/count__bits__flip_8cpp_a2548486b6c3b80101e768562e687ef7b_cgraph_org.svg
deleted file mode 100644
index 24677729f..000000000
--- a/d7/d56/count__bits__flip_8cpp_a2548486b6c3b80101e768562e687ef7b_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: bit_manipulation::count_bits_flip::countBitsFlip Pages: 1 -->
-<svg width="126pt" height="57pt"
- viewBox="0.00 0.00 126.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>bit_manipulation::count_bits_flip::countBitsFlip</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function implements count of bits flip required.">
-<polygon fill="#999999" stroke="#666666" points="118,-30.5 0,-30.5 0,0 118,0 118,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::count</text>
-<text text-anchor="middle" x="59" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_bits_flip::countBitsFlip</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.09,-30.99C33.82,-40.06 40.79,-48.5 59,-48.5 68.96,-48.5 75.55,-45.97 78.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.25,-42.79 79.76,-32.49 75.28,-42.09 82.25,-42.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d56/count__bits__flip_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d7/d56/count__bits__flip_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index e85e01374..000000000
--- a/d7/d56/count__bits__flip_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/d7/d56/count__bits__flip_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d7/d56/count__bits__flip_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 5901bc148..000000000
--- a/d7/d56/count__bits__flip_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-729fb887ee50b6291b0542ba0592a5c7
\ No newline at end of file
diff --git a/d7/d56/count__bits__flip_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d7/d56/count__bits__flip_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 2e04695b9..000000000
--- a/d7/d56/count__bits__flip_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d56/count__bits__flip_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d7/d56/count__bits__flip_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1813bd719..000000000
--- a/d7/d56/count__bits__flip_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d56/count__bits__flip_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d7/d56/count__bits__flip_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index c872eb384..000000000
--- a/d7/d56/count__bits__flip_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/d7/d56/count__bits__flip_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d7/d56/count__bits__flip_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 746d5cbe0..000000000
--- a/d7/d56/count__bits__flip_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f085b71d2214ed21f4991316edd9ddf1
\ No newline at end of file
diff --git a/d7/d56/count__bits__flip_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d7/d56/count__bits__flip_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index bf5d999e9..000000000
--- a/d7/d56/count__bits__flip_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d56/count__bits__flip_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d7/d56/count__bits__flip_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 7da49c87c..000000000
--- a/d7/d56/count__bits__flip_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d56/count__bits__flip_8cpp_source.html b/d7/d56/count__bits__flip_8cpp_source.html
new file mode 100644
index 000000000..b6fb15bb1
--- /dev/null
+++ b/d7/d56/count__bits__flip_8cpp_source.html
@@ -0,0 +1,193 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: bit_manipulation/count_bits_flip.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/d56/count__bits__flip_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">count_bits_flip.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d7/d56/count__bits__flip_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a> {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d4/d38/namespacecount__bits__flip.html">count_bits_flip</a> {</div>
+<div class="foldopen" id="foldopen00043" data-start="{" data-end="}">
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="../../d7/d56/count__bits__flip_8cpp.html#a2548486b6c3b80101e768562e687ef7b">   43</a></span>std::uint64_t <a class="code hl_function" href="../../d7/d56/count__bits__flip_8cpp.html#a2548486b6c3b80101e768562e687ef7b">countBitsFlip</a>(</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    std::int64_t A,</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    std::int64_t B) {  <span class="comment">// int64_t is preferred over int so that</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>                       <span class="comment">// no Overflow can be there.</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordtype">int</span> count =</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        0;  <span class="comment">// &quot;count&quot; variable is used to count number of bits flip of the</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>            <span class="comment">// number A to form B in binary representation of number &#39;n&#39;</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    A = A ^ B;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">while</span> (A) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        A = A &amp; (A - 1);</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        count++;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">return</span> count;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>}</div>
+</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}  <span class="comment">// namespace count_bits_flip</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>}  <span class="comment">// namespace bit_manipulation</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="foldopen" id="foldopen00065" data-start="{" data-end="}">
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="../../d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   65</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="comment">// A = 10, B = 20 return 4</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    assert(bit_manipulation::count_bits_flip::countBitsFlip(10, 20) == 4);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="comment">// A = 20, B = 25 return 3</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    assert(bit_manipulation::count_bits_flip::countBitsFlip(20, 25) == 3);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="comment">// A = 7, B = 10 return 3</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    assert(bit_manipulation::count_bits_flip::countBitsFlip(7, 10) == 3);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="comment">// A = 17, B = 25 return 1</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    assert(bit_manipulation::count_bits_flip::countBitsFlip(17, 25) == 1);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="comment">// A = 11, B = 8 return 2</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    assert(bit_manipulation::count_bits_flip::countBitsFlip(11, 8) == 2);</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="comment">// A = 21, B = 22 return 2</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    assert(bit_manipulation::count_bits_flip::countBitsFlip(21, 22) == 2);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="comment">// A = 7, B = 786 return 5</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    assert(bit_manipulation::count_bits_flip::countBitsFlip(7, 786) == 5);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00086" data-start="{" data-end="}">
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="../../d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   86</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <a class="code hl_function" href="../../d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>}</div>
+</div>
+<div class="ttc" id="acount__bits__flip_8cpp_html_a2548486b6c3b80101e768562e687ef7b"><div class="ttname"><a href="../../d7/d56/count__bits__flip_8cpp.html#a2548486b6c3b80101e768562e687ef7b">bit_manipulation::count_bits_flip::countBitsFlip</a></div><div class="ttdeci">std::uint64_t countBitsFlip(std::int64_t A, std::int64_t B)</div><div class="ttdoc">The main function implements count of bits flip required.</div><div class="ttdef"><b>Definition</b> <a href="#l00043">count_bits_flip.cpp:43</a></div></div>
+<div class="ttc" id="acount__bits__flip_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d7/d56/count__bits__flip_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> <a href="#l00065">count_bits_flip.cpp:65</a></div></div>
+<div class="ttc" id="acount__bits__flip_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00086">count_bits_flip.cpp:86</a></div></div>
+<div class="ttc" id="anamespacebit__manipulation_html"><div class="ttname"><a href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacecount__bits__flip_html"><div class="ttname"><a href="../../d4/d38/namespacecount__bits__flip.html">count_bits_flip</a></div><div class="ttdoc">Functions for the count bits flip implementation.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_f3c4fbc4e901afa0a54d0623c5574aa7.html">bit_manipulation</a></li><li class="navelem"><a class="el" href="../../d7/d56/count__bits__flip_8cpp.html">count_bits_flip.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/d57/longest__increasing__subsequence_8cpp.html b/d7/d57/longest__increasing__subsequence_8cpp.html
index aabae49bd..1941f03e4 100644
--- a/d7/d57/longest__increasing__subsequence_8cpp.html
+++ b/d7/d57/longest__increasing__subsequence_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/longest_increasing_subsequence.cpp File Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming/longest_increasing_subsequence.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for longest_increasing_subsequence.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d40/longest__increasing__subsequence_8cpp__incl.svg" width="419" height="140"><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">
+</div>
+<p><a href="../../d7/d57/longest__increasing__subsequence_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
@@ -132,7 +151,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a0a2215194e58786c34db1ccaf8031079" id="r_a0a2215194e58786c34db1ccaf8031079"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079">dynamic_programming::LIS</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;a, const uint32_t &amp;n)</td></tr>
+<tr class="memitem:a0a2215194e58786c34db1ccaf8031079" id="r_a0a2215194e58786c34db1ccaf8031079"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079">dynamic_programming::LIS</a> (const std::vector&lt; uint64_t &gt; &amp;a, const uint32_t &amp;n)</td></tr>
 <tr class="memdesc:a0a2215194e58786c34db1ccaf8031079"><td class="mdescLeft">&#160;</td><td class="mdescRight">Calculate the longest increasing subsequence for the specified numbers.  <br /></td></tr>
 <tr class="separator:a0a2215194e58786c34db1ccaf8031079"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd>
 <dd>
 <a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d7/d57/longest__increasing__subsequence_8cpp_source.html">longest_increasing_subsequence.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="abf9e6b7e6f15df4b525a2e7705ba3089" name="abf9e6b7e6f15df4b525a2e7705ba3089"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#abf9e6b7e6f15df4b525a2e7705ba3089">&#9670;&#160;</a></span>main()</h2>
@@ -177,37 +198,30 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d57/longest__increasing__subsequence_8cpp_source.html#l00081">81</a> of file <a class="el" href="../../d7/d57/longest__increasing__subsequence_8cpp_source.html">longest_increasing_subsequence.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   81</span>                                       {</div>
 <div class="line"><span class="lineno">   82</span>    uint32_t n = 0;</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/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter size of array: &quot;</span>;</div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;</div>
+<div class="line"><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter size of array: &quot;</span>;</div>
+<div class="line"><span class="lineno">   85</span>    std::cin &gt;&gt; n;</div>
 <div class="line"><span class="lineno">   86</span> </div>
-<div class="line"><span class="lineno">   87</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> a(n);</div>
+<div class="line"><span class="lineno">   87</span>    std::vector&lt;uint64_t&gt; a(n);</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/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter array elements: &quot;</span>;</div>
+<div class="line"><span class="lineno">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter array elements: &quot;</span>;</div>
 <div class="line"><span class="lineno">   90</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
-<div class="line"><span class="lineno">   91</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; a[i];</div>
+<div class="line"><span class="lineno">   91</span>        std::cin &gt;&gt; a[i];</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>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nThe result is: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079">dynamic_programming::LIS</a>(a, n)</div>
-<div class="line"><span class="lineno">   95</span>              &lt;&lt; <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">   94</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nThe result is: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079">dynamic_programming::LIS</a>(a, n)</div>
+<div class="line"><span class="lineno">   95</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   96</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   97</span> </div>
 <div class="line"><span class="lineno">   98</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   99</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="alongest__increasing__subsequence_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> longest_increasing_subsequence.cpp:64</div></div>
-<div class="ttc" id="anamespacedynamic__programming_html_a0a2215194e58786c34db1ccaf8031079"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079">dynamic_programming::LIS</a></div><div class="ttdeci">uint64_t LIS(const std::vector&lt; uint64_t &gt; &amp;a, const uint32_t &amp;n)</div><div class="ttdoc">Calculate the longest increasing subsequence for the specified numbers.</div><div class="ttdef"><b>Definition</b> longest_increasing_subsequence.cpp:40</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d57/longest__increasing__subsequence_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg" width="500" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="alongest__increasing__subsequence_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d57/longest__increasing__subsequence_8cpp_source.html#l00064">longest_increasing_subsequence.cpp:64</a></div></div>
+<div class="ttc" id="anamespacedynamic__programming_html_a0a2215194e58786c34db1ccaf8031079"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079">dynamic_programming::LIS</a></div><div class="ttdeci">uint64_t LIS(const std::vector&lt; uint64_t &gt; &amp;a, const uint32_t &amp;n)</div><div class="ttdoc">Calculate the longest increasing subsequence for the specified numbers.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d57/longest__increasing__subsequence_8cpp_source.html#l00040">longest_increasing_subsequence.cpp:40</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -236,23 +250,20 @@ 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>
 <p>&lt; The longest increasing subsequence is <code>{2,3,4,5,8}</code></p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d57/longest__increasing__subsequence_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../d7/d57/longest__increasing__subsequence_8cpp_source.html">longest_increasing_subsequence.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   64</span>                   {</div>
-<div class="line"><span class="lineno">   65</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> a = {15, 21, 2, 3, 4, 5, 8, 4, 1, 1};</div>
+<div class="line"><span class="lineno">   65</span>    std::vector&lt;uint64_t&gt; a = {15, 21, 2, 3, 4, 5, 8, 4, 1, 1};</div>
 <div class="line"><span class="lineno">   66</span>    uint32_t n = a.size();</div>
 <div class="line"><span class="lineno">   67</span> </div>
 <div class="line"><span class="lineno">   68</span>    uint32_t <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079">dynamic_programming::LIS</a>(a, n);</div>
 <div class="line"><span class="lineno">   69</span>    assert(result ==</div>
-<div class="line"><span class="lineno">   70</span>           5);  <span class="comment">///&lt; The longest increasing subsequence is `{2,3,4,5,8}`</span></div>
+<div class="line"><span class="lineno">   70</span>           5);  </div>
 <div class="line"><span class="lineno">   71</span> </div>
-<div class="line"><span class="lineno">   72</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Self-test implementations passed!&quot;</span> &lt;&lt; <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">   72</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Self-test implementations passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   73</span>}</div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d57/longest__increasing__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="403" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d7/d57/longest__increasing__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d7/d57/longest__increasing__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index d5bb2e587..000000000
--- a/d7/d57/longest__increasing__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,31,49,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="151,5,222,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,38,135,24,136,29,49,43"/>
-<area shape="rect" id="Node000003" href="$dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079" title="Calculate the longest increasing subsequence for the specified numbers." alt="" coords="97,55,277,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="49,44,83,49,82,54,48,49"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="325,55,397,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="278,65,309,65,309,70,278,70"/>
-</map>
diff --git a/d7/d57/longest__increasing__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d7/d57/longest__increasing__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index d6b1c60aa..000000000
--- a/d7/d57/longest__increasing__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7fc0c8af4a0fdd92f31c574e74ea7d82
\ No newline at end of file
diff --git a/d7/d57/longest__increasing__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d7/d57/longest__increasing__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 4b769c0c5..000000000
--- a/d7/d57/longest__increasing__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="302pt" height="64pt"
- viewBox="0.00 0.00 302.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="162.88,-56.25 109.38,-56.25 109.38,-37 162.88,-37 162.88,-56.25"/>
-<text text-anchor="middle" x="136.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.66,-30.11C49.06,-32.75 75.61,-37.03 97.58,-40.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.97,-44.02 107.4,-42.16 98.09,-37.11 96.97,-44.02"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079" target="_top" xlink:title="Calculate the longest increasing subsequence for the specified numbers.">
-<polygon fill="white" stroke="#666666" points="203.75,-19.25 68.5,-19.25 68.5,0 203.75,0 203.75,-19.25"/>
-<text text-anchor="middle" x="136.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming::LIS</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.66,-25.27C39.57,-24.22 48.28,-22.89 57.69,-21.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="58.14,-24.92 67.49,-19.95 57.08,-18 58.14,-24.92"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-19.25 239.75,-19.25 239.75,0 294,0 294,-19.25"/>
-<text text-anchor="middle" x="266.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.14,-9.62C212.32,-9.62 220.44,-9.62 227.98,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.75,-13.13 237.75,-9.63 227.75,-6.13 227.75,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d57/longest__increasing__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d7/d57/longest__increasing__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 3b68f070b..000000000
--- a/d7/d57/longest__increasing__subsequence_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="302pt" height="64pt"
- viewBox="0.00 0.00 302.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="162.88,-56.25 109.38,-56.25 109.38,-37 162.88,-37 162.88,-56.25"/>
-<text text-anchor="middle" x="136.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.66,-30.11C49.06,-32.75 75.61,-37.03 97.58,-40.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.97,-44.02 107.4,-42.16 98.09,-37.11 96.97,-44.02"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079" target="_top" xlink:title="Calculate the longest increasing subsequence for the specified numbers.">
-<polygon fill="white" stroke="#666666" points="203.75,-19.25 68.5,-19.25 68.5,0 203.75,0 203.75,-19.25"/>
-<text text-anchor="middle" x="136.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming::LIS</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.66,-25.27C39.57,-24.22 48.28,-22.89 57.69,-21.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="58.14,-24.92 67.49,-19.95 57.08,-18 58.14,-24.92"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-19.25 239.75,-19.25 239.75,0 294,0 294,-19.25"/>
-<text text-anchor="middle" x="266.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.14,-9.62C212.32,-9.62 220.44,-9.62 227.98,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.75,-13.13 237.75,-9.63 227.75,-6.13 227.75,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d57/longest__increasing__subsequence_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map b/d7/d57/longest__increasing__subsequence_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map
deleted file mode 100644
index 471552392..000000000
--- a/d7/d57/longest__increasing__subsequence_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,29,55,55"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="248,5,320,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,29,102,14,170,9,233,10,233,16,170,14,103,19,56,34"/>
-<area shape="rect" id="Node000003" href="$dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079" title="Calculate the longest increasing subsequence for the specified numbers." alt="" coords="194,55,374,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,50,103,65,178,71,178,76,102,70,54,56"/>
-<area shape="rect" id="Node000005" href="$d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,29,146,55"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="55,40,87,40,87,45,55,45"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="422,55,495,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="375,65,407,65,407,70,375,70"/>
-<area shape="poly" id="edge5_Node000005_Node000002" title=" " alt="" coords="146,36,232,23,233,28,147,42"/>
-<area shape="poly" id="edge6_Node000005_Node000003" title=" " alt="" coords="147,43,185,49,184,54,146,48"/>
-</map>
diff --git a/d7/d57/longest__increasing__subsequence_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5 b/d7/d57/longest__increasing__subsequence_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
deleted file mode 100644
index 9bb7aecdb..000000000
--- a/d7/d57/longest__increasing__subsequence_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-122c193858cba99297fd0212ba03bb95
\ No newline at end of file
diff --git a/d7/d57/longest__increasing__subsequence_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg b/d7/d57/longest__increasing__subsequence_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
deleted file mode 100644
index 785fd2c13..000000000
--- a/d7/d57/longest__increasing__subsequence_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="375pt" height="64pt"
- viewBox="0.00 0.00 375.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-38.25 0,-38.25 0,-19 37,-19 37,-38.25"/>
-<text text-anchor="middle" x="18.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235.88,-56.25 182.38,-56.25 182.38,-37 235.88,-37 235.88,-56.25"/>
-<text text-anchor="middle" x="209.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.41,-36.72C47.61,-40.88 60.76,-45.52 73,-47.62 105.63,-53.25 143.34,-52.37 170.62,-50.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.8,-53.94 180.49,-49.66 170.24,-46.96 170.8,-53.94"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079" target="_top" xlink:title="Calculate the longest increasing subsequence for the specified numbers.">
-<polygon fill="white" stroke="#666666" points="276.75,-19.25 141.5,-19.25 141.5,0 276.75,0 276.75,-19.25"/>
-<text text-anchor="middle" x="209.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming::LIS</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.41,-20.53C47.61,-16.37 60.76,-11.73 73,-9.62 91.19,-6.49 110.96,-5.28 129.62,-5.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.55,-8.61 139.56,-5.13 129.57,-1.61 129.55,-8.61"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-38.25 73,-38.25 73,-19 105.5,-19 105.5,-38.25"/>
-<text text-anchor="middle" x="89.25" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-28.62C44.58,-28.62 53.31,-28.62 61.45,-28.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-32.13 71.2,-28.63 61.2,-25.13 61.2,-32.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="367,-19.25 312.75,-19.25 312.75,0 367,0 367,-19.25"/>
-<text text-anchor="middle" x="339.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M277.14,-9.62C285.32,-9.62 293.44,-9.62 300.98,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.75,-13.13 310.75,-9.63 300.75,-6.13 300.75,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge5_Node000005_Node000002" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge5_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.66,-30.98C122.06,-33.48 148.61,-37.54 170.58,-40.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.99,-44.34 180.4,-42.39 171.04,-37.42 169.99,-44.34"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge6_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge6_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.66,-26.14C113.39,-24.89 123.39,-23.28 134.1,-21.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.64,-25.02 143.95,-19.97 133.52,-18.1 134.64,-25.02"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d57/longest__increasing__subsequence_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg b/d7/d57/longest__increasing__subsequence_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg
deleted file mode 100644
index 8cabfaada..000000000
--- a/d7/d57/longest__increasing__subsequence_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="375pt" height="64pt"
- viewBox="0.00 0.00 375.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-38.25 0,-38.25 0,-19 37,-19 37,-38.25"/>
-<text text-anchor="middle" x="18.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235.88,-56.25 182.38,-56.25 182.38,-37 235.88,-37 235.88,-56.25"/>
-<text text-anchor="middle" x="209.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.41,-36.72C47.61,-40.88 60.76,-45.52 73,-47.62 105.63,-53.25 143.34,-52.37 170.62,-50.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.8,-53.94 180.49,-49.66 170.24,-46.96 170.8,-53.94"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079" target="_top" xlink:title="Calculate the longest increasing subsequence for the specified numbers.">
-<polygon fill="white" stroke="#666666" points="276.75,-19.25 141.5,-19.25 141.5,0 276.75,0 276.75,-19.25"/>
-<text text-anchor="middle" x="209.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming::LIS</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.41,-20.53C47.61,-16.37 60.76,-11.73 73,-9.62 91.19,-6.49 110.96,-5.28 129.62,-5.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.55,-8.61 139.56,-5.13 129.57,-1.61 129.55,-8.61"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-38.25 73,-38.25 73,-19 105.5,-19 105.5,-38.25"/>
-<text text-anchor="middle" x="89.25" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-28.62C44.58,-28.62 53.31,-28.62 61.45,-28.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-32.13 71.2,-28.63 61.2,-25.13 61.2,-32.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="367,-19.25 312.75,-19.25 312.75,0 367,0 367,-19.25"/>
-<text text-anchor="middle" x="339.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M277.14,-9.62C285.32,-9.62 293.44,-9.62 300.98,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.75,-13.13 310.75,-9.63 300.75,-6.13 300.75,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge5_Node000005_Node000002" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge5_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.66,-30.98C122.06,-33.48 148.61,-37.54 170.58,-40.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.99,-44.34 180.4,-42.39 171.04,-37.42 169.99,-44.34"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge6_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge6_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.66,-26.14C113.39,-24.89 123.39,-23.28 134.1,-21.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.64,-25.02 143.95,-19.97 133.52,-18.1 134.64,-25.02"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d57/longest__increasing__subsequence_8cpp_source.html b/d7/d57/longest__increasing__subsequence_8cpp_source.html
new file mode 100644
index 000000000..4320a1b33
--- /dev/null
+++ b/d7/d57/longest__increasing__subsequence_8cpp_source.html
@@ -0,0 +1,205 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/longest_increasing_subsequence.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/d57/longest__increasing__subsequence_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">longest_increasing_subsequence.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d7/d57/longest__increasing__subsequence_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;climits&gt;</span>   </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;cstdint&gt;</span>   </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a> {</div>
+<div class="foldopen" id="foldopen00040" data-start="{" data-end="}">
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079">   40</a></span>uint64_t <a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079">LIS</a>(<span class="keyword">const</span> std::vector&lt;uint64_t&gt; &amp;a, <span class="keyword">const</span> uint32_t &amp;n) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    std::vector&lt;int&gt; lis(n);</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        lis[i] = 1;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    }</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; i; ++j) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            <span class="keywordflow">if</span> (a[i] &gt; a[j] &amp;&amp; lis[i] &lt; lis[j] + 1) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>                lis[i] = lis[j] + 1;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordtype">int</span> res = 0;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        res = std::max(res, lis[i]);</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">return</span> res;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>}</div>
+</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}  <span class="comment">// namespace dynamic_programming</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="foldopen" id="foldopen00064" data-start="{" data-end="}">
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   64</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    std::vector&lt;uint64_t&gt; a = {15, 21, 2, 3, 4, 5, 8, 4, 1, 1};</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    uint32_t n = a.size();</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    uint32_t result = <a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079">dynamic_programming::LIS</a>(a, n);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    assert(result ==</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>           5);  </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Self-test implementations passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>}</div>
+</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="foldopen" id="foldopen00081" data-start="{" data-end="}">
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="../../d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089">   81</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> <span class="keyword">const</span> *argv[]) {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    uint32_t n = 0;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter size of array: &quot;</span>;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    std::vector&lt;uint64_t&gt; a(n);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter array elements: &quot;</span>;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        std::cin &gt;&gt; a[i];</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    }</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nThe result is: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079">dynamic_programming::LIS</a>(a, n)</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <a class="code hl_function" href="../../d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>}</div>
+</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="alongest__increasing__subsequence_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d7/d57/longest__increasing__subsequence_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> <a href="#l00064">longest_increasing_subsequence.cpp:64</a></div></div>
+<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
+<div class="ttc" id="anamespacedynamic__programming_html_a0a2215194e58786c34db1ccaf8031079"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079">dynamic_programming::LIS</a></div><div class="ttdeci">uint64_t LIS(const std::vector&lt; uint64_t &gt; &amp;a, const uint32_t &amp;n)</div><div class="ttdoc">Calculate the longest increasing subsequence for the specified numbers.</div><div class="ttdef"><b>Definition</b> <a href="#l00040">longest_increasing_subsequence.cpp:40</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../d7/d57/longest__increasing__subsequence_8cpp.html">longest_increasing_subsequence.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.map b/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.map
index 1efdde85d..a4c632c64 100644
--- a/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.map
+++ b/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.map
@@ -1,15 +1,15 @@
 <map id="machine_learning::neural_network::NeuralNetwork" name="machine_learning::neural_network::NeuralNetwork">
 <area shape="rect" id="Node000001" title=" " alt="" coords="61,435,230,476"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="61,316,230,372"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="61,316,230,372"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="148,387,148,435,143,435,143,387"/>
 <area shape="rect" id="Node000003" href="$dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html" title=" " alt="" coords="48,213,243,253"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="148,269,148,316,143,316,143,269"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string.html" title=" " alt="" coords="32,116,112,142"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="32,116,112,142"/>
 <area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="92,153,133,211,129,214,87,156"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string.html" title=" " alt="" coords="5,5,131,46"/>
+<area shape="rect" id="Node000005" title=" " alt="" coords="5,5,131,46"/>
 <area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="72,61,74,116,69,116,67,61"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="144,109,312,150"/>
+<area shape="rect" id="Node000006" title=" " alt="" coords="144,109,312,150"/>
 <area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="204,164,163,214,159,211,200,160"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/valarray.html" title=" " alt="" coords="154,13,310,38"/>
+<area shape="rect" id="Node000007" title=" " alt="" coords="154,13,310,38"/>
 <area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="234,54,231,109,226,108,228,54"/>
 </map>
diff --git a/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.md5 b/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.md5
index f5ab0538d..8c63de088 100644
--- a/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.md5
+++ b/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.md5
@@ -1 +1 @@
-20006dd0f6b9c557dc6aeebc3e6802f1
\ No newline at end of file
+54fa7438b8c6179d358f3b202ad8a7b9
\ No newline at end of file
diff --git a/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.svg b/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.svg
index 4b200fa6d..29a5f6a69 100644
--- a/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.svg
+++ b/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph.svg
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="168.5,-119.5 41.5,-119.5 41.5,-77.75 168.5,-77.75 168.5,-119.5"/>
 <text text-anchor="start" x="49.5" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; machine</text>
 <text text-anchor="start" x="49.5" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">_learning::neural_network</text>
@@ -73,7 +73,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="79.75,-269.38 20.25,-269.38 20.25,-250.12 79.75,-250.12 79.75,-269.38"/>
 <text text-anchor="middle" x="50" y="-255.88" font-family="Helvetica,sans-Serif" font-size="10.00">std::string</text>
 </a>
@@ -92,7 +92,7 @@
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
+<g id="a_Node000005"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="94,-352.75 0,-352.75 0,-322.25 94,-322.25 94,-352.75"/>
 <text text-anchor="start" x="8" y="-339.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::basic_string&lt;</text>
 <text text-anchor="middle" x="47" y="-328" font-family="Helvetica,sans-Serif" font-size="10.00"> Char &gt;</text>
@@ -111,7 +111,7 @@
 <!-- Node6 -->
 <g id="Node000006" class="node">
 <title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000006"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="229.75,-275 104.25,-275 104.25,-244.5 229.75,-244.5 229.75,-275"/>
 <text text-anchor="start" x="112.25" y="-261.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::valarray</text>
 <text text-anchor="middle" x="167" y="-250.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; double &gt; &gt;</text>
@@ -131,7 +131,7 @@
 <!-- Node7 -->
 <g id="Node000007" class="node">
 <title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/valarray.html" xlink:title=" ">
+<g id="a_Node000007"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="228.25,-347.12 111.75,-347.12 111.75,-327.88 228.25,-327.88 228.25,-347.12"/>
 <text text-anchor="middle" x="170" y="-333.62" font-family="Helvetica,sans-Serif" font-size="10.00">std::valarray&lt; double &gt;</text>
 </a>
diff --git a/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph_org.svg b/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph_org.svg
index 90f972ddc..4727a6a8f 100644
--- a/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph_org.svg
+++ b/d7/d59/classmachine__learning_1_1neural__network_1_1_neural_network__coll__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="168.5,-119.5 41.5,-119.5 41.5,-77.75 168.5,-77.75 168.5,-119.5"/>
 <text text-anchor="start" x="49.5" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; machine</text>
 <text text-anchor="start" x="49.5" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">_learning::neural_network</text>
@@ -62,7 +62,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="79.75,-269.38 20.25,-269.38 20.25,-250.12 79.75,-250.12 79.75,-269.38"/>
 <text text-anchor="middle" x="50" y="-255.88" font-family="Helvetica,sans-Serif" font-size="10.00">std::string</text>
 </a>
@@ -81,7 +81,7 @@
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
+<g id="a_Node000005"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="94,-352.75 0,-352.75 0,-322.25 94,-322.25 94,-352.75"/>
 <text text-anchor="start" x="8" y="-339.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::basic_string&lt;</text>
 <text text-anchor="middle" x="47" y="-328" font-family="Helvetica,sans-Serif" font-size="10.00"> Char &gt;</text>
@@ -100,7 +100,7 @@
 <!-- Node6 -->
 <g id="Node000006" class="node">
 <title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000006"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="229.75,-275 104.25,-275 104.25,-244.5 229.75,-244.5 229.75,-275"/>
 <text text-anchor="start" x="112.25" y="-261.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::valarray</text>
 <text text-anchor="middle" x="167" y="-250.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; double &gt; &gt;</text>
@@ -120,7 +120,7 @@
 <!-- Node7 -->
 <g id="Node000007" class="node">
 <title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/valarray.html" xlink:title=" ">
+<g id="a_Node000007"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="228.25,-347.12 111.75,-347.12 111.75,-327.88 228.25,-327.88 228.25,-347.12"/>
 <text text-anchor="middle" x="170" y="-333.62" font-family="Helvetica,sans-Serif" font-size="10.00">std::valarray&lt; double &gt;</text>
 </a>
diff --git a/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html b/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html
index bbd542d83..8c22386a5 100644
--- a/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html
+++ b/d7/d5e/classdata__structures_1_1linked__list_1_1_node-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d7/d61/classdata__structures_1_1tree__234_1_1_node-members.html b/d7/d61/classdata__structures_1_1tree__234_1_1_node-members.html
index 122b7cf35..08f4e12a9 100644
--- a/d7/d61/classdata__structures_1_1tree__234_1_1_node-members.html
+++ b/d7/d61/classdata__structures_1_1tree__234_1_1_node-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d7/d65/shortest__common__supersequence_8cpp.html b/d7/d65/shortest__common__supersequence_8cpp.html
index 2cb6ab4bb..71e8d6a10 100644
--- a/d7/d65/shortest__common__supersequence_8cpp.html
+++ b/d7/d65/shortest__common__supersequence_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/shortest_common_supersequence.cpp File Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming/shortest_common_supersequence.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for shortest_common_supersequence.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d48/shortest__common__supersequence_8cpp__incl.svg" width="428" height="126"><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">
+</div>
+<p><a href="../../d7/d65/shortest__common__supersequence_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
@@ -135,7 +154,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:ad2ee8d7e67da9f6eb85146b08dad95e6" id="r_ad2ee8d7e67da9f6eb85146b08dad95e6"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad2ee8d7e67da9f6eb85146b08dad95e6">dynamic_programming::shortest_common_supersequence::scs</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str1, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str2)</td></tr>
+<tr class="memitem:ad2ee8d7e67da9f6eb85146b08dad95e6" id="r_ad2ee8d7e67da9f6eb85146b08dad95e6"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad2ee8d7e67da9f6eb85146b08dad95e6">dynamic_programming::shortest_common_supersequence::scs</a> (const std::string &amp;str1, const std::string &amp;str2)</td></tr>
 <tr class="separator:ad2ee8d7e67da9f6eb85146b08dad95e6"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
 <tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -149,6 +168,8 @@ Functions</h2></td></tr>
 <dl class="section see"><dt>See also</dt><dd>more on <a href="https://en.wikipedia.org/wiki/Shortest_common_supersequence_problem" target="_blank">SCS</a> </dd>
 <dd>
 related <a class="el" href="../../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" title="Problem statement for a system with first-order differential equations. Updates the system differenti...">problem</a> <a href="https://leetcode.com/problems/shortest-common-supersequence/" target="_blank">Leetcode</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d7/d65/shortest__common__supersequence_8cpp_source.html">shortest_common_supersequence.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -165,33 +186,27 @@ related <a class="el" href="../../db/dd3/ode__forward__euler_8cpp.html#abaeae8f6
       </table>
 </div><div class="memdoc">
 <p>Main function (driver code) </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d65/shortest__common__supersequence_8cpp_source.html#l00164">164</a> of file <a class="el" href="../../d7/d65/shortest__common__supersequence_8cpp_source.html">shortest_common_supersequence.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  164</span>           {</div>
 <div class="line"><span class="lineno">  165</span>    <span class="comment">// test for implementation</span></div>
 <div class="line"><span class="lineno">  166</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
 <div class="line"><span class="lineno">  167</span> </div>
 <div class="line"><span class="lineno">  168</span>    <span class="comment">// user input</span></div>
-<div class="line"><span class="lineno">  169</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s1, s2;</div>
-<div class="line"><span class="lineno">  170</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; s1;</div>
-<div class="line"><span class="lineno">  171</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; s2;</div>
+<div class="line"><span class="lineno">  169</span>    std::string s1, s2;</div>
+<div class="line"><span class="lineno">  170</span>    std::cin &gt;&gt; s1;</div>
+<div class="line"><span class="lineno">  171</span>    std::cin &gt;&gt; s2;</div>
 <div class="line"><span class="lineno">  172</span> </div>
-<div class="line"><span class="lineno">  173</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ans;</div>
+<div class="line"><span class="lineno">  173</span>    std::string ans;</div>
 <div class="line"><span class="lineno">  174</span> </div>
 <div class="line"><span class="lineno">  175</span>    <span class="comment">// user output</span></div>
 <div class="line"><span class="lineno">  176</span>    ans = <a class="code hl_function" href="#ad2ee8d7e67da9f6eb85146b08dad95e6">dynamic_programming::shortest_common_supersequence::scs</a>(s1, s2);</div>
-<div class="line"><span class="lineno">  177</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; ans;</div>
+<div class="line"><span class="lineno">  177</span>    std::cout &lt;&lt; ans;</div>
 <div class="line"><span class="lineno">  178</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  179</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="ashortest__common__supersequence_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> shortest_common_supersequence.cpp:124</div></div>
-<div class="ttc" id="ashortest__common__supersequence_8cpp_html_ad2ee8d7e67da9f6eb85146b08dad95e6"><div class="ttname"><a href="#ad2ee8d7e67da9f6eb85146b08dad95e6">dynamic_programming::shortest_common_supersequence::scs</a></div><div class="ttdeci">std::string scs(const std::string &amp;str1, const std::string &amp;str2)</div><div class="ttdef"><b>Definition</b> shortest_common_supersequence.cpp:42</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d65/shortest__common__supersequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ashortest__common__supersequence_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d65/shortest__common__supersequence_8cpp_source.html#l00124">shortest_common_supersequence.cpp:124</a></div></div>
+<div class="ttc" id="ashortest__common__supersequence_8cpp_html_ad2ee8d7e67da9f6eb85146b08dad95e6"><div class="ttname"><a href="#ad2ee8d7e67da9f6eb85146b08dad95e6">dynamic_programming::shortest_common_supersequence::scs</a></div><div class="ttdeci">std::string scs(const std::string &amp;str1, const std::string &amp;str2)</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d65/shortest__common__supersequence_8cpp_source.html#l00042">shortest_common_supersequence.cpp:42</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad2ee8d7e67da9f6eb85146b08dad95e6" name="ad2ee8d7e67da9f6eb85146b08dad95e6"></a>
@@ -201,14 +216,14 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> dynamic_programming::shortest_common_supersequence::scs </td>
+          <td class="memname">std::string dynamic_programming::shortest_common_supersequence::scs </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str1</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str1</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str2</em></span>&#160;)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str2</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -220,30 +235,32 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>string 'Z', superSequence of X and Y </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d65/shortest__common__supersequence_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d7/d65/shortest__common__supersequence_8cpp_source.html">shortest_common_supersequence.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   42</span>                                                                    {</div>
 <div class="line"><span class="lineno">   43</span> </div>
 <div class="line"><span class="lineno">   44</span>            <span class="comment">// Edge cases</span></div>
 <div class="line"><span class="lineno">   45</span>            <span class="comment">// If either str1 or str2 or both are empty</span></div>
-<div class="line"><span class="lineno">   46</span>            <span class="keywordflow">if</span>(str1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html">empty</a>() &amp;&amp; str2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html">empty</a>()) {</div>
+<div class="line"><span class="lineno">   46</span>            <span class="keywordflow">if</span>(str1.empty() &amp;&amp; str2.empty()) {</div>
 <div class="line"><span class="lineno">   47</span>                <span class="keywordflow">return</span> <span class="stringliteral">&quot;&quot;</span>;</div>
 <div class="line"><span class="lineno">   48</span>            }</div>
-<div class="line"><span class="lineno">   49</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span>(str1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html">empty</a>()) {</div>
+<div class="line"><span class="lineno">   49</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span>(str1.empty()) {</div>
 <div class="line"><span class="lineno">   50</span>                <span class="keywordflow">return</span> str2;</div>
 <div class="line"><span class="lineno">   51</span>            }</div>
-<div class="line"><span class="lineno">   52</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span>(str2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html">empty</a>()) {</div>
+<div class="line"><span class="lineno">   52</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span>(str2.empty()) {</div>
 <div class="line"><span class="lineno">   53</span>                <span class="keywordflow">return</span> str1;</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="comment">// creating lookup table</span></div>
-<div class="line"><span class="lineno">   57</span>            std::vector &lt;std::vector &lt;int&gt;&gt; lookup(str1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>() + 1, std::vector &lt;int&gt; (str2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>() + 1, 0));</div>
+<div class="line"><span class="lineno">   57</span>            std::vector &lt;std::vector &lt;int&gt;&gt; lookup(str1.length() + 1, std::vector &lt;int&gt; (str2.length() + 1, 0));</div>
 <div class="line"><span class="lineno">   58</span>      </div>
-<div class="line"><span class="lineno">   59</span>            <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=1; i &lt;= str1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>(); i++) {</div>
-<div class="line"><span class="lineno">   60</span>                <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=1; j &lt;= str2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>(); j++) {</div>
+<div class="line"><span class="lineno">   59</span>            <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=1; i &lt;= str1.length(); i++) {</div>
+<div class="line"><span class="lineno">   60</span>                <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=1; j &lt;= str2.length(); j++) {</div>
 <div class="line"><span class="lineno">   61</span>                    <span class="keywordflow">if</span>(str1[i-1] == str2[j-1]) {</div>
 <div class="line"><span class="lineno">   62</span>                        lookup[i][j] = lookup[i-1][j-1] + 1;</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>                        lookup[i][j] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(lookup[i-1][j], lookup[i][j-1]);</div>
+<div class="line"><span class="lineno">   65</span>                        lookup[i][j] = std::max(lookup[i-1][j], lookup[i][j-1]);</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>
@@ -251,27 +268,27 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   70</span>            <span class="comment">// making supersequence</span></div>
 <div class="line"><span class="lineno">   71</span>            <span class="comment">// i and j are initially pointed towards end of strings</span></div>
 <div class="line"><span class="lineno">   72</span>            <span class="comment">// Super-sequence will be constructed backwards</span></div>
-<div class="line"><span class="lineno">   73</span>            <span class="keywordtype">int</span> i=str1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>();</div>
-<div class="line"><span class="lineno">   74</span>            <span class="keywordtype">int</span> j=str2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>();</div>
-<div class="line"><span class="lineno">   75</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s;</div>
+<div class="line"><span class="lineno">   73</span>            <span class="keywordtype">int</span> i=str1.length();</div>
+<div class="line"><span class="lineno">   74</span>            <span class="keywordtype">int</span> j=str2.length();</div>
+<div class="line"><span class="lineno">   75</span>            std::string s;</div>
 <div class="line"><span class="lineno">   76</span>      </div>
 <div class="line"><span class="lineno">   77</span>            <span class="keywordflow">while</span>(i&gt;0 &amp;&amp; j&gt;0) {</div>
 <div class="line"><span class="lineno">   78</span> </div>
 <div class="line"><span class="lineno">   79</span>                <span class="comment">// If the characters at i and j of both strings are same</span></div>
 <div class="line"><span class="lineno">   80</span>                <span class="comment">// We only need to add them once in s</span></div>
 <div class="line"><span class="lineno">   81</span>                <span class="keywordflow">if</span>(str1[i-1] == str2[j-1]) {</div>
-<div class="line"><span class="lineno">   82</span>                    s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/push_back.html">push_back</a>(str1[i-1]);</div>
+<div class="line"><span class="lineno">   82</span>                    s.push_back(str1[i-1]);</div>
 <div class="line"><span class="lineno">   83</span>                    i--;</div>
 <div class="line"><span class="lineno">   84</span>                    j--;</div>
 <div class="line"><span class="lineno">   85</span>                }</div>
 <div class="line"><span class="lineno">   86</span>                <span class="comment">// otherwise we check lookup table for recurrences of characters</span></div>
 <div class="line"><span class="lineno">   87</span>                <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">   88</span>                    <span class="keywordflow">if</span>(lookup[i-1][j] &gt; lookup[i][j-1]) {</div>
-<div class="line"><span class="lineno">   89</span>                        s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/push_back.html">push_back</a>(str1[i-1]);</div>
+<div class="line"><span class="lineno">   89</span>                        s.push_back(str1[i-1]);</div>
 <div class="line"><span class="lineno">   90</span>                        i--;</div>
 <div class="line"><span class="lineno">   91</span>                    }</div>
 <div class="line"><span class="lineno">   92</span>                    <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   93</span>                        s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/push_back.html">push_back</a>(str2[j-1]);</div>
+<div class="line"><span class="lineno">   93</span>                        s.push_back(str2[j-1]);</div>
 <div class="line"><span class="lineno">   94</span>                        j--;</div>
 <div class="line"><span class="lineno">   95</span>                    }</div>
 <div class="line"><span class="lineno">   96</span>                }</div>
@@ -280,34 +297,22 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   99</span>            <span class="comment">// copying remaining elements</span></div>
 <div class="line"><span class="lineno">  100</span>            <span class="comment">// if j becomes 0 before i</span></div>
 <div class="line"><span class="lineno">  101</span>            <span class="keywordflow">while</span>(i &gt; 0) {</div>
-<div class="line"><span class="lineno">  102</span>                s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/push_back.html">push_back</a>(str1[i-1]);</div>
+<div class="line"><span class="lineno">  102</span>                s.push_back(str1[i-1]);</div>
 <div class="line"><span class="lineno">  103</span>                i--;</div>
 <div class="line"><span class="lineno">  104</span>            }</div>
 <div class="line"><span class="lineno">  105</span> </div>
 <div class="line"><span class="lineno">  106</span>            <span class="comment">// if i becomes 0 before j</span></div>
 <div class="line"><span class="lineno">  107</span>            <span class="keywordflow">while</span>(j &gt; 0) {</div>
-<div class="line"><span class="lineno">  108</span>                s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/push_back.html">push_back</a>(str2[j-1]);</div>
+<div class="line"><span class="lineno">  108</span>                s.push_back(str2[j-1]);</div>
 <div class="line"><span class="lineno">  109</span>                j--;</div>
 <div class="line"><span class="lineno">  110</span>            }</div>
 <div class="line"><span class="lineno">  111</span> </div>
 <div class="line"><span class="lineno">  112</span>            <span class="comment">// As the super sequence is constructd backwards</span></div>
 <div class="line"><span class="lineno">  113</span>            <span class="comment">// reversing the string before returning gives us the correct output  </span></div>
-<div class="line"><span class="lineno">  114</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">reverse</a>(s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">begin</a>(), s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">end</a>());</div>
+<div class="line"><span class="lineno">  114</span>            reverse(s.begin(), s.end());</div>
 <div class="line"><span class="lineno">  115</span>            <span class="keywordflow">return</span> s;</div>
 <div class="line"><span class="lineno">  116</span>        }</div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">std::string::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html">std::string::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">std::string::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/push_back.html">std::string::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="areverse_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a></div><div class="ttdeci">T reverse(T... args)</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::length</a></div><div class="ttdeci">T length(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d65/shortest__common__supersequence_8cpp_ad2ee8d7e67da9f6eb85146b08dad95e6_cgraph.svg" width="467" height="283"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -333,6 +338,8 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Test Function </p><dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d65/shortest__common__supersequence_8cpp_source.html#l00124">124</a> of file <a class="el" href="../../d7/d65/shortest__common__supersequence_8cpp_source.html">shortest_common_supersequence.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  124</span>                   {</div>
 <div class="line"><span class="lineno">  125</span>    <span class="comment">// custom input vector</span></div>
 <div class="line"><span class="lineno">  126</span>    std::vector &lt;std::vector &lt;std::string&gt;&gt; scsStrings {</div>
@@ -368,7 +375,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  156</span>        assert(expectedOutput[i] == calculatedOutput[i]);</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>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests passed successfully!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  159</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests passed successfully!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  160</span>    <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  161</span>}</div>
 </div><!-- fragment -->
diff --git a/d7/d65/shortest__common__supersequence_8cpp_ad2ee8d7e67da9f6eb85146b08dad95e6_cgraph.map b/d7/d65/shortest__common__supersequence_8cpp_ad2ee8d7e67da9f6eb85146b08dad95e6_cgraph.map
deleted file mode 100644
index cc7a3c9bd..000000000
--- a/d7/d65/shortest__common__supersequence_8cpp_ad2ee8d7e67da9f6eb85146b08dad95e6_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="dynamic_programming::shortest_common_supersequence::scs" name="dynamic_programming::shortest_common_supersequence::scs">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,122,263,162"/>
-<area shape="poly" id="edge7_Node000001_Node000001" title=" " alt="" coords="87,122,84,112,92,103,109,97,134,95,161,98,177,104,175,109,160,103,134,100,110,102,95,107,90,113,92,120"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/begin.html#" title=" " alt="" coords="327,5,445,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="166,119,231,80,310,40,323,34,325,39,312,45,234,85,169,124"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/empty.html#" title=" " alt="" coords="324,55,448,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="205,119,325,83,326,88,206,124"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/end.html#" title=" " alt="" coords="332,104,440,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="263,127,316,121,317,126,263,132"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="325,153,447,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="263,152,309,156,309,162,263,157"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="350,203,422,228"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="207,161,336,198,334,203,206,166"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/push_back.html#" title=" " alt="" coords="311,252,461,278"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="169,161,234,199,312,238,325,244,323,249,310,243,232,204,167,165"/>
-</map>
diff --git a/d7/d65/shortest__common__supersequence_8cpp_ad2ee8d7e67da9f6eb85146b08dad95e6_cgraph.md5 b/d7/d65/shortest__common__supersequence_8cpp_ad2ee8d7e67da9f6eb85146b08dad95e6_cgraph.md5
deleted file mode 100644
index 1de80aeeb..000000000
--- a/d7/d65/shortest__common__supersequence_8cpp_ad2ee8d7e67da9f6eb85146b08dad95e6_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e3820d5e5b4447537a5477ab355fc1bd
\ No newline at end of file
diff --git a/d7/d65/shortest__common__supersequence_8cpp_ad2ee8d7e67da9f6eb85146b08dad95e6_cgraph.svg b/d7/d65/shortest__common__supersequence_8cpp_ad2ee8d7e67da9f6eb85146b08dad95e6_cgraph.svg
deleted file mode 100644
index 3ff68700b..000000000
--- a/d7/d65/shortest__common__supersequence_8cpp_ad2ee8d7e67da9f6eb85146b08dad95e6_cgraph.svg
+++ /dev/null
@@ -1,165 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::shortest_common_supersequence::scs Pages: 1 -->
-<svg width="350pt" height="212pt"
- viewBox="0.00 0.00 349.75 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>dynamic_programming::shortest_common_supersequence::scs</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="193,-116.88 0,-116.88 0,-86.38 193,-86.38 193,-116.88"/>
-<text text-anchor="start" x="8" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="96.5" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">::shortest_common_supersequence::scs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge7_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge7_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.03,-117.36C56.2,-126.43 67.36,-134.88 96.5,-134.88 112.44,-134.88 123,-132.35 128.17,-128.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.61,-129.28 129.73,-118.86 124.69,-128.18 131.61,-129.28"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="329.75,-204.25 241,-204.25 241,-185 329.75,-185 329.75,-204.25"/>
-<text text-anchor="middle" x="285.38" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.44,-117.27C147.22,-133.63 189.82,-159.3 229,-176.62 232.18,-178.03 235.5,-179.38 238.88,-180.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.68,-183.96 248.28,-184.05 240.05,-177.37 237.68,-183.96"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="331.62,-167.25 239.12,-167.25 239.12,-148 331.62,-148 331.62,-167.25"/>
-<text text-anchor="middle" x="285.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.05,-117.37C178.42,-125.87 213.06,-136.25 240.05,-144.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.7,-147.59 249.29,-147.11 240.71,-140.89 238.7,-147.59"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="326,-130.25 244.75,-130.25 244.75,-111 326,-111 326,-130.25"/>
-<text text-anchor="middle" x="285.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.4,-111.38C207.26,-112.78 221.05,-114.19 233.54,-115.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.81,-118.9 243.11,-116.43 233.52,-111.94 232.81,-118.9"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="331.25,-93.25 239.5,-93.25 239.5,-74 331.25,-74 331.25,-93.25"/>
-<text text-anchor="middle" x="285.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.4,-92.39C205.12,-91.26 216.78,-90.14 227.65,-89.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.98,-92.57 237.6,-88.13 227.31,-85.61 227.98,-92.57"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312.5,-56.25 258.25,-56.25 258.25,-37 312.5,-37 312.5,-56.25"/>
-<text text-anchor="middle" x="285.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.8,-85.94C181.62,-76.87 219.62,-65.68 247.21,-57.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="247.91,-61.01 256.52,-54.82 245.93,-54.29 247.91,-61.01"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="341.75,-19.25 229,-19.25 229,0 341.75,0 341.75,-19.25"/>
-<text text-anchor="middle" x="285.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.95,-85.92C147.8,-69.78 190.14,-44.67 229,-27.62 232.18,-26.23 235.51,-24.88 238.89,-23.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="240.05,-26.9 248.29,-20.23 237.69,-20.31 240.05,-26.9"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d65/shortest__common__supersequence_8cpp_ad2ee8d7e67da9f6eb85146b08dad95e6_cgraph_org.svg b/d7/d65/shortest__common__supersequence_8cpp_ad2ee8d7e67da9f6eb85146b08dad95e6_cgraph_org.svg
deleted file mode 100644
index f0cea9cb0..000000000
--- a/d7/d65/shortest__common__supersequence_8cpp_ad2ee8d7e67da9f6eb85146b08dad95e6_cgraph_org.svg
+++ /dev/null
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::shortest_common_supersequence::scs Pages: 1 -->
-<svg width="350pt" height="212pt"
- viewBox="0.00 0.00 349.75 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>dynamic_programming::shortest_common_supersequence::scs</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="193,-116.88 0,-116.88 0,-86.38 193,-86.38 193,-116.88"/>
-<text text-anchor="start" x="8" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="96.5" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">::shortest_common_supersequence::scs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge7_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge7_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.03,-117.36C56.2,-126.43 67.36,-134.88 96.5,-134.88 112.44,-134.88 123,-132.35 128.17,-128.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.61,-129.28 129.73,-118.86 124.69,-128.18 131.61,-129.28"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="329.75,-204.25 241,-204.25 241,-185 329.75,-185 329.75,-204.25"/>
-<text text-anchor="middle" x="285.38" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.44,-117.27C147.22,-133.63 189.82,-159.3 229,-176.62 232.18,-178.03 235.5,-179.38 238.88,-180.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.68,-183.96 248.28,-184.05 240.05,-177.37 237.68,-183.96"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="331.62,-167.25 239.12,-167.25 239.12,-148 331.62,-148 331.62,-167.25"/>
-<text text-anchor="middle" x="285.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.05,-117.37C178.42,-125.87 213.06,-136.25 240.05,-144.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.7,-147.59 249.29,-147.11 240.71,-140.89 238.7,-147.59"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="326,-130.25 244.75,-130.25 244.75,-111 326,-111 326,-130.25"/>
-<text text-anchor="middle" x="285.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.4,-111.38C207.26,-112.78 221.05,-114.19 233.54,-115.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.81,-118.9 243.11,-116.43 233.52,-111.94 232.81,-118.9"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="331.25,-93.25 239.5,-93.25 239.5,-74 331.25,-74 331.25,-93.25"/>
-<text text-anchor="middle" x="285.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.4,-92.39C205.12,-91.26 216.78,-90.14 227.65,-89.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.98,-92.57 237.6,-88.13 227.31,-85.61 227.98,-92.57"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312.5,-56.25 258.25,-56.25 258.25,-37 312.5,-37 312.5,-56.25"/>
-<text text-anchor="middle" x="285.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.8,-85.94C181.62,-76.87 219.62,-65.68 247.21,-57.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="247.91,-61.01 256.52,-54.82 245.93,-54.29 247.91,-61.01"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="341.75,-19.25 229,-19.25 229,0 341.75,0 341.75,-19.25"/>
-<text text-anchor="middle" x="285.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.95,-85.92C147.8,-69.78 190.14,-44.67 229,-27.62 232.18,-26.23 235.51,-24.88 238.89,-23.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="240.05,-26.9 248.29,-20.23 237.69,-20.31 240.05,-26.9"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d65/shortest__common__supersequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d7/d65/shortest__common__supersequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 177d5eea1..000000000
--- a/d7/d65/shortest__common__supersequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title=" " alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d7/d65/shortest__common__supersequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d7/d65/shortest__common__supersequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 4a50d40c0..000000000
--- a/d7/d65/shortest__common__supersequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cb9aaf639f146bdb8372270c898051b0
\ No newline at end of file
diff --git a/d7/d65/shortest__common__supersequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d7/d65/shortest__common__supersequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 177d0c4f7..000000000
--- a/d7/d65/shortest__common__supersequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d65/shortest__common__supersequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d7/d65/shortest__common__supersequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 65731a0a3..000000000
--- a/d7/d65/shortest__common__supersequence_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d65/shortest__common__supersequence_8cpp_source.html b/d7/d65/shortest__common__supersequence_8cpp_source.html
new file mode 100644
index 000000000..45fd5703b
--- /dev/null
+++ b/d7/d65/shortest__common__supersequence_8cpp_source.html
@@ -0,0 +1,293 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/shortest_common_supersequence.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/d65/shortest__common__supersequence_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">shortest_common_supersequence.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d7/d65/shortest__common__supersequence_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment">// header files</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;string&gt;</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a> {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keyword">namespace </span><a class="code hl_namespace" href="../../d3/deb/namespaceshortest__common__supersequence.html">shortest_common_supersequence</a> {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        </div>
+<div class="foldopen" id="foldopen00042" data-start="{" data-end="}">
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../d7/d65/shortest__common__supersequence_8cpp.html#ad2ee8d7e67da9f6eb85146b08dad95e6">   42</a></span>        std::string <a class="code hl_function" href="../../d7/d65/shortest__common__supersequence_8cpp.html#ad2ee8d7e67da9f6eb85146b08dad95e6">scs</a>(<span class="keyword">const</span> std::string &amp;str1, <span class="keyword">const</span> std::string &amp;str2) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>            <span class="comment">// Edge cases</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>            <span class="comment">// If either str1 or str2 or both are empty</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            <span class="keywordflow">if</span>(str1.empty() &amp;&amp; str2.empty()) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>                <span class="keywordflow">return</span> <span class="stringliteral">&quot;&quot;</span>;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span>(str1.empty()) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>                <span class="keywordflow">return</span> str2;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>            }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span>(str2.empty()) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>                <span class="keywordflow">return</span> str1;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            <span class="comment">// creating lookup table</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            std::vector &lt;std::vector &lt;int&gt;&gt; lookup(str1.length() + 1, std::vector &lt;int&gt; (str2.length() + 1, 0));</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>      </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=1; i &lt;= str1.length(); i++) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>                <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j=1; j &lt;= str2.length(); j++) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>                    <span class="keywordflow">if</span>(str1[i-1] == str2[j-1]) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>                        lookup[i][j] = lookup[i-1][j-1] + 1;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>                    }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>                    <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>                        lookup[i][j] = std::max(lookup[i-1][j], lookup[i][j-1]);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>                    }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>                }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            <span class="comment">// making supersequence</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>            <span class="comment">// i and j are initially pointed towards end of strings</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            <span class="comment">// Super-sequence will be constructed backwards</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            <span class="keywordtype">int</span> i=str1.length();</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            <span class="keywordtype">int</span> j=str2.length();</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            std::string s;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>      </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            <span class="keywordflow">while</span>(i&gt;0 &amp;&amp; j&gt;0) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>                <span class="comment">// If the characters at i and j of both strings are same</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>                <span class="comment">// We only need to add them once in s</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>                <span class="keywordflow">if</span>(str1[i-1] == str2[j-1]) {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>                    s.push_back(str1[i-1]);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>                    i--;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>                    j--;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>                }</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>                <span class="comment">// otherwise we check lookup table for recurrences of characters</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>                <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>                    <span class="keywordflow">if</span>(lookup[i-1][j] &gt; lookup[i][j-1]) {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>                        s.push_back(str1[i-1]);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>                        i--;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>                    }</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>                    <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>                        s.push_back(str2[j-1]);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>                        j--;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>                    }</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>                }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            }</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span> </div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>            <span class="comment">// copying remaining elements</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>            <span class="comment">// if j becomes 0 before i</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>            <span class="keywordflow">while</span>(i &gt; 0) {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>                s.push_back(str1[i-1]);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>                i--;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>            }</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>            <span class="comment">// if i becomes 0 before j</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>            <span class="keywordflow">while</span>(j &gt; 0) {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>                s.push_back(str2[j-1]);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>                j--;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>            }</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>            <span class="comment">// As the super sequence is constructd backwards</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>            <span class="comment">// reversing the string before returning gives us the correct output  </span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>            reverse(s.begin(), s.end());</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>            <span class="keywordflow">return</span> s;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        }</div>
+</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    } <span class="comment">// namespace shortest_common_supersequence</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>} <span class="comment">// namespace dynamic_programming</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
+<div class="foldopen" id="foldopen00124" data-start="{" data-end="}">
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"><a class="line" href="../../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  124</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    <span class="comment">// custom input vector</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    std::vector &lt;std::vector &lt;std::string&gt;&gt; scsStrings {</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        {<span class="stringliteral">&quot;ABCXYZ&quot;</span>, <span class="stringliteral">&quot;ABZ&quot;</span>},</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        {<span class="stringliteral">&quot;ABZ&quot;</span>, <span class="stringliteral">&quot;ABCXYZ&quot;</span>},</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        {<span class="stringliteral">&quot;AGGTAB&quot;</span>, <span class="stringliteral">&quot;GXTXAYB&quot;</span>},</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        {<span class="stringliteral">&quot;X&quot;</span>, <span class="stringliteral">&quot;Y&quot;</span>},</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    };</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <span class="comment">// calculated output vector by scs function</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    std::vector &lt;std::string&gt; calculatedOutput(4, <span class="stringliteral">&quot;&quot;</span>);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <span class="keywordtype">int</span> i=0;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    <span class="keywordflow">for</span>(<span class="keyword">auto</span> &amp; scsString : scsStrings) {</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        </div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>        calculatedOutput[i] = dynamic_programming::shortest_common_supersequence::scs(</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>            scsString[0], scsString[1]</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        );</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        i++;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    }</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span> </div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <span class="comment">// expected output vector acc to problem statement</span></div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    std::vector &lt;std::string&gt; expectedOutput {</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        <span class="stringliteral">&quot;ABCXYZ&quot;</span>,</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        <span class="stringliteral">&quot;ABCXYZ&quot;</span>,</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        <span class="stringliteral">&quot;AGGXTXAYB&quot;</span>,</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        <span class="stringliteral">&quot;XY&quot;</span></div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    };</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    <span class="comment">// Testing implementation via assert function</span></div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    <span class="comment">// It will throw error if any of the expected test fails</span></div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <span class="comment">// Else it will give nothing</span></div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0; i &lt; scsStrings.size(); i++) {</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>        assert(expectedOutput[i] == calculatedOutput[i]);</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    }</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span> </div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests passed successfully!\n&quot;</span>;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>}</div>
+</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span> </div>
+<div class="foldopen" id="foldopen00164" data-start="{" data-end="}">
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"><a class="line" href="../../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  164</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    <span class="comment">// test for implementation</span></div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    <a class="code hl_function" href="../../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span> </div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    <span class="comment">// user input</span></div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    std::string s1, s2;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    std::cin &gt;&gt; s1;</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    std::cin &gt;&gt; s2;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span> </div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    std::string ans;</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span> </div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    <span class="comment">// user output</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    ans = dynamic_programming::shortest_common_supersequence::scs(s1, s2);</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    std::cout &lt;&lt; ans;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>}</div>
+</div>
+<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
+<div class="ttc" id="anamespaceshortest__common__supersequence_html"><div class="ttname"><a href="../../d3/deb/namespaceshortest__common__supersequence.html">shortest_common_supersequence</a></div><div class="ttdoc">Shortest Common Super Sequence algorithm.</div></div>
+<div class="ttc" id="ashortest__common__supersequence_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00124">shortest_common_supersequence.cpp:124</a></div></div>
+<div class="ttc" id="ashortest__common__supersequence_8cpp_html_ad2ee8d7e67da9f6eb85146b08dad95e6"><div class="ttname"><a href="../../d7/d65/shortest__common__supersequence_8cpp.html#ad2ee8d7e67da9f6eb85146b08dad95e6">dynamic_programming::shortest_common_supersequence::scs</a></div><div class="ttdeci">std::string scs(const std::string &amp;str1, const std::string &amp;str2)</div><div class="ttdef"><b>Definition</b> <a href="#l00042">shortest_common_supersequence.cpp:42</a></div></div>
+<div class="ttc" id="ashortest__common__supersequence_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00164">shortest_common_supersequence.cpp:164</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../d7/d65/shortest__common__supersequence_8cpp.html">shortest_common_supersequence.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/d6a/bisection__method_8cpp.html b/d7/d6a/bisection__method_8cpp.html
index a8c85e64c..db9b3a056 100644
--- a/d7/d6a/bisection__method_8cpp.html
+++ b/d7/d6a/bisection__method_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/bisection_method.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/bisection_method.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,14 +138,15 @@ Include dependency graph for bisection_method.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dd9/bisection__method_8cpp__incl.svg" width="239" height="126"><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">
+</div>
+<p><a href="../../d7/d6a/bisection__method_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="define-members" name="define-members"></a>
 Macros</h2></td></tr>
 <tr class="memitem:a002b2f4894492820fe708b1b7e7c5e70" id="r_a002b2f4894492820fe708b1b7e7c5e70"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>&#160;&#160;&#160;    1e-6</td></tr>
 <tr class="separator:a002b2f4894492820fe708b1b7e7c5e70"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0a3abbca80bc98e7abcb3ae73abe0f14" id="r_a0a3abbca80bc98e7abcb3ae73abe0f14"><td class="memItemLeft" align="right" valign="top"><a id="a0a3abbca80bc98e7abcb3ae73abe0f14" name="a0a3abbca80bc98e7abcb3ae73abe0f14"></a>
-#define&#160;</td><td class="memItemRight" valign="bottom"><b>MAX_ITERATIONS</b>&#160;&#160;&#160;50000</td></tr>
-<tr class="memdesc:a0a3abbca80bc98e7abcb3ae73abe0f14"><td class="mdescLeft">&#160;</td><td class="mdescRight">Maximum number of iterations to check. <br /></td></tr>
+<tr class="memitem:a0a3abbca80bc98e7abcb3ae73abe0f14" id="r_a0a3abbca80bc98e7abcb3ae73abe0f14"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0a3abbca80bc98e7abcb3ae73abe0f14">MAX_ITERATIONS</a>&#160;&#160;&#160;50000</td></tr>
+<tr class="memdesc:a0a3abbca80bc98e7abcb3ae73abe0f14"><td class="mdescLeft">&#160;</td><td class="mdescRight">Maximum number of iterations to check.  <br /></td></tr>
 <tr class="separator:a0a3abbca80bc98e7abcb3ae73abe0f14"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
@@ -150,6 +168,8 @@ x_{i+1} = \frac{a_i+b_i}{2}
 </p>
 <p> For the next iteration, the interval is selected as: \([a,x]\) if \(x&gt;0\) or \([x,b]\) if \(x&lt;0\). The Process is continued till a close enough approximation is achieved.</p>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../de/dd3/newton__raphson__method_8cpp.html" title="Solve the equation  using Newton-Raphson method for both real and complex solutions.">newton_raphson_method.cpp</a>, <a class="el" href="../../dd/d29/false__position_8cpp.html" title="Solve the equation  using false position method, also known as the Secant method.">false_position.cpp</a>, secant_method.cpp </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d7/d6a/bisection__method_8cpp_source.html">bisection_method.cpp</a>.</p>
 </div><h2 class="groupheader">Macro Definition Documentation</h2>
 <a id="a002b2f4894492820fe708b1b7e7c5e70" name="a002b2f4894492820fe708b1b7e7c5e70"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a002b2f4894492820fe708b1b7e7c5e70">&#9670;&#160;</a></span>EPSILON</h2>
@@ -162,9 +182,29 @@ x_{i+1} = \frac{a_i+b_i}{2}
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d6a/bisection__method_8cpp_source.html#l00020">20</a> of file <a class="el" href="../../d7/d6a/bisection__method_8cpp_source.html">bisection_method.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   20</span><span class="preprocessor">#define EPSILON \</span></div>
 <div class="line"><span class="lineno">   21</span><span class="preprocessor">    1e-6  </span><span class="comment">// std::numeric_limits&lt;double&gt;::epsilon()  ///&lt; system accuracy limit</span></div>
 </div><!-- fragment -->
+</div>
+</div>
+<a id="a0a3abbca80bc98e7abcb3ae73abe0f14" name="a0a3abbca80bc98e7abcb3ae73abe0f14"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a0a3abbca80bc98e7abcb3ae73abe0f14">&#9670;&#160;</a></span>MAX_ITERATIONS</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">#define MAX_ITERATIONS&#160;&#160;&#160;50000</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Maximum number of iterations to check. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d6a/bisection__method_8cpp_source.html#l00022">22</a> of file <a class="el" href="../../d7/d6a/bisection__method_8cpp_source.html">bisection_method.cpp</a>.</p>
+
 </div>
 </div>
 <h2 class="groupheader">Function Documentation</h2>
@@ -191,16 +231,12 @@ x_{i+1} = \frac{a_i+b_i}{2}
 </table>
 </div><div class="memdoc">
 <p>define \(f(x)\) to find root for </p>
-<div class="fragment"><div class="line"><span class="lineno">   26</span>                           {</div>
-<div class="line"><span class="lineno">   27</span>    <span class="keywordflow">return</span> (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(i, 3) - (4 * i) - 9);  <span class="comment">// original equation</span></div>
-<div class="line"><span class="lineno">   28</span>}</div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg" width="168" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d7/d6a/bisection__method_8cpp_source.html#l00026">26</a> of file <a class="el" href="../../d7/d6a/bisection__method_8cpp_source.html">bisection_method.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   26</span>                           {</div>
+<div class="line"><span class="lineno">   27</span>    <span class="keywordflow">return</span> (std::pow(i, 3) - (4 * i) - 9);  <span class="comment">// original equation</span></div>
+<div class="line"><span class="lineno">   28</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -218,6 +254,8 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d6a/bisection__method_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../d7/d6a/bisection__method_8cpp_source.html">bisection_method.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   37</span>           {</div>
 <div class="line"><span class="lineno">   38</span>    <span class="keywordtype">double</span> a = -1, b = 1, x, z;</div>
 <div class="line"><span class="lineno">   39</span>    <span class="keywordtype">int</span> i;</div>
@@ -234,14 +272,14 @@ Here is the call graph for this function:</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> </div>
-<div class="line"><span class="lineno">   53</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nFirst initial: &quot;</span> &lt;&lt; a;</div>
-<div class="line"><span class="lineno">   54</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nSecond initial: &quot;</span> &lt;&lt; b;</div>
+<div class="line"><span class="lineno">   53</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nFirst initial: &quot;</span> &lt;&lt; a;</div>
+<div class="line"><span class="lineno">   54</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nSecond initial: &quot;</span> &lt;&lt; b;</div>
 <div class="line"><span class="lineno">   55</span> </div>
 <div class="line"><span class="lineno">   56</span>    <span class="comment">// start iterations</span></div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_define" href="#a0a3abbca80bc98e7abcb3ae73abe0f14">MAX_ITERATIONS</a>; i++) {</div>
 <div class="line"><span class="lineno">   58</span>        x = (a + b) / 2;</div>
 <div class="line"><span class="lineno">   59</span>        z = <a class="code hl_function" href="#a2003b5b2dcfff0769b957ab5c968b03d">eq</a>(x);</div>
-<div class="line"><span class="lineno">   60</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n\nz: &quot;</span> &lt;&lt; z &lt;&lt; <span class="stringliteral">&quot;\t[&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot; , &quot;</span> &lt;&lt; b</div>
+<div class="line"><span class="lineno">   60</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n\nz: &quot;</span> &lt;&lt; z &lt;&lt; <span class="stringliteral">&quot;\t[&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot; , &quot;</span> &lt;&lt; b</div>
 <div class="line"><span class="lineno">   61</span>                  &lt;&lt; <span class="stringliteral">&quot; | Bisect: &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;]&quot;</span>;</div>
 <div class="line"><span class="lineno">   62</span> </div>
 <div class="line"><span class="lineno">   63</span>        <span class="keywordflow">if</span> (z &lt; 0) {</div>
@@ -254,20 +292,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   70</span>            <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">   71</span>    }</div>
 <div class="line"><span class="lineno">   72</span> </div>
-<div class="line"><span class="lineno">   73</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n\nRoot: &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;\t\tSteps: &quot;</span> &lt;&lt; i &lt;&lt; <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">   73</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n\nRoot: &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;\t\tSteps: &quot;</span> &lt;&lt; i &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   74</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   75</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="abisection__method_8cpp_html_a0a3abbca80bc98e7abcb3ae73abe0f14"><div class="ttname"><a href="#a0a3abbca80bc98e7abcb3ae73abe0f14">MAX_ITERATIONS</a></div><div class="ttdeci">#define MAX_ITERATIONS</div><div class="ttdoc">Maximum number of iterations to check.</div><div class="ttdef"><b>Definition</b> bisection_method.cpp:22</div></div>
-<div class="ttc" id="abisection__method_8cpp_html_a1ab31b90bc584c635ec159468ceed9b2"><div class="ttname"><a href="#a1ab31b90bc584c635ec159468ceed9b2">sgn</a></div><div class="ttdeci">int sgn(T val)</div><div class="ttdef"><b>Definition</b> bisection_method.cpp:32</div></div>
-<div class="ttc" id="abisection__method_8cpp_html_a2003b5b2dcfff0769b957ab5c968b03d"><div class="ttname"><a href="#a2003b5b2dcfff0769b957ab5c968b03d">eq</a></div><div class="ttdeci">static double eq(double i)</div><div class="ttdef"><b>Definition</b> bisection_method.cpp:26</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><!-- 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="../../d7/d6a/bisection__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="299" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="abisection__method_8cpp_html_a0a3abbca80bc98e7abcb3ae73abe0f14"><div class="ttname"><a href="#a0a3abbca80bc98e7abcb3ae73abe0f14">MAX_ITERATIONS</a></div><div class="ttdeci">#define MAX_ITERATIONS</div><div class="ttdoc">Maximum number of iterations to check.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d6a/bisection__method_8cpp_source.html#l00022">bisection_method.cpp:22</a></div></div>
+<div class="ttc" id="abisection__method_8cpp_html_a1ab31b90bc584c635ec159468ceed9b2"><div class="ttname"><a href="#a1ab31b90bc584c635ec159468ceed9b2">sgn</a></div><div class="ttdeci">int sgn(T val)</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d6a/bisection__method_8cpp_source.html#l00032">bisection_method.cpp:32</a></div></div>
+<div class="ttc" id="abisection__method_8cpp_html_a2003b5b2dcfff0769b957ab5c968b03d"><div class="ttname"><a href="#a2003b5b2dcfff0769b957ab5c968b03d">eq</a></div><div class="ttdeci">static double eq(double i)</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d6a/bisection__method_8cpp_source.html#l00026">bisection_method.cpp:26</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1ab31b90bc584c635ec159468ceed9b2" name="a1ab31b90bc584c635ec159468ceed9b2"></a>
@@ -287,6 +318,8 @@ template&lt;typename T &gt; </div>
       </table>
 </div><div class="memdoc">
 <p>get the sign of any given number </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d6a/bisection__method_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../d7/d6a/bisection__method_8cpp_source.html">bisection_method.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   32</span>               {</div>
 <div class="line"><span class="lineno">   33</span>    <span class="keywordflow">return</span> (T(0) &lt; val) - (val &lt; T(0));</div>
 <div class="line"><span class="lineno">   34</span>}</div>
diff --git a/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map b/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map
deleted file mode 100644
index cea381859..000000000
--- a/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="eq" name="eq">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,44,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="92,5,163,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="44,16,76,16,76,21,44,21"/>
-</map>
diff --git a/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 b/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5
deleted file mode 100644
index 322f63d1e..000000000
--- a/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4354e7c666481f9ddcf69bc9fb092577
\ No newline at end of file
diff --git a/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg b/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg
deleted file mode 100644
index acc81ae0a..000000000
--- a/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: eq Pages: 1 -->
-<svg width="126pt" height="27pt"
- viewBox="0.00 0.00 126.30 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>eq</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="28.8,-19.25 0,-19.25 0,0 28.8,0 28.8,-19.25"/>
-<text text-anchor="middle" x="14.4" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">eq</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="118.3,-19.25 64.8,-19.25 64.8,0 118.3,0 118.3,-19.25"/>
-<text text-anchor="middle" x="91.55" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.18,-9.62C35.94,-9.62 44.45,-9.62 52.95,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="52.87,-13.13 62.87,-9.63 52.87,-6.13 52.87,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph_org.svg b/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph_org.svg
deleted file mode 100644
index 573541779..000000000
--- a/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: eq Pages: 1 -->
-<svg width="126pt" height="27pt"
- viewBox="0.00 0.00 126.30 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>eq</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="28.8,-19.25 0,-19.25 0,0 28.8,0 28.8,-19.25"/>
-<text text-anchor="middle" x="14.4" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">eq</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="118.3,-19.25 64.8,-19.25 64.8,0 118.3,0 118.3,-19.25"/>
-<text text-anchor="middle" x="91.55" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.18,-9.62C35.94,-9.62 44.45,-9.62 52.95,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="52.87,-13.13 62.87,-9.63 52.87,-6.13 52.87,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d6a/bisection__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d7/d6a/bisection__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 9da56e560..000000000
--- a/d7/d6a/bisection__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,55,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,54,93,36,95,41,56,59"/>
-<area shape="rect" id="Node000003" href="$d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d" title=" " alt="" coords="119,55,158,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,65,104,65,104,70,55,70"/>
-<area shape="rect" id="Node000005" href="$d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2" title=" " alt="" coords="117,104,160,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="56,76,104,98,102,103,54,81"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="222,55,293,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="158,65,207,65,207,70,158,70"/>
-</map>
diff --git a/d7/d6a/bisection__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d7/d6a/bisection__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 35b7abc58..000000000
--- a/d7/d6a/bisection__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f99f7015dbfced5e93bbceaa1438ab94
\ No newline at end of file
diff --git a/d7/d6a/bisection__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d7/d6a/bisection__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 89efd9f81..000000000
--- a/d7/d6a/bisection__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="224pt" height="101pt"
- viewBox="0.00 0.00 224.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-93.25 73,-93.25 73,-74 126.5,-74 126.5,-93.25"/>
-<text text-anchor="middle" x="99.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-55.02C46.14,-59.06 56.77,-64.03 66.74,-68.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.26,-71.85 75.8,-72.91 68.22,-65.51 65.26,-71.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="114.15,-56.25 85.35,-56.25 85.35,-37 114.15,-37 114.15,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">eq</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-46.62C48.19,-46.62 61.95,-46.62 73.71,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.52,-50.13 83.52,-46.63 73.52,-43.13 73.52,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="115.62,-19.25 83.88,-19.25 83.88,0 115.62,0 115.62,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sgn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-38.23C48,-33.32 61.46,-27.03 73.08,-21.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.55,-24.78 82.13,-17.38 71.59,-18.44 74.55,-24.78"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216,-56.25 162.5,-56.25 162.5,-37 216,-37 216,-56.25"/>
-<text text-anchor="middle" x="189.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.42,-46.62C124.31,-46.62 138.17,-46.62 151.22,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.84,-50.13 160.84,-46.63 150.84,-43.13 150.84,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d6a/bisection__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d7/d6a/bisection__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 0c75051f9..000000000
--- a/d7/d6a/bisection__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="224pt" height="101pt"
- viewBox="0.00 0.00 224.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-93.25 73,-93.25 73,-74 126.5,-74 126.5,-93.25"/>
-<text text-anchor="middle" x="99.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-55.02C46.14,-59.06 56.77,-64.03 66.74,-68.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.26,-71.85 75.8,-72.91 68.22,-65.51 65.26,-71.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="114.15,-56.25 85.35,-56.25 85.35,-37 114.15,-37 114.15,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">eq</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-46.62C48.19,-46.62 61.95,-46.62 73.71,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.52,-50.13 83.52,-46.63 73.52,-43.13 73.52,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="115.62,-19.25 83.88,-19.25 83.88,0 115.62,0 115.62,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sgn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-38.23C48,-33.32 61.46,-27.03 73.08,-21.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.55,-24.78 82.13,-17.38 71.59,-18.44 74.55,-24.78"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216,-56.25 162.5,-56.25 162.5,-37 216,-37 216,-56.25"/>
-<text text-anchor="middle" x="189.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.42,-46.62C124.31,-46.62 138.17,-46.62 151.22,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.84,-50.13 160.84,-46.63 150.84,-43.13 150.84,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d6a/bisection__method_8cpp_source.html b/d7/d6a/bisection__method_8cpp_source.html
new file mode 100644
index 000000000..51f2c0180
--- /dev/null
+++ b/d7/d6a/bisection__method_8cpp_source.html
@@ -0,0 +1,204 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/bisection_method.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/d6a/bisection__method_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">bisection_method.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d7/d6a/bisection__method_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;limits&gt;</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#define EPSILON \</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">    1e-6  </span><span class="comment">// std::numeric_limits&lt;double&gt;::epsilon()  ///&lt; system accuracy limit</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"><a class="line" href="../../d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">   22</a></span><span class="preprocessor">#define MAX_ITERATIONS 50000  </span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="foldopen" id="foldopen00026" data-start="{" data-end="}">
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"><a class="line" href="../../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d">   26</a></span><span class="keyword">static</span> <span class="keywordtype">double</span> <a class="code hl_function" href="../../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d">eq</a>(<span class="keywordtype">double</span> i) {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordflow">return</span> (std::pow(i, 3) - (4 * i) - 9);  <span class="comment">// original equation</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>}</div>
+</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00032" data-start="{" data-end="}">
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2">   32</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2">sgn</a>(T val) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordflow">return</span> (T(0) &lt; val) - (val &lt; T(0));</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>}</div>
+</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="}">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   37</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordtype">double</span> a = -1, b = 1, x, z;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordtype">int</span> i;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="comment">// loop to find initial intervals a, b</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_define" href="../../d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">MAX_ITERATIONS</a>; i++) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        z = <a class="code hl_function" href="../../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d">eq</a>(a);</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        x = <a class="code hl_function" href="../../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d">eq</a>(b);</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2">sgn</a>(z) == <a class="code hl_function" href="../../d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2">sgn</a>(x)) {  <span class="comment">// same signs, increase interval</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            b++;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            a--;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        } <span class="keywordflow">else</span> {  <span class="comment">// if opposite signs, we got our interval</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nFirst initial: &quot;</span> &lt;&lt; a;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nSecond initial: &quot;</span> &lt;&lt; b;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="comment">// start iterations</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_define" href="../../d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">MAX_ITERATIONS</a>; i++) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        x = (a + b) / 2;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        z = <a class="code hl_function" href="../../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d">eq</a>(x);</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n\nz: &quot;</span> &lt;&lt; z &lt;&lt; <span class="stringliteral">&quot;\t[&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot; , &quot;</span> &lt;&lt; b</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>                  &lt;&lt; <span class="stringliteral">&quot; | Bisect: &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;]&quot;</span>;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">if</span> (z &lt; 0) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            a = x;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            b = x;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        <span class="keywordflow">if</span> (std::abs(z) &lt; EPSILON)  <span class="comment">// stoping criteria</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n\nRoot: &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;\t\tSteps: &quot;</span> &lt;&lt; i &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>}</div>
+</div>
+<div class="ttc" id="abisection__method_8cpp_html_a0a3abbca80bc98e7abcb3ae73abe0f14"><div class="ttname"><a href="../../d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">MAX_ITERATIONS</a></div><div class="ttdeci">#define MAX_ITERATIONS</div><div class="ttdoc">Maximum number of iterations to check.</div><div class="ttdef"><b>Definition</b> <a href="#l00022">bisection_method.cpp:22</a></div></div>
+<div class="ttc" id="abisection__method_8cpp_html_a1ab31b90bc584c635ec159468ceed9b2"><div class="ttname"><a href="../../d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2">sgn</a></div><div class="ttdeci">int sgn(T val)</div><div class="ttdef"><b>Definition</b> <a href="#l00032">bisection_method.cpp:32</a></div></div>
+<div class="ttc" id="abisection__method_8cpp_html_a2003b5b2dcfff0769b957ab5c968b03d"><div class="ttname"><a href="../../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d">eq</a></div><div class="ttdeci">static double eq(double i)</div><div class="ttdef"><b>Definition</b> <a href="#l00026">bisection_method.cpp:26</a></div></div>
+<div class="ttc" id="abisection__method_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00037">bisection_method.cpp:37</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../d7/d6a/bisection__method_8cpp.html">bisection_method.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/d73/abbreviation_8cpp.html b/d7/d73/abbreviation_8cpp.html
index fbb34979c..5a8e5da30 100644
--- a/d7/d73/abbreviation_8cpp.html
+++ b/d7/d73/abbreviation_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/abbreviation.cpp File Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming/abbreviation.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for abbreviation.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d76/abbreviation_8cpp__incl.svg" width="415" height="126"><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">
+</div>
+<p><a href="../../d7/d73/abbreviation_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
@@ -135,10 +154,10 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:add60b8858720bf217df22d992d0fefaa" id="r_add60b8858720bf217df22d992d0fefaa"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; &gt; *memo, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; &gt; *visited, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;result, uint32_t str_idx=0, uint32_t result_idx=0)</td></tr>
+<tr class="memitem:add60b8858720bf217df22d992d0fefaa" id="r_add60b8858720bf217df22d992d0fefaa"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a> (std::vector&lt; std::vector&lt; bool &gt; &gt; *memo, std::vector&lt; std::vector&lt; bool &gt; &gt; *visited, const std::string &amp;str, const std::string &amp;result, uint32_t str_idx=0, uint32_t result_idx=0)</td></tr>
 <tr class="memdesc:add60b8858720bf217df22d992d0fefaa"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive Dynamic Programming function.  <br /></td></tr>
 <tr class="separator:add60b8858720bf217df22d992d0fefaa"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af53b2f647bee9c5b75ef8dd9ef685dc8" id="r_af53b2f647bee9c5b75ef8dd9ef685dc8"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;result)</td></tr>
+<tr class="memitem:af53b2f647bee9c5b75ef8dd9ef685dc8" id="r_af53b2f647bee9c5b75ef8dd9ef685dc8"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a> (const std::string &amp;str, const std::string &amp;result)</td></tr>
 <tr class="memdesc:af53b2f647bee9c5b75ef8dd9ef685dc8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Iterative Dynamic Programming function.  <br /></td></tr>
 <tr class="separator:af53b2f647bee9c5b75ef8dd9ef685dc8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -162,6 +181,8 @@ Algorithm</h3>
 <li>If the <code>a[i]</code> is not uppercase, just discard that character, else return <code>false</code></li>
 </ol>
 <p>Time Complexity: (O(|a|*|b|)) where <code>|a|</code> =&gt; length of string <code>a</code> </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AshishYUO" target="_blank">Ashish Daulatabad</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html">abbreviation.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="af53b2f647bee9c5b75ef8dd9ef685dc8" name="af53b2f647bee9c5b75ef8dd9ef685dc8"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#af53b2f647bee9c5b75ef8dd9ef685dc8">&#9670;&#160;</a></span>abbreviation()</h2>
@@ -172,12 +193,12 @@ Algorithm</h3>
         <tr>
           <td class="memname">bool dynamic_programming::abbreviation::abbreviation </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>result</em></span>&#160;)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>result</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -193,17 +214,19 @@ Algorithm</h3>
 <dl class="section return"><dt>Returns</dt><dd><code>false</code> if string <code>str</code> cannot be converted to <code>result</code> </dd>
 <dd>
 <code>true</code> if string <code>str</code> can be converted to <code>result</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html#l00119">119</a> of file <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html">abbreviation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  119</span>                                                                 {</div>
-<div class="line"><span class="lineno">  120</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;bool&gt;</a>&gt; memo(</div>
-<div class="line"><span class="lineno">  121</span>        str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() + 1, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a>(<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.size() + 1, <span class="keyword">false</span>));</div>
+<div class="line"><span class="lineno">  120</span>    std::vector&lt;std::vector&lt;bool&gt;&gt; memo(</div>
+<div class="line"><span class="lineno">  121</span>        str.size() + 1, std::vector&lt;bool&gt;(<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.size() + 1, <span class="keyword">false</span>));</div>
 <div class="line"><span class="lineno">  122</span> </div>
-<div class="line"><span class="lineno">  123</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt;= str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>(); ++i) {</div>
+<div class="line"><span class="lineno">  123</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt;= str.size(); ++i) {</div>
 <div class="line"><span class="lineno">  124</span>        memo[i][0] = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  125</span>    }</div>
 <div class="line"><span class="lineno">  126</span>    <span class="keywordflow">for</span> (uint32_t i = 1; i &lt;= <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.size(); ++i) {</div>
 <div class="line"><span class="lineno">  127</span>        memo[0][i] = <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  128</span>    }</div>
-<div class="line"><span class="lineno">  129</span>    <span class="keywordflow">for</span> (uint32_t i = 1; i &lt;= str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>(); ++i) {</div>
+<div class="line"><span class="lineno">  129</span>    <span class="keywordflow">for</span> (uint32_t i = 1; i &lt;= str.size(); ++i) {</div>
 <div class="line"><span class="lineno">  130</span>        <span class="keywordflow">for</span> (uint32_t j = 1; j &lt;= <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.size(); ++j) {</div>
 <div class="line"><span class="lineno">  131</span>            <span class="keywordflow">if</span> (str[i - 1] == result[j - 1]) {</div>
 <div class="line"><span class="lineno">  132</span>                memo[i][j] = memo[i - 1][j - 1];</div>
@@ -220,15 +243,8 @@ Algorithm</h3>
 <div class="line"><span class="lineno">  143</span>    }</div>
 <div class="line"><span class="lineno">  144</span>    <span class="keywordflow">return</span> memo.back().back();</div>
 <div class="line"><span class="lineno">  145</span>}</div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d73/abbreviation_8cpp_af53b2f647bee9c5b75ef8dd9ef685dc8_cgraph.svg" width="356" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="add60b8858720bf217df22d992d0fefaa" name="add60b8858720bf217df22d992d0fefaa"></a>
@@ -240,22 +256,22 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool dynamic_programming::abbreviation::abbreviation_recursion </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>memo</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; bool &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>memo</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>visited</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; bool &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>visited</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>result</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>result</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -289,25 +305,16 @@ Here is the call graph for this function:</div>
 <li>convert it to capitalized letter and move both to next pointer <code>(i + 1, j + 1)</code></li>
 <li>Discard the character <code>(str[i])</code> and move to next char <code>(i + 1, j)</code></li>
 </ol>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html">abbreviation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>                                                                           {</div>
-<div class="line"><span class="lineno">   63</span>    <span class="keywordtype">bool</span> ans = memo-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/at.html">at</a>(str_idx).at(result_idx);</div>
-<div class="line"><span class="lineno">   64</span>    <span class="keywordflow">if</span> (str_idx == str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() &amp;&amp; result_idx == <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.size()) {</div>
+<div class="line"><span class="lineno">   63</span>    <span class="keywordtype">bool</span> ans = memo-&gt;at(str_idx).at(result_idx);</div>
+<div class="line"><span class="lineno">   64</span>    <span class="keywordflow">if</span> (str_idx == str.size() &amp;&amp; result_idx == <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.size()) {</div>
 <div class="line"><span class="lineno">   65</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
-<div class="line"><span class="lineno">   66</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str_idx == str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() &amp;&amp; result_idx != <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.size()) {</div>
+<div class="line"><span class="lineno">   66</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str_idx == str.size() &amp;&amp; result_idx != <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.size()) {</div>
 <div class="line"><span class="lineno">   67</span>        <span class="comment">// result `t` is not converted, return false</span></div>
 <div class="line"><span class="lineno">   68</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
-<div class="line"><span class="lineno">   69</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!visited-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/at.html">at</a>(str_idx).at(result_idx)) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   70</span><span class="comment">        /**</span></div>
-<div class="line"><span class="lineno">   71</span><span class="comment">         * `(str[i] == result[j])`: if str char at position i is equal to</span></div>
-<div class="line"><span class="lineno">   72</span><span class="comment">         * `result` char at position j, then s character is a capitalized one,</span></div>
-<div class="line"><span class="lineno">   73</span><span class="comment">         * move on to next character `str[i] - 32 == result[j]`:</span></div>
-<div class="line"><span class="lineno">   74</span><span class="comment">         * if `str[i]` character is lowercase of `result[j]` then explore two</span></div>
-<div class="line"><span class="lineno">   75</span><span class="comment">         * possibilites:</span></div>
-<div class="line"><span class="lineno">   76</span><span class="comment">         * 1. convert it to capitalized letter and move both to next pointer</span></div>
-<div class="line"><span class="lineno">   77</span><span class="comment">         * `(i + 1, j + 1)`</span></div>
-<div class="line"><span class="lineno">   78</span><span class="comment">         * 2. Discard the character `(str[i])` and move to next char `(i + 1,</span></div>
-<div class="line"><span class="lineno">   79</span><span class="comment">         * j)`</span></div>
-<div class="line"><span class="lineno">   80</span><span class="comment">         */</span></div>
+<div class="line"><span class="lineno">   69</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!visited-&gt;at(str_idx).at(result_idx)) {</div>
 <div class="line"><span class="lineno">   81</span>        <span class="keywordflow">if</span> (str[str_idx] == result[result_idx]) {</div>
 <div class="line"><span class="lineno">   82</span>            ans = <a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
 <div class="line"><span class="lineno">   83</span>                                         str_idx + 1, result_idx + 1);</div>
@@ -333,14 +340,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  103</span>    (*visited)[str_idx][result_idx] = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  104</span>    <span class="keywordflow">return</span> (*memo)[str_idx][result_idx];</div>
 <div class="line"><span class="lineno">  105</span>}</div>
-<div class="ttc" id="aabbreviation_8cpp_html_add60b8858720bf217df22d992d0fefaa"><div class="ttname"><a href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a></div><div class="ttdeci">bool abbreviation_recursion(std::vector&lt; std::vector&lt; bool &gt; &gt; *memo, std::vector&lt; std::vector&lt; bool &gt; &gt; *visited, const std::string &amp;str, const std::string &amp;result, uint32_t str_idx=0, uint32_t result_idx=0)</div><div class="ttdoc">Recursive Dynamic Programming function.</div><div class="ttdef"><b>Definition</b> abbreviation.cpp:59</div></div>
-<div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/at.html">std::vector::at</a></div><div class="ttdeci">T at(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d73/abbreviation_8cpp_add60b8858720bf217df22d992d0fefaa_cgraph.svg" width="348" height="100"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aabbreviation_8cpp_html_add60b8858720bf217df22d992d0fefaa"><div class="ttname"><a href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a></div><div class="ttdeci">bool abbreviation_recursion(std::vector&lt; std::vector&lt; bool &gt; &gt; *memo, std::vector&lt; std::vector&lt; bool &gt; &gt; *visited, const std::string &amp;str, const std::string &amp;result, uint32_t str_idx=0, uint32_t result_idx=0)</div><div class="ttdoc">Recursive Dynamic Programming function.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d73/abbreviation_8cpp_source.html#l00059">abbreviation.cpp:59</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -360,17 +361,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html#l00192">192</a> of file <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html">abbreviation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  192</span>           {</div>
 <div class="line"><span class="lineno">  193</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  194</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  195</span>}</div>
-<div class="ttc" id="aabbreviation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self test-implementations.</div><div class="ttdef"><b>Definition</b> abbreviation.cpp:153</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d73/abbreviation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="311" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aabbreviation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self test-implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d73/abbreviation_8cpp_source.html#l00153">abbreviation.cpp:153</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -398,22 +396,24 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html#l00153">153</a> of file <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html">abbreviation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  153</span>                   {</div>
-<div class="line"><span class="lineno">  154</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s = <span class="stringliteral">&quot;daBcd&quot;</span>, t = <span class="stringliteral">&quot;ABC&quot;</span>;</div>
-<div class="line"><span class="lineno">  155</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;bool&gt;</a>&gt; memo(s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() + 1,</div>
-<div class="line"><span class="lineno">  156</span>                                        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a>(t.size() + 1, <span class="keyword">false</span>)),</div>
-<div class="line"><span class="lineno">  157</span>        visited(s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() + 1, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a>(t.size() + 1, <span class="keyword">false</span>));</div>
+<div class="line"><span class="lineno">  154</span>    std::string s = <span class="stringliteral">&quot;daBcd&quot;</span>, t = <span class="stringliteral">&quot;ABC&quot;</span>;</div>
+<div class="line"><span class="lineno">  155</span>    std::vector&lt;std::vector&lt;bool&gt;&gt; memo(s.size() + 1,</div>
+<div class="line"><span class="lineno">  156</span>                                        std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>)),</div>
+<div class="line"><span class="lineno">  157</span>        visited(s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
 <div class="line"><span class="lineno">  158</span> </div>
 <div class="line"><span class="lineno">  159</span>    assert(dynamic_programming::abbreviation::abbreviation_recursion(</div>
 <div class="line"><span class="lineno">  160</span>               &amp;memo, &amp;visited, s, t) == <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">  161</span>    assert(dynamic_programming::abbreviation::abbreviation(s, t) == <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">  162</span>    s = <span class="stringliteral">&quot;XXVVnDEFYgYeMXzWINQYHAQKKOZEYgSRCzLZAmUYGUGILjMDET&quot;</span>;</div>
 <div class="line"><span class="lineno">  163</span>    t = <span class="stringliteral">&quot;XXVVDEFYYMXWINQYHAQKKOZEYSRCLZAUYGUGILMDETQVWU&quot;</span>;</div>
-<div class="line"><span class="lineno">  164</span>    memo = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;bool&gt;</a>&gt;(</div>
-<div class="line"><span class="lineno">  165</span>        s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() + 1, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a>(t.size() + 1, <span class="keyword">false</span>));</div>
+<div class="line"><span class="lineno">  164</span>    memo = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
+<div class="line"><span class="lineno">  165</span>        s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
 <div class="line"><span class="lineno">  166</span> </div>
-<div class="line"><span class="lineno">  167</span>    visited = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;bool&gt;</a>&gt;(</div>
-<div class="line"><span class="lineno">  168</span>        s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() + 1, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a>(t.size() + 1, <span class="keyword">false</span>));</div>
+<div class="line"><span class="lineno">  167</span>    visited = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
+<div class="line"><span class="lineno">  168</span>        s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
 <div class="line"><span class="lineno">  169</span> </div>
 <div class="line"><span class="lineno">  170</span>    assert(dynamic_programming::abbreviation::abbreviation_recursion(</div>
 <div class="line"><span class="lineno">  171</span>               &amp;memo, &amp;visited, s, t) == <span class="keyword">false</span>);</div>
@@ -422,23 +422,17 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  174</span>    s = <span class="stringliteral">&quot;DRFNLZZVHLPZWIupjwdmqafmgkg&quot;</span>;</div>
 <div class="line"><span class="lineno">  175</span>    t = <span class="stringliteral">&quot;DRFNLZZVHLPZWI&quot;</span>;</div>
 <div class="line"><span class="lineno">  176</span> </div>
-<div class="line"><span class="lineno">  177</span>    memo = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;bool&gt;</a>&gt;(</div>
-<div class="line"><span class="lineno">  178</span>        s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() + 1, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a>(t.size() + 1, <span class="keyword">false</span>));</div>
+<div class="line"><span class="lineno">  177</span>    memo = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
+<div class="line"><span class="lineno">  178</span>        s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
 <div class="line"><span class="lineno">  179</span> </div>
-<div class="line"><span class="lineno">  180</span>    visited = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;bool&gt;</a>&gt;(</div>
-<div class="line"><span class="lineno">  181</span>        s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() + 1, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a>(t.size() + 1, <span class="keyword">false</span>));</div>
+<div class="line"><span class="lineno">  180</span>    visited = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
+<div class="line"><span class="lineno">  181</span>        s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
 <div class="line"><span class="lineno">  182</span> </div>
 <div class="line"><span class="lineno">  183</span>    assert(dynamic_programming::abbreviation::abbreviation_recursion(</div>
 <div class="line"><span class="lineno">  184</span>               &amp;memo, &amp;visited, s, t) == <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">  185</span>    assert(dynamic_programming::abbreviation::abbreviation(s, t) == <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">  186</span>}</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-</div><!-- 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="../../d7/d73/abbreviation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="214" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d7/d73/abbreviation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d7/d73/abbreviation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 7f06dbcfe..000000000
--- a/d7/d73/abbreviation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self test&#45;implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="97,5,208,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/d7/d73/abbreviation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d7/d73/abbreviation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index b042fbf65..000000000
--- a/d7/d73/abbreviation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b574a5ff8b8f7452a2f6ffd940f1e32e
\ No newline at end of file
diff --git a/d7/d73/abbreviation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d7/d73/abbreviation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index b68f06796..000000000
--- a/d7/d73/abbreviation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="160pt" height="27pt"
- viewBox="0.00 0.00 160.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self test&#45;implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152,-19.25 68.5,-19.25 68.5,0 152,0 152,-19.25"/>
-<text text-anchor="middle" x="110.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-9.62C39.63,-9.62 47.99,-9.62 56.68,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.65,-13.13 66.65,-9.63 56.65,-6.13 56.65,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d73/abbreviation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d7/d73/abbreviation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index a742713ce..000000000
--- a/d7/d73/abbreviation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="160pt" height="27pt"
- viewBox="0.00 0.00 160.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self test&#45;implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152,-19.25 68.5,-19.25 68.5,0 152,0 152,-19.25"/>
-<text text-anchor="middle" x="110.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-9.62C39.63,-9.62 47.99,-9.62 56.68,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.65,-13.13 66.65,-9.63 56.65,-6.13 56.65,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d73/abbreviation_8cpp_add60b8858720bf217df22d992d0fefaa_cgraph.map b/d7/d73/abbreviation_8cpp_add60b8858720bf217df22d992d0fefaa_cgraph.map
deleted file mode 100644
index 8260c9a39..000000000
--- a/d7/d73/abbreviation_8cpp_add60b8858720bf217df22d992d0fefaa_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="dynamic_programming::abbreviation::abbreviation_recursion" name="dynamic_programming::abbreviation::abbreviation_recursion">
-<area shape="rect" id="Node000001" title="Recursive Dynamic Programming function." alt="" coords="5,29,183,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="56,29,56,19,63,10,76,5,94,3,114,5,127,12,124,17,113,10,94,8,77,10,66,14,61,21,61,29"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/at.html#" title=" " alt="" coords="235,19,338,45"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="183,43,219,38,220,43,183,48"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="231,68,342,94"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="183,66,216,70,215,75,183,71"/>
-</map>
diff --git a/d7/d73/abbreviation_8cpp_add60b8858720bf217df22d992d0fefaa_cgraph.md5 b/d7/d73/abbreviation_8cpp_add60b8858720bf217df22d992d0fefaa_cgraph.md5
deleted file mode 100644
index cb8335f61..000000000
--- a/d7/d73/abbreviation_8cpp_add60b8858720bf217df22d992d0fefaa_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4bfb6a2f89ab4b120b2934429ee6c4cb
\ No newline at end of file
diff --git a/d7/d73/abbreviation_8cpp_add60b8858720bf217df22d992d0fefaa_cgraph.svg b/d7/d73/abbreviation_8cpp_add60b8858720bf217df22d992d0fefaa_cgraph.svg
deleted file mode 100644
index e07ade8f9..000000000
--- a/d7/d73/abbreviation_8cpp_add60b8858720bf217df22d992d0fefaa_cgraph.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::abbreviation::abbreviation_recursion Pages: 1 -->
-<svg width="261pt" height="75pt"
- viewBox="0.00 0.00 260.50 74.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 70.5)">
-<title>dynamic_programming::abbreviation::abbreviation_recursion</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive Dynamic Programming function.">
-<polygon fill="#999999" stroke="#666666" points="133,-48.5 0,-48.5 0,-6.75 133,-6.75 133,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">::abbreviation::abbreviation</text>
-<text text-anchor="middle" x="66.5" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">_recursion</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.88,-48.82C37.34,-58.3 46.21,-66.5 66.5,-66.5 78.23,-66.5 86.14,-63.76 90.24,-59.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.54,-60.85 92.73,-50.28 86.77,-59.04 93.54,-60.85"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.12,-56.25 172.38,-56.25 172.38,-37 249.12,-37 249.12,-56.25"/>
-<text text-anchor="middle" x="210.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::at</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.21,-36.4C142.53,-37.65 151.96,-38.91 160.88,-40.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.38,-43.56 170.75,-41.42 161.3,-36.62 160.38,-43.56"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.5,-19.25 169,-19.25 169,0 252.5,0 252.5,-19.25"/>
-<text text-anchor="middle" x="210.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.21,-19.31C141.33,-18.28 149.54,-17.24 157.43,-16.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.7,-19.74 167.19,-15.01 156.83,-12.79 157.7,-19.74"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d73/abbreviation_8cpp_add60b8858720bf217df22d992d0fefaa_cgraph_org.svg b/d7/d73/abbreviation_8cpp_add60b8858720bf217df22d992d0fefaa_cgraph_org.svg
deleted file mode 100644
index 1e0110ca7..000000000
--- a/d7/d73/abbreviation_8cpp_add60b8858720bf217df22d992d0fefaa_cgraph_org.svg
+++ /dev/null
@@ -1,68 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::abbreviation::abbreviation_recursion Pages: 1 -->
-<svg width="261pt" height="75pt"
- viewBox="0.00 0.00 260.50 74.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 70.5)">
-<title>dynamic_programming::abbreviation::abbreviation_recursion</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive Dynamic Programming function.">
-<polygon fill="#999999" stroke="#666666" points="133,-48.5 0,-48.5 0,-6.75 133,-6.75 133,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">::abbreviation::abbreviation</text>
-<text text-anchor="middle" x="66.5" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">_recursion</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.88,-48.82C37.34,-58.3 46.21,-66.5 66.5,-66.5 78.23,-66.5 86.14,-63.76 90.24,-59.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.54,-60.85 92.73,-50.28 86.77,-59.04 93.54,-60.85"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.12,-56.25 172.38,-56.25 172.38,-37 249.12,-37 249.12,-56.25"/>
-<text text-anchor="middle" x="210.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::at</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.21,-36.4C142.53,-37.65 151.96,-38.91 160.88,-40.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.38,-43.56 170.75,-41.42 161.3,-36.62 160.38,-43.56"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.5,-19.25 169,-19.25 169,0 252.5,0 252.5,-19.25"/>
-<text text-anchor="middle" x="210.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.21,-19.31C141.33,-18.28 149.54,-17.24 157.43,-16.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.7,-19.74 167.19,-15.01 156.83,-12.79 157.7,-19.74"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d73/abbreviation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d7/d73/abbreviation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 17bfa4dda..000000000
--- a/d7/d73/abbreviation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self test&#45;implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="194,5,305,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/d7/d73/abbreviation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d7/d73/abbreviation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 2c3baa1c8..000000000
--- a/d7/d73/abbreviation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3f0b51ff06250e4e6d4a9db3e611a697
\ No newline at end of file
diff --git a/d7/d73/abbreviation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d7/d73/abbreviation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 643e87bd8..000000000
--- a/d7/d73/abbreviation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="233pt" height="27pt"
- viewBox="0.00 0.00 233.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self test&#45;implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="225,-19.25 141.5,-19.25 141.5,0 225,0 225,-19.25"/>
-<text text-anchor="middle" x="183.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-9.62C112.63,-9.62 120.99,-9.62 129.68,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.65,-13.13 139.65,-9.63 129.65,-6.13 129.65,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d73/abbreviation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d7/d73/abbreviation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index f10521820..000000000
--- a/d7/d73/abbreviation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="233pt" height="27pt"
- viewBox="0.00 0.00 233.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self test&#45;implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="225,-19.25 141.5,-19.25 141.5,0 225,0 225,-19.25"/>
-<text text-anchor="middle" x="183.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-9.62C112.63,-9.62 120.99,-9.62 129.68,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.65,-13.13 139.65,-9.63 129.65,-6.13 129.65,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d73/abbreviation_8cpp_af53b2f647bee9c5b75ef8dd9ef685dc8_cgraph.map b/d7/d73/abbreviation_8cpp_af53b2f647bee9c5b75ef8dd9ef685dc8_cgraph.map
deleted file mode 100644
index cf81f28e4..000000000
--- a/d7/d73/abbreviation_8cpp_af53b2f647bee9c5b75ef8dd9ef685dc8_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="dynamic_programming::abbreviation::abbreviation" name="dynamic_programming::abbreviation::abbreviation">
-<area shape="rect" id="Node000001" title="Iterative Dynamic Programming function." alt="" coords="5,23,183,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="231,5,350,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="183,29,215,25,216,30,183,35"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="235,55,346,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="183,52,220,56,219,62,183,57"/>
-</map>
diff --git a/d7/d73/abbreviation_8cpp_af53b2f647bee9c5b75ef8dd9ef685dc8_cgraph.md5 b/d7/d73/abbreviation_8cpp_af53b2f647bee9c5b75ef8dd9ef685dc8_cgraph.md5
deleted file mode 100644
index d28c9f970..000000000
--- a/d7/d73/abbreviation_8cpp_af53b2f647bee9c5b75ef8dd9ef685dc8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2252847d840eeefe5b56eeb6a5e98b3e
\ No newline at end of file
diff --git a/d7/d73/abbreviation_8cpp_af53b2f647bee9c5b75ef8dd9ef685dc8_cgraph.svg b/d7/d73/abbreviation_8cpp_af53b2f647bee9c5b75ef8dd9ef685dc8_cgraph.svg
deleted file mode 100644
index 44c158a15..000000000
--- a/d7/d73/abbreviation_8cpp_af53b2f647bee9c5b75ef8dd9ef685dc8_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::abbreviation::abbreviation Pages: 1 -->
-<svg width="267pt" height="64pt"
- viewBox="0.00 0.00 266.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>dynamic_programming::abbreviation::abbreviation</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Iterative Dynamic Programming function.">
-<polygon fill="#999999" stroke="#666666" points="133,-42.88 0,-42.88 0,-12.37 133,-12.37 133,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="66.5" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::abbreviation::abbreviation</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.5,-56.25 169,-56.25 169,-37 258.5,-37 258.5,-56.25"/>
-<text text-anchor="middle" x="213.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.33,-36.24C141.39,-37.29 149.58,-38.36 157.47,-39.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.91,-42.85 167.28,-40.68 157.81,-35.91 156.91,-42.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-19.25 172,-19.25 172,0 255.5,0 255.5,-19.25"/>
-<text text-anchor="middle" x="213.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.33,-19.47C142.41,-18.34 151.63,-17.2 160.42,-16.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.69,-19.6 170.18,-14.9 159.83,-12.66 160.69,-19.6"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d73/abbreviation_8cpp_af53b2f647bee9c5b75ef8dd9ef685dc8_cgraph_org.svg b/d7/d73/abbreviation_8cpp_af53b2f647bee9c5b75ef8dd9ef685dc8_cgraph_org.svg
deleted file mode 100644
index a13973641..000000000
--- a/d7/d73/abbreviation_8cpp_af53b2f647bee9c5b75ef8dd9ef685dc8_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::abbreviation::abbreviation Pages: 1 -->
-<svg width="267pt" height="64pt"
- viewBox="0.00 0.00 266.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>dynamic_programming::abbreviation::abbreviation</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Iterative Dynamic Programming function.">
-<polygon fill="#999999" stroke="#666666" points="133,-42.88 0,-42.88 0,-12.37 133,-12.37 133,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="66.5" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::abbreviation::abbreviation</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.5,-56.25 169,-56.25 169,-37 258.5,-37 258.5,-56.25"/>
-<text text-anchor="middle" x="213.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.33,-36.24C141.39,-37.29 149.58,-38.36 157.47,-39.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.91,-42.85 167.28,-40.68 157.81,-35.91 156.91,-42.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-19.25 172,-19.25 172,0 255.5,0 255.5,-19.25"/>
-<text text-anchor="middle" x="213.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.33,-19.47C142.41,-18.34 151.63,-17.2 160.42,-16.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.69,-19.6 170.18,-14.9 159.83,-12.66 160.69,-19.6"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d73/abbreviation_8cpp_source.html b/d7/d73/abbreviation_8cpp_source.html
new file mode 100644
index 000000000..3ada3efef
--- /dev/null
+++ b/d7/d73/abbreviation_8cpp_source.html
@@ -0,0 +1,263 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/abbreviation.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/d73/abbreviation_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">abbreviation.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d7/d73/abbreviation_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;cstdint&gt;</span>   </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;string&gt;</span>    </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a> {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/df8/namespaceabbreviation.html">abbreviation</a> {</div>
+<div class="foldopen" id="foldopen00059" data-start="{" data-end="}">
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">   59</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(std::vector&lt;std::vector&lt;bool&gt;&gt; *memo,</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>                            std::vector&lt;std::vector&lt;bool&gt;&gt; *visited,</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>                            <span class="keyword">const</span> std::string &amp;str, <span class="keyword">const</span> std::string &amp;result,</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>                            uint32_t str_idx = 0, uint32_t result_idx = 0) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordtype">bool</span> ans = memo-&gt;at(str_idx).at(result_idx);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="keywordflow">if</span> (str_idx == str.size() &amp;&amp; result_idx == result.size()) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str_idx == str.size() &amp;&amp; result_idx != result.size()) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <span class="comment">// result `t` is not converted, return false</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!visited-&gt;at(str_idx).at(result_idx)) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <span class="keywordflow">if</span> (str[str_idx] == result[result_idx]) {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>            ans = <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>                                         str_idx + 1, result_idx + 1);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str[str_idx] - 32 == result[result_idx]) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>            ans = <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>                                         str_idx + 1, result_idx + 1) ||</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>                  <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>                                         str_idx + 1, result_idx);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>            <span class="comment">// if `str[i]` is uppercase, then cannot be converted, return</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>            <span class="comment">// `false`</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>            <span class="comment">// else `str[i]` is lowercase, only option is to discard this</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>            <span class="comment">// character</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>            <span class="keywordflow">if</span> (str[str_idx] &gt;= <span class="charliteral">&#39;A&#39;</span> &amp;&amp; str[str_idx] &lt;= <span class="charliteral">&#39;Z&#39;</span>) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>                ans = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>                ans = <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>                                             str_idx + 1, result_idx);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>            }</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        }</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    }</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    (*memo)[str_idx][result_idx] = ans;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    (*visited)[str_idx][result_idx] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="keywordflow">return</span> (*memo)[str_idx][result_idx];</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00119" data-start="{" data-end="}">
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"><a class="line" href="../../d7/d73/abbreviation_8cpp.html#af53b2f647bee9c5b75ef8dd9ef685dc8">  119</a></span><span class="keywordtype">bool</span> <a class="code hl_namespace" href="../../d0/df8/namespaceabbreviation.html">abbreviation</a>(<span class="keyword">const</span> std::string &amp;str, <span class="keyword">const</span> std::string &amp;result) {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    std::vector&lt;std::vector&lt;bool&gt;&gt; memo(</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        str.size() + 1, std::vector&lt;bool&gt;(result.size() + 1, <span class="keyword">false</span>));</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span> </div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt;= str.size(); ++i) {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        memo[i][0] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    }</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <span class="keywordflow">for</span> (uint32_t i = 1; i &lt;= result.size(); ++i) {</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        memo[0][i] = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    }</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    <span class="keywordflow">for</span> (uint32_t i = 1; i &lt;= str.size(); ++i) {</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        <span class="keywordflow">for</span> (uint32_t j = 1; j &lt;= result.size(); ++j) {</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>            <span class="keywordflow">if</span> (str[i - 1] == result[j - 1]) {</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>                memo[i][j] = memo[i - 1][j - 1];</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str[i - 1] - 32 == result[j - 1]) {</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>                memo[i][j] = (memo[i - 1][j - 1] || memo[i - 1][j]);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>                <span class="keywordflow">if</span> (str[i - 1] &gt;= <span class="charliteral">&#39;A&#39;</span> &amp;&amp; str[i - 1] &lt;= <span class="charliteral">&#39;Z&#39;</span>) {</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>                    memo[i][j] = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>                } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>                    memo[i][j] = memo[i - 1][j];</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>                }</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>            }</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        }</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    }</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <span class="keywordflow">return</span> memo.back().back();</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>}</div>
+</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>}  <span class="comment">// namespace abbreviation</span></div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>}  <span class="comment">// namespace dynamic_programming</span></div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span> </div>
+<div class="foldopen" id="foldopen00153" data-start="{" data-end="}">
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"><a class="line" href="../../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  153</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    std::string s = <span class="stringliteral">&quot;daBcd&quot;</span>, t = <span class="stringliteral">&quot;ABC&quot;</span>;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    std::vector&lt;std::vector&lt;bool&gt;&gt; memo(s.size() + 1,</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>                                        std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>)),</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>        visited(s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span> </div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    assert(dynamic_programming::abbreviation::abbreviation_recursion(</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>               &amp;memo, &amp;visited, s, t) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    assert(dynamic_programming::abbreviation::abbreviation(s, t) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    s = <span class="stringliteral">&quot;XXVVnDEFYgYeMXzWINQYHAQKKOZEYgSRCzLZAmUYGUGILjMDET&quot;</span>;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    t = <span class="stringliteral">&quot;XXVVDEFYYMXWINQYHAQKKOZEYSRCLZAUYGUGILMDETQVWU&quot;</span>;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    memo = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>        s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span> </div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    visited = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span> </div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    assert(dynamic_programming::abbreviation::abbreviation_recursion(</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>               &amp;memo, &amp;visited, s, t) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    assert(dynamic_programming::abbreviation::abbreviation(s, t) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span> </div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    s = <span class="stringliteral">&quot;DRFNLZZVHLPZWIupjwdmqafmgkg&quot;</span>;</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    t = <span class="stringliteral">&quot;DRFNLZZVHLPZWI&quot;</span>;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    memo = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span> </div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    visited = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>        s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span> </div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    assert(dynamic_programming::abbreviation::abbreviation_recursion(</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>               &amp;memo, &amp;visited, s, t) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    assert(dynamic_programming::abbreviation::abbreviation(s, t) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>}</div>
+</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span> </div>
+<div class="foldopen" id="foldopen00192" data-start="{" data-end="}">
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"><a class="line" href="../../d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  192</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>}</div>
+</div>
+<div class="ttc" id="aabbreviation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d7/d73/abbreviation_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> <a href="#l00153">abbreviation.cpp:153</a></div></div>
+<div class="ttc" id="aabbreviation_8cpp_html_add60b8858720bf217df22d992d0fefaa"><div class="ttname"><a href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a></div><div class="ttdeci">bool abbreviation_recursion(std::vector&lt; std::vector&lt; bool &gt; &gt; *memo, std::vector&lt; std::vector&lt; bool &gt; &gt; *visited, const std::string &amp;str, const std::string &amp;result, uint32_t str_idx=0, uint32_t result_idx=0)</div><div class="ttdoc">Recursive Dynamic Programming function.</div><div class="ttdef"><b>Definition</b> <a href="#l00059">abbreviation.cpp:59</a></div></div>
+<div class="ttc" id="aabbreviation_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00192">abbreviation.cpp:192</a></div></div>
+<div class="ttc" id="anamespaceabbreviation_html"><div class="ttname"><a href="../../d0/df8/namespaceabbreviation.html">abbreviation</a></div><div class="ttdoc">Functions for Abbreviation implementation.</div></div>
+<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../d7/d73/abbreviation_8cpp.html">abbreviation.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/d75/postfix__evaluation_8cpp.html b/d7/d75/postfix__evaluation_8cpp.html
index 5e800ea4f..e3d3515b8 100644
--- a/d7/d75/postfix__evaluation_8cpp.html
+++ b/d7/d75/postfix__evaluation_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/postfix_evaluation.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/postfix_evaluation.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for postfix_evaluation.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/dc8/postfix__evaluation_8cpp__incl.svg" width="422" height="111"><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">
+</div>
+<p><a href="../../d7/d75/postfix__evaluation_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html">others::postfix_expression::Stack</a></td></tr>
@@ -148,14 +167,14 @@ Functions</h2></td></tr>
 <tr class="memitem:a421baa2002a64bc0bfc3e1b64800d734" id="r_a421baa2002a64bc0bfc3e1b64800d734"><td class="memItemLeft" align="right" valign="top">float&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a421baa2002a64bc0bfc3e1b64800d734">others::postfix_expression::pop</a> (<a class="el" href="../../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html">Stack</a> *<a class="el" href="../../d1/dc2/classstack.html">stack</a>)</td></tr>
 <tr class="memdesc:a421baa2002a64bc0bfc3e1b64800d734"><td class="mdescLeft">&#160;</td><td class="mdescRight">Popping operand, also called the number from the stack.  <br /></td></tr>
 <tr class="separator:a421baa2002a64bc0bfc3e1b64800d734"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a4c27f949c9d6659be9f5bd2ccbe1360a" id="r_a4c27f949c9d6659be9f5bd2ccbe1360a"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4c27f949c9d6659be9f5bd2ccbe1360a">others::postfix_expression::is_number</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;s)</td></tr>
+<tr class="memitem:a4c27f949c9d6659be9f5bd2ccbe1360a" id="r_a4c27f949c9d6659be9f5bd2ccbe1360a"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4c27f949c9d6659be9f5bd2ccbe1360a">others::postfix_expression::is_number</a> (const std::string &amp;s)</td></tr>
 <tr class="memdesc:a4c27f949c9d6659be9f5bd2ccbe1360a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Checks if scanned string is a number.  <br /></td></tr>
 <tr class="separator:a4c27f949c9d6659be9f5bd2ccbe1360a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a59fd597e0ea394abe027ced4d2ea3338" id="r_a59fd597e0ea394abe027ced4d2ea3338"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a59fd597e0ea394abe027ced4d2ea3338">others::postfix_expression::evaluate</a> (float a, float b, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;operation, <a class="el" href="../../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html">Stack</a> *<a class="el" href="../../d1/dc2/classstack.html">stack</a>)</td></tr>
+<tr class="memitem:a59fd597e0ea394abe027ced4d2ea3338" id="r_a59fd597e0ea394abe027ced4d2ea3338"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a59fd597e0ea394abe027ced4d2ea3338">others::postfix_expression::evaluate</a> (float a, float b, const std::string &amp;operation, <a class="el" href="../../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html">Stack</a> *<a class="el" href="../../d1/dc2/classstack.html">stack</a>)</td></tr>
 <tr class="memdesc:a59fd597e0ea394abe027ced4d2ea3338"><td class="mdescLeft">&#160;</td><td class="mdescRight">Evaluate answer using given last two operands from and operation.  <br /></td></tr>
 <tr class="separator:a59fd597e0ea394abe027ced4d2ea3338"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae38bd3a177a6d61da3859a281233bbe1" id="r_ae38bd3a177a6d61da3859a281233bbe1"><td class="memTemplParams" colspan="2">template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> N&gt; </td></tr>
-<tr class="memitem:ae38bd3a177a6d61da3859a281233bbe1"><td class="memTemplItemLeft" align="right" valign="top">float&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae38bd3a177a6d61da3859a281233bbe1">others::postfix_expression::postfix_evaluation</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>, N &gt; input)</td></tr>
+<tr class="memitem:ae38bd3a177a6d61da3859a281233bbe1" id="r_ae38bd3a177a6d61da3859a281233bbe1"><td class="memTemplParams" colspan="2">template&lt;std::size_t N&gt; </td></tr>
+<tr class="memitem:ae38bd3a177a6d61da3859a281233bbe1"><td class="memTemplItemLeft" align="right" valign="top">float&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae38bd3a177a6d61da3859a281233bbe1">others::postfix_expression::postfix_evaluation</a> (std::array&lt; std::string, N &gt; input)</td></tr>
 <tr class="memdesc:ae38bd3a177a6d61da3859a281233bbe1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Postfix Evaluation algorithm to compute the value from given input array.  <br /></td></tr>
 <tr class="separator:ae38bd3a177a6d61da3859a281233bbe1"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a6a8eeb7d346d5cd6335d9780fb7c0f15" id="r_a6a8eeb7d346d5cd6335d9780fb7c0f15"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6a8eeb7d346d5cd6335d9780fb7c0f15">test_function_1</a> ()</td></tr>
@@ -172,6 +191,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Evaluation of <a href="https://en.wikipedia.org/wiki/Reverse_Polish_notation" target="_blank">Postfix Expression</a> </p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Darshana-Sarma" target="_blank">Darshana Sarma</a></dd></dl>
 <p>Create a stack to store operands (or values). Scan the given expression and do following for every scanned element. If the element is a number, push it into the stack If the element is a operator, pop operands for the operator from stack. Evaluate the operator and push the result back to the stack When the expression is ended, the number in the stack is the final answer </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html">postfix_evaluation.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a59fd597e0ea394abe027ced4d2ea3338" name="a59fd597e0ea394abe027ced4d2ea3338"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a59fd597e0ea394abe027ced4d2ea3338">&#9670;&#160;</a></span>evaluate()</h2>
@@ -192,7 +213,7 @@ Functions</h2></td></tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>operation</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>operation</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -213,9 +234,11 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html">postfix_evaluation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   77</span>                                                                          {</div>
 <div class="line"><span class="lineno">   78</span>    <span class="keywordtype">float</span> c = 0;</div>
-<div class="line"><span class="lineno">   79</span>    <span class="keyword">const</span> <span class="keywordtype">char</span> *op = operation.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html">c_str</a>();</div>
+<div class="line"><span class="lineno">   79</span>    <span class="keyword">const</span> <span class="keywordtype">char</span> *op = operation.c_str();</div>
 <div class="line"><span class="lineno">   80</span>    <span class="keywordflow">switch</span> (*op) {</div>
 <div class="line"><span class="lineno">   81</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;+&#39;</span>:</div>
 <div class="line"><span class="lineno">   82</span>            c = a + b; <span class="comment">// Addition of numbers</span></div>
@@ -238,20 +261,13 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   99</span>            <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  100</span> </div>
 <div class="line"><span class="lineno">  101</span>        <span class="keywordflow">default</span>:</div>
-<div class="line"><span class="lineno">  102</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Operator not defined\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  102</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Operator not defined\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  103</span>            <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  104</span>    }</div>
 <div class="line"><span class="lineno">  105</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="ac_str_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html">std::string::c_str</a></div><div class="ttdeci">T c_str(T... args)</div></div>
-<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> stack.hpp:19</div></div>
-<div class="ttc" id="apostfix__evaluation_8cpp_html_ad77f8c9cc594975756838d498c237cea"><div class="ttname"><a href="#ad77f8c9cc594975756838d498c237cea">others::postfix_expression::push</a></div><div class="ttdeci">void push(float operand, Stack *stack)</div><div class="ttdoc">Pushing operand, also called the number in the array to the stack.</div><div class="ttdef"><b>Definition</b> postfix_evaluation.cpp:44</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.svg" width="408" height="104"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00019">stack.hpp:19</a></div></div>
+<div class="ttc" id="apostfix__evaluation_8cpp_html_ad77f8c9cc594975756838d498c237cea"><div class="ttname"><a href="#ad77f8c9cc594975756838d498c237cea">others::postfix_expression::push</a></div><div class="ttdeci">void push(float operand, Stack *stack)</div><div class="ttdoc">Pushing operand, also called the number in the array to the stack.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d75/postfix__evaluation_8cpp_source.html#l00044">postfix_evaluation.cpp:44</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4c27f949c9d6659be9f5bd2ccbe1360a" name="a4c27f949c9d6659be9f5bd2ccbe1360a"></a>
@@ -263,7 +279,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool others::postfix_expression::is_number </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -277,19 +293,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>bool boolean value if string is number </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   65</span>                                   {</div>
-<div class="line"><span class="lineno">   66</span>    <span class="keywordflow">return</span> !s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html">empty</a>() &amp;&amp; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html">std::all_of</a>(s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">begin</a>(), s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">end</a>(), ::isdigit);</div>
-<div class="line"><span class="lineno">   67</span>}</div>
-<div class="ttc" id="aall_any_none_of_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html">std::all_of</a></div><div class="ttdeci">T all_of(T... args)</div></div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">std::string::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html">std::string::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">std::string::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d75/postfix__evaluation_8cpp_a4c27f949c9d6659be9f5bd2ccbe1360a_cgraph.svg" width="356" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html#l00065">65</a> of file <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html">postfix_evaluation.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   65</span>                                   {</div>
+<div class="line"><span class="lineno">   66</span>    <span class="keywordflow">return</span> !s.empty() &amp;&amp; std::all_of(s.begin(), s.end(), ::isdigit);</div>
+<div class="line"><span class="lineno">   67</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -309,22 +318,19 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html#l00171">171</a> of file <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html">postfix_evaluation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  171</span>           {</div>
 <div class="line"><span class="lineno">  172</span>    <a class="code hl_function" href="#a6a8eeb7d346d5cd6335d9780fb7c0f15">test_function_1</a>();</div>
 <div class="line"><span class="lineno">  173</span>    <a class="code hl_function" href="#a5b97d12e8b61484f756a8721992bfae1">test_function_2</a>();</div>
 <div class="line"><span class="lineno">  174</span> </div>
-<div class="line"><span class="lineno">  175</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest implementations passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  175</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest implementations passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  176</span> </div>
 <div class="line"><span class="lineno">  177</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  178</span>}</div>
-<div class="ttc" id="apostfix__evaluation_8cpp_html_a5b97d12e8b61484f756a8721992bfae1"><div class="ttname"><a href="#a5b97d12e8b61484f756a8721992bfae1">test_function_2</a></div><div class="ttdeci">static void test_function_2()</div><div class="ttdoc">Test function 2 with input array {'1', '2', '+', '2', '/', '5', '*', '7', '+'}.</div><div class="ttdef"><b>Definition</b> postfix_evaluation.cpp:159</div></div>
-<div class="ttc" id="apostfix__evaluation_8cpp_html_a6a8eeb7d346d5cd6335d9780fb7c0f15"><div class="ttname"><a href="#a6a8eeb7d346d5cd6335d9780fb7c0f15">test_function_1</a></div><div class="ttdeci">static void test_function_1()</div><div class="ttdoc">Test function 1 with input array {'2', '3', '1', '*', '+', '9', '-'}.</div><div class="ttdef"><b>Definition</b> postfix_evaluation.cpp:146</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d75/postfix__evaluation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="219" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="apostfix__evaluation_8cpp_html_a5b97d12e8b61484f756a8721992bfae1"><div class="ttname"><a href="#a5b97d12e8b61484f756a8721992bfae1">test_function_2</a></div><div class="ttdeci">static void test_function_2()</div><div class="ttdoc">Test function 2 with input array {'1', '2', '+', '2', '/', '5', '*', '7', '+'}.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d75/postfix__evaluation_8cpp_source.html#l00159">postfix_evaluation.cpp:159</a></div></div>
+<div class="ttc" id="apostfix__evaluation_8cpp_html_a6a8eeb7d346d5cd6335d9780fb7c0f15"><div class="ttname"><a href="#a6a8eeb7d346d5cd6335d9780fb7c0f15">test_function_1</a></div><div class="ttdeci">static void test_function_1()</div><div class="ttdoc">Test function 1 with input array {'2', '3', '1', '*', '+', '9', '-'}.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d75/postfix__evaluation_8cpp_source.html#l00146">postfix_evaluation.cpp:146</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a421baa2002a64bc0bfc3e1b64800d734" name="a421baa2002a64bc0bfc3e1b64800d734"></a>
@@ -350,12 +356,14 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>operand float on top of stack </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html#l00054">54</a> of file <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html">postfix_evaluation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   54</span>                        {</div>
 <div class="line"><span class="lineno">   55</span>    <span class="keywordtype">float</span> operand = <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>-&gt;stack[<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>-&gt;<a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>];</div>
 <div class="line"><span class="lineno">   56</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>-&gt;<a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>--;</div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordflow">return</span> operand;</div>
 <div class="line"><span class="lineno">   58</span>}</div>
-<div class="ttc" id="aclassstack_html_aefb3dac828e32b4ec014ff4b5d43a6b8"><div class="ttname"><a href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stack::stackTop</a></div><div class="ttdeci">std::shared_ptr&lt; Node&lt; value_type &gt; &gt; stackTop</div><div class="ttdef"><b>Definition</b> stack.hpp:75</div></div>
+<div class="ttc" id="aclassstack_html_aefb3dac828e32b4ec014ff4b5d43a6b8"><div class="ttname"><a href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stack::stackTop</a></div><div class="ttdeci">std::shared_ptr&lt; Node&lt; value_type &gt; &gt; stackTop</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00075">stack.hpp:75</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -365,12 +373,12 @@ Here is the call graph for this function:</div>
 <div class="memitem">
 <div class="memproto">
 <div class="memtemplate">
-template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> N&gt; </div>
+template&lt;std::size_t N&gt; </div>
       <table class="memname">
         <tr>
           <td class="memname">float others::postfix_expression::postfix_evaluation </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>, N &gt;</td>          <td class="paramname"><span class="paramname"><em>input</em></span></td><td>)</td>
+          <td class="paramtype">std::array&lt; std::string, N &gt;</td>          <td class="paramname"><span class="paramname"><em>input</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -390,14 +398,16 @@ template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>stack[stackTop] returns the top value from the stack </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html#l00115">115</a> of file <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html">postfix_evaluation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  115</span>                                                       {</div>
 <div class="line"><span class="lineno">  116</span>    Stack <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;</div>
 <div class="line"><span class="lineno">  117</span>    <span class="keywordtype">int</span> j = 0;</div>
 <div class="line"><span class="lineno">  118</span> </div>
 <div class="line"><span class="lineno">  119</span>    <span class="keywordflow">while</span> (j &lt; N) {</div>
-<div class="line"><span class="lineno">  120</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> scan = input[j];</div>
+<div class="line"><span class="lineno">  120</span>        std::string scan = input[j];</div>
 <div class="line"><span class="lineno">  121</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59">is_number</a>(scan)) {</div>
-<div class="line"><span class="lineno">  122</span>            push(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html">std::stof</a>(scan), &amp;<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>);</div>
+<div class="line"><span class="lineno">  122</span>            push(std::stof(scan), &amp;<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>);</div>
 <div class="line"><span class="lineno">  123</span> </div>
 <div class="line"><span class="lineno">  124</span>        } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">  125</span>            <span class="keywordtype">float</span> op2 = pop(&amp;<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>);</div>
@@ -408,21 +418,14 @@ template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/
 <div class="line"><span class="lineno">  130</span>        j++;</div>
 <div class="line"><span class="lineno">  131</span>    }</div>
 <div class="line"><span class="lineno">  132</span> </div>
-<div class="line"><span class="lineno">  133</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.stack[<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>] &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  133</span>    std::cout &lt;&lt; <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.stack[<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>] &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  134</span> </div>
 <div class="line"><span class="lineno">  135</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.stack[<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>];</div>
 <div class="line"><span class="lineno">  136</span>}</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="anamespacegames_1_1memory__game_html_a33167bb9cce6d527b478b4f6ae8c3f59"><div class="ttname"><a href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59">games::memory_game::is_number</a></div><div class="ttdeci">bool is_number(const T &amp;input)</div><div class="ttdoc">Utility function to verify if the given input is a number or not. This is very useful to prevent the ...</div><div class="ttdef"><b>Definition</b> memory_game.cpp:62</div></div>
-<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition</b> paranthesis_matching.cpp:20</div></div>
-<div class="ttc" id="apostfix__evaluation_8cpp_html_a59fd597e0ea394abe027ced4d2ea3338"><div class="ttname"><a href="#a59fd597e0ea394abe027ced4d2ea3338">others::postfix_expression::evaluate</a></div><div class="ttdeci">void evaluate(float a, float b, const std::string &amp;operation, Stack *stack)</div><div class="ttdoc">Evaluate answer using given last two operands from and operation.</div><div class="ttdef"><b>Definition</b> postfix_evaluation.cpp:77</div></div>
-<div class="ttc" id="astof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html">std::stof</a></div><div class="ttdeci">T stof(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.svg" width="630" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacegames_1_1memory__game_html_a33167bb9cce6d527b478b4f6ae8c3f59"><div class="ttname"><a href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59">games::memory_game::is_number</a></div><div class="ttdeci">bool is_number(const T &amp;input)</div><div class="ttdoc">Utility function to verify if the given input is a number or not. This is very useful to prevent the ...</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d92/memory__game_8cpp_source.html#l00062">memory_game.cpp:62</a></div></div>
+<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00020">paranthesis_matching.cpp:20</a></div></div>
+<div class="ttc" id="apostfix__evaluation_8cpp_html_a59fd597e0ea394abe027ced4d2ea3338"><div class="ttname"><a href="#a59fd597e0ea394abe027ced4d2ea3338">others::postfix_expression::evaluate</a></div><div class="ttdeci">void evaluate(float a, float b, const std::string &amp;operation, Stack *stack)</div><div class="ttdoc">Evaluate answer using given last two operands from and operation.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d75/postfix__evaluation_8cpp_source.html#l00077">postfix_evaluation.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad77f8c9cc594975756838d498c237cea" name="ad77f8c9cc594975756838d498c237cea"></a>
@@ -453,6 +456,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html">postfix_evaluation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   44</span>                                       {</div>
 <div class="line"><span class="lineno">   45</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>-&gt;<a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>++;</div>
 <div class="line"><span class="lineno">   46</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>-&gt;stack[<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>-&gt;<a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>] = operand;</div>
@@ -485,15 +490,16 @@ Here is the call graph for this function:</div>
 
 <p>Test function 1 with input array {'2', '3', '1', '*', '+', '9', '-'}. </p>
 <dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html#l00146">146</a> of file <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html">postfix_evaluation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  146</span>                              {</div>
-<div class="line"><span class="lineno">  147</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::string, 7&gt;</a> input = {<span class="stringliteral">&quot;2&quot;</span>, <span class="stringliteral">&quot;3&quot;</span>, <span class="stringliteral">&quot;1&quot;</span>, <span class="stringliteral">&quot;*&quot;</span>, <span class="stringliteral">&quot;+&quot;</span>, <span class="stringliteral">&quot;9&quot;</span>, <span class="stringliteral">&quot;-&quot;</span>};</div>
+<div class="line"><span class="lineno">  147</span>    std::array&lt;std::string, 7&gt; input = {<span class="stringliteral">&quot;2&quot;</span>, <span class="stringliteral">&quot;3&quot;</span>, <span class="stringliteral">&quot;1&quot;</span>, <span class="stringliteral">&quot;*&quot;</span>, <span class="stringliteral">&quot;+&quot;</span>, <span class="stringliteral">&quot;9&quot;</span>, <span class="stringliteral">&quot;-&quot;</span>};</div>
 <div class="line"><span class="lineno">  148</span> </div>
 <div class="line"><span class="lineno">  149</span>    <span class="keywordtype">float</span> answer = <a class="code hl_function" href="#ae38bd3a177a6d61da3859a281233bbe1">others::postfix_expression::postfix_evaluation</a>(input);</div>
 <div class="line"><span class="lineno">  150</span> </div>
 <div class="line"><span class="lineno">  151</span>    assert(answer == -4);</div>
 <div class="line"><span class="lineno">  152</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="apostfix__evaluation_8cpp_html_ae38bd3a177a6d61da3859a281233bbe1"><div class="ttname"><a href="#ae38bd3a177a6d61da3859a281233bbe1">others::postfix_expression::postfix_evaluation</a></div><div class="ttdeci">float postfix_evaluation(std::array&lt; std::string, N &gt; input)</div><div class="ttdoc">Postfix Evaluation algorithm to compute the value from given input array.</div><div class="ttdef"><b>Definition</b> postfix_evaluation.cpp:115</div></div>
+<div class="ttc" id="apostfix__evaluation_8cpp_html_ae38bd3a177a6d61da3859a281233bbe1"><div class="ttname"><a href="#ae38bd3a177a6d61da3859a281233bbe1">others::postfix_expression::postfix_evaluation</a></div><div class="ttdeci">float postfix_evaluation(std::array&lt; std::string, N &gt; input)</div><div class="ttdoc">Postfix Evaluation algorithm to compute the value from given input array.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d75/postfix__evaluation_8cpp_source.html#l00115">postfix_evaluation.cpp:115</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -522,8 +528,10 @@ Here is the call graph for this function:</div>
 
 <p>Test function 2 with input array {'1', '2', '+', '2', '/', '5', '*', '7', '+'}. </p>
 <dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html#l00159">159</a> of file <a class="el" href="../../d7/d75/postfix__evaluation_8cpp_source.html">postfix_evaluation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  159</span>                              {</div>
-<div class="line"><span class="lineno">  160</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::string, 9&gt;</a> input = {<span class="stringliteral">&quot;100&quot;</span>, <span class="stringliteral">&quot;200&quot;</span>, <span class="stringliteral">&quot;+&quot;</span>, <span class="stringliteral">&quot;2&quot;</span>, <span class="stringliteral">&quot;/&quot;</span>,</div>
+<div class="line"><span class="lineno">  160</span>    std::array&lt;std::string, 9&gt; input = {<span class="stringliteral">&quot;100&quot;</span>, <span class="stringliteral">&quot;200&quot;</span>, <span class="stringliteral">&quot;+&quot;</span>, <span class="stringliteral">&quot;2&quot;</span>, <span class="stringliteral">&quot;/&quot;</span>,</div>
 <div class="line"><span class="lineno">  161</span>                                        <span class="stringliteral">&quot;5&quot;</span>,   <span class="stringliteral">&quot;*&quot;</span>,   <span class="stringliteral">&quot;7&quot;</span>, <span class="stringliteral">&quot;+&quot;</span>};</div>
 <div class="line"><span class="lineno">  162</span>    <span class="keywordtype">float</span> answer = <a class="code hl_function" href="#ae38bd3a177a6d61da3859a281233bbe1">others::postfix_expression::postfix_evaluation</a>(input);</div>
 <div class="line"><span class="lineno">  163</span> </div>
diff --git a/d7/d75/postfix__evaluation_8cpp_a4c27f949c9d6659be9f5bd2ccbe1360a_cgraph.map b/d7/d75/postfix__evaluation_8cpp_a4c27f949c9d6659be9f5bd2ccbe1360a_cgraph.map
deleted file mode 100644
index c7079c29f..000000000
--- a/d7/d75/postfix__evaluation_8cpp_a4c27f949c9d6659be9f5bd2ccbe1360a_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="others::postfix_expression::is_number" name="others::postfix_expression::is_number">
-<area shape="rect" id="Node000001" title="Checks if scanned string is a number." alt="" coords="5,72,180,113"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/all_any_none_of.html#" title=" " alt="" coords="250,5,328,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="147,69,238,34,240,39,149,74"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/begin.html#" title=" " alt="" coords="230,55,348,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="180,79,214,74,215,80,180,84"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/empty.html#" title=" " alt="" coords="228,104,351,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="180,101,213,105,212,110,180,106"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/end.html#" title=" " alt="" coords="235,153,344,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="150,111,239,145,237,150,148,116"/>
-</map>
diff --git a/d7/d75/postfix__evaluation_8cpp_a4c27f949c9d6659be9f5bd2ccbe1360a_cgraph.md5 b/d7/d75/postfix__evaluation_8cpp_a4c27f949c9d6659be9f5bd2ccbe1360a_cgraph.md5
deleted file mode 100644
index 5ca6fe683..000000000
--- a/d7/d75/postfix__evaluation_8cpp_a4c27f949c9d6659be9f5bd2ccbe1360a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ce7e9a48842519322f5c791d0a8962c3
\ No newline at end of file
diff --git a/d7/d75/postfix__evaluation_8cpp_a4c27f949c9d6659be9f5bd2ccbe1360a_cgraph.svg b/d7/d75/postfix__evaluation_8cpp_a4c27f949c9d6659be9f5bd2ccbe1360a_cgraph.svg
deleted file mode 100644
index 5f64720b1..000000000
--- a/d7/d75/postfix__evaluation_8cpp_a4c27f949c9d6659be9f5bd2ccbe1360a_cgraph.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::postfix_expression::is_number Pages: 1 -->
-<svg width="267pt" height="138pt"
- viewBox="0.00 0.00 267.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>others::postfix_expression::is_number</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Checks if scanned string is a number.">
-<polygon fill="#999999" stroke="#666666" points="130.75,-79.88 0,-79.88 0,-49.38 130.75,-49.38 130.75,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::postfix_expression</text>
-<text text-anchor="middle" x="65.38" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::is_number</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242.38,-130.25 183.62,-130.25 183.62,-111 242.38,-111 242.38,-130.25"/>
-<text text-anchor="middle" x="213" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.33,-80.37C128.72,-88.6 154.68,-98.58 175.4,-106.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174,-109.76 184.59,-110.09 176.51,-103.23 174,-109.76"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257.38,-93.25 168.62,-93.25 168.62,-74 257.38,-74 257.38,-93.25"/>
-<text text-anchor="middle" x="213" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.1,-73.07C139.77,-74.2 148.59,-75.35 157.07,-76.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.5,-79.91 166.87,-77.74 157.41,-72.97 156.5,-79.91"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.25,-56.25 166.75,-56.25 166.75,-37 259.25,-37 259.25,-56.25"/>
-<text text-anchor="middle" x="213" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.1,-56.63C139.16,-55.63 147.36,-54.62 155.29,-53.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.67,-57.11 165.17,-52.41 154.81,-50.17 155.67,-57.11"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.62,-19.25 172.38,-19.25 172.38,0 253.62,0 253.62,-19.25"/>
-<text text-anchor="middle" x="213" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.72,-49.01C128.81,-41.04 154.28,-31.43 174.76,-23.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.73,-27.06 183.85,-20.26 173.26,-20.51 175.73,-27.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d75/postfix__evaluation_8cpp_a4c27f949c9d6659be9f5bd2ccbe1360a_cgraph_org.svg b/d7/d75/postfix__evaluation_8cpp_a4c27f949c9d6659be9f5bd2ccbe1360a_cgraph_org.svg
deleted file mode 100644
index 58a5b735c..000000000
--- a/d7/d75/postfix__evaluation_8cpp_a4c27f949c9d6659be9f5bd2ccbe1360a_cgraph_org.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::postfix_expression::is_number Pages: 1 -->
-<svg width="267pt" height="138pt"
- viewBox="0.00 0.00 267.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>others::postfix_expression::is_number</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Checks if scanned string is a number.">
-<polygon fill="#999999" stroke="#666666" points="130.75,-79.88 0,-79.88 0,-49.38 130.75,-49.38 130.75,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::postfix_expression</text>
-<text text-anchor="middle" x="65.38" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::is_number</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242.38,-130.25 183.62,-130.25 183.62,-111 242.38,-111 242.38,-130.25"/>
-<text text-anchor="middle" x="213" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.33,-80.37C128.72,-88.6 154.68,-98.58 175.4,-106.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174,-109.76 184.59,-110.09 176.51,-103.23 174,-109.76"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257.38,-93.25 168.62,-93.25 168.62,-74 257.38,-74 257.38,-93.25"/>
-<text text-anchor="middle" x="213" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.1,-73.07C139.77,-74.2 148.59,-75.35 157.07,-76.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.5,-79.91 166.87,-77.74 157.41,-72.97 156.5,-79.91"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.25,-56.25 166.75,-56.25 166.75,-37 259.25,-37 259.25,-56.25"/>
-<text text-anchor="middle" x="213" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.1,-56.63C139.16,-55.63 147.36,-54.62 155.29,-53.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.67,-57.11 165.17,-52.41 154.81,-50.17 155.67,-57.11"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.62,-19.25 172.38,-19.25 172.38,0 253.62,0 253.62,-19.25"/>
-<text text-anchor="middle" x="213" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.72,-49.01C128.81,-41.04 154.28,-31.43 174.76,-23.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.73,-27.06 183.85,-20.26 173.26,-20.51 175.73,-27.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.map b/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.map
deleted file mode 100644
index 83cef9976..000000000
--- a/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="others::postfix_expression::evaluate" name="others::postfix_expression::evaluate">
-<area shape="rect" id="Node000001" title="Evaluate answer using given last two operands from and operation." alt="" coords="5,29,180,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="51,29,48,19,55,10,70,5,93,3,117,5,131,11,129,16,115,10,92,8,71,10,58,15,54,21,56,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/c_str.html#" title=" " alt="" coords="257,8,373,33"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="180,36,242,27,242,33,180,41"/>
-<area shape="rect" id="Node000003" href="$d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea" title="Pushing operand, also called the number in the array to the stack." alt="" coords="228,57,402,98"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="180,58,212,62,212,67,180,63"/>
-</map>
diff --git a/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.md5 b/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.md5
deleted file mode 100644
index 83cc01212..000000000
--- a/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5f3522cd4ba9b85bae8ea942d8f6330d
\ No newline at end of file
diff --git a/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.svg b/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.svg
deleted file mode 100644
index 85b0b6458..000000000
--- a/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::postfix_expression::evaluate Pages: 1 -->
-<svg width="306pt" height="78pt"
- viewBox="0.00 0.00 305.50 77.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 73.5)">
-<title>others::postfix_expression::evaluate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Evaluate answer using given last two operands from and operation.">
-<polygon fill="#999999" stroke="#666666" points="130.75,-51.5 0,-51.5 0,-21 130.75,-21 130.75,-51.5"/>
-<text text-anchor="start" x="8" y="-38" font-family="Helvetica,sans-Serif" font-size="10.00">others::postfix_expression</text>
-<text text-anchor="middle" x="65.38" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">::evaluate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.83,-51.99C29.8,-61.06 39.65,-69.5 65.38,-69.5 79.45,-69.5 88.77,-66.97 93.34,-63.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.78,-63.88 94.71,-53.48 89.85,-62.9 96.78,-63.88"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275.75,-67.88 188.5,-67.88 188.5,-48.62 275.75,-48.62 275.75,-67.88"/>
-<text text-anchor="middle" x="232.12" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::c_str</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.02,-44.88C146.39,-46.93 162.63,-49.1 177.45,-51.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.59,-54.5 186.97,-52.35 177.52,-47.56 176.59,-54.5"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea" target="_top" xlink:title="Pushing operand, also called the number in the array to the stack.">
-<polygon fill="white" stroke="#666666" points="297.5,-30.5 166.75,-30.5 166.75,0 297.5,0 297.5,-30.5"/>
-<text text-anchor="start" x="174.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::postfix_expression</text>
-<text text-anchor="middle" x="232.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.02,-28.01C138.92,-27 147.05,-25.97 155.1,-24.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.42,-28.43 164.9,-23.69 154.54,-21.48 155.42,-28.43"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph_org.svg b/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph_org.svg
deleted file mode 100644
index f53a41548..000000000
--- a/d7/d75/postfix__evaluation_8cpp_a59fd597e0ea394abe027ced4d2ea3338_cgraph_org.svg
+++ /dev/null
@@ -1,68 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::postfix_expression::evaluate Pages: 1 -->
-<svg width="306pt" height="78pt"
- viewBox="0.00 0.00 305.50 77.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 73.5)">
-<title>others::postfix_expression::evaluate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Evaluate answer using given last two operands from and operation.">
-<polygon fill="#999999" stroke="#666666" points="130.75,-51.5 0,-51.5 0,-21 130.75,-21 130.75,-51.5"/>
-<text text-anchor="start" x="8" y="-38" font-family="Helvetica,sans-Serif" font-size="10.00">others::postfix_expression</text>
-<text text-anchor="middle" x="65.38" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">::evaluate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.83,-51.99C29.8,-61.06 39.65,-69.5 65.38,-69.5 79.45,-69.5 88.77,-66.97 93.34,-63.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.78,-63.88 94.71,-53.48 89.85,-62.9 96.78,-63.88"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275.75,-67.88 188.5,-67.88 188.5,-48.62 275.75,-48.62 275.75,-67.88"/>
-<text text-anchor="middle" x="232.12" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::c_str</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.02,-44.88C146.39,-46.93 162.63,-49.1 177.45,-51.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.59,-54.5 186.97,-52.35 177.52,-47.56 176.59,-54.5"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea" target="_top" xlink:title="Pushing operand, also called the number in the array to the stack.">
-<polygon fill="white" stroke="#666666" points="297.5,-30.5 166.75,-30.5 166.75,0 297.5,0 297.5,-30.5"/>
-<text text-anchor="start" x="174.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::postfix_expression</text>
-<text text-anchor="middle" x="232.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.02,-28.01C138.92,-27 147.05,-25.97 155.1,-24.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.42,-28.43 164.9,-23.69 154.54,-21.48 155.42,-28.43"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.map b/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.map
deleted file mode 100644
index e648ebe7a..000000000
--- a/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="others::postfix_expression::postfix_evaluation" name="others::postfix_expression::postfix_evaluation">
-<area shape="rect" id="Node000001" title="Postfix Evaluation algorithm to compute the value from given input array." alt="" coords="5,59,180,99"/>
-<area shape="poly" id="edge5_Node000001_Node000001" title=" " alt="" coords="51,59,48,49,55,40,70,34,93,32,117,34,131,41,129,46,115,40,92,37,71,39,58,44,54,50,56,57"/>
-<area shape="rect" id="Node000002" href="$d7/d75/postfix__evaluation_8cpp.html#a59fd597e0ea394abe027ced4d2ea3338" title="Evaluate answer using given last two operands from and operation." alt="" coords="228,29,402,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="180,65,212,61,212,66,180,70"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/stof.html#" title=" " alt="" coords="280,94,350,120"/>
-<area shape="poly" id="edge6_Node000001_Node000005" title=" " alt="" coords="180,87,265,98,264,103,180,93"/>
-<area shape="poly" id="edge3_Node000002_Node000002" title=" " alt="" coords="273,29,271,19,278,10,292,5,315,3,339,5,353,11,351,16,338,10,315,8,294,10,281,15,276,21,278,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/c_str.html#" title=" " alt="" coords="479,9,595,34"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="402,36,464,28,465,33,403,41"/>
-<area shape="rect" id="Node000004" href="$d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea" title="Pushing operand, also called the number in the array to the stack." alt="" coords="450,59,624,99"/>
-<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="403,59,435,63,434,68,402,64"/>
-</map>
diff --git a/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.md5 b/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.md5
deleted file mode 100644
index d0542c966..000000000
--- a/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b5699b9b691e04a5c4f76b43113e0347
\ No newline at end of file
diff --git a/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.svg b/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.svg
deleted file mode 100644
index 782295a96..000000000
--- a/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph.svg
+++ /dev/null
@@ -1,140 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::postfix_expression::postfix_evaluation Pages: 1 -->
-<svg width="472pt" height="94pt"
- viewBox="0.00 0.00 472.25 93.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89.88)">
-<title>others::postfix_expression::postfix_evaluation</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Postfix Evaluation algorithm to compute the value from given input array.">
-<polygon fill="#999999" stroke="#666666" points="130.75,-45.88 0,-45.88 0,-15.37 130.75,-15.37 130.75,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::postfix_expression</text>
-<text text-anchor="middle" x="65.38" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::postfix_evaluation</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.83,-46.36C29.8,-55.43 39.65,-63.88 65.38,-63.88 79.45,-63.88 88.77,-61.35 93.34,-57.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.78,-58.25 94.71,-47.86 89.85,-57.27 96.78,-58.25"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d75/postfix__evaluation_8cpp.html#a59fd597e0ea394abe027ced4d2ea3338" target="_top" xlink:title="Evaluate answer using given last two operands from and operation.">
-<polygon fill="white" stroke="#666666" points="297.5,-67.88 166.75,-67.88 166.75,-37.38 297.5,-37.38 297.5,-67.88"/>
-<text text-anchor="start" x="174.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::postfix_expression</text>
-<text text-anchor="middle" x="232.12" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::evaluate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.02,-39.26C138.92,-40.31 147.05,-41.4 155.1,-42.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.52,-45.93 164.9,-43.78 155.45,-38.99 154.52,-45.93"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.12,-19.25 206.12,-19.25 206.12,0 258.12,0 258.12,-19.25"/>
-<text text-anchor="middle" x="232.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stof</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.02,-22.39C152.56,-19.64 175.81,-16.68 194.47,-14.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.75,-17.79 204.23,-13.05 193.86,-10.85 194.75,-17.79"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.58,-68.36C196.55,-77.43 206.4,-85.88 232.12,-85.88 246.2,-85.88 255.52,-83.35 260.09,-79.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="263.53,-80.25 261.46,-69.86 256.6,-79.27 263.53,-80.25"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="442.5,-83.25 355.25,-83.25 355.25,-64 442.5,-64 442.5,-83.25"/>
-<text text-anchor="middle" x="398.88" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::c_str</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.77,-60.86C313.14,-62.82 329.38,-64.89 344.2,-66.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="343.35,-70.2 353.72,-68 344.24,-63.26 343.35,-70.2"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea" target="_top" xlink:title="Pushing operand, also called the number in the array to the stack.">
-<polygon fill="white" stroke="#666666" points="464.25,-45.88 333.5,-45.88 333.5,-15.37 464.25,-15.37 464.25,-45.88"/>
-<text text-anchor="start" x="341.5" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::postfix_expression</text>
-<text text-anchor="middle" x="398.88" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.77,-43.99C305.67,-42.94 313.8,-41.85 321.85,-40.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.2,-44.26 331.65,-39.47 321.27,-37.32 322.2,-44.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph_org.svg b/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph_org.svg
deleted file mode 100644
index 3dc7c18c1..000000000
--- a/d7/d75/postfix__evaluation_8cpp_ae38bd3a177a6d61da3859a281233bbe1_cgraph_org.svg
+++ /dev/null
@@ -1,114 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::postfix_expression::postfix_evaluation Pages: 1 -->
-<svg width="472pt" height="94pt"
- viewBox="0.00 0.00 472.25 93.88" 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.88)">
-<title>others::postfix_expression::postfix_evaluation</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Postfix Evaluation algorithm to compute the value from given input array.">
-<polygon fill="#999999" stroke="#666666" points="130.75,-45.88 0,-45.88 0,-15.37 130.75,-15.37 130.75,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::postfix_expression</text>
-<text text-anchor="middle" x="65.38" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::postfix_evaluation</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.83,-46.36C29.8,-55.43 39.65,-63.88 65.38,-63.88 79.45,-63.88 88.77,-61.35 93.34,-57.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.78,-58.25 94.71,-47.86 89.85,-57.27 96.78,-58.25"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d75/postfix__evaluation_8cpp.html#a59fd597e0ea394abe027ced4d2ea3338" target="_top" xlink:title="Evaluate answer using given last two operands from and operation.">
-<polygon fill="white" stroke="#666666" points="297.5,-67.88 166.75,-67.88 166.75,-37.38 297.5,-37.38 297.5,-67.88"/>
-<text text-anchor="start" x="174.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::postfix_expression</text>
-<text text-anchor="middle" x="232.12" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::evaluate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.02,-39.26C138.92,-40.31 147.05,-41.4 155.1,-42.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.52,-45.93 164.9,-43.78 155.45,-38.99 154.52,-45.93"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.12,-19.25 206.12,-19.25 206.12,0 258.12,0 258.12,-19.25"/>
-<text text-anchor="middle" x="232.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stof</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.02,-22.39C152.56,-19.64 175.81,-16.68 194.47,-14.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.75,-17.79 204.23,-13.05 193.86,-10.85 194.75,-17.79"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.58,-68.36C196.55,-77.43 206.4,-85.88 232.12,-85.88 246.2,-85.88 255.52,-83.35 260.09,-79.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="263.53,-80.25 261.46,-69.86 256.6,-79.27 263.53,-80.25"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/c_str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="442.5,-83.25 355.25,-83.25 355.25,-64 442.5,-64 442.5,-83.25"/>
-<text text-anchor="middle" x="398.88" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::c_str</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.77,-60.86C313.14,-62.82 329.38,-64.89 344.2,-66.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="343.35,-70.2 353.72,-68 344.24,-63.26 343.35,-70.2"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea" target="_top" xlink:title="Pushing operand, also called the number in the array to the stack.">
-<polygon fill="white" stroke="#666666" points="464.25,-45.88 333.5,-45.88 333.5,-15.37 464.25,-15.37 464.25,-45.88"/>
-<text text-anchor="start" x="341.5" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::postfix_expression</text>
-<text text-anchor="middle" x="398.88" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.77,-43.99C305.67,-42.94 313.8,-41.85 321.85,-40.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.2,-44.26 331.65,-39.47 321.27,-37.32 322.2,-44.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d75/postfix__evaluation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d7/d75/postfix__evaluation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index ca628e6a0..000000000
--- a/d7/d75/postfix__evaluation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$d7/d75/postfix__evaluation_8cpp.html#a6a8eeb7d346d5cd6335d9780fb7c0f15" title="Test function 1 with input array {&#39;2&#39;, &#39;3&#39;, &#39;1&#39;, &#39;*&#39;, &#39;+&#39;, &#39;9&#39;, &#39;&#45;&#39;}." alt="" coords="103,5,213,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,36,87,30,88,35,55,41"/>
-<area shape="rect" id="Node000003" href="$d7/d75/postfix__evaluation_8cpp.html#a5b97d12e8b61484f756a8721992bfae1" title="Test function 2 with input array {&#39;1&#39;, &#39;2&#39;, &#39;+&#39;, &#39;2&#39;, &#39;/&#39;, &#39;5&#39;, &#39;*&#39;, &#39;7&#39;, &#39;+&#39;}." alt="" coords="103,55,213,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,45,88,52,87,57,54,51"/>
-</map>
diff --git a/d7/d75/postfix__evaluation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d7/d75/postfix__evaluation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index e785fa2b1..000000000
--- a/d7/d75/postfix__evaluation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ec1b874e1bbfb93c22fc88559566af34
\ No newline at end of file
diff --git a/d7/d75/postfix__evaluation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d7/d75/postfix__evaluation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 8d017e270..000000000
--- a/d7/d75/postfix__evaluation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="164pt" height="64pt"
- viewBox="0.00 0.00 163.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d75/postfix__evaluation_8cpp.html#a6a8eeb7d346d5cd6335d9780fb7c0f15" target="_top" xlink:title="Test function 1 with input array {&#39;2&#39;, &#39;3&#39;, &#39;1&#39;, &#39;*&#39;, &#39;+&#39;, &#39;9&#39;, &#39;&#45;&#39;}.">
-<polygon fill="white" stroke="#666666" points="155.75,-56.25 73,-56.25 73,-37 155.75,-37 155.75,-56.25"/>
-<text text-anchor="middle" x="114.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_function_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.16,-31.2C44.25,-32.63 52.83,-34.37 61.64,-36.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.85,-39.57 71.35,-38.12 62.24,-32.7 60.85,-39.57"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d75/postfix__evaluation_8cpp.html#a5b97d12e8b61484f756a8721992bfae1" target="_top" xlink:title="Test function 2 with input array {&#39;1&#39;, &#39;2&#39;, &#39;+&#39;, &#39;2&#39;, &#39;/&#39;, &#39;5&#39;, &#39;*&#39;, &#39;7&#39;, &#39;+&#39;}.">
-<polygon fill="white" stroke="#666666" points="155.75,-19.25 73,-19.25 73,0 155.75,0 155.75,-19.25"/>
-<text text-anchor="middle" x="114.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_function_2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.16,-24.24C44.25,-22.88 52.83,-21.23 61.64,-19.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.18,-23.01 71.34,-17.68 60.86,-16.13 62.18,-23.01"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d75/postfix__evaluation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d7/d75/postfix__evaluation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index be569ec25..000000000
--- a/d7/d75/postfix__evaluation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="164pt" height="64pt"
- viewBox="0.00 0.00 163.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d75/postfix__evaluation_8cpp.html#a6a8eeb7d346d5cd6335d9780fb7c0f15" target="_top" xlink:title="Test function 1 with input array {&#39;2&#39;, &#39;3&#39;, &#39;1&#39;, &#39;*&#39;, &#39;+&#39;, &#39;9&#39;, &#39;&#45;&#39;}.">
-<polygon fill="white" stroke="#666666" points="155.75,-56.25 73,-56.25 73,-37 155.75,-37 155.75,-56.25"/>
-<text text-anchor="middle" x="114.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_function_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.16,-31.2C44.25,-32.63 52.83,-34.37 61.64,-36.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.85,-39.57 71.35,-38.12 62.24,-32.7 60.85,-39.57"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d75/postfix__evaluation_8cpp.html#a5b97d12e8b61484f756a8721992bfae1" target="_top" xlink:title="Test function 2 with input array {&#39;1&#39;, &#39;2&#39;, &#39;+&#39;, &#39;2&#39;, &#39;/&#39;, &#39;5&#39;, &#39;*&#39;, &#39;7&#39;, &#39;+&#39;}.">
-<polygon fill="white" stroke="#666666" points="155.75,-19.25 73,-19.25 73,0 155.75,0 155.75,-19.25"/>
-<text text-anchor="middle" x="114.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_function_2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.16,-24.24C44.25,-22.88 52.83,-21.23 61.64,-19.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.18,-23.01 71.34,-17.68 60.86,-16.13 62.18,-23.01"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d75/postfix__evaluation_8cpp_source.html b/d7/d75/postfix__evaluation_8cpp_source.html
new file mode 100644
index 000000000..d05836ec7
--- /dev/null
+++ b/d7/d75/postfix__evaluation_8cpp_source.html
@@ -0,0 +1,279 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/postfix_evaluation.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/d75/postfix__evaluation_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">postfix_evaluation.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d7/d75/postfix__evaluation_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  <span class="comment">// for all_of</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;array&gt;</span>      <span class="comment">// for std::array</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cassert&gt;</span>    <span class="comment">// for assert</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;iostream&gt;</span>   <span class="comment">// for io operations</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;string&gt;</span>     <span class="comment">// for stof</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/d6f/namespaceothers.html">others</a> {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d4/de6/namespacepostfix__expression.html">postfix_expression</a> {</div>
+<div class="foldopen" id="foldopen00032" data-start="{" data-end="};">
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html">   32</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html">Stack</a> {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#af06360122e20ce2ba32c574a27a20ba1">   34</a></span>    std::array&lt;float, 20&gt; <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>{}; </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#a6ae98710503b894b843d01cb69d5490c">   35</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#a6ae98710503b894b843d01cb69d5490c">stackTop</a> = -1;            </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>};</div>
+</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="foldopen" id="foldopen00044" data-start="{" data-end="}">
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="../../d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea">   44</a></span><span class="keywordtype">void</span> push(<span class="keywordtype">float</span> operand, <a class="code hl_class" href="../../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html">Stack</a> *<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>-&gt;<a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>++;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>-&gt;stack[<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>-&gt;<a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>] = operand;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>}</div>
+</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="foldopen" id="foldopen00054" data-start="{" data-end="}">
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="../../d7/d75/postfix__evaluation_8cpp.html#a421baa2002a64bc0bfc3e1b64800d734">   54</a></span><span class="keywordtype">float</span> pop(<a class="code hl_class" href="../../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html">Stack</a> *<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordtype">float</span> operand = <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>-&gt;stack[<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>-&gt;<a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>];</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>-&gt;<a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>--;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">return</span> operand;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}</div>
+</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="foldopen" id="foldopen00065" data-start="{" data-end="}">
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="../../d7/d75/postfix__evaluation_8cpp.html#a4c27f949c9d6659be9f5bd2ccbe1360a">   65</a></span><span class="keywordtype">bool</span> is_number(<span class="keyword">const</span> std::string &amp;s) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">return</span> !s.empty() &amp;&amp; std::all_of(s.begin(), s.end(), ::isdigit);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>}</div>
+</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="foldopen" id="foldopen00077" data-start="{" data-end="}">
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../d7/d75/postfix__evaluation_8cpp.html#a59fd597e0ea394abe027ced4d2ea3338">   77</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/d75/postfix__evaluation_8cpp.html#a59fd597e0ea394abe027ced4d2ea3338">evaluate</a>(<span class="keywordtype">float</span> a, <span class="keywordtype">float</span> b, <span class="keyword">const</span> std::string &amp;operation, <a class="code hl_class" href="../../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html">Stack</a> *<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordtype">float</span> c = 0;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keyword">const</span> <span class="keywordtype">char</span> *op = operation.c_str();</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordflow">switch</span> (*op) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;+&#39;</span>:</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>            c = a + b; <span class="comment">// Addition of numbers</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            <a class="code hl_function" href="../../d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea">others::postfix_expression::push</a>(c, <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;-&#39;</span>:</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            c = a - b; <span class="comment">// Subtraction of numbers</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>            <a class="code hl_function" href="../../d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea">others::postfix_expression::push</a>(c, <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;*&#39;</span>:</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>            c = a * b; <span class="comment">// Multiplication of numbers</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>            <a class="code hl_function" href="../../d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea">others::postfix_expression::push</a>(c, <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;/&#39;</span>:</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            c = a / b; <span class="comment">// Division of numbers</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>            <a class="code hl_function" href="../../d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea">others::postfix_expression::push</a>(c, <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        <span class="keywordflow">default</span>:</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Operator not defined\n&quot;</span>;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    }</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>}</div>
+</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span><span class="keyword">template</span> &lt;std::<span class="keywordtype">size_t</span> N&gt;</div>
+<div class="foldopen" id="foldopen00115" data-start="{" data-end="}">
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"><a class="line" href="../../d7/d75/postfix__evaluation_8cpp.html#ae38bd3a177a6d61da3859a281233bbe1">  115</a></span><span class="keywordtype">float</span> <a class="code hl_function" href="../../d7/d75/postfix__evaluation_8cpp.html#ae38bd3a177a6d61da3859a281233bbe1">postfix_evaluation</a>(std::array&lt;std::string, N&gt; input) {</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <a class="code hl_class" href="../../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html">Stack</a> <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="keywordtype">int</span> j = 0;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <span class="keywordflow">while</span> (j &lt; N) {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        std::string scan = input[j];</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        <span class="keywordflow">if</span> (is_number(scan)) {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>            push(std::stof(scan), &amp;<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>);</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>            <span class="keywordtype">float</span> op2 = pop(&amp;<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>            <span class="keywordtype">float</span> op1 = pop(&amp;<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span> </div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>            <a class="code hl_function" href="../../d7/d75/postfix__evaluation_8cpp.html#a59fd597e0ea394abe027ced4d2ea3338">evaluate</a>(op1, op2, scan, &amp;<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>);</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        }</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        j++;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    }</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    std::cout &lt;&lt; <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.stack[<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>] &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.stack[<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>];</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>}</div>
+</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>}  <span class="comment">// namespace postfix_expression</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>}  <span class="comment">// namespace others</span></div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span> </div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span> </div>
+<div class="foldopen" id="foldopen00146" data-start="{" data-end="}">
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"><a class="line" href="../../d7/d75/postfix__evaluation_8cpp.html#a6a8eeb7d346d5cd6335d9780fb7c0f15">  146</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/d75/postfix__evaluation_8cpp.html#a6a8eeb7d346d5cd6335d9780fb7c0f15">test_function_1</a>() {</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    std::array&lt;std::string, 7&gt; input = {<span class="stringliteral">&quot;2&quot;</span>, <span class="stringliteral">&quot;3&quot;</span>, <span class="stringliteral">&quot;1&quot;</span>, <span class="stringliteral">&quot;*&quot;</span>, <span class="stringliteral">&quot;+&quot;</span>, <span class="stringliteral">&quot;9&quot;</span>, <span class="stringliteral">&quot;-&quot;</span>};</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span> </div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    <span class="keywordtype">float</span> answer = others::postfix_expression::postfix_evaluation(input);</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    assert(answer == -4);</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>}</div>
+</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span> </div>
+<div class="foldopen" id="foldopen00159" data-start="{" data-end="}">
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"><a class="line" href="../../d7/d75/postfix__evaluation_8cpp.html#a5b97d12e8b61484f756a8721992bfae1">  159</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/d75/postfix__evaluation_8cpp.html#a5b97d12e8b61484f756a8721992bfae1">test_function_2</a>() {</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    std::array&lt;std::string, 9&gt; input = {<span class="stringliteral">&quot;100&quot;</span>, <span class="stringliteral">&quot;200&quot;</span>, <span class="stringliteral">&quot;+&quot;</span>, <span class="stringliteral">&quot;2&quot;</span>, <span class="stringliteral">&quot;/&quot;</span>,</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>                                        <span class="stringliteral">&quot;5&quot;</span>,   <span class="stringliteral">&quot;*&quot;</span>,   <span class="stringliteral">&quot;7&quot;</span>, <span class="stringliteral">&quot;+&quot;</span>};</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    <span class="keywordtype">float</span> answer = others::postfix_expression::postfix_evaluation(input);</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span> </div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    assert(answer == 757);</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>}</div>
+</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span> </div>
+<div class="foldopen" id="foldopen00171" data-start="{" data-end="}">
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"><a class="line" href="../../d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  171</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <a class="code hl_function" href="../../d7/d75/postfix__evaluation_8cpp.html#a6a8eeb7d346d5cd6335d9780fb7c0f15">test_function_1</a>();</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    <a class="code hl_function" href="../../d7/d75/postfix__evaluation_8cpp.html#a5b97d12e8b61484f756a8721992bfae1">test_function_2</a>();</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span> </div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest implementations passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>}</div>
+</div>
+<div class="ttc" id="aclassothers_1_1postfix__expression_1_1_stack_html"><div class="ttname"><a href="../../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html">others::postfix_expression::Stack</a></div><div class="ttdoc">Creates an array to be used as stack for storing values.</div><div class="ttdef"><b>Definition</b> <a href="#l00032">postfix_evaluation.cpp:32</a></div></div>
+<div class="ttc" id="aclassothers_1_1postfix__expression_1_1_stack_html_a6ae98710503b894b843d01cb69d5490c"><div class="ttname"><a href="../../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#a6ae98710503b894b843d01cb69d5490c">others::postfix_expression::Stack::stackTop</a></div><div class="ttdeci">int stackTop</div><div class="ttdoc">Represents the index of the last value added to array. -1 means array is empty.</div><div class="ttdef"><b>Definition</b> <a href="#l00035">postfix_evaluation.cpp:35</a></div></div>
+<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00019">stack.hpp:19</a></div></div>
+<div class="ttc" id="aclassstack_html_aefb3dac828e32b4ec014ff4b5d43a6b8"><div class="ttname"><a href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stack::stackTop</a></div><div class="ttdeci">std::shared_ptr&lt; Node&lt; value_type &gt; &gt; stackTop</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00075">stack.hpp:75</a></div></div>
+<div class="ttc" id="anamespaceothers_html"><div class="ttname"><a href="../../d0/d6f/namespaceothers.html">others</a></div><div class="ttdoc">for vector</div></div>
+<div class="ttc" id="anamespacepostfix__expression_html"><div class="ttname"><a href="../../d4/de6/namespacepostfix__expression.html">postfix_expression</a></div><div class="ttdoc">Functions for Postfix Expression algorithm.</div></div>
+<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00020">paranthesis_matching.cpp:20</a></div></div>
+<div class="ttc" id="apostfix__evaluation_8cpp_html_a59fd597e0ea394abe027ced4d2ea3338"><div class="ttname"><a href="../../d7/d75/postfix__evaluation_8cpp.html#a59fd597e0ea394abe027ced4d2ea3338">others::postfix_expression::evaluate</a></div><div class="ttdeci">void evaluate(float a, float b, const std::string &amp;operation, Stack *stack)</div><div class="ttdoc">Evaluate answer using given last two operands from and operation.</div><div class="ttdef"><b>Definition</b> <a href="#l00077">postfix_evaluation.cpp:77</a></div></div>
+<div class="ttc" id="apostfix__evaluation_8cpp_html_a5b97d12e8b61484f756a8721992bfae1"><div class="ttname"><a href="../../d7/d75/postfix__evaluation_8cpp.html#a5b97d12e8b61484f756a8721992bfae1">test_function_2</a></div><div class="ttdeci">static void test_function_2()</div><div class="ttdoc">Test function 2 with input array {'1', '2', '+', '2', '/', '5', '*', '7', '+'}.</div><div class="ttdef"><b>Definition</b> <a href="#l00159">postfix_evaluation.cpp:159</a></div></div>
+<div class="ttc" id="apostfix__evaluation_8cpp_html_a6a8eeb7d346d5cd6335d9780fb7c0f15"><div class="ttname"><a href="../../d7/d75/postfix__evaluation_8cpp.html#a6a8eeb7d346d5cd6335d9780fb7c0f15">test_function_1</a></div><div class="ttdeci">static void test_function_1()</div><div class="ttdoc">Test function 1 with input array {'2', '3', '1', '*', '+', '9', '-'}.</div><div class="ttdef"><b>Definition</b> <a href="#l00146">postfix_evaluation.cpp:146</a></div></div>
+<div class="ttc" id="apostfix__evaluation_8cpp_html_ad77f8c9cc594975756838d498c237cea"><div class="ttname"><a href="../../d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea">others::postfix_expression::push</a></div><div class="ttdeci">void push(float operand, Stack *stack)</div><div class="ttdoc">Pushing operand, also called the number in the array to the stack.</div><div class="ttdef"><b>Definition</b> <a href="#l00044">postfix_evaluation.cpp:44</a></div></div>
+<div class="ttc" id="apostfix__evaluation_8cpp_html_ae38bd3a177a6d61da3859a281233bbe1"><div class="ttname"><a href="../../d7/d75/postfix__evaluation_8cpp.html#ae38bd3a177a6d61da3859a281233bbe1">others::postfix_expression::postfix_evaluation</a></div><div class="ttdeci">float postfix_evaluation(std::array&lt; std::string, N &gt; input)</div><div class="ttdoc">Postfix Evaluation algorithm to compute the value from given input array.</div><div class="ttdef"><b>Definition</b> <a href="#l00115">postfix_evaluation.cpp:115</a></div></div>
+<div class="ttc" id="apostfix__evaluation_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00171">postfix_evaluation.cpp:171</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../d7/d75/postfix__evaluation_8cpp.html">postfix_evaluation.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.map b/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.map
index 67a3e00d0..00e444f60 100644
--- a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.map
+++ b/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.map
@@ -1,5 +1,5 @@
 <map id="std::is_unsigned&lt; uint256_t &gt;" name="std::is_unsigned&lt; uint256_t &gt;">
 <area shape="rect" id="Node000001" title=" " alt="" coords="5,79,199,105"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integral_constant.html" title=" " alt="" coords="51,5,153,31"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="51,5,153,31"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="105,46,105,79,99,79,99,46"/>
 </map>
diff --git a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.md5 b/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.md5
index 89f87ec0c..6915f6ced 100644
--- a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.md5
+++ b/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.md5
@@ -1 +1 @@
-8a2c8d932f73b2177cbc2496a8096375
\ No newline at end of file
+5da2e6ca4e559ac9044af5cacb5a1e60
\ No newline at end of file
diff --git a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.svg b/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.svg
index b1edadbfb..b6a4e2c94 100644
--- a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.svg
+++ b/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="110.5,-74.5 34.5,-74.5 34.5,-55.25 110.5,-55.25 110.5,-74.5"/>
 <text text-anchor="middle" x="72.5" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph_org.svg b/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph_org.svg
index 6831071f6..906b30612 100644
--- a/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph_org.svg
+++ b/d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="110.5,-74.5 34.5,-74.5 34.5,-55.25 110.5,-55.25 110.5,-74.5"/>
 <text text-anchor="middle" x="72.5" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/d7/d77/class_edge.html b/d7/d77/class_edge.html
index 8811f6a00..e52a9aea0 100644
--- a/d7/d77/class_edge.html
+++ b/d7/d77/class_edge.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Edge Struct Reference</title>
+<title>TheAlgorithms/C++: Edge Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -131,25 +148,22 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a9a415f211c059647d1b3af8fcf7a0e30" id="r_a9a415f211c059647d1b3af8fcf7a0e30"><td class="memItemLeft" align="right" valign="top"><a id="a9a415f211c059647d1b3af8fcf7a0e30" name="a9a415f211c059647d1b3af8fcf7a0e30"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>src</b></td></tr>
+<tr class="memitem:a9a415f211c059647d1b3af8fcf7a0e30" id="r_a9a415f211c059647d1b3af8fcf7a0e30"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9a415f211c059647d1b3af8fcf7a0e30">src</a></td></tr>
 <tr class="separator:a9a415f211c059647d1b3af8fcf7a0e30"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2449478938136b5ab7ef0e7d92e6990b" id="r_a2449478938136b5ab7ef0e7d92e6990b"><td class="memItemLeft" align="right" valign="top"><a id="a2449478938136b5ab7ef0e7d92e6990b" name="a2449478938136b5ab7ef0e7d92e6990b"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>dst</b></td></tr>
+<tr class="memitem:a2449478938136b5ab7ef0e7d92e6990b" id="r_a2449478938136b5ab7ef0e7d92e6990b"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2449478938136b5ab7ef0e7d92e6990b">dst</a></td></tr>
 <tr class="separator:a2449478938136b5ab7ef0e7d92e6990b"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a4d58e1f4de38fa55549497175981ebab" id="r_a4d58e1f4de38fa55549497175981ebab"><td class="memItemLeft" align="right" valign="top"><a id="a4d58e1f4de38fa55549497175981ebab" name="a4d58e1f4de38fa55549497175981ebab"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>weight</b></td></tr>
+<tr class="memitem:a4d58e1f4de38fa55549497175981ebab" id="r_a4d58e1f4de38fa55549497175981ebab"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4d58e1f4de38fa55549497175981ebab">weight</a></td></tr>
 <tr class="separator:a4d58e1f4de38fa55549497175981ebab"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aadbbb85298a21ecc2c17eeeadea65b01" id="r_aadbbb85298a21ecc2c17eeeadea65b01"><td class="memItemLeft" align="right" valign="top"><a id="aadbbb85298a21ecc2c17eeeadea65b01" name="aadbbb85298a21ecc2c17eeeadea65b01"></a>
-unsigned int&#160;</td><td class="memItemRight" valign="bottom"><b>src</b></td></tr>
+<tr class="memitem:aadbbb85298a21ecc2c17eeeadea65b01" id="r_aadbbb85298a21ecc2c17eeeadea65b01"><td class="memItemLeft" align="right" valign="top">unsigned int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aadbbb85298a21ecc2c17eeeadea65b01">src</a></td></tr>
 <tr class="separator:aadbbb85298a21ecc2c17eeeadea65b01"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae017097dd21663a9dc3387c23789c92e" id="r_ae017097dd21663a9dc3387c23789c92e"><td class="memItemLeft" align="right" valign="top"><a id="ae017097dd21663a9dc3387c23789c92e" name="ae017097dd21663a9dc3387c23789c92e"></a>
-unsigned int&#160;</td><td class="memItemRight" valign="bottom"><b>dest</b></td></tr>
+<tr class="memitem:ae017097dd21663a9dc3387c23789c92e" id="r_ae017097dd21663a9dc3387c23789c92e"><td class="memItemLeft" align="right" valign="top">unsigned int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae017097dd21663a9dc3387c23789c92e">dest</a></td></tr>
 <tr class="separator:ae017097dd21663a9dc3387c23789c92e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of non-weighted directed edge of a graph.</p>
 <p>The source vertex of the edge is labelled "src" and destination vertex is labelled "dest". </p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html#l00008">8</a> of file <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html">bellman_ford.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a415a5d002fe11c58711e48aabe975980" name="a415a5d002fe11c58711e48aabe975980"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a415a5d002fe11c58711e48aabe975980">&#9670;&#160;</a></span>Edge()</h2>
@@ -185,13 +199,96 @@ unsigned int&#160;</td><td class="memItemRight" valign="bottom"><b>dest</b></td>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   42</span>        : src(source), dest(destination) {}</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="ae017097dd21663a9dc3387c23789c92e" name="ae017097dd21663a9dc3387c23789c92e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ae017097dd21663a9dc3387c23789c92e">&#9670;&#160;</a></span>dest</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">unsigned int Edge::dest</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00027">27</a> of file <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a2449478938136b5ab7ef0e7d92e6990b" name="a2449478938136b5ab7ef0e7d92e6990b"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a2449478938136b5ab7ef0e7d92e6990b">&#9670;&#160;</a></span>dst</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int Edge::dst</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html#l00010">10</a> of file <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html">bellman_ford.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a9a415f211c059647d1b3af8fcf7a0e30" name="a9a415f211c059647d1b3af8fcf7a0e30"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a9a415f211c059647d1b3af8fcf7a0e30">&#9670;&#160;</a></span>src <span class="overload">[1/2]</span></h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int Edge::src</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html#l00010">10</a> of file <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html">bellman_ford.cpp</a>.</p>
+
+</div>
+</div>
+<a id="aadbbb85298a21ecc2c17eeeadea65b01" name="aadbbb85298a21ecc2c17eeeadea65b01"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aadbbb85298a21ecc2c17eeeadea65b01">&#9670;&#160;</a></span>src <span class="overload">[2/2]</span></h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">unsigned int Edge::src</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00026">26</a> of file <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a4d58e1f4de38fa55549497175981ebab" name="a4d58e1f4de38fa55549497175981ebab"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a4d58e1f4de38fa55549497175981ebab">&#9670;&#160;</a></span>weight</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int Edge::weight</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html#l00010">10</a> of file <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html">bellman_ford.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following files:<ul>
-<li>dynamic_programming/<b>bellman_ford.cpp</b></li>
-<li>graph/<b>cycle_check_directed_graph.cpp</b></li>
+<li>dynamic_programming/<a class="el" href="../../df/d14/bellman__ford_8cpp_source.html">bellman_ford.cpp</a></li>
+<li>graph/<a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d7/d7a/namespacebinomial.html b/d7/d7a/namespacebinomial.html
index 168fc9afd..42732fa1d 100644
--- a/d7/d7a/namespacebinomial.html
+++ b/d7/d7a/namespacebinomial.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: binomial Namespace Reference</title>
+<title>TheAlgorithms/C++: binomial Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d7/d7c/classstatistics_1_1stats__computer1.html b/d7/d7c/classstatistics_1_1stats__computer1.html
index ec3e6950a..90e0b0245 100644
--- a/d7/d7c/classstatistics_1_1stats__computer1.html
+++ b/d7/d7c/classstatistics_1_1stats__computer1.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: statistics::stats_computer1&lt; T &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: statistics::stats_computer1&lt; T &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -131,27 +148,25 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:ab2e69e75fe0da096bf61fa13420b43eb" id="r_ab2e69e75fe0da096bf61fa13420b43eb"><td class="memItemLeft" align="right" valign="top"><a id="ab2e69e75fe0da096bf61fa13420b43eb" name="ab2e69e75fe0da096bf61fa13420b43eb"></a>
-unsigned int&#160;</td><td class="memItemRight" valign="bottom"><b>n</b> = 0</td></tr>
+<tr class="memitem:ab2e69e75fe0da096bf61fa13420b43eb" id="r_ab2e69e75fe0da096bf61fa13420b43eb"><td class="memItemLeft" align="right" valign="top">unsigned int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab2e69e75fe0da096bf61fa13420b43eb">n</a> = 0</td></tr>
 <tr class="separator:ab2e69e75fe0da096bf61fa13420b43eb"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2a097b80909181880f13b54a264ed337" id="r_a2a097b80909181880f13b54a264ed337"><td class="memItemLeft" align="right" valign="top"><a id="a2a097b80909181880f13b54a264ed337" name="a2a097b80909181880f13b54a264ed337"></a>
-double&#160;</td><td class="memItemRight" valign="bottom"><b>Ex</b></td></tr>
+<tr class="memitem:a2a097b80909181880f13b54a264ed337" id="r_a2a097b80909181880f13b54a264ed337"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2a097b80909181880f13b54a264ed337">Ex</a></td></tr>
 <tr class="separator:a2a097b80909181880f13b54a264ed337"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8ab2b14d5650b14e46b70b412573f60a" id="r_a8ab2b14d5650b14e46b70b412573f60a"><td class="memItemLeft" align="right" valign="top"><a id="a8ab2b14d5650b14e46b70b412573f60a" name="a8ab2b14d5650b14e46b70b412573f60a"></a>
-double&#160;</td><td class="memItemRight" valign="bottom"><b>Ex2</b></td></tr>
+<tr class="memitem:a8ab2b14d5650b14e46b70b412573f60a" id="r_a8ab2b14d5650b14e46b70b412573f60a"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8ab2b14d5650b14e46b70b412573f60a">Ex2</a></td></tr>
 <tr class="separator:a8ab2b14d5650b14e46b70b412573f60a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a48c03a44c784eb6913ad186d34c302db" id="r_a48c03a44c784eb6913ad186d34c302db"><td class="memItemLeft" align="right" valign="top"><a id="a48c03a44c784eb6913ad186d34c302db" name="a48c03a44c784eb6913ad186d34c302db"></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><b>K</b></td></tr>
+<tr class="memitem:a48c03a44c784eb6913ad186d34c302db" id="r_a48c03a44c784eb6913ad186d34c302db"><td class="memItemLeft" align="right" valign="top">T&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a48c03a44c784eb6913ad186d34c302db">K</a></td></tr>
 <tr class="separator:a48c03a44c784eb6913ad186d34c302db"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="friends" name="friends"></a>
 Friends</h2></td></tr>
-<tr class="memitem:a350bf6c429691d3578c4dfc6679a0797" id="r_a350bf6c429691d3578c4dfc6679a0797"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::istream</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a350bf6c429691d3578c4dfc6679a0797">operator&gt;&gt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::istream</a> &amp;input, <a class="el" href="../../d7/d7c/classstatistics_1_1stats__computer1.html">stats_computer1</a> &amp;stat)</td></tr>
+<tr class="memitem:a350bf6c429691d3578c4dfc6679a0797" id="r_a350bf6c429691d3578c4dfc6679a0797"><td class="memItemLeft" align="right" valign="top">std::istream &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a350bf6c429691d3578c4dfc6679a0797">operator&gt;&gt;</a> (std::istream &amp;input, <a class="el" href="../../d7/d7c/classstatistics_1_1stats__computer1.html">stats_computer1</a> &amp;stat)</td></tr>
 <tr class="separator:a350bf6c429691d3578c4dfc6679a0797"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><div class="compoundTemplParams">template&lt;typename T&gt;<br />
 class statistics::stats_computer1&lt; T &gt;</div><p>continuous mean and variance computance using first value as an approximation for the mean. If the first number is much far form the mean, the algorithm becomes very inaccurate to compute variance and standard deviation. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00027">27</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="a390697dcee210b91823ceff04b25081b" name="a390697dcee210b91823ceff04b25081b"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a390697dcee210b91823ceff04b25081b">&#9670;&#160;</a></span>mean()</h2>
@@ -178,6 +193,8 @@ template&lt;typename T &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>return sample mean computed till last sample </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   42</span>{ <span class="keywordflow">return</span> K + Ex / n; }</div>
 </div><!-- fragment -->
 </div>
@@ -212,6 +229,8 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   32</span>                      {</div>
 <div class="line"><span class="lineno">   33</span>        <span class="keywordflow">if</span> (n == 0)</div>
 <div class="line"><span class="lineno">   34</span>            K = x;</div>
@@ -248,15 +267,11 @@ template&lt;typename T &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>return sample standard deviation computed till last sample </p>
-<div class="fragment"><div class="line"><span class="lineno">   48</span>{ <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(this-&gt;<a class="code hl_function" href="#a27f0a03e2fd2254f1c81fe668226bd92">variance</a>()); }</div>
-<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_a27f0a03e2fd2254f1c81fe668226bd92"><div class="ttname"><a href="#a27f0a03e2fd2254f1c81fe668226bd92">statistics::stats_computer1::variance</a></div><div class="ttdeci">double variance() const</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:45</div></div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.svg" width="444" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   48</span>{ <span class="keywordflow">return</span> std::sqrt(this-&gt;<a class="code hl_function" href="#a27f0a03e2fd2254f1c81fe668226bd92">variance</a>()); }</div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_a27f0a03e2fd2254f1c81fe668226bd92"><div class="ttname"><a href="#a27f0a03e2fd2254f1c81fe668226bd92">statistics::stats_computer1::variance</a></div><div class="ttdeci">double variance() const</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d08/realtime__stats_8cpp_source.html#l00045">realtime_stats.cpp:45</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a27f0a03e2fd2254f1c81fe668226bd92" name="a27f0a03e2fd2254f1c81fe668226bd92"></a>
@@ -284,6 +299,8 @@ template&lt;typename T &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>return data variance computed till last sample </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00045">45</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   45</span>{ <span class="keywordflow">return</span> (Ex2 - (Ex * Ex) / n) / (n - 1); }</div>
 </div><!-- fragment -->
 </div>
@@ -301,9 +318,9 @@ template&lt;typename T &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::istream</a> &amp; operator&gt;&gt; </td>
+          <td class="memname">std::istream &amp; operator&gt;&gt; </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::istream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>input</em></span>, </td>
+          <td class="paramtype">std::istream &amp;</td>          <td class="paramname"><span class="paramname"><em>input</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -318,19 +335,126 @@ template&lt;typename T &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>short-hand operator to read new sample from input stream <br  />
- e.g.: <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; stats1;</code> </p>
+ e.g.: <code>std::cin &gt;&gt; stats1;</code> </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   54</span>                                                           {</div>
 <div class="line"><span class="lineno">   55</span>        T val;</div>
 <div class="line"><span class="lineno">   56</span>        input &gt;&gt; val;</div>
 <div class="line"><span class="lineno">   57</span>        stat.<a class="code hl_function" href="#aa13bf7c38de112f71921a5525d71a2f2">new_val</a>(val);</div>
 <div class="line"><span class="lineno">   58</span>        <span class="keywordflow">return</span> input;</div>
 <div class="line"><span class="lineno">   59</span>    }</div>
-<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_aa13bf7c38de112f71921a5525d71a2f2"><div class="ttname"><a href="#aa13bf7c38de112f71921a5525d71a2f2">statistics::stats_computer1::new_val</a></div><div class="ttdeci">void new_val(T x)</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:32</div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_aa13bf7c38de112f71921a5525d71a2f2"><div class="ttname"><a href="#aa13bf7c38de112f71921a5525d71a2f2">statistics::stats_computer1::new_val</a></div><div class="ttdeci">void new_val(T x)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d08/realtime__stats_8cpp_source.html#l00032">realtime_stats.cpp:32</a></div></div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a2a097b80909181880f13b54a264ed337" name="a2a097b80909181880f13b54a264ed337"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a2a097b80909181880f13b54a264ed337">&#9670;&#160;</a></span>Ex</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename T &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">double <a class="el" href="../../d7/d7c/classstatistics_1_1stats__computer1.html">statistics::stats_computer1</a>&lt; T &gt;::Ex</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00063">63</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a8ab2b14d5650b14e46b70b412573f60a" name="a8ab2b14d5650b14e46b70b412573f60a"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a8ab2b14d5650b14e46b70b412573f60a">&#9670;&#160;</a></span>Ex2</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename T &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">double <a class="el" href="../../d7/d7c/classstatistics_1_1stats__computer1.html">statistics::stats_computer1</a>&lt; T &gt;::Ex2</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00063">63</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a48c03a44c784eb6913ad186d34c302db" name="a48c03a44c784eb6913ad186d34c302db"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a48c03a44c784eb6913ad186d34c302db">&#9670;&#160;</a></span>K</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename T &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">T <a class="el" href="../../d7/d7c/classstatistics_1_1stats__computer1.html">statistics::stats_computer1</a>&lt; T &gt;::K</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ab2e69e75fe0da096bf61fa13420b43eb" name="ab2e69e75fe0da096bf61fa13420b43eb"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ab2e69e75fe0da096bf61fa13420b43eb">&#9670;&#160;</a></span>n</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename T &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">unsigned int <a class="el" href="../../d7/d7c/classstatistics_1_1stats__computer1.html">statistics::stats_computer1</a>&lt; T &gt;::n = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>math/<a class="el" href="../../d0/d08/realtime__stats_8cpp.html">realtime_stats.cpp</a></li>
+<li>math/<a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.map b/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.map
deleted file mode 100644
index d7fef1fe5..000000000
--- a/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="statistics::stats_computer1::std" name="statistics::stats_computer1::std">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,35,211,60"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="314,5,383,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="211,32,298,22,298,27,211,38"/>
-<area shape="rect" id="Node000003" href="$d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92" title=" " alt="" coords="259,55,438,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="211,57,244,61,243,66,211,62"/>
-</map>
diff --git a/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.md5 b/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.md5
deleted file mode 100644
index 7c5554ebb..000000000
--- a/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9c14aaf9182be9dd74a85d574ca80a44
\ No newline at end of file
diff --git a/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.svg b/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.svg
deleted file mode 100644
index 805c0e036..000000000
--- a/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: statistics::stats_computer1::std Pages: 1 -->
-<svg width="333pt" height="76pt"
- viewBox="0.00 0.00 332.50 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>statistics::stats_computer1::std</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="154,-45.88 0,-45.88 0,-26.62 154,-26.62 154,-45.88"/>
-<text text-anchor="middle" x="77" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1::std</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.25,-67.88 231.25,-67.88 231.25,-48.62 283.25,-48.62 283.25,-67.88"/>
-<text text-anchor="middle" x="257.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.37,-45.68C176.96,-48.46 200.66,-51.39 219.51,-53.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219,-57.18 229.35,-54.93 219.86,-50.23 219,-57.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.5,-30.5 190,-30.5 190,0 324.5,0 324.5,-30.5"/>
-<text text-anchor="start" x="198" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1</text>
-<text text-anchor="middle" x="257.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.37,-27.25C162.33,-26.31 170.44,-25.36 178.42,-24.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.56,-27.93 188.09,-23.28 177.75,-20.97 178.56,-27.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph_org.svg b/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph_org.svg
deleted file mode 100644
index 999eb3fac..000000000
--- a/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: statistics::stats_computer1::std Pages: 1 -->
-<svg width="333pt" height="76pt"
- viewBox="0.00 0.00 332.50 75.88" 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 71.88)">
-<title>statistics::stats_computer1::std</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="154,-45.88 0,-45.88 0,-26.62 154,-26.62 154,-45.88"/>
-<text text-anchor="middle" x="77" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1::std</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.25,-67.88 231.25,-67.88 231.25,-48.62 283.25,-48.62 283.25,-67.88"/>
-<text text-anchor="middle" x="257.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.37,-45.68C176.96,-48.46 200.66,-51.39 219.51,-53.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219,-57.18 229.35,-54.93 219.86,-50.23 219,-57.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.5,-30.5 190,-30.5 190,0 324.5,0 324.5,-30.5"/>
-<text text-anchor="start" x="198" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1</text>
-<text text-anchor="middle" x="257.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.37,-27.25C162.33,-26.31 170.44,-25.36 178.42,-24.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.56,-27.93 188.09,-23.28 177.75,-20.97 178.56,-27.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d7f/section.html b/d7/d7f/section.html
index 3edd76f80..3886aa53f 100644
--- a/d7/d7f/section.html
+++ b/d7/d7f/section.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Prime factorization</title>
+<title>TheAlgorithms/C++: Prime factorization</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d7/d81/namespacebit__manipulation.html b/d7/d81/namespacebit__manipulation.html
index d5960858e..730c2f478 100644
--- a/d7/d81/namespacebit__manipulation.html
+++ b/d7/d81/namespacebit__manipulation.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: bit_manipulation Namespace Reference</title>
+<title>TheAlgorithms/C++: bit_manipulation Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -134,7 +151,7 @@ Functions</h2></td></tr>
 <p>Bit manipulation algorithms</p>
 <p>for io operations</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 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>
+<p>for std::min for IO operations for limits of integral types for std::vector</p>
 <p>Bit manipulation algorithms </p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a5032470c9974bbd6ec254bf296530a5f" name="a5032470c9974bbd6ec254bf296530a5f"></a>
@@ -160,6 +177,8 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>either true or false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d6d/power__of__2_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../dc/d6d/power__of__2_8cpp_source.html">power_of_2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   32</span>                                 {  <span class="comment">// int64_t is preferred over int so that</span></div>
 <div class="line"><span class="lineno">   33</span>                                      <span class="comment">// no Overflow can be there.</span></div>
 <div class="line"><span class="lineno">   34</span> </div>
@@ -197,6 +216,8 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>a number </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html">next_higher_number_with_same_number_of_set_bits.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   33</span>                                        {</div>
 <div class="line"><span class="lineno">   34</span>    uint64_t rightOne = 0;</div>
 <div class="line"><span class="lineno">   35</span>    uint64_t nextHigherOneBit = 0;</div>
diff --git a/d7/d83/trie__tree_8cpp.html b/d7/d83/trie__tree_8cpp.html
index 7e3bcda55..a9cb93981 100644
--- a/d7/d83/trie__tree_8cpp.html
+++ b/d7/d83/trie__tree_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/trie_tree.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/trie_tree.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -125,7 +142,9 @@ Include dependency graph for trie_tree.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d99/trie__tree_8cpp__incl.svg" width="496" height="126"><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">
+</div>
+<p><a href="../../d7/d83/trie__tree_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html">data_structures::trie</a></td></tr>
@@ -154,6 +173,8 @@ Functions</h2></td></tr>
 <a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
 <dl class="section note"><dt>Note</dt><dd>the function ::data_structure::trie::deleteString might be erroneous </dd></dl>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../dc/d93/trie__modern_8cpp.html" title="A basic implementation of trie class to store only lower-case strings.">trie_modern.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html">trie_tree.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -172,18 +193,15 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html#l00205">205</a> of file <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html">trie_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  205</span>           {</div>
 <div class="line"><span class="lineno">  206</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
 <div class="line"><span class="lineno">  207</span> </div>
 <div class="line"><span class="lineno">  208</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  209</span>}</div>
-<div class="ttc" id="atrie__tree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Testing function.</div><div class="ttdef"><b>Definition</b> trie_tree.cpp:178</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d83/trie__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="atrie__tree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Testing function.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d83/trie__tree_8cpp_source.html#l00178">trie_tree.cpp:178</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -211,30 +229,31 @@ Here is the call graph for this function:</div>
 
 <p>Testing function. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html#l00178">178</a> of file <a class="el" href="../../d7/d83/trie__tree_8cpp_source.html">trie_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  178</span>                   {</div>
 <div class="line"><span class="lineno">  179</span>    <a class="code hl_class" href="../../d0/d3e/classdata__structures_1_1trie.html">data_structures::trie</a> root;</div>
 <div class="line"><span class="lineno">  180</span>    root.insert(<span class="stringliteral">&quot;Hello&quot;</span>);</div>
 <div class="line"><span class="lineno">  181</span>    root.insert(<span class="stringliteral">&quot;World&quot;</span>);</div>
 <div class="line"><span class="lineno">  182</span> </div>
 <div class="line"><span class="lineno">  183</span>    assert(!root.search(<span class="stringliteral">&quot;hello&quot;</span>, 0));</div>
-<div class="line"><span class="lineno">  184</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;hello - &quot;</span> &lt;&lt; root.search(<span class="stringliteral">&quot;hello&quot;</span>, 0) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  184</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;hello - &quot;</span> &lt;&lt; root.search(<span class="stringliteral">&quot;hello&quot;</span>, 0) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  185</span> </div>
 <div class="line"><span class="lineno">  186</span>    assert(root.search(<span class="stringliteral">&quot;Hello&quot;</span>, 0));</div>
-<div class="line"><span class="lineno">  187</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hello - &quot;</span> &lt;&lt; root.search(<span class="stringliteral">&quot;Hello&quot;</span>, 0) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  187</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hello - &quot;</span> &lt;&lt; root.search(<span class="stringliteral">&quot;Hello&quot;</span>, 0) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  188</span> </div>
 <div class="line"><span class="lineno">  189</span>    assert(!root.search(<span class="stringliteral">&quot;Word&quot;</span>, 0));</div>
-<div class="line"><span class="lineno">  190</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Word - &quot;</span> &lt;&lt; root.search(<span class="stringliteral">&quot;Word&quot;</span>, 0) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  190</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Word - &quot;</span> &lt;&lt; root.search(<span class="stringliteral">&quot;Word&quot;</span>, 0) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  191</span> </div>
 <div class="line"><span class="lineno">  192</span>    assert(root.search(<span class="stringliteral">&quot;World&quot;</span>, 0));</div>
-<div class="line"><span class="lineno">  193</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;World - &quot;</span> &lt;&lt; root.search(<span class="stringliteral">&quot;World&quot;</span>, 0) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  193</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;World - &quot;</span> &lt;&lt; root.search(<span class="stringliteral">&quot;World&quot;</span>, 0) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  194</span> </div>
 <div class="line"><span class="lineno">  195</span>    <span class="comment">// Following lines of code give erroneous output</span></div>
 <div class="line"><span class="lineno">  196</span>    <span class="comment">// root.deleteString(&quot;hello&quot;, 0);</span></div>
 <div class="line"><span class="lineno">  197</span>    <span class="comment">// assert(!root.search(&quot;hello&quot;, 0));</span></div>
 <div class="line"><span class="lineno">  198</span>    <span class="comment">// std::cout &lt;&lt; &quot;hello - &quot; &lt;&lt; root.search(&quot;world&quot;, 0) &lt;&lt; &quot;\n&quot;;</span></div>
 <div class="line"><span class="lineno">  199</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="aclassdata__structures_1_1trie_html"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html">data_structures::trie</a></div><div class="ttdoc">Trie implementation for small-case English alphabets a-z</div><div class="ttdef"><b>Definition</b> trie_tree.cpp:25</div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie_html"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html">data_structures::trie</a></div><div class="ttdoc">Trie implementation for small-case English alphabets a-z</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d83/trie__tree_8cpp_source.html#l00025">trie_tree.cpp:25</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/d7/d83/trie__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d7/d83/trie__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 332584363..000000000
--- a/d7/d83/trie__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Testing function." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d7/d83/trie__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d7/d83/trie__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 705a6fc63..000000000
--- a/d7/d83/trie__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c722ddbbb1b6583f92df0c2ff57fffc1
\ No newline at end of file
diff --git a/d7/d83/trie__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d7/d83/trie__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index ba971ead3..000000000
--- a/d7/d83/trie__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Testing function.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d83/trie__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d7/d83/trie__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 2b0c271f9..000000000
--- a/d7/d83/trie__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Testing function.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d83/trie__tree_8cpp_source.html b/d7/d83/trie__tree_8cpp_source.html
new file mode 100644
index 000000000..c6558d30b
--- /dev/null
+++ b/d7/d83/trie__tree_8cpp_source.html
@@ -0,0 +1,318 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/trie_tree.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/d83/trie__tree_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">trie_tree.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d7/d83/trie__tree_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;array&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;memory&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;string&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d3c/namespacedata__structures.html">data_structures</a> {</div>
+<div class="foldopen" id="foldopen00025" data-start="{" data-end="};">
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"><a class="line" href="../../d0/d3e/classdata__structures_1_1trie.html">   25</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d0/d3e/classdata__structures_1_1trie.html">trie</a> {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191">   27</a></span>    <span class="keyword">static</span> <span class="keyword">constexpr</span> uint8_t <a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191">NUM_CHARS</a> = 26;  </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">   29</a></span>    std::array&lt;std::shared_ptr&lt;trie&gt;, <a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191">NUM_CHARS &lt;&lt; 1&gt;</a> <a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">arr</a>;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"><a class="line" href="../../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6">   30</a></span>    <span class="keywordtype">bool</span> <a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6">isEndofWord</a> = <span class="keyword">false</span>;  </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="foldopen" id="foldopen00038" data-start="{" data-end="}">
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988">   38</a></span>    uint8_t <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988">char_to_int</a>(<span class="keyword">const</span> <span class="keywordtype">char</span>&amp; ch)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        <span class="keywordflow">if</span> (ch &gt;= <span class="charliteral">&#39;A&#39;</span> &amp;&amp; ch &lt;= <span class="charliteral">&#39;Z&#39;</span>) {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>            <span class="keywordflow">return</span> ch - <span class="charliteral">&#39;A&#39;</span>;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ch &gt;= <span class="charliteral">&#39;a&#39;</span> &amp;&amp; ch &lt;= <span class="charliteral">&#39;z&#39;</span>) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>            <span class="keywordflow">return</span> ch - <span class="charliteral">&#39;a&#39;</span> + <a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191">NUM_CHARS</a>;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Invalid character present. Exiting...&quot;</span>;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        std::exit(EXIT_FAILURE);</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    }</div>
+</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="foldopen" id="foldopen00056" data-start="{" data-end="}">
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="../../d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63">   56</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63">search</a>(<span class="keyword">const</span> std::shared_ptr&lt;trie&gt;&amp; root, <span class="keyword">const</span> std::string&amp; str,</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>                <span class="keywordtype">int</span> index) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordflow">if</span> (index == str.length()) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            <span class="keywordflow">if</span> (!root-&gt;isEndofWord) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            }</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        <span class="keywordtype">int</span> j = <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988">char_to_int</a>(str[index]);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <span class="keywordflow">if</span> (!root-&gt;arr[j]) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>(root-&gt;arr[j], str, index + 1);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    }</div>
+</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"><a class="line" href="../../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8">   72</a></span>    <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8">trie</a>() = <span class="keywordflow">default</span>;  </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="foldopen" id="foldopen00077" data-start="{" data-end="}">
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546">   77</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546">insert</a>(<span class="keyword">const</span> std::string&amp; str) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        std::shared_ptr&lt;trie&gt; root(<span class="keyword">nullptr</span>);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">char</span>&amp; ch : str) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>            <span class="keywordtype">int</span> j = <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988">char_to_int</a>(ch);</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>            <span class="keywordflow">if</span> (root) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>                <span class="keywordflow">if</span> (root-&gt;arr[j]) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>                    root = root-&gt;arr[j];</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>                } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>                    std::shared_ptr&lt;trie&gt; temp(<span class="keyword">new</span> <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8">trie</a>());</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>                    root-&gt;arr[j] = temp;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>                    root = temp;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>                }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j]) {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>                root = <a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j];</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>                std::shared_ptr&lt;trie&gt; temp(<span class="keyword">new</span> <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8">trie</a>());</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>                <a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j] = temp;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>                root = temp;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        }</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        root-&gt;isEndofWord = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    }</div>
+</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="foldopen" id="foldopen00107" data-start="{" data-end="}">
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"><a class="line" href="../../d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d">  107</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d">search</a>(<span class="keyword">const</span> std::string&amp; str, <span class="keywordtype">int</span> index) {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <span class="keywordflow">if</span> (index == str.length()) {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            <span class="keywordflow">if</span> (!<a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6">isEndofWord</a>) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>            }</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        }</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        <span class="keywordtype">int</span> j = <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988">char_to_int</a>(str[index]);</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        <span class="keywordflow">if</span> (!<a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j]) {</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        }</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>(<a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j], str, index + 1);</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    }</div>
+</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="foldopen" id="foldopen00134" data-start="{" data-end="}">
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"><a class="line" href="../../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab">  134</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab">deleteString</a>(<span class="keyword">const</span> std::string&amp; str, <span class="keywordtype">int</span> index) {</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>        <span class="keywordflow">if</span> (index == str.length()) {</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>            <span class="keywordflow">if</span> (!<a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6">isEndofWord</a>) {</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>            }</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>            <a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6">isEndofWord</a> = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>            <span class="comment">// following lines - possible source of error?</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>            <span class="comment">// for (int i = 0; i &lt; NUM_CHARS; i++)</span></div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>            <span class="comment">//     if (!arr[i])</span></div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>            <span class="comment">//         return false;</span></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        }</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        <span class="keywordtype">int</span> j = <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988">char_to_int</a>(str[index]);</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        <span class="keywordflow">if</span> (!<a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j]) {</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        }</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>        <span class="keywordtype">bool</span> var = <a class="code hl_function" href="../../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab">deleteString</a>(str, index + 1);</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>        <span class="keywordflow">if</span> (var) {</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>            <a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[j].reset();</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6">isEndofWord</a>) {</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>                <span class="keywordtype">int</span> i = 0;</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>                <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191">NUM_CHARS</a>; i++) {</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>                    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">arr</a>[i]) {</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>                        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>                    }</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>                }</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>            }</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>        }</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span> </div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        <span class="comment">/* should not return here */</span></div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>        std::cout &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;:&quot;</span> &lt;&lt; __LINE__</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>                  &lt;&lt; <span class="stringliteral">&quot;Should not reach this line\n&quot;</span>;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    }</div>
+</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>};</div>
+</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>}  <span class="comment">// namespace data_structures</span></div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span> </div>
+<div class="foldopen" id="foldopen00178" data-start="{" data-end="}">
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"><a class="line" href="../../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  178</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    <a class="code hl_class" href="../../d0/d3e/classdata__structures_1_1trie.html">data_structures::trie</a> root;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    root.insert(<span class="stringliteral">&quot;Hello&quot;</span>);</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    root.insert(<span class="stringliteral">&quot;World&quot;</span>);</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span> </div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    assert(!root.search(<span class="stringliteral">&quot;hello&quot;</span>, 0));</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;hello - &quot;</span> &lt;&lt; root.search(<span class="stringliteral">&quot;hello&quot;</span>, 0) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span> </div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    assert(root.search(<span class="stringliteral">&quot;Hello&quot;</span>, 0));</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hello - &quot;</span> &lt;&lt; root.search(<span class="stringliteral">&quot;Hello&quot;</span>, 0) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span> </div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    assert(!root.search(<span class="stringliteral">&quot;Word&quot;</span>, 0));</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Word - &quot;</span> &lt;&lt; root.search(<span class="stringliteral">&quot;Word&quot;</span>, 0) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span> </div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    assert(root.search(<span class="stringliteral">&quot;World&quot;</span>, 0));</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;World - &quot;</span> &lt;&lt; root.search(<span class="stringliteral">&quot;World&quot;</span>, 0) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span> </div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    <span class="comment">// Following lines of code give erroneous output</span></div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    <span class="comment">// root.deleteString(&quot;hello&quot;, 0);</span></div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    <span class="comment">// assert(!root.search(&quot;hello&quot;, 0));</span></div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    <span class="comment">// std::cout &lt;&lt; &quot;hello - &quot; &lt;&lt; root.search(&quot;world&quot;, 0) &lt;&lt; &quot;\n&quot;;</span></div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>}</div>
+</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span> </div>
+<div class="foldopen" id="foldopen00205" data-start="{" data-end="}">
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"><a class="line" href="../../d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  205</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    <a class="code hl_function" href="../../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span> </div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>}</div>
+</div>
+<div class="ttc" id="aclassdata__structures_1_1trie_html"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html">data_structures::trie</a></div><div class="ttdoc">Trie implementation for small-case English alphabets a-z</div><div class="ttdef"><b>Definition</b> <a href="#l00025">trie_tree.cpp:25</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie_html_a0ab94bc6417e3f59fab33cea5b64d546"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546">data_structures::trie::insert</a></div><div class="ttdeci">void insert(const std::string &amp;str)</div><div class="ttdef"><b>Definition</b> <a href="#l00077">trie_tree.cpp:77</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie_html_a362dd78748a1f01ab019e55fd6098a8b"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">data_structures::trie::arr</a></div><div class="ttdeci">std::array&lt; std::shared_ptr&lt; trie &gt;, NUM_CHARS&lt;&lt; 1 &gt; arr</div><div class="ttdoc">Recursive tree nodes as an array of shared-pointers.</div><div class="ttdef"><b>Definition</b> <a href="#l00029">trie_tree.cpp:29</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie_html_a499f87fd833203ef9492b4870aa6d42d"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d">data_structures::trie::search</a></div><div class="ttdeci">bool search(const std::string &amp;str, int index)</div><div class="ttdef"><b>Definition</b> <a href="#l00107">trie_tree.cpp:107</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie_html_a4bfac4be6ed1a34c7159eddb42469191"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191">data_structures::trie::NUM_CHARS</a></div><div class="ttdeci">static constexpr uint8_t NUM_CHARS</div><div class="ttdoc">Number of alphabets.</div><div class="ttdef"><b>Definition</b> <a href="#l00027">trie_tree.cpp:27</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie_html_a4cb0f775b5a4bc14a6d39b5c93883eb6"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6">data_structures::trie::isEndofWord</a></div><div class="ttdeci">bool isEndofWord</div><div class="ttdoc">identifier if a node is terminal node</div><div class="ttdef"><b>Definition</b> <a href="#l00030">trie_tree.cpp:30</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie_html_a87d8bf99aea936f9381141753f1e90a8"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8">data_structures::trie::trie</a></div><div class="ttdeci">trie()=default</div><div class="ttdoc">Class default constructor.</div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie_html_a961eb5d576d2420f2036009154397c63"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63">data_structures::trie::search</a></div><div class="ttdeci">bool search(const std::shared_ptr&lt; trie &gt; &amp;root, const std::string &amp;str, int index)</div><div class="ttdef"><b>Definition</b> <a href="#l00056">trie_tree.cpp:56</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie_html_aab373beb3f618b90922528c68797d988"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988">data_structures::trie::char_to_int</a></div><div class="ttdeci">uint8_t char_to_int(const char &amp;ch) const</div><div class="ttdoc">Convert a character to integer for indexing.</div><div class="ttdef"><b>Definition</b> <a href="#l00038">trie_tree.cpp:38</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1trie_html_aeac27cfd397d2dd3f2f519efffafeeab"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab">data_structures::trie::deleteString</a></div><div class="ttdeci">bool deleteString(const std::string &amp;str, int index)</div><div class="ttdef"><b>Definition</b> <a href="#l00134">trie_tree.cpp:134</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html">data_structures</a></div><div class="ttdoc">for IO operations</div></div>
+<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> <a href="../../df/dd5/binary__search_8cpp_source.html#l00047">binary_search.cpp:47</a></div></div>
+<div class="ttc" id="atrie__tree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Testing function.</div><div class="ttdef"><b>Definition</b> <a href="#l00178">trie_tree.cpp:178</a></div></div>
+<div class="ttc" id="atrie__tree_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00205">trie_tree.cpp:205</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d7/d83/trie__tree_8cpp.html">trie_tree.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/d85/doubly__linked__list_8cpp_source.html b/d7/d85/doubly__linked__list_8cpp_source.html
new file mode 100644
index 000000000..bd86d996a
--- /dev/null
+++ b/d7/d85/doubly__linked__list_8cpp_source.html
@@ -0,0 +1,280 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/doubly_linked_list.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/d85/doubly__linked__list_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">doubly_linked_list.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;cstdio&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;cstdlib&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> {</div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span>    <span class="keywordtype">int</span> val;</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *prev;</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *next;</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>} * start;</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="foldopen" id="foldopen00011" data-start="{" data-end="};">
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"><a class="line" href="../../d9/dee/classdouble__linked__list.html">   11</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d9/dee/classdouble__linked__list.html">double_linked_list</a> {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <a class="code hl_class" href="../../d9/dee/classdouble__linked__list.html">double_linked_list</a>() { start = NULL; }</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordtype">void</span> insert(<span class="keywordtype">int</span> x);</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="keywordtype">void</span> remove(<span class="keywordtype">int</span> x);</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <span class="keywordtype">void</span> <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>(<span class="keywordtype">int</span> x);</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="keywordtype">void</span> show();</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="keywordtype">void</span> reverseShow();</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>};</div>
+</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="keywordtype">void</span> double_linked_list::insert(<span class="keywordtype">int</span> x) {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = start;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    <span class="keywordflow">if</span> (start != NULL) {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        <span class="keywordflow">while</span> (t-&gt;next != NULL) {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>            t = t-&gt;next;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        }</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        t-&gt;next = n;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>        n-&gt;prev = t;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        n-&gt;val = x;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        n-&gt;next = NULL;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        n-&gt;val = x;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        n-&gt;prev = NULL;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        n-&gt;next = NULL;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        start = n;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    }</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>}</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="keywordtype">void</span> double_linked_list::remove(<span class="keywordtype">int</span> x) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = start;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">while</span> (t != NULL &amp;&amp; t-&gt;val != x) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        t = t-&gt;next;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keywordflow">if</span> (t == NULL) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">if</span> (t-&gt;prev == NULL) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordflow">if</span> (t-&gt;next == NULL) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>            start = NULL;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            start = t-&gt;next;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            start-&gt;prev = NULL;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (t-&gt;next == NULL) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        t-&gt;prev-&gt;next = NULL;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        t-&gt;prev-&gt;next = t-&gt;next;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        t-&gt;next-&gt;prev = t-&gt;prev;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    }</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keyword">delete</span> t;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>}</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="keywordtype">void</span> double_linked_list::search(<span class="keywordtype">int</span> x) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = start;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordtype">int</span> found = 0;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keywordflow">while</span> (t != NULL) {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        <span class="keywordflow">if</span> (t-&gt;val == x) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nFound&quot;</span>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>            found = 1;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        }</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        t = t-&gt;next;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    }</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keywordflow">if</span> (found == 0) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nNot Found&quot;</span>;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    }</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>}</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span><span class="keywordtype">void</span> double_linked_list::show() {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = start;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordflow">while</span> (t != NULL) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        std::cout &lt;&lt; t-&gt;val &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        t = t-&gt;next;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    }</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>}</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span><span class="keywordtype">void</span> double_linked_list::reverseShow() {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = start;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordflow">while</span> (t != NULL &amp;&amp; t-&gt;next != NULL) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        t = t-&gt;next;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    }</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keywordflow">while</span> (t != NULL) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        std::cout &lt;&lt; t-&gt;val &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        t = t-&gt;prev;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    }</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>}</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keywordtype">int</span> choice, x;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <a class="code hl_class" href="../../d9/dee/classdouble__linked__list.html">double_linked_list</a> ob;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n1. Insert&quot;</span>;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n2. Delete&quot;</span>;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n3. Search&quot;</span>;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n4. Forward print&quot;</span>;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n5. Reverse print&quot;</span>;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n\nEnter you choice : &quot;</span>;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        std::cin &gt;&gt; choice;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        <span class="keywordflow">switch</span> (choice) {</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        <span class="keywordflow">case</span> 1:</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the element to be inserted : &quot;</span>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>            std::cin &gt;&gt; x;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>            ob.insert(x);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        <span class="keywordflow">case</span> 2:</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the element to be removed : &quot;</span>;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>            std::cin &gt;&gt; x;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>            ob.remove(x);</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        <span class="keywordflow">case</span> 3:</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the element to be searched : &quot;</span>;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>            std::cin &gt;&gt; x;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>            ob.search(x);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <span class="keywordflow">case</span> 4:</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>            ob.show();</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        <span class="keywordflow">case</span> 5:</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>            ob.reverseShow();</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        }</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    } <span class="keywordflow">while</span> (choice != 0);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>}</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="aclassdouble__linked__list_html"><div class="ttname"><a href="../../d9/dee/classdouble__linked__list.html">double_linked_list</a></div><div class="ttdef"><b>Definition</b> <a href="#l00011">doubly_linked_list.cpp:11</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> <a href="../../df/dd5/binary__search_8cpp_source.html#l00047">binary_search.cpp:47</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><b>doubly_linked_list.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/d88/namespaceprefix__sum__array.html b/d7/d88/namespaceprefix__sum__array.html
index 8fbe6787c..28e10ed9a 100644
--- a/d7/d88/namespaceprefix__sum__array.html
+++ b/d7/d88/namespaceprefix__sum__array.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: prefix_sum_array Namespace Reference</title>
+<title>TheAlgorithms/C++: prefix_sum_array Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d7/d89/double__factorial_8cpp.html b/d7/d89/double__factorial_8cpp.html
index c3c310167..f716f1258 100644
--- a/d7/d89/double__factorial_8cpp.html
+++ b/d7/d89/double__factorial_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/double_factorial.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/double_factorial.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for double_factorial.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d0e/double__factorial_8cpp__incl.svg" width="255" height="111"><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">
+</div>
+<p><a href="../../d7/d89/double__factorial_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a0a3c417360400093891a9ccddaa4be26" id="r_a0a3c417360400093891a9ccddaa4be26"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0a3c417360400093891a9ccddaa4be26">double_factorial_iterative</a> (uint64_t n)</td></tr>
@@ -138,6 +157,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Compute <a href="https://en.wikipedia.org/wiki/Double_factorial" target="_blank">double factorial</a>: \(n!!\). </p>
 <p>Double factorial of a non-negative integer <code>n</code>, is defined as the product of all the integers from 1 to n that have the same parity (odd or even) as n. <br  />
 It is also called as semifactorial of a number and is denoted by \(n!!\) </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d7/d89/double__factorial_8cpp_source.html">double_factorial.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a0a3c417360400093891a9ccddaa4be26" name="a0a3c417360400093891a9ccddaa4be26"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0a3c417360400093891a9ccddaa4be26">&#9670;&#160;</a></span>double_factorial_iterative()</h2>
@@ -154,6 +175,8 @@ It is also called as semifactorial of a number and is denoted by \(n!!\) </p>
       </table>
 </div><div class="memdoc">
 <p>Compute double factorial using iterative method </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d89/double__factorial_8cpp_source.html#l00018">18</a> of file <a class="el" href="../../d7/d89/double__factorial_8cpp_source.html">double_factorial.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   18</span>                                                {</div>
 <div class="line"><span class="lineno">   19</span>    uint64_t res = 1;</div>
 <div class="line"><span class="lineno">   20</span>    <span class="keywordflow">for</span> (uint64_t i = n;; i -= 2) {</div>
@@ -182,18 +205,15 @@ It is also called as semifactorial of a number and is denoted by \(n!!\) </p>
 </div><div class="memdoc">
 <p>Compute double factorial using resursive method. <br  />
 Recursion can be costly for large numbers. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d89/double__factorial_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../d7/d89/double__factorial_8cpp_source.html">double_factorial.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   31</span>                                                {</div>
 <div class="line"><span class="lineno">   32</span>    <span class="keywordflow">if</span> (n &lt;= 1)</div>
 <div class="line"><span class="lineno">   33</span>        <span class="keywordflow">return</span> 1;</div>
 <div class="line"><span class="lineno">   34</span>    <span class="keywordflow">return</span> n * <a class="code hl_function" href="#a68ba20fed2ce427f6469c7689437829d">double_factorial_recursive</a>(n - 2);</div>
 <div class="line"><span class="lineno">   35</span>}</div>
-<div class="ttc" id="adouble__factorial_8cpp_html_a68ba20fed2ce427f6469c7689437829d"><div class="ttname"><a href="#a68ba20fed2ce427f6469c7689437829d">double_factorial_recursive</a></div><div class="ttdeci">uint64_t double_factorial_recursive(uint64_t n)</div><div class="ttdef"><b>Definition</b> double_factorial.cpp:31</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d89/double__factorial_8cpp_a68ba20fed2ce427f6469c7689437829d_cgraph.svg" width="183" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="adouble__factorial_8cpp_html_a68ba20fed2ce427f6469c7689437829d"><div class="ttname"><a href="#a68ba20fed2ce427f6469c7689437829d">double_factorial_recursive</a></div><div class="ttdeci">uint64_t double_factorial_recursive(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d89/double__factorial_8cpp_source.html#l00031">double_factorial.cpp:31</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -211,17 +231,14 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d89/double__factorial_8cpp_source.html#l00068">68</a> of file <a class="el" href="../../d7/d89/double__factorial_8cpp_source.html">double_factorial.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   68</span>           {</div>
 <div class="line"><span class="lineno">   69</span>    <a class="code hl_function" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
 <div class="line"><span class="lineno">   70</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   71</span>}</div>
-<div class="ttc" id="adouble__factorial_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> double_factorial.cpp:51</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d7/d89/double__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="406"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="adouble__factorial_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d89/double__factorial_8cpp_source.html#l00051">double_factorial.cpp:51</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abbbcebf3a2d0c67f4c3cfb5511a97981" name="abbbcebf3a2d0c67f4c3cfb5511a97981"></a>
@@ -249,17 +266,14 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d89/double__factorial_8cpp_source.html#l00043">43</a> of file <a class="el" href="../../d7/d89/double__factorial_8cpp_source.html">double_factorial.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   43</span>                                         {</div>
 <div class="line"><span class="lineno">   44</span>    assert(<a class="code hl_function" href="#a0a3c417360400093891a9ccddaa4be26">double_factorial_iterative</a>(n) == expected);</div>
 <div class="line"><span class="lineno">   45</span>    assert(<a class="code hl_function" href="#a68ba20fed2ce427f6469c7689437829d">double_factorial_recursive</a>(n) == expected);</div>
 <div class="line"><span class="lineno">   46</span>}</div>
-<div class="ttc" id="adouble__factorial_8cpp_html_a0a3c417360400093891a9ccddaa4be26"><div class="ttname"><a href="#a0a3c417360400093891a9ccddaa4be26">double_factorial_iterative</a></div><div class="ttdeci">uint64_t double_factorial_iterative(uint64_t n)</div><div class="ttdef"><b>Definition</b> double_factorial.cpp:18</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d89/double__factorial_8cpp_abbbcebf3a2d0c67f4c3cfb5511a97981_cgraph.svg" width="275" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="adouble__factorial_8cpp_html_a0a3c417360400093891a9ccddaa4be26"><div class="ttname"><a href="#a0a3c417360400093891a9ccddaa4be26">double_factorial_iterative</a></div><div class="ttdeci">uint64_t double_factorial_iterative(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d89/double__factorial_8cpp_source.html#l00018">double_factorial.cpp:18</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a88ec9ad42717780d6caaff9d3d6977f9" name="a88ec9ad42717780d6caaff9d3d6977f9"></a>
@@ -277,27 +291,23 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Test implementations </p>
-<div class="fragment"><div class="line"><span class="lineno">   51</span>             {</div>
-<div class="line"><span class="lineno">   52</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1:\t n=5\t...&quot;</span>;</div>
-<div class="line"><span class="lineno">   53</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(5, 15);</div>
-<div class="line"><span class="lineno">   54</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   55</span> </div>
-<div class="line"><span class="lineno">   56</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2:\t n=15\t...&quot;</span>;</div>
-<div class="line"><span class="lineno">   57</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(15, 2027025);</div>
-<div class="line"><span class="lineno">   58</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   59</span> </div>
-<div class="line"><span class="lineno">   60</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3:\t n=0\t...&quot;</span>;</div>
-<div class="line"><span class="lineno">   61</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(0, 1);</div>
-<div class="line"><span class="lineno">   62</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   63</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="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> generate_parentheses.cpp:82</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d7/d89/double__factorial_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg" width="100%" height="406"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d7/d89/double__factorial_8cpp_source.html#l00051">51</a> of file <a class="el" href="../../d7/d89/double__factorial_8cpp_source.html">double_factorial.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   51</span>             {</div>
+<div class="line"><span class="lineno">   52</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1:\t n=5\t...&quot;</span>;</div>
+<div class="line"><span class="lineno">   53</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(5, 15);</div>
+<div class="line"><span class="lineno">   54</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   55</span> </div>
+<div class="line"><span class="lineno">   56</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2:\t n=15\t...&quot;</span>;</div>
+<div class="line"><span class="lineno">   57</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(15, 2027025);</div>
+<div class="line"><span class="lineno">   58</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   59</span> </div>
+<div class="line"><span class="lineno">   60</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3:\t n=0\t...&quot;</span>;</div>
+<div class="line"><span class="lineno">   61</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(0, 1);</div>
+<div class="line"><span class="lineno">   62</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   63</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00082">generate_parentheses.cpp:82</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d7/d89/double__factorial_8cpp_a68ba20fed2ce427f6469c7689437829d_cgraph.map b/d7/d89/double__factorial_8cpp_a68ba20fed2ce427f6469c7689437829d_cgraph.map
deleted file mode 100644
index afb999cb0..000000000
--- a/d7/d89/double__factorial_8cpp_a68ba20fed2ce427f6469c7689437829d_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="double_factorial_recursive" name="double_factorial_recursive">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,178,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="62,30,57,21,60,11,72,5,92,3,112,5,123,12,121,16,111,10,91,8,74,10,64,15,62,20,67,28"/>
-</map>
diff --git a/d7/d89/double__factorial_8cpp_a68ba20fed2ce427f6469c7689437829d_cgraph.md5 b/d7/d89/double__factorial_8cpp_a68ba20fed2ce427f6469c7689437829d_cgraph.md5
deleted file mode 100644
index 9d20810b7..000000000
--- a/d7/d89/double__factorial_8cpp_a68ba20fed2ce427f6469c7689437829d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3d9db50fc4daeede078fdb61e72d3475
\ No newline at end of file
diff --git a/d7/d89/double__factorial_8cpp_a68ba20fed2ce427f6469c7689437829d_cgraph.svg b/d7/d89/double__factorial_8cpp_a68ba20fed2ce427f6469c7689437829d_cgraph.svg
deleted file mode 100644
index 9f2cc8d02..000000000
--- a/d7/d89/double__factorial_8cpp_a68ba20fed2ce427f6469c7689437829d_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: double_factorial_recursive Pages: 1 -->
-<svg width="137pt" height="45pt"
- viewBox="0.00 0.00 137.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>double_factorial_recursive</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="129.25,-19.25 0,-19.25 0,0 129.25,0 129.25,-19.25"/>
-<text text-anchor="middle" x="64.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_factorial_recursive</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44.39,-19.54C35.16,-28.15 41.91,-37.25 64.62,-37.25 77.05,-37.25 84.7,-34.53 87.57,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.99,-29.9 85.22,-21.01 84.18,-31.55 90.99,-29.9"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d89/double__factorial_8cpp_a68ba20fed2ce427f6469c7689437829d_cgraph_org.svg b/d7/d89/double__factorial_8cpp_a68ba20fed2ce427f6469c7689437829d_cgraph_org.svg
deleted file mode 100644
index dff83d8af..000000000
--- a/d7/d89/double__factorial_8cpp_a68ba20fed2ce427f6469c7689437829d_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: double_factorial_recursive Pages: 1 -->
-<svg width="137pt" height="45pt"
- viewBox="0.00 0.00 137.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>double_factorial_recursive</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="129.25,-19.25 0,-19.25 0,0 129.25,0 129.25,-19.25"/>
-<text text-anchor="middle" x="64.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_factorial_recursive</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44.39,-19.54C35.16,-28.15 41.91,-37.25 64.62,-37.25 77.05,-37.25 84.7,-34.53 87.57,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.99,-29.9 85.22,-21.01 84.18,-31.55 90.99,-29.9"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d89/double__factorial_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map b/d7/d89/double__factorial_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
deleted file mode 100644
index 92e8827f8..000000000
--- a/d7/d89/double__factorial_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,47,56,72"/>
-<area shape="rect" id="Node000002" href="$dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="104,47,147,72"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,57,88,57,88,62,56,62"/>
-<area shape="rect" id="Node000003" href="$df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" title="wrapper interface" alt="" coords="195,39,352,80"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="148,57,180,57,180,62,148,62"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/clear.html#" title=" " alt="" coords="431,5,550,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="352,42,415,30,416,35,353,47"/>
-<area shape="rect" id="Node000005" href="$df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" title="function that adds parenthesis to the string." alt="" coords="400,79,581,120"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="353,71,385,77,384,83,352,77"/>
-<area shape="poly" id="edge6_Node000005_Node000005" title=" " alt="" coords="450,79,448,69,454,60,469,55,491,53,514,55,528,61,526,66,512,60,490,58,470,60,458,64,453,70,455,78"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="645,61,767,87"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="580,86,629,81,629,86,581,92"/>
-<area shape="rect" id="Node000007" 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="629,111,783,136"/>
-<area shape="poly" id="edge7_Node000005_Node000007" title=" " alt="" coords="581,107,613,111,613,116,580,112"/>
-</map>
diff --git a/d7/d89/double__factorial_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 b/d7/d89/double__factorial_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
deleted file mode 100644
index 358abe236..000000000
--- a/d7/d89/double__factorial_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4db9dfa12e6b68c027e65f97233b7321
\ No newline at end of file
diff --git a/d7/d89/double__factorial_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg b/d7/d89/double__factorial_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
deleted file mode 100644
index 9a748433b..000000000
--- a/d7/d89/double__factorial_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
+++ /dev/null
@@ -1,223 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<!--zoomable 106 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 591;
-var viewHeight = 106;
-var sectionId = 'dynsection-4';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-67.25 0,-67.25 0,-48 37.75,-48 37.75,-67.25"/>
-<text text-anchor="middle" x="18.88" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="106.25,-67.25 73.75,-67.25 73.75,-48 106.25,-48 106.25,-67.25"/>
-<text text-anchor="middle" x="90" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.04,-57.62C45.45,-57.62 54.18,-57.62 62.3,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.02,-61.13 72.02,-57.63 62.02,-54.13 62.02,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" target="_top" xlink:title="wrapper interface">
-<polygon fill="white" stroke="#666666" points="260.25,-72.88 142.25,-72.88 142.25,-42.38 260.25,-42.38 260.25,-72.88"/>
-<text text-anchor="start" x="150.25" y="-59.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="201.25" y="-48.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::generate</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.65,-57.62C113.45,-57.62 121.92,-57.62 130.98,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.72,-61.13 140.72,-57.63 130.72,-54.13 130.72,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408.62,-98.25 319.12,-98.25 319.12,-79 408.62,-79 408.62,-98.25"/>
-<text text-anchor="middle" x="363.88" y="-84.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.69,-68.9C275.99,-71.86 292.43,-75.03 307.56,-77.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="306.86,-81.38 317.35,-79.84 308.19,-74.51 306.86,-81.38"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" target="_top" xlink:title="function that adds parenthesis to the string.">
-<polygon fill="white" stroke="#666666" points="431.5,-42.88 296.25,-42.88 296.25,-12.37 431.5,-12.37 431.5,-42.88"/>
-<text text-anchor="start" x="304.25" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="363.88" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::makeStrings</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.69,-46.71C268.44,-45.26 276.47,-43.76 284.48,-42.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.08,-45.71 294.27,-40.44 283.8,-38.83 285.08,-45.71"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M335.26,-43.36C329.42,-52.43 338.96,-60.88 363.88,-60.88 377.5,-60.88 386.53,-58.35 390.96,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="394.4,-55.24 392.29,-44.86 387.46,-54.29 394.4,-55.24"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="571.25,-56.25 479.5,-56.25 479.5,-37 571.25,-37 571.25,-56.25"/>
-<text text-anchor="middle" x="525.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M431.59,-35.57C443.63,-37.01 456.07,-38.49 467.79,-39.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="467.37,-43.36 477.71,-41.07 468.2,-36.41 467.37,-43.36"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="583.25,-19.25 467.5,-19.25 467.5,0 583.25,0 583.25,-19.25"/>
-<text text-anchor="middle" x="525.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge7_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge7_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M431.59,-20.1C439.6,-19.19 447.79,-18.27 455.82,-17.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="455.99,-20.86 465.53,-16.27 455.2,-13.91 455.99,-20.86"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="double__factorial_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d89/double__factorial_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg b/d7/d89/double__factorial_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
deleted file mode 100644
index 3d92f65e9..000000000
--- a/d7/d89/double__factorial_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
+++ /dev/null
@@ -1,140 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="591pt" height="106pt"
- viewBox="0.00 0.00 591.25 106.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 102.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-67.25 0,-67.25 0,-48 37.75,-48 37.75,-67.25"/>
-<text text-anchor="middle" x="18.88" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="106.25,-67.25 73.75,-67.25 73.75,-48 106.25,-48 106.25,-67.25"/>
-<text text-anchor="middle" x="90" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.04,-57.62C45.45,-57.62 54.18,-57.62 62.3,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.02,-61.13 72.02,-57.63 62.02,-54.13 62.02,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" target="_top" xlink:title="wrapper interface">
-<polygon fill="white" stroke="#666666" points="260.25,-72.88 142.25,-72.88 142.25,-42.38 260.25,-42.38 260.25,-72.88"/>
-<text text-anchor="start" x="150.25" y="-59.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="201.25" y="-48.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::generate</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.65,-57.62C113.45,-57.62 121.92,-57.62 130.98,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.72,-61.13 140.72,-57.63 130.72,-54.13 130.72,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408.62,-98.25 319.12,-98.25 319.12,-79 408.62,-79 408.62,-98.25"/>
-<text text-anchor="middle" x="363.88" y="-84.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.69,-68.9C275.99,-71.86 292.43,-75.03 307.56,-77.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="306.86,-81.38 317.35,-79.84 308.19,-74.51 306.86,-81.38"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" target="_top" xlink:title="function that adds parenthesis to the string.">
-<polygon fill="white" stroke="#666666" points="431.5,-42.88 296.25,-42.88 296.25,-12.37 431.5,-12.37 431.5,-42.88"/>
-<text text-anchor="start" x="304.25" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="363.88" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::makeStrings</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.69,-46.71C268.44,-45.26 276.47,-43.76 284.48,-42.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.08,-45.71 294.27,-40.44 283.8,-38.83 285.08,-45.71"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M335.26,-43.36C329.42,-52.43 338.96,-60.88 363.88,-60.88 377.5,-60.88 386.53,-58.35 390.96,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="394.4,-55.24 392.29,-44.86 387.46,-54.29 394.4,-55.24"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="571.25,-56.25 479.5,-56.25 479.5,-37 571.25,-37 571.25,-56.25"/>
-<text text-anchor="middle" x="525.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M431.59,-35.57C443.63,-37.01 456.07,-38.49 467.79,-39.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="467.37,-43.36 477.71,-41.07 468.2,-36.41 467.37,-43.36"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="583.25,-19.25 467.5,-19.25 467.5,0 583.25,0 583.25,-19.25"/>
-<text text-anchor="middle" x="525.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge7_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge7_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M431.59,-20.1C439.6,-19.19 447.79,-18.27 455.82,-17.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="455.99,-20.86 465.53,-16.27 455.2,-13.91 455.99,-20.86"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d89/double__factorial_8cpp_abbbcebf3a2d0c67f4c3cfb5511a97981_cgraph.map b/d7/d89/double__factorial_8cpp_abbbcebf3a2d0c67f4c3cfb5511a97981_cgraph.map
deleted file mode 100644
index 69cb35328..000000000
--- a/d7/d89/double__factorial_8cpp_abbbcebf3a2d0c67f4c3cfb5511a97981_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,43,49,68"/>
-<area shape="rect" id="Node000002" href="$d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26" title=" " alt="" coords="100,5,266,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,48,111,33,112,38,50,53"/>
-<area shape="rect" id="Node000003" href="$d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d" title=" " alt="" coords="97,79,269,104"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="50,58,110,72,109,77,48,63"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="156,80,151,70,154,60,165,54,183,52,202,55,212,61,209,66,200,60,183,57,167,59,158,64,156,69,161,77"/>
-</map>
diff --git a/d7/d89/double__factorial_8cpp_abbbcebf3a2d0c67f4c3cfb5511a97981_cgraph.md5 b/d7/d89/double__factorial_8cpp_abbbcebf3a2d0c67f4c3cfb5511a97981_cgraph.md5
deleted file mode 100644
index 79f63d8f0..000000000
--- a/d7/d89/double__factorial_8cpp_abbbcebf3a2d0c67f4c3cfb5511a97981_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d5b85b6b81c07b4ab5e9bbc7ddc28765
\ No newline at end of file
diff --git a/d7/d89/double__factorial_8cpp_abbbcebf3a2d0c67f4c3cfb5511a97981_cgraph.svg b/d7/d89/double__factorial_8cpp_abbbcebf3a2d0c67f4c3cfb5511a97981_cgraph.svg
deleted file mode 100644
index 68c6876bc..000000000
--- a/d7/d89/double__factorial_8cpp_abbbcebf3a2d0c67f4c3cfb5511a97981_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="206pt" height="82pt"
- viewBox="0.00 0.00 205.75 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-46.25 0,-46.25 0,-27 32.5,-27 32.5,-46.25"/>
-<text text-anchor="middle" x="16.25" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.12,-74.25 71.12,-74.25 71.12,-55 195.12,-55 195.12,-74.25"/>
-<text text-anchor="middle" x="133.12" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_factorial_iterative</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.74,-40.4C44.9,-43.36 62.57,-47.67 79.65,-51.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.71,-55.21 89.26,-54.18 80.37,-48.41 78.71,-55.21"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.75,-19.25 68.5,-19.25 68.5,0 197.75,0 197.75,-19.25"/>
-<text text-anchor="middle" x="133.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_factorial_recursive</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.74,-32.98C44.6,-30.2 61.7,-26.18 78.38,-22.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.81,-25.75 87.75,-20.06 77.21,-18.94 78.81,-25.75"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.83,-19.54C106.48,-28.15 112.58,-37.25 133.12,-37.25 144.36,-37.25 151.28,-34.53 153.87,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.32,-30.03 151.75,-21.02 150.48,-31.53 157.32,-30.03"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d89/double__factorial_8cpp_abbbcebf3a2d0c67f4c3cfb5511a97981_cgraph_org.svg b/d7/d89/double__factorial_8cpp_abbbcebf3a2d0c67f4c3cfb5511a97981_cgraph_org.svg
deleted file mode 100644
index ca456ba1a..000000000
--- a/d7/d89/double__factorial_8cpp_abbbcebf3a2d0c67f4c3cfb5511a97981_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="206pt" height="82pt"
- viewBox="0.00 0.00 205.75 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-46.25 0,-46.25 0,-27 32.5,-27 32.5,-46.25"/>
-<text text-anchor="middle" x="16.25" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.12,-74.25 71.12,-74.25 71.12,-55 195.12,-55 195.12,-74.25"/>
-<text text-anchor="middle" x="133.12" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_factorial_iterative</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.74,-40.4C44.9,-43.36 62.57,-47.67 79.65,-51.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.71,-55.21 89.26,-54.18 80.37,-48.41 78.71,-55.21"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.75,-19.25 68.5,-19.25 68.5,0 197.75,0 197.75,-19.25"/>
-<text text-anchor="middle" x="133.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">double_factorial_recursive</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.74,-32.98C44.6,-30.2 61.7,-26.18 78.38,-22.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.81,-25.75 87.75,-20.06 77.21,-18.94 78.81,-25.75"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.83,-19.54C106.48,-28.15 112.58,-37.25 133.12,-37.25 144.36,-37.25 151.28,-34.53 153.87,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.32,-30.03 151.75,-21.02 150.48,-31.53 157.32,-30.03"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d89/double__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d7/d89/double__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 21936b38f..000000000
--- a/d7/d89/double__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,18 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,47,55,72"/>
-<area shape="rect" id="Node000002" href="$d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" title=" " alt="" coords="103,47,153,72"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,57,88,57,88,62,55,62"/>
-<area shape="rect" id="Node000003" href="$dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="201,47,244,72"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,57,186,57,186,62,153,62"/>
-<area shape="rect" id="Node000004" href="$df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" title="wrapper interface" alt="" coords="292,39,450,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="245,57,277,57,277,62,245,62"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/clear.html#" title=" " alt="" coords="528,5,648,31"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="450,42,512,30,513,35,451,47"/>
-<area shape="rect" id="Node000006" href="$df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" title="function that adds parenthesis to the string." alt="" coords="498,79,678,120"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="451,71,482,77,481,83,450,77"/>
-<area shape="poly" id="edge7_Node000006_Node000006" title=" " alt="" coords="547,79,545,69,552,60,566,55,588,53,611,55,625,61,623,66,610,60,588,58,567,60,555,64,550,70,552,78"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="742,61,864,87"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="678,86,726,81,727,86,678,92"/>
-<area shape="rect" id="Node000008" 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="726,111,880,136"/>
-<area shape="poly" id="edge8_Node000006_Node000008" title=" " alt="" coords="678,107,711,111,710,116,678,112"/>
-</map>
diff --git a/d7/d89/double__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d7/d89/double__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index d3a106877..000000000
--- a/d7/d89/double__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-38379ac6f4e4f047c537f9ca6f0d2adc
\ No newline at end of file
diff --git a/d7/d89/double__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d7/d89/double__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 99eb7d8a2..000000000
--- a/d7/d89/double__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,241 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 106 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 664;
-var viewHeight = 106;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-67.25 0,-67.25 0,-48 37,-48 37,-67.25"/>
-<text text-anchor="middle" x="18.5" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-67.25 73,-67.25 73,-48 110.75,-48 110.75,-67.25"/>
-<text text-anchor="middle" x="91.88" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-57.62C44.55,-57.62 53.37,-57.62 61.69,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-61.13 71.43,-57.63 61.43,-54.13 61.43,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="179.25,-67.25 146.75,-67.25 146.75,-48 179.25,-48 179.25,-67.25"/>
-<text text-anchor="middle" x="163" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.04,-57.62C118.45,-57.62 127.18,-57.62 135.3,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.02,-61.13 145.02,-57.63 135.02,-54.13 135.02,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" target="_top" xlink:title="wrapper interface">
-<polygon fill="white" stroke="#666666" points="333.25,-72.88 215.25,-72.88 215.25,-42.38 333.25,-42.38 333.25,-72.88"/>
-<text text-anchor="start" x="223.25" y="-59.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="274.25" y="-48.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::generate</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M179.65,-57.62C186.45,-57.62 194.92,-57.62 203.98,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="203.72,-61.13 213.72,-57.63 203.72,-54.13 203.72,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="481.62,-98.25 392.12,-98.25 392.12,-79 481.62,-79 481.62,-98.25"/>
-<text text-anchor="middle" x="436.88" y="-84.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.69,-68.9C348.99,-71.86 365.43,-75.03 380.56,-77.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.86,-81.38 390.35,-79.84 381.19,-74.51 379.86,-81.38"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" target="_top" xlink:title="function that adds parenthesis to the string.">
-<polygon fill="white" stroke="#666666" points="504.5,-42.88 369.25,-42.88 369.25,-12.37 504.5,-12.37 504.5,-42.88"/>
-<text text-anchor="start" x="377.25" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="436.88" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::makeStrings</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.69,-46.71C341.44,-45.26 349.47,-43.76 357.48,-42.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="358.08,-45.71 367.27,-40.44 356.8,-38.83 358.08,-45.71"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge7_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge7_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M408.26,-43.36C402.42,-52.43 411.96,-60.88 436.88,-60.88 450.5,-60.88 459.53,-58.35 463.96,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="467.4,-55.24 465.29,-44.86 460.46,-54.29 467.4,-55.24"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="644.25,-56.25 552.5,-56.25 552.5,-37 644.25,-37 644.25,-56.25"/>
-<text text-anchor="middle" x="598.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M504.59,-35.57C516.63,-37.01 529.07,-38.49 540.79,-39.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="540.37,-43.36 550.71,-41.07 541.2,-36.41 540.37,-43.36"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="656.25,-19.25 540.5,-19.25 540.5,0 656.25,0 656.25,-19.25"/>
-<text text-anchor="middle" x="598.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge8_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge8_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M504.59,-20.1C512.6,-19.19 520.79,-18.27 528.82,-17.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="528.99,-20.86 538.53,-16.27 528.2,-13.91 528.99,-20.86"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="double__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/d89/double__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d7/d89/double__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 64462f984..000000000
--- a/d7/d89/double__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,158 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="664pt" height="106pt"
- viewBox="0.00 0.00 664.25 106.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 102.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-67.25 0,-67.25 0,-48 37,-48 37,-67.25"/>
-<text text-anchor="middle" x="18.5" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-67.25 73,-67.25 73,-48 110.75,-48 110.75,-67.25"/>
-<text text-anchor="middle" x="91.88" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-57.62C44.55,-57.62 53.37,-57.62 61.69,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-61.13 71.43,-57.63 61.43,-54.13 61.43,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="179.25,-67.25 146.75,-67.25 146.75,-48 179.25,-48 179.25,-67.25"/>
-<text text-anchor="middle" x="163" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.04,-57.62C118.45,-57.62 127.18,-57.62 135.3,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.02,-61.13 145.02,-57.63 135.02,-54.13 135.02,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" target="_top" xlink:title="wrapper interface">
-<polygon fill="white" stroke="#666666" points="333.25,-72.88 215.25,-72.88 215.25,-42.38 333.25,-42.38 333.25,-72.88"/>
-<text text-anchor="start" x="223.25" y="-59.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="274.25" y="-48.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::generate</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M179.65,-57.62C186.45,-57.62 194.92,-57.62 203.98,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="203.72,-61.13 213.72,-57.63 203.72,-54.13 203.72,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="481.62,-98.25 392.12,-98.25 392.12,-79 481.62,-79 481.62,-98.25"/>
-<text text-anchor="middle" x="436.88" y="-84.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.69,-68.9C348.99,-71.86 365.43,-75.03 380.56,-77.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.86,-81.38 390.35,-79.84 381.19,-74.51 379.86,-81.38"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" target="_top" xlink:title="function that adds parenthesis to the string.">
-<polygon fill="white" stroke="#666666" points="504.5,-42.88 369.25,-42.88 369.25,-12.37 504.5,-12.37 504.5,-42.88"/>
-<text text-anchor="start" x="377.25" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="436.88" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::makeStrings</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.69,-46.71C341.44,-45.26 349.47,-43.76 357.48,-42.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="358.08,-45.71 367.27,-40.44 356.8,-38.83 358.08,-45.71"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge7_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge7_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M408.26,-43.36C402.42,-52.43 411.96,-60.88 436.88,-60.88 450.5,-60.88 459.53,-58.35 463.96,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="467.4,-55.24 465.29,-44.86 460.46,-54.29 467.4,-55.24"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="644.25,-56.25 552.5,-56.25 552.5,-37 644.25,-37 644.25,-56.25"/>
-<text text-anchor="middle" x="598.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M504.59,-35.57C516.63,-37.01 529.07,-38.49 540.79,-39.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="540.37,-43.36 550.71,-41.07 541.2,-36.41 540.37,-43.36"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="656.25,-19.25 540.5,-19.25 540.5,0 656.25,0 656.25,-19.25"/>
-<text text-anchor="middle" x="598.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge8_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge8_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M504.59,-20.1C512.6,-19.19 520.79,-18.27 528.82,-17.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="528.99,-20.86 538.53,-16.27 528.2,-13.91 528.99,-20.86"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/d89/double__factorial_8cpp_source.html b/d7/d89/double__factorial_8cpp_source.html
new file mode 100644
index 000000000..83f8b05f3
--- /dev/null
+++ b/d7/d89/double__factorial_8cpp_source.html
@@ -0,0 +1,196 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/double_factorial.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/d89/double__factorial_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">double_factorial.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d7/d89/double__factorial_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="foldopen" id="foldopen00018" data-start="{" data-end="}">
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"><a class="line" href="../../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26">   18</a></span>uint64_t <a class="code hl_function" href="../../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26">double_factorial_iterative</a>(uint64_t n) {</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    uint64_t res = 1;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="keywordflow">for</span> (uint64_t i = n;; i -= 2) {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        <span class="keywordflow">if</span> (i == 0 || i == 1)</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>            <span class="keywordflow">return</span> res;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        res *= i;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    }</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="keywordflow">return</span> res;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>}</div>
+</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="foldopen" id="foldopen00031" data-start="{" data-end="}">
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="../../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d">   31</a></span>uint64_t <a class="code hl_function" href="../../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d">double_factorial_recursive</a>(uint64_t n) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordflow">if</span> (n &lt;= 1)</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        <span class="keywordflow">return</span> 1;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">return</span> n * <a class="code hl_function" href="../../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d">double_factorial_recursive</a>(n - 2);</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>}</div>
+</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="foldopen" id="foldopen00043" data-start="{" data-end="}">
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="../../d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981">   43</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(uint64_t n, uint64_t expected) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    assert(<a class="code hl_function" href="../../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26">double_factorial_iterative</a>(n) == expected);</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    assert(<a class="code hl_function" href="../../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d">double_factorial_recursive</a>(n) == expected);</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>}</div>
+</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="foldopen" id="foldopen00051" data-start="{" data-end="}">
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="../../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">   51</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>() {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1:\t n=5\t...&quot;</span>;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(5, 15);</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2:\t n=15\t...&quot;</span>;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(15, 2027025);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3:\t n=0\t...&quot;</span>;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(0, 1);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>}</div>
+</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="foldopen" id="foldopen00068" data-start="{" data-end="}">
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"><a class="line" href="../../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   68</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <a class="code hl_function" href="../../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>}</div>
+</div>
+<div class="ttc" id="adouble__factorial_8cpp_html_a0a3c417360400093891a9ccddaa4be26"><div class="ttname"><a href="../../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26">double_factorial_iterative</a></div><div class="ttdeci">uint64_t double_factorial_iterative(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="#l00018">double_factorial.cpp:18</a></div></div>
+<div class="ttc" id="adouble__factorial_8cpp_html_a68ba20fed2ce427f6469c7689437829d"><div class="ttname"><a href="../../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d">double_factorial_recursive</a></div><div class="ttdeci">uint64_t double_factorial_recursive(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="#l00031">double_factorial.cpp:31</a></div></div>
+<div class="ttc" id="adouble__factorial_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="#l00051">double_factorial.cpp:51</a></div></div>
+<div class="ttc" id="adouble__factorial_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00068">double_factorial.cpp:68</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00082">generate_parentheses.cpp:82</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d7/d89/double__factorial_8cpp.html">double_factorial.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/da4/struct_list_node.html b/d7/da4/struct_list_node.html
index df36a5d39..830132696 100644
--- a/d7/da4/struct_list_node.html
+++ b/d7/da4/struct_list_node.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ListNode Struct Reference</title>
+<title>TheAlgorithms/C++: ListNode Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -126,13 +143,11 @@ Public Member Functions</h2></td></tr>
 &#160;</td><td class="memItemRight" valign="bottom"><b>ListNode</b> ()=default</td></tr>
 <tr class="memdesc:a3cfee2eb667c332dc32595208164ef0a"><td class="mdescLeft">&#160;</td><td class="mdescRight">default constructor <br /></td></tr>
 <tr class="separator:a3cfee2eb667c332dc32595208164ef0a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aaad9b553e2f936726f5b35ff2734125d" id="r_aaad9b553e2f936726f5b35ff2734125d"><td class="memItemLeft" align="right" valign="top"><a id="aaad9b553e2f936726f5b35ff2734125d" name="aaad9b553e2f936726f5b35ff2734125d"></a>
-&#160;</td><td class="memItemRight" valign="bottom"><b>ListNode</b> (int x)</td></tr>
-<tr class="memdesc:aaad9b553e2f936726f5b35ff2734125d"><td class="mdescLeft">&#160;</td><td class="mdescRight">constructor with value for node-&gt;val provided <br /></td></tr>
+<tr class="memitem:aaad9b553e2f936726f5b35ff2734125d" id="r_aaad9b553e2f936726f5b35ff2734125d"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aaad9b553e2f936726f5b35ff2734125d">ListNode</a> (int x)</td></tr>
+<tr class="memdesc:aaad9b553e2f936726f5b35ff2734125d"><td class="mdescLeft">&#160;</td><td class="mdescRight">constructor with value for node-&gt;val provided  <br /></td></tr>
 <tr class="separator:aaad9b553e2f936726f5b35ff2734125d"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:afc97c5b9d2e7cc82d0718245688f6ff9" id="r_afc97c5b9d2e7cc82d0718245688f6ff9"><td class="memItemLeft" align="right" valign="top"><a id="afc97c5b9d2e7cc82d0718245688f6ff9" name="afc97c5b9d2e7cc82d0718245688f6ff9"></a>
-&#160;</td><td class="memItemRight" valign="bottom"><b>ListNode</b> (int x, <a class="el" href="../../d7/da4/struct_list_node.html">ListNode</a> *<a class="el" href="#ad78b392c2ddc25c3243d0c2f30692fb1">next</a>)</td></tr>
-<tr class="memdesc:afc97c5b9d2e7cc82d0718245688f6ff9"><td class="mdescLeft">&#160;</td><td class="mdescRight">constructor with values provided for node-&gt;val and node-&gt;next <br /></td></tr>
+<tr class="memitem:afc97c5b9d2e7cc82d0718245688f6ff9" id="r_afc97c5b9d2e7cc82d0718245688f6ff9"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afc97c5b9d2e7cc82d0718245688f6ff9">ListNode</a> (int x, <a class="el" href="../../d7/da4/struct_list_node.html">ListNode</a> *<a class="el" href="#ad78b392c2ddc25c3243d0c2f30692fb1">next</a>)</td></tr>
+<tr class="memdesc:afc97c5b9d2e7cc82d0718245688f6ff9"><td class="mdescLeft">&#160;</td><td class="mdescRight">constructor with values provided for node-&gt;val and node-&gt;next  <br /></td></tr>
 <tr class="separator:afc97c5b9d2e7cc82d0718245688f6ff9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
@@ -147,7 +162,72 @@ Public Attributes</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>for IO operations </p>
 <p>for assert Definition for singly-linked list. </p>
-</div><h2 class="groupheader">Member Data Documentation</h2>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dfa/median__search2_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../d8/dfa/median__search2_8cpp_source.html">median_search2.cpp</a>.</p>
+</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
+<a id="aaad9b553e2f936726f5b35ff2734125d" name="aaad9b553e2f936726f5b35ff2734125d"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aaad9b553e2f936726f5b35ff2734125d">&#9670;&#160;</a></span>ListNode() <span class="overload">[1/2]</span></h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">ListNode::ListNode </td>
+          <td>(</td>
+          <td class="paramtype">int</td>          <td class="paramname"><span class="paramname"><em>x</em></span></td><td>)</td>
+          <td></td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">explicit</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>constructor with value for node-&gt;val provided </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dfa/median__search2_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../d8/dfa/median__search2_8cpp_source.html">median_search2.cpp</a>.</p>
+
+</div>
+</div>
+<a id="afc97c5b9d2e7cc82d0718245688f6ff9" name="afc97c5b9d2e7cc82d0718245688f6ff9"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#afc97c5b9d2e7cc82d0718245688f6ff9">&#9670;&#160;</a></span>ListNode() <span class="overload">[2/2]</span></h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">ListNode::ListNode </td>
+          <td>(</td>
+          <td class="paramtype">int</td>          <td class="paramname"><span class="paramname"><em>x</em></span>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype"><a class="el" href="../../d7/da4/struct_list_node.html">ListNode</a> *</td>          <td class="paramname"><span class="paramname"><em>next</em></span>&#160;)</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>constructor with values provided for node-&gt;val and node-&gt;next </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dfa/median__search2_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../d8/dfa/median__search2_8cpp_source.html">median_search2.cpp</a>.</p>
+
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
 <a id="ad78b392c2ddc25c3243d0c2f30692fb1" name="ad78b392c2ddc25c3243d0c2f30692fb1"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ad78b392c2ddc25c3243d0c2f30692fb1">&#9670;&#160;</a></span>next</h2>
 
@@ -161,7 +241,9 @@ Public Attributes</h2></td></tr>
 </div><div class="memdoc">
 
 <p>pointer to the next node </p>
-<div class="fragment"><div class="line"><span class="lineno">   33</span>{<span class="keyword">nullptr</span>};  <span class="comment">///&lt; pointer to the next node</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dfa/median__search2_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../d8/dfa/median__search2_8cpp_source.html">median_search2.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   33</span>{<span class="keyword">nullptr</span>};  </div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -178,12 +260,14 @@ Public Attributes</h2></td></tr>
 </div><div class="memdoc">
 
 <p>the value stored in the node </p>
-<div class="fragment"><div class="line"><span class="lineno">   32</span>{0};               <span class="comment">///&lt; the value stored in the node</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dfa/median__search2_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../d8/dfa/median__search2_8cpp_source.html">median_search2.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   32</span>{0};               </div>
 </div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>search/<a class="el" href="../../d8/dfa/median__search2_8cpp.html">median_search2.cpp</a></li>
+<li>search/<a class="el" href="../../d8/dfa/median__search2_8cpp_source.html">median_search2.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d7/da6/eratosthenes_8cpp.html b/d7/da6/eratosthenes_8cpp.html
index 73b07a3e9..47c0bb605 100644
--- a/d7/da6/eratosthenes_8cpp.html
+++ b/d7/da6/eratosthenes_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/eratosthenes.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/eratosthenes.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for eratosthenes.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/dd9/eratosthenes_8cpp__incl.svg" width="415" height="111"><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">
+</div>
+<p><a href="../../d7/da6/eratosthenes_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -132,11 +151,11 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a91366864111e1fac29722ca45e02ea8f" id="r_a91366864111e1fac29722ca45e02ea8f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f">math::sieve</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; *vec)</td></tr>
+<tr class="memitem:a91366864111e1fac29722ca45e02ea8f" id="r_a91366864111e1fac29722ca45e02ea8f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f">math::sieve</a> (std::vector&lt; bool &gt; *vec)</td></tr>
 <tr class="memdesc:a91366864111e1fac29722ca45e02ea8f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Performs the sieve.  <br /></td></tr>
 <tr class="separator:a91366864111e1fac29722ca45e02ea8f"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad09d59850865012a6fd95d89954c82e4" id="r_ad09d59850865012a6fd95d89954c82e4"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4">math::print_primes</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; const &amp;<a class="el" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>)</td></tr>
-<tr class="memdesc:ad09d59850865012a6fd95d89954c82e4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints all the indexes of true values in the passed <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>.  <br /></td></tr>
+<tr class="memitem:ad09d59850865012a6fd95d89954c82e4" id="r_ad09d59850865012a6fd95d89954c82e4"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4">math::print_primes</a> (std::vector&lt; bool &gt; const &amp;<a class="el" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>)</td></tr>
+<tr class="memdesc:ad09d59850865012a6fd95d89954c82e4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints all the indexes of true values in the passed std::vector.  <br /></td></tr>
 <tr class="separator:ad09d59850865012a6fd95d89954c82e4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
 <tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-tests the sieve function for major inconsistencies.  <br /></td></tr>
@@ -149,6 +168,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes" target="_blank">The Sieve of Eratosthenes</a> </p>
 <p>Store an array of booleans where a true value indicates that it's index is prime. For all the values in the array starting from 2 which we know is prime, we walk the array in multiples of the current outer value setting them to not prime. If we remove all multiples of a value as we see it, we'll be left with just primes.</p>
 <p>Pass "print" as a command line arg to see the generated list of primes </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/thechubbypanda" target="_blank">Keval Kapdee</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d7/da6/eratosthenes_8cpp_source.html">eratosthenes.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">&#9670;&#160;</a></span>main()</h2>
@@ -178,57 +199,45 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/da6/eratosthenes_8cpp_source.html#l00087">87</a> of file <a class="el" href="../../d7/da6/eratosthenes_8cpp_source.html">eratosthenes.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   87</span>                                 {</div>
 <div class="line"><span class="lineno">   88</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   89</span> </div>
 <div class="line"><span class="lineno">   90</span>    <span class="comment">// The largest prime we will check for</span></div>
-<div class="line"><span class="lineno">   91</span>    <span class="keyword">auto</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">max</a> = 10000;</div>
+<div class="line"><span class="lineno">   91</span>    <span class="keyword">auto</span> max = 10000;</div>
 <div class="line"><span class="lineno">   92</span> </div>
 <div class="line"><span class="lineno">   93</span>    <span class="comment">// Store a boolean for every number which states if that index is prime or</span></div>
 <div class="line"><span class="lineno">   94</span>    <span class="comment">// not</span></div>
-<div class="line"><span class="lineno">   95</span>    <span class="keyword">auto</span> <a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a>(max, <span class="keyword">true</span>);</div>
+<div class="line"><span class="lineno">   95</span>    <span class="keyword">auto</span> <a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a> = std::vector&lt;bool&gt;(max, <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">   96</span> </div>
 <div class="line"><span class="lineno">   97</span>    <span class="comment">// Store the algorithm start time</span></div>
-<div class="line"><span class="lineno">   98</span>    <span class="keyword">auto</span> start = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html">std::chrono::high_resolution_clock::now</a>();</div>
+<div class="line"><span class="lineno">   98</span>    <span class="keyword">auto</span> start = std::chrono::high_resolution_clock::now();</div>
 <div class="line"><span class="lineno">   99</span> </div>
 <div class="line"><span class="lineno">  100</span>    <span class="comment">// Run the sieve</span></div>
 <div class="line"><span class="lineno">  101</span>    <a class="code hl_function" href="../../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f">math::sieve</a>(&amp;<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>);</div>
 <div class="line"><span class="lineno">  102</span> </div>
 <div class="line"><span class="lineno">  103</span>    <span class="comment">// Time difference calculation</span></div>
-<div class="line"><span class="lineno">  104</span>    <span class="keyword">auto</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">time</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html">std::chrono::duration_cast</a>&lt;</div>
-<div class="line"><span class="lineno">  105</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/duration.html">std::chrono::duration&lt;double, std::ratio&lt;1&gt;</a>&gt;&gt;(</div>
-<div class="line"><span class="lineno">  106</span>                    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html">std::chrono::high_resolution_clock::now</a>() - start)</div>
+<div class="line"><span class="lineno">  104</span>    <span class="keyword">auto</span> time = std::chrono::duration_cast&lt;</div>
+<div class="line"><span class="lineno">  105</span>                    std::chrono::duration&lt;double, std::ratio&lt;1&gt;&gt;&gt;(</div>
+<div class="line"><span class="lineno">  106</span>                    std::chrono::high_resolution_clock::now() - start)</div>
 <div class="line"><span class="lineno">  107</span>                    .count();</div>
 <div class="line"><span class="lineno">  108</span> </div>
 <div class="line"><span class="lineno">  109</span>    <span class="comment">// Print the primes if we see that &quot;print&quot; was passed as an arg</span></div>
-<div class="line"><span class="lineno">  110</span>    <span class="keywordflow">if</span> (argc &gt; 1 &amp;&amp; argv[1] == <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>(<span class="stringliteral">&quot;print&quot;</span>)) {</div>
+<div class="line"><span class="lineno">  110</span>    <span class="keywordflow">if</span> (argc &gt; 1 &amp;&amp; argv[1] == std::string(<span class="stringliteral">&quot;print&quot;</span>)) {</div>
 <div class="line"><span class="lineno">  111</span>        <a class="code hl_function" href="../../dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4">math::print_primes</a>(<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>);</div>
 <div class="line"><span class="lineno">  112</span>    }</div>
 <div class="line"><span class="lineno">  113</span> </div>
 <div class="line"><span class="lineno">  114</span>    <span class="comment">// Print the time taken we found earlier</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> &lt;&lt; <span class="stringliteral">&quot;Time taken: &quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">time</a> &lt;&lt; <span class="stringliteral">&quot; seconds&quot;</span> &lt;&lt; <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">  115</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Time taken: &quot;</span> &lt;&lt; time &lt;&lt; <span class="stringliteral">&quot; seconds&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  116</span> </div>
 <div class="line"><span class="lineno">  117</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  118</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="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="aduration_cast_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html">std::chrono::duration_cast</a></div><div class="ttdeci">T duration_cast(T... args)</div></div>
-<div class="ttc" id="aduration_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/duration.html">std::chrono::duration</a></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="aeratosthenes_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-tests the sieve function for major inconsistencies.</div><div class="ttdef"><b>Definition</b> eratosthenes.cpp:64</div></div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="anamespacemath_html_a91366864111e1fac29722ca45e02ea8f"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f">math::sieve</a></div><div class="ttdeci">void sieve(std::vector&lt; bool &gt; *vec)</div><div class="ttdoc">Performs the sieve.</div><div class="ttdef"><b>Definition</b> eratosthenes.cpp:33</div></div>
-<div class="ttc" id="anamespacemath_html_ad09d59850865012a6fd95d89954c82e4"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4">math::print_primes</a></div><div class="ttdeci">void print_primes(std::vector&lt; bool &gt; const &amp;primes)</div><div class="ttdoc">Prints all the indexes of true values in the passed std::vector.</div><div class="ttdef"><b>Definition</b> eratosthenes.cpp:51</div></div>
-<div class="ttc" id="anow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html">std::chrono::high_resolution_clock::now</a></div><div class="ttdeci">T now(T... args)</div></div>
-<div class="ttc" id="aprime__numbers_8cpp_html_a9575f3a51eeb8a57d657b3db6a4b441a"><div class="ttname"><a href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a></div><div class="ttdeci">std::vector&lt; int &gt; primes(size_t max)</div><div class="ttdef"><b>Definition</b> prime_numbers.cpp:12</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/da6/eratosthenes_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="651" height="355"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aeratosthenes_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-tests the sieve function for major inconsistencies.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/da6/eratosthenes_8cpp_source.html#l00064">eratosthenes.cpp:64</a></div></div>
+<div class="ttc" id="anamespacemath_html_a91366864111e1fac29722ca45e02ea8f"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f">math::sieve</a></div><div class="ttdeci">void sieve(std::vector&lt; bool &gt; *vec)</div><div class="ttdoc">Performs the sieve.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/da6/eratosthenes_8cpp_source.html#l00033">eratosthenes.cpp:33</a></div></div>
+<div class="ttc" id="anamespacemath_html_ad09d59850865012a6fd95d89954c82e4"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4">math::print_primes</a></div><div class="ttdeci">void print_primes(std::vector&lt; bool &gt; const &amp;primes)</div><div class="ttdoc">Prints all the indexes of true values in the passed std::vector.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/da6/eratosthenes_8cpp_source.html#l00051">eratosthenes.cpp:51</a></div></div>
+<div class="ttc" id="aprime__numbers_8cpp_html_a9575f3a51eeb8a57d657b3db6a4b441a"><div class="ttname"><a href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a></div><div class="ttdeci">std::vector&lt; int &gt; primes(size_t max)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d9b/prime__numbers_8cpp_source.html#l00012">prime_numbers.cpp:12</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -256,8 +265,10 @@ Here is the call graph for this function:</div>
 
 <p>Self-tests the sieve function for major inconsistencies. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/da6/eratosthenes_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../d7/da6/eratosthenes_8cpp_source.html">eratosthenes.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   64</span>                   {</div>
-<div class="line"><span class="lineno">   65</span>    <span class="keyword">auto</span> <a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a>(10, <span class="keyword">true</span>);</div>
+<div class="line"><span class="lineno">   65</span>    <span class="keyword">auto</span> <a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a> = std::vector&lt;bool&gt;(10, <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">   66</span>    <a class="code hl_function" href="../../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f">math::sieve</a>(&amp;<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>);</div>
 <div class="line"><span class="lineno">   67</span>    assert(<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>[0] == <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">   68</span>    assert(<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>[1] == <span class="keyword">false</span>);</div>
@@ -270,14 +281,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   75</span>    assert(<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>[8] == <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">   76</span>    assert(<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>[9] == <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">   77</span> </div>
-<div class="line"><span class="lineno">   78</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   78</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   79</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/da6/eratosthenes_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="415" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d7/da6/eratosthenes_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d7/da6/eratosthenes_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
deleted file mode 100644
index a00039a8e..000000000
--- a/d7/da6/eratosthenes_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ /dev/null
@@ -1,26 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,157,55,183"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/duration/duration_cast.html#" title=" " alt="" coords="107,5,280,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="33,156,57,104,76,74,101,48,121,35,124,40,104,52,80,78,61,107,38,158"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="341,56,412,82"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="37,156,62,123,80,105,101,92,159,71,219,61,277,59,326,61,325,66,277,64,220,67,160,77,104,97,84,110,66,126,41,159"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/high_resolution_clock/now.html#" title=" " alt="" coords="103,308,284,349"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="38,182,62,233,81,262,104,288,118,299,115,303,101,292,77,266,57,236,34,185"/>
-<area shape="rect" id="Node000005" href="$de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a" title=" " alt="" coords="346,157,407,183"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="55,168,331,168,331,173,55,173"/>
-<area shape="rect" id="Node000007" href="$dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4" title="Prints all the indexes of true values in the passed std::vector." alt="" coords="129,107,258,132"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="54,160,134,135,136,140,56,165"/>
-<area shape="rect" id="Node000009" href="$dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f" title="Performs the sieve." alt="" coords="332,208,421,234"/>
-<area shape="poly" id="edge10_Node000001_Node000009" title=" " alt="" coords="41,182,66,215,83,231,104,244,132,253,161,258,221,259,277,250,326,237,327,242,279,255,221,264,160,264,130,258,102,249,80,236,62,219,37,185"/>
-<area shape="rect" id="Node000010" href="$d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;tests the sieve function for major inconsistencies." alt="" coords="172,208,215,234"/>
-<area shape="poly" id="edge12_Node000001_Node000010" title=" " alt="" coords="56,175,158,207,156,212,54,180"/>
-<area shape="rect" id="Node000006" 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="469,157,645,183"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="407,168,454,168,454,173,407,173"/>
-<area shape="poly" id="edge7_Node000007_Node000003" title=" " alt="" coords="242,103,325,80,327,85,243,109"/>
-<area shape="poly" id="edge8_Node000007_Node000005" title=" " alt="" coords="243,130,332,155,331,160,242,136"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="499,108,615,134"/>
-<area shape="poly" id="edge9_Node000007_Node000008" title=" " alt="" coords="258,117,484,118,484,123,258,122"/>
-<area shape="poly" id="edge11_Node000009_Node000008" title=" " alt="" coords="402,205,420,193,433,180,442,167,452,155,468,143,483,135,486,140,471,147,456,159,447,171,437,183,423,198,405,210"/>
-<area shape="poly" id="edge13_Node000010_Node000005" title=" " alt="" coords="215,212,331,180,332,185,216,218"/>
-<area shape="poly" id="edge14_Node000010_Node000009" title=" " alt="" coords="215,218,317,218,317,224,215,224"/>
-</map>
diff --git a/d7/da6/eratosthenes_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d7/da6/eratosthenes_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
deleted file mode 100644
index 3a9de1a78..000000000
--- a/d7/da6/eratosthenes_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7c176131606f002ced7b6a8f1b653d2d
\ No newline at end of file
diff --git a/d7/da6/eratosthenes_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d7/da6/eratosthenes_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
deleted file mode 100644
index 2a06d1e9e..000000000
--- a/d7/da6/eratosthenes_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ /dev/null
@@ -1,255 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="488pt" height="266pt"
- viewBox="0.00 0.00 487.50 265.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 261.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-143.88 0,-143.88 0,-124.62 37,-124.62 37,-143.88"/>
-<text text-anchor="middle" x="18.5" y="-130.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="205.62,-257.88 76.38,-257.88 76.38,-238.62 205.62,-238.62 205.62,-257.88"/>
-<text text-anchor="middle" x="141" y="-244.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::duration_cast</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.81,-144.15C29.44,-162.53 46.07,-202.06 73,-224.25 77.42,-227.89 82.43,-231 87.67,-233.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.01,-236.74 96.57,-237.58 88.84,-230.34 86.01,-236.74"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-219.88 251.75,-219.88 251.75,-200.62 305.25,-200.62 305.25,-219.88"/>
-<text text-anchor="middle" x="278.5" y="-206.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.33,-143.94C33.91,-157.23 51.3,-180.64 73,-191.25 126.58,-217.45 197.45,-217.53 240.14,-214.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="240.21,-217.93 249.89,-213.62 239.63,-210.96 240.21,-217.93"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209,-30.5 73,-30.5 73,0 209,0 209,-30.5"/>
-<text text-anchor="start" x="81" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::high_resolution</text>
-<text text-anchor="middle" x="141" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.05,-124.23C29.98,-105.99 46.93,-67.18 73,-44.25 76.28,-41.37 79.89,-38.73 83.68,-36.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.09,-39.56 92.08,-31.6 81.65,-33.46 85.09,-39.56"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="301.12,-143.88 255.88,-143.88 255.88,-124.62 301.12,-124.62 301.12,-143.88"/>
-<text text-anchor="middle" x="278.5" y="-130.38" font-family="Helvetica,sans-Serif" font-size="10.00">primes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-134.25C79.98,-134.25 189.23,-134.25 244.47,-134.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.19,-137.75 254.19,-134.25 244.19,-130.75 244.19,-137.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4" target="_top" xlink:title="Prints all the indexes of true values in the passed std::vector.">
-<polygon fill="white" stroke="#666666" points="189.5,-181.88 92.5,-181.88 92.5,-162.62 189.5,-162.62 189.5,-181.88"/>
-<text text-anchor="middle" x="141" y="-168.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::print_primes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.28,-139.86C53.04,-144.83 76.69,-152.28 97.32,-158.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.06,-162.06 106.65,-161.73 98.17,-155.39 96.06,-162.06"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f" target="_top" xlink:title="Performs the sieve.">
-<polygon fill="white" stroke="#666666" points="312,-105.88 245,-105.88 245,-86.62 312,-86.62 312,-105.88"/>
-<text text-anchor="middle" x="278.5" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::sieve</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge10_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge10_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.2,-124.27C33.63,-110.66 50.83,-86.85 73,-77.25 127.85,-53.51 198.55,-69 240.83,-82.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.68,-85.84 250.27,-85.69 241.9,-79.2 239.68,-85.84"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;tests the sieve function for major inconsistencies.">
-<polygon fill="white" stroke="#666666" points="157.25,-105.88 124.75,-105.88 124.75,-86.62 157.25,-86.62 157.25,-105.88"/>
-<text text-anchor="middle" x="141" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge12_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge12_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.28,-128.64C57.44,-122.28 90.51,-111.86 113.67,-104.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="114.52,-107.96 123,-101.61 112.41,-101.28 114.52,-107.96"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="479.5,-143.88 348,-143.88 348,-124.62 479.5,-124.62 479.5,-143.88"/>
-<text text-anchor="middle" x="413.75" y="-130.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M301.5,-134.25C311.34,-134.25 323.57,-134.25 336.29,-134.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.04,-137.75 346.04,-134.25 336.04,-130.75 336.04,-137.75"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge7_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge7_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.96,-182.33C197.22,-187.74 220.93,-194.39 240.38,-199.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.23,-203.15 249.81,-202.48 241.12,-196.41 239.23,-203.15"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge8_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge8_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.96,-162.17C198.63,-156.37 224.42,-149.14 244.56,-143.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="245.26,-146.93 253.94,-140.86 243.37,-140.19 245.26,-146.93"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="457,-180.88 370.5,-180.88 370.5,-161.62 457,-161.62 457,-180.88"/>
-<text text-anchor="middle" x="413.75" y="-167.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge9_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.78,-172.07C237.14,-171.9 309.58,-171.63 358.94,-171.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="358.84,-174.95 368.83,-171.41 358.82,-167.95 358.84,-174.95"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node8 -->
-<g id="edge11_Node000009_Node000008" class="edge">
-<title>Node9&#45;&gt;Node8</title>
-<g id="a_edge11_Node000009_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M298.65,-106.24C303.19,-108.93 307.9,-112 312,-115.25 330.22,-129.71 328.07,-141.25 348,-153.25 351.61,-155.42 355.49,-157.34 359.5,-159.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="358.26,-162.31 368.86,-162.48 360.68,-155.74 358.26,-162.31"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node5 -->
-<g id="edge13_Node000010_Node000005" class="edge">
-<title>Node10&#45;&gt;Node5</title>
-<g id="a_edge13_Node000010_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M157.54,-100.61C178.68,-106.54 217.03,-117.29 244.68,-125.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.4,-128.32 253.98,-127.65 245.29,-121.58 243.4,-128.32"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node9 -->
-<g id="edge14_Node000010_Node000009" class="edge">
-<title>Node10&#45;&gt;Node9</title>
-<g id="a_edge14_Node000010_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M157.54,-96.25C175.95,-96.25 207.41,-96.25 233.49,-96.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.14,-99.75 243.14,-96.25 233.14,-92.75 233.14,-99.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/da6/eratosthenes_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d7/da6/eratosthenes_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
deleted file mode 100644
index 8b95e4e6d..000000000
--- a/d7/da6/eratosthenes_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
+++ /dev/null
@@ -1,229 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="488pt" height="266pt"
- viewBox="0.00 0.00 487.50 265.88" 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 261.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-143.88 0,-143.88 0,-124.62 37,-124.62 37,-143.88"/>
-<text text-anchor="middle" x="18.5" y="-130.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="205.62,-257.88 76.38,-257.88 76.38,-238.62 205.62,-238.62 205.62,-257.88"/>
-<text text-anchor="middle" x="141" y="-244.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::duration_cast</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.81,-144.15C29.44,-162.53 46.07,-202.06 73,-224.25 77.42,-227.89 82.43,-231 87.67,-233.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.01,-236.74 96.57,-237.58 88.84,-230.34 86.01,-236.74"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-219.88 251.75,-219.88 251.75,-200.62 305.25,-200.62 305.25,-219.88"/>
-<text text-anchor="middle" x="278.5" y="-206.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.33,-143.94C33.91,-157.23 51.3,-180.64 73,-191.25 126.58,-217.45 197.45,-217.53 240.14,-214.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="240.21,-217.93 249.89,-213.62 239.63,-210.96 240.21,-217.93"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209,-30.5 73,-30.5 73,0 209,0 209,-30.5"/>
-<text text-anchor="start" x="81" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::high_resolution</text>
-<text text-anchor="middle" x="141" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.05,-124.23C29.98,-105.99 46.93,-67.18 73,-44.25 76.28,-41.37 79.89,-38.73 83.68,-36.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.09,-39.56 92.08,-31.6 81.65,-33.46 85.09,-39.56"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="301.12,-143.88 255.88,-143.88 255.88,-124.62 301.12,-124.62 301.12,-143.88"/>
-<text text-anchor="middle" x="278.5" y="-130.38" font-family="Helvetica,sans-Serif" font-size="10.00">primes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-134.25C79.98,-134.25 189.23,-134.25 244.47,-134.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.19,-137.75 254.19,-134.25 244.19,-130.75 244.19,-137.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4" target="_top" xlink:title="Prints all the indexes of true values in the passed std::vector.">
-<polygon fill="white" stroke="#666666" points="189.5,-181.88 92.5,-181.88 92.5,-162.62 189.5,-162.62 189.5,-181.88"/>
-<text text-anchor="middle" x="141" y="-168.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::print_primes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.28,-139.86C53.04,-144.83 76.69,-152.28 97.32,-158.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.06,-162.06 106.65,-161.73 98.17,-155.39 96.06,-162.06"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f" target="_top" xlink:title="Performs the sieve.">
-<polygon fill="white" stroke="#666666" points="312,-105.88 245,-105.88 245,-86.62 312,-86.62 312,-105.88"/>
-<text text-anchor="middle" x="278.5" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::sieve</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge10_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge10_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.2,-124.27C33.63,-110.66 50.83,-86.85 73,-77.25 127.85,-53.51 198.55,-69 240.83,-82.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.68,-85.84 250.27,-85.69 241.9,-79.2 239.68,-85.84"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;tests the sieve function for major inconsistencies.">
-<polygon fill="white" stroke="#666666" points="157.25,-105.88 124.75,-105.88 124.75,-86.62 157.25,-86.62 157.25,-105.88"/>
-<text text-anchor="middle" x="141" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge12_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge12_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.28,-128.64C57.44,-122.28 90.51,-111.86 113.67,-104.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="114.52,-107.96 123,-101.61 112.41,-101.28 114.52,-107.96"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="479.5,-143.88 348,-143.88 348,-124.62 479.5,-124.62 479.5,-143.88"/>
-<text text-anchor="middle" x="413.75" y="-130.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M301.5,-134.25C311.34,-134.25 323.57,-134.25 336.29,-134.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.04,-137.75 346.04,-134.25 336.04,-130.75 336.04,-137.75"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge7_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge7_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.96,-182.33C197.22,-187.74 220.93,-194.39 240.38,-199.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.23,-203.15 249.81,-202.48 241.12,-196.41 239.23,-203.15"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge8_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge8_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.96,-162.17C198.63,-156.37 224.42,-149.14 244.56,-143.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="245.26,-146.93 253.94,-140.86 243.37,-140.19 245.26,-146.93"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="457,-180.88 370.5,-180.88 370.5,-161.62 457,-161.62 457,-180.88"/>
-<text text-anchor="middle" x="413.75" y="-167.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge9_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.78,-172.07C237.14,-171.9 309.58,-171.63 358.94,-171.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="358.84,-174.95 368.83,-171.41 358.82,-167.95 358.84,-174.95"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node8 -->
-<g id="edge11_Node000009_Node000008" class="edge">
-<title>Node9&#45;&gt;Node8</title>
-<g id="a_edge11_Node000009_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M298.65,-106.24C303.19,-108.93 307.9,-112 312,-115.25 330.22,-129.71 328.07,-141.25 348,-153.25 351.61,-155.42 355.49,-157.34 359.5,-159.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="358.26,-162.31 368.86,-162.48 360.68,-155.74 358.26,-162.31"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node5 -->
-<g id="edge13_Node000010_Node000005" class="edge">
-<title>Node10&#45;&gt;Node5</title>
-<g id="a_edge13_Node000010_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M157.54,-100.61C178.68,-106.54 217.03,-117.29 244.68,-125.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.4,-128.32 253.98,-127.65 245.29,-121.58 243.4,-128.32"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node9 -->
-<g id="edge14_Node000010_Node000009" class="edge">
-<title>Node10&#45;&gt;Node9</title>
-<g id="a_edge14_Node000010_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M157.54,-96.25C175.95,-96.25 207.41,-96.25 233.49,-96.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.14,-99.75 243.14,-96.25 233.14,-92.75 233.14,-99.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/da6/eratosthenes_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d7/da6/eratosthenes_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index a2d5f902a..000000000
--- a/d7/da6/eratosthenes_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;tests the sieve function for major inconsistencies." alt="" coords="5,31,49,56"/>
-<area shape="rect" id="Node000002" href="$de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a" title=" " alt="" coords="111,5,172,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,36,95,26,96,31,49,41"/>
-<area shape="rect" id="Node000004" href="$dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f" title="Performs the sieve." alt="" coords="97,55,186,80"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,45,82,52,81,57,48,51"/>
-<area shape="rect" id="Node000003" 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="234,5,409,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="172,16,218,16,218,21,172,21"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="264,55,379,80"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="187,65,249,65,249,70,187,70"/>
-</map>
diff --git a/d7/da6/eratosthenes_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d7/da6/eratosthenes_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 52e1dd19d..000000000
--- a/d7/da6/eratosthenes_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3d9aaa3d42aa82072aacd423e4b1e880
\ No newline at end of file
diff --git a/d7/da6/eratosthenes_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d7/da6/eratosthenes_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 773de2bb5..000000000
--- a/d7/da6/eratosthenes_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="311pt" height="64pt"
- viewBox="0.00 0.00 311.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;tests the sieve function for major inconsistencies.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="124.62,-56.25 79.38,-56.25 79.38,-37 124.62,-37 124.62,-56.25"/>
-<text text-anchor="middle" x="102" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">primes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.61,-31.11C42.49,-33.35 55.71,-36.35 67.89,-39.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.11,-42.53 77.64,-41.32 68.66,-35.7 67.11,-42.53"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f" target="_top" xlink:title="Performs the sieve.">
-<polygon fill="white" stroke="#666666" points="135.5,-19.25 68.5,-19.25 68.5,0 135.5,0 135.5,-19.25"/>
-<text text-anchor="middle" x="102" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sieve</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.61,-24.32C39.58,-22.82 48.22,-20.97 56.99,-19.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.52,-22.55 66.56,-17.03 56.05,-15.71 57.52,-22.55"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="303,-56.25 171.5,-56.25 171.5,-37 303,-37 303,-56.25"/>
-<text text-anchor="middle" x="237.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125,-46.62C134.84,-46.62 147.07,-46.62 159.79,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.54,-50.13 169.54,-46.63 159.54,-43.13 159.54,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="280.5,-19.25 194,-19.25 194,0 280.5,0 280.5,-19.25"/>
-<text text-anchor="middle" x="237.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.94,-9.62C149.95,-9.62 166.67,-9.62 182.4,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.11,-13.13 192.11,-9.63 182.11,-6.13 182.11,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/da6/eratosthenes_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d7/da6/eratosthenes_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 36f78f4b5..000000000
--- a/d7/da6/eratosthenes_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="311pt" height="64pt"
- viewBox="0.00 0.00 311.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;tests the sieve function for major inconsistencies.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="124.62,-56.25 79.38,-56.25 79.38,-37 124.62,-37 124.62,-56.25"/>
-<text text-anchor="middle" x="102" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">primes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.61,-31.11C42.49,-33.35 55.71,-36.35 67.89,-39.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.11,-42.53 77.64,-41.32 68.66,-35.7 67.11,-42.53"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f" target="_top" xlink:title="Performs the sieve.">
-<polygon fill="white" stroke="#666666" points="135.5,-19.25 68.5,-19.25 68.5,0 135.5,0 135.5,-19.25"/>
-<text text-anchor="middle" x="102" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sieve</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.61,-24.32C39.58,-22.82 48.22,-20.97 56.99,-19.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.52,-22.55 66.56,-17.03 56.05,-15.71 57.52,-22.55"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="303,-56.25 171.5,-56.25 171.5,-37 303,-37 303,-56.25"/>
-<text text-anchor="middle" x="237.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125,-46.62C134.84,-46.62 147.07,-46.62 159.79,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.54,-50.13 169.54,-46.63 159.54,-43.13 159.54,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="280.5,-19.25 194,-19.25 194,0 280.5,0 280.5,-19.25"/>
-<text text-anchor="middle" x="237.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.94,-9.62C149.95,-9.62 166.67,-9.62 182.4,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.11,-13.13 192.11,-9.63 182.11,-6.13 182.11,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/da6/eratosthenes_8cpp_source.html b/d7/da6/eratosthenes_8cpp_source.html
new file mode 100644
index 000000000..ad97d056e
--- /dev/null
+++ b/d7/da6/eratosthenes_8cpp_source.html
@@ -0,0 +1,230 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/eratosthenes.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/da6/eratosthenes_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">eratosthenes.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d7/da6/eratosthenes_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;chrono&gt;</span>    </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;string&gt;</span>    </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="foldopen" id="foldopen00033" data-start="{" data-end="}">
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f">   33</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f">sieve</a>(std::vector&lt;bool&gt; *vec) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    (*vec)[0] = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    (*vec)[1] = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="comment">// The sieve sets values to false as they are found not prime</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">for</span> (uint64_t n = 2; n &lt; vec-&gt;size(); n++) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        <span class="keywordflow">for</span> (uint64_t multiple = n &lt;&lt; 1; multiple &lt; vec-&gt;size();</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>             multiple += n) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>            (*vec)[multiple] = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>}</div>
+</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="foldopen" id="foldopen00051" data-start="{" data-end="}">
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4">   51</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4">print_primes</a>(std::vector&lt;bool&gt; <span class="keyword">const</span> &amp;<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; <a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>.size(); i++) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>[i]) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            std::cout &lt;&lt; i &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>}</div>
+</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="foldopen" id="foldopen00064" data-start="{" data-end="}">
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   64</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keyword">auto</span> <a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a> = std::vector&lt;bool&gt;(10, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <a class="code hl_function" href="../../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f">math::sieve</a>(&amp;<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    assert(<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>[0] == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    assert(<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>[1] == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    assert(<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>[2] == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    assert(<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>[3] == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    assert(<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>[4] == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    assert(<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>[5] == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    assert(<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>[6] == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    assert(<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>[7] == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    assert(<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>[8] == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    assert(<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>[9] == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>}</div>
+</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="foldopen" id="foldopen00087" data-start="{" data-end="}">
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"><a class="line" href="../../d7/da6/eratosthenes_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">   87</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[]) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <a class="code hl_function" href="../../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="comment">// The largest prime we will check for</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keyword">auto</span> max = 10000;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="comment">// Store a boolean for every number which states if that index is prime or</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="comment">// not</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keyword">auto</span> <a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a> = std::vector&lt;bool&gt;(max, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="comment">// Store the algorithm start time</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keyword">auto</span> start = std::chrono::high_resolution_clock::now();</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="comment">// Run the sieve</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <a class="code hl_function" href="../../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f">math::sieve</a>(&amp;<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="comment">// Time difference calculation</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="keyword">auto</span> time = std::chrono::duration_cast&lt;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>                    std::chrono::duration&lt;double, std::ratio&lt;1&gt;&gt;&gt;(</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>                    std::chrono::high_resolution_clock::now() - start)</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>                    .count();</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="comment">// Print the primes if we see that &quot;print&quot; was passed as an arg</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordflow">if</span> (argc &gt; 1 &amp;&amp; argv[1] == std::string(<span class="stringliteral">&quot;print&quot;</span>)) {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        <a class="code hl_function" href="../../dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4">math::print_primes</a>(<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    }</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="comment">// Print the time taken we found earlier</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Time taken: &quot;</span> &lt;&lt; time &lt;&lt; <span class="stringliteral">&quot; seconds&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>}</div>
+</div>
+<div class="ttc" id="aeratosthenes_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-tests the sieve function for major inconsistencies.</div><div class="ttdef"><b>Definition</b> <a href="#l00064">eratosthenes.cpp:64</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_a91366864111e1fac29722ca45e02ea8f"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f">math::sieve</a></div><div class="ttdeci">void sieve(std::vector&lt; bool &gt; *vec)</div><div class="ttdoc">Performs the sieve.</div><div class="ttdef"><b>Definition</b> <a href="#l00033">eratosthenes.cpp:33</a></div></div>
+<div class="ttc" id="anamespacemath_html_ad09d59850865012a6fd95d89954c82e4"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4">math::print_primes</a></div><div class="ttdeci">void print_primes(std::vector&lt; bool &gt; const &amp;primes)</div><div class="ttdoc">Prints all the indexes of true values in the passed std::vector.</div><div class="ttdef"><b>Definition</b> <a href="#l00051">eratosthenes.cpp:51</a></div></div>
+<div class="ttc" id="aprime__numbers_8cpp_html_a9575f3a51eeb8a57d657b3db6a4b441a"><div class="ttname"><a href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a></div><div class="ttdeci">std::vector&lt; int &gt; primes(size_t max)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d9b/prime__numbers_8cpp_source.html#l00012">prime_numbers.cpp:12</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d7/da6/eratosthenes_8cpp.html">eratosthenes.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/dab/get__size__of__linked__list_8cpp_source.html b/d7/dab/get__size__of__linked__list_8cpp_source.html
new file mode 100644
index 000000000..b133b6895
--- /dev/null
+++ b/d7/dab/get__size__of__linked__list_8cpp_source.html
@@ -0,0 +1,191 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: operations_on_datastructures/get_size_of_linked_list.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/dab/get__size__of__linked__list_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">get_size_of_linked_list.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span> </div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="keyword">class </span><a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> {</div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span>    <span class="keywordtype">int</span> val;</div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *next;</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(<span class="keywordtype">int</span> v, <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *n) : val(v), next(n) {}  <span class="comment">// Default constructor for Node</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>};</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="keywordtype">int</span> getSize(<a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *root) {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="keywordflow">if</span> (root == NULL) {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    }</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="comment">// Each node will return 1 so the total adds up to be the size</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <span class="keywordflow">return</span> 1 + getSize(root-&gt;next);</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>}</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment"> * @brief This function dealocates memory related to the given list</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment"> * It recursively deletes all of the nodes of the input list.</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"> * @param room the root/head of the input list</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"> * @warning Plese note that the memory for each node has to be alocated using new.</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keywordtype">void</span> deleteList(<a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *<span class="keyword">const</span> root) {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="keywordflow">if</span> (root != NULL)</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        deleteList(root-&gt;next);</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>        <span class="keyword">delete</span> root;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    }</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>}</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *myList = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(0, NULL);  <span class="comment">// Initializes the LinkedList</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *temp = myList;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="comment">// Creates a linked lists of total size 10, numbered 1 - 10</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; 10; i++) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        temp-&gt;next = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(i, NULL);</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        temp = temp-&gt;next;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    }</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="comment">// Creating other lists for checking purposes</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *secondList = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(0, NULL);  <span class="comment">// List of size 1</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *thirdList = NULL;                <span class="comment">// List of size 0</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    std::cout &lt;&lt; getSize(myList) &lt;&lt; std::endl</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>              &lt;&lt; getSize(secondList) &lt;&lt; std::endl</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>              &lt;&lt; getSize(thirdList) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    deleteList(secondList);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    deleteList(myList);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><b>get_size_of_linked_list.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/dab/structstrings_1_1boyer__moore_1_1pattern-members.html b/d7/dab/structstrings_1_1boyer__moore_1_1pattern-members.html
index 41e50e626..888737f0c 100644
--- a/d7/dab/structstrings_1_1boyer__moore_1_1pattern-members.html
+++ b/d7/dab/structstrings_1_1boyer__moore_1_1pattern-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.map b/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.map
index ce4dc1d03..4abe656ee 100644
--- a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.map
+++ b/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.map
@@ -1,5 +1,5 @@
 <map id="std::is_integral&lt; uint256_t &gt;" name="std::is_integral&lt; uint256_t &gt;">
 <area shape="rect" id="Node000001" title=" " alt="" coords="5,79,189,105"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integral_constant.html" title=" " alt="" coords="46,5,148,31"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="46,5,148,31"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="100,46,100,79,94,79,94,46"/>
 </map>
diff --git a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.md5 b/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.md5
index 788d8c929..1a663bd01 100644
--- a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.md5
+++ b/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.md5
@@ -1 +1 @@
-a5f53b759dc7234205449bd588ef3a2b
\ No newline at end of file
+bbaa537b5da9cdc9be75d53307994ca9
\ No newline at end of file
diff --git a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.svg b/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.svg
index 3bf5a37da..2b19f7128 100644
--- a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.svg
+++ b/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="106.75,-74.5 30.75,-74.5 30.75,-55.25 106.75,-55.25 106.75,-74.5"/>
 <text text-anchor="middle" x="68.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph_org.svg b/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph_org.svg
index 8ccc85c37..714929c92 100644
--- a/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph_org.svg
+++ b/d7/dac/structstd_1_1is__integral_3_01uint256__t_01_4__inherit__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="106.75,-74.5 30.75,-74.5 30.75,-55.25 106.75,-55.25 106.75,-74.5"/>
 <text text-anchor="middle" x="68.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/d7/daf/namespace_knapsack.html b/d7/daf/namespace_knapsack.html
index 85cb23663..b997a0166 100644
--- a/d7/daf/namespace_knapsack.html
+++ b/d7/daf/namespace_knapsack.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Knapsack Namespace Reference</title>
+<title>TheAlgorithms/C++: Knapsack Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.map b/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.map
index 724fd71e7..717df7f41 100644
--- a/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.map
+++ b/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.map
@@ -1,9 +1,9 @@
 <map id="machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;" name="machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;">
 <area shape="rect" id="Node000001" title="A class defining A* search algorithm. for some initial state and final state." alt="" coords="8,346,175,402"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="7,213,176,268"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="7,213,176,268"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="94,284,94,346,89,346,89,284"/>
 <area shape="rect" id="Node000003" href="$da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html" title="Struct that handles all the information related to the current state." alt="" coords="8,94,175,150"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="94,165,94,212,89,212,89,165"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="5,5,178,31"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="5,5,178,31"/>
 <area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="94,47,94,93,89,93,89,47"/>
 </map>
diff --git a/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.md5 b/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.md5
index 58e6f2e95..c9e521a96 100644
--- a/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.md5
+++ b/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.md5
@@ -1 +1 @@
-fbc1114ae4793053772bde7f6f23e019
\ No newline at end of file
+02beabcc096d7e30458add15a675bbb5
\ No newline at end of file
diff --git a/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.svg b/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.svg
index 0b9bf0bfd..f9d43a0e8 100644
--- a/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.svg
+++ b/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph.svg
@@ -33,7 +33,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="128.12,-142 1.12,-142 1.12,-100.25 128.12,-100.25 128.12,-142"/>
 <text text-anchor="start" x="9.12" y="-128.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; machine</text>
 <text text-anchor="start" x="9.12" y="-117.25" font-family="Helvetica,sans-Serif" font-size="10.00">_learning::aystar_search</text>
@@ -76,7 +76,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="129.25,-297.5 0,-297.5 0,-278.25 129.25,-278.25 129.25,-297.5"/>
 <text text-anchor="middle" x="64.62" y="-284" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Puzzle &gt;</text>
 </a>
diff --git a/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph_org.svg b/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph_org.svg
index 579445e5d..d284877cd 100644
--- a/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph_org.svg
+++ b/d7/db3/classmachine__learning_1_1aystar__search_1_1_ay_star_search__coll__graph_org.svg
@@ -22,7 +22,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="128.12,-142 1.12,-142 1.12,-100.25 128.12,-100.25 128.12,-142"/>
 <text text-anchor="start" x="9.12" y="-128.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; machine</text>
 <text text-anchor="start" x="9.12" y="-117.25" font-family="Helvetica,sans-Serif" font-size="10.00">_learning::aystar_search</text>
@@ -65,7 +65,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="129.25,-297.5 0,-297.5 0,-278.25 129.25,-278.25 129.25,-297.5"/>
 <text text-anchor="middle" x="64.62" y="-284" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Puzzle &gt;</text>
 </a>
diff --git a/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.map b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.map
index a4954784b..a8c0c69d5 100644
--- a/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.map
+++ b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.map
@@ -1,10 +1,8 @@
 <map id="data_structures::tree_234::Node" name="data_structures::tree_234::Node">
-<area shape="rect" id="Node000001" title="2&#45;3&#45;4 tree node class" alt="" coords="24,183,165,223"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array.html" title=" " alt="" coords="5,286,184,327"/>
-<area shape="poly" id="edge4_Node000004_Node000001" title=" " alt="" coords="57,236,49,248,48,258,50,267,65,284,61,287,46,269,42,258,44,246,53,233"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array.html" title=" " alt="" coords="17,94,172,120"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="97,135,97,182,92,182,92,135"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="51,5,138,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="97,47,97,94,92,94,92,47"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="105,272,107,248,100,224,105,223,112,247,110,272"/>
+<area shape="rect" id="Node000001" title="2&#45;3&#45;4 tree node class" alt="" coords="24,94,165,135"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="5,198,184,238"/>
+<area shape="poly" id="edge3_Node000003_Node000001" title=" " alt="" coords="57,147,49,160,48,169,50,178,65,195,61,199,46,181,42,169,44,158,53,144"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="17,5,172,31"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="97,46,97,93,92,93,92,46"/>
+<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="105,183,107,159,100,136,105,134,112,158,110,183"/>
 </map>
diff --git a/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.md5 b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.md5
index 0e3ef8957..eb067f618 100644
--- a/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.md5
+++ b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.md5
@@ -1 +1 @@
-d0ab57a73452a09fda8981f4f2bb2970
\ No newline at end of file
+165ca197ca187bd3ce3e5b49d9086dd5
\ No newline at end of file
diff --git a/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.svg b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.svg
index 2b701de95..aa8082a8b 100644
--- a/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.svg
+++ b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.svg
@@ -4,8 +4,8 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: data_structures::tree_234::Node Pages: 1 -->
-<svg width="142pt" height="249pt"
- viewBox="0.00 0.00 141.75 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="142pt" height="183pt"
+ viewBox="0.00 0.00 141.75 182.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
 <svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
@@ -17,7 +17,7 @@
 ]]></style>
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
 <svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 178.75)">
 <title>data_structures::tree_234::Node</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -29,20 +29,20 @@
 </a>
 </g>
 </g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<!-- Node3 -->
+<g id="Node000003" class="node">
+<title>Node3</title>
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="133.75,-30.5 0,-30.5 0,0 133.75,0 133.75,-30.5"/>
 <text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; data_structures</text>
 <text text-anchor="middle" x="66.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::tree_234::Node *, 4 &gt;</text>
 </a>
 </g>
 </g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000001" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000001"><a xlink:title=" ">
+<!-- Node1&#45;&gt;Node3 -->
+<g id="edge3_Node000003_Node000001" class="edge">
+<title>Node1&#45;&gt;Node3</title>
+<g id="a_edge3_Node000003_Node000001"><a xlink:title=" ">
 <path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M37.17,-69.39C34.75,-66.41 32.65,-63.19 31.12,-59.75 26.36,-49.03 33.92,-38.8 43.29,-30.96"/>
 <polygon fill="#9a32cd" stroke="#9a32cd" points="34.59,-71.77 44.07,-76.49 39.61,-66.88 34.59,-71.77"/>
 </a>
@@ -52,7 +52,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="124.75,-174.75 9,-174.75 9,-155.5 124.75,-155.5 124.75,-174.75"/>
 <text text-anchor="middle" x="66.88" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; int64_t, 3 &gt;</text>
 </a>
@@ -68,29 +68,10 @@
 </g>
 <text text-anchor="middle" x="80.38" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> items</text>
 </g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="99.25,-241.25 34.5,-241.25 34.5,-222 99.25,-222 99.25,-241.25"/>
-<text text-anchor="middle" x="66.88" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::int64_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M66.88,-210.15C66.88,-198.32 66.88,-184.04 66.88,-175.02"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="63.38,-210.14 66.88,-220.14 70.38,-210.14 63.38,-210.14"/>
-</a>
-</g>
-<text text-anchor="middle" x="88.25" y="-194.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
-<!-- Node4&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node4&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
+<!-- Node3&#45;&gt;Node1 -->
+<g id="edge2_Node000001_Node000003" class="edge">
+<title>Node3&#45;&gt;Node1</title>
+<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
 <path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M76.88,-41.4C78.24,-47.38 78.87,-53.76 77.88,-59.75 76.89,-65.7 74.94,-72.03 72.96,-77.49"/>
 <polygon fill="#9a32cd" stroke="#9a32cd" points="80.3,-40.62 74.04,-32.07 73.6,-42.66 80.3,-40.62"/>
 </a>
diff --git a/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph_org.svg b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph_org.svg
index a652e954e..7e7846877 100644
--- a/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph_org.svg
+++ b/d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph_org.svg
@@ -4,9 +4,9 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: data_structures::tree_234::Node Pages: 1 -->
-<svg width="142pt" height="249pt"
- viewBox="0.00 0.00 141.75 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
+<svg width="142pt" height="183pt"
+ viewBox="0.00 0.00 141.75 182.75" 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 178.75)">
 <title>data_structures::tree_234::Node</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -18,20 +18,20 @@
 </a>
 </g>
 </g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<!-- Node3 -->
+<g id="Node000003" class="node">
+<title>Node3</title>
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="133.75,-30.5 0,-30.5 0,0 133.75,0 133.75,-30.5"/>
 <text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; data_structures</text>
 <text text-anchor="middle" x="66.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::tree_234::Node *, 4 &gt;</text>
 </a>
 </g>
 </g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000001" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000001"><a xlink:title=" ">
+<!-- Node1&#45;&gt;Node3 -->
+<g id="edge3_Node000003_Node000001" class="edge">
+<title>Node1&#45;&gt;Node3</title>
+<g id="a_edge3_Node000003_Node000001"><a xlink:title=" ">
 <path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M37.17,-69.39C34.75,-66.41 32.65,-63.19 31.12,-59.75 26.36,-49.03 33.92,-38.8 43.29,-30.96"/>
 <polygon fill="#9a32cd" stroke="#9a32cd" points="34.59,-71.77 44.07,-76.49 39.61,-66.88 34.59,-71.77"/>
 </a>
@@ -41,7 +41,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="124.75,-174.75 9,-174.75 9,-155.5 124.75,-155.5 124.75,-174.75"/>
 <text text-anchor="middle" x="66.88" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; int64_t, 3 &gt;</text>
 </a>
@@ -57,29 +57,10 @@
 </g>
 <text text-anchor="middle" x="80.38" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> items</text>
 </g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="99.25,-241.25 34.5,-241.25 34.5,-222 99.25,-222 99.25,-241.25"/>
-<text text-anchor="middle" x="66.88" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::int64_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M66.88,-210.15C66.88,-198.32 66.88,-184.04 66.88,-175.02"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="63.38,-210.14 66.88,-220.14 70.38,-210.14 63.38,-210.14"/>
-</a>
-</g>
-<text text-anchor="middle" x="88.25" y="-194.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
-<!-- Node4&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node4&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
+<!-- Node3&#45;&gt;Node1 -->
+<g id="edge2_Node000001_Node000003" class="edge">
+<title>Node3&#45;&gt;Node1</title>
+<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
 <path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M76.88,-41.4C78.24,-47.38 78.87,-53.76 77.88,-59.75 76.89,-65.7 74.94,-72.03 72.96,-77.49"/>
 <polygon fill="#9a32cd" stroke="#9a32cd" points="80.3,-40.62 74.04,-32.07 73.6,-42.66 80.3,-40.62"/>
 </a>
diff --git a/d7/db9/hill__cipher_8cpp.html b/d7/db9/hill__cipher_8cpp.html
index 1d05b142e..42a0e2a3a 100644
--- a/d7/db9/hill__cipher_8cpp.html
+++ b/d7/db9/hill__cipher_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ciphers/hill_cipher.cpp File Reference</title>
+<title>TheAlgorithms/C++: ciphers/hill_cipher.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -130,7 +147,9 @@ Include dependency graph for hill_cipher.cpp:</div>
 <div class="dyncontent">
 <div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d3/d1a/hill__cipher_8cpp__incl.svg" width="100%" height="449"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
 </div>
-</div><table class="memberdecls">
+</div>
+<p><a href="../../d7/db9/hill__cipher_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d26/classciphers_1_1_hill_cipher.html">ciphers::HillCipher</a></td></tr>
@@ -146,12 +165,12 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a34bfcd756610834acac501f9eea1e2eb" id="r_a34bfcd756610834acac501f9eea1e2eb"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a34bfcd756610834acac501f9eea1e2eb"><td class="memTemplItemLeft" align="right" valign="top">static <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a34bfcd756610834acac501f9eea1e2eb">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; T &gt; const &amp;v)</td></tr>
+<tr class="memitem:a34bfcd756610834acac501f9eea1e2eb"><td class="memTemplItemLeft" align="right" valign="top">static std::ostream &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a34bfcd756610834acac501f9eea1e2eb">operator&lt;&lt;</a> (std::ostream &amp;out, <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; T &gt; const &amp;v)</td></tr>
 <tr class="separator:a34bfcd756610834acac501f9eea1e2eb"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a3147ad576f8a94a2a6b66948672b452b" id="r_a3147ad576f8a94a2a6b66948672b452b"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3147ad576f8a94a2a6b66948672b452b">test1</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text)</td></tr>
+<tr class="memitem:a3147ad576f8a94a2a6b66948672b452b" id="r_a3147ad576f8a94a2a6b66948672b452b"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3147ad576f8a94a2a6b66948672b452b">test1</a> (const std::string &amp;text)</td></tr>
 <tr class="memdesc:a3147ad576f8a94a2a6b66948672b452b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self test 1 - using 3x3 randomly generated key.  <br /></td></tr>
 <tr class="separator:a3147ad576f8a94a2a6b66948672b452b"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a04391124480d2a49f2dec900237b0712" id="r_a04391124480d2a49f2dec900237b0712"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a04391124480d2a49f2dec900237b0712">test2</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text)</td></tr>
+<tr class="memitem:a04391124480d2a49f2dec900237b0712" id="r_a04391124480d2a49f2dec900237b0712"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a04391124480d2a49f2dec900237b0712">test2</a> (const std::string &amp;text)</td></tr>
 <tr class="memdesc:a04391124480d2a49f2dec900237b0712"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self test 2 - using 8x8 randomly generated key.  <br /></td></tr>
 <tr class="separator:a04391124480d2a49f2dec900237b0712"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
@@ -174,6 +193,8 @@ Variables</h2></td></tr>
 The matrix generation algorithm is very rudimentary and does not guarantee an invertible modulus matrix. </dd></dl>
 <dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000001">Todo</a></b></dt><dd>Better matrix generation algorithm.</dd></dl>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -190,32 +211,24 @@ The matrix generation algorithm is very rudimentary and does not guarantee an in
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00533">533</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  533</span>           {</div>
-<div class="line"><span class="lineno">  534</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>));</div>
-<div class="line"><span class="lineno">  535</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Key dictionary: (&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strlen.html">std::strlen</a>(<a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">ciphers::STRKEY</a>) &lt;&lt; <span class="stringliteral">&quot;)\n\t&quot;</span></div>
+<div class="line"><span class="lineno">  534</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><span class="lineno">  535</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Key dictionary: (&quot;</span> &lt;&lt; std::strlen(<a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">ciphers::STRKEY</a>) &lt;&lt; <span class="stringliteral">&quot;)\n\t&quot;</span></div>
 <div class="line"><span class="lineno">  536</span>              &lt;&lt; <a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">ciphers::STRKEY</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  537</span> </div>
-<div class="line"><span class="lineno">  538</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> text = <span class="stringliteral">&quot;This is a simple text with numb3r5 and exclamat!0n.&quot;</span>;</div>
+<div class="line"><span class="lineno">  538</span>    std::string text = <span class="stringliteral">&quot;This is a simple text with numb3r5 and exclamat!0n.&quot;</span>;</div>
 <div class="line"><span class="lineno">  539</span> </div>
 <div class="line"><span class="lineno">  540</span>    <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>(text);</div>
 <div class="line"><span class="lineno">  541</span>    <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>(text);</div>
 <div class="line"><span class="lineno">  542</span> </div>
 <div class="line"><span class="lineno">  543</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  544</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="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:187</div></div>
-<div class="ttc" id="adsu__path__compression_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-test implementations, 1st test.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:170</div></div>
-<div class="ttc" id="anamespaceciphers_html_ab9aec0ccf4b6809f652bb540be87c216"><div class="ttname"><a href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">ciphers::STRKEY</a></div><div class="ttdeci">static const char * STRKEY</div><div class="ttdef"><b>Definition</b> hill_cipher.cpp:74</div></div>
-<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="astrlen_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strlen.html">std::strlen</a></div><div class="ttdeci">T strlen(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="628" height="384"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00187">dsu_path_compression.cpp:187</a></div></div>
+<div class="ttc" id="adsu__path__compression_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-test implementations, 1st test.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00170">dsu_path_compression.cpp:170</a></div></div>
+<div class="ttc" id="anamespaceciphers_html_ab9aec0ccf4b6809f652bb540be87c216"><div class="ttname"><a href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">ciphers::STRKEY</a></div><div class="ttdeci">static const char * STRKEY</div><div class="ttdef"><b>Definition</b> <a href="../../d7/db9/hill__cipher_8cpp_source.html#l00074">hill_cipher.cpp:74</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a34bfcd756610834acac501f9eea1e2eb" name="a34bfcd756610834acac501f9eea1e2eb"></a>
@@ -230,9 +243,9 @@ template&lt;typename T &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname">static <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; operator&lt;&lt; </td>
+          <td class="memname">static std::ostream &amp; operator&lt;&lt; </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
+          <td class="paramtype">std::ostream &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -247,30 +260,22 @@ template&lt;typename T &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>operator to print a matrix </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   55</span>                                                                   {</div>
 <div class="line"><span class="lineno">   56</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> width = 15;</div>
 <div class="line"><span class="lineno">   57</span>    <span class="keyword">const</span> <span class="keywordtype">char</span> separator = <span class="charliteral">&#39; &#39;</span>;</div>
 <div class="line"><span class="lineno">   58</span> </div>
-<div class="line"><span class="lineno">   59</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; v.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); row++) {</div>
-<div class="line"><span class="lineno">   60</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; v[row].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); col++)</div>
-<div class="line"><span class="lineno">   61</span>            out &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::left</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(width) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">std::setfill</a>(separator)</div>
+<div class="line"><span class="lineno">   59</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; v.size(); row++) {</div>
+<div class="line"><span class="lineno">   60</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; v[row].size(); col++)</div>
+<div class="line"><span class="lineno">   61</span>            out &lt;&lt; std::left &lt;&lt; std::setw(width) &lt;&lt; std::setfill(separator)</div>
 <div class="line"><span class="lineno">   62</span>                &lt;&lt; v[row][col];</div>
-<div class="line"><span class="lineno">   63</span>        out &lt;&lt; <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">   63</span>        out &lt;&lt; std::endl;</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="keywordflow">return</span> out;</div>
 <div class="line"><span class="lineno">   67</span>}</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="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::left</a></div><div class="ttdeci">T left(T... args)</div></div>
-<div class="ttc" id="asetfill_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">std::setfill</a></div><div class="ttdeci">T setfill(T... args)</div></div>
-<div class="ttc" id="asetw_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a></div><div class="ttdeci">T setw(T... args)</div></div>
-<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><!-- 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="../../d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.svg" width="259" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a3147ad576f8a94a2a6b66948672b452b" name="a3147ad576f8a94a2a6b66948672b452b"></a>
@@ -282,7 +287,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void test1 </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -295,47 +300,42 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00471">471</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  471</span>                                  {</div>
 <div class="line"><span class="lineno">  472</span>    <span class="comment">// std::string text = &quot;Hello world!&quot;;</span></div>
-<div class="line"><span class="lineno">  473</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;======Test 1 (3x3 key) ======\nOriginal text:\n\t&quot;</span> &lt;&lt; text</div>
-<div class="line"><span class="lineno">  474</span>              &lt;&lt; <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">  473</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;======Test 1 (3x3 key) ======\nOriginal text:\n\t&quot;</span> &lt;&lt; text</div>
+<div class="line"><span class="lineno">  474</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  475</span> </div>
-<div class="line"><span class="lineno">  476</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;matrix&lt;int&gt;</a>, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;int&gt;</a>&gt; p =</div>
+<div class="line"><span class="lineno">  476</span>    std::pair&lt;matrix&lt;int&gt;, <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a>&gt; p =</div>
 <div class="line"><span class="lineno">  477</span>        <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5">ciphers::HillCipher::generate_keys</a>(3, 0, 100);</div>
-<div class="line"><span class="lineno">  478</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;int&gt;</a> ekey = p.first;</div>
-<div class="line"><span class="lineno">  479</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;int&gt;</a> dkey = p.second;</div>
+<div class="line"><span class="lineno">  478</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> ekey = p.first;</div>
+<div class="line"><span class="lineno">  479</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> dkey = p.second;</div>
 <div class="line"><span class="lineno">  480</span> </div>
 <div class="line"><span class="lineno">  481</span>    <span class="comment">// matrix&lt;int&gt; ekey = {{22, 28, 25}, {5, 26, 15}, {14, 18, 9}};</span></div>
 <div class="line"><span class="lineno">  482</span>    <span class="comment">// std::cout &lt;&lt; &quot;Encryption key: \n&quot; &lt;&lt; ekey;</span></div>
-<div class="line"><span class="lineno">  483</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> gibberish = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917">ciphers::HillCipher::encrypt_text</a>(text, ekey);</div>
-<div class="line"><span class="lineno">  484</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Encrypted text:\n\t&quot;</span> &lt;&lt; gibberish &lt;&lt; <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">  483</span>    std::string gibberish = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917">ciphers::HillCipher::encrypt_text</a>(text, ekey);</div>
+<div class="line"><span class="lineno">  484</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Encrypted text:\n\t&quot;</span> &lt;&lt; gibberish &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  485</span> </div>
 <div class="line"><span class="lineno">  486</span>    <span class="comment">// matrix&lt;int&gt; dkey = ciphers::HillCipher::generate_decryption_key(ekey);</span></div>
 <div class="line"><span class="lineno">  487</span>    <span class="comment">// std::cout &lt;&lt; &quot;Decryption key: \n&quot; &lt;&lt; dkey;</span></div>
-<div class="line"><span class="lineno">  488</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> txt_back = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b">ciphers::HillCipher::decrypt_text</a>(gibberish, dkey);</div>
-<div class="line"><span class="lineno">  489</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Reconstruct text:\n\t&quot;</span> &lt;&lt; txt_back &lt;&lt; <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">  488</span>    std::string txt_back = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b">ciphers::HillCipher::decrypt_text</a>(gibberish, dkey);</div>
+<div class="line"><span class="lineno">  489</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Reconstruct text:\n\t&quot;</span> &lt;&lt; txt_back &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  490</span> </div>
-<div class="line"><span class="lineno">  491</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a> out_file(<span class="stringliteral">&quot;hill_cipher_test1.txt&quot;</span>);</div>
-<div class="line"><span class="lineno">  492</span>    out_file &lt;&lt; <span class="stringliteral">&quot;Block size: &quot;</span> &lt;&lt; ekey.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  491</span>    std::ofstream out_file(<span class="stringliteral">&quot;hill_cipher_test1.txt&quot;</span>);</div>
+<div class="line"><span class="lineno">  492</span>    out_file &lt;&lt; <span class="stringliteral">&quot;Block size: &quot;</span> &lt;&lt; ekey.size() &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  493</span>    out_file &lt;&lt; <span class="stringliteral">&quot;Encryption Key:\n&quot;</span> &lt;&lt; ekey;</div>
 <div class="line"><span class="lineno">  494</span>    out_file &lt;&lt; <span class="stringliteral">&quot;\nDecryption Key:\n&quot;</span> &lt;&lt; dkey;</div>
 <div class="line"><span class="lineno">  495</span>    out_file.close();</div>
 <div class="line"><span class="lineno">  496</span> </div>
 <div class="line"><span class="lineno">  497</span>    assert(txt_back == text);</div>
-<div class="line"><span class="lineno">  498</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed :)\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  498</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed :)\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  499</span>}</div>
-<div class="ttc" id="abasic_ofstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a></div></div>
-<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a405b0a28d66a61239d3565d5256f9cb5"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5">ciphers::HillCipher::generate_keys</a></div><div class="ttdeci">static std::pair&lt; matrix&lt; int &gt;, matrix&lt; int &gt; &gt; generate_keys(size_t size, int limit1=0, int limit2=10)</div><div class="ttdoc">Generate encryption and decryption key pair.</div><div class="ttdef"><b>Definition</b> hill_cipher.cpp:425</div></div>
-<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a427acfac1dbff3f48a2b071d449d965b"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b">ciphers::HillCipher::decrypt_text</a></div><div class="ttdeci">static const std::string decrypt_text(const std::string &amp;text, const matrix&lt; int &gt; &amp;decrypt_key)</div><div class="ttdoc">Decrypt a given text using a given key.</div><div class="ttdef"><b>Definition</b> hill_cipher.cpp:458</div></div>
-<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_aa8bbb6e4a5749f6008b06602d5103917"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917">ciphers::HillCipher::encrypt_text</a></div><div class="ttdeci">static const std::string encrypt_text(const std::string &amp;text, const matrix&lt; int &gt; &amp;encrypt_key)</div><div class="ttdoc">Encrypt a given text using a given key.</div><div class="ttdef"><b>Definition</b> hill_cipher.cpp:446</div></div>
-<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></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>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a405b0a28d66a61239d3565d5256f9cb5"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5">ciphers::HillCipher::generate_keys</a></div><div class="ttdeci">static std::pair&lt; matrix&lt; int &gt;, matrix&lt; int &gt; &gt; generate_keys(size_t size, int limit1=0, int limit2=10)</div><div class="ttdoc">Generate encryption and decryption key pair.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/db9/hill__cipher_8cpp_source.html#l00425">hill_cipher.cpp:425</a></div></div>
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a427acfac1dbff3f48a2b071d449d965b"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b">ciphers::HillCipher::decrypt_text</a></div><div class="ttdeci">static const std::string decrypt_text(const std::string &amp;text, const matrix&lt; int &gt; &amp;decrypt_key)</div><div class="ttdoc">Decrypt a given text using a given key.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/db9/hill__cipher_8cpp_source.html#l00458">hill_cipher.cpp:458</a></div></div>
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_aa8bbb6e4a5749f6008b06602d5103917"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917">ciphers::HillCipher::encrypt_text</a></div><div class="ttdeci">static const std::string encrypt_text(const std::string &amp;text, const matrix&lt; int &gt; &amp;encrypt_key)</div><div class="ttdoc">Encrypt a given text using a given key.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/db9/hill__cipher_8cpp_source.html#l00446">hill_cipher.cpp:446</a></div></div>
+<div class="ttc" id="alu__decomposition_8h_html_ac029b636b353cefbb18b2fcc71e427e4"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; matrix</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbe/lu__decomposition_8h_source.html#l00019">lu_decomposition.h:19</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a04391124480d2a49f2dec900237b0712" name="a04391124480d2a49f2dec900237b0712"></a>
@@ -347,7 +347,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void test2 </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -360,38 +360,34 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html#l00506">506</a> of file <a class="el" href="../../d7/db9/hill__cipher_8cpp_source.html">hill_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  506</span>                                  {</div>
 <div class="line"><span class="lineno">  507</span>    <span class="comment">// std::string text = &quot;Hello world!&quot;;</span></div>
-<div class="line"><span class="lineno">  508</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;======Test 2 (8x8 key) ======\nOriginal text:\n\t&quot;</span> &lt;&lt; text</div>
-<div class="line"><span class="lineno">  509</span>              &lt;&lt; <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">  508</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;======Test 2 (8x8 key) ======\nOriginal text:\n\t&quot;</span> &lt;&lt; text</div>
+<div class="line"><span class="lineno">  509</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  510</span> </div>
-<div class="line"><span class="lineno">  511</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;matrix&lt;int&gt;</a>, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;int&gt;</a>&gt; p =</div>
+<div class="line"><span class="lineno">  511</span>    std::pair&lt;matrix&lt;int&gt;, <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a>&gt; p =</div>
 <div class="line"><span class="lineno">  512</span>        <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5">ciphers::HillCipher::generate_keys</a>(8, 0, 3);</div>
-<div class="line"><span class="lineno">  513</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;int&gt;</a> ekey = p.first;</div>
-<div class="line"><span class="lineno">  514</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;int&gt;</a> dkey = p.second;</div>
+<div class="line"><span class="lineno">  513</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> ekey = p.first;</div>
+<div class="line"><span class="lineno">  514</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> dkey = p.second;</div>
 <div class="line"><span class="lineno">  515</span> </div>
-<div class="line"><span class="lineno">  516</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> gibberish = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917">ciphers::HillCipher::encrypt_text</a>(text, ekey);</div>
-<div class="line"><span class="lineno">  517</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Encrypted text:\n\t&quot;</span> &lt;&lt; gibberish &lt;&lt; <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">  516</span>    std::string gibberish = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917">ciphers::HillCipher::encrypt_text</a>(text, ekey);</div>
+<div class="line"><span class="lineno">  517</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Encrypted text:\n\t&quot;</span> &lt;&lt; gibberish &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  518</span> </div>
-<div class="line"><span class="lineno">  519</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> txt_back = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b">ciphers::HillCipher::decrypt_text</a>(gibberish, dkey);</div>
-<div class="line"><span class="lineno">  520</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Reconstruct text:\n\t&quot;</span> &lt;&lt; txt_back &lt;&lt; <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">  519</span>    std::string txt_back = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b">ciphers::HillCipher::decrypt_text</a>(gibberish, dkey);</div>
+<div class="line"><span class="lineno">  520</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Reconstruct text:\n\t&quot;</span> &lt;&lt; txt_back &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  521</span> </div>
-<div class="line"><span class="lineno">  522</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a> out_file(<span class="stringliteral">&quot;hill_cipher_test2.txt&quot;</span>);</div>
-<div class="line"><span class="lineno">  523</span>    out_file &lt;&lt; <span class="stringliteral">&quot;Block size: &quot;</span> &lt;&lt; ekey.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  522</span>    std::ofstream out_file(<span class="stringliteral">&quot;hill_cipher_test2.txt&quot;</span>);</div>
+<div class="line"><span class="lineno">  523</span>    out_file &lt;&lt; <span class="stringliteral">&quot;Block size: &quot;</span> &lt;&lt; ekey.size() &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  524</span>    out_file &lt;&lt; <span class="stringliteral">&quot;Encryption Key:\n&quot;</span> &lt;&lt; ekey;</div>
 <div class="line"><span class="lineno">  525</span>    out_file &lt;&lt; <span class="stringliteral">&quot;\nDecryption Key:\n&quot;</span> &lt;&lt; dkey;</div>
 <div class="line"><span class="lineno">  526</span>    out_file.close();</div>
 <div class="line"><span class="lineno">  527</span> </div>
-<div class="line"><span class="lineno">  528</span>    assert(txt_back.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html">compare</a>(0, text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>(), text) == 0);</div>
-<div class="line"><span class="lineno">  529</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed :)\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  528</span>    assert(txt_back.compare(0, text.size(), text) == 0);</div>
+<div class="line"><span class="lineno">  529</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed :)\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  530</span>}</div>
-<div class="ttc" id="acompare_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html">std::string::compare</a></div><div class="ttdeci">T compare(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph.map b/d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph.map
deleted file mode 100644
index cfefd77ec..000000000
--- a/d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph.map
+++ /dev/null
@@ -1,66 +0,0 @@
-<map id="test2" name="test2">
-<area shape="rect" id="Node000001" title="Self test 2 &#45; using 8x8 randomly generated key." alt="" coords="5,260,56,286"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="104,5,241,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="29,260,32,218,43,160,64,97,81,67,102,40,104,38,108,42,106,44,85,70,69,99,48,161,38,219,35,260"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/compare.html#" title=" " alt="" coords="104,55,241,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="31,259,38,228,51,185,72,139,102,98,116,86,119,90,106,101,77,142,56,187,43,229,37,260"/>
-<area shape="rect" id="Node000004" href="$d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b" title="Decrypt a given text using a given key." alt="" coords="108,674,236,714"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="37,286,63,390,106,536,157,659,152,661,101,538,58,392,32,287"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="529,917,651,943"/>
-<area shape="poly" id="edge37_Node000001_Node000008" title=" " alt="" coords="35,286,40,373,52,504,73,636,88,688,106,725,147,770,195,809,249,840,305,866,362,886,417,901,514,920,513,925,416,906,360,891,303,871,246,845,192,813,143,774,101,728,83,690,68,637,46,504,34,373,30,286"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="887,421,1002,447"/>
-<area shape="poly" id="edge38_Node000001_Node000010" title=" " alt="" coords="47,257,98,219,177,172,223,150,272,132,323,120,375,116,591,116,666,114,726,115,753,121,781,131,810,147,841,171,866,196,887,226,917,291,935,354,943,405,938,406,929,356,912,293,882,229,862,200,837,175,807,152,779,136,752,126,725,121,665,119,591,121,375,121,324,125,273,137,225,155,179,177,101,224,50,262"/>
-<area shape="rect" id="Node000011" href="$d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917" title="Encrypt a given text using a given key." alt="" coords="108,484,236,525"/>
-<area shape="poly" id="edge12_Node000001_Node000011" title=" " alt="" coords="41,285,68,339,106,407,148,470,144,473,101,410,63,342,36,287"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="742,185,814,211"/>
-<area shape="poly" id="edge14_Node000001_Node000012" title=" " alt="" coords="56,265,243,228,375,207,511,192,590,189,669,192,726,193,726,199,669,197,590,194,512,197,376,212,244,233,57,270"/>
-<area shape="rect" id="Node000013" href="$d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5" title="Generate encryption and decryption key pair." alt="" coords="108,356,236,397"/>
-<area shape="poly" id="edge15_Node000001_Node000013" title=" " alt="" coords="51,284,132,345,129,349,48,288"/>
-<area shape="rect" id="Node000005" href="$d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa" title="Convenience function to perform block cipher operations. The operations are identical for both encryp..." alt="" coords="312,766,440,806"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="220,713,317,757,314,761,218,717"/>
-<area shape="rect" id="Node000006" href="$d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41" title="Get the index of a character in the STRKEY." alt="" coords="526,736,654,777"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="440,775,510,765,511,770,441,780"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="400,805,449,850,513,896,537,908,535,913,510,900,446,854,396,809"/>
-<area shape="rect" id="Node000009" href="$d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590" title="helper function to perform vector multiplication with encryption or decryption matrix" alt="" coords="526,802,654,842"/>
-<area shape="poly" id="edge8_Node000005_Node000009" title=" " alt="" coords="441,794,511,806,510,811,440,800"/>
-<area shape="poly" id="edge11_Node000005_Node000010" title=" " alt="" coords="410,805,457,831,512,852,608,874,650,881,689,883,726,879,762,867,799,845,837,814,855,788,872,750,902,650,923,544,937,462,942,463,929,545,907,651,877,752,860,791,841,817,802,850,764,872,727,884,689,888,649,886,607,879,511,857,454,836,407,809"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/strlen.html#" title=" " alt="" coords="738,716,818,742"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="654,745,723,734,723,740,655,750"/>
-<area shape="poly" id="edge10_Node000009_Node000007" title=" " alt="" coords="641,799,667,786,740,747,743,752,670,791,643,804"/>
-<area shape="poly" id="edge9_Node000009_Node000010" title=" " alt="" coords="655,818,700,813,748,801,796,782,837,752,865,720,888,682,906,642,919,601,934,523,940,462,945,463,940,523,924,602,911,644,893,685,870,723,841,756,798,786,750,806,701,818,655,824"/>
-<area shape="poly" id="edge13_Node000011_Node000005" title=" " alt="" coords="191,524,353,752,349,755,186,527"/>
-<area shape="rect" id="Node000014" href="$d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" title=" " alt="" coords="537,421,643,447"/>
-<area shape="poly" id="edge16_Node000013_Node000014" title=" " alt="" coords="237,394,289,406,412,422,521,429,521,435,412,427,289,411,236,399"/>
-<area shape="rect" id="Node000016" href="$d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706" title="Generate decryption matrix from an encryption matrix key." alt="" coords="289,356,463,397"/>
-<area shape="poly" id="edge20_Node000013_Node000016" title=" " alt="" coords="237,374,273,374,273,380,237,380"/>
-<area shape="rect" id="Node000020" href="$d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e" title="Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid..." alt="" coords="289,579,463,620"/>
-<area shape="poly" id="edge29_Node000013_Node000020" title=" " alt="" coords="195,396,349,566,345,570,191,400"/>
-<area shape="rect" id="Node000026" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="322,307,430,332"/>
-<area shape="poly" id="edge36_Node000013_Node000026" title=" " alt="" coords="236,356,313,334,314,340,237,361"/>
-<area shape="poly" id="edge19_Node000014_Node000010" title=" " alt="" coords="644,444,717,457,778,461,839,457,883,449,884,454,839,462,778,467,716,462,643,450"/>
-<area shape="rect" id="Node000015" href="$d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" title=" " alt="" coords="717,421,839,447"/>
-<area shape="poly" id="edge17_Node000014_Node000015" title=" " alt="" coords="643,432,701,432,701,437,643,437"/>
-<area shape="poly" id="edge18_Node000015_Node000010" title=" " alt="" coords="839,432,871,432,871,437,839,437"/>
-<area shape="poly" id="edge28_Node000016_Node000007" title=" " alt="" coords="393,396,441,458,475,492,513,521,534,533,554,539,591,545,629,551,649,559,670,572,692,595,717,629,764,701,759,704,713,632,688,598,667,576,646,563,627,556,591,550,553,545,532,538,510,526,471,496,437,461,389,399"/>
-<area shape="poly" id="edge27_Node000016_Node000010" title=" " alt="" coords="464,376,638,384,739,393,839,406,881,415,880,420,839,411,738,399,638,390,464,381"/>
-<area shape="poly" id="edge21_Node000016_Node000014" title=" " alt="" coords="455,395,525,414,524,419,454,400"/>
-<area shape="rect" id="Node000017" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="556,271,624,296"/>
-<area shape="poly" id="edge22_Node000016_Node000017" title=" " alt="" coords="439,354,462,343,486,324,510,305,540,293,542,298,513,310,489,328,465,347,442,358"/>
-<area shape="rect" id="Node000018" href="$d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7" title=" " alt="" coords="526,206,654,246"/>
-<area shape="poly" id="edge23_Node000016_Node000018" title=" " alt="" coords="445,354,462,343,478,322,485,301,492,279,509,256,513,253,516,258,513,260,497,281,490,303,483,325,465,347,448,358"/>
-<area shape="rect" id="Node000019" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/round.html#" title=" " alt="" coords="550,320,630,346"/>
-<area shape="poly" id="edge26_Node000016_Node000019" title=" " alt="" coords="463,356,534,341,535,347,465,361"/>
-<area shape="poly" id="edge25_Node000018_Node000010" title=" " alt="" coords="646,245,670,256,741,295,809,338,915,410,912,415,806,342,738,300,667,261,644,249"/>
-<area shape="poly" id="edge24_Node000018_Node000012" title=" " alt="" coords="654,214,727,203,727,208,655,219"/>
-<area shape="poly" id="edge35_Node000020_Node000007" title=" " alt="" coords="410,618,457,646,512,672,567,689,623,703,723,720,722,725,622,708,566,694,510,677,455,651,407,623"/>
-<area shape="rect" id="Node000021" href="$d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0" title="Compute GCD of two integers using Euler&#39;s algorithm." alt="" coords="511,587,669,612"/>
-<area shape="poly" id="edge30_Node000020_Node000021" title=" " alt="" coords="464,597,496,597,496,602,464,602"/>
-<area shape="rect" id="Node000023" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/isfinite.html#" title=" " alt="" coords="547,636,633,662"/>
-<area shape="poly" id="edge32_Node000020_Node000023" title=" " alt="" coords="465,617,533,633,532,638,463,622"/>
-<area shape="rect" id="Node000024" href="$d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9" title="Function to generate a random integer in a given interval." alt="" coords="526,471,654,512"/>
-<area shape="poly" id="edge33_Node000020_Node000024" title=" " alt="" coords="417,576,533,517,536,522,419,581"/>
-<area shape="rect" id="Node000022" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="739,587,817,612"/>
-<area shape="poly" id="edge31_Node000021_Node000022" title=" " alt="" coords="669,597,723,597,723,602,669,602"/>
-<area shape="rect" id="Node000025" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="742,523,814,548"/>
-<area shape="poly" id="edge34_Node000024_Node000025" title=" " alt="" coords="655,504,727,521,726,526,654,509"/>
-</map>
diff --git a/d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph.md5 b/d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph.md5
deleted file mode 100644
index bd24efd20..000000000
--- a/d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2dc7ea7923bc4b9d21fa833cff5635b1
\ No newline at end of file
diff --git a/d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph.svg b/d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph.svg
deleted file mode 100644
index 0ae47243f..000000000
--- a/d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph.svg
+++ /dev/null
@@ -1,681 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<!--zoomable 711 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 756;
-var viewHeight = 711;
-var sectionId = 'dynsection-4';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self test 2 &#45; using 8x8 randomly generated key.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-512.25 0,-512.25 0,-493 37.75,-493 37.75,-512.25"/>
-<text text-anchor="middle" x="18.88" y="-498.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-703.25 73.75,-703.25 73.75,-684 176.75,-684 176.75,-703.25"/>
-<text text-anchor="middle" x="125.25" y="-689.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.02,-512.34C20.99,-541.27 27.78,-627.75 73.75,-675.62 74.23,-676.13 74.73,-676.62 75.24,-677.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.12,-679.88 83.3,-682.79 77.16,-674.16 73.12,-679.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-666.25 73.75,-666.25 73.75,-647 176.75,-647 176.75,-666.25"/>
-<text text-anchor="middle" x="125.25" y="-652.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::compare</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.45,-512.41C25.73,-536 39.58,-596.68 73.75,-632.62 76.79,-635.82 80.33,-638.63 84.11,-641.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.08,-643.98 92.52,-645.82 85.51,-637.87 82.08,-643.98"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b" target="_top" xlink:title="Decrypt a given text using a given key.">
-<polygon fill="white" stroke="#666666" points="173.38,-201.88 77.12,-201.88 77.12,-171.38 173.38,-171.38 173.38,-201.88"/>
-<text text-anchor="start" x="85.12" y="-188.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="125.25" y="-177.12" font-family="Helvetica,sans-Serif" font-size="10.00">::decrypt_text</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.09,-492.59C28.66,-463.25 49.15,-375.28 73.75,-304.62 85.07,-272.11 101.13,-235.85 112.07,-212.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.14,-213.92 116.21,-203.38 108.8,-210.95 115.14,-213.92"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="484.38,-19.25 392.62,-19.25 392.62,0 484.38,0 484.38,-19.25"/>
-<text text-anchor="middle" x="438.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge37_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge37_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.25,-492.63C22.29,-442.34 33.59,-217.29 73.75,-162.62 147.16,-62.7 298.58,-27.59 381.02,-15.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="381.25,-19.1 390.68,-14.26 380.29,-12.16 381.25,-19.1"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="747.75,-391.25 661.25,-391.25 661.25,-372 747.75,-372 747.75,-391.25"/>
-<text text-anchor="middle" x="704.5" y="-377.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge38_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge38_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.1,-512.72C67.55,-540.94 174.49,-618.62 277.12,-618.62 277.12,-618.62 277.12,-618.62 439.5,-618.62 524.04,-618.62 560.81,-632.35 625.25,-577.62 679.18,-531.82 696.27,-443.6 701.42,-403.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="704.89,-403.46 702.53,-393.13 697.93,-402.67 704.89,-403.46"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917" target="_top" xlink:title="Encrypt a given text using a given key.">
-<polygon fill="white" stroke="#666666" points="173.38,-343.88 77.12,-343.88 77.12,-313.38 173.38,-313.38 173.38,-343.88"/>
-<text text-anchor="start" x="85.12" y="-330.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="125.25" y="-319.12" font-family="Helvetica,sans-Serif" font-size="10.00">::encrypt_text</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge12_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge12_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.67,-492.55C33.63,-473.98 53.8,-433.26 73.75,-400.62 83.62,-384.48 95.77,-367.1 105.68,-353.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.44,-355.61 111.53,-345.47 102.79,-351.46 108.44,-355.61"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="606.12,-568.25 552.62,-568.25 552.62,-549 606.12,-549 606.12,-568.25"/>
-<text text-anchor="middle" x="579.38" y="-554.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge14_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge14_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.08,-506.69C90.66,-518.2 247.39,-550.86 379.5,-561.62 431.77,-565.88 445.06,-562.6 497.5,-561.62 511.62,-561.36 527.13,-560.84 540.75,-560.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="540.8,-563.81 550.65,-559.91 540.51,-556.82 540.8,-563.81"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5" target="_top" xlink:title="Generate encryption and decryption key pair.">
-<polygon fill="white" stroke="#666666" points="173.38,-439.88 77.12,-439.88 77.12,-409.38 173.38,-409.38 173.38,-439.88"/>
-<text text-anchor="start" x="85.12" y="-426.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="125.25" y="-415.12" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_keys</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node13 -->
-<g id="edge15_Node000001_Node000013" class="edge">
-<title>Node1&#45;&gt;Node13</title>
-<g id="a_edge15_Node000001_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.09,-492.75C48.34,-481.35 73.9,-462.25 94.08,-447.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.08,-450.05 101.99,-441.26 91.89,-444.44 96.08,-450.05"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa" target="_top" xlink:title="Convenience function to perform block cipher operations. The operations are identical for both encryp...">
-<polygon fill="white" stroke="#666666" points="326.25,-132.88 230,-132.88 230,-102.38 326.25,-102.38 326.25,-132.88"/>
-<text text-anchor="start" x="238" y="-119.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="278.12" y="-108.12" font-family="Helvetica,sans-Serif" font-size="10.00">::codec</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.49,-170.97C181.82,-161.21 209.5,-148.55 232.54,-138.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.75,-141.31 241.39,-133.97 230.84,-134.95 233.75,-141.31"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41" target="_top" xlink:title="Get the index of a character in the STRKEY.">
-<polygon fill="white" stroke="#666666" points="486.62,-154.88 390.38,-154.88 390.38,-124.38 486.62,-124.38 486.62,-154.88"/>
-<text text-anchor="start" x="398.38" y="-141.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="438.5" y="-130.12" font-family="Helvetica,sans-Serif" font-size="10.00">::get_char_idx</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M326.64,-124.23C343.09,-126.51 361.71,-129.1 378.94,-131.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="378.13,-134.91 388.52,-132.82 379.09,-127.98 378.13,-134.91"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M294.64,-102.01C313.43,-83.75 346.65,-53.52 379.5,-33.62 385.23,-30.15 391.56,-26.96 397.86,-24.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.1,-27.4 406.94,-20.27 396.37,-20.95 399.1,-27.4"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590" target="_top" xlink:title="helper function to perform vector multiplication with encryption or decryption matrix">
-<polygon fill="white" stroke="#666666" points="486.62,-105.88 390.38,-105.88 390.38,-75.38 486.62,-75.38 486.62,-105.88"/>
-<text text-anchor="start" x="398.38" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="438.5" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">::mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge8_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge8_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M326.64,-109.52C343.09,-106.72 361.71,-103.55 378.94,-100.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.25,-104.11 388.52,-98.97 378.08,-97.2 379.25,-104.11"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge11_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge11_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.23,-101.9C321.82,-89.57 351.18,-73.41 379.5,-66.62 486.46,-41.01 545.8,-19.58 625.25,-95.62 664.14,-132.85 691.72,-300.15 700.51,-360.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="697.04,-360.61 701.92,-370.02 703.97,-359.62 697.04,-360.61"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="609.12,-170.25 549.62,-170.25 549.62,-151 609.12,-151 609.12,-170.25"/>
-<text text-anchor="middle" x="579.38" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.9,-146.79C503.6,-149.32 522.18,-152.13 538.22,-154.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="537.48,-157.98 547.89,-156.01 538.52,-151.06 537.48,-157.98"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge10_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge10_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M477.5,-106.35C484.22,-109.32 491.11,-112.48 497.5,-115.62 516.07,-124.76 536.42,-136.1 552.07,-145.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="549.89,-147.88 560.29,-149.88 553.4,-141.83 549.89,-147.88"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M487.12,-91.57C528.72,-94.92 588.11,-106.19 625.25,-141.62 688.44,-201.9 700.67,-313.75 702.98,-360.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="699.48,-360.32 703.35,-370.18 706.48,-360.05 699.48,-360.32"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge13_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge13_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M137.34,-313.11C163.28,-276.83 228.07,-186.22 259.49,-142.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.16,-144.56 265.13,-134.39 256.47,-140.49 262.16,-144.56"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="478.38,-391.25 398.62,-391.25 398.62,-372 478.38,-372 478.38,-391.25"/>
-<text text-anchor="middle" x="438.5" y="-377.75" font-family="Helvetica,sans-Serif" font-size="10.00">determinant_lu</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge16_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge16_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M173.47,-409.81C186.12,-406.31 199.86,-402.94 212.75,-400.62 271.96,-390 341.05,-385.29 386.83,-383.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="386.88,-386.72 396.72,-382.8 386.58,-379.72 386.88,-386.72"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706" target="_top" xlink:title="Generate decryption matrix from an encryption matrix key.">
-<polygon fill="white" stroke="#666666" points="343.5,-439.88 212.75,-439.88 212.75,-409.38 343.5,-409.38 343.5,-439.88"/>
-<text text-anchor="start" x="220.75" y="-426.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="278.12" y="-415.12" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_decryption_key</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node16 -->
-<g id="edge20_Node000013_Node000016" class="edge">
-<title>Node13&#45;&gt;Node16</title>
-<g id="a_edge20_Node000013_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M173.57,-424.62C182.3,-424.62 191.61,-424.62 200.93,-424.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.76,-428.13 210.76,-424.63 200.76,-421.13 200.76,-428.13"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e" target="_top" xlink:title="Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid...">
-<polygon fill="white" stroke="#666666" points="343.5,-272.88 212.75,-272.88 212.75,-242.38 343.5,-242.38 343.5,-272.88"/>
-<text text-anchor="start" x="220.75" y="-259.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="278.12" y="-248.12" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_encryption_key</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node20 -->
-<g id="edge29_Node000013_Node000020" class="edge">
-<title>Node13&#45;&gt;Node20</title>
-<g id="a_edge29_Node000013_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.44,-408.91C167.09,-379.42 224.72,-315.64 255.96,-281.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.18,-283.82 262.28,-274.05 252.98,-279.13 258.18,-283.82"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="318.38,-477.25 237.88,-477.25 237.88,-458 318.38,-458 318.38,-477.25"/>
-<text text-anchor="middle" x="278.12" y="-463.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node26 -->
-<g id="edge36_Node000013_Node000026" class="edge">
-<title>Node13&#45;&gt;Node26</title>
-<g id="a_edge36_Node000013_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M173.57,-438.11C191.89,-443.33 212.8,-449.29 231,-454.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.91,-457.81 240.49,-457.18 231.83,-451.08 229.91,-457.81"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node10 -->
-<g id="edge19_Node000014_Node000010" class="edge">
-<title>Node14&#45;&gt;Node10</title>
-<g id="a_edge19_Node000014_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M478.57,-371.91C495.36,-368.21 515.28,-364.45 533.5,-362.62 574.08,-358.57 584.76,-357.78 625.25,-362.62 636.17,-363.93 647.77,-366.23 658.6,-368.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="657.52,-372.13 668.07,-371.15 659.22,-365.33 657.52,-372.13"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="625.25,-391.25 533.5,-391.25 533.5,-372 625.25,-372 625.25,-391.25"/>
-<text text-anchor="middle" x="579.38" y="-377.75" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge17_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge17_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M478.55,-381.62C491.97,-381.62 507.28,-381.62 521.81,-381.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="521.73,-385.13 531.73,-381.63 521.73,-378.13 521.73,-385.13"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node10 -->
-<g id="edge18_Node000015_Node000010" class="edge">
-<title>Node15&#45;&gt;Node10</title>
-<g id="a_edge18_Node000015_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M625.52,-381.62C633.27,-381.62 641.39,-381.62 649.34,-381.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="649.3,-385.13 659.3,-381.63 649.3,-378.13 649.3,-385.13"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node7 -->
-<g id="edge28_Node000016_Node000007" class="edge">
-<title>Node16&#45;&gt;Node7</title>
-<g id="a_edge28_Node000016_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M289.25,-409.13C305.51,-385.43 339.7,-340.21 379.5,-314.62 425.85,-284.83 453.2,-309.38 497.5,-276.62 515.61,-263.23 549.3,-209.46 566.94,-180.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="569.78,-182.14 571.88,-171.75 563.76,-178.56 569.78,-182.14"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node10 -->
-<g id="edge27_Node000016_Node000010" class="edge">
-<title>Node16&#45;&gt;Node10</title>
-<g id="a_edge27_Node000016_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.92,-423.4C413.73,-421.31 527.93,-415.7 625.25,-400.62 635.5,-399.04 646.37,-396.77 656.66,-394.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="657.17,-397.84 666.05,-392.07 655.51,-391.04 657.17,-397.84"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node14 -->
-<g id="edge21_Node000016_Node000014" class="edge">
-<title>Node16&#45;&gt;Node14</title>
-<g id="a_edge21_Node000016_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.75,-408.98C354,-404.3 372.72,-399.21 389.29,-394.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="390.19,-398.1 398.92,-392.1 388.35,-391.34 390.19,-398.1"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="464.12,-504.25 412.88,-504.25 412.88,-485 464.12,-485 464.12,-504.25"/>
-<text text-anchor="middle" x="438.5" y="-490.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge22_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge22_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M326.29,-440.3C332.21,-442.82 338.08,-445.6 343.5,-448.62 361.2,-458.5 361.53,-467.25 379.5,-476.62 386.41,-480.23 394.16,-483.25 401.7,-485.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="400.42,-489 411.01,-488.54 402.44,-482.3 400.42,-489"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="486.62,-552.88 390.38,-552.88 390.38,-522.38 486.62,-522.38 486.62,-552.88"/>
-<text text-anchor="start" x="398.38" y="-539.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="438.5" y="-528.12" font-family="Helvetica,sans-Serif" font-size="10.00">::get_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node18 -->
-<g id="edge23_Node000016_Node000018" class="edge">
-<title>Node16&#45;&gt;Node18</title>
-<g id="a_edge23_Node000016_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M331.23,-440.22C335.62,-442.65 339.79,-445.43 343.5,-448.62 368.52,-470.17 354.86,-491.64 379.5,-513.62 380.26,-514.31 381.05,-514.97 381.86,-515.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.63,-518.34 389.87,-521.06 383.56,-512.55 379.63,-518.34"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="468.25,-467.25 408.75,-467.25 408.75,-448 468.25,-448 468.25,-467.25"/>
-<text text-anchor="middle" x="438.5" y="-453.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node19 -->
-<g id="edge26_Node000016_Node000019" class="edge">
-<title>Node16&#45;&gt;Node19</title>
-<g id="a_edge26_Node000016_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M344,-438.14C362.01,-441.9 381.04,-445.86 397.2,-449.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.42,-452.64 406.92,-451.25 397.84,-445.79 396.42,-452.64"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node10 -->
-<g id="edge25_Node000018_Node000010" class="edge">
-<title>Node18&#45;&gt;Node10</title>
-<g id="a_edge25_Node000018_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M479.84,-521.96C485.83,-519.34 491.88,-516.52 497.5,-513.62 567.51,-477.54 644.18,-424.47 681.13,-397.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="682.76,-401.1 688.82,-392.41 678.67,-395.42 682.76,-401.1"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node12 -->
-<g id="edge24_Node000018_Node000012" class="edge">
-<title>Node18&#45;&gt;Node12</title>
-<g id="a_edge24_Node000018_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.9,-544.79C504.65,-547.48 524.54,-550.48 541.23,-553.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="540.3,-556.41 550.71,-554.44 541.35,-549.49 540.3,-556.41"/>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node7 -->
-<g id="edge35_Node000020_Node000007" class="edge">
-<title>Node20&#45;&gt;Node7</title>
-<g id="a_edge35_Node000020_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.47,-241.89C322.2,-229.26 351.63,-211.99 379.5,-201.62 432.43,-181.94 496.99,-170.84 537.9,-165.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="538.32,-168.76 547.79,-163.99 537.42,-161.82 538.32,-168.76"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0" target="_top" xlink:title="Compute GCD of two integers using Euler&#39;s algorithm.">
-<polygon fill="white" stroke="#666666" points="497.5,-267.25 379.5,-267.25 379.5,-248 497.5,-248 497.5,-267.25"/>
-<text text-anchor="middle" x="438.5" y="-253.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher::gcd</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node21 -->
-<g id="edge30_Node000020_Node000021" class="edge">
-<title>Node20&#45;&gt;Node21</title>
-<g id="a_edge30_Node000020_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M344,-257.62C351.8,-257.62 359.8,-257.62 367.67,-257.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="367.57,-261.13 377.57,-257.63 367.57,-254.13 367.57,-261.13"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isfinite.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="470.5,-230.25 406.5,-230.25 406.5,-211 470.5,-211 470.5,-230.25"/>
-<text text-anchor="middle" x="438.5" y="-216.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::isfinite</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node23 -->
-<g id="edge32_Node000020_Node000023" class="edge">
-<title>Node20&#45;&gt;Node23</title>
-<g id="a_edge32_Node000020_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M344,-242.47C361.32,-238.42 379.59,-234.15 395.34,-230.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="395.89,-233.94 404.83,-228.26 394.3,-227.12 395.89,-233.94"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9" target="_top" xlink:title="Function to generate a random integer in a given interval.">
-<polygon fill="white" stroke="#666666" points="486.62,-353.88 390.38,-353.88 390.38,-323.38 486.62,-323.38 486.62,-353.88"/>
-<text text-anchor="start" x="398.38" y="-340.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="438.5" y="-329.12" font-family="Helvetica,sans-Serif" font-size="10.00">::rand_range</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node24 -->
-<g id="edge33_Node000020_Node000024" class="edge">
-<title>Node20&#45;&gt;Node24</title>
-<g id="a_edge33_Node000020_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M309.66,-273.24C334.45,-285.92 369.62,-303.91 396.8,-317.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="394.94,-320.79 405.44,-322.23 398.13,-314.56 394.94,-320.79"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="608.75,-267.25 550,-267.25 550,-248 608.75,-248 608.75,-267.25"/>
-<text text-anchor="middle" x="579.38" y="-253.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node21&#45;&gt;Node22 -->
-<g id="edge31_Node000021_Node000022" class="edge">
-<title>Node21&#45;&gt;Node22</title>
-<g id="a_edge31_Node000021_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M497.99,-257.62C511.59,-257.62 525.76,-257.62 538.34,-257.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="538.34,-261.13 548.34,-257.63 538.34,-254.13 538.34,-261.13"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="606.5,-315.25 552.25,-315.25 552.25,-296 606.5,-296 606.5,-315.25"/>
-<text text-anchor="middle" x="579.38" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node25 -->
-<g id="edge34_Node000024_Node000025" class="edge">
-<title>Node24&#45;&gt;Node25</title>
-<g id="a_edge34_Node000024_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.9,-327.36C504.53,-323.17 524.26,-318.48 540.87,-314.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="541.42,-318 550.34,-312.29 539.8,-311.19 541.42,-318"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph_org.svg b/d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph_org.svg
deleted file mode 100644
index 617f217cf..000000000
--- a/d7/db9/hill__cipher_8cpp_a04391124480d2a49f2dec900237b0712_cgraph_org.svg
+++ /dev/null
@@ -1,598 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="756pt" height="711pt"
- viewBox="0.00 0.00 755.75 711.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 707.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self test 2 &#45; using 8x8 randomly generated key.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-512.25 0,-512.25 0,-493 37.75,-493 37.75,-512.25"/>
-<text text-anchor="middle" x="18.88" y="-498.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-703.25 73.75,-703.25 73.75,-684 176.75,-684 176.75,-703.25"/>
-<text text-anchor="middle" x="125.25" y="-689.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.02,-512.34C20.99,-541.27 27.78,-627.75 73.75,-675.62 74.23,-676.13 74.73,-676.62 75.24,-677.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.12,-679.88 83.3,-682.79 77.16,-674.16 73.12,-679.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-666.25 73.75,-666.25 73.75,-647 176.75,-647 176.75,-666.25"/>
-<text text-anchor="middle" x="125.25" y="-652.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::compare</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.45,-512.41C25.73,-536 39.58,-596.68 73.75,-632.62 76.79,-635.82 80.33,-638.63 84.11,-641.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.08,-643.98 92.52,-645.82 85.51,-637.87 82.08,-643.98"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b" target="_top" xlink:title="Decrypt a given text using a given key.">
-<polygon fill="white" stroke="#666666" points="173.38,-201.88 77.12,-201.88 77.12,-171.38 173.38,-171.38 173.38,-201.88"/>
-<text text-anchor="start" x="85.12" y="-188.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="125.25" y="-177.12" font-family="Helvetica,sans-Serif" font-size="10.00">::decrypt_text</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.09,-492.59C28.66,-463.25 49.15,-375.28 73.75,-304.62 85.07,-272.11 101.13,-235.85 112.07,-212.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.14,-213.92 116.21,-203.38 108.8,-210.95 115.14,-213.92"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="484.38,-19.25 392.62,-19.25 392.62,0 484.38,0 484.38,-19.25"/>
-<text text-anchor="middle" x="438.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge37_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge37_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.25,-492.63C22.29,-442.34 33.59,-217.29 73.75,-162.62 147.16,-62.7 298.58,-27.59 381.02,-15.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="381.25,-19.1 390.68,-14.26 380.29,-12.16 381.25,-19.1"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="747.75,-391.25 661.25,-391.25 661.25,-372 747.75,-372 747.75,-391.25"/>
-<text text-anchor="middle" x="704.5" y="-377.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge38_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge38_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.1,-512.72C67.55,-540.94 174.49,-618.62 277.12,-618.62 277.12,-618.62 277.12,-618.62 439.5,-618.62 524.04,-618.62 560.81,-632.35 625.25,-577.62 679.18,-531.82 696.27,-443.6 701.42,-403.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="704.89,-403.46 702.53,-393.13 697.93,-402.67 704.89,-403.46"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917" target="_top" xlink:title="Encrypt a given text using a given key.">
-<polygon fill="white" stroke="#666666" points="173.38,-343.88 77.12,-343.88 77.12,-313.38 173.38,-313.38 173.38,-343.88"/>
-<text text-anchor="start" x="85.12" y="-330.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="125.25" y="-319.12" font-family="Helvetica,sans-Serif" font-size="10.00">::encrypt_text</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge12_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge12_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.67,-492.55C33.63,-473.98 53.8,-433.26 73.75,-400.62 83.62,-384.48 95.77,-367.1 105.68,-353.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.44,-355.61 111.53,-345.47 102.79,-351.46 108.44,-355.61"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="606.12,-568.25 552.62,-568.25 552.62,-549 606.12,-549 606.12,-568.25"/>
-<text text-anchor="middle" x="579.38" y="-554.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge14_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge14_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.08,-506.69C90.66,-518.2 247.39,-550.86 379.5,-561.62 431.77,-565.88 445.06,-562.6 497.5,-561.62 511.62,-561.36 527.13,-560.84 540.75,-560.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="540.8,-563.81 550.65,-559.91 540.51,-556.82 540.8,-563.81"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5" target="_top" xlink:title="Generate encryption and decryption key pair.">
-<polygon fill="white" stroke="#666666" points="173.38,-439.88 77.12,-439.88 77.12,-409.38 173.38,-409.38 173.38,-439.88"/>
-<text text-anchor="start" x="85.12" y="-426.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="125.25" y="-415.12" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_keys</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node13 -->
-<g id="edge15_Node000001_Node000013" class="edge">
-<title>Node1&#45;&gt;Node13</title>
-<g id="a_edge15_Node000001_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.09,-492.75C48.34,-481.35 73.9,-462.25 94.08,-447.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.08,-450.05 101.99,-441.26 91.89,-444.44 96.08,-450.05"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa" target="_top" xlink:title="Convenience function to perform block cipher operations. The operations are identical for both encryp...">
-<polygon fill="white" stroke="#666666" points="326.25,-132.88 230,-132.88 230,-102.38 326.25,-102.38 326.25,-132.88"/>
-<text text-anchor="start" x="238" y="-119.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="278.12" y="-108.12" font-family="Helvetica,sans-Serif" font-size="10.00">::codec</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.49,-170.97C181.82,-161.21 209.5,-148.55 232.54,-138.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.75,-141.31 241.39,-133.97 230.84,-134.95 233.75,-141.31"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41" target="_top" xlink:title="Get the index of a character in the STRKEY.">
-<polygon fill="white" stroke="#666666" points="486.62,-154.88 390.38,-154.88 390.38,-124.38 486.62,-124.38 486.62,-154.88"/>
-<text text-anchor="start" x="398.38" y="-141.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="438.5" y="-130.12" font-family="Helvetica,sans-Serif" font-size="10.00">::get_char_idx</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M326.64,-124.23C343.09,-126.51 361.71,-129.1 378.94,-131.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="378.13,-134.91 388.52,-132.82 379.09,-127.98 378.13,-134.91"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M294.64,-102.01C313.43,-83.75 346.65,-53.52 379.5,-33.62 385.23,-30.15 391.56,-26.96 397.86,-24.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.1,-27.4 406.94,-20.27 396.37,-20.95 399.1,-27.4"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590" target="_top" xlink:title="helper function to perform vector multiplication with encryption or decryption matrix">
-<polygon fill="white" stroke="#666666" points="486.62,-105.88 390.38,-105.88 390.38,-75.38 486.62,-75.38 486.62,-105.88"/>
-<text text-anchor="start" x="398.38" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="438.5" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">::mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge8_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge8_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M326.64,-109.52C343.09,-106.72 361.71,-103.55 378.94,-100.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.25,-104.11 388.52,-98.97 378.08,-97.2 379.25,-104.11"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge11_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge11_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.23,-101.9C321.82,-89.57 351.18,-73.41 379.5,-66.62 486.46,-41.01 545.8,-19.58 625.25,-95.62 664.14,-132.85 691.72,-300.15 700.51,-360.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="697.04,-360.61 701.92,-370.02 703.97,-359.62 697.04,-360.61"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="609.12,-170.25 549.62,-170.25 549.62,-151 609.12,-151 609.12,-170.25"/>
-<text text-anchor="middle" x="579.38" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.9,-146.79C503.6,-149.32 522.18,-152.13 538.22,-154.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="537.48,-157.98 547.89,-156.01 538.52,-151.06 537.48,-157.98"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge10_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge10_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M477.5,-106.35C484.22,-109.32 491.11,-112.48 497.5,-115.62 516.07,-124.76 536.42,-136.1 552.07,-145.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="549.89,-147.88 560.29,-149.88 553.4,-141.83 549.89,-147.88"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M487.12,-91.57C528.72,-94.92 588.11,-106.19 625.25,-141.62 688.44,-201.9 700.67,-313.75 702.98,-360.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="699.48,-360.32 703.35,-370.18 706.48,-360.05 699.48,-360.32"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge13_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge13_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M137.34,-313.11C163.28,-276.83 228.07,-186.22 259.49,-142.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.16,-144.56 265.13,-134.39 256.47,-140.49 262.16,-144.56"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="478.38,-391.25 398.62,-391.25 398.62,-372 478.38,-372 478.38,-391.25"/>
-<text text-anchor="middle" x="438.5" y="-377.75" font-family="Helvetica,sans-Serif" font-size="10.00">determinant_lu</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge16_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge16_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M173.47,-409.81C186.12,-406.31 199.86,-402.94 212.75,-400.62 271.96,-390 341.05,-385.29 386.83,-383.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="386.88,-386.72 396.72,-382.8 386.58,-379.72 386.88,-386.72"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706" target="_top" xlink:title="Generate decryption matrix from an encryption matrix key.">
-<polygon fill="white" stroke="#666666" points="343.5,-439.88 212.75,-439.88 212.75,-409.38 343.5,-409.38 343.5,-439.88"/>
-<text text-anchor="start" x="220.75" y="-426.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="278.12" y="-415.12" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_decryption_key</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node16 -->
-<g id="edge20_Node000013_Node000016" class="edge">
-<title>Node13&#45;&gt;Node16</title>
-<g id="a_edge20_Node000013_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M173.57,-424.62C182.3,-424.62 191.61,-424.62 200.93,-424.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.76,-428.13 210.76,-424.63 200.76,-421.13 200.76,-428.13"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e" target="_top" xlink:title="Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid...">
-<polygon fill="white" stroke="#666666" points="343.5,-272.88 212.75,-272.88 212.75,-242.38 343.5,-242.38 343.5,-272.88"/>
-<text text-anchor="start" x="220.75" y="-259.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="278.12" y="-248.12" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_encryption_key</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node20 -->
-<g id="edge29_Node000013_Node000020" class="edge">
-<title>Node13&#45;&gt;Node20</title>
-<g id="a_edge29_Node000013_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.44,-408.91C167.09,-379.42 224.72,-315.64 255.96,-281.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.18,-283.82 262.28,-274.05 252.98,-279.13 258.18,-283.82"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="318.38,-477.25 237.88,-477.25 237.88,-458 318.38,-458 318.38,-477.25"/>
-<text text-anchor="middle" x="278.12" y="-463.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node26 -->
-<g id="edge36_Node000013_Node000026" class="edge">
-<title>Node13&#45;&gt;Node26</title>
-<g id="a_edge36_Node000013_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M173.57,-438.11C191.89,-443.33 212.8,-449.29 231,-454.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.91,-457.81 240.49,-457.18 231.83,-451.08 229.91,-457.81"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node10 -->
-<g id="edge19_Node000014_Node000010" class="edge">
-<title>Node14&#45;&gt;Node10</title>
-<g id="a_edge19_Node000014_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M478.57,-371.91C495.36,-368.21 515.28,-364.45 533.5,-362.62 574.08,-358.57 584.76,-357.78 625.25,-362.62 636.17,-363.93 647.77,-366.23 658.6,-368.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="657.52,-372.13 668.07,-371.15 659.22,-365.33 657.52,-372.13"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="625.25,-391.25 533.5,-391.25 533.5,-372 625.25,-372 625.25,-391.25"/>
-<text text-anchor="middle" x="579.38" y="-377.75" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge17_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge17_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M478.55,-381.62C491.97,-381.62 507.28,-381.62 521.81,-381.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="521.73,-385.13 531.73,-381.63 521.73,-378.13 521.73,-385.13"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node10 -->
-<g id="edge18_Node000015_Node000010" class="edge">
-<title>Node15&#45;&gt;Node10</title>
-<g id="a_edge18_Node000015_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M625.52,-381.62C633.27,-381.62 641.39,-381.62 649.34,-381.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="649.3,-385.13 659.3,-381.63 649.3,-378.13 649.3,-385.13"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node7 -->
-<g id="edge28_Node000016_Node000007" class="edge">
-<title>Node16&#45;&gt;Node7</title>
-<g id="a_edge28_Node000016_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M289.25,-409.13C305.51,-385.43 339.7,-340.21 379.5,-314.62 425.85,-284.83 453.2,-309.38 497.5,-276.62 515.61,-263.23 549.3,-209.46 566.94,-180.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="569.78,-182.14 571.88,-171.75 563.76,-178.56 569.78,-182.14"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node10 -->
-<g id="edge27_Node000016_Node000010" class="edge">
-<title>Node16&#45;&gt;Node10</title>
-<g id="a_edge27_Node000016_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.92,-423.4C413.73,-421.31 527.93,-415.7 625.25,-400.62 635.5,-399.04 646.37,-396.77 656.66,-394.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="657.17,-397.84 666.05,-392.07 655.51,-391.04 657.17,-397.84"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node14 -->
-<g id="edge21_Node000016_Node000014" class="edge">
-<title>Node16&#45;&gt;Node14</title>
-<g id="a_edge21_Node000016_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.75,-408.98C354,-404.3 372.72,-399.21 389.29,-394.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="390.19,-398.1 398.92,-392.1 388.35,-391.34 390.19,-398.1"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="464.12,-504.25 412.88,-504.25 412.88,-485 464.12,-485 464.12,-504.25"/>
-<text text-anchor="middle" x="438.5" y="-490.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge22_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge22_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M326.29,-440.3C332.21,-442.82 338.08,-445.6 343.5,-448.62 361.2,-458.5 361.53,-467.25 379.5,-476.62 386.41,-480.23 394.16,-483.25 401.7,-485.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="400.42,-489 411.01,-488.54 402.44,-482.3 400.42,-489"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="486.62,-552.88 390.38,-552.88 390.38,-522.38 486.62,-522.38 486.62,-552.88"/>
-<text text-anchor="start" x="398.38" y="-539.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="438.5" y="-528.12" font-family="Helvetica,sans-Serif" font-size="10.00">::get_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node18 -->
-<g id="edge23_Node000016_Node000018" class="edge">
-<title>Node16&#45;&gt;Node18</title>
-<g id="a_edge23_Node000016_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M331.23,-440.22C335.62,-442.65 339.79,-445.43 343.5,-448.62 368.52,-470.17 354.86,-491.64 379.5,-513.62 380.26,-514.31 381.05,-514.97 381.86,-515.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.63,-518.34 389.87,-521.06 383.56,-512.55 379.63,-518.34"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="468.25,-467.25 408.75,-467.25 408.75,-448 468.25,-448 468.25,-467.25"/>
-<text text-anchor="middle" x="438.5" y="-453.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node19 -->
-<g id="edge26_Node000016_Node000019" class="edge">
-<title>Node16&#45;&gt;Node19</title>
-<g id="a_edge26_Node000016_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M344,-438.14C362.01,-441.9 381.04,-445.86 397.2,-449.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.42,-452.64 406.92,-451.25 397.84,-445.79 396.42,-452.64"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node10 -->
-<g id="edge25_Node000018_Node000010" class="edge">
-<title>Node18&#45;&gt;Node10</title>
-<g id="a_edge25_Node000018_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M479.84,-521.96C485.83,-519.34 491.88,-516.52 497.5,-513.62 567.51,-477.54 644.18,-424.47 681.13,-397.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="682.76,-401.1 688.82,-392.41 678.67,-395.42 682.76,-401.1"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node12 -->
-<g id="edge24_Node000018_Node000012" class="edge">
-<title>Node18&#45;&gt;Node12</title>
-<g id="a_edge24_Node000018_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.9,-544.79C504.65,-547.48 524.54,-550.48 541.23,-553.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="540.3,-556.41 550.71,-554.44 541.35,-549.49 540.3,-556.41"/>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node7 -->
-<g id="edge35_Node000020_Node000007" class="edge">
-<title>Node20&#45;&gt;Node7</title>
-<g id="a_edge35_Node000020_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.47,-241.89C322.2,-229.26 351.63,-211.99 379.5,-201.62 432.43,-181.94 496.99,-170.84 537.9,-165.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="538.32,-168.76 547.79,-163.99 537.42,-161.82 538.32,-168.76"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0" target="_top" xlink:title="Compute GCD of two integers using Euler&#39;s algorithm.">
-<polygon fill="white" stroke="#666666" points="497.5,-267.25 379.5,-267.25 379.5,-248 497.5,-248 497.5,-267.25"/>
-<text text-anchor="middle" x="438.5" y="-253.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher::gcd</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node21 -->
-<g id="edge30_Node000020_Node000021" class="edge">
-<title>Node20&#45;&gt;Node21</title>
-<g id="a_edge30_Node000020_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M344,-257.62C351.8,-257.62 359.8,-257.62 367.67,-257.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="367.57,-261.13 377.57,-257.63 367.57,-254.13 367.57,-261.13"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isfinite.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="470.5,-230.25 406.5,-230.25 406.5,-211 470.5,-211 470.5,-230.25"/>
-<text text-anchor="middle" x="438.5" y="-216.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::isfinite</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node23 -->
-<g id="edge32_Node000020_Node000023" class="edge">
-<title>Node20&#45;&gt;Node23</title>
-<g id="a_edge32_Node000020_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M344,-242.47C361.32,-238.42 379.59,-234.15 395.34,-230.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="395.89,-233.94 404.83,-228.26 394.3,-227.12 395.89,-233.94"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9" target="_top" xlink:title="Function to generate a random integer in a given interval.">
-<polygon fill="white" stroke="#666666" points="486.62,-353.88 390.38,-353.88 390.38,-323.38 486.62,-323.38 486.62,-353.88"/>
-<text text-anchor="start" x="398.38" y="-340.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="438.5" y="-329.12" font-family="Helvetica,sans-Serif" font-size="10.00">::rand_range</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node24 -->
-<g id="edge33_Node000020_Node000024" class="edge">
-<title>Node20&#45;&gt;Node24</title>
-<g id="a_edge33_Node000020_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M309.66,-273.24C334.45,-285.92 369.62,-303.91 396.8,-317.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="394.94,-320.79 405.44,-322.23 398.13,-314.56 394.94,-320.79"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="608.75,-267.25 550,-267.25 550,-248 608.75,-248 608.75,-267.25"/>
-<text text-anchor="middle" x="579.38" y="-253.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node21&#45;&gt;Node22 -->
-<g id="edge31_Node000021_Node000022" class="edge">
-<title>Node21&#45;&gt;Node22</title>
-<g id="a_edge31_Node000021_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M497.99,-257.62C511.59,-257.62 525.76,-257.62 538.34,-257.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="538.34,-261.13 548.34,-257.63 538.34,-254.13 538.34,-261.13"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="606.5,-315.25 552.25,-315.25 552.25,-296 606.5,-296 606.5,-315.25"/>
-<text text-anchor="middle" x="579.38" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node25 -->
-<g id="edge34_Node000024_Node000025" class="edge">
-<title>Node24&#45;&gt;Node25</title>
-<g id="a_edge34_Node000024_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.9,-327.36C504.53,-323.17 524.26,-318.48 540.87,-314.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="541.42,-318 550.34,-312.29 539.8,-311.19 541.42,-318"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph.map b/d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph.map
deleted file mode 100644
index cc0d5e865..000000000
--- a/d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph.map
+++ /dev/null
@@ -1,63 +0,0 @@
-<map id="test1" name="test1">
-<area shape="rect" id="Node000001" title="Self test 1 &#45; using 3x3 randomly generated key." alt="" coords="5,443,56,468"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="104,287,241,312"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="33,441,56,385,76,352,102,323,108,318,111,322,105,327,80,355,61,387,38,443"/>
-<area shape="rect" id="Node000003" href="$d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b" title="Decrypt a given text using a given key." alt="" coords="108,336,236,377"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="42,440,69,415,102,388,110,383,113,388,105,392,72,419,46,444"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="887,509,1002,535"/>
-<area shape="poly" id="edge36_Node000001_Node000009" title=" " alt="" coords="39,468,73,553,103,612,141,675,188,734,242,783,272,803,304,817,339,827,375,830,591,830,634,828,670,822,701,812,728,798,779,756,837,698,868,661,894,620,930,548,935,551,898,623,872,664,841,701,783,760,731,802,703,817,671,827,635,833,591,835,375,835,338,832,303,822,270,807,239,788,184,737,137,678,98,615,68,555,34,470"/>
-<area shape="rect" id="Node000010" href="$d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917" title="Encrypt a given text using a given key." alt="" coords="108,402,236,442"/>
-<area shape="poly" id="edge11_Node000001_Node000010" title=" " alt="" coords="55,447,92,438,94,443,57,452"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="742,560,814,586"/>
-<area shape="poly" id="edge13_Node000001_Node000011" title=" " alt="" coords="44,467,70,494,105,517,157,534,229,546,406,562,588,569,727,570,727,576,587,575,406,568,228,552,156,539,103,522,66,498,40,471"/>
-<area shape="rect" id="Node000012" href="$d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5" title="Generate encryption and decryption key pair." alt="" coords="108,467,236,508"/>
-<area shape="poly" id="edge14_Node000001_Node000012" title=" " alt="" coords="57,458,94,467,92,472,55,464"/>
-<area shape="rect" id="Node000004" href="$d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa" title="Convenience function to perform block cipher operations. The operations are identical for both encryp..." alt="" coords="312,139,440,180"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="223,334,239,323,274,292,305,257,352,192,356,195,309,260,277,295,243,327,226,338"/>
-<area shape="rect" id="Node000005" href="$d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41" title="Get the index of a character in the STRKEY." alt="" coords="526,171,654,212"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="441,166,511,177,510,182,440,172"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="529,5,651,31"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="397,137,447,93,510,48,535,35,537,40,513,52,450,97,400,141"/>
-<area shape="rect" id="Node000008" href="$d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590" title="helper function to perform vector multiplication with encryption or decryption matrix" alt="" coords="526,106,654,146"/>
-<area shape="poly" id="edge7_Node000004_Node000008" title=" " alt="" coords="440,147,510,136,511,141,441,152"/>
-<area shape="poly" id="edge10_Node000004_Node000009" title=" " alt="" coords="408,136,455,111,511,92,609,72,652,68,692,70,730,78,767,94,804,120,841,155,872,195,896,240,914,288,927,336,942,426,946,494,941,494,937,427,922,337,909,289,891,242,867,198,837,159,800,124,764,99,728,83,691,75,652,73,610,77,512,97,457,116,411,141"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/strlen.html#" title=" " alt="" coords="738,219,818,244"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="655,203,724,217,722,223,654,208"/>
-<area shape="poly" id="edge9_Node000008_Node000006" title=" " alt="" coords="645,145,670,157,748,207,745,212,667,162,642,150"/>
-<area shape="poly" id="edge8_Node000008_Node000009" title=" " alt="" coords="655,128,700,136,750,150,799,172,841,204,869,238,891,275,909,316,922,357,939,434,945,494,940,494,933,435,917,358,904,318,887,278,864,241,837,208,796,177,748,155,699,141,654,133"/>
-<area shape="poly" id="edge12_Node000010_Node000004" title=" " alt="" coords="223,399,239,387,266,352,298,300,356,193,360,195,303,303,271,355,243,391,226,403"/>
-<area shape="rect" id="Node000013" href="$d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" title=" " alt="" coords="537,503,643,528"/>
-<area shape="poly" id="edge15_Node000012_Node000013" title=" " alt="" coords="237,482,343,481,464,488,522,497,521,502,463,493,343,486,237,487"/>
-<area shape="rect" id="Node000015" href="$d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706" title="Generate decryption matrix from an encryption matrix key." alt="" coords="289,603,463,644"/>
-<area shape="poly" id="edge19_Node000012_Node000015" title=" " alt="" coords="206,506,333,592,330,596,203,511"/>
-<area shape="rect" id="Node000019" href="$d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e" title="Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid..." alt="" coords="289,336,463,377"/>
-<area shape="poly" id="edge28_Node000012_Node000019" title=" " alt="" coords="217,464,240,452,336,385,339,389,242,456,220,469"/>
-<area shape="rect" id="Node000025" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="322,503,430,528"/>
-<area shape="poly" id="edge35_Node000012_Node000025" title=" " alt="" coords="237,494,308,503,307,509,236,499"/>
-<area shape="poly" id="edge18_Node000013_Node000009" title=" " alt="" coords="644,514,871,518,871,523,644,519"/>
-<area shape="rect" id="Node000014" href="$d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" title=" " alt="" coords="717,459,839,484"/>
-<area shape="poly" id="edge16_Node000013_Node000014" title=" " alt="" coords="643,501,705,486,706,491,644,506"/>
-<area shape="poly" id="edge17_Node000014_Node000009" title=" " alt="" coords="824,482,886,502,885,507,822,487"/>
-<area shape="poly" id="edge27_Node000015_Node000006" title=" " alt="" coords="398,601,461,539,484,512,494,500,510,488,533,476,554,471,594,467,630,462,648,453,667,438,682,418,690,399,693,359,695,318,702,296,715,273,736,251,740,255,719,276,707,298,701,319,699,360,695,400,687,421,671,441,651,457,632,467,594,473,555,476,535,481,513,492,498,504,488,515,465,543,401,605"/>
-<area shape="poly" id="edge26_Node000015_Node000009" title=" " alt="" coords="403,642,452,676,481,692,512,704,555,714,590,716,624,712,668,704,719,691,758,676,794,656,837,627,885,586,922,545,925,549,888,590,841,631,796,661,760,681,721,696,669,709,625,718,590,722,554,719,511,709,479,697,449,681,400,646"/>
-<area shape="poly" id="edge20_Node000015_Node000013" title=" " alt="" coords="417,600,548,533,551,538,419,605"/>
-<area shape="rect" id="Node000016" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="556,668,624,694"/>
-<area shape="poly" id="edge21_Node000015_Node000016" title=" " alt="" coords="455,642,541,665,540,670,454,647"/>
-<area shape="rect" id="Node000017" href="$d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7" title=" " alt="" coords="526,603,654,644"/>
-<area shape="poly" id="edge22_Node000015_Node000017" title=" " alt="" coords="464,621,510,621,510,626,464,626"/>
-<area shape="rect" id="Node000018" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/round.html#" title=" " alt="" coords="550,769,630,795"/>
-<area shape="poly" id="edge25_Node000015_Node000018" title=" " alt="" coords="397,643,446,694,478,723,513,748,537,761,535,766,510,752,475,727,443,698,393,646"/>
-<area shape="poly" id="edge24_Node000017_Node000009" title=" " alt="" coords="654,623,743,618,792,610,838,596,881,572,917,544,921,548,884,576,840,601,793,615,744,623,655,629"/>
-<area shape="poly" id="edge23_Node000017_Node000011" title=" " alt="" coords="654,604,726,584,728,589,655,609"/>
-<area shape="poly" id="edge34_Node000019_Node000006" title=" " alt="" coords="403,334,451,301,510,272,565,255,622,243,722,231,723,237,623,248,567,260,512,277,454,306,406,338"/>
-<area shape="rect" id="Node000020" href="$d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0" title="Compute GCD of two integers using Euler&#39;s algorithm." alt="" coords="511,287,669,312"/>
-<area shape="poly" id="edge29_Node000019_Node000020" title=" " alt="" coords="454,333,524,314,525,320,455,339"/>
-<area shape="rect" id="Node000022" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/isfinite.html#" title=" " alt="" coords="547,401,633,427"/>
-<area shape="poly" id="edge31_Node000019_Node000022" title=" " alt="" coords="455,375,533,396,532,401,454,380"/>
-<area shape="rect" id="Node000023" href="$d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9" title="Function to generate a random integer in a given interval." alt="" coords="526,336,654,377"/>
-<area shape="poly" id="edge32_Node000019_Node000023" title=" " alt="" coords="464,354,510,354,510,360,464,360"/>
-<area shape="rect" id="Node000021" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="739,287,817,312"/>
-<area shape="poly" id="edge30_Node000020_Node000021" title=" " alt="" coords="669,297,723,297,723,302,669,302"/>
-<area shape="rect" id="Node000024" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="742,344,814,370"/>
-<area shape="poly" id="edge33_Node000023_Node000024" title=" " alt="" coords="655,354,726,354,726,360,655,360"/>
-</map>
diff --git a/d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph.md5 b/d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph.md5
deleted file mode 100644
index 5bdd39fe8..000000000
--- a/d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8109ef22d7a8c13e895ce78ff7f4d90b
\ No newline at end of file
diff --git a/d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph.svg b/d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph.svg
deleted file mode 100644
index 7e45dd564..000000000
--- a/d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph.svg
+++ /dev/null
@@ -1,654 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<!--zoomable 629 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 756;
-var viewHeight = 629;
-var sectionId = 'dynsection-3';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self test 1 &#45; using 3x3 randomly generated key.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-292.62 0,-292.62 0,-273.38 37.75,-273.38 37.75,-292.62"/>
-<text text-anchor="middle" x="18.88" y="-279.12" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-409.62 73.75,-409.62 73.75,-390.38 176.75,-390.38 176.75,-409.62"/>
-<text text-anchor="middle" x="125.25" y="-396.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.82,-293.12C29.02,-312.77 45.28,-356.33 73.75,-381 75.19,-382.24 76.71,-383.41 78.3,-384.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.24,-387.36 86.66,-389.25 79.69,-381.27 76.24,-387.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b" target="_top" xlink:title="Decrypt a given text using a given key.">
-<polygon fill="white" stroke="#666666" points="173.38,-372.25 77.12,-372.25 77.12,-341.75 173.38,-341.75 173.38,-372.25"/>
-<text text-anchor="start" x="85.12" y="-358.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="125.25" y="-347.5" font-family="Helvetica,sans-Serif" font-size="10.00">::decrypt_text</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.11,-292.91C39.33,-303.49 56.62,-320.31 73.75,-332 75.57,-333.24 77.46,-334.46 79.39,-335.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.56,-338.63 87.98,-340.54 81.03,-332.55 77.56,-338.63"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="747.75,-242.62 661.25,-242.62 661.25,-223.38 747.75,-223.38 747.75,-242.62"/>
-<text text-anchor="middle" x="704.5" y="-229.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge36_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge36_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.23,-272.93C40.71,-222.51 126.4,0 277.12,0 277.12,0 277.12,0 439.5,0 533.26,0 560.06,-32.61 625.25,-100 658.17,-134.04 682.93,-184.47 695.11,-212.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="691.84,-213.69 698.96,-221.54 698.29,-210.97 691.84,-213.69"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917" target="_top" xlink:title="Encrypt a given text using a given key.">
-<polygon fill="white" stroke="#666666" points="173.38,-323.25 77.12,-323.25 77.12,-292.75 173.38,-292.75 173.38,-323.25"/>
-<text text-anchor="start" x="85.12" y="-309.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="125.25" y="-298.5" font-family="Helvetica,sans-Serif" font-size="10.00">::encrypt_text</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge11_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.06,-287.35C45.95,-289.25 55.68,-291.58 65.73,-293.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.67,-297.33 75.21,-296.25 66.3,-290.52 64.67,-297.33"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="606.12,-204.62 552.62,-204.62 552.62,-185.38 606.12,-185.38 606.12,-204.62"/>
-<text text-anchor="middle" x="579.38" y="-191.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge13_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge13_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.79,-272.93C37.34,-261.59 54.54,-243.6 73.75,-235 157.26,-197.59 438.85,-194.57 540.98,-194.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="540.72,-198.25 550.73,-194.78 540.74,-191.25 540.72,-198.25"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5" target="_top" xlink:title="Generate encryption and decryption key pair.">
-<polygon fill="white" stroke="#666666" points="173.38,-274.25 77.12,-274.25 77.12,-243.75 173.38,-243.75 173.38,-274.25"/>
-<text text-anchor="start" x="85.12" y="-260.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="125.25" y="-249.5" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_keys</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge14_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge14_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.06,-278.82C45.95,-277 55.68,-274.77 65.73,-272.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.25,-275.93 75.21,-270.28 64.68,-269.11 66.25,-275.93"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa" target="_top" xlink:title="Convenience function to perform block cipher operations. The operations are identical for both encryp...">
-<polygon fill="white" stroke="#666666" points="326.25,-520.25 230,-520.25 230,-489.75 326.25,-489.75 326.25,-520.25"/>
-<text text-anchor="start" x="238" y="-506.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="278.12" y="-495.5" font-family="Helvetica,sans-Serif" font-size="10.00">::codec</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M164.05,-372.63C168.52,-375.14 172.86,-377.94 176.75,-381 212.64,-409.26 243.95,-452.57 261.68,-479.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.65,-481.58 266.98,-488.13 264.56,-477.81 258.65,-481.58"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41" target="_top" xlink:title="Get the index of a character in the STRKEY.">
-<polygon fill="white" stroke="#666666" points="486.62,-496.25 390.38,-496.25 390.38,-465.75 486.62,-465.75 486.62,-496.25"/>
-<text text-anchor="start" x="398.38" y="-482.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="438.5" y="-471.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_char_idx</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M326.64,-497.8C343.09,-495.31 361.71,-492.49 378.94,-489.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.16,-493.38 388.52,-488.42 378.11,-486.46 379.16,-493.38"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="484.38,-620.62 392.62,-620.62 392.62,-601.38 484.38,-601.38 484.38,-620.62"/>
-<text text-anchor="middle" x="438.5" y="-607.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M295.05,-520.53C313.96,-538.35 347.05,-567.61 379.5,-587 385.25,-590.44 391.59,-593.61 397.9,-596.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.41,-599.61 406.98,-600.29 399.14,-593.17 396.41,-599.61"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590" target="_top" xlink:title="helper function to perform vector multiplication with encryption or decryption matrix">
-<polygon fill="white" stroke="#666666" points="486.62,-545.25 390.38,-545.25 390.38,-514.75 486.62,-514.75 486.62,-545.25"/>
-<text text-anchor="start" x="398.38" y="-531.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="438.5" y="-520.5" font-family="Helvetica,sans-Serif" font-size="10.00">::mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M326.64,-512.5C343.09,-515.1 361.71,-518.04 378.94,-520.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="378.1,-524.17 388.52,-522.27 379.19,-517.25 378.1,-524.17"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge10_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge10_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.11,-520.59C322.75,-532.38 351.73,-547.58 379.5,-554 487.85,-579.03 549.6,-588.5 625.25,-507 693.37,-433.62 702.69,-305.02 703.6,-254.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="707.1,-254.54 703.67,-244.51 700.1,-254.49 707.1,-254.54"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="609.12,-460.62 549.62,-460.62 549.62,-441.38 609.12,-441.38 609.12,-460.62"/>
-<text text-anchor="middle" x="579.38" y="-447.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.9,-470.76C503.6,-467.15 522.18,-463.14 538.22,-459.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="538.87,-463.11 547.9,-457.58 537.39,-456.27 538.87,-463.11"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge9_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge9_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M478.65,-514.28C485.05,-511.39 491.53,-508.25 497.5,-505 518.14,-493.78 540.23,-478.81 556.1,-467.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="557.84,-470.54 563.88,-461.84 553.73,-464.87 557.84,-470.54"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge8_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge8_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.83,-526.53C528.53,-521.02 588.23,-506.78 625.25,-470 686.37,-409.27 699.75,-299.9 702.68,-254.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="706.17,-254.39 703.19,-244.23 699.18,-254.03 706.17,-254.39"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node4 -->
-<g id="edge12_Node000010_Node000004" class="edge">
-<title>Node10&#45;&gt;Node4</title>
-<g id="a_edge12_Node000010_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M164.26,-323.71C168.74,-326.44 173.03,-329.53 176.75,-333 200.4,-355.09 243.14,-436.85 264.4,-479.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.17,-480.55 268.76,-487.94 267.43,-477.43 261.17,-480.55"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="478.38,-247.62 398.62,-247.62 398.62,-228.38 478.38,-228.38 478.38,-247.62"/>
-<text text-anchor="middle" x="438.5" y="-234.12" font-family="Helvetica,sans-Serif" font-size="10.00">determinant_lu</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge15_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge15_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M173.86,-261.15C217.98,-262.54 285.35,-263.09 343.5,-257 357.87,-255.5 373.3,-252.83 387.43,-249.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="387.88,-253.44 396.94,-247.94 386.44,-246.59 387.88,-253.44"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706" target="_top" xlink:title="Generate decryption matrix from an encryption matrix key.">
-<polygon fill="white" stroke="#666666" points="343.5,-172.25 212.75,-172.25 212.75,-141.75 343.5,-141.75 343.5,-172.25"/>
-<text text-anchor="start" x="220.75" y="-158.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="278.12" y="-147.5" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_decryption_key</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node15 -->
-<g id="edge19_Node000012_Node000015" class="edge">
-<title>Node12&#45;&gt;Node15</title>
-<g id="a_edge19_Node000012_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M149.49,-243.29C174.97,-226.07 216.01,-198.32 244.66,-178.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.28,-182.08 252.6,-173.58 242.36,-176.28 246.28,-182.08"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e" target="_top" xlink:title="Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid...">
-<polygon fill="white" stroke="#666666" points="343.5,-372.25 212.75,-372.25 212.75,-341.75 343.5,-341.75 343.5,-372.25"/>
-<text text-anchor="start" x="220.75" y="-358.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="278.12" y="-347.5" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_encryption_key</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node19 -->
-<g id="edge28_Node000012_Node000019" class="edge">
-<title>Node12&#45;&gt;Node19</title>
-<g id="a_edge28_Node000012_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.82,-274.62C165.56,-277.57 171.39,-280.76 176.75,-284 202.1,-299.34 229.17,-319.26 248.81,-334.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.58,-337.12 256.62,-340.5 250.88,-331.59 246.58,-337.12"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="318.38,-247.62 237.88,-247.62 237.88,-228.38 318.38,-228.38 318.38,-247.62"/>
-<text text-anchor="middle" x="278.12" y="-234.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node25 -->
-<g id="edge35_Node000012_Node000025" class="edge">
-<title>Node12&#45;&gt;Node25</title>
-<g id="a_edge35_Node000012_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M173.57,-252.41C190.45,-250.06 209.51,-247.41 226.64,-245.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.65,-248.56 236.07,-243.71 225.68,-241.63 226.65,-248.56"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node9 -->
-<g id="edge18_Node000013_Node000009" class="edge">
-<title>Node13&#45;&gt;Node9</title>
-<g id="a_edge18_Node000013_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M478.74,-237.26C524.05,-236.4 598.84,-234.98 649.58,-234.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="649.54,-237.52 659.47,-233.83 649.4,-230.52 649.54,-237.52"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="625.25,-280.62 533.5,-280.62 533.5,-261.38 625.25,-261.38 625.25,-280.62"/>
-<text text-anchor="middle" x="579.38" y="-267.12" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge16_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge16_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M478.55,-247.28C493.01,-250.72 509.67,-254.67 525.17,-258.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="524.2,-261.72 534.74,-260.63 525.82,-254.91 524.2,-261.72"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node9 -->
-<g id="edge17_Node000014_Node000009" class="edge">
-<title>Node14&#45;&gt;Node9</title>
-<g id="a_edge17_Node000014_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M613.05,-260.92C627.49,-256.46 644.69,-251.15 660.18,-246.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="661.13,-249.74 669.66,-243.45 659.07,-243.05 661.13,-249.74"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node6 -->
-<g id="edge27_Node000015_Node000006" class="edge">
-<title>Node15&#45;&gt;Node6</title>
-<g id="a_edge27_Node000015_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M295.73,-172.59C308.85,-185.01 327.55,-202.92 343.5,-219 359.88,-235.52 359.81,-244.6 379.5,-257 426.12,-286.36 459.11,-255.48 497.5,-295 537.49,-336.16 500.3,-372.19 533.5,-419 537.71,-424.94 543.39,-430.18 549.29,-434.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="547.06,-437.32 557.3,-440.03 550.98,-431.53 547.06,-437.32"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node9 -->
-<g id="edge26_Node000015_Node000009" class="edge">
-<title>Node15&#45;&gt;Node9</title>
-<g id="a_edge26_Node000015_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.23,-141.44C316.26,-126.21 347.78,-104.01 379.5,-95 429.95,-80.68 446.24,-83.91 497.5,-95 558.45,-108.19 574.19,-117.21 625.25,-153 650.22,-170.5 673.98,-196.61 688.63,-214.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="685.8,-216.26 694.83,-221.81 691.23,-211.84 685.8,-216.26"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node13 -->
-<g id="edge20_Node000015_Node000013" class="edge">
-<title>Node15&#45;&gt;Node13</title>
-<g id="a_edge20_Node000015_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M309.66,-172.62C338.04,-187.13 380.02,-208.6 408.04,-222.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="406.2,-225.92 416.69,-227.36 409.38,-219.69 406.2,-225.92"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="464.12,-123.62 412.88,-123.62 412.88,-104.38 464.12,-104.38 464.12,-123.62"/>
-<text text-anchor="middle" x="438.5" y="-110.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge21_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge21_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.75,-141.35C358.38,-135.48 382.34,-128.98 401.47,-123.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="402.21,-127.21 410.94,-121.21 400.37,-120.45 402.21,-127.21"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="486.62,-172.25 390.38,-172.25 390.38,-141.75 486.62,-141.75 486.62,-172.25"/>
-<text text-anchor="start" x="398.38" y="-158.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="438.5" y="-147.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node17 -->
-<g id="edge22_Node000015_Node000017" class="edge">
-<title>Node15&#45;&gt;Node17</title>
-<g id="a_edge22_Node000015_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M344,-157C355.41,-157 367.23,-157 378.48,-157"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="378.43,-160.5 388.43,-157 378.43,-153.5 378.43,-160.5"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="468.25,-47.62 408.75,-47.62 408.75,-28.38 468.25,-28.38 468.25,-47.62"/>
-<text text-anchor="middle" x="438.5" y="-34.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node18 -->
-<g id="edge25_Node000015_Node000018" class="edge">
-<title>Node15&#45;&gt;Node18</title>
-<g id="a_edge25_Node000015_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.33,-141.35C310.3,-120.85 344.27,-84.84 379.5,-62 385.18,-58.32 391.52,-55.01 397.87,-52.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.21,-55.34 407.04,-48.21 396.47,-48.9 399.21,-55.34"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node9 -->
-<g id="edge24_Node000017_Node000009" class="edge">
-<title>Node17&#45;&gt;Node9</title>
-<g id="a_edge24_Node000017_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.86,-155.13C525.36,-155.17 580.45,-158.84 625.25,-176 648.13,-184.76 670.32,-202.02 685.19,-215.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="682.61,-217.65 692.33,-221.85 687.35,-212.5 682.61,-217.65"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node11 -->
-<g id="edge23_Node000017_Node000011" class="edge">
-<title>Node17&#45;&gt;Node11</title>
-<g id="a_edge23_Node000017_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.9,-169.97C504.65,-174.83 524.54,-180.27 541.23,-184.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="540.18,-188.18 550.75,-187.44 542.03,-181.43 540.18,-188.18"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node6 -->
-<g id="edge34_Node000019_Node000006" class="edge">
-<title>Node19&#45;&gt;Node6</title>
-<g id="a_edge34_Node000019_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.03,-372.61C318.44,-387 349.36,-407.78 379.5,-419 432,-438.55 496.66,-446.16 537.72,-449.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="537.43,-452.61 547.64,-449.77 537.89,-445.63 537.43,-452.61"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0" target="_top" xlink:title="Compute GCD of two integers using Euler&#39;s algorithm.">
-<polygon fill="white" stroke="#666666" points="497.5,-409.62 379.5,-409.62 379.5,-390.38 497.5,-390.38 497.5,-409.62"/>
-<text text-anchor="middle" x="438.5" y="-396.12" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher::gcd</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge29_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge29_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.75,-372.65C354,-377.33 372.72,-382.41 389.29,-386.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="388.35,-390.28 398.92,-389.53 390.19,-383.53 388.35,-390.28"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isfinite.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="470.5,-323.62 406.5,-323.62 406.5,-304.38 470.5,-304.38 470.5,-323.62"/>
-<text text-anchor="middle" x="438.5" y="-310.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::isfinite</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node22 -->
-<g id="edge31_Node000019_Node000022" class="edge">
-<title>Node19&#45;&gt;Node22</title>
-<g id="a_edge31_Node000019_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.75,-341.35C356.14,-336.09 377.4,-330.32 395.37,-325.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.17,-328.85 404.91,-322.85 394.34,-322.09 396.17,-328.85"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9" target="_top" xlink:title="Function to generate a random integer in a given interval.">
-<polygon fill="white" stroke="#666666" points="486.62,-372.25 390.38,-372.25 390.38,-341.75 486.62,-341.75 486.62,-372.25"/>
-<text text-anchor="start" x="398.38" y="-358.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="438.5" y="-347.5" font-family="Helvetica,sans-Serif" font-size="10.00">::rand_range</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node23 -->
-<g id="edge32_Node000019_Node000023" class="edge">
-<title>Node19&#45;&gt;Node23</title>
-<g id="a_edge32_Node000019_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M344,-357C355.41,-357 367.23,-357 378.48,-357"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="378.43,-360.5 388.43,-357 378.43,-353.5 378.43,-360.5"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="608.75,-409.62 550,-409.62 550,-390.38 608.75,-390.38 608.75,-409.62"/>
-<text text-anchor="middle" x="579.38" y="-396.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node21 -->
-<g id="edge30_Node000020_Node000021" class="edge">
-<title>Node20&#45;&gt;Node21</title>
-<g id="a_edge30_Node000020_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M497.99,-400C511.59,-400 525.76,-400 538.34,-400"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="538.34,-403.5 548.34,-400 538.34,-396.5 538.34,-403.5"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="606.5,-366.62 552.25,-366.62 552.25,-347.38 606.5,-347.38 606.5,-366.62"/>
-<text text-anchor="middle" x="579.38" y="-353.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node24 -->
-<g id="edge33_Node000023_Node000024" class="edge">
-<title>Node23&#45;&gt;Node24</title>
-<g id="a_edge33_Node000023_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.9,-357C504.36,-357 523.88,-357 540.39,-357"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="540.3,-360.5 550.3,-357 540.3,-353.5 540.3,-360.5"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph_org.svg b/d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph_org.svg
deleted file mode 100644
index 1609543d9..000000000
--- a/d7/db9/hill__cipher_8cpp_a3147ad576f8a94a2a6b66948672b452b_cgraph_org.svg
+++ /dev/null
@@ -1,571 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="756pt" height="629pt"
- viewBox="0.00 0.00 755.75 628.62" 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 624.62)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self test 1 &#45; using 3x3 randomly generated key.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-292.62 0,-292.62 0,-273.38 37.75,-273.38 37.75,-292.62"/>
-<text text-anchor="middle" x="18.88" y="-279.12" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-409.62 73.75,-409.62 73.75,-390.38 176.75,-390.38 176.75,-409.62"/>
-<text text-anchor="middle" x="125.25" y="-396.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.82,-293.12C29.02,-312.77 45.28,-356.33 73.75,-381 75.19,-382.24 76.71,-383.41 78.3,-384.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.24,-387.36 86.66,-389.25 79.69,-381.27 76.24,-387.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b" target="_top" xlink:title="Decrypt a given text using a given key.">
-<polygon fill="white" stroke="#666666" points="173.38,-372.25 77.12,-372.25 77.12,-341.75 173.38,-341.75 173.38,-372.25"/>
-<text text-anchor="start" x="85.12" y="-358.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="125.25" y="-347.5" font-family="Helvetica,sans-Serif" font-size="10.00">::decrypt_text</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.11,-292.91C39.33,-303.49 56.62,-320.31 73.75,-332 75.57,-333.24 77.46,-334.46 79.39,-335.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.56,-338.63 87.98,-340.54 81.03,-332.55 77.56,-338.63"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="747.75,-242.62 661.25,-242.62 661.25,-223.38 747.75,-223.38 747.75,-242.62"/>
-<text text-anchor="middle" x="704.5" y="-229.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge36_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge36_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.23,-272.93C40.71,-222.51 126.4,0 277.12,0 277.12,0 277.12,0 439.5,0 533.26,0 560.06,-32.61 625.25,-100 658.17,-134.04 682.93,-184.47 695.11,-212.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="691.84,-213.69 698.96,-221.54 698.29,-210.97 691.84,-213.69"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917" target="_top" xlink:title="Encrypt a given text using a given key.">
-<polygon fill="white" stroke="#666666" points="173.38,-323.25 77.12,-323.25 77.12,-292.75 173.38,-292.75 173.38,-323.25"/>
-<text text-anchor="start" x="85.12" y="-309.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="125.25" y="-298.5" font-family="Helvetica,sans-Serif" font-size="10.00">::encrypt_text</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge11_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.06,-287.35C45.95,-289.25 55.68,-291.58 65.73,-293.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.67,-297.33 75.21,-296.25 66.3,-290.52 64.67,-297.33"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="606.12,-204.62 552.62,-204.62 552.62,-185.38 606.12,-185.38 606.12,-204.62"/>
-<text text-anchor="middle" x="579.38" y="-191.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge13_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge13_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.79,-272.93C37.34,-261.59 54.54,-243.6 73.75,-235 157.26,-197.59 438.85,-194.57 540.98,-194.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="540.72,-198.25 550.73,-194.78 540.74,-191.25 540.72,-198.25"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5" target="_top" xlink:title="Generate encryption and decryption key pair.">
-<polygon fill="white" stroke="#666666" points="173.38,-274.25 77.12,-274.25 77.12,-243.75 173.38,-243.75 173.38,-274.25"/>
-<text text-anchor="start" x="85.12" y="-260.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="125.25" y="-249.5" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_keys</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge14_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge14_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.06,-278.82C45.95,-277 55.68,-274.77 65.73,-272.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.25,-275.93 75.21,-270.28 64.68,-269.11 66.25,-275.93"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa" target="_top" xlink:title="Convenience function to perform block cipher operations. The operations are identical for both encryp...">
-<polygon fill="white" stroke="#666666" points="326.25,-520.25 230,-520.25 230,-489.75 326.25,-489.75 326.25,-520.25"/>
-<text text-anchor="start" x="238" y="-506.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="278.12" y="-495.5" font-family="Helvetica,sans-Serif" font-size="10.00">::codec</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M164.05,-372.63C168.52,-375.14 172.86,-377.94 176.75,-381 212.64,-409.26 243.95,-452.57 261.68,-479.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.65,-481.58 266.98,-488.13 264.56,-477.81 258.65,-481.58"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41" target="_top" xlink:title="Get the index of a character in the STRKEY.">
-<polygon fill="white" stroke="#666666" points="486.62,-496.25 390.38,-496.25 390.38,-465.75 486.62,-465.75 486.62,-496.25"/>
-<text text-anchor="start" x="398.38" y="-482.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="438.5" y="-471.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_char_idx</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M326.64,-497.8C343.09,-495.31 361.71,-492.49 378.94,-489.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.16,-493.38 388.52,-488.42 378.11,-486.46 379.16,-493.38"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="484.38,-620.62 392.62,-620.62 392.62,-601.38 484.38,-601.38 484.38,-620.62"/>
-<text text-anchor="middle" x="438.5" y="-607.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M295.05,-520.53C313.96,-538.35 347.05,-567.61 379.5,-587 385.25,-590.44 391.59,-593.61 397.9,-596.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.41,-599.61 406.98,-600.29 399.14,-593.17 396.41,-599.61"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590" target="_top" xlink:title="helper function to perform vector multiplication with encryption or decryption matrix">
-<polygon fill="white" stroke="#666666" points="486.62,-545.25 390.38,-545.25 390.38,-514.75 486.62,-514.75 486.62,-545.25"/>
-<text text-anchor="start" x="398.38" y="-531.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="438.5" y="-520.5" font-family="Helvetica,sans-Serif" font-size="10.00">::mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M326.64,-512.5C343.09,-515.1 361.71,-518.04 378.94,-520.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="378.1,-524.17 388.52,-522.27 379.19,-517.25 378.1,-524.17"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge10_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge10_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.11,-520.59C322.75,-532.38 351.73,-547.58 379.5,-554 487.85,-579.03 549.6,-588.5 625.25,-507 693.37,-433.62 702.69,-305.02 703.6,-254.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="707.1,-254.54 703.67,-244.51 700.1,-254.49 707.1,-254.54"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="609.12,-460.62 549.62,-460.62 549.62,-441.38 609.12,-441.38 609.12,-460.62"/>
-<text text-anchor="middle" x="579.38" y="-447.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.9,-470.76C503.6,-467.15 522.18,-463.14 538.22,-459.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="538.87,-463.11 547.9,-457.58 537.39,-456.27 538.87,-463.11"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge9_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge9_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M478.65,-514.28C485.05,-511.39 491.53,-508.25 497.5,-505 518.14,-493.78 540.23,-478.81 556.1,-467.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="557.84,-470.54 563.88,-461.84 553.73,-464.87 557.84,-470.54"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge8_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge8_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.83,-526.53C528.53,-521.02 588.23,-506.78 625.25,-470 686.37,-409.27 699.75,-299.9 702.68,-254.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="706.17,-254.39 703.19,-244.23 699.18,-254.03 706.17,-254.39"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node4 -->
-<g id="edge12_Node000010_Node000004" class="edge">
-<title>Node10&#45;&gt;Node4</title>
-<g id="a_edge12_Node000010_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M164.26,-323.71C168.74,-326.44 173.03,-329.53 176.75,-333 200.4,-355.09 243.14,-436.85 264.4,-479.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.17,-480.55 268.76,-487.94 267.43,-477.43 261.17,-480.55"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="478.38,-247.62 398.62,-247.62 398.62,-228.38 478.38,-228.38 478.38,-247.62"/>
-<text text-anchor="middle" x="438.5" y="-234.12" font-family="Helvetica,sans-Serif" font-size="10.00">determinant_lu</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge15_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge15_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M173.86,-261.15C217.98,-262.54 285.35,-263.09 343.5,-257 357.87,-255.5 373.3,-252.83 387.43,-249.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="387.88,-253.44 396.94,-247.94 386.44,-246.59 387.88,-253.44"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706" target="_top" xlink:title="Generate decryption matrix from an encryption matrix key.">
-<polygon fill="white" stroke="#666666" points="343.5,-172.25 212.75,-172.25 212.75,-141.75 343.5,-141.75 343.5,-172.25"/>
-<text text-anchor="start" x="220.75" y="-158.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="278.12" y="-147.5" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_decryption_key</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node15 -->
-<g id="edge19_Node000012_Node000015" class="edge">
-<title>Node12&#45;&gt;Node15</title>
-<g id="a_edge19_Node000012_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M149.49,-243.29C174.97,-226.07 216.01,-198.32 244.66,-178.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.28,-182.08 252.6,-173.58 242.36,-176.28 246.28,-182.08"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e" target="_top" xlink:title="Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid...">
-<polygon fill="white" stroke="#666666" points="343.5,-372.25 212.75,-372.25 212.75,-341.75 343.5,-341.75 343.5,-372.25"/>
-<text text-anchor="start" x="220.75" y="-358.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="278.12" y="-347.5" font-family="Helvetica,sans-Serif" font-size="10.00">::generate_encryption_key</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node19 -->
-<g id="edge28_Node000012_Node000019" class="edge">
-<title>Node12&#45;&gt;Node19</title>
-<g id="a_edge28_Node000012_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.82,-274.62C165.56,-277.57 171.39,-280.76 176.75,-284 202.1,-299.34 229.17,-319.26 248.81,-334.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.58,-337.12 256.62,-340.5 250.88,-331.59 246.58,-337.12"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="318.38,-247.62 237.88,-247.62 237.88,-228.38 318.38,-228.38 318.38,-247.62"/>
-<text text-anchor="middle" x="278.12" y="-234.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node25 -->
-<g id="edge35_Node000012_Node000025" class="edge">
-<title>Node12&#45;&gt;Node25</title>
-<g id="a_edge35_Node000012_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M173.57,-252.41C190.45,-250.06 209.51,-247.41 226.64,-245.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.65,-248.56 236.07,-243.71 225.68,-241.63 226.65,-248.56"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node9 -->
-<g id="edge18_Node000013_Node000009" class="edge">
-<title>Node13&#45;&gt;Node9</title>
-<g id="a_edge18_Node000013_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M478.74,-237.26C524.05,-236.4 598.84,-234.98 649.58,-234.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="649.54,-237.52 659.47,-233.83 649.4,-230.52 649.54,-237.52"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="625.25,-280.62 533.5,-280.62 533.5,-261.38 625.25,-261.38 625.25,-280.62"/>
-<text text-anchor="middle" x="579.38" y="-267.12" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge16_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge16_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M478.55,-247.28C493.01,-250.72 509.67,-254.67 525.17,-258.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="524.2,-261.72 534.74,-260.63 525.82,-254.91 524.2,-261.72"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node9 -->
-<g id="edge17_Node000014_Node000009" class="edge">
-<title>Node14&#45;&gt;Node9</title>
-<g id="a_edge17_Node000014_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M613.05,-260.92C627.49,-256.46 644.69,-251.15 660.18,-246.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="661.13,-249.74 669.66,-243.45 659.07,-243.05 661.13,-249.74"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node6 -->
-<g id="edge27_Node000015_Node000006" class="edge">
-<title>Node15&#45;&gt;Node6</title>
-<g id="a_edge27_Node000015_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M295.73,-172.59C308.85,-185.01 327.55,-202.92 343.5,-219 359.88,-235.52 359.81,-244.6 379.5,-257 426.12,-286.36 459.11,-255.48 497.5,-295 537.49,-336.16 500.3,-372.19 533.5,-419 537.71,-424.94 543.39,-430.18 549.29,-434.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="547.06,-437.32 557.3,-440.03 550.98,-431.53 547.06,-437.32"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node9 -->
-<g id="edge26_Node000015_Node000009" class="edge">
-<title>Node15&#45;&gt;Node9</title>
-<g id="a_edge26_Node000015_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.23,-141.44C316.26,-126.21 347.78,-104.01 379.5,-95 429.95,-80.68 446.24,-83.91 497.5,-95 558.45,-108.19 574.19,-117.21 625.25,-153 650.22,-170.5 673.98,-196.61 688.63,-214.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="685.8,-216.26 694.83,-221.81 691.23,-211.84 685.8,-216.26"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node13 -->
-<g id="edge20_Node000015_Node000013" class="edge">
-<title>Node15&#45;&gt;Node13</title>
-<g id="a_edge20_Node000015_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M309.66,-172.62C338.04,-187.13 380.02,-208.6 408.04,-222.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="406.2,-225.92 416.69,-227.36 409.38,-219.69 406.2,-225.92"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="464.12,-123.62 412.88,-123.62 412.88,-104.38 464.12,-104.38 464.12,-123.62"/>
-<text text-anchor="middle" x="438.5" y="-110.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge21_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge21_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.75,-141.35C358.38,-135.48 382.34,-128.98 401.47,-123.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="402.21,-127.21 410.94,-121.21 400.37,-120.45 402.21,-127.21"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="486.62,-172.25 390.38,-172.25 390.38,-141.75 486.62,-141.75 486.62,-172.25"/>
-<text text-anchor="start" x="398.38" y="-158.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="438.5" y="-147.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node17 -->
-<g id="edge22_Node000015_Node000017" class="edge">
-<title>Node15&#45;&gt;Node17</title>
-<g id="a_edge22_Node000015_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M344,-157C355.41,-157 367.23,-157 378.48,-157"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="378.43,-160.5 388.43,-157 378.43,-153.5 378.43,-160.5"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="468.25,-47.62 408.75,-47.62 408.75,-28.38 468.25,-28.38 468.25,-47.62"/>
-<text text-anchor="middle" x="438.5" y="-34.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node18 -->
-<g id="edge25_Node000015_Node000018" class="edge">
-<title>Node15&#45;&gt;Node18</title>
-<g id="a_edge25_Node000015_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.33,-141.35C310.3,-120.85 344.27,-84.84 379.5,-62 385.18,-58.32 391.52,-55.01 397.87,-52.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.21,-55.34 407.04,-48.21 396.47,-48.9 399.21,-55.34"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node9 -->
-<g id="edge24_Node000017_Node000009" class="edge">
-<title>Node17&#45;&gt;Node9</title>
-<g id="a_edge24_Node000017_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.86,-155.13C525.36,-155.17 580.45,-158.84 625.25,-176 648.13,-184.76 670.32,-202.02 685.19,-215.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="682.61,-217.65 692.33,-221.85 687.35,-212.5 682.61,-217.65"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node11 -->
-<g id="edge23_Node000017_Node000011" class="edge">
-<title>Node17&#45;&gt;Node11</title>
-<g id="a_edge23_Node000017_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.9,-169.97C504.65,-174.83 524.54,-180.27 541.23,-184.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="540.18,-188.18 550.75,-187.44 542.03,-181.43 540.18,-188.18"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node6 -->
-<g id="edge34_Node000019_Node000006" class="edge">
-<title>Node19&#45;&gt;Node6</title>
-<g id="a_edge34_Node000019_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.03,-372.61C318.44,-387 349.36,-407.78 379.5,-419 432,-438.55 496.66,-446.16 537.72,-449.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="537.43,-452.61 547.64,-449.77 537.89,-445.63 537.43,-452.61"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0" target="_top" xlink:title="Compute GCD of two integers using Euler&#39;s algorithm.">
-<polygon fill="white" stroke="#666666" points="497.5,-409.62 379.5,-409.62 379.5,-390.38 497.5,-390.38 497.5,-409.62"/>
-<text text-anchor="middle" x="438.5" y="-396.12" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher::gcd</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge29_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge29_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.75,-372.65C354,-377.33 372.72,-382.41 389.29,-386.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="388.35,-390.28 398.92,-389.53 390.19,-383.53 388.35,-390.28"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isfinite.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="470.5,-323.62 406.5,-323.62 406.5,-304.38 470.5,-304.38 470.5,-323.62"/>
-<text text-anchor="middle" x="438.5" y="-310.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::isfinite</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node22 -->
-<g id="edge31_Node000019_Node000022" class="edge">
-<title>Node19&#45;&gt;Node22</title>
-<g id="a_edge31_Node000019_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.75,-341.35C356.14,-336.09 377.4,-330.32 395.37,-325.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.17,-328.85 404.91,-322.85 394.34,-322.09 396.17,-328.85"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9" target="_top" xlink:title="Function to generate a random integer in a given interval.">
-<polygon fill="white" stroke="#666666" points="486.62,-372.25 390.38,-372.25 390.38,-341.75 486.62,-341.75 486.62,-372.25"/>
-<text text-anchor="start" x="398.38" y="-358.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::HillCipher</text>
-<text text-anchor="middle" x="438.5" y="-347.5" font-family="Helvetica,sans-Serif" font-size="10.00">::rand_range</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node23 -->
-<g id="edge32_Node000019_Node000023" class="edge">
-<title>Node19&#45;&gt;Node23</title>
-<g id="a_edge32_Node000019_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M344,-357C355.41,-357 367.23,-357 378.48,-357"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="378.43,-360.5 388.43,-357 378.43,-353.5 378.43,-360.5"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="608.75,-409.62 550,-409.62 550,-390.38 608.75,-390.38 608.75,-409.62"/>
-<text text-anchor="middle" x="579.38" y="-396.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node21 -->
-<g id="edge30_Node000020_Node000021" class="edge">
-<title>Node20&#45;&gt;Node21</title>
-<g id="a_edge30_Node000020_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M497.99,-400C511.59,-400 525.76,-400 538.34,-400"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="538.34,-403.5 548.34,-400 538.34,-396.5 538.34,-403.5"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="606.5,-366.62 552.25,-366.62 552.25,-347.38 606.5,-347.38 606.5,-366.62"/>
-<text text-anchor="middle" x="579.38" y="-353.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node24 -->
-<g id="edge33_Node000023_Node000024" class="edge">
-<title>Node23&#45;&gt;Node24</title>
-<g id="a_edge33_Node000023_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M486.9,-357C504.36,-357 523.88,-357 540.39,-357"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="540.3,-360.5 550.3,-357 540.3,-353.5 540.3,-360.5"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.map b/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.map
deleted file mode 100644
index 6f2d94231..000000000
--- a/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="operator&lt;&lt;" name="operator&lt;&lt;">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,104,90,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="160,5,231,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="60,102,93,72,136,40,144,35,147,40,139,44,96,76,64,106"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/left.html#" title=" " alt="" coords="163,55,228,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="88,101,147,81,149,86,89,106"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setfill.html#" title=" " alt="" coords="156,104,234,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="90,114,141,114,141,120,90,120"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setw.html#" title=" " alt="" coords="158,153,233,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="89,128,144,146,142,151,88,133"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="138,203,253,228"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="64,128,96,158,139,189,146,193,143,198,136,194,93,162,60,132"/>
-</map>
diff --git a/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.md5 b/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.md5
deleted file mode 100644
index 75081c87e..000000000
--- a/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-58ca71fcfc592d99f44ef2bc0f19eadc
\ No newline at end of file
diff --git a/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.svg b/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.svg
deleted file mode 100644
index bce2b74b3..000000000
--- a/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator&lt;&lt; Pages: 1 -->
-<svg width="194pt" height="175pt"
- viewBox="0.00 0.00 193.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="63.25,-93.25 0,-93.25 0,-74 63.25,-74 63.25,-93.25"/>
-<text text-anchor="middle" x="31.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="169.25,-167.25 115.75,-167.25 115.75,-148 169.25,-148 169.25,-167.25"/>
-<text text-anchor="middle" x="142.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.28,-93.36C54.64,-105.42 77.11,-126.02 99.25,-139.62 101.14,-140.78 103.11,-141.9 105.13,-142.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.53,-146.09 114.06,-147.29 106.58,-139.79 103.53,-146.09"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/left.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="167,-130.25 118,-130.25 118,-111 167,-111 167,-130.25"/>
-<text text-anchor="middle" x="142.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::left</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.38,-93.74C76.22,-98.44 92.77,-104.07 107.15,-108.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.61,-112.13 116.21,-112.03 107.87,-105.5 105.61,-112.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="171.88,-93.25 113.12,-93.25 113.12,-74 171.88,-74 171.88,-93.25"/>
-<text text-anchor="middle" x="142.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.53,-83.62C75.37,-83.62 89.05,-83.62 101.62,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.24,-87.13 111.24,-83.63 101.24,-80.13 101.24,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170.75,-56.25 114.25,-56.25 114.25,-37 170.75,-37 170.75,-56.25"/>
-<text text-anchor="middle" x="142.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.38,-73.51C74.97,-69.24 89.8,-64.2 103.19,-59.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="104.25,-62.98 112.59,-56.45 102,-56.35 104.25,-62.98"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="185.75,-19.25 99.25,-19.25 99.25,0 185.75,0 185.75,-19.25"/>
-<text text-anchor="middle" x="142.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.28,-73.89C54.64,-61.83 77.11,-41.23 99.25,-27.62 100.88,-26.62 102.59,-25.65 104.33,-24.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.74,-27.91 113.17,-20.36 102.65,-21.63 105.74,-27.91"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph_org.svg b/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph_org.svg
deleted file mode 100644
index c9968ec45..000000000
--- a/d7/db9/hill__cipher_8cpp_a34bfcd756610834acac501f9eea1e2eb_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator&lt;&lt; Pages: 1 -->
-<svg width="194pt" height="175pt"
- viewBox="0.00 0.00 193.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="63.25,-93.25 0,-93.25 0,-74 63.25,-74 63.25,-93.25"/>
-<text text-anchor="middle" x="31.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="169.25,-167.25 115.75,-167.25 115.75,-148 169.25,-148 169.25,-167.25"/>
-<text text-anchor="middle" x="142.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.28,-93.36C54.64,-105.42 77.11,-126.02 99.25,-139.62 101.14,-140.78 103.11,-141.9 105.13,-142.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.53,-146.09 114.06,-147.29 106.58,-139.79 103.53,-146.09"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/left.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="167,-130.25 118,-130.25 118,-111 167,-111 167,-130.25"/>
-<text text-anchor="middle" x="142.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::left</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.38,-93.74C76.22,-98.44 92.77,-104.07 107.15,-108.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.61,-112.13 116.21,-112.03 107.87,-105.5 105.61,-112.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="171.88,-93.25 113.12,-93.25 113.12,-74 171.88,-74 171.88,-93.25"/>
-<text text-anchor="middle" x="142.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.53,-83.62C75.37,-83.62 89.05,-83.62 101.62,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.24,-87.13 111.24,-83.63 101.24,-80.13 101.24,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170.75,-56.25 114.25,-56.25 114.25,-37 170.75,-37 170.75,-56.25"/>
-<text text-anchor="middle" x="142.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.38,-73.51C74.97,-69.24 89.8,-64.2 103.19,-59.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="104.25,-62.98 112.59,-56.45 102,-56.35 104.25,-62.98"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="185.75,-19.25 99.25,-19.25 99.25,0 185.75,0 185.75,-19.25"/>
-<text text-anchor="middle" x="142.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.28,-73.89C54.64,-61.83 77.11,-41.23 99.25,-27.62 100.88,-26.62 102.59,-25.65 104.33,-24.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.74,-27.91 113.17,-20.36 102.65,-21.63 105.74,-27.91"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 5e986514b..000000000
--- a/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,40 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,129,55,155"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="103,31,182,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="40,127,67,98,101,65,104,63,107,67,104,70,70,101,44,131"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/strlen.html#" title=" " alt="" coords="103,80,182,106"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="54,129,96,110,99,115,56,134"/>
-<area shape="rect" id="Node000004" href="$d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" title="Self&#45;test implementations, 1st test." alt="" coords="117,179,168,204"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,150,104,172,102,177,54,155"/>
-<area shape="rect" id="Node000015" href="$d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" title="Self&#45;implementations, 2nd test." alt="" coords="117,129,168,155"/>
-<area shape="poly" id="edge19_Node000001_Node000015" title=" " alt="" coords="55,140,102,140,102,145,55,145"/>
-<area shape="rect" id="Node000016" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="106,228,178,254"/>
-<area shape="poly" id="edge22_Node000001_Node000016" title=" " alt="" coords="44,153,70,183,104,215,107,217,104,221,101,219,67,187,40,157"/>
-<area shape="rect" id="Node000005" href="$dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" title="prints the minimum, maximum and size of the set to which i belongs to" alt="" coords="248,104,316,130"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="166,176,242,135,244,140,169,181"/>
-<area shape="rect" id="Node000010" href="$dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="230,203,334,228"/>
-<area shape="poly" id="edge12_Node000004_Node000010" title=" " alt="" coords="168,193,215,201,214,207,167,198"/>
-<area shape="rect" id="Node000006" href="$dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" title="A utility function that returns the max element of the set to which i belongs to." alt="" coords="382,55,483,80"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="316,103,376,83,377,88,317,108"/>
-<area shape="rect" id="Node000008" href="$dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" title="A utility function that returns the min element of the set to which i belongs to." alt="" coords="384,104,481,130"/>
-<area shape="poly" id="edge8_Node000005_Node000008" title=" " alt="" coords="317,114,369,114,369,120,317,120"/>
-<area shape="rect" id="Node000009" href="$dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" title="A utility function that returns the size of the set to which i belongs to." alt="" coords="395,5,470,31"/>
-<area shape="poly" id="edge10_Node000005_Node000009" title=" " alt="" coords="297,102,334,72,381,40,387,36,390,41,384,44,338,76,301,106"/>
-<area shape="rect" id="Node000007" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="531,104,622,130"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="473,78,523,96,521,101,472,83"/>
-<area shape="poly" id="edge7_Node000007_Node000007" title=" " alt="" coords="551,105,547,95,550,86,560,80,576,77,594,80,603,87,600,91,592,85,576,83,562,85,554,89,552,95,556,102"/>
-<area shape="poly" id="edge9_Node000008_Node000007" title=" " alt="" coords="481,114,515,114,515,120,481,120"/>
-<area shape="poly" id="edge11_Node000009_Node000007" title=" " alt="" coords="465,29,484,40,551,92,548,96,481,44,463,34"/>
-<area shape="poly" id="edge13_Node000010_Node000007" title=" " alt="" coords="297,227,333,260,357,276,383,288,411,297,434,301,456,299,481,288,499,274,515,258,540,219,557,179,567,144,572,145,562,181,545,222,519,261,503,278,484,292,457,304,434,307,410,302,381,293,355,280,330,264,294,231"/>
-<area shape="rect" id="Node000011" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="385,353,480,379"/>
-<area shape="poly" id="edge14_Node000010_Node000011" title=" " alt="" coords="295,227,331,276,384,332,397,342,394,346,381,336,327,279,290,230"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="396,203,469,228"/>
-<area shape="poly" id="edge16_Node000010_Node000012" title=" " alt="" coords="335,213,381,213,381,218,335,218"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="398,252,467,278"/>
-<area shape="poly" id="edge17_Node000010_Node000013" title=" " alt="" coords="325,226,385,246,383,252,323,232"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="393,153,472,179"/>
-<area shape="poly" id="edge18_Node000010_Node000014" title=" " alt="" coords="323,199,378,181,379,186,325,205"/>
-<area shape="poly" id="edge15_Node000011_Node000007" title=" " alt="" coords="459,351,481,332,513,285,537,233,555,184,566,144,571,145,560,186,542,235,517,288,485,336,462,355"/>
-<area shape="poly" id="edge20_Node000015_Node000005" title=" " alt="" coords="167,135,232,123,233,128,168,140"/>
-<area shape="poly" id="edge21_Node000015_Node000010" title=" " alt="" coords="169,153,244,193,241,197,166,157"/>
-</map>
diff --git a/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 8aa1c2bad..000000000
--- a/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c01027a5222d649cdb49750ad242b31b
\ No newline at end of file
diff --git a/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 8e117d1c4..000000000
--- a/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,380 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="471pt" height="288pt"
- viewBox="0.00 0.00 470.50 288.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 284.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-187.25 0,-187.25 0,-168 37,-168 37,-187.25"/>
-<text text-anchor="middle" x="18.5" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-261.25 73,-261.25 73,-242 132.5,-242 132.5,-261.25"/>
-<text text-anchor="middle" x="102.75" y="-247.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.56,-187.45C37.5,-199.23 55.28,-219.18 73,-233.62 73.65,-234.16 74.32,-234.68 75,-235.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.79,-237.93 83,-240.77 76.79,-232.19 72.79,-237.93"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-224.25 73,-224.25 73,-205 132.5,-205 132.5,-224.25"/>
-<text text-anchor="middle" x="102.75" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-185.65C46.63,-189.83 58.28,-195.07 69.1,-199.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.6,-203.1 78.15,-204.01 70.47,-196.72 67.6,-203.1"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title="Self&#45;test implementations, 1st test.">
-<polygon fill="white" stroke="#666666" points="121.62,-150.25 83.88,-150.25 83.88,-131 121.62,-131 121.62,-150.25"/>
-<text text-anchor="middle" x="102.75" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-169.6C47.84,-164.88 61.34,-158.8 73.27,-153.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.59,-156.68 82.27,-149.39 71.72,-150.3 74.59,-156.68"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title="Self&#45;implementations, 2nd test.">
-<polygon fill="white" stroke="#666666" points="121.62,-187.25 83.88,-187.25 83.88,-168 121.62,-168 121.62,-187.25"/>
-<text text-anchor="middle" x="102.75" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node15 -->
-<g id="edge19_Node000001_Node000015" class="edge">
-<title>Node1&#45;&gt;Node15</title>
-<g id="a_edge19_Node000001_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-177.62C47.52,-177.62 60.52,-177.62 72.17,-177.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.14,-181.13 82.14,-177.63 72.14,-174.13 72.14,-181.13"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-113.25 75.62,-113.25 75.62,-94 129.88,-94 129.88,-113.25"/>
-<text text-anchor="middle" x="102.75" y="-99.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge22_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge22_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.56,-167.8C37.5,-156.02 55.28,-136.07 73,-121.62 73.65,-121.09 74.32,-120.57 75,-120.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.79,-123.06 83,-114.48 72.79,-117.32 76.79,-123.06"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
-<polygon fill="white" stroke="#666666" points="233.25,-206.25 182,-206.25 182,-187 233.25,-187 233.25,-206.25"/>
-<text text-anchor="middle" x="207.62" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.67,-150.38C137.26,-158.87 160.13,-171.32 178.21,-181.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.43,-184.17 186.89,-185.88 179.78,-178.03 176.43,-184.17"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="246.75,-132.25 168.5,-132.25 168.5,-113 246.75,-113 246.75,-132.25"/>
-<text text-anchor="middle" x="207.62" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node10 -->
-<g id="edge12_Node000004_Node000010" class="edge">
-<title>Node4&#45;&gt;Node10</title>
-<g id="a_edge12_Node000004_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.67,-137.49C131.55,-135.76 144.36,-133.52 157.02,-131.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.3,-134.81 166.54,-129.64 156.09,-127.91 157.3,-134.81"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="358,-243.25 282.75,-243.25 282.75,-224 358,-224 358,-243.25"/>
-<text text-anchor="middle" x="320.38" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M233.48,-204.93C246.72,-209.35 263.35,-214.91 278.43,-219.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.05,-223.17 287.64,-223.02 279.27,-216.54 277.05,-223.17"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="356.5,-206.25 284.25,-206.25 284.25,-187 356.5,-187 356.5,-206.25"/>
-<text text-anchor="middle" x="320.38" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge8_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge8_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M233.48,-196.62C245.14,-196.62 259.42,-196.62 272.97,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.59,-200.13 282.59,-196.63 272.59,-193.13 272.59,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="348.25,-280.25 292.5,-280.25 292.5,-261 348.25,-261 348.25,-280.25"/>
-<text text-anchor="middle" x="320.38" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge10_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge10_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.2,-206.47C234.38,-218.27 259.4,-238.25 282.75,-252.62 284.18,-253.51 285.67,-254.38 287.18,-255.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.51,-258.32 295.98,-259.92 288.79,-252.14 285.51,-258.32"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="462.5,-206.25 394,-206.25 394,-187 462.5,-187 462.5,-206.25"/>
-<text text-anchor="middle" x="428.25" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M350.31,-223.51C361.86,-219.48 375.35,-214.76 387.78,-210.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="388.64,-213.83 396.93,-207.22 386.33,-207.22 388.64,-213.83"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M411.36,-206.54C403.66,-215.15 409.29,-224.25 428.25,-224.25 438.62,-224.25 445,-221.53 447.4,-217.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="450.86,-217.12 445.44,-208.02 444,-218.52 450.86,-217.12"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge9_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge9_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M356.92,-196.62C365.1,-196.62 373.9,-196.62 382.42,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="382.25,-200.13 392.25,-196.63 382.25,-193.13 382.25,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge11_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge11_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.89,-260.55C348.66,-258.14 353.58,-255.45 358,-252.62 376,-241.13 394.73,-225.74 408.17,-214"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="410.27,-216.81 415.42,-207.55 405.62,-211.58 410.27,-216.81"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node7 -->
-<g id="edge13_Node000010_Node000007" class="edge">
-<title>Node10&#45;&gt;Node7</title>
-<g id="a_edge13_Node000010_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M217.49,-112.74C230.33,-99.26 255.53,-75.75 282.75,-66.62 314.46,-55.99 329.33,-49.41 358,-66.62 397.7,-90.46 415.88,-145.6 423.13,-175.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="419.64,-176.29 425.2,-185.31 426.48,-174.79 419.64,-176.29"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="355.75,-19.25 285,-19.25 285,0 355.75,0 355.75,-19.25"/>
-<text text-anchor="middle" x="320.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge14_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge14_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M215.37,-112.72C227.5,-95.37 254.38,-58.92 282.75,-33.62 285.73,-30.96 289.04,-28.38 292.4,-25.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.23,-28.95 300.59,-20.47 290.33,-23.14 294.23,-28.95"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="347.5,-132.25 293.25,-132.25 293.25,-113 347.5,-113 347.5,-132.25"/>
-<text text-anchor="middle" x="320.38" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node12 -->
-<g id="edge16_Node000010_Node000012" class="edge">
-<title>Node10&#45;&gt;Node12</title>
-<g id="a_edge16_Node000010_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M247.05,-122.62C258.27,-122.62 270.52,-122.62 281.69,-122.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.35,-126.13 291.35,-122.63 281.35,-119.13 281.35,-126.13"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="346,-95.25 294.75,-95.25 294.75,-76 346,-76 346,-95.25"/>
-<text text-anchor="middle" x="320.38" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node13 -->
-<g id="edge17_Node000010_Node000013" class="edge">
-<title>Node10&#45;&gt;Node13</title>
-<g id="a_edge17_Node000010_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M238.89,-112.51C252.77,-107.88 269.32,-102.35 283.8,-97.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.57,-100.94 292.95,-94.45 282.35,-94.3 284.57,-100.94"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="349.75,-169.25 291,-169.25 291,-150 349.75,-150 349.75,-169.25"/>
-<text text-anchor="middle" x="320.38" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node14 -->
-<g id="edge18_Node000010_Node000014" class="edge">
-<title>Node10&#45;&gt;Node14</title>
-<g id="a_edge18_Node000010_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M238.89,-132.74C251.5,-136.95 266.31,-141.9 279.77,-146.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.64,-149.71 289.24,-149.56 280.86,-143.07 278.64,-149.71"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node7 -->
-<g id="edge15_Node000011_Node000007" class="edge">
-<title>Node11&#45;&gt;Node7</title>
-<g id="a_edge15_Node000011_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M341.31,-19.71C347.26,-23.45 353.42,-28.14 358,-33.62 394.37,-77.14 414.28,-142.56 422.57,-175.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="419.12,-176.36 424.84,-185.29 425.93,-174.75 419.12,-176.36"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node5 -->
-<g id="edge20_Node000015_Node000005" class="edge">
-<title>Node15&#45;&gt;Node5</title>
-<g id="a_edge20_Node000015_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.67,-180.93C135.14,-183.42 154.04,-186.91 170.6,-189.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.63,-193.35 180.1,-191.73 170.9,-186.47 169.63,-193.35"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node10 -->
-<g id="edge21_Node000015_Node000010" class="edge">
-<title>Node15&#45;&gt;Node10</title>
-<g id="a_edge21_Node000015_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.67,-168.04C137.16,-159.76 159.85,-147.63 177.88,-137.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.36,-141.17 186.53,-133.37 176.06,-134.99 179.36,-141.17"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 9dbf665b6..000000000
--- a/d7/db9/hill__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,354 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="471pt" height="288pt"
- viewBox="0.00 0.00 470.50 288.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 284.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-187.25 0,-187.25 0,-168 37,-168 37,-187.25"/>
-<text text-anchor="middle" x="18.5" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-261.25 73,-261.25 73,-242 132.5,-242 132.5,-261.25"/>
-<text text-anchor="middle" x="102.75" y="-247.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.56,-187.45C37.5,-199.23 55.28,-219.18 73,-233.62 73.65,-234.16 74.32,-234.68 75,-235.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.79,-237.93 83,-240.77 76.79,-232.19 72.79,-237.93"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strlen.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-224.25 73,-224.25 73,-205 132.5,-205 132.5,-224.25"/>
-<text text-anchor="middle" x="102.75" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strlen</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-185.65C46.63,-189.83 58.28,-195.07 69.1,-199.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.6,-203.1 78.15,-204.01 70.47,-196.72 67.6,-203.1"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title="Self&#45;test implementations, 1st test.">
-<polygon fill="white" stroke="#666666" points="121.62,-150.25 83.88,-150.25 83.88,-131 121.62,-131 121.62,-150.25"/>
-<text text-anchor="middle" x="102.75" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-169.6C47.84,-164.88 61.34,-158.8 73.27,-153.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.59,-156.68 82.27,-149.39 71.72,-150.3 74.59,-156.68"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title="Self&#45;implementations, 2nd test.">
-<polygon fill="white" stroke="#666666" points="121.62,-187.25 83.88,-187.25 83.88,-168 121.62,-168 121.62,-187.25"/>
-<text text-anchor="middle" x="102.75" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node15 -->
-<g id="edge19_Node000001_Node000015" class="edge">
-<title>Node1&#45;&gt;Node15</title>
-<g id="a_edge19_Node000001_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-177.62C47.52,-177.62 60.52,-177.62 72.17,-177.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.14,-181.13 82.14,-177.63 72.14,-174.13 72.14,-181.13"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-113.25 75.62,-113.25 75.62,-94 129.88,-94 129.88,-113.25"/>
-<text text-anchor="middle" x="102.75" y="-99.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge22_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge22_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.56,-167.8C37.5,-156.02 55.28,-136.07 73,-121.62 73.65,-121.09 74.32,-120.57 75,-120.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.79,-123.06 83,-114.48 72.79,-117.32 76.79,-123.06"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
-<polygon fill="white" stroke="#666666" points="233.25,-206.25 182,-206.25 182,-187 233.25,-187 233.25,-206.25"/>
-<text text-anchor="middle" x="207.62" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.67,-150.38C137.26,-158.87 160.13,-171.32 178.21,-181.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.43,-184.17 186.89,-185.88 179.78,-178.03 176.43,-184.17"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="246.75,-132.25 168.5,-132.25 168.5,-113 246.75,-113 246.75,-132.25"/>
-<text text-anchor="middle" x="207.62" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node10 -->
-<g id="edge12_Node000004_Node000010" class="edge">
-<title>Node4&#45;&gt;Node10</title>
-<g id="a_edge12_Node000004_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.67,-137.49C131.55,-135.76 144.36,-133.52 157.02,-131.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.3,-134.81 166.54,-129.64 156.09,-127.91 157.3,-134.81"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="358,-243.25 282.75,-243.25 282.75,-224 358,-224 358,-243.25"/>
-<text text-anchor="middle" x="320.38" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M233.48,-204.93C246.72,-209.35 263.35,-214.91 278.43,-219.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.05,-223.17 287.64,-223.02 279.27,-216.54 277.05,-223.17"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="356.5,-206.25 284.25,-206.25 284.25,-187 356.5,-187 356.5,-206.25"/>
-<text text-anchor="middle" x="320.38" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge8_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge8_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M233.48,-196.62C245.14,-196.62 259.42,-196.62 272.97,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.59,-200.13 282.59,-196.63 272.59,-193.13 272.59,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="348.25,-280.25 292.5,-280.25 292.5,-261 348.25,-261 348.25,-280.25"/>
-<text text-anchor="middle" x="320.38" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge10_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge10_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.2,-206.47C234.38,-218.27 259.4,-238.25 282.75,-252.62 284.18,-253.51 285.67,-254.38 287.18,-255.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.51,-258.32 295.98,-259.92 288.79,-252.14 285.51,-258.32"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="462.5,-206.25 394,-206.25 394,-187 462.5,-187 462.5,-206.25"/>
-<text text-anchor="middle" x="428.25" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M350.31,-223.51C361.86,-219.48 375.35,-214.76 387.78,-210.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="388.64,-213.83 396.93,-207.22 386.33,-207.22 388.64,-213.83"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M411.36,-206.54C403.66,-215.15 409.29,-224.25 428.25,-224.25 438.62,-224.25 445,-221.53 447.4,-217.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="450.86,-217.12 445.44,-208.02 444,-218.52 450.86,-217.12"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge9_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge9_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M356.92,-196.62C365.1,-196.62 373.9,-196.62 382.42,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="382.25,-200.13 392.25,-196.63 382.25,-193.13 382.25,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge11_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge11_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.89,-260.55C348.66,-258.14 353.58,-255.45 358,-252.62 376,-241.13 394.73,-225.74 408.17,-214"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="410.27,-216.81 415.42,-207.55 405.62,-211.58 410.27,-216.81"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node7 -->
-<g id="edge13_Node000010_Node000007" class="edge">
-<title>Node10&#45;&gt;Node7</title>
-<g id="a_edge13_Node000010_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M217.49,-112.74C230.33,-99.26 255.53,-75.75 282.75,-66.62 314.46,-55.99 329.33,-49.41 358,-66.62 397.7,-90.46 415.88,-145.6 423.13,-175.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="419.64,-176.29 425.2,-185.31 426.48,-174.79 419.64,-176.29"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="355.75,-19.25 285,-19.25 285,0 355.75,0 355.75,-19.25"/>
-<text text-anchor="middle" x="320.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge14_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge14_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M215.37,-112.72C227.5,-95.37 254.38,-58.92 282.75,-33.62 285.73,-30.96 289.04,-28.38 292.4,-25.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.23,-28.95 300.59,-20.47 290.33,-23.14 294.23,-28.95"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="347.5,-132.25 293.25,-132.25 293.25,-113 347.5,-113 347.5,-132.25"/>
-<text text-anchor="middle" x="320.38" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node12 -->
-<g id="edge16_Node000010_Node000012" class="edge">
-<title>Node10&#45;&gt;Node12</title>
-<g id="a_edge16_Node000010_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M247.05,-122.62C258.27,-122.62 270.52,-122.62 281.69,-122.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.35,-126.13 291.35,-122.63 281.35,-119.13 281.35,-126.13"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="346,-95.25 294.75,-95.25 294.75,-76 346,-76 346,-95.25"/>
-<text text-anchor="middle" x="320.38" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node13 -->
-<g id="edge17_Node000010_Node000013" class="edge">
-<title>Node10&#45;&gt;Node13</title>
-<g id="a_edge17_Node000010_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M238.89,-112.51C252.77,-107.88 269.32,-102.35 283.8,-97.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.57,-100.94 292.95,-94.45 282.35,-94.3 284.57,-100.94"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="349.75,-169.25 291,-169.25 291,-150 349.75,-150 349.75,-169.25"/>
-<text text-anchor="middle" x="320.38" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node14 -->
-<g id="edge18_Node000010_Node000014" class="edge">
-<title>Node10&#45;&gt;Node14</title>
-<g id="a_edge18_Node000010_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M238.89,-132.74C251.5,-136.95 266.31,-141.9 279.77,-146.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.64,-149.71 289.24,-149.56 280.86,-143.07 278.64,-149.71"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node7 -->
-<g id="edge15_Node000011_Node000007" class="edge">
-<title>Node11&#45;&gt;Node7</title>
-<g id="a_edge15_Node000011_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M341.31,-19.71C347.26,-23.45 353.42,-28.14 358,-33.62 394.37,-77.14 414.28,-142.56 422.57,-175.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="419.12,-176.36 424.84,-185.29 425.93,-174.75 419.12,-176.36"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node5 -->
-<g id="edge20_Node000015_Node000005" class="edge">
-<title>Node15&#45;&gt;Node5</title>
-<g id="a_edge20_Node000015_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.67,-180.93C135.14,-183.42 154.04,-186.91 170.6,-189.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.63,-193.35 180.1,-191.73 170.9,-186.47 169.63,-193.35"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node10 -->
-<g id="edge21_Node000015_Node000010" class="edge">
-<title>Node15&#45;&gt;Node10</title>
-<g id="a_edge21_Node000015_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.67,-168.04C137.16,-159.76 159.85,-147.63 177.88,-137.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.36,-141.17 186.53,-133.37 176.06,-134.99 179.36,-141.17"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/db9/hill__cipher_8cpp_source.html b/d7/db9/hill__cipher_8cpp_source.html
new file mode 100644
index 000000000..55537ab44
--- /dev/null
+++ b/d7/db9/hill__cipher_8cpp_source.html
@@ -0,0 +1,567 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: ciphers/hill_cipher.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/db9/hill__cipher_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">hill_cipher.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d7/db9/hill__cipher_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &lt;fstream&gt;</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#include &lt;iomanip&gt;</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="preprocessor">#include &lt;string&gt;</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="preprocessor">#include &lt;omp.h&gt;</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="preprocessor">#include &quot;<a class="code" href="../../d1/dbe/lu__decomposition_8h.html">../numerical_methods/lu_decomposition.h</a>&quot;</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00055" data-start="{" data-end="}">
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../d7/db9/hill__cipher_8cpp.html#a34bfcd756610834acac501f9eea1e2eb">   55</a></span><span class="keyword">static</span> std::ostream &amp;<a class="code hl_function" href="../../d7/db9/hill__cipher_8cpp.html#a34bfcd756610834acac501f9eea1e2eb">operator&lt;&lt;</a>(std::ostream &amp;out, <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;T&gt;</a> <span class="keyword">const</span> &amp;v) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> width = 15;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keyword">const</span> <span class="keywordtype">char</span> separator = <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; v.size(); row++) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; v[row].size(); col++)</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            out &lt;&lt; std::left &lt;&lt; std::setw(width) &lt;&lt; std::setfill(separator)</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>                &lt;&lt; v[row][col];</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        out &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">return</span> out;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>}</div>
+</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/d4e/namespaceciphers.html">ciphers</a> {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">   74</a></span><span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">char</span> *<a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">STRKEY</a> =</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="stringliteral">&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789~!@#$%^&amp;&quot;</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="stringliteral">&quot;*()_+`-=[]{}|;&#39;:\&quot;,./&lt;&gt;?\\\r\n \0&quot;</span>;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="foldopen" id="foldopen00082" data-start="{" data-end="};">
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="../../d6/d26/classciphers_1_1_hill_cipher.html">   82</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d6/d26/classciphers_1_1_hill_cipher.html">HillCipher</a> {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T1, <span class="keyword">typename</span> T2&gt;</div>
+<div class="foldopen" id="foldopen00093" data-start="{" data-end="}">
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"><a class="line" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9">   93</a></span>    <span class="keyword">static</span> <span class="keyword">const</span> T2 <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9">rand_range</a>(T1 a, T1 b) {</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="comment">// generate random number between 0 and 1</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        <span class="keywordtype">long</span> <span class="keywordtype">double</span> r = <span class="keyword">static_cast&lt;</span><span class="keywordtype">long</span> <span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand()) / RAND_MAX;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        <span class="comment">// scale and return random number as integer</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>T2<span class="keyword">&gt;</span>(r * (b - a) + a);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    }</div>
+</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T1, <span class="keyword">typename</span> T2&gt;</div>
+<div class="foldopen" id="foldopen00119" data-start="{" data-end="}">
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"><a class="line" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395">  119</a></span>    <span class="keyword">static</span> <span class="keywordtype">double</span> <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395">rand_range</a>(<a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;T2&gt;</a> *M, T1 a, T1 b) {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; M-&gt;size(); i++) {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; M[0][0].size(); j++) {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>                M[0][i][j] = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9">rand_range&lt;T1, T2&gt;</a>(a, b);</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>            }</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        }</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(*M);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    }</div>
+</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00139" data-start="{" data-end="}">
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"><a class="line" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0">  139</a></span>    <span class="keyword">static</span> <span class="keyword">const</span> T <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0">gcd</a>(T a, T b) {</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        <span class="keywordflow">if</span> (b &gt; a)  <span class="comment">// ensure always a &lt; b</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>            std::swap(a, b);</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span> </div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        <span class="keywordflow">while</span> (b != 0) {</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>            T tmp = b;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>            b = a % b;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>            a = tmp;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        }</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span> </div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        <span class="keywordflow">return</span> a;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    }</div>
+</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
+<div class="foldopen" id="foldopen00160" data-start="{" data-end="}">
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"><a class="line" href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590">  160</a></span>    <span class="keyword">static</span> <span class="keyword">const</span> std::valarray&lt;uint8_t&gt; <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590">mat_mul</a>(</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        <span class="keyword">const</span> std::valarray&lt;uint8_t&gt; &amp;vector, <span class="keyword">const</span> <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> &amp;key) {</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        std::valarray&lt;uint8_t&gt; out(vector);  <span class="comment">// make a copy</span></div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span> </div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>        <span class="keywordtype">size_t</span> L = std::strlen(<a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">STRKEY</a>);</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span> </div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; key.size(); i++) {</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>            <span class="keywordtype">int</span> tmp = 0;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; vector.size(); j++) {</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>                tmp += key[i][j] * vector[j];</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>            }</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>            out[i] = <span class="keyword">static_cast&lt;</span>uint8_t<span class="keyword">&gt;</span>(tmp % L);</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>        }</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span> </div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        <span class="keywordflow">return</span> out;</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    }</div>
+</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"><a class="line" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c">  183</a></span>    <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">char</span> <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c">get_idx_char</a>(<span class="keyword">const</span> uint8_t idx) { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">STRKEY</a>[idx]; }</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span> </div>
+<div class="foldopen" id="foldopen00191" data-start="{" data-end="}">
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"><a class="line" href="../../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41">  191</a></span>    <span class="keyword">static</span> <span class="keyword">inline</span> uint8_t <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41">get_char_idx</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> ch) {</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>        <span class="keywordtype">size_t</span> L = std::strlen(<a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">STRKEY</a>);</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span> </div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> idx = 0; idx &lt;= L; idx++)</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">STRKEY</a>[idx] == ch)</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>                <span class="keywordflow">return</span> idx;</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span> </div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>        std::cerr &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;:&quot;</span> &lt;&lt; __LINE__ &lt;&lt; <span class="stringliteral">&quot;: (&quot;</span> &lt;&lt; ch</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>                  &lt;&lt; <span class="stringliteral">&quot;) Should not reach here!\n&quot;</span>;</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    }</div>
+</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span> </div>
+<div class="foldopen" id="foldopen00211" data-start="{" data-end="}">
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"><a class="line" href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa">  211</a></span>    <span class="keyword">static</span> <span class="keyword">const</span> std::string <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa">codec</a>(<span class="keyword">const</span> std::string &amp;text,</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>                                   <span class="keyword">const</span> <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> &amp;key) {</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>        <span class="keywordtype">size_t</span> text_len = text.length();</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>        <span class="keywordtype">size_t</span> key_len = key.size();</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span> </div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>        <span class="comment">// length of output string must be a multiple of key_len</span></div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>        <span class="comment">// create output string and initialize with &#39;\0&#39; character</span></div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>        <span class="keywordtype">size_t</span> L2 = text_len % key_len == 0</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>                        ? text_len</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>                        : text_len + key_len - (text_len % key_len);</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>        std::string coded_text(L2, <span class="charliteral">&#39;\0&#39;</span>);</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span> </div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>        <span class="comment">// temporary array for batch processing</span></div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>        <span class="keywordtype">int</span> i;</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span><span class="preprocessor">#pragma parallel omp for private(i)</span></div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>        <span class="keywordflow">for</span> (i = 0; i &lt; L2 - key_len + 1; i += key_len) {</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>            std::valarray&lt;uint8_t&gt; batch_int(key_len);</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; key_len; j++) {</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>                batch_int[j] = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41">get_char_idx</a>(text[i + j]);</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>            }</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span> </div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>            batch_int = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590">mat_mul</a>(batch_int, key);</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span> </div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; key_len; j++) {</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>                coded_text[i + j] =</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>                    <a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">STRKEY</a>[batch_int[j]];  <span class="comment">// get character at key</span></div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>            }</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>        }</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span> </div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>        <span class="keywordflow">return</span> coded_text;</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    }</div>
+</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span> </div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00251" data-start="{" data-end="}">
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"><a class="line" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7">  251</a></span>    <span class="keyword">static</span> <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;double&gt;</a> <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7">get_inverse</a>(<a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;T&gt;</a> <span class="keyword">const</span> &amp;A) {</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>        <span class="comment">// Assuming A is square matrix</span></div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>        <span class="keywordtype">size_t</span> N = A.size();</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span> </div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>        <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;double&gt;</a> inverse(N, std::valarray&lt;double&gt;(N));</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; N; row++) {</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; N; col++) {</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>                <span class="comment">// create identity matrix</span></div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>                inverse[row][col] = (row == col) ? 1.f : 0.f;</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>            }</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>        }</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span> </div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>        <span class="keywordflow">if</span> (A.size() != A[0].size()) {</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;A must be a square matrix!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>            <span class="keywordflow">return</span> inverse;</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>        }</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span> </div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>        <span class="comment">// preallocate a temporary matrix identical to A</span></div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>        <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;double&gt;</a> temp(N, std::valarray&lt;double&gt;(N));</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; N; row++) {</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; N; col++)</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>                temp[row][col] = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(A[row][col]);</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>        }</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span> </div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>        <span class="comment">// start transformations</span></div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; N; row++) {</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row2 = row; row2 &lt; N &amp;&amp; temp[row][row] == 0; row2++) {</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>                <span class="comment">// this to ensure diagonal elements are not 0</span></div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>                temp[row] = temp[row] + temp[row2];</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>                inverse[row] = inverse[row] + inverse[row2];</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>            }</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span> </div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col2 = row; col2 &lt; N &amp;&amp; temp[row][row] == 0; col2++) {</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>                <span class="comment">// this to further ensure diagonal elements are not 0</span></div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>                <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row2 = 0; row2 &lt; N; row2++) {</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>                    temp[row2][row] = temp[row2][row] + temp[row2][col2];</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>                    inverse[row2][row] =</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>                        inverse[row2][row] + inverse[row2][col2];</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>                }</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>            }</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span> </div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>            <span class="keywordflow">if</span> (temp[row][row] == 0) {</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>                <span class="comment">// Probably a low-rank matrix and hence singular</span></div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>                std::cerr &lt;&lt; <span class="stringliteral">&quot;Low-rank matrix, no inverse!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>                <span class="keywordflow">return</span> inverse;</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>            }</div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span> </div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>            <span class="comment">// set diagonal to 1</span></div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>            <span class="keywordtype">double</span> divisor = temp[row][row];</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>            temp[row] = temp[row] / divisor;</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>            inverse[row] = inverse[row] / divisor;</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>            <span class="comment">// Row transformations</span></div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row2 = 0; row2 &lt; N; row2++) {</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>                <span class="keywordflow">if</span> (row2 == row)</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>                    <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>                <span class="keywordtype">double</span> factor = temp[row2][row];</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>                temp[row2] = temp[row2] - factor * temp[row];</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>                inverse[row2] = inverse[row2] - factor * inverse[row];</div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>            }</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>        }</div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span> </div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>        <span class="keywordflow">return</span> inverse;</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>    }</div>
+</div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span> </div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>    <span class="keyword">static</span> <span class="keywordtype">int</span> modulo(<span class="keywordtype">int</span> a, <span class="keywordtype">int</span> b) {</div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>        <span class="keywordtype">int</span> ret = a % b;</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>        <span class="keywordflow">if</span> (ret &lt; 0)</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>            ret += b;</div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>        <span class="keywordflow">return</span> ret;</div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>    }</div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span> </div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00340" data-start="{" data-end="}">
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"><a class="line" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e">  340</a></span>    <span class="keyword">static</span> <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e">generate_encryption_key</a>(<span class="keywordtype">size_t</span> size, <span class="keywordtype">int</span> limit1 = 0,</div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>                                               <span class="keywordtype">int</span> limit2 = 10) {</div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>        <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> encrypt_key(size, std::valarray&lt;int&gt;(size));</div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>        <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> min_mat = encrypt_key;</div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>        <span class="keywordtype">int</span> mat_determinant = -1;  <span class="comment">// because matrix has only ints, the</span></div>
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span>                                   <span class="comment">// determinant will also be an int</span></div>
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>        <span class="keywordtype">int</span> L = std::strlen(<a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">STRKEY</a>);</div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span> </div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>        <span class="keywordtype">double</span> dd;</div>
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>        <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>            <span class="comment">// keeping the random number range smaller generates better</span></div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>            <span class="comment">// defined matrices with more ease of cracking</span></div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>            dd = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9">rand_range</a>(&amp;encrypt_key, limit1, limit2);</div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>            mat_determinant = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(dd);</div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span> </div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>            <span class="keywordflow">if</span> (mat_determinant &lt; 0)</div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>                mat_determinant = (mat_determinant % L);</div>
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>        } <span class="keywordflow">while</span> (std::abs(dd) &gt; 1e3 ||  <span class="comment">// while ill-defined</span></div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>                 dd &lt; 0.1 ||  <span class="comment">// while singular or negative determinant</span></div>
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>                 !std::isfinite(dd) ||  <span class="comment">// while determinant is not finite</span></div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>                 <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0">gcd</a>(mat_determinant, L) != 1);  <span class="comment">// while no common factors</span></div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>        <span class="comment">// std::cout &lt;&lt;</span></div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span> </div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>        <span class="keywordflow">return</span> encrypt_key;</div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>    }</div>
+</div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span> </div>
+<div class="foldopen" id="foldopen00372" data-start="{" data-end="}">
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"><a class="line" href="../../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706">  372</a></span>    <span class="keyword">static</span> <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706">generate_decryption_key</a>(<a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> <span class="keyword">const</span> &amp;encrypt_key) {</div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>        <span class="keywordtype">size_t</span> size = encrypt_key.size();</div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>        <span class="keywordtype">int</span> L = std::strlen(<a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">STRKEY</a>);</div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span> </div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>        <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> decrypt_key(size, std::valarray&lt;int&gt;(size));</div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>        <span class="keywordtype">int</span> det_encrypt = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(<a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(encrypt_key));</div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span> </div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>        <span class="keywordtype">int</span> mat_determinant = det_encrypt &lt; 0 ? det_encrypt % L : det_encrypt;</div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span> </div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>        <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;double&gt;</a> tmp_inverse = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7">get_inverse</a>(encrypt_key);</div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>        <span class="keywordtype">double</span> d2 = <a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(decrypt_key);</div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span> </div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>        <span class="comment">// find co-prime factor for inversion</span></div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>        <span class="keywordtype">int</span> det_inv = -1;</div>
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; L; i++) {</div>
+<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>            <span class="keywordflow">if</span> (modulo(mat_determinant * i, L) == 1) {</div>
+<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>                det_inv = i;</div>
+<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>            }</div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>        }</div>
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span> </div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>        <span class="keywordflow">if</span> (det_inv == -1) {</div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Could not find a co-prime for inversion\n&quot;</span>;</div>
+<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>            std::exit(EXIT_FAILURE);</div>
+<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>        }</div>
+<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span> </div>
+<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>        mat_determinant = det_inv * det_encrypt;</div>
+<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span> </div>
+<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span>        <span class="comment">// perform modular inverse of encryption matrix</span></div>
+<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>        <span class="keywordtype">int</span> i;</div>
+<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span><span class="preprocessor">#pragma parallel omp for private(i)</span></div>
+<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span>        <span class="keywordflow">for</span> (i = 0; i &lt; size; i++) {</div>
+<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; size; j++) {</div>
+<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>                <span class="keywordtype">int</span> temp = std::round(tmp_inverse[i][j] * mat_determinant);</div>
+<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>                decrypt_key[i][j] = modulo(temp, L);</div>
+<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>            }</div>
+<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>        }</div>
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>        <span class="keywordflow">return</span> decrypt_key;</div>
+<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>    }</div>
+</div>
+<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span> </div>
+<div class="foldopen" id="foldopen00425" data-start="{" data-end="}">
+<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"><a class="line" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5">  425</a></span>    <span class="keyword">static</span> std::pair&lt;matrix&lt;int&gt;, <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a>&gt; <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5">generate_keys</a>(<span class="keywordtype">size_t</span> size,</div>
+<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span>                                                             <span class="keywordtype">int</span> limit1 = 0,</div>
+<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>                                                             <span class="keywordtype">int</span> limit2 = 10) {</div>
+<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>        <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> encrypt_key = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e">generate_encryption_key</a>(size);</div>
+<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span>        <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> decrypt_key = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706">generate_decryption_key</a>(encrypt_key);</div>
+<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>        <span class="keywordtype">double</span> det2 = <a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(decrypt_key);</div>
+<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span>        <span class="keywordflow">while</span> (std::abs(det2) &lt; 0.1 || std::abs(det2) &gt; 1e3) {</div>
+<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>            encrypt_key = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e">generate_encryption_key</a>(size, limit1, limit2);</div>
+<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>            decrypt_key = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706">generate_decryption_key</a>(encrypt_key);</div>
+<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>            det2 = <a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(decrypt_key);</div>
+<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>        }</div>
+<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>        <span class="keywordflow">return</span> std::make_pair(encrypt_key, decrypt_key);</div>
+<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span>    }</div>
+</div>
+<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span> </div>
+<div class="foldopen" id="foldopen00446" data-start="{" data-end="}">
+<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"><a class="line" href="../../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917">  446</a></span>    <span class="keyword">static</span> <span class="keyword">const</span> std::string <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917">encrypt_text</a>(<span class="keyword">const</span> std::string &amp;text,</div>
+<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span>                                          <span class="keyword">const</span> <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> &amp;encrypt_key) {</div>
+<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa">codec</a>(text, encrypt_key);</div>
+<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span>    }</div>
+</div>
+<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span> </div>
+<div class="foldopen" id="foldopen00458" data-start="{" data-end="}">
+<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"><a class="line" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b">  458</a></span>    <span class="keyword">static</span> <span class="keyword">const</span> std::string <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b">decrypt_text</a>(<span class="keyword">const</span> std::string &amp;text,</div>
+<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span>                                          <span class="keyword">const</span> <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> &amp;decrypt_key) {</div>
+<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa">codec</a>(text, decrypt_key);</div>
+<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>    }</div>
+</div>
+<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>};</div>
+</div>
+<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span> </div>
+<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span>}  <span class="comment">// namespace ciphers</span></div>
+<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span> </div>
+<div class="foldopen" id="foldopen00471" data-start="{" data-end="}">
+<div class="line"><a id="l00471" name="l00471"></a><span class="lineno"><a class="line" href="../../d7/db9/hill__cipher_8cpp.html#a3147ad576f8a94a2a6b66948672b452b">  471</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>(<span class="keyword">const</span> std::string &amp;text) {</div>
+<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>    <span class="comment">// std::string text = &quot;Hello world!&quot;;</span></div>
+<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;======Test 1 (3x3 key) ======\nOriginal text:\n\t&quot;</span> &lt;&lt; text</div>
+<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span> </div>
+<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span>    std::pair&lt;matrix&lt;int&gt;, <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a>&gt; p =</div>
+<div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span>        <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5">ciphers::HillCipher::generate_keys</a>(3, 0, 100);</div>
+<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> ekey = p.first;</div>
+<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> dkey = p.second;</div>
+<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span> </div>
+<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span>    <span class="comment">// matrix&lt;int&gt; ekey = {{22, 28, 25}, {5, 26, 15}, {14, 18, 9}};</span></div>
+<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>    <span class="comment">// std::cout &lt;&lt; &quot;Encryption key: \n&quot; &lt;&lt; ekey;</span></div>
+<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span>    std::string gibberish = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917">ciphers::HillCipher::encrypt_text</a>(text, ekey);</div>
+<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Encrypted text:\n\t&quot;</span> &lt;&lt; gibberish &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span> </div>
+<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span>    <span class="comment">// matrix&lt;int&gt; dkey = ciphers::HillCipher::generate_decryption_key(ekey);</span></div>
+<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span>    <span class="comment">// std::cout &lt;&lt; &quot;Decryption key: \n&quot; &lt;&lt; dkey;</span></div>
+<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span>    std::string txt_back = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b">ciphers::HillCipher::decrypt_text</a>(gibberish, dkey);</div>
+<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Reconstruct text:\n\t&quot;</span> &lt;&lt; txt_back &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span> </div>
+<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>    std::ofstream out_file(<span class="stringliteral">&quot;hill_cipher_test1.txt&quot;</span>);</div>
+<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span>    out_file &lt;&lt; <span class="stringliteral">&quot;Block size: &quot;</span> &lt;&lt; ekey.size() &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span>    out_file &lt;&lt; <span class="stringliteral">&quot;Encryption Key:\n&quot;</span> &lt;&lt; ekey;</div>
+<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span>    out_file &lt;&lt; <span class="stringliteral">&quot;\nDecryption Key:\n&quot;</span> &lt;&lt; dkey;</div>
+<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span>    out_file.close();</div>
+<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span> </div>
+<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span>    assert(txt_back == text);</div>
+<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed :)\n&quot;</span>;</div>
+<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>}</div>
+</div>
+<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span> </div>
+<div class="foldopen" id="foldopen00506" data-start="{" data-end="}">
+<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"><a class="line" href="../../d7/db9/hill__cipher_8cpp.html#a04391124480d2a49f2dec900237b0712">  506</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>(<span class="keyword">const</span> std::string &amp;text) {</div>
+<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span>    <span class="comment">// std::string text = &quot;Hello world!&quot;;</span></div>
+<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;======Test 2 (8x8 key) ======\nOriginal text:\n\t&quot;</span> &lt;&lt; text</div>
+<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span> </div>
+<div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span>    std::pair&lt;matrix&lt;int&gt;, <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a>&gt; p =</div>
+<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span>        <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5">ciphers::HillCipher::generate_keys</a>(8, 0, 3);</div>
+<div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> ekey = p.first;</div>
+<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> dkey = p.second;</div>
+<div class="line"><a id="l00515" name="l00515"></a><span class="lineno">  515</span> </div>
+<div class="line"><a id="l00516" name="l00516"></a><span class="lineno">  516</span>    std::string gibberish = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917">ciphers::HillCipher::encrypt_text</a>(text, ekey);</div>
+<div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Encrypted text:\n\t&quot;</span> &lt;&lt; gibberish &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span> </div>
+<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span>    std::string txt_back = <a class="code hl_function" href="../../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b">ciphers::HillCipher::decrypt_text</a>(gibberish, dkey);</div>
+<div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Reconstruct text:\n\t&quot;</span> &lt;&lt; txt_back &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span> </div>
+<div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span>    std::ofstream out_file(<span class="stringliteral">&quot;hill_cipher_test2.txt&quot;</span>);</div>
+<div class="line"><a id="l00523" name="l00523"></a><span class="lineno">  523</span>    out_file &lt;&lt; <span class="stringliteral">&quot;Block size: &quot;</span> &lt;&lt; ekey.size() &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span>    out_file &lt;&lt; <span class="stringliteral">&quot;Encryption Key:\n&quot;</span> &lt;&lt; ekey;</div>
+<div class="line"><a id="l00525" name="l00525"></a><span class="lineno">  525</span>    out_file &lt;&lt; <span class="stringliteral">&quot;\nDecryption Key:\n&quot;</span> &lt;&lt; dkey;</div>
+<div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span>    out_file.close();</div>
+<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span> </div>
+<div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span>    assert(txt_back.compare(0, text.size(), text) == 0);</div>
+<div class="line"><a id="l00529" name="l00529"></a><span class="lineno">  529</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed :)\n&quot;</span>;</div>
+<div class="line"><a id="l00530" name="l00530"></a><span class="lineno">  530</span>}</div>
+</div>
+<div class="line"><a id="l00531" name="l00531"></a><span class="lineno">  531</span> </div>
+<div class="foldopen" id="foldopen00533" data-start="{" data-end="}">
+<div class="line"><a id="l00533" name="l00533"></a><span class="lineno"><a class="line" href="../../d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  533</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00534" name="l00534"></a><span class="lineno">  534</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><a id="l00535" name="l00535"></a><span class="lineno">  535</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Key dictionary: (&quot;</span> &lt;&lt; std::strlen(<a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">ciphers::STRKEY</a>) &lt;&lt; <span class="stringliteral">&quot;)\n\t&quot;</span></div>
+<div class="line"><a id="l00536" name="l00536"></a><span class="lineno">  536</span>              &lt;&lt; <a class="code hl_variable" href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">ciphers::STRKEY</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00537" name="l00537"></a><span class="lineno">  537</span> </div>
+<div class="line"><a id="l00538" name="l00538"></a><span class="lineno">  538</span>    std::string text = <span class="stringliteral">&quot;This is a simple text with numb3r5 and exclamat!0n.&quot;</span>;</div>
+<div class="line"><a id="l00539" name="l00539"></a><span class="lineno">  539</span> </div>
+<div class="line"><a id="l00540" name="l00540"></a><span class="lineno">  540</span>    <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>(text);</div>
+<div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</span>    <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>(text);</div>
+<div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span> </div>
+<div class="line"><a id="l00543" name="l00543"></a><span class="lineno">  543</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00544" name="l00544"></a><span class="lineno">  544</span>}</div>
+</div>
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html">ciphers::HillCipher</a></div><div class="ttdoc">Implementation of Hill Cipher algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00082">hill_cipher.cpp:82</a></div></div>
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a12f727cca9e21f9539cd74b6603adf0c"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c">ciphers::HillCipher::get_idx_char</a></div><div class="ttdeci">static char get_idx_char(const uint8_t idx)</div><div class="ttdoc">Get the character at a given index in the STRKEY.</div><div class="ttdef"><b>Definition</b> <a href="#l00183">hill_cipher.cpp:183</a></div></div>
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a2eb58750b978a93ac5e6eb29e3e570b7"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7">ciphers::HillCipher::get_inverse</a></div><div class="ttdeci">static matrix&lt; double &gt; get_inverse(matrix&lt; T &gt; const &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="#l00251">hill_cipher.cpp:251</a></div></div>
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a405b0a28d66a61239d3565d5256f9cb5"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5">ciphers::HillCipher::generate_keys</a></div><div class="ttdeci">static std::pair&lt; matrix&lt; int &gt;, matrix&lt; int &gt; &gt; generate_keys(size_t size, int limit1=0, int limit2=10)</div><div class="ttdoc">Generate encryption and decryption key pair.</div><div class="ttdef"><b>Definition</b> <a href="#l00425">hill_cipher.cpp:425</a></div></div>
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a427acfac1dbff3f48a2b071d449d965b"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b">ciphers::HillCipher::decrypt_text</a></div><div class="ttdeci">static const std::string decrypt_text(const std::string &amp;text, const matrix&lt; int &gt; &amp;decrypt_key)</div><div class="ttdoc">Decrypt a given text using a given key.</div><div class="ttdef"><b>Definition</b> <a href="#l00458">hill_cipher.cpp:458</a></div></div>
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a629be41c1ab78850963e4ce14e1d11d9"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9">ciphers::HillCipher::rand_range</a></div><div class="ttdeci">static const T2 rand_range(T1 a, T1 b)</div><div class="ttdoc">Function to generate a random integer in a given interval.</div><div class="ttdef"><b>Definition</b> <a href="#l00093">hill_cipher.cpp:93</a></div></div>
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a642f70fb54cb50b00fb6df7c3f2b120e"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e">ciphers::HillCipher::generate_encryption_key</a></div><div class="ttdeci">static matrix&lt; int &gt; generate_encryption_key(size_t size, int limit1=0, int limit2=10)</div><div class="ttdoc">Generate encryption matrix of a given size. Larger size matrices are difficult to generate but provid...</div><div class="ttdef"><b>Definition</b> <a href="#l00340">hill_cipher.cpp:340</a></div></div>
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a716d0313141499d16f57c0c107f04395"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395">ciphers::HillCipher::rand_range</a></div><div class="ttdeci">static double rand_range(matrix&lt; T2 &gt; *M, T1 a, T1 b)</div><div class="ttdoc">Function overload to fill a matrix with random integers in a given interval.</div><div class="ttdef"><b>Definition</b> <a href="#l00119">hill_cipher.cpp:119</a></div></div>
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_a7760f3665651a0a37937c79c62f219c0"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0">ciphers::HillCipher::gcd</a></div><div class="ttdeci">static const T gcd(T a, T b)</div><div class="ttdoc">Compute GCD of two integers using Euler's algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00139">hill_cipher.cpp:139</a></div></div>
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_aa8bbb6e4a5749f6008b06602d5103917"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917">ciphers::HillCipher::encrypt_text</a></div><div class="ttdeci">static const std::string encrypt_text(const std::string &amp;text, const matrix&lt; int &gt; &amp;encrypt_key)</div><div class="ttdoc">Encrypt a given text using a given key.</div><div class="ttdef"><b>Definition</b> <a href="#l00446">hill_cipher.cpp:446</a></div></div>
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_ab02c7563889bf1e363deb8e21967b706"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706">ciphers::HillCipher::generate_decryption_key</a></div><div class="ttdeci">static matrix&lt; int &gt; generate_decryption_key(matrix&lt; int &gt; const &amp;encrypt_key)</div><div class="ttdoc">Generate decryption matrix from an encryption matrix key.</div><div class="ttdef"><b>Definition</b> <a href="#l00372">hill_cipher.cpp:372</a></div></div>
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_ad36cbcc7a458b3f3a2af0c4aa1126590"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590">ciphers::HillCipher::mat_mul</a></div><div class="ttdeci">static const std::valarray&lt; uint8_t &gt; mat_mul(const std::valarray&lt; uint8_t &gt; &amp;vector, const matrix&lt; int &gt; &amp;key)</div><div class="ttdoc">helper function to perform vector multiplication with encryption or decryption matrix</div><div class="ttdef"><b>Definition</b> <a href="#l00160">hill_cipher.cpp:160</a></div></div>
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_ad667fa0860977f6d6d443fa1dbcd80aa"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa">ciphers::HillCipher::codec</a></div><div class="ttdeci">static const std::string codec(const std::string &amp;text, const matrix&lt; int &gt; &amp;key)</div><div class="ttdoc">Convenience function to perform block cipher operations. The operations are identical for both encryp...</div><div class="ttdef"><b>Definition</b> <a href="#l00211">hill_cipher.cpp:211</a></div></div>
+<div class="ttc" id="aclassciphers_1_1_hill_cipher_html_ae77cad522fa44b8c985779a7188d2f41"><div class="ttname"><a href="../../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41">ciphers::HillCipher::get_char_idx</a></div><div class="ttdeci">static uint8_t get_char_idx(const char ch)</div><div class="ttdoc">Get the index of a character in the STRKEY.</div><div class="ttdef"><b>Definition</b> <a href="#l00191">hill_cipher.cpp:191</a></div></div>
+<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00187">dsu_path_compression.cpp:187</a></div></div>
+<div class="ttc" id="adsu__path__compression_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-test implementations, 1st test.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00170">dsu_path_compression.cpp:170</a></div></div>
+<div class="ttc" id="ahill__cipher_8cpp_html_a34bfcd756610834acac501f9eea1e2eb"><div class="ttname"><a href="../../d7/db9/hill__cipher_8cpp.html#a34bfcd756610834acac501f9eea1e2eb">operator&lt;&lt;</a></div><div class="ttdeci">static std::ostream &amp; operator&lt;&lt;(std::ostream &amp;out, matrix&lt; T &gt; const &amp;v)</div><div class="ttdef"><b>Definition</b> <a href="#l00055">hill_cipher.cpp:55</a></div></div>
+<div class="ttc" id="ahill__cipher_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00533">hill_cipher.cpp:533</a></div></div>
+<div class="ttc" id="alu__decomposition_8h_html"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html">lu_decomposition.h</a></div><div class="ttdoc">Functions associated with LU Decomposition of a square matrix.</div></div>
+<div class="ttc" id="alu__decomposition_8h_html_a3108d43bd32c6fb3b3c158476c51ba7f"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a></div><div class="ttdeci">double determinant_lu(const matrix&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbe/lu__decomposition_8h_source.html#l00090">lu_decomposition.h:90</a></div></div>
+<div class="ttc" id="alu__decomposition_8h_html_ac029b636b353cefbb18b2fcc71e427e4"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; matrix</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbe/lu__decomposition_8h_source.html#l00019">lu_decomposition.h:19</a></div></div>
+<div class="ttc" id="anamespaceciphers_html"><div class="ttname"><a href="../../d6/d4e/namespaceciphers.html">ciphers</a></div><div class="ttdoc">Algorithms for encryption and decryption.</div></div>
+<div class="ttc" id="anamespaceciphers_html_ab9aec0ccf4b6809f652bb540be87c216"><div class="ttname"><a href="../../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216">ciphers::STRKEY</a></div><div class="ttdeci">static const char * STRKEY</div><div class="ttdef"><b>Definition</b> <a href="#l00074">hill_cipher.cpp:74</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_4d6e05837bf820fb089a8a8cdf2f42b7.html">ciphers</a></li><li class="navelem"><a class="el" href="../../d7/db9/hill__cipher_8cpp.html">hill_cipher.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/dba/cll_8h_source.html b/d7/dba/cll_8h_source.html
index e0c5b4379..fb14416bc 100644
--- a/d7/dba/cll_8h_source.html
+++ b/d7/dba/cll_8h_source.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/cll/cll.h Source File</title>
+<title>TheAlgorithms/C++: data_structures/cll/cll.h Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -152,8 +169,8 @@ $(function(){initNavTree('d7/dba/cll_8h_source.html','../../'); initResizable(tr
 <div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>};</div>
 </div>
 <div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="preprocessor">#endif</span></div>
-<div class="ttc" id="aclasscll_html"><div class="ttname"><a href="../../d5/d15/classcll.html">cll</a></div><div class="ttdef"><b>Definition</b> cll.h:17</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
+<div class="ttc" id="aclasscll_html"><div class="ttname"><a href="../../d5/d15/classcll.html">cll</a></div><div class="ttdef"><b>Definition</b> <a href="#l00017">cll.h:17</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/d7/dc7/classmachine__learning_1_1k__nearest__neighbors_1_1_knn-members.html b/d7/dc7/classmachine__learning_1_1k__nearest__neighbors_1_1_knn-members.html
index 03133e4bc..428657714 100644
--- a/d7/dc7/classmachine__learning_1_1k__nearest__neighbors_1_1_knn-members.html
+++ b/d7/dc7/classmachine__learning_1_1k__nearest__neighbors_1_1_knn-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.map b/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.map
index 69161e812..0c51108ff 100644
--- a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.map
+++ b/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.map
@@ -1,5 +1,5 @@
 <map id="std::is_arithmetic&lt; uint128_t &gt;" name="std::is_arithmetic&lt; uint128_t &gt;">
 <area shape="rect" id="Node000001" title=" " alt="" coords="5,79,127,120"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integral_constant.html" title=" " alt="" coords="15,5,117,31"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="15,5,117,31"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="69,46,69,79,63,79,63,46"/>
 </map>
diff --git a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.md5 b/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.md5
index b333e0c57..3fc38ad4b 100644
--- a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.md5
+++ b/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.md5
@@ -1 +1 @@
-0a23f01e10a26977e4eb20ebb42ea582
\ No newline at end of file
+3d20965ba8a5558c00e18791af7f0bdd
\ No newline at end of file
diff --git a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.svg b/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.svg
index 7636272fa..9e9f0734f 100644
--- a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.svg
+++ b/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph.svg
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="83.5,-85.75 7.5,-85.75 7.5,-66.5 83.5,-66.5 83.5,-85.75"/>
 <text text-anchor="middle" x="45.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph_org.svg b/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph_org.svg
index 64d7e0a9e..0eab6ac6b 100644
--- a/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph_org.svg
+++ b/d7/dd6/structstd_1_1is__arithmetic_3_01uint128__t_01_4__coll__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="83.5,-85.75 7.5,-85.75 7.5,-66.5 83.5,-66.5 83.5,-85.75"/>
 <text text-anchor="middle" x="45.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/d7/ded/queue_8hpp_source.html b/d7/ded/queue_8hpp_source.html
index e70b4d184..341568673 100644
--- a/d7/ded/queue_8hpp_source.html
+++ b/d7/ded/queue_8hpp_source.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/queue.hpp Source File</title>
+<title>TheAlgorithms/C++: data_structures/queue.hpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -112,64 +129,44 @@ $(function(){initNavTree('d7/ded/queue_8hpp_source.html','../../'); initResizabl
 <div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#define DATA_STRUCTURES_QUEUE_HPP_</span></div>
 <div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span> </div>
 <div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &quot;<a class="code" href="../../d3/d09/node_8hpp.html">node.hpp</a>&quot;</span></div>
-<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"></span> </div>
-<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment">/** Definition of the queue class */</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span> </div>
 <div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> ValueType&gt;</div>
 <div class="foldopen" id="foldopen00009" data-start="{" data-end="};">
 <div class="line"><a id="l00009" name="l00009"></a><span class="lineno"><a class="line" href="../../db/da9/classqueue.html">    9</a></span><span class="keyword">class </span><a class="code hl_class" href="../../db/da9/classqueue.html">queue</a> {</div>
 <div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    <span class="keyword">using </span><a class="code hl_class" href="../../db/d8b/struct_node.html">node_type</a> = <a class="code hl_class" href="../../db/d8b/struct_node.html">Node&lt;ValueType&gt;</a>;</div>
 <div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
 <div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> <span class="keyword">public</span>:</div>
-<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <span class="keyword">using </span>value_type = ValueType;<span class="comment"></span></div>
-<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment">     * @brief prints the queue into the std::cout</span></div>
-<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <span class="keyword">using </span>value_type = ValueType;</div>
 <div class="foldopen" id="foldopen00017" data-start="{" data-end="}">
 <div class="line"><a id="l00017" name="l00017"></a><span class="lineno"><a class="line" href="../../db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368">   17</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368">display</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Front --&gt; &quot;</span>;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Front --&gt; &quot;</span>;</div>
 <div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        display_all(this-&gt;<a class="code hl_variable" href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">queueFront</a>.get());</div>
-<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
-<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Size of queue: &quot;</span> &lt;&lt; size &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Size of queue: &quot;</span> &lt;&lt; size &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
 <div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    }</div>
 </div>
-<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"></span> </div>
-<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment">     * @brief converts the queue into the std::vector</span></div>
-<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment">     * @return std::vector containning all of the elements of the queue in the</span></div>
-<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment">     * same order</span></div>
-<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
 <div class="foldopen" id="foldopen00029" data-start="{" data-end="}">
-<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d">   29</a></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;value_type&gt;</a> <a class="code hl_function" href="../../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d">toVector</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d">   29</a></span>    std::vector&lt;value_type&gt; <a class="code hl_function" href="../../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d">toVector</a>()<span class="keyword"> const </span>{</div>
 <div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        <span class="keywordflow">return</span> push_all_to_vector(this-&gt;<a class="code hl_variable" href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">queueFront</a>.get(), this-&gt;size);</div>
 <div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    }</div>
 </div>
 <div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
-<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> <span class="keyword">private</span>:<span class="comment"></span></div>
-<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="comment">     * @brief throws an exception if queue is empty</span></div>
-<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="comment">     * @exception std::invalid_argument if queue is empty</span></div>
-<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> <span class="keyword">private</span>:</div>
 <div class="foldopen" id="foldopen00038" data-start="{" data-end="}">
 <div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="../../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604">   38</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604">ensureNotEmpty</a>()<span class="keyword"> const </span>{</div>
 <div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec">isEmptyQueue</a>()) {</div>
-<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>            <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>(<span class="stringliteral">&quot;Queue is empty.&quot;</span>);</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>            <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Queue is empty.&quot;</span>);</div>
 <div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        }</div>
 <div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    }</div>
 </div>
 <div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
-<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> <span class="keyword">public</span>:<span class="comment"></span></div>
-<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="comment">     * @brief checks if the queue has no elements</span></div>
-<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="comment">     * @return true if the queue is empty, false otherwise</span></div>
-<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> <span class="keyword">public</span>:</div>
 <div class="line"><a id="l00049" name="l00049"></a><span class="lineno"><a class="line" href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec">   49</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec">isEmptyQueue</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (<a class="code hl_variable" href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">queueFront</a> == <span class="keyword">nullptr</span>); }</div>
-<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="comment"></span> </div>
-<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="comment">     * @brief inserts a new item into the queue</span></div>
-<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
 <div class="foldopen" id="foldopen00054" data-start="{" data-end="}">
 <div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">   54</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">enQueue</a>(<span class="keyword">const</span> value_type&amp; item) {</div>
-<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="keyword">auto</span> newNode = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;node_type&gt;</a>();</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="keyword">auto</span> newNode = std::make_shared&lt;node_type&gt;();</div>
 <div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        newNode-&gt;data = item;</div>
 <div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        newNode-&gt;next = <span class="keyword">nullptr</span>;</div>
 <div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec">isEmptyQueue</a>()) {</div>
@@ -182,22 +179,14 @@ $(function(){initNavTree('d7/ded/queue_8hpp_source.html','../../'); initResizabl
 <div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        ++size;</div>
 <div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
 </div>
-<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="comment"></span> </div>
-<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="comment">     * @return the first element of the queue</span></div>
-<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="comment">     * @exception std::invalid_argument if queue is empty</span></div>
-<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
 <div class="foldopen" id="foldopen00072" data-start="{" data-end="}">
 <div class="line"><a id="l00072" name="l00072"></a><span class="lineno"><a class="line" href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">   72</a></span>    value_type <a class="code hl_function" href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">front</a>()<span class="keyword"> const </span>{</div>
 <div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        <a class="code hl_function" href="../../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604">ensureNotEmpty</a>();</div>
 <div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">queueFront</a>-&gt;data;</div>
 <div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    }</div>
 </div>
-<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="comment"></span> </div>
-<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span><span class="comment">     * @brief removes the first element from the queue</span></div>
-<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span><span class="comment">     * @exception std::invalid_argument if queue is empty</span></div>
-<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
 <div class="foldopen" id="foldopen00081" data-start="{" data-end="}">
 <div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="../../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85">   81</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85">deQueue</a>() {</div>
 <div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <a class="code hl_function" href="../../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604">ensureNotEmpty</a>();</div>
@@ -205,10 +194,7 @@ $(function(){initNavTree('d7/ded/queue_8hpp_source.html','../../'); initResizabl
 <div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        --size;</div>
 <div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    }</div>
 </div>
-<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span><span class="comment"></span> </div>
-<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span><span class="comment">     * @brief removes all elements from the queue</span></div>
-<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
 <div class="foldopen" id="foldopen00090" data-start="{" data-end="}">
 <div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="../../db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375">   90</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375">clear</a>() {</div>
 <div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        <a class="code hl_variable" href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">queueFront</a> = <span class="keyword">nullptr</span>;</div>
@@ -219,37 +205,31 @@ $(function(){initNavTree('d7/ded/queue_8hpp_source.html','../../'); initResizabl
 <div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
 <div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> <span class="keyword">private</span>:</div>
 <div class="foldopen" id="foldopen00097" data-start="{" data-end="};">
-<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"><a class="line" href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">   97</a></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;node_type&gt;</a> <a class="code hl_variable" href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">queueFront</a> =</div>
-<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        {}; <span class="comment">/**&lt; Pointer to the front of the queue */</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"><a class="line" href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">   97</a></span>    std::shared_ptr&lt;node_type&gt; <a class="code hl_variable" href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">queueFront</a> =</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        {}; </div>
 </div>
 <div class="foldopen" id="foldopen00099" data-start="{" data-end="};">
-<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"><a class="line" href="../../db/da9/classqueue.html#a7611df63ebefae613d311039d7305143">   99</a></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;node_type&gt;</a> <a class="code hl_variable" href="../../db/da9/classqueue.html#a7611df63ebefae613d311039d7305143">queueRear</a> =</div>
-<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        {}; <span class="comment">/**&lt; Pointer to the rear of the queue  */</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"><a class="line" href="../../db/da9/classqueue.html#a7611df63ebefae613d311039d7305143">   99</a></span>    std::shared_ptr&lt;node_type&gt; <a class="code hl_variable" href="../../db/da9/classqueue.html#a7611df63ebefae613d311039d7305143">queueRear</a> =</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        {}; </div>
 </div>
-<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> size = 0;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    std::size_t size = 0;</div>
 <div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>};</div>
 </div>
 <div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
 <div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span><span class="preprocessor">#endif  </span><span class="comment">// DATA_STRUCTURES_QUEUE_HPP_</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="aclassqueue_html"><div class="ttname"><a href="../../db/da9/classqueue.html">queue</a></div><div class="ttdef"><b>Definition</b> queue.hpp:9</div></div>
-<div class="ttc" id="aclassqueue_html_a353e4dd5772575905c78b0b30856e368"><div class="ttname"><a href="../../db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368">queue::display</a></div><div class="ttdeci">void display() const</div><div class="ttdoc">prints the queue into the std::cout</div><div class="ttdef"><b>Definition</b> queue.hpp:17</div></div>
-<div class="ttc" id="aclassqueue_html_a386fc1df8610948d3117b12f24655c7d"><div class="ttname"><a href="../../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d">queue::toVector</a></div><div class="ttdeci">std::vector&lt; value_type &gt; toVector() const</div><div class="ttdoc">converts the queue into the std::vector</div><div class="ttdef"><b>Definition</b> queue.hpp:29</div></div>
-<div class="ttc" id="aclassqueue_html_a4bc52ad6ed6b0cc33ad05f87f05f8bec"><div class="ttname"><a href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec">queue::isEmptyQueue</a></div><div class="ttdeci">bool isEmptyQueue() const</div><div class="ttdoc">checks if the queue has no elements</div><div class="ttdef"><b>Definition</b> queue.hpp:49</div></div>
-<div class="ttc" id="aclassqueue_html_a6ed7f8dfefe8687841f36f2223069375"><div class="ttname"><a href="../../db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375">queue::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdoc">removes all elements from the queue</div><div class="ttdef"><b>Definition</b> queue.hpp:90</div></div>
-<div class="ttc" id="aclassqueue_html_a75e231798bc706b8b0773a07f78713e7"><div class="ttname"><a href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">queue::front</a></div><div class="ttdeci">value_type front() const</div><div class="ttdef"><b>Definition</b> queue.hpp:72</div></div>
-<div class="ttc" id="aclassqueue_html_a7611df63ebefae613d311039d7305143"><div class="ttname"><a href="../../db/da9/classqueue.html#a7611df63ebefae613d311039d7305143">queue::queueRear</a></div><div class="ttdeci">std::shared_ptr&lt; node_type &gt; queueRear</div><div class="ttdef"><b>Definition</b> queue.hpp:99</div></div>
-<div class="ttc" id="aclassqueue_html_ac08ebdd38cb4ad74fc0a3f51888da604"><div class="ttname"><a href="../../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604">queue::ensureNotEmpty</a></div><div class="ttdeci">void ensureNotEmpty() const</div><div class="ttdoc">throws an exception if queue is empty</div><div class="ttdef"><b>Definition</b> queue.hpp:38</div></div>
-<div class="ttc" id="aclassqueue_html_ada88d0c1f34946d66386b7a11bee4e4d"><div class="ttname"><a href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">queue::enQueue</a></div><div class="ttdeci">void enQueue(const value_type &amp;item)</div><div class="ttdoc">inserts a new item into the queue</div><div class="ttdef"><b>Definition</b> queue.hpp:54</div></div>
-<div class="ttc" id="aclassqueue_html_af27dbb72fb63f58f817a88550d7faa85"><div class="ttname"><a href="../../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85">queue::deQueue</a></div><div class="ttdeci">void deQueue()</div><div class="ttdoc">removes the first element from the queue</div><div class="ttdef"><b>Definition</b> queue.hpp:81</div></div>
-<div class="ttc" id="aclassqueue_html_af6780e9b43326f557da405b65f7ad094"><div class="ttname"><a href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">queue::queueFront</a></div><div class="ttdeci">std::shared_ptr&lt; node_type &gt; queueFront</div><div class="ttdef"><b>Definition</b> queue.hpp:97</div></div>
-<div class="ttc" id="ainvalid_argument_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></div></div>
-<div class="ttc" id="amake_shared_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared</a></div><div class="ttdeci">T make_shared(T... args)</div></div>
+<div class="ttc" id="aclassqueue_html"><div class="ttname"><a href="../../db/da9/classqueue.html">queue</a></div><div class="ttdef"><b>Definition</b> <a href="#l00009">queue.hpp:9</a></div></div>
+<div class="ttc" id="aclassqueue_html_a353e4dd5772575905c78b0b30856e368"><div class="ttname"><a href="../../db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368">queue::display</a></div><div class="ttdeci">void display() const</div><div class="ttdoc">prints the queue into the std::cout</div><div class="ttdef"><b>Definition</b> <a href="#l00017">queue.hpp:17</a></div></div>
+<div class="ttc" id="aclassqueue_html_a386fc1df8610948d3117b12f24655c7d"><div class="ttname"><a href="../../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d">queue::toVector</a></div><div class="ttdeci">std::vector&lt; value_type &gt; toVector() const</div><div class="ttdoc">converts the queue into the std::vector</div><div class="ttdef"><b>Definition</b> <a href="#l00029">queue.hpp:29</a></div></div>
+<div class="ttc" id="aclassqueue_html_a4bc52ad6ed6b0cc33ad05f87f05f8bec"><div class="ttname"><a href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec">queue::isEmptyQueue</a></div><div class="ttdeci">bool isEmptyQueue() const</div><div class="ttdoc">checks if the queue has no elements</div><div class="ttdef"><b>Definition</b> <a href="#l00049">queue.hpp:49</a></div></div>
+<div class="ttc" id="aclassqueue_html_a6ed7f8dfefe8687841f36f2223069375"><div class="ttname"><a href="../../db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375">queue::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdoc">removes all elements from the queue</div><div class="ttdef"><b>Definition</b> <a href="#l00090">queue.hpp:90</a></div></div>
+<div class="ttc" id="aclassqueue_html_a75e231798bc706b8b0773a07f78713e7"><div class="ttname"><a href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">queue::front</a></div><div class="ttdeci">value_type front() const</div><div class="ttdef"><b>Definition</b> <a href="#l00072">queue.hpp:72</a></div></div>
+<div class="ttc" id="aclassqueue_html_a7611df63ebefae613d311039d7305143"><div class="ttname"><a href="../../db/da9/classqueue.html#a7611df63ebefae613d311039d7305143">queue::queueRear</a></div><div class="ttdeci">std::shared_ptr&lt; node_type &gt; queueRear</div><div class="ttdef"><b>Definition</b> <a href="#l00099">queue.hpp:99</a></div></div>
+<div class="ttc" id="aclassqueue_html_ac08ebdd38cb4ad74fc0a3f51888da604"><div class="ttname"><a href="../../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604">queue::ensureNotEmpty</a></div><div class="ttdeci">void ensureNotEmpty() const</div><div class="ttdoc">throws an exception if queue is empty</div><div class="ttdef"><b>Definition</b> <a href="#l00038">queue.hpp:38</a></div></div>
+<div class="ttc" id="aclassqueue_html_ada88d0c1f34946d66386b7a11bee4e4d"><div class="ttname"><a href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">queue::enQueue</a></div><div class="ttdeci">void enQueue(const value_type &amp;item)</div><div class="ttdoc">inserts a new item into the queue</div><div class="ttdef"><b>Definition</b> <a href="#l00054">queue.hpp:54</a></div></div>
+<div class="ttc" id="aclassqueue_html_af27dbb72fb63f58f817a88550d7faa85"><div class="ttname"><a href="../../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85">queue::deQueue</a></div><div class="ttdeci">void deQueue()</div><div class="ttdoc">removes the first element from the queue</div><div class="ttdef"><b>Definition</b> <a href="#l00081">queue.hpp:81</a></div></div>
+<div class="ttc" id="aclassqueue_html_af6780e9b43326f557da405b65f7ad094"><div class="ttname"><a href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">queue::queueFront</a></div><div class="ttdeci">std::shared_ptr&lt; node_type &gt; queueFront</div><div class="ttdef"><b>Definition</b> <a href="#l00097">queue.hpp:97</a></div></div>
 <div class="ttc" id="anode_8hpp_html"><div class="ttname"><a href="../../d3/d09/node_8hpp.html">node.hpp</a></div><div class="ttdoc">Provides Node class and related utilities.</div></div>
-<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div></div>
-<div class="ttc" id="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></div></div>
-<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</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 class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/d7/def/trie__multiple__search_8cpp.html b/d7/def/trie__multiple__search_8cpp.html
index 81e7d6718..d410bb006 100644
--- a/d7/def/trie__multiple__search_8cpp.html
+++ b/d7/def/trie__multiple__search_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: operations_on_datastructures/trie_multiple_search.cpp File Reference</title>
+<title>TheAlgorithms/C++: operations_on_datastructures/trie_multiple_search.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -126,7 +143,9 @@ Include dependency graph for trie_multiple_search.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/df4/trie__multiple__search_8cpp__incl.svg" width="602" height="126"><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">
+</div>
+<p><a href="../../d7/def/trie__multiple__search_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">operations_on_datastructures::trie_operations::Tnode</a></td></tr>
@@ -136,7 +155,7 @@ Classes</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></td></tr>
-<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
+<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::vector <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d8e/namespacetrie__operations.html">trie_operations</a></td></tr>
 <tr class="memdesc:df/d8e/namespacetrie__operations"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://iq.opengenus.org/autocomplete-using-trie-data-structure/" target="_blank">Trie datastructure</a> implementation. <br /></td></tr>
@@ -154,6 +173,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a href="https://iq.opengenus.org/autocomplete-using-trie-data-structure/" target="_blank">Trie datastructure</a> with search variants </p>
 <p>This provides multiple variants of search functions on a trie structure utilizing STL. The trie is valid for only English alphabets. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/g-s-k-zoro" target="_blank">Ghanashyam</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="abf9e6b7e6f15df4b525a2e7705ba3089" name="abf9e6b7e6f15df4b525a2e7705ba3089"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#abf9e6b7e6f15df4b525a2e7705ba3089">&#9670;&#160;</a></span>main()</h2>
@@ -183,17 +204,14 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00466">466</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  466</span>                                       {</div>
 <div class="line"><span class="lineno">  467</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  468</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  469</span>}</div>
-<div class="ttc" id="atrie__multiple__search_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test a simple search before and after deleting an entry. And to test out the multiple var...</div><div class="ttdef"><b>Definition</b> trie_multiple_search.cpp:425</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/def/trie__multiple__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="atrie__multiple__search_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test a simple search before and after deleting an entry. And to test out the multiple var...</div><div class="ttdef"><b>Definition</b> <a href="../../d7/def/trie__multiple__search_8cpp_source.html#l00425">trie_multiple_search.cpp:425</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -220,9 +238,11 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>Function to test a simple search before and after deleting an entry. And to test out the multiple variants of search. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html#l00425">425</a> of file <a class="el" href="../../d7/def/trie__multiple__search_8cpp_source.html">trie_multiple_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  425</span>                   {</div>
 <div class="line"><span class="lineno">  426</span>    <span class="keyword">auto</span> root = <span class="keyword">new</span> <a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">operations_on_datastructures::trie_operations::Tnode</a>();</div>
-<div class="line"><span class="lineno">  427</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::string&gt;</a> inputs = {</div>
+<div class="line"><span class="lineno">  427</span>    std::vector&lt;std::string&gt; inputs = {</div>
 <div class="line"><span class="lineno">  428</span>        <span class="stringliteral">&quot;abcde&quot;</span>, <span class="stringliteral">&quot;sss&quot;</span>,    <span class="stringliteral">&quot;ssss&quot;</span>,  <span class="stringliteral">&quot;ssst&quot;</span>, <span class="stringliteral">&quot;sssu&quot;</span>, <span class="stringliteral">&quot;sssv&quot;</span>,</div>
 <div class="line"><span class="lineno">  429</span>        <span class="stringliteral">&quot;sst&quot;</span>,   <span class="stringliteral">&quot;ssts&quot;</span>,   <span class="stringliteral">&quot;sstt&quot;</span>,  <span class="stringliteral">&quot;sstu&quot;</span>, <span class="stringliteral">&quot;tutu&quot;</span>, <span class="stringliteral">&quot;tutuv&quot;</span>,</div>
 <div class="line"><span class="lineno">  430</span>        <span class="stringliteral">&quot;tutuu&quot;</span>, <span class="stringliteral">&quot;tutuvs&quot;</span>, <span class="stringliteral">&quot;tutus&quot;</span>, <span class="stringliteral">&quot;tvst&quot;</span>, <span class="stringliteral">&quot;tvsu&quot;</span>, <span class="stringliteral">&quot;vvvv&quot;</span>};</div>
@@ -232,19 +252,19 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  434</span>    }</div>
 <div class="line"><span class="lineno">  435</span>    <span class="comment">// Search an existing entry</span></div>
 <div class="line"><span class="lineno">  436</span>    assert(root-&gt;SearchPresence(<span class="stringliteral">&quot;vvvv&quot;</span>));</div>
-<div class="line"><span class="lineno">  437</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; root-&gt;SearchPresence(<span class="stringliteral">&quot;vvvv&quot;</span>) &lt;&lt; <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">  437</span>    std::cout &lt;&lt; root-&gt;SearchPresence(<span class="stringliteral">&quot;vvvv&quot;</span>) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  438</span>    <span class="comment">// Delete it</span></div>
 <div class="line"><span class="lineno">  439</span>    root-&gt;Delete(<span class="stringliteral">&quot;vvvv&quot;</span>);</div>
 <div class="line"><span class="lineno">  440</span>    <span class="comment">// Search for the entry again</span></div>
 <div class="line"><span class="lineno">  441</span>    assert(!root-&gt;SearchPresence(<span class="stringliteral">&quot;vvvv&quot;</span>));</div>
-<div class="line"><span class="lineno">  442</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; root-&gt;SearchPresence(<span class="stringliteral">&quot;vvvv&quot;</span>) &lt;&lt; <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">  442</span>    std::cout &lt;&lt; root-&gt;SearchPresence(<span class="stringliteral">&quot;vvvv&quot;</span>) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  443</span> </div>
-<div class="line"><span class="lineno">  444</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; root-&gt;SearchPresence(<span class="stringliteral">&quot;tutu&quot;</span>) &lt;&lt; <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">  444</span>    std::cout &lt;&lt; root-&gt;SearchPresence(<span class="stringliteral">&quot;tutu&quot;</span>) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  445</span>    root-&gt;SearchSuggestions(<span class="stringliteral">&quot;tutu&quot;</span>);</div>
-<div class="line"><span class="lineno">  446</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; root-&gt;SearchPresence(<span class="stringliteral">&quot;tutu&quot;</span>) &lt;&lt; <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">  446</span>    std::cout &lt;&lt; root-&gt;SearchPresence(<span class="stringliteral">&quot;tutu&quot;</span>) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  447</span> </div>
 <div class="line"><span class="lineno">  448</span>    root-&gt;SearchSuggestions(<span class="stringliteral">&quot;tutuv&quot;</span>);</div>
-<div class="line"><span class="lineno">  449</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; root-&gt;SearchPresence(<span class="stringliteral">&quot;tutuv&quot;</span>) &lt;&lt; <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">  449</span>    std::cout &lt;&lt; root-&gt;SearchPresence(<span class="stringliteral">&quot;tutuv&quot;</span>) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  450</span> </div>
 <div class="line"><span class="lineno">  451</span>    root-&gt;SearchSuggestions(<span class="stringliteral">&quot;tutuvs&quot;</span>);</div>
 <div class="line"><span class="lineno">  452</span> </div>
@@ -254,16 +274,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  456</span>    root-&gt;SearchSuggestions(</div>
 <div class="line"><span class="lineno">  457</span>        <span class="stringliteral">&quot;&quot;</span>);  <span class="comment">// Empty search to list all the entries in the trie</span></div>
 <div class="line"><span class="lineno">  458</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="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html"><div class="ttname"><a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">operations_on_datastructures::trie_operations::Tnode</a></div><div class="ttdoc">Class defining the structure of trie node and containing the methods to perform operations on them.</div><div class="ttdef"><b>Definition</b> trie_multiple_search.cpp:37</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="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/def/trie__multiple__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html"><div class="ttname"><a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">operations_on_datastructures::trie_operations::Tnode</a></div><div class="ttdoc">Class defining the structure of trie node and containing the methods to perform operations on them.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/def/trie__multiple__search_8cpp_source.html#l00037">trie_multiple_search.cpp:37</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d7/def/trie__multiple__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d7/def/trie__multiple__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 458961180..000000000
--- a/d7/def/trie__multiple__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Function to test a simple search before and after deleting an entry. And to test out the multiple var..." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/d7/def/trie__multiple__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d7/def/trie__multiple__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index f641e2a1c..000000000
--- a/d7/def/trie__multiple__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-71b8792a6b6358b5025d3b8500812b81
\ No newline at end of file
diff --git a/d7/def/trie__multiple__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d7/def/trie__multiple__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 1780d8afe..000000000
--- a/d7/def/trie__multiple__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test a simple search before and after deleting an entry. And to test out the multiple var...">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/def/trie__multiple__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d7/def/trie__multiple__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index c87dc0832..000000000
--- a/d7/def/trie__multiple__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test a simple search before and after deleting an entry. And to test out the multiple var...">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/def/trie__multiple__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map b/d7/def/trie__multiple__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map
deleted file mode 100644
index 53dcb6694..000000000
--- a/d7/def/trie__multiple__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function to test a simple search before and after deleting an entry. And to test out the multiple var..." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/d7/def/trie__multiple__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5 b/d7/def/trie__multiple__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
deleted file mode 100644
index 87968ca2c..000000000
--- a/d7/def/trie__multiple__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f4a3bcd6b396976226b4bac7f0d310bb
\ No newline at end of file
diff --git a/d7/def/trie__multiple__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg b/d7/def/trie__multiple__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
deleted file mode 100644
index b62728d89..000000000
--- a/d7/def/trie__multiple__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test a simple search before and after deleting an entry. And to test out the multiple var...">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d7/def/trie__multiple__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg b/d7/def/trie__multiple__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg
deleted file mode 100644
index c052f5056..000000000
--- a/d7/def/trie__multiple__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test a simple search before and after deleting an entry. And to test out the multiple var...">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d7/def/trie__multiple__search_8cpp_source.html b/d7/def/trie__multiple__search_8cpp_source.html
new file mode 100644
index 000000000..fae580857
--- /dev/null
+++ b/d7/def/trie__multiple__search_8cpp_source.html
@@ -0,0 +1,545 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: operations_on_datastructures/trie_multiple_search.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d7/def/trie__multiple__search_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">trie_multiple_search.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d7/def/trie__multiple__search_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cctype&gt;</span>     </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cstdint&gt;</span>    </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;cstring&gt;</span>    </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;queue&gt;</span>      </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a> {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/d8e/namespacetrie__operations.html">trie_operations</a> {</div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="};">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">   37</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keyword">static</span> <span class="keyword">constexpr</span> uint8_t ENGLISH_ALPHABET_SIZE = 26;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="comment">// pointers to alphabets</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    std::vector&lt;Tnode *&gt; english;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="comment">// To mark the end of word</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordtype">bool</span> endOfWord;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="comment">// To store the frequency of searches for the word</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    uint32_t frequency;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a>() {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        english.resize(ENGLISH_ALPHABET_SIZE, <span class="keyword">nullptr</span>);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        endOfWord = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        frequency = 0;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="comment">// Copy Constructor</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> &amp;<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        english = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>.english;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        endOfWord = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>.endOfWord;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        frequency = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>.frequency;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    }</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> &amp;operator=(<span class="keyword">const</span> <a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> &amp;<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a>(<a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> &amp;&amp;) = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> &amp;operator=(<a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> &amp;&amp;) = <span class="keywordflow">default</span>;</div>
+<div class="foldopen" id="foldopen00072" data-start="{" data-end="}">
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"><a class="line" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0">   72</a></span>    <span class="keyword">inline</span> uint8_t <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0">numberOfChildren</a>(<a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        <span class="keywordflow">return</span> ENGLISH_ALPHABET_SIZE -</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>               std::count(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;english.begin(), <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;english.end(), <span class="keyword">nullptr</span>);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    }</div>
+</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="comment">// Functions to perform operations on trie</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c">Insert</a>(<span class="keyword">const</span> std::string &amp;entry);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aefd24626ac47277431c9b8604e064340">Delete</a>(std::string entry);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169">DeleteFrom</a>(<a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *delete_from, std::string delete_string,</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>                    <span class="keywordtype">int</span> remove_index);</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a4a624fcdf3c3beb2025d69f2cfda8023">SearchPresence</a>(<span class="keyword">const</span> std::string &amp;key);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe">SuggestAutocomplete</a>(<a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *new_root, <span class="keyword">const</span> std::string &amp;prefix);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a18b70172ca4fb2811dbfb9a86e48b34c">SearchSuggestions</a>(<span class="keyword">const</span> std::string &amp;key);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c">SuggestFreqAutocomplete</a>(</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        <a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *new_root, <span class="keyword">const</span> std::string &amp;prefix,</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        std::priority_queue&lt;std::pair&lt;int, std::string&gt; &gt; *suggestions);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503">SearchFreqSuggestions</a>(<span class="keyword">const</span> std::string &amp;key);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6">SelectionTop_3</a>(</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        std::priority_queue&lt;std::pair&lt;int, std::string&gt; &gt; *suggestions);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="comment">// To free up the dynamically allocated objects</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">~Tnode</a>() {</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="keywordtype">int</span> i = 0;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        <span class="keywordflow">for</span> (i = 0; i &lt; ENGLISH_ALPHABET_SIZE; i++) {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            <span class="keywordflow">if</span> (english[i]) {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>                <span class="keyword">delete</span> english[i];</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>            }</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        }</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    }</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>};</div>
+</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="foldopen" id="foldopen00107" data-start="{" data-end="}">
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"><a class="line" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c">  107</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c">Tnode::Insert</a>(<span class="keyword">const</span> std::string &amp;entry) {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *cur_pos = <span class="keyword">this</span>;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="keywordtype">int</span> letter_index = 0;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span> </div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;i : entry) {</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        <span class="comment">// To ignore case</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        letter_index = tolower(i) - 97;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        <span class="comment">// Allocate a node for each character of entry if not present in the</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        <span class="comment">// trie</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        <span class="keywordflow">if</span> (cur_pos-&gt;english[letter_index] == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>            cur_pos-&gt;english[letter_index] = <span class="keyword">new</span> <a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a>();</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>        }</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        cur_pos = cur_pos-&gt;english[letter_index];</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    }</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    <span class="comment">// cur_pos points to the last char, mark it as end of word</span></div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    cur_pos-&gt;endOfWord = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>}</div>
+</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
+<div class="foldopen" id="foldopen00137" data-start="{" data-end="}">
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"><a class="line" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169">  137</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169">Tnode::DeleteFrom</a>(<a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *delete_from, std::string delete_string,</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>                       <span class="keywordtype">int</span> remove_index) {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <span class="keywordflow">if</span> (delete_string.size() == remove_index) {</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        <span class="keywordtype">int</span> letter_index = tolower(delete_string[remove_index]) - 97;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169">DeleteFrom</a>(delete_from-&gt;english[letter_index], delete_string,</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>                   remove_index + 1);</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span> </div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        <span class="keyword">delete</span> delete_from;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    }</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>}</div>
+</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span> </div>
+<div class="foldopen" id="foldopen00153" data-start="{" data-end="}">
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"><a class="line" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aefd24626ac47277431c9b8604e064340">  153</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aefd24626ac47277431c9b8604e064340">Tnode::Delete</a>(std::string entry) {</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *cur_pos = <span class="keyword">this</span>,</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>          *delete_from = <span class="keyword">this</span>;  <span class="comment">// Current pointer pointing to root</span></div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    <span class="keywordtype">int</span> letter_index = 0, delete_from_index = 0, i = 0, n = entry.size();</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span> </div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    <span class="keywordflow">for</span> (i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        <span class="comment">// To ignore case</span></div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>        letter_index = tolower(entry[i]) - 97;</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span> </div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        <span class="comment">// Display error message when given entry is not present in the tree</span></div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        <span class="keywordflow">if</span> (cur_pos-&gt;english[letter_index] == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Entry not Found&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        }</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>        <span class="comment">// If the current node is end of word for the current prefix or if it</span></div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        <span class="comment">// has 2 or more branches It cannot be deleted while deleting the</span></div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>        <span class="comment">// required entry.</span></div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0">numberOfChildren</a>(cur_pos) &gt; 1 || cur_pos-&gt;endOfWord) {</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>            delete_from = cur_pos;      <span class="comment">// denotes the beginning of the shortest</span></div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>                                        <span class="comment">// suffix that is allowed to be deleted</span></div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>            delete_from_index = i - 1;  <span class="comment">// Beginning index of the suffix</span></div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>                                        <span class="comment">// corresponding to the &#39;entry&#39;</span></div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        }</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        <span class="comment">// Traversing through the entry</span></div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        cur_pos = cur_pos-&gt;english[letter_index];</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    }</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span> </div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    <span class="comment">// cur_pos now points to the last char of entry. Display message if that</span></div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    <span class="comment">// entry does not exist</span></div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    <span class="keywordflow">if</span> (!cur_pos-&gt;endOfWord) {</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Entry not Found&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    }</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span> </div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    <span class="comment">// If cur_pos is not a leaf node, unmark end of word and assign 0 to it&#39;s</span></div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    <span class="comment">// frequency for deletion</span></div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0">numberOfChildren</a>(cur_pos)) {</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>        cur_pos-&gt;endOfWord = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>        cur_pos-&gt;frequency = 0;</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    }</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span> </div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    <span class="comment">// The first character of the suffix to be deleted</span></div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    letter_index = tolower(entry[delete_from_index + 1]) - 97;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    <span class="comment">// Point cur_pos to the next node</span></div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    cur_pos = delete_from-&gt;english[letter_index];</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    <span class="comment">// Sever the connection from the main trie</span></div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    delete_from-&gt;english[letter_index] = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span> </div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    <span class="comment">// If number of characters in the suffix are more than 1, recursively delete</span></div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    <span class="comment">// each character starting from cur_pos using the helper function</span></div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    <span class="keywordflow">if</span> (n &gt; delete_from_index + 2) {</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>        <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169">DeleteFrom</a>(cur_pos, entry, delete_from_index + 2);</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    }</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    <span class="comment">// If the suffix is only 1 char in length</span></div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>        <span class="keyword">delete</span> cur_pos;</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    }</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>}</div>
+</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span> </div>
+<div class="foldopen" id="foldopen00220" data-start="{" data-end="}">
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"><a class="line" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a4a624fcdf3c3beb2025d69f2cfda8023">  220</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a4a624fcdf3c3beb2025d69f2cfda8023">Tnode::SearchPresence</a>(<span class="keyword">const</span> std::string &amp;key) {</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    <a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *cur_pos = <span class="keyword">this</span>;</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    <span class="keywordtype">int</span> letter_index = 0;</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span> </div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;i : key) {</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>        letter_index = tolower(i) - 97;</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>        <span class="comment">// If any character in the order of the key is absent, word not found!</span></div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>        <span class="keywordflow">if</span> (cur_pos-&gt;english[letter_index] == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>        }</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>        cur_pos = cur_pos-&gt;english[letter_index];</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    }</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    <span class="comment">// Word is only present in the trie if the key is a valid complete entry and</span></div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    <span class="comment">// not just a prefix.</span></div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    <span class="keywordflow">if</span> (cur_pos-&gt;endOfWord) {</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>        (cur_pos-&gt;frequency)++;</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    }</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>}</div>
+</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span> </div>
+<div class="foldopen" id="foldopen00249" data-start="{" data-end="}">
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"><a class="line" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe">  249</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe">Tnode::SuggestAutocomplete</a>(<a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *new_root, <span class="keyword">const</span> std::string &amp;prefix) {</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    <span class="comment">// Iterate through all 26 nodes as we have to print all strings with the</span></div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    <span class="comment">// given prefix</span></div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    <span class="keywordtype">int</span> i = 0;</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    <span class="keywordflow">for</span> (i = 0; i &lt; ENGLISH_ALPHABET_SIZE; i++) {</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>        <span class="keywordflow">if</span> (new_root-&gt;english[i] != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>            <span class="comment">// Print the sugestion only if it&#39;s a valid complete entry and not</span></div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>            <span class="comment">// just a prefix</span></div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>            <span class="keywordflow">if</span> (new_root-&gt;english[i]-&gt;endOfWord) {</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>                std::cout &lt;&lt; prefix + char(i + 97) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>            }</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span> </div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>            <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe">SuggestAutocomplete</a>(new_root-&gt;english[i], prefix + <span class="keywordtype">char</span>(i + 97));</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>        }</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>    }</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>}</div>
+</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span> </div>
+<div class="foldopen" id="foldopen00274" data-start="{" data-end="}">
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"><a class="line" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a18b70172ca4fb2811dbfb9a86e48b34c">  274</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a18b70172ca4fb2811dbfb9a86e48b34c">Tnode::SearchSuggestions</a>(<span class="keyword">const</span> std::string &amp;key) {</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    <a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *cur_pos = <span class="keyword">nullptr</span>, *prev_pos = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>    cur_pos = prev_pos = <span class="keyword">this</span>;  <span class="comment">// maintaining 2 pointers, initialized to root</span></div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>    <span class="keywordtype">int</span> letter_index = 0;</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>    std::string prefix =</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>        <span class="stringliteral">&quot;&quot;</span>;  <span class="comment">// variable storing the updated value of longest common prefix</span></div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span> </div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;i : key) {</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>        letter_index = tolower(i) - 97;</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>        prev_pos = cur_pos;  <span class="comment">// Previous pointer updated to point to the last</span></div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>                             <span class="comment">// char of the longest common prefix</span></div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span> </div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>        <span class="comment">// When the node for the character does not exist, longest prefix has</span></div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>        <span class="comment">// been determined and SuggestAutocomplete is called</span></div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>        <span class="keywordflow">if</span> (cur_pos-&gt;english[letter_index] == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>            <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe">SuggestAutocomplete</a>(prev_pos, prefix);</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;- - - - - - - - - - - - - - - - - - - - - - - - - - &quot;</span></div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>                      &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>        }</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>        <span class="comment">// Updating the longest common prefix</span></div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>        prefix += char(tolower(i));</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>        cur_pos = cur_pos-&gt;english[letter_index];</div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>    }</div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>    <span class="comment">// If the key is a valid entry of trie, display it @ top of the suggestions</span></div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>    <span class="keywordflow">if</span> (cur_pos-&gt;endOfWord) {</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>        std::cout &lt;&lt; key &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>        (cur_pos-&gt;frequency)++;</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>    }</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span> </div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>    (void)prev_pos;  <span class="comment">// Idiom to ignore previous pointer</span></div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span> </div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>    <span class="comment">// Call for suggestions when the search key is present as an entry/a prefix</span></div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>    <span class="comment">// in the trie</span></div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>    <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe">SuggestAutocomplete</a>(cur_pos, prefix);</div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;- - - - - - - - - - - - - - - - - - - - - - - - - - &quot;</span></div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>    <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>}</div>
+</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span> </div>
+<div class="foldopen" id="foldopen00320" data-start="{" data-end="}">
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"><a class="line" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6">  320</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6">Tnode::SelectionTop_3</a>(</div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>    std::priority_queue&lt;std::pair&lt;int, std::string&gt; &gt; *suggestions) {</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>    <span class="comment">// Display Either top 3 or total number of suggestions, whichever is smaller</span></div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>    <span class="keywordtype">int</span> n = suggestions-&gt;size(), Top = 0;</div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>    Top = n &lt; 3 ? n : 3;</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>    <span class="keywordflow">while</span> (Top--) {</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>        std::cout &lt;&lt; suggestions-&gt;top().second &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>        suggestions-&gt;pop();</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>    }</div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>}</div>
+</div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span> </div>
+<div class="foldopen" id="foldopen00340" data-start="{" data-end="}">
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"><a class="line" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c">  340</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c">Tnode::SuggestFreqAutocomplete</a>(</div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>    <a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *new_root, <span class="keyword">const</span> std::string &amp;prefix,</div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>    std::priority_queue&lt;std::pair&lt;int, std::string&gt; &gt; *suggestions) {</div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>    <span class="keywordtype">int</span> i = 0;</div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>    <span class="keywordflow">for</span> (i = 0; i &lt; ENGLISH_ALPHABET_SIZE; i++) {</div>
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span>        <span class="keywordflow">if</span> (new_root-&gt;english[i] != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>            <span class="comment">// Add to sugestions only if it&#39;s a valid complete entry and not</span></div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>            <span class="comment">// just a prefix</span></div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>            <span class="keywordflow">if</span> (new_root-&gt;english[i]-&gt;endOfWord) {</div>
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>                suggestions-&gt;push(std::make_pair(</div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>                    new_root-&gt;english[i]-&gt;frequency, prefix + <span class="keywordtype">char</span>(i + 97)));</div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>            }</div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span> </div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>            <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c">SuggestFreqAutocomplete</a>(new_root-&gt;english[i], prefix + <span class="keywordtype">char</span>(i + 97),</div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>                                    suggestions);</div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>        }</div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>    }</div>
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>}</div>
+</div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span> </div>
+<div class="foldopen" id="foldopen00368" data-start="{" data-end="}">
+<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"><a class="line" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503">  368</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503">Tnode::SearchFreqSuggestions</a>(<span class="keyword">const</span> std::string &amp;key) {</div>
+<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>    <a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> *cur_pos = <span class="keyword">nullptr</span>, *prev_pos = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>    cur_pos = prev_pos = <span class="keyword">this</span>;  <span class="comment">// maintaining 2 pointers, initialized to root</span></div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>    <span class="keywordtype">int</span> letter_index = 0;</div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>    std::string prefix =</div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>        <span class="stringliteral">&quot;&quot;</span>;  <span class="comment">// variable storing the updated value of longest common prefix</span></div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>    std::priority_queue&lt;std::pair&lt;int, std::string&gt; &gt;</div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>        suggestions;  <span class="comment">// max heap to store (frequency, word) in descending order</span></div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>                      <span class="comment">// of freq</span></div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span> </div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>    std::priority_queue&lt;std::pair&lt;int, std::string&gt; &gt; *Suggestions =</div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>        &amp;suggestions;</div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span> </div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;i : key) {</div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>        letter_index = tolower(i) - 97;</div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>        prev_pos = cur_pos;  <span class="comment">// Previous pointer updated to point to the last</span></div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>                             <span class="comment">// char of the longest common prefix</span></div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span> </div>
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>        <span class="comment">// When the node for the character does not exist, longest prefix has</span></div>
+<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>        <span class="comment">// been determined and SuggestFreqAutocomplete is called</span></div>
+<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>        <span class="keywordflow">if</span> (cur_pos-&gt;english[letter_index] == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>            <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c">SuggestFreqAutocomplete</a>(prev_pos, prefix, Suggestions);</div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>            <span class="comment">// To display the top 3 results</span></div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>            <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6">SelectionTop_3</a>(Suggestions);</div>
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;- - - - - - - - - - - - - - - - - - - - - - - - - - &quot;</span></div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>                      &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>        }</div>
+<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>        <span class="comment">// Updating the longest common prefix</span></div>
+<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>        prefix += char(tolower(i));</div>
+<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>        cur_pos = cur_pos-&gt;english[letter_index];</div>
+<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>    }</div>
+<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span>    <span class="comment">// If the key is a valid entry of trie, display it @ top of the suggestions</span></div>
+<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>    <span class="keywordflow">if</span> (cur_pos-&gt;endOfWord) {</div>
+<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>        (cur_pos-&gt;frequency)++;</div>
+<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>        std::cout &lt;&lt; key &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>    }</div>
+<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span> </div>
+<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>    (void)prev_pos;  <span class="comment">// Idiom to ignore previous pointer</span></div>
+<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span> </div>
+<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>    <span class="comment">// Call for Suggestions when the search key is present as an entry/a prefix</span></div>
+<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>    <span class="comment">// in the trie</span></div>
+<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>    <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c">SuggestFreqAutocomplete</a>(cur_pos, prefix, Suggestions);</div>
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>    <span class="comment">// Display the top 3 results</span></div>
+<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>    <a class="code hl_function" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6">SelectionTop_3</a>(Suggestions);</div>
+<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span> </div>
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;- - - - - - - - - - - - - - - - - - - - - - - - - - &quot;</span></div>
+<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>    <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>}</div>
+</div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>}  <span class="comment">// namespace trie_operations</span></div>
+<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>}  <span class="comment">// namespace operations_on_datastructures</span></div>
+<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span> </div>
+<div class="foldopen" id="foldopen00425" data-start="{" data-end="}">
+<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"><a class="line" href="../../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  425</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span>    <span class="keyword">auto</span> root = <span class="keyword">new</span> <a class="code hl_class" href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">operations_on_datastructures::trie_operations::Tnode</a>();</div>
+<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>    std::vector&lt;std::string&gt; inputs = {</div>
+<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>        <span class="stringliteral">&quot;abcde&quot;</span>, <span class="stringliteral">&quot;sss&quot;</span>,    <span class="stringliteral">&quot;ssss&quot;</span>,  <span class="stringliteral">&quot;ssst&quot;</span>, <span class="stringliteral">&quot;sssu&quot;</span>, <span class="stringliteral">&quot;sssv&quot;</span>,</div>
+<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span>        <span class="stringliteral">&quot;sst&quot;</span>,   <span class="stringliteral">&quot;ssts&quot;</span>,   <span class="stringliteral">&quot;sstt&quot;</span>,  <span class="stringliteral">&quot;sstu&quot;</span>, <span class="stringliteral">&quot;tutu&quot;</span>, <span class="stringliteral">&quot;tutuv&quot;</span>,</div>
+<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>        <span class="stringliteral">&quot;tutuu&quot;</span>, <span class="stringliteral">&quot;tutuvs&quot;</span>, <span class="stringliteral">&quot;tutus&quot;</span>, <span class="stringliteral">&quot;tvst&quot;</span>, <span class="stringliteral">&quot;tvsu&quot;</span>, <span class="stringliteral">&quot;vvvv&quot;</span>};</div>
+<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span> </div>
+<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;i : inputs) {</div>
+<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>        root-&gt;Insert(i);</div>
+<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>    }</div>
+<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>    <span class="comment">// Search an existing entry</span></div>
+<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>    assert(root-&gt;SearchPresence(<span class="stringliteral">&quot;vvvv&quot;</span>));</div>
+<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span>    std::cout &lt;&lt; root-&gt;SearchPresence(<span class="stringliteral">&quot;vvvv&quot;</span>) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>    <span class="comment">// Delete it</span></div>
+<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>    root-&gt;Delete(<span class="stringliteral">&quot;vvvv&quot;</span>);</div>
+<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>    <span class="comment">// Search for the entry again</span></div>
+<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>    assert(!root-&gt;SearchPresence(<span class="stringliteral">&quot;vvvv&quot;</span>));</div>
+<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>    std::cout &lt;&lt; root-&gt;SearchPresence(<span class="stringliteral">&quot;vvvv&quot;</span>) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span> </div>
+<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span>    std::cout &lt;&lt; root-&gt;SearchPresence(<span class="stringliteral">&quot;tutu&quot;</span>) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span>    root-&gt;SearchSuggestions(<span class="stringliteral">&quot;tutu&quot;</span>);</div>
+<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span>    std::cout &lt;&lt; root-&gt;SearchPresence(<span class="stringliteral">&quot;tutu&quot;</span>) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span> </div>
+<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span>    root-&gt;SearchSuggestions(<span class="stringliteral">&quot;tutuv&quot;</span>);</div>
+<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span>    std::cout &lt;&lt; root-&gt;SearchPresence(<span class="stringliteral">&quot;tutuv&quot;</span>) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span> </div>
+<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span>    root-&gt;SearchSuggestions(<span class="stringliteral">&quot;tutuvs&quot;</span>);</div>
+<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span> </div>
+<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>    root-&gt;SearchFreqSuggestions(</div>
+<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>        <span class="stringliteral">&quot;tu&quot;</span>);  <span class="comment">// The top 3 frequent entries with prefix tu are tutu, tutuv &amp;</span></div>
+<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>                <span class="comment">// tutuvs respectively</span></div>
+<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>    root-&gt;SearchSuggestions(</div>
+<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>        <span class="stringliteral">&quot;&quot;</span>);  <span class="comment">// Empty search to list all the entries in the trie</span></div>
+<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span>}</div>
+</div>
+<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span> </div>
+<div class="foldopen" id="foldopen00466" data-start="{" data-end="}">
+<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"><a class="line" href="../../d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089">  466</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> <span class="keyword">const</span> *argv[]) {</div>
+<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span>    <a class="code hl_function" href="../../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span>}</div>
+</div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html"><div class="ttname"><a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">operations_on_datastructures::trie_operations::Tnode</a></div><div class="ttdoc">Class defining the structure of trie node and containing the methods to perform operations on them.</div><div class="ttdef"><b>Definition</b> <a href="#l00037">trie_multiple_search.cpp:37</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_a097913c4badec2b60d50a171ecc299fe"><div class="ttname"><a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe">operations_on_datastructures::trie_operations::Tnode::SuggestAutocomplete</a></div><div class="ttdeci">void SuggestAutocomplete(Tnode *new_root, const std::string &amp;prefix)</div><div class="ttdoc">Recursive function to suggest all the entries of trie which have a given common prefix.</div><div class="ttdef"><b>Definition</b> <a href="#l00249">trie_multiple_search.cpp:249</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_a18b70172ca4fb2811dbfb9a86e48b34c"><div class="ttname"><a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a18b70172ca4fb2811dbfb9a86e48b34c">operations_on_datastructures::trie_operations::Tnode::SearchSuggestions</a></div><div class="ttdeci">void SearchSuggestions(const std::string &amp;key)</div><div class="ttdoc">Lists out all the words in trie with the longest prefix of the search key that is present in the trie...</div><div class="ttdef"><b>Definition</b> <a href="#l00274">trie_multiple_search.cpp:274</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_a4a624fcdf3c3beb2025d69f2cfda8023"><div class="ttname"><a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a4a624fcdf3c3beb2025d69f2cfda8023">operations_on_datastructures::trie_operations::Tnode::SearchPresence</a></div><div class="ttdeci">bool SearchPresence(const std::string &amp;key)</div><div class="ttdoc">Function to check a word's presence in the trie (Basic)</div><div class="ttdef"><b>Definition</b> <a href="#l00220">trie_multiple_search.cpp:220</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_a7c5ab271d8042540f64ef16d259d1503"><div class="ttname"><a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503">operations_on_datastructures::trie_operations::Tnode::SearchFreqSuggestions</a></div><div class="ttdeci">void SearchFreqSuggestions(const std::string &amp;key)</div><div class="ttdoc">Lists out the most frequent words in trie with the longest prefix of the search key that is present i...</div><div class="ttdef"><b>Definition</b> <a href="#l00368">trie_multiple_search.cpp:368</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_a7ecb75b985b1ffc575a880274f855b1c"><div class="ttname"><a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c">operations_on_datastructures::trie_operations::Tnode::Insert</a></div><div class="ttdeci">void Insert(const std::string &amp;entry)</div><div class="ttdoc">Function to insert a word in the trie.</div><div class="ttdef"><b>Definition</b> <a href="#l00107">trie_multiple_search.cpp:107</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_a9e556f52c837190ecf4265b1f05cfe9c"><div class="ttname"><a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c">operations_on_datastructures::trie_operations::Tnode::SuggestFreqAutocomplete</a></div><div class="ttdeci">void SuggestFreqAutocomplete(Tnode *new_root, const std::string &amp;prefix, std::priority_queue&lt; std::pair&lt; int, std::string &gt; &gt; *suggestions)</div><div class="ttdoc">Recursive function to suggest most frequently searched entries of trie which have a given common pref...</div><div class="ttdef"><b>Definition</b> <a href="#l00340">trie_multiple_search.cpp:340</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_aacafb8c9f3ebac7ac6c01d9645bb67b6"><div class="ttname"><a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6">operations_on_datastructures::trie_operations::Tnode::SelectionTop_3</a></div><div class="ttdeci">void SelectionTop_3(std::priority_queue&lt; std::pair&lt; int, std::string &gt; &gt; *suggestions)</div><div class="ttdoc">Function to display the 3 suggestions with highest frequency of search hits.</div><div class="ttdef"><b>Definition</b> <a href="#l00320">trie_multiple_search.cpp:320</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_adef6940391f981ab86767775176b7169"><div class="ttname"><a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169">operations_on_datastructures::trie_operations::Tnode::DeleteFrom</a></div><div class="ttdeci">void DeleteFrom(Tnode *delete_from, std::string delete_string, int remove_index)</div><div class="ttdoc">Function recursively deletes the substring character by character iterating through the string to be ...</div><div class="ttdef"><b>Definition</b> <a href="#l00137">trie_multiple_search.cpp:137</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_aefd24626ac47277431c9b8604e064340"><div class="ttname"><a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aefd24626ac47277431c9b8604e064340">operations_on_datastructures::trie_operations::Tnode::Delete</a></div><div class="ttdeci">void Delete(std::string entry)</div><div class="ttdoc">Function to verify presence and hence delete an entry from the trie.</div><div class="ttdef"><b>Definition</b> <a href="#l00153">trie_multiple_search.cpp:153</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1trie__operations_1_1_tnode_html_afca808362c13273ca8c8ae7d58e8eee0"><div class="ttname"><a href="../../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0">operations_on_datastructures::trie_operations::Tnode::numberOfChildren</a></div><div class="ttdeci">uint8_t numberOfChildren(Tnode *node)</div><div class="ttdoc">Function to count the number of children a node in the trie has.</div><div class="ttdef"><b>Definition</b> <a href="#l00072">trie_multiple_search.cpp:72</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespaceoperations__on__datastructures_html"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></div><div class="ttdoc">for std::vector</div></div>
+<div class="ttc" id="anamespacetrie__operations_html"><div class="ttname"><a href="../../df/d8e/namespacetrie__operations.html">trie_operations</a></div><div class="ttdoc">Functions for Trie datastructure implementation.</div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+<div class="ttc" id="atrie__multiple__search_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test a simple search before and after deleting an entry. And to test out the multiple var...</div><div class="ttdef"><b>Definition</b> <a href="#l00425">trie_multiple_search.cpp:425</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><a class="el" href="../../d7/def/trie__multiple__search_8cpp.html">trie_multiple_search.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d7/df9/structothers_1_1iterative__tree__traversals_1_1_node-members.html b/d7/df9/structothers_1_1iterative__tree__traversals_1_1_node-members.html
index 4e00ad4ff..957a70e9d 100644
--- a/d7/df9/structothers_1_1iterative__tree__traversals_1_1_node-members.html
+++ b/d7/df9/structothers_1_1iterative__tree__traversals_1_1_node-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/d01/struct_item-members.html b/d8/d01/struct_item-members.html
index 9d882092a..283551d65 100644
--- a/d8/d01/struct_item-members.html
+++ b/d8/d01/struct_item-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/d10/structlist.html b/d8/d10/structlist.html
index 420750849..94462894d 100644
--- a/d8/d10/structlist.html
+++ b/d8/d10/structlist.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: list Struct Reference</title>
+<title>TheAlgorithms/C++: list Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,19 +135,56 @@ Collaboration diagram for list:</div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:aaab2e33bc1ca6f44e72239bfb58f100c" id="r_aaab2e33bc1ca6f44e72239bfb58f100c"><td class="memItemLeft" align="right" valign="top"><a id="aaab2e33bc1ca6f44e72239bfb58f100c" name="aaab2e33bc1ca6f44e72239bfb58f100c"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>key</b></td></tr>
-<tr class="memdesc:aaab2e33bc1ca6f44e72239bfb58f100c"><td class="mdescLeft">&#160;</td><td class="mdescRight">key value for node <br /></td></tr>
+<tr class="memitem:aaab2e33bc1ca6f44e72239bfb58f100c" id="r_aaab2e33bc1ca6f44e72239bfb58f100c"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aaab2e33bc1ca6f44e72239bfb58f100c">key</a></td></tr>
+<tr class="memdesc:aaab2e33bc1ca6f44e72239bfb58f100c"><td class="mdescLeft">&#160;</td><td class="mdescRight">key value for node  <br /></td></tr>
 <tr class="separator:aaab2e33bc1ca6f44e72239bfb58f100c"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a1900fe79e875e2838625b2eb60837f8f" id="r_a1900fe79e875e2838625b2eb60837f8f"><td class="memItemLeft" align="right" valign="top"><a id="a1900fe79e875e2838625b2eb60837f8f" name="a1900fe79e875e2838625b2eb60837f8f"></a>
-struct <a class="el" href="../../d8/d10/structlist.html">list</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>next</b></td></tr>
-<tr class="memdesc:a1900fe79e875e2838625b2eb60837f8f"><td class="mdescLeft">&#160;</td><td class="mdescRight">pointer to next link in the chain <br /></td></tr>
+<tr class="memitem:a1900fe79e875e2838625b2eb60837f8f" id="r_a1900fe79e875e2838625b2eb60837f8f"><td class="memItemLeft" align="right" valign="top">struct <a class="el" href="../../d8/d10/structlist.html">list</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1900fe79e875e2838625b2eb60837f8f">next</a></td></tr>
+<tr class="memdesc:a1900fe79e875e2838625b2eb60837f8f"><td class="mdescLeft">&#160;</td><td class="mdescRight">pointer to next link in the chain  <br /></td></tr>
 <tr class="separator:a1900fe79e875e2838625b2eb60837f8f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>a one-way linked list </p>
-</div><hr/>The documentation for this struct was generated from the following file:<ul>
-<li>search/<a class="el" href="../../d1/df3/hash__search_8cpp.html">hash_search.cpp</a></li>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/df3/hash__search_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../d1/df3/hash__search_8cpp_source.html">hash_search.cpp</a>.</p>
+</div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="aaab2e33bc1ca6f44e72239bfb58f100c" name="aaab2e33bc1ca6f44e72239bfb58f100c"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aaab2e33bc1ca6f44e72239bfb58f100c">&#9670;&#160;</a></span>key</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int list::key</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>key value for node </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/df3/hash__search_8cpp_source.html#l00030">30</a> of file <a class="el" href="../../d1/df3/hash__search_8cpp_source.html">hash_search.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a1900fe79e875e2838625b2eb60837f8f" name="a1900fe79e875e2838625b2eb60837f8f"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a1900fe79e875e2838625b2eb60837f8f">&#9670;&#160;</a></span>next</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">struct <a class="el" href="../../d8/d10/structlist.html">list</a>* list::next</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>pointer to next link in the chain </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/df3/hash__search_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../d1/df3/hash__search_8cpp_source.html">hash_search.cpp</a>.</p>
+
+</div>
+</div>
+<hr/>The documentation for this struct was generated from the following file:<ul>
+<li>search/<a class="el" href="../../d1/df3/hash__search_8cpp_source.html">hash_search.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d8/d13/bubble__sort_8cpp.html b/d8/d13/bubble__sort_8cpp.html
index 7d1ae3908..e797ca825 100644
--- a/d8/d13/bubble__sort_8cpp.html
+++ b/d8/d13/bubble__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/bubble_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/bubble_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for bubble_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d1d/bubble__sort_8cpp__incl.svg" width="504" height="111"><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">
+</div>
+<p><a href="../../d8/d13/bubble__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -137,7 +156,7 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:af3b12930a83915712461d53fe9659686" id="r_af3b12930a83915712461d53fe9659686"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:af3b12930a83915712461d53fe9659686"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af3b12930a83915712461d53fe9659686">sorting::bubble_sort::bubble_sort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;array)</td></tr>
+<tr class="memitem:af3b12930a83915712461d53fe9659686"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af3b12930a83915712461d53fe9659686">sorting::bubble_sort::bubble_sort</a> (std::vector&lt; T &gt; &amp;array)</td></tr>
 <tr class="memdesc:af3b12930a83915712461d53fe9659686"><td class="mdescLeft">&#160;</td><td class="mdescRight">Bubble sort algorithm.  <br /></td></tr>
 <tr class="separator:af3b12930a83915712461d53fe9659686"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -171,6 +190,8 @@ Average Case</h3>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Deepak-j-p" target="_blank">Deepak</a> </dd>
 <dd>
 <a href="https://github.com/hollowcrust" target="_blank">Nguyen Phuc Chuong</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/d13/bubble__sort_8cpp_source.html">bubble_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="af3b12930a83915712461d53fe9659686" name="af3b12930a83915712461d53fe9659686"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#af3b12930a83915712461d53fe9659686">&#9670;&#160;</a></span>bubble_sort()</h2>
@@ -181,9 +202,9 @@ Average Case</h3>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; sorting::bubble_sort::bubble_sort </td>
+          <td class="memname">std::vector&lt; T &gt; sorting::bubble_sort::bubble_sort </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>array</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>array</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -197,31 +218,26 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The array sorted in ascending order </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d13/bubble__sort_8cpp_source.html#l00072">72</a> of file <a class="el" href="../../d8/d13/bubble__sort_8cpp_source.html">bubble_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   72</span>                                              {</div>
 <div class="line"><span class="lineno">   73</span>  <span class="comment">// swap_check flag to terminate the function early</span></div>
 <div class="line"><span class="lineno">   74</span>  <span class="comment">// if there is no swap occurs in one iteration.</span></div>
 <div class="line"><span class="lineno">   75</span>  <span class="keywordtype">bool</span> swap_check = <span class="keyword">true</span>;</div>
-<div class="line"><span class="lineno">   76</span>  <span class="keywordtype">int</span> size = array.<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">   76</span>  <span class="keywordtype">int</span> size = array.size();</div>
 <div class="line"><span class="lineno">   77</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; (i &lt; size) &amp;&amp; (swap_check); i++) {</div>
 <div class="line"><span class="lineno">   78</span>    swap_check = <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   79</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; size - 1 - i; j++) {</div>
 <div class="line"><span class="lineno">   80</span>      <span class="keywordflow">if</span> (array[j] &gt; array[j + 1]) {</div>
 <div class="line"><span class="lineno">   81</span>        swap_check = <span class="keyword">true</span>;</div>
-<div class="line"><span class="lineno">   82</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(array[j], array[j + 1]);</div>
+<div class="line"><span class="lineno">   82</span>        std::swap(array[j], array[j + 1]);</div>
 <div class="line"><span class="lineno">   83</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> </div>
 <div class="line"><span class="lineno">   87</span>  <span class="keywordflow">return</span> array;</div>
 <div class="line"><span class="lineno">   88</span>}</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="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- 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="../../d8/d13/bubble__sort_8cpp_af3b12930a83915712461d53fe9659686_cgraph.svg" width="310" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -241,17 +257,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d13/bubble__sort_8cpp_source.html#l00131">131</a> of file <a class="el" href="../../d8/d13/bubble__sort_8cpp_source.html">bubble_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  131</span>           {</div>
 <div class="line"><span class="lineno">  132</span>  <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
 <div class="line"><span class="lineno">  133</span>  <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  134</span>}</div>
-<div class="ttc" id="abubble__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> bubble_sort.cpp:96</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d13/bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="322" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="abubble__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d13/bubble__sort_8cpp_source.html#l00096">bubble_sort.cpp:96</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -279,47 +292,40 @@ Here is the call graph for this function:</div>
 
 <p>Self-test implementation. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
-<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&lt;int&gt;</a> vec_1 = {3, 1, -9, 0};</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&lt;int&gt;</a> sorted_1 = <a class="code hl_function" href="#af3b12930a83915712461d53fe9659686">sorting::bubble_sort::bubble_sort</a>(vec_1);</div>
-<div class="line"><span class="lineno">   99</span> </div>
-<div class="line"><span class="lineno">  100</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> vec_2 = {3};</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&lt;int&gt;</a> sorted_2 = <a class="code hl_function" href="#af3b12930a83915712461d53fe9659686">sorting::bubble_sort::bubble_sort</a>(vec_2);</div>
-<div class="line"><span class="lineno">  102</span> </div>
-<div class="line"><span class="lineno">  103</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> vec_3 = {10, 10, 10, 10, 10};</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&lt;int&gt;</a> sorted_3 = <a class="code hl_function" href="#af3b12930a83915712461d53fe9659686">sorting::bubble_sort::bubble_sort</a>(vec_3);</div>
-<div class="line"><span class="lineno">  105</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&lt;float&gt;</a> vec_4 = {1234, -273.1, 23, 150, 1234, 1555.55, -2000};</div>
-<div class="line"><span class="lineno">  107</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> sorted_4 = <a class="code hl_function" href="#af3b12930a83915712461d53fe9659686">sorting::bubble_sort::bubble_sort</a>(vec_4);</div>
-<div class="line"><span class="lineno">  108</span> </div>
-<div class="line"><span class="lineno">  109</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;char&gt;</a> vec_5 = {<span class="charliteral">&#39;z&#39;</span>, <span class="charliteral">&#39;Z&#39;</span>, <span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;B&#39;</span>, <span class="charliteral">&#39; &#39;</span>, <span class="charliteral">&#39;c&#39;</span>, <span class="charliteral">&#39;a&#39;</span>};</div>
-<div class="line"><span class="lineno">  110</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;char&gt;</a> sorted_5 = <a class="code hl_function" href="#af3b12930a83915712461d53fe9659686">sorting::bubble_sort::bubble_sort</a>(vec_5);</div>
-<div class="line"><span class="lineno">  111</span> </div>
-<div class="line"><span class="lineno">  112</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::string&gt;</a> vec_6 = {<span class="stringliteral">&quot;Hello&quot;</span>, <span class="stringliteral">&quot;hello&quot;</span>, <span class="stringliteral">&quot;Helo&quot;</span>, <span class="stringliteral">&quot;Hi&quot;</span>, <span class="stringliteral">&quot;hehe&quot;</span>};</div>
-<div class="line"><span class="lineno">  113</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::string&gt;</a> sorted_6 = <a class="code hl_function" href="#af3b12930a83915712461d53fe9659686">sorting::bubble_sort::bubble_sort</a>(vec_6);</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/container/vector.html">std::vector&lt;std::pair&lt;int, char&gt;</a>&gt; vec_7 = {{10, <span class="charliteral">&#39;c&#39;</span>}, {2, <span class="charliteral">&#39;z&#39;</span>}, {10, <span class="charliteral">&#39;a&#39;</span>}, {0, <span class="charliteral">&#39;b&#39;</span>}, {-1, <span class="charliteral">&#39;z&#39;</span>}};</div>
-<div class="line"><span class="lineno">  116</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::pair&lt;int, char&gt;</a>&gt; sorted_7 = <a class="code hl_function" href="#af3b12930a83915712461d53fe9659686">sorting::bubble_sort::bubble_sort</a>(vec_7);</div>
-<div class="line"><span class="lineno">  117</span> </div>
-<div class="line"><span class="lineno">  118</span>  assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(sorted_1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), sorted_1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()));</div>
-<div class="line"><span class="lineno">  119</span>  assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(sorted_2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), sorted_2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()));</div>
-<div class="line"><span class="lineno">  120</span>  assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(sorted_3.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), sorted_3.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()));</div>
-<div class="line"><span class="lineno">  121</span>  assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(sorted_4.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), sorted_4.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()));</div>
-<div class="line"><span class="lineno">  122</span>  assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(sorted_5.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), sorted_5.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()));</div>
-<div class="line"><span class="lineno">  123</span>  assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(sorted_6.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), sorted_6.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()));</div>
-<div class="line"><span class="lineno">  124</span>  assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(sorted_7.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), sorted_7.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()));</div>
-<div class="line"><span class="lineno">  125</span>}</div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="abubble__sort_8cpp_html_af3b12930a83915712461d53fe9659686"><div class="ttname"><a href="#af3b12930a83915712461d53fe9659686">sorting::bubble_sort::bubble_sort</a></div><div class="ttdeci">std::vector&lt; T &gt; bubble_sort(std::vector&lt; T &gt; &amp;array)</div><div class="ttdoc">Bubble sort algorithm.</div><div class="ttdef"><b>Definition</b> bubble_sort.cpp:72</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d13/bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="224" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d8/d13/bubble__sort_8cpp_source.html#l00096">96</a> of file <a class="el" href="../../d8/d13/bubble__sort_8cpp_source.html">bubble_sort.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   96</span>                   {</div>
+<div class="line"><span class="lineno">   97</span>  std::vector&lt;int&gt; vec_1 = {3, 1, -9, 0};</div>
+<div class="line"><span class="lineno">   98</span>  std::vector&lt;int&gt; sorted_1 = <a class="code hl_function" href="#af3b12930a83915712461d53fe9659686">sorting::bubble_sort::bubble_sort</a>(vec_1);</div>
+<div class="line"><span class="lineno">   99</span> </div>
+<div class="line"><span class="lineno">  100</span>  std::vector&lt;int&gt; vec_2 = {3};</div>
+<div class="line"><span class="lineno">  101</span>  std::vector&lt;int&gt; sorted_2 = <a class="code hl_function" href="#af3b12930a83915712461d53fe9659686">sorting::bubble_sort::bubble_sort</a>(vec_2);</div>
+<div class="line"><span class="lineno">  102</span> </div>
+<div class="line"><span class="lineno">  103</span>  std::vector&lt;int&gt; vec_3 = {10, 10, 10, 10, 10};</div>
+<div class="line"><span class="lineno">  104</span>  std::vector&lt;int&gt; sorted_3 = <a class="code hl_function" href="#af3b12930a83915712461d53fe9659686">sorting::bubble_sort::bubble_sort</a>(vec_3);</div>
+<div class="line"><span class="lineno">  105</span> </div>
+<div class="line"><span class="lineno">  106</span>  std::vector&lt;float&gt; vec_4 = {1234, -273.1, 23, 150, 1234, 1555.55, -2000};</div>
+<div class="line"><span class="lineno">  107</span>  std::vector&lt;float&gt; sorted_4 = <a class="code hl_function" href="#af3b12930a83915712461d53fe9659686">sorting::bubble_sort::bubble_sort</a>(vec_4);</div>
+<div class="line"><span class="lineno">  108</span> </div>
+<div class="line"><span class="lineno">  109</span>  std::vector&lt;char&gt; vec_5 = {<span class="charliteral">&#39;z&#39;</span>, <span class="charliteral">&#39;Z&#39;</span>, <span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;B&#39;</span>, <span class="charliteral">&#39; &#39;</span>, <span class="charliteral">&#39;c&#39;</span>, <span class="charliteral">&#39;a&#39;</span>};</div>
+<div class="line"><span class="lineno">  110</span>  std::vector&lt;char&gt; sorted_5 = <a class="code hl_function" href="#af3b12930a83915712461d53fe9659686">sorting::bubble_sort::bubble_sort</a>(vec_5);</div>
+<div class="line"><span class="lineno">  111</span> </div>
+<div class="line"><span class="lineno">  112</span>  std::vector&lt;std::string&gt; vec_6 = {<span class="stringliteral">&quot;Hello&quot;</span>, <span class="stringliteral">&quot;hello&quot;</span>, <span class="stringliteral">&quot;Helo&quot;</span>, <span class="stringliteral">&quot;Hi&quot;</span>, <span class="stringliteral">&quot;hehe&quot;</span>};</div>
+<div class="line"><span class="lineno">  113</span>  std::vector&lt;std::string&gt; sorted_6 = <a class="code hl_function" href="#af3b12930a83915712461d53fe9659686">sorting::bubble_sort::bubble_sort</a>(vec_6);</div>
+<div class="line"><span class="lineno">  114</span> </div>
+<div class="line"><span class="lineno">  115</span>  std::vector&lt;std::pair&lt;int, char&gt;&gt; vec_7 = {{10, <span class="charliteral">&#39;c&#39;</span>}, {2, <span class="charliteral">&#39;z&#39;</span>}, {10, <span class="charliteral">&#39;a&#39;</span>}, {0, <span class="charliteral">&#39;b&#39;</span>}, {-1, <span class="charliteral">&#39;z&#39;</span>}};</div>
+<div class="line"><span class="lineno">  116</span>  std::vector&lt;std::pair&lt;int, char&gt;&gt; sorted_7 = <a class="code hl_function" href="#af3b12930a83915712461d53fe9659686">sorting::bubble_sort::bubble_sort</a>(vec_7);</div>
+<div class="line"><span class="lineno">  117</span> </div>
+<div class="line"><span class="lineno">  118</span>  assert(std::is_sorted(sorted_1.begin(), sorted_1.end()));</div>
+<div class="line"><span class="lineno">  119</span>  assert(std::is_sorted(sorted_2.begin(), sorted_2.end()));</div>
+<div class="line"><span class="lineno">  120</span>  assert(std::is_sorted(sorted_3.begin(), sorted_3.end()));</div>
+<div class="line"><span class="lineno">  121</span>  assert(std::is_sorted(sorted_4.begin(), sorted_4.end()));</div>
+<div class="line"><span class="lineno">  122</span>  assert(std::is_sorted(sorted_5.begin(), sorted_5.end()));</div>
+<div class="line"><span class="lineno">  123</span>  assert(std::is_sorted(sorted_6.begin(), sorted_6.end()));</div>
+<div class="line"><span class="lineno">  124</span>  assert(std::is_sorted(sorted_7.begin(), sorted_7.end()));</div>
+<div class="line"><span class="lineno">  125</span>}</div>
+<div class="ttc" id="abubble__sort_8cpp_html_af3b12930a83915712461d53fe9659686"><div class="ttname"><a href="#af3b12930a83915712461d53fe9659686">sorting::bubble_sort::bubble_sort</a></div><div class="ttdeci">std::vector&lt; T &gt; bubble_sort(std::vector&lt; T &gt; &amp;array)</div><div class="ttdoc">Bubble sort algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d13/bubble__sort_8cpp_source.html#l00072">bubble_sort.cpp:72</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d8/d13/bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/d13/bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 938b6449b..000000000
--- a/d8/d13/bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementation." alt="" coords="5,55,49,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="97,5,219,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,57,106,35,108,40,50,62"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="102,55,214,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="49,65,86,65,86,70,49,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="108,104,208,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="50,73,108,95,106,100,48,78"/>
-</map>
diff --git a/d8/d13/bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/d13/bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index b7fdd1e93..000000000
--- a/d8/d13/bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1f0665238e8b4ce357cbffa9f44c2969
\ No newline at end of file
diff --git a/d8/d13/bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/d13/bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 666f0612f..000000000
--- a/d8/d13/bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="168pt" height="101pt"
- viewBox="0.00 0.00 168.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementation.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-56.25 0,-56.25 0,-37 32.5,-37 32.5,-56.25"/>
-<text text-anchor="middle" x="16.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-93.25 68.5,-93.25 68.5,-74 160.25,-74 160.25,-93.25"/>
-<text text-anchor="middle" x="114.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-52.57C44.48,-57.11 61.22,-63.55 76.4,-69.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.09,-72.64 85.68,-72.96 77.6,-66.1 75.09,-72.64"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="156.5,-56.25 72.25,-56.25 72.25,-37 156.5,-37 156.5,-56.25"/>
-<text text-anchor="middle" x="114.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-46.62C40.41,-46.62 50.24,-46.62 60.37,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.32,-50.13 70.32,-46.63 60.32,-43.13 60.32,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152,-19.25 76.75,-19.25 76.75,0 152,0 152,-19.25"/>
-<text text-anchor="middle" x="114.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-40.68C44.48,-36.14 61.22,-29.7 76.4,-23.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.6,-27.15 85.68,-20.29 75.09,-20.61 77.6,-27.15"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d13/bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d8/d13/bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index a60307d60..000000000
--- a/d8/d13/bubble__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="168pt" height="101pt"
- viewBox="0.00 0.00 168.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementation.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-56.25 0,-56.25 0,-37 32.5,-37 32.5,-56.25"/>
-<text text-anchor="middle" x="16.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-93.25 68.5,-93.25 68.5,-74 160.25,-74 160.25,-93.25"/>
-<text text-anchor="middle" x="114.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-52.57C44.48,-57.11 61.22,-63.55 76.4,-69.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.09,-72.64 85.68,-72.96 77.6,-66.1 75.09,-72.64"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="156.5,-56.25 72.25,-56.25 72.25,-37 156.5,-37 156.5,-56.25"/>
-<text text-anchor="middle" x="114.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-46.62C40.41,-46.62 50.24,-46.62 60.37,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.32,-50.13 70.32,-46.63 60.32,-43.13 60.32,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152,-19.25 76.75,-19.25 76.75,0 152,0 152,-19.25"/>
-<text text-anchor="middle" x="114.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-40.68C44.48,-36.14 61.22,-29.7 76.4,-23.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.6,-27.15 85.68,-20.29 75.09,-20.61 77.6,-27.15"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d13/bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d13/bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index ed192c638..000000000
--- a/d8/d13/bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,55,55,80"/>
-<area shape="rect" id="Node000002" href="$d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementation." alt="" coords="103,55,146,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,65,87,65,87,70,55,70"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="194,5,316,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="145,57,204,35,205,40,147,62"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="199,55,311,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="146,65,183,65,183,70,146,70"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="205,104,305,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="147,73,205,95,204,100,145,78"/>
-</map>
diff --git a/d8/d13/bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d13/bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index ede8efd19..000000000
--- a/d8/d13/bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1588fe150392733964f1753e9db1b671
\ No newline at end of file
diff --git a/d8/d13/bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d13/bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index f2408f790..000000000
--- a/d8/d13/bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="241pt" height="101pt"
- viewBox="0.00 0.00 241.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementation.">
-<polygon fill="white" stroke="#666666" points="105.5,-56.25 73,-56.25 73,-37 105.5,-37 105.5,-56.25"/>
-<text text-anchor="middle" x="89.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-46.62C44.58,-46.62 53.31,-46.62 61.45,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-50.13 71.2,-46.63 61.2,-43.13 61.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.25,-93.25 141.5,-93.25 141.5,-74 233.25,-74 233.25,-93.25"/>
-<text text-anchor="middle" x="187.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-52.57C117.48,-57.11 134.22,-63.55 149.4,-69.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.09,-72.64 158.68,-72.96 150.6,-66.1 148.09,-72.64"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="229.5,-56.25 145.25,-56.25 145.25,-37 229.5,-37 229.5,-56.25"/>
-<text text-anchor="middle" x="187.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-46.62C113.41,-46.62 123.24,-46.62 133.37,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.32,-50.13 143.32,-46.63 133.32,-43.13 133.32,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="225,-19.25 149.75,-19.25 149.75,0 225,0 225,-19.25"/>
-<text text-anchor="middle" x="187.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-40.68C117.48,-36.14 134.22,-29.7 149.4,-23.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.6,-27.15 158.68,-20.29 148.09,-20.61 150.6,-27.15"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d13/bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/d13/bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 8b2237f8e..000000000
--- a/d8/d13/bubble__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="241pt" height="101pt"
- viewBox="0.00 0.00 241.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementation.">
-<polygon fill="white" stroke="#666666" points="105.5,-56.25 73,-56.25 73,-37 105.5,-37 105.5,-56.25"/>
-<text text-anchor="middle" x="89.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-46.62C44.58,-46.62 53.31,-46.62 61.45,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-50.13 71.2,-46.63 61.2,-43.13 61.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.25,-93.25 141.5,-93.25 141.5,-74 233.25,-74 233.25,-93.25"/>
-<text text-anchor="middle" x="187.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-52.57C117.48,-57.11 134.22,-63.55 149.4,-69.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.09,-72.64 158.68,-72.96 150.6,-66.1 148.09,-72.64"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="229.5,-56.25 145.25,-56.25 145.25,-37 229.5,-37 229.5,-56.25"/>
-<text text-anchor="middle" x="187.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-46.62C113.41,-46.62 123.24,-46.62 133.37,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.32,-50.13 143.32,-46.63 133.32,-43.13 133.32,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="225,-19.25 149.75,-19.25 149.75,0 225,0 225,-19.25"/>
-<text text-anchor="middle" x="187.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-40.68C117.48,-36.14 134.22,-29.7 149.4,-23.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.6,-27.15 158.68,-20.29 148.09,-20.61 150.6,-27.15"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d13/bubble__sort_8cpp_af3b12930a83915712461d53fe9659686_cgraph.map b/d8/d13/bubble__sort_8cpp_af3b12930a83915712461d53fe9659686_cgraph.map
deleted file mode 100644
index 9b7a1f1b6..000000000
--- a/d8/d13/bubble__sort_8cpp_af3b12930a83915712461d53fe9659686_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="sorting::bubble_sort::bubble_sort" name="sorting::bubble_sort::bubble_sort">
-<area shape="rect" id="Node000001" title="Bubble sort algorithm." alt="" coords="5,23,141,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="189,5,304,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="141,31,173,26,173,31,142,36"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="207,55,286,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="142,50,192,57,192,63,141,56"/>
-</map>
diff --git a/d8/d13/bubble__sort_8cpp_af3b12930a83915712461d53fe9659686_cgraph.md5 b/d8/d13/bubble__sort_8cpp_af3b12930a83915712461d53fe9659686_cgraph.md5
deleted file mode 100644
index 663bcd847..000000000
--- a/d8/d13/bubble__sort_8cpp_af3b12930a83915712461d53fe9659686_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7e7a6a12591954597189a98864a1baa8
\ No newline at end of file
diff --git a/d8/d13/bubble__sort_8cpp_af3b12930a83915712461d53fe9659686_cgraph.svg b/d8/d13/bubble__sort_8cpp_af3b12930a83915712461d53fe9659686_cgraph.svg
deleted file mode 100644
index c62ea1eda..000000000
--- a/d8/d13/bubble__sort_8cpp_af3b12930a83915712461d53fe9659686_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::bubble_sort::bubble_sort Pages: 1 -->
-<svg width="232pt" height="64pt"
- viewBox="0.00 0.00 232.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>sorting::bubble_sort::bubble_sort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Bubble sort algorithm.">
-<polygon fill="#999999" stroke="#666666" points="101.5,-42.88 0,-42.88 0,-12.37 101.5,-12.37 101.5,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::bubble_sort</text>
-<text text-anchor="middle" x="50.75" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::bubble_sort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-56.25 137.5,-56.25 137.5,-37 224,-37 224,-56.25"/>
-<text text-anchor="middle" x="180.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.97,-35.08C109.78,-36.24 117.88,-37.44 125.77,-38.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.22,-42.07 135.63,-40.08 126.25,-35.15 125.22,-42.07"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="210.12,-19.25 151.38,-19.25 151.38,0 210.12,0 210.12,-19.25"/>
-<text text-anchor="middle" x="180.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.97,-20.56C114.6,-18.79 127.99,-16.9 140.03,-15.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.17,-18.72 149.59,-13.87 139.2,-11.79 140.17,-18.72"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d13/bubble__sort_8cpp_af3b12930a83915712461d53fe9659686_cgraph_org.svg b/d8/d13/bubble__sort_8cpp_af3b12930a83915712461d53fe9659686_cgraph_org.svg
deleted file mode 100644
index 48685ae93..000000000
--- a/d8/d13/bubble__sort_8cpp_af3b12930a83915712461d53fe9659686_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::bubble_sort::bubble_sort Pages: 1 -->
-<svg width="232pt" height="64pt"
- viewBox="0.00 0.00 232.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>sorting::bubble_sort::bubble_sort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Bubble sort algorithm.">
-<polygon fill="#999999" stroke="#666666" points="101.5,-42.88 0,-42.88 0,-12.37 101.5,-12.37 101.5,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::bubble_sort</text>
-<text text-anchor="middle" x="50.75" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::bubble_sort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-56.25 137.5,-56.25 137.5,-37 224,-37 224,-56.25"/>
-<text text-anchor="middle" x="180.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.97,-35.08C109.78,-36.24 117.88,-37.44 125.77,-38.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.22,-42.07 135.63,-40.08 126.25,-35.15 125.22,-42.07"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="210.12,-19.25 151.38,-19.25 151.38,0 210.12,0 210.12,-19.25"/>
-<text text-anchor="middle" x="180.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.97,-20.56C114.6,-18.79 127.99,-16.9 140.03,-15.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.17,-18.72 149.59,-13.87 139.2,-11.79 140.17,-18.72"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d13/bubble__sort_8cpp_source.html b/d8/d13/bubble__sort_8cpp_source.html
new file mode 100644
index 000000000..d6079f333
--- /dev/null
+++ b/d8/d13/bubble__sort_8cpp_source.html
@@ -0,0 +1,213 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/bubble_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/d13/bubble__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">bubble_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/d13/bubble__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="preprocessor">#include &lt;algorithm&gt;</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="preprocessor">#include &lt;string&gt;</span>    </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="preprocessor">#include &lt;utility&gt;</span>   </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/dd5/namespacebubble__sort.html">bubble_sort</a> {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt; </div>
+<div class="foldopen" id="foldopen00072" data-start="{" data-end="}">
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"><a class="line" href="../../d8/d13/bubble__sort_8cpp.html#af3b12930a83915712461d53fe9659686">   72</a></span>std::vector&lt;T&gt; <a class="code hl_namespace" href="../../d0/dd5/namespacebubble__sort.html">bubble_sort</a>(std::vector&lt;T&gt;&amp; array) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>  <span class="comment">// swap_check flag to terminate the function early</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>  <span class="comment">// if there is no swap occurs in one iteration.</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>  <span class="keywordtype">bool</span> swap_check = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>  <span class="keywordtype">int</span> size = array.size();</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; (i &lt; size) &amp;&amp; (swap_check); i++) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    swap_check = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; size - 1 - i; j++) {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>      <span class="keywordflow">if</span> (array[j] &gt; array[j + 1]) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        swap_check = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        std::swap(array[j], array[j + 1]);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>      }</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    }</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>  }</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>  <span class="keywordflow">return</span> array;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>}</div>
+</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>} <span class="comment">// namespace bubble_sort</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>} <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="foldopen" id="foldopen00096" data-start="{" data-end="}">
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"><a class="line" href="../../d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   96</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>  std::vector&lt;int&gt; vec_1 = {3, 1, -9, 0};</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>  std::vector&lt;int&gt; sorted_1 = sorting::bubble_sort::bubble_sort(vec_1);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>  std::vector&lt;int&gt; vec_2 = {3};</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>  std::vector&lt;int&gt; sorted_2 = sorting::bubble_sort::bubble_sort(vec_2);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>  std::vector&lt;int&gt; vec_3 = {10, 10, 10, 10, 10};</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>  std::vector&lt;int&gt; sorted_3 = sorting::bubble_sort::bubble_sort(vec_3);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>  std::vector&lt;float&gt; vec_4 = {1234, -273.1, 23, 150, 1234, 1555.55, -2000};</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>  std::vector&lt;float&gt; sorted_4 = sorting::bubble_sort::bubble_sort(vec_4);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>  std::vector&lt;char&gt; vec_5 = {<span class="charliteral">&#39;z&#39;</span>, <span class="charliteral">&#39;Z&#39;</span>, <span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;B&#39;</span>, <span class="charliteral">&#39; &#39;</span>, <span class="charliteral">&#39;c&#39;</span>, <span class="charliteral">&#39;a&#39;</span>};</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>  std::vector&lt;char&gt; sorted_5 = sorting::bubble_sort::bubble_sort(vec_5);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>  std::vector&lt;std::string&gt; vec_6 = {<span class="stringliteral">&quot;Hello&quot;</span>, <span class="stringliteral">&quot;hello&quot;</span>, <span class="stringliteral">&quot;Helo&quot;</span>, <span class="stringliteral">&quot;Hi&quot;</span>, <span class="stringliteral">&quot;hehe&quot;</span>};</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>  std::vector&lt;std::string&gt; sorted_6 = sorting::bubble_sort::bubble_sort(vec_6);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>  std::vector&lt;std::pair&lt;int, char&gt;&gt; vec_7 = {{10, <span class="charliteral">&#39;c&#39;</span>}, {2, <span class="charliteral">&#39;z&#39;</span>}, {10, <span class="charliteral">&#39;a&#39;</span>}, {0, <span class="charliteral">&#39;b&#39;</span>}, {-1, <span class="charliteral">&#39;z&#39;</span>}};</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>  std::vector&lt;std::pair&lt;int, char&gt;&gt; sorted_7 = sorting::bubble_sort::bubble_sort(vec_7);</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span> </div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>  assert(std::is_sorted(sorted_1.begin(), sorted_1.end()));</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>  assert(std::is_sorted(sorted_2.begin(), sorted_2.end()));</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>  assert(std::is_sorted(sorted_3.begin(), sorted_3.end()));</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>  assert(std::is_sorted(sorted_4.begin(), sorted_4.end()));</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>  assert(std::is_sorted(sorted_5.begin(), sorted_5.end()));</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>  assert(std::is_sorted(sorted_6.begin(), sorted_6.end()));</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>  assert(std::is_sorted(sorted_7.begin(), sorted_7.end()));</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>}</div>
+</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
+<div class="foldopen" id="foldopen00131" data-start="{" data-end="}">
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"><a class="line" href="../../d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  131</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>  <a class="code hl_function" href="../../d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>  <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>}</div>
+</div>
+<div class="ttc" id="abubble__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> <a href="#l00096">bubble_sort.cpp:96</a></div></div>
+<div class="ttc" id="abubble__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00131">bubble_sort.cpp:131</a></div></div>
+<div class="ttc" id="anamespacebubble__sort_html"><div class="ttname"><a href="../../d0/dd5/namespacebubble__sort.html">bubble_sort</a></div><div class="ttdoc">Bubble sort algorithm.</div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d8/d13/bubble__sort_8cpp.html">bubble_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/d14/namespacen__queens__optimized.html b/d8/d14/namespacen__queens__optimized.html
index 062943ed9..237cf41bd 100644
--- a/d8/d14/namespacen__queens__optimized.html
+++ b/d8/d14/namespacen__queens__optimized.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: n_queens_optimized Namespace Reference</title>
+<title>TheAlgorithms/C++: n_queens_optimized Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/d1d/namespacestrand.html b/d8/d1d/namespacestrand.html
index f14d638a7..0d7ff976f 100644
--- a/d8/d1d/namespacestrand.html
+++ b/d8/d1d/namespacestrand.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: strand Namespace Reference</title>
+<title>TheAlgorithms/C++: strand Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/d20/classuint256__t-members.html b/d8/d20/classuint256__t-members.html
index baaed8182..d4a51b870 100644
--- a/d8/d20/classuint256__t-members.html
+++ b/d8/d20/classuint256__t-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/d27/classmachine__learning_1_1neural__network_1_1_neural_network-members.html b/d8/d27/classmachine__learning_1_1neural__network_1_1_neural_network-members.html
index 216ca0590..2df795f03 100644
--- a/d8/d27/classmachine__learning_1_1neural__network_1_1_neural_network-members.html
+++ b/d8/d27/classmachine__learning_1_1neural__network_1_1_neural_network-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree.html b/d8/d28/classrange__queries_1_1per_seg_tree.html
index b5e4017a6..d29378b34 100644
--- a/d8/d28/classrange__queries_1_1per_seg_tree.html
+++ b/d8/d28/classrange__queries_1_1per_seg_tree.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: range_queries::perSegTree Class Reference</title>
+<title>TheAlgorithms/C++: range_queries::perSegTree Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,7 +136,7 @@ $(function(){initNavTree('d8/d28/classrange__queries_1_1per_seg_tree.html','../.
 <div class="dynheader">
 Collaboration diagram for range_queries::perSegTree:</div>
 <div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.svg" width="100%" height="450"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
+<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d6/d47/classrange__queries_1_1per_seg_tree__coll__graph.svg" width="100%" height="436"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
@@ -129,7 +146,7 @@ Classes</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:ac83bcabf5a8db8b0d8d156a4c1bcd4c3" id="r_ac83bcabf5a8db8b0d8d156a4c1bcd4c3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac83bcabf5a8db8b0d8d156a4c1bcd4c3">construct</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;<a class="el" href="#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>)</td></tr>
+<tr class="memitem:ac83bcabf5a8db8b0d8d156a4c1bcd4c3" id="r_ac83bcabf5a8db8b0d8d156a4c1bcd4c3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac83bcabf5a8db8b0d8d156a4c1bcd4c3">construct</a> (const std::vector&lt; int64_t &gt; &amp;<a class="el" href="#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>)</td></tr>
 <tr class="memdesc:ac83bcabf5a8db8b0d8d156a4c1bcd4c3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructing the segment tree with the values in the passed vector. Returned root pointer is pushed in the pointers vector to have access to the original version if the segment tree is updated.  <br /></td></tr>
 <tr class="separator:ac83bcabf5a8db8b0d8d156a4c1bcd4c3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af87494e6cf012d28c4f5b9d1c15f9c5d" id="r_af87494e6cf012d28c4f5b9d1c15f9c5d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af87494e6cf012d28c4f5b9d1c15f9c5d">update</a> (const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value)</td></tr>
@@ -144,35 +161,36 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
 Private Member Functions</h2></td></tr>
-<tr class="memitem:a0cec4b77d264521717cf9b0482c45817" id="r_a0cec4b77d264521717cf9b0482c45817"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0cec4b77d264521717cf9b0482c45817">newKid</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;curr)</td></tr>
+<tr class="memitem:a0cec4b77d264521717cf9b0482c45817" id="r_a0cec4b77d264521717cf9b0482c45817"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0cec4b77d264521717cf9b0482c45817">newKid</a> (std::shared_ptr&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;curr)</td></tr>
 <tr class="memdesc:a0cec4b77d264521717cf9b0482c45817"><td class="mdescLeft">&#160;</td><td class="mdescRight">Creating a new node with the same values of curr node.  <br /></td></tr>
 <tr class="separator:a0cec4b77d264521717cf9b0482c45817"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ace7f57935b3bb9446f11c239fd89ae79" id="r_ace7f57935b3bb9446f11c239fd89ae79"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ace7f57935b3bb9446f11c239fd89ae79">lazy</a> (const uint32_t &amp;i, const uint32_t &amp;j, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;curr)</td></tr>
+<tr class="memitem:ace7f57935b3bb9446f11c239fd89ae79" id="r_ace7f57935b3bb9446f11c239fd89ae79"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ace7f57935b3bb9446f11c239fd89ae79">lazy</a> (const uint32_t &amp;i, const uint32_t &amp;j, std::shared_ptr&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;curr)</td></tr>
 <tr class="memdesc:ace7f57935b3bb9446f11c239fd89ae79"><td class="mdescLeft">&#160;</td><td class="mdescRight">If there is some value to be propagated to the passed node, value is added to the node and the children of the node, if exist, are copied and the propagated value is also added to them.  <br /></td></tr>
 <tr class="separator:ace7f57935b3bb9446f11c239fd89ae79"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a6d3f2465a7c5803a1ff16c5378bcc5e4" id="r_a6d3f2465a7c5803a1ff16c5378bcc5e4"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a> (const uint32_t &amp;i, const uint32_t &amp;j)</td></tr>
+<tr class="memitem:a6d3f2465a7c5803a1ff16c5378bcc5e4" id="r_a6d3f2465a7c5803a1ff16c5378bcc5e4"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a> (const uint32_t &amp;i, const uint32_t &amp;j)</td></tr>
 <tr class="memdesc:a6d3f2465a7c5803a1ff16c5378bcc5e4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum of the given range, set its pointers to the children, and set its value to the sum of the children's values.  <br /></td></tr>
 <tr class="separator:a6d3f2465a7c5803a1ff16c5378bcc5e4"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a24487eda25123bc4d112e8430821a6c6" id="r_a24487eda25123bc4d112e8430821a6c6"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a24487eda25123bc4d112e8430821a6c6">update</a> (const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;curr)</td></tr>
+<tr class="memitem:a24487eda25123bc4d112e8430821a6c6" id="r_a24487eda25123bc4d112e8430821a6c6"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a24487eda25123bc4d112e8430821a6c6">update</a> (const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value, std::shared_ptr&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;curr)</td></tr>
 <tr class="memdesc:a24487eda25123bc4d112e8430821a6c6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Doing range update, checking at every node if it has some value to be propagated. All nodes affected by the update are copied and propagation value is added to the leaf of them.  <br /></td></tr>
 <tr class="separator:a24487eda25123bc4d112e8430821a6c6"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae8ae4b1835e5e8aec32f68c5059ed4d4" id="r_ae8ae4b1835e5e8aec32f68c5059ed4d4"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a> (const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;curr)</td></tr>
+<tr class="memitem:ae8ae4b1835e5e8aec32f68c5059ed4d4" id="r_ae8ae4b1835e5e8aec32f68c5059ed4d4"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a> (const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, std::shared_ptr&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;curr)</td></tr>
 <tr class="memdesc:ae8ae4b1835e5e8aec32f68c5059ed4d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Querying the range from index l to index r, checking at every node if it has some value to be propagated. Current node's value is returned if its range is completely inside the wanted range, else 0 is returned.  <br /></td></tr>
 <tr class="separator:ae8ae4b1835e5e8aec32f68c5059ed4d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a6f5b36111f90807a9fdf6bbca04f535e" id="r_a6f5b36111f90807a9fdf6bbca04f535e"><td class="memItemLeft" align="right" valign="top"><a id="a6f5b36111f90807a9fdf6bbca04f535e" name="a6f5b36111f90807a9fdf6bbca04f535e"></a>
-uint32_t&#160;</td><td class="memItemRight" valign="bottom"><b>n</b> = 0</td></tr>
+<tr class="memitem:a6f5b36111f90807a9fdf6bbca04f535e" id="r_a6f5b36111f90807a9fdf6bbca04f535e"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6f5b36111f90807a9fdf6bbca04f535e">n</a> = 0</td></tr>
 <tr class="separator:a6f5b36111f90807a9fdf6bbca04f535e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a1eac9cf0613dfc8e2b0195009dd5c9d5" id="r_a1eac9cf0613dfc8e2b0195009dd5c9d5"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a> {}</td></tr>
+<tr class="memitem:a1eac9cf0613dfc8e2b0195009dd5c9d5" id="r_a1eac9cf0613dfc8e2b0195009dd5c9d5"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::shared_ptr&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a> {}</td></tr>
 <tr class="memdesc:a1eac9cf0613dfc8e2b0195009dd5c9d5"><td class="mdescLeft">&#160;</td><td class="mdescRight">number of elements/leaf nodes in the segment tree  <br /></td></tr>
 <tr class="separator:a1eac9cf0613dfc8e2b0195009dd5c9d5"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8ff495d2f389b4aaa54449c26c6078f3" id="r_a8ff495d2f389b4aaa54449c26c6078f3"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8ff495d2f389b4aaa54449c26c6078f3">vec</a> {}</td></tr>
+<tr class="memitem:a8ff495d2f389b4aaa54449c26c6078f3" id="r_a8ff495d2f389b4aaa54449c26c6078f3"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8ff495d2f389b4aaa54449c26c6078f3">vec</a> {}</td></tr>
 <tr class="separator:a8ff495d2f389b4aaa54449c26c6078f3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Range query here is range sum, but the code can be modified to make different queries like range max or min. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="ac83bcabf5a8db8b0d8d156a4c1bcd4c3" name="ac83bcabf5a8db8b0d8d156a4c1bcd4c3"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ac83bcabf5a8db8b0d8d156a4c1bcd4c3">&#9670;&#160;</a></span>construct() <span class="overload">[1/2]</span></h2>
@@ -186,7 +204,7 @@ uint32_t&#160;</td><td class="memItemRight" valign="bottom"><b>n</b> = 0</td></t
         <tr>
           <td class="memname">void range_queries::perSegTree::construct </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>vec</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; int64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>vec</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -205,27 +223,21 @@ uint32_t&#160;</td><td class="memItemRight" valign="bottom"><b>n</b> = 0</td></t
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00197">197</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  200</span>    {</div>
-<div class="line"><span class="lineno">  201</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/empty.html">empty</a>()) {</div>
+<div class="line"><span class="lineno">  201</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>.empty()) {</div>
 <div class="line"><span class="lineno">  202</span>            <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  203</span>        }</div>
-<div class="line"><span class="lineno">  204</span>        n = <a class="code hl_variable" href="#a8ff495d2f389b4aaa54449c26c6078f3">vec</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">  204</span>        n = <a class="code hl_variable" href="#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>.size();</div>
 <div class="line"><span class="lineno">  205</span>        this-&gt;vec = <a class="code hl_variable" href="#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>;</div>
 <div class="line"><span class="lineno">  206</span>        <span class="keyword">auto</span> root = <a class="code hl_function" href="#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(0, n - 1);</div>
-<div class="line"><span class="lineno">  207</span>        <a class="code hl_variable" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(root);</div>
+<div class="line"><span class="lineno">  207</span>        <a class="code hl_variable" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.push_back(root);</div>
 <div class="line"><span class="lineno">  208</span>    }</div>
-<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a1eac9cf0613dfc8e2b0195009dd5c9d5"><div class="ttname"><a href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">range_queries::perSegTree::ptrs</a></div><div class="ttdeci">std::vector&lt; std::shared_ptr&lt; Node &gt; &gt; ptrs</div><div class="ttdoc">number of elements/leaf nodes in the segment tree</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:54</div></div>
-<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a6d3f2465a7c5803a1ff16c5378bcc5e4"><div class="ttname"><a href="#a6d3f2465a7c5803a1ff16c5378bcc5e4">range_queries::perSegTree::construct</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; construct(const uint32_t &amp;i, const uint32_t &amp;j)</div><div class="ttdoc">Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:106</div></div>
-<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a8ff495d2f389b4aaa54449c26c6078f3"><div class="ttname"><a href="#a8ff495d2f389b4aaa54449c26c6078f3">range_queries::perSegTree::vec</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; vec</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:57</div></div>
-<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/empty.html">std::vector::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="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><!-- 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="../../d8/d28/classrange__queries_1_1per_seg_tree_ac83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph.svg" width="587" height="224"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a1eac9cf0613dfc8e2b0195009dd5c9d5"><div class="ttname"><a href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">range_queries::perSegTree::ptrs</a></div><div class="ttdeci">std::vector&lt; std::shared_ptr&lt; Node &gt; &gt; ptrs</div><div class="ttdoc">number of elements/leaf nodes in the segment tree</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00054">persistent_seg_tree_lazy_prop.cpp:54</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a6d3f2465a7c5803a1ff16c5378bcc5e4"><div class="ttname"><a href="#a6d3f2465a7c5803a1ff16c5378bcc5e4">range_queries::perSegTree::construct</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; construct(const uint32_t &amp;i, const uint32_t &amp;j)</div><div class="ttdoc">Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00106">persistent_seg_tree_lazy_prop.cpp:106</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a8ff495d2f389b4aaa54449c26c6078f3"><div class="ttname"><a href="#a8ff495d2f389b4aaa54449c26c6078f3">range_queries::perSegTree::vec</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; vec</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00057">persistent_seg_tree_lazy_prop.cpp:57</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6d3f2465a7c5803a1ff16c5378bcc5e4" name="a6d3f2465a7c5803a1ff16c5378bcc5e4"></a>
@@ -238,7 +250,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; range_queries::perSegTree::construct </td>
+          <td class="memname">std::shared_ptr&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; range_queries::perSegTree::construct </td>
           <td>(</td>
           <td class="paramtype">const uint32_t &amp;</td>          <td class="paramname"><span class="paramname"><em>i</em></span>, </td>
         </tr>
@@ -264,29 +276,24 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>pointer to the newly created node </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00106">106</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  106</span>                                                                        {</div>
-<div class="line"><span class="lineno">  107</span>        <span class="keyword">auto</span> newNode = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;Node&gt;</a>(<a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>());</div>
+<div class="line"><span class="lineno">  107</span>        <span class="keyword">auto</span> newNode = std::make_shared&lt;Node&gt;(<a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>());</div>
 <div class="line"><span class="lineno">  108</span>        <span class="keywordflow">if</span> (i == j) {</div>
 <div class="line"><span class="lineno">  109</span>            newNode-&gt;val = <a class="code hl_variable" href="#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>[i];</div>
 <div class="line"><span class="lineno">  110</span>        } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">  111</span>            uint32_t mid = i + (j - i) / 2;</div>
 <div class="line"><span class="lineno">  112</span>            <span class="keyword">auto</span> leftt = <a class="code hl_function" href="#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(i, mid);</div>
-<div class="line"><span class="lineno">  113</span>            <span class="keyword">auto</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a> = <a class="code hl_function" href="#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(mid + 1, j);</div>
-<div class="line"><span class="lineno">  114</span>            newNode-&gt;val = leftt-&gt;val + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>-&gt;val;</div>
+<div class="line"><span class="lineno">  113</span>            <span class="keyword">auto</span> right = <a class="code hl_function" href="#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(mid + 1, j);</div>
+<div class="line"><span class="lineno">  114</span>            newNode-&gt;val = leftt-&gt;val + right-&gt;val;</div>
 <div class="line"><span class="lineno">  115</span>            newNode-&gt;left = leftt;</div>
-<div class="line"><span class="lineno">  116</span>            newNode-&gt;right = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>;</div>
+<div class="line"><span class="lineno">  116</span>            newNode-&gt;right = right;</div>
 <div class="line"><span class="lineno">  117</span>        }</div>
 <div class="line"><span class="lineno">  118</span>        <span class="keywordflow">return</span> newNode;</div>
 <div class="line"><span class="lineno">  119</span>    }</div>
-<div class="ttc" id="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::right</a></div><div class="ttdeci">T right(T... args)</div></div>
-<div class="ttc" id="amake_shared_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared</a></div><div class="ttdeci">T make_shared(T... args)</div></div>
-<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d28/classrange__queries_1_1per_seg_tree_a6d3f2465a7c5803a1ff16c5378bcc5e4_cgraph.svg" width="362" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ace7f57935b3bb9446f11c239fd89ae79" name="ace7f57935b3bb9446f11c239fd89ae79"></a>
@@ -311,7 +318,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>curr</em></span>&#160;)</td>
+          <td class="paramtype">std::shared_ptr&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>curr</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -331,6 +338,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00083">83</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   84</span>                                               {</div>
 <div class="line"><span class="lineno">   85</span>        <span class="keywordflow">if</span> (!curr-&gt;prop) {</div>
 <div class="line"><span class="lineno">   86</span>            <span class="keywordflow">return</span>;</div>
@@ -344,13 +353,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   94</span>        }</div>
 <div class="line"><span class="lineno">   95</span>        curr-&gt;prop = 0;</div>
 <div class="line"><span class="lineno">   96</span>    }</div>
-<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a0cec4b77d264521717cf9b0482c45817"><div class="ttname"><a href="#a0cec4b77d264521717cf9b0482c45817">range_queries::perSegTree::newKid</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; newKid(std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">Creating a new node with the same values of curr node.</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:65</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d28/classrange__queries_1_1per_seg_tree_ace7f57935b3bb9446f11c239fd89ae79_cgraph.svg" width="587" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a0cec4b77d264521717cf9b0482c45817"><div class="ttname"><a href="#a0cec4b77d264521717cf9b0482c45817">range_queries::perSegTree::newKid</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; newKid(std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">Creating a new node with the same values of curr node.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00065">persistent_seg_tree_lazy_prop.cpp:65</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0cec4b77d264521717cf9b0482c45817" name="a0cec4b77d264521717cf9b0482c45817"></a>
@@ -363,9 +367,9 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; range_queries::perSegTree::newKid </td>
+          <td class="memname">std::shared_ptr&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; range_queries::perSegTree::newKid </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>curr</em></span></td><td>)</td>
+          <td class="paramtype">std::shared_ptr&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>curr</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -384,20 +388,17 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the new node </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00065">65</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   65</span>                                                                {</div>
-<div class="line"><span class="lineno">   66</span>        <span class="keyword">auto</span> newNode = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;Node&gt;</a>(<a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>());</div>
+<div class="line"><span class="lineno">   66</span>        <span class="keyword">auto</span> newNode = std::make_shared&lt;Node&gt;(<a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>());</div>
 <div class="line"><span class="lineno">   67</span>        newNode-&gt;left = curr-&gt;left;</div>
 <div class="line"><span class="lineno">   68</span>        newNode-&gt;right = curr-&gt;right;</div>
 <div class="line"><span class="lineno">   69</span>        newNode-&gt;prop = curr-&gt;prop;</div>
 <div class="line"><span class="lineno">   70</span>        newNode-&gt;val = curr-&gt;val;</div>
 <div class="line"><span class="lineno">   71</span>        <span class="keywordflow">return</span> newNode;</div>
 <div class="line"><span class="lineno">   72</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph.svg" width="362" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae8ae4b1835e5e8aec32f68c5059ed4d4" name="ae8ae4b1835e5e8aec32f68c5059ed4d4"></a>
@@ -432,7 +433,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>curr</em></span>&#160;)</td>
+          <td class="paramtype">std::shared_ptr&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>curr</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -454,6 +455,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>sum of elements whose index x satisfies l&lt;=x&lt;=r </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00171">171</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  172</span>                                                                      {</div>
 <div class="line"><span class="lineno">  173</span>        <a class="code hl_function" href="#ace7f57935b3bb9446f11c239fd89ae79">lazy</a>(i, j, curr);</div>
 <div class="line"><span class="lineno">  174</span>        <span class="keywordflow">if</span> (j &lt; l || r &lt; i) {</div>
@@ -466,14 +469,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  181</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(i, mid, l, r, curr-&gt;left) +</div>
 <div class="line"><span class="lineno">  182</span>               <a class="code hl_function" href="#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(mid + 1, j, l, r, curr-&gt;right);</div>
 <div class="line"><span class="lineno">  183</span>    }</div>
-<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_ace7f57935b3bb9446f11c239fd89ae79"><div class="ttname"><a href="#ace7f57935b3bb9446f11c239fd89ae79">range_queries::perSegTree::lazy</a></div><div class="ttdeci">void lazy(const uint32_t &amp;i, const uint32_t &amp;j, std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">If there is some value to be propagated to the passed node, value is added to the node and the childr...</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:83</div></div>
-<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_ae8ae4b1835e5e8aec32f68c5059ed4d4"><div class="ttname"><a href="#ae8ae4b1835e5e8aec32f68c5059ed4d4">range_queries::perSegTree::query</a></div><div class="ttdeci">int64_t query(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">Querying the range from index l to index r, checking at every node if it has some value to be propaga...</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:171</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.svg" width="100%" height="300"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_ace7f57935b3bb9446f11c239fd89ae79"><div class="ttname"><a href="#ace7f57935b3bb9446f11c239fd89ae79">range_queries::perSegTree::lazy</a></div><div class="ttdeci">void lazy(const uint32_t &amp;i, const uint32_t &amp;j, std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">If there is some value to be propagated to the passed node, value is added to the node and the childr...</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00083">persistent_seg_tree_lazy_prop.cpp:83</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_ae8ae4b1835e5e8aec32f68c5059ed4d4"><div class="ttname"><a href="#ae8ae4b1835e5e8aec32f68c5059ed4d4">range_queries::perSegTree::query</a></div><div class="ttdeci">int64_t query(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">Querying the range from index l to index r, checking at every node if it has some value to be propaga...</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00171">persistent_seg_tree_lazy_prop.cpp:171</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad484002bcb701820d55f32ea5d525571" name="ad484002bcb701820d55f32ea5d525571"></a>
@@ -518,15 +516,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>sum of elements whose index x satisfies l&lt;=x&lt;=r </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00241">241</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  246</span>    {</div>
 <div class="line"><span class="lineno">  247</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(0, n - 1, l, r, <a class="code hl_variable" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>[version]);</div>
 <div class="line"><span class="lineno">  248</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.svg" width="100%" height="300"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0fe4e431f3e09c274ecd7d2d58dcb865" name="a0fe4e431f3e09c274ecd7d2d58dcb865"></a>
@@ -554,15 +549,12 @@ Here is the call graph for this function:</div>
 
 <p>Getting the number of versions after updates so far which is equal to the size of the pointers vector. </p>
 <dl class="section return"><dt>Returns</dt><dd>the number of versions </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  258</span>    {</div>
-<div class="line"><span class="lineno">  259</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</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">  260</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.svg" width="352" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00255">255</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  258</span>    {</div>
+<div class="line"><span class="lineno">  259</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.size();</div>
+<div class="line"><span class="lineno">  260</span>    }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a24487eda25123bc4d112e8430821a6c6" name="a24487eda25123bc4d112e8430821a6c6"></a>
@@ -575,7 +567,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; range_queries::perSegTree::update </td>
+          <td class="memname">std::shared_ptr&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; range_queries::perSegTree::update </td>
           <td>(</td>
           <td class="paramtype">const uint32_t &amp;</td>          <td class="paramname"><span class="paramname"><em>i</em></span>, </td>
         </tr>
@@ -602,7 +594,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>curr</em></span>&#160;)</td>
+          <td class="paramtype">std::shared_ptr&lt; <a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>curr</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -625,10 +617,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>pointer to the current newly created node </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00135">135</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
 <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="#ace7f57935b3bb9446f11c239fd89ae79">lazy</a>(i, j, curr);</div>
 <div class="line"><span class="lineno">  140</span>        <span class="keywordflow">if</span> (i &gt;= l &amp;&amp; j &lt;= r) {</div>
-<div class="line"><span class="lineno">  141</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Node&gt;</a> newNode = <a class="code hl_function" href="#a0cec4b77d264521717cf9b0482c45817">newKid</a>(curr);</div>
+<div class="line"><span class="lineno">  141</span>            std::shared_ptr&lt;Node&gt; newNode = <a class="code hl_function" href="#a0cec4b77d264521717cf9b0482c45817">newKid</a>(curr);</div>
 <div class="line"><span class="lineno">  142</span>            newNode-&gt;prop += value;</div>
 <div class="line"><span class="lineno">  143</span>            <a class="code hl_function" href="#ace7f57935b3bb9446f11c239fd89ae79">lazy</a>(i, j, newNode);</div>
 <div class="line"><span class="lineno">  144</span>            <span class="keywordflow">return</span> newNode;</div>
@@ -636,21 +630,15 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  146</span>        <span class="keywordflow">if</span> (i &gt; r || j &lt; l) {</div>
 <div class="line"><span class="lineno">  147</span>            <span class="keywordflow">return</span> curr;</div>
 <div class="line"><span class="lineno">  148</span>        }</div>
-<div class="line"><span class="lineno">  149</span>        <span class="keyword">auto</span> newNode = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;Node&gt;</a>(<a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>());</div>
+<div class="line"><span class="lineno">  149</span>        <span class="keyword">auto</span> newNode = std::make_shared&lt;Node&gt;(<a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>());</div>
 <div class="line"><span class="lineno">  150</span>        uint32_t mid = i + (j - i) / 2;</div>
 <div class="line"><span class="lineno">  151</span>        newNode-&gt;left = <a class="code hl_function" href="#a24487eda25123bc4d112e8430821a6c6">update</a>(i, mid, l, r, value, curr-&gt;left);</div>
 <div class="line"><span class="lineno">  152</span>        newNode-&gt;right = <a class="code hl_function" href="#a24487eda25123bc4d112e8430821a6c6">update</a>(mid + 1, j, l, r, value, curr-&gt;right);</div>
 <div class="line"><span class="lineno">  153</span>        newNode-&gt;val = newNode-&gt;left-&gt;val + newNode-&gt;right-&gt;val;</div>
 <div class="line"><span class="lineno">  154</span>        <span class="keywordflow">return</span> newNode;</div>
 <div class="line"><span class="lineno">  155</span>    }</div>
-<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a24487eda25123bc4d112e8430821a6c6"><div class="ttname"><a href="#a24487eda25123bc4d112e8430821a6c6">range_queries::perSegTree::update</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; update(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value, std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">Doing range update, checking at every node if it has some value to be propagated. All nodes affected ...</div><div class="ttdef"><b>Definition</b> persistent_seg_tree_lazy_prop.cpp:135</div></div>
-<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d8/d28/classrange__queries_1_1per_seg_tree_a24487eda25123bc4d112e8430821a6c6_cgraph.svg" width="100%" height="393"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a24487eda25123bc4d112e8430821a6c6"><div class="ttname"><a href="#a24487eda25123bc4d112e8430821a6c6">range_queries::perSegTree::update</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; update(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value, std::shared_ptr&lt; Node &gt; const &amp;curr)</div><div class="ttdoc">Doing range update, checking at every node if it has some value to be propagated. All nodes affected ...</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00135">persistent_seg_tree_lazy_prop.cpp:135</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af87494e6cf012d28c4f5b9d1c15f9c5d" name="af87494e6cf012d28c4f5b9d1c15f9c5d"></a>
@@ -695,21 +683,42 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00219">219</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  223</span>    {</div>
-<div class="line"><span class="lineno">  224</span>        <a class="code hl_variable" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_function" href="#a24487eda25123bc4d112e8430821a6c6">update</a>(</div>
+<div class="line"><span class="lineno">  224</span>        <a class="code hl_variable" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.push_back(<a class="code hl_function" href="#a24487eda25123bc4d112e8430821a6c6">update</a>(</div>
 <div class="line"><span class="lineno">  225</span>            0, n - 1, l, r, value,</div>
-<div class="line"><span class="lineno">  226</span>            <a class="code hl_variable" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>[<a class="code hl_variable" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</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">  226</span>            <a class="code hl_variable" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>[<a class="code hl_variable" href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.size() -</div>
 <div class="line"><span class="lineno">  227</span>                 1]));  <span class="comment">// saving the root pointer to the new segment tree</span></div>
 <div class="line"><span class="lineno">  228</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.svg" width="100%" height="442"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
+<a id="a6f5b36111f90807a9fdf6bbca04f535e" name="a6f5b36111f90807a9fdf6bbca04f535e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a6f5b36111f90807a9fdf6bbca04f535e">&#9670;&#160;</a></span>n</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">uint32_t range_queries::perSegTree::n = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00052">52</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
+
+</div>
+</div>
 <a id="a1eac9cf0613dfc8e2b0195009dd5c9d5" name="a1eac9cf0613dfc8e2b0195009dd5c9d5"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a1eac9cf0613dfc8e2b0195009dd5c9d5">&#9670;&#160;</a></span>ptrs</h2>
 
@@ -720,7 +729,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt;<a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a>&gt; &gt; range_queries::perSegTree::ptrs {}</td>
+          <td class="memname">std::vector&lt;std::shared_ptr&lt;<a class="el" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a>&gt; &gt; range_queries::perSegTree::ptrs {}</td>
         </tr>
       </table>
   </td>
@@ -731,7 +740,9 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>number of elements/leaf nodes in the segment tree </p>
-<div class="fragment"><div class="line"><span class="lineno">   54</span>{};  <span class="comment">/// ptrs[i] holds a root pointer to the segment tree after the</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00054">54</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   54</span>{};  </div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -745,7 +756,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;int64_t&gt; range_queries::perSegTree::vec {}</td>
+          <td class="memname">std::vector&lt;int64_t&gt; range_queries::perSegTree::vec {}</td>
         </tr>
       </table>
   </td>
@@ -755,12 +766,14 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>ptrs[i] holds a root pointer to the segment tree after the ith update. ptrs[0] holds a root pointer to the segment tree before any updates </p>
-<div class="fragment"><div class="line"><span class="lineno">   57</span>{};  <span class="comment">/// values of the leaf nodes that the segment</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   57</span>{};  </div>
 </div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>range_queries/<a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html">persistent_seg_tree_lazy_prop.cpp</a></li>
+<li>range_queries/<a class="el" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html">persistent_seg_tree_lazy_prop.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph.map b/d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph.map
deleted file mode 100644
index 69bde0d45..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="range_queries::perSegTree::newKid" name="range_queries::perSegTree::newKid">
-<area shape="rect" id="Node000001" title="Creating a new node with the same values of curr node." alt="" coords="5,5,183,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="231,13,356,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="183,23,215,23,215,28,183,28"/>
-</map>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph.md5 b/d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph.md5
deleted file mode 100644
index c87dc954f..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5c76faeb25963377f62265034e7eada0
\ No newline at end of file
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph.svg b/d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph.svg
deleted file mode 100644
index 080fb238f..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::perSegTree::newKid Pages: 1 -->
-<svg width="271pt" height="39pt"
- viewBox="0.00 0.00 271.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>range_queries::perSegTree::newKid</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Creating a new node with the same values of curr node.">
-<polygon fill="#999999" stroke="#666666" points="133,-30.5 0,-30.5 0,0 133,0 133,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::newKid</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263,-24.88 169,-24.88 169,-5.63 263,-5.63 263,-24.88"/>
-<text text-anchor="middle" x="216" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.48,-15.25C141.52,-15.25 149.69,-15.25 157.59,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.42,-18.75 167.42,-15.25 157.42,-11.75 157.42,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph_org.svg b/d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph_org.svg
deleted file mode 100644
index f9bc45c65..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_a0cec4b77d264521717cf9b0482c45817_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::perSegTree::newKid Pages: 1 -->
-<svg width="271pt" height="39pt"
- viewBox="0.00 0.00 271.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>range_queries::perSegTree::newKid</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Creating a new node with the same values of curr node.">
-<polygon fill="#999999" stroke="#666666" points="133,-30.5 0,-30.5 0,0 133,0 133,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::newKid</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263,-24.88 169,-24.88 169,-5.63 263,-5.63 263,-24.88"/>
-<text text-anchor="middle" x="216" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.48,-15.25C141.52,-15.25 149.69,-15.25 157.59,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.42,-18.75 167.42,-15.25 157.42,-11.75 157.42,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.map b/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.map
deleted file mode 100644
index 714ca5166..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="range_queries::perSegTree::size" name="range_queries::perSegTree::size">
-<area shape="rect" id="Node000001" title="Getting the number of versions after updates so far which is equal to the size of the pointers vector..." alt="" coords="5,5,183,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="231,13,346,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="183,23,215,23,215,28,183,28"/>
-</map>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.md5 b/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.md5
deleted file mode 100644
index 4235cc0a3..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2bb15eacdd647af484c00ea092c5b3f4
\ No newline at end of file
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.svg b/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.svg
deleted file mode 100644
index 74e919bc0..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::perSegTree::size Pages: 1 -->
-<svg width="264pt" height="39pt"
- viewBox="0.00 0.00 263.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>range_queries::perSegTree::size</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Getting the number of versions after updates so far which is equal to the size of the pointers vector...">
-<polygon fill="#999999" stroke="#666666" points="133,-30.5 0,-30.5 0,0 133,0 133,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-24.88 169,-24.88 169,-5.63 255.5,-5.63 255.5,-24.88"/>
-<text text-anchor="middle" x="212.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.48,-15.25C141.42,-15.25 149.46,-15.25 157.2,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.16,-18.75 167.16,-15.25 157.16,-11.75 157.16,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph_org.svg b/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph_org.svg
deleted file mode 100644
index 72a7a85de..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_a0fe4e431f3e09c274ecd7d2d58dcb865_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::perSegTree::size Pages: 1 -->
-<svg width="264pt" height="39pt"
- viewBox="0.00 0.00 263.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>range_queries::perSegTree::size</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Getting the number of versions after updates so far which is equal to the size of the pointers vector...">
-<polygon fill="#999999" stroke="#666666" points="133,-30.5 0,-30.5 0,0 133,0 133,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-24.88 169,-24.88 169,-5.63 255.5,-5.63 255.5,-24.88"/>
-<text text-anchor="middle" x="212.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.48,-15.25C141.42,-15.25 149.46,-15.25 157.2,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.16,-18.75 167.16,-15.25 157.16,-11.75 157.16,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_a24487eda25123bc4d112e8430821a6c6_cgraph.map b/d8/d28/classrange__queries_1_1per_seg_tree_a24487eda25123bc4d112e8430821a6c6_cgraph.map
deleted file mode 100644
index e362c5b60..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_a24487eda25123bc4d112e8430821a6c6_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="range_queries::perSegTree::update" name="range_queries::perSegTree::update">
-<area shape="rect" id="Node000001" title="Doing range update, checking at every node if it has some value to be propagated. All nodes affected ..." alt="" coords="5,63,183,103"/>
-<area shape="poly" id="edge6_Node000001_Node000001" title=" " alt="" coords="51,63,49,53,56,44,71,38,94,36,118,38,133,45,131,50,117,44,94,41,73,43,60,48,55,54,57,61"/>
-<area shape="rect" id="Node000002" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" title="If there is some value to be propagated to the passed node, value is added to the node and the childr..." alt="" coords="231,5,408,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="176,60,222,48,223,53,177,65"/>
-<area shape="rect" id="Node000003" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" title="Creating a new node with the same values of curr node." alt="" coords="456,56,633,97"/>
-<area shape="poly" id="edge5_Node000001_Node000003" title=" " alt="" coords="183,79,440,75,440,81,183,84"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="681,93,807,118"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="183,88,312,98,456,106,545,107,633,106,666,105,666,110,633,111,545,112,456,111,312,103,183,94"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="409,43,441,50,440,56,407,48"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="634,87,667,92,666,97,634,92"/>
-</map>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_a24487eda25123bc4d112e8430821a6c6_cgraph.md5 b/d8/d28/classrange__queries_1_1per_seg_tree_a24487eda25123bc4d112e8430821a6c6_cgraph.md5
deleted file mode 100644
index e50b81ebb..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_a24487eda25123bc4d112e8430821a6c6_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-51e5f27a9e087646c67ce74e273fefd6
\ No newline at end of file
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_a24487eda25123bc4d112e8430821a6c6_cgraph.svg b/d8/d28/classrange__queries_1_1per_seg_tree_a24487eda25123bc4d112e8430821a6c6_cgraph.svg
deleted file mode 100644
index 0da8bf2a4..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_a24487eda25123bc4d112e8430821a6c6_cgraph.svg
+++ /dev/null
@@ -1,188 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::perSegTree::update Pages: 1 -->
-<!--zoomable 93 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 609;
-var viewHeight = 93;
-var sectionId = 'dynsection-8';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>range_queries::perSegTree::update</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Doing range update, checking at every node if it has some value to be propagated. All nodes affected ...">
-<polygon fill="#999999" stroke="#666666" points="133,-41.88 0,-41.88 0,-11.37 133,-11.37 133,-41.88"/>
-<text text-anchor="start" x="8" y="-28.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="66.5" y="-17.12" font-family="Helvetica,sans-Serif" font-size="10.00">::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge6_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge6_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.55,-42.36C30.44,-51.43 40.42,-59.88 66.5,-59.88 80.76,-59.88 90.21,-57.35 94.84,-53.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.28,-54.25 96.23,-43.86 91.35,-53.26 98.28,-54.25"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" target="_top" xlink:title="If there is some value to be propagated to the passed node, value is added to the node and the childr...">
-<polygon fill="white" stroke="#666666" points="302,-84.88 169,-84.88 169,-54.38 302,-54.38 302,-84.88"/>
-<text text-anchor="start" x="177" y="-71.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="235.5" y="-60.12" font-family="Helvetica,sans-Serif" font-size="10.00">::lazy</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.26,-42.27C139.43,-45.15 151.18,-48.17 162.64,-51.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.48,-54.44 172.04,-53.54 163.23,-47.66 161.48,-54.44"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" target="_top" xlink:title="Creating a new node with the same values of curr node.">
-<polygon fill="white" stroke="#666666" points="471,-46.88 338,-46.88 338,-16.38 471,-16.38 471,-46.88"/>
-<text text-anchor="start" x="346" y="-33.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="404.5" y="-22.12" font-family="Helvetica,sans-Serif" font-size="10.00">::newKid</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge5_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge5_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.48,-27.61C188.85,-28.43 268,-29.61 326.3,-30.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.1,-33.97 336.16,-30.62 326.21,-26.97 326.1,-33.97"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="601,-19.25 507,-19.25 507,0 601,0 601,-19.25"/>
-<text text-anchor="middle" x="554" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.3,-20.71C188.03,-16.1 268.02,-10.08 338,-7.62 397.07,-5.55 411.89,-6.9 471,-7.62 478.84,-7.72 487.1,-7.87 495.24,-8.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.01,-11.54 505.09,-8.26 495.17,-4.54 495.01,-11.54"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.02,-54.72C310.06,-52.89 318.34,-51 326.53,-49.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.17,-52.58 336.14,-46.95 325.61,-45.76 327.17,-52.58"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M471.48,-21.78C479.52,-20.58 487.69,-19.37 495.59,-18.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="496.06,-21.66 505.43,-16.72 495.03,-14.73 496.06,-21.66"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classrange__queries_1_1per_seg_tree_a24487eda25123bc4d112e8430821a6c6_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_a24487eda25123bc4d112e8430821a6c6_cgraph_org.svg b/d8/d28/classrange__queries_1_1per_seg_tree_a24487eda25123bc4d112e8430821a6c6_cgraph_org.svg
deleted file mode 100644
index 7c62f8c85..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_a24487eda25123bc4d112e8430821a6c6_cgraph_org.svg
+++ /dev/null
@@ -1,105 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::perSegTree::update Pages: 1 -->
-<svg width="609pt" height="93pt"
- viewBox="0.00 0.00 609.00 92.88" 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 88.88)">
-<title>range_queries::perSegTree::update</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Doing range update, checking at every node if it has some value to be propagated. All nodes affected ...">
-<polygon fill="#999999" stroke="#666666" points="133,-41.88 0,-41.88 0,-11.37 133,-11.37 133,-41.88"/>
-<text text-anchor="start" x="8" y="-28.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="66.5" y="-17.12" font-family="Helvetica,sans-Serif" font-size="10.00">::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge6_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge6_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.55,-42.36C30.44,-51.43 40.42,-59.88 66.5,-59.88 80.76,-59.88 90.21,-57.35 94.84,-53.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.28,-54.25 96.23,-43.86 91.35,-53.26 98.28,-54.25"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" target="_top" xlink:title="If there is some value to be propagated to the passed node, value is added to the node and the childr...">
-<polygon fill="white" stroke="#666666" points="302,-84.88 169,-84.88 169,-54.38 302,-54.38 302,-84.88"/>
-<text text-anchor="start" x="177" y="-71.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="235.5" y="-60.12" font-family="Helvetica,sans-Serif" font-size="10.00">::lazy</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.26,-42.27C139.43,-45.15 151.18,-48.17 162.64,-51.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.48,-54.44 172.04,-53.54 163.23,-47.66 161.48,-54.44"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" target="_top" xlink:title="Creating a new node with the same values of curr node.">
-<polygon fill="white" stroke="#666666" points="471,-46.88 338,-46.88 338,-16.38 471,-16.38 471,-46.88"/>
-<text text-anchor="start" x="346" y="-33.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="404.5" y="-22.12" font-family="Helvetica,sans-Serif" font-size="10.00">::newKid</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge5_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge5_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.48,-27.61C188.85,-28.43 268,-29.61 326.3,-30.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.1,-33.97 336.16,-30.62 326.21,-26.97 326.1,-33.97"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="601,-19.25 507,-19.25 507,0 601,0 601,-19.25"/>
-<text text-anchor="middle" x="554" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.3,-20.71C188.03,-16.1 268.02,-10.08 338,-7.62 397.07,-5.55 411.89,-6.9 471,-7.62 478.84,-7.72 487.1,-7.87 495.24,-8.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.01,-11.54 505.09,-8.26 495.17,-4.54 495.01,-11.54"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.02,-54.72C310.06,-52.89 318.34,-51 326.53,-49.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.17,-52.58 336.14,-46.95 325.61,-45.76 327.17,-52.58"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M471.48,-21.78C479.52,-20.58 487.69,-19.37 495.59,-18.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="496.06,-21.66 505.43,-16.72 495.03,-14.73 496.06,-21.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_a6d3f2465a7c5803a1ff16c5378bcc5e4_cgraph.map b/d8/d28/classrange__queries_1_1per_seg_tree_a6d3f2465a7c5803a1ff16c5378bcc5e4_cgraph.map
deleted file mode 100644
index eba8087be..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_a6d3f2465a7c5803a1ff16c5378bcc5e4_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="range_queries::perSegTree::construct" name="range_queries::perSegTree::construct">
-<area shape="rect" id="Node000001" title="Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum..." alt="" coords="5,29,183,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="56,29,54,19,60,10,74,5,94,3,116,5,129,11,126,16,114,10,94,8,75,10,64,15,59,20,61,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="231,37,356,62"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="183,47,215,47,215,52,183,52"/>
-</map>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_a6d3f2465a7c5803a1ff16c5378bcc5e4_cgraph.md5 b/d8/d28/classrange__queries_1_1per_seg_tree_a6d3f2465a7c5803a1ff16c5378bcc5e4_cgraph.md5
deleted file mode 100644
index 69b1f107c..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_a6d3f2465a7c5803a1ff16c5378bcc5e4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-88bb5f58349a7d23ae0639305e0eff77
\ No newline at end of file
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_a6d3f2465a7c5803a1ff16c5378bcc5e4_cgraph.svg b/d8/d28/classrange__queries_1_1per_seg_tree_a6d3f2465a7c5803a1ff16c5378bcc5e4_cgraph.svg
deleted file mode 100644
index 23e686143..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_a6d3f2465a7c5803a1ff16c5378bcc5e4_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::perSegTree::construct Pages: 1 -->
-<svg width="271pt" height="57pt"
- viewBox="0.00 0.00 271.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>range_queries::perSegTree::construct</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...">
-<polygon fill="#999999" stroke="#666666" points="133,-30.5 0,-30.5 0,0 133,0 133,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::construct</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.01,-30.99C34.6,-40.06 43.43,-48.5 66.5,-48.5 79.11,-48.5 87.47,-45.97 91.57,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.02,-42.85 92.8,-32.49 88.07,-41.97 95.02,-42.85"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263,-24.88 169,-24.88 169,-5.63 263,-5.63 263,-24.88"/>
-<text text-anchor="middle" x="216" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.48,-15.25C141.52,-15.25 149.69,-15.25 157.59,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.42,-18.75 167.42,-15.25 157.42,-11.75 157.42,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_a6d3f2465a7c5803a1ff16c5378bcc5e4_cgraph_org.svg b/d8/d28/classrange__queries_1_1per_seg_tree_a6d3f2465a7c5803a1ff16c5378bcc5e4_cgraph_org.svg
deleted file mode 100644
index fb621408d..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_a6d3f2465a7c5803a1ff16c5378bcc5e4_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::perSegTree::construct Pages: 1 -->
-<svg width="271pt" height="57pt"
- viewBox="0.00 0.00 271.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>range_queries::perSegTree::construct</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...">
-<polygon fill="#999999" stroke="#666666" points="133,-30.5 0,-30.5 0,0 133,0 133,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::construct</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.01,-30.99C34.6,-40.06 43.43,-48.5 66.5,-48.5 79.11,-48.5 87.47,-45.97 91.57,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.02,-42.85 92.8,-32.49 88.07,-41.97 95.02,-42.85"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263,-24.88 169,-24.88 169,-5.63 263,-5.63 263,-24.88"/>
-<text text-anchor="middle" x="216" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.48,-15.25C141.52,-15.25 149.69,-15.25 157.59,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.42,-18.75 167.42,-15.25 157.42,-11.75 157.42,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ac83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph.map b/d8/d28/classrange__queries_1_1per_seg_tree_ac83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph.map
deleted file mode 100644
index 4851cb83c..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_ac83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph.map
+++ /dev/null
@@ -1,14 +0,0 @@
-<map id="range_queries::perSegTree::construct" name="range_queries::perSegTree::construct">
-<area shape="rect" id="Node000001" title="Constructing the segment tree with the values in the passed vector. Returned root pointer is pushed i..." alt="" coords="5,112,183,153"/>
-<area shape="rect" id="Node000002" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4" title="Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum..." alt="" coords="231,29,408,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="150,109,230,79,246,73,247,78,232,84,152,114"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/empty.html#" title=" " alt="" coords="256,94,383,120"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="182,120,240,113,240,119,183,125"/>
-<area shape="rect" id="Node000005" 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="242,144,396,169"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="183,139,227,144,226,149,182,144"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="262,193,377,218"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="151,151,231,179,253,186,251,191,230,184,149,156"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="281,29,280,19,286,10,299,5,319,3,341,5,354,11,352,16,340,10,319,8,300,10,289,15,285,20,287,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="456,37,581,62"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="409,47,441,47,441,52,409,52"/>
-</map>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ac83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph.md5 b/d8/d28/classrange__queries_1_1per_seg_tree_ac83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph.md5
deleted file mode 100644
index 9e5098224..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_ac83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5304b706a99b2e16f6b9fdbd846ba643
\ No newline at end of file
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ac83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph.svg b/d8/d28/classrange__queries_1_1per_seg_tree_ac83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph.svg
deleted file mode 100644
index 38ed7b2a9..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_ac83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph.svg
+++ /dev/null
@@ -1,148 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::perSegTree::construct Pages: 1 -->
-<svg width="440pt" height="168pt"
- viewBox="0.00 0.00 440.00 167.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 163.88)">
-<title>range_queries::perSegTree::construct</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Constructing the segment tree with the values in the passed vector. Returned root pointer is pushed i...">
-<polygon fill="#999999" stroke="#666666" points="133,-79.88 0,-79.88 0,-49.38 133,-49.38 133,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="66.5" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::construct</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4" target="_top" xlink:title="Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...">
-<polygon fill="white" stroke="#666666" points="302,-141.88 169,-141.88 169,-111.38 302,-111.38 302,-141.88"/>
-<text text-anchor="start" x="177" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="235.5" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">::construct</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.96,-80.22C127.34,-87.12 149.24,-95.31 169,-102.62 172.86,-104.06 176.85,-105.53 180.87,-107.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.49,-110.23 190.08,-110.4 181.9,-103.66 179.49,-110.23"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.25,-93.25 187.75,-93.25 187.75,-74 283.25,-74 283.25,-93.25"/>
-<text text-anchor="middle" x="235.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.02,-72.08C147.23,-73.7 162.17,-75.4 176.08,-76.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.65,-80.45 185.98,-78.1 176.44,-73.5 175.65,-80.45"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="293.38,-56.25 177.62,-56.25 177.62,-37 293.38,-37 293.38,-56.25"/>
-<text text-anchor="middle" x="235.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.02,-57.56C143.87,-56.39 155.15,-55.18 166.07,-54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.22,-57.51 175.79,-52.95 165.47,-50.55 166.22,-57.51"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278.75,-19.25 192.25,-19.25 192.25,0 278.75,0 278.75,-19.25"/>
-<text text-anchor="middle" x="235.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.23,-48.92C126.67,-42.03 148.81,-34.07 169,-27.62 174.14,-25.99 179.53,-24.36 184.92,-22.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.78,-26.18 194.45,-20.08 183.87,-19.45 185.78,-26.18"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.01,-142.36C203.6,-151.43 212.43,-159.88 235.5,-159.88 248.11,-159.88 256.47,-157.35 260.57,-153.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="264.02,-154.22 261.8,-143.86 257.07,-153.34 264.02,-154.22"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="432,-136.25 338,-136.25 338,-117 432,-117 432,-136.25"/>
-<text text-anchor="middle" x="385" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.48,-126.62C310.52,-126.62 318.69,-126.62 326.59,-126.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.42,-130.13 336.42,-126.63 326.42,-123.13 326.42,-130.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ac83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph_org.svg b/d8/d28/classrange__queries_1_1per_seg_tree_ac83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph_org.svg
deleted file mode 100644
index 628e4ba60..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_ac83bcabf5a8db8b0d8d156a4c1bcd4c3_cgraph_org.svg
+++ /dev/null
@@ -1,122 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::perSegTree::construct Pages: 1 -->
-<svg width="440pt" height="168pt"
- viewBox="0.00 0.00 440.00 167.88" 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 163.88)">
-<title>range_queries::perSegTree::construct</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Constructing the segment tree with the values in the passed vector. Returned root pointer is pushed i...">
-<polygon fill="#999999" stroke="#666666" points="133,-79.88 0,-79.88 0,-49.38 133,-49.38 133,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="66.5" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::construct</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4" target="_top" xlink:title="Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...">
-<polygon fill="white" stroke="#666666" points="302,-141.88 169,-141.88 169,-111.38 302,-111.38 302,-141.88"/>
-<text text-anchor="start" x="177" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="235.5" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">::construct</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.96,-80.22C127.34,-87.12 149.24,-95.31 169,-102.62 172.86,-104.06 176.85,-105.53 180.87,-107.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.49,-110.23 190.08,-110.4 181.9,-103.66 179.49,-110.23"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.25,-93.25 187.75,-93.25 187.75,-74 283.25,-74 283.25,-93.25"/>
-<text text-anchor="middle" x="235.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.02,-72.08C147.23,-73.7 162.17,-75.4 176.08,-76.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.65,-80.45 185.98,-78.1 176.44,-73.5 175.65,-80.45"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="293.38,-56.25 177.62,-56.25 177.62,-37 293.38,-37 293.38,-56.25"/>
-<text text-anchor="middle" x="235.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.02,-57.56C143.87,-56.39 155.15,-55.18 166.07,-54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.22,-57.51 175.79,-52.95 165.47,-50.55 166.22,-57.51"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278.75,-19.25 192.25,-19.25 192.25,0 278.75,0 278.75,-19.25"/>
-<text text-anchor="middle" x="235.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.23,-48.92C126.67,-42.03 148.81,-34.07 169,-27.62 174.14,-25.99 179.53,-24.36 184.92,-22.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.78,-26.18 194.45,-20.08 183.87,-19.45 185.78,-26.18"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.01,-142.36C203.6,-151.43 212.43,-159.88 235.5,-159.88 248.11,-159.88 256.47,-157.35 260.57,-153.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="264.02,-154.22 261.8,-143.86 257.07,-153.34 264.02,-154.22"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="432,-136.25 338,-136.25 338,-117 432,-117 432,-136.25"/>
-<text text-anchor="middle" x="385" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.48,-126.62C310.52,-126.62 318.69,-126.62 326.59,-126.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.42,-130.13 336.42,-126.63 326.42,-123.13 326.42,-130.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ace7f57935b3bb9446f11c239fd89ae79_cgraph.map b/d8/d28/classrange__queries_1_1per_seg_tree_ace7f57935b3bb9446f11c239fd89ae79_cgraph.map
deleted file mode 100644
index 339c61cd9..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_ace7f57935b3bb9446f11c239fd89ae79_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="range_queries::perSegTree::lazy" name="range_queries::perSegTree::lazy">
-<area shape="rect" id="Node000001" title="If there is some value to be propagated to the passed node, value is added to the node and the childr..." alt="" coords="5,5,183,46"/>
-<area shape="rect" id="Node000002" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" title="Creating a new node with the same values of curr node." alt="" coords="231,5,408,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="183,23,215,23,215,28,183,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="456,13,581,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="409,23,441,23,441,28,409,28"/>
-</map>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ace7f57935b3bb9446f11c239fd89ae79_cgraph.md5 b/d8/d28/classrange__queries_1_1per_seg_tree_ace7f57935b3bb9446f11c239fd89ae79_cgraph.md5
deleted file mode 100644
index e3ae425c7..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_ace7f57935b3bb9446f11c239fd89ae79_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-66e7a85b26e617502f8845c31cf0a79f
\ No newline at end of file
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ace7f57935b3bb9446f11c239fd89ae79_cgraph.svg b/d8/d28/classrange__queries_1_1per_seg_tree_ace7f57935b3bb9446f11c239fd89ae79_cgraph.svg
deleted file mode 100644
index 9a39e705d..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_ace7f57935b3bb9446f11c239fd89ae79_cgraph.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::perSegTree::lazy Pages: 1 -->
-<svg width="440pt" height="39pt"
- viewBox="0.00 0.00 440.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>range_queries::perSegTree::lazy</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="If there is some value to be propagated to the passed node, value is added to the node and the childr...">
-<polygon fill="#999999" stroke="#666666" points="133,-30.5 0,-30.5 0,0 133,0 133,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::lazy</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" target="_top" xlink:title="Creating a new node with the same values of curr node.">
-<polygon fill="white" stroke="#666666" points="302,-30.5 169,-30.5 169,0 302,0 302,-30.5"/>
-<text text-anchor="start" x="177" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="235.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::newKid</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.02,-15.25C140.97,-15.25 149.15,-15.25 157.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.1,-18.75 167.1,-15.25 157.1,-11.75 157.1,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="432,-24.88 338,-24.88 338,-5.63 432,-5.63 432,-24.88"/>
-<text text-anchor="middle" x="385" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.48,-15.25C310.52,-15.25 318.69,-15.25 326.59,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.42,-18.75 336.42,-15.25 326.42,-11.75 326.42,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ace7f57935b3bb9446f11c239fd89ae79_cgraph_org.svg b/d8/d28/classrange__queries_1_1per_seg_tree_ace7f57935b3bb9446f11c239fd89ae79_cgraph_org.svg
deleted file mode 100644
index a5b03e754..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_ace7f57935b3bb9446f11c239fd89ae79_cgraph_org.svg
+++ /dev/null
@@ -1,59 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::perSegTree::lazy Pages: 1 -->
-<svg width="440pt" height="39pt"
- viewBox="0.00 0.00 440.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>range_queries::perSegTree::lazy</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="If there is some value to be propagated to the passed node, value is added to the node and the childr...">
-<polygon fill="#999999" stroke="#666666" points="133,-30.5 0,-30.5 0,0 133,0 133,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::lazy</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" target="_top" xlink:title="Creating a new node with the same values of curr node.">
-<polygon fill="white" stroke="#666666" points="302,-30.5 169,-30.5 169,0 302,0 302,-30.5"/>
-<text text-anchor="start" x="177" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="235.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::newKid</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.02,-15.25C140.97,-15.25 149.15,-15.25 157.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.1,-18.75 167.1,-15.25 157.1,-11.75 157.1,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="432,-24.88 338,-24.88 338,-5.63 432,-5.63 432,-24.88"/>
-<text text-anchor="middle" x="385" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.48,-15.25C310.52,-15.25 318.69,-15.25 326.59,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.42,-18.75 336.42,-15.25 326.42,-11.75 326.42,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.map b/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.map
deleted file mode 100644
index be236116e..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="range_queries::perSegTree::query" name="range_queries::perSegTree::query">
-<area shape="rect" id="Node000001" title="Querying the range from index l to index r, getting the sum of the elements whose index x satisfies l..." alt="" coords="5,29,183,70"/>
-<area shape="rect" id="Node000002" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4" title="Querying the range from index l to index r, checking at every node if it has some value to be propaga..." alt="" coords="231,29,408,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="183,47,215,47,215,52,183,52"/>
-<area shape="poly" id="edge5_Node000002_Node000002" title=" " alt="" coords="277,29,275,19,282,10,297,5,319,3,344,5,358,11,356,16,342,10,319,8,298,10,285,15,280,21,282,28"/>
-<area shape="rect" id="Node000003" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" title="If there is some value to be propagated to the passed node, value is added to the node and the childr..." alt="" coords="456,29,633,70"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="408,47,440,47,440,52,408,52"/>
-<area shape="rect" id="Node000004" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" title="Creating a new node with the same values of curr node." alt="" coords="681,29,859,70"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="633,47,666,47,666,52,633,52"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="907,37,1032,62"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="859,47,891,47,891,52,859,52"/>
-</map>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.md5 b/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.md5
deleted file mode 100644
index 7b213f91a..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f1a8b9d33a6aa48f41ba95b714426d6b
\ No newline at end of file
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.svg b/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.svg
deleted file mode 100644
index 981522413..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph.svg
+++ /dev/null
@@ -1,189 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::perSegTree::query Pages: 1 -->
-<!--zoomable 57 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 778;
-var viewHeight = 57;
-var sectionId = 'dynsection-6';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>range_queries::perSegTree::query</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Querying the range from index l to index r, getting the sum of the elements whose index x satisfies l...">
-<polygon fill="#999999" stroke="#666666" points="133,-30.5 0,-30.5 0,0 133,0 133,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::query</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4" target="_top" xlink:title="Querying the range from index l to index r, checking at every node if it has some value to be propaga...">
-<polygon fill="white" stroke="#666666" points="302,-30.5 169,-30.5 169,0 302,0 302,-30.5"/>
-<text text-anchor="start" x="177" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="235.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.02,-15.25C140.97,-15.25 149.15,-15.25 157.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.1,-18.75 167.1,-15.25 157.1,-11.75 157.1,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge5_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge5_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M205.55,-30.99C199.44,-40.06 209.42,-48.5 235.5,-48.5 249.76,-48.5 259.21,-45.97 263.84,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="267.28,-42.88 265.23,-32.48 260.35,-41.89 267.28,-42.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" target="_top" xlink:title="If there is some value to be propagated to the passed node, value is added to the node and the childr...">
-<polygon fill="white" stroke="#666666" points="471,-30.5 338,-30.5 338,0 471,0 471,-30.5"/>
-<text text-anchor="start" x="346" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="404.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::lazy</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.02,-15.25C309.97,-15.25 318.15,-15.25 326.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.1,-18.75 336.1,-15.25 326.1,-11.75 326.1,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" target="_top" xlink:title="Creating a new node with the same values of curr node.">
-<polygon fill="white" stroke="#666666" points="640,-30.5 507,-30.5 507,0 640,0 640,-30.5"/>
-<text text-anchor="start" x="515" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="573.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::newKid</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M471.02,-15.25C478.97,-15.25 487.15,-15.25 495.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.1,-18.75 505.1,-15.25 495.1,-11.75 495.1,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="770,-24.88 676,-24.88 676,-5.63 770,-5.63 770,-24.88"/>
-<text text-anchor="middle" x="723" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M640.48,-15.25C648.52,-15.25 656.69,-15.25 664.59,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="664.42,-18.75 674.42,-15.25 664.42,-11.75 664.42,-18.75"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph_org.svg b/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph_org.svg
deleted file mode 100644
index 0e06a2b94..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_ad484002bcb701820d55f32ea5d525571_cgraph_org.svg
+++ /dev/null
@@ -1,106 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::perSegTree::query Pages: 1 -->
-<svg width="778pt" height="57pt"
- viewBox="0.00 0.00 778.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>range_queries::perSegTree::query</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Querying the range from index l to index r, getting the sum of the elements whose index x satisfies l...">
-<polygon fill="#999999" stroke="#666666" points="133,-30.5 0,-30.5 0,0 133,0 133,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::query</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4" target="_top" xlink:title="Querying the range from index l to index r, checking at every node if it has some value to be propaga...">
-<polygon fill="white" stroke="#666666" points="302,-30.5 169,-30.5 169,0 302,0 302,-30.5"/>
-<text text-anchor="start" x="177" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="235.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.02,-15.25C140.97,-15.25 149.15,-15.25 157.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.1,-18.75 167.1,-15.25 157.1,-11.75 157.1,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge5_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge5_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M205.55,-30.99C199.44,-40.06 209.42,-48.5 235.5,-48.5 249.76,-48.5 259.21,-45.97 263.84,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="267.28,-42.88 265.23,-32.48 260.35,-41.89 267.28,-42.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" target="_top" xlink:title="If there is some value to be propagated to the passed node, value is added to the node and the childr...">
-<polygon fill="white" stroke="#666666" points="471,-30.5 338,-30.5 338,0 471,0 471,-30.5"/>
-<text text-anchor="start" x="346" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="404.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::lazy</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.02,-15.25C309.97,-15.25 318.15,-15.25 326.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.1,-18.75 336.1,-15.25 326.1,-11.75 326.1,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" target="_top" xlink:title="Creating a new node with the same values of curr node.">
-<polygon fill="white" stroke="#666666" points="640,-30.5 507,-30.5 507,0 640,0 640,-30.5"/>
-<text text-anchor="start" x="515" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="573.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::newKid</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M471.02,-15.25C478.97,-15.25 487.15,-15.25 495.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.1,-18.75 505.1,-15.25 495.1,-11.75 495.1,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="770,-24.88 676,-24.88 676,-5.63 770,-5.63 770,-24.88"/>
-<text text-anchor="middle" x="723" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M640.48,-15.25C648.52,-15.25 656.69,-15.25 664.59,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="664.42,-18.75 674.42,-15.25 664.42,-11.75 664.42,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.map b/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.map
deleted file mode 100644
index 746b3a589..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="range_queries::perSegTree::query" name="range_queries::perSegTree::query">
-<area shape="rect" id="Node000001" title="Querying the range from index l to index r, checking at every node if it has some value to be propaga..." alt="" coords="5,29,183,70"/>
-<area shape="poly" id="edge4_Node000001_Node000001" title=" " alt="" coords="51,29,49,19,56,10,71,5,94,3,118,5,133,11,131,16,117,10,94,8,73,10,60,15,55,21,57,28"/>
-<area shape="rect" id="Node000002" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" title="If there is some value to be propagated to the passed node, value is added to the node and the childr..." alt="" coords="231,29,408,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="183,47,215,47,215,52,183,52"/>
-<area shape="rect" id="Node000003" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" title="Creating a new node with the same values of curr node." alt="" coords="456,29,633,70"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="408,47,440,47,440,52,408,52"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="681,37,807,62"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="634,47,666,47,666,52,634,52"/>
-</map>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.md5 b/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.md5
deleted file mode 100644
index e9f1ec325..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0f56b13ce35bed1d273893dd5a30225f
\ No newline at end of file
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.svg b/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.svg
deleted file mode 100644
index 4f6461485..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph.svg
+++ /dev/null
@@ -1,170 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::perSegTree::query Pages: 1 -->
-<!--zoomable 57 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 609;
-var viewHeight = 57;
-var sectionId = 'dynsection-5';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>range_queries::perSegTree::query</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Querying the range from index l to index r, checking at every node if it has some value to be propaga...">
-<polygon fill="#999999" stroke="#666666" points="133,-30.5 0,-30.5 0,0 133,0 133,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.55,-30.99C30.44,-40.06 40.42,-48.5 66.5,-48.5 80.76,-48.5 90.21,-45.97 94.84,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.28,-42.88 96.23,-32.48 91.35,-41.89 98.28,-42.88"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" target="_top" xlink:title="If there is some value to be propagated to the passed node, value is added to the node and the childr...">
-<polygon fill="white" stroke="#666666" points="302,-30.5 169,-30.5 169,0 302,0 302,-30.5"/>
-<text text-anchor="start" x="177" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="235.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::lazy</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.02,-15.25C140.97,-15.25 149.15,-15.25 157.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.1,-18.75 167.1,-15.25 157.1,-11.75 157.1,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" target="_top" xlink:title="Creating a new node with the same values of curr node.">
-<polygon fill="white" stroke="#666666" points="471,-30.5 338,-30.5 338,0 471,0 471,-30.5"/>
-<text text-anchor="start" x="346" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="404.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::newKid</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.02,-15.25C309.97,-15.25 318.15,-15.25 326.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.1,-18.75 336.1,-15.25 326.1,-11.75 326.1,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="601,-24.88 507,-24.88 507,-5.63 601,-5.63 601,-24.88"/>
-<text text-anchor="middle" x="554" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M471.48,-15.25C479.52,-15.25 487.69,-15.25 495.59,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.42,-18.75 505.42,-15.25 495.42,-11.75 495.42,-18.75"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph_org.svg b/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph_org.svg
deleted file mode 100644
index 9bf29327a..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_ae8ae4b1835e5e8aec32f68c5059ed4d4_cgraph_org.svg
+++ /dev/null
@@ -1,87 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::perSegTree::query Pages: 1 -->
-<svg width="609pt" height="57pt"
- viewBox="0.00 0.00 609.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>range_queries::perSegTree::query</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Querying the range from index l to index r, checking at every node if it has some value to be propaga...">
-<polygon fill="#999999" stroke="#666666" points="133,-30.5 0,-30.5 0,0 133,0 133,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::query</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.55,-30.99C30.44,-40.06 40.42,-48.5 66.5,-48.5 80.76,-48.5 90.21,-45.97 94.84,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.28,-42.88 96.23,-32.48 91.35,-41.89 98.28,-42.88"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" target="_top" xlink:title="If there is some value to be propagated to the passed node, value is added to the node and the childr...">
-<polygon fill="white" stroke="#666666" points="302,-30.5 169,-30.5 169,0 302,0 302,-30.5"/>
-<text text-anchor="start" x="177" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="235.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::lazy</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.02,-15.25C140.97,-15.25 149.15,-15.25 157.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.1,-18.75 167.1,-15.25 157.1,-11.75 157.1,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" target="_top" xlink:title="Creating a new node with the same values of curr node.">
-<polygon fill="white" stroke="#666666" points="471,-30.5 338,-30.5 338,0 471,0 471,-30.5"/>
-<text text-anchor="start" x="346" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="404.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::newKid</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.02,-15.25C309.97,-15.25 318.15,-15.25 326.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.1,-18.75 336.1,-15.25 326.1,-11.75 326.1,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="601,-24.88 507,-24.88 507,-5.63 601,-5.63 601,-24.88"/>
-<text text-anchor="middle" x="554" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M471.48,-15.25C479.52,-15.25 487.69,-15.25 495.59,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.42,-18.75 505.42,-15.25 495.42,-11.75 495.42,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.map b/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.map
deleted file mode 100644
index bbb42a7c5..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.map
+++ /dev/null
@@ -1,18 +0,0 @@
-<map id="range_queries::perSegTree::update" name="range_queries::perSegTree::update">
-<area shape="rect" id="Node000001" title="Doing range update by passing the left and right indexes of the range as well as the value to be adde..." alt="" coords="5,47,183,88"/>
-<area shape="rect" id="Node000002" 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="242,5,396,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="182,46,242,32,243,37,183,51"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="262,55,377,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="183,65,246,65,246,70,183,70"/>
-<area shape="rect" id="Node000004" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6" title="Doing range update, checking at every node if it has some value to be propagated. All nodes affected ..." alt="" coords="231,128,408,169"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="154,86,248,120,246,125,152,91"/>
-<area shape="poly" id="edge9_Node000004_Node000004" title=" " alt="" coords="277,128,275,119,282,109,297,104,319,102,344,104,358,110,356,115,342,109,319,107,298,109,285,114,280,120,282,127"/>
-<area shape="rect" id="Node000005" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" title="If there is some value to be propagated to the passed node, value is added to the node and the childr..." alt="" coords="456,71,633,112"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="401,125,447,114,448,119,402,131"/>
-<area shape="rect" id="Node000006" href="$d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" title="Creating a new node with the same values of curr node." alt="" coords="681,122,859,162"/>
-<area shape="poly" id="edge8_Node000004_Node000006" title=" " alt="" coords="409,145,666,141,666,146,409,150"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="907,159,1032,184"/>
-<area shape="poly" id="edge7_Node000004_Node000007" title=" " alt="" coords="409,154,537,164,681,172,770,173,859,172,891,171,891,176,859,177,770,178,681,177,537,169,408,159"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="634,109,667,116,665,121,633,114"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="860,153,892,157,891,163,859,158"/>
-</map>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.md5 b/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.md5
deleted file mode 100644
index fec470734..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f277e769f847dc8fc67d8364c3c69894
\ No newline at end of file
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.svg b/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.svg
deleted file mode 100644
index 77db6961a..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph.svg
+++ /dev/null
@@ -1,243 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::perSegTree::update Pages: 1 -->
-<!--zoomable 142 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 778;
-var viewHeight = 142;
-var sectionId = 'dynsection-9';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>range_queries::perSegTree::update</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Doing range update by passing the left and right indexes of the range as well as the value to be adde...">
-<polygon fill="#999999" stroke="#666666" points="133,-102.88 0,-102.88 0,-72.38 133,-72.38 133,-102.88"/>
-<text text-anchor="start" x="8" y="-89.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="66.5" y="-78.12" font-family="Helvetica,sans-Serif" font-size="10.00">::update</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="293.38,-134.25 177.62,-134.25 177.62,-115 293.38,-115 293.38,-134.25"/>
-<text text-anchor="middle" x="235.5" y="-120.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.02,-102.14C147.95,-105.45 163.68,-108.94 178.19,-112.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.01,-115.47 187.53,-114.22 178.52,-108.64 177.01,-115.47"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278.75,-97.25 192.25,-97.25 192.25,-78 278.75,-78 278.75,-97.25"/>
-<text text-anchor="middle" x="235.5" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.02,-87.62C148.75,-87.62 165.37,-87.62 180.51,-87.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.24,-91.13 190.24,-87.63 180.24,-84.13 180.24,-91.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6" target="_top" xlink:title="Doing range update, checking at every node if it has some value to be propagated. All nodes affected ...">
-<polygon fill="white" stroke="#666666" points="302,-41.88 169,-41.88 169,-11.37 302,-11.37 302,-41.88"/>
-<text text-anchor="start" x="177" y="-28.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="235.5" y="-17.12" font-family="Helvetica,sans-Serif" font-size="10.00">::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.51,-71.92C132.03,-64.05 158.29,-54.46 181.1,-46.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.03,-49.52 190.22,-42.8 179.62,-42.94 182.03,-49.52"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge9_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge9_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M205.55,-42.36C199.44,-51.43 209.42,-59.88 235.5,-59.88 249.76,-59.88 259.21,-57.35 263.84,-53.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="267.28,-54.25 265.23,-43.86 260.35,-53.26 267.28,-54.25"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" target="_top" xlink:title="If there is some value to be propagated to the passed node, value is added to the node and the childr...">
-<polygon fill="white" stroke="#666666" points="471,-84.88 338,-84.88 338,-54.38 471,-54.38 471,-84.88"/>
-<text text-anchor="start" x="346" y="-71.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="404.5" y="-60.12" font-family="Helvetica,sans-Serif" font-size="10.00">::lazy</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.26,-42.27C308.43,-45.15 320.18,-48.17 331.64,-51.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="330.48,-54.44 341.04,-53.54 332.23,-47.66 330.48,-54.44"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" target="_top" xlink:title="Creating a new node with the same values of curr node.">
-<polygon fill="white" stroke="#666666" points="640,-46.88 507,-46.88 507,-16.38 640,-16.38 640,-46.88"/>
-<text text-anchor="start" x="515" y="-33.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="573.5" y="-22.12" font-family="Helvetica,sans-Serif" font-size="10.00">::newKid</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge8_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge8_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.48,-27.61C357.85,-28.43 437,-29.61 495.3,-30.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.1,-33.97 505.16,-30.62 495.21,-26.97 495.1,-33.97"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="770,-19.25 676,-19.25 676,0 770,0 770,-19.25"/>
-<text text-anchor="middle" x="723" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge7_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge7_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.3,-20.71C357.03,-16.1 437.02,-10.08 507,-7.62 566.07,-5.55 580.89,-6.9 640,-7.62 647.84,-7.72 656.1,-7.87 664.24,-8.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="664.01,-11.54 674.09,-8.26 664.17,-4.54 664.01,-11.54"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M471.02,-54.72C479.06,-52.89 487.34,-51 495.53,-49.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="496.17,-52.58 505.14,-46.95 494.61,-45.76 496.17,-52.58"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M640.48,-21.78C648.52,-20.58 656.69,-19.37 664.59,-18.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="665.06,-21.66 674.43,-16.72 664.03,-14.73 665.06,-21.66"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph_org.svg b/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph_org.svg
deleted file mode 100644
index 4249f0fd6..000000000
--- a/d8/d28/classrange__queries_1_1per_seg_tree_af87494e6cf012d28c4f5b9d1c15f9c5d_cgraph_org.svg
+++ /dev/null
@@ -1,160 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::perSegTree::update Pages: 1 -->
-<svg width="778pt" height="142pt"
- viewBox="0.00 0.00 778.00 142.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138.25)">
-<title>range_queries::perSegTree::update</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Doing range update by passing the left and right indexes of the range as well as the value to be adde...">
-<polygon fill="#999999" stroke="#666666" points="133,-102.88 0,-102.88 0,-72.38 133,-72.38 133,-102.88"/>
-<text text-anchor="start" x="8" y="-89.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="66.5" y="-78.12" font-family="Helvetica,sans-Serif" font-size="10.00">::update</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="293.38,-134.25 177.62,-134.25 177.62,-115 293.38,-115 293.38,-134.25"/>
-<text text-anchor="middle" x="235.5" y="-120.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.02,-102.14C147.95,-105.45 163.68,-108.94 178.19,-112.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.01,-115.47 187.53,-114.22 178.52,-108.64 177.01,-115.47"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278.75,-97.25 192.25,-97.25 192.25,-78 278.75,-78 278.75,-97.25"/>
-<text text-anchor="middle" x="235.5" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.02,-87.62C148.75,-87.62 165.37,-87.62 180.51,-87.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.24,-91.13 190.24,-87.63 180.24,-84.13 180.24,-91.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6" target="_top" xlink:title="Doing range update, checking at every node if it has some value to be propagated. All nodes affected ...">
-<polygon fill="white" stroke="#666666" points="302,-41.88 169,-41.88 169,-11.37 302,-11.37 302,-41.88"/>
-<text text-anchor="start" x="177" y="-28.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="235.5" y="-17.12" font-family="Helvetica,sans-Serif" font-size="10.00">::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.51,-71.92C132.03,-64.05 158.29,-54.46 181.1,-46.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.03,-49.52 190.22,-42.8 179.62,-42.94 182.03,-49.52"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge9_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge9_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M205.55,-42.36C199.44,-51.43 209.42,-59.88 235.5,-59.88 249.76,-59.88 259.21,-57.35 263.84,-53.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="267.28,-54.25 265.23,-43.86 260.35,-53.26 267.28,-54.25"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79" target="_top" xlink:title="If there is some value to be propagated to the passed node, value is added to the node and the childr...">
-<polygon fill="white" stroke="#666666" points="471,-84.88 338,-84.88 338,-54.38 471,-54.38 471,-84.88"/>
-<text text-anchor="start" x="346" y="-71.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="404.5" y="-60.12" font-family="Helvetica,sans-Serif" font-size="10.00">::lazy</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.26,-42.27C308.43,-45.15 320.18,-48.17 331.64,-51.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="330.48,-54.44 341.04,-53.54 332.23,-47.66 330.48,-54.44"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817" target="_top" xlink:title="Creating a new node with the same values of curr node.">
-<polygon fill="white" stroke="#666666" points="640,-46.88 507,-46.88 507,-16.38 640,-16.38 640,-46.88"/>
-<text text-anchor="start" x="515" y="-33.38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
-<text text-anchor="middle" x="573.5" y="-22.12" font-family="Helvetica,sans-Serif" font-size="10.00">::newKid</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge8_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge8_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.48,-27.61C357.85,-28.43 437,-29.61 495.3,-30.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.1,-33.97 505.16,-30.62 495.21,-26.97 495.1,-33.97"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="770,-19.25 676,-19.25 676,0 770,0 770,-19.25"/>
-<text text-anchor="middle" x="723" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge7_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge7_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.3,-20.71C357.03,-16.1 437.02,-10.08 507,-7.62 566.07,-5.55 580.89,-6.9 640,-7.62 647.84,-7.72 656.1,-7.87 664.24,-8.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="664.01,-11.54 674.09,-8.26 664.17,-4.54 664.01,-11.54"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M471.02,-54.72C479.06,-52.89 487.34,-51 495.53,-49.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="496.17,-52.58 505.14,-46.95 494.61,-45.76 496.17,-52.58"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M640.48,-21.78C648.52,-20.58 656.69,-19.37 664.59,-18.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="665.06,-21.66 674.43,-16.72 664.03,-14.73 665.06,-21.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d2a/namespacea1z26.html b/d8/d2a/namespacea1z26.html
index d35f9375d..2b3acc43c 100644
--- a/d8/d2a/namespacea1z26.html
+++ b/d8/d2a/namespacea1z26.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: a1z26 Namespace Reference</title>
+<title>TheAlgorithms/C++: a1z26 Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html b/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html
index 224cdb5f2..28edc5e60 100644
--- a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html
+++ b/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others::Cache::LRUCache&lt; K, V &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: others::Cache::LRUCache&lt; K, V &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,7 +135,7 @@ $(function(){initNavTree('d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html','..
 <div class="dynheader">
 Collaboration diagram for others::Cache::LRUCache&lt; K, V &gt;:</div>
 <div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.svg" width="100%" height="429"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
+<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d1/db8/classothers_1_1_cache_1_1_l_r_u_cache__coll__graph.svg" width="100%" height="392"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
@@ -159,21 +176,17 @@ Private Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a042bb403f4452ad8c669fbf87ef82821" id="r_a042bb403f4452ad8c669fbf87ef82821"><td class="memItemLeft" align="right" valign="top"><a id="a042bb403f4452ad8c669fbf87ef82821" name="a042bb403f4452ad8c669fbf87ef82821"></a>
-<a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *&#160;</td><td class="memItemRight" valign="bottom"><b>head</b></td></tr>
-<tr class="memdesc:a042bb403f4452ad8c669fbf87ef82821"><td class="mdescLeft">&#160;</td><td class="mdescRight">head of the doubly linked list <br /></td></tr>
+<tr class="memitem:a042bb403f4452ad8c669fbf87ef82821" id="r_a042bb403f4452ad8c669fbf87ef82821"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a042bb403f4452ad8c669fbf87ef82821">head</a></td></tr>
+<tr class="memdesc:a042bb403f4452ad8c669fbf87ef82821"><td class="mdescLeft">&#160;</td><td class="mdescRight">head of the doubly linked list  <br /></td></tr>
 <tr class="separator:a042bb403f4452ad8c669fbf87ef82821"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a448121f391a71f4cf88c3cb6c4cf3100" id="r_a448121f391a71f4cf88c3cb6c4cf3100"><td class="memItemLeft" align="right" valign="top"><a id="a448121f391a71f4cf88c3cb6c4cf3100" name="a448121f391a71f4cf88c3cb6c4cf3100"></a>
-<a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *&#160;</td><td class="memItemRight" valign="bottom"><b>tail</b></td></tr>
-<tr class="memdesc:a448121f391a71f4cf88c3cb6c4cf3100"><td class="mdescLeft">&#160;</td><td class="mdescRight">tail of the doubly linked list <br /></td></tr>
+<tr class="memitem:a448121f391a71f4cf88c3cb6c4cf3100" id="r_a448121f391a71f4cf88c3cb6c4cf3100"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a448121f391a71f4cf88c3cb6c4cf3100">tail</a></td></tr>
+<tr class="memdesc:a448121f391a71f4cf88c3cb6c4cf3100"><td class="mdescLeft">&#160;</td><td class="mdescRight">tail of the doubly linked list  <br /></td></tr>
 <tr class="separator:a448121f391a71f4cf88c3cb6c4cf3100"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af34bb8b8eaa34cc499b4fed30b9d05fc" id="r_af34bb8b8eaa34cc499b4fed30b9d05fc"><td class="memItemLeft" align="right" valign="top"><a id="af34bb8b8eaa34cc499b4fed30b9d05fc" name="af34bb8b8eaa34cc499b4fed30b9d05fc"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a>&#160;</td><td class="memItemRight" valign="bottom"><b>_capacity</b></td></tr>
-<tr class="memdesc:af34bb8b8eaa34cc499b4fed30b9d05fc"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum capacity of the cache <br /></td></tr>
+<tr class="memitem:af34bb8b8eaa34cc499b4fed30b9d05fc" id="r_af34bb8b8eaa34cc499b4fed30b9d05fc"><td class="memItemLeft" align="right" valign="top">std::uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af34bb8b8eaa34cc499b4fed30b9d05fc">_capacity</a></td></tr>
+<tr class="memdesc:af34bb8b8eaa34cc499b4fed30b9d05fc"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum capacity of the cache  <br /></td></tr>
 <tr class="separator:af34bb8b8eaa34cc499b4fed30b9d05fc"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8dab0f69410484f772946befd24cc3c5" id="r_a8dab0f69410484f772946befd24cc3c5"><td class="memItemLeft" align="right" valign="top"><a id="a8dab0f69410484f772946befd24cc3c5" name="a8dab0f69410484f772946befd24cc3c5"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a>&lt; K, <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; * &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>node_map</b></td></tr>
-<tr class="memdesc:a8dab0f69410484f772946befd24cc3c5"><td class="mdescLeft">&#160;</td><td class="mdescRight">maps the key to the node address <br /></td></tr>
+<tr class="memitem:a8dab0f69410484f772946befd24cc3c5" id="r_a8dab0f69410484f772946befd24cc3c5"><td class="memItemLeft" align="right" valign="top">std::unordered_map&lt; K, <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; * &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a></td></tr>
+<tr class="memdesc:a8dab0f69410484f772946befd24cc3c5"><td class="mdescLeft">&#160;</td><td class="mdescRight">maps the key to the node address  <br /></td></tr>
 <tr class="separator:a8dab0f69410484f772946befd24cc3c5"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -186,6 +199,8 @@ class others::Cache::LRUCache&lt; K, V &gt;</div><p><a class="el" href="../../d8
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html#l00061">61</a> of file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a8980cbbc9cf0a98a9592b40c4d6ec28f" name="a8980cbbc9cf0a98a9592b40c4d6ec28f"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a8980cbbc9cf0a98a9592b40c4d6ec28f">&#9670;&#160;</a></span>LRUCache()</h2>
@@ -219,10 +234,12 @@ template&lt;typename K , typename V &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html#l00075">75</a> of file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   76</span>        : <a class="code hl_variable" href="#a042bb403f4452ad8c669fbf87ef82821">head</a>(<span class="keyword">nullptr</span>), <a class="code hl_variable" href="#a448121f391a71f4cf88c3cb6c4cf3100">tail</a>(<span class="keyword">nullptr</span>), <a class="code hl_variable" href="#af34bb8b8eaa34cc499b4fed30b9d05fc">_capacity</a>(<a class="code hl_variable" href="#af34bb8b8eaa34cc499b4fed30b9d05fc">_capacity</a>) {}</div>
-<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a042bb403f4452ad8c669fbf87ef82821"><div class="ttname"><a href="#a042bb403f4452ad8c669fbf87ef82821">others::Cache::LRUCache::head</a></div><div class="ttdeci">CacheNode&lt; K, V &gt; * head</div><div class="ttdoc">head of the doubly linked list</div><div class="ttdef"><b>Definition</b> lru_cache2.cpp:62</div></div>
-<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a448121f391a71f4cf88c3cb6c4cf3100"><div class="ttname"><a href="#a448121f391a71f4cf88c3cb6c4cf3100">others::Cache::LRUCache::tail</a></div><div class="ttdeci">CacheNode&lt; K, V &gt; * tail</div><div class="ttdoc">tail of the doubly linked list</div><div class="ttdef"><b>Definition</b> lru_cache2.cpp:63</div></div>
-<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_af34bb8b8eaa34cc499b4fed30b9d05fc"><div class="ttname"><a href="#af34bb8b8eaa34cc499b4fed30b9d05fc">others::Cache::LRUCache::_capacity</a></div><div class="ttdeci">std::uint32_t _capacity</div><div class="ttdoc">maximum capacity of the cache</div><div class="ttdef"><b>Definition</b> lru_cache2.cpp:64</div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a042bb403f4452ad8c669fbf87ef82821"><div class="ttname"><a href="#a042bb403f4452ad8c669fbf87ef82821">others::Cache::LRUCache::head</a></div><div class="ttdeci">CacheNode&lt; K, V &gt; * head</div><div class="ttdoc">head of the doubly linked list</div><div class="ttdef"><b>Definition</b> <a href="../../dc/daa/lru__cache2_8cpp_source.html#l00062">lru_cache2.cpp:62</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a448121f391a71f4cf88c3cb6c4cf3100"><div class="ttname"><a href="#a448121f391a71f4cf88c3cb6c4cf3100">others::Cache::LRUCache::tail</a></div><div class="ttdeci">CacheNode&lt; K, V &gt; * tail</div><div class="ttdoc">tail of the doubly linked list</div><div class="ttdef"><b>Definition</b> <a href="../../dc/daa/lru__cache2_8cpp_source.html#l00063">lru_cache2.cpp:63</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_af34bb8b8eaa34cc499b4fed30b9d05fc"><div class="ttname"><a href="#af34bb8b8eaa34cc499b4fed30b9d05fc">others::Cache::LRUCache::_capacity</a></div><div class="ttdeci">std::uint32_t _capacity</div><div class="ttdoc">maximum capacity of the cache</div><div class="ttdef"><b>Definition</b> <a href="../../dc/daa/lru__cache2_8cpp_source.html#l00064">lru_cache2.cpp:64</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -252,6 +269,8 @@ template&lt;typename K , typename V &gt; </div>
 </div><div class="memdoc">
 
 <p>destructs the cache, iterates on the map and deletes every node present in the cache. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html#l00205">205</a> of file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  205</span>                {</div>
 <div class="line"><span class="lineno">  206</span>        <span class="keyword">auto</span> it = <a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>.begin();</div>
 <div class="line"><span class="lineno">  207</span>        <span class="keywordflow">while</span> (it != <a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>.end()) {</div>
@@ -259,7 +278,7 @@ template&lt;typename K , typename V &gt; </div>
 <div class="line"><span class="lineno">  209</span>            ++it;</div>
 <div class="line"><span class="lineno">  210</span>        }</div>
 <div class="line"><span class="lineno">  211</span>    }</div>
-<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a8dab0f69410484f772946befd24cc3c5"><div class="ttname"><a href="#a8dab0f69410484f772946befd24cc3c5">others::Cache::LRUCache::node_map</a></div><div class="ttdeci">std::unordered_map&lt; K, CacheNode&lt; K, V &gt; * &gt; node_map</div><div class="ttdoc">maps the key to the node address</div><div class="ttdef"><b>Definition</b> lru_cache2.cpp:67</div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a8dab0f69410484f772946befd24cc3c5"><div class="ttname"><a href="#a8dab0f69410484f772946befd24cc3c5">others::Cache::LRUCache::node_map</a></div><div class="ttdeci">std::unordered_map&lt; K, CacheNode&lt; K, V &gt; * &gt; node_map</div><div class="ttdoc">maps the key to the node address</div><div class="ttdef"><b>Definition</b> <a href="../../dc/daa/lru__cache2_8cpp_source.html#l00067">lru_cache2.cpp:67</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -291,6 +310,8 @@ template&lt;typename K , typename V &gt; </div>
 
 <p>Returns the total capacity of the cache. </p>
 <dl class="section return"><dt>Returns</dt><dd>Total capacity of the cache </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html#l00193">193</a> of file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  193</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#af34bb8b8eaa34cc499b4fed30b9d05fc">_capacity</a>; }</div>
 </div><!-- fragment -->
 </div>
@@ -322,6 +343,8 @@ template&lt;typename K , typename V &gt; </div>
 
 <p>returns whether the cache is empty or not </p>
 <dl class="section return"><dt>Returns</dt><dd>true if the cache is empty, false otherwise. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html#l00199">199</a> of file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  199</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>.empty(); }</div>
 </div><!-- fragment -->
 </div>
@@ -365,9 +388,11 @@ template&lt;typename K , typename V &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html#l00172">172</a> of file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  172</span>                 {</div>
 <div class="line"><span class="lineno">  173</span>        <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>.count(key)) {</div>
-<div class="line"><span class="lineno">  174</span>            <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/runtime_error.html">std::runtime_error</a>(<span class="stringliteral">&quot;key is not present in the cache&quot;</span>);</div>
+<div class="line"><span class="lineno">  174</span>            <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;key is not present in the cache&quot;</span>);</div>
 <div class="line"><span class="lineno">  175</span>        }</div>
 <div class="line"><span class="lineno">  176</span> </div>
 <div class="line"><span class="lineno">  177</span>        <span class="comment">// move node to the beginning of the list</span></div>
@@ -375,14 +400,8 @@ template&lt;typename K , typename V &gt; </div>
 <div class="line"><span class="lineno">  179</span>        <a class="code hl_function" href="#ad022d494b40f82417340b113445e79a4">make_recent</a>(<a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>[key]);</div>
 <div class="line"><span class="lineno">  180</span>        <span class="keywordflow">return</span> value;</div>
 <div class="line"><span class="lineno">  181</span>    }</div>
-<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_ad022d494b40f82417340b113445e79a4"><div class="ttname"><a href="#ad022d494b40f82417340b113445e79a4">others::Cache::LRUCache::make_recent</a></div><div class="ttdeci">void make_recent(CacheNode&lt; K, V &gt; *node_ptr)</div><div class="ttdoc">move the existing node in the list to the beginning of the list.</div><div class="ttdef"><b>Definition</b> lru_cache2.cpp:99</div></div>
-<div class="ttc" id="aruntime_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/runtime_error.html">std::runtime_error</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.svg" width="662" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_ad022d494b40f82417340b113445e79a4"><div class="ttname"><a href="#ad022d494b40f82417340b113445e79a4">others::Cache::LRUCache::make_recent</a></div><div class="ttdeci">void make_recent(CacheNode&lt; K, V &gt; *node_ptr)</div><div class="ttdoc">move the existing node in the list to the beginning of the list.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/daa/lru__cache2_8cpp_source.html#l00099">lru_cache2.cpp:99</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad022d494b40f82417340b113445e79a4" name="ad022d494b40f82417340b113445e79a4"></a>
@@ -417,34 +436,29 @@ template&lt;typename K , typename V &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html#l00099">99</a> of file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   99</span>                                                {</div>
 <div class="line"><span class="lineno">  100</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a042bb403f4452ad8c669fbf87ef82821">head</a> == node_ptr) {</div>
 <div class="line"><span class="lineno">  101</span>            <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  102</span>        }</div>
 <div class="line"><span class="lineno">  103</span> </div>
-<div class="line"><span class="lineno">  104</span>        CacheNode&lt;K, V&gt; *<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a> = node_ptr-&gt;prev;</div>
-<div class="line"><span class="lineno">  105</span>        CacheNode&lt;K, V&gt; *<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a> = node_ptr-&gt;next;</div>
+<div class="line"><span class="lineno">  104</span>        CacheNode&lt;K, V&gt; *prev = node_ptr-&gt;prev;</div>
+<div class="line"><span class="lineno">  105</span>        CacheNode&lt;K, V&gt; *next = node_ptr-&gt;next;</div>
 <div class="line"><span class="lineno">  106</span> </div>
-<div class="line"><span class="lineno">  107</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a>-&gt;next = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a>;</div>
+<div class="line"><span class="lineno">  107</span>        prev-&gt;next = next;</div>
 <div class="line"><span class="lineno">  108</span>        <span class="keywordflow">if</span> (next) {</div>
-<div class="line"><span class="lineno">  109</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a>-&gt;prev = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a>;</div>
+<div class="line"><span class="lineno">  109</span>            next-&gt;prev = prev;</div>
 <div class="line"><span class="lineno">  110</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  111</span>            <a class="code hl_variable" href="#a448121f391a71f4cf88c3cb6c4cf3100">tail</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a>;</div>
+<div class="line"><span class="lineno">  111</span>            <a class="code hl_variable" href="#a448121f391a71f4cf88c3cb6c4cf3100">tail</a> = prev;</div>
 <div class="line"><span class="lineno">  112</span>        }</div>
 <div class="line"><span class="lineno">  113</span> </div>
 <div class="line"><span class="lineno">  114</span>        node_ptr-&gt;prev = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  115</span>        node_ptr-&gt;next = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  116</span>        <a class="code hl_function" href="#a2e53b5ad1368d87da501f61473eb9ea2">push_front</a>(node_ptr);</div>
 <div class="line"><span class="lineno">  117</span>    }</div>
-<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a2e53b5ad1368d87da501f61473eb9ea2"><div class="ttname"><a href="#a2e53b5ad1368d87da501f61473eb9ea2">others::Cache::LRUCache::push_front</a></div><div class="ttdeci">void push_front(CacheNode&lt; K, V &gt; *node_ptr)</div><div class="ttdoc">push the node to the front of the linked list.</div><div class="ttdef"><b>Definition</b> lru_cache2.cpp:83</div></div>
-<div class="ttc" id="anext_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/next.html">std::next</a></div><div class="ttdeci">T next(T... args)</div></div>
-<div class="ttc" id="aprev_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/prev.html">std::prev</a></div><div class="ttdeci">T prev(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph.svg" width="412" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a2e53b5ad1368d87da501f61473eb9ea2"><div class="ttname"><a href="#a2e53b5ad1368d87da501f61473eb9ea2">others::Cache::LRUCache::push_front</a></div><div class="ttdeci">void push_front(CacheNode&lt; K, V &gt; *node_ptr)</div><div class="ttdoc">push the node to the front of the linked list.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/daa/lru__cache2_8cpp_source.html#l00083">lru_cache2.cpp:83</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ab211a4be58491bf11834cae88a0c44f7" name="ab211a4be58491bf11834cae88a0c44f7"></a>
@@ -473,6 +487,8 @@ template&lt;typename K , typename V &gt; </div>
 </div><div class="memdoc">
 
 <p>pop the last node in the linked list. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html#l00122">122</a> of file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  122</span>                    {</div>
 <div class="line"><span class="lineno">  123</span>        <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#a042bb403f4452ad8c669fbf87ef82821">head</a>) {</div>
 <div class="line"><span class="lineno">  124</span>            <span class="keywordflow">return</span>;</div>
@@ -524,6 +540,8 @@ template&lt;typename K , typename V &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html#l00083">83</a> of file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   83</span>                                               {</div>
 <div class="line"><span class="lineno">   84</span>        <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#a042bb403f4452ad8c669fbf87ef82821">head</a>) {</div>
 <div class="line"><span class="lineno">   85</span>            <a class="code hl_variable" href="#a042bb403f4452ad8c669fbf87ef82821">head</a> = node_ptr;</div>
@@ -575,6 +593,8 @@ template&lt;typename K , typename V &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html#l00145">145</a> of file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  145</span>                             {</div>
 <div class="line"><span class="lineno">  146</span>        <span class="comment">// update the value if key already exists</span></div>
 <div class="line"><span class="lineno">  147</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>.count(key)) {</div>
@@ -595,13 +615,8 @@ template&lt;typename K , typename V &gt; </div>
 <div class="line"><span class="lineno">  162</span>        <a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>[key] = newNode;</div>
 <div class="line"><span class="lineno">  163</span>        <a class="code hl_function" href="#a2e53b5ad1368d87da501f61473eb9ea2">push_front</a>(newNode);</div>
 <div class="line"><span class="lineno">  164</span>    }</div>
-<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_ab211a4be58491bf11834cae88a0c44f7"><div class="ttname"><a href="#ab211a4be58491bf11834cae88a0c44f7">others::Cache::LRUCache::pop_back</a></div><div class="ttdeci">void pop_back()</div><div class="ttdoc">pop the last node in the linked list.</div><div class="ttdef"><b>Definition</b> lru_cache2.cpp:122</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph.svg" width="662" height="167"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_ab211a4be58491bf11834cae88a0c44f7"><div class="ttname"><a href="#ab211a4be58491bf11834cae88a0c44f7">others::Cache::LRUCache::pop_back</a></div><div class="ttdeci">void pop_back()</div><div class="ttdoc">pop the last node in the linked list.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/daa/lru__cache2_8cpp_source.html#l00122">lru_cache2.cpp:122</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1b709333874b4633ee02a3661cd042e1" name="a1b709333874b4633ee02a3661cd042e1"></a>
@@ -631,12 +646,127 @@ template&lt;typename K , typename V &gt; </div>
 
 <p>Returns the number of items present in the cache. </p>
 <dl class="section return"><dt>Returns</dt><dd>number of items in the cache </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html#l00187">187</a> of file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  187</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a8dab0f69410484f772946befd24cc3c5">node_map</a>.size(); }</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="af34bb8b8eaa34cc499b4fed30b9d05fc" name="af34bb8b8eaa34cc499b4fed30b9d05fc"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#af34bb8b8eaa34cc499b4fed30b9d05fc">&#9670;&#160;</a></span>_capacity</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename K , typename V &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::uint32_t <a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache</a>&lt; K, V &gt;::_capacity</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>maximum capacity of the cache </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a042bb403f4452ad8c669fbf87ef82821" name="a042bb403f4452ad8c669fbf87ef82821"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a042bb403f4452ad8c669fbf87ef82821">&#9670;&#160;</a></span>head</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename K , typename V &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt;K, V&gt;* <a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache</a>&lt; K, V &gt;::head</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>head of the doubly linked list </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a8dab0f69410484f772946befd24cc3c5" name="a8dab0f69410484f772946befd24cc3c5"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a8dab0f69410484f772946befd24cc3c5">&#9670;&#160;</a></span>node_map</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename K , typename V &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::unordered_map&lt;K, <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt;K, V&gt; *&gt; <a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache</a>&lt; K, V &gt;::node_map</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>maps the key to the node address </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a448121f391a71f4cf88c3cb6c4cf3100" name="a448121f391a71f4cf88c3cb6c4cf3100"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a448121f391a71f4cf88c3cb6c4cf3100">&#9670;&#160;</a></span>tail</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename K , typename V &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt;K, V&gt;* <a class="el" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache</a>&lt; K, V &gt;::tail</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>tail of the doubly linked list </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html#l00063">63</a> of file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>others/<a class="el" href="../../dc/daa/lru__cache2_8cpp.html">lru_cache2.cpp</a></li>
+<li>others/<a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph.map b/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph.map
deleted file mode 100644
index bcfd66e0a..000000000
--- a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="others::Cache::LRUCache::put" name="others::Cache::LRUCache::put">
-<area shape="rect" id="Node000001" title="upsert a key&#45;value pair" alt="" coords="5,70,208,96"/>
-<area shape="rect" id="Node000002" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" title="move the existing node in the list to the beginning of the list." alt="" coords="256,5,432,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="162,67,241,48,242,53,163,72"/>
-<area shape="rect" id="Node000003" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" title="push the node to the front of the linked list." alt="" coords="480,35,656,75"/>
-<area shape="poly" id="edge4_Node000001_Node000003" title=" " alt="" coords="208,74,465,59,465,64,208,80"/>
-<area shape="rect" id="Node000004" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7" title="pop the last node in the linked list." alt="" coords="256,120,432,161"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="163,94,242,113,241,118,162,99"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="432,35,465,39,464,44,432,40"/>
-</map>
diff --git a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph.md5 b/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph.md5
deleted file mode 100644
index 806b8d3a9..000000000
--- a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e39d6679ed29b64bafd84cc0e32ad7af
\ No newline at end of file
diff --git a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph.svg b/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph.svg
deleted file mode 100644
index 259f4d415..000000000
--- a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph.svg
+++ /dev/null
@@ -1,113 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::Cache::LRUCache::put Pages: 1 -->
-<svg width="496pt" height="125pt"
- viewBox="0.00 0.00 496.25 124.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 120.5)">
-<title>others::Cache::LRUCache::put</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="upsert a key&#45;value pair">
-<polygon fill="#999999" stroke="#666666" points="151.75,-67.88 0,-67.88 0,-48.62 151.75,-48.62 151.75,-67.88"/>
-<text text-anchor="middle" x="75.88" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::put</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" target="_top" xlink:title="move the existing node in the list to the beginning of the list.">
-<polygon fill="white" stroke="#666666" points="320,-116.5 187.75,-116.5 187.75,-86 320,-86 320,-116.5"/>
-<text text-anchor="start" x="195.75" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="253.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.14,-68.33C135.8,-72.65 157,-77.83 177.29,-82.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.43,-86.18 186.98,-85.15 178.1,-79.38 176.43,-86.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
-<polygon fill="white" stroke="#666666" points="488.25,-94.5 356,-94.5 356,-64 488.25,-64 488.25,-94.5"/>
-<text text-anchor="start" x="364" y="-81" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="422.12" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152,-62.83C209.03,-66.31 287.16,-71.08 344.55,-74.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.03,-78.05 354.22,-75.17 344.45,-71.07 344.03,-78.05"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7" target="_top" xlink:title="pop the last node in the linked list.">
-<polygon fill="white" stroke="#666666" points="320,-30.5 187.75,-30.5 187.75,0 320,0 320,-30.5"/>
-<text text-anchor="start" x="195.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="253.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.14,-48.17C135.8,-43.85 157,-38.67 177.29,-33.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.1,-37.12 186.98,-31.35 176.43,-30.32 178.1,-37.12"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M320.1,-92.62C328.02,-91.57 336.16,-90.49 344.22,-89.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.58,-92.91 354.04,-88.13 343.66,-85.97 344.58,-92.91"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph_org.svg b/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph_org.svg
deleted file mode 100644
index f847ad875..000000000
--- a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_a5ee34fcee480f21bb6f68a34f0f69b45_cgraph_org.svg
+++ /dev/null
@@ -1,87 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::Cache::LRUCache::put Pages: 1 -->
-<svg width="496pt" height="125pt"
- viewBox="0.00 0.00 496.25 124.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 120.5)">
-<title>others::Cache::LRUCache::put</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="upsert a key&#45;value pair">
-<polygon fill="#999999" stroke="#666666" points="151.75,-67.88 0,-67.88 0,-48.62 151.75,-48.62 151.75,-67.88"/>
-<text text-anchor="middle" x="75.88" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::put</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" target="_top" xlink:title="move the existing node in the list to the beginning of the list.">
-<polygon fill="white" stroke="#666666" points="320,-116.5 187.75,-116.5 187.75,-86 320,-86 320,-116.5"/>
-<text text-anchor="start" x="195.75" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="253.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.14,-68.33C135.8,-72.65 157,-77.83 177.29,-82.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.43,-86.18 186.98,-85.15 178.1,-79.38 176.43,-86.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
-<polygon fill="white" stroke="#666666" points="488.25,-94.5 356,-94.5 356,-64 488.25,-64 488.25,-94.5"/>
-<text text-anchor="start" x="364" y="-81" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="422.12" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152,-62.83C209.03,-66.31 287.16,-71.08 344.55,-74.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.03,-78.05 354.22,-75.17 344.45,-71.07 344.03,-78.05"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7" target="_top" xlink:title="pop the last node in the linked list.">
-<polygon fill="white" stroke="#666666" points="320,-30.5 187.75,-30.5 187.75,0 320,0 320,-30.5"/>
-<text text-anchor="start" x="195.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="253.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.14,-48.17C135.8,-43.85 157,-38.67 177.29,-33.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.1,-37.12 186.98,-31.35 176.43,-30.32 178.1,-37.12"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M320.1,-92.62C328.02,-91.57 336.16,-90.49 344.22,-89.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.58,-92.91 354.04,-88.13 343.66,-85.97 344.58,-92.91"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.map b/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.map
deleted file mode 100644
index d37fae53a..000000000
--- a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="others::Cache::LRUCache::get" name="others::Cache::LRUCache::get">
-<area shape="rect" id="Node000001" title="get the value of the key&#45;value pair if exists" alt="" coords="5,13,208,38"/>
-<area shape="rect" id="Node000002" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" title="move the existing node in the list to the beginning of the list." alt="" coords="256,5,432,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="208,23,240,23,240,28,208,28"/>
-<area shape="rect" id="Node000003" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" title="push the node to the front of the linked list." alt="" coords="480,5,656,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="432,23,464,23,464,28,432,28"/>
-</map>
diff --git a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.md5 b/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.md5
deleted file mode 100644
index a2f67752e..000000000
--- a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1fb368e2a63e8485f9982b788e14a41a
\ No newline at end of file
diff --git a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.svg b/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.svg
deleted file mode 100644
index 3fcd61739..000000000
--- a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::Cache::LRUCache::get Pages: 1 -->
-<svg width="496pt" height="39pt"
- viewBox="0.00 0.00 496.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>others::Cache::LRUCache::get</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="get the value of the key&#45;value pair if exists">
-<polygon fill="#999999" stroke="#666666" points="151.75,-24.88 0,-24.88 0,-5.63 151.75,-5.63 151.75,-24.88"/>
-<text text-anchor="middle" x="75.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::get</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" target="_top" xlink:title="move the existing node in the list to the beginning of the list.">
-<polygon fill="white" stroke="#666666" points="320,-30.5 187.75,-30.5 187.75,0 320,0 320,-30.5"/>
-<text text-anchor="start" x="195.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="253.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.03,-15.25C159.93,-15.25 167.99,-15.25 175.92,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.9,-18.75 185.9,-15.25 175.9,-11.75 175.9,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
-<polygon fill="white" stroke="#666666" points="488.25,-30.5 356,-30.5 356,0 488.25,0 488.25,-30.5"/>
-<text text-anchor="start" x="364" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="422.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M320.1,-15.25C328.02,-15.25 336.16,-15.25 344.22,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.02,-18.75 354.02,-15.25 344.02,-11.75 344.02,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph_org.svg b/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph_org.svg
deleted file mode 100644
index 45be5a3ed..000000000
--- a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ac1be0357ecc7c34144f3d9a63c6cb3ea_cgraph_org.svg
+++ /dev/null
@@ -1,59 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::Cache::LRUCache::get Pages: 1 -->
-<svg width="496pt" height="39pt"
- viewBox="0.00 0.00 496.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>others::Cache::LRUCache::get</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="get the value of the key&#45;value pair if exists">
-<polygon fill="#999999" stroke="#666666" points="151.75,-24.88 0,-24.88 0,-5.63 151.75,-5.63 151.75,-24.88"/>
-<text text-anchor="middle" x="75.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::get</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" target="_top" xlink:title="move the existing node in the list to the beginning of the list.">
-<polygon fill="white" stroke="#666666" points="320,-30.5 187.75,-30.5 187.75,0 320,0 320,-30.5"/>
-<text text-anchor="start" x="195.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="253.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.03,-15.25C159.93,-15.25 167.99,-15.25 175.92,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.9,-18.75 185.9,-15.25 175.9,-11.75 175.9,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
-<polygon fill="white" stroke="#666666" points="488.25,-30.5 356,-30.5 356,0 488.25,0 488.25,-30.5"/>
-<text text-anchor="start" x="364" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="422.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M320.1,-15.25C328.02,-15.25 336.16,-15.25 344.22,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.02,-18.75 354.02,-15.25 344.02,-11.75 344.02,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph.map b/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph.map
deleted file mode 100644
index 59eb6160a..000000000
--- a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="others::Cache::LRUCache::make_recent" name="others::Cache::LRUCache::make_recent">
-<area shape="rect" id="Node000001" title="move the existing node in the list to the beginning of the list." alt="" coords="5,5,182,46"/>
-<area shape="rect" id="Node000002" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" title="push the node to the front of the linked list." alt="" coords="230,5,406,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="182,23,214,23,214,28,182,28"/>
-</map>
diff --git a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph.md5 b/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph.md5
deleted file mode 100644
index 47e7166c7..000000000
--- a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c62f379001ef2b4ca1c6f7e1af924130
\ No newline at end of file
diff --git a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph.svg b/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph.svg
deleted file mode 100644
index a1fba2ffe..000000000
--- a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::Cache::LRUCache::make_recent Pages: 1 -->
-<svg width="309pt" height="39pt"
- viewBox="0.00 0.00 308.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>others::Cache::LRUCache::make_recent</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="move the existing node in the list to the beginning of the list.">
-<polygon fill="#999999" stroke="#666666" points="132.25,-30.5 0,-30.5 0,0 132.25,0 132.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="66.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
-<polygon fill="white" stroke="#666666" points="300.5,-30.5 168.25,-30.5 168.25,0 300.5,0 300.5,-30.5"/>
-<text text-anchor="start" x="176.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="234.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.35,-15.25C140.27,-15.25 148.41,-15.25 156.47,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.27,-18.75 166.27,-15.25 156.27,-11.75 156.27,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph_org.svg b/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph_org.svg
deleted file mode 100644
index f4df1b958..000000000
--- a/d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache_ad022d494b40f82417340b113445e79a4_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::Cache::LRUCache::make_recent Pages: 1 -->
-<svg width="309pt" height="39pt"
- viewBox="0.00 0.00 308.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>others::Cache::LRUCache::make_recent</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="move the existing node in the list to the beginning of the list.">
-<polygon fill="#999999" stroke="#666666" points="132.25,-30.5 0,-30.5 0,0 132.25,0 132.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="66.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
-<polygon fill="white" stroke="#666666" points="300.5,-30.5 168.25,-30.5 168.25,0 300.5,0 300.5,-30.5"/>
-<text text-anchor="start" x="176.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="234.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.35,-15.25C140.27,-15.25 148.41,-15.25 156.47,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.27,-18.75 166.27,-15.25 156.27,-11.75 156.27,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d30/reverse__a__linked__list__using__recusion_8cpp_source.html b/d8/d30/reverse__a__linked__list__using__recusion_8cpp_source.html
new file mode 100644
index 000000000..312aaadd6
--- /dev/null
+++ b/d8/d30/reverse__a__linked__list__using__recusion_8cpp_source.html
@@ -0,0 +1,204 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: operations_on_datastructures/reverse_a_linked_list_using_recusion.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/d30/reverse__a__linked__list__using__recusion_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">reverse_a_linked_list_using_recusion.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> {</div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span>    <span class="keywordtype">int</span> val;</div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *next;</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span>};</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *start;</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>(<span class="keywordtype">int</span> x) {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = start;</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <span class="keywordflow">if</span> (start != NULL) {</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>        <span class="keywordflow">while</span> (t-&gt;next != NULL) {</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>            t = t-&gt;next;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>        }</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        t-&gt;next = n;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        n-&gt;val = x;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        n-&gt;next = NULL;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        n-&gt;val = x;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        n-&gt;next = NULL;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        start = n;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    }</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>}</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keywordtype">void</span> reverse(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *p, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *q) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">if</span> (q-&gt;next == NULL) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        q-&gt;next = p;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        p-&gt;next = NULL;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        start = q;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        reverse(q, q-&gt;next);</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        q-&gt;next = p;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        p-&gt;next = NULL;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    }</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>}</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="keywordtype">void</span> show() {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = start;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">while</span> (t != NULL) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        cout &lt;&lt; t-&gt;val &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        t = t-&gt;next;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>}</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>(1);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>(2);</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>(3);</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>(4);</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>(5);</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>(6);</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    reverse(start, start-&gt;next);</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    show();</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>}</div>
+<div class="ttc" id="aavltree_8cpp_html_a2473fe7416332495b2678ebe89652e4b"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a></div><div class="ttdeci">node * insert(node *root, int item)</div><div class="ttdoc">inserts a new element into AVL tree</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00092">avltree.cpp:92</a></div></div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><b>reverse_a_linked_list_using_recusion.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/d36/namespacecut__rod.html b/d8/d36/namespacecut__rod.html
index 02869f20b..9ba5c1690 100644
--- a/d8/d36/namespacecut__rod.html
+++ b/d8/d36/namespacecut__rod.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: cut_rod Namespace Reference</title>
+<title>TheAlgorithms/C++: cut_rod Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/d38/structquery-members.html b/d8/d38/structquery-members.html
index 94f93a50b..bdcdb7eef 100644
--- a/d8/d38/structquery-members.html
+++ b/d8/d38/structquery-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.map b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.map
index 27797cea5..2041992f1 100644
--- a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.map
+++ b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.map
@@ -1,14 +1,11 @@
 <map id="data_structures::BloomFilter&lt; T &gt;" name="data_structures::BloomFilter&lt; T &gt;">
-<area shape="rect" id="Node000001" title="Bloom filter template class." alt="" coords="135,286,352,312"/>
-<area shape="rect" id="Node000002" href="$d9/dae/classdata__structures_1_1_bitset.html" title="Simple bitset implementation for bloom filter." alt="" coords="75,190,228,216"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="176,225,234,284,230,288,172,229"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="110,94,279,120"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="185,135,160,191,155,189,180,133"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/size_t.html" title=" " alt="" coords="5,5,88,31"/>
-<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="39,46,33,82,34,101,40,118,56,141,77,161,123,187,120,192,74,165,52,145,35,121,29,102,28,82,34,45"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="81,37,175,91,172,96,79,41"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="252,183,420,223"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="308,236,257,288,253,284,304,233"/>
-<area shape="rect" id="Node000006" title=" " alt="" coords="317,94,355,120"/>
-<area shape="poly" id="edge6_Node000005_Node000006" title=" " alt="" coords="338,135,338,182,333,182,333,135"/>
+<area shape="rect" id="Node000001" title="Bloom filter template class." alt="" coords="73,198,290,223"/>
+<area shape="rect" id="Node000002" href="$d9/dae/classdata__structures_1_1_bitset.html" title="Simple bitset implementation for bloom filter." alt="" coords="13,102,166,127"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="113,136,172,195,168,199,110,140"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="5,5,174,31"/>
+<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="92,47,92,101,87,101,87,47"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="190,94,357,135"/>
+<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="246,148,195,199,191,196,242,144"/>
+<area shape="rect" id="Node000005" title=" " alt="" coords="254,5,293,31"/>
+<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="276,46,276,93,271,93,271,46"/>
 </map>
diff --git a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.md5 b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.md5
index e3129d92c..7dba3c0d6 100644
--- a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.md5
+++ b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.md5
@@ -1 +1 @@
-864119e941297c9ddafe2c5174f0cfc9
\ No newline at end of file
+30c8a7f70fab0ac369a46dcfeb7ba0ef
\ No newline at end of file
diff --git a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.svg b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.svg
index cf86a0fca..b24335751 100644
--- a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.svg
+++ b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.svg
@@ -4,8 +4,8 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: data_structures::BloomFilter&lt; T &gt; Pages: 1 -->
-<svg width="319pt" height="238pt"
- viewBox="0.00 0.00 318.62 238.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="272pt" height="172pt"
+ viewBox="0.00 0.00 271.88 171.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
 <svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
@@ -17,14 +17,14 @@
 ]]></style>
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
 <svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 234)">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 167.5)">
 <title>data_structures::BloomFilter&lt; T &gt;</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="Bloom filter template class.">
-<polygon fill="#999999" stroke="#666666" points="260.38,-19.25 97.38,-19.25 97.38,0 260.38,0 260.38,-19.25"/>
-<text text-anchor="middle" x="178.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::BloomFilter&lt; T &gt;</text>
+<polygon fill="#999999" stroke="#666666" points="213.62,-19.25 50.62,-19.25 50.62,0 213.62,0 213.62,-19.25"/>
+<text text-anchor="middle" x="132.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::BloomFilter&lt; T &gt;</text>
 </a>
 </g>
 </g>
@@ -32,8 +32,8 @@
 <g id="Node000002" class="node">
 <title>Node2</title>
 <g id="a_Node000002"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html" target="_top" xlink:title="Simple bitset implementation for bloom filter.">
-<polygon fill="white" stroke="#666666" points="167.38,-91.38 52.38,-91.38 52.38,-72.12 167.38,-72.12 167.38,-91.38"/>
-<text text-anchor="middle" x="109.88" y="-77.88" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
+<polygon fill="white" stroke="#666666" points="120.62,-91.38 5.62,-91.38 5.62,-72.12 120.62,-72.12 120.62,-91.38"/>
+<text text-anchor="middle" x="63.12" y="-77.88" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
 </a>
 </g>
 </g>
@@ -41,18 +41,18 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M126.34,-64.02C140.03,-50.11 158.99,-30.84 169.99,-19.66"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="124.19,-61.21 119.68,-70.79 129.18,-66.12 124.19,-61.21"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M79.59,-64.02C93.28,-50.11 112.24,-30.84 123.24,-19.66"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="77.44,-61.21 72.93,-70.79 82.43,-66.12 77.44,-61.21"/>
 </a>
 </g>
-<text text-anchor="middle" x="160.83" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> set</text>
+<text text-anchor="middle" x="114.08" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> set</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="205,-163.5 78.75,-163.5 78.75,-144.25 205,-144.25 205,-163.5"/>
-<text text-anchor="middle" x="141.88" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::size_t &gt;</text>
+<g id="a_Node000003"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="126.25,-163.5 0,-163.5 0,-144.25 126.25,-144.25 126.25,-163.5"/>
+<text text-anchor="middle" x="63.12" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::size_t &gt;</text>
 </a>
 </g>
 </g>
@@ -60,79 +60,50 @@
 <g id="edge2_Node000002_Node000003" class="edge">
 <title>Node3&#45;&gt;Node2</title>
 <g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M133.14,-133.73C126.91,-120.08 118.81,-102.33 114,-91.78"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="129.86,-134.97 137.19,-142.62 136.23,-132.07 129.86,-134.97"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M63.12,-132.49C63.12,-119.02 63.12,-102.01 63.12,-91.78"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="59.63,-132.48 63.13,-142.48 66.63,-132.48 59.63,-132.48"/>
 </a>
 </g>
-<text text-anchor="middle" x="140.56" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
+<text text-anchor="middle" x="74" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
 </g>
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="61.75,-230 0,-230 0,-210.75 61.75,-210.75 61.75,-230"/>
-<text text-anchor="middle" x="30.88" y="-216.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
+<g id="a_Node000004"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="263.88,-97 138.38,-97 138.38,-66.5 263.88,-66.5 263.88,-97"/>
+<text text-anchor="start" x="146.38" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::function</text>
+<text text-anchor="middle" x="201.12" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; std::size_t(T)&gt; &gt;</text>
 </a>
 </g>
 </g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M23.58,-199.82C18.92,-183.97 15.26,-161.52 24.12,-144.25 37.26,-118.66 66.54,-101.33 87.22,-91.75"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="20.17,-200.65 26.66,-209.02 26.8,-198.43 20.17,-200.65"/>
+<!-- Node4&#45;&gt;Node1 -->
+<g id="edge3_Node000001_Node000004" class="edge">
+<title>Node4&#45;&gt;Node1</title>
+<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M178.78,-58.04C165.81,-44.86 150.21,-29.01 140.74,-19.38"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="176.26,-60.47 185.77,-65.14 181.25,-55.56 176.26,-60.47"/>
 </a>
 </g>
-<text text-anchor="middle" x="47" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> blockSize</text>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M56.09,-204.72C77.65,-192.19 107.99,-174.56 126.21,-163.98"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="54.51,-201.6 47.62,-209.65 58.02,-207.65 54.51,-201.6"/>
-</a>
-</g>
-<text text-anchor="middle" x="114.4" y="-183.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="194.19" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> hashFunks</text>
 </g>
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="310.62,-97 185.12,-97 185.12,-66.5 310.62,-66.5 310.62,-97"/>
-<text text-anchor="start" x="193.12" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::function</text>
-<text text-anchor="middle" x="247.88" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; std::size_t(T)&gt; &gt;</text>
+<g id="a_Node000005"><a xlink:title=" ">
+<polygon fill="white" stroke="#bfbfbf" points="215.53,-163.5 186.72,-163.5 186.72,-144.25 215.53,-144.25 215.53,-163.5"/>
+<text text-anchor="middle" x="201.12" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
 </a>
 </g>
 </g>
-<!-- Node5&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node5&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M225.53,-58.04C212.56,-44.86 196.96,-29.01 187.49,-19.38"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="223.01,-60.47 232.52,-65.14 228,-55.56 223.01,-60.47"/>
+<!-- Node5&#45;&gt;Node4 -->
+<g id="edge4_Node000004_Node000005" class="edge">
+<title>Node5&#45;&gt;Node4</title>
+<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M201.12,-132.67C201.12,-121.41 201.12,-107.64 201.12,-97.42"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="197.63,-132.48 201.13,-142.48 204.63,-132.48 197.63,-132.48"/>
 </a>
 </g>
-<text text-anchor="middle" x="240.94" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> hashFunks</text>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="262.27,-163.5 233.47,-163.5 233.47,-144.25 262.27,-144.25 262.27,-163.5"/>
-<text text-anchor="middle" x="247.88" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M247.88,-132.67C247.88,-121.41 247.88,-107.64 247.88,-97.42"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="244.38,-132.48 247.88,-142.48 251.38,-132.48 244.38,-132.48"/>
-</a>
-</g>
-<text text-anchor="middle" x="269.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="222.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
 </g>
 </g>
 </svg>
diff --git a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph_org.svg b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph_org.svg
index cdbf816b3..96d3bba4d 100644
--- a/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph_org.svg
+++ b/d8/d41/classdata__structures_1_1_bloom_filter__coll__graph_org.svg
@@ -4,16 +4,16 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: data_structures::BloomFilter&lt; T &gt; Pages: 1 -->
-<svg width="319pt" height="238pt"
- viewBox="0.00 0.00 318.62 238.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 234)">
+<svg width="272pt" height="172pt"
+ viewBox="0.00 0.00 271.88 171.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 167.5)">
 <title>data_structures::BloomFilter&lt; T &gt;</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="Bloom filter template class.">
-<polygon fill="#999999" stroke="#666666" points="260.38,-19.25 97.38,-19.25 97.38,0 260.38,0 260.38,-19.25"/>
-<text text-anchor="middle" x="178.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::BloomFilter&lt; T &gt;</text>
+<polygon fill="#999999" stroke="#666666" points="213.62,-19.25 50.62,-19.25 50.62,0 213.62,0 213.62,-19.25"/>
+<text text-anchor="middle" x="132.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::BloomFilter&lt; T &gt;</text>
 </a>
 </g>
 </g>
@@ -21,8 +21,8 @@
 <g id="Node000002" class="node">
 <title>Node2</title>
 <g id="a_Node000002"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html" target="_top" xlink:title="Simple bitset implementation for bloom filter.">
-<polygon fill="white" stroke="#666666" points="167.38,-91.38 52.38,-91.38 52.38,-72.12 167.38,-72.12 167.38,-91.38"/>
-<text text-anchor="middle" x="109.88" y="-77.88" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
+<polygon fill="white" stroke="#666666" points="120.62,-91.38 5.62,-91.38 5.62,-72.12 120.62,-72.12 120.62,-91.38"/>
+<text text-anchor="middle" x="63.12" y="-77.88" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
 </a>
 </g>
 </g>
@@ -30,18 +30,18 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M126.34,-64.02C140.03,-50.11 158.99,-30.84 169.99,-19.66"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="124.19,-61.21 119.68,-70.79 129.18,-66.12 124.19,-61.21"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M79.59,-64.02C93.28,-50.11 112.24,-30.84 123.24,-19.66"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="77.44,-61.21 72.93,-70.79 82.43,-66.12 77.44,-61.21"/>
 </a>
 </g>
-<text text-anchor="middle" x="160.83" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> set</text>
+<text text-anchor="middle" x="114.08" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> set</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="205,-163.5 78.75,-163.5 78.75,-144.25 205,-144.25 205,-163.5"/>
-<text text-anchor="middle" x="141.88" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::size_t &gt;</text>
+<g id="a_Node000003"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="126.25,-163.5 0,-163.5 0,-144.25 126.25,-144.25 126.25,-163.5"/>
+<text text-anchor="middle" x="63.12" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::size_t &gt;</text>
 </a>
 </g>
 </g>
@@ -49,79 +49,50 @@
 <g id="edge2_Node000002_Node000003" class="edge">
 <title>Node3&#45;&gt;Node2</title>
 <g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M133.14,-133.73C126.91,-120.08 118.81,-102.33 114,-91.78"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="129.86,-134.97 137.19,-142.62 136.23,-132.07 129.86,-134.97"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M63.12,-132.49C63.12,-119.02 63.12,-102.01 63.12,-91.78"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="59.63,-132.48 63.13,-142.48 66.63,-132.48 59.63,-132.48"/>
 </a>
 </g>
-<text text-anchor="middle" x="140.56" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
+<text text-anchor="middle" x="74" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
 </g>
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="61.75,-230 0,-230 0,-210.75 61.75,-210.75 61.75,-230"/>
-<text text-anchor="middle" x="30.88" y="-216.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
+<g id="a_Node000004"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="263.88,-97 138.38,-97 138.38,-66.5 263.88,-66.5 263.88,-97"/>
+<text text-anchor="start" x="146.38" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::function</text>
+<text text-anchor="middle" x="201.12" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; std::size_t(T)&gt; &gt;</text>
 </a>
 </g>
 </g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M23.58,-199.82C18.92,-183.97 15.26,-161.52 24.12,-144.25 37.26,-118.66 66.54,-101.33 87.22,-91.75"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="20.17,-200.65 26.66,-209.02 26.8,-198.43 20.17,-200.65"/>
+<!-- Node4&#45;&gt;Node1 -->
+<g id="edge3_Node000001_Node000004" class="edge">
+<title>Node4&#45;&gt;Node1</title>
+<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M178.78,-58.04C165.81,-44.86 150.21,-29.01 140.74,-19.38"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="176.26,-60.47 185.77,-65.14 181.25,-55.56 176.26,-60.47"/>
 </a>
 </g>
-<text text-anchor="middle" x="47" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> blockSize</text>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M56.09,-204.72C77.65,-192.19 107.99,-174.56 126.21,-163.98"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="54.51,-201.6 47.62,-209.65 58.02,-207.65 54.51,-201.6"/>
-</a>
-</g>
-<text text-anchor="middle" x="114.4" y="-183.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="194.19" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> hashFunks</text>
 </g>
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="310.62,-97 185.12,-97 185.12,-66.5 310.62,-66.5 310.62,-97"/>
-<text text-anchor="start" x="193.12" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::function</text>
-<text text-anchor="middle" x="247.88" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; std::size_t(T)&gt; &gt;</text>
+<g id="a_Node000005"><a xlink:title=" ">
+<polygon fill="white" stroke="#bfbfbf" points="215.53,-163.5 186.72,-163.5 186.72,-144.25 215.53,-144.25 215.53,-163.5"/>
+<text text-anchor="middle" x="201.12" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
 </a>
 </g>
 </g>
-<!-- Node5&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node5&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M225.53,-58.04C212.56,-44.86 196.96,-29.01 187.49,-19.38"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="223.01,-60.47 232.52,-65.14 228,-55.56 223.01,-60.47"/>
+<!-- Node5&#45;&gt;Node4 -->
+<g id="edge4_Node000004_Node000005" class="edge">
+<title>Node5&#45;&gt;Node4</title>
+<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M201.12,-132.67C201.12,-121.41 201.12,-107.64 201.12,-97.42"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="197.63,-132.48 201.13,-142.48 204.63,-132.48 197.63,-132.48"/>
 </a>
 </g>
-<text text-anchor="middle" x="240.94" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> hashFunks</text>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="262.27,-163.5 233.47,-163.5 233.47,-144.25 262.27,-144.25 262.27,-163.5"/>
-<text text-anchor="middle" x="247.88" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M247.88,-132.67C247.88,-121.41 247.88,-107.64 247.88,-97.42"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="244.38,-132.48 247.88,-142.48 251.38,-132.48 244.38,-132.48"/>
-</a>
-</g>
-<text text-anchor="middle" x="269.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="222.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
 </g>
 </g>
 </svg>
diff --git a/d8/d41/namespacegames_1_1memory__game.html b/d8/d41/namespacegames_1_1memory__game.html
index 875cb7dd5..b6bb352db 100644
--- a/d8/d41/namespacegames_1_1memory__game.html
+++ b/d8/d41/namespacegames_1_1memory__game.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: games::memory_game Namespace Reference</title>
+<title>TheAlgorithms/C++: games::memory_game Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,27 +137,27 @@ Functions</h2></td></tr>
 <tr class="memdesc:a33167bb9cce6d527b478b4f6ae8c3f59"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to verify if the given input is a number or not. This is very useful to prevent the program being stuck in a loop.  <br /></td></tr>
 <tr class="separator:a33167bb9cce6d527b478b4f6ae8c3f59"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ad573c8ae66ab66156d03e5e81bbba214" id="r_ad573c8ae66ab66156d03e5e81bbba214"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ad573c8ae66ab66156d03e5e81bbba214"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ad573c8ae66ab66156d03e5e81bbba214">init</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *table)</td></tr>
+<tr class="memitem:ad573c8ae66ab66156d03e5e81bbba214"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ad573c8ae66ab66156d03e5e81bbba214">init</a> (std::vector&lt; T &gt; *table)</td></tr>
 <tr class="memdesc:ad573c8ae66ab66156d03e5e81bbba214"><td class="mdescLeft">&#160;</td><td class="mdescRight">Initializes the table with the letters.  <br /></td></tr>
 <tr class="separator:ad573c8ae66ab66156d03e5e81bbba214"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ac589ef65abb0a6b9a7116ee0f9fd5280" id="r_ac589ef65abb0a6b9a7116ee0f9fd5280"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ac589ef65abb0a6b9a7116ee0f9fd5280"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac589ef65abb0a6b9a7116ee0f9fd5280">print_table</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;table)</td></tr>
+<tr class="memitem:ac589ef65abb0a6b9a7116ee0f9fd5280"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac589ef65abb0a6b9a7116ee0f9fd5280">print_table</a> (const std::vector&lt; T &gt; &amp;table)</td></tr>
 <tr class="memdesc:ac589ef65abb0a6b9a7116ee0f9fd5280"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to print the table.  <br /></td></tr>
 <tr class="separator:ac589ef65abb0a6b9a7116ee0f9fd5280"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:adc62ebb75853446656e24932bdc6dd6b" id="r_adc62ebb75853446656e24932bdc6dd6b"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:adc62ebb75853446656e24932bdc6dd6b"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#adc62ebb75853446656e24932bdc6dd6b">reset_data</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;table, int *answer, int *old_answer, int *memory_count)</td></tr>
+<tr class="memitem:adc62ebb75853446656e24932bdc6dd6b"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#adc62ebb75853446656e24932bdc6dd6b">reset_data</a> (const std::vector&lt; T &gt; &amp;table, int *answer, int *old_answer, int *memory_count)</td></tr>
 <tr class="memdesc:adc62ebb75853446656e24932bdc6dd6b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function that resets the data if the user enters an invalid value.  <br /></td></tr>
 <tr class="separator:adc62ebb75853446656e24932bdc6dd6b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a5714d97649c0edd57b4fb449799676a3" id="r_a5714d97649c0edd57b4fb449799676a3"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a5714d97649c0edd57b4fb449799676a3"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5714d97649c0edd57b4fb449799676a3">ask_data</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;table, int *answer, int *old_answer, int *memory_count)</td></tr>
+<tr class="memitem:a5714d97649c0edd57b4fb449799676a3"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5714d97649c0edd57b4fb449799676a3">ask_data</a> (const std::vector&lt; T &gt; &amp;table, int *answer, int *old_answer, int *memory_count)</td></tr>
 <tr class="memdesc:a5714d97649c0edd57b4fb449799676a3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that asks the user for their input in the table they previously chose.  <br /></td></tr>
 <tr class="separator:a5714d97649c0edd57b4fb449799676a3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a370760f2b328ad341bcb77d82fa17b01" id="r_a370760f2b328ad341bcb77d82fa17b01"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a370760f2b328ad341bcb77d82fa17b01"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a370760f2b328ad341bcb77d82fa17b01">match</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;table, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *table_empty, const int &amp;answer, bool *first_time, int *old_answer, int *memory_count)</td></tr>
+<tr class="memitem:a370760f2b328ad341bcb77d82fa17b01"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a370760f2b328ad341bcb77d82fa17b01">match</a> (const std::vector&lt; T &gt; &amp;table, std::vector&lt; T &gt; *table_empty, const int &amp;answer, bool *first_time, int *old_answer, int *memory_count)</td></tr>
 <tr class="memdesc:a370760f2b328ad341bcb77d82fa17b01"><td class="mdescLeft">&#160;</td><td class="mdescRight">Checks if the two values given by the user match.  <br /></td></tr>
 <tr class="separator:a370760f2b328ad341bcb77d82fa17b01"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a3ceeea62d8fa6c563e2c66359fd73413" id="r_a3ceeea62d8fa6c563e2c66359fd73413"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a3ceeea62d8fa6c563e2c66359fd73413"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a3ceeea62d8fa6c563e2c66359fd73413">assign_results</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *table_empty, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *table, int *answer, bool *first_time, int *old_answer, int *memory_count)</td></tr>
+<tr class="memitem:a3ceeea62d8fa6c563e2c66359fd73413"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a3ceeea62d8fa6c563e2c66359fd73413">assign_results</a> (std::vector&lt; T &gt; *table_empty, std::vector&lt; T &gt; *table, int *answer, bool *first_time, int *old_answer, int *memory_count)</td></tr>
 <tr class="memdesc:a3ceeea62d8fa6c563e2c66359fd73413"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to assign the results to the table.  <br /></td></tr>
 <tr class="separator:a3ceeea62d8fa6c563e2c66359fd73413"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
@@ -158,7 +175,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void games::memory_game::ask_data </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>table</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>table</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -195,15 +212,17 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d92/memory__game_8cpp_source.html#l00161">161</a> of file <a class="el" href="../../dd/d92/memory__game_8cpp_source.html">memory_game.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  162</span>                                 {</div>
 <div class="line"><span class="lineno">  163</span>    (*old_answer) = (*answer);</div>
 <div class="line"><span class="lineno">  164</span>    <a class="code hl_function" href="#ac589ef65abb0a6b9a7116ee0f9fd5280">print_table</a>(table);</div>
 <div class="line"><span class="lineno">  165</span> </div>
-<div class="line"><span class="lineno">  166</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n\nType your response here (number index):\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  167</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; (*answer);</div>
+<div class="line"><span class="lineno">  166</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n\nType your response here (number index):\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  167</span>    std::cin &gt;&gt; (*answer);</div>
 <div class="line"><span class="lineno">  168</span> </div>
 <div class="line"><span class="lineno">  169</span>    <span class="keywordflow">if</span> (!<a class="code hl_function" href="#a33167bb9cce6d527b478b4f6ae8c3f59">is_number</a>((*answer))) {</div>
-<div class="line"><span class="lineno">  170</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nYou must enter a valid number.\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  170</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nYou must enter a valid number.\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  171</span>        <a class="code hl_function" href="#adc62ebb75853446656e24932bdc6dd6b">reset_data</a>(table, answer, old_answer, memory_count);</div>
 <div class="line"><span class="lineno">  172</span>    }</div>
 <div class="line"><span class="lineno">  173</span> </div>
@@ -212,13 +231,13 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  176</span>    (*memory_count)++;</div>
 <div class="line"><span class="lineno">  177</span> </div>
 <div class="line"><span class="lineno">  178</span>    <span class="keywordflow">if</span> (((*answer) &gt; table.size()) || ((*answer) &lt; 1)) {</div>
-<div class="line"><span class="lineno">  179</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nYou can&#39;t check a value that doesn&#39;t exist (or an &quot;</span></div>
+<div class="line"><span class="lineno">  179</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nYou can&#39;t check a value that doesn&#39;t exist (or an &quot;</span></div>
 <div class="line"><span class="lineno">  180</span>                     <span class="stringliteral">&quot;invalid number).\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  181</span>        reset_data(table, answer, old_answer, memory_count);</div>
 <div class="line"><span class="lineno">  182</span>    }</div>
 <div class="line"><span class="lineno">  183</span> </div>
 <div class="line"><span class="lineno">  184</span>    <span class="keywordflow">if</span> ((*old_answer) == (*answer)) {</div>
-<div class="line"><span class="lineno">  185</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nYou can&#39;t check the same value twice.\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  185</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nYou can&#39;t check the same value twice.\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  186</span>        reset_data(table, answer, old_answer, memory_count);</div>
 <div class="line"><span class="lineno">  187</span>    }</div>
 <div class="line"><span class="lineno">  188</span> </div>
@@ -227,21 +246,14 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  191</span>    <span class="comment">// must not allow the user to check the same value twice.</span></div>
 <div class="line"><span class="lineno">  192</span>    <span class="keywordflow">if</span> ((table[(*answer) - 1] != 0) &amp;&amp;</div>
 <div class="line"><span class="lineno">  193</span>        ((table[(*old_answer)] == 0) || (table[(*old_answer)] != 0))) {</div>
-<div class="line"><span class="lineno">  194</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nYou can&#39;t check the same value twice.\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  194</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nYou can&#39;t check the same value twice.\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  195</span>        <a class="code hl_function" href="#adc62ebb75853446656e24932bdc6dd6b">reset_data</a>(table, answer, old_answer, memory_count);</div>
 <div class="line"><span class="lineno">  196</span>    }</div>
 <div class="line"><span class="lineno">  197</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="anamespacegames_1_1memory__game_html_a33167bb9cce6d527b478b4f6ae8c3f59"><div class="ttname"><a href="#a33167bb9cce6d527b478b4f6ae8c3f59">games::memory_game::is_number</a></div><div class="ttdeci">bool is_number(const T &amp;input)</div><div class="ttdoc">Utility function to verify if the given input is a number or not. This is very useful to prevent the ...</div><div class="ttdef"><b>Definition</b> memory_game.cpp:62</div></div>
-<div class="ttc" id="anamespacegames_1_1memory__game_html_ac589ef65abb0a6b9a7116ee0f9fd5280"><div class="ttname"><a href="#ac589ef65abb0a6b9a7116ee0f9fd5280">games::memory_game::print_table</a></div><div class="ttdeci">void print_table(const std::vector&lt; T &gt; &amp;table)</div><div class="ttdoc">Utility function to print the table.</div><div class="ttdef"><b>Definition</b> memory_game.cpp:123</div></div>
-<div class="ttc" id="anamespacegames_1_1memory__game_html_adc62ebb75853446656e24932bdc6dd6b"><div class="ttname"><a href="#adc62ebb75853446656e24932bdc6dd6b">games::memory_game::reset_data</a></div><div class="ttdeci">void reset_data(const std::vector&lt; T &gt; &amp;, int *, int *, int *)</div><div class="ttdoc">Utility function that resets the data if the user enters an invalid value.</div><div class="ttdef"><b>Definition</b> memory_game.cpp:211</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d41/namespacegames_1_1memory__game_a5714d97649c0edd57b4fb449799676a3_cgraph.svg" width="368" height="183"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacegames_1_1memory__game_html_a33167bb9cce6d527b478b4f6ae8c3f59"><div class="ttname"><a href="#a33167bb9cce6d527b478b4f6ae8c3f59">games::memory_game::is_number</a></div><div class="ttdeci">bool is_number(const T &amp;input)</div><div class="ttdoc">Utility function to verify if the given input is a number or not. This is very useful to prevent the ...</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d92/memory__game_8cpp_source.html#l00062">memory_game.cpp:62</a></div></div>
+<div class="ttc" id="anamespacegames_1_1memory__game_html_ac589ef65abb0a6b9a7116ee0f9fd5280"><div class="ttname"><a href="#ac589ef65abb0a6b9a7116ee0f9fd5280">games::memory_game::print_table</a></div><div class="ttdeci">void print_table(const std::vector&lt; T &gt; &amp;table)</div><div class="ttdoc">Utility function to print the table.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d92/memory__game_8cpp_source.html#l00123">memory_game.cpp:123</a></div></div>
+<div class="ttc" id="anamespacegames_1_1memory__game_html_adc62ebb75853446656e24932bdc6dd6b"><div class="ttname"><a href="#adc62ebb75853446656e24932bdc6dd6b">games::memory_game::reset_data</a></div><div class="ttdeci">void reset_data(const std::vector&lt; T &gt; &amp;, int *, int *, int *)</div><div class="ttdoc">Utility function that resets the data if the user enters an invalid value.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d92/memory__game_8cpp_source.html#l00211">memory_game.cpp:211</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a3ceeea62d8fa6c563e2c66359fd73413" name="a3ceeea62d8fa6c563e2c66359fd73413"></a>
@@ -255,12 +267,12 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void games::memory_game::assign_results </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>table_empty</em></span>, </td>
+          <td class="paramtype">std::vector&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>table_empty</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>table</em></span>, </td>
+          <td class="paramtype">std::vector&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>table</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -304,6 +316,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d92/memory__game_8cpp_source.html#l00289">289</a> of file <a class="el" href="../../dd/d92/memory__game_8cpp_source.html">memory_game.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  291</span>                                       {</div>
 <div class="line"><span class="lineno">  292</span>    <span class="comment">// Search through the entire table and if the answer matches the index, show</span></div>
 <div class="line"><span class="lineno">  293</span>    <span class="comment">// the value. If it doesn&#39;t match, hide both the values. Don&#39;t forget to</span></div>
@@ -333,12 +347,12 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  317</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (i == (*table).size() - 1) {</div>
 <div class="line"><span class="lineno">  318</span>            <a class="code hl_function" href="#ac589ef65abb0a6b9a7116ee0f9fd5280">print_table</a>((*table));</div>
 <div class="line"><span class="lineno">  319</span> </div>
-<div class="line"><span class="lineno">  320</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n\nYou won. Congratulations! Do you want to play &quot;</span></div>
+<div class="line"><span class="lineno">  320</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\n\nYou won. Congratulations! Do you want to play &quot;</span></div>
 <div class="line"><span class="lineno">  321</span>                         <span class="stringliteral">&quot;again? (y/n)\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  322</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div>
+<div class="line"><span class="lineno">  322</span>            std::cout</div>
 <div class="line"><span class="lineno">  323</span>                &lt;&lt; <span class="stringliteral">&quot;Size &quot;</span> &lt;&lt; (*table).size()</div>
 <div class="line"><span class="lineno">  324</span>                &lt;&lt; <span class="stringliteral">&quot; will be used. This can be changed by re-running the game.&quot;</span>;</div>
-<div class="line"><span class="lineno">  325</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; try_again;</div>
+<div class="line"><span class="lineno">  325</span>            std::cin &gt;&gt; try_again;</div>
 <div class="line"><span class="lineno">  326</span>            <span class="keywordflow">if</span> (try_again == <span class="charliteral">&#39;y&#39;</span>) {</div>
 <div class="line"><span class="lineno">  327</span>                <span class="comment">// This is needed when checking if the user has two matches</span></div>
 <div class="line"><span class="lineno">  328</span>                <span class="comment">// already.</span></div>
@@ -348,15 +362,15 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  332</span> </div>
 <div class="line"><span class="lineno">  333</span>                <a class="code hl_function" href="#ad573c8ae66ab66156d03e5e81bbba214">init</a>(table);</div>
 <div class="line"><span class="lineno">  334</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (try_again == <span class="charliteral">&#39;n&#39;</span>) {</div>
-<div class="line"><span class="lineno">  335</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nThanks for playing the game!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  335</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\nThanks for playing the game!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  336</span>                <a class="code hl_function" href="../../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6">SLEEP</a>(3);</div>
 <div class="line"><span class="lineno">  337</span> </div>
-<div class="line"><span class="lineno">  338</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">exit</a>(0);</div>
+<div class="line"><span class="lineno">  338</span>                exit(0);</div>
 <div class="line"><span class="lineno">  339</span>            } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  340</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nInvalid input (exitting...).\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  340</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\nInvalid input (exitting...).\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  341</span>                <a class="code hl_function" href="../../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6">SLEEP</a>(3);</div>
 <div class="line"><span class="lineno">  342</span> </div>
-<div class="line"><span class="lineno">  343</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">exit</a>(0);</div>
+<div class="line"><span class="lineno">  343</span>                exit(0);</div>
 <div class="line"><span class="lineno">  344</span>            }</div>
 <div class="line"><span class="lineno">  345</span>        }</div>
 <div class="line"><span class="lineno">  346</span>    }</div>
@@ -366,18 +380,12 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  350</span>    <a class="code hl_function" href="#a3ceeea62d8fa6c563e2c66359fd73413">assign_results</a>(table_empty, table, answer, first_time, old_answer,</div>
 <div class="line"><span class="lineno">  351</span>                   memory_count);</div>
 <div class="line"><span class="lineno">  352</span>}</div>
-<div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
-<div class="ttc" id="amemory__game_8cpp_html_a5bdc30951221eae9c33413ff9eb574f6"><div class="ttname"><a href="../../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6">SLEEP</a></div><div class="ttdeci">constexpr T SLEEP(T seconds)</div><div class="ttdoc">for sleep()</div><div class="ttdef"><b>Definition</b> memory_game.cpp:36</div></div>
-<div class="ttc" id="anamespacegames_1_1memory__game_html_a370760f2b328ad341bcb77d82fa17b01"><div class="ttname"><a href="#a370760f2b328ad341bcb77d82fa17b01">games::memory_game::match</a></div><div class="ttdeci">bool match(const std::vector&lt; T &gt; &amp;table, std::vector&lt; T &gt; *table_empty, const int &amp;answer, bool *first_time, int *old_answer, int *memory_count)</div><div class="ttdoc">Checks if the two values given by the user match.</div><div class="ttdef"><b>Definition</b> memory_game.cpp:235</div></div>
-<div class="ttc" id="anamespacegames_1_1memory__game_html_a3ceeea62d8fa6c563e2c66359fd73413"><div class="ttname"><a href="#a3ceeea62d8fa6c563e2c66359fd73413">games::memory_game::assign_results</a></div><div class="ttdeci">void assign_results(std::vector&lt; T &gt; *table_empty, std::vector&lt; T &gt; *table, int *answer, bool *first_time, int *old_answer, int *memory_count)</div><div class="ttdoc">Function to assign the results to the table.</div><div class="ttdef"><b>Definition</b> memory_game.cpp:289</div></div>
-<div class="ttc" id="anamespacegames_1_1memory__game_html_a5714d97649c0edd57b4fb449799676a3"><div class="ttname"><a href="#a5714d97649c0edd57b4fb449799676a3">games::memory_game::ask_data</a></div><div class="ttdeci">void ask_data(const std::vector&lt; T &gt; &amp;table, int *answer, int *old_answer, int *memory_count)</div><div class="ttdoc">Function that asks the user for their input in the table they previously chose.</div><div class="ttdef"><b>Definition</b> memory_game.cpp:161</div></div>
-<div class="ttc" id="anamespacegames_1_1memory__game_html_ad573c8ae66ab66156d03e5e81bbba214"><div class="ttname"><a href="#ad573c8ae66ab66156d03e5e81bbba214">games::memory_game::init</a></div><div class="ttdeci">void init(std::vector&lt; T &gt; *table)</div><div class="ttdoc">Initializes the table with the letters.</div><div class="ttdef"><b>Definition</b> memory_game.cpp:80</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d41/namespacegames_1_1memory__game_a3ceeea62d8fa6c563e2c66359fd73413_cgraph.svg" width="570" height="430"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amemory__game_8cpp_html_a5bdc30951221eae9c33413ff9eb574f6"><div class="ttname"><a href="../../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6">SLEEP</a></div><div class="ttdeci">constexpr T SLEEP(T seconds)</div><div class="ttdoc">for sleep()</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d92/memory__game_8cpp_source.html#l00036">memory_game.cpp:36</a></div></div>
+<div class="ttc" id="anamespacegames_1_1memory__game_html_a370760f2b328ad341bcb77d82fa17b01"><div class="ttname"><a href="#a370760f2b328ad341bcb77d82fa17b01">games::memory_game::match</a></div><div class="ttdeci">bool match(const std::vector&lt; T &gt; &amp;table, std::vector&lt; T &gt; *table_empty, const int &amp;answer, bool *first_time, int *old_answer, int *memory_count)</div><div class="ttdoc">Checks if the two values given by the user match.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d92/memory__game_8cpp_source.html#l00235">memory_game.cpp:235</a></div></div>
+<div class="ttc" id="anamespacegames_1_1memory__game_html_a3ceeea62d8fa6c563e2c66359fd73413"><div class="ttname"><a href="#a3ceeea62d8fa6c563e2c66359fd73413">games::memory_game::assign_results</a></div><div class="ttdeci">void assign_results(std::vector&lt; T &gt; *table_empty, std::vector&lt; T &gt; *table, int *answer, bool *first_time, int *old_answer, int *memory_count)</div><div class="ttdoc">Function to assign the results to the table.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d92/memory__game_8cpp_source.html#l00289">memory_game.cpp:289</a></div></div>
+<div class="ttc" id="anamespacegames_1_1memory__game_html_a5714d97649c0edd57b4fb449799676a3"><div class="ttname"><a href="#a5714d97649c0edd57b4fb449799676a3">games::memory_game::ask_data</a></div><div class="ttdeci">void ask_data(const std::vector&lt; T &gt; &amp;table, int *answer, int *old_answer, int *memory_count)</div><div class="ttdoc">Function that asks the user for their input in the table they previously chose.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d92/memory__game_8cpp_source.html#l00161">memory_game.cpp:161</a></div></div>
+<div class="ttc" id="anamespacegames_1_1memory__game_html_ad573c8ae66ab66156d03e5e81bbba214"><div class="ttname"><a href="#ad573c8ae66ab66156d03e5e81bbba214">games::memory_game::init</a></div><div class="ttdeci">void init(std::vector&lt; T &gt; *table)</div><div class="ttdoc">Initializes the table with the letters.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d92/memory__game_8cpp_source.html#l00080">memory_game.cpp:80</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad573c8ae66ab66156d03e5e81bbba214" name="ad573c8ae66ab66156d03e5e81bbba214"></a>
@@ -391,7 +399,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void games::memory_game::init </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>table</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>table</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -411,8 +419,10 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d92/memory__game_8cpp_source.html#l00080">80</a> of file <a class="el" href="../../dd/d92/memory__game_8cpp_source.html">memory_game.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   80</span>                               {</div>
-<div class="line"><span class="lineno">   81</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;char&gt;</a> letters(7);</div>
+<div class="line"><span class="lineno">   81</span>    std::vector&lt;char&gt; letters(7);</div>
 <div class="line"><span class="lineno">   82</span> </div>
 <div class="line"><span class="lineno">   83</span>    <span class="comment">// Decrease / increase the number of letters depending on the size.</span></div>
 <div class="line"><span class="lineno">   84</span>    <span class="keywordflow">if</span> ((*table).size() == 10) {  <span class="comment">// 5x2</span></div>
@@ -423,42 +433,30 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   89</span>        letters = {<span class="charliteral">&#39;A&#39;</span>, <span class="charliteral">&#39;E&#39;</span>, <span class="charliteral">&#39;Z&#39;</span>, <span class="charliteral">&#39;P&#39;</span>, <span class="charliteral">&#39;D&#39;</span>, <span class="charliteral">&#39;B&#39;</span>, <span class="charliteral">&#39;M&#39;</span>};</div>
 <div class="line"><span class="lineno">   90</span>    }</div>
 <div class="line"><span class="lineno">   91</span> </div>
-<div class="line"><span class="lineno">   92</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;char&gt;</a> pairs;</div>
+<div class="line"><span class="lineno">   92</span>    std::vector&lt;char&gt; pairs;</div>
 <div class="line"><span class="lineno">   93</span>    <span class="keywordflow">for</span> (<span class="keywordtype">char</span> letter : letters) {</div>
-<div class="line"><span class="lineno">   94</span>        pairs.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(letter);</div>
-<div class="line"><span class="lineno">   95</span>        pairs.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(letter);</div>
+<div class="line"><span class="lineno">   94</span>        pairs.push_back(letter);</div>
+<div class="line"><span class="lineno">   95</span>        pairs.push_back(letter);</div>
 <div class="line"><span class="lineno">   96</span>    }</div>
 <div class="line"><span class="lineno">   97</span> </div>
-<div class="line"><span class="lineno">   98</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html">std::shuffle</a>(pairs.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), pairs.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>(),</div>
-<div class="line"><span class="lineno">   99</span>                 <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html">std::mt19937</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/random_device.html">std::random_device</a>()()));</div>
+<div class="line"><span class="lineno">   98</span>    std::shuffle(pairs.begin(), pairs.end(),</div>
+<div class="line"><span class="lineno">   99</span>                 std::mt19937(std::random_device()()));</div>
 <div class="line"><span class="lineno">  100</span> </div>
 <div class="line"><span class="lineno">  101</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; (*table).size(); i++) {</div>
 <div class="line"><span class="lineno">  102</span>        (*table)[i] = pairs[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>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All available types are: &quot;</span>;</div>
+<div class="line"><span class="lineno">  105</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All available types are: &quot;</span>;</div>
 <div class="line"><span class="lineno">  106</span> </div>
 <div class="line"><span class="lineno">  107</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; letters.size(); i++) {</div>
 <div class="line"><span class="lineno">  108</span>        <span class="keywordflow">if</span> (i == letters.size() - 1) {</div>
-<div class="line"><span class="lineno">  109</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;and &quot;</span> &lt;&lt; letters[i] &lt;&lt; <span class="stringliteral">&quot;.\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  109</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;and &quot;</span> &lt;&lt; letters[i] &lt;&lt; <span class="stringliteral">&quot;.\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  110</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  111</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; letters[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><span class="lineno">  111</span>            std::cout &lt;&lt; letters[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
 <div class="line"><span class="lineno">  112</span>        }</div>
 <div class="line"><span class="lineno">  113</span>    }</div>
 <div class="line"><span class="lineno">  114</span>}</div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="amersenne_twister_engine_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html">std::mt19937</a></div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="arandom_device_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/random_device.html">std::random_device</a></div></div>
-<div class="ttc" id="arandom_shuffle_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html">std::shuffle</a></div><div class="ttdeci">T shuffle(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d41/namespacegames_1_1memory__game_ad573c8ae66ab66156d03e5e81bbba214_cgraph.svg" width="368" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a33167bb9cce6d527b478b4f6ae8c3f59" name="a33167bb9cce6d527b478b4f6ae8c3f59"></a>
@@ -494,10 +492,12 @@ template&lt;typename T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>false if the input IS empty or if it contains a non-digit character </dd>
 <dd>
 true if the input is NOT empty and if it contains only digit characters </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d92/memory__game_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../dd/d92/memory__game_8cpp_source.html">memory_game.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>                               {</div>
-<div class="line"><span class="lineno">   63</span>    <span class="keywordflow">if</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a>.fail()) {</div>
-<div class="line"><span class="lineno">   64</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a>.clear();</div>
-<div class="line"><span class="lineno">   65</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a>.ignore(256, <span class="charliteral">&#39;\n&#39;</span>);</div>
+<div class="line"><span class="lineno">   63</span>    <span class="keywordflow">if</span> (std::cin.fail()) {</div>
+<div class="line"><span class="lineno">   64</span>        std::cin.clear();</div>
+<div class="line"><span class="lineno">   65</span>        std::cin.ignore(256, <span class="charliteral">&#39;\n&#39;</span>);</div>
 <div class="line"><span class="lineno">   66</span> </div>
 <div class="line"><span class="lineno">   67</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   68</span>    }</div>
@@ -518,12 +518,12 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">bool games::memory_game::match </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>table</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>table</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>table_empty</em></span>, </td>
+          <td class="paramtype">std::vector&lt; T &gt; *</td>          <td class="paramname"><span class="paramname"><em>table_empty</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -569,6 +569,8 @@ template&lt;typename T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>true IF the values given by the user match </dd>
 <dd>
 false if the values given by the user do NOT match </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d92/memory__game_8cpp_source.html#l00235">235</a> of file <a class="el" href="../../dd/d92/memory__game_8cpp_source.html">memory_game.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  237</span>                              {</div>
 <div class="line"><span class="lineno">  238</span>    <span class="keywordflow">if</span> ((*first_time) == <span class="keyword">true</span>) {</div>
 <div class="line"><span class="lineno">  239</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
@@ -585,7 +587,7 @@ false if the values given by the user do NOT match </dd></dl>
 <div class="line"><span class="lineno">  250</span>                (*old_answer) = 0;</div>
 <div class="line"><span class="lineno">  251</span>                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  252</span>            } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  253</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nNo match (value was &quot;</span> &lt;&lt; table[i - 1]</div>
+<div class="line"><span class="lineno">  253</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\nNo match (value was &quot;</span> &lt;&lt; table[i - 1]</div>
 <div class="line"><span class="lineno">  254</span>                          &lt;&lt; <span class="stringliteral">&quot;, index is &quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;).\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  255</span> </div>
 <div class="line"><span class="lineno">  256</span>                (*table_empty)[(*old_answer) - 1] = 0;</div>
@@ -616,7 +618,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void games::memory_game::print_table </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>table</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>table</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -636,9 +638,11 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d92/memory__game_8cpp_source.html#l00123">123</a> of file <a class="el" href="../../dd/d92/memory__game_8cpp_source.html">memory_game.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  123</span>                                            {</div>
-<div class="line"><span class="lineno">  124</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;| &quot;</span>;</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&lt;T&gt;</a> table_print(table.size());</div>
+<div class="line"><span class="lineno">  124</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;| &quot;</span>;</div>
+<div class="line"><span class="lineno">  125</span>    std::vector&lt;T&gt; table_print(table.size());</div>
 <div class="line"><span class="lineno">  126</span> </div>
 <div class="line"><span class="lineno">  127</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; table.size(); i++) {</div>
 <div class="line"><span class="lineno">  128</span>        table_print[i] = <span class="charliteral">&#39; &#39;</span>;</div>
@@ -650,10 +654,10 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  134</span> </div>
 <div class="line"><span class="lineno">  135</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; table.size(); i++) {</div>
 <div class="line"><span class="lineno">  136</span>        <span class="keywordflow">if</span> (i % 5 == 0 &amp;&amp; i != 0) {</div>
-<div class="line"><span class="lineno">  137</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n| &quot;</span>;</div>
+<div class="line"><span class="lineno">  137</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\n| &quot;</span>;</div>
 <div class="line"><span class="lineno">  138</span>        }</div>
 <div class="line"><span class="lineno">  139</span> </div>
-<div class="line"><span class="lineno">  140</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; table_print[i] &lt;&lt; <span class="stringliteral">&quot; | &quot;</span>;</div>
+<div class="line"><span class="lineno">  140</span>        std::cout &lt;&lt; table_print[i] &lt;&lt; <span class="stringliteral">&quot; | &quot;</span>;</div>
 <div class="line"><span class="lineno">  141</span>    }</div>
 <div class="line"><span class="lineno">  142</span>}</div>
 </div><!-- fragment -->
@@ -670,7 +674,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void games::memory_game::reset_data </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>table</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>table</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -707,18 +711,15 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d92/memory__game_8cpp_source.html#l00211">211</a> of file <a class="el" href="../../dd/d92/memory__game_8cpp_source.html">memory_game.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  212</span>                                   {</div>
 <div class="line"><span class="lineno">  213</span>    (*answer) = (*old_answer);</div>
 <div class="line"><span class="lineno">  214</span>    (*memory_count)--;</div>
 <div class="line"><span class="lineno">  215</span> </div>
 <div class="line"><span class="lineno">  216</span>    <a class="code hl_function" href="#a5714d97649c0edd57b4fb449799676a3">ask_data</a>(table, answer, old_answer, memory_count);</div>
 <div class="line"><span class="lineno">  217</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d41/namespacegames_1_1memory__game_adc62ebb75853446656e24932bdc6dd6b_cgraph.svg" width="570" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d8/d41/namespacegames_1_1memory__game_a3ceeea62d8fa6c563e2c66359fd73413_cgraph.map b/d8/d41/namespacegames_1_1memory__game_a3ceeea62d8fa6c563e2c66359fd73413_cgraph.map
deleted file mode 100644
index 2fe401bd0..000000000
--- a/d8/d41/namespacegames_1_1memory__game_a3ceeea62d8fa6c563e2c66359fd73413_cgraph.map
+++ /dev/null
@@ -1,30 +0,0 @@
-<map id="games::memory_game::assign_results" name="games::memory_game::assign_results">
-<area shape="rect" id="Node000001" title="Function to assign the results to the table." alt="" coords="5,243,160,283"/>
-<area shape="poly" id="edge6_Node000001_Node000001" title=" " alt="" coords="44,243,42,233,48,224,62,218,83,216,105,218,118,225,115,229,103,224,82,221,63,223,52,228,47,234,49,241"/>
-<area shape="rect" id="Node000002" href="$d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3" title="Function that asks the user for their input in the table they previously chose." alt="" coords="208,136,362,177"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="122,240,230,182,232,187,124,245"/>
-<area shape="rect" id="Node000004" href="$d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280" title="Utility function to print the table." alt="" coords="410,5,564,46"/>
-<area shape="poly" id="edge14_Node000001_Node000004" title=" " alt="" coords="95,241,140,182,171,150,206,122,252,96,300,74,394,43,396,48,302,79,254,100,209,127,175,154,144,186,99,244"/>
-<area shape="rect" id="Node000006" href="$d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214" title="Initializes the table with the letters." alt="" coords="208,243,362,283"/>
-<area shape="poly" id="edge7_Node000001_Node000006" title=" " alt="" coords="160,260,192,260,192,266,160,266"/>
-<area shape="rect" id="Node000012" href="$d8/d41/namespacegames_1_1memory__game.html#a370760f2b328ad341bcb77d82fa17b01" title="Checks if the two values given by the user match." alt="" coords="208,308,362,349"/>
-<area shape="poly" id="edge13_Node000001_Node000012" title=" " alt="" coords="148,281,206,300,204,305,147,286"/>
-<area shape="rect" id="Node000013" href="$dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6" title="for sleep()" alt="" coords="253,373,317,398"/>
-<area shape="poly" id="edge15_Node000001_Node000013" title=" " alt="" coords="107,282,152,320,209,358,239,371,237,376,206,363,149,324,104,286"/>
-<area shape="rect" id="Node000003" href="$d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59" title="Utility function to verify if the given input is a number or not. This is very useful to prevent the ..." alt="" coords="410,71,564,111"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="349,133,407,114,408,119,351,138"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="307,133,353,96,409,57,419,51,421,56,411,61,356,100,311,137"/>
-<area shape="rect" id="Node000005" href="$d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b" title="Utility function that resets the data if the user enters an invalid value." alt="" coords="410,136,564,177"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="362,162,395,163,395,168,362,168"/>
-<area shape="poly" id="edge5_Node000005_Node000002" title=" " alt="" coords="410,150,377,150,377,145,410,145"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="426,201,548,226"/>
-<area shape="poly" id="edge8_Node000006_Node000007" title=" " alt="" coords="362,242,417,228,418,233,363,247"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="431,250,543,276"/>
-<area shape="poly" id="edge9_Node000006_Node000008" title=" " alt="" coords="362,260,415,260,415,266,362,266"/>
-<area shape="rect" id="Node000009" 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="410,300,564,325"/>
-<area shape="poly" id="edge10_Node000006_Node000009" title=" " alt="" coords="363,279,418,293,417,298,362,284"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/random_shuffle.html#" title=" " alt="" coords="444,349,530,374"/>
-<area shape="poly" id="edge11_Node000006_Node000010" title=" " alt="" coords="341,282,364,294,387,315,411,335,431,344,429,349,409,340,384,320,360,299,338,286"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="430,398,545,424"/>
-<area shape="poly" id="edge12_Node000006_Node000011" title=" " alt="" coords="347,282,364,294,381,318,388,342,395,364,412,385,418,389,415,394,408,389,390,366,383,343,376,321,360,298,343,286"/>
-</map>
diff --git a/d8/d41/namespacegames_1_1memory__game_a3ceeea62d8fa6c563e2c66359fd73413_cgraph.md5 b/d8/d41/namespacegames_1_1memory__game_a3ceeea62d8fa6c563e2c66359fd73413_cgraph.md5
deleted file mode 100644
index d51b61969..000000000
--- a/d8/d41/namespacegames_1_1memory__game_a3ceeea62d8fa6c563e2c66359fd73413_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-477db5ebb4e3e2ba05b485349a023c27
\ No newline at end of file
diff --git a/d8/d41/namespacegames_1_1memory__game_a3ceeea62d8fa6c563e2c66359fd73413_cgraph.svg b/d8/d41/namespacegames_1_1memory__game_a3ceeea62d8fa6c563e2c66359fd73413_cgraph.svg
deleted file mode 100644
index 01e9c366e..000000000
--- a/d8/d41/namespacegames_1_1memory__game_a3ceeea62d8fa6c563e2c66359fd73413_cgraph.svg
+++ /dev/null
@@ -1,297 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: games::memory_game::assign_results Pages: 1 -->
-<svg width="427pt" height="322pt"
- viewBox="0.00 0.00 427.25 321.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 317.88)">
-<title>games::memory_game::assign_results</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to assign the results to the table.">
-<polygon fill="#999999" stroke="#666666" points="115.75,-135.88 0,-135.88 0,-105.38 115.75,-105.38 115.75,-135.88"/>
-<text text-anchor="start" x="8" y="-122.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="57.88" y="-111.12" font-family="Helvetica,sans-Serif" font-size="10.00">::assign_results</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge6_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge6_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.98,-136.36C25.5,-145.43 34.46,-153.88 57.88,-153.88 70.68,-153.88 79.16,-151.35 83.32,-147.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.77,-148.23 84.57,-137.86 79.83,-147.33 86.77,-148.23"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3" target="_top" xlink:title="Function that asks the user for their input in the table they previously chose.">
-<polygon fill="white" stroke="#666666" points="267.5,-215.88 151.75,-215.88 151.75,-185.38 267.5,-185.38 267.5,-215.88"/>
-<text text-anchor="start" x="159.75" y="-202.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="209.62" y="-191.12" font-family="Helvetica,sans-Serif" font-size="10.00">::ask_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.1,-136.24C111.22,-148.59 143.72,-165.95 169.15,-179.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.41,-182.58 177.88,-184.2 170.71,-176.4 167.41,-182.58"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280" target="_top" xlink:title="Utility function to print the table.">
-<polygon fill="white" stroke="#666666" points="419.25,-313.88 303.5,-313.88 303.5,-283.38 419.25,-283.38 419.25,-313.88"/>
-<text text-anchor="start" x="311.5" y="-300.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="361.38" y="-289.12" font-family="Helvetica,sans-Serif" font-size="10.00">::print_table</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge14_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge14_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.01,-136.26C84.36,-158.79 115.58,-200.33 151.75,-224.62 194.45,-253.3 249.53,-272.22 292.37,-283.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.24,-287.07 301.8,-286.21 293.01,-280.29 291.24,-287.07"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214" target="_top" xlink:title="Initializes the table with the letters.">
-<polygon fill="white" stroke="#666666" points="267.5,-135.88 151.75,-135.88 151.75,-105.38 267.5,-105.38 267.5,-135.88"/>
-<text text-anchor="start" x="159.75" y="-122.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="209.62" y="-111.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.92,-120.62C123.89,-120.62 132.16,-120.62 140.32,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.23,-124.13 150.23,-120.63 140.23,-117.13 140.23,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a370760f2b328ad341bcb77d82fa17b01" target="_top" xlink:title="Checks if the two values given by the user match.">
-<polygon fill="white" stroke="#666666" points="267.5,-86.88 151.75,-86.88 151.75,-56.38 267.5,-56.38 267.5,-86.88"/>
-<text text-anchor="start" x="159.75" y="-73.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="209.62" y="-62.12" font-family="Helvetica,sans-Serif" font-size="10.00">::match</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge13_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge13_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.67,-104.99C120.38,-100.5 135.49,-95.56 149.78,-90.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.66,-94.27 159.08,-87.84 148.48,-87.62 150.66,-94.27"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6" target="_top" xlink:title="for sleep()">
-<polygon fill="white" stroke="#666666" points="233.75,-38.25 185.5,-38.25 185.5,-19 233.75,-19 233.75,-38.25"/>
-<text text-anchor="middle" x="209.62" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">SLEEP</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node13 -->
-<g id="edge15_Node000001_Node000013" class="edge">
-<title>Node1&#45;&gt;Node13</title>
-<g id="a_edge15_Node000001_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.09,-105C92.72,-88.74 122.32,-63.48 151.75,-47.62 158.77,-43.84 166.68,-40.62 174.32,-37.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.29,-41.33 183.74,-34.94 173.15,-34.67 175.29,-41.33"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59" target="_top" xlink:title="Utility function to verify if the given input is a number or not. This is very useful to prevent the ...">
-<polygon fill="white" stroke="#666666" points="419.25,-264.88 303.5,-264.88 303.5,-234.38 419.25,-234.38 419.25,-264.88"/>
-<text text-anchor="start" x="311.5" y="-251.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="361.38" y="-240.12" font-family="Helvetica,sans-Serif" font-size="10.00">::is_number</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.42,-216.26C272.13,-220.75 287.24,-225.69 301.53,-230.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.23,-233.63 310.83,-233.41 302.41,-226.98 300.23,-233.63"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M227.8,-216.31C245.75,-232.15 275.18,-256.64 303.5,-273.62 305.93,-275.08 308.46,-276.5 311.04,-277.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.31,-280.92 319.82,-282.28 312.44,-274.67 309.31,-280.92"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b" target="_top" xlink:title="Utility function that resets the data if the user enters an invalid value.">
-<polygon fill="white" stroke="#666666" points="419.25,-215.88 303.5,-215.88 303.5,-185.38 419.25,-185.38 419.25,-215.88"/>
-<text text-anchor="start" x="311.5" y="-202.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="361.38" y="-191.12" font-family="Helvetica,sans-Serif" font-size="10.00">::reset_data</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.67,-194.05C275.64,-193.89 283.91,-193.84 292.07,-193.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.93,-197.4 301.98,-194.03 292.03,-190.4 291.93,-197.4"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge5_Node000005_Node000002" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge5_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.49,-207.2C295.52,-207.36 287.26,-207.41 279.09,-207.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="279.23,-203.85 269.18,-207.22 279.13,-210.85 279.23,-203.85"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="407.25,-167.25 315.5,-167.25 315.5,-148 407.25,-148 407.25,-167.25"/>
-<text text-anchor="middle" x="361.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge8_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge8_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.67,-134.72C281.23,-138.07 295.62,-141.62 308.91,-144.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.76,-148.23 318.31,-147.23 309.44,-141.43 307.76,-148.23"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="403.5,-130.25 319.25,-130.25 319.25,-111 403.5,-111 403.5,-130.25"/>
-<text text-anchor="middle" x="361.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge9_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge9_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.67,-120.62C280.7,-120.62 294.5,-120.62 307.36,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.35,-124.13 317.35,-120.63 307.35,-117.13 307.35,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="419.25,-93.25 303.5,-93.25 303.5,-74 419.25,-74 419.25,-93.25"/>
-<text text-anchor="middle" x="361.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge10_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge10_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.67,-106.53C281.23,-103.18 295.62,-99.63 308.91,-96.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.44,-99.82 318.31,-94.02 307.76,-93.02 309.44,-99.82"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="393.75,-56.25 329,-56.25 329,-37 393.75,-37 393.75,-56.25"/>
-<text text-anchor="middle" x="361.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge11_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge11_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M250.57,-104.88C256.39,-102.07 262.21,-98.96 267.5,-95.62 285.36,-84.36 285.06,-74.91 303.5,-64.62 308.12,-62.05 313.16,-59.78 318.27,-57.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="319.02,-61.26 327.31,-54.66 316.71,-54.65 319.02,-61.26"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="404.62,-19.25 318.12,-19.25 318.12,0 404.62,0 404.62,-19.25"/>
-<text text-anchor="middle" x="361.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge12_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge12_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.74,-104.91C259.34,-102.23 263.71,-99.15 267.5,-95.62 292.54,-72.34 277.24,-49.53 303.5,-27.62 304.95,-26.42 306.48,-25.29 308.07,-24.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.3,-27.55 316.42,-19.72 305.96,-21.4 309.3,-27.55"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d41/namespacegames_1_1memory__game_a3ceeea62d8fa6c563e2c66359fd73413_cgraph_org.svg b/d8/d41/namespacegames_1_1memory__game_a3ceeea62d8fa6c563e2c66359fd73413_cgraph_org.svg
deleted file mode 100644
index 18541c263..000000000
--- a/d8/d41/namespacegames_1_1memory__game_a3ceeea62d8fa6c563e2c66359fd73413_cgraph_org.svg
+++ /dev/null
@@ -1,271 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: games::memory_game::assign_results Pages: 1 -->
-<svg width="427pt" height="322pt"
- viewBox="0.00 0.00 427.25 321.88" 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 317.88)">
-<title>games::memory_game::assign_results</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to assign the results to the table.">
-<polygon fill="#999999" stroke="#666666" points="115.75,-135.88 0,-135.88 0,-105.38 115.75,-105.38 115.75,-135.88"/>
-<text text-anchor="start" x="8" y="-122.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="57.88" y="-111.12" font-family="Helvetica,sans-Serif" font-size="10.00">::assign_results</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge6_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge6_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.98,-136.36C25.5,-145.43 34.46,-153.88 57.88,-153.88 70.68,-153.88 79.16,-151.35 83.32,-147.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.77,-148.23 84.57,-137.86 79.83,-147.33 86.77,-148.23"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3" target="_top" xlink:title="Function that asks the user for their input in the table they previously chose.">
-<polygon fill="white" stroke="#666666" points="267.5,-215.88 151.75,-215.88 151.75,-185.38 267.5,-185.38 267.5,-215.88"/>
-<text text-anchor="start" x="159.75" y="-202.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="209.62" y="-191.12" font-family="Helvetica,sans-Serif" font-size="10.00">::ask_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.1,-136.24C111.22,-148.59 143.72,-165.95 169.15,-179.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.41,-182.58 177.88,-184.2 170.71,-176.4 167.41,-182.58"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280" target="_top" xlink:title="Utility function to print the table.">
-<polygon fill="white" stroke="#666666" points="419.25,-313.88 303.5,-313.88 303.5,-283.38 419.25,-283.38 419.25,-313.88"/>
-<text text-anchor="start" x="311.5" y="-300.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="361.38" y="-289.12" font-family="Helvetica,sans-Serif" font-size="10.00">::print_table</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge14_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge14_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.01,-136.26C84.36,-158.79 115.58,-200.33 151.75,-224.62 194.45,-253.3 249.53,-272.22 292.37,-283.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.24,-287.07 301.8,-286.21 293.01,-280.29 291.24,-287.07"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214" target="_top" xlink:title="Initializes the table with the letters.">
-<polygon fill="white" stroke="#666666" points="267.5,-135.88 151.75,-135.88 151.75,-105.38 267.5,-105.38 267.5,-135.88"/>
-<text text-anchor="start" x="159.75" y="-122.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="209.62" y="-111.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.92,-120.62C123.89,-120.62 132.16,-120.62 140.32,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.23,-124.13 150.23,-120.63 140.23,-117.13 140.23,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a370760f2b328ad341bcb77d82fa17b01" target="_top" xlink:title="Checks if the two values given by the user match.">
-<polygon fill="white" stroke="#666666" points="267.5,-86.88 151.75,-86.88 151.75,-56.38 267.5,-56.38 267.5,-86.88"/>
-<text text-anchor="start" x="159.75" y="-73.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="209.62" y="-62.12" font-family="Helvetica,sans-Serif" font-size="10.00">::match</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge13_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge13_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.67,-104.99C120.38,-100.5 135.49,-95.56 149.78,-90.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.66,-94.27 159.08,-87.84 148.48,-87.62 150.66,-94.27"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6" target="_top" xlink:title="for sleep()">
-<polygon fill="white" stroke="#666666" points="233.75,-38.25 185.5,-38.25 185.5,-19 233.75,-19 233.75,-38.25"/>
-<text text-anchor="middle" x="209.62" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">SLEEP</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node13 -->
-<g id="edge15_Node000001_Node000013" class="edge">
-<title>Node1&#45;&gt;Node13</title>
-<g id="a_edge15_Node000001_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.09,-105C92.72,-88.74 122.32,-63.48 151.75,-47.62 158.77,-43.84 166.68,-40.62 174.32,-37.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.29,-41.33 183.74,-34.94 173.15,-34.67 175.29,-41.33"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59" target="_top" xlink:title="Utility function to verify if the given input is a number or not. This is very useful to prevent the ...">
-<polygon fill="white" stroke="#666666" points="419.25,-264.88 303.5,-264.88 303.5,-234.38 419.25,-234.38 419.25,-264.88"/>
-<text text-anchor="start" x="311.5" y="-251.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="361.38" y="-240.12" font-family="Helvetica,sans-Serif" font-size="10.00">::is_number</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.42,-216.26C272.13,-220.75 287.24,-225.69 301.53,-230.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.23,-233.63 310.83,-233.41 302.41,-226.98 300.23,-233.63"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M227.8,-216.31C245.75,-232.15 275.18,-256.64 303.5,-273.62 305.93,-275.08 308.46,-276.5 311.04,-277.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.31,-280.92 319.82,-282.28 312.44,-274.67 309.31,-280.92"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b" target="_top" xlink:title="Utility function that resets the data if the user enters an invalid value.">
-<polygon fill="white" stroke="#666666" points="419.25,-215.88 303.5,-215.88 303.5,-185.38 419.25,-185.38 419.25,-215.88"/>
-<text text-anchor="start" x="311.5" y="-202.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="361.38" y="-191.12" font-family="Helvetica,sans-Serif" font-size="10.00">::reset_data</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.67,-194.05C275.64,-193.89 283.91,-193.84 292.07,-193.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.93,-197.4 301.98,-194.03 292.03,-190.4 291.93,-197.4"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge5_Node000005_Node000002" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge5_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.49,-207.2C295.52,-207.36 287.26,-207.41 279.09,-207.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="279.23,-203.85 269.18,-207.22 279.13,-210.85 279.23,-203.85"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="407.25,-167.25 315.5,-167.25 315.5,-148 407.25,-148 407.25,-167.25"/>
-<text text-anchor="middle" x="361.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge8_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge8_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.67,-134.72C281.23,-138.07 295.62,-141.62 308.91,-144.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.76,-148.23 318.31,-147.23 309.44,-141.43 307.76,-148.23"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="403.5,-130.25 319.25,-130.25 319.25,-111 403.5,-111 403.5,-130.25"/>
-<text text-anchor="middle" x="361.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge9_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge9_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.67,-120.62C280.7,-120.62 294.5,-120.62 307.36,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.35,-124.13 317.35,-120.63 307.35,-117.13 307.35,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="419.25,-93.25 303.5,-93.25 303.5,-74 419.25,-74 419.25,-93.25"/>
-<text text-anchor="middle" x="361.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge10_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge10_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.67,-106.53C281.23,-103.18 295.62,-99.63 308.91,-96.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.44,-99.82 318.31,-94.02 307.76,-93.02 309.44,-99.82"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="393.75,-56.25 329,-56.25 329,-37 393.75,-37 393.75,-56.25"/>
-<text text-anchor="middle" x="361.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge11_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge11_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M250.57,-104.88C256.39,-102.07 262.21,-98.96 267.5,-95.62 285.36,-84.36 285.06,-74.91 303.5,-64.62 308.12,-62.05 313.16,-59.78 318.27,-57.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="319.02,-61.26 327.31,-54.66 316.71,-54.65 319.02,-61.26"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="404.62,-19.25 318.12,-19.25 318.12,0 404.62,0 404.62,-19.25"/>
-<text text-anchor="middle" x="361.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge12_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge12_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.74,-104.91C259.34,-102.23 263.71,-99.15 267.5,-95.62 292.54,-72.34 277.24,-49.53 303.5,-27.62 304.95,-26.42 306.48,-25.29 308.07,-24.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.3,-27.55 316.42,-19.72 305.96,-21.4 309.3,-27.55"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d41/namespacegames_1_1memory__game_a5714d97649c0edd57b4fb449799676a3_cgraph.map b/d8/d41/namespacegames_1_1memory__game_a5714d97649c0edd57b4fb449799676a3_cgraph.map
deleted file mode 100644
index 39fbc37e5..000000000
--- a/d8/d41/namespacegames_1_1memory__game_a5714d97649c0edd57b4fb449799676a3_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="games::memory_game::ask_data" name="games::memory_game::ask_data">
-<area shape="rect" id="Node000001" title="Function that asks the user for their input in the table they previously chose." alt="" coords="5,104,160,145"/>
-<area shape="rect" id="Node000002" href="$d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59" title="Utility function to verify if the given input is a number or not. This is very useful to prevent the ..." alt="" coords="208,5,362,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="120,101,206,57,220,50,222,55,209,61,123,106"/>
-<area shape="rect" id="Node000003" href="$d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280" title="Utility function to print the table." alt="" coords="208,71,362,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="159,109,192,104,193,109,160,114"/>
-<area shape="rect" id="Node000004" href="$d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b" title="Utility function that resets the data if the user enters an invalid value." alt="" coords="208,136,362,177"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="160,143,193,148,192,153,159,148"/>
-<area shape="poly" id="edge4_Node000004_Node000001" title=" " alt="" coords="207,138,174,133,175,127,208,133"/>
-</map>
diff --git a/d8/d41/namespacegames_1_1memory__game_a5714d97649c0edd57b4fb449799676a3_cgraph.md5 b/d8/d41/namespacegames_1_1memory__game_a5714d97649c0edd57b4fb449799676a3_cgraph.md5
deleted file mode 100644
index 89260bdd5..000000000
--- a/d8/d41/namespacegames_1_1memory__game_a5714d97649c0edd57b4fb449799676a3_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-451a16107d2064575ae2d337b781fe5f
\ No newline at end of file
diff --git a/d8/d41/namespacegames_1_1memory__game_a5714d97649c0edd57b4fb449799676a3_cgraph.svg b/d8/d41/namespacegames_1_1memory__game_a5714d97649c0edd57b4fb449799676a3_cgraph.svg
deleted file mode 100644
index b7589a394..000000000
--- a/d8/d41/namespacegames_1_1memory__game_a5714d97649c0edd57b4fb449799676a3_cgraph.svg
+++ /dev/null
@@ -1,114 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: games::memory_game::ask_data Pages: 1 -->
-<svg width="276pt" height="137pt"
- viewBox="0.00 0.00 275.50 136.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 132.5)">
-<title>games::memory_game::ask_data</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that asks the user for their input in the table they previously chose.">
-<polygon fill="#999999" stroke="#666666" points="115.75,-54.5 0,-54.5 0,-24 115.75,-24 115.75,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="57.88" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::ask_data</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59" target="_top" xlink:title="Utility function to verify if the given input is a number or not. This is very useful to prevent the ...">
-<polygon fill="white" stroke="#666666" points="267.5,-128.5 151.75,-128.5 151.75,-98 267.5,-98 267.5,-128.5"/>
-<text text-anchor="start" x="159.75" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="209.62" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::is_number</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.06,-54.79C105.34,-64.7 129.75,-77.63 151.75,-88.25 155,-89.82 158.38,-91.41 161.79,-92.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.11,-96.06 170.66,-97 163,-89.69 160.11,-96.06"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280" target="_top" xlink:title="Utility function to print the table.">
-<polygon fill="white" stroke="#666666" points="267.5,-79.5 151.75,-79.5 151.75,-49 267.5,-49 267.5,-79.5"/>
-<text text-anchor="start" x="159.75" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="209.62" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::print_table</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.92,-48.77C123.99,-50.12 132.35,-51.52 140.6,-52.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.81,-56.31 150.25,-54.5 140.96,-49.41 139.81,-56.31"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b" target="_top" xlink:title="Utility function that resets the data if the user enters an invalid value.">
-<polygon fill="white" stroke="#666666" points="267.5,-30.5 151.75,-30.5 151.75,0 267.5,0 267.5,-30.5"/>
-<text text-anchor="start" x="159.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="209.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reset_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.92,-23.53C123.99,-22.08 132.35,-20.69 140.6,-19.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.86,-22.93 150.24,-18.01 139.84,-16 140.86,-22.93"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node1 -->
-<g id="edge4_Node000004_Node000001" class="edge">
-<title>Node4&#45;&gt;Node1</title>
-<g id="a_edge4_Node000004_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.74,-30.94C143.68,-32.39 135.32,-33.78 127.06,-35.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.8,-31.55 117.41,-36.47 127.82,-38.47 126.8,-31.55"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d41/namespacegames_1_1memory__game_a5714d97649c0edd57b4fb449799676a3_cgraph_org.svg b/d8/d41/namespacegames_1_1memory__game_a5714d97649c0edd57b4fb449799676a3_cgraph_org.svg
deleted file mode 100644
index bc5fd1540..000000000
--- a/d8/d41/namespacegames_1_1memory__game_a5714d97649c0edd57b4fb449799676a3_cgraph_org.svg
+++ /dev/null
@@ -1,88 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: games::memory_game::ask_data Pages: 1 -->
-<svg width="276pt" height="137pt"
- viewBox="0.00 0.00 275.50 136.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 132.5)">
-<title>games::memory_game::ask_data</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that asks the user for their input in the table they previously chose.">
-<polygon fill="#999999" stroke="#666666" points="115.75,-54.5 0,-54.5 0,-24 115.75,-24 115.75,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="57.88" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::ask_data</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59" target="_top" xlink:title="Utility function to verify if the given input is a number or not. This is very useful to prevent the ...">
-<polygon fill="white" stroke="#666666" points="267.5,-128.5 151.75,-128.5 151.75,-98 267.5,-98 267.5,-128.5"/>
-<text text-anchor="start" x="159.75" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="209.62" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::is_number</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.06,-54.79C105.34,-64.7 129.75,-77.63 151.75,-88.25 155,-89.82 158.38,-91.41 161.79,-92.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.11,-96.06 170.66,-97 163,-89.69 160.11,-96.06"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280" target="_top" xlink:title="Utility function to print the table.">
-<polygon fill="white" stroke="#666666" points="267.5,-79.5 151.75,-79.5 151.75,-49 267.5,-49 267.5,-79.5"/>
-<text text-anchor="start" x="159.75" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="209.62" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::print_table</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.92,-48.77C123.99,-50.12 132.35,-51.52 140.6,-52.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.81,-56.31 150.25,-54.5 140.96,-49.41 139.81,-56.31"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b" target="_top" xlink:title="Utility function that resets the data if the user enters an invalid value.">
-<polygon fill="white" stroke="#666666" points="267.5,-30.5 151.75,-30.5 151.75,0 267.5,0 267.5,-30.5"/>
-<text text-anchor="start" x="159.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="209.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reset_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.92,-23.53C123.99,-22.08 132.35,-20.69 140.6,-19.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.86,-22.93 150.24,-18.01 139.84,-16 140.86,-22.93"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node1 -->
-<g id="edge4_Node000004_Node000001" class="edge">
-<title>Node4&#45;&gt;Node1</title>
-<g id="a_edge4_Node000004_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.74,-30.94C143.68,-32.39 135.32,-33.78 127.06,-35.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.8,-31.55 117.41,-36.47 127.82,-38.47 126.8,-31.55"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d41/namespacegames_1_1memory__game_ad573c8ae66ab66156d03e5e81bbba214_cgraph.map b/d8/d41/namespacegames_1_1memory__game_ad573c8ae66ab66156d03e5e81bbba214_cgraph.map
deleted file mode 100644
index 404715276..000000000
--- a/d8/d41/namespacegames_1_1memory__game_ad573c8ae66ab66156d03e5e81bbba214_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="games::memory_game::init" name="games::memory_game::init">
-<area shape="rect" id="Node000001" title="Initializes the table with the letters." alt="" coords="5,96,160,137"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="224,5,346,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="112,94,156,66,207,40,220,34,222,39,209,45,159,71,115,98"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="229,55,341,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="159,95,214,82,216,87,161,101"/>
-<area shape="rect" id="Node000004" 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="208,104,362,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="160,114,192,114,192,120,160,120"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/random_shuffle.html#" title=" " alt="" coords="242,153,328,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="161,133,227,150,226,155,159,138"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="227,203,342,228"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="115,135,159,163,209,189,222,194,220,199,207,194,156,167,112,140"/>
-</map>
diff --git a/d8/d41/namespacegames_1_1memory__game_ad573c8ae66ab66156d03e5e81bbba214_cgraph.md5 b/d8/d41/namespacegames_1_1memory__game_ad573c8ae66ab66156d03e5e81bbba214_cgraph.md5
deleted file mode 100644
index 21528b6a7..000000000
--- a/d8/d41/namespacegames_1_1memory__game_ad573c8ae66ab66156d03e5e81bbba214_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-78293c1a9b92bd6304e5a97e384752e4
\ No newline at end of file
diff --git a/d8/d41/namespacegames_1_1memory__game_ad573c8ae66ab66156d03e5e81bbba214_cgraph.svg b/d8/d41/namespacegames_1_1memory__game_ad573c8ae66ab66156d03e5e81bbba214_cgraph.svg
deleted file mode 100644
index a241e9b34..000000000
--- a/d8/d41/namespacegames_1_1memory__game_ad573c8ae66ab66156d03e5e81bbba214_cgraph.svg
+++ /dev/null
@@ -1,138 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: games::memory_game::init Pages: 1 -->
-<svg width="276pt" height="175pt"
- viewBox="0.00 0.00 275.50 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>games::memory_game::init</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Initializes the table with the letters.">
-<polygon fill="#999999" stroke="#666666" points="115.75,-98.88 0,-98.88 0,-68.38 115.75,-68.38 115.75,-98.88"/>
-<text text-anchor="start" x="8" y="-85.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="57.88" y="-74.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-167.25 163.75,-167.25 163.75,-148 255.5,-148 255.5,-167.25"/>
-<text text-anchor="middle" x="209.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.33,-99.24C99.65,-111.45 126.53,-128.22 151.75,-139.62 154.9,-141.05 158.2,-142.41 161.56,-143.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.32,-146.97 170.92,-147.05 162.68,-140.38 160.32,-146.97"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.75,-130.25 167.5,-130.25 167.5,-111 251.75,-111 251.75,-130.25"/>
-<text text-anchor="middle" x="209.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.92,-97.72C129.48,-101.07 143.87,-104.62 157.16,-107.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.01,-111.23 166.56,-110.23 157.69,-104.43 156.01,-111.23"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.5,-93.25 151.75,-93.25 151.75,-74 267.5,-74 267.5,-93.25"/>
-<text text-anchor="middle" x="209.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.92,-83.62C123.89,-83.62 132.16,-83.62 140.32,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.23,-87.13 150.23,-83.63 140.23,-80.13 140.23,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242,-56.25 177.25,-56.25 177.25,-37 242,-37 242,-56.25"/>
-<text text-anchor="middle" x="209.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.92,-69.53C132.54,-65.42 150.42,-61.01 165.99,-57.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.54,-60.63 175.4,-54.83 164.86,-53.83 166.54,-60.63"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.88,-19.25 166.38,-19.25 166.38,0 252.88,0 252.88,-19.25"/>
-<text text-anchor="middle" x="209.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.33,-68.01C99.65,-55.8 126.53,-39.03 151.75,-27.62 154.9,-26.2 158.2,-24.84 161.56,-23.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.68,-26.87 170.92,-20.2 160.32,-20.28 162.68,-26.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d41/namespacegames_1_1memory__game_ad573c8ae66ab66156d03e5e81bbba214_cgraph_org.svg b/d8/d41/namespacegames_1_1memory__game_ad573c8ae66ab66156d03e5e81bbba214_cgraph_org.svg
deleted file mode 100644
index 4fbcbce30..000000000
--- a/d8/d41/namespacegames_1_1memory__game_ad573c8ae66ab66156d03e5e81bbba214_cgraph_org.svg
+++ /dev/null
@@ -1,112 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: games::memory_game::init Pages: 1 -->
-<svg width="276pt" height="175pt"
- viewBox="0.00 0.00 275.50 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>games::memory_game::init</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Initializes the table with the letters.">
-<polygon fill="#999999" stroke="#666666" points="115.75,-98.88 0,-98.88 0,-68.38 115.75,-68.38 115.75,-98.88"/>
-<text text-anchor="start" x="8" y="-85.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="57.88" y="-74.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-167.25 163.75,-167.25 163.75,-148 255.5,-148 255.5,-167.25"/>
-<text text-anchor="middle" x="209.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.33,-99.24C99.65,-111.45 126.53,-128.22 151.75,-139.62 154.9,-141.05 158.2,-142.41 161.56,-143.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.32,-146.97 170.92,-147.05 162.68,-140.38 160.32,-146.97"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.75,-130.25 167.5,-130.25 167.5,-111 251.75,-111 251.75,-130.25"/>
-<text text-anchor="middle" x="209.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.92,-97.72C129.48,-101.07 143.87,-104.62 157.16,-107.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.01,-111.23 166.56,-110.23 157.69,-104.43 156.01,-111.23"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.5,-93.25 151.75,-93.25 151.75,-74 267.5,-74 267.5,-93.25"/>
-<text text-anchor="middle" x="209.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.92,-83.62C123.89,-83.62 132.16,-83.62 140.32,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.23,-87.13 150.23,-83.63 140.23,-80.13 140.23,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242,-56.25 177.25,-56.25 177.25,-37 242,-37 242,-56.25"/>
-<text text-anchor="middle" x="209.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.92,-69.53C132.54,-65.42 150.42,-61.01 165.99,-57.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.54,-60.63 175.4,-54.83 164.86,-53.83 166.54,-60.63"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.88,-19.25 166.38,-19.25 166.38,0 252.88,0 252.88,-19.25"/>
-<text text-anchor="middle" x="209.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.33,-68.01C99.65,-55.8 126.53,-39.03 151.75,-27.62 154.9,-26.2 158.2,-24.84 161.56,-23.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.68,-26.87 170.92,-20.2 160.32,-20.28 162.68,-26.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d41/namespacegames_1_1memory__game_adc62ebb75853446656e24932bdc6dd6b_cgraph.map b/d8/d41/namespacegames_1_1memory__game_adc62ebb75853446656e24932bdc6dd6b_cgraph.map
deleted file mode 100644
index 04aac76f3..000000000
--- a/d8/d41/namespacegames_1_1memory__game_adc62ebb75853446656e24932bdc6dd6b_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="games::memory_game::reset_data" name="games::memory_game::reset_data">
-<area shape="rect" id="Node000001" title="Utility function that resets the data if the user enters an invalid value." alt="" coords="5,39,160,79"/>
-<area shape="rect" id="Node000002" href="$d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3" title="Function that asks the user for their input in the table they previously chose." alt="" coords="208,39,362,79"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="160,65,192,65,192,71,160,70"/>
-<area shape="poly" id="edge4_Node000002_Node000001" title=" " alt="" coords="208,53,175,53,175,47,208,48"/>
-<area shape="rect" id="Node000003" href="$d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59" title="Utility function to verify if the given input is a number or not. This is very useful to prevent the ..." alt="" coords="410,5,564,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="362,44,395,38,396,43,363,49"/>
-<area shape="rect" id="Node000004" href="$d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280" title="Utility function to print the table." alt="" coords="410,71,564,111"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="363,69,396,74,395,79,362,74"/>
-</map>
diff --git a/d8/d41/namespacegames_1_1memory__game_adc62ebb75853446656e24932bdc6dd6b_cgraph.md5 b/d8/d41/namespacegames_1_1memory__game_adc62ebb75853446656e24932bdc6dd6b_cgraph.md5
deleted file mode 100644
index 62c37e8fd..000000000
--- a/d8/d41/namespacegames_1_1memory__game_adc62ebb75853446656e24932bdc6dd6b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-481fe24a59ab63f100e195c9e694a7e3
\ No newline at end of file
diff --git a/d8/d41/namespacegames_1_1memory__game_adc62ebb75853446656e24932bdc6dd6b_cgraph.svg b/d8/d41/namespacegames_1_1memory__game_adc62ebb75853446656e24932bdc6dd6b_cgraph.svg
deleted file mode 100644
index f782b1037..000000000
--- a/d8/d41/namespacegames_1_1memory__game_adc62ebb75853446656e24932bdc6dd6b_cgraph.svg
+++ /dev/null
@@ -1,114 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: games::memory_game::reset_data Pages: 1 -->
-<svg width="427pt" height="88pt"
- viewBox="0.00 0.00 427.25 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>games::memory_game::reset_data</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function that resets the data if the user enters an invalid value.">
-<polygon fill="#999999" stroke="#666666" points="115.75,-54.5 0,-54.5 0,-24 115.75,-24 115.75,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="57.88" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reset_data</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3" target="_top" xlink:title="Function that asks the user for their input in the table they previously chose.">
-<polygon fill="white" stroke="#666666" points="267.5,-54.5 151.75,-54.5 151.75,-24 267.5,-24 267.5,-54.5"/>
-<text text-anchor="start" x="159.75" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="209.62" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::ask_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.92,-32.67C123.89,-32.52 132.16,-32.47 140.32,-32.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.18,-36.02 150.23,-32.66 140.28,-29.02 140.18,-36.02"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node1 -->
-<g id="edge4_Node000002_Node000001" class="edge">
-<title>Node2&#45;&gt;Node1</title>
-<g id="a_edge4_Node000002_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.74,-45.82C143.77,-45.98 135.51,-46.03 127.34,-45.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.48,-42.48 117.43,-45.85 127.38,-49.48 127.48,-42.48"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59" target="_top" xlink:title="Utility function to verify if the given input is a number or not. This is very useful to prevent the ...">
-<polygon fill="white" stroke="#666666" points="419.25,-79.5 303.5,-79.5 303.5,-49 419.25,-49 419.25,-79.5"/>
-<text text-anchor="start" x="311.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="361.38" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::is_number</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.67,-48.77C275.74,-50.12 284.1,-51.52 292.35,-52.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.56,-56.31 302,-54.5 292.71,-49.41 291.56,-56.31"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280" target="_top" xlink:title="Utility function to print the table.">
-<polygon fill="white" stroke="#666666" points="419.25,-30.5 303.5,-30.5 303.5,0 419.25,0 419.25,-30.5"/>
-<text text-anchor="start" x="311.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="361.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::print_table</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.67,-30.11C275.74,-28.81 284.1,-27.47 292.35,-26.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="292.68,-29.64 302,-24.61 291.57,-22.73 292.68,-29.64"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d41/namespacegames_1_1memory__game_adc62ebb75853446656e24932bdc6dd6b_cgraph_org.svg b/d8/d41/namespacegames_1_1memory__game_adc62ebb75853446656e24932bdc6dd6b_cgraph_org.svg
deleted file mode 100644
index ff3ff6d29..000000000
--- a/d8/d41/namespacegames_1_1memory__game_adc62ebb75853446656e24932bdc6dd6b_cgraph_org.svg
+++ /dev/null
@@ -1,88 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: games::memory_game::reset_data Pages: 1 -->
-<svg width="427pt" height="88pt"
- viewBox="0.00 0.00 427.25 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>games::memory_game::reset_data</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function that resets the data if the user enters an invalid value.">
-<polygon fill="#999999" stroke="#666666" points="115.75,-54.5 0,-54.5 0,-24 115.75,-24 115.75,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="57.88" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reset_data</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3" target="_top" xlink:title="Function that asks the user for their input in the table they previously chose.">
-<polygon fill="white" stroke="#666666" points="267.5,-54.5 151.75,-54.5 151.75,-24 267.5,-24 267.5,-54.5"/>
-<text text-anchor="start" x="159.75" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="209.62" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::ask_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.92,-32.67C123.89,-32.52 132.16,-32.47 140.32,-32.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.18,-36.02 150.23,-32.66 140.28,-29.02 140.18,-36.02"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node1 -->
-<g id="edge4_Node000002_Node000001" class="edge">
-<title>Node2&#45;&gt;Node1</title>
-<g id="a_edge4_Node000002_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.74,-45.82C143.77,-45.98 135.51,-46.03 127.34,-45.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.48,-42.48 117.43,-45.85 127.38,-49.48 127.48,-42.48"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59" target="_top" xlink:title="Utility function to verify if the given input is a number or not. This is very useful to prevent the ...">
-<polygon fill="white" stroke="#666666" points="419.25,-79.5 303.5,-79.5 303.5,-49 419.25,-49 419.25,-79.5"/>
-<text text-anchor="start" x="311.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="361.38" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::is_number</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.67,-48.77C275.74,-50.12 284.1,-51.52 292.35,-52.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.56,-56.31 302,-54.5 292.71,-49.41 291.56,-56.31"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280" target="_top" xlink:title="Utility function to print the table.">
-<polygon fill="white" stroke="#666666" points="419.25,-30.5 303.5,-30.5 303.5,0 419.25,0 419.25,-30.5"/>
-<text text-anchor="start" x="311.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="361.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::print_table</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.67,-30.11C275.74,-28.81 284.1,-27.47 292.35,-26.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="292.68,-29.64 302,-24.61 291.57,-22.73 292.68,-29.64"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp.html b/d8/d53/modular__inverse__fermat__little__theorem_8cpp.html
index 76101c6cb..1611635d5 100644
--- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp.html
+++ b/d8/d53/modular__inverse__fermat__little__theorem_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/modular_inverse_fermat_little_theorem.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/modular_inverse_fermat_little_theorem.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for modular_inverse_fermat_little_theorem.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.svg" width="255" height="126"><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">
+</div>
+<p><a href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -133,13 +152,13 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a1c62a87e79f29b98d8fe5b12eacdd928" id="r_a1c62a87e79f29b98d8fe5b12eacdd928"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1c62a87e79f29b98d8fe5b12eacdd928">math::modular_inverse_fermat::binExpo</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> a, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> b, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> m)</td></tr>
+<tr class="memitem:a1c62a87e79f29b98d8fe5b12eacdd928" id="r_a1c62a87e79f29b98d8fe5b12eacdd928"><td class="memItemLeft" align="right" valign="top">std::int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1c62a87e79f29b98d8fe5b12eacdd928">math::modular_inverse_fermat::binExpo</a> (std::int64_t a, std::int64_t b, std::int64_t m)</td></tr>
 <tr class="memdesc:a1c62a87e79f29b98d8fe5b12eacdd928"><td class="mdescLeft">&#160;</td><td class="mdescRight">Calculate exponent with modulo using binary exponentiation in \(O(\log b)\) time.  <br /></td></tr>
 <tr class="separator:a1c62a87e79f29b98d8fe5b12eacdd928"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aba4929409fee35c3cb559e962a544b3e" id="r_aba4929409fee35c3cb559e962a544b3e"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aba4929409fee35c3cb559e962a544b3e">math::modular_inverse_fermat::isPrime</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> m)</td></tr>
+<tr class="memitem:aba4929409fee35c3cb559e962a544b3e" id="r_aba4929409fee35c3cb559e962a544b3e"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aba4929409fee35c3cb559e962a544b3e">math::modular_inverse_fermat::isPrime</a> (std::int64_t m)</td></tr>
 <tr class="memdesc:aba4929409fee35c3cb559e962a544b3e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Check if an integer is a prime number in \(O(\sqrt{m})\) time.  <br /></td></tr>
 <tr class="separator:aba4929409fee35c3cb559e962a544b3e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae7e807e02c65c6fffd6162b4c66290c2" id="r_ae7e807e02c65c6fffd6162b4c66290c2"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae7e807e02c65c6fffd6162b4c66290c2">math::modular_inverse_fermat::modular_inverse</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> a, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> m)</td></tr>
+<tr class="memitem:ae7e807e02c65c6fffd6162b4c66290c2" id="r_ae7e807e02c65c6fffd6162b4c66290c2"><td class="memItemLeft" align="right" valign="top">std::int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae7e807e02c65c6fffd6162b4c66290c2">math::modular_inverse_fermat::modular_inverse</a> (std::int64_t a, std::int64_t m)</td></tr>
 <tr class="memdesc:ae7e807e02c65c6fffd6162b4c66290c2"><td class="mdescLeft">&#160;</td><td class="mdescRight">calculates the modular inverse.  <br /></td></tr>
 <tr class="separator:ae7e807e02c65c6fffd6162b4c66290c2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -180,6 +199,8 @@ Functions</h2></td></tr>
 <li>\(3^5 \;\text{mod}\; 7 = 243 \;\text{mod}\; 7 = 5\) <br  />
 Hence, \(3^{-1} \;\text{mod}\; 7 = 5\) or \(3 \times 5  \;\text{mod}\; 7 = 1 \;\text{mod}\; 7\) (as \(a\times a^{-1} = 1\)) </li>
 </ul>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html">modular_inverse_fermat_little_theorem.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a1c62a87e79f29b98d8fe5b12eacdd928" name="a1c62a87e79f29b98d8fe5b12eacdd928"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a1c62a87e79f29b98d8fe5b12eacdd928">&#9670;&#160;</a></span>binExpo()</h2>
@@ -188,19 +209,19 @@ Hence, \(3^{-1} \;\text{mod}\; 7 = 5\) or \(3 \times 5  \;\text{mod}\; 7 = 1 \;\
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> math::modular_inverse_fermat::binExpo </td>
+          <td class="memname">std::int64_t math::modular_inverse_fermat::binExpo </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a></td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
+          <td class="paramtype">std::int64_t</td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a></td>          <td class="paramname"><span class="paramname"><em>b</em></span>, </td>
+          <td class="paramtype">std::int64_t</td>          <td class="paramname"><span class="paramname"><em>b</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a></td>          <td class="paramname"><span class="paramname"><em>m</em></span>&#160;)</td>
+          <td class="paramtype">std::int64_t</td>          <td class="paramname"><span class="paramname"><em>m</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -215,9 +236,11 @@ Hence, \(3^{-1} \;\text{mod}\; 7 = 5\) or \(3 \times 5  \;\text{mod}\; 7 = 1 \;\
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The result of \(a^{b} % m\) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html">modular_inverse_fermat_little_theorem.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   67</span>                                                             {</div>
 <div class="line"><span class="lineno">   68</span>  a %= m;</div>
-<div class="line"><span class="lineno">   69</span>  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> res = 1;</div>
+<div class="line"><span class="lineno">   69</span>  std::int64_t res = 1;</div>
 <div class="line"><span class="lineno">   70</span>  <span class="keywordflow">while</span> (b &gt; 0) {</div>
 <div class="line"><span class="lineno">   71</span>    <span class="keywordflow">if</span> (b % 2 != 0) {</div>
 <div class="line"><span class="lineno">   72</span>      res = res * a % m;</div>
@@ -228,13 +251,7 @@ Hence, \(3^{-1} \;\text{mod}\; 7 = 5\) or \(3 \times 5  \;\text{mod}\; 7 = 1 \;\
 <div class="line"><span class="lineno">   77</span>  }</div>
 <div class="line"><span class="lineno">   78</span>  <span class="keywordflow">return</span> res;</div>
 <div class="line"><span class="lineno">   79</span>}</div>
-<div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp_a1c62a87e79f29b98d8fe5b12eacdd928_cgraph.svg" width="280" height="68"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aba4929409fee35c3cb559e962a544b3e" name="aba4929409fee35c3cb559e962a544b3e"></a>
@@ -246,7 +263,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool math::modular_inverse_fermat::isPrime </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a></td>          <td class="paramname"><span class="paramname"><em>m</em></span></td><td>)</td>
+          <td class="paramtype">std::int64_t</td>          <td class="paramname"><span class="paramname"><em>m</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -262,23 +279,20 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>true if the number is prime </dd>
 <dd>
 false if the number is not prime </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html#l00086">86</a> of file <a class="el" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html">modular_inverse_fermat_little_theorem.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   86</span>                           {</div>
 <div class="line"><span class="lineno">   87</span>  <span class="keywordflow">if</span> (m &lt;= 1) {</div>
 <div class="line"><span class="lineno">   88</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   89</span>  } </div>
-<div class="line"><span class="lineno">   90</span>  <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> i = 2; i * i &lt;= m; i++) {</div>
+<div class="line"><span class="lineno">   90</span>  <span class="keywordflow">for</span> (std::int64_t i = 2; i * i &lt;= m; i++) {</div>
 <div class="line"><span class="lineno">   91</span>    <span class="keywordflow">if</span> (m % i == 0) {</div>
 <div class="line"><span class="lineno">   92</span>      <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   93</span>    }</div>
 <div class="line"><span class="lineno">   94</span>  }</div>
 <div class="line"><span class="lineno">   95</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   96</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp_aba4929409fee35c3cb559e962a544b3e_cgraph.svg" width="164" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -298,17 +312,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html#l00137">137</a> of file <a class="el" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html">modular_inverse_fermat_little_theorem.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  137</span>           {</div>
 <div class="line"><span class="lineno">  138</span>  <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementation</span></div>
 <div class="line"><span class="lineno">  139</span>  <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  140</span>}</div>
-<div class="ttc" id="amodular__inverse__fermat__little__theorem_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> modular_inverse_fermat_little_theorem.cpp:122</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amodular__inverse__fermat__little__theorem_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html#l00122">modular_inverse_fermat_little_theorem.cpp:122</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae7e807e02c65c6fffd6162b4c66290c2" name="ae7e807e02c65c6fffd6162b4c66290c2"></a>
@@ -318,14 +329,14 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> math::modular_inverse_fermat::modular_inverse </td>
+          <td class="memname">std::int64_t math::modular_inverse_fermat::modular_inverse </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a></td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
+          <td class="paramtype">std::int64_t</td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a></td>          <td class="paramname"><span class="paramname"><em>m</em></span>&#160;)</td>
+          <td class="paramtype">std::int64_t</td>          <td class="paramname"><span class="paramname"><em>m</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -339,6 +350,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The result that is the modular inverse of a modulo m </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html#l00103">103</a> of file <a class="el" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html">modular_inverse_fermat_little_theorem.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  103</span>                                                       {</div>
 <div class="line"><span class="lineno">  104</span>  <span class="keywordflow">while</span> (a &lt; 0) {</div>
 <div class="line"><span class="lineno">  105</span>    a += m;</div>
@@ -351,14 +364,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  112</span> </div>
 <div class="line"><span class="lineno">  113</span>  <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73">binExpo</a>(a, m - 2, m);  <span class="comment">// Fermat&#39;s Little Theorem</span></div>
 <div class="line"><span class="lineno">  114</span>}</div>
-<div class="ttc" id="abinary__exponent_8cpp_html_aeb48dce0725e63d19147944f41843c73"><div class="ttname"><a href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73">binExpo</a></div><div class="ttdeci">int binExpo(int a, int b)</div><div class="ttdef"><b>Definition</b> binary_exponent.cpp:28</div></div>
-<div class="ttc" id="amodular__inverse__fermat__little__theorem_8cpp_html_aba4929409fee35c3cb559e962a544b3e"><div class="ttname"><a href="#aba4929409fee35c3cb559e962a544b3e">math::modular_inverse_fermat::isPrime</a></div><div class="ttdeci">bool isPrime(std::int64_t m)</div><div class="ttdoc">Check if an integer is a prime number in  time.</div><div class="ttdef"><b>Definition</b> modular_inverse_fermat_little_theorem.cpp:86</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae7e807e02c65c6fffd6162b4c66290c2_cgraph.svg" width="380" height="150"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="abinary__exponent_8cpp_html_aeb48dce0725e63d19147944f41843c73"><div class="ttname"><a href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73">binExpo</a></div><div class="ttdeci">int binExpo(int a, int b)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dcf/binary__exponent_8cpp_source.html#l00028">binary_exponent.cpp:28</a></div></div>
+<div class="ttc" id="amodular__inverse__fermat__little__theorem_8cpp_html_aba4929409fee35c3cb559e962a544b3e"><div class="ttname"><a href="#aba4929409fee35c3cb559e962a544b3e">math::modular_inverse_fermat::isPrime</a></div><div class="ttdeci">bool isPrime(std::int64_t m)</div><div class="ttdoc">Check if an integer is a prime number in  time.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html#l00086">modular_inverse_fermat_little_theorem.cpp:86</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -386,6 +394,8 @@ Here is the call graph for this function:</div>
 
 <p>Self-test implementation. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html#l00122">122</a> of file <a class="el" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html">modular_inverse_fermat_little_theorem.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  122</span>                   {</div>
 <div class="line"><span class="lineno">  123</span>  assert(math::modular_inverse_fermat::modular_inverse(0, 97) == -1);</div>
 <div class="line"><span class="lineno">  124</span>  assert(math::modular_inverse_fermat::modular_inverse(15, -2) == -1);</div>
diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_a1c62a87e79f29b98d8fe5b12eacdd928_cgraph.map b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_a1c62a87e79f29b98d8fe5b12eacdd928_cgraph.map
deleted file mode 100644
index 774e09c30..000000000
--- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_a1c62a87e79f29b98d8fe5b12eacdd928_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="math::modular_inverse_fermat::binExpo" name="math::modular_inverse_fermat::binExpo">
-<area shape="rect" id="Node000001" title="Calculate exponent with modulo using binary exponentiation in &#160;time." alt="" coords="5,22,159,62"/>
-<area shape="rect" id="Node000002" href="$de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73" title=" " alt="" coords="207,29,275,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,40,191,40,191,45,159,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="214,30,208,21,212,11,223,5,241,3,260,5,270,12,268,16,258,10,241,8,224,10,216,15,214,20,218,28"/>
-</map>
diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_a1c62a87e79f29b98d8fe5b12eacdd928_cgraph.md5 b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_a1c62a87e79f29b98d8fe5b12eacdd928_cgraph.md5
deleted file mode 100644
index 955880f8e..000000000
--- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_a1c62a87e79f29b98d8fe5b12eacdd928_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ffd05ce4440be176113734b51fcbbe0c
\ No newline at end of file
diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_a1c62a87e79f29b98d8fe5b12eacdd928_cgraph.svg b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_a1c62a87e79f29b98d8fe5b12eacdd928_cgraph.svg
deleted file mode 100644
index 5a633b0ca..000000000
--- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_a1c62a87e79f29b98d8fe5b12eacdd928_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::modular_inverse_fermat::binExpo Pages: 1 -->
-<svg width="210pt" height="51pt"
- viewBox="0.00 0.00 210.25 50.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 46.88)">
-<title>math::modular_inverse_fermat::binExpo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Calculate exponent with modulo using binary exponentiation in &#160;time.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::modular_inverse</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_fermat::binExpo</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="202.25,-24.88 151,-24.88 151,-5.63 202.25,-5.63 202.25,-24.88"/>
-<text text-anchor="middle" x="176.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">binExpo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.35,-15.25C123.46,-15.25 131.61,-15.25 139.18,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.01,-18.75 149.01,-15.25 139.01,-11.75 139.01,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M157.98,-25.16C149.47,-33.77 155.69,-42.88 176.62,-42.88 188.08,-42.88 195.12,-40.15 197.77,-36.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.21,-35.63 195.61,-26.64 194.38,-37.16 201.21,-35.63"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_a1c62a87e79f29b98d8fe5b12eacdd928_cgraph_org.svg b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_a1c62a87e79f29b98d8fe5b12eacdd928_cgraph_org.svg
deleted file mode 100644
index 9516f1cb9..000000000
--- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_a1c62a87e79f29b98d8fe5b12eacdd928_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::modular_inverse_fermat::binExpo Pages: 1 -->
-<svg width="210pt" height="51pt"
- viewBox="0.00 0.00 210.25 50.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 46.88)">
-<title>math::modular_inverse_fermat::binExpo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Calculate exponent with modulo using binary exponentiation in &#160;time.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::modular_inverse</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_fermat::binExpo</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="202.25,-24.88 151,-24.88 151,-5.63 202.25,-5.63 202.25,-24.88"/>
-<text text-anchor="middle" x="176.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">binExpo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.35,-15.25C123.46,-15.25 131.61,-15.25 139.18,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.01,-18.75 149.01,-15.25 139.01,-11.75 139.01,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M157.98,-25.16C149.47,-33.77 155.69,-42.88 176.62,-42.88 188.08,-42.88 195.12,-40.15 197.77,-36.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.21,-35.63 195.61,-26.64 194.38,-37.16 201.21,-35.63"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_aba4929409fee35c3cb559e962a544b3e_cgraph.map b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_aba4929409fee35c3cb559e962a544b3e_cgraph.map
deleted file mode 100644
index efc5f5452..000000000
--- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_aba4929409fee35c3cb559e962a544b3e_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="math::modular_inverse_fermat::isPrime" name="math::modular_inverse_fermat::isPrime">
-<area shape="rect" id="Node000001" title="Check if an integer is a prime number in &#160;time." alt="" coords="5,29,159,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="52,29,51,19,56,11,66,5,82,3,99,5,109,11,106,16,97,10,82,8,68,10,59,14,56,20,57,28"/>
-</map>
diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_aba4929409fee35c3cb559e962a544b3e_cgraph.md5 b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_aba4929409fee35c3cb559e962a544b3e_cgraph.md5
deleted file mode 100644
index a15166611..000000000
--- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_aba4929409fee35c3cb559e962a544b3e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6bc11f0296ee2fc351d4f5cb6f0ca359
\ No newline at end of file
diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_aba4929409fee35c3cb559e962a544b3e_cgraph.svg b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_aba4929409fee35c3cb559e962a544b3e_cgraph.svg
deleted file mode 100644
index 66becdceb..000000000
--- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_aba4929409fee35c3cb559e962a544b3e_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::modular_inverse_fermat::isPrime Pages: 1 -->
-<svg width="123pt" height="57pt"
- viewBox="0.00 0.00 123.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::modular_inverse_fermat::isPrime</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Check if an integer is a prime number in &#160;time.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::modular_inverse</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_fermat::isPrime</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.12,-30.99C32.96,-40.06 39.76,-48.5 57.5,-48.5 67.2,-48.5 73.63,-45.97 76.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.25,-42.78 77.73,-32.49 73.28,-42.11 80.25,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_aba4929409fee35c3cb559e962a544b3e_cgraph_org.svg b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_aba4929409fee35c3cb559e962a544b3e_cgraph_org.svg
deleted file mode 100644
index 02a240df9..000000000
--- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_aba4929409fee35c3cb559e962a544b3e_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::modular_inverse_fermat::isPrime Pages: 1 -->
-<svg width="123pt" height="57pt"
- viewBox="0.00 0.00 123.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::modular_inverse_fermat::isPrime</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Check if an integer is a prime number in &#160;time.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::modular_inverse</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_fermat::isPrime</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.12,-30.99C32.96,-40.06 39.76,-48.5 57.5,-48.5 67.2,-48.5 73.63,-45.97 76.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.25,-42.78 77.73,-32.49 73.28,-42.11 80.25,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index a62ccb083..000000000
--- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementation." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 0e95d81d4..000000000
--- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7c26bf167d094d5e36710e1d61d5adb7
\ No newline at end of file
diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 3a23c85f7..000000000
--- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementation.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 4e1bcad16..000000000
--- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementation.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae7e807e02c65c6fffd6162b4c66290c2_cgraph.map b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae7e807e02c65c6fffd6162b4c66290c2_cgraph.map
deleted file mode 100644
index 0177d728b..000000000
--- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae7e807e02c65c6fffd6162b4c66290c2_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="math::modular_inverse_fermat::modular_inverse" name="math::modular_inverse_fermat::modular_inverse">
-<area shape="rect" id="Node000001" title="calculates the modular inverse." alt="" coords="5,63,174,104"/>
-<area shape="poly" id="edge5_Node000001_Node000001" title=" " alt="" coords="50,63,48,53,54,44,68,39,90,37,112,39,126,45,123,50,111,44,89,42,70,44,58,48,53,54,55,62"/>
-<area shape="rect" id="Node000002" href="$de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73" title=" " alt="" coords="264,29,332,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="174,64,249,49,250,54,175,69"/>
-<area shape="rect" id="Node000003" href="$d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aba4929409fee35c3cb559e962a544b3e" title="Check if an integer is a prime number in &#160;time." alt="" coords="222,103,375,144"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="175,97,207,103,206,109,174,102"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="263,31,257,21,261,11,275,5,298,3,324,5,337,12,335,17,322,10,298,8,276,10,264,15,262,20,268,27"/>
-<area shape="poly" id="edge4_Node000003_Node000003" title=" " alt="" coords="259,103,257,93,263,84,277,79,298,77,321,79,334,85,332,90,320,84,298,82,279,84,267,88,262,94,264,102"/>
-</map>
diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae7e807e02c65c6fffd6162b4c66290c2_cgraph.md5 b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae7e807e02c65c6fffd6162b4c66290c2_cgraph.md5
deleted file mode 100644
index ff74585e1..000000000
--- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae7e807e02c65c6fffd6162b4c66290c2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cebe99d531236e9949a4458c0aa57b4e
\ No newline at end of file
diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae7e807e02c65c6fffd6162b4c66290c2_cgraph.svg b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae7e807e02c65c6fffd6162b4c66290c2_cgraph.svg
deleted file mode 100644
index 35c192184..000000000
--- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae7e807e02c65c6fffd6162b4c66290c2_cgraph.svg
+++ /dev/null
@@ -1,112 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::modular_inverse_fermat::modular_inverse Pages: 1 -->
-<svg width="285pt" height="112pt"
- viewBox="0.00 0.00 285.25 111.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 107.88)">
-<title>math::modular_inverse_fermat::modular_inverse</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="calculates the modular inverse.">
-<polygon fill="#999999" stroke="#666666" points="126.25,-60.5 0,-60.5 0,-30 126.25,-30 126.25,-60.5"/>
-<text text-anchor="start" x="8" y="-47" font-family="Helvetica,sans-Serif" font-size="10.00">math::modular_inverse</text>
-<text text-anchor="middle" x="63.12" y="-35.75" font-family="Helvetica,sans-Serif" font-size="10.00">_fermat::modular_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.37,-60.99C29.71,-70.06 38.96,-78.5 63.12,-78.5 76.34,-78.5 85.1,-75.97 89.39,-72.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.83,-72.86 90.68,-62.49 85.9,-71.94 92.83,-72.86"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245.38,-85.88 194.12,-85.88 194.12,-66.62 245.38,-66.62 245.38,-85.88"/>
-<text text-anchor="middle" x="219.75" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">binExpo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.57,-57.77C145.78,-61.62 166.25,-65.72 183.02,-69.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.99,-72.45 192.48,-70.98 183.37,-65.59 181.99,-72.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aba4929409fee35c3cb559e962a544b3e" target="_top" xlink:title="Check if an integer is a prime number in &#160;time.">
-<polygon fill="white" stroke="#666666" points="277.25,-30.5 162.25,-30.5 162.25,0 277.25,0 277.25,-30.5"/>
-<text text-anchor="start" x="170.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::modular_inverse</text>
-<text text-anchor="middle" x="219.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_fermat::isPrime</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.57,-33.13C134.55,-31.59 142.74,-30 150.8,-28.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.43,-31.88 160.58,-26.54 150.09,-25.01 151.43,-31.88"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M195.23,-86.16C184.04,-94.77 192.22,-103.88 219.75,-103.88 235.24,-103.88 244.6,-100.99 247.83,-96.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="251.21,-96 244.75,-87.6 244.56,-98.19 251.21,-96"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M192,-30.99C186.33,-40.06 195.58,-48.5 219.75,-48.5 232.97,-48.5 241.72,-45.97 246.02,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="249.46,-42.86 247.3,-32.49 242.52,-41.94 249.46,-42.86"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae7e807e02c65c6fffd6162b4c66290c2_cgraph_org.svg b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae7e807e02c65c6fffd6162b4c66290c2_cgraph_org.svg
deleted file mode 100644
index 9ac5aa94f..000000000
--- a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae7e807e02c65c6fffd6162b4c66290c2_cgraph_org.svg
+++ /dev/null
@@ -1,86 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::modular_inverse_fermat::modular_inverse Pages: 1 -->
-<svg width="285pt" height="112pt"
- viewBox="0.00 0.00 285.25 111.88" 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 107.88)">
-<title>math::modular_inverse_fermat::modular_inverse</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="calculates the modular inverse.">
-<polygon fill="#999999" stroke="#666666" points="126.25,-60.5 0,-60.5 0,-30 126.25,-30 126.25,-60.5"/>
-<text text-anchor="start" x="8" y="-47" font-family="Helvetica,sans-Serif" font-size="10.00">math::modular_inverse</text>
-<text text-anchor="middle" x="63.12" y="-35.75" font-family="Helvetica,sans-Serif" font-size="10.00">_fermat::modular_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.37,-60.99C29.71,-70.06 38.96,-78.5 63.12,-78.5 76.34,-78.5 85.1,-75.97 89.39,-72.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.83,-72.86 90.68,-62.49 85.9,-71.94 92.83,-72.86"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245.38,-85.88 194.12,-85.88 194.12,-66.62 245.38,-66.62 245.38,-85.88"/>
-<text text-anchor="middle" x="219.75" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">binExpo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.57,-57.77C145.78,-61.62 166.25,-65.72 183.02,-69.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.99,-72.45 192.48,-70.98 183.37,-65.59 181.99,-72.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aba4929409fee35c3cb559e962a544b3e" target="_top" xlink:title="Check if an integer is a prime number in &#160;time.">
-<polygon fill="white" stroke="#666666" points="277.25,-30.5 162.25,-30.5 162.25,0 277.25,0 277.25,-30.5"/>
-<text text-anchor="start" x="170.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::modular_inverse</text>
-<text text-anchor="middle" x="219.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_fermat::isPrime</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.57,-33.13C134.55,-31.59 142.74,-30 150.8,-28.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.43,-31.88 160.58,-26.54 150.09,-25.01 151.43,-31.88"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M195.23,-86.16C184.04,-94.77 192.22,-103.88 219.75,-103.88 235.24,-103.88 244.6,-100.99 247.83,-96.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="251.21,-96 244.75,-87.6 244.56,-98.19 251.21,-96"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M192,-30.99C186.33,-40.06 195.58,-48.5 219.75,-48.5 232.97,-48.5 241.72,-45.97 246.02,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="249.46,-42.86 247.3,-32.49 242.52,-41.94 249.46,-42.86"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html
new file mode 100644
index 000000000..bf9400db2
--- /dev/null
+++ b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html
@@ -0,0 +1,215 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/modular_inverse_fermat_little_theorem.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">modular_inverse_fermat_little_theorem.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="preprocessor">#include &lt;cassert&gt;</span>  </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="preprocessor">#include &lt;cstdint&gt;</span>  </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="preprocessor">#include &lt;iostream&gt;</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d50/namespacemodular__inverse__fermat.html">modular_inverse_fermat</a> {</div>
+<div class="foldopen" id="foldopen00067" data-start="{" data-end="}">
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a1c62a87e79f29b98d8fe5b12eacdd928">   67</a></span>std::int64_t <a class="code hl_function" href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73">binExpo</a>(std::int64_t a, std::int64_t b, std::int64_t m) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>  a %= m;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>  std::int64_t res = 1;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>  <span class="keywordflow">while</span> (b &gt; 0) {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordflow">if</span> (b % 2 != 0) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>      res = res * a % m;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    }</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    a = a * a % m;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="comment">// Dividing b by 2 is similar to right shift by 1 bit</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    b &gt;&gt;= 1;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>  }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>  <span class="keywordflow">return</span> res;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00086" data-start="{" data-end="}">
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aba4929409fee35c3cb559e962a544b3e">   86</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aba4929409fee35c3cb559e962a544b3e">isPrime</a>(std::int64_t m) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>  <span class="keywordflow">if</span> (m &lt;= 1) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>  } </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>  <span class="keywordflow">for</span> (std::int64_t i = 2; i * i &lt;= m; i++) {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordflow">if</span> (m % i == 0) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>      <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    }</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>  }</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00103" data-start="{" data-end="}">
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"><a class="line" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae7e807e02c65c6fffd6162b4c66290c2">  103</a></span>std::int64_t <a class="code hl_function" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae7e807e02c65c6fffd6162b4c66290c2">modular_inverse</a>(std::int64_t a, std::int64_t m) {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>  <span class="keywordflow">while</span> (a &lt; 0) {</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    a += m;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>  }</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>  <span class="comment">// Check for invalid cases</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>  <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aba4929409fee35c3cb559e962a544b3e">isPrime</a>(m) || a == 0) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordflow">return</span> -1; <span class="comment">// Invalid input</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>  }</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>  <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73">binExpo</a>(a, m - 2, m);  <span class="comment">// Fermat&#39;s Little Theorem</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>}</div>
+</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>} <span class="comment">// namespace modular_inverse_fermat</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>} <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span> </div>
+<div class="foldopen" id="foldopen00122" data-start="{" data-end="}">
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"><a class="line" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  122</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>  assert(math::modular_inverse_fermat::modular_inverse(0, 97) == -1);</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>  assert(math::modular_inverse_fermat::modular_inverse(15, -2) == -1);</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>  assert(math::modular_inverse_fermat::modular_inverse(3, 10) == -1);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>  assert(math::modular_inverse_fermat::modular_inverse(3, 7) == 5);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>  assert(math::modular_inverse_fermat::modular_inverse(1, 101) == 1);</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>  assert(math::modular_inverse_fermat::modular_inverse(-1337, 285179) == 165519);</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>  assert(math::modular_inverse_fermat::modular_inverse(123456789, 998244353) == 25170271);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>  assert(math::modular_inverse_fermat::modular_inverse(-9876543210, 1000000007) == 784794281);</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>}</div>
+</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
+<div class="foldopen" id="foldopen00137" data-start="{" data-end="}">
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"><a class="line" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  137</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>  <a class="code hl_function" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementation</span></div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>  <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>}</div>
+</div>
+<div class="ttc" id="abinary__exponent_8cpp_html_aeb48dce0725e63d19147944f41843c73"><div class="ttname"><a href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73">binExpo</a></div><div class="ttdeci">int binExpo(int a, int b)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dcf/binary__exponent_8cpp_source.html#l00028">binary_exponent.cpp:28</a></div></div>
+<div class="ttc" id="amodular__inverse__fermat__little__theorem_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> <a href="#l00122">modular_inverse_fermat_little_theorem.cpp:122</a></div></div>
+<div class="ttc" id="amodular__inverse__fermat__little__theorem_8cpp_html_aba4929409fee35c3cb559e962a544b3e"><div class="ttname"><a href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aba4929409fee35c3cb559e962a544b3e">math::modular_inverse_fermat::isPrime</a></div><div class="ttdeci">bool isPrime(std::int64_t m)</div><div class="ttdoc">Check if an integer is a prime number in  time.</div><div class="ttdef"><b>Definition</b> <a href="#l00086">modular_inverse_fermat_little_theorem.cpp:86</a></div></div>
+<div class="ttc" id="amodular__inverse__fermat__little__theorem_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00137">modular_inverse_fermat_little_theorem.cpp:137</a></div></div>
+<div class="ttc" id="amodular__inverse__fermat__little__theorem_8cpp_html_ae7e807e02c65c6fffd6162b4c66290c2"><div class="ttname"><a href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae7e807e02c65c6fffd6162b4c66290c2">math::modular_inverse_fermat::modular_inverse</a></div><div class="ttdeci">std::int64_t modular_inverse(std::int64_t a, std::int64_t m)</div><div class="ttdoc">calculates the modular inverse.</div><div class="ttdef"><b>Definition</b> <a href="#l00103">modular_inverse_fermat_little_theorem.cpp:103</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemodular__inverse__fermat_html"><div class="ttname"><a href="../../d7/d50/namespacemodular__inverse__fermat.html">modular_inverse_fermat</a></div><div class="ttdoc">Calculate modular inverse using Fermat's Little Theorem.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html">modular_inverse_fermat_little_theorem.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/d55/class_cycle_check-members.html b/d8/d55/class_cycle_check-members.html
index bef008453..c4abde651 100644
--- a/d8/d55/class_cycle_check-members.html
+++ b/d8/d55/class_cycle_check-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/d61/class_trie__coll__graph.map b/d8/d61/class_trie__coll__graph.map
index 08280ac42..933d22160 100644
--- a/d8/d61/class_trie__coll__graph.map
+++ b/d8/d61/class_trie__coll__graph.map
@@ -1,6 +1,6 @@
 <map id="Trie" name="Trie">
 <area shape="rect" id="Node000001" title=" " alt="" coords="5,109,49,135"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="30,5,173,46"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="30,5,173,46"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="59,58,47,72,37,90,32,109,26,108,32,88,42,68,55,54"/>
 <area shape="rect" id="Node000003" href="$de/d48/struct_trie_1_1_trie_node.html" title=" " alt="" coords="106,109,210,135"/>
 <area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="96,61,101,84,112,97,126,106,124,111,108,101,96,86,91,62"/>
diff --git a/d8/d61/class_trie__coll__graph.md5 b/d8/d61/class_trie__coll__graph.md5
index c6c9a042e..1d75144b5 100644
--- a/d8/d61/class_trie__coll__graph.md5
+++ b/d8/d61/class_trie__coll__graph.md5
@@ -1 +1 @@
-fb8b0cf95ac5b0bb86c6ba0761090a00
\ No newline at end of file
+e277bbd8c2b6ceaca7976c279f58b5ad
\ No newline at end of file
diff --git a/d8/d61/class_trie__coll__graph.svg b/d8/d61/class_trie__coll__graph.svg
index 4e786c84e..d45416628 100644
--- a/d8/d61/class_trie__coll__graph.svg
+++ b/d8/d61/class_trie__coll__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="125.62,-97 18.88,-97 18.88,-66.5 125.62,-66.5 125.62,-97"/>
 <text text-anchor="start" x="26.88" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Trie</text>
 <text text-anchor="middle" x="72.25" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">::TrieNode &gt;</text>
diff --git a/d8/d61/class_trie__coll__graph_org.svg b/d8/d61/class_trie__coll__graph_org.svg
index c02a8b1e1..e258a9e2c 100644
--- a/d8/d61/class_trie__coll__graph_org.svg
+++ b/d8/d61/class_trie__coll__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="125.62,-97 18.88,-97 18.88,-66.5 125.62,-66.5 125.62,-97"/>
 <text text-anchor="start" x="26.88" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Trie</text>
 <text text-anchor="middle" x="72.25" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">::TrieNode &gt;</text>
diff --git a/d8/d61/radix__sort2_8cpp.html b/d8/d61/radix__sort2_8cpp.html
index 18a32e4c1..6943c8590 100644
--- a/d8/d61/radix__sort2_8cpp.html
+++ b/d8/d61/radix__sort2_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/radix_sort2.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/radix_sort2.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for radix_sort2.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/de0/radix__sort2_8cpp__incl.svg" width="434" height="111"><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">
+</div>
+<p><a href="../../d8/d61/radix__sort2_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -135,10 +154,10 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a98ead7d43b11505398daf9a894f122f9" id="r_a98ead7d43b11505398daf9a894f122f9"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a98ead7d43b11505398daf9a894f122f9">sorting::radix_sort::step_ith</a> (uint16_t cur_digit, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;ar)</td></tr>
+<tr class="memitem:a98ead7d43b11505398daf9a894f122f9" id="r_a98ead7d43b11505398daf9a894f122f9"><td class="memItemLeft" align="right" valign="top">std::vector&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a98ead7d43b11505398daf9a894f122f9">sorting::radix_sort::step_ith</a> (uint16_t cur_digit, const std::vector&lt; uint64_t &gt; &amp;ar)</td></tr>
 <tr class="memdesc:a98ead7d43b11505398daf9a894f122f9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to sort vector according to current digit using stable sorting.  <br /></td></tr>
 <tr class="separator:a98ead7d43b11505398daf9a894f122f9"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae0cfd94fa3765b53d4ec7893ffaee5f8" id="r_ae0cfd94fa3765b53d4ec7893ffaee5f8"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae0cfd94fa3765b53d4ec7893ffaee5f8">sorting::radix_sort::radix</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;ar)</td></tr>
+<tr class="memitem:ae0cfd94fa3765b53d4ec7893ffaee5f8" id="r_ae0cfd94fa3765b53d4ec7893ffaee5f8"><td class="memItemLeft" align="right" valign="top">std::vector&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae0cfd94fa3765b53d4ec7893ffaee5f8">sorting::radix_sort::radix</a> (const std::vector&lt; uint64_t &gt; &amp;ar)</td></tr>
 <tr class="memdesc:ae0cfd94fa3765b53d4ec7893ffaee5f8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to sort vector digit by digit.  <br /></td></tr>
 <tr class="separator:ae0cfd94fa3765b53d4ec7893ffaee5f8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
@@ -155,6 +174,8 @@ Functions</h2></td></tr>
 <p>2) 2nd digit place =&gt; 123, 432, 332, 234, 143</p>
 <p>3) 3rd digit place =&gt; 123, 143, 234, 332, 432</p>
 <p>using count sort at each step, which is stable. stable =&gt; already sorted according to previous digits. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/d61/radix__sort2_8cpp_source.html">radix_sort2.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -173,17 +194,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d61/radix__sort2_8cpp_source.html#l00119">119</a> of file <a class="el" href="../../d8/d61/radix__sort2_8cpp_source.html">radix_sort2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  119</span>           {</div>
 <div class="line"><span class="lineno">  120</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// execute the tests</span></div>
 <div class="line"><span class="lineno">  121</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  122</span>}</div>
-<div class="ttc" id="aradix__sort2_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Function to test the above algorithm.</div><div class="ttdef"><b>Definition</b> radix_sort2.cpp:104</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d61/radix__sort2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="330" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aradix__sort2_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Function to test the above algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d61/radix__sort2_8cpp_source.html#l00104">radix_sort2.cpp:104</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae0cfd94fa3765b53d4ec7893ffaee5f8" name="ae0cfd94fa3765b53d4ec7893ffaee5f8"></a>
@@ -193,9 +211,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; sorting::radix_sort::radix </td>
+          <td class="memname">std::vector&lt; uint64_t &gt; sorting::radix_sort::radix </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>ar</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; uint64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>ar</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -209,33 +227,25 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>sorted vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d61/radix__sort2_8cpp_source.html#l00082">82</a> of file <a class="el" href="../../d8/d61/radix__sort2_8cpp_source.html">radix_sort2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   82</span>                                                         {</div>
 <div class="line"><span class="lineno">   83</span>    uint64_t max_ele =</div>
-<div class="line"><span class="lineno">   84</span>        *<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">max_element</a>(ar.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), ar.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>());  <span class="comment">// returns the max element.</span></div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> temp = ar;</div>
+<div class="line"><span class="lineno">   84</span>        *max_element(ar.begin(), ar.end());  <span class="comment">// returns the max element.</span></div>
+<div class="line"><span class="lineno">   85</span>    std::vector&lt;uint64_t&gt; temp = ar;</div>
 <div class="line"><span class="lineno">   86</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; max_ele / i &gt; 0;</div>
 <div class="line"><span class="lineno">   87</span>         i *= 10) {  <span class="comment">// loop breaks when i &gt; max_ele because no further digits</span></div>
 <div class="line"><span class="lineno">   88</span>                     <span class="comment">// left to makes changes in aray.</span></div>
 <div class="line"><span class="lineno">   89</span>        temp = <a class="code hl_function" href="#a98ead7d43b11505398daf9a894f122f9">step_ith</a>(i, temp);</div>
 <div class="line"><span class="lineno">   90</span>    }</div>
 <div class="line"><span class="lineno">   91</span>    <span class="keywordflow">for</span> (uint64_t i : temp) {</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> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   92</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   93</span>    }</div>
-<div class="line"><span class="lineno">   94</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   94</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   95</span>    <span class="keywordflow">return</span> temp;</div>
 <div class="line"><span class="lineno">   96</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="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="amax_element_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">std::max_element</a></div><div class="ttdeci">T max_element(T... args)</div></div>
-<div class="ttc" id="aradix__sort2_8cpp_html_a98ead7d43b11505398daf9a894f122f9"><div class="ttname"><a href="#a98ead7d43b11505398daf9a894f122f9">sorting::radix_sort::step_ith</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; step_ith(uint16_t cur_digit, const std::vector&lt; uint64_t &gt; &amp;ar)</div><div class="ttdoc">Function to sort vector according to current digit using stable sorting.</div><div class="ttdef"><b>Definition</b> radix_sort2.cpp:51</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d61/radix__sort2_8cpp_ae0cfd94fa3765b53d4ec7893ffaee5f8_cgraph.svg" width="474" height="175"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aradix__sort2_8cpp_html_a98ead7d43b11505398daf9a894f122f9"><div class="ttname"><a href="#a98ead7d43b11505398daf9a894f122f9">sorting::radix_sort::step_ith</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; step_ith(uint16_t cur_digit, const std::vector&lt; uint64_t &gt; &amp;ar)</div><div class="ttdoc">Function to sort vector according to current digit using stable sorting.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d61/radix__sort2_8cpp_source.html#l00051">radix_sort2.cpp:51</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a98ead7d43b11505398daf9a894f122f9" name="a98ead7d43b11505398daf9a894f122f9"></a>
@@ -245,14 +255,14 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; sorting::radix_sort::step_ith </td>
+          <td class="memname">std::vector&lt; uint64_t &gt; sorting::radix_sort::step_ith </td>
           <td>(</td>
           <td class="paramtype">uint16_t</td>          <td class="paramname"><span class="paramname"><em>cur_digit</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>ar</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; uint64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>ar</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -265,10 +275,12 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
-<dl class="section return"><dt>Returns</dt><dd><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> sorted till ith digit </dd></dl>
+<dl class="section return"><dt>Returns</dt><dd>std::vector sorted till ith digit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d61/radix__sort2_8cpp_source.html#l00051">51</a> of file <a class="el" href="../../d8/d61/radix__sort2_8cpp_source.html">radix_sort2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   53</span>                                   {  <span class="comment">// sorting according to current digit.</span></div>
-<div class="line"><span class="lineno">   54</span>    <span class="keywordtype">int</span> n = ar.<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">   55</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a> position(10, 0);</div>
+<div class="line"><span class="lineno">   54</span>    <span class="keywordtype">int</span> n = ar.size();</div>
+<div class="line"><span class="lineno">   55</span>    std::vector&lt;uint32_t&gt; position(10, 0);</div>
 <div class="line"><span class="lineno">   56</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
 <div class="line"><span class="lineno">   57</span>        position[(ar[i] / cur_digit) %</div>
 <div class="line"><span class="lineno">   58</span>                 10]++;  <span class="comment">// counting frequency of 0-9 at cur_digit.</span></div>
@@ -279,7 +291,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   63</span>        position[i] = cur;  <span class="comment">// assingning starting position of 0-9.</span></div>
 <div class="line"><span class="lineno">   64</span>        cur += a;</div>
 <div class="line"><span class="lineno">   65</span>    }</div>
-<div class="line"><span class="lineno">   66</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> temp(n);</div>
+<div class="line"><span class="lineno">   66</span>    std::vector&lt;uint64_t&gt; temp(n);</div>
 <div class="line"><span class="lineno">   67</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
 <div class="line"><span class="lineno">   68</span>        temp[position[(ar[i] / cur_digit) % 10]] =</div>
 <div class="line"><span class="lineno">   69</span>            ar[i];  <span class="comment">// storing ar[i] in ar[i]&#39;s cur_digit expected position of</span></div>
@@ -290,13 +302,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   74</span>    }</div>
 <div class="line"><span class="lineno">   75</span>    <span class="keywordflow">return</span> temp;</div>
 <div class="line"><span class="lineno">   76</span>}</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><!-- 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="../../d8/d61/radix__sort2_8cpp_a98ead7d43b11505398daf9a894f122f9_cgraph.svg" width="300" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -326,25 +332,19 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
 <p>Test 1</p>
 <p>Test 2</p>
-<div class="fragment"><div class="line"><span class="lineno">  104</span>                    {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  105</span><span class="comment">    /// Test 1</span></div>
-<div class="line"><span class="lineno">  106</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> ar1 = {432, 234, 143, 332, 123};</div>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d61/radix__sort2_8cpp_source.html#l00104">104</a> of file <a class="el" href="../../d8/d61/radix__sort2_8cpp_source.html">radix_sort2.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  104</span>                    {</div>
+<div class="line"><span class="lineno">  106</span>    std::vector&lt;uint64_t&gt; ar1 = {432, 234, 143, 332, 123};</div>
 <div class="line"><span class="lineno">  107</span>    ar1 = <a class="code hl_function" href="#ae0cfd94fa3765b53d4ec7893ffaee5f8">sorting::radix_sort::radix</a>(ar1);</div>
-<div class="line"><span class="lineno">  108</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(ar1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), ar1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()));<span class="comment"></span></div>
-<div class="line"><span class="lineno">  109</span><span class="comment">    /// Test 2</span></div>
-<div class="line"><span class="lineno">  110</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> ar2 = {213, 3214, 123, 111, 112, 142,</div>
+<div class="line"><span class="lineno">  108</span>    assert(std::is_sorted(ar1.begin(), ar1.end()));</div>
+<div class="line"><span class="lineno">  110</span>    std::vector&lt;uint64_t&gt; ar2 = {213, 3214, 123, 111, 112, 142,</div>
 <div class="line"><span class="lineno">  111</span>                                 133, 132,  32,  12,  113};</div>
 <div class="line"><span class="lineno">  112</span>    ar2 = <a class="code hl_function" href="#ae0cfd94fa3765b53d4ec7893ffaee5f8">sorting::radix_sort::radix</a>(ar2);</div>
-<div class="line"><span class="lineno">  113</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(ar2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), ar2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()));</div>
+<div class="line"><span class="lineno">  113</span>    assert(std::is_sorted(ar2.begin(), ar2.end()));</div>
 <div class="line"><span class="lineno">  114</span>}</div>
-<div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-<div class="ttc" id="aradix__sort2_8cpp_html_ae0cfd94fa3765b53d4ec7893ffaee5f8"><div class="ttname"><a href="#ae0cfd94fa3765b53d4ec7893ffaee5f8">sorting::radix_sort::radix</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; radix(const std::vector&lt; uint64_t &gt; &amp;ar)</div><div class="ttdoc">Function to sort vector digit by digit.</div><div class="ttdef"><b>Definition</b> radix_sort2.cpp:82</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d61/radix__sort2_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="232" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aradix__sort2_8cpp_html_ae0cfd94fa3765b53d4ec7893ffaee5f8"><div class="ttname"><a href="#ae0cfd94fa3765b53d4ec7893ffaee5f8">sorting::radix_sort::radix</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; radix(const std::vector&lt; uint64_t &gt; &amp;ar)</div><div class="ttdoc">Function to sort vector digit by digit.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d61/radix__sort2_8cpp_source.html#l00082">radix_sort2.cpp:82</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d8/d61/radix__sort2_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d8/d61/radix__sort2_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index ed7861e81..000000000
--- a/d8/d61/radix__sort2_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Function to test the above algorithm." alt="" coords="5,55,56,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="104,5,226,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,56,113,34,115,39,57,61"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="109,55,221,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,65,93,65,93,70,56,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="115,104,215,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="57,74,115,96,113,101,55,79"/>
-</map>
diff --git a/d8/d61/radix__sort2_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d8/d61/radix__sort2_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index a787cf588..000000000
--- a/d8/d61/radix__sort2_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-56027800def1c95f261c062c01382aba
\ No newline at end of file
diff --git a/d8/d61/radix__sort2_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d8/d61/radix__sort2_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index a325c6fe7..000000000
--- a/d8/d61/radix__sort2_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="174pt" height="101pt"
- viewBox="0.00 0.00 173.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the above algorithm.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-56.25 0,-56.25 0,-37 37.75,-37 37.75,-56.25"/>
-<text text-anchor="middle" x="18.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.5,-93.25 73.75,-93.25 73.75,-74 165.5,-74 165.5,-93.25"/>
-<text text-anchor="middle" x="119.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.99,-53.41C50.08,-57.94 66.44,-64.07 81.25,-69.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.68,-72.77 90.27,-73 82.13,-66.21 79.68,-72.77"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161.75,-56.25 77.5,-56.25 77.5,-37 161.75,-37 161.75,-56.25"/>
-<text text-anchor="middle" x="119.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.99,-46.62C46,-46.62 55.87,-46.62 65.93,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.76,-50.13 75.76,-46.63 65.76,-43.13 65.76,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="157.25,-19.25 82,-19.25 82,0 157.25,0 157.25,-19.25"/>
-<text text-anchor="middle" x="119.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.99,-39.84C50.08,-35.31 66.44,-29.18 81.25,-23.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.13,-27.04 90.27,-20.25 79.68,-20.48 82.13,-27.04"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d61/radix__sort2_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d8/d61/radix__sort2_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index 0231f5cf6..000000000
--- a/d8/d61/radix__sort2_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="174pt" height="101pt"
- viewBox="0.00 0.00 173.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the above algorithm.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-56.25 0,-56.25 0,-37 37.75,-37 37.75,-56.25"/>
-<text text-anchor="middle" x="18.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.5,-93.25 73.75,-93.25 73.75,-74 165.5,-74 165.5,-93.25"/>
-<text text-anchor="middle" x="119.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.99,-53.41C50.08,-57.94 66.44,-64.07 81.25,-69.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.68,-72.77 90.27,-73 82.13,-66.21 79.68,-72.77"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161.75,-56.25 77.5,-56.25 77.5,-37 161.75,-37 161.75,-56.25"/>
-<text text-anchor="middle" x="119.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.99,-46.62C46,-46.62 55.87,-46.62 65.93,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.76,-50.13 75.76,-46.63 65.76,-43.13 65.76,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="157.25,-19.25 82,-19.25 82,0 157.25,0 157.25,-19.25"/>
-<text text-anchor="middle" x="119.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.99,-39.84C50.08,-35.31 66.44,-29.18 81.25,-23.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.13,-27.04 90.27,-20.25 79.68,-20.48 82.13,-27.04"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d61/radix__sort2_8cpp_a98ead7d43b11505398daf9a894f122f9_cgraph.map b/d8/d61/radix__sort2_8cpp_a98ead7d43b11505398daf9a894f122f9_cgraph.map
deleted file mode 100644
index a86e654ff..000000000
--- a/d8/d61/radix__sort2_8cpp_a98ead7d43b11505398daf9a894f122f9_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="sorting::radix_sort::step_ith" name="sorting::radix_sort::step_ith">
-<area shape="rect" id="Node000001" title="Function to sort vector according to current digit using stable sorting." alt="" coords="5,29,131,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="36,29,34,19,39,11,51,5,68,3,87,5,98,11,95,16,85,10,68,8,52,10,43,14,39,20,41,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="179,37,294,62"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="131,47,163,47,163,52,131,52"/>
-</map>
diff --git a/d8/d61/radix__sort2_8cpp_a98ead7d43b11505398daf9a894f122f9_cgraph.md5 b/d8/d61/radix__sort2_8cpp_a98ead7d43b11505398daf9a894f122f9_cgraph.md5
deleted file mode 100644
index 56260ccf9..000000000
--- a/d8/d61/radix__sort2_8cpp_a98ead7d43b11505398daf9a894f122f9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9e62c5300cc4e7d102c1b225096a9f12
\ No newline at end of file
diff --git a/d8/d61/radix__sort2_8cpp_a98ead7d43b11505398daf9a894f122f9_cgraph.svg b/d8/d61/radix__sort2_8cpp_a98ead7d43b11505398daf9a894f122f9_cgraph.svg
deleted file mode 100644
index 5e9719cd9..000000000
--- a/d8/d61/radix__sort2_8cpp_a98ead7d43b11505398daf9a894f122f9_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::radix_sort::step_ith Pages: 1 -->
-<svg width="225pt" height="57pt"
- viewBox="0.00 0.00 224.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>sorting::radix_sort::step_ith</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to sort vector according to current digit using stable sorting.">
-<polygon fill="#999999" stroke="#666666" points="94,-30.5 0,-30.5 0,0 94,0 94,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::radix_sort</text>
-<text text-anchor="middle" x="47" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::step_ith</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.63,-30.99C20.06,-40.06 27.52,-48.5 47,-48.5 57.65,-48.5 64.71,-45.97 68.17,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.63,-42.81 69.21,-32.49 64.67,-42.06 71.63,-42.81"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-24.88 130,-24.88 130,-5.63 216.5,-5.63 216.5,-24.88"/>
-<text text-anchor="middle" x="173.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.27,-15.25C102.05,-15.25 110.2,-15.25 118.16,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="118.13,-18.75 128.13,-15.25 118.13,-11.75 118.13,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d61/radix__sort2_8cpp_a98ead7d43b11505398daf9a894f122f9_cgraph_org.svg b/d8/d61/radix__sort2_8cpp_a98ead7d43b11505398daf9a894f122f9_cgraph_org.svg
deleted file mode 100644
index 0af602add..000000000
--- a/d8/d61/radix__sort2_8cpp_a98ead7d43b11505398daf9a894f122f9_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::radix_sort::step_ith Pages: 1 -->
-<svg width="225pt" height="57pt"
- viewBox="0.00 0.00 224.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>sorting::radix_sort::step_ith</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to sort vector according to current digit using stable sorting.">
-<polygon fill="#999999" stroke="#666666" points="94,-30.5 0,-30.5 0,0 94,0 94,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::radix_sort</text>
-<text text-anchor="middle" x="47" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::step_ith</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.63,-30.99C20.06,-40.06 27.52,-48.5 47,-48.5 57.65,-48.5 64.71,-45.97 68.17,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.63,-42.81 69.21,-32.49 64.67,-42.06 71.63,-42.81"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-24.88 130,-24.88 130,-5.63 216.5,-5.63 216.5,-24.88"/>
-<text text-anchor="middle" x="173.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.27,-15.25C102.05,-15.25 110.2,-15.25 118.16,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="118.13,-18.75 128.13,-15.25 118.13,-11.75 118.13,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d61/radix__sort2_8cpp_ae0cfd94fa3765b53d4ec7893ffaee5f8_cgraph.map b/d8/d61/radix__sort2_8cpp_ae0cfd94fa3765b53d4ec7893ffaee5f8_cgraph.map
deleted file mode 100644
index 7459a5d58..000000000
--- a/d8/d61/radix__sort2_8cpp_ae0cfd94fa3765b53d4ec7893ffaee5f8_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="sorting::radix_sort::radix" name="sorting::radix_sort::radix">
-<area shape="rect" id="Node000001" title="Function to sort vector digit by digit." alt="" coords="5,47,131,88"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="35,47,33,37,38,28,50,23,68,21,87,23,98,29,96,34,85,28,68,26,52,28,42,32,38,38,40,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="180,5,302,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="130,47,178,33,180,38,132,52"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="185,55,298,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="131,65,169,65,169,70,131,70"/>
-<area shape="rect" id="Node000004" href="$d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9" title="Function to sort vector according to current digit using stable sorting." alt="" coords="179,128,304,169"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="114,86,184,119,181,124,112,91"/>
-<area shape="poly" id="edge6_Node000004_Node000004" title=" " alt="" coords="209,128,207,119,213,110,224,104,241,102,260,104,271,111,268,115,258,109,241,107,226,109,216,114,213,120,214,127"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="352,136,467,162"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="304,146,336,146,336,152,304,152"/>
-</map>
diff --git a/d8/d61/radix__sort2_8cpp_ae0cfd94fa3765b53d4ec7893ffaee5f8_cgraph.md5 b/d8/d61/radix__sort2_8cpp_ae0cfd94fa3765b53d4ec7893ffaee5f8_cgraph.md5
deleted file mode 100644
index db693d0e4..000000000
--- a/d8/d61/radix__sort2_8cpp_ae0cfd94fa3765b53d4ec7893ffaee5f8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-840724ee42e26fbb5ce4268f1a2a59a3
\ No newline at end of file
diff --git a/d8/d61/radix__sort2_8cpp_ae0cfd94fa3765b53d4ec7893ffaee5f8_cgraph.svg b/d8/d61/radix__sort2_8cpp_ae0cfd94fa3765b53d4ec7893ffaee5f8_cgraph.svg
deleted file mode 100644
index 5e9266256..000000000
--- a/d8/d61/radix__sort2_8cpp_ae0cfd94fa3765b53d4ec7893ffaee5f8_cgraph.svg
+++ /dev/null
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::radix_sort::radix Pages: 1 -->
-<svg width="355pt" height="131pt"
- viewBox="0.00 0.00 354.50 130.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 126.88)">
-<title>sorting::radix_sort::radix</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to sort vector digit by digit.">
-<polygon fill="#999999" stroke="#666666" points="94,-91.5 0,-91.5 0,-61 94,-61 94,-91.5"/>
-<text text-anchor="start" x="8" y="-78" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::radix_sort</text>
-<text text-anchor="middle" x="47" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">::radix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.96,-91.99C19.26,-101.06 26.94,-109.5 47,-109.5 57.97,-109.5 65.24,-106.97 68.8,-103.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.25,-103.81 69.87,-93.49 65.3,-103.05 72.25,-103.81"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222.88,-122.88 131.12,-122.88 131.12,-103.62 222.88,-103.62 222.88,-122.88"/>
-<text text-anchor="middle" x="177" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.21,-89.61C105.93,-93 118.52,-96.63 130.22,-100.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.08,-103.33 139.65,-102.74 131.02,-96.6 129.08,-103.33"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.12,-85.88 134.88,-85.88 134.88,-66.62 219.12,-66.62 219.12,-85.88"/>
-<text text-anchor="middle" x="177" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.21,-76.25C103.58,-76.25 113.5,-76.25 123.08,-76.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.02,-79.75 133.02,-76.25 123.02,-72.75 123.02,-79.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9" target="_top" xlink:title="Function to sort vector according to current digit using stable sorting.">
-<polygon fill="white" stroke="#666666" points="224,-30.5 130,-30.5 130,0 224,0 224,-30.5"/>
-<text text-anchor="start" x="138" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::radix_sort</text>
-<text text-anchor="middle" x="177" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::step_ith</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.96,-60.54C96.79,-53 115.96,-43.86 132.92,-35.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.26,-39.02 141.78,-31.56 131.25,-32.7 134.26,-39.02"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge6_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge6_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.63,-30.99C150.06,-40.06 157.52,-48.5 177,-48.5 187.65,-48.5 194.71,-45.97 198.17,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.63,-42.81 199.21,-32.49 194.67,-42.06 201.63,-42.81"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="346.5,-24.88 260,-24.88 260,-5.63 346.5,-5.63 346.5,-24.88"/>
-<text text-anchor="middle" x="303.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.27,-15.25C232.05,-15.25 240.2,-15.25 248.16,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.13,-18.75 258.13,-15.25 248.13,-11.75 248.13,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d61/radix__sort2_8cpp_ae0cfd94fa3765b53d4ec7893ffaee5f8_cgraph_org.svg b/d8/d61/radix__sort2_8cpp_ae0cfd94fa3765b53d4ec7893ffaee5f8_cgraph_org.svg
deleted file mode 100644
index d4bbddf5c..000000000
--- a/d8/d61/radix__sort2_8cpp_ae0cfd94fa3765b53d4ec7893ffaee5f8_cgraph_org.svg
+++ /dev/null
@@ -1,113 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::radix_sort::radix Pages: 1 -->
-<svg width="355pt" height="131pt"
- viewBox="0.00 0.00 354.50 130.88" 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 126.88)">
-<title>sorting::radix_sort::radix</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to sort vector digit by digit.">
-<polygon fill="#999999" stroke="#666666" points="94,-91.5 0,-91.5 0,-61 94,-61 94,-91.5"/>
-<text text-anchor="start" x="8" y="-78" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::radix_sort</text>
-<text text-anchor="middle" x="47" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">::radix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.96,-91.99C19.26,-101.06 26.94,-109.5 47,-109.5 57.97,-109.5 65.24,-106.97 68.8,-103.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.25,-103.81 69.87,-93.49 65.3,-103.05 72.25,-103.81"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222.88,-122.88 131.12,-122.88 131.12,-103.62 222.88,-103.62 222.88,-122.88"/>
-<text text-anchor="middle" x="177" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.21,-89.61C105.93,-93 118.52,-96.63 130.22,-100.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.08,-103.33 139.65,-102.74 131.02,-96.6 129.08,-103.33"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.12,-85.88 134.88,-85.88 134.88,-66.62 219.12,-66.62 219.12,-85.88"/>
-<text text-anchor="middle" x="177" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.21,-76.25C103.58,-76.25 113.5,-76.25 123.08,-76.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.02,-79.75 133.02,-76.25 123.02,-72.75 123.02,-79.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9" target="_top" xlink:title="Function to sort vector according to current digit using stable sorting.">
-<polygon fill="white" stroke="#666666" points="224,-30.5 130,-30.5 130,0 224,0 224,-30.5"/>
-<text text-anchor="start" x="138" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::radix_sort</text>
-<text text-anchor="middle" x="177" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::step_ith</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.96,-60.54C96.79,-53 115.96,-43.86 132.92,-35.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.26,-39.02 141.78,-31.56 131.25,-32.7 134.26,-39.02"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge6_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge6_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.63,-30.99C150.06,-40.06 157.52,-48.5 177,-48.5 187.65,-48.5 194.71,-45.97 198.17,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.63,-42.81 199.21,-32.49 194.67,-42.06 201.63,-42.81"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="346.5,-24.88 260,-24.88 260,-5.63 346.5,-5.63 346.5,-24.88"/>
-<text text-anchor="middle" x="303.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.27,-15.25C232.05,-15.25 240.2,-15.25 248.16,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.13,-18.75 258.13,-15.25 248.13,-11.75 248.13,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d61/radix__sort2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d61/radix__sort2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 374aa53f6..000000000
--- a/d8/d61/radix__sort2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,55,55,80"/>
-<area shape="rect" id="Node000002" href="$d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Function to test the above algorithm." alt="" coords="103,55,153,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,65,88,65,88,70,55,70"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="201,5,323,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="152,56,210,34,212,39,154,61"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="206,55,318,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="153,65,191,65,191,70,153,70"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="212,104,312,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="154,74,212,96,210,101,152,79"/>
-</map>
diff --git a/d8/d61/radix__sort2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d61/radix__sort2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 140dba9d7..000000000
--- a/d8/d61/radix__sort2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2912b09813e12c11098b17af2c57ed52
\ No newline at end of file
diff --git a/d8/d61/radix__sort2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d61/radix__sort2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 7c116d436..000000000
--- a/d8/d61/radix__sort2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="247pt" height="101pt"
- viewBox="0.00 0.00 246.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Function to test the above algorithm.">
-<polygon fill="white" stroke="#666666" points="110.75,-56.25 73,-56.25 73,-37 110.75,-37 110.75,-56.25"/>
-<text text-anchor="middle" x="91.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-46.62C44.55,-46.62 53.37,-46.62 61.69,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-50.13 71.43,-46.63 61.43,-43.13 61.43,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.5,-93.25 146.75,-93.25 146.75,-74 238.5,-74 238.5,-93.25"/>
-<text text-anchor="middle" x="192.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.99,-53.41C123.08,-57.94 139.44,-64.07 154.25,-69.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.68,-72.77 163.27,-73 155.13,-66.21 152.68,-72.77"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.75,-56.25 150.5,-56.25 150.5,-37 234.75,-37 234.75,-56.25"/>
-<text text-anchor="middle" x="192.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.99,-46.62C119,-46.62 128.87,-46.62 138.93,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.76,-50.13 148.76,-46.63 138.76,-43.13 138.76,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="230.25,-19.25 155,-19.25 155,0 230.25,0 230.25,-19.25"/>
-<text text-anchor="middle" x="192.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.99,-39.84C123.08,-35.31 139.44,-29.18 154.25,-23.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.13,-27.04 163.27,-20.25 152.68,-20.48 155.13,-27.04"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d61/radix__sort2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/d61/radix__sort2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 0ac12ba21..000000000
--- a/d8/d61/radix__sort2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="247pt" height="101pt"
- viewBox="0.00 0.00 246.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Function to test the above algorithm.">
-<polygon fill="white" stroke="#666666" points="110.75,-56.25 73,-56.25 73,-37 110.75,-37 110.75,-56.25"/>
-<text text-anchor="middle" x="91.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-46.62C44.55,-46.62 53.37,-46.62 61.69,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-50.13 71.43,-46.63 61.43,-43.13 61.43,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.5,-93.25 146.75,-93.25 146.75,-74 238.5,-74 238.5,-93.25"/>
-<text text-anchor="middle" x="192.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.99,-53.41C123.08,-57.94 139.44,-64.07 154.25,-69.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.68,-72.77 163.27,-73 155.13,-66.21 152.68,-72.77"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.75,-56.25 150.5,-56.25 150.5,-37 234.75,-37 234.75,-56.25"/>
-<text text-anchor="middle" x="192.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.99,-46.62C119,-46.62 128.87,-46.62 138.93,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.76,-50.13 148.76,-46.63 138.76,-43.13 138.76,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="230.25,-19.25 155,-19.25 155,0 230.25,0 230.25,-19.25"/>
-<text text-anchor="middle" x="192.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.99,-39.84C123.08,-35.31 139.44,-29.18 154.25,-23.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.13,-27.04 163.27,-20.25 152.68,-20.48 155.13,-27.04"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d61/radix__sort2_8cpp_source.html b/d8/d61/radix__sort2_8cpp_source.html
new file mode 100644
index 000000000..eb5f2f962
--- /dev/null
+++ b/d8/d61/radix__sort2_8cpp_source.html
@@ -0,0 +1,218 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/radix_sort2.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/d61/radix__sort2_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">radix_sort2.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/d61/radix__sort2_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;cassert&gt;</span>  </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../da/dda/namespaceradix__sort.html">radix_sort</a> {</div>
+<div class="foldopen" id="foldopen00051" data-start="{" data-end="}">
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="../../d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9">   51</a></span>std::vector&lt;uint64_t&gt; <a class="code hl_function" href="../../d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9">step_ith</a>(</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    uint16_t cur_digit,</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keyword">const</span> std::vector&lt;uint64_t&gt;&amp; ar) {  <span class="comment">// sorting according to current digit.</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordtype">int</span> n = ar.size();</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    std::vector&lt;uint32_t&gt; position(10, 0);</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        position[(ar[i] / cur_digit) %</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>                 10]++;  <span class="comment">// counting frequency of 0-9 at cur_digit.</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    }</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordtype">int</span> cur = 0;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 10; ++i) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordtype">int</span> a = position[i];</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        position[i] = cur;  <span class="comment">// assingning starting position of 0-9.</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        cur += a;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    std::vector&lt;uint64_t&gt; temp(n);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        temp[position[(ar[i] / cur_digit) % 10]] =</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            ar[i];  <span class="comment">// storing ar[i] in ar[i]&#39;s cur_digit expected position of</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>                    <span class="comment">// this step.</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        position[(ar[i] / cur_digit) %</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>                 10]++;  <span class="comment">// incrementing ar[i]&#39;s cur_digit position by 1, as</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>                         <span class="comment">// current place used by ar[i].</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    }</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="keywordflow">return</span> temp;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00082" data-start="{" data-end="}">
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="../../d8/d61/radix__sort2_8cpp.html#ae0cfd94fa3765b53d4ec7893ffaee5f8">   82</a></span>std::vector&lt;uint64_t&gt; <a class="code hl_function" href="../../d8/d61/radix__sort2_8cpp.html#ae0cfd94fa3765b53d4ec7893ffaee5f8">radix</a>(<span class="keyword">const</span> std::vector&lt;uint64_t&gt;&amp; ar) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    uint64_t max_ele =</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        *max_element(ar.begin(), ar.end());  <span class="comment">// returns the max element.</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::vector&lt;uint64_t&gt; temp = ar;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; max_ele / i &gt; 0;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>         i *= 10) {  <span class="comment">// loop breaks when i &gt; max_ele because no further digits</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>                     <span class="comment">// left to makes changes in aray.</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        temp = <a class="code hl_function" href="../../d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9">step_ith</a>(i, temp);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordflow">for</span> (uint64_t i : temp) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    }</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keywordflow">return</span> temp;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>}</div>
+</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>}  <span class="comment">// namespace radix_sort</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="foldopen" id="foldopen00104" data-start="{" data-end="}">
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"><a class="line" href="../../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">  104</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    std::vector&lt;uint64_t&gt; ar1 = {432, 234, 143, 332, 123};</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    ar1 = sorting::radix_sort::radix(ar1);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    assert(std::is_sorted(ar1.begin(), ar1.end()));</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    std::vector&lt;uint64_t&gt; ar2 = {213, 3214, 123, 111, 112, 142,</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>                                 133, 132,  32,  12,  113};</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    ar2 = sorting::radix_sort::radix(ar2);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    assert(std::is_sorted(ar2.begin(), ar2.end()));</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00119" data-start="{" data-end="}">
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"><a class="line" href="../../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  119</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <a class="code hl_function" href="../../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// execute the tests</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>}</div>
+</div>
+<div class="ttc" id="anamespaceradix__sort_html"><div class="ttname"><a href="../../da/dda/namespaceradix__sort.html">radix_sort</a></div><div class="ttdoc">Functions for Radix sort algorithm.</div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+<div class="ttc" id="aradix__sort2_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Function to test the above algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00104">radix_sort2.cpp:104</a></div></div>
+<div class="ttc" id="aradix__sort2_8cpp_html_a98ead7d43b11505398daf9a894f122f9"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9">sorting::radix_sort::step_ith</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; step_ith(uint16_t cur_digit, const std::vector&lt; uint64_t &gt; &amp;ar)</div><div class="ttdoc">Function to sort vector according to current digit using stable sorting.</div><div class="ttdef"><b>Definition</b> <a href="#l00051">radix_sort2.cpp:51</a></div></div>
+<div class="ttc" id="aradix__sort2_8cpp_html_ae0cfd94fa3765b53d4ec7893ffaee5f8"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#ae0cfd94fa3765b53d4ec7893ffaee5f8">sorting::radix_sort::radix</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; radix(const std::vector&lt; uint64_t &gt; &amp;ar)</div><div class="ttdoc">Function to sort vector digit by digit.</div><div class="ttdef"><b>Definition</b> <a href="#l00082">radix_sort2.cpp:82</a></div></div>
+<div class="ttc" id="aradix__sort2_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00119">radix_sort2.cpp:119</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d8/d61/radix__sort2_8cpp.html">radix_sort2.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/d64/namespaceboruvkas__minimum__spanning__tree.html b/d8/d64/namespaceboruvkas__minimum__spanning__tree.html
index 2910f4bb8..df7fadee2 100644
--- a/d8/d64/namespaceboruvkas__minimum__spanning__tree.html
+++ b/d8/d64/namespaceboruvkas__minimum__spanning__tree.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: boruvkas_minimum_spanning_tree Namespace Reference</title>
+<title>TheAlgorithms/C++: boruvkas_minimum_spanning_tree Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/d68/dijkstra_8cpp.html b/d8/d68/dijkstra_8cpp.html
index f8eae6880..b2d695bf6 100644
--- a/d8/d68/dijkstra_8cpp.html
+++ b/d8/d68/dijkstra_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph/dijkstra.cpp File Reference</title>
+<title>TheAlgorithms/C++: graph/dijkstra.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -126,7 +143,9 @@ Include dependency graph for dijkstra.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d5f/dijkstra_8cpp__incl.svg" width="578" height="111"><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">
+</div>
+<p><a href="../../d8/d68/dijkstra_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></td></tr>
@@ -135,10 +154,10 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a0e30e0dca68cb6e4f671440819b35b6a" id="r_a0e30e0dca68cb6e4f671440819b35b6a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a0e30e0dca68cb6e4f671440819b35b6a">graph::addEdge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &gt; *adj, int u, int v, int w)</td></tr>
+<tr class="memitem:a0e30e0dca68cb6e4f671440819b35b6a" id="r_a0e30e0dca68cb6e4f671440819b35b6a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a0e30e0dca68cb6e4f671440819b35b6a">graph::addEdge</a> (std::vector&lt; std::vector&lt; std::pair&lt; int, int &gt; &gt; &gt; *adj, int u, int v, int w)</td></tr>
 <tr class="memdesc:a0e30e0dca68cb6e4f671440819b35b6a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that add edge between two nodes or vertices of graph.  <br /></td></tr>
 <tr class="separator:a0e30e0dca68cb6e4f671440819b35b6a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:adc68cbc8ba09eb1142265935c0d45b84" id="r_adc68cbc8ba09eb1142265935c0d45b84"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84">graph::dijkstra</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &gt; *adj, int s, int t)</td></tr>
+<tr class="memitem:adc68cbc8ba09eb1142265935c0d45b84" id="r_adc68cbc8ba09eb1142265935c0d45b84"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84">graph::dijkstra</a> (std::vector&lt; std::vector&lt; std::pair&lt; int, int &gt; &gt; &gt; *adj, int s, int t)</td></tr>
 <tr class="memdesc:adc68cbc8ba09eb1142265935c0d45b84"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and returns the shortest distance of target from the source.  <br /></td></tr>
 <tr class="separator:adc68cbc8ba09eb1142265935c0d45b84"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a88ec9ad42717780d6caaff9d3d6977f9" id="r_a88ec9ad42717780d6caaff9d3d6977f9"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a> ()</td></tr>
@@ -148,8 +167,7 @@ Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:a330a2b0a904f01802ada1f8f3b28e76c" id="r_a330a2b0a904f01802ada1f8f3b28e76c"><td class="memItemLeft" align="right" valign="top"><a id="a330a2b0a904f01802ada1f8f3b28e76c" name="a330a2b0a904f01802ada1f8f3b28e76c"></a>
-constexpr int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>INF</b> = <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">std::numeric_limits</a>&lt;int64_t&gt;::max()</td></tr>
+<tr class="memitem:a330a2b0a904f01802ada1f8f3b28e76c" id="r_a330a2b0a904f01802ada1f8f3b28e76c"><td class="memItemLeft" align="right" valign="top">constexpr int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a330a2b0a904f01802ada1f8f3b28e76c">INF</a> = std::numeric_limits&lt;int64_t&gt;::max()</td></tr>
 <tr class="separator:a330a2b0a904f01802ada1f8f3b28e76c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -158,6 +176,8 @@ constexpr int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>INF</b>
 <p>Dijkstra's Algorithm is used to find the shortest path from a source vertex to all other reachable vertex in the graph. The algorithm initially assumes all the nodes are unreachable from the given source vertex so we mark the distances of all vertices as INF (infinity) from source vertex (INF / infinity denotes unable to reach).</p>
 <p>in similar fashion with BFS we assume the distance of source vertex as 0 and pushes the vertex in a priority queue with it's distance. we maintain the priority queue as a min heap so that we can get the minimum element at the top of heap</p>
 <p>Basically what we do in this algorithm is that we try to minimize the distances of all the reachable vertices from the current vertex, look at the code below to understand in better way. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/d68/dijkstra_8cpp_source.html">dijkstra.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -174,49 +194,41 @@ constexpr int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>INF</b>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d68/dijkstra_8cpp_source.html#l00152">152</a> of file <a class="el" href="../../d8/d68/dijkstra_8cpp_source.html">dijkstra.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  152</span>           {</div>
 <div class="line"><span class="lineno">  153</span>    <span class="comment">// running predefined tests</span></div>
 <div class="line"><span class="lineno">  154</span>    <a class="code hl_function" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
 <div class="line"><span class="lineno">  155</span> </div>
 <div class="line"><span class="lineno">  156</span>    <span class="keywordtype">int</span> vertices = int(), edges = int();</div>
-<div class="line"><span class="lineno">  157</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the number of vertices : &quot;</span>;</div>
-<div class="line"><span class="lineno">  158</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; vertices;</div>
-<div class="line"><span class="lineno">  159</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the number of edges : &quot;</span>;</div>
-<div class="line"><span class="lineno">  160</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; edges;</div>
+<div class="line"><span class="lineno">  157</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of vertices : &quot;</span>;</div>
+<div class="line"><span class="lineno">  158</span>    std::cin &gt;&gt; vertices;</div>
+<div class="line"><span class="lineno">  159</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of edges : &quot;</span>;</div>
+<div class="line"><span class="lineno">  160</span>    std::cin &gt;&gt; edges;</div>
 <div class="line"><span class="lineno">  161</span> </div>
-<div class="line"><span class="lineno">  162</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::pair&lt;int, int&gt;</a>&gt;&gt; adj(</div>
-<div class="line"><span class="lineno">  163</span>        vertices, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;int, int&gt;</a>&gt;());</div>
+<div class="line"><span class="lineno">  162</span>    std::vector&lt;std::vector&lt;std::pair&lt;int, int&gt;&gt;&gt; adj(</div>
+<div class="line"><span class="lineno">  163</span>        vertices, std::vector&lt;std::pair&lt;int, int&gt;&gt;());</div>
 <div class="line"><span class="lineno">  164</span> </div>
 <div class="line"><span class="lineno">  165</span>    <span class="keywordtype">int</span> u = int(), v = int(), w = int();</div>
 <div class="line"><span class="lineno">  166</span>    <span class="keywordflow">while</span> (edges--) {</div>
-<div class="line"><span class="lineno">  167</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; u &gt;&gt; v &gt;&gt; w;</div>
+<div class="line"><span class="lineno">  167</span>        std::cin &gt;&gt; u &gt;&gt; v &gt;&gt; w;</div>
 <div class="line"><span class="lineno">  168</span>        <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj, u, v, w);</div>
 <div class="line"><span class="lineno">  169</span>    }</div>
 <div class="line"><span class="lineno">  170</span> </div>
 <div class="line"><span class="lineno">  171</span>    <span class="keywordtype">int</span> s = int(), t = int();</div>
-<div class="line"><span class="lineno">  172</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; s &gt;&gt; t;</div>
+<div class="line"><span class="lineno">  172</span>    std::cin &gt;&gt; s &gt;&gt; t;</div>
 <div class="line"><span class="lineno">  173</span>    <span class="keywordtype">int</span> dist = <a class="code hl_function" href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84">graph::dijkstra</a>(&amp;adj, s - 1, t - 1);</div>
 <div class="line"><span class="lineno">  174</span>    <span class="keywordflow">if</span> (dist == -1) {</div>
-<div class="line"><span class="lineno">  175</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Target not reachable from source&quot;</span> &lt;&lt; <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">  175</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Target not reachable from source&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  176</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  177</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Shortest Path Distance : &quot;</span> &lt;&lt; dist &lt;&lt; <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">  177</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Shortest Path Distance : &quot;</span> &lt;&lt; dist &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  178</span>    }</div>
 <div class="line"><span class="lineno">  179</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  180</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="adijkstra_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> dijkstra.cpp:113</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_a9125ceb66bfbec3093bba64c2c1e99e2"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a></div><div class="ttdeci">void addEdge(std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, int v)</div><div class="ttdoc">Function that add edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition</b> connected_components.cpp:46</div></div>
-<div class="ttc" id="anamespacegraph_html_adc68cbc8ba09eb1142265935c0d45b84"><div class="ttname"><a href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84">graph::dijkstra</a></div><div class="ttdeci">int dijkstra(std::vector&lt; std::vector&lt; std::pair&lt; int, int &gt; &gt; &gt; *adj, int s, int t)</div><div class="ttdoc">Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...</div><div class="ttdef"><b>Definition</b> dijkstra.cpp:66</div></div>
-<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="524" height="315"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="adijkstra_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d68/dijkstra_8cpp_source.html#l00113">dijkstra.cpp:113</a></div></div>
+<div class="ttc" id="anamespacegraph_html_a9125ceb66bfbec3093bba64c2c1e99e2"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a></div><div class="ttdeci">void addEdge(std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, int v)</div><div class="ttdoc">Function that add edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition</b> <a href="../../df/ddd/connected__components_8cpp_source.html#l00046">connected_components.cpp:46</a></div></div>
+<div class="ttc" id="anamespacegraph_html_adc68cbc8ba09eb1142265935c0d45b84"><div class="ttname"><a href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84">graph::dijkstra</a></div><div class="ttdeci">int dijkstra(std::vector&lt; std::vector&lt; std::pair&lt; int, int &gt; &gt; &gt; *adj, int s, int t)</div><div class="ttdoc">Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d68/dijkstra_8cpp_source.html#l00066">dijkstra.cpp:66</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a88ec9ad42717780d6caaff9d3d6977f9" name="a88ec9ad42717780d6caaff9d3d6977f9"></a>
@@ -234,11 +246,13 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Function to test the Algorithm </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d68/dijkstra_8cpp_source.html#l00113">113</a> of file <a class="el" href="../../d8/d68/dijkstra_8cpp_source.html">dijkstra.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  113</span>             {</div>
-<div class="line"><span class="lineno">  114</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initiatinig Predefined Tests...&quot;</span> &lt;&lt; <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">  115</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initiating Test 1...&quot;</span> &lt;&lt; <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">  116</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::pair&lt;int, int&gt;</a>&gt;&gt; adj1(</div>
-<div class="line"><span class="lineno">  117</span>        4, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;int, int&gt;</a>&gt;());</div>
+<div class="line"><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiatinig Predefined Tests...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  115</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 1...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  116</span>    std::vector&lt;std::vector&lt;std::pair&lt;int, int&gt;&gt;&gt; adj1(</div>
+<div class="line"><span class="lineno">  117</span>        4, std::vector&lt;std::pair&lt;int, int&gt;&gt;());</div>
 <div class="line"><span class="lineno">  118</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj1, 1, 2, 1);</div>
 <div class="line"><span class="lineno">  119</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj1, 4, 1, 2);</div>
 <div class="line"><span class="lineno">  120</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj1, 2, 3, 2);</div>
@@ -246,15 +260,15 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  122</span> </div>
 <div class="line"><span class="lineno">  123</span>    <span class="keywordtype">int</span> s = 1, t = 3;</div>
 <div class="line"><span class="lineno">  124</span>    assert(<a class="code hl_function" href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84">graph::dijkstra</a>(&amp;adj1, s - 1, t - 1) == 3);</div>
-<div class="line"><span class="lineno">  125</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed...&quot;</span> &lt;&lt; <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">  125</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  126</span> </div>
 <div class="line"><span class="lineno">  127</span>    s = 4, t = 3;</div>
-<div class="line"><span class="lineno">  128</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initiating Test 2...&quot;</span> &lt;&lt; <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">  128</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 2...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  129</span>    assert(<a class="code hl_function" href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84">graph::dijkstra</a>(&amp;adj1, s - 1, t - 1) == 5);</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> &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed...&quot;</span> &lt;&lt; <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">  130</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  131</span> </div>
-<div class="line"><span class="lineno">  132</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::pair&lt;int, int&gt;</a>&gt;&gt; adj2(</div>
-<div class="line"><span class="lineno">  133</span>        5, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;int, int&gt;</a>&gt;());</div>
+<div class="line"><span class="lineno">  132</span>    std::vector&lt;std::vector&lt;std::pair&lt;int, int&gt;&gt;&gt; adj2(</div>
+<div class="line"><span class="lineno">  133</span>        5, std::vector&lt;std::pair&lt;int, int&gt;&gt;());</div>
 <div class="line"><span class="lineno">  134</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 1, 2, 4);</div>
 <div class="line"><span class="lineno">  135</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 1, 3, 2);</div>
 <div class="line"><span class="lineno">  136</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 2, 3, 2);</div>
@@ -266,16 +280,36 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  142</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 3, 4, 4);</div>
 <div class="line"><span class="lineno">  143</span> </div>
 <div class="line"><span class="lineno">  144</span>    s = 1, t = 5;</div>
-<div class="line"><span class="lineno">  145</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initiating Test 3...&quot;</span> &lt;&lt; <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">  145</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 3...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  146</span>    assert(<a class="code hl_function" href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84">graph::dijkstra</a>(&amp;adj2, s - 1, t - 1) == 6);</div>
-<div class="line"><span class="lineno">  147</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed...&quot;</span> &lt;&lt; <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">  148</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All Test Passed...&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  147</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  148</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All Test Passed...&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  149</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg" width="427" height="315"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Variable Documentation</h2>
+<a id="a330a2b0a904f01802ada1f8f3b28e76c" name="a330a2b0a904f01802ada1f8f3b28e76c"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a330a2b0a904f01802ada1f8f3b28e76c">&#9670;&#160;</a></span>INF</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int64_t INF = std::numeric_limits&lt;int64_t&gt;::max()</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">constexpr</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d68/dijkstra_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../d8/d68/dijkstra_8cpp_source.html">dijkstra.cpp</a>.</p>
 
 </div>
 </div>
diff --git a/d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map b/d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
deleted file mode 100644
index ff3c5207c..000000000
--- a/d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,149,56,174"/>
-<area shape="rect" id="Node000002" href="$df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2" title="Function that add edge between two nodes or vertices of graph." alt="" coords="104,100,216,125"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,150,109,129,111,134,57,155"/>
-<area shape="rect" id="Node000003" href="$df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84" title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return..." alt="" coords="108,149,212,174"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,159,93,159,93,164,56,164"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="124,198,196,224"/>
-<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="57,169,111,190,109,195,55,174"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/empty.html#" title=" " alt="" coords="278,5,407,46"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="199,146,214,136,230,116,237,97,245,76,262,56,266,53,269,57,266,60,250,79,242,99,235,119,218,140,202,150"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="289,70,396,96"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="193,146,215,135,238,120,263,105,276,99,278,104,265,109,241,124,217,140,195,151"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/pop.html#" title=" " alt="" coords="264,120,421,145"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="211,151,248,145,249,150,212,156"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/push.html#" title=" " alt="" coords="278,169,407,210"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="212,167,264,175,263,180,211,172"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="285,234,400,260"/>
-<area shape="poly" id="edge7_Node000003_Node000008" title=" " alt="" coords="196,173,217,183,241,202,265,219,279,226,277,230,263,224,238,206,215,188,194,177"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/top.html#" title=" " alt="" coords="266,284,420,309"/>
-<area shape="poly" id="edge8_Node000003_Node000009" title=" " alt="" coords="202,173,218,184,235,207,242,229,249,250,266,270,270,274,267,278,262,274,244,253,237,231,230,209,214,188,199,177"/>
-</map>
diff --git a/d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 b/d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
deleted file mode 100644
index d1e0cf246..000000000
--- a/d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2221263dd126629f7dc03bda250a317e
\ No newline at end of file
diff --git a/d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg b/d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
deleted file mode 100644
index dba976f4e..000000000
--- a/d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
+++ /dev/null
@@ -1,211 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="320pt" height="236pt"
- viewBox="0.00 0.00 320.00 235.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 231.88)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-120.25 0,-120.25 0,-101 37.75,-101 37.75,-120.25"/>
-<text text-anchor="middle" x="18.88" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2" target="_top" xlink:title="Function that add edge between two nodes or vertices of graph.">
-<polygon fill="white" stroke="#666666" points="158,-157.25 73.75,-157.25 73.75,-138 158,-138 158,-157.25"/>
-<text text-anchor="middle" x="115.88" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-117.76C49.59,-122.2 64.66,-128.07 78.42,-133.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.07,-136.66 87.66,-137.03 79.61,-130.14 77.07,-136.66"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84" target="_top" xlink:title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...">
-<polygon fill="white" stroke="#666666" points="154.62,-120.25 77.12,-120.25 77.12,-101 154.62,-101 154.62,-120.25"/>
-<text text-anchor="middle" x="115.88" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::dijkstra</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-110.62C46.1,-110.62 55.76,-110.62 65.53,-110.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.44,-114.13 75.44,-110.63 65.44,-107.13 65.44,-114.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="142.62,-83.25 89.12,-83.25 89.12,-64 142.62,-64 142.62,-83.25"/>
-<text text-anchor="middle" x="115.88" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-103.49C49.59,-99.05 64.66,-93.18 78.42,-87.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.61,-91.11 87.66,-84.22 77.07,-84.59 79.61,-91.11"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="301.12,-227.88 204.88,-227.88 204.88,-197.38 301.12,-197.38 301.12,-227.88"/>
-<text text-anchor="start" x="212.88" y="-214.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
-<text text-anchor="middle" x="253" y="-203.12" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.11,-120.69C150.36,-122.91 154.49,-125.54 158,-128.62 181.35,-149.17 170.44,-168.32 194,-188.62 194.79,-189.31 195.61,-189.98 196.45,-190.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.49,-193.53 204.76,-196.11 198.34,-187.68 194.49,-193.53"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="293.25,-179.25 212.75,-179.25 212.75,-160 293.25,-160 293.25,-179.25"/>
-<text text-anchor="middle" x="253" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.53,-120.67C147.03,-123.11 152.78,-125.83 158,-128.62 174.75,-137.57 176.78,-143.63 194,-151.62 197.1,-153.07 200.35,-154.43 203.66,-155.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.3,-158.95 212.89,-159.03 204.66,-152.36 202.3,-158.95"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312,-142.25 194,-142.25 194,-123 312,-123 312,-142.25"/>
-<text text-anchor="middle" x="253" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.87,-116.81C163.51,-118.22 172.96,-119.76 182.45,-121.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.65,-124.72 192.09,-122.87 182.78,-117.81 181.65,-124.72"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="301.12,-104.88 204.88,-104.88 204.88,-74.38 301.12,-74.38 301.12,-104.88"/>
-<text text-anchor="start" x="212.88" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
-<text text-anchor="middle" x="253" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.87,-104.72C166.83,-102.86 180.32,-100.76 193.36,-98.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="193.82,-102.21 203.16,-97.22 192.74,-95.29 193.82,-102.21"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.25,-56.25 209.75,-56.25 209.75,-37 296.25,-37 296.25,-56.25"/>
-<text text-anchor="middle" x="253" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.12,-100.67C147.48,-98.26 153.02,-95.53 158,-92.62 175.28,-82.55 176.26,-74.86 194,-65.62 197.29,-63.91 200.76,-62.31 204.31,-60.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.55,-64.1 213.64,-57.26 203.05,-57.56 205.55,-64.1"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="310.88,-19.25 195.12,-19.25 195.12,0 310.88,0 310.88,-19.25"/>
-<text text-anchor="middle" x="253" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::top</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.2,-100.67C150.45,-98.44 154.54,-95.77 158,-92.62 182.41,-70.39 168.38,-48.47 194,-27.62 195.1,-26.73 196.25,-25.87 197.44,-25.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.79,-28.32 205.81,-20.38 195.37,-22.21 198.79,-28.32"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg b/d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
deleted file mode 100644
index 0e8e74545..000000000
--- a/d8/d68/dijkstra_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
+++ /dev/null
@@ -1,185 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="320pt" height="236pt"
- viewBox="0.00 0.00 320.00 235.88" 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 231.88)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-120.25 0,-120.25 0,-101 37.75,-101 37.75,-120.25"/>
-<text text-anchor="middle" x="18.88" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2" target="_top" xlink:title="Function that add edge between two nodes or vertices of graph.">
-<polygon fill="white" stroke="#666666" points="158,-157.25 73.75,-157.25 73.75,-138 158,-138 158,-157.25"/>
-<text text-anchor="middle" x="115.88" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-117.76C49.59,-122.2 64.66,-128.07 78.42,-133.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.07,-136.66 87.66,-137.03 79.61,-130.14 77.07,-136.66"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84" target="_top" xlink:title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...">
-<polygon fill="white" stroke="#666666" points="154.62,-120.25 77.12,-120.25 77.12,-101 154.62,-101 154.62,-120.25"/>
-<text text-anchor="middle" x="115.88" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::dijkstra</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-110.62C46.1,-110.62 55.76,-110.62 65.53,-110.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.44,-114.13 75.44,-110.63 65.44,-107.13 65.44,-114.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="142.62,-83.25 89.12,-83.25 89.12,-64 142.62,-64 142.62,-83.25"/>
-<text text-anchor="middle" x="115.88" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-103.49C49.59,-99.05 64.66,-93.18 78.42,-87.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.61,-91.11 87.66,-84.22 77.07,-84.59 79.61,-91.11"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="301.12,-227.88 204.88,-227.88 204.88,-197.38 301.12,-197.38 301.12,-227.88"/>
-<text text-anchor="start" x="212.88" y="-214.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
-<text text-anchor="middle" x="253" y="-203.12" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.11,-120.69C150.36,-122.91 154.49,-125.54 158,-128.62 181.35,-149.17 170.44,-168.32 194,-188.62 194.79,-189.31 195.61,-189.98 196.45,-190.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.49,-193.53 204.76,-196.11 198.34,-187.68 194.49,-193.53"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="293.25,-179.25 212.75,-179.25 212.75,-160 293.25,-160 293.25,-179.25"/>
-<text text-anchor="middle" x="253" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.53,-120.67C147.03,-123.11 152.78,-125.83 158,-128.62 174.75,-137.57 176.78,-143.63 194,-151.62 197.1,-153.07 200.35,-154.43 203.66,-155.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.3,-158.95 212.89,-159.03 204.66,-152.36 202.3,-158.95"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312,-142.25 194,-142.25 194,-123 312,-123 312,-142.25"/>
-<text text-anchor="middle" x="253" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.87,-116.81C163.51,-118.22 172.96,-119.76 182.45,-121.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.65,-124.72 192.09,-122.87 182.78,-117.81 181.65,-124.72"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="301.12,-104.88 204.88,-104.88 204.88,-74.38 301.12,-74.38 301.12,-104.88"/>
-<text text-anchor="start" x="212.88" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
-<text text-anchor="middle" x="253" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.87,-104.72C166.83,-102.86 180.32,-100.76 193.36,-98.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="193.82,-102.21 203.16,-97.22 192.74,-95.29 193.82,-102.21"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.25,-56.25 209.75,-56.25 209.75,-37 296.25,-37 296.25,-56.25"/>
-<text text-anchor="middle" x="253" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.12,-100.67C147.48,-98.26 153.02,-95.53 158,-92.62 175.28,-82.55 176.26,-74.86 194,-65.62 197.29,-63.91 200.76,-62.31 204.31,-60.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.55,-64.1 213.64,-57.26 203.05,-57.56 205.55,-64.1"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="310.88,-19.25 195.12,-19.25 195.12,0 310.88,0 310.88,-19.25"/>
-<text text-anchor="middle" x="253" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::top</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.2,-100.67C150.45,-98.44 154.54,-95.77 158,-92.62 182.41,-70.39 168.38,-48.47 194,-27.62 195.1,-26.73 196.25,-25.87 197.44,-25.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.79,-28.32 205.81,-20.38 195.37,-22.21 198.79,-28.32"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 330136905..000000000
--- a/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,26 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,124,55,149"/>
-<area shape="rect" id="Node000002" href="$df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2" title="Function that add edge between two nodes or vertices of graph." alt="" coords="201,73,313,98"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="43,121,69,100,102,83,144,75,185,74,185,79,144,80,104,88,72,105,46,125"/>
-<area shape="rect" id="Node000003" href="$df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84" title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return..." alt="" coords="206,149,309,174"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,136,191,152,190,157,55,142"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="222,198,293,224"/>
-<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="56,142,207,192,206,197,54,147"/>
-<area shape="rect" id="Node000011" href="$d8/d68/dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" title=" " alt="" coords="103,98,153,124"/>
-<area shape="poly" id="edge10_Node000001_Node000011" title=" " alt="" coords="54,127,87,119,89,124,56,133"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/empty.html#" title=" " alt="" coords="376,5,504,46"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="272,146,311,109,334,81,360,56,365,52,368,56,363,60,338,85,315,113,276,150"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="386,70,494,96"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="280,146,360,105,375,99,377,104,362,109,282,151"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/pop.html#" title=" " alt="" coords="361,120,519,145"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="309,151,346,145,346,150,310,156"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/push.html#" title=" " alt="" coords="376,169,504,210"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="310,167,361,175,360,180,309,172"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="382,234,498,260"/>
-<area shape="poly" id="edge7_Node000003_Node000008" title=" " alt="" coords="293,173,315,183,339,202,363,219,376,226,374,230,360,224,336,206,312,188,291,177"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/top.html#" title=" " alt="" coords="363,284,517,309"/>
-<area shape="poly" id="edge8_Node000003_Node000009" title=" " alt="" coords="299,173,315,184,332,207,339,229,346,250,363,270,368,274,364,278,359,274,342,253,334,231,327,209,311,188,296,177"/>
-<area shape="poly" id="edge11_Node000011_Node000002" title=" " alt="" coords="153,104,185,97,186,102,154,109"/>
-<area shape="poly" id="edge12_Node000011_Node000003" title=" " alt="" coords="155,118,210,140,208,145,153,123"/>
-<area shape="poly" id="edge13_Node000011_Node000010" title=" " alt="" coords="141,123,167,153,203,185,209,189,206,193,199,189,163,157,137,126"/>
-</map>
diff --git a/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 51e3ca322..000000000
--- a/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c5330016e17cc7e92c44fc51975fad8f
\ No newline at end of file
diff --git a/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 624b05576..000000000
--- a/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,256 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="393pt" height="236pt"
- viewBox="0.00 0.00 393.00 235.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 231.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-139.25 0,-139.25 0,-120 37,-120 37,-139.25"/>
-<text text-anchor="middle" x="18.5" y="-125.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2" target="_top" xlink:title="Function that add edge between two nodes or vertices of graph.">
-<polygon fill="white" stroke="#666666" points="231,-177.25 146.75,-177.25 146.75,-158 231,-158 231,-177.25"/>
-<text text-anchor="middle" x="188.88" y="-163.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.48,-139.66C39.49,-148.96 55.85,-162.15 73,-167.62 92.62,-173.88 115.09,-175.09 134.93,-174.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.98,-177.81 144.76,-173.73 134.57,-170.82 134.98,-177.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84" target="_top" xlink:title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...">
-<polygon fill="white" stroke="#666666" points="227.62,-120.25 150.12,-120.25 150.12,-101 227.62,-101 227.62,-120.25"/>
-<text text-anchor="middle" x="188.88" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::dijkstra</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-127.63C61.1,-124.93 104.61,-120.02 138.76,-116.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.88,-119.68 148.43,-115.08 138.1,-112.72 138.88,-119.68"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.62,-83.25 162.12,-83.25 162.12,-64 215.62,-64 215.62,-83.25"/>
-<text text-anchor="middle" x="188.88" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-123.74C64.02,-114.82 115.55,-97.68 150.81,-85.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.82,-89.31 160.2,-82.83 149.61,-82.66 151.82,-89.31"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d8/d68/dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-158.25 73,-158.25 73,-139 110.75,-139 110.75,-158.25"/>
-<text text-anchor="middle" x="91.88" y="-144.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-134.32C44.64,-136.32 53.57,-138.69 61.98,-140.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.91,-144.27 71.48,-143.46 62.71,-137.51 60.91,-144.27"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="374.12,-227.88 277.88,-227.88 277.88,-197.38 374.12,-197.38 374.12,-227.88"/>
-<text text-anchor="start" x="285.88" y="-214.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
-<text text-anchor="middle" x="326" y="-203.12" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.31,-120.68C209.71,-128.18 221.3,-138.8 231,-148.62 247.8,-165.65 247.47,-174.82 267,-188.62 268.36,-189.59 269.77,-190.52 271.21,-191.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.36,-194.4 279.79,-196.23 272.78,-188.29 269.36,-194.4"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="366.25,-179.25 285.75,-179.25 285.75,-160 366.25,-160 366.25,-179.25"/>
-<text text-anchor="middle" x="326" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M206.58,-120.69C221.91,-129.63 245.44,-142.64 267,-151.62 270.56,-153.11 274.29,-154.54 278.07,-155.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="276.71,-159.13 287.3,-159.03 278.96,-152.5 276.71,-159.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385,-142.25 267,-142.25 267,-123 385,-123 385,-142.25"/>
-<text text-anchor="middle" x="326" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M227.87,-116.81C236.51,-118.22 245.96,-119.76 255.45,-121.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.65,-124.72 265.09,-122.87 255.78,-117.81 254.65,-124.72"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="374.12,-104.88 277.88,-104.88 277.88,-74.38 374.12,-74.38 374.12,-104.88"/>
-<text text-anchor="start" x="285.88" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
-<text text-anchor="middle" x="326" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M227.87,-104.72C239.83,-102.86 253.32,-100.76 266.36,-98.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.82,-102.21 276.16,-97.22 265.74,-95.29 266.82,-102.21"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="369.25,-56.25 282.75,-56.25 282.75,-37 369.25,-37 369.25,-56.25"/>
-<text text-anchor="middle" x="326" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M215.12,-100.67C220.48,-98.26 226.02,-95.53 231,-92.62 248.28,-82.55 249.26,-74.86 267,-65.62 270.29,-63.91 273.76,-62.31 277.31,-60.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.55,-64.1 286.64,-57.26 276.05,-57.56 278.55,-64.1"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.88,-19.25 268.12,-19.25 268.12,0 383.88,0 383.88,-19.25"/>
-<text text-anchor="middle" x="326" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::top</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.2,-100.67C223.45,-98.44 227.54,-95.77 231,-92.62 255.41,-70.39 241.38,-48.47 267,-27.62 268.1,-26.73 269.25,-25.87 270.44,-25.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="271.79,-28.32 278.81,-20.38 268.37,-22.21 271.79,-28.32"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node2 -->
-<g id="edge11_Node000011_Node000002" class="edge">
-<title>Node11&#45;&gt;Node2</title>
-<g id="a_edge11_Node000011_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.19,-152.29C118.24,-153.7 126.7,-155.39 135.37,-157.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.42,-160.5 144.91,-159.03 135.79,-153.64 134.42,-160.5"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node3 -->
-<g id="edge12_Node000011_Node000003" class="edge">
-<title>Node11&#45;&gt;Node3</title>
-<g id="a_edge12_Node000011_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.19,-141.3C122.88,-136.62 138.41,-130.41 152.44,-124.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.4,-128.18 161.39,-121.22 150.8,-121.69 153.4,-128.18"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node10 -->
-<g id="edge13_Node000011_Node000010" class="edge">
-<title>Node11&#45;&gt;Node10</title>
-<g id="a_edge13_Node000011_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.28,-138.59C109.86,-126.2 127.59,-105.1 146.75,-91.62 148.33,-90.52 149.98,-89.45 151.69,-88.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.21,-91.59 160.45,-83.85 149.97,-85.39 153.21,-91.59"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 04da8bdff..000000000
--- a/d8/d68/dijkstra_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,230 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="393pt" height="236pt"
- viewBox="0.00 0.00 393.00 235.88" 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 231.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-139.25 0,-139.25 0,-120 37,-120 37,-139.25"/>
-<text text-anchor="middle" x="18.5" y="-125.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2" target="_top" xlink:title="Function that add edge between two nodes or vertices of graph.">
-<polygon fill="white" stroke="#666666" points="231,-177.25 146.75,-177.25 146.75,-158 231,-158 231,-177.25"/>
-<text text-anchor="middle" x="188.88" y="-163.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.48,-139.66C39.49,-148.96 55.85,-162.15 73,-167.62 92.62,-173.88 115.09,-175.09 134.93,-174.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.98,-177.81 144.76,-173.73 134.57,-170.82 134.98,-177.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84" target="_top" xlink:title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...">
-<polygon fill="white" stroke="#666666" points="227.62,-120.25 150.12,-120.25 150.12,-101 227.62,-101 227.62,-120.25"/>
-<text text-anchor="middle" x="188.88" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::dijkstra</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-127.63C61.1,-124.93 104.61,-120.02 138.76,-116.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.88,-119.68 148.43,-115.08 138.1,-112.72 138.88,-119.68"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.62,-83.25 162.12,-83.25 162.12,-64 215.62,-64 215.62,-83.25"/>
-<text text-anchor="middle" x="188.88" y="-69.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-123.74C64.02,-114.82 115.55,-97.68 150.81,-85.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.82,-89.31 160.2,-82.83 149.61,-82.66 151.82,-89.31"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d8/d68/dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-158.25 73,-158.25 73,-139 110.75,-139 110.75,-158.25"/>
-<text text-anchor="middle" x="91.88" y="-144.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-134.32C44.64,-136.32 53.57,-138.69 61.98,-140.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.91,-144.27 71.48,-143.46 62.71,-137.51 60.91,-144.27"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="374.12,-227.88 277.88,-227.88 277.88,-197.38 374.12,-197.38 374.12,-227.88"/>
-<text text-anchor="start" x="285.88" y="-214.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
-<text text-anchor="middle" x="326" y="-203.12" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M201.31,-120.68C209.71,-128.18 221.3,-138.8 231,-148.62 247.8,-165.65 247.47,-174.82 267,-188.62 268.36,-189.59 269.77,-190.52 271.21,-191.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.36,-194.4 279.79,-196.23 272.78,-188.29 269.36,-194.4"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="366.25,-179.25 285.75,-179.25 285.75,-160 366.25,-160 366.25,-179.25"/>
-<text text-anchor="middle" x="326" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M206.58,-120.69C221.91,-129.63 245.44,-142.64 267,-151.62 270.56,-153.11 274.29,-154.54 278.07,-155.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="276.71,-159.13 287.3,-159.03 278.96,-152.5 276.71,-159.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385,-142.25 267,-142.25 267,-123 385,-123 385,-142.25"/>
-<text text-anchor="middle" x="326" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M227.87,-116.81C236.51,-118.22 245.96,-119.76 255.45,-121.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.65,-124.72 265.09,-122.87 255.78,-117.81 254.65,-124.72"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="374.12,-104.88 277.88,-104.88 277.88,-74.38 374.12,-74.38 374.12,-104.88"/>
-<text text-anchor="start" x="285.88" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
-<text text-anchor="middle" x="326" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M227.87,-104.72C239.83,-102.86 253.32,-100.76 266.36,-98.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.82,-102.21 276.16,-97.22 265.74,-95.29 266.82,-102.21"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="369.25,-56.25 282.75,-56.25 282.75,-37 369.25,-37 369.25,-56.25"/>
-<text text-anchor="middle" x="326" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M215.12,-100.67C220.48,-98.26 226.02,-95.53 231,-92.62 248.28,-82.55 249.26,-74.86 267,-65.62 270.29,-63.91 273.76,-62.31 277.31,-60.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.55,-64.1 286.64,-57.26 276.05,-57.56 278.55,-64.1"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.88,-19.25 268.12,-19.25 268.12,0 383.88,0 383.88,-19.25"/>
-<text text-anchor="middle" x="326" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::top</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.2,-100.67C223.45,-98.44 227.54,-95.77 231,-92.62 255.41,-70.39 241.38,-48.47 267,-27.62 268.1,-26.73 269.25,-25.87 270.44,-25.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="271.79,-28.32 278.81,-20.38 268.37,-22.21 271.79,-28.32"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node2 -->
-<g id="edge11_Node000011_Node000002" class="edge">
-<title>Node11&#45;&gt;Node2</title>
-<g id="a_edge11_Node000011_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.19,-152.29C118.24,-153.7 126.7,-155.39 135.37,-157.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.42,-160.5 144.91,-159.03 135.79,-153.64 134.42,-160.5"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node3 -->
-<g id="edge12_Node000011_Node000003" class="edge">
-<title>Node11&#45;&gt;Node3</title>
-<g id="a_edge12_Node000011_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.19,-141.3C122.88,-136.62 138.41,-130.41 152.44,-124.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.4,-128.18 161.39,-121.22 150.8,-121.69 153.4,-128.18"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node10 -->
-<g id="edge13_Node000011_Node000010" class="edge">
-<title>Node11&#45;&gt;Node10</title>
-<g id="a_edge13_Node000011_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.28,-138.59C109.86,-126.2 127.59,-105.1 146.75,-91.62 148.33,-90.52 149.98,-89.45 151.69,-88.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.21,-91.59 160.45,-83.85 149.97,-85.39 153.21,-91.59"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d68/dijkstra_8cpp_source.html b/d8/d68/dijkstra_8cpp_source.html
new file mode 100644
index 000000000..e2d09cb25
--- /dev/null
+++ b/d8/d68/dijkstra_8cpp_source.html
@@ -0,0 +1,270 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/dijkstra.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/d68/dijkstra_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">dijkstra.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/d68/dijkstra_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;limits&gt;</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;memory&gt;</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;queue&gt;</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;utility&gt;</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keyword">constexpr</span> int64_t <a class="code hl_variable" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a> = std::numeric_limits&lt;int64_t&gt;::max();</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> {</div>
+<div class="foldopen" id="foldopen00048" data-start="{" data-end="}">
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="../../df/dce/namespacegraph.html#a0e30e0dca68cb6e4f671440819b35b6a">   48</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">addEdge</a>(std::vector&lt;std::vector&lt;std::pair&lt;int, int&gt;&gt;&gt; *adj, <span class="keywordtype">int</span> u, <span class="keywordtype">int</span> v,</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>             <span class="keywordtype">int</span> w) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    (*adj)[u - 1].push_back(std::make_pair(v - 1, w));</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="comment">// (*adj)[v - 1].push_back(std::make_pair(u - 1, w));</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>}</div>
+</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="foldopen" id="foldopen00066" data-start="{" data-end="}">
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"><a class="line" href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84">   66</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84">dijkstra</a>(std::vector&lt;std::vector&lt;std::pair&lt;int, int&gt;&gt;&gt; *adj, <span class="keywordtype">int</span> s, <span class="keywordtype">int</span> t) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keywordtype">int</span> n = adj-&gt;size();</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::vector&lt;int64_t&gt; dist(n, <a class="code hl_variable" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a>);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    std::priority_queue&lt;std::pair&lt;int, int&gt;, std::vector&lt;std::pair&lt;int, int&gt;&gt;,</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>                        std::greater&lt;std::pair&lt;int, int&gt;&gt;&gt;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        pq;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    pq.push(std::make_pair(0, s));</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    dist[s] = 0;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordflow">while</span> (!pq.empty()) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        <span class="keywordtype">int</span> currentNode = pq.top().second;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        <span class="keywordtype">int</span> currentDist = pq.top().first;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        pq.pop();</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        <span class="keywordflow">for</span> (std::pair&lt;int, int&gt; edge : (*adj)[currentNode]) {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>            <span class="keywordflow">if</span> (currentDist + edge.second &lt; dist[edge.first]) {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>                dist[edge.first] = currentDist + edge.second;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>                pq.push(std::make_pair(dist[edge.first], edge.first));</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>            }</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        }</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    }</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="keywordflow">if</span> (dist[t] != <a class="code hl_variable" href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a>) {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="keywordflow">return</span> dist[t];</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    }</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>}</div>
+</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>}  <span class="comment">// namespace graph</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="foldopen" id="foldopen00113" data-start="{" data-end="}">
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"><a class="line" href="../../d8/d68/dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">  113</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d68/dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>() {</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiatinig Predefined Tests...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 1...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::vector&lt;std::vector&lt;std::pair&lt;int, int&gt;&gt;&gt; adj1(</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        4, std::vector&lt;std::pair&lt;int, int&gt;&gt;());</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj1, 1, 2, 1);</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj1, 4, 1, 2);</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj1, 2, 3, 2);</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj1, 1, 3, 5);</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span> </div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    <span class="keywordtype">int</span> s = 1, t = 3;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    assert(<a class="code hl_function" href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84">graph::dijkstra</a>(&amp;adj1, s - 1, t - 1) == 3);</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    s = 4, t = 3;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 2...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    assert(<a class="code hl_function" href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84">graph::dijkstra</a>(&amp;adj1, s - 1, t - 1) == 5);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    std::vector&lt;std::vector&lt;std::pair&lt;int, int&gt;&gt;&gt; adj2(</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        5, std::vector&lt;std::pair&lt;int, int&gt;&gt;());</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 1, 2, 4);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 1, 3, 2);</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 2, 3, 2);</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 3, 2, 1);</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 2, 4, 2);</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 3, 5, 4);</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 5, 4, 1);</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 2, 5, 3);</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 3, 4, 4);</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span> </div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    s = 1, t = 5;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 3...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    assert(<a class="code hl_function" href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84">graph::dijkstra</a>(&amp;adj2, s - 1, t - 1) == 6);</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All Test Passed...&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>}</div>
+</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
+<div class="foldopen" id="foldopen00152" data-start="{" data-end="}">
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"><a class="line" href="../../d8/d68/dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  152</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d68/dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    <span class="comment">// running predefined tests</span></div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <a class="code hl_function" href="../../d8/d68/dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span> </div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    <span class="keywordtype">int</span> vertices = int(), edges = int();</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of vertices : &quot;</span>;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    std::cin &gt;&gt; vertices;</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of edges : &quot;</span>;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    std::cin &gt;&gt; edges;</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span> </div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    std::vector&lt;std::vector&lt;std::pair&lt;int, int&gt;&gt;&gt; adj(</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        vertices, std::vector&lt;std::pair&lt;int, int&gt;&gt;());</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span> </div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    <span class="keywordtype">int</span> u = int(), v = int(), w = int();</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    <span class="keywordflow">while</span> (edges--) {</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>        std::cin &gt;&gt; u &gt;&gt; v &gt;&gt; w;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj, u, v, w);</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    }</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span> </div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    <span class="keywordtype">int</span> s = int(), t = int();</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    std::cin &gt;&gt; s &gt;&gt; t;</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    <span class="keywordtype">int</span> dist = <a class="code hl_function" href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84">graph::dijkstra</a>(&amp;adj, s - 1, t - 1);</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    <span class="keywordflow">if</span> (dist == -1) {</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Target not reachable from source&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Shortest Path Distance : &quot;</span> &lt;&lt; dist &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    }</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>}</div>
+</div>
+<div class="ttc" id="abidirectional__dijkstra_8cpp_html_a330a2b0a904f01802ada1f8f3b28e76c"><div class="ttname"><a href="../../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a></div><div class="ttdeci">constexpr int64_t INF</div><div class="ttdoc">for assert</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d07/bidirectional__dijkstra_8cpp_source.html#l00024">bidirectional_dijkstra.cpp:24</a></div></div>
+<div class="ttc" id="adijkstra_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d8/d68/dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="#l00113">dijkstra.cpp:113</a></div></div>
+<div class="ttc" id="adijkstra_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d68/dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00152">dijkstra.cpp:152</a></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 class="ttc" id="anamespacegraph_html_a9125ceb66bfbec3093bba64c2c1e99e2"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a></div><div class="ttdeci">void addEdge(std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, int v)</div><div class="ttdoc">Function that add edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition</b> <a href="../../df/ddd/connected__components_8cpp_source.html#l00046">connected_components.cpp:46</a></div></div>
+<div class="ttc" id="anamespacegraph_html_adc68cbc8ba09eb1142265935c0d45b84"><div class="ttname"><a href="../../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84">graph::dijkstra</a></div><div class="ttdeci">int dijkstra(std::vector&lt; std::vector&lt; std::pair&lt; int, int &gt; &gt; &gt; *adj, int s, int t)</div><div class="ttdoc">Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...</div><div class="ttdef"><b>Definition</b> <a href="#l00066">dijkstra.cpp:66</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a class="el" href="../../d8/d68/dijkstra_8cpp.html">dijkstra.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/d69/classgraph_1_1_h_k_graph.html b/d8/d69/classgraph_1_1_h_k_graph.html
index 8c4f2185d..926f3520f 100644
--- a/d8/d69/classgraph_1_1_h_k_graph.html
+++ b/d8/d69/classgraph_1_1_h_k_graph.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph::HKGraph Class Reference</title>
+<title>TheAlgorithms/C++: graph::HKGraph Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -154,25 +171,23 @@ Private Attributes</h2></td></tr>
 <tr class="separator:ae6d069bd16d6eafa6e08c7e5f735eda6"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a44742cb9cfecd1a4493970af9b8bbb15" id="r_a44742cb9cfecd1a4493970af9b8bbb15"><td class="memItemLeft" align="right" valign="top">const int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a44742cb9cfecd1a4493970af9b8bbb15">INF</a> {INT_MAX}</td></tr>
 <tr class="separator:a44742cb9cfecd1a4493970af9b8bbb15"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a35893def7a1c5cd60907b4893117796f" id="r_a35893def7a1c5cd60907b4893117796f"><td class="memItemLeft" align="right" valign="top"><a id="a35893def7a1c5cd60907b4893117796f" name="a35893def7a1c5cd60907b4893117796f"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>adj</b></td></tr>
-<tr class="memdesc:a35893def7a1c5cd60907b4893117796f"><td class="mdescLeft">&#160;</td><td class="mdescRight">adj[u] stores adjacents of left side and 0 is used for dummy vertex <br /></td></tr>
+<tr class="memitem:a35893def7a1c5cd60907b4893117796f" id="r_a35893def7a1c5cd60907b4893117796f"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::list&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a35893def7a1c5cd60907b4893117796f">adj</a></td></tr>
+<tr class="memdesc:a35893def7a1c5cd60907b4893117796f"><td class="mdescLeft">&#160;</td><td class="mdescRight">adj[u] stores adjacents of left side and 0 is used for dummy vertex  <br /></td></tr>
 <tr class="separator:a35893def7a1c5cd60907b4893117796f"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a86ebff8a70cbfedd05281993d5d1987b" id="r_a86ebff8a70cbfedd05281993d5d1987b"><td class="memItemLeft" align="right" valign="top"><a id="a86ebff8a70cbfedd05281993d5d1987b" name="a86ebff8a70cbfedd05281993d5d1987b"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>pair_u</b></td></tr>
-<tr class="memdesc:a86ebff8a70cbfedd05281993d5d1987b"><td class="mdescLeft">&#160;</td><td class="mdescRight">value of vertex 'u' ranges from 1 to m <br /></td></tr>
+<tr class="memitem:a86ebff8a70cbfedd05281993d5d1987b" id="r_a86ebff8a70cbfedd05281993d5d1987b"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a86ebff8a70cbfedd05281993d5d1987b">pair_u</a></td></tr>
+<tr class="memdesc:a86ebff8a70cbfedd05281993d5d1987b"><td class="mdescLeft">&#160;</td><td class="mdescRight">value of vertex 'u' ranges from 1 to m  <br /></td></tr>
 <tr class="separator:a86ebff8a70cbfedd05281993d5d1987b"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a976ee239402cc2726a280e781c706d77" id="r_a976ee239402cc2726a280e781c706d77"><td class="memItemLeft" align="right" valign="top"><a id="a976ee239402cc2726a280e781c706d77" name="a976ee239402cc2726a280e781c706d77"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>pair_v</b></td></tr>
-<tr class="memdesc:a976ee239402cc2726a280e781c706d77"><td class="mdescLeft">&#160;</td><td class="mdescRight">value of vertex 'v' ranges from 1 to n <br /></td></tr>
+<tr class="memitem:a976ee239402cc2726a280e781c706d77" id="r_a976ee239402cc2726a280e781c706d77"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a976ee239402cc2726a280e781c706d77">pair_v</a></td></tr>
+<tr class="memdesc:a976ee239402cc2726a280e781c706d77"><td class="mdescLeft">&#160;</td><td class="mdescRight">value of vertex 'v' ranges from 1 to n  <br /></td></tr>
 <tr class="separator:a976ee239402cc2726a280e781c706d77"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a6a0228bbba3818447fcf6b56128b552a" id="r_a6a0228bbba3818447fcf6b56128b552a"><td class="memItemLeft" align="right" valign="top"><a id="a6a0228bbba3818447fcf6b56128b552a" name="a6a0228bbba3818447fcf6b56128b552a"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>dist</b></td></tr>
-<tr class="memdesc:a6a0228bbba3818447fcf6b56128b552a"><td class="mdescLeft">&#160;</td><td class="mdescRight">dist represents the distance between vertex 'u' and vertex 'v' <br /></td></tr>
+<tr class="memitem:a6a0228bbba3818447fcf6b56128b552a" id="r_a6a0228bbba3818447fcf6b56128b552a"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6a0228bbba3818447fcf6b56128b552a">dist</a></td></tr>
+<tr class="memdesc:a6a0228bbba3818447fcf6b56128b552a"><td class="mdescLeft">&#160;</td><td class="mdescRight">dist represents the distance between vertex 'u' and vertex 'v'  <br /></td></tr>
 <tr class="separator:a6a0228bbba3818447fcf6b56128b552a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Represents Bipartite graph for Hopcroft Karp implementation. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00066">66</a> of file <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html">hopcroft_karp.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a0da5aa674d3b3e54a38251ee60d7cd64" name="a0da5aa674d3b3e54a38251ee60d7cd64"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0da5aa674d3b3e54a38251ee60d7cd64">&#9670;&#160;</a></span>HKGraph()</h2>
@@ -201,15 +216,16 @@ Private Attributes</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00231">231</a> of file <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html">hopcroft_karp.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  231</span>                             {</div>
 <div class="line"><span class="lineno">  232</span>    this-&gt;<a class="code hl_variable" href="#a3d9101e3b4598159005fd028b9b0ff74">m</a> = <a class="code hl_variable" href="#a3d9101e3b4598159005fd028b9b0ff74">m</a>;</div>
 <div class="line"><span class="lineno">  233</span>    this-&gt;<a class="code hl_variable" href="#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a> = <a class="code hl_variable" href="#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a>;</div>
-<div class="line"><span class="lineno">  234</span>    <a class="code hl_variable" href="#a35893def7a1c5cd60907b4893117796f">adj</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::list&lt;int&gt;</a> &gt;(<a class="code hl_variable" href="#a3d9101e3b4598159005fd028b9b0ff74">m</a> + 1);</div>
+<div class="line"><span class="lineno">  234</span>    <a class="code hl_variable" href="#a35893def7a1c5cd60907b4893117796f">adj</a> = std::vector&lt;std::list&lt;int&gt; &gt;(<a class="code hl_variable" href="#a3d9101e3b4598159005fd028b9b0ff74">m</a> + 1);</div>
 <div class="line"><span class="lineno">  235</span>}</div>
-<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a35893def7a1c5cd60907b4893117796f"><div class="ttname"><a href="#a35893def7a1c5cd60907b4893117796f">graph::HKGraph::adj</a></div><div class="ttdeci">std::vector&lt; std::list&lt; int &gt; &gt; adj</div><div class="ttdoc">adj[u] stores adjacents of left side and 0 is used for dummy vertex</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:73</div></div>
-<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a3d9101e3b4598159005fd028b9b0ff74"><div class="ttname"><a href="#a3d9101e3b4598159005fd028b9b0ff74">graph::HKGraph::m</a></div><div class="ttdeci">int m</div><div class="ttdoc">m is the number of vertices on left side of Bipartite Graph</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:68</div></div>
-<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a6f5a9fdbb83ef731d739ba6707e21c3c"><div class="ttname"><a href="#a6f5a9fdbb83ef731d739ba6707e21c3c">graph::HKGraph::n</a></div><div class="ttdeci">int n</div><div class="ttdoc">n is the number of vertices on right side of Bipartite Graph</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:69</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 class="ttc" id="aclassgraph_1_1_h_k_graph_html_a35893def7a1c5cd60907b4893117796f"><div class="ttname"><a href="#a35893def7a1c5cd60907b4893117796f">graph::HKGraph::adj</a></div><div class="ttdeci">std::vector&lt; std::list&lt; int &gt; &gt; adj</div><div class="ttdoc">adj[u] stores adjacents of left side and 0 is used for dummy vertex</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00073">hopcroft_karp.cpp:73</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a3d9101e3b4598159005fd028b9b0ff74"><div class="ttname"><a href="#a3d9101e3b4598159005fd028b9b0ff74">graph::HKGraph::m</a></div><div class="ttdeci">int m</div><div class="ttdoc">m is the number of vertices on left side of Bipartite Graph</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00068">hopcroft_karp.cpp:68</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a6f5a9fdbb83ef731d739ba6707e21c3c"><div class="ttname"><a href="#a6f5a9fdbb83ef731d739ba6707e21c3c">graph::HKGraph::n</a></div><div class="ttdeci">int n</div><div class="ttdoc">n is the number of vertices on right side of Bipartite Graph</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00069">hopcroft_karp.cpp:69</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -241,16 +257,12 @@ Private Attributes</h2></td></tr>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">  243</span>{</div>
-<div class="line"><span class="lineno">  244</span>    <a class="code hl_variable" href="#a35893def7a1c5cd60907b4893117796f">adj</a>[u].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(v); <span class="comment">// Add v to u’s list.</span></div>
-<div class="line"><span class="lineno">  245</span>}</div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-</div><!-- 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="../../d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.svg" width="388" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00242">242</a> of file <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html">hopcroft_karp.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  243</span>{</div>
+<div class="line"><span class="lineno">  244</span>    <a class="code hl_variable" href="#a35893def7a1c5cd60907b4893117796f">adj</a>[u].push_back(v); <span class="comment">// Add v to u’s list.</span></div>
+<div class="line"><span class="lineno">  245</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7491add14d9fc04f679114ca6d6f0f93" name="a7491add14d9fc04f679114ca6d6f0f93"></a>
@@ -272,8 +284,10 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if there is an augmenting path available </dd>
 <dd>
 <code>false</code> if there is no augmenting path available </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00133">133</a> of file <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html">hopcroft_karp.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  134</span>{</div>
-<div class="line"><span class="lineno">  135</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue&lt;int&gt;</a> q; <span class="comment">// an integer queue for bfs</span></div>
+<div class="line"><span class="lineno">  135</span>    std::queue&lt;int&gt; q; <span class="comment">// an integer queue for bfs</span></div>
 <div class="line"><span class="lineno">  136</span> </div>
 <div class="line"><span class="lineno">  137</span>    <span class="comment">// First layer of vertices (set distance as 0)</span></div>
 <div class="line"><span class="lineno">  138</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> u = 1; u &lt;= <a class="code hl_variable" href="#a3d9101e3b4598159005fd028b9b0ff74">m</a>; u++)</div>
@@ -304,7 +318,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  163</span>        {</div>
 <div class="line"><span class="lineno">  164</span>            <span class="comment">// Get all the adjacent vertices of the dequeued vertex u</span></div>
 <div class="line"><span class="lineno">  165</span>            std::list&lt;int&gt;::iterator it;</div>
-<div class="line"><span class="lineno">  166</span>            <span class="keywordflow">for</span> (it = <a class="code hl_variable" href="#a35893def7a1c5cd60907b4893117796f">adj</a>[u].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">begin</a>(); it != <a class="code hl_variable" href="#a35893def7a1c5cd60907b4893117796f">adj</a>[u].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>(); ++it)</div>
+<div class="line"><span class="lineno">  166</span>            <span class="keywordflow">for</span> (it = <a class="code hl_variable" href="#a35893def7a1c5cd60907b4893117796f">adj</a>[u].begin(); it != <a class="code hl_variable" href="#a35893def7a1c5cd60907b4893117796f">adj</a>[u].end(); ++it)</div>
 <div class="line"><span class="lineno">  167</span>            {</div>
 <div class="line"><span class="lineno">  168</span>                <span class="keywordtype">int</span> v = *it;</div>
 <div class="line"><span class="lineno">  169</span> </div>
@@ -322,18 +336,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  181</span>   </div>
 <div class="line"><span class="lineno">  182</span>    <span class="keywordflow">return</span> (<a class="code hl_variable" href="#a6a0228bbba3818447fcf6b56128b552a">dist</a>[NIL] != INF);   <span class="comment">// If we could come back to NIL using alternating path of distinct vertices then there is an augmenting path available</span></div>
 <div class="line"><span class="lineno">  183</span>}</div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a6a0228bbba3818447fcf6b56128b552a"><div class="ttname"><a href="#a6a0228bbba3818447fcf6b56128b552a">graph::HKGraph::dist</a></div><div class="ttdeci">std::vector&lt; int &gt; dist</div><div class="ttdoc">dist represents the distance between vertex 'u' and vertex 'v'</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:77</div></div>
-<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a86ebff8a70cbfedd05281993d5d1987b"><div class="ttname"><a href="#a86ebff8a70cbfedd05281993d5d1987b">graph::HKGraph::pair_u</a></div><div class="ttdeci">std::vector&lt; int &gt; pair_u</div><div class="ttdoc">value of vertex 'u' ranges from 1 to m</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:75</div></div>
-<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a976ee239402cc2726a280e781c706d77"><div class="ttname"><a href="#a976ee239402cc2726a280e781c706d77">graph::HKGraph::pair_v</a></div><div class="ttdeci">std::vector&lt; int &gt; pair_v</div><div class="ttdoc">value of vertex 'v' ranges from 1 to n</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:76</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.svg" width="312" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a6a0228bbba3818447fcf6b56128b552a"><div class="ttname"><a href="#a6a0228bbba3818447fcf6b56128b552a">graph::HKGraph::dist</a></div><div class="ttdeci">std::vector&lt; int &gt; dist</div><div class="ttdoc">dist represents the distance between vertex 'u' and vertex 'v'</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00077">hopcroft_karp.cpp:77</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a86ebff8a70cbfedd05281993d5d1987b"><div class="ttname"><a href="#a86ebff8a70cbfedd05281993d5d1987b">graph::HKGraph::pair_u</a></div><div class="ttdeci">std::vector&lt; int &gt; pair_u</div><div class="ttdoc">value of vertex 'u' ranges from 1 to m</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00075">hopcroft_karp.cpp:75</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a976ee239402cc2726a280e781c706d77"><div class="ttname"><a href="#a976ee239402cc2726a280e781c706d77">graph::HKGraph::pair_v</a></div><div class="ttdeci">std::vector&lt; int &gt; pair_v</div><div class="ttdoc">value of vertex 'v' ranges from 1 to n</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00076">hopcroft_karp.cpp:76</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae794950cb3407b6b47d3dc986cf714c0" name="ae794950cb3407b6b47d3dc986cf714c0"></a>
@@ -361,11 +367,13 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if there is an augmenting path beginning with free vertex u </dd>
 <dd>
 <code>false</code> if there is no augmenting path beginning with free vertex u </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00191">191</a> of file <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html">hopcroft_karp.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  192</span>{</div>
 <div class="line"><span class="lineno">  193</span>    <span class="keywordflow">if</span> (u != NIL)</div>
 <div class="line"><span class="lineno">  194</span>    {</div>
 <div class="line"><span class="lineno">  195</span>        std::list&lt;int&gt;::iterator it;</div>
-<div class="line"><span class="lineno">  196</span>        <span class="keywordflow">for</span> (it = <a class="code hl_variable" href="#a35893def7a1c5cd60907b4893117796f">adj</a>[u].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">begin</a>(); it != <a class="code hl_variable" href="#a35893def7a1c5cd60907b4893117796f">adj</a>[u].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>(); ++it)</div>
+<div class="line"><span class="lineno">  196</span>        <span class="keywordflow">for</span> (it = <a class="code hl_variable" href="#a35893def7a1c5cd60907b4893117796f">adj</a>[u].begin(); it != <a class="code hl_variable" href="#a35893def7a1c5cd60907b4893117796f">adj</a>[u].end(); ++it)</div>
 <div class="line"><span class="lineno">  197</span>        {</div>
 <div class="line"><span class="lineno">  198</span>            </div>
 <div class="line"><span class="lineno">  199</span>            <span class="keywordtype">int</span> v = *it; <span class="comment">// Adjacent vertex of u</span></div>
@@ -389,13 +397,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  217</span>    }</div>
 <div class="line"><span class="lineno">  218</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  219</span>}</div>
-<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_ae794950cb3407b6b47d3dc986cf714c0"><div class="ttname"><a href="#ae794950cb3407b6b47d3dc986cf714c0">graph::HKGraph::dfs</a></div><div class="ttdeci">bool dfs(int u)</div><div class="ttdoc">This functions checks whether an augmenting path is available exists beginning with free vertex u.</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:191</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.svg" width="312" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_ae794950cb3407b6b47d3dc986cf714c0"><div class="ttname"><a href="#ae794950cb3407b6b47d3dc986cf714c0">graph::HKGraph::dfs</a></div><div class="ttdeci">bool dfs(int u)</div><div class="ttdoc">This functions checks whether an augmenting path is available exists beginning with free vertex u.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00191">hopcroft_karp.cpp:191</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a9dbda80d02bdc26c3e8ff7330c9be75d" name="a9dbda80d02bdc26c3e8ff7330c9be75d"></a>
@@ -415,17 +418,19 @@ Here is the call graph for this function:</div>
 
 <p>This function counts the number of augmenting paths between left and right sides of the Bipartite graph. </p>
 <dl class="section return"><dt>Returns</dt><dd>size of maximum matching </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00095">95</a> of file <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html">hopcroft_karp.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   96</span>{</div>
 <div class="line"><span class="lineno">   97</span> </div>
 <div class="line"><span class="lineno">   98</span>    <span class="comment">// pair_u[u] stores pair of u in matching on left side of Bipartite Graph.</span></div>
 <div class="line"><span class="lineno">   99</span>    <span class="comment">// If u doesn&#39;t have any pair, then pair_u[u] is NIL</span></div>
-<div class="line"><span class="lineno">  100</span>    <a class="code hl_variable" href="#a86ebff8a70cbfedd05281993d5d1987b">pair_u</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(<a class="code hl_variable" href="#a3d9101e3b4598159005fd028b9b0ff74">m</a> + 1,NIL); </div>
+<div class="line"><span class="lineno">  100</span>    <a class="code hl_variable" href="#a86ebff8a70cbfedd05281993d5d1987b">pair_u</a> = std::vector&lt;int&gt;(<a class="code hl_variable" href="#a3d9101e3b4598159005fd028b9b0ff74">m</a> + 1,NIL); </div>
 <div class="line"><span class="lineno">  101</span> </div>
 <div class="line"><span class="lineno">  102</span>    <span class="comment">// pair_v[v] stores pair of v in matching on right side of Biparite Graph.</span></div>
 <div class="line"><span class="lineno">  103</span>    <span class="comment">// If v doesn&#39;t have any pair, then pair_u[v] is NIL</span></div>
-<div class="line"><span class="lineno">  104</span>    <a class="code hl_variable" href="#a976ee239402cc2726a280e781c706d77">pair_v</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(<a class="code hl_variable" href="#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a> + 1,NIL); </div>
+<div class="line"><span class="lineno">  104</span>    <a class="code hl_variable" href="#a976ee239402cc2726a280e781c706d77">pair_v</a> = std::vector&lt;int&gt;(<a class="code hl_variable" href="#a6f5a9fdbb83ef731d739ba6707e21c3c">n</a> + 1,NIL); </div>
 <div class="line"><span class="lineno">  105</span> </div>
-<div class="line"><span class="lineno">  106</span>    <a class="code hl_variable" href="#a6a0228bbba3818447fcf6b56128b552a">dist</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(<a class="code hl_variable" href="#a3d9101e3b4598159005fd028b9b0ff74">m</a> + 1);  <span class="comment">// dist[u] stores distance of left side vertices</span></div>
+<div class="line"><span class="lineno">  106</span>    <a class="code hl_variable" href="#a6a0228bbba3818447fcf6b56128b552a">dist</a> = std::vector&lt;int&gt;(<a class="code hl_variable" href="#a3d9101e3b4598159005fd028b9b0ff74">m</a> + 1);  <span class="comment">// dist[u] stores distance of left side vertices</span></div>
 <div class="line"><span class="lineno">  107</span> </div>
 <div class="line"><span class="lineno">  108</span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = 0;  <span class="comment">// Initialize result</span></div>
 <div class="line"><span class="lineno">  109</span> </div>
@@ -445,17 +450,64 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  123</span>    }</div>
 <div class="line"><span class="lineno">  124</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  125</span>}</div>
-<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a7491add14d9fc04f679114ca6d6f0f93"><div class="ttname"><a href="#a7491add14d9fc04f679114ca6d6f0f93">graph::HKGraph::bfs</a></div><div class="ttdeci">bool bfs()</div><div class="ttdoc">This function checks for the possibility of augmented path availability.</div><div class="ttdef"><b>Definition</b> hopcroft_karp.cpp:133</div></div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.svg" width="531" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a7491add14d9fc04f679114ca6d6f0f93"><div class="ttname"><a href="#a7491add14d9fc04f679114ca6d6f0f93">graph::HKGraph::bfs</a></div><div class="ttdeci">bool bfs()</div><div class="ttdoc">This function checks for the possibility of augmented path availability.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00133">hopcroft_karp.cpp:133</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
+<a id="a35893def7a1c5cd60907b4893117796f" name="a35893def7a1c5cd60907b4893117796f"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a35893def7a1c5cd60907b4893117796f">&#9670;&#160;</a></span>adj</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::list&lt;int&gt; &gt; graph::HKGraph::adj</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>adj[u] stores adjacents of left side and 0 is used for dummy vertex </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00073">73</a> of file <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html">hopcroft_karp.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a6a0228bbba3818447fcf6b56128b552a" name="a6a0228bbba3818447fcf6b56128b552a"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a6a0228bbba3818447fcf6b56128b552a">&#9670;&#160;</a></span>dist</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;int&gt; graph::HKGraph::dist</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>dist represents the distance between vertex 'u' and vertex 'v' </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html">hopcroft_karp.cpp</a>.</p>
+
+</div>
+</div>
 <a id="a44742cb9cfecd1a4493970af9b8bbb15" name="a44742cb9cfecd1a4493970af9b8bbb15"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a44742cb9cfecd1a4493970af9b8bbb15">&#9670;&#160;</a></span>INF</h2>
 
@@ -475,6 +527,8 @@ Here is the call graph for this function:</div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00071">71</a> of file <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html">hopcroft_karp.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   71</span>{INT_MAX};</div>
 </div><!-- fragment -->
 </div>
@@ -500,7 +554,9 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>m is the number of vertices on left side of Bipartite <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> </p>
-<div class="fragment"><div class="line"><span class="lineno">   68</span>{};  <span class="comment">///&lt; m is the number of vertices on left side of Bipartite Graph</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00068">68</a> of file <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html">hopcroft_karp.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   68</span>{};  </div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -525,7 +581,9 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>n is the number of vertices on right side of Bipartite <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> </p>
-<div class="fragment"><div class="line"><span class="lineno">   69</span>{};  <span class="comment">///&lt; n is the number of vertices on right side of Bipartite Graph</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00069">69</a> of file <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html">hopcroft_karp.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   69</span>{};  </div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -548,12 +606,66 @@ Here is the call graph for this function:</div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00070">70</a> of file <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html">hopcroft_karp.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   70</span>{0};</div>
 </div><!-- fragment -->
+</div>
+</div>
+<a id="a86ebff8a70cbfedd05281993d5d1987b" name="a86ebff8a70cbfedd05281993d5d1987b"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a86ebff8a70cbfedd05281993d5d1987b">&#9670;&#160;</a></span>pair_u</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;int&gt; graph::HKGraph::pair_u</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>value of vertex 'u' ranges from 1 to m </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00075">75</a> of file <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html">hopcroft_karp.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a976ee239402cc2726a280e781c706d77" name="a976ee239402cc2726a280e781c706d77"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a976ee239402cc2726a280e781c706d77">&#9670;&#160;</a></span>pair_v</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;int&gt; graph::HKGraph::pair_v</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>value of vertex 'v' ranges from 1 to n </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html#l00076">76</a> of file <a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html">hopcroft_karp.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>graph/<a class="el" href="../../d1/d9a/hopcroft__karp_8cpp.html">hopcroft_karp.cpp</a></li>
+<li>graph/<a class="el" href="../../d1/d9a/hopcroft__karp_8cpp_source.html">hopcroft_karp.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.map b/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.map
deleted file mode 100644
index 0e883cee5..000000000
--- a/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="graph::HKGraph::addEdge" name="graph::HKGraph::addEdge">
-<area shape="rect" id="Node000001" title="function to add edge from u to v" alt="" coords="5,5,180,31"/>
-<area shape="rect" id="Node000002" 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="228,5,382,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="180,16,212,16,212,21,180,21"/>
-</map>
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.md5 b/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.md5
deleted file mode 100644
index 3622e0392..000000000
--- a/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cff190e53cf7b5f8c2143472dd7f2e7a
\ No newline at end of file
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.svg b/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.svg
deleted file mode 100644
index 0f52f33ac..000000000
--- a/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::HKGraph::addEdge Pages: 1 -->
-<svg width="291pt" height="27pt"
- viewBox="0.00 0.00 290.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>graph::HKGraph::addEdge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="function to add edge from u to v">
-<polygon fill="#999999" stroke="#666666" points="130.75,-19.25 0,-19.25 0,0 130.75,0 130.75,-19.25"/>
-<text text-anchor="middle" x="65.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282.5,-19.25 166.75,-19.25 166.75,0 282.5,0 282.5,-19.25"/>
-<text text-anchor="middle" x="224.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.24,-9.62C139.09,-9.62 147.12,-9.62 155.02,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.93,-13.13 164.93,-9.63 154.93,-6.13 154.93,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph_org.svg b/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph_org.svg
deleted file mode 100644
index 939434326..000000000
--- a/d8/d69/classgraph_1_1_h_k_graph_a3b49011c09cf90a116ab53bef61cd95a_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::HKGraph::addEdge Pages: 1 -->
-<svg width="291pt" height="27pt"
- viewBox="0.00 0.00 290.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>graph::HKGraph::addEdge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="function to add edge from u to v">
-<polygon fill="#999999" stroke="#666666" points="130.75,-19.25 0,-19.25 0,0 130.75,0 130.75,-19.25"/>
-<text text-anchor="middle" x="65.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282.5,-19.25 166.75,-19.25 166.75,0 282.5,0 282.5,-19.25"/>
-<text text-anchor="middle" x="224.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.24,-9.62C139.09,-9.62 147.12,-9.62 155.02,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.93,-13.13 164.93,-9.63 154.93,-6.13 154.93,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.map b/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.map
deleted file mode 100644
index 05334e76b..000000000
--- a/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="graph::HKGraph::bfs" name="graph::HKGraph::bfs">
-<area shape="rect" id="Node000001" title="This function checks for the possibility of augmented path availability." alt="" coords="5,5,147,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="195,5,307,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="147,16,179,16,179,21,147,21"/>
-</map>
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.md5 b/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.md5
deleted file mode 100644
index 0ce142145..000000000
--- a/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-875d9bf191cb32944bcc8665d77bef8b
\ No newline at end of file
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.svg b/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.svg
deleted file mode 100644
index 8582e40bd..000000000
--- a/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::HKGraph::bfs Pages: 1 -->
-<svg width="234pt" height="27pt"
- viewBox="0.00 0.00 234.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>graph::HKGraph::bfs</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function checks for the possibility of augmented path availability.">
-<polygon fill="#999999" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
-<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::bfs</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.25,-19.25 142,-19.25 142,0 226.25,0 226.25,-19.25"/>
-<text text-anchor="middle" x="184.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.15,-9.62C114.14,-9.62 122.4,-9.62 130.41,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.39,-13.13 140.39,-9.63 130.39,-6.13 130.39,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph_org.svg b/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph_org.svg
deleted file mode 100644
index e3668cc28..000000000
--- a/d8/d69/classgraph_1_1_h_k_graph_a7491add14d9fc04f679114ca6d6f0f93_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::HKGraph::bfs Pages: 1 -->
-<svg width="234pt" height="27pt"
- viewBox="0.00 0.00 234.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>graph::HKGraph::bfs</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function checks for the possibility of augmented path availability.">
-<polygon fill="#999999" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
-<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::bfs</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.25,-19.25 142,-19.25 142,0 226.25,0 226.25,-19.25"/>
-<text text-anchor="middle" x="184.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.15,-9.62C114.14,-9.62 122.4,-9.62 130.41,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.39,-13.13 140.39,-9.63 130.39,-6.13 130.39,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.map b/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.map
deleted file mode 100644
index 65752d0ac..000000000
--- a/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="graph::HKGraph::hopcroftKarpAlgorithm" name="graph::HKGraph::hopcroftKarpAlgorithm">
-<area shape="rect" id="Node000001" title="This function counts the number of augmenting paths between left and right sides of the Bipartite gra..." alt="" coords="5,35,176,76"/>
-<area shape="rect" id="Node000002" href="$d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93" title="This function checks for the possibility of augmented path availability." alt="" coords="224,5,365,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="175,37,208,31,209,37,176,43"/>
-<area shape="rect" id="Node000004" href="$d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0" title="This functions checks whether an augmenting path is available exists beginning with free vertex u." alt="" coords="224,79,365,104"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="176,68,209,74,208,79,176,73"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="413,43,525,68"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="358,29,398,38,397,43,357,34"/>
-<area shape="poly" id="edge5_Node000004_Node000003" title=" " alt="" coords="359,75,397,68,398,73,360,81"/>
-<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="265,80,259,70,262,60,275,54,294,52,316,55,327,61,324,66,314,60,294,57,276,59,266,64,264,69,269,77"/>
-</map>
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.md5 b/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.md5
deleted file mode 100644
index 01c159294..000000000
--- a/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cf6ad5fd506d263df122887a410d5982
\ No newline at end of file
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.svg b/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.svg
deleted file mode 100644
index 1bc0387ee..000000000
--- a/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::HKGraph::hopcroftKarpAlgorithm Pages: 1 -->
-<svg width="398pt" height="82pt"
- viewBox="0.00 0.00 398.00 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>graph::HKGraph::hopcroftKarpAlgorithm</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function counts the number of augmenting paths between left and right sides of the Bipartite gra...">
-<polygon fill="#999999" stroke="#666666" points="127.75,-51.88 0,-51.88 0,-21.38 127.75,-21.38 127.75,-51.88"/>
-<text text-anchor="start" x="8" y="-38.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::hopcroft</text>
-<text text-anchor="middle" x="63.88" y="-27.12" font-family="Helvetica,sans-Serif" font-size="10.00">KarpAlgorithm</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93" target="_top" xlink:title="This function checks for the possibility of augmented path availability.">
-<polygon fill="white" stroke="#666666" points="269.75,-74.25 163.75,-74.25 163.75,-55 269.75,-55 269.75,-74.25"/>
-<text text-anchor="middle" x="216.75" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::bfs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.99,-48.34C136,-49.82 144.2,-51.35 152.22,-52.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.44,-56.25 161.91,-54.63 152.72,-49.37 151.44,-56.25"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0" target="_top" xlink:title="This functions checks whether an augmenting path is available exists beginning with free vertex u.">
-<polygon fill="white" stroke="#666666" points="269.75,-19.25 163.75,-19.25 163.75,0 269.75,0 269.75,-19.25"/>
-<text text-anchor="middle" x="216.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::dfs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.99,-25.33C136,-23.9 144.2,-22.43 152.22,-20.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.68,-24.47 161.91,-19.26 151.45,-17.58 152.68,-24.47"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="390,-46.25 305.75,-46.25 305.75,-27 390,-27 390,-46.25"/>
-<text text-anchor="middle" x="347.88" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.37,-54.52C274.13,-52.4 284.49,-50.15 294.44,-47.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.95,-51.47 303.98,-45.93 293.47,-44.62 294.95,-51.47"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M265.83,-19.68C275.11,-21.62 284.87,-23.66 294.29,-25.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.55,-29.05 304.05,-27.67 294.98,-22.2 293.55,-29.05"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M196.22,-19.54C186.86,-28.15 193.7,-37.25 216.75,-37.25 229.36,-37.25 237.11,-34.53 240.02,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.44,-29.88 237.64,-21.01 236.64,-31.56 243.44,-29.88"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph_org.svg b/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph_org.svg
deleted file mode 100644
index c2cb283d4..000000000
--- a/d8/d69/classgraph_1_1_h_k_graph_a9dbda80d02bdc26c3e8ff7330c9be75d_cgraph_org.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::HKGraph::hopcroftKarpAlgorithm Pages: 1 -->
-<svg width="398pt" height="82pt"
- viewBox="0.00 0.00 398.00 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>graph::HKGraph::hopcroftKarpAlgorithm</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function counts the number of augmenting paths between left and right sides of the Bipartite gra...">
-<polygon fill="#999999" stroke="#666666" points="127.75,-51.88 0,-51.88 0,-21.38 127.75,-21.38 127.75,-51.88"/>
-<text text-anchor="start" x="8" y="-38.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::hopcroft</text>
-<text text-anchor="middle" x="63.88" y="-27.12" font-family="Helvetica,sans-Serif" font-size="10.00">KarpAlgorithm</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93" target="_top" xlink:title="This function checks for the possibility of augmented path availability.">
-<polygon fill="white" stroke="#666666" points="269.75,-74.25 163.75,-74.25 163.75,-55 269.75,-55 269.75,-74.25"/>
-<text text-anchor="middle" x="216.75" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::bfs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.99,-48.34C136,-49.82 144.2,-51.35 152.22,-52.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.44,-56.25 161.91,-54.63 152.72,-49.37 151.44,-56.25"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0" target="_top" xlink:title="This functions checks whether an augmenting path is available exists beginning with free vertex u.">
-<polygon fill="white" stroke="#666666" points="269.75,-19.25 163.75,-19.25 163.75,0 269.75,0 269.75,-19.25"/>
-<text text-anchor="middle" x="216.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::dfs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.99,-25.33C136,-23.9 144.2,-22.43 152.22,-20.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.68,-24.47 161.91,-19.26 151.45,-17.58 152.68,-24.47"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="390,-46.25 305.75,-46.25 305.75,-27 390,-27 390,-46.25"/>
-<text text-anchor="middle" x="347.88" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.37,-54.52C274.13,-52.4 284.49,-50.15 294.44,-47.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.95,-51.47 303.98,-45.93 293.47,-44.62 294.95,-51.47"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M265.83,-19.68C275.11,-21.62 284.87,-23.66 294.29,-25.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.55,-29.05 304.05,-27.67 294.98,-22.2 293.55,-29.05"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M196.22,-19.54C186.86,-28.15 193.7,-37.25 216.75,-37.25 229.36,-37.25 237.11,-34.53 240.02,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.44,-29.88 237.64,-21.01 236.64,-31.56 243.44,-29.88"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.map b/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.map
deleted file mode 100644
index 427773a65..000000000
--- a/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="graph::HKGraph::dfs" name="graph::HKGraph::dfs">
-<area shape="rect" id="Node000001" title="This functions checks whether an augmenting path is available exists beginning with free vertex u." alt="" coords="5,29,147,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="46,30,41,21,44,11,56,5,76,3,97,5,108,12,106,16,96,10,76,8,58,10,48,15,46,20,51,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="195,29,307,55"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="147,40,179,40,179,45,147,45"/>
-</map>
diff --git a/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.md5 b/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.md5
deleted file mode 100644
index 4a532a116..000000000
--- a/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7ec3cd4502b7d7271409d8f4267a1202
\ No newline at end of file
diff --git a/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.svg b/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.svg
deleted file mode 100644
index 983be0802..000000000
--- a/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph.svg
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::HKGraph::dfs Pages: 1 -->
-<svg width="234pt" height="45pt"
- viewBox="0.00 0.00 234.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>graph::HKGraph::dfs</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This functions checks whether an augmenting path is available exists beginning with free vertex u.">
-<polygon fill="#999999" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
-<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::dfs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.47,-19.54C23.11,-28.15 29.95,-37.25 53,-37.25 65.61,-37.25 73.36,-34.53 76.27,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.69,-29.88 73.89,-21.01 72.89,-31.56 79.69,-29.88"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.25,-19.25 142,-19.25 142,0 226.25,0 226.25,-19.25"/>
-<text text-anchor="middle" x="184.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.15,-9.62C114.14,-9.62 122.4,-9.62 130.41,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.39,-13.13 140.39,-9.63 130.39,-6.13 130.39,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph_org.svg b/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph_org.svg
deleted file mode 100644
index 5486d4f10..000000000
--- a/d8/d69/classgraph_1_1_h_k_graph_ae794950cb3407b6b47d3dc986cf714c0_cgraph_org.svg
+++ /dev/null
@@ -1,48 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::HKGraph::dfs Pages: 1 -->
-<svg width="234pt" height="45pt"
- viewBox="0.00 0.00 234.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>graph::HKGraph::dfs</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This functions checks whether an augmenting path is available exists beginning with free vertex u.">
-<polygon fill="#999999" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
-<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph::dfs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.47,-19.54C23.11,-28.15 29.95,-37.25 53,-37.25 65.61,-37.25 73.36,-34.53 76.27,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.69,-29.88 73.89,-21.01 72.89,-31.56 79.69,-29.88"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.25,-19.25 142,-19.25 142,0 226.25,0 226.25,-19.25"/>
-<text text-anchor="middle" x="184.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.15,-9.62C114.14,-9.62 122.4,-9.62 130.41,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.39,-13.13 140.39,-9.63 130.39,-6.13 130.39,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d6c/line__segment__intersection_8cpp.html b/d8/d6c/line__segment__intersection_8cpp.html
index aa4e7b850..5acd0f7d2 100644
--- a/d8/d6c/line__segment__intersection_8cpp.html
+++ b/d8/d6c/line__segment__intersection_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: geometry/line_segment_intersection.cpp File Reference</title>
+<title>TheAlgorithms/C++: geometry/line_segment_intersection.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for line_segment_intersection.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/df3/line__segment__intersection_8cpp__incl.svg" width="182" height="126"><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">
+</div>
+<p><a href="../../d8/d6c/line__segment__intersection_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/dc8/struct_point.html">Point</a></td></tr>
@@ -135,6 +154,8 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>check whether two line segments intersect each other or not. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/d6c/line__segment__intersection_8cpp_source.html">line_segment_intersection.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -151,32 +172,25 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>This is the main function to test whether the algorithm is working well. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00092">92</a> of file <a class="el" href="../../d8/d6c/line__segment__intersection_8cpp_source.html">line_segment_intersection.cpp</a>.</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_struct" href="../../d4/db4/struct_segment_intersection.html">SegmentIntersection</a> segment;</div>
 <div class="line"><span class="lineno">   94</span>    <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> first_point, second_point, third_point, forth_point;</div>
 <div class="line"><span class="lineno">   95</span> </div>
-<div class="line"><span class="lineno">   96</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; first_point.x &gt;&gt; first_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>;</div>
-<div class="line"><span class="lineno">   97</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; second_point.x &gt;&gt; second_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>;</div>
-<div class="line"><span class="lineno">   98</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; third_point.x &gt;&gt; third_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>;</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_istream.html">std::cin</a> &gt;&gt; forth_point.x &gt;&gt; forth_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>;</div>
+<div class="line"><span class="lineno">   96</span>    std::cin &gt;&gt; first_point.x &gt;&gt; first_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>;</div>
+<div class="line"><span class="lineno">   97</span>    std::cin &gt;&gt; second_point.x &gt;&gt; second_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>;</div>
+<div class="line"><span class="lineno">   98</span>    std::cin &gt;&gt; third_point.x &gt;&gt; third_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>;</div>
+<div class="line"><span class="lineno">   99</span>    std::cin &gt;&gt; forth_point.x &gt;&gt; forth_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>;</div>
 <div class="line"><span class="lineno">  100</span> </div>
-<div class="line"><span class="lineno">  101</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fprintf.html">printf</a>(<span class="stringliteral">&quot;%d&quot;</span>, segment.intersect(first_point, second_point, third_point,</div>
+<div class="line"><span class="lineno">  101</span>    printf(<span class="stringliteral">&quot;%d&quot;</span>, segment.intersect(first_point, second_point, third_point,</div>
 <div class="line"><span class="lineno">  102</span>                                   forth_point));</div>
-<div class="line"><span class="lineno">  103</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  103</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  104</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="afprintf_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/c/fprintf.html">std::printf</a></div><div class="ttdeci">T printf(T... args)</div></div>
-<div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:12</div></div>
-<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:14</div></div>
-<div class="ttc" id="astruct_segment_intersection_html"><div class="ttname"><a href="../../d4/db4/struct_segment_intersection.html">SegmentIntersection</a></div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:22</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="180" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition</b> <a href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00012">line_segment_intersection.cpp:12</a></div></div>
+<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00014">line_segment_intersection.cpp:14</a></div></div>
+<div class="ttc" id="astruct_segment_intersection_html"><div class="ttname"><a href="../../d4/db4/struct_segment_intersection.html">SegmentIntersection</a></div><div class="ttdef"><b>Definition</b> <a href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00022">line_segment_intersection.cpp:22</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 490da38cb..000000000
--- a/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 2f2fe09b6..000000000
--- a/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fa87532068062fd8189cade55ca11658
\ No newline at end of file
diff --git a/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 5c76e5177..000000000
--- a/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 134.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-9.62C44.56,-9.62 52.97,-9.62 61.25,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.21,-13.13 71.21,-9.63 61.21,-6.13 61.21,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 575e4300e..000000000
--- a/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 134.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-9.62C44.56,-9.62 52.97,-9.62 61.25,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.21,-13.13 71.21,-9.63 61.21,-6.13 61.21,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d6c/line__segment__intersection_8cpp_source.html b/d8/d6c/line__segment__intersection_8cpp_source.html
new file mode 100644
index 000000000..103aee0a2
--- /dev/null
+++ b/d8/d6c/line__segment__intersection_8cpp_source.html
@@ -0,0 +1,228 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: geometry/line_segment_intersection.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/d6c/line__segment__intersection_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">line_segment_intersection.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/d6c/line__segment__intersection_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="foldopen" id="foldopen00012" data-start="{" data-end="};">
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"><a class="line" href="../../d8/dc8/struct_point.html">   12</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <span class="keywordtype">int</span> x;  </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"><a class="line" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">   14</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>;  </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>};</div>
+</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="foldopen" id="foldopen00022" data-start="{" data-end="};">
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"><a class="line" href="../../d4/db4/struct_segment_intersection.html">   22</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../d4/db4/struct_segment_intersection.html">SegmentIntersection</a> {</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> intersect(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> first_point, <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> second_point,</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>                          <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> third_point, <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> forth_point) {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        <span class="keywordtype">int</span> direction1 = <a class="code hl_function" href="../../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655">direction</a>(third_point, forth_point, first_point);</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        <span class="keywordtype">int</span> direction2 = <a class="code hl_function" href="../../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655">direction</a>(third_point, forth_point, second_point);</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        <span class="keywordtype">int</span> direction3 = <a class="code hl_function" href="../../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655">direction</a>(first_point, second_point, third_point);</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        <span class="keywordtype">int</span> direction4 = <a class="code hl_function" href="../../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655">direction</a>(first_point, second_point, forth_point);</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        <span class="keywordflow">if</span> ((direction1 &lt; 0 || direction2 &gt; 0) &amp;&amp;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>            (direction3 &lt; 0 || direction4 &gt; 0))</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (direction1 == 0 &amp;&amp;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>                 <a class="code hl_function" href="../../d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf">on_segment</a>(third_point, forth_point, first_point))</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (direction2 == 0 &amp;&amp;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>                 <a class="code hl_function" href="../../d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf">on_segment</a>(third_point, forth_point, second_point))</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (direction3 == 0 &amp;&amp;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>                 <a class="code hl_function" href="../../d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf">on_segment</a>(first_point, second_point, third_point))</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (direction3 == 0 &amp;&amp;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>                 <a class="code hl_function" href="../../d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf">on_segment</a>(first_point, second_point, forth_point))</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    }</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="foldopen" id="foldopen00063" data-start="{" data-end="}">
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"><a class="line" href="../../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655">   63</a></span>    <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655">direction</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> first_point, <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> second_point,</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>                         <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> third_point) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <span class="keywordflow">return</span> ((third_point.x - first_point.x) *</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>                (second_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> - first_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>)) -</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>               ((second_point.x - first_point.x) *</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                (third_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> - first_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>));</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    }</div>
+</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="foldopen" id="foldopen00075" data-start="{" data-end="}">
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="../../d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf">   75</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf">on_segment</a>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> first_point, <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> second_point,</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>                           <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> third_point) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        <span class="keywordflow">if</span> (std::min(first_point.x, second_point.x) &lt;= third_point.x &amp;&amp;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            third_point.x &lt;= std::max(first_point.x, second_point.x) &amp;&amp;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            std::min(first_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>, second_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>) &lt;= third_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> &amp;&amp;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>            third_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> &lt;= std::max(first_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>, second_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>))</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    }</div>
+</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>};</div>
+</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="foldopen" id="foldopen00092" data-start="{" data-end="}">
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="../../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   92</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <a class="code hl_struct" href="../../d4/db4/struct_segment_intersection.html">SegmentIntersection</a> segment;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> first_point, second_point, third_point, forth_point;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    std::cin &gt;&gt; first_point.x &gt;&gt; first_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    std::cin &gt;&gt; second_point.x &gt;&gt; second_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    std::cin &gt;&gt; third_point.x &gt;&gt; third_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    std::cin &gt;&gt; forth_point.x &gt;&gt; forth_point.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a>;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    printf(<span class="stringliteral">&quot;%d&quot;</span>, segment.intersect(first_point, second_point, third_point,</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>                                   forth_point));</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>}</div>
+</div>
+<div class="ttc" id="aline__segment__intersection_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00092">line_segment_intersection.cpp:92</a></div></div>
+<div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition</b> <a href="#l00012">line_segment_intersection.cpp:12</a></div></div>
+<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> <a href="#l00014">line_segment_intersection.cpp:14</a></div></div>
+<div class="ttc" id="astruct_segment_intersection_html"><div class="ttname"><a href="../../d4/db4/struct_segment_intersection.html">SegmentIntersection</a></div><div class="ttdef"><b>Definition</b> <a href="#l00022">line_segment_intersection.cpp:22</a></div></div>
+<div class="ttc" id="astruct_segment_intersection_html_a008941b2272866c64cdaf959afa939bf"><div class="ttname"><a href="../../d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf">SegmentIntersection::on_segment</a></div><div class="ttdeci">bool on_segment(Point first_point, Point second_point, Point third_point)</div><div class="ttdef"><b>Definition</b> <a href="#l00075">line_segment_intersection.cpp:75</a></div></div>
+<div class="ttc" id="astruct_segment_intersection_html_a3beb2ac1b35d67354f1dbaf9a971e655"><div class="ttname"><a href="../../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655">SegmentIntersection::direction</a></div><div class="ttdeci">int direction(Point first_point, Point second_point, Point third_point)</div><div class="ttdef"><b>Definition</b> <a href="#l00063">line_segment_intersection.cpp:63</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_e3380d2178455503f266746fb14246a5.html">geometry</a></li><li class="navelem"><a class="el" href="../../d8/d6c/line__segment__intersection_8cpp.html">line_segment_intersection.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/d72/class_r_btree.html b/d8/d72/class_r_btree.html
index 568587f23..059741834 100644
--- a/d8/d72/class_r_btree.html
+++ b/d8/d72/class_r_btree.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: RBtree Class Reference</title>
+<title>TheAlgorithms/C++: RBtree Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -142,14 +159,15 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a84627c15a240f1e5821c54802fccf898" id="r_a84627c15a240f1e5821c54802fccf898"><td class="memItemLeft" align="right" valign="top"><a id="a84627c15a240f1e5821c54802fccf898" name="a84627c15a240f1e5821c54802fccf898"></a>
-<a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>root</b></td></tr>
+<tr class="memitem:a84627c15a240f1e5821c54802fccf898" id="r_a84627c15a240f1e5821c54802fccf898"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a84627c15a240f1e5821c54802fccf898">root</a></td></tr>
 <tr class="separator:a84627c15a240f1e5821c54802fccf898"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a3bea624ca2da11e4569bc1e9cda849b5" id="r_a3bea624ca2da11e4569bc1e9cda849b5"><td class="memItemLeft" align="right" valign="top"><a id="a3bea624ca2da11e4569bc1e9cda849b5" name="a3bea624ca2da11e4569bc1e9cda849b5"></a>
-<a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>q</b></td></tr>
+<tr class="memitem:a3bea624ca2da11e4569bc1e9cda849b5" id="r_a3bea624ca2da11e4569bc1e9cda849b5"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3bea624ca2da11e4569bc1e9cda849b5">q</a></td></tr>
 <tr class="separator:a3bea624ca2da11e4569bc1e9cda849b5"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
-<h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00013">13</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
+</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a0f3e97969a8737098cea23d6b66ba981" name="a0f3e97969a8737098cea23d6b66ba981"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0f3e97969a8737098cea23d6b66ba981">&#9670;&#160;</a></span>RBtree()</h2>
 
@@ -172,6 +190,8 @@ Private Attributes</h2></td></tr>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00018">18</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   19</span>    {</div>
 <div class="line"><span class="lineno">   20</span>        q = NULL;</div>
 <div class="line"><span class="lineno">   21</span>        root = NULL;</div>
@@ -194,15 +214,17 @@ Private Attributes</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00135">135</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  136</span>{</div>
 <div class="line"><span class="lineno">  137</span>    <span class="keywordflow">if</span> (root == NULL)</div>
 <div class="line"><span class="lineno">  138</span>    {</div>
-<div class="line"><span class="lineno">  139</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEmpty Tree.&quot;</span>;</div>
+<div class="line"><span class="lineno">  139</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nEmpty Tree.&quot;</span>;</div>
 <div class="line"><span class="lineno">  140</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  141</span>    }</div>
 <div class="line"><span class="lineno">  142</span>    <span class="keywordtype">int</span> x;</div>
-<div class="line"><span class="lineno">  143</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter the key of the node to be deleted: &quot;</span>;</div>
-<div class="line"><span class="lineno">  144</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">cin</a> &gt;&gt; x;</div>
+<div class="line"><span class="lineno">  143</span>    cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the key of the node to be deleted: &quot;</span>;</div>
+<div class="line"><span class="lineno">  144</span>    cin &gt;&gt; x;</div>
 <div class="line"><span class="lineno">  145</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *p;</div>
 <div class="line"><span class="lineno">  146</span>    p = root;</div>
 <div class="line"><span class="lineno">  147</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *y = NULL;</div>
@@ -222,31 +244,31 @@ Private Attributes</h2></td></tr>
 <div class="line"><span class="lineno">  161</span>    }</div>
 <div class="line"><span class="lineno">  162</span>    <span class="keywordflow">if</span> (found == 0)</div>
 <div class="line"><span class="lineno">  163</span>    {</div>
-<div class="line"><span class="lineno">  164</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\nElement Not Found.&quot;</span>;</div>
+<div class="line"><span class="lineno">  164</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nElement Not Found.&quot;</span>;</div>
 <div class="line"><span class="lineno">  165</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  166</span>    }</div>
 <div class="line"><span class="lineno">  167</span>    <span class="keywordflow">else</span></div>
 <div class="line"><span class="lineno">  168</span>    {</div>
-<div class="line"><span class="lineno">  169</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\nDeleted Element: &quot;</span> &lt;&lt; p-&gt;key;</div>
-<div class="line"><span class="lineno">  170</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\nColour: &quot;</span>;</div>
+<div class="line"><span class="lineno">  169</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nDeleted Element: &quot;</span> &lt;&lt; p-&gt;key;</div>
+<div class="line"><span class="lineno">  170</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nColour: &quot;</span>;</div>
 <div class="line"><span class="lineno">  171</span>        <span class="keywordflow">if</span> (p-&gt;color == <span class="charliteral">&#39;b&#39;</span>)</div>
-<div class="line"><span class="lineno">  172</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;Black\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  172</span>            cout &lt;&lt; <span class="stringliteral">&quot;Black\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  173</span>        <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">  174</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;Red\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  174</span>            cout &lt;&lt; <span class="stringliteral">&quot;Red\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  175</span> </div>
 <div class="line"><span class="lineno">  176</span>        <span class="keywordflow">if</span> (p-&gt;parent != NULL)</div>
-<div class="line"><span class="lineno">  177</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\nParent: &quot;</span> &lt;&lt; p-&gt;parent-&gt;key;</div>
+<div class="line"><span class="lineno">  177</span>            cout &lt;&lt; <span class="stringliteral">&quot;\nParent: &quot;</span> &lt;&lt; p-&gt;parent-&gt;key;</div>
 <div class="line"><span class="lineno">  178</span>        <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">  179</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\nThere is no parent of the node.  &quot;</span>;</div>
+<div class="line"><span class="lineno">  179</span>            cout &lt;&lt; <span class="stringliteral">&quot;\nThere is no parent of the node.  &quot;</span>;</div>
 <div class="line"><span class="lineno">  180</span>        <span class="keywordflow">if</span> (p-&gt;right != NULL)</div>
-<div class="line"><span class="lineno">  181</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\nRight Child: &quot;</span> &lt;&lt; p-&gt;right-&gt;key;</div>
+<div class="line"><span class="lineno">  181</span>            cout &lt;&lt; <span class="stringliteral">&quot;\nRight Child: &quot;</span> &lt;&lt; p-&gt;right-&gt;key;</div>
 <div class="line"><span class="lineno">  182</span>        <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">  183</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\nThere is no right child of the node.  &quot;</span>;</div>
+<div class="line"><span class="lineno">  183</span>            cout &lt;&lt; <span class="stringliteral">&quot;\nThere is no right child of the node.  &quot;</span>;</div>
 <div class="line"><span class="lineno">  184</span>        <span class="keywordflow">if</span> (p-&gt;left != NULL)</div>
-<div class="line"><span class="lineno">  185</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\nLeft Child: &quot;</span> &lt;&lt; p-&gt;left-&gt;key;</div>
+<div class="line"><span class="lineno">  185</span>            cout &lt;&lt; <span class="stringliteral">&quot;\nLeft Child: &quot;</span> &lt;&lt; p-&gt;left-&gt;key;</div>
 <div class="line"><span class="lineno">  186</span>        <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">  187</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\nThere is no left child of the node.  &quot;</span>;</div>
-<div class="line"><span class="lineno">  188</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\nNode Deleted.&quot;</span>;</div>
+<div class="line"><span class="lineno">  187</span>            cout &lt;&lt; <span class="stringliteral">&quot;\nThere is no left child of the node.  &quot;</span>;</div>
+<div class="line"><span class="lineno">  188</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nNode Deleted.&quot;</span>;</div>
 <div class="line"><span class="lineno">  189</span>        <span class="keywordflow">if</span> (p-&gt;left == NULL || p-&gt;right == NULL)</div>
 <div class="line"><span class="lineno">  190</span>            y = p;</div>
 <div class="line"><span class="lineno">  191</span>        <span class="keywordflow">else</span></div>
@@ -280,9 +302,7 @@ Private Attributes</h2></td></tr>
 <div class="line"><span class="lineno">  219</span>            delfix(q);</div>
 <div class="line"><span class="lineno">  220</span>    }</div>
 <div class="line"><span class="lineno">  221</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -300,6 +320,8 @@ Private Attributes</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00223">223</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  224</span>{</div>
 <div class="line"><span class="lineno">  225</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *s;</div>
 <div class="line"><span class="lineno">  226</span>    <span class="keywordflow">while</span> (p != root &amp;&amp; p-&gt;color == <span class="charliteral">&#39;b&#39;</span>)</div>
@@ -387,6 +409,8 @@ Private Attributes</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00372">372</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  373</span>{</div>
 <div class="line"><span class="lineno">  374</span>    display(root);</div>
 <div class="line"><span class="lineno">  375</span>}</div>
@@ -407,51 +431,53 @@ Private Attributes</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00376">376</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  377</span>{</div>
 <div class="line"><span class="lineno">  378</span>    <span class="keywordflow">if</span> (root == NULL)</div>
 <div class="line"><span class="lineno">  379</span>    {</div>
-<div class="line"><span class="lineno">  380</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEmpty Tree.&quot;</span>;</div>
+<div class="line"><span class="lineno">  380</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nEmpty Tree.&quot;</span>;</div>
 <div class="line"><span class="lineno">  381</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  382</span>    }</div>
 <div class="line"><span class="lineno">  383</span>    <span class="keywordflow">if</span> (p != NULL)</div>
 <div class="line"><span class="lineno">  384</span>    {</div>
-<div class="line"><span class="lineno">  385</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n\t NODE: &quot;</span>;</div>
-<div class="line"><span class="lineno">  386</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n Key: &quot;</span> &lt;&lt; p-&gt;key;</div>
-<div class="line"><span class="lineno">  387</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n Colour: &quot;</span>;</div>
+<div class="line"><span class="lineno">  385</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n\t NODE: &quot;</span>;</div>
+<div class="line"><span class="lineno">  386</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n Key: &quot;</span> &lt;&lt; p-&gt;key;</div>
+<div class="line"><span class="lineno">  387</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n Colour: &quot;</span>;</div>
 <div class="line"><span class="lineno">  388</span>        <span class="keywordflow">if</span> (p-&gt;color == <span class="charliteral">&#39;b&#39;</span>)</div>
-<div class="line"><span class="lineno">  389</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;Black&quot;</span>;</div>
+<div class="line"><span class="lineno">  389</span>            cout &lt;&lt; <span class="stringliteral">&quot;Black&quot;</span>;</div>
 <div class="line"><span class="lineno">  390</span>        <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">  391</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;Red&quot;</span>;</div>
+<div class="line"><span class="lineno">  391</span>            cout &lt;&lt; <span class="stringliteral">&quot;Red&quot;</span>;</div>
 <div class="line"><span class="lineno">  392</span>        <span class="keywordflow">if</span> (p-&gt;parent != NULL)</div>
-<div class="line"><span class="lineno">  393</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n Parent: &quot;</span> &lt;&lt; p-&gt;parent-&gt;key;</div>
+<div class="line"><span class="lineno">  393</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n Parent: &quot;</span> &lt;&lt; p-&gt;parent-&gt;key;</div>
 <div class="line"><span class="lineno">  394</span>        <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">  395</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n There is no parent of the node.  &quot;</span>;</div>
+<div class="line"><span class="lineno">  395</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n There is no parent of the node.  &quot;</span>;</div>
 <div class="line"><span class="lineno">  396</span>        <span class="keywordflow">if</span> (p-&gt;right != NULL)</div>
-<div class="line"><span class="lineno">  397</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n Right Child: &quot;</span> &lt;&lt; p-&gt;right-&gt;key;</div>
+<div class="line"><span class="lineno">  397</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n Right Child: &quot;</span> &lt;&lt; p-&gt;right-&gt;key;</div>
 <div class="line"><span class="lineno">  398</span>        <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">  399</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n There is no right child of the node.  &quot;</span>;</div>
+<div class="line"><span class="lineno">  399</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n There is no right child of the node.  &quot;</span>;</div>
 <div class="line"><span class="lineno">  400</span>        <span class="keywordflow">if</span> (p-&gt;left != NULL)</div>
-<div class="line"><span class="lineno">  401</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n Left Child: &quot;</span> &lt;&lt; p-&gt;left-&gt;key;</div>
+<div class="line"><span class="lineno">  401</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n Left Child: &quot;</span> &lt;&lt; p-&gt;left-&gt;key;</div>
 <div class="line"><span class="lineno">  402</span>        <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">  403</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n There is no left child of the node.  &quot;</span>;</div>
-<div class="line"><span class="lineno">  404</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><span class="lineno">  403</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n There is no left child of the node.  &quot;</span>;</div>
+<div class="line"><span class="lineno">  404</span>        cout &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">  405</span>        <span class="keywordflow">if</span> (p-&gt;left)</div>
 <div class="line"><span class="lineno">  406</span>        {</div>
-<div class="line"><span class="lineno">  407</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n\nLeft:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  407</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n\nLeft:\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  408</span>            display(p-&gt;left);</div>
 <div class="line"><span class="lineno">  409</span>        }</div>
 <div class="line"><span class="lineno">  410</span>        <span class="comment">/*else</span></div>
 <div class="line"><span class="lineno">  411</span><span class="comment">         cout&lt;&lt;&quot;\nNo Left Child.\n&quot;;*/</span></div>
 <div class="line"><span class="lineno">  412</span>        <span class="keywordflow">if</span> (p-&gt;right)</div>
 <div class="line"><span class="lineno">  413</span>        {</div>
-<div class="line"><span class="lineno">  414</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n\nRight:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  414</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n\nRight:\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  415</span>            display(p-&gt;right);</div>
 <div class="line"><span class="lineno">  416</span>        }</div>
 <div class="line"><span class="lineno">  417</span>        <span class="comment">/*else</span></div>
 <div class="line"><span class="lineno">  418</span><span class="comment">         cout&lt;&lt;&quot;\nNo Right Child.\n&quot;*/</span></div>
 <div class="line"><span class="lineno">  419</span>    }</div>
 <div class="line"><span class="lineno">  420</span>}</div>
-<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> matrix_exponentiation.cpp:36</div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -469,10 +495,12 @@ Private Attributes</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   35</span>{</div>
 <div class="line"><span class="lineno">   36</span>    <span class="keywordtype">int</span> z, i = 0;</div>
-<div class="line"><span class="lineno">   37</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter key of the node to be inserted: &quot;</span>;</div>
-<div class="line"><span class="lineno">   38</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">cin</a> &gt;&gt; z;</div>
+<div class="line"><span class="lineno">   37</span>    cout &lt;&lt; <span class="stringliteral">&quot;\nEnter key of the node to be inserted: &quot;</span>;</div>
+<div class="line"><span class="lineno">   38</span>    cin &gt;&gt; z;</div>
 <div class="line"><span class="lineno">   39</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *p, *q;</div>
 <div class="line"><span class="lineno">   40</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
 <div class="line"><span class="lineno">   41</span>    t-&gt;key = z;</div>
@@ -504,7 +532,7 @@ Private Attributes</h2></td></tr>
 <div class="line"><span class="lineno">   67</span>    }</div>
 <div class="line"><span class="lineno">   68</span>    insertfix(t);</div>
 <div class="line"><span class="lineno">   69</span>}</div>
-<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -522,6 +550,8 @@ Private Attributes</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00070">70</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   71</span>{</div>
 <div class="line"><span class="lineno">   72</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *u;</div>
 <div class="line"><span class="lineno">   73</span>    <span class="keywordflow">if</span> (root == t)</div>
@@ -585,7 +615,7 @@ Private Attributes</h2></td></tr>
 <div class="line"><span class="lineno">  131</span>        root-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
 <div class="line"><span class="lineno">  132</span>    }</div>
 <div class="line"><span class="lineno">  133</span>}</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:115</div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00115">composite_simpson_rule.cpp:115</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -603,6 +633,8 @@ Private Attributes</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00295">295</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  296</span>{</div>
 <div class="line"><span class="lineno">  297</span>    <span class="keywordflow">if</span> (p-&gt;right == NULL)</div>
 <div class="line"><span class="lineno">  298</span>        <span class="keywordflow">return</span>;</div>
@@ -648,6 +680,8 @@ Private Attributes</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00324">324</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  325</span>{</div>
 <div class="line"><span class="lineno">  326</span>    <span class="keywordflow">if</span> (p-&gt;left == NULL)</div>
 <div class="line"><span class="lineno">  327</span>        <span class="keywordflow">return</span>;</div>
@@ -693,15 +727,17 @@ Private Attributes</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00421">421</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  422</span>{</div>
 <div class="line"><span class="lineno">  423</span>    <span class="keywordflow">if</span> (root == NULL)</div>
 <div class="line"><span class="lineno">  424</span>    {</div>
-<div class="line"><span class="lineno">  425</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEmpty Tree\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  425</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nEmpty Tree\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  426</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  427</span>    }</div>
 <div class="line"><span class="lineno">  428</span>    <span class="keywordtype">int</span> x;</div>
-<div class="line"><span class="lineno">  429</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n Enter key of the node to be searched: &quot;</span>;</div>
-<div class="line"><span class="lineno">  430</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">cin</a> &gt;&gt; x;</div>
+<div class="line"><span class="lineno">  429</span>    cout &lt;&lt; <span class="stringliteral">&quot;\n Enter key of the node to be searched: &quot;</span>;</div>
+<div class="line"><span class="lineno">  430</span>    cin &gt;&gt; x;</div>
 <div class="line"><span class="lineno">  431</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *p = root;</div>
 <div class="line"><span class="lineno">  432</span>    <span class="keywordtype">int</span> found = 0;</div>
 <div class="line"><span class="lineno">  433</span>    <span class="keywordflow">while</span> (p != NULL &amp;&amp; found == 0)</div>
@@ -717,29 +753,29 @@ Private Attributes</h2></td></tr>
 <div class="line"><span class="lineno">  443</span>        }</div>
 <div class="line"><span class="lineno">  444</span>    }</div>
 <div class="line"><span class="lineno">  445</span>    <span class="keywordflow">if</span> (found == 0)</div>
-<div class="line"><span class="lineno">  446</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\nElement Not Found.&quot;</span>;</div>
+<div class="line"><span class="lineno">  446</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nElement Not Found.&quot;</span>;</div>
 <div class="line"><span class="lineno">  447</span>    <span class="keywordflow">else</span></div>
 <div class="line"><span class="lineno">  448</span>    {</div>
-<div class="line"><span class="lineno">  449</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n\t FOUND NODE: &quot;</span>;</div>
-<div class="line"><span class="lineno">  450</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n Key: &quot;</span> &lt;&lt; p-&gt;key;</div>
-<div class="line"><span class="lineno">  451</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n Colour: &quot;</span>;</div>
+<div class="line"><span class="lineno">  449</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n\t FOUND NODE: &quot;</span>;</div>
+<div class="line"><span class="lineno">  450</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n Key: &quot;</span> &lt;&lt; p-&gt;key;</div>
+<div class="line"><span class="lineno">  451</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n Colour: &quot;</span>;</div>
 <div class="line"><span class="lineno">  452</span>        <span class="keywordflow">if</span> (p-&gt;color == <span class="charliteral">&#39;b&#39;</span>)</div>
-<div class="line"><span class="lineno">  453</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;Black&quot;</span>;</div>
+<div class="line"><span class="lineno">  453</span>            cout &lt;&lt; <span class="stringliteral">&quot;Black&quot;</span>;</div>
 <div class="line"><span class="lineno">  454</span>        <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">  455</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;Red&quot;</span>;</div>
+<div class="line"><span class="lineno">  455</span>            cout &lt;&lt; <span class="stringliteral">&quot;Red&quot;</span>;</div>
 <div class="line"><span class="lineno">  456</span>        <span class="keywordflow">if</span> (p-&gt;parent != NULL)</div>
-<div class="line"><span class="lineno">  457</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n Parent: &quot;</span> &lt;&lt; p-&gt;parent-&gt;key;</div>
+<div class="line"><span class="lineno">  457</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n Parent: &quot;</span> &lt;&lt; p-&gt;parent-&gt;key;</div>
 <div class="line"><span class="lineno">  458</span>        <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">  459</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n There is no parent of the node.  &quot;</span>;</div>
+<div class="line"><span class="lineno">  459</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n There is no parent of the node.  &quot;</span>;</div>
 <div class="line"><span class="lineno">  460</span>        <span class="keywordflow">if</span> (p-&gt;right != NULL)</div>
-<div class="line"><span class="lineno">  461</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n Right Child: &quot;</span> &lt;&lt; p-&gt;right-&gt;key;</div>
+<div class="line"><span class="lineno">  461</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n Right Child: &quot;</span> &lt;&lt; p-&gt;right-&gt;key;</div>
 <div class="line"><span class="lineno">  462</span>        <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">  463</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n There is no right child of the node.  &quot;</span>;</div>
+<div class="line"><span class="lineno">  463</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n There is no right child of the node.  &quot;</span>;</div>
 <div class="line"><span class="lineno">  464</span>        <span class="keywordflow">if</span> (p-&gt;left != NULL)</div>
-<div class="line"><span class="lineno">  465</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n Left Child: &quot;</span> &lt;&lt; p-&gt;left-&gt;key;</div>
+<div class="line"><span class="lineno">  465</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n Left Child: &quot;</span> &lt;&lt; p-&gt;left-&gt;key;</div>
 <div class="line"><span class="lineno">  466</span>        <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">  467</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;\n There is no left child of the node.  &quot;</span>;</div>
-<div class="line"><span class="lineno">  468</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><span class="lineno">  467</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n There is no left child of the node.  &quot;</span>;</div>
+<div class="line"><span class="lineno">  468</span>        cout &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">  469</span> </div>
 <div class="line"><span class="lineno">  470</span>    }</div>
 <div class="line"><span class="lineno">  471</span>}</div>
@@ -760,6 +796,8 @@ Private Attributes</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00354">354</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  355</span>{</div>
 <div class="line"><span class="lineno">  356</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *y = NULL;</div>
 <div class="line"><span class="lineno">  357</span>    <span class="keywordflow">if</span> (p-&gt;left != NULL)</div>
@@ -777,10 +815,59 @@ Private Attributes</h2></td></tr>
 <div class="line"><span class="lineno">  369</span>    <span class="keywordflow">return</span> y;</div>
 <div class="line"><span class="lineno">  370</span>}</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a3bea624ca2da11e4569bc1e9cda849b5" name="a3bea624ca2da11e4569bc1e9cda849b5"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a3bea624ca2da11e4569bc1e9cda849b5">&#9670;&#160;</a></span>q</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a>* RBtree::q</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00016">16</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a84627c15a240f1e5821c54802fccf898" name="a84627c15a240f1e5821c54802fccf898"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a84627c15a240f1e5821c54802fccf898">&#9670;&#160;</a></span>root</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a>* RBtree::root</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00015">15</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>data_structures/<b>rb_tree.cpp</b></li>
+<li>data_structures/<a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d8/d76/morse__code_8cpp.html b/d8/d76/morse__code_8cpp.html
index 0819dd37a..866d670e4 100644
--- a/d8/d76/morse__code_8cpp.html
+++ b/d8/d76/morse__code_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ciphers/morse_code.cpp File Reference</title>
+<title>TheAlgorithms/C++: ciphers/morse_code.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for morse_code.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d93/morse__code_8cpp__incl.svg" width="331" height="111"><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">
+</div>
+<p><a href="../../d8/d76/morse__code_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d4e/namespaceciphers.html">ciphers</a></td></tr>
@@ -134,13 +153,13 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:ab31773fd11555d21f70d6914138d9535" id="r_ab31773fd11555d21f70d6914138d9535"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab31773fd11555d21f70d6914138d9535">ciphers::morse::char_to_morse</a> (const char &amp;c)</td></tr>
+<tr class="memitem:ab31773fd11555d21f70d6914138d9535" id="r_ab31773fd11555d21f70d6914138d9535"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab31773fd11555d21f70d6914138d9535">ciphers::morse::char_to_morse</a> (const char &amp;c)</td></tr>
 <tr class="separator:ab31773fd11555d21f70d6914138d9535"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ac9f294b0dec08a4a11d477a32f9bd829" id="r_ac9f294b0dec08a4a11d477a32f9bd829"><td class="memItemLeft" align="right" valign="top">char&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac9f294b0dec08a4a11d477a32f9bd829">ciphers::morse::morse_to_char</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;s)</td></tr>
+<tr class="memitem:ac9f294b0dec08a4a11d477a32f9bd829" id="r_ac9f294b0dec08a4a11d477a32f9bd829"><td class="memItemLeft" align="right" valign="top">char&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac9f294b0dec08a4a11d477a32f9bd829">ciphers::morse::morse_to_char</a> (const std::string &amp;s)</td></tr>
 <tr class="separator:ac9f294b0dec08a4a11d477a32f9bd829"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0242e458904de8a242fcdaffe9e3ba1a" id="r_a0242e458904de8a242fcdaffe9e3ba1a"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0242e458904de8a242fcdaffe9e3ba1a">ciphers::morse::encrypt</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text)</td></tr>
+<tr class="memitem:a0242e458904de8a242fcdaffe9e3ba1a" id="r_a0242e458904de8a242fcdaffe9e3ba1a"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0242e458904de8a242fcdaffe9e3ba1a">ciphers::morse::encrypt</a> (const std::string &amp;text)</td></tr>
 <tr class="separator:a0242e458904de8a242fcdaffe9e3ba1a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a15c66ec8cf4cef0a35c50cbab86965dc" id="r_a15c66ec8cf4cef0a35c50cbab86965dc"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a15c66ec8cf4cef0a35c50cbab86965dc">ciphers::morse::decrypt</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text)</td></tr>
+<tr class="memitem:a15c66ec8cf4cef0a35c50cbab86965dc" id="r_a15c66ec8cf4cef0a35c50cbab86965dc"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a15c66ec8cf4cef0a35c50cbab86965dc">ciphers::morse::decrypt</a> (const std::string &amp;text)</td></tr>
 <tr class="separator:a15c66ec8cf4cef0a35c50cbab86965dc"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
 <tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to test above algorithm.  <br /></td></tr>
@@ -153,6 +172,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Implementation of [Morse Code] (<a href="https://en.wikipedia.org/wiki/Morse_code">https://en.wikipedia.org/wiki/Morse_code</a>). </p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/imdeep2905" target="_blank">Deep Raval</a></dd></dl>
 <p>Morse code is a method used in telecommunication to encode text characters as standardized sequences of two different signal durations, called dots and dashes or dits and dahs. Morse code is named after Samuel Morse, an inventor of the telegraph. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/d76/morse__code_8cpp_source.html">morse_code.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ab31773fd11555d21f70d6914138d9535" name="ab31773fd11555d21f70d6914138d9535"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ab31773fd11555d21f70d6914138d9535">&#9670;&#160;</a></span>char_to_morse()</h2>
@@ -161,7 +182,7 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ciphers::morse::char_to_morse </td>
+          <td class="memname">std::string ciphers::morse::char_to_morse </td>
           <td>(</td>
           <td class="paramtype">const char &amp;</td>          <td class="paramname"><span class="paramname"><em>c</em></span></td><td>)</td>
           <td></td>
@@ -175,6 +196,8 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>morse representation string of character </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d76/morse__code_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../d8/d76/morse__code_8cpp_source.html">morse_code.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   33</span>                                       {</div>
 <div class="line"><span class="lineno">   34</span>    <span class="comment">// return corresponding morse code</span></div>
 <div class="line"><span class="lineno">   35</span>    <span class="keywordflow">switch</span> (c) {</div>
@@ -251,19 +274,11 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  106</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;0&#39;</span>:</div>
 <div class="line"><span class="lineno">  107</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;-----&quot;</span>;</div>
 <div class="line"><span class="lineno">  108</span>        <span class="keywordflow">default</span>:</div>
-<div class="line"><span class="lineno">  109</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Found invalid character: &quot;</span> &lt;&lt; c &lt;&lt; <span class="charliteral">&#39; &#39;</span> &lt;&lt; <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">  110</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(0);</div>
+<div class="line"><span class="lineno">  109</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Found invalid character: &quot;</span> &lt;&lt; c &lt;&lt; <span class="charliteral">&#39; &#39;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  110</span>            std::exit(0);</div>
 <div class="line"><span class="lineno">  111</span>    }</div>
 <div class="line"><span class="lineno">  112</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::cerr</a></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="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.svg" width="271" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a15c66ec8cf4cef0a35c50cbab86965dc" name="a15c66ec8cf4cef0a35c50cbab86965dc"></a>
@@ -273,9 +288,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ciphers::morse::decrypt </td>
+          <td class="memname">std::string ciphers::morse::decrypt </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -287,41 +302,32 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new decrypted text </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d76/morse__code_8cpp_source.html#l00216">216</a> of file <a class="el" href="../../d8/d76/morse__code_8cpp_source.html">morse_code.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  216</span>                                         {</div>
 <div class="line"><span class="lineno">  217</span>    <span class="comment">// Going through each character of text and converting it</span></div>
 <div class="line"><span class="lineno">  218</span>    <span class="comment">// back to normal representation.</span></div>
-<div class="line"><span class="lineno">  219</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> decrypted_text = <span class="stringliteral">&quot;&quot;</span>;  <span class="comment">// Empty string to store decrypted text</span></div>
+<div class="line"><span class="lineno">  219</span>    std::string decrypted_text = <span class="stringliteral">&quot;&quot;</span>;  <span class="comment">// Empty string to store decrypted text</span></div>
 <div class="line"><span class="lineno">  220</span>    <span class="comment">// Spliting string (with delimiter = &quot; &quot;) and storing it</span></div>
 <div class="line"><span class="lineno">  221</span>    <span class="comment">// in vector</span></div>
-<div class="line"><span class="lineno">  222</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> pos_start = 0, pos_end = 0, delim_len = 1;</div>
-<div class="line"><span class="lineno">  223</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::string&gt;</a> splits;</div>
-<div class="line"><span class="lineno">  224</span>    <span class="keywordflow">while</span> ((pos_end = text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/find.html">find</a>(<span class="charliteral">&#39; &#39;</span>, pos_start)) != std::string::npos) {</div>
-<div class="line"><span class="lineno">  225</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> token = text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html">substr</a>(pos_start, pos_end - pos_start);</div>
+<div class="line"><span class="lineno">  222</span>    std::size_t pos_start = 0, pos_end = 0, delim_len = 1;</div>
+<div class="line"><span class="lineno">  223</span>    std::vector&lt;std::string&gt; splits;</div>
+<div class="line"><span class="lineno">  224</span>    <span class="keywordflow">while</span> ((pos_end = text.find(<span class="charliteral">&#39; &#39;</span>, pos_start)) != std::string::npos) {</div>
+<div class="line"><span class="lineno">  225</span>        std::string token = text.substr(pos_start, pos_end - pos_start);</div>
 <div class="line"><span class="lineno">  226</span>        pos_start = pos_end + delim_len;</div>
-<div class="line"><span class="lineno">  227</span>        splits.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(token);</div>
+<div class="line"><span class="lineno">  227</span>        splits.push_back(token);</div>
 <div class="line"><span class="lineno">  228</span>    }</div>
 <div class="line"><span class="lineno">  229</span> </div>
 <div class="line"><span class="lineno">  230</span>    <span class="comment">// Traversing through each morse code string</span></div>
-<div class="line"><span class="lineno">  231</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;s : splits) {</div>
+<div class="line"><span class="lineno">  231</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> std::string &amp;s : splits) {</div>
 <div class="line"><span class="lineno">  232</span>        <span class="comment">// Add corresponding character</span></div>
 <div class="line"><span class="lineno">  233</span>        decrypted_text += <a class="code hl_function" href="#ac9f294b0dec08a4a11d477a32f9bd829">ciphers::morse::morse_to_char</a>(s);</div>
 <div class="line"><span class="lineno">  234</span>    }</div>
 <div class="line"><span class="lineno">  235</span> </div>
 <div class="line"><span class="lineno">  236</span>    <span class="keywordflow">return</span> decrypted_text;  <span class="comment">// Returning decrypted text</span></div>
 <div class="line"><span class="lineno">  237</span>}</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="afind_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/find.html">std::string::find</a></div><div class="ttdeci">T find(T... args)</div></div>
-<div class="ttc" id="amorse__code_8cpp_html_ac9f294b0dec08a4a11d477a32f9bd829"><div class="ttname"><a href="#ac9f294b0dec08a4a11d477a32f9bd829">ciphers::morse::morse_to_char</a></div><div class="ttdeci">char morse_to_char(const std::string &amp;s)</div><div class="ttdef"><b>Definition</b> morse_code.cpp:118</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></div></div>
-<div class="ttc" id="asubstr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html">std::string::substr</a></div><div class="ttdeci">T substr(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.svg" width="491" height="224"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amorse__code_8cpp_html_ac9f294b0dec08a4a11d477a32f9bd829"><div class="ttname"><a href="#ac9f294b0dec08a4a11d477a32f9bd829">ciphers::morse::morse_to_char</a></div><div class="ttdeci">char morse_to_char(const std::string &amp;s)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d76/morse__code_8cpp_source.html#l00118">morse_code.cpp:118</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0242e458904de8a242fcdaffe9e3ba1a" name="a0242e458904de8a242fcdaffe9e3ba1a"></a>
@@ -331,9 +337,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ciphers::morse::encrypt </td>
+          <td class="memname">std::string ciphers::morse::encrypt </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -345,8 +351,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new encrypted text </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d76/morse__code_8cpp_source.html#l00202">202</a> of file <a class="el" href="../../d8/d76/morse__code_8cpp_source.html">morse_code.cpp</a>.</p>
 <div class="fragment"><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/string/basic_string.html">std::string</a> encrypted_text = <span class="stringliteral">&quot;&quot;</span>;  <span class="comment">// Empty string to store encrypted text</span></div>
+<div class="line"><span class="lineno">  203</span>    std::string encrypted_text = <span class="stringliteral">&quot;&quot;</span>;  <span class="comment">// Empty string to store encrypted text</span></div>
 <div class="line"><span class="lineno">  204</span>    <span class="comment">// Going through each character of text and converting it</span></div>
 <div class="line"><span class="lineno">  205</span>    <span class="comment">// to morse representation</span></div>
 <div class="line"><span class="lineno">  206</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">char</span> &amp;c : text) {</div>
@@ -354,13 +362,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  208</span>    }</div>
 <div class="line"><span class="lineno">  209</span>    <span class="keywordflow">return</span> encrypted_text;  <span class="comment">// Returning encrypted text</span></div>
 <div class="line"><span class="lineno">  210</span>}</div>
-<div class="ttc" id="amorse__code_8cpp_html_ab31773fd11555d21f70d6914138d9535"><div class="ttname"><a href="#ab31773fd11555d21f70d6914138d9535">ciphers::morse::char_to_morse</a></div><div class="ttdeci">std::string char_to_morse(const char &amp;c)</div><div class="ttdef"><b>Definition</b> morse_code.cpp:33</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.svg" width="478" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amorse__code_8cpp_html_ab31773fd11555d21f70d6914138d9535"><div class="ttname"><a href="#ab31773fd11555d21f70d6914138d9535">ciphers::morse::char_to_morse</a></div><div class="ttdeci">std::string char_to_morse(const char &amp;c)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d76/morse__code_8cpp_source.html#l00033">morse_code.cpp:33</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -380,18 +383,15 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d76/morse__code_8cpp_source.html#l00268">268</a> of file <a class="el" href="../../d8/d76/morse__code_8cpp_source.html">morse_code.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  268</span>           {</div>
 <div class="line"><span class="lineno">  269</span>    <span class="comment">// Testing</span></div>
 <div class="line"><span class="lineno">  270</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
 <div class="line"><span class="lineno">  271</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  272</span>}</div>
-<div class="ttc" id="amorse__code_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test above algorithm.</div><div class="ttdef"><b>Definition</b> morse_code.cpp:245</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amorse__code_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test above algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d76/morse__code_8cpp_source.html#l00245">morse_code.cpp:245</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac9f294b0dec08a4a11d477a32f9bd829" name="ac9f294b0dec08a4a11d477a32f9bd829"></a>
@@ -403,7 +403,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">char ciphers::morse::morse_to_char </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -415,6 +415,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>corresponding character </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d76/morse__code_8cpp_source.html#l00118">118</a> of file <a class="el" href="../../d8/d76/morse__code_8cpp_source.html">morse_code.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  118</span>                                       {</div>
 <div class="line"><span class="lineno">  119</span>    <span class="comment">// return corresponding character</span></div>
 <div class="line"><span class="lineno">  120</span>    <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;.-&quot;</span>) {</div>
@@ -490,16 +492,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  190</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;-----&quot;</span>) {</div>
 <div class="line"><span class="lineno">  191</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;0&#39;</span>;</div>
 <div class="line"><span class="lineno">  192</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  193</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Found invalid Morse code: &quot;</span> &lt;&lt; s &lt;&lt; <span class="charliteral">&#39; &#39;</span> &lt;&lt; <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">  194</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(0);</div>
+<div class="line"><span class="lineno">  193</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Found invalid Morse code: &quot;</span> &lt;&lt; s &lt;&lt; <span class="charliteral">&#39; &#39;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  194</span>        std::exit(0);</div>
 <div class="line"><span class="lineno">  195</span>    }</div>
 <div class="line"><span class="lineno">  196</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.svg" width="282" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -527,32 +524,29 @@ Here is the call graph for this function:</div>
 
 <p>Function to test above algorithm. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d76/morse__code_8cpp_source.html#l00245">245</a> of file <a class="el" href="../../d8/d76/morse__code_8cpp_source.html">morse_code.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  245</span>                   {</div>
 <div class="line"><span class="lineno">  246</span>    <span class="comment">// Test 1</span></div>
-<div class="line"><span class="lineno">  247</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> text1 = <span class="stringliteral">&quot;01234567890&quot;</span>;</div>
-<div class="line"><span class="lineno">  248</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> encrypted1 = <a class="code hl_function" href="#a0242e458904de8a242fcdaffe9e3ba1a">ciphers::morse::encrypt</a>(text1);</div>
-<div class="line"><span class="lineno">  249</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> decrypted1 = <a class="code hl_function" href="#a15c66ec8cf4cef0a35c50cbab86965dc">ciphers::morse::decrypt</a>(encrypted1);</div>
+<div class="line"><span class="lineno">  247</span>    std::string text1 = <span class="stringliteral">&quot;01234567890&quot;</span>;</div>
+<div class="line"><span class="lineno">  248</span>    std::string encrypted1 = <a class="code hl_function" href="#a0242e458904de8a242fcdaffe9e3ba1a">ciphers::morse::encrypt</a>(text1);</div>
+<div class="line"><span class="lineno">  249</span>    std::string decrypted1 = <a class="code hl_function" href="#a15c66ec8cf4cef0a35c50cbab86965dc">ciphers::morse::decrypt</a>(encrypted1);</div>
 <div class="line"><span class="lineno">  250</span>    assert(text1 == decrypted1);</div>
-<div class="line"><span class="lineno">  251</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text1 &lt;&lt; <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">  252</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Encrypted text : &quot;</span> &lt;&lt; encrypted1 &lt;&lt; <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">  253</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Decrypted text : &quot;</span> &lt;&lt; decrypted1 &lt;&lt; <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">  251</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text1 &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  252</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Encrypted text : &quot;</span> &lt;&lt; encrypted1 &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  253</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Decrypted text : &quot;</span> &lt;&lt; decrypted1 &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  254</span>    <span class="comment">// Test 2</span></div>
-<div class="line"><span class="lineno">  255</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> text2 = <span class="stringliteral">&quot;abcdefghijklmnopqrstuvwxyz&quot;</span>;</div>
-<div class="line"><span class="lineno">  256</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> encrypted2 = <a class="code hl_function" href="#a0242e458904de8a242fcdaffe9e3ba1a">ciphers::morse::encrypt</a>(text2);</div>
-<div class="line"><span class="lineno">  257</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> decrypted2 = <a class="code hl_function" href="#a15c66ec8cf4cef0a35c50cbab86965dc">ciphers::morse::decrypt</a>(encrypted2);</div>
+<div class="line"><span class="lineno">  255</span>    std::string text2 = <span class="stringliteral">&quot;abcdefghijklmnopqrstuvwxyz&quot;</span>;</div>
+<div class="line"><span class="lineno">  256</span>    std::string encrypted2 = <a class="code hl_function" href="#a0242e458904de8a242fcdaffe9e3ba1a">ciphers::morse::encrypt</a>(text2);</div>
+<div class="line"><span class="lineno">  257</span>    std::string decrypted2 = <a class="code hl_function" href="#a15c66ec8cf4cef0a35c50cbab86965dc">ciphers::morse::decrypt</a>(encrypted2);</div>
 <div class="line"><span class="lineno">  258</span>    assert(text2 == decrypted2);</div>
-<div class="line"><span class="lineno">  259</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text2 &lt;&lt; <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">  260</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Encrypted text : &quot;</span> &lt;&lt; encrypted2 &lt;&lt; <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">  261</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Decrypted text : &quot;</span> &lt;&lt; decrypted2 &lt;&lt; <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">  259</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text2 &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  260</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Encrypted text : &quot;</span> &lt;&lt; encrypted2 &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  261</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Decrypted text : &quot;</span> &lt;&lt; decrypted2 &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  262</span>}</div>
-<div class="ttc" id="amorse__code_8cpp_html_a0242e458904de8a242fcdaffe9e3ba1a"><div class="ttname"><a href="#a0242e458904de8a242fcdaffe9e3ba1a">ciphers::morse::encrypt</a></div><div class="ttdeci">std::string encrypt(const std::string &amp;text)</div><div class="ttdef"><b>Definition</b> morse_code.cpp:202</div></div>
-<div class="ttc" id="amorse__code_8cpp_html_a15c66ec8cf4cef0a35c50cbab86965dc"><div class="ttname"><a href="#a15c66ec8cf4cef0a35c50cbab86965dc">ciphers::morse::decrypt</a></div><div class="ttdeci">std::string decrypt(const std::string &amp;text)</div><div class="ttdef"><b>Definition</b> morse_code.cpp:216</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amorse__code_8cpp_html_a0242e458904de8a242fcdaffe9e3ba1a"><div class="ttname"><a href="#a0242e458904de8a242fcdaffe9e3ba1a">ciphers::morse::encrypt</a></div><div class="ttdeci">std::string encrypt(const std::string &amp;text)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d76/morse__code_8cpp_source.html#l00202">morse_code.cpp:202</a></div></div>
+<div class="ttc" id="amorse__code_8cpp_html_a15c66ec8cf4cef0a35c50cbab86965dc"><div class="ttname"><a href="#a15c66ec8cf4cef0a35c50cbab86965dc">ciphers::morse::decrypt</a></div><div class="ttdeci">std::string decrypt(const std::string &amp;text)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d76/morse__code_8cpp_source.html#l00216">morse_code.cpp:216</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.map b/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.map
deleted file mode 100644
index 00fef91e2..000000000
--- a/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="ciphers::morse::encrypt" name="ciphers::morse::encrypt">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,37,164,62"/>
-<area shape="rect" id="Node000002" href="$d8/d76/morse__code_8cpp.html#ab31773fd11555d21f70d6914138d9535" title=" " alt="" coords="212,29,352,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="164,47,196,47,196,52,164,52"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="252,29,251,19,255,11,266,5,282,3,299,5,309,11,306,16,297,10,282,8,268,10,259,14,256,20,257,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="400,12,471,37"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="352,35,384,30,385,35,353,41"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="402,61,470,86"/>
-<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="353,58,387,63,386,69,352,63"/>
-</map>
diff --git a/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.md5 b/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.md5
deleted file mode 100644
index d1bda25e5..000000000
--- a/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f610768b235cf32c95c142a3106df957
\ No newline at end of file
diff --git a/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.svg b/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.svg
deleted file mode 100644
index cf91e5c9f..000000000
--- a/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::morse::encrypt Pages: 1 -->
-<svg width="358pt" height="69pt"
- viewBox="0.00 0.00 357.50 68.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64.88)">
-<title>ciphers::morse::encrypt</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="118.75,-37.25 0,-37.25 0,-18 118.75,-18 118.75,-37.25"/>
-<text text-anchor="middle" x="59.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::morse::encrypt</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d76/morse__code_8cpp.html#ab31773fd11555d21f70d6914138d9535" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260,-42.88 154.75,-42.88 154.75,-12.37 260,-12.37 260,-42.88"/>
-<text text-anchor="start" x="162.75" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::morse::char</text>
-<text text-anchor="middle" x="207.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_to_morse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.92,-27.62C126.9,-27.62 135.12,-27.62 143.18,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.91,-31.13 152.91,-27.63 142.91,-24.13 142.91,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.93,-43.36C182.76,-52.43 189.57,-60.88 207.38,-60.88 217.11,-60.88 223.56,-58.35 226.72,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.18,-55.16 227.67,-44.87 223.22,-54.48 230.18,-55.16"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="349.5,-56.25 296,-56.25 296,-37 349.5,-37 349.5,-56.25"/>
-<text text-anchor="middle" x="322.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.42,-36.35C268.53,-37.71 276.78,-39.09 284.48,-40.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="283.73,-43.8 294.17,-42 284.89,-36.9 283.73,-43.8"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="348.38,-19.25 297.12,-19.25 297.12,0 348.38,0 348.38,-19.25"/>
-<text text-anchor="middle" x="322.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.42,-19.36C268.94,-18.01 277.61,-16.63 285.64,-15.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.04,-18.84 295.36,-13.81 284.94,-11.93 286.04,-18.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph_org.svg b/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph_org.svg
deleted file mode 100644
index f6d042f47..000000000
--- a/d8/d76/morse__code_8cpp_a0242e458904de8a242fcdaffe9e3ba1a_cgraph_org.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::morse::encrypt Pages: 1 -->
-<svg width="358pt" height="69pt"
- viewBox="0.00 0.00 357.50 68.88" 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 64.88)">
-<title>ciphers::morse::encrypt</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="118.75,-37.25 0,-37.25 0,-18 118.75,-18 118.75,-37.25"/>
-<text text-anchor="middle" x="59.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::morse::encrypt</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d76/morse__code_8cpp.html#ab31773fd11555d21f70d6914138d9535" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260,-42.88 154.75,-42.88 154.75,-12.37 260,-12.37 260,-42.88"/>
-<text text-anchor="start" x="162.75" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::morse::char</text>
-<text text-anchor="middle" x="207.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_to_morse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.92,-27.62C126.9,-27.62 135.12,-27.62 143.18,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.91,-31.13 152.91,-27.63 142.91,-24.13 142.91,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.93,-43.36C182.76,-52.43 189.57,-60.88 207.38,-60.88 217.11,-60.88 223.56,-58.35 226.72,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.18,-55.16 227.67,-44.87 223.22,-54.48 230.18,-55.16"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="349.5,-56.25 296,-56.25 296,-37 349.5,-37 349.5,-56.25"/>
-<text text-anchor="middle" x="322.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.42,-36.35C268.53,-37.71 276.78,-39.09 284.48,-40.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="283.73,-43.8 294.17,-42 284.89,-36.9 283.73,-43.8"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="348.38,-19.25 297.12,-19.25 297.12,0 348.38,0 348.38,-19.25"/>
-<text text-anchor="middle" x="322.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.42,-19.36C268.94,-18.01 277.61,-16.63 285.64,-15.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.04,-18.84 295.36,-13.81 284.94,-11.93 286.04,-18.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.map b/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.map
deleted file mode 100644
index d03e86e91..000000000
--- a/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="ciphers::morse::decrypt" name="ciphers::morse::decrypt">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,116,164,142"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/find.html#" title=" " alt="" coords="235,5,343,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="101,113,149,78,210,41,225,35,227,39,213,46,152,83,104,118"/>
-<area shape="rect" id="Node000003" href="$d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829" title=" " alt="" coords="213,79,364,120"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="163,115,198,110,199,115,164,120"/>
-<area shape="rect" id="Node000006" 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="212,144,366,170"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="164,137,196,141,196,147,163,142"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/substr.html#" title=" " alt="" coords="227,193,350,219"/>
-<area shape="poly" id="edge7_Node000001_Node000007" title=" " alt="" coords="116,140,213,180,229,186,228,191,211,185,114,145"/>
-<area shape="poly" id="edge5_Node000003_Node000003" title=" " alt="" coords="258,79,256,69,261,60,272,55,289,53,307,55,317,61,314,66,305,60,289,58,274,60,265,64,261,70,263,78"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="414,63,485,88"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="365,85,398,80,399,86,365,91"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="416,112,484,138"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="366,109,401,114,400,120,365,114"/>
-</map>
diff --git a/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.md5 b/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.md5
deleted file mode 100644
index 4f98f2ac1..000000000
--- a/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c6c0127144aa7b7263a090673540d0a8
\ No newline at end of file
diff --git a/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.svg b/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.svg
deleted file mode 100644
index 8f41f5ddb..000000000
--- a/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph.svg
+++ /dev/null
@@ -1,165 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::morse::decrypt Pages: 1 -->
-<svg width="368pt" height="168pt"
- viewBox="0.00 0.00 368.00 168.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 164.25)">
-<title>ciphers::morse::decrypt</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="118.75,-77.25 0,-77.25 0,-58 118.75,-58 118.75,-77.25"/>
-<text text-anchor="middle" x="59.38" y="-63.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::morse::decrypt</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.25,-160.25 172,-160.25 172,-141 253.25,-141 253.25,-160.25"/>
-<text text-anchor="middle" x="212.62" y="-146.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.82,-77.71C90.25,-91.45 123.34,-116.1 154.75,-131.62 158.26,-133.36 161.97,-135 165.74,-136.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.42,-139.77 175.01,-140.01 166.88,-133.22 164.42,-139.77"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269.38,-104.88 155.88,-104.88 155.88,-74.38 269.38,-74.38 269.38,-104.88"/>
-<text text-anchor="start" x="163.88" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::morse::morse</text>
-<text text-anchor="middle" x="212.62" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_to_char</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.85,-76.13C127.29,-77.36 136.03,-78.63 144.62,-79.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.89,-83.31 154.29,-81.29 144.9,-76.38 143.89,-83.31"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.5,-56.25 154.75,-56.25 154.75,-37 270.5,-37 270.5,-56.25"/>
-<text text-anchor="middle" x="212.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.85,-59.51C126.76,-58.41 134.94,-57.27 143,-56.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.38,-59.63 152.8,-54.79 142.41,-52.7 143.38,-59.63"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.88,-19.25 166.38,-19.25 166.38,0 258.88,0 258.88,-19.25"/>
-<text text-anchor="middle" x="212.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::substr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.26,-57.65C101.24,-49.18 129.54,-36.93 154.75,-27.62 158.84,-26.11 163.13,-24.61 167.43,-23.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.22,-26.59 176.63,-20.14 166.03,-19.94 168.22,-26.59"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge5_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge5_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.25,-105.36C186.89,-114.43 194.01,-122.88 212.62,-122.88 222.8,-122.88 229.55,-120.35 232.85,-116.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.31,-117.17 233.85,-106.87 229.35,-116.46 236.31,-117.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="360,-117.25 306.5,-117.25 306.5,-98 360,-98 360,-117.25"/>
-<text text-anchor="middle" x="333.25" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M269.81,-98.15C278.34,-99.44 286.96,-100.75 294.95,-101.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.23,-105.4 304.64,-103.44 295.28,-98.47 294.23,-105.4"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.88,-80.25 307.62,-80.25 307.62,-61 358.88,-61 358.88,-80.25"/>
-<text text-anchor="middle" x="333.25" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M269.81,-80.63C278.77,-79.19 287.82,-77.74 296.14,-76.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="296.53,-79.89 305.85,-74.85 295.42,-72.98 296.53,-79.89"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph_org.svg b/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph_org.svg
deleted file mode 100644
index f61db8453..000000000
--- a/d8/d76/morse__code_8cpp_a15c66ec8cf4cef0a35c50cbab86965dc_cgraph_org.svg
+++ /dev/null
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::morse::decrypt Pages: 1 -->
-<svg width="368pt" height="168pt"
- viewBox="0.00 0.00 368.00 168.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 164.25)">
-<title>ciphers::morse::decrypt</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="118.75,-77.25 0,-77.25 0,-58 118.75,-58 118.75,-77.25"/>
-<text text-anchor="middle" x="59.38" y="-63.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::morse::decrypt</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.25,-160.25 172,-160.25 172,-141 253.25,-141 253.25,-160.25"/>
-<text text-anchor="middle" x="212.62" y="-146.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.82,-77.71C90.25,-91.45 123.34,-116.1 154.75,-131.62 158.26,-133.36 161.97,-135 165.74,-136.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.42,-139.77 175.01,-140.01 166.88,-133.22 164.42,-139.77"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269.38,-104.88 155.88,-104.88 155.88,-74.38 269.38,-74.38 269.38,-104.88"/>
-<text text-anchor="start" x="163.88" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::morse::morse</text>
-<text text-anchor="middle" x="212.62" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_to_char</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.85,-76.13C127.29,-77.36 136.03,-78.63 144.62,-79.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.89,-83.31 154.29,-81.29 144.9,-76.38 143.89,-83.31"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.5,-56.25 154.75,-56.25 154.75,-37 270.5,-37 270.5,-56.25"/>
-<text text-anchor="middle" x="212.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.85,-59.51C126.76,-58.41 134.94,-57.27 143,-56.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.38,-59.63 152.8,-54.79 142.41,-52.7 143.38,-59.63"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.88,-19.25 166.38,-19.25 166.38,0 258.88,0 258.88,-19.25"/>
-<text text-anchor="middle" x="212.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::substr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.26,-57.65C101.24,-49.18 129.54,-36.93 154.75,-27.62 158.84,-26.11 163.13,-24.61 167.43,-23.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.22,-26.59 176.63,-20.14 166.03,-19.94 168.22,-26.59"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge5_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge5_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.25,-105.36C186.89,-114.43 194.01,-122.88 212.62,-122.88 222.8,-122.88 229.55,-120.35 232.85,-116.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.31,-117.17 233.85,-106.87 229.35,-116.46 236.31,-117.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="360,-117.25 306.5,-117.25 306.5,-98 360,-98 360,-117.25"/>
-<text text-anchor="middle" x="333.25" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M269.81,-98.15C278.34,-99.44 286.96,-100.75 294.95,-101.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.23,-105.4 304.64,-103.44 295.28,-98.47 294.23,-105.4"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.88,-80.25 307.62,-80.25 307.62,-61 358.88,-61 358.88,-80.25"/>
-<text text-anchor="middle" x="333.25" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M269.81,-80.63C278.77,-79.19 287.82,-77.74 296.14,-76.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="296.53,-79.89 305.85,-74.85 295.42,-72.98 296.53,-79.89"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 969cbc190..000000000
--- a/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Function to test above algorithm." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 3beec0a15..000000000
--- a/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bfed022ee432c6caf8dedaa8aacf402d
\ No newline at end of file
diff --git a/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 474b95828..000000000
--- a/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test above algorithm.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 21269f1f3..000000000
--- a/d8/d76/morse__code_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test above algorithm.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.map b/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.map
deleted file mode 100644
index 7dcc52e2f..000000000
--- a/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="ciphers::morse::char_to_morse" name="ciphers::morse::char_to_morse">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,146,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="46,29,44,19,49,11,60,5,76,3,93,5,103,11,100,16,91,10,75,8,61,10,53,14,49,20,51,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,12,265,37"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="146,35,178,30,179,35,147,41"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="195,61,264,86"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="147,58,180,63,179,69,146,63"/>
-</map>
diff --git a/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.md5 b/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.md5
deleted file mode 100644
index a6d063e70..000000000
--- a/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bc5277a001565f78f33edb7123b8df13
\ No newline at end of file
diff --git a/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.svg b/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.svg
deleted file mode 100644
index 413bc14eb..000000000
--- a/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::morse::char_to_morse Pages: 1 -->
-<svg width="203pt" height="69pt"
- viewBox="0.00 0.00 202.75 68.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64.88)">
-<title>ciphers::morse::char_to_morse</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="105.25,-42.88 0,-42.88 0,-12.37 105.25,-12.37 105.25,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::morse::char</text>
-<text text-anchor="middle" x="52.62" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_to_morse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.18,-43.36C28.01,-52.43 34.82,-60.88 52.62,-60.88 62.36,-60.88 68.81,-58.35 71.97,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.43,-55.16 72.92,-44.87 68.47,-54.48 75.43,-55.16"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194.75,-56.25 141.25,-56.25 141.25,-37 194.75,-37 194.75,-56.25"/>
-<text text-anchor="middle" x="168" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.67,-36.35C113.78,-37.71 122.03,-39.09 129.73,-40.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.98,-43.8 139.42,-42 130.14,-36.9 128.98,-43.8"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.62,-19.25 142.38,-19.25 142.38,0 193.62,0 193.62,-19.25"/>
-<text text-anchor="middle" x="168" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.67,-19.36C114.19,-18.01 122.86,-16.63 130.89,-15.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.29,-18.84 140.61,-13.81 130.19,-11.93 131.29,-18.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph_org.svg b/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph_org.svg
deleted file mode 100644
index 61b109248..000000000
--- a/d8/d76/morse__code_8cpp_ab31773fd11555d21f70d6914138d9535_cgraph_org.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::morse::char_to_morse Pages: 1 -->
-<svg width="203pt" height="69pt"
- viewBox="0.00 0.00 202.75 68.88" 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 64.88)">
-<title>ciphers::morse::char_to_morse</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="105.25,-42.88 0,-42.88 0,-12.37 105.25,-12.37 105.25,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::morse::char</text>
-<text text-anchor="middle" x="52.62" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_to_morse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.18,-43.36C28.01,-52.43 34.82,-60.88 52.62,-60.88 62.36,-60.88 68.81,-58.35 71.97,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.43,-55.16 72.92,-44.87 68.47,-54.48 75.43,-55.16"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194.75,-56.25 141.25,-56.25 141.25,-37 194.75,-37 194.75,-56.25"/>
-<text text-anchor="middle" x="168" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.67,-36.35C113.78,-37.71 122.03,-39.09 129.73,-40.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.98,-43.8 139.42,-42 130.14,-36.9 128.98,-43.8"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.62,-19.25 142.38,-19.25 142.38,0 193.62,0 193.62,-19.25"/>
-<text text-anchor="middle" x="168" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.67,-19.36C114.19,-18.01 122.86,-16.63 130.89,-15.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.29,-18.84 140.61,-13.81 130.19,-11.93 131.29,-18.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.map b/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.map
deleted file mode 100644
index cfe4647cc..000000000
--- a/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="ciphers::morse::morse_to_char" name="ciphers::morse::morse_to_char">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,157,70"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="50,29,49,19,54,11,65,5,81,3,99,5,109,11,106,16,97,10,81,8,66,10,57,14,54,20,55,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="205,12,276,37"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="157,35,189,30,190,35,157,40"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="206,61,274,86"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="157,58,191,64,190,69,157,64"/>
-</map>
diff --git a/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.md5 b/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.md5
deleted file mode 100644
index 0566f9b9d..000000000
--- a/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-da7edd1916c7e381e043f8f7f3fca0fe
\ No newline at end of file
diff --git a/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.svg b/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.svg
deleted file mode 100644
index 546aeb188..000000000
--- a/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::morse::morse_to_char Pages: 1 -->
-<svg width="211pt" height="69pt"
- viewBox="0.00 0.00 211.00 68.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64.88)">
-<title>ciphers::morse::morse_to_char</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="113.5,-42.88 0,-42.88 0,-12.37 113.5,-12.37 113.5,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::morse::morse</text>
-<text text-anchor="middle" x="56.75" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_to_char</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.57,-43.36C31.25,-52.43 38.31,-60.88 56.75,-60.88 66.83,-60.88 73.51,-58.35 76.79,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.25,-55.17 77.77,-44.87 73.28,-54.46 80.25,-55.17"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203,-56.25 149.5,-56.25 149.5,-37 203,-37 203,-56.25"/>
-<text text-anchor="middle" x="176.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.75,-36.68C121.99,-38.01 130.31,-39.36 138.04,-40.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.33,-44.04 147.76,-42.18 138.45,-37.13 137.33,-44.04"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.88,-19.25 150.62,-19.25 150.62,0 201.88,0 201.88,-19.25"/>
-<text text-anchor="middle" x="176.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.75,-19.05C122.33,-17.73 130.98,-16.41 138.98,-15.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.3,-18.67 148.66,-13.7 138.24,-11.75 139.3,-18.67"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph_org.svg b/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph_org.svg
deleted file mode 100644
index 4fce1c0b7..000000000
--- a/d8/d76/morse__code_8cpp_ac9f294b0dec08a4a11d477a32f9bd829_cgraph_org.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::morse::morse_to_char Pages: 1 -->
-<svg width="211pt" height="69pt"
- viewBox="0.00 0.00 211.00 68.88" 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 64.88)">
-<title>ciphers::morse::morse_to_char</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="113.5,-42.88 0,-42.88 0,-12.37 113.5,-12.37 113.5,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::morse::morse</text>
-<text text-anchor="middle" x="56.75" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_to_char</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.57,-43.36C31.25,-52.43 38.31,-60.88 56.75,-60.88 66.83,-60.88 73.51,-58.35 76.79,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.25,-55.17 77.77,-44.87 73.28,-54.46 80.25,-55.17"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203,-56.25 149.5,-56.25 149.5,-37 203,-37 203,-56.25"/>
-<text text-anchor="middle" x="176.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.75,-36.68C121.99,-38.01 130.31,-39.36 138.04,-40.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.33,-44.04 147.76,-42.18 138.45,-37.13 137.33,-44.04"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.88,-19.25 150.62,-19.25 150.62,0 201.88,0 201.88,-19.25"/>
-<text text-anchor="middle" x="176.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.75,-19.05C122.33,-17.73 130.98,-16.41 138.98,-15.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.3,-18.67 148.66,-13.7 138.24,-11.75 139.3,-18.67"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 1dc216d1e..000000000
--- a/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function to test above algorithm." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 4ad4e8ce9..000000000
--- a/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5fdcd026390136bcb95624764e729534
\ No newline at end of file
diff --git a/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index cba56e85b..000000000
--- a/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test above algorithm.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 5f6703027..000000000
--- a/d8/d76/morse__code_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test above algorithm.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d76/morse__code_8cpp_source.html b/d8/d76/morse__code_8cpp_source.html
new file mode 100644
index 000000000..9d9b65406
--- /dev/null
+++ b/d8/d76/morse__code_8cpp_source.html
@@ -0,0 +1,380 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: ciphers/morse_code.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/d76/morse__code_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">morse_code.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/d76/morse__code_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;string&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/d4e/namespaceciphers.html">ciphers</a> {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/d8d/namespacemorse.html">morse</a> {</div>
+<div class="foldopen" id="foldopen00033" data-start="{" data-end="}">
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../d8/d76/morse__code_8cpp.html#ab31773fd11555d21f70d6914138d9535">   33</a></span>std::string <a class="code hl_function" href="../../d8/d76/morse__code_8cpp.html#ab31773fd11555d21f70d6914138d9535">char_to_morse</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> &amp;c) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="comment">// return corresponding morse code</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordflow">switch</span> (c) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;a&#39;</span>:</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;.-&quot;</span>;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;b&#39;</span>:</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;-...&quot;</span>;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;c&#39;</span>:</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;-.-.&quot;</span>;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;d&#39;</span>:</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;-..&quot;</span>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;e&#39;</span>:</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;.&quot;</span>;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;f&#39;</span>:</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;..-.&quot;</span>;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;g&#39;</span>:</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;--.&quot;</span>;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;h&#39;</span>:</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;....&quot;</span>;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;i&#39;</span>:</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;..&quot;</span>;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;j&#39;</span>:</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;.---&quot;</span>;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;k&#39;</span>:</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;-.-&quot;</span>;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;l&#39;</span>:</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;.-..&quot;</span>;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;m&#39;</span>:</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;--&quot;</span>;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;n&#39;</span>:</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;-.&quot;</span>;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;o&#39;</span>:</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;---&quot;</span>;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;p&#39;</span>:</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;.--.&quot;</span>;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;q&#39;</span>:</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;--.-&quot;</span>;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;r&#39;</span>:</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;.-.&quot;</span>;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;s&#39;</span>:</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;...&quot;</span>;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;t&#39;</span>:</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;-&quot;</span>;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;u&#39;</span>:</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;..-&quot;</span>;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;v&#39;</span>:</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;...-&quot;</span>;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;w&#39;</span>:</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;.--&quot;</span>;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;x&#39;</span>:</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;-..-&quot;</span>;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;y&#39;</span>:</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;-.--&quot;</span>;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;z&#39;</span>:</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;--..&quot;</span>;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;1&#39;</span>:</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;.----&quot;</span>;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;2&#39;</span>:</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;..---&quot;</span>;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;3&#39;</span>:</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;...--&quot;</span>;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;4&#39;</span>:</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;....-&quot;</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;5&#39;</span>:</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;.....&quot;</span>;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;6&#39;</span>:</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;-....&quot;</span>;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;7&#39;</span>:</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;--...&quot;</span>;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;8&#39;</span>:</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;---..&quot;</span>;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;9&#39;</span>:</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;----.&quot;</span>;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;0&#39;</span>:</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;-----&quot;</span>;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <span class="keywordflow">default</span>:</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Found invalid character: &quot;</span> &lt;&lt; c &lt;&lt; <span class="charliteral">&#39; &#39;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>            std::exit(0);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    }</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00118" data-start="{" data-end="}">
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"><a class="line" href="../../d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829">  118</a></span><span class="keywordtype">char</span> <a class="code hl_function" href="../../d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829">morse_to_char</a>(<span class="keyword">const</span> std::string &amp;s) {</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <span class="comment">// return corresponding character</span></div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;.-&quot;</span>) {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;a&#39;</span>;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;-...&quot;</span>) {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;b&#39;</span>;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;-.-.&quot;</span>) {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;c&#39;</span>;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;-..&quot;</span>) {</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;d&#39;</span>;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;.&quot;</span>) {</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;e&#39;</span>;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;..-.&quot;</span>) {</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;f&#39;</span>;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;--.&quot;</span>) {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;g&#39;</span>;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;....&quot;</span>) {</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;h&#39;</span>;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;..&quot;</span>) {</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;i&#39;</span>;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;.---&quot;</span>) {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;j&#39;</span>;</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;-.-&quot;</span>) {</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;k&#39;</span>;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;.-..&quot;</span>) {</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;l&#39;</span>;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;--&quot;</span>) {</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;m&#39;</span>;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;-.&quot;</span>) {</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;n&#39;</span>;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;---&quot;</span>) {</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;o&#39;</span>;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;.--.&quot;</span>) {</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;p&#39;</span>;</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;--.-&quot;</span>) {</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;q&#39;</span>;</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;.-.&quot;</span>) {</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;r&#39;</span>;</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;...&quot;</span>) {</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;s&#39;</span>;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;-&quot;</span>) {</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;t&#39;</span>;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;..-&quot;</span>) {</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;u&#39;</span>;</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;...-&quot;</span>) {</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;v&#39;</span>;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;.--&quot;</span>) {</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;w&#39;</span>;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;-..-&quot;</span>) {</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;x&#39;</span>;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;-.--&quot;</span>) {</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;y&#39;</span>;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;--..&quot;</span>) {</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;z&#39;</span>;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;.----&quot;</span>) {</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;1&#39;</span>;</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;..---&quot;</span>) {</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;2&#39;</span>;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;...--&quot;</span>) {</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;3&#39;</span>;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;....-&quot;</span>) {</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;4&#39;</span>;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;.....&quot;</span>) {</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;5&#39;</span>;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;-....&quot;</span>) {</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;6&#39;</span>;</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;--...&quot;</span>) {</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;7&#39;</span>;</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;---..&quot;</span>) {</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;8&#39;</span>;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;----.&quot;</span>) {</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;9&#39;</span>;</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (s == <span class="stringliteral">&quot;-----&quot;</span>) {</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;0&#39;</span>;</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Found invalid Morse code: &quot;</span> &lt;&lt; s &lt;&lt; <span class="charliteral">&#39; &#39;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>        std::exit(0);</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    }</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00202" data-start="{" data-end="}">
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"><a class="line" href="../../d8/d76/morse__code_8cpp.html#a0242e458904de8a242fcdaffe9e3ba1a">  202</a></span>std::string encrypt(<span class="keyword">const</span> std::string &amp;text) {</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    std::string encrypted_text = <span class="stringliteral">&quot;&quot;</span>;  <span class="comment">// Empty string to store encrypted text</span></div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    <span class="comment">// Going through each character of text and converting it</span></div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    <span class="comment">// to morse representation</span></div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">char</span> &amp;c : text) {</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>        encrypted_text += <a class="code hl_function" href="../../d8/d76/morse__code_8cpp.html#ab31773fd11555d21f70d6914138d9535">ciphers::morse::char_to_morse</a>(c) + <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    }</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    <span class="keywordflow">return</span> encrypted_text;  <span class="comment">// Returning encrypted text</span></div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00216" data-start="{" data-end="}">
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"><a class="line" href="../../d8/d76/morse__code_8cpp.html#a15c66ec8cf4cef0a35c50cbab86965dc">  216</a></span>std::string decrypt(<span class="keyword">const</span> std::string &amp;text) {</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    <span class="comment">// Going through each character of text and converting it</span></div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    <span class="comment">// back to normal representation.</span></div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    std::string decrypted_text = <span class="stringliteral">&quot;&quot;</span>;  <span class="comment">// Empty string to store decrypted text</span></div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    <span class="comment">// Spliting string (with delimiter = &quot; &quot;) and storing it</span></div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    <span class="comment">// in vector</span></div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    std::size_t pos_start = 0, pos_end = 0, delim_len = 1;</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    std::vector&lt;std::string&gt; splits;</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    <span class="keywordflow">while</span> ((pos_end = text.find(<span class="charliteral">&#39; &#39;</span>, pos_start)) != std::string::npos) {</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>        std::string token = text.substr(pos_start, pos_end - pos_start);</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>        pos_start = pos_end + delim_len;</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>        splits.push_back(token);</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    }</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span> </div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    <span class="comment">// Traversing through each morse code string</span></div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> std::string &amp;s : splits) {</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>        <span class="comment">// Add corresponding character</span></div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>        decrypted_text += <a class="code hl_function" href="../../d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829">ciphers::morse::morse_to_char</a>(s);</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    }</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span> </div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    <span class="keywordflow">return</span> decrypted_text;  <span class="comment">// Returning decrypted text</span></div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>}</div>
+</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>}  <span class="comment">// namespace morse</span></div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>}  <span class="comment">// namespace ciphers</span></div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span> </div>
+<div class="foldopen" id="foldopen00245" data-start="{" data-end="}">
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"><a class="line" href="../../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  245</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    <span class="comment">// Test 1</span></div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    std::string text1 = <span class="stringliteral">&quot;01234567890&quot;</span>;</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>    std::string encrypted1 = ciphers::morse::encrypt(text1);</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    std::string decrypted1 = ciphers::morse::decrypt(encrypted1);</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    assert(text1 == decrypted1);</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text1 &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Encrypted text : &quot;</span> &lt;&lt; encrypted1 &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Decrypted text : &quot;</span> &lt;&lt; decrypted1 &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>    <span class="comment">// Test 2</span></div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>    std::string text2 = <span class="stringliteral">&quot;abcdefghijklmnopqrstuvwxyz&quot;</span>;</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    std::string encrypted2 = ciphers::morse::encrypt(text2);</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    std::string decrypted2 = ciphers::morse::decrypt(encrypted2);</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    assert(text2 == decrypted2);</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text2 &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Encrypted text : &quot;</span> &lt;&lt; encrypted2 &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Decrypted text : &quot;</span> &lt;&lt; decrypted2 &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>}</div>
+</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span> </div>
+<div class="foldopen" id="foldopen00268" data-start="{" data-end="}">
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"><a class="line" href="../../d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  268</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>    <span class="comment">// Testing</span></div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    <a class="code hl_function" href="../../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>}</div>
+</div>
+<div class="ttc" id="amorse__code_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test above algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00245">morse_code.cpp:245</a></div></div>
+<div class="ttc" id="amorse__code_8cpp_html_ab31773fd11555d21f70d6914138d9535"><div class="ttname"><a href="../../d8/d76/morse__code_8cpp.html#ab31773fd11555d21f70d6914138d9535">ciphers::morse::char_to_morse</a></div><div class="ttdeci">std::string char_to_morse(const char &amp;c)</div><div class="ttdef"><b>Definition</b> <a href="#l00033">morse_code.cpp:33</a></div></div>
+<div class="ttc" id="amorse__code_8cpp_html_ac9f294b0dec08a4a11d477a32f9bd829"><div class="ttname"><a href="../../d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829">ciphers::morse::morse_to_char</a></div><div class="ttdeci">char morse_to_char(const std::string &amp;s)</div><div class="ttdef"><b>Definition</b> <a href="#l00118">morse_code.cpp:118</a></div></div>
+<div class="ttc" id="amorse__code_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00268">morse_code.cpp:268</a></div></div>
+<div class="ttc" id="anamespaceciphers_html"><div class="ttname"><a href="../../d6/d4e/namespaceciphers.html">ciphers</a></div><div class="ttdoc">Algorithms for encryption and decryption.</div></div>
+<div class="ttc" id="anamespacemorse_html"><div class="ttname"><a href="../../d6/d8d/namespacemorse.html">morse</a></div><div class="ttdoc">Functions for [Morse Code] (https://en.wikipedia.org/wiki/Morse_code).</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_4d6e05837bf820fb089a8a8cdf2f42b7.html">ciphers</a></li><li class="navelem"><a class="el" href="../../d8/d76/morse__code_8cpp.html">morse_code.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/d76/namespacetopological__sort.html b/d8/d76/namespacetopological__sort.html
index c6889875a..6e2764f3a 100644
--- a/d8/d76/namespacetopological__sort.html
+++ b/d8/d76/namespacetopological__sort.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: topological_sort Namespace Reference</title>
+<title>TheAlgorithms/C++: topological_sort Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/d77/namespacemachine__learning.html b/d8/d77/namespacemachine__learning.html
index 568372972..6904e7b64 100644
--- a/d8/d77/namespacemachine__learning.html
+++ b/d8/d77/namespacemachine__learning.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: machine_learning Namespace Reference</title>
+<title>TheAlgorithms/C++: machine_learning Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,81 +139,81 @@ Classes</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:aa72a53c88203fde278f1fe6c3afe5b07" id="r_aa72a53c88203fde278f1fe6c3afe5b07"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa72a53c88203fde278f1fe6c3afe5b07">save_u_matrix</a> (const char *fname, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &amp;W)</td></tr>
+<tr class="memitem:aa72a53c88203fde278f1fe6c3afe5b07" id="r_aa72a53c88203fde278f1fe6c3afe5b07"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa72a53c88203fde278f1fe6c3afe5b07">save_u_matrix</a> (const char *fname, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;W)</td></tr>
 <tr class="separator:aa72a53c88203fde278f1fe6c3afe5b07"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae868ad43698a1d69ba46ea3827d7d2c3" id="r_ae868ad43698a1d69ba46ea3827d7d2c3"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae868ad43698a1d69ba46ea3827d7d2c3">update_weights</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;X, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; *W, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *D, double alpha, int R)</td></tr>
+<tr class="memitem:ae868ad43698a1d69ba46ea3827d7d2c3" id="r_ae868ad43698a1d69ba46ea3827d7d2c3"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae868ad43698a1d69ba46ea3827d7d2c3">update_weights</a> (const std::valarray&lt; double &gt; &amp;X, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; *W, std::vector&lt; std::valarray&lt; double &gt; &gt; *D, double alpha, int R)</td></tr>
 <tr class="separator:ae868ad43698a1d69ba46ea3827d7d2c3"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ac43d294e21a0c4fa33c53757df054576" id="r_ac43d294e21a0c4fa33c53757df054576"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac43d294e21a0c4fa33c53757df054576">kohonen_som</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;X, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; *W, double alpha_min)</td></tr>
+<tr class="memitem:ac43d294e21a0c4fa33c53757df054576" id="r_ac43d294e21a0c4fa33c53757df054576"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac43d294e21a0c4fa33c53757df054576">kohonen_som</a> (const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; *W, double alpha_min)</td></tr>
 <tr class="separator:ac43d294e21a0c4fa33c53757df054576"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa6aac06ccf128b0a9c55c9ee1a8e5631" id="r_aa6aac06ccf128b0a9c55c9ee1a8e5631"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa6aac06ccf128b0a9c55c9ee1a8e5631">update_weights</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;x, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *W, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *D, double alpha, int R)</td></tr>
+<tr class="memitem:aa6aac06ccf128b0a9c55c9ee1a8e5631" id="r_aa6aac06ccf128b0a9c55c9ee1a8e5631"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa6aac06ccf128b0a9c55c9ee1a8e5631">update_weights</a> (const std::valarray&lt; double &gt; &amp;x, std::vector&lt; std::valarray&lt; double &gt; &gt; *W, std::valarray&lt; double &gt; *D, double alpha, int R)</td></tr>
 <tr class="separator:aa6aac06ccf128b0a9c55c9ee1a8e5631"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a042f435bca0839e721fc1574a61e8da3" id="r_a042f435bca0839e721fc1574a61e8da3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a042f435bca0839e721fc1574a61e8da3">kohonen_som_tracer</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;X, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *W, double alpha_min)</td></tr>
+<tr class="memitem:a042f435bca0839e721fc1574a61e8da3" id="r_a042f435bca0839e721fc1574a61e8da3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a042f435bca0839e721fc1574a61e8da3">kohonen_som_tracer</a> (const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X, std::vector&lt; std::valarray&lt; double &gt; &gt; *W, double alpha_min)</td></tr>
 <tr class="separator:a042f435bca0839e721fc1574a61e8da3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a84260cb1be9b63d6e38107000ac4b7e7" id="r_a84260cb1be9b63d6e38107000ac4b7e7"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a84260cb1be9b63d6e38107000ac4b7e7"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a84260cb1be9b63d6e38107000ac4b7e7">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; const &amp;A)</td></tr>
+<tr class="memitem:a84260cb1be9b63d6e38107000ac4b7e7"><td class="memTemplItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a84260cb1be9b63d6e38107000ac4b7e7">operator&lt;&lt;</a> (std::ostream &amp;out, std::vector&lt; std::valarray&lt; T &gt; &gt; const &amp;A)</td></tr>
 <tr class="separator:a84260cb1be9b63d6e38107000ac4b7e7"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af4986b23760039711848155739c31b35" id="r_af4986b23760039711848155739c31b35"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:af4986b23760039711848155739c31b35"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af4986b23760039711848155739c31b35">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; T, T &gt; &amp;A)</td></tr>
+<tr class="memitem:af4986b23760039711848155739c31b35"><td class="memTemplItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af4986b23760039711848155739c31b35">operator&lt;&lt;</a> (std::ostream &amp;out, const std::pair&lt; T, T &gt; &amp;A)</td></tr>
 <tr class="separator:af4986b23760039711848155739c31b35"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a54bf1f3c43271a5fc93101f6ae2e6269" id="r_a54bf1f3c43271a5fc93101f6ae2e6269"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a54bf1f3c43271a5fc93101f6ae2e6269"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a54bf1f3c43271a5fc93101f6ae2e6269">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;A)</td></tr>
+<tr class="memitem:a54bf1f3c43271a5fc93101f6ae2e6269"><td class="memTemplItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a54bf1f3c43271a5fc93101f6ae2e6269">operator&lt;&lt;</a> (std::ostream &amp;out, const std::valarray&lt; T &gt; &amp;A)</td></tr>
 <tr class="separator:a54bf1f3c43271a5fc93101f6ae2e6269"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a496302e3371aa7b478cb7d5917904bdd" id="r_a496302e3371aa7b478cb7d5917904bdd"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a496302e3371aa7b478cb7d5917904bdd"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a496302e3371aa7b478cb7d5917904bdd">insert_element</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;A, const T &amp;ele)</td></tr>
+<tr class="memitem:a496302e3371aa7b478cb7d5917904bdd"><td class="memTemplItemLeft" align="right" valign="top">std::valarray&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a496302e3371aa7b478cb7d5917904bdd">insert_element</a> (const std::valarray&lt; T &gt; &amp;A, const T &amp;ele)</td></tr>
 <tr class="separator:a496302e3371aa7b478cb7d5917904bdd"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a912cf68863063a38d6e63545be5eb093" id="r_a912cf68863063a38d6e63545be5eb093"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a912cf68863063a38d6e63545be5eb093"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a912cf68863063a38d6e63545be5eb093">pop_front</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;A)</td></tr>
+<tr class="memitem:a912cf68863063a38d6e63545be5eb093"><td class="memTemplItemLeft" align="right" valign="top">std::valarray&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a912cf68863063a38d6e63545be5eb093">pop_front</a> (const std::valarray&lt; T &gt; &amp;A)</td></tr>
 <tr class="separator:a912cf68863063a38d6e63545be5eb093"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae10178b082f0205c326550877d998e5d" id="r_ae10178b082f0205c326550877d998e5d"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ae10178b082f0205c326550877d998e5d"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae10178b082f0205c326550877d998e5d">pop_back</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;A)</td></tr>
+<tr class="memitem:ae10178b082f0205c326550877d998e5d"><td class="memTemplItemLeft" align="right" valign="top">std::valarray&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae10178b082f0205c326550877d998e5d">pop_back</a> (const std::valarray&lt; T &gt; &amp;A)</td></tr>
 <tr class="separator:ae10178b082f0205c326550877d998e5d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af801bf30591ca6b2c38ff4fed0ded23f" id="r_af801bf30591ca6b2c38ff4fed0ded23f"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:af801bf30591ca6b2c38ff4fed0ded23f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af801bf30591ca6b2c38ff4fed0ded23f">equal_shuffle</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;A, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;B)</td></tr>
+<tr class="memitem:af801bf30591ca6b2c38ff4fed0ded23f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af801bf30591ca6b2c38ff4fed0ded23f">equal_shuffle</a> (std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;A, std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;B)</td></tr>
 <tr class="separator:af801bf30591ca6b2c38ff4fed0ded23f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:abee7b35403af3612222d3b7a53074905" id="r_abee7b35403af3612222d3b7a53074905"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:abee7b35403af3612222d3b7a53074905"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#abee7b35403af3612222d3b7a53074905">uniform_random_initialization</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;shape, const T &amp;low, const T &amp;high)</td></tr>
+<tr class="memitem:abee7b35403af3612222d3b7a53074905"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#abee7b35403af3612222d3b7a53074905">uniform_random_initialization</a> (std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape, const T &amp;low, const T &amp;high)</td></tr>
 <tr class="separator:abee7b35403af3612222d3b7a53074905"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4" id="r_a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4">unit_matrix_initialization</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;shape)</td></tr>
+<tr class="memitem:a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4">unit_matrix_initialization</a> (std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape)</td></tr>
 <tr class="separator:a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ac1bdaa2a724b4ce6a6bb371a5dbe2e7e" id="r_ac1bdaa2a724b4ce6a6bb371a5dbe2e7e"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ac1bdaa2a724b4ce6a6bb371a5dbe2e7e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e">zeroes_initialization</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;shape)</td></tr>
+<tr class="memitem:ac1bdaa2a724b4ce6a6bb371a5dbe2e7e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e">zeroes_initialization</a> (std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape)</td></tr>
 <tr class="separator:ac1bdaa2a724b4ce6a6bb371a5dbe2e7e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a6f1c98c016ad34ff3d9f39372161bd35" id="r_a6f1c98c016ad34ff3d9f39372161bd35"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a6f1c98c016ad34ff3d9f39372161bd35"><td class="memTemplItemLeft" align="right" valign="top">T&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A)</td></tr>
+<tr class="memitem:a6f1c98c016ad34ff3d9f39372161bd35"><td class="memTemplItemLeft" align="right" valign="top">T&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</td></tr>
 <tr class="separator:a6f1c98c016ad34ff3d9f39372161bd35"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa4bbf61e65f8cd297255fa94b983d078" id="r_aa4bbf61e65f8cd297255fa94b983d078"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:aa4bbf61e65f8cd297255fa94b983d078"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A)</td></tr>
+<tr class="memitem:aa4bbf61e65f8cd297255fa94b983d078"><td class="memTemplItemLeft" align="right" valign="top">std::pair&lt; size_t, size_t &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</td></tr>
 <tr class="separator:aa4bbf61e65f8cd297255fa94b983d078"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ac332d152078e96311e43ac5e7183ea26" id="r_ac332d152078e96311e43ac5e7183ea26"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ac332d152078e96311e43ac5e7183ea26"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac332d152078e96311e43ac5e7183ea26">minmax_scaler</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;A, const T &amp;low, const T &amp;high)</td></tr>
+<tr class="memitem:ac332d152078e96311e43ac5e7183ea26"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac332d152078e96311e43ac5e7183ea26">minmax_scaler</a> (const std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;A, const T &amp;low, const T &amp;high)</td></tr>
 <tr class="separator:ac332d152078e96311e43ac5e7183ea26"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a50480fccfb39de20ca47f1bf51ecb6ec" id="r_a50480fccfb39de20ca47f1bf51ecb6ec"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a50480fccfb39de20ca47f1bf51ecb6ec"><td class="memTemplItemLeft" align="right" valign="top">size_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a50480fccfb39de20ca47f1bf51ecb6ec">argmax</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A)</td></tr>
+<tr class="memitem:a50480fccfb39de20ca47f1bf51ecb6ec"><td class="memTemplItemLeft" align="right" valign="top">size_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a50480fccfb39de20ca47f1bf51ecb6ec">argmax</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</td></tr>
 <tr class="separator:a50480fccfb39de20ca47f1bf51ecb6ec"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ad0bdc88e5f1be47c46c0f0c8ebf754bb" id="r_ad0bdc88e5f1be47c46c0f0c8ebf754bb"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ad0bdc88e5f1be47c46c0f0c8ebf754bb"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ad0bdc88e5f1be47c46c0f0c8ebf754bb">apply_function</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, T(*func)(const T &amp;))</td></tr>
+<tr class="memitem:ad0bdc88e5f1be47c46c0f0c8ebf754bb"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::valarray&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ad0bdc88e5f1be47c46c0f0c8ebf754bb">apply_function</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, T(*func)(const T &amp;))</td></tr>
 <tr class="separator:ad0bdc88e5f1be47c46c0f0c8ebf754bb"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a16f34574b7e0dd51bc3b3fda37446695" id="r_a16f34574b7e0dd51bc3b3fda37446695"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a16f34574b7e0dd51bc3b3fda37446695"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a16f34574b7e0dd51bc3b3fda37446695">operator*</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const T &amp;val)</td></tr>
+<tr class="memitem:a16f34574b7e0dd51bc3b3fda37446695"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::valarray&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a16f34574b7e0dd51bc3b3fda37446695">operator*</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const T &amp;val)</td></tr>
 <tr class="separator:a16f34574b7e0dd51bc3b3fda37446695"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae6ec42318d172b97fbdf45638d09d7b5" id="r_ae6ec42318d172b97fbdf45638d09d7b5"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ae6ec42318d172b97fbdf45638d09d7b5"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae6ec42318d172b97fbdf45638d09d7b5">operator/</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const T &amp;val)</td></tr>
+<tr class="memitem:ae6ec42318d172b97fbdf45638d09d7b5"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::valarray&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae6ec42318d172b97fbdf45638d09d7b5">operator/</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const T &amp;val)</td></tr>
 <tr class="separator:ae6ec42318d172b97fbdf45638d09d7b5"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a89fde571b38f9483576594f66572958a" id="r_a89fde571b38f9483576594f66572958a"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a89fde571b38f9483576594f66572958a"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a89fde571b38f9483576594f66572958a">transpose</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A)</td></tr>
+<tr class="memitem:a89fde571b38f9483576594f66572958a"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::valarray&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a89fde571b38f9483576594f66572958a">transpose</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</td></tr>
 <tr class="separator:a89fde571b38f9483576594f66572958a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a2466857dab977a49f117029835b3b6d2" id="r_a2466857dab977a49f117029835b3b6d2"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a2466857dab977a49f117029835b3b6d2"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a2466857dab977a49f117029835b3b6d2">operator+</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;B)</td></tr>
+<tr class="memitem:a2466857dab977a49f117029835b3b6d2"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::valarray&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a2466857dab977a49f117029835b3b6d2">operator+</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</td></tr>
 <tr class="separator:a2466857dab977a49f117029835b3b6d2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a0cc29566568e0383dd7d374068cbe6b3" id="r_a0cc29566568e0383dd7d374068cbe6b3"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a0cc29566568e0383dd7d374068cbe6b3"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a0cc29566568e0383dd7d374068cbe6b3">operator-</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;B)</td></tr>
+<tr class="memitem:a0cc29566568e0383dd7d374068cbe6b3"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::valarray&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a0cc29566568e0383dd7d374068cbe6b3">operator-</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</td></tr>
 <tr class="separator:a0cc29566568e0383dd7d374068cbe6b3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a5342906d42b80fc6b6b3ad17bf00fcb9" id="r_a5342906d42b80fc6b6b3ad17bf00fcb9"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a5342906d42b80fc6b6b3ad17bf00fcb9"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5342906d42b80fc6b6b3ad17bf00fcb9">multiply</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;B)</td></tr>
+<tr class="memitem:a5342906d42b80fc6b6b3ad17bf00fcb9"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::valarray&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5342906d42b80fc6b6b3ad17bf00fcb9">multiply</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</td></tr>
 <tr class="separator:a5342906d42b80fc6b6b3ad17bf00fcb9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:acafa3e62b686aebdbad81c4f89913f43" id="r_acafa3e62b686aebdbad81c4f89913f43"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:acafa3e62b686aebdbad81c4f89913f43"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#acafa3e62b686aebdbad81c4f89913f43">hadamard_product</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;B)</td></tr>
+<tr class="memitem:acafa3e62b686aebdbad81c4f89913f43"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::valarray&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#acafa3e62b686aebdbad81c4f89913f43">hadamard_product</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</td></tr>
 <tr class="separator:acafa3e62b686aebdbad81c4f89913f43"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
@@ -207,12 +224,12 @@ Variables</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/A*_search_algorithm" target="_blank">A* search algorithm</a> </p>
 <p>Machine Learning algorithms.</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>for std::vector</p>
 <p>Machine learning algorithms.</p>
 <p>A* is an informed search algorithm, or a best-first search, meaning that it is formulated in terms of weighted graphs: starting from a specific starting node of a graph (initial state), it aims to find a path to the given goal node having the smallest cost (least distance travelled, shortest time, etc.). It evaluates by maintaining a tree of paths originating at the start node and extending those paths one edge at a time until it reaches the final state. The weighted edges (or cost) is evaluated on two factors, G score (cost required from starting node or initial state to current state) and H score (cost required from current state to final state). The F(state), then is evaluated as: F(state) = G(state) + H(state).</p>
-<p>To solve the given search with shortest cost or path possible is to inspect values having minimum F(state). </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AshishYUO" target="_blank">Ashish Daulatabad</a> for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a></code> function for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></code>, representing <code>EightPuzzle</code> board for <code>assert</code> for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a></code> STL for IO operations for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a></code> STL for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></code> for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set.html">std::set</a></code> STL for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></code> STL</dd></dl>
+<p>To solve the given search with shortest cost or path possible is to inspect values having minimum F(state). </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AshishYUO" target="_blank">Ashish Daulatabad</a> for <code>std::reverse</code> function for <code>std::array</code>, representing <code>EightPuzzle</code> board for <code>assert</code> for <code>std::function</code> STL for IO operations for <code>std::map</code> STL for <code>std::shared_ptr</code> for <code>std::set</code> STL for <code>std::vector</code> STL</dd></dl>
 <p>Machine learning algorithms</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/transform.html">std::transform</a> and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a> for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a> and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html">std::accumulate</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a></p>
+<p>for std::transform and std::sort for assert for std::pow and std::sqrt for std::cout for std::accumulate for std::unordered_map</p>
 <p>Machine learning algorithms </p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ad0bdc88e5f1be47c46c0f0c8ebf754bb" name="ad0bdc88e5f1be47c46c0f0c8ebf754bb"></a>
@@ -224,9 +241,9 @@ Variables</h2></td></tr>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; machine_learning::apply_function </td>
+          <td class="memname">std::vector&lt; std::valarray&lt; T &gt; &gt; machine_learning::apply_function </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -249,15 +266,16 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new resultant vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00329">329</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  330</span>                                                              {</div>
-<div class="line"><span class="lineno">  331</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; B =</div>
+<div class="line"><span class="lineno">  331</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; B =</div>
 <div class="line"><span class="lineno">  332</span>        A;                  <span class="comment">// New vector to store resultant vector</span></div>
 <div class="line"><span class="lineno">  333</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;b : B) {     <span class="comment">// For every row in vector</span></div>
 <div class="line"><span class="lineno">  334</span>        b = b.apply(func);  <span class="comment">// Apply function to that row</span></div>
 <div class="line"><span class="lineno">  335</span>    }</div>
 <div class="line"><span class="lineno">  336</span>    <span class="keywordflow">return</span> B;  <span class="comment">// Return new resultant 2D vector</span></div>
 <div class="line"><span class="lineno">  337</span>}</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>
 </div>
@@ -272,7 +290,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">size_t machine_learning::argmax </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -290,33 +308,23 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>index of maximum element </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00307">307</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  307</span>                                                  {</div>
 <div class="line"><span class="lineno">  308</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
 <div class="line"><span class="lineno">  309</span>    <span class="comment">// As this function is used on predicted (or target) vector, shape should be</span></div>
 <div class="line"><span class="lineno">  310</span>    <span class="comment">// (1, X)</span></div>
 <div class="line"><span class="lineno">  311</span>    <span class="keywordflow">if</span> (shape.first != 1) {</div>
-<div class="line"><span class="lineno">  312</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><span class="lineno">  313</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Supplied vector is ineligible for argmax&quot;</span> &lt;&lt; <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">  314</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  312</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><span class="lineno">  313</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Supplied vector is ineligible for argmax&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  314</span>        std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  315</span>    }</div>
 <div class="line"><span class="lineno">  316</span>    <span class="comment">// Return distance of max element from first element (i.e. index)</span></div>
-<div class="line"><span class="lineno">  317</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">std::distance</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(A[0]),</div>
-<div class="line"><span class="lineno">  318</span>                         <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">std::max_element</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(A[0]), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(A[0])));</div>
+<div class="line"><span class="lineno">  317</span>    <span class="keywordflow">return</span> std::distance(std::begin(A[0]),</div>
+<div class="line"><span class="lineno">  318</span>                         std::max_element(std::begin(A[0]), std::end(A[0])));</div>
 <div class="line"><span class="lineno">  319</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::cerr</a></div></div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="adistance_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/distance.html">std::distance</a></div><div class="ttdeci">T distance(T... args)</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="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="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
-<div class="ttc" id="amax_element_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">std::max_element</a></div><div class="ttdeci">T max_element(T... args)</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_aa4bbf61e65f8cd297255fa94b983d078"><div class="ttname"><a href="#aa4bbf61e65f8cd297255fa94b983d078">machine_learning::get_shape</a></div><div class="ttdeci">std::pair&lt; size_t, size_t &gt; get_shape(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:247</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d77/namespacemachine__learning_a50480fccfb39de20ca47f1bf51ecb6ec_cgraph.svg" width="536" height="351"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemachine__learning_html_aa4bbf61e65f8cd297255fa94b983d078"><div class="ttname"><a href="#aa4bbf61e65f8cd297255fa94b983d078">machine_learning::get_shape</a></div><div class="ttdeci">std::pair&lt; size_t, size_t &gt; get_shape(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00247">vector_ops.hpp:247</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af801bf30591ca6b2c38ff4fed0ded23f" name="af801bf30591ca6b2c38ff4fed0ded23f"></a>
@@ -330,12 +338,12 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void machine_learning::equal_shuffle </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -352,36 +360,28 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00136">136</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  137</span>                                                            {</div>
 <div class="line"><span class="lineno">  138</span>    <span class="comment">// If two vectors have different sizes</span></div>
-<div class="line"><span class="lineno">  139</span>    <span class="keywordflow">if</span> (A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() != B.<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">  140</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><span class="lineno">  141</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div>
+<div class="line"><span class="lineno">  139</span>    <span class="keywordflow">if</span> (A.size() != B.size()) {</div>
+<div class="line"><span class="lineno">  140</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><span class="lineno">  141</span>        std::cerr</div>
 <div class="line"><span class="lineno">  142</span>            &lt;&lt; <span class="stringliteral">&quot;Can not equally shuffle two vectors with different sizes: &quot;</span>;</div>
-<div class="line"><span class="lineno">  143</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; B.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() &lt;&lt; <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">  144</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  143</span>        std::cerr &lt;&lt; A.size() &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; B.size() &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  144</span>        std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  145</span>    }</div>
-<div class="line"><span class="lineno">  146</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {  <span class="comment">// For every element in A and B</span></div>
+<div class="line"><span class="lineno">  146</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.size(); i++) {  <span class="comment">// For every element in A and B</span></div>
 <div class="line"><span class="lineno">  147</span>        <span class="comment">// Genrating random index &lt; size of A and B</span></div>
-<div class="line"><span class="lineno">  148</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html">std::chrono::system_clock::now</a>().time_since_epoch().count());</div>
-<div class="line"><span class="lineno">  149</span>        <span class="keywordtype">size_t</span> random_index = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 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">  148</span>        std::srand(std::chrono::system_clock::now().time_since_epoch().count());</div>
+<div class="line"><span class="lineno">  149</span>        <span class="keywordtype">size_t</span> random_index = std::rand() % A.size();</div>
 <div class="line"><span class="lineno">  150</span>        <span class="comment">// Swap elements in both A and B with same random index</span></div>
-<div class="line"><span class="lineno">  151</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(A[i], A[random_index]);</div>
-<div class="line"><span class="lineno">  152</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(B[i], B[random_index]);</div>
+<div class="line"><span class="lineno">  151</span>        std::swap(A[i], A[random_index]);</div>
+<div class="line"><span class="lineno">  152</span>        std::swap(B[i], B[random_index]);</div>
 <div class="line"><span class="lineno">  153</span>    }</div>
 <div class="line"><span class="lineno">  154</span>    <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  155</span>}</div>
-<div class="ttc" id="anow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html">std::chrono::system_clock::now</a></div><div class="ttdeci">T now(T... args)</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-<div class="ttc" id="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="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- 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="../../d8/d77/namespacemachine__learning_af801bf30591ca6b2c38ff4fed0ded23f_cgraph.svg" width="358" height="299"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa4bbf61e65f8cd297255fa94b983d078" name="aa4bbf61e65f8cd297255fa94b983d078"></a>
@@ -393,9 +393,9 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; machine_learning::get_shape </td>
+          <td class="memname">std::pair&lt; size_t, size_t &gt; machine_learning::get_shape </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -413,25 +413,21 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>shape as pair </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00247">247</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  247</span>                                                                      {</div>
-<div class="line"><span class="lineno">  248</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> sub_size = (*A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>()).size();</div>
+<div class="line"><span class="lineno">  248</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> sub_size = (*A.begin()).size();</div>
 <div class="line"><span class="lineno">  249</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;a : A) {</div>
 <div class="line"><span class="lineno">  250</span>        <span class="comment">// If supplied vector don&#39;t have same shape in all rows</span></div>
 <div class="line"><span class="lineno">  251</span>        <span class="keywordflow">if</span> (a.size() != sub_size) {</div>
-<div class="line"><span class="lineno">  252</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><span class="lineno">  253</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Supplied vector is not 2D Matrix&quot;</span> &lt;&lt; <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">  254</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  252</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><span class="lineno">  253</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Supplied vector is not 2D Matrix&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  254</span>            std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  255</span>        }</div>
 <div class="line"><span class="lineno">  256</span>    }</div>
-<div class="line"><span class="lineno">  257</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(A.size(), sub_size);  <span class="comment">// Return shape as pair</span></div>
+<div class="line"><span class="lineno">  257</span>    <span class="keywordflow">return</span> std::make_pair(A.size(), sub_size);  <span class="comment">// Return shape as pair</span></div>
 <div class="line"><span class="lineno">  258</span>}</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><!-- 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="../../d8/d77/namespacemachine__learning_aa4bbf61e65f8cd297255fa94b983d078_cgraph.svg" width="315" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="acafa3e62b686aebdbad81c4f89913f43" name="acafa3e62b686aebdbad81c4f89913f43"></a>
@@ -443,14 +439,14 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; machine_learning::hadamard_product </td>
+          <td class="memname">std::vector&lt; std::valarray&lt; T &gt; &gt; machine_learning::hadamard_product </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -468,29 +464,25 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new resultant vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00494">494</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  496</span>                                        {</div>
 <div class="line"><span class="lineno">  497</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
 <div class="line"><span class="lineno">  498</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B);</div>
 <div class="line"><span class="lineno">  499</span>    <span class="comment">// If vectors are not eligible for hadamard product</span></div>
 <div class="line"><span class="lineno">  500</span>    <span class="keywordflow">if</span> (shape_a.first != shape_b.first || shape_a.second != shape_b.second) {</div>
-<div class="line"><span class="lineno">  501</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><span class="lineno">  502</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Vectors have different shapes &quot;</span>;</div>
-<div class="line"><span class="lineno">  503</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; shape_a &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; shape_b &lt;&lt; <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">  504</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  501</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><span class="lineno">  502</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Vectors have different shapes &quot;</span>;</div>
+<div class="line"><span class="lineno">  503</span>        std::cerr &lt;&lt; shape_a &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; shape_b &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  504</span>        std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  505</span>    }</div>
-<div class="line"><span class="lineno">  506</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt; C;  <span class="comment">// Vector to store result</span></div>
-<div class="line"><span class="lineno">  507</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
-<div class="line"><span class="lineno">  508</span>        C.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(A[i] * B[i]);  <span class="comment">// Elementwise multiplication</span></div>
+<div class="line"><span class="lineno">  506</span>    std::vector&lt;std::valarray&lt;T&gt;&gt; C;  <span class="comment">// Vector to store result</span></div>
+<div class="line"><span class="lineno">  507</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.size(); i++) {</div>
+<div class="line"><span class="lineno">  508</span>        C.push_back(A[i] * B[i]);  <span class="comment">// Elementwise multiplication</span></div>
 <div class="line"><span class="lineno">  509</span>    }</div>
 <div class="line"><span class="lineno">  510</span>    <span class="keywordflow">return</span> C;  <span class="comment">// Return new resultant 2D vector</span></div>
 <div class="line"><span class="lineno">  511</span>}</div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-</div><!-- 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="../../d8/d77/namespacemachine__learning_acafa3e62b686aebdbad81c4f89913f43_cgraph.svg" width="556" height="198"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a496302e3371aa7b478cb7d5917904bdd" name="a496302e3371aa7b478cb7d5917904bdd"></a>
@@ -502,9 +494,9 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; machine_learning::insert_element </td>
+          <td class="memname">std::valarray&lt; T &gt; machine_learning::insert_element </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">const std::valarray&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -527,8 +519,10 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new resultant vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00085">85</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   85</span>                                                                     {</div>
-<div class="line"><span class="lineno">   86</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> B;      <span class="comment">// New 1D vector to store resultant vector</span></div>
+<div class="line"><span class="lineno">   86</span>    std::valarray&lt;T&gt; B;      <span class="comment">// New 1D vector to store resultant vector</span></div>
 <div class="line"><span class="lineno">   87</span>    B.resize(A.size() + 1);  <span class="comment">// Resizing it accordingly</span></div>
 <div class="line"><span class="lineno">   88</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.size(); i++) {  <span class="comment">// For every element in A</span></div>
 <div class="line"><span class="lineno">   89</span>        B[i] = A[i];                         <span class="comment">// Copy element in B</span></div>
@@ -536,7 +530,6 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   91</span>    B[B.size() - 1] = ele;  <span class="comment">// Inserting new element in last position</span></div>
 <div class="line"><span class="lineno">   92</span>    <span class="keywordflow">return</span> B;               <span class="comment">// Return resultant vector</span></div>
 <div class="line"><span class="lineno">   93</span>}</div>
-<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -549,12 +542,12 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void machine_learning::kohonen_som </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>W</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>W</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -572,14 +565,16 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00269">269</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  271</span>                                   {</div>
-<div class="line"><span class="lineno">  272</span>    <span class="keywordtype">size_t</span> num_samples = X.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();  <span class="comment">// number of rows</span></div>
+<div class="line"><span class="lineno">  272</span>    <span class="keywordtype">size_t</span> num_samples = X.size();  <span class="comment">// number of rows</span></div>
 <div class="line"><span class="lineno">  273</span>    <span class="comment">// size_t num_features = X[0].size();  // number of columns</span></div>
-<div class="line"><span class="lineno">  274</span>    <span class="keywordtype">size_t</span> num_out = W-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();  <span class="comment">// output matrix size</span></div>
+<div class="line"><span class="lineno">  274</span>    <span class="keywordtype">size_t</span> num_out = W-&gt;size();  <span class="comment">// output matrix size</span></div>
 <div class="line"><span class="lineno">  275</span>    <span class="keywordtype">size_t</span> R = num_out &gt;&gt; 2, iter = 0;</div>
 <div class="line"><span class="lineno">  276</span>    <span class="keywordtype">double</span> alpha = 1.f;</div>
 <div class="line"><span class="lineno">  277</span> </div>
-<div class="line"><span class="lineno">  278</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; D(num_out);</div>
+<div class="line"><span class="lineno">  278</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; D(num_out);</div>
 <div class="line"><span class="lineno">  279</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; num_out; i++) D[i] = std::valarray&lt;double&gt;(num_out);</div>
 <div class="line"><span class="lineno">  280</span> </div>
 <div class="line"><span class="lineno">  281</span>    <span class="keywordtype">double</span> dmin = 1.f;        <span class="comment">// average minimum distance of all samples</span></div>
@@ -608,19 +603,14 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  304</span>        }</div>
 <div class="line"><span class="lineno">  305</span>        past_dmin = dmin;</div>
 <div class="line"><span class="lineno">  306</span> </div>
-<div class="line"><span class="lineno">  307</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;iter: &quot;</span> &lt;&lt; iter &lt;&lt; <span class="stringliteral">&quot;\t alpha: &quot;</span> &lt;&lt; alpha &lt;&lt; <span class="stringliteral">&quot;\t R: &quot;</span> &lt;&lt; R</div>
+<div class="line"><span class="lineno">  307</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;iter: &quot;</span> &lt;&lt; iter &lt;&lt; <span class="stringliteral">&quot;\t alpha: &quot;</span> &lt;&lt; alpha &lt;&lt; <span class="stringliteral">&quot;\t R: &quot;</span> &lt;&lt; R</div>
 <div class="line"><span class="lineno">  308</span>                  &lt;&lt; <span class="stringliteral">&quot;\t d_min: &quot;</span> &lt;&lt; dmin_ratio &lt;&lt; <span class="stringliteral">&quot;\r&quot;</span>;</div>
 <div class="line"><span class="lineno">  309</span>    }</div>
 <div class="line"><span class="lineno">  310</span> </div>
-<div class="line"><span class="lineno">  311</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  311</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  312</span>}</div>
-<div class="ttc" id="anamespacemachine__learning_html_ae868ad43698a1d69ba46ea3827d7d2c3"><div class="ttname"><a href="#ae868ad43698a1d69ba46ea3827d7d2c3">machine_learning::update_weights</a></div><div class="ttdeci">double update_weights(const std::valarray&lt; double &gt; &amp;X, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; *W, std::vector&lt; std::valarray&lt; double &gt; &gt; *D, double alpha, int R)</div><div class="ttdef"><b>Definition</b> kohonen_som_topology.cpp:200</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.svg" width="100%" height="530"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="anamespacemachine__learning_html_ae868ad43698a1d69ba46ea3827d7d2c3"><div class="ttname"><a href="#ae868ad43698a1d69ba46ea3827d7d2c3">machine_learning::update_weights</a></div><div class="ttdeci">double update_weights(const std::valarray&lt; double &gt; &amp;X, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; *W, std::vector&lt; std::valarray&lt; double &gt; &gt; *D, double alpha, int R)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00200">kohonen_som_topology.cpp:200</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a042f435bca0839e721fc1574a61e8da3" name="a042f435bca0839e721fc1574a61e8da3"></a>
@@ -632,12 +622,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void machine_learning::kohonen_som_tracer </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>W</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::valarray&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>W</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -655,14 +645,16 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00149">149</a> of file <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html">kohonen_som_trace.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  151</span>                                          {</div>
-<div class="line"><span class="lineno">  152</span>    <span class="keywordtype">int</span> num_samples = X.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();  <span class="comment">// number of rows</span></div>
+<div class="line"><span class="lineno">  152</span>    <span class="keywordtype">int</span> num_samples = X.size();  <span class="comment">// number of rows</span></div>
 <div class="line"><span class="lineno">  153</span>    <span class="comment">// int num_features = X[0].size();  // number of columns</span></div>
-<div class="line"><span class="lineno">  154</span>    <span class="keywordtype">int</span> num_out = W-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();  <span class="comment">// number of rows</span></div>
+<div class="line"><span class="lineno">  154</span>    <span class="keywordtype">int</span> num_out = W-&gt;size();  <span class="comment">// number of rows</span></div>
 <div class="line"><span class="lineno">  155</span>    <span class="keywordtype">int</span> R = num_out &gt;&gt; 2, iter = 0;</div>
 <div class="line"><span class="lineno">  156</span>    <span class="keywordtype">double</span> alpha = 1.f;</div>
 <div class="line"><span class="lineno">  157</span> </div>
-<div class="line"><span class="lineno">  158</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> D(num_out);</div>
+<div class="line"><span class="lineno">  158</span>    std::valarray&lt;double&gt; D(num_out);</div>
 <div class="line"><span class="lineno">  159</span> </div>
 <div class="line"><span class="lineno">  160</span>    <span class="comment">// Loop alpha from 1 to slpha_min</span></div>
 <div class="line"><span class="lineno">  161</span>    <span class="keywordflow">do</span> {</div>
@@ -681,12 +673,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  174</span>        iter++;</div>
 <div class="line"><span class="lineno">  175</span>    } <span class="keywordflow">while</span> (alpha &gt; alpha_min);</div>
 <div class="line"><span class="lineno">  176</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.svg" width="100%" height="530"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac332d152078e96311e43ac5e7183ea26" name="ac332d152078e96311e43ac5e7183ea26"></a>
@@ -698,9 +685,9 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; machine_learning::minmax_scaler </td>
+          <td class="memname">std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; machine_learning::minmax_scaler </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -729,42 +716,37 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new scaled 3D vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00269">269</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  271</span>                   {</div>
-<div class="line"><span class="lineno">  272</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::valarray&lt;T&gt;</a>&gt;&gt; B =</div>
+<div class="line"><span class="lineno">  272</span>    std::vector&lt;std::vector&lt;std::valarray&lt;T&gt;&gt;&gt; B =</div>
 <div class="line"><span class="lineno">  273</span>        A;                               <span class="comment">// Copying into new vector B</span></div>
 <div class="line"><span class="lineno">  274</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B[0]);  <span class="comment">// Storing shape of B&#39;s every element</span></div>
 <div class="line"><span class="lineno">  275</span>    <span class="comment">// As this function is used for scaling training data vector should be of</span></div>
 <div class="line"><span class="lineno">  276</span>    <span class="comment">// shape (1, X)</span></div>
 <div class="line"><span class="lineno">  277</span>    <span class="keywordflow">if</span> (shape.first != 1) {</div>
-<div class="line"><span class="lineno">  278</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><span class="lineno">  279</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div>
+<div class="line"><span class="lineno">  278</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><span class="lineno">  279</span>        std::cerr</div>
 <div class="line"><span class="lineno">  280</span>            &lt;&lt; <span class="stringliteral">&quot;Supplied vector is not supported for minmax scaling, shape: &quot;</span>;</div>
-<div class="line"><span class="lineno">  281</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; shape &lt;&lt; <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">  282</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  281</span>        std::cerr &lt;&lt; shape &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  282</span>        std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  283</span>    }</div>
 <div class="line"><span class="lineno">  284</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; shape.second; i++) {</div>
 <div class="line"><span class="lineno">  285</span>        T min = B[0][0][i], max = B[0][0][i];</div>
-<div class="line"><span class="lineno">  286</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; B.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); j++) {</div>
+<div class="line"><span class="lineno">  286</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; B.size(); j++) {</div>
 <div class="line"><span class="lineno">  287</span>            <span class="comment">// Updating minimum and maximum values</span></div>
-<div class="line"><span class="lineno">  288</span>            min = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(min, B[j][0][i]);</div>
-<div class="line"><span class="lineno">  289</span>            max = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(max, B[j][0][i]);</div>
+<div class="line"><span class="lineno">  288</span>            min = std::min(min, B[j][0][i]);</div>
+<div class="line"><span class="lineno">  289</span>            max = std::max(max, B[j][0][i]);</div>
 <div class="line"><span class="lineno">  290</span>        }</div>
-<div class="line"><span class="lineno">  291</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; B.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); j++) {</div>
+<div class="line"><span class="lineno">  291</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; B.size(); j++) {</div>
 <div class="line"><span class="lineno">  292</span>            <span class="comment">// Applying min-max scaler formula</span></div>
 <div class="line"><span class="lineno">  293</span>            B[j][0][i] =</div>
-<div class="line"><span class="lineno">  294</span>                ((B[j][0][i] - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a>) / (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">max</a> - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a>)) * (high - low) + low;</div>
+<div class="line"><span class="lineno">  294</span>                ((B[j][0][i] - min) / (max - min)) * (high - low) + low;</div>
 <div class="line"><span class="lineno">  295</span>        }</div>
 <div class="line"><span class="lineno">  296</span>    }</div>
 <div class="line"><span class="lineno">  297</span>    <span class="keywordflow">return</span> B;  <span class="comment">// Return new resultant 3D vector</span></div>
 <div class="line"><span class="lineno">  298</span>}</div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="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><!-- 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="../../d8/d77/namespacemachine__learning_ac332d152078e96311e43ac5e7183ea26_cgraph.svg" width="539" height="296"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5342906d42b80fc6b6b3ad17bf00fcb9" name="a5342906d42b80fc6b6b3ad17bf00fcb9"></a>
@@ -776,14 +758,14 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; machine_learning::multiply </td>
+          <td class="memname">std::vector&lt; std::valarray&lt; T &gt; &gt; machine_learning::multiply </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -801,36 +783,33 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new resultant vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00460">460</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  461</span>                                                                           {</div>
 <div class="line"><span class="lineno">  462</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
 <div class="line"><span class="lineno">  463</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B);</div>
 <div class="line"><span class="lineno">  464</span>    <span class="comment">// If vectors are not eligible for multiplication</span></div>
 <div class="line"><span class="lineno">  465</span>    <span class="keywordflow">if</span> (shape_a.second != shape_b.first) {</div>
-<div class="line"><span class="lineno">  466</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><span class="lineno">  467</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Vectors are not eligible for multiplication &quot;</span>;</div>
-<div class="line"><span class="lineno">  468</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; shape_a &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; shape_b &lt;&lt; <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">  469</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  466</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><span class="lineno">  467</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Vectors are not eligible for multiplication &quot;</span>;</div>
+<div class="line"><span class="lineno">  468</span>        std::cerr &lt;&lt; shape_a &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; shape_b &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  469</span>        std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  470</span>    }</div>
-<div class="line"><span class="lineno">  471</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt; C;  <span class="comment">// Vector to store result</span></div>
+<div class="line"><span class="lineno">  471</span>    std::vector&lt;std::valarray&lt;T&gt;&gt; C;  <span class="comment">// Vector to store result</span></div>
 <div class="line"><span class="lineno">  472</span>    <span class="comment">// Normal matrix multiplication</span></div>
 <div class="line"><span class="lineno">  473</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; shape_a.first; i++) {</div>
-<div class="line"><span class="lineno">  474</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> row;</div>
+<div class="line"><span class="lineno">  474</span>        std::valarray&lt;T&gt; row;</div>
 <div class="line"><span class="lineno">  475</span>        row.resize(shape_b.second);</div>
 <div class="line"><span class="lineno">  476</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; shape_b.second; j++) {</div>
 <div class="line"><span class="lineno">  477</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> k = 0; k &lt; shape_a.second; k++) {</div>
 <div class="line"><span class="lineno">  478</span>                row[j] += A[i][k] * B[k][j];</div>
 <div class="line"><span class="lineno">  479</span>            }</div>
 <div class="line"><span class="lineno">  480</span>        }</div>
-<div class="line"><span class="lineno">  481</span>        C.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(row);</div>
+<div class="line"><span class="lineno">  481</span>        C.push_back(row);</div>
 <div class="line"><span class="lineno">  482</span>    }</div>
 <div class="line"><span class="lineno">  483</span>    <span class="keywordflow">return</span> C;  <span class="comment">// Return new resultant 2D vector</span></div>
 <div class="line"><span class="lineno">  484</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d77/namespacemachine__learning_a5342906d42b80fc6b6b3ad17bf00fcb9_cgraph.svg" width="544" height="198"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a16f34574b7e0dd51bc3b3fda37446695" name="a16f34574b7e0dd51bc3b3fda37446695"></a>
@@ -842,9 +821,9 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; machine_learning::operator* </td>
+          <td class="memname">std::vector&lt; std::valarray&lt; T &gt; &gt; machine_learning::operator* </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -867,8 +846,10 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new resultant vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00347">347</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  348</span>                                                      {</div>
-<div class="line"><span class="lineno">  349</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; B =</div>
+<div class="line"><span class="lineno">  349</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; B =</div>
 <div class="line"><span class="lineno">  350</span>        A;               <span class="comment">// New vector to store resultant vector</span></div>
 <div class="line"><span class="lineno">  351</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;b : B) {  <span class="comment">// For every row in vector</span></div>
 <div class="line"><span class="lineno">  352</span>        b = b * val;     <span class="comment">// Multiply row with scaler</span></div>
@@ -887,14 +868,14 @@ template&lt;typename T &gt; </div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; machine_learning::operator+ </td>
+          <td class="memname">std::vector&lt; std::valarray&lt; T &gt; &gt; machine_learning::operator+ </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -912,28 +893,25 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new resultant vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00406">406</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  408</span>                                        {</div>
 <div class="line"><span class="lineno">  409</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
 <div class="line"><span class="lineno">  410</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B);</div>
 <div class="line"><span class="lineno">  411</span>    <span class="comment">// If vectors don&#39;t have equal shape</span></div>
 <div class="line"><span class="lineno">  412</span>    <span class="keywordflow">if</span> (shape_a.first != shape_b.first || shape_a.second != shape_b.second) {</div>
-<div class="line"><span class="lineno">  413</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><span class="lineno">  414</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Supplied vectors have different shapes &quot;</span>;</div>
-<div class="line"><span class="lineno">  415</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; shape_a &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; shape_b &lt;&lt; <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">  416</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  413</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><span class="lineno">  414</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Supplied vectors have different shapes &quot;</span>;</div>
+<div class="line"><span class="lineno">  415</span>        std::cerr &lt;&lt; shape_a &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; shape_b &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  416</span>        std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  417</span>    }</div>
-<div class="line"><span class="lineno">  418</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt; C;</div>
-<div class="line"><span class="lineno">  419</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {  <span class="comment">// For every row</span></div>
-<div class="line"><span class="lineno">  420</span>        C.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(A[i] + B[i]);            <span class="comment">// Elementwise addition</span></div>
+<div class="line"><span class="lineno">  418</span>    std::vector&lt;std::valarray&lt;T&gt;&gt; C;</div>
+<div class="line"><span class="lineno">  419</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.size(); i++) {  <span class="comment">// For every row</span></div>
+<div class="line"><span class="lineno">  420</span>        C.push_back(A[i] + B[i]);            <span class="comment">// Elementwise addition</span></div>
 <div class="line"><span class="lineno">  421</span>    }</div>
 <div class="line"><span class="lineno">  422</span>    <span class="keywordflow">return</span> C;  <span class="comment">// Return new resultant 2D vector</span></div>
 <div class="line"><span class="lineno">  423</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d77/namespacemachine__learning_a2466857dab977a49f117029835b3b6d2_cgraph.svg" width="554" height="198"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0cc29566568e0383dd7d374068cbe6b3" name="a0cc29566568e0383dd7d374068cbe6b3"></a>
@@ -945,14 +923,14 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; machine_learning::operator- </td>
+          <td class="memname">std::vector&lt; std::valarray&lt; T &gt; &gt; machine_learning::operator- </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -970,28 +948,25 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new resultant vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00433">433</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  435</span>                                        {</div>
 <div class="line"><span class="lineno">  436</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
 <div class="line"><span class="lineno">  437</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B);</div>
 <div class="line"><span class="lineno">  438</span>    <span class="comment">// If vectors don&#39;t have equal shape</span></div>
 <div class="line"><span class="lineno">  439</span>    <span class="keywordflow">if</span> (shape_a.first != shape_b.first || shape_a.second != shape_b.second) {</div>
-<div class="line"><span class="lineno">  440</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><span class="lineno">  441</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Supplied vectors have different shapes &quot;</span>;</div>
-<div class="line"><span class="lineno">  442</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; shape_a &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; shape_b &lt;&lt; <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">  443</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  440</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><span class="lineno">  441</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Supplied vectors have different shapes &quot;</span>;</div>
+<div class="line"><span class="lineno">  442</span>        std::cerr &lt;&lt; shape_a &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; shape_b &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  443</span>        std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  444</span>    }</div>
-<div class="line"><span class="lineno">  445</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt; C;         <span class="comment">// Vector to store result</span></div>
-<div class="line"><span class="lineno">  446</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {  <span class="comment">// For every row</span></div>
-<div class="line"><span class="lineno">  447</span>        C.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(A[i] - B[i]);            <span class="comment">// Elementwise substraction</span></div>
+<div class="line"><span class="lineno">  445</span>    std::vector&lt;std::valarray&lt;T&gt;&gt; C;         <span class="comment">// Vector to store result</span></div>
+<div class="line"><span class="lineno">  446</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.size(); i++) {  <span class="comment">// For every row</span></div>
+<div class="line"><span class="lineno">  447</span>        C.push_back(A[i] - B[i]);            <span class="comment">// Elementwise substraction</span></div>
 <div class="line"><span class="lineno">  448</span>    }</div>
 <div class="line"><span class="lineno">  449</span>    <span class="keywordflow">return</span> C;  <span class="comment">// Return new resultant 2D vector</span></div>
 <div class="line"><span class="lineno">  450</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d77/namespacemachine__learning_a0cc29566568e0383dd7d374068cbe6b3_cgraph.svg" width="550" height="198"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae6ec42318d172b97fbdf45638d09d7b5" name="ae6ec42318d172b97fbdf45638d09d7b5"></a>
@@ -1003,9 +978,9 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; machine_learning::operator/ </td>
+          <td class="memname">std::vector&lt; std::valarray&lt; T &gt; &gt; machine_learning::operator/ </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -1028,8 +1003,10 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new resultant vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00365">365</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  366</span>                                                      {</div>
-<div class="line"><span class="lineno">  367</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; B =</div>
+<div class="line"><span class="lineno">  367</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; B =</div>
 <div class="line"><span class="lineno">  368</span>        A;               <span class="comment">// New vector to store resultant vector</span></div>
 <div class="line"><span class="lineno">  369</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;b : B) {  <span class="comment">// For every row in vector</span></div>
 <div class="line"><span class="lineno">  370</span>        b = b / val;     <span class="comment">// Divide row with scaler</span></div>
@@ -1048,14 +1025,14 @@ template&lt;typename T &gt; </div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; machine_learning::operator&lt;&lt; </td>
+          <td class="memname">std::ostream &amp; machine_learning::operator&lt;&lt; </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
+          <td class="paramtype">std::ostream &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; T, T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>&#160;)</td>
+          <td class="paramtype">const std::pair&lt; T, T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -1067,25 +1044,21 @@ template&lt;typename T &gt; </div>
 </dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramname">out</td><td><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> to output </td></tr>
+    <tr><td class="paramname">out</td><td>std::ostream to output </td></tr>
     <tr><td class="paramname">A</td><td>Pair to be printed </td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00052">52</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   52</span>                                                                {</div>
 <div class="line"><span class="lineno">   53</span>    <span class="comment">// Setting output precision to 4 in case of floating point numbers</span></div>
-<div class="line"><span class="lineno">   54</span>    out.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">precision</a>(4);</div>
+<div class="line"><span class="lineno">   54</span>    out.precision(4);</div>
 <div class="line"><span class="lineno">   55</span>    <span class="comment">// printing pair in the form (p, q)</span></div>
-<div class="line"><span class="lineno">   56</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; A.first &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; A.second &lt;&lt; <span class="stringliteral">&quot;)&quot;</span>;</div>
+<div class="line"><span class="lineno">   56</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; A.first &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; A.second &lt;&lt; <span class="stringliteral">&quot;)&quot;</span>;</div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordflow">return</span> out;</div>
 <div class="line"><span class="lineno">   58</span>}</div>
-<div class="ttc" id="aprecision_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">std::ostream::precision</a></div><div class="ttdeci">T precision(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.svg" width="407" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a54bf1f3c43271a5fc93101f6ae2e6269" name="a54bf1f3c43271a5fc93101f6ae2e6269"></a>
@@ -1097,14 +1070,14 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; machine_learning::operator&lt;&lt; </td>
+          <td class="memname">std::ostream &amp; machine_learning::operator&lt;&lt; </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
+          <td class="paramtype">std::ostream &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>&#160;)</td>
+          <td class="paramtype">const std::valarray&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -1116,26 +1089,23 @@ template&lt;typename T &gt; </div>
 </dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramname">out</td><td><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> to output </td></tr>
+    <tr><td class="paramname">out</td><td>std::ostream to output </td></tr>
     <tr><td class="paramname">A</td><td>1D vector to be printed </td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00067">67</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   67</span>                                                                 {</div>
 <div class="line"><span class="lineno">   68</span>    <span class="comment">// Setting output precision to 4 in case of floating point numbers</span></div>
-<div class="line"><span class="lineno">   69</span>    out.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">precision</a>(4);</div>
+<div class="line"><span class="lineno">   69</span>    out.precision(4);</div>
 <div class="line"><span class="lineno">   70</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;a : A) {   <span class="comment">// For every element in the vector.</span></div>
-<div class="line"><span class="lineno">   71</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; a &lt;&lt; <span class="charliteral">&#39; &#39;</span>;  <span class="comment">// Print element</span></div>
+<div class="line"><span class="lineno">   71</span>        std::cout &lt;&lt; a &lt;&lt; <span class="charliteral">&#39; &#39;</span>;  <span class="comment">// Print element</span></div>
 <div class="line"><span class="lineno">   72</span>    }</div>
-<div class="line"><span class="lineno">   73</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   73</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   74</span>    <span class="keywordflow">return</span> out;</div>
 <div class="line"><span class="lineno">   75</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.svg" width="407" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a84260cb1be9b63d6e38107000ac4b7e7" name="a84260cb1be9b63d6e38107000ac4b7e7"></a>
@@ -1147,14 +1117,14 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; machine_learning::operator&lt;&lt; </td>
+          <td class="memname">std::ostream &amp; machine_learning::operator&lt;&lt; </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
+          <td class="paramtype">std::ostream &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; std::valarray&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -1166,28 +1136,25 @@ template&lt;typename T &gt; </div>
 </dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramname">out</td><td><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> to output </td></tr>
+    <tr><td class="paramname">out</td><td>std::ostream to output </td></tr>
     <tr><td class="paramname">A</td><td>2D vector to be printed </td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00032">32</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   33</span>                                                             {</div>
 <div class="line"><span class="lineno">   34</span>    <span class="comment">// Setting output precision to 4 in case of floating point numbers</span></div>
-<div class="line"><span class="lineno">   35</span>    out.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">precision</a>(4);</div>
+<div class="line"><span class="lineno">   35</span>    out.precision(4);</div>
 <div class="line"><span class="lineno">   36</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;a : A) {       <span class="comment">// For each row in A</span></div>
 <div class="line"><span class="lineno">   37</span>        <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;x : a) {   <span class="comment">// For each element in row</span></div>
-<div class="line"><span class="lineno">   38</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; x &lt;&lt; <span class="charliteral">&#39; &#39;</span>;  <span class="comment">// print element</span></div>
+<div class="line"><span class="lineno">   38</span>            std::cout &lt;&lt; x &lt;&lt; <span class="charliteral">&#39; &#39;</span>;  <span class="comment">// print element</span></div>
 <div class="line"><span class="lineno">   39</span>        }</div>
-<div class="line"><span class="lineno">   40</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   40</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   41</span>    }</div>
 <div class="line"><span class="lineno">   42</span>    <span class="keywordflow">return</span> out;</div>
 <div class="line"><span class="lineno">   43</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.svg" width="407" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae10178b082f0205c326550877d998e5d" name="ae10178b082f0205c326550877d998e5d"></a>
@@ -1199,9 +1166,9 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; machine_learning::pop_back </td>
+          <td class="memname">std::valarray&lt; T &gt; machine_learning::pop_back </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
+          <td class="paramtype">const std::valarray&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -1219,8 +1186,10 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new resultant vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00119">119</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  119</span>                                                 {</div>
-<div class="line"><span class="lineno">  120</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> B;      <span class="comment">// New 1D vector to store resultant vector</span></div>
+<div class="line"><span class="lineno">  120</span>    std::valarray&lt;T&gt; B;      <span class="comment">// New 1D vector to store resultant vector</span></div>
 <div class="line"><span class="lineno">  121</span>    B.resize(A.size() - 1);  <span class="comment">// Resizing it accordingly</span></div>
 <div class="line"><span class="lineno">  122</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.size() - 1;</div>
 <div class="line"><span class="lineno">  123</span>         i++) {       <span class="comment">// For every (except last) element in A</span></div>
@@ -1240,9 +1209,9 @@ template&lt;typename T &gt; </div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; machine_learning::pop_front </td>
+          <td class="memname">std::valarray&lt; T &gt; machine_learning::pop_front </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
+          <td class="paramtype">const std::valarray&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -1260,8 +1229,10 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new resultant vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00102">102</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  102</span>                                                  {</div>
-<div class="line"><span class="lineno">  103</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> B;      <span class="comment">// New 1D vector to store resultant vector</span></div>
+<div class="line"><span class="lineno">  103</span>    std::valarray&lt;T&gt; B;      <span class="comment">// New 1D vector to store resultant vector</span></div>
 <div class="line"><span class="lineno">  104</span>    B.resize(A.size() - 1);  <span class="comment">// Resizing it accordingly</span></div>
 <div class="line"><span class="lineno">  105</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 1; i &lt; A.size();</div>
 <div class="line"><span class="lineno">  106</span>         i++) {           <span class="comment">// // For every (except first) element in A</span></div>
@@ -1286,7 +1257,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>W</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>W</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -1301,25 +1272,27 @@ template&lt;typename T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>0 if all ok </dd>
 <dd>
 -1 if file creation failed </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00142">142</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  143</span>                                                                      {</div>
-<div class="line"><span class="lineno">  144</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a> fp(fname);</div>
+<div class="line"><span class="lineno">  144</span>    std::ofstream fp(fname);</div>
 <div class="line"><span class="lineno">  145</span>    <span class="keywordflow">if</span> (!fp) {  <span class="comment">// error with fopen</span></div>
-<div class="line"><span class="lineno">  146</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;File error (&quot;</span> &lt;&lt; fname &lt;&lt; <span class="stringliteral">&quot;): &quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strerror.html">std::strerror</a>(errno)</div>
-<div class="line"><span class="lineno">  147</span>                  &lt;&lt; <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">  146</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;File error (&quot;</span> &lt;&lt; fname &lt;&lt; <span class="stringliteral">&quot;): &quot;</span> &lt;&lt; std::strerror(errno)</div>
+<div class="line"><span class="lineno">  147</span>                  &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  148</span>        <span class="keywordflow">return</span> -1;</div>
 <div class="line"><span class="lineno">  149</span>    }</div>
 <div class="line"><span class="lineno">  150</span> </div>
 <div class="line"><span class="lineno">  151</span>    <span class="comment">// neighborhood range</span></div>
 <div class="line"><span class="lineno">  152</span>    <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> R = 1;</div>
 <div class="line"><span class="lineno">  153</span> </div>
-<div class="line"><span class="lineno">  154</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; W.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {         <span class="comment">// for each x</span></div>
-<div class="line"><span class="lineno">  155</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; W[0].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); j++) {  <span class="comment">// for each y</span></div>
+<div class="line"><span class="lineno">  154</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; W.size(); i++) {         <span class="comment">// for each x</span></div>
+<div class="line"><span class="lineno">  155</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; W[0].size(); j++) {  <span class="comment">// for each y</span></div>
 <div class="line"><span class="lineno">  156</span>            <span class="keywordtype">double</span> distance = 0.f;</div>
 <div class="line"><span class="lineno">  157</span> </div>
-<div class="line"><span class="lineno">  158</span>            <span class="keywordtype">int</span> from_x = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max&lt;int&gt;</a>(0, i - R);</div>
-<div class="line"><span class="lineno">  159</span>            <span class="keywordtype">int</span> to_x = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min&lt;int&gt;</a>(W.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(), i + R + 1);</div>
-<div class="line"><span class="lineno">  160</span>            <span class="keywordtype">int</span> from_y = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max&lt;int&gt;</a>(0, j - R);</div>
-<div class="line"><span class="lineno">  161</span>            <span class="keywordtype">int</span> to_y = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min&lt;int&gt;</a>(W[0].size(), j + R + 1);</div>
+<div class="line"><span class="lineno">  158</span>            <span class="keywordtype">int</span> from_x = std::max&lt;int&gt;(0, i - R);</div>
+<div class="line"><span class="lineno">  159</span>            <span class="keywordtype">int</span> to_x = std::min&lt;int&gt;(W.size(), i + R + 1);</div>
+<div class="line"><span class="lineno">  160</span>            <span class="keywordtype">int</span> from_y = std::max&lt;int&gt;(0, j - R);</div>
+<div class="line"><span class="lineno">  161</span>            <span class="keywordtype">int</span> to_y = std::min&lt;int&gt;(W[0].size(), j + R + 1);</div>
 <div class="line"><span class="lineno">  162</span>            <span class="keywordtype">int</span> l = 0, m = 0;</div>
 <div class="line"><span class="lineno">  163</span><span class="preprocessor">#ifdef _OPENMP</span></div>
 <div class="line"><span class="lineno">  164</span><span class="preprocessor">#pragma omp parallel for reduction(+ : distance)</span></div>
@@ -1327,19 +1300,19 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  166</span>            <span class="keywordflow">for</span> (l = from_x; l &lt; to_x; l++) {      <span class="comment">// scan neighborhoor in x</span></div>
 <div class="line"><span class="lineno">  167</span>                <span class="keywordflow">for</span> (m = from_y; m &lt; to_y; m++) {  <span class="comment">// scan neighborhood in y</span></div>
 <div class="line"><span class="lineno">  168</span>                    <span class="keyword">auto</span> d = W[i][j] - W[l][m];</div>
-<div class="line"><span class="lineno">  169</span>                    <span class="keywordtype">double</span> d2 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(d, 2).sum();</div>
-<div class="line"><span class="lineno">  170</span>                    distance += <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(d2);</div>
+<div class="line"><span class="lineno">  169</span>                    <span class="keywordtype">double</span> d2 = std::pow(d, 2).sum();</div>
+<div class="line"><span class="lineno">  170</span>                    distance += std::sqrt(d2);</div>
 <div class="line"><span class="lineno">  171</span>                    <span class="comment">// distance += d2;</span></div>
 <div class="line"><span class="lineno">  172</span>                }</div>
 <div class="line"><span class="lineno">  173</span>            }</div>
 <div class="line"><span class="lineno">  174</span> </div>
-<div class="line"><span class="lineno">  175</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">distance</a> /= R * R;          <span class="comment">// mean distance from neighbors</span></div>
-<div class="line"><span class="lineno">  176</span>            fp &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">distance</a>;             <span class="comment">// print the mean separation</span></div>
+<div class="line"><span class="lineno">  175</span>            distance /= R * R;          <span class="comment">// mean distance from neighbors</span></div>
+<div class="line"><span class="lineno">  176</span>            fp &lt;&lt; distance;             <span class="comment">// print the mean separation</span></div>
 <div class="line"><span class="lineno">  177</span>            <span class="keywordflow">if</span> (j &lt; W[0].size() - 1) {  <span class="comment">// if not the last column</span></div>
 <div class="line"><span class="lineno">  178</span>                fp &lt;&lt; <span class="charliteral">&#39;,&#39;</span>;              <span class="comment">// suffix comma</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">if</span> (i &lt; W.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() - 1) {  <span class="comment">// if not the last row</span></div>
+<div class="line"><span class="lineno">  181</span>        <span class="keywordflow">if</span> (i &lt; W.size() - 1) {  <span class="comment">// if not the last row</span></div>
 <div class="line"><span class="lineno">  182</span>            fp &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;          <span class="comment">// start a new line</span></div>
 <div class="line"><span class="lineno">  183</span>        }</div>
 <div class="line"><span class="lineno">  184</span>    }</div>
@@ -1347,16 +1320,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  186</span>    fp.close();</div>
 <div class="line"><span class="lineno">  187</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  188</span>}</div>
-<div class="ttc" id="abasic_ofstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a></div></div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
-<div class="ttc" id="astrerror_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strerror.html">std::strerror</a></div><div class="ttdeci">T strerror(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.svg" width="355" height="332"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6f1c98c016ad34ff3d9f39372161bd35" name="a6f1c98c016ad34ff3d9f39372161bd35"></a>
@@ -1370,7 +1334,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">T machine_learning::sum </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -1388,6 +1352,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>returns sum of all elements of 2D vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00232">232</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  232</span>                                          {</div>
 <div class="line"><span class="lineno">  233</span>    T cur_sum = 0;             <span class="comment">// Initially sum is zero</span></div>
 <div class="line"><span class="lineno">  234</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;a : A) {  <span class="comment">// For every row in A</span></div>
@@ -1407,9 +1373,9 @@ template&lt;typename T &gt; </div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; machine_learning::transpose </td>
+          <td class="memname">std::vector&lt; std::valarray&lt; T &gt; &gt; machine_learning::transpose </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -1427,26 +1393,23 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new resultant vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00382">382</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  383</span>                                        {</div>
 <div class="line"><span class="lineno">  384</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape = <a class="code hl_function" href="#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);  <span class="comment">// Current shape of vector</span></div>
-<div class="line"><span class="lineno">  385</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt; B;  <span class="comment">// New vector to store result</span></div>
+<div class="line"><span class="lineno">  385</span>    std::vector&lt;std::valarray&lt;T&gt;&gt; B;  <span class="comment">// New vector to store result</span></div>
 <div class="line"><span class="lineno">  386</span>    <span class="comment">// Storing transpose values of A in B</span></div>
 <div class="line"><span class="lineno">  387</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; shape.second; j++) {</div>
-<div class="line"><span class="lineno">  388</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> row;</div>
+<div class="line"><span class="lineno">  388</span>        std::valarray&lt;T&gt; row;</div>
 <div class="line"><span class="lineno">  389</span>        row.resize(shape.first);</div>
 <div class="line"><span class="lineno">  390</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; shape.first; i++) {</div>
 <div class="line"><span class="lineno">  391</span>            row[i] = A[i][j];</div>
 <div class="line"><span class="lineno">  392</span>        }</div>
-<div class="line"><span class="lineno">  393</span>        B.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(row);</div>
+<div class="line"><span class="lineno">  393</span>        B.push_back(row);</div>
 <div class="line"><span class="lineno">  394</span>    }</div>
 <div class="line"><span class="lineno">  395</span>    <span class="keywordflow">return</span> B;  <span class="comment">// Return new resultant 2D vector</span></div>
 <div class="line"><span class="lineno">  396</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d77/namespacemachine__learning_a89fde571b38f9483576594f66572958a_cgraph.svg" width="556" height="143"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abee7b35403af3612222d3b7a53074905" name="abee7b35403af3612222d3b7a53074905"></a>
@@ -1460,12 +1423,12 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void machine_learning::uniform_random_initialization </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>shape</em></span>, </td>
+          <td class="paramtype">const std::pair&lt; size_t, size_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>shape</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -1494,32 +1457,26 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00166">166</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  168</span>                                                                {</div>
-<div class="line"><span class="lineno">  169</span>    A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/clear.html">clear</a>();  <span class="comment">// Making A empty</span></div>
+<div class="line"><span class="lineno">  169</span>    A.clear();  <span class="comment">// Making A empty</span></div>
 <div class="line"><span class="lineno">  170</span>    <span class="comment">// Uniform distribution in range [low, high]</span></div>
-<div class="line"><span class="lineno">  171</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random.html">std::default_random_engine</a> generator(</div>
-<div class="line"><span class="lineno">  172</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html">std::chrono::system_clock::now</a>().time_since_epoch().count());</div>
-<div class="line"><span class="lineno">  173</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution.html">std::uniform_real_distribution&lt;T&gt;</a> distribution(low, high);</div>
+<div class="line"><span class="lineno">  171</span>    std::default_random_engine generator(</div>
+<div class="line"><span class="lineno">  172</span>        std::chrono::system_clock::now().time_since_epoch().count());</div>
+<div class="line"><span class="lineno">  173</span>    std::uniform_real_distribution&lt;T&gt; distribution(low, high);</div>
 <div class="line"><span class="lineno">  174</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; shape.first; i++) {  <span class="comment">// For every row</span></div>
-<div class="line"><span class="lineno">  175</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a></div>
+<div class="line"><span class="lineno">  175</span>        std::valarray&lt;T&gt;</div>
 <div class="line"><span class="lineno">  176</span>            row;  <span class="comment">// Making empty row which will be inserted in vector</span></div>
 <div class="line"><span class="lineno">  177</span>        row.resize(shape.second);</div>
 <div class="line"><span class="lineno">  178</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;r : row) {             <span class="comment">// For every element in row</span></div>
 <div class="line"><span class="lineno">  179</span>            r = distribution(generator);  <span class="comment">// copy random number</span></div>
 <div class="line"><span class="lineno">  180</span>        }</div>
-<div class="line"><span class="lineno">  181</span>        A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(row);  <span class="comment">// Insert new row in vector</span></div>
+<div class="line"><span class="lineno">  181</span>        A.push_back(row);  <span class="comment">// Insert new row in vector</span></div>
 <div class="line"><span class="lineno">  182</span>    }</div>
 <div class="line"><span class="lineno">  183</span>    <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  184</span>}</div>
-<div class="ttc" id="aclear_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/clear.html">std::vector::clear</a></div><div class="ttdeci">T clear(T... args)</div></div>
-<div class="ttc" id="arandom_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random.html">std::default_random_engine</a></div></div>
-<div class="ttc" id="auniform_real_distribution_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution.html">std::uniform_real_distribution</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph.svg" width="370" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4" name="a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4"></a>
@@ -1533,12 +1490,12 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void machine_learning::unit_matrix_initialization </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>shape</em></span>&#160;)</td>
+          <td class="paramtype">const std::pair&lt; size_t, size_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>shape</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -1555,14 +1512,16 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00193">193</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  194</span>                                                                      {</div>
-<div class="line"><span class="lineno">  195</span>    A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/clear.html">clear</a>();  <span class="comment">// Making A empty</span></div>
+<div class="line"><span class="lineno">  195</span>    A.clear();  <span class="comment">// Making A empty</span></div>
 <div class="line"><span class="lineno">  196</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; shape.first; i++) {</div>
-<div class="line"><span class="lineno">  197</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a></div>
+<div class="line"><span class="lineno">  197</span>        std::valarray&lt;T&gt;</div>
 <div class="line"><span class="lineno">  198</span>            row;  <span class="comment">// Making empty row which will be inserted in vector</span></div>
 <div class="line"><span class="lineno">  199</span>        row.resize(shape.second);</div>
 <div class="line"><span class="lineno">  200</span>        row[i] = T(1);     <span class="comment">// Insert 1 at ith position</span></div>
-<div class="line"><span class="lineno">  201</span>        A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(row);  <span class="comment">// Insert new row in vector</span></div>
+<div class="line"><span class="lineno">  201</span>        A.push_back(row);  <span class="comment">// Insert new row in vector</span></div>
 <div class="line"><span class="lineno">  202</span>    }</div>
 <div class="line"><span class="lineno">  203</span>    <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  204</span>}</div>
@@ -1578,17 +1537,17 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void machine_learning::update_weights </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>x</em></span>, </td>
+          <td class="paramtype">const std::valarray&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>x</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>W</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::valarray&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>W</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>D</em></span>, </td>
+          <td class="paramtype">std::valarray&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>D</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -1613,9 +1572,11 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00103">103</a> of file <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html">kohonen_som_trace.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  105</span>                                                                 {</div>
 <div class="line"><span class="lineno">  106</span>    <span class="keywordtype">int</span> j = 0, k = 0;</div>
-<div class="line"><span class="lineno">  107</span>    <span class="keywordtype">int</span> num_out = W-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();  <span class="comment">// number of SOM output nodes</span></div>
+<div class="line"><span class="lineno">  107</span>    <span class="keywordtype">int</span> num_out = W-&gt;size();  <span class="comment">// number of SOM output nodes</span></div>
 <div class="line"><span class="lineno">  108</span>    <span class="comment">// int num_features = x.size();  // number of data features</span></div>
 <div class="line"><span class="lineno">  109</span> </div>
 <div class="line"><span class="lineno">  110</span><span class="preprocessor">#ifdef _OPENMP</span></div>
@@ -1630,13 +1591,13 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  119</span> </div>
 <div class="line"><span class="lineno">  120</span>    <span class="comment">// step 2:  get closest node i.e., node with snallest Euclidian distance to</span></div>
 <div class="line"><span class="lineno">  121</span>    <span class="comment">// the current pattern</span></div>
-<div class="line"><span class="lineno">  122</span>    <span class="keyword">auto</span> result = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min_element.html">std::min_element</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(*D), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(*D));</div>
+<div class="line"><span class="lineno">  122</span>    <span class="keyword">auto</span> result = std::min_element(std::begin(*D), std::end(*D));</div>
 <div class="line"><span class="lineno">  123</span>    <span class="comment">// double d_min = *result;</span></div>
-<div class="line"><span class="lineno">  124</span>    <span class="keywordtype">int</span> d_min_idx = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">std::distance</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(*D), result);</div>
+<div class="line"><span class="lineno">  124</span>    <span class="keywordtype">int</span> d_min_idx = std::distance(std::begin(*D), result);</div>
 <div class="line"><span class="lineno">  125</span> </div>
 <div class="line"><span class="lineno">  126</span>    <span class="comment">// step 3a: get the neighborhood range</span></div>
-<div class="line"><span class="lineno">  127</span>    <span class="keywordtype">int</span> from_node = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(0, d_min_idx - R);</div>
-<div class="line"><span class="lineno">  128</span>    <span class="keywordtype">int</span> to_node = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(num_out, d_min_idx + R + 1);</div>
+<div class="line"><span class="lineno">  127</span>    <span class="keywordtype">int</span> from_node = std::max(0, d_min_idx - R);</div>
+<div class="line"><span class="lineno">  128</span>    <span class="keywordtype">int</span> to_node = std::min(num_out, d_min_idx + R + 1);</div>
 <div class="line"><span class="lineno">  129</span> </div>
 <div class="line"><span class="lineno">  130</span>    <span class="comment">// step 3b: update the weights of nodes in the</span></div>
 <div class="line"><span class="lineno">  131</span>    <span class="comment">// neighborhood</span></div>
@@ -1648,14 +1609,8 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  137</span>        (*W)[j] += alpha * (x - (*W)[j]);</div>
 <div class="line"><span class="lineno">  138</span>    }</div>
 <div class="line"><span class="lineno">  139</span>}</div>
-<div class="ttc" id="amin_element_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min_element.html">std::min_element</a></div><div class="ttdeci">T min_element(T... args)</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph.svg" width="384" height="332"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00232">vector_ops.hpp:232</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae868ad43698a1d69ba46ea3827d7d2c3" name="ae868ad43698a1d69ba46ea3827d7d2c3"></a>
@@ -1667,17 +1622,17 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">double machine_learning::update_weights </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>, </td>
+          <td class="paramtype">const std::valarray&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>W</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>W</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>D</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::valarray&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>D</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -1703,10 +1658,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>minimum distance of sample and trained weights </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00200">200</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  203</span>                             {</div>
 <div class="line"><span class="lineno">  204</span>    <span class="keywordtype">int</span> x = 0, y = 0;</div>
-<div class="line"><span class="lineno">  205</span>    <span class="keywordtype">int</span> num_out_x = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(W-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>());       <span class="comment">// output nodes - in X</span></div>
-<div class="line"><span class="lineno">  206</span>    <span class="keywordtype">int</span> num_out_y = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(W[0][0].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>());  <span class="comment">// output nodes - in Y</span></div>
+<div class="line"><span class="lineno">  205</span>    <span class="keywordtype">int</span> num_out_x = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(W-&gt;size());       <span class="comment">// output nodes - in X</span></div>
+<div class="line"><span class="lineno">  206</span>    <span class="keywordtype">int</span> num_out_y = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(W[0][0].size());  <span class="comment">// output nodes - in Y</span></div>
 <div class="line"><span class="lineno">  207</span>    <span class="comment">// int num_features = static_cast&lt;int&gt;(W[0][0][0].size());  //  features =</span></div>
 <div class="line"><span class="lineno">  208</span>    <span class="comment">// in Z</span></div>
 <div class="line"><span class="lineno">  209</span>    <span class="keywordtype">double</span> d_min = 0.f;</div>
@@ -1722,7 +1679,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  219</span>            <span class="comment">// point from the current sample</span></div>
 <div class="line"><span class="lineno">  220</span>            <span class="keyword">auto</span> d = ((*W)[x][y] - X);</div>
 <div class="line"><span class="lineno">  221</span>            (*D)[x][y] = (d * d).<a class="code hl_function" href="#a6f1c98c016ad34ff3d9f39372161bd35">sum</a>();</div>
-<div class="line"><span class="lineno">  222</span>            (*D)[x][y] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>((*D)[x][y]);</div>
+<div class="line"><span class="lineno">  222</span>            (*D)[x][y] = std::sqrt((*D)[x][y]);</div>
 <div class="line"><span class="lineno">  223</span>        }</div>
 <div class="line"><span class="lineno">  224</span>    }</div>
 <div class="line"><span class="lineno">  225</span> </div>
@@ -1732,10 +1689,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  229</span>    <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e">get_min_2d</a>(*D, &amp;d_min, &amp;d_min_x, &amp;d_min_y);</div>
 <div class="line"><span class="lineno">  230</span> </div>
 <div class="line"><span class="lineno">  231</span>    <span class="comment">// step 3a: get the neighborhood range</span></div>
-<div class="line"><span class="lineno">  232</span>    <span class="keywordtype">int</span> from_x = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(0, d_min_x - R);</div>
-<div class="line"><span class="lineno">  233</span>    <span class="keywordtype">int</span> to_x = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(num_out_x, d_min_x + R + 1);</div>
-<div class="line"><span class="lineno">  234</span>    <span class="keywordtype">int</span> from_y = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(0, d_min_y - R);</div>
-<div class="line"><span class="lineno">  235</span>    <span class="keywordtype">int</span> to_y = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(num_out_y, d_min_y + R + 1);</div>
+<div class="line"><span class="lineno">  232</span>    <span class="keywordtype">int</span> from_x = std::max(0, d_min_x - R);</div>
+<div class="line"><span class="lineno">  233</span>    <span class="keywordtype">int</span> to_x = std::min(num_out_x, d_min_x + R + 1);</div>
+<div class="line"><span class="lineno">  234</span>    <span class="keywordtype">int</span> from_y = std::max(0, d_min_y - R);</div>
+<div class="line"><span class="lineno">  235</span>    <span class="keywordtype">int</span> to_y = std::min(num_out_y, d_min_y + R + 1);</div>
 <div class="line"><span class="lineno">  236</span> </div>
 <div class="line"><span class="lineno">  237</span>    <span class="comment">// step 3b: update the weights of nodes in the</span></div>
 <div class="line"><span class="lineno">  238</span>    <span class="comment">// neighborhood</span></div>
@@ -1753,21 +1710,15 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  250</span><span class="comment">               current node */</span></div>
 <div class="line"><span class="lineno">  251</span>            <span class="keywordtype">double</span> d2 =</div>
 <div class="line"><span class="lineno">  252</span>                (d_min_x - x) * (d_min_x - x) + (d_min_y - y) * (d_min_y - y);</div>
-<div class="line"><span class="lineno">  253</span>            <span class="keywordtype">double</span> scale_factor = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a>(-d2 / (2.f * alpha * alpha));</div>
+<div class="line"><span class="lineno">  253</span>            <span class="keywordtype">double</span> scale_factor = std::exp(-d2 / (2.f * alpha * alpha));</div>
 <div class="line"><span class="lineno">  254</span> </div>
 <div class="line"><span class="lineno">  255</span>            (*W)[x][y] += (X - (*W)[x][y]) * alpha * scale_factor;</div>
 <div class="line"><span class="lineno">  256</span>        }</div>
 <div class="line"><span class="lineno">  257</span>    }</div>
 <div class="line"><span class="lineno">  258</span>    <span class="keywordflow">return</span> d_min;</div>
 <div class="line"><span class="lineno">  259</span>}</div>
-<div class="ttc" id="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div>
-<div class="ttc" id="agroup__machine__learning_html_ga60f9186ccb682724a8792a2bf81e9b9e"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e">get_min_2d</a></div><div class="ttdeci">void get_min_2d(const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X, double *val, int *x_idx, int *y_idx)</div><div class="ttdef"><b>Definition</b> kohonen_som_topology.cpp:105</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d77/namespacemachine__learning_ae868ad43698a1d69ba46ea3827d7d2c3_cgraph.svg" width="554" height="307"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agroup__machine__learning_html_ga60f9186ccb682724a8792a2bf81e9b9e"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e">get_min_2d</a></div><div class="ttdeci">void get_min_2d(const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X, double *val, int *x_idx, int *y_idx)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00105">kohonen_som_topology.cpp:105</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac1bdaa2a724b4ce6a6bb371a5dbe2e7e" name="ac1bdaa2a724b4ce6a6bb371a5dbe2e7e"></a>
@@ -1781,12 +1732,12 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">void machine_learning::zeroes_initialization </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>shape</em></span>&#160;)</td>
+          <td class="paramtype">const std::pair&lt; size_t, size_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>shape</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -1803,13 +1754,15 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html#l00213">213</a> of file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  214</span>                                                                 {</div>
-<div class="line"><span class="lineno">  215</span>    A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/clear.html">clear</a>();  <span class="comment">// Making A empty</span></div>
+<div class="line"><span class="lineno">  215</span>    A.clear();  <span class="comment">// Making A empty</span></div>
 <div class="line"><span class="lineno">  216</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; shape.first; i++) {</div>
-<div class="line"><span class="lineno">  217</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a></div>
+<div class="line"><span class="lineno">  217</span>        std::valarray&lt;T&gt;</div>
 <div class="line"><span class="lineno">  218</span>            row;  <span class="comment">// Making empty row which will be inserted in vector</span></div>
 <div class="line"><span class="lineno">  219</span>        row.resize(shape.second);  <span class="comment">// By default all elements are zero</span></div>
-<div class="line"><span class="lineno">  220</span>        A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(row);          <span class="comment">// Insert new row in vector</span></div>
+<div class="line"><span class="lineno">  220</span>        A.push_back(row);          <span class="comment">// Insert new row in vector</span></div>
 <div class="line"><span class="lineno">  221</span>    }</div>
 <div class="line"><span class="lineno">  222</span>    <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  223</span>}</div>
@@ -1838,6 +1791,8 @@ template&lt;typename T &gt; </div>
 </div><div class="memdoc">
 <p><a class="el" href="../../d4/d12/namespace_minimum.html" title="Implementation of Minimum Edit Distance algorithm.">Minimum</a> average distance of image nodes </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00129">129</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
+
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.map b/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.map
deleted file mode 100644
index b096cb158..000000000
--- a/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.map
+++ /dev/null
@@ -1,25 +0,0 @@
-<map id="machine_learning::kohonen_som_tracer" name="machine_learning::kohonen_som_tracer">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,146,185,186"/>
-<area shape="rect" id="Node000002" href="$d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3" title=" " alt="" coords="233,146,402,186"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="185,164,217,164,217,169,185,169"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/exp.html#" title=" " alt="" coords="494,29,562,55"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="339,143,387,103,449,64,478,52,480,57,451,69,391,108,342,148"/>
-<area shape="rect" id="Node000004" href="$d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e" title=" " alt="" coords="484,79,572,104"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="370,143,449,113,468,107,469,112,451,118,372,148"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="492,128,564,154"/>
-<area shape="poly" id="edge8_Node000002_Node000009" title=" " alt="" coords="402,153,475,144,476,150,403,159"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="494,177,562,203"/>
-<area shape="poly" id="edge9_Node000002_Node000010" title=" " alt="" coords="403,173,479,182,478,187,402,179"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="493,227,562,252"/>
-<area shape="poly" id="edge10_Node000002_Node000011" title=" " alt="" coords="373,184,451,213,479,222,477,227,449,218,371,189"/>
-<area shape="rect" id="Node000012" href="$d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" title=" " alt="" coords="450,276,605,302"/>
-<area shape="poly" id="edge11_Node000002_Node000012" title=" " alt="" coords="343,185,391,224,451,262,462,268,460,272,449,267,388,228,340,189"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="675,5,753,31"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="571,77,604,65,652,40,663,35,665,40,655,45,606,70,573,82"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/distance.html#" title=" " alt="" coords="666,55,762,80"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="572,83,650,73,651,78,572,89"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="680,104,748,130"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="572,95,665,108,664,113,572,100"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min_element.html#" title=" " alt="" coords="653,153,775,179"/>
-<area shape="poly" id="edge7_Node000004_Node000008" title=" " alt="" coords="573,101,606,113,655,140,665,145,663,149,652,145,604,118,571,106"/>
-</map>
diff --git a/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.md5 b/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.md5
deleted file mode 100644
index 432919a85..000000000
--- a/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3cc03b906d359c08441aa0384717fbbd
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.svg b/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.svg
deleted file mode 100644
index dca3be13d..000000000
--- a/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph.svg
+++ /dev/null
@@ -1,304 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::kohonen_som_tracer Pages: 1 -->
-<!--zoomable 230 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 585;
-var viewHeight = 230;
-var sectionId = 'dynsection-5';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>machine_learning::kohonen_som_tracer</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="134.5,-116.88 0,-116.88 0,-86.38 134.5,-86.38 134.5,-116.88"/>
-<text text-anchor="start" x="8" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::kohonen</text>
-<text text-anchor="middle" x="67.25" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">_som_tracer</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="297.5,-116.88 170.5,-116.88 170.5,-86.38 297.5,-86.38 297.5,-116.88"/>
-<text text-anchor="start" x="178.5" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::update</text>
-<text text-anchor="middle" x="234" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">_weights</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.79,-101.62C142.74,-101.62 150.89,-101.62 158.94,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.7,-105.13 168.7,-101.63 158.7,-98.13 158.7,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="417.38,-204.25 366.12,-204.25 366.12,-185 417.38,-185 417.38,-204.25"/>
-<text text-anchor="middle" x="391.75" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.55,-117.14C270.19,-133.88 302.01,-160.32 333.5,-176.62 340.2,-180.09 347.68,-183.04 354.98,-185.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="353.74,-188.76 364.33,-188.36 355.8,-182.07 353.74,-188.76"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424.88,-167.25 358.62,-167.25 358.62,-148 424.88,-148 424.88,-167.25"/>
-<text text-anchor="middle" x="391.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_min_2d</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.09,-117.36C292.09,-124.44 313.78,-132.73 333.5,-139.62 337.98,-141.19 342.68,-142.77 347.38,-144.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="346.2,-147.61 356.79,-147.33 348.34,-140.94 346.2,-147.61"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="418.88,-130.25 364.62,-130.25 364.62,-111 418.88,-111 418.88,-130.25"/>
-<text text-anchor="middle" x="391.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.9,-109.3C316.52,-111.57 336.32,-113.98 352.83,-116"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.36,-119.47 362.71,-117.2 353.2,-112.52 352.36,-119.47"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="417.38,-93.25 366.12,-93.25 366.12,-74 417.38,-74 417.38,-93.25"/>
-<text text-anchor="middle" x="391.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge9_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.9,-94.36C317.24,-92.12 337.87,-89.74 354.76,-87.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="354.75,-91.31 364.28,-86.68 353.95,-84.36 354.75,-91.31"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="417.75,-56.25 365.75,-56.25 365.75,-37 417.75,-37 417.75,-56.25"/>
-<text text-anchor="middle" x="391.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge10_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge10_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.08,-86C292.89,-79.21 314.16,-71.29 333.5,-64.62 340.21,-62.31 347.4,-59.96 354.34,-57.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.35,-61.09 363.84,-54.76 353.25,-54.42 355.35,-61.09"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="450,-19.25 333.5,-19.25 333.5,0 450,0 450,-19.25"/>
-<text text-anchor="middle" x="391.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge11_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge11_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.93,-86.03C270.65,-69.51 302.3,-43.65 333.5,-27.62 336.19,-26.24 339,-24.95 341.88,-23.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="342.96,-27.06 351.04,-20.21 340.45,-20.53 342.96,-27.06"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="560.88,-222.25 502.12,-222.25 502.12,-203 560.88,-203 560.88,-222.25"/>
-<text text-anchor="middle" x="531.5" y="-208.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M425.21,-166.71C433.41,-169.31 442.11,-172.34 450,-175.62 466.7,-182.59 469.59,-187 486,-194.62 488.58,-195.82 491.26,-197.02 493.97,-198.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="492.46,-201.36 503.03,-202.01 495.17,-194.91 492.46,-201.36"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="567.62,-185.25 495.38,-185.25 495.38,-166 567.62,-166 567.62,-185.25"/>
-<text text-anchor="middle" x="531.5" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M425.05,-161.85C442.51,-164.13 464.4,-166.99 483.7,-169.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="483.15,-172.97 493.52,-170.79 484.06,-166.03 483.15,-172.97"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="557.12,-148.25 505.88,-148.25 505.88,-129 557.12,-129 557.12,-148.25"/>
-<text text-anchor="middle" x="531.5" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M425.05,-153.17C445.85,-150.3 472.92,-146.57 494.42,-143.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="494.79,-147.08 504.22,-142.25 493.84,-140.15 494.79,-147.08"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="577,-111.25 486,-111.25 486,-92 577,-92 577,-111.25"/>
-<text text-anchor="middle" x="531.5" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M425.26,-148.66C433.46,-146.06 442.15,-143 450,-139.62 466.82,-132.4 469.49,-127.52 486,-119.62 488.57,-118.4 491.24,-117.18 493.94,-115.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.15,-119.28 502.99,-112.16 492.42,-112.83 495.15,-119.28"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph_org.svg b/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph_org.svg
deleted file mode 100644
index fb1e78473..000000000
--- a/d8/d77/namespacemachine__learning_a042f435bca0839e721fc1574a61e8da3_cgraph_org.svg
+++ /dev/null
@@ -1,221 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::kohonen_som_tracer Pages: 1 -->
-<svg width="585pt" height="230pt"
- viewBox="0.00 0.00 585.00 230.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 226.25)">
-<title>machine_learning::kohonen_som_tracer</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="134.5,-116.88 0,-116.88 0,-86.38 134.5,-86.38 134.5,-116.88"/>
-<text text-anchor="start" x="8" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::kohonen</text>
-<text text-anchor="middle" x="67.25" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">_som_tracer</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="297.5,-116.88 170.5,-116.88 170.5,-86.38 297.5,-86.38 297.5,-116.88"/>
-<text text-anchor="start" x="178.5" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::update</text>
-<text text-anchor="middle" x="234" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">_weights</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.79,-101.62C142.74,-101.62 150.89,-101.62 158.94,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.7,-105.13 168.7,-101.63 158.7,-98.13 158.7,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="417.38,-204.25 366.12,-204.25 366.12,-185 417.38,-185 417.38,-204.25"/>
-<text text-anchor="middle" x="391.75" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.55,-117.14C270.19,-133.88 302.01,-160.32 333.5,-176.62 340.2,-180.09 347.68,-183.04 354.98,-185.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="353.74,-188.76 364.33,-188.36 355.8,-182.07 353.74,-188.76"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424.88,-167.25 358.62,-167.25 358.62,-148 424.88,-148 424.88,-167.25"/>
-<text text-anchor="middle" x="391.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_min_2d</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.09,-117.36C292.09,-124.44 313.78,-132.73 333.5,-139.62 337.98,-141.19 342.68,-142.77 347.38,-144.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="346.2,-147.61 356.79,-147.33 348.34,-140.94 346.2,-147.61"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="418.88,-130.25 364.62,-130.25 364.62,-111 418.88,-111 418.88,-130.25"/>
-<text text-anchor="middle" x="391.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.9,-109.3C316.52,-111.57 336.32,-113.98 352.83,-116"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.36,-119.47 362.71,-117.2 353.2,-112.52 352.36,-119.47"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="417.38,-93.25 366.12,-93.25 366.12,-74 417.38,-74 417.38,-93.25"/>
-<text text-anchor="middle" x="391.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge9_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M297.9,-94.36C317.24,-92.12 337.87,-89.74 354.76,-87.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="354.75,-91.31 364.28,-86.68 353.95,-84.36 354.75,-91.31"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="417.75,-56.25 365.75,-56.25 365.75,-37 417.75,-37 417.75,-56.25"/>
-<text text-anchor="middle" x="391.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge10_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge10_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.08,-86C292.89,-79.21 314.16,-71.29 333.5,-64.62 340.21,-62.31 347.4,-59.96 354.34,-57.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.35,-61.09 363.84,-54.76 353.25,-54.42 355.35,-61.09"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="450,-19.25 333.5,-19.25 333.5,0 450,0 450,-19.25"/>
-<text text-anchor="middle" x="391.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge11_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge11_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.93,-86.03C270.65,-69.51 302.3,-43.65 333.5,-27.62 336.19,-26.24 339,-24.95 341.88,-23.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="342.96,-27.06 351.04,-20.21 340.45,-20.53 342.96,-27.06"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="560.88,-222.25 502.12,-222.25 502.12,-203 560.88,-203 560.88,-222.25"/>
-<text text-anchor="middle" x="531.5" y="-208.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M425.21,-166.71C433.41,-169.31 442.11,-172.34 450,-175.62 466.7,-182.59 469.59,-187 486,-194.62 488.58,-195.82 491.26,-197.02 493.97,-198.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="492.46,-201.36 503.03,-202.01 495.17,-194.91 492.46,-201.36"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="567.62,-185.25 495.38,-185.25 495.38,-166 567.62,-166 567.62,-185.25"/>
-<text text-anchor="middle" x="531.5" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M425.05,-161.85C442.51,-164.13 464.4,-166.99 483.7,-169.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="483.15,-172.97 493.52,-170.79 484.06,-166.03 483.15,-172.97"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="557.12,-148.25 505.88,-148.25 505.88,-129 557.12,-129 557.12,-148.25"/>
-<text text-anchor="middle" x="531.5" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M425.05,-153.17C445.85,-150.3 472.92,-146.57 494.42,-143.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="494.79,-147.08 504.22,-142.25 493.84,-140.15 494.79,-147.08"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="577,-111.25 486,-111.25 486,-92 577,-92 577,-111.25"/>
-<text text-anchor="middle" x="531.5" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M425.26,-148.66C433.46,-146.06 442.15,-143 450,-139.62 466.82,-132.4 469.49,-127.52 486,-119.62 488.57,-118.4 491.24,-117.18 493.94,-115.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.15,-119.28 502.99,-112.16 492.42,-112.83 495.15,-119.28"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_a0cc29566568e0383dd7d374068cbe6b3_cgraph.map b/d8/d77/namespacemachine__learning_a0cc29566568e0383dd7d374068cbe6b3_cgraph.map
deleted file mode 100644
index 91f839cfd..000000000
--- a/d8/d77/namespacemachine__learning_a0cc29566568e0383dd7d374068cbe6b3_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="machine_learning::operator&#45;" name="machine_learning::operator&#45;">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,88,187,114"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="455,5,526,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="120,85,171,60,234,37,288,26,343,19,439,15,440,20,344,25,289,31,235,42,173,65,122,90"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="456,112,525,138"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="187,104,441,119,441,125,187,109"/>
-<area shape="rect" id="Node000004" href="$d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" title=" " alt="" coords="238,51,386,92"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="187,86,222,81,223,86,187,91"/>
-<area shape="rect" id="Node000006" 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="235,167,389,192"/>
-<area shape="poly" id="edge7_Node000001_Node000006" title=" " alt="" coords="134,112,261,158,259,163,133,117"/>
-<area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="382,48,440,30,441,36,383,53"/>
-<area shape="poly" id="edge5_Node000004_Node000003" title=" " alt="" coords="383,90,442,108,441,113,382,95"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="437,59,544,84"/>
-<area shape="poly" id="edge6_Node000004_Node000005" title=" " alt="" coords="386,69,421,69,421,74,386,74"/>
-</map>
diff --git a/d8/d77/namespacemachine__learning_a0cc29566568e0383dd7d374068cbe6b3_cgraph.md5 b/d8/d77/namespacemachine__learning_a0cc29566568e0383dd7d374068cbe6b3_cgraph.md5
deleted file mode 100644
index 64a4caa85..000000000
--- a/d8/d77/namespacemachine__learning_a0cc29566568e0383dd7d374068cbe6b3_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d8101f5693d09f00309b8cbc40cd3d18
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_a0cc29566568e0383dd7d374068cbe6b3_cgraph.svg b/d8/d77/namespacemachine__learning_a0cc29566568e0383dd7d374068cbe6b3_cgraph.svg
deleted file mode 100644
index 6c25329f8..000000000
--- a/d8/d77/namespacemachine__learning_a0cc29566568e0383dd7d374068cbe6b3_cgraph.svg
+++ /dev/null
@@ -1,156 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::operator&#45; Pages: 1 -->
-<svg width="412pt" height="148pt"
- viewBox="0.00 0.00 412.25 148.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 144.25)">
-<title>machine_learning::operator&#45;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="136,-78.25 0,-78.25 0,-59 136,-59 136,-78.25"/>
-<text text-anchor="middle" x="68" y="-64.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&#45;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="390.75,-140.25 337.25,-140.25 337.25,-121 390.75,-121 390.75,-140.25"/>
-<text text-anchor="middle" x="364" y="-126.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.57,-78.68C106.55,-89.59 140.52,-106.53 172,-114.62 224.13,-128.04 286.64,-130.89 325.6,-131.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.38,-134.67 335.39,-131.18 325.39,-127.67 325.38,-134.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="389.62,-60.25 338.38,-60.25 338.38,-41 389.62,-41 389.62,-60.25"/>
-<text text-anchor="middle" x="364" y="-46.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.45,-64.5C195.68,-60.87 279.57,-55.73 326.88,-52.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.81,-56.35 336.58,-52.24 326.38,-49.36 326.81,-56.35"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.5,-105.88 174.25,-105.88 174.25,-75.38 285.5,-75.38 285.5,-105.88"/>
-<text text-anchor="start" x="182.25" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="229.88" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.34,-77.89C145.12,-79.1 154.11,-80.34 162.87,-81.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.33,-85 172.72,-82.9 163.29,-78.07 162.33,-85"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="287.75,-19.25 172,-19.25 172,0 287.75,0 287.75,-19.25"/>
-<text text-anchor="middle" x="229.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.12,-58.62C122.19,-49 161.82,-34.37 191,-23.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.03,-26.95 200.2,-20.21 189.61,-20.39 192.03,-26.95"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.72,-106.32C297.29,-110.73 312.83,-115.44 326.32,-119.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.07,-122.8 335.65,-122.35 327.09,-116.1 325.07,-122.8"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.72,-74.93C297.63,-70.42 313.55,-65.6 327.26,-61.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.17,-64.83 336.72,-58.58 326.14,-58.13 328.17,-64.83"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="404.25,-100.25 323.75,-100.25 323.75,-81 404.25,-81 404.25,-100.25"/>
-<text text-anchor="middle" x="364" y="-86.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge6_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge6_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.76,-90.62C294.44,-90.62 303.38,-90.62 311.96,-90.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="311.87,-94.13 321.87,-90.63 311.87,-87.13 311.87,-94.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_a0cc29566568e0383dd7d374068cbe6b3_cgraph_org.svg b/d8/d77/namespacemachine__learning_a0cc29566568e0383dd7d374068cbe6b3_cgraph_org.svg
deleted file mode 100644
index 8e9b471aa..000000000
--- a/d8/d77/namespacemachine__learning_a0cc29566568e0383dd7d374068cbe6b3_cgraph_org.svg
+++ /dev/null
@@ -1,130 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::operator&#45; Pages: 1 -->
-<svg width="412pt" height="148pt"
- viewBox="0.00 0.00 412.25 148.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 144.25)">
-<title>machine_learning::operator&#45;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="136,-78.25 0,-78.25 0,-59 136,-59 136,-78.25"/>
-<text text-anchor="middle" x="68" y="-64.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&#45;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="390.75,-140.25 337.25,-140.25 337.25,-121 390.75,-121 390.75,-140.25"/>
-<text text-anchor="middle" x="364" y="-126.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M86.57,-78.68C106.55,-89.59 140.52,-106.53 172,-114.62 224.13,-128.04 286.64,-130.89 325.6,-131.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.38,-134.67 335.39,-131.18 325.39,-127.67 325.38,-134.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="389.62,-60.25 338.38,-60.25 338.38,-41 389.62,-41 389.62,-60.25"/>
-<text text-anchor="middle" x="364" y="-46.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.45,-64.5C195.68,-60.87 279.57,-55.73 326.88,-52.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.81,-56.35 336.58,-52.24 326.38,-49.36 326.81,-56.35"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.5,-105.88 174.25,-105.88 174.25,-75.38 285.5,-75.38 285.5,-105.88"/>
-<text text-anchor="start" x="182.25" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="229.88" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.34,-77.89C145.12,-79.1 154.11,-80.34 162.87,-81.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.33,-85 172.72,-82.9 163.29,-78.07 162.33,-85"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="287.75,-19.25 172,-19.25 172,0 287.75,0 287.75,-19.25"/>
-<text text-anchor="middle" x="229.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.12,-58.62C122.19,-49 161.82,-34.37 191,-23.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.03,-26.95 200.2,-20.21 189.61,-20.39 192.03,-26.95"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.72,-106.32C297.29,-110.73 312.83,-115.44 326.32,-119.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.07,-122.8 335.65,-122.35 327.09,-116.1 325.07,-122.8"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.72,-74.93C297.63,-70.42 313.55,-65.6 327.26,-61.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.17,-64.83 336.72,-58.58 326.14,-58.13 328.17,-64.83"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="404.25,-100.25 323.75,-100.25 323.75,-81 404.25,-81 404.25,-100.25"/>
-<text text-anchor="middle" x="364" y="-86.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge6_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge6_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.76,-90.62C294.44,-90.62 303.38,-90.62 311.96,-90.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="311.87,-94.13 321.87,-90.63 311.87,-87.13 311.87,-94.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_a2466857dab977a49f117029835b3b6d2_cgraph.map b/d8/d77/namespacemachine__learning_a2466857dab977a49f117029835b3b6d2_cgraph.map
deleted file mode 100644
index 17c42373a..000000000
--- a/d8/d77/namespacemachine__learning_a2466857dab977a49f117029835b3b6d2_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="machine_learning::operator+" name="machine_learning::operator+">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,88,191,114"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="459,5,530,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="122,85,174,60,238,37,292,26,347,19,443,15,444,20,348,25,293,31,239,42,176,65,124,90"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="460,112,529,138"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="191,104,445,119,445,125,191,109"/>
-<area shape="rect" id="Node000004" href="$d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" title=" " alt="" coords="242,51,390,92"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="191,86,226,81,227,86,192,91"/>
-<area shape="rect" id="Node000006" 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="239,167,393,192"/>
-<area shape="poly" id="edge7_Node000001_Node000006" title=" " alt="" coords="137,112,264,158,263,163,135,117"/>
-<area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="386,48,444,30,445,36,387,53"/>
-<area shape="poly" id="edge5_Node000004_Node000003" title=" " alt="" coords="387,90,446,108,445,113,386,95"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="441,59,548,84"/>
-<area shape="poly" id="edge6_Node000004_Node000005" title=" " alt="" coords="390,69,425,69,425,74,390,74"/>
-</map>
diff --git a/d8/d77/namespacemachine__learning_a2466857dab977a49f117029835b3b6d2_cgraph.md5 b/d8/d77/namespacemachine__learning_a2466857dab977a49f117029835b3b6d2_cgraph.md5
deleted file mode 100644
index ec6a0aeb2..000000000
--- a/d8/d77/namespacemachine__learning_a2466857dab977a49f117029835b3b6d2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-247972794eff46f689cd8e19b8ffb11f
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_a2466857dab977a49f117029835b3b6d2_cgraph.svg b/d8/d77/namespacemachine__learning_a2466857dab977a49f117029835b3b6d2_cgraph.svg
deleted file mode 100644
index 884409f74..000000000
--- a/d8/d77/namespacemachine__learning_a2466857dab977a49f117029835b3b6d2_cgraph.svg
+++ /dev/null
@@ -1,156 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::operator+ Pages: 1 -->
-<svg width="415pt" height="148pt"
- viewBox="0.00 0.00 415.25 148.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 144.25)">
-<title>machine_learning::operator+</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="139,-78.25 0,-78.25 0,-59 139,-59 139,-78.25"/>
-<text text-anchor="middle" x="69.5" y="-64.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator+</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="393.75,-140.25 340.25,-140.25 340.25,-121 393.75,-121 393.75,-140.25"/>
-<text text-anchor="middle" x="367" y="-126.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.34,-78.68C108.64,-89.58 143.11,-106.51 175,-114.62 227.17,-127.9 289.67,-130.78 328.62,-131.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.39,-134.61 338.4,-131.14 328.41,-127.61 328.39,-134.61"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="392.62,-60.25 341.38,-60.25 341.38,-41 392.62,-41 392.62,-60.25"/>
-<text text-anchor="middle" x="367" y="-46.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.41,-64.43C198.87,-60.81 282.42,-55.72 329.68,-52.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.88,-56.33 339.65,-52.23 329.45,-49.34 329.88,-56.33"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="288.5,-105.88 177.25,-105.88 177.25,-75.38 288.5,-75.38 288.5,-105.88"/>
-<text text-anchor="start" x="185.25" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="232.88" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.41,-78.02C148.1,-79.2 156.99,-80.42 165.64,-81.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.97,-85.04 175.35,-82.92 165.91,-78.1 164.97,-85.04"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.75,-19.25 175,-19.25 175,0 290.75,0 290.75,-19.25"/>
-<text text-anchor="middle" x="232.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.88,-58.62C124.19,-49 164.19,-34.37 193.65,-23.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.75,-26.92 202.94,-20.2 192.35,-20.35 194.75,-26.92"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.72,-106.32C300.29,-110.73 315.83,-115.44 329.32,-119.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.07,-122.8 338.65,-122.35 330.09,-116.1 328.07,-122.8"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.72,-74.93C300.63,-70.42 316.55,-65.6 330.26,-61.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.17,-64.83 339.72,-58.58 329.14,-58.13 331.17,-64.83"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="407.25,-100.25 326.75,-100.25 326.75,-81 407.25,-81 407.25,-100.25"/>
-<text text-anchor="middle" x="367" y="-86.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge6_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge6_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M288.76,-90.62C297.44,-90.62 306.38,-90.62 314.96,-90.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.87,-94.13 324.87,-90.63 314.87,-87.13 314.87,-94.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_a2466857dab977a49f117029835b3b6d2_cgraph_org.svg b/d8/d77/namespacemachine__learning_a2466857dab977a49f117029835b3b6d2_cgraph_org.svg
deleted file mode 100644
index ebab2fb00..000000000
--- a/d8/d77/namespacemachine__learning_a2466857dab977a49f117029835b3b6d2_cgraph_org.svg
+++ /dev/null
@@ -1,130 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::operator+ Pages: 1 -->
-<svg width="415pt" height="148pt"
- viewBox="0.00 0.00 415.25 148.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 144.25)">
-<title>machine_learning::operator+</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="139,-78.25 0,-78.25 0,-59 139,-59 139,-78.25"/>
-<text text-anchor="middle" x="69.5" y="-64.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator+</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="393.75,-140.25 340.25,-140.25 340.25,-121 393.75,-121 393.75,-140.25"/>
-<text text-anchor="middle" x="367" y="-126.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.34,-78.68C108.64,-89.58 143.11,-106.51 175,-114.62 227.17,-127.9 289.67,-130.78 328.62,-131.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.39,-134.61 338.4,-131.14 328.41,-127.61 328.39,-134.61"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="392.62,-60.25 341.38,-60.25 341.38,-41 392.62,-41 392.62,-60.25"/>
-<text text-anchor="middle" x="367" y="-46.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.41,-64.43C198.87,-60.81 282.42,-55.72 329.68,-52.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.88,-56.33 339.65,-52.23 329.45,-49.34 329.88,-56.33"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="288.5,-105.88 177.25,-105.88 177.25,-75.38 288.5,-75.38 288.5,-105.88"/>
-<text text-anchor="start" x="185.25" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="232.88" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.41,-78.02C148.1,-79.2 156.99,-80.42 165.64,-81.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.97,-85.04 175.35,-82.92 165.91,-78.1 164.97,-85.04"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.75,-19.25 175,-19.25 175,0 290.75,0 290.75,-19.25"/>
-<text text-anchor="middle" x="232.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.88,-58.62C124.19,-49 164.19,-34.37 193.65,-23.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.75,-26.92 202.94,-20.2 192.35,-20.35 194.75,-26.92"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.72,-106.32C300.29,-110.73 315.83,-115.44 329.32,-119.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.07,-122.8 338.65,-122.35 330.09,-116.1 328.07,-122.8"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.72,-74.93C300.63,-70.42 316.55,-65.6 330.26,-61.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.17,-64.83 339.72,-58.58 329.14,-58.13 331.17,-64.83"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="407.25,-100.25 326.75,-100.25 326.75,-81 407.25,-81 407.25,-100.25"/>
-<text text-anchor="middle" x="367" y="-86.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge6_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge6_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M288.76,-90.62C297.44,-90.62 306.38,-90.62 314.96,-90.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.87,-94.13 324.87,-90.63 314.87,-87.13 314.87,-94.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_a50480fccfb39de20ca47f1bf51ecb6ec_cgraph.map b/d8/d77/namespacemachine__learning_a50480fccfb39de20ca47f1bf51ecb6ec_cgraph.map
deleted file mode 100644
index fbb9c97a1..000000000
--- a/d8/d77/namespacemachine__learning_a50480fccfb39de20ca47f1bf51ecb6ec_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="machine_learning::argmax" name="machine_learning::argmax">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,155,179,180"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="262,5,340,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="102,152,152,99,187,67,225,40,246,30,248,35,228,44,190,71,155,102,106,156"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/distance.html#" title=" " alt="" coords="253,55,349,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="113,152,163,121,226,89,239,84,241,89,228,94,166,126,115,156"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="267,104,335,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="147,151,251,126,252,131,149,157"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="441,159,512,184"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="179,166,426,168,426,174,179,171"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="442,265,511,291"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="109,179,159,218,192,238,228,254,279,268,333,276,427,278,427,284,332,281,278,273,226,259,190,243,156,222,106,183"/>
-<area shape="rect" id="Node000007" href="$d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" title=" " alt="" coords="227,204,375,245"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="142,178,212,198,211,203,141,184"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max_element.html#" title=" " alt="" coords="238,320,364,346"/>
-<area shape="poly" id="edge10_Node000001_Node000009" title=" " alt="" coords="106,179,155,235,190,269,228,299,250,311,247,316,225,303,187,273,151,239,102,183"/>
-<area shape="poly" id="edge7_Node000007_Node000005" title=" " alt="" coords="369,201,425,184,427,189,371,206"/>
-<area shape="poly" id="edge8_Node000007_Node000006" title=" " alt="" coords="371,243,428,261,427,266,369,248"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="423,212,530,238"/>
-<area shape="poly" id="edge9_Node000007_Node000008" title=" " alt="" coords="376,222,408,222,408,228,376,228"/>
-</map>
diff --git a/d8/d77/namespacemachine__learning_a50480fccfb39de20ca47f1bf51ecb6ec_cgraph.md5 b/d8/d77/namespacemachine__learning_a50480fccfb39de20ca47f1bf51ecb6ec_cgraph.md5
deleted file mode 100644
index 7f3b162a6..000000000
--- a/d8/d77/namespacemachine__learning_a50480fccfb39de20ca47f1bf51ecb6ec_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cc01112d7d15e496b113c29c21b5e410
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_a50480fccfb39de20ca47f1bf51ecb6ec_cgraph.svg b/d8/d77/namespacemachine__learning_a50480fccfb39de20ca47f1bf51ecb6ec_cgraph.svg
deleted file mode 100644
index 9b4c0f29d..000000000
--- a/d8/d77/namespacemachine__learning_a50480fccfb39de20ca47f1bf51ecb6ec_cgraph.svg
+++ /dev/null
@@ -1,210 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::argmax Pages: 1 -->
-<svg width="402pt" height="263pt"
- viewBox="0.00 0.00 401.75 263.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 259.25)">
-<title>machine_learning::argmax</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="130,-143.25 0,-143.25 0,-124 130,-124 130,-143.25"/>
-<text text-anchor="middle" x="65" y="-129.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::argmax</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251,-255.25 192.25,-255.25 192.25,-236 251,-236 251,-255.25"/>
-<text text-anchor="middle" x="221.62" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.01,-143.63C89.71,-162.63 126.47,-204.12 166,-227.62 170.69,-230.41 175.86,-232.83 181.1,-234.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.79,-238.16 190.39,-238.2 182.13,-231.56 179.79,-238.16"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257.75,-218.25 185.5,-218.25 185.5,-199 257.75,-199 257.75,-218.25"/>
-<text text-anchor="middle" x="221.62" y="-204.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.42,-143.71C100.65,-155.98 134.77,-176.75 166,-190.62 169.14,-192.02 172.42,-193.36 175.75,-194.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.41,-197.88 185,-198.01 176.79,-191.3 174.41,-197.88"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.25,-181.25 196,-181.25 196,-162 247.25,-162 247.25,-181.25"/>
-<text text-anchor="middle" x="221.62" y="-167.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.03,-143.71C131.22,-149.65 161.53,-157.1 184.76,-162.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.84,-166.19 194.39,-165.18 185.51,-159.39 183.84,-166.19"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="380.25,-140.25 326.75,-140.25 326.75,-121 380.25,-121 380.25,-140.25"/>
-<text text-anchor="middle" x="353.5" y="-126.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.3,-132.95C187.21,-132.36 268.3,-131.51 315.16,-131.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.1,-134.52 325.06,-130.91 315.03,-127.52 315.1,-134.52"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="379.12,-60.25 327.88,-60.25 327.88,-41 379.12,-41 379.12,-60.25"/>
-<text text-anchor="middle" x="353.5" y="-46.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.67,-123.73C93.93,-108.41 129.72,-79.37 166,-66.62 215.91,-49.09 277.75,-47.38 316.17,-48.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.9,-51.96 326.03,-48.83 316.16,-44.96 315.9,-51.96"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="277.25,-105.88 166,-105.88 166,-75.38 277.25,-75.38 277.25,-105.88"/>
-<text text-anchor="start" x="174" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="221.62" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.25,-123.54C117.85,-119.21 136.59,-113.99 154.51,-109.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.37,-112.41 164.06,-106.35 153.49,-105.66 155.37,-112.41"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="268.62,-19.25 174.62,-19.25 174.62,0 268.62,0 268.62,-19.25"/>
-<text text-anchor="middle" x="221.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge10_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge10_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.84,-123.6C89.53,-104.07 126.68,-60.51 166,-33.62 171.02,-30.19 176.62,-27.07 182.26,-24.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.32,-27.66 190.97,-20.32 180.42,-21.29 183.32,-27.66"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge7_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge7_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M273.58,-106.32C287.54,-110.62 302.41,-115.2 315.43,-119.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.3,-122.52 324.88,-122.12 316.36,-115.83 314.3,-122.52"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge8_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge8_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M273.58,-74.93C288.02,-70.48 303.42,-65.74 316.75,-61.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.42,-65.09 325.95,-58.8 315.36,-58.4 317.42,-65.09"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="393.75,-100.25 313.25,-100.25 313.25,-81 393.75,-81 393.75,-100.25"/>
-<text text-anchor="middle" x="353.5" y="-86.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge9_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M277.7,-90.62C285.69,-90.62 293.89,-90.62 301.78,-90.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="301.57,-94.13 311.57,-90.63 301.57,-87.13 301.57,-94.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_a50480fccfb39de20ca47f1bf51ecb6ec_cgraph_org.svg b/d8/d77/namespacemachine__learning_a50480fccfb39de20ca47f1bf51ecb6ec_cgraph_org.svg
deleted file mode 100644
index 737fe96dc..000000000
--- a/d8/d77/namespacemachine__learning_a50480fccfb39de20ca47f1bf51ecb6ec_cgraph_org.svg
+++ /dev/null
@@ -1,184 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::argmax Pages: 1 -->
-<svg width="402pt" height="263pt"
- viewBox="0.00 0.00 401.75 263.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 259.25)">
-<title>machine_learning::argmax</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="130,-143.25 0,-143.25 0,-124 130,-124 130,-143.25"/>
-<text text-anchor="middle" x="65" y="-129.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::argmax</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251,-255.25 192.25,-255.25 192.25,-236 251,-236 251,-255.25"/>
-<text text-anchor="middle" x="221.62" y="-241.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.01,-143.63C89.71,-162.63 126.47,-204.12 166,-227.62 170.69,-230.41 175.86,-232.83 181.1,-234.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.79,-238.16 190.39,-238.2 182.13,-231.56 179.79,-238.16"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257.75,-218.25 185.5,-218.25 185.5,-199 257.75,-199 257.75,-218.25"/>
-<text text-anchor="middle" x="221.62" y="-204.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.42,-143.71C100.65,-155.98 134.77,-176.75 166,-190.62 169.14,-192.02 172.42,-193.36 175.75,-194.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.41,-197.88 185,-198.01 176.79,-191.3 174.41,-197.88"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.25,-181.25 196,-181.25 196,-162 247.25,-162 247.25,-181.25"/>
-<text text-anchor="middle" x="221.62" y="-167.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.03,-143.71C131.22,-149.65 161.53,-157.1 184.76,-162.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.84,-166.19 194.39,-165.18 185.51,-159.39 183.84,-166.19"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="380.25,-140.25 326.75,-140.25 326.75,-121 380.25,-121 380.25,-140.25"/>
-<text text-anchor="middle" x="353.5" y="-126.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.3,-132.95C187.21,-132.36 268.3,-131.51 315.16,-131.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.1,-134.52 325.06,-130.91 315.03,-127.52 315.1,-134.52"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="379.12,-60.25 327.88,-60.25 327.88,-41 379.12,-41 379.12,-60.25"/>
-<text text-anchor="middle" x="353.5" y="-46.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.67,-123.73C93.93,-108.41 129.72,-79.37 166,-66.62 215.91,-49.09 277.75,-47.38 316.17,-48.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.9,-51.96 326.03,-48.83 316.16,-44.96 315.9,-51.96"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="277.25,-105.88 166,-105.88 166,-75.38 277.25,-75.38 277.25,-105.88"/>
-<text text-anchor="start" x="174" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="221.62" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.25,-123.54C117.85,-119.21 136.59,-113.99 154.51,-109.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.37,-112.41 164.06,-106.35 153.49,-105.66 155.37,-112.41"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="268.62,-19.25 174.62,-19.25 174.62,0 268.62,0 268.62,-19.25"/>
-<text text-anchor="middle" x="221.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge10_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge10_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.84,-123.6C89.53,-104.07 126.68,-60.51 166,-33.62 171.02,-30.19 176.62,-27.07 182.26,-24.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.32,-27.66 190.97,-20.32 180.42,-21.29 183.32,-27.66"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge7_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge7_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M273.58,-106.32C287.54,-110.62 302.41,-115.2 315.43,-119.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.3,-122.52 324.88,-122.12 316.36,-115.83 314.3,-122.52"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge8_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge8_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M273.58,-74.93C288.02,-70.48 303.42,-65.74 316.75,-61.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.42,-65.09 325.95,-58.8 315.36,-58.4 317.42,-65.09"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="393.75,-100.25 313.25,-100.25 313.25,-81 393.75,-81 393.75,-100.25"/>
-<text text-anchor="middle" x="353.5" y="-86.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge9_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M277.7,-90.62C285.69,-90.62 293.89,-90.62 301.78,-90.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="301.57,-94.13 311.57,-90.63 301.57,-87.13 301.57,-94.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_a5342906d42b80fc6b6b3ad17bf00fcb9_cgraph.map b/d8/d77/namespacemachine__learning_a5342906d42b80fc6b6b3ad17bf00fcb9_cgraph.map
deleted file mode 100644
index e1177be47..000000000
--- a/d8/d77/namespacemachine__learning_a5342906d42b80fc6b6b3ad17bf00fcb9_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="machine_learning::multiply" name="machine_learning::multiply">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,88,181,114"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="449,5,520,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="116,85,166,60,228,37,282,26,337,19,433,15,434,20,338,24,283,31,229,42,168,64,118,90"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="450,112,519,138"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="181,104,435,119,435,125,181,109"/>
-<area shape="rect" id="Node000004" href="$d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" title=" " alt="" coords="232,51,380,92"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="181,86,216,81,217,86,181,91"/>
-<area shape="rect" id="Node000006" 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="229,167,383,192"/>
-<area shape="poly" id="edge7_Node000001_Node000006" title=" " alt="" coords="131,112,256,158,254,163,129,117"/>
-<area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="376,48,434,30,435,36,377,53"/>
-<area shape="poly" id="edge5_Node000004_Node000003" title=" " alt="" coords="377,90,436,108,435,113,376,95"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="431,59,538,84"/>
-<area shape="poly" id="edge6_Node000004_Node000005" title=" " alt="" coords="380,69,415,69,415,74,380,74"/>
-</map>
diff --git a/d8/d77/namespacemachine__learning_a5342906d42b80fc6b6b3ad17bf00fcb9_cgraph.md5 b/d8/d77/namespacemachine__learning_a5342906d42b80fc6b6b3ad17bf00fcb9_cgraph.md5
deleted file mode 100644
index 30ff82dd9..000000000
--- a/d8/d77/namespacemachine__learning_a5342906d42b80fc6b6b3ad17bf00fcb9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2c193a9d0cd44a157dbaa0205d7ecaca
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_a5342906d42b80fc6b6b3ad17bf00fcb9_cgraph.svg b/d8/d77/namespacemachine__learning_a5342906d42b80fc6b6b3ad17bf00fcb9_cgraph.svg
deleted file mode 100644
index 920728d7f..000000000
--- a/d8/d77/namespacemachine__learning_a5342906d42b80fc6b6b3ad17bf00fcb9_cgraph.svg
+++ /dev/null
@@ -1,156 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::multiply Pages: 1 -->
-<svg width="408pt" height="148pt"
- viewBox="0.00 0.00 407.75 148.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 144.25)">
-<title>machine_learning::multiply</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="131.5,-78.25 0,-78.25 0,-59 131.5,-59 131.5,-78.25"/>
-<text text-anchor="middle" x="65.75" y="-64.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="386.25,-140.25 332.75,-140.25 332.75,-121 386.25,-121 386.25,-140.25"/>
-<text text-anchor="middle" x="359.5" y="-126.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.9,-78.69C103.43,-89.6 136.62,-106.54 167.5,-114.62 219.58,-128.25 282.1,-131.05 321.08,-131.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.87,-134.76 330.87,-131.25 320.87,-127.76 320.87,-134.76"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385.12,-60.25 333.88,-60.25 333.88,-41 385.12,-41 385.12,-60.25"/>
-<text text-anchor="middle" x="359.5" y="-46.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.86,-64.61C190.54,-60.99 274.67,-55.8 322.2,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.17,-56.37 331.94,-52.26 321.74,-49.39 322.17,-56.37"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="281,-105.88 169.75,-105.88 169.75,-75.38 281,-75.38 281,-105.88"/>
-<text text-anchor="start" x="177.75" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="225.38" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.77,-77.7C140.5,-78.92 149.46,-80.17 158.21,-81.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.66,-84.85 168.04,-82.76 158.62,-77.91 157.66,-84.85"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.25,-19.25 167.5,-19.25 167.5,0 283.25,0 283.25,-19.25"/>
-<text text-anchor="middle" x="225.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.49,-58.62C119.19,-49 158.27,-34.37 187.03,-23.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.95,-27 196.09,-20.21 185.5,-20.44 187.95,-27"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.22,-106.32C292.79,-110.73 308.33,-115.44 321.82,-119.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.57,-122.8 331.15,-122.35 322.59,-116.1 320.57,-122.8"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.22,-74.93C293.13,-70.42 309.05,-65.6 322.76,-61.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="323.67,-64.83 332.22,-58.58 321.64,-58.13 323.67,-64.83"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="399.75,-100.25 319.25,-100.25 319.25,-81 399.75,-81 399.75,-100.25"/>
-<text text-anchor="middle" x="359.5" y="-86.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge6_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge6_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M281.26,-90.62C289.94,-90.62 298.88,-90.62 307.46,-90.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.37,-94.13 317.37,-90.63 307.37,-87.13 307.37,-94.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_a5342906d42b80fc6b6b3ad17bf00fcb9_cgraph_org.svg b/d8/d77/namespacemachine__learning_a5342906d42b80fc6b6b3ad17bf00fcb9_cgraph_org.svg
deleted file mode 100644
index 075c9553f..000000000
--- a/d8/d77/namespacemachine__learning_a5342906d42b80fc6b6b3ad17bf00fcb9_cgraph_org.svg
+++ /dev/null
@@ -1,130 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::multiply Pages: 1 -->
-<svg width="408pt" height="148pt"
- viewBox="0.00 0.00 407.75 148.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 144.25)">
-<title>machine_learning::multiply</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="131.5,-78.25 0,-78.25 0,-59 131.5,-59 131.5,-78.25"/>
-<text text-anchor="middle" x="65.75" y="-64.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="386.25,-140.25 332.75,-140.25 332.75,-121 386.25,-121 386.25,-140.25"/>
-<text text-anchor="middle" x="359.5" y="-126.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.9,-78.69C103.43,-89.6 136.62,-106.54 167.5,-114.62 219.58,-128.25 282.1,-131.05 321.08,-131.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.87,-134.76 330.87,-131.25 320.87,-127.76 320.87,-134.76"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385.12,-60.25 333.88,-60.25 333.88,-41 385.12,-41 385.12,-60.25"/>
-<text text-anchor="middle" x="359.5" y="-46.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.86,-64.61C190.54,-60.99 274.67,-55.8 322.2,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.17,-56.37 331.94,-52.26 321.74,-49.39 322.17,-56.37"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="281,-105.88 169.75,-105.88 169.75,-75.38 281,-75.38 281,-105.88"/>
-<text text-anchor="start" x="177.75" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="225.38" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.77,-77.7C140.5,-78.92 149.46,-80.17 158.21,-81.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.66,-84.85 168.04,-82.76 158.62,-77.91 157.66,-84.85"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.25,-19.25 167.5,-19.25 167.5,0 283.25,0 283.25,-19.25"/>
-<text text-anchor="middle" x="225.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.49,-58.62C119.19,-49 158.27,-34.37 187.03,-23.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.95,-27 196.09,-20.21 185.5,-20.44 187.95,-27"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.22,-106.32C292.79,-110.73 308.33,-115.44 321.82,-119.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.57,-122.8 331.15,-122.35 322.59,-116.1 320.57,-122.8"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.22,-74.93C293.13,-70.42 309.05,-65.6 322.76,-61.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="323.67,-64.83 332.22,-58.58 321.64,-58.13 323.67,-64.83"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="399.75,-100.25 319.25,-100.25 319.25,-81 399.75,-81 399.75,-100.25"/>
-<text text-anchor="middle" x="359.5" y="-86.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge6_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge6_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M281.26,-90.62C289.94,-90.62 298.88,-90.62 307.46,-90.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.37,-94.13 317.37,-90.63 307.37,-87.13 307.37,-94.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.map b/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.map
deleted file mode 100644
index 0f6fa6bf6..000000000
--- a/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="machine_learning::operator&lt;&lt;" name="machine_learning::operator&lt;&lt;">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,199,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="288,5,360,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="199,30,272,21,273,27,199,35"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/ios_base/precision.html#" title=" " alt="" coords="247,55,401,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="199,51,231,55,231,60,199,57"/>
-</map>
diff --git a/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.md5 b/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.md5
deleted file mode 100644
index f958f89d5..000000000
--- a/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5037bc766a84951d786a77f5d204d721
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.svg b/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.svg
deleted file mode 100644
index 00a8bcc40..000000000
--- a/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::operator&lt;&lt; Pages: 1 -->
-<svg width="305pt" height="64pt"
- viewBox="0.00 0.00 304.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>machine_learning::operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="145,-37.25 0,-37.25 0,-18 145,-18 145,-37.25"/>
-<text text-anchor="middle" x="72.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="265.62,-56.25 212.12,-56.25 212.12,-37 265.62,-37 265.62,-56.25"/>
-<text text-anchor="middle" x="238.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.12,-35.9C164.19,-38.11 184.04,-40.4 200.46,-42.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="199.91,-45.76 210.24,-43.43 200.71,-38.81 199.91,-45.76"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.75,-19.25 181,-19.25 181,0 296.75,0 296.75,-19.25"/>
-<text text-anchor="middle" x="238.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.12,-19.78C153.18,-18.9 161.37,-18 169.38,-17.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.5,-20.63 179.06,-16.07 168.74,-13.68 169.5,-20.63"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph_org.svg b/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph_org.svg
deleted file mode 100644
index 3026822e9..000000000
--- a/d8/d77/namespacemachine__learning_a54bf1f3c43271a5fc93101f6ae2e6269_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::operator&lt;&lt; Pages: 1 -->
-<svg width="305pt" height="64pt"
- viewBox="0.00 0.00 304.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>machine_learning::operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="145,-37.25 0,-37.25 0,-18 145,-18 145,-37.25"/>
-<text text-anchor="middle" x="72.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="265.62,-56.25 212.12,-56.25 212.12,-37 265.62,-37 265.62,-56.25"/>
-<text text-anchor="middle" x="238.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.12,-35.9C164.19,-38.11 184.04,-40.4 200.46,-42.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="199.91,-45.76 210.24,-43.43 200.71,-38.81 199.91,-45.76"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.75,-19.25 181,-19.25 181,0 296.75,0 296.75,-19.25"/>
-<text text-anchor="middle" x="238.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.12,-19.78C153.18,-18.9 161.37,-18 169.38,-17.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.5,-20.63 179.06,-16.07 168.74,-13.68 169.5,-20.63"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.map b/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.map
deleted file mode 100644
index 0f6fa6bf6..000000000
--- a/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="machine_learning::operator&lt;&lt;" name="machine_learning::operator&lt;&lt;">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,199,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="288,5,360,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="199,30,272,21,273,27,199,35"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/ios_base/precision.html#" title=" " alt="" coords="247,55,401,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="199,51,231,55,231,60,199,57"/>
-</map>
diff --git a/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.md5 b/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.md5
deleted file mode 100644
index f958f89d5..000000000
--- a/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5037bc766a84951d786a77f5d204d721
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.svg b/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.svg
deleted file mode 100644
index 00a8bcc40..000000000
--- a/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::operator&lt;&lt; Pages: 1 -->
-<svg width="305pt" height="64pt"
- viewBox="0.00 0.00 304.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>machine_learning::operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="145,-37.25 0,-37.25 0,-18 145,-18 145,-37.25"/>
-<text text-anchor="middle" x="72.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="265.62,-56.25 212.12,-56.25 212.12,-37 265.62,-37 265.62,-56.25"/>
-<text text-anchor="middle" x="238.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.12,-35.9C164.19,-38.11 184.04,-40.4 200.46,-42.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="199.91,-45.76 210.24,-43.43 200.71,-38.81 199.91,-45.76"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.75,-19.25 181,-19.25 181,0 296.75,0 296.75,-19.25"/>
-<text text-anchor="middle" x="238.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.12,-19.78C153.18,-18.9 161.37,-18 169.38,-17.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.5,-20.63 179.06,-16.07 168.74,-13.68 169.5,-20.63"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph_org.svg b/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph_org.svg
deleted file mode 100644
index 3026822e9..000000000
--- a/d8/d77/namespacemachine__learning_a84260cb1be9b63d6e38107000ac4b7e7_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::operator&lt;&lt; Pages: 1 -->
-<svg width="305pt" height="64pt"
- viewBox="0.00 0.00 304.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>machine_learning::operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="145,-37.25 0,-37.25 0,-18 145,-18 145,-37.25"/>
-<text text-anchor="middle" x="72.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="265.62,-56.25 212.12,-56.25 212.12,-37 265.62,-37 265.62,-56.25"/>
-<text text-anchor="middle" x="238.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.12,-35.9C164.19,-38.11 184.04,-40.4 200.46,-42.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="199.91,-45.76 210.24,-43.43 200.71,-38.81 199.91,-45.76"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.75,-19.25 181,-19.25 181,0 296.75,0 296.75,-19.25"/>
-<text text-anchor="middle" x="238.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.12,-19.78C153.18,-18.9 161.37,-18 169.38,-17.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.5,-20.63 179.06,-16.07 168.74,-13.68 169.5,-20.63"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_a89fde571b38f9483576594f66572958a_cgraph.map b/d8/d77/namespacemachine__learning_a89fde571b38f9483576594f66572958a_cgraph.map
deleted file mode 100644
index 3428c3383..000000000
--- a/d8/d77/namespacemachine__learning_a89fde571b38f9483576594f66572958a_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="machine_learning::transpose" name="machine_learning::transpose">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,84,193,110"/>
-<area shape="rect" id="Node000002" href="$d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" title=" " alt="" coords="244,47,392,88"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="193,82,228,77,229,82,194,87"/>
-<area shape="rect" id="Node000006" 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="241,112,395,138"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="194,106,226,110,225,116,193,112"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="461,5,532,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="392,44,445,29,447,35,393,50"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="462,55,531,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="392,65,447,65,447,70,392,70"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="443,104,550,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="393,85,434,97,432,102,392,91"/>
-</map>
diff --git a/d8/d77/namespacemachine__learning_a89fde571b38f9483576594f66572958a_cgraph.md5 b/d8/d77/namespacemachine__learning_a89fde571b38f9483576594f66572958a_cgraph.md5
deleted file mode 100644
index 44141fbb9..000000000
--- a/d8/d77/namespacemachine__learning_a89fde571b38f9483576594f66572958a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6b1ef74efb35731f28bb16be1b0c4d95
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_a89fde571b38f9483576594f66572958a_cgraph.svg b/d8/d77/namespacemachine__learning_a89fde571b38f9483576594f66572958a_cgraph.svg
deleted file mode 100644
index ec39169c2..000000000
--- a/d8/d77/namespacemachine__learning_a89fde571b38f9483576594f66572958a_cgraph.svg
+++ /dev/null
@@ -1,138 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::transpose Pages: 1 -->
-<svg width="417pt" height="107pt"
- viewBox="0.00 0.00 416.75 107.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 103.25)">
-<title>machine_learning::transpose</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="140.5,-40.25 0,-40.25 0,-21 140.5,-21 140.5,-40.25"/>
-<text text-anchor="middle" x="70.25" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::transpose</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290,-67.88 178.75,-67.88 178.75,-37.38 290,-37.38 290,-67.88"/>
-<text text-anchor="start" x="186.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="234.38" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.95,-40.08C149.66,-41.26 158.55,-42.47 167.21,-43.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.54,-47.09 176.92,-44.96 167.48,-40.15 166.54,-47.09"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.25,-19.25 176.5,-19.25 176.5,0 292.25,0 292.25,-19.25"/>
-<text text-anchor="middle" x="234.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.95,-21.6C149,-20.55 157.2,-19.49 165.23,-18.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.46,-21.95 174.93,-17.2 164.56,-15.01 165.46,-21.95"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="395.25,-99.25 341.75,-99.25 341.75,-80 395.25,-80 395.25,-99.25"/>
-<text text-anchor="middle" x="368.5" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.26,-67.99C303.83,-71.8 318.05,-75.78 330.54,-79.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.42,-82.59 339.99,-81.92 331.3,-75.85 329.42,-82.59"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="394.12,-62.25 342.88,-62.25 342.88,-43 394.12,-43 394.12,-62.25"/>
-<text text-anchor="middle" x="368.5" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.26,-52.62C304.01,-52.62 318.44,-52.62 331.04,-52.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="330.98,-56.13 340.98,-52.63 330.98,-49.13 330.98,-56.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408.75,-25.25 328.25,-25.25 328.25,-6 408.75,-6 408.75,-25.25"/>
-<text text-anchor="middle" x="368.5" y="-11.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.26,-37.26C300.36,-34.43 310.81,-31.5 320.65,-28.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="321.29,-32.2 329.97,-26.13 319.4,-25.46 321.29,-32.2"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_a89fde571b38f9483576594f66572958a_cgraph_org.svg b/d8/d77/namespacemachine__learning_a89fde571b38f9483576594f66572958a_cgraph_org.svg
deleted file mode 100644
index 4e7d13395..000000000
--- a/d8/d77/namespacemachine__learning_a89fde571b38f9483576594f66572958a_cgraph_org.svg
+++ /dev/null
@@ -1,112 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::transpose Pages: 1 -->
-<svg width="417pt" height="107pt"
- viewBox="0.00 0.00 416.75 107.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 103.25)">
-<title>machine_learning::transpose</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="140.5,-40.25 0,-40.25 0,-21 140.5,-21 140.5,-40.25"/>
-<text text-anchor="middle" x="70.25" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::transpose</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290,-67.88 178.75,-67.88 178.75,-37.38 290,-37.38 290,-67.88"/>
-<text text-anchor="start" x="186.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="234.38" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.95,-40.08C149.66,-41.26 158.55,-42.47 167.21,-43.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.54,-47.09 176.92,-44.96 167.48,-40.15 166.54,-47.09"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.25,-19.25 176.5,-19.25 176.5,0 292.25,0 292.25,-19.25"/>
-<text text-anchor="middle" x="234.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.95,-21.6C149,-20.55 157.2,-19.49 165.23,-18.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.46,-21.95 174.93,-17.2 164.56,-15.01 165.46,-21.95"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="395.25,-99.25 341.75,-99.25 341.75,-80 395.25,-80 395.25,-99.25"/>
-<text text-anchor="middle" x="368.5" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.26,-67.99C303.83,-71.8 318.05,-75.78 330.54,-79.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.42,-82.59 339.99,-81.92 331.3,-75.85 329.42,-82.59"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="394.12,-62.25 342.88,-62.25 342.88,-43 394.12,-43 394.12,-62.25"/>
-<text text-anchor="middle" x="368.5" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.26,-52.62C304.01,-52.62 318.44,-52.62 331.04,-52.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="330.98,-56.13 340.98,-52.63 330.98,-49.13 330.98,-56.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408.75,-25.25 328.25,-25.25 328.25,-6 408.75,-6 408.75,-25.25"/>
-<text text-anchor="middle" x="368.5" y="-11.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.26,-37.26C300.36,-34.43 310.81,-31.5 320.65,-28.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="321.29,-32.2 329.97,-26.13 319.4,-25.46 321.29,-32.2"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_aa4bbf61e65f8cd297255fa94b983d078_cgraph.map b/d8/d77/namespacemachine__learning_aa4bbf61e65f8cd297255fa94b983d078_cgraph.map
deleted file mode 100644
index 1dcda80b1..000000000
--- a/d8/d77/namespacemachine__learning_aa4bbf61e65f8cd297255fa94b983d078_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="machine_learning::get_shape" name="machine_learning::get_shape">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,47,154,88"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="220,5,291,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="154,44,204,30,205,35,155,49"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="221,55,290,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="154,65,206,65,206,70,154,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="202,104,309,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="155,86,193,97,192,102,154,91"/>
-</map>
diff --git a/d8/d77/namespacemachine__learning_aa4bbf61e65f8cd297255fa94b983d078_cgraph.md5 b/d8/d77/namespacemachine__learning_aa4bbf61e65f8cd297255fa94b983d078_cgraph.md5
deleted file mode 100644
index 5c473caaa..000000000
--- a/d8/d77/namespacemachine__learning_aa4bbf61e65f8cd297255fa94b983d078_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f38dbca57ad86d19aeaeeb0601eee6bf
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_aa4bbf61e65f8cd297255fa94b983d078_cgraph.svg b/d8/d77/namespacemachine__learning_aa4bbf61e65f8cd297255fa94b983d078_cgraph.svg
deleted file mode 100644
index bb33a07b6..000000000
--- a/d8/d77/namespacemachine__learning_aa4bbf61e65f8cd297255fa94b983d078_cgraph.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::get_shape Pages: 1 -->
-<svg width="236pt" height="101pt"
- viewBox="0.00 0.00 235.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>machine_learning::get_shape</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="111.25,-61.88 0,-61.88 0,-31.38 111.25,-31.38 111.25,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="55.62" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.25,-93.25 160.75,-93.25 160.75,-74 214.25,-74 214.25,-93.25"/>
-<text text-anchor="middle" x="187.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.7,-62.32C124.49,-65.96 137.79,-69.75 149.58,-73.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.31,-76.38 158.88,-75.76 150.23,-69.65 148.31,-76.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="213.12,-56.25 161.88,-56.25 161.88,-37 213.12,-37 213.12,-56.25"/>
-<text text-anchor="middle" x="187.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.7,-46.62C124.77,-46.62 138.38,-46.62 150.36,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.19,-50.13 160.19,-46.63 150.19,-43.13 150.19,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.75,-19.25 147.25,-19.25 147.25,0 227.75,0 227.75,-19.25"/>
-<text text-anchor="middle" x="187.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.7,-30.93C121.24,-28.22 131.06,-25.42 140.33,-22.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.19,-26.17 149.85,-20.07 139.27,-19.44 141.19,-26.17"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_aa4bbf61e65f8cd297255fa94b983d078_cgraph_org.svg b/d8/d77/namespacemachine__learning_aa4bbf61e65f8cd297255fa94b983d078_cgraph_org.svg
deleted file mode 100644
index 995cafa2e..000000000
--- a/d8/d77/namespacemachine__learning_aa4bbf61e65f8cd297255fa94b983d078_cgraph_org.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::get_shape Pages: 1 -->
-<svg width="236pt" height="101pt"
- viewBox="0.00 0.00 235.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>machine_learning::get_shape</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="111.25,-61.88 0,-61.88 0,-31.38 111.25,-31.38 111.25,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="55.62" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.25,-93.25 160.75,-93.25 160.75,-74 214.25,-74 214.25,-93.25"/>
-<text text-anchor="middle" x="187.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.7,-62.32C124.49,-65.96 137.79,-69.75 149.58,-73.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.31,-76.38 158.88,-75.76 150.23,-69.65 148.31,-76.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="213.12,-56.25 161.88,-56.25 161.88,-37 213.12,-37 213.12,-56.25"/>
-<text text-anchor="middle" x="187.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.7,-46.62C124.77,-46.62 138.38,-46.62 150.36,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.19,-50.13 160.19,-46.63 150.19,-43.13 150.19,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.75,-19.25 147.25,-19.25 147.25,0 227.75,0 227.75,-19.25"/>
-<text text-anchor="middle" x="187.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.7,-30.93C121.24,-28.22 131.06,-25.42 140.33,-22.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.19,-26.17 149.85,-20.07 139.27,-19.44 141.19,-26.17"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph.map b/d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph.map
deleted file mode 100644
index 4c4adafa6..000000000
--- a/d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="machine_learning::update_weights" name="machine_learning::update_weights">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,146,175,186"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="261,5,340,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="106,144,154,92,186,64,221,40,245,29,247,34,224,44,190,68,158,96,110,147"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/distance.html#" title=" " alt="" coords="252,55,348,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="122,143,168,116,222,89,236,83,238,88,224,94,171,121,125,148"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="266,104,334,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="175,144,250,126,252,131,176,149"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="264,153,336,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="175,164,248,164,248,169,175,169"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="266,203,334,228"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="176,183,252,202,250,207,175,189"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min_element.html#" title=" " alt="" coords="240,252,361,278"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="125,185,171,212,224,238,238,244,236,249,222,243,168,217,122,189"/>
-<area shape="rect" id="Node000008" href="$d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" title=" " alt="" coords="223,301,378,327"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="110,185,158,236,190,264,224,288,233,293,230,297,221,292,186,268,154,240,106,189"/>
-</map>
diff --git a/d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph.md5 b/d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph.md5
deleted file mode 100644
index da2dccc50..000000000
--- a/d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3709bc64978373ca8cd8d9a4c6557055
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph.svg b/d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph.svg
deleted file mode 100644
index f5bbbdf19..000000000
--- a/d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph.svg
+++ /dev/null
@@ -1,174 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::update_weights Pages: 1 -->
-<svg width="288pt" height="249pt"
- viewBox="0.00 0.00 287.50 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
-<title>machine_learning::update_weights</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-135.88 0,-135.88 0,-105.38 127,-105.38 127,-135.88"/>
-<text text-anchor="start" x="8" y="-122.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::update</text>
-<text text-anchor="middle" x="63.5" y="-111.12" font-family="Helvetica,sans-Serif" font-size="10.00">_weights</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="250.62,-241.25 191.88,-241.25 191.88,-222 250.62,-222 250.62,-241.25"/>
-<text text-anchor="middle" x="221.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.89,-136.06C94.13,-156.58 127.3,-192.68 163,-213.62 168.45,-216.82 174.53,-219.51 180.63,-221.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.49,-225.07 190.08,-224.87 181.67,-218.42 179.49,-225.07"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257.38,-204.25 185.12,-204.25 185.12,-185 257.38,-185 257.38,-204.25"/>
-<text text-anchor="middle" x="221.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.45,-136.16C107.95,-148.33 136.49,-165.08 163,-176.62 166.55,-178.17 170.27,-179.64 174.04,-181.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.67,-184.27 183.27,-184.24 174.97,-177.66 172.67,-184.27"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.88,-167.25 195.62,-167.25 195.62,-148 246.88,-148 246.88,-167.25"/>
-<text text-anchor="middle" x="221.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.4,-135.57C146.74,-140.16 167.37,-145.06 184.26,-149.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.28,-152.44 193.81,-151.34 184.89,-145.63 183.28,-152.44"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.38,-130.25 194.12,-130.25 194.12,-111 248.38,-111 248.38,-130.25"/>
-<text text-anchor="middle" x="221.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.4,-120.62C146.02,-120.62 165.82,-120.62 182.33,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.2,-124.13 192.2,-120.63 182.2,-117.13 182.2,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.88,-93.25 195.62,-93.25 195.62,-74 246.88,-74 246.88,-93.25"/>
-<text text-anchor="middle" x="221.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.4,-105.68C146.74,-101.09 167.37,-96.19 184.26,-92.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.89,-95.62 193.81,-89.91 183.28,-88.81 184.89,-95.62"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.75,-56.25 175.75,-56.25 175.75,-37 266.75,-37 266.75,-56.25"/>
-<text text-anchor="middle" x="221.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.45,-105.09C107.95,-92.92 136.49,-76.17 163,-64.62 166.34,-63.17 169.84,-61.77 173.39,-60.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.38,-63.82 182.66,-57.21 172.07,-57.21 174.38,-63.82"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279.5,-19.25 163,-19.25 163,0 279.5,0 279.5,-19.25"/>
-<text text-anchor="middle" x="221.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.89,-105.19C94.13,-84.67 127.3,-48.57 163,-27.62 165.15,-26.36 167.41,-25.18 169.72,-24.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.89,-27.37 178.75,-20.26 168.17,-20.92 170.89,-27.37"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph_org.svg b/d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph_org.svg
deleted file mode 100644
index c1ad69052..000000000
--- a/d8/d77/namespacemachine__learning_aa6aac06ccf128b0a9c55c9ee1a8e5631_cgraph_org.svg
+++ /dev/null
@@ -1,148 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::update_weights Pages: 1 -->
-<svg width="288pt" height="249pt"
- viewBox="0.00 0.00 287.50 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
-<title>machine_learning::update_weights</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-135.88 0,-135.88 0,-105.38 127,-105.38 127,-135.88"/>
-<text text-anchor="start" x="8" y="-122.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::update</text>
-<text text-anchor="middle" x="63.5" y="-111.12" font-family="Helvetica,sans-Serif" font-size="10.00">_weights</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="250.62,-241.25 191.88,-241.25 191.88,-222 250.62,-222 250.62,-241.25"/>
-<text text-anchor="middle" x="221.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.89,-136.06C94.13,-156.58 127.3,-192.68 163,-213.62 168.45,-216.82 174.53,-219.51 180.63,-221.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.49,-225.07 190.08,-224.87 181.67,-218.42 179.49,-225.07"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257.38,-204.25 185.12,-204.25 185.12,-185 257.38,-185 257.38,-204.25"/>
-<text text-anchor="middle" x="221.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.45,-136.16C107.95,-148.33 136.49,-165.08 163,-176.62 166.55,-178.17 170.27,-179.64 174.04,-181.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.67,-184.27 183.27,-184.24 174.97,-177.66 172.67,-184.27"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.88,-167.25 195.62,-167.25 195.62,-148 246.88,-148 246.88,-167.25"/>
-<text text-anchor="middle" x="221.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.4,-135.57C146.74,-140.16 167.37,-145.06 184.26,-149.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.28,-152.44 193.81,-151.34 184.89,-145.63 183.28,-152.44"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.38,-130.25 194.12,-130.25 194.12,-111 248.38,-111 248.38,-130.25"/>
-<text text-anchor="middle" x="221.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.4,-120.62C146.02,-120.62 165.82,-120.62 182.33,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.2,-124.13 192.2,-120.63 182.2,-117.13 182.2,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.88,-93.25 195.62,-93.25 195.62,-74 246.88,-74 246.88,-93.25"/>
-<text text-anchor="middle" x="221.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.4,-105.68C146.74,-101.09 167.37,-96.19 184.26,-92.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.89,-95.62 193.81,-89.91 183.28,-88.81 184.89,-95.62"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.75,-56.25 175.75,-56.25 175.75,-37 266.75,-37 266.75,-56.25"/>
-<text text-anchor="middle" x="221.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.45,-105.09C107.95,-92.92 136.49,-76.17 163,-64.62 166.34,-63.17 169.84,-61.77 173.39,-60.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.38,-63.82 182.66,-57.21 172.07,-57.21 174.38,-63.82"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279.5,-19.25 163,-19.25 163,0 279.5,0 279.5,-19.25"/>
-<text text-anchor="middle" x="221.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.89,-105.19C94.13,-84.67 127.3,-48.57 163,-27.62 165.15,-26.36 167.41,-25.18 169.72,-24.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.89,-27.37 178.75,-20.26 168.17,-20.92 170.89,-27.37"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.map b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.map
deleted file mode 100644
index e0ac47463..000000000
--- a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="machine_learning::save_u_matrix" name="machine_learning::save_u_matrix">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,146,164,186"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="212,5,349,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="100,144,146,92,177,64,210,40,218,35,221,40,213,44,180,69,150,96,104,147"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="245,55,316,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="116,143,160,116,211,89,229,81,231,86,213,94,162,121,118,148"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="244,104,316,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="163,144,228,127,230,132,165,149"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="246,153,314,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="164,164,230,164,230,169,164,169"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="245,203,316,228"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="165,184,230,200,229,205,163,189"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="246,252,315,278"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="118,185,162,212,213,238,232,247,230,251,211,243,160,216,116,189"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/strerror.html#" title=" " alt="" coords="236,301,324,327"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="104,185,150,236,180,264,213,288,223,293,221,298,210,292,177,268,146,240,100,189"/>
-</map>
diff --git a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.md5 b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.md5
deleted file mode 100644
index 8b62c9763..000000000
--- a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fb4b98105ab650a59ab2527c12036106
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.svg b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.svg
deleted file mode 100644
index c99cf8b50..000000000
--- a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph.svg
+++ /dev/null
@@ -1,174 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::save_u_matrix Pages: 1 -->
-<svg width="266pt" height="249pt"
- viewBox="0.00 0.00 265.75 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
-<title>machine_learning::save_u_matrix</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="118.75,-135.88 0,-135.88 0,-105.38 118.75,-105.38 118.75,-135.88"/>
-<text text-anchor="start" x="8" y="-122.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::save</text>
-<text text-anchor="middle" x="59.38" y="-111.12" font-family="Helvetica,sans-Serif" font-size="10.00">_u_matrix</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257.75,-241.25 154.75,-241.25 154.75,-222 257.75,-222 257.75,-241.25"/>
-<text text-anchor="middle" x="206.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.5,-136.24C89.07,-156.63 120.65,-192.23 154.75,-213.62 156.58,-214.77 158.5,-215.86 160.47,-216.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.7,-219.93 169.25,-220.93 161.63,-213.57 158.7,-219.93"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-204.25 179.5,-204.25 179.5,-185 233,-185 233,-204.25"/>
-<text text-anchor="middle" x="206.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.73,-136.21C102.42,-148.25 129.57,-164.8 154.75,-176.62 159.11,-178.67 163.77,-180.63 168.43,-182.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.16,-185.7 177.75,-185.88 169.58,-179.14 167.16,-185.7"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.38,-167.25 179.12,-167.25 179.12,-148 233.38,-148 233.38,-167.25"/>
-<text text-anchor="middle" x="206.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.88,-135.57C135.4,-139.79 152.93,-144.26 167.85,-148.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.66,-151.38 177.22,-150.47 168.39,-144.6 166.66,-151.38"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.88,-130.25 180.62,-130.25 180.62,-111 231.88,-111 231.88,-130.25"/>
-<text text-anchor="middle" x="206.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.88,-120.62C135.74,-120.62 153.64,-120.62 168.75,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.68,-124.13 178.68,-120.63 168.68,-117.13 168.68,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-93.25 179.5,-93.25 179.5,-74 233,-74 233,-93.25"/>
-<text text-anchor="middle" x="206.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.88,-105.68C135.53,-101.43 153.2,-96.92 168.18,-93.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.77,-96.55 177.6,-90.69 167.04,-89.77 168.77,-96.55"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.25,-56.25 180.25,-56.25 180.25,-37 232.25,-37 232.25,-56.25"/>
-<text text-anchor="middle" x="206.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.73,-105.04C102.42,-93 129.57,-76.45 154.75,-64.62 159.38,-62.45 164.34,-60.38 169.29,-58.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.34,-61.82 178.53,-55.09 167.93,-55.24 170.34,-61.82"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strerror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="239.38,-19.25 173.12,-19.25 173.12,0 239.38,0 239.38,-19.25"/>
-<text text-anchor="middle" x="206.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strerror</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.5,-105.01C89.07,-84.62 120.65,-49.02 154.75,-27.62 157.16,-26.11 159.72,-24.7 162.36,-23.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.61,-26.67 171.37,-19.45 160.8,-20.25 163.61,-26.67"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph_org.svg b/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph_org.svg
deleted file mode 100644
index 5739a36f7..000000000
--- a/d8/d77/namespacemachine__learning_aa72a53c88203fde278f1fe6c3afe5b07_cgraph_org.svg
+++ /dev/null
@@ -1,148 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::save_u_matrix Pages: 1 -->
-<svg width="266pt" height="249pt"
- viewBox="0.00 0.00 265.75 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
-<title>machine_learning::save_u_matrix</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="118.75,-135.88 0,-135.88 0,-105.38 118.75,-105.38 118.75,-135.88"/>
-<text text-anchor="start" x="8" y="-122.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::save</text>
-<text text-anchor="middle" x="59.38" y="-111.12" font-family="Helvetica,sans-Serif" font-size="10.00">_u_matrix</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257.75,-241.25 154.75,-241.25 154.75,-222 257.75,-222 257.75,-241.25"/>
-<text text-anchor="middle" x="206.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.5,-136.24C89.07,-156.63 120.65,-192.23 154.75,-213.62 156.58,-214.77 158.5,-215.86 160.47,-216.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.7,-219.93 169.25,-220.93 161.63,-213.57 158.7,-219.93"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-204.25 179.5,-204.25 179.5,-185 233,-185 233,-204.25"/>
-<text text-anchor="middle" x="206.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.73,-136.21C102.42,-148.25 129.57,-164.8 154.75,-176.62 159.11,-178.67 163.77,-180.63 168.43,-182.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.16,-185.7 177.75,-185.88 169.58,-179.14 167.16,-185.7"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.38,-167.25 179.12,-167.25 179.12,-148 233.38,-148 233.38,-167.25"/>
-<text text-anchor="middle" x="206.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.88,-135.57C135.4,-139.79 152.93,-144.26 167.85,-148.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.66,-151.38 177.22,-150.47 168.39,-144.6 166.66,-151.38"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.88,-130.25 180.62,-130.25 180.62,-111 231.88,-111 231.88,-130.25"/>
-<text text-anchor="middle" x="206.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.88,-120.62C135.74,-120.62 153.64,-120.62 168.75,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.68,-124.13 178.68,-120.63 168.68,-117.13 168.68,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-93.25 179.5,-93.25 179.5,-74 233,-74 233,-93.25"/>
-<text text-anchor="middle" x="206.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.88,-105.68C135.53,-101.43 153.2,-96.92 168.18,-93.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.77,-96.55 177.6,-90.69 167.04,-89.77 168.77,-96.55"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.25,-56.25 180.25,-56.25 180.25,-37 232.25,-37 232.25,-56.25"/>
-<text text-anchor="middle" x="206.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.73,-105.04C102.42,-93 129.57,-76.45 154.75,-64.62 159.38,-62.45 164.34,-60.38 169.29,-58.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.34,-61.82 178.53,-55.09 167.93,-55.24 170.34,-61.82"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strerror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="239.38,-19.25 173.12,-19.25 173.12,0 239.38,0 239.38,-19.25"/>
-<text text-anchor="middle" x="206.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strerror</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.5,-105.01C89.07,-84.62 120.65,-49.02 154.75,-27.62 157.16,-26.11 159.72,-24.7 162.36,-23.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.61,-26.67 171.37,-19.45 160.8,-20.25 163.61,-26.67"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph.map b/d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph.map
deleted file mode 100644
index 52dc31cae..000000000
--- a/d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="machine_learning::uniform_random_initialization" name="machine_learning::uniform_random_initialization">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,179,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/system_clock/now.html#" title=" " alt="" coords="227,5,364,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="179,23,211,23,211,28,179,28"/>
-</map>
diff --git a/d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph.md5 b/d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph.md5
deleted file mode 100644
index 252a323c0..000000000
--- a/d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b05719588f7d37dc492d839787c0c8c9
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph.svg b/d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph.svg
deleted file mode 100644
index 10990adb9..000000000
--- a/d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::uniform_random_initialization Pages: 1 -->
-<svg width="277pt" height="39pt"
- viewBox="0.00 0.00 277.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>machine_learning::uniform_random_initialization</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="130,-30.5 0,-30.5 0,0 130,0 130,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::uniform</text>
-<text text-anchor="middle" x="65" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random_initialization</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269,-30.5 166,-30.5 166,0 269,0 269,-30.5"/>
-<text text-anchor="start" x="174" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::system</text>
-<text text-anchor="middle" x="217.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.26,-15.25C138.21,-15.25 146.32,-15.25 154.23,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.13,-18.75 164.13,-15.25 154.13,-11.75 154.13,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph_org.svg b/d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph_org.svg
deleted file mode 100644
index 33580a0ef..000000000
--- a/d8/d77/namespacemachine__learning_abee7b35403af3612222d3b7a53074905_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::uniform_random_initialization Pages: 1 -->
-<svg width="277pt" height="39pt"
- viewBox="0.00 0.00 277.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>machine_learning::uniform_random_initialization</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="130,-30.5 0,-30.5 0,0 130,0 130,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::uniform</text>
-<text text-anchor="middle" x="65" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random_initialization</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269,-30.5 166,-30.5 166,0 269,0 269,-30.5"/>
-<text text-anchor="start" x="174" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::system</text>
-<text text-anchor="middle" x="217.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.26,-15.25C138.21,-15.25 146.32,-15.25 154.23,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.13,-18.75 164.13,-15.25 154.13,-11.75 154.13,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_ac332d152078e96311e43ac5e7183ea26_cgraph.map b/d8/d77/namespacemachine__learning_ac332d152078e96311e43ac5e7183ea26_cgraph.map
deleted file mode 100644
index 1778ccefe..000000000
--- a/d8/d77/namespacemachine__learning_ac332d152078e96311e43ac5e7183ea26_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="machine_learning::minmax_scaler" name="machine_learning::minmax_scaler">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,134,182,174"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="444,5,515,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="110,131,159,82,192,57,229,37,280,21,334,13,385,10,428,11,428,16,385,16,334,18,281,26,231,42,195,61,163,86,114,135"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="446,112,514,138"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="182,145,430,126,430,131,182,150"/>
-<area shape="rect" id="Node000004" href="$d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" title=" " alt="" coords="230,51,378,92"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="146,131,235,96,237,101,148,136"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="268,167,340,192"/>
-<area shape="poly" id="edge7_Node000001_Node000006" title=" " alt="" coords="183,162,253,171,252,176,182,167"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="270,216,338,242"/>
-<area shape="poly" id="edge8_Node000001_Node000007" title=" " alt="" coords="150,173,231,202,255,211,254,216,229,207,148,178"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="246,265,362,291"/>
-<area shape="poly" id="edge9_Node000001_Node000008" title=" " alt="" coords="120,173,169,213,231,252,241,257,239,262,228,257,166,217,116,177"/>
-<area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="372,48,428,31,430,36,374,53"/>
-<area shape="poly" id="edge5_Node000004_Node000003" title=" " alt="" coords="374,90,431,108,430,113,372,95"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="426,59,533,84"/>
-<area shape="poly" id="edge6_Node000004_Node000005" title=" " alt="" coords="379,69,411,69,411,74,379,74"/>
-</map>
diff --git a/d8/d77/namespacemachine__learning_ac332d152078e96311e43ac5e7183ea26_cgraph.md5 b/d8/d77/namespacemachine__learning_ac332d152078e96311e43ac5e7183ea26_cgraph.md5
deleted file mode 100644
index 0f970f1c0..000000000
--- a/d8/d77/namespacemachine__learning_ac332d152078e96311e43ac5e7183ea26_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c7b154abfc1ecb088a2707bfb74ffc48
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_ac332d152078e96311e43ac5e7183ea26_cgraph.svg b/d8/d77/namespacemachine__learning_ac332d152078e96311e43ac5e7183ea26_cgraph.svg
deleted file mode 100644
index 12b1dcc3c..000000000
--- a/d8/d77/namespacemachine__learning_ac332d152078e96311e43ac5e7183ea26_cgraph.svg
+++ /dev/null
@@ -1,193 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::minmax_scaler Pages: 1 -->
-<svg width="404pt" height="222pt"
- viewBox="0.00 0.00 404.00 222.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 218.25)">
-<title>machine_learning::minmax_scaler</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="132.25,-117.88 0,-117.88 0,-87.38 132.25,-87.38 132.25,-117.88"/>
-<text text-anchor="start" x="8" y="-104.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::minmax</text>
-<text text-anchor="middle" x="66.12" y="-93.12" font-family="Helvetica,sans-Serif" font-size="10.00">_scaler</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="382.5,-214.25 329,-214.25 329,-195 382.5,-195 382.5,-214.25"/>
-<text text-anchor="middle" x="355.75" y="-200.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.91,-118.34C97.44,-138.61 131.03,-173.1 168.25,-188.62 216.77,-208.86 278.44,-209.91 317.26,-207.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.26,-211.45 327.03,-207.35 316.84,-204.46 317.26,-211.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="381.38,-134.25 330.12,-134.25 330.12,-115 381.38,-115 381.38,-134.25"/>
-<text text-anchor="middle" x="355.75" y="-120.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.39,-107.62C190.03,-112.03 271.94,-118.29 318.57,-121.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.16,-125.34 328.4,-122.61 318.69,-118.36 318.16,-125.34"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279.5,-179.88 168.25,-179.88 168.25,-149.38 279.5,-149.38 279.5,-179.88"/>
-<text text-anchor="start" x="176.25" y="-166.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="223.88" y="-155.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.43,-118.27C126.55,-126.28 151.27,-136.12 172.74,-144.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.32,-147.87 181.91,-148.32 173.91,-141.37 171.32,-147.87"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251,-93.25 196.75,-93.25 196.75,-74 251,-74 251,-93.25"/>
-<text text-anchor="middle" x="223.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.73,-94.62C150.61,-92.44 169.39,-90.15 185.14,-88.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.53,-91.71 195.04,-87.02 184.69,-84.76 185.53,-91.71"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-56.25 198.25,-56.25 198.25,-37 249.5,-37 249.5,-56.25"/>
-<text text-anchor="middle" x="223.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge8_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.82,-86.9C126.22,-79.9 148.26,-71.67 168.25,-64.62 174.25,-62.51 180.65,-60.33 186.88,-58.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.95,-61.59 196.35,-55.13 185.75,-54.94 187.95,-61.59"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.12,-19.25 180.62,-19.25 180.62,0 267.12,0 267.12,-19.25"/>
-<text text-anchor="middle" x="223.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge9_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge9_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.59,-86.92C103.87,-70.26 136.42,-44.12 168.25,-27.62 170.77,-26.32 173.41,-25.08 176.1,-23.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.23,-27.23 185.24,-20.3 174.65,-20.72 177.23,-27.23"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.83,-180.32C289.79,-184.62 304.66,-189.2 317.68,-193.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.55,-196.52 327.13,-196.12 318.61,-189.83 316.55,-196.52"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.83,-148.93C290.27,-144.48 305.67,-139.74 319,-135.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="319.67,-139.09 328.2,-132.8 317.61,-132.4 319.67,-139.09"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="396,-174.25 315.5,-174.25 315.5,-155 396,-155 396,-174.25"/>
-<text text-anchor="middle" x="355.75" y="-160.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge6_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge6_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M279.95,-164.62C287.94,-164.62 296.14,-164.62 304.03,-164.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="303.82,-168.13 313.82,-164.63 303.82,-161.13 303.82,-168.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_ac332d152078e96311e43ac5e7183ea26_cgraph_org.svg b/d8/d77/namespacemachine__learning_ac332d152078e96311e43ac5e7183ea26_cgraph_org.svg
deleted file mode 100644
index 0d7e9519f..000000000
--- a/d8/d77/namespacemachine__learning_ac332d152078e96311e43ac5e7183ea26_cgraph_org.svg
+++ /dev/null
@@ -1,167 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::minmax_scaler Pages: 1 -->
-<svg width="404pt" height="222pt"
- viewBox="0.00 0.00 404.00 222.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 218.25)">
-<title>machine_learning::minmax_scaler</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="132.25,-117.88 0,-117.88 0,-87.38 132.25,-87.38 132.25,-117.88"/>
-<text text-anchor="start" x="8" y="-104.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::minmax</text>
-<text text-anchor="middle" x="66.12" y="-93.12" font-family="Helvetica,sans-Serif" font-size="10.00">_scaler</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="382.5,-214.25 329,-214.25 329,-195 382.5,-195 382.5,-214.25"/>
-<text text-anchor="middle" x="355.75" y="-200.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.91,-118.34C97.44,-138.61 131.03,-173.1 168.25,-188.62 216.77,-208.86 278.44,-209.91 317.26,-207.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.26,-211.45 327.03,-207.35 316.84,-204.46 317.26,-211.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="381.38,-134.25 330.12,-134.25 330.12,-115 381.38,-115 381.38,-134.25"/>
-<text text-anchor="middle" x="355.75" y="-120.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.39,-107.62C190.03,-112.03 271.94,-118.29 318.57,-121.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.16,-125.34 328.4,-122.61 318.69,-118.36 318.16,-125.34"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279.5,-179.88 168.25,-179.88 168.25,-149.38 279.5,-149.38 279.5,-179.88"/>
-<text text-anchor="start" x="176.25" y="-166.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="223.88" y="-155.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.43,-118.27C126.55,-126.28 151.27,-136.12 172.74,-144.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.32,-147.87 181.91,-148.32 173.91,-141.37 171.32,-147.87"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251,-93.25 196.75,-93.25 196.75,-74 251,-74 251,-93.25"/>
-<text text-anchor="middle" x="223.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M132.73,-94.62C150.61,-92.44 169.39,-90.15 185.14,-88.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.53,-91.71 195.04,-87.02 184.69,-84.76 185.53,-91.71"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-56.25 198.25,-56.25 198.25,-37 249.5,-37 249.5,-56.25"/>
-<text text-anchor="middle" x="223.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge8_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.82,-86.9C126.22,-79.9 148.26,-71.67 168.25,-64.62 174.25,-62.51 180.65,-60.33 186.88,-58.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.95,-61.59 196.35,-55.13 185.75,-54.94 187.95,-61.59"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.12,-19.25 180.62,-19.25 180.62,0 267.12,0 267.12,-19.25"/>
-<text text-anchor="middle" x="223.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge9_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge9_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.59,-86.92C103.87,-70.26 136.42,-44.12 168.25,-27.62 170.77,-26.32 173.41,-25.08 176.1,-23.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.23,-27.23 185.24,-20.3 174.65,-20.72 177.23,-27.23"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.83,-180.32C289.79,-184.62 304.66,-189.2 317.68,-193.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.55,-196.52 327.13,-196.12 318.61,-189.83 316.55,-196.52"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.83,-148.93C290.27,-144.48 305.67,-139.74 319,-135.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="319.67,-139.09 328.2,-132.8 317.61,-132.4 319.67,-139.09"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="396,-174.25 315.5,-174.25 315.5,-155 396,-155 396,-174.25"/>
-<text text-anchor="middle" x="355.75" y="-160.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge6_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge6_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M279.95,-164.62C287.94,-164.62 296.14,-164.62 304.03,-164.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="303.82,-168.13 313.82,-164.63 303.82,-161.13 303.82,-168.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.map b/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.map
deleted file mode 100644
index 679d76a67..000000000
--- a/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.map
+++ /dev/null
@@ -1,25 +0,0 @@
-<map id="machine_learning::kohonen_som" name="machine_learning::kohonen_som">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,153,217,179"/>
-<area shape="rect" id="Node000002" href="$d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3" title=" " alt="" coords="265,146,434,186"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="217,164,249,164,249,169,217,169"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/exp.html#" title=" " alt="" coords="526,29,594,55"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="371,143,419,103,481,64,510,52,512,57,483,69,423,108,374,148"/>
-<area shape="rect" id="Node000004" href="$d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e" title=" " alt="" coords="516,79,604,104"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="402,143,481,113,500,107,501,112,483,118,404,148"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="524,128,596,154"/>
-<area shape="poly" id="edge8_Node000002_Node000009" title=" " alt="" coords="434,153,507,144,508,150,435,159"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="526,177,594,203"/>
-<area shape="poly" id="edge9_Node000002_Node000010" title=" " alt="" coords="435,173,511,182,510,187,434,179"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="525,227,594,252"/>
-<area shape="poly" id="edge10_Node000002_Node000011" title=" " alt="" coords="405,184,483,213,511,222,509,227,481,218,403,189"/>
-<area shape="rect" id="Node000012" href="$d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" title=" " alt="" coords="482,276,637,302"/>
-<area shape="poly" id="edge11_Node000002_Node000012" title=" " alt="" coords="375,185,423,224,483,262,494,268,492,272,481,267,420,228,372,189"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="707,5,785,31"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="603,77,636,65,684,40,695,35,697,40,687,45,638,70,605,82"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/distance.html#" title=" " alt="" coords="698,55,794,80"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="604,83,682,73,683,78,604,89"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="712,104,780,130"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="604,95,697,108,696,113,604,100"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min_element.html#" title=" " alt="" coords="685,153,807,179"/>
-<area shape="poly" id="edge7_Node000004_Node000008" title=" " alt="" coords="605,101,638,113,687,140,697,145,695,149,684,145,636,118,603,106"/>
-</map>
diff --git a/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.md5 b/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.md5
deleted file mode 100644
index e6fdbeee6..000000000
--- a/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fc4174f43c406273aae7026d0b3b0803
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.svg b/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.svg
deleted file mode 100644
index 0c8f5981b..000000000
--- a/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph.svg
+++ /dev/null
@@ -1,303 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::kohonen_som Pages: 1 -->
-<!--zoomable 230 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 609;
-var viewHeight = 230;
-var sectionId = 'dynsection-4';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>machine_learning::kohonen_som</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="158.5,-111.25 0,-111.25 0,-92 158.5,-92 158.5,-111.25"/>
-<text text-anchor="middle" x="79.25" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::kohonen_som</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321.5,-116.88 194.5,-116.88 194.5,-86.38 321.5,-86.38 321.5,-116.88"/>
-<text text-anchor="start" x="202.5" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::update</text>
-<text text-anchor="middle" x="258" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">_weights</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.8,-101.62C166.73,-101.62 174.77,-101.62 182.65,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.55,-105.13 192.55,-101.63 182.55,-98.13 182.55,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441.38,-204.25 390.12,-204.25 390.12,-185 441.38,-185 441.38,-204.25"/>
-<text text-anchor="middle" x="415.75" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.55,-117.14C294.19,-133.88 326.01,-160.32 357.5,-176.62 364.2,-180.09 371.68,-183.04 378.98,-185.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="377.74,-188.76 388.33,-188.36 379.8,-182.07 377.74,-188.76"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="448.88,-167.25 382.62,-167.25 382.62,-148 448.88,-148 448.88,-167.25"/>
-<text text-anchor="middle" x="415.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_min_2d</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M298.09,-117.36C316.09,-124.44 337.78,-132.73 357.5,-139.62 361.98,-141.19 366.68,-142.77 371.38,-144.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="370.2,-147.61 380.79,-147.33 372.34,-140.94 370.2,-147.61"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="442.88,-130.25 388.62,-130.25 388.62,-111 442.88,-111 442.88,-130.25"/>
-<text text-anchor="middle" x="415.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.9,-109.3C340.52,-111.57 360.32,-113.98 376.83,-116"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="376.36,-119.47 386.71,-117.2 377.2,-112.52 376.36,-119.47"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441.38,-93.25 390.12,-93.25 390.12,-74 441.38,-74 441.38,-93.25"/>
-<text text-anchor="middle" x="415.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge9_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.9,-94.36C341.24,-92.12 361.87,-89.74 378.76,-87.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="378.75,-91.31 388.28,-86.68 377.95,-84.36 378.75,-91.31"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441.75,-56.25 389.75,-56.25 389.75,-37 441.75,-37 441.75,-56.25"/>
-<text text-anchor="middle" x="415.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge10_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge10_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.08,-86C316.89,-79.21 338.16,-71.29 357.5,-64.62 364.21,-62.31 371.4,-59.96 378.34,-57.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.35,-61.09 387.84,-54.76 377.25,-54.42 379.35,-61.09"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="474,-19.25 357.5,-19.25 357.5,0 474,0 474,-19.25"/>
-<text text-anchor="middle" x="415.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge11_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge11_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.93,-86.03C294.65,-69.51 326.3,-43.65 357.5,-27.62 360.19,-26.24 363,-24.95 365.88,-23.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="366.96,-27.06 375.04,-20.21 364.45,-20.53 366.96,-27.06"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="584.88,-222.25 526.12,-222.25 526.12,-203 584.88,-203 584.88,-222.25"/>
-<text text-anchor="middle" x="555.5" y="-208.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M449.21,-166.71C457.41,-169.31 466.11,-172.34 474,-175.62 490.7,-182.59 493.59,-187 510,-194.62 512.58,-195.82 515.26,-197.02 517.97,-198.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="516.46,-201.36 527.03,-202.01 519.17,-194.91 516.46,-201.36"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="591.62,-185.25 519.38,-185.25 519.38,-166 591.62,-166 591.62,-185.25"/>
-<text text-anchor="middle" x="555.5" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M449.05,-161.85C466.51,-164.13 488.4,-166.99 507.7,-169.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="507.15,-172.97 517.52,-170.79 508.06,-166.03 507.15,-172.97"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="581.12,-148.25 529.88,-148.25 529.88,-129 581.12,-129 581.12,-148.25"/>
-<text text-anchor="middle" x="555.5" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M449.05,-153.17C469.85,-150.3 496.92,-146.57 518.42,-143.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="518.79,-147.08 528.22,-142.25 517.84,-140.15 518.79,-147.08"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="601,-111.25 510,-111.25 510,-92 601,-92 601,-111.25"/>
-<text text-anchor="middle" x="555.5" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M449.26,-148.66C457.46,-146.06 466.15,-143 474,-139.62 490.82,-132.4 493.49,-127.52 510,-119.62 512.57,-118.4 515.24,-117.18 517.94,-115.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="519.15,-119.28 526.99,-112.16 516.42,-112.83 519.15,-119.28"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph_org.svg b/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph_org.svg
deleted file mode 100644
index 862bf89b3..000000000
--- a/d8/d77/namespacemachine__learning_ac43d294e21a0c4fa33c53757df054576_cgraph_org.svg
+++ /dev/null
@@ -1,220 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::kohonen_som Pages: 1 -->
-<svg width="609pt" height="230pt"
- viewBox="0.00 0.00 609.00 230.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 226.25)">
-<title>machine_learning::kohonen_som</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="158.5,-111.25 0,-111.25 0,-92 158.5,-92 158.5,-111.25"/>
-<text text-anchor="middle" x="79.25" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::kohonen_som</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321.5,-116.88 194.5,-116.88 194.5,-86.38 321.5,-86.38 321.5,-116.88"/>
-<text text-anchor="start" x="202.5" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::update</text>
-<text text-anchor="middle" x="258" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">_weights</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.8,-101.62C166.73,-101.62 174.77,-101.62 182.65,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.55,-105.13 192.55,-101.63 182.55,-98.13 182.55,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441.38,-204.25 390.12,-204.25 390.12,-185 441.38,-185 441.38,-204.25"/>
-<text text-anchor="middle" x="415.75" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.55,-117.14C294.19,-133.88 326.01,-160.32 357.5,-176.62 364.2,-180.09 371.68,-183.04 378.98,-185.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="377.74,-188.76 388.33,-188.36 379.8,-182.07 377.74,-188.76"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="448.88,-167.25 382.62,-167.25 382.62,-148 448.88,-148 448.88,-167.25"/>
-<text text-anchor="middle" x="415.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_min_2d</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M298.09,-117.36C316.09,-124.44 337.78,-132.73 357.5,-139.62 361.98,-141.19 366.68,-142.77 371.38,-144.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="370.2,-147.61 380.79,-147.33 372.34,-140.94 370.2,-147.61"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="442.88,-130.25 388.62,-130.25 388.62,-111 442.88,-111 442.88,-130.25"/>
-<text text-anchor="middle" x="415.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.9,-109.3C340.52,-111.57 360.32,-113.98 376.83,-116"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="376.36,-119.47 386.71,-117.2 377.2,-112.52 376.36,-119.47"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441.38,-93.25 390.12,-93.25 390.12,-74 441.38,-74 441.38,-93.25"/>
-<text text-anchor="middle" x="415.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge9_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.9,-94.36C341.24,-92.12 361.87,-89.74 378.76,-87.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="378.75,-91.31 388.28,-86.68 377.95,-84.36 378.75,-91.31"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441.75,-56.25 389.75,-56.25 389.75,-37 441.75,-37 441.75,-56.25"/>
-<text text-anchor="middle" x="415.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge10_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge10_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.08,-86C316.89,-79.21 338.16,-71.29 357.5,-64.62 364.21,-62.31 371.4,-59.96 378.34,-57.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.35,-61.09 387.84,-54.76 377.25,-54.42 379.35,-61.09"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="474,-19.25 357.5,-19.25 357.5,0 474,0 474,-19.25"/>
-<text text-anchor="middle" x="415.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge11_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge11_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.93,-86.03C294.65,-69.51 326.3,-43.65 357.5,-27.62 360.19,-26.24 363,-24.95 365.88,-23.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="366.96,-27.06 375.04,-20.21 364.45,-20.53 366.96,-27.06"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="584.88,-222.25 526.12,-222.25 526.12,-203 584.88,-203 584.88,-222.25"/>
-<text text-anchor="middle" x="555.5" y="-208.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M449.21,-166.71C457.41,-169.31 466.11,-172.34 474,-175.62 490.7,-182.59 493.59,-187 510,-194.62 512.58,-195.82 515.26,-197.02 517.97,-198.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="516.46,-201.36 527.03,-202.01 519.17,-194.91 516.46,-201.36"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="591.62,-185.25 519.38,-185.25 519.38,-166 591.62,-166 591.62,-185.25"/>
-<text text-anchor="middle" x="555.5" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M449.05,-161.85C466.51,-164.13 488.4,-166.99 507.7,-169.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="507.15,-172.97 517.52,-170.79 508.06,-166.03 507.15,-172.97"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="581.12,-148.25 529.88,-148.25 529.88,-129 581.12,-129 581.12,-148.25"/>
-<text text-anchor="middle" x="555.5" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M449.05,-153.17C469.85,-150.3 496.92,-146.57 518.42,-143.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="518.79,-147.08 528.22,-142.25 517.84,-140.15 518.79,-147.08"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="601,-111.25 510,-111.25 510,-92 601,-92 601,-111.25"/>
-<text text-anchor="middle" x="555.5" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M449.26,-148.66C457.46,-146.06 466.15,-143 474,-139.62 490.82,-132.4 493.49,-127.52 510,-119.62 512.57,-118.4 515.24,-117.18 517.94,-115.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="519.15,-119.28 526.99,-112.16 516.42,-112.83 519.15,-119.28"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_acafa3e62b686aebdbad81c4f89913f43_cgraph.map b/d8/d77/namespacemachine__learning_acafa3e62b686aebdbad81c4f89913f43_cgraph.map
deleted file mode 100644
index 59d6ba9e9..000000000
--- a/d8/d77/namespacemachine__learning_acafa3e62b686aebdbad81c4f89913f43_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="machine_learning::hadamard_product" name="machine_learning::hadamard_product">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,80,193,121"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="461,5,532,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="137,78,185,56,240,37,294,26,349,19,445,15,446,20,350,25,295,31,241,42,187,60,140,83"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="462,112,531,138"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="193,104,447,119,447,125,193,109"/>
-<area shape="rect" id="Node000004" href="$d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" title=" " alt="" coords="244,51,392,92"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="193,86,228,81,229,86,194,91"/>
-<area shape="rect" id="Node000006" 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="241,167,395,192"/>
-<area shape="poly" id="edge7_Node000001_Node000006" title=" " alt="" coords="159,119,267,159,265,164,157,124"/>
-<area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="388,48,446,30,447,36,389,53"/>
-<area shape="poly" id="edge5_Node000004_Node000003" title=" " alt="" coords="389,90,448,108,447,113,388,95"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="443,59,550,84"/>
-<area shape="poly" id="edge6_Node000004_Node000005" title=" " alt="" coords="392,69,427,69,427,74,392,74"/>
-</map>
diff --git a/d8/d77/namespacemachine__learning_acafa3e62b686aebdbad81c4f89913f43_cgraph.md5 b/d8/d77/namespacemachine__learning_acafa3e62b686aebdbad81c4f89913f43_cgraph.md5
deleted file mode 100644
index 60306942f..000000000
--- a/d8/d77/namespacemachine__learning_acafa3e62b686aebdbad81c4f89913f43_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9638fe9118e02549742e35346e71ec94
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_acafa3e62b686aebdbad81c4f89913f43_cgraph.svg b/d8/d77/namespacemachine__learning_acafa3e62b686aebdbad81c4f89913f43_cgraph.svg
deleted file mode 100644
index 6d9f5c50d..000000000
--- a/d8/d77/namespacemachine__learning_acafa3e62b686aebdbad81c4f89913f43_cgraph.svg
+++ /dev/null
@@ -1,157 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::hadamard_product Pages: 1 -->
-<svg width="417pt" height="148pt"
- viewBox="0.00 0.00 416.75 148.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 144.25)">
-<title>machine_learning::hadamard_product</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="140.5,-83.88 0,-83.88 0,-53.38 140.5,-53.38 140.5,-83.88"/>
-<text text-anchor="start" x="8" y="-70.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::hadamard</text>
-<text text-anchor="middle" x="70.25" y="-59.12" font-family="Helvetica,sans-Serif" font-size="10.00">_product</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="395.25,-140.25 341.75,-140.25 341.75,-121 395.25,-121 395.25,-140.25"/>
-<text text-anchor="middle" x="368.5" y="-126.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.82,-84.18C120.49,-94.66 149.43,-107.78 176.5,-114.62 228.68,-127.83 291.18,-130.73 330.12,-131.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.89,-134.58 339.9,-131.11 329.91,-127.58 329.89,-134.58"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="394.12,-60.25 342.88,-60.25 342.88,-41 394.12,-41 394.12,-60.25"/>
-<text text-anchor="middle" x="368.5" y="-46.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.71,-64.4C200.33,-60.78 283.92,-55.7 331.18,-52.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.38,-56.33 341.15,-52.23 330.96,-49.34 331.38,-56.33"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290,-105.88 178.75,-105.88 178.75,-75.38 290,-75.38 290,-105.88"/>
-<text text-anchor="start" x="186.75" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="234.38" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.95,-78.08C149.66,-79.26 158.55,-80.47 167.21,-81.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.54,-85.09 176.92,-82.96 167.48,-78.15 166.54,-85.09"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.25,-19.25 176.5,-19.25 176.5,0 292.25,0 292.25,-19.25"/>
-<text text-anchor="middle" x="234.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.27,-52.97C139.49,-43.79 171.06,-32.3 195.36,-23.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.34,-26.83 204.54,-20.12 193.95,-20.25 196.34,-26.83"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M287.22,-106.32C301.79,-110.73 317.33,-115.44 330.82,-119.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.57,-122.8 340.15,-122.35 331.59,-116.1 329.57,-122.8"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M287.22,-74.93C302.13,-70.42 318.05,-65.6 331.76,-61.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="332.67,-64.83 341.22,-58.58 330.64,-58.13 332.67,-64.83"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408.75,-100.25 328.25,-100.25 328.25,-81 408.75,-81 408.75,-100.25"/>
-<text text-anchor="middle" x="368.5" y="-86.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge6_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge6_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.26,-90.62C298.94,-90.62 307.88,-90.62 316.46,-90.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.37,-94.13 326.37,-90.63 316.37,-87.13 316.37,-94.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_acafa3e62b686aebdbad81c4f89913f43_cgraph_org.svg b/d8/d77/namespacemachine__learning_acafa3e62b686aebdbad81c4f89913f43_cgraph_org.svg
deleted file mode 100644
index c16568e33..000000000
--- a/d8/d77/namespacemachine__learning_acafa3e62b686aebdbad81c4f89913f43_cgraph_org.svg
+++ /dev/null
@@ -1,131 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::hadamard_product Pages: 1 -->
-<svg width="417pt" height="148pt"
- viewBox="0.00 0.00 416.75 148.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 144.25)">
-<title>machine_learning::hadamard_product</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="140.5,-83.88 0,-83.88 0,-53.38 140.5,-53.38 140.5,-83.88"/>
-<text text-anchor="start" x="8" y="-70.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::hadamard</text>
-<text text-anchor="middle" x="70.25" y="-59.12" font-family="Helvetica,sans-Serif" font-size="10.00">_product</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="395.25,-140.25 341.75,-140.25 341.75,-121 395.25,-121 395.25,-140.25"/>
-<text text-anchor="middle" x="368.5" y="-126.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.82,-84.18C120.49,-94.66 149.43,-107.78 176.5,-114.62 228.68,-127.83 291.18,-130.73 330.12,-131.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.89,-134.58 339.9,-131.11 329.91,-127.58 329.89,-134.58"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="394.12,-60.25 342.88,-60.25 342.88,-41 394.12,-41 394.12,-60.25"/>
-<text text-anchor="middle" x="368.5" y="-46.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.71,-64.4C200.33,-60.78 283.92,-55.7 331.18,-52.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.38,-56.33 341.15,-52.23 330.96,-49.34 331.38,-56.33"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290,-105.88 178.75,-105.88 178.75,-75.38 290,-75.38 290,-105.88"/>
-<text text-anchor="start" x="186.75" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::get</text>
-<text text-anchor="middle" x="234.38" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shape</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.95,-78.08C149.66,-79.26 158.55,-80.47 167.21,-81.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.54,-85.09 176.92,-82.96 167.48,-78.15 166.54,-85.09"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.25,-19.25 176.5,-19.25 176.5,0 292.25,0 292.25,-19.25"/>
-<text text-anchor="middle" x="234.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.27,-52.97C139.49,-43.79 171.06,-32.3 195.36,-23.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.34,-26.83 204.54,-20.12 193.95,-20.25 196.34,-26.83"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M287.22,-106.32C301.79,-110.73 317.33,-115.44 330.82,-119.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.57,-122.8 340.15,-122.35 331.59,-116.1 329.57,-122.8"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M287.22,-74.93C302.13,-70.42 318.05,-65.6 331.76,-61.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="332.67,-64.83 341.22,-58.58 330.64,-58.13 332.67,-64.83"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408.75,-100.25 328.25,-100.25 328.25,-81 408.75,-81 408.75,-100.25"/>
-<text text-anchor="middle" x="368.5" y="-86.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge6_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge6_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.26,-90.62C298.94,-90.62 307.88,-90.62 316.46,-90.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.37,-94.13 326.37,-90.63 316.37,-87.13 316.37,-94.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_ae868ad43698a1d69ba46ea3827d7d2c3_cgraph.map b/d8/d77/namespacemachine__learning_ae868ad43698a1d69ba46ea3827d7d2c3_cgraph.map
deleted file mode 100644
index 50839566f..000000000
--- a/d8/d77/namespacemachine__learning_ae868ad43698a1d69ba46ea3827d7d2c3_cgraph.map
+++ /dev/null
@@ -1,23 +0,0 @@
-<map id="machine_learning::update_weights" name="machine_learning::update_weights">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,146,175,186"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/exp.html#" title=" " alt="" coords="266,29,334,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="112,143,160,103,221,64,250,52,252,57,224,69,163,108,115,148"/>
-<area shape="rect" id="Node000003" href="$d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e" title=" " alt="" coords="256,79,344,104"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="143,143,222,113,240,107,242,112,224,118,144,148"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="264,128,336,154"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="175,153,248,144,249,150,176,159"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="266,177,334,203"/>
-<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="176,173,251,182,251,187,175,179"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="266,227,335,252"/>
-<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="146,184,224,213,251,222,250,227,222,218,144,189"/>
-<area shape="rect" id="Node000011" href="$d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" title=" " alt="" coords="223,276,378,302"/>
-<area shape="poly" id="edge10_Node000001_Node000011" title=" " alt="" coords="116,185,164,224,224,262,235,268,233,272,221,267,160,228,112,189"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="448,5,526,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="344,77,377,65,425,40,436,35,438,40,427,45,379,70,346,82"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/distance.html#" title=" " alt="" coords="438,55,535,80"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="344,83,423,73,423,78,345,89"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="452,104,521,130"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="345,95,438,108,437,113,344,100"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min_element.html#" title=" " alt="" coords="426,153,547,179"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="346,101,379,113,427,140,438,145,435,149,425,145,377,118,344,106"/>
-</map>
diff --git a/d8/d77/namespacemachine__learning_ae868ad43698a1d69ba46ea3827d7d2c3_cgraph.md5 b/d8/d77/namespacemachine__learning_ae868ad43698a1d69ba46ea3827d7d2c3_cgraph.md5
deleted file mode 100644
index eb9e311f1..000000000
--- a/d8/d77/namespacemachine__learning_ae868ad43698a1d69ba46ea3827d7d2c3_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-73823ce5ba1f01ccb5bf75c23d608df8
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_ae868ad43698a1d69ba46ea3827d7d2c3_cgraph.svg b/d8/d77/namespacemachine__learning_ae868ad43698a1d69ba46ea3827d7d2c3_cgraph.svg
deleted file mode 100644
index 811d2e614..000000000
--- a/d8/d77/namespacemachine__learning_ae868ad43698a1d69ba46ea3827d7d2c3_cgraph.svg
+++ /dev/null
@@ -1,228 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::update_weights Pages: 1 -->
-<svg width="415pt" height="230pt"
- viewBox="0.00 0.00 414.50 230.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 226.25)">
-<title>machine_learning::update_weights</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-116.88 0,-116.88 0,-86.38 127,-86.38 127,-116.88"/>
-<text text-anchor="start" x="8" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::update</text>
-<text text-anchor="middle" x="63.5" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">_weights</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.88,-204.25 195.62,-204.25 195.62,-185 246.88,-185 246.88,-204.25"/>
-<text text-anchor="middle" x="221.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.05,-117.14C99.69,-133.88 131.51,-160.32 163,-176.62 169.7,-180.09 177.18,-183.04 184.48,-185.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.24,-188.76 193.83,-188.36 185.3,-182.07 183.24,-188.76"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.38,-167.25 188.12,-167.25 188.12,-148 254.38,-148 254.38,-167.25"/>
-<text text-anchor="middle" x="221.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_min_2d</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.59,-117.36C121.59,-124.44 143.28,-132.73 163,-139.62 167.48,-141.19 172.18,-142.77 176.88,-144.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.7,-147.61 186.29,-147.33 177.84,-140.94 175.7,-147.61"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.38,-130.25 194.12,-130.25 194.12,-111 248.38,-111 248.38,-130.25"/>
-<text text-anchor="middle" x="221.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.4,-109.3C146.02,-111.57 165.82,-113.98 182.33,-116"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.86,-119.47 192.21,-117.2 182.7,-112.52 181.86,-119.47"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.88,-93.25 195.62,-93.25 195.62,-74 246.88,-74 246.88,-93.25"/>
-<text text-anchor="middle" x="221.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.4,-94.36C146.74,-92.12 167.37,-89.74 184.26,-87.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.25,-91.31 193.78,-86.68 183.45,-84.36 184.25,-91.31"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.25,-56.25 195.25,-56.25 195.25,-37 247.25,-37 247.25,-56.25"/>
-<text text-anchor="middle" x="221.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.58,-86C122.39,-79.21 143.66,-71.29 163,-64.62 169.71,-62.31 176.9,-59.96 183.84,-57.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.85,-61.09 193.34,-54.76 182.75,-54.42 184.85,-61.09"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279.5,-19.25 163,-19.25 163,0 279.5,0 279.5,-19.25"/>
-<text text-anchor="middle" x="221.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.43,-86.03C100.15,-69.51 131.8,-43.65 163,-27.62 165.69,-26.24 168.5,-24.95 171.38,-23.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.46,-27.06 180.54,-20.21 169.95,-20.53 172.46,-27.06"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="390.38,-222.25 331.62,-222.25 331.62,-203 390.38,-203 390.38,-222.25"/>
-<text text-anchor="middle" x="361" y="-208.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.71,-166.71C262.91,-169.31 271.61,-172.34 279.5,-175.62 296.2,-182.59 299.09,-187 315.5,-194.62 318.08,-195.82 320.76,-197.02 323.47,-198.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="321.96,-201.36 332.53,-202.01 324.67,-194.91 321.96,-201.36"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.12,-185.25 324.88,-185.25 324.88,-166 397.12,-166 397.12,-185.25"/>
-<text text-anchor="middle" x="361" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.55,-161.85C272.01,-164.13 293.9,-166.99 313.2,-169.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="312.65,-172.97 323.02,-170.79 313.56,-166.03 312.65,-172.97"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="386.62,-148.25 335.38,-148.25 335.38,-129 386.62,-129 386.62,-148.25"/>
-<text text-anchor="middle" x="361" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.55,-153.17C275.35,-150.3 302.42,-146.57 323.92,-143.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="324.29,-147.08 333.72,-142.25 323.34,-140.15 324.29,-147.08"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="406.5,-111.25 315.5,-111.25 315.5,-92 406.5,-92 406.5,-111.25"/>
-<text text-anchor="middle" x="361" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.76,-148.66C262.96,-146.06 271.65,-143 279.5,-139.62 296.32,-132.4 298.99,-127.52 315.5,-119.62 318.07,-118.4 320.74,-117.18 323.44,-115.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="324.65,-119.28 332.49,-112.16 321.92,-112.83 324.65,-119.28"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_ae868ad43698a1d69ba46ea3827d7d2c3_cgraph_org.svg b/d8/d77/namespacemachine__learning_ae868ad43698a1d69ba46ea3827d7d2c3_cgraph_org.svg
deleted file mode 100644
index 4ae12cb20..000000000
--- a/d8/d77/namespacemachine__learning_ae868ad43698a1d69ba46ea3827d7d2c3_cgraph_org.svg
+++ /dev/null
@@ -1,202 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::update_weights Pages: 1 -->
-<svg width="415pt" height="230pt"
- viewBox="0.00 0.00 414.50 230.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 226.25)">
-<title>machine_learning::update_weights</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-116.88 0,-116.88 0,-86.38 127,-86.38 127,-116.88"/>
-<text text-anchor="start" x="8" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::update</text>
-<text text-anchor="middle" x="63.5" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">_weights</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.88,-204.25 195.62,-204.25 195.62,-185 246.88,-185 246.88,-204.25"/>
-<text text-anchor="middle" x="221.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.05,-117.14C99.69,-133.88 131.51,-160.32 163,-176.62 169.7,-180.09 177.18,-183.04 184.48,-185.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.24,-188.76 193.83,-188.36 185.3,-182.07 183.24,-188.76"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.38,-167.25 188.12,-167.25 188.12,-148 254.38,-148 254.38,-167.25"/>
-<text text-anchor="middle" x="221.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_min_2d</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.59,-117.36C121.59,-124.44 143.28,-132.73 163,-139.62 167.48,-141.19 172.18,-142.77 176.88,-144.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.7,-147.61 186.29,-147.33 177.84,-140.94 175.7,-147.61"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.38,-130.25 194.12,-130.25 194.12,-111 248.38,-111 248.38,-130.25"/>
-<text text-anchor="middle" x="221.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.4,-109.3C146.02,-111.57 165.82,-113.98 182.33,-116"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.86,-119.47 192.21,-117.2 182.7,-112.52 181.86,-119.47"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.88,-93.25 195.62,-93.25 195.62,-74 246.88,-74 246.88,-93.25"/>
-<text text-anchor="middle" x="221.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.4,-94.36C146.74,-92.12 167.37,-89.74 184.26,-87.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.25,-91.31 193.78,-86.68 183.45,-84.36 184.25,-91.31"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.25,-56.25 195.25,-56.25 195.25,-37 247.25,-37 247.25,-56.25"/>
-<text text-anchor="middle" x="221.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.58,-86C122.39,-79.21 143.66,-71.29 163,-64.62 169.71,-62.31 176.9,-59.96 183.84,-57.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.85,-61.09 193.34,-54.76 182.75,-54.42 184.85,-61.09"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279.5,-19.25 163,-19.25 163,0 279.5,0 279.5,-19.25"/>
-<text text-anchor="middle" x="221.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::sum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.43,-86.03C100.15,-69.51 131.8,-43.65 163,-27.62 165.69,-26.24 168.5,-24.95 171.38,-23.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.46,-27.06 180.54,-20.21 169.95,-20.53 172.46,-27.06"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="390.38,-222.25 331.62,-222.25 331.62,-203 390.38,-203 390.38,-222.25"/>
-<text text-anchor="middle" x="361" y="-208.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.71,-166.71C262.91,-169.31 271.61,-172.34 279.5,-175.62 296.2,-182.59 299.09,-187 315.5,-194.62 318.08,-195.82 320.76,-197.02 323.47,-198.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="321.96,-201.36 332.53,-202.01 324.67,-194.91 321.96,-201.36"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.12,-185.25 324.88,-185.25 324.88,-166 397.12,-166 397.12,-185.25"/>
-<text text-anchor="middle" x="361" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.55,-161.85C272.01,-164.13 293.9,-166.99 313.2,-169.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="312.65,-172.97 323.02,-170.79 313.56,-166.03 312.65,-172.97"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="386.62,-148.25 335.38,-148.25 335.38,-129 386.62,-129 386.62,-148.25"/>
-<text text-anchor="middle" x="361" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.55,-153.17C275.35,-150.3 302.42,-146.57 323.92,-143.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="324.29,-147.08 333.72,-142.25 323.34,-140.15 324.29,-147.08"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="406.5,-111.25 315.5,-111.25 315.5,-92 406.5,-92 406.5,-111.25"/>
-<text text-anchor="middle" x="361" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.76,-148.66C262.96,-146.06 271.65,-143 279.5,-139.62 296.32,-132.4 298.99,-127.52 315.5,-119.62 318.07,-118.4 320.74,-117.18 323.44,-115.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="324.65,-119.28 332.49,-112.16 321.92,-112.83 324.65,-119.28"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.map b/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.map
deleted file mode 100644
index 2b247eafd..000000000
--- a/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="machine_learning::operator&lt;&lt;" name="machine_learning::operator&lt;&lt;">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,199,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/ios_base/precision.html#" title=" " alt="" coords="247,5,401,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="199,16,231,16,231,21,199,21"/>
-</map>
diff --git a/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.md5 b/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.md5
deleted file mode 100644
index ac89327b0..000000000
--- a/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7f1dc6e9d6cb9a5a6d5f47948242c662
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.svg b/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.svg
deleted file mode 100644
index 1df3fde77..000000000
--- a/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::operator&lt;&lt; Pages: 1 -->
-<svg width="305pt" height="27pt"
- viewBox="0.00 0.00 304.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>machine_learning::operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="145,-19.25 0,-19.25 0,0 145,0 145,-19.25"/>
-<text text-anchor="middle" x="72.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.75,-19.25 181,-19.25 181,0 296.75,0 296.75,-19.25"/>
-<text text-anchor="middle" x="238.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.12,-9.62C153.08,-9.62 161.18,-9.62 169.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.05,-13.13 179.05,-9.63 169.05,-6.13 169.05,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph_org.svg b/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph_org.svg
deleted file mode 100644
index 50ce0d6c2..000000000
--- a/d8/d77/namespacemachine__learning_af4986b23760039711848155739c31b35_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::operator&lt;&lt; Pages: 1 -->
-<svg width="305pt" height="27pt"
- viewBox="0.00 0.00 304.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>machine_learning::operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="145,-19.25 0,-19.25 0,0 145,0 145,-19.25"/>
-<text text-anchor="middle" x="72.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.75,-19.25 181,-19.25 181,0 296.75,0 296.75,-19.25"/>
-<text text-anchor="middle" x="238.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ostream::precision</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.12,-9.62C153.08,-9.62 161.18,-9.62 169.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.05,-13.13 179.05,-9.63 169.05,-6.13 169.05,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_af801bf30591ca6b2c38ff4fed0ded23f_cgraph.map b/d8/d77/namespacemachine__learning_af801bf30591ca6b2c38ff4fed0ded23f_cgraph.map
deleted file mode 100644
index ae93e77c3..000000000
--- a/d8/d77/namespacemachine__learning_af801bf30591ca6b2c38ff4fed0ded23f_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="machine_learning::equal_shuffle" name="machine_learning::equal_shuffle">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,134,167,174"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="248,5,319,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="104,131,151,86,181,62,213,40,232,31,234,35,216,44,184,66,155,90,108,135"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="249,55,318,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="127,131,214,90,233,82,235,87,216,95,129,136"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/system_clock/now.html#" title=" " alt="" coords="215,104,352,145"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="167,140,199,135,200,140,167,145"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="247,169,320,195"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="167,163,232,172,231,178,167,168"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="244,219,323,244"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="136,173,216,205,230,210,228,215,214,210,134,178"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="244,268,322,294"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="110,173,157,214,216,255,231,262,229,267,213,259,153,218,106,177"/>
-</map>
diff --git a/d8/d77/namespacemachine__learning_af801bf30591ca6b2c38ff4fed0ded23f_cgraph.md5 b/d8/d77/namespacemachine__learning_af801bf30591ca6b2c38ff4fed0ded23f_cgraph.md5
deleted file mode 100644
index d3c100bfb..000000000
--- a/d8/d77/namespacemachine__learning_af801bf30591ca6b2c38ff4fed0ded23f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a8697bb0e2ed276d977370cfd216c387
\ No newline at end of file
diff --git a/d8/d77/namespacemachine__learning_af801bf30591ca6b2c38ff4fed0ded23f_cgraph.svg b/d8/d77/namespacemachine__learning_af801bf30591ca6b2c38ff4fed0ded23f_cgraph.svg
deleted file mode 100644
index 9fd91990b..000000000
--- a/d8/d77/namespacemachine__learning_af801bf30591ca6b2c38ff4fed0ded23f_cgraph.svg
+++ /dev/null
@@ -1,157 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::equal_shuffle Pages: 1 -->
-<svg width="268pt" height="224pt"
- viewBox="0.00 0.00 268.00 224.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 220.25)">
-<title>machine_learning::equal_shuffle</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="121,-119.88 0,-119.88 0,-89.38 121,-89.38 121,-119.88"/>
-<text text-anchor="start" x="8" y="-106.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::equal</text>
-<text text-anchor="middle" x="60.5" y="-95.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235.25,-216.25 181.75,-216.25 181.75,-197 235.25,-197 235.25,-216.25"/>
-<text text-anchor="middle" x="208.5" y="-202.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.64,-120.25C93.15,-138.79 124.65,-169.59 157,-188.62 161.36,-191.19 166.14,-193.48 170.98,-195.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.48,-198.66 180.07,-198.92 171.95,-192.12 169.48,-198.66"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.12,-179.25 182.88,-179.25 182.88,-160 234.12,-160 234.12,-179.25"/>
-<text text-anchor="middle" x="208.5" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.15,-120.25C110.72,-129.5 135.01,-141.21 157,-150.62 161.73,-152.65 166.75,-154.68 171.73,-156.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.4,-159.86 180.99,-160.15 172.9,-153.32 170.4,-159.86"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260,-141.88 157,-141.88 157,-111.38 260,-111.38 260,-141.88"/>
-<text text-anchor="start" x="165" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::system</text>
-<text text-anchor="middle" x="208.5" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.31,-113.64C129.33,-114.85 137.58,-116.09 145.65,-117.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.97,-120.74 155.38,-118.77 146.02,-113.82 144.97,-120.74"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235.62,-93.25 181.38,-93.25 181.38,-74 235.62,-74 235.62,-93.25"/>
-<text text-anchor="middle" x="208.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.31,-96.02C137.71,-93.66 155.03,-91.17 169.81,-89.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.16,-92.53 179.56,-87.64 169.16,-85.6 170.16,-92.53"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.25,-56.25 178.75,-56.25 178.75,-37 238.25,-37 238.25,-56.25"/>
-<text text-anchor="middle" x="208.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.59,-88.96C115.39,-81.38 137.22,-72.29 157,-64.62 160.43,-63.3 164,-61.95 167.59,-60.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.67,-63.96 176.87,-57.25 166.28,-57.38 168.67,-63.96"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.88,-19.25 179.12,-19.25 179.12,0 237.88,0 237.88,-19.25"/>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.17,-89.17C95.16,-72.15 126.15,-44.9 157,-27.62 160.58,-25.62 164.43,-23.77 168.34,-22.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.28,-25.47 177.31,-18.56 166.72,-18.96 169.28,-25.47"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d77/namespacemachine__learning_af801bf30591ca6b2c38ff4fed0ded23f_cgraph_org.svg b/d8/d77/namespacemachine__learning_af801bf30591ca6b2c38ff4fed0ded23f_cgraph_org.svg
deleted file mode 100644
index 08c1b65b6..000000000
--- a/d8/d77/namespacemachine__learning_af801bf30591ca6b2c38ff4fed0ded23f_cgraph_org.svg
+++ /dev/null
@@ -1,131 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::equal_shuffle Pages: 1 -->
-<svg width="268pt" height="224pt"
- viewBox="0.00 0.00 268.00 224.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 220.25)">
-<title>machine_learning::equal_shuffle</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="121,-119.88 0,-119.88 0,-89.38 121,-89.38 121,-119.88"/>
-<text text-anchor="start" x="8" y="-106.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::equal</text>
-<text text-anchor="middle" x="60.5" y="-95.12" font-family="Helvetica,sans-Serif" font-size="10.00">_shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235.25,-216.25 181.75,-216.25 181.75,-197 235.25,-197 235.25,-216.25"/>
-<text text-anchor="middle" x="208.5" y="-202.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.64,-120.25C93.15,-138.79 124.65,-169.59 157,-188.62 161.36,-191.19 166.14,-193.48 170.98,-195.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.48,-198.66 180.07,-198.92 171.95,-192.12 169.48,-198.66"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.12,-179.25 182.88,-179.25 182.88,-160 234.12,-160 234.12,-179.25"/>
-<text text-anchor="middle" x="208.5" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.15,-120.25C110.72,-129.5 135.01,-141.21 157,-150.62 161.73,-152.65 166.75,-154.68 171.73,-156.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.4,-159.86 180.99,-160.15 172.9,-153.32 170.4,-159.86"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260,-141.88 157,-141.88 157,-111.38 260,-111.38 260,-141.88"/>
-<text text-anchor="start" x="165" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::system</text>
-<text text-anchor="middle" x="208.5" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.31,-113.64C129.33,-114.85 137.58,-116.09 145.65,-117.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.97,-120.74 155.38,-118.77 146.02,-113.82 144.97,-120.74"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235.62,-93.25 181.38,-93.25 181.38,-74 235.62,-74 235.62,-93.25"/>
-<text text-anchor="middle" x="208.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.31,-96.02C137.71,-93.66 155.03,-91.17 169.81,-89.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.16,-92.53 179.56,-87.64 169.16,-85.6 170.16,-92.53"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.25,-56.25 178.75,-56.25 178.75,-37 238.25,-37 238.25,-56.25"/>
-<text text-anchor="middle" x="208.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.59,-88.96C115.39,-81.38 137.22,-72.29 157,-64.62 160.43,-63.3 164,-61.95 167.59,-60.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.67,-63.96 176.87,-57.25 166.28,-57.38 168.67,-63.96"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.88,-19.25 179.12,-19.25 179.12,0 237.88,0 237.88,-19.25"/>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.17,-89.17C95.16,-72.15 126.15,-44.9 157,-27.62 160.58,-25.62 164.43,-23.77 168.34,-22.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.28,-25.47 177.31,-18.56 166.72,-18.96 169.28,-25.47"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d7a/sha1_8cpp.html b/d8/d7a/sha1_8cpp.html
index 43d8777c7..3ba34ab69 100644
--- a/d8/d7a/sha1_8cpp.html
+++ b/d8/d7a/sha1_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: hashing/sha1.cpp File Reference</title>
+<title>TheAlgorithms/C++: hashing/sha1.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -126,7 +143,9 @@ Include dependency graph for sha1.cpp:</div>
 <div class="dyncontent">
 <div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d3/d4c/sha1_8cpp__incl.svg" width="100%" height="383"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
 </div>
-</div><table class="memberdecls">
+</div>
+<p><a href="../../d8/d7a/sha1_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d0c/namespacehashing.html">hashing</a></td></tr>
@@ -138,16 +157,16 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:acf6bd970f29a68702bdbdfe8338e45e0" id="r_acf6bd970f29a68702bdbdfe8338e45e0"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acf6bd970f29a68702bdbdfe8338e45e0">hashing::sha1::leftRotate32bits</a> (uint32_t n, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> rotate)</td></tr>
+<tr class="memitem:acf6bd970f29a68702bdbdfe8338e45e0" id="r_acf6bd970f29a68702bdbdfe8338e45e0"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acf6bd970f29a68702bdbdfe8338e45e0">hashing::sha1::leftRotate32bits</a> (uint32_t n, std::size_t rotate)</td></tr>
 <tr class="memdesc:acf6bd970f29a68702bdbdfe8338e45e0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Rotates the bits of a 32-bit unsigned integer.  <br /></td></tr>
 <tr class="separator:acf6bd970f29a68702bdbdfe8338e45e0"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aada0803ef851d831b7a290a924e3c228" id="r_aada0803ef851d831b7a290a924e3c228"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a> (void *sig)</td></tr>
+<tr class="memitem:aada0803ef851d831b7a290a924e3c228" id="r_aada0803ef851d831b7a290a924e3c228"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a> (void *sig)</td></tr>
 <tr class="memdesc:aada0803ef851d831b7a290a924e3c228"><td class="mdescLeft">&#160;</td><td class="mdescRight">Transforms the 160-bit SHA-1 signature into a 40 char hex string.  <br /></td></tr>
 <tr class="separator:aada0803ef851d831b7a290a924e3c228"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a7be3471f7e489d7d0df42b97a48bf141" id="r_a7be3471f7e489d7d0df42b97a48bf141"><td class="memItemLeft" align="right" valign="top">void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7be3471f7e489d7d0df42b97a48bf141">hashing::sha1::hash_bs</a> (const void *input_bs, uint64_t input_size)</td></tr>
 <tr class="memdesc:a7be3471f7e489d7d0df42b97a48bf141"><td class="mdescLeft">&#160;</td><td class="mdescRight">The SHA-1 algorithm itself, taking in a bytestring.  <br /></td></tr>
 <tr class="separator:a7be3471f7e489d7d0df42b97a48bf141"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2397f2444a05e4d1487c67e215410d3c" id="r_a2397f2444a05e4d1487c67e215410d3c"><td class="memItemLeft" align="right" valign="top">void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;message)</td></tr>
+<tr class="memitem:a2397f2444a05e4d1487c67e215410d3c" id="r_a2397f2444a05e4d1487c67e215410d3c"><td class="memItemLeft" align="right" valign="top">void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a> (const std::string &amp;message)</td></tr>
 <tr class="memdesc:a2397f2444a05e4d1487c67e215410d3c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Converts the string to bytestring and calls the main algorithm.  <br /></td></tr>
 <tr class="separator:a2397f2444a05e4d1487c67e215410d3c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -168,6 +187,8 @@ Functions</h2></td></tr>
 Algorithm</h3>
 <p>The first step of the algorithm is to pad the message for its length to be a multiple of 64 (bytes). This is done by first adding 0x80 (10000000) and then only zeroes until the last 8 bytes must be filled, where then the 64 bit size of the input will be added</p>
 <p>Once this is done, the algo breaks down this padded message into 64 bytes chunks. Each chunk is used for one <em>round</em>, a round breaks the chunk into 16 blocks of 4 bytes. These 16 blocks are then extended to 80 blocks using <a class="el" href="../../d7/d47/namespace_x_o_r.html" title="Functions for XOR cipher algorithm.">XOR</a> operations on existing blocks (see code for more details). The algorithm will then update its 160-bit state (here represented used 5 32-bits integer) using partial hashes computed using special functions on the blocks previously built. Please take a look at the <a href="https://en.wikipedia.org/wiki/SHA-1#SHA-1_pseudocode" target="_blank">wikipedia article</a> for more precision on these operations </p><dl class="section note"><dt>Note</dt><dd>This is a simple implementation for a byte string but some implmenetations can work on bytestream, messages of unknown length. </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/d7a/sha1_8cpp_source.html">sha1.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a2397f2444a05e4d1487c67e215410d3c" name="a2397f2444a05e4d1487c67e215410d3c"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a2397f2444a05e4d1487c67e215410d3c">&#9670;&#160;</a></span>hash()</h2>
@@ -178,7 +199,7 @@ Algorithm</h3>
         <tr>
           <td class="memname">void * hashing::sha1::hash </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>message</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>message</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -192,17 +213,13 @@ Algorithm</h3>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void* Pointer to the SHA-1 signature </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  211</span>                                     {</div>
-<div class="line"><span class="lineno">  212</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425">hash_bs</a>(&amp;message[0], message.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>());</div>
-<div class="line"><span class="lineno">  213</span>}</div>
-<div class="ttc" id="amd5_8cpp_html_a5341431cef7fcfc33794326e1deb2425"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425">hashing::md5::hash_bs</a></div><div class="ttdeci">void * hash_bs(const void *input_bs, uint64_t input_size)</div><div class="ttdoc">The MD5 algorithm itself, taking in a bytestring.</div><div class="ttdef"><b>Definition</b> md5.cpp:139</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.svg" width="308" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d8/d7a/sha1_8cpp_source.html#l00211">211</a> of file <a class="el" href="../../d8/d7a/sha1_8cpp_source.html">sha1.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  211</span>                                     {</div>
+<div class="line"><span class="lineno">  212</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425">hash_bs</a>(&amp;message[0], message.size());</div>
+<div class="line"><span class="lineno">  213</span>}</div>
+<div class="ttc" id="amd5_8cpp_html_a5341431cef7fcfc33794326e1deb2425"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425">hashing::md5::hash_bs</a></div><div class="ttdeci">void * hash_bs(const void *input_bs, uint64_t input_size)</div><div class="ttdoc">The MD5 algorithm itself, taking in a bytestring.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d96/md5_8cpp_source.html#l00139">md5.cpp:139</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7be3471f7e489d7d0df42b97a48bf141" name="a7be3471f7e489d7d0df42b97a48bf141"></a>
@@ -233,6 +250,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void* Pointer to the 160-bit signature </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d7a/sha1_8cpp_source.html#l00084">84</a> of file <a class="el" href="../../d8/d7a/sha1_8cpp_source.html">sha1.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   84</span>                                                         {</div>
 <div class="line"><span class="lineno">   85</span>    <span class="keyword">auto</span>* input = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>uint8_t*<span class="keyword">&gt;</span>(input_bs);</div>
 <div class="line"><span class="lineno">   86</span> </div>
@@ -254,10 +273,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  102</span>    }</div>
 <div class="line"><span class="lineno">  103</span> </div>
 <div class="line"><span class="lineno">  104</span>    <span class="comment">// Allocate the memory for the padded message</span></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&lt;uint8_t&gt;</a> padded_message(padded_message_size);</div>
+<div class="line"><span class="lineno">  105</span>    std::vector&lt;uint8_t&gt; padded_message(padded_message_size);</div>
 <div class="line"><span class="lineno">  106</span> </div>
 <div class="line"><span class="lineno">  107</span>    <span class="comment">// Beginning of the padded message is the original message</span></div>
-<div class="line"><span class="lineno">  108</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/copy.html">std::copy</a>(input, input + input_size, padded_message.begin());</div>
+<div class="line"><span class="lineno">  108</span>    std::copy(input, input + input_size, padded_message.begin());</div>
 <div class="line"><span class="lineno">  109</span> </div>
 <div class="line"><span class="lineno">  110</span>    <span class="comment">// Afterwards comes a single 1 bit and then only zeroes</span></div>
 <div class="line"><span class="lineno">  111</span>    padded_message[input_size] = 1 &lt;&lt; 7;  <span class="comment">// 10000000</span></div>
@@ -277,7 +296,7 @@ Here is the call graph for this function:</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>    <span class="comment">// Already allocate memory for blocks</span></div>
-<div class="line"><span class="lineno">  128</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;uint32_t, 80&gt;</a> blocks{};</div>
+<div class="line"><span class="lineno">  128</span>    std::array&lt;uint32_t, 80&gt; blocks{};</div>
 <div class="line"><span class="lineno">  129</span> </div>
 <div class="line"><span class="lineno">  130</span>    <span class="comment">// Rounds</span></div>
 <div class="line"><span class="lineno">  131</span>    <span class="keywordflow">for</span> (uint64_t chunk = 0; chunk * 64 &lt; padded_message_size; chunk++) {</div>
@@ -354,17 +373,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  202</span> </div>
 <div class="line"><span class="lineno">  203</span>    <span class="keywordflow">return</span> sig;</div>
 <div class="line"><span class="lineno">  204</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:115</div></div>
-<div class="ttc" id="acopy_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/copy.html">std::copy</a></div><div class="ttdeci">T copy(T... args)</div></div>
-<div class="ttc" id="amd5_8cpp_html_add2bf982d5dd64a45d13cba52c2b371d"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d">hashing::md5::leftRotate32bits</a></div><div class="ttdeci">uint32_t leftRotate32bits(uint32_t n, std::size_t rotate)</div><div class="ttdoc">Rotates the bits of a 32-bit unsigned integer.</div><div class="ttdef"><b>Definition</b> md5.cpp:67</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.svg" width="340" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00115">composite_simpson_rule.cpp:115</a></div></div>
+<div class="ttc" id="amd5_8cpp_html_add2bf982d5dd64a45d13cba52c2b371d"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d">hashing::md5::leftRotate32bits</a></div><div class="ttdeci">uint32_t leftRotate32bits(uint32_t n, std::size_t rotate)</div><div class="ttdoc">Rotates the bits of a 32-bit unsigned integer.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d96/md5_8cpp_source.html#l00067">md5.cpp:67</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac9e1a11f44135b890dd10a00e73b5661" name="ac9e1a11f44135b890dd10a00e73b5661"></a>
@@ -392,40 +403,31 @@ Here is the call graph for this function:</div>
 
 <p>Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d7a/sha1_8cpp_source.html#l00275">275</a> of file <a class="el" href="../../d8/d7a/sha1_8cpp_source.html">sha1.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  275</span>                          {</div>
 <div class="line"><span class="lineno">  276</span>    <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
-<div class="line"><span class="lineno">  277</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> input;</div>
-<div class="line"><span class="lineno">  278</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter a message to be hashed (Ctrl-C to exit): &quot;</span></div>
-<div class="line"><span class="lineno">  279</span>                  &lt;&lt; <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">  280</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html">std::getline</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a>, input);</div>
+<div class="line"><span class="lineno">  277</span>        std::string input;</div>
+<div class="line"><span class="lineno">  278</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter a message to be hashed (Ctrl-C to exit): &quot;</span></div>
+<div class="line"><span class="lineno">  279</span>                  &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  280</span>        std::getline(std::cin, input);</div>
 <div class="line"><span class="lineno">  281</span>        <span class="keywordtype">void</span>* sig = <a class="code hl_function" href="#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a>(input);</div>
-<div class="line"><span class="lineno">  282</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hash is: &quot;</span> &lt;&lt; <a class="code hl_function" href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig) &lt;&lt; <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">  282</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Hash is: &quot;</span> &lt;&lt; <a class="code hl_function" href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  283</span> </div>
 <div class="line"><span class="lineno">  284</span>        <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
-<div class="line"><span class="lineno">  285</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Want to enter another message? (y/n) &quot;</span>;</div>
-<div class="line"><span class="lineno">  286</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html">std::getline</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a>, input);</div>
-<div class="line"><span class="lineno">  287</span>            <span class="keywordflow">if</span> (input.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html">compare</a>(<span class="stringliteral">&quot;y&quot;</span>) == 0) {</div>
+<div class="line"><span class="lineno">  285</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Want to enter another message? (y/n) &quot;</span>;</div>
+<div class="line"><span class="lineno">  286</span>            std::getline(std::cin, input);</div>
+<div class="line"><span class="lineno">  287</span>            <span class="keywordflow">if</span> (input.compare(<span class="stringliteral">&quot;y&quot;</span>) == 0) {</div>
 <div class="line"><span class="lineno">  288</span>                <span class="keywordflow">break</span>;</div>
-<div class="line"><span class="lineno">  289</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (input.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html">compare</a>(<span class="stringliteral">&quot;n&quot;</span>) == 0) {</div>
+<div class="line"><span class="lineno">  289</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (input.compare(<span class="stringliteral">&quot;n&quot;</span>) == 0) {</div>
 <div class="line"><span class="lineno">  290</span>                <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  291</span>            }</div>
 <div class="line"><span class="lineno">  292</span>        }</div>
 <div class="line"><span class="lineno">  293</span>    }</div>
 <div class="line"><span class="lineno">  294</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="acompare_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html">std::string::compare</a></div><div class="ttdeci">T compare(T... args)</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="agetline_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html">std::getline</a></div><div class="ttdeci">T getline(T... args)</div></div>
-<div class="ttc" id="asha1_8cpp_html_a2397f2444a05e4d1487c67e215410d3c"><div class="ttname"><a href="#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> sha1.cpp:211</div></div>
-<div class="ttc" id="asha1_8cpp_html_aada0803ef851d831b7a290a924e3c228"><div class="ttname"><a href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a></div><div class="ttdeci">std::string sig2hex(void *sig)</div><div class="ttdoc">Transforms the 160-bit SHA-1 signature into a 40 char hex string.</div><div class="ttdef"><b>Definition</b> sha1.cpp:67</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.svg" width="278" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asha1_8cpp_html_a2397f2444a05e4d1487c67e215410d3c"><div class="ttname"><a href="#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d7a/sha1_8cpp_source.html#l00211">sha1.cpp:211</a></div></div>
+<div class="ttc" id="asha1_8cpp_html_aada0803ef851d831b7a290a924e3c228"><div class="ttname"><a href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a></div><div class="ttdeci">std::string sig2hex(void *sig)</div><div class="ttdoc">Transforms the 160-bit SHA-1 signature into a 40 char hex string.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d7a/sha1_8cpp_source.html#l00067">sha1.cpp:67</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="acf6bd970f29a68702bdbdfe8338e45e0" name="acf6bd970f29a68702bdbdfe8338e45e0"></a>
@@ -442,7 +444,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></td>          <td class="paramname"><span class="paramname"><em>rotate</em></span>&#160;)</td>
+          <td class="paramtype">std::size_t</td>          <td class="paramname"><span class="paramname"><em>rotate</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -456,10 +458,11 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>uint32_t The rotated integer </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d7a/sha1_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d8/d7a/sha1_8cpp_source.html">sha1.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   58</span>                                                        {</div>
-<div class="line"><span class="lineno">   59</span>    <span class="keywordflow">return</span> (n &lt;&lt; rotate) | (n &gt;&gt; (32 - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/rotate.html">rotate</a>));</div>
+<div class="line"><span class="lineno">   59</span>    <span class="keywordflow">return</span> (n &lt;&lt; rotate) | (n &gt;&gt; (32 - rotate));</div>
 <div class="line"><span class="lineno">   60</span>}</div>
-<div class="ttc" id="arotate_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/rotate.html">std::rotate</a></div><div class="ttdeci">T rotate(T... args)</div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -480,6 +483,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d7a/sha1_8cpp_source.html#l00300">300</a> of file <a class="el" href="../../d8/d7a/sha1_8cpp_source.html">sha1.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  300</span>           {</div>
 <div class="line"><span class="lineno">  301</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  302</span> </div>
@@ -488,14 +493,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  305</span>    <a class="code hl_function" href="#ac9e1a11f44135b890dd10a00e73b5661">interactive</a>();</div>
 <div class="line"><span class="lineno">  306</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  307</span>}</div>
-<div class="ttc" id="asha1_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations of well-known SHA-1 hashes.</div><div class="ttdef"><b>Definition</b> sha1.cpp:221</div></div>
-<div class="ttc" id="asha1_8cpp_html_ac9e1a11f44135b890dd10a00e73b5661"><div class="ttname"><a href="#ac9e1a11f44135b890dd10a00e73b5661">interactive</a></div><div class="ttdeci">static void interactive()</div><div class="ttdoc">Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed.</div><div class="ttdef"><b>Definition</b> sha1.cpp:275</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="375" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asha1_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations of well-known SHA-1 hashes.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d7a/sha1_8cpp_source.html#l00221">sha1.cpp:221</a></div></div>
+<div class="ttc" id="asha1_8cpp_html_ac9e1a11f44135b890dd10a00e73b5661"><div class="ttname"><a href="#ac9e1a11f44135b890dd10a00e73b5661">interactive</a></div><div class="ttdeci">static void interactive()</div><div class="ttdoc">Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d7a/sha1_8cpp_source.html#l00275">sha1.cpp:275</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aada0803ef851d831b7a290a924e3c228" name="aada0803ef851d831b7a290a924e3c228"></a>
@@ -505,7 +505,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> hashing::sha1::sig2hex </td>
+          <td class="memname">std::string hashing::sha1::sig2hex </td>
           <td>(</td>
           <td class="paramtype">void *</td>          <td class="paramname"><span class="paramname"><em>sig</em></span></td><td>)</td>
           <td></td>
@@ -520,18 +520,19 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
-<dl class="section return"><dt>Returns</dt><dd><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> The hex signature </dd></dl>
+<dl class="section return"><dt>Returns</dt><dd>std::string The hex signature </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d7a/sha1_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../d8/d7a/sha1_8cpp_source.html">sha1.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   67</span>                             {</div>
 <div class="line"><span class="lineno">   68</span>    <span class="keyword">const</span> <span class="keywordtype">char</span>* hexChars = <span class="stringliteral">&quot;0123456789abcdef&quot;</span>;</div>
 <div class="line"><span class="lineno">   69</span>    <span class="keyword">auto</span>* intsig = <span class="keyword">static_cast&lt;</span>uint8_t*<span class="keyword">&gt;</span>(sig);</div>
-<div class="line"><span class="lineno">   70</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/hex.html">hex</a> = <span class="stringliteral">&quot;&quot;</span>;</div>
+<div class="line"><span class="lineno">   70</span>    std::string hex = <span class="stringliteral">&quot;&quot;</span>;</div>
 <div class="line"><span class="lineno">   71</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; 20; i++) {</div>
-<div class="line"><span class="lineno">   72</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/hex.html">hex</a>.push_back(hexChars[(intsig[i] &gt;&gt; 4) &amp; 0xF]);</div>
-<div class="line"><span class="lineno">   73</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/hex.html">hex</a>.push_back(hexChars[(intsig[i]) &amp; 0xF]);</div>
+<div class="line"><span class="lineno">   72</span>        hex.push_back(hexChars[(intsig[i] &gt;&gt; 4) &amp; 0xF]);</div>
+<div class="line"><span class="lineno">   73</span>        hex.push_back(hexChars[(intsig[i]) &amp; 0xF]);</div>
 <div class="line"><span class="lineno">   74</span>    }</div>
-<div class="line"><span class="lineno">   75</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/hex.html">hex</a>;</div>
+<div class="line"><span class="lineno">   75</span>    <span class="keywordflow">return</span> hex;</div>
 <div class="line"><span class="lineno">   76</span>}</div>
-<div class="ttc" id="ahex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/hex.html">std::hex</a></div><div class="ttdeci">T hex(T... args)</div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -560,12 +561,14 @@ Here is the call graph for this function:</div>
 
 <p>Self-test implementations of well-known SHA-1 hashes. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d7a/sha1_8cpp_source.html#l00221">221</a> of file <a class="el" href="../../d8/d7a/sha1_8cpp_source.html">sha1.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  221</span>                   {</div>
 <div class="line"><span class="lineno">  222</span>    <span class="comment">// Hashes empty string and stores signature</span></div>
 <div class="line"><span class="lineno">  223</span>    <span class="keywordtype">void</span>* sig = <a class="code hl_function" href="#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a>(<span class="stringliteral">&quot;&quot;</span>);</div>
-<div class="line"><span class="lineno">  224</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hashing empty string&quot;</span> &lt;&lt; <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">  224</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hashing empty string&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  225</span>    <span class="comment">// Prints signature hex representation</span></div>
-<div class="line"><span class="lineno">  226</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  226</span>    std::cout &lt;&lt; <a class="code hl_function" href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig) &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  227</span>    <span class="comment">// Test with cassert wether sig is correct from expected value</span></div>
 <div class="line"><span class="lineno">  228</span>    assert(hashing::sha1::sig2hex(sig).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
 <div class="line"><span class="lineno">  229</span>               <span class="stringliteral">&quot;da39a3ee5e6b4b0d3255bfef95601890afd80709&quot;</span>) == 0);</div>
@@ -573,10 +576,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  231</span>    <span class="comment">// Hashes &quot;The quick brown fox jumps over the lazy dog&quot; and stores signature</span></div>
 <div class="line"><span class="lineno">  232</span>    <span class="keywordtype">void</span>* sig2 =</div>
 <div class="line"><span class="lineno">  233</span>        <a class="code hl_function" href="#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a>(<span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog&quot;</span>);</div>
-<div class="line"><span class="lineno">  234</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hashing The quick brown fox jumps over the lazy dog&quot;</span></div>
-<div class="line"><span class="lineno">  235</span>              &lt;&lt; <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">  234</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hashing The quick brown fox jumps over the lazy dog&quot;</span></div>
+<div class="line"><span class="lineno">  235</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  236</span>    <span class="comment">// Prints signature hex representation</span></div>
-<div class="line"><span class="lineno">  237</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig2) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  237</span>    std::cout &lt;&lt; <a class="code hl_function" href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig2) &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  238</span>    <span class="comment">// Test with cassert wether sig is correct from expected value</span></div>
 <div class="line"><span class="lineno">  239</span>    assert(hashing::sha1::sig2hex(sig2).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
 <div class="line"><span class="lineno">  240</span>               <span class="stringliteral">&quot;2fd4e1c67a2d28fced849ee1bb76e7391b93eb12&quot;</span>) == 0);</div>
@@ -585,11 +588,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  243</span>    <span class="comment">// additional period) and stores signature</span></div>
 <div class="line"><span class="lineno">  244</span>    <span class="keywordtype">void</span>* sig3 =</div>
 <div class="line"><span class="lineno">  245</span>        <a class="code hl_function" href="#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a>(<span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog.&quot;</span>);</div>
-<div class="line"><span class="lineno">  246</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hashing &quot;</span></div>
+<div class="line"><span class="lineno">  246</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hashing &quot;</span></div>
 <div class="line"><span class="lineno">  247</span>                 <span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog.&quot;</span></div>
-<div class="line"><span class="lineno">  248</span>              &lt;&lt; <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">  248</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  249</span>    <span class="comment">// Prints signature hex representation</span></div>
-<div class="line"><span class="lineno">  250</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig3) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  250</span>    std::cout &lt;&lt; <a class="code hl_function" href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig3) &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  251</span>    <span class="comment">// Test with cassert wether sig is correct from expected value</span></div>
 <div class="line"><span class="lineno">  252</span>    assert(hashing::sha1::sig2hex(sig3).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
 <div class="line"><span class="lineno">  253</span>               <span class="stringliteral">&quot;408d94384216f890ff7a0c3528e8bed1e0b01621&quot;</span>) == 0);</div>
@@ -598,23 +601,18 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  256</span>    <span class="comment">// and stores signature</span></div>
 <div class="line"><span class="lineno">  257</span>    <span class="keywordtype">void</span>* sig4 = <a class="code hl_function" href="#a2397f2444a05e4d1487c67e215410d3c">hashing::sha1::hash</a>(</div>
 <div class="line"><span class="lineno">  258</span>        <span class="stringliteral">&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789&quot;</span>);</div>
-<div class="line"><span class="lineno">  259</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div>
+<div class="line"><span class="lineno">  259</span>    std::cout</div>
 <div class="line"><span class="lineno">  260</span>        &lt;&lt; <span class="stringliteral">&quot;Hashing &quot;</span></div>
 <div class="line"><span class="lineno">  261</span>           <span class="stringliteral">&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789&quot;</span></div>
-<div class="line"><span class="lineno">  262</span>        &lt;&lt; <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">  262</span>        &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  263</span>    <span class="comment">// Prints signature hex representation</span></div>
-<div class="line"><span class="lineno">  264</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig4) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  264</span>    std::cout &lt;&lt; <a class="code hl_function" href="#aada0803ef851d831b7a290a924e3c228">hashing::sha1::sig2hex</a>(sig4) &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  265</span>    <span class="comment">// Test with cassert wether sig is correct from expected value</span></div>
 <div class="line"><span class="lineno">  266</span>    assert(hashing::sha1::sig2hex(sig4).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
 <div class="line"><span class="lineno">  267</span>               <span class="stringliteral">&quot;761c457bf73b14d27e9e9265c46f4b4dda11f940&quot;</span>) == 0);</div>
 <div class="line"><span class="lineno">  268</span>}</div>
-<div class="ttc" id="ashell__sort2_8cpp_html_a7eb77daed2cf1513f6d68c47a1c2db1c"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a></div><div class="ttdeci">int compare(const void *a, const void *b)</div><div class="ttdef"><b>Definition</b> shell_sort2.cpp:87</div></div>
-</div><!-- 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="../../d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ashell__sort2_8cpp_html_a7eb77daed2cf1513f6d68c47a1c2db1c"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a></div><div class="ttdeci">int compare(const void *a, const void *b)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d7a/shell__sort2_8cpp_source.html#l00087">shell_sort2.cpp:87</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.map b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.map
deleted file mode 100644
index 01cabcbd4..000000000
--- a/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="hashing::sha1::hash" name="hashing::sha1::hash">
-<area shape="rect" id="Node000001" title="Converts the string to bytestring and calls the main algorithm." alt="" coords="5,5,144,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="192,5,303,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="144,16,176,16,176,21,144,21"/>
-</map>
diff --git a/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.md5 b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.md5
deleted file mode 100644
index fdccb6b67..000000000
--- a/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-94585eb85ce9b2401e5c48df8265008f
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.svg b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.svg
deleted file mode 100644
index 937f7bc10..000000000
--- a/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha1::hash Pages: 1 -->
-<svg width="231pt" height="27pt"
- viewBox="0.00 0.00 231.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>hashing::sha1::hash</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Converts the string to bytestring and calls the main algorithm.">
-<polygon fill="#999999" stroke="#666666" points="103.75,-19.25 0,-19.25 0,0 103.75,0 103.75,-19.25"/>
-<text text-anchor="middle" x="51.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha1::hash</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.25,-19.25 139.75,-19.25 139.75,0 223.25,0 223.25,-19.25"/>
-<text text-anchor="middle" x="181.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.05,-9.62C111.97,-9.62 120.16,-9.62 128.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128,-13.13 138,-9.63 128,-6.13 128,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph_org.svg b/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph_org.svg
deleted file mode 100644
index 9f33cd925..000000000
--- a/d8/d7a/sha1_8cpp_a2397f2444a05e4d1487c67e215410d3c_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha1::hash Pages: 1 -->
-<svg width="231pt" height="27pt"
- viewBox="0.00 0.00 231.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>hashing::sha1::hash</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Converts the string to bytestring and calls the main algorithm.">
-<polygon fill="#999999" stroke="#666666" points="103.75,-19.25 0,-19.25 0,0 103.75,0 103.75,-19.25"/>
-<text text-anchor="middle" x="51.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha1::hash</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.25,-19.25 139.75,-19.25 139.75,0 223.25,0 223.25,-19.25"/>
-<text text-anchor="middle" x="181.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.05,-9.62C111.97,-9.62 120.16,-9.62 128.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128,-13.13 138,-9.63 128,-6.13 128,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.map b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.map
deleted file mode 100644
index 835ae5098..000000000
--- a/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="hashing::sha1::hash_bs" name="hashing::sha1::hash_bs">
-<area shape="rect" id="Node000001" title="The SHA&#45;1 algorithm itself, taking in a bytestring." alt="" coords="5,31,165,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="213,5,335,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="165,30,197,26,197,31,166,35"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/copy.html#" title=" " alt="" coords="236,55,312,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="166,51,221,58,221,63,165,56"/>
-</map>
diff --git a/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.md5 b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.md5
deleted file mode 100644
index 43e03d19a..000000000
--- a/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ac1d6f0c6635ecc64cd0c97ca0b26e99
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.svg b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.svg
deleted file mode 100644
index 1dc5e6447..000000000
--- a/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha1::hash_bs Pages: 1 -->
-<svg width="255pt" height="64pt"
- viewBox="0.00 0.00 255.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>hashing::sha1::hash_bs</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The SHA&#45;1 algorithm itself, taking in a bytestring.">
-<polygon fill="#999999" stroke="#666666" points="119.5,-37.25 0,-37.25 0,-18 119.5,-18 119.5,-37.25"/>
-<text text-anchor="middle" x="59.75" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha1::hash_bs</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.25,-56.25 155.5,-56.25 155.5,-37 247.25,-37 247.25,-56.25"/>
-<text text-anchor="middle" x="201.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.96,-35.68C127.85,-36.76 135.93,-37.86 143.77,-38.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.17,-42.37 153.55,-40.25 144.12,-35.44 143.17,-42.37"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/copy.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="229.62,-19.25 173.12,-19.25 173.12,0 229.62,0 229.62,-19.25"/>
-<text text-anchor="middle" x="201.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::copy</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.96,-19.99C134.08,-18.17 148.78,-16.28 161.7,-14.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.02,-18.1 171.49,-13.35 161.12,-11.16 162.02,-18.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph_org.svg b/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph_org.svg
deleted file mode 100644
index f80d7fc24..000000000
--- a/d8/d7a/sha1_8cpp_a7be3471f7e489d7d0df42b97a48bf141_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hashing::sha1::hash_bs Pages: 1 -->
-<svg width="255pt" height="64pt"
- viewBox="0.00 0.00 255.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>hashing::sha1::hash_bs</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The SHA&#45;1 algorithm itself, taking in a bytestring.">
-<polygon fill="#999999" stroke="#666666" points="119.5,-37.25 0,-37.25 0,-18 119.5,-18 119.5,-37.25"/>
-<text text-anchor="middle" x="59.75" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha1::hash_bs</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.25,-56.25 155.5,-56.25 155.5,-37 247.25,-37 247.25,-56.25"/>
-<text text-anchor="middle" x="201.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.96,-35.68C127.85,-36.76 135.93,-37.86 143.77,-38.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.17,-42.37 153.55,-40.25 144.12,-35.44 143.17,-42.37"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/copy.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="229.62,-19.25 173.12,-19.25 173.12,0 229.62,0 229.62,-19.25"/>
-<text text-anchor="middle" x="201.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::copy</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.96,-19.99C134.08,-18.17 148.78,-16.28 161.7,-14.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.02,-18.1 171.49,-13.35 161.12,-11.16 162.02,-18.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 142d335bc..000000000
--- a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations of well&#45;known SHA&#45;1 hashes." alt="" coords="5,31,49,56"/>
-<area shape="rect" id="Node000002" href="$d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,36,81,28,82,33,50,41"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,55,168,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="50,46,82,53,81,58,49,51"/>
-</map>
diff --git a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index f56a1c7be..000000000
--- a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-051da4281d575e7f47fc60770596a53a
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index cf902c3c0..000000000
--- a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="64pt"
- viewBox="0.00 0.00 130.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations of well&#45;known SHA&#45;1 hashes.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-56.25 68.5,-56.25 68.5,-37 122,-37 122,-56.25"/>
-<text text-anchor="middle" x="95.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">compare</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-31.47C39.86,-33.2 48.49,-35.33 57.03,-37.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.06,-40.81 66.61,-39.8 57.74,-34.01 56.06,-40.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-23.98C39.86,-22.34 48.49,-20.32 57.03,-18.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.66,-21.77 66.6,-16.09 56.07,-14.96 57.66,-21.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index e47f4c7d4..000000000
--- a/d8/d7a/sha1_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="64pt"
- viewBox="0.00 0.00 130.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations of well&#45;known SHA&#45;1 hashes.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-56.25 68.5,-56.25 68.5,-37 122,-37 122,-56.25"/>
-<text text-anchor="middle" x="95.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">compare</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-31.47C39.86,-33.2 48.49,-35.33 57.03,-37.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.06,-40.81 66.61,-39.8 57.74,-34.01 56.06,-40.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-23.98C39.86,-22.34 48.49,-20.32 57.03,-18.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.66,-21.77 66.6,-16.09 56.07,-14.96 57.66,-21.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.map b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.map
deleted file mode 100644
index adc68fc80..000000000
--- a/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="interactive" name="interactive">
-<area shape="rect" id="Node000001" title="Puts user in a loop where inputs can be given and SHA&#45;1 hash will be computed and printed." alt="" coords="5,55,87,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/compare.html#" title=" " alt="" coords="135,5,272,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="86,52,145,34,147,39,88,57"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="168,55,239,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="87,65,152,65,152,70,87,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/getline.html#" title=" " alt="" coords="161,104,246,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="88,78,147,96,145,101,86,83"/>
-</map>
diff --git a/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.md5 b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.md5
deleted file mode 100644
index eb245d784..000000000
--- a/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3f52964b6db6d7226cff9de69eafdeb5
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.svg b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.svg
deleted file mode 100644
index 190996f69..000000000
--- a/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: interactive Pages: 1 -->
-<svg width="208pt" height="101pt"
- viewBox="0.00 0.00 208.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>interactive</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Puts user in a loop where inputs can be given and SHA&#45;1 hash will be computed and printed.">
-<polygon fill="#999999" stroke="#666666" points="61,-56.25 0,-56.25 0,-37 61,-37 61,-56.25"/>
-<text text-anchor="middle" x="30.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">interactive</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200,-93.25 97,-93.25 97,-74 200,-74 200,-93.25"/>
-<text text-anchor="middle" x="148.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::compare</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.37,-56.15C74.75,-60.42 90.75,-65.52 105.32,-70.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="104.07,-73.45 114.66,-73.15 106.2,-66.78 104.07,-73.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="175.25,-56.25 121.75,-56.25 121.75,-37 175.25,-37 175.25,-56.25"/>
-<text text-anchor="middle" x="148.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.37,-46.62C76.14,-46.62 94.11,-46.62 109.81,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="109.77,-50.13 119.77,-46.63 109.77,-43.13 109.77,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="180.5,-19.25 116.5,-19.25 116.5,0 180.5,0 180.5,-19.25"/>
-<text text-anchor="middle" x="148.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.37,-37.1C74.75,-32.83 90.75,-27.73 105.32,-23.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.2,-26.47 114.66,-20.1 104.07,-19.8 106.2,-26.47"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph_org.svg b/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph_org.svg
deleted file mode 100644
index af860172f..000000000
--- a/d8/d7a/sha1_8cpp_ac9e1a11f44135b890dd10a00e73b5661_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: interactive Pages: 1 -->
-<svg width="208pt" height="101pt"
- viewBox="0.00 0.00 208.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>interactive</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Puts user in a loop where inputs can be given and SHA&#45;1 hash will be computed and printed.">
-<polygon fill="#999999" stroke="#666666" points="61,-56.25 0,-56.25 0,-37 61,-37 61,-56.25"/>
-<text text-anchor="middle" x="30.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">interactive</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200,-93.25 97,-93.25 97,-74 200,-74 200,-93.25"/>
-<text text-anchor="middle" x="148.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::compare</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.37,-56.15C74.75,-60.42 90.75,-65.52 105.32,-70.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="104.07,-73.45 114.66,-73.15 106.2,-66.78 104.07,-73.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="175.25,-56.25 121.75,-56.25 121.75,-37 175.25,-37 175.25,-56.25"/>
-<text text-anchor="middle" x="148.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.37,-46.62C76.14,-46.62 94.11,-46.62 109.81,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="109.77,-50.13 119.77,-46.63 109.77,-43.13 109.77,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="180.5,-19.25 116.5,-19.25 116.5,0 180.5,0 180.5,-19.25"/>
-<text text-anchor="middle" x="148.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.37,-37.1C74.75,-32.83 90.75,-27.73 105.32,-23.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.2,-26.47 114.66,-20.1 104.07,-19.8 106.2,-26.47"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 20b48e459..000000000
--- a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,80,55,106"/>
-<area shape="rect" id="Node000002" href="$d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661" title="Puts user in a loop where inputs can be given and SHA&#45;1 hash will be computed and printed." alt="" coords="103,55,184,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,85,87,77,88,83,55,90"/>
-<area shape="rect" id="Node000006" href="$d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations of well&#45;known SHA&#45;1 hashes." alt="" coords="122,104,165,130"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="55,95,107,107,106,112,54,101"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/compare.html#" title=" " alt="" coords="232,5,369,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="184,52,242,34,244,39,185,57"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="265,104,336,130"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="185,78,251,99,249,104,184,83"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/getline.html#" title=" " alt="" coords="258,55,343,80"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="184,65,243,65,243,70,184,70"/>
-<area shape="poly" id="edge7_Node000006_Node000004" title=" " alt="" coords="166,114,250,114,250,120,166,120"/>
-<area shape="rect" id="Node000007" href="$d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" title=" " alt="" coords="265,153,336,179"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="166,121,251,148,250,153,165,126"/>
-</map>
diff --git a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 1b00ff021..000000000
--- a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0ed0d9463a76665282a5146586435f83
\ No newline at end of file
diff --git a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index fcf43f0ec..000000000
--- a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,164 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="281pt" height="138pt"
- viewBox="0.00 0.00 281.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661" target="_top" xlink:title="Puts user in a loop where inputs can be given and SHA&#45;1 hash will be computed and printed.">
-<polygon fill="white" stroke="#666666" points="134,-93.25 73,-93.25 73,-74 134,-74 134,-93.25"/>
-<text text-anchor="middle" x="103.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">interactive</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.1,-68.65C44.25,-70.29 52.83,-72.25 61.39,-74.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.5,-77.6 71.03,-76.42 62.06,-70.78 60.5,-77.6"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations of well&#45;known SHA&#45;1 hashes.">
-<polygon fill="white" stroke="#666666" points="119.75,-56.25 87.25,-56.25 87.25,-37 119.75,-37 119.75,-56.25"/>
-<text text-anchor="middle" x="103.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.1,-60.81C48.4,-58.36 63.27,-55.13 75.98,-52.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.37,-55.87 85.4,-50.33 74.89,-49.03 76.37,-55.87"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273,-130.25 170,-130.25 170,-111 273,-111 273,-130.25"/>
-<text text-anchor="middle" x="221.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::compare</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.37,-93.15C147.75,-97.42 163.75,-102.52 178.32,-107.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.07,-110.45 187.66,-110.15 179.2,-103.78 177.07,-110.45"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.25,-56.25 194.75,-56.25 194.75,-37 248.25,-37 248.25,-56.25"/>
-<text text-anchor="middle" x="221.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.37,-74.1C149.43,-69.29 167.82,-63.43 183.73,-58.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.38,-61.82 192.84,-55.45 182.25,-55.15 184.38,-61.82"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.5,-93.25 189.5,-93.25 189.5,-74 253.5,-74 253.5,-93.25"/>
-<text text-anchor="middle" x="221.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.37,-83.62C147.62,-83.62 163.44,-83.62 177.89,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.59,-87.13 187.59,-83.63 177.59,-80.13 177.59,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge7_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.14,-46.62C136.22,-46.62 161.83,-46.62 183.15,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.96,-50.13 192.96,-46.63 182.96,-43.13 182.96,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.25,-19.25 194.75,-19.25 194.75,0 248.25,0 248.25,-19.25"/>
-<text text-anchor="middle" x="221.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">compare</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.14,-41.64C136.36,-36.46 162.3,-28.19 183.74,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.57,-24.76 193.03,-18.39 182.44,-18.09 184.57,-24.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index da221a0a7..000000000
--- a/d8/d7a/sha1_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,138 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="281pt" height="138pt"
- viewBox="0.00 0.00 281.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661" target="_top" xlink:title="Puts user in a loop where inputs can be given and SHA&#45;1 hash will be computed and printed.">
-<polygon fill="white" stroke="#666666" points="134,-93.25 73,-93.25 73,-74 134,-74 134,-93.25"/>
-<text text-anchor="middle" x="103.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">interactive</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.1,-68.65C44.25,-70.29 52.83,-72.25 61.39,-74.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.5,-77.6 71.03,-76.42 62.06,-70.78 60.5,-77.6"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations of well&#45;known SHA&#45;1 hashes.">
-<polygon fill="white" stroke="#666666" points="119.75,-56.25 87.25,-56.25 87.25,-37 119.75,-37 119.75,-56.25"/>
-<text text-anchor="middle" x="103.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.1,-60.81C48.4,-58.36 63.27,-55.13 75.98,-52.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.37,-55.87 85.4,-50.33 74.89,-49.03 76.37,-55.87"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273,-130.25 170,-130.25 170,-111 273,-111 273,-130.25"/>
-<text text-anchor="middle" x="221.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::compare</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.37,-93.15C147.75,-97.42 163.75,-102.52 178.32,-107.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.07,-110.45 187.66,-110.15 179.2,-103.78 177.07,-110.45"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.25,-56.25 194.75,-56.25 194.75,-37 248.25,-37 248.25,-56.25"/>
-<text text-anchor="middle" x="221.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.37,-74.1C149.43,-69.29 167.82,-63.43 183.73,-58.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.38,-61.82 192.84,-55.45 182.25,-55.15 184.38,-61.82"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.5,-93.25 189.5,-93.25 189.5,-74 253.5,-74 253.5,-93.25"/>
-<text text-anchor="middle" x="221.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.37,-83.62C147.62,-83.62 163.44,-83.62 177.89,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.59,-87.13 187.59,-83.63 177.59,-80.13 177.59,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge7_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.14,-46.62C136.22,-46.62 161.83,-46.62 183.15,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.96,-50.13 192.96,-46.63 182.96,-43.13 182.96,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.25,-19.25 194.75,-19.25 194.75,0 248.25,0 248.25,-19.25"/>
-<text text-anchor="middle" x="221.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">compare</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.14,-41.64C136.36,-36.46 162.3,-28.19 183.74,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.57,-24.76 193.03,-18.39 182.44,-18.09 184.57,-24.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d7a/sha1_8cpp_source.html b/d8/d7a/sha1_8cpp_source.html
new file mode 100644
index 000000000..a4e9cc249
--- /dev/null
+++ b/d8/d7a/sha1_8cpp_source.html
@@ -0,0 +1,389 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: hashing/sha1.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/d7a/sha1_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">sha1.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/d7a/sha1_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#include &lt;array&gt;</span>      </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#include &lt;cstring&gt;</span>    </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="preprocessor">#include &lt;string&gt;</span>     </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/d0c/namespacehashing.html">hashing</a> {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="keyword">namespace </span>sha1 {</div>
+<div class="foldopen" id="foldopen00058" data-start="{" data-end="}">
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../d8/d7a/sha1_8cpp.html#acf6bd970f29a68702bdbdfe8338e45e0">   58</a></span>uint32_t leftRotate32bits(uint32_t n, std::size_t rotate) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">return</span> (n &lt;&lt; rotate) | (n &gt;&gt; (32 - rotate));</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>}</div>
+</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="foldopen" id="foldopen00067" data-start="{" data-end="}">
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228">   67</a></span>std::string sig2hex(<span class="keywordtype">void</span>* sig) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keyword">const</span> <span class="keywordtype">char</span>* hexChars = <span class="stringliteral">&quot;0123456789abcdef&quot;</span>;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keyword">auto</span>* intsig = <span class="keyword">static_cast&lt;</span>uint8_t*<span class="keyword">&gt;</span>(sig);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    std::string hex = <span class="stringliteral">&quot;&quot;</span>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; 20; i++) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        hex.push_back(hexChars[(intsig[i] &gt;&gt; 4) &amp; 0xF]);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        hex.push_back(hexChars[(intsig[i]) &amp; 0xF]);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    }</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="keywordflow">return</span> hex;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>}</div>
+</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="foldopen" id="foldopen00084" data-start="{" data-end="}">
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"><a class="line" href="../../d8/d7a/sha1_8cpp.html#a7be3471f7e489d7d0df42b97a48bf141">   84</a></span><span class="keywordtype">void</span>* hash_bs(<span class="keyword">const</span> <span class="keywordtype">void</span>* input_bs, uint64_t input_size) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keyword">auto</span>* input = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>uint8_t*<span class="keyword">&gt;</span>(input_bs);</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="comment">// Step 0: The initial 160-bit state</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    uint32_t h0 = 0x67452301, a = 0;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    uint32_t h1 = 0xEFCDAB89, b = 0;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    uint32_t h2 = 0x98BADCFE, c = 0;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    uint32_t h3 = 0x10325476, d = 0;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    uint32_t h4 = 0xC3D2E1F0, e = 0;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="comment">// Step 1: Processing the bytestring</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="comment">// First compute the size the padded message will have</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="comment">// so it is possible to allocate the right amount of memory</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    uint64_t padded_message_size = 0;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keywordflow">if</span> (input_size % 64 &lt; 56) {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        padded_message_size = input_size + 64 - (input_size % 64);</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        padded_message_size = input_size + 128 - (input_size % 64);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    }</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="comment">// Allocate the memory for the padded message</span></div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    std::vector&lt;uint8_t&gt; padded_message(padded_message_size);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <span class="comment">// Beginning of the padded message is the original message</span></div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    std::copy(input, input + input_size, padded_message.begin());</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="comment">// Afterwards comes a single 1 bit and then only zeroes</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    padded_message[input_size] = 1 &lt;&lt; 7;  <span class="comment">// 10000000</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="keywordflow">for</span> (uint64_t i = input_size; i % 64 != 56; i++) {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        <span class="keywordflow">if</span> (i == input_size) {</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>            <span class="keywordflow">continue</span>;  <span class="comment">// pass first iteration</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        }</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        padded_message[i] = 0;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    }</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <span class="comment">// We then have to add the 64-bit size of the message in bits (hence the</span></div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <span class="comment">// times 8) in the last 8 bytes</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    uint64_t input_bitsize = input_size * 8;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; 8; i++) {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        padded_message[padded_message_size - 8 + i] =</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>            (input_bitsize &gt;&gt; (56 - 8 * i)) &amp; 0xFF;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    }</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    <span class="comment">// Already allocate memory for blocks</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    std::array&lt;uint32_t, 80&gt; blocks{};</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="comment">// Rounds</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <span class="keywordflow">for</span> (uint64_t chunk = 0; chunk * 64 &lt; padded_message_size; chunk++) {</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        <span class="comment">// First, build 16 32-bits blocks from the chunk</span></div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        <span class="keywordflow">for</span> (uint8_t bid = 0; bid &lt; 16; bid++) {</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>            blocks[bid] = 0;</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span> </div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>            <span class="comment">// Having to build a 32-bit word from 4-bit words</span></div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>            <span class="comment">// Add each and shift them to the left</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>            <span class="keywordflow">for</span> (uint8_t cid = 0; cid &lt; 4; cid++) {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>                blocks[bid] = (blocks[bid] &lt;&lt; 8) +</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>                              padded_message[chunk * 64 + bid * 4 + cid];</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>            }</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span> </div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>            <span class="comment">// Extend the 16 32-bit words into 80 32-bit words</span></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>            <span class="keywordflow">for</span> (uint8_t i = 16; i &lt; 80; i++) {</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>                blocks[i] =</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>                    leftRotate32bits(blocks[i - 3] ^ blocks[i - 8] ^</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>                                         blocks[i - 14] ^ blocks[i - 16],</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>                                     1);</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>            }</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>        }</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>        a = h0;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>        b = h1;</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        c = h2;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>        d = h3;</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>        e = h4;</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span> </div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>        <span class="comment">// Main &quot;hashing&quot; loop</span></div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; 80; i++) {</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>            uint32_t F = 0, g = 0;</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>            <span class="keywordflow">if</span> (i &lt; 20) {</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>                F = (b &amp; c) | ((~b) &amp; d);</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>                g = 0x5A827999;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (i &lt; 40) {</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>                F = b ^ c ^ d;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>                g = 0x6ED9EBA1;</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (i &lt; 60) {</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>                F = (b &amp; c) | (b &amp; d) | (c &amp; d);</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>                g = 0x8F1BBCDC;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>                F = b ^ c ^ d;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>                g = 0xCA62C1D6;</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>            }</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span> </div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>            <span class="comment">// Update the accumulators</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>            uint32_t temp = leftRotate32bits(a, 5) + F + e + g + blocks[i];</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>            e = d;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>            d = c;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>            c = leftRotate32bits(b, 30);</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>            b = a;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>            a = temp;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>        }</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>        <span class="comment">// Update the state with this chunk&#39;s hash</span></div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>        h0 += a;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        h1 += b;</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        h2 += c;</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>        h3 += d;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>        h4 += e;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    }</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span> </div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    <span class="comment">// Build signature from state</span></div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    <span class="comment">// Note, any type could be used for the signature</span></div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    <span class="comment">// uint8_t was used to make the 20 bytes obvious</span></div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    <span class="keyword">auto</span>* sig = <span class="keyword">new</span> uint8_t[20];</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; 4; i++) {</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>        sig[i] = (h0 &gt;&gt; (24 - 8 * i)) &amp; 0xFF;</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>        sig[i + 4] = (h1 &gt;&gt; (24 - 8 * i)) &amp; 0xFF;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>        sig[i + 8] = (h2 &gt;&gt; (24 - 8 * i)) &amp; 0xFF;</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        sig[i + 12] = (h3 &gt;&gt; (24 - 8 * i)) &amp; 0xFF;</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>        sig[i + 16] = (h4 &gt;&gt; (24 - 8 * i)) &amp; 0xFF;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    }</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span> </div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    <span class="keywordflow">return</span> sig;</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>}</div>
+</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span> </div>
+<div class="foldopen" id="foldopen00211" data-start="{" data-end="}">
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"><a class="line" href="../../d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c">  211</a></span><span class="keywordtype">void</span>* hash(<span class="keyword">const</span> std::string&amp; message) {</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    <span class="keywordflow">return</span> hash_bs(&amp;message[0], message.size());</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>}</div>
+</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>}  <span class="comment">// namespace sha1</span></div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>}  <span class="comment">// namespace hashing</span></div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span> </div>
+<div class="foldopen" id="foldopen00221" data-start="{" data-end="}">
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"><a class="line" href="../../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  221</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    <span class="comment">// Hashes empty string and stores signature</span></div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    <span class="keywordtype">void</span>* sig = hashing::sha1::hash(<span class="stringliteral">&quot;&quot;</span>);</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hashing empty string&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    <span class="comment">// Prints signature hex representation</span></div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    std::cout &lt;&lt; hashing::sha1::sig2hex(sig) &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    <span class="comment">// Test with cassert wether sig is correct from expected value</span></div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    assert(hashing::sha1::sig2hex(sig).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>               <span class="stringliteral">&quot;da39a3ee5e6b4b0d3255bfef95601890afd80709&quot;</span>) == 0);</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span> </div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    <span class="comment">// Hashes &quot;The quick brown fox jumps over the lazy dog&quot; and stores signature</span></div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    <span class="keywordtype">void</span>* sig2 =</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>        hashing::sha1::hash(<span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog&quot;</span>);</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hashing The quick brown fox jumps over the lazy dog&quot;</span></div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    <span class="comment">// Prints signature hex representation</span></div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    std::cout &lt;&lt; hashing::sha1::sig2hex(sig2) &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    <span class="comment">// Test with cassert wether sig is correct from expected value</span></div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    assert(hashing::sha1::sig2hex(sig2).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>               <span class="stringliteral">&quot;2fd4e1c67a2d28fced849ee1bb76e7391b93eb12&quot;</span>) == 0);</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span> </div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    <span class="comment">// Hashes &quot;The quick brown fox jumps over the lazy dog.&quot; (notice the</span></div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    <span class="comment">// additional period) and stores signature</span></div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    <span class="keywordtype">void</span>* sig3 =</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>        hashing::sha1::hash(<span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog.&quot;</span>);</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hashing &quot;</span></div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>                 <span class="stringliteral">&quot;The quick brown fox jumps over the lazy dog.&quot;</span></div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    <span class="comment">// Prints signature hex representation</span></div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    std::cout &lt;&lt; hashing::sha1::sig2hex(sig3) &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    <span class="comment">// Test with cassert wether sig is correct from expected value</span></div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    assert(hashing::sha1::sig2hex(sig3).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>               <span class="stringliteral">&quot;408d94384216f890ff7a0c3528e8bed1e0b01621&quot;</span>) == 0);</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span> </div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>    <span class="comment">// Hashes &quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789&quot;</span></div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    <span class="comment">// and stores signature</span></div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    <span class="keywordtype">void</span>* sig4 = hashing::sha1::hash(</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>        <span class="stringliteral">&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789&quot;</span>);</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>    std::cout</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>        &lt;&lt; <span class="stringliteral">&quot;Hashing &quot;</span></div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>           <span class="stringliteral">&quot;ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789&quot;</span></div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>        &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>    <span class="comment">// Prints signature hex representation</span></div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>    std::cout &lt;&lt; hashing::sha1::sig2hex(sig4) &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>    <span class="comment">// Test with cassert wether sig is correct from expected value</span></div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>    assert(hashing::sha1::sig2hex(sig4).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>               <span class="stringliteral">&quot;761c457bf73b14d27e9e9265c46f4b4dda11f940&quot;</span>) == 0);</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>}</div>
+</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span> </div>
+<div class="foldopen" id="foldopen00275" data-start="{" data-end="}">
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"><a class="line" href="../../d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661">  275</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661">interactive</a>() {</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>    <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>        std::string input;</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter a message to be hashed (Ctrl-C to exit): &quot;</span></div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>                  &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>        std::getline(std::cin, input);</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>        <span class="keywordtype">void</span>* sig = hashing::sha1::hash(input);</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Hash is: &quot;</span> &lt;&lt; hashing::sha1::sig2hex(sig) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span> </div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>        <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Want to enter another message? (y/n) &quot;</span>;</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>            std::getline(std::cin, input);</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>            <span class="keywordflow">if</span> (input.compare(<span class="stringliteral">&quot;y&quot;</span>) == 0) {</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (input.compare(<span class="stringliteral">&quot;n&quot;</span>) == 0) {</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>                <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>            }</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>        }</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>    }</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>}</div>
+</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span> </div>
+<div class="foldopen" id="foldopen00300" data-start="{" data-end="}">
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"><a class="line" href="../../d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  300</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>    <a class="code hl_function" href="../../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span> </div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>    <span class="comment">// Launch interactive mode where user can input messages and see</span></div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>    <span class="comment">// their hash</span></div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>    <a class="code hl_function" href="../../d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661">interactive</a>();</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>}</div>
+</div>
+<div class="ttc" id="anamespacehashing_html"><div class="ttname"><a href="../../d6/d0c/namespacehashing.html">hashing</a></div><div class="ttdoc">Used for assert.</div></div>
+<div class="ttc" id="asha1_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations of well-known SHA-1 hashes.</div><div class="ttdef"><b>Definition</b> <a href="#l00221">sha1.cpp:221</a></div></div>
+<div class="ttc" id="asha1_8cpp_html_ac9e1a11f44135b890dd10a00e73b5661"><div class="ttname"><a href="../../d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661">interactive</a></div><div class="ttdeci">static void interactive()</div><div class="ttdoc">Puts user in a loop where inputs can be given and SHA-1 hash will be computed and printed.</div><div class="ttdef"><b>Definition</b> <a href="#l00275">sha1.cpp:275</a></div></div>
+<div class="ttc" id="asha1_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00300">sha1.cpp:300</a></div></div>
+<div class="ttc" id="ashell__sort2_8cpp_html_a7eb77daed2cf1513f6d68c47a1c2db1c"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a></div><div class="ttdeci">int compare(const void *a, const void *b)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d7a/shell__sort2_8cpp_source.html#l00087">shell_sort2.cpp:87</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_ece9b94c107bbaa1dd68197a8c9983b9.html">hashing</a></li><li class="navelem"><a class="el" href="../../d8/d7a/sha1_8cpp.html">sha1.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html
index 80f5dac99..49df0b455 100644
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html
+++ b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: operations_on_datastructures::circular_linked_list::CircularLinkedList Class Reference</title>
+<title>TheAlgorithms/C++: operations_on_datastructures::circular_linked_list::CircularLinkedList Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -142,7 +159,7 @@ Public Member Functions</h2></td></tr>
 <tr class="separator:a46195fcf11b636064c7172cb74b55dd0"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a398d6cc927a2c8e4a156ae2806f48986" id="r_a398d6cc927a2c8e4a156ae2806f48986"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a398d6cc927a2c8e4a156ae2806f48986">erase</a> ()</td></tr>
 <tr class="separator:a398d6cc927a2c8e4a156ae2806f48986"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ac38565472a07d07f63ec0d2fd8a69d4d" id="r_ac38565472a07d07f63ec0d2fd8a69d4d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;<a class="el" href="#a53611ec1fef92eeeb875aea1bde1e4de">values</a>)</td></tr>
+<tr class="memitem:ac38565472a07d07f63ec0d2fd8a69d4d" id="r_ac38565472a07d07f63ec0d2fd8a69d4d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a> (const std::vector&lt; int64_t &gt; &amp;<a class="el" href="#a53611ec1fef92eeeb875aea1bde1e4de">values</a>)</td></tr>
 <tr class="memdesc:ac38565472a07d07f63ec0d2fd8a69d4d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Inserts all the values from a vector into the Circular Linked List.  <br /></td></tr>
 <tr class="separator:ac38565472a07d07f63ec0d2fd8a69d4d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a3b7bbb0918c261bc216aef9e6dd39aa4" id="r_a3b7bbb0918c261bc216aef9e6dd39aa4"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3b7bbb0918c261bc216aef9e6dd39aa4">insert</a> (int64_t <a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
@@ -157,18 +174,17 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:a424b17ddc672b25fe0bd9dc8612fba21" id="r_a424b17ddc672b25fe0bd9dc8612fba21"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a424b17ddc672b25fe0bd9dc8612fba21">print</a> (<a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *<a class="el" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>)</td></tr>
 <tr class="memdesc:a424b17ddc672b25fe0bd9dc8612fba21"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints the values of the Circular Linked List, beginning from a given <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> to be used as the root.  <br /></td></tr>
 <tr class="separator:a424b17ddc672b25fe0bd9dc8612fba21"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a53611ec1fef92eeeb875aea1bde1e4de" id="r_a53611ec1fef92eeeb875aea1bde1e4de"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a53611ec1fef92eeeb875aea1bde1e4de">values</a> ()</td></tr>
-<tr class="memdesc:a53611ec1fef92eeeb875aea1bde1e4de"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> of the values of the Circular Linked List.  <br /></td></tr>
+<tr class="memitem:a53611ec1fef92eeeb875aea1bde1e4de" id="r_a53611ec1fef92eeeb875aea1bde1e4de"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a53611ec1fef92eeeb875aea1bde1e4de">values</a> ()</td></tr>
+<tr class="memdesc:a53611ec1fef92eeeb875aea1bde1e4de"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a std::vector of the values of the Circular Linked List.  <br /></td></tr>
 <tr class="separator:a53611ec1fef92eeeb875aea1bde1e4de"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a03a896b34d27fda69049827e0c4dab42" id="r_a03a896b34d27fda69049827e0c4dab42"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a03a896b34d27fda69049827e0c4dab42">values</a> (<a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *<a class="el" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>)</td></tr>
-<tr class="memdesc:a03a896b34d27fda69049827e0c4dab42"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> of the values of the Circular Linked List, beginning from a given <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>.  <br /></td></tr>
+<tr class="memitem:a03a896b34d27fda69049827e0c4dab42" id="r_a03a896b34d27fda69049827e0c4dab42"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a03a896b34d27fda69049827e0c4dab42">values</a> (<a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *<a class="el" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>)</td></tr>
+<tr class="memdesc:a03a896b34d27fda69049827e0c4dab42"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns a std::vector of the values of the Circular Linked List, beginning from a given <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>.  <br /></td></tr>
 <tr class="separator:a03a896b34d27fda69049827e0c4dab42"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a5d5cebd6bc906c60763fc6be10cfdd13" id="r_a5d5cebd6bc906c60763fc6be10cfdd13"><td class="memItemLeft" align="right" valign="top"><a id="a5d5cebd6bc906c60763fc6be10cfdd13" name="a5d5cebd6bc906c60763fc6be10cfdd13"></a>
-<a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>root</b></td></tr>
-<tr class="memdesc:a5d5cebd6bc906c60763fc6be10cfdd13"><td class="mdescLeft">&#160;</td><td class="mdescRight">Pointer to the root <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>. <br /></td></tr>
+<tr class="memitem:a5d5cebd6bc906c60763fc6be10cfdd13" id="r_a5d5cebd6bc906c60763fc6be10cfdd13"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a></td></tr>
+<tr class="memdesc:a5d5cebd6bc906c60763fc6be10cfdd13"><td class="mdescLeft">&#160;</td><td class="mdescRight">Pointer to the root <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>.  <br /></td></tr>
 <tr class="separator:a5d5cebd6bc906c60763fc6be10cfdd13"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ab682f854f39582a20c9c4102f0482208" id="r_ab682f854f39582a20c9c4102f0482208"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab682f854f39582a20c9c4102f0482208">end</a> {}</td></tr>
 <tr class="memdesc:ab682f854f39582a20c9c4102f0482208"><td class="mdescLeft">&#160;</td><td class="mdescRight">Pointer to the last <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>.  <br /></td></tr>
@@ -176,6 +192,8 @@ Private Attributes</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A class that implements a Circular Linked List. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="aa704319924f97fedfb41caf193a00888" name="aa704319924f97fedfb41caf193a00888"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aa704319924f97fedfb41caf193a00888">&#9670;&#160;</a></span>CircularLinkedList() <span class="overload">[1/3]</span></h2>
@@ -201,12 +219,14 @@ Private Attributes</h2></td></tr>
 </div><div class="memdoc">
 
 <p>Creates an empty <a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" title="A class that implements a Circular Linked List.">CircularLinkedList</a>. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00066">66</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   66</span>                         {</div>
 <div class="line"><span class="lineno">   67</span>        <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">   68</span>        <a class="code hl_variable" href="#ab682f854f39582a20c9c4102f0482208">end</a> = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">   69</span>    }</div>
-<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a5d5cebd6bc906c60763fc6be10cfdd13"><div class="ttname"><a href="#a5d5cebd6bc906c60763fc6be10cfdd13">operations_on_datastructures::circular_linked_list::CircularLinkedList::root</a></div><div class="ttdeci">Node * root</div><div class="ttdoc">Pointer to the root Node.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:59</div></div>
-<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_ab682f854f39582a20c9c4102f0482208"><div class="ttname"><a href="#ab682f854f39582a20c9c4102f0482208">operations_on_datastructures::circular_linked_list::CircularLinkedList::end</a></div><div class="ttdeci">Node * end</div><div class="ttdoc">Pointer to the last Node.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:60</div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a5d5cebd6bc906c60763fc6be10cfdd13"><div class="ttname"><a href="#a5d5cebd6bc906c60763fc6be10cfdd13">operations_on_datastructures::circular_linked_list::CircularLinkedList::root</a></div><div class="ttdeci">Node * root</div><div class="ttdoc">Pointer to the root Node.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d33/circular__linked__list_8cpp_source.html#l00059">circular_linked_list.cpp:59</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_ab682f854f39582a20c9c4102f0482208"><div class="ttname"><a href="#ab682f854f39582a20c9c4102f0482208">operations_on_datastructures::circular_linked_list::CircularLinkedList::end</a></div><div class="ttdeci">Node * end</div><div class="ttdoc">Pointer to the last Node.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d33/circular__linked__list_8cpp_source.html#l00060">circular_linked_list.cpp:60</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -234,26 +254,22 @@ Private Attributes</h2></td></tr>
 </div><div class="memdoc">
 
 <p>Copy constructor for <a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" title="A class that implements a Circular Linked List.">CircularLinkedList</a>. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00073">73</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   73</span>                                                       {</div>
 <div class="line"><span class="lineno">   74</span>        <a class="code hl_function" href="#a398d6cc927a2c8e4a156ae2806f48986">erase</a>();</div>
 <div class="line"><span class="lineno">   75</span>        <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <span class="keyword">nullptr</span>;</div>
-<div class="line"><span class="lineno">   76</span>        <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/copy.html">copy</a>.root;</div>
+<div class="line"><span class="lineno">   76</span>        <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = copy.root;</div>
 <div class="line"><span class="lineno">   77</span>        <span class="keywordflow">while</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> != <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">   78</span>            <a class="code hl_function" href="#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;data);</div>
 <div class="line"><span class="lineno">   79</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next;</div>
 <div class="line"><span class="lineno">   80</span>        }</div>
 <div class="line"><span class="lineno">   81</span>    }</div>
-<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a398d6cc927a2c8e4a156ae2806f48986"><div class="ttname"><a href="#a398d6cc927a2c8e4a156ae2806f48986">operations_on_datastructures::circular_linked_list::CircularLinkedList::erase</a></div><div class="ttdeci">void erase()</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:126</div></div>
-<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_ac38565472a07d07f63ec0d2fd8a69d4d"><div class="ttname"><a href="#ac38565472a07d07f63ec0d2fd8a69d4d">operations_on_datastructures::circular_linked_list::CircularLinkedList::insert</a></div><div class="ttdeci">void insert(const std::vector&lt; int64_t &gt; &amp;values)</div><div class="ttdoc">Inserts all the values from a vector into the Circular Linked List.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:146</div></div>
-<div class="ttc" id="acopy_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/copy.html">std::copy</a></div><div class="ttdeci">T copy(T... args)</div></div>
-<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.svg" width="100%" height="428"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a398d6cc927a2c8e4a156ae2806f48986"><div class="ttname"><a href="#a398d6cc927a2c8e4a156ae2806f48986">operations_on_datastructures::circular_linked_list::CircularLinkedList::erase</a></div><div class="ttdeci">void erase()</div><div class="ttdef"><b>Definition</b> <a href="../../de/d33/circular__linked__list_8cpp_source.html#l00126">circular_linked_list.cpp:126</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_ac38565472a07d07f63ec0d2fd8a69d4d"><div class="ttname"><a href="#ac38565472a07d07f63ec0d2fd8a69d4d">operations_on_datastructures::circular_linked_list::CircularLinkedList::insert</a></div><div class="ttdeci">void insert(const std::vector&lt; int64_t &gt; &amp;values)</div><div class="ttdoc">Inserts all the values from a vector into the Circular Linked List.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d33/circular__linked__list_8cpp_source.html#l00146">circular_linked_list.cpp:146</a></div></div>
+<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abde75f6ee432b0378d264da8c7c64db2" name="abde75f6ee432b0378d264da8c7c64db2"></a>
@@ -286,6 +302,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00086">86</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   86</span>                                                             {</div>
 <div class="line"><span class="lineno">   87</span>        <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = source.root;</div>
 <div class="line"><span class="lineno">   88</span>        <a class="code hl_variable" href="#ab682f854f39582a20c9c4102f0482208">end</a> = source.end;</div>
@@ -319,13 +337,10 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>Cleans up memory when destroyed. </p>
-<div class="fragment"><div class="line"><span class="lineno">  122</span>{ <a class="code hl_function" href="#a398d6cc927a2c8e4a156ae2806f48986">erase</a>(); }</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="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.svg" width="452" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00122">122</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  122</span>{ <a class="code hl_function" href="#a398d6cc927a2c8e4a156ae2806f48986">erase</a>(); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Function Documentation</h2>
@@ -352,6 +367,8 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Iteratively frees each node in the Circular Linked List from the heap </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00126">126</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  126</span>                 {</div>
 <div class="line"><span class="lineno">  127</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">  128</span>            <span class="keywordflow">return</span>;</div>
@@ -365,7 +382,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  136</span>        <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  137</span>        <a class="code hl_variable" href="#ab682f854f39582a20c9c4102f0482208">end</a> = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  138</span>    }</div>
-<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -381,7 +398,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void operations_on_datastructures::circular_linked_list::CircularLinkedList::insert </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>values</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; int64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>values</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -400,18 +417,15 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00146">146</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  146</span>                                                  {</div>
 <div class="line"><span class="lineno">  147</span>        <span class="keywordflow">for</span> (int64_t value : <a class="code hl_function" href="#a53611ec1fef92eeeb875aea1bde1e4de">values</a>) {</div>
 <div class="line"><span class="lineno">  148</span>            <a class="code hl_function" href="#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a>(value);</div>
 <div class="line"><span class="lineno">  149</span>        }</div>
 <div class="line"><span class="lineno">  150</span>    }</div>
-<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a53611ec1fef92eeeb875aea1bde1e4de"><div class="ttname"><a href="#a53611ec1fef92eeeb875aea1bde1e4de">operations_on_datastructures::circular_linked_list::CircularLinkedList::values</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; values()</div><div class="ttdoc">Returns a std::vector of the values of the Circular Linked List.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:214</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.svg" width="444" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a53611ec1fef92eeeb875aea1bde1e4de"><div class="ttname"><a href="#a53611ec1fef92eeeb875aea1bde1e4de">operations_on_datastructures::circular_linked_list::CircularLinkedList::values</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; values()</div><div class="ttdoc">Returns a std::vector of the values of the Circular Linked List.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d33/circular__linked__list_8cpp_source.html#l00214">circular_linked_list.cpp:214</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a3b7bbb0918c261bc216aef9e6dd39aa4" name="a3b7bbb0918c261bc216aef9e6dd39aa4"></a>
@@ -445,17 +459,14 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00158">158</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  158</span>                              {</div>
 <div class="line"><span class="lineno">  159</span>        <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>);</div>
 <div class="line"><span class="lineno">  160</span>        <a class="code hl_function" href="#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
 <div class="line"><span class="lineno">  161</span>    }</div>
-<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.svg" width="100%" height="368"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a15150d6d933c58190c9c1dd7d22c51ae" name="a15150d6d933c58190c9c1dd7d22c51ae"></a>
@@ -495,18 +506,20 @@ Here is the call graph for this function:</div>
 <p>&lt; Append node to the end</p>
 <p>&lt; Set the next value to the root</p>
 <p>&lt; Make end point to node</p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00169">169</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  169</span>                            {</div>
 <div class="line"><span class="lineno">  170</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> == <span class="keyword">nullptr</span>) {</div>
-<div class="line"><span class="lineno">  171</span>            <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;        <span class="comment">///&lt; Set node as the root</span></div>
-<div class="line"><span class="lineno">  172</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next = <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;  <span class="comment">///&lt; Point node to itself</span></div>
-<div class="line"><span class="lineno">  173</span>            <a class="code hl_variable" href="#ab682f854f39582a20c9c4102f0482208">end</a> = <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;         <span class="comment">///&lt; Set the end to the root</span></div>
+<div class="line"><span class="lineno">  171</span>            <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;        </div>
+<div class="line"><span class="lineno">  172</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next = <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;  </div>
+<div class="line"><span class="lineno">  173</span>            <a class="code hl_variable" href="#ab682f854f39582a20c9c4102f0482208">end</a> = <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;         </div>
 <div class="line"><span class="lineno">  174</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  175</span>            <a class="code hl_variable" href="#ab682f854f39582a20c9c4102f0482208">end</a>-&gt;<a class="code hl_variable" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77">next</a> = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;   <span class="comment">///&lt; Append node to the end</span></div>
-<div class="line"><span class="lineno">  176</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next = <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;  <span class="comment">///&lt; Set the next value to the root</span></div>
-<div class="line"><span class="lineno">  177</span>            <a class="code hl_variable" href="#ab682f854f39582a20c9c4102f0482208">end</a> = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;         <span class="comment">///&lt; Make end point to node</span></div>
+<div class="line"><span class="lineno">  175</span>            <a class="code hl_variable" href="#ab682f854f39582a20c9c4102f0482208">end</a>-&gt;<a class="code hl_variable" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77">next</a> = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;   </div>
+<div class="line"><span class="lineno">  176</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next = <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;  </div>
+<div class="line"><span class="lineno">  177</span>            <a class="code hl_variable" href="#ab682f854f39582a20c9c4102f0482208">end</a> = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;         </div>
 <div class="line"><span class="lineno">  178</span>        }</div>
 <div class="line"><span class="lineno">  179</span>    }</div>
-<div class="ttc" id="astructoperations__on__datastructures_1_1circular__linked__list_1_1_node_html_a7c867b8e1034a6f5da490c8b8c09cb77"><div class="ttname"><a href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77">operations_on_datastructures::circular_linked_list::Node::next</a></div><div class="ttdeci">Node * next</div><div class="ttdoc">The Node's successor.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:34</div></div>
+<div class="ttc" id="astructoperations__on__datastructures_1_1circular__linked__list_1_1_node_html_a7c867b8e1034a6f5da490c8b8c09cb77"><div class="ttname"><a href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77">operations_on_datastructures::circular_linked_list::Node::next</a></div><div class="ttdeci">Node * next</div><div class="ttdoc">The Node's successor.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d33/circular__linked__list_8cpp_source.html#l00034">circular_linked_list.cpp:34</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -541,6 +554,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Reference to <a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" title="A class that implements a Circular Linked List.">CircularLinkedList</a> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00112">112</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  112</span>                                                                       {</div>
 <div class="line"><span class="lineno">  113</span>        <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = other.root;</div>
 <div class="line"><span class="lineno">  114</span>        <a class="code hl_variable" href="#ab682f854f39582a20c9c4102f0482208">end</a> = other.end;</div>
@@ -582,6 +597,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Reference to <a class="el" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" title="A class that implements a Circular Linked List.">CircularLinkedList</a> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00097">97</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   97</span>                                                                   {</div>
 <div class="line"><span class="lineno">   98</span>        <a class="code hl_function" href="#a398d6cc927a2c8e4a156ae2806f48986">erase</a>();</div>
 <div class="line"><span class="lineno">   99</span>        <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <span class="keyword">nullptr</span>;</div>
@@ -592,12 +609,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  104</span>        }</div>
 <div class="line"><span class="lineno">  105</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  106</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.svg" width="100%" height="428"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac341901e926b3fa3a796c64ca572f592" name="ac341901e926b3fa3a796c64ca572f592"></a>
@@ -625,14 +637,11 @@ Here is the call graph for this function:</div>
 
 <p>Prints the values of the Circular Linked List, beginning from the root <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>. </p>
 <p>Goes through each <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> from the root and prints them out in order </p><dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  187</span>{ <a class="code hl_function" href="#ac341901e926b3fa3a796c64ca572f592">print</a>(<a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>); }</div>
-<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_ac341901e926b3fa3a796c64ca572f592"><div class="ttname"><a href="#ac341901e926b3fa3a796c64ca572f592">operations_on_datastructures::circular_linked_list::CircularLinkedList::print</a></div><div class="ttdeci">void print()</div><div class="ttdoc">Prints the values of the Circular Linked List, beginning from the root Node.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:187</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.svg" width="203" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00187">187</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  187</span>{ <a class="code hl_function" href="#ac341901e926b3fa3a796c64ca572f592">print</a>(<a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>); }</div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_ac341901e926b3fa3a796c64ca572f592"><div class="ttname"><a href="#ac341901e926b3fa3a796c64ca572f592">operations_on_datastructures::circular_linked_list::CircularLinkedList::print</a></div><div class="ttdeci">void print()</div><div class="ttdoc">Prints the values of the Circular Linked List, beginning from the root Node.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d33/circular__linked__list_8cpp_source.html#l00187">circular_linked_list.cpp:187</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a424b17ddc672b25fe0bd9dc8612fba21" name="a424b17ddc672b25fe0bd9dc8612fba21"></a>
@@ -666,19 +675,20 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00196">196</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  196</span>                           {</div>
 <div class="line"><span class="lineno">  197</span>        <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* temp = <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;</div>
 <div class="line"><span class="lineno">  198</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> == <span class="keyword">nullptr</span>) {</div>
-<div class="line"><span class="lineno">  199</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Empty List!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  199</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Empty List!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  200</span>            <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  201</span>        }</div>
 <div class="line"><span class="lineno">  202</span>        <span class="keywordflow">do</span> {</div>
-<div class="line"><span class="lineno">  203</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; temp-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  203</span>            std::cout &lt;&lt; temp-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">  204</span>            temp = temp-&gt;next;</div>
 <div class="line"><span class="lineno">  205</span>        } <span class="keywordflow">while</span> (temp != <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>);</div>
-<div class="line"><span class="lineno">  206</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  206</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  207</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><!-- fragment -->
 </div>
 </div>
@@ -692,7 +702,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; operations_on_datastructures::circular_linked_list::CircularLinkedList::values </td>
+          <td class="memname">std::vector&lt; int64_t &gt; operations_on_datastructures::circular_linked_list::CircularLinkedList::values </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td></td>
@@ -705,15 +715,12 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 
-<p>Returns a <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> of the values of the Circular Linked List. </p>
-<p>Starting from the root <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>, appends each value of the list to a <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> and returns it </p><dl class="section return"><dt>Returns</dt><dd>A <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> of the list's values </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  214</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a53611ec1fef92eeeb875aea1bde1e4de">values</a>(<a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>); }</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="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.svg" width="203" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
+<p>Returns a std::vector of the values of the Circular Linked List. </p>
+<p>Starting from the root <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>, appends each value of the list to a std::vector and returns it </p><dl class="section return"><dt>Returns</dt><dd>A std::vector of the list's values </dd></dl>
 
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00214">214</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  214</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a53611ec1fef92eeeb875aea1bde1e4de">values</a>(<a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a03a896b34d27fda69049827e0c4dab42" name="a03a896b34d27fda69049827e0c4dab42"></a>
@@ -726,7 +733,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; operations_on_datastructures::circular_linked_list::CircularLinkedList::values </td>
+          <td class="memname">std::vector&lt; int64_t &gt; operations_on_datastructures::circular_linked_list::CircularLinkedList::values </td>
           <td>(</td>
           <td class="paramtype"><a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *</td>          <td class="paramname"><span class="paramname"><em>root</em></span></td><td>)</td>
           <td></td>
@@ -739,35 +746,30 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 
-<p>Returns a <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> of the values of the Circular Linked List, beginning from a given <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>. </p>
-<p>Starting from a given <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>, appends each value of the list to a <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> and returns it </p><dl class="params"><dt>Parameters</dt><dd>
+<p>Returns a std::vector of the values of the Circular Linked List, beginning from a given <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>. </p>
+<p>Starting from a given <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>, appends each value of the list to a std::vector and returns it </p><dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramname">root</td><td>The <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> to start at </td></tr>
   </table>
   </dd>
 </dl>
-<dl class="section return"><dt>Returns</dt><dd>A <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> of the list's values </dd></dl>
+<dl class="section return"><dt>Returns</dt><dd>A std::vector of the list's values </dd></dl>
 <p>&lt; Return empty vector</p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00223">223</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  223</span>                                          {</div>
-<div class="line"><span class="lineno">  224</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> res;</div>
+<div class="line"><span class="lineno">  224</span>        std::vector&lt;int64_t&gt; res;</div>
 <div class="line"><span class="lineno">  225</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> == <span class="keyword">nullptr</span>) {</div>
-<div class="line"><span class="lineno">  226</span>            <span class="keywordflow">return</span> res;  <span class="comment">///&lt; Return empty vector</span></div>
+<div class="line"><span class="lineno">  226</span>            <span class="keywordflow">return</span> res;  </div>
 <div class="line"><span class="lineno">  227</span>        }</div>
 <div class="line"><span class="lineno">  228</span>        <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* temp = <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;</div>
 <div class="line"><span class="lineno">  229</span>        <span class="keywordflow">do</span> {</div>
-<div class="line"><span class="lineno">  230</span>            res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(temp-&gt;data);</div>
+<div class="line"><span class="lineno">  230</span>            res.push_back(temp-&gt;data);</div>
 <div class="line"><span class="lineno">  231</span>            temp = temp-&gt;next;</div>
 <div class="line"><span class="lineno">  232</span>        } <span class="keywordflow">while</span> (temp != <a class="code hl_variable" href="#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>);</div>
 <div class="line"><span class="lineno">  233</span>        <span class="keywordflow">return</span> res;</div>
 <div class="line"><span class="lineno">  234</span>    }</div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.svg" width="406" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
@@ -792,12 +794,40 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>Pointer to the last <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>. </p>
-<div class="fragment"><div class="line"><span class="lineno">   60</span>{};  <span class="comment">///&lt; Pointer to the last Node</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00060">60</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   60</span>{};  </div>
 </div><!-- fragment -->
+</div>
+</div>
+<a id="a5d5cebd6bc906c60763fc6be10cfdd13" name="a5d5cebd6bc906c60763fc6be10cfdd13"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a5d5cebd6bc906c60763fc6be10cfdd13">&#9670;&#160;</a></span>root</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname"><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::CircularLinkedList::root</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Pointer to the root <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>. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>operations_on_datastructures/<a class="el" href="../../de/d33/circular__linked__list_8cpp.html">circular_linked_list.cpp</a></li>
+<li>operations_on_datastructures/<a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.map b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.map
deleted file mode 100644
index cd2f4cf3c..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="operations_on_datastructures::circular_linked_list::CircularLinkedList::values" name="operations_on_datastructures::circular_linked_list::CircularLinkedList::values">
-<area shape="rect" id="Node000001" title="Returns a std::vector of the values of the Circular Linked List, beginning from a given Node." alt="" coords="5,5,198,61"/>
-<area shape="rect" id="Node000002" 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="246,20,400,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="198,30,230,30,230,36,198,36"/>
-</map>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.md5 b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.md5
deleted file mode 100644
index 28673311e..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7dc900717e44606dee5b069c194bc5a1
\ No newline at end of file
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.svg
deleted file mode 100644
index 95d7ece22..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::circular_linked_list::CircularLinkedList::values Pages: 1 -->
-<svg width="304pt" height="50pt"
- viewBox="0.00 0.00 304.00 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>operations_on_datastructures::circular_linked_list::CircularLinkedList::values</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Returns a std::vector of the values of the Circular Linked List, beginning from a given Node.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::values</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296,-30.5 180.25,-30.5 180.25,-11.25 296,-11.25 296,-30.5"/>
-<text text-anchor="middle" x="238.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.58,-20.88C152.58,-20.88 160.72,-20.88 168.69,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.68,-24.38 178.68,-20.88 168.68,-17.38 168.68,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph_org.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph_org.svg
deleted file mode 100644
index f1f60d52e..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a03a896b34d27fda69049827e0c4dab42_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::circular_linked_list::CircularLinkedList::values Pages: 1 -->
-<svg width="304pt" height="50pt"
- viewBox="0.00 0.00 304.00 49.75" 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.75)">
-<title>operations_on_datastructures::circular_linked_list::CircularLinkedList::values</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Returns a std::vector of the values of the Circular Linked List, beginning from a given Node.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::values</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296,-30.5 180.25,-30.5 180.25,-11.25 296,-11.25 296,-30.5"/>
-<text text-anchor="middle" x="238.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.58,-20.88C152.58,-20.88 160.72,-20.88 168.69,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.68,-24.38 178.68,-20.88 168.68,-17.38 168.68,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.map b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.map
deleted file mode 100644
index 01b6cb146..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList" name="operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList">
-<area shape="rect" id="Node000001" title="Copy constructor for CircularLinkedList." alt="" coords="5,57,198,113"/>
-<area shape="rect" id="Node000002" href="$d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986" title=" " alt="" coords="246,5,438,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="198,62,230,55,231,60,199,67"/>
-<area shape="rect" id="Node000003" href="$d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d" title="Inserts all the values from a vector into the Circular Linked List." alt="" coords="246,109,438,165"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="199,103,231,110,230,116,198,109"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="295,109,295,99,304,90,319,85,342,83,367,85,382,92,380,97,366,90,342,88,321,90,307,95,300,101,300,109"/>
-<area shape="rect" id="Node000004" href="$d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de" title="Returns a std::vector of the values of the Circular Linked List." alt="" coords="486,109,678,165"/>
-<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="438,134,470,134,470,140,438,140"/>
-<area shape="poly" id="edge5_Node000004_Node000004" title=" " alt="" coords="535,109,536,99,544,90,560,85,582,83,607,85,623,92,621,97,606,90,582,88,561,90,547,95,541,101,540,109"/>
-</map>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.md5 b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.md5
deleted file mode 100644
index 518b0effa..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4a818fd93ec43c00cb506e95f060ec9a
\ No newline at end of file
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.svg
deleted file mode 100644
index 486ec610e..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph.svg
+++ /dev/null
@@ -1,184 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList Pages: 1 -->
-<!--zoomable 128 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 513;
-var viewHeight = 128;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Copy constructor for CircularLinkedList.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-80.75 0,-80.75 0,-39 144.25,-39 144.25,-80.75"/>
-<text text-anchor="start" x="8" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="72.12" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::CircularLinkedList</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.5,-119.75 180.25,-119.75 180.25,-78 324.5,-78 324.5,-119.75"/>
-<text text-anchor="start" x="188.25" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="252.38" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-75.51C152.59,-77.26 160.78,-79.05 168.89,-80.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.89,-84.19 178.41,-82.91 169.39,-77.35 167.89,-84.19"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d" target="_top" xlink:title="Inserts all the values from a vector into the Circular Linked List.">
-<polygon fill="white" stroke="#666666" points="324.5,-41.75 180.25,-41.75 180.25,0 324.5,0 324.5,-41.75"/>
-<text text-anchor="start" x="188.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-44.24C152.59,-42.49 160.78,-40.7 168.89,-38.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.39,-42.4 178.41,-36.84 167.89,-35.56 169.39,-42.4"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.11,-42.07C215.94,-51.55 227.03,-59.75 252.38,-59.75 267.03,-59.75 276.92,-57.01 282.04,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.32,-54.1 285.16,-43.5 278.68,-51.88 285.32,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de" target="_top" xlink:title="Returns a std::vector of the values of the Circular Linked List.">
-<polygon fill="white" stroke="#666666" points="504.75,-41.75 360.5,-41.75 360.5,0 504.75,0 504.75,-41.75"/>
-<text text-anchor="start" x="368.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="368.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="432.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::values</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.85,-20.88C332.75,-20.88 340.84,-20.88 348.86,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.62,-24.38 358.62,-20.88 348.62,-17.38 348.62,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M399.36,-42.07C396.19,-51.55 407.28,-59.75 432.62,-59.75 447.28,-59.75 457.17,-57.01 462.29,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="465.57,-54.1 465.41,-43.5 458.93,-51.88 465.57,-54.1"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph_org.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph_org.svg
deleted file mode 100644
index 2af5932e6..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a142fa439b102c6f86341f421ddcfe0a1_cgraph_org.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList Pages: 1 -->
-<svg width="513pt" height="128pt"
- viewBox="0.00 0.00 512.75 127.75" 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 123.75)">
-<title>operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Copy constructor for CircularLinkedList.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-80.75 0,-80.75 0,-39 144.25,-39 144.25,-80.75"/>
-<text text-anchor="start" x="8" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="72.12" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::CircularLinkedList</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.5,-119.75 180.25,-119.75 180.25,-78 324.5,-78 324.5,-119.75"/>
-<text text-anchor="start" x="188.25" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="252.38" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-75.51C152.59,-77.26 160.78,-79.05 168.89,-80.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.89,-84.19 178.41,-82.91 169.39,-77.35 167.89,-84.19"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d" target="_top" xlink:title="Inserts all the values from a vector into the Circular Linked List.">
-<polygon fill="white" stroke="#666666" points="324.5,-41.75 180.25,-41.75 180.25,0 324.5,0 324.5,-41.75"/>
-<text text-anchor="start" x="188.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-44.24C152.59,-42.49 160.78,-40.7 168.89,-38.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.39,-42.4 178.41,-36.84 167.89,-35.56 169.39,-42.4"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.11,-42.07C215.94,-51.55 227.03,-59.75 252.38,-59.75 267.03,-59.75 276.92,-57.01 282.04,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.32,-54.1 285.16,-43.5 278.68,-51.88 285.32,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de" target="_top" xlink:title="Returns a std::vector of the values of the Circular Linked List.">
-<polygon fill="white" stroke="#666666" points="504.75,-41.75 360.5,-41.75 360.5,0 504.75,0 504.75,-41.75"/>
-<text text-anchor="start" x="368.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="368.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="432.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::values</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.85,-20.88C332.75,-20.88 340.84,-20.88 348.86,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.62,-24.38 358.62,-20.88 348.62,-17.38 348.62,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M399.36,-42.07C396.19,-51.55 407.28,-59.75 432.62,-59.75 447.28,-59.75 457.17,-57.01 462.29,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="465.57,-54.1 465.41,-43.5 458.93,-51.88 465.57,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.map b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.map
deleted file mode 100644
index cc5d3be86..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="operations_on_datastructures::circular_linked_list::CircularLinkedList::insert" name="operations_on_datastructures::circular_linked_list::CircularLinkedList::insert">
-<area shape="rect" id="Node000001" title="Inserts a single value into the Circular Linked List." alt="" coords="5,29,198,85"/>
-<area shape="rect" id="Node000002" href="$d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d" title="Inserts all the values from a vector into the Circular Linked List." alt="" coords="246,29,438,85"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="198,54,230,54,230,60,198,60"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="295,29,295,19,304,10,319,5,342,3,367,5,382,12,380,17,366,10,342,8,321,10,307,15,300,21,300,29"/>
-<area shape="rect" id="Node000003" href="$d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de" title="Returns a std::vector of the values of the Circular Linked List." alt="" coords="486,29,678,85"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="438,54,470,54,470,60,438,60"/>
-<area shape="poly" id="edge4_Node000003_Node000003" title=" " alt="" coords="535,29,536,19,544,10,560,5,582,3,607,5,623,12,621,17,606,10,582,8,561,10,547,15,541,21,540,29"/>
-</map>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.md5 b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.md5
deleted file mode 100644
index 50a2c107b..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f21cadf6b8031afb72fb8510be269e4e
\ No newline at end of file
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.svg
deleted file mode 100644
index 9fc0fcf07..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph.svg
+++ /dev/null
@@ -1,164 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::circular_linked_list::CircularLinkedList::insert Pages: 1 -->
-<!--zoomable 68 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 513;
-var viewHeight = 68;
-var sectionId = 'dynsection-4';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>operations_on_datastructures::circular_linked_list::CircularLinkedList::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Inserts a single value into the Circular Linked List.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d" target="_top" xlink:title="Inserts all the values from a vector into the Circular Linked List.">
-<polygon fill="white" stroke="#666666" points="324.5,-41.75 180.25,-41.75 180.25,0 324.5,0 324.5,-41.75"/>
-<text text-anchor="start" x="188.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-20.88C152.5,-20.88 160.59,-20.88 168.61,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.37,-24.38 178.37,-20.88 168.37,-17.38 168.37,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.11,-42.07C215.94,-51.55 227.03,-59.75 252.38,-59.75 267.03,-59.75 276.92,-57.01 282.04,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.32,-54.1 285.16,-43.5 278.68,-51.88 285.32,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de" target="_top" xlink:title="Returns a std::vector of the values of the Circular Linked List.">
-<polygon fill="white" stroke="#666666" points="504.75,-41.75 360.5,-41.75 360.5,0 504.75,0 504.75,-41.75"/>
-<text text-anchor="start" x="368.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="368.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="432.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::values</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.85,-20.88C332.75,-20.88 340.84,-20.88 348.86,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.62,-24.38 358.62,-20.88 348.62,-17.38 348.62,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M399.36,-42.07C396.19,-51.55 407.28,-59.75 432.62,-59.75 447.28,-59.75 457.17,-57.01 462.29,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="465.57,-54.1 465.41,-43.5 458.93,-51.88 465.57,-54.1"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph_org.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph_org.svg
deleted file mode 100644
index d681fbb62..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a3b7bbb0918c261bc216aef9e6dd39aa4_cgraph_org.svg
+++ /dev/null
@@ -1,81 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::circular_linked_list::CircularLinkedList::insert Pages: 1 -->
-<svg width="513pt" height="68pt"
- viewBox="0.00 0.00 512.75 67.75" 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 63.75)">
-<title>operations_on_datastructures::circular_linked_list::CircularLinkedList::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Inserts a single value into the Circular Linked List.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d" target="_top" xlink:title="Inserts all the values from a vector into the Circular Linked List.">
-<polygon fill="white" stroke="#666666" points="324.5,-41.75 180.25,-41.75 180.25,0 324.5,0 324.5,-41.75"/>
-<text text-anchor="start" x="188.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-20.88C152.5,-20.88 160.59,-20.88 168.61,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.37,-24.38 178.37,-20.88 168.37,-17.38 168.37,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.11,-42.07C215.94,-51.55 227.03,-59.75 252.38,-59.75 267.03,-59.75 276.92,-57.01 282.04,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.32,-54.1 285.16,-43.5 278.68,-51.88 285.32,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de" target="_top" xlink:title="Returns a std::vector of the values of the Circular Linked List.">
-<polygon fill="white" stroke="#666666" points="504.75,-41.75 360.5,-41.75 360.5,0 504.75,0 504.75,-41.75"/>
-<text text-anchor="start" x="368.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="368.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="432.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::values</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.85,-20.88C332.75,-20.88 340.84,-20.88 348.86,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.62,-24.38 358.62,-20.88 348.62,-17.38 348.62,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M399.36,-42.07C396.19,-51.55 407.28,-59.75 432.62,-59.75 447.28,-59.75 457.17,-57.01 462.29,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="465.57,-54.1 465.41,-43.5 458.93,-51.88 465.57,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.map b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.map
deleted file mode 100644
index c2d253efd..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="operations_on_datastructures::circular_linked_list::CircularLinkedList::~CircularLinkedList" name="operations_on_datastructures::circular_linked_list::CircularLinkedList::~CircularLinkedList">
-<area shape="rect" id="Node000001" title="Cleans up memory when destroyed." alt="" coords="5,5,206,61"/>
-<area shape="rect" id="Node000002" href="$d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986" title=" " alt="" coords="254,5,446,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="206,30,238,30,238,36,206,36"/>
-</map>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.md5 b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.md5
deleted file mode 100644
index bf066693c..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-405e3ef92d767f7f12bab784089b81d5
\ No newline at end of file
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.svg
deleted file mode 100644
index c3f70c280..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph.svg
+++ /dev/null
@@ -1,69 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::circular_linked_list::CircularLinkedList::~CircularLinkedList Pages: 1 -->
-<svg width="339pt" height="50pt"
- viewBox="0.00 0.00 338.50 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>operations_on_datastructures::circular_linked_list::CircularLinkedList::~CircularLinkedList</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Cleans up memory when destroyed.">
-<polygon fill="#999999" stroke="#666666" points="150.25,-41.75 0,-41.75 0,0 150.25,0 150.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="75.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::~CircularLinkedList</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="330.5,-41.75 186.25,-41.75 186.25,0 330.5,0 330.5,-41.75"/>
-<text text-anchor="start" x="194.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="194.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="258.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.63,-20.88C158.44,-20.88 166.41,-20.88 174.3,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.27,-24.38 184.27,-20.88 174.27,-17.38 174.27,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph_org.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph_org.svg
deleted file mode 100644
index 26d62211d..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a46195fcf11b636064c7172cb74b55dd0_cgraph_org.svg
+++ /dev/null
@@ -1,43 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::circular_linked_list::CircularLinkedList::~CircularLinkedList Pages: 1 -->
-<svg width="339pt" height="50pt"
- viewBox="0.00 0.00 338.50 49.75" 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.75)">
-<title>operations_on_datastructures::circular_linked_list::CircularLinkedList::~CircularLinkedList</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Cleans up memory when destroyed.">
-<polygon fill="#999999" stroke="#666666" points="150.25,-41.75 0,-41.75 0,0 150.25,0 150.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="75.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::~CircularLinkedList</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="330.5,-41.75 186.25,-41.75 186.25,0 330.5,0 330.5,-41.75"/>
-<text text-anchor="start" x="194.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="194.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="258.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.63,-20.88C158.44,-20.88 166.41,-20.88 174.3,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.27,-24.38 184.27,-20.88 174.27,-17.38 174.27,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.map b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.map
deleted file mode 100644
index f8d01f5dc..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="operations_on_datastructures::circular_linked_list::CircularLinkedList::values" name="operations_on_datastructures::circular_linked_list::CircularLinkedList::values">
-<area shape="rect" id="Node000001" title="Returns a std::vector of the values of the Circular Linked List." alt="" coords="5,29,198,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="63,29,64,19,71,10,83,5,102,3,122,5,134,12,132,17,120,10,101,8,85,10,74,14,69,21,69,29"/>
-</map>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.md5 b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.md5
deleted file mode 100644
index 9bc286c85..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-18ca39e3011e7dacddc3b086639c4083
\ No newline at end of file
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.svg
deleted file mode 100644
index c40805240..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::circular_linked_list::CircularLinkedList::values Pages: 1 -->
-<svg width="152pt" height="68pt"
- viewBox="0.00 0.00 152.25 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>operations_on_datastructures::circular_linked_list::CircularLinkedList::values</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Returns a std::vector of the values of the Circular Linked List.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::values</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.5,-42.07C42.97,-51.55 51.84,-59.75 72.12,-59.75 83.85,-59.75 91.77,-57.01 95.87,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.16,-54.1 98.36,-43.53 92.4,-52.29 99.16,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph_org.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph_org.svg
deleted file mode 100644
index 4e295c951..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a53611ec1fef92eeeb875aea1bde1e4de_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::circular_linked_list::CircularLinkedList::values Pages: 1 -->
-<svg width="152pt" height="68pt"
- viewBox="0.00 0.00 152.25 67.75" 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 63.75)">
-<title>operations_on_datastructures::circular_linked_list::CircularLinkedList::values</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Returns a std::vector of the values of the Circular Linked List.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::values</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.5,-42.07C42.97,-51.55 51.84,-59.75 72.12,-59.75 83.85,-59.75 91.77,-57.01 95.87,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.16,-54.1 98.36,-43.53 92.4,-52.29 99.16,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.map b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.map
deleted file mode 100644
index d9c028fbc..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=" name="operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=">
-<area shape="rect" id="Node000001" title="Copy assignment operator." alt="" coords="5,57,198,113"/>
-<area shape="rect" id="Node000002" href="$d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986" title=" " alt="" coords="246,5,438,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="198,62,230,55,231,60,199,67"/>
-<area shape="rect" id="Node000003" href="$d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d" title="Inserts all the values from a vector into the Circular Linked List." alt="" coords="246,109,438,165"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="199,103,231,110,230,116,198,109"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="295,109,295,99,304,90,319,85,342,83,367,85,382,92,380,97,366,90,342,88,321,90,307,95,300,101,300,109"/>
-<area shape="rect" id="Node000004" href="$d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de" title="Returns a std::vector of the values of the Circular Linked List." alt="" coords="486,109,678,165"/>
-<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="438,134,470,134,470,140,438,140"/>
-<area shape="poly" id="edge5_Node000004_Node000004" title=" " alt="" coords="535,109,536,99,544,90,560,85,582,83,607,85,623,92,621,97,606,90,582,88,561,90,547,95,541,101,540,109"/>
-</map>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.md5 b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.md5
deleted file mode 100644
index 7bd4024d9..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f8828c6a1681865b2e4f4c7e18e4e877
\ No newline at end of file
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.svg
deleted file mode 100644
index afa6be082..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph.svg
+++ /dev/null
@@ -1,184 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::circular_linked_list::CircularLinkedList::operator= Pages: 1 -->
-<!--zoomable 128 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 513;
-var viewHeight = 128;
-var sectionId = 'dynsection-5';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Copy assignment operator.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-80.75 0,-80.75 0,-39 144.25,-39 144.25,-80.75"/>
-<text text-anchor="start" x="8" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="72.12" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::operator=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.5,-119.75 180.25,-119.75 180.25,-78 324.5,-78 324.5,-119.75"/>
-<text text-anchor="start" x="188.25" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="252.38" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-75.51C152.59,-77.26 160.78,-79.05 168.89,-80.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.89,-84.19 178.41,-82.91 169.39,-77.35 167.89,-84.19"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d" target="_top" xlink:title="Inserts all the values from a vector into the Circular Linked List.">
-<polygon fill="white" stroke="#666666" points="324.5,-41.75 180.25,-41.75 180.25,0 324.5,0 324.5,-41.75"/>
-<text text-anchor="start" x="188.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-44.24C152.59,-42.49 160.78,-40.7 168.89,-38.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.39,-42.4 178.41,-36.84 167.89,-35.56 169.39,-42.4"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.11,-42.07C215.94,-51.55 227.03,-59.75 252.38,-59.75 267.03,-59.75 276.92,-57.01 282.04,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.32,-54.1 285.16,-43.5 278.68,-51.88 285.32,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de" target="_top" xlink:title="Returns a std::vector of the values of the Circular Linked List.">
-<polygon fill="white" stroke="#666666" points="504.75,-41.75 360.5,-41.75 360.5,0 504.75,0 504.75,-41.75"/>
-<text text-anchor="start" x="368.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="368.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="432.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::values</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.85,-20.88C332.75,-20.88 340.84,-20.88 348.86,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.62,-24.38 358.62,-20.88 348.62,-17.38 348.62,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M399.36,-42.07C396.19,-51.55 407.28,-59.75 432.62,-59.75 447.28,-59.75 457.17,-57.01 462.29,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="465.57,-54.1 465.41,-43.5 458.93,-51.88 465.57,-54.1"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph_org.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph_org.svg
deleted file mode 100644
index 8ff423cd9..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_a9cc37166f2f73763df39894b675f89c9_cgraph_org.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::circular_linked_list::CircularLinkedList::operator= Pages: 1 -->
-<svg width="513pt" height="128pt"
- viewBox="0.00 0.00 512.75 127.75" 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 123.75)">
-<title>operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Copy assignment operator.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-80.75 0,-80.75 0,-39 144.25,-39 144.25,-80.75"/>
-<text text-anchor="start" x="8" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="72.12" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::operator=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.5,-119.75 180.25,-119.75 180.25,-78 324.5,-78 324.5,-119.75"/>
-<text text-anchor="start" x="188.25" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="252.38" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-75.51C152.59,-77.26 160.78,-79.05 168.89,-80.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.89,-84.19 178.41,-82.91 169.39,-77.35 167.89,-84.19"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d" target="_top" xlink:title="Inserts all the values from a vector into the Circular Linked List.">
-<polygon fill="white" stroke="#666666" points="324.5,-41.75 180.25,-41.75 180.25,0 324.5,0 324.5,-41.75"/>
-<text text-anchor="start" x="188.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-44.24C152.59,-42.49 160.78,-40.7 168.89,-38.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.39,-42.4 178.41,-36.84 167.89,-35.56 169.39,-42.4"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.11,-42.07C215.94,-51.55 227.03,-59.75 252.38,-59.75 267.03,-59.75 276.92,-57.01 282.04,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.32,-54.1 285.16,-43.5 278.68,-51.88 285.32,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de" target="_top" xlink:title="Returns a std::vector of the values of the Circular Linked List.">
-<polygon fill="white" stroke="#666666" points="504.75,-41.75 360.5,-41.75 360.5,0 504.75,0 504.75,-41.75"/>
-<text text-anchor="start" x="368.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="368.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="432.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::values</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.85,-20.88C332.75,-20.88 340.84,-20.88 348.86,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.62,-24.38 358.62,-20.88 348.62,-17.38 348.62,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M399.36,-42.07C396.19,-51.55 407.28,-59.75 432.62,-59.75 447.28,-59.75 457.17,-57.01 462.29,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="465.57,-54.1 465.41,-43.5 458.93,-51.88 465.57,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.map b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.map
deleted file mode 100644
index adfe386aa..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="operations_on_datastructures::circular_linked_list::CircularLinkedList::print" name="operations_on_datastructures::circular_linked_list::CircularLinkedList::print">
-<area shape="rect" id="Node000001" title="Prints the values of the Circular Linked List, beginning from the root Node." alt="" coords="5,29,198,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="63,29,64,19,71,10,83,5,102,3,122,5,134,12,132,17,120,10,101,8,85,10,74,14,69,21,69,29"/>
-</map>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.md5 b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.md5
deleted file mode 100644
index 0ed5a9b95..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e9b40f8e6d7907256263f140155abfad
\ No newline at end of file
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.svg
deleted file mode 100644
index 4a27920f2..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::circular_linked_list::CircularLinkedList::print Pages: 1 -->
-<svg width="152pt" height="68pt"
- viewBox="0.00 0.00 152.25 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>operations_on_datastructures::circular_linked_list::CircularLinkedList::print</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Prints the values of the Circular Linked List, beginning from the root Node.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::print</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.5,-42.07C42.97,-51.55 51.84,-59.75 72.12,-59.75 83.85,-59.75 91.77,-57.01 95.87,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.16,-54.1 98.36,-43.53 92.4,-52.29 99.16,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph_org.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph_org.svg
deleted file mode 100644
index 0d7e06384..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac341901e926b3fa3a796c64ca572f592_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::circular_linked_list::CircularLinkedList::print Pages: 1 -->
-<svg width="152pt" height="68pt"
- viewBox="0.00 0.00 152.25 67.75" 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 63.75)">
-<title>operations_on_datastructures::circular_linked_list::CircularLinkedList::print</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Prints the values of the Circular Linked List, beginning from the root Node.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::print</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.5,-42.07C42.97,-51.55 51.84,-59.75 72.12,-59.75 83.85,-59.75 91.77,-57.01 95.87,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.16,-54.1 98.36,-43.53 92.4,-52.29 99.16,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.map b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.map
deleted file mode 100644
index 0b60d98f2..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="operations_on_datastructures::circular_linked_list::CircularLinkedList::insert" name="operations_on_datastructures::circular_linked_list::CircularLinkedList::insert">
-<area shape="rect" id="Node000001" title="Inserts all the values from a vector into the Circular Linked List." alt="" coords="5,29,198,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="54,29,55,19,64,10,79,5,102,3,127,5,142,12,140,17,125,10,101,8,80,10,66,15,60,21,60,29"/>
-<area shape="rect" id="Node000002" href="$d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de" title="Returns a std::vector of the values of the Circular Linked List." alt="" coords="246,29,438,85"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="198,54,230,54,230,60,198,60"/>
-<area shape="poly" id="edge3_Node000002_Node000002" title=" " alt="" coords="295,29,295,19,304,10,319,5,342,3,367,5,382,12,380,17,366,10,342,8,321,10,307,15,300,21,300,29"/>
-</map>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.md5 b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.md5
deleted file mode 100644
index 113c36c01..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0d0bc6a3ee6edf0cd5e6842752ecb1e1
\ No newline at end of file
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.svg
deleted file mode 100644
index 9bd20b992..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph.svg
+++ /dev/null
@@ -1,87 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::circular_linked_list::CircularLinkedList::insert Pages: 1 -->
-<svg width="333pt" height="68pt"
- viewBox="0.00 0.00 332.50 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>operations_on_datastructures::circular_linked_list::CircularLinkedList::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Inserts all the values from a vector into the Circular Linked List.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.86,-42.07C35.69,-51.55 46.78,-59.75 72.12,-59.75 86.78,-59.75 96.67,-57.01 101.79,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.07,-54.1 104.91,-43.5 98.43,-51.88 105.07,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de" target="_top" xlink:title="Returns a std::vector of the values of the Circular Linked List.">
-<polygon fill="white" stroke="#666666" points="324.5,-41.75 180.25,-41.75 180.25,0 324.5,0 324.5,-41.75"/>
-<text text-anchor="start" x="188.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::values</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-20.88C152.5,-20.88 160.59,-20.88 168.61,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.37,-24.38 178.37,-20.88 168.37,-17.38 168.37,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.11,-42.07C215.94,-51.55 227.03,-59.75 252.38,-59.75 267.03,-59.75 276.92,-57.01 282.04,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.32,-54.1 285.16,-43.5 278.68,-51.88 285.32,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph_org.svg b/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph_org.svg
deleted file mode 100644
index e88c61a96..000000000
--- a/d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_ac38565472a07d07f63ec0d2fd8a69d4d_cgraph_org.svg
+++ /dev/null
@@ -1,61 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::circular_linked_list::CircularLinkedList::insert Pages: 1 -->
-<svg width="333pt" height="68pt"
- viewBox="0.00 0.00 332.50 67.75" 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 63.75)">
-<title>operations_on_datastructures::circular_linked_list::CircularLinkedList::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Inserts all the values from a vector into the Circular Linked List.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-41.75 0,-41.75 0,0 144.25,0 144.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.86,-42.07C35.69,-51.55 46.78,-59.75 72.12,-59.75 86.78,-59.75 96.67,-57.01 101.79,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.07,-54.1 104.91,-43.5 98.43,-51.88 105.07,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de" target="_top" xlink:title="Returns a std::vector of the values of the Circular Linked List.">
-<polygon fill="white" stroke="#666666" points="324.5,-41.75 180.25,-41.75 180.25,0 324.5,0 324.5,-41.75"/>
-<text text-anchor="start" x="188.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="188.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
-<text text-anchor="middle" x="252.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList::values</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.6,-20.88C152.5,-20.88 160.59,-20.88 168.61,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.37,-24.38 178.37,-20.88 168.37,-17.38 168.37,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.11,-42.07C215.94,-51.55 227.03,-59.75 252.38,-59.75 267.03,-59.75 276.92,-57.01 282.04,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.32,-54.1 285.16,-43.5 278.68,-51.88 285.32,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d7c/radix__sort_8cpp_source.html b/d8/d7c/radix__sort_8cpp_source.html
new file mode 100644
index 000000000..bc3741bf2
--- /dev/null
+++ b/d8/d7c/radix__sort_8cpp_source.html
@@ -0,0 +1,197 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/radix_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/d7c/radix__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">radix_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;cstdlib&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="keywordtype">void</span> radixsort(<span class="keywordtype">int</span> a[], <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span>    <span class="keywordtype">int</span> count[10];</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>    <span class="keywordtype">int</span>* output = <span class="keyword">new</span> <span class="keywordtype">int</span>[n];</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    memset(output, 0, n * <span class="keyword">sizeof</span>(*output));</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    memset(count, 0, <span class="keyword">sizeof</span>(count));</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    <span class="keywordtype">int</span> max = 0;</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>        <span class="keywordflow">if</span> (a[i] &gt; max) {</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>            max = a[i];</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>        }</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    }</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="keywordtype">int</span> maxdigits = 0;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="keywordflow">while</span> (max) {</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        maxdigits++;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        max /= 10;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    }</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; maxdigits; j++) {</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>            <span class="keywordtype">int</span> t = std::pow(10, j);</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>            count[(a[i] % (10 * t)) / t]++;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        }</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = 0;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> p = 0; p &lt; 10; p++) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>                <span class="keywordtype">int</span> t = std::pow(10, j);</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>                <span class="keywordflow">if</span> ((a[i] % (10 * t)) / t == p) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>                    output[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] = a[i];</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>                    <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>                }</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>            }</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        }</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        memset(count, 0, <span class="keyword">sizeof</span>(count));</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            a[i] = output[i];</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        }</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    }</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keyword">delete</span>[] output;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>}</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="keywordtype">void</span> print(<span class="keywordtype">int</span> a[], <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        std::cout &lt;&lt; a[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>}</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> <span class="keyword">const</span>* argv[]) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordtype">int</span> a[] = {170, 45, 75, 90, 802, 24, 2, 66};</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordtype">int</span> n = <span class="keyword">sizeof</span>(a) / <span class="keyword">sizeof</span>(a[0]);</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    radixsort(a, n);</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    print(a, n);</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}</div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><b>radix_sort.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp.html b/d8/d7d/kruskals__minimum__spanning__tree_8cpp.html
index 234a85018..59a4df7d4 100644
--- a/d8/d7d/kruskals__minimum__spanning__tree_8cpp.html
+++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: greedy_algorithms/kruskals_minimum_spanning_tree.cpp File Reference</title>
+<title>TheAlgorithms/C++: greedy_algorithms/kruskals_minimum_spanning_tree.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for kruskals_minimum_spanning_tree.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d2b/kruskals__minimum__spanning__tree_8cpp__incl.svg" width="318" height="126"><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">
+</div>
+<p><a href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></td></tr>
@@ -131,8 +150,8 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a349e4ab9a97532c3931a2bd2a19c0098" id="r_a349e4ab9a97532c3931a2bd2a19c0098"><td class="memTemplParams" colspan="2">template&lt;typename T , <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> N, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> M&gt; </td></tr>
-<tr class="memitem:a349e4ab9a97532c3931a2bd2a19c0098"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a> (const T &amp;infinity, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt;, M &gt; &amp;graph)</td></tr>
+<tr class="memitem:a349e4ab9a97532c3931a2bd2a19c0098" id="r_a349e4ab9a97532c3931a2bd2a19c0098"><td class="memTemplParams" colspan="2">template&lt;typename T , std::size_t N, std::size_t M&gt; </td></tr>
+<tr class="memitem:a349e4ab9a97532c3931a2bd2a19c0098"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a> (const T &amp;infinity, const std::array&lt; std::array&lt; T, N &gt;, M &gt; &amp;graph)</td></tr>
 <tr class="memdesc:a349e4ab9a97532c3931a2bd2a19c0098"><td class="mdescLeft">&#160;</td><td class="mdescRight">Finds the minimum edge of the given graph.  <br /></td></tr>
 <tr class="separator:a349e4ab9a97532c3931a2bd2a19c0098"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -147,6 +166,8 @@ Functions</h2></td></tr>
 <p><em>Quoted from <a href="https://www.simplilearn.com/tutorials/data-structure-tutorial/kruskal-algorithm" target="_blank">Simplilearn</a>.</em></p>
 <p>Kruskal’s algorithm is the concept that is introduced in the graph theory of discrete mathematics. It is used to discover the shortest path between two points in a connected weighted graph. This algorithm converts a given graph into the forest, considering each node as a separate tree. These trees can only link to each other if the edge connecting them has a low value and doesn’t generate a cycle in MST structure.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/coleman2246" target="_blank">coleman2246</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html">kruskals_minimum_spanning_tree.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -165,17 +186,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html#l00184">184</a> of file <a class="el" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html">kruskals_minimum_spanning_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  184</span>           {</div>
 <div class="line"><span class="lineno">  185</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run Self-test implementation</span></div>
 <div class="line"><span class="lineno">  186</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  187</span>}</div>
-<div class="ttc" id="akruskals__minimum__spanning__tree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> kruskals_minimum_spanning_tree.cpp:64</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="364" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="akruskals__minimum__spanning__tree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html#l00064">kruskals_minimum_spanning_tree.cpp:64</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -204,21 +222,17 @@ 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>
 <p>define a large value for int define a large value for float define a large value for double define a large value for uint32_t</p>
-<div class="fragment"><div class="line"><span class="lineno">   64</span>                   {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   65</span><span class="comment">    /**</span></div>
-<div class="line"><span class="lineno">   66</span><span class="comment">     * define a large value for int</span></div>
-<div class="line"><span class="lineno">   67</span><span class="comment">     * define a large value for float</span></div>
-<div class="line"><span class="lineno">   68</span><span class="comment">     * define a large value for double</span></div>
-<div class="line"><span class="lineno">   69</span><span class="comment">     * define a large value for uint32_t</span></div>
-<div class="line"><span class="lineno">   70</span><span class="comment">     */</span></div>
-<div class="line"><span class="lineno">   71</span>    <span class="keyword">constexpr</span> <span class="keywordtype">int</span> INFINITY_INT = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html">std::numeric_limits&lt;int&gt;::max</a>();</div>
-<div class="line"><span class="lineno">   72</span>    <span class="keyword">constexpr</span> <span class="keywordtype">float</span> INFINITY_FLOAT = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html">std::numeric_limits&lt;float&gt;::max</a>();</div>
-<div class="line"><span class="lineno">   73</span>    <span class="keyword">constexpr</span> <span class="keywordtype">double</span> INFINITY_DOUBLE = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html">std::numeric_limits&lt;double&gt;::max</a>();</div>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html">kruskals_minimum_spanning_tree.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   64</span>                   {</div>
+<div class="line"><span class="lineno">   71</span>    <span class="keyword">constexpr</span> <span class="keywordtype">int</span> INFINITY_INT = std::numeric_limits&lt;int&gt;::max();</div>
+<div class="line"><span class="lineno">   72</span>    <span class="keyword">constexpr</span> <span class="keywordtype">float</span> INFINITY_FLOAT = std::numeric_limits&lt;float&gt;::max();</div>
+<div class="line"><span class="lineno">   73</span>    <span class="keyword">constexpr</span> <span class="keywordtype">double</span> INFINITY_DOUBLE = std::numeric_limits&lt;double&gt;::max();</div>
 <div class="line"><span class="lineno">   74</span>    <span class="keyword">constexpr</span> uint32_t INFINITY_UINT32 = UINT32_MAX;</div>
 <div class="line"><span class="lineno">   75</span>  </div>
 <div class="line"><span class="lineno">   76</span>    <span class="comment">// Test case with integer values</span></div>
-<div class="line"><span class="lineno">   77</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest Case 1 :\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   78</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;int, 6&gt;</a>, 6&gt; graph1{</div>
+<div class="line"><span class="lineno">   77</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 1 :\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   78</span>    std::array&lt;std::array&lt;int, 6&gt;, 6&gt; graph1{</div>
 <div class="line"><span class="lineno">   79</span>             0,            4,            1,             4,        INFINITY_INT,   INFINITY_INT,</div>
 <div class="line"><span class="lineno">   80</span>             4,            0,            3,             8,             3,         INFINITY_INT,</div>
 <div class="line"><span class="lineno">   81</span>             1,            3,            0,        INFINITY_INT,       1,         INFINITY_INT,</div>
@@ -228,16 +242,16 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   85</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, graph1);</div>
 <div class="line"><span class="lineno">   86</span> </div>
 <div class="line"><span class="lineno">   87</span>    <span class="comment">// Test case with floating values</span></div>
-<div class="line"><span class="lineno">   88</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest Case 2 :\n&quot;</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/array.html">std::array&lt;std::array&lt;float, 3&gt;</a>, 3&gt; graph2{</div>
+<div class="line"><span class="lineno">   88</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 2 :\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   89</span>     std::array&lt;std::array&lt;float, 3&gt;, 3&gt; graph2{</div>
 <div class="line"><span class="lineno">   90</span>             0.0f,           2.5f,  INFINITY_FLOAT,</div>
 <div class="line"><span class="lineno">   91</span>             2.5f,           0.0f,       3.2f,</div>
 <div class="line"><span class="lineno">   92</span>        INFINITY_FLOAT,      3.2f,       0.0f};</div>
 <div class="line"><span class="lineno">   93</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_FLOAT, graph2);</div>
 <div class="line"><span class="lineno">   94</span> </div>
 <div class="line"><span class="lineno">   95</span>    <span class="comment">// Test case with double values</span></div>
-<div class="line"><span class="lineno">   96</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest Case 3 :\n&quot;</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/array.html">std::array&lt;std::array&lt;double, 5&gt;</a>, 5&gt; graph3{</div>
+<div class="line"><span class="lineno">   96</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 3 :\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   97</span>   std::array&lt;std::array&lt;double, 5&gt;, 5&gt; graph3{</div>
 <div class="line"><span class="lineno">   98</span>               0.0,             10.5,       INFINITY_DOUBLE,        6.7,              3.3,</div>
 <div class="line"><span class="lineno">   99</span>               10.5,            0.0,              8.1,              15.4,       INFINITY_DOUBLE,</div>
 <div class="line"><span class="lineno">  100</span>        INFINITY_DOUBLE,        8.1,              0.0,        INFINITY_DOUBLE,         7.8,</div>
@@ -246,24 +260,24 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  103</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_DOUBLE, graph3);</div>
 <div class="line"><span class="lineno">  104</span> </div>
 <div class="line"><span class="lineno">  105</span>    <span class="comment">// Test Case with negative weights</span></div>
-<div class="line"><span class="lineno">  106</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest Case 4 :\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  107</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;int, 3&gt;</a>, 3&gt; graph_neg{</div>
+<div class="line"><span class="lineno">  106</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 4 :\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  107</span>    std::array&lt;std::array&lt;int, 3&gt;, 3&gt; graph_neg{</div>
 <div class="line"><span class="lineno">  108</span>        0,   -2,   4,</div>
 <div class="line"><span class="lineno">  109</span>       -2,    0,   3,</div>
 <div class="line"><span class="lineno">  110</span>        4,    3,   0};</div>
 <div class="line"><span class="lineno">  111</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, graph_neg);</div>
 <div class="line"><span class="lineno">  112</span> </div>
 <div class="line"><span class="lineno">  113</span>    <span class="comment">// Test Case with Self-Loops</span></div>
-<div class="line"><span class="lineno">  114</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest Case 5 :\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  115</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;int, 3&gt;</a>, 3&gt; graph_self_loop{</div>
+<div class="line"><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 5 :\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  115</span>    std::array&lt;std::array&lt;int, 3&gt;, 3&gt; graph_self_loop{</div>
 <div class="line"><span class="lineno">  116</span>               2,       1, INFINITY_INT,</div>
 <div class="line"><span class="lineno">  117</span>        INFINITY_INT,   0,        4,</div>
 <div class="line"><span class="lineno">  118</span>        INFINITY_INT,   4,        0};</div>
 <div class="line"><span class="lineno">  119</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, graph_self_loop);</div>
 <div class="line"><span class="lineno">  120</span> </div>
 <div class="line"><span class="lineno">  121</span>    <span class="comment">// Test Case with no edges</span></div>
-<div class="line"><span class="lineno">  122</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest Case 6 :\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  123</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;int, 4&gt;</a>, 4&gt; no_edges{</div>
+<div class="line"><span class="lineno">  122</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 6 :\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  123</span>    std::array&lt;std::array&lt;int, 4&gt;, 4&gt; no_edges{</div>
 <div class="line"><span class="lineno">  124</span>               0,       INFINITY_INT,   INFINITY_INT,   INFINITY_INT,</div>
 <div class="line"><span class="lineno">  125</span>        INFINITY_INT,         0,        INFINITY_INT,   INFINITY_INT,</div>
 <div class="line"><span class="lineno">  126</span>        INFINITY_INT,   INFINITY_INT,          0,       INFINITY_INT,</div>
@@ -271,8 +285,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  128</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, no_edges);</div>
 <div class="line"><span class="lineno">  129</span> </div>
 <div class="line"><span class="lineno">  130</span>    <span class="comment">// Test Case with a non-connected graph</span></div>
-<div class="line"><span class="lineno">  131</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest Case 7:\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  132</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;int, 4&gt;</a>, 4&gt; partial_graph{</div>
+<div class="line"><span class="lineno">  131</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 7:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  132</span>    std::array&lt;std::array&lt;int, 4&gt;, 4&gt; partial_graph{</div>
 <div class="line"><span class="lineno">  133</span>                0,             2,    INFINITY_INT,         6,</div>
 <div class="line"><span class="lineno">  134</span>                2,             0,            3,     INFINITY_INT,</div>
 <div class="line"><span class="lineno">  135</span>        INFINITY_INT,          3,            0,             4,</div>
@@ -281,8 +295,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  138</span> </div>
 <div class="line"><span class="lineno">  139</span>    <span class="comment">// Test Case with Directed weighted graph. The Krushkal algorithm does not give</span></div>
 <div class="line"><span class="lineno">  140</span>    <span class="comment">// optimal answer</span></div>
-<div class="line"><span class="lineno">  141</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest Case 8:\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  142</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;int, 4&gt;</a>, 4&gt; directed_graph{</div>
+<div class="line"><span class="lineno">  141</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 8:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  142</span>    std::array&lt;std::array&lt;int, 4&gt;, 4&gt; directed_graph{</div>
 <div class="line"><span class="lineno">  143</span>                0,            3,            7,   INFINITY_INT,  <span class="comment">// Vertex 0 has edges to Vertex 1 and Vertex 2</span></div>
 <div class="line"><span class="lineno">  144</span>        INFINITY_INT,         0,            2,           5,  <span class="comment">// Vertex 1 has edges to Vertex 2 and Vertex 3</span></div>
 <div class="line"><span class="lineno">  145</span>        INFINITY_INT, INFINITY_INT,         0,           1,  <span class="comment">// Vertex 2 has an edge to Vertex 3</span></div>
@@ -290,16 +304,16 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  147</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, directed_graph);</div>
 <div class="line"><span class="lineno">  148</span> </div>
 <div class="line"><span class="lineno">  149</span>    <span class="comment">// Test case with wrong input passed</span></div>
-<div class="line"><span class="lineno">  150</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest Case 9:\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  151</span>   <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;int, 4&gt;</a>, 3&gt; graph9{</div>
+<div class="line"><span class="lineno">  150</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 9:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  151</span>   std::array&lt;std::array&lt;int, 4&gt;, 3&gt; graph9{</div>
 <div class="line"><span class="lineno">  152</span>        0,        5,        5,        5,</div>
 <div class="line"><span class="lineno">  153</span>        5,        0,        5,        5,        </div>
 <div class="line"><span class="lineno">  154</span>        5,        5,        5,        5};</div>
 <div class="line"><span class="lineno">  155</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, graph9);</div>
 <div class="line"><span class="lineno">  156</span> </div>
 <div class="line"><span class="lineno">  157</span>    <span class="comment">// Test case with all the same values between every edge</span></div>
-<div class="line"><span class="lineno">  158</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest Case 10:\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  159</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;int, 5&gt;</a>, 5&gt; graph10{</div>
+<div class="line"><span class="lineno">  158</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 10:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  159</span>    std::array&lt;std::array&lt;int, 5&gt;, 5&gt; graph10{</div>
 <div class="line"><span class="lineno">  160</span>        0,        5,        5,        5,        5,</div>
 <div class="line"><span class="lineno">  161</span>        5,        0,        5,        5,        5,</div>
 <div class="line"><span class="lineno">  162</span>        5,        5,        0,        5,        5,</div>
@@ -308,26 +322,18 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  165</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, graph10);</div>
 <div class="line"><span class="lineno">  166</span> </div>
 <div class="line"><span class="lineno">  167</span>  <span class="comment">// Test Case with uint32_t values</span></div>
-<div class="line"><span class="lineno">  168</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest Case 11 :\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  169</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;uint32_t, 4&gt;</a>, 4&gt; graph_uint32{</div>
+<div class="line"><span class="lineno">  168</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 11 :\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  169</span>    std::array&lt;std::array&lt;uint32_t, 4&gt;, 4&gt; graph_uint32{</div>
 <div class="line"><span class="lineno">  170</span>                0,                      5,        INFINITY_UINT32,          9,</div>
 <div class="line"><span class="lineno">  171</span>                5,                      0,                2,        INFINITY_UINT32,</div>
 <div class="line"><span class="lineno">  172</span>        INFINITY_UINT32,                2,                0,                6,</div>
 <div class="line"><span class="lineno">  173</span>                9,               INFINITY_UINT32,         6,                0};</div>
 <div class="line"><span class="lineno">  174</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_UINT32, graph_uint32);</div>
 <div class="line"><span class="lineno">  175</span> </div>
-<div class="line"><span class="lineno">  176</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nAll tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  176</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nAll tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  177</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html">std::numeric_limits::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="anamespacegreedy__algorithms_html_a349e4ab9a97532c3931a2bd2a19c0098"><div class="ttname"><a href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a></div><div class="ttdeci">void findMinimumEdge(const T &amp;infinity, const std::array&lt; std::array&lt; T, N &gt;, M &gt; &amp;graph)</div><div class="ttdoc">Finds the minimum edge of the given graph.</div><div class="ttdef"><b>Definition</b> kruskals_minimum_spanning_tree.cpp:38</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="267" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacegreedy__algorithms_html_a349e4ab9a97532c3931a2bd2a19c0098"><div class="ttname"><a href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a></div><div class="ttdeci">void findMinimumEdge(const T &amp;infinity, const std::array&lt; std::array&lt; T, N &gt;, M &gt; &amp;graph)</div><div class="ttdoc">Finds the minimum edge of the given graph.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html#l00038">kruskals_minimum_spanning_tree.cpp:38</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 5ecbd6dc0..000000000
--- a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,42,49,68"/>
-<area shape="rect" id="Node000002" href="$d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098" title="Finds the minimum edge of the given graph." alt="" coords="111,5,246,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,48,96,39,97,44,50,54"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/numeric_limits/max.html#" title=" " alt="" coords="97,70,261,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="50,56,91,64,90,69,49,62"/>
-</map>
diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 14d19066b..000000000
--- a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0b48f8523e7ef0e20c0494ac07eac7ff
\ No newline at end of file
diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index f1c0ccea5..000000000
--- a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="200pt" height="76pt"
- viewBox="0.00 0.00 199.75 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-40.25 0,-40.25 0,-21 32.5,-21 32.5,-40.25"/>
-<text text-anchor="middle" x="16.25" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098" target="_top" xlink:title="Finds the minimum edge of the given graph.">
-<polygon fill="white" stroke="#666666" points="180.88,-67.88 79.38,-67.88 79.38,-37.38 180.88,-37.38 180.88,-67.88"/>
-<text text-anchor="start" x="87.38" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="130.12" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">findMinimumEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.81,-33.68C42.28,-35.55 55.07,-38.06 68.22,-40.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.32,-44.04 77.81,-42.53 68.67,-37.17 67.32,-44.04"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191.75,-19.25 68.5,-19.25 68.5,0 191.75,0 191.75,-19.25"/>
-<text text-anchor="middle" x="130.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.81,-27.71C41.27,-26.12 52.37,-24.03 64.02,-21.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.62,-25.3 73.8,-20.01 63.33,-18.42 64.62,-25.3"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 22c96dfb1..000000000
--- a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="200pt" height="76pt"
- viewBox="0.00 0.00 199.75 75.88" 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 71.88)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-40.25 0,-40.25 0,-21 32.5,-21 32.5,-40.25"/>
-<text text-anchor="middle" x="16.25" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098" target="_top" xlink:title="Finds the minimum edge of the given graph.">
-<polygon fill="white" stroke="#666666" points="180.88,-67.88 79.38,-67.88 79.38,-37.38 180.88,-37.38 180.88,-67.88"/>
-<text text-anchor="start" x="87.38" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="130.12" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">findMinimumEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.81,-33.68C42.28,-35.55 55.07,-38.06 68.22,-40.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.32,-44.04 77.81,-42.53 68.67,-37.17 67.32,-44.04"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191.75,-19.25 68.5,-19.25 68.5,0 191.75,0 191.75,-19.25"/>
-<text text-anchor="middle" x="130.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.81,-27.71C41.27,-26.12 52.37,-24.03 64.02,-21.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.62,-25.3 73.8,-20.01 63.33,-18.42 64.62,-25.3"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 39602a91c..000000000
--- a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,42,55,68"/>
-<area shape="rect" id="Node000002" href="$d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,42,146,68"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,52,87,52,87,58,55,58"/>
-<area shape="rect" id="Node000003" href="$d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098" title="Finds the minimum edge of the given graph." alt="" coords="208,5,344,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,48,193,39,194,44,147,54"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/numeric_limits/max.html#" title=" " alt="" coords="194,70,358,96"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="147,56,189,64,188,69,146,62"/>
-</map>
diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index ac79134c3..000000000
--- a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-44496dfb9d279bfd79c2badbf1ee48f4
\ No newline at end of file
diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 9b68ccfdd..000000000
--- a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="273pt" height="76pt"
- viewBox="0.00 0.00 272.75 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-40.25 0,-40.25 0,-21 37,-21 37,-40.25"/>
-<text text-anchor="middle" x="18.5" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-40.25 73,-40.25 73,-21 105.5,-21 105.5,-40.25"/>
-<text text-anchor="middle" x="89.25" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-30.62C44.58,-30.62 53.31,-30.62 61.45,-30.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-34.13 71.2,-30.63 61.2,-27.13 61.2,-34.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098" target="_top" xlink:title="Finds the minimum edge of the given graph.">
-<polygon fill="white" stroke="#666666" points="253.88,-67.88 152.38,-67.88 152.38,-37.38 253.88,-37.38 253.88,-67.88"/>
-<text text-anchor="start" x="160.38" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="203.12" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">findMinimumEdge</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.81,-33.68C115.28,-35.55 128.07,-38.06 141.22,-40.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.32,-44.04 150.81,-42.53 141.67,-37.17 140.32,-44.04"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.75,-19.25 141.5,-19.25 141.5,0 264.75,0 264.75,-19.25"/>
-<text text-anchor="middle" x="203.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.81,-27.71C114.27,-26.12 125.37,-24.03 137.02,-21.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.62,-25.3 146.8,-20.01 136.33,-18.42 137.62,-25.3"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 08790dddc..000000000
--- a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="273pt" height="76pt"
- viewBox="0.00 0.00 272.75 75.88" 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 71.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-40.25 0,-40.25 0,-21 37,-21 37,-40.25"/>
-<text text-anchor="middle" x="18.5" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-40.25 73,-40.25 73,-21 105.5,-21 105.5,-40.25"/>
-<text text-anchor="middle" x="89.25" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-30.62C44.58,-30.62 53.31,-30.62 61.45,-30.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-34.13 71.2,-30.63 61.2,-27.13 61.2,-34.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098" target="_top" xlink:title="Finds the minimum edge of the given graph.">
-<polygon fill="white" stroke="#666666" points="253.88,-67.88 152.38,-67.88 152.38,-37.38 253.88,-37.38 253.88,-67.88"/>
-<text text-anchor="start" x="160.38" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="203.12" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">findMinimumEdge</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.81,-33.68C115.28,-35.55 128.07,-38.06 141.22,-40.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.32,-44.04 150.81,-42.53 141.67,-37.17 140.32,-44.04"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.75,-19.25 141.5,-19.25 141.5,0 264.75,0 264.75,-19.25"/>
-<text text-anchor="middle" x="203.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.81,-27.71C114.27,-26.12 125.37,-24.03 137.02,-21.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.62,-25.3 146.8,-20.01 136.33,-18.42 137.62,-25.3"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html
new file mode 100644
index 000000000..4cc45ac3d
--- /dev/null
+++ b/d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html
@@ -0,0 +1,292 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: greedy_algorithms/kruskals_minimum_spanning_tree.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">kruskals_minimum_spanning_tree.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;array&gt;</span>     </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;limits&gt;</span>    </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;cstdint&gt;</span>   </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a> {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, std::<span class="keywordtype">size_t</span> N, std::<span class="keywordtype">size_t</span> M&gt;</div>
+<div class="foldopen" id="foldopen00038" data-start="{" data-end="}">
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">   38</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">findMinimumEdge</a>(<span class="keyword">const</span> T &amp;infinity,</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>                     <span class="keyword">const</span> std::array&lt;std::array&lt;T, N&gt;, M&gt; &amp;<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>) {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">if</span> (N != M) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nWrong input passed. Provided array has dimensions &quot;</span> &lt;&lt; N</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>                  &lt;&lt; <span class="stringliteral">&quot;x&quot;</span> &lt;&lt; M &lt;&lt; <span class="stringliteral">&quot;. Please provide a square matrix.\n&quot;</span>;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    }</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.size(); i++) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordtype">int</span> min = infinity;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="keywordtype">int</span> minIndex = 0;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.size(); j++) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            <span class="keywordflow">if</span> (i != j &amp;&amp; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[i][j] != 0 &amp;&amp; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[i][j] &lt; min) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>                min = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[i][j];</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>                minIndex = j;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            }</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        }</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  -  &quot;</span> &lt;&lt; minIndex &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[i][minIndex]</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>                  &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>}</div>
+</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}  <span class="comment">// namespace greedy_algorithms</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="foldopen" id="foldopen00064" data-start="{" data-end="}">
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   64</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keyword">constexpr</span> <span class="keywordtype">int</span> INFINITY_INT = std::numeric_limits&lt;int&gt;::max();</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keyword">constexpr</span> <span class="keywordtype">float</span> INFINITY_FLOAT = std::numeric_limits&lt;float&gt;::max();</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keyword">constexpr</span> <span class="keywordtype">double</span> INFINITY_DOUBLE = std::numeric_limits&lt;double&gt;::max();</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keyword">constexpr</span> uint32_t INFINITY_UINT32 = UINT32_MAX;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>  </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="comment">// Test case with integer values</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 1 :\n&quot;</span>;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    std::array&lt;std::array&lt;int, 6&gt;, 6&gt; graph1{</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>             0,            4,            1,             4,        INFINITY_INT,   INFINITY_INT,</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>             4,            0,            3,             8,             3,         INFINITY_INT,</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>             1,            3,            0,        INFINITY_INT,       1,         INFINITY_INT,</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>             4,            8,       INFINITY_INT,        0,            5,              7,</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        INFINITY_INT,      3,            1,              5,            0,         INFINITY_INT,</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        INFINITY_INT, INFINITY_INT, INFINITY_INT,        7,       INFINITY_INT,       0};</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, graph1);</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="comment">// Test case with floating values</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 2 :\n&quot;</span>;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>     std::array&lt;std::array&lt;float, 3&gt;, 3&gt; graph2{</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>             0.0f,           2.5f,  INFINITY_FLOAT,</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>             2.5f,           0.0f,       3.2f,</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        INFINITY_FLOAT,      3.2f,       0.0f};</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_FLOAT, graph2);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="comment">// Test case with double values</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 3 :\n&quot;</span>;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>   std::array&lt;std::array&lt;double, 5&gt;, 5&gt; graph3{</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>               0.0,             10.5,       INFINITY_DOUBLE,        6.7,              3.3,</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>               10.5,            0.0,              8.1,              15.4,       INFINITY_DOUBLE,</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        INFINITY_DOUBLE,        8.1,              0.0,        INFINITY_DOUBLE,         7.8,</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>               6.7,             15.4,       INFINITY_DOUBLE,        0.0,               9.9,</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>               3.3,       INFINITY_DOUBLE,        7.8,              9.9,               0.0};</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_DOUBLE, graph3);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="comment">// Test Case with negative weights</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 4 :\n&quot;</span>;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    std::array&lt;std::array&lt;int, 3&gt;, 3&gt; graph_neg{</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        0,   -2,   4,</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>       -2,    0,   3,</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        4,    3,   0};</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, graph_neg);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="comment">// Test Case with Self-Loops</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 5 :\n&quot;</span>;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    std::array&lt;std::array&lt;int, 3&gt;, 3&gt; graph_self_loop{</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>               2,       1, INFINITY_INT,</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        INFINITY_INT,   0,        4,</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        INFINITY_INT,   4,        0};</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, graph_self_loop);</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="comment">// Test Case with no edges</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 6 :\n&quot;</span>;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    std::array&lt;std::array&lt;int, 4&gt;, 4&gt; no_edges{</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>               0,       INFINITY_INT,   INFINITY_INT,   INFINITY_INT,</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        INFINITY_INT,         0,        INFINITY_INT,   INFINITY_INT,</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        INFINITY_INT,   INFINITY_INT,          0,       INFINITY_INT,</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        INFINITY_INT,   INFINITY_INT,   INFINITY_INT,           0};</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, no_edges);</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="comment">// Test Case with a non-connected graph</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 7:\n&quot;</span>;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    std::array&lt;std::array&lt;int, 4&gt;, 4&gt; partial_graph{</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>                0,             2,    INFINITY_INT,         6,</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>                2,             0,            3,     INFINITY_INT,</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>        INFINITY_INT,          3,            0,             4,</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>                6,     INFINITY_INT,         4,             0};</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, partial_graph);</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <span class="comment">// Test Case with Directed weighted graph. The Krushkal algorithm does not give</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="comment">// optimal answer</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 8:\n&quot;</span>;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    std::array&lt;std::array&lt;int, 4&gt;, 4&gt; directed_graph{</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>                0,            3,            7,   INFINITY_INT,  <span class="comment">// Vertex 0 has edges to Vertex 1 and Vertex 2</span></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        INFINITY_INT,         0,            2,           5,  <span class="comment">// Vertex 1 has edges to Vertex 2 and Vertex 3</span></div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        INFINITY_INT, INFINITY_INT,         0,           1,  <span class="comment">// Vertex 2 has an edge to Vertex 3</span></div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        INFINITY_INT, INFINITY_INT, INFINITY_INT,        0};  <span class="comment">// Vertex 3 has no outgoing edges</span></div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, directed_graph);</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span> </div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    <span class="comment">// Test case with wrong input passed</span></div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 9:\n&quot;</span>;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>   std::array&lt;std::array&lt;int, 4&gt;, 3&gt; graph9{</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>        0,        5,        5,        5,</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>        5,        0,        5,        5,        </div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        5,        5,        5,        5};</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, graph9);</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span> </div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    <span class="comment">// Test case with all the same values between every edge</span></div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 10:\n&quot;</span>;</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    std::array&lt;std::array&lt;int, 5&gt;, 5&gt; graph10{</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>        0,        5,        5,        5,        5,</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        5,        0,        5,        5,        5,</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        5,        5,        0,        5,        5,</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        5,        5,        5,        0,        5,</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>        5,        5,        5,        5,        0};</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_INT, graph10);</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span> </div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>  <span class="comment">// Test Case with uint32_t values</span></div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest Case 11 :\n&quot;</span>;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    std::array&lt;std::array&lt;uint32_t, 4&gt;, 4&gt; graph_uint32{</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>                0,                      5,        INFINITY_UINT32,          9,</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>                5,                      0,                2,        INFINITY_UINT32,</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>        INFINITY_UINT32,                2,                0,                6,</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>                9,               INFINITY_UINT32,         6,                0};</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    <a class="code hl_function" href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a>(INFINITY_UINT32, graph_uint32);</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span> </div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nAll tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>}</div>
+</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="foldopen" id="foldopen00184" data-start="{" data-end="}">
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"><a class="line" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  184</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    <a class="code hl_function" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run Self-test implementation</span></div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>}</div>
+</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span> </div>
+<div class="ttc" id="akruskals__minimum__spanning__tree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/d7d/kruskals__minimum__spanning__tree_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> <a href="#l00064">kruskals_minimum_spanning_tree.cpp:64</a></div></div>
+<div class="ttc" id="akruskals__minimum__spanning__tree_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00184">kruskals_minimum_spanning_tree.cpp:184</a></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 class="ttc" id="anamespacegreedy__algorithms_html"><div class="ttname"><a href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></div><div class="ttdoc">for string class</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d1f/binary__addition_8cpp_source.html#l00027">binary_addition.cpp:27</a></div></div>
+<div class="ttc" id="anamespacegreedy__algorithms_html_a349e4ab9a97532c3931a2bd2a19c0098"><div class="ttname"><a href="../../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098">greedy_algorithms::findMinimumEdge</a></div><div class="ttdeci">void findMinimumEdge(const T &amp;infinity, const std::array&lt; std::array&lt; T, N &gt;, M &gt; &amp;graph)</div><div class="ttdoc">Finds the minimum edge of the given graph.</div><div class="ttdef"><b>Definition</b> <a href="#l00038">kruskals_minimum_spanning_tree.cpp:38</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_0eaa691bd54ab0922ca7f50599de6d22.html">greedy_algorithms</a></li><li class="navelem"><a class="el" href="../../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html">kruskals_minimum_spanning_tree.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/d88/namespaceset_kth_bit.html b/d8/d88/namespaceset_kth_bit.html
index f37bd29ae..1cc0ccd75 100644
--- a/d8/d88/namespaceset_kth_bit.html
+++ b/d8/d88/namespaceset_kth_bit.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: setKthBit Namespace Reference</title>
+<title>TheAlgorithms/C++: setKthBit Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/d89/namespacelinear__probing.html b/d8/d89/namespacelinear__probing.html
index e5fb33ac5..782120370 100644
--- a/d8/d89/namespacelinear__probing.html
+++ b/d8/d89/namespacelinear__probing.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: linear_probing Namespace Reference</title>
+<title>TheAlgorithms/C++: linear_probing Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -129,7 +146,7 @@ Functions</h2></td></tr>
 <tr class="memitem:a16d34fd3511626a83ab00665d7bc34d1" id="r_a16d34fd3511626a83ab00665d7bc34d1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a16d34fd3511626a83ab00665d7bc34d1">add</a> (int key)</td></tr>
 <tr class="separator:a16d34fd3511626a83ab00665d7bc34d1"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a4bde7a47f98dd1ad24c84038e2608527" id="r_a4bde7a47f98dd1ad24c84038e2608527"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4bde7a47f98dd1ad24c84038e2608527">hashFxn</a> (int key)</td></tr>
-<tr class="memdesc:a4bde7a47f98dd1ad24c84038e2608527"><td class="mdescLeft">&#160;</td><td class="mdescRight">Hash a key. Uses the STL library's <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash()</a></code> function.  <br /></td></tr>
+<tr class="memdesc:a4bde7a47f98dd1ad24c84038e2608527"><td class="mdescLeft">&#160;</td><td class="mdescRight">Hash a key. Uses the STL library's <code>std::hash()</code> function.  <br /></td></tr>
 <tr class="separator:a4bde7a47f98dd1ad24c84038e2608527"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a6322209aaa91b7bbf16f96e1cc52b746" id="r_a6322209aaa91b7bbf16f96e1cc52b746"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6322209aaa91b7bbf16f96e1cc52b746">linearProbe</a> (int key, bool searching)</td></tr>
 <tr class="separator:a6322209aaa91b7bbf16f96e1cc52b746"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -146,23 +163,17 @@ Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:addfce7597f6a42f796fa597ae40eecc9" id="r_addfce7597f6a42f796fa597ae40eecc9"><td class="memItemLeft" align="right" valign="top"><a id="addfce7597f6a42f796fa597ae40eecc9" name="addfce7597f6a42f796fa597ae40eecc9"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>notPresent</b></td></tr>
+<tr class="memitem:addfce7597f6a42f796fa597ae40eecc9" id="r_addfce7597f6a42f796fa597ae40eecc9"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#addfce7597f6a42f796fa597ae40eecc9">notPresent</a></td></tr>
 <tr class="separator:addfce7597f6a42f796fa597ae40eecc9"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:acb1dc3f09cf07c2633580a1c46c9f0a8" id="r_acb1dc3f09cf07c2633580a1c46c9f0a8"><td class="memItemLeft" align="right" valign="top"><a id="acb1dc3f09cf07c2633580a1c46c9f0a8" name="acb1dc3f09cf07c2633580a1c46c9f0a8"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>table</b></td></tr>
+<tr class="memitem:acb1dc3f09cf07c2633580a1c46c9f0a8" id="r_acb1dc3f09cf07c2633580a1c46c9f0a8"><td class="memItemLeft" align="right" valign="top">std::vector&lt; <a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acb1dc3f09cf07c2633580a1c46c9f0a8">table</a></td></tr>
 <tr class="separator:acb1dc3f09cf07c2633580a1c46c9f0a8"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a4fdb68db9f02ae4156e1845563004f8e" id="r_a4fdb68db9f02ae4156e1845563004f8e"><td class="memItemLeft" align="right" valign="top"><a id="a4fdb68db9f02ae4156e1845563004f8e" name="a4fdb68db9f02ae4156e1845563004f8e"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>totalSize</b></td></tr>
+<tr class="memitem:a4fdb68db9f02ae4156e1845563004f8e" id="r_a4fdb68db9f02ae4156e1845563004f8e"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4fdb68db9f02ae4156e1845563004f8e">totalSize</a></td></tr>
 <tr class="separator:a4fdb68db9f02ae4156e1845563004f8e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a62fbd519adacd4e05706f34a7e551288" id="r_a62fbd519adacd4e05706f34a7e551288"><td class="memItemLeft" align="right" valign="top"><a id="a62fbd519adacd4e05706f34a7e551288" name="a62fbd519adacd4e05706f34a7e551288"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>tomb</b> = -1</td></tr>
+<tr class="memitem:a62fbd519adacd4e05706f34a7e551288" id="r_a62fbd519adacd4e05706f34a7e551288"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a62fbd519adacd4e05706f34a7e551288">tomb</a> = -1</td></tr>
 <tr class="separator:a62fbd519adacd4e05706f34a7e551288"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8e81b17f2f8403c982368da3dac1ae87" id="r_a8e81b17f2f8403c982368da3dac1ae87"><td class="memItemLeft" align="right" valign="top"><a id="a8e81b17f2f8403c982368da3dac1ae87" name="a8e81b17f2f8403c982368da3dac1ae87"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>size</b></td></tr>
+<tr class="memitem:a8e81b17f2f8403c982368da3dac1ae87" id="r_a8e81b17f2f8403c982368da3dac1ae87"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8e81b17f2f8403c982368da3dac1ae87">size</a></td></tr>
 <tr class="separator:a8e81b17f2f8403c982368da3dac1ae87"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a5ff22c1a04290e24ef3ba3d6a3a06386" id="r_a5ff22c1a04290e24ef3ba3d6a3a06386"><td class="memItemLeft" align="right" valign="top"><a id="a5ff22c1a04290e24ef3ba3d6a3a06386" name="a5ff22c1a04290e24ef3ba3d6a3a06386"></a>
-bool&#160;</td><td class="memItemRight" valign="bottom"><b>rehashing</b></td></tr>
+<tr class="memitem:a5ff22c1a04290e24ef3ba3d6a3a06386" id="r_a5ff22c1a04290e24ef3ba3d6a3a06386"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5ff22c1a04290e24ef3ba3d6a3a06386">rehashing</a></td></tr>
 <tr class="separator:a5ff22c1a04290e24ef3ba3d6a3a06386"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -188,6 +199,8 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>rehashing</b></td></t
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00161">161</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  161</span>                  {</div>
 <div class="line"><span class="lineno">  162</span>    <span class="keywordtype">int</span> index = <a class="code hl_function" href="#a6322209aaa91b7bbf16f96e1cc52b746">linearProbe</a>(key, <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">  163</span>    table[index].key = key;</div>
@@ -196,13 +209,8 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>rehashing</b></td></t
 <div class="line"><span class="lineno">  166</span>        rehash();</div>
 <div class="line"><span class="lineno">  167</span>    }</div>
 <div class="line"><span class="lineno">  168</span>}</div>
-<div class="ttc" id="anamespacelinear__probing_html_a6322209aaa91b7bbf16f96e1cc52b746"><div class="ttname"><a href="#a6322209aaa91b7bbf16f96e1cc52b746">linear_probing::linearProbe</a></div><div class="ttdeci">int linearProbe(int key, bool searching)</div><div class="ttdef"><b>Definition</b> linear_probing_hash_table.cpp:55</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d89/namespacelinear__probing_a16d34fd3511626a83ab00665d7bc34d1_cgraph.svg" width="578" height="200"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacelinear__probing_html_a6322209aaa91b7bbf16f96e1cc52b746"><div class="ttname"><a href="#a6322209aaa91b7bbf16f96e1cc52b746">linear_probing::linearProbe</a></div><div class="ttdeci">int linearProbe(int key, bool searching)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00055">linear_probing_hash_table.cpp:55</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a16680b8a37d442c2f208faa286e33908" name="a16680b8a37d442c2f208faa286e33908"></a>
@@ -225,26 +233,21 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00186">186</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  186</span>                      {</div>
-<div class="line"><span class="lineno">  187</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initial table: &quot;</span>;</div>
+<div class="line"><span class="lineno">  187</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initial table: &quot;</span>;</div>
 <div class="line"><span class="lineno">  188</span>    display();</div>
-<div class="line"><span class="lineno">  189</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  190</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;hash of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; hashFxn(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
+<div class="line"><span class="lineno">  189</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  190</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;hash of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; hashFxn(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
 <div class="line"><span class="lineno">  191</span>              &lt;&lt; totalSize &lt;&lt; <span class="stringliteral">&quot; == &quot;</span> &lt;&lt; hashFxn(key) % totalSize;</div>
-<div class="line"><span class="lineno">  192</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  192</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  193</span>    <a class="code hl_function" href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a>(key);</div>
-<div class="line"><span class="lineno">  194</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;New table: &quot;</span>;</div>
+<div class="line"><span class="lineno">  194</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;New table: &quot;</span>;</div>
 <div class="line"><span class="lineno">  195</span>    display();</div>
 <div class="line"><span class="lineno">  196</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="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="auint128__t_8hpp_html_a3ff77262ffd6743df5b808d41382a6f3"><div class="ttname"><a href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a></div><div class="ttdeci">std::string add(const std::string &amp;first, const std::string &amp;second)</div><div class="ttdoc">Adding two string.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:38</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph.svg" width="100%" height="468"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="auint128__t_8hpp_html_a3ff77262ffd6743df5b808d41382a6f3"><div class="ttname"><a href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a></div><div class="ttdeci">std::string add(const std::string &amp;first, const std::string &amp;second)</div><div class="ttdoc">Adding two string.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00038">uint128_t.hpp:38</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad87b71d810901fab69c4ad9d4d0fa635" name="ad87b71d810901fab69c4ad9d4d0fa635"></a>
@@ -262,26 +265,23 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Function to displays the table </p><dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00120">120</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  120</span>               {</div>
 <div class="line"><span class="lineno">  121</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; totalSize; i++) {</div>
 <div class="line"><span class="lineno">  122</span>        <span class="keywordflow">if</span> (table[i].key == notPresent) {</div>
-<div class="line"><span class="lineno">  123</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; Empty &quot;</span>;</div>
+<div class="line"><span class="lineno">  123</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; Empty &quot;</span>;</div>
 <div class="line"><span class="lineno">  124</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (table[i].key == tomb) {</div>
-<div class="line"><span class="lineno">  125</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; Tomb &quot;</span>;</div>
+<div class="line"><span class="lineno">  125</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; Tomb &quot;</span>;</div>
 <div class="line"><span class="lineno">  126</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  127</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
-<div class="line"><span class="lineno">  128</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; table[i].key;</div>
-<div class="line"><span class="lineno">  129</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  127</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  128</span>            std::cout &lt;&lt; table[i].key;</div>
+<div class="line"><span class="lineno">  129</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">  130</span>        }</div>
 <div class="line"><span class="lineno">  131</span>    }</div>
-<div class="line"><span class="lineno">  132</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  132</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  133</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d89/namespacelinear__probing_ad87b71d810901fab69c4ad9d4d0fa635_cgraph.svg" width="280" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4bde7a47f98dd1ad24c84038e2608527" name="a4bde7a47f98dd1ad24c84038e2608527"></a>
@@ -299,7 +299,7 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 
-<p>Hash a key. Uses the STL library's <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash()</a></code> function. </p>
+<p>Hash a key. Uses the STL library's <code>std::hash()</code> function. </p>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramname">key</td><td>value to hash </td></tr>
@@ -307,11 +307,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>hash value of the key </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00046">46</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   46</span>                        {</div>
-<div class="line"><span class="lineno">   47</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash&lt;int&gt;</a> hash;</div>
+<div class="line"><span class="lineno">   47</span>    std::hash&lt;int&gt; hash;</div>
 <div class="line"><span class="lineno">   48</span>    <span class="keywordflow">return</span> hash(key);</div>
 <div class="line"><span class="lineno">   49</span>}</div>
-<div class="ttc" id="ahash_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -340,6 +341,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>hash value of the key </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   55</span>                                         {</div>
 <div class="line"><span class="lineno">   56</span>    <span class="keywordtype">int</span> hash = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(hashFxn(key));</div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordtype">int</span> i = 0;</div>
@@ -352,40 +355,35 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   64</span>                <span class="keywordflow">return</span> notPresent;</div>
 <div class="line"><span class="lineno">   65</span>            }</div>
 <div class="line"><span class="lineno">   66</span>            <span class="keywordflow">if</span> (searchingProber(entry, key)) {</div>
-<div class="line"><span class="lineno">   67</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Found key!&quot;</span> &lt;&lt; <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">   67</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Found key!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   68</span>                <span class="keywordflow">return</span> index;</div>
 <div class="line"><span class="lineno">   69</span>            }</div>
-<div class="line"><span class="lineno">   70</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Found tombstone or equal hash, checking next&quot;</span></div>
-<div class="line"><span class="lineno">   71</span>                      &lt;&lt; <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">   70</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Found tombstone or equal hash, checking next&quot;</span></div>
+<div class="line"><span class="lineno">   71</span>                      &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   72</span>            i++;</div>
 <div class="line"><span class="lineno">   73</span>        } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">   74</span>            <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">putProber</a>(entry, key)) {</div>
 <div class="line"><span class="lineno">   75</span>                <span class="keywordflow">if</span> (!rehashing) {</div>
-<div class="line"><span class="lineno">   76</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Spot found!&quot;</span> &lt;&lt; <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">   76</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;Spot found!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   77</span>                }</div>
 <div class="line"><span class="lineno">   78</span>                <span class="keywordflow">return</span> index;</div>
 <div class="line"><span class="lineno">   79</span>            }</div>
 <div class="line"><span class="lineno">   80</span>            <span class="keywordflow">if</span> (!rehashing) {</div>
-<div class="line"><span class="lineno">   81</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Spot taken, looking at next&quot;</span> &lt;&lt; <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">   81</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Spot taken, looking at next&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   82</span>            }</div>
 <div class="line"><span class="lineno">   83</span>            i++;</div>
 <div class="line"><span class="lineno">   84</span>        }</div>
 <div class="line"><span class="lineno">   85</span>        <span class="keywordflow">if</span> (i == totalSize) {</div>
-<div class="line"><span class="lineno">   86</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Linear probe failed&quot;</span> &lt;&lt; <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">   86</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Linear probe failed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   87</span>            <span class="keywordflow">return</span> notPresent;</div>
 <div class="line"><span class="lineno">   88</span>        }</div>
 <div class="line"><span class="lineno">   89</span>    } <span class="keywordflow">while</span> (entry.<a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> != notPresent);</div>
 <div class="line"><span class="lineno">   90</span>    <span class="keywordflow">return</span> notPresent;</div>
 <div class="line"><span class="lineno">   91</span>}</div>
-<div class="ttc" id="anamespacedouble__hashing_html_ac2adfce49ac57f6dbd1778d2c1ce0d2b"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">double_hashing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition</b> double_hash_hash_table.cpp:120</div></div>
-<div class="ttc" id="astructlinear__probing_1_1_entry_html"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html">linear_probing::Entry</a></div><div class="ttdef"><b>Definition</b> linear_probing_hash_table.cpp:35</div></div>
-<div class="ttc" id="astructlinear__probing_1_1_entry_html_a4d84e90b73022083761f85f8586c4c2a"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">linear_probing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition</b> linear_probing_hash_table.cpp:37</div></div>
-</div><!-- 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="../../d8/d89/namespacelinear__probing_a6322209aaa91b7bbf16f96e1cc52b746_cgraph.svg" width="399" height="200"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacedouble__hashing_html_ac2adfce49ac57f6dbd1778d2c1ce0d2b"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">double_hashing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00120">double_hash_hash_table.cpp:120</a></div></div>
+<div class="ttc" id="astructlinear__probing_1_1_entry_html"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html">linear_probing::Entry</a></div><div class="ttdef"><b>Definition</b> <a href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00035">linear_probing_hash_table.cpp:35</a></div></div>
+<div class="ttc" id="astructlinear__probing_1_1_entry_html_a4d84e90b73022083761f85f8586c4c2a"><div class="ttname"><a href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">linear_probing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00037">linear_probing_hash_table.cpp:37</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a75d779938df7ebc68581d922b60a2541" name="a75d779938df7ebc68581d922b60a2541"></a>
@@ -414,6 +412,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>hash value of the key </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00098">98</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   98</span>                                            {</div>
 <div class="line"><span class="lineno">   99</span>    <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> == notPresent || entry.<a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> == tomb) {</div>
 <div class="line"><span class="lineno">  100</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
@@ -438,15 +438,17 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Rehashes the table into a bigger table </p><dl class="section return"><dt>Returns</dt><dd>None </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00138">138</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  138</span>              {</div>
 <div class="line"><span class="lineno">  139</span>    <span class="comment">// Necessary so wall of add info isn&#39;t printed all at once</span></div>
 <div class="line"><span class="lineno">  140</span>    rehashing = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  141</span>    <span class="keywordtype">int</span> oldSize = totalSize;</div>
-<div class="line"><span class="lineno">  142</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Entry&gt;</a> oldTable(table);</div>
+<div class="line"><span class="lineno">  142</span>    std::vector&lt;Entry&gt; oldTable(table);</div>
 <div class="line"><span class="lineno">  143</span>    <span class="comment">// Really this should use the next prime number greater than totalSize *</span></div>
 <div class="line"><span class="lineno">  144</span>    <span class="comment">// 2</span></div>
 <div class="line"><span class="lineno">  145</span>    totalSize *= 2;</div>
-<div class="line"><span class="lineno">  146</span>    table = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Entry&gt;</a>(totalSize);</div>
+<div class="line"><span class="lineno">  146</span>    table = std::vector&lt;Entry&gt;(totalSize);</div>
 <div class="line"><span class="lineno">  147</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; oldSize; i++) {</div>
 <div class="line"><span class="lineno">  148</span>        <span class="keywordflow">if</span> (oldTable[i].key != -1 &amp;&amp; oldTable[i].key != notPresent) {</div>
 <div class="line"><span class="lineno">  149</span>            size--;  <span class="comment">// Size stays the same (add increments size)</span></div>
@@ -455,15 +457,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  152</span>    }</div>
 <div class="line"><span class="lineno">  153</span>    <span class="comment">// delete[] oldTable;</span></div>
 <div class="line"><span class="lineno">  154</span>    rehashing = <span class="keyword">false</span>;</div>
-<div class="line"><span class="lineno">  155</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Table was rehashed, new size is: &quot;</span> &lt;&lt; totalSize &lt;&lt; <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">  155</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Table was rehashed, new size is: &quot;</span> &lt;&lt; totalSize &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  156</span>}</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>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph.svg" width="100%" height="450"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a75854f5aa216e61219154c62167ce8f0" name="a75854f5aa216e61219154c62167ce8f0"></a>
@@ -486,23 +482,20 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00201">201</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  201</span>                          {</div>
-<div class="line"><span class="lineno">  202</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initial table: &quot;</span>;</div>
+<div class="line"><span class="lineno">  202</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initial table: &quot;</span>;</div>
 <div class="line"><span class="lineno">  203</span>    display();</div>
-<div class="line"><span class="lineno">  204</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  205</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;hash of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; hashFxn(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
+<div class="line"><span class="lineno">  204</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  205</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;hash of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; hashFxn(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
 <div class="line"><span class="lineno">  206</span>              &lt;&lt; totalSize &lt;&lt; <span class="stringliteral">&quot; == &quot;</span> &lt;&lt; hashFxn(key) % totalSize;</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> &lt;&lt; <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">  207</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  208</span>    remove(key);</div>
-<div class="line"><span class="lineno">  209</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;New table: &quot;</span>;</div>
+<div class="line"><span class="lineno">  209</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;New table: &quot;</span>;</div>
 <div class="line"><span class="lineno">  210</span>    display();</div>
 <div class="line"><span class="lineno">  211</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph.svg" width="100%" height="464"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abcf8d033f8115f39f3c93cfb6cee0b28" name="abcf8d033f8115f39f3c93cfb6cee0b28"></a>
@@ -525,21 +518,18 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00173">173</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  173</span>                     {</div>
 <div class="line"><span class="lineno">  174</span>    <span class="keywordtype">int</span> index = <a class="code hl_function" href="#a6322209aaa91b7bbf16f96e1cc52b746">linearProbe</a>(key, <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">  175</span>    <span class="keywordflow">if</span> (index == notPresent) {</div>
-<div class="line"><span class="lineno">  176</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;key not found&quot;</span> &lt;&lt; <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">  176</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;key not found&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  177</span>    }</div>
-<div class="line"><span class="lineno">  178</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Removal Successful, leaving tomb&quot;</span> &lt;&lt; <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">  178</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Removal Successful, leaving tomb&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  179</span>    table[index].key = tomb;</div>
 <div class="line"><span class="lineno">  180</span>    size--;</div>
 <div class="line"><span class="lineno">  181</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d89/namespacelinear__probing_abcf8d033f8115f39f3c93cfb6cee0b28_cgraph.svg" width="599" height="200"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a942fc8407b8001890ea26830cdcd9d77" name="a942fc8407b8001890ea26830cdcd9d77"></a>
@@ -568,6 +558,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>hash value of the key </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00110">110</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  110</span>                                                  {</div>
 <div class="line"><span class="lineno">  111</span>    <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a">key</a> == key) {</div>
 <div class="line"><span class="lineno">  112</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
@@ -575,6 +567,103 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  114</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  115</span>}</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Variable Documentation</h2>
+<a id="addfce7597f6a42f796fa597ae40eecc9" name="addfce7597f6a42f796fa597ae40eecc9"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#addfce7597f6a42f796fa597ae40eecc9">&#9670;&#160;</a></span>notPresent</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int linear_probing::notPresent</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00027">27</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a5ff22c1a04290e24ef3ba3d6a3a06386" name="a5ff22c1a04290e24ef3ba3d6a3a06386"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a5ff22c1a04290e24ef3ba3d6a3a06386">&#9670;&#160;</a></span>rehashing</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">bool linear_probing::rehashing</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a8e81b17f2f8403c982368da3dac1ae87" name="a8e81b17f2f8403c982368da3dac1ae87"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a8e81b17f2f8403c982368da3dac1ae87">&#9670;&#160;</a></span>size</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int linear_probing::size</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<a id="acb1dc3f09cf07c2633580a1c46c9f0a8" name="acb1dc3f09cf07c2633580a1c46c9f0a8"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#acb1dc3f09cf07c2633580a1c46c9f0a8">&#9670;&#160;</a></span>table</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;<a class="el" href="../../db/d19/structlinear__probing_1_1_entry.html">Entry</a>&gt; linear_probing::table</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a62fbd519adacd4e05706f34a7e551288" name="a62fbd519adacd4e05706f34a7e551288"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a62fbd519adacd4e05706f34a7e551288">&#9670;&#160;</a></span>tomb</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int linear_probing::tomb = -1</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00030">30</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a4fdb68db9f02ae4156e1845563004f8e" name="a4fdb68db9f02ae4156e1845563004f8e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a4fdb68db9f02ae4156e1845563004f8e">&#9670;&#160;</a></span>totalSize</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int linear_probing::totalSize</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
+
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph.map b/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph.map
deleted file mode 100644
index eaa8b97fe..000000000
--- a/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph.map
+++ /dev/null
@@ -1,24 +0,0 @@
-<map id="linear_probing::addInfo" name="linear_probing::addInfo">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,59,158,85"/>
-<area shape="rect" id="Node000002" href="$d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1" title=" " alt="" coords="216,84,346,110"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,79,201,84,200,90,158,84"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="673,30,745,55"/>
-<area shape="poly" id="edge12_Node000001_Node000004" title=" " alt="" coords="106,56,151,35,205,19,268,9,333,4,460,6,573,17,659,30,658,35,572,22,459,11,333,10,269,14,206,24,153,40,108,61"/>
-<area shape="rect" id="Node000005" href="$d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" title="Hash a key. Uses the STL library&#39;s std::hash() function." alt="" coords="629,194,789,219"/>
-<area shape="poly" id="edge13_Node000001_Node000005" title=" " alt="" coords="113,83,207,120,304,149,404,169,513,185,614,196,614,202,512,191,404,174,303,154,205,125,111,88"/>
-<area shape="rect" id="Node000009" href="$d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635" title=" " alt="" coords="206,34,356,59"/>
-<area shape="poly" id="edge10_Node000001_Node000009" title=" " alt="" coords="158,59,190,55,191,61,159,65"/>
-<area shape="rect" id="Node000003" href="$d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746" title=" " alt="" coords="404,134,578,159"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="340,108,419,127,418,132,338,113"/>
-<area shape="rect" id="Node000008" href="$d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0" title=" " alt="" coords="417,84,565,110"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="346,103,401,103,401,109,346,108"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="555,131,577,120,592,107,600,93,609,79,625,64,657,50,659,55,628,69,613,82,605,96,596,111,580,125,558,136"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="542,157,646,186,644,192,540,163"/>
-<area shape="rect" id="Node000006" href="$d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" title=" " alt="" coords="626,79,792,105"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="544,131,640,106,641,112,546,136"/>
-<area shape="rect" id="Node000007" href="$d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" title=" " alt="" coords="626,129,792,169"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="579,145,611,145,611,151,579,150"/>
-<area shape="poly" id="edge8_Node000008_Node000002" title=" " alt="" coords="417,91,361,91,361,86,417,86"/>
-<area shape="poly" id="edge9_Node000008_Node000004" title=" " alt="" coords="544,81,658,52,659,58,546,86"/>
-<area shape="poly" id="edge11_Node000009_Node000004" title=" " alt="" coords="356,43,658,40,658,46,356,48"/>
-</map>
diff --git a/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph.md5 b/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph.md5
deleted file mode 100644
index 3eb742e3a..000000000
--- a/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-09f686b1d98287cbd5efea9e138cebc3
\ No newline at end of file
diff --git a/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph.svg b/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph.svg
deleted file mode 100644
index 437e55ede..000000000
--- a/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph.svg
+++ /dev/null
@@ -1,294 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: linear_probing::addInfo Pages: 1 -->
-<!--zoomable 168 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 598;
-var viewHeight = 168;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>linear_probing::addInfo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="114.25,-120.25 0,-120.25 0,-101 114.25,-101 114.25,-120.25"/>
-<text text-anchor="middle" x="57.12" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::addInfo</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-101.25 157.75,-101.25 157.75,-82 255.5,-82 255.5,-101.25"/>
-<text text-anchor="middle" x="206.62" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.73,-103.33C125.11,-102 135.97,-100.6 146.43,-99.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.6,-102.76 156.07,-98.01 145.7,-95.81 146.6,-102.76"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="554.5,-142.25 501,-142.25 501,-123 554.5,-123 554.5,-142.25"/>
-<text text-anchor="middle" x="527.75" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge12_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge12_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.5,-120.73C94.63,-130.08 123.44,-143.31 150.25,-148.62 272.8,-172.91 422,-152.06 489.92,-139.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="490.17,-143.41 499.38,-138.16 488.91,-136.53 490.17,-143.41"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="587.5,-19.25 468,-19.25 468,0 587.5,0 587.5,-19.25"/>
-<text text-anchor="middle" x="527.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge13_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge13_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.75,-100.64C98.2,-92.38 125.6,-80.73 150.25,-72.62 214.97,-51.36 231.96,-47.74 299,-35.62 351.42,-26.16 411.28,-19.48 456.48,-15.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="456.78,-18.75 466.42,-14.36 456.15,-11.78 456.78,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263,-139.25 150.25,-139.25 150.25,-120 263,-120 263,-139.25"/>
-<text text-anchor="middle" x="206.62" y="-125.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge10_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge10_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.73,-117.92C122.57,-118.93 130.69,-119.97 138.69,-121"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.03,-124.45 148.4,-122.25 138.93,-117.5 138.03,-124.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="429.75,-64.25 299,-64.25 299,-45 429.75,-45 429.75,-64.25"/>
-<text text-anchor="middle" x="364.38" y="-50.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::linearProbe</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M250.18,-81.51C268.56,-77.15 290.25,-72 309.71,-67.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="310.47,-70.79 319.39,-65.07 308.86,-63.98 310.47,-70.79"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="420,-101.25 308.75,-101.25 308.75,-82 420,-82 420,-101.25"/>
-<text text-anchor="middle" x="364.38" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::rehash</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.63,-85.34C268.68,-84.91 283.06,-84.78 296.95,-84.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="296.88,-88.44 306.94,-85.12 297,-81.44 296.88,-88.44"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M413.5,-64.65C419.2,-66.82 424.76,-69.44 429.75,-72.62 450.48,-85.84 445.11,-101.26 465.75,-114.62 472.95,-119.29 481.4,-122.78 489.67,-125.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="488.69,-128.74 499.26,-128 490.54,-121.98 488.69,-128.74"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M401.59,-44.53C424.64,-38.1 454.73,-29.71 479.62,-22.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="480.5,-26.15 489.2,-20.1 478.62,-19.41 480.5,-26.15"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="589.75,-105.25 465.75,-105.25 465.75,-86 589.75,-86 589.75,-105.25"/>
-<text text-anchor="middle" x="527.75" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M404.85,-64.65C426.34,-70.11 453.16,-76.93 476.17,-82.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="475.1,-86.11 485.65,-85.18 476.82,-79.33 475.1,-86.11"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="589.75,-67.88 465.75,-67.88 465.75,-37.38 589.75,-37.38 589.75,-67.88"/>
-<text text-anchor="start" x="473.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::searching</text>
-<text text-anchor="middle" x="527.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M430.08,-53.82C438.01,-53.72 446.15,-53.62 454.18,-53.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="453.96,-57.03 463.92,-53.4 453.88,-50.03 453.96,-57.03"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node2 -->
-<g id="edge8_Node000008_Node000002" class="edge">
-<title>Node8&#45;&gt;Node2</title>
-<g id="a_edge8_Node000008_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.45,-98.11C294.99,-98.43 280.52,-98.46 266.87,-98.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="267.23,-94.71 257.14,-97.95 267.05,-101.71 267.23,-94.71"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge9_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge9_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M404.85,-101.65C430.75,-108.23 464.38,-116.78 489.76,-123.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="488.76,-126.58 499.31,-125.65 490.48,-119.8 488.76,-126.58"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node4 -->
-<g id="edge11_Node000009_Node000004" class="edge">
-<title>Node9&#45;&gt;Node4</title>
-<g id="a_edge11_Node000009_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.21,-130.15C328.1,-130.76 433.61,-131.75 489.41,-132.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="489.31,-135.77 499.34,-132.37 489.37,-128.77 489.31,-135.77"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph_org.svg b/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph_org.svg
deleted file mode 100644
index eb56c891e..000000000
--- a/d8/d89/namespacelinear__probing_a16680b8a37d442c2f208faa286e33908_cgraph_org.svg
+++ /dev/null
@@ -1,211 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: linear_probing::addInfo Pages: 1 -->
-<svg width="598pt" height="168pt"
- viewBox="0.00 0.00 597.75 168.49" 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 164.49)">
-<title>linear_probing::addInfo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="114.25,-120.25 0,-120.25 0,-101 114.25,-101 114.25,-120.25"/>
-<text text-anchor="middle" x="57.12" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::addInfo</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-101.25 157.75,-101.25 157.75,-82 255.5,-82 255.5,-101.25"/>
-<text text-anchor="middle" x="206.62" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.73,-103.33C125.11,-102 135.97,-100.6 146.43,-99.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.6,-102.76 156.07,-98.01 145.7,-95.81 146.6,-102.76"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="554.5,-142.25 501,-142.25 501,-123 554.5,-123 554.5,-142.25"/>
-<text text-anchor="middle" x="527.75" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge12_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge12_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.5,-120.73C94.63,-130.08 123.44,-143.31 150.25,-148.62 272.8,-172.91 422,-152.06 489.92,-139.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="490.17,-143.41 499.38,-138.16 488.91,-136.53 490.17,-143.41"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="587.5,-19.25 468,-19.25 468,0 587.5,0 587.5,-19.25"/>
-<text text-anchor="middle" x="527.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge13_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge13_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.75,-100.64C98.2,-92.38 125.6,-80.73 150.25,-72.62 214.97,-51.36 231.96,-47.74 299,-35.62 351.42,-26.16 411.28,-19.48 456.48,-15.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="456.78,-18.75 466.42,-14.36 456.15,-11.78 456.78,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263,-139.25 150.25,-139.25 150.25,-120 263,-120 263,-139.25"/>
-<text text-anchor="middle" x="206.62" y="-125.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge10_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge10_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.73,-117.92C122.57,-118.93 130.69,-119.97 138.69,-121"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.03,-124.45 148.4,-122.25 138.93,-117.5 138.03,-124.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="429.75,-64.25 299,-64.25 299,-45 429.75,-45 429.75,-64.25"/>
-<text text-anchor="middle" x="364.38" y="-50.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::linearProbe</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M250.18,-81.51C268.56,-77.15 290.25,-72 309.71,-67.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="310.47,-70.79 319.39,-65.07 308.86,-63.98 310.47,-70.79"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="420,-101.25 308.75,-101.25 308.75,-82 420,-82 420,-101.25"/>
-<text text-anchor="middle" x="364.38" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::rehash</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.63,-85.34C268.68,-84.91 283.06,-84.78 296.95,-84.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="296.88,-88.44 306.94,-85.12 297,-81.44 296.88,-88.44"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M413.5,-64.65C419.2,-66.82 424.76,-69.44 429.75,-72.62 450.48,-85.84 445.11,-101.26 465.75,-114.62 472.95,-119.29 481.4,-122.78 489.67,-125.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="488.69,-128.74 499.26,-128 490.54,-121.98 488.69,-128.74"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M401.59,-44.53C424.64,-38.1 454.73,-29.71 479.62,-22.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="480.5,-26.15 489.2,-20.1 478.62,-19.41 480.5,-26.15"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="589.75,-105.25 465.75,-105.25 465.75,-86 589.75,-86 589.75,-105.25"/>
-<text text-anchor="middle" x="527.75" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M404.85,-64.65C426.34,-70.11 453.16,-76.93 476.17,-82.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="475.1,-86.11 485.65,-85.18 476.82,-79.33 475.1,-86.11"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="589.75,-67.88 465.75,-67.88 465.75,-37.38 589.75,-37.38 589.75,-67.88"/>
-<text text-anchor="start" x="473.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::searching</text>
-<text text-anchor="middle" x="527.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M430.08,-53.82C438.01,-53.72 446.15,-53.62 454.18,-53.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="453.96,-57.03 463.92,-53.4 453.88,-50.03 453.96,-57.03"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node2 -->
-<g id="edge8_Node000008_Node000002" class="edge">
-<title>Node8&#45;&gt;Node2</title>
-<g id="a_edge8_Node000008_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.45,-98.11C294.99,-98.43 280.52,-98.46 266.87,-98.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="267.23,-94.71 257.14,-97.95 267.05,-101.71 267.23,-94.71"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge9_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge9_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M404.85,-101.65C430.75,-108.23 464.38,-116.78 489.76,-123.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="488.76,-126.58 499.31,-125.65 490.48,-119.8 488.76,-126.58"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node4 -->
-<g id="edge11_Node000009_Node000004" class="edge">
-<title>Node9&#45;&gt;Node4</title>
-<g id="a_edge11_Node000009_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.21,-130.15C328.1,-130.76 433.61,-131.75 489.41,-132.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="489.31,-135.77 499.34,-132.37 489.37,-128.77 489.31,-135.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d89/namespacelinear__probing_a16d34fd3511626a83ab00665d7bc34d1_cgraph.map b/d8/d89/namespacelinear__probing_a16d34fd3511626a83ab00665d7bc34d1_cgraph.map
deleted file mode 100644
index 472e788d3..000000000
--- a/d8/d89/namespacelinear__probing_a16d34fd3511626a83ab00665d7bc34d1_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="linear_probing::add" name="linear_probing::add">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,136,31"/>
-<area shape="rect" id="Node000002" href="$d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746" title=" " alt="" coords="184,55,358,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="126,29,201,48,200,53,125,34"/>
-<area shape="rect" id="Node000007" href="$d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0" title=" " alt="" coords="197,5,345,31"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="136,24,181,24,181,30,136,29"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="453,5,524,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="330,51,437,27,439,32,332,57"/>
-<area shape="rect" id="Node000004" href="$d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" title="Hash a key. Uses the STL library&#39;s std::hash() function." alt="" coords="409,55,568,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="358,65,393,65,393,70,358,70"/>
-<area shape="rect" id="Node000005" href="$d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" title=" " alt="" coords="406,104,571,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="332,78,415,97,413,103,330,84"/>
-<area shape="rect" id="Node000006" href="$d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" title=" " alt="" coords="406,154,571,194"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="295,79,407,140,418,145,416,150,405,145,293,83"/>
-<area shape="poly" id="edge7_Node000007_Node000001" title=" " alt="" coords="196,12,151,12,151,7,196,7"/>
-<area shape="poly" id="edge8_Node000007_Node000003" title=" " alt="" coords="346,16,438,16,438,21,346,21"/>
-</map>
diff --git a/d8/d89/namespacelinear__probing_a16d34fd3511626a83ab00665d7bc34d1_cgraph.md5 b/d8/d89/namespacelinear__probing_a16d34fd3511626a83ab00665d7bc34d1_cgraph.md5
deleted file mode 100644
index c4342df24..000000000
--- a/d8/d89/namespacelinear__probing_a16d34fd3511626a83ab00665d7bc34d1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1c62423d180772d6d1c20cdd0570e7b9
\ No newline at end of file
diff --git a/d8/d89/namespacelinear__probing_a16d34fd3511626a83ab00665d7bc34d1_cgraph.svg b/d8/d89/namespacelinear__probing_a16d34fd3511626a83ab00665d7bc34d1_cgraph.svg
deleted file mode 100644
index de484f00e..000000000
--- a/d8/d89/namespacelinear__probing_a16d34fd3511626a83ab00665d7bc34d1_cgraph.svg
+++ /dev/null
@@ -1,174 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: linear_probing::add Pages: 1 -->
-<svg width="433pt" height="150pt"
- viewBox="0.00 0.00 432.50 149.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 145.88)">
-<title>linear_probing::add</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="97.75,-141.88 0,-141.88 0,-122.62 97.75,-122.62 97.75,-141.88"/>
-<text text-anchor="middle" x="48.88" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::add</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.5,-104.88 133.75,-104.88 133.75,-85.62 264.5,-85.62 264.5,-104.88"/>
-<text text-anchor="middle" x="199.12" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::linearProbe</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.38,-122.14C107.71,-117.82 128.14,-112.72 146.53,-108.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.34,-111.53 156.2,-105.71 145.65,-104.74 147.34,-111.53"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-141.88 143.5,-141.88 143.5,-122.62 254.75,-122.62 254.75,-141.88"/>
-<text text-anchor="middle" x="199.12" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::rehash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.01,-125.88C108.79,-125.55 120.41,-125.44 131.78,-125.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.46,-129.03 141.52,-125.68 131.57,-122.03 131.46,-129.03"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="389.25,-141.88 335.75,-141.88 335.75,-122.62 389.25,-122.62 389.25,-141.88"/>
-<text text-anchor="middle" x="362.5" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M244.22,-105.36C269.4,-111.13 300.62,-118.29 324.51,-123.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="323.59,-127.15 334.12,-125.97 325.15,-120.33 323.59,-127.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="422.25,-104.88 302.75,-104.88 302.75,-85.62 422.25,-85.62 422.25,-104.88"/>
-<text text-anchor="middle" x="362.5" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.83,-95.25C273.43,-95.25 282.28,-95.25 290.97,-95.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="290.75,-98.75 300.75,-95.25 290.75,-91.75 290.75,-98.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424.5,-67.88 300.5,-67.88 300.5,-48.62 424.5,-48.62 424.5,-67.88"/>
-<text text-anchor="middle" x="362.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M244.22,-85.14C263.43,-80.73 286.16,-75.52 306.46,-70.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.02,-74.33 315.98,-68.69 305.45,-67.51 307.02,-74.33"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424.5,-30.5 300.5,-30.5 300.5,0 424.5,0 424.5,-30.5"/>
-<text text-anchor="start" x="308.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::searching</text>
-<text text-anchor="middle" x="362.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.46,-85.24C236.04,-73.46 270.02,-53.67 300.5,-39.25 303.25,-37.95 306.09,-36.66 308.97,-35.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="310.28,-38.64 318.12,-31.5 307.54,-32.19 310.28,-38.64"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node1 -->
-<g id="edge7_Node000007_Node000001" class="edge">
-<title>Node7&#45;&gt;Node1</title>
-<g id="a_edge7_Node000007_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M143.03,-138.8C132.06,-139.04 120.49,-139.06 109.38,-138.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="109.6,-135.39 99.52,-138.65 109.44,-142.38 109.6,-135.39"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge8_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge8_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.21,-132.25C277.96,-132.25 303.73,-132.25 324.2,-132.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="324.06,-135.75 334.06,-132.25 324.06,-128.75 324.06,-135.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d89/namespacelinear__probing_a16d34fd3511626a83ab00665d7bc34d1_cgraph_org.svg b/d8/d89/namespacelinear__probing_a16d34fd3511626a83ab00665d7bc34d1_cgraph_org.svg
deleted file mode 100644
index 906a247a3..000000000
--- a/d8/d89/namespacelinear__probing_a16d34fd3511626a83ab00665d7bc34d1_cgraph_org.svg
+++ /dev/null
@@ -1,148 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: linear_probing::add Pages: 1 -->
-<svg width="433pt" height="150pt"
- viewBox="0.00 0.00 432.50 149.88" 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 145.88)">
-<title>linear_probing::add</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="97.75,-141.88 0,-141.88 0,-122.62 97.75,-122.62 97.75,-141.88"/>
-<text text-anchor="middle" x="48.88" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::add</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.5,-104.88 133.75,-104.88 133.75,-85.62 264.5,-85.62 264.5,-104.88"/>
-<text text-anchor="middle" x="199.12" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::linearProbe</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.38,-122.14C107.71,-117.82 128.14,-112.72 146.53,-108.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.34,-111.53 156.2,-105.71 145.65,-104.74 147.34,-111.53"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-141.88 143.5,-141.88 143.5,-122.62 254.75,-122.62 254.75,-141.88"/>
-<text text-anchor="middle" x="199.12" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::rehash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.01,-125.88C108.79,-125.55 120.41,-125.44 131.78,-125.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.46,-129.03 141.52,-125.68 131.57,-122.03 131.46,-129.03"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="389.25,-141.88 335.75,-141.88 335.75,-122.62 389.25,-122.62 389.25,-141.88"/>
-<text text-anchor="middle" x="362.5" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M244.22,-105.36C269.4,-111.13 300.62,-118.29 324.51,-123.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="323.59,-127.15 334.12,-125.97 325.15,-120.33 323.59,-127.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="422.25,-104.88 302.75,-104.88 302.75,-85.62 422.25,-85.62 422.25,-104.88"/>
-<text text-anchor="middle" x="362.5" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.83,-95.25C273.43,-95.25 282.28,-95.25 290.97,-95.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="290.75,-98.75 300.75,-95.25 290.75,-91.75 290.75,-98.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424.5,-67.88 300.5,-67.88 300.5,-48.62 424.5,-48.62 424.5,-67.88"/>
-<text text-anchor="middle" x="362.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M244.22,-85.14C263.43,-80.73 286.16,-75.52 306.46,-70.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.02,-74.33 315.98,-68.69 305.45,-67.51 307.02,-74.33"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424.5,-30.5 300.5,-30.5 300.5,0 424.5,0 424.5,-30.5"/>
-<text text-anchor="start" x="308.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::searching</text>
-<text text-anchor="middle" x="362.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.46,-85.24C236.04,-73.46 270.02,-53.67 300.5,-39.25 303.25,-37.95 306.09,-36.66 308.97,-35.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="310.28,-38.64 318.12,-31.5 307.54,-32.19 310.28,-38.64"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node1 -->
-<g id="edge7_Node000007_Node000001" class="edge">
-<title>Node7&#45;&gt;Node1</title>
-<g id="a_edge7_Node000007_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M143.03,-138.8C132.06,-139.04 120.49,-139.06 109.38,-138.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="109.6,-135.39 99.52,-138.65 109.44,-142.38 109.6,-135.39"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge8_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge8_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.21,-132.25C277.96,-132.25 303.73,-132.25 324.2,-132.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="324.06,-135.75 334.06,-132.25 324.06,-128.75 324.06,-135.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d89/namespacelinear__probing_a6322209aaa91b7bbf16f96e1cc52b746_cgraph.map b/d8/d89/namespacelinear__probing_a6322209aaa91b7bbf16f96e1cc52b746_cgraph.map
deleted file mode 100644
index c977e8d43..000000000
--- a/d8/d89/namespacelinear__probing_a6322209aaa91b7bbf16f96e1cc52b746_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="linear_probing::linearProbe" name="linear_probing::linearProbe">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,80,180,106"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="275,5,346,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="126,77,227,40,259,29,261,35,229,45,128,82"/>
-<area shape="rect" id="Node000003" href="$d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" title="Hash a key. Uses the STL library&#39;s std::hash() function." alt="" coords="231,55,390,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="180,80,215,76,215,81,180,85"/>
-<area shape="rect" id="Node000004" href="$d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" title=" " alt="" coords="228,104,393,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="180,100,213,103,212,109,180,105"/>
-<area shape="rect" id="Node000005" href="$d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" title=" " alt="" coords="228,154,393,194"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="130,104,240,145,238,150,128,109"/>
-</map>
diff --git a/d8/d89/namespacelinear__probing_a6322209aaa91b7bbf16f96e1cc52b746_cgraph.md5 b/d8/d89/namespacelinear__probing_a6322209aaa91b7bbf16f96e1cc52b746_cgraph.md5
deleted file mode 100644
index c7c72f700..000000000
--- a/d8/d89/namespacelinear__probing_a6322209aaa91b7bbf16f96e1cc52b746_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-04d5fce2523fa35baf6a324d28862a8c
\ No newline at end of file
diff --git a/d8/d89/namespacelinear__probing_a6322209aaa91b7bbf16f96e1cc52b746_cgraph.svg b/d8/d89/namespacelinear__probing_a6322209aaa91b7bbf16f96e1cc52b746_cgraph.svg
deleted file mode 100644
index 11ab10121..000000000
--- a/d8/d89/namespacelinear__probing_a6322209aaa91b7bbf16f96e1cc52b746_cgraph.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: linear_probing::linearProbe Pages: 1 -->
-<svg width="299pt" height="150pt"
- viewBox="0.00 0.00 298.75 149.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 145.88)">
-<title>linear_probing::linearProbe</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="130.75,-85.88 0,-85.88 0,-66.62 130.75,-66.62 130.75,-85.88"/>
-<text text-anchor="middle" x="65.38" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::linearProbe</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-141.88 202,-141.88 202,-122.62 255.5,-122.62 255.5,-141.88"/>
-<text text-anchor="middle" x="228.75" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.35,-86.3C111.55,-94.29 140.79,-105.52 166.75,-114.25 174.5,-116.86 182.88,-119.46 190.87,-121.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.76,-125.17 200.34,-124.63 191.73,-118.46 189.76,-125.17"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="288.5,-104.88 169,-104.88 169,-85.62 288.5,-85.62 288.5,-104.88"/>
-<text text-anchor="middle" x="228.75" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.08,-83.87C139.68,-84.88 148.53,-85.92 157.22,-86.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.67,-90.41 167.01,-88.1 157.49,-83.45 156.67,-90.41"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.75,-67.88 166.75,-67.88 166.75,-48.62 290.75,-48.62 290.75,-67.88"/>
-<text text-anchor="middle" x="228.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.08,-69.03C139.01,-68.15 147.15,-67.24 155.18,-66.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.38,-69.84 164.93,-65.26 154.6,-62.89 155.38,-69.84"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.75,-30.5 166.75,-30.5 166.75,0 290.75,0 290.75,-30.5"/>
-<text text-anchor="start" x="174.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::searching</text>
-<text text-anchor="middle" x="228.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.02,-66.18C115.39,-57.72 148.01,-45.39 175.55,-34.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.68,-38.3 184.79,-31.49 174.2,-31.75 176.68,-38.3"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d89/namespacelinear__probing_a6322209aaa91b7bbf16f96e1cc52b746_cgraph_org.svg b/d8/d89/namespacelinear__probing_a6322209aaa91b7bbf16f96e1cc52b746_cgraph_org.svg
deleted file mode 100644
index dfce91a1f..000000000
--- a/d8/d89/namespacelinear__probing_a6322209aaa91b7bbf16f96e1cc52b746_cgraph_org.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: linear_probing::linearProbe Pages: 1 -->
-<svg width="299pt" height="150pt"
- viewBox="0.00 0.00 298.75 149.88" 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 145.88)">
-<title>linear_probing::linearProbe</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="130.75,-85.88 0,-85.88 0,-66.62 130.75,-66.62 130.75,-85.88"/>
-<text text-anchor="middle" x="65.38" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::linearProbe</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-141.88 202,-141.88 202,-122.62 255.5,-122.62 255.5,-141.88"/>
-<text text-anchor="middle" x="228.75" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.35,-86.3C111.55,-94.29 140.79,-105.52 166.75,-114.25 174.5,-116.86 182.88,-119.46 190.87,-121.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.76,-125.17 200.34,-124.63 191.73,-118.46 189.76,-125.17"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="288.5,-104.88 169,-104.88 169,-85.62 288.5,-85.62 288.5,-104.88"/>
-<text text-anchor="middle" x="228.75" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.08,-83.87C139.68,-84.88 148.53,-85.92 157.22,-86.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.67,-90.41 167.01,-88.1 157.49,-83.45 156.67,-90.41"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.75,-67.88 166.75,-67.88 166.75,-48.62 290.75,-48.62 290.75,-67.88"/>
-<text text-anchor="middle" x="228.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.08,-69.03C139.01,-68.15 147.15,-67.24 155.18,-66.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.38,-69.84 164.93,-65.26 154.6,-62.89 155.38,-69.84"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.75,-30.5 166.75,-30.5 166.75,0 290.75,0 290.75,-30.5"/>
-<text text-anchor="start" x="174.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::searching</text>
-<text text-anchor="middle" x="228.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.02,-66.18C115.39,-57.72 148.01,-45.39 175.55,-34.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.68,-38.3 184.79,-31.49 174.2,-31.75 176.68,-38.3"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph.map b/d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph.map
deleted file mode 100644
index f45dd8d06..000000000
--- a/d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="linear_probing::rehash" name="linear_probing::rehash">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,56,154,82"/>
-<area shape="rect" id="Node000002" href="$d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1" title=" " alt="" coords="202,56,332,82"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="154,75,186,75,186,80,154,80"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="649,5,721,31"/>
-<area shape="poly" id="edge8_Node000001_Node000004" title=" " alt="" coords="135,53,201,41,323,28,444,21,634,16,634,21,444,26,323,34,202,46,136,58"/>
-<area shape="poly" id="edge7_Node000002_Node000001" title=" " alt="" coords="201,63,169,63,169,57,201,58"/>
-<area shape="rect" id="Node000003" href="$d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746" title=" " alt="" coords="380,56,554,82"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="332,66,365,66,365,72,332,72"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="525,53,634,27,635,32,526,58"/>
-<area shape="rect" id="Node000005" href="$d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" title="Hash a key. Uses the STL library&#39;s std::hash() function." alt="" coords="605,55,765,80"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="555,66,590,65,590,71,555,71"/>
-<area shape="rect" id="Node000006" href="$d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" title=" " alt="" coords="602,104,768,130"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="530,80,609,97,608,103,528,85"/>
-<area shape="rect" id="Node000007" href="$d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" title=" " alt="" coords="602,154,768,194"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="492,80,604,140,615,145,613,150,601,145,490,85"/>
-</map>
diff --git a/d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph.md5 b/d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph.md5
deleted file mode 100644
index 43d1701fb..000000000
--- a/d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3db9b09fbbb664204a38c7897edf0abb
\ No newline at end of file
diff --git a/d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph.svg b/d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph.svg
deleted file mode 100644
index e0ba11d97..000000000
--- a/d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph.svg
+++ /dev/null
@@ -1,231 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: linear_probing::rehash Pages: 1 -->
-<!--zoomable 150 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 580;
-var viewHeight = 150;
-var sectionId = 'dynsection-4';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>linear_probing::rehash</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="111.25,-103.88 0,-103.88 0,-84.62 111.25,-84.62 111.25,-103.88"/>
-<text text-anchor="middle" x="55.62" y="-90.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::rehash</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245,-103.88 147.25,-103.88 147.25,-84.62 245,-84.62 245,-103.88"/>
-<text text-anchor="middle" x="196.12" y="-90.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.36,-87.63C119.38,-87.48 127.67,-87.46 135.77,-87.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.48,-91.06 145.55,-87.76 135.62,-84.06 135.48,-91.06"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="536.5,-141.88 483,-141.88 483,-122.62 536.5,-122.62 536.5,-141.88"/>
-<text text-anchor="middle" x="509.75" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge8_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge8_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.9,-104.3C113.3,-107.68 130.99,-111.13 147.25,-113.25 264.88,-128.58 405.57,-131.63 471.37,-132.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="471.23,-135.68 481.25,-132.24 471.27,-128.68 471.23,-135.68"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node1 -->
-<g id="edge7_Node000002_Node000001" class="edge">
-<title>Node2&#45;&gt;Node1</title>
-<g id="a_edge7_Node000002_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.06,-100.71C139.23,-100.93 131,-101.03 122.83,-100.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.92,-97.5 112.88,-100.88 122.84,-104.49 122.92,-97.5"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="411.75,-103.88 281,-103.88 281,-84.62 411.75,-84.62 411.75,-103.88"/>
-<text text-anchor="middle" x="346.38" y="-90.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::linearProbe</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.26,-94.25C253.05,-94.25 261.27,-94.25 269.53,-94.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.25,-97.75 279.25,-94.25 269.25,-90.75 269.25,-97.75"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M390.2,-104.33C415.67,-110.33 447.65,-117.86 471.98,-123.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="470.89,-126.93 481.43,-125.82 472.5,-120.12 470.89,-126.93"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="569.5,-104.88 450,-104.88 450,-85.62 569.5,-85.62 569.5,-104.88"/>
-<text text-anchor="middle" x="509.75" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M412.08,-94.65C420.68,-94.7 429.53,-94.76 438.22,-94.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="437.98,-98.31 448,-94.87 438.02,-91.31 437.98,-98.31"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="571.75,-67.88 447.75,-67.88 447.75,-48.62 571.75,-48.62 571.75,-67.88"/>
-<text text-anchor="middle" x="509.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M392.76,-84.13C411.23,-80.01 432.77,-75.2 452.24,-70.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="452.95,-74.28 461.95,-68.69 451.43,-67.45 452.95,-74.28"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="571.75,-30.5 447.75,-30.5 447.75,0 571.75,0 571.75,-30.5"/>
-<text text-anchor="start" x="455.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::searching</text>
-<text text-anchor="middle" x="509.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M364.09,-84.24C383.74,-72.67 417.52,-53.41 447.75,-39.25 450.51,-37.96 453.35,-36.68 456.24,-35.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.54,-38.66 465.39,-31.54 454.81,-32.22 457.54,-38.66"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph_org.svg b/d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph_org.svg
deleted file mode 100644
index 0fba3038d..000000000
--- a/d8/d89/namespacelinear__probing_a6a082dc1426a79f866cee6b370df37b0_cgraph_org.svg
+++ /dev/null
@@ -1,148 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: linear_probing::rehash Pages: 1 -->
-<svg width="580pt" height="150pt"
- viewBox="0.00 0.00 579.75 149.88" 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 145.88)">
-<title>linear_probing::rehash</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="111.25,-103.88 0,-103.88 0,-84.62 111.25,-84.62 111.25,-103.88"/>
-<text text-anchor="middle" x="55.62" y="-90.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::rehash</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245,-103.88 147.25,-103.88 147.25,-84.62 245,-84.62 245,-103.88"/>
-<text text-anchor="middle" x="196.12" y="-90.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.36,-87.63C119.38,-87.48 127.67,-87.46 135.77,-87.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.48,-91.06 145.55,-87.76 135.62,-84.06 135.48,-91.06"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="536.5,-141.88 483,-141.88 483,-122.62 536.5,-122.62 536.5,-141.88"/>
-<text text-anchor="middle" x="509.75" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge8_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge8_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.9,-104.3C113.3,-107.68 130.99,-111.13 147.25,-113.25 264.88,-128.58 405.57,-131.63 471.37,-132.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="471.23,-135.68 481.25,-132.24 471.27,-128.68 471.23,-135.68"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node1 -->
-<g id="edge7_Node000002_Node000001" class="edge">
-<title>Node2&#45;&gt;Node1</title>
-<g id="a_edge7_Node000002_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.06,-100.71C139.23,-100.93 131,-101.03 122.83,-100.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.92,-97.5 112.88,-100.88 122.84,-104.49 122.92,-97.5"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="411.75,-103.88 281,-103.88 281,-84.62 411.75,-84.62 411.75,-103.88"/>
-<text text-anchor="middle" x="346.38" y="-90.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::linearProbe</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.26,-94.25C253.05,-94.25 261.27,-94.25 269.53,-94.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.25,-97.75 279.25,-94.25 269.25,-90.75 269.25,-97.75"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M390.2,-104.33C415.67,-110.33 447.65,-117.86 471.98,-123.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="470.89,-126.93 481.43,-125.82 472.5,-120.12 470.89,-126.93"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="569.5,-104.88 450,-104.88 450,-85.62 569.5,-85.62 569.5,-104.88"/>
-<text text-anchor="middle" x="509.75" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M412.08,-94.65C420.68,-94.7 429.53,-94.76 438.22,-94.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="437.98,-98.31 448,-94.87 438.02,-91.31 437.98,-98.31"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="571.75,-67.88 447.75,-67.88 447.75,-48.62 571.75,-48.62 571.75,-67.88"/>
-<text text-anchor="middle" x="509.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M392.76,-84.13C411.23,-80.01 432.77,-75.2 452.24,-70.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="452.95,-74.28 461.95,-68.69 451.43,-67.45 452.95,-74.28"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="571.75,-30.5 447.75,-30.5 447.75,0 571.75,0 571.75,-30.5"/>
-<text text-anchor="start" x="455.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::searching</text>
-<text text-anchor="middle" x="509.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M364.09,-84.24C383.74,-72.67 417.52,-53.41 447.75,-39.25 450.51,-37.96 453.35,-36.68 456.24,-35.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.54,-38.66 465.39,-31.54 454.81,-32.22 457.54,-38.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph.map b/d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph.map
deleted file mode 100644
index e72f0ab57..000000000
--- a/d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="linear_probing::removalInfo" name="linear_probing::removalInfo">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,51,183,77"/>
-<area shape="rect" id="Node000002" href="$d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635" title=" " alt="" coords="443,26,593,52"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="183,56,427,41,428,47,183,61"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="700,23,772,49"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="144,48,230,29,335,13,417,4,500,4,606,11,685,23,684,28,605,16,500,9,418,10,336,18,231,35,145,53"/>
-<area shape="rect" id="Node000004" href="$d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" title="Hash a key. Uses the STL library&#39;s std::hash() function." alt="" coords="656,187,816,213"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="129,75,232,112,330,142,431,163,540,179,641,190,641,195,539,184,431,168,329,147,230,117,127,80"/>
-<area shape="rect" id="Node000005" href="$d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28" title=" " alt="" coords="231,77,383,102"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="184,72,216,76,215,81,183,77"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="594,35,685,34,685,39,594,40"/>
-<area shape="poly" id="edge6_Node000005_Node000003" title=" " alt="" coords="383,83,489,75,605,61,684,46,685,51,606,67,489,80,384,88"/>
-<area shape="rect" id="Node000006" href="$d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746" title=" " alt="" coords="431,127,605,153"/>
-<area shape="poly" id="edge7_Node000005_Node000006" title=" " alt="" coords="364,100,448,120,446,126,363,105"/>
-<area shape="poly" id="edge8_Node000006_Node000003" title=" " alt="" coords="566,124,604,106,618,94,627,82,637,70,652,58,684,44,686,49,655,62,640,74,631,85,622,98,607,110,568,129"/>
-<area shape="poly" id="edge9_Node000006_Node000004" title=" " alt="" coords="569,151,673,180,671,185,567,156"/>
-<area shape="rect" id="Node000007" href="$d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" title=" " alt="" coords="653,73,819,98"/>
-<area shape="poly" id="edge10_Node000006_Node000007" title=" " alt="" coords="571,124,667,100,668,105,573,129"/>
-<area shape="rect" id="Node000008" href="$d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" title=" " alt="" coords="653,122,819,163"/>
-<area shape="poly" id="edge11_Node000006_Node000008" title=" " alt="" coords="606,138,638,139,638,144,606,144"/>
-</map>
diff --git a/d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph.md5 b/d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph.md5
deleted file mode 100644
index 1867eadcb..000000000
--- a/d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bfa83923416995eda4d23ec576cc1c14
\ No newline at end of file
diff --git a/d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph.svg b/d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph.svg
deleted file mode 100644
index 4529705c6..000000000
--- a/d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph.svg
+++ /dev/null
@@ -1,267 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: linear_probing::removalInfo Pages: 1 -->
-<!--zoomable 164 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 618;
-var viewHeight = 164;
-var sectionId = 'dynsection-5';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>linear_probing::removalInfo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="133,-121.25 0,-121.25 0,-102 133,-102 133,-121.25"/>
-<text text-anchor="middle" x="66.5" y="-107.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::removalInfo</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441,-140.25 328.25,-140.25 328.25,-121 441,-121 441,-140.25"/>
-<text text-anchor="middle" x="384.62" y="-126.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.39,-115.58C187.11,-118.81 262.66,-123.35 316.67,-126.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.15,-130.08 326.34,-127.18 316.57,-123.09 316.15,-130.08"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="574.75,-142.25 521.25,-142.25 521.25,-123 574.75,-123 574.75,-142.25"/>
-<text text-anchor="middle" x="548" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.37,-121.65C123.52,-126.52 147.38,-132.08 169,-135.62 292.4,-155.86 325.43,-160.46 450,-149.62 469.84,-147.9 491.71,-144.22 509.65,-140.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="510.22,-144.19 519.33,-138.78 508.84,-137.33 510.22,-144.19"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="607.75,-19.25 488.25,-19.25 488.25,0 607.75,0 607.75,-19.25"/>
-<text text-anchor="middle" x="548" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.85,-101.64C112.25,-93.49 142.24,-81.99 169,-73.62 234.74,-53.07 251.49,-48 319.25,-35.62 371.65,-26.05 431.52,-19.38 476.72,-15.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="477.02,-18.68 486.66,-14.3 476.39,-11.71 477.02,-18.68"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.25,-102.25 169,-102.25 169,-83 283.25,-83 283.25,-102.25"/>
-<text text-anchor="middle" x="226.12" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::remove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.43,-103.68C141.46,-102.71 149.67,-101.72 157.72,-100.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.94,-104.25 167.45,-99.58 157.11,-97.3 157.94,-104.25"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M441.16,-131.31C463.72,-131.59 489.19,-131.91 509.5,-132.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="509.24,-135.66 519.28,-132.28 509.32,-128.66 509.24,-135.66"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge6_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge6_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M283.69,-95.44C328.88,-98.17 393.74,-103.17 450,-111.62 469.85,-114.61 491.72,-119.22 509.66,-123.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="508.81,-126.76 519.35,-125.66 510.42,-119.95 508.81,-126.76"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="450,-64.25 319.25,-64.25 319.25,-45 450,-45 450,-64.25"/>
-<text text-anchor="middle" x="384.62" y="-50.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::linearProbe</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge7_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge7_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M268.65,-82.54C287.83,-77.88 310.81,-72.3 331.17,-67.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.81,-70.81 340.7,-65.05 330.16,-64.01 331.81,-70.81"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge8_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge8_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M421,-64.74C430.8,-68.34 441.17,-72.95 450,-78.62 469.04,-90.86 466.55,-103.07 486,-114.62 493.31,-118.97 501.74,-122.33 509.96,-124.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="508.87,-128.23 519.44,-127.54 510.75,-121.49 508.87,-128.23"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge9_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge9_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M421.84,-44.53C444.89,-38.1 474.98,-29.71 499.87,-22.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="500.75,-26.15 509.45,-20.1 498.87,-19.41 500.75,-26.15"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="610,-105.25 486,-105.25 486,-86 610,-86 610,-105.25"/>
-<text text-anchor="middle" x="548" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge10_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge10_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M425.1,-64.65C446.59,-70.11 473.41,-76.93 496.42,-82.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.35,-86.11 505.9,-85.18 497.07,-79.33 495.35,-86.11"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="610,-67.88 486,-67.88 486,-37.38 610,-37.38 610,-67.88"/>
-<text text-anchor="start" x="494" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::searching</text>
-<text text-anchor="middle" x="548" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge11_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge11_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M450.33,-53.82C458.26,-53.72 466.4,-53.62 474.43,-53.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="474.21,-57.03 484.17,-53.4 474.13,-50.03 474.21,-57.03"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph_org.svg b/d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph_org.svg
deleted file mode 100644
index a3010fed3..000000000
--- a/d8/d89/namespacelinear__probing_a75854f5aa216e61219154c62167ce8f0_cgraph_org.svg
+++ /dev/null
@@ -1,184 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: linear_probing::removalInfo Pages: 1 -->
-<svg width="618pt" height="164pt"
- viewBox="0.00 0.00 618.00 163.63" 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 159.63)">
-<title>linear_probing::removalInfo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="133,-121.25 0,-121.25 0,-102 133,-102 133,-121.25"/>
-<text text-anchor="middle" x="66.5" y="-107.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::removalInfo</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441,-140.25 328.25,-140.25 328.25,-121 441,-121 441,-140.25"/>
-<text text-anchor="middle" x="384.62" y="-126.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.39,-115.58C187.11,-118.81 262.66,-123.35 316.67,-126.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.15,-130.08 326.34,-127.18 316.57,-123.09 316.15,-130.08"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="574.75,-142.25 521.25,-142.25 521.25,-123 574.75,-123 574.75,-142.25"/>
-<text text-anchor="middle" x="548" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.37,-121.65C123.52,-126.52 147.38,-132.08 169,-135.62 292.4,-155.86 325.43,-160.46 450,-149.62 469.84,-147.9 491.71,-144.22 509.65,-140.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="510.22,-144.19 519.33,-138.78 508.84,-137.33 510.22,-144.19"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="607.75,-19.25 488.25,-19.25 488.25,0 607.75,0 607.75,-19.25"/>
-<text text-anchor="middle" x="548" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.85,-101.64C112.25,-93.49 142.24,-81.99 169,-73.62 234.74,-53.07 251.49,-48 319.25,-35.62 371.65,-26.05 431.52,-19.38 476.72,-15.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="477.02,-18.68 486.66,-14.3 476.39,-11.71 477.02,-18.68"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.25,-102.25 169,-102.25 169,-83 283.25,-83 283.25,-102.25"/>
-<text text-anchor="middle" x="226.12" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::remove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.43,-103.68C141.46,-102.71 149.67,-101.72 157.72,-100.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.94,-104.25 167.45,-99.58 157.11,-97.3 157.94,-104.25"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M441.16,-131.31C463.72,-131.59 489.19,-131.91 509.5,-132.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="509.24,-135.66 519.28,-132.28 509.32,-128.66 509.24,-135.66"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge6_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge6_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M283.69,-95.44C328.88,-98.17 393.74,-103.17 450,-111.62 469.85,-114.61 491.72,-119.22 509.66,-123.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="508.81,-126.76 519.35,-125.66 510.42,-119.95 508.81,-126.76"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="450,-64.25 319.25,-64.25 319.25,-45 450,-45 450,-64.25"/>
-<text text-anchor="middle" x="384.62" y="-50.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::linearProbe</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge7_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge7_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M268.65,-82.54C287.83,-77.88 310.81,-72.3 331.17,-67.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.81,-70.81 340.7,-65.05 330.16,-64.01 331.81,-70.81"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge8_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge8_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M421,-64.74C430.8,-68.34 441.17,-72.95 450,-78.62 469.04,-90.86 466.55,-103.07 486,-114.62 493.31,-118.97 501.74,-122.33 509.96,-124.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="508.87,-128.23 519.44,-127.54 510.75,-121.49 508.87,-128.23"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge9_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge9_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M421.84,-44.53C444.89,-38.1 474.98,-29.71 499.87,-22.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="500.75,-26.15 509.45,-20.1 498.87,-19.41 500.75,-26.15"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="610,-105.25 486,-105.25 486,-86 610,-86 610,-105.25"/>
-<text text-anchor="middle" x="548" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge10_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge10_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M425.1,-64.65C446.59,-70.11 473.41,-76.93 496.42,-82.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.35,-86.11 505.9,-85.18 497.07,-79.33 495.35,-86.11"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="610,-67.88 486,-67.88 486,-37.38 610,-37.38 610,-67.88"/>
-<text text-anchor="start" x="494" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::searching</text>
-<text text-anchor="middle" x="548" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge11_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge11_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M450.33,-53.82C458.26,-53.72 466.4,-53.62 474.43,-53.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="474.21,-57.03 484.17,-53.4 474.13,-50.03 474.21,-57.03"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d89/namespacelinear__probing_abcf8d033f8115f39f3c93cfb6cee0b28_cgraph.map b/d8/d89/namespacelinear__probing_abcf8d033f8115f39f3c93cfb6cee0b28_cgraph.map
deleted file mode 100644
index 4ed537312..000000000
--- a/d8/d89/namespacelinear__probing_abcf8d033f8115f39f3c93cfb6cee0b28_cgraph.map
+++ /dev/null
@@ -1,14 +0,0 @@
-<map id="linear_probing::remove" name="linear_probing::remove">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,158,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="475,5,546,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="158,36,459,18,459,24,158,42"/>
-<area shape="rect" id="Node000003" href="$d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746" title=" " alt="" coords="206,56,380,82"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="158,50,190,54,190,59,158,55"/>
-<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="351,53,460,27,461,32,352,58"/>
-<area shape="rect" id="Node000004" href="$d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" title="Hash a key. Uses the STL library&#39;s std::hash() function." alt="" coords="431,55,590,80"/>
-<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="380,66,415,65,415,71,380,71"/>
-<area shape="rect" id="Node000005" href="$d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" title=" " alt="" coords="428,104,593,130"/>
-<area shape="poly" id="edge5_Node000003_Node000005" title=" " alt="" coords="355,80,435,97,433,103,354,85"/>
-<area shape="rect" id="Node000006" href="$d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" title=" " alt="" coords="428,154,593,194"/>
-<area shape="poly" id="edge6_Node000003_Node000006" title=" " alt="" coords="318,80,429,140,440,145,438,150,427,145,315,85"/>
-</map>
diff --git a/d8/d89/namespacelinear__probing_abcf8d033f8115f39f3c93cfb6cee0b28_cgraph.md5 b/d8/d89/namespacelinear__probing_abcf8d033f8115f39f3c93cfb6cee0b28_cgraph.md5
deleted file mode 100644
index fafd56a60..000000000
--- a/d8/d89/namespacelinear__probing_abcf8d033f8115f39f3c93cfb6cee0b28_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5944bdea6da1e5530557aaa8b261188a
\ No newline at end of file
diff --git a/d8/d89/namespacelinear__probing_abcf8d033f8115f39f3c93cfb6cee0b28_cgraph.svg b/d8/d89/namespacelinear__probing_abcf8d033f8115f39f3c93cfb6cee0b28_cgraph.svg
deleted file mode 100644
index 4601c3be8..000000000
--- a/d8/d89/namespacelinear__probing_abcf8d033f8115f39f3c93cfb6cee0b28_cgraph.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: linear_probing::remove Pages: 1 -->
-<svg width="449pt" height="150pt"
- viewBox="0.00 0.00 449.00 149.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 145.88)">
-<title>linear_probing::remove</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="114.25,-122.88 0,-122.88 0,-103.62 114.25,-103.62 114.25,-122.88"/>
-<text text-anchor="middle" x="57.12" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::remove</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="405.75,-141.88 352.25,-141.88 352.25,-122.62 405.75,-122.62 405.75,-141.88"/>
-<text text-anchor="middle" x="379" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.58,-116.6C179.58,-120.46 284.54,-126.7 340.33,-130.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="340.07,-133.5 350.26,-130.6 340.49,-126.52 340.07,-133.5"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="281,-103.88 150.25,-103.88 150.25,-84.62 281,-84.62 281,-103.88"/>
-<text text-anchor="middle" x="215.62" y="-90.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::linearProbe</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.63,-106.39C122.42,-105.44 130.53,-104.46 138.61,-103.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.96,-106.96 148.47,-102.28 138.12,-100.01 138.96,-106.96"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.45,-104.33C284.92,-110.33 316.9,-117.86 341.23,-123.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="340.14,-126.93 350.68,-125.82 341.75,-120.12 340.14,-126.93"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="438.75,-104.88 319.25,-104.88 319.25,-85.62 438.75,-85.62 438.75,-104.88"/>
-<text text-anchor="middle" x="379" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M281.33,-94.65C289.93,-94.7 298.78,-94.76 307.47,-94.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.23,-98.31 317.25,-94.87 307.27,-91.31 307.23,-98.31"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441,-67.88 317,-67.88 317,-48.62 441,-48.62 441,-67.88"/>
-<text text-anchor="middle" x="379" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge5_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge5_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.01,-84.13C280.48,-80.01 302.02,-75.2 321.49,-70.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.2,-74.28 331.2,-68.69 320.68,-67.45 322.2,-74.28"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441,-30.5 317,-30.5 317,0 441,0 441,-30.5"/>
-<text text-anchor="start" x="325" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::searching</text>
-<text text-anchor="middle" x="379" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M233.34,-84.24C252.99,-72.67 286.77,-53.41 317,-39.25 319.76,-37.96 322.6,-36.68 325.49,-35.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.79,-38.66 334.64,-31.54 324.06,-32.22 326.79,-38.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d89/namespacelinear__probing_abcf8d033f8115f39f3c93cfb6cee0b28_cgraph_org.svg b/d8/d89/namespacelinear__probing_abcf8d033f8115f39f3c93cfb6cee0b28_cgraph_org.svg
deleted file mode 100644
index 54f57399d..000000000
--- a/d8/d89/namespacelinear__probing_abcf8d033f8115f39f3c93cfb6cee0b28_cgraph_org.svg
+++ /dev/null
@@ -1,121 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: linear_probing::remove Pages: 1 -->
-<svg width="449pt" height="150pt"
- viewBox="0.00 0.00 449.00 149.88" 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 145.88)">
-<title>linear_probing::remove</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="114.25,-122.88 0,-122.88 0,-103.62 114.25,-103.62 114.25,-122.88"/>
-<text text-anchor="middle" x="57.12" y="-109.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::remove</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="405.75,-141.88 352.25,-141.88 352.25,-122.62 405.75,-122.62 405.75,-141.88"/>
-<text text-anchor="middle" x="379" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.58,-116.6C179.58,-120.46 284.54,-126.7 340.33,-130.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="340.07,-133.5 350.26,-130.6 340.49,-126.52 340.07,-133.5"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="281,-103.88 150.25,-103.88 150.25,-84.62 281,-84.62 281,-103.88"/>
-<text text-anchor="middle" x="215.62" y="-90.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::linearProbe</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.63,-106.39C122.42,-105.44 130.53,-104.46 138.61,-103.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.96,-106.96 148.47,-102.28 138.12,-100.01 138.96,-106.96"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.45,-104.33C284.92,-110.33 316.9,-117.86 341.23,-123.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="340.14,-126.93 350.68,-125.82 341.75,-120.12 340.14,-126.93"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527" target="_top" xlink:title="Hash a key. Uses the STL library&#39;s std::hash() function.">
-<polygon fill="white" stroke="#666666" points="438.75,-104.88 319.25,-104.88 319.25,-85.62 438.75,-85.62 438.75,-104.88"/>
-<text text-anchor="middle" x="379" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M281.33,-94.65C289.93,-94.7 298.78,-94.76 307.47,-94.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.23,-98.31 317.25,-94.87 307.27,-91.31 307.23,-98.31"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441,-67.88 317,-67.88 317,-48.62 441,-48.62 441,-67.88"/>
-<text text-anchor="middle" x="379" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::putProber</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge5_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge5_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.01,-84.13C280.48,-80.01 302.02,-75.2 321.49,-70.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.2,-74.28 331.2,-68.69 320.68,-67.45 322.2,-74.28"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441,-30.5 317,-30.5 317,0 441,0 441,-30.5"/>
-<text text-anchor="start" x="325" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::searching</text>
-<text text-anchor="middle" x="379" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Prober</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M233.34,-84.24C252.99,-72.67 286.77,-53.41 317,-39.25 319.76,-37.96 322.6,-36.68 325.49,-35.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.79,-38.66 334.64,-31.54 324.06,-32.22 326.79,-38.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d89/namespacelinear__probing_ad87b71d810901fab69c4ad9d4d0fa635_cgraph.map b/d8/d89/namespacelinear__probing_ad87b71d810901fab69c4ad9d4d0fa635_cgraph.map
deleted file mode 100644
index 1fb4be187..000000000
--- a/d8/d89/namespacelinear__probing_ad87b71d810901fab69c4ad9d4d0fa635_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="linear_probing::display" name="linear_probing::display">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,156,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="204,5,275,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="156,16,188,16,188,21,156,21"/>
-</map>
diff --git a/d8/d89/namespacelinear__probing_ad87b71d810901fab69c4ad9d4d0fa635_cgraph.md5 b/d8/d89/namespacelinear__probing_ad87b71d810901fab69c4ad9d4d0fa635_cgraph.md5
deleted file mode 100644
index bf8a7ed9d..000000000
--- a/d8/d89/namespacelinear__probing_ad87b71d810901fab69c4ad9d4d0fa635_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c7454b3a6a4a9778ae998b92407860ec
\ No newline at end of file
diff --git a/d8/d89/namespacelinear__probing_ad87b71d810901fab69c4ad9d4d0fa635_cgraph.svg b/d8/d89/namespacelinear__probing_ad87b71d810901fab69c4ad9d4d0fa635_cgraph.svg
deleted file mode 100644
index 6fe4c5117..000000000
--- a/d8/d89/namespacelinear__probing_ad87b71d810901fab69c4ad9d4d0fa635_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: linear_probing::display Pages: 1 -->
-<svg width="210pt" height="27pt"
- viewBox="0.00 0.00 210.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>linear_probing::display</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="112.75,-19.25 0,-19.25 0,0 112.75,0 112.75,-19.25"/>
-<text text-anchor="middle" x="56.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::display</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="202.25,-19.25 148.75,-19.25 148.75,0 202.25,0 202.25,-19.25"/>
-<text text-anchor="middle" x="175.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.19,-9.62C121.24,-9.62 129.35,-9.62 136.92,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.77,-13.13 146.77,-9.63 136.77,-6.13 136.77,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d89/namespacelinear__probing_ad87b71d810901fab69c4ad9d4d0fa635_cgraph_org.svg b/d8/d89/namespacelinear__probing_ad87b71d810901fab69c4ad9d4d0fa635_cgraph_org.svg
deleted file mode 100644
index 8cf28707c..000000000
--- a/d8/d89/namespacelinear__probing_ad87b71d810901fab69c4ad9d4d0fa635_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: linear_probing::display Pages: 1 -->
-<svg width="210pt" height="27pt"
- viewBox="0.00 0.00 210.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>linear_probing::display</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="112.75,-19.25 0,-19.25 0,0 112.75,0 112.75,-19.25"/>
-<text text-anchor="middle" x="56.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::display</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="202.25,-19.25 148.75,-19.25 148.75,0 202.25,0 202.25,-19.25"/>
-<text text-anchor="middle" x="175.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.19,-9.62C121.24,-9.62 129.35,-9.62 136.92,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.77,-13.13 146.77,-9.63 136.77,-6.13 136.77,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d8a/exponential__search_8cpp.html b/d8/d8a/exponential__search_8cpp.html
index 42be5eb29..d0b3d4a48 100644
--- a/d8/d8a/exponential__search_8cpp.html
+++ b/d8/d8a/exponential__search_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: search/exponential_search.cpp File Reference</title>
+<title>TheAlgorithms/C++: search/exponential_search.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for exponential_search.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d3c/exponential__search_8cpp__incl.svg" width="326" height="126"><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">
+</div>
+<p><a href="../../d8/d8a/exponential__search_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ab06cedad209456eae95d37b7cd66acae" id="r_ab06cedad209456eae95d37b7cd66acae"><td class="memTemplParams" colspan="2">template&lt;class Type &gt; </td></tr>
@@ -137,6 +156,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Exponential_search" target="_blank">Exponential search algorithm</a> </p>
 <dl class="section copyright"><dt>Copyright</dt><dd>2020 Divide-et-impera-11</dd></dl>
 <p>The algorithm try to search the range where the key should be. If it has been found we do a binary search there. The range of the search grows by exponential every time. If the key is larger than the last element of array, the start of block(block_front) will be equal to the end of block(block_size) and the algorithm return null ponter, every other cases the algoritm return fom the loop. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/d8a/exponential__search_8cpp_source.html">exponential_search.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ab06cedad209456eae95d37b7cd66acae" name="ab06cedad209456eae95d37b7cd66acae"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ab06cedad209456eae95d37b7cd66acae">&#9670;&#160;</a></span>binary_s()</h2>
@@ -182,11 +203,13 @@ template&lt;class Type &gt; </div>
 <code>nullptr</code> if value not found </dd></dl>
 </li>
 </ul>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d8a/exponential__search_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../d8/d8a/exponential__search_8cpp_source.html">exponential_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   34</span>                                                          {</div>
 <div class="line"><span class="lineno">   35</span>    int32_t lower_index(0), upper_index(size - 1), middle_index;</div>
 <div class="line"><span class="lineno">   36</span> </div>
 <div class="line"><span class="lineno">   37</span>    <span class="keywordflow">while</span> (lower_index &lt;= upper_index) {</div>
-<div class="line"><span class="lineno">   38</span>        middle_index = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/floor.html">std::floor</a>((lower_index + upper_index) / 2);</div>
+<div class="line"><span class="lineno">   38</span>        middle_index = std::floor((lower_index + upper_index) / 2);</div>
 <div class="line"><span class="lineno">   39</span> </div>
 <div class="line"><span class="lineno">   40</span>        <span class="keywordflow">if</span> (*(array + middle_index) &lt; key)</div>
 <div class="line"><span class="lineno">   41</span>            lower_index = (middle_index + 1);</div>
@@ -198,13 +221,7 @@ template&lt;class Type &gt; </div>
 <div class="line"><span class="lineno">   47</span> </div>
 <div class="line"><span class="lineno">   48</span>    <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">   49</span>}</div>
-<div class="ttc" id="afloor_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/floor.html">std::floor</a></div><div class="ttdeci">T floor(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d8a/exponential__search_8cpp_ab06cedad209456eae95d37b7cd66acae_cgraph.svg" width="202" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -222,6 +239,8 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d8a/exponential__search_8cpp_source.html#l00074">74</a> of file <a class="el" href="../../d8/d8a/exponential__search_8cpp_source.html">exponential_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   74</span>           {</div>
 <div class="line"><span class="lineno">   75</span>    <span class="comment">// TEST CASES</span></div>
 <div class="line"><span class="lineno">   76</span>    <span class="keywordtype">int</span>* sorted_array = <span class="keyword">new</span> <span class="keywordtype">int</span>[7]{7, 10, 15, 23, 70, 105, 203};</div>
@@ -233,13 +252,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   82</span>    <span class="keyword">delete</span>[] sorted_array;</div>
 <div class="line"><span class="lineno">   83</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   84</span>}</div>
-<div class="ttc" id="aexponential__search_8cpp_html_af421bf4b7b95f20ac86c233adfdb9208"><div class="ttname"><a href="#af421bf4b7b95f20ac86c233adfdb9208">struzik_search</a></div><div class="ttdeci">Type * struzik_search(Type *array, size_t size, Type key)</div><div class="ttdef"><b>Definition</b> exponential_search.cpp:59</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="454" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aexponential__search_8cpp_html_af421bf4b7b95f20ac86c233adfdb9208"><div class="ttname"><a href="#af421bf4b7b95f20ac86c233adfdb9208">struzik_search</a></div><div class="ttdeci">Type * struzik_search(Type *array, size_t size, Type key)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d8a/exponential__search_8cpp_source.html#l00059">exponential_search.cpp:59</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af421bf4b7b95f20ac86c233adfdb9208" name="af421bf4b7b95f20ac86c233adfdb9208"></a>
@@ -274,6 +288,8 @@ template&lt;class Type &gt; </div>
 <li>Space Complexity O(1)</li>
 <li>Auxiliary Space Complexity O(1) </li>
 </ul>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d8a/exponential__search_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d8/d8a/exponential__search_8cpp_source.html">exponential_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   59</span>                                                         {</div>
 <div class="line"><span class="lineno">   60</span>    uint32_t block_front(0), block_size = size == 0 ? 0 : 1;</div>
 <div class="line"><span class="lineno">   61</span>    <span class="keywordflow">while</span> (block_front != block_size) {</div>
@@ -287,13 +303,8 @@ template&lt;class Type &gt; </div>
 <div class="line"><span class="lineno">   69</span>    }</div>
 <div class="line"><span class="lineno">   70</span>    <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">   71</span>}</div>
-<div class="ttc" id="aexponential__search_8cpp_html_ab06cedad209456eae95d37b7cd66acae"><div class="ttname"><a href="#ab06cedad209456eae95d37b7cd66acae">binary_s</a></div><div class="ttdeci">Type * binary_s(Type *array, size_t size, Type key)</div><div class="ttdef"><b>Definition</b> exponential_search.cpp:34</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.svg" width="356" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aexponential__search_8cpp_html_ab06cedad209456eae95d37b7cd66acae"><div class="ttname"><a href="#ab06cedad209456eae95d37b7cd66acae">binary_s</a></div><div class="ttdeci">Type * binary_s(Type *array, size_t size, Type key)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d8a/exponential__search_8cpp_source.html#l00034">exponential_search.cpp:34</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d8/d8a/exponential__search_8cpp_ab06cedad209456eae95d37b7cd66acae_cgraph.map b/d8/d8a/exponential__search_8cpp_ab06cedad209456eae95d37b7cd66acae_cgraph.map
deleted file mode 100644
index 01abb75c7..000000000
--- a/d8/d8a/exponential__search_8cpp_ab06cedad209456eae95d37b7cd66acae_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="binary_s" name="binary_s">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,76,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/floor.html#" title=" " alt="" coords="124,5,196,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="76,16,108,16,108,21,76,21"/>
-</map>
diff --git a/d8/d8a/exponential__search_8cpp_ab06cedad209456eae95d37b7cd66acae_cgraph.md5 b/d8/d8a/exponential__search_8cpp_ab06cedad209456eae95d37b7cd66acae_cgraph.md5
deleted file mode 100644
index eb4d7792c..000000000
--- a/d8/d8a/exponential__search_8cpp_ab06cedad209456eae95d37b7cd66acae_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f90bdf5dda11722fafab50c0b5ad183d
\ No newline at end of file
diff --git a/d8/d8a/exponential__search_8cpp_ab06cedad209456eae95d37b7cd66acae_cgraph.svg b/d8/d8a/exponential__search_8cpp_ab06cedad209456eae95d37b7cd66acae_cgraph.svg
deleted file mode 100644
index 1ee3d108e..000000000
--- a/d8/d8a/exponential__search_8cpp_ab06cedad209456eae95d37b7cd66acae_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_s Pages: 1 -->
-<svg width="151pt" height="27pt"
- viewBox="0.00 0.00 151.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>binary_s</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="52.75,-19.25 0,-19.25 0,0 52.75,0 52.75,-19.25"/>
-<text text-anchor="middle" x="26.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">binary_s</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/floor.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143,-19.25 88.75,-19.25 88.75,0 143,0 143,-19.25"/>
-<text text-anchor="middle" x="115.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::floor</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.15,-9.62C60.61,-9.62 68.9,-9.62 76.93,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.86,-13.13 86.86,-9.63 76.86,-6.13 76.86,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d8a/exponential__search_8cpp_ab06cedad209456eae95d37b7cd66acae_cgraph_org.svg b/d8/d8a/exponential__search_8cpp_ab06cedad209456eae95d37b7cd66acae_cgraph_org.svg
deleted file mode 100644
index 1174f4bbf..000000000
--- a/d8/d8a/exponential__search_8cpp_ab06cedad209456eae95d37b7cd66acae_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_s Pages: 1 -->
-<svg width="151pt" height="27pt"
- viewBox="0.00 0.00 151.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>binary_s</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="52.75,-19.25 0,-19.25 0,0 52.75,0 52.75,-19.25"/>
-<text text-anchor="middle" x="26.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">binary_s</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/floor.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143,-19.25 88.75,-19.25 88.75,0 143,0 143,-19.25"/>
-<text text-anchor="middle" x="115.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::floor</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.15,-9.62C60.61,-9.62 68.9,-9.62 76.93,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.86,-13.13 86.86,-9.63 76.86,-6.13 76.86,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index efd7c869b..000000000
--- a/d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208" title=" " alt="" coords="103,5,209,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="$d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae" title=" " alt="" coords="257,5,327,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="210,16,241,16,241,21,210,21"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/floor.html#" title=" " alt="" coords="375,5,448,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="328,16,360,16,360,21,328,21"/>
-</map>
diff --git a/d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index a3845e8fa..000000000
--- a/d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8bd0fd7647e850f173ab507a3b0c2fd0
\ No newline at end of file
diff --git a/d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 41d13fc38..000000000
--- a/d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="340pt" height="27pt"
- viewBox="0.00 0.00 339.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152.75,-19.25 73,-19.25 73,0 152.75,0 152.75,-19.25"/>
-<text text-anchor="middle" x="112.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">struzik_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-9.62C44.31,-9.62 52.73,-9.62 61.35,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.19,-13.13 71.19,-9.63 61.19,-6.13 61.19,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="241.5,-19.25 188.75,-19.25 188.75,0 241.5,0 241.5,-19.25"/>
-<text text-anchor="middle" x="215.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">binary_s</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.21,-9.62C161.08,-9.62 169.32,-9.62 177.1,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.95,-13.13 186.95,-9.63 176.95,-6.13 176.95,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/floor.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="331.75,-19.25 277.5,-19.25 277.5,0 331.75,0 331.75,-19.25"/>
-<text text-anchor="middle" x="304.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::floor</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M241.9,-9.62C249.36,-9.62 257.65,-9.62 265.68,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.61,-13.13 275.61,-9.63 265.61,-6.13 265.61,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 752fa227b..000000000
--- a/d8/d8a/exponential__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="340pt" height="27pt"
- viewBox="0.00 0.00 339.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152.75,-19.25 73,-19.25 73,0 152.75,0 152.75,-19.25"/>
-<text text-anchor="middle" x="112.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">struzik_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-9.62C44.31,-9.62 52.73,-9.62 61.35,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.19,-13.13 71.19,-9.63 61.19,-6.13 61.19,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="241.5,-19.25 188.75,-19.25 188.75,0 241.5,0 241.5,-19.25"/>
-<text text-anchor="middle" x="215.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">binary_s</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.21,-9.62C161.08,-9.62 169.32,-9.62 177.1,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.95,-13.13 186.95,-9.63 176.95,-6.13 176.95,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/floor.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="331.75,-19.25 277.5,-19.25 277.5,0 331.75,0 331.75,-19.25"/>
-<text text-anchor="middle" x="304.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::floor</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M241.9,-9.62C249.36,-9.62 257.65,-9.62 265.68,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.61,-13.13 275.61,-9.63 265.61,-6.13 265.61,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.map b/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.map
deleted file mode 100644
index b6e55ec3e..000000000
--- a/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="struzik_search" name="struzik_search">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,112,31"/>
-<area shape="rect" id="Node000002" href="$d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae" title=" " alt="" coords="160,5,230,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="112,16,144,16,144,21,112,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/floor.html#" title=" " alt="" coords="278,5,350,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="231,16,262,16,262,21,231,21"/>
-</map>
diff --git a/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.md5 b/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.md5
deleted file mode 100644
index 661bb9c4a..000000000
--- a/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f8cdcc8009682d51680a49cb18b1d5ca
\ No newline at end of file
diff --git a/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.svg b/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.svg
deleted file mode 100644
index 637170812..000000000
--- a/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: struzik_search Pages: 1 -->
-<svg width="267pt" height="27pt"
- viewBox="0.00 0.00 266.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>struzik_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="79.75,-19.25 0,-19.25 0,0 79.75,0 79.75,-19.25"/>
-<text text-anchor="middle" x="39.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">struzik_search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="168.5,-19.25 115.75,-19.25 115.75,0 168.5,0 168.5,-19.25"/>
-<text text-anchor="middle" x="142.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">binary_s</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.21,-9.62C88.08,-9.62 96.32,-9.62 104.1,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.95,-13.13 113.95,-9.63 103.95,-6.13 103.95,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/floor.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.75,-19.25 204.5,-19.25 204.5,0 258.75,0 258.75,-19.25"/>
-<text text-anchor="middle" x="231.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::floor</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M168.9,-9.62C176.36,-9.62 184.65,-9.62 192.68,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.61,-13.13 202.61,-9.63 192.61,-6.13 192.61,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph_org.svg b/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph_org.svg
deleted file mode 100644
index 0bef2241a..000000000
--- a/d8/d8a/exponential__search_8cpp_af421bf4b7b95f20ac86c233adfdb9208_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: struzik_search Pages: 1 -->
-<svg width="267pt" height="27pt"
- viewBox="0.00 0.00 266.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>struzik_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="79.75,-19.25 0,-19.25 0,0 79.75,0 79.75,-19.25"/>
-<text text-anchor="middle" x="39.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">struzik_search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="168.5,-19.25 115.75,-19.25 115.75,0 168.5,0 168.5,-19.25"/>
-<text text-anchor="middle" x="142.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">binary_s</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.21,-9.62C88.08,-9.62 96.32,-9.62 104.1,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.95,-13.13 113.95,-9.63 103.95,-6.13 103.95,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/floor.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.75,-19.25 204.5,-19.25 204.5,0 258.75,0 258.75,-19.25"/>
-<text text-anchor="middle" x="231.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::floor</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M168.9,-9.62C176.36,-9.62 184.65,-9.62 192.68,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.61,-13.13 202.61,-9.63 192.61,-6.13 192.61,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d8a/exponential__search_8cpp_source.html b/d8/d8a/exponential__search_8cpp_source.html
new file mode 100644
index 000000000..e792fd18f
--- /dev/null
+++ b/d8/d8a/exponential__search_8cpp_source.html
@@ -0,0 +1,200 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: search/exponential_search.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/d8a/exponential__search_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">exponential_search.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/d8a/exponential__search_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#ifdef _MSC_VER</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;string&gt;</span>  <span class="comment">// use for MS Visual C++</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cstring&gt;</span>  <span class="comment">// for all other compilers</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> Type&gt;</div>
+<div class="foldopen" id="foldopen00034" data-start="{" data-end="}">
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae">   34</a></span><span class="keyword">inline</span> Type* <a class="code hl_function" href="../../d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae">binary_s</a>(Type* array, <span class="keywordtype">size_t</span> size, Type key) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    int32_t lower_index(0), upper_index(size - 1), middle_index;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">while</span> (lower_index &lt;= upper_index) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        middle_index = std::floor((lower_index + upper_index) / 2);</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <span class="keywordflow">if</span> (*(array + middle_index) &lt; key)</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>            lower_index = (middle_index + 1);</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (*(array + middle_index) &gt; key)</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>            upper_index = (middle_index - 1);</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>            <span class="keywordflow">return</span> (array + middle_index);</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    }</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>}</div>
+</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> Type&gt;</div>
+<div class="foldopen" id="foldopen00059" data-start="{" data-end="}">
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208">   59</a></span>Type* <a class="code hl_function" href="../../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208">struzik_search</a>(Type* array, <span class="keywordtype">size_t</span> size, Type key) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    uint32_t block_front(0), block_size = size == 0 ? 0 : 1;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">while</span> (block_front != block_size) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordflow">if</span> (*(array + block_size - 1) &lt; key) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            block_front = block_size;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            (block_size * 2 - 1 &lt; size) ? (block_size *= 2) : block_size = size;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae">binary_s&lt;Type&gt;</a>(array + block_front, (block_size - block_front),</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                              key);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>}</div>
+</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="foldopen" id="foldopen00074" data-start="{" data-end="}">
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="../../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   74</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="comment">// TEST CASES</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keywordtype">int</span>* sorted_array = <span class="keyword">new</span> <span class="keywordtype">int</span>[7]{7, 10, 15, 23, 70, 105, 203};</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    assert(<a class="code hl_function" href="../../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208">struzik_search&lt;int&gt;</a>(sorted_array, 7, 0) == <span class="keyword">nullptr</span>);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    assert(<a class="code hl_function" href="../../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208">struzik_search&lt;int&gt;</a>(sorted_array, 7, 1000) == <span class="keyword">nullptr</span>);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    assert(<a class="code hl_function" href="../../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208">struzik_search&lt;int&gt;</a>(sorted_array, 7, 50) == <span class="keyword">nullptr</span>);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    assert(<a class="code hl_function" href="../../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208">struzik_search&lt;int&gt;</a>(sorted_array, 7, 7) == sorted_array);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="comment">// TEST CASES</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keyword">delete</span>[] sorted_array;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>}</div>
+</div>
+<div class="ttc" id="aexponential__search_8cpp_html_ab06cedad209456eae95d37b7cd66acae"><div class="ttname"><a href="../../d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae">binary_s</a></div><div class="ttdeci">Type * binary_s(Type *array, size_t size, Type key)</div><div class="ttdef"><b>Definition</b> <a href="#l00034">exponential_search.cpp:34</a></div></div>
+<div class="ttc" id="aexponential__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00074">exponential_search.cpp:74</a></div></div>
+<div class="ttc" id="aexponential__search_8cpp_html_af421bf4b7b95f20ac86c233adfdb9208"><div class="ttname"><a href="../../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208">struzik_search</a></div><div class="ttdeci">Type * struzik_search(Type *array, size_t size, Type key)</div><div class="ttdef"><b>Definition</b> <a href="#l00059">exponential_search.cpp:59</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../d8/d8a/exponential__search_8cpp.html">exponential_search.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/d8e/struct_node-members.html b/d8/d8e/struct_node-members.html
index bdc6dada5..5b85611a1 100644
--- a/d8/d8e/struct_node-members.html
+++ b/d8/d8e/struct_node-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/d8f/bitonic__sort_8cpp_source.html b/d8/d8f/bitonic__sort_8cpp_source.html
new file mode 100644
index 000000000..85b4f50eb
--- /dev/null
+++ b/d8/d8f/bitonic__sort_8cpp_source.html
@@ -0,0 +1,204 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/bitonic_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/d8f/bitonic__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">bitonic_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">// Source : https://www.geeksforgeeks.org/bitonic-sort/</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span> </div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment">/* C++ Program for Bitonic Sort. Note that this program</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment">   works only when size of input is a power of 2. */</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment">/*The parameter dir indicates the sorting direction, ASCENDING</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment">   or DESCENDING; if (a[i] &gt; a[j]) agrees with the direction,</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment">   then a[i] and a[j] are interchanged.*/</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="keywordtype">void</span> compAndSwap(<span class="keywordtype">int</span> a[], <span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j, <span class="keywordtype">int</span> dir) {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <span class="keywordflow">if</span> (dir == (a[i] &gt; a[j]))</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>        std::swap(a[i], a[j]);</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>}</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment">/*It recursively sorts a bitonic sequence in ascending order,</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment">  if dir = 1, and in descending order otherwise (means dir=0).</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment">  The sequence to be sorted starts at index position low,</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment">  the parameter cnt is the number of elements to be sorted.*/</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="keywordtype">void</span> bitonicMerge(<span class="keywordtype">int</span> a[], <span class="keywordtype">int</span> low, <span class="keywordtype">int</span> cnt, <span class="keywordtype">int</span> dir) {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    <span class="keywordflow">if</span> (cnt &gt; 1) {</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = cnt / 2;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = low; i &lt; low + <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>; i++) compAndSwap(a, i, i + k, dir);</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        bitonicMerge(a, low, k, dir);</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        bitonicMerge(a, low + k, k, dir);</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    }</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>}</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment">/* This function first produces a bitonic sequence by recursively</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="comment">    sorting its two halves in opposite sorting orders, and then</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="comment">    calls bitonicMerge to make them in the same order */</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keywordtype">void</span> bitonicSort(<span class="keywordtype">int</span> a[], <span class="keywordtype">int</span> low, <span class="keywordtype">int</span> cnt, <span class="keywordtype">int</span> dir) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">if</span> (cnt &gt; 1) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = cnt / 2;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        <span class="comment">// sort in ascending order since dir here is 1</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        bitonicSort(a, low, k, 1);</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <span class="comment">// sort in descending order since dir here is 0</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        bitonicSort(a, low + k, k, 0);</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="comment">// Will merge wole sequence in ascending order</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="comment">// since dir=1.</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        bitonicMerge(a, low, cnt, dir);</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    }</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>}</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="comment">/* Caller of bitonicSort for sorting the entire array of</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="comment">   length N in ASCENDING order */</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="keywordtype">void</span> sort(<span class="keywordtype">int</span> a[], <span class="keywordtype">int</span> N, <span class="keywordtype">int</span> up) { bitonicSort(a, 0, N, up); }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="comment">// Driver code</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordtype">int</span> a[] = {3, 7, 4, 8, 6, 2, 1, 5};</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = <span class="keyword">sizeof</span>(a) / <span class="keyword">sizeof</span>(a[0]);</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordtype">int</span> up = 1;  <span class="comment">// means sort in ascending order</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    sort(a, N, up);</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted array: \n&quot;</span>;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) std::cout &lt;&lt; a[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>}</div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><b>bitonic_sort.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/d90/iterative__tree__traversals_8cpp.html b/d8/d90/iterative__tree__traversals_8cpp.html
index 405a584f5..8c8b09eba 100644
--- a/d8/d90/iterative__tree__traversals_8cpp.html
+++ b/d8/d90/iterative__tree__traversals_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/iterative_tree_traversals.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/iterative_tree_traversals.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for iterative_tree_traversals.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d94/iterative__tree__traversals_8cpp__incl.svg" width="428" height="126"><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">
+</div>
+<p><a href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a></td></tr>
@@ -181,6 +200,8 @@ Iterative Postorder Traversal of a tree</h3>
 <h3><a class="anchor" id="autotoc_md95"></a>
 Iterative Inorder Traversal of a tree</h3>
 <p>Create a Stack that will store the <a class="el" href="../../db/d8b/struct_node.html">Node</a> of Tree. Push the root node into the stack. Save the root into the variabe named as current. Now iterate and take the current to the extreme left of the tree by traversing only to its left. Pop the elemnt from the stack and assign it to the current. Store the data of current into the result array. Repeat the same set of steps until the Stack becomes empty or the current becomes NULL. And return the result array as the inorder traversal of a tree. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a0eec4455ee737c32976963e3aabb9d9f" name="a0eec4455ee737c32976963e3aabb9d9f"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0eec4455ee737c32976963e3aabb9d9f">&#9670;&#160;</a></span>deleteAll()</h2>
@@ -196,9 +217,11 @@ Iterative Inorder Traversal of a tree</h3>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00183">183</a> of file <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  183</span>                           {</div>
 <div class="line"><span class="lineno">  184</span>    <span class="keywordflow">if</span> (root) {</div>
-<div class="line"><span class="lineno">  185</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;Node *&gt;</a> <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;</div>
+<div class="line"><span class="lineno">  185</span>        std::stack&lt;Node *&gt; <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;</div>
 <div class="line"><span class="lineno">  186</span>        <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(root);</div>
 <div class="line"><span class="lineno">  187</span> </div>
 <div class="line"><span class="lineno">  188</span>        <span class="keywordflow">while</span> (!<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.empty()) {</div>
@@ -215,13 +238,12 @@ Iterative Inorder Traversal of a tree</h3>
 <div class="line"><span class="lineno">  199</span>        }</div>
 <div class="line"><span class="lineno">  200</span>    }</div>
 <div class="line"><span class="lineno">  201</span>}</div>
-<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> stack.hpp:19</div></div>
-<div class="ttc" id="aclassstack_html_a3647fb4418890f19e0dc414b8092b8b0"><div class="ttname"><a href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition</b> stack.hpp:62</div></div>
-<div class="ttc" id="aclassstack_html_a90df277532c23519aa7ac3c08ed90a1d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack::push</a></div><div class="ttdeci">void push(const value_type &amp;item)</div><div class="ttdef"><b>Definition</b> stack.hpp:47</div></div>
-<div class="ttc" id="aclassstack_html_ae09630c4384903d187801921b2ddc709"><div class="ttname"><a href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">stack::top</a></div><div class="ttdeci">value_type top() const</div><div class="ttdef"><b>Definition</b> stack.hpp:56</div></div>
-<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition</b> paranthesis_matching.cpp:20</div></div>
-<div class="ttc" id="astack_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a></div></div>
-<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</div></div>
+<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00019">stack.hpp:19</a></div></div>
+<div class="ttc" id="aclassstack_html_a3647fb4418890f19e0dc414b8092b8b0"><div class="ttname"><a href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00062">stack.hpp:62</a></div></div>
+<div class="ttc" id="aclassstack_html_a90df277532c23519aa7ac3c08ed90a1d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack::push</a></div><div class="ttdeci">void push(const value_type &amp;item)</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00047">stack.hpp:47</a></div></div>
+<div class="ttc" id="aclassstack_html_ae09630c4384903d187801921b2ddc709"><div class="ttname"><a href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">stack::top</a></div><div class="ttdeci">value_type top() const</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00056">stack.hpp:56</a></div></div>
+<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00020">paranthesis_matching.cpp:20</a></div></div>
+<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -243,6 +265,8 @@ Iterative Inorder Traversal of a tree</h3>
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
 <p>&lt; instace of BinaryTree, used to access its members functions.</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00372">372</a> of file <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  372</span>           {</div>
 <div class="line"><span class="lineno">  373</span>    <span class="comment">// Creating a tree with the following structure,</span></div>
 <div class="line"><span class="lineno">  374</span>    <span class="comment">/*</span></div>
@@ -254,23 +278,22 @@ Iterative Inorder Traversal of a tree</h3>
 <div class="line"><span class="lineno">  380</span><span class="comment">    */</span></div>
 <div class="line"><span class="lineno">  381</span> </div>
 <div class="line"><span class="lineno">  382</span>    <a class="code hl_class" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a></div>
-<div class="line"><span class="lineno">  383</span>        binaryTree;  <span class="comment">///&lt; instace of BinaryTree, used to access its members</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  384</span><span class="comment">                     ///&lt; functions.</span></div>
-<div class="line"><span class="lineno">  385</span><span class="comment"></span>    <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(1);</div>
+<div class="line"><span class="lineno">  383</span>        binaryTree;  </div>
+<div class="line"><span class="lineno">  385</span>    <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(1);</div>
 <div class="line"><span class="lineno">  386</span>    root-&gt;left = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(2);</div>
 <div class="line"><span class="lineno">  387</span>    root-&gt;right = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(3);</div>
 <div class="line"><span class="lineno">  388</span>    root-&gt;left-&gt;left = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(4);</div>
 <div class="line"><span class="lineno">  389</span>    root-&gt;left-&gt;right = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(5);</div>
 <div class="line"><span class="lineno">  390</span> </div>
-<div class="line"><span class="lineno">  391</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n| Tests for positive data value |&quot;</span> &lt;&lt; <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">  391</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n| Tests for positive data value |&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  392</span>    <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>(binaryTree, root);  <span class="comment">// run preorder-iterative test</span></div>
-<div class="line"><span class="lineno">  393</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPre-order test Passed!&quot;</span> &lt;&lt; <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">  393</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPre-order test Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  394</span> </div>
 <div class="line"><span class="lineno">  395</span>    <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>(binaryTree, root);  <span class="comment">// run postorder-iterative test</span></div>
-<div class="line"><span class="lineno">  396</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPost-order test Passed!&quot;</span> &lt;&lt; <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">  396</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPost-order test Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  397</span> </div>
 <div class="line"><span class="lineno">  398</span>    <a class="code hl_function" href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a>(binaryTree, root);  <span class="comment">// run inorder-iterative test</span></div>
-<div class="line"><span class="lineno">  399</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nIn-order test Passed!&quot;</span> &lt;&lt; <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">  399</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nIn-order test Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  400</span> </div>
 <div class="line"><span class="lineno">  401</span>    <span class="comment">// Modifying tree for negative values.</span></div>
 <div class="line"><span class="lineno">  402</span>    root-&gt;data = -1;</div>
@@ -279,37 +302,30 @@ Iterative Inorder Traversal of a tree</h3>
 <div class="line"><span class="lineno">  405</span>    root-&gt;left-&gt;left-&gt;data = -4;</div>
 <div class="line"><span class="lineno">  406</span>    root-&gt;left-&gt;right-&gt;data = -5;</div>
 <div class="line"><span class="lineno">  407</span> </div>
-<div class="line"><span class="lineno">  408</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n| Tests for negative data values |&quot;</span> &lt;&lt; <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">  408</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n| Tests for negative data values |&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  409</span>    <a class="code hl_function" href="#a038b236fe900f7bb7e57164f5bed66c2">test4</a>(binaryTree, root);  <span class="comment">// run preorder-iterative test on negative values</span></div>
-<div class="line"><span class="lineno">  410</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPre-order test on-negative value Passed!&quot;</span> &lt;&lt; <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">  410</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPre-order test on-negative value Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  411</span> </div>
 <div class="line"><span class="lineno">  412</span>    <a class="code hl_function" href="#aa9ef334cd7eb607f4eb8732566ea00b8">test5</a>(binaryTree, root);  <span class="comment">// run postorder-iterative test on negative values</span></div>
-<div class="line"><span class="lineno">  413</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPost-order test on-negative value Passed!&quot;</span> &lt;&lt; <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">  413</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPost-order test on-negative value Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  414</span> </div>
 <div class="line"><span class="lineno">  415</span>    <a class="code hl_function" href="#af727f920064f2b8f484b589b60d49b89">test6</a>(binaryTree, root);  <span class="comment">// run inorder-iterative test on negative values</span></div>
-<div class="line"><span class="lineno">  416</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nIn-order test on-negative value Passed!&quot;</span> &lt;&lt; <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">  416</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nIn-order test on-negative value Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  417</span> </div>
 <div class="line"><span class="lineno">  418</span>    deleteAll(root);</div>
 <div class="line"><span class="lineno">  419</span> </div>
 <div class="line"><span class="lineno">  420</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  421</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="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a></div><div class="ttdoc">defines the functions associated with the binary tree</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:67</div></div>
-<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_a3078a5ccf45d6a7031dcf46e43de65b6"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">others::iterative_tree_traversals::BinaryTree::createNewNode</a></div><div class="ttdeci">Node * createNewNode(int64_t)</div><div class="ttdoc">function that will create new node for insertion.</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:88</div></div>
-<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:187</div></div>
-<div class="ttc" id="adsu__path__compression_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-test implementations, 1st test.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:170</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="ahamiltons__cycle_8cpp_html_a0cc94918b6831f308d4fe4fa27f08299"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a></div><div class="ttdeci">static void test3()</div><div class="ttdef"><b>Definition</b> hamiltons_cycle.cpp:122</div></div>
-<div class="ttc" id="aiterative__tree__traversals_8cpp_html_a038b236fe900f7bb7e57164f5bed66c2"><div class="ttname"><a href="#a038b236fe900f7bb7e57164f5bed66c2">test4</a></div><div class="ttdeci">static void test4(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed preorder with the actual preorder on negative value.</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:291</div></div>
-<div class="ttc" id="aiterative__tree__traversals_8cpp_html_aa9ef334cd7eb607f4eb8732566ea00b8"><div class="ttname"><a href="#aa9ef334cd7eb607f4eb8732566ea00b8">test5</a></div><div class="ttdeci">static void test5(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed postorder with the actual postorder on negative value.</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:319</div></div>
-<div class="ttc" id="aiterative__tree__traversals_8cpp_html_af727f920064f2b8f484b589b60d49b89"><div class="ttname"><a href="#af727f920064f2b8f484b589b60d49b89">test6</a></div><div class="ttdeci">static void test6(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed inorder with the actual inorder on negative value.</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:346</div></div>
-<div class="ttc" id="astructothers_1_1iterative__tree__traversals_1_1_node_html"><div class="ttname"><a href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a></div><div class="ttdoc">defines the structure of a node of the tree</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:58</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a></div><div class="ttdoc">defines the functions associated with the binary tree</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00067">iterative_tree_traversals.cpp:67</a></div></div>
+<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_a3078a5ccf45d6a7031dcf46e43de65b6"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">others::iterative_tree_traversals::BinaryTree::createNewNode</a></div><div class="ttdeci">Node * createNewNode(int64_t)</div><div class="ttdoc">function that will create new node for insertion.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00088">iterative_tree_traversals.cpp:88</a></div></div>
+<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00187">dsu_path_compression.cpp:187</a></div></div>
+<div class="ttc" id="adsu__path__compression_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-test implementations, 1st test.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00170">dsu_path_compression.cpp:170</a></div></div>
+<div class="ttc" id="ahamiltons__cycle_8cpp_html_a0cc94918b6831f308d4fe4fa27f08299"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a></div><div class="ttdeci">static void test3()</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d0c/hamiltons__cycle_8cpp_source.html#l00122">hamiltons_cycle.cpp:122</a></div></div>
+<div class="ttc" id="aiterative__tree__traversals_8cpp_html_a038b236fe900f7bb7e57164f5bed66c2"><div class="ttname"><a href="#a038b236fe900f7bb7e57164f5bed66c2">test4</a></div><div class="ttdeci">static void test4(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed preorder with the actual preorder on negative value.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00291">iterative_tree_traversals.cpp:291</a></div></div>
+<div class="ttc" id="aiterative__tree__traversals_8cpp_html_aa9ef334cd7eb607f4eb8732566ea00b8"><div class="ttname"><a href="#aa9ef334cd7eb607f4eb8732566ea00b8">test5</a></div><div class="ttdeci">static void test5(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed postorder with the actual postorder on negative value.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00319">iterative_tree_traversals.cpp:319</a></div></div>
+<div class="ttc" id="aiterative__tree__traversals_8cpp_html_af727f920064f2b8f484b589b60d49b89"><div class="ttname"><a href="#af727f920064f2b8f484b589b60d49b89">test6</a></div><div class="ttdeci">static void test6(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed inorder with the actual inorder on negative value.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00346">iterative_tree_traversals.cpp:346</a></div></div>
+<div class="ttc" id="astructothers_1_1iterative__tree__traversals_1_1_node_html"><div class="ttname"><a href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a></div><div class="ttdoc">defines the structure of a node of the tree</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00058">iterative_tree_traversals.cpp:58</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a21d922dbb5905993960c6a7f0ba71ac0" name="a21d922dbb5905993960c6a7f0ba71ac0"></a>
@@ -348,10 +364,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <p>&lt; result stores the preorder traversal of the binary tree</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00210">210</a> of file <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  211</span>                                                             {</div>
-<div class="line"><span class="lineno">  212</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> actual_result{1, 2, 4, 5, 3};</div>
-<div class="line"><span class="lineno">  213</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a></div>
-<div class="line"><span class="lineno">  214</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  <span class="comment">///&lt; result stores the preorder traversal of the binary tree</span></div>
+<div class="line"><span class="lineno">  212</span>    std::vector&lt;int64_t&gt; actual_result{1, 2, 4, 5, 3};</div>
+<div class="line"><span class="lineno">  213</span>    std::vector&lt;int64_t&gt;</div>
+<div class="line"><span class="lineno">  214</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  </div>
 <div class="line"><span class="lineno">  215</span> </div>
 <div class="line"><span class="lineno">  216</span>    <span class="comment">// Calling preOrderIterative() function by passing a root node,</span></div>
 <div class="line"><span class="lineno">  217</span>    <span class="comment">// and storing the preorder traversal in result.</span></div>
@@ -363,20 +381,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  223</span>    }</div>
 <div class="line"><span class="lineno">  224</span> </div>
 <div class="line"><span class="lineno">  225</span>    <span class="comment">// Printing the result storing preorder.</span></div>
-<div class="line"><span class="lineno">  226</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPreOrder Traversal Is : &quot;</span> &lt;&lt; <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">  226</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPreOrder Traversal Is : &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  227</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : result) {</div>
-<div class="line"><span class="lineno">  228</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><span class="lineno">  228</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
 <div class="line"><span class="lineno">  229</span>    }</div>
 <div class="line"><span class="lineno">  230</span>}</div>
-<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_ad4c6a8e67fb8267a65439b035666b5ae"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae">others::iterative_tree_traversals::BinaryTree::preOrderIterative</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; preOrderIterative(Node *)</div><div class="ttdoc">preOrderIterative() function that will perform the preorder traversal iteratively,...</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:102</div></div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.svg" width="576" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_ad4c6a8e67fb8267a65439b035666b5ae"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae">others::iterative_tree_traversals::BinaryTree::preOrderIterative</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; preOrderIterative(Node *)</div><div class="ttdoc">preOrderIterative() function that will perform the preorder traversal iteratively,...</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00102">iterative_tree_traversals.cpp:102</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac35ae2868441f8a11c965b87b2494f21" name="ac35ae2868441f8a11c965b87b2494f21"></a>
@@ -415,10 +427,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <p>&lt; result stores the postorder traversal of the binary tree.</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00237">237</a> of file <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  238</span>                                                             {</div>
-<div class="line"><span class="lineno">  239</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> actual_result{4, 5, 2, 3, 1};</div>
-<div class="line"><span class="lineno">  240</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a></div>
-<div class="line"><span class="lineno">  241</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  <span class="comment">///&lt; result stores the postorder traversal of the binary tree.</span></div>
+<div class="line"><span class="lineno">  239</span>    std::vector&lt;int64_t&gt; actual_result{4, 5, 2, 3, 1};</div>
+<div class="line"><span class="lineno">  240</span>    std::vector&lt;int64_t&gt;</div>
+<div class="line"><span class="lineno">  241</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  </div>
 <div class="line"><span class="lineno">  242</span> </div>
 <div class="line"><span class="lineno">  243</span>    <span class="comment">// Calling postOrderIterative() function by passing a root node,</span></div>
 <div class="line"><span class="lineno">  244</span>    <span class="comment">// and storing the postorder traversal in result.</span></div>
@@ -430,18 +444,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  250</span>    }</div>
 <div class="line"><span class="lineno">  251</span> </div>
 <div class="line"><span class="lineno">  252</span>    <span class="comment">// Printing the result storing postorder.</span></div>
-<div class="line"><span class="lineno">  253</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPostOrder Traversal Is : &quot;</span> &lt;&lt; <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">  253</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPostOrder Traversal Is : &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  254</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : result) {</div>
-<div class="line"><span class="lineno">  255</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><span class="lineno">  255</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
 <div class="line"><span class="lineno">  256</span>    }</div>
 <div class="line"><span class="lineno">  257</span>}</div>
-<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_a636a07c90b7f312bb86d2ec104efca25"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25">others::iterative_tree_traversals::BinaryTree::postOrderIterative</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; postOrderIterative(Node *)</div><div class="ttdoc">postOrderIterative() function that will perform the postorder traversal iteratively,...</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:132</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.svg" width="576" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_a636a07c90b7f312bb86d2ec104efca25"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25">others::iterative_tree_traversals::BinaryTree::postOrderIterative</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; postOrderIterative(Node *)</div><div class="ttdoc">postOrderIterative() function that will perform the postorder traversal iteratively,...</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00132">iterative_tree_traversals.cpp:132</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a425c4c8520991999ee6dbe13d99b87f4" name="a425c4c8520991999ee6dbe13d99b87f4"></a>
@@ -480,10 +489,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <p>&lt; result stores the inorder traversal of the binary tree.</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00264">264</a> of file <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  265</span>                                                             {</div>
-<div class="line"><span class="lineno">  266</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> actual_result{4, 2, 5, 1, 3};</div>
-<div class="line"><span class="lineno">  267</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a></div>
-<div class="line"><span class="lineno">  268</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  <span class="comment">///&lt; result stores the inorder traversal of the binary tree.</span></div>
+<div class="line"><span class="lineno">  266</span>    std::vector&lt;int64_t&gt; actual_result{4, 2, 5, 1, 3};</div>
+<div class="line"><span class="lineno">  267</span>    std::vector&lt;int64_t&gt;</div>
+<div class="line"><span class="lineno">  268</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  </div>
 <div class="line"><span class="lineno">  269</span> </div>
 <div class="line"><span class="lineno">  270</span>    <span class="comment">// Calling inOrderIterative() function by passing a root node,</span></div>
 <div class="line"><span class="lineno">  271</span>    <span class="comment">// and storing the inorder traversal in result.</span></div>
@@ -495,18 +506,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  277</span>    }</div>
 <div class="line"><span class="lineno">  278</span> </div>
 <div class="line"><span class="lineno">  279</span>    <span class="comment">// Printing the result storing inorder.</span></div>
-<div class="line"><span class="lineno">  280</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nInOrder Traversal Is : &quot;</span> &lt;&lt; <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">  280</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nInOrder Traversal Is : &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  281</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : result) {</div>
-<div class="line"><span class="lineno">  282</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><span class="lineno">  282</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
 <div class="line"><span class="lineno">  283</span>    }</div>
 <div class="line"><span class="lineno">  284</span>}</div>
-<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_a0c33f2c1a3a3deb486a1c33ee5239499"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499">others::iterative_tree_traversals::BinaryTree::inOrderIterative</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; inOrderIterative(Node *)</div><div class="ttdoc">inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul...</div><div class="ttdef"><b>Definition</b> iterative_tree_traversals.cpp:164</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.svg" width="576" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_a0c33f2c1a3a3deb486a1c33ee5239499"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499">others::iterative_tree_traversals::BinaryTree::inOrderIterative</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; inOrderIterative(Node *)</div><div class="ttdoc">inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul...</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00164">iterative_tree_traversals.cpp:164</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a038b236fe900f7bb7e57164f5bed66c2" name="a038b236fe900f7bb7e57164f5bed66c2"></a>
@@ -545,10 +551,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <p>&lt; result stores the preorder traversal of the binary tree</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00291">291</a> of file <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  292</span>                                                             {</div>
-<div class="line"><span class="lineno">  293</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> actual_result{-1, -2, -4, -5, -3};</div>
-<div class="line"><span class="lineno">  294</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a></div>
-<div class="line"><span class="lineno">  295</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  <span class="comment">///&lt; result stores the preorder traversal of the binary tree</span></div>
+<div class="line"><span class="lineno">  293</span>    std::vector&lt;int64_t&gt; actual_result{-1, -2, -4, -5, -3};</div>
+<div class="line"><span class="lineno">  294</span>    std::vector&lt;int64_t&gt;</div>
+<div class="line"><span class="lineno">  295</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  </div>
 <div class="line"><span class="lineno">  296</span> </div>
 <div class="line"><span class="lineno">  297</span>    <span class="comment">// Calling preOrderIterative() function by passing a root node,</span></div>
 <div class="line"><span class="lineno">  298</span>    <span class="comment">// and storing the preorder traversal in result.</span></div>
@@ -560,17 +568,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  304</span>    }</div>
 <div class="line"><span class="lineno">  305</span> </div>
 <div class="line"><span class="lineno">  306</span>    <span class="comment">// Printing the result storing preorder.</span></div>
-<div class="line"><span class="lineno">  307</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPreOrder Traversal Is : &quot;</span> &lt;&lt; <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">  307</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPreOrder Traversal Is : &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  308</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : result) {</div>
-<div class="line"><span class="lineno">  309</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><span class="lineno">  309</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
 <div class="line"><span class="lineno">  310</span>    }</div>
 <div class="line"><span class="lineno">  311</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.svg" width="576" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa9ef334cd7eb607f4eb8732566ea00b8" name="aa9ef334cd7eb607f4eb8732566ea00b8"></a>
@@ -609,10 +612,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <p>&lt; result stores the postorder traversal of the binary tree.</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00319">319</a> of file <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  320</span>                                                             {</div>
-<div class="line"><span class="lineno">  321</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> actual_result{-4, -5, -2, -3, -1};</div>
-<div class="line"><span class="lineno">  322</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a></div>
-<div class="line"><span class="lineno">  323</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  <span class="comment">///&lt; result stores the postorder traversal of the binary tree.</span></div>
+<div class="line"><span class="lineno">  321</span>    std::vector&lt;int64_t&gt; actual_result{-4, -5, -2, -3, -1};</div>
+<div class="line"><span class="lineno">  322</span>    std::vector&lt;int64_t&gt;</div>
+<div class="line"><span class="lineno">  323</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  </div>
 <div class="line"><span class="lineno">  324</span> </div>
 <div class="line"><span class="lineno">  325</span>    <span class="comment">// Calling postOrderIterative() function by passing a root node,</span></div>
 <div class="line"><span class="lineno">  326</span>    <span class="comment">// and storing the postorder traversal in result.</span></div>
@@ -624,17 +629,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  332</span>    }</div>
 <div class="line"><span class="lineno">  333</span> </div>
 <div class="line"><span class="lineno">  334</span>    <span class="comment">// Printing the result storing postorder.</span></div>
-<div class="line"><span class="lineno">  335</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPostOrder Traversal Is : &quot;</span> &lt;&lt; <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">  335</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPostOrder Traversal Is : &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  336</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : result) {</div>
-<div class="line"><span class="lineno">  337</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><span class="lineno">  337</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
 <div class="line"><span class="lineno">  338</span>    }</div>
 <div class="line"><span class="lineno">  339</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.svg" width="576" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af727f920064f2b8f484b589b60d49b89" name="af727f920064f2b8f484b589b60d49b89"></a>
@@ -673,10 +673,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <p>&lt; result stores the inorder traversal of the binary tree.</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00346">346</a> of file <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  347</span>                                                             {</div>
-<div class="line"><span class="lineno">  348</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> actual_result{-4, -2, -5, -1, -3};</div>
-<div class="line"><span class="lineno">  349</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a></div>
-<div class="line"><span class="lineno">  350</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  <span class="comment">///&lt; result stores the inorder traversal of the binary tree.</span></div>
+<div class="line"><span class="lineno">  348</span>    std::vector&lt;int64_t&gt; actual_result{-4, -2, -5, -1, -3};</div>
+<div class="line"><span class="lineno">  349</span>    std::vector&lt;int64_t&gt;</div>
+<div class="line"><span class="lineno">  350</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  </div>
 <div class="line"><span class="lineno">  351</span> </div>
 <div class="line"><span class="lineno">  352</span>    <span class="comment">// Calling inOrderIterative() function by passing a root node,</span></div>
 <div class="line"><span class="lineno">  353</span>    <span class="comment">// and storing the inorder traversal in result.</span></div>
@@ -688,17 +690,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  359</span>    }</div>
 <div class="line"><span class="lineno">  360</span> </div>
 <div class="line"><span class="lineno">  361</span>    <span class="comment">// Printing the result storing inorder.</span></div>
-<div class="line"><span class="lineno">  362</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nInOrder Traversal Is : &quot;</span> &lt;&lt; <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">  362</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nInOrder Traversal Is : &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  363</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : result) {</div>
-<div class="line"><span class="lineno">  364</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><span class="lineno">  364</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
 <div class="line"><span class="lineno">  365</span>    }</div>
 <div class="line"><span class="lineno">  366</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d90/iterative__tree__traversals_8cpp_af727f920064f2b8f484b589b60d49b89_cgraph.svg" width="576" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.map b/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.map
deleted file mode 100644
index 5620855f4..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="test4" name="test4">
-<area shape="rect" id="Node000001" title="Test the computed preorder with the actual preorder on negative value." alt="" coords="5,39,56,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="146,5,218,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,44,130,27,131,32,56,49"/>
-<area shape="rect" id="Node000003" href="$d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae" title="preOrderIterative() function that will perform the preorder traversal iteratively,..." alt="" coords="104,56,260,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,54,89,61,88,66,55,59"/>
-<area shape="rect" id="Node000004" href="$d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" title=" " alt="" coords="312,21,394,47"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="260,58,296,48,297,53,261,63"/>
-<area shape="rect" id="Node000005" href="$d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" title=" " alt="" coords="308,71,397,96"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="260,81,292,81,292,86,260,86"/>
-<area shape="rect" id="Node000007" href="$d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" title=" " alt="" coords="313,120,392,146"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="261,104,299,115,297,120,260,109"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="445,71,571,96"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="398,81,429,81,429,86,398,86"/>
-</map>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.md5 b/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.md5
deleted file mode 100644
index 6ac0e70d0..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a8a81ebb95550f2a1e93130bd20f07ee
\ No newline at end of file
diff --git a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.svg b/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.svg
deleted file mode 100644
index c0f5c08c3..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph.svg
+++ /dev/null
@@ -1,157 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test4 Pages: 1 -->
-<svg width="432pt" height="113pt"
- viewBox="0.00 0.00 432.00 113.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 109.25)">
-<title>test4</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test the computed preorder with the actual preorder on negative value.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-80.25 0,-80.25 0,-61 37.75,-61 37.75,-80.25"/>
-<text text-anchor="middle" x="18.88" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">test4</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.12,-105.25 105.62,-105.25 105.62,-86 159.12,-86 159.12,-105.25"/>
-<text text-anchor="middle" x="132.38" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-74.64C52.95,-78.04 75.18,-83.03 94.17,-87.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.19,-90.65 103.71,-89.42 94.72,-83.82 93.19,-90.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae" target="_top" xlink:title="preOrderIterative() function that will perform the preorder traversal iteratively,...">
-<polygon fill="white" stroke="#666666" points="191,-67.5 73.75,-67.5 73.75,-25.75 191,-25.75 191,-67.5"/>
-<text text-anchor="start" x="81.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="81.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="132.38" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::preOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-66.77C44.79,-65.26 53.3,-63.43 62.3,-61.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.94,-64.94 71.98,-59.41 61.47,-58.09 62.94,-64.94"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.38,-93.25 229.62,-93.25 229.62,-74 291.38,-74 291.38,-93.25"/>
-<text text-anchor="middle" x="260.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-63.61C200.37,-66.28 209.6,-68.99 218.23,-71.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.1,-74.84 227.68,-74.29 219.07,-68.12 217.1,-74.84"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-56.25 227,-56.25 227,-37 294,-37 294,-56.25"/>
-<text text-anchor="middle" x="260.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-46.62C199.35,-46.62 207.55,-46.62 215.33,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.22,-50.13 225.22,-46.63 215.22,-43.13 215.22,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.25,-19.25 230.75,-19.25 230.75,0 290.25,0 290.25,-19.25"/>
-<text text-anchor="middle" x="260.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-29.64C200.83,-26.84 210.55,-23.98 219.55,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.42,-24.74 229.03,-18.56 218.45,-18.02 220.42,-24.74"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424,-56.25 330,-56.25 330,-37 424,-37 424,-56.25"/>
-<text text-anchor="middle" x="377" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M294.31,-46.62C301.77,-46.62 309.9,-46.62 318.06,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.02,-50.13 328.02,-46.63 318.02,-43.13 318.02,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph_org.svg b/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph_org.svg
deleted file mode 100644
index fa5d9ed44..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_a038b236fe900f7bb7e57164f5bed66c2_cgraph_org.svg
+++ /dev/null
@@ -1,131 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test4 Pages: 1 -->
-<svg width="432pt" height="113pt"
- viewBox="0.00 0.00 432.00 113.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 109.25)">
-<title>test4</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test the computed preorder with the actual preorder on negative value.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-80.25 0,-80.25 0,-61 37.75,-61 37.75,-80.25"/>
-<text text-anchor="middle" x="18.88" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">test4</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.12,-105.25 105.62,-105.25 105.62,-86 159.12,-86 159.12,-105.25"/>
-<text text-anchor="middle" x="132.38" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-74.64C52.95,-78.04 75.18,-83.03 94.17,-87.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.19,-90.65 103.71,-89.42 94.72,-83.82 93.19,-90.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae" target="_top" xlink:title="preOrderIterative() function that will perform the preorder traversal iteratively,...">
-<polygon fill="white" stroke="#666666" points="191,-67.5 73.75,-67.5 73.75,-25.75 191,-25.75 191,-67.5"/>
-<text text-anchor="start" x="81.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="81.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="132.38" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::preOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-66.77C44.79,-65.26 53.3,-63.43 62.3,-61.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.94,-64.94 71.98,-59.41 61.47,-58.09 62.94,-64.94"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.38,-93.25 229.62,-93.25 229.62,-74 291.38,-74 291.38,-93.25"/>
-<text text-anchor="middle" x="260.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-63.61C200.37,-66.28 209.6,-68.99 218.23,-71.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.1,-74.84 227.68,-74.29 219.07,-68.12 217.1,-74.84"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-56.25 227,-56.25 227,-37 294,-37 294,-56.25"/>
-<text text-anchor="middle" x="260.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-46.62C199.35,-46.62 207.55,-46.62 215.33,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.22,-50.13 225.22,-46.63 215.22,-43.13 215.22,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.25,-19.25 230.75,-19.25 230.75,0 290.25,0 290.25,-19.25"/>
-<text text-anchor="middle" x="260.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-29.64C200.83,-26.84 210.55,-23.98 219.55,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.42,-24.74 229.03,-18.56 218.45,-18.02 220.42,-24.74"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424,-56.25 330,-56.25 330,-37 424,-37 424,-56.25"/>
-<text text-anchor="middle" x="377" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M294.31,-46.62C301.77,-46.62 309.9,-46.62 318.06,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.02,-50.13 328.02,-46.63 318.02,-43.13 318.02,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.map b/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.map
deleted file mode 100644
index b9663f437..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="test1" name="test1">
-<area shape="rect" id="Node000001" title="Test the computed preorder with the actual preorder." alt="" coords="5,39,56,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="146,5,218,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,44,130,27,131,32,56,49"/>
-<area shape="rect" id="Node000003" href="$d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae" title="preOrderIterative() function that will perform the preorder traversal iteratively,..." alt="" coords="104,56,260,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,54,89,61,88,66,55,59"/>
-<area shape="rect" id="Node000004" href="$d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" title=" " alt="" coords="312,21,394,47"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="260,58,296,48,297,53,261,63"/>
-<area shape="rect" id="Node000005" href="$d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" title=" " alt="" coords="308,71,397,96"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="260,81,292,81,292,86,260,86"/>
-<area shape="rect" id="Node000007" href="$d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" title=" " alt="" coords="313,120,392,146"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="261,104,299,115,297,120,260,109"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="445,71,571,96"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="398,81,429,81,429,86,398,86"/>
-</map>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.md5 b/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.md5
deleted file mode 100644
index 055ae0659..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d99a564cc3292b7e53c5f2c0b156d7e2
\ No newline at end of file
diff --git a/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.svg b/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.svg
deleted file mode 100644
index f337dfed1..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph.svg
+++ /dev/null
@@ -1,157 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="432pt" height="113pt"
- viewBox="0.00 0.00 432.00 113.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 109.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test the computed preorder with the actual preorder.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-80.25 0,-80.25 0,-61 37.75,-61 37.75,-80.25"/>
-<text text-anchor="middle" x="18.88" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.12,-105.25 105.62,-105.25 105.62,-86 159.12,-86 159.12,-105.25"/>
-<text text-anchor="middle" x="132.38" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-74.64C52.95,-78.04 75.18,-83.03 94.17,-87.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.19,-90.65 103.71,-89.42 94.72,-83.82 93.19,-90.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae" target="_top" xlink:title="preOrderIterative() function that will perform the preorder traversal iteratively,...">
-<polygon fill="white" stroke="#666666" points="191,-67.5 73.75,-67.5 73.75,-25.75 191,-25.75 191,-67.5"/>
-<text text-anchor="start" x="81.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="81.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="132.38" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::preOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-66.77C44.79,-65.26 53.3,-63.43 62.3,-61.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.94,-64.94 71.98,-59.41 61.47,-58.09 62.94,-64.94"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.38,-93.25 229.62,-93.25 229.62,-74 291.38,-74 291.38,-93.25"/>
-<text text-anchor="middle" x="260.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-63.61C200.37,-66.28 209.6,-68.99 218.23,-71.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.1,-74.84 227.68,-74.29 219.07,-68.12 217.1,-74.84"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-56.25 227,-56.25 227,-37 294,-37 294,-56.25"/>
-<text text-anchor="middle" x="260.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-46.62C199.35,-46.62 207.55,-46.62 215.33,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.22,-50.13 225.22,-46.63 215.22,-43.13 215.22,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.25,-19.25 230.75,-19.25 230.75,0 290.25,0 290.25,-19.25"/>
-<text text-anchor="middle" x="260.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-29.64C200.83,-26.84 210.55,-23.98 219.55,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.42,-24.74 229.03,-18.56 218.45,-18.02 220.42,-24.74"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424,-56.25 330,-56.25 330,-37 424,-37 424,-56.25"/>
-<text text-anchor="middle" x="377" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M294.31,-46.62C301.77,-46.62 309.9,-46.62 318.06,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.02,-50.13 328.02,-46.63 318.02,-43.13 318.02,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph_org.svg b/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph_org.svg
deleted file mode 100644
index c349fdc43..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_a21d922dbb5905993960c6a7f0ba71ac0_cgraph_org.svg
+++ /dev/null
@@ -1,131 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="432pt" height="113pt"
- viewBox="0.00 0.00 432.00 113.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 109.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test the computed preorder with the actual preorder.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-80.25 0,-80.25 0,-61 37.75,-61 37.75,-80.25"/>
-<text text-anchor="middle" x="18.88" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.12,-105.25 105.62,-105.25 105.62,-86 159.12,-86 159.12,-105.25"/>
-<text text-anchor="middle" x="132.38" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-74.64C52.95,-78.04 75.18,-83.03 94.17,-87.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.19,-90.65 103.71,-89.42 94.72,-83.82 93.19,-90.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae" target="_top" xlink:title="preOrderIterative() function that will perform the preorder traversal iteratively,...">
-<polygon fill="white" stroke="#666666" points="191,-67.5 73.75,-67.5 73.75,-25.75 191,-25.75 191,-67.5"/>
-<text text-anchor="start" x="81.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="81.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="132.38" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::preOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-66.77C44.79,-65.26 53.3,-63.43 62.3,-61.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.94,-64.94 71.98,-59.41 61.47,-58.09 62.94,-64.94"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.38,-93.25 229.62,-93.25 229.62,-74 291.38,-74 291.38,-93.25"/>
-<text text-anchor="middle" x="260.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-63.61C200.37,-66.28 209.6,-68.99 218.23,-71.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.1,-74.84 227.68,-74.29 219.07,-68.12 217.1,-74.84"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-56.25 227,-56.25 227,-37 294,-37 294,-56.25"/>
-<text text-anchor="middle" x="260.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-46.62C199.35,-46.62 207.55,-46.62 215.33,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.22,-50.13 225.22,-46.63 215.22,-43.13 215.22,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.25,-19.25 230.75,-19.25 230.75,0 290.25,0 290.25,-19.25"/>
-<text text-anchor="middle" x="260.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-29.64C200.83,-26.84 210.55,-23.98 219.55,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.42,-24.74 229.03,-18.56 218.45,-18.02 220.42,-24.74"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424,-56.25 330,-56.25 330,-37 424,-37 424,-56.25"/>
-<text text-anchor="middle" x="377" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M294.31,-46.62C301.77,-46.62 309.9,-46.62 318.06,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.02,-50.13 328.02,-46.63 318.02,-43.13 318.02,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.map b/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.map
deleted file mode 100644
index 1c585864b..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="test3" name="test3">
-<area shape="rect" id="Node000001" title="Test the computed inorder with the actual inorder." alt="" coords="5,39,56,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="146,5,218,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,44,130,27,131,32,56,49"/>
-<area shape="rect" id="Node000003" href="$d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499" title="inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul..." alt="" coords="104,56,260,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,54,89,61,88,66,55,59"/>
-<area shape="rect" id="Node000004" href="$d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" title=" " alt="" coords="312,21,394,47"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="260,58,296,48,297,53,261,63"/>
-<area shape="rect" id="Node000005" href="$d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" title=" " alt="" coords="308,71,397,96"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="260,81,292,81,292,86,260,86"/>
-<area shape="rect" id="Node000007" href="$d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" title=" " alt="" coords="313,120,392,146"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="261,104,299,115,297,120,260,109"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="445,71,571,96"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="398,81,429,81,429,86,398,86"/>
-</map>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.md5 b/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.md5
deleted file mode 100644
index 4f8966162..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2eb41ed9bedf8c0c34068490d0340dc4
\ No newline at end of file
diff --git a/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.svg b/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.svg
deleted file mode 100644
index 838d608df..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph.svg
+++ /dev/null
@@ -1,157 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<svg width="432pt" height="113pt"
- viewBox="0.00 0.00 432.00 113.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 109.25)">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test the computed inorder with the actual inorder.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-80.25 0,-80.25 0,-61 37.75,-61 37.75,-80.25"/>
-<text text-anchor="middle" x="18.88" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.12,-105.25 105.62,-105.25 105.62,-86 159.12,-86 159.12,-105.25"/>
-<text text-anchor="middle" x="132.38" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-74.64C52.95,-78.04 75.18,-83.03 94.17,-87.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.19,-90.65 103.71,-89.42 94.72,-83.82 93.19,-90.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499" target="_top" xlink:title="inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul...">
-<polygon fill="white" stroke="#666666" points="191,-67.5 73.75,-67.5 73.75,-25.75 191,-25.75 191,-67.5"/>
-<text text-anchor="start" x="81.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="81.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="132.38" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-66.77C44.79,-65.26 53.3,-63.43 62.3,-61.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.94,-64.94 71.98,-59.41 61.47,-58.09 62.94,-64.94"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.38,-93.25 229.62,-93.25 229.62,-74 291.38,-74 291.38,-93.25"/>
-<text text-anchor="middle" x="260.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-63.61C200.37,-66.28 209.6,-68.99 218.23,-71.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.1,-74.84 227.68,-74.29 219.07,-68.12 217.1,-74.84"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-56.25 227,-56.25 227,-37 294,-37 294,-56.25"/>
-<text text-anchor="middle" x="260.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-46.62C199.35,-46.62 207.55,-46.62 215.33,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.22,-50.13 225.22,-46.63 215.22,-43.13 215.22,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.25,-19.25 230.75,-19.25 230.75,0 290.25,0 290.25,-19.25"/>
-<text text-anchor="middle" x="260.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-29.64C200.83,-26.84 210.55,-23.98 219.55,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.42,-24.74 229.03,-18.56 218.45,-18.02 220.42,-24.74"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424,-56.25 330,-56.25 330,-37 424,-37 424,-56.25"/>
-<text text-anchor="middle" x="377" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M294.31,-46.62C301.77,-46.62 309.9,-46.62 318.06,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.02,-50.13 328.02,-46.63 318.02,-43.13 318.02,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph_org.svg b/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph_org.svg
deleted file mode 100644
index b9a8d7d32..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_a425c4c8520991999ee6dbe13d99b87f4_cgraph_org.svg
+++ /dev/null
@@ -1,131 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<svg width="432pt" height="113pt"
- viewBox="0.00 0.00 432.00 113.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 109.25)">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test the computed inorder with the actual inorder.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-80.25 0,-80.25 0,-61 37.75,-61 37.75,-80.25"/>
-<text text-anchor="middle" x="18.88" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.12,-105.25 105.62,-105.25 105.62,-86 159.12,-86 159.12,-105.25"/>
-<text text-anchor="middle" x="132.38" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-74.64C52.95,-78.04 75.18,-83.03 94.17,-87.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.19,-90.65 103.71,-89.42 94.72,-83.82 93.19,-90.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499" target="_top" xlink:title="inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul...">
-<polygon fill="white" stroke="#666666" points="191,-67.5 73.75,-67.5 73.75,-25.75 191,-25.75 191,-67.5"/>
-<text text-anchor="start" x="81.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="81.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="132.38" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-66.77C44.79,-65.26 53.3,-63.43 62.3,-61.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.94,-64.94 71.98,-59.41 61.47,-58.09 62.94,-64.94"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.38,-93.25 229.62,-93.25 229.62,-74 291.38,-74 291.38,-93.25"/>
-<text text-anchor="middle" x="260.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-63.61C200.37,-66.28 209.6,-68.99 218.23,-71.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.1,-74.84 227.68,-74.29 219.07,-68.12 217.1,-74.84"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-56.25 227,-56.25 227,-37 294,-37 294,-56.25"/>
-<text text-anchor="middle" x="260.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-46.62C199.35,-46.62 207.55,-46.62 215.33,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.22,-50.13 225.22,-46.63 215.22,-43.13 215.22,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.25,-19.25 230.75,-19.25 230.75,0 290.25,0 290.25,-19.25"/>
-<text text-anchor="middle" x="260.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-29.64C200.83,-26.84 210.55,-23.98 219.55,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.42,-24.74 229.03,-18.56 218.45,-18.02 220.42,-24.74"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424,-56.25 330,-56.25 330,-37 424,-37 424,-56.25"/>
-<text text-anchor="middle" x="377" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M294.31,-46.62C301.77,-46.62 309.9,-46.62 318.06,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.02,-50.13 328.02,-46.63 318.02,-43.13 318.02,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.map b/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.map
deleted file mode 100644
index 4aea3e424..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="test5" name="test5">
-<area shape="rect" id="Node000001" title="Test the computed postorder with the actual postorder on negative value." alt="" coords="5,39,56,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="146,5,218,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,44,130,27,131,32,56,49"/>
-<area shape="rect" id="Node000003" href="$d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25" title="postOrderIterative() function that will perform the postorder traversal iteratively,..." alt="" coords="104,56,260,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,54,89,61,88,66,55,59"/>
-<area shape="rect" id="Node000004" href="$d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" title=" " alt="" coords="312,21,394,47"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="260,58,296,48,297,53,261,63"/>
-<area shape="rect" id="Node000005" href="$d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" title=" " alt="" coords="308,71,397,96"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="260,81,292,81,292,86,260,86"/>
-<area shape="rect" id="Node000007" href="$d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" title=" " alt="" coords="313,120,392,146"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="261,104,299,115,297,120,260,109"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="445,71,571,96"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="398,81,429,81,429,86,398,86"/>
-</map>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.md5 b/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.md5
deleted file mode 100644
index 85eb317e0..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-394b6d2eb9556fd233e71b9ef4731562
\ No newline at end of file
diff --git a/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.svg b/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.svg
deleted file mode 100644
index 6bd6f4ef2..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph.svg
+++ /dev/null
@@ -1,157 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test5 Pages: 1 -->
-<svg width="432pt" height="113pt"
- viewBox="0.00 0.00 432.00 113.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 109.25)">
-<title>test5</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test the computed postorder with the actual postorder on negative value.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-80.25 0,-80.25 0,-61 37.75,-61 37.75,-80.25"/>
-<text text-anchor="middle" x="18.88" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">test5</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.12,-105.25 105.62,-105.25 105.62,-86 159.12,-86 159.12,-105.25"/>
-<text text-anchor="middle" x="132.38" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-74.64C52.95,-78.04 75.18,-83.03 94.17,-87.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.19,-90.65 103.71,-89.42 94.72,-83.82 93.19,-90.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25" target="_top" xlink:title="postOrderIterative() function that will perform the postorder traversal iteratively,...">
-<polygon fill="white" stroke="#666666" points="191,-67.5 73.75,-67.5 73.75,-25.75 191,-25.75 191,-67.5"/>
-<text text-anchor="start" x="81.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="81.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="132.38" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::postOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-66.77C44.79,-65.26 53.3,-63.43 62.3,-61.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.94,-64.94 71.98,-59.41 61.47,-58.09 62.94,-64.94"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.38,-93.25 229.62,-93.25 229.62,-74 291.38,-74 291.38,-93.25"/>
-<text text-anchor="middle" x="260.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-63.61C200.37,-66.28 209.6,-68.99 218.23,-71.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.1,-74.84 227.68,-74.29 219.07,-68.12 217.1,-74.84"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-56.25 227,-56.25 227,-37 294,-37 294,-56.25"/>
-<text text-anchor="middle" x="260.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-46.62C199.35,-46.62 207.55,-46.62 215.33,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.22,-50.13 225.22,-46.63 215.22,-43.13 215.22,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.25,-19.25 230.75,-19.25 230.75,0 290.25,0 290.25,-19.25"/>
-<text text-anchor="middle" x="260.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-29.64C200.83,-26.84 210.55,-23.98 219.55,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.42,-24.74 229.03,-18.56 218.45,-18.02 220.42,-24.74"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424,-56.25 330,-56.25 330,-37 424,-37 424,-56.25"/>
-<text text-anchor="middle" x="377" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M294.31,-46.62C301.77,-46.62 309.9,-46.62 318.06,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.02,-50.13 328.02,-46.63 318.02,-43.13 318.02,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph_org.svg b/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph_org.svg
deleted file mode 100644
index e63425be2..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_aa9ef334cd7eb607f4eb8732566ea00b8_cgraph_org.svg
+++ /dev/null
@@ -1,131 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test5 Pages: 1 -->
-<svg width="432pt" height="113pt"
- viewBox="0.00 0.00 432.00 113.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 109.25)">
-<title>test5</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test the computed postorder with the actual postorder on negative value.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-80.25 0,-80.25 0,-61 37.75,-61 37.75,-80.25"/>
-<text text-anchor="middle" x="18.88" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">test5</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.12,-105.25 105.62,-105.25 105.62,-86 159.12,-86 159.12,-105.25"/>
-<text text-anchor="middle" x="132.38" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-74.64C52.95,-78.04 75.18,-83.03 94.17,-87.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.19,-90.65 103.71,-89.42 94.72,-83.82 93.19,-90.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25" target="_top" xlink:title="postOrderIterative() function that will perform the postorder traversal iteratively,...">
-<polygon fill="white" stroke="#666666" points="191,-67.5 73.75,-67.5 73.75,-25.75 191,-25.75 191,-67.5"/>
-<text text-anchor="start" x="81.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="81.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="132.38" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::postOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-66.77C44.79,-65.26 53.3,-63.43 62.3,-61.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.94,-64.94 71.98,-59.41 61.47,-58.09 62.94,-64.94"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.38,-93.25 229.62,-93.25 229.62,-74 291.38,-74 291.38,-93.25"/>
-<text text-anchor="middle" x="260.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-63.61C200.37,-66.28 209.6,-68.99 218.23,-71.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.1,-74.84 227.68,-74.29 219.07,-68.12 217.1,-74.84"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-56.25 227,-56.25 227,-37 294,-37 294,-56.25"/>
-<text text-anchor="middle" x="260.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-46.62C199.35,-46.62 207.55,-46.62 215.33,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.22,-50.13 225.22,-46.63 215.22,-43.13 215.22,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.25,-19.25 230.75,-19.25 230.75,0 290.25,0 290.25,-19.25"/>
-<text text-anchor="middle" x="260.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-29.64C200.83,-26.84 210.55,-23.98 219.55,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.42,-24.74 229.03,-18.56 218.45,-18.02 220.42,-24.74"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424,-56.25 330,-56.25 330,-37 424,-37 424,-56.25"/>
-<text text-anchor="middle" x="377" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M294.31,-46.62C301.77,-46.62 309.9,-46.62 318.06,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.02,-50.13 328.02,-46.63 318.02,-43.13 318.02,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.map b/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.map
deleted file mode 100644
index 9befedd4b..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="test2" name="test2">
-<area shape="rect" id="Node000001" title="Test the computed postorder with the actual postorder." alt="" coords="5,39,56,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="146,5,218,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,44,130,27,131,32,56,49"/>
-<area shape="rect" id="Node000003" href="$d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25" title="postOrderIterative() function that will perform the postorder traversal iteratively,..." alt="" coords="104,56,260,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,54,89,61,88,66,55,59"/>
-<area shape="rect" id="Node000004" href="$d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" title=" " alt="" coords="312,21,394,47"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="260,58,296,48,297,53,261,63"/>
-<area shape="rect" id="Node000005" href="$d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" title=" " alt="" coords="308,71,397,96"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="260,81,292,81,292,86,260,86"/>
-<area shape="rect" id="Node000007" href="$d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" title=" " alt="" coords="313,120,392,146"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="261,104,299,115,297,120,260,109"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="445,71,571,96"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="398,81,429,81,429,86,398,86"/>
-</map>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.md5 b/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.md5
deleted file mode 100644
index d47c4e7b1..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a7759c802dfaef4213808b12dd53c9ba
\ No newline at end of file
diff --git a/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.svg b/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.svg
deleted file mode 100644
index 5b8180a38..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph.svg
+++ /dev/null
@@ -1,157 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="432pt" height="113pt"
- viewBox="0.00 0.00 432.00 113.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 109.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test the computed postorder with the actual postorder.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-80.25 0,-80.25 0,-61 37.75,-61 37.75,-80.25"/>
-<text text-anchor="middle" x="18.88" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.12,-105.25 105.62,-105.25 105.62,-86 159.12,-86 159.12,-105.25"/>
-<text text-anchor="middle" x="132.38" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-74.64C52.95,-78.04 75.18,-83.03 94.17,-87.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.19,-90.65 103.71,-89.42 94.72,-83.82 93.19,-90.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25" target="_top" xlink:title="postOrderIterative() function that will perform the postorder traversal iteratively,...">
-<polygon fill="white" stroke="#666666" points="191,-67.5 73.75,-67.5 73.75,-25.75 191,-25.75 191,-67.5"/>
-<text text-anchor="start" x="81.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="81.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="132.38" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::postOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-66.77C44.79,-65.26 53.3,-63.43 62.3,-61.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.94,-64.94 71.98,-59.41 61.47,-58.09 62.94,-64.94"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.38,-93.25 229.62,-93.25 229.62,-74 291.38,-74 291.38,-93.25"/>
-<text text-anchor="middle" x="260.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-63.61C200.37,-66.28 209.6,-68.99 218.23,-71.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.1,-74.84 227.68,-74.29 219.07,-68.12 217.1,-74.84"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-56.25 227,-56.25 227,-37 294,-37 294,-56.25"/>
-<text text-anchor="middle" x="260.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-46.62C199.35,-46.62 207.55,-46.62 215.33,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.22,-50.13 225.22,-46.63 215.22,-43.13 215.22,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.25,-19.25 230.75,-19.25 230.75,0 290.25,0 290.25,-19.25"/>
-<text text-anchor="middle" x="260.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-29.64C200.83,-26.84 210.55,-23.98 219.55,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.42,-24.74 229.03,-18.56 218.45,-18.02 220.42,-24.74"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424,-56.25 330,-56.25 330,-37 424,-37 424,-56.25"/>
-<text text-anchor="middle" x="377" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M294.31,-46.62C301.77,-46.62 309.9,-46.62 318.06,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.02,-50.13 328.02,-46.63 318.02,-43.13 318.02,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph_org.svg b/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph_org.svg
deleted file mode 100644
index a5c6209fc..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_ac35ae2868441f8a11c965b87b2494f21_cgraph_org.svg
+++ /dev/null
@@ -1,131 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="432pt" height="113pt"
- viewBox="0.00 0.00 432.00 113.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 109.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test the computed postorder with the actual postorder.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-80.25 0,-80.25 0,-61 37.75,-61 37.75,-80.25"/>
-<text text-anchor="middle" x="18.88" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.12,-105.25 105.62,-105.25 105.62,-86 159.12,-86 159.12,-105.25"/>
-<text text-anchor="middle" x="132.38" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-74.64C52.95,-78.04 75.18,-83.03 94.17,-87.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.19,-90.65 103.71,-89.42 94.72,-83.82 93.19,-90.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25" target="_top" xlink:title="postOrderIterative() function that will perform the postorder traversal iteratively,...">
-<polygon fill="white" stroke="#666666" points="191,-67.5 73.75,-67.5 73.75,-25.75 191,-25.75 191,-67.5"/>
-<text text-anchor="start" x="81.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="81.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="132.38" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::postOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-66.77C44.79,-65.26 53.3,-63.43 62.3,-61.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.94,-64.94 71.98,-59.41 61.47,-58.09 62.94,-64.94"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.38,-93.25 229.62,-93.25 229.62,-74 291.38,-74 291.38,-93.25"/>
-<text text-anchor="middle" x="260.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-63.61C200.37,-66.28 209.6,-68.99 218.23,-71.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.1,-74.84 227.68,-74.29 219.07,-68.12 217.1,-74.84"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-56.25 227,-56.25 227,-37 294,-37 294,-56.25"/>
-<text text-anchor="middle" x="260.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-46.62C199.35,-46.62 207.55,-46.62 215.33,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.22,-50.13 225.22,-46.63 215.22,-43.13 215.22,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.25,-19.25 230.75,-19.25 230.75,0 290.25,0 290.25,-19.25"/>
-<text text-anchor="middle" x="260.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-29.64C200.83,-26.84 210.55,-23.98 219.55,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.42,-24.74 229.03,-18.56 218.45,-18.02 220.42,-24.74"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424,-56.25 330,-56.25 330,-37 424,-37 424,-56.25"/>
-<text text-anchor="middle" x="377" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M294.31,-46.62C301.77,-46.62 309.9,-46.62 318.06,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.02,-50.13 328.02,-46.63 318.02,-43.13 318.02,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 6968e8106..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,77 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,212,55,238"/>
-<area shape="rect" id="Node000002" href="$d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6" title="function that will create new node for insertion." alt="" coords="103,5,259,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="32,211,54,146,74,107,101,71,103,69,107,73,105,75,78,110,59,148,37,213"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="350,106,421,131"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="44,210,70,190,102,172,162,151,225,135,334,119,334,125,226,141,164,156,104,177,73,195,48,214"/>
-<area shape="rect" id="Node000004" href="$d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" title="Self&#45;test implementations, 1st test." alt="" coords="156,442,206,467"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="42,237,165,427,160,430,38,240"/>
-<area shape="rect" id="Node000015" href="$d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" title="Self&#45;implementations, 2nd test." alt="" coords="156,491,206,517"/>
-<area shape="poly" id="edge19_Node000001_Node000015" title=" " alt="" coords="34,238,35,284,44,348,52,383,65,417,82,450,105,478,121,490,141,497,140,502,119,495,101,482,78,452,60,419,47,384,38,349,30,284,28,238"/>
-<area shape="rect" id="Node000016" href="$dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299" title=" " alt="" coords="156,294,206,319"/>
-<area shape="poly" id="edge22_Node000001_Node000016" title=" " alt="" coords="50,236,104,272,142,290,140,295,101,277,47,241"/>
-<area shape="rect" id="Node000020" href="$d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2" title="Test the computed preorder with the actual preorder on negative value." alt="" coords="156,236,206,262"/>
-<area shape="poly" id="edge28_Node000001_Node000020" title=" " alt="" coords="56,226,141,240,140,245,55,232"/>
-<area shape="rect" id="Node000026" href="$d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8" title="Test the computed postorder with the actual postorder on negative value." alt="" coords="156,86,206,111"/>
-<area shape="poly" id="edge35_Node000001_Node000026" title=" " alt="" coords="36,210,61,171,80,148,101,128,140,108,142,112,104,133,84,152,66,174,41,213"/>
-<area shape="rect" id="Node000028" href="$d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89" title="Test the computed inorder with the actual inorder on negative value." alt="" coords="156,187,206,213"/>
-<area shape="poly" id="edge41_Node000001_Node000028" title=" " alt="" coords="55,218,140,204,141,209,56,224"/>
-<area shape="rect" id="Node000005" href="$dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" title="prints the minimum, maximum and size of the set to which i belongs to" alt="" coords="351,618,419,643"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="207,456,234,463,260,476,296,506,327,540,371,603,367,606,323,543,292,509,258,481,232,468,206,461"/>
-<area shape="rect" id="Node000010" href="$dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="333,467,437,493"/>
-<area shape="poly" id="edge12_Node000004_Node000010" title=" " alt="" coords="207,455,318,469,318,474,206,460"/>
-<area shape="rect" id="Node000006" href="$dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" title="A utility function that returns the max element of the set to which i belongs to." alt="" coords="538,716,639,742"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="407,642,454,672,512,703,525,708,523,713,510,708,451,676,404,646"/>
-<area shape="rect" id="Node000008" href="$dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" title="A utility function that returns the min element of the set to which i belongs to." alt="" coords="540,618,637,643"/>
-<area shape="poly" id="edge8_Node000005_Node000008" title=" " alt="" coords="420,628,525,628,525,633,420,633"/>
-<area shape="rect" id="Node000009" href="$dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" title="A utility function that returns the size of the set to which i belongs to." alt="" coords="551,667,626,693"/>
-<area shape="poly" id="edge10_Node000005_Node000009" title=" " alt="" coords="420,636,537,665,535,670,419,641"/>
-<area shape="rect" id="Node000007" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="731,618,822,643"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="638,713,664,703,708,678,745,651,748,655,711,682,667,708,640,718"/>
-<area shape="poly" id="edge7_Node000007_Node000007" title=" " alt="" coords="745,619,739,609,742,599,755,593,776,591,799,594,811,600,808,605,797,599,776,596,757,598,746,603,744,608,749,616"/>
-<area shape="poly" id="edge9_Node000008_Node000007" title=" " alt="" coords="637,628,715,628,715,633,637,633"/>
-<area shape="poly" id="edge11_Node000009_Node000007" title=" " alt="" coords="625,668,715,644,716,649,627,673"/>
-<area shape="poly" id="edge13_Node000010_Node000007" title=" " alt="" coords="407,491,454,521,512,552,603,582,716,613,715,618,602,587,510,557,451,526,404,495"/>
-<area shape="rect" id="Node000011" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="541,516,636,542"/>
-<area shape="poly" id="edge14_Node000010_Node000011" title=" " alt="" coords="438,490,527,512,526,517,437,495"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="740,342,812,367"/>
-<area shape="poly" id="edge16_Node000010_Node000012" title=" " alt="" coords="403,464,450,433,510,403,566,385,624,371,724,356,725,362,625,377,568,390,512,408,452,438,406,469"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="554,418,623,443"/>
-<area shape="poly" id="edge17_Node000010_Node000013" title=" " alt="" coords="437,465,538,440,540,445,438,470"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="549,467,628,493"/>
-<area shape="poly" id="edge18_Node000010_Node000014" title=" " alt="" coords="438,477,534,477,534,482,438,482"/>
-<area shape="poly" id="edge15_Node000011_Node000007" title=" " alt="" coords="626,540,667,559,745,607,743,611,664,564,624,545"/>
-<area shape="poly" id="edge20_Node000015_Node000005" title=" " alt="" coords="205,515,352,607,349,612,202,519"/>
-<area shape="poly" id="edge21_Node000015_Node000010" title=" " alt="" coords="206,498,318,485,318,490,207,504"/>
-<area shape="rect" id="Node000017" href="$dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" title=" " alt="" coords="331,316,439,342"/>
-<area shape="poly" id="edge23_Node000016_Node000017" title=" " alt="" coords="207,307,316,319,315,324,206,312"/>
-<area shape="rect" id="Node000018" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="560,316,617,342"/>
-<area shape="poly" id="edge24_Node000017_Node000018" title=" " alt="" coords="440,326,545,326,545,332,440,332"/>
-<area shape="rect" id="Node000019" 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="511,243,666,269"/>
-<area shape="poly" id="edge27_Node000017_Node000019" title=" " alt="" coords="430,313,462,301,510,277,525,272,527,277,512,282,464,306,432,318"/>
-<area shape="poly" id="edge26_Node000018_Node000012" title=" " alt="" coords="618,330,725,345,724,350,617,336"/>
-<area shape="poly" id="edge25_Node000018_Node000018" title=" " alt="" coords="558,318,551,308,554,298,567,292,589,290,613,293,624,301,621,305,611,298,588,295,568,297,558,302,556,308,562,315"/>
-<area shape="poly" id="edge29_Node000020_Node000003" title=" " alt="" coords="206,244,232,237,257,223,273,204,281,184,288,163,305,142,334,126,336,131,309,146,293,165,286,185,278,206,261,227,234,242,207,249"/>
-<area shape="rect" id="Node000021" href="$d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae" title="preOrderIterative() function that will perform the preorder traversal iteratively,..." alt="" coords="307,236,463,292"/>
-<area shape="poly" id="edge30_Node000020_Node000021" title=" " alt="" coords="207,248,291,254,291,260,206,254"/>
-<area shape="rect" id="Node000022" href="$d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" title=" " alt="" coords="547,95,630,121"/>
-<area shape="poly" id="edge31_Node000021_Node000022" title=" " alt="" coords="448,233,461,222,477,199,484,176,491,153,510,130,531,117,534,122,513,134,496,155,489,178,482,201,465,226,451,238"/>
-<area shape="rect" id="Node000023" href="$d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" title=" " alt="" coords="544,144,633,170"/>
-<area shape="poly" id="edge32_Node000021_Node000023" title=" " alt="" coords="443,233,462,222,485,200,510,179,528,170,530,175,513,183,489,204,465,226,446,238"/>
-<area shape="rect" id="Node000025" href="$d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" title=" " alt="" coords="549,194,628,219"/>
-<area shape="poly" id="edge34_Node000021_Node000025" title=" " alt="" coords="463,239,533,219,535,224,464,244"/>
-<area shape="rect" id="Node000024" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="714,144,839,170"/>
-<area shape="poly" id="edge33_Node000023_Node000024" title=" " alt="" coords="634,154,698,154,698,160,634,160"/>
-<area shape="poly" id="edge36_Node000026_Node000003" title=" " alt="" coords="207,98,334,111,333,116,206,104"/>
-<area shape="rect" id="Node000027" href="$d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25" title="postOrderIterative() function that will perform the postorder traversal iteratively,..." alt="" coords="307,25,463,81"/>
-<area shape="poly" id="edge37_Node000026_Node000027" title=" " alt="" coords="206,90,291,71,292,77,207,96"/>
-<area shape="poly" id="edge38_Node000027_Node000022" title=" " alt="" coords="464,72,533,90,532,95,463,77"/>
-<area shape="poly" id="edge39_Node000027_Node000023" title=" " alt="" coords="446,79,465,91,489,112,513,131,530,139,528,144,510,135,485,116,462,95,443,84"/>
-<area shape="poly" id="edge40_Node000027_Node000025" title=" " alt="" coords="451,79,465,91,482,115,489,138,496,160,513,180,536,193,533,198,510,185,491,162,484,140,477,118,461,95,447,84"/>
-<area shape="poly" id="edge42_Node000028_Node000003" title=" " alt="" coords="206,188,258,165,306,141,334,131,336,136,308,146,260,170,208,193"/>
-<area shape="rect" id="Node000029" href="$d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499" title="inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul..." alt="" coords="307,156,463,212"/>
-<area shape="poly" id="edge43_Node000028_Node000029" title=" " alt="" coords="206,195,291,189,291,194,207,201"/>
-<area shape="poly" id="edge44_Node000029_Node000022" title=" " alt="" coords="451,153,510,129,532,122,533,127,512,134,452,158"/>
-<area shape="poly" id="edge45_Node000029_Node000023" title=" " alt="" coords="463,171,528,162,529,168,464,176"/>
-<area shape="poly" id="edge46_Node000029_Node000025" title=" " alt="" coords="464,190,534,198,533,203,463,195"/>
-</map>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index f97e533ff..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8c695ee588fa1b28c9887be084a8a9cf
\ No newline at end of file
diff --git a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index b59d580bf..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,778 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 561 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 633;
-var viewHeight = 561;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-397.25 0,-397.25 0,-378 37,-378 37,-397.25"/>
-<text text-anchor="middle" x="18.5" y="-383.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6" target="_top" xlink:title="function that will create new node for insertion.">
-<polygon fill="white" stroke="#666666" points="190.25,-552.5 73,-552.5 73,-510.75 190.25,-510.75 190.25,-552.5"/>
-<text text-anchor="start" x="81" y="-539" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="81" y="-527.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="131.62" y="-516.5" font-family="Helvetica,sans-Serif" font-size="10.00">::createNewNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.88,-397.72C27.41,-419.28 43.03,-470.39 73,-501.62 73.48,-502.12 73.96,-502.61 74.46,-503.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.08,-505.67 82.01,-509.37 76.56,-500.29 72.08,-505.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="311.62,-477.25 258.12,-477.25 258.12,-458 311.62,-458 311.62,-477.25"/>
-<text text-anchor="middle" x="284.88" y="-463.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.54,-397.61C40.8,-406.34 56.89,-418.68 73,-425.62 130.5,-450.42 203.17,-460.75 246.46,-464.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.07,-468.41 256.34,-465.82 246.7,-461.44 246.07,-468.41"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title="Self&#45;test implementations, 1st test.">
-<polygon fill="white" stroke="#666666" points="150.5,-225.25 112.75,-225.25 112.75,-206 150.5,-206 150.5,-225.25"/>
-<text text-anchor="middle" x="131.62" y="-211.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.95,-377.63C43.83,-349.97 94.22,-271.97 117.96,-235.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.84,-237.21 123.33,-226.91 114.96,-233.41 120.84,-237.21"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title="Self&#45;implementations, 2nd test.">
-<polygon fill="white" stroke="#666666" points="150.5,-188.25 112.75,-188.25 112.75,-169 150.5,-169 150.5,-188.25"/>
-<text text-anchor="middle" x="131.62" y="-174.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node15 -->
-<g id="edge19_Node000001_Node000015" class="edge">
-<title>Node1&#45;&gt;Node15</title>
-<g id="a_edge19_Node000001_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M19.2,-377.72C18.8,-346.53 21.91,-249.25 73,-196.62 80.48,-188.92 91.2,-184.5 101.37,-181.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.78,-185.46 110.93,-180.13 100.45,-178.58 101.78,-185.46"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.5,-336.25 112.75,-336.25 112.75,-317 150.5,-317 150.5,-336.25"/>
-<text text-anchor="middle" x="131.62" y="-322.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge22_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge22_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.2,-377.7C42.74,-369.75 58.33,-358.64 73,-350.62 82.09,-345.66 92.43,-341.06 101.81,-337.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.82,-340.6 110.85,-333.69 100.26,-334.08 102.82,-340.6"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2" target="_top" xlink:title="Test the computed preorder with the actual preorder on negative value.">
-<polygon fill="white" stroke="#666666" points="150.5,-379.25 112.75,-379.25 112.75,-360 150.5,-360 150.5,-379.25"/>
-<text text-anchor="middle" x="131.62" y="-365.75" font-family="Helvetica,sans-Serif" font-size="10.00">test4</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node20 -->
-<g id="edge28_Node000001_Node000020" class="edge">
-<title>Node1&#45;&gt;Node20</title>
-<g id="a_edge28_Node000001_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-384.73C54.59,-381.94 80.98,-377.67 101.3,-374.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.64,-377.87 110.95,-372.81 100.52,-370.96 101.64,-377.87"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a xlink:href="../../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8" target="_top" xlink:title="Test the computed postorder with the actual postorder on negative value.">
-<polygon fill="white" stroke="#666666" points="150.5,-492.25 112.75,-492.25 112.75,-473 150.5,-473 150.5,-492.25"/>
-<text text-anchor="middle" x="131.62" y="-478.75" font-family="Helvetica,sans-Serif" font-size="10.00">test5</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node26 -->
-<g id="edge35_Node000001_Node000026" class="edge">
-<title>Node1&#45;&gt;Node26</title>
-<g id="a_edge35_Node000001_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.76,-397.68C33.13,-412.78 50.81,-441.41 73,-458.62 81.43,-465.17 91.9,-470.23 101.6,-473.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.43,-477.28 111.02,-477.29 102.75,-470.67 100.43,-477.28"/>
-</a>
-</g>
-</g>
-<!-- Node28 -->
-<g id="Node000028" class="node">
-<title>Node28</title>
-<g id="a_Node000028"><a xlink:href="../../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89" target="_top" xlink:title="Test the computed inorder with the actual inorder on negative value.">
-<polygon fill="white" stroke="#666666" points="150.5,-416.25 112.75,-416.25 112.75,-397 150.5,-397 150.5,-416.25"/>
-<text text-anchor="middle" x="131.62" y="-402.75" font-family="Helvetica,sans-Serif" font-size="10.00">test6</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node28 -->
-<g id="edge41_Node000001_Node000028" class="edge">
-<title>Node1&#45;&gt;Node28</title>
-<g id="a_edge41_Node000001_Node000028"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-390.68C54.59,-393.62 80.98,-398.14 101.3,-401.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.51,-405.03 110.95,-403.26 101.69,-398.13 100.51,-405.03"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
-<polygon fill="white" stroke="#666666" points="310.5,-93.25 259.25,-93.25 259.25,-74 310.5,-74 310.5,-93.25"/>
-<text text-anchor="middle" x="284.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.95,-212.72C162.9,-210.17 178.43,-205.59 190.25,-197.62 227.42,-172.58 257.52,-128.5 272.85,-103.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="275.69,-105.2 277.73,-94.8 269.65,-101.66 275.69,-105.2"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="324,-206.25 245.75,-206.25 245.75,-187 324,-187 324,-206.25"/>
-<text text-anchor="middle" x="284.88" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node10 -->
-<g id="edge12_Node000004_Node000010" class="edge">
-<title>Node4&#45;&gt;Node10</title>
-<g id="a_edge12_Node000004_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.87,-213.33C171.47,-210.75 205.85,-206.43 234.5,-202.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="234.57,-206.35 244.05,-201.63 233.7,-199.4 234.57,-206.35"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="475,-19.25 399.75,-19.25 399.75,0 475,0 475,-19.25"/>
-<text text-anchor="middle" x="437.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M300.22,-73.6C318.11,-61.44 349.96,-40.91 379.5,-27.62 382.66,-26.2 385.96,-24.85 389.31,-23.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="390.43,-26.88 398.67,-20.22 388.08,-20.29 390.43,-26.88"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="473.5,-93.25 401.25,-93.25 401.25,-74 473.5,-74 473.5,-93.25"/>
-<text text-anchor="middle" x="437.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge8_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge8_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M310.73,-83.62C332.11,-83.62 363.54,-83.62 389.61,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="389.27,-87.13 399.27,-83.63 389.27,-80.13 389.27,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="465.25,-56.25 409.5,-56.25 409.5,-37 465.25,-37 465.25,-56.25"/>
-<text text-anchor="middle" x="437.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge10_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge10_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M310.73,-77.52C334.47,-71.68 370.6,-62.8 398.03,-56.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="398.85,-59.45 407.72,-53.67 397.18,-52.66 398.85,-59.45"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="612.5,-93.25 544,-93.25 544,-74 612.5,-74 612.5,-93.25"/>
-<text text-anchor="middle" x="578.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M475.4,-19.61C482.14,-21.91 489.01,-24.59 495.25,-27.62 517.33,-38.37 540.22,-54.49 556.19,-66.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="553.94,-69.36 563.98,-72.75 558.24,-63.84 553.94,-69.36"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M556.2,-93.54C546.14,-102.15 553.49,-111.25 578.25,-111.25 591.79,-111.25 600.13,-108.53 603.26,-104.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="606.64,-103.77 600.69,-95 599.88,-105.56 606.64,-103.77"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge9_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge9_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M473.78,-83.62C491.61,-83.62 513.43,-83.62 532.42,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="532.31,-87.13 542.31,-83.63 532.31,-80.13 532.31,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge11_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge11_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M465.48,-53.85C484.59,-58.94 510.62,-65.87 532.75,-71.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="531.55,-75.07 542.12,-74.26 533.36,-68.31 531.55,-75.07"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node7 -->
-<g id="edge13_Node000010_Node000007" class="edge">
-<title>Node10&#45;&gt;Node7</title>
-<g id="a_edge13_Node000010_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.85,-186.69C317.63,-174.42 349.62,-153.61 379.5,-140.62 406.94,-128.7 483.09,-107.99 532.49,-95.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.25,-98.51 542.05,-92.6 531.49,-91.73 533.25,-98.51"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="472.75,-169.25 402,-169.25 402,-150 472.75,-150 472.75,-169.25"/>
-<text text-anchor="middle" x="437.38" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge14_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge14_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.24,-187.19C344.47,-182.22 369.42,-176.09 390.65,-170.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="391.34,-174.3 400.21,-168.52 389.66,-167.5 391.34,-174.3"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="605.38,-300.25 551.12,-300.25 551.12,-281 605.38,-281 605.38,-300.25"/>
-<text text-anchor="middle" x="578.25" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node12 -->
-<g id="edge16_Node000010_Node000012" class="edge">
-<title>Node10&#45;&gt;Node12</title>
-<g id="a_edge16_Node000010_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.06,-206.57C316.52,-219.23 348.71,-240.88 379.5,-252.62 433.01,-273.04 499.02,-282.89 539.62,-287.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="539.05,-290.79 549.35,-288.34 539.77,-283.83 539.05,-290.79"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="463,-243.25 411.75,-243.25 411.75,-224 463,-224 463,-243.25"/>
-<text text-anchor="middle" x="437.38" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node13 -->
-<g id="edge17_Node000010_Node000013" class="edge">
-<title>Node10&#45;&gt;Node13</title>
-<g id="a_edge17_Node000010_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.24,-206.06C347.64,-211.81 377.35,-219.11 400.31,-224.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.29,-228.11 409.84,-227.1 400.96,-221.31 399.29,-228.11"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="466.75,-206.25 408,-206.25 408,-187 466.75,-187 466.75,-206.25"/>
-<text text-anchor="middle" x="437.38" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node14 -->
-<g id="edge18_Node000010_Node000014" class="edge">
-<title>Node10&#45;&gt;Node14</title>
-<g id="a_edge18_Node000010_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.24,-196.62C346.24,-196.62 373.83,-196.62 396.13,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.07,-200.13 406.07,-196.63 396.07,-193.13 396.07,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node7 -->
-<g id="edge15_Node000011_Node000007" class="edge">
-<title>Node11&#45;&gt;Node7</title>
-<g id="a_edge15_Node000011_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M464.84,-149.52C474.57,-145.53 485.56,-140.69 495.25,-135.62 515.78,-124.88 537.91,-110.68 554,-99.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="555.63,-102.96 561.91,-94.43 551.68,-97.18 555.63,-102.96"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node5 -->
-<g id="edge20_Node000015_Node000005" class="edge">
-<title>Node15&#45;&gt;Node5</title>
-<g id="a_edge20_Node000015_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.53,-168.64C174.81,-152.13 227.51,-119.03 258.83,-99.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.3,-102.57 266.91,-94.28 256.58,-96.64 260.3,-102.57"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node10 -->
-<g id="edge21_Node000015_Node000010" class="edge">
-<title>Node15&#45;&gt;Node10</title>
-<g id="a_edge21_Node000015_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.87,-180.8C171.47,-183.25 205.85,-187.34 234.5,-190.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.71,-194.18 244.05,-191.89 234.54,-187.23 233.71,-194.18"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.5,-319.25 244.25,-319.25 244.25,-300 325.5,-300 325.5,-319.25"/>
-<text text-anchor="middle" x="284.88" y="-305.75" font-family="Helvetica,sans-Serif" font-size="10.00">hamilton_cycle</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge23_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge23_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.87,-324.57C171.03,-322.31 204.4,-318.56 232.67,-315.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.96,-318.87 242.51,-314.27 232.18,-311.91 232.96,-318.87"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="458.5,-319.25 416.25,-319.25 416.25,-300 458.5,-300 458.5,-319.25"/>
-<text text-anchor="middle" x="437.38" y="-305.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge24_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge24_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M325.81,-309.62C350.47,-309.62 381.66,-309.62 404.63,-309.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.61,-313.13 414.61,-309.63 404.61,-306.13 404.61,-313.13"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="495.25,-374.25 379.5,-374.25 379.5,-355 495.25,-355 495.25,-374.25"/>
-<text text-anchor="middle" x="437.38" y="-360.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node19 -->
-<g id="edge27_Node000017_Node000019" class="edge">
-<title>Node17&#45;&gt;Node19</title>
-<g id="a_edge27_Node000017_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M319.09,-319.66C327.16,-322.35 335.71,-325.41 343.5,-328.62 360.04,-335.44 362.92,-339.91 379.5,-346.62 383.11,-348.09 386.89,-349.51 390.71,-350.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="389.45,-354.14 400.05,-354.05 391.7,-347.51 389.45,-354.14"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node12 -->
-<g id="edge26_Node000018_Node000012" class="edge">
-<title>Node18&#45;&gt;Node12</title>
-<g id="a_edge26_Node000018_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M458.87,-306.82C480.07,-303.92 513.65,-299.33 539.64,-295.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="540.04,-299.25 549.48,-294.42 539.09,-292.31 540.04,-299.25"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node18 -->
-<g id="edge25_Node000018_Node000018" class="edge">
-<title>Node18&#45;&gt;Node18</title>
-<g id="a_edge25_Node000018_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M416.02,-318.97C404.94,-327.74 412.06,-337.25 437.38,-337.25 452.4,-337.25 461.02,-333.9 463.22,-329.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="466.52,-328.14 459.33,-320.35 460.1,-330.92 466.52,-328.14"/>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node3 -->
-<g id="edge29_Node000020_Node000003" class="edge">
-<title>Node20&#45;&gt;Node3</title>
-<g id="a_edge29_Node000020_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.84,-371.85C163.06,-374.11 178.91,-378.64 190.25,-387.62 214.92,-407.18 201.73,-428.88 226.25,-448.62 232.31,-453.51 239.68,-457.16 247.09,-459.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="245.8,-463.14 256.39,-462.78 247.88,-456.46 245.8,-463.14"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae" target="_top" xlink:title="preOrderIterative() function that will perform the preorder traversal iteratively,...">
-<polygon fill="white" stroke="#666666" points="343.5,-379.5 226.25,-379.5 226.25,-337.75 343.5,-337.75 343.5,-379.5"/>
-<text text-anchor="start" x="234.25" y="-366" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="234.25" y="-354.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="284.88" y="-343.5" font-family="Helvetica,sans-Serif" font-size="10.00">::preOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node21 -->
-<g id="edge30_Node000020_Node000021" class="edge">
-<title>Node20&#45;&gt;Node21</title>
-<g id="a_edge30_Node000020_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.87,-368.3C166.8,-367.14 190.98,-365.38 214.38,-363.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.53,-367.18 224.25,-362.96 214.02,-360.2 214.53,-367.18"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="468.25,-485.25 406.5,-485.25 406.5,-466 468.25,-466 468.25,-485.25"/>
-<text text-anchor="middle" x="437.38" y="-471.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node21&#45;&gt;Node22 -->
-<g id="edge31_Node000021_Node000022" class="edge">
-<title>Node21&#45;&gt;Node22</title>
-<g id="a_edge31_Node000021_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M332.9,-379.85C336.71,-382.51 340.31,-385.44 343.5,-388.62 367.97,-413.07 353,-435.39 379.5,-457.62 384.21,-461.58 389.8,-464.67 395.6,-467.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="394.1,-470.26 404.7,-470.23 396.39,-463.65 394.1,-470.26"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="470.88,-448.25 403.88,-448.25 403.88,-429 470.88,-429 470.88,-448.25"/>
-<text text-anchor="middle" x="437.38" y="-434.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node21&#45;&gt;Node23 -->
-<g id="edge32_Node000021_Node000023" class="edge">
-<title>Node21&#45;&gt;Node23</title>
-<g id="a_edge32_Node000021_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M329.66,-379.95C334.43,-382.7 339.13,-385.62 343.5,-388.62 361.13,-400.77 360.89,-410.05 379.5,-420.62 383.65,-422.98 388.16,-425.08 392.75,-426.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="391.48,-430.19 402.08,-430.28 393.85,-423.6 391.48,-430.19"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="467.12,-411.25 407.62,-411.25 407.62,-392 467.12,-392 467.12,-411.25"/>
-<text text-anchor="middle" x="437.38" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node21&#45;&gt;Node25 -->
-<g id="edge34_Node000021_Node000025" class="edge">
-<title>Node21&#45;&gt;Node25</title>
-<g id="a_edge34_Node000021_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.63,-375.13C361.28,-380.17 380.28,-385.6 396.47,-390.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="395.14,-393.48 405.71,-392.86 397.06,-386.75 395.14,-393.48"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="625.25,-448.25 531.25,-448.25 531.25,-429 625.25,-429 625.25,-448.25"/>
-<text text-anchor="middle" x="578.25" y="-434.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node24 -->
-<g id="edge33_Node000023_Node000024" class="edge">
-<title>Node23&#45;&gt;Node24</title>
-<g id="a_edge33_Node000023_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M471.29,-438.62C485.75,-438.62 503.18,-438.62 519.68,-438.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="519.4,-442.13 529.4,-438.63 519.4,-435.13 519.4,-442.13"/>
-</a>
-</g>
-</g>
-<!-- Node26&#45;&gt;Node3 -->
-<g id="edge36_Node000026_Node000003" class="edge">
-<title>Node26&#45;&gt;Node3</title>
-<g id="a_edge36_Node000026_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.87,-480.82C174.38,-478.48 215.85,-474.37 246.25,-471.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.59,-474.84 256.2,-470.37 245.9,-467.87 246.59,-474.84"/>
-</a>
-</g>
-</g>
-<!-- Node27 -->
-<g id="Node000027" class="node">
-<title>Node27</title>
-<g id="a_Node000027"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25" target="_top" xlink:title="postOrderIterative() function that will perform the postorder traversal iteratively,...">
-<polygon fill="white" stroke="#666666" points="343.5,-537.5 226.25,-537.5 226.25,-495.75 343.5,-495.75 343.5,-537.5"/>
-<text text-anchor="start" x="234.25" y="-524" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="234.25" y="-512.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="284.88" y="-501.5" font-family="Helvetica,sans-Serif" font-size="10.00">::postOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node26&#45;&gt;Node27 -->
-<g id="edge37_Node000026_Node000027" class="edge">
-<title>Node26&#45;&gt;Node27</title>
-<g id="a_edge37_Node000026_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.87,-486.73C166.88,-490.32 191.2,-495.79 214.7,-501.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.76,-504.45 224.28,-503.23 215.29,-497.62 213.76,-504.45"/>
-</a>
-</g>
-</g>
-<!-- Node27&#45;&gt;Node22 -->
-<g id="edge38_Node000027_Node000022" class="edge">
-<title>Node27&#45;&gt;Node22</title>
-<g id="a_edge38_Node000027_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.63,-500.89C360.84,-496.2 379.34,-491.16 395.26,-486.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.15,-490.21 404.88,-484.21 394.31,-483.46 396.15,-490.21"/>
-</a>
-</g>
-</g>
-<!-- Node27&#45;&gt;Node23 -->
-<g id="edge39_Node000027_Node000023" class="edge">
-<title>Node27&#45;&gt;Node23</title>
-<g id="a_edge39_Node000027_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M329.26,-495.34C334.15,-492.56 338.99,-489.63 343.5,-486.62 360.84,-475.08 361.23,-466.62 379.5,-456.62 383.69,-454.33 388.22,-452.28 392.82,-450.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.92,-453.78 402.17,-447.13 391.57,-447.19 393.92,-453.78"/>
-</a>
-</g>
-</g>
-<!-- Node27&#45;&gt;Node25 -->
-<g id="edge40_Node000027_Node000025" class="edge">
-<title>Node27&#45;&gt;Node25</title>
-<g id="a_edge40_Node000027_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M332.86,-495.36C336.67,-492.71 340.29,-489.79 343.5,-486.62 367.56,-462.88 353.47,-441.2 379.5,-419.62 384.56,-415.43 390.6,-412.21 396.83,-409.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="397.52,-413.2 405.91,-406.73 395.32,-406.56 397.52,-413.2"/>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node3 -->
-<g id="edge42_Node000028_Node000003" class="edge">
-<title>Node28&#45;&gt;Node3</title>
-<g id="a_edge42_Node000028_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.93,-413.87C162.33,-418.48 177.24,-424.67 190.25,-430.62 206.52,-438.07 209.71,-441.81 226.25,-448.62 232.9,-451.37 240.1,-454 247.08,-456.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="245.74,-459.62 256.33,-459.43 247.93,-452.97 245.74,-459.62"/>
-</a>
-</g>
-</g>
-<!-- Node29 -->
-<g id="Node000029" class="node">
-<title>Node29</title>
-<g id="a_Node000029"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499" target="_top" xlink:title="inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul...">
-<polygon fill="white" stroke="#666666" points="343.5,-439.5 226.25,-439.5 226.25,-397.75 343.5,-397.75 343.5,-439.5"/>
-<text text-anchor="start" x="234.25" y="-426" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="234.25" y="-414.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="284.88" y="-403.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node29 -->
-<g id="edge43_Node000028_Node000029" class="edge">
-<title>Node28&#45;&gt;Node29</title>
-<g id="a_edge43_Node000028_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.87,-408.07C166.8,-409.34 190.98,-411.26 214.38,-413.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.01,-416.59 224.25,-413.89 214.56,-409.61 214.01,-416.59"/>
-</a>
-</g>
-</g>
-<!-- Node29&#45;&gt;Node22 -->
-<g id="edge44_Node000029_Node000022" class="edge">
-<title>Node29&#45;&gt;Node22</title>
-<g id="a_edge44_Node000029_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M334.63,-439.89C348.98,-445.89 364.78,-452.24 379.5,-457.62 384.58,-459.48 389.96,-461.33 395.3,-463.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="394.07,-466.38 404.66,-466.12 396.22,-459.72 394.07,-466.38"/>
-</a>
-</g>
-</g>
-<!-- Node29&#45;&gt;Node23 -->
-<g id="edge45_Node000029_Node000023" class="edge">
-<title>Node29&#45;&gt;Node23</title>
-<g id="a_edge45_Node000029_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.63,-426.3C359.88,-428.46 377.28,-430.77 392.57,-432.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="391.93,-436.25 402.3,-434.1 392.85,-429.31 391.93,-436.25"/>
-</a>
-</g>
-</g>
-<!-- Node29&#45;&gt;Node25 -->
-<g id="edge46_Node000029_Node000025" class="edge">
-<title>Node29&#45;&gt;Node25</title>
-<g id="a_edge46_Node000029_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.63,-412.1C361.11,-410.13 379.92,-408 396,-406.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.12,-409.69 405.66,-405.09 395.33,-402.74 396.12,-409.69"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index fc65fb1c5..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,695 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="633pt" height="561pt"
- viewBox="0.00 0.00 633.25 560.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 556.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-397.25 0,-397.25 0,-378 37,-378 37,-397.25"/>
-<text text-anchor="middle" x="18.5" y="-383.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6" target="_top" xlink:title="function that will create new node for insertion.">
-<polygon fill="white" stroke="#666666" points="190.25,-552.5 73,-552.5 73,-510.75 190.25,-510.75 190.25,-552.5"/>
-<text text-anchor="start" x="81" y="-539" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="81" y="-527.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="131.62" y="-516.5" font-family="Helvetica,sans-Serif" font-size="10.00">::createNewNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.88,-397.72C27.41,-419.28 43.03,-470.39 73,-501.62 73.48,-502.12 73.96,-502.61 74.46,-503.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.08,-505.67 82.01,-509.37 76.56,-500.29 72.08,-505.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="311.62,-477.25 258.12,-477.25 258.12,-458 311.62,-458 311.62,-477.25"/>
-<text text-anchor="middle" x="284.88" y="-463.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.54,-397.61C40.8,-406.34 56.89,-418.68 73,-425.62 130.5,-450.42 203.17,-460.75 246.46,-464.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.07,-468.41 256.34,-465.82 246.7,-461.44 246.07,-468.41"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title="Self&#45;test implementations, 1st test.">
-<polygon fill="white" stroke="#666666" points="150.5,-225.25 112.75,-225.25 112.75,-206 150.5,-206 150.5,-225.25"/>
-<text text-anchor="middle" x="131.62" y="-211.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.95,-377.63C43.83,-349.97 94.22,-271.97 117.96,-235.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.84,-237.21 123.33,-226.91 114.96,-233.41 120.84,-237.21"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title="Self&#45;implementations, 2nd test.">
-<polygon fill="white" stroke="#666666" points="150.5,-188.25 112.75,-188.25 112.75,-169 150.5,-169 150.5,-188.25"/>
-<text text-anchor="middle" x="131.62" y="-174.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node15 -->
-<g id="edge19_Node000001_Node000015" class="edge">
-<title>Node1&#45;&gt;Node15</title>
-<g id="a_edge19_Node000001_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M19.2,-377.72C18.8,-346.53 21.91,-249.25 73,-196.62 80.48,-188.92 91.2,-184.5 101.37,-181.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.78,-185.46 110.93,-180.13 100.45,-178.58 101.78,-185.46"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.5,-336.25 112.75,-336.25 112.75,-317 150.5,-317 150.5,-336.25"/>
-<text text-anchor="middle" x="131.62" y="-322.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge22_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge22_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.2,-377.7C42.74,-369.75 58.33,-358.64 73,-350.62 82.09,-345.66 92.43,-341.06 101.81,-337.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.82,-340.6 110.85,-333.69 100.26,-334.08 102.82,-340.6"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2" target="_top" xlink:title="Test the computed preorder with the actual preorder on negative value.">
-<polygon fill="white" stroke="#666666" points="150.5,-379.25 112.75,-379.25 112.75,-360 150.5,-360 150.5,-379.25"/>
-<text text-anchor="middle" x="131.62" y="-365.75" font-family="Helvetica,sans-Serif" font-size="10.00">test4</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node20 -->
-<g id="edge28_Node000001_Node000020" class="edge">
-<title>Node1&#45;&gt;Node20</title>
-<g id="a_edge28_Node000001_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-384.73C54.59,-381.94 80.98,-377.67 101.3,-374.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.64,-377.87 110.95,-372.81 100.52,-370.96 101.64,-377.87"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a xlink:href="../../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8" target="_top" xlink:title="Test the computed postorder with the actual postorder on negative value.">
-<polygon fill="white" stroke="#666666" points="150.5,-492.25 112.75,-492.25 112.75,-473 150.5,-473 150.5,-492.25"/>
-<text text-anchor="middle" x="131.62" y="-478.75" font-family="Helvetica,sans-Serif" font-size="10.00">test5</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node26 -->
-<g id="edge35_Node000001_Node000026" class="edge">
-<title>Node1&#45;&gt;Node26</title>
-<g id="a_edge35_Node000001_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.76,-397.68C33.13,-412.78 50.81,-441.41 73,-458.62 81.43,-465.17 91.9,-470.23 101.6,-473.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.43,-477.28 111.02,-477.29 102.75,-470.67 100.43,-477.28"/>
-</a>
-</g>
-</g>
-<!-- Node28 -->
-<g id="Node000028" class="node">
-<title>Node28</title>
-<g id="a_Node000028"><a xlink:href="../../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89" target="_top" xlink:title="Test the computed inorder with the actual inorder on negative value.">
-<polygon fill="white" stroke="#666666" points="150.5,-416.25 112.75,-416.25 112.75,-397 150.5,-397 150.5,-416.25"/>
-<text text-anchor="middle" x="131.62" y="-402.75" font-family="Helvetica,sans-Serif" font-size="10.00">test6</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node28 -->
-<g id="edge41_Node000001_Node000028" class="edge">
-<title>Node1&#45;&gt;Node28</title>
-<g id="a_edge41_Node000001_Node000028"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-390.68C54.59,-393.62 80.98,-398.14 101.3,-401.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.51,-405.03 110.95,-403.26 101.69,-398.13 100.51,-405.03"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
-<polygon fill="white" stroke="#666666" points="310.5,-93.25 259.25,-93.25 259.25,-74 310.5,-74 310.5,-93.25"/>
-<text text-anchor="middle" x="284.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.95,-212.72C162.9,-210.17 178.43,-205.59 190.25,-197.62 227.42,-172.58 257.52,-128.5 272.85,-103.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="275.69,-105.2 277.73,-94.8 269.65,-101.66 275.69,-105.2"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="324,-206.25 245.75,-206.25 245.75,-187 324,-187 324,-206.25"/>
-<text text-anchor="middle" x="284.88" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node10 -->
-<g id="edge12_Node000004_Node000010" class="edge">
-<title>Node4&#45;&gt;Node10</title>
-<g id="a_edge12_Node000004_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.87,-213.33C171.47,-210.75 205.85,-206.43 234.5,-202.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="234.57,-206.35 244.05,-201.63 233.7,-199.4 234.57,-206.35"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="475,-19.25 399.75,-19.25 399.75,0 475,0 475,-19.25"/>
-<text text-anchor="middle" x="437.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M300.22,-73.6C318.11,-61.44 349.96,-40.91 379.5,-27.62 382.66,-26.2 385.96,-24.85 389.31,-23.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="390.43,-26.88 398.67,-20.22 388.08,-20.29 390.43,-26.88"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="473.5,-93.25 401.25,-93.25 401.25,-74 473.5,-74 473.5,-93.25"/>
-<text text-anchor="middle" x="437.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge8_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge8_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M310.73,-83.62C332.11,-83.62 363.54,-83.62 389.61,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="389.27,-87.13 399.27,-83.63 389.27,-80.13 389.27,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="465.25,-56.25 409.5,-56.25 409.5,-37 465.25,-37 465.25,-56.25"/>
-<text text-anchor="middle" x="437.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge10_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge10_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M310.73,-77.52C334.47,-71.68 370.6,-62.8 398.03,-56.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="398.85,-59.45 407.72,-53.67 397.18,-52.66 398.85,-59.45"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="612.5,-93.25 544,-93.25 544,-74 612.5,-74 612.5,-93.25"/>
-<text text-anchor="middle" x="578.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M475.4,-19.61C482.14,-21.91 489.01,-24.59 495.25,-27.62 517.33,-38.37 540.22,-54.49 556.19,-66.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="553.94,-69.36 563.98,-72.75 558.24,-63.84 553.94,-69.36"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M556.2,-93.54C546.14,-102.15 553.49,-111.25 578.25,-111.25 591.79,-111.25 600.13,-108.53 603.26,-104.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="606.64,-103.77 600.69,-95 599.88,-105.56 606.64,-103.77"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge9_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge9_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M473.78,-83.62C491.61,-83.62 513.43,-83.62 532.42,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="532.31,-87.13 542.31,-83.63 532.31,-80.13 532.31,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge11_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge11_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M465.48,-53.85C484.59,-58.94 510.62,-65.87 532.75,-71.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="531.55,-75.07 542.12,-74.26 533.36,-68.31 531.55,-75.07"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node7 -->
-<g id="edge13_Node000010_Node000007" class="edge">
-<title>Node10&#45;&gt;Node7</title>
-<g id="a_edge13_Node000010_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.85,-186.69C317.63,-174.42 349.62,-153.61 379.5,-140.62 406.94,-128.7 483.09,-107.99 532.49,-95.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.25,-98.51 542.05,-92.6 531.49,-91.73 533.25,-98.51"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="472.75,-169.25 402,-169.25 402,-150 472.75,-150 472.75,-169.25"/>
-<text text-anchor="middle" x="437.38" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge14_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge14_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.24,-187.19C344.47,-182.22 369.42,-176.09 390.65,-170.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="391.34,-174.3 400.21,-168.52 389.66,-167.5 391.34,-174.3"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="605.38,-300.25 551.12,-300.25 551.12,-281 605.38,-281 605.38,-300.25"/>
-<text text-anchor="middle" x="578.25" y="-286.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node12 -->
-<g id="edge16_Node000010_Node000012" class="edge">
-<title>Node10&#45;&gt;Node12</title>
-<g id="a_edge16_Node000010_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.06,-206.57C316.52,-219.23 348.71,-240.88 379.5,-252.62 433.01,-273.04 499.02,-282.89 539.62,-287.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="539.05,-290.79 549.35,-288.34 539.77,-283.83 539.05,-290.79"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="463,-243.25 411.75,-243.25 411.75,-224 463,-224 463,-243.25"/>
-<text text-anchor="middle" x="437.38" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node13 -->
-<g id="edge17_Node000010_Node000013" class="edge">
-<title>Node10&#45;&gt;Node13</title>
-<g id="a_edge17_Node000010_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.24,-206.06C347.64,-211.81 377.35,-219.11 400.31,-224.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.29,-228.11 409.84,-227.1 400.96,-221.31 399.29,-228.11"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="466.75,-206.25 408,-206.25 408,-187 466.75,-187 466.75,-206.25"/>
-<text text-anchor="middle" x="437.38" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node14 -->
-<g id="edge18_Node000010_Node000014" class="edge">
-<title>Node10&#45;&gt;Node14</title>
-<g id="a_edge18_Node000010_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M324.24,-196.62C346.24,-196.62 373.83,-196.62 396.13,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.07,-200.13 406.07,-196.63 396.07,-193.13 396.07,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node7 -->
-<g id="edge15_Node000011_Node000007" class="edge">
-<title>Node11&#45;&gt;Node7</title>
-<g id="a_edge15_Node000011_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M464.84,-149.52C474.57,-145.53 485.56,-140.69 495.25,-135.62 515.78,-124.88 537.91,-110.68 554,-99.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="555.63,-102.96 561.91,-94.43 551.68,-97.18 555.63,-102.96"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node5 -->
-<g id="edge20_Node000015_Node000005" class="edge">
-<title>Node15&#45;&gt;Node5</title>
-<g id="a_edge20_Node000015_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.53,-168.64C174.81,-152.13 227.51,-119.03 258.83,-99.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.3,-102.57 266.91,-94.28 256.58,-96.64 260.3,-102.57"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node10 -->
-<g id="edge21_Node000015_Node000010" class="edge">
-<title>Node15&#45;&gt;Node10</title>
-<g id="a_edge21_Node000015_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.87,-180.8C171.47,-183.25 205.85,-187.34 234.5,-190.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.71,-194.18 244.05,-191.89 234.54,-187.23 233.71,-194.18"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="325.5,-319.25 244.25,-319.25 244.25,-300 325.5,-300 325.5,-319.25"/>
-<text text-anchor="middle" x="284.88" y="-305.75" font-family="Helvetica,sans-Serif" font-size="10.00">hamilton_cycle</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge23_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge23_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.87,-324.57C171.03,-322.31 204.4,-318.56 232.67,-315.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.96,-318.87 242.51,-314.27 232.18,-311.91 232.96,-318.87"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="458.5,-319.25 416.25,-319.25 416.25,-300 458.5,-300 458.5,-319.25"/>
-<text text-anchor="middle" x="437.38" y="-305.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge24_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge24_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M325.81,-309.62C350.47,-309.62 381.66,-309.62 404.63,-309.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.61,-313.13 414.61,-309.63 404.61,-306.13 404.61,-313.13"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="495.25,-374.25 379.5,-374.25 379.5,-355 495.25,-355 495.25,-374.25"/>
-<text text-anchor="middle" x="437.38" y="-360.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node19 -->
-<g id="edge27_Node000017_Node000019" class="edge">
-<title>Node17&#45;&gt;Node19</title>
-<g id="a_edge27_Node000017_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M319.09,-319.66C327.16,-322.35 335.71,-325.41 343.5,-328.62 360.04,-335.44 362.92,-339.91 379.5,-346.62 383.11,-348.09 386.89,-349.51 390.71,-350.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="389.45,-354.14 400.05,-354.05 391.7,-347.51 389.45,-354.14"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node12 -->
-<g id="edge26_Node000018_Node000012" class="edge">
-<title>Node18&#45;&gt;Node12</title>
-<g id="a_edge26_Node000018_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M458.87,-306.82C480.07,-303.92 513.65,-299.33 539.64,-295.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="540.04,-299.25 549.48,-294.42 539.09,-292.31 540.04,-299.25"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node18 -->
-<g id="edge25_Node000018_Node000018" class="edge">
-<title>Node18&#45;&gt;Node18</title>
-<g id="a_edge25_Node000018_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M416.02,-318.97C404.94,-327.74 412.06,-337.25 437.38,-337.25 452.4,-337.25 461.02,-333.9 463.22,-329.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="466.52,-328.14 459.33,-320.35 460.1,-330.92 466.52,-328.14"/>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node3 -->
-<g id="edge29_Node000020_Node000003" class="edge">
-<title>Node20&#45;&gt;Node3</title>
-<g id="a_edge29_Node000020_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.84,-371.85C163.06,-374.11 178.91,-378.64 190.25,-387.62 214.92,-407.18 201.73,-428.88 226.25,-448.62 232.31,-453.51 239.68,-457.16 247.09,-459.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="245.8,-463.14 256.39,-462.78 247.88,-456.46 245.8,-463.14"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae" target="_top" xlink:title="preOrderIterative() function that will perform the preorder traversal iteratively,...">
-<polygon fill="white" stroke="#666666" points="343.5,-379.5 226.25,-379.5 226.25,-337.75 343.5,-337.75 343.5,-379.5"/>
-<text text-anchor="start" x="234.25" y="-366" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="234.25" y="-354.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="284.88" y="-343.5" font-family="Helvetica,sans-Serif" font-size="10.00">::preOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node21 -->
-<g id="edge30_Node000020_Node000021" class="edge">
-<title>Node20&#45;&gt;Node21</title>
-<g id="a_edge30_Node000020_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.87,-368.3C166.8,-367.14 190.98,-365.38 214.38,-363.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.53,-367.18 224.25,-362.96 214.02,-360.2 214.53,-367.18"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="468.25,-485.25 406.5,-485.25 406.5,-466 468.25,-466 468.25,-485.25"/>
-<text text-anchor="middle" x="437.38" y="-471.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node21&#45;&gt;Node22 -->
-<g id="edge31_Node000021_Node000022" class="edge">
-<title>Node21&#45;&gt;Node22</title>
-<g id="a_edge31_Node000021_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M332.9,-379.85C336.71,-382.51 340.31,-385.44 343.5,-388.62 367.97,-413.07 353,-435.39 379.5,-457.62 384.21,-461.58 389.8,-464.67 395.6,-467.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="394.1,-470.26 404.7,-470.23 396.39,-463.65 394.1,-470.26"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="470.88,-448.25 403.88,-448.25 403.88,-429 470.88,-429 470.88,-448.25"/>
-<text text-anchor="middle" x="437.38" y="-434.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node21&#45;&gt;Node23 -->
-<g id="edge32_Node000021_Node000023" class="edge">
-<title>Node21&#45;&gt;Node23</title>
-<g id="a_edge32_Node000021_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M329.66,-379.95C334.43,-382.7 339.13,-385.62 343.5,-388.62 361.13,-400.77 360.89,-410.05 379.5,-420.62 383.65,-422.98 388.16,-425.08 392.75,-426.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="391.48,-430.19 402.08,-430.28 393.85,-423.6 391.48,-430.19"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="467.12,-411.25 407.62,-411.25 407.62,-392 467.12,-392 467.12,-411.25"/>
-<text text-anchor="middle" x="437.38" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node21&#45;&gt;Node25 -->
-<g id="edge34_Node000021_Node000025" class="edge">
-<title>Node21&#45;&gt;Node25</title>
-<g id="a_edge34_Node000021_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.63,-375.13C361.28,-380.17 380.28,-385.6 396.47,-390.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="395.14,-393.48 405.71,-392.86 397.06,-386.75 395.14,-393.48"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="625.25,-448.25 531.25,-448.25 531.25,-429 625.25,-429 625.25,-448.25"/>
-<text text-anchor="middle" x="578.25" y="-434.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node24 -->
-<g id="edge33_Node000023_Node000024" class="edge">
-<title>Node23&#45;&gt;Node24</title>
-<g id="a_edge33_Node000023_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M471.29,-438.62C485.75,-438.62 503.18,-438.62 519.68,-438.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="519.4,-442.13 529.4,-438.63 519.4,-435.13 519.4,-442.13"/>
-</a>
-</g>
-</g>
-<!-- Node26&#45;&gt;Node3 -->
-<g id="edge36_Node000026_Node000003" class="edge">
-<title>Node26&#45;&gt;Node3</title>
-<g id="a_edge36_Node000026_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.87,-480.82C174.38,-478.48 215.85,-474.37 246.25,-471.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.59,-474.84 256.2,-470.37 245.9,-467.87 246.59,-474.84"/>
-</a>
-</g>
-</g>
-<!-- Node27 -->
-<g id="Node000027" class="node">
-<title>Node27</title>
-<g id="a_Node000027"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25" target="_top" xlink:title="postOrderIterative() function that will perform the postorder traversal iteratively,...">
-<polygon fill="white" stroke="#666666" points="343.5,-537.5 226.25,-537.5 226.25,-495.75 343.5,-495.75 343.5,-537.5"/>
-<text text-anchor="start" x="234.25" y="-524" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="234.25" y="-512.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="284.88" y="-501.5" font-family="Helvetica,sans-Serif" font-size="10.00">::postOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node26&#45;&gt;Node27 -->
-<g id="edge37_Node000026_Node000027" class="edge">
-<title>Node26&#45;&gt;Node27</title>
-<g id="a_edge37_Node000026_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.87,-486.73C166.88,-490.32 191.2,-495.79 214.7,-501.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.76,-504.45 224.28,-503.23 215.29,-497.62 213.76,-504.45"/>
-</a>
-</g>
-</g>
-<!-- Node27&#45;&gt;Node22 -->
-<g id="edge38_Node000027_Node000022" class="edge">
-<title>Node27&#45;&gt;Node22</title>
-<g id="a_edge38_Node000027_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.63,-500.89C360.84,-496.2 379.34,-491.16 395.26,-486.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.15,-490.21 404.88,-484.21 394.31,-483.46 396.15,-490.21"/>
-</a>
-</g>
-</g>
-<!-- Node27&#45;&gt;Node23 -->
-<g id="edge39_Node000027_Node000023" class="edge">
-<title>Node27&#45;&gt;Node23</title>
-<g id="a_edge39_Node000027_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M329.26,-495.34C334.15,-492.56 338.99,-489.63 343.5,-486.62 360.84,-475.08 361.23,-466.62 379.5,-456.62 383.69,-454.33 388.22,-452.28 392.82,-450.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.92,-453.78 402.17,-447.13 391.57,-447.19 393.92,-453.78"/>
-</a>
-</g>
-</g>
-<!-- Node27&#45;&gt;Node25 -->
-<g id="edge40_Node000027_Node000025" class="edge">
-<title>Node27&#45;&gt;Node25</title>
-<g id="a_edge40_Node000027_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M332.86,-495.36C336.67,-492.71 340.29,-489.79 343.5,-486.62 367.56,-462.88 353.47,-441.2 379.5,-419.62 384.56,-415.43 390.6,-412.21 396.83,-409.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="397.52,-413.2 405.91,-406.73 395.32,-406.56 397.52,-413.2"/>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node3 -->
-<g id="edge42_Node000028_Node000003" class="edge">
-<title>Node28&#45;&gt;Node3</title>
-<g id="a_edge42_Node000028_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.93,-413.87C162.33,-418.48 177.24,-424.67 190.25,-430.62 206.52,-438.07 209.71,-441.81 226.25,-448.62 232.9,-451.37 240.1,-454 247.08,-456.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="245.74,-459.62 256.33,-459.43 247.93,-452.97 245.74,-459.62"/>
-</a>
-</g>
-</g>
-<!-- Node29 -->
-<g id="Node000029" class="node">
-<title>Node29</title>
-<g id="a_Node000029"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499" target="_top" xlink:title="inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul...">
-<polygon fill="white" stroke="#666666" points="343.5,-439.5 226.25,-439.5 226.25,-397.75 343.5,-397.75 343.5,-439.5"/>
-<text text-anchor="start" x="234.25" y="-426" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="234.25" y="-414.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="284.88" y="-403.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node29 -->
-<g id="edge43_Node000028_Node000029" class="edge">
-<title>Node28&#45;&gt;Node29</title>
-<g id="a_edge43_Node000028_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.87,-408.07C166.8,-409.34 190.98,-411.26 214.38,-413.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.01,-416.59 224.25,-413.89 214.56,-409.61 214.01,-416.59"/>
-</a>
-</g>
-</g>
-<!-- Node29&#45;&gt;Node22 -->
-<g id="edge44_Node000029_Node000022" class="edge">
-<title>Node29&#45;&gt;Node22</title>
-<g id="a_edge44_Node000029_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M334.63,-439.89C348.98,-445.89 364.78,-452.24 379.5,-457.62 384.58,-459.48 389.96,-461.33 395.3,-463.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="394.07,-466.38 404.66,-466.12 396.22,-459.72 394.07,-466.38"/>
-</a>
-</g>
-</g>
-<!-- Node29&#45;&gt;Node23 -->
-<g id="edge45_Node000029_Node000023" class="edge">
-<title>Node29&#45;&gt;Node23</title>
-<g id="a_edge45_Node000029_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.63,-426.3C359.88,-428.46 377.28,-430.77 392.57,-432.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="391.93,-436.25 402.3,-434.1 392.85,-429.31 391.93,-436.25"/>
-</a>
-</g>
-</g>
-<!-- Node29&#45;&gt;Node25 -->
-<g id="edge46_Node000029_Node000025" class="edge">
-<title>Node29&#45;&gt;Node25</title>
-<g id="a_edge46_Node000029_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.63,-412.1C361.11,-410.13 379.92,-408 396,-406.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="396.12,-409.69 405.66,-405.09 395.33,-402.74 396.12,-409.69"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_af727f920064f2b8f484b589b60d49b89_cgraph.map b/d8/d90/iterative__tree__traversals_8cpp_af727f920064f2b8f484b589b60d49b89_cgraph.map
deleted file mode 100644
index 8096d3a8e..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_af727f920064f2b8f484b589b60d49b89_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="test6" name="test6">
-<area shape="rect" id="Node000001" title="Test the computed inorder with the actual inorder on negative value." alt="" coords="5,39,56,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="146,5,218,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,44,130,27,131,32,56,49"/>
-<area shape="rect" id="Node000003" href="$d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499" title="inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul..." alt="" coords="104,56,260,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,54,89,61,88,66,55,59"/>
-<area shape="rect" id="Node000004" href="$d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" title=" " alt="" coords="312,21,394,47"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="260,58,296,48,297,53,261,63"/>
-<area shape="rect" id="Node000005" href="$d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" title=" " alt="" coords="308,71,397,96"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="260,81,292,81,292,86,260,86"/>
-<area shape="rect" id="Node000007" href="$d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" title=" " alt="" coords="313,120,392,146"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="261,104,299,115,297,120,260,109"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="445,71,571,96"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="398,81,429,81,429,86,398,86"/>
-</map>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_af727f920064f2b8f484b589b60d49b89_cgraph.md5 b/d8/d90/iterative__tree__traversals_8cpp_af727f920064f2b8f484b589b60d49b89_cgraph.md5
deleted file mode 100644
index a734967f4..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_af727f920064f2b8f484b589b60d49b89_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-98d29129483fe03c0b27dc32df9bbc26
\ No newline at end of file
diff --git a/d8/d90/iterative__tree__traversals_8cpp_af727f920064f2b8f484b589b60d49b89_cgraph.svg b/d8/d90/iterative__tree__traversals_8cpp_af727f920064f2b8f484b589b60d49b89_cgraph.svg
deleted file mode 100644
index f05a2db6a..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_af727f920064f2b8f484b589b60d49b89_cgraph.svg
+++ /dev/null
@@ -1,157 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test6 Pages: 1 -->
-<svg width="432pt" height="113pt"
- viewBox="0.00 0.00 432.00 113.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 109.25)">
-<title>test6</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test the computed inorder with the actual inorder on negative value.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-80.25 0,-80.25 0,-61 37.75,-61 37.75,-80.25"/>
-<text text-anchor="middle" x="18.88" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">test6</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.12,-105.25 105.62,-105.25 105.62,-86 159.12,-86 159.12,-105.25"/>
-<text text-anchor="middle" x="132.38" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-74.64C52.95,-78.04 75.18,-83.03 94.17,-87.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.19,-90.65 103.71,-89.42 94.72,-83.82 93.19,-90.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499" target="_top" xlink:title="inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul...">
-<polygon fill="white" stroke="#666666" points="191,-67.5 73.75,-67.5 73.75,-25.75 191,-25.75 191,-67.5"/>
-<text text-anchor="start" x="81.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="81.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="132.38" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-66.77C44.79,-65.26 53.3,-63.43 62.3,-61.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.94,-64.94 71.98,-59.41 61.47,-58.09 62.94,-64.94"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.38,-93.25 229.62,-93.25 229.62,-74 291.38,-74 291.38,-93.25"/>
-<text text-anchor="middle" x="260.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-63.61C200.37,-66.28 209.6,-68.99 218.23,-71.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.1,-74.84 227.68,-74.29 219.07,-68.12 217.1,-74.84"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-56.25 227,-56.25 227,-37 294,-37 294,-56.25"/>
-<text text-anchor="middle" x="260.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-46.62C199.35,-46.62 207.55,-46.62 215.33,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.22,-50.13 225.22,-46.63 215.22,-43.13 215.22,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.25,-19.25 230.75,-19.25 230.75,0 290.25,0 290.25,-19.25"/>
-<text text-anchor="middle" x="260.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-29.64C200.83,-26.84 210.55,-23.98 219.55,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.42,-24.74 229.03,-18.56 218.45,-18.02 220.42,-24.74"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424,-56.25 330,-56.25 330,-37 424,-37 424,-56.25"/>
-<text text-anchor="middle" x="377" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M294.31,-46.62C301.77,-46.62 309.9,-46.62 318.06,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.02,-50.13 328.02,-46.63 318.02,-43.13 318.02,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_af727f920064f2b8f484b589b60d49b89_cgraph_org.svg b/d8/d90/iterative__tree__traversals_8cpp_af727f920064f2b8f484b589b60d49b89_cgraph_org.svg
deleted file mode 100644
index 82f9c4a2f..000000000
--- a/d8/d90/iterative__tree__traversals_8cpp_af727f920064f2b8f484b589b60d49b89_cgraph_org.svg
+++ /dev/null
@@ -1,131 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test6 Pages: 1 -->
-<svg width="432pt" height="113pt"
- viewBox="0.00 0.00 432.00 113.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 109.25)">
-<title>test6</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test the computed inorder with the actual inorder on negative value.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-80.25 0,-80.25 0,-61 37.75,-61 37.75,-80.25"/>
-<text text-anchor="middle" x="18.88" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">test6</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.12,-105.25 105.62,-105.25 105.62,-86 159.12,-86 159.12,-105.25"/>
-<text text-anchor="middle" x="132.38" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-74.64C52.95,-78.04 75.18,-83.03 94.17,-87.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.19,-90.65 103.71,-89.42 94.72,-83.82 93.19,-90.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499" target="_top" xlink:title="inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul...">
-<polygon fill="white" stroke="#666666" points="191,-67.5 73.75,-67.5 73.75,-25.75 191,-25.75 191,-67.5"/>
-<text text-anchor="start" x="81.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="81.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="132.38" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-66.77C44.79,-65.26 53.3,-63.43 62.3,-61.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.94,-64.94 71.98,-59.41 61.47,-58.09 62.94,-64.94"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.38,-93.25 229.62,-93.25 229.62,-74 291.38,-74 291.38,-93.25"/>
-<text text-anchor="middle" x="260.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-63.61C200.37,-66.28 209.6,-68.99 218.23,-71.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.1,-74.84 227.68,-74.29 219.07,-68.12 217.1,-74.84"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-56.25 227,-56.25 227,-37 294,-37 294,-56.25"/>
-<text text-anchor="middle" x="260.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-46.62C199.35,-46.62 207.55,-46.62 215.33,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.22,-50.13 225.22,-46.63 215.22,-43.13 215.22,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.25,-19.25 230.75,-19.25 230.75,0 290.25,0 290.25,-19.25"/>
-<text text-anchor="middle" x="260.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.27,-29.64C200.83,-26.84 210.55,-23.98 219.55,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.42,-24.74 229.03,-18.56 218.45,-18.02 220.42,-24.74"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424,-56.25 330,-56.25 330,-37 424,-37 424,-56.25"/>
-<text text-anchor="middle" x="377" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M294.31,-46.62C301.77,-46.62 309.9,-46.62 318.06,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.02,-50.13 328.02,-46.63 318.02,-43.13 318.02,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d90/iterative__tree__traversals_8cpp_source.html b/d8/d90/iterative__tree__traversals_8cpp_source.html
new file mode 100644
index 000000000..4a9d09c83
--- /dev/null
+++ b/d8/d90/iterative__tree__traversals_8cpp_source.html
@@ -0,0 +1,493 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/iterative_tree_traversals.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/d90/iterative__tree__traversals_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">iterative_tree_traversals.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/d90/iterative__tree__traversals_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &lt;stack&gt;</span>      </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/d6f/namespaceothers.html">others</a> {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d73/namespaceiterative__tree__traversals.html">iterative_tree_traversals</a> {</div>
+<div class="foldopen" id="foldopen00058" data-start="{" data-end="};">
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">   58</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f">   59</a></span>    int64_t <a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f">data</a> = 0;      </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"><a class="line" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e">   60</a></span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *left{};   </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"><a class="line" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143">   61</a></span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *<a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143">right</a>{};  </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>};</div>
+</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="foldopen" id="foldopen00067" data-start="{" data-end="};">
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">   67</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">BinaryTree</a> {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        int64_t);  </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::vector&lt;int64_t&gt; <a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae">preOrderIterative</a>(</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *);  </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    std::vector&lt;int64_t&gt; <a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25">postOrderIterative</a>(</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *);  </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    std::vector&lt;int64_t&gt; <a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499">inOrderIterative</a>(</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *);  </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>};</div>
+</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="foldopen" id="foldopen00088" data-start="{" data-end="}">
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"><a class="line" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">   88</a></span><a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">BinaryTree::createNewNode</a>(int64_t <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a>();</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;data = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keywordflow">return</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>}</div>
+</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="foldopen" id="foldopen00102" data-start="{" data-end="}">
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"><a class="line" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae">  102</a></span>std::vector&lt;int64_t&gt; <a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae">BinaryTree::preOrderIterative</a>(<a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *root) {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    std::stack&lt;Node *&gt;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;  </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    std::vector&lt;int64_t&gt; result;  </div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(root);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="keywordflow">while</span> (!<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.empty()) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        result.push_back(<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">top</a>()-&gt;data);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *current = <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">top</a>();</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>();</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        <span class="keywordflow">if</span> (current-&gt;<a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143">right</a>) {</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>            <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(current-&gt;<a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143">right</a>);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        }</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        <span class="keywordflow">if</span> (current-&gt;<a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e">left</a>) {</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>            <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(current-&gt;<a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e">left</a>);</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>        }</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    }</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span> </div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>}</div>
+</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
+<div class="foldopen" id="foldopen00132" data-start="{" data-end="}">
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"><a class="line" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25">  132</a></span>std::vector&lt;int64_t&gt; <a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25">BinaryTree::postOrderIterative</a>(<a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *root) {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    std::stack&lt;Node *&gt;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>        <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;  </div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    std::vector&lt;int64_t&gt; result;  </div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span> </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(root);</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <span class="keywordflow">while</span> (!<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.empty()) {</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        result.push_back(<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">top</a>()-&gt;data);</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *current = <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">top</a>();</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>();</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span> </div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        <span class="keywordflow">if</span> (current-&gt;<a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e">left</a>) {</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>            <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(current-&gt;<a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e">left</a>);</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        }</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        <span class="keywordflow">if</span> (current-&gt;<a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143">right</a>) {</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>            <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(current-&gt;<a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143">right</a>);</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        }</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    }</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    reverse(result.begin(), result.end());</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span> </div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>}</div>
+</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span> </div>
+<div class="foldopen" id="foldopen00164" data-start="{" data-end="}">
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"><a class="line" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499">  164</a></span>std::vector&lt;int64_t&gt; <a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499">BinaryTree::inOrderIterative</a>(<a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *root) {</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    std::stack&lt;Node *&gt;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;  </div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    std::vector&lt;int64_t&gt; result;  </div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span> </div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *current = root;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span> </div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    <span class="keywordflow">while</span> (!<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.empty() || current) {</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>        <span class="keywordflow">while</span> (current) {</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>            <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(current);</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>            current = current-&gt;<a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e">left</a>;</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        }</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        current = <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">top</a>();</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>();</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        result.push_back(current-&gt;<a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f">data</a>);</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        current = current-&gt;<a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143">right</a>;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    }</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>}</div>
+</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span><span class="keywordtype">void</span> deleteAll(<a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *root) {</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    <span class="keywordflow">if</span> (root) {</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        std::stack&lt;Node *&gt; <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(root);</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span> </div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>        <span class="keywordflow">while</span> (!<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.empty()) {</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>            <span class="keyword">const</span> <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *current = <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">top</a>();</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>            <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>();</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span> </div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>            <span class="keywordflow">if</span> (current-&gt;<a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143">right</a>) {</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>                <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(current-&gt;<a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143">right</a>);</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>            }</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>            <span class="keywordflow">if</span> (current-&gt;<a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e">left</a>) {</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>                <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(current-&gt;<a class="code hl_variable" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e">left</a>);</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>            }</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>            <span class="keyword">delete</span> current;</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        }</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    }</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>}</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>}  <span class="comment">// namespace iterative_tree_traversals</span></div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>}  <span class="comment">// namespace others</span></div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span> </div>
+<div class="foldopen" id="foldopen00210" data-start="{" data-end="}">
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"><a class="line" href="../../d8/d90/iterative__tree__traversals_8cpp.html#a21d922dbb5905993960c6a7f0ba71ac0">  210</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>(<a class="code hl_class" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree,</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>                  <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root) {</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    std::vector&lt;int64_t&gt; actual_result{1, 2, 4, 5, 3};</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    std::vector&lt;int64_t&gt;</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>        result;  </div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span> </div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    <span class="comment">// Calling preOrderIterative() function by passing a root node,</span></div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    <span class="comment">// and storing the preorder traversal in result.</span></div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    result = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae">preOrderIterative</a>(root);</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span> </div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    <span class="comment">// Self-testing the result using `assert`</span></div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; result.size(); i++) {</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>        assert(actual_result[i] == result[i]);</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    }</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span> </div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    <span class="comment">// Printing the result storing preorder.</span></div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPreOrder Traversal Is : &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : result) {</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    }</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>}</div>
+</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span> </div>
+<div class="foldopen" id="foldopen00237" data-start="{" data-end="}">
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"><a class="line" href="../../d8/d90/iterative__tree__traversals_8cpp.html#ac35ae2868441f8a11c965b87b2494f21">  237</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>(<a class="code hl_class" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree,</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>                  <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root) {</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    std::vector&lt;int64_t&gt; actual_result{4, 5, 2, 3, 1};</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    std::vector&lt;int64_t&gt;</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>        result;  </div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span> </div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    <span class="comment">// Calling postOrderIterative() function by passing a root node,</span></div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    <span class="comment">// and storing the postorder traversal in result.</span></div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    result = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25">postOrderIterative</a>(root);</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span> </div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    <span class="comment">// Self-testing the result using `assert`</span></div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; result.size(); i++) {</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>        assert(actual_result[i] == result[i]);</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    }</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span> </div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    <span class="comment">// Printing the result storing postorder.</span></div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPostOrder Traversal Is : &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : result) {</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    }</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>}</div>
+</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span> </div>
+<div class="foldopen" id="foldopen00264" data-start="{" data-end="}">
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"><a class="line" href="../../d8/d90/iterative__tree__traversals_8cpp.html#a425c4c8520991999ee6dbe13d99b87f4">  264</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a>(<a class="code hl_class" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree,</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>                  <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root) {</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>    std::vector&lt;int64_t&gt; actual_result{4, 2, 5, 1, 3};</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>    std::vector&lt;int64_t&gt;</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>        result;  </div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span> </div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    <span class="comment">// Calling inOrderIterative() function by passing a root node,</span></div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    <span class="comment">// and storing the inorder traversal in result.</span></div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    result = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499">inOrderIterative</a>(root);</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span> </div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>    <span class="comment">// Self-testing the result using `assert`</span></div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; result.size(); i++) {</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>        assert(actual_result[i] == result[i]);</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>    }</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span> </div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>    <span class="comment">// Printing the result storing inorder.</span></div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nInOrder Traversal Is : &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : result) {</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    }</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>}</div>
+</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span> </div>
+<div class="foldopen" id="foldopen00291" data-start="{" data-end="}">
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"><a class="line" href="../../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2">  291</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2">test4</a>(<a class="code hl_class" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree,</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>                  <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root) {</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>    std::vector&lt;int64_t&gt; actual_result{-1, -2, -4, -5, -3};</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>    std::vector&lt;int64_t&gt;</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>        result;  </div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span> </div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>    <span class="comment">// Calling preOrderIterative() function by passing a root node,</span></div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>    <span class="comment">// and storing the preorder traversal in result.</span></div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>    result = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae">preOrderIterative</a>(root);</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span> </div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>    <span class="comment">// Self-testing the result using `assert`</span></div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; result.size(); i++) {</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>        assert(actual_result[i] == result[i]);</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>    }</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span> </div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>    <span class="comment">// Printing the result storing preorder.</span></div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPreOrder Traversal Is : &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : result) {</div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>    }</div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>}</div>
+</div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span> </div>
+<div class="foldopen" id="foldopen00319" data-start="{" data-end="}">
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"><a class="line" href="../../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8">  319</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8">test5</a>(<a class="code hl_class" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree,</div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>                  <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root) {</div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>    std::vector&lt;int64_t&gt; actual_result{-4, -5, -2, -3, -1};</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>    std::vector&lt;int64_t&gt;</div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>        result;  </div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span> </div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>    <span class="comment">// Calling postOrderIterative() function by passing a root node,</span></div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>    <span class="comment">// and storing the postorder traversal in result.</span></div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>    result = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25">postOrderIterative</a>(root);</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span> </div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>    <span class="comment">// Self-testing the result using `assert`</span></div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; result.size(); i++) {</div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>        assert(actual_result[i] == result[i]);</div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>    }</div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span> </div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>    <span class="comment">// Printing the result storing postorder.</span></div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPostOrder Traversal Is : &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : result) {</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>    }</div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>}</div>
+</div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span> </div>
+<div class="foldopen" id="foldopen00346" data-start="{" data-end="}">
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"><a class="line" href="../../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89">  346</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89">test6</a>(<a class="code hl_class" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a> binaryTree,</div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>                  <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root) {</div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>    std::vector&lt;int64_t&gt; actual_result{-4, -2, -5, -1, -3};</div>
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>    std::vector&lt;int64_t&gt;</div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>        result;  </div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span> </div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>    <span class="comment">// Calling inOrderIterative() function by passing a root node,</span></div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>    <span class="comment">// and storing the inorder traversal in result.</span></div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>    result = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499">inOrderIterative</a>(root);</div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span> </div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>    <span class="comment">// Self-testing the result using `assert`</span></div>
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; result.size(); i++) {</div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>        assert(actual_result[i] == result[i]);</div>
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>    }</div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span> </div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>    <span class="comment">// Printing the result storing inorder.</span></div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nInOrder Traversal Is : &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : result) {</div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;</div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>    }</div>
+<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>}</div>
+</div>
+<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span> </div>
+<div class="foldopen" id="foldopen00372" data-start="{" data-end="}">
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"><a class="line" href="../../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  372</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>    <span class="comment">// Creating a tree with the following structure,</span></div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>    <span class="comment">/*</span></div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span><span class="comment">              1</span></div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span><span class="comment">            /   \</span></div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span><span class="comment">           2     3</span></div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span><span class="comment">         /   \</span></div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span><span class="comment">        4     5</span></div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span><span class="comment">    */</span></div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span> </div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>    <a class="code hl_class" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a></div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>        binaryTree;  </div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>    <a class="code hl_struct" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a> *root = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(1);</div>
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>    root-&gt;left = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(2);</div>
+<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>    root-&gt;right = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(3);</div>
+<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>    root-&gt;left-&gt;left = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(4);</div>
+<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>    root-&gt;left-&gt;right = binaryTree.<a class="code hl_function" href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a>(5);</div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span> </div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n| Tests for positive data value |&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>    <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>(binaryTree, root);  <span class="comment">// run preorder-iterative test</span></div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPre-order test Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span> </div>
+<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>    <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>(binaryTree, root);  <span class="comment">// run postorder-iterative test</span></div>
+<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPost-order test Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span> </div>
+<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>    <a class="code hl_function" href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a>(binaryTree, root);  <span class="comment">// run inorder-iterative test</span></div>
+<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nIn-order test Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span> </div>
+<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>    <span class="comment">// Modifying tree for negative values.</span></div>
+<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>    root-&gt;data = -1;</div>
+<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>    root-&gt;left-&gt;data = -2;</div>
+<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>    root-&gt;right-&gt;data = -3;</div>
+<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span>    root-&gt;left-&gt;left-&gt;data = -4;</div>
+<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>    root-&gt;left-&gt;right-&gt;data = -5;</div>
+<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span> </div>
+<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n| Tests for negative data values |&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>    <a class="code hl_function" href="../../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2">test4</a>(binaryTree, root);  <span class="comment">// run preorder-iterative test on negative values</span></div>
+<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPre-order test on-negative value Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span> </div>
+<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>    <a class="code hl_function" href="../../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8">test5</a>(binaryTree, root);  <span class="comment">// run postorder-iterative test on negative values</span></div>
+<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPost-order test on-negative value Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span> </div>
+<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>    <a class="code hl_function" href="../../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89">test6</a>(binaryTree, root);  <span class="comment">// run inorder-iterative test on negative values</span></div>
+<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nIn-order test on-negative value Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span> </div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>    deleteAll(root);</div>
+<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span> </div>
+<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>}</div>
+</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">others::iterative_tree_traversals::BinaryTree</a></div><div class="ttdoc">defines the functions associated with the binary tree</div><div class="ttdef"><b>Definition</b> <a href="#l00067">iterative_tree_traversals.cpp:67</a></div></div>
+<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_a0c33f2c1a3a3deb486a1c33ee5239499"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499">others::iterative_tree_traversals::BinaryTree::inOrderIterative</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; inOrderIterative(Node *)</div><div class="ttdoc">inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul...</div><div class="ttdef"><b>Definition</b> <a href="#l00164">iterative_tree_traversals.cpp:164</a></div></div>
+<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_a3078a5ccf45d6a7031dcf46e43de65b6"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6">others::iterative_tree_traversals::BinaryTree::createNewNode</a></div><div class="ttdeci">Node * createNewNode(int64_t)</div><div class="ttdoc">function that will create new node for insertion.</div><div class="ttdef"><b>Definition</b> <a href="#l00088">iterative_tree_traversals.cpp:88</a></div></div>
+<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_a636a07c90b7f312bb86d2ec104efca25"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25">others::iterative_tree_traversals::BinaryTree::postOrderIterative</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; postOrderIterative(Node *)</div><div class="ttdoc">postOrderIterative() function that will perform the postorder traversal iteratively,...</div><div class="ttdef"><b>Definition</b> <a href="#l00132">iterative_tree_traversals.cpp:132</a></div></div>
+<div class="ttc" id="aclassothers_1_1iterative__tree__traversals_1_1_binary_tree_html_ad4c6a8e67fb8267a65439b035666b5ae"><div class="ttname"><a href="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae">others::iterative_tree_traversals::BinaryTree::preOrderIterative</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; preOrderIterative(Node *)</div><div class="ttdoc">preOrderIterative() function that will perform the preorder traversal iteratively,...</div><div class="ttdef"><b>Definition</b> <a href="#l00102">iterative_tree_traversals.cpp:102</a></div></div>
+<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00019">stack.hpp:19</a></div></div>
+<div class="ttc" id="aclassstack_html_a3647fb4418890f19e0dc414b8092b8b0"><div class="ttname"><a href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00062">stack.hpp:62</a></div></div>
+<div class="ttc" id="aclassstack_html_a90df277532c23519aa7ac3c08ed90a1d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack::push</a></div><div class="ttdeci">void push(const value_type &amp;item)</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00047">stack.hpp:47</a></div></div>
+<div class="ttc" id="aclassstack_html_ae09630c4384903d187801921b2ddc709"><div class="ttname"><a href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">stack::top</a></div><div class="ttdeci">value_type top() const</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00056">stack.hpp:56</a></div></div>
+<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00187">dsu_path_compression.cpp:187</a></div></div>
+<div class="ttc" id="adsu__path__compression_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-test implementations, 1st test.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00170">dsu_path_compression.cpp:170</a></div></div>
+<div class="ttc" id="ahamiltons__cycle_8cpp_html_a0cc94918b6831f308d4fe4fa27f08299"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a></div><div class="ttdeci">static void test3()</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d0c/hamiltons__cycle_8cpp_source.html#l00122">hamiltons_cycle.cpp:122</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="aiterative__tree__traversals_8cpp_html_a038b236fe900f7bb7e57164f5bed66c2"><div class="ttname"><a href="../../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2">test4</a></div><div class="ttdeci">static void test4(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed preorder with the actual preorder on negative value.</div><div class="ttdef"><b>Definition</b> <a href="#l00291">iterative_tree_traversals.cpp:291</a></div></div>
+<div class="ttc" id="aiterative__tree__traversals_8cpp_html_aa9ef334cd7eb607f4eb8732566ea00b8"><div class="ttname"><a href="../../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8">test5</a></div><div class="ttdeci">static void test5(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed postorder with the actual postorder on negative value.</div><div class="ttdef"><b>Definition</b> <a href="#l00319">iterative_tree_traversals.cpp:319</a></div></div>
+<div class="ttc" id="aiterative__tree__traversals_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00372">iterative_tree_traversals.cpp:372</a></div></div>
+<div class="ttc" id="aiterative__tree__traversals_8cpp_html_af727f920064f2b8f484b589b60d49b89"><div class="ttname"><a href="../../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89">test6</a></div><div class="ttdeci">static void test6(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root)</div><div class="ttdoc">Test the computed inorder with the actual inorder on negative value.</div><div class="ttdef"><b>Definition</b> <a href="#l00346">iterative_tree_traversals.cpp:346</a></div></div>
+<div class="ttc" id="anamespaceiterative__tree__traversals_html"><div class="ttname"><a href="../../dd/d73/namespaceiterative__tree__traversals.html">iterative_tree_traversals</a></div><div class="ttdoc">Functions for the Traversal of the Tree algorithm.</div></div>
+<div class="ttc" id="anamespaceothers_html"><div class="ttname"><a href="../../d0/d6f/namespaceothers.html">others</a></div><div class="ttdoc">for vector</div></div>
+<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00020">paranthesis_matching.cpp:20</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+<div class="ttc" id="astructothers_1_1iterative__tree__traversals_1_1_node_html"><div class="ttname"><a href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">others::iterative_tree_traversals::Node</a></div><div class="ttdoc">defines the structure of a node of the tree</div><div class="ttdef"><b>Definition</b> <a href="#l00058">iterative_tree_traversals.cpp:58</a></div></div>
+<div class="ttc" id="astructothers_1_1iterative__tree__traversals_1_1_node_html_a1dbaeff928e469a05251879568515b8e"><div class="ttname"><a href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e">others::iterative_tree_traversals::Node::left</a></div><div class="ttdeci">struct Node * left</div><div class="ttdoc">struct pointer to left subtree.</div><div class="ttdef"><b>Definition</b> <a href="#l00060">iterative_tree_traversals.cpp:60</a></div></div>
+<div class="ttc" id="astructothers_1_1iterative__tree__traversals_1_1_node_html_ad443d44275337b9e361375ce66f1104f"><div class="ttname"><a href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f">others::iterative_tree_traversals::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The value/key of the node.</div><div class="ttdef"><b>Definition</b> <a href="#l00059">iterative_tree_traversals.cpp:59</a></div></div>
+<div class="ttc" id="astructothers_1_1iterative__tree__traversals_1_1_node_html_af19e39acfc18b823be9d4879a20e1143"><div class="ttname"><a href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143">others::iterative_tree_traversals::Node::right</a></div><div class="ttdeci">struct Node * right</div><div class="ttdoc">struct pointer to right subtree.</div><div class="ttdef"><b>Definition</b> <a href="#l00061">iterative_tree_traversals.cpp:61</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp.html">iterative_tree_traversals.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/d93/namespacemagic__sequence.html b/d8/d93/namespacemagic__sequence.html
index 326078861..e2bb30bf8 100644
--- a/d8/d93/namespacemagic__sequence.html
+++ b/d8/d93/namespacemagic__sequence.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: magic_sequence Namespace Reference</title>
+<title>TheAlgorithms/C++: magic_sequence Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/d95/vector__ops_8hpp.html b/d8/d95/vector__ops_8hpp.html
index 1a2b6d920..0555cf5f8 100644
--- a/d8/d95/vector__ops_8hpp.html
+++ b/d8/d95/vector__ops_8hpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: machine_learning/vector_ops.hpp File Reference</title>
+<title>TheAlgorithms/C++: machine_learning/vector_ops.hpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -141,75 +158,77 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a84260cb1be9b63d6e38107000ac4b7e7" id="r_a84260cb1be9b63d6e38107000ac4b7e7"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a84260cb1be9b63d6e38107000ac4b7e7"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7">machine_learning::operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; const &amp;A)</td></tr>
+<tr class="memitem:a84260cb1be9b63d6e38107000ac4b7e7"><td class="memTemplItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7">machine_learning::operator&lt;&lt;</a> (std::ostream &amp;out, std::vector&lt; std::valarray&lt; T &gt; &gt; const &amp;A)</td></tr>
 <tr class="separator:a84260cb1be9b63d6e38107000ac4b7e7"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af4986b23760039711848155739c31b35" id="r_af4986b23760039711848155739c31b35"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:af4986b23760039711848155739c31b35"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#af4986b23760039711848155739c31b35">machine_learning::operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; T, T &gt; &amp;A)</td></tr>
+<tr class="memitem:af4986b23760039711848155739c31b35"><td class="memTemplItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#af4986b23760039711848155739c31b35">machine_learning::operator&lt;&lt;</a> (std::ostream &amp;out, const std::pair&lt; T, T &gt; &amp;A)</td></tr>
 <tr class="separator:af4986b23760039711848155739c31b35"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a54bf1f3c43271a5fc93101f6ae2e6269" id="r_a54bf1f3c43271a5fc93101f6ae2e6269"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a54bf1f3c43271a5fc93101f6ae2e6269"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a54bf1f3c43271a5fc93101f6ae2e6269">machine_learning::operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;A)</td></tr>
+<tr class="memitem:a54bf1f3c43271a5fc93101f6ae2e6269"><td class="memTemplItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a54bf1f3c43271a5fc93101f6ae2e6269">machine_learning::operator&lt;&lt;</a> (std::ostream &amp;out, const std::valarray&lt; T &gt; &amp;A)</td></tr>
 <tr class="separator:a54bf1f3c43271a5fc93101f6ae2e6269"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a496302e3371aa7b478cb7d5917904bdd" id="r_a496302e3371aa7b478cb7d5917904bdd"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a496302e3371aa7b478cb7d5917904bdd"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd">machine_learning::insert_element</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;A, const T &amp;ele)</td></tr>
+<tr class="memitem:a496302e3371aa7b478cb7d5917904bdd"><td class="memTemplItemLeft" align="right" valign="top">std::valarray&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd">machine_learning::insert_element</a> (const std::valarray&lt; T &gt; &amp;A, const T &amp;ele)</td></tr>
 <tr class="separator:a496302e3371aa7b478cb7d5917904bdd"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a912cf68863063a38d6e63545be5eb093" id="r_a912cf68863063a38d6e63545be5eb093"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a912cf68863063a38d6e63545be5eb093"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093">machine_learning::pop_front</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;A)</td></tr>
+<tr class="memitem:a912cf68863063a38d6e63545be5eb093"><td class="memTemplItemLeft" align="right" valign="top">std::valarray&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093">machine_learning::pop_front</a> (const std::valarray&lt; T &gt; &amp;A)</td></tr>
 <tr class="separator:a912cf68863063a38d6e63545be5eb093"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae10178b082f0205c326550877d998e5d" id="r_ae10178b082f0205c326550877d998e5d"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ae10178b082f0205c326550877d998e5d"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d">machine_learning::pop_back</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &amp;A)</td></tr>
+<tr class="memitem:ae10178b082f0205c326550877d998e5d"><td class="memTemplItemLeft" align="right" valign="top">std::valarray&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d">machine_learning::pop_back</a> (const std::valarray&lt; T &gt; &amp;A)</td></tr>
 <tr class="separator:ae10178b082f0205c326550877d998e5d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af801bf30591ca6b2c38ff4fed0ded23f" id="r_af801bf30591ca6b2c38ff4fed0ded23f"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:af801bf30591ca6b2c38ff4fed0ded23f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f">machine_learning::equal_shuffle</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;A, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;B)</td></tr>
+<tr class="memitem:af801bf30591ca6b2c38ff4fed0ded23f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f">machine_learning::equal_shuffle</a> (std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;A, std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;B)</td></tr>
 <tr class="separator:af801bf30591ca6b2c38ff4fed0ded23f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:abee7b35403af3612222d3b7a53074905" id="r_abee7b35403af3612222d3b7a53074905"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:abee7b35403af3612222d3b7a53074905"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905">machine_learning::uniform_random_initialization</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;shape, const T &amp;low, const T &amp;high)</td></tr>
+<tr class="memitem:abee7b35403af3612222d3b7a53074905"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905">machine_learning::uniform_random_initialization</a> (std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape, const T &amp;low, const T &amp;high)</td></tr>
 <tr class="separator:abee7b35403af3612222d3b7a53074905"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4" id="r_a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4">machine_learning::unit_matrix_initialization</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;shape)</td></tr>
+<tr class="memitem:a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4">machine_learning::unit_matrix_initialization</a> (std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape)</td></tr>
 <tr class="separator:a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ac1bdaa2a724b4ce6a6bb371a5dbe2e7e" id="r_ac1bdaa2a724b4ce6a6bb371a5dbe2e7e"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ac1bdaa2a724b4ce6a6bb371a5dbe2e7e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e">machine_learning::zeroes_initialization</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;shape)</td></tr>
+<tr class="memitem:ac1bdaa2a724b4ce6a6bb371a5dbe2e7e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e">machine_learning::zeroes_initialization</a> (std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape)</td></tr>
 <tr class="separator:ac1bdaa2a724b4ce6a6bb371a5dbe2e7e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a6f1c98c016ad34ff3d9f39372161bd35" id="r_a6f1c98c016ad34ff3d9f39372161bd35"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a6f1c98c016ad34ff3d9f39372161bd35"><td class="memTemplItemLeft" align="right" valign="top">T&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A)</td></tr>
+<tr class="memitem:a6f1c98c016ad34ff3d9f39372161bd35"><td class="memTemplItemLeft" align="right" valign="top">T&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</td></tr>
 <tr class="separator:a6f1c98c016ad34ff3d9f39372161bd35"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa4bbf61e65f8cd297255fa94b983d078" id="r_aa4bbf61e65f8cd297255fa94b983d078"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:aa4bbf61e65f8cd297255fa94b983d078"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">machine_learning::get_shape</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A)</td></tr>
+<tr class="memitem:aa4bbf61e65f8cd297255fa94b983d078"><td class="memTemplItemLeft" align="right" valign="top">std::pair&lt; size_t, size_t &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">machine_learning::get_shape</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</td></tr>
 <tr class="separator:aa4bbf61e65f8cd297255fa94b983d078"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ac332d152078e96311e43ac5e7183ea26" id="r_ac332d152078e96311e43ac5e7183ea26"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ac332d152078e96311e43ac5e7183ea26"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26">machine_learning::minmax_scaler</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &gt; &amp;A, const T &amp;low, const T &amp;high)</td></tr>
+<tr class="memitem:ac332d152078e96311e43ac5e7183ea26"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26">machine_learning::minmax_scaler</a> (const std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;A, const T &amp;low, const T &amp;high)</td></tr>
 <tr class="separator:ac332d152078e96311e43ac5e7183ea26"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a50480fccfb39de20ca47f1bf51ecb6ec" id="r_a50480fccfb39de20ca47f1bf51ecb6ec"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a50480fccfb39de20ca47f1bf51ecb6ec"><td class="memTemplItemLeft" align="right" valign="top">size_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">machine_learning::argmax</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A)</td></tr>
+<tr class="memitem:a50480fccfb39de20ca47f1bf51ecb6ec"><td class="memTemplItemLeft" align="right" valign="top">size_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">machine_learning::argmax</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</td></tr>
 <tr class="separator:a50480fccfb39de20ca47f1bf51ecb6ec"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ad0bdc88e5f1be47c46c0f0c8ebf754bb" id="r_ad0bdc88e5f1be47c46c0f0c8ebf754bb"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ad0bdc88e5f1be47c46c0f0c8ebf754bb"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">machine_learning::apply_function</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, T(*func)(const T &amp;))</td></tr>
+<tr class="memitem:ad0bdc88e5f1be47c46c0f0c8ebf754bb"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::valarray&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">machine_learning::apply_function</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, T(*func)(const T &amp;))</td></tr>
 <tr class="separator:ad0bdc88e5f1be47c46c0f0c8ebf754bb"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a16f34574b7e0dd51bc3b3fda37446695" id="r_a16f34574b7e0dd51bc3b3fda37446695"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a16f34574b7e0dd51bc3b3fda37446695"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a16f34574b7e0dd51bc3b3fda37446695">machine_learning::operator*</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const T &amp;val)</td></tr>
+<tr class="memitem:a16f34574b7e0dd51bc3b3fda37446695"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::valarray&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a16f34574b7e0dd51bc3b3fda37446695">machine_learning::operator*</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const T &amp;val)</td></tr>
 <tr class="separator:a16f34574b7e0dd51bc3b3fda37446695"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae6ec42318d172b97fbdf45638d09d7b5" id="r_ae6ec42318d172b97fbdf45638d09d7b5"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ae6ec42318d172b97fbdf45638d09d7b5"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5">machine_learning::operator/</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const T &amp;val)</td></tr>
+<tr class="memitem:ae6ec42318d172b97fbdf45638d09d7b5"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::valarray&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5">machine_learning::operator/</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const T &amp;val)</td></tr>
 <tr class="separator:ae6ec42318d172b97fbdf45638d09d7b5"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a89fde571b38f9483576594f66572958a" id="r_a89fde571b38f9483576594f66572958a"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a89fde571b38f9483576594f66572958a"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a">machine_learning::transpose</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A)</td></tr>
+<tr class="memitem:a89fde571b38f9483576594f66572958a"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::valarray&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a">machine_learning::transpose</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</td></tr>
 <tr class="separator:a89fde571b38f9483576594f66572958a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a2466857dab977a49f117029835b3b6d2" id="r_a2466857dab977a49f117029835b3b6d2"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a2466857dab977a49f117029835b3b6d2"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a2466857dab977a49f117029835b3b6d2">machine_learning::operator+</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;B)</td></tr>
+<tr class="memitem:a2466857dab977a49f117029835b3b6d2"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::valarray&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a2466857dab977a49f117029835b3b6d2">machine_learning::operator+</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</td></tr>
 <tr class="separator:a2466857dab977a49f117029835b3b6d2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a0cc29566568e0383dd7d374068cbe6b3" id="r_a0cc29566568e0383dd7d374068cbe6b3"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a0cc29566568e0383dd7d374068cbe6b3"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a0cc29566568e0383dd7d374068cbe6b3">machine_learning::operator-</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;B)</td></tr>
+<tr class="memitem:a0cc29566568e0383dd7d374068cbe6b3"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::valarray&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a0cc29566568e0383dd7d374068cbe6b3">machine_learning::operator-</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</td></tr>
 <tr class="separator:a0cc29566568e0383dd7d374068cbe6b3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a5342906d42b80fc6b6b3ad17bf00fcb9" id="r_a5342906d42b80fc6b6b3ad17bf00fcb9"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a5342906d42b80fc6b6b3ad17bf00fcb9"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9">machine_learning::multiply</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;B)</td></tr>
+<tr class="memitem:a5342906d42b80fc6b6b3ad17bf00fcb9"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::valarray&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9">machine_learning::multiply</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</td></tr>
 <tr class="separator:a5342906d42b80fc6b6b3ad17bf00fcb9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:acafa3e62b686aebdbad81c4f89913f43" id="r_acafa3e62b686aebdbad81c4f89913f43"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:acafa3e62b686aebdbad81c4f89913f43"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43">machine_learning::hadamard_product</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; T &gt; &gt; &amp;B)</td></tr>
+<tr class="memitem:acafa3e62b686aebdbad81c4f89913f43"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::valarray&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43">machine_learning::hadamard_product</a> (const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</td></tr>
 <tr class="separator:acafa3e62b686aebdbad81c4f89913f43"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Various functions for vectors associated with [NeuralNetwork (aka Multilayer Perceptron)] (<a href="https://en.wikipedia.org/wiki/Multilayer_perceptron">https://en.wikipedia.org/wiki/Multilayer_perceptron</a>). </p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/imdeep2905" target="_blank">Deep Raval</a></dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/d95/vector__ops_8hpp_source.html">vector_ops.hpp</a>.</p>
 </div></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/d8/d95/vector__ops_8hpp_source.html b/d8/d95/vector__ops_8hpp_source.html
index d81f7f911..4a480ec84 100644
--- a/d8/d95/vector__ops_8hpp_source.html
+++ b/d8/d95/vector__ops_8hpp_source.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: machine_learning/vector_ops.hpp Source File</title>
+<title>TheAlgorithms/C++: machine_learning/vector_ops.hpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -107,15 +124,7 @@ $(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','../../'); initRe
   <div class="headertitle"><div class="title">vector_ops.hpp</div></div>
 </div><!--header-->
 <div class="contents">
-<a href="../../d8/d95/vector__ops_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * @file vector_ops.hpp</span></div>
-<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * @author [Deep Raval](https://github.com/imdeep2905)</span></div>
-<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> *</span></div>
-<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * @brief Various functions for vectors associated with [NeuralNetwork (aka</span></div>
-<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> * Multilayer Perceptron)]</span></div>
-<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> * (https://en.wikipedia.org/wiki/Multilayer_perceptron).</span></div>
-<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> *</span></div>
-<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> */</span></div>
+<a href="../../d8/d95/vector__ops_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
 <div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#ifndef VECTOR_OPS_FOR_NN</span></div>
 <div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#define VECTOR_OPS_FOR_NN</span></div>
 <div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
@@ -125,81 +134,52 @@ $(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','../../'); initRe
 <div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;random&gt;</span></div>
 <div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;valarray&gt;</span></div>
 <div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
-<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment"></span> </div>
-<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment"> * @namespace machine_learning</span></div>
-<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"> * @brief Machine Learning algorithms</span></div>
-<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"> */</span></div>
-<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d77/namespacemachine__learning.html">machine_learning</a> {<span class="comment"></span></div>
-<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment"> * Overloaded operator &quot;&lt;&lt;&quot; to print 2D vector</span></div>
-<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment"> * @tparam T typename of the vector</span></div>
-<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment"> * @param out std::ostream to output</span></div>
-<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment"> * @param A 2D vector to be printed</span></div>
-<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d77/namespacemachine__learning.html">machine_learning</a> {</div>
 <div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00032" data-start="{" data-end="}">
-<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7">   32</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7">operator&lt;&lt;</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out,</div>
-<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>                         <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; <span class="keyword">const</span> &amp;A) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7">   32</a></span>std::ostream &amp;<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7">operator&lt;&lt;</a>(std::ostream &amp;out,</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>                         std::vector&lt;std::valarray&lt;T&gt;&gt; <span class="keyword">const</span> &amp;A) {</div>
 <div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="comment">// Setting output precision to 4 in case of floating point numbers</span></div>
-<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    out.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">precision</a>(4);</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    out.precision(4);</div>
 <div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;a : A) {       <span class="comment">// For each row in A</span></div>
 <div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;x : a) {   <span class="comment">// For each element in row</span></div>
-<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; x &lt;&lt; <span class="charliteral">&#39; &#39;</span>;  <span class="comment">// print element</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>            std::cout &lt;&lt; x &lt;&lt; <span class="charliteral">&#39; &#39;</span>;  <span class="comment">// print element</span></div>
 <div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        }</div>
-<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    }</div>
 <div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">return</span> out;</div>
 <div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>}</div>
 </div>
-<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="comment"></span> </div>
-<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="comment"> * Overloaded operator &quot;&lt;&lt;&quot; to print a pair</span></div>
-<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="comment"> * @tparam T typename of the pair</span></div>
-<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="comment"> * @param out std::ostream to output</span></div>
-<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="comment"> * @param A Pair to be printed</span></div>
-<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
 <div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00052" data-start="{" data-end="}">
-<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#af4986b23760039711848155739c31b35">   52</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7">operator&lt;&lt;</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;T, T&gt;</a> &amp;A) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#af4986b23760039711848155739c31b35">   52</a></span>std::ostream &amp;<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7">operator&lt;&lt;</a>(std::ostream &amp;out, <span class="keyword">const</span> std::pair&lt;T, T&gt; &amp;A) {</div>
 <div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="comment">// Setting output precision to 4 in case of floating point numbers</span></div>
-<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    out.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">precision</a>(4);</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    out.precision(4);</div>
 <div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="comment">// printing pair in the form (p, q)</span></div>
-<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; A.first &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; A.second &lt;&lt; <span class="stringliteral">&quot;)&quot;</span>;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; A.first &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; A.second &lt;&lt; <span class="stringliteral">&quot;)&quot;</span>;</div>
 <div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">return</span> out;</div>
 <div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}</div>
 </div>
-<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="comment"></span> </div>
-<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="comment"> * Overloaded operator &quot;&lt;&lt;&quot; to print a 1D vector</span></div>
-<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="comment"> * @tparam T typename of the vector</span></div>
-<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="comment"> * @param out std::ostream to output</span></div>
-<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span><span class="comment"> * @param A 1D vector to be printed</span></div>
-<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
 <div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00067" data-start="{" data-end="}">
-<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a54bf1f3c43271a5fc93101f6ae2e6269">   67</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7">operator&lt;&lt;</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> &amp;A) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a54bf1f3c43271a5fc93101f6ae2e6269">   67</a></span>std::ostream &amp;<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7">operator&lt;&lt;</a>(std::ostream &amp;out, <span class="keyword">const</span> std::valarray&lt;T&gt; &amp;A) {</div>
 <div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="comment">// Setting output precision to 4 in case of floating point numbers</span></div>
-<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    out.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">precision</a>(4);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    out.precision(4);</div>
 <div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;a : A) {   <span class="comment">// For every element in the vector.</span></div>
-<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; a &lt;&lt; <span class="charliteral">&#39; &#39;</span>;  <span class="comment">// Print element</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        std::cout &lt;&lt; a &lt;&lt; <span class="charliteral">&#39; &#39;</span>;  <span class="comment">// Print element</span></div>
 <div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    }</div>
-<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keywordflow">return</span> out;</div>
 <div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>}</div>
 </div>
-<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="comment"></span> </div>
-<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span><span class="comment"> * Function to insert element into 1D vector</span></div>
-<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span><span class="comment"> * @tparam T typename of the 1D vector and the element</span></div>
-<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span><span class="comment"> * @param A 1D vector in which element will to be inserted</span></div>
-<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span><span class="comment"> * @param ele element to be inserted</span></div>
-<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span><span class="comment"> * @return new resultant vector</span></div>
-<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
 <div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00085" data-start="{" data-end="}">
-<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd">   85</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd">insert_element</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> &amp;A, <span class="keyword">const</span> T &amp;ele) {</div>
-<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> B;      <span class="comment">// New 1D vector to store resultant vector</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd">   85</a></span>std::valarray&lt;T&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd">insert_element</a>(<span class="keyword">const</span> std::valarray&lt;T&gt; &amp;A, <span class="keyword">const</span> T &amp;ele) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    std::valarray&lt;T&gt; B;      <span class="comment">// New 1D vector to store resultant vector</span></div>
 <div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    B.resize(A.size() + 1);  <span class="comment">// Resizing it accordingly</span></div>
 <div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.size(); i++) {  <span class="comment">// For every element in A</span></div>
 <div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        B[i] = A[i];                         <span class="comment">// Copy element in B</span></div>
@@ -208,17 +188,11 @@ $(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','../../'); initRe
 <div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keywordflow">return</span> B;               <span class="comment">// Return resultant vector</span></div>
 <div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>}</div>
 </div>
-<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span><span class="comment"></span> </div>
-<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span><span class="comment"> * Function to remove first element from 1D vector</span></div>
-<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span><span class="comment"> * @tparam T typename of the vector</span></div>
-<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span><span class="comment"> * @param A 1D vector from which first element will be removed</span></div>
-<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span><span class="comment"> * @return new resultant vector</span></div>
-<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
 <div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00102" data-start="{" data-end="}">
-<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093">  102</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093">pop_front</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> &amp;A) {</div>
-<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> B;      <span class="comment">// New 1D vector to store resultant vector</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093">  102</a></span>std::valarray&lt;T&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093">pop_front</a>(<span class="keyword">const</span> std::valarray&lt;T&gt; &amp;A) {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    std::valarray&lt;T&gt; B;      <span class="comment">// New 1D vector to store resultant vector</span></div>
 <div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    B.resize(A.size() - 1);  <span class="comment">// Resizing it accordingly</span></div>
 <div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 1; i &lt; A.size();</div>
 <div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>         i++) {           <span class="comment">// // For every (except first) element in A</span></div>
@@ -227,17 +201,11 @@ $(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','../../'); initRe
 <div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="keywordflow">return</span> B;  <span class="comment">// Return resultant vector</span></div>
 <div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>}</div>
 </div>
-<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span><span class="comment"></span> </div>
-<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span><span class="comment"> * Function to remove last element from 1D vector</span></div>
-<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span><span class="comment"> * @tparam T typename of the vector</span></div>
-<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span><span class="comment"> * @param A 1D vector from which last element will be removed</span></div>
-<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span><span class="comment"> * @return new resultant vector</span></div>
-<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
 <div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00119" data-start="{" data-end="}">
-<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d">  119</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d">pop_back</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> &amp;A) {</div>
-<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> B;      <span class="comment">// New 1D vector to store resultant vector</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d">  119</a></span>std::valarray&lt;T&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d">pop_back</a>(<span class="keyword">const</span> std::valarray&lt;T&gt; &amp;A) {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    std::valarray&lt;T&gt; B;      <span class="comment">// New 1D vector to store resultant vector</span></div>
 <div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    B.resize(A.size() - 1);  <span class="comment">// Resizing it accordingly</span></div>
 <div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.size() - 1;</div>
 <div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>         i++) {       <span class="comment">// For every (except last) element in A</span></div>
@@ -246,57 +214,43 @@ $(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','../../'); initRe
 <div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <span class="keywordflow">return</span> B;  <span class="comment">// Return resultant vector</span></div>
 <div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>}</div>
 </div>
-<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span><span class="comment"></span> </div>
-<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span><span class="comment"> * Function to equally shuffle two 3D vectors (used for shuffling training data)</span></div>
-<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span><span class="comment"> * @tparam T typename of the vector</span></div>
-<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span><span class="comment"> * @param A First 3D vector</span></div>
-<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span><span class="comment"> * @param B Second 3D vector</span></div>
-<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
 <div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00136" data-start="{" data-end="}">
-<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f">  136</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f">equal_shuffle</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt;&gt; &amp;A,</div>
-<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>                   <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt;&gt; &amp;B) {</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f">  136</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f">equal_shuffle</a>(std::vector&lt;std::vector&lt;std::valarray&lt;T&gt;&gt;&gt; &amp;A,</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>                   std::vector&lt;std::vector&lt;std::valarray&lt;T&gt;&gt;&gt; &amp;B) {</div>
 <div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <span class="comment">// If two vectors have different sizes</span></div>
 <div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <span class="keywordflow">if</span> (A.size() != B.size()) {</div>
-<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        std::cerr</div>
 <div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>            &lt;&lt; <span class="stringliteral">&quot;Can not equally shuffle two vectors with different sizes: &quot;</span>;</div>
-<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; A.size() &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; B.size() &lt;&lt; <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"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        std::cerr &lt;&lt; A.size() &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; B.size() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        std::exit(EXIT_FAILURE);</div>
 <div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    }</div>
 <div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.size(); i++) {  <span class="comment">// For every element in A and B</span></div>
 <div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        <span class="comment">// Genrating random index &lt; size of A and B</span></div>
-<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html">std::chrono::system_clock::now</a>().time_since_epoch().count());</div>
-<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        <span class="keywordtype">size_t</span> random_index = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % A.size();</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        std::srand(std::chrono::system_clock::now().time_since_epoch().count());</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        <span class="keywordtype">size_t</span> random_index = std::rand() % A.size();</div>
 <div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>        <span class="comment">// Swap elements in both A and B with same random index</span></div>
-<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(A[i], A[random_index]);</div>
-<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(B[i], B[random_index]);</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>        std::swap(A[i], A[random_index]);</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>        std::swap(B[i], B[random_index]);</div>
 <div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    }</div>
 <div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <span class="keywordflow">return</span>;</div>
 <div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>}</div>
 </div>
-<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span><span class="comment"></span> </div>
-<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span><span class="comment"> * Function to initialize given 2D vector using uniform random initialization</span></div>
-<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span><span class="comment"> * @tparam T typename of the vector</span></div>
-<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span><span class="comment"> * @param A 2D vector to be initialized</span></div>
-<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span><span class="comment"> * @param shape required shape</span></div>
-<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span><span class="comment"> * @param low lower limit on value</span></div>
-<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span><span class="comment"> * @param high upper limit on value</span></div>
-<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span> </div>
 <div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00166" data-start="{" data-end="}">
-<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905">  166</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905">uniform_random_initialization</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; &amp;A,</div>
-<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>                                   <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;size_t, size_t&gt;</a> &amp;shape,</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905">  166</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905">uniform_random_initialization</a>(std::vector&lt;std::valarray&lt;T&gt;&gt; &amp;A,</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>                                   <span class="keyword">const</span> std::pair&lt;size_t, size_t&gt; &amp;shape,</div>
 <div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>                                   <span class="keyword">const</span> T &amp;low, <span class="keyword">const</span> T &amp;high) {</div>
 <div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    A.clear();  <span class="comment">// Making A empty</span></div>
 <div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    <span class="comment">// Uniform distribution in range [low, high]</span></div>
-<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random.html">std::default_random_engine</a> generator(</div>
-<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html">std::chrono::system_clock::now</a>().time_since_epoch().count());</div>
-<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution.html">std::uniform_real_distribution&lt;T&gt;</a> distribution(low, high);</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    std::default_random_engine generator(</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>        std::chrono::system_clock::now().time_since_epoch().count());</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    std::uniform_real_distribution&lt;T&gt; distribution(low, high);</div>
 <div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; shape.first; i++) {  <span class="comment">// For every row</span></div>
-<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a></div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        std::valarray&lt;T&gt;</div>
 <div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>            row;  <span class="comment">// Making empty row which will be inserted in vector</span></div>
 <div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        row.resize(shape.second);</div>
 <div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;r : row) {             <span class="comment">// For every element in row</span></div>
@@ -307,20 +261,14 @@ $(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','../../'); initRe
 <div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    <span class="keywordflow">return</span>;</div>
 <div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>}</div>
 </div>
-<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span><span class="comment"></span> </div>
-<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span><span class="comment"> * Function to Intialize 2D vector as unit matrix</span></div>
-<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span><span class="comment"> * @tparam T typename of the vector</span></div>
-<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span><span class="comment"> * @param A 2D vector to be initialized</span></div>
-<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span><span class="comment"> * @param shape required shape</span></div>
-<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span> </div>
 <div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00193" data-start="{" data-end="}">
-<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4">  193</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4">unit_matrix_initialization</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; &amp;A,</div>
-<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>                                <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;size_t, size_t&gt;</a> &amp;shape) {</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4">  193</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4">unit_matrix_initialization</a>(std::vector&lt;std::valarray&lt;T&gt;&gt; &amp;A,</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>                                <span class="keyword">const</span> std::pair&lt;size_t, size_t&gt; &amp;shape) {</div>
 <div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    A.clear();  <span class="comment">// Making A empty</span></div>
 <div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; shape.first; i++) {</div>
-<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a></div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>        std::valarray&lt;T&gt;</div>
 <div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>            row;  <span class="comment">// Making empty row which will be inserted in vector</span></div>
 <div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        row.resize(shape.second);</div>
 <div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>        row[i] = T(1);     <span class="comment">// Insert 1 at ith position</span></div>
@@ -329,20 +277,14 @@ $(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','../../'); initRe
 <div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    <span class="keywordflow">return</span>;</div>
 <div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>}</div>
 </div>
-<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span><span class="comment"></span> </div>
-<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span><span class="comment"> * Function to Intialize 2D vector as zeroes</span></div>
-<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span><span class="comment"> * @tparam T typename of the vector</span></div>
-<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span><span class="comment"> * @param A 2D vector to be initialized</span></div>
-<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span><span class="comment"> * @param shape required shape</span></div>
-<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span> </div>
 <div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00213" data-start="{" data-end="}">
-<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e">  213</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e">zeroes_initialization</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; &amp;A,</div>
-<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>                           <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;size_t, size_t&gt;</a> &amp;shape) {</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e">  213</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e">zeroes_initialization</a>(std::vector&lt;std::valarray&lt;T&gt;&gt; &amp;A,</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>                           <span class="keyword">const</span> std::pair&lt;size_t, size_t&gt; &amp;shape) {</div>
 <div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    A.clear();  <span class="comment">// Making A empty</span></div>
 <div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; shape.first; i++) {</div>
-<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a></div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>        std::valarray&lt;T&gt;</div>
 <div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>            row;  <span class="comment">// Making empty row which will be inserted in vector</span></div>
 <div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>        row.resize(shape.second);  <span class="comment">// By default all elements are zero</span></div>
 <div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>        A.push_back(row);          <span class="comment">// Insert new row in vector</span></div>
@@ -350,16 +292,10 @@ $(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','../../'); initRe
 <div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    <span class="keywordflow">return</span>;</div>
 <div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>}</div>
 </div>
-<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span><span class="comment"></span> </div>
-<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span><span class="comment"> * Function to get sum of all elements in 2D vector</span></div>
-<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span><span class="comment"> * @tparam T typename of the vector</span></div>
-<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span><span class="comment"> * @param A 2D vector for which sum is required</span></div>
-<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span><span class="comment"> * @return returns sum of all elements of 2D vector</span></div>
-<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span> </div>
 <div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00232" data-start="{" data-end="}">
-<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">  232</a></span>T <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; &amp;A) {</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">  232</a></span>T <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a>(<span class="keyword">const</span> std::vector&lt;std::valarray&lt;T&gt;&gt; &amp;A) {</div>
 <div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    T cur_sum = 0;             <span class="comment">// Initially sum is zero</span></div>
 <div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;a : A) {  <span class="comment">// For every row in A</span></div>
 <div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>        cur_sum += a.sum();    <span class="comment">// Add sum of that row to current sum</span></div>
@@ -367,62 +303,48 @@ $(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','../../'); initRe
 <div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    <span class="keywordflow">return</span> cur_sum;  <span class="comment">// Return sum</span></div>
 <div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>}</div>
 </div>
-<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span><span class="comment"></span> </div>
-<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span><span class="comment"> * Function to get shape of given 2D vector</span></div>
-<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span><span class="comment"> * @tparam T typename of the vector</span></div>
-<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span><span class="comment"> * @param A 2D vector for which shape is required</span></div>
-<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span><span class="comment"> * @return shape as pair</span></div>
-<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span> </div>
 <div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00247" data-start="{" data-end="}">
-<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">  247</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;size_t, size_t&gt;</a> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; &amp;A) {</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">  247</a></span>std::pair&lt;size_t, size_t&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(<span class="keyword">const</span> std::vector&lt;std::valarray&lt;T&gt;&gt; &amp;A) {</div>
 <div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> sub_size = (*A.begin()).size();</div>
 <div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;a : A) {</div>
 <div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>        <span class="comment">// If supplied vector don&#39;t have same shape in all rows</span></div>
 <div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>        <span class="keywordflow">if</span> (a.size() != sub_size) {</div>
-<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Supplied vector is not 2D Matrix&quot;</span> &lt;&lt; <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"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Supplied vector is not 2D Matrix&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>            std::exit(EXIT_FAILURE);</div>
 <div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>        }</div>
 <div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    }</div>
-<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(A.size(), sub_size);  <span class="comment">// Return shape as pair</span></div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    <span class="keywordflow">return</span> std::make_pair(A.size(), sub_size);  <span class="comment">// Return shape as pair</span></div>
 <div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>}</div>
 </div>
-<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span><span class="comment"></span> </div>
-<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span><span class="comment"> * Function to scale given 3D vector using min-max scaler</span></div>
-<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span><span class="comment"> * @tparam T typename of the vector</span></div>
-<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span><span class="comment"> * @param A 3D vector which will be scaled</span></div>
-<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span><span class="comment"> * @param low new minimum value</span></div>
-<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span><span class="comment"> * @param high new maximum value</span></div>
-<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span><span class="comment"> * @return new scaled 3D vector</span></div>
-<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span> </div>
 <div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00269" data-start="{" data-end="}">
-<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26">  269</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::valarray&lt;T&gt;</a>&gt;&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26">minmax_scaler</a>(</div>
-<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt;&gt; &amp;A, <span class="keyword">const</span> T &amp;low,</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26">  269</a></span>std::vector&lt;std::vector&lt;std::valarray&lt;T&gt;&gt;&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26">minmax_scaler</a>(</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    <span class="keyword">const</span> std::vector&lt;std::vector&lt;std::valarray&lt;T&gt;&gt;&gt; &amp;A, <span class="keyword">const</span> T &amp;low,</div>
 <div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    <span class="keyword">const</span> T &amp;high) {</div>
-<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::valarray&lt;T&gt;</a>&gt;&gt; B =</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    std::vector&lt;std::vector&lt;std::valarray&lt;T&gt;&gt;&gt; B =</div>
 <div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>        A;                               <span class="comment">// Copying into new vector B</span></div>
 <div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B[0]);  <span class="comment">// Storing shape of B&#39;s every element</span></div>
 <div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    <span class="comment">// As this function is used for scaling training data vector should be of</span></div>
 <div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>    <span class="comment">// shape (1, X)</span></div>
 <div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>    <span class="keywordflow">if</span> (shape.first != 1) {</div>
-<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>        std::cerr</div>
 <div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>            &lt;&lt; <span class="stringliteral">&quot;Supplied vector is not supported for minmax scaling, shape: &quot;</span>;</div>
-<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; shape &lt;&lt; <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"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>        std::cerr &lt;&lt; shape &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>        std::exit(EXIT_FAILURE);</div>
 <div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    }</div>
 <div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; shape.second; i++) {</div>
 <div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>        T min = B[0][0][i], max = B[0][0][i];</div>
-<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; B.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); j++) {</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; B.size(); j++) {</div>
 <div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>            <span class="comment">// Updating minimum and maximum values</span></div>
-<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>            min = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(min, B[j][0][i]);</div>
-<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>            max = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(max, B[j][0][i]);</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>            min = std::min(min, B[j][0][i]);</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>            max = std::max(max, B[j][0][i]);</div>
 <div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>        }</div>
-<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; B.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); j++) {</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; B.size(); j++) {</div>
 <div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>            <span class="comment">// Applying min-max scaler formula</span></div>
 <div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>            B[j][0][i] =</div>
 <div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>                ((B[j][0][i] - min) / (max - min)) * (high - low) + low;</div>
@@ -431,42 +353,29 @@ $(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','../../'); initRe
 <div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>    <span class="keywordflow">return</span> B;  <span class="comment">// Return new resultant 3D vector</span></div>
 <div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>}</div>
 </div>
-<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span><span class="comment"></span> </div>
-<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span><span class="comment"> * Function to get index of maximum element in 2D vector</span></div>
-<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span><span class="comment"> * @tparam T typename of the vector</span></div>
-<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span><span class="comment"> * @param A 2D vector for which maximum index is required</span></div>
-<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span><span class="comment"> * @return index of maximum element</span></div>
-<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span> </div>
 <div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00307" data-start="{" data-end="}">
-<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">  307</a></span><span class="keywordtype">size_t</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">argmax</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; &amp;A) {</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">  307</a></span><span class="keywordtype">size_t</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">argmax</a>(<span class="keyword">const</span> std::vector&lt;std::valarray&lt;T&gt;&gt; &amp;A) {</div>
 <div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
 <div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>    <span class="comment">// As this function is used on predicted (or target) vector, shape should be</span></div>
 <div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>    <span class="comment">// (1, X)</span></div>
 <div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>    <span class="keywordflow">if</span> (shape.first != 1) {</div>
-<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Supplied vector is ineligible for argmax&quot;</span> &lt;&lt; <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"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Supplied vector is ineligible for argmax&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>        std::exit(EXIT_FAILURE);</div>
 <div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>    }</div>
 <div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>    <span class="comment">// Return distance of max element from first element (i.e. index)</span></div>
-<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">std::distance</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(A[0]),</div>
-<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>                         <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">std::max_element</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(A[0]), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(A[0])));</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>    <span class="keywordflow">return</span> std::distance(std::begin(A[0]),</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>                         std::max_element(std::begin(A[0]), std::end(A[0])));</div>
 <div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>}</div>
 </div>
-<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span><span class="comment"></span> </div>
-<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span><span class="comment"> * Function which applys supplied function to every element of 2D vector</span></div>
-<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span><span class="comment"> * @tparam T typename of the vector</span></div>
-<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span><span class="comment"> * @param A 2D vector on which function will be applied</span></div>
-<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span><span class="comment"> * @param func Function to be applied</span></div>
-<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span><span class="comment"> * @return new resultant vector</span></div>
-<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span> </div>
 <div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00329" data-start="{" data-end="}">
-<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">  329</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">apply_function</a>(</div>
-<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; &amp;A, T (*func)(<span class="keyword">const</span> T &amp;)) {</div>
-<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; B =</div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">  329</a></span>std::vector&lt;std::valarray&lt;T&gt;&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">apply_function</a>(</div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>    <span class="keyword">const</span> std::vector&lt;std::valarray&lt;T&gt;&gt; &amp;A, T (*func)(<span class="keyword">const</span> T &amp;)) {</div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; B =</div>
 <div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>        A;                  <span class="comment">// New vector to store resultant vector</span></div>
 <div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;b : B) {     <span class="comment">// For every row in vector</span></div>
 <div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>        b = b.apply(func);  <span class="comment">// Apply function to that row</span></div>
@@ -474,19 +383,12 @@ $(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','../../'); initRe
 <div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>    <span class="keywordflow">return</span> B;  <span class="comment">// Return new resultant 2D vector</span></div>
 <div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>}</div>
 </div>
-<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span><span class="comment"></span> </div>
-<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span><span class="comment"> * Overloaded operator &quot;*&quot; to multiply given 2D vector with scaler</span></div>
-<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span><span class="comment"> * @tparam T typename of both vector and the scaler</span></div>
-<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span><span class="comment"> * @param A 2D vector to which scaler will be multiplied</span></div>
-<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span><span class="comment"> * @param val Scaler value which will be multiplied</span></div>
-<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span><span class="comment"> * @return new resultant vector</span></div>
-<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span> </div>
 <div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00347" data-start="{" data-end="}">
-<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a16f34574b7e0dd51bc3b3fda37446695">  347</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a16f34574b7e0dd51bc3b3fda37446695">operator*</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; &amp;A,</div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a16f34574b7e0dd51bc3b3fda37446695">  347</a></span>std::vector&lt;std::valarray&lt;T&gt;&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a16f34574b7e0dd51bc3b3fda37446695">operator*</a>(<span class="keyword">const</span> std::vector&lt;std::valarray&lt;T&gt;&gt; &amp;A,</div>
 <div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>                                        <span class="keyword">const</span> T &amp;val) {</div>
-<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; B =</div>
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; B =</div>
 <div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>        A;               <span class="comment">// New vector to store resultant vector</span></div>
 <div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;b : B) {  <span class="comment">// For every row in vector</span></div>
 <div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>        b = b * val;     <span class="comment">// Multiply row with scaler</span></div>
@@ -494,19 +396,12 @@ $(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','../../'); initRe
 <div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>    <span class="keywordflow">return</span> B;  <span class="comment">// Return new resultant 2D vector</span></div>
 <div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>}</div>
 </div>
-<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span><span class="comment"></span> </div>
-<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span><span class="comment"> * Overloaded operator &quot;/&quot; to divide given 2D vector with scaler</span></div>
-<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span><span class="comment"> * @tparam T typename of the vector and the scaler</span></div>
-<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span><span class="comment"> * @param A 2D vector to which scaler will be divided</span></div>
-<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span><span class="comment"> * @param val Scaler value which will be divided</span></div>
-<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span><span class="comment"> * @return new resultant vector</span></div>
-<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span> </div>
 <div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00365" data-start="{" data-end="}">
-<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5">  365</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5">operator/</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; &amp;A,</div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5">  365</a></span>std::vector&lt;std::valarray&lt;T&gt;&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5">operator/</a>(<span class="keyword">const</span> std::vector&lt;std::valarray&lt;T&gt;&gt; &amp;A,</div>
 <div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>                                        <span class="keyword">const</span> T &amp;val) {</div>
-<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; B =</div>
+<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; B =</div>
 <div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>        A;               <span class="comment">// New vector to store resultant vector</span></div>
 <div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;b : B) {  <span class="comment">// For every row in vector</span></div>
 <div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>        b = b / val;     <span class="comment">// Divide row with scaler</span></div>
@@ -514,150 +409,116 @@ $(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','../../'); initRe
 <div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>    <span class="keywordflow">return</span> B;  <span class="comment">// Return new resultant 2D vector</span></div>
 <div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>}</div>
 </div>
-<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span><span class="comment"></span> </div>
-<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span><span class="comment"> * Function to get transpose of 2D vector</span></div>
-<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span><span class="comment"> * @tparam T typename of the vector</span></div>
-<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span><span class="comment"> * @param A 2D vector which will be transposed</span></div>
-<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span><span class="comment"> * @return new resultant vector</span></div>
-<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span> </div>
 <div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00382" data-start="{" data-end="}">
-<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a">  382</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a">transpose</a>(</div>
-<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; &amp;A) {</div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a">  382</a></span>std::vector&lt;std::valarray&lt;T&gt;&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a">transpose</a>(</div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>    <span class="keyword">const</span> std::vector&lt;std::valarray&lt;T&gt;&gt; &amp;A) {</div>
 <div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);  <span class="comment">// Current shape of vector</span></div>
-<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt; B;  <span class="comment">// New vector to store result</span></div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>    std::vector&lt;std::valarray&lt;T&gt;&gt; B;  <span class="comment">// New vector to store result</span></div>
 <div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>    <span class="comment">// Storing transpose values of A in B</span></div>
 <div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; shape.second; j++) {</div>
-<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> row;</div>
+<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>        std::valarray&lt;T&gt; row;</div>
 <div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>        row.resize(shape.first);</div>
 <div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; shape.first; i++) {</div>
 <div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>            row[i] = A[i][j];</div>
 <div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>        }</div>
-<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>        B.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(row);</div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>        B.push_back(row);</div>
 <div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>    }</div>
 <div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>    <span class="keywordflow">return</span> B;  <span class="comment">// Return new resultant 2D vector</span></div>
 <div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>}</div>
 </div>
-<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span><span class="comment"></span> </div>
-<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span><span class="comment"> * Overloaded operator &quot;+&quot; to add two 2D vectors</span></div>
-<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span><span class="comment"> * @tparam T typename of the vector</span></div>
-<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span><span class="comment"> * @param A First 2D vector</span></div>
-<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span><span class="comment"> * @param B Second 2D vector</span></div>
-<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span><span class="comment"> * @return new resultant vector</span></div>
-<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span> </div>
 <div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00406" data-start="{" data-end="}">
-<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a2466857dab977a49f117029835b3b6d2">  406</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a2466857dab977a49f117029835b3b6d2">operator+</a>(</div>
-<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; &amp;A,</div>
-<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; &amp;B) {</div>
+<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a2466857dab977a49f117029835b3b6d2">  406</a></span>std::vector&lt;std::valarray&lt;T&gt;&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a2466857dab977a49f117029835b3b6d2">operator+</a>(</div>
+<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>    <span class="keyword">const</span> std::vector&lt;std::valarray&lt;T&gt;&gt; &amp;A,</div>
+<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>    <span class="keyword">const</span> std::vector&lt;std::valarray&lt;T&gt;&gt; &amp;B) {</div>
 <div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
 <div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B);</div>
 <div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>    <span class="comment">// If vectors don&#39;t have equal shape</span></div>
 <div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>    <span class="keywordflow">if</span> (shape_a.first != shape_b.first || shape_a.second != shape_b.second) {</div>
-<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Supplied vectors have different shapes &quot;</span>;</div>
-<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; shape_a &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; shape_b &lt;&lt; <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"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Supplied vectors have different shapes &quot;</span>;</div>
+<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>        std::cerr &lt;&lt; shape_a &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; shape_b &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>        std::exit(EXIT_FAILURE);</div>
 <div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>    }</div>
-<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt; C;</div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>    std::vector&lt;std::valarray&lt;T&gt;&gt; C;</div>
 <div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.size(); i++) {  <span class="comment">// For every row</span></div>
-<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>        C.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(A[i] + B[i]);            <span class="comment">// Elementwise addition</span></div>
+<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>        C.push_back(A[i] + B[i]);            <span class="comment">// Elementwise addition</span></div>
 <div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>    }</div>
 <div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>    <span class="keywordflow">return</span> C;  <span class="comment">// Return new resultant 2D vector</span></div>
 <div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>}</div>
 </div>
-<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span><span class="comment"></span> </div>
-<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span><span class="comment"> * Overloaded operator &quot;-&quot; to add subtract 2D vectors</span></div>
-<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span><span class="comment"> * @tparam T typename of the vector</span></div>
-<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span><span class="comment"> * @param A First 2D vector</span></div>
-<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span><span class="comment"> * @param B Second 2D vector</span></div>
-<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span><span class="comment"> * @return new resultant vector</span></div>
-<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span> </div>
 <div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00433" data-start="{" data-end="}">
-<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a0cc29566568e0383dd7d374068cbe6b3">  433</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a0cc29566568e0383dd7d374068cbe6b3">operator-</a>(</div>
-<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; &amp;A,</div>
-<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; &amp;B) {</div>
+<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a0cc29566568e0383dd7d374068cbe6b3">  433</a></span>std::vector&lt;std::valarray&lt;T&gt;&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a0cc29566568e0383dd7d374068cbe6b3">operator-</a>(</div>
+<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>    <span class="keyword">const</span> std::vector&lt;std::valarray&lt;T&gt;&gt; &amp;A,</div>
+<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>    <span class="keyword">const</span> std::vector&lt;std::valarray&lt;T&gt;&gt; &amp;B) {</div>
 <div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
 <div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B);</div>
 <div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>    <span class="comment">// If vectors don&#39;t have equal shape</span></div>
 <div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>    <span class="keywordflow">if</span> (shape_a.first != shape_b.first || shape_a.second != shape_b.second) {</div>
-<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Supplied vectors have different shapes &quot;</span>;</div>
-<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; shape_a &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; shape_b &lt;&lt; <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"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Supplied vectors have different shapes &quot;</span>;</div>
+<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>        std::cerr &lt;&lt; shape_a &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; shape_b &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>        std::exit(EXIT_FAILURE);</div>
 <div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span>    }</div>
-<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt; C;         <span class="comment">// Vector to store result</span></div>
+<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span>    std::vector&lt;std::valarray&lt;T&gt;&gt; C;         <span class="comment">// Vector to store result</span></div>
 <div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.size(); i++) {  <span class="comment">// For every row</span></div>
-<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span>        C.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(A[i] - B[i]);            <span class="comment">// Elementwise substraction</span></div>
+<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span>        C.push_back(A[i] - B[i]);            <span class="comment">// Elementwise substraction</span></div>
 <div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span>    }</div>
 <div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span>    <span class="keywordflow">return</span> C;  <span class="comment">// Return new resultant 2D vector</span></div>
 <div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span>}</div>
 </div>
-<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span><span class="comment"></span> </div>
-<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span><span class="comment"> * Function to multiply two 2D vectors</span></div>
-<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span><span class="comment"> * @tparam T typename of the vector</span></div>
-<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span><span class="comment"> * @param A First 2D vector</span></div>
-<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span><span class="comment"> * @param B Second 2D vector</span></div>
-<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span><span class="comment"> * @return new resultant vector</span></div>
-<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span> </div>
 <div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00460" data-start="{" data-end="}">
-<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9">  460</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9">multiply</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; &amp;A,</div>
-<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>                                       <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; &amp;B) {</div>
+<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9">  460</a></span>std::vector&lt;std::valarray&lt;T&gt;&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9">multiply</a>(<span class="keyword">const</span> std::vector&lt;std::valarray&lt;T&gt;&gt; &amp;A,</div>
+<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>                                       <span class="keyword">const</span> std::vector&lt;std::valarray&lt;T&gt;&gt; &amp;B) {</div>
 <div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
 <div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B);</div>
 <div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span>    <span class="comment">// If vectors are not eligible for multiplication</span></div>
 <div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span>    <span class="keywordflow">if</span> (shape_a.second != shape_b.first) {</div>
-<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Vectors are not eligible for multiplication &quot;</span>;</div>
-<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; shape_a &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; shape_b &lt;&lt; <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"><a id="l00469" name="l00469"></a><span class="lineno">  469</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Vectors are not eligible for multiplication &quot;</span>;</div>
+<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span>        std::cerr &lt;&lt; shape_a &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; shape_b &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span>        std::exit(EXIT_FAILURE);</div>
 <div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span>    }</div>
-<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt; C;  <span class="comment">// Vector to store result</span></div>
+<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span>    std::vector&lt;std::valarray&lt;T&gt;&gt; C;  <span class="comment">// Vector to store result</span></div>
 <div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>    <span class="comment">// Normal matrix multiplication</span></div>
 <div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; shape_a.first; i++) {</div>
-<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a> row;</div>
+<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span>        std::valarray&lt;T&gt; row;</div>
 <div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span>        row.resize(shape_b.second);</div>
 <div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; shape_b.second; j++) {</div>
 <div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> k = 0; k &lt; shape_a.second; k++) {</div>
 <div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>                row[j] += A[i][k] * B[k][j];</div>
 <div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span>            }</div>
 <div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span>        }</div>
-<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span>        C.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(row);</div>
+<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span>        C.push_back(row);</div>
 <div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>    }</div>
 <div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span>    <span class="keywordflow">return</span> C;  <span class="comment">// Return new resultant 2D vector</span></div>
 <div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span>}</div>
 </div>
-<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span><span class="comment"></span> </div>
-<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span><span class="comment"> * Function to get hadamard product of two 2D vectors</span></div>
-<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span><span class="comment"> * @tparam T typename of the vector</span></div>
-<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span><span class="comment"> * @param A First 2D vector</span></div>
-<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span><span class="comment"> * @param B Second 2D vector</span></div>
-<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span><span class="comment"> * @return new resultant vector</span></div>
-<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span> </div>
 <div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
 <div class="foldopen" id="foldopen00494" data-start="{" data-end="}">
-<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43">  494</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43">hadamard_product</a>(</div>
-<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; &amp;A,</div>
-<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;T&gt;</a>&gt; &amp;B) {</div>
+<div class="line"><a id="l00494" name="l00494"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43">  494</a></span>std::vector&lt;std::valarray&lt;T&gt;&gt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43">hadamard_product</a>(</div>
+<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span>    <span class="keyword">const</span> std::vector&lt;std::valarray&lt;T&gt;&gt; &amp;A,</div>
+<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span>    <span class="keyword">const</span> std::vector&lt;std::valarray&lt;T&gt;&gt; &amp;B) {</div>
 <div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape_a = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(A);</div>
 <div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>    <span class="keyword">const</span> <span class="keyword">auto</span> shape_b = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">get_shape</a>(B);</div>
 <div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>    <span class="comment">// If vectors are not eligible for hadamard product</span></div>
 <div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span>    <span class="keywordflow">if</span> (shape_a.first != shape_b.first || shape_a.second != shape_b.second) {</div>
-<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Vectors have different shapes &quot;</span>;</div>
-<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; shape_a &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; shape_b &lt;&lt; <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"><a id="l00504" name="l00504"></a><span class="lineno">  504</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Vectors have different shapes &quot;</span>;</div>
+<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>        std::cerr &lt;&lt; shape_a &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; shape_b &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span>        std::exit(EXIT_FAILURE);</div>
 <div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span>    }</div>
-<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;T&gt;</a>&gt; C;  <span class="comment">// Vector to store result</span></div>
+<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span>    std::vector&lt;std::valarray&lt;T&gt;&gt; C;  <span class="comment">// Vector to store result</span></div>
 <div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; A.size(); i++) {</div>
-<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>        C.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(A[i] * B[i]);  <span class="comment">// Elementwise multiplication</span></div>
+<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>        C.push_back(A[i] * B[i]);  <span class="comment">// Elementwise multiplication</span></div>
 <div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span>    }</div>
 <div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span>    <span class="keywordflow">return</span> C;  <span class="comment">// Return new resultant 2D vector</span></div>
 <div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span>}</div>
@@ -665,49 +526,27 @@ $(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','../../'); initRe
 <div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span>}  <span class="comment">// namespace machine_learning</span></div>
 <div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span> </div>
 <div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span><span class="preprocessor">#endif</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::ostream</a></div></div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="adistance_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/distance.html">std::distance</a></div><div class="ttdeci">T distance(T... args)</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="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="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(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="amax_element_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">std::max_element</a></div><div class="ttdeci">T max_element(T... args)</div></div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="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="anamespacemachine__learning_html"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></div><div class="ttdoc">A* search algorithm</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a0cc29566568e0383dd7d374068cbe6b3"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a0cc29566568e0383dd7d374068cbe6b3">machine_learning::operator-</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; operator-(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:433</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a16f34574b7e0dd51bc3b3fda37446695"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a16f34574b7e0dd51bc3b3fda37446695">machine_learning::operator*</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; operator*(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const T &amp;val)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:347</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a2466857dab977a49f117029835b3b6d2"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a2466857dab977a49f117029835b3b6d2">machine_learning::operator+</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; operator+(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:406</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a496302e3371aa7b478cb7d5917904bdd"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd">machine_learning::insert_element</a></div><div class="ttdeci">std::valarray&lt; T &gt; insert_element(const std::valarray&lt; T &gt; &amp;A, const T &amp;ele)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:85</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a50480fccfb39de20ca47f1bf51ecb6ec"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">machine_learning::argmax</a></div><div class="ttdeci">size_t argmax(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:307</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a5342906d42b80fc6b6b3ad17bf00fcb9"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9">machine_learning::multiply</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; multiply(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:460</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:232</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a84260cb1be9b63d6e38107000ac4b7e7"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7">machine_learning::operator&lt;&lt;</a></div><div class="ttdeci">std::ostream &amp; operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; std::valarray&lt; T &gt; &gt; const &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:32</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a89fde571b38f9483576594f66572958a"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a">machine_learning::transpose</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; transpose(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:382</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4">machine_learning::unit_matrix_initialization</a></div><div class="ttdeci">void unit_matrix_initialization(std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:193</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a912cf68863063a38d6e63545be5eb093"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093">machine_learning::pop_front</a></div><div class="ttdeci">std::valarray&lt; T &gt; pop_front(const std::valarray&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:102</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_aa4bbf61e65f8cd297255fa94b983d078"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">machine_learning::get_shape</a></div><div class="ttdeci">std::pair&lt; size_t, size_t &gt; get_shape(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:247</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_abee7b35403af3612222d3b7a53074905"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905">machine_learning::uniform_random_initialization</a></div><div class="ttdeci">void uniform_random_initialization(std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape, const T &amp;low, const T &amp;high)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:166</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_ac1bdaa2a724b4ce6a6bb371a5dbe2e7e"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e">machine_learning::zeroes_initialization</a></div><div class="ttdeci">void zeroes_initialization(std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:213</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_ac332d152078e96311e43ac5e7183ea26"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26">machine_learning::minmax_scaler</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; minmax_scaler(const std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;A, const T &amp;low, const T &amp;high)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:269</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_acafa3e62b686aebdbad81c4f89913f43"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43">machine_learning::hadamard_product</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; hadamard_product(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:494</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_ad0bdc88e5f1be47c46c0f0c8ebf754bb"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">machine_learning::apply_function</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; apply_function(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, T(*func)(const T &amp;))</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:329</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_ae10178b082f0205c326550877d998e5d"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d">machine_learning::pop_back</a></div><div class="ttdeci">std::valarray&lt; T &gt; pop_back(const std::valarray&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:119</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_ae6ec42318d172b97fbdf45638d09d7b5"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5">machine_learning::operator/</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; operator/(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const T &amp;val)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:365</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_af801bf30591ca6b2c38ff4fed0ded23f"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f">machine_learning::equal_shuffle</a></div><div class="ttdeci">void equal_shuffle(std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;A, std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:136</div></div>
-<div class="ttc" id="anow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html">std::chrono::system_clock::now</a></div><div class="ttdeci">T now(T... args)</div></div>
-<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
-<div class="ttc" id="aprecision_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">std::ostream::precision</a></div><div class="ttdeci">T precision(T... args)</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-<div class="ttc" id="arandom_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random.html">std::default_random_engine</a></div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-<div class="ttc" id="auniform_real_distribution_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution.html">std::uniform_real_distribution</a></div></div>
-<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></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 class="ttc" id="anamespacemachine__learning_html_a0cc29566568e0383dd7d374068cbe6b3"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a0cc29566568e0383dd7d374068cbe6b3">machine_learning::operator-</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; operator-(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> <a href="#l00433">vector_ops.hpp:433</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a16f34574b7e0dd51bc3b3fda37446695"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a16f34574b7e0dd51bc3b3fda37446695">machine_learning::operator*</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; operator*(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const T &amp;val)</div><div class="ttdef"><b>Definition</b> <a href="#l00347">vector_ops.hpp:347</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a2466857dab977a49f117029835b3b6d2"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a2466857dab977a49f117029835b3b6d2">machine_learning::operator+</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; operator+(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> <a href="#l00406">vector_ops.hpp:406</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a496302e3371aa7b478cb7d5917904bdd"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd">machine_learning::insert_element</a></div><div class="ttdeci">std::valarray&lt; T &gt; insert_element(const std::valarray&lt; T &gt; &amp;A, const T &amp;ele)</div><div class="ttdef"><b>Definition</b> <a href="#l00085">vector_ops.hpp:85</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a50480fccfb39de20ca47f1bf51ecb6ec"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec">machine_learning::argmax</a></div><div class="ttdeci">size_t argmax(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="#l00307">vector_ops.hpp:307</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a5342906d42b80fc6b6b3ad17bf00fcb9"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9">machine_learning::multiply</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; multiply(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> <a href="#l00460">vector_ops.hpp:460</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="#l00232">vector_ops.hpp:232</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a84260cb1be9b63d6e38107000ac4b7e7"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7">machine_learning::operator&lt;&lt;</a></div><div class="ttdeci">std::ostream &amp; operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; std::valarray&lt; T &gt; &gt; const &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="#l00032">vector_ops.hpp:32</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a89fde571b38f9483576594f66572958a"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a">machine_learning::transpose</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; transpose(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="#l00382">vector_ops.hpp:382</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4">machine_learning::unit_matrix_initialization</a></div><div class="ttdeci">void unit_matrix_initialization(std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape)</div><div class="ttdef"><b>Definition</b> <a href="#l00193">vector_ops.hpp:193</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a912cf68863063a38d6e63545be5eb093"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093">machine_learning::pop_front</a></div><div class="ttdeci">std::valarray&lt; T &gt; pop_front(const std::valarray&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="#l00102">vector_ops.hpp:102</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_aa4bbf61e65f8cd297255fa94b983d078"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078">machine_learning::get_shape</a></div><div class="ttdeci">std::pair&lt; size_t, size_t &gt; get_shape(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="#l00247">vector_ops.hpp:247</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_abee7b35403af3612222d3b7a53074905"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905">machine_learning::uniform_random_initialization</a></div><div class="ttdeci">void uniform_random_initialization(std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape, const T &amp;low, const T &amp;high)</div><div class="ttdef"><b>Definition</b> <a href="#l00166">vector_ops.hpp:166</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_ac1bdaa2a724b4ce6a6bb371a5dbe2e7e"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e">machine_learning::zeroes_initialization</a></div><div class="ttdeci">void zeroes_initialization(std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape)</div><div class="ttdef"><b>Definition</b> <a href="#l00213">vector_ops.hpp:213</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_ac332d152078e96311e43ac5e7183ea26"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26">machine_learning::minmax_scaler</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; minmax_scaler(const std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;A, const T &amp;low, const T &amp;high)</div><div class="ttdef"><b>Definition</b> <a href="#l00269">vector_ops.hpp:269</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_acafa3e62b686aebdbad81c4f89913f43"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43">machine_learning::hadamard_product</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; hadamard_product(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> <a href="#l00494">vector_ops.hpp:494</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_ad0bdc88e5f1be47c46c0f0c8ebf754bb"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb">machine_learning::apply_function</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; apply_function(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, T(*func)(const T &amp;))</div><div class="ttdef"><b>Definition</b> <a href="#l00329">vector_ops.hpp:329</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_ae10178b082f0205c326550877d998e5d"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d">machine_learning::pop_back</a></div><div class="ttdeci">std::valarray&lt; T &gt; pop_back(const std::valarray&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="#l00119">vector_ops.hpp:119</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_ae6ec42318d172b97fbdf45638d09d7b5"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5">machine_learning::operator/</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; operator/(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const T &amp;val)</div><div class="ttdef"><b>Definition</b> <a href="#l00365">vector_ops.hpp:365</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_af801bf30591ca6b2c38ff4fed0ded23f"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f">machine_learning::equal_shuffle</a></div><div class="ttdeci">void equal_shuffle(std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;A, std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; &amp;B)</div><div class="ttdef"><b>Definition</b> <a href="#l00136">vector_ops.hpp:136</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/d8/d96/stack__using__array_8cpp_source.html b/d8/d96/stack__using__array_8cpp_source.html
new file mode 100644
index 000000000..271b5e119
--- /dev/null
+++ b/d8/d96/stack__using__array_8cpp_source.html
@@ -0,0 +1,291 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/stack_using_array.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/d96/stack__using__array_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">stack_using_array.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &lt;memory&gt;</span>     </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include &lt;stdexcept&gt;</span>  </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d3c/namespacedata__structures.html">data_structures</a> {</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00016" data-start="{" data-end="};">
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"><a class="line" href="../../d2/dc8/classdata__structures_1_1_stack.html">   16</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d2/dc8/classdata__structures_1_1_stack.html">Stack</a> {</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"><a class="line" href="../../d2/dc8/classdata__structures_1_1_stack.html#a3f912a0e9bed5b24b206584e3010dce3">   18</a></span>    std::unique_ptr&lt;T[]&gt; <a class="code hl_variable" href="../../d2/dc8/classdata__structures_1_1_stack.html#a3f912a0e9bed5b24b206584e3010dce3">stack</a>;  </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"><a class="line" href="../../d2/dc8/classdata__structures_1_1_stack.html#a88a10062c0662a385f172669f2f19b86">   19</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d2/dc8/classdata__structures_1_1_stack.html#a88a10062c0662a385f172669f2f19b86">stackSize</a>;               </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"><a class="line" href="../../d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6">   20</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a>;  </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"><a class="line" href="../../d2/dc8/classdata__structures_1_1_stack.html#a8cb0602c8a9c1603d0315938177ecc6a">   28</a></span>    <a class="code hl_function" href="../../d2/dc8/classdata__structures_1_1_stack.html#a8cb0602c8a9c1603d0315938177ecc6a">Stack</a>(<span class="keywordtype">int</span> size) : <a class="code hl_variable" href="../../d2/dc8/classdata__structures_1_1_stack.html#a88a10062c0662a385f172669f2f19b86">stackSize</a>(size), <a class="code hl_variable" href="../../d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a>(-1), <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>(new T[size]) {}</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1">   35</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1">full</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a> == <a class="code hl_variable" href="../../d2/dc8/classdata__structures_1_1_stack.html#a88a10062c0662a385f172669f2f19b86">stackSize</a> - 1; }</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080">   41</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080">empty</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a> == -1; }</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="foldopen" id="foldopen00048" data-start="{" data-end="}">
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="../../d2/dc8/classdata__structures_1_1_stack.html#aa9f9b087e9e7c00628e1289f0f1de3b2">   48</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/dc8/classdata__structures_1_1_stack.html#aa9f9b087e9e7c00628e1289f0f1de3b2">push</a>(T element) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1">full</a>()) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>            <span class="keywordflow">throw</span> std::out_of_range(<span class="stringliteral">&quot;Stack overflow&quot;</span>);</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[++<a class="code hl_variable" href="../../d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a>] = element;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        }</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    }</div>
+</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b">   62</a></span>    T <a class="code hl_function" href="../../d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b">pop</a>() {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080">empty</a>()) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            <span class="keywordflow">throw</span> std::out_of_range(<span class="stringliteral">&quot;Stack underflow&quot;</span>);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[<a class="code hl_variable" href="../../d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a>--];</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    }</div>
+</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="foldopen" id="foldopen00072" data-start="{" data-end="}">
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"><a class="line" href="../../d2/dc8/classdata__structures_1_1_stack.html#abb86ed67d9d97112897a09cfb10ff586">   72</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/dc8/classdata__structures_1_1_stack.html#abb86ed67d9d97112897a09cfb10ff586">show</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= <a class="code hl_variable" href="../../d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a>; i++) {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            std::cout &lt;&lt; <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[i] &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        }</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    }</div>
+</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="foldopen" id="foldopen00084" data-start="{" data-end="}">
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"><a class="line" href="../../d2/dc8/classdata__structures_1_1_stack.html#a61dc70e128ee64c9684f03a4c04818b0">   84</a></span>    T <a class="code hl_function" href="../../d2/dc8/classdata__structures_1_1_stack.html#a61dc70e128ee64c9684f03a4c04818b0">topmost</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080">empty</a>()) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            <span class="keywordflow">throw</span> std::out_of_range(<span class="stringliteral">&quot;Stack underflow&quot;</span>);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[<a class="code hl_variable" href="../../d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a>];</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    }</div>
+</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="foldopen" id="foldopen00097" data-start="{" data-end="}">
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"><a class="line" href="../../d2/dc8/classdata__structures_1_1_stack.html#a2ac469fcc2229d273450e429139d90e6">   97</a></span>    T <a class="code hl_function" href="../../d2/dc8/classdata__structures_1_1_stack.html#a2ac469fcc2229d273450e429139d90e6">bottom</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080">empty</a>()) {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>            <span class="keywordflow">throw</span> std::out_of_range(<span class="stringliteral">&quot;Stack underflow&quot;</span>);</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        }</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[0];</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    }</div>
+</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>};</div>
+</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>}  <span class="comment">// namespace data_structures</span></div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <a class="code hl_class" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack&lt;int&gt;</a> <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>(5);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="comment">// Test empty and full operations</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    assert(<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.empty());</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    assert(!<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.full());</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="comment">// Test pushing elements and checking topmost</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(10);</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    assert(<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.topmost() == 10);</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(20);</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    assert(<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.topmost() == 20);</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(30);</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(40);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(50);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    assert(<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.full());</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    <span class="comment">// Test stack overflow</span></div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="keywordflow">try</span> {</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(60);</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::out_of_range&amp; e) {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        assert(std::string(e.what()) == <span class="stringliteral">&quot;Stack overflow&quot;</span>);</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    }</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span> </div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    <span class="comment">// Test popping elements</span></div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    assert(<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>() == 50);</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    assert(<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>() == 40);</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    assert(<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>() == 30);</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span> </div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <span class="comment">// Check topmost and bottom elements</span></div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    assert(<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.topmost() == 20);</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    assert(<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.bottom() == 10);</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span> </div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    assert(<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>() == 20);</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    assert(<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>() == 10);</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span> </div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    assert(<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.empty());</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    assert(!<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.full());</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    <span class="comment">// Test stack underflow</span></div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    <span class="keywordflow">try</span> {</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>        <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>();</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::out_of_range&amp; e) {</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>        assert(std::string(e.what()) == <span class="stringliteral">&quot;Stack underflow&quot;</span>);</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    }</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span> </div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    <span class="keywordflow">try</span> {</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.topmost();</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::out_of_range&amp; e) {</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        assert(std::string(e.what()) == <span class="stringliteral">&quot;Stack underflow&quot;</span>);</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    }</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span> </div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    <span class="keywordflow">try</span> {</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>        <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.bottom();</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::out_of_range&amp; e) {</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>        assert(std::string(e.what()) == <span class="stringliteral">&quot;Stack underflow&quot;</span>);</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    }</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>}</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span> </div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>}</div>
+<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00100">caesar_cipher.cpp:100</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_stack_html"><div class="ttname"><a href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack</a></div><div class="ttdoc">Class representation of a stack.</div><div class="ttdef"><b>Definition</b> <a href="#l00016">stack_using_array.cpp:16</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_stack_html_a04e2e7cb58b2de6d3a15053bfaaf6080"><div class="ttname"><a href="../../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080">data_structures::Stack::empty</a></div><div class="ttdeci">bool empty() const</div><div class="ttdoc">Checks if the stack is empty.</div><div class="ttdef"><b>Definition</b> <a href="#l00041">stack_using_array.cpp:41</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_stack_html_a2ac469fcc2229d273450e429139d90e6"><div class="ttname"><a href="../../d2/dc8/classdata__structures_1_1_stack.html#a2ac469fcc2229d273450e429139d90e6">data_structures::Stack::bottom</a></div><div class="ttdeci">T bottom() const</div><div class="ttdoc">Displays the bottom element of the stack.</div><div class="ttdef"><b>Definition</b> <a href="#l00097">stack_using_array.cpp:97</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_stack_html_a3f912a0e9bed5b24b206584e3010dce3"><div class="ttname"><a href="../../d2/dc8/classdata__structures_1_1_stack.html#a3f912a0e9bed5b24b206584e3010dce3">data_structures::Stack::stack</a></div><div class="ttdeci">std::unique_ptr&lt; T[]&gt; stack</div><div class="ttdoc">Smart pointer to the stack array.</div><div class="ttdef"><b>Definition</b> <a href="#l00018">stack_using_array.cpp:18</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_stack_html_a61dc70e128ee64c9684f03a4c04818b0"><div class="ttname"><a href="../../d2/dc8/classdata__structures_1_1_stack.html#a61dc70e128ee64c9684f03a4c04818b0">data_structures::Stack::topmost</a></div><div class="ttdeci">T topmost() const</div><div class="ttdoc">Displays the topmost element of the stack.</div><div class="ttdef"><b>Definition</b> <a href="#l00084">stack_using_array.cpp:84</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_stack_html_a71afc94746d47fb2c0c4fa4b612edee6"><div class="ttname"><a href="../../d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6">data_structures::Stack::stackIndex</a></div><div class="ttdeci">int stackIndex</div><div class="ttdoc">Index pointing to the top element of the stack.</div><div class="ttdef"><b>Definition</b> <a href="#l00020">stack_using_array.cpp:20</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_stack_html_a88a10062c0662a385f172669f2f19b86"><div class="ttname"><a href="../../d2/dc8/classdata__structures_1_1_stack.html#a88a10062c0662a385f172669f2f19b86">data_structures::Stack::stackSize</a></div><div class="ttdeci">int stackSize</div><div class="ttdoc">Maximum size of the stack.</div><div class="ttdef"><b>Definition</b> <a href="#l00019">stack_using_array.cpp:19</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_stack_html_a8cb0602c8a9c1603d0315938177ecc6a"><div class="ttname"><a href="../../d2/dc8/classdata__structures_1_1_stack.html#a8cb0602c8a9c1603d0315938177ecc6a">data_structures::Stack::Stack</a></div><div class="ttdeci">Stack(int size)</div><div class="ttdoc">Constructs a new Stack object.</div><div class="ttdef"><b>Definition</b> <a href="#l00028">stack_using_array.cpp:28</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_stack_html_aa753346c8ee5f21d4f4482398fe6d5c1"><div class="ttname"><a href="../../d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1">data_structures::Stack::full</a></div><div class="ttdeci">bool full() const</div><div class="ttdoc">Checks if the stack is full.</div><div class="ttdef"><b>Definition</b> <a href="#l00035">stack_using_array.cpp:35</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_stack_html_aa9f9b087e9e7c00628e1289f0f1de3b2"><div class="ttname"><a href="../../d2/dc8/classdata__structures_1_1_stack.html#aa9f9b087e9e7c00628e1289f0f1de3b2">data_structures::Stack::push</a></div><div class="ttdeci">void push(T element)</div><div class="ttdoc">Pushes an element onto the stack.</div><div class="ttdef"><b>Definition</b> <a href="#l00048">stack_using_array.cpp:48</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_stack_html_abb86ed67d9d97112897a09cfb10ff586"><div class="ttname"><a href="../../d2/dc8/classdata__structures_1_1_stack.html#abb86ed67d9d97112897a09cfb10ff586">data_structures::Stack::show</a></div><div class="ttdeci">void show() const</div><div class="ttdoc">Displays all elements in the stack.</div><div class="ttdef"><b>Definition</b> <a href="#l00072">stack_using_array.cpp:72</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_stack_html_ac46842bdd9c655d84f865fa3a03da19b"><div class="ttname"><a href="../../d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b">data_structures::Stack::pop</a></div><div class="ttdeci">T pop()</div><div class="ttdoc">Pops an element from the stack.</div><div class="ttdef"><b>Definition</b> <a href="#l00062">stack_using_array.cpp:62</a></div></div>
+<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00019">stack.hpp:19</a></div></div>
+<div class="ttc" id="aclassstack_html_a3647fb4418890f19e0dc414b8092b8b0"><div class="ttname"><a href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00062">stack.hpp:62</a></div></div>
+<div class="ttc" id="aclassstack_html_a90df277532c23519aa7ac3c08ed90a1d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack::push</a></div><div class="ttdeci">void push(const value_type &amp;item)</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00047">stack.hpp:47</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html">data_structures</a></div><div class="ttdoc">for IO operations</div></div>
+<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00020">paranthesis_matching.cpp:20</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><b>stack_using_array.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.map b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.map
index b3ca3cd93..99261823c 100644
--- a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.map
+++ b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.map
@@ -1,7 +1,5 @@
 <map id="others::recursive_tree_traversals::BT" name="others::recursive_tree_traversals::BT">
-<area shape="rect" id="Node000001" title="BT used to make the entire structure of the binary tree and the functions associated with the binary ..." alt="" coords="21,213,169,253"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="5,94,185,120"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="98,135,98,212,92,212,92,135"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="48,5,142,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="98,47,98,94,92,94,92,47"/>
+<area shape="rect" id="Node000001" title="BT used to make the entire structure of the binary tree and the functions associated with the binary ..." alt="" coords="21,124,169,165"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,5,185,31"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="98,47,98,124,92,124,92,47"/>
 </map>
diff --git a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.md5 b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.md5
index db250a296..fff623e69 100644
--- a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.md5
+++ b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.md5
@@ -1 +1 @@
-13d3d40813e2172af70fc2fd9d91ca6b
\ No newline at end of file
+6781928d931f5d173787adb62d7377c6
\ No newline at end of file
diff --git a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.svg b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.svg
index 82bc9d5b6..0c5f9d3fc 100644
--- a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.svg
+++ b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.svg
@@ -4,8 +4,8 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: others::recursive_tree_traversals::BT Pages: 1 -->
-<svg width="145pt" height="194pt"
- viewBox="0.00 0.00 145.00 194.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="145pt" height="128pt"
+ viewBox="0.00 0.00 145.00 127.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
 <svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
@@ -17,7 +17,7 @@
 ]]></style>
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
 <svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 190)">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 123.5)">
 <title>others::recursive_tree_traversals::BT</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="134.5,-119.5 0,-119.5 0,-100.25 134.5,-100.25 134.5,-119.5"/>
 <text text-anchor="middle" x="67.25" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::uint64_t &gt;</text>
 </a>
@@ -50,25 +50,6 @@
 <text text-anchor="middle" x="102.12" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">postorder_result</text>
 <text text-anchor="middle" x="102.12" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">preorder_result</text>
 </g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="102.25,-186 32.25,-186 32.25,-166.75 102.25,-166.75 102.25,-186"/>
-<text text-anchor="middle" x="67.25" y="-172.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint64_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M67.25,-154.9C67.25,-143.07 67.25,-128.79 67.25,-119.77"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="63.75,-154.89 67.25,-164.89 70.75,-154.89 63.75,-154.89"/>
-</a>
-</g>
-<text text-anchor="middle" x="88.62" y="-139.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
 </g>
 </svg>
 </svg>
diff --git a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph_org.svg b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph_org.svg
index 907a8bcfd..97f2e14ac 100644
--- a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph_org.svg
+++ b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph_org.svg
@@ -4,9 +4,9 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: others::recursive_tree_traversals::BT Pages: 1 -->
-<svg width="145pt" height="194pt"
- viewBox="0.00 0.00 145.00 194.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 190)">
+<svg width="145pt" height="128pt"
+ viewBox="0.00 0.00 145.00 127.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 123.5)">
 <title>others::recursive_tree_traversals::BT</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="134.5,-119.5 0,-119.5 0,-100.25 134.5,-100.25 134.5,-119.5"/>
 <text text-anchor="middle" x="67.25" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::uint64_t &gt;</text>
 </a>
@@ -39,24 +39,5 @@
 <text text-anchor="middle" x="102.12" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">postorder_result</text>
 <text text-anchor="middle" x="102.12" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">preorder_result</text>
 </g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="102.25,-186 32.25,-186 32.25,-166.75 102.25,-166.75 102.25,-186"/>
-<text text-anchor="middle" x="67.25" y="-172.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint64_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M67.25,-154.9C67.25,-143.07 67.25,-128.79 67.25,-119.77"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="63.75,-154.89 67.25,-164.89 70.75,-154.89 63.75,-154.89"/>
-</a>
-</g>
-<text text-anchor="middle" x="88.62" y="-139.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
 </g>
 </svg>
diff --git a/d8/d99/connected__components__with__dsu_8cpp.html b/d8/d99/connected__components__with__dsu_8cpp.html
index 67801a304..6692cf8d2 100644
--- a/d8/d99/connected__components__with__dsu_8cpp.html
+++ b/d8/d99/connected__components__with__dsu_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph/connected_components_with_dsu.cpp File Reference</title>
+<title>TheAlgorithms/C++: graph/connected_components_with_dsu.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for connected_components_with_dsu.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d74/connected__components__with__dsu_8cpp__incl.svg" width="311" height="126"><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">
+</div>
+<p><a href="../../d8/d99/connected__components__with__dsu_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></td></tr>
@@ -156,12 +175,11 @@ Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:a7ab30d5b9594d90071a53c6d147158ef" id="r_a7ab30d5b9594d90071a53c6d147158ef"><td class="memItemLeft" align="right" valign="top"><a id="a7ab30d5b9594d90071a53c6d147158ef" name="a7ab30d5b9594d90071a53c6d147158ef"></a>
-uint32_t&#160;</td><td class="memItemRight" valign="bottom"><b>graph::disjoint_union::number_of_nodes</b> = 0</td></tr>
+<tr class="memitem:a7ab30d5b9594d90071a53c6d147158ef" id="r_a7ab30d5b9594d90071a53c6d147158ef"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7ab30d5b9594d90071a53c6d147158ef">graph::disjoint_union::number_of_nodes</a> = 0</td></tr>
 <tr class="separator:a7ab30d5b9594d90071a53c6d147158ef"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa93bd9d3409fe4eeb7e5658eddd75fa8" id="r_aa93bd9d3409fe4eeb7e5658eddd75fa8"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa93bd9d3409fe4eeb7e5658eddd75fa8">graph::disjoint_union::parent</a> {}</td></tr>
+<tr class="memitem:aa93bd9d3409fe4eeb7e5658eddd75fa8" id="r_aa93bd9d3409fe4eeb7e5658eddd75fa8"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa93bd9d3409fe4eeb7e5658eddd75fa8">graph::disjoint_union::parent</a> {}</td></tr>
 <tr class="separator:aa93bd9d3409fe4eeb7e5658eddd75fa8"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af675d8149b6a82cb7fa07f39210b8a2b" id="r_af675d8149b6a82cb7fa07f39210b8a2b"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af675d8149b6a82cb7fa07f39210b8a2b">graph::disjoint_union::connected_set_size</a> {}</td></tr>
+<tr class="memitem:af675d8149b6a82cb7fa07f39210b8a2b" id="r_af675d8149b6a82cb7fa07f39210b8a2b"><td class="memItemLeft" align="right" valign="top">std::vector&lt; uint32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af675d8149b6a82cb7fa07f39210b8a2b">graph::disjoint_union::connected_set_size</a> {}</td></tr>
 <tr class="separator:af675d8149b6a82cb7fa07f39210b8a2b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -176,6 +194,8 @@ Algorithm</h3>
 <dl class="section author"><dt>Author</dt><dd>Unknown author </dd>
 <dd>
 <a href="https://github.com/sagarpandyansit" target="_blank">Sagar Pandya</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp_source.html">connected_components_with_dsu.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a469384d8a4197a9b24482ce7c321a85e" name="a469384d8a4197a9b24482ce7c321a85e"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a469384d8a4197a9b24482ce7c321a85e">&#9670;&#160;</a></span>find_set()</h2>
@@ -200,6 +220,8 @@ Algorithm</h3>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>parent of val </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp_source.html#l00054">54</a> of file <a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp_source.html">connected_components_with_dsu.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   54</span>                              {</div>
 <div class="line"><span class="lineno">   55</span>    <span class="keywordflow">while</span> (parent[val] != val) {</div>
 <div class="line"><span class="lineno">   56</span>        parent[val] = parent[parent[val]];</div>
@@ -207,12 +229,7 @@ Algorithm</h3>
 <div class="line"><span class="lineno">   58</span>    }</div>
 <div class="line"><span class="lineno">   59</span>    <span class="keywordflow">return</span> val;</div>
 <div class="line"><span class="lineno">   60</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d99/connected__components__with__dsu_8cpp_a469384d8a4197a9b24482ce7c321a85e_cgraph.svg" width="151" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -232,17 +249,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp_source.html#l00117">117</a> of file <a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp_source.html">connected_components_with_dsu.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  117</span>           {</div>
 <div class="line"><span class="lineno">  118</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Execute the tests</span></div>
 <div class="line"><span class="lineno">  119</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  120</span>}</div>
-<div class="ttc" id="aconnected__components__with__dsu_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test Implementations.</div><div class="ttdef"><b>Definition</b> connected_components_with_dsu.cpp:97</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d99/connected__components__with__dsu_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aconnected__components__with__dsu_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test Implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d99/connected__components__with__dsu_8cpp_source.html#l00097">connected_components_with_dsu.cpp:97</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae91ed94113c56191b75fe45f688d6e62" name="ae91ed94113c56191b75fe45f688d6e62"></a>
@@ -262,18 +276,15 @@ Here is the call graph for this function:</div>
 
 <p>function the initialize every node as it's own parent </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp_source.html#l00043">43</a> of file <a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp_source.html">connected_components_with_dsu.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   43</span>                {</div>
 <div class="line"><span class="lineno">   44</span>    <span class="keywordflow">for</span> (uint32_t i = 1; i &lt;= number_of_nodes; i++) {</div>
 <div class="line"><span class="lineno">   45</span>        parent[i] = i;</div>
 <div class="line"><span class="lineno">   46</span>        connected_set_size[i] = 1;</div>
 <div class="line"><span class="lineno">   47</span>    }</div>
 <div class="line"><span class="lineno">   48</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d99/connected__components__with__dsu_8cpp_ae91ed94113c56191b75fe45f688d6e62_cgraph.svg" width="151" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac2d6698b71384a352ec4b81b31b13141" name="ac2d6698b71384a352ec4b81b31b13141"></a>
@@ -293,21 +304,15 @@ Here is the call graph for this function:</div>
 
 <p>Find total no. of connected components. </p>
 <dl class="section return"><dt>Returns</dt><dd>Number of connected components </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   85</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/set.html">std::set&lt;int64_t&gt;</a> temp;  <span class="comment">// temp set to count number of connected components</span></div>
-<div class="line"><span class="lineno">   87</span>    <span class="keywordflow">for</span> (uint32_t i = 1; i &lt;= number_of_nodes; i++) temp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set/insert.html">insert</a>(<a class="code hl_function" href="#a469384d8a4197a9b24482ce7c321a85e">find_set</a>(i));</div>
-<div class="line"><span class="lineno">   88</span>    <span class="keywordflow">return</span> temp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set/size.html">size</a>();  <span class="comment">// return the size of temp set</span></div>
-<div class="line"><span class="lineno">   89</span>}</div>
-<div class="ttc" id="aconnected__components__with__dsu_8cpp_html_a469384d8a4197a9b24482ce7c321a85e"><div class="ttname"><a href="#a469384d8a4197a9b24482ce7c321a85e">graph::disjoint_union::find_set</a></div><div class="ttdeci">int64_t find_set(int64_t val)</div><div class="ttdoc">Find the component where following node belongs to.</div><div class="ttdef"><b>Definition</b> connected_components_with_dsu.cpp:54</div></div>
-<div class="ttc" id="ainsert_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set/insert.html">std::set::insert</a></div><div class="ttdeci">T insert(T... args)</div></div>
-<div class="ttc" id="aset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set.html">std::set</a></div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set/size.html">std::set::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d99/connected__components__with__dsu_8cpp_ac2d6698b71384a352ec4b81b31b13141_cgraph.svg" width="406" height="175"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp_source.html#l00085">85</a> of file <a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp_source.html">connected_components_with_dsu.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   85</span>                                      {</div>
+<div class="line"><span class="lineno">   86</span>    std::set&lt;int64_t&gt; temp;  <span class="comment">// temp set to count number of connected components</span></div>
+<div class="line"><span class="lineno">   87</span>    <span class="keywordflow">for</span> (uint32_t i = 1; i &lt;= number_of_nodes; i++) temp.insert(<a class="code hl_function" href="#a469384d8a4197a9b24482ce7c321a85e">find_set</a>(i));</div>
+<div class="line"><span class="lineno">   88</span>    <span class="keywordflow">return</span> temp.size();  <span class="comment">// return the size of temp set</span></div>
+<div class="line"><span class="lineno">   89</span>}</div>
+<div class="ttc" id="aconnected__components__with__dsu_8cpp_html_a469384d8a4197a9b24482ce7c321a85e"><div class="ttname"><a href="#a469384d8a4197a9b24482ce7c321a85e">graph::disjoint_union::find_set</a></div><div class="ttdeci">int64_t find_set(int64_t val)</div><div class="ttdoc">Find the component where following node belongs to.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d99/connected__components__with__dsu_8cpp_source.html#l00054">connected_components_with_dsu.cpp:54</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -335,31 +340,25 @@ Here is the call graph for this function:</div>
 
 <p>Test Implementations. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp_source.html#l00097">97</a> of file <a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp_source.html">connected_components_with_dsu.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   97</span>                   {</div>
 <div class="line"><span class="lineno">   98</span>    <span class="keyword">namespace </span><a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> = graph::disjoint_union;</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_istream.html">std::cin</a> &gt;&gt; dsu::number_of_nodes;</div>
+<div class="line"><span class="lineno">   99</span>    std::cin &gt;&gt; dsu::number_of_nodes;</div>
 <div class="line"><span class="lineno">  100</span>    dsu::parent.resize(dsu::number_of_nodes + 1);</div>
 <div class="line"><span class="lineno">  101</span>    dsu::connected_set_size.resize(dsu::number_of_nodes + 1);</div>
 <div class="line"><span class="lineno">  102</span>    dsu::make_set();</div>
 <div class="line"><span class="lineno">  103</span>    uint32_t edges = 0;</div>
-<div class="line"><span class="lineno">  104</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; edges;  <span class="comment">// no of edges in the graph</span></div>
+<div class="line"><span class="lineno">  104</span>    std::cin &gt;&gt; edges;  <span class="comment">// no of edges in the graph</span></div>
 <div class="line"><span class="lineno">  105</span>    <span class="keywordflow">while</span> (edges--) {</div>
 <div class="line"><span class="lineno">  106</span>        int64_t node_a = 0, node_b = 0;</div>
-<div class="line"><span class="lineno">  107</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; node_a &gt;&gt; node_b;</div>
+<div class="line"><span class="lineno">  107</span>        std::cin &gt;&gt; node_a &gt;&gt; node_b;</div>
 <div class="line"><span class="lineno">  108</span>        dsu::union_sets(node_a, node_b);</div>
 <div class="line"><span class="lineno">  109</span>    }</div>
-<div class="line"><span class="lineno">  110</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; dsu::no_of_connected_components() &lt;&lt; <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">  110</span>    std::cout &lt;&lt; dsu::no_of_connected_components() &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  111</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="aclassdsu_html"><div class="ttname"><a href="../../dd/d1f/classdsu.html">dsu</a></div><div class="ttdoc">Disjoint sets union data structure, class based representation.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:34</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><!-- 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="../../d8/d99/connected__components__with__dsu_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdsu_html"><div class="ttname"><a href="../../dd/d1f/classdsu.html">dsu</a></div><div class="ttdoc">Disjoint sets union data structure, class based representation.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00034">dsu_path_compression.cpp:34</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a67cb7472f310a798f555fe45cdf50145" name="a67cb7472f310a798f555fe45cdf50145"></a>
@@ -390,6 +389,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp_source.html">connected_components_with_dsu.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   67</span>                                              {</div>
 <div class="line"><span class="lineno">   68</span>    node1 = <a class="code hl_function" href="#a469384d8a4197a9b24482ce7c321a85e">find_set</a>(node1);  <span class="comment">// find the parent of node1</span></div>
 <div class="line"><span class="lineno">   69</span>    node2 = <a class="code hl_function" href="#a469384d8a4197a9b24482ce7c321a85e">find_set</a>(node2);  <span class="comment">// find the parent of node2</span></div>
@@ -397,20 +398,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   71</span>    <span class="comment">// If parents of both nodes are not same, combine them</span></div>
 <div class="line"><span class="lineno">   72</span>    <span class="keywordflow">if</span> (node1 != node2) {</div>
 <div class="line"><span class="lineno">   73</span>        <span class="keywordflow">if</span> (connected_set_size[node1] &lt; connected_set_size[node2]) {</div>
-<div class="line"><span class="lineno">   74</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(node1, node2);  <span class="comment">// swap both components</span></div>
+<div class="line"><span class="lineno">   74</span>            std::swap(node1, node2);  <span class="comment">// swap both components</span></div>
 <div class="line"><span class="lineno">   75</span>        }</div>
 <div class="line"><span class="lineno">   76</span>        parent[node2] = node1;  <span class="comment">// make node1 as parent of node2.</span></div>
 <div class="line"><span class="lineno">   77</span>        connected_set_size[node1] +=</div>
 <div class="line"><span class="lineno">   78</span>            connected_set_size[node2];  <span class="comment">// sum the size of both as they combined</span></div>
 <div class="line"><span class="lineno">   79</span>    }</div>
 <div class="line"><span class="lineno">   80</span>}</div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- 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="../../d8/d99/connected__components__with__dsu_8cpp_a67cb7472f310a798f555fe45cdf50145_cgraph.svg" width="340" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Variable Documentation</h2>
@@ -421,12 +416,30 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;uint32_t&gt; graph::disjoint_union::connected_set_size {}</td>
+          <td class="memname">std::vector&lt;uint32_t&gt; graph::disjoint_union::connected_set_size {}</td>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp_source.html">connected_components_with_dsu.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   38</span>{};  <span class="comment">// size of each set</span></div>
 </div><!-- fragment -->
+</div>
+</div>
+<a id="a7ab30d5b9594d90071a53c6d147158ef" name="a7ab30d5b9594d90071a53c6d147158ef"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a7ab30d5b9594d90071a53c6d147158ef">&#9670;&#160;</a></span>number_of_nodes</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">uint32_t graph::disjoint_union::number_of_nodes = 0</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp_source.html">connected_components_with_dsu.cpp</a>.</p>
+
 </div>
 </div>
 <a id="aa93bd9d3409fe4eeb7e5658eddd75fa8" name="aa93bd9d3409fe4eeb7e5658eddd75fa8"></a>
@@ -436,10 +449,12 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;int64_t&gt; graph::disjoint_union::parent {}</td>
+          <td class="memname">std::vector&lt;int64_t&gt; graph::disjoint_union::parent {}</td>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp_source.html">connected_components_with_dsu.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   37</span>{};               <span class="comment">// parent of each node</span></div>
 </div><!-- fragment -->
 </div>
diff --git a/d8/d99/connected__components__with__dsu_8cpp_a469384d8a4197a9b24482ce7c321a85e_cgraph.map b/d8/d99/connected__components__with__dsu_8cpp_a469384d8a4197a9b24482ce7c321a85e_cgraph.map
deleted file mode 100644
index 4868834a0..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_a469384d8a4197a9b24482ce7c321a85e_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="graph::disjoint_union::find_set" name="graph::disjoint_union::find_set">
-<area shape="rect" id="Node000001" title="Find the component where following node belongs to." alt="" coords="5,29,146,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="48,29,47,20,51,11,61,5,76,3,91,5,101,12,98,16,89,10,75,8,63,10,55,14,52,20,53,28"/>
-</map>
diff --git a/d8/d99/connected__components__with__dsu_8cpp_a469384d8a4197a9b24482ce7c321a85e_cgraph.md5 b/d8/d99/connected__components__with__dsu_8cpp_a469384d8a4197a9b24482ce7c321a85e_cgraph.md5
deleted file mode 100644
index e35a43908..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_a469384d8a4197a9b24482ce7c321a85e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8fc145ca138758a93ab57ebe884633cb
\ No newline at end of file
diff --git a/d8/d99/connected__components__with__dsu_8cpp_a469384d8a4197a9b24482ce7c321a85e_cgraph.svg b/d8/d99/connected__components__with__dsu_8cpp_a469384d8a4197a9b24482ce7c321a85e_cgraph.svg
deleted file mode 100644
index 2b2842213..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_a469384d8a4197a9b24482ce7c321a85e_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::disjoint_union::find_set Pages: 1 -->
-<svg width="113pt" height="57pt"
- viewBox="0.00 0.00 113.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>graph::disjoint_union::find_set</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Find the component where following node belongs to.">
-<polygon fill="#999999" stroke="#666666" points="105.25,-30.5 0,-30.5 0,0 105.25,0 105.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::disjoint_union</text>
-<text text-anchor="middle" x="52.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_set</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.97,-30.99C30.17,-40.06 36.39,-48.5 52.62,-48.5 61.51,-48.5 67.39,-45.97 70.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.74,-42.76 71.14,-32.49 66.77,-42.14 73.74,-42.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d99/connected__components__with__dsu_8cpp_a469384d8a4197a9b24482ce7c321a85e_cgraph_org.svg b/d8/d99/connected__components__with__dsu_8cpp_a469384d8a4197a9b24482ce7c321a85e_cgraph_org.svg
deleted file mode 100644
index 3fd1e2f1d..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_a469384d8a4197a9b24482ce7c321a85e_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::disjoint_union::find_set Pages: 1 -->
-<svg width="113pt" height="57pt"
- viewBox="0.00 0.00 113.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>graph::disjoint_union::find_set</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Find the component where following node belongs to.">
-<polygon fill="#999999" stroke="#666666" points="105.25,-30.5 0,-30.5 0,0 105.25,0 105.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::disjoint_union</text>
-<text text-anchor="middle" x="52.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_set</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.97,-30.99C30.17,-40.06 36.39,-48.5 52.62,-48.5 61.51,-48.5 67.39,-45.97 70.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.74,-42.76 71.14,-32.49 66.77,-42.14 73.74,-42.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d99/connected__components__with__dsu_8cpp_a67cb7472f310a798f555fe45cdf50145_cgraph.map b/d8/d99/connected__components__with__dsu_8cpp_a67cb7472f310a798f555fe45cdf50145_cgraph.map
deleted file mode 100644
index 2d762c604..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_a67cb7472f310a798f555fe45cdf50145_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="graph::disjoint_union::union_sets" name="graph::disjoint_union::union_sets">
-<area shape="rect" id="Node000001" title="Merge 2 components to become one." alt="" coords="5,59,146,99"/>
-<area shape="poly" id="edge4_Node000001_Node000001" title=" " alt="" coords="40,59,38,49,44,40,56,34,76,32,96,34,108,41,106,45,95,40,75,37,58,39,47,44,43,50,45,57"/>
-<area shape="rect" id="Node000002" href="$d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e" title="Find the component where following node belongs to." alt="" coords="194,29,334,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="146,65,178,60,179,66,146,71"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="225,94,303,120"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="146,87,209,96,209,102,146,92"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="228,29,226,19,232,10,245,5,264,3,284,5,297,11,294,16,283,10,264,8,246,10,235,15,231,20,233,28"/>
-</map>
diff --git a/d8/d99/connected__components__with__dsu_8cpp_a67cb7472f310a798f555fe45cdf50145_cgraph.md5 b/d8/d99/connected__components__with__dsu_8cpp_a67cb7472f310a798f555fe45cdf50145_cgraph.md5
deleted file mode 100644
index 1a80d3671..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_a67cb7472f310a798f555fe45cdf50145_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9a6aa7ac02a7a09536fb3b21391c211e
\ No newline at end of file
diff --git a/d8/d99/connected__components__with__dsu_8cpp_a67cb7472f310a798f555fe45cdf50145_cgraph.svg b/d8/d99/connected__components__with__dsu_8cpp_a67cb7472f310a798f555fe45cdf50145_cgraph.svg
deleted file mode 100644
index 935c51fa7..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_a67cb7472f310a798f555fe45cdf50145_cgraph.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::disjoint_union::union_sets Pages: 1 -->
-<svg width="255pt" height="94pt"
- viewBox="0.00 0.00 254.50 93.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89.88)">
-<title>graph::disjoint_union::union_sets</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Merge 2 components to become one.">
-<polygon fill="#999999" stroke="#666666" points="105.25,-45.88 0,-45.88 0,-15.37 105.25,-15.37 105.25,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::disjoint_union</text>
-<text text-anchor="middle" x="52.62" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::union_sets</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.6,-46.36C22.49,-55.43 30.83,-63.88 52.62,-63.88 64.54,-63.88 72.44,-61.35 76.31,-57.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.76,-58.21 77.47,-47.86 72.81,-57.38 79.76,-58.21"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e" target="_top" xlink:title="Find the component where following node belongs to.">
-<polygon fill="white" stroke="#666666" points="246.5,-67.88 141.25,-67.88 141.25,-37.38 246.5,-37.38 246.5,-67.88"/>
-<text text-anchor="start" x="149.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::disjoint_union</text>
-<text text-anchor="middle" x="193.88" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find_set</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.48,-38.82C113.36,-40.06 121.57,-41.36 129.66,-42.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.06,-46.09 139.49,-44.19 130.15,-39.17 129.06,-46.09"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.25,-19.25 164.5,-19.25 164.5,0 223.25,0 223.25,-19.25"/>
-<text text-anchor="middle" x="193.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.48,-22.81C121.1,-20.45 138,-17.9 152.73,-15.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.16,-19.15 162.53,-14.2 152.12,-12.23 153.16,-19.15"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M168.85,-68.36C163.74,-77.43 172.08,-85.88 193.88,-85.88 205.79,-85.88 213.69,-83.35 217.56,-79.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.01,-80.21 218.72,-69.86 214.06,-79.38 221.01,-80.21"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d99/connected__components__with__dsu_8cpp_a67cb7472f310a798f555fe45cdf50145_cgraph_org.svg b/d8/d99/connected__components__with__dsu_8cpp_a67cb7472f310a798f555fe45cdf50145_cgraph_org.svg
deleted file mode 100644
index 5fb30acf8..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_a67cb7472f310a798f555fe45cdf50145_cgraph_org.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::disjoint_union::union_sets Pages: 1 -->
-<svg width="255pt" height="94pt"
- viewBox="0.00 0.00 254.50 93.88" 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.88)">
-<title>graph::disjoint_union::union_sets</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Merge 2 components to become one.">
-<polygon fill="#999999" stroke="#666666" points="105.25,-45.88 0,-45.88 0,-15.37 105.25,-15.37 105.25,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::disjoint_union</text>
-<text text-anchor="middle" x="52.62" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::union_sets</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.6,-46.36C22.49,-55.43 30.83,-63.88 52.62,-63.88 64.54,-63.88 72.44,-61.35 76.31,-57.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.76,-58.21 77.47,-47.86 72.81,-57.38 79.76,-58.21"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e" target="_top" xlink:title="Find the component where following node belongs to.">
-<polygon fill="white" stroke="#666666" points="246.5,-67.88 141.25,-67.88 141.25,-37.38 246.5,-37.38 246.5,-67.88"/>
-<text text-anchor="start" x="149.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::disjoint_union</text>
-<text text-anchor="middle" x="193.88" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find_set</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.48,-38.82C113.36,-40.06 121.57,-41.36 129.66,-42.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.06,-46.09 139.49,-44.19 130.15,-39.17 129.06,-46.09"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.25,-19.25 164.5,-19.25 164.5,0 223.25,0 223.25,-19.25"/>
-<text text-anchor="middle" x="193.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.48,-22.81C121.1,-20.45 138,-17.9 152.73,-15.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.16,-19.15 162.53,-14.2 152.12,-12.23 153.16,-19.15"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M168.85,-68.36C163.74,-77.43 172.08,-85.88 193.88,-85.88 205.79,-85.88 213.69,-83.35 217.56,-79.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.01,-80.21 218.72,-69.86 214.06,-79.38 221.01,-80.21"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d99/connected__components__with__dsu_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/d99/connected__components__with__dsu_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index a990b2820..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Test Implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/d8/d99/connected__components__with__dsu_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/d99/connected__components__with__dsu_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index f4d209f24..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5122934d8a90aefd1d0ba80d21ff0428
\ No newline at end of file
diff --git a/d8/d99/connected__components__with__dsu_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/d99/connected__components__with__dsu_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 221e9900f..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test Implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d99/connected__components__with__dsu_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d8/d99/connected__components__with__dsu_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index db433d2dc..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test Implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d99/connected__components__with__dsu_8cpp_ac2d6698b71384a352ec4b81b31b13141_cgraph.map b/d8/d99/connected__components__with__dsu_8cpp_ac2d6698b71384a352ec4b81b31b13141_cgraph.map
deleted file mode 100644
index fbcca49e3..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_ac2d6698b71384a352ec4b81b31b13141_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="graph::disjoint_union::no_of_connected_components" name="graph::disjoint_union::no_of_connected_components">
-<area shape="rect" id="Node000001" title="Find total no. of connected components." alt="" coords="5,87,212,127"/>
-<area shape="poly" id="edge4_Node000001_Node000001" title=" " alt="" coords="67,87,65,77,72,68,86,62,109,60,132,62,147,69,145,74,131,68,108,65,87,67,75,72,70,78,72,85"/>
-<area shape="rect" id="Node000002" href="$d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e" title="Find the component where following node belongs to." alt="" coords="260,29,400,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="189,84,244,69,245,74,190,89"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/set/insert.html#" title=" " alt="" coords="277,94,382,120"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="212,104,262,104,262,110,212,110"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/set/size.html#" title=" " alt="" coords="281,144,378,169"/>
-<area shape="poly" id="edge5_Node000001_Node000004" title=" " alt="" coords="203,125,267,140,266,145,202,131"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="288,29,286,19,293,10,308,5,330,3,354,5,368,11,366,16,352,10,330,8,309,10,296,15,291,21,293,28"/>
-</map>
diff --git a/d8/d99/connected__components__with__dsu_8cpp_ac2d6698b71384a352ec4b81b31b13141_cgraph.md5 b/d8/d99/connected__components__with__dsu_8cpp_ac2d6698b71384a352ec4b81b31b13141_cgraph.md5
deleted file mode 100644
index c95ee69e5..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_ac2d6698b71384a352ec4b81b31b13141_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1fe5c922cfd08398088e852672cd9e7b
\ No newline at end of file
diff --git a/d8/d99/connected__components__with__dsu_8cpp_ac2d6698b71384a352ec4b81b31b13141_cgraph.svg b/d8/d99/connected__components__with__dsu_8cpp_ac2d6698b71384a352ec4b81b31b13141_cgraph.svg
deleted file mode 100644
index 6b8b3ac4e..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_ac2d6698b71384a352ec4b81b31b13141_cgraph.svg
+++ /dev/null
@@ -1,121 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::disjoint_union::no_of_connected_components Pages: 1 -->
-<svg width="304pt" height="131pt"
- viewBox="0.00 0.00 304.00 130.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 126.88)">
-<title>graph::disjoint_union::no_of_connected_components</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Find total no. of connected components.">
-<polygon fill="#999999" stroke="#666666" points="154.75,-61.88 0,-61.88 0,-31.38 154.75,-31.38 154.75,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::disjoint_union</text>
-<text text-anchor="middle" x="77.38" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::no_of_connected_components</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47.96,-62.36C41.96,-71.43 51.76,-79.88 77.38,-79.88 91.38,-79.88 100.66,-77.35 105.21,-73.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.65,-74.25 106.58,-63.86 101.72,-73.28 108.65,-74.25"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e" target="_top" xlink:title="Find the component where following node belongs to.">
-<polygon fill="white" stroke="#666666" points="296,-104.88 190.75,-104.88 190.75,-74.38 296,-74.38 296,-104.88"/>
-<text text-anchor="start" x="198.75" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::disjoint_union</text>
-<text text-anchor="middle" x="243.38" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find_set</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.05,-62.27C151.56,-65.81 165.95,-69.59 179.59,-73.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.31,-76.45 188.87,-75.6 180.08,-69.67 178.31,-76.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282.88,-56.25 203.88,-56.25 203.88,-37 282.88,-37 282.88,-56.25"/>
-<text text-anchor="middle" x="243.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.09,-46.62C167.72,-46.62 180.52,-46.62 192.28,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.14,-50.13 202.14,-46.63 192.14,-43.13 192.14,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279.88,-19.25 206.88,-19.25 206.88,0 279.88,0 279.88,-19.25"/>
-<text text-anchor="middle" x="243.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.93,-30.93C164.07,-27.29 180.86,-23.5 195.74,-20.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.24,-23.62 205.22,-18.01 194.7,-16.79 196.24,-23.62"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.96,-105.36C207.96,-114.43 217.76,-122.88 243.38,-122.88 257.38,-122.88 266.66,-120.35 271.21,-116.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="274.65,-117.25 272.58,-106.86 267.72,-116.28 274.65,-117.25"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d99/connected__components__with__dsu_8cpp_ac2d6698b71384a352ec4b81b31b13141_cgraph_org.svg b/d8/d99/connected__components__with__dsu_8cpp_ac2d6698b71384a352ec4b81b31b13141_cgraph_org.svg
deleted file mode 100644
index 1adc36fdc..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_ac2d6698b71384a352ec4b81b31b13141_cgraph_org.svg
+++ /dev/null
@@ -1,95 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::disjoint_union::no_of_connected_components Pages: 1 -->
-<svg width="304pt" height="131pt"
- viewBox="0.00 0.00 304.00 130.88" 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 126.88)">
-<title>graph::disjoint_union::no_of_connected_components</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Find total no. of connected components.">
-<polygon fill="#999999" stroke="#666666" points="154.75,-61.88 0,-61.88 0,-31.38 154.75,-31.38 154.75,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::disjoint_union</text>
-<text text-anchor="middle" x="77.38" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::no_of_connected_components</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47.96,-62.36C41.96,-71.43 51.76,-79.88 77.38,-79.88 91.38,-79.88 100.66,-77.35 105.21,-73.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.65,-74.25 106.58,-63.86 101.72,-73.28 108.65,-74.25"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e" target="_top" xlink:title="Find the component where following node belongs to.">
-<polygon fill="white" stroke="#666666" points="296,-104.88 190.75,-104.88 190.75,-74.38 296,-74.38 296,-104.88"/>
-<text text-anchor="start" x="198.75" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::disjoint_union</text>
-<text text-anchor="middle" x="243.38" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find_set</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.05,-62.27C151.56,-65.81 165.95,-69.59 179.59,-73.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.31,-76.45 188.87,-75.6 180.08,-69.67 178.31,-76.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282.88,-56.25 203.88,-56.25 203.88,-37 282.88,-37 282.88,-56.25"/>
-<text text-anchor="middle" x="243.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.09,-46.62C167.72,-46.62 180.52,-46.62 192.28,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.14,-50.13 202.14,-46.63 192.14,-43.13 192.14,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279.88,-19.25 206.88,-19.25 206.88,0 279.88,0 279.88,-19.25"/>
-<text text-anchor="middle" x="243.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.93,-30.93C164.07,-27.29 180.86,-23.5 195.74,-20.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.24,-23.62 205.22,-18.01 194.7,-16.79 196.24,-23.62"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.96,-105.36C207.96,-114.43 217.76,-122.88 243.38,-122.88 257.38,-122.88 266.66,-120.35 271.21,-116.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="274.65,-117.25 272.58,-106.86 267.72,-116.28 274.65,-117.25"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d99/connected__components__with__dsu_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d99/connected__components__with__dsu_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index fbad36d72..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Test Implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/d8/d99/connected__components__with__dsu_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d99/connected__components__with__dsu_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 0d4e10a10..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c3d087a4c8128a406e23a4de492b9dda
\ No newline at end of file
diff --git a/d8/d99/connected__components__with__dsu_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d99/connected__components__with__dsu_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 05aec27a7..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test Implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d99/connected__components__with__dsu_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/d99/connected__components__with__dsu_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index b9f5253fb..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test Implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d99/connected__components__with__dsu_8cpp_ae91ed94113c56191b75fe45f688d6e62_cgraph.map b/d8/d99/connected__components__with__dsu_8cpp_ae91ed94113c56191b75fe45f688d6e62_cgraph.map
deleted file mode 100644
index cdb046b44..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_ae91ed94113c56191b75fe45f688d6e62_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="graph::disjoint_union::make_set" name="graph::disjoint_union::make_set">
-<area shape="rect" id="Node000001" title="function the initialize every node as it&#39;s own parent" alt="" coords="5,29,146,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="48,29,47,20,51,11,61,5,76,3,91,5,101,12,98,16,89,10,75,8,63,10,55,14,52,20,53,28"/>
-</map>
diff --git a/d8/d99/connected__components__with__dsu_8cpp_ae91ed94113c56191b75fe45f688d6e62_cgraph.md5 b/d8/d99/connected__components__with__dsu_8cpp_ae91ed94113c56191b75fe45f688d6e62_cgraph.md5
deleted file mode 100644
index 5d88c2eec..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_ae91ed94113c56191b75fe45f688d6e62_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6eafbb650c7f570b7bad1cc37c8e6469
\ No newline at end of file
diff --git a/d8/d99/connected__components__with__dsu_8cpp_ae91ed94113c56191b75fe45f688d6e62_cgraph.svg b/d8/d99/connected__components__with__dsu_8cpp_ae91ed94113c56191b75fe45f688d6e62_cgraph.svg
deleted file mode 100644
index 62eb521a1..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_ae91ed94113c56191b75fe45f688d6e62_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::disjoint_union::make_set Pages: 1 -->
-<svg width="113pt" height="57pt"
- viewBox="0.00 0.00 113.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>graph::disjoint_union::make_set</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="function the initialize every node as it&#39;s own parent">
-<polygon fill="#999999" stroke="#666666" points="105.25,-30.5 0,-30.5 0,0 105.25,0 105.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::disjoint_union</text>
-<text text-anchor="middle" x="52.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_set</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.97,-30.99C30.17,-40.06 36.39,-48.5 52.62,-48.5 61.51,-48.5 67.39,-45.97 70.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.74,-42.76 71.14,-32.49 66.77,-42.14 73.74,-42.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d99/connected__components__with__dsu_8cpp_ae91ed94113c56191b75fe45f688d6e62_cgraph_org.svg b/d8/d99/connected__components__with__dsu_8cpp_ae91ed94113c56191b75fe45f688d6e62_cgraph_org.svg
deleted file mode 100644
index 57d04713a..000000000
--- a/d8/d99/connected__components__with__dsu_8cpp_ae91ed94113c56191b75fe45f688d6e62_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::disjoint_union::make_set Pages: 1 -->
-<svg width="113pt" height="57pt"
- viewBox="0.00 0.00 113.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>graph::disjoint_union::make_set</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="function the initialize every node as it&#39;s own parent">
-<polygon fill="#999999" stroke="#666666" points="105.25,-30.5 0,-30.5 0,0 105.25,0 105.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::disjoint_union</text>
-<text text-anchor="middle" x="52.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_set</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.97,-30.99C30.17,-40.06 36.39,-48.5 52.62,-48.5 61.51,-48.5 67.39,-45.97 70.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.74,-42.76 71.14,-32.49 66.77,-42.14 73.74,-42.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d99/connected__components__with__dsu_8cpp_source.html b/d8/d99/connected__components__with__dsu_8cpp_source.html
new file mode 100644
index 000000000..de774b76d
--- /dev/null
+++ b/d8/d99/connected__components__with__dsu_8cpp_source.html
@@ -0,0 +1,224 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/connected_components_with_dsu.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/d99/connected__components__with__dsu_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">connected_components_with_dsu.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/d99/connected__components__with__dsu_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;set&gt;</span>       </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../de/db4/namespacedisjoint__union.html">disjoint_union</a> {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>uint32_t number_of_nodes = 0;                <span class="comment">// denotes number of nodes</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>std::vector&lt;int64_t&gt; parent{};               <span class="comment">// parent of each node</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>std::vector&lt;uint32_t&gt; connected_set_size{};  <span class="comment">// size of each set</span></div>
+<div class="foldopen" id="foldopen00043" data-start="{" data-end="}">
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="../../d8/d99/connected__components__with__dsu_8cpp.html#ae91ed94113c56191b75fe45f688d6e62">   43</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d99/connected__components__with__dsu_8cpp.html#ae91ed94113c56191b75fe45f688d6e62">make_set</a>() {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">for</span> (uint32_t i = 1; i &lt;= number_of_nodes; i++) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        parent[i] = i;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        connected_set_size[i] = 1;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00054" data-start="{" data-end="}">
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="../../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e">   54</a></span>int64_t <a class="code hl_function" href="../../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e">find_set</a>(int64_t val) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordflow">while</span> (parent[val] != val) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        parent[val] = parent[parent[val]];</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        val = parent[val];</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">return</span> val;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00067" data-start="{" data-end="}">
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../d8/d99/connected__components__with__dsu_8cpp.html#a67cb7472f310a798f555fe45cdf50145">   67</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d99/connected__components__with__dsu_8cpp.html#a67cb7472f310a798f555fe45cdf50145">union_sets</a>(int64_t node1, int64_t node2) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    node1 = <a class="code hl_function" href="../../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e">find_set</a>(node1);  <span class="comment">// find the parent of node1</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    node2 = <a class="code hl_function" href="../../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e">find_set</a>(node2);  <span class="comment">// find the parent of node2</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="comment">// If parents of both nodes are not same, combine them</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keywordflow">if</span> (node1 != node2) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        <span class="keywordflow">if</span> (connected_set_size[node1] &lt; connected_set_size[node2]) {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            std::swap(node1, node2);  <span class="comment">// swap both components</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        }</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        parent[node2] = node1;  <span class="comment">// make node1 as parent of node2.</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        connected_set_size[node1] +=</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            connected_set_size[node2];  <span class="comment">// sum the size of both as they combined</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00085" data-start="{" data-end="}">
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"><a class="line" href="../../d8/d99/connected__components__with__dsu_8cpp.html#ac2d6698b71384a352ec4b81b31b13141">   85</a></span>uint32_t <a class="code hl_function" href="../../d8/d99/connected__components__with__dsu_8cpp.html#ac2d6698b71384a352ec4b81b31b13141">no_of_connected_components</a>() {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    std::set&lt;int64_t&gt; temp;  <span class="comment">// temp set to count number of connected components</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="keywordflow">for</span> (uint32_t i = 1; i &lt;= number_of_nodes; i++) temp.insert(<a class="code hl_function" href="../../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e">find_set</a>(i));</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keywordflow">return</span> temp.size();  <span class="comment">// return the size of temp set</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>}</div>
+</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>}  <span class="comment">// namespace disjoint_union</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>}  <span class="comment">// namespace graph</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="foldopen" id="foldopen00097" data-start="{" data-end="}">
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"><a class="line" href="../../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   97</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keyword">namespace </span><a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> = graph::disjoint_union;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    std::cin &gt;&gt; dsu::number_of_nodes;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    dsu::parent.resize(dsu::number_of_nodes + 1);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    dsu::connected_set_size.resize(dsu::number_of_nodes + 1);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    dsu::make_set();</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    uint32_t edges = 0;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::cin &gt;&gt; edges;  <span class="comment">// no of edges in the graph</span></div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="keywordflow">while</span> (edges--) {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        int64_t node_a = 0, node_b = 0;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        std::cin &gt;&gt; node_a &gt;&gt; node_b;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        dsu::union_sets(node_a, node_b);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    }</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    std::cout &lt;&lt; dsu::no_of_connected_components() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>}</div>
+</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="foldopen" id="foldopen00117" data-start="{" data-end="}">
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"><a class="line" href="../../d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  117</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <a class="code hl_function" href="../../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Execute the tests</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>}</div>
+</div>
+<div class="ttc" id="aclassdsu_html"><div class="ttname"><a href="../../dd/d1f/classdsu.html">dsu</a></div><div class="ttdoc">Disjoint sets union data structure, class based representation.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00034">dsu_path_compression.cpp:34</a></div></div>
+<div class="ttc" id="aconnected__components__with__dsu_8cpp_html_a469384d8a4197a9b24482ce7c321a85e"><div class="ttname"><a href="../../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e">graph::disjoint_union::find_set</a></div><div class="ttdeci">int64_t find_set(int64_t val)</div><div class="ttdoc">Find the component where following node belongs to.</div><div class="ttdef"><b>Definition</b> <a href="#l00054">connected_components_with_dsu.cpp:54</a></div></div>
+<div class="ttc" id="aconnected__components__with__dsu_8cpp_html_a67cb7472f310a798f555fe45cdf50145"><div class="ttname"><a href="../../d8/d99/connected__components__with__dsu_8cpp.html#a67cb7472f310a798f555fe45cdf50145">graph::disjoint_union::union_sets</a></div><div class="ttdeci">void union_sets(int64_t node1, int64_t node2)</div><div class="ttdoc">Merge 2 components to become one.</div><div class="ttdef"><b>Definition</b> <a href="#l00067">connected_components_with_dsu.cpp:67</a></div></div>
+<div class="ttc" id="aconnected__components__with__dsu_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/d99/connected__components__with__dsu_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> <a href="#l00097">connected_components_with_dsu.cpp:97</a></div></div>
+<div class="ttc" id="aconnected__components__with__dsu_8cpp_html_ac2d6698b71384a352ec4b81b31b13141"><div class="ttname"><a href="../../d8/d99/connected__components__with__dsu_8cpp.html#ac2d6698b71384a352ec4b81b31b13141">graph::disjoint_union::no_of_connected_components</a></div><div class="ttdeci">uint32_t no_of_connected_components()</div><div class="ttdoc">Find total no. of connected components.</div><div class="ttdef"><b>Definition</b> <a href="#l00085">connected_components_with_dsu.cpp:85</a></div></div>
+<div class="ttc" id="aconnected__components__with__dsu_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00117">connected_components_with_dsu.cpp:117</a></div></div>
+<div class="ttc" id="aconnected__components__with__dsu_8cpp_html_ae91ed94113c56191b75fe45f688d6e62"><div class="ttname"><a href="../../d8/d99/connected__components__with__dsu_8cpp.html#ae91ed94113c56191b75fe45f688d6e62">graph::disjoint_union::make_set</a></div><div class="ttdeci">void make_set()</div><div class="ttdoc">function the initialize every node as it's own parent</div><div class="ttdef"><b>Definition</b> <a href="#l00043">connected_components_with_dsu.cpp:43</a></div></div>
+<div class="ttc" id="anamespacedisjoint__union_html"><div class="ttname"><a href="../../de/db4/namespacedisjoint__union.html">disjoint_union</a></div><div class="ttdoc">Functions for Disjoint union implementation.</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><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a class="el" href="../../d8/d99/connected__components__with__dsu_8cpp.html">connected_components_with_dsu.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/d9a/fast__fourier__transform_8cpp.html b/d8/d9a/fast__fourier__transform_8cpp.html
index f3124e3f7..29cdb20c4 100644
--- a/d8/d9a/fast__fourier__transform_8cpp.html
+++ b/d8/d9a/fast__fourier__transform_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/fast_fourier_transform.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/fast_fourier_transform.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for fast_fourier_transform.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d15/fast__fourier__transform_8cpp__incl.svg" width="512" height="126"><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">
+</div>
+<p><a href="../../d8/d9a/fast__fourier__transform_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr>
@@ -133,7 +152,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a158fd271b9a53e8f3f60b08b18857150" id="r_a158fd271b9a53e8f3f60b08b18857150"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; *p, uint8_t n)</td></tr>
+<tr class="memitem:a158fd271b9a53e8f3f60b08b18857150" id="r_a158fd271b9a53e8f3f60b08b18857150"><td class="memItemLeft" align="right" valign="top">std::complex&lt; double &gt; *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a> (std::complex&lt; double &gt; *p, uint8_t n)</td></tr>
 <tr class="memdesc:a158fd271b9a53e8f3f60b08b18857150"><td class="mdescLeft">&#160;</td><td class="mdescRight">FastFourierTransform is a recursive function which returns list of complex numbers.  <br /></td></tr>
 <tr class="separator:a158fd271b9a53e8f3f60b08b18857150"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -146,6 +165,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a href="https://medium.com/@aiswaryamathur/understanding-fast-fouriertransform-from-scratch-to-solve-polynomial-multiplication-8018d511162f" target="_blank">A fast Fourier transform (FFT)</a> is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). </p>
 <p>This algorithm has application in use case scenario where a user wants to find points of a function in a short time by just using the coefficients of the polynomial function. It can be also used to find inverse fourier transform by just switching the value of omega. Time complexity this algorithm computes the DFT in O(nlogn) time in comparison to traditional O(n^2). </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/ameyachawlaggsipu" target="_blank">Ameya Chawla</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/d9a/fast__fourier__transform_8cpp_source.html">fast_fourier_transform.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="abf9e6b7e6f15df4b525a2e7705ba3089" name="abf9e6b7e6f15df4b525a2e7705ba3089"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#abf9e6b7e6f15df4b525a2e7705ba3089">&#9670;&#160;</a></span>main()</h2>
@@ -175,18 +196,15 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d9a/fast__fourier__transform_8cpp_source.html#l00163">163</a> of file <a class="el" href="../../d8/d9a/fast__fourier__transform_8cpp_source.html">fast_fourier_transform.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  163</span>                                       {</div>
 <div class="line"><span class="lineno">  164</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">//  run self-test implementations</span></div>
 <div class="line"><span class="lineno">  165</span>             <span class="comment">//  with 2 defined test cases</span></div>
 <div class="line"><span class="lineno">  166</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  167</span>}</div>
-<div class="ttc" id="afast__fourier__transform_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> fast_fourier_transform.cpp:105</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d9a/fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg" width="346" height="175"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afast__fourier__transform_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d9a/fast__fourier__transform_8cpp_source.html#l00105">fast_fourier_transform.cpp:105</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -222,11 +240,13 @@ Here is the call graph for this function:</div>
 <p>Temporary variable used to delete memory location of o2</p>
 <p>Comparing for both real and imaginary values for test case 1</p>
 <p>Comparing for both real and imaginary values for test case 2</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d9a/fast__fourier__transform_8cpp_source.html#l00105">105</a> of file <a class="el" href="../../d8/d9a/fast__fourier__transform_8cpp_source.html">fast_fourier_transform.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  105</span>                   {</div>
 <div class="line"><span class="lineno">  106</span>    <span class="comment">/* descriptions of the following test */</span></div>
 <div class="line"><span class="lineno">  107</span> </div>
-<div class="line"><span class="lineno">  108</span>    <span class="keyword">auto</span> *t1 = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[2];  <span class="comment">/// Test case 1</span></div>
-<div class="line"><span class="lineno">  109</span>    <span class="keyword">auto</span> *t2 = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[4];  <span class="comment">/// Test case 2</span></div>
+<div class="line"><span class="lineno">  108</span>    <span class="keyword">auto</span> *t1 = <span class="keyword">new</span> std::complex&lt;double&gt;[2];  </div>
+<div class="line"><span class="lineno">  109</span>    <span class="keyword">auto</span> *t2 = <span class="keyword">new</span> std::complex&lt;double&gt;[4];  </div>
 <div class="line"><span class="lineno">  110</span> </div>
 <div class="line"><span class="lineno">  111</span>    t1[0] = {1, 0};</div>
 <div class="line"><span class="lineno">  112</span>    t1[1] = {2, 0};</div>
@@ -237,52 +257,40 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  117</span> </div>
 <div class="line"><span class="lineno">  118</span>    uint8_t n1 = 2;</div>
 <div class="line"><span class="lineno">  119</span>    uint8_t n2 = 4;</div>
-<div class="line"><span class="lineno">  120</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::complex&lt;double&gt;</a>&gt; r1 = {</div>
-<div class="line"><span class="lineno">  121</span>        {3, 0}, {-1, 0}};  <span class="comment">/// True Answer for test case 1</span></div>
+<div class="line"><span class="lineno">  120</span>    std::vector&lt;std::complex&lt;double&gt;&gt; r1 = {</div>
+<div class="line"><span class="lineno">  121</span>        {3, 0}, {-1, 0}};  </div>
 <div class="line"><span class="lineno">  122</span> </div>
-<div class="line"><span class="lineno">  123</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::complex&lt;double&gt;</a>&gt; r2 = {</div>
-<div class="line"><span class="lineno">  124</span>        {10, 0}, {-2, -2}, {-2, 0}, {-2, 2}};  <span class="comment">/// True Answer for test case 2</span></div>
+<div class="line"><span class="lineno">  123</span>    std::vector&lt;std::complex&lt;double&gt;&gt; r2 = {</div>
+<div class="line"><span class="lineno">  124</span>        {10, 0}, {-2, -2}, {-2, 0}, {-2, 2}};  </div>
 <div class="line"><span class="lineno">  125</span> </div>
-<div class="line"><span class="lineno">  126</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *o1 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a>(t1, n1);</div>
-<div class="line"><span class="lineno">  127</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *t3 =</div>
-<div class="line"><span class="lineno">  128</span>        o1;  <span class="comment">/// Temporary variable used to delete memory location of o1</span></div>
-<div class="line"><span class="lineno">  129</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *o2 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a>(t2, n2);</div>
-<div class="line"><span class="lineno">  130</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *t4 =</div>
-<div class="line"><span class="lineno">  131</span>        o2;  <span class="comment">/// Temporary variable used to delete memory location of o2</span></div>
+<div class="line"><span class="lineno">  126</span>    std::complex&lt;double&gt; *o1 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a>(t1, n1);</div>
+<div class="line"><span class="lineno">  127</span>    std::complex&lt;double&gt; *t3 =</div>
+<div class="line"><span class="lineno">  128</span>        o1;  </div>
+<div class="line"><span class="lineno">  129</span>    std::complex&lt;double&gt; *o2 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a>(t2, n2);</div>
+<div class="line"><span class="lineno">  130</span>    std::complex&lt;double&gt; *t4 =</div>
+<div class="line"><span class="lineno">  131</span>        o2;  </div>
 <div class="line"><span class="lineno">  132</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; n1; i++) {</div>
-<div class="line"><span class="lineno">  133</span>        assert((r1[i].real() - o1-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">real</a>() &lt; 0.000000000001) &amp;&amp;</div>
-<div class="line"><span class="lineno">  134</span>               (r1[i].imag() - o1-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">imag</a>() &lt;</div>
-<div class="line"><span class="lineno">  135</span>                0.000000000001));  <span class="comment">/// Comparing for both real and imaginary</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  136</span><span class="comment">                                   /// values for test case 1</span></div>
-<div class="line"><span class="lineno">  137</span><span class="comment"></span>        o1++;</div>
+<div class="line"><span class="lineno">  133</span>        assert((r1[i].real() - o1-&gt;real() &lt; 0.000000000001) &amp;&amp;</div>
+<div class="line"><span class="lineno">  134</span>               (r1[i].imag() - o1-&gt;imag() &lt;</div>
+<div class="line"><span class="lineno">  135</span>                0.000000000001));  </div>
+<div class="line"><span class="lineno">  137</span>        o1++;</div>
 <div class="line"><span class="lineno">  138</span>    }</div>
 <div class="line"><span class="lineno">  139</span> </div>
 <div class="line"><span class="lineno">  140</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; n2; i++) {</div>
-<div class="line"><span class="lineno">  141</span>        assert((r2[i].real() - o2-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">real</a>() &lt; 0.000000000001) &amp;&amp;</div>
-<div class="line"><span class="lineno">  142</span>               (r2[i].imag() - o2-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">imag</a>() &lt;</div>
-<div class="line"><span class="lineno">  143</span>                0.000000000001));  <span class="comment">/// Comparing for both real and imaginary</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  144</span><span class="comment">                                   /// values for test case 2</span></div>
-<div class="line"><span class="lineno">  145</span><span class="comment"></span>        o2++;</div>
+<div class="line"><span class="lineno">  141</span>        assert((r2[i].real() - o2-&gt;real() &lt; 0.000000000001) &amp;&amp;</div>
+<div class="line"><span class="lineno">  142</span>               (r2[i].imag() - o2-&gt;imag() &lt;</div>
+<div class="line"><span class="lineno">  143</span>                0.000000000001));  </div>
+<div class="line"><span class="lineno">  145</span>        o2++;</div>
 <div class="line"><span class="lineno">  146</span>    }</div>
 <div class="line"><span class="lineno">  147</span> </div>
 <div class="line"><span class="lineno">  148</span>    <span class="keyword">delete</span>[] t1;</div>
 <div class="line"><span class="lineno">  149</span>    <span class="keyword">delete</span>[] t2;</div>
 <div class="line"><span class="lineno">  150</span>    <span class="keyword">delete</span>[] t3;</div>
 <div class="line"><span class="lineno">  151</span>    <span class="keyword">delete</span>[] t4;</div>
-<div class="line"><span class="lineno">  152</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  152</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  153</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="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div></div>
-<div class="ttc" id="aimag_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">std::complex::imag</a></div><div class="ttdeci">T imag(T... args)</div></div>
-<div class="ttc" id="anamespacenumerical__methods_html_a158fd271b9a53e8f3f60b08b18857150"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a></div><div class="ttdeci">std::complex&lt; double &gt; * FastFourierTransform(std::complex&lt; double &gt; *p, uint8_t n)</div><div class="ttdoc">FastFourierTransform is a recursive function which returns list of complex numbers.</div><div class="ttdef"><b>Definition</b> fast_fourier_transform.cpp:42</div></div>
-<div class="ttc" id="areal_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">std::complex::real</a></div><div class="ttdeci">T real(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d9a/fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="248" height="175"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacenumerical__methods_html_a158fd271b9a53e8f3f60b08b18857150"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a></div><div class="ttdeci">std::complex&lt; double &gt; * FastFourierTransform(std::complex&lt; double &gt; *p, uint8_t n)</div><div class="ttdoc">FastFourierTransform is a recursive function which returns list of complex numbers.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d9a/fast__fourier__transform_8cpp_source.html#l00042">fast_fourier_transform.cpp:42</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d8/d9a/fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/d9a/fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 0dc0e2e63..000000000
--- a/d8/d9a/fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,94,49,120"/>
-<area shape="rect" id="Node000002" href="$d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150" title="FastFourierTransform is a recursive function which returns list of complex numbers." alt="" coords="97,29,243,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,96,102,74,104,79,50,101"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/imag.html#" title=" " alt="" coords="104,94,236,120"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="49,104,88,104,88,110,49,110"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/real.html#" title=" " alt="" coords="107,144,232,169"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="50,112,98,130,114,135,112,140,96,135,48,117"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="142,29,141,20,145,11,155,5,170,3,186,5,195,12,192,16,184,10,170,8,157,10,149,14,146,20,147,28"/>
-</map>
diff --git a/d8/d9a/fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/d9a/fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 3f5e133a8..000000000
--- a/d8/d9a/fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ddb5c97f4156b72bf6856236bb686e1a
\ No newline at end of file
diff --git a/d8/d9a/fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/d9a/fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index a7f66da26..000000000
--- a/d8/d9a/fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="186pt" height="131pt"
- viewBox="0.00 0.00 186.25 130.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 126.88)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-56.25 0,-56.25 0,-37 32.5,-37 32.5,-56.25"/>
-<text text-anchor="middle" x="16.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150" target="_top" xlink:title="FastFourierTransform is a recursive function which returns list of complex numbers.">
-<polygon fill="white" stroke="#666666" points="178.25,-104.88 68.5,-104.88 68.5,-74.38 178.25,-74.38 178.25,-104.88"/>
-<text text-anchor="start" x="76.5" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="123.38" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">FastFourierTransform</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.76,-52.97C43.61,-57.41 58.74,-63.59 73.48,-69.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.1,-72.84 82.68,-73.39 74.75,-66.36 72.1,-72.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173,-56.25 73.75,-56.25 73.75,-37 173,-37 173,-56.25"/>
-<text text-anchor="middle" x="123.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.76,-46.62C40.82,-46.62 51.23,-46.62 62.1,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.99,-50.13 71.99,-46.63 61.99,-43.13 61.99,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170.38,-19.25 76.38,-19.25 76.38,0 170.38,0 170.38,-19.25"/>
-<text text-anchor="middle" x="123.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.9,-40.67C43.03,-36.86 56.51,-31.85 68.5,-27.62 72.45,-26.23 76.58,-24.81 80.71,-23.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.76,-26.74 90.11,-20.22 79.52,-20.1 81.76,-26.74"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.39,-105.36C100.52,-114.43 106.85,-122.88 123.38,-122.88 132.41,-122.88 138.4,-120.35 141.34,-116.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.8,-117.14 142.22,-106.87 137.83,-116.51 144.8,-117.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d9a/fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d8/d9a/fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index ca7a605ff..000000000
--- a/d8/d9a/fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="186pt" height="131pt"
- viewBox="0.00 0.00 186.25 130.88" 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 126.88)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-56.25 0,-56.25 0,-37 32.5,-37 32.5,-56.25"/>
-<text text-anchor="middle" x="16.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150" target="_top" xlink:title="FastFourierTransform is a recursive function which returns list of complex numbers.">
-<polygon fill="white" stroke="#666666" points="178.25,-104.88 68.5,-104.88 68.5,-74.38 178.25,-74.38 178.25,-104.88"/>
-<text text-anchor="start" x="76.5" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="123.38" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">FastFourierTransform</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.76,-52.97C43.61,-57.41 58.74,-63.59 73.48,-69.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.1,-72.84 82.68,-73.39 74.75,-66.36 72.1,-72.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173,-56.25 73.75,-56.25 73.75,-37 173,-37 173,-56.25"/>
-<text text-anchor="middle" x="123.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.76,-46.62C40.82,-46.62 51.23,-46.62 62.1,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.99,-50.13 71.99,-46.63 61.99,-43.13 61.99,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170.38,-19.25 76.38,-19.25 76.38,0 170.38,0 170.38,-19.25"/>
-<text text-anchor="middle" x="123.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.9,-40.67C43.03,-36.86 56.51,-31.85 68.5,-27.62 72.45,-26.23 76.58,-24.81 80.71,-23.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.76,-26.74 90.11,-20.22 79.52,-20.1 81.76,-26.74"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.39,-105.36C100.52,-114.43 106.85,-122.88 123.38,-122.88 132.41,-122.88 138.4,-120.35 141.34,-116.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.8,-117.14 142.22,-106.87 137.83,-116.51 144.8,-117.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d9a/fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map b/d8/d9a/fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map
deleted file mode 100644
index ee4ce846c..000000000
--- a/d8/d9a/fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,94,55,120"/>
-<area shape="rect" id="Node000002" href="$d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,94,146,120"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,104,87,104,87,110,55,110"/>
-<area shape="rect" id="Node000003" href="$d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150" title="FastFourierTransform is a recursive function which returns list of complex numbers." alt="" coords="194,29,340,70"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="145,96,200,74,202,79,147,101"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/imag.html#" title=" " alt="" coords="201,94,333,120"/>
-<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="146,104,185,104,185,110,146,110"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/real.html#" title=" " alt="" coords="204,144,330,169"/>
-<area shape="poly" id="edge5_Node000002_Node000005" title=" " alt="" coords="147,112,195,130,211,135,209,140,193,135,146,117"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="239,29,238,20,242,11,252,5,267,3,283,5,293,12,290,16,281,10,267,8,254,10,246,14,243,20,244,28"/>
-</map>
diff --git a/d8/d9a/fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5 b/d8/d9a/fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
deleted file mode 100644
index 1fbaadcf9..000000000
--- a/d8/d9a/fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8de2d4e4d72b217209b5449e673fbff0
\ No newline at end of file
diff --git a/d8/d9a/fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg b/d8/d9a/fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
deleted file mode 100644
index 9a6b8ba96..000000000
--- a/d8/d9a/fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
+++ /dev/null
@@ -1,129 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="259pt" height="131pt"
- viewBox="0.00 0.00 259.25 130.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 126.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-56.25 73,-56.25 73,-37 105.5,-37 105.5,-56.25"/>
-<text text-anchor="middle" x="89.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-46.62C44.58,-46.62 53.31,-46.62 61.45,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-50.13 71.2,-46.63 61.2,-43.13 61.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150" target="_top" xlink:title="FastFourierTransform is a recursive function which returns list of complex numbers.">
-<polygon fill="white" stroke="#666666" points="251.25,-104.88 141.5,-104.88 141.5,-74.38 251.25,-74.38 251.25,-104.88"/>
-<text text-anchor="start" x="149.5" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="196.38" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">FastFourierTransform</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.76,-52.97C116.61,-57.41 131.74,-63.59 146.48,-69.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.1,-72.84 155.68,-73.39 147.75,-66.36 145.1,-72.84"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246,-56.25 146.75,-56.25 146.75,-37 246,-37 246,-56.25"/>
-<text text-anchor="middle" x="196.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.76,-46.62C113.82,-46.62 124.23,-46.62 135.1,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.99,-50.13 144.99,-46.63 134.99,-43.13 134.99,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.38,-19.25 149.38,-19.25 149.38,0 243.38,0 243.38,-19.25"/>
-<text text-anchor="middle" x="196.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.9,-40.67C116.03,-36.86 129.51,-31.85 141.5,-27.62 145.45,-26.23 149.58,-24.81 153.71,-23.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.76,-26.74 163.11,-20.22 152.52,-20.1 154.76,-26.74"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.39,-105.36C173.52,-114.43 179.85,-122.88 196.38,-122.88 205.41,-122.88 211.4,-120.35 214.34,-116.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.8,-117.14 215.22,-106.87 210.83,-116.51 217.8,-117.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d9a/fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg b/d8/d9a/fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg
deleted file mode 100644
index 911885206..000000000
--- a/d8/d9a/fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="259pt" height="131pt"
- viewBox="0.00 0.00 259.25 130.88" 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 126.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-56.25 73,-56.25 73,-37 105.5,-37 105.5,-56.25"/>
-<text text-anchor="middle" x="89.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-46.62C44.58,-46.62 53.31,-46.62 61.45,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-50.13 71.2,-46.63 61.2,-43.13 61.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150" target="_top" xlink:title="FastFourierTransform is a recursive function which returns list of complex numbers.">
-<polygon fill="white" stroke="#666666" points="251.25,-104.88 141.5,-104.88 141.5,-74.38 251.25,-74.38 251.25,-104.88"/>
-<text text-anchor="start" x="149.5" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="196.38" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">FastFourierTransform</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.76,-52.97C116.61,-57.41 131.74,-63.59 146.48,-69.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.1,-72.84 155.68,-73.39 147.75,-66.36 145.1,-72.84"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246,-56.25 146.75,-56.25 146.75,-37 246,-37 246,-56.25"/>
-<text text-anchor="middle" x="196.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.76,-46.62C113.82,-46.62 124.23,-46.62 135.1,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.99,-50.13 144.99,-46.63 134.99,-43.13 134.99,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.38,-19.25 149.38,-19.25 149.38,0 243.38,0 243.38,-19.25"/>
-<text text-anchor="middle" x="196.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.9,-40.67C116.03,-36.86 129.51,-31.85 141.5,-27.62 145.45,-26.23 149.58,-24.81 153.71,-23.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.76,-26.74 163.11,-20.22 152.52,-20.1 154.76,-26.74"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.39,-105.36C173.52,-114.43 179.85,-122.88 196.38,-122.88 205.41,-122.88 211.4,-120.35 214.34,-116.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.8,-117.14 215.22,-106.87 210.83,-116.51 217.8,-117.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d9a/fast__fourier__transform_8cpp_source.html b/d8/d9a/fast__fourier__transform_8cpp_source.html
new file mode 100644
index 000000000..4bbcfa7bc
--- /dev/null
+++ b/d8/d9a/fast__fourier__transform_8cpp_source.html
@@ -0,0 +1,265 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/fast_fourier_transform.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/d9a/fast__fourier__transform_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">fast_fourier_transform.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/d9a/fast__fourier__transform_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;cmath&gt;</span>     </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;complex&gt;</span>   </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a> {</div>
+<div class="foldopen" id="foldopen00042" data-start="{" data-end="}">
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">   42</a></span>std::complex&lt;double&gt; *<a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">FastFourierTransform</a>(std::complex&lt;double&gt; *p, uint8_t n) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">if</span> (n == 1) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="keywordflow">return</span> p;  </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordtype">double</span> pi = 2 * asin(1.0);  </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    std::complex&lt;double&gt; om = std::complex&lt;double&gt;(</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        cos(2 * pi / n), sin(2 * pi / n));  </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keyword">auto</span> *pe = <span class="keyword">new</span> std::complex&lt;double&gt;[n / 2];  </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keyword">auto</span> *po = <span class="keyword">new</span> std::complex&lt;double&gt;[n / 2];  </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordtype">int</span> k1 = 0, k2 = 0;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordflow">if</span> (j % 2 == 0) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            pe[k1++] = p[j];  </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            po[k2++] = p[j];  </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    std::complex&lt;double&gt; *ye =</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">FastFourierTransform</a>(pe, n / 2);  </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    std::complex&lt;double&gt; *yo =</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">FastFourierTransform</a>(po, n / 2);  </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keyword">auto</span> *y = <span class="keyword">new</span> std::complex&lt;double&gt;[n];  </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    k1 = 0, k2 = 0;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n / 2; i++) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        y[i] =</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            ye[k1] + pow(om, i) * yo[k2];  </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        y[i + n / 2] =</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>            ye[k1] - pow(om, i) * yo[k2];  </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        k1++;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        k2++;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    }</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordflow">if</span> (n != 2) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        <span class="keyword">delete</span>[] pe;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        <span class="keyword">delete</span>[] po;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keyword">delete</span>[] ye;  </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keyword">delete</span>[] yo;  </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="keywordflow">return</span> y;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>}</div>
+</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>}  <span class="comment">// namespace numerical_methods</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="foldopen" id="foldopen00105" data-start="{" data-end="}">
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"><a class="line" href="../../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  105</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="comment">/* descriptions of the following test */</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="keyword">auto</span> *t1 = <span class="keyword">new</span> std::complex&lt;double&gt;[2];  </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="keyword">auto</span> *t2 = <span class="keyword">new</span> std::complex&lt;double&gt;[4];  </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span> </div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    t1[0] = {1, 0};</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    t1[1] = {2, 0};</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    t2[0] = {1, 0};</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    t2[1] = {2, 0};</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    t2[2] = {3, 0};</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    t2[3] = {4, 0};</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span> </div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    uint8_t n1 = 2;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    uint8_t n2 = 4;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    std::vector&lt;std::complex&lt;double&gt;&gt; r1 = {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        {3, 0}, {-1, 0}};  </div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span> </div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    std::vector&lt;std::complex&lt;double&gt;&gt; r2 = {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        {10, 0}, {-2, -2}, {-2, 0}, {-2, 2}};  </div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    std::complex&lt;double&gt; *o1 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a>(t1, n1);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    std::complex&lt;double&gt; *t3 =</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        o1;  </div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    std::complex&lt;double&gt; *o2 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a>(t2, n2);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    std::complex&lt;double&gt; *t4 =</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        o2;  </div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; n1; i++) {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        assert((r1[i].real() - o1-&gt;real() &lt; 0.000000000001) &amp;&amp;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>               (r1[i].imag() - o1-&gt;imag() &lt;</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>                0.000000000001));  </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        o1++;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    }</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span> </div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; n2; i++) {</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        assert((r2[i].real() - o2-&gt;real() &lt; 0.000000000001) &amp;&amp;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>               (r2[i].imag() - o2-&gt;imag() &lt;</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>                0.000000000001));  </div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        o2++;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    }</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span> </div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    <span class="keyword">delete</span>[] t1;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    <span class="keyword">delete</span>[] t2;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    <span class="keyword">delete</span>[] t3;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    <span class="keyword">delete</span>[] t4;</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>}</div>
+</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span> </div>
+<div class="foldopen" id="foldopen00163" data-start="{" data-end="}">
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"><a class="line" href="../../d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089">  163</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> <span class="keyword">const</span> *argv[]) {</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    <a class="code hl_function" href="../../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">//  run self-test implementations</span></div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>             <span class="comment">//  with 2 defined test cases</span></div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>}</div>
+</div>
+<div class="ttc" id="afast__fourier__transform_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/d9a/fast__fourier__transform_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> <a href="#l00105">fast_fourier_transform.cpp:105</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacenumerical__methods_html"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacenumerical__methods_html_a158fd271b9a53e8f3f60b08b18857150"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150">numerical_methods::FastFourierTransform</a></div><div class="ttdeci">std::complex&lt; double &gt; * FastFourierTransform(std::complex&lt; double &gt; *p, uint8_t n)</div><div class="ttdoc">FastFourierTransform is a recursive function which returns list of complex numbers.</div><div class="ttdef"><b>Definition</b> <a href="#l00042">fast_fourier_transform.cpp:42</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../d8/d9a/fast__fourier__transform_8cpp.html">fast_fourier_transform.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/d9c/union__of__two__arrays_8cpp.html b/d8/d9c/union__of__two__arrays_8cpp.html
index ddf33eb3b..e484759e1 100644
--- a/d8/d9c/union__of__two__arrays_8cpp.html
+++ b/d8/d9c/union__of__two__arrays_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: operations_on_datastructures/union_of_two_arrays.cpp File Reference</title>
+<title>TheAlgorithms/C++: operations_on_datastructures/union_of_two_arrays.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,11 +139,13 @@ Include dependency graph for union_of_two_arrays.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/dd7/union__of__two__arrays_8cpp__incl.svg" width="350" height="126"><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">
+</div>
+<p><a href="../../d8/d9c/union__of__two__arrays_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></td></tr>
-<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
+<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::vector <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html">tests</a></td></tr>
 <tr class="memdesc:d9/df4/namespacetests"><td class="mdescLeft">&#160;</td><td class="mdescRight">Testcases to check Union of Two Arrays. <br /></td></tr>
@@ -134,10 +153,10 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a6109193567a5b7e36a27f2b4865fce20" id="r_a6109193567a5b7e36a27f2b4865fce20"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures::print</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;array)</td></tr>
+<tr class="memitem:a6109193567a5b7e36a27f2b4865fce20" id="r_a6109193567a5b7e36a27f2b4865fce20"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures::print</a> (const std::vector&lt; int32_t &gt; &amp;array)</td></tr>
 <tr class="memdesc:a6109193567a5b7e36a27f2b4865fce20"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints the values of a vector sequentially, ending with a newline character.  <br /></td></tr>
 <tr class="separator:a6109193567a5b7e36a27f2b4865fce20"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2b8ff06a84b041457873840bf82e2d74" id="r_a2b8ff06a84b041457873840bf82e2d74"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74">operations_on_datastructures::get_union</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;first, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;second)</td></tr>
+<tr class="memitem:a2b8ff06a84b041457873840bf82e2d74" id="r_a2b8ff06a84b041457873840bf82e2d74"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74">operations_on_datastructures::get_union</a> (const std::vector&lt; int32_t &gt; &amp;first, const std::vector&lt; int32_t &gt; &amp;second)</td></tr>
 <tr class="memdesc:a2b8ff06a84b041457873840bf82e2d74"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the union of two sorted arrays, and returns them in a vector.  <br /></td></tr>
 <tr class="separator:a2b8ff06a84b041457873840bf82e2d74"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a167c24bd817469ae47358d12e034f2d5" id="r_a167c24bd817469ae47358d12e034f2d5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a> ()</td></tr>
@@ -156,7 +175,7 @@ Functions</h2></td></tr>
 <tr class="memdesc:af7b81d7a1534216af6a36a80135beb86"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check a shift of zero.  <br /></td></tr>
 <tr class="separator:af7b81d7a1534216af6a36a80135beb86"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aacafde185abd8670abee51157f273dc2" id="r_aacafde185abd8670abee51157f273dc2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">tests::test6</a> ()</td></tr>
-<tr class="memdesc:aacafde185abd8670abee51157f273dc2"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check correct functionality with an array sorted using <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a>.  <br /></td></tr>
+<tr class="memdesc:aacafde185abd8670abee51157f273dc2"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check correct functionality with an array sorted using std::sort.  <br /></td></tr>
 <tr class="separator:aacafde185abd8670abee51157f273dc2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
 <tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to test the correctness of get_union() function.  <br /></td></tr>
@@ -169,6 +188,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Implementation for the <a href="https://en.wikipedia.org/wiki/Union_(set_theory)" target="_blank">Union of two sorted Arrays</a> algorithm. </p>
 <p>The Union of two arrays is the collection of all the unique elements in the first array, combined with all of the unique elements of a second array. This implementation uses ordered arrays, and an algorithm to correctly order them and return the result as a new array (vector). </p><dl class="section see"><dt>See also</dt><dd><a class="el" href="../../de/dc5/intersection__of__two__arrays_8cpp.html" title="Implementation for the Intersection of two sorted Arrays algorithm.">intersection_of_two_arrays.cpp</a> </dd></dl>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/polarvoid" target="_blank">Alvin</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/d9c/union__of__two__arrays_8cpp_source.html">union_of_two_arrays.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -187,17 +208,14 @@ Functions</h2></td></tr>
 
 <p>main function </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d9c/union__of__two__arrays_8cpp_source.html#l00217">217</a> of file <a class="el" href="../../d8/d9c/union__of__two__arrays_8cpp_source.html">union_of_two_arrays.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  217</span>           {</div>
 <div class="line"><span class="lineno">  218</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  219</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  220</span>}</div>
-<div class="ttc" id="aunion__of__two__arrays_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of get_union() function.</div><div class="ttdef"><b>Definition</b> union_of_two_arrays.cpp:204</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="490" height="332"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aunion__of__two__arrays_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of get_union() function.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d9c/union__of__two__arrays_8cpp_source.html#l00204">union_of_two_arrays.cpp:204</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -225,6 +243,8 @@ Here is the call graph for this function:</div>
 
 <p>Function to test the correctness of get_union() function. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d9c/union__of__two__arrays_8cpp_source.html#l00204">204</a> of file <a class="el" href="../../d8/d9c/union__of__two__arrays_8cpp_source.html">union_of_two_arrays.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  204</span>                   {</div>
 <div class="line"><span class="lineno">  205</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a>();</div>
 <div class="line"><span class="lineno">  206</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a>();</div>
@@ -233,18 +253,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  209</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a>();</div>
 <div class="line"><span class="lineno">  210</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">tests::test6</a>();</div>
 <div class="line"><span class="lineno">  211</span>}</div>
-<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:75</div></div>
-<div class="ttc" id="anamespacetests_html_a2b9769e44683dcb67fe1083ad91e134d"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a></div><div class="ttdeci">void test4()</div><div class="ttdoc">A Test to check a very large input.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:120</div></div>
-<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check an invalid shift value.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:105</div></div>
-<div class="ttc" id="anamespacetests_html_aacafde185abd8670abee51157f273dc2"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">tests::test6</a></div><div class="ttdeci">void test6()</div><div class="ttdoc">A Test to check correct functionality with an array sorted using std::sort.</div><div class="ttdef"><b>Definition</b> intersection_of_two_arrays.cpp:166</div></div>
-<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an empty vector.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:90</div></div>
-<div class="ttc" id="anamespacetests_html_af7b81d7a1534216af6a36a80135beb86"><div class="ttname"><a href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a></div><div class="ttdeci">void test5()</div><div class="ttdoc">A Test to check a shift of zero.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:143</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="392" height="332"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00075">array_left_rotation.cpp:75</a></div></div>
+<div class="ttc" id="anamespacetests_html_a2b9769e44683dcb67fe1083ad91e134d"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a></div><div class="ttdeci">void test4()</div><div class="ttdoc">A Test to check a very large input.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00120">array_left_rotation.cpp:120</a></div></div>
+<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check an invalid shift value.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00105">array_left_rotation.cpp:105</a></div></div>
+<div class="ttc" id="anamespacetests_html_aacafde185abd8670abee51157f273dc2"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">tests::test6</a></div><div class="ttdeci">void test6()</div><div class="ttdoc">A Test to check correct functionality with an array sorted using std::sort.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc5/intersection__of__two__arrays_8cpp_source.html#l00166">intersection_of_two_arrays.cpp:166</a></div></div>
+<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an empty vector.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00090">array_left_rotation.cpp:90</a></div></div>
+<div class="ttc" id="anamespacetests_html_af7b81d7a1534216af6a36a80135beb86"><div class="ttname"><a href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a></div><div class="ttdeci">void test5()</div><div class="ttdoc">A Test to check a shift of zero.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00143">array_left_rotation.cpp:143</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 8703c28c0..000000000
--- a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,23 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Function to test the correctness of get_union() function." alt="" coords="5,129,49,155"/>
-<area shape="rect" id="Node000002" href="$d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" title="A Test to check an simple case." alt="" coords="97,5,184,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="33,127,57,86,95,40,97,38,101,42,99,44,61,89,37,130"/>
-<area shape="rect" id="Node000003" href="$d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" title="A Test to check an empty vector." alt="" coords="97,55,184,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="43,127,95,89,99,87,102,91,98,94,46,131"/>
-<area shape="rect" id="Node000004" href="$d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" title="A Test to check an invalid shift value." alt="" coords="97,104,184,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,135,81,127,82,133,50,140"/>
-<area shape="rect" id="Node000005" href="$d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" title="A Test to check a very large input." alt="" coords="97,153,184,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="50,144,82,151,81,156,49,149"/>
-<area shape="rect" id="Node000007" href="$d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" title="A Test to check a shift of zero." alt="" coords="97,203,184,228"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="47,153,98,189,103,192,100,197,95,194,44,157"/>
-<area shape="rect" id="Node000008" href="$d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2" title="A Test to check correct functionality with an array sorted using std::sort." alt="" coords="97,252,184,278"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="37,154,61,195,99,239,101,241,97,245,95,243,57,198,33,157"/>
-<area shape="rect" id="Node000006" 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="232,153,386,179"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="184,164,216,164,216,169,184,169"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="248,203,370,228"/>
-<area shape="poly" id="edge8_Node000008_Node000009" title=" " alt="" coords="184,250,248,231,249,236,185,255"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="253,252,365,278"/>
-<area shape="poly" id="edge9_Node000008_Node000010" title=" " alt="" coords="184,262,238,262,238,268,184,268"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/sort.html#" title=" " alt="" coords="274,301,344,327"/>
-<area shape="poly" id="edge10_Node000008_Node000011" title=" " alt="" coords="185,275,260,297,259,302,184,280"/>
-</map>
diff --git a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index fb8034549..000000000
--- a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ec51de2ee5150c88c0701ac471df0639
\ No newline at end of file
diff --git a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 88bf2e190..000000000
--- a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,227 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="294pt" height="249pt"
- viewBox="0.00 0.00 293.75 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the correctness of get_union() function.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-148.25 0,-148.25 0,-129 32.5,-129 32.5,-148.25"/>
-<text text-anchor="middle" x="16.25" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="134,-241.25 68.5,-241.25 68.5,-222 134,-222 134,-241.25"/>
-<text text-anchor="middle" x="101.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.19,-148.68C30.2,-164.16 47.26,-194.09 68.5,-213.62 69.11,-214.19 69.74,-214.74 70.39,-215.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.06,-217.92 78.26,-220.81 72.09,-212.2 68.06,-217.92"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="134,-204.25 68.5,-204.25 68.5,-185 134,-185 134,-204.25"/>
-<text text-anchor="middle" x="101.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.58,-148.43C39.78,-156.38 54.76,-167.68 68.5,-176.62 69.54,-177.3 70.6,-177.97 71.68,-178.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.87,-181.65 80.25,-183.76 73.45,-175.63 69.87,-181.65"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="134,-167.25 68.5,-167.25 68.5,-148 134,-148 134,-167.25"/>
-<text text-anchor="middle" x="101.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-142.2C39.86,-143.8 48.5,-145.78 57.22,-147.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.2,-151.13 66.73,-149.95 57.77,-144.31 56.2,-151.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="134,-130.25 68.5,-130.25 68.5,-111 134,-111 134,-130.25"/>
-<text text-anchor="middle" x="101.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-135.24C39.86,-133.72 48.5,-131.85 57.22,-129.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.7,-133.43 66.73,-127.89 56.21,-126.59 57.7,-133.43"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="134,-93.25 68.5,-93.25 68.5,-74 134,-74 134,-93.25"/>
-<text text-anchor="middle" x="101.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.04,-128.79C40.24,-121.1 55.02,-110.28 68.5,-101.62 69.7,-100.86 70.93,-100.08 72.19,-99.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.78,-102.44 80.61,-94.34 70.22,-96.41 73.78,-102.44"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2" target="_top" xlink:title="A Test to check correct functionality with an array sorted using std::sort.">
-<polygon fill="white" stroke="#666666" points="134,-56.25 68.5,-56.25 68.5,-37 134,-37 134,-56.25"/>
-<text text-anchor="middle" x="101.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test6</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.23,-128.71C30.27,-113.44 47.39,-83.92 68.5,-64.62 69.11,-64.06 69.75,-63.51 70.4,-62.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.09,-66.06 78.27,-57.45 68.07,-60.33 72.09,-66.06"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.75,-130.25 170,-130.25 170,-111 285.75,-111 285.75,-130.25"/>
-<text text-anchor="middle" x="227.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-120.62C141.78,-120.62 149.98,-120.62 158.32,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.23,-124.13 168.23,-120.63 158.23,-117.13 158.23,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273.75,-93.25 182,-93.25 182,-74 273.75,-74 273.75,-93.25"/>
-<text text-anchor="middle" x="227.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge8_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge8_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-56.15C148.99,-60.5 166.58,-65.72 182.47,-70.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.11,-73.69 191.7,-73.18 183.11,-66.98 181.11,-73.69"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270,-56.25 185.75,-56.25 185.75,-37 270,-37 270,-56.25"/>
-<text text-anchor="middle" x="227.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge9_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge9_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-46.62C146.51,-46.62 160.71,-46.62 174.28,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.96,-50.13 183.96,-46.63 173.96,-43.13 173.96,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.88,-19.25 201.88,-19.25 201.88,0 253.88,0 253.88,-19.25"/>
-<text text-anchor="middle" x="227.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node11 -->
-<g id="edge10_Node000008_Node000011" class="edge">
-<title>Node8&#45;&gt;Node11</title>
-<g id="a_edge10_Node000008_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-37.1C151.58,-31.98 172.89,-25.65 190.71,-20.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.53,-23.77 200.12,-17.57 189.53,-17.06 191.53,-23.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index d7139cbb1..000000000
--- a/d8/d9c/union__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,201 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="294pt" height="249pt"
- viewBox="0.00 0.00 293.75 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the correctness of get_union() function.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-148.25 0,-148.25 0,-129 32.5,-129 32.5,-148.25"/>
-<text text-anchor="middle" x="16.25" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="134,-241.25 68.5,-241.25 68.5,-222 134,-222 134,-241.25"/>
-<text text-anchor="middle" x="101.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.19,-148.68C30.2,-164.16 47.26,-194.09 68.5,-213.62 69.11,-214.19 69.74,-214.74 70.39,-215.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.06,-217.92 78.26,-220.81 72.09,-212.2 68.06,-217.92"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="134,-204.25 68.5,-204.25 68.5,-185 134,-185 134,-204.25"/>
-<text text-anchor="middle" x="101.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.58,-148.43C39.78,-156.38 54.76,-167.68 68.5,-176.62 69.54,-177.3 70.6,-177.97 71.68,-178.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.87,-181.65 80.25,-183.76 73.45,-175.63 69.87,-181.65"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="134,-167.25 68.5,-167.25 68.5,-148 134,-148 134,-167.25"/>
-<text text-anchor="middle" x="101.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-142.2C39.86,-143.8 48.5,-145.78 57.22,-147.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.2,-151.13 66.73,-149.95 57.77,-144.31 56.2,-151.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="134,-130.25 68.5,-130.25 68.5,-111 134,-111 134,-130.25"/>
-<text text-anchor="middle" x="101.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-135.24C39.86,-133.72 48.5,-131.85 57.22,-129.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.7,-133.43 66.73,-127.89 56.21,-126.59 57.7,-133.43"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="134,-93.25 68.5,-93.25 68.5,-74 134,-74 134,-93.25"/>
-<text text-anchor="middle" x="101.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.04,-128.79C40.24,-121.1 55.02,-110.28 68.5,-101.62 69.7,-100.86 70.93,-100.08 72.19,-99.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.78,-102.44 80.61,-94.34 70.22,-96.41 73.78,-102.44"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2" target="_top" xlink:title="A Test to check correct functionality with an array sorted using std::sort.">
-<polygon fill="white" stroke="#666666" points="134,-56.25 68.5,-56.25 68.5,-37 134,-37 134,-56.25"/>
-<text text-anchor="middle" x="101.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test6</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.23,-128.71C30.27,-113.44 47.39,-83.92 68.5,-64.62 69.11,-64.06 69.75,-63.51 70.4,-62.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.09,-66.06 78.27,-57.45 68.07,-60.33 72.09,-66.06"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.75,-130.25 170,-130.25 170,-111 285.75,-111 285.75,-130.25"/>
-<text text-anchor="middle" x="227.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-120.62C141.78,-120.62 149.98,-120.62 158.32,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.23,-124.13 168.23,-120.63 158.23,-117.13 158.23,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273.75,-93.25 182,-93.25 182,-74 273.75,-74 273.75,-93.25"/>
-<text text-anchor="middle" x="227.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge8_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge8_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-56.15C148.99,-60.5 166.58,-65.72 182.47,-70.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.11,-73.69 191.7,-73.18 183.11,-66.98 181.11,-73.69"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270,-56.25 185.75,-56.25 185.75,-37 270,-37 270,-56.25"/>
-<text text-anchor="middle" x="227.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge9_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge9_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-46.62C146.51,-46.62 160.71,-46.62 174.28,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.96,-50.13 183.96,-46.63 173.96,-43.13 173.96,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.88,-19.25 201.88,-19.25 201.88,0 253.88,0 253.88,-19.25"/>
-<text text-anchor="middle" x="227.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node11 -->
-<g id="edge10_Node000008_Node000011" class="edge">
-<title>Node8&#45;&gt;Node11</title>
-<g id="a_edge10_Node000008_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-37.1C151.58,-31.98 172.89,-25.65 190.71,-20.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.53,-23.77 200.12,-17.57 189.53,-17.06 191.53,-23.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 1b5211e53..000000000
--- a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,25 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="main function" alt="" coords="5,129,55,155"/>
-<area shape="rect" id="Node000002" href="$d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function to test the correctness of get_union() function." alt="" coords="103,129,146,155"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,140,87,140,87,145,55,145"/>
-<area shape="rect" id="Node000003" href="$d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" title="A Test to check an simple case." alt="" coords="194,5,281,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="130,127,154,86,192,40,195,38,198,42,196,44,159,89,135,130"/>
-<area shape="rect" id="Node000004" href="$d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" title="A Test to check an empty vector." alt="" coords="194,55,281,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="141,127,193,89,197,87,200,91,195,94,144,131"/>
-<area shape="rect" id="Node000005" href="$d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" title="A Test to check an invalid shift value." alt="" coords="194,104,281,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="146,135,178,127,180,133,147,140"/>
-<area shape="rect" id="Node000006" href="$d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" title="A Test to check a very large input." alt="" coords="194,153,281,179"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="147,144,180,151,178,156,146,149"/>
-<area shape="rect" id="Node000008" href="$d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" title="A Test to check a shift of zero." alt="" coords="194,203,281,228"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="144,153,195,189,200,192,197,197,193,194,141,157"/>
-<area shape="rect" id="Node000009" href="$d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2" title="A Test to check correct functionality with an array sorted using std::sort." alt="" coords="194,252,281,278"/>
-<area shape="poly" id="edge8_Node000002_Node000009" title=" " alt="" coords="135,154,159,195,196,239,198,241,195,245,192,243,154,198,130,157"/>
-<area shape="rect" id="Node000007" 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="329,153,484,179"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="282,164,314,164,314,169,282,169"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="345,203,468,228"/>
-<area shape="poly" id="edge9_Node000009_Node000010" title=" " alt="" coords="281,250,345,231,347,236,283,255"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="350,252,463,278"/>
-<area shape="poly" id="edge10_Node000009_Node000011" title=" " alt="" coords="282,262,335,262,335,268,282,268"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/sort.html#" title=" " alt="" coords="372,301,441,327"/>
-<area shape="poly" id="edge11_Node000009_Node000012" title=" " alt="" coords="283,275,358,297,356,302,281,280"/>
-</map>
diff --git a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 5c86e2e06..000000000
--- a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3b19e58a0fa55b11752155d23f96a95b
\ No newline at end of file
diff --git a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 4494363bb..000000000
--- a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,245 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="367pt" height="249pt"
- viewBox="0.00 0.00 366.75 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-148.25 0,-148.25 0,-129 37,-129 37,-148.25"/>
-<text text-anchor="middle" x="18.5" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the correctness of get_union() function.">
-<polygon fill="white" stroke="#666666" points="105.5,-148.25 73,-148.25 73,-129 105.5,-129 105.5,-148.25"/>
-<text text-anchor="middle" x="89.25" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-138.62C44.58,-138.62 53.31,-138.62 61.45,-138.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-142.13 71.2,-138.63 61.2,-135.13 61.2,-142.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="207,-241.25 141.5,-241.25 141.5,-222 207,-222 207,-241.25"/>
-<text text-anchor="middle" x="174.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.19,-148.68C103.2,-164.16 120.26,-194.09 141.5,-213.62 142.11,-214.19 142.74,-214.74 143.39,-215.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.06,-217.92 151.26,-220.81 145.09,-212.2 141.06,-217.92"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="207,-204.25 141.5,-204.25 141.5,-185 207,-185 207,-204.25"/>
-<text text-anchor="middle" x="174.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.58,-148.43C112.78,-156.38 127.76,-167.68 141.5,-176.62 142.54,-177.3 143.6,-177.97 144.68,-178.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.87,-181.65 153.25,-183.76 146.45,-175.63 142.87,-181.65"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="207,-167.25 141.5,-167.25 141.5,-148 207,-148 207,-167.25"/>
-<text text-anchor="middle" x="174.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-142.2C112.86,-143.8 121.5,-145.78 130.22,-147.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.2,-151.13 139.73,-149.95 130.77,-144.31 129.2,-151.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="207,-130.25 141.5,-130.25 141.5,-111 207,-111 207,-130.25"/>
-<text text-anchor="middle" x="174.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-135.24C112.86,-133.72 121.5,-131.85 130.22,-129.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.7,-133.43 139.73,-127.89 129.21,-126.59 130.7,-133.43"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="207,-93.25 141.5,-93.25 141.5,-74 207,-74 207,-93.25"/>
-<text text-anchor="middle" x="174.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.04,-128.79C113.24,-121.1 128.02,-110.28 141.5,-101.62 142.7,-100.86 143.93,-100.08 145.19,-99.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.78,-102.44 153.61,-94.34 143.22,-96.41 146.78,-102.44"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2" target="_top" xlink:title="A Test to check correct functionality with an array sorted using std::sort.">
-<polygon fill="white" stroke="#666666" points="207,-56.25 141.5,-56.25 141.5,-37 207,-37 207,-56.25"/>
-<text text-anchor="middle" x="174.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test6</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.23,-128.71C103.27,-113.44 120.39,-83.92 141.5,-64.62 142.11,-64.06 142.75,-63.51 143.4,-62.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.09,-66.06 151.27,-57.45 141.07,-60.33 145.09,-66.06"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.75,-130.25 243,-130.25 243,-111 358.75,-111 358.75,-130.25"/>
-<text text-anchor="middle" x="300.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-120.62C214.78,-120.62 222.98,-120.62 231.32,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.23,-124.13 241.23,-120.63 231.23,-117.13 231.23,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="346.75,-93.25 255,-93.25 255,-74 346.75,-74 346.75,-93.25"/>
-<text text-anchor="middle" x="300.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-56.15C221.99,-60.5 239.58,-65.72 255.47,-70.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.11,-73.69 264.7,-73.18 256.11,-66.98 254.11,-73.69"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="343,-56.25 258.75,-56.25 258.75,-37 343,-37 343,-56.25"/>
-<text text-anchor="middle" x="300.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge10_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge10_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-46.62C219.51,-46.62 233.71,-46.62 247.28,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.96,-50.13 256.96,-46.63 246.96,-43.13 246.96,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="326.88,-19.25 274.88,-19.25 274.88,0 326.88,0 326.88,-19.25"/>
-<text text-anchor="middle" x="300.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node12 -->
-<g id="edge11_Node000009_Node000012" class="edge">
-<title>Node9&#45;&gt;Node12</title>
-<g id="a_edge11_Node000009_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-37.1C224.58,-31.98 245.89,-25.65 263.71,-20.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="264.53,-23.77 273.12,-17.57 262.53,-17.06 264.53,-23.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 75a65c1e1..000000000
--- a/d8/d9c/union__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,219 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="367pt" height="249pt"
- viewBox="0.00 0.00 366.75 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-148.25 0,-148.25 0,-129 37,-129 37,-148.25"/>
-<text text-anchor="middle" x="18.5" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the correctness of get_union() function.">
-<polygon fill="white" stroke="#666666" points="105.5,-148.25 73,-148.25 73,-129 105.5,-129 105.5,-148.25"/>
-<text text-anchor="middle" x="89.25" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-138.62C44.58,-138.62 53.31,-138.62 61.45,-138.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-142.13 71.2,-138.63 61.2,-135.13 61.2,-142.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="207,-241.25 141.5,-241.25 141.5,-222 207,-222 207,-241.25"/>
-<text text-anchor="middle" x="174.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.19,-148.68C103.2,-164.16 120.26,-194.09 141.5,-213.62 142.11,-214.19 142.74,-214.74 143.39,-215.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.06,-217.92 151.26,-220.81 145.09,-212.2 141.06,-217.92"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="207,-204.25 141.5,-204.25 141.5,-185 207,-185 207,-204.25"/>
-<text text-anchor="middle" x="174.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.58,-148.43C112.78,-156.38 127.76,-167.68 141.5,-176.62 142.54,-177.3 143.6,-177.97 144.68,-178.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.87,-181.65 153.25,-183.76 146.45,-175.63 142.87,-181.65"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="207,-167.25 141.5,-167.25 141.5,-148 207,-148 207,-167.25"/>
-<text text-anchor="middle" x="174.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-142.2C112.86,-143.8 121.5,-145.78 130.22,-147.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.2,-151.13 139.73,-149.95 130.77,-144.31 129.2,-151.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="207,-130.25 141.5,-130.25 141.5,-111 207,-111 207,-130.25"/>
-<text text-anchor="middle" x="174.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-135.24C112.86,-133.72 121.5,-131.85 130.22,-129.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.7,-133.43 139.73,-127.89 129.21,-126.59 130.7,-133.43"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="207,-93.25 141.5,-93.25 141.5,-74 207,-74 207,-93.25"/>
-<text text-anchor="middle" x="174.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.04,-128.79C113.24,-121.1 128.02,-110.28 141.5,-101.62 142.7,-100.86 143.93,-100.08 145.19,-99.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.78,-102.44 153.61,-94.34 143.22,-96.41 146.78,-102.44"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2" target="_top" xlink:title="A Test to check correct functionality with an array sorted using std::sort.">
-<polygon fill="white" stroke="#666666" points="207,-56.25 141.5,-56.25 141.5,-37 207,-37 207,-56.25"/>
-<text text-anchor="middle" x="174.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test6</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.23,-128.71C103.27,-113.44 120.39,-83.92 141.5,-64.62 142.11,-64.06 142.75,-63.51 143.4,-62.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.09,-66.06 151.27,-57.45 141.07,-60.33 145.09,-66.06"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.75,-130.25 243,-130.25 243,-111 358.75,-111 358.75,-130.25"/>
-<text text-anchor="middle" x="300.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-120.62C214.78,-120.62 222.98,-120.62 231.32,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.23,-124.13 241.23,-120.63 231.23,-117.13 231.23,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="346.75,-93.25 255,-93.25 255,-74 346.75,-74 346.75,-93.25"/>
-<text text-anchor="middle" x="300.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-56.15C221.99,-60.5 239.58,-65.72 255.47,-70.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.11,-73.69 264.7,-73.18 256.11,-66.98 254.11,-73.69"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="343,-56.25 258.75,-56.25 258.75,-37 343,-37 343,-56.25"/>
-<text text-anchor="middle" x="300.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge10_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge10_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-46.62C219.51,-46.62 233.71,-46.62 247.28,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.96,-50.13 256.96,-46.63 246.96,-43.13 246.96,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="326.88,-19.25 274.88,-19.25 274.88,0 326.88,0 326.88,-19.25"/>
-<text text-anchor="middle" x="300.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node12 -->
-<g id="edge11_Node000009_Node000012" class="edge">
-<title>Node9&#45;&gt;Node12</title>
-<g id="a_edge11_Node000009_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-37.1C224.58,-31.98 245.89,-25.65 263.71,-20.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="264.53,-23.77 273.12,-17.57 262.53,-17.06 264.53,-23.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/d9c/union__of__two__arrays_8cpp_source.html b/d8/d9c/union__of__two__arrays_8cpp_source.html
new file mode 100644
index 000000000..a1e18984c
--- /dev/null
+++ b/d8/d9c/union__of__two__arrays_8cpp_source.html
@@ -0,0 +1,306 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: operations_on_datastructures/union_of_two_arrays.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/d9c/union__of__two__arrays_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">union_of_two_arrays.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/d9c/union__of__two__arrays_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a> {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">print</a>(<span class="keyword">const</span> std::vector&lt;int32_t&gt; &amp;array) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordflow">for</span> (int32_t i : array) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;  </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    }</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;  </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>}</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="foldopen" id="foldopen00049" data-start="{" data-end="}">
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"><a class="line" href="../../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74">   49</a></span>std::vector&lt;int32_t&gt; <a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74">get_union</a>(<span class="keyword">const</span> std::vector&lt;int32_t&gt; &amp;first,</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>                               <span class="keyword">const</span> std::vector&lt;int32_t&gt; &amp;second) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    std::vector&lt;int32_t&gt; res;         </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordtype">size_t</span> f_index = 0;               </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordtype">size_t</span> s_index = 0;               </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordtype">size_t</span> f_length = first.size();   </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordtype">size_t</span> s_length = second.size();  </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    int32_t next = 0;  </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordflow">while</span> (f_index &lt; f_length &amp;&amp; s_index &lt; s_length) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <span class="keywordflow">if</span> (first[f_index] &lt; second[s_index]) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            next = first[f_index];  </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            f_index++;              </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (first[f_index] &gt; second[s_index]) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            next = second[s_index];  </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            s_index++;               </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            next = first[f_index];  </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            f_index++;              </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            s_index++;              </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        <span class="keywordflow">if</span> ((res.size() == 0) || (next != res.back())) {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>            res.push_back(next);  </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        }</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    }</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keywordflow">while</span> (f_index &lt; f_length) {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        next = first[f_index];  </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="keywordflow">if</span> ((res.size() == 0) || (next != res.back())) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            res.push_back(next);  </div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        }</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        f_index++;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    }</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keywordflow">while</span> (s_index &lt; s_length) {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        next = second[s_index];  </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordflow">if</span> ((res.size() == 0) || (next != res.back())) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            res.push_back(next);  </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        }</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        s_index++;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keywordflow">return</span> res;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>}</div>
+</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>}  <span class="comment">// namespace operations_on_datastructures</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/df4/namespacetests.html">tests</a> {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span><span class="keyword">using </span><a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74">operations_on_datastructures::get_union</a>;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span><span class="keyword">using </span><a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures::print</a>;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">test1</a>() {</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 1\n&quot;</span>;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Intialized a = {} b = {}\n&quot;</span>;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {}\n&quot;</span>;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    std::vector&lt;int32_t&gt; a = {};</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    std::vector&lt;int32_t&gt; b = {};</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    std::vector&lt;int32_t&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = get_union(a, b);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    assert(result == a);  </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    print(result);        </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>}</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">test2</a>() {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 2\n&quot;</span>;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Intialized a = {} b = {2, 3}\n&quot;</span>;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {2, 3}\n&quot;</span>;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    std::vector&lt;int32_t&gt; a = {};</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    std::vector&lt;int32_t&gt; b = {2, 3};</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    std::vector&lt;int32_t&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = get_union(a, b);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    assert(result == b);  </div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    print(result);        </div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>}</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">test3</a>() {</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 3\n&quot;</span>;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Intialized a = {4, 6} b = {2, 3}\n&quot;</span>;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {2, 3, 4, 6}\n&quot;</span>;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    std::vector&lt;int32_t&gt; a = {4, 6};</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    std::vector&lt;int32_t&gt; b = {2, 3};</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    std::vector&lt;int32_t&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = get_union(a, b);</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    std::vector&lt;int32_t&gt; expected = {2, 3, 4, 6};</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    assert(result == expected);  </div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    print(result);               </div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>}</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">test4</a>() {</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 4\n&quot;</span>;</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Intialized a = {4, 6, 6, 7} b = {2, 3, 4}\n&quot;</span>;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {2, 3, 4, 6, 7}\n&quot;</span>;</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    std::vector&lt;int32_t&gt; a = {4, 6, 6, 7};</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    std::vector&lt;int32_t&gt; b = {2, 3, 4};</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    std::vector&lt;int32_t&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = get_union(a, b);</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    std::vector&lt;int32_t&gt; expected = {2, 3, 4, 6, 7};</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    assert(result == expected);  </div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    print(result);               </div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>}</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">test5</a>() {</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 5\n&quot;</span>;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Intialized a = {1, 4, 6, 7, 9} b = {2, 3, 5}\n&quot;</span>;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {1, 2, 3, 4, 5, 6, 7, 9}\n&quot;</span>;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    std::vector&lt;int32_t&gt; a = {1, 4, 6, 7, 9};</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    std::vector&lt;int32_t&gt; b = {2, 3, 5};</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    std::vector&lt;int32_t&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = get_union(a, b);</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    std::vector&lt;int32_t&gt; expected = {1, 2, 3, 4, 5, 6, 7, 9};</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    assert(result == expected);  </div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    print(result);               </div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>}</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">test6</a>() {</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 6\n&quot;</span>;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Intialized a = {1, 3, 3, 2, 5, 9, 4, 3, 2} &quot;</span>;</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;b = {11, 3, 7, 8, 6}\n&quot;</span>;</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {1, 2, 3, 4, 5, 6, 7, 8, 9, 11}\n&quot;</span>;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    std::vector&lt;int32_t&gt; a = {1, 3, 3, 2, 5, 9, 4, 3, 2};</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    std::vector&lt;int32_t&gt; b = {11, 3, 7, 8, 6};</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    std::sort(a.begin(), a.end());  </div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    std::sort(b.begin(), b.end());  </div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    std::vector&lt;int32_t&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = get_union(a, b);</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    std::vector&lt;int32_t&gt; expected = {1, 2, 3, 4, 5, 6, 7, 8, 9, 11};</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    assert(result == expected);  </div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    print(result);               </div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>}</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>}  <span class="comment">// namespace tests</span></div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span> </div>
+<div class="foldopen" id="foldopen00204" data-start="{" data-end="}">
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"><a class="line" href="../../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  204</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a>();</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a>();</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a>();</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a>();</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a>();</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">tests::test6</a>();</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>}</div>
+</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span> </div>
+<div class="foldopen" id="foldopen00217" data-start="{" data-end="}">
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"><a class="line" href="../../d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  217</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    <a class="code hl_function" href="../../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>}</div>
+</div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+<div class="ttc" id="anamespaceoperations__on__datastructures_html"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></div><div class="ttdoc">for std::vector</div></div>
+<div class="ttc" id="anamespaceoperations__on__datastructures_html_a2b8ff06a84b041457873840bf82e2d74"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74">operations_on_datastructures::get_union</a></div><div class="ttdeci">std::vector&lt; int32_t &gt; get_union(const std::vector&lt; int32_t &gt; &amp;first, const std::vector&lt; int32_t &gt; &amp;second)</div><div class="ttdoc">Gets the union of two sorted arrays, and returns them in a vector.</div><div class="ttdef"><b>Definition</b> <a href="#l00049">union_of_two_arrays.cpp:49</a></div></div>
+<div class="ttc" id="anamespaceoperations__on__datastructures_html_a6109193567a5b7e36a27f2b4865fce20"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures::print</a></div><div class="ttdeci">void print(const std::vector&lt; int32_t &gt; &amp;array)</div><div class="ttdoc">Prints the values of a vector sequentially, ending with a newline character.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00029">array_left_rotation.cpp:29</a></div></div>
+<div class="ttc" id="anamespacetests_html"><div class="ttname"><a href="../../d9/df4/namespacetests.html">tests</a></div><div class="ttdoc">Testcases to check Union of Two Arrays.</div></div>
+<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00075">array_left_rotation.cpp:75</a></div></div>
+<div class="ttc" id="anamespacetests_html_a2b9769e44683dcb67fe1083ad91e134d"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a></div><div class="ttdeci">void test4()</div><div class="ttdoc">A Test to check a very large input.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00120">array_left_rotation.cpp:120</a></div></div>
+<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check an invalid shift value.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00105">array_left_rotation.cpp:105</a></div></div>
+<div class="ttc" id="anamespacetests_html_aacafde185abd8670abee51157f273dc2"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">tests::test6</a></div><div class="ttdeci">void test6()</div><div class="ttdoc">A Test to check correct functionality with an array sorted using std::sort.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc5/intersection__of__two__arrays_8cpp_source.html#l00166">intersection_of_two_arrays.cpp:166</a></div></div>
+<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an empty vector.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00090">array_left_rotation.cpp:90</a></div></div>
+<div class="ttc" id="anamespacetests_html_af7b81d7a1534216af6a36a80135beb86"><div class="ttname"><a href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a></div><div class="ttdeci">void test5()</div><div class="ttdoc">A Test to check a shift of zero.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00143">array_left_rotation.cpp:143</a></div></div>
+<div class="ttc" id="aunion__of__two__arrays_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of get_union() function.</div><div class="ttdef"><b>Definition</b> <a href="#l00204">union_of_two_arrays.cpp:204</a></div></div>
+<div class="ttc" id="aunion__of__two__arrays_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition</b> <a href="#l00217">union_of_two_arrays.cpp:217</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><a class="el" href="../../d8/d9c/union__of__two__arrays_8cpp.html">union_of_two_arrays.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/d9f/namespacesudoku__solver.html b/d8/d9f/namespacesudoku__solver.html
index 3d655eb61..0d1d0bb8d 100644
--- a/d8/d9f/namespacesudoku__solver.html
+++ b/d8/d9f/namespacesudoku__solver.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sudoku_solver Namespace Reference</title>
+<title>TheAlgorithms/C++: sudoku_solver Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.map b/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.map
index b38cd61d0..47f8e8940 100644
--- a/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.map
+++ b/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.map
@@ -1,11 +1,8 @@
 <map id="others::lru_cache::LRUCache" name="others::lru_cache::LRUCache">
-<area shape="rect" id="Node000001" title="LRU cache class." alt="" coords="699,12,829,53"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list.html" title=" " alt="" coords="204,9,338,35"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="354,18,362,18,519,19,675,25,699,26,699,31,675,30,519,24,362,23,354,23"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map.html" title=" " alt="" coords="443,43,594,99"/>
-<area shape="poly" id="edge5_Node000004_Node000002" title=" " alt="" coords="354,36,443,54,442,59,353,41"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="5,40,99,65"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="114,41,203,29,204,34,114,47"/>
-<area shape="poly" id="edge4_Node000004_Node000003" title=" " alt="" coords="114,54,204,60,443,67,442,73,204,65,114,60"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="610,54,698,40,699,45,610,60"/>
+<area shape="rect" id="Node000001" title="LRU cache class." alt="" coords="501,5,630,46"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,22,140,48"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,27,164,27,320,21,477,20,500,21,500,26,477,26,320,26,164,32,155,33"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="245,46,396,102"/>
+<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="156,45,245,59,244,65,155,50"/>
+<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="411,53,500,36,501,41,412,59"/>
 </map>
diff --git a/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.md5 b/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.md5
index 30f24567a..d26d64b66 100644
--- a/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.md5
+++ b/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.md5
@@ -1 +1 @@
-a3d8e3dd630e72b65cb3157fc1aecb99
\ No newline at end of file
+80611d2e827984b41f8e4f112586624a
\ No newline at end of file
diff --git a/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.svg b/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.svg
index 1aa6616ad..c7eb10cf0 100644
--- a/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.svg
+++ b/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph.svg
@@ -4,9 +4,10 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: others::lru_cache::LRUCache Pages: 1 -->
-<!--zoomable 78 -->
+<svg width="477pt" height="80pt"
+ viewBox="0.00 0.00 476.75 80.12" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
+<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
 <style type="text/css"><![CDATA[
 .node, .edge {opacity: 0.7;}
@@ -14,63 +15,26 @@
 .edge:hover path { stroke: red; }
 .edge:hover polygon { stroke: red; fill: red; }
 ]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 626;
-var viewHeight = 78;
-var sectionId = 'dynsection-0';
-</script>
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
 <svg id="graph" class="graph">
-<g id="viewport">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 76.12)">
 <title>others::lru_cache::LRUCache</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="LRU cache class.">
-<polygon fill="#999999" stroke="#666666" points="617.5,-65.12 520.5,-65.12 520.5,-34.62 617.5,-34.62 617.5,-65.12"/>
-<text text-anchor="start" x="528.5" y="-51.62" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="569" y="-40.38" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache</text>
+<polygon fill="#999999" stroke="#666666" points="468.75,-72.12 371.75,-72.12 371.75,-41.62 468.75,-41.62 468.75,-72.12"/>
+<text text-anchor="start" x="379.75" y="-58.62" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
+<text text-anchor="middle" x="420.25" y="-47.38" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-67.5 148.75,-67.5 148.75,-48.25 249.5,-48.25 249.5,-67.5"/>
-<text text-anchor="middle" x="199.12" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">std::list&lt; uint64_t &gt;</text>
+<g id="a_Node000002"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="100.75,-59.5 0,-59.5 0,-40.25 100.75,-40.25 100.75,-59.5"/>
+<text text-anchor="middle" x="50.38" y="-46" font-family="Helvetica,sans-Serif" font-size="10.00">std::list&lt; uint64_t &gt;</text>
 </a>
 </g>
 </g>
@@ -78,95 +42,45 @@ var sectionId = 'dynsection-0';
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M261.23,-58.82C263.34,-58.84 265.44,-58.86 267.5,-58.88 371.97,-59.65 398.13,-58.42 502.5,-53.88 508.19,-53.63 514.16,-53.32 520.07,-53"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="261.35,-55.32 251.31,-58.71 261.27,-62.32 261.35,-55.32"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M112.47,-53.59C114.59,-53.69 116.69,-53.79 118.75,-53.88 223.12,-58.33 249.29,-60.47 353.75,-58.88 359.44,-58.79 365.4,-58.66 371.32,-58.51"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="112.71,-50.1 102.55,-53.09 112.36,-57.09 112.71,-50.1"/>
 </a>
 </g>
-<text text-anchor="middle" x="385" y="-60.82" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> cache</text>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441.75,-41.75 328.25,-41.75 328.25,0 441.75,0 441.75,-41.75"/>
-<text text-anchor="start" x="336.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="start" x="336.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint64_t, std::list</text>
-<text text-anchor="middle" x="385" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint64_t &gt;::iterator &gt;</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000002" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M260.93,-45.64C282.57,-41.28 306.82,-36.4 328.04,-32.14"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="260.48,-42.16 251.37,-47.56 261.86,-49.02 260.48,-42.16"/>
-</a>
-</g>
-<text text-anchor="middle" x="288.88" y="-45.53" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="236.25" y="-61.15" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> cache</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="70,-44.5 0,-44.5 0,-25.25 70,-25.25 70,-44.5"/>
-<text text-anchor="middle" x="35" y="-31" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint64_t</text>
+<g id="a_Node000003"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="293,-41.75 179.5,-41.75 179.5,0 293,0 293,-41.75"/>
+<text text-anchor="start" x="187.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
+<text text-anchor="start" x="187.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint64_t, std::list</text>
+<text text-anchor="middle" x="236.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint64_t &gt;::iterator &gt;</text>
 </a>
 </g>
 </g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M81.51,-41.33C102.34,-44.29 127.09,-47.8 148.41,-50.82"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="82.27,-37.9 71.88,-39.97 81.29,-44.84 82.27,-37.9"/>
+<!-- Node2&#45;&gt;Node3 -->
+<g id="edge3_Node000003_Node000002" class="edge">
+<title>Node2&#45;&gt;Node3</title>
+<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M112.48,-40.24C134.05,-36.84 158.17,-33.03 179.29,-29.7"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="111.96,-36.78 102.63,-41.79 113.05,-43.69 111.96,-36.78"/>
 </a>
 </g>
-<text text-anchor="middle" x="109.38" y="-49.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="140.12" y="-40.58" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
 </g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M81.31,-31.59C101.88,-30.2 126.53,-28.66 148.75,-27.62 209.97,-24.78 280.22,-22.95 327.89,-21.92"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="81.27,-28.09 71.54,-32.27 81.75,-35.07 81.27,-28.09"/>
+<!-- Node3&#45;&gt;Node1 -->
+<g id="edge2_Node000001_Node000003" class="edge">
+<title>Node3&#45;&gt;Node1</title>
+<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M304.4,-34.16C326.61,-38.55 350.85,-43.35 371.32,-47.4"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="305.31,-30.77 294.83,-32.26 303.96,-37.64 305.31,-30.77"/>
 </a>
 </g>
-<text text-anchor="middle" x="199.12" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> keys</text>
-</g>
-<!-- Node4&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node4&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M453.45,-31.62C475.58,-35.15 499.7,-38.99 520.07,-42.24"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="454.01,-28.17 443.59,-30.05 452.91,-35.08 454.01,-28.17"/>
-</a>
-</g>
-<text text-anchor="middle" x="481.12" y="-40.58" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> pageMap</text>
+<text text-anchor="middle" x="332.38" y="-44.91" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> pageMap</text>
 </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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph_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>
 
 <style type='text/css'>
diff --git a/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph_org.svg b/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph_org.svg
index d8ed24d9e..b0e020799 100644
--- a/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph_org.svg
+++ b/d8/da6/classothers_1_1lru__cache_1_1_l_r_u_cache__coll__graph_org.svg
@@ -4,26 +4,26 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: others::lru_cache::LRUCache Pages: 1 -->
-<svg width="626pt" height="78pt"
- viewBox="0.00 0.00 625.50 78.32" 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 74.32)">
+<svg width="477pt" height="80pt"
+ viewBox="0.00 0.00 476.75 80.12" 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 76.12)">
 <title>others::lru_cache::LRUCache</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="LRU cache class.">
-<polygon fill="#999999" stroke="#666666" points="617.5,-65.12 520.5,-65.12 520.5,-34.62 617.5,-34.62 617.5,-65.12"/>
-<text text-anchor="start" x="528.5" y="-51.62" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
-<text text-anchor="middle" x="569" y="-40.38" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache</text>
+<polygon fill="#999999" stroke="#666666" points="468.75,-72.12 371.75,-72.12 371.75,-41.62 468.75,-41.62 468.75,-72.12"/>
+<text text-anchor="start" x="379.75" y="-58.62" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
+<text text-anchor="middle" x="420.25" y="-47.38" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-67.5 148.75,-67.5 148.75,-48.25 249.5,-48.25 249.5,-67.5"/>
-<text text-anchor="middle" x="199.12" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">std::list&lt; uint64_t &gt;</text>
+<g id="a_Node000002"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="100.75,-59.5 0,-59.5 0,-40.25 100.75,-40.25 100.75,-59.5"/>
+<text text-anchor="middle" x="50.38" y="-46" font-family="Helvetica,sans-Serif" font-size="10.00">std::list&lt; uint64_t &gt;</text>
 </a>
 </g>
 </g>
@@ -31,71 +31,42 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M261.23,-58.82C263.34,-58.84 265.44,-58.86 267.5,-58.88 371.97,-59.65 398.13,-58.42 502.5,-53.88 508.19,-53.63 514.16,-53.32 520.07,-53"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="261.35,-55.32 251.31,-58.71 261.27,-62.32 261.35,-55.32"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M112.47,-53.59C114.59,-53.69 116.69,-53.79 118.75,-53.88 223.12,-58.33 249.29,-60.47 353.75,-58.88 359.44,-58.79 365.4,-58.66 371.32,-58.51"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="112.71,-50.1 102.55,-53.09 112.36,-57.09 112.71,-50.1"/>
 </a>
 </g>
-<text text-anchor="middle" x="385" y="-60.82" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> cache</text>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441.75,-41.75 328.25,-41.75 328.25,0 441.75,0 441.75,-41.75"/>
-<text text-anchor="start" x="336.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="start" x="336.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint64_t, std::list</text>
-<text text-anchor="middle" x="385" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint64_t &gt;::iterator &gt;</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000002" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M260.93,-45.64C282.57,-41.28 306.82,-36.4 328.04,-32.14"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="260.48,-42.16 251.37,-47.56 261.86,-49.02 260.48,-42.16"/>
-</a>
-</g>
-<text text-anchor="middle" x="288.88" y="-45.53" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="236.25" y="-61.15" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> cache</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="70,-44.5 0,-44.5 0,-25.25 70,-25.25 70,-44.5"/>
-<text text-anchor="middle" x="35" y="-31" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint64_t</text>
+<g id="a_Node000003"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="293,-41.75 179.5,-41.75 179.5,0 293,0 293,-41.75"/>
+<text text-anchor="start" x="187.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
+<text text-anchor="start" x="187.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint64_t, std::list</text>
+<text text-anchor="middle" x="236.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint64_t &gt;::iterator &gt;</text>
 </a>
 </g>
 </g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M81.51,-41.33C102.34,-44.29 127.09,-47.8 148.41,-50.82"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="82.27,-37.9 71.88,-39.97 81.29,-44.84 82.27,-37.9"/>
+<!-- Node2&#45;&gt;Node3 -->
+<g id="edge3_Node000003_Node000002" class="edge">
+<title>Node2&#45;&gt;Node3</title>
+<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M112.48,-40.24C134.05,-36.84 158.17,-33.03 179.29,-29.7"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="111.96,-36.78 102.63,-41.79 113.05,-43.69 111.96,-36.78"/>
 </a>
 </g>
-<text text-anchor="middle" x="109.38" y="-49.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="140.12" y="-40.58" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
 </g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M81.31,-31.59C101.88,-30.2 126.53,-28.66 148.75,-27.62 209.97,-24.78 280.22,-22.95 327.89,-21.92"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="81.27,-28.09 71.54,-32.27 81.75,-35.07 81.27,-28.09"/>
+<!-- Node3&#45;&gt;Node1 -->
+<g id="edge2_Node000001_Node000003" class="edge">
+<title>Node3&#45;&gt;Node1</title>
+<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M304.4,-34.16C326.61,-38.55 350.85,-43.35 371.32,-47.4"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="305.31,-30.77 294.83,-32.26 303.96,-37.64 305.31,-30.77"/>
 </a>
 </g>
-<text text-anchor="middle" x="199.12" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> keys</text>
-</g>
-<!-- Node4&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node4&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M453.45,-31.62C475.58,-35.15 499.7,-38.99 520.07,-42.24"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="454.01,-28.17 443.59,-30.05 452.91,-35.08 454.01,-28.17"/>
-</a>
-</g>
-<text text-anchor="middle" x="481.12" y="-40.58" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> pageMap</text>
+<text text-anchor="middle" x="332.38" y="-44.91" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> pageMap</text>
 </g>
 </g>
 </svg>
diff --git a/d8/da7/namespacedepth__first__search.html b/d8/da7/namespacedepth__first__search.html
index 7973f937b..95018fe96 100644
--- a/d8/da7/namespacedepth__first__search.html
+++ b/d8/da7/namespacedepth__first__search.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: depth_first_search Namespace Reference</title>
+<title>TheAlgorithms/C++: depth_first_search Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/dab/classstatistics_1_1stats__computer2.html b/d8/dab/classstatistics_1_1stats__computer2.html
index 2048d99a1..34ddb4f8c 100644
--- a/d8/dab/classstatistics_1_1stats__computer2.html
+++ b/d8/dab/classstatistics_1_1stats__computer2.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: statistics::stats_computer2&lt; T &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: statistics::stats_computer2&lt; T &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -126,27 +143,25 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a80099005c6e5f9569b75da0e49b14cf6" id="r_a80099005c6e5f9569b75da0e49b14cf6"><td class="memItemLeft" align="right" valign="top"><a id="a80099005c6e5f9569b75da0e49b14cf6" name="a80099005c6e5f9569b75da0e49b14cf6"></a>
-unsigned int&#160;</td><td class="memItemRight" valign="bottom"><b>n</b> = 0</td></tr>
+<tr class="memitem:a80099005c6e5f9569b75da0e49b14cf6" id="r_a80099005c6e5f9569b75da0e49b14cf6"><td class="memItemLeft" align="right" valign="top">unsigned int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a80099005c6e5f9569b75da0e49b14cf6">n</a> = 0</td></tr>
 <tr class="separator:a80099005c6e5f9569b75da0e49b14cf6"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0acea0729769f430f2dc56260d179745" id="r_a0acea0729769f430f2dc56260d179745"><td class="memItemLeft" align="right" valign="top"><a id="a0acea0729769f430f2dc56260d179745" name="a0acea0729769f430f2dc56260d179745"></a>
-double&#160;</td><td class="memItemRight" valign="bottom"><b>mu</b> = 0</td></tr>
+<tr class="memitem:a0acea0729769f430f2dc56260d179745" id="r_a0acea0729769f430f2dc56260d179745"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0acea0729769f430f2dc56260d179745">mu</a> = 0</td></tr>
 <tr class="separator:a0acea0729769f430f2dc56260d179745"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae1bfd81bd7bbbd4b0d51d7d956e532d2" id="r_ae1bfd81bd7bbbd4b0d51d7d956e532d2"><td class="memItemLeft" align="right" valign="top"><a id="ae1bfd81bd7bbbd4b0d51d7d956e532d2" name="ae1bfd81bd7bbbd4b0d51d7d956e532d2"></a>
-double&#160;</td><td class="memItemRight" valign="bottom"><b>var</b> = 0</td></tr>
+<tr class="memitem:ae1bfd81bd7bbbd4b0d51d7d956e532d2" id="r_ae1bfd81bd7bbbd4b0d51d7d956e532d2"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae1bfd81bd7bbbd4b0d51d7d956e532d2">var</a> = 0</td></tr>
 <tr class="separator:ae1bfd81bd7bbbd4b0d51d7d956e532d2"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8daf58bdecd775b8a83ce9ad70c014c4" id="r_a8daf58bdecd775b8a83ce9ad70c014c4"><td class="memItemLeft" align="right" valign="top"><a id="a8daf58bdecd775b8a83ce9ad70c014c4" name="a8daf58bdecd775b8a83ce9ad70c014c4"></a>
-double&#160;</td><td class="memItemRight" valign="bottom"><b>M</b> = 0</td></tr>
+<tr class="memitem:a8daf58bdecd775b8a83ce9ad70c014c4" id="r_a8daf58bdecd775b8a83ce9ad70c014c4"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8daf58bdecd775b8a83ce9ad70c014c4">M</a> = 0</td></tr>
 <tr class="separator:a8daf58bdecd775b8a83ce9ad70c014c4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="friends" name="friends"></a>
 Friends</h2></td></tr>
-<tr class="memitem:ab444d485c9e7db35bdc2ff6b7775291a" id="r_ab444d485c9e7db35bdc2ff6b7775291a"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::istream</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab444d485c9e7db35bdc2ff6b7775291a">operator&gt;&gt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::istream</a> &amp;input, <a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a> &amp;stat)</td></tr>
+<tr class="memitem:ab444d485c9e7db35bdc2ff6b7775291a" id="r_ab444d485c9e7db35bdc2ff6b7775291a"><td class="memItemLeft" align="right" valign="top">std::istream &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab444d485c9e7db35bdc2ff6b7775291a">operator&gt;&gt;</a> (std::istream &amp;input, <a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a> &amp;stat)</td></tr>
 <tr class="separator:ab444d485c9e7db35bdc2ff6b7775291a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><div class="compoundTemplParams">template&lt;typename T&gt;<br />
 class statistics::stats_computer2&lt; T &gt;</div><p>continuous mean and variance computance using Welford's algorithm (very accurate) </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00072">72</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="a8290966ad468f2a8c266d008bc60720e" name="a8290966ad468f2a8c266d008bc60720e"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a8290966ad468f2a8c266d008bc60720e">&#9670;&#160;</a></span>mean()</h2>
@@ -173,6 +188,8 @@ template&lt;typename T &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>return sample mean computed till last sample </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00086">86</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   86</span>{ <span class="keywordflow">return</span> mu; }</div>
 </div><!-- fragment -->
 </div>
@@ -207,6 +224,8 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   77</span>                      {</div>
 <div class="line"><span class="lineno">   78</span>        n++;</div>
 <div class="line"><span class="lineno">   79</span>        <span class="keywordtype">double</span> delta = x - mu;</div>
@@ -242,15 +261,11 @@ template&lt;typename T &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>return sample standard deviation computed till last sample </p>
-<div class="fragment"><div class="line"><span class="lineno">   92</span>{ <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(this-&gt;<a class="code hl_function" href="#af6198817084276113b3c064e87ce0555">variance</a>()); }</div>
-<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_af6198817084276113b3c064e87ce0555"><div class="ttname"><a href="#af6198817084276113b3c064e87ce0555">statistics::stats_computer2::variance</a></div><div class="ttdeci">double variance() const</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:89</div></div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.svg" width="444" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00092">92</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   92</span>{ <span class="keywordflow">return</span> std::sqrt(this-&gt;<a class="code hl_function" href="#af6198817084276113b3c064e87ce0555">variance</a>()); }</div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_af6198817084276113b3c064e87ce0555"><div class="ttname"><a href="#af6198817084276113b3c064e87ce0555">statistics::stats_computer2::variance</a></div><div class="ttdeci">double variance() const</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d08/realtime__stats_8cpp_source.html#l00089">realtime_stats.cpp:89</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af6198817084276113b3c064e87ce0555" name="af6198817084276113b3c064e87ce0555"></a>
@@ -278,6 +293,8 @@ template&lt;typename T &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>return data variance computed till last sample </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00089">89</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   89</span>{ <span class="keywordflow">return</span> M / n; }</div>
 </div><!-- fragment -->
 </div>
@@ -295,9 +312,9 @@ template&lt;typename T &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::istream</a> &amp; operator&gt;&gt; </td>
+          <td class="memname">std::istream &amp; operator&gt;&gt; </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::istream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>input</em></span>, </td>
+          <td class="paramtype">std::istream &amp;</td>          <td class="paramname"><span class="paramname"><em>input</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -312,19 +329,126 @@ template&lt;typename T &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>short-hand operator to read new sample from input stream <br  />
- e.g.: <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; stats1;</code> </p>
+ e.g.: <code>std::cin &gt;&gt; stats1;</code> </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00097">97</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   98</span>                                                           {</div>
 <div class="line"><span class="lineno">   99</span>        T val;</div>
 <div class="line"><span class="lineno">  100</span>        input &gt;&gt; val;</div>
 <div class="line"><span class="lineno">  101</span>        stat.<a class="code hl_function" href="#ade6de704deea24fdc88077b3d9a0d534">new_val</a>(val);</div>
 <div class="line"><span class="lineno">  102</span>        <span class="keywordflow">return</span> input;</div>
 <div class="line"><span class="lineno">  103</span>    }</div>
-<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_ade6de704deea24fdc88077b3d9a0d534"><div class="ttname"><a href="#ade6de704deea24fdc88077b3d9a0d534">statistics::stats_computer2::new_val</a></div><div class="ttdeci">void new_val(T x)</div><div class="ttdef"><b>Definition</b> realtime_stats.cpp:77</div></div>
+<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_ade6de704deea24fdc88077b3d9a0d534"><div class="ttname"><a href="#ade6de704deea24fdc88077b3d9a0d534">statistics::stats_computer2::new_val</a></div><div class="ttdeci">void new_val(T x)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d08/realtime__stats_8cpp_source.html#l00077">realtime_stats.cpp:77</a></div></div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a8daf58bdecd775b8a83ce9ad70c014c4" name="a8daf58bdecd775b8a83ce9ad70c014c4"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a8daf58bdecd775b8a83ce9ad70c014c4">&#9670;&#160;</a></span>M</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename T &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">double <a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html">statistics::stats_computer2</a>&lt; T &gt;::M = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a0acea0729769f430f2dc56260d179745" name="a0acea0729769f430f2dc56260d179745"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a0acea0729769f430f2dc56260d179745">&#9670;&#160;</a></span>mu</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename T &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">double <a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html">statistics::stats_computer2</a>&lt; T &gt;::mu = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a80099005c6e5f9569b75da0e49b14cf6" name="a80099005c6e5f9569b75da0e49b14cf6"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a80099005c6e5f9569b75da0e49b14cf6">&#9670;&#160;</a></span>n</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename T &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">unsigned int <a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html">statistics::stats_computer2</a>&lt; T &gt;::n = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00106">106</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ae1bfd81bd7bbbd4b0d51d7d956e532d2" name="ae1bfd81bd7bbbd4b0d51d7d956e532d2"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ae1bfd81bd7bbbd4b0d51d7d956e532d2">&#9670;&#160;</a></span>var</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename T &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">double <a class="el" href="../../d8/dab/classstatistics_1_1stats__computer2.html">statistics::stats_computer2</a>&lt; T &gt;::var = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>math/<a class="el" href="../../d0/d08/realtime__stats_8cpp.html">realtime_stats.cpp</a></li>
+<li>math/<a class="el" href="../../d0/d08/realtime__stats_8cpp_source.html">realtime_stats.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.map b/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.map
deleted file mode 100644
index 715372092..000000000
--- a/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="statistics::stats_computer2::std" name="statistics::stats_computer2::std">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,35,211,60"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="314,5,383,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="211,32,298,22,298,27,211,38"/>
-<area shape="rect" id="Node000003" href="$d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555" title=" " alt="" coords="259,55,438,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="211,57,244,61,243,66,211,62"/>
-</map>
diff --git a/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.md5 b/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.md5
deleted file mode 100644
index baaabe646..000000000
--- a/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3638ec273694133aa6a7855251f35eb8
\ No newline at end of file
diff --git a/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.svg b/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.svg
deleted file mode 100644
index 55b493d1b..000000000
--- a/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: statistics::stats_computer2::std Pages: 1 -->
-<svg width="333pt" height="76pt"
- viewBox="0.00 0.00 332.50 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>statistics::stats_computer2::std</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="154,-45.88 0,-45.88 0,-26.62 154,-26.62 154,-45.88"/>
-<text text-anchor="middle" x="77" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2::std</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.25,-67.88 231.25,-67.88 231.25,-48.62 283.25,-48.62 283.25,-67.88"/>
-<text text-anchor="middle" x="257.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.37,-45.68C176.96,-48.46 200.66,-51.39 219.51,-53.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219,-57.18 229.35,-54.93 219.86,-50.23 219,-57.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.5,-30.5 190,-30.5 190,0 324.5,0 324.5,-30.5"/>
-<text text-anchor="start" x="198" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2</text>
-<text text-anchor="middle" x="257.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.37,-27.25C162.33,-26.31 170.44,-25.36 178.42,-24.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.56,-27.93 188.09,-23.28 177.75,-20.97 178.56,-27.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph_org.svg b/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph_org.svg
deleted file mode 100644
index a98bbb0c6..000000000
--- a/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: statistics::stats_computer2::std Pages: 1 -->
-<svg width="333pt" height="76pt"
- viewBox="0.00 0.00 332.50 75.88" 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 71.88)">
-<title>statistics::stats_computer2::std</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="154,-45.88 0,-45.88 0,-26.62 154,-26.62 154,-45.88"/>
-<text text-anchor="middle" x="77" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2::std</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.25,-67.88 231.25,-67.88 231.25,-48.62 283.25,-48.62 283.25,-67.88"/>
-<text text-anchor="middle" x="257.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.37,-45.68C176.96,-48.46 200.66,-51.39 219.51,-53.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219,-57.18 229.35,-54.93 219.86,-50.23 219,-57.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.5,-30.5 190,-30.5 190,0 324.5,0 324.5,-30.5"/>
-<text text-anchor="start" x="198" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2</text>
-<text text-anchor="middle" x="257.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.37,-27.25C162.33,-26.31 170.44,-25.36 178.42,-24.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.56,-27.93 188.09,-23.28 177.75,-20.97 178.56,-27.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/dab/sparse__table_8cpp.html b/d8/dab/sparse__table_8cpp.html
index 05aaed288..22fd21538 100644
--- a/d8/dab/sparse__table_8cpp.html
+++ b/d8/dab/sparse__table_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/sparse_table.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/sparse_table.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for sparse_table.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d24/sparse__table_8cpp__incl.svg" width="330" height="126"><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">
+</div>
+<p><a href="../../d8/dab/sparse__table_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html">data_structures::sparse_table::Sparse_table</a></td></tr>
@@ -153,9 +172,8 @@ Variables</h2></td></tr>
 <tr class="memitem:a10f3ffb3f6f7e1b83d556b9c8de89a5d" id="r_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><td class="memItemLeft" align="right" valign="top">constexpr uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a> = 12345</td></tr>
 <tr class="memdesc:a10f3ffb3f6f7e1b83d556b9c8de89a5d"><td class="mdescLeft">&#160;</td><td class="mdescRight">A struct to represent sparse table for <code>min()</code> as their invariant function, for the given array <code>A</code>. The answer to queries are stored in the array ST.  <br /></td></tr>
 <tr class="separator:a10f3ffb3f6f7e1b83d556b9c8de89a5d"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af7db62f21983565c64d5d42d2a49888e" id="r_af7db62f21983565c64d5d42d2a49888e"><td class="memItemLeft" align="right" valign="top"><a id="af7db62f21983565c64d5d42d2a49888e" name="af7db62f21983565c64d5d42d2a49888e"></a>
-constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>data_structures::sparse_table::M</b> = 14</td></tr>
-<tr class="memdesc:af7db62f21983565c64d5d42d2a49888e"><td class="mdescLeft">&#160;</td><td class="mdescRight">ceil(log2(N)). <br /></td></tr>
+<tr class="memitem:af7db62f21983565c64d5d42d2a49888e" id="r_af7db62f21983565c64d5d42d2a49888e"><td class="memItemLeft" align="right" valign="top">constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af7db62f21983565c64d5d42d2a49888e">data_structures::sparse_table::M</a> = 14</td></tr>
+<tr class="memdesc:af7db62f21983565c64d5d42d2a49888e"><td class="mdescLeft">&#160;</td><td class="mdescRight">ceil(log2(N)).  <br /></td></tr>
 <tr class="separator:af7db62f21983565c64d5d42d2a49888e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -175,6 +193,8 @@ constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>data_str
 <li>Range Query : O(1) <br  />
 </li>
 </ul>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html">sparse_table.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">&#9670;&#160;</a></span>main()</h2>
@@ -204,17 +224,14 @@ constexpr uint8_t&#160;</td><td class="memItemRight" valign="bottom"><b>data_str
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html#l00162">162</a> of file <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html">sparse_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  162</span>                                 {</div>
 <div class="line"><span class="lineno">  163</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  164</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  165</span>}</div>
-<div class="ttc" id="asparse__table_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:129</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="278" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asparse__table_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00129">sparse_table.cpp:129</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -251,48 +268,65 @@ Here is the call graph for this function:</div>
 <p>&lt; as 1 is smallest from 1..9</p>
 <p>&lt; as 2 is smallest from 2..6</p>
 <p>&lt; as 3 is smallest from 3..8</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html#l00129">129</a> of file <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html">sparse_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  129</span>                   {</div>
 <div class="line"><span class="lineno">  130</span>    <span class="comment">/* We take an array as an input on which we need to perform the ranged</span></div>
 <div class="line"><span class="lineno">  131</span><span class="comment">     * minimum queries[RMQ](https://en.wikipedia.org/wiki/Range_minimum_query).</span></div>
 <div class="line"><span class="lineno">  132</span><span class="comment">     */</span></div>
-<div class="line"><span class="lineno">  133</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int64_t, 10&gt;</a> testcase = {</div>
+<div class="line"><span class="lineno">  133</span>    std::array&lt;int64_t, 10&gt; testcase = {</div>
 <div class="line"><span class="lineno">  134</span>        1, 2, 3, 4, 5,</div>
-<div class="line"><span class="lineno">  135</span>        6, 7, 8, 9, 10};  <span class="comment">///&lt; array on which RMQ will be performed.</span></div>
+<div class="line"><span class="lineno">  135</span>        6, 7, 8, 9, 10};  </div>
 <div class="line"><span class="lineno">  136</span>    <span class="keywordtype">size_t</span> testcase_size =</div>
-<div class="line"><span class="lineno">  137</span>        <span class="keyword">sizeof</span>(testcase) / <span class="keyword">sizeof</span>(testcase[0]);  <span class="comment">///&lt; size of self test&#39;s array</span></div>
+<div class="line"><span class="lineno">  137</span>        <span class="keyword">sizeof</span>(testcase) / <span class="keyword">sizeof</span>(testcase[0]);  </div>
 <div class="line"><span class="lineno">  138</span> </div>
 <div class="line"><span class="lineno">  139</span>    <a class="code hl_struct" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html">data_structures::sparse_table::Sparse_table</a></div>
-<div class="line"><span class="lineno">  140</span>        st{};  <span class="comment">///&lt; declaring sparse tree</span></div>
+<div class="line"><span class="lineno">  140</span>        st{};  </div>
 <div class="line"><span class="lineno">  141</span> </div>
-<div class="line"><span class="lineno">  142</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/copy.html">std::copy</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(testcase), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(testcase),</div>
-<div class="line"><span class="lineno">  143</span>              <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(st.A));  <span class="comment">///&lt; copying array to the struct</span></div>
-<div class="line"><span class="lineno">  144</span>    st.n = testcase_size;         <span class="comment">///&lt; passing the array&#39;s size to the struct</span></div>
+<div class="line"><span class="lineno">  142</span>    std::copy(std::begin(testcase), std::end(testcase),</div>
+<div class="line"><span class="lineno">  143</span>              std::begin(st.A));  </div>
+<div class="line"><span class="lineno">  144</span>    st.n = testcase_size;         </div>
 <div class="line"><span class="lineno">  145</span> </div>
-<div class="line"><span class="lineno">  146</span>    st.buildST();  <span class="comment">///&lt; precomputing sparse tree</span></div>
+<div class="line"><span class="lineno">  146</span>    st.buildST();  </div>
 <div class="line"><span class="lineno">  147</span> </div>
 <div class="line"><span class="lineno">  148</span>    <span class="comment">// pass queries of the form: [l,r]</span></div>
-<div class="line"><span class="lineno">  149</span>    assert(st.query(1, 9) == 1);  <span class="comment">///&lt; as 1 is smallest from 1..9</span></div>
-<div class="line"><span class="lineno">  150</span>    assert(st.query(2, 6) == 2);  <span class="comment">///&lt; as 2 is smallest from 2..6</span></div>
-<div class="line"><span class="lineno">  151</span>    assert(st.query(3, 8) == 3);  <span class="comment">///&lt; as 3 is smallest from 3..8</span></div>
+<div class="line"><span class="lineno">  149</span>    assert(st.query(1, 9) == 1);  </div>
+<div class="line"><span class="lineno">  150</span>    assert(st.query(2, 6) == 2);  </div>
+<div class="line"><span class="lineno">  151</span>    assert(st.query(3, 8) == 3);  </div>
 <div class="line"><span class="lineno">  152</span> </div>
-<div class="line"><span class="lineno">  153</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Self-test implementations passed!&quot;</span> &lt;&lt; <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">  153</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Self-test implementations passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  154</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="acopy_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/copy.html">std::copy</a></div><div class="ttdeci">T copy(T... args)</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="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="astructdata__structures_1_1sparse__table_1_1_sparse__table_html"><div class="ttname"><a href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html">data_structures::sparse_table::Sparse_table</a></div><div class="ttdef"><b>Definition</b> sparse_table.cpp:51</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="180" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astructdata__structures_1_1sparse__table_1_1_sparse__table_html"><div class="ttname"><a href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html">data_structures::sparse_table::Sparse_table</a></div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00051">sparse_table.cpp:51</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Variable Documentation</h2>
+<a id="af7db62f21983565c64d5d42d2a49888e" name="af7db62f21983565c64d5d42d2a49888e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#af7db62f21983565c64d5d42d2a49888e">&#9670;&#160;</a></span>M</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">uint8_t data_structures::sparse_table::M = 14</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">constexpr</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>ceil(log2(N)). </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html#l00049">49</a> of file <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html">sparse_table.cpp</a>.</p>
+
+</div>
+</div>
 <a id="a10f3ffb3f6f7e1b83d556b9c8de89a5d" name="a10f3ffb3f6f7e1b83d556b9c8de89a5d"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a10f3ffb3f6f7e1b83d556b9c8de89a5d">&#9670;&#160;</a></span>N</h2>
 
@@ -316,6 +350,8 @@ Here is the call graph for this function:</div>
 <p>A struct to represent sparse table for <code>min()</code> as their invariant function, for the given array <code>A</code>. The answer to queries are stored in the array ST. </p>
 <p>the maximum size of the array. </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html">sparse_table.cpp</a>.</p>
+
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
deleted file mode 100644
index 0b8da185b..000000000
--- a/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,80,55,106"/>
-<area shape="rect" id="Node000002" href="$d8/dab/sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,80,146,106"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,90,87,90,87,96,55,96"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="194,5,272,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="141,77,192,40,196,38,199,42,196,44,144,82"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/copy.html#" title=" " alt="" coords="196,55,271,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="146,85,180,77,181,82,147,90"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="199,104,267,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="147,95,184,103,183,109,146,100"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="198,153,269,179"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="145,104,196,140,199,142,196,147,192,144,142,108"/>
-</map>
diff --git a/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
deleted file mode 100644
index 826e7a1ef..000000000
--- a/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-37093734509d96a8fecd4cff3a423f8e
\ No newline at end of file
diff --git a/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
deleted file mode 100644
index 537681c90..000000000
--- a/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="208pt" height="138pt"
- viewBox="0.00 0.00 208.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dab/sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-74.25 73,-74.25 73,-55 105.5,-55 105.5,-74.25"/>
-<text text-anchor="middle" x="89.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-64.62C44.58,-64.62 53.31,-64.62 61.45,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-68.13 71.2,-64.63 61.2,-61.13 61.2,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.25,-130.25 141.5,-130.25 141.5,-111 200.25,-111 200.25,-130.25"/>
-<text text-anchor="middle" x="170.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-74.57C113.37,-82.4 128.17,-93.47 141.5,-102.62 142.34,-103.2 143.2,-103.79 144.07,-104.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.98,-107.19 152.27,-109.72 145.81,-101.32 141.98,-107.19"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/copy.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="199.12,-93.25 142.62,-93.25 142.62,-74 199.12,-74 199.12,-93.25"/>
-<text text-anchor="middle" x="170.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::copy</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.98,-68.38C113.25,-70.11 122.23,-72.26 131.14,-74.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.23,-77.76 140.77,-76.68 131.86,-70.96 130.23,-77.76"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.5,-56.25 145.25,-56.25 145.25,-37 196.5,-37 196.5,-56.25"/>
-<text text-anchor="middle" x="170.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.98,-61.07C113.93,-59.27 123.93,-57.01 133.64,-54.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.31,-58.25 143.3,-52.63 132.77,-51.42 134.31,-58.25"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.62,-19.25 144.12,-19.25 144.12,0 197.62,0 197.62,-19.25"/>
-<text text-anchor="middle" x="170.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.58,-54.66C113.84,-47.09 128.42,-36.49 141.5,-27.62 142.35,-27.05 143.21,-26.47 144.08,-25.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.81,-28.94 152.29,-20.56 142,-23.07 145.81,-28.94"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
deleted file mode 100644
index ac19feb00..000000000
--- a/d8/dab/sparse__table_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="208pt" height="138pt"
- viewBox="0.00 0.00 208.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dab/sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-74.25 73,-74.25 73,-55 105.5,-55 105.5,-74.25"/>
-<text text-anchor="middle" x="89.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-64.62C44.58,-64.62 53.31,-64.62 61.45,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-68.13 71.2,-64.63 61.2,-61.13 61.2,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.25,-130.25 141.5,-130.25 141.5,-111 200.25,-111 200.25,-130.25"/>
-<text text-anchor="middle" x="170.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.12,-74.57C113.37,-82.4 128.17,-93.47 141.5,-102.62 142.34,-103.2 143.2,-103.79 144.07,-104.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.98,-107.19 152.27,-109.72 145.81,-101.32 141.98,-107.19"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/copy.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="199.12,-93.25 142.62,-93.25 142.62,-74 199.12,-74 199.12,-93.25"/>
-<text text-anchor="middle" x="170.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::copy</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.98,-68.38C113.25,-70.11 122.23,-72.26 131.14,-74.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.23,-77.76 140.77,-76.68 131.86,-70.96 130.23,-77.76"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.5,-56.25 145.25,-56.25 145.25,-37 196.5,-37 196.5,-56.25"/>
-<text text-anchor="middle" x="170.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.98,-61.07C113.93,-59.27 123.93,-57.01 133.64,-54.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.31,-58.25 143.3,-52.63 132.77,-51.42 134.31,-58.25"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.62,-19.25 144.12,-19.25 144.12,0 197.62,0 197.62,-19.25"/>
-<text text-anchor="middle" x="170.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.58,-54.66C113.84,-47.09 128.42,-36.49 141.5,-27.62 142.35,-27.05 143.21,-26.47 144.08,-25.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.81,-28.94 152.29,-20.56 142,-23.07 145.81,-28.94"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 1c8bdf40a..000000000
--- a/d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,80,49,106"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="97,5,175,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="44,77,95,40,99,38,102,42,98,44,47,82"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/copy.html#" title=" " alt="" coords="98,55,174,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="49,85,82,77,83,82,50,90"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="102,104,170,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="50,95,87,103,86,109,49,100"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="100,153,172,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="48,104,98,140,102,142,99,147,95,144,45,108"/>
-</map>
diff --git a/d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 150c62104..000000000
--- a/d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-acd42c1201f0e2f16635373df7f51fb9
\ No newline at end of file
diff --git a/d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 3fa2bb7bf..000000000
--- a/d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="135pt" height="138pt"
- viewBox="0.00 0.00 135.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-74.25 0,-74.25 0,-55 32.5,-55 32.5,-74.25"/>
-<text text-anchor="middle" x="16.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-130.25 68.5,-130.25 68.5,-111 127.25,-111 127.25,-130.25"/>
-<text text-anchor="middle" x="97.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.12,-74.57C40.37,-82.4 55.17,-93.47 68.5,-102.62 69.34,-103.2 70.2,-103.79 71.07,-104.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.98,-107.19 79.27,-109.72 72.81,-101.32 68.98,-107.19"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/copy.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.12,-93.25 69.62,-93.25 69.62,-74 126.12,-74 126.12,-93.25"/>
-<text text-anchor="middle" x="97.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::copy</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.98,-68.38C40.25,-70.11 49.23,-72.26 58.14,-74.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.23,-77.76 67.77,-76.68 58.86,-70.96 57.23,-77.76"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="123.5,-56.25 72.25,-56.25 72.25,-37 123.5,-37 123.5,-56.25"/>
-<text text-anchor="middle" x="97.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.98,-61.07C40.93,-59.27 50.93,-57.01 60.64,-54.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.31,-58.25 70.3,-52.63 59.77,-51.42 61.31,-58.25"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="124.62,-19.25 71.12,-19.25 71.12,0 124.62,0 124.62,-19.25"/>
-<text text-anchor="middle" x="97.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.58,-54.66C40.84,-47.09 55.42,-36.49 68.5,-27.62 69.35,-27.05 70.21,-26.47 71.08,-25.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.81,-28.94 79.29,-20.56 69,-23.07 72.81,-28.94"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 39bb9e9c6..000000000
--- a/d8/dab/sparse__table_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="135pt" height="138pt"
- viewBox="0.00 0.00 135.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-74.25 0,-74.25 0,-55 32.5,-55 32.5,-74.25"/>
-<text text-anchor="middle" x="16.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-130.25 68.5,-130.25 68.5,-111 127.25,-111 127.25,-130.25"/>
-<text text-anchor="middle" x="97.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.12,-74.57C40.37,-82.4 55.17,-93.47 68.5,-102.62 69.34,-103.2 70.2,-103.79 71.07,-104.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.98,-107.19 79.27,-109.72 72.81,-101.32 68.98,-107.19"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/copy.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.12,-93.25 69.62,-93.25 69.62,-74 126.12,-74 126.12,-93.25"/>
-<text text-anchor="middle" x="97.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::copy</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.98,-68.38C40.25,-70.11 49.23,-72.26 58.14,-74.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.23,-77.76 67.77,-76.68 58.86,-70.96 57.23,-77.76"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="123.5,-56.25 72.25,-56.25 72.25,-37 123.5,-37 123.5,-56.25"/>
-<text text-anchor="middle" x="97.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.98,-61.07C40.93,-59.27 50.93,-57.01 60.64,-54.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.31,-58.25 70.3,-52.63 59.77,-51.42 61.31,-58.25"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="124.62,-19.25 71.12,-19.25 71.12,0 124.62,0 124.62,-19.25"/>
-<text text-anchor="middle" x="97.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.58,-54.66C40.84,-47.09 55.42,-36.49 68.5,-27.62 69.35,-27.05 70.21,-26.47 71.08,-25.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.81,-28.94 79.29,-20.56 69,-23.07 72.81,-28.94"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/dab/sparse__table_8cpp_source.html b/d8/dab/sparse__table_8cpp_source.html
new file mode 100644
index 000000000..cb7408a9f
--- /dev/null
+++ b/d8/dab/sparse__table_8cpp_source.html
@@ -0,0 +1,242 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/sparse_table.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/dab/sparse__table_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">sparse_table.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/dab/sparse__table_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;array&gt;</span>     </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d3c/namespacedata__structures.html">data_structures</a> {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/d55/namespacesparse__table.html">sparse_table</a> {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">   48</a></span><span class="keyword">constexpr</span> uint32_t <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 12345;  </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"><a class="line" href="../../d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e">   49</a></span><span class="keyword">constexpr</span> uint8_t <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e">M</a> = 14;      </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="foldopen" id="foldopen00051" data-start="{" data-end="};">
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html">   51</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html">Sparse_table</a> {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad71ecd43d0af1127df5f4006258f9635">   52</a></span>    <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad71ecd43d0af1127df5f4006258f9635">n</a> = 0;  </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e">   57</a></span>    std::array&lt;int64_t, N&gt; <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e">A</a> = {};  </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    std::array&lt;std::array&lt;int64_t, N&gt;, <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e">M</a>&gt;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81">   59</a></span>        <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81">ST</a>{};  </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"><a class="line" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a6cf72f93b1551f0d943c585b4f173be3">   60</a></span>    std::array&lt;int64_t, N&gt; <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a6cf72f93b1551f0d943c585b4f173be3">LOG</a> = {};  </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordtype">void</span> buildST() {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a6cf72f93b1551f0d943c585b4f173be3">LOG</a>[0] = -1;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad71ecd43d0af1127df5f4006258f9635">n</a>; ++i) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81">ST</a>[0][i] = <span class="keyword">static_cast&lt;</span>int64_t<span class="keyword">&gt;</span>(i);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a6cf72f93b1551f0d943c585b4f173be3">LOG</a>[i + 1] = <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a6cf72f93b1551f0d943c585b4f173be3">LOG</a>[i] + !(i &amp; (i + 1));  </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        }</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 1; <span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(1 &lt;&lt; j) &lt;= <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad71ecd43d0af1127df5f4006258f9635">n</a>; ++j) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; <span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(i + (1 &lt;&lt; j)) &lt;= <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad71ecd43d0af1127df5f4006258f9635">n</a>; ++i) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>                int64_t x = <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81">ST</a>[j - 1][i];  </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>                int64_t y =</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>                    <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81">ST</a>[j - 1]</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>                      [i + (1 &lt;&lt; (j - 1))];  </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>                <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81">ST</a>[j][i] =</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>                    (<a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e">A</a>[x] &lt;= <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e">A</a>[y] ? x : y);  </div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>            }</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        }</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    }</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span> </div>
+<div class="foldopen" id="foldopen00110" data-start="{" data-end="}">
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"><a class="line" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a0c8cbe7239232863f104793c08273039">  110</a></span>    int64_t <a class="code hl_function" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a0c8cbe7239232863f104793c08273039">query</a>(int64_t l, int64_t r) {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        int64_t g = <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a6cf72f93b1551f0d943c585b4f173be3">LOG</a>[r - l + 1];  </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        int64_t x = <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81">ST</a>[g][l];  </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        int64_t y =</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>            <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81">ST</a>[g][r - (1 &lt;&lt; g) + 1];  </div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span> </div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        <span class="keywordflow">return</span> (<a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e">A</a>[x] &lt;= <a class="code hl_variable" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e">A</a>[y] ? x : y);  </div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    }</div>
+</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>};</div>
+</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>}  <span class="comment">// namespace sparse_table</span></div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>}  <span class="comment">// namespace data_structures</span></div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
+<div class="foldopen" id="foldopen00129" data-start="{" data-end="}">
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"><a class="line" href="../../d8/dab/sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  129</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/dab/sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="comment">/* We take an array as an input on which we need to perform the ranged</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span><span class="comment">     * minimum queries[RMQ](https://en.wikipedia.org/wiki/Range_minimum_query).</span></div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    std::array&lt;int64_t, 10&gt; testcase = {</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>        1, 2, 3, 4, 5,</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>        6, 7, 8, 9, 10};  </div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    <span class="keywordtype">size_t</span> testcase_size =</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        <span class="keyword">sizeof</span>(testcase) / <span class="keyword">sizeof</span>(testcase[0]);  </div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <a class="code hl_struct" href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html">data_structures::sparse_table::Sparse_table</a></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        st{};  </div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    std::copy(std::begin(testcase), std::end(testcase),</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>              std::begin(st.A));  </div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    st.n = testcase_size;         </div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span> </div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    st.buildST();  </div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span> </div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    <span class="comment">// pass queries of the form: [l,r]</span></div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    assert(st.query(1, 9) == 1);  </div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    assert(st.query(2, 6) == 2);  </div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    assert(st.query(3, 8) == 3);  </div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span> </div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Self-test implementations passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>}</div>
+</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span> </div>
+<div class="foldopen" id="foldopen00162" data-start="{" data-end="}">
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"><a class="line" href="../../d8/dab/sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">  162</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[]) {</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    <a class="code hl_function" href="../../d8/dab/sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>}</div>
+</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html">data_structures</a></div><div class="ttdoc">for IO operations</div></div>
+<div class="ttc" id="anamespacesparse__table_html"><div class="ttname"><a href="../../d9/d55/namespacesparse__table.html">sparse_table</a></div><div class="ttdoc">Functions for Implementation of Sparse Table</div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="#l00048">sparse_table.cpp:48</a></div></div>
+<div class="ttc" id="asparse__table_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/dab/sparse__table_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> <a href="#l00129">sparse_table.cpp:129</a></div></div>
+<div class="ttc" id="asparse__table_8cpp_html_af7db62f21983565c64d5d42d2a49888e"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e">data_structures::sparse_table::M</a></div><div class="ttdeci">constexpr uint8_t M</div><div class="ttdoc">ceil(log2(N)).</div><div class="ttdef"><b>Definition</b> <a href="#l00049">sparse_table.cpp:49</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1sparse__table_1_1_sparse__table_html"><div class="ttname"><a href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html">data_structures::sparse_table::Sparse_table</a></div><div class="ttdef"><b>Definition</b> <a href="#l00051">sparse_table.cpp:51</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1sparse__table_1_1_sparse__table_html_a0c8cbe7239232863f104793c08273039"><div class="ttname"><a href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a0c8cbe7239232863f104793c08273039">data_structures::sparse_table::Sparse_table::query</a></div><div class="ttdeci">int64_t query(int64_t l, int64_t r)</div><div class="ttdoc">Queries the sparse table for the value of the interval [l, r] (i.e. from l to r inclusive).</div><div class="ttdef"><b>Definition</b> <a href="#l00110">sparse_table.cpp:110</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1sparse__table_1_1_sparse__table_html_a6cf72f93b1551f0d943c585b4f173be3"><div class="ttname"><a href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a6cf72f93b1551f0d943c585b4f173be3">data_structures::sparse_table::Sparse_table::LOG</a></div><div class="ttdeci">std::array&lt; int64_t, N &gt; LOG</div><div class="ttdoc">where floor(log2(i)) are precomputed.</div><div class="ttdef"><b>Definition</b> <a href="#l00060">sparse_table.cpp:60</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1sparse__table_1_1_sparse__table_html_ab78620742305a35ff2f8d61179f47d3e"><div class="ttname"><a href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e">data_structures::sparse_table::Sparse_table::A</a></div><div class="ttdeci">std::array&lt; int64_t, N &gt; A</div><div class="ttdoc">input array to perform RMQ.</div><div class="ttdef"><b>Definition</b> <a href="#l00057">sparse_table.cpp:57</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1sparse__table_1_1_sparse__table_html_ad36b9a20fed47b068e407008c04e9f81"><div class="ttname"><a href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81">data_structures::sparse_table::Sparse_table::ST</a></div><div class="ttdeci">std::array&lt; std::array&lt; int64_t, N &gt;, M &gt; ST</div><div class="ttdoc">the sparse table storing min() values for given interval.</div><div class="ttdef"><b>Definition</b> <a href="#l00059">sparse_table.cpp:59</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1sparse__table_1_1_sparse__table_html_ad71ecd43d0af1127df5f4006258f9635"><div class="ttname"><a href="../../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad71ecd43d0af1127df5f4006258f9635">data_structures::sparse_table::Sparse_table::n</a></div><div class="ttdeci">size_t n</div><div class="ttdoc">size of input array.</div><div class="ttdef"><b>Definition</b> <a href="#l00052">sparse_table.cpp:52</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d8/dab/sparse__table_8cpp.html">sparse_table.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/db1/binomial__calculate_8cpp.html b/d8/db1/binomial__calculate_8cpp.html
index 0b1cdb02d..bf212159a 100644
--- a/d8/db1/binomial__calculate_8cpp.html
+++ b/d8/db1/binomial__calculate_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/binomial_calculate.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/binomial_calculate.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for binomial_calculate.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d91/binomial__calculate_8cpp__incl.svg" width="339" height="111"><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">
+</div>
+<p><a href="../../d8/db1/binomial__calculate_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -147,6 +166,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Program to calculate <a href="https://en.wikipedia.org/wiki/Binomial_coefficient" target="_blank">Binomial coefficients</a> </p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/astronmax" target="_blank">astronmax</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/db1/binomial__calculate_8cpp_source.html">binomial_calculate.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="aae407a2a13362c4c64fbe509ff325978" name="aae407a2a13362c4c64fbe509ff325978"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aae407a2a13362c4c64fbe509ff325978">&#9670;&#160;</a></span>calculate()</h2>
@@ -176,6 +197,8 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>binomial coefficient for n and k </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/db1/binomial__calculate_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../d8/db1/binomial__calculate_8cpp_source.html">binomial_calculate.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   32</span>                                       {</div>
 <div class="line"><span class="lineno">   33</span>    <span class="comment">// basic cases</span></div>
 <div class="line"><span class="lineno">   34</span>    <span class="keywordflow">if</span> (k &gt; (n / 2))</div>
@@ -193,14 +216,9 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   46</span> </div>
 <div class="line"><span class="lineno">   47</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   48</span>}</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/db1/binomial__calculate_8cpp_aae407a2a13362c4c64fbe509ff325978_cgraph.svg" width="178" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac0f2228420376f4db7e1274f2b41667c" name="ac0f2228420376f4db7e1274f2b41667c"></a>
@@ -231,31 +249,25 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/db1/binomial__calculate_8cpp_source.html#l00079">79</a> of file <a class="el" href="../../d8/db1/binomial__calculate_8cpp_source.html">binomial_calculate.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   79</span>                                       {</div>
 <div class="line"><span class="lineno">   80</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   81</span> </div>
 <div class="line"><span class="lineno">   82</span>    <span class="keywordflow">if</span> (argc &lt; 3) {</div>
-<div class="line"><span class="lineno">   83</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Usage ./binomial_calculate {n} {k}&quot;</span> &lt;&lt; <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">   83</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Usage ./binomial_calculate {n} {k}&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   84</span>        <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   85</span>    }</div>
 <div class="line"><span class="lineno">   86</span> </div>
-<div class="line"><span class="lineno">   87</span>    int32_t n = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">atoi</a>(argv[1]);</div>
-<div class="line"><span class="lineno">   88</span>    int32_t <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">atoi</a>(argv[2]);</div>
+<div class="line"><span class="lineno">   87</span>    int32_t n = atoi(argv[1]);</div>
+<div class="line"><span class="lineno">   88</span>    int32_t <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = atoi(argv[2]);</div>
 <div class="line"><span class="lineno">   89</span> </div>
-<div class="line"><span class="lineno">   90</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#aae407a2a13362c4c64fbe509ff325978">math::binomial::calculate</a>(n, k) &lt;&lt; <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">   90</span>    std::cout &lt;&lt; <a class="code hl_function" href="#aae407a2a13362c4c64fbe509ff325978">math::binomial::calculate</a>(n, k) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   91</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   92</span>}</div>
-<div class="ttc" id="aatoi_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">std::atoi</a></div><div class="ttdeci">T atoi(T... args)</div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="abinomial__calculate_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> binomial_calculate.cpp:56</div></div>
-<div class="ttc" id="abinomial__calculate_8cpp_html_aae407a2a13362c4c64fbe509ff325978"><div class="ttname"><a href="#aae407a2a13362c4c64fbe509ff325978">math::binomial::calculate</a></div><div class="ttdeci">size_t calculate(int32_t n, int32_t k)</div><div class="ttdoc">Function to calculate binomial coefficients.</div><div class="ttdef"><b>Definition</b> binomial_calculate.cpp:32</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><!-- 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="../../d8/db1/binomial__calculate_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.svg" width="278" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="abinomial__calculate_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/db1/binomial__calculate_8cpp_source.html#l00056">binomial_calculate.cpp:56</a></div></div>
+<div class="ttc" id="abinomial__calculate_8cpp_html_aae407a2a13362c4c64fbe509ff325978"><div class="ttname"><a href="#aae407a2a13362c4c64fbe509ff325978">math::binomial::calculate</a></div><div class="ttdeci">size_t calculate(int32_t n, int32_t k)</div><div class="ttdoc">Function to calculate binomial coefficients.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/db1/binomial__calculate_8cpp_source.html#l00032">binomial_calculate.cpp:32</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -283,6 +295,8 @@ Here is the call graph for this function:</div>
 
 <p>Test implementations. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/db1/binomial__calculate_8cpp_source.html#l00056">56</a> of file <a class="el" href="../../d8/db1/binomial__calculate_8cpp_source.html">binomial_calculate.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   56</span>                    {</div>
 <div class="line"><span class="lineno">   57</span>    <span class="comment">// tests for calculate function</span></div>
 <div class="line"><span class="lineno">   58</span>    assert(math::binomial::calculate(1, 1) == 1);</div>
@@ -296,15 +310,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   66</span>    assert(math::binomial::calculate(60, 30) == 118264581564861424);</div>
 <div class="line"><span class="lineno">   67</span>    assert(math::binomial::calculate(62, 31) == 465428353255261088);</div>
 <div class="line"><span class="lineno">   68</span> </div>
-<div class="line"><span class="lineno">   69</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;[+] Binomial coefficients calculate test completed&quot;</span></div>
-<div class="line"><span class="lineno">   70</span>              &lt;&lt; <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">   69</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;[+] Binomial coefficients calculate test completed&quot;</span></div>
+<div class="line"><span class="lineno">   70</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   71</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/db1/binomial__calculate_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="180" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d8/db1/binomial__calculate_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d8/db1/binomial__calculate_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index 08c636e1a..000000000
--- a/d8/db1/binomial__calculate_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Test implementations." alt="" coords="5,5,56,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="104,5,175,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,16,88,16,88,21,56,21"/>
-</map>
diff --git a/d8/db1/binomial__calculate_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d8/db1/binomial__calculate_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index f4d9f359b..000000000
--- a/d8/db1/binomial__calculate_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a4e2557ea104e2239629762334e2cb58
\ No newline at end of file
diff --git a/d8/db1/binomial__calculate_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d8/db1/binomial__calculate_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index af26a8e13..000000000
--- a/d8/db1/binomial__calculate_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 135.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-19.25 73.75,-19.25 73.75,0 127.25,0 127.25,-19.25"/>
-<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.14,-9.62 53.69,-9.62 62.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.84,-13.13 71.83,-9.63 61.83,-6.13 61.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/db1/binomial__calculate_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d8/db1/binomial__calculate_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index 69e4346a3..000000000
--- a/d8/db1/binomial__calculate_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 135.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-19.25 73.75,-19.25 73.75,0 127.25,0 127.25,-19.25"/>
-<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.14,-9.62 53.69,-9.62 62.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.84,-13.13 71.83,-9.63 61.83,-6.13 61.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/db1/binomial__calculate_8cpp_aae407a2a13362c4c64fbe509ff325978_cgraph.map b/d8/db1/binomial__calculate_8cpp_aae407a2a13362c4c64fbe509ff325978_cgraph.map
deleted file mode 100644
index 00c60cf90..000000000
--- a/d8/db1/binomial__calculate_8cpp_aae407a2a13362c4c64fbe509ff325978_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="math::binomial::calculate" name="math::binomial::calculate">
-<area shape="rect" id="Node000001" title="Function to calculate binomial coefficients." alt="" coords="5,29,172,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="60,30,55,21,58,11,70,5,89,3,109,5,119,12,117,16,107,10,88,8,71,10,62,15,60,20,65,28"/>
-</map>
diff --git a/d8/db1/binomial__calculate_8cpp_aae407a2a13362c4c64fbe509ff325978_cgraph.md5 b/d8/db1/binomial__calculate_8cpp_aae407a2a13362c4c64fbe509ff325978_cgraph.md5
deleted file mode 100644
index 15c0581dd..000000000
--- a/d8/db1/binomial__calculate_8cpp_aae407a2a13362c4c64fbe509ff325978_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-acf18c21765344047fafb8a4df920c89
\ No newline at end of file
diff --git a/d8/db1/binomial__calculate_8cpp_aae407a2a13362c4c64fbe509ff325978_cgraph.svg b/d8/db1/binomial__calculate_8cpp_aae407a2a13362c4c64fbe509ff325978_cgraph.svg
deleted file mode 100644
index 5d68012d5..000000000
--- a/d8/db1/binomial__calculate_8cpp_aae407a2a13362c4c64fbe509ff325978_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::binomial::calculate Pages: 1 -->
-<svg width="133pt" height="45pt"
- viewBox="0.00 0.00 132.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>math::binomial::calculate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to calculate binomial coefficients.">
-<polygon fill="#999999" stroke="#666666" points="124.75,-19.25 0,-19.25 0,0 124.75,0 124.75,-19.25"/>
-<text text-anchor="middle" x="62.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::binomial::calculate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.84,-19.54C33.94,-28.15 40.45,-37.25 62.38,-37.25 74.37,-37.25 81.75,-34.53 84.52,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.95,-29.95 82.25,-21.01 81.13,-31.55 87.95,-29.95"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/db1/binomial__calculate_8cpp_aae407a2a13362c4c64fbe509ff325978_cgraph_org.svg b/d8/db1/binomial__calculate_8cpp_aae407a2a13362c4c64fbe509ff325978_cgraph_org.svg
deleted file mode 100644
index 7e90cde42..000000000
--- a/d8/db1/binomial__calculate_8cpp_aae407a2a13362c4c64fbe509ff325978_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::binomial::calculate Pages: 1 -->
-<svg width="133pt" height="45pt"
- viewBox="0.00 0.00 132.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>math::binomial::calculate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to calculate binomial coefficients.">
-<polygon fill="#999999" stroke="#666666" points="124.75,-19.25 0,-19.25 0,0 124.75,0 124.75,-19.25"/>
-<text text-anchor="middle" x="62.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::binomial::calculate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.84,-19.54C33.94,-28.15 40.45,-37.25 62.38,-37.25 74.37,-37.25 81.75,-34.53 84.52,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.95,-29.95 82.25,-21.01 81.13,-31.55 87.95,-29.95"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/db1/binomial__calculate_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.map b/d8/db1/binomial__calculate_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.map
deleted file mode 100644
index e35241007..000000000
--- a/d8/db1/binomial__calculate_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="201,5,272,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,185,16,185,21,55,21"/>
-<area shape="rect" id="Node000003" href="$d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Test implementations." alt="" coords="103,31,153,56"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,22,89,31,87,36,54,27"/>
-<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="153,35,185,27,186,33,154,40"/>
-</map>
diff --git a/d8/db1/binomial__calculate_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.md5 b/d8/db1/binomial__calculate_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.md5
deleted file mode 100644
index 2217c41e8..000000000
--- a/d8/db1/binomial__calculate_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-aa5629c0d4071cf57387ace74ff21a7c
\ No newline at end of file
diff --git a/d8/db1/binomial__calculate_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.svg b/d8/db1/binomial__calculate_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.svg
deleted file mode 100644
index d0e534399..000000000
--- a/d8/db1/binomial__calculate_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="208pt" height="46pt"
- viewBox="0.00 0.00 208.25 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-38.25 0,-38.25 0,-19 37,-19 37,-38.25"/>
-<text text-anchor="middle" x="18.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.25,-38.25 146.75,-38.25 146.75,-19 200.25,-19 200.25,-38.25"/>
-<text text-anchor="middle" x="173.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-28.62C61.19,-28.62 104,-28.62 135.07,-28.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.83,-32.13 144.83,-28.63 134.83,-25.13 134.83,-32.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-23.93C44.64,-21.93 53.57,-19.56 61.98,-17.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.71,-20.74 71.48,-14.79 60.91,-13.98 62.71,-20.74"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.94,-13.94C118.22,-15.67 126.89,-17.74 135.39,-19.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.34,-23.12 144.88,-22.03 135.96,-16.31 134.34,-23.12"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/db1/binomial__calculate_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph_org.svg b/d8/db1/binomial__calculate_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph_org.svg
deleted file mode 100644
index 6e6a048f4..000000000
--- a/d8/db1/binomial__calculate_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="208pt" height="46pt"
- viewBox="0.00 0.00 208.25 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-38.25 0,-38.25 0,-19 37,-19 37,-38.25"/>
-<text text-anchor="middle" x="18.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.25,-38.25 146.75,-38.25 146.75,-19 200.25,-19 200.25,-38.25"/>
-<text text-anchor="middle" x="173.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-28.62C61.19,-28.62 104,-28.62 135.07,-28.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.83,-32.13 144.83,-28.63 134.83,-25.13 134.83,-32.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-23.93C44.64,-21.93 53.57,-19.56 61.98,-17.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.71,-20.74 71.48,-14.79 60.91,-13.98 62.71,-20.74"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.94,-13.94C118.22,-15.67 126.89,-17.74 135.39,-19.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.34,-23.12 144.88,-22.03 135.96,-16.31 134.34,-23.12"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/db1/binomial__calculate_8cpp_source.html b/d8/db1/binomial__calculate_8cpp_source.html
new file mode 100644
index 000000000..7901db1ca
--- /dev/null
+++ b/d8/db1/binomial__calculate_8cpp_source.html
@@ -0,0 +1,207 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/binomial_calculate.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/db1/binomial__calculate_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">binomial_calculate.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/db1/binomial__calculate_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;cstdint&gt;</span>   </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;cstdlib&gt;</span>   </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d7a/namespacebinomial.html">binomial</a> {</div>
+<div class="foldopen" id="foldopen00032" data-start="{" data-end="}">
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../d8/db1/binomial__calculate_8cpp.html#aae407a2a13362c4c64fbe509ff325978">   32</a></span><span class="keywordtype">size_t</span> <a class="code hl_function" href="../../d8/db1/binomial__calculate_8cpp.html#aae407a2a13362c4c64fbe509ff325978">calculate</a>(int32_t n, int32_t k) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="comment">// basic cases</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">if</span> (k &gt; (n / 2))</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        k = n - k;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">if</span> (k == 1)</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        <span class="keywordflow">return</span> n;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">if</span> (k == 0)</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        <span class="keywordflow">return</span> 1;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordtype">size_t</span> result = 1;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">for</span> (int32_t i = 1; i &lt;= k; ++i) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        result *= n - k + i;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        result /= i;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>}</div>
+</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>}  <span class="comment">// namespace binomial</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="foldopen" id="foldopen00056" data-start="{" data-end="}">
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="../../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">   56</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="comment">// tests for calculate function</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    assert(math::binomial::calculate(1, 1) == 1);</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    assert(math::binomial::calculate(57, 57) == 1);</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    assert(math::binomial::calculate(6, 3) == 20);</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    assert(math::binomial::calculate(10, 5) == 252);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    assert(math::binomial::calculate(20, 10) == 184756);</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    assert(math::binomial::calculate(30, 15) == 155117520);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    assert(math::binomial::calculate(40, 20) == 137846528820);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    assert(math::binomial::calculate(50, 25) == 126410606437752);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    assert(math::binomial::calculate(60, 30) == 118264581564861424);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    assert(math::binomial::calculate(62, 31) == 465428353255261088);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;[+] Binomial coefficients calculate test completed&quot;</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>}</div>
+</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="foldopen" id="foldopen00079" data-start="{" data-end="}">
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="../../d8/db1/binomial__calculate_8cpp.html#ac0f2228420376f4db7e1274f2b41667c">   79</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keyword">const</span> <span class="keywordtype">char</span>* argv[]) {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <a class="code hl_function" href="../../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">if</span> (argc &lt; 3) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Usage ./binomial_calculate {n} {k}&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    }</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    int32_t n = atoi(argv[1]);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    int32_t k = atoi(argv[2]);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    std::cout &lt;&lt; math::binomial::calculate(n, k) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>}</div>
+</div>
+<div class="ttc" id="abinomial__calculate_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> <a href="#l00056">binomial_calculate.cpp:56</a></div></div>
+<div class="ttc" id="abinomial__calculate_8cpp_html_aae407a2a13362c4c64fbe509ff325978"><div class="ttname"><a href="../../d8/db1/binomial__calculate_8cpp.html#aae407a2a13362c4c64fbe509ff325978">math::binomial::calculate</a></div><div class="ttdeci">size_t calculate(int32_t n, int32_t k)</div><div class="ttdoc">Function to calculate binomial coefficients.</div><div class="ttdef"><b>Definition</b> <a href="#l00032">binomial_calculate.cpp:32</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacebinomial_html"><div class="ttname"><a href="../../d7/d7a/namespacebinomial.html">binomial</a></div><div class="ttdoc">Functions for Binomial coefficients implementation.</div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d8/db1/binomial__calculate_8cpp.html">binomial_calculate.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/db7/queue__using__linked__list_8cpp_source.html b/d8/db7/queue__using__linked__list_8cpp_source.html
new file mode 100644
index 000000000..a6da6c6ee
--- /dev/null
+++ b/d8/db7/queue__using__linked__list_8cpp_source.html
@@ -0,0 +1,210 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/queue_using_linked_list.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/db7/queue__using__linked__list_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">queue_using_linked_list.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> {</div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span>    <span class="keywordtype">int</span> val;</div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *next;</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span>};</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *front, *rear;</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="keywordtype">void</span> Enque(<span class="keywordtype">int</span> x) {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="keywordflow">if</span> (rear == NULL) {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>        n-&gt;val = x;</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>        n-&gt;next = NULL;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>        rear = n;</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>        front = n;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    }</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        n-&gt;val = x;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        n-&gt;next = NULL;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        rear-&gt;next = n;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        rear = n;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    }</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>}</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keywordtype">void</span> Deque() {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">if</span> (rear == NULL &amp;&amp; front == NULL) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nUnderflow&quot;</span>;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = front;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span> &lt;&lt; t-&gt;val &lt;&lt; <span class="stringliteral">&quot; deleted&quot;</span>;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        front = front-&gt;next;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        <span class="keyword">delete</span> t;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        <span class="keywordflow">if</span> (front == NULL)</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>            rear = NULL;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    }</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>}</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="keywordtype">void</span> show() {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = front;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">while</span> (t != NULL) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        cout &lt;&lt; t-&gt;val &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        t = t-&gt;next;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>}</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordtype">int</span> ch, x;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n1. Enque&quot;</span>;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n2. Deque&quot;</span>;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n3. Print&quot;</span>;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nEnter Your Choice : &quot;</span>;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        cin &gt;&gt; ch;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordflow">if</span> (ch == 1) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            cout &lt;&lt; <span class="stringliteral">&quot;\nInsert : &quot;</span>;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            cin &gt;&gt; x;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            Enque(x);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ch == 2) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            Deque();</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ch == 3) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            show();</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    } <span class="keywordflow">while</span> (ch != 0);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>}</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><b>queue_using_linked_list.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/db9/structcompare-members.html b/d8/db9/structcompare-members.html
index 3f067fe28..5b8b4d68a 100644
--- a/d8/db9/structcompare-members.html
+++ b/d8/db9/structcompare-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/db9/topological__sort_8cpp.html b/d8/db9/topological__sort_8cpp.html
index 6e55d31b2..6ab8e95cd 100644
--- a/d8/db9/topological__sort_8cpp.html
+++ b/d8/db9/topological__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph/topological_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: graph/topological_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -125,7 +142,9 @@ Include dependency graph for topological_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../de/da9/topological__sort_8cpp__incl.svg" width="530" height="111"><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">
+</div>
+<p><a href="../../d8/db9/topological__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">graph::topological_sort::Graph</a></td></tr>
@@ -143,10 +162,10 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:abcbcaa2bb70af0a11d0c090ea1796aea" id="r_abcbcaa2bb70af0a11d0c090ea1796aea"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abcbcaa2bb70af0a11d0c090ea1796aea">graph::topological_sort::dfs</a> (int v, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;visited, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; &amp;graph, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a>&lt; int &gt; &amp;s)</td></tr>
+<tr class="memitem:abcbcaa2bb70af0a11d0c090ea1796aea" id="r_abcbcaa2bb70af0a11d0c090ea1796aea"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abcbcaa2bb70af0a11d0c090ea1796aea">graph::topological_sort::dfs</a> (int v, std::vector&lt; int &gt; &amp;visited, const std::vector&lt; std::vector&lt; int &gt; &gt; &amp;graph, std::stack&lt; int &gt; &amp;s)</td></tr>
 <tr class="memdesc:abcbcaa2bb70af0a11d0c090ea1796aea"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to perform Depth First Search on the graph.  <br /></td></tr>
 <tr class="separator:abcbcaa2bb70af0a11d0c090ea1796aea"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a54dc5d7914958dbd24dda2fd862dc41b" id="r_a54dc5d7914958dbd24dda2fd862dc41b"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a54dc5d7914958dbd24dda2fd862dc41b">graph::topological_sort::topologicalSort</a> (const <a class="el" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">Graph</a> &amp;g)</td></tr>
+<tr class="memitem:a54dc5d7914958dbd24dda2fd862dc41b" id="r_a54dc5d7914958dbd24dda2fd862dc41b"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a54dc5d7914958dbd24dda2fd862dc41b">graph::topological_sort::topologicalSort</a> (const <a class="el" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">Graph</a> &amp;g)</td></tr>
 <tr class="memdesc:a54dc5d7914958dbd24dda2fd862dc41b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to get the topological sort of the graph.  <br /></td></tr>
 <tr class="separator:a54dc5d7914958dbd24dda2fd862dc41b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -160,6 +179,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Topological_sorting" target="_blank">Topological Sort Algorithm</a> </p>
 <p>Topological sorting of a directed graph is a linear ordering or its vertices such that for every directed edge (u,v) from vertex u to vertex v, u comes before v in the oredering.</p>
 <p>A topological sort is possible only in a directed acyclic graph (DAG). This file contains code of finding topological sort using Kahn's Algorithm which involves using Depth First Search technique </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html">topological_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="abcbcaa2bb70af0a11d0c090ea1796aea" name="abcbcaa2bb70af0a11d0c090ea1796aea"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#abcbcaa2bb70af0a11d0c090ea1796aea">&#9670;&#160;</a></span>dfs()</h2>
@@ -175,17 +196,17 @@ Functions</h2></td></tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>visited</em></span>, </td>
+          <td class="paramtype">std::vector&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>visited</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>graph</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; int &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>graph</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a>&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span>&#160;)</td>
+          <td class="paramtype">std::stack&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -200,6 +221,8 @@ Functions</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html#l00079">79</a> of file <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html">topological_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   80</span>                                                                   {</div>
 <div class="line"><span class="lineno">   81</span>    visited[v] = 1;</div>
 <div class="line"><span class="lineno">   82</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> neighbour : <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[v]) {</div>
@@ -207,17 +230,11 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   84</span>            <a class="code hl_function" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9">dfs</a>(neighbour, visited, <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, s);</div>
 <div class="line"><span class="lineno">   85</span>        }</div>
 <div class="line"><span class="lineno">   86</span>    }</div>
-<div class="line"><span class="lineno">   87</span>    s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(v);</div>
+<div class="line"><span class="lineno">   87</span>    s.push(v);</div>
 <div class="line"><span class="lineno">   88</span>}</div>
-<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a5738da9f508f6a9e87f123c9fb6f2ea9"><div class="ttname"><a href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9">graph::depth_first_search::dfs</a></div><div class="ttdeci">std::vector&lt; size_t &gt; dfs(const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;graph, size_t start)</div><div class="ttdoc">Explores the given vertex, exploring a vertex means traversing over all the vertices which are connec...</div><div class="ttdef"><b>Definition</b> depth_first_search_with_stack.cpp:87</div></div>
+<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a5738da9f508f6a9e87f123c9fb6f2ea9"><div class="ttname"><a href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9">graph::depth_first_search::dfs</a></div><div class="ttdeci">std::vector&lt; size_t &gt; dfs(const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;graph, size_t start)</div><div class="ttdoc">Explores the given vertex, exploring a vertex means traversing over all the vertices which are connec...</div><div class="ttdef"><b>Definition</b> <a href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00087">depth_first_search_with_stack.cpp:87</a></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 class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/push.html">std::stack::push</a></div><div class="ttdeci">T push(T... args)</div></div>
-</div><!-- 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="../../d8/db9/topological__sort_8cpp_abcbcaa2bb70af0a11d0c090ea1796aea_cgraph.svg" width="298" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -237,17 +254,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html#l00186">186</a> of file <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html">topological_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  186</span>           {</div>
 <div class="line"><span class="lineno">  187</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self test implementations</span></div>
 <div class="line"><span class="lineno">  188</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  189</span>}</div>
-<div class="ttc" id="atopological__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> topological_sort.cpp:126</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/db9/topological__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="555" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="atopological__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/db9/topological__sort_8cpp_source.html#l00126">topological_sort.cpp:126</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -275,9 +289,11 @@ Here is the call graph for this function:</div>
 
 <p>Self-test implementation. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html#l00126">126</a> of file <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html">topological_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  126</span>                   {</div>
 <div class="line"><span class="lineno">  127</span>    <span class="comment">// Test 1</span></div>
-<div class="line"><span class="lineno">  128</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testing for graph 1\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  128</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing for graph 1\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  129</span>    <span class="keywordtype">int</span> n_1 = 6;</div>
 <div class="line"><span class="lineno">  130</span>    <a class="code hl_class" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">graph::topological_sort::Graph</a> graph1(n_1);</div>
 <div class="line"><span class="lineno">  131</span>    graph1.addEdge(4, 0);</div>
@@ -286,18 +302,18 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  134</span>    graph1.addEdge(2, 3);</div>
 <div class="line"><span class="lineno">  135</span>    graph1.addEdge(3, 1);</div>
 <div class="line"><span class="lineno">  136</span>    graph1.addEdge(4, 1);</div>
-<div class="line"><span class="lineno">  137</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> ans_1 = <a class="code hl_function" href="#a54dc5d7914958dbd24dda2fd862dc41b">graph::topological_sort::topologicalSort</a>(graph1);</div>
-<div class="line"><span class="lineno">  138</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> expected_1 = {5, 4, 2, 3, 1, 0};</div>
-<div class="line"><span class="lineno">  139</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Topological Sorting Order: &quot;</span>;</div>
+<div class="line"><span class="lineno">  137</span>    std::vector&lt;int&gt; ans_1 = <a class="code hl_function" href="#a54dc5d7914958dbd24dda2fd862dc41b">graph::topological_sort::topologicalSort</a>(graph1);</div>
+<div class="line"><span class="lineno">  138</span>    std::vector&lt;int&gt; expected_1 = {5, 4, 2, 3, 1, 0};</div>
+<div class="line"><span class="lineno">  139</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Topological Sorting Order: &quot;</span>;</div>
 <div class="line"><span class="lineno">  140</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : ans_1) {</div>
-<div class="line"><span class="lineno">  141</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  141</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">  142</span>    }</div>
-<div class="line"><span class="lineno">  143</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><span class="lineno">  143</span>    std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
 <div class="line"><span class="lineno">  144</span>    assert(ans_1 == expected_1);</div>
-<div class="line"><span class="lineno">  145</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test Passed\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  145</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test Passed\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  146</span> </div>
 <div class="line"><span class="lineno">  147</span>    <span class="comment">// Test 2</span></div>
-<div class="line"><span class="lineno">  148</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testing for graph 2\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  148</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing for graph 2\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  149</span>    <span class="keywordtype">int</span> n_2 = 5;</div>
 <div class="line"><span class="lineno">  150</span>    <a class="code hl_class" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">graph::topological_sort::Graph</a> graph2(n_2);</div>
 <div class="line"><span class="lineno">  151</span>    graph2.addEdge(0, 1);</div>
@@ -306,18 +322,18 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  154</span>    graph2.addEdge(2, 3);</div>
 <div class="line"><span class="lineno">  155</span>    graph2.addEdge(1, 3);</div>
 <div class="line"><span class="lineno">  156</span>    graph2.addEdge(2, 4);</div>
-<div class="line"><span class="lineno">  157</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> ans_2 = <a class="code hl_function" href="#a54dc5d7914958dbd24dda2fd862dc41b">graph::topological_sort::topologicalSort</a>(graph2);</div>
-<div class="line"><span class="lineno">  158</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> expected_2 = {0, 1, 2, 4, 3};</div>
-<div class="line"><span class="lineno">  159</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Topological Sorting Order: &quot;</span>;</div>
+<div class="line"><span class="lineno">  157</span>    std::vector&lt;int&gt; ans_2 = <a class="code hl_function" href="#a54dc5d7914958dbd24dda2fd862dc41b">graph::topological_sort::topologicalSort</a>(graph2);</div>
+<div class="line"><span class="lineno">  158</span>    std::vector&lt;int&gt; expected_2 = {0, 1, 2, 4, 3};</div>
+<div class="line"><span class="lineno">  159</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Topological Sorting Order: &quot;</span>;</div>
 <div class="line"><span class="lineno">  160</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : ans_2) {</div>
-<div class="line"><span class="lineno">  161</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  161</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">  162</span>    }</div>
-<div class="line"><span class="lineno">  163</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><span class="lineno">  163</span>    std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
 <div class="line"><span class="lineno">  164</span>    assert(ans_2 == expected_2);</div>
-<div class="line"><span class="lineno">  165</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test Passed\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  165</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test Passed\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  166</span> </div>
 <div class="line"><span class="lineno">  167</span>    <span class="comment">// Test 3 - Graph with cycle</span></div>
-<div class="line"><span class="lineno">  168</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testing for graph 3\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  168</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing for graph 3\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  169</span>    <span class="keywordtype">int</span> n_3 = 3;</div>
 <div class="line"><span class="lineno">  170</span>    <a class="code hl_class" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">graph::topological_sort::Graph</a> graph3(n_3);</div>
 <div class="line"><span class="lineno">  171</span>    graph3.addEdge(0, 1);</div>
@@ -325,24 +341,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  173</span>    graph3.addEdge(2, 0);</div>
 <div class="line"><span class="lineno">  174</span>    <span class="keywordflow">try</span> {</div>
 <div class="line"><span class="lineno">  175</span>        <a class="code hl_function" href="#a54dc5d7914958dbd24dda2fd862dc41b">graph::topological_sort::topologicalSort</a>(graph3);</div>
-<div class="line"><span class="lineno">  176</span>    } <span class="keywordflow">catch</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>&amp; err) {</div>
-<div class="line"><span class="lineno">  177</span>        assert(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>(err.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/exception/what.html">what</a>()) == <span class="stringliteral">&quot;cycle detected in graph&quot;</span>);</div>
+<div class="line"><span class="lineno">  176</span>    } <span class="keywordflow">catch</span> (std::invalid_argument&amp; err) {</div>
+<div class="line"><span class="lineno">  177</span>        assert(std::string(err.what()) == <span class="stringliteral">&quot;cycle detected in graph&quot;</span>);</div>
 <div class="line"><span class="lineno">  178</span>    }</div>
-<div class="line"><span class="lineno">  179</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test Passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  179</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test Passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  180</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="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="aclassgraph_1_1topological__sort_1_1_graph_html"><div class="ttname"><a href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">graph::topological_sort::Graph</a></div><div class="ttdoc">Class that represents a directed graph and provides methods for manipulating the graph.</div><div class="ttdef"><b>Definition</b> topological_sort.cpp:38</div></div>
-<div class="ttc" id="ainvalid_argument_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></div></div>
-<div class="ttc" id="atopological__sort_8cpp_html_a54dc5d7914958dbd24dda2fd862dc41b"><div class="ttname"><a href="#a54dc5d7914958dbd24dda2fd862dc41b">graph::topological_sort::topologicalSort</a></div><div class="ttdeci">std::vector&lt; int &gt; topologicalSort(const Graph &amp;g)</div><div class="ttdoc">Function to get the topological sort of the graph.</div><div class="ttdef"><b>Definition</b> topological_sort.cpp:95</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 class="ttc" id="awhat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/exception/what.html">std::invalid_argument::what</a></div><div class="ttdeci">T what(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/db9/topological__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="458" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassgraph_1_1topological__sort_1_1_graph_html"><div class="ttname"><a href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">graph::topological_sort::Graph</a></div><div class="ttdoc">Class that represents a directed graph and provides methods for manipulating the graph.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/db9/topological__sort_8cpp_source.html#l00038">topological_sort.cpp:38</a></div></div>
+<div class="ttc" id="atopological__sort_8cpp_html_a54dc5d7914958dbd24dda2fd862dc41b"><div class="ttname"><a href="#a54dc5d7914958dbd24dda2fd862dc41b">graph::topological_sort::topologicalSort</a></div><div class="ttdeci">std::vector&lt; int &gt; topologicalSort(const Graph &amp;g)</div><div class="ttdoc">Function to get the topological sort of the graph.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/db9/topological__sort_8cpp_source.html#l00095">topological_sort.cpp:95</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a54dc5d7914958dbd24dda2fd862dc41b" name="a54dc5d7914958dbd24dda2fd862dc41b"></a>
@@ -352,7 +358,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; graph::topological_sort::topologicalSort </td>
+          <td class="memname">std::vector&lt; int &gt; graph::topological_sort::topologicalSort </td>
           <td>(</td>
           <td class="paramtype">const <a class="el" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">Graph</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>g</em></span></td><td>)</td>
           <td></td>
@@ -368,11 +374,13 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>A vector containing the topological order of nodes </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html#l00095">95</a> of file <a class="el" href="../../d8/db9/topological__sort_8cpp_source.html">topological_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   95</span>                                               {</div>
 <div class="line"><span class="lineno">   96</span>    <span class="keywordtype">int</span> n = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.getNumNodes();</div>
 <div class="line"><span class="lineno">   97</span>    <span class="keyword">const</span> <span class="keyword">auto</span>&amp; adj = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.getAdjacencyList();</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&lt;int&gt;</a> visited(n, 0);</div>
-<div class="line"><span class="lineno">   99</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;int&gt;</a> s;</div>
+<div class="line"><span class="lineno">   98</span>    std::vector&lt;int&gt; visited(n, 0);</div>
+<div class="line"><span class="lineno">   99</span>    std::stack&lt;int&gt; s;</div>
 <div class="line"><span class="lineno">  100</span> </div>
 <div class="line"><span class="lineno">  101</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
 <div class="line"><span class="lineno">  102</span>        <span class="keywordflow">if</span> (!visited[i]) {</div>
@@ -380,29 +388,20 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  104</span>        }</div>
 <div class="line"><span class="lineno">  105</span>    }</div>
 <div class="line"><span class="lineno">  106</span> </div>
-<div class="line"><span class="lineno">  107</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> ans;</div>
-<div class="line"><span class="lineno">  108</span>    <span class="keywordflow">while</span> (!s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>()) {</div>
-<div class="line"><span class="lineno">  109</span>        <span class="keywordtype">int</span> elem = s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
-<div class="line"><span class="lineno">  110</span>        s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
+<div class="line"><span class="lineno">  107</span>    std::vector&lt;int&gt; ans;</div>
+<div class="line"><span class="lineno">  108</span>    <span class="keywordflow">while</span> (!s.empty()) {</div>
+<div class="line"><span class="lineno">  109</span>        <span class="keywordtype">int</span> elem = s.top();</div>
+<div class="line"><span class="lineno">  110</span>        s.pop();</div>
 <div class="line"><span class="lineno">  111</span>        ans.push_back(elem);</div>
 <div class="line"><span class="lineno">  112</span>    }</div>
 <div class="line"><span class="lineno">  113</span> </div>
 <div class="line"><span class="lineno">  114</span>    <span class="keywordflow">if</span> (ans.size() &lt; n) {  <span class="comment">// Cycle detected</span></div>
-<div class="line"><span class="lineno">  115</span>        <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>(<span class="stringliteral">&quot;cycle detected in graph&quot;</span>);</div>
+<div class="line"><span class="lineno">  115</span>        <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;cycle detected in graph&quot;</span>);</div>
 <div class="line"><span class="lineno">  116</span>    }</div>
 <div class="line"><span class="lineno">  117</span>    <span class="keywordflow">return</span> ans;</div>
 <div class="line"><span class="lineno">  118</span>}</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:115</div></div>
-<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/empty.html">std::stack::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
-<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/pop.html">std::stack::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
-<div class="ttc" id="astack_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a></div></div>
-<div class="ttc" id="atop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/top.html">std::stack::top</a></div><div class="ttdeci">T top(T... args)</div></div>
-</div><!-- 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="../../d8/db9/topological__sort_8cpp_a54dc5d7914958dbd24dda2fd862dc41b_cgraph.svg" width="327" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00115">composite_simpson_rule.cpp:115</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d8/db9/topological__sort_8cpp_a54dc5d7914958dbd24dda2fd862dc41b_cgraph.map b/d8/db9/topological__sort_8cpp_a54dc5d7914958dbd24dda2fd862dc41b_cgraph.map
deleted file mode 100644
index 43d3289f1..000000000
--- a/d8/db9/topological__sort_8cpp_a54dc5d7914958dbd24dda2fd862dc41b_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="graph::topological_sort::topologicalSort" name="graph::topological_sort::topologicalSort">
-<area shape="rect" id="Node000001" title="Function to get the topological sort of the graph." alt="" coords="5,47,150,88"/>
-<area shape="poly" id="edge4_Node000001_Node000001" title=" " alt="" coords="43,47,41,37,47,28,59,23,78,21,97,23,109,29,107,34,96,28,77,26,60,28,50,32,46,38,48,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/stack/empty.html#" title=" " alt="" coords="198,5,321,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="149,45,194,33,196,38,151,50"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/stack/pop.html#" title=" " alt="" coords="205,55,314,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="150,65,189,65,189,70,150,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/stack/top.html#" title=" " alt="" coords="207,104,312,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="151,85,196,97,194,102,149,90"/>
-</map>
diff --git a/d8/db9/topological__sort_8cpp_a54dc5d7914958dbd24dda2fd862dc41b_cgraph.md5 b/d8/db9/topological__sort_8cpp_a54dc5d7914958dbd24dda2fd862dc41b_cgraph.md5
deleted file mode 100644
index fd0fa3fc5..000000000
--- a/d8/db9/topological__sort_8cpp_a54dc5d7914958dbd24dda2fd862dc41b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-24301cf49b8e2366b08e2093da497fa4
\ No newline at end of file
diff --git a/d8/db9/topological__sort_8cpp_a54dc5d7914958dbd24dda2fd862dc41b_cgraph.svg b/d8/db9/topological__sort_8cpp_a54dc5d7914958dbd24dda2fd862dc41b_cgraph.svg
deleted file mode 100644
index d063d3deb..000000000
--- a/d8/db9/topological__sort_8cpp_a54dc5d7914958dbd24dda2fd862dc41b_cgraph.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::topological_sort::topologicalSort Pages: 1 -->
-<svg width="245pt" height="101pt"
- viewBox="0.00 0.00 244.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>graph::topological_sort::topologicalSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to get the topological sort of the graph.">
-<polygon fill="#999999" stroke="#666666" points="108.25,-61.88 0,-61.88 0,-31.38 108.25,-31.38 108.25,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::topological</text>
-<text text-anchor="middle" x="54.12" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">_sort::topologicalSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.96,-62.36C25.03,-71.43 33.08,-79.88 54.12,-79.88 65.63,-79.88 73.26,-77.35 77,-73.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.45,-74.2 78.12,-63.86 73.49,-73.4 80.45,-74.2"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-93.25 144.25,-93.25 144.25,-74 236.75,-74 236.75,-93.25"/>
-<text text-anchor="middle" x="190.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.62,-61.35C119.7,-64.41 131.3,-67.6 142.14,-70.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.09,-73.92 151.66,-73.21 142.95,-67.18 141.09,-73.92"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.12,-56.25 149.88,-56.25 149.88,-37 231.12,-37 231.12,-56.25"/>
-<text text-anchor="middle" x="190.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.62,-46.62C118.3,-46.62 128.37,-46.62 137.99,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.93,-50.13 147.93,-46.63 137.93,-43.13 137.93,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/top.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="230,-19.25 151,-19.25 151,0 230,0 230,-19.25"/>
-<text text-anchor="middle" x="190.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.62,-31.9C119.7,-28.84 131.3,-25.65 142.14,-22.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.95,-26.07 151.66,-20.04 141.09,-19.33 142.95,-26.07"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/db9/topological__sort_8cpp_a54dc5d7914958dbd24dda2fd862dc41b_cgraph_org.svg b/d8/db9/topological__sort_8cpp_a54dc5d7914958dbd24dda2fd862dc41b_cgraph_org.svg
deleted file mode 100644
index 1c2c2259f..000000000
--- a/d8/db9/topological__sort_8cpp_a54dc5d7914958dbd24dda2fd862dc41b_cgraph_org.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::topological_sort::topologicalSort Pages: 1 -->
-<svg width="245pt" height="101pt"
- viewBox="0.00 0.00 244.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>graph::topological_sort::topologicalSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to get the topological sort of the graph.">
-<polygon fill="#999999" stroke="#666666" points="108.25,-61.88 0,-61.88 0,-31.38 108.25,-31.38 108.25,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::topological</text>
-<text text-anchor="middle" x="54.12" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">_sort::topologicalSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.96,-62.36C25.03,-71.43 33.08,-79.88 54.12,-79.88 65.63,-79.88 73.26,-77.35 77,-73.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.45,-74.2 78.12,-63.86 73.49,-73.4 80.45,-74.2"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-93.25 144.25,-93.25 144.25,-74 236.75,-74 236.75,-93.25"/>
-<text text-anchor="middle" x="190.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.62,-61.35C119.7,-64.41 131.3,-67.6 142.14,-70.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.09,-73.92 151.66,-73.21 142.95,-67.18 141.09,-73.92"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.12,-56.25 149.88,-56.25 149.88,-37 231.12,-37 231.12,-56.25"/>
-<text text-anchor="middle" x="190.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.62,-46.62C118.3,-46.62 128.37,-46.62 137.99,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.93,-50.13 147.93,-46.63 137.93,-43.13 137.93,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/top.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="230,-19.25 151,-19.25 151,0 230,0 230,-19.25"/>
-<text text-anchor="middle" x="190.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.62,-31.9C119.7,-28.84 131.3,-25.65 142.14,-22.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.95,-26.07 151.66,-20.04 141.09,-19.33 142.95,-26.07"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/db9/topological__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/db9/topological__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index f69c51e7a..000000000
--- a/d8/db9/topological__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementation." alt="" coords="5,46,49,72"/>
-<area shape="rect" id="Node000002" href="$d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345" title="Function that adds an edge between two nodes or vertices of graph." alt="" coords="97,5,249,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,52,81,44,82,49,49,57"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/error/exception/what.html#" title=" " alt="" coords="100,71,246,111"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,61,86,69,85,74,48,66"/>
-<area shape="rect" id="Node000003" 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="297,13,451,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="249,23,282,23,282,28,249,28"/>
-</map>
diff --git a/d8/db9/topological__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/db9/topological__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index e5b1fffdc..000000000
--- a/d8/db9/topological__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f140bb29072388bd284df714025255c3
\ No newline at end of file
diff --git a/d8/db9/topological__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/db9/topological__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 942a8af00..000000000
--- a/d8/db9/topological__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="343pt" height="88pt"
- viewBox="0.00 0.00 342.50 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementation.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-48.88 0,-48.88 0,-29.62 32.5,-29.62 32.5,-48.88"/>
-<text text-anchor="middle" x="16.25" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345" target="_top" xlink:title="Function that adds an edge between two nodes or vertices of graph.">
-<polygon fill="white" stroke="#666666" points="182.75,-79.5 68.5,-79.5 68.5,-49 182.75,-49 182.75,-79.5"/>
-<text text-anchor="start" x="76.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">graph::topological</text>
-<text text-anchor="middle" x="125.62" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sort::Graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.63,-42.83C39.4,-44.41 47.85,-46.37 56.87,-48.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.08,-51.88 66.61,-50.74 57.66,-45.07 56.08,-51.88"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="180.12,-30.5 71.12,-30.5 71.12,0 180.12,0 180.12,-30.5"/>
-<text text-anchor="start" x="79.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::invalid_argument</text>
-<text text-anchor="middle" x="125.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::what</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.63,-35.81C40.13,-34.14 49.7,-32 59.83,-29.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.48,-33.17 69.48,-27.58 58.96,-26.34 60.48,-33.17"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="334.5,-73.88 218.75,-73.88 218.75,-54.62 334.5,-54.62 334.5,-73.88"/>
-<text text-anchor="middle" x="276.62" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.96,-64.25C190.91,-64.25 199.16,-64.25 207.31,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="207.21,-67.75 217.21,-64.25 207.21,-60.75 207.21,-67.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/db9/topological__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d8/db9/topological__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index a7299442c..000000000
--- a/d8/db9/topological__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="343pt" height="88pt"
- viewBox="0.00 0.00 342.50 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementation.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-48.88 0,-48.88 0,-29.62 32.5,-29.62 32.5,-48.88"/>
-<text text-anchor="middle" x="16.25" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345" target="_top" xlink:title="Function that adds an edge between two nodes or vertices of graph.">
-<polygon fill="white" stroke="#666666" points="182.75,-79.5 68.5,-79.5 68.5,-49 182.75,-49 182.75,-79.5"/>
-<text text-anchor="start" x="76.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">graph::topological</text>
-<text text-anchor="middle" x="125.62" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sort::Graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.63,-42.83C39.4,-44.41 47.85,-46.37 56.87,-48.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.08,-51.88 66.61,-50.74 57.66,-45.07 56.08,-51.88"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="180.12,-30.5 71.12,-30.5 71.12,0 180.12,0 180.12,-30.5"/>
-<text text-anchor="start" x="79.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::invalid_argument</text>
-<text text-anchor="middle" x="125.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::what</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.63,-35.81C40.13,-34.14 49.7,-32 59.83,-29.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.48,-33.17 69.48,-27.58 58.96,-26.34 60.48,-33.17"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="334.5,-73.88 218.75,-73.88 218.75,-54.62 334.5,-54.62 334.5,-73.88"/>
-<text text-anchor="middle" x="276.62" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.96,-64.25C190.91,-64.25 199.16,-64.25 207.31,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="207.21,-67.75 217.21,-64.25 207.21,-60.75 207.21,-67.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/db9/topological__sort_8cpp_abcbcaa2bb70af0a11d0c090ea1796aea_cgraph.map b/d8/db9/topological__sort_8cpp_abcbcaa2bb70af0a11d0c090ea1796aea_cgraph.map
deleted file mode 100644
index d24be3787..000000000
--- a/d8/db9/topological__sort_8cpp_abcbcaa2bb70af0a11d0c090ea1796aea_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="graph::topological_sort::dfs" name="graph::topological_sort::dfs">
-<area shape="rect" id="Node000001" title="Function to perform Depth First Search on the graph." alt="" coords="5,5,129,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/stack/push.html#" title=" " alt="" coords="177,13,292,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="129,23,161,23,161,28,129,28"/>
-</map>
diff --git a/d8/db9/topological__sort_8cpp_abcbcaa2bb70af0a11d0c090ea1796aea_cgraph.md5 b/d8/db9/topological__sort_8cpp_abcbcaa2bb70af0a11d0c090ea1796aea_cgraph.md5
deleted file mode 100644
index dd33f8f26..000000000
--- a/d8/db9/topological__sort_8cpp_abcbcaa2bb70af0a11d0c090ea1796aea_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cc93c261f53b1ac9b0c3d837e99862f0
\ No newline at end of file
diff --git a/d8/db9/topological__sort_8cpp_abcbcaa2bb70af0a11d0c090ea1796aea_cgraph.svg b/d8/db9/topological__sort_8cpp_abcbcaa2bb70af0a11d0c090ea1796aea_cgraph.svg
deleted file mode 100644
index e97284538..000000000
--- a/d8/db9/topological__sort_8cpp_abcbcaa2bb70af0a11d0c090ea1796aea_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::topological_sort::dfs Pages: 1 -->
-<svg width="223pt" height="39pt"
- viewBox="0.00 0.00 223.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>graph::topological_sort::dfs</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to perform Depth First Search on the graph.">
-<polygon fill="#999999" stroke="#666666" points="92.5,-30.5 0,-30.5 0,0 92.5,0 92.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::topological</text>
-<text text-anchor="middle" x="46.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sort::dfs</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215,-24.88 128.5,-24.88 128.5,-5.63 215,-5.63 215,-24.88"/>
-<text text-anchor="middle" x="171.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.89,-15.25C100.64,-15.25 108.76,-15.25 116.71,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="116.65,-18.75 126.65,-15.25 116.65,-11.75 116.65,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/db9/topological__sort_8cpp_abcbcaa2bb70af0a11d0c090ea1796aea_cgraph_org.svg b/d8/db9/topological__sort_8cpp_abcbcaa2bb70af0a11d0c090ea1796aea_cgraph_org.svg
deleted file mode 100644
index 61b366fbe..000000000
--- a/d8/db9/topological__sort_8cpp_abcbcaa2bb70af0a11d0c090ea1796aea_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::topological_sort::dfs Pages: 1 -->
-<svg width="223pt" height="39pt"
- viewBox="0.00 0.00 223.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>graph::topological_sort::dfs</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to perform Depth First Search on the graph.">
-<polygon fill="#999999" stroke="#666666" points="92.5,-30.5 0,-30.5 0,0 92.5,0 92.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::topological</text>
-<text text-anchor="middle" x="46.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sort::dfs</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/stack/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215,-24.88 128.5,-24.88 128.5,-5.63 215,-5.63 215,-24.88"/>
-<text text-anchor="middle" x="171.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.89,-15.25C100.64,-15.25 108.76,-15.25 116.71,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="116.65,-18.75 126.65,-15.25 116.65,-11.75 116.65,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/db9/topological__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/db9/topological__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 4b81e0a30..000000000
--- a/d8/db9/topological__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,46,55,72"/>
-<area shape="rect" id="Node000002" href="$d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementation." alt="" coords="103,46,146,72"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,56,87,56,87,62,55,62"/>
-<area shape="rect" id="Node000003" href="$d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345" title="Function that adds an edge between two nodes or vertices of graph." alt="" coords="194,5,346,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,52,178,44,179,49,147,57"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/error/exception/what.html#" title=" " alt="" coords="198,71,343,111"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="147,61,183,69,182,74,146,66"/>
-<area shape="rect" id="Node000004" 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="394,13,549,38"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="347,23,379,23,379,28,347,28"/>
-</map>
diff --git a/d8/db9/topological__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/db9/topological__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index eb28a2150..000000000
--- a/d8/db9/topological__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8460728898871e1e4e3eda289d593379
\ No newline at end of file
diff --git a/d8/db9/topological__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/db9/topological__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 428de6d5b..000000000
--- a/d8/db9/topological__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,121 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="416pt" height="88pt"
- viewBox="0.00 0.00 415.50 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-48.88 0,-48.88 0,-29.62 37,-29.62 37,-48.88"/>
-<text text-anchor="middle" x="18.5" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementation.">
-<polygon fill="white" stroke="#666666" points="105.5,-48.88 73,-48.88 73,-29.62 105.5,-29.62 105.5,-48.88"/>
-<text text-anchor="middle" x="89.25" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-39.25C44.58,-39.25 53.31,-39.25 61.45,-39.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-42.75 71.2,-39.25 61.2,-35.75 61.2,-42.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345" target="_top" xlink:title="Function that adds an edge between two nodes or vertices of graph.">
-<polygon fill="white" stroke="#666666" points="255.75,-79.5 141.5,-79.5 141.5,-49 255.75,-49 255.75,-79.5"/>
-<text text-anchor="start" x="149.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">graph::topological</text>
-<text text-anchor="middle" x="198.62" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sort::Graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.63,-42.83C112.4,-44.41 120.85,-46.37 129.87,-48.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.08,-51.88 139.61,-50.74 130.66,-45.07 129.08,-51.88"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.12,-30.5 144.12,-30.5 144.12,0 253.12,0 253.12,-30.5"/>
-<text text-anchor="start" x="152.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::invalid_argument</text>
-<text text-anchor="middle" x="198.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::what</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.63,-35.81C113.13,-34.14 122.7,-32 132.83,-29.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.48,-33.17 142.48,-27.58 131.96,-26.34 133.48,-33.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="407.5,-73.88 291.75,-73.88 291.75,-54.62 407.5,-54.62 407.5,-73.88"/>
-<text text-anchor="middle" x="349.62" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.96,-64.25C263.91,-64.25 272.16,-64.25 280.31,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="280.21,-67.75 290.21,-64.25 280.21,-60.75 280.21,-67.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/db9/topological__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/db9/topological__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index ce07057cf..000000000
--- a/d8/db9/topological__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,95 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="416pt" height="88pt"
- viewBox="0.00 0.00 415.50 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-48.88 0,-48.88 0,-29.62 37,-29.62 37,-48.88"/>
-<text text-anchor="middle" x="18.5" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementation.">
-<polygon fill="white" stroke="#666666" points="105.5,-48.88 73,-48.88 73,-29.62 105.5,-29.62 105.5,-48.88"/>
-<text text-anchor="middle" x="89.25" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-39.25C44.58,-39.25 53.31,-39.25 61.45,-39.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-42.75 71.2,-39.25 61.2,-35.75 61.2,-42.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345" target="_top" xlink:title="Function that adds an edge between two nodes or vertices of graph.">
-<polygon fill="white" stroke="#666666" points="255.75,-79.5 141.5,-79.5 141.5,-49 255.75,-49 255.75,-79.5"/>
-<text text-anchor="start" x="149.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">graph::topological</text>
-<text text-anchor="middle" x="198.62" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sort::Graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.63,-42.83C112.4,-44.41 120.85,-46.37 129.87,-48.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.08,-51.88 139.61,-50.74 130.66,-45.07 129.08,-51.88"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.12,-30.5 144.12,-30.5 144.12,0 253.12,0 253.12,-30.5"/>
-<text text-anchor="start" x="152.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::invalid_argument</text>
-<text text-anchor="middle" x="198.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::what</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.63,-35.81C113.13,-34.14 122.7,-32 132.83,-29.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.48,-33.17 142.48,-27.58 131.96,-26.34 133.48,-33.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="407.5,-73.88 291.75,-73.88 291.75,-54.62 407.5,-54.62 407.5,-73.88"/>
-<text text-anchor="middle" x="349.62" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.96,-64.25C263.91,-64.25 272.16,-64.25 280.31,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="280.21,-67.75 290.21,-64.25 280.21,-60.75 280.21,-67.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/db9/topological__sort_8cpp_source.html b/d8/db9/topological__sort_8cpp_source.html
new file mode 100644
index 000000000..34a8e8ee5
--- /dev/null
+++ b/d8/db9/topological__sort_8cpp_source.html
@@ -0,0 +1,285 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/topological_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/db9/topological__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">topological_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/db9/topological__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  <span class="comment">// For std::reverse</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cassert&gt;</span>    <span class="comment">// For assert</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;iostream&gt;</span>   <span class="comment">// For IO operations</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;stack&gt;</span>      <span class="comment">// For std::stack</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;stdexcept&gt;</span>  <span class="comment">// For std::invalid_argument</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;vector&gt;</span>     <span class="comment">// For std::vector</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d76/namespacetopological__sort.html">topological_sort</a> {</div>
+<div class="foldopen" id="foldopen00038" data-start="{" data-end="};">
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">   38</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">Graph</a> {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordtype">int</span> n;                              <span class="comment">// Number of nodes</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    std::vector&lt;std::vector&lt;int&gt;&gt; adj;  <span class="comment">// Adjacency list representation</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a75a849f80a66304e7da39b3ccd6129d6">   48</a></span>    <a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a75a849f80a66304e7da39b3ccd6129d6">Graph</a>(<span class="keywordtype">int</span> nodes) : n(nodes), adj(nodes) {}</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">   55</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(<span class="keywordtype">int</span> u, <span class="keywordtype">int</span> v) { adj[u].push_back(v); }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="foldopen" id="foldopen00061" data-start="{" data-end="}">
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"><a class="line" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a5e84b175ef768ff58eaeededd43e8368">   61</a></span>    <span class="keyword">const</span> std::vector&lt;std::vector&lt;int&gt;&gt;&amp; <a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a5e84b175ef768ff58eaeededd43e8368">getAdjacencyList</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordflow">return</span> adj;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    }</div>
+</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#ad22018e4f4f80aecb0538044bb83d096">   69</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#ad22018e4f4f80aecb0538044bb83d096">getNumNodes</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> n; }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>};</div>
+</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="foldopen" id="foldopen00079" data-start="{" data-end="}">
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="../../d8/db9/topological__sort_8cpp.html#abcbcaa2bb70af0a11d0c090ea1796aea">   79</a></span><span class="keywordtype">void</span> dfs(<span class="keywordtype">int</span> v, std::vector&lt;int&gt;&amp; visited,</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>         <span class="keyword">const</span> std::vector&lt;std::vector&lt;int&gt;&gt;&amp; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, std::stack&lt;int&gt;&amp; s) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    visited[v] = 1;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> neighbour : <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[v]) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordflow">if</span> (!visited[neighbour]) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            dfs(neighbour, visited, <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, s);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        }</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    }</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    s.push(v);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>}</div>
+</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="foldopen" id="foldopen00095" data-start="{" data-end="}">
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="../../d8/db9/topological__sort_8cpp.html#a54dc5d7914958dbd24dda2fd862dc41b">   95</a></span>std::vector&lt;int&gt; <a class="code hl_function" href="../../d8/db9/topological__sort_8cpp.html#a54dc5d7914958dbd24dda2fd862dc41b">topologicalSort</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">Graph</a>&amp; g) {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="keywordtype">int</span> n = g.getNumNodes();</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="keyword">const</span> <span class="keyword">auto</span>&amp; adj = g.getAdjacencyList();</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    std::vector&lt;int&gt; visited(n, 0);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    std::stack&lt;int&gt; s;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        <span class="keywordflow">if</span> (!visited[i]) {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>            dfs(i, visited, adj, s);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        }</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    }</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    std::vector&lt;int&gt; ans;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="keywordflow">while</span> (!s.empty()) {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        <span class="keywordtype">int</span> elem = s.top();</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        s.pop();</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        ans.push_back(elem);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    }</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="keywordflow">if</span> (ans.size() &lt; n) {  <span class="comment">// Cycle detected</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;cycle detected in graph&quot;</span>);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    }</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="keywordflow">return</span> ans;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>}</div>
+</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>}  <span class="comment">// namespace topological_sort</span></div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>}  <span class="comment">// namespace graph</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span> </div>
+<div class="foldopen" id="foldopen00126" data-start="{" data-end="}">
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"><a class="line" href="../../d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  126</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    <span class="comment">// Test 1</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing for graph 1\n&quot;</span>;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    <span class="keywordtype">int</span> n_1 = 6;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <a class="code hl_class" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">graph::topological_sort::Graph</a> graph1(n_1);</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    graph1.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(4, 0);</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    graph1.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(5, 0);</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    graph1.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(5, 2);</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    graph1.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(2, 3);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    graph1.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(3, 1);</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    graph1.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(4, 1);</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    std::vector&lt;int&gt; ans_1 = graph::topological_sort::topologicalSort(graph1);</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    std::vector&lt;int&gt; expected_1 = {5, 4, 2, 3, 1, 0};</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Topological Sorting Order: &quot;</span>;</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : ans_1) {</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    }</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    assert(ans_1 == expected_1);</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test Passed\n\n&quot;</span>;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span> </div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    <span class="comment">// Test 2</span></div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing for graph 2\n&quot;</span>;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    <span class="keywordtype">int</span> n_2 = 5;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    <a class="code hl_class" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">graph::topological_sort::Graph</a> graph2(n_2);</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    graph2.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(0, 1);</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    graph2.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(0, 2);</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    graph2.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(1, 2);</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    graph2.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(2, 3);</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    graph2.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(1, 3);</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    graph2.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(2, 4);</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    std::vector&lt;int&gt; ans_2 = graph::topological_sort::topologicalSort(graph2);</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    std::vector&lt;int&gt; expected_2 = {0, 1, 2, 4, 3};</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Topological Sorting Order: &quot;</span>;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : ans_2) {</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    }</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    assert(ans_2 == expected_2);</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test Passed\n\n&quot;</span>;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span> </div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    <span class="comment">// Test 3 - Graph with cycle</span></div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing for graph 3\n&quot;</span>;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    <span class="keywordtype">int</span> n_3 = 3;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    <a class="code hl_class" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">graph::topological_sort::Graph</a> graph3(n_3);</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    graph3.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(0, 1);</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    graph3.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(1, 2);</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    graph3.<a class="code hl_function" href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">addEdge</a>(2, 0);</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    <span class="keywordflow">try</span> {</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        graph::topological_sort::topologicalSort(graph3);</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    } <span class="keywordflow">catch</span> (std::invalid_argument&amp; err) {</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        assert(std::string(err.what()) == <span class="stringliteral">&quot;cycle detected in graph&quot;</span>);</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    }</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test Passed\n&quot;</span>;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>}</div>
+</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span> </div>
+<div class="foldopen" id="foldopen00186" data-start="{" data-end="}">
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"><a class="line" href="../../d8/db9/topological__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  186</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/db9/topological__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    <a class="code hl_function" href="../../d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self test implementations</span></div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>}</div>
+</div>
+<div class="ttc" id="aclassgraph_1_1topological__sort_1_1_graph_html"><div class="ttname"><a href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html">graph::topological_sort::Graph</a></div><div class="ttdoc">Class that represents a directed graph and provides methods for manipulating the graph.</div><div class="ttdef"><b>Definition</b> <a href="#l00038">topological_sort.cpp:38</a></div></div>
+<div class="ttc" id="aclassgraph_1_1topological__sort_1_1_graph_html_a57036210706a45b9363563252393a345"><div class="ttname"><a href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345">graph::topological_sort::Graph::addEdge</a></div><div class="ttdeci">void addEdge(int u, int v)</div><div class="ttdoc">Function that adds an edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition</b> <a href="#l00055">topological_sort.cpp:55</a></div></div>
+<div class="ttc" id="aclassgraph_1_1topological__sort_1_1_graph_html_a5e84b175ef768ff58eaeededd43e8368"><div class="ttname"><a href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a5e84b175ef768ff58eaeededd43e8368">graph::topological_sort::Graph::getAdjacencyList</a></div><div class="ttdeci">const std::vector&lt; std::vector&lt; int &gt; &gt; &amp; getAdjacencyList() const</div><div class="ttdoc">Get the adjacency list of the graph.</div><div class="ttdef"><b>Definition</b> <a href="#l00061">topological_sort.cpp:61</a></div></div>
+<div class="ttc" id="aclassgraph_1_1topological__sort_1_1_graph_html_a75a849f80a66304e7da39b3ccd6129d6"><div class="ttname"><a href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a75a849f80a66304e7da39b3ccd6129d6">graph::topological_sort::Graph::Graph</a></div><div class="ttdeci">Graph(int nodes)</div><div class="ttdoc">Constructor for the Graph class.</div><div class="ttdef"><b>Definition</b> <a href="#l00048">topological_sort.cpp:48</a></div></div>
+<div class="ttc" id="aclassgraph_1_1topological__sort_1_1_graph_html_ad22018e4f4f80aecb0538044bb83d096"><div class="ttname"><a href="../../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#ad22018e4f4f80aecb0538044bb83d096">graph::topological_sort::Graph::getNumNodes</a></div><div class="ttdeci">int getNumNodes() const</div><div class="ttdoc">Get the number of nodes in the graph.</div><div class="ttdef"><b>Definition</b> <a href="#l00069">topological_sort.cpp:69</a></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 class="ttc" id="anamespacetopological__sort_html"><div class="ttname"><a href="../../d8/d76/namespacetopological__sort.html">topological_sort</a></div><div class="ttdoc">Topological Sort Algorithm.</div></div>
+<div class="ttc" id="atopological__sort_8cpp_html_a54dc5d7914958dbd24dda2fd862dc41b"><div class="ttname"><a href="../../d8/db9/topological__sort_8cpp.html#a54dc5d7914958dbd24dda2fd862dc41b">graph::topological_sort::topologicalSort</a></div><div class="ttdeci">std::vector&lt; int &gt; topologicalSort(const Graph &amp;g)</div><div class="ttdoc">Function to get the topological sort of the graph.</div><div class="ttdef"><b>Definition</b> <a href="#l00095">topological_sort.cpp:95</a></div></div>
+<div class="ttc" id="atopological__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> <a href="#l00126">topological_sort.cpp:126</a></div></div>
+<div class="ttc" id="atopological__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/db9/topological__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00186">topological_sort.cpp:186</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a class="el" href="../../d8/db9/topological__sort_8cpp.html">topological_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/dba/classdata__structures_1_1queue__using__array_1_1_queue___array-members.html b/d8/dba/classdata__structures_1_1queue__using__array_1_1_queue___array-members.html
index e5a1eccbf..0eff9b3a2 100644
--- a/d8/dba/classdata__structures_1_1queue__using__array_1_1_queue___array-members.html
+++ b/d8/dba/classdata__structures_1_1queue__using__array_1_1_queue___array-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/dc6/namespacemanacher.html b/d8/dc6/namespacemanacher.html
index 181a02bb4..6002fc6e0 100644
--- a/d8/dc6/namespacemanacher.html
+++ b/d8/dc6/namespacemanacher.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: manacher Namespace Reference</title>
+<title>TheAlgorithms/C++: manacher Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/dc8/class_compare-members.html b/d8/dc8/class_compare-members.html
index ae7a7ad10..34728ea05 100644
--- a/d8/dc8/class_compare-members.html
+++ b/d8/dc8/class_compare-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/dc8/struct_point.html b/d8/dc8/struct_point.html
index b97f9beb8..9c2c714fb 100644
--- a/d8/dc8/struct_point.html
+++ b/d8/dc8/struct_point.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Point Struct Reference</title>
+<title>TheAlgorithms/C++: Point Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,12 +136,10 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a8c779e11e694b20e0946105a9f5de842" id="r_a8c779e11e694b20e0946105a9f5de842"><td class="memItemLeft" align="right" valign="top"><a id="a8c779e11e694b20e0946105a9f5de842" name="a8c779e11e694b20e0946105a9f5de842"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>x</b></td></tr>
+<tr class="memitem:a8c779e11e694b20e0946105a9f5de842" id="r_a8c779e11e694b20e0946105a9f5de842"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8c779e11e694b20e0946105a9f5de842">x</a></td></tr>
 <tr class="separator:a8c779e11e694b20e0946105a9f5de842"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2e1b5fb2b2a83571f5c0bc0f66a73cf7" id="r_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><td class="memItemLeft" align="right" valign="top"><a id="a2e1b5fb2b2a83571f5c0bc0f66a73cf7" name="a2e1b5fb2b2a83571f5c0bc0f66a73cf7"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>y</b></td></tr>
-<tr class="memdesc:a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../d8/dc8/struct_point.html">Point</a> respect to x coordinate. <br /></td></tr>
+<tr class="memitem:a2e1b5fb2b2a83571f5c0bc0f66a73cf7" id="r_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a></td></tr>
+<tr class="memdesc:a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../d8/dc8/struct_point.html">Point</a> respect to x coordinate.  <br /></td></tr>
 <tr class="separator:a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ab99c56589bc8ad5fa5071387110a5bc7" id="r_ab99c56589bc8ad5fa5071387110a5bc7"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab99c56589bc8ad5fa5071387110a5bc7">x</a></td></tr>
 <tr class="separator:ab99c56589bc8ad5fa5071387110a5bc7"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -134,6 +149,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>y</b></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Define a <a class="el" href="../../d8/dc8/struct_point.html">Point</a>.</p>
 <p>Define a point </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00012">12</a> of file <a class="el" href="../../d8/d6c/line__segment__intersection_8cpp_source.html">line_segment_intersection.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="ae2d6fb1b3fd3a96169d963d62e37130a" name="ae2d6fb1b3fd3a96169d963d62e37130a"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae2d6fb1b3fd3a96169d963d62e37130a">&#9670;&#160;</a></span>Point()</h2>
@@ -168,17 +185,35 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>y</b></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html#l00023">23</a> of file <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html">smallest_circle.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   23</span>                                                   {</div>
 <div class="line"><span class="lineno">   24</span>        x = a;</div>
 <div class="line"><span class="lineno">   25</span>        <a class="code hl_variable" href="#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> = b;</div>
 <div class="line"><span class="lineno">   26</span>    }</div>
-<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:14</div></div>
+<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00014">line_segment_intersection.cpp:14</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
+<a id="a8c779e11e694b20e0946105a9f5de842" name="a8c779e11e694b20e0946105a9f5de842"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a8c779e11e694b20e0946105a9f5de842">&#9670;&#160;</a></span>x <span class="overload">[1/2]</span></h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int Point::x</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00013">13</a> of file <a class="el" href="../../d8/d6c/line__segment__intersection_8cpp_source.html">line_segment_intersection.cpp</a>.</p>
+
+</div>
+</div>
 <a id="ab99c56589bc8ad5fa5071387110a5bc7" name="ab99c56589bc8ad5fa5071387110a5bc7"></a>
-<h2 class="memtitle"><span class="permalink"><a href="#ab99c56589bc8ad5fa5071387110a5bc7">&#9670;&#160;</a></span>x</h2>
+<h2 class="memtitle"><span class="permalink"><a href="#ab99c56589bc8ad5fa5071387110a5bc7">&#9670;&#160;</a></span>x <span class="overload">[2/2]</span></h2>
 
 <div class="memitem">
 <div class="memproto">
@@ -190,10 +225,30 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>y</b></td></tr>
 </div><div class="memdoc">
 <p>abscissa </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html#l00016">16</a> of file <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html">smallest_circle.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a2e1b5fb2b2a83571f5c0bc0f66a73cf7" name="a2e1b5fb2b2a83571f5c0bc0f66a73cf7"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">&#9670;&#160;</a></span>y <span class="overload">[1/2]</span></h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int Point::y</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p><a class="el" href="../../d8/dc8/struct_point.html">Point</a> respect to x coordinate. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00014">14</a> of file <a class="el" href="../../d8/d6c/line__segment__intersection_8cpp_source.html">line_segment_intersection.cpp</a>.</p>
+
 </div>
 </div>
 <a id="afa38be143ae800e6ad69ce8ed4df62d8" name="afa38be143ae800e6ad69ce8ed4df62d8"></a>
-<h2 class="memtitle"><span class="permalink"><a href="#afa38be143ae800e6ad69ce8ed4df62d8">&#9670;&#160;</a></span>y</h2>
+<h2 class="memtitle"><span class="permalink"><a href="#afa38be143ae800e6ad69ce8ed4df62d8">&#9670;&#160;</a></span>y <span class="overload">[2/2]</span></h2>
 
 <div class="memitem">
 <div class="memproto">
@@ -205,11 +260,13 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>y</b></td></tr>
 </div><div class="memdoc">
 <p>ordinate </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html#l00017">17</a> of file <a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html">smallest_circle.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following files:<ul>
-<li>geometry/<a class="el" href="../../d8/d6c/line__segment__intersection_8cpp.html">line_segment_intersection.cpp</a></li>
-<li>others/<a class="el" href="../../d0/d01/smallest__circle_8cpp.html">smallest_circle.cpp</a></li>
+<li>geometry/<a class="el" href="../../d8/d6c/line__segment__intersection_8cpp_source.html">line_segment_intersection.cpp</a></li>
+<li>others/<a class="el" href="../../d0/d01/smallest__circle_8cpp_source.html">smallest_circle.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d8/dcc/binary__insertion__sort_8cpp.html b/d8/dcc/binary__insertion__sort_8cpp.html
index 0897a2012..591bf0bfb 100644
--- a/d8/dcc/binary__insertion__sort_8cpp.html
+++ b/d8/dcc/binary__insertion__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/binary_insertion_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/binary_insertion_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for binary_insertion_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d76/binary__insertion__sort_8cpp__incl.svg" width="350" height="126"><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">
+</div>
+<p><a href="../../d8/dcc/binary__insertion__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -132,11 +151,11 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a034d8b276518a902962e87d3158b64fd" id="r_a034d8b276518a902962e87d3158b64fd"><td class="memTemplParams" colspan="2">template&lt;class T &gt; </td></tr>
-<tr class="memitem:a034d8b276518a902962e87d3158b64fd"><td class="memTemplItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd">sorting::binary_search</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;arr, T val, int64_t low, int64_t high)</td></tr>
+<tr class="memitem:a034d8b276518a902962e87d3158b64fd"><td class="memTemplItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd">sorting::binary_search</a> (std::vector&lt; T &gt; &amp;arr, T val, int64_t low, int64_t high)</td></tr>
 <tr class="memdesc:a034d8b276518a902962e87d3158b64fd"><td class="mdescLeft">&#160;</td><td class="mdescRight">Binary search function to find the most suitable pace for an element.  <br /></td></tr>
 <tr class="separator:a034d8b276518a902962e87d3158b64fd"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a5f4bc75cca6dd8294af2d0e328006c68" id="r_a5f4bc75cca6dd8294af2d0e328006c68"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a5f4bc75cca6dd8294af2d0e328006c68"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;arr)</td></tr>
+<tr class="memitem:a5f4bc75cca6dd8294af2d0e328006c68"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a> (std::vector&lt; T &gt; &amp;arr)</td></tr>
 <tr class="memdesc:a5f4bc75cca6dd8294af2d0e328006c68"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insertion sort function to sort the vector.  <br /></td></tr>
 <tr class="separator:a5f4bc75cca6dd8294af2d0e328006c68"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -177,6 +196,8 @@ Functions</h2></td></tr>
 </p>
  </li>
 </ol>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/dcc/binary__insertion__sort_8cpp_source.html">binary_insertion_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -195,17 +216,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dcc/binary__insertion__sort_8cpp_source.html#l00143">143</a> of file <a class="el" href="../../d8/dcc/binary__insertion__sort_8cpp_source.html">binary_insertion_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  143</span>           {</div>
 <div class="line"><span class="lineno">  144</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  145</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  146</span>}</div>
-<div class="ttc" id="abinary__insertion__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> binary_insertion_sort.cpp:104</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="539" height="250"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="abinary__insertion__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dcc/binary__insertion__sort_8cpp_source.html#l00104">binary_insertion_sort.cpp:104</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -233,53 +251,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>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dcc/binary__insertion__sort_8cpp_source.html#l00104">104</a> of file <a class="el" href="../../d8/dcc/binary__insertion__sort_8cpp_source.html">binary_insertion_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  104</span>                   {</div>
 <div class="line"><span class="lineno">  105</span>    <span class="comment">/* descriptions of the following test */</span></div>
 <div class="line"><span class="lineno">  106</span>    <span class="comment">/* 1st test:</span></div>
 <div class="line"><span class="lineno">  107</span><span class="comment">       [5, -3, -1, -2, 7] returns [-3, -2, -1, 5, 7] */</span></div>
-<div class="line"><span class="lineno">  108</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> arr1({5, -3, -1, -2, 7});</div>
-<div class="line"><span class="lineno">  109</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1st test... &quot;</span>;</div>
+<div class="line"><span class="lineno">  108</span>    std::vector&lt;int64_t&gt; arr1({5, -3, -1, -2, 7});</div>
+<div class="line"><span class="lineno">  109</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test... &quot;</span>;</div>
 <div class="line"><span class="lineno">  110</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a>(arr1);</div>
-<div class="line"><span class="lineno">  111</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr1), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr1)));</div>
-<div class="line"><span class="lineno">  112</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  111</span>    assert(std::is_sorted(std::begin(arr1), std::end(arr1)));</div>
+<div class="line"><span class="lineno">  112</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  113</span> </div>
 <div class="line"><span class="lineno">  114</span>    <span class="comment">/* 2nd test:</span></div>
 <div class="line"><span class="lineno">  115</span><span class="comment">       [12, 26, 15, 91, 32, 54, 41] returns [12, 15, 26, 32, 41, 54, 91] */</span></div>
-<div class="line"><span class="lineno">  116</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> arr2({12, 26, 15, 91, 32, 54, 41});</div>
-<div class="line"><span class="lineno">  117</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2nd test... &quot;</span>;</div>
+<div class="line"><span class="lineno">  116</span>    std::vector&lt;int64_t&gt; arr2({12, 26, 15, 91, 32, 54, 41});</div>
+<div class="line"><span class="lineno">  117</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test... &quot;</span>;</div>
 <div class="line"><span class="lineno">  118</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a>(arr2);</div>
-<div class="line"><span class="lineno">  119</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr2), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr2)));</div>
-<div class="line"><span class="lineno">  120</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  119</span>    assert(std::is_sorted(std::begin(arr2), std::end(arr2)));</div>
+<div class="line"><span class="lineno">  120</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  121</span> </div>
 <div class="line"><span class="lineno">  122</span>    <span class="comment">/* 3rd test:</span></div>
 <div class="line"><span class="lineno">  123</span><span class="comment">       [7.1, -2.5, -4.0, -2.1, 5.7] returns [-4.0, -2.5, -2.1, 5.7, 7.1] */</span></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&lt;float&gt;</a> arr3({7.1, -2.5, -4.0, -2.1, 5.7});</div>
-<div class="line"><span class="lineno">  125</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;3rd test... &quot;</span>;</div>
+<div class="line"><span class="lineno">  124</span>    std::vector&lt;float&gt; arr3({7.1, -2.5, -4.0, -2.1, 5.7});</div>
+<div class="line"><span class="lineno">  125</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test... &quot;</span>;</div>
 <div class="line"><span class="lineno">  126</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a>(arr3);</div>
-<div class="line"><span class="lineno">  127</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr3), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr3)));</div>
-<div class="line"><span class="lineno">  128</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  127</span>    assert(std::is_sorted(std::begin(arr3), std::end(arr3)));</div>
+<div class="line"><span class="lineno">  128</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  129</span> </div>
 <div class="line"><span class="lineno">  130</span>    <span class="comment">/* 4th test:</span></div>
 <div class="line"><span class="lineno">  131</span><span class="comment">       [12.8, -3.7, -20.7, -7.1, 2.2] returns [-20.7, -7.1, -3.7, 2.2, 12.8] */</span></div>
-<div class="line"><span class="lineno">  132</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> arr4({12.8, -3.7, -20.7, -7.1, 2.2});</div>
-<div class="line"><span class="lineno">  133</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;4th test... &quot;</span>;</div>
+<div class="line"><span class="lineno">  132</span>    std::vector&lt;float&gt; arr4({12.8, -3.7, -20.7, -7.1, 2.2});</div>
+<div class="line"><span class="lineno">  133</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;4th test... &quot;</span>;</div>
 <div class="line"><span class="lineno">  134</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a>(arr4);</div>
-<div class="line"><span class="lineno">  135</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr4), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr4)));</div>
-<div class="line"><span class="lineno">  136</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  135</span>    assert(std::is_sorted(std::begin(arr4), std::end(arr4)));</div>
+<div class="line"><span class="lineno">  136</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  137</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="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</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="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-<div class="ttc" id="anamespacesorting_html_a5f4bc75cca6dd8294af2d0e328006c68"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a></div><div class="ttdeci">void insertionSort_binsrch(std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Insertion sort function to sort the vector.</div><div class="ttdef"><b>Definition</b> binary_insertion_sort.cpp:84</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="442" height="250"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacesorting_html_a5f4bc75cca6dd8294af2d0e328006c68"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a></div><div class="ttdeci">void insertionSort_binsrch(std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Insertion sort function to sort the vector.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dcc/binary__insertion__sort_8cpp_source.html#l00084">binary_insertion_sort.cpp:84</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index d2a46ff6f..000000000
--- a/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,18 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,104,49,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="128,5,206,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="35,102,60,71,95,40,112,31,115,35,98,44,64,75,39,105"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="133,55,202,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="48,106,96,89,118,81,120,86,98,94,50,111"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="132,104,203,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,114,116,114,116,120,49,120"/>
-<area shape="rect" id="Node000005" href="$d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68" title="Insertion sort function to sort the vector." alt="" coords="97,154,238,194"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="50,123,103,145,101,150,48,128"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="117,219,218,244"/>
-<area shape="poly" id="edge8_Node000001_Node000008" title=" " alt="" coords="38,129,62,166,79,186,98,204,106,209,103,213,95,208,75,190,57,169,33,132"/>
-<area shape="rect" id="Node000006" href="$d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd" title="Binary search function to find the most suitable pace for an element." alt="" coords="286,137,435,163"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="238,163,270,159,271,164,239,168"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="303,187,418,212"/>
-<area shape="poly" id="edge7_Node000005_Node000007" title=" " alt="" coords="239,181,288,187,287,193,238,186"/>
-<area shape="poly" id="edge6_Node000006_Node000006" title=" " alt="" coords="328,138,322,129,326,119,339,113,361,111,384,113,397,120,394,125,383,118,361,116,340,118,330,123,327,128,333,135"/>
-</map>
diff --git a/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 87faca44d..000000000
--- a/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b81792d9c24c276c977a277424c297fb
\ No newline at end of file
diff --git a/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index f2cdc3bc4..000000000
--- a/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,183 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="331pt" height="187pt"
- viewBox="0.00 0.00 330.50 187.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 183.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-105.25 0,-105.25 0,-86 32.5,-86 32.5,-105.25"/>
-<text text-anchor="middle" x="16.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.88,-179.25 92.12,-179.25 92.12,-160 150.88,-160 150.88,-179.25"/>
-<text text-anchor="middle" x="121.5" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.06,-105.73C32.93,-118.18 49.56,-139.17 68.5,-151.62 72.45,-154.22 76.82,-156.49 81.29,-158.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.78,-161.62 90.37,-161.96 82.31,-155.09 79.78,-161.62"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="147.12,-142.25 95.88,-142.25 95.88,-123 147.12,-123 147.12,-142.25"/>
-<text text-anchor="middle" x="121.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.92,-101.53C43.05,-105.33 56.53,-110.33 68.5,-114.62 73.87,-116.55 79.57,-118.56 85.14,-120.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.57,-123.66 94.17,-123.63 85.87,-117.05 83.57,-123.66"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="148.25,-105.25 94.75,-105.25 94.75,-86 148.25,-86 148.25,-105.25"/>
-<text text-anchor="middle" x="121.5" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.93,-95.62C46.22,-95.62 65.83,-95.62 83.12,-95.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.1,-99.13 93.1,-95.63 83.1,-92.13 83.1,-99.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68" target="_top" xlink:title="Insertion sort function to sort the vector.">
-<polygon fill="white" stroke="#666666" points="174.5,-67.88 68.5,-67.88 68.5,-37.38 174.5,-37.38 174.5,-67.88"/>
-<text text-anchor="start" x="76.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
-<text text-anchor="middle" x="121.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_binsrch</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.93,-89.09C43.55,-84.67 58.21,-78.57 72.49,-72.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.48,-76 81.36,-68.92 70.79,-69.54 73.48,-76"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.12,-19.25 83.88,-19.25 83.88,0 159.12,0 159.12,-19.25"/>
-<text text-anchor="middle" x="121.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge8_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.5,-85.55C30.55,-71.02 47.26,-44.24 68.5,-28.62 70.3,-27.3 72.2,-26.06 74.17,-24.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.73,-28.04 83.09,-20.42 72.58,-21.78 75.73,-28.04"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd" target="_top" xlink:title="Binary search function to find the most suitable pace for an element.">
-<polygon fill="white" stroke="#666666" points="322.5,-80.25 210.5,-80.25 210.5,-61 322.5,-61 322.5,-80.25"/>
-<text text-anchor="middle" x="266.5" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::binary_search</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.94,-59.23C182.74,-60.21 190.87,-61.23 198.91,-62.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.33,-65.7 208.69,-63.47 199.2,-58.75 198.33,-65.7"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="309.75,-43.25 223.25,-43.25 223.25,-24 309.75,-24 309.75,-43.25"/>
-<text text-anchor="middle" x="266.5" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge7_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge7_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.94,-45.66C186.9,-44.07 199.62,-42.38 211.64,-40.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="211.95,-44.27 221.4,-39.48 211.03,-37.33 211.95,-44.27"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.8,-80.54C233.44,-89.15 241.01,-98.25 266.5,-98.25 280.84,-98.25 289.5,-95.37 292.5,-91.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.92,-90.52 289.64,-81.99 289.22,-92.57 295.92,-90.52"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index e4e59d30f..000000000
--- a/d8/dcc/binary__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,157 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="331pt" height="187pt"
- viewBox="0.00 0.00 330.50 187.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 183.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-105.25 0,-105.25 0,-86 32.5,-86 32.5,-105.25"/>
-<text text-anchor="middle" x="16.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.88,-179.25 92.12,-179.25 92.12,-160 150.88,-160 150.88,-179.25"/>
-<text text-anchor="middle" x="121.5" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.06,-105.73C32.93,-118.18 49.56,-139.17 68.5,-151.62 72.45,-154.22 76.82,-156.49 81.29,-158.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.78,-161.62 90.37,-161.96 82.31,-155.09 79.78,-161.62"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="147.12,-142.25 95.88,-142.25 95.88,-123 147.12,-123 147.12,-142.25"/>
-<text text-anchor="middle" x="121.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.92,-101.53C43.05,-105.33 56.53,-110.33 68.5,-114.62 73.87,-116.55 79.57,-118.56 85.14,-120.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.57,-123.66 94.17,-123.63 85.87,-117.05 83.57,-123.66"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="148.25,-105.25 94.75,-105.25 94.75,-86 148.25,-86 148.25,-105.25"/>
-<text text-anchor="middle" x="121.5" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.93,-95.62C46.22,-95.62 65.83,-95.62 83.12,-95.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.1,-99.13 93.1,-95.63 83.1,-92.13 83.1,-99.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68" target="_top" xlink:title="Insertion sort function to sort the vector.">
-<polygon fill="white" stroke="#666666" points="174.5,-67.88 68.5,-67.88 68.5,-37.38 174.5,-37.38 174.5,-67.88"/>
-<text text-anchor="start" x="76.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
-<text text-anchor="middle" x="121.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_binsrch</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.93,-89.09C43.55,-84.67 58.21,-78.57 72.49,-72.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.48,-76 81.36,-68.92 70.79,-69.54 73.48,-76"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.12,-19.25 83.88,-19.25 83.88,0 159.12,0 159.12,-19.25"/>
-<text text-anchor="middle" x="121.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge8_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.5,-85.55C30.55,-71.02 47.26,-44.24 68.5,-28.62 70.3,-27.3 72.2,-26.06 74.17,-24.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.73,-28.04 83.09,-20.42 72.58,-21.78 75.73,-28.04"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd" target="_top" xlink:title="Binary search function to find the most suitable pace for an element.">
-<polygon fill="white" stroke="#666666" points="322.5,-80.25 210.5,-80.25 210.5,-61 322.5,-61 322.5,-80.25"/>
-<text text-anchor="middle" x="266.5" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::binary_search</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.94,-59.23C182.74,-60.21 190.87,-61.23 198.91,-62.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.33,-65.7 208.69,-63.47 199.2,-58.75 198.33,-65.7"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="309.75,-43.25 223.25,-43.25 223.25,-24 309.75,-24 309.75,-43.25"/>
-<text text-anchor="middle" x="266.5" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge7_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge7_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.94,-45.66C186.9,-44.07 199.62,-42.38 211.64,-40.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="211.95,-44.27 221.4,-39.48 211.03,-37.33 211.95,-44.27"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.8,-80.54C233.44,-89.15 241.01,-98.25 266.5,-98.25 280.84,-98.25 289.5,-95.37 292.5,-91.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.92,-90.52 289.64,-81.99 289.22,-92.57 295.92,-90.52"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 4f4ceeb81..000000000
--- a/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,20 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,104,55,130"/>
-<area shape="rect" id="Node000002" href="$d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,104,146,130"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,114,87,114,87,120,55,120"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="226,5,304,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="133,102,157,71,192,40,210,31,212,35,196,44,161,75,137,105"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="230,55,299,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="146,106,193,89,215,81,217,86,195,94,147,111"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="229,104,300,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="147,114,213,114,213,120,147,120"/>
-<area shape="rect" id="Node000006" href="$d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68" title="Insertion sort function to sort the vector." alt="" coords="194,154,335,194"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="148,123,200,145,198,150,146,128"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="214,219,315,244"/>
-<area shape="poly" id="edge9_Node000002_Node000009" title=" " alt="" coords="135,129,159,166,176,186,196,204,203,209,200,213,192,208,172,190,155,169,130,132"/>
-<area shape="rect" id="Node000007" href="$d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd" title="Binary search function to find the most suitable pace for an element." alt="" coords="383,137,533,163"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="336,163,368,159,368,164,336,168"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="400,187,516,212"/>
-<area shape="poly" id="edge8_Node000006_Node000008" title=" " alt="" coords="336,181,385,187,385,193,336,186"/>
-<area shape="poly" id="edge7_Node000007_Node000007" title=" " alt="" coords="426,138,419,129,423,119,436,113,458,111,482,113,494,120,491,125,480,118,458,116,438,118,427,123,425,128,430,135"/>
-</map>
diff --git a/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 21b355489..000000000
--- a/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-12666ce854669873e2a415ae5a928298
\ No newline at end of file
diff --git a/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 6bb1f8b7f..000000000
--- a/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,201 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="404pt" height="187pt"
- viewBox="0.00 0.00 403.50 187.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 183.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-105.25 0,-105.25 0,-86 37,-86 37,-105.25"/>
-<text text-anchor="middle" x="18.5" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-105.25 73,-105.25 73,-86 105.5,-86 105.5,-105.25"/>
-<text text-anchor="middle" x="89.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-95.62C44.58,-95.62 53.31,-95.62 61.45,-95.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-99.13 71.2,-95.63 61.2,-92.13 61.2,-99.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.88,-179.25 165.12,-179.25 165.12,-160 223.88,-160 223.88,-179.25"/>
-<text text-anchor="middle" x="194.5" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.06,-105.73C105.93,-118.18 122.56,-139.17 141.5,-151.62 145.45,-154.22 149.82,-156.49 154.29,-158.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.78,-161.62 163.37,-161.96 155.31,-155.09 152.78,-161.62"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.12,-142.25 168.88,-142.25 168.88,-123 220.12,-123 220.12,-142.25"/>
-<text text-anchor="middle" x="194.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.92,-101.53C116.05,-105.33 129.53,-110.33 141.5,-114.62 146.87,-116.55 152.57,-118.56 158.14,-120.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.57,-123.66 167.17,-123.63 158.87,-117.05 156.57,-123.66"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221.25,-105.25 167.75,-105.25 167.75,-86 221.25,-86 221.25,-105.25"/>
-<text text-anchor="middle" x="194.5" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.93,-95.62C119.22,-95.62 138.83,-95.62 156.12,-95.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.1,-99.13 166.1,-95.63 156.1,-92.13 156.1,-99.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68" target="_top" xlink:title="Insertion sort function to sort the vector.">
-<polygon fill="white" stroke="#666666" points="247.5,-67.88 141.5,-67.88 141.5,-37.38 247.5,-37.38 247.5,-67.88"/>
-<text text-anchor="start" x="149.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
-<text text-anchor="middle" x="194.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_binsrch</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.93,-89.09C116.55,-84.67 131.21,-78.57 145.49,-72.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.48,-76 154.36,-68.92 143.79,-69.54 146.48,-76"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.12,-19.25 156.88,-19.25 156.88,0 232.12,0 232.12,-19.25"/>
-<text text-anchor="middle" x="194.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge9_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge9_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.5,-85.55C103.55,-71.02 120.26,-44.24 141.5,-28.62 143.3,-27.3 145.2,-26.06 147.17,-24.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.73,-28.04 156.09,-20.42 145.58,-21.78 148.73,-28.04"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd" target="_top" xlink:title="Binary search function to find the most suitable pace for an element.">
-<polygon fill="white" stroke="#666666" points="395.5,-80.25 283.5,-80.25 283.5,-61 395.5,-61 395.5,-80.25"/>
-<text text-anchor="middle" x="339.5" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::binary_search</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M247.94,-59.23C255.74,-60.21 263.87,-61.23 271.91,-62.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="271.33,-65.7 281.69,-63.47 272.2,-58.75 271.33,-65.7"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="382.75,-43.25 296.25,-43.25 296.25,-24 382.75,-24 382.75,-43.25"/>
-<text text-anchor="middle" x="339.5" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge8_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge8_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M247.94,-45.66C259.9,-44.07 272.62,-42.38 284.64,-40.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.95,-44.27 294.4,-39.48 284.03,-37.33 284.95,-44.27"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M316.8,-80.54C306.44,-89.15 314.01,-98.25 339.5,-98.25 353.84,-98.25 362.5,-95.37 365.5,-91.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="368.92,-90.52 362.64,-81.99 362.22,-92.57 368.92,-90.52"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 915d24638..000000000
--- a/d8/dcc/binary__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,175 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="404pt" height="187pt"
- viewBox="0.00 0.00 403.50 187.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 183.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-105.25 0,-105.25 0,-86 37,-86 37,-105.25"/>
-<text text-anchor="middle" x="18.5" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-105.25 73,-105.25 73,-86 105.5,-86 105.5,-105.25"/>
-<text text-anchor="middle" x="89.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-95.62C44.58,-95.62 53.31,-95.62 61.45,-95.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-99.13 71.2,-95.63 61.2,-92.13 61.2,-99.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.88,-179.25 165.12,-179.25 165.12,-160 223.88,-160 223.88,-179.25"/>
-<text text-anchor="middle" x="194.5" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.06,-105.73C105.93,-118.18 122.56,-139.17 141.5,-151.62 145.45,-154.22 149.82,-156.49 154.29,-158.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.78,-161.62 163.37,-161.96 155.31,-155.09 152.78,-161.62"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.12,-142.25 168.88,-142.25 168.88,-123 220.12,-123 220.12,-142.25"/>
-<text text-anchor="middle" x="194.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.92,-101.53C116.05,-105.33 129.53,-110.33 141.5,-114.62 146.87,-116.55 152.57,-118.56 158.14,-120.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.57,-123.66 167.17,-123.63 158.87,-117.05 156.57,-123.66"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221.25,-105.25 167.75,-105.25 167.75,-86 221.25,-86 221.25,-105.25"/>
-<text text-anchor="middle" x="194.5" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.93,-95.62C119.22,-95.62 138.83,-95.62 156.12,-95.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.1,-99.13 166.1,-95.63 156.1,-92.13 156.1,-99.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68" target="_top" xlink:title="Insertion sort function to sort the vector.">
-<polygon fill="white" stroke="#666666" points="247.5,-67.88 141.5,-67.88 141.5,-37.38 247.5,-37.38 247.5,-67.88"/>
-<text text-anchor="start" x="149.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
-<text text-anchor="middle" x="194.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_binsrch</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.93,-89.09C116.55,-84.67 131.21,-78.57 145.49,-72.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.48,-76 154.36,-68.92 143.79,-69.54 146.48,-76"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.12,-19.25 156.88,-19.25 156.88,0 232.12,0 232.12,-19.25"/>
-<text text-anchor="middle" x="194.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge9_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge9_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.5,-85.55C103.55,-71.02 120.26,-44.24 141.5,-28.62 143.3,-27.3 145.2,-26.06 147.17,-24.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.73,-28.04 156.09,-20.42 145.58,-21.78 148.73,-28.04"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd" target="_top" xlink:title="Binary search function to find the most suitable pace for an element.">
-<polygon fill="white" stroke="#666666" points="395.5,-80.25 283.5,-80.25 283.5,-61 395.5,-61 395.5,-80.25"/>
-<text text-anchor="middle" x="339.5" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::binary_search</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M247.94,-59.23C255.74,-60.21 263.87,-61.23 271.91,-62.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="271.33,-65.7 281.69,-63.47 272.2,-58.75 271.33,-65.7"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="382.75,-43.25 296.25,-43.25 296.25,-24 382.75,-24 382.75,-43.25"/>
-<text text-anchor="middle" x="339.5" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge8_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge8_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M247.94,-45.66C259.9,-44.07 272.62,-42.38 284.64,-40.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.95,-44.27 294.4,-39.48 284.03,-37.33 284.95,-44.27"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge7_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge7_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M316.8,-80.54C306.44,-89.15 314.01,-98.25 339.5,-98.25 353.84,-98.25 362.5,-95.37 365.5,-91.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="368.92,-90.52 362.64,-81.99 362.22,-92.57 368.92,-90.52"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/dcc/binary__insertion__sort_8cpp_source.html b/d8/dcc/binary__insertion__sort_8cpp_source.html
new file mode 100644
index 000000000..a5a35b17b
--- /dev/null
+++ b/d8/dcc/binary__insertion__sort_8cpp_source.html
@@ -0,0 +1,229 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/binary_insertion_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/dcc/binary__insertion__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">binary_insertion_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/dcc/binary__insertion__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
+<div class="foldopen" id="foldopen00063" data-start="{" data-end="}">
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd">   63</a></span>int64_t <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd">binary_search</a>(std::vector&lt;T&gt; &amp;arr, T val, int64_t low, int64_t high) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="keywordflow">if</span> (high &lt;= low) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <span class="keywordflow">return</span> (val &gt; arr[low]) ? (low + 1) : low;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    int64_t mid = low + (high - low) / 2;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keywordflow">if</span> (arr[mid] &gt; val) {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd">binary_search</a>(arr, val, low, mid - 1);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (arr[mid] &lt; val) {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd">binary_search</a>(arr, val, mid + 1, high);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        <span class="keywordflow">return</span> mid + 1;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    }</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>}</div>
+</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00084" data-start="{" data-end="}">
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">   84</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">insertionSort_binsrch</a>(std::vector&lt;T&gt; &amp;arr) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    int64_t n = arr.size();</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="keywordflow">for</span> (int64_t i = 1; i &lt; n; i++) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        T key = arr[i];</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        int64_t j = i - 1;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        int64_t loc = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd">sorting::binary_search</a>(arr, key, 0, j);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        <span class="keywordflow">while</span> (j &gt;= loc) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>            arr[j + 1] = arr[j];</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>            j--;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        }</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        arr[j + 1] = key;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>}</div>
+</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="foldopen" id="foldopen00104" data-start="{" data-end="}">
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"><a class="line" href="../../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  104</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="comment">/* descriptions of the following test */</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="comment">/* 1st test:</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span><span class="comment">       [5, -3, -1, -2, 7] returns [-3, -2, -1, 5, 7] */</span></div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    std::vector&lt;int64_t&gt; arr1({5, -3, -1, -2, 7});</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test... &quot;</span>;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a>(arr1);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    assert(std::is_sorted(std::begin(arr1), std::end(arr1)));</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="comment">/* 2nd test:</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span><span class="comment">       [12, 26, 15, 91, 32, 54, 41] returns [12, 15, 26, 32, 41, 54, 91] */</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::vector&lt;int64_t&gt; arr2({12, 26, 15, 91, 32, 54, 41});</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test... &quot;</span>;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a>(arr2);</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    assert(std::is_sorted(std::begin(arr2), std::end(arr2)));</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span> </div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="comment">/* 3rd test:</span></div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span><span class="comment">       [7.1, -2.5, -4.0, -2.1, 5.7] returns [-4.0, -2.5, -2.1, 5.7, 7.1] */</span></div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    std::vector&lt;float&gt; arr3({7.1, -2.5, -4.0, -2.1, 5.7});</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test... &quot;</span>;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a>(arr3);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    assert(std::is_sorted(std::begin(arr3), std::end(arr3)));</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="comment">/* 4th test:</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span><span class="comment">       [12.8, -3.7, -20.7, -7.1, 2.2] returns [-20.7, -7.1, -3.7, 2.2, 12.8] */</span></div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    std::vector&lt;float&gt; arr4({12.8, -3.7, -20.7, -7.1, 2.2});</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;4th test... &quot;</span>;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a>(arr4);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    assert(std::is_sorted(std::begin(arr4), std::end(arr4)));</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>}</div>
+</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
+<div class="foldopen" id="foldopen00143" data-start="{" data-end="}">
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"><a class="line" href="../../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  143</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <a class="code hl_function" href="../../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>}</div>
+</div>
+<div class="ttc" id="abinary__insertion__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/dcc/binary__insertion__sort_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> <a href="#l00104">binary_insertion_sort.cpp:104</a></div></div>
+<div class="ttc" id="abinary__insertion__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00143">binary_insertion_sort.cpp:143</a></div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+<div class="ttc" id="anamespacesorting_html_a034d8b276518a902962e87d3158b64fd"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd">sorting::binary_search</a></div><div class="ttdeci">int64_t binary_search(std::vector&lt; T &gt; &amp;arr, T val, int64_t low, int64_t high)</div><div class="ttdoc">Binary search function to find the most suitable pace for an element.</div><div class="ttdef"><b>Definition</b> <a href="#l00063">binary_insertion_sort.cpp:63</a></div></div>
+<div class="ttc" id="anamespacesorting_html_a5f4bc75cca6dd8294af2d0e328006c68"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68">sorting::insertionSort_binsrch</a></div><div class="ttdeci">void insertionSort_binsrch(std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Insertion sort function to sort the vector.</div><div class="ttdef"><b>Definition</b> <a href="#l00084">binary_insertion_sort.cpp:84</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d8/dcc/binary__insertion__sort_8cpp.html">binary_insertion_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/dcc/namespacestd.html b/d8/dcc/namespacestd.html
deleted file mode 100644
index e280fb6d5..000000000
--- a/d8/dcc/namespacestd.html
+++ /dev/null
@@ -1,2757 +0,0 @@
-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
-<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
-<head>
-<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
-<meta http-equiv="X-UA-Compatible" content="IE=11"/>
-<meta name="generator" content="Doxygen 1.12.0"/>
-<meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: std 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>
-<script type="text/javascript" src="../../clipboard.js"></script>
-<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
-<script type="text/javascript" src="../../navtreedata.js"></script>
-<script type="text/javascript" src="../../navtree.js"></script>
-<script type="text/javascript" src="../../resize.js"></script>
-<script type="text/javascript" src="../../cookie.js"></script>
-<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
-<script type="text/javascript" src="../../search/searchdata.js"></script>
-<script type="text/javascript" src="../../search/search.js"></script>
-<script type="text/x-mathjax-config">
-MathJax.Hub.Config({
-  extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
-  jax: ["input/TeX","output/HTML-CSS"],
-});
-</script>
-<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
-<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
-</head>
-<body>
-<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
-<div id="titlearea">
-<table cellspacing="0" cellpadding="0">
- <tbody>
- <tr id="projectrow">
-  <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
-   </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
-  </td>
- </tr>
- </tbody>
-</table>
-</div>
-<!-- end header part -->
-<!-- Generated by Doxygen 1.12.0 -->
-<script type="text/javascript">
-/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
-var searchBox = new SearchBox("searchBox", "../../search/",'.html');
-/* @license-end */
-</script>
-<script type="text/javascript">
-/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
-$(function() { codefold.init(1); });
-/* @license-end */
-</script>
-<script type="text/javascript" src="../../menudata.js"></script>
-<script type="text/javascript" src="../../menu.js"></script>
-<script type="text/javascript">
-/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
-$(function() {
-  initMenu('../../',true,false,'search.php','Search',true);
-  $(function() { init_search(); });
-});
-/* @license-end */
-</script>
-<div id="main-nav"></div>
-</div><!-- top -->
-<div id="side-nav" class="ui-resizable side-nav-resizable">
-  <div id="nav-tree">
-    <div id="nav-tree-contents">
-      <div id="nav-sync" class="sync"></div>
-    </div>
-  </div>
-  <div id="splitbar" style="-moz-user-select:none;" 
-       class="ui-resizable-handle">
-  </div>
-</div>
-<script type="text/javascript">
-/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
-$(function(){initNavTree('d8/dcc/namespacestd.html','../../'); initResizable(true); });
-/* @license-end */
-</script>
-<div id="doc-content">
-<!-- window showing the filter options -->
-<div id="MSearchSelectWindow"
-     onmouseover="return searchBox.OnSearchSelectShow()"
-     onmouseout="return searchBox.OnSearchSelectHide()"
-     onkeydown="return searchBox.OnSearchSelectKey(event)">
-</div>
-
-<!-- iframe showing the search results (closed by default) -->
-<div id="MSearchResultsWindow">
-<div id="MSearchResults">
-<div class="SRPage">
-<div id="SRIndex">
-<div id="SRResults"></div>
-<div class="SRStatus" id="Loading">Loading...</div>
-<div class="SRStatus" id="Searching">Searching...</div>
-<div class="SRStatus" id="NoMatches">No Matches</div>
-</div>
-</div>
-</div>
-</div>
-
-<div class="header">
-  <div class="summary">
-<a href="#nested-classes">Classes</a> &#124;
-<a href="#func-members">Functions</a>  </div>
-  <div class="headertitle"><div class="title">std Namespace Reference</div></div>
-</div><!--header-->
-<div class="contents">
-
-<p>STL namespace.  
-<a href="#details">More...</a></p>
-<table class="memberdecls">
-<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
-Classes</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/add_cv.html">add_const</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/add_cv.html">add_cv</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/add_reference.html">add_lvalue_reference</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/add_pointer.html">add_pointer</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/add_reference.html">add_rvalue_reference</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/add_cv.html">add_volatile</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/lock_tag_t.html">adopt_lock_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/aligned_storage.html">aligned_storage</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/aligned_union.html">aligned_union</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/alignment_of.html">alignment_of</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/allocator.html">allocator</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/allocator_arg_t.html">allocator_arg_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/allocator_traits.html">allocator_traits</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">array</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic.html">atomic</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_flag.html">atomic_flag</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>atomic_ref</b></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/auto_ptr.html">auto_ptr</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/back_insert_iterator.html">back_insert_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html">bad_alloc</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/new/bad_array_length.html">bad_array_length</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/new/bad_array_new_length.html">bad_array_new_length</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/bad_cast.html">bad_cast</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/bad_exception.html">bad_exception</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/bad_function_call.html">bad_function_call</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/bad_optional_access.html">bad_optional_access</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/bad_typeid.html">bad_typeid</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/bad_weak_ptr.html">bad_weak_ptr</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_filebuf.html">basic_filebuf</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_fstream.html">basic_fstream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ifstream.html">basic_ifstream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ios.html">basic_ios</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_iostream.html">basic_iostream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">basic_istream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istringstream.html">basic_istringstream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">basic_ofstream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">basic_ostream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostringstream.html">basic_ostringstream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/basic_regex.html">basic_regex</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_streambuf.html">basic_streambuf</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">basic_string</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>basic_string_view</b></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_stringbuf.html">basic_stringbuf</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">basic_stringstream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution.html">bernoulli_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/iterator_tags.html">bidirectional_iterator_tag</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/binary_function.html">binary_function</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html">binary_negate</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution.html">binomial_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/bit_and.html">bit_and</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/bit_not.html">bit_not</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/bit_or.html">bit_or</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/bitset.html">bitset</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution.html">cauchy_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">centi</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cerr</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/char_traits.html">char_traits</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution.html">chi_squared_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">cin</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">clock_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">clog</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/match_results.html">cmatch</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/codecvt.html">codecvt</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/codecvt_base.html">codecvt_base</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/codecvt_byname.html">codecvt_byname</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/codecvt_utf16.html">codecvt_utf16</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/codecvt_utf8.html">codecvt_utf8</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/codecvt_utf8_utf16.html">codecvt_utf8_utf16</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/collate.html">collate</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/collate_byname.html">collate_byname</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/common_type.html">common_type</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">complex</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/condition_variable.html">condition_variable</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/condition_variable_any.html">condition_variable_any</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/conditional.html">conditional</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/regex_iterator.html">cregex_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html">cregex_token_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/sub_match.html">csub_match</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/ctype.html">ctype</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/ctype_base.html">ctype_base</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/ctype_byname.html">ctype_byname</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">deca</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/decay.html">decay</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">deci</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/default_delete.html">default_delete</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random.html">default_random_engine</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/lock_tag_t.html">defer_lock_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque.html">deque</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html">discard_block_engine</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution.html">discrete_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/divides.html">divides</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/domain_error.html">domain_error</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/dynarray.html">dynarray</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">enable_if</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/enable_shared_from_this.html">enable_shared_from_this</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/equal_to.html">equal_to</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/errc.html">errc</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/error_category.html">error_category</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/error_code.html">error_code</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/error_condition.html">error_condition</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">exa</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/exception.html">exception</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/exception_ptr.html">exception_ptr</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution.html">exponential_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/extent.html">extent</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution.html">extreme_value_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">false_type</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">femto</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c.html">FILE</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_filebuf.html">filebuf</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution.html">fisher_f_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/iterator_tags.html">forward_iterator_tag</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/forward_list.html">forward_list</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/fpos.html">fpos</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c.html">fpos_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/front_insert_iterator.html">front_insert_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_fstream.html">fstream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">function</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/future.html">future</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/future_error.html">future_error</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution.html">gamma_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution.html">geometric_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">giga</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/greater.html">greater</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html">greater_equal</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/has_virtual_destructor.html">has_virtual_destructor</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/hash.html">hash</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">hecto</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ifstream.html">ifstream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine.html">independent_bits_engine</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/initializer_list.html">initializer_list</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/iterator_tags.html">input_iterator_tag</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/insert_iterator.html">insert_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">int16_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">int32_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">int64_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">int8_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">int_fast16_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">int_fast32_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">int_fast64_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">int_fast8_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">int_least16_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">int_least32_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">int_least64_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">int_least8_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/integer_sequence.html">integer_sequence</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">integral_constant</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">intmax_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">intptr_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">invalid_argument</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>ios</b></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/ios_base.html">ios_base</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_iostream.html">iostream</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_abstract.html">is_abstract</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_arithmetic.html">is_arithmetic</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html">is_arithmetic&lt; uint128_t &gt;</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html">is_arithmetic&lt; uint256_t &gt;</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_array.html">is_array</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_assignable.html">is_assignable</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_base_of.html">is_base_of</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/is_bind_expression.html">is_bind_expression</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_class.html">is_class</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_compound.html">is_compound</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_const.html">is_const</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_constructible.html">is_constructible</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_convertible.html">is_convertible</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_copy_assignable.html">is_copy_assignable</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_copy_constructible.html">is_copy_constructible</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_default_constructible.html">is_default_constructible</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_destructible.html">is_destructible</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_empty.html">is_empty</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_enum.html">is_enum</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/error_code/is_error_code_enum.html">is_error_code_enum</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/error_condition/is_error_condition_enum.html">is_error_condition_enum</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_floating_point.html">is_floating_point</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_function.html">is_function</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_fundamental.html">is_fundamental</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">is_integral</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html">is_integral&lt; uint128_t &gt;</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html">is_integral&lt; uint256_t &gt;</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_literal_type.html">is_literal_type</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_lvalue_reference.html">is_lvalue_reference</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_member_function_pointer.html">is_member_function_pointer</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_member_object_pointer.html">is_member_object_pointer</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_member_pointer.html">is_member_pointer</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_move_assignable.html">is_move_assignable</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_move_constructible.html">is_move_constructible</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_assignable.html">is_nothrow_assignable</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_constructible.html">is_nothrow_constructible</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_copy_assignable.html">is_nothrow_copy_assignable</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_copy_constructible.html">is_nothrow_copy_constructible</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_default_constructible.html">is_nothrow_default_constructible</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_destructible.html">is_nothrow_destructible</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_move_assignable.html">is_nothrow_move_assignable</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_move_constructible.html">is_nothrow_move_constructible</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_object.html">is_object</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/is_placeholder.html">is_placeholder</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_pod.html">is_pod</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_pointer.html">is_pointer</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_polymorphic.html">is_polymorphic</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_reference.html">is_reference</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_rvalue_reference.html">is_rvalue_reference</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_same.html">is_same</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_scalar.html">is_scalar</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_signed.html">is_signed</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_standard_layout.html">is_standard_layout</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_trivial.html">is_trivial</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_assignable.html">is_trivially_assignable</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_constructible.html">is_trivially_constructible</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_copy_assignable.html">is_trivially_copy_assignable</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_copy_constructible.html">is_trivially_copy_constructible</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_trivially_copyable.html">is_trivially_copyable</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_default_constructible.html">is_trivially_default_constructible</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_destructible.html">is_trivially_destructible</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_move_assignable.html">is_trivially_move_assignable</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_move_constructible.html">is_trivially_move_constructible</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_union.html">is_union</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_unsigned.html">is_unsigned</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html">is_unsigned&lt; uint128_t &gt;</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html">is_unsigned&lt; uint256_t &gt;</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_void.html">is_void</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_volatile.html">is_volatile</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">istream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/istream_iterator.html">istream_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/istreambuf_iterator.html">istreambuf_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istringstream.html">istringstream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/istrstream.html">istrstream</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/iterator.html">iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/iterator_traits.html">iterator_traits</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/jmp_buf.html">jmp_buf</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>jthread</b></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">kilo</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine.html">knuth_b</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/lconv.html">lconv</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/length_error.html">length_error</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/less.html">less</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/less_equal.html">less_equal</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html">linear_congruential_engine</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">list</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/locale.html">locale</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/lock_guard.html">lock_guard</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/logic_error.html">logic_error</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/logical_and.html">logical_and</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/logical_not.html">logical_not</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/logical_or.html">logical_or</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution.html">lognormal_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/make_signed.html">make_signed</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/make_unsigned.html">make_unsigned</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">map</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/match_results.html">match_results</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/max_align_t.html">max_align_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/multibyte/mbstate_t.html">mbstate_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">mega</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html">mersenne_twister_engine</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/messages.html">messages</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/messages_base.html">messages_base</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/messages_byname.html">messages_byname</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">micro</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">milli</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html">minstd_rand</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html">minstd_rand0</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/minus.html">minus</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/modulus.html">modulus</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/money_base.html">money_base</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/money_get.html">money_get</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/money_put.html">money_put</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/moneypunct.html">moneypunct</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/moneypunct_byname.html">moneypunct_byname</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/move_iterator.html">move_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html">mt19937</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html">mt19937_64</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multimap.html">multimap</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/multiplies.html">multiplies</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset.html">multiset</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/mutex.html">mutex</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">nano</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/negate.html">negate</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution.html">negative_binomial_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/nested_exception.html">nested_exception</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/new/new_handler.html">new_handler</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/normal_distribution.html">normal_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/not_equal_to.html">not_equal_to</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/new/nothrow_t.html">nothrow_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/nullptr_t.html">nullptr_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/num_get.html">num_get</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/num_put.html">num_put</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">numeric_limits</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/numpunct.html">numpunct</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/numpunct_byname.html">numpunct_byname</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">ofstream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/once_flag.html">once_flag</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">ostream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/ostream_iterator.html">ostream_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/ostreambuf_iterator.html">ostreambuf_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostringstream.html">ostringstream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/ostrstream.html">ostrstream</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">out_of_range</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/iterator_tags.html">output_iterator_tag</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/overflow_error.html">overflow_error</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/owner_less.html">owner_less</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/packaged_task.html">packaged_task</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">pair</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">peta</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">pico</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution.html">piecewise_constant_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/piecewise_construct_t.html">piecewise_construct_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution.html">piecewise_linear_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/placeholders.html">placeholders</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/plus.html">plus</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/gc/pointer_safety.html">pointer_safety</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/pointer_traits.html">pointer_traits</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution.html">poisson_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">priority_queue</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/promise.html">promise</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/ptrdiff_t.html">ptrdiff_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">queue</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/iterator_tags.html">random_access_iterator_tag</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/random_device.html">random_device</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/range_error.html">range_error</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/rank.html">rank</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html">ranlux24</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html">ranlux24_base</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html">ranlux48</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html">ranlux48_base</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">ratio</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio_add.html">ratio_add</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio_divide.html">ratio_divide</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio_equal.html">ratio_equal</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio_greater.html">ratio_greater</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio_greater_equal.html">ratio_greater_equal</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio_less.html">ratio_less</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio_less_equal.html">ratio_less_equal</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio_multiply.html">ratio_multiply</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio_not_equal.html">ratio_not_equal</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio_subtract.html">ratio_subtract</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/raw_storage_iterator.html">raw_storage_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/recursive_mutex.html">recursive_mutex</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex.html">recursive_timed_mutex</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper.html">reference_wrapper</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/basic_regex.html">regex</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/regex_error.html">regex_error</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/regex_iterator.html">regex_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html">regex_token_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/regex_traits.html">regex_traits</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/remove_all_extents.html">remove_all_extents</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/remove_cv.html">remove_const</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/remove_cv.html">remove_cv</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/remove_extent.html">remove_extent</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/remove_pointer.html">remove_pointer</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/remove_reference.html">remove_reference</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/remove_cv.html">remove_volatile</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/result_of.html">result_of</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/reverse_iterator.html">reverse_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/runtime_error.html">runtime_error</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor.html">scoped_allocator_adaptor</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/seed_seq.html">seed_seq</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set.html">set</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/shared_future.html">shared_future</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/shared_lock.html">shared_lock</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>shared_mutex</b></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">shared_ptr</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/shared_timed_mutex.html">shared_timed_mutex</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine.html">shuffle_order_engine</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/sig_atomic_t.html">sig_atomic_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">size_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>smart_ptr</b></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/match_results.html">smatch</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>span</b></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/regex_iterator.html">sregex_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html">sregex_token_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/sub_match.html">ssub_match</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">stack</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_streambuf.html">streambuf</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/streamoff.html">streamoff</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/fpos.html">streampos</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/streamsize.html">streamsize</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">string</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>string_view</b></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_stringbuf.html">stringbuf</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">stringstream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/strstream.html">strstream</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/strstreambuf.html">strstreambuf</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution.html">student_t_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/sub_match.html">sub_match</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html">subtract_with_carry_engine</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/system_error.html">system_error</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">tera</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/terminate_handler.html">terminate_handler</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/thread.html">thread</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/time_base.html">time_base</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/time_get.html">time_get</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/time_get_byname.html">time_get_byname</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/time_put.html">time_put</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/time_put_byname.html">time_put_byname</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time_t.html">time_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/timed_mutex.html">timed_mutex</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/tm.html">tm</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">true_type</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/lock_tag_t.html">try_to_lock_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/type_index.html">type_index</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/type_info.html">type_info</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/fpos.html">u16streampos</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">u16string</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>u16string_view</b></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/fpos.html">u32streampos</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">u32string</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>u32string_view</b></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>u8string</b></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>u8string_view</b></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">uint16_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">uint32_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">uint64_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">uint8_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">uint_fast16_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">uint_fast32_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">uint_fast64_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">uint_fast8_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">uint_least16_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">uint_least32_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">uint_least64_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">uint_least8_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">uintmax_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">uintptr_t</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/unary_function.html">unary_function</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html">unary_negate</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/underflow_error.html">underflow_error</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/underlying_type.html">underlying_type</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/unexpected_handler.html">unexpected_handler</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution.html">uniform_int_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution.html">uniform_real_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/unique_lock.html">unique_lock</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">unique_ptr</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">unordered_map</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_multimap.html">unordered_multimap</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_multiset.html">unordered_multiset</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_set.html">unordered_set</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/uses_allocator.html">uses_allocator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">valarray</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/wbuffer_convert.html">wbuffer_convert</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">wcerr</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">wcin</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">wclog</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/match_results.html">wcmatch</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">wcout</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/regex_iterator.html">wcregex_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html">wcregex_token_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/sub_match.html">wcsub_match</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/weak_ptr.html">weak_ptr</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution.html">weibull_distribution</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_filebuf.html">wfilebuf</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_fstream.html">wfstream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ifstream.html">wifstream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>wios</b></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_iostream.html">wiostream</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">wistream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istringstream.html">wistringstream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">wofstream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">wostream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostringstream.html">wostringstream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/basic_regex.html">wregex</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/match_results.html">wsmatch</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/regex_iterator.html">wsregex_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html">wsregex_token_iterator</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/sub_match.html">wssub_match</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_streambuf.html">wstreambuf</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/fpos.html">wstreampos</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">wstring</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/wstring_convert.html">wstring_convert</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><b>wstring_view</b></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_stringbuf.html">wstringbuf</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">wstringstream</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">STL class. <br /></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">yocto</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">yotta</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html">zetta</a></td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-</table><table class="memberdecls">
-<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
-Functions</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html">atomic_fetch_and_explicit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_fetch_xor.html">atomic_fetch_xor_explicit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/set_unexpected.html">set_unexpected</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fputs.html">fputs</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/modf.html">modf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/not2.html">not2</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strlen.html">strlen</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp2.html">exp2</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setiosflags.html">setiosflags</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/adjacent_difference.html">adjacent_difference</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">cos</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fwscanf.html">fwscanf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_init.html">atomic_init</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple/forward_as_tuple.html">forward_as_tuple</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/abort.html">abort</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcsncmp.html">wcsncmp</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/set_intersection.html">set_intersection</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_signal_fence.html">atomic_signal_fence</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/abs.html">llabs</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/make_move_iterator.html">make_move_iterator</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fscanf.html">scanf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/nextafter.html">nextafter</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html">stol</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strcspn.html">strcspn</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/ungetwc.html">ungetwc</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/transform.html">transform</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fputc.html">putc</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/iswdigit.html">iswdigit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/rint.html">rint</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/memset.html">memset</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/isgraph.html">isgraph</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/replace_copy.html">replace_copy_if</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/scalbn.html">scalbn</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/partial_sort_copy.html">partial_sort_copy</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/make_exception_ptr.html">make_exception_ptr</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/frexp.html">frexp</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/isxdigit.html">isxdigit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_exchange.html">atomic_exchange_explicit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fwprintf.html">wprintf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fdim.html">fdim</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wctype.html">wctype</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc32.html">mbrtoc32</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">setw</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/get_temporary_buffer.html">get_temporary_buffer</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fmax.html">fmax</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_thread_fence.html">atomic_thread_fence</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_exchange.html">atomic_exchange</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fgetwc.html">fgetwc</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fwprintf.html">swprintf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/prev_permutation.html">prev_permutation</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">max_element</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/set_symmetric_difference.html">set_symmetric_difference</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcscpy.html">wcscpy</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html">const_pointer_cast</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/minmax_element.html">minmax_element</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcstok.html">wcstok</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/ref.html">ref</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/fenv/feupdateenv.html">feupdateenv</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">endl</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wmemmove.html">wmemmove</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fmin.html">fmin</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/uninitialized_fill_n.html">uninitialized_fill_n</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/uppercase.html">nouppercase</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/showpos.html">noshowpos</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/ctime.html">ctime</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wmemset.html">wmemset</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/iswpunct.html">iswpunct</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/pop_heap.html">pop_heap</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fprintf.html">sprintf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/fixed.html">fixed</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">make_shared</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/make_heap.html">make_heap</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fmod.html">fmod</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">atol</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/uninitialized_copy.html">uninitialized_copy</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html">dynamic_pointer_cast</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/set_union.html">set_union</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/fixed.html">hexfloat</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/vfwprintf.html">vswprintf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/asctime.html">asctime</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/iswspace.html">iswspace</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/nan.html">nan</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">sort</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/quick_exit.html">quick_exit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log10.html">log10</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/multibyte/mbstowcs.html">mbstowcs</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/isspace.html">isspace</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strncat.html">strncat</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/isinf.html">isinf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atof.html">atof</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/erf.html">erf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted_until.html">is_sorted_until</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cbrt.html">cbrt</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log1p.html">log1p</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/return_temporary_buffer.html">return_temporary_buffer</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/multibyte/mbsrtowcs.html">mbsrtowcs</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/fenv/feraiseexcept.html">feraiseexcept</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fseek.html">fseek</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_fetch_or.html">atomic_fetch_or_explicit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">log</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/putchar.html">putchar</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html">make_tuple</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/expm1.html">expm1</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fma.html">fma</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/remove_copy.html">remove_copy_if</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/showpoint.html">showpoint</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fscanf.html">fscanf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/stable_partition.html">stable_partition</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/fill_n.html">fill_n</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/remove_copy.html">remove_copy</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html">atomic_compare_exchange_strong_explicit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/multibyte/wctomb.html">wctomb</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fgets.html">fgets</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/remainder.html">remainder</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/allocate_shared.html">allocate_shared</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/unique.html">unique</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/includes.html">includes</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/iswalnum.html">iswalnum</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">exit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/put_time.html">put_time</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html">to_string</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_heap_until.html">is_heap_until</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcstof.html">wcstold</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html">stold</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/ftell.html">ftell</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/copy_backward.html">copy_backward</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcstol.html">wcstoll</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/perror.html">perror</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/vfwscanf.html">vwscanf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/stable_sort.html">stable_sort</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/generic_category.html">generic_category</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/abs.html">abs(int)</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fgetws.html">fgetws</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/showpos.html">showpos</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">exp</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/fill.html">fill</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/isalpha.html">isalpha</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/lgamma.html">lgamma</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/fenv/feclearexcept.html">feclearexcept</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcsncpy.html">wcsncpy</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/gc/undeclare_reachable.html">undeclare_reachable</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/hex.html">oct</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strspn.html">strspn</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/c/realloc.html">realloc</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/copy.html">copy</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/binary_search.html">binary_search</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/system_category.html">system_category</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/multibyte/mbrtowc.html">mbrtowc</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strtof.html">strtof</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/mem_fn.html">mem_fn</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">distance</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/lock.html">lock</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strcmp.html">strcmp</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/tmpfile.html">tmpfile</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/hypot.html">hypot</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/getenv.html">getenv</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strrchr.html">strrchr</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/count.html">count</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/tan.html">tan</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/strftime.html">strftime</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html">stod</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/towupper.html">towupper</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">atoll</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_store.html">atomic_store</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html">stoi</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/rethrow_exception.html">rethrow_exception</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">sin</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html">atomic_fetch_sub_explicit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/unexpected.html">unexpected</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/multibyte/mbtowc.html">mbtowc</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/get_time.html">get_time</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/partition.html">partition</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/isfinite.html">isfinite</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/boolalpha.html">boolalpha</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/fenv/fetestexcept.html">fetestexcept</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/multibyte/mbrlen.html">mbrlen</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/iswgraph.html">iswgraph</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">time</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html">atomic_compare_exchange_strong</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcschr.html">wcschr</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/uppercase.html">uppercase</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/lower_bound.html">lower_bound</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/copy.html">copy_if</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/isnan.html">isnan</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/has_facet.html">has_facet</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/kill_dependency.html">kill_dependency</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/uninitialized_copy_n.html">uninitialized_copy_n</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/fenv/feholdexcept.html">feholdexcept</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/div.html">div</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/at_quick_exit.html">at_quick_exit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcspbrk.html">wcspbrk</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/search.html">search</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/find_first_of.html">find_first_of</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/iota.html">iota</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/gc/declare_reachable.html">declare_reachable</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html">atomic_compare_exchange_weak</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strtof.html">strtod</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html">accumulate</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcsrchr.html">wcsrchr</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min_element.html">min_element</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/clearerr.html">clearerr</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html">random_shuffle</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/iswalpha.html">iswalpha</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html">atomic_fetch_and</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wmemchr.html">wmemchr</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/bsearch.html">bsearch</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/ilogb.html">ilogb</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/unique_copy.html">unique_copy</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/_Exit.html">_Exit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">move</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/find_end.html">find_end</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/fenv/feexceptflag.html">fesetexceptflag</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/nth_element.html">nth_element</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/gets.html">gets</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/lexicographical_compare.html">lexicographical_compare</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/nearbyint.html">nearbyint</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/memcpy.html">memcpy</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fwrite.html">fwrite</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/unitbuf.html">unitbuf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/iswlower.html">iswlower</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/multibyte/mblen.html">mblen</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fwscanf.html">swscanf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcstoimax.html">wcstoimax</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fprintf.html">fprintf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/find.html">find_if</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strtoimax.html">strtoimax</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/isalnum.html">isalnum</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_fetch_add.html">atomic_fetch_add_explicit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/push_heap.html">push_heap</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fwprintf.html">fwprintf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/uncaught_exception.html">uncaught_exception</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strtol.html">strtoll</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/throw_with_nested.html">throw_with_nested</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html">shuffle</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/isprint.html">isprint</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/new/get_new_handler.html">get_new_handler</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/call_once.html">call_once</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/trunc.html">trunc</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcscspn.html">wcscspn</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc16.html">mbrtoc16</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">lround</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">pow</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/tgamma.html">tgamma</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/erfc.html">erfc</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">llround</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">abs(float)</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/asinh.html">asinh</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/feof.html">feof</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/skipws.html">noskipws</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/find.html">find</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">atoi</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/not1.html">not1</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/vfscanf.html">vfscanf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html">stof</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/regex_search.html">regex_search</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/rotate_copy.html">rotate_copy</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/new/set_new_handler.html">set_new_handler</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/gc/undeclare_no_pointers.html">undeclare_no_pointers</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/async.html">async</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/partition_point.html">partition_point</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/vfscanf.html">vsscanf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/fenv/feround.html">fesetround</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_is_lock_free.html">atomic_is_lock_free</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/tanh.html">tanh</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/div.html">ldiv</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setbase.html">setbase</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/remove.html">remove</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strtol.html">strtol</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strpbrk.html">strpbrk</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/signbit.html">signbit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcsncat.html">wcsncat</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/get_money.html">get_money</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/set_difference.html">set_difference</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/ref.html">cref</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html">getline</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/to_wstring.html">to_wstring</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/system.html">system</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html">static_pointer_cast</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcstoimax.html">wcstoumax</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/memmove.html">memmove</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/getwchar.html">getwchar</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/fixed.html">scientific</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/wcsftime.html">wcsftime</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">begin</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/ceil.html">ceil</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sinh.html">sinh</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_permutation.html">is_permutation</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/generate_n.html">generate_n</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/acosh.html">acosh</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/advance.html">advance</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/flush.html">flush</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_fetch_xor.html">atomic_fetch_xor</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/ws.html">ws</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/signal.html">signal</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/showbase.html">noshowbase</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/generate.html">generate</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/ldexp.html">ldexp</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/vfprintf.html">vsnprintf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/remove.html">remove_if</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/stoul.html">stoull</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/fenv/feexceptflag.html">fegetexceptflag</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/find.html">find_if_not</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/merge.html">merge</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/c/free.html">free</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/count.html">count_if</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">clock</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/mktime.html">mktime</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/inserter.html">inserter</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/puts.html">puts</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/asin.html">asin</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/iscntrl.html">iscntrl</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/difftime.html">difftime</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/terminate.html">terminate</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/memcmp.html">memcmp</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/uninitialized_fill.html">uninitialized_fill</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/hex.html">hex</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">tie</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/back_inserter.html">back_inserter</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/upper_bound.html">upper_bound</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/adjacent_find.html">adjacent_find</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/use_facet.html">use_facet</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/vfwprintf.html">vfwprintf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_fetch_add.html">atomic_fetch_add</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fsetpos.html">fsetpos</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/c/malloc.html">malloc</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/localtime.html">localtime</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcscmp.html">wcscmp</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/multibyte/c32rtomb.html">c32rtomb</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/isupper.html">isupper</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcstof.html">wcstod</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/tolower.html">tolower</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort_heap.html">sort_heap</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/isdigit.html">isdigit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcslen.html">wcslen</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wmemcmp.html">wmemcmp</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move_if_noexcept.html">move_if_noexcept</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/declval.html">declval</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fpclassify.html">fpclassify</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/iswupper.html">iswupper</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">rand</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html">atomic_compare_exchange_weak_explicit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/partial_sort.html">partial_sort</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/rint.html">llrint</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fclose.html">fclose</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">reverse</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/partial_sum.html">partial_sum</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/showbase.html">showbase</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/vfwscanf.html">vswscanf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/atan.html">atan</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/atanh.html">atanh</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/iter_swap.html">iter_swap</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/scalbn.html">scalbln</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse_copy.html">reverse_copy</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/forward.html">forward</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fgetc.html">getc</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/equal_range.html">equal_range</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html">atomic_fetch_sub</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_partitioned.html">is_partitioned</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/next_permutation.html">next_permutation</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/isblank.html">isblank</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/showpoint.html">noshowpoint</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/atan2.html">atan2</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/nan.html">nanf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/towctrans.html">towctrans</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fputwc.html">fputwc</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strtoul.html">strtoul</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_heap.html">is_heap</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fflush.html">fflush</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strtoimax.html">strtoumax</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/nextafter.html">nexttoward</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/unitbuf.html">nounitbuf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/ispunct.html">ispunct</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/boolalpha.html">noboolalpha</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">make_pair</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/iswctype.html">iswctype</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">srand</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/replace_copy.html">replace_copy</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/future/future_category.html">future_category</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/resetiosflags.html">resetiosflags</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/vfprintf.html">vprintf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/gmtime.html">gmtime</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/align.html">align</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple/tuple_cat.html">tuple_cat</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/ends.html">ends</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/set_terminate.html">set_terminate</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/rint.html">lrint</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html">none_of</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fwscanf.html">wscanf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fputc.html">fputc</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/hex.html">dec</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strcat.html">strcat</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/raise.html">raise</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcsspn.html">wcsspn</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">fabs</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wmemcpy.html">wmemcpy</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/copy_n.html">copy_n</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/rethrow_if_nested.html">rethrow_if_nested</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/setlocale.html">setlocale</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/addressof.html">addressof</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/c/calloc.html">calloc</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strerror.html">strerror</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strcpy.html">strcpy</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcstoul.html">wcstoull</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/multibyte/c16rtomb.html">c16rtomb</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/generate_canonical.html">generate_canonical</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/vfprintf.html">vfprintf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/notify_all_at_thread_exit.html">notify_all_at_thread_exit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/rotate.html">rotate</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/current_exception.html">current_exception</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strtok.html">strtok</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcscat.html">wcscat</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strncpy.html">strncpy</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/towlower.html">towlower</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/floor.html">floor</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">left</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/ferror.html">ferror</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_load.html">atomic_load_explicit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">swap</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/acos.html">acos</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcscoll.html">wcscoll</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">sqrt</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/multibyte/mbsinit.html">mbsinit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/qsort.html">qsort</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html">stoll</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/put_money.html">put_money</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcstoul.html">wcstoul</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcstol.html">wcstol</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/atexit.html">atexit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_fetch_or.html">atomic_fetch_or</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/rewind.html">rewind</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcsxfrm.html">wcsxfrm</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">round</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/vfwprintf.html">vwprintf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html">all_of</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/replace.html">replace</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/remquo.html">remquo</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/setbuf.html">setbuf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strncmp.html">strncmp</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/locale/localeconv.html">localeconv</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wctrans.html">wctrans</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html">any_of</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/equal.html">equal</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">max</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strxfrm.html">strxfrm</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/iswxdigit.html">iswxdigit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/abs.html">labs</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/regex_match.html">regex_match</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fputws.html">fputws</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/multibyte/wcrtomb.html">wcrtomb</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setprecision.html">setprecision</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/setvbuf.html">setvbuf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/regex/regex_replace.html">regex_replace</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/freopen.html">freopen</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/logb.html">logb</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/multibyte/wctob.html">wctob</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_load.html">atomic_load</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/search_n.html">search_n</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/toupper.html">toupper</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/move_backward.html">move_backward</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">is_sorted</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strtoul.html">strtoull</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/iswblank.html">iswblank</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/gc/get_pointer_safety.html">get_pointer_safety</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/get_unexpected.html">get_unexpected</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fscanf.html">sscanf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/fenv/feenv.html">fesetenv</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/atomic/atomic_store.html">atomic_store_explicit</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strtof.html">strtold</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fread.html">fread</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/memchr.html">memchr</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/multibyte/btowc.html">btowc</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/replace.html">replace_if</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strcoll.html">strcoll</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/vfprintf.html">vsprintf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/mismatch.html">mismatch</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/getchar.html">getchar</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/islower.html">islower</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/tmpnam.html">tmpnam</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/nan.html">nanl</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fopen.html">fopen</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/for_each.html">for_each</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/fenv/feround.html">fegetround</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/ungetc.html">ungetc</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">internal</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/vfwscanf.html">vfwscanf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fgetc.html">fgetc</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcstof.html">wcstof</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/bind.html">bind</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/skipws.html">skipws</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/iswprint.html">iswprint</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/multibyte/wcstombs.html">wcstombs</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/inplace_merge.html">inplace_merge</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/copysign.html">copysign</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/putwchar.html">putwchar</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/wcsstr.html">wcsstr</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/fenv/feenv.html">fegetenv</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/longjmp.html">longjmp</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/wide/iswcntrl.html">iswcntrl</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/gc/declare_no_pointers.html">declare_no_pointers</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/isnormal.html">isnormal</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap_ranges.html">swap_ranges</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/minmax.html">minmax</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/fixed.html">defaultfloat</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/rename.html">rename</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fprintf.html">snprintf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/thread/try_lock.html">try_lock</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/stoul.html">stoul</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fgetpos.html">fgetpos</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/partition_copy.html">partition_copy</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/vfscanf.html">vscanf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/front_inserter.html">front_inserter</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/get_terminate.html">get_terminate</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cosh.html">cosh</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strchr.html">strchr</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strstr.html">strstr</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fprintf.html">printf</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">setfill</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a id="" name=""></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/inner_product.html">inner_product</a> (T... args)</td></tr>
-<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-</table>
-<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
-<div class="textblock"><p>STL namespace. </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="../../d8/dcc/namespacestd.html">std</a></li>
-    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
-  </ul>
-</div>
-</body>
-</html>
diff --git a/d8/dcc/namespacestd.js b/d8/dcc/namespacestd.js
deleted file mode 100644
index 0bacdb353..000000000
--- a/d8/dcc/namespacestd.js
+++ /dev/null
@@ -1,552 +0,0 @@
-var namespacestd =
-[
-    [ "chrono", "http://en.cppreference.com/w/d4/d0c/namespacestd_1_1chrono.html", [
-      [ "duration_cast", "http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html", null ],
-      [ "time_point_cast", "http://en.cppreference.com/w/cpp/chrono/time_point/time_point_cast.html", null ]
-    ] ],
-    [ "experimental", "http://en.cppreference.com/w/de/d97/namespacestd_1_1experimental.html", [
-      [ "make_optional", "http://en.cppreference.com/w/cpp/experimental/optional/make_optional.html", null ]
-    ] ],
-    [ "regex_constants", "http://en.cppreference.com/w/db/da4/namespacestd_1_1regex__constants.html", null ],
-    [ "rel_ops", "http://en.cppreference.com/w/da/d42/namespacestd_1_1rel__ops.html", [
-      [ "operator!=", "http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html", null ],
-      [ "operator<=", "http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html", null ],
-      [ "operator>", "http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html", null ],
-      [ "operator>=", "http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html", null ]
-    ] ],
-    [ "this_thread", "http://en.cppreference.com/w/d7/dbf/namespacestd_1_1this__thread.html", [
-      [ "get_id", "http://en.cppreference.com/w/cpp/thread/get_id.html", null ],
-      [ "sleep_for", "http://en.cppreference.com/w/cpp/thread/sleep_for.html", null ],
-      [ "sleep_until", "http://en.cppreference.com/w/cpp/thread/sleep_until.html", null ],
-      [ "yield", "http://en.cppreference.com/w/cpp/thread/yield.html", null ]
-    ] ],
-    [ "is_arithmetic< uint128_t >", "d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html", null ],
-    [ "is_arithmetic< uint256_t >", "dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html", null ],
-    [ "is_integral< uint128_t >", "d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html", null ],
-    [ "is_integral< uint256_t >", "d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html", null ],
-    [ "is_unsigned< uint128_t >", "d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html", null ],
-    [ "is_unsigned< uint256_t >", "df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html", null ],
-    [ "_Exit", "http://en.cppreference.com/w/cpp/utility/program/_Exit.html", null ],
-    [ "abort", "http://en.cppreference.com/w/cpp/utility/program/abort.html", null ],
-    [ "abs(float)", "http://en.cppreference.com/w/cpp/numeric/math/fabs.html", null ],
-    [ "abs(int)", "http://en.cppreference.com/w/cpp/numeric/math/abs.html", null ],
-    [ "accumulate", "http://en.cppreference.com/w/cpp/algorithm/accumulate.html", null ],
-    [ "acos", "http://en.cppreference.com/w/cpp/numeric/math/acos.html", null ],
-    [ "acosh", "http://en.cppreference.com/w/cpp/numeric/math/acosh.html", null ],
-    [ "addressof", "http://en.cppreference.com/w/cpp/memory/addressof.html", null ],
-    [ "adjacent_difference", "http://en.cppreference.com/w/cpp/algorithm/adjacent_difference.html", null ],
-    [ "adjacent_find", "http://en.cppreference.com/w/cpp/algorithm/adjacent_find.html", null ],
-    [ "advance", "http://en.cppreference.com/w/cpp/iterator/advance.html", null ],
-    [ "align", "http://en.cppreference.com/w/cpp/memory/align.html", null ],
-    [ "all_of", "http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html", null ],
-    [ "allocate_shared", "http://en.cppreference.com/w/cpp/memory/shared_ptr/allocate_shared.html", null ],
-    [ "any_of", "http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html", null ],
-    [ "asctime", "http://en.cppreference.com/w/cpp/chrono/c/asctime.html", null ],
-    [ "asin", "http://en.cppreference.com/w/cpp/numeric/math/asin.html", null ],
-    [ "asinh", "http://en.cppreference.com/w/cpp/numeric/math/asinh.html", null ],
-    [ "async", "http://en.cppreference.com/w/cpp/thread/async.html", null ],
-    [ "at_quick_exit", "http://en.cppreference.com/w/cpp/utility/program/at_quick_exit.html", null ],
-    [ "atan", "http://en.cppreference.com/w/cpp/numeric/math/atan.html", null ],
-    [ "atan2", "http://en.cppreference.com/w/cpp/numeric/math/atan2.html", null ],
-    [ "atanh", "http://en.cppreference.com/w/cpp/numeric/math/atanh.html", null ],
-    [ "atexit", "http://en.cppreference.com/w/cpp/utility/program/atexit.html", null ],
-    [ "atof", "http://en.cppreference.com/w/cpp/string/byte/atof.html", null ],
-    [ "atoi", "http://en.cppreference.com/w/cpp/string/byte/atoi.html", null ],
-    [ "atol", "http://en.cppreference.com/w/cpp/string/byte/atoi.html", null ],
-    [ "atoll", "http://en.cppreference.com/w/cpp/string/byte/atoi.html", null ],
-    [ "atomic_compare_exchange_strong", "http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html", null ],
-    [ "atomic_compare_exchange_strong_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html", null ],
-    [ "atomic_compare_exchange_weak", "http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html", null ],
-    [ "atomic_compare_exchange_weak_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html", null ],
-    [ "atomic_exchange", "http://en.cppreference.com/w/cpp/atomic/atomic_exchange.html", null ],
-    [ "atomic_exchange_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_exchange.html", null ],
-    [ "atomic_fetch_add", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_add.html", null ],
-    [ "atomic_fetch_add_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_add.html", null ],
-    [ "atomic_fetch_and", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html", null ],
-    [ "atomic_fetch_and_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html", null ],
-    [ "atomic_fetch_or", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_or.html", null ],
-    [ "atomic_fetch_or_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_or.html", null ],
-    [ "atomic_fetch_sub", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html", null ],
-    [ "atomic_fetch_sub_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html", null ],
-    [ "atomic_fetch_xor", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_xor.html", null ],
-    [ "atomic_fetch_xor_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_fetch_xor.html", null ],
-    [ "atomic_init", "http://en.cppreference.com/w/cpp/atomic/atomic_init.html", null ],
-    [ "atomic_is_lock_free", "http://en.cppreference.com/w/cpp/atomic/atomic_is_lock_free.html", null ],
-    [ "atomic_load", "http://en.cppreference.com/w/cpp/atomic/atomic_load.html", null ],
-    [ "atomic_load_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_load.html", null ],
-    [ "atomic_signal_fence", "http://en.cppreference.com/w/cpp/atomic/atomic_signal_fence.html", null ],
-    [ "atomic_store", "http://en.cppreference.com/w/cpp/atomic/atomic_store.html", null ],
-    [ "atomic_store_explicit", "http://en.cppreference.com/w/cpp/atomic/atomic_store.html", null ],
-    [ "atomic_thread_fence", "http://en.cppreference.com/w/cpp/atomic/atomic_thread_fence.html", null ],
-    [ "back_inserter", "http://en.cppreference.com/w/cpp/iterator/back_inserter.html", null ],
-    [ "begin", "http://en.cppreference.com/w/cpp/iterator/begin.html", null ],
-    [ "binary_search", "http://en.cppreference.com/w/cpp/algorithm/binary_search.html", null ],
-    [ "bind", "http://en.cppreference.com/w/cpp/utility/functional/bind.html", null ],
-    [ "boolalpha", "http://en.cppreference.com/w/cpp/io/manip/boolalpha.html", null ],
-    [ "bsearch", "http://en.cppreference.com/w/cpp/algorithm/bsearch.html", null ],
-    [ "btowc", "http://en.cppreference.com/w/cpp/string/multibyte/btowc.html", null ],
-    [ "c16rtomb", "http://en.cppreference.com/w/cpp/string/multibyte/c16rtomb.html", null ],
-    [ "c32rtomb", "http://en.cppreference.com/w/cpp/string/multibyte/c32rtomb.html", null ],
-    [ "call_once", "http://en.cppreference.com/w/cpp/thread/call_once.html", null ],
-    [ "calloc", "http://en.cppreference.com/w/cpp/memory/c/calloc.html", null ],
-    [ "cbrt", "http://en.cppreference.com/w/cpp/numeric/math/cbrt.html", null ],
-    [ "ceil", "http://en.cppreference.com/w/cpp/numeric/math/ceil.html", null ],
-    [ "clearerr", "http://en.cppreference.com/w/cpp/io/c/clearerr.html", null ],
-    [ "clock", "http://en.cppreference.com/w/cpp/chrono/c/clock.html", null ],
-    [ "const_pointer_cast", "http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html", null ],
-    [ "copy", "http://en.cppreference.com/w/cpp/algorithm/copy.html", null ],
-    [ "copy_backward", "http://en.cppreference.com/w/cpp/algorithm/copy_backward.html", null ],
-    [ "copy_if", "http://en.cppreference.com/w/cpp/algorithm/copy.html", null ],
-    [ "copy_n", "http://en.cppreference.com/w/cpp/algorithm/copy_n.html", null ],
-    [ "copysign", "http://en.cppreference.com/w/cpp/numeric/math/copysign.html", null ],
-    [ "cos", "http://en.cppreference.com/w/cpp/numeric/math/cos.html", null ],
-    [ "cosh", "http://en.cppreference.com/w/cpp/numeric/math/cosh.html", null ],
-    [ "count", "http://en.cppreference.com/w/cpp/algorithm/count.html", null ],
-    [ "count_if", "http://en.cppreference.com/w/cpp/algorithm/count.html", null ],
-    [ "cref", "http://en.cppreference.com/w/cpp/utility/functional/ref.html", null ],
-    [ "ctime", "http://en.cppreference.com/w/cpp/chrono/c/ctime.html", null ],
-    [ "current_exception", "http://en.cppreference.com/w/cpp/error/current_exception.html", null ],
-    [ "dec", "http://en.cppreference.com/w/cpp/io/manip/hex.html", null ],
-    [ "declare_no_pointers", "http://en.cppreference.com/w/cpp/memory/gc/declare_no_pointers.html", null ],
-    [ "declare_reachable", "http://en.cppreference.com/w/cpp/memory/gc/declare_reachable.html", null ],
-    [ "declval", "http://en.cppreference.com/w/cpp/utility/declval.html", null ],
-    [ "defaultfloat", "http://en.cppreference.com/w/cpp/io/manip/fixed.html", null ],
-    [ "difftime", "http://en.cppreference.com/w/cpp/chrono/c/difftime.html", null ],
-    [ "distance", "http://en.cppreference.com/w/cpp/iterator/distance.html", null ],
-    [ "div", "http://en.cppreference.com/w/cpp/numeric/math/div.html", null ],
-    [ "dynamic_pointer_cast", "http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html", null ],
-    [ "end", "http://en.cppreference.com/w/cpp/iterator/end.html", null ],
-    [ "endl", "http://en.cppreference.com/w/cpp/io/manip/endl.html", null ],
-    [ "ends", "http://en.cppreference.com/w/cpp/io/manip/ends.html", null ],
-    [ "equal", "http://en.cppreference.com/w/cpp/algorithm/equal.html", null ],
-    [ "equal_range", "http://en.cppreference.com/w/cpp/algorithm/equal_range.html", null ],
-    [ "erf", "http://en.cppreference.com/w/cpp/numeric/math/erf.html", null ],
-    [ "erfc", "http://en.cppreference.com/w/cpp/numeric/math/erfc.html", null ],
-    [ "exit", "http://en.cppreference.com/w/cpp/utility/program/exit.html", null ],
-    [ "exp", "http://en.cppreference.com/w/cpp/numeric/math/exp.html", null ],
-    [ "exp2", "http://en.cppreference.com/w/cpp/numeric/math/exp2.html", null ],
-    [ "expm1", "http://en.cppreference.com/w/cpp/numeric/math/expm1.html", null ],
-    [ "fabs", "http://en.cppreference.com/w/cpp/numeric/math/fabs.html", null ],
-    [ "fclose", "http://en.cppreference.com/w/cpp/io/c/fclose.html", null ],
-    [ "fdim", "http://en.cppreference.com/w/cpp/numeric/math/fdim.html", null ],
-    [ "feclearexcept", "http://en.cppreference.com/w/cpp/numeric/fenv/feclearexcept.html", null ],
-    [ "fegetenv", "http://en.cppreference.com/w/cpp/numeric/fenv/feenv.html", null ],
-    [ "fegetexceptflag", "http://en.cppreference.com/w/cpp/numeric/fenv/feexceptflag.html", null ],
-    [ "fegetround", "http://en.cppreference.com/w/cpp/numeric/fenv/feround.html", null ],
-    [ "feholdexcept", "http://en.cppreference.com/w/cpp/numeric/fenv/feholdexcept.html", null ],
-    [ "feof", "http://en.cppreference.com/w/cpp/io/c/feof.html", null ],
-    [ "feraiseexcept", "http://en.cppreference.com/w/cpp/numeric/fenv/feraiseexcept.html", null ],
-    [ "ferror", "http://en.cppreference.com/w/cpp/io/c/ferror.html", null ],
-    [ "fesetenv", "http://en.cppreference.com/w/cpp/numeric/fenv/feenv.html", null ],
-    [ "fesetexceptflag", "http://en.cppreference.com/w/cpp/numeric/fenv/feexceptflag.html", null ],
-    [ "fesetround", "http://en.cppreference.com/w/cpp/numeric/fenv/feround.html", null ],
-    [ "fetestexcept", "http://en.cppreference.com/w/cpp/numeric/fenv/fetestexcept.html", null ],
-    [ "feupdateenv", "http://en.cppreference.com/w/cpp/numeric/fenv/feupdateenv.html", null ],
-    [ "fflush", "http://en.cppreference.com/w/cpp/io/c/fflush.html", null ],
-    [ "fgetc", "http://en.cppreference.com/w/cpp/io/c/fgetc.html", null ],
-    [ "fgetpos", "http://en.cppreference.com/w/cpp/io/c/fgetpos.html", null ],
-    [ "fgets", "http://en.cppreference.com/w/cpp/io/c/fgets.html", null ],
-    [ "fgetwc", "http://en.cppreference.com/w/cpp/io/c/fgetwc.html", null ],
-    [ "fgetws", "http://en.cppreference.com/w/cpp/io/c/fgetws.html", null ],
-    [ "fill", "http://en.cppreference.com/w/cpp/algorithm/fill.html", null ],
-    [ "fill_n", "http://en.cppreference.com/w/cpp/algorithm/fill_n.html", null ],
-    [ "find", "http://en.cppreference.com/w/cpp/algorithm/find.html", null ],
-    [ "find_end", "http://en.cppreference.com/w/cpp/algorithm/find_end.html", null ],
-    [ "find_first_of", "http://en.cppreference.com/w/cpp/algorithm/find_first_of.html", null ],
-    [ "find_if", "http://en.cppreference.com/w/cpp/algorithm/find.html", null ],
-    [ "find_if_not", "http://en.cppreference.com/w/cpp/algorithm/find.html", null ],
-    [ "fixed", "http://en.cppreference.com/w/cpp/io/manip/fixed.html", null ],
-    [ "floor", "http://en.cppreference.com/w/cpp/numeric/math/floor.html", null ],
-    [ "flush", "http://en.cppreference.com/w/cpp/io/manip/flush.html", null ],
-    [ "fma", "http://en.cppreference.com/w/cpp/numeric/math/fma.html", null ],
-    [ "fmax", "http://en.cppreference.com/w/cpp/numeric/math/fmax.html", null ],
-    [ "fmin", "http://en.cppreference.com/w/cpp/numeric/math/fmin.html", null ],
-    [ "fmod", "http://en.cppreference.com/w/cpp/numeric/math/fmod.html", null ],
-    [ "fopen", "http://en.cppreference.com/w/cpp/io/c/fopen.html", null ],
-    [ "for_each", "http://en.cppreference.com/w/cpp/algorithm/for_each.html", null ],
-    [ "forward", "http://en.cppreference.com/w/cpp/utility/forward.html", null ],
-    [ "forward_as_tuple", "http://en.cppreference.com/w/cpp/utility/tuple/forward_as_tuple.html", null ],
-    [ "fpclassify", "http://en.cppreference.com/w/cpp/numeric/math/fpclassify.html", null ],
-    [ "fprintf", "http://en.cppreference.com/w/cpp/io/c/fprintf.html", null ],
-    [ "fputc", "http://en.cppreference.com/w/cpp/io/c/fputc.html", null ],
-    [ "fputs", "http://en.cppreference.com/w/cpp/io/c/fputs.html", null ],
-    [ "fputwc", "http://en.cppreference.com/w/cpp/io/c/fputwc.html", null ],
-    [ "fputws", "http://en.cppreference.com/w/cpp/io/c/fputws.html", null ],
-    [ "fread", "http://en.cppreference.com/w/cpp/io/c/fread.html", null ],
-    [ "free", "http://en.cppreference.com/w/cpp/memory/c/free.html", null ],
-    [ "freopen", "http://en.cppreference.com/w/cpp/io/c/freopen.html", null ],
-    [ "frexp", "http://en.cppreference.com/w/cpp/numeric/math/frexp.html", null ],
-    [ "front_inserter", "http://en.cppreference.com/w/cpp/iterator/front_inserter.html", null ],
-    [ "fscanf", "http://en.cppreference.com/w/cpp/io/c/fscanf.html", null ],
-    [ "fseek", "http://en.cppreference.com/w/cpp/io/c/fseek.html", null ],
-    [ "fsetpos", "http://en.cppreference.com/w/cpp/io/c/fsetpos.html", null ],
-    [ "ftell", "http://en.cppreference.com/w/cpp/io/c/ftell.html", null ],
-    [ "future_category", "http://en.cppreference.com/w/cpp/thread/future/future_category.html", null ],
-    [ "fwprintf", "http://en.cppreference.com/w/cpp/io/c/fwprintf.html", null ],
-    [ "fwrite", "http://en.cppreference.com/w/cpp/io/c/fwrite.html", null ],
-    [ "fwscanf", "http://en.cppreference.com/w/cpp/io/c/fwscanf.html", null ],
-    [ "generate", "http://en.cppreference.com/w/cpp/algorithm/generate.html", null ],
-    [ "generate_canonical", "http://en.cppreference.com/w/cpp/numeric/random/generate_canonical.html", null ],
-    [ "generate_n", "http://en.cppreference.com/w/cpp/algorithm/generate_n.html", null ],
-    [ "generic_category", "http://en.cppreference.com/w/cpp/error/generic_category.html", null ],
-    [ "get_money", "http://en.cppreference.com/w/cpp/io/manip/get_money.html", null ],
-    [ "get_new_handler", "http://en.cppreference.com/w/cpp/memory/new/get_new_handler.html", null ],
-    [ "get_pointer_safety", "http://en.cppreference.com/w/cpp/memory/gc/get_pointer_safety.html", null ],
-    [ "get_temporary_buffer", "http://en.cppreference.com/w/cpp/memory/get_temporary_buffer.html", null ],
-    [ "get_terminate", "http://en.cppreference.com/w/cpp/error/get_terminate.html", null ],
-    [ "get_time", "http://en.cppreference.com/w/cpp/io/manip/get_time.html", null ],
-    [ "get_unexpected", "http://en.cppreference.com/w/cpp/error/get_unexpected.html", null ],
-    [ "getc", "http://en.cppreference.com/w/cpp/io/c/fgetc.html", null ],
-    [ "getchar", "http://en.cppreference.com/w/cpp/io/c/getchar.html", null ],
-    [ "getenv", "http://en.cppreference.com/w/cpp/utility/program/getenv.html", null ],
-    [ "getline", "http://en.cppreference.com/w/cpp/string/basic_string/getline.html", null ],
-    [ "gets", "http://en.cppreference.com/w/cpp/io/c/gets.html", null ],
-    [ "getwchar", "http://en.cppreference.com/w/cpp/io/c/getwchar.html", null ],
-    [ "gmtime", "http://en.cppreference.com/w/cpp/chrono/c/gmtime.html", null ],
-    [ "has_facet", "http://en.cppreference.com/w/cpp/locale/has_facet.html", null ],
-    [ "hex", "http://en.cppreference.com/w/cpp/io/manip/hex.html", null ],
-    [ "hexfloat", "http://en.cppreference.com/w/cpp/io/manip/fixed.html", null ],
-    [ "hypot", "http://en.cppreference.com/w/cpp/numeric/math/hypot.html", null ],
-    [ "ilogb", "http://en.cppreference.com/w/cpp/numeric/math/ilogb.html", null ],
-    [ "includes", "http://en.cppreference.com/w/cpp/algorithm/includes.html", null ],
-    [ "inner_product", "http://en.cppreference.com/w/cpp/algorithm/inner_product.html", null ],
-    [ "inplace_merge", "http://en.cppreference.com/w/cpp/algorithm/inplace_merge.html", null ],
-    [ "inserter", "http://en.cppreference.com/w/cpp/iterator/inserter.html", null ],
-    [ "internal", "http://en.cppreference.com/w/cpp/io/manip/left.html", null ],
-    [ "iota", "http://en.cppreference.com/w/cpp/algorithm/iota.html", null ],
-    [ "is_heap", "http://en.cppreference.com/w/cpp/algorithm/is_heap.html", null ],
-    [ "is_heap_until", "http://en.cppreference.com/w/cpp/algorithm/is_heap_until.html", null ],
-    [ "is_partitioned", "http://en.cppreference.com/w/cpp/algorithm/is_partitioned.html", null ],
-    [ "is_permutation", "http://en.cppreference.com/w/cpp/algorithm/is_permutation.html", null ],
-    [ "is_sorted", "http://en.cppreference.com/w/cpp/algorithm/is_sorted.html", null ],
-    [ "is_sorted_until", "http://en.cppreference.com/w/cpp/algorithm/is_sorted_until.html", null ],
-    [ "isalnum", "http://en.cppreference.com/w/cpp/string/byte/isalnum.html", null ],
-    [ "isalpha", "http://en.cppreference.com/w/cpp/string/byte/isalpha.html", null ],
-    [ "isblank", "http://en.cppreference.com/w/cpp/string/byte/isblank.html", null ],
-    [ "iscntrl", "http://en.cppreference.com/w/cpp/string/byte/iscntrl.html", null ],
-    [ "isdigit", "http://en.cppreference.com/w/cpp/string/byte/isdigit.html", null ],
-    [ "isfinite", "http://en.cppreference.com/w/cpp/numeric/math/isfinite.html", null ],
-    [ "isgraph", "http://en.cppreference.com/w/cpp/string/byte/isgraph.html", null ],
-    [ "isinf", "http://en.cppreference.com/w/cpp/numeric/math/isinf.html", null ],
-    [ "islower", "http://en.cppreference.com/w/cpp/string/byte/islower.html", null ],
-    [ "isnan", "http://en.cppreference.com/w/cpp/numeric/math/isnan.html", null ],
-    [ "isnormal", "http://en.cppreference.com/w/cpp/numeric/math/isnormal.html", null ],
-    [ "isprint", "http://en.cppreference.com/w/cpp/string/byte/isprint.html", null ],
-    [ "ispunct", "http://en.cppreference.com/w/cpp/string/byte/ispunct.html", null ],
-    [ "isspace", "http://en.cppreference.com/w/cpp/string/byte/isspace.html", null ],
-    [ "isupper", "http://en.cppreference.com/w/cpp/string/byte/isupper.html", null ],
-    [ "iswalnum", "http://en.cppreference.com/w/cpp/string/wide/iswalnum.html", null ],
-    [ "iswalpha", "http://en.cppreference.com/w/cpp/string/wide/iswalpha.html", null ],
-    [ "iswblank", "http://en.cppreference.com/w/cpp/string/wide/iswblank.html", null ],
-    [ "iswcntrl", "http://en.cppreference.com/w/cpp/string/wide/iswcntrl.html", null ],
-    [ "iswctype", "http://en.cppreference.com/w/cpp/string/wide/iswctype.html", null ],
-    [ "iswdigit", "http://en.cppreference.com/w/cpp/string/wide/iswdigit.html", null ],
-    [ "iswgraph", "http://en.cppreference.com/w/cpp/string/wide/iswgraph.html", null ],
-    [ "iswlower", "http://en.cppreference.com/w/cpp/string/wide/iswlower.html", null ],
-    [ "iswprint", "http://en.cppreference.com/w/cpp/string/wide/iswprint.html", null ],
-    [ "iswpunct", "http://en.cppreference.com/w/cpp/string/wide/iswpunct.html", null ],
-    [ "iswspace", "http://en.cppreference.com/w/cpp/string/wide/iswspace.html", null ],
-    [ "iswupper", "http://en.cppreference.com/w/cpp/string/wide/iswupper.html", null ],
-    [ "iswxdigit", "http://en.cppreference.com/w/cpp/string/wide/iswxdigit.html", null ],
-    [ "isxdigit", "http://en.cppreference.com/w/cpp/string/byte/isxdigit.html", null ],
-    [ "iter_swap", "http://en.cppreference.com/w/cpp/algorithm/iter_swap.html", null ],
-    [ "kill_dependency", "http://en.cppreference.com/w/cpp/atomic/kill_dependency.html", null ],
-    [ "labs", "http://en.cppreference.com/w/cpp/numeric/math/abs.html", null ],
-    [ "ldexp", "http://en.cppreference.com/w/cpp/numeric/math/ldexp.html", null ],
-    [ "ldiv", "http://en.cppreference.com/w/cpp/numeric/math/div.html", null ],
-    [ "left", "http://en.cppreference.com/w/cpp/io/manip/left.html", null ],
-    [ "lexicographical_compare", "http://en.cppreference.com/w/cpp/algorithm/lexicographical_compare.html", null ],
-    [ "lgamma", "http://en.cppreference.com/w/cpp/numeric/math/lgamma.html", null ],
-    [ "llabs", "http://en.cppreference.com/w/cpp/numeric/math/abs.html", null ],
-    [ "llrint", "http://en.cppreference.com/w/cpp/numeric/math/rint.html", null ],
-    [ "llround", "http://en.cppreference.com/w/cpp/numeric/math/round.html", null ],
-    [ "localeconv", "http://en.cppreference.com/w/cpp/locale/localeconv.html", null ],
-    [ "localtime", "http://en.cppreference.com/w/cpp/chrono/c/localtime.html", null ],
-    [ "lock", "http://en.cppreference.com/w/cpp/thread/lock.html", null ],
-    [ "log", "http://en.cppreference.com/w/cpp/numeric/math/log.html", null ],
-    [ "log10", "http://en.cppreference.com/w/cpp/numeric/math/log10.html", null ],
-    [ "log1p", "http://en.cppreference.com/w/cpp/numeric/math/log1p.html", null ],
-    [ "logb", "http://en.cppreference.com/w/cpp/numeric/math/logb.html", null ],
-    [ "longjmp", "http://en.cppreference.com/w/cpp/utility/program/longjmp.html", null ],
-    [ "lower_bound", "http://en.cppreference.com/w/cpp/algorithm/lower_bound.html", null ],
-    [ "lrint", "http://en.cppreference.com/w/cpp/numeric/math/rint.html", null ],
-    [ "lround", "http://en.cppreference.com/w/cpp/numeric/math/round.html", null ],
-    [ "make_exception_ptr", "http://en.cppreference.com/w/cpp/error/make_exception_ptr.html", null ],
-    [ "make_heap", "http://en.cppreference.com/w/cpp/algorithm/make_heap.html", null ],
-    [ "make_move_iterator", "http://en.cppreference.com/w/cpp/iterator/make_move_iterator.html", null ],
-    [ "make_pair", "http://en.cppreference.com/w/cpp/utility/pair/make_pair.html", null ],
-    [ "make_shared", "http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html", null ],
-    [ "make_tuple", "http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html", null ],
-    [ "malloc", "http://en.cppreference.com/w/cpp/memory/c/malloc.html", null ],
-    [ "max", "http://en.cppreference.com/w/cpp/algorithm/max.html", null ],
-    [ "max_element", "http://en.cppreference.com/w/cpp/algorithm/max_element.html", null ],
-    [ "mblen", "http://en.cppreference.com/w/cpp/string/multibyte/mblen.html", null ],
-    [ "mbrlen", "http://en.cppreference.com/w/cpp/string/multibyte/mbrlen.html", null ],
-    [ "mbrtoc16", "http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc16.html", null ],
-    [ "mbrtoc32", "http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc32.html", null ],
-    [ "mbrtowc", "http://en.cppreference.com/w/cpp/string/multibyte/mbrtowc.html", null ],
-    [ "mbsinit", "http://en.cppreference.com/w/cpp/string/multibyte/mbsinit.html", null ],
-    [ "mbsrtowcs", "http://en.cppreference.com/w/cpp/string/multibyte/mbsrtowcs.html", null ],
-    [ "mbstowcs", "http://en.cppreference.com/w/cpp/string/multibyte/mbstowcs.html", null ],
-    [ "mbtowc", "http://en.cppreference.com/w/cpp/string/multibyte/mbtowc.html", null ],
-    [ "mem_fn", "http://en.cppreference.com/w/cpp/utility/functional/mem_fn.html", null ],
-    [ "memchr", "http://en.cppreference.com/w/cpp/string/byte/memchr.html", null ],
-    [ "memcmp", "http://en.cppreference.com/w/cpp/string/byte/memcmp.html", null ],
-    [ "memcpy", "http://en.cppreference.com/w/cpp/string/byte/memcpy.html", null ],
-    [ "memmove", "http://en.cppreference.com/w/cpp/string/byte/memmove.html", null ],
-    [ "memset", "http://en.cppreference.com/w/cpp/string/byte/memset.html", null ],
-    [ "merge", "http://en.cppreference.com/w/cpp/algorithm/merge.html", null ],
-    [ "min", "http://en.cppreference.com/w/cpp/algorithm/min.html", null ],
-    [ "min_element", "http://en.cppreference.com/w/cpp/algorithm/min_element.html", null ],
-    [ "minmax", "http://en.cppreference.com/w/cpp/algorithm/minmax.html", null ],
-    [ "minmax_element", "http://en.cppreference.com/w/cpp/algorithm/minmax_element.html", null ],
-    [ "mismatch", "http://en.cppreference.com/w/cpp/algorithm/mismatch.html", null ],
-    [ "mktime", "http://en.cppreference.com/w/cpp/chrono/c/mktime.html", null ],
-    [ "modf", "http://en.cppreference.com/w/cpp/numeric/math/modf.html", null ],
-    [ "move", "http://en.cppreference.com/w/cpp/utility/move.html", null ],
-    [ "move_backward", "http://en.cppreference.com/w/cpp/algorithm/move_backward.html", null ],
-    [ "move_if_noexcept", "http://en.cppreference.com/w/cpp/utility/move_if_noexcept.html", null ],
-    [ "nan", "http://en.cppreference.com/w/cpp/numeric/math/nan.html", null ],
-    [ "nanf", "http://en.cppreference.com/w/cpp/numeric/math/nan.html", null ],
-    [ "nanl", "http://en.cppreference.com/w/cpp/numeric/math/nan.html", null ],
-    [ "nearbyint", "http://en.cppreference.com/w/cpp/numeric/math/nearbyint.html", null ],
-    [ "next", "http://en.cppreference.com/w/cpp/iterator/next.html", null ],
-    [ "next_permutation", "http://en.cppreference.com/w/cpp/algorithm/next_permutation.html", null ],
-    [ "nextafter", "http://en.cppreference.com/w/cpp/numeric/math/nextafter.html", null ],
-    [ "nexttoward", "http://en.cppreference.com/w/cpp/numeric/math/nextafter.html", null ],
-    [ "noboolalpha", "http://en.cppreference.com/w/cpp/io/manip/boolalpha.html", null ],
-    [ "none_of", "http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html", null ],
-    [ "noshowbase", "http://en.cppreference.com/w/cpp/io/manip/showbase.html", null ],
-    [ "noshowpoint", "http://en.cppreference.com/w/cpp/io/manip/showpoint.html", null ],
-    [ "noshowpos", "http://en.cppreference.com/w/cpp/io/manip/showpos.html", null ],
-    [ "noskipws", "http://en.cppreference.com/w/cpp/io/manip/skipws.html", null ],
-    [ "not1", "http://en.cppreference.com/w/cpp/utility/functional/not1.html", null ],
-    [ "not2", "http://en.cppreference.com/w/cpp/utility/functional/not2.html", null ],
-    [ "notify_all_at_thread_exit", "http://en.cppreference.com/w/cpp/thread/notify_all_at_thread_exit.html", null ],
-    [ "nounitbuf", "http://en.cppreference.com/w/cpp/io/manip/unitbuf.html", null ],
-    [ "nouppercase", "http://en.cppreference.com/w/cpp/io/manip/uppercase.html", null ],
-    [ "nth_element", "http://en.cppreference.com/w/cpp/algorithm/nth_element.html", null ],
-    [ "oct", "http://en.cppreference.com/w/cpp/io/manip/hex.html", null ],
-    [ "partial_sort", "http://en.cppreference.com/w/cpp/algorithm/partial_sort.html", null ],
-    [ "partial_sort_copy", "http://en.cppreference.com/w/cpp/algorithm/partial_sort_copy.html", null ],
-    [ "partial_sum", "http://en.cppreference.com/w/cpp/algorithm/partial_sum.html", null ],
-    [ "partition", "http://en.cppreference.com/w/cpp/algorithm/partition.html", null ],
-    [ "partition_copy", "http://en.cppreference.com/w/cpp/algorithm/partition_copy.html", null ],
-    [ "partition_point", "http://en.cppreference.com/w/cpp/algorithm/partition_point.html", null ],
-    [ "perror", "http://en.cppreference.com/w/cpp/io/c/perror.html", null ],
-    [ "pop_heap", "http://en.cppreference.com/w/cpp/algorithm/pop_heap.html", null ],
-    [ "pow", "http://en.cppreference.com/w/cpp/numeric/math/pow.html", null ],
-    [ "prev", "http://en.cppreference.com/w/cpp/iterator/prev.html", null ],
-    [ "prev_permutation", "http://en.cppreference.com/w/cpp/algorithm/prev_permutation.html", null ],
-    [ "printf", "http://en.cppreference.com/w/cpp/io/c/fprintf.html", null ],
-    [ "push_heap", "http://en.cppreference.com/w/cpp/algorithm/push_heap.html", null ],
-    [ "put_money", "http://en.cppreference.com/w/cpp/io/manip/put_money.html", null ],
-    [ "put_time", "http://en.cppreference.com/w/cpp/io/manip/put_time.html", null ],
-    [ "putc", "http://en.cppreference.com/w/cpp/io/c/fputc.html", null ],
-    [ "putchar", "http://en.cppreference.com/w/cpp/io/c/putchar.html", null ],
-    [ "puts", "http://en.cppreference.com/w/cpp/io/c/puts.html", null ],
-    [ "putwchar", "http://en.cppreference.com/w/cpp/io/c/putwchar.html", null ],
-    [ "qsort", "http://en.cppreference.com/w/cpp/algorithm/qsort.html", null ],
-    [ "quick_exit", "http://en.cppreference.com/w/cpp/utility/program/quick_exit.html", null ],
-    [ "raise", "http://en.cppreference.com/w/cpp/utility/program/raise.html", null ],
-    [ "rand", "http://en.cppreference.com/w/cpp/numeric/random/rand.html", null ],
-    [ "random_shuffle", "http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html", null ],
-    [ "realloc", "http://en.cppreference.com/w/cpp/memory/c/realloc.html", null ],
-    [ "ref", "http://en.cppreference.com/w/cpp/utility/functional/ref.html", null ],
-    [ "regex_match", "http://en.cppreference.com/w/cpp/regex/regex_match.html", null ],
-    [ "regex_replace", "http://en.cppreference.com/w/cpp/regex/regex_replace.html", null ],
-    [ "regex_search", "http://en.cppreference.com/w/cpp/regex/regex_search.html", null ],
-    [ "remainder", "http://en.cppreference.com/w/cpp/numeric/math/remainder.html", null ],
-    [ "remove", "http://en.cppreference.com/w/cpp/algorithm/remove.html", null ],
-    [ "remove_copy", "http://en.cppreference.com/w/cpp/algorithm/remove_copy.html", null ],
-    [ "remove_copy_if", "http://en.cppreference.com/w/cpp/algorithm/remove_copy.html", null ],
-    [ "remove_if", "http://en.cppreference.com/w/cpp/algorithm/remove.html", null ],
-    [ "remquo", "http://en.cppreference.com/w/cpp/numeric/math/remquo.html", null ],
-    [ "rename", "http://en.cppreference.com/w/cpp/io/c/rename.html", null ],
-    [ "replace", "http://en.cppreference.com/w/cpp/algorithm/replace.html", null ],
-    [ "replace_copy", "http://en.cppreference.com/w/cpp/algorithm/replace_copy.html", null ],
-    [ "replace_copy_if", "http://en.cppreference.com/w/cpp/algorithm/replace_copy.html", null ],
-    [ "replace_if", "http://en.cppreference.com/w/cpp/algorithm/replace.html", null ],
-    [ "resetiosflags", "http://en.cppreference.com/w/cpp/io/manip/resetiosflags.html", null ],
-    [ "rethrow_exception", "http://en.cppreference.com/w/cpp/error/rethrow_exception.html", null ],
-    [ "rethrow_if_nested", "http://en.cppreference.com/w/cpp/error/rethrow_if_nested.html", null ],
-    [ "return_temporary_buffer", "http://en.cppreference.com/w/cpp/memory/return_temporary_buffer.html", null ],
-    [ "reverse", "http://en.cppreference.com/w/cpp/algorithm/reverse.html", null ],
-    [ "reverse_copy", "http://en.cppreference.com/w/cpp/algorithm/reverse_copy.html", null ],
-    [ "rewind", "http://en.cppreference.com/w/cpp/io/c/rewind.html", null ],
-    [ "right", "http://en.cppreference.com/w/cpp/io/manip/left.html", null ],
-    [ "rint", "http://en.cppreference.com/w/cpp/numeric/math/rint.html", null ],
-    [ "rotate", "http://en.cppreference.com/w/cpp/algorithm/rotate.html", null ],
-    [ "rotate_copy", "http://en.cppreference.com/w/cpp/algorithm/rotate_copy.html", null ],
-    [ "round", "http://en.cppreference.com/w/cpp/numeric/math/round.html", null ],
-    [ "scalbln", "http://en.cppreference.com/w/cpp/numeric/math/scalbn.html", null ],
-    [ "scalbn", "http://en.cppreference.com/w/cpp/numeric/math/scalbn.html", null ],
-    [ "scanf", "http://en.cppreference.com/w/cpp/io/c/fscanf.html", null ],
-    [ "scientific", "http://en.cppreference.com/w/cpp/io/manip/fixed.html", null ],
-    [ "search", "http://en.cppreference.com/w/cpp/algorithm/search.html", null ],
-    [ "search_n", "http://en.cppreference.com/w/cpp/algorithm/search_n.html", null ],
-    [ "set_difference", "http://en.cppreference.com/w/cpp/algorithm/set_difference.html", null ],
-    [ "set_intersection", "http://en.cppreference.com/w/cpp/algorithm/set_intersection.html", null ],
-    [ "set_new_handler", "http://en.cppreference.com/w/cpp/memory/new/set_new_handler.html", null ],
-    [ "set_symmetric_difference", "http://en.cppreference.com/w/cpp/algorithm/set_symmetric_difference.html", null ],
-    [ "set_terminate", "http://en.cppreference.com/w/cpp/error/set_terminate.html", null ],
-    [ "set_unexpected", "http://en.cppreference.com/w/cpp/error/set_unexpected.html", null ],
-    [ "set_union", "http://en.cppreference.com/w/cpp/algorithm/set_union.html", null ],
-    [ "setbase", "http://en.cppreference.com/w/cpp/io/manip/setbase.html", null ],
-    [ "setbuf", "http://en.cppreference.com/w/cpp/io/c/setbuf.html", null ],
-    [ "setfill", "http://en.cppreference.com/w/cpp/io/manip/setfill.html", null ],
-    [ "setiosflags", "http://en.cppreference.com/w/cpp/io/manip/setiosflags.html", null ],
-    [ "setlocale", "http://en.cppreference.com/w/cpp/locale/setlocale.html", null ],
-    [ "setprecision", "http://en.cppreference.com/w/cpp/io/manip/setprecision.html", null ],
-    [ "setvbuf", "http://en.cppreference.com/w/cpp/io/c/setvbuf.html", null ],
-    [ "setw", "http://en.cppreference.com/w/cpp/io/manip/setw.html", null ],
-    [ "showbase", "http://en.cppreference.com/w/cpp/io/manip/showbase.html", null ],
-    [ "showpoint", "http://en.cppreference.com/w/cpp/io/manip/showpoint.html", null ],
-    [ "showpos", "http://en.cppreference.com/w/cpp/io/manip/showpos.html", null ],
-    [ "shuffle", "http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html", null ],
-    [ "signal", "http://en.cppreference.com/w/cpp/utility/program/signal.html", null ],
-    [ "signbit", "http://en.cppreference.com/w/cpp/numeric/math/signbit.html", null ],
-    [ "sin", "http://en.cppreference.com/w/cpp/numeric/math/sin.html", null ],
-    [ "sinh", "http://en.cppreference.com/w/cpp/numeric/math/sinh.html", null ],
-    [ "skipws", "http://en.cppreference.com/w/cpp/io/manip/skipws.html", null ],
-    [ "snprintf", "http://en.cppreference.com/w/cpp/io/c/fprintf.html", null ],
-    [ "sort", "http://en.cppreference.com/w/cpp/algorithm/sort.html", null ],
-    [ "sort_heap", "http://en.cppreference.com/w/cpp/algorithm/sort_heap.html", null ],
-    [ "sprintf", "http://en.cppreference.com/w/cpp/io/c/fprintf.html", null ],
-    [ "sqrt", "http://en.cppreference.com/w/cpp/numeric/math/sqrt.html", null ],
-    [ "srand", "http://en.cppreference.com/w/cpp/numeric/random/srand.html", null ],
-    [ "sscanf", "http://en.cppreference.com/w/cpp/io/c/fscanf.html", null ],
-    [ "stable_partition", "http://en.cppreference.com/w/cpp/algorithm/stable_partition.html", null ],
-    [ "stable_sort", "http://en.cppreference.com/w/cpp/algorithm/stable_sort.html", null ],
-    [ "static_pointer_cast", "http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html", null ],
-    [ "stod", "http://en.cppreference.com/w/cpp/string/basic_string/stof.html", null ],
-    [ "stof", "http://en.cppreference.com/w/cpp/string/basic_string/stof.html", null ],
-    [ "stoi", "http://en.cppreference.com/w/cpp/string/basic_string/stol.html", null ],
-    [ "stol", "http://en.cppreference.com/w/cpp/string/basic_string/stol.html", null ],
-    [ "stold", "http://en.cppreference.com/w/cpp/string/basic_string/stof.html", null ],
-    [ "stoll", "http://en.cppreference.com/w/cpp/string/basic_string/stol.html", null ],
-    [ "stoul", "http://en.cppreference.com/w/cpp/string/basic_string/stoul.html", null ],
-    [ "stoull", "http://en.cppreference.com/w/cpp/string/basic_string/stoul.html", null ],
-    [ "strcat", "http://en.cppreference.com/w/cpp/string/byte/strcat.html", null ],
-    [ "strchr", "http://en.cppreference.com/w/cpp/string/byte/strchr.html", null ],
-    [ "strcmp", "http://en.cppreference.com/w/cpp/string/byte/strcmp.html", null ],
-    [ "strcoll", "http://en.cppreference.com/w/cpp/string/byte/strcoll.html", null ],
-    [ "strcpy", "http://en.cppreference.com/w/cpp/string/byte/strcpy.html", null ],
-    [ "strcspn", "http://en.cppreference.com/w/cpp/string/byte/strcspn.html", null ],
-    [ "strerror", "http://en.cppreference.com/w/cpp/string/byte/strerror.html", null ],
-    [ "strftime", "http://en.cppreference.com/w/cpp/chrono/c/strftime.html", null ],
-    [ "strlen", "http://en.cppreference.com/w/cpp/string/byte/strlen.html", null ],
-    [ "strncat", "http://en.cppreference.com/w/cpp/string/byte/strncat.html", null ],
-    [ "strncmp", "http://en.cppreference.com/w/cpp/string/byte/strncmp.html", null ],
-    [ "strncpy", "http://en.cppreference.com/w/cpp/string/byte/strncpy.html", null ],
-    [ "strpbrk", "http://en.cppreference.com/w/cpp/string/byte/strpbrk.html", null ],
-    [ "strrchr", "http://en.cppreference.com/w/cpp/string/byte/strrchr.html", null ],
-    [ "strspn", "http://en.cppreference.com/w/cpp/string/byte/strspn.html", null ],
-    [ "strstr", "http://en.cppreference.com/w/cpp/string/byte/strstr.html", null ],
-    [ "strtod", "http://en.cppreference.com/w/cpp/string/byte/strtof.html", null ],
-    [ "strtof", "http://en.cppreference.com/w/cpp/string/byte/strtof.html", null ],
-    [ "strtoimax", "http://en.cppreference.com/w/cpp/string/byte/strtoimax.html", null ],
-    [ "strtok", "http://en.cppreference.com/w/cpp/string/byte/strtok.html", null ],
-    [ "strtol", "http://en.cppreference.com/w/cpp/string/byte/strtol.html", null ],
-    [ "strtold", "http://en.cppreference.com/w/cpp/string/byte/strtof.html", null ],
-    [ "strtoll", "http://en.cppreference.com/w/cpp/string/byte/strtol.html", null ],
-    [ "strtoul", "http://en.cppreference.com/w/cpp/string/byte/strtoul.html", null ],
-    [ "strtoull", "http://en.cppreference.com/w/cpp/string/byte/strtoul.html", null ],
-    [ "strtoumax", "http://en.cppreference.com/w/cpp/string/byte/strtoimax.html", null ],
-    [ "strxfrm", "http://en.cppreference.com/w/cpp/string/byte/strxfrm.html", null ],
-    [ "swap", "http://en.cppreference.com/w/cpp/algorithm/swap.html", null ],
-    [ "swap_ranges", "http://en.cppreference.com/w/cpp/algorithm/swap_ranges.html", null ],
-    [ "swprintf", "http://en.cppreference.com/w/cpp/io/c/fwprintf.html", null ],
-    [ "swscanf", "http://en.cppreference.com/w/cpp/io/c/fwscanf.html", null ],
-    [ "system", "http://en.cppreference.com/w/cpp/utility/program/system.html", null ],
-    [ "system_category", "http://en.cppreference.com/w/cpp/error/system_category.html", null ],
-    [ "tan", "http://en.cppreference.com/w/cpp/numeric/math/tan.html", null ],
-    [ "tanh", "http://en.cppreference.com/w/cpp/numeric/math/tanh.html", null ],
-    [ "terminate", "http://en.cppreference.com/w/cpp/error/terminate.html", null ],
-    [ "tgamma", "http://en.cppreference.com/w/cpp/numeric/math/tgamma.html", null ],
-    [ "throw_with_nested", "http://en.cppreference.com/w/cpp/error/throw_with_nested.html", null ],
-    [ "tie", "http://en.cppreference.com/w/cpp/utility/tuple/tie.html", null ],
-    [ "time", "http://en.cppreference.com/w/cpp/chrono/c/time.html", null ],
-    [ "tmpfile", "http://en.cppreference.com/w/cpp/io/c/tmpfile.html", null ],
-    [ "tmpnam", "http://en.cppreference.com/w/cpp/io/c/tmpnam.html", null ],
-    [ "to_string", "http://en.cppreference.com/w/cpp/string/basic_string/to_string.html", null ],
-    [ "to_wstring", "http://en.cppreference.com/w/cpp/string/basic_string/to_wstring.html", null ],
-    [ "tolower", "http://en.cppreference.com/w/cpp/string/byte/tolower.html", null ],
-    [ "toupper", "http://en.cppreference.com/w/cpp/string/byte/toupper.html", null ],
-    [ "towctrans", "http://en.cppreference.com/w/cpp/string/wide/towctrans.html", null ],
-    [ "towlower", "http://en.cppreference.com/w/cpp/string/wide/towlower.html", null ],
-    [ "towupper", "http://en.cppreference.com/w/cpp/string/wide/towupper.html", null ],
-    [ "transform", "http://en.cppreference.com/w/cpp/algorithm/transform.html", null ],
-    [ "trunc", "http://en.cppreference.com/w/cpp/numeric/math/trunc.html", null ],
-    [ "try_lock", "http://en.cppreference.com/w/cpp/thread/try_lock.html", null ],
-    [ "tuple_cat", "http://en.cppreference.com/w/cpp/utility/tuple/tuple_cat.html", null ],
-    [ "uncaught_exception", "http://en.cppreference.com/w/cpp/error/uncaught_exception.html", null ],
-    [ "undeclare_no_pointers", "http://en.cppreference.com/w/cpp/memory/gc/undeclare_no_pointers.html", null ],
-    [ "undeclare_reachable", "http://en.cppreference.com/w/cpp/memory/gc/undeclare_reachable.html", null ],
-    [ "unexpected", "http://en.cppreference.com/w/cpp/error/unexpected.html", null ],
-    [ "ungetc", "http://en.cppreference.com/w/cpp/io/c/ungetc.html", null ],
-    [ "ungetwc", "http://en.cppreference.com/w/cpp/io/c/ungetwc.html", null ],
-    [ "uninitialized_copy", "http://en.cppreference.com/w/cpp/memory/uninitialized_copy.html", null ],
-    [ "uninitialized_copy_n", "http://en.cppreference.com/w/cpp/memory/uninitialized_copy_n.html", null ],
-    [ "uninitialized_fill", "http://en.cppreference.com/w/cpp/memory/uninitialized_fill.html", null ],
-    [ "uninitialized_fill_n", "http://en.cppreference.com/w/cpp/memory/uninitialized_fill_n.html", null ],
-    [ "unique", "http://en.cppreference.com/w/cpp/algorithm/unique.html", null ],
-    [ "unique_copy", "http://en.cppreference.com/w/cpp/algorithm/unique_copy.html", null ],
-    [ "unitbuf", "http://en.cppreference.com/w/cpp/io/manip/unitbuf.html", null ],
-    [ "upper_bound", "http://en.cppreference.com/w/cpp/algorithm/upper_bound.html", null ],
-    [ "uppercase", "http://en.cppreference.com/w/cpp/io/manip/uppercase.html", null ],
-    [ "use_facet", "http://en.cppreference.com/w/cpp/locale/use_facet.html", null ],
-    [ "vfprintf", "http://en.cppreference.com/w/cpp/io/c/vfprintf.html", null ],
-    [ "vfscanf", "http://en.cppreference.com/w/cpp/io/c/vfscanf.html", null ],
-    [ "vfwprintf", "http://en.cppreference.com/w/cpp/io/c/vfwprintf.html", null ],
-    [ "vfwscanf", "http://en.cppreference.com/w/cpp/io/c/vfwscanf.html", null ],
-    [ "vprintf", "http://en.cppreference.com/w/cpp/io/c/vfprintf.html", null ],
-    [ "vscanf", "http://en.cppreference.com/w/cpp/io/c/vfscanf.html", null ],
-    [ "vsnprintf", "http://en.cppreference.com/w/cpp/io/c/vfprintf.html", null ],
-    [ "vsprintf", "http://en.cppreference.com/w/cpp/io/c/vfprintf.html", null ],
-    [ "vsscanf", "http://en.cppreference.com/w/cpp/io/c/vfscanf.html", null ],
-    [ "vswprintf", "http://en.cppreference.com/w/cpp/io/c/vfwprintf.html", null ],
-    [ "vswscanf", "http://en.cppreference.com/w/cpp/io/c/vfwscanf.html", null ],
-    [ "vwprintf", "http://en.cppreference.com/w/cpp/io/c/vfwprintf.html", null ],
-    [ "vwscanf", "http://en.cppreference.com/w/cpp/io/c/vfwscanf.html", null ],
-    [ "wcrtomb", "http://en.cppreference.com/w/cpp/string/multibyte/wcrtomb.html", null ],
-    [ "wcscat", "http://en.cppreference.com/w/cpp/string/wide/wcscat.html", null ],
-    [ "wcschr", "http://en.cppreference.com/w/cpp/string/wide/wcschr.html", null ],
-    [ "wcscmp", "http://en.cppreference.com/w/cpp/string/wide/wcscmp.html", null ],
-    [ "wcscoll", "http://en.cppreference.com/w/cpp/string/wide/wcscoll.html", null ],
-    [ "wcscpy", "http://en.cppreference.com/w/cpp/string/wide/wcscpy.html", null ],
-    [ "wcscspn", "http://en.cppreference.com/w/cpp/string/wide/wcscspn.html", null ],
-    [ "wcsftime", "http://en.cppreference.com/w/cpp/chrono/c/wcsftime.html", null ],
-    [ "wcslen", "http://en.cppreference.com/w/cpp/string/wide/wcslen.html", null ],
-    [ "wcsncat", "http://en.cppreference.com/w/cpp/string/wide/wcsncat.html", null ],
-    [ "wcsncmp", "http://en.cppreference.com/w/cpp/string/wide/wcsncmp.html", null ],
-    [ "wcsncpy", "http://en.cppreference.com/w/cpp/string/wide/wcsncpy.html", null ],
-    [ "wcspbrk", "http://en.cppreference.com/w/cpp/string/wide/wcspbrk.html", null ],
-    [ "wcsrchr", "http://en.cppreference.com/w/cpp/string/wide/wcsrchr.html", null ],
-    [ "wcsspn", "http://en.cppreference.com/w/cpp/string/wide/wcsspn.html", null ],
-    [ "wcsstr", "http://en.cppreference.com/w/cpp/string/wide/wcsstr.html", null ],
-    [ "wcstod", "http://en.cppreference.com/w/cpp/string/wide/wcstof.html", null ],
-    [ "wcstof", "http://en.cppreference.com/w/cpp/string/wide/wcstof.html", null ],
-    [ "wcstoimax", "http://en.cppreference.com/w/cpp/string/wide/wcstoimax.html", null ],
-    [ "wcstok", "http://en.cppreference.com/w/cpp/string/wide/wcstok.html", null ],
-    [ "wcstol", "http://en.cppreference.com/w/cpp/string/wide/wcstol.html", null ],
-    [ "wcstold", "http://en.cppreference.com/w/cpp/string/wide/wcstof.html", null ],
-    [ "wcstoll", "http://en.cppreference.com/w/cpp/string/wide/wcstol.html", null ],
-    [ "wcstombs", "http://en.cppreference.com/w/cpp/string/multibyte/wcstombs.html", null ],
-    [ "wcstoul", "http://en.cppreference.com/w/cpp/string/wide/wcstoul.html", null ],
-    [ "wcstoull", "http://en.cppreference.com/w/cpp/string/wide/wcstoul.html", null ],
-    [ "wcstoumax", "http://en.cppreference.com/w/cpp/string/wide/wcstoimax.html", null ],
-    [ "wcsxfrm", "http://en.cppreference.com/w/cpp/string/wide/wcsxfrm.html", null ],
-    [ "wctob", "http://en.cppreference.com/w/cpp/string/multibyte/wctob.html", null ],
-    [ "wctomb", "http://en.cppreference.com/w/cpp/string/multibyte/wctomb.html", null ],
-    [ "wctrans", "http://en.cppreference.com/w/cpp/string/wide/wctrans.html", null ],
-    [ "wctype", "http://en.cppreference.com/w/cpp/string/wide/wctype.html", null ],
-    [ "wmemchr", "http://en.cppreference.com/w/cpp/string/wide/wmemchr.html", null ],
-    [ "wmemcmp", "http://en.cppreference.com/w/cpp/string/wide/wmemcmp.html", null ],
-    [ "wmemcpy", "http://en.cppreference.com/w/cpp/string/wide/wmemcpy.html", null ],
-    [ "wmemmove", "http://en.cppreference.com/w/cpp/string/wide/wmemmove.html", null ],
-    [ "wmemset", "http://en.cppreference.com/w/cpp/string/wide/wmemset.html", null ],
-    [ "wprintf", "http://en.cppreference.com/w/cpp/io/c/fwprintf.html", null ],
-    [ "ws", "http://en.cppreference.com/w/cpp/io/manip/ws.html", null ],
-    [ "wscanf", "http://en.cppreference.com/w/cpp/io/c/fwscanf.html", null ]
-];
\ No newline at end of file
diff --git a/d8/dcd/namespacelru__cache.html b/d8/dcd/namespacelru__cache.html
index 78ccc1177..002283d0e 100644
--- a/d8/dcd/namespacelru__cache.html
+++ b/d8/dcd/namespacelru__cache.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: lru_cache Namespace Reference</title>
+<title>TheAlgorithms/C++: lru_cache Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d8/dce/test__queue_8cpp_source.html b/d8/dce/test__queue_8cpp_source.html
new file mode 100644
index 000000000..52f956f3f
--- /dev/null
+++ b/d8/dce/test__queue_8cpp_source.html
@@ -0,0 +1,238 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/test_queue.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/dce/test__queue_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">test_queue.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include &quot;./queue.hpp&quot;</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="keywordtype">void</span> testConstructedQueueIsEmpty() {</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>    <span class="keyword">const</span> <a class="code hl_class" href="../../db/da9/classqueue.html">queue&lt;T&gt;</a> curQueue;</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    assert(curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec">isEmptyQueue</a>());</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>}</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="keywordtype">void</span> testEnQueue() {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <a class="code hl_class" href="../../db/da9/classqueue.html">queue&lt;int&gt;</a> curQueue;</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">enQueue</a>(10);</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    assert(curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d">toVector</a>() == std::vector&lt;int&gt;({10}));</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">enQueue</a>(20);</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    assert(curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d">toVector</a>() == std::vector&lt;int&gt;({10, 20}));</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">enQueue</a>(30);</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">enQueue</a>(40);</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    assert(curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d">toVector</a>() == std::vector&lt;int&gt;({10, 20, 30, 40}));</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>}</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keywordtype">void</span> testDeQueue() {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <a class="code hl_class" href="../../db/da9/classqueue.html">queue&lt;int&gt;</a> curQueue;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">enQueue</a>(10);</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">enQueue</a>(20);</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">enQueue</a>(30);</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85">deQueue</a>();</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    assert(curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d">toVector</a>() == std::vector&lt;int&gt;({20, 30}));</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85">deQueue</a>();</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    assert(curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d">toVector</a>() == std::vector&lt;int&gt;({30}));</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85">deQueue</a>();</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    assert(curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec">isEmptyQueue</a>());</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>}</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="keywordtype">void</span> testFront() {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <a class="code hl_class" href="../../db/da9/classqueue.html">queue&lt;int&gt;</a> curQueue;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">enQueue</a>(10);</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    assert(curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">front</a>() == 10);</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">enQueue</a>(20);</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    assert(curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">front</a>() == 10);</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>}</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="keywordtype">void</span> testQueueAfterClearIsEmpty() {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <a class="code hl_class" href="../../db/da9/classqueue.html">queue&lt;int&gt;</a> curQueue;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">enQueue</a>(10);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">enQueue</a>(20);</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">enQueue</a>(30);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375">clear</a>();</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    assert(curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec">isEmptyQueue</a>());</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>}</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="keywordtype">void</span> testFrontThrowsAnInvalidArgumentWhenQueueEmpty() {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keyword">const</span> <a class="code hl_class" href="../../db/da9/classqueue.html">queue&lt;int&gt;</a> curQueue;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordtype">bool</span> wasException = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">try</span> {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">front</a>();</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::invalid_argument&amp;) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        wasException = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    assert(wasException);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>}</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="keywordtype">void</span> testDeQueueThrowsAnInvalidArgumentWhenQueueEmpty() {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <a class="code hl_class" href="../../db/da9/classqueue.html">queue&lt;int&gt;</a> curQueue;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordtype">bool</span> wasException = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keywordflow">try</span> {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        curQueue.<a class="code hl_function" href="../../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85">deQueue</a>();</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::invalid_argument&amp;) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        wasException = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    }</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    assert(wasException);</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>}</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    testConstructedQueueIsEmpty&lt;int&gt;();</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    testConstructedQueueIsEmpty&lt;double&gt;();</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    testConstructedQueueIsEmpty&lt;std::vector&lt;long double&gt;&gt;();</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    testEnQueue();</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    testDeQueue();</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    testQueueAfterClearIsEmpty();</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    testFrontThrowsAnInvalidArgumentWhenQueueEmpty();</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    testDeQueueThrowsAnInvalidArgumentWhenQueueEmpty();</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests pass!\n&quot;</span>;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>}</div>
+<div class="ttc" id="aclassqueue_html"><div class="ttname"><a href="../../db/da9/classqueue.html">queue</a></div><div class="ttdef"><b>Definition</b> <a href="../../d7/ded/queue_8hpp_source.html#l00009">queue.hpp:9</a></div></div>
+<div class="ttc" id="aclassqueue_html_a386fc1df8610948d3117b12f24655c7d"><div class="ttname"><a href="../../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d">queue::toVector</a></div><div class="ttdeci">std::vector&lt; value_type &gt; toVector() const</div><div class="ttdoc">converts the queue into the std::vector</div><div class="ttdef"><b>Definition</b> <a href="../../d7/ded/queue_8hpp_source.html#l00029">queue.hpp:29</a></div></div>
+<div class="ttc" id="aclassqueue_html_a4bc52ad6ed6b0cc33ad05f87f05f8bec"><div class="ttname"><a href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec">queue::isEmptyQueue</a></div><div class="ttdeci">bool isEmptyQueue() const</div><div class="ttdoc">checks if the queue has no elements</div><div class="ttdef"><b>Definition</b> <a href="../../d7/ded/queue_8hpp_source.html#l00049">queue.hpp:49</a></div></div>
+<div class="ttc" id="aclassqueue_html_a6ed7f8dfefe8687841f36f2223069375"><div class="ttname"><a href="../../db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375">queue::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdoc">removes all elements from the queue</div><div class="ttdef"><b>Definition</b> <a href="../../d7/ded/queue_8hpp_source.html#l00090">queue.hpp:90</a></div></div>
+<div class="ttc" id="aclassqueue_html_a75e231798bc706b8b0773a07f78713e7"><div class="ttname"><a href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">queue::front</a></div><div class="ttdeci">value_type front() const</div><div class="ttdef"><b>Definition</b> <a href="../../d7/ded/queue_8hpp_source.html#l00072">queue.hpp:72</a></div></div>
+<div class="ttc" id="aclassqueue_html_ada88d0c1f34946d66386b7a11bee4e4d"><div class="ttname"><a href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">queue::enQueue</a></div><div class="ttdeci">void enQueue(const value_type &amp;item)</div><div class="ttdoc">inserts a new item into the queue</div><div class="ttdef"><b>Definition</b> <a href="../../d7/ded/queue_8hpp_source.html#l00054">queue.hpp:54</a></div></div>
+<div class="ttc" id="aclassqueue_html_af27dbb72fb63f58f817a88550d7faa85"><div class="ttname"><a href="../../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85">queue::deQueue</a></div><div class="ttdeci">void deQueue()</div><div class="ttdoc">removes the first element from the queue</div><div class="ttdef"><b>Definition</b> <a href="../../d7/ded/queue_8hpp_source.html#l00081">queue.hpp:81</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><b>test_queue.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/dd5/check__factorial_8cpp.html b/d8/dd5/check__factorial_8cpp.html
index 0645a568b..9c790fbc3 100644
--- a/d8/dd5/check__factorial_8cpp.html
+++ b/d8/dd5/check__factorial_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/check_factorial.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/check_factorial.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for check_factorial.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/db1/check__factorial_8cpp__incl.svg" width="255" height="111"><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">
+</div>
+<p><a href="../../d8/dd5/check__factorial_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -146,6 +165,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/divyajyotiuk" target="_blank">Divyajyoti Ukirde</a> </dd>
 <dd>
 <a href="https://github.com/ewd00010" target="_blank">ewd00010</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/dd5/check__factorial_8cpp_source.html">check_factorial.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -164,17 +185,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dd5/check__factorial_8cpp_source.html#l00071">71</a> of file <a class="el" href="../../d8/dd5/check__factorial_8cpp_source.html">check_factorial.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   71</span>           {</div>
 <div class="line"><span class="lineno">   72</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   73</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   74</span>}</div>
-<div class="ttc" id="acheck__factorial_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> check_factorial.cpp:56</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/dd5/check__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="328" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acheck__factorial_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dd5/check__factorial_8cpp_source.html#l00056">check_factorial.cpp:56</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -202,6 +220,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dd5/check__factorial_8cpp_source.html#l00056">56</a> of file <a class="el" href="../../d8/dd5/check__factorial_8cpp_source.html">check_factorial.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   56</span>                    {</div>
 <div class="line"><span class="lineno">   57</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca">math::is_factorial</a>(50) == <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">   58</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca">math::is_factorial</a>(720) == <span class="keyword">true</span>);</div>
@@ -210,17 +230,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   61</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca">math::is_factorial</a>(479001600) == <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">   62</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca">math::is_factorial</a>(-24) == <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">   63</span> </div>
-<div class="line"><span class="lineno">   64</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!&quot;</span> &lt;&lt; <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">   64</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   65</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="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="anamespacemath_html_a6c72f756a7bf1b9043c357e3fe7814ca"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca">math::is_factorial</a></div><div class="ttdeci">bool is_factorial(uint64_t n)</div><div class="ttdoc">Function to check if the given number is factorial of some number or not.</div><div class="ttdef"><b>Definition</b> check_factorial.cpp:28</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/dd5/check__factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="231" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemath_html_a6c72f756a7bf1b9043c357e3fe7814ca"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca">math::is_factorial</a></div><div class="ttdeci">bool is_factorial(uint64_t n)</div><div class="ttdoc">Function to check if the given number is factorial of some number or not.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dd5/check__factorial_8cpp_source.html#l00028">check_factorial.cpp:28</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d8/dd5/check__factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d8/dd5/check__factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index d0ff9fc5a..000000000
--- a/d8/dd5/check__factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,31,56,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="129,5,200,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,36,113,25,114,30,56,41"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca" title="Function to check if the given number is factorial of some number or not." alt="" coords="104,55,225,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,45,89,51,88,56,55,51"/>
-</map>
diff --git a/d8/dd5/check__factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d8/dd5/check__factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 387afcd38..000000000
--- a/d8/dd5/check__factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bb4cf106e744478b1acb0488a265292d
\ No newline at end of file
diff --git a/d8/dd5/check__factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d8/dd5/check__factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index 4de484035..000000000
--- a/d8/dd5/check__factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="173pt" height="64pt"
- viewBox="0.00 0.00 172.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146,-56.25 92.5,-56.25 92.5,-37 146,-37 146,-56.25"/>
-<text text-anchor="middle" x="119.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.92,-31.11C50.03,-33.45 66.42,-36.61 81.24,-39.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.2,-42.84 90.68,-41.3 81.52,-35.97 80.2,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca" target="_top" xlink:title="Function to check if the given number is factorial of some number or not.">
-<polygon fill="white" stroke="#666666" points="164.75,-19.25 73.75,-19.25 73.75,0 164.75,0 164.75,-19.25"/>
-<text text-anchor="middle" x="119.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::is_factorial</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.92,-24.32C44.94,-23.04 53.4,-21.49 62.15,-19.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.62,-23.36 71.83,-18.12 61.36,-16.48 62.62,-23.36"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/dd5/check__factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d8/dd5/check__factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index 8ade3f290..000000000
--- a/d8/dd5/check__factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="173pt" height="64pt"
- viewBox="0.00 0.00 172.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146,-56.25 92.5,-56.25 92.5,-37 146,-37 146,-56.25"/>
-<text text-anchor="middle" x="119.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.92,-31.11C50.03,-33.45 66.42,-36.61 81.24,-39.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.2,-42.84 90.68,-41.3 81.52,-35.97 80.2,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca" target="_top" xlink:title="Function to check if the given number is factorial of some number or not.">
-<polygon fill="white" stroke="#666666" points="164.75,-19.25 73.75,-19.25 73.75,0 164.75,0 164.75,-19.25"/>
-<text text-anchor="middle" x="119.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::is_factorial</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.92,-24.32C44.94,-23.04 53.4,-21.49 62.15,-19.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.62,-23.36 71.83,-18.12 61.36,-16.48 62.62,-23.36"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/dd5/check__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/dd5/check__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 25a4d58f0..000000000
--- a/d8/dd5/check__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,31,153,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,41,88,41,88,46,55,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="226,5,297,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,36,210,25,211,30,154,41"/>
-<area shape="rect" id="Node000004" href="$dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca" title="Function to check if the given number is factorial of some number or not." alt="" coords="201,55,322,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="154,45,186,51,185,56,153,51"/>
-</map>
diff --git a/d8/dd5/check__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/dd5/check__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 0b2a52b94..000000000
--- a/d8/dd5/check__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8a2285fc86ab389758cc0ae7e80009db
\ No newline at end of file
diff --git a/d8/dd5/check__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/dd5/check__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 929c0e42f..000000000
--- a/d8/dd5/check__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="246pt" height="64pt"
- viewBox="0.00 0.00 245.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-37.25 73,-37.25 73,-18 110.75,-18 110.75,-37.25"/>
-<text text-anchor="middle" x="91.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-27.62C44.55,-27.62 53.37,-27.62 61.69,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-31.13 71.43,-27.63 61.43,-24.13 61.43,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219,-56.25 165.5,-56.25 165.5,-37 219,-37 219,-56.25"/>
-<text text-anchor="middle" x="192.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.92,-31.11C123.03,-33.45 139.42,-36.61 154.24,-39.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.2,-42.84 163.68,-41.3 154.52,-35.97 153.2,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca" target="_top" xlink:title="Function to check if the given number is factorial of some number or not.">
-<polygon fill="white" stroke="#666666" points="237.75,-19.25 146.75,-19.25 146.75,0 237.75,0 237.75,-19.25"/>
-<text text-anchor="middle" x="192.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::is_factorial</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.92,-24.32C117.94,-23.04 126.4,-21.49 135.15,-19.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.62,-23.36 144.83,-18.12 134.36,-16.48 135.62,-23.36"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/dd5/check__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/dd5/check__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 1db78476f..000000000
--- a/d8/dd5/check__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="246pt" height="64pt"
- viewBox="0.00 0.00 245.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-37.25 73,-37.25 73,-18 110.75,-18 110.75,-37.25"/>
-<text text-anchor="middle" x="91.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-27.62C44.55,-27.62 53.37,-27.62 61.69,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-31.13 71.43,-27.63 61.43,-24.13 61.43,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219,-56.25 165.5,-56.25 165.5,-37 219,-37 219,-56.25"/>
-<text text-anchor="middle" x="192.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.92,-31.11C123.03,-33.45 139.42,-36.61 154.24,-39.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.2,-42.84 163.68,-41.3 154.52,-35.97 153.2,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca" target="_top" xlink:title="Function to check if the given number is factorial of some number or not.">
-<polygon fill="white" stroke="#666666" points="237.75,-19.25 146.75,-19.25 146.75,0 237.75,0 237.75,-19.25"/>
-<text text-anchor="middle" x="192.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::is_factorial</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.92,-24.32C117.94,-23.04 126.4,-21.49 135.15,-19.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.62,-23.36 144.83,-18.12 134.36,-16.48 135.62,-23.36"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/dd5/check__factorial_8cpp_source.html b/d8/dd5/check__factorial_8cpp_source.html
new file mode 100644
index 000000000..5b7de3469
--- /dev/null
+++ b/d8/dd5/check__factorial_8cpp_source.html
@@ -0,0 +1,183 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/check_factorial.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/dd5/check__factorial_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">check_factorial.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/dd5/check__factorial_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="foldopen" id="foldopen00028" data-start="{" data-end="}">
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca">   28</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca">is_factorial</a>(uint64_t n) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordflow">if</span> (n &lt;= 0) {  <span class="comment">// factorial numbers are only ever positive Integers</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    }</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordtype">int</span> i = 2;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordflow">while</span> (n % i == 0) {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        n = n / i;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        i++;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">return</span> (n == 1);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>}</div>
+</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="foldopen" id="foldopen00056" data-start="{" data-end="}">
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="../../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">   56</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca">math::is_factorial</a>(50) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca">math::is_factorial</a>(720) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca">math::is_factorial</a>(0) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca">math::is_factorial</a>(1) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca">math::is_factorial</a>(479001600) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca">math::is_factorial</a>(-24) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>}</div>
+</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="foldopen" id="foldopen00071" data-start="{" data-end="}">
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"><a class="line" href="../../d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   71</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <a class="code hl_function" href="../../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>}</div>
+</div>
+<div class="ttc" id="acheck__factorial_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d8/dd5/check__factorial_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> <a href="#l00056">check_factorial.cpp:56</a></div></div>
+<div class="ttc" id="acheck__factorial_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00071">check_factorial.cpp:71</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_a6c72f756a7bf1b9043c357e3fe7814ca"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca">math::is_factorial</a></div><div class="ttdeci">bool is_factorial(uint64_t n)</div><div class="ttdoc">Function to check if the given number is factorial of some number or not.</div><div class="ttdef"><b>Definition</b> <a href="#l00028">check_factorial.cpp:28</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d8/dd5/check__factorial_8cpp.html">check_factorial.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp.html b/d8/ddf/sieve__of__eratosthenes_8cpp.html
index ec6cf1f2d..814e981e0 100644
--- a/d8/ddf/sieve__of__eratosthenes_8cpp.html
+++ b/d8/ddf/sieve__of__eratosthenes_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/sieve_of_eratosthenes.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/sieve_of_eratosthenes.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for sieve_of_eratosthenes.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d35/sieve__of__eratosthenes_8cpp__incl.svg" width="336" height="111"><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">
+</div>
+<p><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -134,10 +153,10 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a22be949d160b26361f7e323310f7fa0c" id="r_a22be949d160b26361f7e323310f7fa0c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a22be949d160b26361f7e323310f7fa0c">math::sieve_of_eratosthenes::sieve</a> (uint32_t N)</td></tr>
+<tr class="memitem:a22be949d160b26361f7e323310f7fa0c" id="r_a22be949d160b26361f7e323310f7fa0c"><td class="memItemLeft" align="right" valign="top">std::vector&lt; bool &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a22be949d160b26361f7e323310f7fa0c">math::sieve_of_eratosthenes::sieve</a> (uint32_t N)</td></tr>
 <tr class="memdesc:a22be949d160b26361f7e323310f7fa0c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to sieve out the primes.  <br /></td></tr>
 <tr class="separator:a22be949d160b26361f7e323310f7fa0c"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a55bc4a221e584d33b79b322432ecc0f3" id="r_a55bc4a221e584d33b79b322432ecc0f3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a55bc4a221e584d33b79b322432ecc0f3">math::sieve_of_eratosthenes::print</a> (uint32_t N, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; &amp;<a class="el" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">is_prime</a>)</td></tr>
+<tr class="memitem:a55bc4a221e584d33b79b322432ecc0f3" id="r_a55bc4a221e584d33b79b322432ecc0f3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a55bc4a221e584d33b79b322432ecc0f3">math::sieve_of_eratosthenes::print</a> (uint32_t N, const std::vector&lt; bool &gt; &amp;<a class="el" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">is_prime</a>)</td></tr>
 <tr class="memdesc:a55bc4a221e584d33b79b322432ecc0f3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to print the prime numbers.  <br /></td></tr>
 <tr class="separator:a55bc4a221e584d33b79b322432ecc0f3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
@@ -153,6 +172,8 @@ Functions</h2></td></tr>
 <p>Time Complexity : \(O(N \cdot\log \log N)\) <br  />
 Space Complexity : \(O(N)\)</p>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d4/d9c/primes__up__to__billion_8cpp.html" title="Compute prime numbers upto 1 billion.">primes_up_to_billion.cpp</a> <a class="el" href="../../de/d9b/prime__numbers_8cpp.html" title="Get list of prime numbers.">prime_numbers.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp_source.html">sieve_of_eratosthenes.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -171,17 +192,14 @@ Space Complexity : \(O(N)\)</p>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp_source.html#l00119">119</a> of file <a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp_source.html">sieve_of_eratosthenes.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  119</span>           {</div>
 <div class="line"><span class="lineno">  120</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();</div>
 <div class="line"><span class="lineno">  121</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  122</span>}</div>
-<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> sieve_of_eratosthenes.cpp:81</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="159" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/ddf/sieve__of__eratosthenes_8cpp_source.html#l00081">sieve_of_eratosthenes.cpp:81</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a55bc4a221e584d33b79b322432ecc0f3" name="a55bc4a221e584d33b79b322432ecc0f3"></a>
@@ -198,7 +216,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>is_prime</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; bool &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>is_prime</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -211,23 +229,18 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp_source.html#l00065">65</a> of file <a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp_source.html">sieve_of_eratosthenes.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   65</span>                                                        {</div>
 <div class="line"><span class="lineno">   66</span>    <span class="keywordflow">for</span> (uint32_t i = 2; i &lt;= <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
 <div class="line"><span class="lineno">   67</span>        <span class="keywordflow">if</span> (is_prime[i]) {</div>
-<div class="line"><span class="lineno">   68</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><span class="lineno">   68</span>            std::cout &lt;&lt; i &lt;&lt; <span class="charliteral">&#39; &#39;</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>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   71</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   72</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="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="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/ddf/sieve__of__eratosthenes_8cpp_a55bc4a221e584d33b79b322432ecc0f3_cgraph.svg" width="356" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a22be949d160b26361f7e323310f7fa0c" name="a22be949d160b26361f7e323310f7fa0c"></a>
@@ -237,7 +250,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; math::sieve_of_eratosthenes::sieve </td>
+          <td class="memname">std::vector&lt; bool &gt; math::sieve_of_eratosthenes::sieve </td>
           <td>(</td>
           <td class="paramtype">uint32_t</td>          <td class="paramname"><span class="paramname"><em>N</em></span></td><td>)</td>
           <td></td>
@@ -254,8 +267,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>is_prime a vector of <code>N + 1</code> booleans identifying if <code>i</code>^th number is a prime or not </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp_source.html#l00045">45</a> of file <a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp_source.html">sieve_of_eratosthenes.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   45</span>                                  {</div>
-<div class="line"><span class="lineno">   46</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a> <a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">is_prime</a>(N + 1, <span class="keyword">true</span>);  <span class="comment">// Initialize all as prime numbers</span></div>
+<div class="line"><span class="lineno">   46</span>    std::vector&lt;bool&gt; <a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">is_prime</a>(N + 1, <span class="keyword">true</span>);  <span class="comment">// Initialize all as prime numbers</span></div>
 <div class="line"><span class="lineno">   47</span>    <a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">is_prime</a>[0] = <a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">is_prime</a>[1] = <span class="keyword">false</span>;        <span class="comment">// 0 and 1 are not prime numbers</span></div>
 <div class="line"><span class="lineno">   48</span> </div>
 <div class="line"><span class="lineno">   49</span>    <span class="keywordflow">for</span> (uint32_t i = 2; i * i &lt;= <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
@@ -267,14 +282,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   55</span>    }</div>
 <div class="line"><span class="lineno">   56</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">is_prime</a>;</div>
 <div class="line"><span class="lineno">   57</span>}</div>
-<div class="ttc" id="anamespacemath_html_abd8f794b2229b42876169ff841b6e444"><div class="ttname"><a href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a></div><div class="ttdeci">bool is_prime(int64_t num)</div><div class="ttdoc">Function to check if the given number is prime or not.</div><div class="ttdef"><b>Definition</b> check_prime.cpp:31</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/ddf/sieve__of__eratosthenes_8cpp_a22be949d160b26361f7e323310f7fa0c_cgraph.svg" width="519" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemath_html_abd8f794b2229b42876169ff841b6e444"><div class="ttname"><a href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a></div><div class="ttdeci">bool is_prime(int64_t num)</div><div class="ttdoc">Function to check if the given number is prime or not.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d93/check__prime_8cpp_source.html#l00031">check_prime.cpp:31</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -302,25 +311,27 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp_source.html#l00081">81</a> of file <a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp_source.html">sieve_of_eratosthenes.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   81</span>                    {</div>
-<div class="line"><span class="lineno">   82</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a> is_prime_1 =</div>
+<div class="line"><span class="lineno">   82</span>    std::vector&lt;bool&gt; is_prime_1 =</div>
 <div class="line"><span class="lineno">   83</span>        <a class="code hl_function" href="#a22be949d160b26361f7e323310f7fa0c">math::sieve_of_eratosthenes::sieve</a>(<span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(10));</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&lt;bool&gt;</a> is_prime_2 =</div>
+<div class="line"><span class="lineno">   84</span>    std::vector&lt;bool&gt; is_prime_2 =</div>
 <div class="line"><span class="lineno">   85</span>        <a class="code hl_function" href="#a22be949d160b26361f7e323310f7fa0c">math::sieve_of_eratosthenes::sieve</a>(<span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(20));</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&lt;bool&gt;</a> is_prime_3 =</div>
+<div class="line"><span class="lineno">   86</span>    std::vector&lt;bool&gt; is_prime_3 =</div>
 <div class="line"><span class="lineno">   87</span>        <a class="code hl_function" href="#a22be949d160b26361f7e323310f7fa0c">math::sieve_of_eratosthenes::sieve</a>(<span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(100));</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&lt;bool&gt;</a> expected_1{<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">true</span>,</div>
+<div class="line"><span class="lineno">   89</span>    std::vector&lt;bool&gt; expected_1{<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">true</span>,</div>
 <div class="line"><span class="lineno">   90</span>                                 <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>};</div>
 <div class="line"><span class="lineno">   91</span>    assert(is_prime_1 == expected_1);</div>
 <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&lt;bool&gt;</a> expected_2{<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">true</span>,</div>
+<div class="line"><span class="lineno">   93</span>    std::vector&lt;bool&gt; expected_2{<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">true</span>,</div>
 <div class="line"><span class="lineno">   94</span>                                 <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,</div>
 <div class="line"><span class="lineno">   95</span>                                 <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,</div>
 <div class="line"><span class="lineno">   96</span>                                 <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>};</div>
 <div class="line"><span class="lineno">   97</span>    assert(is_prime_2 == expected_2);</div>
 <div class="line"><span class="lineno">   98</span> </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&lt;bool&gt;</a> expected_3{</div>
+<div class="line"><span class="lineno">   99</span>    std::vector&lt;bool&gt; expected_3{</div>
 <div class="line"><span class="lineno">  100</span>        <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>,</div>
 <div class="line"><span class="lineno">  101</span>        <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">true</span>,</div>
 <div class="line"><span class="lineno">  102</span>        <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,</div>
@@ -335,7 +346,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  111</span>    assert(is_prime_3 == expected_3);</div>
 <div class="line"><span class="lineno">  112</span> </div>
 <div class="line"><span class="lineno">  113</span>}</div>
-<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a22be949d160b26361f7e323310f7fa0c"><div class="ttname"><a href="#a22be949d160b26361f7e323310f7fa0c">math::sieve_of_eratosthenes::sieve</a></div><div class="ttdeci">std::vector&lt; bool &gt; sieve(uint32_t N)</div><div class="ttdoc">Function to sieve out the primes.</div><div class="ttdef"><b>Definition</b> sieve_of_eratosthenes.cpp:45</div></div>
+<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a22be949d160b26361f7e323310f7fa0c"><div class="ttname"><a href="#a22be949d160b26361f7e323310f7fa0c">math::sieve_of_eratosthenes::sieve</a></div><div class="ttdeci">std::vector&lt; bool &gt; sieve(uint32_t N)</div><div class="ttdoc">Function to sieve out the primes.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/ddf/sieve__of__eratosthenes_8cpp_source.html#l00045">sieve_of_eratosthenes.cpp:45</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_a22be949d160b26361f7e323310f7fa0c_cgraph.map b/d8/ddf/sieve__of__eratosthenes_8cpp_a22be949d160b26361f7e323310f7fa0c_cgraph.map
deleted file mode 100644
index dfff2987b..000000000
--- a/d8/ddf/sieve__of__eratosthenes_8cpp_a22be949d160b26361f7e323310f7fa0c_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="math::sieve_of_eratosthenes::sieve" name="math::sieve_of_eratosthenes::sieve">
-<area shape="rect" id="Node000001" title="Function to sieve out the primes." alt="" coords="5,23,195,64"/>
-<area shape="rect" id="Node000002" href="$dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444" title="Function to check if the given number is prime or not." alt="" coords="243,5,350,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="195,29,227,24,228,30,196,34"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f" title="Performs the sieve." alt="" coords="252,55,341,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="196,53,236,58,236,63,195,58"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="398,55,513,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="341,65,382,65,382,70,341,70"/>
-</map>
diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_a22be949d160b26361f7e323310f7fa0c_cgraph.md5 b/d8/ddf/sieve__of__eratosthenes_8cpp_a22be949d160b26361f7e323310f7fa0c_cgraph.md5
deleted file mode 100644
index 65abae766..000000000
--- a/d8/ddf/sieve__of__eratosthenes_8cpp_a22be949d160b26361f7e323310f7fa0c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ad9cd93d2518e7fdf126525fd0eaca18
\ No newline at end of file
diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_a22be949d160b26361f7e323310f7fa0c_cgraph.svg b/d8/ddf/sieve__of__eratosthenes_8cpp_a22be949d160b26361f7e323310f7fa0c_cgraph.svg
deleted file mode 100644
index 060c3a5db..000000000
--- a/d8/ddf/sieve__of__eratosthenes_8cpp_a22be949d160b26361f7e323310f7fa0c_cgraph.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::sieve_of_eratosthenes::sieve Pages: 1 -->
-<svg width="389pt" height="64pt"
- viewBox="0.00 0.00 389.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>math::sieve_of_eratosthenes::sieve</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to sieve out the primes.">
-<polygon fill="#999999" stroke="#666666" points="142,-42.88 0,-42.88 0,-12.37 142,-12.37 142,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::sieve_of_eratosthenes</text>
-<text text-anchor="middle" x="71" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::sieve</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444" target="_top" xlink:title="Function to check if the given number is prime or not.">
-<polygon fill="white" stroke="#666666" points="258.5,-56.25 178,-56.25 178,-37 258.5,-37 258.5,-56.25"/>
-<text text-anchor="middle" x="218.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::is_prime</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.5,-36.85C150.56,-37.9 158.66,-38.96 166.4,-39.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.94,-43.44 176.3,-41.27 166.84,-36.5 165.94,-43.44"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f" target="_top" xlink:title="Performs the sieve.">
-<polygon fill="white" stroke="#666666" points="251.75,-19.25 184.75,-19.25 184.75,0 251.75,0 251.75,-19.25"/>
-<text text-anchor="middle" x="218.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sieve</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.5,-18.89C152.88,-17.6 163.32,-16.31 172.96,-15.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.28,-18.6 182.78,-13.9 172.42,-11.65 173.28,-18.6"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="381,-19.25 294.5,-19.25 294.5,0 381,0 381,-19.25"/>
-<text text-anchor="middle" x="337.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.98,-9.62C261.55,-9.62 272.28,-9.62 282.81,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.57,-13.13 292.57,-9.63 282.57,-6.13 282.57,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_a22be949d160b26361f7e323310f7fa0c_cgraph_org.svg b/d8/ddf/sieve__of__eratosthenes_8cpp_a22be949d160b26361f7e323310f7fa0c_cgraph_org.svg
deleted file mode 100644
index 19d5b1527..000000000
--- a/d8/ddf/sieve__of__eratosthenes_8cpp_a22be949d160b26361f7e323310f7fa0c_cgraph_org.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::sieve_of_eratosthenes::sieve Pages: 1 -->
-<svg width="389pt" height="64pt"
- viewBox="0.00 0.00 389.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>math::sieve_of_eratosthenes::sieve</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to sieve out the primes.">
-<polygon fill="#999999" stroke="#666666" points="142,-42.88 0,-42.88 0,-12.37 142,-12.37 142,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::sieve_of_eratosthenes</text>
-<text text-anchor="middle" x="71" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::sieve</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444" target="_top" xlink:title="Function to check if the given number is prime or not.">
-<polygon fill="white" stroke="#666666" points="258.5,-56.25 178,-56.25 178,-37 258.5,-37 258.5,-56.25"/>
-<text text-anchor="middle" x="218.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::is_prime</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.5,-36.85C150.56,-37.9 158.66,-38.96 166.4,-39.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.94,-43.44 176.3,-41.27 166.84,-36.5 165.94,-43.44"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f" target="_top" xlink:title="Performs the sieve.">
-<polygon fill="white" stroke="#666666" points="251.75,-19.25 184.75,-19.25 184.75,0 251.75,0 251.75,-19.25"/>
-<text text-anchor="middle" x="218.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sieve</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.5,-18.89C152.88,-17.6 163.32,-16.31 172.96,-15.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.28,-18.6 182.78,-13.9 172.42,-11.65 173.28,-18.6"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="381,-19.25 294.5,-19.25 294.5,0 381,0 381,-19.25"/>
-<text text-anchor="middle" x="337.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.98,-9.62C261.55,-9.62 272.28,-9.62 282.81,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.57,-13.13 292.57,-9.63 282.57,-6.13 282.57,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_a55bc4a221e584d33b79b322432ecc0f3_cgraph.map b/d8/ddf/sieve__of__eratosthenes_8cpp_a55bc4a221e584d33b79b322432ecc0f3_cgraph.map
deleted file mode 100644
index 9bbc07f39..000000000
--- a/d8/ddf/sieve__of__eratosthenes_8cpp_a55bc4a221e584d33b79b322432ecc0f3_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="math::sieve_of_eratosthenes::print" name="math::sieve_of_eratosthenes::print">
-<area shape="rect" id="Node000001" title="Function to print the prime numbers." alt="" coords="5,23,195,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="261,5,332,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="195,29,245,22,245,27,196,34"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444" title="Function to check if the given number is prime or not." alt="" coords="243,55,350,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="196,53,228,56,227,62,195,58"/>
-</map>
diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_a55bc4a221e584d33b79b322432ecc0f3_cgraph.md5 b/d8/ddf/sieve__of__eratosthenes_8cpp_a55bc4a221e584d33b79b322432ecc0f3_cgraph.md5
deleted file mode 100644
index 90cbe167b..000000000
--- a/d8/ddf/sieve__of__eratosthenes_8cpp_a55bc4a221e584d33b79b322432ecc0f3_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-50e83aaf6f13e80f6ffb131b53f044e6
\ No newline at end of file
diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_a55bc4a221e584d33b79b322432ecc0f3_cgraph.svg b/d8/ddf/sieve__of__eratosthenes_8cpp_a55bc4a221e584d33b79b322432ecc0f3_cgraph.svg
deleted file mode 100644
index 9b9803082..000000000
--- a/d8/ddf/sieve__of__eratosthenes_8cpp_a55bc4a221e584d33b79b322432ecc0f3_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::sieve_of_eratosthenes::print Pages: 1 -->
-<svg width="267pt" height="64pt"
- viewBox="0.00 0.00 266.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>math::sieve_of_eratosthenes::print</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to print the prime numbers.">
-<polygon fill="#999999" stroke="#666666" points="142,-42.88 0,-42.88 0,-12.37 142,-12.37 142,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::sieve_of_eratosthenes</text>
-<text text-anchor="middle" x="71" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::print</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245,-56.25 191.5,-56.25 191.5,-37 245,-37 245,-56.25"/>
-<text text-anchor="middle" x="218.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.5,-36.85C155.37,-38.53 168.34,-40.23 179.77,-41.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.19,-45.18 189.56,-43 180.1,-38.24 179.19,-45.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444" target="_top" xlink:title="Function to check if the given number is prime or not.">
-<polygon fill="white" stroke="#666666" points="258.5,-19.25 178,-19.25 178,0 258.5,0 258.5,-19.25"/>
-<text text-anchor="middle" x="218.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::is_prime</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.5,-18.89C150.56,-17.89 158.66,-16.89 166.4,-15.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.81,-19.4 176.3,-14.7 165.95,-12.46 166.81,-19.4"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_a55bc4a221e584d33b79b322432ecc0f3_cgraph_org.svg b/d8/ddf/sieve__of__eratosthenes_8cpp_a55bc4a221e584d33b79b322432ecc0f3_cgraph_org.svg
deleted file mode 100644
index 3ab529f5a..000000000
--- a/d8/ddf/sieve__of__eratosthenes_8cpp_a55bc4a221e584d33b79b322432ecc0f3_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::sieve_of_eratosthenes::print Pages: 1 -->
-<svg width="267pt" height="64pt"
- viewBox="0.00 0.00 266.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>math::sieve_of_eratosthenes::print</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to print the prime numbers.">
-<polygon fill="#999999" stroke="#666666" points="142,-42.88 0,-42.88 0,-12.37 142,-12.37 142,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::sieve_of_eratosthenes</text>
-<text text-anchor="middle" x="71" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::print</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245,-56.25 191.5,-56.25 191.5,-37 245,-37 245,-56.25"/>
-<text text-anchor="middle" x="218.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.5,-36.85C155.37,-38.53 168.34,-40.23 179.77,-41.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.19,-45.18 189.56,-43 180.1,-38.24 179.19,-45.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444" target="_top" xlink:title="Function to check if the given number is prime or not.">
-<polygon fill="white" stroke="#666666" points="258.5,-19.25 178,-19.25 178,0 258.5,0 258.5,-19.25"/>
-<text text-anchor="middle" x="218.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::is_prime</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.5,-18.89C150.56,-17.89 158.66,-16.89 166.4,-15.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.81,-19.4 176.3,-14.7 165.95,-12.46 166.81,-19.4"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 19f717f6e..000000000
--- a/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d8/ddf/sieve__of__eratosthenes_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,5,153,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,88,16,88,21,55,21"/>
-</map>
diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index c61ebd05f..000000000
--- a/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c469d1fefdc7ac40ec9722e22511cdf2
\ No newline at end of file
diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 90b341e16..000000000
--- a/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="119pt" height="27pt"
- viewBox="0.00 0.00 118.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-9.62C44.55,-9.62 53.37,-9.62 61.69,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-13.13 71.43,-9.63 61.43,-6.13 61.43,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 86c4b950a..000000000
--- a/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="119pt" height="27pt"
- viewBox="0.00 0.00 118.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-9.62C44.55,-9.62 53.37,-9.62 61.69,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-13.13 71.43,-9.63 61.43,-6.13 61.43,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_source.html b/d8/ddf/sieve__of__eratosthenes_8cpp_source.html
new file mode 100644
index 000000000..aeb18884f
--- /dev/null
+++ b/d8/ddf/sieve__of__eratosthenes_8cpp_source.html
@@ -0,0 +1,223 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/sieve_of_eratosthenes.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/ddf/sieve__of__eratosthenes_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">sieve_of_eratosthenes.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/db0/namespacesieve__of__eratosthenes.html">sieve_of_eratosthenes</a> {</div>
+<div class="foldopen" id="foldopen00045" data-start="{" data-end="}">
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a22be949d160b26361f7e323310f7fa0c">   45</a></span>std::vector&lt;bool&gt; <a class="code hl_function" href="../../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f">sieve</a>(uint32_t N) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    std::vector&lt;bool&gt; <a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">is_prime</a>(N + 1, <span class="keyword">true</span>);  <span class="comment">// Initialize all as prime numbers</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">is_prime</a>[0] = <a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">is_prime</a>[1] = <span class="keyword">false</span>;        <span class="comment">// 0 and 1 are not prime numbers</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">for</span> (uint32_t i = 2; i * i &lt;= N; i++) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">is_prime</a>[i]) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>            <span class="keywordflow">for</span> (uint32_t j = i * i; j &lt;= N; j += i) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>                <a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">is_prime</a>[j] = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            }</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">is_prime</a>;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>}</div>
+</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="foldopen" id="foldopen00065" data-start="{" data-end="}">
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a55bc4a221e584d33b79b322432ecc0f3">   65</a></span><span class="keywordtype">void</span> print(uint32_t N, <span class="keyword">const</span> std::vector&lt;bool&gt; &amp;<a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">is_prime</a>) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">for</span> (uint32_t i = 2; i &lt;= N; i++) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">is_prime</a>[i]) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            std::cout &lt;&lt; i &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    }</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>}</div>
+</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>}  <span class="comment">// namespace sieve_of_eratosthenes</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="foldopen" id="foldopen00081" data-start="{" data-end="}">
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">   81</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    std::vector&lt;bool&gt; is_prime_1 =</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        math::sieve_of_eratosthenes::sieve(<span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(10));</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::vector&lt;bool&gt; is_prime_2 =</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        math::sieve_of_eratosthenes::sieve(<span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(20));</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    std::vector&lt;bool&gt; is_prime_3 =</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        math::sieve_of_eratosthenes::sieve(<span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(100));</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::vector&lt;bool&gt; expected_1{<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">true</span>,</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>                                 <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>};</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    assert(is_prime_1 == expected_1);</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    std::vector&lt;bool&gt; expected_2{<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">true</span>,</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>                                 <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>                                 <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>                                 <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>};</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    assert(is_prime_2 == expected_2);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span> </div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    std::vector&lt;bool&gt; expected_3{</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>,</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">true</span>,</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>,</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>,</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>,</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>,  <span class="keyword">false</span>, <span class="keyword">false</span>,</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        <span class="keyword">false</span>};</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    assert(is_prime_3 == expected_3);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>}</div>
+</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="foldopen" id="foldopen00119" data-start="{" data-end="}">
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"><a class="line" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  119</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <a class="code hl_function" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>}</div>
+</div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_a91366864111e1fac29722ca45e02ea8f"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f">math::sieve</a></div><div class="ttdeci">void sieve(std::vector&lt; bool &gt; *vec)</div><div class="ttdoc">Performs the sieve.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/da6/eratosthenes_8cpp_source.html#l00033">eratosthenes.cpp:33</a></div></div>
+<div class="ttc" id="anamespacemath_html_abd8f794b2229b42876169ff841b6e444"><div class="ttname"><a href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a></div><div class="ttdeci">bool is_prime(int64_t num)</div><div class="ttdoc">Function to check if the given number is prime or not.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d93/check__prime_8cpp_source.html#l00031">check_prime.cpp:31</a></div></div>
+<div class="ttc" id="anamespacesieve__of__eratosthenes_html"><div class="ttname"><a href="../../d2/db0/namespacesieve__of__eratosthenes.html">sieve_of_eratosthenes</a></div><div class="ttdoc">Functions for finding Prime Numbers using Sieve of Eratosthenes.</div></div>
+<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_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> <a href="#l00081">sieve_of_eratosthenes.cpp:81</a></div></div>
+<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00119">sieve_of_eratosthenes.cpp:119</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html">sieve_of_eratosthenes.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/dee/avltree_8cpp.html b/d8/dee/avltree_8cpp.html
index fe2a234f8..082687901 100644
--- a/d8/dee/avltree_8cpp.html
+++ b/d8/dee/avltree_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/avltree.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/avltree.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,11 +138,13 @@ Include dependency graph for avltree.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d2e/avltree_8cpp__incl.svg" width="262" height="111"><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">
+</div>
+<p><a href="../../d8/dee/avltree_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="typedef-members" name="typedef-members"></a>
 Typedefs</h2></td></tr>
 <tr class="memitem:a74f0cf18a0e5b832d9994e2f2d022287" id="r_a74f0cf18a0e5b832d9994e2f2d022287"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a74f0cf18a0e5b832d9994e2f2d022287">node</a></td></tr>
-<tr class="memdesc:a74f0cf18a0e5b832d9994e2f2d022287"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a>  <br /></td></tr>
+<tr class="memdesc:a74f0cf18a0e5b832d9994e2f2d022287"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::queue  <br /></td></tr>
 <tr class="separator:a74f0cf18a0e5b832d9994e2f2d022287"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
@@ -163,6 +182,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>A simple tree implementation using nodes. </p>
 <dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000002">Todo</a></b></dt><dd>update code to use C++ STL library features and OO structure </dd></dl>
 <dl class="section warning"><dt>Warning</dt><dd>This program is a poor implementation and does not utilize any of the C++ STL features. </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
 </div><h2 class="groupheader">Typedef Documentation</h2>
 <a id="a74f0cf18a0e5b832d9994e2f2d022287" name="a74f0cf18a0e5b832d9994e2f2d022287"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a74f0cf18a0e5b832d9994e2f2d022287">&#9670;&#160;</a></span>node</h2>
@@ -181,19 +202,20 @@ Functions</h2></td></tr>
 <div class="line">    <span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *left;</div>
 <div class="line">    <span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *right;</div>
 <div class="line">}</div>
-<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition</b> avltree.cpp:38</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
+<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00038">avltree.cpp:38</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
 </div><!-- fragment -->
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a> </p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> </p>
+<p>for std::queue </p>
+<p>for std::max for std::cout </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00013">13</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   13</span>                         {</div>
 <div class="line"><span class="lineno">   14</span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
 <div class="line"><span class="lineno">   15</span>    <span class="keywordtype">int</span> <a class="code hl_function" href="#ae4a66d8b0c2b0d626aea45977e358c83">height</a>;</div>
 <div class="line"><span class="lineno">   16</span>    <span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *left;</div>
-<div class="line"><span class="lineno">   17</span>    <span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>;</div>
+<div class="line"><span class="lineno">   17</span>    <span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *right;</div>
 <div class="line"><span class="lineno">   18</span>};</div>
-<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
-<div class="ttc" id="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::right</a></div><div class="ttdeci">T right(T... args)</div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -221,6 +243,8 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>newly created node </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00025">25</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   25</span>                           {</div>
 <div class="line"><span class="lineno">   26</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *nn = <span class="keyword">new</span> <a class="code hl_typedef" href="#a74f0cf18a0e5b832d9994e2f2d022287">node</a>();</div>
 <div class="line"><span class="lineno">   27</span>    nn-&gt;data = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
@@ -229,7 +253,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   30</span>    nn-&gt;right = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">   31</span>    <span class="keywordflow">return</span> nn;</div>
 <div class="line"><span class="lineno">   32</span>}</div>
-<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -255,6 +279,8 @@ Functions</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00151">151</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  151</span>                                            {</div>
 <div class="line"><span class="lineno">  152</span>    <span class="keywordflow">if</span> (root) {</div>
 <div class="line"><span class="lineno">  153</span>        <a class="code hl_function" href="#a82659e9e223e520cf91d7e55c4a3f88c">deleteAllNodes</a>(root-&gt;left);</div>
@@ -262,13 +288,8 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  155</span>        <span class="keyword">delete</span> root;</div>
 <div class="line"><span class="lineno">  156</span>    }</div>
 <div class="line"><span class="lineno">  157</span>}</div>
-<div class="ttc" id="aavltree_8cpp_html_a82659e9e223e520cf91d7e55c4a3f88c"><div class="ttname"><a href="#a82659e9e223e520cf91d7e55c4a3f88c">deleteAllNodes</a></div><div class="ttdeci">void deleteAllNodes(const node *const root)</div><div class="ttdoc">calls delete on every node</div><div class="ttdef"><b>Definition</b> avltree.cpp:151</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/dee/avltree_8cpp_a82659e9e223e520cf91d7e55c4a3f88c_cgraph.svg" width="120" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aavltree_8cpp_html_a82659e9e223e520cf91d7e55c4a3f88c"><div class="ttname"><a href="#a82659e9e223e520cf91d7e55c4a3f88c">deleteAllNodes</a></div><div class="ttdeci">void deleteAllNodes(const node *const root)</div><div class="ttdoc">calls delete on every node</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00151">avltree.cpp:151</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa29a7fdc2db1784f5a6e25025ff7cbf5" name="aa29a7fdc2db1784f5a6e25025ff7cbf5"></a>
@@ -299,6 +320,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>root of the updated tree </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00122">122</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  122</span>                                          {</div>
 <div class="line"><span class="lineno">  123</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">  124</span>        <span class="keywordflow">return</span> root;</div>
@@ -323,14 +346,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  143</span>    <span class="comment">// Balancing Tree after deletion</span></div>
 <div class="line"><span class="lineno">  144</span>    <span class="keywordflow">return</span> root;</div>
 <div class="line"><span class="lineno">  145</span>}</div>
-<div class="ttc" id="aavltree_8cpp_html_a5fa160a678a34dd51c0aea1c0c00ed5e"><div class="ttname"><a href="#a5fa160a678a34dd51c0aea1c0c00ed5e">minValue</a></div><div class="ttdeci">node * minValue(node *root)</div><div class="ttdef"><b>Definition</b> avltree.cpp:79</div></div>
-<div class="ttc" id="aavltree_8cpp_html_aa29a7fdc2db1784f5a6e25025ff7cbf5"><div class="ttname"><a href="#aa29a7fdc2db1784f5a6e25025ff7cbf5">deleteNode</a></div><div class="ttdeci">node * deleteNode(node *root, int element)</div><div class="ttdoc">removes a given element from AVL tree</div><div class="ttdef"><b>Definition</b> avltree.cpp:122</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph.svg" width="220" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aavltree_8cpp_html_a5fa160a678a34dd51c0aea1c0c00ed5e"><div class="ttname"><a href="#a5fa160a678a34dd51c0aea1c0c00ed5e">minValue</a></div><div class="ttdeci">node * minValue(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00079">avltree.cpp:79</a></div></div>
+<div class="ttc" id="aavltree_8cpp_html_aa29a7fdc2db1784f5a6e25025ff7cbf5"><div class="ttname"><a href="#aa29a7fdc2db1784f5a6e25025ff7cbf5">deleteNode</a></div><div class="ttdeci">node * deleteNode(node *root, int element)</div><div class="ttdoc">removes a given element from AVL tree</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00122">avltree.cpp:122</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aaa457ffec24c9643f2768e7a65e96546" name="aaa457ffec24c9643f2768e7a65e96546"></a>
@@ -354,13 +372,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>difference between height of left and right subtree </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   49</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;left) - <a class="code hl_function" href="#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;right); }</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="../../d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.svg" width="322" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00049">49</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   49</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;left) - <a class="code hl_function" href="#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;right); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae4a66d8b0c2b0d626aea45977e358c83" name="ae4a66d8b0c2b0d626aea45977e358c83"></a>
@@ -384,19 +399,15 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>height of tree </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   38</span>                       {</div>
 <div class="line"><span class="lineno">   39</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">   40</span>        <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   41</span>    }</div>
-<div class="line"><span class="lineno">   42</span>    <span class="keywordflow">return</span> 1 + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(<a class="code hl_function" href="#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;left), <a class="code hl_function" href="#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;right));</div>
+<div class="line"><span class="lineno">   42</span>    <span class="keywordflow">return</span> 1 + std::max(<a class="code hl_function" href="#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;left), <a class="code hl_function" href="#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;right));</div>
 <div class="line"><span class="lineno">   43</span>}</div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-</div><!-- 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="../../d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.svg" width="188" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2473fe7416332495b2678ebe89652e4b" name="a2473fe7416332495b2678ebe89652e4b"></a>
@@ -427,6 +438,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>root of the updated tree </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00092">92</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   92</span>                                   {</div>
 <div class="line"><span class="lineno">   93</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">   94</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a48d897353aeb6a721dbc6b6c57e035e6">createNode</a>(item);</div>
@@ -450,17 +463,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  112</span>    }</div>
 <div class="line"><span class="lineno">  113</span>    <span class="keywordflow">return</span> root;</div>
 <div class="line"><span class="lineno">  114</span>}</div>
-<div class="ttc" id="aavltree_8cpp_html_a2473fe7416332495b2678ebe89652e4b"><div class="ttname"><a href="#a2473fe7416332495b2678ebe89652e4b">insert</a></div><div class="ttdeci">node * insert(node *root, int item)</div><div class="ttdoc">inserts a new element into AVL tree</div><div class="ttdef"><b>Definition</b> avltree.cpp:92</div></div>
-<div class="ttc" id="aavltree_8cpp_html_a473eee1803e4e44a54d685e4b0eef5a6"><div class="ttname"><a href="#a473eee1803e4e44a54d685e4b0eef5a6">leftRotate</a></div><div class="ttdeci">node * leftRotate(node *root)</div><div class="ttdef"><b>Definition</b> avltree.cpp:67</div></div>
-<div class="ttc" id="aavltree_8cpp_html_a48d897353aeb6a721dbc6b6c57e035e6"><div class="ttname"><a href="#a48d897353aeb6a721dbc6b6c57e035e6">createNode</a></div><div class="ttdeci">node * createNode(int data)</div><div class="ttdoc">creates and returns a new node</div><div class="ttdef"><b>Definition</b> avltree.cpp:25</div></div>
-<div class="ttc" id="aavltree_8cpp_html_aaa457ffec24c9643f2768e7a65e96546"><div class="ttname"><a href="#aaa457ffec24c9643f2768e7a65e96546">getBalance</a></div><div class="ttdeci">int getBalance(node *root)</div><div class="ttdef"><b>Definition</b> avltree.cpp:49</div></div>
-<div class="ttc" id="aavltree_8cpp_html_adfc1d482a564c041756719667b955b8c"><div class="ttname"><a href="#adfc1d482a564c041756719667b955b8c">rightRotate</a></div><div class="ttdeci">node * rightRotate(node *root)</div><div class="ttdef"><b>Definition</b> avltree.cpp:55</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.svg" width="426" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aavltree_8cpp_html_a2473fe7416332495b2678ebe89652e4b"><div class="ttname"><a href="#a2473fe7416332495b2678ebe89652e4b">insert</a></div><div class="ttdeci">node * insert(node *root, int item)</div><div class="ttdoc">inserts a new element into AVL tree</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00092">avltree.cpp:92</a></div></div>
+<div class="ttc" id="aavltree_8cpp_html_a473eee1803e4e44a54d685e4b0eef5a6"><div class="ttname"><a href="#a473eee1803e4e44a54d685e4b0eef5a6">leftRotate</a></div><div class="ttdeci">node * leftRotate(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00067">avltree.cpp:67</a></div></div>
+<div class="ttc" id="aavltree_8cpp_html_a48d897353aeb6a721dbc6b6c57e035e6"><div class="ttname"><a href="#a48d897353aeb6a721dbc6b6c57e035e6">createNode</a></div><div class="ttdeci">node * createNode(int data)</div><div class="ttdoc">creates and returns a new node</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00025">avltree.cpp:25</a></div></div>
+<div class="ttc" id="aavltree_8cpp_html_aaa457ffec24c9643f2768e7a65e96546"><div class="ttname"><a href="#aaa457ffec24c9643f2768e7a65e96546">getBalance</a></div><div class="ttdeci">int getBalance(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00049">avltree.cpp:49</a></div></div>
+<div class="ttc" id="aavltree_8cpp_html_adfc1d482a564c041756719667b955b8c"><div class="ttname"><a href="#adfc1d482a564c041756719667b955b8c">rightRotate</a></div><div class="ttdeci">node * rightRotate(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00055">avltree.cpp:55</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a473eee1803e4e44a54d685e4b0eef5a6" name="a473eee1803e4e44a54d685e4b0eef5a6"></a>
@@ -484,6 +492,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>node after left rotation </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   67</span>                             {</div>
 <div class="line"><span class="lineno">   68</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = root-&gt;right;</div>
 <div class="line"><span class="lineno">   69</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *u = t-&gt;left;</div>
@@ -516,12 +526,14 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00163">163</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  163</span>                            {</div>
-<div class="line"><span class="lineno">  164</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue&lt;node *&gt;</a> q;</div>
+<div class="line"><span class="lineno">  164</span>    std::queue&lt;node *&gt; q;</div>
 <div class="line"><span class="lineno">  165</span>    q.push(root);</div>
 <div class="line"><span class="lineno">  166</span>    <span class="keywordflow">while</span> (!q.empty()) {</div>
 <div class="line"><span class="lineno">  167</span>        root = q.front();</div>
-<div class="line"><span class="lineno">  168</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; root-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  168</span>        std::cout &lt;&lt; root-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">  169</span>        q.pop();</div>
 <div class="line"><span class="lineno">  170</span>        <span class="keywordflow">if</span> (root-&gt;left) {</div>
 <div class="line"><span class="lineno">  171</span>            q.push(root-&gt;left);</div>
@@ -531,8 +543,6 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  175</span>        }</div>
 <div class="line"><span class="lineno">  176</span>    }</div>
 <div class="line"><span class="lineno">  177</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="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -553,29 +563,26 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00183">183</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  183</span>           {</div>
 <div class="line"><span class="lineno">  184</span>    <span class="comment">// Testing AVL Tree</span></div>
 <div class="line"><span class="lineno">  185</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *root = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  186</span>    <span class="keywordtype">int</span> i = 0;</div>
 <div class="line"><span class="lineno">  187</span>    <span class="keywordflow">for</span> (i = 1; i &lt;= 7; i++) root = <a class="code hl_function" href="#a2473fe7416332495b2678ebe89652e4b">insert</a>(root, i);</div>
-<div class="line"><span class="lineno">  188</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;LevelOrder: &quot;</span>;</div>
+<div class="line"><span class="lineno">  188</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;LevelOrder: &quot;</span>;</div>
 <div class="line"><span class="lineno">  189</span>    <a class="code hl_function" href="#ae197eb50188fb761346952b9b5f6be59">levelOrder</a>(root);</div>
 <div class="line"><span class="lineno">  190</span>    root = <a class="code hl_function" href="#aa29a7fdc2db1784f5a6e25025ff7cbf5">deleteNode</a>(root, 1);  <span class="comment">// Deleting key with value 1</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> &lt;&lt; <span class="stringliteral">&quot;\nLevelOrder: &quot;</span>;</div>
+<div class="line"><span class="lineno">  191</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nLevelOrder: &quot;</span>;</div>
 <div class="line"><span class="lineno">  192</span>    <a class="code hl_function" href="#ae197eb50188fb761346952b9b5f6be59">levelOrder</a>(root);</div>
 <div class="line"><span class="lineno">  193</span>    root = <a class="code hl_function" href="#aa29a7fdc2db1784f5a6e25025ff7cbf5">deleteNode</a>(root, 4);  <span class="comment">// Deletin key with value 4</span></div>
-<div class="line"><span class="lineno">  194</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nLevelOrder: &quot;</span>;</div>
+<div class="line"><span class="lineno">  194</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nLevelOrder: &quot;</span>;</div>
 <div class="line"><span class="lineno">  195</span>    <a class="code hl_function" href="#ae197eb50188fb761346952b9b5f6be59">levelOrder</a>(root);</div>
 <div class="line"><span class="lineno">  196</span>    <a class="code hl_function" href="#a82659e9e223e520cf91d7e55c4a3f88c">deleteAllNodes</a>(root);</div>
 <div class="line"><span class="lineno">  197</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  198</span>}</div>
-<div class="ttc" id="aavltree_8cpp_html_ae197eb50188fb761346952b9b5f6be59"><div class="ttname"><a href="#ae197eb50188fb761346952b9b5f6be59">levelOrder</a></div><div class="ttdeci">void levelOrder(node *root)</div><div class="ttdoc">prints given tree in the LevelOrder</div><div class="ttdef"><b>Definition</b> avltree.cpp:163</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="579" height="306"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aavltree_8cpp_html_ae197eb50188fb761346952b9b5f6be59"><div class="ttname"><a href="#ae197eb50188fb761346952b9b5f6be59">levelOrder</a></div><div class="ttdeci">void levelOrder(node *root)</div><div class="ttdoc">prints given tree in the LevelOrder</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00163">avltree.cpp:163</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5fa160a678a34dd51c0aea1c0c00ed5e" name="a5fa160a678a34dd51c0aea1c0c00ed5e"></a>
@@ -599,18 +606,15 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>node with minimum value in the tree </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00079">79</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   79</span>                           {</div>
 <div class="line"><span class="lineno">   80</span>    <span class="keywordflow">if</span> (root-&gt;left == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">   81</span>        <span class="keywordflow">return</span> root;</div>
 <div class="line"><span class="lineno">   82</span>    }</div>
 <div class="line"><span class="lineno">   83</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="#a5fa160a678a34dd51c0aea1c0c00ed5e">minValue</a>(root-&gt;left);</div>
 <div class="line"><span class="lineno">   84</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/dee/avltree_8cpp_a5fa160a678a34dd51c0aea1c0c00ed5e_cgraph.svg" width="86" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="adfc1d482a564c041756719667b955b8c" name="adfc1d482a564c041756719667b955b8c"></a>
@@ -634,6 +638,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>node after right rotation </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   55</span>                              {</div>
 <div class="line"><span class="lineno">   56</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = root-&gt;left;</div>
 <div class="line"><span class="lineno">   57</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *u = t-&gt;right;</div>
diff --git a/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.map b/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.map
deleted file mode 100644
index 10c26e033..000000000
--- a/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="insert" name="insert">
-<area shape="rect" id="Node000001" title="inserts a new element into AVL tree" alt="" coords="5,80,59,106"/>
-<area shape="poly" id="edge6_Node000001_Node000001" title=" " alt="" coords="11,81,7,71,9,62,18,56,32,53,47,56,55,63,51,67,45,61,32,59,20,61,14,65,12,71,16,79"/>
-<area shape="rect" id="Node000002" href="$d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6" title="creates and returns a new node" alt="" coords="107,5,195,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="50,77,105,40,110,37,113,41,108,44,53,82"/>
-<area shape="rect" id="Node000003" href="$d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546" title=" " alt="" coords="108,55,194,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="59,85,92,77,93,83,60,90"/>
-<area shape="rect" id="Node000006" href="$d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6" title=" " alt="" coords="112,104,190,130"/>
-<area shape="poly" id="edge7_Node000001_Node000006" title=" " alt="" coords="60,96,97,103,96,108,59,101"/>
-<area shape="rect" id="Node000007" href="$d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c" title=" " alt="" coords="108,153,194,179"/>
-<area shape="poly" id="edge8_Node000001_Node000007" title=" " alt="" coords="54,104,108,140,113,143,110,147,105,144,51,108"/>
-<area shape="rect" id="Node000004" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="243,55,299,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="195,65,227,65,227,70,195,70"/>
-<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="251,55,248,46,250,37,258,30,271,28,285,31,293,38,289,41,283,36,271,33,260,35,254,40,253,46,256,53"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="347,55,420,80"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="300,65,331,65,331,70,300,70"/>
-</map>
diff --git a/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.md5 b/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.md5
deleted file mode 100644
index 60d5b32c4..000000000
--- a/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-87c01be2b9e4ed83ed5c49dacda99fe8
\ No newline at end of file
diff --git a/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.svg b/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.svg
deleted file mode 100644
index 8d53c17dc..000000000
--- a/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph.svg
+++ /dev/null
@@ -1,173 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: insert Pages: 1 -->
-<svg width="319pt" height="138pt"
- viewBox="0.00 0.00 318.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="inserts a new element into AVL tree">
-<polygon fill="#999999" stroke="#666666" points="40,-74.25 0,-74.25 0,-55 40,-55 40,-74.25"/>
-<text text-anchor="middle" x="20" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge6_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge6_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M6.05,-74.54C-0.32,-83.15 4.33,-92.25 20,-92.25 28.57,-92.25 33.84,-89.53 35.82,-85.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="39.31,-85.31 34.2,-76.03 32.41,-86.47 39.31,-85.31"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6" target="_top" xlink:title="creates and returns a new node">
-<polygon fill="white" stroke="#666666" points="142.25,-130.25 76,-130.25 76,-111 142.25,-111 142.25,-130.25"/>
-<text text-anchor="middle" x="109.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">createNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.77,-74.68C45.76,-82.56 61.62,-93.66 76,-102.62 77.22,-103.39 78.47,-104.15 79.75,-104.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.89,-107.89 88.3,-109.88 81.4,-101.83 77.89,-107.89"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.5,-93.25 76.75,-93.25 76.75,-74 141.5,-74 141.5,-93.25"/>
-<text text-anchor="middle" x="109.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">getBalance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.34,-68.84C47.81,-70.47 56.68,-72.41 65.49,-74.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.53,-77.7 75.05,-76.41 66.02,-70.86 64.53,-77.7"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.5,-56.25 79.75,-56.25 79.75,-37 138.5,-37 138.5,-56.25"/>
-<text text-anchor="middle" x="109.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">leftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.34,-60.63C48.62,-58.92 58.63,-56.85 68.37,-54.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.01,-58.28 78.1,-52.83 67.59,-51.42 69.01,-58.28"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.12,-19.25 77.12,-19.25 77.12,0 141.12,0 141.12,-19.25"/>
-<text text-anchor="middle" x="109.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">rightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge8_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.27,-54.56C46.25,-46.93 61.88,-36.31 76,-27.62 77.23,-26.87 78.48,-26.11 79.76,-25.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.41,-28.44 88.32,-20.41 77.91,-22.38 81.41,-28.44"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.5,-93.25 178.25,-93.25 178.25,-74 220.5,-74 220.5,-93.25"/>
-<text text-anchor="middle" x="199.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.99,-83.62C149.92,-83.62 158.43,-83.62 166.37,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.32,-87.13 176.32,-83.63 166.32,-80.13 166.32,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.19,-93.54C180.17,-102.15 184.57,-111.25 199.38,-111.25 207.47,-111.25 212.46,-108.53 214.33,-104.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.83,-104.36 212.8,-95.03 210.91,-105.46 217.83,-104.36"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="310.75,-93.25 256.5,-93.25 256.5,-74 310.75,-74 310.75,-93.25"/>
-<text text-anchor="middle" x="283.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.71,-83.62C227.95,-83.62 236.36,-83.62 244.6,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.49,-87.13 254.49,-83.63 244.49,-80.13 244.49,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph_org.svg b/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph_org.svg
deleted file mode 100644
index c2eee5a5a..000000000
--- a/d8/dee/avltree_8cpp_a2473fe7416332495b2678ebe89652e4b_cgraph_org.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: insert Pages: 1 -->
-<svg width="319pt" height="138pt"
- viewBox="0.00 0.00 318.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="inserts a new element into AVL tree">
-<polygon fill="#999999" stroke="#666666" points="40,-74.25 0,-74.25 0,-55 40,-55 40,-74.25"/>
-<text text-anchor="middle" x="20" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge6_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge6_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M6.05,-74.54C-0.32,-83.15 4.33,-92.25 20,-92.25 28.57,-92.25 33.84,-89.53 35.82,-85.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="39.31,-85.31 34.2,-76.03 32.41,-86.47 39.31,-85.31"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6" target="_top" xlink:title="creates and returns a new node">
-<polygon fill="white" stroke="#666666" points="142.25,-130.25 76,-130.25 76,-111 142.25,-111 142.25,-130.25"/>
-<text text-anchor="middle" x="109.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">createNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.77,-74.68C45.76,-82.56 61.62,-93.66 76,-102.62 77.22,-103.39 78.47,-104.15 79.75,-104.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.89,-107.89 88.3,-109.88 81.4,-101.83 77.89,-107.89"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.5,-93.25 76.75,-93.25 76.75,-74 141.5,-74 141.5,-93.25"/>
-<text text-anchor="middle" x="109.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">getBalance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.34,-68.84C47.81,-70.47 56.68,-72.41 65.49,-74.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.53,-77.7 75.05,-76.41 66.02,-70.86 64.53,-77.7"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.5,-56.25 79.75,-56.25 79.75,-37 138.5,-37 138.5,-56.25"/>
-<text text-anchor="middle" x="109.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">leftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.34,-60.63C48.62,-58.92 58.63,-56.85 68.37,-54.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.01,-58.28 78.1,-52.83 67.59,-51.42 69.01,-58.28"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.12,-19.25 77.12,-19.25 77.12,0 141.12,0 141.12,-19.25"/>
-<text text-anchor="middle" x="109.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">rightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge8_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.27,-54.56C46.25,-46.93 61.88,-36.31 76,-27.62 77.23,-26.87 78.48,-26.11 79.76,-25.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.41,-28.44 88.32,-20.41 77.91,-22.38 81.41,-28.44"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.5,-93.25 178.25,-93.25 178.25,-74 220.5,-74 220.5,-93.25"/>
-<text text-anchor="middle" x="199.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.99,-83.62C149.92,-83.62 158.43,-83.62 166.37,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.32,-87.13 176.32,-83.63 166.32,-80.13 166.32,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.19,-93.54C180.17,-102.15 184.57,-111.25 199.38,-111.25 207.47,-111.25 212.46,-108.53 214.33,-104.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.83,-104.36 212.8,-95.03 210.91,-105.46 217.83,-104.36"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="310.75,-93.25 256.5,-93.25 256.5,-74 310.75,-74 310.75,-93.25"/>
-<text text-anchor="middle" x="283.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.71,-83.62C227.95,-83.62 236.36,-83.62 244.6,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.49,-87.13 254.49,-83.63 244.49,-80.13 244.49,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/dee/avltree_8cpp_a5fa160a678a34dd51c0aea1c0c00ed5e_cgraph.map b/d8/dee/avltree_8cpp_a5fa160a678a34dd51c0aea1c0c00ed5e_cgraph.map
deleted file mode 100644
index 472e74fb2..000000000
--- a/d8/dee/avltree_8cpp_a5fa160a678a34dd51c0aea1c0c00ed5e_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="minValue" name="minValue">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,80,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="28,29,27,12,33,5,43,3,52,5,58,12,53,15,49,10,42,8,36,10,32,14,34,29"/>
-</map>
diff --git a/d8/dee/avltree_8cpp_a5fa160a678a34dd51c0aea1c0c00ed5e_cgraph.md5 b/d8/dee/avltree_8cpp_a5fa160a678a34dd51c0aea1c0c00ed5e_cgraph.md5
deleted file mode 100644
index 5032a2d5f..000000000
--- a/d8/dee/avltree_8cpp_a5fa160a678a34dd51c0aea1c0c00ed5e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-136723d6cc3e9cffb41d0c00edadbc59
\ No newline at end of file
diff --git a/d8/dee/avltree_8cpp_a5fa160a678a34dd51c0aea1c0c00ed5e_cgraph.svg b/d8/dee/avltree_8cpp_a5fa160a678a34dd51c0aea1c0c00ed5e_cgraph.svg
deleted file mode 100644
index d7b5948e9..000000000
--- a/d8/dee/avltree_8cpp_a5fa160a678a34dd51c0aea1c0c00ed5e_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: minValue Pages: 1 -->
-<svg width="64pt" height="45pt"
- viewBox="0.00 0.00 63.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>minValue</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="55.75,-19.25 0,-19.25 0,0 55.75,0 55.75,-19.25"/>
-<text text-anchor="middle" x="27.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">minValue</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M19.15,-19.54C15.17,-28.15 18.08,-37.25 27.88,-37.25 33.08,-37.25 36.34,-34.68 37.66,-30.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="41.15,-30.68 36.74,-21.05 34.18,-31.32 41.15,-30.68"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/dee/avltree_8cpp_a5fa160a678a34dd51c0aea1c0c00ed5e_cgraph_org.svg b/d8/dee/avltree_8cpp_a5fa160a678a34dd51c0aea1c0c00ed5e_cgraph_org.svg
deleted file mode 100644
index daf05ce3a..000000000
--- a/d8/dee/avltree_8cpp_a5fa160a678a34dd51c0aea1c0c00ed5e_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: minValue Pages: 1 -->
-<svg width="64pt" height="45pt"
- viewBox="0.00 0.00 63.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>minValue</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="55.75,-19.25 0,-19.25 0,0 55.75,0 55.75,-19.25"/>
-<text text-anchor="middle" x="27.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">minValue</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M19.15,-19.54C15.17,-28.15 18.08,-37.25 27.88,-37.25 33.08,-37.25 36.34,-34.68 37.66,-30.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="41.15,-30.68 36.74,-21.05 34.18,-31.32 41.15,-30.68"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/dee/avltree_8cpp_a82659e9e223e520cf91d7e55c4a3f88c_cgraph.map b/d8/dee/avltree_8cpp_a82659e9e223e520cf91d7e55c4a3f88c_cgraph.map
deleted file mode 100644
index 197991065..000000000
--- a/d8/dee/avltree_8cpp_a82659e9e223e520cf91d7e55c4a3f88c_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="deleteAllNodes" name="deleteAllNodes">
-<area shape="rect" id="Node000001" title="calls delete on every node" alt="" coords="5,29,115,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="40,30,37,21,39,11,47,5,60,3,74,5,81,12,78,16,72,10,60,8,49,10,44,14,42,20,45,28"/>
-</map>
diff --git a/d8/dee/avltree_8cpp_a82659e9e223e520cf91d7e55c4a3f88c_cgraph.md5 b/d8/dee/avltree_8cpp_a82659e9e223e520cf91d7e55c4a3f88c_cgraph.md5
deleted file mode 100644
index de88ad46d..000000000
--- a/d8/dee/avltree_8cpp_a82659e9e223e520cf91d7e55c4a3f88c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7b1fb16cae375f5690e23a870f348033
\ No newline at end of file
diff --git a/d8/dee/avltree_8cpp_a82659e9e223e520cf91d7e55c4a3f88c_cgraph.svg b/d8/dee/avltree_8cpp_a82659e9e223e520cf91d7e55c4a3f88c_cgraph.svg
deleted file mode 100644
index b419d07ac..000000000
--- a/d8/dee/avltree_8cpp_a82659e9e223e520cf91d7e55c4a3f88c_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: deleteAllNodes Pages: 1 -->
-<svg width="90pt" height="45pt"
- viewBox="0.00 0.00 90.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>deleteAllNodes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="calls delete on every node">
-<polygon fill="#999999" stroke="#666666" points="82,-19.25 0,-19.25 0,0 82,0 82,-19.25"/>
-<text text-anchor="middle" x="41" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">deleteAllNodes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.16,-19.54C22.31,-28.15 26.59,-37.25 41,-37.25 48.88,-37.25 53.73,-34.53 55.55,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="59.05,-30.38 54.07,-21.03 52.14,-31.45 59.05,-30.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/dee/avltree_8cpp_a82659e9e223e520cf91d7e55c4a3f88c_cgraph_org.svg b/d8/dee/avltree_8cpp_a82659e9e223e520cf91d7e55c4a3f88c_cgraph_org.svg
deleted file mode 100644
index f01b99061..000000000
--- a/d8/dee/avltree_8cpp_a82659e9e223e520cf91d7e55c4a3f88c_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: deleteAllNodes Pages: 1 -->
-<svg width="90pt" height="45pt"
- viewBox="0.00 0.00 90.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>deleteAllNodes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="calls delete on every node">
-<polygon fill="#999999" stroke="#666666" points="82,-19.25 0,-19.25 0,0 82,0 82,-19.25"/>
-<text text-anchor="middle" x="41" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">deleteAllNodes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.16,-19.54C22.31,-28.15 26.59,-37.25 41,-37.25 48.88,-37.25 53.73,-34.53 55.55,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="59.05,-30.38 54.07,-21.03 52.14,-31.45 59.05,-30.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph.map b/d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph.map
deleted file mode 100644
index 3214e7748..000000000
--- a/d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="deleteNode" name="deleteNode">
-<area shape="rect" id="Node000001" title="removes a given element from AVL tree" alt="" coords="5,29,93,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="26,30,22,21,25,11,34,5,49,3,65,5,74,12,70,16,63,10,49,8,36,10,29,14,28,20,31,28"/>
-<area shape="rect" id="Node000002" href="$d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e" title=" " alt="" coords="141,29,215,55"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="93,40,125,40,125,45,93,45"/>
-<area shape="poly" id="edge3_Node000002_Node000002" title=" " alt="" coords="155,30,151,21,154,11,163,5,178,3,194,5,202,12,199,16,192,10,178,8,165,10,158,14,156,20,160,28"/>
-</map>
diff --git a/d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph.md5 b/d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph.md5
deleted file mode 100644
index 0317feb89..000000000
--- a/d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4b993a5e6a95a367d8323df91fbc8161
\ No newline at end of file
diff --git a/d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph.svg b/d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph.svg
deleted file mode 100644
index ed118504f..000000000
--- a/d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: deleteNode Pages: 1 -->
-<svg width="165pt" height="45pt"
- viewBox="0.00 0.00 165.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>deleteNode</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="removes a given element from AVL tree">
-<polygon fill="#999999" stroke="#666666" points="65.5,-19.25 0,-19.25 0,0 65.5,0 65.5,-19.25"/>
-<text text-anchor="middle" x="32.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">deleteNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M17.62,-19.54C10.72,-28.15 15.77,-37.25 32.75,-37.25 42.04,-37.25 47.76,-34.53 49.9,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="53.38,-30.24 48.15,-21.03 46.5,-31.49 53.38,-30.24"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="157.25,-19.25 101.5,-19.25 101.5,0 157.25,0 157.25,-19.25"/>
-<text text-anchor="middle" x="129.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">minValue</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M65.79,-9.62C73.49,-9.62 81.81,-9.62 89.78,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.6,-13.13 99.6,-9.63 89.6,-6.13 89.6,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.25,-19.54C107.35,-28.15 112.39,-37.25 129.38,-37.25 138.66,-37.25 144.38,-34.53 146.53,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.01,-30.24 144.77,-21.03 143.12,-31.49 150.01,-30.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph_org.svg b/d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph_org.svg
deleted file mode 100644
index 3d71685a9..000000000
--- a/d8/dee/avltree_8cpp_aa29a7fdc2db1784f5a6e25025ff7cbf5_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: deleteNode Pages: 1 -->
-<svg width="165pt" height="45pt"
- viewBox="0.00 0.00 165.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>deleteNode</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="removes a given element from AVL tree">
-<polygon fill="#999999" stroke="#666666" points="65.5,-19.25 0,-19.25 0,0 65.5,0 65.5,-19.25"/>
-<text text-anchor="middle" x="32.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">deleteNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M17.62,-19.54C10.72,-28.15 15.77,-37.25 32.75,-37.25 42.04,-37.25 47.76,-34.53 49.9,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="53.38,-30.24 48.15,-21.03 46.5,-31.49 53.38,-30.24"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="157.25,-19.25 101.5,-19.25 101.5,0 157.25,0 157.25,-19.25"/>
-<text text-anchor="middle" x="129.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">minValue</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M65.79,-9.62C73.49,-9.62 81.81,-9.62 89.78,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.6,-13.13 99.6,-9.63 89.6,-6.13 89.6,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.25,-19.54C107.35,-28.15 112.39,-37.25 129.38,-37.25 138.66,-37.25 144.38,-34.53 146.53,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.01,-30.24 144.77,-21.03 143.12,-31.49 150.01,-30.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.map b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.map
deleted file mode 100644
index b470f6ab4..000000000
--- a/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="getBalance" name="getBalance">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,92,55"/>
-<area shape="rect" id="Node000002" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="140,29,196,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="92,40,124,40,124,45,92,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="148,30,144,21,146,11,155,5,168,3,182,5,190,12,186,16,180,10,168,8,157,10,151,14,149,20,153,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="244,29,316,55"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="196,40,228,40,228,45,196,45"/>
-</map>
diff --git a/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.md5 b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.md5
deleted file mode 100644
index ffb9ab250..000000000
--- a/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d41ce5d8f2099ea3cf5058b9e9d1ac6b
\ No newline at end of file
diff --git a/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.svg b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.svg
deleted file mode 100644
index 4b7fe89a2..000000000
--- a/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: getBalance Pages: 1 -->
-<svg width="241pt" height="45pt"
- viewBox="0.00 0.00 241.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>getBalance</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="64.75,-19.25 0,-19.25 0,0 64.75,0 64.75,-19.25"/>
-<text text-anchor="middle" x="32.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">getBalance</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143,-19.25 100.75,-19.25 100.75,0 143,0 143,-19.25"/>
-<text text-anchor="middle" x="121.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M64.96,-9.62C72.83,-9.62 81.27,-9.62 89.14,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89,-13.13 99,-9.63 89,-6.13 89,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.69,-19.54C102.67,-28.15 107.07,-37.25 121.88,-37.25 129.97,-37.25 134.96,-34.53 136.83,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.33,-30.36 135.3,-21.03 133.41,-31.46 140.33,-30.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.25,-19.25 179,-19.25 179,0 233.25,0 233.25,-19.25"/>
-<text text-anchor="middle" x="206.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M143.21,-9.62C150.45,-9.62 158.86,-9.62 167.1,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.99,-13.13 176.99,-9.63 166.99,-6.13 166.99,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph_org.svg b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph_org.svg
deleted file mode 100644
index 190284beb..000000000
--- a/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: getBalance Pages: 1 -->
-<svg width="241pt" height="45pt"
- viewBox="0.00 0.00 241.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>getBalance</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="64.75,-19.25 0,-19.25 0,0 64.75,0 64.75,-19.25"/>
-<text text-anchor="middle" x="32.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">getBalance</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143,-19.25 100.75,-19.25 100.75,0 143,0 143,-19.25"/>
-<text text-anchor="middle" x="121.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M64.96,-9.62C72.83,-9.62 81.27,-9.62 89.14,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89,-13.13 99,-9.63 89,-6.13 89,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.69,-19.54C102.67,-28.15 107.07,-37.25 121.88,-37.25 129.97,-37.25 134.96,-34.53 136.83,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.33,-30.36 135.3,-21.03 133.41,-31.46 140.33,-30.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.25,-19.25 179,-19.25 179,0 233.25,0 233.25,-19.25"/>
-<text text-anchor="middle" x="206.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M143.21,-9.62C150.45,-9.62 158.86,-9.62 167.1,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.99,-13.13 176.99,-9.63 166.99,-6.13 166.99,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.map b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.map
deleted file mode 100644
index bd05216f6..000000000
--- a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="height" name="height">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,62,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="13,30,10,21,12,11,20,5,34,3,48,5,55,12,52,16,45,10,33,8,22,10,17,14,15,20,18,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="110,29,182,55"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="62,40,94,40,94,45,62,45"/>
-</map>
diff --git a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.md5 b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.md5
deleted file mode 100644
index 686de6f25..000000000
--- a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e7cb9a35d598cb4951da940253f6e605
\ No newline at end of file
diff --git a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.svg b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.svg
deleted file mode 100644
index 5b228c489..000000000
--- a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.svg
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: height Pages: 1 -->
-<svg width="141pt" height="45pt"
- viewBox="0.00 0.00 140.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>height</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="42.25,-19.25 0,-19.25 0,0 42.25,0 42.25,-19.25"/>
-<text text-anchor="middle" x="21.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M7.94,-19.54C1.92,-28.15 6.32,-37.25 21.12,-37.25 29.22,-37.25 34.21,-34.53 36.08,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="39.58,-30.36 34.55,-21.03 32.66,-31.46 39.58,-30.36"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-19.25 78.25,-19.25 78.25,0 132.5,0 132.5,-19.25"/>
-<text text-anchor="middle" x="105.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.46,-9.62C49.7,-9.62 58.11,-9.62 66.35,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.24,-13.13 76.24,-9.63 66.24,-6.13 66.24,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph_org.svg b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph_org.svg
deleted file mode 100644
index ab9333dc2..000000000
--- a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph_org.svg
+++ /dev/null
@@ -1,48 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: height Pages: 1 -->
-<svg width="141pt" height="45pt"
- viewBox="0.00 0.00 140.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>height</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="42.25,-19.25 0,-19.25 0,0 42.25,0 42.25,-19.25"/>
-<text text-anchor="middle" x="21.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M7.94,-19.54C1.92,-28.15 6.32,-37.25 21.12,-37.25 29.22,-37.25 34.21,-34.53 36.08,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="39.58,-30.36 34.55,-21.03 32.66,-31.46 39.58,-30.36"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-19.25 78.25,-19.25 78.25,0 132.5,0 132.5,-19.25"/>
-<text text-anchor="middle" x="105.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.46,-9.62C49.7,-9.62 58.11,-9.62 66.35,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.24,-13.13 76.24,-9.63 66.24,-6.13 66.24,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index a705de29a..000000000
--- a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,30 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,140,55,166"/>
-<area shape="rect" id="Node000002" href="$d8/dee/avltree_8cpp.html#a82659e9e223e520cf91d7e55c4a3f88c" title="calls delete on every node" alt="" coords="103,29,212,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="37,138,63,102,101,64,106,61,109,65,104,68,67,105,42,141"/>
-<area shape="rect" id="Node000003" href="$d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5" title="removes a given element from AVL tree" alt="" coords="114,103,201,128"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="54,143,98,130,100,135,56,148"/>
-<area shape="rect" id="Node000005" href="$d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b" title="inserts a new element into AVL tree" alt="" coords="131,176,184,202"/>
-<area shape="poly" id="edge7_Node000001_Node000005" title=" " alt="" coords="56,157,116,175,115,180,54,162"/>
-<area shape="rect" id="Node000012" href="$d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59" title="prints given tree in the LevelOrder" alt="" coords="117,225,198,251"/>
-<area shape="poly" id="edge16_Node000001_Node000012" title=" " alt="" coords="46,164,72,188,104,212,111,216,108,220,101,216,69,192,43,168"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="135,30,131,21,133,11,143,5,157,3,173,5,182,12,178,16,171,10,157,8,144,10,138,14,136,20,140,28"/>
-<area shape="poly" id="edge4_Node000003_Node000003" title=" " alt="" coords="135,103,131,94,133,85,143,78,157,76,173,79,182,85,178,90,171,84,157,81,144,83,138,88,136,94,140,101"/>
-<area shape="rect" id="Node000004" href="$d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e" title=" " alt="" coords="267,77,341,103"/>
-<area shape="poly" id="edge5_Node000003_Node000004" title=" " alt="" coords="201,105,251,97,252,102,202,111"/>
-<area shape="poly" id="edge6_Node000004_Node000004" title=" " alt="" coords="283,78,279,69,281,59,290,53,304,51,319,53,327,60,324,64,317,58,304,56,292,58,286,62,284,68,288,76"/>
-<area shape="poly" id="edge13_Node000005_Node000005" title=" " alt="" coords="135,177,131,167,133,158,143,152,157,149,173,152,182,159,178,163,171,157,157,155,144,157,138,161,136,167,140,175"/>
-<area shape="rect" id="Node000006" href="$d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6" title="creates and returns a new node" alt="" coords="260,127,348,152"/>
-<area shape="poly" id="edge8_Node000005_Node000006" title=" " alt="" coords="184,177,249,155,250,160,185,183"/>
-<area shape="rect" id="Node000007" href="$d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546" title=" " alt="" coords="261,176,347,202"/>
-<area shape="poly" id="edge9_Node000005_Node000007" title=" " alt="" coords="184,186,246,186,246,192,184,192"/>
-<area shape="rect" id="Node000010" href="$d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6" title=" " alt="" coords="265,225,343,251"/>
-<area shape="poly" id="edge14_Node000005_Node000010" title=" " alt="" coords="185,195,251,218,250,223,184,200"/>
-<area shape="rect" id="Node000011" href="$d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c" title=" " alt="" coords="262,275,347,300"/>
-<area shape="poly" id="edge15_Node000005_Node000011" title=" " alt="" coords="185,196,214,211,229,224,238,236,262,262,265,264,262,268,258,265,234,239,225,227,210,215,183,200"/>
-<area shape="rect" id="Node000008" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="396,176,453,202"/>
-<area shape="poly" id="edge10_Node000007_Node000008" title=" " alt="" coords="348,186,380,186,380,192,348,192"/>
-<area shape="poly" id="edge11_Node000008_Node000008" title=" " alt="" coords="404,177,401,167,403,158,411,152,425,149,439,152,446,159,443,163,436,157,424,155,413,157,408,161,406,167,409,175"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="501,176,573,202"/>
-<area shape="poly" id="edge12_Node000008_Node000009" title=" " alt="" coords="453,186,485,186,485,192,453,192"/>
-</map>
diff --git a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index d7d1ea5bc..000000000
--- a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d5008e294354a113954942af42e9314b
\ No newline at end of file
diff --git a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index f54e5ed30..000000000
--- a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,290 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="434pt" height="229pt"
- viewBox="0.00 0.00 433.75 229.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 225.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-120.25 0,-120.25 0,-101 37,-101 37,-120.25"/>
-<text text-anchor="middle" x="18.5" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#a82659e9e223e520cf91d7e55c4a3f88c" target="_top" xlink:title="calls delete on every node">
-<polygon fill="white" stroke="#666666" points="155,-203.25 73,-203.25 73,-184 155,-184 155,-203.25"/>
-<text text-anchor="middle" x="114" y="-189.75" font-family="Helvetica,sans-Serif" font-size="10.00">deleteAllNodes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.62,-120.65C34.54,-134.57 52.33,-159.83 73,-175.62 74.12,-176.48 75.29,-177.31 76.5,-178.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.47,-180.98 84.89,-182.89 77.93,-174.9 74.47,-180.98"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5" target="_top" xlink:title="removes a given element from AVL tree">
-<polygon fill="white" stroke="#666666" points="146.75,-148.25 81.25,-148.25 81.25,-129 146.75,-129 146.75,-148.25"/>
-<text text-anchor="middle" x="114" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">deleteNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.09,-115.89C46.47,-118.7 58.46,-122.29 70.12,-125.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.08,-129.13 79.66,-128.64 71.09,-122.42 69.08,-129.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b" target="_top" xlink:title="inserts a new element into AVL tree">
-<polygon fill="white" stroke="#666666" points="134,-93.25 94,-93.25 94,-74 134,-74 134,-93.25"/>
-<text text-anchor="middle" x="114" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge7_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge7_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.09,-105.55C49.9,-101.85 67.58,-96.74 82.66,-92.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.47,-95.8 92.1,-89.66 81.52,-89.07 83.47,-95.8"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59" target="_top" xlink:title="prints given tree in the LevelOrder">
-<polygon fill="white" stroke="#666666" points="144.12,-56.25 83.88,-56.25 83.88,-37 144.12,-37 144.12,-56.25"/>
-<text text-anchor="middle" x="114" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">levelOrder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge16_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge16_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.45,-100.51C39.7,-90.48 56.46,-75.14 73,-64.62 74.59,-63.61 76.25,-62.63 77.94,-61.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.22,-64.95 86.53,-57.28 76.04,-58.72 79.22,-64.95"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.05,-203.54C92.23,-212.15 97.21,-221.25 114,-221.25 123.18,-221.25 128.83,-218.53 130.95,-214.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.44,-214.25 129.22,-205.03 127.55,-215.49 134.44,-214.25"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.05,-148.54C92.23,-157.15 97.21,-166.25 114,-166.25 123.18,-166.25 128.83,-163.53 130.95,-159.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.44,-159.25 129.22,-150.03 127.55,-160.49 134.44,-159.25"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252,-167.25 196.25,-167.25 196.25,-148 252,-148 252,-167.25"/>
-<text text-anchor="middle" x="224.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">minValue</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge5_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge5_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.15,-144.27C158.94,-146.35 172.41,-148.71 184.7,-150.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.08,-154.32 194.54,-152.6 185.29,-147.42 184.08,-154.32"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge6_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge6_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M210,-167.54C203.55,-176.15 208.26,-185.25 224.12,-185.25 232.8,-185.25 238.14,-182.53 240.14,-178.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.64,-178.3 238.51,-169.03 236.73,-179.48 243.64,-178.3"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge13_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge13_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.05,-93.54C92.23,-102.15 97.21,-111.25 114,-111.25 123.18,-111.25 128.83,-108.53 130.95,-104.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.44,-104.25 129.22,-95.03 127.55,-105.49 134.44,-104.25"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6" target="_top" xlink:title="creates and returns a new node">
-<polygon fill="white" stroke="#666666" points="257.25,-130.25 191,-130.25 191,-111 257.25,-111 257.25,-130.25"/>
-<text text-anchor="middle" x="224.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">createNode</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge8_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge8_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.33,-90.24C147.88,-94.88 166.49,-101.24 183.17,-106.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.75,-110.17 192.34,-110.09 184.02,-103.54 181.75,-110.17"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="256.5,-93.25 191.75,-93.25 191.75,-74 256.5,-74 256.5,-93.25"/>
-<text text-anchor="middle" x="224.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">getBalance</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge9_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge9_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.33,-83.62C147.14,-83.62 164.45,-83.62 180.39,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.16,-87.13 190.16,-83.63 180.16,-80.13 180.16,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.5,-56.25 194.75,-56.25 194.75,-37 253.5,-37 253.5,-56.25"/>
-<text text-anchor="middle" x="224.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">leftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge14_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge14_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.33,-77.01C148.08,-72.3 167.04,-65.82 183.9,-60.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.85,-63.42 193.17,-56.87 182.58,-56.8 184.85,-63.42"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="256.12,-19.25 192.12,-19.25 192.12,0 256.12,0 256.12,-19.25"/>
-<text text-anchor="middle" x="224.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">rightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node11 -->
-<g id="edge15_Node000005_Node000011" class="edge">
-<title>Node5&#45;&gt;Node11</title>
-<g id="a_edge15_Node000005_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.14,-76.8C141.03,-73.89 148.67,-70.12 155,-65.62 173.97,-52.15 172.64,-41.92 191,-27.62 191.82,-26.99 192.66,-26.36 193.52,-25.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.35,-28.73 201.89,-20.39 191.58,-22.83 195.35,-28.73"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="335.5,-93.25 293.25,-93.25 293.25,-74 335.5,-74 335.5,-93.25"/>
-<text text-anchor="middle" x="314.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge10_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge10_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.99,-83.62C264.92,-83.62 273.43,-83.62 281.37,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.32,-87.13 291.32,-83.63 281.32,-80.13 281.32,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge11_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge11_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M301.19,-93.54C295.17,-102.15 299.57,-111.25 314.38,-111.25 322.47,-111.25 327.46,-108.53 329.33,-104.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="332.83,-104.36 327.8,-95.03 325.91,-105.46 332.83,-104.36"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="425.75,-93.25 371.5,-93.25 371.5,-74 425.75,-74 425.75,-93.25"/>
-<text text-anchor="middle" x="398.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge12_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge12_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M335.71,-83.62C342.95,-83.62 351.36,-83.62 359.6,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="359.49,-87.13 369.49,-83.63 359.49,-80.13 359.49,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 1bc6d4f1c..000000000
--- a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,264 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="434pt" height="229pt"
- viewBox="0.00 0.00 433.75 229.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 225.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-120.25 0,-120.25 0,-101 37,-101 37,-120.25"/>
-<text text-anchor="middle" x="18.5" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#a82659e9e223e520cf91d7e55c4a3f88c" target="_top" xlink:title="calls delete on every node">
-<polygon fill="white" stroke="#666666" points="155,-203.25 73,-203.25 73,-184 155,-184 155,-203.25"/>
-<text text-anchor="middle" x="114" y="-189.75" font-family="Helvetica,sans-Serif" font-size="10.00">deleteAllNodes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.62,-120.65C34.54,-134.57 52.33,-159.83 73,-175.62 74.12,-176.48 75.29,-177.31 76.5,-178.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.47,-180.98 84.89,-182.89 77.93,-174.9 74.47,-180.98"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5" target="_top" xlink:title="removes a given element from AVL tree">
-<polygon fill="white" stroke="#666666" points="146.75,-148.25 81.25,-148.25 81.25,-129 146.75,-129 146.75,-148.25"/>
-<text text-anchor="middle" x="114" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">deleteNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.09,-115.89C46.47,-118.7 58.46,-122.29 70.12,-125.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.08,-129.13 79.66,-128.64 71.09,-122.42 69.08,-129.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b" target="_top" xlink:title="inserts a new element into AVL tree">
-<polygon fill="white" stroke="#666666" points="134,-93.25 94,-93.25 94,-74 134,-74 134,-93.25"/>
-<text text-anchor="middle" x="114" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge7_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge7_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.09,-105.55C49.9,-101.85 67.58,-96.74 82.66,-92.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.47,-95.8 92.1,-89.66 81.52,-89.07 83.47,-95.8"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59" target="_top" xlink:title="prints given tree in the LevelOrder">
-<polygon fill="white" stroke="#666666" points="144.12,-56.25 83.88,-56.25 83.88,-37 144.12,-37 144.12,-56.25"/>
-<text text-anchor="middle" x="114" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">levelOrder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge16_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge16_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.45,-100.51C39.7,-90.48 56.46,-75.14 73,-64.62 74.59,-63.61 76.25,-62.63 77.94,-61.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.22,-64.95 86.53,-57.28 76.04,-58.72 79.22,-64.95"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.05,-203.54C92.23,-212.15 97.21,-221.25 114,-221.25 123.18,-221.25 128.83,-218.53 130.95,-214.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.44,-214.25 129.22,-205.03 127.55,-215.49 134.44,-214.25"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.05,-148.54C92.23,-157.15 97.21,-166.25 114,-166.25 123.18,-166.25 128.83,-163.53 130.95,-159.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.44,-159.25 129.22,-150.03 127.55,-160.49 134.44,-159.25"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252,-167.25 196.25,-167.25 196.25,-148 252,-148 252,-167.25"/>
-<text text-anchor="middle" x="224.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">minValue</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge5_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge5_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.15,-144.27C158.94,-146.35 172.41,-148.71 184.7,-150.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.08,-154.32 194.54,-152.6 185.29,-147.42 184.08,-154.32"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge6_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge6_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M210,-167.54C203.55,-176.15 208.26,-185.25 224.12,-185.25 232.8,-185.25 238.14,-182.53 240.14,-178.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.64,-178.3 238.51,-169.03 236.73,-179.48 243.64,-178.3"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge13_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge13_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.05,-93.54C92.23,-102.15 97.21,-111.25 114,-111.25 123.18,-111.25 128.83,-108.53 130.95,-104.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.44,-104.25 129.22,-95.03 127.55,-105.49 134.44,-104.25"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6" target="_top" xlink:title="creates and returns a new node">
-<polygon fill="white" stroke="#666666" points="257.25,-130.25 191,-130.25 191,-111 257.25,-111 257.25,-130.25"/>
-<text text-anchor="middle" x="224.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">createNode</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge8_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge8_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.33,-90.24C147.88,-94.88 166.49,-101.24 183.17,-106.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.75,-110.17 192.34,-110.09 184.02,-103.54 181.75,-110.17"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="256.5,-93.25 191.75,-93.25 191.75,-74 256.5,-74 256.5,-93.25"/>
-<text text-anchor="middle" x="224.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">getBalance</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge9_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge9_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.33,-83.62C147.14,-83.62 164.45,-83.62 180.39,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.16,-87.13 190.16,-83.63 180.16,-80.13 180.16,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.5,-56.25 194.75,-56.25 194.75,-37 253.5,-37 253.5,-56.25"/>
-<text text-anchor="middle" x="224.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">leftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge14_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge14_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.33,-77.01C148.08,-72.3 167.04,-65.82 183.9,-60.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.85,-63.42 193.17,-56.87 182.58,-56.8 184.85,-63.42"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="256.12,-19.25 192.12,-19.25 192.12,0 256.12,0 256.12,-19.25"/>
-<text text-anchor="middle" x="224.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">rightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node11 -->
-<g id="edge15_Node000005_Node000011" class="edge">
-<title>Node5&#45;&gt;Node11</title>
-<g id="a_edge15_Node000005_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.14,-76.8C141.03,-73.89 148.67,-70.12 155,-65.62 173.97,-52.15 172.64,-41.92 191,-27.62 191.82,-26.99 192.66,-26.36 193.52,-25.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.35,-28.73 201.89,-20.39 191.58,-22.83 195.35,-28.73"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="335.5,-93.25 293.25,-93.25 293.25,-74 335.5,-74 335.5,-93.25"/>
-<text text-anchor="middle" x="314.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge10_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge10_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.99,-83.62C264.92,-83.62 273.43,-83.62 281.37,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.32,-87.13 291.32,-83.63 281.32,-80.13 281.32,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge11_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge11_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M301.19,-93.54C295.17,-102.15 299.57,-111.25 314.38,-111.25 322.47,-111.25 327.46,-108.53 329.33,-104.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="332.83,-104.36 327.8,-95.03 325.91,-105.46 332.83,-104.36"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="425.75,-93.25 371.5,-93.25 371.5,-74 425.75,-74 425.75,-93.25"/>
-<text text-anchor="middle" x="398.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge12_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge12_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M335.71,-83.62C342.95,-83.62 351.36,-83.62 359.6,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="359.49,-87.13 369.49,-83.63 359.49,-80.13 359.49,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/dee/avltree_8cpp_source.html b/d8/dee/avltree_8cpp_source.html
new file mode 100644
index 000000000..9ab2bbbf0
--- /dev/null
+++ b/d8/dee/avltree_8cpp_source.html
@@ -0,0 +1,315 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/avltree.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/dee/avltree_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">avltree.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/dee/avltree_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;queue&gt;</span>      </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="foldopen" id="foldopen00013" data-start="{" data-end="};">
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"><a class="line" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">   13</a></span><span class="keyword">using </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> {</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordtype">int</span> data;</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *left;</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *right;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>};</div>
+</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="foldopen" id="foldopen00025" data-start="{" data-end="}">
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"><a class="line" href="../../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6">   25</a></span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6">createNode</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *nn = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>();</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    nn-&gt;data = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    nn-&gt;height = 0;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    nn-&gt;left = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    nn-&gt;right = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordflow">return</span> nn;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>}</div>
+</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="foldopen" id="foldopen00038" data-start="{" data-end="}">
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">   38</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *root) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    }</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">return</span> 1 + std::max(<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;left), <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;right));</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>}</div>
+</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"><a class="line" href="../../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546">   49</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546">getBalance</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *root) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;left) - <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;right); }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="foldopen" id="foldopen00055" data-start="{" data-end="}">
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c">   55</a></span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c">rightRotate</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *root) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = root-&gt;left;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *u = t-&gt;right;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    t-&gt;right = root;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    root-&gt;left = u;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">return</span> t;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>}</div>
+</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="foldopen" id="foldopen00067" data-start="{" data-end="}">
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6">   67</a></span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6">leftRotate</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *root) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = root-&gt;right;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *u = t-&gt;left;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    t-&gt;left = root;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    root-&gt;right = u;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keywordflow">return</span> t;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>}</div>
+</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="foldopen" id="foldopen00079" data-start="{" data-end="}">
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="../../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e">   79</a></span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e">minValue</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *root) {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordflow">if</span> (root-&gt;left == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <span class="keywordflow">return</span> root;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    }</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e">minValue</a>(root-&gt;left);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>}</div>
+</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="foldopen" id="foldopen00092" data-start="{" data-end="}">
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">   92</a></span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *root, <span class="keywordtype">int</span> item) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6">createNode</a>(item);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    }</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="keywordflow">if</span> (item &lt; root-&gt;<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        root-&gt;left = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>(root-&gt;left, item);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        root-&gt;right = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>(root-&gt;right, item);</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    }</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keywordtype">int</span> b = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546">getBalance</a>(root);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="keywordflow">if</span> (b &gt; 1) {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546">getBalance</a>(root-&gt;left) &lt; 0) {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>            root-&gt;left = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6">leftRotate</a>(root-&gt;left);  <span class="comment">// Left-Right Case</span></div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        }</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c">rightRotate</a>(root);  <span class="comment">// Left-Left Case</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (b &lt; -1) {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546">getBalance</a>(root-&gt;right) &gt; 0) {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            root-&gt;right = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c">rightRotate</a>(root-&gt;right);  <span class="comment">// Right-Left Case</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        }</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6">leftRotate</a>(root);  <span class="comment">// Right-Right Case</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    }</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="keywordflow">return</span> root;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>}</div>
+</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="foldopen" id="foldopen00122" data-start="{" data-end="}">
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"><a class="line" href="../../d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5">  122</a></span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5">deleteNode</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *root, <span class="keywordtype">int</span> element) {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        <span class="keywordflow">return</span> root;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    }</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <span class="keywordflow">if</span> (element &lt; root-&gt;<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        root-&gt;left = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5">deleteNode</a>(root-&gt;left, element);</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (element &gt; root-&gt;data) {</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        root-&gt;right = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5">deleteNode</a>(root-&gt;right, element);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        <span class="comment">// Node to be deleted is leaf node or have only one Child</span></div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        <span class="keywordflow">if</span> (!root-&gt;right || !root-&gt;left) {</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *temp = !root-&gt;right ? root-&gt;left : root-&gt;right;</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>            <span class="keyword">delete</span> root;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>            <span class="keywordflow">return</span> temp;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        }</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>        <span class="comment">// Node to be deleted have both left and right subtrees</span></div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *temp = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e">minValue</a>(root-&gt;right);</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        root-&gt;data = temp-&gt;data;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        root-&gt;right = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5">deleteNode</a>(root-&gt;right, temp-&gt;data);</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    }</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <span class="comment">// Balancing Tree after deletion</span></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <span class="keywordflow">return</span> root;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>}</div>
+</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span> </div>
+<div class="foldopen" id="foldopen00151" data-start="{" data-end="}">
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"><a class="line" href="../../d8/dee/avltree_8cpp.html#a82659e9e223e520cf91d7e55c4a3f88c">  151</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a82659e9e223e520cf91d7e55c4a3f88c">deleteAllNodes</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *<span class="keyword">const</span> root) {</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    <span class="keywordflow">if</span> (root) {</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>        <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a82659e9e223e520cf91d7e55c4a3f88c">deleteAllNodes</a>(root-&gt;left);</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a82659e9e223e520cf91d7e55c4a3f88c">deleteAllNodes</a>(root-&gt;right);</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>        <span class="keyword">delete</span> root;</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    }</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>}</div>
+</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span> </div>
+<div class="foldopen" id="foldopen00163" data-start="{" data-end="}">
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"><a class="line" href="../../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59">  163</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59">levelOrder</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *root) {</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    std::queue&lt;node *&gt; q;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    q.push(root);</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    <span class="keywordflow">while</span> (!q.empty()) {</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>        root = q.front();</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        std::cout &lt;&lt; root-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>        q.pop();</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        <span class="keywordflow">if</span> (root-&gt;left) {</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>            q.push(root-&gt;left);</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>        }</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>        <span class="keywordflow">if</span> (root-&gt;right) {</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>            q.push(root-&gt;right);</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        }</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    }</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>}</div>
+</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="foldopen" id="foldopen00183" data-start="{" data-end="}">
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"><a class="line" href="../../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  183</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    <span class="comment">// Testing AVL Tree</span></div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *root = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    <span class="keywordtype">int</span> i = 0;</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    <span class="keywordflow">for</span> (i = 1; i &lt;= 7; i++) root = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>(root, i);</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;LevelOrder: &quot;</span>;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59">levelOrder</a>(root);</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    root = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5">deleteNode</a>(root, 1);  <span class="comment">// Deleting key with value 1</span></div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nLevelOrder: &quot;</span>;</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59">levelOrder</a>(root);</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    root = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5">deleteNode</a>(root, 4);  <span class="comment">// Deletin key with value 4</span></div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nLevelOrder: &quot;</span>;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59">levelOrder</a>(root);</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a82659e9e223e520cf91d7e55c4a3f88c">deleteAllNodes</a>(root);</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>}</div>
+</div>
+<div class="ttc" id="aavltree_8cpp_html_a2473fe7416332495b2678ebe89652e4b"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a></div><div class="ttdeci">node * insert(node *root, int item)</div><div class="ttdoc">inserts a new element into AVL tree</div><div class="ttdef"><b>Definition</b> <a href="#l00092">avltree.cpp:92</a></div></div>
+<div class="ttc" id="aavltree_8cpp_html_a473eee1803e4e44a54d685e4b0eef5a6"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6">leftRotate</a></div><div class="ttdeci">node * leftRotate(node *root)</div><div class="ttdef"><b>Definition</b> <a href="#l00067">avltree.cpp:67</a></div></div>
+<div class="ttc" id="aavltree_8cpp_html_a48d897353aeb6a721dbc6b6c57e035e6"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6">createNode</a></div><div class="ttdeci">node * createNode(int data)</div><div class="ttdoc">creates and returns a new node</div><div class="ttdef"><b>Definition</b> <a href="#l00025">avltree.cpp:25</a></div></div>
+<div class="ttc" id="aavltree_8cpp_html_a5fa160a678a34dd51c0aea1c0c00ed5e"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e">minValue</a></div><div class="ttdeci">node * minValue(node *root)</div><div class="ttdef"><b>Definition</b> <a href="#l00079">avltree.cpp:79</a></div></div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="aavltree_8cpp_html_a82659e9e223e520cf91d7e55c4a3f88c"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a82659e9e223e520cf91d7e55c4a3f88c">deleteAllNodes</a></div><div class="ttdeci">void deleteAllNodes(const node *const root)</div><div class="ttdoc">calls delete on every node</div><div class="ttdef"><b>Definition</b> <a href="#l00151">avltree.cpp:151</a></div></div>
+<div class="ttc" id="aavltree_8cpp_html_aa29a7fdc2db1784f5a6e25025ff7cbf5"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5">deleteNode</a></div><div class="ttdeci">node * deleteNode(node *root, int element)</div><div class="ttdoc">removes a given element from AVL tree</div><div class="ttdef"><b>Definition</b> <a href="#l00122">avltree.cpp:122</a></div></div>
+<div class="ttc" id="aavltree_8cpp_html_aaa457ffec24c9643f2768e7a65e96546"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546">getBalance</a></div><div class="ttdeci">int getBalance(node *root)</div><div class="ttdef"><b>Definition</b> <a href="#l00049">avltree.cpp:49</a></div></div>
+<div class="ttc" id="aavltree_8cpp_html_adfc1d482a564c041756719667b955b8c"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c">rightRotate</a></div><div class="ttdeci">node * rightRotate(node *root)</div><div class="ttdef"><b>Definition</b> <a href="#l00055">avltree.cpp:55</a></div></div>
+<div class="ttc" id="aavltree_8cpp_html_ae197eb50188fb761346952b9b5f6be59"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59">levelOrder</a></div><div class="ttdeci">void levelOrder(node *root)</div><div class="ttdoc">prints given tree in the LevelOrder</div><div class="ttdef"><b>Definition</b> <a href="#l00163">avltree.cpp:163</a></div></div>
+<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition</b> <a href="#l00038">avltree.cpp:38</a></div></div>
+<div class="ttc" id="aavltree_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00183">avltree.cpp:183</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d8/dee/avltree_8cpp.html">avltree.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/df0/queue__using__array_8cpp.html b/d8/df0/queue__using__array_8cpp.html
index ba12b61b0..e2c51e10e 100644
--- a/d8/df0/queue__using__array_8cpp.html
+++ b/d8/df0/queue__using__array_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/queue_using_array.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/queue_using_array.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for queue_using_array.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d6d/queue__using__array_8cpp__incl.svg" width="242" height="126"><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">
+</div>
+<p><a href="../../d8/df0/queue__using__array_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a></td></tr>
@@ -148,7 +167,7 @@ Functions</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
 <tr class="memitem:a2d49e79bd164c298912db252970520d8" id="r_a2d49e79bd164c298912db252970520d8"><td class="memItemLeft" align="right" valign="top">constexpr uint16_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2d49e79bd164c298912db252970520d8">max_size</a> {10}</td></tr>
-<tr class="memdesc:a2d49e79bd164c298912db252970520d8"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>  <br /></td></tr>
+<tr class="memdesc:a2d49e79bd164c298912db252970520d8"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::array  <br /></td></tr>
 <tr class="separator:a2d49e79bd164c298912db252970520d8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -161,6 +180,8 @@ Algorithm</h3>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/pooja-git11" target="_blank">Pooja</a> </dd>
 <dd>
 <a href="https://github.com/farbodahm" target="_blank">Farbod Ahmadian</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html">queue_using_array.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -179,49 +200,43 @@ Algorithm</h3>
 
 <p>Main function. </p>
 <p>Allows the user to add and delete values from the queue. Also allows user to display values in the queue. </p><dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html#l00112">112</a> of file <a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html">queue_using_array.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  112</span>           {</div>
 <div class="line"><span class="lineno">  113</span>    <span class="keywordtype">int</span> op{0}, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>{0};</div>
 <div class="line"><span class="lineno">  114</span>    <a class="code hl_class" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a> ob;</div>
 <div class="line"><span class="lineno">  115</span> </div>
-<div class="line"><span class="lineno">  116</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n1. enqueue(Insertion) &quot;</span>;</div>
-<div class="line"><span class="lineno">  117</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n2. dequeue(Deletion)&quot;</span>;</div>
-<div class="line"><span class="lineno">  118</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n3. Display&quot;</span>;</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> &lt;&lt; <span class="stringliteral">&quot;\n4. Exit&quot;</span>;</div>
+<div class="line"><span class="lineno">  116</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n1. enqueue(Insertion) &quot;</span>;</div>
+<div class="line"><span class="lineno">  117</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n2. dequeue(Deletion)&quot;</span>;</div>
+<div class="line"><span class="lineno">  118</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n3. Display&quot;</span>;</div>
+<div class="line"><span class="lineno">  119</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n4. Exit&quot;</span>;</div>
 <div class="line"><span class="lineno">  120</span>    <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
-<div class="line"><span class="lineno">  121</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter your choice &quot;</span>;</div>
-<div class="line"><span class="lineno">  122</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; op;</div>
+<div class="line"><span class="lineno">  121</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter your choice &quot;</span>;</div>
+<div class="line"><span class="lineno">  122</span>        std::cin &gt;&gt; op;</div>
 <div class="line"><span class="lineno">  123</span>        <span class="keywordflow">if</span> (op == 1) {</div>
-<div class="line"><span class="lineno">  124</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter data  &quot;</span>;</div>
-<div class="line"><span class="lineno">  125</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
+<div class="line"><span class="lineno">  124</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Enter data  &quot;</span>;</div>
+<div class="line"><span class="lineno">  125</span>            std::cin &gt;&gt; <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
 <div class="line"><span class="lineno">  126</span>            ob.<a class="code hl_function" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">enqueue</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
 <div class="line"><span class="lineno">  127</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 2) {</div>
 <div class="line"><span class="lineno">  128</span>            <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> = ob.<a class="code hl_function" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">dequeue</a>();</div>
-<div class="line"><span class="lineno">  129</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\ndequeue element is:\t&quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
+<div class="line"><span class="lineno">  129</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\ndequeue element is:\t&quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
 <div class="line"><span class="lineno">  130</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 3) {</div>
 <div class="line"><span class="lineno">  131</span>            ob.<a class="code hl_function" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">display</a>();</div>
 <div class="line"><span class="lineno">  132</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 4) {</div>
-<div class="line"><span class="lineno">  133</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">exit</a>(0);</div>
+<div class="line"><span class="lineno">  133</span>            exit(0);</div>
 <div class="line"><span class="lineno">  134</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  135</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nWrong choice &quot;</span>;</div>
+<div class="line"><span class="lineno">  135</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nWrong choice &quot;</span>;</div>
 <div class="line"><span class="lineno">  136</span>        }</div>
 <div class="line"><span class="lineno">  137</span>    }</div>
 <div class="line"><span class="lineno">  138</span> </div>
 <div class="line"><span class="lineno">  139</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  140</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a></div><div class="ttdoc">Queue_Array class containing the main data and also index of head and tail of the array.</div><div class="ttdef"><b>Definition</b> queue_using_array.cpp:44</div></div>
-<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a2aaf88c9954ef3ab686f8e4bfbd87622"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">data_structures::queue_using_array::Queue_Array::dequeue</a></div><div class="ttdeci">int dequeue()</div><div class="ttdoc">Delete element from back of the queue.</div><div class="ttdef"><b>Definition</b> queue_using_array.cpp:76</div></div>
-<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a4dc64488c36f84d927365fa8d1933663"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">data_structures::queue_using_array::Queue_Array::enqueue</a></div><div class="ttdeci">void enqueue(const int16_t &amp;)</div><div class="ttdoc">Add element to the first of the queue.</div><div class="ttdef"><b>Definition</b> queue_using_array.cpp:59</div></div>
-<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a688b7ea064739ea9fa66bf64bf4ae631"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">data_structures::queue_using_array::Queue_Array::display</a></div><div class="ttdeci">void display() const</div><div class="ttdoc">Show all saved data.</div><div class="ttdef"><b>Definition</b> queue_using_array.cpp:94</div></div>
-<div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
-<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="444" height="227"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a></div><div class="ttdoc">Queue_Array class containing the main data and also index of head and tail of the array.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/df0/queue__using__array_8cpp_source.html#l00044">queue_using_array.cpp:44</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a2aaf88c9954ef3ab686f8e4bfbd87622"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">data_structures::queue_using_array::Queue_Array::dequeue</a></div><div class="ttdeci">int dequeue()</div><div class="ttdoc">Delete element from back of the queue.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/df0/queue__using__array_8cpp_source.html#l00076">queue_using_array.cpp:76</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a4dc64488c36f84d927365fa8d1933663"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">data_structures::queue_using_array::Queue_Array::enqueue</a></div><div class="ttdeci">void enqueue(const int16_t &amp;)</div><div class="ttdoc">Add element to the first of the queue.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/df0/queue__using__array_8cpp_source.html#l00059">queue_using_array.cpp:59</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a688b7ea064739ea9fa66bf64bf4ae631"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">data_structures::queue_using_array::Queue_Array::display</a></div><div class="ttdeci">void display() const</div><div class="ttdoc">Show all saved data.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/df0/queue__using__array_8cpp_source.html#l00094">queue_using_array.cpp:94</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Variable Documentation</h2>
@@ -245,9 +260,11 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> </p>
+<p>for std::array </p>
 <p>for io operations Maximum size of the queue </p>
-<div class="fragment"><div class="line"><span class="lineno">   24</span>{10};  <span class="comment">///&lt; Maximum size of the queue</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html#l00024">24</a> of file <a class="el" href="../../d8/df0/queue__using__array_8cpp_source.html">queue_using_array.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   24</span>{10};  </div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 3ac0e7d99..000000000
--- a/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,14 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,100,55,126"/>
-<area shape="rect" id="Node000002" href="$d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622" title="Delete element from back of the queue." alt="" coords="103,5,282,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="53,97,101,71,112,66,114,70,104,76,55,102"/>
-<area shape="rect" id="Node000004" href="$d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631" title="Show all saved data." alt="" coords="103,85,282,141"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="55,110,87,110,87,116,55,116"/>
-<area shape="rect" id="Node000005" href="$d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663" title="Add element to the first of the queue." alt="" coords="103,165,282,221"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="55,124,104,151,114,156,112,161,101,156,53,129"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/at.html#" title=" " alt="" coords="336,60,432,86"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="283,49,322,58,321,63,282,54"/>
-<area shape="poly" id="edge4_Node000004_Node000003" title=" " alt="" coords="282,92,321,84,322,89,283,97"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="330,180,438,206"/>
-<area shape="poly" id="edge6_Node000005_Node000006" title=" " alt="" coords="282,190,314,190,314,196,282,196"/>
-</map>
diff --git a/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 1a34b0267..000000000
--- a/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3137866bbd06e8f59a4af320209890aa
\ No newline at end of file
diff --git a/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 4ac5ca9dd..000000000
--- a/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,152 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="333pt" height="170pt"
- viewBox="0.00 0.00 332.75 169.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 165.75)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-90.5 0,-90.5 0,-71.25 37,-71.25 37,-90.5"/>
-<text text-anchor="middle" x="18.5" y="-77" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622" target="_top" xlink:title="Delete element from back of the queue.">
-<polygon fill="white" stroke="#666666" points="207.5,-161.75 73,-161.75 73,-120 207.5,-120 207.5,-161.75"/>
-<text text-anchor="start" x="81" y="-148.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::queue</text>
-<text text-anchor="start" x="81" y="-137" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array::Queue_Array</text>
-<text text-anchor="middle" x="140.25" y="-125.75" font-family="Helvetica,sans-Serif" font-size="10.00">::dequeue</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.64,-90.98C47.04,-96.99 60.65,-104.63 73,-110.88 75.51,-112.15 78.09,-113.42 80.71,-114.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79,-117.76 89.53,-118.91 82.01,-111.44 79,-117.76"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631" target="_top" xlink:title="Show all saved data.">
-<polygon fill="white" stroke="#666666" points="207.5,-101.75 73,-101.75 73,-60 207.5,-60 207.5,-101.75"/>
-<text text-anchor="start" x="81" y="-88.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::queue</text>
-<text text-anchor="start" x="81" y="-77" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array::Queue_Array</text>
-<text text-anchor="middle" x="140.25" y="-65.75" font-family="Helvetica,sans-Serif" font-size="10.00">::display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.43,-80.88C44.22,-80.88 52.45,-80.88 61.27,-80.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.16,-84.38 71.16,-80.88 61.16,-77.38 61.16,-84.38"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663" target="_top" xlink:title="Add element to the first of the queue.">
-<polygon fill="white" stroke="#666666" points="207.5,-41.75 73,-41.75 73,0 207.5,0 207.5,-41.75"/>
-<text text-anchor="start" x="81" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::queue</text>
-<text text-anchor="start" x="81" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array::Queue_Array</text>
-<text text-anchor="middle" x="140.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::enqueue</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.64,-70.77C47.04,-64.76 60.65,-57.12 73,-50.88 75.51,-49.6 78.09,-48.33 80.71,-47.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.01,-50.31 89.53,-42.84 79,-43.99 82.01,-50.31"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="319.88,-120.5 248.38,-120.5 248.38,-101.25 319.88,-101.25 319.88,-120.5"/>
-<text text-anchor="middle" x="284.12" y="-107" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.62,-126.84C217.56,-124.74 227.63,-122.61 237.03,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.58,-124.08 246.64,-118.59 236.13,-117.24 237.58,-124.08"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.62,-94.91C217.56,-97.01 227.63,-99.14 237.03,-101.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.13,-104.51 246.64,-103.16 237.58,-97.67 236.13,-104.51"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.75,-30.5 243.5,-30.5 243.5,-11.25 324.75,-11.25 324.75,-30.5"/>
-<text text-anchor="middle" x="284.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.62,-20.88C215.66,-20.88 223.79,-20.88 231.58,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.57,-24.38 241.57,-20.88 231.57,-17.38 231.57,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 12d09a2d4..000000000
--- a/d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,126 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="333pt" height="170pt"
- viewBox="0.00 0.00 332.75 169.75" 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 165.75)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-90.5 0,-90.5 0,-71.25 37,-71.25 37,-90.5"/>
-<text text-anchor="middle" x="18.5" y="-77" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622" target="_top" xlink:title="Delete element from back of the queue.">
-<polygon fill="white" stroke="#666666" points="207.5,-161.75 73,-161.75 73,-120 207.5,-120 207.5,-161.75"/>
-<text text-anchor="start" x="81" y="-148.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::queue</text>
-<text text-anchor="start" x="81" y="-137" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array::Queue_Array</text>
-<text text-anchor="middle" x="140.25" y="-125.75" font-family="Helvetica,sans-Serif" font-size="10.00">::dequeue</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.64,-90.98C47.04,-96.99 60.65,-104.63 73,-110.88 75.51,-112.15 78.09,-113.42 80.71,-114.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79,-117.76 89.53,-118.91 82.01,-111.44 79,-117.76"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631" target="_top" xlink:title="Show all saved data.">
-<polygon fill="white" stroke="#666666" points="207.5,-101.75 73,-101.75 73,-60 207.5,-60 207.5,-101.75"/>
-<text text-anchor="start" x="81" y="-88.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::queue</text>
-<text text-anchor="start" x="81" y="-77" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array::Queue_Array</text>
-<text text-anchor="middle" x="140.25" y="-65.75" font-family="Helvetica,sans-Serif" font-size="10.00">::display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.43,-80.88C44.22,-80.88 52.45,-80.88 61.27,-80.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.16,-84.38 71.16,-80.88 61.16,-77.38 61.16,-84.38"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663" target="_top" xlink:title="Add element to the first of the queue.">
-<polygon fill="white" stroke="#666666" points="207.5,-41.75 73,-41.75 73,0 207.5,0 207.5,-41.75"/>
-<text text-anchor="start" x="81" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::queue</text>
-<text text-anchor="start" x="81" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array::Queue_Array</text>
-<text text-anchor="middle" x="140.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::enqueue</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M36.64,-70.77C47.04,-64.76 60.65,-57.12 73,-50.88 75.51,-49.6 78.09,-48.33 80.71,-47.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.01,-50.31 89.53,-42.84 79,-43.99 82.01,-50.31"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="319.88,-120.5 248.38,-120.5 248.38,-101.25 319.88,-101.25 319.88,-120.5"/>
-<text text-anchor="middle" x="284.12" y="-107" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.62,-126.84C217.56,-124.74 227.63,-122.61 237.03,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.58,-124.08 246.64,-118.59 236.13,-117.24 237.58,-124.08"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.62,-94.91C217.56,-97.01 227.63,-99.14 237.03,-101.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.13,-104.51 246.64,-103.16 237.58,-97.67 236.13,-104.51"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.75,-30.5 243.5,-30.5 243.5,-11.25 324.75,-11.25 324.75,-30.5"/>
-<text text-anchor="middle" x="284.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.62,-20.88C215.66,-20.88 223.79,-20.88 231.58,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.57,-24.38 241.57,-20.88 231.57,-17.38 231.57,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/df0/queue__using__array_8cpp_source.html b/d8/df0/queue__using__array_8cpp_source.html
new file mode 100644
index 000000000..e4ff2de02
--- /dev/null
+++ b/d8/df0/queue__using__array_8cpp_source.html
@@ -0,0 +1,249 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/queue_using_array.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/df0/queue__using__array_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">queue_using_array.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/df0/queue__using__array_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;array&gt;</span>     </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"><a class="line" href="../../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">   24</a></span><span class="keyword">constexpr</span> uint16_t <a class="code hl_variable" href="../../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">max_size</a>{10};  </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d3c/namespacedata__structures.html">data_structures</a> {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/d70/namespacequeue__using__array.html">queue_using_array</a> {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="foldopen" id="foldopen00044" data-start="{" data-end="};">
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">   44</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">Queue_Array</a> {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">enqueue</a>(<span class="keyword">const</span> int16_t&amp;);  </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">dequeue</a>();                 </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">display</a>() <span class="keyword">const</span>;          </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"><a class="line" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">   50</a></span>    int8_t <a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a>{-1};                     </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">   51</a></span>    int8_t <a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>{-1};                      </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">   52</a></span>    std::array&lt;int16_t, max_size&gt; <a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>{};  </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>};</div>
+</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="foldopen" id="foldopen00059" data-start="{" data-end="}">
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">   59</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">Queue_Array::enqueue</a>(<span class="keyword">const</span> int16_t&amp; ele) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> == <a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.size() - 1) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nStack is full&quot;</span>;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == -1 &amp;&amp; <a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> == -1) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> = 0;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        <a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> = 0;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>[<a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>] = ele;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> &lt; <a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.size()) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        ++<a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        <a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>[<a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>] = ele;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>}</div>
+</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="foldopen" id="foldopen00076" data-start="{" data-end="}">
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"><a class="line" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">   76</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">Queue_Array::dequeue</a>() {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    int8_t d{0};</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == -1) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nstack is empty &quot;</span>;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == <a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>) {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        d = <a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.at(<a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a>);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> = <a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> = -1;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        d = <a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.at(<a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a>++);</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    }</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keywordflow">return</span> d;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>}</div>
+</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="foldopen" id="foldopen00094" data-start="{" data-end="}">
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"><a class="line" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">   94</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">Queue_Array::display</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == -1) {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nStack is empty&quot;</span>;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        <span class="keywordflow">for</span> (int16_t i{<a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a>}; i &lt;= <a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>; ++i) std::cout &lt;&lt; <a class="code hl_variable" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.at(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    }</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>}</div>
+</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>}  <span class="comment">// namespace queue_using_array</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>}  <span class="comment">// namespace data_structures</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="foldopen" id="foldopen00112" data-start="{" data-end="}">
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"><a class="line" href="../../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  112</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="keywordtype">int</span> op{0}, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>{0};</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <a class="code hl_class" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a> ob;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n1. enqueue(Insertion) &quot;</span>;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n2. dequeue(Deletion)&quot;</span>;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n3. Display&quot;</span>;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n4. Exit&quot;</span>;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter your choice &quot;</span>;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        std::cin &gt;&gt; op;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        <span class="keywordflow">if</span> (op == 1) {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Enter data  &quot;</span>;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>            std::cin &gt;&gt; <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>            ob.<a class="code hl_function" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">enqueue</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 2) {</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>            <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> = ob.<a class="code hl_function" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">dequeue</a>();</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\ndequeue element is:\t&quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 3) {</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>            ob.<a class="code hl_function" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">display</a>();</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 4) {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>            exit(0);</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nWrong choice &quot;</span>;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        }</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    }</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>}</div>
+</div>
+<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a></div><div class="ttdoc">Queue_Array class containing the main data and also index of head and tail of the array.</div><div class="ttdef"><b>Definition</b> <a href="#l00044">queue_using_array.cpp:44</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a2aaf88c9954ef3ab686f8e4bfbd87622"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">data_structures::queue_using_array::Queue_Array::dequeue</a></div><div class="ttdeci">int dequeue()</div><div class="ttdoc">Delete element from back of the queue.</div><div class="ttdef"><b>Definition</b> <a href="#l00076">queue_using_array.cpp:76</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a2f676f2f249eb36dfd49711a03e9e67e"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">data_structures::queue_using_array::Queue_Array::front</a></div><div class="ttdeci">int8_t front</div><div class="ttdoc">Index of head of the array.</div><div class="ttdef"><b>Definition</b> <a href="#l00050">queue_using_array.cpp:50</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a4dc64488c36f84d927365fa8d1933663"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">data_structures::queue_using_array::Queue_Array::enqueue</a></div><div class="ttdeci">void enqueue(const int16_t &amp;)</div><div class="ttdoc">Add element to the first of the queue.</div><div class="ttdef"><b>Definition</b> <a href="#l00059">queue_using_array.cpp:59</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a688b7ea064739ea9fa66bf64bf4ae631"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">data_structures::queue_using_array::Queue_Array::display</a></div><div class="ttdeci">void display() const</div><div class="ttdoc">Show all saved data.</div><div class="ttdef"><b>Definition</b> <a href="#l00094">queue_using_array.cpp:94</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a9883dfcceede9a42227d2d313ae86f85"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">data_structures::queue_using_array::Queue_Array::rear</a></div><div class="ttdeci">int8_t rear</div><div class="ttdoc">Index of tail of the array.</div><div class="ttdef"><b>Definition</b> <a href="#l00051">queue_using_array.cpp:51</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_ae69a0bf6c9921b37c516c8a4d2fb904d"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">data_structures::queue_using_array::Queue_Array::arr</a></div><div class="ttdeci">std::array&lt; int16_t, max_size &gt; arr</div><div class="ttdoc">All stored data.</div><div class="ttdef"><b>Definition</b> <a href="#l00052">queue_using_array.cpp:52</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html">data_structures</a></div><div class="ttdoc">for IO operations</div></div>
+<div class="ttc" id="anamespacequeue__using__array_html"><div class="ttname"><a href="../../d9/d70/namespacequeue__using__array.html">queue_using_array</a></div><div class="ttdoc">Functions for [Queue using Array] (https://www.geeksforgeeks.org/array-implementation-of-queue-simple...</div></div>
+<div class="ttc" id="aqueue__using__array_8cpp_html_a2d49e79bd164c298912db252970520d8"><div class="ttname"><a href="../../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">max_size</a></div><div class="ttdeci">constexpr uint16_t max_size</div><div class="ttdoc">for std::array</div><div class="ttdef"><b>Definition</b> <a href="#l00024">queue_using_array.cpp:24</a></div></div>
+<div class="ttc" id="aqueue__using__array_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00112">queue_using_array.cpp:112</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d8/df0/queue__using__array_8cpp.html">queue_using_array.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/df9/stack_8hpp__dep__incl.map b/d8/df9/stack_8hpp__dep__incl.map
new file mode 100644
index 000000000..c8dabec17
--- /dev/null
+++ b/d8/df9/stack_8hpp__dep__incl.map
@@ -0,0 +1,7 @@
+<map id="data_structures/stack.hpp" name="data_structures/stack.hpp">
+<area shape="rect" id="Node000001" title="This class specifies the basic operation on a stack as a linked list." alt="" coords="69,5,242,31"/>
+<area shape="rect" id="Node000002" href="$d9/dbf/test__stack_8cpp_source.html" title=" " alt="" coords="5,79,143,120"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="134,44,96,81,92,77,130,40"/>
+<area shape="rect" id="Node000003" href="$db/dbd/test__stack__students_8cpp_source.html" title=" " alt="" coords="167,79,309,120"/>
+<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="180,40,219,77,216,81,177,44"/>
+</map>
diff --git a/d8/df9/stack_8hpp__dep__incl.md5 b/d8/df9/stack_8hpp__dep__incl.md5
new file mode 100644
index 000000000..797ae33a4
--- /dev/null
+++ b/d8/df9/stack_8hpp__dep__incl.md5
@@ -0,0 +1 @@
+0a5781cc2ddd56d11a420e6238558f20
\ No newline at end of file
diff --git a/d8/df9/stack_8hpp__dep__incl.svg b/d8/df9/stack_8hpp__dep__incl.svg
new file mode 100644
index 000000000..642755bb7
--- /dev/null
+++ b/d8/df9/stack_8hpp__dep__incl.svg
@@ -0,0 +1,85 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?>
+<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
+ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
+<!-- Generated by graphviz version 12.1.2 (20240928.0832)
+ -->
+<!-- Title: data_structures/stack.hpp Pages: 1 -->
+<svg width="236pt" height="94pt"
+ viewBox="0.00 0.00 235.88 93.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+
+<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
+
+<style type="text/css"><![CDATA[
+.node, .edge {opacity: 0.7;}
+.node.selected, .edge.selected {opacity: 1;}
+.edge:hover path { stroke: red; }
+.edge:hover polygon { stroke: red; fill: red; }
+]]></style>
+<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
+<svg id="graph" class="graph">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89.75)">
+<title>data_structures/stack.hpp</title>
+<!-- Node1 -->
+<g id="Node000001" class="node">
+<title>Node1</title>
+<g id="a_Node000001"><a xlink:title="This class specifies the basic operation on a stack as a linked list.">
+<polygon fill="#999999" stroke="#666666" points="177.12,-85.75 47.88,-85.75 47.88,-66.5 177.12,-66.5 177.12,-85.75"/>
+<text text-anchor="middle" x="112.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/stack.hpp</text>
+</a>
+</g>
+</g>
+<!-- Node2 -->
+<g id="Node000002" class="node">
+<title>Node2</title>
+<g id="a_Node000002"><a xlink:href="../../d9/dbf/test__stack_8cpp_source.html" target="_top" xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="103,-30.5 0,-30.5 0,0 103,0 103,-30.5"/>
+<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/test</text>
+<text text-anchor="middle" x="51.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_stack.cpp</text>
+</a>
+</g>
+</g>
+<!-- Node1&#45;&gt;Node2 -->
+<g id="edge1_Node000001_Node000002" class="edge">
+<title>Node1&#45;&gt;Node2</title>
+<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
+<path fill="none" stroke="#63b8ff" d="M95.01,-58.25C86.02,-49.57 75.17,-39.1 66.56,-30.78"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="92.52,-60.71 102.15,-65.13 97.38,-55.67 92.52,-60.71"/>
+</a>
+</g>
+</g>
+<!-- Node3 -->
+<g id="Node000003" class="node">
+<title>Node3</title>
+<g id="a_Node000003"><a xlink:href="../../db/dbd/test__stack__students_8cpp_source.html" target="_top" xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="227.88,-30.5 121.12,-30.5 121.12,0 227.88,0 227.88,-30.5"/>
+<text text-anchor="start" x="129.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/test</text>
+<text text-anchor="middle" x="174.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_stack_students.cpp</text>
+</a>
+</g>
+</g>
+<!-- Node1&#45;&gt;Node3 -->
+<g id="edge2_Node000001_Node000003" class="edge">
+<title>Node1&#45;&gt;Node3</title>
+<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
+<path fill="none" stroke="#63b8ff" d="M129.99,-58.52C139.18,-49.79 150.35,-39.18 159.2,-30.78"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="127.86,-55.72 123.01,-65.14 132.68,-60.79 127.86,-55.72"/>
+</a>
+</g>
+</g>
+</g>
+</svg>
+</svg>
+
+<style type='text/css'>
+<![CDATA[
+[data-mouse-over-selected='false'] { opacity: 0.7; }
+[data-mouse-over-selected='true']  { opacity: 1.0; }
+]]>
+</style>
+<script type="application/ecmascript"><![CDATA[
+document.addEventListener('DOMContentLoaded', (event) => {
+  highlightEdges();
+  highlightAdjacentNodes();
+});
+]]></script>
+</svg>
diff --git a/d8/df9/stack_8hpp__dep__incl_org.svg b/d8/df9/stack_8hpp__dep__incl_org.svg
new file mode 100644
index 000000000..12aa12a2b
--- /dev/null
+++ b/d8/df9/stack_8hpp__dep__incl_org.svg
@@ -0,0 +1,59 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?>
+<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
+ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
+<!-- Generated by graphviz version 12.1.2 (20240928.0832)
+ -->
+<!-- Title: data_structures/stack.hpp Pages: 1 -->
+<svg width="236pt" height="94pt"
+ viewBox="0.00 0.00 235.88 93.75" 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.75)">
+<title>data_structures/stack.hpp</title>
+<!-- Node1 -->
+<g id="Node000001" class="node">
+<title>Node1</title>
+<g id="a_Node000001"><a xlink:title="This class specifies the basic operation on a stack as a linked list.">
+<polygon fill="#999999" stroke="#666666" points="177.12,-85.75 47.88,-85.75 47.88,-66.5 177.12,-66.5 177.12,-85.75"/>
+<text text-anchor="middle" x="112.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/stack.hpp</text>
+</a>
+</g>
+</g>
+<!-- Node2 -->
+<g id="Node000002" class="node">
+<title>Node2</title>
+<g id="a_Node000002"><a xlink:href="../../d9/dbf/test__stack_8cpp_source.html" target="_top" xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="103,-30.5 0,-30.5 0,0 103,0 103,-30.5"/>
+<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/test</text>
+<text text-anchor="middle" x="51.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_stack.cpp</text>
+</a>
+</g>
+</g>
+<!-- Node1&#45;&gt;Node2 -->
+<g id="edge1_Node000001_Node000002" class="edge">
+<title>Node1&#45;&gt;Node2</title>
+<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
+<path fill="none" stroke="#63b8ff" d="M95.01,-58.25C86.02,-49.57 75.17,-39.1 66.56,-30.78"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="92.52,-60.71 102.15,-65.13 97.38,-55.67 92.52,-60.71"/>
+</a>
+</g>
+</g>
+<!-- Node3 -->
+<g id="Node000003" class="node">
+<title>Node3</title>
+<g id="a_Node000003"><a xlink:href="../../db/dbd/test__stack__students_8cpp_source.html" target="_top" xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="227.88,-30.5 121.12,-30.5 121.12,0 227.88,0 227.88,-30.5"/>
+<text text-anchor="start" x="129.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/test</text>
+<text text-anchor="middle" x="174.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_stack_students.cpp</text>
+</a>
+</g>
+</g>
+<!-- Node1&#45;&gt;Node3 -->
+<g id="edge2_Node000001_Node000003" class="edge">
+<title>Node1&#45;&gt;Node3</title>
+<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
+<path fill="none" stroke="#63b8ff" d="M129.99,-58.52C139.18,-49.79 150.35,-39.18 159.2,-30.78"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="127.86,-55.72 123.01,-65.14 132.68,-60.79 127.86,-55.72"/>
+</a>
+</g>
+</g>
+</g>
+</svg>
diff --git a/d8/dfa/median__search2_8cpp.html b/d8/dfa/median__search2_8cpp.html
index 0d1a463f3..42e836433 100644
--- a/d8/dfa/median__search2_8cpp.html
+++ b/d8/dfa/median__search2_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: search/median_search2.cpp File Reference</title>
+<title>TheAlgorithms/C++: search/median_search2.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for median_search2.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d73/median__search2_8cpp__incl.svg" width="195" height="111"><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">
+</div>
+<p><a href="../../d8/dfa/median__search2_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/da4/struct_list_node.html">ListNode</a></td></tr>
@@ -158,6 +177,8 @@ hare"](<a href="https://en.wikipedia.org/wiki/Cycle_detection#Floyd's_tortoise_a
 <p>Here are some example lists you can use to see how the algorithm works A = [1,2,3,4,5] B = [1,2,3,4,5,6] print median(A) #should be 39 print median(B) #should be 4</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/weiss-ben" target="_blank">Benjamin Weiss</a> </dd></dl>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d9/d69/median__search_8cpp.html" title="Implementation of Median search algorithm. @cases from here">median_search.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d8/dfa/median__search2_8cpp_source.html">median_search2.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a565d9d4b66467f966b4e4f8ea2a2ef09" name="a565d9d4b66467f966b4e4f8ea2a2ef09"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a565d9d4b66467f966b4e4f8ea2a2ef09">&#9670;&#160;</a></span>deleteAll()</h2>
@@ -173,6 +194,8 @@ hare"](<a href="https://en.wikipedia.org/wiki/Cycle_detection#Floyd's_tortoise_a
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dfa/median__search2_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../d8/dfa/median__search2_8cpp_source.html">median_search2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   77</span>                                           {</div>
 <div class="line"><span class="lineno">   78</span>    <span class="keywordflow">if</span> (head) {</div>
 <div class="line"><span class="lineno">   79</span>        deleteAll(head-&gt;next);</div>
@@ -199,17 +222,14 @@ hare"](<a href="https://en.wikipedia.org/wiki/Cycle_detection#Floyd's_tortoise_a
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dfa/median__search2_8cpp_source.html#l00139">139</a> of file <a class="el" href="../../d8/dfa/median__search2_8cpp_source.html">median_search2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  139</span>           {</div>
 <div class="line"><span class="lineno">  140</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  141</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  142</span>}</div>
-<div class="ttc" id="amedian__search2_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> median_search2.cpp:90</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/dfa/median__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amedian__search2_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dfa/median__search2_8cpp_source.html#l00090">median_search2.cpp:90</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5fefe132a0c3ee780ebc703f37ebce6a" name="a5fefe132a0c3ee780ebc703f37ebce6a"></a>
@@ -233,6 +253,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Median node of the linked list. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dfa/median__search2_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d8/dfa/median__search2_8cpp_source.html">median_search2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   59</span>                                     {</div>
 <div class="line"><span class="lineno">   60</span>    <span class="keywordflow">if</span> (!head) {</div>
 <div class="line"><span class="lineno">   61</span>        <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
@@ -250,14 +272,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   73</span> </div>
 <div class="line"><span class="lineno">   74</span>    <span class="keywordflow">return</span> (fastptr-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a>) ? slowptr-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a> : slowptr;</div>
 <div class="line"><span class="lineno">   75</span>}</div>
-<div class="ttc" id="astruct_list_node_html"><div class="ttname"><a href="../../d7/da4/struct_list_node.html">ListNode</a></div><div class="ttdoc">for IO operations</div><div class="ttdef"><b>Definition</b> median_search2.cpp:31</div></div>
-<div class="ttc" id="astruct_list_node_html_ad78b392c2ddc25c3243d0c2f30692fb1"><div class="ttname"><a href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">ListNode::next</a></div><div class="ttdeci">ListNode * next</div><div class="ttdoc">pointer to the next node</div><div class="ttdef"><b>Definition</b> median_search2.cpp:33</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/dfa/median__search2_8cpp_a5fefe132a0c3ee780ebc703f37ebce6a_cgraph.svg" width="175" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astruct_list_node_html"><div class="ttname"><a href="../../d7/da4/struct_list_node.html">ListNode</a></div><div class="ttdoc">for IO operations</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dfa/median__search2_8cpp_source.html#l00031">median_search2.cpp:31</a></div></div>
+<div class="ttc" id="astruct_list_node_html_ad78b392c2ddc25c3243d0c2f30692fb1"><div class="ttname"><a href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">ListNode::next</a></div><div class="ttdeci">ListNode * next</div><div class="ttdoc">pointer to the next node</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dfa/median__search2_8cpp_source.html#l00033">median_search2.cpp:33</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -285,6 +302,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dfa/median__search2_8cpp_source.html#l00090">90</a> of file <a class="el" href="../../d8/dfa/median__search2_8cpp_source.html">median_search2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   90</span>                   {</div>
 <div class="line"><span class="lineno">   91</span>    <span class="keyword">auto</span>* head1 = <span class="keyword">new</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>;</div>
 <div class="line"><span class="lineno">   92</span>    head1-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">val</a> = 1;</div>
@@ -304,7 +323,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  106</span>    <span class="keyword">const</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>* <span class="keyword">const</span> median = <a class="code hl_function" href="#a5fefe132a0c3ee780ebc703f37ebce6a">search::median_search2::middleNode</a>(head1);</div>
 <div class="line"><span class="lineno">  107</span>    assert(3 == median-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">val</a>);  <span class="comment">// 3 is the value of the median node.</span></div>
 <div class="line"><span class="lineno">  108</span>    search::median_search2::deleteAll(head1);</div>
-<div class="line"><span class="lineno">  109</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;test case:1 passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  109</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:1 passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  110</span> </div>
 <div class="line"><span class="lineno">  111</span>    <span class="comment">// Test case # 2</span></div>
 <div class="line"><span class="lineno">  112</span>    <span class="keyword">auto</span>* head2 = <span class="keyword">new</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>;</div>
@@ -325,13 +344,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  127</span>    <span class="keyword">const</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>* <span class="keyword">const</span> median1 = <a class="code hl_function" href="#a5fefe132a0c3ee780ebc703f37ebce6a">search::median_search2::middleNode</a>(head2);</div>
 <div class="line"><span class="lineno">  128</span>    assert(4 == median1-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">val</a>);  <span class="comment">// 4 is the value of the median node.</span></div>
 <div class="line"><span class="lineno">  129</span>    search::median_search2::deleteAll(head2);</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> &lt;&lt; <span class="stringliteral">&quot;test case:2 passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  130</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:2 passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  131</span> </div>
-<div class="line"><span class="lineno">  132</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;--All tests passed--\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  132</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;--All tests passed--\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  133</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="amedian__search2_8cpp_html_a5fefe132a0c3ee780ebc703f37ebce6a"><div class="ttname"><a href="#a5fefe132a0c3ee780ebc703f37ebce6a">search::median_search2::middleNode</a></div><div class="ttdeci">ListNode * middleNode(ListNode *head)</div><div class="ttdef"><b>Definition</b> median_search2.cpp:59</div></div>
-<div class="ttc" id="astruct_list_node_html_a58389d1d1fc5430c2f4ce7c5d5dc48b3"><div class="ttname"><a href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">ListNode::val</a></div><div class="ttdeci">int val</div><div class="ttdoc">the value stored in the node</div><div class="ttdef"><b>Definition</b> median_search2.cpp:32</div></div>
+<div class="ttc" id="amedian__search2_8cpp_html_a5fefe132a0c3ee780ebc703f37ebce6a"><div class="ttname"><a href="#a5fefe132a0c3ee780ebc703f37ebce6a">search::median_search2::middleNode</a></div><div class="ttdeci">ListNode * middleNode(ListNode *head)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dfa/median__search2_8cpp_source.html#l00059">median_search2.cpp:59</a></div></div>
+<div class="ttc" id="astruct_list_node_html_a58389d1d1fc5430c2f4ce7c5d5dc48b3"><div class="ttname"><a href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">ListNode::val</a></div><div class="ttdeci">int val</div><div class="ttdoc">the value stored in the node</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dfa/median__search2_8cpp_source.html#l00032">median_search2.cpp:32</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/d8/dfa/median__search2_8cpp_a5fefe132a0c3ee780ebc703f37ebce6a_cgraph.map b/d8/dfa/median__search2_8cpp_a5fefe132a0c3ee780ebc703f37ebce6a_cgraph.map
deleted file mode 100644
index 163b3405d..000000000
--- a/d8/dfa/median__search2_8cpp_a5fefe132a0c3ee780ebc703f37ebce6a_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="search::median_search2::middleNode" name="search::median_search2::middleNode">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,169,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="55,29,54,19,59,11,70,5,87,3,105,5,116,11,113,16,103,10,87,8,72,10,63,14,59,20,61,28"/>
-</map>
diff --git a/d8/dfa/median__search2_8cpp_a5fefe132a0c3ee780ebc703f37ebce6a_cgraph.md5 b/d8/dfa/median__search2_8cpp_a5fefe132a0c3ee780ebc703f37ebce6a_cgraph.md5
deleted file mode 100644
index e93578588..000000000
--- a/d8/dfa/median__search2_8cpp_a5fefe132a0c3ee780ebc703f37ebce6a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-939e9c1e19260946cac2e7cf57b20b21
\ No newline at end of file
diff --git a/d8/dfa/median__search2_8cpp_a5fefe132a0c3ee780ebc703f37ebce6a_cgraph.svg b/d8/dfa/median__search2_8cpp_a5fefe132a0c3ee780ebc703f37ebce6a_cgraph.svg
deleted file mode 100644
index bcb23e53d..000000000
--- a/d8/dfa/median__search2_8cpp_a5fefe132a0c3ee780ebc703f37ebce6a_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: search::median_search2::middleNode Pages: 1 -->
-<svg width="131pt" height="57pt"
- viewBox="0.00 0.00 130.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>search::median_search2::middleNode</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="122.5,-30.5 0,-30.5 0,0 122.5,0 122.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">search::median_search2</text>
-<text text-anchor="middle" x="61.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::middleNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.54,-30.99C35.11,-40.06 42.35,-48.5 61.25,-48.5 71.59,-48.5 78.43,-45.97 81.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.25,-42.8 82.8,-32.49 78.29,-42.08 85.25,-42.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/dfa/median__search2_8cpp_a5fefe132a0c3ee780ebc703f37ebce6a_cgraph_org.svg b/d8/dfa/median__search2_8cpp_a5fefe132a0c3ee780ebc703f37ebce6a_cgraph_org.svg
deleted file mode 100644
index 7130785cc..000000000
--- a/d8/dfa/median__search2_8cpp_a5fefe132a0c3ee780ebc703f37ebce6a_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: search::median_search2::middleNode Pages: 1 -->
-<svg width="131pt" height="57pt"
- viewBox="0.00 0.00 130.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>search::median_search2::middleNode</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="122.5,-30.5 0,-30.5 0,0 122.5,0 122.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">search::median_search2</text>
-<text text-anchor="middle" x="61.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::middleNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.54,-30.99C35.11,-40.06 42.35,-48.5 61.25,-48.5 71.59,-48.5 78.43,-45.97 81.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.25,-42.8 82.8,-32.49 78.29,-42.08 85.25,-42.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/dfa/median__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/dfa/median__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 00c85c59e..000000000
--- a/d8/dfa/median__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d8/dfa/median__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/dfa/median__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index ed8d2876f..000000000
--- a/d8/dfa/median__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-97a4f15fdb0c94b992ad88c19eced9f9
\ No newline at end of file
diff --git a/d8/dfa/median__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/dfa/median__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index f0112af90..000000000
--- a/d8/dfa/median__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d8/dfa/median__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d8/dfa/median__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 5c4c97bd2..000000000
--- a/d8/dfa/median__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d8/dfa/median__search2_8cpp_source.html b/d8/dfa/median__search2_8cpp_source.html
new file mode 100644
index 000000000..b5f5d3620
--- /dev/null
+++ b/d8/dfa/median__search2_8cpp_source.html
@@ -0,0 +1,251 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: search/median_search2.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d8/dfa/median__search2_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">median_search2.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d8/dfa/median__search2_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="foldopen" id="foldopen00031" data-start="{" data-end="};">
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="../../d7/da4/struct_list_node.html">   31</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a> {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">   32</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">val</a>{0};               </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">   33</a></span>    <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>* <a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a>{<span class="keyword">nullptr</span>};  </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../d7/da4/struct_list_node.html#a3cfee2eb667c332dc32595208164ef0a">   34</a></span>    <a class="code hl_function" href="../../d7/da4/struct_list_node.html#a3cfee2eb667c332dc32595208164ef0a">ListNode</a>() = <span class="keywordflow">default</span>;     </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../d7/da4/struct_list_node.html#aaad9b553e2f936726f5b35ff2734125d">   35</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../d7/da4/struct_list_node.html#aaad9b553e2f936726f5b35ff2734125d">ListNode</a>(<span class="keywordtype">int</span> x)</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        : <a class="code hl_variable" href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">val</a>(x) {}  </div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="}">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../d7/da4/struct_list_node.html#afc97c5b9d2e7cc82d0718245688f6ff9">   37</a></span>    <a class="code hl_function" href="../../d7/da4/struct_list_node.html#afc97c5b9d2e7cc82d0718245688f6ff9">ListNode</a>(<span class="keywordtype">int</span> x, <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>* <a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a>)</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        : <a class="code hl_variable" href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">val</a>(x),</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>          <a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a>(<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a>) {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    }  </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>};</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a> {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="keyword">namespace </span>median_search2 {</div>
+<div class="foldopen" id="foldopen00059" data-start="{" data-end="}">
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d8/dfa/median__search2_8cpp.html#a5fefe132a0c3ee780ebc703f37ebce6a">   59</a></span><a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>* <a class="code hl_function" href="../../d8/dfa/median__search2_8cpp.html#a5fefe132a0c3ee780ebc703f37ebce6a">middleNode</a>(<a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>* head) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">if</span> (!head) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    }</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="comment">// Fast and slow pointers</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>* fastptr = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>* slowptr = fastptr = head;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="comment">// fast jumps 2 while slow jumps 1</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordflow">while</span> (fastptr-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a> &amp;&amp; fastptr-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a>-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a>) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        slowptr = slowptr-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        fastptr = fastptr-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a>-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a>;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    }</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keywordflow">return</span> (fastptr-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a>) ? slowptr-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a> : slowptr;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>}</div>
+</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span><span class="keywordtype">void</span> deleteAll(<span class="keyword">const</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>* <span class="keyword">const</span> head) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordflow">if</span> (head) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        deleteAll(head-&gt;next);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="keyword">delete</span> head;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    }</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>}</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>}  <span class="comment">// namespace median_search2</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>}  <span class="comment">// namespace search</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="foldopen" id="foldopen00090" data-start="{" data-end="}">
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="../../d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   90</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keyword">auto</span>* head1 = <span class="keyword">new</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    head1-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">val</a> = 1;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>* temp = head1;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i &lt; 6; ++i) {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        <span class="comment">// Allocate next</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        <span class="keyword">auto</span>* temp1 = <span class="keyword">new</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        temp1-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">val</a> = i;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        <span class="comment">// Advance</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        temp-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a> = temp1;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        temp = temp1;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    }</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    temp-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a> = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="keyword">const</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>* <span class="keyword">const</span> median = search::median_search2::middleNode(head1);</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    assert(3 == median-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">val</a>);  <span class="comment">// 3 is the value of the median node.</span></div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    search::median_search2::deleteAll(head1);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:1 passed\n&quot;</span>;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span> </div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <span class="comment">// Test case # 2</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="keyword">auto</span>* head2 = <span class="keyword">new</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    head2-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">val</a> = 1;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>* temp2 = head2;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i &lt; 7; ++i) {</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        <span class="comment">// Allocate next</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        <span class="keyword">auto</span>* temp3 = <span class="keyword">new</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>        temp3-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">val</a> = i;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        <span class="comment">// Advance</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        temp2-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a> = temp3;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        temp2 = temp3;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    }</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    temp2-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">next</a> = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    <span class="keyword">const</span> <a class="code hl_struct" href="../../d7/da4/struct_list_node.html">ListNode</a>* <span class="keyword">const</span> median1 = search::median_search2::middleNode(head2);</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    assert(4 == median1-&gt;<a class="code hl_variable" href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">val</a>);  <span class="comment">// 4 is the value of the median node.</span></div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    search::median_search2::deleteAll(head2);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:2 passed\n&quot;</span>;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;--All tests passed--\n&quot;</span>;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>}</div>
+</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="foldopen" id="foldopen00139" data-start="{" data-end="}">
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"><a class="line" href="../../d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  139</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <a class="code hl_function" href="../../d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>}</div>
+</div>
+</div>
+</div>
+<div class="ttc" id="amedian__search2_8cpp_html_a5fefe132a0c3ee780ebc703f37ebce6a"><div class="ttname"><a href="../../d8/dfa/median__search2_8cpp.html#a5fefe132a0c3ee780ebc703f37ebce6a">search::median_search2::middleNode</a></div><div class="ttdeci">ListNode * middleNode(ListNode *head)</div><div class="ttdef"><b>Definition</b> <a href="#l00059">median_search2.cpp:59</a></div></div>
+<div class="ttc" id="amedian__search2_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d8/dfa/median__search2_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> <a href="#l00090">median_search2.cpp:90</a></div></div>
+<div class="ttc" id="amedian__search2_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00139">median_search2.cpp:139</a></div></div>
+<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> <a href="../../df/dd5/binary__search_8cpp_source.html#l00047">binary_search.cpp:47</a></div></div>
+<div class="ttc" id="astruct_list_node_html"><div class="ttname"><a href="../../d7/da4/struct_list_node.html">ListNode</a></div><div class="ttdoc">for IO operations</div><div class="ttdef"><b>Definition</b> <a href="#l00031">median_search2.cpp:31</a></div></div>
+<div class="ttc" id="astruct_list_node_html_a3cfee2eb667c332dc32595208164ef0a"><div class="ttname"><a href="../../d7/da4/struct_list_node.html#a3cfee2eb667c332dc32595208164ef0a">ListNode::ListNode</a></div><div class="ttdeci">ListNode()=default</div><div class="ttdoc">default constructor</div></div>
+<div class="ttc" id="astruct_list_node_html_a58389d1d1fc5430c2f4ce7c5d5dc48b3"><div class="ttname"><a href="../../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3">ListNode::val</a></div><div class="ttdeci">int val</div><div class="ttdoc">the value stored in the node</div><div class="ttdef"><b>Definition</b> <a href="#l00032">median_search2.cpp:32</a></div></div>
+<div class="ttc" id="astruct_list_node_html_aaad9b553e2f936726f5b35ff2734125d"><div class="ttname"><a href="../../d7/da4/struct_list_node.html#aaad9b553e2f936726f5b35ff2734125d">ListNode::ListNode</a></div><div class="ttdeci">ListNode(int x)</div><div class="ttdoc">constructor with value for node-&gt;val provided</div><div class="ttdef"><b>Definition</b> <a href="#l00035">median_search2.cpp:35</a></div></div>
+<div class="ttc" id="astruct_list_node_html_ad78b392c2ddc25c3243d0c2f30692fb1"><div class="ttname"><a href="../../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1">ListNode::next</a></div><div class="ttdeci">ListNode * next</div><div class="ttdoc">pointer to the next node</div><div class="ttdef"><b>Definition</b> <a href="#l00033">median_search2.cpp:33</a></div></div>
+<div class="ttc" id="astruct_list_node_html_afc97c5b9d2e7cc82d0718245688f6ff9"><div class="ttname"><a href="../../d7/da4/struct_list_node.html#afc97c5b9d2e7cc82d0718245688f6ff9">ListNode::ListNode</a></div><div class="ttdeci">ListNode(int x, ListNode *next)</div><div class="ttdoc">constructor with values provided for node-&gt;val and node-&gt;next</div><div class="ttdef"><b>Definition</b> <a href="#l00037">median_search2.cpp:37</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../d8/dfa/median__search2_8cpp.html">median_search2.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html b/d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html
index 0e6623846..43daae6dd 100644
--- a/d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html
+++ b/d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: operations_on_datastructures::reverse_binary_tree::Node Struct Reference</title>
+<title>TheAlgorithms/C++: operations_on_datastructures::reverse_binary_tree::Node Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -128,21 +145,20 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:ae54953a75091532303bb08d55087077f" id="r_ae54953a75091532303bb08d55087077f"><td class="memItemLeft" align="right" valign="top"><a id="ae54953a75091532303bb08d55087077f" name="ae54953a75091532303bb08d55087077f"></a>
-int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
-<tr class="memdesc:ae54953a75091532303bb08d55087077f"><td class="mdescLeft">&#160;</td><td class="mdescRight">The value of the <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>. <br /></td></tr>
+<tr class="memitem:ae54953a75091532303bb08d55087077f" id="r_ae54953a75091532303bb08d55087077f"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae54953a75091532303bb08d55087077f">data</a></td></tr>
+<tr class="memdesc:ae54953a75091532303bb08d55087077f"><td class="mdescLeft">&#160;</td><td class="mdescRight">The value of the <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>.  <br /></td></tr>
 <tr class="separator:ae54953a75091532303bb08d55087077f"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aeb01a65e51df1e3bc5296cde8477c352" id="r_aeb01a65e51df1e3bc5296cde8477c352"><td class="memItemLeft" align="right" valign="top"><a id="aeb01a65e51df1e3bc5296cde8477c352" name="aeb01a65e51df1e3bc5296cde8477c352"></a>
-<a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>left</b></td></tr>
-<tr class="memdesc:aeb01a65e51df1e3bc5296cde8477c352"><td class="mdescLeft">&#160;</td><td class="mdescRight">The <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>'s left child. <br /></td></tr>
+<tr class="memitem:aeb01a65e51df1e3bc5296cde8477c352" id="r_aeb01a65e51df1e3bc5296cde8477c352"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aeb01a65e51df1e3bc5296cde8477c352">left</a></td></tr>
+<tr class="memdesc:aeb01a65e51df1e3bc5296cde8477c352"><td class="mdescLeft">&#160;</td><td class="mdescRight">The <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>'s left child.  <br /></td></tr>
 <tr class="separator:aeb01a65e51df1e3bc5296cde8477c352"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ab13a4dd92d54c11eca86edde3ef32256" id="r_ab13a4dd92d54c11eca86edde3ef32256"><td class="memItemLeft" align="right" valign="top"><a id="ab13a4dd92d54c11eca86edde3ef32256" name="ab13a4dd92d54c11eca86edde3ef32256"></a>
-<a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>right</b></td></tr>
-<tr class="memdesc:ab13a4dd92d54c11eca86edde3ef32256"><td class="mdescLeft">&#160;</td><td class="mdescRight">The <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>'s right child. <br /></td></tr>
+<tr class="memitem:ab13a4dd92d54c11eca86edde3ef32256" id="r_ab13a4dd92d54c11eca86edde3ef32256"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab13a4dd92d54c11eca86edde3ef32256">right</a></td></tr>
+<tr class="memdesc:ab13a4dd92d54c11eca86edde3ef32256"><td class="mdescLeft">&#160;</td><td class="mdescRight">The <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>'s right child.  <br /></td></tr>
 <tr class="separator:ab13a4dd92d54c11eca86edde3ef32256"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>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. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a15dd7a0a7d9b1e8b2012c5161aecd6e3" name="a15dd7a0a7d9b1e8b2012c5161aecd6e3"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a15dd7a0a7d9b1e8b2012c5161aecd6e3">&#9670;&#160;</a></span>Node()</h2>
@@ -171,18 +187,75 @@ int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
 <p>&lt; Set value of <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> data</p>
 <p>&lt; Initialize left child to NULL</p>
 <p>&lt; Initialize right child to NULL</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   41</span>                                 {</div>
-<div class="line"><span class="lineno">   42</span>        <a class="code hl_variable" href="#ae54953a75091532303bb08d55087077f">data</a> = _data;     <span class="comment">///&lt; Set value of Node data</span></div>
-<div class="line"><span class="lineno">   43</span>        left = <span class="keyword">nullptr</span>;   <span class="comment">///&lt; Initialize left child to NULL</span></div>
-<div class="line"><span class="lineno">   44</span>        <a class="code hl_variable" href="#ab13a4dd92d54c11eca86edde3ef32256">right</a> = <span class="keyword">nullptr</span>;  <span class="comment">///&lt; Initialize right child to NULL</span></div>
+<div class="line"><span class="lineno">   42</span>        <a class="code hl_variable" href="#ae54953a75091532303bb08d55087077f">data</a> = _data;     </div>
+<div class="line"><span class="lineno">   43</span>        left = <span class="keyword">nullptr</span>;   </div>
+<div class="line"><span class="lineno">   44</span>        <a class="code hl_variable" href="#ab13a4dd92d54c11eca86edde3ef32256">right</a> = <span class="keyword">nullptr</span>;  </div>
 <div class="line"><span class="lineno">   45</span>    }</div>
-<div class="ttc" id="astructoperations__on__datastructures_1_1reverse__binary__tree_1_1_node_html_ab13a4dd92d54c11eca86edde3ef32256"><div class="ttname"><a href="#ab13a4dd92d54c11eca86edde3ef32256">operations_on_datastructures::reverse_binary_tree::Node::right</a></div><div class="ttdeci">Node * right</div><div class="ttdoc">The Node's right child.</div><div class="ttdef"><b>Definition</b> reverse_binary_tree.cpp:37</div></div>
-<div class="ttc" id="astructoperations__on__datastructures_1_1reverse__binary__tree_1_1_node_html_ae54953a75091532303bb08d55087077f"><div class="ttname"><a href="#ae54953a75091532303bb08d55087077f">operations_on_datastructures::reverse_binary_tree::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The value of the Node.</div><div class="ttdef"><b>Definition</b> reverse_binary_tree.cpp:35</div></div>
+<div class="ttc" id="astructoperations__on__datastructures_1_1reverse__binary__tree_1_1_node_html_ab13a4dd92d54c11eca86edde3ef32256"><div class="ttname"><a href="#ab13a4dd92d54c11eca86edde3ef32256">operations_on_datastructures::reverse_binary_tree::Node::right</a></div><div class="ttdeci">Node * right</div><div class="ttdoc">The Node's right child.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00037">reverse_binary_tree.cpp:37</a></div></div>
+<div class="ttc" id="astructoperations__on__datastructures_1_1reverse__binary__tree_1_1_node_html_ae54953a75091532303bb08d55087077f"><div class="ttname"><a href="#ae54953a75091532303bb08d55087077f">operations_on_datastructures::reverse_binary_tree::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The value of the Node.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00035">reverse_binary_tree.cpp:35</a></div></div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="ae54953a75091532303bb08d55087077f" name="ae54953a75091532303bb08d55087077f"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ae54953a75091532303bb08d55087077f">&#9670;&#160;</a></span>data</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int64_t operations_on_datastructures::reverse_binary_tree::Node::data</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>The value of the <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>. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
+
+</div>
+</div>
+<a id="aeb01a65e51df1e3bc5296cde8477c352" name="aeb01a65e51df1e3bc5296cde8477c352"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aeb01a65e51df1e3bc5296cde8477c352">&#9670;&#160;</a></span>left</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><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::Node::left</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>The <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>'s left child. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ab13a4dd92d54c11eca86edde3ef32256" name="ab13a4dd92d54c11eca86edde3ef32256"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ab13a4dd92d54c11eca86edde3ef32256">&#9670;&#160;</a></span>right</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><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::Node::right</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>The <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>'s right child. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>operations_on_datastructures/<a class="el" href="../../d4/db6/reverse__binary__tree_8cpp.html">reverse_binary_tree.cpp</a></li>
+<li>operations_on_datastructures/<a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d9/d00/factorial_8cpp.html b/d9/d00/factorial_8cpp.html
index 5b042c75b..b978b7ca0 100644
--- a/d9/d00/factorial_8cpp.html
+++ b/d9/d00/factorial_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/factorial.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/factorial.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for factorial.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d78/factorial_8cpp__incl.svg" width="255" height="111"><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">
+</div>
+<p><a href="../../d9/d00/factorial_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
 </p>
 <p> for example: \(5! = 5\times4! = 5\times4\times3\times2\times1 = 120\)</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Akshay1910" target="_blank">Akshay Gupta</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/d00/factorial_8cpp_source.html">factorial.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -166,17 +187,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d00/factorial_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../d9/d00/factorial_8cpp_source.html">factorial.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   57</span>           {</div>
 <div class="line"><span class="lineno">   58</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   59</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   60</span>}</div>
-<div class="ttc" id="afactorial_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> factorial.cpp:44</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="311" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afactorial_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d00/factorial_8cpp_source.html#l00044">factorial.cpp:44</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -204,22 +222,18 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d00/factorial_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../d9/d00/factorial_8cpp_source.html">factorial.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   44</span>                    {</div>
 <div class="line"><span class="lineno">   45</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">math::factorial</a>(1) == 1);</div>
 <div class="line"><span class="lineno">   46</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">math::factorial</a>(0) == 1);</div>
 <div class="line"><span class="lineno">   47</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">math::factorial</a>(5) == 120);</div>
 <div class="line"><span class="lineno">   48</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">math::factorial</a>(10) == 3628800);</div>
 <div class="line"><span class="lineno">   49</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">math::factorial</a>(20) == 2432902008176640000);</div>
-<div class="line"><span class="lineno">   50</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have passed successfully!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   50</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have passed successfully!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   51</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="anamespacemath_html_a7e78996673df791014cfe540b183456a"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">math::factorial</a></div><div class="ttdeci">uint64_t factorial(uint8_t n)</div><div class="ttdoc">function to find factorial of given number</div><div class="ttdef"><b>Definition</b> factorial.cpp:29</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d00/factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="214" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemath_html_a7e78996673df791014cfe540b183456a"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">math::factorial</a></div><div class="ttdeci">uint64_t factorial(uint8_t n)</div><div class="ttdoc">function to find factorial of given number</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d00/factorial_8cpp_source.html#l00029">factorial.cpp:29</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/d00/factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d9/d00/factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index 60884c4b8..000000000
--- a/d9/d00/factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,29,56,55"/>
-<area shape="rect" id="Node000002" href="$dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a" title="function to find factorial of given number" alt="" coords="104,29,208,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,40,88,40,88,45,56,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="134,30,130,21,132,11,141,5,156,3,172,5,180,12,176,16,169,10,156,8,143,10,137,14,135,20,139,28"/>
-</map>
diff --git a/d9/d00/factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d9/d00/factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index e6af4ee99..000000000
--- a/d9/d00/factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6be6660dd9ed9aac32547de2359ce4ce
\ No newline at end of file
diff --git a/d9/d00/factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d9/d00/factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index a45e44bff..000000000
--- a/d9/d00/factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="160pt" height="45pt"
- viewBox="0.00 0.00 160.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a" target="_top" xlink:title="function to find factorial of given number">
-<polygon fill="white" stroke="#666666" points="152,-19.25 73.75,-19.25 73.75,0 152,0 152,-19.25"/>
-<text text-anchor="middle" x="112.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::factorial</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.05,-9.62C45.11,-9.62 53.58,-9.62 62.22,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.06,-13.13 72.06,-9.63 62.06,-6.13 62.06,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.16,-19.54C91.45,-28.15 96.35,-37.25 112.88,-37.25 121.91,-37.25 127.47,-34.53 129.56,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.05,-30.26 127.86,-21.03 126.15,-31.49 133.05,-30.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d00/factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d9/d00/factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index 8b4205051..000000000
--- a/d9/d00/factorial_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,48 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="160pt" height="45pt"
- viewBox="0.00 0.00 160.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a" target="_top" xlink:title="function to find factorial of given number">
-<polygon fill="white" stroke="#666666" points="152,-19.25 73.75,-19.25 73.75,0 152,0 152,-19.25"/>
-<text text-anchor="middle" x="112.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::factorial</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.05,-9.62C45.11,-9.62 53.58,-9.62 62.22,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.06,-13.13 72.06,-9.63 62.06,-6.13 62.06,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.16,-19.54C91.45,-28.15 96.35,-37.25 112.88,-37.25 121.91,-37.25 127.47,-34.53 129.56,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.05,-30.26 127.86,-21.03 126.15,-31.49 133.05,-30.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index f79f98c63..000000000
--- a/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,29,55,55"/>
-<area shape="rect" id="Node000002" href="$d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,29,153,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,40,88,40,88,45,55,45"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a" title="function to find factorial of given number" alt="" coords="201,29,305,55"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,40,186,40,186,45,153,45"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="231,30,227,21,230,11,239,5,253,3,269,5,277,12,274,16,267,10,253,8,241,10,234,14,232,20,236,28"/>
-</map>
diff --git a/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 61931077c..000000000
--- a/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b66c16c32c0f82c3eff72ee789a81699
\ No newline at end of file
diff --git a/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index b3a45df50..000000000
--- a/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="233pt" height="45pt"
- viewBox="0.00 0.00 233.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-9.62C44.55,-9.62 53.37,-9.62 61.69,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-13.13 71.43,-9.63 61.43,-6.13 61.43,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a" target="_top" xlink:title="function to find factorial of given number">
-<polygon fill="white" stroke="#666666" points="225,-19.25 146.75,-19.25 146.75,0 225,0 225,-19.25"/>
-<text text-anchor="middle" x="185.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::factorial</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.05,-9.62C118.11,-9.62 126.58,-9.62 135.22,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.06,-13.13 145.06,-9.63 135.06,-6.13 135.06,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M171.16,-19.54C164.45,-28.15 169.35,-37.25 185.88,-37.25 194.91,-37.25 200.47,-34.53 202.56,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.05,-30.26 200.86,-21.03 199.15,-31.49 206.05,-30.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index aaae15053..000000000
--- a/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="233pt" height="45pt"
- viewBox="0.00 0.00 233.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-9.62C44.55,-9.62 53.37,-9.62 61.69,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-13.13 71.43,-9.63 61.43,-6.13 61.43,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a" target="_top" xlink:title="function to find factorial of given number">
-<polygon fill="white" stroke="#666666" points="225,-19.25 146.75,-19.25 146.75,0 225,0 225,-19.25"/>
-<text text-anchor="middle" x="185.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::factorial</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.05,-9.62C118.11,-9.62 126.58,-9.62 135.22,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.06,-13.13 145.06,-9.63 135.06,-6.13 135.06,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M171.16,-19.54C164.45,-28.15 169.35,-37.25 185.88,-37.25 194.91,-37.25 200.47,-34.53 202.56,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.05,-30.26 200.86,-21.03 199.15,-31.49 206.05,-30.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d00/factorial_8cpp_source.html b/d9/d00/factorial_8cpp_source.html
new file mode 100644
index 000000000..19d433209
--- /dev/null
+++ b/d9/d00/factorial_8cpp_source.html
@@ -0,0 +1,177 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/factorial.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d00/factorial_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">factorial.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/d00/factorial_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="foldopen" id="foldopen00029" data-start="{" data-end="}">
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">   29</a></span>uint64_t <a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">factorial</a>(uint8_t n) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">if</span> (n &lt; 20) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;maximum value is 20\n&quot;</span>);</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    }</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordflow">if</span> (n == 0) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        <span class="keywordflow">return</span> 1;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    }</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">return</span> n * <a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">factorial</a>(n - 1);</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>}</div>
+</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="foldopen" id="foldopen00044" data-start="{" data-end="}">
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="../../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">   44</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">math::factorial</a>(1) == 1);</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">math::factorial</a>(0) == 1);</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">math::factorial</a>(5) == 120);</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">math::factorial</a>(10) == 3628800);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">math::factorial</a>(20) == 2432902008176640000);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have passed successfully!\n&quot;</span>;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>}</div>
+</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="foldopen" id="foldopen00057" data-start="{" data-end="}">
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="../../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   57</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <a class="code hl_function" href="../../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>}</div>
+</div>
+<div class="ttc" id="afactorial_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d9/d00/factorial_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> <a href="#l00044">factorial.cpp:44</a></div></div>
+<div class="ttc" id="afactorial_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00057">factorial.cpp:57</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_a7e78996673df791014cfe540b183456a"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">math::factorial</a></div><div class="ttdeci">uint64_t factorial(uint8_t n)</div><div class="ttdoc">function to find factorial of given number</div><div class="ttdef"><b>Definition</b> <a href="#l00029">factorial.cpp:29</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d9/d00/factorial_8cpp.html">factorial.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/d02/linear__search_8cpp.html b/d9/d02/linear__search_8cpp.html
index e6a056ab5..dc53fece6 100644
--- a/d9/d02/linear__search_8cpp.html
+++ b/d9/d02/linear__search_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: search/linear_search.cpp File Reference</title>
+<title>TheAlgorithms/C++: search/linear_search.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,7 +136,9 @@ Include dependency graph for linear_search.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d77/linear__search_8cpp__incl.svg" width="178" height="111"><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">
+</div>
+<p><a href="../../d9/d02/linear__search_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a84ac3988a534eb60ca351ed6caf56d84" id="r_a84ac3988a534eb60ca351ed6caf56d84"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a> (int *array, int size, int key)</td></tr>
@@ -137,6 +156,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd>Unknown author </dd>
 <dd>
 <a href="https://github.com/ritikaa17" target="_blank">Ritika Mukherjee</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/d02/linear__search_8cpp_source.html">linear_search.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a84ac3988a534eb60ca351ed6caf56d84" name="a84ac3988a534eb60ca351ed6caf56d84"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a84ac3988a534eb60ca351ed6caf56d84">&#9670;&#160;</a></span>LinearSearch()</h2>
@@ -175,6 +196,8 @@ Functions</h2></td></tr>
 <dl class="section return"><dt>Returns</dt><dd>index where the key-value occurs in the array </dd>
 <dd>
 -1 if key-value not found </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d02/linear__search_8cpp_source.html#l00021">21</a> of file <a class="el" href="../../d9/d02/linear__search_8cpp_source.html">linear_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   21</span>                                                {</div>
 <div class="line"><span class="lineno">   22</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
 <div class="line"><span class="lineno">   23</span>        <span class="keywordflow">if</span> (array[i] == key) {</div>
@@ -206,41 +229,43 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d02/linear__search_8cpp_source.html#l00065">65</a> of file <a class="el" href="../../d9/d02/linear__search_8cpp_source.html">linear_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   65</span>           {</div>
 <div class="line"><span class="lineno">   66</span>    <span class="keywordtype">int</span> mode = 0;</div>
 <div class="line"><span class="lineno">   67</span> </div>
-<div class="line"><span class="lineno">   68</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Choose mode\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   69</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Self-test mode (1), interactive mode (2): &quot;</span>;</div>
+<div class="line"><span class="lineno">   68</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Choose mode\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   69</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Self-test mode (1), interactive mode (2): &quot;</span>;</div>
 <div class="line"><span class="lineno">   70</span> </div>
-<div class="line"><span class="lineno">   71</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; mode;</div>
+<div class="line"><span class="lineno">   71</span>    std::cin &gt;&gt; mode;</div>
 <div class="line"><span class="lineno">   72</span> </div>
 <div class="line"><span class="lineno">   73</span>    <span class="keywordflow">if</span> (mode == 2) {</div>
 <div class="line"><span class="lineno">   74</span>        <span class="keywordtype">int</span> size = 0;</div>
-<div class="line"><span class="lineno">   75</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter the size of the array [in range 1-30 ]: &quot;</span>;</div>
-<div class="line"><span class="lineno">   76</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; size;</div>
+<div class="line"><span class="lineno">   75</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the size of the array [in range 1-30 ]: &quot;</span>;</div>
+<div class="line"><span class="lineno">   76</span>        std::cin &gt;&gt; size;</div>
 <div class="line"><span class="lineno">   77</span> </div>
 <div class="line"><span class="lineno">   78</span>        <span class="keywordflow">while</span> (size &lt;= 0 || size &gt; 30) {</div>
-<div class="line"><span class="lineno">   79</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Size can only be 1-30. Please choose another value: &quot;</span>;</div>
-<div class="line"><span class="lineno">   80</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; size;</div>
+<div class="line"><span class="lineno">   79</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Size can only be 1-30. Please choose another value: &quot;</span>;</div>
+<div class="line"><span class="lineno">   80</span>            std::cin &gt;&gt; size;</div>
 <div class="line"><span class="lineno">   81</span>        }</div>
 <div class="line"><span class="lineno">   82</span> </div>
 <div class="line"><span class="lineno">   83</span>        <span class="keywordtype">int</span> *array = <span class="keyword">new</span> <span class="keywordtype">int</span>[size];</div>
 <div class="line"><span class="lineno">   84</span>        <span class="keywordtype">int</span> key = 0;</div>
 <div class="line"><span class="lineno">   85</span> </div>
 <div class="line"><span class="lineno">   86</span>        <span class="comment">// Input for the array elements</span></div>
-<div class="line"><span class="lineno">   87</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the array of &quot;</span> &lt;&lt; size &lt;&lt; <span class="stringliteral">&quot; numbers: &quot;</span>;</div>
+<div class="line"><span class="lineno">   87</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the array of &quot;</span> &lt;&lt; size &lt;&lt; <span class="stringliteral">&quot; numbers: &quot;</span>;</div>
 <div class="line"><span class="lineno">   88</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
-<div class="line"><span class="lineno">   89</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; array[i];</div>
+<div class="line"><span class="lineno">   89</span>            std::cin &gt;&gt; array[i];</div>
 <div class="line"><span class="lineno">   90</span>        }</div>
 <div class="line"><span class="lineno">   91</span> </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> &lt;&lt; <span class="stringliteral">&quot;\nEnter the number to be searched: &quot;</span>;</div>
-<div class="line"><span class="lineno">   93</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; key;</div>
+<div class="line"><span class="lineno">   92</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the number to be searched: &quot;</span>;</div>
+<div class="line"><span class="lineno">   93</span>        std::cin &gt;&gt; key;</div>
 <div class="line"><span class="lineno">   94</span> </div>
 <div class="line"><span class="lineno">   95</span>        <span class="keywordtype">int</span> index = <a class="code hl_function" href="#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, key);</div>
 <div class="line"><span class="lineno">   96</span>        <span class="keywordflow">if</span> (index != -1) {</div>
-<div class="line"><span class="lineno">   97</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Number found at index: &quot;</span> &lt;&lt; index &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   97</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Number found at index: &quot;</span> &lt;&lt; index &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   98</span>        } <span class="keywordflow">else</span> {</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> &lt;&lt; <span class="stringliteral">&quot;Array element not found&quot;</span>;</div>
+<div class="line"><span class="lineno">   99</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Array element not found&quot;</span>;</div>
 <div class="line"><span class="lineno">  100</span>        }</div>
 <div class="line"><span class="lineno">  101</span>        <span class="keyword">delete</span>[] array;</div>
 <div class="line"><span class="lineno">  102</span>    } <span class="keywordflow">else</span> {</div>
@@ -248,16 +273,9 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  104</span>    }</div>
 <div class="line"><span class="lineno">  105</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  106</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="alinear__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> linear_search.cpp:37</div></div>
-<div class="ttc" id="alinear__search_8cpp_html_a84ac3988a534eb60ca351ed6caf56d84"><div class="ttname"><a href="#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a></div><div class="ttdeci">int LinearSearch(int *array, int size, int key)</div><div class="ttdoc">for IO operations</div><div class="ttdef"><b>Definition</b> linear_search.cpp:21</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="304" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="alinear__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d02/linear__search_8cpp_source.html#l00037">linear_search.cpp:37</a></div></div>
+<div class="ttc" id="alinear__search_8cpp_html_a84ac3988a534eb60ca351ed6caf56d84"><div class="ttname"><a href="#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a></div><div class="ttdeci">int LinearSearch(int *array, int size, int key)</div><div class="ttdoc">for IO operations</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d02/linear__search_8cpp_source.html#l00021">linear_search.cpp:21</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -285,6 +303,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d02/linear__search_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../d9/d02/linear__search_8cpp_source.html">linear_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   37</span>                    {</div>
 <div class="line"><span class="lineno">   38</span>    <span class="keywordtype">int</span> size = 4;</div>
 <div class="line"><span class="lineno">   39</span>    <span class="keywordtype">int</span> *array = <span class="keyword">new</span> <span class="keywordtype">int</span>[size];</div>
@@ -305,15 +325,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   54</span>    assert(<a class="code hl_function" href="#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 1) == 1);</div>
 <div class="line"><span class="lineno">   55</span>    assert(<a class="code hl_function" href="#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 5) == 5);</div>
 <div class="line"><span class="lineno">   56</span> </div>
-<div class="line"><span class="lineno">   57</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   57</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   58</span>    <span class="keyword">delete</span>[] array;  <span class="comment">// free memory up</span></div>
 <div class="line"><span class="lineno">   59</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d02/linear__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="207" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/d02/linear__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d9/d02/linear__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index 2668058e8..000000000
--- a/d9/d02/linear__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,56,31"/>
-<area shape="rect" id="Node000002" href="$d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84" title="for IO operations" alt="" coords="104,5,201,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,16,88,16,88,21,56,21"/>
-</map>
diff --git a/d9/d02/linear__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d9/d02/linear__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 6cec214d2..000000000
--- a/d9/d02/linear__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9544fec20bc90c571fd130dbb1acdc17
\ No newline at end of file
diff --git a/d9/d02/linear__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d9/d02/linear__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index 1289625f9..000000000
--- a/d9/d02/linear__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="155pt" height="27pt"
- viewBox="0.00 0.00 154.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="146.75,-19.25 73.75,-19.25 73.75,0 146.75,0 146.75,-19.25"/>
-<text text-anchor="middle" x="110.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinearSearch</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-9.62C45.05,-9.62 53.55,-9.62 62.17,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.95,-13.13 71.95,-9.63 61.95,-6.13 61.95,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d02/linear__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d9/d02/linear__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index 2605bd687..000000000
--- a/d9/d02/linear__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="155pt" height="27pt"
- viewBox="0.00 0.00 154.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="146.75,-19.25 73.75,-19.25 73.75,0 146.75,0 146.75,-19.25"/>
-<text text-anchor="middle" x="110.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinearSearch</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-9.62C45.05,-9.62 53.55,-9.62 62.17,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.95,-13.13 71.95,-9.63 61.95,-6.13 61.95,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 56265503a..000000000
--- a/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84" title="for IO operations" alt="" coords="201,5,298,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,186,16,186,21,55,21"/>
-<area shape="rect" id="Node000003" href="$d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,31,153,56"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,22,89,31,87,36,54,27"/>
-<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="153,36,185,29,187,34,154,41"/>
-</map>
diff --git a/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 6f1faaf4f..000000000
--- a/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f39ec92ef3f94f97f08f2413cf27d274
\ No newline at end of file
diff --git a/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index b0b202553..000000000
--- a/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="228pt" height="46pt"
- viewBox="0.00 0.00 227.75 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-38.25 0,-38.25 0,-19 37,-19 37,-38.25"/>
-<text text-anchor="middle" x="18.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="219.75,-38.25 146.75,-38.25 146.75,-19 219.75,-19 219.75,-38.25"/>
-<text text-anchor="middle" x="183.25" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinearSearch</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-28.62C60.59,-28.62 102.56,-28.62 135.36,-28.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.02,-32.13 145.02,-28.63 135.02,-25.13 135.02,-32.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-23.93C44.64,-21.93 53.57,-19.56 61.98,-17.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.71,-20.74 71.48,-14.79 60.91,-13.98 62.71,-20.74"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-13.47C118.13,-14.99 126.74,-16.83 135.46,-18.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.47,-22.05 144.98,-20.7 135.93,-15.2 134.47,-22.05"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index f1128cd43..000000000
--- a/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="228pt" height="46pt"
- viewBox="0.00 0.00 227.75 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-38.25 0,-38.25 0,-19 37,-19 37,-38.25"/>
-<text text-anchor="middle" x="18.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="219.75,-38.25 146.75,-38.25 146.75,-19 219.75,-19 219.75,-38.25"/>
-<text text-anchor="middle" x="183.25" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">LinearSearch</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-28.62C60.59,-28.62 102.56,-28.62 135.36,-28.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.02,-32.13 145.02,-28.63 135.02,-25.13 135.02,-32.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-23.93C44.64,-21.93 53.57,-19.56 61.98,-17.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.71,-20.74 71.48,-14.79 60.91,-13.98 62.71,-20.74"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-13.47C118.13,-14.99 126.74,-16.83 135.46,-18.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.47,-22.05 144.98,-20.7 135.93,-15.2 134.47,-22.05"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d02/linear__search_8cpp_source.html b/d9/d02/linear__search_8cpp_source.html
new file mode 100644
index 000000000..9c7934118
--- /dev/null
+++ b/d9/d02/linear__search_8cpp_source.html
@@ -0,0 +1,228 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: search/linear_search.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d02/linear__search_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">linear_search.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/d02/linear__search_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="foldopen" id="foldopen00021" data-start="{" data-end="}">
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"><a class="line" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">   21</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(<span class="keywordtype">int</span> *array, <span class="keywordtype">int</span> size, <span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        <span class="keywordflow">if</span> (array[i] == key) {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>            <span class="keywordflow">return</span> i;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        }</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    }</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="comment">/* We reach here only in case element is not present in array, return an</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment">     * invalid entry in that case*/</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>}</div>
+</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="}">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">   37</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordtype">int</span> size = 4;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordtype">int</span> *array = <span class="keyword">new</span> <span class="keywordtype">int</span>[size];</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        array[i] = i;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    assert(<a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 0) == 0);</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    assert(<a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 1) == 1);</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    assert(<a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 2) == 2);</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    size = 6;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        array[i] = i;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    assert(<a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 3) == 3);</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    assert(<a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 1) == 1);</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    assert(<a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, 5) == 5);</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keyword">delete</span>[] array;  <span class="comment">// free memory up</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>}</div>
+</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="foldopen" id="foldopen00065" data-start="{" data-end="}">
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="../../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   65</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordtype">int</span> mode = 0;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Choose mode\n&quot;</span>;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Self-test mode (1), interactive mode (2): &quot;</span>;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::cin &gt;&gt; mode;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">if</span> (mode == 2) {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        <span class="keywordtype">int</span> size = 0;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the size of the array [in range 1-30 ]: &quot;</span>;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        std::cin &gt;&gt; size;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        <span class="keywordflow">while</span> (size &lt;= 0 || size &gt; 30) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Size can only be 1-30. Please choose another value: &quot;</span>;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>            std::cin &gt;&gt; size;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        }</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordtype">int</span> *array = <span class="keyword">new</span> <span class="keywordtype">int</span>[size];</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        <span class="keywordtype">int</span> key = 0;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        <span class="comment">// Input for the array elements</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the array of &quot;</span> &lt;&lt; size &lt;&lt; <span class="stringliteral">&quot; numbers: &quot;</span>;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>            std::cin &gt;&gt; array[i];</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the number to be searched: &quot;</span>;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        std::cin &gt;&gt; key;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        <span class="keywordtype">int</span> index = <a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a>(array, size, key);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        <span class="keywordflow">if</span> (index != -1) {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Number found at index: &quot;</span> &lt;&lt; index &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Array element not found&quot;</span>;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        }</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        <span class="keyword">delete</span>[] array;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        <a class="code hl_function" href="../../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    }</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>}</div>
+</div>
+<div class="ttc" id="alinear__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d9/d02/linear__search_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> <a href="#l00037">linear_search.cpp:37</a></div></div>
+<div class="ttc" id="alinear__search_8cpp_html_a84ac3988a534eb60ca351ed6caf56d84"><div class="ttname"><a href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a></div><div class="ttdeci">int LinearSearch(int *array, int size, int key)</div><div class="ttdoc">for IO operations</div><div class="ttdef"><b>Definition</b> <a href="#l00021">linear_search.cpp:21</a></div></div>
+<div class="ttc" id="alinear__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00065">linear_search.cpp:65</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../d9/d02/linear__search_8cpp.html">linear_search.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/d03/namespacestring__search.html b/d9/d03/namespacestring__search.html
index 425ea8189..d7e19b68e 100644
--- a/d9/d03/namespacestring__search.html
+++ b/d9/d03/namespacestring__search.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: string_search Namespace Reference</title>
+<title>TheAlgorithms/C++: string_search Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -115,26 +132,26 @@ $(function(){initNavTree('d9/d03/namespacestring__search.html','../../'); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:aeb2cd81064717aedd62bfb096b1a73d8" id="r_aeb2cd81064717aedd62bfb096b1a73d8"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aeb2cd81064717aedd62bfb096b1a73d8">brute_force</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;pattern)</td></tr>
+<tr class="memitem:aeb2cd81064717aedd62bfb096b1a73d8" id="r_aeb2cd81064717aedd62bfb096b1a73d8"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aeb2cd81064717aedd62bfb096b1a73d8">brute_force</a> (const std::string &amp;text, const std::string &amp;pattern)</td></tr>
 <tr class="separator:aeb2cd81064717aedd62bfb096b1a73d8"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a83c72ff237cdf623e42d4295e0029bf9" id="r_a83c72ff237cdf623e42d4295e0029bf9"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a83c72ff237cdf623e42d4295e0029bf9">getFailureArray</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;pattern)</td></tr>
+<tr class="memitem:a83c72ff237cdf623e42d4295e0029bf9" id="r_a83c72ff237cdf623e42d4295e0029bf9"><td class="memItemLeft" align="right" valign="top">std::vector&lt; size_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a83c72ff237cdf623e42d4295e0029bf9">getFailureArray</a> (const std::string &amp;pattern)</td></tr>
 <tr class="memdesc:a83c72ff237cdf623e42d4295e0029bf9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Generate the partial match table aka failure function for a pattern to search.  <br /></td></tr>
 <tr class="separator:a83c72ff237cdf623e42d4295e0029bf9"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a1e37af2f023495129cb57338c801209e" id="r_a1e37af2f023495129cb57338c801209e"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1e37af2f023495129cb57338c801209e">kmp</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;pattern, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text)</td></tr>
+<tr class="memitem:a1e37af2f023495129cb57338c801209e" id="r_a1e37af2f023495129cb57338c801209e"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1e37af2f023495129cb57338c801209e">kmp</a> (const std::string &amp;pattern, const std::string &amp;text)</td></tr>
 <tr class="memdesc:a1e37af2f023495129cb57338c801209e"><td class="mdescLeft">&#160;</td><td class="mdescRight">KMP algorithm to find a pattern in a text.  <br /></td></tr>
 <tr class="separator:a1e37af2f023495129cb57338c801209e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8fb0bc932ba8b582c9f4c71338d050f8" id="r_a8fb0bc932ba8b582c9f4c71338d050f8"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8fb0bc932ba8b582c9f4c71338d050f8">create_hash</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;s, int n)</td></tr>
+<tr class="memitem:a8fb0bc932ba8b582c9f4c71338d050f8" id="r_a8fb0bc932ba8b582c9f4c71338d050f8"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8fb0bc932ba8b582c9f4c71338d050f8">create_hash</a> (const std::string &amp;s, int n)</td></tr>
 <tr class="separator:a8fb0bc932ba8b582c9f4c71338d050f8"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aed769d565b705a9b3e0eb1ec74088893" id="r_aed769d565b705a9b3e0eb1ec74088893"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aed769d565b705a9b3e0eb1ec74088893">recalculate_hash</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;s, int old_index, int new_index, int64_t old_hash, int patLength)</td></tr>
+<tr class="memitem:aed769d565b705a9b3e0eb1ec74088893" id="r_aed769d565b705a9b3e0eb1ec74088893"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aed769d565b705a9b3e0eb1ec74088893">recalculate_hash</a> (const std::string &amp;s, int old_index, int new_index, int64_t old_hash, int patLength)</td></tr>
 <tr class="separator:aed769d565b705a9b3e0eb1ec74088893"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aebe07cea289a13142503d98be7df11fd" id="r_aebe07cea289a13142503d98be7df11fd"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aebe07cea289a13142503d98be7df11fd">check_if_equal</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str1, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str2, int start1, int end1, int start2, int end2)</td></tr>
+<tr class="memitem:aebe07cea289a13142503d98be7df11fd" id="r_aebe07cea289a13142503d98be7df11fd"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aebe07cea289a13142503d98be7df11fd">check_if_equal</a> (const std::string &amp;str1, const std::string &amp;str2, int start1, int end1, int start2, int end2)</td></tr>
 <tr class="separator:aebe07cea289a13142503d98be7df11fd"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a21c673d56cbf67b1d2ee4d869185b7d9" id="r_a21c673d56cbf67b1d2ee4d869185b7d9"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a21c673d56cbf67b1d2ee4d869185b7d9">rabin_karp</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;pat)</td></tr>
+<tr class="memitem:a21c673d56cbf67b1d2ee4d869185b7d9" id="r_a21c673d56cbf67b1d2ee4d869185b7d9"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a21c673d56cbf67b1d2ee4d869185b7d9">rabin_karp</a> (const std::string &amp;str, const std::string &amp;pat)</td></tr>
 <tr class="separator:a21c673d56cbf67b1d2ee4d869185b7d9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>String search algorithms. </p>
-<p>for assert for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
+<p>for assert for IO operations for std::string for std::vector </p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="aeb2cd81064717aedd62bfb096b1a73d8" name="aeb2cd81064717aedd62bfb096b1a73d8"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aeb2cd81064717aedd62bfb096b1a73d8">&#9670;&#160;</a></span>brute_force()</h2>
@@ -145,12 +162,12 @@ Functions</h2></td></tr>
         <tr>
           <td class="memname">int string_search::brute_force </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>pattern</em></span>&#160;)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>pattern</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -164,13 +181,15 @@ Functions</h2></td></tr>
 <dl class="section return"><dt>Returns</dt><dd>Index where the pattern starts in the text </dd>
 <dd>
 -1 if the pattern was not found. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d7d/brute__force__string__searching_8cpp_source.html#l00021">21</a> of file <a class="el" href="../../d3/d7d/brute__force__string__searching_8cpp_source.html">brute_force_string_searching.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   21</span>                                                                 {</div>
-<div class="line"><span class="lineno">   22</span>    <span class="keywordtype">size_t</span> pat_l = pattern.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>();</div>
-<div class="line"><span class="lineno">   23</span>    <span class="keywordtype">size_t</span> txt_l = text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>();</div>
+<div class="line"><span class="lineno">   22</span>    <span class="keywordtype">size_t</span> pat_l = pattern.length();</div>
+<div class="line"><span class="lineno">   23</span>    <span class="keywordtype">size_t</span> txt_l = text.length();</div>
 <div class="line"><span class="lineno">   24</span>    <span class="keywordtype">int</span> index = -1;</div>
 <div class="line"><span class="lineno">   25</span>    <span class="keywordflow">if</span> (pat_l &lt;= txt_l) {</div>
 <div class="line"><span class="lineno">   26</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; txt_l - pat_l + 1; i++) {</div>
-<div class="line"><span class="lineno">   27</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s = text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html">substr</a>(i, pat_l);</div>
+<div class="line"><span class="lineno">   27</span>            std::string s = text.substr(i, pat_l);</div>
 <div class="line"><span class="lineno">   28</span>            <span class="keywordflow">if</span> (s == pattern) {</div>
 <div class="line"><span class="lineno">   29</span>                index = i;</div>
 <div class="line"><span class="lineno">   30</span>                <span class="keywordflow">break</span>;</div>
@@ -179,15 +198,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   33</span>    }</div>
 <div class="line"><span class="lineno">   34</span>    <span class="keywordflow">return</span> index;</div>
 <div class="line"><span class="lineno">   35</span>}</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::length</a></div><div class="ttdeci">T length(T... args)</div></div>
-<div class="ttc" id="asubstr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html">std::string::substr</a></div><div class="ttdeci">T substr(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.svg" width="319" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aebe07cea289a13142503d98be7df11fd" name="aebe07cea289a13142503d98be7df11fd"></a>
@@ -199,12 +210,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool string_search::check_if_equal </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str1</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str1</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str2</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str2</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -240,7 +251,9 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if pattern was found </dd>
 <dd>
 <code>false</code> if pattern was not found </dd></dl>
-<dl class="section note"><dt>Note</dt><dd>can this be replaced by <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/compare.html">std::string::compare</a>? </dd></dl>
+<dl class="section note"><dt>Note</dt><dd>can this be replaced by std::string::compare? </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html#l00060">60</a> of file <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html">rabin_karp.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   61</span>                                                                {</div>
 <div class="line"><span class="lineno">   62</span>    <span class="keywordflow">if</span> (end1 - start1 != end2 - start2) {</div>
 <div class="line"><span class="lineno">   63</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
@@ -266,7 +279,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">int64_t string_search::create_hash </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -283,6 +296,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>hash integer </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html#l00025">25</a> of file <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html">rabin_karp.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   25</span>                                               {</div>
 <div class="line"><span class="lineno">   26</span>    int64_t result = 0;</div>
 <div class="line"><span class="lineno">   27</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
@@ -290,7 +305,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   29</span>    }</div>
 <div class="line"><span class="lineno">   30</span>    <span class="keywordflow">return</span> result;</div>
 <div class="line"><span class="lineno">   31</span>}</div>
-<div class="ttc" id="arabin__karp_8cpp_html_ac4add2a227a10511e0128d63952030e8"><div class="ttname"><a href="../../d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8">PRIME</a></div><div class="ttdeci">#define PRIME</div><div class="ttdoc">Prime modulus for hash functions.</div><div class="ttdef"><b>Definition</b> rabin_karp.cpp:16</div></div>
+<div class="ttc" id="arabin__karp_8cpp_html_ac4add2a227a10511e0128d63952030e8"><div class="ttname"><a href="../../d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8">PRIME</a></div><div class="ttdeci">#define PRIME</div><div class="ttdoc">Prime modulus for hash functions.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/dce/rabin__karp_8cpp_source.html#l00016">rabin_karp.cpp:16</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -301,9 +316,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; string_search::getFailureArray </td>
+          <td class="memname">std::vector&lt; size_t &gt; string_search::getFailureArray </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>pattern</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>pattern</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -317,9 +332,11 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the partial match table as a vector array </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d6a/knuth__morris__pratt_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../de/d6a/knuth__morris__pratt_8cpp_source.html">knuth_morris_pratt.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   32</span>                                                            {</div>
-<div class="line"><span class="lineno">   33</span>    <span class="keywordtype">size_t</span> pattern_length = pattern.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
-<div class="line"><span class="lineno">   34</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;size_t&gt;</a> failure(pattern_length + 1);</div>
+<div class="line"><span class="lineno">   33</span>    <span class="keywordtype">size_t</span> pattern_length = pattern.size();</div>
+<div class="line"><span class="lineno">   34</span>    std::vector&lt;size_t&gt; failure(pattern_length + 1);</div>
 <div class="line"><span class="lineno">   35</span>    failure[0] = std::string::npos;</div>
 <div class="line"><span class="lineno">   36</span>    <span class="keywordtype">size_t</span> j = std::string::npos;</div>
 <div class="line"><span class="lineno">   37</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; pattern_length; i++) {</div>
@@ -330,13 +347,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   42</span>    }</div>
 <div class="line"><span class="lineno">   43</span>    <span class="keywordflow">return</span> failure;</div>
 <div class="line"><span class="lineno">   44</span>}</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d03/namespacestring__search_a83c72ff237cdf623e42d4295e0029bf9_cgraph.svg" width="335" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1e37af2f023495129cb57338c801209e" name="a1e37af2f023495129cb57338c801209e"></a>
@@ -348,12 +359,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">size_t string_search::kmp </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>pattern</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>pattern</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>&#160;)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -369,13 +380,15 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>the starting index of the pattern if found </dd>
 <dd>
 <code>std::string::npos</code> if not found </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d6a/knuth__morris__pratt_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../de/d6a/knuth__morris__pratt_8cpp_source.html">knuth_morris_pratt.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   53</span>                                                            {</div>
-<div class="line"><span class="lineno">   54</span>    <span class="keywordflow">if</span> (pattern.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html">empty</a>()) {</div>
+<div class="line"><span class="lineno">   54</span>    <span class="keywordflow">if</span> (pattern.empty()) {</div>
 <div class="line"><span class="lineno">   55</span>        <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   56</span>    }</div>
-<div class="line"><span class="lineno">   57</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;size_t&gt;</a> failure = getFailureArray(pattern);</div>
-<div class="line"><span class="lineno">   58</span>    <span class="keywordtype">size_t</span> text_length = text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
-<div class="line"><span class="lineno">   59</span>    <span class="keywordtype">size_t</span> pattern_length = pattern.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
+<div class="line"><span class="lineno">   57</span>    std::vector&lt;size_t&gt; failure = getFailureArray(pattern);</div>
+<div class="line"><span class="lineno">   58</span>    <span class="keywordtype">size_t</span> text_length = text.size();</div>
+<div class="line"><span class="lineno">   59</span>    <span class="keywordtype">size_t</span> pattern_length = pattern.size();</div>
 <div class="line"><span class="lineno">   60</span>    <span class="keywordtype">size_t</span> k = 0;</div>
 <div class="line"><span class="lineno">   61</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; text_length; j++) {</div>
 <div class="line"><span class="lineno">   62</span>        <span class="keywordflow">while</span> (k != std::string::npos &amp;&amp; pattern[k] != text[j]) {</div>
@@ -387,14 +400,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   68</span>    }</div>
 <div class="line"><span class="lineno">   69</span>    <span class="keywordflow">return</span> std::string::npos;</div>
 <div class="line"><span class="lineno">   70</span>}</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html">std::string::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d03/namespacestring__search_a1e37af2f023495129cb57338c801209e_cgraph.svg" width="515" height="123"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a21c673d56cbf67b1d2ee4d869185b7d9" name="a21c673d56cbf67b1d2ee4d869185b7d9"></a>
@@ -406,12 +413,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">int string_search::rabin_karp </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>pat</em></span>&#160;)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>pat</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -425,30 +432,27 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>index of first occurrence of pattern </dd>
 <dd>
 -1 if pattern not found </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html#l00083">83</a> of file <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html">rabin_karp.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   83</span>                                                           {</div>
-<div class="line"><span class="lineno">   84</span>    int64_t pat_hash = <a class="code hl_function" href="#a8fb0bc932ba8b582c9f4c71338d050f8">create_hash</a>(pat, pat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>());</div>
-<div class="line"><span class="lineno">   85</span>    int64_t str_hash = <a class="code hl_function" href="#a8fb0bc932ba8b582c9f4c71338d050f8">create_hash</a>(str, pat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>());</div>
-<div class="line"><span class="lineno">   86</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - pat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>(); ++i) {</div>
+<div class="line"><span class="lineno">   84</span>    int64_t pat_hash = <a class="code hl_function" href="#a8fb0bc932ba8b582c9f4c71338d050f8">create_hash</a>(pat, pat.size());</div>
+<div class="line"><span class="lineno">   85</span>    int64_t str_hash = <a class="code hl_function" href="#a8fb0bc932ba8b582c9f4c71338d050f8">create_hash</a>(str, pat.size());</div>
+<div class="line"><span class="lineno">   86</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= str.size() - pat.size(); ++i) {</div>
 <div class="line"><span class="lineno">   87</span>        <span class="keywordflow">if</span> (pat_hash == str_hash &amp;&amp;</div>
-<div class="line"><span class="lineno">   88</span>            <a class="code hl_function" href="#aebe07cea289a13142503d98be7df11fd">check_if_equal</a>(str, pat, i, i + pat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1, 0,</div>
-<div class="line"><span class="lineno">   89</span>                           pat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1)) {</div>
+<div class="line"><span class="lineno">   88</span>            <a class="code hl_function" href="#aebe07cea289a13142503d98be7df11fd">check_if_equal</a>(str, pat, i, i + pat.size() - 1, 0,</div>
+<div class="line"><span class="lineno">   89</span>                           pat.size() - 1)) {</div>
 <div class="line"><span class="lineno">   90</span>            <span class="keywordflow">return</span> i;</div>
 <div class="line"><span class="lineno">   91</span>        }</div>
-<div class="line"><span class="lineno">   92</span>        <span class="keywordflow">if</span> (i &lt; str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - pat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) {</div>
+<div class="line"><span class="lineno">   92</span>        <span class="keywordflow">if</span> (i &lt; str.size() - pat.size()) {</div>
 <div class="line"><span class="lineno">   93</span>            str_hash =</div>
-<div class="line"><span class="lineno">   94</span>                recalculate_hash(str, i, i + pat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>(), str_hash, pat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>());</div>
+<div class="line"><span class="lineno">   94</span>                recalculate_hash(str, i, i + pat.size(), str_hash, pat.size());</div>
 <div class="line"><span class="lineno">   95</span>        }</div>
 <div class="line"><span class="lineno">   96</span>    }</div>
 <div class="line"><span class="lineno">   97</span>    <span class="keywordflow">return</span> -1;  <span class="comment">// return -1 if given pattern not found</span></div>
 <div class="line"><span class="lineno">   98</span>}</div>
-<div class="ttc" id="anamespacestring__search_html_a8fb0bc932ba8b582c9f4c71338d050f8"><div class="ttname"><a href="#a8fb0bc932ba8b582c9f4c71338d050f8">string_search::create_hash</a></div><div class="ttdeci">int64_t create_hash(const std::string &amp;s, int n)</div><div class="ttdef"><b>Definition</b> rabin_karp.cpp:25</div></div>
-<div class="ttc" id="anamespacestring__search_html_aebe07cea289a13142503d98be7df11fd"><div class="ttname"><a href="#aebe07cea289a13142503d98be7df11fd">string_search::check_if_equal</a></div><div class="ttdeci">bool check_if_equal(const std::string &amp;str1, const std::string &amp;str2, int start1, int end1, int start2, int end2)</div><div class="ttdef"><b>Definition</b> rabin_karp.cpp:60</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.svg" width="432" height="200"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacestring__search_html_a8fb0bc932ba8b582c9f4c71338d050f8"><div class="ttname"><a href="#a8fb0bc932ba8b582c9f4c71338d050f8">string_search::create_hash</a></div><div class="ttdeci">int64_t create_hash(const std::string &amp;s, int n)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/dce/rabin__karp_8cpp_source.html#l00025">rabin_karp.cpp:25</a></div></div>
+<div class="ttc" id="anamespacestring__search_html_aebe07cea289a13142503d98be7df11fd"><div class="ttname"><a href="#aebe07cea289a13142503d98be7df11fd">string_search::check_if_equal</a></div><div class="ttdeci">bool check_if_equal(const std::string &amp;str1, const std::string &amp;str2, int start1, int end1, int start2, int end2)</div><div class="ttdef"><b>Definition</b> <a href="../../d6/dce/rabin__karp_8cpp_source.html#l00060">rabin_karp.cpp:60</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aed769d565b705a9b3e0eb1ec74088893" name="aed769d565b705a9b3e0eb1ec74088893"></a>
@@ -460,7 +464,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">int64_t string_search::recalculate_hash </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -495,6 +499,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new hash integer </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d6/dce/rabin__karp_8cpp_source.html">rabin_karp.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   43</span>                                                          {</div>
 <div class="line"><span class="lineno">   44</span>    int64_t new_hash = old_hash - s[old_index];</div>
 <div class="line"><span class="lineno">   45</span>    new_hash /= <a class="code hl_define" href="../../d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8">PRIME</a>;</div>
diff --git a/d9/d03/namespacestring__search_a1e37af2f023495129cb57338c801209e_cgraph.map b/d9/d03/namespacestring__search_a1e37af2f023495129cb57338c801209e_cgraph.map
deleted file mode 100644
index c84cca040..000000000
--- a/d9/d03/namespacestring__search_a1e37af2f023495129cb57338c801209e_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="string_search::kmp" name="string_search::kmp">
-<area shape="rect" id="Node000001" title="KMP algorithm to find a pattern in a text." alt="" coords="5,63,138,88"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/empty.html#" title=" " alt="" coords="206,5,330,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="117,60,206,33,207,38,119,65"/>
-<area shape="rect" id="Node000003" href="$d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9" title="Generate the partial match table aka failure function for a pattern to search." alt="" coords="186,55,350,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="138,73,170,73,170,78,138,78"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="398,92,509,118"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="111,86,186,105,288,111,382,109,382,114,288,117,185,110,110,92"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="351,86,383,91,382,96,350,91"/>
-</map>
diff --git a/d9/d03/namespacestring__search_a1e37af2f023495129cb57338c801209e_cgraph.md5 b/d9/d03/namespacestring__search_a1e37af2f023495129cb57338c801209e_cgraph.md5
deleted file mode 100644
index 235499868..000000000
--- a/d9/d03/namespacestring__search_a1e37af2f023495129cb57338c801209e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-222ec06baa13708407e37b8b58a6c28e
\ No newline at end of file
diff --git a/d9/d03/namespacestring__search_a1e37af2f023495129cb57338c801209e_cgraph.svg b/d9/d03/namespacestring__search_a1e37af2f023495129cb57338c801209e_cgraph.svg
deleted file mode 100644
index 2ce1363ef..000000000
--- a/d9/d03/namespacestring__search_a1e37af2f023495129cb57338c801209e_cgraph.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: string_search::kmp Pages: 1 -->
-<svg width="386pt" height="92pt"
- viewBox="0.00 0.00 386.00 92.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 88.25)">
-<title>string_search::kmp</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="KMP algorithm to find a pattern in a text.">
-<polygon fill="#999999" stroke="#666666" points="99.25,-41.25 0,-41.25 0,-22 99.25,-22 99.25,-41.25"/>
-<text text-anchor="middle" x="49.62" y="-27.75" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::kmp</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.12,-84.25 150.62,-84.25 150.62,-65 243.12,-65 243.12,-84.25"/>
-<text text-anchor="middle" x="196.88" y="-70.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.68,-41.71C104.46,-47.56 129.61,-55.01 150.99,-61.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.75,-64.62 160.33,-64.1 151.74,-57.91 149.75,-64.62"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9" target="_top" xlink:title="Generate the partial match table aka failure function for a pattern to search.">
-<polygon fill="white" stroke="#666666" points="258.5,-46.88 135.25,-46.88 135.25,-16.38 258.5,-16.38 258.5,-46.88"/>
-<text text-anchor="start" x="143.25" y="-33.38" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::getFailure</text>
-<text text-anchor="middle" x="196.88" y="-22.12" font-family="Helvetica,sans-Serif" font-size="10.00">Array</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.4,-31.62C107.13,-31.62 115.26,-31.62 123.39,-31.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.34,-35.13 133.34,-31.63 123.34,-28.13 123.34,-35.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="378,-19.25 294.5,-19.25 294.5,0 378,0 378,-19.25"/>
-<text text-anchor="middle" x="336.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M78.8,-21.52C95.06,-16.22 116.04,-10.3 135.25,-7.62 184.87,-0.73 242.07,-2.24 282.56,-4.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.31,-8.36 292.53,-5.57 282.8,-1.38 282.31,-8.36"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.93,-21.85C266.92,-20.57 275.05,-19.27 282.89,-18.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="283.28,-21.49 292.6,-16.46 282.17,-14.58 283.28,-21.49"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d03/namespacestring__search_a1e37af2f023495129cb57338c801209e_cgraph_org.svg b/d9/d03/namespacestring__search_a1e37af2f023495129cb57338c801209e_cgraph_org.svg
deleted file mode 100644
index d26c8db53..000000000
--- a/d9/d03/namespacestring__search_a1e37af2f023495129cb57338c801209e_cgraph_org.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: string_search::kmp Pages: 1 -->
-<svg width="386pt" height="92pt"
- viewBox="0.00 0.00 386.00 92.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 88.25)">
-<title>string_search::kmp</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="KMP algorithm to find a pattern in a text.">
-<polygon fill="#999999" stroke="#666666" points="99.25,-41.25 0,-41.25 0,-22 99.25,-22 99.25,-41.25"/>
-<text text-anchor="middle" x="49.62" y="-27.75" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::kmp</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.12,-84.25 150.62,-84.25 150.62,-65 243.12,-65 243.12,-84.25"/>
-<text text-anchor="middle" x="196.88" y="-70.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.68,-41.71C104.46,-47.56 129.61,-55.01 150.99,-61.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.75,-64.62 160.33,-64.1 151.74,-57.91 149.75,-64.62"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9" target="_top" xlink:title="Generate the partial match table aka failure function for a pattern to search.">
-<polygon fill="white" stroke="#666666" points="258.5,-46.88 135.25,-46.88 135.25,-16.38 258.5,-16.38 258.5,-46.88"/>
-<text text-anchor="start" x="143.25" y="-33.38" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::getFailure</text>
-<text text-anchor="middle" x="196.88" y="-22.12" font-family="Helvetica,sans-Serif" font-size="10.00">Array</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.4,-31.62C107.13,-31.62 115.26,-31.62 123.39,-31.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.34,-35.13 133.34,-31.63 123.34,-28.13 123.34,-35.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="378,-19.25 294.5,-19.25 294.5,0 378,0 378,-19.25"/>
-<text text-anchor="middle" x="336.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M78.8,-21.52C95.06,-16.22 116.04,-10.3 135.25,-7.62 184.87,-0.73 242.07,-2.24 282.56,-4.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.31,-8.36 292.53,-5.57 282.8,-1.38 282.31,-8.36"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.93,-21.85C266.92,-20.57 275.05,-19.27 282.89,-18.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="283.28,-21.49 292.6,-16.46 282.17,-14.58 283.28,-21.49"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.map b/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.map
deleted file mode 100644
index ef33a3b23..000000000
--- a/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="string_search::rabin_karp" name="string_search::rabin_karp">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,96,173,121"/>
-<area shape="rect" id="Node000002" href="$d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd" title=" " alt="" coords="252,5,394,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="122,93,220,55,239,49,240,54,222,60,124,98"/>
-<area shape="rect" id="Node000003" href="$d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8" title=" " alt="" coords="234,70,412,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="173,97,218,92,219,97,174,102"/>
-<area shape="rect" id="Node000004" href="$d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893" title=" " alt="" coords="221,120,426,145"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="174,114,205,118,205,123,173,120"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="268,169,379,194"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="123,119,221,155,254,164,252,169,220,160,121,124"/>
-</map>
diff --git a/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.md5 b/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.md5
deleted file mode 100644
index 73cfab894..000000000
--- a/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9538c590ae7a8eff3db239e5fbb98812
\ No newline at end of file
diff --git a/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.svg b/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.svg
deleted file mode 100644
index 25bfac6d1..000000000
--- a/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: string_search::rabin_karp Pages: 1 -->
-<svg width="324pt" height="150pt"
- viewBox="0.00 0.00 323.50 149.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 145.88)">
-<title>string_search::rabin_karp</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="125.5,-74.25 0,-74.25 0,-55 125.5,-55 125.5,-74.25"/>
-<text text-anchor="middle" x="62.75" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::rabin_karp</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.88,-141.88 185.12,-141.88 185.12,-111.38 291.88,-111.38 291.88,-141.88"/>
-<text text-anchor="start" x="193.12" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::check</text>
-<text text-anchor="middle" x="238.5" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">_if_equal</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.09,-74.59C107.77,-82.53 136.25,-93.74 161.5,-102.62 166.1,-104.24 170.88,-105.87 175.7,-107.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.22,-110.68 184.81,-110.47 176.4,-104.03 174.22,-110.68"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.38,-93.25 171.62,-93.25 171.62,-74 305.38,-74 305.38,-93.25"/>
-<text text-anchor="middle" x="238.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::create_hash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.99,-71.43C137.01,-72.64 148.62,-73.91 160.01,-75.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.47,-78.61 169.79,-76.22 160.23,-71.65 159.47,-78.61"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="315.5,-56.25 161.5,-56.25 161.5,-37 315.5,-37 315.5,-56.25"/>
-<text text-anchor="middle" x="238.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::recalculate_hash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.99,-58.18C133.73,-57.38 141.76,-56.54 149.8,-55.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.05,-59.2 159.63,-54.69 149.32,-52.24 150.05,-59.2"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="280.25,-19.25 196.75,-19.25 196.75,0 280.25,0 280.25,-19.25"/>
-<text text-anchor="middle" x="238.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.55,-54.62C107.16,-46.63 135.82,-35.49 161.5,-27.62 169.25,-25.25 177.53,-23 185.67,-20.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="186.26,-24.41 195.14,-18.64 184.6,-17.61 186.26,-24.41"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph_org.svg b/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph_org.svg
deleted file mode 100644
index 50b9e03d2..000000000
--- a/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph_org.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: string_search::rabin_karp Pages: 1 -->
-<svg width="324pt" height="150pt"
- viewBox="0.00 0.00 323.50 149.88" 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 145.88)">
-<title>string_search::rabin_karp</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="125.5,-74.25 0,-74.25 0,-55 125.5,-55 125.5,-74.25"/>
-<text text-anchor="middle" x="62.75" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::rabin_karp</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.88,-141.88 185.12,-141.88 185.12,-111.38 291.88,-111.38 291.88,-141.88"/>
-<text text-anchor="start" x="193.12" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::check</text>
-<text text-anchor="middle" x="238.5" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">_if_equal</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.09,-74.59C107.77,-82.53 136.25,-93.74 161.5,-102.62 166.1,-104.24 170.88,-105.87 175.7,-107.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.22,-110.68 184.81,-110.47 176.4,-104.03 174.22,-110.68"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.38,-93.25 171.62,-93.25 171.62,-74 305.38,-74 305.38,-93.25"/>
-<text text-anchor="middle" x="238.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::create_hash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.99,-71.43C137.01,-72.64 148.62,-73.91 160.01,-75.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.47,-78.61 169.79,-76.22 160.23,-71.65 159.47,-78.61"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="315.5,-56.25 161.5,-56.25 161.5,-37 315.5,-37 315.5,-56.25"/>
-<text text-anchor="middle" x="238.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::recalculate_hash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.99,-58.18C133.73,-57.38 141.76,-56.54 149.8,-55.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.05,-59.2 159.63,-54.69 149.32,-52.24 150.05,-59.2"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="280.25,-19.25 196.75,-19.25 196.75,0 280.25,0 280.25,-19.25"/>
-<text text-anchor="middle" x="238.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.55,-54.62C107.16,-46.63 135.82,-35.49 161.5,-27.62 169.25,-25.25 177.53,-23 185.67,-20.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="186.26,-24.41 195.14,-18.64 184.6,-17.61 186.26,-24.41"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d03/namespacestring__search_a83c72ff237cdf623e42d4295e0029bf9_cgraph.map b/d9/d03/namespacestring__search_a83c72ff237cdf623e42d4295e0029bf9_cgraph.map
deleted file mode 100644
index 0d78ba139..000000000
--- a/d9/d03/namespacestring__search_a83c72ff237cdf623e42d4295e0029bf9_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="string_search::getFailureArray" name="string_search::getFailureArray">
-<area shape="rect" id="Node000001" title="Generate the partial match table aka failure function for a pattern to search." alt="" coords="5,5,170,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="218,13,329,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="170,23,202,23,202,28,170,28"/>
-</map>
diff --git a/d9/d03/namespacestring__search_a83c72ff237cdf623e42d4295e0029bf9_cgraph.md5 b/d9/d03/namespacestring__search_a83c72ff237cdf623e42d4295e0029bf9_cgraph.md5
deleted file mode 100644
index d82d99c53..000000000
--- a/d9/d03/namespacestring__search_a83c72ff237cdf623e42d4295e0029bf9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-aacc61ad292505fe3ad654744089729c
\ No newline at end of file
diff --git a/d9/d03/namespacestring__search_a83c72ff237cdf623e42d4295e0029bf9_cgraph.svg b/d9/d03/namespacestring__search_a83c72ff237cdf623e42d4295e0029bf9_cgraph.svg
deleted file mode 100644
index 54a9e30e8..000000000
--- a/d9/d03/namespacestring__search_a83c72ff237cdf623e42d4295e0029bf9_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: string_search::getFailureArray Pages: 1 -->
-<svg width="251pt" height="39pt"
- viewBox="0.00 0.00 250.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>string_search::getFailureArray</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Generate the partial match table aka failure function for a pattern to search.">
-<polygon fill="#999999" stroke="#666666" points="123.25,-30.5 0,-30.5 0,0 123.25,0 123.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::getFailure</text>
-<text text-anchor="middle" x="61.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Array</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242.75,-24.88 159.25,-24.88 159.25,-5.63 242.75,-5.63 242.75,-24.88"/>
-<text text-anchor="middle" x="201" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M123.68,-15.25C131.58,-15.25 139.61,-15.25 147.36,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.33,-18.75 157.33,-15.25 147.33,-11.75 147.33,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d03/namespacestring__search_a83c72ff237cdf623e42d4295e0029bf9_cgraph_org.svg b/d9/d03/namespacestring__search_a83c72ff237cdf623e42d4295e0029bf9_cgraph_org.svg
deleted file mode 100644
index 2dfb9f9ad..000000000
--- a/d9/d03/namespacestring__search_a83c72ff237cdf623e42d4295e0029bf9_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: string_search::getFailureArray Pages: 1 -->
-<svg width="251pt" height="39pt"
- viewBox="0.00 0.00 250.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>string_search::getFailureArray</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Generate the partial match table aka failure function for a pattern to search.">
-<polygon fill="#999999" stroke="#666666" points="123.25,-30.5 0,-30.5 0,0 123.25,0 123.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::getFailure</text>
-<text text-anchor="middle" x="61.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Array</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242.75,-24.88 159.25,-24.88 159.25,-5.63 242.75,-5.63 242.75,-24.88"/>
-<text text-anchor="middle" x="201" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M123.68,-15.25C131.58,-15.25 139.61,-15.25 147.36,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.33,-18.75 157.33,-15.25 147.33,-11.75 147.33,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.map b/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.map
deleted file mode 100644
index f826ee532..000000000
--- a/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="string_search::brute_force" name="string_search::brute_force">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,23,142,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="190,5,312,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="142,31,174,26,175,32,142,36"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/substr.html#" title=" " alt="" coords="190,55,313,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="142,50,175,55,174,60,142,55"/>
-</map>
diff --git a/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.md5 b/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.md5
deleted file mode 100644
index deb05fc55..000000000
--- a/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d747828d42ebfb1bf411fadb70cabbc0
\ No newline at end of file
diff --git a/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.svg b/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.svg
deleted file mode 100644
index 8ecfa243d..000000000
--- a/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: string_search::brute_force Pages: 1 -->
-<svg width="239pt" height="64pt"
- viewBox="0.00 0.00 238.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>string_search::brute_force</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="102.25,-42.88 0,-42.88 0,-12.37 102.25,-12.37 102.25,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::brute</text>
-<text text-anchor="middle" x="51.12" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_force</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="230.38,-56.25 138.62,-56.25 138.62,-37 230.38,-37 230.38,-56.25"/>
-<text text-anchor="middle" x="184.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.54,-34.92C110.51,-36.07 118.79,-37.27 126.89,-38.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.27,-41.88 136.66,-39.85 127.27,-34.96 126.27,-41.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="230.75,-19.25 138.25,-19.25 138.25,0 230.75,0 230.75,-19.25"/>
-<text text-anchor="middle" x="184.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::substr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.54,-20.72C110.51,-19.63 118.79,-18.49 126.89,-17.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.23,-20.87 136.66,-16.04 126.28,-13.93 127.23,-20.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph_org.svg b/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph_org.svg
deleted file mode 100644
index f80d8c324..000000000
--- a/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: string_search::brute_force Pages: 1 -->
-<svg width="239pt" height="64pt"
- viewBox="0.00 0.00 238.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>string_search::brute_force</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="102.25,-42.88 0,-42.88 0,-12.37 102.25,-12.37 102.25,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">string_search::brute</text>
-<text text-anchor="middle" x="51.12" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_force</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="230.38,-56.25 138.62,-56.25 138.62,-37 230.38,-37 230.38,-56.25"/>
-<text text-anchor="middle" x="184.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.54,-34.92C110.51,-36.07 118.79,-37.27 126.89,-38.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.27,-41.88 136.66,-39.85 127.27,-34.96 126.27,-41.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="230.75,-19.25 138.25,-19.25 138.25,0 230.75,0 230.75,-19.25"/>
-<text text-anchor="middle" x="184.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::substr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.54,-20.72C110.51,-19.63 118.79,-18.49 126.89,-17.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.23,-20.87 136.66,-16.04 126.28,-13.93 127.23,-20.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html b/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html
index f719e8ca7..596438569 100644
--- a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html
+++ b/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others::iterative_tree_traversals::BinaryTree Class Reference</title>
+<title>TheAlgorithms/C++: others::iterative_tree_traversals::BinaryTree Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,18 +136,20 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:a3078a5ccf45d6a7031dcf46e43de65b6" id="r_a3078a5ccf45d6a7031dcf46e43de65b6"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3078a5ccf45d6a7031dcf46e43de65b6">createNewNode</a> (int64_t)</td></tr>
 <tr class="memdesc:a3078a5ccf45d6a7031dcf46e43de65b6"><td class="mdescLeft">&#160;</td><td class="mdescRight">function that will create new node for insertion.  <br /></td></tr>
 <tr class="separator:a3078a5ccf45d6a7031dcf46e43de65b6"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad4c6a8e67fb8267a65439b035666b5ae" id="r_ad4c6a8e67fb8267a65439b035666b5ae"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad4c6a8e67fb8267a65439b035666b5ae">preOrderIterative</a> (<a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *)</td></tr>
+<tr class="memitem:ad4c6a8e67fb8267a65439b035666b5ae" id="r_ad4c6a8e67fb8267a65439b035666b5ae"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad4c6a8e67fb8267a65439b035666b5ae">preOrderIterative</a> (<a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *)</td></tr>
 <tr class="memdesc:ad4c6a8e67fb8267a65439b035666b5ae"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="#ad4c6a8e67fb8267a65439b035666b5ae" title="preOrderIterative() function that will perform the preorder traversal iteratively,...">preOrderIterative()</a> function that will perform the preorder traversal iteratively, and return the result array that contain the preorder traversal of a tree.  <br /></td></tr>
 <tr class="separator:ad4c6a8e67fb8267a65439b035666b5ae"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a636a07c90b7f312bb86d2ec104efca25" id="r_a636a07c90b7f312bb86d2ec104efca25"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a636a07c90b7f312bb86d2ec104efca25">postOrderIterative</a> (<a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *)</td></tr>
+<tr class="memitem:a636a07c90b7f312bb86d2ec104efca25" id="r_a636a07c90b7f312bb86d2ec104efca25"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a636a07c90b7f312bb86d2ec104efca25">postOrderIterative</a> (<a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *)</td></tr>
 <tr class="memdesc:a636a07c90b7f312bb86d2ec104efca25"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="#a636a07c90b7f312bb86d2ec104efca25" title="postOrderIterative() function that will perform the postorder traversal iteratively,...">postOrderIterative()</a> function that will perform the postorder traversal iteratively, and return the result array that contain the postorder traversal of a tree.  <br /></td></tr>
 <tr class="separator:a636a07c90b7f312bb86d2ec104efca25"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0c33f2c1a3a3deb486a1c33ee5239499" id="r_a0c33f2c1a3a3deb486a1c33ee5239499"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0c33f2c1a3a3deb486a1c33ee5239499">inOrderIterative</a> (<a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *)</td></tr>
+<tr class="memitem:a0c33f2c1a3a3deb486a1c33ee5239499" id="r_a0c33f2c1a3a3deb486a1c33ee5239499"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0c33f2c1a3a3deb486a1c33ee5239499">inOrderIterative</a> (<a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *)</td></tr>
 <tr class="memdesc:a0c33f2c1a3a3deb486a1c33ee5239499"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="#a0c33f2c1a3a3deb486a1c33ee5239499" title="inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul...">inOrderIterative()</a> function that will perform the inorder traversal iteratively, and return the result array that contain the inorder traversal of a tree.  <br /></td></tr>
 <tr class="separator:a0c33f2c1a3a3deb486a1c33ee5239499"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>defines the functions associated with the binary tree </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="a3078a5ccf45d6a7031dcf46e43de65b6" name="a3078a5ccf45d6a7031dcf46e43de65b6"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a3078a5ccf45d6a7031dcf46e43de65b6">&#9670;&#160;</a></span>createNewNode()</h2>
@@ -156,16 +175,18 @@ Public Member Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>pointer to the newly created node with assigned data. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00088">88</a> of file <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   88</span>                                            {</div>
 <div class="line"><span class="lineno">   89</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>();</div>
 <div class="line"><span class="lineno">   90</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;data = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
 <div class="line"><span class="lineno">   91</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">   92</span>    <span class="keywordflow">return</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
 <div class="line"><span class="lineno">   93</span>}</div>
-<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
-<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
-<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -176,7 +197,7 @@ Public Member Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; others::iterative_tree_traversals::BinaryTree::inOrderIterative </td>
+          <td class="memname">std::vector&lt; int64_t &gt; others::iterative_tree_traversals::BinaryTree::inOrderIterative </td>
           <td>(</td>
           <td class="paramtype"><a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *</td>          <td class="paramname"><span class="paramname"><em>root</em></span></td><td>)</td>
           <td></td>
@@ -195,10 +216,12 @@ Public Member Functions</h2></td></tr>
 <dl class="section return"><dt>Returns</dt><dd>result that is containing the inorder traversal of a tree </dd></dl>
 <p>&lt; is used to find and traverse the child nodes.</p>
 <p>&lt; List of values, sorted in in-order.</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00164">164</a> of file <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  164</span>                                                          {</div>
-<div class="line"><span class="lineno">  165</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;Node *&gt;</a></div>
-<div class="line"><span class="lineno">  166</span>        <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;  <span class="comment">///&lt; is used to find and traverse the child nodes.</span></div>
-<div class="line"><span class="lineno">  167</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  <span class="comment">///&lt; List of values, sorted in in-order.</span></div>
+<div class="line"><span class="lineno">  165</span>    std::stack&lt;Node *&gt;</div>
+<div class="line"><span class="lineno">  166</span>        <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;  </div>
+<div class="line"><span class="lineno">  167</span>    std::vector&lt;int64_t&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  </div>
 <div class="line"><span class="lineno">  168</span> </div>
 <div class="line"><span class="lineno">  169</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *current = root;</div>
 <div class="line"><span class="lineno">  170</span> </div>
@@ -214,20 +237,13 @@ Public Member Functions</h2></td></tr>
 <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="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  182</span>}</div>
-<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> stack.hpp:19</div></div>
-<div class="ttc" id="aclassstack_html_a3647fb4418890f19e0dc414b8092b8b0"><div class="ttname"><a href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition</b> stack.hpp:62</div></div>
-<div class="ttc" id="aclassstack_html_a90df277532c23519aa7ac3c08ed90a1d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack::push</a></div><div class="ttdeci">void push(const value_type &amp;item)</div><div class="ttdef"><b>Definition</b> stack.hpp:47</div></div>
-<div class="ttc" id="aclassstack_html_ae09630c4384903d187801921b2ddc709"><div class="ttname"><a href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">stack::top</a></div><div class="ttdeci">value_type top() const</div><div class="ttdef"><b>Definition</b> stack.hpp:56</div></div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition</b> paranthesis_matching.cpp:20</div></div>
-<div class="ttc" id="astack_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a></div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a0c33f2c1a3a3deb486a1c33ee5239499_cgraph.svg" width="478" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00019">stack.hpp:19</a></div></div>
+<div class="ttc" id="aclassstack_html_a3647fb4418890f19e0dc414b8092b8b0"><div class="ttname"><a href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00062">stack.hpp:62</a></div></div>
+<div class="ttc" id="aclassstack_html_a90df277532c23519aa7ac3c08ed90a1d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack::push</a></div><div class="ttdeci">void push(const value_type &amp;item)</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00047">stack.hpp:47</a></div></div>
+<div class="ttc" id="aclassstack_html_ae09630c4384903d187801921b2ddc709"><div class="ttname"><a href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">stack::top</a></div><div class="ttdeci">value_type top() const</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00056">stack.hpp:56</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00020">paranthesis_matching.cpp:20</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a636a07c90b7f312bb86d2ec104efca25" name="a636a07c90b7f312bb86d2ec104efca25"></a>
@@ -237,7 +253,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; others::iterative_tree_traversals::BinaryTree::postOrderIterative </td>
+          <td class="memname">std::vector&lt; int64_t &gt; others::iterative_tree_traversals::BinaryTree::postOrderIterative </td>
           <td>(</td>
           <td class="paramtype"><a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *</td>          <td class="paramname"><span class="paramname"><em>root</em></span></td><td>)</td>
           <td></td>
@@ -256,10 +272,12 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>result that is containing the postorder traversal of a tree </dd></dl>
 <p>&lt; is used to find and traverse the child nodes.</p>
 <p>&lt; List of values, sorted in post-order.</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00132">132</a> of file <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  132</span>                                                            {</div>
-<div class="line"><span class="lineno">  133</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;Node *&gt;</a></div>
-<div class="line"><span class="lineno">  134</span>        <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;  <span class="comment">///&lt; is used to find and traverse the child nodes.</span></div>
-<div class="line"><span class="lineno">  135</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  <span class="comment">///&lt; List of values, sorted in post-order.</span></div>
+<div class="line"><span class="lineno">  133</span>    std::stack&lt;Node *&gt;</div>
+<div class="line"><span class="lineno">  134</span>        <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;  </div>
+<div class="line"><span class="lineno">  135</span>    std::vector&lt;int64_t&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  </div>
 <div class="line"><span class="lineno">  136</span> </div>
 <div class="line"><span class="lineno">  137</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(root);</div>
 <div class="line"><span class="lineno">  138</span> </div>
@@ -276,17 +294,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  149</span>        }</div>
 <div class="line"><span class="lineno">  150</span>    }</div>
 <div class="line"><span class="lineno">  151</span> </div>
-<div class="line"><span class="lineno">  152</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">reverse</a>(<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.begin(), <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.end());</div>
+<div class="line"><span class="lineno">  152</span>    reverse(<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.begin(), <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.end());</div>
 <div class="line"><span class="lineno">  153</span> </div>
 <div class="line"><span class="lineno">  154</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  155</span>}</div>
-<div class="ttc" id="areverse_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a></div><div class="ttdeci">T reverse(T... args)</div></div>
-</div><!-- 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="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a636a07c90b7f312bb86d2ec104efca25_cgraph.svg" width="478" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad4c6a8e67fb8267a65439b035666b5ae" name="ad4c6a8e67fb8267a65439b035666b5ae"></a>
@@ -296,7 +308,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; others::iterative_tree_traversals::BinaryTree::preOrderIterative </td>
+          <td class="memname">std::vector&lt; int64_t &gt; others::iterative_tree_traversals::BinaryTree::preOrderIterative </td>
           <td>(</td>
           <td class="paramtype"><a class="el" href="../../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> *</td>          <td class="paramname"><span class="paramname"><em>root</em></span></td><td>)</td>
           <td></td>
@@ -315,10 +327,12 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>result that is containing the preorder traversal of a tree </dd></dl>
 <p>&lt; is used to find and traverse the child nodes.</p>
 <p>&lt; list of values, sorted in pre-order.</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html#l00102">102</a> of file <a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  102</span>                                                           {</div>
-<div class="line"><span class="lineno">  103</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;Node *&gt;</a></div>
-<div class="line"><span class="lineno">  104</span>        <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;  <span class="comment">///&lt; is used to find and traverse the child nodes.</span></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&lt;int64_t&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  <span class="comment">///&lt; list of values, sorted in pre-order.</span></div>
+<div class="line"><span class="lineno">  103</span>    std::stack&lt;Node *&gt;</div>
+<div class="line"><span class="lineno">  104</span>        <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;  </div>
+<div class="line"><span class="lineno">  105</span>    std::vector&lt;int64_t&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  </div>
 <div class="line"><span class="lineno">  106</span> </div>
 <div class="line"><span class="lineno">  107</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(root);</div>
 <div class="line"><span class="lineno">  108</span> </div>
@@ -337,16 +351,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  121</span> </div>
 <div class="line"><span class="lineno">  122</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  123</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_ad4c6a8e67fb8267a65439b035666b5ae_cgraph.svg" width="478" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>others/<a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp.html">iterative_tree_traversals.cpp</a></li>
+<li>others/<a class="el" href="../../d8/d90/iterative__tree__traversals_8cpp_source.html">iterative_tree_traversals.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a0c33f2c1a3a3deb486a1c33ee5239499_cgraph.map b/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a0c33f2c1a3a3deb486a1c33ee5239499_cgraph.map
deleted file mode 100644
index 701720f52..000000000
--- a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a0c33f2c1a3a3deb486a1c33ee5239499_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="others::iterative_tree_traversals::BinaryTree::inOrderIterative" name="others::iterative_tree_traversals::BinaryTree::inOrderIterative">
-<area shape="rect" id="Node000001" title="inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul..." alt="" coords="5,40,162,95"/>
-<area shape="rect" id="Node000002" href="$d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" title=" " alt="" coords="213,5,296,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="161,42,197,32,199,37,163,47"/>
-<area shape="rect" id="Node000003" href="$d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" title=" " alt="" coords="210,55,299,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="162,65,194,65,194,70,162,70"/>
-<area shape="rect" id="Node000005" href="$d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" title=" " alt="" coords="215,104,294,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="163,88,200,99,199,104,161,93"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="347,55,472,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="299,65,331,65,331,70,299,70"/>
-</map>
diff --git a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a0c33f2c1a3a3deb486a1c33ee5239499_cgraph.md5 b/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a0c33f2c1a3a3deb486a1c33ee5239499_cgraph.md5
deleted file mode 100644
index f3e23e71e..000000000
--- a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a0c33f2c1a3a3deb486a1c33ee5239499_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b8dbc1a894a493b60b207195b7b4faaf
\ No newline at end of file
diff --git a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a0c33f2c1a3a3deb486a1c33ee5239499_cgraph.svg b/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a0c33f2c1a3a3deb486a1c33ee5239499_cgraph.svg
deleted file mode 100644
index e77c9d7a0..000000000
--- a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a0c33f2c1a3a3deb486a1c33ee5239499_cgraph.svg
+++ /dev/null
@@ -1,121 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::iterative_tree_traversals::BinaryTree::inOrderIterative Pages: 1 -->
-<svg width="358pt" height="101pt"
- viewBox="0.00 0.00 358.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>others::iterative_tree_traversals::BinaryTree::inOrderIterative</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul...">
-<polygon fill="#999999" stroke="#666666" points="117.25,-67.5 0,-67.5 0,-25.75 117.25,-25.75 117.25,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="58.62" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="217.62,-93.25 155.88,-93.25 155.88,-74 217.62,-74 217.62,-93.25"/>
-<text text-anchor="middle" x="186.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.52,-63.61C126.62,-66.28 135.85,-68.99 144.48,-71.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.35,-74.84 153.93,-74.29 145.32,-68.12 143.35,-74.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-56.25 153.25,-56.25 153.25,-37 220.25,-37 220.25,-56.25"/>
-<text text-anchor="middle" x="186.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.52,-46.62C125.6,-46.62 133.8,-46.62 141.58,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.47,-50.13 151.47,-46.63 141.47,-43.13 141.47,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-19.25 157,-19.25 157,0 216.5,0 216.5,-19.25"/>
-<text text-anchor="middle" x="186.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.52,-29.64C127.08,-26.84 136.8,-23.98 145.8,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.67,-24.74 155.28,-18.56 144.7,-18.02 146.67,-24.74"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="350.25,-56.25 256.25,-56.25 256.25,-37 350.25,-37 350.25,-56.25"/>
-<text text-anchor="middle" x="303.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.56,-46.62C228.02,-46.62 236.15,-46.62 244.31,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.27,-50.13 254.27,-46.63 244.27,-43.13 244.27,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a0c33f2c1a3a3deb486a1c33ee5239499_cgraph_org.svg b/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a0c33f2c1a3a3deb486a1c33ee5239499_cgraph_org.svg
deleted file mode 100644
index fefd531cf..000000000
--- a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a0c33f2c1a3a3deb486a1c33ee5239499_cgraph_org.svg
+++ /dev/null
@@ -1,95 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::iterative_tree_traversals::BinaryTree::inOrderIterative Pages: 1 -->
-<svg width="358pt" height="101pt"
- viewBox="0.00 0.00 358.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>others::iterative_tree_traversals::BinaryTree::inOrderIterative</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="inOrderIterative() function that will perform the inorder traversal iteratively, and return the resul...">
-<polygon fill="#999999" stroke="#666666" points="117.25,-67.5 0,-67.5 0,-25.75 117.25,-25.75 117.25,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="58.62" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="217.62,-93.25 155.88,-93.25 155.88,-74 217.62,-74 217.62,-93.25"/>
-<text text-anchor="middle" x="186.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.52,-63.61C126.62,-66.28 135.85,-68.99 144.48,-71.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.35,-74.84 153.93,-74.29 145.32,-68.12 143.35,-74.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-56.25 153.25,-56.25 153.25,-37 220.25,-37 220.25,-56.25"/>
-<text text-anchor="middle" x="186.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.52,-46.62C125.6,-46.62 133.8,-46.62 141.58,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.47,-50.13 151.47,-46.63 141.47,-43.13 141.47,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-19.25 157,-19.25 157,0 216.5,0 216.5,-19.25"/>
-<text text-anchor="middle" x="186.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.52,-29.64C127.08,-26.84 136.8,-23.98 145.8,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.67,-24.74 155.28,-18.56 144.7,-18.02 146.67,-24.74"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="350.25,-56.25 256.25,-56.25 256.25,-37 350.25,-37 350.25,-56.25"/>
-<text text-anchor="middle" x="303.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.56,-46.62C228.02,-46.62 236.15,-46.62 244.31,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.27,-50.13 254.27,-46.63 244.27,-43.13 244.27,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a636a07c90b7f312bb86d2ec104efca25_cgraph.map b/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a636a07c90b7f312bb86d2ec104efca25_cgraph.map
deleted file mode 100644
index 2db3c0e53..000000000
--- a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a636a07c90b7f312bb86d2ec104efca25_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="others::iterative_tree_traversals::BinaryTree::postOrderIterative" name="others::iterative_tree_traversals::BinaryTree::postOrderIterative">
-<area shape="rect" id="Node000001" title="postOrderIterative() function that will perform the postorder traversal iteratively,..." alt="" coords="5,40,162,95"/>
-<area shape="rect" id="Node000002" href="$d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" title=" " alt="" coords="213,5,296,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="161,42,197,32,199,37,163,47"/>
-<area shape="rect" id="Node000003" href="$d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" title=" " alt="" coords="210,55,299,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="162,65,194,65,194,70,162,70"/>
-<area shape="rect" id="Node000005" href="$d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" title=" " alt="" coords="215,104,294,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="163,88,200,99,199,104,161,93"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="347,55,472,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="299,65,331,65,331,70,299,70"/>
-</map>
diff --git a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a636a07c90b7f312bb86d2ec104efca25_cgraph.md5 b/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a636a07c90b7f312bb86d2ec104efca25_cgraph.md5
deleted file mode 100644
index d6f91ef4a..000000000
--- a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a636a07c90b7f312bb86d2ec104efca25_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-db2e77b689c612a8b898e403e0432e44
\ No newline at end of file
diff --git a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a636a07c90b7f312bb86d2ec104efca25_cgraph.svg b/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a636a07c90b7f312bb86d2ec104efca25_cgraph.svg
deleted file mode 100644
index 189494b20..000000000
--- a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a636a07c90b7f312bb86d2ec104efca25_cgraph.svg
+++ /dev/null
@@ -1,121 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::iterative_tree_traversals::BinaryTree::postOrderIterative Pages: 1 -->
-<svg width="358pt" height="101pt"
- viewBox="0.00 0.00 358.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>others::iterative_tree_traversals::BinaryTree::postOrderIterative</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="postOrderIterative() function that will perform the postorder traversal iteratively,...">
-<polygon fill="#999999" stroke="#666666" points="117.25,-67.5 0,-67.5 0,-25.75 117.25,-25.75 117.25,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="58.62" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::postOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="217.62,-93.25 155.88,-93.25 155.88,-74 217.62,-74 217.62,-93.25"/>
-<text text-anchor="middle" x="186.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.52,-63.61C126.62,-66.28 135.85,-68.99 144.48,-71.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.35,-74.84 153.93,-74.29 145.32,-68.12 143.35,-74.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-56.25 153.25,-56.25 153.25,-37 220.25,-37 220.25,-56.25"/>
-<text text-anchor="middle" x="186.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.52,-46.62C125.6,-46.62 133.8,-46.62 141.58,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.47,-50.13 151.47,-46.63 141.47,-43.13 141.47,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-19.25 157,-19.25 157,0 216.5,0 216.5,-19.25"/>
-<text text-anchor="middle" x="186.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.52,-29.64C127.08,-26.84 136.8,-23.98 145.8,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.67,-24.74 155.28,-18.56 144.7,-18.02 146.67,-24.74"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="350.25,-56.25 256.25,-56.25 256.25,-37 350.25,-37 350.25,-56.25"/>
-<text text-anchor="middle" x="303.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.56,-46.62C228.02,-46.62 236.15,-46.62 244.31,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.27,-50.13 254.27,-46.63 244.27,-43.13 244.27,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a636a07c90b7f312bb86d2ec104efca25_cgraph_org.svg b/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a636a07c90b7f312bb86d2ec104efca25_cgraph_org.svg
deleted file mode 100644
index 7ad91cd5f..000000000
--- a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_a636a07c90b7f312bb86d2ec104efca25_cgraph_org.svg
+++ /dev/null
@@ -1,95 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::iterative_tree_traversals::BinaryTree::postOrderIterative Pages: 1 -->
-<svg width="358pt" height="101pt"
- viewBox="0.00 0.00 358.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>others::iterative_tree_traversals::BinaryTree::postOrderIterative</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="postOrderIterative() function that will perform the postorder traversal iteratively,...">
-<polygon fill="#999999" stroke="#666666" points="117.25,-67.5 0,-67.5 0,-25.75 117.25,-25.75 117.25,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="58.62" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::postOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="217.62,-93.25 155.88,-93.25 155.88,-74 217.62,-74 217.62,-93.25"/>
-<text text-anchor="middle" x="186.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.52,-63.61C126.62,-66.28 135.85,-68.99 144.48,-71.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.35,-74.84 153.93,-74.29 145.32,-68.12 143.35,-74.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-56.25 153.25,-56.25 153.25,-37 220.25,-37 220.25,-56.25"/>
-<text text-anchor="middle" x="186.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.52,-46.62C125.6,-46.62 133.8,-46.62 141.58,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.47,-50.13 151.47,-46.63 141.47,-43.13 141.47,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-19.25 157,-19.25 157,0 216.5,0 216.5,-19.25"/>
-<text text-anchor="middle" x="186.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.52,-29.64C127.08,-26.84 136.8,-23.98 145.8,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.67,-24.74 155.28,-18.56 144.7,-18.02 146.67,-24.74"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="350.25,-56.25 256.25,-56.25 256.25,-37 350.25,-37 350.25,-56.25"/>
-<text text-anchor="middle" x="303.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.56,-46.62C228.02,-46.62 236.15,-46.62 244.31,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.27,-50.13 254.27,-46.63 244.27,-43.13 244.27,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_ad4c6a8e67fb8267a65439b035666b5ae_cgraph.map b/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_ad4c6a8e67fb8267a65439b035666b5ae_cgraph.map
deleted file mode 100644
index f17ce96bc..000000000
--- a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_ad4c6a8e67fb8267a65439b035666b5ae_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="others::iterative_tree_traversals::BinaryTree::preOrderIterative" name="others::iterative_tree_traversals::BinaryTree::preOrderIterative">
-<area shape="rect" id="Node000001" title="preOrderIterative() function that will perform the preorder traversal iteratively,..." alt="" coords="5,40,162,95"/>
-<area shape="rect" id="Node000002" href="$d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" title=" " alt="" coords="213,5,296,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="161,42,197,32,199,37,163,47"/>
-<area shape="rect" id="Node000003" href="$d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" title=" " alt="" coords="210,55,299,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="162,65,194,65,194,70,162,70"/>
-<area shape="rect" id="Node000005" href="$d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" title=" " alt="" coords="215,104,294,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="163,88,200,99,199,104,161,93"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="347,55,472,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="299,65,331,65,331,70,299,70"/>
-</map>
diff --git a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_ad4c6a8e67fb8267a65439b035666b5ae_cgraph.md5 b/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_ad4c6a8e67fb8267a65439b035666b5ae_cgraph.md5
deleted file mode 100644
index 7ddf71ae2..000000000
--- a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_ad4c6a8e67fb8267a65439b035666b5ae_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5d7b8ec7152d12cc0dc096c2cf9d1012
\ No newline at end of file
diff --git a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_ad4c6a8e67fb8267a65439b035666b5ae_cgraph.svg b/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_ad4c6a8e67fb8267a65439b035666b5ae_cgraph.svg
deleted file mode 100644
index 95fb8aecb..000000000
--- a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_ad4c6a8e67fb8267a65439b035666b5ae_cgraph.svg
+++ /dev/null
@@ -1,121 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::iterative_tree_traversals::BinaryTree::preOrderIterative Pages: 1 -->
-<svg width="358pt" height="101pt"
- viewBox="0.00 0.00 358.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>others::iterative_tree_traversals::BinaryTree::preOrderIterative</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="preOrderIterative() function that will perform the preorder traversal iteratively,...">
-<polygon fill="#999999" stroke="#666666" points="117.25,-67.5 0,-67.5 0,-25.75 117.25,-25.75 117.25,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="58.62" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::preOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="217.62,-93.25 155.88,-93.25 155.88,-74 217.62,-74 217.62,-93.25"/>
-<text text-anchor="middle" x="186.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.52,-63.61C126.62,-66.28 135.85,-68.99 144.48,-71.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.35,-74.84 153.93,-74.29 145.32,-68.12 143.35,-74.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-56.25 153.25,-56.25 153.25,-37 220.25,-37 220.25,-56.25"/>
-<text text-anchor="middle" x="186.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.52,-46.62C125.6,-46.62 133.8,-46.62 141.58,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.47,-50.13 151.47,-46.63 141.47,-43.13 141.47,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-19.25 157,-19.25 157,0 216.5,0 216.5,-19.25"/>
-<text text-anchor="middle" x="186.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.52,-29.64C127.08,-26.84 136.8,-23.98 145.8,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.67,-24.74 155.28,-18.56 144.7,-18.02 146.67,-24.74"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="350.25,-56.25 256.25,-56.25 256.25,-37 350.25,-37 350.25,-56.25"/>
-<text text-anchor="middle" x="303.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.56,-46.62C228.02,-46.62 236.15,-46.62 244.31,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.27,-50.13 254.27,-46.63 244.27,-43.13 244.27,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_ad4c6a8e67fb8267a65439b035666b5ae_cgraph_org.svg b/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_ad4c6a8e67fb8267a65439b035666b5ae_cgraph_org.svg
deleted file mode 100644
index 8cb7a8b5f..000000000
--- a/d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree_ad4c6a8e67fb8267a65439b035666b5ae_cgraph_org.svg
+++ /dev/null
@@ -1,95 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::iterative_tree_traversals::BinaryTree::preOrderIterative Pages: 1 -->
-<svg width="358pt" height="101pt"
- viewBox="0.00 0.00 358.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>others::iterative_tree_traversals::BinaryTree::preOrderIterative</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="preOrderIterative() function that will perform the preorder traversal iteratively,...">
-<polygon fill="#999999" stroke="#666666" points="117.25,-67.5 0,-67.5 0,-25.75 117.25,-25.75 117.25,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
-<text text-anchor="middle" x="58.62" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::preOrderIterative</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="217.62,-93.25 155.88,-93.25 155.88,-74 217.62,-74 217.62,-93.25"/>
-<text text-anchor="middle" x="186.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.52,-63.61C126.62,-66.28 135.85,-68.99 144.48,-71.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.35,-74.84 153.93,-74.29 145.32,-68.12 143.35,-74.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-56.25 153.25,-56.25 153.25,-37 220.25,-37 220.25,-56.25"/>
-<text text-anchor="middle" x="186.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.52,-46.62C125.6,-46.62 133.8,-46.62 141.58,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.47,-50.13 151.47,-46.63 141.47,-43.13 141.47,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-19.25 157,-19.25 157,0 216.5,0 216.5,-19.25"/>
-<text text-anchor="middle" x="186.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.52,-29.64C127.08,-26.84 136.8,-23.98 145.8,-21.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.67,-24.74 155.28,-18.56 144.7,-18.02 146.67,-24.74"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="350.25,-56.25 256.25,-56.25 256.25,-37 350.25,-37 350.25,-56.25"/>
-<text text-anchor="middle" x="303.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.56,-46.62C228.02,-46.62 236.15,-46.62 244.31,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.27,-50.13 254.27,-46.63 244.27,-43.13 244.27,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d13/namespaceinversion.html b/d9/d13/namespaceinversion.html
index 832f5f5d6..e77686f26 100644
--- a/d9/d13/namespaceinversion.html
+++ b/d9/d13/namespaceinversion.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: inversion Namespace Reference</title>
+<title>TheAlgorithms/C++: inversion Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d9/d14/array__left__rotation_8cpp.html b/d9/d14/array__left__rotation_8cpp.html
index 41af34521..eb08dc920 100644
--- a/d9/d14/array__left__rotation_8cpp.html
+++ b/d9/d14/array__left__rotation_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: operations_on_datastructures/array_left_rotation.cpp File Reference</title>
+<title>TheAlgorithms/C++: operations_on_datastructures/array_left_rotation.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,11 +138,13 @@ Include dependency graph for array_left_rotation.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d2b/array__left__rotation_8cpp__incl.svg" width="252" height="126"><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">
+</div>
+<p><a href="../../d9/d14/array__left__rotation_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></td></tr>
-<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
+<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::vector <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html">tests</a></td></tr>
 <tr class="memdesc:d9/df4/namespacetests"><td class="mdescLeft">&#160;</td><td class="mdescRight">Testcases to check Union of Two Arrays. <br /></td></tr>
@@ -133,10 +152,10 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a6109193567a5b7e36a27f2b4865fce20" id="r_a6109193567a5b7e36a27f2b4865fce20"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures::print</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;array)</td></tr>
+<tr class="memitem:a6109193567a5b7e36a27f2b4865fce20" id="r_a6109193567a5b7e36a27f2b4865fce20"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures::print</a> (const std::vector&lt; int32_t &gt; &amp;array)</td></tr>
 <tr class="memdesc:a6109193567a5b7e36a27f2b4865fce20"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints the values of a vector sequentially, ending with a newline character.  <br /></td></tr>
 <tr class="separator:a6109193567a5b7e36a27f2b4865fce20"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:afce39cf843989a39811a49ebe29dd6d8" id="r_afce39cf843989a39811a49ebe29dd6d8"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8">operations_on_datastructures::shift_left</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;array, size_t shift)</td></tr>
+<tr class="memitem:afce39cf843989a39811a49ebe29dd6d8" id="r_afce39cf843989a39811a49ebe29dd6d8"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8">operations_on_datastructures::shift_left</a> (const std::vector&lt; int32_t &gt; &amp;array, size_t shift)</td></tr>
 <tr class="memdesc:afce39cf843989a39811a49ebe29dd6d8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Shifts the given vector to the left by the shift amount and returns a new vector with the result. The original vector is not mutated.  <br /></td></tr>
 <tr class="separator:afce39cf843989a39811a49ebe29dd6d8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a167c24bd817469ae47358d12e034f2d5" id="r_a167c24bd817469ae47358d12e034f2d5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a> ()</td></tr>
@@ -164,6 +183,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation for the <a href="https://www.javatpoint.com/program-to-left-rotate-the-elements-of-an-array" target="_blank">Array Left Rotation</a> algorithm. </p>
 <p>Shifting an array to the left involves moving each element of the array so that it occupies a position of a certain shift value before its current one. This implementation uses a result vector and does not mutate the input. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/polarvoid" target="_blank">Alvin</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/d14/array__left__rotation_8cpp_source.html">array_left_rotation.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -182,17 +203,14 @@ Functions</h2></td></tr>
 
 <p>main function </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d14/array__left__rotation_8cpp_source.html#l00171">171</a> of file <a class="el" href="../../d9/d14/array__left__rotation_8cpp_source.html">array_left_rotation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  171</span>           {</div>
 <div class="line"><span class="lineno">  172</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  173</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  174</span>}</div>
-<div class="ttc" id="aarray__left__rotation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of shift_left() function.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:159</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="490" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aarray__left__rotation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of shift_left() function.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00159">array_left_rotation.cpp:159</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -220,6 +238,8 @@ Here is the call graph for this function:</div>
 
 <p>Function to test the correctness of shift_left() function. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d14/array__left__rotation_8cpp_source.html#l00159">159</a> of file <a class="el" href="../../d9/d14/array__left__rotation_8cpp_source.html">array_left_rotation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  159</span>                   {</div>
 <div class="line"><span class="lineno">  160</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a>();</div>
 <div class="line"><span class="lineno">  161</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a>();</div>
@@ -227,17 +247,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  163</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a>();</div>
 <div class="line"><span class="lineno">  164</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a>();</div>
 <div class="line"><span class="lineno">  165</span>}</div>
-<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:75</div></div>
-<div class="ttc" id="anamespacetests_html_a2b9769e44683dcb67fe1083ad91e134d"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a></div><div class="ttdeci">void test4()</div><div class="ttdoc">A Test to check a very large input.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:120</div></div>
-<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check an invalid shift value.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:105</div></div>
-<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an empty vector.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:90</div></div>
-<div class="ttc" id="anamespacetests_html_af7b81d7a1534216af6a36a80135beb86"><div class="ttname"><a href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a></div><div class="ttdeci">void test5()</div><div class="ttdoc">A Test to check a shift of zero.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:143</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="392" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00075">array_left_rotation.cpp:75</a></div></div>
+<div class="ttc" id="anamespacetests_html_a2b9769e44683dcb67fe1083ad91e134d"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a></div><div class="ttdeci">void test4()</div><div class="ttdoc">A Test to check a very large input.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00120">array_left_rotation.cpp:120</a></div></div>
+<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check an invalid shift value.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00105">array_left_rotation.cpp:105</a></div></div>
+<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an empty vector.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00090">array_left_rotation.cpp:90</a></div></div>
+<div class="ttc" id="anamespacetests_html_af7b81d7a1534216af6a36a80135beb86"><div class="ttname"><a href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a></div><div class="ttdeci">void test5()</div><div class="ttdoc">A Test to check a shift of zero.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00143">array_left_rotation.cpp:143</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 65223be45..000000000
--- a/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Function to test the correctness of shift_left() function." alt="" coords="5,104,49,130"/>
-<area shape="rect" id="Node000002" href="$d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" title="A Test to check an simple case." alt="" coords="97,5,184,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="36,102,61,72,95,40,98,38,101,42,98,44,65,76,40,105"/>
-<area shape="rect" id="Node000003" href="$d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" title="A Test to check an empty vector." alt="" coords="97,55,184,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="48,105,94,85,96,90,50,110"/>
-<area shape="rect" id="Node000004" href="$d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" title="A Test to check an invalid shift value." alt="" coords="97,104,184,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,114,81,114,81,120,49,120"/>
-<area shape="rect" id="Node000005" href="$d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" title="A Test to check a very large input." alt="" coords="97,153,184,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="50,124,96,144,94,149,48,129"/>
-<area shape="rect" id="Node000007" href="$d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" title="A Test to check a shift of zero." alt="" coords="97,203,184,228"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="40,128,65,158,98,189,101,191,98,196,95,194,61,162,36,132"/>
-<area shape="rect" id="Node000006" 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="232,153,386,179"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="184,164,216,164,216,169,184,169"/>
-</map>
diff --git a/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 459847b98..000000000
--- a/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-55e2caeede18d57d590ed623b311979b
\ No newline at end of file
diff --git a/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index b5afce01d..000000000
--- a/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,155 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="294pt" height="175pt"
- viewBox="0.00 0.00 293.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the correctness of shift_left() function.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-93.25 0,-93.25 0,-74 32.5,-74 32.5,-93.25"/>
-<text text-anchor="middle" x="16.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="134,-167.25 68.5,-167.25 68.5,-148 134,-148 134,-167.25"/>
-<text text-anchor="middle" x="101.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.78,-93.61C34.13,-105.55 50.98,-125.66 68.5,-139.62 69.17,-140.16 69.86,-140.68 70.56,-141.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.61,-144.11 78.89,-146.67 72.45,-138.26 68.61,-144.11"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="134,-130.25 68.5,-130.25 68.5,-111 134,-111 134,-130.25"/>
-<text text-anchor="middle" x="101.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-90.58C42.57,-94.91 55.42,-100.64 67.3,-105.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.87,-109.13 76.43,-110.01 68.72,-102.74 65.87,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="134,-93.25 68.5,-93.25 68.5,-74 134,-74 134,-93.25"/>
-<text text-anchor="middle" x="101.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-83.62C39.78,-83.62 48.31,-83.62 56.93,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.69,-87.13 66.69,-83.63 56.69,-80.13 56.69,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="134,-56.25 68.5,-56.25 68.5,-37 134,-37 134,-56.25"/>
-<text text-anchor="middle" x="101.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-76.67C42.57,-72.34 55.42,-66.61 67.3,-61.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.72,-64.51 76.43,-57.24 65.87,-58.12 68.72,-64.51"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="134,-19.25 68.5,-19.25 68.5,0 134,0 134,-19.25"/>
-<text text-anchor="middle" x="101.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.78,-73.64C34.13,-61.7 50.98,-41.59 68.5,-27.62 69.17,-27.09 69.86,-26.57 70.56,-26.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.45,-28.99 78.89,-20.58 68.61,-23.14 72.45,-28.99"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.75,-56.25 170,-56.25 170,-37 285.75,-37 285.75,-56.25"/>
-<text text-anchor="middle" x="227.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-46.62C141.78,-46.62 149.98,-46.62 158.32,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.23,-50.13 168.23,-46.63 158.23,-43.13 158.23,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 59c6efefe..000000000
--- a/d9/d14/array__left__rotation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,129 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="294pt" height="175pt"
- viewBox="0.00 0.00 293.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the correctness of shift_left() function.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-93.25 0,-93.25 0,-74 32.5,-74 32.5,-93.25"/>
-<text text-anchor="middle" x="16.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="134,-167.25 68.5,-167.25 68.5,-148 134,-148 134,-167.25"/>
-<text text-anchor="middle" x="101.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.78,-93.61C34.13,-105.55 50.98,-125.66 68.5,-139.62 69.17,-140.16 69.86,-140.68 70.56,-141.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.61,-144.11 78.89,-146.67 72.45,-138.26 68.61,-144.11"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="134,-130.25 68.5,-130.25 68.5,-111 134,-111 134,-130.25"/>
-<text text-anchor="middle" x="101.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-90.58C42.57,-94.91 55.42,-100.64 67.3,-105.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.87,-109.13 76.43,-110.01 68.72,-102.74 65.87,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="134,-93.25 68.5,-93.25 68.5,-74 134,-74 134,-93.25"/>
-<text text-anchor="middle" x="101.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-83.62C39.78,-83.62 48.31,-83.62 56.93,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.69,-87.13 66.69,-83.63 56.69,-80.13 56.69,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="134,-56.25 68.5,-56.25 68.5,-37 134,-37 134,-56.25"/>
-<text text-anchor="middle" x="101.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-76.67C42.57,-72.34 55.42,-66.61 67.3,-61.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.72,-64.51 76.43,-57.24 65.87,-58.12 68.72,-64.51"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="134,-19.25 68.5,-19.25 68.5,0 134,0 134,-19.25"/>
-<text text-anchor="middle" x="101.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.78,-73.64C34.13,-61.7 50.98,-41.59 68.5,-27.62 69.17,-27.09 69.86,-26.57 70.56,-26.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.45,-28.99 78.89,-20.58 68.61,-23.14 72.45,-28.99"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.75,-56.25 170,-56.25 170,-37 285.75,-37 285.75,-56.25"/>
-<text text-anchor="middle" x="227.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-46.62C141.78,-46.62 149.98,-46.62 158.32,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.23,-50.13 168.23,-46.63 158.23,-43.13 158.23,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 8fa9bb1e9..000000000
--- a/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="main function" alt="" coords="5,104,55,130"/>
-<area shape="rect" id="Node000002" href="$d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function to test the correctness of shift_left() function." alt="" coords="103,104,146,130"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,114,87,114,87,120,55,120"/>
-<area shape="rect" id="Node000003" href="$d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" title="A Test to check an simple case." alt="" coords="194,5,281,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="134,102,159,72,192,40,195,38,198,42,196,44,163,76,138,105"/>
-<area shape="rect" id="Node000004" href="$d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" title="A Test to check an empty vector." alt="" coords="194,55,281,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="145,105,191,85,193,90,148,110"/>
-<area shape="rect" id="Node000005" href="$d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" title="A Test to check an invalid shift value." alt="" coords="194,104,281,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="146,114,179,114,179,120,146,120"/>
-<area shape="rect" id="Node000006" href="$d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" title="A Test to check a very large input." alt="" coords="194,153,281,179"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="148,124,193,144,191,149,145,129"/>
-<area shape="rect" id="Node000008" href="$d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" title="A Test to check a shift of zero." alt="" coords="194,203,281,228"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="138,128,163,158,196,189,198,191,195,196,192,194,159,162,134,132"/>
-<area shape="rect" id="Node000007" 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="329,153,484,179"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="282,164,314,164,314,169,282,169"/>
-</map>
diff --git a/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 8f824475a..000000000
--- a/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ed0af012d52402869a71441710369b5f
\ No newline at end of file
diff --git a/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 9be3e218d..000000000
--- a/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,173 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="367pt" height="175pt"
- viewBox="0.00 0.00 366.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-93.25 0,-93.25 0,-74 37,-74 37,-93.25"/>
-<text text-anchor="middle" x="18.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the correctness of shift_left() function.">
-<polygon fill="white" stroke="#666666" points="105.5,-93.25 73,-93.25 73,-74 105.5,-74 105.5,-93.25"/>
-<text text-anchor="middle" x="89.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-83.62C44.58,-83.62 53.31,-83.62 61.45,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-87.13 71.2,-83.63 61.2,-80.13 61.2,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="207,-167.25 141.5,-167.25 141.5,-148 207,-148 207,-167.25"/>
-<text text-anchor="middle" x="174.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.78,-93.61C107.13,-105.55 123.98,-125.66 141.5,-139.62 142.17,-140.16 142.86,-140.68 143.56,-141.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.61,-144.11 151.89,-146.67 145.45,-138.26 141.61,-144.11"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="207,-130.25 141.5,-130.25 141.5,-111 207,-111 207,-130.25"/>
-<text text-anchor="middle" x="174.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-90.58C115.57,-94.91 128.42,-100.64 140.3,-105.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.87,-109.13 149.43,-110.01 141.72,-102.74 138.87,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="207,-93.25 141.5,-93.25 141.5,-74 207,-74 207,-93.25"/>
-<text text-anchor="middle" x="174.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-83.62C112.78,-83.62 121.31,-83.62 129.93,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.69,-87.13 139.69,-83.63 129.69,-80.13 129.69,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="207,-56.25 141.5,-56.25 141.5,-37 207,-37 207,-56.25"/>
-<text text-anchor="middle" x="174.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-76.67C115.57,-72.34 128.42,-66.61 140.3,-61.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.72,-64.51 149.43,-57.24 138.87,-58.12 141.72,-64.51"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="207,-19.25 141.5,-19.25 141.5,0 207,0 207,-19.25"/>
-<text text-anchor="middle" x="174.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.78,-73.64C107.13,-61.7 123.98,-41.59 141.5,-27.62 142.17,-27.09 142.86,-26.57 143.56,-26.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.45,-28.99 151.89,-20.58 141.61,-23.14 145.45,-28.99"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.75,-56.25 243,-56.25 243,-37 358.75,-37 358.75,-56.25"/>
-<text text-anchor="middle" x="300.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-46.62C214.78,-46.62 222.98,-46.62 231.32,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.23,-50.13 241.23,-46.63 231.23,-43.13 231.23,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index f14a5e1cb..000000000
--- a/d9/d14/array__left__rotation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="367pt" height="175pt"
- viewBox="0.00 0.00 366.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-93.25 0,-93.25 0,-74 37,-74 37,-93.25"/>
-<text text-anchor="middle" x="18.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the correctness of shift_left() function.">
-<polygon fill="white" stroke="#666666" points="105.5,-93.25 73,-93.25 73,-74 105.5,-74 105.5,-93.25"/>
-<text text-anchor="middle" x="89.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-83.62C44.58,-83.62 53.31,-83.62 61.45,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-87.13 71.2,-83.63 61.2,-80.13 61.2,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="207,-167.25 141.5,-167.25 141.5,-148 207,-148 207,-167.25"/>
-<text text-anchor="middle" x="174.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.78,-93.61C107.13,-105.55 123.98,-125.66 141.5,-139.62 142.17,-140.16 142.86,-140.68 143.56,-141.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.61,-144.11 151.89,-146.67 145.45,-138.26 141.61,-144.11"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="207,-130.25 141.5,-130.25 141.5,-111 207,-111 207,-130.25"/>
-<text text-anchor="middle" x="174.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-90.58C115.57,-94.91 128.42,-100.64 140.3,-105.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.87,-109.13 149.43,-110.01 141.72,-102.74 138.87,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="207,-93.25 141.5,-93.25 141.5,-74 207,-74 207,-93.25"/>
-<text text-anchor="middle" x="174.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-83.62C112.78,-83.62 121.31,-83.62 129.93,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.69,-87.13 139.69,-83.63 129.69,-80.13 129.69,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="207,-56.25 141.5,-56.25 141.5,-37 207,-37 207,-56.25"/>
-<text text-anchor="middle" x="174.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-76.67C115.57,-72.34 128.42,-66.61 140.3,-61.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.72,-64.51 149.43,-57.24 138.87,-58.12 141.72,-64.51"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="207,-19.25 141.5,-19.25 141.5,0 207,0 207,-19.25"/>
-<text text-anchor="middle" x="174.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.78,-73.64C107.13,-61.7 123.98,-41.59 141.5,-27.62 142.17,-27.09 142.86,-26.57 143.56,-26.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.45,-28.99 151.89,-20.58 141.61,-23.14 145.45,-28.99"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.75,-56.25 243,-56.25 243,-37 358.75,-37 358.75,-56.25"/>
-<text text-anchor="middle" x="300.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-46.62C214.78,-46.62 222.98,-46.62 231.32,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.23,-50.13 241.23,-46.63 231.23,-43.13 231.23,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d14/array__left__rotation_8cpp_source.html b/d9/d14/array__left__rotation_8cpp_source.html
new file mode 100644
index 000000000..f71cf3192
--- /dev/null
+++ b/d9/d14/array__left__rotation_8cpp_source.html
@@ -0,0 +1,277 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: operations_on_datastructures/array_left_rotation.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d14/array__left__rotation_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">array_left_rotation.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/d14/array__left__rotation_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a> {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="foldopen" id="foldopen00029" data-start="{" data-end="}">
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">   29</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">print</a>(<span class="keyword">const</span> std::vector&lt;int32_t&gt; &amp;array) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">for</span> (int32_t i : array) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;  </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    }</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;  </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>}</div>
+</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="foldopen" id="foldopen00046" data-start="{" data-end="}">
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"><a class="line" href="../../da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8">   46</a></span>std::vector&lt;int32_t&gt; <a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8">shift_left</a>(<span class="keyword">const</span> std::vector&lt;int32_t&gt; &amp;array,</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>                                <span class="keywordtype">size_t</span> shift) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">if</span> (array.size() &lt;= shift) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        <span class="keywordflow">return</span> {};  </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    std::vector&lt;int32_t&gt; res(array.size());  </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = shift; i &lt; array.size(); i++) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        res[i - shift] = array[i];  </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; shift; i++) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        res[array.size() - shift + i] =</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            array[i];  </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">return</span> res;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>}</div>
+</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>}  <span class="comment">// namespace operations_on_datastructures</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/df4/namespacetests.html">tests</a> {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="keyword">using </span><a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures::print</a>;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="keyword">using </span><a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8">operations_on_datastructures::shift_left</a>;</div>
+<div class="foldopen" id="foldopen00075" data-start="{" data-end="}">
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">   75</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">test1</a>() {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 1\n&quot;</span>;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {1, 2, 3, 4, 5}\n&quot;</span>;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {3, 4, 5, 1, 2}\n&quot;</span>;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    std::vector&lt;int32_t&gt; arr = {1, 2, 3, 4, 5};</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    std::vector&lt;int32_t&gt; res = shift_left(arr, 2);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    std::vector&lt;int32_t&gt; expected = {3, 4, 5, 1, 2};</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    assert(res == expected);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    print(res);  </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00090" data-start="{" data-end="}">
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">   90</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">test2</a>() {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 2\n&quot;</span>;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {}\n&quot;</span>;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {}\n&quot;</span>;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    std::vector&lt;int32_t&gt; arr = {};</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    std::vector&lt;int32_t&gt; res = shift_left(arr, 2);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    std::vector&lt;int32_t&gt; expected = {};</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    assert(res == expected);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    print(res);  </div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00105" data-start="{" data-end="}">
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"><a class="line" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">  105</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">test3</a>() {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 3\n&quot;</span>;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {1, 2, 3, 4, 5}\n&quot;</span>;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {}\n&quot;</span>;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    std::vector&lt;int32_t&gt; arr = {1, 2, 3, 4, 5};</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    std::vector&lt;int32_t&gt; res = shift_left(arr, 7);  </div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::vector&lt;int32_t&gt; expected = {};</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    assert(res == expected);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    print(res);  </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00120" data-start="{" data-end="}">
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"><a class="line" href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">  120</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">test4</a>() {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 4\n&quot;</span>;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {2, 4, ..., 420}\n&quot;</span>;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {4, 6, ..., 420, 2}\n&quot;</span>;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    std::vector&lt;int32_t&gt; arr;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= 210; i++) {</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        arr.push_back(i * 2);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    }</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    print(arr);</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    std::vector&lt;int32_t&gt; res = shift_left(arr, 1);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    std::vector&lt;int32_t&gt; expected;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; 210; i++) {</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        expected.push_back(arr[i]);</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    }</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    expected.push_back(2);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    assert(res == expected);</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    print(res);  </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00143" data-start="{" data-end="}">
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"><a class="line" href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">  143</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">test5</a>() {</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 5\n&quot;</span>;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {1, 2, 3, 4, 5}\n&quot;</span>;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {1, 2, 3, 4, 5}\n&quot;</span>;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    std::vector&lt;int32_t&gt; arr = {1, 2, 3, 4, 5};</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    std::vector&lt;int32_t&gt; res = shift_left(arr, 0);</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    assert(res == arr);</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    print(res);  </div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>}</div>
+</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>}  <span class="comment">// namespace tests</span></div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span> </div>
+<div class="foldopen" id="foldopen00159" data-start="{" data-end="}">
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"><a class="line" href="../../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  159</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a>();</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a>();</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a>();</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a>();</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a>();</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>}</div>
+</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span> </div>
+<div class="foldopen" id="foldopen00171" data-start="{" data-end="}">
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"><a class="line" href="../../d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  171</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <a class="code hl_function" href="../../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>}</div>
+</div>
+<div class="ttc" id="aarray__left__rotation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of shift_left() function.</div><div class="ttdef"><b>Definition</b> <a href="#l00159">array_left_rotation.cpp:159</a></div></div>
+<div class="ttc" id="aarray__left__rotation_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition</b> <a href="#l00171">array_left_rotation.cpp:171</a></div></div>
+<div class="ttc" id="anamespaceoperations__on__datastructures_html"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></div><div class="ttdoc">for std::vector</div></div>
+<div class="ttc" id="anamespaceoperations__on__datastructures_html_a6109193567a5b7e36a27f2b4865fce20"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures::print</a></div><div class="ttdeci">void print(const std::vector&lt; int32_t &gt; &amp;array)</div><div class="ttdoc">Prints the values of a vector sequentially, ending with a newline character.</div><div class="ttdef"><b>Definition</b> <a href="#l00029">array_left_rotation.cpp:29</a></div></div>
+<div class="ttc" id="anamespaceoperations__on__datastructures_html_afce39cf843989a39811a49ebe29dd6d8"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8">operations_on_datastructures::shift_left</a></div><div class="ttdeci">std::vector&lt; int32_t &gt; shift_left(const std::vector&lt; int32_t &gt; &amp;array, size_t shift)</div><div class="ttdoc">Shifts the given vector to the left by the shift amount and returns a new vector with the result....</div><div class="ttdef"><b>Definition</b> <a href="#l00046">array_left_rotation.cpp:46</a></div></div>
+<div class="ttc" id="anamespacetests_html"><div class="ttname"><a href="../../d9/df4/namespacetests.html">tests</a></div><div class="ttdoc">Testcases to check Union of Two Arrays.</div></div>
+<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> <a href="#l00075">array_left_rotation.cpp:75</a></div></div>
+<div class="ttc" id="anamespacetests_html_a2b9769e44683dcb67fe1083ad91e134d"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a></div><div class="ttdeci">void test4()</div><div class="ttdoc">A Test to check a very large input.</div><div class="ttdef"><b>Definition</b> <a href="#l00120">array_left_rotation.cpp:120</a></div></div>
+<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check an invalid shift value.</div><div class="ttdef"><b>Definition</b> <a href="#l00105">array_left_rotation.cpp:105</a></div></div>
+<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an empty vector.</div><div class="ttdef"><b>Definition</b> <a href="#l00090">array_left_rotation.cpp:90</a></div></div>
+<div class="ttc" id="anamespacetests_html_af7b81d7a1534216af6a36a80135beb86"><div class="ttname"><a href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a></div><div class="ttdeci">void test5()</div><div class="ttdoc">A Test to check a shift of zero.</div><div class="ttdef"><b>Definition</b> <a href="#l00143">array_left_rotation.cpp:143</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><a class="el" href="../../d9/d14/array__left__rotation_8cpp.html">array_left_rotation.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/d1c/kruskal_8cpp_source.html b/d9/d1c/kruskal_8cpp_source.html
new file mode 100644
index 000000000..a6f28b51e
--- /dev/null
+++ b/d9/d1c/kruskal_8cpp_source.html
@@ -0,0 +1,203 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/kruskal.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d1c/kruskal_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">kruskal.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;array&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment">//#include &lt;boost/multiprecision/cpp_int.hpp&gt;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment">// using namespace boost::multiprecision;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="keyword">const</span> <span class="keywordtype">int</span> mx = 1e6 + 5;</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="keyword">using </span>ll = int64_t;</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>std::array&lt;ll, mx&gt; parent;</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>ll <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, edge;</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>std::vector&lt;std::pair&lt;ll, std::pair&lt;ll, ll&gt;&gt;&gt; edges;</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="keywordtype">void</span> initial() {</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> + edge; ++i) {</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>        parent[i] = i;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    }</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>}</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="keywordtype">int</span> root(<span class="keywordtype">int</span> i) {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="keywordflow">while</span> (parent[i] != i) {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        parent[i] = parent[parent[i]];</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        i = parent[i];</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    }</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="keywordflow">return</span> i;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>}</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keywordtype">void</span> join(<span class="keywordtype">int</span> x, <span class="keywordtype">int</span> y) {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="keywordtype">int</span> root_x = root(x);  <span class="comment">// Disjoint set union by rank</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordtype">int</span> root_y = root(y);</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    parent[root_x] = root_y;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>}</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>ll kruskal() {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    ll mincost = 0;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; edge; ++i) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        ll x = edges[i].second.first;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        ll y = edges[i].second.second;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <span class="keywordflow">if</span> (root(x) != root(y)) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            mincost += edges[i].first;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>            join(x, y);</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        }</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">return</span> mincost;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>}</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="keywordtype">int</span> from = 0, to = 0, cost = 0, totalcost = 0;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        std::cin &gt;&gt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> &gt;&gt; edge;  <span class="comment">// Enter the nodes and edges</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> == 0 &amp;&amp; edge == 0) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>            <span class="keywordflow">break</span>;  <span class="comment">// Enter 0 0 to break out</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        }</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        initial();  <span class="comment">// Initialise the parent array</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; edge; ++i) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            std::cin &gt;&gt; from &gt;&gt; to &gt;&gt; cost;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            edges.emplace_back(make_pair(cost, std::make_pair(from, to)));</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            totalcost += cost;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        sort(edges.begin(), edges.end());</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        std::cout &lt;&lt; kruskal() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        edges.clear();</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    }</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><b>kruskal.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/d1f/binary__addition_8cpp.html b/d9/d1f/binary__addition_8cpp.html
index 3c3d34b13..c25bf6990 100644
--- a/d9/d1f/binary__addition_8cpp.html
+++ b/d9/d1f/binary__addition_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: greedy_algorithms/binary_addition.cpp File Reference</title>
+<title>TheAlgorithms/C++: greedy_algorithms/binary_addition.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for binary_addition.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d95/binary__addition_8cpp__incl.svg" width="347" height="126"><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">
+</div>
+<p><a href="../../d9/d1f/binary__addition_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html">greedy_algorithms::BinaryAddition</a></td></tr>
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Adds two binary numbers and outputs resulting string. </p>
 <p>The algorithm for adding two binary strings works by processing them from right to left, similar to manual addition. It starts by determining the longer string's length to ensure both strings are fully traversed. For each pair of corresponding bits and any carry from the previous addition, it calculates the sum. If the sum exceeds 1, a carry is generated for the next bit. The results for each bit are collected in a result string, which is reversed at the end to present the final binary sum correctly. Additionally, the function validates the input to ensure that only valid binary strings (containing only '0' and '1') are processed. If invalid input is detected, it returns an empty string. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/mjk22071998" target="_blank">Muhammad Junaid Khalid</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/d1f/binary__addition_8cpp_source.html">binary_addition.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -167,17 +188,14 @@ Functions</h2></td></tr>
 <p>main function </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on successful exit </dd></dl>
 <p>To execute tests</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d1f/binary__addition_8cpp_source.html#l00116">116</a> of file <a class="el" href="../../d9/d1f/binary__addition_8cpp_source.html">binary_addition.cpp</a>.</p>
 <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="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">/// To execute tests</span></div>
+<div class="line"><span class="lineno">  117</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); </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="abinary__addition_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">run self test implementation.</div><div class="ttdef"><b>Definition</b> binary_addition.cpp:86</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="487"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="abinary__addition_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">run self test implementation.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d1f/binary__addition_8cpp_source.html#l00086">binary_addition.cpp:86</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -205,6 +223,8 @@ Here is the call graph for this function:</div>
 
 <p>run self test implementation. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d1f/binary__addition_8cpp_source.html#l00086">86</a> of file <a class="el" href="../../d9/d1f/binary__addition_8cpp_source.html">binary_addition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   86</span>                    {</div>
 <div class="line"><span class="lineno">   87</span>    <a class="code hl_class" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html">greedy_algorithms::BinaryAddition</a> binaryAddition;</div>
 <div class="line"><span class="lineno">   88</span> </div>
@@ -230,14 +250,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  108</span>    assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;1x1&quot;</span>, <span class="stringliteral">&quot;111&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
 <div class="line"><span class="lineno">  109</span>    assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;1234&quot;</span>, <span class="stringliteral">&quot;1101&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
 <div class="line"><span class="lineno">  110</span>}</div>
-<div class="ttc" id="aclassgreedy__algorithms_1_1_binary_addition_html"><div class="ttname"><a href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html">greedy_algorithms::BinaryAddition</a></div><div class="ttdoc">A class to perform binary addition of two binary strings.</div><div class="ttdef"><b>Definition</b> binary_addition.cpp:31</div></div>
-<div class="ttc" id="aclassgreedy__algorithms_1_1_binary_addition_html_a801fd1ec5cda76b0bb82cbf23ed4d527"><div class="ttname"><a href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">greedy_algorithms::BinaryAddition::addBinary</a></div><div class="ttdeci">std::string addBinary(const std::string &amp;a, const std::string &amp;b)</div><div class="ttdoc">Adds two binary strings and returns the result as a binary string.</div><div class="ttdef"><b>Definition</b> binary_addition.cpp:40</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="100%" height="487"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassgreedy__algorithms_1_1_binary_addition_html"><div class="ttname"><a href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html">greedy_algorithms::BinaryAddition</a></div><div class="ttdoc">A class to perform binary addition of two binary strings.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d1f/binary__addition_8cpp_source.html#l00031">binary_addition.cpp:31</a></div></div>
+<div class="ttc" id="aclassgreedy__algorithms_1_1_binary_addition_html_a801fd1ec5cda76b0bb82cbf23ed4d527"><div class="ttname"><a href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">greedy_algorithms::BinaryAddition::addBinary</a></div><div class="ttdeci">std::string addBinary(const std::string &amp;a, const std::string &amp;b)</div><div class="ttdoc">Adds two binary strings and returns the result as a binary string.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d1f/binary__addition_8cpp_source.html#l00040">binary_addition.cpp:40</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index b75b3c06f..000000000
--- a/d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="run self test implementation." alt="" coords="5,145,56,171"/>
-<area shape="rect" id="Node000002" href="$de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527" title="Adds two binary strings and returns the result as a binary string." alt="" coords="104,138,275,178"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,156,88,156,88,161,56,161"/>
-<area shape="rect" id="Node000003" href="$de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" title="Validates whether a string contains only binary characters (0 or 1)." alt="" coords="323,40,511,95"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="241,135,330,99,332,104,243,140"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="381,120,453,146"/>
-<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="275,146,365,136,366,141,275,151"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/reverse.html#" title=" " alt="" coords="372,169,462,195"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="275,165,356,173,356,178,275,170"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="362,219,473,244"/>
-<area shape="poly" id="edge8_Node000002_Node000009" title=" " alt="" coords="244,177,324,205,347,212,346,217,322,210,242,182"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/all_any_none_of.html#" title=" " alt="" coords="579,5,658,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="511,42,563,29,565,34,512,47"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/begin.html#" title=" " alt="" coords="559,55,678,80"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="511,65,544,65,544,70,511,70"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/end.html#" title=" " alt="" coords="564,104,673,130"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="512,88,550,97,548,102,511,93"/>
-</map>
diff --git a/d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index fb90959bc..000000000
--- a/d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-63665c0e068421d7d7905880f7257247
\ No newline at end of file
diff --git a/d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index 91e6a70f4..000000000
--- a/d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,251 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<!--zoomable 187 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 512;
-var viewHeight = 187;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="run self test implementation.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-74.25 0,-74.25 0,-55 37.75,-55 37.75,-74.25"/>
-<text text-anchor="middle" x="18.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527" target="_top" xlink:title="Adds two binary strings and returns the result as a binary string.">
-<polygon fill="white" stroke="#666666" points="202.25,-79.88 73.75,-79.88 73.75,-49.38 202.25,-49.38 202.25,-79.88"/>
-<text text-anchor="start" x="81.75" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="138" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::addBinary</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.18,-64.62C45.01,-64.62 53.25,-64.62 62.04,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.87,-68.13 71.87,-64.63 61.87,-61.13 61.87,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" target="_top" xlink:title="Validates whether a string contains only binary characters (0 or 1).">
-<polygon fill="white" stroke="#666666" points="379.5,-153.5 238.25,-153.5 238.25,-111.75 379.5,-111.75 379.5,-153.5"/>
-<text text-anchor="start" x="246.25" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="246.25" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
-<text text-anchor="middle" x="308.88" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.74,-80.23C197.5,-88.18 222.03,-98.06 244.45,-107.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="242.93,-110.25 253.51,-110.73 245.54,-103.75 242.93,-110.25"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="336,-93.25 281.75,-93.25 281.75,-74 336,-74 336,-93.25"/>
-<text text-anchor="middle" x="308.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.36,-71.75C225.1,-74.31 250.02,-77.12 269.93,-79.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.48,-82.83 279.81,-80.47 270.26,-75.87 269.48,-82.83"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="342.75,-56.25 275,-56.25 275,-37 342.75,-37 342.75,-56.25"/>
-<text text-anchor="middle" x="308.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.36,-57.87C222.57,-55.72 244.51,-53.38 263.11,-51.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="263.43,-54.88 273.01,-50.34 262.69,-47.92 263.43,-54.88"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="350.62,-19.25 267.12,-19.25 267.12,0 350.62,0 350.62,-19.25"/>
-<text text-anchor="middle" x="308.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M178.28,-48.91C196.38,-41.94 218.25,-33.92 238.25,-27.62 243.98,-25.82 250.02,-24.06 256.04,-22.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="256.6,-25.86 265.35,-19.88 254.78,-19.1 256.6,-25.86"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="489.25,-179.25 430.5,-179.25 430.5,-160 489.25,-160 489.25,-179.25"/>
-<text text-anchor="middle" x="459.88" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M379.58,-149.93C393.12,-153.3 406.88,-156.71 419.05,-159.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="418.15,-163.12 428.7,-162.13 419.84,-156.33 418.15,-163.12"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="504.25,-142.25 415.5,-142.25 415.5,-123 504.25,-123 504.25,-142.25"/>
-<text text-anchor="middle" x="459.88" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M379.58,-132.62C387.72,-132.62 395.94,-132.62 403.84,-132.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="403.64,-136.13 413.64,-132.63 403.64,-129.13 403.64,-136.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="500.5,-105.25 419.25,-105.25 419.25,-86 500.5,-86 500.5,-105.25"/>
-<text text-anchor="middle" x="459.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M379.58,-115.32C389.06,-112.96 398.64,-110.58 407.71,-108.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="408.55,-111.73 417.41,-105.92 406.86,-104.94 408.55,-111.73"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index ebeb9eb94..000000000
--- a/d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,168 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="512pt" height="187pt"
- viewBox="0.00 0.00 512.25 187.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 183.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="run self test implementation.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-74.25 0,-74.25 0,-55 37.75,-55 37.75,-74.25"/>
-<text text-anchor="middle" x="18.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527" target="_top" xlink:title="Adds two binary strings and returns the result as a binary string.">
-<polygon fill="white" stroke="#666666" points="202.25,-79.88 73.75,-79.88 73.75,-49.38 202.25,-49.38 202.25,-79.88"/>
-<text text-anchor="start" x="81.75" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="138" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::addBinary</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.18,-64.62C45.01,-64.62 53.25,-64.62 62.04,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.87,-68.13 71.87,-64.63 61.87,-61.13 61.87,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" target="_top" xlink:title="Validates whether a string contains only binary characters (0 or 1).">
-<polygon fill="white" stroke="#666666" points="379.5,-153.5 238.25,-153.5 238.25,-111.75 379.5,-111.75 379.5,-153.5"/>
-<text text-anchor="start" x="246.25" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="246.25" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
-<text text-anchor="middle" x="308.88" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.74,-80.23C197.5,-88.18 222.03,-98.06 244.45,-107.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="242.93,-110.25 253.51,-110.73 245.54,-103.75 242.93,-110.25"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="336,-93.25 281.75,-93.25 281.75,-74 336,-74 336,-93.25"/>
-<text text-anchor="middle" x="308.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.36,-71.75C225.1,-74.31 250.02,-77.12 269.93,-79.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.48,-82.83 279.81,-80.47 270.26,-75.87 269.48,-82.83"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="342.75,-56.25 275,-56.25 275,-37 342.75,-37 342.75,-56.25"/>
-<text text-anchor="middle" x="308.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.36,-57.87C222.57,-55.72 244.51,-53.38 263.11,-51.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="263.43,-54.88 273.01,-50.34 262.69,-47.92 263.43,-54.88"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="350.62,-19.25 267.12,-19.25 267.12,0 350.62,0 350.62,-19.25"/>
-<text text-anchor="middle" x="308.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M178.28,-48.91C196.38,-41.94 218.25,-33.92 238.25,-27.62 243.98,-25.82 250.02,-24.06 256.04,-22.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="256.6,-25.86 265.35,-19.88 254.78,-19.1 256.6,-25.86"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="489.25,-179.25 430.5,-179.25 430.5,-160 489.25,-160 489.25,-179.25"/>
-<text text-anchor="middle" x="459.88" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M379.58,-149.93C393.12,-153.3 406.88,-156.71 419.05,-159.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="418.15,-163.12 428.7,-162.13 419.84,-156.33 418.15,-163.12"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="504.25,-142.25 415.5,-142.25 415.5,-123 504.25,-123 504.25,-142.25"/>
-<text text-anchor="middle" x="459.88" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M379.58,-132.62C387.72,-132.62 395.94,-132.62 403.84,-132.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="403.64,-136.13 413.64,-132.63 403.64,-129.13 403.64,-136.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="500.5,-105.25 419.25,-105.25 419.25,-86 500.5,-86 500.5,-105.25"/>
-<text text-anchor="middle" x="459.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M379.58,-115.32C389.06,-112.96 398.64,-110.58 407.71,-108.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="408.55,-111.73 417.41,-105.92 406.86,-104.94 408.55,-111.73"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index a96e554db..000000000
--- a/d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="main function" alt="" coords="5,145,55,171"/>
-<area shape="rect" id="Node000002" href="$d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="run self test implementation." alt="" coords="103,145,153,171"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,156,88,156,88,161,55,161"/>
-<area shape="rect" id="Node000003" href="$de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527" title="Adds two binary strings and returns the result as a binary string." alt="" coords="201,138,372,178"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="154,156,185,156,185,161,154,161"/>
-<area shape="rect" id="Node000004" href="$de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" title="Validates whether a string contains only binary characters (0 or 1)." alt="" coords="420,40,609,95"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="339,135,428,99,430,104,341,140"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="478,120,551,146"/>
-<area shape="poly" id="edge7_Node000003_Node000008" title=" " alt="" coords="372,146,462,136,463,141,373,151"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/reverse.html#" title=" " alt="" coords="469,169,560,195"/>
-<area shape="poly" id="edge8_Node000003_Node000009" title=" " alt="" coords="373,165,454,173,453,178,372,170"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="459,219,570,244"/>
-<area shape="poly" id="edge9_Node000003_Node000010" title=" " alt="" coords="341,177,421,205,445,212,443,217,420,210,339,182"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/all_any_none_of.html#" title=" " alt="" coords="677,5,755,31"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="608,42,661,29,662,34,609,47"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/begin.html#" title=" " alt="" coords="657,55,775,80"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="609,65,641,65,641,70,609,70"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/end.html#" title=" " alt="" coords="662,104,770,130"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="609,88,647,97,646,102,608,93"/>
-</map>
diff --git a/d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 400ff0139..000000000
--- a/d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c2e5140f359b81ab1ce769a37f7c6ebb
\ No newline at end of file
diff --git a/d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 9cf68d519..000000000
--- a/d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,269 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 187 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 585;
-var viewHeight = 187;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="run self test implementation.">
-<polygon fill="white" stroke="#666666" points="110.75,-74.25 73,-74.25 73,-55 110.75,-55 110.75,-74.25"/>
-<text text-anchor="middle" x="91.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-64.62C44.55,-64.62 53.37,-64.62 61.69,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-68.13 71.43,-64.63 61.43,-61.13 61.43,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527" target="_top" xlink:title="Adds two binary strings and returns the result as a binary string.">
-<polygon fill="white" stroke="#666666" points="275.25,-79.88 146.75,-79.88 146.75,-49.38 275.25,-49.38 275.25,-79.88"/>
-<text text-anchor="start" x="154.75" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="211" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::addBinary</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.18,-64.62C118.01,-64.62 126.25,-64.62 135.04,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.87,-68.13 144.87,-64.63 134.87,-61.13 134.87,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" target="_top" xlink:title="Validates whether a string contains only binary characters (0 or 1).">
-<polygon fill="white" stroke="#666666" points="452.5,-153.5 311.25,-153.5 311.25,-111.75 452.5,-111.75 452.5,-153.5"/>
-<text text-anchor="start" x="319.25" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="319.25" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
-<text text-anchor="middle" x="381.88" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M250.74,-80.23C270.5,-88.18 295.03,-98.06 317.45,-107.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.93,-110.25 326.51,-110.73 318.54,-103.75 315.93,-110.25"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="409,-93.25 354.75,-93.25 354.75,-74 409,-74 409,-93.25"/>
-<text text-anchor="middle" x="381.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.36,-71.75C298.1,-74.31 323.02,-77.12 342.93,-79.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="342.48,-82.83 352.81,-80.47 343.26,-75.87 342.48,-82.83"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415.75,-56.25 348,-56.25 348,-37 415.75,-37 415.75,-56.25"/>
-<text text-anchor="middle" x="381.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.36,-57.87C295.57,-55.72 317.51,-53.38 336.11,-51.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.43,-54.88 346.01,-50.34 335.69,-47.92 336.43,-54.88"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="423.62,-19.25 340.12,-19.25 340.12,0 423.62,0 423.62,-19.25"/>
-<text text-anchor="middle" x="381.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node10 -->
-<g id="edge9_Node000003_Node000010" class="edge">
-<title>Node3&#45;&gt;Node10</title>
-<g id="a_edge9_Node000003_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.28,-48.91C269.38,-41.94 291.25,-33.92 311.25,-27.62 316.98,-25.82 323.02,-24.06 329.04,-22.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.6,-25.86 338.35,-19.88 327.78,-19.1 329.6,-25.86"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="562.25,-179.25 503.5,-179.25 503.5,-160 562.25,-160 562.25,-179.25"/>
-<text text-anchor="middle" x="532.88" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M452.58,-149.93C466.12,-153.3 479.88,-156.71 492.05,-159.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="491.15,-163.12 501.7,-162.13 492.84,-156.33 491.15,-163.12"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="577.25,-142.25 488.5,-142.25 488.5,-123 577.25,-123 577.25,-142.25"/>
-<text text-anchor="middle" x="532.88" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M452.58,-132.62C460.72,-132.62 468.94,-132.62 476.84,-132.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="476.64,-136.13 486.64,-132.63 476.64,-129.13 476.64,-136.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="573.5,-105.25 492.25,-105.25 492.25,-86 573.5,-86 573.5,-105.25"/>
-<text text-anchor="middle" x="532.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M452.58,-115.32C462.06,-112.96 471.64,-110.58 480.71,-108.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.55,-111.73 490.41,-105.92 479.86,-104.94 481.55,-111.73"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 3f0480561..000000000
--- a/d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,186 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="585pt" height="187pt"
- viewBox="0.00 0.00 585.25 187.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 183.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="run self test implementation.">
-<polygon fill="white" stroke="#666666" points="110.75,-74.25 73,-74.25 73,-55 110.75,-55 110.75,-74.25"/>
-<text text-anchor="middle" x="91.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-64.62C44.55,-64.62 53.37,-64.62 61.69,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-68.13 71.43,-64.63 61.43,-61.13 61.43,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527" target="_top" xlink:title="Adds two binary strings and returns the result as a binary string.">
-<polygon fill="white" stroke="#666666" points="275.25,-79.88 146.75,-79.88 146.75,-49.38 275.25,-49.38 275.25,-79.88"/>
-<text text-anchor="start" x="154.75" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="211" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::addBinary</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.18,-64.62C118.01,-64.62 126.25,-64.62 135.04,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.87,-68.13 144.87,-64.63 134.87,-61.13 134.87,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" target="_top" xlink:title="Validates whether a string contains only binary characters (0 or 1).">
-<polygon fill="white" stroke="#666666" points="452.5,-153.5 311.25,-153.5 311.25,-111.75 452.5,-111.75 452.5,-153.5"/>
-<text text-anchor="start" x="319.25" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="319.25" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
-<text text-anchor="middle" x="381.88" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M250.74,-80.23C270.5,-88.18 295.03,-98.06 317.45,-107.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.93,-110.25 326.51,-110.73 318.54,-103.75 315.93,-110.25"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="409,-93.25 354.75,-93.25 354.75,-74 409,-74 409,-93.25"/>
-<text text-anchor="middle" x="381.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.36,-71.75C298.1,-74.31 323.02,-77.12 342.93,-79.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="342.48,-82.83 352.81,-80.47 343.26,-75.87 342.48,-82.83"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415.75,-56.25 348,-56.25 348,-37 415.75,-37 415.75,-56.25"/>
-<text text-anchor="middle" x="381.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.36,-57.87C295.57,-55.72 317.51,-53.38 336.11,-51.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.43,-54.88 346.01,-50.34 335.69,-47.92 336.43,-54.88"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="423.62,-19.25 340.12,-19.25 340.12,0 423.62,0 423.62,-19.25"/>
-<text text-anchor="middle" x="381.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node10 -->
-<g id="edge9_Node000003_Node000010" class="edge">
-<title>Node3&#45;&gt;Node10</title>
-<g id="a_edge9_Node000003_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M251.28,-48.91C269.38,-41.94 291.25,-33.92 311.25,-27.62 316.98,-25.82 323.02,-24.06 329.04,-22.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.6,-25.86 338.35,-19.88 327.78,-19.1 329.6,-25.86"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="562.25,-179.25 503.5,-179.25 503.5,-160 562.25,-160 562.25,-179.25"/>
-<text text-anchor="middle" x="532.88" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M452.58,-149.93C466.12,-153.3 479.88,-156.71 492.05,-159.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="491.15,-163.12 501.7,-162.13 492.84,-156.33 491.15,-163.12"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="577.25,-142.25 488.5,-142.25 488.5,-123 577.25,-123 577.25,-142.25"/>
-<text text-anchor="middle" x="532.88" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M452.58,-132.62C460.72,-132.62 468.94,-132.62 476.84,-132.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="476.64,-136.13 486.64,-132.63 476.64,-129.13 476.64,-136.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="573.5,-105.25 492.25,-105.25 492.25,-86 573.5,-86 573.5,-105.25"/>
-<text text-anchor="middle" x="532.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M452.58,-115.32C462.06,-112.96 471.64,-110.58 480.71,-108.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.55,-111.73 490.41,-105.92 479.86,-104.94 481.55,-111.73"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d1f/binary__addition_8cpp_source.html b/d9/d1f/binary__addition_8cpp_source.html
new file mode 100644
index 000000000..1ad7e7da3
--- /dev/null
+++ b/d9/d1f/binary__addition_8cpp_source.html
@@ -0,0 +1,231 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: greedy_algorithms/binary_addition.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d1f/binary__addition_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">binary_addition.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/d1f/binary__addition_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;string&gt;</span>     </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="foldopen" id="foldopen00027" data-start="{" data-end="}">
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../d2/d90/namespacegreedy__algorithms.html">   27</a></span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a> {</div>
+<div class="foldopen" id="foldopen00031" data-start="{" data-end="};">
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html">   31</a></span><span class="keyword">class </span><a class="code hl_class" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html">BinaryAddition</a> {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00040" data-start="{" data-end="}">
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">   40</a></span>    std::string <a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="keyword">const</span> std::string&amp; a, <span class="keyword">const</span> std::string&amp; b) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2">isValidBinaryString</a>(a) || !<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2">isValidBinaryString</a>(b)) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;&quot;</span>;  <span class="comment">// Return empty string if input contains non-binary</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>                        <span class="comment">// characters</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        }</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        std::string result;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="keywordtype">int</span> carry = 0;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="keywordtype">int</span> maxLength = std::max(a.size(), b.size());</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="comment">// Traverse both strings from the end to the beginning</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; maxLength; ++i) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            <span class="comment">// Get the current bits from both strings, if available</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            <span class="keywordtype">int</span> bitA = (i &lt; a.size()) ? (a[a.size() - 1 - i] - <span class="charliteral">&#39;0&#39;</span>) : 0;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            <span class="keywordtype">int</span> bitB = (i &lt; b.size()) ? (b[b.size() - 1 - i] - <span class="charliteral">&#39;0&#39;</span>) : 0;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            <span class="comment">// Calculate the sum of bits and carry</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            <span class="keywordtype">int</span> sum = bitA + bitB + carry;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>            carry = sum / 2;  <span class="comment">// Determine the carry for the next bit</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            result.push_back((sum % 2) +</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>                             <span class="charliteral">&#39;0&#39;</span>);  <span class="comment">// Append the sum&#39;s current bit to result</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        }</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordflow">if</span> (carry) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            result.push_back(<span class="charliteral">&#39;1&#39;</span>);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        std::reverse(result.begin(), result.end());</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    }</div>
+</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> <span class="keyword">private</span>:</div>
+<div class="foldopen" id="foldopen00075" data-start="{" data-end="}">
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2">   75</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2">isValidBinaryString</a>(<span class="keyword">const</span> std::string&amp; str)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="keywordflow">return</span> std::all_of(str.begin(), str.end(),</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>                           [](<span class="keywordtype">char</span> c) { return c == <span class="stringliteral">&#39;0&#39;</span> || c == <span class="stringliteral">&#39;1&#39;</span>; });</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    }</div>
+</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>};</div>
+</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>}  <span class="comment">// namespace greedy_algorithms</span></div>
+</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="foldopen" id="foldopen00086" data-start="{" data-end="}">
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="../../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">   86</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <a class="code hl_class" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html">greedy_algorithms::BinaryAddition</a> binaryAddition;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="comment">// Valid binary string tests</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;1010&quot;</span>, <span class="stringliteral">&quot;1101&quot;</span>) == <span class="stringliteral">&quot;10111&quot;</span>);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;1111&quot;</span>, <span class="stringliteral">&quot;1111&quot;</span>) == <span class="stringliteral">&quot;11110&quot;</span>);</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;101&quot;</span>, <span class="stringliteral">&quot;11&quot;</span>) == <span class="stringliteral">&quot;1000&quot;</span>);</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;0&quot;</span>, <span class="stringliteral">&quot;0&quot;</span>) == <span class="stringliteral">&quot;0&quot;</span>);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;1111&quot;</span>, <span class="stringliteral">&quot;1111&quot;</span>) == <span class="stringliteral">&quot;11110&quot;</span>);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;0&quot;</span>, <span class="stringliteral">&quot;10101&quot;</span>) == <span class="stringliteral">&quot;10101&quot;</span>);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;10101&quot;</span>, <span class="stringliteral">&quot;0&quot;</span>) == <span class="stringliteral">&quot;10101&quot;</span>);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;101010101010101010101010101010&quot;</span>,</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>                                    <span class="stringliteral">&quot;110110110110110110110110110110&quot;</span>) ==</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>           <span class="stringliteral">&quot;1100001100001100001100001100000&quot;</span>);</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;1&quot;</span>, <span class="stringliteral">&quot;11111111&quot;</span>) == <span class="stringliteral">&quot;100000000&quot;</span>);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;10101010&quot;</span>, <span class="stringliteral">&quot;01010101&quot;</span>) == <span class="stringliteral">&quot;11111111&quot;</span>);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="comment">// Invalid binary string tests (should return empty string)</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;10102&quot;</span>, <span class="stringliteral">&quot;1101&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;ABC&quot;</span>, <span class="stringliteral">&quot;1101&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;1010&quot;</span>, <span class="stringliteral">&quot;1102&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;111&quot;</span>, <span class="stringliteral">&quot;1x1&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;1x1&quot;</span>, <span class="stringliteral">&quot;111&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;1234&quot;</span>, <span class="stringliteral">&quot;1101&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>}</div>
+</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="foldopen" id="foldopen00116" data-start="{" data-end="}">
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"><a class="line" href="../../d9/d1f/binary__addition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  116</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d1f/binary__addition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <a class="code hl_function" href="../../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); </div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>}</div>
+</div>
+<div class="ttc" id="abinary__addition_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">run self test implementation.</div><div class="ttdef"><b>Definition</b> <a href="#l00086">binary_addition.cpp:86</a></div></div>
+<div class="ttc" id="abinary__addition_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d1f/binary__addition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition</b> <a href="#l00116">binary_addition.cpp:116</a></div></div>
+<div class="ttc" id="aclassgreedy__algorithms_1_1_binary_addition_html"><div class="ttname"><a href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html">greedy_algorithms::BinaryAddition</a></div><div class="ttdoc">A class to perform binary addition of two binary strings.</div><div class="ttdef"><b>Definition</b> <a href="#l00031">binary_addition.cpp:31</a></div></div>
+<div class="ttc" id="aclassgreedy__algorithms_1_1_binary_addition_html_a4cfb595ba80795a9efae0e3f6f5c34d2"><div class="ttname"><a href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2">greedy_algorithms::BinaryAddition::isValidBinaryString</a></div><div class="ttdeci">bool isValidBinaryString(const std::string &amp;str) const</div><div class="ttdoc">Validates whether a string contains only binary characters (0 or 1).</div><div class="ttdef"><b>Definition</b> <a href="#l00075">binary_addition.cpp:75</a></div></div>
+<div class="ttc" id="aclassgreedy__algorithms_1_1_binary_addition_html_a801fd1ec5cda76b0bb82cbf23ed4d527"><div class="ttname"><a href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">greedy_algorithms::BinaryAddition::addBinary</a></div><div class="ttdeci">std::string addBinary(const std::string &amp;a, const std::string &amp;b)</div><div class="ttdoc">Adds two binary strings and returns the result as a binary string.</div><div class="ttdef"><b>Definition</b> <a href="#l00040">binary_addition.cpp:40</a></div></div>
+<div class="ttc" id="anamespacegreedy__algorithms_html"><div class="ttname"><a href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></div><div class="ttdoc">for string class</div><div class="ttdef"><b>Definition</b> <a href="#l00027">binary_addition.cpp:27</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_0eaa691bd54ab0922ca7f50599de6d22.html">greedy_algorithms</a></li><li class="navelem"><a class="el" href="../../d9/d1f/binary__addition_8cpp.html">binary_addition.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/d21/classmachine__learning_1_1adaline-members.html b/d9/d21/classmachine__learning_1_1adaline-members.html
index f8890370b..c8ec4727a 100644
--- a/d9/d21/classmachine__learning_1_1adaline-members.html
+++ b/d9/d21/classmachine__learning_1_1adaline-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d9/d21/namespacewave__sort.html b/d9/d21/namespacewave__sort.html
index df2ecae5c..0206d3583 100644
--- a/d9/d21/namespacewave__sort.html
+++ b/d9/d21/namespacewave__sort.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: wave_sort Namespace Reference</title>
+<title>TheAlgorithms/C++: wave_sort Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d9/d23/classgraph_1_1_lowest_common_ancestor.html b/d9/d23/classgraph_1_1_lowest_common_ancestor.html
index f4cf9f73e..5f365658a 100644
--- a/d9/d23/classgraph_1_1_lowest_common_ancestor.html
+++ b/d9/d23/classgraph_1_1_lowest_common_ancestor.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph::LowestCommonAncestor Class Reference</title>
+<title>TheAlgorithms/C++: graph::LowestCommonAncestor Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -129,12 +146,10 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:ad6ae1f39c3ce27fc009970e6aa3c022a" id="r_ad6ae1f39c3ce27fc009970e6aa3c022a"><td class="memItemLeft" align="right" valign="top"><a id="ad6ae1f39c3ce27fc009970e6aa3c022a" name="ad6ae1f39c3ce27fc009970e6aa3c022a"></a>
-const <a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><b>tree</b></td></tr>
+<tr class="memitem:ad6ae1f39c3ce27fc009970e6aa3c022a" id="r_ad6ae1f39c3ce27fc009970e6aa3c022a"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad6ae1f39c3ce27fc009970e6aa3c022a">tree</a></td></tr>
 <tr class="separator:ad6ae1f39c3ce27fc009970e6aa3c022a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a46d10f669791e3da9a4809bd8ff8d3ad" id="r_a46d10f669791e3da9a4809bd8ff8d3ad"><td class="memItemLeft" align="right" valign="top"><a id="a46d10f669791e3da9a4809bd8ff8d3ad" name="a46d10f669791e3da9a4809bd8ff8d3ad"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>up</b></td></tr>
-<tr class="memdesc:a46d10f669791e3da9a4809bd8ff8d3ad"><td class="mdescLeft">&#160;</td><td class="mdescRight">for every vertex stores a list of its ancestors by powers of two For each vertex, the first element of the corresponding list contains the index of its parent. The i-th element of the list is an index of the (2^i)-th ancestor of the vertex. <br /></td></tr>
+<tr class="memitem:a46d10f669791e3da9a4809bd8ff8d3ad" id="r_a46d10f669791e3da9a4809bd8ff8d3ad"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a></td></tr>
+<tr class="memdesc:a46d10f669791e3da9a4809bd8ff8d3ad"><td class="mdescLeft">&#160;</td><td class="mdescRight">for every vertex stores a list of its ancestors by powers of two For each vertex, the first element of the corresponding list contains the index of its parent. The i-th element of the list is an index of the (2^i)-th ancestor of the vertex.  <br /></td></tr>
 <tr class="separator:a46d10f669791e3da9a4809bd8ff8d3ad"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pro-methods" name="pro-methods"></a>
@@ -144,6 +159,8 @@ Protected Member Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A structure that holds a rooted tree and allow for effecient queries of the lowest common ancestor of two given vertices in the tree. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00145">145</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a80825a4fd4c41860b689d253dd2c8e93" name="a80825a4fd4c41860b689d253dd2c8e93"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a80825a4fd4c41860b689d253dd2c8e93">&#9670;&#160;</a></span>LowestCommonAncestor()</h2>
@@ -175,16 +192,13 @@ Protected Member Functions</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00151">151</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  151</span>                                                           : tree(tree_) {</div>
 <div class="line"><span class="lineno">  152</span>        <a class="code hl_function" href="#a42589cc39d6bbff6c997152f1b96e356">populate_up</a>();</div>
 <div class="line"><span class="lineno">  153</span>    }</div>
-<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a42589cc39d6bbff6c997152f1b96e356"><div class="ttname"><a href="#a42589cc39d6bbff6c997152f1b96e356">graph::LowestCommonAncestor::populate_up</a></div><div class="ttdeci">void populate_up()</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:212</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph.svg" width="100%" height="413"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a42589cc39d6bbff6c997152f1b96e356"><div class="ttname"><a href="#a42589cc39d6bbff6c997152f1b96e356">graph::LowestCommonAncestor::populate_up</a></div><div class="ttdeci">void populate_up()</div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00212">lowest_common_ancestor.cpp:212</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Function Documentation</h2>
@@ -224,10 +238,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>index of the vertex which is the lowet common ancestor of u and v </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00164">164</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  164</span>                                                   {</div>
 <div class="line"><span class="lineno">  165</span>        <span class="comment">// Ensure u is the deeper (higher level) of the two vertices</span></div>
 <div class="line"><span class="lineno">  166</span>        <span class="keywordflow">if</span> (tree.<a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[v] &gt; tree.<a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[u]) {</div>
-<div class="line"><span class="lineno">  167</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(u, v);</div>
+<div class="line"><span class="lineno">  167</span>            std::swap(u, v);</div>
 <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="comment">// &quot;Lift&quot; u to the same level as v.</span></div>
@@ -257,15 +273,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  194</span>        assert(<a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[u][0] == <a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[v][0]);</div>
 <div class="line"><span class="lineno">  195</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[u][0];</div>
 <div class="line"><span class="lineno">  196</span>    }</div>
-<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a46d10f669791e3da9a4809bd8ff8d3ad"><div class="ttname"><a href="#a46d10f669791e3da9a4809bd8ff8d3ad">graph::LowestCommonAncestor::up</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; up</div><div class="ttdoc">for every vertex stores a list of its ancestors by powers of two For each vertex, the first element o...</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:206</div></div>
-<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a2ee3ad1161ac2532da30c3e22c265ad3"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">graph::RootedTree::level</a></div><div class="ttdeci">std::vector&lt; int &gt; level</div><div class="ttdoc">Stores the distance from the root.</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:106</div></div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- 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="../../d9/d23/classgraph_1_1_lowest_common_ancestor_a60151e19512b48cc0b14ea121df00488_cgraph.svg" width="346" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a46d10f669791e3da9a4809bd8ff8d3ad"><div class="ttname"><a href="#a46d10f669791e3da9a4809bd8ff8d3ad">graph::LowestCommonAncestor::up</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; up</div><div class="ttdoc">for every vertex stores a list of its ancestors by powers of two For each vertex, the first element o...</div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00206">lowest_common_ancestor.cpp:206</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a2ee3ad1161ac2532da30c3e22c265ad3"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">graph::RootedTree::level</a></div><div class="ttdeci">std::vector&lt; int &gt; level</div><div class="ttdoc">Stores the distance from the root.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00106">lowest_common_ancestor.cpp:106</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a42589cc39d6bbff6c997152f1b96e356" name="a42589cc39d6bbff6c997152f1b96e356"></a>
@@ -291,34 +301,64 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Populate the "up" structure. See above. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00212">212</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  212</span>                       {</div>
-<div class="line"><span class="lineno">  213</span>        <a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/resize.html">resize</a>(tree.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>());</div>
+<div class="line"><span class="lineno">  213</span>        <a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>.resize(tree.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>());</div>
 <div class="line"><span class="lineno">  214</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vertex = 0; vertex &lt; tree.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>(); ++vertex) {</div>
-<div class="line"><span class="lineno">  215</span>            <a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[vertex].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(tree.<a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">parent</a>[vertex]);</div>
+<div class="line"><span class="lineno">  215</span>            <a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[vertex].push_back(tree.<a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">parent</a>[vertex]);</div>
 <div class="line"><span class="lineno">  216</span>        }</div>
 <div class="line"><span class="lineno">  217</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> level = 0; (1 &lt;&lt; level) &lt; tree.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>(); ++level) {</div>
 <div class="line"><span class="lineno">  218</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vertex = 0; vertex &lt; tree.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>(); ++vertex) {</div>
 <div class="line"><span class="lineno">  219</span>                <span class="comment">// up[vertex][level + 1] = 2^(level + 1) th ancestor of vertex =</span></div>
 <div class="line"><span class="lineno">  220</span>                <span class="comment">// = 2^level th ancestor of 2^level th ancestor of vertex =</span></div>
 <div class="line"><span class="lineno">  221</span>                <span class="comment">// = 2^level th ancestor of up[vertex][level]</span></div>
-<div class="line"><span class="lineno">  222</span>                <a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[vertex].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[<a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[vertex][level]][level]);</div>
+<div class="line"><span class="lineno">  222</span>                <a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[vertex].push_back(<a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[<a class="code hl_variable" href="#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[vertex][level]][level]);</div>
 <div class="line"><span class="lineno">  223</span>            }</div>
 <div class="line"><span class="lineno">  224</span>        }</div>
 <div class="line"><span class="lineno">  225</span>    }</div>
-<div class="ttc" id="aclassgraph_1_1_graph_html_a8930d1470d132b19e430d1c71f94c904"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">graph::Graph::number_of_vertices</a></div><div class="ttdeci">int number_of_vertices() const</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:74</div></div>
-<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a3831583a91914988897a4cc8748fda43"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">graph::RootedTree::parent</a></div><div class="ttdeci">std::vector&lt; int &gt; parent</div><div class="ttdoc">Stores parent of every vertex and for root its own index. The root is technically not its own parent,...</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:104</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="aresize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/resize.html">std::vector::resize</a></div><div class="ttdeci">T resize(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d23/classgraph_1_1_lowest_common_ancestor_a42589cc39d6bbff6c997152f1b96e356_cgraph.svg" width="586" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="ttc" id="aclassgraph_1_1_graph_html_a8930d1470d132b19e430d1c71f94c904"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">graph::Graph::number_of_vertices</a></div><div class="ttdeci">int number_of_vertices() const</div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00074">lowest_common_ancestor.cpp:74</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a3831583a91914988897a4cc8748fda43"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">graph::RootedTree::parent</a></div><div class="ttdeci">std::vector&lt; int &gt; parent</div><div class="ttdoc">Stores parent of every vertex and for root its own index. The root is technically not its own parent,...</div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00104">lowest_common_ancestor.cpp:104</a></div></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="ad6ae1f39c3ce27fc009970e6aa3c022a" name="ad6ae1f39c3ce27fc009970e6aa3c022a"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ad6ae1f39c3ce27fc009970e6aa3c022a">&#9670;&#160;</a></span>tree</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">const <a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a>&amp; graph::LowestCommonAncestor::tree</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00199">199</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a46d10f669791e3da9a4809bd8ff8d3ad" name="a46d10f669791e3da9a4809bd8ff8d3ad"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a46d10f669791e3da9a4809bd8ff8d3ad">&#9670;&#160;</a></span>up</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::vector&lt;int&gt; &gt; graph::LowestCommonAncestor::up</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>for every vertex stores a list of its ancestors by powers of two For each vertex, the first element of the corresponding list contains the index of its parent. The i-th element of the list is an index of the (2^i)-th ancestor of the vertex. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00206">206</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>graph/<a class="el" href="../../de/dde/lowest__common__ancestor_8cpp.html">lowest_common_ancestor.cpp</a></li>
+<li>graph/<a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d9/d23/classgraph_1_1_lowest_common_ancestor_a42589cc39d6bbff6c997152f1b96e356_cgraph.map b/d9/d23/classgraph_1_1_lowest_common_ancestor_a42589cc39d6bbff6c997152f1b96e356_cgraph.map
deleted file mode 100644
index 1b49a5a82..000000000
--- a/d9/d23/classgraph_1_1_lowest_common_ancestor_a42589cc39d6bbff6c997152f1b96e356_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="graph::LowestCommonAncestor::populate_up" name="graph::LowestCommonAncestor::populate_up">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,63,214,103"/>
-<area shape="rect" id="Node000002" href="$dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904" title=" " alt="" coords="265,5,412,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="193,60,249,45,251,50,194,65"/>
-<area shape="rect" id="Node000004" 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="262,70,416,96"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="214,80,246,80,246,86,214,86"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="276,120,402,145"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="208,101,262,113,261,118,206,107"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="464,13,579,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="413,23,448,23,448,28,413,28"/>
-</map>
diff --git a/d9/d23/classgraph_1_1_lowest_common_ancestor_a42589cc39d6bbff6c997152f1b96e356_cgraph.md5 b/d9/d23/classgraph_1_1_lowest_common_ancestor_a42589cc39d6bbff6c997152f1b96e356_cgraph.md5
deleted file mode 100644
index 1fec9b331..000000000
--- a/d9/d23/classgraph_1_1_lowest_common_ancestor_a42589cc39d6bbff6c997152f1b96e356_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ce6fc3874db3a1ad01ed682ab86d3244
\ No newline at end of file
diff --git a/d9/d23/classgraph_1_1_lowest_common_ancestor_a42589cc39d6bbff6c997152f1b96e356_cgraph.svg b/d9/d23/classgraph_1_1_lowest_common_ancestor_a42589cc39d6bbff6c997152f1b96e356_cgraph.svg
deleted file mode 100644
index 94a63a40a..000000000
--- a/d9/d23/classgraph_1_1_lowest_common_ancestor_a42589cc39d6bbff6c997152f1b96e356_cgraph.svg
+++ /dev/null
@@ -1,121 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::LowestCommonAncestor::populate_up Pages: 1 -->
-<svg width="439pt" height="113pt"
- viewBox="0.00 0.00 438.50 112.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 108.88)">
-<title>graph::LowestCommonAncestor::populate_up</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="156.25,-61.88 0,-61.88 0,-31.38 156.25,-31.38 156.25,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
-<text text-anchor="middle" x="78.12" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::populate_up</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.38,-104.88 194.88,-104.88 194.88,-74.38 305.38,-74.38 305.38,-104.88"/>
-<text text-anchor="start" x="202.88" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::number</text>
-<text text-anchor="middle" x="250.12" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_of_vertices</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.98,-62.27C154.84,-65.78 169.59,-69.51 183.59,-73.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.61,-76.41 193.16,-75.47 184.32,-69.62 182.61,-76.41"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="308,-56.25 192.25,-56.25 192.25,-37 308,-37 308,-56.25"/>
-<text text-anchor="middle" x="250.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.66,-46.62C164.61,-46.62 172.64,-46.62 180.47,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.27,-50.13 190.27,-46.63 180.27,-43.13 180.27,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="297.5,-19.25 202.75,-19.25 202.75,0 297.5,0 297.5,-19.25"/>
-<text text-anchor="middle" x="250.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.22,-30.93C164.8,-27.98 178.83,-24.93 191.88,-22.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.55,-25.52 201.58,-19.97 191.06,-18.68 192.55,-25.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="430.5,-99.25 344,-99.25 344,-80 430.5,-80 430.5,-99.25"/>
-<text text-anchor="middle" x="387.25" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M305.7,-89.62C314.46,-89.62 323.52,-89.62 332.26,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="332.01,-93.13 342.01,-89.63 332.01,-86.13 332.01,-93.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d23/classgraph_1_1_lowest_common_ancestor_a42589cc39d6bbff6c997152f1b96e356_cgraph_org.svg b/d9/d23/classgraph_1_1_lowest_common_ancestor_a42589cc39d6bbff6c997152f1b96e356_cgraph_org.svg
deleted file mode 100644
index f3b114d16..000000000
--- a/d9/d23/classgraph_1_1_lowest_common_ancestor_a42589cc39d6bbff6c997152f1b96e356_cgraph_org.svg
+++ /dev/null
@@ -1,95 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::LowestCommonAncestor::populate_up Pages: 1 -->
-<svg width="439pt" height="113pt"
- viewBox="0.00 0.00 438.50 112.88" 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 108.88)">
-<title>graph::LowestCommonAncestor::populate_up</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="156.25,-61.88 0,-61.88 0,-31.38 156.25,-31.38 156.25,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
-<text text-anchor="middle" x="78.12" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::populate_up</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.38,-104.88 194.88,-104.88 194.88,-74.38 305.38,-74.38 305.38,-104.88"/>
-<text text-anchor="start" x="202.88" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::number</text>
-<text text-anchor="middle" x="250.12" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_of_vertices</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.98,-62.27C154.84,-65.78 169.59,-69.51 183.59,-73.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.61,-76.41 193.16,-75.47 184.32,-69.62 182.61,-76.41"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="308,-56.25 192.25,-56.25 192.25,-37 308,-37 308,-56.25"/>
-<text text-anchor="middle" x="250.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.66,-46.62C164.61,-46.62 172.64,-46.62 180.47,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.27,-50.13 190.27,-46.63 180.27,-43.13 180.27,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="297.5,-19.25 202.75,-19.25 202.75,0 297.5,0 297.5,-19.25"/>
-<text text-anchor="middle" x="250.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.22,-30.93C164.8,-27.98 178.83,-24.93 191.88,-22.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.55,-25.52 201.58,-19.97 191.06,-18.68 192.55,-25.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="430.5,-99.25 344,-99.25 344,-80 430.5,-80 430.5,-99.25"/>
-<text text-anchor="middle" x="387.25" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M305.7,-89.62C314.46,-89.62 323.52,-89.62 332.26,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="332.01,-93.13 342.01,-89.63 332.01,-86.13 332.01,-93.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d23/classgraph_1_1_lowest_common_ancestor_a60151e19512b48cc0b14ea121df00488_cgraph.map b/d9/d23/classgraph_1_1_lowest_common_ancestor_a60151e19512b48cc0b14ea121df00488_cgraph.map
deleted file mode 100644
index 142917119..000000000
--- a/d9/d23/classgraph_1_1_lowest_common_ancestor_a60151e19512b48cc0b14ea121df00488_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="graph::LowestCommonAncestor::lowest_common_ancestor" name="graph::LowestCommonAncestor::lowest_common_ancestor">
-<area shape="rect" id="Node000001" title="Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i..." alt="" coords="5,5,214,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="262,13,340,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="214,23,246,23,246,28,214,28"/>
-</map>
diff --git a/d9/d23/classgraph_1_1_lowest_common_ancestor_a60151e19512b48cc0b14ea121df00488_cgraph.md5 b/d9/d23/classgraph_1_1_lowest_common_ancestor_a60151e19512b48cc0b14ea121df00488_cgraph.md5
deleted file mode 100644
index 4faa02a6f..000000000
--- a/d9/d23/classgraph_1_1_lowest_common_ancestor_a60151e19512b48cc0b14ea121df00488_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8d1ed7bf69b7670f4b5d369da3aef65a
\ No newline at end of file
diff --git a/d9/d23/classgraph_1_1_lowest_common_ancestor_a60151e19512b48cc0b14ea121df00488_cgraph.svg b/d9/d23/classgraph_1_1_lowest_common_ancestor_a60151e19512b48cc0b14ea121df00488_cgraph.svg
deleted file mode 100644
index fa3b47dc5..000000000
--- a/d9/d23/classgraph_1_1_lowest_common_ancestor_a60151e19512b48cc0b14ea121df00488_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::LowestCommonAncestor::lowest_common_ancestor Pages: 1 -->
-<svg width="259pt" height="39pt"
- viewBox="0.00 0.00 259.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>graph::LowestCommonAncestor::lowest_common_ancestor</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i...">
-<polygon fill="#999999" stroke="#666666" points="156.25,-30.5 0,-30.5 0,0 156.25,0 156.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
-<text text-anchor="middle" x="78.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::lowest_common_ancestor</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251,-24.88 192.25,-24.88 192.25,-5.63 251,-5.63 251,-24.88"/>
-<text text-anchor="middle" x="221.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.5,-15.25C164.8,-15.25 172.97,-15.25 180.57,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.43,-18.75 190.43,-15.25 180.43,-11.75 180.43,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d23/classgraph_1_1_lowest_common_ancestor_a60151e19512b48cc0b14ea121df00488_cgraph_org.svg b/d9/d23/classgraph_1_1_lowest_common_ancestor_a60151e19512b48cc0b14ea121df00488_cgraph_org.svg
deleted file mode 100644
index 369abc717..000000000
--- a/d9/d23/classgraph_1_1_lowest_common_ancestor_a60151e19512b48cc0b14ea121df00488_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::LowestCommonAncestor::lowest_common_ancestor Pages: 1 -->
-<svg width="259pt" height="39pt"
- viewBox="0.00 0.00 259.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>graph::LowestCommonAncestor::lowest_common_ancestor</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i...">
-<polygon fill="#999999" stroke="#666666" points="156.25,-30.5 0,-30.5 0,0 156.25,0 156.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
-<text text-anchor="middle" x="78.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::lowest_common_ancestor</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251,-24.88 192.25,-24.88 192.25,-5.63 251,-5.63 251,-24.88"/>
-<text text-anchor="middle" x="221.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.5,-15.25C164.8,-15.25 172.97,-15.25 180.57,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.43,-18.75 190.43,-15.25 180.43,-11.75 180.43,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph.map b/d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph.map
deleted file mode 100644
index abc94de1c..000000000
--- a/d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="graph::LowestCommonAncestor::LowestCommonAncestor" name="graph::LowestCommonAncestor::LowestCommonAncestor">
-<area shape="rect" id="Node000001" title="Stores the tree and precomputs &quot;up lifts&quot;." alt="" coords="5,63,214,103"/>
-<area shape="rect" id="Node000002" href="$d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356" title=" " alt="" coords="262,63,470,103"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="214,80,246,80,246,86,214,86"/>
-<area shape="rect" id="Node000003" href="$dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904" title=" " alt="" coords="522,5,669,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="449,60,506,45,507,50,450,65"/>
-<area shape="rect" id="Node000005" 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="518,70,672,96"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="471,80,502,80,502,86,471,86"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="532,120,658,145"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="464,101,518,113,517,118,463,107"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="720,13,836,38"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="669,23,705,23,705,28,669,28"/>
-</map>
diff --git a/d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph.md5 b/d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph.md5
deleted file mode 100644
index f2cf7a6c0..000000000
--- a/d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-77056b7ec7d9075a5b12df216dc6297a
\ No newline at end of file
diff --git a/d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph.svg b/d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph.svg
deleted file mode 100644
index 5749f25fa..000000000
--- a/d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph.svg
+++ /dev/null
@@ -1,197 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::LowestCommonAncestor::LowestCommonAncestor Pages: 1 -->
-<!--zoomable 113 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 631;
-var viewHeight = 113;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>graph::LowestCommonAncestor::LowestCommonAncestor</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Stores the tree and precomputs &quot;up lifts&quot;.">
-<polygon fill="#999999" stroke="#666666" points="156.25,-61.88 0,-61.88 0,-31.38 156.25,-31.38 156.25,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
-<text text-anchor="middle" x="78.12" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::LowestCommonAncestor</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="348.5,-61.88 192.25,-61.88 192.25,-31.38 348.5,-31.38 348.5,-61.88"/>
-<text text-anchor="start" x="200.25" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
-<text text-anchor="middle" x="270.38" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::populate_up</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.51,-46.62C164.41,-46.62 172.48,-46.62 180.49,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.24,-50.13 190.24,-46.63 180.24,-43.13 180.24,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="497.62,-104.88 387.12,-104.88 387.12,-74.38 497.62,-74.38 497.62,-104.88"/>
-<text text-anchor="start" x="395.12" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::number</text>
-<text text-anchor="middle" x="442.38" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_of_vertices</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.23,-62.27C347.09,-65.78 361.84,-69.51 375.84,-73.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="374.86,-76.41 385.41,-75.47 376.57,-69.62 374.86,-76.41"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="500.25,-56.25 384.5,-56.25 384.5,-37 500.25,-37 500.25,-56.25"/>
-<text text-anchor="middle" x="442.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M348.91,-46.62C356.86,-46.62 364.89,-46.62 372.72,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="372.52,-50.13 382.52,-46.63 372.52,-43.13 372.52,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="489.75,-19.25 395,-19.25 395,0 489.75,0 489.75,-19.25"/>
-<text text-anchor="middle" x="442.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.47,-30.93C357.05,-27.98 371.08,-24.93 384.13,-22.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="384.8,-25.52 393.83,-19.97 383.31,-18.68 384.8,-25.52"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="622.75,-99.25 536.25,-99.25 536.25,-80 622.75,-80 622.75,-99.25"/>
-<text text-anchor="middle" x="579.5" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M497.95,-89.62C506.71,-89.62 515.77,-89.62 524.51,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="524.26,-93.13 534.26,-89.63 524.26,-86.13 524.26,-93.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph_org.svg b/d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph_org.svg
deleted file mode 100644
index 9c51c46be..000000000
--- a/d9/d23/classgraph_1_1_lowest_common_ancestor_a80825a4fd4c41860b689d253dd2c8e93_cgraph_org.svg
+++ /dev/null
@@ -1,114 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::LowestCommonAncestor::LowestCommonAncestor Pages: 1 -->
-<svg width="631pt" height="113pt"
- viewBox="0.00 0.00 630.75 112.88" 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 108.88)">
-<title>graph::LowestCommonAncestor::LowestCommonAncestor</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Stores the tree and precomputs &quot;up lifts&quot;.">
-<polygon fill="#999999" stroke="#666666" points="156.25,-61.88 0,-61.88 0,-31.38 156.25,-31.38 156.25,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
-<text text-anchor="middle" x="78.12" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::LowestCommonAncestor</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="348.5,-61.88 192.25,-61.88 192.25,-31.38 348.5,-31.38 348.5,-61.88"/>
-<text text-anchor="start" x="200.25" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
-<text text-anchor="middle" x="270.38" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::populate_up</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.51,-46.62C164.41,-46.62 172.48,-46.62 180.49,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.24,-50.13 190.24,-46.63 180.24,-43.13 180.24,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="497.62,-104.88 387.12,-104.88 387.12,-74.38 497.62,-74.38 497.62,-104.88"/>
-<text text-anchor="start" x="395.12" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::number</text>
-<text text-anchor="middle" x="442.38" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">_of_vertices</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.23,-62.27C347.09,-65.78 361.84,-69.51 375.84,-73.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="374.86,-76.41 385.41,-75.47 376.57,-69.62 374.86,-76.41"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="500.25,-56.25 384.5,-56.25 384.5,-37 500.25,-37 500.25,-56.25"/>
-<text text-anchor="middle" x="442.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M348.91,-46.62C356.86,-46.62 364.89,-46.62 372.72,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="372.52,-50.13 382.52,-46.63 372.52,-43.13 372.52,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="489.75,-19.25 395,-19.25 395,0 489.75,0 489.75,-19.25"/>
-<text text-anchor="middle" x="442.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.47,-30.93C357.05,-27.98 371.08,-24.93 384.13,-22.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="384.8,-25.52 393.83,-19.97 383.31,-18.68 384.8,-25.52"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="622.75,-99.25 536.25,-99.25 536.25,-80 622.75,-80 622.75,-99.25"/>
-<text text-anchor="middle" x="579.5" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M497.95,-89.62C506.71,-89.62 515.77,-89.62 524.51,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="524.26,-93.13 534.26,-89.63 524.26,-86.13 524.26,-93.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d24/poisson__dist_8cpp.html b/d9/d24/poisson__dist_8cpp.html
index c805d1e43..d8e19ebf7 100644
--- a/d9/d24/poisson__dist_8cpp.html
+++ b/d9/d24/poisson__dist_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: probability/poisson_dist.cpp File Reference</title>
+<title>TheAlgorithms/C++: probability/poisson_dist.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,7 +136,9 @@ Include dependency graph for poisson_dist.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/df5/poisson__dist_8cpp__incl.svg" width="163" height="126"><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">
+</div>
+<p><a href="../../d9/d24/poisson__dist_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ac217ab9a06291f360d816700a6958ca8" id="r_ac217ab9a06291f360d816700a6958ca8"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac217ab9a06291f360d816700a6958ca8">poisson_rate</a> (double events, double timeframe)</td></tr>
@@ -138,6 +157,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Poisson_distribution" target="_blank">Poisson statistics</a> </p>
 <p>The Poisson distribution counts how many events occur over a set time interval. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/d24/poisson__dist_8cpp_source.html">poisson_dist.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a63ffd347e75d5ed7a518cbcfbfeec71a" name="a63ffd347e75d5ed7a518cbcfbfeec71a"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a63ffd347e75d5ed7a518cbcfbfeec71a">&#9670;&#160;</a></span>fact()</h2>
@@ -154,6 +175,8 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Compute factorial of a given number </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d24/poisson__dist_8cpp_source.html#l00030">30</a> of file <a class="el" href="../../d9/d24/poisson__dist_8cpp_source.html">poisson_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   30</span>                      {</div>
 <div class="line"><span class="lineno">   31</span>    <span class="keywordtype">double</span> x_fact = x;</div>
 <div class="line"><span class="lineno">   32</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = x - 1; i &gt; 0; i--) {</div>
@@ -183,33 +206,28 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d24/poisson__dist_8cpp_source.html#l00065">65</a> of file <a class="el" href="../../d9/d24/poisson__dist_8cpp_source.html">poisson_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   65</span>           {</div>
 <div class="line"><span class="lineno">   66</span>    <span class="keywordtype">double</span> rate, expected;</div>
 <div class="line"><span class="lineno">   67</span>    rate = <a class="code hl_function" href="#ac217ab9a06291f360d816700a6958ca8">poisson_rate</a>(3, 1);</div>
-<div class="line"><span class="lineno">   68</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Poisson rate : &quot;</span> &lt;&lt; rate &lt;&lt; <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">   68</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Poisson rate : &quot;</span> &lt;&lt; rate &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   69</span> </div>
 <div class="line"><span class="lineno">   70</span>    expected = <a class="code hl_function" href="#ad0aa718023ce802dd5899f0e03a7ac71">poisson_expected</a>(rate, 2);</div>
-<div class="line"><span class="lineno">   71</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Poisson expected : &quot;</span> &lt;&lt; expected &lt;&lt; <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">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Poisson expected : &quot;</span> &lt;&lt; expected &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   72</span> </div>
-<div class="line"><span class="lineno">   73</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Poisson 0 successes : &quot;</span> &lt;&lt; <a class="code hl_function" href="#a69a136b32707bdc7950fb9057b5fa1e1">poisson_x_successes</a>(expected, 0)</div>
-<div class="line"><span class="lineno">   74</span>              &lt;&lt; <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">   75</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Poisson 0-8 successes : &quot;</span></div>
-<div class="line"><span class="lineno">   76</span>              &lt;&lt; <a class="code hl_function" href="#ad9c9e74079278ca10e3b97a8d5391c9a">poisson_range_successes</a>(expected, 0, 8) &lt;&lt; <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">   73</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Poisson 0 successes : &quot;</span> &lt;&lt; <a class="code hl_function" href="#a69a136b32707bdc7950fb9057b5fa1e1">poisson_x_successes</a>(expected, 0)</div>
+<div class="line"><span class="lineno">   74</span>              &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   75</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Poisson 0-8 successes : &quot;</span></div>
+<div class="line"><span class="lineno">   76</span>              &lt;&lt; <a class="code hl_function" href="#ad9c9e74079278ca10e3b97a8d5391c9a">poisson_range_successes</a>(expected, 0, 8) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   77</span> </div>
 <div class="line"><span class="lineno">   78</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   79</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="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="apoisson__dist_8cpp_html_a69a136b32707bdc7950fb9057b5fa1e1"><div class="ttname"><a href="#a69a136b32707bdc7950fb9057b5fa1e1">poisson_x_successes</a></div><div class="ttdeci">double poisson_x_successes(double expected, double x)</div><div class="ttdef"><b>Definition</b> poisson_dist.cpp:46</div></div>
-<div class="ttc" id="apoisson__dist_8cpp_html_ac217ab9a06291f360d816700a6958ca8"><div class="ttname"><a href="#ac217ab9a06291f360d816700a6958ca8">poisson_rate</a></div><div class="ttdeci">double poisson_rate(double events, double timeframe)</div><div class="ttdef"><b>Definition</b> poisson_dist.cpp:17</div></div>
-<div class="ttc" id="apoisson__dist_8cpp_html_ad0aa718023ce802dd5899f0e03a7ac71"><div class="ttname"><a href="#ad0aa718023ce802dd5899f0e03a7ac71">poisson_expected</a></div><div class="ttdeci">double poisson_expected(double rate, double time)</div><div class="ttdef"><b>Definition</b> poisson_dist.cpp:25</div></div>
-<div class="ttc" id="apoisson__dist_8cpp_html_ad9c9e74079278ca10e3b97a8d5391c9a"><div class="ttname"><a href="#ad9c9e74079278ca10e3b97a8d5391c9a">poisson_range_successes</a></div><div class="ttdeci">double poisson_range_successes(double expected, double lower, double upper)</div><div class="ttdef"><b>Definition</b> poisson_dist.cpp:54</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="652" height="259"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="apoisson__dist_8cpp_html_a69a136b32707bdc7950fb9057b5fa1e1"><div class="ttname"><a href="#a69a136b32707bdc7950fb9057b5fa1e1">poisson_x_successes</a></div><div class="ttdeci">double poisson_x_successes(double expected, double x)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d24/poisson__dist_8cpp_source.html#l00046">poisson_dist.cpp:46</a></div></div>
+<div class="ttc" id="apoisson__dist_8cpp_html_ac217ab9a06291f360d816700a6958ca8"><div class="ttname"><a href="#ac217ab9a06291f360d816700a6958ca8">poisson_rate</a></div><div class="ttdeci">double poisson_rate(double events, double timeframe)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d24/poisson__dist_8cpp_source.html#l00017">poisson_dist.cpp:17</a></div></div>
+<div class="ttc" id="apoisson__dist_8cpp_html_ad0aa718023ce802dd5899f0e03a7ac71"><div class="ttname"><a href="#ad0aa718023ce802dd5899f0e03a7ac71">poisson_expected</a></div><div class="ttdeci">double poisson_expected(double rate, double time)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d24/poisson__dist_8cpp_source.html#l00025">poisson_dist.cpp:25</a></div></div>
+<div class="ttc" id="apoisson__dist_8cpp_html_ad9c9e74079278ca10e3b97a8d5391c9a"><div class="ttname"><a href="#ad9c9e74079278ca10e3b97a8d5391c9a">poisson_range_successes</a></div><div class="ttdeci">double poisson_range_successes(double expected, double lower, double upper)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d24/poisson__dist_8cpp_source.html#l00054">poisson_dist.cpp:54</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad0aa718023ce802dd5899f0e03a7ac71" name="ad0aa718023ce802dd5899f0e03a7ac71"></a>
@@ -231,8 +249,9 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>calculate the expected value over a time e.g rate of 2.5 over 10 mins = 2.5 x 10 = 25 </p>
-<div class="fragment"><div class="line"><span class="lineno">   25</span>{ <span class="keywordflow">return</span> rate * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">time</a>; }</div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d24/poisson__dist_8cpp_source.html#l00025">25</a> of file <a class="el" href="../../d9/d24/poisson__dist_8cpp_source.html">poisson_dist.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   25</span>{ <span class="keywordflow">return</span> rate * time; }</div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -262,7 +281,9 @@ Here is the call graph for this function:</div>
 <p>probability of a success in range for Poisson dist (inclusive, inclusive) </p><p class="formulaDsp">
 \[P = \sum_i p(\mu,i)\]
 </p>
- <div class="fragment"><div class="line"><span class="lineno">   54</span>                                                                            {</div>
+ 
+<p class="definition">Definition at line <a class="el" href="../../d9/d24/poisson__dist_8cpp_source.html#l00054">54</a> of file <a class="el" href="../../d9/d24/poisson__dist_8cpp_source.html">poisson_dist.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   54</span>                                                                            {</div>
 <div class="line"><span class="lineno">   55</span>    <span class="keywordtype">double</span> <a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a> = 0;</div>
 <div class="line"><span class="lineno">   56</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = <a class="code hl_function" href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9">lower</a>; i &lt;= upper; i++) {</div>
 <div class="line"><span class="lineno">   57</span>        <a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a> += <a class="code hl_function" href="#a69a136b32707bdc7950fb9057b5fa1e1">poisson_x_successes</a>(expected, i);</div>
@@ -270,13 +291,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   59</span>    <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a>;</div>
 <div class="line"><span class="lineno">   60</span>}</div>
 <div class="ttc" id="anamespaceprobability_html"><div class="ttname"><a href="../../d4/ded/namespaceprobability.html">probability</a></div><div class="ttdoc">Probability algorithms.</div></div>
-<div class="ttc" id="atext__search_8cpp_html_a3f8975d227cd0e58f298b380c5dac0d9"><div class="ttname"><a href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9">lower</a></div><div class="ttdeci">std::string lower(std::string word)</div><div class="ttdoc">function to convert a C++ string to lower case</div><div class="ttdef"><b>Definition</b> text_search.cpp:19</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.svg" width="555" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="atext__search_8cpp_html_a3f8975d227cd0e58f298b380c5dac0d9"><div class="ttname"><a href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9">lower</a></div><div class="ttdeci">std::string lower(std::string word)</div><div class="ttdoc">function to convert a C++ string to lower case</div><div class="ttdef"><b>Definition</b> <a href="../../dc/db5/text__search_8cpp_source.html#l00019">text_search.cpp:19</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac217ab9a06291f360d816700a6958ca8" name="ac217ab9a06291f360d816700a6958ca8"></a>
@@ -300,6 +316,8 @@ Here is the call graph for this function:</div>
 <p>poisson rate:<br  />
 calculate the events per unit time<br  />
 e.g 5 dollars every 2 mins = 5 / 2 = 2.5 </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d24/poisson__dist_8cpp_source.html#l00017">17</a> of file <a class="el" href="../../d9/d24/poisson__dist_8cpp_source.html">poisson_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   17</span>                                                     {</div>
 <div class="line"><span class="lineno">   18</span>    <span class="keywordflow">return</span> events / timeframe;</div>
 <div class="line"><span class="lineno">   19</span>}</div>
@@ -327,18 +345,13 @@ e.g 5 dollars every 2 mins = 5 / 2 = 2.5 </p>
 <p>Find the probability of x successes in a Poisson dist. </p><p class="formulaDsp">
 \[p(\mu,x) = \frac{\mu^x e^{-\mu}}{x!}\]
 </p>
- <div class="fragment"><div class="line"><span class="lineno">   46</span>                                                      {</div>
-<div class="line"><span class="lineno">   47</span>    <span class="keywordflow">return</span> (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(expected, x) * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a>(-expected)) / <a class="code hl_function" href="#a63ffd347e75d5ed7a518cbcfbfeec71a">fact</a>(x);</div>
+ 
+<p class="definition">Definition at line <a class="el" href="../../d9/d24/poisson__dist_8cpp_source.html#l00046">46</a> of file <a class="el" href="../../d9/d24/poisson__dist_8cpp_source.html">poisson_dist.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   46</span>                                                      {</div>
+<div class="line"><span class="lineno">   47</span>    <span class="keywordflow">return</span> (std::pow(expected, x) * std::exp(-expected)) / <a class="code hl_function" href="#a63ffd347e75d5ed7a518cbcfbfeec71a">fact</a>(x);</div>
 <div class="line"><span class="lineno">   48</span>}</div>
-<div class="ttc" id="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div>
-<div class="ttc" id="apoisson__dist_8cpp_html_a63ffd347e75d5ed7a518cbcfbfeec71a"><div class="ttname"><a href="#a63ffd347e75d5ed7a518cbcfbfeec71a">fact</a></div><div class="ttdeci">double fact(double x)</div><div class="ttdef"><b>Definition</b> poisson_dist.cpp:30</div></div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.svg" width="280" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="apoisson__dist_8cpp_html_a63ffd347e75d5ed7a518cbcfbfeec71a"><div class="ttname"><a href="#a63ffd347e75d5ed7a518cbcfbfeec71a">fact</a></div><div class="ttdeci">double fact(double x)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d24/poisson__dist_8cpp_source.html#l00030">poisson_dist.cpp:30</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.map b/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.map
deleted file mode 100644
index 73e2b1c96..000000000
--- a/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="poisson_x_successes" name="poisson_x_successes">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,156,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/exp.html#" title=" " alt="" coords="205,5,274,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="124,51,189,31,191,36,125,57"/>
-<area shape="rect" id="Node000003" href="$d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a" title=" " alt="" coords="218,55,261,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="156,65,202,65,202,70,156,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="204,104,275,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="125,78,190,99,188,104,124,84"/>
-</map>
diff --git a/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.md5 b/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.md5
deleted file mode 100644
index 2dc50424b..000000000
--- a/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-81aa8a79eca3acecc0b7f6b852b3f987
\ No newline at end of file
diff --git a/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.svg b/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.svg
deleted file mode 100644
index 12401ce5d..000000000
--- a/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: poisson_x_successes Pages: 1 -->
-<svg width="210pt" height="101pt"
- viewBox="0.00 0.00 210.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>poisson_x_successes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="112.75,-56.25 0,-56.25 0,-37 112.75,-37 112.75,-56.25"/>
-<text text-anchor="middle" x="56.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">poisson_x_successes</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.12,-93.25 149.88,-93.25 149.88,-74 201.12,-74 201.12,-93.25"/>
-<text text-anchor="middle" x="175.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.38,-56.74C104.64,-61.56 122.95,-67.34 138.68,-72.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.56,-75.62 148.15,-75.3 139.66,-68.95 137.56,-75.62"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191.75,-56.25 159.25,-56.25 159.25,-37 191.75,-37 191.75,-56.25"/>
-<text text-anchor="middle" x="175.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">fact</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.19,-46.62C125.09,-46.62 137.14,-46.62 147.37,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.3,-50.13 157.3,-46.63 147.3,-43.13 147.3,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="202.25,-19.25 148.75,-19.25 148.75,0 202.25,0 202.25,-19.25"/>
-<text text-anchor="middle" x="175.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.38,-36.51C104.31,-31.8 122.17,-26.16 137.66,-21.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.53,-24.66 147.01,-18.31 136.42,-17.98 138.53,-24.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph_org.svg b/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph_org.svg
deleted file mode 100644
index cd3579ce3..000000000
--- a/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: poisson_x_successes Pages: 1 -->
-<svg width="210pt" height="101pt"
- viewBox="0.00 0.00 210.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>poisson_x_successes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="112.75,-56.25 0,-56.25 0,-37 112.75,-37 112.75,-56.25"/>
-<text text-anchor="middle" x="56.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">poisson_x_successes</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.12,-93.25 149.88,-93.25 149.88,-74 201.12,-74 201.12,-93.25"/>
-<text text-anchor="middle" x="175.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.38,-56.74C104.64,-61.56 122.95,-67.34 138.68,-72.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.56,-75.62 148.15,-75.3 139.66,-68.95 137.56,-75.62"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191.75,-56.25 159.25,-56.25 159.25,-37 191.75,-37 191.75,-56.25"/>
-<text text-anchor="middle" x="175.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">fact</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.19,-46.62C125.09,-46.62 137.14,-46.62 147.37,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.3,-50.13 157.3,-46.63 147.3,-43.13 147.3,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="202.25,-19.25 148.75,-19.25 148.75,0 202.25,0 202.25,-19.25"/>
-<text text-anchor="middle" x="175.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.38,-36.51C104.31,-31.8 122.17,-26.16 137.66,-21.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.53,-24.66 147.01,-18.31 136.42,-17.98 138.53,-24.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.map b/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.map
deleted file mode 100644
index 0159e96e5..000000000
--- a/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="poisson_range_successes" name="poisson_range_successes">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,56,181,82"/>
-<area shape="rect" id="Node000002" href="$dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9" title="function to convert a C++ string to lower case" alt="" coords="278,19,330,44"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="169,53,262,36,262,41,170,58"/>
-<area shape="rect" id="Node000004" href="$d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1" title=" " alt="" coords="229,80,379,106"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="181,76,214,80,213,85,181,81"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="427,5,549,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="330,27,411,21,411,26,331,32"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/exp.html#" title=" " alt="" coords="454,55,522,80"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="379,80,438,72,439,77,380,85"/>
-<area shape="rect" id="Node000006" href="$d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a" title=" " alt="" coords="466,104,510,130"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="380,100,452,109,451,115,379,105"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="452,153,524,179"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="339,104,428,140,440,145,438,150,426,145,337,109"/>
-</map>
diff --git a/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.md5 b/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.md5
deleted file mode 100644
index abae436f9..000000000
--- a/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2f1f7861327319d0283ca9a362193a01
\ No newline at end of file
diff --git a/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.svg b/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.svg
deleted file mode 100644
index f1940d4d4..000000000
--- a/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.svg
+++ /dev/null
@@ -1,155 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: poisson_range_successes Pages: 1 -->
-<svg width="416pt" height="138pt"
- viewBox="0.00 0.00 416.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>poisson_range_successes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="131.5,-92.25 0,-92.25 0,-73 131.5,-73 131.5,-92.25"/>
-<text text-anchor="middle" x="65.75" y="-78.75" font-family="Helvetica,sans-Serif" font-size="10.00">poisson_range_successes</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9" target="_top" xlink:title="function to convert a C++ string to lower case">
-<polygon fill="white" stroke="#666666" points="243.5,-120.25 204.25,-120.25 204.25,-101 243.5,-101 243.5,-120.25"/>
-<text text-anchor="middle" x="223.88" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">lower</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M123.11,-92.73C146.55,-96.94 172.82,-101.65 192.52,-105.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.9,-108.63 202.36,-106.95 193.13,-101.74 191.9,-108.63"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="280.25,-74.25 167.5,-74.25 167.5,-55 280.25,-55 280.25,-74.25"/>
-<text text-anchor="middle" x="223.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">poisson_x_successes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.6,-75.15C139.69,-74.22 147.97,-73.26 156.09,-72.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.37,-75.82 165.91,-71.19 155.57,-68.86 156.37,-75.82"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408,-130.25 316.25,-130.25 316.25,-111 408,-111 408,-130.25"/>
-<text text-anchor="middle" x="362.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.82,-112.02C259.56,-113.17 282.81,-114.88 304.46,-116.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.19,-119.96 314.42,-117.2 304.71,-112.97 304.19,-119.96"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387.75,-93.25 336.5,-93.25 336.5,-74 387.75,-74 387.75,-93.25"/>
-<text text-anchor="middle" x="362.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.69,-72.41C295.58,-74.48 311.28,-76.67 324.82,-78.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="324.2,-82.01 334.59,-79.93 325.17,-75.08 324.2,-82.01"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="378.38,-56.25 345.88,-56.25 345.88,-37 378.38,-37 378.38,-56.25"/>
-<text text-anchor="middle" x="362.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">fact</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.69,-57.25C299.24,-54.8 319.06,-52.18 334.38,-50.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.64,-53.65 344.09,-48.87 333.72,-46.71 334.64,-53.65"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="388.88,-19.25 335.38,-19.25 335.38,0 388.88,0 388.88,-19.25"/>
-<text text-anchor="middle" x="362.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.69,-54.55C268.06,-47.1 293.71,-36.71 316.25,-27.62 319.24,-26.42 322.35,-25.17 325.47,-23.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.58,-27.24 334.56,-20.27 323.97,-20.74 326.58,-27.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph_org.svg b/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph_org.svg
deleted file mode 100644
index cc84f5bb1..000000000
--- a/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph_org.svg
+++ /dev/null
@@ -1,129 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: poisson_range_successes Pages: 1 -->
-<svg width="416pt" height="138pt"
- viewBox="0.00 0.00 416.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>poisson_range_successes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="131.5,-92.25 0,-92.25 0,-73 131.5,-73 131.5,-92.25"/>
-<text text-anchor="middle" x="65.75" y="-78.75" font-family="Helvetica,sans-Serif" font-size="10.00">poisson_range_successes</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9" target="_top" xlink:title="function to convert a C++ string to lower case">
-<polygon fill="white" stroke="#666666" points="243.5,-120.25 204.25,-120.25 204.25,-101 243.5,-101 243.5,-120.25"/>
-<text text-anchor="middle" x="223.88" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">lower</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M123.11,-92.73C146.55,-96.94 172.82,-101.65 192.52,-105.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.9,-108.63 202.36,-106.95 193.13,-101.74 191.9,-108.63"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="280.25,-74.25 167.5,-74.25 167.5,-55 280.25,-55 280.25,-74.25"/>
-<text text-anchor="middle" x="223.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">poisson_x_successes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.6,-75.15C139.69,-74.22 147.97,-73.26 156.09,-72.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.37,-75.82 165.91,-71.19 155.57,-68.86 156.37,-75.82"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408,-130.25 316.25,-130.25 316.25,-111 408,-111 408,-130.25"/>
-<text text-anchor="middle" x="362.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.82,-112.02C259.56,-113.17 282.81,-114.88 304.46,-116.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.19,-119.96 314.42,-117.2 304.71,-112.97 304.19,-119.96"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387.75,-93.25 336.5,-93.25 336.5,-74 387.75,-74 387.75,-93.25"/>
-<text text-anchor="middle" x="362.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.69,-72.41C295.58,-74.48 311.28,-76.67 324.82,-78.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="324.2,-82.01 334.59,-79.93 325.17,-75.08 324.2,-82.01"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="378.38,-56.25 345.88,-56.25 345.88,-37 378.38,-37 378.38,-56.25"/>
-<text text-anchor="middle" x="362.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">fact</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.69,-57.25C299.24,-54.8 319.06,-52.18 334.38,-50.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.64,-53.65 344.09,-48.87 333.72,-46.71 334.64,-53.65"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="388.88,-19.25 335.38,-19.25 335.38,0 388.88,0 388.88,-19.25"/>
-<text text-anchor="middle" x="362.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.69,-54.55C268.06,-47.1 293.71,-36.71 316.25,-27.62 319.24,-26.42 322.35,-25.17 325.47,-23.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.58,-27.24 334.56,-20.27 323.97,-20.74 326.58,-27.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 7b5bd3d48..000000000
--- a/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,24 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,104,55,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="155,5,226,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="38,102,64,71,101,40,138,25,140,30,104,44,68,75,42,105"/>
-<area shape="rect" id="Node000003" href="$d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71" title=" " alt="" coords="127,55,254,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="54,105,102,89,123,83,124,88,103,94,56,110"/>
-<area shape="rect" id="Node000004" href="$d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a" title=" " alt="" coords="103,104,278,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="55,114,87,114,87,120,55,120"/>
-<area shape="rect" id="Node000007" href="$d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1" title=" " alt="" coords="326,155,476,180"/>
-<area shape="poly" id="edge11_Node000001_Node000007" title=" " alt="" coords="56,125,103,140,211,156,311,163,311,169,210,161,102,145,55,130"/>
-<area shape="rect" id="Node000011" href="$d9/d24/poisson__dist_8cpp.html#ac217ab9a06291f360d816700a6958ca8" title=" " alt="" coords="143,205,238,231"/>
-<area shape="poly" id="edge10_Node000001_Node000011" title=" " alt="" coords="44,128,70,156,104,184,129,197,127,202,101,188,66,160,40,132"/>
-<area shape="rect" id="Node000005" href="$dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9" title="function to convert a C++ string to lower case" alt="" coords="375,92,427,118"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="278,109,359,105,360,110,278,115"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="248,128,331,148,329,153,246,133"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="524,80,647,106"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="428,101,508,95,509,100,428,106"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/exp.html#" title=" " alt="" coords="551,129,620,155"/>
-<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="477,154,535,146,536,152,477,160"/>
-<area shape="rect" id="Node000009" href="$d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a" title=" " alt="" coords="564,179,607,204"/>
-<area shape="poly" id="edge8_Node000007_Node000009" title=" " alt="" coords="477,175,549,184,548,189,477,180"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="550,228,621,254"/>
-<area shape="poly" id="edge9_Node000007_Node000010" title=" " alt="" coords="437,178,525,214,538,219,536,224,523,219,435,183"/>
-</map>
diff --git a/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index fb96ed9b4..000000000
--- a/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b5f8315d961b5d6ae325c91772d274fb
\ No newline at end of file
diff --git a/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 37d620f3b..000000000
--- a/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,236 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="489pt" height="194pt"
- viewBox="0.00 0.00 489.00 194.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 190.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-112.25 0,-112.25 0,-93 37,-93 37,-112.25"/>
-<text text-anchor="middle" x="18.5" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.5,-186.25 112,-186.25 112,-167 165.5,-167 165.5,-186.25"/>
-<text text-anchor="middle" x="138.75" y="-172.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.27,-112.48C35.43,-125.05 52.93,-146.6 73,-158.62 81.33,-163.61 91.08,-167.26 100.45,-169.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.55,-173.29 110.1,-172.31 101.24,-166.5 99.55,-173.29"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="186.12,-149.25 91.38,-149.25 91.38,-130 186.12,-130 186.12,-149.25"/>
-<text text-anchor="middle" x="138.75" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">poisson_expected</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-109.27C47.6,-113.07 60.97,-117.82 73,-121.62 78.09,-123.23 83.42,-124.84 88.75,-126.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.58,-129.7 98.16,-129.09 89.51,-122.97 87.58,-129.7"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.5,-112.25 73,-112.25 73,-93 204.5,-93 204.5,-112.25"/>
-<text text-anchor="middle" x="138.75" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">poisson_range_successes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.46,-102.62C44.23,-102.62 52.43,-102.62 61.19,-102.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61,-106.13 71,-102.63 61,-99.13 61,-106.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="353.25,-74.25 240.5,-74.25 240.5,-55 353.25,-55 353.25,-74.25"/>
-<text text-anchor="middle" x="296.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">poisson_x_successes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge11_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge11_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.49,-94.93C47.71,-90.9 60.86,-86.25 73,-83.62 124.68,-72.44 184.42,-67.78 229.04,-65.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.97,-69.37 238.82,-65.48 228.7,-62.38 228.97,-69.37"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d9/d24/poisson__dist_8cpp.html#ac217ab9a06291f360d816700a6958ca8" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="174.5,-36.25 103,-36.25 103,-17 174.5,-17 174.5,-36.25"/>
-<text text-anchor="middle" x="138.75" y="-22.75" font-family="Helvetica,sans-Serif" font-size="10.00">poisson_rate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.6,-92.53C37.31,-81.01 54.6,-62.24 73,-50.62 78.92,-46.89 85.51,-43.61 92.16,-40.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.13,-44.15 101.15,-37.22 90.56,-37.63 93.13,-44.15"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9" target="_top" xlink:title="function to convert a C++ string to lower case">
-<polygon fill="white" stroke="#666666" points="316.5,-121.25 277.25,-121.25 277.25,-102 316.5,-102 316.5,-121.25"/>
-<text text-anchor="middle" x="296.88" y="-107.75" font-family="Helvetica,sans-Serif" font-size="10.00">lower</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.6,-106.36C225.74,-107.58 248.21,-108.88 265.56,-109.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.24,-113.37 275.43,-110.45 265.65,-106.38 265.24,-113.37"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M181.18,-92.54C200.31,-87.88 223.24,-82.3 243.55,-77.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.16,-80.81 253.05,-75.05 242.51,-74.01 244.16,-80.81"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="481,-130.25 389.25,-130.25 389.25,-111 481,-111 481,-130.25"/>
-<text text-anchor="middle" x="435.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M316.82,-112.88C332.56,-113.92 355.81,-115.45 377.46,-116.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="377.21,-120.37 387.42,-117.54 377.68,-113.39 377.21,-120.37"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="460.75,-93.25 409.5,-93.25 409.5,-74 460.75,-74 460.75,-93.25"/>
-<text text-anchor="middle" x="435.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M353.69,-72.41C368.58,-74.48 384.28,-76.67 397.82,-78.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="397.2,-82.01 407.59,-79.93 398.17,-75.08 397.2,-82.01"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="451.38,-56.25 418.88,-56.25 418.88,-37 451.38,-37 451.38,-56.25"/>
-<text text-anchor="middle" x="435.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">fact</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M353.69,-57.25C372.24,-54.8 392.06,-52.18 407.38,-50.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="407.64,-53.65 417.09,-48.87 406.72,-46.71 407.64,-53.65"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="461.88,-19.25 408.38,-19.25 408.38,0 461.88,0 461.88,-19.25"/>
-<text text-anchor="middle" x="435.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node10 -->
-<g id="edge9_Node000007_Node000010" class="edge">
-<title>Node7&#45;&gt;Node10</title>
-<g id="a_edge9_Node000007_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M322.69,-54.55C341.06,-47.1 366.71,-36.71 389.25,-27.62 392.24,-26.42 395.35,-25.17 398.47,-23.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.58,-27.24 407.56,-20.27 396.97,-20.74 399.58,-27.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 32e27ba03..000000000
--- a/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,210 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="489pt" height="194pt"
- viewBox="0.00 0.00 489.00 194.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 190.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-112.25 0,-112.25 0,-93 37,-93 37,-112.25"/>
-<text text-anchor="middle" x="18.5" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.5,-186.25 112,-186.25 112,-167 165.5,-167 165.5,-186.25"/>
-<text text-anchor="middle" x="138.75" y="-172.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.27,-112.48C35.43,-125.05 52.93,-146.6 73,-158.62 81.33,-163.61 91.08,-167.26 100.45,-169.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.55,-173.29 110.1,-172.31 101.24,-166.5 99.55,-173.29"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="186.12,-149.25 91.38,-149.25 91.38,-130 186.12,-130 186.12,-149.25"/>
-<text text-anchor="middle" x="138.75" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">poisson_expected</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-109.27C47.6,-113.07 60.97,-117.82 73,-121.62 78.09,-123.23 83.42,-124.84 88.75,-126.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.58,-129.7 98.16,-129.09 89.51,-122.97 87.58,-129.7"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.5,-112.25 73,-112.25 73,-93 204.5,-93 204.5,-112.25"/>
-<text text-anchor="middle" x="138.75" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">poisson_range_successes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.46,-102.62C44.23,-102.62 52.43,-102.62 61.19,-102.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61,-106.13 71,-102.63 61,-99.13 61,-106.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="353.25,-74.25 240.5,-74.25 240.5,-55 353.25,-55 353.25,-74.25"/>
-<text text-anchor="middle" x="296.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">poisson_x_successes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge11_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge11_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.49,-94.93C47.71,-90.9 60.86,-86.25 73,-83.62 124.68,-72.44 184.42,-67.78 229.04,-65.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.97,-69.37 238.82,-65.48 228.7,-62.38 228.97,-69.37"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d9/d24/poisson__dist_8cpp.html#ac217ab9a06291f360d816700a6958ca8" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="174.5,-36.25 103,-36.25 103,-17 174.5,-17 174.5,-36.25"/>
-<text text-anchor="middle" x="138.75" y="-22.75" font-family="Helvetica,sans-Serif" font-size="10.00">poisson_rate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.6,-92.53C37.31,-81.01 54.6,-62.24 73,-50.62 78.92,-46.89 85.51,-43.61 92.16,-40.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.13,-44.15 101.15,-37.22 90.56,-37.63 93.13,-44.15"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9" target="_top" xlink:title="function to convert a C++ string to lower case">
-<polygon fill="white" stroke="#666666" points="316.5,-121.25 277.25,-121.25 277.25,-102 316.5,-102 316.5,-121.25"/>
-<text text-anchor="middle" x="296.88" y="-107.75" font-family="Helvetica,sans-Serif" font-size="10.00">lower</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.6,-106.36C225.74,-107.58 248.21,-108.88 265.56,-109.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.24,-113.37 275.43,-110.45 265.65,-106.38 265.24,-113.37"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M181.18,-92.54C200.31,-87.88 223.24,-82.3 243.55,-77.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.16,-80.81 253.05,-75.05 242.51,-74.01 244.16,-80.81"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="481,-130.25 389.25,-130.25 389.25,-111 481,-111 481,-130.25"/>
-<text text-anchor="middle" x="435.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M316.82,-112.88C332.56,-113.92 355.81,-115.45 377.46,-116.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="377.21,-120.37 387.42,-117.54 377.68,-113.39 377.21,-120.37"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="460.75,-93.25 409.5,-93.25 409.5,-74 460.75,-74 460.75,-93.25"/>
-<text text-anchor="middle" x="435.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M353.69,-72.41C368.58,-74.48 384.28,-76.67 397.82,-78.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="397.2,-82.01 407.59,-79.93 398.17,-75.08 397.2,-82.01"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="451.38,-56.25 418.88,-56.25 418.88,-37 451.38,-37 451.38,-56.25"/>
-<text text-anchor="middle" x="435.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">fact</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M353.69,-57.25C372.24,-54.8 392.06,-52.18 407.38,-50.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="407.64,-53.65 417.09,-48.87 406.72,-46.71 407.64,-53.65"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="461.88,-19.25 408.38,-19.25 408.38,0 461.88,0 461.88,-19.25"/>
-<text text-anchor="middle" x="435.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node10 -->
-<g id="edge9_Node000007_Node000010" class="edge">
-<title>Node7&#45;&gt;Node10</title>
-<g id="a_edge9_Node000007_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M322.69,-54.55C341.06,-47.1 366.71,-36.71 389.25,-27.62 392.24,-26.42 395.35,-25.17 398.47,-23.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.58,-27.24 407.56,-20.27 396.97,-20.74 399.58,-27.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d24/poisson__dist_8cpp_source.html b/d9/d24/poisson__dist_8cpp_source.html
new file mode 100644
index 000000000..0b56b30d3
--- /dev/null
+++ b/d9/d24/poisson__dist_8cpp_source.html
@@ -0,0 +1,204 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: probability/poisson_dist.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d24/poisson__dist_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">poisson_dist.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/d24/poisson__dist_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="foldopen" id="foldopen00017" data-start="{" data-end="}">
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"><a class="line" href="../../d9/d24/poisson__dist_8cpp.html#ac217ab9a06291f360d816700a6958ca8">   17</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d9/d24/poisson__dist_8cpp.html#ac217ab9a06291f360d816700a6958ca8">poisson_rate</a>(<span class="keywordtype">double</span> events, <span class="keywordtype">double</span> timeframe) {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="keywordflow">return</span> events / timeframe;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>}</div>
+</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"><a class="line" href="../../d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71">   25</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71">poisson_expected</a>(<span class="keywordtype">double</span> rate, <span class="keywordtype">double</span> time) { <span class="keywordflow">return</span> rate * time; }</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="foldopen" id="foldopen00030" data-start="{" data-end="}">
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"><a class="line" href="../../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a">   30</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a">fact</a>(<span class="keywordtype">double</span> x) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordtype">double</span> x_fact = x;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = x - 1; i &gt; 0; i--) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        x_fact *= i;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    }</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">if</span> (x_fact &lt;= 0) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        x_fact = 1;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    }</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordflow">return</span> x_fact;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>}</div>
+</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="foldopen" id="foldopen00046" data-start="{" data-end="}">
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"><a class="line" href="../../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1">   46</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1">poisson_x_successes</a>(<span class="keywordtype">double</span> expected, <span class="keywordtype">double</span> x) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">return</span> (std::pow(expected, x) * std::exp(-expected)) / <a class="code hl_function" href="../../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a">fact</a>(x);</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>}</div>
+</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="foldopen" id="foldopen00054" data-start="{" data-end="}">
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="../../d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a">   54</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a">poisson_range_successes</a>(<span class="keywordtype">double</span> expected, <span class="keywordtype">double</span> <a class="code hl_function" href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9">lower</a>, <span class="keywordtype">double</span> upper) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordtype">double</span> <a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a> = 0;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = <a class="code hl_function" href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9">lower</a>; i &lt;= upper; i++) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        <a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a> += <a class="code hl_function" href="../../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1">poisson_x_successes</a>(expected, i);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a>;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>}</div>
+</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="foldopen" id="foldopen00065" data-start="{" data-end="}">
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="../../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   65</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordtype">double</span> rate, expected;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    rate = <a class="code hl_function" href="../../d9/d24/poisson__dist_8cpp.html#ac217ab9a06291f360d816700a6958ca8">poisson_rate</a>(3, 1);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Poisson rate : &quot;</span> &lt;&lt; rate &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    expected = <a class="code hl_function" href="../../d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71">poisson_expected</a>(rate, 2);</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Poisson expected : &quot;</span> &lt;&lt; expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Poisson 0 successes : &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1">poisson_x_successes</a>(expected, 0)</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Poisson 0-8 successes : &quot;</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>              &lt;&lt; <a class="code hl_function" href="../../d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a">poisson_range_successes</a>(expected, 0, 8) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>}</div>
+</div>
+<div class="ttc" id="anamespaceprobability_html"><div class="ttname"><a href="../../d4/ded/namespaceprobability.html">probability</a></div><div class="ttdoc">Probability algorithms.</div></div>
+<div class="ttc" id="apoisson__dist_8cpp_html_a63ffd347e75d5ed7a518cbcfbfeec71a"><div class="ttname"><a href="../../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a">fact</a></div><div class="ttdeci">double fact(double x)</div><div class="ttdef"><b>Definition</b> <a href="#l00030">poisson_dist.cpp:30</a></div></div>
+<div class="ttc" id="apoisson__dist_8cpp_html_a69a136b32707bdc7950fb9057b5fa1e1"><div class="ttname"><a href="../../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1">poisson_x_successes</a></div><div class="ttdeci">double poisson_x_successes(double expected, double x)</div><div class="ttdef"><b>Definition</b> <a href="#l00046">poisson_dist.cpp:46</a></div></div>
+<div class="ttc" id="apoisson__dist_8cpp_html_ac217ab9a06291f360d816700a6958ca8"><div class="ttname"><a href="../../d9/d24/poisson__dist_8cpp.html#ac217ab9a06291f360d816700a6958ca8">poisson_rate</a></div><div class="ttdeci">double poisson_rate(double events, double timeframe)</div><div class="ttdef"><b>Definition</b> <a href="#l00017">poisson_dist.cpp:17</a></div></div>
+<div class="ttc" id="apoisson__dist_8cpp_html_ad0aa718023ce802dd5899f0e03a7ac71"><div class="ttname"><a href="../../d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71">poisson_expected</a></div><div class="ttdeci">double poisson_expected(double rate, double time)</div><div class="ttdef"><b>Definition</b> <a href="#l00025">poisson_dist.cpp:25</a></div></div>
+<div class="ttc" id="apoisson__dist_8cpp_html_ad9c9e74079278ca10e3b97a8d5391c9a"><div class="ttname"><a href="../../d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a">poisson_range_successes</a></div><div class="ttdeci">double poisson_range_successes(double expected, double lower, double upper)</div><div class="ttdef"><b>Definition</b> <a href="#l00054">poisson_dist.cpp:54</a></div></div>
+<div class="ttc" id="apoisson__dist_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00065">poisson_dist.cpp:65</a></div></div>
+<div class="ttc" id="atext__search_8cpp_html_a3f8975d227cd0e58f298b380c5dac0d9"><div class="ttname"><a href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9">lower</a></div><div class="ttdeci">std::string lower(std::string word)</div><div class="ttdoc">function to convert a C++ string to lower case</div><div class="ttdef"><b>Definition</b> <a href="../../dc/db5/text__search_8cpp_source.html#l00019">text_search.cpp:19</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_82e494173a87936756866de2fa774307.html">probability</a></li><li class="navelem"><a class="el" href="../../d9/d24/poisson__dist_8cpp.html">poisson_dist.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/d27/namespacelist__array.html b/d9/d27/namespacelist__array.html
index 098e9495e..cf2a6a09c 100644
--- a/d9/d27/namespacelist__array.html
+++ b/d9/d27/namespacelist__array.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: list_array Namespace Reference</title>
+<title>TheAlgorithms/C++: list_array Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp.html b/d9/d29/ground__to__ground__projectile__motion_8cpp.html
index 39fc3945b..d49f19d26 100644
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp.html
+++ b/d9/d29/ground__to__ground__projectile__motion_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: physics/ground_to_ground_projectile_motion.cpp File Reference</title>
+<title>TheAlgorithms/C++: physics/ground_to_ground_projectile_motion.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for ground_to_ground_projectile_motion.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dd3/ground__to__ground__projectile__motion_8cpp__incl.svg" width="252" height="126"><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">
+</div>
+<p><a href="../../d9/d29/ground__to__ground__projectile__motion_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dd0/namespacephysics.html">physics</a></td></tr>
@@ -134,9 +153,8 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="define-members" name="define-members"></a>
 Macros</h2></td></tr>
-<tr class="memitem:a525335710b53cb064ca56b936120431e" id="r_a525335710b53cb064ca56b936120431e"><td class="memItemLeft" align="right" valign="top"><a id="a525335710b53cb064ca56b936120431e" name="a525335710b53cb064ca56b936120431e"></a>
-#define&#160;</td><td class="memItemRight" valign="bottom"><b>_USE_MATH_DEFINES</b></td></tr>
-<tr class="memdesc:a525335710b53cb064ca56b936120431e"><td class="mdescLeft">&#160;</td><td class="mdescRight">for assert() <br /></td></tr>
+<tr class="memitem:a525335710b53cb064ca56b936120431e" id="r_a525335710b53cb064ca56b936120431e"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a525335710b53cb064ca56b936120431e">_USE_MATH_DEFINES</a></td></tr>
+<tr class="memdesc:a525335710b53cb064ca56b936120431e"><td class="mdescLeft">&#160;</td><td class="mdescRight">for assert()  <br /></td></tr>
 <tr class="separator:a525335710b53cb064ca56b936120431e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
@@ -167,7 +185,28 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Ground to ground <a href="https://en.wikipedia.org/wiki/Projectile_motion" target="_blank">projectile motion</a> equation implementations. </p>
 <p>Ground to ground projectile motion is when a projectile's trajectory starts at the ground, reaches the apex, then falls back on the ground.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Focusucof" target="_blank">Focusucof</a> </dd></dl>
-</div><h2 class="groupheader">Function Documentation</h2>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp_source.html">ground_to_ground_projectile_motion.cpp</a>.</p>
+</div><h2 class="groupheader">Macro Definition Documentation</h2>
+<a id="a525335710b53cb064ca56b936120431e" name="a525335710b53cb064ca56b936120431e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a525335710b53cb064ca56b936120431e">&#9670;&#160;</a></span>_USE_MATH_DEFINES</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">#define _USE_MATH_DEFINES</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>for assert() </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp_source.html#l00013">13</a> of file <a class="el" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp_source.html">ground_to_ground_projectile_motion.cpp</a>.</p>
+
+</div>
+</div>
+<h2 class="groupheader">Function Documentation</h2>
 <a id="ab00e9785fb2670f7af99d6f3d636f87c" name="ab00e9785fb2670f7af99d6f3d636f87c"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ab00e9785fb2670f7af99d6f3d636f87c">&#9670;&#160;</a></span>degrees_to_radians()</h2>
 
@@ -191,16 +230,13 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Angle in degrees </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp_source.html">ground_to_ground_projectile_motion.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   34</span>                                         {</div>
 <div class="line"><span class="lineno">   35</span>    <span class="keywordtype">double</span> radians = degrees * (M_PI / 180);</div>
 <div class="line"><span class="lineno">   36</span>    <span class="keywordflow">return</span> radians;</div>
 <div class="line"><span class="lineno">   37</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d29/ground__to__ground__projectile__motion_8cpp_ab00e9785fb2670f7af99d6f3d636f87c_cgraph.svg" width="183" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a10362eb607d7882bac3a0688504b00ff" name="a10362eb607d7882bac3a0688504b00ff"></a>
@@ -238,19 +274,14 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Horizontal distance that the projectile travels </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   59</span>                                                        {</div>
-<div class="line"><span class="lineno">   60</span>    <span class="keywordtype">double</span> Vix = initial_velocity * (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a>(<a class="code hl_function" href="#ab00e9785fb2670f7af99d6f3d636f87c">degrees_to_radians</a>(angle))); <span class="comment">// calculate x component of the initial velocity</span></div>
-<div class="line"><span class="lineno">   61</span>    <span class="keywordflow">return</span> Vix * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">time</a>;</div>
-<div class="line"><span class="lineno">   62</span>}</div>
-<div class="ttc" id="acos_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a></div><div class="ttdeci">T cos(T... args)</div></div>
-<div class="ttc" id="aground__to__ground__projectile__motion_8cpp_html_ab00e9785fb2670f7af99d6f3d636f87c"><div class="ttname"><a href="#ab00e9785fb2670f7af99d6f3d636f87c">physics::ground_to_ground_projectile_motion::degrees_to_radians</a></div><div class="ttdeci">double degrees_to_radians(double degrees)</div><div class="ttdoc">Convert radians to degrees.</div><div class="ttdef"><b>Definition</b> ground_to_ground_projectile_motion.cpp:34</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d29/ground__to__ground__projectile__motion_8cpp_a10362eb607d7882bac3a0688504b00ff_cgraph.svg" width="404" height="142"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp_source.html">ground_to_ground_projectile_motion.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   59</span>                                                        {</div>
+<div class="line"><span class="lineno">   60</span>    <span class="keywordtype">double</span> Vix = initial_velocity * (std::cos(<a class="code hl_function" href="#ab00e9785fb2670f7af99d6f3d636f87c">degrees_to_radians</a>(angle))); <span class="comment">// calculate x component of the initial velocity</span></div>
+<div class="line"><span class="lineno">   61</span>    <span class="keywordflow">return</span> Vix * time;</div>
+<div class="line"><span class="lineno">   62</span>}</div>
+<div class="ttc" id="aground__to__ground__projectile__motion_8cpp_html_ab00e9785fb2670f7af99d6f3d636f87c"><div class="ttname"><a href="#ab00e9785fb2670f7af99d6f3d636f87c">physics::ground_to_ground_projectile_motion::degrees_to_radians</a></div><div class="ttdeci">double degrees_to_radians(double degrees)</div><div class="ttdoc">Convert radians to degrees.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d29/ground__to__ground__projectile__motion_8cpp_source.html#l00034">ground_to_ground_projectile_motion.cpp:34</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -270,17 +301,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp_source.html#l00138">138</a> of file <a class="el" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp_source.html">ground_to_ground_projectile_motion.cpp</a>.</p>
 <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="#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="aground__to__ground__projectile__motion_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> ground_to_ground_projectile_motion.cpp:83</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d29/ground__to__ground__projectile__motion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="279" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aground__to__ground__projectile__motion_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d29/ground__to__ground__projectile__motion_8cpp_source.html#l00083">ground_to_ground_projectile_motion.cpp:83</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa554429def63077ab7a550c0affbfefa" name="aa554429def63077ab7a550c0affbfefa"></a>
@@ -319,18 +347,13 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The max height that the projectile reaches </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">double</span> Viy = initial_velocity * (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a>(<a class="code hl_function" href="#ab00e9785fb2670f7af99d6f3d636f87c">degrees_to_radians</a>(angle))); <span class="comment">// calculate y component of the initial velocity</span></div>
-<div class="line"><span class="lineno">   74</span>    <span class="keywordflow">return</span> (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(Viy, 2) / (2.0 * gravity));</div>
-<div class="line"><span class="lineno">   75</span>}</div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-<div class="ttc" id="asin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a></div><div class="ttdeci">T sin(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d29/ground__to__ground__projectile__motion_8cpp_aa554429def63077ab7a550c0affbfefa_cgraph.svg" width="404" height="191"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp_source.html#l00072">72</a> of file <a class="el" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp_source.html">ground_to_ground_projectile_motion.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   72</span>                                                                 {</div>
+<div class="line"><span class="lineno">   73</span>    <span class="keywordtype">double</span> Viy = initial_velocity * (std::sin(<a class="code hl_function" href="#ab00e9785fb2670f7af99d6f3d636f87c">degrees_to_radians</a>(angle))); <span class="comment">// calculate y component of the initial velocity</span></div>
+<div class="line"><span class="lineno">   74</span>    <span class="keywordflow">return</span> (std::pow(Viy, 2) / (2.0 * gravity));</div>
+<div class="line"><span class="lineno">   75</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -358,6 +381,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp_source.html#l00083">83</a> of file <a class="el" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp_source.html">ground_to_ground_projectile_motion.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   83</span>                   {</div>
 <div class="line"><span class="lineno">   84</span>    <span class="comment">// initial input variables</span></div>
 <div class="line"><span class="lineno">   85</span>    <span class="keywordtype">double</span> initial_velocity = 5.0;  <span class="comment">// double initial_velocity input</span></div>
@@ -366,57 +391,49 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   88</span>    <span class="comment">// 1st test</span></div>
 <div class="line"><span class="lineno">   89</span>    <span class="keywordtype">double</span> expected_time_of_flight = 0.655;  <span class="comment">// expected time output</span></div>
 <div class="line"><span class="lineno">   90</span>    <span class="keywordtype">double</span> flight_time_output =</div>
-<div class="line"><span class="lineno">   91</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(physics::ground_to_ground_projectile_motion::time_of_flight(initial_velocity, angle) * 1000.0) /</div>
+<div class="line"><span class="lineno">   91</span>        std::round(physics::ground_to_ground_projectile_motion::time_of_flight(initial_velocity, angle) * 1000.0) /</div>
 <div class="line"><span class="lineno">   92</span>        1000.0;  <span class="comment">// round output to 3 decimal places</span></div>
 <div class="line"><span class="lineno">   93</span> </div>
-<div class="line"><span class="lineno">   94</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Projectile Flight Time (double)&quot;</span> &lt;&lt; <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">   95</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Initial Velocity: &quot;</span> &lt;&lt; initial_velocity &lt;&lt; <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">   96</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Angle: &quot;</span> &lt;&lt; angle &lt;&lt; <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">   97</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; expected_time_of_flight &lt;&lt; <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">   98</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; flight_time_output &lt;&lt; <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">   94</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Projectile Flight Time (double)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   95</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Initial Velocity: &quot;</span> &lt;&lt; initial_velocity &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   96</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Angle: &quot;</span> &lt;&lt; angle &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   97</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; expected_time_of_flight &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   98</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; flight_time_output &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   99</span>    assert(flight_time_output == expected_time_of_flight);</div>
-<div class="line"><span class="lineno">  100</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  100</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  101</span> </div>
 <div class="line"><span class="lineno">  102</span>    <span class="comment">// 2nd test</span></div>
 <div class="line"><span class="lineno">  103</span>    <span class="keywordtype">double</span> expected_horizontal_range = 2.51; <span class="comment">// expected range output</span></div>
 <div class="line"><span class="lineno">  104</span>    <span class="keywordtype">double</span> horizontal_range_output =</div>
-<div class="line"><span class="lineno">  105</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(physics::ground_to_ground_projectile_motion::horizontal_range(initial_velocity, angle,</div>
+<div class="line"><span class="lineno">  105</span>        std::round(physics::ground_to_ground_projectile_motion::horizontal_range(initial_velocity, angle,</div>
 <div class="line"><span class="lineno">  106</span>                                             flight_time_output) *</div>
 <div class="line"><span class="lineno">  107</span>                   100.0) /</div>
 <div class="line"><span class="lineno">  108</span>        100.0;  <span class="comment">// round output to 2 decimal places</span></div>
 <div class="line"><span class="lineno">  109</span> </div>
-<div class="line"><span class="lineno">  110</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Projectile Horizontal Range (double)&quot;</span> &lt;&lt; <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">  111</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Initial Velocity: &quot;</span> &lt;&lt; initial_velocity &lt;&lt; <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">  112</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Angle: &quot;</span> &lt;&lt; angle &lt;&lt; <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">  113</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Time Of Flight: &quot;</span> &lt;&lt; flight_time_output &lt;&lt; <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">  114</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; expected_horizontal_range &lt;&lt; <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">  115</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; horizontal_range_output &lt;&lt; <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">  110</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Projectile Horizontal Range (double)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Initial Velocity: &quot;</span> &lt;&lt; initial_velocity &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  112</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Angle: &quot;</span> &lt;&lt; angle &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Time Of Flight: &quot;</span> &lt;&lt; flight_time_output &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; expected_horizontal_range &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  115</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; horizontal_range_output &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  116</span>    assert(horizontal_range_output == expected_horizontal_range);</div>
-<div class="line"><span class="lineno">  117</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  117</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  118</span> </div>
 <div class="line"><span class="lineno">  119</span>    <span class="comment">// 3rd test</span></div>
 <div class="line"><span class="lineno">  120</span>    <span class="keywordtype">double</span> expected_max_height = 0.526; <span class="comment">// expected height output</span></div>
 <div class="line"><span class="lineno">  121</span>    <span class="keywordtype">double</span> max_height_output =</div>
-<div class="line"><span class="lineno">  122</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(physics::ground_to_ground_projectile_motion::max_height(initial_velocity, angle) * 1000.0) /</div>
+<div class="line"><span class="lineno">  122</span>        std::round(physics::ground_to_ground_projectile_motion::max_height(initial_velocity, angle) * 1000.0) /</div>
 <div class="line"><span class="lineno">  123</span>        1000.0;  <span class="comment">// round output to 3 decimal places</span></div>
 <div class="line"><span class="lineno">  124</span> </div>
-<div class="line"><span class="lineno">  125</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Projectile Max Height (double)&quot;</span> &lt;&lt; <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">  126</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Initial Velocity: &quot;</span> &lt;&lt; initial_velocity &lt;&lt; <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">  127</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Angle: &quot;</span> &lt;&lt; angle &lt;&lt; <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">  128</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; expected_max_height &lt;&lt; <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">  129</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; max_height_output &lt;&lt; <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">  125</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Projectile Max Height (double)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  126</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Initial Velocity: &quot;</span> &lt;&lt; initial_velocity &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  127</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Angle: &quot;</span> &lt;&lt; angle &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  128</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; expected_max_height &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  129</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; max_height_output &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  130</span>    assert(max_height_output == expected_max_height);</div>
-<div class="line"><span class="lineno">  131</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  131</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</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="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="around_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a></div><div class="ttdeci">T round(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d29/ground__to__ground__projectile__motion_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="182" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a563e066975fed1b84750a0a47c3cbb37" name="a563e066975fed1b84750a0a47c3cbb37"></a>
@@ -455,16 +472,13 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The time that the projectile is in the air for </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp_source.html">ground_to_ground_projectile_motion.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   47</span>                                                                     {</div>
-<div class="line"><span class="lineno">   48</span>    <span class="keywordtype">double</span> Viy = initial_velocity * (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a>(<a class="code hl_function" href="#ab00e9785fb2670f7af99d6f3d636f87c">degrees_to_radians</a>(angle))); <span class="comment">// calculate y component of the initial velocity</span></div>
+<div class="line"><span class="lineno">   48</span>    <span class="keywordtype">double</span> Viy = initial_velocity * (std::sin(<a class="code hl_function" href="#ab00e9785fb2670f7af99d6f3d636f87c">degrees_to_radians</a>(angle))); <span class="comment">// calculate y component of the initial velocity</span></div>
 <div class="line"><span class="lineno">   49</span>    <span class="keywordflow">return</span> 2.0 * Viy / gravity;</div>
 <div class="line"><span class="lineno">   50</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d29/ground__to__ground__projectile__motion_8cpp_a563e066975fed1b84750a0a47c3cbb37_cgraph.svg" width="404" height="142"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_a10362eb607d7882bac3a0688504b00ff_cgraph.map b/d9/d29/ground__to__ground__projectile__motion_8cpp_a10362eb607d7882bac3a0688504b00ff_cgraph.map
deleted file mode 100644
index 2deeb0288..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_a10362eb607d7882bac3a0688504b00ff_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="physics::ground_to_ground_projectile_motion::horizontal_range" name="physics::ground_to_ground_projectile_motion::horizontal_range">
-<area shape="rect" id="Node000001" title="Calculate the horizontal distance that the projectile travels." alt="" coords="5,36,178,91"/>
-<area shape="poly" id="edge4_Node000001_Node000001" title=" " alt="" coords="48,35,49,25,57,17,71,11,92,9,115,12,129,18,127,23,113,17,91,14,72,16,60,21,54,27,53,35"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/cos.html#" title=" " alt="" coords="278,5,346,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="178,43,262,26,263,31,179,48"/>
-<area shape="rect" id="Node000003" href="$d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c" title="Convert radians to degrees." alt="" coords="226,80,398,135"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="179,78,211,85,210,90,178,83"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="269,79,269,69,277,61,291,55,312,53,335,56,349,62,347,67,334,61,312,58,292,60,280,65,274,71,274,79"/>
-</map>
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_a10362eb607d7882bac3a0688504b00ff_cgraph.md5 b/d9/d29/ground__to__ground__projectile__motion_8cpp_a10362eb607d7882bac3a0688504b00ff_cgraph.md5
deleted file mode 100644
index 6f4cae0d7..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_a10362eb607d7882bac3a0688504b00ff_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ae33f4067df13366800a3609d085f4c6
\ No newline at end of file
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_a10362eb607d7882bac3a0688504b00ff_cgraph.svg b/d9/d29/ground__to__ground__projectile__motion_8cpp_a10362eb607d7882bac3a0688504b00ff_cgraph.svg
deleted file mode 100644
index 18d049543..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_a10362eb607d7882bac3a0688504b00ff_cgraph.svg
+++ /dev/null
@@ -1,105 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: physics::ground_to_ground_projectile_motion::horizontal_range Pages: 1 -->
-<svg width="303pt" height="106pt"
- viewBox="0.00 0.00 302.50 105.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 101.5)">
-<title>physics::ground_to_ground_projectile_motion::horizontal_range</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Calculate the horizontal distance that the projectile travels.">
-<polygon fill="#999999" stroke="#666666" points="129.25,-74.75 0,-74.75 0,-33 129.25,-33 129.25,-74.75"/>
-<text text-anchor="start" x="8" y="-61.25" font-family="Helvetica,sans-Serif" font-size="10.00">physics::ground_to</text>
-<text text-anchor="start" x="8" y="-50" font-family="Helvetica,sans-Serif" font-size="10.00">_ground_projectile_motion</text>
-<text text-anchor="middle" x="64.62" y="-38.75" font-family="Helvetica,sans-Serif" font-size="10.00">::horizontal_range</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.12,-75.07C31.22,-84.55 41.39,-92.75 64.62,-92.75 78.06,-92.75 87.13,-90.01 91.82,-85.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.1,-87.1 94.68,-76.52 88.41,-85.05 95.1,-87.1"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-97.5 204.25,-97.5 204.25,-78.25 255.5,-78.25 255.5,-97.5"/>
-<text text-anchor="middle" x="229.88" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.68,-67.22C151.18,-71.69 174.38,-76.53 192.94,-80.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.13,-83.8 202.64,-82.41 193.56,-76.94 192.13,-83.8"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c" target="_top" xlink:title="Convert radians to degrees.">
-<polygon fill="white" stroke="#666666" points="294.5,-41.75 165.25,-41.75 165.25,0 294.5,0 294.5,-41.75"/>
-<text text-anchor="start" x="173.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">physics::ground_to</text>
-<text text-anchor="start" x="173.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_ground_projectile_motion</text>
-<text text-anchor="middle" x="229.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::degrees_to_radians</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.68,-40.93C137.57,-39.33 145.69,-37.69 153.73,-36.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.42,-39.5 163.52,-34.09 153.03,-32.64 154.42,-39.5"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.37,-42.07C196.47,-51.55 206.64,-59.75 229.88,-59.75 243.31,-59.75 252.38,-57.01 257.07,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.35,-54.1 259.93,-43.52 253.66,-52.05 260.35,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_a10362eb607d7882bac3a0688504b00ff_cgraph_org.svg b/d9/d29/ground__to__ground__projectile__motion_8cpp_a10362eb607d7882bac3a0688504b00ff_cgraph_org.svg
deleted file mode 100644
index b47092057..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_a10362eb607d7882bac3a0688504b00ff_cgraph_org.svg
+++ /dev/null
@@ -1,79 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: physics::ground_to_ground_projectile_motion::horizontal_range Pages: 1 -->
-<svg width="303pt" height="106pt"
- viewBox="0.00 0.00 302.50 105.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 101.5)">
-<title>physics::ground_to_ground_projectile_motion::horizontal_range</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Calculate the horizontal distance that the projectile travels.">
-<polygon fill="#999999" stroke="#666666" points="129.25,-74.75 0,-74.75 0,-33 129.25,-33 129.25,-74.75"/>
-<text text-anchor="start" x="8" y="-61.25" font-family="Helvetica,sans-Serif" font-size="10.00">physics::ground_to</text>
-<text text-anchor="start" x="8" y="-50" font-family="Helvetica,sans-Serif" font-size="10.00">_ground_projectile_motion</text>
-<text text-anchor="middle" x="64.62" y="-38.75" font-family="Helvetica,sans-Serif" font-size="10.00">::horizontal_range</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.12,-75.07C31.22,-84.55 41.39,-92.75 64.62,-92.75 78.06,-92.75 87.13,-90.01 91.82,-85.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.1,-87.1 94.68,-76.52 88.41,-85.05 95.1,-87.1"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-97.5 204.25,-97.5 204.25,-78.25 255.5,-78.25 255.5,-97.5"/>
-<text text-anchor="middle" x="229.88" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.68,-67.22C151.18,-71.69 174.38,-76.53 192.94,-80.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.13,-83.8 202.64,-82.41 193.56,-76.94 192.13,-83.8"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c" target="_top" xlink:title="Convert radians to degrees.">
-<polygon fill="white" stroke="#666666" points="294.5,-41.75 165.25,-41.75 165.25,0 294.5,0 294.5,-41.75"/>
-<text text-anchor="start" x="173.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">physics::ground_to</text>
-<text text-anchor="start" x="173.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_ground_projectile_motion</text>
-<text text-anchor="middle" x="229.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::degrees_to_radians</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.68,-40.93C137.57,-39.33 145.69,-37.69 153.73,-36.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.42,-39.5 163.52,-34.09 153.03,-32.64 154.42,-39.5"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.37,-42.07C196.47,-51.55 206.64,-59.75 229.88,-59.75 243.31,-59.75 252.38,-57.01 257.07,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.35,-54.1 259.93,-43.52 253.66,-52.05 260.35,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_a563e066975fed1b84750a0a47c3cbb37_cgraph.map b/d9/d29/ground__to__ground__projectile__motion_8cpp_a563e066975fed1b84750a0a47c3cbb37_cgraph.map
deleted file mode 100644
index b1c89fb37..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_a563e066975fed1b84750a0a47c3cbb37_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="physics::ground_to_ground_projectile_motion::time_of_flight" name="physics::ground_to_ground_projectile_motion::time_of_flight">
-<area shape="rect" id="Node000001" title="Calculate the time of flight." alt="" coords="5,63,178,118"/>
-<area shape="poly" id="edge4_Node000001_Node000001" title=" " alt="" coords="48,62,49,52,57,44,71,38,92,36,115,39,129,45,127,50,113,44,91,41,72,43,60,48,54,54,53,62"/>
-<area shape="rect" id="Node000002" href="$d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c" title="Convert radians to degrees." alt="" coords="226,29,398,85"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="178,75,210,70,211,75,179,80"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sin.html#" title=" " alt="" coords="280,110,344,135"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="179,100,264,113,264,118,178,106"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="269,29,269,19,277,10,291,5,312,3,335,5,349,12,347,17,334,10,312,8,292,10,280,15,274,21,274,29"/>
-</map>
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_a563e066975fed1b84750a0a47c3cbb37_cgraph.md5 b/d9/d29/ground__to__ground__projectile__motion_8cpp_a563e066975fed1b84750a0a47c3cbb37_cgraph.md5
deleted file mode 100644
index e905eabea..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_a563e066975fed1b84750a0a47c3cbb37_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-647d06c9e7ae30931232f8b5be07678d
\ No newline at end of file
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_a563e066975fed1b84750a0a47c3cbb37_cgraph.svg b/d9/d29/ground__to__ground__projectile__motion_8cpp_a563e066975fed1b84750a0a47c3cbb37_cgraph.svg
deleted file mode 100644
index 9a8318806..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_a563e066975fed1b84750a0a47c3cbb37_cgraph.svg
+++ /dev/null
@@ -1,105 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: physics::ground_to_ground_projectile_motion::time_of_flight Pages: 1 -->
-<svg width="303pt" height="106pt"
- viewBox="0.00 0.00 302.50 105.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 101.5)">
-<title>physics::ground_to_ground_projectile_motion::time_of_flight</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Calculate the time of flight.">
-<polygon fill="#999999" stroke="#666666" points="129.25,-54.5 0,-54.5 0,-12.75 129.25,-12.75 129.25,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">physics::ground_to</text>
-<text text-anchor="start" x="8" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_ground_projectile_motion</text>
-<text text-anchor="middle" x="64.62" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">::time_of_flight</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.12,-54.82C31.22,-64.3 41.39,-72.5 64.62,-72.5 78.06,-72.5 87.13,-69.76 91.82,-65.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.1,-66.85 94.68,-56.27 88.41,-64.8 95.1,-66.85"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c" target="_top" xlink:title="Convert radians to degrees.">
-<polygon fill="white" stroke="#666666" points="294.5,-79.5 165.25,-79.5 165.25,-37.75 294.5,-37.75 294.5,-79.5"/>
-<text text-anchor="start" x="173.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">physics::ground_to</text>
-<text text-anchor="start" x="173.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_ground_projectile_motion</text>
-<text text-anchor="middle" x="229.88" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">::degrees_to_radians</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.68,-43.43C137.57,-44.64 145.69,-45.89 153.73,-47.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.1,-50.56 163.51,-48.62 154.16,-43.64 153.1,-50.56"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254,-19.25 205.75,-19.25 205.75,0 254,0 254,-19.25"/>
-<text text-anchor="middle" x="229.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.68,-24.21C151.62,-20.98 175.34,-17.5 194.08,-14.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.44,-18.22 203.83,-13.31 193.42,-11.3 194.44,-18.22"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.37,-79.82C196.47,-89.3 206.64,-97.5 229.88,-97.5 243.31,-97.5 252.38,-94.76 257.07,-90.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.35,-91.85 259.93,-81.27 253.66,-89.8 260.35,-91.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_a563e066975fed1b84750a0a47c3cbb37_cgraph_org.svg b/d9/d29/ground__to__ground__projectile__motion_8cpp_a563e066975fed1b84750a0a47c3cbb37_cgraph_org.svg
deleted file mode 100644
index 1ff75a4c7..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_a563e066975fed1b84750a0a47c3cbb37_cgraph_org.svg
+++ /dev/null
@@ -1,79 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: physics::ground_to_ground_projectile_motion::time_of_flight Pages: 1 -->
-<svg width="303pt" height="106pt"
- viewBox="0.00 0.00 302.50 105.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 101.5)">
-<title>physics::ground_to_ground_projectile_motion::time_of_flight</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Calculate the time of flight.">
-<polygon fill="#999999" stroke="#666666" points="129.25,-54.5 0,-54.5 0,-12.75 129.25,-12.75 129.25,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">physics::ground_to</text>
-<text text-anchor="start" x="8" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_ground_projectile_motion</text>
-<text text-anchor="middle" x="64.62" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">::time_of_flight</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.12,-54.82C31.22,-64.3 41.39,-72.5 64.62,-72.5 78.06,-72.5 87.13,-69.76 91.82,-65.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.1,-66.85 94.68,-56.27 88.41,-64.8 95.1,-66.85"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c" target="_top" xlink:title="Convert radians to degrees.">
-<polygon fill="white" stroke="#666666" points="294.5,-79.5 165.25,-79.5 165.25,-37.75 294.5,-37.75 294.5,-79.5"/>
-<text text-anchor="start" x="173.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">physics::ground_to</text>
-<text text-anchor="start" x="173.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_ground_projectile_motion</text>
-<text text-anchor="middle" x="229.88" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">::degrees_to_radians</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.68,-43.43C137.57,-44.64 145.69,-45.89 153.73,-47.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.1,-50.56 163.51,-48.62 154.16,-43.64 153.1,-50.56"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254,-19.25 205.75,-19.25 205.75,0 254,0 254,-19.25"/>
-<text text-anchor="middle" x="229.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.68,-24.21C151.62,-20.98 175.34,-17.5 194.08,-14.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.44,-18.22 203.83,-13.31 193.42,-11.3 194.44,-18.22"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.37,-79.82C196.47,-89.3 206.64,-97.5 229.88,-97.5 243.31,-97.5 252.38,-94.76 257.07,-90.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.35,-91.85 259.93,-81.27 253.66,-89.8 260.35,-91.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_aa554429def63077ab7a550c0affbfefa_cgraph.map b/d9/d29/ground__to__ground__projectile__motion_8cpp_aa554429def63077ab7a550c0affbfefa_cgraph.map
deleted file mode 100644
index fcdc98c6a..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_aa554429def63077ab7a550c0affbfefa_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="physics::ground_to_ground_projectile_motion::max_height" name="physics::ground_to_ground_projectile_motion::max_height">
-<area shape="rect" id="Node000001" title="Calculate the max height of the projectile." alt="" coords="5,95,178,150"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="48,94,49,84,57,76,71,70,92,68,115,71,129,77,127,82,113,76,91,73,72,75,60,80,54,86,53,94"/>
-<area shape="rect" id="Node000002" href="$d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c" title="Convert radians to degrees." alt="" coords="226,29,398,85"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="177,94,210,85,211,90,179,99"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="276,110,348,135"/>
-<area shape="poly" id="edge4_Node000001_Node000003" title=" " alt="" coords="178,120,261,120,261,125,178,125"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sin.html#" title=" " alt="" coords="280,159,344,185"/>
-<area shape="poly" id="edge5_Node000001_Node000004" title=" " alt="" coords="179,139,265,159,264,164,178,144"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="269,29,269,19,277,10,291,5,312,3,335,5,349,12,347,17,334,10,312,8,292,10,280,15,274,21,274,29"/>
-</map>
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_aa554429def63077ab7a550c0affbfefa_cgraph.md5 b/d9/d29/ground__to__ground__projectile__motion_8cpp_aa554429def63077ab7a550c0affbfefa_cgraph.md5
deleted file mode 100644
index 8d372318f..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_aa554429def63077ab7a550c0affbfefa_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6a796ceb1612c4c5f78d2ab011cc6d47
\ No newline at end of file
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_aa554429def63077ab7a550c0affbfefa_cgraph.svg b/d9/d29/ground__to__ground__projectile__motion_8cpp_aa554429def63077ab7a550c0affbfefa_cgraph.svg
deleted file mode 100644
index 6c364931a..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_aa554429def63077ab7a550c0affbfefa_cgraph.svg
+++ /dev/null
@@ -1,123 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: physics::ground_to_ground_projectile_motion::max_height Pages: 1 -->
-<svg width="303pt" height="143pt"
- viewBox="0.00 0.00 302.50 142.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138.5)">
-<title>physics::ground_to_ground_projectile_motion::max_height</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Calculate the max height of the projectile.">
-<polygon fill="#999999" stroke="#666666" points="129.25,-67.5 0,-67.5 0,-25.75 129.25,-25.75 129.25,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">physics::ground_to</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_ground_projectile_motion</text>
-<text text-anchor="middle" x="64.62" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::max_height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.12,-67.82C31.22,-77.3 41.39,-85.5 64.62,-85.5 78.06,-85.5 87.13,-82.76 91.82,-78.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.1,-79.85 94.68,-69.27 88.41,-77.8 95.1,-79.85"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c" target="_top" xlink:title="Convert radians to degrees.">
-<polygon fill="white" stroke="#666666" points="294.5,-116.5 165.25,-116.5 165.25,-74.75 294.5,-74.75 294.5,-116.5"/>
-<text text-anchor="start" x="173.25" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">physics::ground_to</text>
-<text text-anchor="start" x="173.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">_ground_projectile_motion</text>
-<text text-anchor="middle" x="229.88" y="-80.5" font-family="Helvetica,sans-Serif" font-size="10.00">::degrees_to_radians</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.68,-65.85C137.66,-68.25 145.88,-70.71 154.01,-73.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.97,-76.5 163.56,-76.02 154.99,-69.79 152.97,-76.5"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="256.62,-56.25 203.12,-56.25 203.12,-37 256.62,-37 256.62,-56.25"/>
-<text text-anchor="middle" x="229.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.68,-46.62C150.63,-46.62 173.21,-46.62 191.53,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.37,-50.13 201.37,-46.63 191.37,-43.13 191.37,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254,-19.25 205.75,-19.25 205.75,0 254,0 254,-19.25"/>
-<text text-anchor="middle" x="229.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.68,-32.11C151.72,-27.11 175.56,-21.71 194.34,-17.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.87,-20.92 203.85,-15.3 193.32,-14.09 194.87,-20.92"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.37,-116.82C196.47,-126.3 206.64,-134.5 229.88,-134.5 243.31,-134.5 252.38,-131.76 257.07,-127.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.35,-128.85 259.93,-118.27 253.66,-126.8 260.35,-128.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_aa554429def63077ab7a550c0affbfefa_cgraph_org.svg b/d9/d29/ground__to__ground__projectile__motion_8cpp_aa554429def63077ab7a550c0affbfefa_cgraph_org.svg
deleted file mode 100644
index a508f73f9..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_aa554429def63077ab7a550c0affbfefa_cgraph_org.svg
+++ /dev/null
@@ -1,97 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: physics::ground_to_ground_projectile_motion::max_height Pages: 1 -->
-<svg width="303pt" height="143pt"
- viewBox="0.00 0.00 302.50 142.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138.5)">
-<title>physics::ground_to_ground_projectile_motion::max_height</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Calculate the max height of the projectile.">
-<polygon fill="#999999" stroke="#666666" points="129.25,-67.5 0,-67.5 0,-25.75 129.25,-25.75 129.25,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">physics::ground_to</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_ground_projectile_motion</text>
-<text text-anchor="middle" x="64.62" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::max_height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.12,-67.82C31.22,-77.3 41.39,-85.5 64.62,-85.5 78.06,-85.5 87.13,-82.76 91.82,-78.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.1,-79.85 94.68,-69.27 88.41,-77.8 95.1,-79.85"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c" target="_top" xlink:title="Convert radians to degrees.">
-<polygon fill="white" stroke="#666666" points="294.5,-116.5 165.25,-116.5 165.25,-74.75 294.5,-74.75 294.5,-116.5"/>
-<text text-anchor="start" x="173.25" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">physics::ground_to</text>
-<text text-anchor="start" x="173.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">_ground_projectile_motion</text>
-<text text-anchor="middle" x="229.88" y="-80.5" font-family="Helvetica,sans-Serif" font-size="10.00">::degrees_to_radians</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.68,-65.85C137.66,-68.25 145.88,-70.71 154.01,-73.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.97,-76.5 163.56,-76.02 154.99,-69.79 152.97,-76.5"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="256.62,-56.25 203.12,-56.25 203.12,-37 256.62,-37 256.62,-56.25"/>
-<text text-anchor="middle" x="229.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.68,-46.62C150.63,-46.62 173.21,-46.62 191.53,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.37,-50.13 201.37,-46.63 191.37,-43.13 191.37,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254,-19.25 205.75,-19.25 205.75,0 254,0 254,-19.25"/>
-<text text-anchor="middle" x="229.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.68,-32.11C151.72,-27.11 175.56,-21.71 194.34,-17.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.87,-20.92 203.85,-15.3 193.32,-14.09 194.87,-20.92"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.37,-116.82C196.47,-126.3 206.64,-134.5 229.88,-134.5 243.31,-134.5 252.38,-131.76 257.07,-127.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.35,-128.85 259.93,-118.27 253.66,-126.8 260.35,-128.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d9/d29/ground__to__ground__projectile__motion_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index cc97a7729..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,31,49,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="101,5,172,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,36,85,27,86,33,50,41"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/round.html#" title=" " alt="" coords="97,55,176,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="49,46,82,53,81,58,48,51"/>
-</map>
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d9/d29/ground__to__ground__projectile__motion_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 6d66f15c5..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e439fc7dbca33286c17b90ddce659abc
\ No newline at end of file
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d9/d29/ground__to__ground__projectile__motion_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 1d456db85..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="136pt" height="64pt"
- viewBox="0.00 0.00 136.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125,-56.25 71.5,-56.25 71.5,-37 125,-37 125,-56.25"/>
-<text text-anchor="middle" x="98.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.67,-31.29C40.51,-33.15 50.39,-35.5 60.06,-37.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="59.15,-41.17 69.69,-40.08 60.77,-34.36 59.15,-41.17"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="128,-19.25 68.5,-19.25 68.5,0 128,0 128,-19.25"/>
-<text text-anchor="middle" x="98.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.67,-24.15C39.76,-22.56 48.53,-20.59 57.3,-18.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.8,-22.09 66.79,-16.48 56.27,-15.26 57.8,-22.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d9/d29/ground__to__ground__projectile__motion_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index df2f714e2..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="136pt" height="64pt"
- viewBox="0.00 0.00 136.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125,-56.25 71.5,-56.25 71.5,-37 125,-37 125,-56.25"/>
-<text text-anchor="middle" x="98.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.67,-31.29C40.51,-33.15 50.39,-35.5 60.06,-37.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="59.15,-41.17 69.69,-40.08 60.77,-34.36 59.15,-41.17"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="128,-19.25 68.5,-19.25 68.5,0 128,0 128,-19.25"/>
-<text text-anchor="middle" x="98.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.67,-24.15C39.76,-22.56 48.53,-20.59 57.3,-18.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.8,-22.09 66.79,-16.48 56.27,-15.26 57.8,-22.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_ab00e9785fb2670f7af99d6f3d636f87c_cgraph.map b/d9/d29/ground__to__ground__projectile__motion_8cpp_ab00e9785fb2670f7af99d6f3d636f87c_cgraph.map
deleted file mode 100644
index 04a184b67..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_ab00e9785fb2670f7af99d6f3d636f87c_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="physics::ground_to_ground_projectile_motion::degrees_to_radians" name="physics::ground_to_ground_projectile_motion::degrees_to_radians">
-<area shape="rect" id="Node000001" title="Convert radians to degrees." alt="" coords="5,29,178,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="57,29,57,19,64,10,75,5,92,3,110,5,121,12,118,16,108,10,91,8,77,10,67,14,63,21,62,29"/>
-</map>
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_ab00e9785fb2670f7af99d6f3d636f87c_cgraph.md5 b/d9/d29/ground__to__ground__projectile__motion_8cpp_ab00e9785fb2670f7af99d6f3d636f87c_cgraph.md5
deleted file mode 100644
index bb90c237f..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_ab00e9785fb2670f7af99d6f3d636f87c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-eb0c841a213f8fe0467e2b484906dad4
\ No newline at end of file
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_ab00e9785fb2670f7af99d6f3d636f87c_cgraph.svg b/d9/d29/ground__to__ground__projectile__motion_8cpp_ab00e9785fb2670f7af99d6f3d636f87c_cgraph.svg
deleted file mode 100644
index a21b21f47..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_ab00e9785fb2670f7af99d6f3d636f87c_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: physics::ground_to_ground_projectile_motion::degrees_to_radians Pages: 1 -->
-<svg width="137pt" height="68pt"
- viewBox="0.00 0.00 137.25 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>physics::ground_to_ground_projectile_motion::degrees_to_radians</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Convert radians to degrees.">
-<polygon fill="#999999" stroke="#666666" points="129.25,-41.75 0,-41.75 0,0 129.25,0 129.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">physics::ground_to</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_ground_projectile_motion</text>
-<text text-anchor="middle" x="64.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::degrees_to_radians</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.77,-42.07C38.5,-51.55 46.45,-59.75 64.62,-59.75 74.85,-59.75 81.84,-57.16 85.59,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.98,-54.09 88.1,-43.53 82.2,-52.33 88.98,-54.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_ab00e9785fb2670f7af99d6f3d636f87c_cgraph_org.svg b/d9/d29/ground__to__ground__projectile__motion_8cpp_ab00e9785fb2670f7af99d6f3d636f87c_cgraph_org.svg
deleted file mode 100644
index 060584907..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_ab00e9785fb2670f7af99d6f3d636f87c_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: physics::ground_to_ground_projectile_motion::degrees_to_radians Pages: 1 -->
-<svg width="137pt" height="68pt"
- viewBox="0.00 0.00 137.25 67.75" 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 63.75)">
-<title>physics::ground_to_ground_projectile_motion::degrees_to_radians</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Convert radians to degrees.">
-<polygon fill="#999999" stroke="#666666" points="129.25,-41.75 0,-41.75 0,0 129.25,0 129.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">physics::ground_to</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_ground_projectile_motion</text>
-<text text-anchor="middle" x="64.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::degrees_to_radians</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.77,-42.07C38.5,-51.55 46.45,-59.75 64.62,-59.75 74.85,-59.75 81.84,-57.16 85.59,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.98,-54.09 88.1,-43.53 82.2,-52.33 88.98,-54.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d29/ground__to__ground__projectile__motion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index cb23a2aca..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,31,146,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,41,87,41,87,46,55,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="198,5,269,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,36,182,27,183,33,147,41"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/round.html#" title=" " alt="" coords="194,55,273,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="147,46,180,53,178,58,146,51"/>
-</map>
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d29/ground__to__ground__projectile__motion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 2deb18f2c..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-09d97abbbbd350de10db7f92b016a1b2
\ No newline at end of file
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d29/ground__to__ground__projectile__motion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 6c3656c58..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="209pt" height="64pt"
- viewBox="0.00 0.00 209.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="198,-56.25 144.5,-56.25 144.5,-37 198,-37 198,-56.25"/>
-<text text-anchor="middle" x="171.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.67,-31.29C113.51,-33.15 123.39,-35.5 133.06,-37.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.15,-41.17 142.69,-40.08 133.77,-34.36 132.15,-41.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201,-19.25 141.5,-19.25 141.5,0 201,0 201,-19.25"/>
-<text text-anchor="middle" x="171.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.67,-24.15C112.76,-22.56 121.53,-20.59 130.3,-18.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.8,-22.09 139.79,-16.48 129.27,-15.26 130.8,-22.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/d29/ground__to__ground__projectile__motion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index dc9a69e77..000000000
--- a/d9/d29/ground__to__ground__projectile__motion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="209pt" height="64pt"
- viewBox="0.00 0.00 209.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="198,-56.25 144.5,-56.25 144.5,-37 198,-37 198,-56.25"/>
-<text text-anchor="middle" x="171.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.67,-31.29C113.51,-33.15 123.39,-35.5 133.06,-37.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.15,-41.17 142.69,-40.08 133.77,-34.36 132.15,-41.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201,-19.25 141.5,-19.25 141.5,0 201,0 201,-19.25"/>
-<text text-anchor="middle" x="171.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.67,-24.15C112.76,-22.56 121.53,-20.59 130.3,-18.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.8,-22.09 139.79,-16.48 129.27,-15.26 130.8,-22.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d29/ground__to__ground__projectile__motion_8cpp_source.html b/d9/d29/ground__to__ground__projectile__motion_8cpp_source.html
new file mode 100644
index 000000000..e150569a6
--- /dev/null
+++ b/d9/d29/ground__to__ground__projectile__motion_8cpp_source.html
@@ -0,0 +1,245 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: physics/ground_to_ground_projectile_motion.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d29/ground__to__ground__projectile__motion_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">ground_to_ground_projectile_motion.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"><a class="line" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a525335710b53cb064ca56b936120431e">   13</a></span><span class="preprocessor">#define _USE_MATH_DEFINES</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cmath&gt;</span>     </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/dd0/namespacephysics.html">physics</a> {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/d20/namespaceground__to__ground__projectile__motion.html">ground_to_ground_projectile_motion</a> {</div>
+<div class="foldopen" id="foldopen00034" data-start="{" data-end="}">
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c">   34</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c">degrees_to_radians</a>(<span class="keywordtype">double</span> degrees){</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordtype">double</span> radians = degrees * (M_PI / 180);</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">return</span> radians;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>}</div>
+</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00047" data-start="{" data-end="}">
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a563e066975fed1b84750a0a47c3cbb37">   47</a></span>T <a class="code hl_function" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a563e066975fed1b84750a0a47c3cbb37">time_of_flight</a>(T initial_velocity, T angle, <span class="keywordtype">double</span> gravity = 9.81) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordtype">double</span> Viy = initial_velocity * (std::sin(<a class="code hl_function" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c">degrees_to_radians</a>(angle))); <span class="comment">// calculate y component of the initial velocity</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">return</span> 2.0 * Viy / gravity;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>}</div>
+</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00059" data-start="{" data-end="}">
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a10362eb607d7882bac3a0688504b00ff">   59</a></span>T <a class="code hl_function" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a10362eb607d7882bac3a0688504b00ff">horizontal_range</a>(T initial_velocity, T angle, T time) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordtype">double</span> Vix = initial_velocity * (std::cos(<a class="code hl_function" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c">degrees_to_radians</a>(angle))); <span class="comment">// calculate x component of the initial velocity</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">return</span> Vix * time;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>}</div>
+</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00072" data-start="{" data-end="}">
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"><a class="line" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa554429def63077ab7a550c0affbfefa">   72</a></span>T <a class="code hl_function" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa554429def63077ab7a550c0affbfefa">max_height</a>(T initial_velocity, T angle, <span class="keywordtype">double</span> gravity = 9.81) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordtype">double</span> Viy = initial_velocity * (std::sin(<a class="code hl_function" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c">degrees_to_radians</a>(angle))); <span class="comment">// calculate y component of the initial velocity</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keywordflow">return</span> (std::pow(Viy, 2) / (2.0 * gravity));</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>}</div>
+</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>}  <span class="comment">// namespace ground_to_ground_projectile_motion</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>}  <span class="comment">// namespace physics</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="foldopen" id="foldopen00083" data-start="{" data-end="}">
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"><a class="line" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   83</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="comment">// initial input variables</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keywordtype">double</span> initial_velocity = 5.0;  <span class="comment">// double initial_velocity input</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordtype">double</span> angle = 40.0;            <span class="comment">// double angle input</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="comment">// 1st test</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keywordtype">double</span> expected_time_of_flight = 0.655;  <span class="comment">// expected time output</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="keywordtype">double</span> flight_time_output =</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        std::round(physics::ground_to_ground_projectile_motion::time_of_flight(initial_velocity, angle) * 1000.0) /</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        1000.0;  <span class="comment">// round output to 3 decimal places</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Projectile Flight Time (double)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Initial Velocity: &quot;</span> &lt;&lt; initial_velocity &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Angle: &quot;</span> &lt;&lt; angle &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; expected_time_of_flight &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; flight_time_output &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    assert(flight_time_output == expected_time_of_flight);</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="comment">// 2nd test</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="keywordtype">double</span> expected_horizontal_range = 2.51; <span class="comment">// expected range output</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="keywordtype">double</span> horizontal_range_output =</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        std::round(physics::ground_to_ground_projectile_motion::horizontal_range(initial_velocity, angle,</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>                                             flight_time_output) *</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>                   100.0) /</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        100.0;  <span class="comment">// round output to 2 decimal places</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Projectile Horizontal Range (double)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Initial Velocity: &quot;</span> &lt;&lt; initial_velocity &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Angle: &quot;</span> &lt;&lt; angle &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Time Of Flight: &quot;</span> &lt;&lt; flight_time_output &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; expected_horizontal_range &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; horizontal_range_output &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    assert(horizontal_range_output == expected_horizontal_range);</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <span class="comment">// 3rd test</span></div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <span class="keywordtype">double</span> expected_max_height = 0.526; <span class="comment">// expected height output</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="keywordtype">double</span> max_height_output =</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        std::round(physics::ground_to_ground_projectile_motion::max_height(initial_velocity, angle) * 1000.0) /</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        1000.0;  <span class="comment">// round output to 3 decimal places</span></div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Projectile Max Height (double)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Initial Velocity: &quot;</span> &lt;&lt; initial_velocity &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Angle: &quot;</span> &lt;&lt; angle &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; expected_max_height &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; max_height_output &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    assert(max_height_output == expected_max_height);</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>}</div>
+</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span> </div>
+<div class="foldopen" id="foldopen00138" data-start="{" data-end="}">
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"><a class="line" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  138</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <a class="code hl_function" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>}</div>
+</div>
+<div class="ttc" id="aground__to__ground__projectile__motion_8cpp_html_a10362eb607d7882bac3a0688504b00ff"><div class="ttname"><a href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a10362eb607d7882bac3a0688504b00ff">physics::ground_to_ground_projectile_motion::horizontal_range</a></div><div class="ttdeci">T horizontal_range(T initial_velocity, T angle, T time)</div><div class="ttdoc">Calculate the horizontal distance that the projectile travels.</div><div class="ttdef"><b>Definition</b> <a href="#l00059">ground_to_ground_projectile_motion.cpp:59</a></div></div>
+<div class="ttc" id="aground__to__ground__projectile__motion_8cpp_html_a563e066975fed1b84750a0a47c3cbb37"><div class="ttname"><a href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a563e066975fed1b84750a0a47c3cbb37">physics::ground_to_ground_projectile_motion::time_of_flight</a></div><div class="ttdeci">T time_of_flight(T initial_velocity, T angle, double gravity=9.81)</div><div class="ttdoc">Calculate the time of flight.</div><div class="ttdef"><b>Definition</b> <a href="#l00047">ground_to_ground_projectile_motion.cpp:47</a></div></div>
+<div class="ttc" id="aground__to__ground__projectile__motion_8cpp_html_aa554429def63077ab7a550c0affbfefa"><div class="ttname"><a href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa554429def63077ab7a550c0affbfefa">physics::ground_to_ground_projectile_motion::max_height</a></div><div class="ttdeci">T max_height(T initial_velocity, T angle, double gravity=9.81)</div><div class="ttdoc">Calculate the max height of the projectile.</div><div class="ttdef"><b>Definition</b> <a href="#l00072">ground_to_ground_projectile_motion.cpp:72</a></div></div>
+<div class="ttc" id="aground__to__ground__projectile__motion_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d9/d29/ground__to__ground__projectile__motion_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> <a href="#l00083">ground_to_ground_projectile_motion.cpp:83</a></div></div>
+<div class="ttc" id="aground__to__ground__projectile__motion_8cpp_html_ab00e9785fb2670f7af99d6f3d636f87c"><div class="ttname"><a href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c">physics::ground_to_ground_projectile_motion::degrees_to_radians</a></div><div class="ttdeci">double degrees_to_radians(double degrees)</div><div class="ttdoc">Convert radians to degrees.</div><div class="ttdef"><b>Definition</b> <a href="#l00034">ground_to_ground_projectile_motion.cpp:34</a></div></div>
+<div class="ttc" id="aground__to__ground__projectile__motion_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00138">ground_to_ground_projectile_motion.cpp:138</a></div></div>
+<div class="ttc" id="anamespaceground__to__ground__projectile__motion_html"><div class="ttname"><a href="../../d0/d20/namespaceground__to__ground__projectile__motion.html">ground_to_ground_projectile_motion</a></div><div class="ttdoc">Functions for the Ground to ground projectile motion equation.</div></div>
+<div class="ttc" id="anamespacephysics_html"><div class="ttname"><a href="../../d5/dd0/namespacephysics.html">physics</a></div><div class="ttdoc">for IO operations</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_59dc24c326e2a72d1164f014b22de83d.html">physics</a></li><li class="navelem"><a class="el" href="../../d9/d29/ground__to__ground__projectile__motion_8cpp.html">ground_to_ground_projectile_motion.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/d2c/class_test_cases-members.html b/d9/d2c/class_test_cases-members.html
index 36af68657..2dcdb018c 100644
--- a/d9/d2c/class_test_cases-members.html
+++ b/d9/d2c/class_test_cases-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d9/d31/coin__change__topdown_8cpp.html b/d9/d31/coin__change__topdown_8cpp.html
index 830e21e80..b9ebdc1be 100644
--- a/d9/d31/coin__change__topdown_8cpp.html
+++ b/d9/d31/coin__change__topdown_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/coin_change_topdown.cpp File Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming/coin_change_topdown.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for coin_change_topdown.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d29/coin__change__topdown_8cpp__incl.svg" width="335" height="126"><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">
+</div>
+<p><a href="../../d9/d31/coin__change__topdown_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
@@ -135,7 +154,7 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ac816a4ae8a29c156b90377041000929a" id="r_ac816a4ae8a29c156b90377041000929a"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ac816a4ae8a29c156b90377041000929a"><td class="memTemplItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac816a4ae8a29c156b90377041000929a">dynamic_programming::mincoins_topdown::mincoins</a> (const T &amp;n, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;coins, const int16_t &amp;t, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; dp)</td></tr>
+<tr class="memitem:ac816a4ae8a29c156b90377041000929a"><td class="memTemplItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac816a4ae8a29c156b90377041000929a">dynamic_programming::mincoins_topdown::mincoins</a> (const T &amp;n, const std::vector&lt; T &gt; &amp;coins, const int16_t &amp;t, std::vector&lt; T &gt; dp)</td></tr>
 <tr class="memdesc:ac816a4ae8a29c156b90377041000929a"><td class="mdescLeft">&#160;</td><td class="mdescRight">This implementation is for finding minimum number of coins .  <br /></td></tr>
 <tr class="separator:ac816a4ae8a29c156b90377041000929a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -152,6 +171,8 @@ Functions</h2></td></tr>
 <li>Bottom up appraoch Top down approach involves a vector with all elements initialised to 0. It is based on optimal substructure and overlapping subproblems. Overall time complexity of coin change problem is O(n*t) For example: example 1:- Coins: {1,7,10} Target:15 Therfore minimum number of coins required = 3 of denomination 1,7 and 7. <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/webdesignbydivyansh" target="_blank">Divyansh Kushwaha</a> </dd></dl>
 </li>
 </ol>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/d31/coin__change__topdown_8cpp_source.html">coin_change_topdown.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -170,17 +191,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d31/coin__change__topdown_8cpp_source.html#l00091">91</a> of file <a class="el" href="../../d9/d31/coin__change__topdown_8cpp_source.html">coin_change_topdown.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   91</span>           {</div>
 <div class="line"><span class="lineno">   92</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the test</span></div>
 <div class="line"><span class="lineno">   93</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   94</span>}</div>
-<div class="ttc" id="acoin__change__topdown_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> coin_change_topdown.cpp:74</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d31/coin__change__topdown_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="322" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acoin__change__topdown_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d31/coin__change__topdown_8cpp_source.html#l00074">coin_change_topdown.cpp:74</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac816a4ae8a29c156b90377041000929a" name="ac816a4ae8a29c156b90377041000929a"></a>
@@ -199,7 +217,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>coins</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>coins</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -209,7 +227,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;</td>          <td class="paramname"><span class="paramname"><em>dp</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; T &gt;</td>          <td class="paramname"><span class="paramname"><em>dp</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -226,6 +244,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>minimum number of coins </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d31/coin__change__topdown_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../d9/d31/coin__change__topdown_8cpp_source.html">coin_change_topdown.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   48</span>                                  {</div>
 <div class="line"><span class="lineno">   49</span>    <span class="keywordflow">if</span> (n == 0) {</div>
 <div class="line"><span class="lineno">   50</span>        <span class="keywordflow">return</span> 0;</div>
@@ -238,21 +258,15 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   57</span>        <span class="keywordflow">if</span> (n - coins[i] &gt;= 0) {  <span class="comment">// if after subtracting the current</span></div>
 <div class="line"><span class="lineno">   58</span>                                  <span class="comment">// denomination is it greater than 0 or not</span></div>
 <div class="line"><span class="lineno">   59</span>            <span class="keywordtype">int</span> sub = <a class="code hl_function" href="#ac816a4ae8a29c156b90377041000929a">mincoins</a>(n - coins[i], coins, t, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);</div>
-<div class="line"><span class="lineno">   60</span>            ans = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(ans, sub + 1);</div>
+<div class="line"><span class="lineno">   60</span>            ans = std::min(ans, sub + 1);</div>
 <div class="line"><span class="lineno">   61</span>        }</div>
 <div class="line"><span class="lineno">   62</span>    }</div>
 <div class="line"><span class="lineno">   63</span>    <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[n] = ans;</div>
 <div class="line"><span class="lineno">   64</span>    <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[n];  <span class="comment">// returns minimum number of coins</span></div>
 <div class="line"><span class="lineno">   65</span>}</div>
-<div class="ttc" id="acoin__change__topdown_8cpp_html_ac816a4ae8a29c156b90377041000929a"><div class="ttname"><a href="#ac816a4ae8a29c156b90377041000929a">dynamic_programming::mincoins_topdown::mincoins</a></div><div class="ttdeci">int64_t mincoins(const T &amp;n, const std::vector&lt; T &gt; &amp;coins, const int16_t &amp;t, std::vector&lt; T &gt; dp)</div><div class="ttdoc">This implementation is for finding minimum number of coins .</div><div class="ttdef"><b>Definition</b> coin_change_topdown.cpp:47</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="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><!-- 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="../../d9/d31/coin__change__topdown_8cpp_ac816a4ae8a29c156b90377041000929a_cgraph.svg" width="280" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acoin__change__topdown_8cpp_html_ac816a4ae8a29c156b90377041000929a"><div class="ttname"><a href="#ac816a4ae8a29c156b90377041000929a">dynamic_programming::mincoins_topdown::mincoins</a></div><div class="ttdeci">int64_t mincoins(const T &amp;n, const std::vector&lt; T &gt; &amp;coins, const int16_t &amp;t, std::vector&lt; T &gt; dp)</div><div class="ttdoc">This implementation is for finding minimum number of coins .</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d31/coin__change__topdown_8cpp_source.html#l00047">coin_change_topdown.cpp:47</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> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -280,27 +294,22 @@ Here is the call graph for this function:</div>
 
 <p>Test implementations. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d31/coin__change__topdown_8cpp_source.html#l00074">74</a> of file <a class="el" href="../../d9/d31/coin__change__topdown_8cpp_source.html">coin_change_topdown.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   74</span>                   {</div>
 <div class="line"><span class="lineno">   75</span>    <span class="comment">// example 1: number of coins=3 and minimum coins required=3(7,7,1)</span></div>
 <div class="line"><span class="lineno">   76</span>    <span class="keyword">const</span> int64_t n1 = 15;</div>
 <div class="line"><span class="lineno">   77</span>    <span class="keyword">const</span> int8_t t1 = 3, a1 = 0;</div>
-<div class="line"><span class="lineno">   78</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest 1...&quot;</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&lt;int64_t&gt;</a> arr1{1, 7, 10};</div>
-<div class="line"><span class="lineno">   80</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> dp1(n1 + 1);</div>
+<div class="line"><span class="lineno">   78</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest 1...&quot;</span>;</div>
+<div class="line"><span class="lineno">   79</span>    std::vector&lt;int64_t&gt; arr1{1, 7, 10};</div>
+<div class="line"><span class="lineno">   80</span>    std::vector&lt;int64_t&gt; dp1(n1 + 1);</div>
 <div class="line"><span class="lineno">   81</span>    <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(dp1.begin(), dp1.end(), a1);</div>
 <div class="line"><span class="lineno">   82</span>    assert(dynamic_programming::mincoins_topdown::mincoins(n1, arr1, t1, dp1) ==</div>
 <div class="line"><span class="lineno">   83</span>           3);</div>
-<div class="line"><span class="lineno">   84</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   85</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="adecimal__to__roman__numeral_8cpp_html_a88203bd297e8405160c132faa1187780"><div class="ttname"><a href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a></div><div class="ttdeci">std::string fill(char c, int n)</div><div class="ttdef"><b>Definition</b> decimal_to_roman_numeral.cpp:15</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d31/coin__change__topdown_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="224" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="adecimal__to__roman__numeral_8cpp_html_a88203bd297e8405160c132faa1187780"><div class="ttname"><a href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a></div><div class="ttdeci">std::string fill(char c, int n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d85/decimal__to__roman__numeral_8cpp_source.html#l00015">decimal_to_roman_numeral.cpp:15</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/d31/coin__change__topdown_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d9/d31/coin__change__topdown_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index c9c9d20ae..000000000
--- a/d9/d31/coin__change__topdown_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Test implementations." alt="" coords="5,55,49,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="97,5,219,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,57,106,35,108,40,50,62"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="102,55,214,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="49,65,86,65,86,70,49,70"/>
-<area shape="rect" id="Node000004" href="$de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780" title=" " alt="" coords="139,104,177,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="50,73,125,102,123,107,48,78"/>
-</map>
diff --git a/d9/d31/coin__change__topdown_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d9/d31/coin__change__topdown_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index a59c1473c..000000000
--- a/d9/d31/coin__change__topdown_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e6d650c0b993c8f60e6b575668c0d58f
\ No newline at end of file
diff --git a/d9/d31/coin__change__topdown_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d9/d31/coin__change__topdown_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index a9745d3b3..000000000
--- a/d9/d31/coin__change__topdown_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="168pt" height="101pt"
- viewBox="0.00 0.00 168.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-56.25 0,-56.25 0,-37 32.5,-37 32.5,-56.25"/>
-<text text-anchor="middle" x="16.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-93.25 68.5,-93.25 68.5,-74 160.25,-74 160.25,-93.25"/>
-<text text-anchor="middle" x="114.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-52.57C44.48,-57.11 61.22,-63.55 76.4,-69.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.09,-72.64 85.68,-72.96 77.6,-66.1 75.09,-72.64"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="156.5,-56.25 72.25,-56.25 72.25,-37 156.5,-37 156.5,-56.25"/>
-<text text-anchor="middle" x="114.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-46.62C40.41,-46.62 50.24,-46.62 60.37,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.32,-50.13 70.32,-46.63 60.32,-43.13 60.32,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="128.78,-19.25 99.97,-19.25 99.97,0 128.78,0 128.78,-19.25"/>
-<text text-anchor="middle" x="114.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-40.68C47.84,-34.85 71.18,-25.87 88.87,-19.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.04,-22.36 98.12,-15.5 87.53,-15.82 90.04,-22.36"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d31/coin__change__topdown_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d9/d31/coin__change__topdown_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 8cb214869..000000000
--- a/d9/d31/coin__change__topdown_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="168pt" height="101pt"
- viewBox="0.00 0.00 168.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-56.25 0,-56.25 0,-37 32.5,-37 32.5,-56.25"/>
-<text text-anchor="middle" x="16.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-93.25 68.5,-93.25 68.5,-74 160.25,-74 160.25,-93.25"/>
-<text text-anchor="middle" x="114.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-52.57C44.48,-57.11 61.22,-63.55 76.4,-69.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.09,-72.64 85.68,-72.96 77.6,-66.1 75.09,-72.64"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="156.5,-56.25 72.25,-56.25 72.25,-37 156.5,-37 156.5,-56.25"/>
-<text text-anchor="middle" x="114.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-46.62C40.41,-46.62 50.24,-46.62 60.37,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.32,-50.13 70.32,-46.63 60.32,-43.13 60.32,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="128.78,-19.25 99.97,-19.25 99.97,0 128.78,0 128.78,-19.25"/>
-<text text-anchor="middle" x="114.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-40.68C47.84,-34.85 71.18,-25.87 88.87,-19.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.04,-22.36 98.12,-15.5 87.53,-15.82 90.04,-22.36"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d31/coin__change__topdown_8cpp_ac816a4ae8a29c156b90377041000929a_cgraph.map b/d9/d31/coin__change__topdown_8cpp_ac816a4ae8a29c156b90377041000929a_cgraph.map
deleted file mode 100644
index cd674c2b7..000000000
--- a/d9/d31/coin__change__topdown_8cpp_ac816a4ae8a29c156b90377041000929a_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="dynamic_programming::mincoins_topdown::mincoins" name="dynamic_programming::mincoins_topdown::mincoins">
-<area shape="rect" id="Node000001" title="This implementation is for finding minimum number of coins ." alt="" coords="5,29,158,85"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="50,29,50,19,56,10,66,5,82,3,98,5,109,12,106,16,96,10,81,8,68,10,59,14,55,21,55,29"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="206,44,274,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="158,54,190,54,190,60,158,60"/>
-</map>
diff --git a/d9/d31/coin__change__topdown_8cpp_ac816a4ae8a29c156b90377041000929a_cgraph.md5 b/d9/d31/coin__change__topdown_8cpp_ac816a4ae8a29c156b90377041000929a_cgraph.md5
deleted file mode 100644
index 5c0c9f67a..000000000
--- a/d9/d31/coin__change__topdown_8cpp_ac816a4ae8a29c156b90377041000929a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-45f297439154cb4f4d70f0a6c20052fa
\ No newline at end of file
diff --git a/d9/d31/coin__change__topdown_8cpp_ac816a4ae8a29c156b90377041000929a_cgraph.svg b/d9/d31/coin__change__topdown_8cpp_ac816a4ae8a29c156b90377041000929a_cgraph.svg
deleted file mode 100644
index a23bec2b6..000000000
--- a/d9/d31/coin__change__topdown_8cpp_ac816a4ae8a29c156b90377041000929a_cgraph.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::mincoins_topdown::mincoins Pages: 1 -->
-<svg width="210pt" height="68pt"
- viewBox="0.00 0.00 209.50 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>dynamic_programming::mincoins_topdown::mincoins</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This implementation is for finding minimum number of coins .">
-<polygon fill="#999999" stroke="#666666" points="114.25,-41.75 0,-41.75 0,0 114.25,0 114.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::mincoins_topdown::</text>
-<text text-anchor="middle" x="57.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">mincoins</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.21,-42.07C33.12,-51.55 40.43,-59.75 57.12,-59.75 66.52,-59.75 72.94,-57.16 76.39,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.78,-54.08 78.69,-43.54 72.97,-52.46 79.78,-54.08"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.5,-30.5 150.25,-30.5 150.25,-11.25 201.5,-11.25 201.5,-30.5"/>
-<text text-anchor="middle" x="175.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.45,-20.88C122.64,-20.88 130.88,-20.88 138.53,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.46,-24.38 148.46,-20.88 138.46,-17.38 138.46,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d31/coin__change__topdown_8cpp_ac816a4ae8a29c156b90377041000929a_cgraph_org.svg b/d9/d31/coin__change__topdown_8cpp_ac816a4ae8a29c156b90377041000929a_cgraph_org.svg
deleted file mode 100644
index d3f85451a..000000000
--- a/d9/d31/coin__change__topdown_8cpp_ac816a4ae8a29c156b90377041000929a_cgraph_org.svg
+++ /dev/null
@@ -1,50 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::mincoins_topdown::mincoins Pages: 1 -->
-<svg width="210pt" height="68pt"
- viewBox="0.00 0.00 209.50 67.75" 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 63.75)">
-<title>dynamic_programming::mincoins_topdown::mincoins</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This implementation is for finding minimum number of coins .">
-<polygon fill="#999999" stroke="#666666" points="114.25,-41.75 0,-41.75 0,0 114.25,0 114.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::mincoins_topdown::</text>
-<text text-anchor="middle" x="57.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">mincoins</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.21,-42.07C33.12,-51.55 40.43,-59.75 57.12,-59.75 66.52,-59.75 72.94,-57.16 76.39,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.78,-54.08 78.69,-43.54 72.97,-52.46 79.78,-54.08"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.5,-30.5 150.25,-30.5 150.25,-11.25 201.5,-11.25 201.5,-30.5"/>
-<text text-anchor="middle" x="175.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.45,-20.88C122.64,-20.88 130.88,-20.88 138.53,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.46,-24.38 148.46,-20.88 138.46,-17.38 138.46,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d31/coin__change__topdown_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d31/coin__change__topdown_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index a79f240db..000000000
--- a/d9/d31/coin__change__topdown_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,55,55,80"/>
-<area shape="rect" id="Node000002" href="$d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Test implementations." alt="" coords="103,55,146,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,65,87,65,87,70,55,70"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="194,5,316,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="145,57,204,35,205,40,147,62"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="199,55,311,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="146,65,183,65,183,70,146,70"/>
-<area shape="rect" id="Node000005" href="$de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780" title=" " alt="" coords="236,104,274,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="147,73,222,102,220,107,145,78"/>
-</map>
diff --git a/d9/d31/coin__change__topdown_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d31/coin__change__topdown_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 6f387b029..000000000
--- a/d9/d31/coin__change__topdown_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-95788545ce66f46005b7c52ab3e94b86
\ No newline at end of file
diff --git a/d9/d31/coin__change__topdown_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d31/coin__change__topdown_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index ac6b968f5..000000000
--- a/d9/d31/coin__change__topdown_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="241pt" height="101pt"
- viewBox="0.00 0.00 241.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-56.25 73,-56.25 73,-37 105.5,-37 105.5,-56.25"/>
-<text text-anchor="middle" x="89.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-46.62C44.58,-46.62 53.31,-46.62 61.45,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-50.13 71.2,-46.63 61.2,-43.13 61.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.25,-93.25 141.5,-93.25 141.5,-74 233.25,-74 233.25,-93.25"/>
-<text text-anchor="middle" x="187.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-52.57C117.48,-57.11 134.22,-63.55 149.4,-69.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.09,-72.64 158.68,-72.96 150.6,-66.1 148.09,-72.64"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="229.5,-56.25 145.25,-56.25 145.25,-37 229.5,-37 229.5,-56.25"/>
-<text text-anchor="middle" x="187.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-46.62C113.41,-46.62 123.24,-46.62 133.37,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.32,-50.13 143.32,-46.63 133.32,-43.13 133.32,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.78,-19.25 172.97,-19.25 172.97,0 201.78,0 201.78,-19.25"/>
-<text text-anchor="middle" x="187.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fill</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-40.68C120.84,-34.85 144.18,-25.87 161.87,-19.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.04,-22.36 171.12,-15.5 160.53,-15.82 163.04,-22.36"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d31/coin__change__topdown_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/d31/coin__change__topdown_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 10494ac83..000000000
--- a/d9/d31/coin__change__topdown_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="241pt" height="101pt"
- viewBox="0.00 0.00 241.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-56.25 73,-56.25 73,-37 105.5,-37 105.5,-56.25"/>
-<text text-anchor="middle" x="89.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-46.62C44.58,-46.62 53.31,-46.62 61.45,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-50.13 71.2,-46.63 61.2,-43.13 61.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.25,-93.25 141.5,-93.25 141.5,-74 233.25,-74 233.25,-93.25"/>
-<text text-anchor="middle" x="187.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-52.57C117.48,-57.11 134.22,-63.55 149.4,-69.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.09,-72.64 158.68,-72.96 150.6,-66.1 148.09,-72.64"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="229.5,-56.25 145.25,-56.25 145.25,-37 229.5,-37 229.5,-56.25"/>
-<text text-anchor="middle" x="187.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-46.62C113.41,-46.62 123.24,-46.62 133.37,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.32,-50.13 143.32,-46.63 133.32,-43.13 133.32,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.78,-19.25 172.97,-19.25 172.97,0 201.78,0 201.78,-19.25"/>
-<text text-anchor="middle" x="187.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fill</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-40.68C120.84,-34.85 144.18,-25.87 161.87,-19.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.04,-22.36 171.12,-15.5 160.53,-15.82 163.04,-22.36"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d31/coin__change__topdown_8cpp_source.html b/d9/d31/coin__change__topdown_8cpp_source.html
new file mode 100644
index 000000000..14d3cf6f3
--- /dev/null
+++ b/d9/d31/coin__change__topdown_8cpp_source.html
@@ -0,0 +1,199 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/coin_change_topdown.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d31/coin__change__topdown_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">coin_change_topdown.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/d31/coin__change__topdown_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cassert&gt;</span>   <span class="comment">// for assert</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;climits&gt;</span>   <span class="comment">// for INT_MAX</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;iostream&gt;</span>  <span class="comment">// for io operations</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;vector&gt;</span>    <span class="comment">// for std::vector</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a> {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/db8/namespacemincoins__topdown.html">mincoins_topdown</a> {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00047" data-start="{" data-end="}">
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="../../d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a">   47</a></span>int64_t <a class="code hl_function" href="../../d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a">mincoins</a>(<span class="keyword">const</span> T &amp;n, <span class="keyword">const</span> std::vector&lt;T&gt; &amp;coins, <span class="keyword">const</span> int16_t &amp;t,</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>                 std::vector&lt;T&gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">if</span> (n == 0) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">if</span> (<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[n] != 0) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[n];</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordtype">int</span> ans = INT_MAX;  <span class="comment">// variable to store min coins</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; t; i++) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        <span class="keywordflow">if</span> (n - coins[i] &gt;= 0) {  <span class="comment">// if after subtracting the current</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>                                  <span class="comment">// denomination is it greater than 0 or not</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            <span class="keywordtype">int</span> sub = <a class="code hl_function" href="../../d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a">mincoins</a>(n - coins[i], coins, t, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            ans = std::min(ans, sub + 1);</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        }</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    }</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[n] = ans;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[n];  <span class="comment">// returns minimum number of coins</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>}</div>
+</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>}  <span class="comment">// namespace mincoins_topdown</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>}  <span class="comment">// namespace dynamic_programming</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="foldopen" id="foldopen00074" data-start="{" data-end="}">
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="../../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   74</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="comment">// example 1: number of coins=3 and minimum coins required=3(7,7,1)</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keyword">const</span> int64_t n1 = 15;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="keyword">const</span> int8_t t1 = 3, a1 = 0;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTest 1...&quot;</span>;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    std::vector&lt;int64_t&gt; arr1{1, 7, 10};</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    std::vector&lt;int64_t&gt; dp1(n1 + 1);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(dp1.begin(), dp1.end(), a1);</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    assert(dynamic_programming::mincoins_topdown::mincoins(n1, arr1, t1, dp1) ==</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>           3);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed\n&quot;</span>;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>}</div>
+</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="foldopen" id="foldopen00091" data-start="{" data-end="}">
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"><a class="line" href="../../d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   91</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <a class="code hl_function" href="../../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the test</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>}</div>
+</div>
+<div class="ttc" id="acoin__change__topdown_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d9/d31/coin__change__topdown_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> <a href="#l00074">coin_change_topdown.cpp:74</a></div></div>
+<div class="ttc" id="acoin__change__topdown_8cpp_html_ac816a4ae8a29c156b90377041000929a"><div class="ttname"><a href="../../d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a">dynamic_programming::mincoins_topdown::mincoins</a></div><div class="ttdeci">int64_t mincoins(const T &amp;n, const std::vector&lt; T &gt; &amp;coins, const int16_t &amp;t, std::vector&lt; T &gt; dp)</div><div class="ttdoc">This implementation is for finding minimum number of coins .</div><div class="ttdef"><b>Definition</b> <a href="#l00047">coin_change_topdown.cpp:47</a></div></div>
+<div class="ttc" id="acoin__change__topdown_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00091">coin_change_topdown.cpp:91</a></div></div>
+<div class="ttc" id="adecimal__to__roman__numeral_8cpp_html_a88203bd297e8405160c132faa1187780"><div class="ttname"><a href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a></div><div class="ttdeci">std::string fill(char c, int n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d85/decimal__to__roman__numeral_8cpp_source.html#l00015">decimal_to_roman_numeral.cpp:15</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> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></div>
+<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
+<div class="ttc" id="anamespacemincoins__topdown_html"><div class="ttname"><a href="../../d5/db8/namespacemincoins__topdown.html">mincoins_topdown</a></div><div class="ttdoc">Functions for minimum coin exchange problem.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../d9/d31/coin__change__topdown_8cpp.html">coin_change_topdown.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html b/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html
index 219e7617a..4050d2e0c 100644
--- a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html
+++ b/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: range_queries::heavy_light_decomposition::SG&lt; X &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: range_queries::heavy_light_decomposition::SG&lt; X &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -146,23 +163,20 @@ Private Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:afbf8a9cb9449d5ca844f4e141a801e6a" id="r_afbf8a9cb9449d5ca844f4e141a801e6a"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; X &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afbf8a9cb9449d5ca844f4e141a801e6a">s_tree</a></td></tr>
+<tr class="memitem:afbf8a9cb9449d5ca844f4e141a801e6a" id="r_afbf8a9cb9449d5ca844f4e141a801e6a"><td class="memItemLeft" align="right" valign="top">std::vector&lt; X &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afbf8a9cb9449d5ca844f4e141a801e6a">s_tree</a></td></tr>
 <tr class="memdesc:afbf8a9cb9449d5ca844f4e141a801e6a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Everything here is private, and can only be accessed through the methods, in the derived class (<a class="el" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" title="The Heavy-Light Decomposition class.">HLD</a>)  <br /></td></tr>
 <tr class="separator:afbf8a9cb9449d5ca844f4e141a801e6a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ac6d912bbfafa3a7509f66bbc1729ca25" id="r_ac6d912bbfafa3a7509f66bbc1729ca25"><td class="memItemLeft" align="right" valign="top"><a id="ac6d912bbfafa3a7509f66bbc1729ca25" name="ac6d912bbfafa3a7509f66bbc1729ca25"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>s_size</b></td></tr>
-<tr class="memdesc:ac6d912bbfafa3a7509f66bbc1729ca25"><td class="mdescLeft">&#160;</td><td class="mdescRight">number of leaves in the segment tree <br /></td></tr>
+<tr class="memitem:ac6d912bbfafa3a7509f66bbc1729ca25" id="r_ac6d912bbfafa3a7509f66bbc1729ca25"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac6d912bbfafa3a7509f66bbc1729ca25">s_size</a></td></tr>
+<tr class="memdesc:ac6d912bbfafa3a7509f66bbc1729ca25"><td class="mdescLeft">&#160;</td><td class="mdescRight">number of leaves in the segment tree  <br /></td></tr>
 <tr class="separator:ac6d912bbfafa3a7509f66bbc1729ca25"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa7f93971a9f891e0bbb7023081f379d5" id="r_aa7f93971a9f891e0bbb7023081f379d5"><td class="memItemLeft" align="right" valign="top"><a id="aa7f93971a9f891e0bbb7023081f379d5" name="aa7f93971a9f891e0bbb7023081f379d5"></a>
-X&#160;</td><td class="memItemRight" valign="bottom"><b>sret_init</b> = 0</td></tr>
-<tr class="memdesc:aa7f93971a9f891e0bbb7023081f379d5"><td class="mdescLeft">&#160;</td><td class="mdescRight">inital query return value <br /></td></tr>
+<tr class="memitem:aa7f93971a9f891e0bbb7023081f379d5" id="r_aa7f93971a9f891e0bbb7023081f379d5"><td class="memItemLeft" align="right" valign="top">X&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa7f93971a9f891e0bbb7023081f379d5">sret_init</a> = 0</td></tr>
+<tr class="memdesc:aa7f93971a9f891e0bbb7023081f379d5"><td class="mdescLeft">&#160;</td><td class="mdescRight">inital query return value  <br /></td></tr>
 <tr class="separator:aa7f93971a9f891e0bbb7023081f379d5"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="friends" name="friends"></a>
 Friends</h2></td></tr>
-<tr class="memitem:afcdadbdea1e2391cebbb17d2c1ae2f0b" id="r_afcdadbdea1e2391cebbb17d2c1ae2f0b"><td class="memTemplParams" colspan="2"><a id="afcdadbdea1e2391cebbb17d2c1ae2f0b" name="afcdadbdea1e2391cebbb17d2c1ae2f0b"></a>
-template&lt;typename T &gt; </td></tr>
-<tr class="memitem:afcdadbdea1e2391cebbb17d2c1ae2f0b"><td class="memTemplItemLeft" align="right" valign="top">class&#160;</td><td class="memTemplItemRight" valign="bottom"><b>HLD</b></td></tr>
+<tr class="memitem:afcdadbdea1e2391cebbb17d2c1ae2f0b" id="r_afcdadbdea1e2391cebbb17d2c1ae2f0b"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
+<tr class="memitem:afcdadbdea1e2391cebbb17d2c1ae2f0b"><td class="memTemplItemLeft" align="right" valign="top">class&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#afcdadbdea1e2391cebbb17d2c1ae2f0b">HLD</a></td></tr>
 <tr class="separator:afcdadbdea1e2391cebbb17d2c1ae2f0b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -174,6 +188,8 @@ class range_queries::heavy_light_decomposition::SG&lt; X &gt;</div><p>Segment <a
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00254">254</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="afba5c1225ba04c0025c7786c09ff28f1" name="afba5c1225ba04c0025c7786c09ff28f1"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#afba5c1225ba04c0025c7786c09ff28f1">&#9670;&#160;</a></span>SG()</h2>
@@ -208,19 +224,15 @@ template&lt;typename X &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00282">282</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  282</span>                        {</div>
 <div class="line"><span class="lineno">  283</span>    <a class="code hl_variable" href="#ac6d912bbfafa3a7509f66bbc1729ca25">s_size</a> = size;</div>
-<div class="line"><span class="lineno">  284</span>    <a class="code hl_variable" href="#afbf8a9cb9449d5ca844f4e141a801e6a">s_tree</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/assign.html">assign</a>(2 * <a class="code hl_variable" href="#ac6d912bbfafa3a7509f66bbc1729ca25">s_size</a>, 0ll);</div>
+<div class="line"><span class="lineno">  284</span>    <a class="code hl_variable" href="#afbf8a9cb9449d5ca844f4e141a801e6a">s_tree</a>.assign(2 * <a class="code hl_variable" href="#ac6d912bbfafa3a7509f66bbc1729ca25">s_size</a>, 0ll);</div>
 <div class="line"><span class="lineno">  285</span>  }</div>
-<div class="ttc" id="aassign_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/assign.html">std::vector::assign</a></div><div class="ttdeci">T assign(T... args)</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_ac6d912bbfafa3a7509f66bbc1729ca25"><div class="ttname"><a href="#ac6d912bbfafa3a7509f66bbc1729ca25">range_queries::heavy_light_decomposition::SG::s_size</a></div><div class="ttdeci">int s_size</div><div class="ttdoc">number of leaves in the segment tree</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:263</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_afbf8a9cb9449d5ca844f4e141a801e6a"><div class="ttname"><a href="#afbf8a9cb9449d5ca844f4e141a801e6a">range_queries::heavy_light_decomposition::SG::s_tree</a></div><div class="ttdeci">std::vector&lt; X &gt; s_tree</div><div class="ttdoc">Everything here is private, and can only be accessed through the methods, in the derived class (HLD)</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:262</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_afba5c1225ba04c0025c7786c09ff28f1_cgraph.svg" width="334" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_ac6d912bbfafa3a7509f66bbc1729ca25"><div class="ttname"><a href="#ac6d912bbfafa3a7509f66bbc1729ca25">range_queries::heavy_light_decomposition::SG::s_size</a></div><div class="ttdeci">int s_size</div><div class="ttdoc">number of leaves in the segment tree</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00263">heavy_light_decomposition.cpp:263</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_afbf8a9cb9449d5ca844f4e141a801e6a"><div class="ttname"><a href="#afbf8a9cb9449d5ca844f4e141a801e6a">range_queries::heavy_light_decomposition::SG::s_tree</a></div><div class="ttdeci">std::vector&lt; X &gt; s_tree</div><div class="ttdoc">Everything here is private, and can only be accessed through the methods, in the derived class (HLD)</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00262">heavy_light_decomposition.cpp:262</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Function Documentation</h2>
@@ -262,6 +274,8 @@ template&lt;typename X &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the combined result </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00274">274</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  274</span>{ <span class="keywordflow">return</span> lhs + rhs; }</div>
 </div><!-- fragment -->
 </div>
@@ -304,6 +318,8 @@ template&lt;typename X &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00305">305</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  305</span>                        {</div>
 <div class="line"><span class="lineno">  306</span>    X lhs = <a class="code hl_variable" href="#aa7f93971a9f891e0bbb7023081f379d5">sret_init</a>, rhs = <a class="code hl_variable" href="#aa7f93971a9f891e0bbb7023081f379d5">sret_init</a>;</div>
 <div class="line"><span class="lineno">  307</span>    <span class="keywordflow">for</span> (l += <a class="code hl_variable" href="#ac6d912bbfafa3a7509f66bbc1729ca25">s_size</a>, r += <a class="code hl_variable" href="#ac6d912bbfafa3a7509f66bbc1729ca25">s_size</a> + 1; l &lt; r; l &gt;&gt;= 1, r &gt;&gt;= 1) {</div>
@@ -316,14 +332,9 @@ template&lt;typename X &gt; </div>
 <div class="line"><span class="lineno">  314</span>    }</div>
 <div class="line"><span class="lineno">  315</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="#a41c733f5f5e262b308f7cb95c88c1e74">combine</a>(lhs, rhs);</div>
 <div class="line"><span class="lineno">  316</span>  }</div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_a41c733f5f5e262b308f7cb95c88c1e74"><div class="ttname"><a href="#a41c733f5f5e262b308f7cb95c88c1e74">range_queries::heavy_light_decomposition::SG::combine</a></div><div class="ttdeci">X combine(X lhs, X rhs)</div><div class="ttdoc">Function that specifies the type of operation involved when segments are combined.</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:274</div></div>
-<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_aa7f93971a9f891e0bbb7023081f379d5"><div class="ttname"><a href="#aa7f93971a9f891e0bbb7023081f379d5">range_queries::heavy_light_decomposition::SG::sret_init</a></div><div class="ttdeci">X sret_init</div><div class="ttdoc">inital query return value</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:264</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_a1fda852e6e522707fd97f61cdb0a2591_cgraph.svg" width="350" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_a41c733f5f5e262b308f7cb95c88c1e74"><div class="ttname"><a href="#a41c733f5f5e262b308f7cb95c88c1e74">range_queries::heavy_light_decomposition::SG::combine</a></div><div class="ttdeci">X combine(X lhs, X rhs)</div><div class="ttdoc">Function that specifies the type of operation involved when segments are combined.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00274">heavy_light_decomposition.cpp:274</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_aa7f93971a9f891e0bbb7023081f379d5"><div class="ttname"><a href="#aa7f93971a9f891e0bbb7023081f379d5">range_queries::heavy_light_decomposition::SG::sret_init</a></div><div class="ttdeci">X sret_init</div><div class="ttdoc">inital query return value</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00264">heavy_light_decomposition.cpp:264</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad3b942be27a1b0fe3cff6cb6edf01294" name="ad3b942be27a1b0fe3cff6cb6edf01294"></a>
@@ -364,6 +375,8 @@ template&lt;typename X &gt; </div>
 </dl>
 </li>
 </ul>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00329">329</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  329</span>{ <a class="code hl_variable" href="#aa7f93971a9f891e0bbb7023081f379d5">sret_init</a> = new_sret_init; }</div>
 </div><!-- fragment -->
 </div>
@@ -406,15 +419,74 @@ template&lt;typename X &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00293">293</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  293</span>                          {</div>
 <div class="line"><span class="lineno">  294</span>    <span class="keywordflow">for</span> (p += <a class="code hl_variable" href="#ac6d912bbfafa3a7509f66bbc1729ca25">s_size</a>; p &gt; 0; p &gt;&gt;= 1) {</div>
 <div class="line"><span class="lineno">  295</span>      <a class="code hl_variable" href="#afbf8a9cb9449d5ca844f4e141a801e6a">s_tree</a>[p] += v;</div>
 <div class="line"><span class="lineno">  296</span>    }</div>
 <div class="line"><span class="lineno">  297</span>  }</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Friends And Related Symbol Documentation</h2>
+<a id="afcdadbdea1e2391cebbb17d2c1ae2f0b" name="afcdadbdea1e2391cebbb17d2c1ae2f0b"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#afcdadbdea1e2391cebbb17d2c1ae2f0b">&#9670;&#160;</a></span>HLD</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename X &gt; </div>
+<div class="memtemplate">
+template&lt;typename T &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">friend class <a class="el" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">HLD</a></td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">friend</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00265">265</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
+
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
+<a id="ac6d912bbfafa3a7509f66bbc1729ca25" name="ac6d912bbfafa3a7509f66bbc1729ca25"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ac6d912bbfafa3a7509f66bbc1729ca25">&#9670;&#160;</a></span>s_size</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename X &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int <a class="el" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">range_queries::heavy_light_decomposition::SG</a>&lt; X &gt;::s_size</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>number of leaves in the segment tree </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00263">263</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
+
+</div>
+</div>
 <a id="afbf8a9cb9449d5ca844f4e141a801e6a" name="afbf8a9cb9449d5ca844f4e141a801e6a"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#afbf8a9cb9449d5ca844f4e141a801e6a">&#9670;&#160;</a></span>s_tree</h2>
 
@@ -427,7 +499,7 @@ template&lt;typename X &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;X&gt; <a class="el" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">range_queries::heavy_light_decomposition::SG</a>&lt; X &gt;::s_tree</td>
+          <td class="memname">std::vector&lt;X&gt; <a class="el" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">range_queries::heavy_light_decomposition::SG</a>&lt; X &gt;::s_tree</td>
         </tr>
       </table>
   </td>
@@ -440,10 +512,40 @@ template&lt;typename X &gt; </div>
 <p>Everything here is private, and can only be accessed through the methods, in the derived class (<a class="el" href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" title="The Heavy-Light Decomposition class.">HLD</a>) </p>
 <p>the segment tree, stored as a vector </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00262">262</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
+
+</div>
+</div>
+<a id="aa7f93971a9f891e0bbb7023081f379d5" name="aa7f93971a9f891e0bbb7023081f379d5"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aa7f93971a9f891e0bbb7023081f379d5">&#9670;&#160;</a></span>sret_init</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename X &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">X <a class="el" href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">range_queries::heavy_light_decomposition::SG</a>&lt; X &gt;::sret_init = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>inital query return value </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00264">264</a> of file <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>range_queries/<a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp.html">heavy_light_decomposition.cpp</a></li>
+<li>range_queries/<a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp_source.html">heavy_light_decomposition.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_a1fda852e6e522707fd97f61cdb0a2591_cgraph.map b/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_a1fda852e6e522707fd97f61cdb0a2591_cgraph.map
deleted file mode 100644
index 71b529f32..000000000
--- a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_a1fda852e6e522707fd97f61cdb0a2591_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="range_queries::heavy_light_decomposition::SG::query" name="range_queries::heavy_light_decomposition::SG::query">
-<area shape="rect" id="Node000001" title="Make a range query from node label l to node label r." alt="" coords="5,5,151,61"/>
-<area shape="rect" id="Node000002" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" title="Function that specifies the type of operation involved when segments are combined." alt="" coords="199,5,344,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="151,30,183,30,183,36,151,36"/>
-</map>
diff --git a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_a1fda852e6e522707fd97f61cdb0a2591_cgraph.md5 b/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_a1fda852e6e522707fd97f61cdb0a2591_cgraph.md5
deleted file mode 100644
index c134410ef..000000000
--- a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_a1fda852e6e522707fd97f61cdb0a2591_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-124b3888245617acacca722a74902b22
\ No newline at end of file
diff --git a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_a1fda852e6e522707fd97f61cdb0a2591_cgraph.svg b/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_a1fda852e6e522707fd97f61cdb0a2591_cgraph.svg
deleted file mode 100644
index 253eff034..000000000
--- a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_a1fda852e6e522707fd97f61cdb0a2591_cgraph.svg
+++ /dev/null
@@ -1,69 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::SG::query Pages: 1 -->
-<svg width="262pt" height="50pt"
- viewBox="0.00 0.00 262.00 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>range_queries::heavy_light_decomposition::SG::query</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Make a range query from node label l to node label r.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::query</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="254,-41.75 145,-41.75 145,0 254,0 254,-41.75"/>
-<text text-anchor="start" x="153" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-20.88C117.02,-20.88 125.19,-20.88 133.26,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.03,-24.38 143.03,-20.88 133.03,-17.38 133.03,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_a1fda852e6e522707fd97f61cdb0a2591_cgraph_org.svg b/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_a1fda852e6e522707fd97f61cdb0a2591_cgraph_org.svg
deleted file mode 100644
index c3c2eef84..000000000
--- a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_a1fda852e6e522707fd97f61cdb0a2591_cgraph_org.svg
+++ /dev/null
@@ -1,43 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::SG::query Pages: 1 -->
-<svg width="262pt" height="50pt"
- viewBox="0.00 0.00 262.00 49.75" 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.75)">
-<title>range_queries::heavy_light_decomposition::SG::query</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Make a range query from node label l to node label r.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::query</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="254,-41.75 145,-41.75 145,0 254,0 254,-41.75"/>
-<text text-anchor="start" x="153" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="153" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="199.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-20.88C117.02,-20.88 125.19,-20.88 133.26,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.03,-24.38 143.03,-20.88 133.03,-17.38 133.03,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_afba5c1225ba04c0025c7786c09ff28f1_cgraph.map b/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_afba5c1225ba04c0025c7786c09ff28f1_cgraph.map
deleted file mode 100644
index 790dd231b..000000000
--- a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_afba5c1225ba04c0025c7786c09ff28f1_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="range_queries::heavy_light_decomposition::SG::SG" name="range_queries::heavy_light_decomposition::SG::SG">
-<area shape="rect" id="Node000001" title="Class parameterized constructor. Resizes the and initilizes the data members." alt="" coords="5,5,151,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/assign.html#" title=" " alt="" coords="199,20,328,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="151,30,183,30,183,36,151,36"/>
-</map>
diff --git a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_afba5c1225ba04c0025c7786c09ff28f1_cgraph.md5 b/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_afba5c1225ba04c0025c7786c09ff28f1_cgraph.md5
deleted file mode 100644
index 307b9b3a2..000000000
--- a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_afba5c1225ba04c0025c7786c09ff28f1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-543b049ad14957c5b49a784277c066dd
\ No newline at end of file
diff --git a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_afba5c1225ba04c0025c7786c09ff28f1_cgraph.svg b/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_afba5c1225ba04c0025c7786c09ff28f1_cgraph.svg
deleted file mode 100644
index 6492f13b5..000000000
--- a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_afba5c1225ba04c0025c7786c09ff28f1_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::SG::SG Pages: 1 -->
-<svg width="250pt" height="50pt"
- viewBox="0.00 0.00 250.00 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>range_queries::heavy_light_decomposition::SG::SG</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Class parameterized constructor. Resizes the and initilizes the data members.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::SG</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/assign.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242,-30.5 145,-30.5 145,-11.25 242,-11.25 242,-30.5"/>
-<text text-anchor="middle" x="193.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::assign</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.25,-20.88C117.11,-20.88 125.24,-20.88 133.2,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.18,-24.38 143.18,-20.88 133.18,-17.38 133.18,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_afba5c1225ba04c0025c7786c09ff28f1_cgraph_org.svg b/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_afba5c1225ba04c0025c7786c09ff28f1_cgraph_org.svg
deleted file mode 100644
index 0191d3068..000000000
--- a/d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g_afba5c1225ba04c0025c7786c09ff28f1_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::heavy_light_decomposition::SG::SG Pages: 1 -->
-<svg width="250pt" height="50pt"
- viewBox="0.00 0.00 250.00 49.75" 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.75)">
-<title>range_queries::heavy_light_decomposition::SG::SG</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Class parameterized constructor. Resizes the and initilizes the data members.">
-<polygon fill="#999999" stroke="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::SG</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/assign.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242,-30.5 145,-30.5 145,-11.25 242,-11.25 242,-30.5"/>
-<text text-anchor="middle" x="193.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::assign</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.25,-20.88C117.11,-20.88 125.24,-20.88 133.2,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.18,-24.38 143.18,-20.88 133.18,-17.38 133.18,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d37/inverse__fast__fourier__transform_8cpp.html b/d9/d37/inverse__fast__fourier__transform_8cpp.html
index c0bee760d..8f83b8aad 100644
--- a/d9/d37/inverse__fast__fourier__transform_8cpp.html
+++ b/d9/d37/inverse__fast__fourier__transform_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/inverse_fast_fourier_transform.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/inverse_fast_fourier_transform.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for inverse_fast_fourier_transform.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d57/inverse__fast__fourier__transform_8cpp__incl.svg" width="512" height="126"><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">
+</div>
+<p><a href="../../d9/d37/inverse__fast__fourier__transform_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr>
@@ -133,7 +152,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:aee56dc85997b8cd42bad71a5d6bd2d93" id="r_aee56dc85997b8cd42bad71a5d6bd2d93"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">numerical_methods::InverseFastFourierTransform</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; *p, uint8_t n)</td></tr>
+<tr class="memitem:aee56dc85997b8cd42bad71a5d6bd2d93" id="r_aee56dc85997b8cd42bad71a5d6bd2d93"><td class="memItemLeft" align="right" valign="top">std::complex&lt; double &gt; *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">numerical_methods::InverseFastFourierTransform</a> (std::complex&lt; double &gt; *p, uint8_t n)</td></tr>
 <tr class="memdesc:aee56dc85997b8cd42bad71a5d6bd2d93"><td class="mdescLeft">&#160;</td><td class="mdescRight">InverseFastFourierTransform is a recursive function which returns list of complex numbers.  <br /></td></tr>
 <tr class="separator:aee56dc85997b8cd42bad71a5d6bd2d93"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -146,6 +165,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a href="https://www.geeksforgeeks.org/python-inverse-fast-fourier-transformation/" target="_blank">An inverse fast Fourier transform (IFFT)</a> is an algorithm that computes the inverse fourier transform. </p>
 <p>This algorithm has an application in use case scenario where a user wants find coefficients of a function in a short time by just using points generated by DFT. Time complexity this algorithm computes the IDFT in O(nlogn) time in comparison to traditional O(n^2). </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/ameyachawlaggsipu" target="_blank">Ameya Chawla</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/d37/inverse__fast__fourier__transform_8cpp_source.html">inverse_fast_fourier_transform.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="abf9e6b7e6f15df4b525a2e7705ba3089" name="abf9e6b7e6f15df4b525a2e7705ba3089"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#abf9e6b7e6f15df4b525a2e7705ba3089">&#9670;&#160;</a></span>main()</h2>
@@ -175,18 +196,15 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d37/inverse__fast__fourier__transform_8cpp_source.html#l00157">157</a> of file <a class="el" href="../../d9/d37/inverse__fast__fourier__transform_8cpp_source.html">inverse_fast_fourier_transform.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  157</span>                                       {</div>
 <div class="line"><span class="lineno">  158</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">//  run self-test implementations</span></div>
 <div class="line"><span class="lineno">  159</span>             <span class="comment">//  with 2 defined test cases</span></div>
 <div class="line"><span class="lineno">  160</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  161</span>}</div>
-<div class="ttc" id="ainverse__fast__fourier__transform_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> inverse_fast_fourier_transform.cpp:101</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d37/inverse__fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg" width="570" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ainverse__fast__fourier__transform_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d37/inverse__fast__fourier__transform_8cpp_source.html#l00101">inverse_fast_fourier_transform.cpp:101</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -220,11 +238,13 @@ Here is the call graph for this function:</div>
 <p>True Answer for test case 2</p>
 <p>Comparing for both real and imaginary values for test case 1</p>
 <p>Comparing for both real and imaginary values for test case 2</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d37/inverse__fast__fourier__transform_8cpp_source.html#l00101">101</a> of file <a class="el" href="../../d9/d37/inverse__fast__fourier__transform_8cpp_source.html">inverse_fast_fourier_transform.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  101</span>                   {</div>
 <div class="line"><span class="lineno">  102</span>    <span class="comment">/* descriptions of the following test */</span></div>
 <div class="line"><span class="lineno">  103</span> </div>
-<div class="line"><span class="lineno">  104</span>    <span class="keyword">auto</span> *t1 = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[2];  <span class="comment">/// Test case 1</span></div>
-<div class="line"><span class="lineno">  105</span>    <span class="keyword">auto</span> *t2 = <span class="keyword">new</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>[4];  <span class="comment">/// Test case 2</span></div>
+<div class="line"><span class="lineno">  104</span>    <span class="keyword">auto</span> *t1 = <span class="keyword">new</span> std::complex&lt;double&gt;[2];  </div>
+<div class="line"><span class="lineno">  105</span>    <span class="keyword">auto</span> *t2 = <span class="keyword">new</span> std::complex&lt;double&gt;[4];  </div>
 <div class="line"><span class="lineno">  106</span> </div>
 <div class="line"><span class="lineno">  107</span>    t1[0] = {3, 0};</div>
 <div class="line"><span class="lineno">  108</span>    t1[1] = {-1, 0};</div>
@@ -235,48 +255,38 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  113</span> </div>
 <div class="line"><span class="lineno">  114</span>    uint8_t n1 = 2;</div>
 <div class="line"><span class="lineno">  115</span>    uint8_t n2 = 4;</div>
-<div class="line"><span class="lineno">  116</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::complex&lt;double&gt;</a>&gt; r1 = {</div>
-<div class="line"><span class="lineno">  117</span>        {1, 0}, {2, 0}};  <span class="comment">/// True Answer for test case 1</span></div>
+<div class="line"><span class="lineno">  116</span>    std::vector&lt;std::complex&lt;double&gt;&gt; r1 = {</div>
+<div class="line"><span class="lineno">  117</span>        {1, 0}, {2, 0}};  </div>
 <div class="line"><span class="lineno">  118</span> </div>
-<div class="line"><span class="lineno">  119</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::complex&lt;double&gt;</a>&gt; r2 = {</div>
-<div class="line"><span class="lineno">  120</span>        {1, 0}, {2, 0}, {3, 0}, {4, 0}};  <span class="comment">/// True Answer for test case 2</span></div>
+<div class="line"><span class="lineno">  119</span>    std::vector&lt;std::complex&lt;double&gt;&gt; r2 = {</div>
+<div class="line"><span class="lineno">  120</span>        {1, 0}, {2, 0}, {3, 0}, {4, 0}};  </div>
 <div class="line"><span class="lineno">  121</span> </div>
-<div class="line"><span class="lineno">  122</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *o1 =</div>
+<div class="line"><span class="lineno">  122</span>    std::complex&lt;double&gt; *o1 =</div>
 <div class="line"><span class="lineno">  123</span>        <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">numerical_methods::InverseFastFourierTransform</a>(t1, n1);</div>
 <div class="line"><span class="lineno">  124</span> </div>
-<div class="line"><span class="lineno">  125</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> *o2 =</div>
+<div class="line"><span class="lineno">  125</span>    std::complex&lt;double&gt; *o2 =</div>
 <div class="line"><span class="lineno">  126</span>        <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">numerical_methods::InverseFastFourierTransform</a>(t2, n2);</div>
 <div class="line"><span class="lineno">  127</span> </div>
 <div class="line"><span class="lineno">  128</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; n1; i++) {</div>
 <div class="line"><span class="lineno">  129</span>        assert((r1[i].real() - o1[i].real() &lt; 0.000000000001) &amp;&amp;</div>
 <div class="line"><span class="lineno">  130</span>               (r1[i].imag() - o1[i].imag() &lt;</div>
-<div class="line"><span class="lineno">  131</span>                0.000000000001));  <span class="comment">/// Comparing for both real and imaginary</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  132</span><span class="comment">                                   /// values for test case 1</span></div>
-<div class="line"><span class="lineno">  133</span><span class="comment"></span>    }</div>
+<div class="line"><span class="lineno">  131</span>                0.000000000001));  </div>
+<div class="line"><span class="lineno">  133</span>    }</div>
 <div class="line"><span class="lineno">  134</span> </div>
 <div class="line"><span class="lineno">  135</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; n2; i++) {</div>
 <div class="line"><span class="lineno">  136</span>        assert((r2[i].real() - o2[i].real() &lt; 0.000000000001) &amp;&amp;</div>
 <div class="line"><span class="lineno">  137</span>               (r2[i].imag() - o2[i].imag() &lt;</div>
-<div class="line"><span class="lineno">  138</span>                0.000000000001));  <span class="comment">/// Comparing for both real and imaginary</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  139</span><span class="comment">                                   /// values for test case 2</span></div>
-<div class="line"><span class="lineno">  140</span><span class="comment"></span>    }</div>
+<div class="line"><span class="lineno">  138</span>                0.000000000001));  </div>
+<div class="line"><span class="lineno">  140</span>    }</div>
 <div class="line"><span class="lineno">  141</span> </div>
 <div class="line"><span class="lineno">  142</span>    <span class="keyword">delete</span>[] t1;</div>
 <div class="line"><span class="lineno">  143</span>    <span class="keyword">delete</span>[] t2;</div>
 <div class="line"><span class="lineno">  144</span>    <span class="keyword">delete</span>[] o1;</div>
 <div class="line"><span class="lineno">  145</span>    <span class="keyword">delete</span>[] o2;</div>
-<div class="line"><span class="lineno">  146</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  146</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  147</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="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div></div>
-<div class="ttc" id="anamespacenumerical__methods_html_aee56dc85997b8cd42bad71a5d6bd2d93"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">numerical_methods::InverseFastFourierTransform</a></div><div class="ttdeci">std::complex&lt; double &gt; * InverseFastFourierTransform(std::complex&lt; double &gt; *p, uint8_t n)</div><div class="ttdoc">InverseFastFourierTransform is a recursive function which returns list of complex numbers.</div><div class="ttdef"><b>Definition</b> inverse_fast_fourier_transform.cpp:34</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d37/inverse__fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="472" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacenumerical__methods_html_aee56dc85997b8cd42bad71a5d6bd2d93"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">numerical_methods::InverseFastFourierTransform</a></div><div class="ttdeci">std::complex&lt; double &gt; * InverseFastFourierTransform(std::complex&lt; double &gt; *p, uint8_t n)</div><div class="ttdoc">InverseFastFourierTransform is a recursive function which returns list of complex numbers.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d37/inverse__fast__fourier__transform_8cpp_source.html#l00034">inverse_fast_fourier_transform.cpp:34</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/d37/inverse__fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d9/d37/inverse__fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index aef04bcae..000000000
--- a/d9/d37/inverse__fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,37,49,62"/>
-<area shape="rect" id="Node000002" href="$d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93" title="InverseFastFourierTransform is a recursive function which returns list of complex numbers." alt="" coords="97,29,286,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,47,81,47,81,52,49,52"/>
-<area shape="poly" id="edge3_Node000002_Node000002" title=" " alt="" coords="160,29,158,19,163,11,174,5,191,3,209,5,220,11,218,16,208,10,191,8,176,10,167,14,163,20,165,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/imag.html#" title=" " alt="" coords="334,12,466,37"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="286,36,318,32,319,37,286,41"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/real.html#" title=" " alt="" coords="338,61,463,86"/>
-<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="286,58,322,62,322,67,286,63"/>
-</map>
diff --git a/d9/d37/inverse__fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d9/d37/inverse__fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 000531134..000000000
--- a/d9/d37/inverse__fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-889acf6817b1bdf20755e500bf32d134
\ No newline at end of file
diff --git a/d9/d37/inverse__fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d9/d37/inverse__fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index fff692fd8..000000000
--- a/d9/d37/inverse__fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="354pt" height="69pt"
- viewBox="0.00 0.00 353.75 68.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64.88)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93" target="_top" xlink:title="InverseFastFourierTransform is a recursive function which returns list of complex numbers.">
-<polygon fill="white" stroke="#666666" points="210.5,-42.88 68.5,-42.88 68.5,-12.37 210.5,-12.37 210.5,-42.88"/>
-<text text-anchor="start" x="76.5" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="139.5" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">InverseFastFourierTransform</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.61,-27.62C39.27,-27.62 47.62,-27.62 56.7,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.55,-31.13 66.55,-27.63 56.55,-24.13 56.55,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.66,-43.36C113.2,-52.43 120.48,-60.88 139.5,-60.88 149.9,-60.88 156.79,-58.35 160.17,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.63,-55.18 161.18,-44.87 156.66,-54.45 163.63,-55.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="345.75,-56.25 246.5,-56.25 246.5,-37 345.75,-37 345.75,-56.25"/>
-<text text-anchor="middle" x="296.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M210.57,-36.24C218.63,-37.23 226.79,-38.23 234.7,-39.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="234.21,-42.67 244.57,-40.41 235.07,-35.72 234.21,-42.67"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="343.12,-19.25 249.12,-19.25 249.12,0 343.12,0 343.12,-19.25"/>
-<text text-anchor="middle" x="296.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M210.57,-19.47C219.57,-18.42 228.71,-17.36 237.48,-16.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.73,-19.83 247.26,-15.2 236.92,-12.88 237.73,-19.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d37/inverse__fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d9/d37/inverse__fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 0104d0c14..000000000
--- a/d9/d37/inverse__fast__fourier__transform_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="354pt" height="69pt"
- viewBox="0.00 0.00 353.75 68.88" 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 64.88)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93" target="_top" xlink:title="InverseFastFourierTransform is a recursive function which returns list of complex numbers.">
-<polygon fill="white" stroke="#666666" points="210.5,-42.88 68.5,-42.88 68.5,-12.37 210.5,-12.37 210.5,-42.88"/>
-<text text-anchor="start" x="76.5" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="139.5" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">InverseFastFourierTransform</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.61,-27.62C39.27,-27.62 47.62,-27.62 56.7,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.55,-31.13 66.55,-27.63 56.55,-24.13 56.55,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.66,-43.36C113.2,-52.43 120.48,-60.88 139.5,-60.88 149.9,-60.88 156.79,-58.35 160.17,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.63,-55.18 161.18,-44.87 156.66,-54.45 163.63,-55.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="345.75,-56.25 246.5,-56.25 246.5,-37 345.75,-37 345.75,-56.25"/>
-<text text-anchor="middle" x="296.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M210.57,-36.24C218.63,-37.23 226.79,-38.23 234.7,-39.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="234.21,-42.67 244.57,-40.41 235.07,-35.72 234.21,-42.67"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="343.12,-19.25 249.12,-19.25 249.12,0 343.12,0 343.12,-19.25"/>
-<text text-anchor="middle" x="296.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M210.57,-19.47C219.57,-18.42 228.71,-17.36 237.48,-16.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="237.73,-19.83 247.26,-15.2 236.92,-12.88 237.73,-19.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d37/inverse__fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map b/d9/d37/inverse__fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map
deleted file mode 100644
index 0e6a904df..000000000
--- a/d9/d37/inverse__fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,37,55,62"/>
-<area shape="rect" id="Node000002" href="$d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,37,146,62"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,47,87,47,87,52,55,52"/>
-<area shape="rect" id="Node000003" href="$d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93" title="InverseFastFourierTransform is a recursive function which returns list of complex numbers." alt="" coords="194,29,383,70"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,47,178,47,178,52,146,52"/>
-<area shape="poly" id="edge4_Node000003_Node000003" title=" " alt="" coords="257,29,255,19,261,11,272,5,289,3,307,5,318,11,315,16,305,10,289,8,273,10,264,14,261,20,262,28"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/imag.html#" title=" " alt="" coords="431,12,564,37"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="383,36,415,32,416,37,384,41"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/real.html#" title=" " alt="" coords="435,61,560,86"/>
-<area shape="poly" id="edge5_Node000003_Node000005" title=" " alt="" coords="384,58,420,62,419,67,383,63"/>
-</map>
diff --git a/d9/d37/inverse__fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5 b/d9/d37/inverse__fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
deleted file mode 100644
index 29027bcb6..000000000
--- a/d9/d37/inverse__fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8df90c8a53647cad89043b1f35cc1a32
\ No newline at end of file
diff --git a/d9/d37/inverse__fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg b/d9/d37/inverse__fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
deleted file mode 100644
index b7c66ae68..000000000
--- a/d9/d37/inverse__fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
+++ /dev/null
@@ -1,129 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="427pt" height="69pt"
- viewBox="0.00 0.00 426.75 68.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93" target="_top" xlink:title="InverseFastFourierTransform is a recursive function which returns list of complex numbers.">
-<polygon fill="white" stroke="#666666" points="283.5,-42.88 141.5,-42.88 141.5,-12.37 283.5,-12.37 283.5,-42.88"/>
-<text text-anchor="start" x="149.5" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="212.5" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">InverseFastFourierTransform</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.61,-27.62C112.27,-27.62 120.62,-27.62 129.7,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.55,-31.13 139.55,-27.63 129.55,-24.13 129.55,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.66,-43.36C186.2,-52.43 193.48,-60.88 212.5,-60.88 222.9,-60.88 229.79,-58.35 233.17,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.63,-55.18 234.18,-44.87 229.66,-54.45 236.63,-55.18"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="418.75,-56.25 319.5,-56.25 319.5,-37 418.75,-37 418.75,-56.25"/>
-<text text-anchor="middle" x="369.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M283.57,-36.24C291.63,-37.23 299.79,-38.23 307.7,-39.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.21,-42.67 317.57,-40.41 308.07,-35.72 307.21,-42.67"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="416.12,-19.25 322.12,-19.25 322.12,0 416.12,0 416.12,-19.25"/>
-<text text-anchor="middle" x="369.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge5_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge5_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M283.57,-19.47C292.57,-18.42 301.71,-17.36 310.48,-16.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="310.73,-19.83 320.26,-15.2 309.92,-12.88 310.73,-19.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d37/inverse__fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg b/d9/d37/inverse__fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg
deleted file mode 100644
index 8997c855d..000000000
--- a/d9/d37/inverse__fast__fourier__transform_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="427pt" height="69pt"
- viewBox="0.00 0.00 426.75 68.88" 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 64.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93" target="_top" xlink:title="InverseFastFourierTransform is a recursive function which returns list of complex numbers.">
-<polygon fill="white" stroke="#666666" points="283.5,-42.88 141.5,-42.88 141.5,-12.37 283.5,-12.37 283.5,-42.88"/>
-<text text-anchor="start" x="149.5" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="212.5" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">InverseFastFourierTransform</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.61,-27.62C112.27,-27.62 120.62,-27.62 129.7,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.55,-31.13 139.55,-27.63 129.55,-24.13 129.55,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.66,-43.36C186.2,-52.43 193.48,-60.88 212.5,-60.88 222.9,-60.88 229.79,-58.35 233.17,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.63,-55.18 234.18,-44.87 229.66,-54.45 236.63,-55.18"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="418.75,-56.25 319.5,-56.25 319.5,-37 418.75,-37 418.75,-56.25"/>
-<text text-anchor="middle" x="369.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M283.57,-36.24C291.63,-37.23 299.79,-38.23 307.7,-39.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.21,-42.67 317.57,-40.41 308.07,-35.72 307.21,-42.67"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="416.12,-19.25 322.12,-19.25 322.12,0 416.12,0 416.12,-19.25"/>
-<text text-anchor="middle" x="369.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge5_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge5_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M283.57,-19.47C292.57,-18.42 301.71,-17.36 310.48,-16.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="310.73,-19.83 320.26,-15.2 309.92,-12.88 310.73,-19.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d37/inverse__fast__fourier__transform_8cpp_source.html b/d9/d37/inverse__fast__fourier__transform_8cpp_source.html
new file mode 100644
index 000000000..70a7fa6ee
--- /dev/null
+++ b/d9/d37/inverse__fast__fourier__transform_8cpp_source.html
@@ -0,0 +1,267 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/inverse_fast_fourier_transform.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d37/inverse__fast__fourier__transform_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">inverse_fast_fourier_transform.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/d37/inverse__fast__fourier__transform_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cmath&gt;</span>     </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;complex&gt;</span>   </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a> {</div>
+<div class="foldopen" id="foldopen00034" data-start="{" data-end="}">
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">   34</a></span>std::complex&lt;double&gt; *<a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">InverseFastFourierTransform</a>(std::complex&lt;double&gt; *p,</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>                                                  uint8_t n) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">if</span> (n == 1) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        <span class="keywordflow">return</span> p;  </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    }</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordtype">double</span> pi = 2 * asin(1.0);  </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    std::complex&lt;double&gt; om = std::complex&lt;double&gt;(</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        cos(2 * pi / n), sin(2 * pi / n));  </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    om.real(om.real() / n);  </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    om.imag(om.imag() / n);  </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keyword">auto</span> *pe = <span class="keyword">new</span> std::complex&lt;double&gt;[n / 2];  </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keyword">auto</span> *po = <span class="keyword">new</span> std::complex&lt;double&gt;[n / 2];  </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordtype">int</span> k1 = 0, k2 = 0;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <span class="keywordflow">if</span> (j % 2 == 0) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            pe[k1++] = p[j];  </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>            po[k2++] = p[j];  </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        }</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    }</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    std::complex&lt;double&gt; *ye =</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">InverseFastFourierTransform</a>(pe, n / 2);  </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    std::complex&lt;double&gt; *yo =</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">InverseFastFourierTransform</a>(po, n / 2);  </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keyword">auto</span> *y = <span class="keyword">new</span> std::complex&lt;double&gt;[n];  </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    k1 = 0, k2 = 0;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n / 2; i++) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        y[i] =</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            ye[k1] + pow(om, i) * yo[k2];  </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        y[i + n / 2] =</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>            ye[k1] - pow(om, i) * yo[k2];  </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        k1++;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        k2++;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    }</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">if</span> (n != 2) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keyword">delete</span>[] pe;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        <span class="keyword">delete</span>[] po;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    }</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="keyword">delete</span>[] ye;  </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keyword">delete</span>[] yo;  </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keywordflow">return</span> y;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>}</div>
+</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>}  <span class="comment">// namespace numerical_methods</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="foldopen" id="foldopen00101" data-start="{" data-end="}">
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"><a class="line" href="../../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  101</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="comment">/* descriptions of the following test */</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="keyword">auto</span> *t1 = <span class="keyword">new</span> std::complex&lt;double&gt;[2];  </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="keyword">auto</span> *t2 = <span class="keyword">new</span> std::complex&lt;double&gt;[4];  </div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    t1[0] = {3, 0};</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    t1[1] = {-1, 0};</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    t2[0] = {10, 0};</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    t2[1] = {-2, -2};</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    t2[2] = {-2, 0};</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    t2[3] = {-2, 2};</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    uint8_t n1 = 2;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    uint8_t n2 = 4;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::vector&lt;std::complex&lt;double&gt;&gt; r1 = {</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        {1, 0}, {2, 0}};  </div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    std::vector&lt;std::complex&lt;double&gt;&gt; r2 = {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        {1, 0}, {2, 0}, {3, 0}, {4, 0}};  </div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span> </div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    std::complex&lt;double&gt; *o1 =</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">numerical_methods::InverseFastFourierTransform</a>(t1, n1);</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    std::complex&lt;double&gt; *o2 =</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">numerical_methods::InverseFastFourierTransform</a>(t2, n2);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span> </div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; n1; i++) {</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        assert((r1[i].real() - o1[i].real() &lt; 0.000000000001) &amp;&amp;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>               (r1[i].imag() - o1[i].imag() &lt;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>                0.000000000001));  </div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    }</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <span class="keywordflow">for</span> (uint8_t i = 0; i &lt; n2; i++) {</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        assert((r2[i].real() - o2[i].real() &lt; 0.000000000001) &amp;&amp;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>               (r2[i].imag() - o2[i].imag() &lt;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>                0.000000000001));  </div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    }</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    <span class="keyword">delete</span>[] t1;</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <span class="keyword">delete</span>[] t2;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <span class="keyword">delete</span>[] o1;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <span class="keyword">delete</span>[] o2;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>}</div>
+</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span> </div>
+<div class="foldopen" id="foldopen00157" data-start="{" data-end="}">
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"><a class="line" href="../../d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089">  157</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> <span class="keyword">const</span> *argv[]) {</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    <a class="code hl_function" href="../../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">//  run self-test implementations</span></div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>             <span class="comment">//  with 2 defined test cases</span></div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>}</div>
+</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="ainverse__fast__fourier__transform_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d9/d37/inverse__fast__fourier__transform_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> <a href="#l00101">inverse_fast_fourier_transform.cpp:101</a></div></div>
+<div class="ttc" id="anamespacenumerical__methods_html"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacenumerical__methods_html_aee56dc85997b8cd42bad71a5d6bd2d93"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93">numerical_methods::InverseFastFourierTransform</a></div><div class="ttdeci">std::complex&lt; double &gt; * InverseFastFourierTransform(std::complex&lt; double &gt; *p, uint8_t n)</div><div class="ttdoc">InverseFastFourierTransform is a recursive function which returns list of complex numbers.</div><div class="ttdef"><b>Definition</b> <a href="#l00034">inverse_fast_fourier_transform.cpp:34</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../d9/d37/inverse__fast__fourier__transform_8cpp.html">inverse_fast_fourier_transform.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/d44/magic__number_8cpp.html b/d9/d44/magic__number_8cpp.html
index d4718dc3f..3650710b2 100644
--- a/d9/d44/magic__number_8cpp.html
+++ b/d9/d44/magic__number_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/magic_number.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/magic_number.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for magic_number.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/dad/magic__number_8cpp__incl.svg" width="255" height="111"><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">
+</div>
+<p><a href="../../d9/d44/magic__number_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -142,6 +161,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A simple program to check if the given number is a magic number or not. A number is said to be a magic number, if the sum of its digits are calculated till a single digit recursively by adding the sum of the digits after every addition. If the single digit comes out to be 1,then the number is a magic number. </p>
 <p>This is a shortcut method to verify Magic Number. On dividing the input by 9, if the remainder is 1 then the number is a magic number else not. The divisibility rule of 9 says that a number is divisible by 9 if the sum of its digits are also divisible by 9. Therefore, if a number is divisible by 9, then, recursively, all the digit sums are also divisible by 9. The final digit sum is always 9. An increase of 1 in the original number will increase the ultimate value by 1, making it 10 and the ultimate sum will be 1, thus verifying that it is a magic number. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/neha-hasija17" target="_blank">Neha Hasija</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/d44/magic__number_8cpp_source.html">magic_number.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -160,17 +181,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d44/magic__number_8cpp_source.html#l00078">78</a> of file <a class="el" href="../../d9/d44/magic__number_8cpp_source.html">magic_number.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   78</span>           {</div>
 <div class="line"><span class="lineno">   79</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// execute the tests</span></div>
 <div class="line"><span class="lineno">   80</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   81</span>}</div>
-<div class="ttc" id="amagic__number_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Test function.</div><div class="ttdef"><b>Definition</b> magic_number.cpp:52</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="350" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amagic__number_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d44/magic__number_8cpp_source.html#l00052">magic_number.cpp:52</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -198,35 +216,31 @@ 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">   52</span>                    {</div>
-<div class="line"><span class="lineno">   53</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1:\t n=60\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   54</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a>(60) == <span class="keyword">false</span>);</div>
-<div class="line"><span class="lineno">   55</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   56</span> </div>
-<div class="line"><span class="lineno">   57</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2:\t n=730\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   58</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a>(730) == <span class="keyword">true</span>);</div>
-<div class="line"><span class="lineno">   59</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   60</span> </div>
-<div class="line"><span class="lineno">   61</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3:\t n=0\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   62</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a>(0) == <span class="keyword">false</span>);</div>
-<div class="line"><span class="lineno">   63</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   64</span> </div>
-<div class="line"><span class="lineno">   65</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 4:\t n=479001600\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   66</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a>(479001600) == <span class="keyword">false</span>);</div>
-<div class="line"><span class="lineno">   67</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   68</span> </div>
-<div class="line"><span class="lineno">   69</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 5:\t n=-35\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   70</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a>(-35) == <span class="keyword">false</span>);</div>
-<div class="line"><span class="lineno">   71</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   72</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="anamespacemath_html_a8d8e81a7cd59644b311ef9adb268f5f0"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a></div><div class="ttdeci">bool magic_number(const uint64_t &amp;n)</div><div class="ttdef"><b>Definition</b> magic_number.cpp:33</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="252" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d9/d44/magic__number_8cpp_source.html#l00052">52</a> of file <a class="el" href="../../d9/d44/magic__number_8cpp_source.html">magic_number.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   52</span>                    {</div>
+<div class="line"><span class="lineno">   53</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1:\t n=60\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   54</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a>(60) == <span class="keyword">false</span>);</div>
+<div class="line"><span class="lineno">   55</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   56</span> </div>
+<div class="line"><span class="lineno">   57</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2:\t n=730\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   58</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a>(730) == <span class="keyword">true</span>);</div>
+<div class="line"><span class="lineno">   59</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   60</span> </div>
+<div class="line"><span class="lineno">   61</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3:\t n=0\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   62</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a>(0) == <span class="keyword">false</span>);</div>
+<div class="line"><span class="lineno">   63</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   64</span> </div>
+<div class="line"><span class="lineno">   65</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4:\t n=479001600\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   66</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a>(479001600) == <span class="keyword">false</span>);</div>
+<div class="line"><span class="lineno">   67</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   68</span> </div>
+<div class="line"><span class="lineno">   69</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 5:\t n=-35\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   70</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a>(-35) == <span class="keyword">false</span>);</div>
+<div class="line"><span class="lineno">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   72</span>}</div>
+<div class="ttc" id="anamespacemath_html_a8d8e81a7cd59644b311ef9adb268f5f0"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a></div><div class="ttdeci">bool magic_number(const uint64_t &amp;n)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d44/magic__number_8cpp_source.html#l00033">magic_number.cpp:33</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index 59a2480f9..000000000
--- a/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Test function." alt="" coords="5,5,56,31"/>
-<area shape="rect" id="Node000002" href="$dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0" title=" " alt="" coords="104,5,247,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,16,88,16,88,21,56,21"/>
-</map>
diff --git a/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 5fbe47945..000000000
--- a/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f9a2450f53dad1455b030bddd95bcf41
\ No newline at end of file
diff --git a/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index ce98cd25a..000000000
--- a/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="189pt" height="27pt"
- viewBox="0.00 0.00 189.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test function.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="181.25,-19.25 73.75,-19.25 73.75,0 181.25,0 181.25,-19.25"/>
-<text text-anchor="middle" x="127.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::magic_number</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-9.62C44.9,-9.62 53.27,-9.62 62.07,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.85,-13.13 71.85,-9.63 61.85,-6.13 61.85,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index be7eebb5d..000000000
--- a/d9/d44/magic__number_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="189pt" height="27pt"
- viewBox="0.00 0.00 189.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test function.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="181.25,-19.25 73.75,-19.25 73.75,0 181.25,0 181.25,-19.25"/>
-<text text-anchor="middle" x="127.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::magic_number</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-9.62C44.9,-9.62 53.27,-9.62 62.07,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.85,-13.13 71.85,-9.63 61.85,-6.13 61.85,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 0b2bfdf21..000000000
--- a/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Test function." alt="" coords="103,5,153,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,88,16,88,21,55,21"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0" title=" " alt="" coords="201,5,344,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,16,185,16,185,21,153,21"/>
-</map>
diff --git a/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 153ee378d..000000000
--- a/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-668b8d343d19e62be2e85c78ca71d52b
\ No newline at end of file
diff --git a/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 9599e8ab8..000000000
--- a/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="262pt" height="27pt"
- viewBox="0.00 0.00 262.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Test function.">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-9.62C44.55,-9.62 53.37,-9.62 61.69,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-13.13 71.43,-9.63 61.43,-6.13 61.43,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.25,-19.25 146.75,-19.25 146.75,0 254.25,0 254.25,-19.25"/>
-<text text-anchor="middle" x="200.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::magic_number</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-9.62C117.9,-9.62 126.27,-9.62 135.07,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.85,-13.13 144.85,-9.63 134.85,-6.13 134.85,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index c18980a91..000000000
--- a/d9/d44/magic__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="262pt" height="27pt"
- viewBox="0.00 0.00 262.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Test function.">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-9.62C44.55,-9.62 53.37,-9.62 61.69,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-13.13 71.43,-9.63 61.43,-6.13 61.43,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.25,-19.25 146.75,-19.25 146.75,0 254.25,0 254.25,-19.25"/>
-<text text-anchor="middle" x="200.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::magic_number</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-9.62C117.9,-9.62 126.27,-9.62 135.07,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.85,-13.13 144.85,-9.63 134.85,-6.13 134.85,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d44/magic__number_8cpp_source.html b/d9/d44/magic__number_8cpp_source.html
new file mode 100644
index 000000000..26249e5a0
--- /dev/null
+++ b/d9/d44/magic__number_8cpp_source.html
@@ -0,0 +1,194 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/magic_number.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d44/magic__number_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">magic_number.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/d44/magic__number_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="foldopen" id="foldopen00033" data-start="{" data-end="}">
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">   33</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">magic_number</a>(<span class="keyword">const</span> uint64_t &amp;n) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">if</span> (n &lt;= 0) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    }</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="comment">// result stores the modulus of @param n with 9</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    uint64_t result = n % 9;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="comment">// if result is 1 then the number is a magic number else not</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">if</span> (result == 1) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    }</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>}</div>
+</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="foldopen" id="foldopen00052" data-start="{" data-end="}">
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">   52</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1:\t n=60\n&quot;</span>;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a>(60) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2:\t n=730\n&quot;</span>;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a>(730) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3:\t n=0\n&quot;</span>;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a>(0) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4:\t n=479001600\n&quot;</span>;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a>(479001600) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 5:\t n=-35\n&quot;</span>;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a>(-35) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>}</div>
+</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="foldopen" id="foldopen00078" data-start="{" data-end="}">
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"><a class="line" href="../../d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   78</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <a class="code hl_function" href="../../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// execute the tests</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>}</div>
+</div>
+<div class="ttc" id="amagic__number_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Test function.</div><div class="ttdef"><b>Definition</b> <a href="#l00052">magic_number.cpp:52</a></div></div>
+<div class="ttc" id="amagic__number_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00078">magic_number.cpp:78</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_a8d8e81a7cd59644b311ef9adb268f5f0"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a></div><div class="ttdeci">bool magic_number(const uint64_t &amp;n)</div><div class="ttdef"><b>Definition</b> <a href="#l00033">magic_number.cpp:33</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d9/d44/magic__number_8cpp.html">magic_number.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/d49/kohonen__som__trace_8cpp.html b/d9/d49/kohonen__som__trace_8cpp.html
index 17db97c23..2326eb35d 100644
--- a/d9/d49/kohonen__som__trace_8cpp.html
+++ b/d9/d49/kohonen__som__trace_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: machine_learning/kohonen_som_trace.cpp File Reference</title>
+<title>TheAlgorithms/C++: machine_learning/kohonen_som_trace.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -128,7 +145,9 @@ Include dependency graph for kohonen_som_trace.cpp:</div>
 <div class="dyncontent">
 <div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/d60/kohonen__som__trace_8cpp__incl.svg" width="100%" height="394"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
 </div>
-</div><table class="memberdecls">
+</div>
+<p><a href="../../d9/d49/kohonen__som__trace_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></td></tr>
@@ -139,21 +158,21 @@ Namespaces</h2></td></tr>
 Functions</h2></td></tr>
 <tr class="memitem:gaf5ce14f026d6d231bef29161bac2b485" id="r_gaf5ce14f026d6d231bef29161bac2b485"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a> (double a, double b)</td></tr>
 <tr class="separator:gaf5ce14f026d6d231bef29161bac2b485"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:gae0208548f8b393528e5db01717e88e67" id="r_gae0208548f8b393528e5db01717e88e67"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">save_nd_data</a> (const char *fname, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;X)</td></tr>
+<tr class="memitem:gae0208548f8b393528e5db01717e88e67" id="r_gae0208548f8b393528e5db01717e88e67"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">save_nd_data</a> (const char *fname, const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</td></tr>
 <tr class="separator:gae0208548f8b393528e5db01717e88e67"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa6aac06ccf128b0a9c55c9ee1a8e5631" id="r_aa6aac06ccf128b0a9c55c9ee1a8e5631"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#aa6aac06ccf128b0a9c55c9ee1a8e5631">machine_learning::update_weights</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;x, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *W, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *D, double alpha, int R)</td></tr>
+<tr class="memitem:aa6aac06ccf128b0a9c55c9ee1a8e5631" id="r_aa6aac06ccf128b0a9c55c9ee1a8e5631"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#aa6aac06ccf128b0a9c55c9ee1a8e5631">machine_learning::update_weights</a> (const std::valarray&lt; double &gt; &amp;x, std::vector&lt; std::valarray&lt; double &gt; &gt; *W, std::valarray&lt; double &gt; *D, double alpha, int R)</td></tr>
 <tr class="separator:aa6aac06ccf128b0a9c55c9ee1a8e5631"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a042f435bca0839e721fc1574a61e8da3" id="r_a042f435bca0839e721fc1574a61e8da3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3">machine_learning::kohonen_som_tracer</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;X, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *W, double alpha_min)</td></tr>
+<tr class="memitem:a042f435bca0839e721fc1574a61e8da3" id="r_a042f435bca0839e721fc1574a61e8da3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3">machine_learning::kohonen_som_tracer</a> (const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X, std::vector&lt; std::valarray&lt; double &gt; &gt; *W, double alpha_min)</td></tr>
 <tr class="separator:a042f435bca0839e721fc1574a61e8da3"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae571600aa42a81bc14a4a602ea5ff00d" id="r_ae571600aa42a81bc14a4a602ea5ff00d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae571600aa42a81bc14a4a602ea5ff00d">test_circle</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
+<tr class="memitem:ae571600aa42a81bc14a4a602ea5ff00d" id="r_ae571600aa42a81bc14a4a602ea5ff00d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae571600aa42a81bc14a4a602ea5ff00d">test_circle</a> (std::vector&lt; std::valarray&lt; double &gt; &gt; *<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
 <tr class="separator:ae571600aa42a81bc14a4a602ea5ff00d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a1440a7779ac56f47a3f355ce4a8c7da0" id="r_a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a> ()</td></tr>
 <tr class="separator:a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a53082f2e5bacec40266499da4547309a" id="r_a53082f2e5bacec40266499da4547309a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a53082f2e5bacec40266499da4547309a">test_lamniscate</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
+<tr class="memitem:a53082f2e5bacec40266499da4547309a" id="r_a53082f2e5bacec40266499da4547309a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a53082f2e5bacec40266499da4547309a">test_lamniscate</a> (std::vector&lt; std::valarray&lt; double &gt; &gt; *<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
 <tr class="separator:a53082f2e5bacec40266499da4547309a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a0283886819c7c140a023582b7269e2d0" id="r_a0283886819c7c140a023582b7269e2d0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0283886819c7c140a023582b7269e2d0">test2</a> ()</td></tr>
 <tr class="separator:a0283886819c7c140a023582b7269e2d0"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a7154fe319e6033485a8a6cd6f0d8932d" id="r_a7154fe319e6033485a8a6cd6f0d8932d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7154fe319e6033485a8a6cd6f0d8932d">test_3d_classes</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
+<tr class="memitem:a7154fe319e6033485a8a6cd6f0d8932d" id="r_a7154fe319e6033485a8a6cd6f0d8932d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7154fe319e6033485a8a6cd6f0d8932d">test_3d_classes</a> (std::vector&lt; std::valarray&lt; double &gt; &gt; *<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
 <tr class="separator:a7154fe319e6033485a8a6cd6f0d8932d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a6d0455dd5c30adda100e95f0423c786e" id="r_a6d0455dd5c30adda100e95f0423c786e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6d0455dd5c30adda100e95f0423c786e">test3</a> ()</td></tr>
 <tr class="separator:a6d0455dd5c30adda100e95f0423c786e"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -170,6 +189,8 @@ Functions</h2></td></tr>
 <dd>
 The compiled code is much slower when compiled with MS Visual C++ 2019 than with GCC on windows </dd></dl>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d4/def/kohonen__som__topology_8cpp.html" title="Kohonen self organizing map (topological map)">kohonen_som_topology.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html">kohonen_som_trace.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a2256c10b16edba377b64a44b6c656908" name="a2256c10b16edba377b64a44b6c656908"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a2256c10b16edba377b64a44b6c656908">&#9670;&#160;</a></span>get_clock_diff()</h2>
@@ -198,6 +219,8 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>time difference in seconds </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00452">452</a> of file <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html">kohonen_som_trace.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  452</span>                                                      {</div>
 <div class="line"><span class="lineno">  453</span>    <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end_t - start_t) / CLOCKS_PER_SEC;</div>
 <div class="line"><span class="lineno">  454</span>}</div>
@@ -223,53 +246,45 @@ The compiled code is much slower when compiled with MS Visual C++ 2019 than with
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00457">457</a> of file <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html">kohonen_som_trace.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  457</span>                                {</div>
 <div class="line"><span class="lineno">  458</span><span class="preprocessor">#ifdef _OPENMP</span></div>
-<div class="line"><span class="lineno">  459</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Using OpenMP based parallelization\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  459</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Using OpenMP based parallelization\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  460</span><span class="preprocessor">#else</span></div>
-<div class="line"><span class="lineno">  461</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;NOT using OpenMP based parallelization\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  461</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;NOT using OpenMP based parallelization\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  462</span><span class="preprocessor">#endif</span></div>
 <div class="line"><span class="lineno">  463</span> </div>
-<div class="line"><span class="lineno">  464</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>));</div>
+<div class="line"><span class="lineno">  464</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
 <div class="line"><span class="lineno">  465</span> </div>
-<div class="line"><span class="lineno">  466</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> start_clk = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  466</span>    std::clock_t start_clk = std::clock();</div>
 <div class="line"><span class="lineno">  467</span>    <a class="code hl_function" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();</div>
-<div class="line"><span class="lineno">  468</span>    <span class="keyword">auto</span> end_clk = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
-<div class="line"><span class="lineno">  469</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 completed in &quot;</span> &lt;&lt; <a class="code hl_function" href="#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(start_clk, end_clk)</div>
+<div class="line"><span class="lineno">  468</span>    <span class="keyword">auto</span> end_clk = std::clock();</div>
+<div class="line"><span class="lineno">  469</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 completed in &quot;</span> &lt;&lt; <a class="code hl_function" href="#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(start_clk, end_clk)</div>
 <div class="line"><span class="lineno">  470</span>              &lt;&lt; <span class="stringliteral">&quot; sec\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  471</span> </div>
-<div class="line"><span class="lineno">  472</span>    start_clk = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  472</span>    start_clk = std::clock();</div>
 <div class="line"><span class="lineno">  473</span>    <a class="code hl_function" href="#a0283886819c7c140a023582b7269e2d0">test2</a>();</div>
-<div class="line"><span class="lineno">  474</span>    end_clk = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
-<div class="line"><span class="lineno">  475</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2 completed in &quot;</span> &lt;&lt; <a class="code hl_function" href="#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(start_clk, end_clk)</div>
+<div class="line"><span class="lineno">  474</span>    end_clk = std::clock();</div>
+<div class="line"><span class="lineno">  475</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 completed in &quot;</span> &lt;&lt; <a class="code hl_function" href="#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(start_clk, end_clk)</div>
 <div class="line"><span class="lineno">  476</span>              &lt;&lt; <span class="stringliteral">&quot; sec\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  477</span> </div>
-<div class="line"><span class="lineno">  478</span>    start_clk = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  478</span>    start_clk = std::clock();</div>
 <div class="line"><span class="lineno">  479</span>    <a class="code hl_function" href="#a6d0455dd5c30adda100e95f0423c786e">test3</a>();</div>
-<div class="line"><span class="lineno">  480</span>    end_clk = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
-<div class="line"><span class="lineno">  481</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3 completed in &quot;</span> &lt;&lt; <a class="code hl_function" href="#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(start_clk, end_clk)</div>
+<div class="line"><span class="lineno">  480</span>    end_clk = std::clock();</div>
+<div class="line"><span class="lineno">  481</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 completed in &quot;</span> &lt;&lt; <a class="code hl_function" href="#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(start_clk, end_clk)</div>
 <div class="line"><span class="lineno">  482</span>              &lt;&lt; <span class="stringliteral">&quot; sec\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  483</span> </div>
-<div class="line"><span class="lineno">  484</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div>
+<div class="line"><span class="lineno">  484</span>    std::cout</div>
 <div class="line"><span class="lineno">  485</span>        &lt;&lt; <span class="stringliteral">&quot;(Note: Calculated times include: creating test sets, training &quot;</span></div>
 <div class="line"><span class="lineno">  486</span>           <span class="stringliteral">&quot;model and writing files to disk.)\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  487</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  488</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="aclock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a></div><div class="ttdeci">T clock(T... args)</div></div>
-<div class="ttc" id="aclock_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a></div></div>
-<div class="ttc" id="akohonen__som__trace_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> kohonen_som_trace.cpp:315</div></div>
-<div class="ttc" id="akohonen__som__trace_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition</b> kohonen_som_trace.cpp:233</div></div>
-<div class="ttc" id="akohonen__som__trace_8cpp_html_a2256c10b16edba377b64a44b6c656908"><div class="ttname"><a href="#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a></div><div class="ttdeci">double get_clock_diff(clock_t start_t, clock_t end_t)</div><div class="ttdef"><b>Definition</b> kohonen_som_trace.cpp:452</div></div>
-<div class="ttc" id="akohonen__som__trace_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition</b> kohonen_som_trace.cpp:414</div></div>
-<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="akohonen__som__trace_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00315">kohonen_som_trace.cpp:315</a></div></div>
+<div class="ttc" id="akohonen__som__trace_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00233">kohonen_som_trace.cpp:233</a></div></div>
+<div class="ttc" id="akohonen__som__trace_8cpp_html_a2256c10b16edba377b64a44b6c656908"><div class="ttname"><a href="#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a></div><div class="ttdeci">double get_clock_diff(clock_t start_t, clock_t end_t)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00452">kohonen_som_trace.cpp:452</a></div></div>
+<div class="ttc" id="akohonen__som__trace_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00414">kohonen_som_trace.cpp:414</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1440a7779ac56f47a3f355ce4a8c7da0" name="a1440a7779ac56f47a3f355ce4a8c7da0"></a>
@@ -297,19 +312,21 @@ Here is the call graph for this function:</div>
 <div class="line">     &quot;w12.csv&quot; title &quot;w2&quot;</div>
 </div><!-- fragment --><p> <img src="https://raw.githubusercontent.com/TheAlgorithms/C-Plus-Plus/docs/images/machine_learning/kohonen/test1.svg" alt="Sample execution
    output" style="pointer-events: none;" class="inline"/> </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00233">233</a> of file <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html">kohonen_som_trace.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  233</span>             {</div>
 <div class="line"><span class="lineno">  234</span>    <span class="keywordtype">int</span> j = 0, <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 500;</div>
 <div class="line"><span class="lineno">  235</span>    <span class="keywordtype">int</span> features = 2;</div>
 <div class="line"><span class="lineno">  236</span>    <span class="keywordtype">int</span> num_out = 50;</div>
-<div class="line"><span class="lineno">  237</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; X(N);</div>
-<div class="line"><span class="lineno">  238</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; W(num_out);</div>
-<div class="line"><span class="lineno">  239</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(num_out, N); i++) {</div>
+<div class="line"><span class="lineno">  237</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; X(N);</div>
+<div class="line"><span class="lineno">  238</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; W(num_out);</div>
+<div class="line"><span class="lineno">  239</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; std::max(num_out, N); i++) {</div>
 <div class="line"><span class="lineno">  240</span>        <span class="comment">// loop till max(N, num_out)</span></div>
 <div class="line"><span class="lineno">  241</span>        <span class="keywordflow">if</span> (i &lt; N) {  <span class="comment">// only add new arrays if i &lt; N</span></div>
-<div class="line"><span class="lineno">  242</span>            X[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(features);</div>
+<div class="line"><span class="lineno">  242</span>            X[i] = std::valarray&lt;double&gt;(features);</div>
 <div class="line"><span class="lineno">  243</span>        }</div>
 <div class="line"><span class="lineno">  244</span>        <span class="keywordflow">if</span> (i &lt; num_out) {  <span class="comment">// only add new arrays if i &lt; num_out</span></div>
-<div class="line"><span class="lineno">  245</span>            W[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(features);</div>
+<div class="line"><span class="lineno">  245</span>            W[i] = std::valarray&lt;double&gt;(features);</div>
 <div class="line"><span class="lineno">  246</span> </div>
 <div class="line"><span class="lineno">  247</span><span class="preprocessor">#ifdef _OPENMP</span></div>
 <div class="line"><span class="lineno">  248</span><span class="preprocessor">#pragma omp for</span></div>
@@ -327,19 +344,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  260</span>    kohonen_som_tracer(X, &amp;W, 0.1);  <span class="comment">// train the SOM</span></div>
 <div class="line"><span class="lineno">  261</span>    <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">save_nd_data</a>(<span class="stringliteral">&quot;w12.csv&quot;</span>, W);      <span class="comment">// save the resultant weights</span></div>
 <div class="line"><span class="lineno">  262</span>}</div>
-<div class="ttc" id="agroup__machine__learning_html_gae0208548f8b393528e5db01717e88e67"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">save_nd_data</a></div><div class="ttdeci">int save_nd_data(const char *fname, const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</div><div class="ttdef"><b>Definition</b> kohonen_som_trace.cpp:58</div></div>
-<div class="ttc" id="agroup__machine__learning_html_gaf5ce14f026d6d231bef29161bac2b485"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a></div><div class="ttdeci">double _random(double a, double b)</div><div class="ttdef"><b>Definition</b> kohonen_som_topology.cpp:53</div></div>
-<div class="ttc" id="akohonen__som__trace_8cpp_html_ae571600aa42a81bc14a4a602ea5ff00d"><div class="ttname"><a href="#ae571600aa42a81bc14a4a602ea5ff00d">test_circle</a></div><div class="ttdeci">void test_circle(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> kohonen_som_trace.cpp:196</div></div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
-<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg" width="531" height="211"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agroup__machine__learning_html_gae0208548f8b393528e5db01717e88e67"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">save_nd_data</a></div><div class="ttdeci">int save_nd_data(const char *fname, const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00058">kohonen_som_trace.cpp:58</a></div></div>
+<div class="ttc" id="agroup__machine__learning_html_gaf5ce14f026d6d231bef29161bac2b485"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a></div><div class="ttdeci">double _random(double a, double b)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00053">kohonen_som_topology.cpp:53</a></div></div>
+<div class="ttc" id="akohonen__som__trace_8cpp_html_ae571600aa42a81bc14a4a602ea5ff00d"><div class="ttname"><a href="#ae571600aa42a81bc14a4a602ea5ff00d">test_circle</a></div><div class="ttdeci">void test_circle(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00196">kohonen_som_trace.cpp:196</a></div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0283886819c7c140a023582b7269e2d0" name="a0283886819c7c140a023582b7269e2d0"></a>
@@ -367,19 +376,21 @@ Here is the call graph for this function:</div>
 <div class="line">     &quot;w22.csv&quot; title &quot;w2&quot;</div>
 </div><!-- fragment --><p> <img src="https://raw.githubusercontent.com/TheAlgorithms/C-Plus-Plus/docs/images/machine_learning/kohonen/test2.svg" alt="Sample execution
    output" style="pointer-events: none;" class="inline"/> </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00315">315</a> of file <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html">kohonen_som_trace.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  315</span>             {</div>
 <div class="line"><span class="lineno">  316</span>    <span class="keywordtype">int</span> j = 0, <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 500;</div>
 <div class="line"><span class="lineno">  317</span>    <span class="keywordtype">int</span> features = 2;</div>
 <div class="line"><span class="lineno">  318</span>    <span class="keywordtype">int</span> num_out = 20;</div>
-<div class="line"><span class="lineno">  319</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; X(N);</div>
-<div class="line"><span class="lineno">  320</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; W(num_out);</div>
-<div class="line"><span class="lineno">  321</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(num_out, N); i++) {</div>
+<div class="line"><span class="lineno">  319</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; X(N);</div>
+<div class="line"><span class="lineno">  320</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; W(num_out);</div>
+<div class="line"><span class="lineno">  321</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; std::max(num_out, N); i++) {</div>
 <div class="line"><span class="lineno">  322</span>        <span class="comment">// loop till max(N, num_out)</span></div>
 <div class="line"><span class="lineno">  323</span>        <span class="keywordflow">if</span> (i &lt; N) {  <span class="comment">// only add new arrays if i &lt; N</span></div>
-<div class="line"><span class="lineno">  324</span>            X[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(features);</div>
+<div class="line"><span class="lineno">  324</span>            X[i] = std::valarray&lt;double&gt;(features);</div>
 <div class="line"><span class="lineno">  325</span>        }</div>
 <div class="line"><span class="lineno">  326</span>        <span class="keywordflow">if</span> (i &lt; num_out) {  <span class="comment">// only add new arrays if i &lt; num_out</span></div>
-<div class="line"><span class="lineno">  327</span>            W[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(features);</div>
+<div class="line"><span class="lineno">  327</span>            W[i] = std::valarray&lt;double&gt;(features);</div>
 <div class="line"><span class="lineno">  328</span> </div>
 <div class="line"><span class="lineno">  329</span><span class="preprocessor">#ifdef _OPENMP</span></div>
 <div class="line"><span class="lineno">  330</span><span class="preprocessor">#pragma omp for</span></div>
@@ -397,13 +408,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  342</span>    kohonen_som_tracer(X, &amp;W, 0.01);  <span class="comment">// train the SOM</span></div>
 <div class="line"><span class="lineno">  343</span>    <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">save_nd_data</a>(<span class="stringliteral">&quot;w22.csv&quot;</span>, W);       <span class="comment">// save the resultant weights</span></div>
 <div class="line"><span class="lineno">  344</span>}</div>
-<div class="ttc" id="akohonen__som__trace_8cpp_html_a53082f2e5bacec40266499da4547309a"><div class="ttname"><a href="#a53082f2e5bacec40266499da4547309a">test_lamniscate</a></div><div class="ttdeci">void test_lamniscate(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> kohonen_som_trace.cpp:277</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg" width="543" height="212"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="akohonen__som__trace_8cpp_html_a53082f2e5bacec40266499da4547309a"><div class="ttname"><a href="#a53082f2e5bacec40266499da4547309a">test_lamniscate</a></div><div class="ttdeci">void test_lamniscate(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00277">kohonen_som_trace.cpp:277</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6d0455dd5c30adda100e95f0423c786e" name="a6d0455dd5c30adda100e95f0423c786e"></a>
@@ -431,19 +437,21 @@ Here is the call graph for this function:</div>
 <div class="line">     &quot;w32.csv&quot; title &quot;w2&quot;</div>
 </div><!-- fragment --><p> <img src="https://raw.githubusercontent.com/TheAlgorithms/C-Plus-Plus/docs/images/machine_learning/kohonen/test3.svg" alt="Sample execution
    output" style="pointer-events: none;" class="inline"/> </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00414">414</a> of file <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html">kohonen_som_trace.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  414</span>             {</div>
 <div class="line"><span class="lineno">  415</span>    <span class="keywordtype">int</span> j = 0, <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 200;</div>
 <div class="line"><span class="lineno">  416</span>    <span class="keywordtype">int</span> features = 3;</div>
 <div class="line"><span class="lineno">  417</span>    <span class="keywordtype">int</span> num_out = 20;</div>
-<div class="line"><span class="lineno">  418</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; X(N);</div>
-<div class="line"><span class="lineno">  419</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::valarray&lt;double&gt;</a>&gt; W(num_out);</div>
-<div class="line"><span class="lineno">  420</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(num_out, N); i++) {</div>
+<div class="line"><span class="lineno">  418</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; X(N);</div>
+<div class="line"><span class="lineno">  419</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; W(num_out);</div>
+<div class="line"><span class="lineno">  420</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; std::max(num_out, N); i++) {</div>
 <div class="line"><span class="lineno">  421</span>        <span class="comment">// loop till max(N, num_out)</span></div>
 <div class="line"><span class="lineno">  422</span>        <span class="keywordflow">if</span> (i &lt; N) {  <span class="comment">// only add new arrays if i &lt; N</span></div>
-<div class="line"><span class="lineno">  423</span>            X[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(features);</div>
+<div class="line"><span class="lineno">  423</span>            X[i] = std::valarray&lt;double&gt;(features);</div>
 <div class="line"><span class="lineno">  424</span>        }</div>
 <div class="line"><span class="lineno">  425</span>        <span class="keywordflow">if</span> (i &lt; num_out) {  <span class="comment">// only add new arrays if i &lt; num_out</span></div>
-<div class="line"><span class="lineno">  426</span>            W[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(features);</div>
+<div class="line"><span class="lineno">  426</span>            W[i] = std::valarray&lt;double&gt;(features);</div>
 <div class="line"><span class="lineno">  427</span> </div>
 <div class="line"><span class="lineno">  428</span><span class="preprocessor">#ifdef _OPENMP</span></div>
 <div class="line"><span class="lineno">  429</span><span class="preprocessor">#pragma omp for</span></div>
@@ -461,13 +469,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  441</span>    kohonen_som_tracer(X, &amp;W, 0.01);  <span class="comment">// train the SOM</span></div>
 <div class="line"><span class="lineno">  442</span>    <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">save_nd_data</a>(<span class="stringliteral">&quot;w32.csv&quot;</span>, W);       <span class="comment">// save the resultant weights</span></div>
 <div class="line"><span class="lineno">  443</span>}</div>
-<div class="ttc" id="akohonen__som__trace_8cpp_html_a7154fe319e6033485a8a6cd6f0d8932d"><div class="ttname"><a href="#a7154fe319e6033485a8a6cd6f0d8932d">test_3d_classes</a></div><div class="ttdeci">void test_3d_classes(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> kohonen_som_trace.cpp:359</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg" width="546" height="236"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="akohonen__som__trace_8cpp_html_a7154fe319e6033485a8a6cd6f0d8932d"><div class="ttname"><a href="#a7154fe319e6033485a8a6cd6f0d8932d">test_3d_classes</a></div><div class="ttdeci">void test_3d_classes(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00359">kohonen_som_trace.cpp:359</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7154fe319e6033485a8a6cd6f0d8932d" name="a7154fe319e6033485a8a6cd6f0d8932d"></a>
@@ -479,7 +482,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void test_3d_classes </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; std::valarray&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -500,21 +503,23 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00359">359</a> of file <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html">kohonen_som_trace.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  359</span>                                                           {</div>
 <div class="line"><span class="lineno">  360</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>-&gt;size();</div>
 <div class="line"><span class="lineno">  361</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> R = 0.1;  <span class="comment">// radius of cluster</span></div>
 <div class="line"><span class="lineno">  362</span>    <span class="keywordtype">int</span> i = 0;</div>
 <div class="line"><span class="lineno">  363</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> num_classes = 8;</div>
-<div class="line"><span class="lineno">  364</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;const std::array&lt;double, 3&gt;</a>, num_classes&gt; centres = {</div>
+<div class="line"><span class="lineno">  364</span>    <span class="keyword">const</span> std::array&lt;const std::array&lt;double, 3&gt;, num_classes&gt; centres = {</div>
 <div class="line"><span class="lineno">  365</span>        <span class="comment">// centres of each class cluster</span></div>
-<div class="line"><span class="lineno">  366</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({.5, .5, .5}),    <span class="comment">// centre of class 0</span></div>
-<div class="line"><span class="lineno">  367</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({.5, .5, -.5}),   <span class="comment">// centre of class 1</span></div>
-<div class="line"><span class="lineno">  368</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({.5, -.5, .5}),   <span class="comment">// centre of class 2</span></div>
-<div class="line"><span class="lineno">  369</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({.5, -.5, -.5}),  <span class="comment">// centre of class 3</span></div>
-<div class="line"><span class="lineno">  370</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({-.5, .5, .5}),   <span class="comment">// centre of class 4</span></div>
-<div class="line"><span class="lineno">  371</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({-.5, .5, -.5}),  <span class="comment">// centre of class 5</span></div>
-<div class="line"><span class="lineno">  372</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({-.5, -.5, .5}),  <span class="comment">// centre of class 6</span></div>
-<div class="line"><span class="lineno">  373</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a>({-.5, -.5, -.5})  <span class="comment">// centre of class 7</span></div>
+<div class="line"><span class="lineno">  366</span>        std::array&lt;double, 3&gt;({.5, .5, .5}),    <span class="comment">// centre of class 0</span></div>
+<div class="line"><span class="lineno">  367</span>        std::array&lt;double, 3&gt;({.5, .5, -.5}),   <span class="comment">// centre of class 1</span></div>
+<div class="line"><span class="lineno">  368</span>        std::array&lt;double, 3&gt;({.5, -.5, .5}),   <span class="comment">// centre of class 2</span></div>
+<div class="line"><span class="lineno">  369</span>        std::array&lt;double, 3&gt;({.5, -.5, -.5}),  <span class="comment">// centre of class 3</span></div>
+<div class="line"><span class="lineno">  370</span>        std::array&lt;double, 3&gt;({-.5, .5, .5}),   <span class="comment">// centre of class 4</span></div>
+<div class="line"><span class="lineno">  371</span>        std::array&lt;double, 3&gt;({-.5, .5, -.5}),  <span class="comment">// centre of class 5</span></div>
+<div class="line"><span class="lineno">  372</span>        std::array&lt;double, 3&gt;({-.5, -.5, .5}),  <span class="comment">// centre of class 6</span></div>
+<div class="line"><span class="lineno">  373</span>        std::array&lt;double, 3&gt;({-.5, -.5, -.5})  <span class="comment">// centre of class 7</span></div>
 <div class="line"><span class="lineno">  374</span>    };</div>
 <div class="line"><span class="lineno">  375</span> </div>
 <div class="line"><span class="lineno">  376</span><span class="preprocessor">#ifdef _OPENMP</span></div>
@@ -522,7 +527,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  378</span><span class="preprocessor">#endif</span></div>
 <div class="line"><span class="lineno">  379</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
 <div class="line"><span class="lineno">  380</span>        <span class="keywordtype">int</span> cls =</div>
-<div class="line"><span class="lineno">  381</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % num_classes;  <span class="comment">// select a random class for the point</span></div>
+<div class="line"><span class="lineno">  381</span>            std::rand() % num_classes;  <span class="comment">// select a random class for the point</span></div>
 <div class="line"><span class="lineno">  382</span> </div>
 <div class="line"><span class="lineno">  383</span>        <span class="comment">// create random coordinates (x,y,z) around the centre of the class</span></div>
 <div class="line"><span class="lineno">  384</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][0] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(centres[cls][0] - R, centres[cls][0] + R);</div>
@@ -535,15 +540,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  391</span><span class="comment">        */</span></div>
 <div class="line"><span class="lineno">  392</span>    }</div>
 <div class="line"><span class="lineno">  393</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-</div><!-- 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="../../d9/d49/kohonen__som__trace_8cpp_a7154fe319e6033485a8a6cd6f0d8932d_cgraph.svg" width="367" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae571600aa42a81bc14a4a602ea5ff00d" name="ae571600aa42a81bc14a4a602ea5ff00d"></a>
@@ -555,7 +553,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void test_circle </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; std::valarray&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -574,6 +572,8 @@ y &amp;=&amp; r\sin\theta
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00196">196</a> of file <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html">kohonen_som_trace.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  196</span>                                                       {</div>
 <div class="line"><span class="lineno">  197</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>-&gt;size();</div>
 <div class="line"><span class="lineno">  198</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> R = 0.75, dr = 0.3;</div>
@@ -587,18 +587,11 @@ y &amp;=&amp; r\sin\theta
 <div class="line"><span class="lineno">  206</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
 <div class="line"><span class="lineno">  207</span>        <span class="keywordtype">double</span> r = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(a_r, b_r);      <span class="comment">// random radius</span></div>
 <div class="line"><span class="lineno">  208</span>        <span class="keywordtype">double</span> theta = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(a_t, b_t);  <span class="comment">// random theta</span></div>
-<div class="line"><span class="lineno">  209</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][0] = r * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">cos</a>(theta);    <span class="comment">// convert from polar to cartesian</span></div>
-<div class="line"><span class="lineno">  210</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][1] = r * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">sin</a>(theta);</div>
+<div class="line"><span class="lineno">  209</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][0] = r * cos(theta);    <span class="comment">// convert from polar to cartesian</span></div>
+<div class="line"><span class="lineno">  210</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][1] = r * sin(theta);</div>
 <div class="line"><span class="lineno">  211</span>    }</div>
 <div class="line"><span class="lineno">  212</span>}</div>
-<div class="ttc" id="acos_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a></div><div class="ttdeci">T cos(T... args)</div></div>
-<div class="ttc" id="asin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a></div><div class="ttdeci">T sin(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d49/kohonen__som__trace_8cpp_ae571600aa42a81bc14a4a602ea5ff00d_cgraph.svg" width="332" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a53082f2e5bacec40266499da4547309a" name="a53082f2e5bacec40266499da4547309a"></a>
@@ -610,7 +603,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void test_lamniscate </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; std::valarray&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -631,6 +624,8 @@ y &amp;=&amp; \delta y + \frac{\sin(2\theta)}{2}
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00277">277</a> of file <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html">kohonen_som_trace.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  277</span>                                                           {</div>
 <div class="line"><span class="lineno">  278</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>-&gt;size();</div>
 <div class="line"><span class="lineno">  279</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> dr = 0.2;</div>
@@ -643,16 +638,11 @@ y &amp;=&amp; \delta y + \frac{\sin(2\theta)}{2}
 <div class="line"><span class="lineno">  286</span>        <span class="keywordtype">double</span> dx = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(-dr, dr);     <span class="comment">// random change in x</span></div>
 <div class="line"><span class="lineno">  287</span>        <span class="keywordtype">double</span> dy = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(-dr, dr);     <span class="comment">// random change in y</span></div>
 <div class="line"><span class="lineno">  288</span>        <span class="keywordtype">double</span> theta = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(0, M_PI);  <span class="comment">// random theta</span></div>
-<div class="line"><span class="lineno">  289</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][0] = dx + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">cos</a>(theta);  <span class="comment">// convert from polar to cartesian</span></div>
-<div class="line"><span class="lineno">  290</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][1] = dy + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">sin</a>(2. * theta) / 2.f;</div>
+<div class="line"><span class="lineno">  289</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][0] = dx + cos(theta);  <span class="comment">// convert from polar to cartesian</span></div>
+<div class="line"><span class="lineno">  290</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][1] = dy + sin(2. * theta) / 2.f;</div>
 <div class="line"><span class="lineno">  291</span>    }</div>
 <div class="line"><span class="lineno">  292</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d49/kohonen__som__trace_8cpp_a53082f2e5bacec40266499da4547309a_cgraph.svg" width="364" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
deleted file mode 100644
index b6031f997..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
+++ /dev/null
@@ -1,20 +0,0 @@
-<map id="test2" name="test2">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,58,56,83"/>
-<area shape="rect" id="Node000002" href="$d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" title=" " alt="" coords="305,7,376,33"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="44,55,69,34,103,17,152,7,202,3,290,9,289,14,202,8,152,12,105,22,72,39,47,59"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="124,32,196,58"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="55,63,108,53,109,58,56,68"/>
-<area shape="rect" id="Node000005" href="$d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67" title=" " alt="" coords="109,131,212,157"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="50,81,105,118,113,122,110,126,102,122,47,86"/>
-<area shape="rect" id="Node000009" href="$d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a" title=" " alt="" coords="104,82,217,107"/>
-<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="56,72,89,79,88,84,55,78"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="464,7,537,33"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="377,17,449,17,449,23,377,23"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="272,82,409,107"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="210,128,276,109,277,115,211,133"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="265,131,416,157"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="212,141,250,141,250,147,212,147"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="274,180,408,206"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="211,155,277,173,276,178,210,160"/>
-<area shape="poly" id="edge9_Node000009_Node000002" title=" " alt="" coords="192,79,292,37,294,42,194,84"/>
-</map>
diff --git a/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
deleted file mode 100644
index b9f780c98..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-608b6a6011efe137a682f8defc104fe3
\ No newline at end of file
diff --git a/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
deleted file mode 100644
index 3cb014ed1..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
+++ /dev/null
@@ -1,200 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="407pt" height="159pt"
- viewBox="0.00 0.00 406.50 158.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 154.5)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-111.25 0,-111.25 0,-92 37.75,-92 37.75,-111.25"/>
-<text text-anchor="middle" x="18.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278.25,-149.25 224.75,-149.25 224.75,-130 278.25,-130 278.25,-149.25"/>
-<text text-anchor="middle" x="251.5" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.94,-111.66C40.03,-120.96 56.51,-134.16 73.75,-139.62 120.07,-154.32 176.72,-150.83 213.19,-146.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.38,-149.55 222.79,-144.67 212.4,-142.62 213.38,-149.55"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.38,-130.25 89.12,-130.25 89.12,-111 143.38,-111 143.38,-130.25"/>
-<text text-anchor="middle" x="116.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.81,-105.2C49.03,-107.43 63.9,-110.39 77.6,-113.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.76,-116.53 87.26,-115.05 78.13,-109.66 76.76,-116.53"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.62,-56.25 77.88,-56.25 77.88,-37 154.62,-37 154.62,-56.25"/>
-<text text-anchor="middle" x="116.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_nd_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.71,-91.77C43.35,-83.85 59.06,-72.76 73.75,-64.62 75.66,-63.57 77.64,-62.53 79.65,-61.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.93,-64.79 88.49,-57.36 77.95,-58.45 80.93,-64.79"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158.75,-93.25 73.75,-93.25 73.75,-74 158.75,-74 158.75,-93.25"/>
-<text text-anchor="middle" x="116.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_lamniscate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.81,-98.24C44.87,-96.91 53.38,-95.3 62.13,-93.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.59,-97.13 71.77,-91.83 61.29,-90.25 62.59,-97.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="398.5,-149.25 344.25,-149.25 344.25,-130 398.5,-130 398.5,-149.25"/>
-<text text-anchor="middle" x="371.38" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.66,-139.62C294.5,-139.62 314.96,-139.62 332.54,-139.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="332.37,-143.13 342.37,-139.63 332.37,-136.13 332.37,-143.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="303,-93.25 200,-93.25 200,-74 303,-74 303,-93.25"/>
-<text text-anchor="middle" x="251.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.66,-56.74C168.94,-60.98 186.9,-65.97 203.18,-70.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.1,-73.82 212.67,-73.12 203.98,-67.07 202.1,-73.82"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="308.25,-56.25 194.75,-56.25 194.75,-37 308.25,-37 308.25,-56.25"/>
-<text text-anchor="middle" x="251.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.08,-46.62C163.87,-46.62 173.49,-46.62 183.13,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.9,-50.13 192.9,-46.63 182.9,-43.13 182.9,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="301.88,-19.25 201.12,-19.25 201.12,0 301.88,0 301.88,-19.25"/>
-<text text-anchor="middle" x="251.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.66,-36.51C168.94,-32.27 186.9,-27.28 203.18,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="203.98,-26.18 212.67,-20.13 202.1,-19.43 203.98,-26.18"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node2 -->
-<g id="edge9_Node000009_Node000002" class="edge">
-<title>Node9&#45;&gt;Node2</title>
-<g id="a_edge9_Node000009_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.07,-93.64C161.88,-102.38 192.35,-115.19 215.86,-125.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.46,-128.28 225.04,-128.92 217.18,-121.82 214.46,-128.28"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
deleted file mode 100644
index 893e41cde..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
+++ /dev/null
@@ -1,174 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="407pt" height="159pt"
- viewBox="0.00 0.00 406.50 158.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 154.5)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-111.25 0,-111.25 0,-92 37.75,-92 37.75,-111.25"/>
-<text text-anchor="middle" x="18.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278.25,-149.25 224.75,-149.25 224.75,-130 278.25,-130 278.25,-149.25"/>
-<text text-anchor="middle" x="251.5" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.94,-111.66C40.03,-120.96 56.51,-134.16 73.75,-139.62 120.07,-154.32 176.72,-150.83 213.19,-146.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.38,-149.55 222.79,-144.67 212.4,-142.62 213.38,-149.55"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.38,-130.25 89.12,-130.25 89.12,-111 143.38,-111 143.38,-130.25"/>
-<text text-anchor="middle" x="116.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.81,-105.2C49.03,-107.43 63.9,-110.39 77.6,-113.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.76,-116.53 87.26,-115.05 78.13,-109.66 76.76,-116.53"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.62,-56.25 77.88,-56.25 77.88,-37 154.62,-37 154.62,-56.25"/>
-<text text-anchor="middle" x="116.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_nd_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.71,-91.77C43.35,-83.85 59.06,-72.76 73.75,-64.62 75.66,-63.57 77.64,-62.53 79.65,-61.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.93,-64.79 88.49,-57.36 77.95,-58.45 80.93,-64.79"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158.75,-93.25 73.75,-93.25 73.75,-74 158.75,-74 158.75,-93.25"/>
-<text text-anchor="middle" x="116.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_lamniscate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.81,-98.24C44.87,-96.91 53.38,-95.3 62.13,-93.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.59,-97.13 71.77,-91.83 61.29,-90.25 62.59,-97.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="398.5,-149.25 344.25,-149.25 344.25,-130 398.5,-130 398.5,-149.25"/>
-<text text-anchor="middle" x="371.38" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.66,-139.62C294.5,-139.62 314.96,-139.62 332.54,-139.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="332.37,-143.13 342.37,-139.63 332.37,-136.13 332.37,-143.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="303,-93.25 200,-93.25 200,-74 303,-74 303,-93.25"/>
-<text text-anchor="middle" x="251.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.66,-56.74C168.94,-60.98 186.9,-65.97 203.18,-70.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.1,-73.82 212.67,-73.12 203.98,-67.07 202.1,-73.82"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="308.25,-56.25 194.75,-56.25 194.75,-37 308.25,-37 308.25,-56.25"/>
-<text text-anchor="middle" x="251.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.08,-46.62C163.87,-46.62 173.49,-46.62 183.13,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.9,-50.13 192.9,-46.63 182.9,-43.13 182.9,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="301.88,-19.25 201.12,-19.25 201.12,0 301.88,0 301.88,-19.25"/>
-<text text-anchor="middle" x="251.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.66,-36.51C168.94,-32.27 186.9,-27.28 203.18,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="203.98,-26.18 212.67,-20.13 202.1,-19.43 203.98,-26.18"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node2 -->
-<g id="edge9_Node000009_Node000002" class="edge">
-<title>Node9&#45;&gt;Node2</title>
-<g id="a_edge9_Node000009_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.07,-93.64C161.88,-102.38 192.35,-115.19 215.86,-125.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.46,-128.28 225.04,-128.92 217.18,-121.82 214.46,-128.28"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
deleted file mode 100644
index 1e10e865e..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
+++ /dev/null
@@ -1,20 +0,0 @@
-<map id="test1" name="test1">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,57,56,83"/>
-<area shape="rect" id="Node000002" href="$d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" title=" " alt="" coords="294,6,365,32"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="44,54,69,34,103,17,149,7,195,3,279,8,279,13,196,9,149,12,105,22,72,38,47,59"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="119,32,191,57"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="55,62,103,52,104,58,56,67"/>
-<area shape="rect" id="Node000005" href="$d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67" title=" " alt="" coords="104,130,206,156"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="51,81,105,117,112,121,109,125,102,122,48,85"/>
-<area shape="rect" id="Node000009" href="$d9/d49/kohonen__som__trace_8cpp.html#ae571600aa42a81bc14a4a602ea5ff00d" title=" " alt="" coords="114,81,196,107"/>
-<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="56,72,99,81,98,86,55,77"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="453,6,526,32"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="366,17,438,17,438,22,366,22"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="261,81,398,107"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="202,127,266,109,267,114,204,132"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="254,130,405,156"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="206,141,238,141,238,146,206,146"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="262,180,397,205"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="204,154,267,172,266,177,202,159"/>
-<area shape="poly" id="edge9_Node000009_Node000002" title=" " alt="" coords="186,78,282,36,284,41,188,83"/>
-</map>
diff --git a/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
deleted file mode 100644
index b808b1371..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5612101c0c563c91e0b4fa6658ed303d
\ No newline at end of file
diff --git a/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
deleted file mode 100644
index a27926e7e..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
+++ /dev/null
@@ -1,200 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="398pt" height="158pt"
- viewBox="0.00 0.00 398.25 158.05" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 154.05)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-111.25 0,-111.25 0,-92 37.75,-92 37.75,-111.25"/>
-<text text-anchor="middle" x="18.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270,-149.25 216.5,-149.25 216.5,-130 270,-130 270,-149.25"/>
-<text text-anchor="middle" x="243.25" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.94,-111.66C40.03,-120.96 56.51,-134.16 73.75,-139.62 117.22,-153.41 170.22,-150.41 205.04,-145.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.18,-149.46 214.6,-144.62 204.22,-142.53 205.18,-149.46"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="139.25,-130.25 85,-130.25 85,-111 139.25,-111 139.25,-130.25"/>
-<text text-anchor="middle" x="112.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.9,-105.38C48.16,-107.52 61.4,-110.27 73.8,-112.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.85,-116.23 83.36,-114.84 74.28,-109.38 72.85,-116.23"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.5,-56.25 73.75,-56.25 73.75,-37 150.5,-37 150.5,-56.25"/>
-<text text-anchor="middle" x="112.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_nd_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.23,-91.6C43.91,-83.8 59.42,-72.93 73.75,-64.62 75.38,-63.68 77.06,-62.74 78.78,-61.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.05,-65.1 87.35,-57.43 76.86,-58.87 80.05,-65.1"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#ae571600aa42a81bc14a4a602ea5ff00d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="142.62,-93.25 81.62,-93.25 81.62,-74 142.62,-74 142.62,-93.25"/>
-<text text-anchor="middle" x="112.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_circle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.9,-98.07C47.17,-96.24 58.88,-93.93 70.2,-91.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.66,-95.17 79.79,-89.81 69.31,-88.31 70.66,-95.17"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="390.25,-149.25 336,-149.25 336,-130 390.25,-130 390.25,-149.25"/>
-<text text-anchor="middle" x="363.12" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.41,-139.62C286.25,-139.62 306.71,-139.62 324.29,-139.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="324.12,-143.13 334.12,-139.63 324.12,-136.13 324.12,-143.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294.75,-93.25 191.75,-93.25 191.75,-74 294.75,-74 294.75,-93.25"/>
-<text text-anchor="middle" x="243.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.41,-56.74C163.07,-60.94 180.29,-65.87 195.94,-70.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.98,-73.72 205.55,-73.11 196.9,-66.99 194.98,-73.72"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="300,-56.25 186.5,-56.25 186.5,-37 300,-37 300,-56.25"/>
-<text text-anchor="middle" x="243.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.82,-46.62C158.31,-46.62 166.38,-46.62 174.53,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.51,-50.13 184.51,-46.63 174.51,-43.13 174.51,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="293.62,-19.25 192.88,-19.25 192.88,0 293.62,0 293.62,-19.25"/>
-<text text-anchor="middle" x="243.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.41,-36.51C163.07,-32.31 180.29,-27.38 195.94,-22.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.9,-26.26 205.55,-20.14 194.98,-19.53 196.9,-26.26"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node2 -->
-<g id="edge9_Node000009_Node000002" class="edge">
-<title>Node9&#45;&gt;Node2</title>
-<g id="a_edge9_Node000009_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.21,-93.64C156.28,-102.34 185.63,-115.07 208.37,-124.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.97,-128.14 217.54,-128.91 209.76,-121.72 206.97,-128.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
deleted file mode 100644
index e9e96053a..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
+++ /dev/null
@@ -1,174 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="398pt" height="158pt"
- viewBox="0.00 0.00 398.25 158.05" 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 154.05)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-111.25 0,-111.25 0,-92 37.75,-92 37.75,-111.25"/>
-<text text-anchor="middle" x="18.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270,-149.25 216.5,-149.25 216.5,-130 270,-130 270,-149.25"/>
-<text text-anchor="middle" x="243.25" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.94,-111.66C40.03,-120.96 56.51,-134.16 73.75,-139.62 117.22,-153.41 170.22,-150.41 205.04,-145.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.18,-149.46 214.6,-144.62 204.22,-142.53 205.18,-149.46"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="139.25,-130.25 85,-130.25 85,-111 139.25,-111 139.25,-130.25"/>
-<text text-anchor="middle" x="112.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.9,-105.38C48.16,-107.52 61.4,-110.27 73.8,-112.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.85,-116.23 83.36,-114.84 74.28,-109.38 72.85,-116.23"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.5,-56.25 73.75,-56.25 73.75,-37 150.5,-37 150.5,-56.25"/>
-<text text-anchor="middle" x="112.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_nd_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.23,-91.6C43.91,-83.8 59.42,-72.93 73.75,-64.62 75.38,-63.68 77.06,-62.74 78.78,-61.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.05,-65.1 87.35,-57.43 76.86,-58.87 80.05,-65.1"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#ae571600aa42a81bc14a4a602ea5ff00d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="142.62,-93.25 81.62,-93.25 81.62,-74 142.62,-74 142.62,-93.25"/>
-<text text-anchor="middle" x="112.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_circle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.9,-98.07C47.17,-96.24 58.88,-93.93 70.2,-91.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.66,-95.17 79.79,-89.81 69.31,-88.31 70.66,-95.17"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="390.25,-149.25 336,-149.25 336,-130 390.25,-130 390.25,-149.25"/>
-<text text-anchor="middle" x="363.12" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.41,-139.62C286.25,-139.62 306.71,-139.62 324.29,-139.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="324.12,-143.13 334.12,-139.63 324.12,-136.13 324.12,-143.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294.75,-93.25 191.75,-93.25 191.75,-74 294.75,-74 294.75,-93.25"/>
-<text text-anchor="middle" x="243.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.41,-56.74C163.07,-60.94 180.29,-65.87 195.94,-70.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.98,-73.72 205.55,-73.11 196.9,-66.99 194.98,-73.72"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="300,-56.25 186.5,-56.25 186.5,-37 300,-37 300,-56.25"/>
-<text text-anchor="middle" x="243.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.82,-46.62C158.31,-46.62 166.38,-46.62 174.53,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.51,-50.13 184.51,-46.63 174.51,-43.13 174.51,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="293.62,-19.25 192.88,-19.25 192.88,0 293.62,0 293.62,-19.25"/>
-<text text-anchor="middle" x="243.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.41,-36.51C163.07,-32.31 180.29,-27.38 195.94,-22.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.9,-26.26 205.55,-20.14 194.98,-19.53 196.9,-26.26"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node2 -->
-<g id="edge9_Node000009_Node000002" class="edge">
-<title>Node9&#45;&gt;Node2</title>
-<g id="a_edge9_Node000009_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.21,-93.64C156.28,-102.34 185.63,-115.07 208.37,-124.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.97,-128.14 217.54,-128.91 209.76,-121.72 206.97,-128.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
deleted file mode 100644
index 100703460..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
+++ /dev/null
@@ -1,47 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,153,55,179"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/clock.html#" title=" " alt="" coords="115,5,193,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="33,152,57,99,77,68,101,40,103,38,107,42,105,44,81,71,62,102,38,154"/>
-<area shape="rect" id="Node000003" href="$d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908" title=" " alt="" coords="103,55,205,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="39,151,66,121,101,89,106,86,109,90,104,94,69,125,43,155"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="114,104,194,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="54,154,104,134,107,138,56,159"/>
-<area shape="rect" id="Node000005" href="$d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" title=" " alt="" coords="129,203,179,228"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="56,173,115,197,113,202,54,178"/>
-<area shape="rect" id="Node000014" href="$d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0" title=" " alt="" coords="129,153,179,179"/>
-<area shape="poly" id="edge14_Node000001_Node000014" title=" " alt="" coords="55,164,113,164,113,169,55,169"/>
-<area shape="rect" id="Node000016" href="$d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" title=" " alt="" coords="129,253,179,279"/>
-<area shape="poly" id="edge20_Node000001_Node000016" title=" " alt="" coords="44,178,70,208,104,239,116,247,113,251,101,243,66,211,40,181"/>
-<area shape="rect" id="Node000018" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="118,303,190,328"/>
-<area shape="poly" id="edge27_Node000001_Node000018" title=" " alt="" coords="38,179,62,231,81,262,105,290,107,292,103,296,101,293,77,265,57,234,33,181"/>
-<area shape="rect" id="Node000006" href="$d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" title=" " alt="" coords="457,203,529,228"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="178,204,203,189,217,176,226,162,235,149,252,138,284,128,310,125,337,129,370,138,423,162,466,191,463,195,420,166,368,143,336,135,310,131,285,133,254,143,239,153,230,165,221,179,207,194,181,208"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="275,153,347,179"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="179,205,259,180,261,185,180,210"/>
-<area shape="rect" id="Node000009" href="$d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67" title=" " alt="" coords="260,353,362,379"/>
-<area shape="poly" id="edge8_Node000005_Node000009" title=" " alt="" coords="181,222,207,239,225,266,231,291,238,316,255,340,257,342,254,346,251,344,233,318,226,293,220,268,203,243,178,226"/>
-<area shape="rect" id="Node000013" href="$d9/d49/kohonen__som__trace_8cpp.html#ae571600aa42a81bc14a4a602ea5ff00d" title=" " alt="" coords="270,203,352,228"/>
-<area shape="poly" id="edge12_Node000005_Node000013" title=" " alt="" coords="179,213,255,213,255,218,179,218"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="617,228,689,254"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="530,218,601,230,601,235,529,224"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="424,304,562,330"/>
-<area shape="poly" id="edge9_Node000009_Node000010" title=" " alt="" coords="361,350,427,332,429,337,362,355"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="417,353,569,379"/>
-<area shape="poly" id="edge10_Node000009_Node000011" title=" " alt="" coords="363,364,402,364,402,369,363,369"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="426,403,560,428"/>
-<area shape="poly" id="edge11_Node000009_Node000012" title=" " alt="" coords="362,377,429,395,427,401,361,382"/>
-<area shape="poly" id="edge13_Node000013_Node000006" title=" " alt="" coords="352,213,442,213,442,218,352,218"/>
-<area shape="poly" id="edge15_Node000014_Node000006" title=" " alt="" coords="178,156,203,140,213,127,219,114,224,87,230,61,238,48,252,37,282,22,310,17,339,23,371,37,392,51,412,68,445,109,469,151,485,187,480,189,464,153,440,112,408,72,389,55,368,42,337,28,310,23,284,27,254,42,242,52,235,63,229,88,224,116,218,130,207,144,181,161"/>
-<area shape="poly" id="edge16_Node000014_Node000008" title=" " alt="" coords="179,164,259,164,259,169,179,169"/>
-<area shape="poly" id="edge17_Node000014_Node000009" title=" " alt="" coords="181,171,195,178,207,188,221,209,228,229,231,266,235,303,241,322,255,340,256,342,253,346,251,344,237,324,229,304,226,267,223,230,216,211,203,192,192,182,178,176"/>
-<area shape="rect" id="Node000015" href="$d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a" title=" " alt="" coords="254,52,368,78"/>
-<area shape="poly" id="edge18_Node000014_Node000015" title=" " alt="" coords="178,154,203,140,227,118,251,95,268,84,271,88,255,99,231,122,207,144,181,159"/>
-<area shape="poly" id="edge19_Node000015_Node000006" title=" " alt="" coords="341,76,371,95,427,143,472,189,468,193,424,147,368,99,338,80"/>
-<area shape="poly" id="edge21_Node000016_Node000006" title=" " alt="" coords="179,261,263,253,369,238,442,224,443,229,370,243,264,258,179,267"/>
-<area shape="poly" id="edge22_Node000016_Node000008" title=" " alt="" coords="178,254,203,239,217,226,227,214,236,201,251,188,259,183,262,188,255,192,240,205,231,217,221,229,207,243,181,258"/>
-<area shape="poly" id="edge23_Node000016_Node000009" title=" " alt="" coords="181,273,207,288,222,302,231,315,240,327,255,340,260,344,257,348,251,344,236,331,227,318,218,305,203,292,178,278"/>
-<area shape="rect" id="Node000017" href="$d9/d49/kohonen__som__trace_8cpp.html#a7154fe319e6033485a8a6cd6f0d8932d" title=" " alt="" coords="253,304,369,330"/>
-<area shape="poly" id="edge24_Node000016_Node000017" title=" " alt="" coords="180,272,256,296,254,301,179,277"/>
-<area shape="poly" id="edge25_Node000017_Node000006" title=" " alt="" coords="337,301,368,283,391,264,416,245,442,232,444,237,419,250,395,268,371,287,339,306"/>
-<area shape="poly" id="edge26_Node000017_Node000007" title=" " alt="" coords="366,301,417,289,601,249,602,254,418,294,367,306"/>
-</map>
diff --git a/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
deleted file mode 100644
index 0290b8842..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c145e37d64c3e2de4b67c82076d95557
\ No newline at end of file
diff --git a/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
deleted file mode 100644
index 4779c2b70..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
+++ /dev/null
@@ -1,500 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 325 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 521;
-var viewHeight = 325;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-206.25 0,-206.25 0,-187 37,-187 37,-206.25"/>
-<text text-anchor="middle" x="18.5" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="140.75,-317.25 82,-317.25 82,-298 140.75,-298 140.75,-317.25"/>
-<text text-anchor="middle" x="111.38" y="-303.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.95,-206.59C29.81,-225.14 46.8,-265.28 73,-289.62 73.61,-290.19 74.25,-290.75 74.9,-291.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.64,-293.99 82.89,-296.67 76.55,-288.18 72.64,-293.99"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149.75,-280.25 73,-280.25 73,-261 149.75,-261 149.75,-280.25"/>
-<text text-anchor="middle" x="111.38" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_clock_diff</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.96,-206.36C36.57,-218.42 54.29,-239.03 73,-252.62 74.15,-253.46 75.34,-254.27 76.56,-255.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.58,-257.96 85,-259.87 78.05,-251.88 74.58,-257.96"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.12,-243.25 81.62,-243.25 81.62,-224 141.12,-224 141.12,-243.25"/>
-<text text-anchor="middle" x="111.38" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.45,-203.94C48.2,-208.31 62.24,-214.03 75.12,-219.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.6,-222.43 84.18,-222.96 76.23,-215.95 73.6,-222.43"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="130.25,-169.25 92.5,-169.25 92.5,-150 130.25,-150 130.25,-169.25"/>
-<text text-anchor="middle" x="111.38" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.45,-189.31C50.07,-184.18 67.21,-177.2 81.7,-171.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.8,-174.63 90.75,-167.62 80.16,-168.15 82.8,-174.63"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="130.25,-206.25 92.5,-206.25 92.5,-187 130.25,-187 130.25,-206.25"/>
-<text text-anchor="middle" x="111.38" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node14 -->
-<g id="edge14_Node000001_Node000014" class="edge">
-<title>Node1&#45;&gt;Node14</title>
-<g id="a_edge14_Node000001_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.45,-196.62C49.82,-196.62 66.54,-196.62 80.84,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.63,-200.13 90.63,-196.63 80.63,-193.13 80.63,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="130.25,-131.25 92.5,-131.25 92.5,-112 130.25,-112 130.25,-131.25"/>
-<text text-anchor="middle" x="111.38" y="-117.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge20_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge20_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.35,-186.53C37.08,-174.48 54.66,-154.26 73,-140.62 75.83,-138.52 78.93,-136.53 82.09,-134.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.63,-137.84 90.82,-130.06 80.35,-131.65 83.63,-137.84"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.5,-94.25 84.25,-94.25 84.25,-75 138.5,-75 138.5,-94.25"/>
-<text text-anchor="middle" x="111.38" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node18 -->
-<g id="edge27_Node000001_Node000018" class="edge">
-<title>Node1&#45;&gt;Node18</title>
-<g id="a_edge27_Node000001_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.92,-186.55C29.73,-167.8 46.65,-127.23 73,-102.62 73.61,-102.05 74.25,-101.5 74.9,-100.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.55,-104.06 82.88,-95.57 72.64,-98.26 76.55,-104.06"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="392.5,-169.25 339,-169.25 339,-150 392.5,-150 392.5,-169.25"/>
-<text text-anchor="middle" x="365.75" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.62,-166.8C136.96,-169.7 143.93,-173.38 149.75,-177.62 168.54,-191.34 164.38,-206.43 185.75,-215.62 221.37,-230.95 235.67,-226.12 273,-215.62 299.98,-208.04 326.88,-190.08 344.51,-176.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="346.46,-179.45 352.11,-170.49 342.1,-173.97 346.46,-179.45"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="256.5,-206.25 202.25,-206.25 202.25,-187 256.5,-187 256.5,-206.25"/>
-<text text-anchor="middle" x="229.38" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.5,-165.41C146.63,-170.55 170.73,-178.24 190.98,-184.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.73,-187.97 200.32,-187.68 191.86,-181.3 189.73,-187.97"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.75,-56.25 191,-56.25 191,-37 267.75,-37 267.75,-56.25"/>
-<text text-anchor="middle" x="229.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_nd_data</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge8_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge8_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.68,-153.22C137.31,-150.21 144.47,-146.05 149.75,-140.62 175.81,-113.83 158.76,-90.48 185.75,-64.62 186.36,-64.04 186.99,-63.48 187.64,-62.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.3,-66.03 195.67,-57.56 185.41,-60.21 189.3,-66.03"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#ae571600aa42a81bc14a4a602ea5ff00d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.88,-169.25 198.88,-169.25 198.88,-150 259.88,-150 259.88,-169.25"/>
-<text text-anchor="middle" x="229.38" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_circle</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node13 -->
-<g id="edge12_Node000005_Node000013" class="edge">
-<title>Node5&#45;&gt;Node13</title>
-<g id="a_edge12_Node000005_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.5,-159.62C145.66,-159.62 167.87,-159.62 187.3,-159.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.14,-163.13 197.14,-159.63 187.14,-156.13 187.14,-163.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="512.75,-150.25 458.5,-150.25 458.5,-131 512.75,-131 512.75,-150.25"/>
-<text text-anchor="middle" x="485.62" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M392.91,-155.41C408.75,-152.86 429.21,-149.56 446.79,-146.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="447.32,-150.18 456.64,-145.14 446.21,-143.27 447.32,-150.18"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="417.25,-93.25 314.25,-93.25 314.25,-74 417.25,-74 417.25,-93.25"/>
-<text text-anchor="middle" x="365.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.09,-56.74C282.5,-60.98 300.62,-65.97 317.03,-70.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.05,-73.84 326.62,-73.13 317.9,-67.1 316.05,-73.84"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="422.5,-56.25 309,-56.25 309,-37 422.5,-37 422.5,-56.25"/>
-<text text-anchor="middle" x="365.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge10_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge10_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M268.16,-46.62C277.3,-46.62 287.34,-46.62 297.39,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.17,-50.13 307.17,-46.63 297.17,-43.13 297.17,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="416.12,-19.25 315.38,-19.25 315.38,0 416.12,0 416.12,-19.25"/>
-<text text-anchor="middle" x="365.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node12 -->
-<g id="edge11_Node000009_Node000012" class="edge">
-<title>Node9&#45;&gt;Node12</title>
-<g id="a_edge11_Node000009_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.09,-36.51C282.5,-32.27 300.62,-27.28 317.03,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.9,-26.15 326.62,-20.12 316.05,-19.41 317.9,-26.15"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node6 -->
-<g id="edge13_Node000013_Node000006" class="edge">
-<title>Node13&#45;&gt;Node6</title>
-<g id="a_edge13_Node000013_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.2,-159.62C279.94,-159.62 305.99,-159.62 327.15,-159.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.13,-163.13 337.13,-159.63 327.13,-156.13 327.13,-163.13"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node6 -->
-<g id="edge15_Node000014_Node000006" class="edge">
-<title>Node14&#45;&gt;Node6</title>
-<g id="a_edge15_Node000014_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.69,-202.49C137.33,-205.33 144.48,-209.3 149.75,-214.62 176.31,-241.49 153.88,-271.34 185.75,-291.62 218.47,-312.44 238.63,-309.59 273,-291.62 318.18,-268.01 345.6,-210.89 357.6,-180.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="360.73,-181.73 360.92,-171.14 354.16,-179.3 360.73,-181.73"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node8 -->
-<g id="edge16_Node000014_Node000008" class="edge">
-<title>Node14&#45;&gt;Node8</title>
-<g id="a_edge16_Node000014_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.5,-196.62C146.48,-196.62 170.29,-196.62 190.42,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.25,-200.13 200.25,-196.63 190.25,-193.13 190.25,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node9 -->
-<g id="edge17_Node000014_Node000009" class="edge">
-<title>Node14&#45;&gt;Node9</title>
-<g id="a_edge17_Node000014_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.68,-191.27C137.48,-188.47 144.75,-184.39 149.75,-178.62 184.54,-138.47 149.98,-103.91 185.75,-64.62 186.12,-64.22 186.49,-63.83 186.88,-63.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.96,-66.26 194.88,-57.47 184.77,-60.65 188.96,-66.26"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.88,-282.25 186.88,-282.25 186.88,-263 271.88,-263 271.88,-282.25"/>
-<text text-anchor="middle" x="229.38" y="-268.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_lamniscate</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge18_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge18_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.49,-203.98C136.82,-206.9 143.82,-210.54 149.75,-214.62 167.88,-227.1 168.03,-235.57 185.75,-248.62 189.67,-251.51 193.98,-254.31 198.3,-256.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.5,-259.92 206.92,-261.84 199.97,-253.84 196.5,-259.92"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node6 -->
-<g id="edge19_Node000015_Node000006" class="edge">
-<title>Node15&#45;&gt;Node6</title>
-<g id="a_edge19_Node000015_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M250.56,-262.65C257.88,-258.67 266.06,-253.81 273,-248.62 301.88,-227.06 331.05,-197.03 348.51,-177.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.97,-180.46 355.08,-170.69 345.78,-175.77 350.97,-180.46"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node6 -->
-<g id="edge21_Node000016_Node000006" class="edge">
-<title>Node16&#45;&gt;Node6</title>
-<g id="a_edge21_Node000016_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.27,-123.23C160.01,-126.02 221.45,-132.25 273,-140.62 291.13,-143.57 311.12,-147.61 327.8,-151.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.76,-154.57 337.28,-153.29 328.26,-147.73 326.76,-154.57"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node8 -->
-<g id="edge22_Node000016_Node000008" class="edge">
-<title>Node16&#45;&gt;Node8</title>
-<g id="a_edge22_Node000016_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.6,-129.34C136.94,-132.42 143.92,-136.27 149.75,-140.62 168.39,-154.54 166.63,-165.37 185.75,-178.62 187.58,-179.89 189.52,-181.1 191.51,-182.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.92,-185.36 200.43,-186.72 193.07,-179.11 189.92,-185.36"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node9 -->
-<g id="edge23_Node000016_Node000009" class="edge">
-<title>Node16&#45;&gt;Node9</title>
-<g id="a_edge23_Node000016_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.65,-114.49C136.99,-111.59 143.96,-107.91 149.75,-103.62 168.71,-89.59 166.45,-78.19 185.75,-64.62 187.11,-63.67 188.52,-62.76 189.97,-61.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.4,-65.08 198.62,-57.32 188.14,-58.89 191.4,-65.08"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#a7154fe319e6033485a8a6cd6f0d8932d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273,-93.25 185.75,-93.25 185.75,-74 273,-74 273,-93.25"/>
-<text text-anchor="middle" x="229.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3d_classes</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge24_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge24_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.5,-115.69C145.59,-110.74 167.66,-103.51 187.03,-97.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.89,-100.57 196.31,-94.13 185.71,-93.92 187.89,-100.57"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node6 -->
-<g id="edge25_Node000017_Node000006" class="edge">
-<title>Node17&#45;&gt;Node6</title>
-<g id="a_edge25_Node000017_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.41,-93.55C256.91,-97.67 265.5,-102.64 273,-107.62 289.88,-118.85 291.55,-125.31 309,-135.62 315.07,-139.21 321.78,-142.57 328.38,-145.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.59,-148.6 337.15,-149.36 329.36,-142.18 326.59,-148.6"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node7 -->
-<g id="edge26_Node000017_Node000007" class="edge">
-<title>Node17&#45;&gt;Node7</title>
-<g id="a_edge26_Node000017_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M271.14,-93.67C283.3,-96.62 296.68,-99.8 309,-102.62 356.61,-113.53 411.67,-125.31 447.26,-132.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="446.11,-136.15 456.62,-134.78 447.55,-129.3 446.11,-136.15"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
deleted file mode 100644
index 8b543e55c..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
+++ /dev/null
@@ -1,417 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="521pt" height="325pt"
- viewBox="0.00 0.00 520.75 325.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 321.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-206.25 0,-206.25 0,-187 37,-187 37,-206.25"/>
-<text text-anchor="middle" x="18.5" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="140.75,-317.25 82,-317.25 82,-298 140.75,-298 140.75,-317.25"/>
-<text text-anchor="middle" x="111.38" y="-303.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.95,-206.59C29.81,-225.14 46.8,-265.28 73,-289.62 73.61,-290.19 74.25,-290.75 74.9,-291.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.64,-293.99 82.89,-296.67 76.55,-288.18 72.64,-293.99"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149.75,-280.25 73,-280.25 73,-261 149.75,-261 149.75,-280.25"/>
-<text text-anchor="middle" x="111.38" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_clock_diff</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.96,-206.36C36.57,-218.42 54.29,-239.03 73,-252.62 74.15,-253.46 75.34,-254.27 76.56,-255.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.58,-257.96 85,-259.87 78.05,-251.88 74.58,-257.96"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.12,-243.25 81.62,-243.25 81.62,-224 141.12,-224 141.12,-243.25"/>
-<text text-anchor="middle" x="111.38" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.45,-203.94C48.2,-208.31 62.24,-214.03 75.12,-219.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.6,-222.43 84.18,-222.96 76.23,-215.95 73.6,-222.43"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="130.25,-169.25 92.5,-169.25 92.5,-150 130.25,-150 130.25,-169.25"/>
-<text text-anchor="middle" x="111.38" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.45,-189.31C50.07,-184.18 67.21,-177.2 81.7,-171.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.8,-174.63 90.75,-167.62 80.16,-168.15 82.8,-174.63"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="130.25,-206.25 92.5,-206.25 92.5,-187 130.25,-187 130.25,-206.25"/>
-<text text-anchor="middle" x="111.38" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node14 -->
-<g id="edge14_Node000001_Node000014" class="edge">
-<title>Node1&#45;&gt;Node14</title>
-<g id="a_edge14_Node000001_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.45,-196.62C49.82,-196.62 66.54,-196.62 80.84,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.63,-200.13 90.63,-196.63 80.63,-193.13 80.63,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="130.25,-131.25 92.5,-131.25 92.5,-112 130.25,-112 130.25,-131.25"/>
-<text text-anchor="middle" x="111.38" y="-117.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge20_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge20_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.35,-186.53C37.08,-174.48 54.66,-154.26 73,-140.62 75.83,-138.52 78.93,-136.53 82.09,-134.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.63,-137.84 90.82,-130.06 80.35,-131.65 83.63,-137.84"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.5,-94.25 84.25,-94.25 84.25,-75 138.5,-75 138.5,-94.25"/>
-<text text-anchor="middle" x="111.38" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node18 -->
-<g id="edge27_Node000001_Node000018" class="edge">
-<title>Node1&#45;&gt;Node18</title>
-<g id="a_edge27_Node000001_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.92,-186.55C29.73,-167.8 46.65,-127.23 73,-102.62 73.61,-102.05 74.25,-101.5 74.9,-100.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.55,-104.06 82.88,-95.57 72.64,-98.26 76.55,-104.06"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="392.5,-169.25 339,-169.25 339,-150 392.5,-150 392.5,-169.25"/>
-<text text-anchor="middle" x="365.75" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.62,-166.8C136.96,-169.7 143.93,-173.38 149.75,-177.62 168.54,-191.34 164.38,-206.43 185.75,-215.62 221.37,-230.95 235.67,-226.12 273,-215.62 299.98,-208.04 326.88,-190.08 344.51,-176.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="346.46,-179.45 352.11,-170.49 342.1,-173.97 346.46,-179.45"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="256.5,-206.25 202.25,-206.25 202.25,-187 256.5,-187 256.5,-206.25"/>
-<text text-anchor="middle" x="229.38" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.5,-165.41C146.63,-170.55 170.73,-178.24 190.98,-184.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.73,-187.97 200.32,-187.68 191.86,-181.3 189.73,-187.97"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.75,-56.25 191,-56.25 191,-37 267.75,-37 267.75,-56.25"/>
-<text text-anchor="middle" x="229.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_nd_data</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge8_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge8_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.68,-153.22C137.31,-150.21 144.47,-146.05 149.75,-140.62 175.81,-113.83 158.76,-90.48 185.75,-64.62 186.36,-64.04 186.99,-63.48 187.64,-62.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.3,-66.03 195.67,-57.56 185.41,-60.21 189.3,-66.03"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#ae571600aa42a81bc14a4a602ea5ff00d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.88,-169.25 198.88,-169.25 198.88,-150 259.88,-150 259.88,-169.25"/>
-<text text-anchor="middle" x="229.38" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_circle</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node13 -->
-<g id="edge12_Node000005_Node000013" class="edge">
-<title>Node5&#45;&gt;Node13</title>
-<g id="a_edge12_Node000005_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.5,-159.62C145.66,-159.62 167.87,-159.62 187.3,-159.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.14,-163.13 197.14,-159.63 187.14,-156.13 187.14,-163.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="512.75,-150.25 458.5,-150.25 458.5,-131 512.75,-131 512.75,-150.25"/>
-<text text-anchor="middle" x="485.62" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M392.91,-155.41C408.75,-152.86 429.21,-149.56 446.79,-146.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="447.32,-150.18 456.64,-145.14 446.21,-143.27 447.32,-150.18"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="417.25,-93.25 314.25,-93.25 314.25,-74 417.25,-74 417.25,-93.25"/>
-<text text-anchor="middle" x="365.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.09,-56.74C282.5,-60.98 300.62,-65.97 317.03,-70.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.05,-73.84 326.62,-73.13 317.9,-67.1 316.05,-73.84"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="422.5,-56.25 309,-56.25 309,-37 422.5,-37 422.5,-56.25"/>
-<text text-anchor="middle" x="365.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge10_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge10_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M268.16,-46.62C277.3,-46.62 287.34,-46.62 297.39,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.17,-50.13 307.17,-46.63 297.17,-43.13 297.17,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="416.12,-19.25 315.38,-19.25 315.38,0 416.12,0 416.12,-19.25"/>
-<text text-anchor="middle" x="365.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node12 -->
-<g id="edge11_Node000009_Node000012" class="edge">
-<title>Node9&#45;&gt;Node12</title>
-<g id="a_edge11_Node000009_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.09,-36.51C282.5,-32.27 300.62,-27.28 317.03,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.9,-26.15 326.62,-20.12 316.05,-19.41 317.9,-26.15"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node6 -->
-<g id="edge13_Node000013_Node000006" class="edge">
-<title>Node13&#45;&gt;Node6</title>
-<g id="a_edge13_Node000013_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.2,-159.62C279.94,-159.62 305.99,-159.62 327.15,-159.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.13,-163.13 337.13,-159.63 327.13,-156.13 327.13,-163.13"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node6 -->
-<g id="edge15_Node000014_Node000006" class="edge">
-<title>Node14&#45;&gt;Node6</title>
-<g id="a_edge15_Node000014_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.69,-202.49C137.33,-205.33 144.48,-209.3 149.75,-214.62 176.31,-241.49 153.88,-271.34 185.75,-291.62 218.47,-312.44 238.63,-309.59 273,-291.62 318.18,-268.01 345.6,-210.89 357.6,-180.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="360.73,-181.73 360.92,-171.14 354.16,-179.3 360.73,-181.73"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node8 -->
-<g id="edge16_Node000014_Node000008" class="edge">
-<title>Node14&#45;&gt;Node8</title>
-<g id="a_edge16_Node000014_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.5,-196.62C146.48,-196.62 170.29,-196.62 190.42,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.25,-200.13 200.25,-196.63 190.25,-193.13 190.25,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node9 -->
-<g id="edge17_Node000014_Node000009" class="edge">
-<title>Node14&#45;&gt;Node9</title>
-<g id="a_edge17_Node000014_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.68,-191.27C137.48,-188.47 144.75,-184.39 149.75,-178.62 184.54,-138.47 149.98,-103.91 185.75,-64.62 186.12,-64.22 186.49,-63.83 186.88,-63.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.96,-66.26 194.88,-57.47 184.77,-60.65 188.96,-66.26"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.88,-282.25 186.88,-282.25 186.88,-263 271.88,-263 271.88,-282.25"/>
-<text text-anchor="middle" x="229.38" y="-268.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_lamniscate</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge18_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge18_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.49,-203.98C136.82,-206.9 143.82,-210.54 149.75,-214.62 167.88,-227.1 168.03,-235.57 185.75,-248.62 189.67,-251.51 193.98,-254.31 198.3,-256.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.5,-259.92 206.92,-261.84 199.97,-253.84 196.5,-259.92"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node6 -->
-<g id="edge19_Node000015_Node000006" class="edge">
-<title>Node15&#45;&gt;Node6</title>
-<g id="a_edge19_Node000015_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M250.56,-262.65C257.88,-258.67 266.06,-253.81 273,-248.62 301.88,-227.06 331.05,-197.03 348.51,-177.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.97,-180.46 355.08,-170.69 345.78,-175.77 350.97,-180.46"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node6 -->
-<g id="edge21_Node000016_Node000006" class="edge">
-<title>Node16&#45;&gt;Node6</title>
-<g id="a_edge21_Node000016_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.27,-123.23C160.01,-126.02 221.45,-132.25 273,-140.62 291.13,-143.57 311.12,-147.61 327.8,-151.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.76,-154.57 337.28,-153.29 328.26,-147.73 326.76,-154.57"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node8 -->
-<g id="edge22_Node000016_Node000008" class="edge">
-<title>Node16&#45;&gt;Node8</title>
-<g id="a_edge22_Node000016_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.6,-129.34C136.94,-132.42 143.92,-136.27 149.75,-140.62 168.39,-154.54 166.63,-165.37 185.75,-178.62 187.58,-179.89 189.52,-181.1 191.51,-182.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.92,-185.36 200.43,-186.72 193.07,-179.11 189.92,-185.36"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node9 -->
-<g id="edge23_Node000016_Node000009" class="edge">
-<title>Node16&#45;&gt;Node9</title>
-<g id="a_edge23_Node000016_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.65,-114.49C136.99,-111.59 143.96,-107.91 149.75,-103.62 168.71,-89.59 166.45,-78.19 185.75,-64.62 187.11,-63.67 188.52,-62.76 189.97,-61.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.4,-65.08 198.62,-57.32 188.14,-58.89 191.4,-65.08"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#a7154fe319e6033485a8a6cd6f0d8932d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273,-93.25 185.75,-93.25 185.75,-74 273,-74 273,-93.25"/>
-<text text-anchor="middle" x="229.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3d_classes</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge24_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge24_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.5,-115.69C145.59,-110.74 167.66,-103.51 187.03,-97.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.89,-100.57 196.31,-94.13 185.71,-93.92 187.89,-100.57"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node6 -->
-<g id="edge25_Node000017_Node000006" class="edge">
-<title>Node17&#45;&gt;Node6</title>
-<g id="a_edge25_Node000017_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.41,-93.55C256.91,-97.67 265.5,-102.64 273,-107.62 289.88,-118.85 291.55,-125.31 309,-135.62 315.07,-139.21 321.78,-142.57 328.38,-145.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.59,-148.6 337.15,-149.36 329.36,-142.18 326.59,-148.6"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node7 -->
-<g id="edge26_Node000017_Node000007" class="edge">
-<title>Node17&#45;&gt;Node7</title>
-<g id="a_edge26_Node000017_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M271.14,-93.67C283.3,-96.62 296.68,-99.8 309,-102.62 356.61,-113.53 411.67,-125.31 447.26,-132.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="446.11,-136.15 456.62,-134.78 447.55,-129.3 446.11,-136.15"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d49/kohonen__som__trace_8cpp_a53082f2e5bacec40266499da4547309a_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_a53082f2e5bacec40266499da4547309a_cgraph.map
deleted file mode 100644
index 78f1e3d54..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a53082f2e5bacec40266499da4547309a_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test_lamniscate" name="test_lamniscate">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,119,31"/>
-<area shape="rect" id="Node000002" href="$d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" title=" " alt="" coords="167,5,238,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="119,16,151,16,151,21,119,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="286,5,358,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="238,16,270,16,270,21,238,21"/>
-</map>
diff --git a/d9/d49/kohonen__som__trace_8cpp_a53082f2e5bacec40266499da4547309a_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_a53082f2e5bacec40266499da4547309a_cgraph.md5
deleted file mode 100644
index 7e9a664fd..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a53082f2e5bacec40266499da4547309a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9516689ac595d061a1bbe931aa701a38
\ No newline at end of file
diff --git a/d9/d49/kohonen__som__trace_8cpp_a53082f2e5bacec40266499da4547309a_cgraph.svg b/d9/d49/kohonen__som__trace_8cpp_a53082f2e5bacec40266499da4547309a_cgraph.svg
deleted file mode 100644
index 37c96c462..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a53082f2e5bacec40266499da4547309a_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_lamniscate Pages: 1 -->
-<svg width="273pt" height="27pt"
- viewBox="0.00 0.00 272.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test_lamniscate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="85,-19.25 0,-19.25 0,0 85,0 85,-19.25"/>
-<text text-anchor="middle" x="42.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_lamniscate</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="174.5,-19.25 121,-19.25 121,0 174.5,0 174.5,-19.25"/>
-<text text-anchor="middle" x="147.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.5,-9.62C93.43,-9.62 101.68,-9.62 109.46,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="109.28,-13.13 119.28,-9.63 109.28,-6.13 109.28,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.75,-19.25 210.5,-19.25 210.5,0 264.75,0 264.75,-19.25"/>
-<text text-anchor="middle" x="237.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.64,-9.62C182.12,-9.62 190.45,-9.62 198.51,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.49,-13.13 208.49,-9.63 198.49,-6.13 198.49,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d49/kohonen__som__trace_8cpp_a53082f2e5bacec40266499da4547309a_cgraph_org.svg b/d9/d49/kohonen__som__trace_8cpp_a53082f2e5bacec40266499da4547309a_cgraph_org.svg
deleted file mode 100644
index 7e76b2877..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a53082f2e5bacec40266499da4547309a_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_lamniscate Pages: 1 -->
-<svg width="273pt" height="27pt"
- viewBox="0.00 0.00 272.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test_lamniscate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="85,-19.25 0,-19.25 0,0 85,0 85,-19.25"/>
-<text text-anchor="middle" x="42.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_lamniscate</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="174.5,-19.25 121,-19.25 121,0 174.5,0 174.5,-19.25"/>
-<text text-anchor="middle" x="147.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.5,-9.62C93.43,-9.62 101.68,-9.62 109.46,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="109.28,-13.13 119.28,-9.63 109.28,-6.13 109.28,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.75,-19.25 210.5,-19.25 210.5,0 264.75,0 264.75,-19.25"/>
-<text text-anchor="middle" x="237.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.64,-9.62C182.12,-9.62 190.45,-9.62 198.51,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.49,-13.13 208.49,-9.63 198.49,-6.13 198.49,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
deleted file mode 100644
index 027e8088a..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="test3" name="test3">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,131,56,156"/>
-<area shape="rect" id="Node000002" href="$d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" title=" " alt="" coords="308,205,379,231"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,155,73,174,105,190,153,204,203,212,293,217,292,223,203,218,152,209,103,195,71,178,45,159"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="126,105,198,131"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,136,110,125,111,131,57,141"/>
-<area shape="rect" id="Node000005" href="$d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67" title=" " alt="" coords="111,56,213,82"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="47,128,102,91,111,86,113,91,105,95,50,133"/>
-<area shape="rect" id="Node000009" href="$d9/d49/kohonen__som__trace_8cpp.html#a7154fe319e6033485a8a6cd6f0d8932d" title=" " alt="" coords="104,155,220,180"/>
-<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="57,145,89,151,88,157,56,151"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="467,180,540,206"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="379,210,451,198,452,204,380,215"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="275,104,412,130"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="214,80,279,97,277,102,213,85"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="268,5,419,31"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="210,53,280,33,281,38,211,58"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="276,55,411,80"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="214,66,261,65,261,71,214,71"/>
-<area shape="poly" id="edge9_Node000009_Node000002" title=" " alt="" coords="211,178,294,202,292,207,210,184"/>
-<area shape="poly" id="edge10_Node000009_Node000003" title=" " alt="" coords="220,169,452,186,451,192,220,174"/>
-</map>
diff --git a/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
deleted file mode 100644
index 6007e63f7..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fbb5b48a9b38136985e26334df885cb7
\ No newline at end of file
diff --git a/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
deleted file mode 100644
index 571da60f0..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
+++ /dev/null
@@ -1,209 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<svg width="409pt" height="177pt"
- viewBox="0.00 0.00 408.75 177.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 173.25)">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-75.25 0,-75.25 0,-56 37.75,-56 37.75,-75.25"/>
-<text text-anchor="middle" x="18.88" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="280.5,-19.25 227,-19.25 227,0 280.5,0 280.5,-19.25"/>
-<text text-anchor="middle" x="253.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.91,-55.57C41.19,-46.84 57.36,-34.68 73.75,-28.62 120.44,-11.38 178.32,-8.24 215.39,-8.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.1,-11.82 225.14,-8.44 215.18,-4.82 215.1,-11.82"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="144.5,-94.25 90.25,-94.25 90.25,-75 144.5,-75 144.5,-94.25"/>
-<text text-anchor="middle" x="117.38" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.03,-69.2C49.57,-71.47 64.95,-74.5 79.02,-77.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.95,-80.63 88.44,-79.12 79.3,-73.76 77.95,-80.63"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.75,-131.25 79,-131.25 79,-112 155.75,-112 155.75,-131.25"/>
-<text text-anchor="middle" x="117.38" y="-117.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_nd_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.22,-75.49C42.82,-83.68 58.74,-95.29 73.75,-103.62 75.78,-104.75 77.9,-105.85 80.05,-106.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.34,-109.99 88.88,-111.01 81.28,-103.63 78.34,-109.99"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#a7154fe319e6033485a8a6cd6f0d8932d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161,-57.25 73.75,-57.25 73.75,-38 161,-38 161,-57.25"/>
-<text text-anchor="middle" x="117.38" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3d_classes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.03,-62.24C45.09,-60.92 53.59,-59.34 62.34,-57.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.8,-61.18 71.99,-55.9 61.52,-54.3 62.8,-61.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.75,-38.25 346.5,-38.25 346.5,-19 400.75,-19 400.75,-38.25"/>
-<text text-anchor="middle" x="373.62" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.91,-13.84C296.75,-16.39 317.21,-19.69 334.79,-22.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.21,-25.98 344.64,-24.11 335.32,-19.07 334.21,-25.98"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-95.25 202.25,-95.25 202.25,-76 305.25,-76 305.25,-95.25"/>
-<text text-anchor="middle" x="253.75" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.16,-111.5C171.17,-107.48 188.62,-102.8 204.53,-98.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.03,-102.03 213.78,-96.06 203.22,-95.27 205.03,-102.03"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="310.5,-169.25 197,-169.25 197,-150 310.5,-150 310.5,-169.25"/>
-<text text-anchor="middle" x="253.75" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.03,-131.71C170.11,-136.25 189.29,-141.68 206.46,-146.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.36,-149.86 215.94,-149.21 207.27,-143.13 205.36,-149.86"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.12,-132.25 203.38,-132.25 203.38,-113 304.12,-113 304.12,-132.25"/>
-<text text-anchor="middle" x="253.75" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.16,-121.91C167.22,-121.99 179.61,-122.08 191.72,-122.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.66,-125.67 201.69,-122.24 191.71,-118.67 191.66,-125.67"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node2 -->
-<g id="edge9_Node000009_Node000002" class="edge">
-<title>Node9&#45;&gt;Node2</title>
-<g id="a_edge9_Node000009_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.03,-37.54C173.05,-32.16 196.43,-25.55 215.66,-20.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="216.61,-23.48 225.28,-17.39 214.7,-16.75 216.61,-23.48"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge10_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge10_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.22,-44.42C209.78,-40.79 288.2,-34.93 334.65,-31.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.79,-34.96 344.5,-30.73 334.27,-27.98 334.79,-34.96"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
deleted file mode 100644
index dbd148ae2..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
+++ /dev/null
@@ -1,183 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<svg width="409pt" height="177pt"
- viewBox="0.00 0.00 408.75 177.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 173.25)">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-75.25 0,-75.25 0,-56 37.75,-56 37.75,-75.25"/>
-<text text-anchor="middle" x="18.88" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="280.5,-19.25 227,-19.25 227,0 280.5,0 280.5,-19.25"/>
-<text text-anchor="middle" x="253.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.91,-55.57C41.19,-46.84 57.36,-34.68 73.75,-28.62 120.44,-11.38 178.32,-8.24 215.39,-8.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.1,-11.82 225.14,-8.44 215.18,-4.82 215.1,-11.82"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="144.5,-94.25 90.25,-94.25 90.25,-75 144.5,-75 144.5,-94.25"/>
-<text text-anchor="middle" x="117.38" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.03,-69.2C49.57,-71.47 64.95,-74.5 79.02,-77.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.95,-80.63 88.44,-79.12 79.3,-73.76 77.95,-80.63"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.75,-131.25 79,-131.25 79,-112 155.75,-112 155.75,-131.25"/>
-<text text-anchor="middle" x="117.38" y="-117.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_nd_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.22,-75.49C42.82,-83.68 58.74,-95.29 73.75,-103.62 75.78,-104.75 77.9,-105.85 80.05,-106.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.34,-109.99 88.88,-111.01 81.28,-103.63 78.34,-109.99"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/d49/kohonen__som__trace_8cpp.html#a7154fe319e6033485a8a6cd6f0d8932d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161,-57.25 73.75,-57.25 73.75,-38 161,-38 161,-57.25"/>
-<text text-anchor="middle" x="117.38" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3d_classes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.03,-62.24C45.09,-60.92 53.59,-59.34 62.34,-57.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.8,-61.18 71.99,-55.9 61.52,-54.3 62.8,-61.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.75,-38.25 346.5,-38.25 346.5,-19 400.75,-19 400.75,-38.25"/>
-<text text-anchor="middle" x="373.62" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.91,-13.84C296.75,-16.39 317.21,-19.69 334.79,-22.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.21,-25.98 344.64,-24.11 335.32,-19.07 334.21,-25.98"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-95.25 202.25,-95.25 202.25,-76 305.25,-76 305.25,-95.25"/>
-<text text-anchor="middle" x="253.75" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.16,-111.5C171.17,-107.48 188.62,-102.8 204.53,-98.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.03,-102.03 213.78,-96.06 203.22,-95.27 205.03,-102.03"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="310.5,-169.25 197,-169.25 197,-150 310.5,-150 310.5,-169.25"/>
-<text text-anchor="middle" x="253.75" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.03,-131.71C170.11,-136.25 189.29,-141.68 206.46,-146.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.36,-149.86 215.94,-149.21 207.27,-143.13 205.36,-149.86"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.12,-132.25 203.38,-132.25 203.38,-113 304.12,-113 304.12,-132.25"/>
-<text text-anchor="middle" x="253.75" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.16,-121.91C167.22,-121.99 179.61,-122.08 191.72,-122.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.66,-125.67 201.69,-122.24 191.71,-118.67 191.66,-125.67"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node2 -->
-<g id="edge9_Node000009_Node000002" class="edge">
-<title>Node9&#45;&gt;Node2</title>
-<g id="a_edge9_Node000009_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.03,-37.54C173.05,-32.16 196.43,-25.55 215.66,-20.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="216.61,-23.48 225.28,-17.39 214.7,-16.75 216.61,-23.48"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge10_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge10_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.22,-44.42C209.78,-40.79 288.2,-34.93 334.65,-31.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.79,-34.96 344.5,-30.73 334.27,-27.98 334.79,-34.96"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d49/kohonen__som__trace_8cpp_a7154fe319e6033485a8a6cd6f0d8932d_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_a7154fe319e6033485a8a6cd6f0d8932d_cgraph.map
deleted file mode 100644
index ff907d846..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a7154fe319e6033485a8a6cd6f0d8932d_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="test_3d_classes" name="test_3d_classes">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,122,56"/>
-<area shape="rect" id="Node000002" href="$d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" title=" " alt="" coords="170,5,241,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="122,30,154,25,154,30,123,36"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="289,31,361,56"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="122,41,273,41,273,46,122,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="242,23,274,30,273,35,241,28"/>
-</map>
diff --git a/d9/d49/kohonen__som__trace_8cpp_a7154fe319e6033485a8a6cd6f0d8932d_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_a7154fe319e6033485a8a6cd6f0d8932d_cgraph.md5
deleted file mode 100644
index a21722631..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a7154fe319e6033485a8a6cd6f0d8932d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-681ddc8c679d36dfed9380e87d77df6e
\ No newline at end of file
diff --git a/d9/d49/kohonen__som__trace_8cpp_a7154fe319e6033485a8a6cd6f0d8932d_cgraph.svg b/d9/d49/kohonen__som__trace_8cpp_a7154fe319e6033485a8a6cd6f0d8932d_cgraph.svg
deleted file mode 100644
index 03f3c658f..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a7154fe319e6033485a8a6cd6f0d8932d_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_3d_classes Pages: 1 -->
-<svg width="275pt" height="46pt"
- viewBox="0.00 0.00 275.00 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>test_3d_classes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="87.25,-19.25 0,-19.25 0,0 87.25,0 87.25,-19.25"/>
-<text text-anchor="middle" x="43.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3d_classes</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-38.25 123.25,-38.25 123.25,-19 176.75,-19 176.75,-38.25"/>
-<text text-anchor="middle" x="150" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.68,-17.46C95.59,-18.9 103.78,-20.39 111.51,-21.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.82,-25.23 121.29,-23.58 112.07,-18.35 110.82,-25.23"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267,-19.25 212.75,-19.25 212.75,0 267,0 267,-19.25"/>
-<text text-anchor="middle" x="239.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.74,-9.62C121.68,-9.62 168.53,-9.62 201.04,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.8,-13.13 210.8,-9.63 200.8,-6.13 200.8,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.89,-23.03C184.46,-21.39 192.9,-19.57 201.05,-17.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.74,-21.23 210.78,-15.7 200.26,-14.39 201.74,-21.23"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d49/kohonen__som__trace_8cpp_a7154fe319e6033485a8a6cd6f0d8932d_cgraph_org.svg b/d9/d49/kohonen__som__trace_8cpp_a7154fe319e6033485a8a6cd6f0d8932d_cgraph_org.svg
deleted file mode 100644
index 0eda4c172..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_a7154fe319e6033485a8a6cd6f0d8932d_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_3d_classes Pages: 1 -->
-<svg width="275pt" height="46pt"
- viewBox="0.00 0.00 275.00 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>test_3d_classes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="87.25,-19.25 0,-19.25 0,0 87.25,0 87.25,-19.25"/>
-<text text-anchor="middle" x="43.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3d_classes</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-38.25 123.25,-38.25 123.25,-19 176.75,-19 176.75,-38.25"/>
-<text text-anchor="middle" x="150" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.68,-17.46C95.59,-18.9 103.78,-20.39 111.51,-21.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.82,-25.23 121.29,-23.58 112.07,-18.35 110.82,-25.23"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267,-19.25 212.75,-19.25 212.75,0 267,0 267,-19.25"/>
-<text text-anchor="middle" x="239.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.74,-9.62C121.68,-9.62 168.53,-9.62 201.04,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.8,-13.13 210.8,-9.63 200.8,-6.13 200.8,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.89,-23.03C184.46,-21.39 192.9,-19.57 201.05,-17.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.74,-21.23 210.78,-15.7 200.26,-14.39 201.74,-21.23"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d49/kohonen__som__trace_8cpp_ae571600aa42a81bc14a4a602ea5ff00d_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_ae571600aa42a81bc14a4a602ea5ff00d_cgraph.map
deleted file mode 100644
index 7d5c7ff29..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_ae571600aa42a81bc14a4a602ea5ff00d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test_circle" name="test_circle">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,87,31"/>
-<area shape="rect" id="Node000002" href="$d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" title=" " alt="" coords="135,5,206,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="87,16,119,16,119,21,87,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="254,5,326,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="206,16,238,16,238,21,206,21"/>
-</map>
diff --git a/d9/d49/kohonen__som__trace_8cpp_ae571600aa42a81bc14a4a602ea5ff00d_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_ae571600aa42a81bc14a4a602ea5ff00d_cgraph.md5
deleted file mode 100644
index 558bf8cff..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_ae571600aa42a81bc14a4a602ea5ff00d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-22dabedce2b6f4fb17b45ed8043d5b09
\ No newline at end of file
diff --git a/d9/d49/kohonen__som__trace_8cpp_ae571600aa42a81bc14a4a602ea5ff00d_cgraph.svg b/d9/d49/kohonen__som__trace_8cpp_ae571600aa42a81bc14a4a602ea5ff00d_cgraph.svg
deleted file mode 100644
index bef52ef8a..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_ae571600aa42a81bc14a4a602ea5ff00d_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_circle Pages: 1 -->
-<svg width="249pt" height="27pt"
- viewBox="0.00 0.00 248.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test_circle</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="61,-19.25 0,-19.25 0,0 61,0 61,-19.25"/>
-<text text-anchor="middle" x="30.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_circle</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.5,-19.25 97,-19.25 97,0 150.5,0 150.5,-19.25"/>
-<text text-anchor="middle" x="123.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.38,-9.62C69.06,-9.62 77.42,-9.62 85.43,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.28,-13.13 95.28,-9.63 85.28,-6.13 85.28,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="240.75,-19.25 186.5,-19.25 186.5,0 240.75,0 240.75,-19.25"/>
-<text text-anchor="middle" x="213.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.64,-9.62C158.12,-9.62 166.45,-9.62 174.51,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.49,-13.13 184.49,-9.63 174.49,-6.13 174.49,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d49/kohonen__som__trace_8cpp_ae571600aa42a81bc14a4a602ea5ff00d_cgraph_org.svg b/d9/d49/kohonen__som__trace_8cpp_ae571600aa42a81bc14a4a602ea5ff00d_cgraph_org.svg
deleted file mode 100644
index 028bf975b..000000000
--- a/d9/d49/kohonen__som__trace_8cpp_ae571600aa42a81bc14a4a602ea5ff00d_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_circle Pages: 1 -->
-<svg width="249pt" height="27pt"
- viewBox="0.00 0.00 248.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test_circle</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="61,-19.25 0,-19.25 0,0 61,0 61,-19.25"/>
-<text text-anchor="middle" x="30.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_circle</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.5,-19.25 97,-19.25 97,0 150.5,0 150.5,-19.25"/>
-<text text-anchor="middle" x="123.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.38,-9.62C69.06,-9.62 77.42,-9.62 85.43,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.28,-13.13 95.28,-9.63 85.28,-6.13 85.28,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="240.75,-19.25 186.5,-19.25 186.5,0 240.75,0 240.75,-19.25"/>
-<text text-anchor="middle" x="213.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.64,-9.62C158.12,-9.62 166.45,-9.62 174.51,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.49,-13.13 184.49,-9.63 174.49,-6.13 174.49,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d49/kohonen__som__trace_8cpp_source.html b/d9/d49/kohonen__som__trace_8cpp_source.html
new file mode 100644
index 000000000..0e171943f
--- /dev/null
+++ b/d9/d49/kohonen__som__trace_8cpp_source.html
@@ -0,0 +1,497 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: machine_learning/kohonen_som_trace.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d49/kohonen__som__trace_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">kohonen_som_trace.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/d49/kohonen__som__trace_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#define _USE_MATH_DEFINES  </span><span class="comment">// required for MS Visual C++</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;array&gt;</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;cstdlib&gt;</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;fstream&gt;</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;valarray&gt;</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#ifdef _OPENMP  </span><span class="comment">// check if OpenMP based parallellization is available</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &lt;omp.h&gt;</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(<span class="keywordtype">double</span> a, <span class="keywordtype">double</span> b) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">return</span> ((b - a) * (std::rand() % 100) / 100.f) + a;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>}</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="foldopen" id="foldopen00058" data-start="{" data-end="}">
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">   58</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">save_nd_data</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> *fname,</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>                 <span class="keyword">const</span> std::vector&lt;std::valarray&lt;double&gt;&gt; &amp;X) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordtype">size_t</span> num_points = X.size();       <span class="comment">// number of rows</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordtype">size_t</span> num_features = X[0].size();  <span class="comment">// number of columns</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    std::ofstream fp;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    fp.open(fname);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordflow">if</span> (!fp.is_open()) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="comment">// error with opening file to write</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Error opening file &quot;</span> &lt;&lt; fname &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="comment">// for each point in the array</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; num_points; i++) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        <span class="comment">// for each feature in the array</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; num_features; j++) {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            fp &lt;&lt; X[i][j];               <span class="comment">// print the feature value</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>            <span class="keywordflow">if</span> (j &lt; num_features - 1) {  <span class="comment">// if not the last feature</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>                fp &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;               <span class="comment">// suffix comma</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            }</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="keywordflow">if</span> (i &lt; num_points - 1) {  <span class="comment">// if not the last row</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>            fp &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;            <span class="comment">// start a new line</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        }</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    }</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    fp.close();</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>}</div>
+</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d77/namespacemachine__learning.html">machine_learning</a> {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="foldopen" id="foldopen00103" data-start="{" data-end="}">
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#aa6aac06ccf128b0a9c55c9ee1a8e5631">  103</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3">update_weights</a>(<span class="keyword">const</span> std::valarray&lt;double&gt; &amp;x,</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>                    std::vector&lt;std::valarray&lt;double&gt;&gt; *W,</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>                    std::valarray&lt;double&gt; *D, <span class="keywordtype">double</span> alpha, <span class="keywordtype">int</span> R) {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="keywordtype">int</span> j = 0, k = 0;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <span class="keywordtype">int</span> num_out = W-&gt;size();  <span class="comment">// number of SOM output nodes</span></div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="comment">// int num_features = x.size();  // number of data features</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span><span class="preprocessor">#pragma omp for</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="comment">// step 1: for each output point</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="keywordflow">for</span> (j = 0; j &lt; num_out; j++) {</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        <span class="comment">// compute Euclidian distance of each output</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        <span class="comment">// point from the current sample</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        (*D)[j] = (((*W)[j] - x) * ((*W)[j] - x)).<a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a>();</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    }</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <span class="comment">// step 2:  get closest node i.e., node with snallest Euclidian distance to</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="comment">// the current pattern</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="keyword">auto</span> result = std::min_element(std::begin(*D), std::end(*D));</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    <span class="comment">// double d_min = *result;</span></div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    <span class="keywordtype">int</span> d_min_idx = std::distance(std::begin(*D), result);</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <span class="comment">// step 3a: get the neighborhood range</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    <span class="keywordtype">int</span> from_node = std::max(0, d_min_idx - R);</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    <span class="keywordtype">int</span> to_node = std::min(num_out, d_min_idx + R + 1);</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="comment">// step 3b: update the weights of nodes in the</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <span class="comment">// neighborhood</span></div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span><span class="preprocessor">#pragma omp for</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <span class="keywordflow">for</span> (j = from_node; j &lt; to_node; j++) {</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        <span class="comment">// update weights of nodes in the neighborhood</span></div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        (*W)[j] += alpha * (x - (*W)[j]);</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    }</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>}</div>
+</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span> </div>
+<div class="foldopen" id="foldopen00149" data-start="{" data-end="}">
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"><a class="line" href="../../d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3">  149</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3">kohonen_som_tracer</a>(<span class="keyword">const</span> std::vector&lt;std::valarray&lt;double&gt;&gt; &amp;X,</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>                        std::vector&lt;std::valarray&lt;double&gt;&gt; *W,</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>                        <span class="keywordtype">double</span> alpha_min) {</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    <span class="keywordtype">int</span> num_samples = X.size();  <span class="comment">// number of rows</span></div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    <span class="comment">// int num_features = X[0].size();  // number of columns</span></div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <span class="keywordtype">int</span> num_out = W-&gt;size();  <span class="comment">// number of rows</span></div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    <span class="keywordtype">int</span> R = num_out &gt;&gt; 2, iter = 0;</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    <span class="keywordtype">double</span> alpha = 1.f;</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span> </div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    std::valarray&lt;double&gt; D(num_out);</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span> </div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    <span class="comment">// Loop alpha from 1 to slpha_min</span></div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        <span class="comment">// Loop for each sample pattern in the data set</span></div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> sample = 0; sample &lt; num_samples; sample++) {</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>            <span class="comment">// update weights for the current input pattern sample</span></div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>            <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3">update_weights</a>(X[sample], W, &amp;D, alpha, R);</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        }</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span> </div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        <span class="comment">// every 10th iteration, reduce the neighborhood range</span></div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>        <span class="keywordflow">if</span> (iter % 10 == 0 &amp;&amp; R &gt; 1) {</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>            R--;</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>        }</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span> </div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>        alpha -= 0.01;</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        iter++;</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    } <span class="keywordflow">while</span> (alpha &gt; alpha_min);</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>}</div>
+</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span> </div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>}  <span class="comment">// namespace machine_learning</span></div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span> </div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span><span class="keyword">using </span><a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3">machine_learning::kohonen_som_tracer</a>;</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span> </div>
+<div class="foldopen" id="foldopen00196" data-start="{" data-end="}">
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"><a class="line" href="../../d9/d49/kohonen__som__trace_8cpp.html#ae571600aa42a81bc14a4a602ea5ff00d">  196</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d49/kohonen__som__trace_8cpp.html#ae571600aa42a81bc14a4a602ea5ff00d">test_circle</a>(std::vector&lt;std::valarray&lt;double&gt;&gt; *<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> N = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>-&gt;size();</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> R = 0.75, dr = 0.3;</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    <span class="keywordtype">double</span> a_t = 0., b_t = 2.f * M_PI;  <span class="comment">// theta random between 0 and 2*pi</span></div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    <span class="keywordtype">double</span> a_r = R - dr, b_r = R + dr;  <span class="comment">// radius random between R-dr and R+dr</span></div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    <span class="keywordtype">int</span> i = 0;</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span> </div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span><span class="preprocessor">#pragma omp for</span></div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    <span class="keywordflow">for</span> (i = 0; i &lt; N; i++) {</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>        <span class="keywordtype">double</span> r = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(a_r, b_r);      <span class="comment">// random radius</span></div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>        <span class="keywordtype">double</span> theta = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(a_t, b_t);  <span class="comment">// random theta</span></div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][0] = r * cos(theta);    <span class="comment">// convert from polar to cartesian</span></div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][1] = r * sin(theta);</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    }</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>}</div>
+</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span> </div>
+<div class="foldopen" id="foldopen00233" data-start="{" data-end="}">
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"><a class="line" href="../../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">  233</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>() {</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    <span class="keywordtype">int</span> j = 0, N = 500;</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    <span class="keywordtype">int</span> features = 2;</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    <span class="keywordtype">int</span> num_out = 50;</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; X(N);</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; W(num_out);</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; std::max(num_out, N); i++) {</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>        <span class="comment">// loop till max(N, num_out)</span></div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>        <span class="keywordflow">if</span> (i &lt; N) {  <span class="comment">// only add new arrays if i &lt; N</span></div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>            X[i] = std::valarray&lt;double&gt;(features);</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>        }</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>        <span class="keywordflow">if</span> (i &lt; num_out) {  <span class="comment">// only add new arrays if i &lt; num_out</span></div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>            W[i] = std::valarray&lt;double&gt;(features);</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span> </div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span><span class="preprocessor">#pragma omp for</span></div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>            <span class="keywordflow">for</span> (j = 0; j &lt; features; j++) {</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>                <span class="comment">// preallocate with random initial weights</span></div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>                W[i][j] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(-1, 1);</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>            }</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>        }</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>    }</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span> </div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    <a class="code hl_function" href="../../d9/d49/kohonen__som__trace_8cpp.html#ae571600aa42a81bc14a4a602ea5ff00d">test_circle</a>(&amp;X);  <span class="comment">// create test data around circumference of a circle</span></div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">save_nd_data</a>(<span class="stringliteral">&quot;test1.csv&quot;</span>, X);    <span class="comment">// save test data points</span></div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>    <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">save_nd_data</a>(<span class="stringliteral">&quot;w11.csv&quot;</span>, W);      <span class="comment">// save initial random weights</span></div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>    kohonen_som_tracer(X, &amp;W, 0.1);  <span class="comment">// train the SOM</span></div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>    <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">save_nd_data</a>(<span class="stringliteral">&quot;w12.csv&quot;</span>, W);      <span class="comment">// save the resultant weights</span></div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>}</div>
+</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span> </div>
+<div class="foldopen" id="foldopen00277" data-start="{" data-end="}">
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"><a class="line" href="../../d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a">  277</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a">test_lamniscate</a>(std::vector&lt;std::valarray&lt;double&gt;&gt; *<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> N = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>-&gt;size();</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> dr = 0.2;</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>    <span class="keywordtype">int</span> i = 0;</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span> </div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span><span class="preprocessor">#pragma omp for</span></div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>    <span class="keywordflow">for</span> (i = 0; i &lt; N; i++) {</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>        <span class="keywordtype">double</span> dx = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(-dr, dr);     <span class="comment">// random change in x</span></div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>        <span class="keywordtype">double</span> dy = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(-dr, dr);     <span class="comment">// random change in y</span></div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>        <span class="keywordtype">double</span> theta = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(0, M_PI);  <span class="comment">// random theta</span></div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][0] = dx + cos(theta);  <span class="comment">// convert from polar to cartesian</span></div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][1] = dy + sin(2. * theta) / 2.f;</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>    }</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>}</div>
+</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span> </div>
+<div class="foldopen" id="foldopen00315" data-start="{" data-end="}">
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"><a class="line" href="../../d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0">  315</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>() {</div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>    <span class="keywordtype">int</span> j = 0, N = 500;</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>    <span class="keywordtype">int</span> features = 2;</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>    <span class="keywordtype">int</span> num_out = 20;</div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; X(N);</div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; W(num_out);</div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; std::max(num_out, N); i++) {</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>        <span class="comment">// loop till max(N, num_out)</span></div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>        <span class="keywordflow">if</span> (i &lt; N) {  <span class="comment">// only add new arrays if i &lt; N</span></div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>            X[i] = std::valarray&lt;double&gt;(features);</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>        }</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>        <span class="keywordflow">if</span> (i &lt; num_out) {  <span class="comment">// only add new arrays if i &lt; num_out</span></div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>            W[i] = std::valarray&lt;double&gt;(features);</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span> </div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span><span class="preprocessor">#pragma omp for</span></div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>            <span class="keywordflow">for</span> (j = 0; j &lt; features; j++) {</div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>                <span class="comment">// preallocate with random initial weights</span></div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>                W[i][j] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(-1, 1);</div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>            }</div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>        }</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>    }</div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span> </div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>    <a class="code hl_function" href="../../d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a">test_lamniscate</a>(&amp;X);              <span class="comment">// create test data around the lamniscate</span></div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>    <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">save_nd_data</a>(<span class="stringliteral">&quot;test2.csv&quot;</span>, X);     <span class="comment">// save test data points</span></div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>    <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">save_nd_data</a>(<span class="stringliteral">&quot;w21.csv&quot;</span>, W);       <span class="comment">// save initial random weights</span></div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>    kohonen_som_tracer(X, &amp;W, 0.01);  <span class="comment">// train the SOM</span></div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>    <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">save_nd_data</a>(<span class="stringliteral">&quot;w22.csv&quot;</span>, W);       <span class="comment">// save the resultant weights</span></div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>}</div>
+</div>
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span> </div>
+<div class="foldopen" id="foldopen00359" data-start="{" data-end="}">
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"><a class="line" href="../../d9/d49/kohonen__som__trace_8cpp.html#a7154fe319e6033485a8a6cd6f0d8932d">  359</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d49/kohonen__som__trace_8cpp.html#a7154fe319e6033485a8a6cd6f0d8932d">test_3d_classes</a>(std::vector&lt;std::valarray&lt;double&gt;&gt; *<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> N = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>-&gt;size();</div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> R = 0.1;  <span class="comment">// radius of cluster</span></div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>    <span class="keywordtype">int</span> i = 0;</div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> num_classes = 8;</div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>    <span class="keyword">const</span> std::array&lt;const std::array&lt;double, 3&gt;, num_classes&gt; centres = {</div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>        <span class="comment">// centres of each class cluster</span></div>
+<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>        std::array&lt;double, 3&gt;({.5, .5, .5}),    <span class="comment">// centre of class 0</span></div>
+<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>        std::array&lt;double, 3&gt;({.5, .5, -.5}),   <span class="comment">// centre of class 1</span></div>
+<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>        std::array&lt;double, 3&gt;({.5, -.5, .5}),   <span class="comment">// centre of class 2</span></div>
+<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>        std::array&lt;double, 3&gt;({.5, -.5, -.5}),  <span class="comment">// centre of class 3</span></div>
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>        std::array&lt;double, 3&gt;({-.5, .5, .5}),   <span class="comment">// centre of class 4</span></div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>        std::array&lt;double, 3&gt;({-.5, .5, -.5}),  <span class="comment">// centre of class 5</span></div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>        std::array&lt;double, 3&gt;({-.5, -.5, .5}),  <span class="comment">// centre of class 6</span></div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>        std::array&lt;double, 3&gt;({-.5, -.5, -.5})  <span class="comment">// centre of class 7</span></div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>    };</div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span> </div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span><span class="preprocessor">#pragma omp for</span></div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>    <span class="keywordflow">for</span> (i = 0; i &lt; N; i++) {</div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>        <span class="keywordtype">int</span> cls =</div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>            std::rand() % num_classes;  <span class="comment">// select a random class for the point</span></div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span> </div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>        <span class="comment">// create random coordinates (x,y,z) around the centre of the class</span></div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][0] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(centres[cls][0] - R, centres[cls][0] + R);</div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][1] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(centres[cls][1] - R, centres[cls][1] + R);</div>
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[0][i][2] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(centres[cls][2] - R, centres[cls][2] + R);</div>
+<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span> </div>
+<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>        <span class="comment">/* The follosing can also be used</span></div>
+<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span><span class="comment">        for (int j = 0; j &lt; 3; j++)</span></div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span><span class="comment">            data[0][i][j] = _random(centres[cls][j] - R, centres[cls][j] + R);</span></div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span><span class="comment">        */</span></div>
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>    }</div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>}</div>
+</div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span> </div>
+<div class="foldopen" id="foldopen00414" data-start="{" data-end="}">
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"><a class="line" href="../../d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">  414</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a>() {</div>
+<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>    <span class="keywordtype">int</span> j = 0, N = 200;</div>
+<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>    <span class="keywordtype">int</span> features = 3;</div>
+<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>    <span class="keywordtype">int</span> num_out = 20;</div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; X(N);</div>
+<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>    std::vector&lt;std::valarray&lt;double&gt;&gt; W(num_out);</div>
+<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; std::max(num_out, N); i++) {</div>
+<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>        <span class="comment">// loop till max(N, num_out)</span></div>
+<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>        <span class="keywordflow">if</span> (i &lt; N) {  <span class="comment">// only add new arrays if i &lt; N</span></div>
+<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>            X[i] = std::valarray&lt;double&gt;(features);</div>
+<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span>        }</div>
+<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span>        <span class="keywordflow">if</span> (i &lt; num_out) {  <span class="comment">// only add new arrays if i &lt; num_out</span></div>
+<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span>            W[i] = std::valarray&lt;double&gt;(features);</div>
+<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span> </div>
+<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span><span class="preprocessor">#pragma omp for</span></div>
+<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span>            <span class="keywordflow">for</span> (j = 0; j &lt; features; j++) {</div>
+<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>                <span class="comment">// preallocate with random initial weights</span></div>
+<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>                W[i][j] = <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a>(-1, 1);</div>
+<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>            }</div>
+<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>        }</div>
+<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>    }</div>
+<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span> </div>
+<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>    <a class="code hl_function" href="../../d9/d49/kohonen__som__trace_8cpp.html#a7154fe319e6033485a8a6cd6f0d8932d">test_3d_classes</a>(&amp;X);              <span class="comment">// create test data around the lamniscate</span></div>
+<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>    <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">save_nd_data</a>(<span class="stringliteral">&quot;test3.csv&quot;</span>, X);     <span class="comment">// save test data points</span></div>
+<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>    <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">save_nd_data</a>(<span class="stringliteral">&quot;w31.csv&quot;</span>, W);       <span class="comment">// save initial random weights</span></div>
+<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>    kohonen_som_tracer(X, &amp;W, 0.01);  <span class="comment">// train the SOM</span></div>
+<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>    <a class="code hl_function" href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">save_nd_data</a>(<span class="stringliteral">&quot;w32.csv&quot;</span>, W);       <span class="comment">// save the resultant weights</span></div>
+<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>}</div>
+</div>
+<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span> </div>
+<div class="foldopen" id="foldopen00452" data-start="{" data-end="}">
+<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"><a class="line" href="../../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908">  452</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(clock_t start_t, clock_t end_t) {</div>
+<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>    <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end_t - start_t) / CLOCKS_PER_SEC;</div>
+<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>}</div>
+</div>
+<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span> </div>
+<div class="foldopen" id="foldopen00457" data-start="{" data-end="}">
+<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"><a class="line" href="../../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">  457</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> **argv) {</div>
+<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Using OpenMP based parallelization\n&quot;</span>;</div>
+<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;NOT using OpenMP based parallelization\n&quot;</span>;</div>
+<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span> </div>
+<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span> </div>
+<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span>    std::clock_t start_clk = std::clock();</div>
+<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span>    <a class="code hl_function" href="../../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();</div>
+<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span>    <span class="keyword">auto</span> end_clk = std::clock();</div>
+<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 completed in &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(start_clk, end_clk)</div>
+<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span>              &lt;&lt; <span class="stringliteral">&quot; sec\n&quot;</span>;</div>
+<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span> </div>
+<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>    start_clk = std::clock();</div>
+<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span>    <a class="code hl_function" href="../../d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>();</div>
+<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span>    end_clk = std::clock();</div>
+<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 completed in &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(start_clk, end_clk)</div>
+<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span>              &lt;&lt; <span class="stringliteral">&quot; sec\n&quot;</span>;</div>
+<div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span> </div>
+<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>    start_clk = std::clock();</div>
+<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span>    <a class="code hl_function" href="../../d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a>();</div>
+<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span>    end_clk = std::clock();</div>
+<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 completed in &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a>(start_clk, end_clk)</div>
+<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>              &lt;&lt; <span class="stringliteral">&quot; sec\n&quot;</span>;</div>
+<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span> </div>
+<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span>    std::cout</div>
+<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span>        &lt;&lt; <span class="stringliteral">&quot;(Note: Calculated times include: creating test sets, training &quot;</span></div>
+<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span>           <span class="stringliteral">&quot;model and writing files to disk.)\n\n&quot;</span>;</div>
+<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span>}</div>
+</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="agroup__machine__learning_html_gae0208548f8b393528e5db01717e88e67"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67">save_nd_data</a></div><div class="ttdeci">int save_nd_data(const char *fname, const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</div><div class="ttdef"><b>Definition</b> <a href="#l00058">kohonen_som_trace.cpp:58</a></div></div>
+<div class="ttc" id="agroup__machine__learning_html_gaf5ce14f026d6d231bef29161bac2b485"><div class="ttname"><a href="../../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a></div><div class="ttdeci">double _random(double a, double b)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00053">kohonen_som_topology.cpp:53</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="akohonen__som__trace_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> <a href="#l00315">kohonen_som_trace.cpp:315</a></div></div>
+<div class="ttc" id="akohonen__som__trace_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition</b> <a href="#l00233">kohonen_som_trace.cpp:233</a></div></div>
+<div class="ttc" id="akohonen__som__trace_8cpp_html_a2256c10b16edba377b64a44b6c656908"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908">get_clock_diff</a></div><div class="ttdeci">double get_clock_diff(clock_t start_t, clock_t end_t)</div><div class="ttdef"><b>Definition</b> <a href="#l00452">kohonen_som_trace.cpp:452</a></div></div>
+<div class="ttc" id="akohonen__som__trace_8cpp_html_a53082f2e5bacec40266499da4547309a"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a">test_lamniscate</a></div><div class="ttdeci">void test_lamniscate(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> <a href="#l00277">kohonen_som_trace.cpp:277</a></div></div>
+<div class="ttc" id="akohonen__som__trace_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition</b> <a href="#l00414">kohonen_som_trace.cpp:414</a></div></div>
+<div class="ttc" id="akohonen__som__trace_8cpp_html_a7154fe319e6033485a8a6cd6f0d8932d"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a7154fe319e6033485a8a6cd6f0d8932d">test_3d_classes</a></div><div class="ttdeci">void test_3d_classes(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> <a href="#l00359">kohonen_som_trace.cpp:359</a></div></div>
+<div class="ttc" id="akohonen__som__trace_8cpp_html_ae571600aa42a81bc14a4a602ea5ff00d"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#ae571600aa42a81bc14a4a602ea5ff00d">test_circle</a></div><div class="ttdeci">void test_circle(std::vector&lt; std::valarray&lt; double &gt; &gt; *data)</div><div class="ttdef"><b>Definition</b> <a href="#l00196">kohonen_som_trace.cpp:196</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></div><div class="ttdoc">A* search algorithm</div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a042f435bca0839e721fc1574a61e8da3"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3">machine_learning::kohonen_som_tracer</a></div><div class="ttdeci">void kohonen_som_tracer(const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X, std::vector&lt; std::valarray&lt; double &gt; &gt; *W, double alpha_min)</div><div class="ttdef"><b>Definition</b> <a href="#l00149">kohonen_som_trace.cpp:149</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00232">vector_ops.hpp:232</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_ae868ad43698a1d69ba46ea3827d7d2c3"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3">machine_learning::update_weights</a></div><div class="ttdeci">double update_weights(const std::valarray&lt; double &gt; &amp;X, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; *W, std::vector&lt; std::valarray&lt; double &gt; &gt; *D, double alpha, int R)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00200">kohonen_som_topology.cpp:200</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_3343723ae086de42ee4ca9774da3a13f.html">machine_learning</a></li><li class="navelem"><a class="el" href="../../d9/d49/kohonen__som__trace_8cpp.html">kohonen_som_trace.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/d49/structdata__structures_1_1_node.html b/d9/d49/structdata__structures_1_1_node.html
index 78f02912b..56a2668d9 100644
--- a/d9/d49/structdata__structures_1_1_node.html
+++ b/d9/d49/structdata__structures_1_1_node.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::Node Struct Reference</title>
+<title>TheAlgorithms/C++: data_structures::Node Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,21 +141,20 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:ac75aa86a598357c5c882ec6a1174aa68" id="r_ac75aa86a598357c5c882ec6a1174aa68"><td class="memItemLeft" align="right" valign="top"><a id="ac75aa86a598357c5c882ec6a1174aa68" name="ac75aa86a598357c5c882ec6a1174aa68"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>key</b></td></tr>
-<tr class="memdesc:ac75aa86a598357c5c882ec6a1174aa68"><td class="mdescLeft">&#160;</td><td class="mdescRight">key integer <br /></td></tr>
+<tr class="memitem:ac75aa86a598357c5c882ec6a1174aa68" id="r_ac75aa86a598357c5c882ec6a1174aa68"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac75aa86a598357c5c882ec6a1174aa68">key</a></td></tr>
+<tr class="memdesc:ac75aa86a598357c5c882ec6a1174aa68"><td class="mdescLeft">&#160;</td><td class="mdescRight">key integer  <br /></td></tr>
 <tr class="separator:ac75aa86a598357c5c882ec6a1174aa68"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a6b973b0bded99b0c0bd84e887bf8c731" id="r_a6b973b0bded99b0c0bd84e887bf8c731"><td class="memItemLeft" align="right" valign="top"><a id="a6b973b0bded99b0c0bd84e887bf8c731" name="a6b973b0bded99b0c0bd84e887bf8c731"></a>
-void *&#160;</td><td class="memItemRight" valign="bottom"><b>value</b></td></tr>
-<tr class="memdesc:a6b973b0bded99b0c0bd84e887bf8c731"><td class="mdescLeft">&#160;</td><td class="mdescRight">pointer of value <br /></td></tr>
+<tr class="memitem:a6b973b0bded99b0c0bd84e887bf8c731" id="r_a6b973b0bded99b0c0bd84e887bf8c731"><td class="memItemLeft" align="right" valign="top">void *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6b973b0bded99b0c0bd84e887bf8c731">value</a></td></tr>
+<tr class="memdesc:a6b973b0bded99b0c0bd84e887bf8c731"><td class="mdescLeft">&#160;</td><td class="mdescRight">pointer of value  <br /></td></tr>
 <tr class="separator:a6b973b0bded99b0c0bd84e887bf8c731"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ac916d833aad2b9c41f01a92db2f8c48e" id="r_ac916d833aad2b9c41f01a92db2f8c48e"><td class="memItemLeft" align="right" valign="top"><a id="ac916d833aad2b9c41f01a92db2f8c48e" name="ac916d833aad2b9c41f01a92db2f8c48e"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../d9/d49/structdata__structures_1_1_node.html">Node</a> &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>forward</b></td></tr>
-<tr class="memdesc:ac916d833aad2b9c41f01a92db2f8c48e"><td class="mdescLeft">&#160;</td><td class="mdescRight">nodes of the given one in all levels <br /></td></tr>
+<tr class="memitem:ac916d833aad2b9c41f01a92db2f8c48e" id="r_ac916d833aad2b9c41f01a92db2f8c48e"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::shared_ptr&lt; <a class="el" href="../../d9/d49/structdata__structures_1_1_node.html">Node</a> &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac916d833aad2b9c41f01a92db2f8c48e">forward</a></td></tr>
+<tr class="memdesc:ac916d833aad2b9c41f01a92db2f8c48e"><td class="mdescLeft">&#160;</td><td class="mdescRight">nodes of the given one in all levels  <br /></td></tr>
 <tr class="separator:ac916d833aad2b9c41f01a92db2f8c48e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a class="el" href="../../d9/d49/structdata__structures_1_1_node.html">Node</a> structure [Key][Node*, Node*...] </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a54a6777e72b639c3ee6446a541db8e78" name="a54a6777e72b639c3ee6446a541db8e78"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a54a6777e72b639c3ee6446a541db8e78">&#9670;&#160;</a></span>Node()</h2>
@@ -178,26 +194,77 @@ void *&#160;</td><td class="memItemRight" valign="bottom"><b>value</b></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   44</span>                                                    : <a class="code hl_variable" href="#ac75aa86a598357c5c882ec6a1174aa68">key</a>(<a class="code hl_variable" href="#ac75aa86a598357c5c882ec6a1174aa68">key</a>), <a class="code hl_variable" href="#a6b973b0bded99b0c0bd84e887bf8c731">value</a>(<a class="code hl_variable" href="#a6b973b0bded99b0c0bd84e887bf8c731">value</a>) {</div>
 <div class="line"><span class="lineno">   45</span>        <span class="comment">// Initialization of forward vector</span></div>
 <div class="line"><span class="lineno">   46</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; (level + 1); i++) {</div>
-<div class="line"><span class="lineno">   47</span>            <a class="code hl_variable" href="#ac916d833aad2b9c41f01a92db2f8c48e">forward</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<span class="keyword">nullptr</span>);</div>
+<div class="line"><span class="lineno">   47</span>            <a class="code hl_variable" href="#ac916d833aad2b9c41f01a92db2f8c48e">forward</a>.push_back(<span class="keyword">nullptr</span>);</div>
 <div class="line"><span class="lineno">   48</span>        }</div>
 <div class="line"><span class="lineno">   49</span>    }</div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="astructdata__structures_1_1_node_html_a6b973b0bded99b0c0bd84e887bf8c731"><div class="ttname"><a href="#a6b973b0bded99b0c0bd84e887bf8c731">data_structures::Node::value</a></div><div class="ttdeci">void * value</div><div class="ttdoc">pointer of value</div><div class="ttdef"><b>Definition</b> skip_list.cpp:35</div></div>
-<div class="ttc" id="astructdata__structures_1_1_node_html_ac75aa86a598357c5c882ec6a1174aa68"><div class="ttname"><a href="#ac75aa86a598357c5c882ec6a1174aa68">data_structures::Node::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key integer</div><div class="ttdef"><b>Definition</b> skip_list.cpp:34</div></div>
-<div class="ttc" id="astructdata__structures_1_1_node_html_ac916d833aad2b9c41f01a92db2f8c48e"><div class="ttname"><a href="#ac916d833aad2b9c41f01a92db2f8c48e">data_structures::Node::forward</a></div><div class="ttdeci">std::vector&lt; std::shared_ptr&lt; Node &gt; &gt; forward</div><div class="ttdoc">nodes of the given one in all levels</div><div class="ttdef"><b>Definition</b> skip_list.cpp:37</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.svg" width="364" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="ttc" id="astructdata__structures_1_1_node_html_a6b973b0bded99b0c0bd84e887bf8c731"><div class="ttname"><a href="#a6b973b0bded99b0c0bd84e887bf8c731">data_structures::Node::value</a></div><div class="ttdeci">void * value</div><div class="ttdoc">pointer of value</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d5a/skip__list_8cpp_source.html#l00035">skip_list.cpp:35</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1_node_html_ac75aa86a598357c5c882ec6a1174aa68"><div class="ttname"><a href="#ac75aa86a598357c5c882ec6a1174aa68">data_structures::Node::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key integer</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d5a/skip__list_8cpp_source.html#l00034">skip_list.cpp:34</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1_node_html_ac916d833aad2b9c41f01a92db2f8c48e"><div class="ttname"><a href="#ac916d833aad2b9c41f01a92db2f8c48e">data_structures::Node::forward</a></div><div class="ttdeci">std::vector&lt; std::shared_ptr&lt; Node &gt; &gt; forward</div><div class="ttdoc">nodes of the given one in all levels</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d5a/skip__list_8cpp_source.html#l00037">skip_list.cpp:37</a></div></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="ac916d833aad2b9c41f01a92db2f8c48e" name="ac916d833aad2b9c41f01a92db2f8c48e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ac916d833aad2b9c41f01a92db2f8c48e">&#9670;&#160;</a></span>forward</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::shared_ptr&lt;<a class="el" href="../../d9/d49/structdata__structures_1_1_node.html">Node</a>&gt; &gt; data_structures::Node::forward</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>nodes of the given one in all levels </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ac75aa86a598357c5c882ec6a1174aa68" name="ac75aa86a598357c5c882ec6a1174aa68"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ac75aa86a598357c5c882ec6a1174aa68">&#9670;&#160;</a></span>key</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int data_structures::Node::key</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>key integer </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a6b973b0bded99b0c0bd84e887bf8c731" name="a6b973b0bded99b0c0bd84e887bf8c731"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a6b973b0bded99b0c0bd84e887bf8c731">&#9670;&#160;</a></span>value</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">void* data_structures::Node::value</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>pointer of value </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../d0/d5a/skip__list_8cpp.html">skip_list.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d0/d5a/skip__list_8cpp_source.html">skip_list.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.map b/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.map
deleted file mode 100644
index 50d9f47f3..000000000
--- a/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::Node::Node" name="data_structures::Node::Node">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,156,46"/>
-<area shape="rect" id="Node000002" 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="204,13,358,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="156,23,188,23,188,28,156,28"/>
-</map>
diff --git a/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.md5 b/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.md5
deleted file mode 100644
index 65847ca47..000000000
--- a/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a075920971ec4f39455af34ec8870c34
\ No newline at end of file
diff --git a/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.svg b/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.svg
deleted file mode 100644
index 3d2c2254a..000000000
--- a/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::Node::Node Pages: 1 -->
-<svg width="273pt" height="39pt"
- viewBox="0.00 0.00 272.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::Node::Node</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="112.75,-30.5 0,-30.5 0,0 112.75,0 112.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Node</text>
-<text text-anchor="middle" x="56.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Node</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.5,-24.88 148.75,-24.88 148.75,-5.63 264.5,-5.63 264.5,-24.88"/>
-<text text-anchor="middle" x="206.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113,-15.25C120.93,-15.25 129.16,-15.25 137.3,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.19,-18.75 147.19,-15.25 137.19,-11.75 137.19,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph_org.svg b/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph_org.svg
deleted file mode 100644
index 2f428dc7d..000000000
--- a/d9/d49/structdata__structures_1_1_node_a54a6777e72b639c3ee6446a541db8e78_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::Node::Node Pages: 1 -->
-<svg width="273pt" height="39pt"
- viewBox="0.00 0.00 272.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::Node::Node</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="112.75,-30.5 0,-30.5 0,0 112.75,0 112.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Node</text>
-<text text-anchor="middle" x="56.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Node</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.5,-24.88 148.75,-24.88 148.75,-5.63 264.5,-5.63 264.5,-24.88"/>
-<text text-anchor="middle" x="206.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113,-15.25C120.93,-15.25 129.16,-15.25 137.3,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.19,-18.75 147.19,-15.25 137.19,-11.75 137.19,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d4e/classrange__queries_1_1heavy__light__decomposition_1_1_tree-members.html b/d9/d4e/classrange__queries_1_1heavy__light__decomposition_1_1_tree-members.html
index 3a53488dd..3cad68d2e 100644
--- a/d9/d4e/classrange__queries_1_1heavy__light__decomposition_1_1_tree-members.html
+++ b/d9/d4e/classrange__queries_1_1heavy__light__decomposition_1_1_tree-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d9/d55/namespacesparse__table.html b/d9/d55/namespacesparse__table.html
index bdce100d9..956c38c51 100644
--- a/d9/d55/namespacesparse__table.html
+++ b/d9/d55/namespacesparse__table.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sparse_table Namespace Reference</title>
+<title>TheAlgorithms/C++: sparse_table Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html b/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html
index ef8923a2b..31e91e6df 100644
--- a/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html
+++ b/d9/d58/classdata__structures_1_1linked__list_1_1list-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d9/d5a/structgeometry_1_1jarvis_1_1_point.html b/d9/d5a/structgeometry_1_1jarvis_1_1_point.html
index 30bf565ea..bd620cff3 100644
--- a/d9/d5a/structgeometry_1_1jarvis_1_1_point.html
+++ b/d9/d5a/structgeometry_1_1jarvis_1_1_point.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: geometry::jarvis::Point Struct Reference</title>
+<title>TheAlgorithms/C++: geometry::jarvis::Point Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -113,17 +130,50 @@ $(function(){initNavTree('d9/d5a/structgeometry_1_1jarvis_1_1_point.html','../..
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:af14ad1652ac763c92e5c79a86796d044" id="r_af14ad1652ac763c92e5c79a86796d044"><td class="memItemLeft" align="right" valign="top"><a id="af14ad1652ac763c92e5c79a86796d044" name="af14ad1652ac763c92e5c79a86796d044"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>x</b></td></tr>
+<tr class="memitem:af14ad1652ac763c92e5c79a86796d044" id="r_af14ad1652ac763c92e5c79a86796d044"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af14ad1652ac763c92e5c79a86796d044">x</a></td></tr>
 <tr class="separator:af14ad1652ac763c92e5c79a86796d044"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a6c52f5bd4f7360d2d1db0bf6537a10e0" id="r_a6c52f5bd4f7360d2d1db0bf6537a10e0"><td class="memItemLeft" align="right" valign="top"><a id="a6c52f5bd4f7360d2d1db0bf6537a10e0" name="a6c52f5bd4f7360d2d1db0bf6537a10e0"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>y</b></td></tr>
+<tr class="memitem:a6c52f5bd4f7360d2d1db0bf6537a10e0" id="r_a6c52f5bd4f7360d2d1db0bf6537a10e0"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6c52f5bd4f7360d2d1db0bf6537a10e0">y</a></td></tr>
 <tr class="separator:a6c52f5bd4f7360d2d1db0bf6537a10e0"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Structure defining the x and y co-ordinates of the given point in space </p>
-</div><hr/>The documentation for this struct was generated from the following file:<ul>
-<li>geometry/<a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp.html">jarvis_algorithm.cpp</a></li>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html">jarvis_algorithm.cpp</a>.</p>
+</div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="af14ad1652ac763c92e5c79a86796d044" name="af14ad1652ac763c92e5c79a86796d044"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#af14ad1652ac763c92e5c79a86796d044">&#9670;&#160;</a></span>x</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int geometry::jarvis::Point::x</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html">jarvis_algorithm.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a6c52f5bd4f7360d2d1db0bf6537a10e0" name="a6c52f5bd4f7360d2d1db0bf6537a10e0"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a6c52f5bd4f7360d2d1db0bf6537a10e0">&#9670;&#160;</a></span>y</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int geometry::jarvis::Point::y</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html">jarvis_algorithm.cpp</a>.</p>
+
+</div>
+</div>
+<hr/>The documentation for this struct was generated from the following file:<ul>
+<li>geometry/<a class="el" href="../../d4/d8d/jarvis__algorithm_8cpp_source.html">jarvis_algorithm.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d9/d5d/extended__euclid__algorithm_8cpp.html b/d9/d5d/extended__euclid__algorithm_8cpp.html
index 5c8479829..a6568e2a4 100644
--- a/d9/d5d/extended__euclid__algorithm_8cpp.html
+++ b/d9/d5d/extended__euclid__algorithm_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/extended_euclid_algorithm.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/extended_euclid_algorithm.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for extended_euclid_algorithm.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/dc7/extended__euclid__algorithm_8cpp__incl.svg" width="266" height="126"><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">
+</div>
+<p><a href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:abe92d63a0ff9bda7e304df510d5dd217" id="r_abe92d63a0ff9bda7e304df510d5dd217"><td class="memTemplParams" colspan="2">template&lt;typename T , typename T2 &gt; </td></tr>
@@ -142,6 +161,8 @@ Functions</h2></td></tr>
 \[\text{gcd}(a, b) = a \times x + b \times y \]
 </p>
 <p> This is also used in finding Modular multiplicative inverse of a number. (A * B)M == 1 Here B is the MMI of A for given M, so extendedEuclid (A, M) gives B. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html">extended_euclid_algorithm.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="acba15ca55b3e7dcb91f3c65d72ba052d" name="acba15ca55b3e7dcb91f3c65d72ba052d"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#acba15ca55b3e7dcb91f3c65d72ba052d">&#9670;&#160;</a></span>extendedEuclid()</h2>
@@ -189,9 +210,11 @@ template&lt;typename T , typename T2 &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html#l00071">71</a> of file <a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html">extended_euclid_algorithm.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   71</span>                                                    {</div>
 <div class="line"><span class="lineno">   72</span>    <span class="keywordflow">if</span> (B &gt; A)</div>
-<div class="line"><span class="lineno">   73</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(A, B);  <span class="comment">// Ensure that A &gt;= B</span></div>
+<div class="line"><span class="lineno">   73</span>        std::swap(A, B);  <span class="comment">// Ensure that A &gt;= B</span></div>
 <div class="line"><span class="lineno">   74</span> </div>
 <div class="line"><span class="lineno">   75</span>    <span class="keywordflow">if</span> (B == 0) {</div>
 <div class="line"><span class="lineno">   76</span>        *GCD = A;</div>
@@ -204,14 +227,8 @@ template&lt;typename T , typename T2 &gt; </div>
 <div class="line"><span class="lineno">   83</span>        *y = temp - (A / B) * (*y);</div>
 <div class="line"><span class="lineno">   84</span>    }</div>
 <div class="line"><span class="lineno">   85</span>}</div>
-<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_acba15ca55b3e7dcb91f3c65d72ba052d"><div class="ttname"><a href="#acba15ca55b3e7dcb91f3c65d72ba052d">extendedEuclid</a></div><div class="ttdeci">void extendedEuclid(T A, T B, T *GCD, T2 *x, T2 *y)</div><div class="ttdef"><b>Definition</b> extended_euclid_algorithm.cpp:71</div></div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- 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="../../d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.svg" width="248" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_acba15ca55b3e7dcb91f3c65d72ba052d"><div class="ttname"><a href="#acba15ca55b3e7dcb91f3c65d72ba052d">extendedEuclid</a></div><div class="ttdeci">void extendedEuclid(T A, T B, T *GCD, T2 *x, T2 *y)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html#l00071">extended_euclid_algorithm.cpp:71</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1792ac7c33aaf26b860ab55f5652ab25" name="a1792ac7c33aaf26b860ab55f5652ab25"></a>
@@ -260,9 +277,11 @@ template&lt;typename T1 , typename T2 &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html">extended_euclid_algorithm.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   42</span>                                                         {</div>
 <div class="line"><span class="lineno">   43</span>    <span class="keywordflow">if</span> (B &gt; A)</div>
-<div class="line"><span class="lineno">   44</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(A, B);  <span class="comment">// Ensure that A &gt;= B</span></div>
+<div class="line"><span class="lineno">   44</span>        std::swap(A, B);  <span class="comment">// Ensure that A &gt;= B</span></div>
 <div class="line"><span class="lineno">   45</span> </div>
 <div class="line"><span class="lineno">   46</span>    T2 s = 0, s0 = 1;</div>
 <div class="line"><span class="lineno">   47</span>    T2 t = 1, t0 = 0;</div>
@@ -278,13 +297,8 @@ template&lt;typename T1 , typename T2 &gt; </div>
 <div class="line"><span class="lineno">   57</span>    *x = s0;</div>
 <div class="line"><span class="lineno">   58</span>    *y = t0;</div>
 <div class="line"><span class="lineno">   59</span>}</div>
-<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_abe92d63a0ff9bda7e304df510d5dd217"><div class="ttname"><a href="#abe92d63a0ff9bda7e304df510d5dd217">update_step</a></div><div class="ttdeci">void update_step(T *r, T *r0, const T2 quotient)</div><div class="ttdef"><b>Definition</b> extended_euclid_algorithm.cpp:25</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.svg" width="276" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_abe92d63a0ff9bda7e304df510d5dd217"><div class="ttname"><a href="#abe92d63a0ff9bda7e304df510d5dd217">update_step</a></div><div class="ttdeci">void update_step(T *r, T *r0, const T2 quotient)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html#l00025">extended_euclid_algorithm.cpp:25</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -303,27 +317,21 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>Main function. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html#l00088">88</a> of file <a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html">extended_euclid_algorithm.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   88</span>           {</div>
 <div class="line"><span class="lineno">   89</span>    uint32_t a, b, <a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>;</div>
 <div class="line"><span class="lineno">   90</span>    int32_t x, y;</div>
-<div class="line"><span class="lineno">   91</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; a &gt;&gt; b;</div>
+<div class="line"><span class="lineno">   91</span>    std::cin &gt;&gt; a &gt;&gt; b;</div>
 <div class="line"><span class="lineno">   92</span>    <a class="code hl_function" href="#acba15ca55b3e7dcb91f3c65d72ba052d">extendedEuclid</a>(a, b, &amp;<a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>, &amp;x, &amp;y);</div>
-<div class="line"><span class="lineno">   93</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a> &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; y &lt;&lt; <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">   93</span>    std::cout &lt;&lt; <a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a> &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; y &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   94</span>    <a class="code hl_function" href="#a1792ac7c33aaf26b860ab55f5652ab25">extendedEuclid_1</a>(a, b, &amp;<a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>, &amp;x, &amp;y);</div>
-<div class="line"><span class="lineno">   95</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a> &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; y &lt;&lt; <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">   95</span>    std::cout &lt;&lt; <a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a> &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; y &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   96</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   97</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="aextended__euclid__algorithm_8cpp_html_a1792ac7c33aaf26b860ab55f5652ab25"><div class="ttname"><a href="#a1792ac7c33aaf26b860ab55f5652ab25">extendedEuclid_1</a></div><div class="ttdeci">void extendedEuclid_1(T1 A, T1 B, T1 *GCD, T2 *x, T2 *y)</div><div class="ttdef"><b>Definition</b> extended_euclid_algorithm.cpp:42</div></div>
-<div class="ttc" id="agcd__iterative__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition</b> gcd_iterative_euclidean.cpp:15</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d5d/extended__euclid__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="374" height="208"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_a1792ac7c33aaf26b860ab55f5652ab25"><div class="ttname"><a href="#a1792ac7c33aaf26b860ab55f5652ab25">extendedEuclid_1</a></div><div class="ttdeci">void extendedEuclid_1(T1 A, T1 B, T1 *GCD, T2 *x, T2 *y)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html#l00042">extended_euclid_algorithm.cpp:42</a></div></div>
+<div class="ttc" id="agcd__iterative__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/da0/gcd__iterative__euclidean_8cpp_source.html#l00015">gcd_iterative_euclidean.cpp:15</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abe92d63a0ff9bda7e304df510d5dd217" name="abe92d63a0ff9bda7e304df510d5dd217"></a>
@@ -370,6 +378,8 @@ template&lt;typename T , typename T2 &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html#l00025">25</a> of file <a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp_source.html">extended_euclid_algorithm.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   25</span>                                                        {</div>
 <div class="line"><span class="lineno">   26</span>    T temp = *r;</div>
 <div class="line"><span class="lineno">   27</span>    *r = *r0 - (quotient * temp);</div>
diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.map b/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.map
deleted file mode 100644
index 15a688e65..000000000
--- a/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="extendedEuclid_1" name="extendedEuclid_1">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,130,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="185,5,263,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="130,31,169,24,170,30,130,36"/>
-<area shape="rect" id="Node000003" href="$d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217" title=" " alt="" coords="178,55,270,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="130,50,163,55,162,61,130,56"/>
-</map>
diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.md5 b/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.md5
deleted file mode 100644
index 6f09c2097..000000000
--- a/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-92b09c3b11e8e9a13f8eab606611e039
\ No newline at end of file
diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.svg b/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.svg
deleted file mode 100644
index e6c286522..000000000
--- a/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: extendedEuclid_1 Pages: 1 -->
-<svg width="207pt" height="64pt"
- viewBox="0.00 0.00 206.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>extendedEuclid_1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="93.25,-37.25 0,-37.25 0,-18 93.25,-18 93.25,-37.25"/>
-<text text-anchor="middle" x="46.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">extendedEuclid_1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.25,-56.25 134.5,-56.25 134.5,-37 193.25,-37 193.25,-56.25"/>
-<text text-anchor="middle" x="163.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.51,-35.19C103.23,-36.79 113.43,-38.47 122.92,-40.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.13,-43.46 132.57,-41.63 123.27,-36.55 122.13,-43.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="198.5,-19.25 129.25,-19.25 129.25,0 198.5,0 198.5,-19.25"/>
-<text text-anchor="middle" x="163.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">update_step</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.51,-20.46C101.43,-19.22 109.67,-17.93 117.59,-16.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="118.04,-20.17 127.38,-15.17 116.96,-13.25 118.04,-20.17"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph_org.svg b/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph_org.svg
deleted file mode 100644
index f98af8e63..000000000
--- a/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: extendedEuclid_1 Pages: 1 -->
-<svg width="207pt" height="64pt"
- viewBox="0.00 0.00 206.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>extendedEuclid_1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="93.25,-37.25 0,-37.25 0,-18 93.25,-18 93.25,-37.25"/>
-<text text-anchor="middle" x="46.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">extendedEuclid_1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.25,-56.25 134.5,-56.25 134.5,-37 193.25,-37 193.25,-56.25"/>
-<text text-anchor="middle" x="163.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.51,-35.19C103.23,-36.79 113.43,-38.47 122.92,-40.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.13,-43.46 132.57,-41.63 123.27,-36.55 122.13,-43.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="198.5,-19.25 129.25,-19.25 129.25,0 198.5,0 198.5,-19.25"/>
-<text text-anchor="middle" x="163.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">update_step</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.51,-20.46C101.43,-19.22 109.67,-17.93 117.59,-16.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="118.04,-20.17 127.38,-15.17 116.96,-13.25 118.04,-20.17"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.map b/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.map
deleted file mode 100644
index dc5b557a1..000000000
--- a/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="extendedEuclid" name="extendedEuclid">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,116,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="36,30,31,21,34,11,44,5,61,3,78,5,87,12,84,16,76,10,60,8,46,10,38,14,37,20,41,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="164,29,242,55"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="116,40,148,40,148,45,116,45"/>
-</map>
diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.md5 b/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.md5
deleted file mode 100644
index af2da43fd..000000000
--- a/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bdef777219e8c49f73405d7bfc7f9672
\ No newline at end of file
diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.svg b/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.svg
deleted file mode 100644
index 8052bceca..000000000
--- a/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.svg
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: extendedEuclid Pages: 1 -->
-<svg width="186pt" height="45pt"
- viewBox="0.00 0.00 185.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>extendedEuclid</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="82.75,-19.25 0,-19.25 0,0 82.75,0 82.75,-19.25"/>
-<text text-anchor="middle" x="41.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">extendedEuclid</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.66,-19.54C17.04,-28.15 22.61,-37.25 41.38,-37.25 51.64,-37.25 57.95,-34.53 60.32,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="63.79,-30.14 58.39,-21.02 56.93,-31.52 63.79,-30.14"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.5,-19.25 118.75,-19.25 118.75,0 177.5,0 177.5,-19.25"/>
-<text text-anchor="middle" x="148.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.17,-9.62C90.96,-9.62 99.1,-9.62 106.86,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.75,-13.13 116.75,-9.63 106.75,-6.13 106.75,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph_org.svg b/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph_org.svg
deleted file mode 100644
index a0c4161eb..000000000
--- a/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph_org.svg
+++ /dev/null
@@ -1,48 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: extendedEuclid Pages: 1 -->
-<svg width="186pt" height="45pt"
- viewBox="0.00 0.00 185.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>extendedEuclid</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="82.75,-19.25 0,-19.25 0,0 82.75,0 82.75,-19.25"/>
-<text text-anchor="middle" x="41.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">extendedEuclid</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.66,-19.54C17.04,-28.15 22.61,-37.25 41.38,-37.25 51.64,-37.25 57.95,-34.53 60.32,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="63.79,-30.14 58.39,-21.02 56.93,-31.52 63.79,-30.14"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.5,-19.25 118.75,-19.25 118.75,0 177.5,0 177.5,-19.25"/>
-<text text-anchor="middle" x="148.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.17,-9.62C90.96,-9.62 99.1,-9.62 106.86,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.75,-13.13 116.75,-9.63 106.75,-6.13 106.75,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d5d/extended__euclid__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 912c7c4a0..000000000
--- a/d9/d5d/extended__euclid__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,104,55,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="129,5,200,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="39,102,65,71,101,40,114,33,116,37,104,44,69,75,43,105"/>
-<area shape="rect" id="Node000003" href="$d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d" title=" " alt="" coords="110,79,220,104"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="54,110,94,102,95,107,55,115"/>
-<area shape="rect" id="Node000005" href="$d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25" title=" " alt="" coords="103,128,227,154"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="55,119,88,124,87,130,54,124"/>
-<area shape="rect" id="Node000007" href="$d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" title=" " alt="" coords="144,177,186,203"/>
-<area shape="poly" id="edge8_Node000001_Node000007" title=" " alt="" coords="50,128,104,164,130,176,128,181,101,169,47,132"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="141,79,137,70,140,61,149,54,165,52,182,55,190,61,187,66,179,60,165,57,151,59,144,64,142,70,146,77"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="282,79,360,104"/>
-<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="220,89,267,89,267,94,220,94"/>
-<area shape="poly" id="edge6_Node000005_Node000004" title=" " alt="" coords="207,125,267,106,268,111,209,130"/>
-<area shape="rect" id="Node000006" href="$d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217" title=" " alt="" coords="275,128,367,154"/>
-<area shape="poly" id="edge7_Node000005_Node000006" title=" " alt="" coords="227,138,259,138,259,144,227,144"/>
-</map>
diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d5d/extended__euclid__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 5d0fbd248..000000000
--- a/d9/d5d/extended__euclid__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5bb5160c0682b45290f898f68cd662c7
\ No newline at end of file
diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d5d/extended__euclid__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index f53fa8a1e..000000000
--- a/d9/d5d/extended__euclid__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,173 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="280pt" height="156pt"
- viewBox="0.00 0.00 279.50 156.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 152.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146.38,-148.25 92.88,-148.25 92.88,-129 146.38,-129 146.38,-148.25"/>
-<text text-anchor="middle" x="119.62" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.8,-74.59C36.25,-86.88 53.81,-107.72 73,-120.62 75.88,-122.56 78.99,-124.33 82.19,-125.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.61,-129.07 91.17,-129.96 83.47,-122.68 80.61,-129.07"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161,-93.25 78.25,-93.25 78.25,-74 161,-74 161,-93.25"/>
-<text text-anchor="middle" x="119.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">extendedEuclid</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.22,-68.02C45.65,-69.64 56.22,-71.66 66.91,-73.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.06,-77.11 76.54,-75.56 67.38,-70.24 66.06,-77.11"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="166.25,-56.25 73,-56.25 73,-37 166.25,-37 166.25,-56.25"/>
-<text text-anchor="middle" x="119.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">extendedEuclid_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.22,-61.41C44.19,-60.14 52.62,-58.61 61.37,-57.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.85,-60.49 71.06,-55.26 60.6,-53.6 61.85,-60.49"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.5,-19.25 103.75,-19.25 103.75,0 135.5,0 135.5,-19.25"/>
-<text text-anchor="middle" x="119.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge8_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.16,-54.63C42.68,-46.63 58.26,-35.5 73,-27.62 79.26,-24.28 86.27,-21.21 92.89,-18.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.9,-21.95 102.03,-15.16 91.43,-15.4 93.9,-21.95"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.79,-93.54C96.57,-102.15 101.85,-111.25 119.62,-111.25 129.35,-111.25 135.33,-108.53 137.57,-104.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.05,-104.19 135.74,-95.02 134.17,-105.5 141.05,-104.19"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.25,-93.25 207.5,-93.25 207.5,-74 266.25,-74 266.25,-93.25"/>
-<text text-anchor="middle" x="236.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.26,-83.62C172.51,-83.62 184.72,-83.62 195.93,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.67,-87.13 205.67,-83.63 195.67,-80.13 195.67,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge6_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.12,-56.74C165.82,-61.13 182.02,-66.34 196.51,-70.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.15,-74.23 205.74,-73.95 197.29,-67.56 195.15,-74.23"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.5,-56.25 202.25,-56.25 202.25,-37 271.5,-37 271.5,-56.25"/>
-<text text-anchor="middle" x="236.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">update_step</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge7_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge7_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M166.51,-46.62C174.43,-46.62 182.67,-46.62 190.59,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.36,-50.13 200.36,-46.63 190.36,-43.13 190.36,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/d5d/extended__euclid__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 31c95b404..000000000
--- a/d9/d5d/extended__euclid__algorithm_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="280pt" height="156pt"
- viewBox="0.00 0.00 279.50 156.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 152.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146.38,-148.25 92.88,-148.25 92.88,-129 146.38,-129 146.38,-148.25"/>
-<text text-anchor="middle" x="119.62" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.8,-74.59C36.25,-86.88 53.81,-107.72 73,-120.62 75.88,-122.56 78.99,-124.33 82.19,-125.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.61,-129.07 91.17,-129.96 83.47,-122.68 80.61,-129.07"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161,-93.25 78.25,-93.25 78.25,-74 161,-74 161,-93.25"/>
-<text text-anchor="middle" x="119.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">extendedEuclid</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.22,-68.02C45.65,-69.64 56.22,-71.66 66.91,-73.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.06,-77.11 76.54,-75.56 67.38,-70.24 66.06,-77.11"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="166.25,-56.25 73,-56.25 73,-37 166.25,-37 166.25,-56.25"/>
-<text text-anchor="middle" x="119.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">extendedEuclid_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.22,-61.41C44.19,-60.14 52.62,-58.61 61.37,-57.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.85,-60.49 71.06,-55.26 60.6,-53.6 61.85,-60.49"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.5,-19.25 103.75,-19.25 103.75,0 135.5,0 135.5,-19.25"/>
-<text text-anchor="middle" x="119.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge8_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.16,-54.63C42.68,-46.63 58.26,-35.5 73,-27.62 79.26,-24.28 86.27,-21.21 92.89,-18.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.9,-21.95 102.03,-15.16 91.43,-15.4 93.9,-21.95"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.79,-93.54C96.57,-102.15 101.85,-111.25 119.62,-111.25 129.35,-111.25 135.33,-108.53 137.57,-104.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.05,-104.19 135.74,-95.02 134.17,-105.5 141.05,-104.19"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.25,-93.25 207.5,-93.25 207.5,-74 266.25,-74 266.25,-93.25"/>
-<text text-anchor="middle" x="236.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.26,-83.62C172.51,-83.62 184.72,-83.62 195.93,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.67,-87.13 205.67,-83.63 195.67,-80.13 195.67,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge6_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.12,-56.74C165.82,-61.13 182.02,-66.34 196.51,-70.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.15,-74.23 205.74,-73.95 197.29,-67.56 195.15,-74.23"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.5,-56.25 202.25,-56.25 202.25,-37 271.5,-37 271.5,-56.25"/>
-<text text-anchor="middle" x="236.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">update_step</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge7_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge7_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M166.51,-46.62C174.43,-46.62 182.67,-46.62 190.59,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.36,-50.13 200.36,-46.63 190.36,-43.13 190.36,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_source.html b/d9/d5d/extended__euclid__algorithm_8cpp_source.html
new file mode 100644
index 000000000..9c88e408d
--- /dev/null
+++ b/d9/d5d/extended__euclid__algorithm_8cpp_source.html
@@ -0,0 +1,209 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/extended_euclid_algorithm.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d5d/extended__euclid__algorithm_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">extended_euclid_algorithm.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/d5d/extended__euclid__algorithm_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  <span class="comment">// for swap function</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> T2&gt;</div>
+<div class="foldopen" id="foldopen00025" data-start="{" data-end="}">
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"><a class="line" href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217">   25</a></span><span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217">update_step</a>(T *r, T *r0, <span class="keyword">const</span> T2 quotient) {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    T temp = *r;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    *r = *r0 - (quotient * temp);</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    *r0 = temp;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>}</div>
+</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T1, <span class="keyword">typename</span> T2&gt;</div>
+<div class="foldopen" id="foldopen00042" data-start="{" data-end="}">
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25">   42</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25">extendedEuclid_1</a>(T1 A, T1 B, T1 *GCD, T2 *x, T2 *y) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">if</span> (B &gt; A)</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        std::swap(A, B);  <span class="comment">// Ensure that A &gt;= B</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    T2 s = 0, s0 = 1;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    T2 t = 1, t0 = 0;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    T1 r = B, r0 = A;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordflow">while</span> (r != 0) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        T1 quotient = r0 / r;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        <a class="code hl_function" href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217">update_step</a>(&amp;r, &amp;r0, quotient);</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        <a class="code hl_function" href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217">update_step</a>(&amp;s, &amp;s0, quotient);</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <a class="code hl_function" href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217">update_step</a>(&amp;t, &amp;t0, quotient);</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    *GCD = r0;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    *x = s0;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    *y = t0;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>}</div>
+</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> T2&gt;</div>
+<div class="foldopen" id="foldopen00071" data-start="{" data-end="}">
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"><a class="line" href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d">   71</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d">extendedEuclid</a>(T A, T B, T *GCD, T2 *x, T2 *y) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keywordflow">if</span> (B &gt; A)</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        std::swap(A, B);  <span class="comment">// Ensure that A &gt;= B</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="keywordflow">if</span> (B == 0) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        *GCD = A;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        *x = 1;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        *y = 0;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <a class="code hl_function" href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d">extendedEuclid</a>(B, A % B, GCD, x, y);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        T2 temp = *x;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        *x = *y;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        *y = temp - (A / B) * (*y);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    }</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>}</div>
+</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="foldopen" id="foldopen00088" data-start="{" data-end="}">
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"><a class="line" href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   88</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    uint32_t a, b, <a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    int32_t x, y;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    std::cin &gt;&gt; a &gt;&gt; b;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <a class="code hl_function" href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d">extendedEuclid</a>(a, b, &amp;<a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>, &amp;x, &amp;y);</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    std::cout &lt;&lt; <a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a> &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; y &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <a class="code hl_function" href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25">extendedEuclid_1</a>(a, b, &amp;<a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>, &amp;x, &amp;y);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    std::cout &lt;&lt; <a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a> &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; y &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>}</div>
+</div>
+<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_a1792ac7c33aaf26b860ab55f5652ab25"><div class="ttname"><a href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25">extendedEuclid_1</a></div><div class="ttdeci">void extendedEuclid_1(T1 A, T1 B, T1 *GCD, T2 *x, T2 *y)</div><div class="ttdef"><b>Definition</b> <a href="#l00042">extended_euclid_algorithm.cpp:42</a></div></div>
+<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_abe92d63a0ff9bda7e304df510d5dd217"><div class="ttname"><a href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217">update_step</a></div><div class="ttdeci">void update_step(T *r, T *r0, const T2 quotient)</div><div class="ttdef"><b>Definition</b> <a href="#l00025">extended_euclid_algorithm.cpp:25</a></div></div>
+<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_acba15ca55b3e7dcb91f3c65d72ba052d"><div class="ttname"><a href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d">extendedEuclid</a></div><div class="ttdeci">void extendedEuclid(T A, T B, T *GCD, T2 *x, T2 *y)</div><div class="ttdef"><b>Definition</b> <a href="#l00071">extended_euclid_algorithm.cpp:71</a></div></div>
+<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00088">extended_euclid_algorithm.cpp:88</a></div></div>
+<div class="ttc" id="agcd__iterative__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/da0/gcd__iterative__euclidean_8cpp_source.html#l00015">gcd_iterative_euclidean.cpp:15</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d9/d5d/extended__euclid__algorithm_8cpp.html">extended_euclid_algorithm.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html
index 5c2858460..3a3b791f7 100644
--- a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html
+++ b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: search/longest_increasing_subsequence_using_binary_search.cpp File Reference</title>
+<title>TheAlgorithms/C++: search/longest_increasing_subsequence_using_binary_search.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,12 +139,14 @@ Include dependency graph for longest_increasing_subsequence_using_binary_search.
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d04/longest__increasing__subsequence__using__binary__search_8cpp__incl.svg" width="435" height="140"><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">
+</div>
+<p><a href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a313539d9a97fc6e121ce496873ba892e" id="r_a313539d9a97fc6e121ce496873ba892e"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a313539d9a97fc6e121ce496873ba892e"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a>&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;nums)</td></tr>
-<tr class="memdesc:a313539d9a97fc6e121ce496873ba892e"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a>  <br /></td></tr>
+<tr class="memitem:a313539d9a97fc6e121ce496873ba892e"><td class="memTemplItemLeft" align="right" valign="top">std::uint32_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a> (std::vector&lt; T &gt; &amp;nums)</td></tr>
+<tr class="memdesc:a313539d9a97fc6e121ce496873ba892e"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::uint32_t  <br /></td></tr>
 <tr class="separator:a313539d9a97fc6e121ce496873ba892e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
 <tr class="memdesc:a483bb8ccf42aaf7375a83e91490eda1e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test cases for Longest Increasing Subsequence function.  <br /></td></tr>
@@ -151,6 +170,8 @@ Functions</h2></td></tr>
 <p>Time complexity: O(n∗log(n)) Space complexity: O(1)</p>
 <p>This approach consider Most optimal Approach for solving this problem</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/namanmodi65" target="_blank">Naman Jain</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html">longest_increasing_subsequence_using_binary_search.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a313539d9a97fc6e121ce496873ba892e" name="a313539d9a97fc6e121ce496873ba892e"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a313539d9a97fc6e121ce496873ba892e">&#9670;&#160;</a></span>longest_increasing_subsequence_using_binary_search()</h2>
@@ -161,16 +182,16 @@ Functions</h2></td></tr>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> longest_increasing_subsequence_using_binary_search </td>
+          <td class="memname">std::uint32_t longest_increasing_subsequence_using_binary_search </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>nums</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>nums</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
 </div><div class="memdoc">
 
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> </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> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/lower_bound.html">std::lower_bound</a></p>
+<p>for std::uint32_t </p>
+<p>for std::assert for IO operations for std::vector for std::lower_bound</p>
 <p>Function to find the length of the Longest Increasing Subsequence (LIS) using Binary Search </p><dl class="tparams"><dt>Template Parameters</dt><dd>
   <table class="tparams">
     <tr><td class="paramname">T</td><td>The type of the elements in the input vector </td></tr>
@@ -184,33 +205,24 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The length of the longest increasing subsequence </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html#l00065">65</a> of file <a class="el" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html">longest_increasing_subsequence_using_binary_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   65</span>                                                                                   {</div>
-<div class="line"><span class="lineno">   66</span>    <span class="keywordflow">if</span> (nums.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/empty.html">empty</a>()) <span class="keywordflow">return</span> 0;</div>
+<div class="line"><span class="lineno">   66</span>    <span class="keywordflow">if</span> (nums.empty()) <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   67</span> </div>
-<div class="line"><span class="lineno">   68</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> ans;</div>
+<div class="line"><span class="lineno">   68</span>    std::vector&lt;T&gt; ans;</div>
 <div class="line"><span class="lineno">   69</span>    ans.push_back(nums[0]);</div>
-<div class="line"><span class="lineno">   70</span>    <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> i = 1; i &lt; nums.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
+<div class="line"><span class="lineno">   70</span>    <span class="keywordflow">for</span> (std::size_t i = 1; i &lt; nums.size(); i++) {</div>
 <div class="line"><span class="lineno">   71</span>        <span class="keywordflow">if</span> (nums[i] &gt; ans.back()) {</div>
 <div class="line"><span class="lineno">   72</span>            ans.push_back(nums[i]);</div>
 <div class="line"><span class="lineno">   73</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   74</span>            <span class="keyword">auto</span> idx = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/lower_bound.html">std::lower_bound</a>(ans.begin(), ans.end(), nums[i]) - ans.begin();</div>
+<div class="line"><span class="lineno">   74</span>            <span class="keyword">auto</span> idx = std::lower_bound(ans.begin(), ans.end(), nums[i]) - ans.begin();</div>
 <div class="line"><span class="lineno">   75</span>            ans[idx] = nums[i];</div>
 <div class="line"><span class="lineno">   76</span>        }</div>
 <div class="line"><span class="lineno">   77</span>    }</div>
-<div class="line"><span class="lineno">   78</span>    <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a><span class="keyword">&gt;</span>(ans.size());</div>
+<div class="line"><span class="lineno">   78</span>    <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>std::uint32_t<span class="keyword">&gt;</span>(ans.size());</div>
 <div class="line"><span class="lineno">   79</span>}</div>
-<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/empty.html">std::vector::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
-<div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a></div></div>
-<div class="ttc" id="alower_bound_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/lower_bound.html">std::lower_bound</a></div><div class="ttdeci">T lower_bound(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="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.svg" width="372" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -230,17 +242,14 @@ Here is the call graph for this function:</div>
 
 <p>Main function to run tests. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html#l00114">114</a> of file <a class="el" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html">longest_increasing_subsequence_using_binary_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  114</span>           {</div>
 <div class="line"><span class="lineno">  115</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self test implementation</span></div>
 <div class="line"><span class="lineno">  116</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  117</span>}</div>
-<div class="ttc" id="alongest__increasing__subsequence__using__binary__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Test cases for Longest Increasing Subsequence function.</div><div class="ttdef"><b>Definition</b> longest_increasing_subsequence_using_binary_search.cpp:85</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="567" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="alongest__increasing__subsequence__using__binary__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Test cases for Longest Increasing Subsequence function.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html#l00085">longest_increasing_subsequence_using_binary_search.cpp:85</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -268,38 +277,34 @@ Here is the call graph for this function:</div>
 
 <p>Test cases for Longest Increasing Subsequence function. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html#l00085">85</a> of file <a class="el" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html">longest_increasing_subsequence_using_binary_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   85</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&lt;int&gt;</a> arr = {10, 9, 2, 5, 3, 7, 101, 18};</div>
+<div class="line"><span class="lineno">   86</span>    std::vector&lt;int&gt; arr = {10, 9, 2, 5, 3, 7, 101, 18};</div>
 <div class="line"><span class="lineno">   87</span>    assert(<a class="code hl_function" href="#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a>(arr) == 4);</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&lt;int&gt;</a> arr2 = {0, 1, 0, 3, 2, 3};</div>
+<div class="line"><span class="lineno">   89</span>    std::vector&lt;int&gt; arr2 = {0, 1, 0, 3, 2, 3};</div>
 <div class="line"><span class="lineno">   90</span>    assert(<a class="code hl_function" href="#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a>(arr2) == 4);</div>
 <div class="line"><span class="lineno">   91</span> </div>
-<div class="line"><span class="lineno">   92</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> arr3 = {7, 7, 7, 7, 7, 7, 7};</div>
+<div class="line"><span class="lineno">   92</span>    std::vector&lt;int&gt; arr3 = {7, 7, 7, 7, 7, 7, 7};</div>
 <div class="line"><span class="lineno">   93</span>    assert(<a class="code hl_function" href="#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a>(arr3) == 1);</div>
 <div class="line"><span class="lineno">   94</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&lt;int&gt;</a> arr4 = {-10, -1, -5, 0, 5, 1, 2};</div>
+<div class="line"><span class="lineno">   95</span>    std::vector&lt;int&gt; arr4 = {-10, -1, -5, 0, 5, 1, 2};</div>
 <div class="line"><span class="lineno">   96</span>    assert(<a class="code hl_function" href="#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a>(arr4) == 5);</div>
 <div class="line"><span class="lineno">   97</span> </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&lt;double&gt;</a> arr5 = {3.5, 1.2, 2.8, 3.1, 4.0};</div>
+<div class="line"><span class="lineno">   98</span>    std::vector&lt;double&gt; arr5 = {3.5, 1.2, 2.8, 3.1, 4.0};</div>
 <div class="line"><span class="lineno">   99</span>    assert(<a class="code hl_function" href="#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a>(arr5) == 4);</div>
 <div class="line"><span class="lineno">  100</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&lt;char&gt;</a> arr6 = {<span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;b&#39;</span>, <span class="charliteral">&#39;c&#39;</span>, <span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;d&#39;</span>};</div>
+<div class="line"><span class="lineno">  101</span>    std::vector&lt;char&gt; arr6 = {<span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;b&#39;</span>, <span class="charliteral">&#39;c&#39;</span>, <span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;d&#39;</span>};</div>
 <div class="line"><span class="lineno">  102</span>    assert(<a class="code hl_function" href="#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a>(arr6) == 4);</div>
 <div class="line"><span class="lineno">  103</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&lt;int&gt;</a> arr7 = {};</div>
+<div class="line"><span class="lineno">  104</span>    std::vector&lt;int&gt; arr7 = {};</div>
 <div class="line"><span class="lineno">  105</span>    assert(<a class="code hl_function" href="#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a>(arr7) == 0);</div>
 <div class="line"><span class="lineno">  106</span> </div>
-<div class="line"><span class="lineno">  107</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  107</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  108</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="alongest__increasing__subsequence__using__binary__search_8cpp_html_a313539d9a97fc6e121ce496873ba892e"><div class="ttname"><a href="#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a></div><div class="ttdeci">std::uint32_t longest_increasing_subsequence_using_binary_search(std::vector&lt; T &gt; &amp;nums)</div><div class="ttdoc">for std::uint32_t</div><div class="ttdef"><b>Definition</b> longest_increasing_subsequence_using_binary_search.cpp:65</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="470" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="alongest__increasing__subsequence__using__binary__search_8cpp_html_a313539d9a97fc6e121ce496873ba892e"><div class="ttname"><a href="#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a></div><div class="ttdeci">std::uint32_t longest_increasing_subsequence_using_binary_search(std::vector&lt; T &gt; &amp;nums)</div><div class="ttdoc">for std::uint32_t</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html#l00065">longest_increasing_subsequence_using_binary_search.cpp:65</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.map b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.map
deleted file mode 100644
index 2df4e6691..000000000
--- a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="longest_increasing_subsequence_using_binary_search" name="longest_increasing_subsequence_using_binary_search">
-<area shape="rect" id="Node000001" title="for std::uint32_t" alt="" coords="5,40,191,95"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/empty.html#" title=" " alt="" coords="239,5,366,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="191,42,231,33,232,38,192,48"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/lower_bound.html#" title=" " alt="" coords="242,55,362,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="191,65,227,65,227,70,191,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="245,104,360,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="192,87,232,97,231,102,191,93"/>
-</map>
diff --git a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.md5 b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.md5
deleted file mode 100644
index 568b5267e..000000000
--- a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d5964ace614cf3e3a1424d09c566ea55
\ No newline at end of file
diff --git a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.svg b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.svg
deleted file mode 100644
index 05f4c6e4a..000000000
--- a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: longest_increasing_subsequence_using_binary_search Pages: 1 -->
-<svg width="279pt" height="101pt"
- viewBox="0.00 0.00 278.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>longest_increasing_subsequence_using_binary_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="for std::uint32_t">
-<polygon fill="#999999" stroke="#666666" points="139,-67.5 0,-67.5 0,-25.75 139,-25.75 139,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">longest_increasing</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_subsequence_using_binary</text>
-<text text-anchor="middle" x="69.5" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">_search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.5,-93.25 175,-93.25 175,-74 270.5,-74 270.5,-93.25"/>
-<text text-anchor="middle" x="222.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.49,-63.5C149.57,-65.97 159.8,-68.47 169.48,-70.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.51,-74.21 179.06,-73.18 170.18,-67.41 168.51,-74.21"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/lower_bound.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.88,-56.25 177.62,-56.25 177.62,-37 267.88,-37 267.88,-56.25"/>
-<text text-anchor="middle" x="222.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::lower_bound</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.49,-46.62C148.38,-46.62 157.39,-46.62 166.03,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.03,-50.13 176.03,-46.63 166.03,-43.13 166.03,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-19.25 179.5,-19.25 179.5,0 266,0 266,-19.25"/>
-<text text-anchor="middle" x="222.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.49,-29.75C149.57,-27.28 159.8,-24.78 169.48,-22.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.18,-25.84 179.06,-20.07 168.51,-19.04 170.18,-25.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph_org.svg b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph_org.svg
deleted file mode 100644
index d3de937ed..000000000
--- a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph_org.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: longest_increasing_subsequence_using_binary_search Pages: 1 -->
-<svg width="279pt" height="101pt"
- viewBox="0.00 0.00 278.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>longest_increasing_subsequence_using_binary_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="for std::uint32_t">
-<polygon fill="#999999" stroke="#666666" points="139,-67.5 0,-67.5 0,-25.75 139,-25.75 139,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">longest_increasing</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_subsequence_using_binary</text>
-<text text-anchor="middle" x="69.5" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">_search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.5,-93.25 175,-93.25 175,-74 270.5,-74 270.5,-93.25"/>
-<text text-anchor="middle" x="222.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.49,-63.5C149.57,-65.97 159.8,-68.47 169.48,-70.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.51,-74.21 179.06,-73.18 170.18,-67.41 168.51,-74.21"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/lower_bound.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.88,-56.25 177.62,-56.25 177.62,-37 267.88,-37 267.88,-56.25"/>
-<text text-anchor="middle" x="222.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::lower_bound</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.49,-46.62C148.38,-46.62 157.39,-46.62 166.03,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.03,-50.13 176.03,-46.63 166.03,-43.13 166.03,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-19.25 179.5,-19.25 179.5,0 266,0 266,-19.25"/>
-<text text-anchor="middle" x="222.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.49,-29.75C149.57,-27.28 159.8,-24.78 169.48,-22.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.18,-25.84 179.06,-20.07 168.51,-19.04 170.18,-25.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index f1cce9138..000000000
--- a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Test cases for Longest Increasing Subsequence function." alt="" coords="5,55,56,80"/>
-<area shape="rect" id="Node000002" href="$d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e" title="for std::uint32_t" alt="" coords="104,40,289,95"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,65,88,65,88,70,56,70"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/empty.html#" title=" " alt="" coords="337,5,464,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="289,42,329,33,330,38,290,48"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/lower_bound.html#" title=" " alt="" coords="340,55,461,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="290,65,325,65,325,70,290,70"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="343,104,458,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="290,87,330,97,329,102,289,93"/>
-</map>
diff --git a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index d45c93ffd..000000000
--- a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e8baaeea10ef15115946c4a0db45636a
\ No newline at end of file
diff --git a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index 8506b9b2f..000000000
--- a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,121 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="352pt" height="101pt"
- viewBox="0.00 0.00 352.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test cases for Longest Increasing Subsequence function.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-56.25 0,-56.25 0,-37 37.75,-37 37.75,-56.25"/>
-<text text-anchor="middle" x="18.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e" target="_top" xlink:title="for std::uint32_t">
-<polygon fill="white" stroke="#666666" points="212.75,-67.5 73.75,-67.5 73.75,-25.75 212.75,-25.75 212.75,-67.5"/>
-<text text-anchor="start" x="81.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">longest_increasing</text>
-<text text-anchor="start" x="81.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_subsequence_using_binary</text>
-<text text-anchor="middle" x="143.25" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.2,-46.62C44.99,-46.62 53.21,-46.62 62.01,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.89,-50.13 71.89,-46.63 61.89,-43.13 61.89,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="344.25,-93.25 248.75,-93.25 248.75,-74 344.25,-74 344.25,-93.25"/>
-<text text-anchor="middle" x="296.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::empty</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.24,-63.5C223.32,-65.97 233.55,-68.47 243.23,-70.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="242.26,-74.21 252.81,-73.18 243.93,-67.41 242.26,-74.21"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/lower_bound.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="341.62,-56.25 251.38,-56.25 251.38,-37 341.62,-37 341.62,-56.25"/>
-<text text-anchor="middle" x="296.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::lower_bound</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.24,-46.62C222.13,-46.62 231.14,-46.62 239.78,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.78,-50.13 249.78,-46.63 239.78,-43.13 239.78,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="339.75,-19.25 253.25,-19.25 253.25,0 339.75,0 339.75,-19.25"/>
-<text text-anchor="middle" x="296.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.24,-29.75C223.32,-27.28 233.55,-24.78 243.23,-22.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.93,-25.84 252.81,-20.07 242.26,-19.04 243.93,-25.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index 40db0fbc2..000000000
--- a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,95 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="352pt" height="101pt"
- viewBox="0.00 0.00 352.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test cases for Longest Increasing Subsequence function.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-56.25 0,-56.25 0,-37 37.75,-37 37.75,-56.25"/>
-<text text-anchor="middle" x="18.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e" target="_top" xlink:title="for std::uint32_t">
-<polygon fill="white" stroke="#666666" points="212.75,-67.5 73.75,-67.5 73.75,-25.75 212.75,-25.75 212.75,-67.5"/>
-<text text-anchor="start" x="81.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">longest_increasing</text>
-<text text-anchor="start" x="81.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_subsequence_using_binary</text>
-<text text-anchor="middle" x="143.25" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.2,-46.62C44.99,-46.62 53.21,-46.62 62.01,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.89,-50.13 71.89,-46.63 61.89,-43.13 61.89,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="344.25,-93.25 248.75,-93.25 248.75,-74 344.25,-74 344.25,-93.25"/>
-<text text-anchor="middle" x="296.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::empty</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.24,-63.5C223.32,-65.97 233.55,-68.47 243.23,-70.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="242.26,-74.21 252.81,-73.18 243.93,-67.41 242.26,-74.21"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/lower_bound.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="341.62,-56.25 251.38,-56.25 251.38,-37 341.62,-37 341.62,-56.25"/>
-<text text-anchor="middle" x="296.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::lower_bound</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.24,-46.62C222.13,-46.62 231.14,-46.62 239.78,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.78,-50.13 249.78,-46.63 239.78,-43.13 239.78,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="339.75,-19.25 253.25,-19.25 253.25,0 339.75,0 339.75,-19.25"/>
-<text text-anchor="middle" x="296.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.24,-29.75C223.32,-27.28 233.55,-24.78 243.23,-22.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.93,-25.84 252.81,-20.07 242.26,-19.04 243.93,-25.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 391adda95..000000000
--- a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function to run tests." alt="" coords="5,55,55,80"/>
-<area shape="rect" id="Node000002" href="$d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Test cases for Longest Increasing Subsequence function." alt="" coords="103,55,153,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,65,88,65,88,70,55,70"/>
-<area shape="rect" id="Node000003" href="$d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e" title="for std::uint32_t" alt="" coords="201,40,386,95"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="154,65,185,65,185,70,154,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/empty.html#" title=" " alt="" coords="434,5,562,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="386,42,426,33,428,38,388,48"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/lower_bound.html#" title=" " alt="" coords="438,55,558,80"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="387,65,422,65,422,70,387,70"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="440,104,556,130"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="388,87,428,97,426,102,386,93"/>
-</map>
diff --git a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index e1cb617a8..000000000
--- a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-94853bf41b0075f98002cffdeb057c5e
\ No newline at end of file
diff --git a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 94a8d150f..000000000
--- a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="425pt" height="101pt"
- viewBox="0.00 0.00 425.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function to run tests.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Test cases for Longest Increasing Subsequence function.">
-<polygon fill="white" stroke="#666666" points="110.75,-56.25 73,-56.25 73,-37 110.75,-37 110.75,-56.25"/>
-<text text-anchor="middle" x="91.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-46.62C44.55,-46.62 53.37,-46.62 61.69,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-50.13 71.43,-46.63 61.43,-43.13 61.43,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e" target="_top" xlink:title="for std::uint32_t">
-<polygon fill="white" stroke="#666666" points="285.75,-67.5 146.75,-67.5 146.75,-25.75 285.75,-25.75 285.75,-67.5"/>
-<text text-anchor="start" x="154.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">longest_increasing</text>
-<text text-anchor="start" x="154.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_subsequence_using_binary</text>
-<text text-anchor="middle" x="216.25" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">_search</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.2,-46.62C117.99,-46.62 126.21,-46.62 135.01,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.89,-50.13 144.89,-46.63 134.89,-43.13 134.89,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="417.25,-93.25 321.75,-93.25 321.75,-74 417.25,-74 417.25,-93.25"/>
-<text text-anchor="middle" x="369.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::empty</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M286.24,-63.5C296.32,-65.97 306.55,-68.47 316.23,-70.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.26,-74.21 325.81,-73.18 316.93,-67.41 315.26,-74.21"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/lower_bound.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="414.62,-56.25 324.38,-56.25 324.38,-37 414.62,-37 414.62,-56.25"/>
-<text text-anchor="middle" x="369.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::lower_bound</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M286.24,-46.62C295.13,-46.62 304.14,-46.62 312.78,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="312.78,-50.13 322.78,-46.63 312.78,-43.13 312.78,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="412.75,-19.25 326.25,-19.25 326.25,0 412.75,0 412.75,-19.25"/>
-<text text-anchor="middle" x="369.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M286.24,-29.75C296.32,-27.28 306.55,-24.78 316.23,-22.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.93,-25.84 325.81,-20.07 315.26,-19.04 316.93,-25.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index a5ae750b5..000000000
--- a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,113 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="425pt" height="101pt"
- viewBox="0.00 0.00 425.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function to run tests.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Test cases for Longest Increasing Subsequence function.">
-<polygon fill="white" stroke="#666666" points="110.75,-56.25 73,-56.25 73,-37 110.75,-37 110.75,-56.25"/>
-<text text-anchor="middle" x="91.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-46.62C44.55,-46.62 53.37,-46.62 61.69,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-50.13 71.43,-46.63 61.43,-43.13 61.43,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e" target="_top" xlink:title="for std::uint32_t">
-<polygon fill="white" stroke="#666666" points="285.75,-67.5 146.75,-67.5 146.75,-25.75 285.75,-25.75 285.75,-67.5"/>
-<text text-anchor="start" x="154.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">longest_increasing</text>
-<text text-anchor="start" x="154.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_subsequence_using_binary</text>
-<text text-anchor="middle" x="216.25" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">_search</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.2,-46.62C117.99,-46.62 126.21,-46.62 135.01,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.89,-50.13 144.89,-46.63 134.89,-43.13 134.89,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="417.25,-93.25 321.75,-93.25 321.75,-74 417.25,-74 417.25,-93.25"/>
-<text text-anchor="middle" x="369.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::empty</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M286.24,-63.5C296.32,-65.97 306.55,-68.47 316.23,-70.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.26,-74.21 325.81,-73.18 316.93,-67.41 315.26,-74.21"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/lower_bound.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="414.62,-56.25 324.38,-56.25 324.38,-37 414.62,-37 414.62,-56.25"/>
-<text text-anchor="middle" x="369.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::lower_bound</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M286.24,-46.62C295.13,-46.62 304.14,-46.62 312.78,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="312.78,-50.13 322.78,-46.63 312.78,-43.13 312.78,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="412.75,-19.25 326.25,-19.25 326.25,0 412.75,0 412.75,-19.25"/>
-<text text-anchor="middle" x="369.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M286.24,-29.75C296.32,-27.28 306.55,-24.78 316.23,-22.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.93,-25.84 325.81,-20.07 315.26,-19.04 316.93,-25.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html
new file mode 100644
index 000000000..9e59ef5b9
--- /dev/null
+++ b/d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html
@@ -0,0 +1,199 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: search/longest_increasing_subsequence_using_binary_search.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">longest_increasing_subsequence_using_binary_search.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="preprocessor">#include &lt;algorithm&gt;</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="preprocessor">#include &lt;cstdint&gt;</span>   </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00065" data-start="{" data-end="}">
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e">   65</a></span>std::uint32_t <a class="code hl_function" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a>(std::vector&lt;T&gt;&amp; nums) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">if</span> (nums.empty()) <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    std::vector&lt;T&gt; ans;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    ans.push_back(nums[0]);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keywordflow">for</span> (std::size_t i = 1; i &lt; nums.size(); i++) {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        <span class="keywordflow">if</span> (nums[i] &gt; ans.back()) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            ans.push_back(nums[i]);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            <span class="keyword">auto</span> idx = std::lower_bound(ans.begin(), ans.end(), nums[i]) - ans.begin();</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            ans[idx] = nums[i];</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        }</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>std::uint32_t<span class="keyword">&gt;</span>(ans.size());</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>}</div>
+</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="foldopen" id="foldopen00085" data-start="{" data-end="}">
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"><a class="line" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">   85</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    std::vector&lt;int&gt; arr = {10, 9, 2, 5, 3, 7, 101, 18};</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    assert(<a class="code hl_function" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a>(arr) == 4);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::vector&lt;int&gt; arr2 = {0, 1, 0, 3, 2, 3};</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    assert(<a class="code hl_function" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a>(arr2) == 4);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    std::vector&lt;int&gt; arr3 = {7, 7, 7, 7, 7, 7, 7};</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    assert(<a class="code hl_function" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a>(arr3) == 1);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    std::vector&lt;int&gt; arr4 = {-10, -1, -5, 0, 5, 1, 2};</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    assert(<a class="code hl_function" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a>(arr4) == 5);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    std::vector&lt;double&gt; arr5 = {3.5, 1.2, 2.8, 3.1, 4.0};</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    assert(<a class="code hl_function" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a>(arr5) == 4);</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    std::vector&lt;char&gt; arr6 = {<span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;b&#39;</span>, <span class="charliteral">&#39;c&#39;</span>, <span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;d&#39;</span>};</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    assert(<a class="code hl_function" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a>(arr6) == 4);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::vector&lt;int&gt; arr7 = {};</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    assert(<a class="code hl_function" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a>(arr7) == 0);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>}</div>
+</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="foldopen" id="foldopen00114" data-start="{" data-end="}">
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"><a class="line" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  114</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <a class="code hl_function" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self test implementation</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>}</div>
+</div>
+<div class="ttc" id="alongest__increasing__subsequence__using__binary__search_8cpp_html_a313539d9a97fc6e121ce496873ba892e"><div class="ttname"><a href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a></div><div class="ttdeci">std::uint32_t longest_increasing_subsequence_using_binary_search(std::vector&lt; T &gt; &amp;nums)</div><div class="ttdoc">for std::uint32_t</div><div class="ttdef"><b>Definition</b> <a href="#l00065">longest_increasing_subsequence_using_binary_search.cpp:65</a></div></div>
+<div class="ttc" id="alongest__increasing__subsequence__using__binary__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Test cases for Longest Increasing Subsequence function.</div><div class="ttdef"><b>Definition</b> <a href="#l00085">longest_increasing_subsequence_using_binary_search.cpp:85</a></div></div>
+<div class="ttc" id="alongest__increasing__subsequence__using__binary__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function to run tests.</div><div class="ttdef"><b>Definition</b> <a href="#l00114">longest_increasing_subsequence_using_binary_search.cpp:114</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html">longest_increasing_subsequence_using_binary_search.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/d60/namespacerat__maze.html b/d9/d60/namespacerat__maze.html
index 892ba6d08..98ba0a5c1 100644
--- a/d9/d60/namespacerat__maze.html
+++ b/d9/d60/namespacerat__maze.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: rat_maze Namespace Reference</title>
+<title>TheAlgorithms/C++: rat_maze Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d9/d65/lfu__cache_8cpp.html b/d9/d65/lfu__cache_8cpp.html
index 23c47ab36..aacd6683b 100644
--- a/d9/d65/lfu__cache_8cpp.html
+++ b/d9/d65/lfu__cache_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/lfu_cache.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/lfu_cache.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for lfu_cache.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/dca/lfu__cache_8cpp__incl.svg" width="306" height="111"><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">
+</div>
+<p><a href="../../d9/d65/lfu__cache_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node&lt; T &gt;</a></td></tr>
@@ -144,9 +163,8 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="typedef-members" name="typedef-members"></a>
 Typedefs</h2></td></tr>
-<tr class="memitem:a5c0dfbf62803f020205076c3da18d058" id="r_a5c0dfbf62803f020205076c3da18d058"><td class="memTemplParams" colspan="2"><a id="a5c0dfbf62803f020205076c3da18d058" name="a5c0dfbf62803f020205076c3da18d058"></a>
-template&lt;typename K , typename V &gt; </td></tr>
-<tr class="memitem:a5c0dfbf62803f020205076c3da18d058"><td class="memTemplItemLeft" align="right" valign="top">using&#160;</td><td class="memTemplItemRight" valign="bottom"><b>others::Cache::CacheNode</b> = <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a>&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt;K, V&gt;&gt;</td></tr>
+<tr class="memitem:a5c0dfbf62803f020205076c3da18d058" id="r_a5c0dfbf62803f020205076c3da18d058"><td class="memTemplParams" colspan="2">template&lt;typename K , typename V &gt; </td></tr>
+<tr class="memitem:a5c0dfbf62803f020205076c3da18d058"><td class="memTemplItemLeft" align="right" valign="top">using&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dde/namespaceothers_1_1_cache.html#a5c0dfbf62803f020205076c3da18d058">others::Cache::CacheNode</a> = <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a>&lt;std::pair&lt;K, V&gt;&gt;</td></tr>
 <tr class="separator:a5c0dfbf62803f020205076c3da18d058"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
@@ -165,6 +183,8 @@ map).</p>
 <p>Hashmap maps the key to the address of the node of the linked list and its current usage frequency. If the element is accessed the element is removed from the linked list of the current frequency and added to the linked list of incremented frequency.</p>
 <p>When the cache is full, the last element in the minimum frequency linked list is popped.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/deDSeC00720" target="_blank">Karan Sharma</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -183,17 +203,14 @@ map).</p>
 
 <p>main function </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00301">301</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  301</span>           {</div>
 <div class="line"><span class="lineno">  302</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run the self test implementation</span></div>
 <div class="line"><span class="lineno">  303</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  304</span>}</div>
-<div class="ttc" id="alfu__cache_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">self test implementation</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:250</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="511"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="alfu__cache_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">self test implementation</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d65/lfu__cache_8cpp_source.html#l00250">lfu_cache.cpp:250</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -221,6 +238,8 @@ Here is the call graph for this function:</div>
 
 <p>self test implementation </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00250">250</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  250</span>                   {</div>
 <div class="line"><span class="lineno">  251</span>    <a class="code hl_class" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache&lt;int, int&gt;</a> cache(5);</div>
 <div class="line"><span class="lineno">  252</span> </div>
@@ -265,16 +284,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  291</span>    assert(cache.get(5) == -50);</div>
 <div class="line"><span class="lineno">  292</span>    assert(cache.get(6) == 60);</div>
 <div class="line"><span class="lineno">  293</span> </div>
-<div class="line"><span class="lineno">  294</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;test - passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  294</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test - passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  295</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="aclassothers_1_1_cache_1_1_l_f_u_cache_html"><div class="ttname"><a href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache</a></div><div class="ttdoc">LFUCache.</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:64</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="511"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html"><div class="ttname"><a href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache</a></div><div class="ttdoc">LFUCache.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d65/lfu__cache_8cpp_source.html#l00064">lfu_cache.cpp:64</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index baedf2a3c..000000000
--- a/d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="self test implementation" alt="" coords="5,136,49,161"/>
-<area shape="rect" id="Node000002" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c" title="Returns the total capacity of the cache." alt="" coords="110,5,284,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="33,134,57,96,74,75,95,57,103,51,106,56,98,61,78,79,61,99,37,137"/>
-<area shape="rect" id="Node000003" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0" title="returns true if the cache is empty, false otherwise." alt="" coords="110,71,284,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="48,138,96,120,114,114,116,119,98,126,50,143"/>
-<area shape="rect" id="Node000004" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781" title="get the value of the key&#45;value pair if exists" alt="" coords="97,136,297,161"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,146,81,146,81,151,49,151"/>
-<area shape="rect" id="Node000007" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e" title="upsert a key&#45;value pair" alt="" coords="97,185,297,210"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="50,154,97,171,121,178,120,183,96,176,48,159"/>
-<area shape="rect" id="Node000009" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195" title="Returns the number of items present in the cache." alt="" coords="110,235,284,275"/>
-<area shape="poly" id="edge10_Node000001_Node000009" title=" " alt="" coords="39,160,63,190,98,221,106,225,103,230,95,225,60,194,35,163"/>
-<area shape="rect" id="Node000005" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" title="increase the frequency of node and push it in the respective list." alt="" coords="360,124,534,165"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="298,144,344,143,344,149,298,149"/>
-<area shape="rect" id="Node000006" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" title="push the node at first position in the linked list of given frequency" alt="" coords="596,153,771,194"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="534,152,581,158,581,164,534,158"/>
-<area shape="poly" id="edge7_Node000007_Node000005" title=" " alt="" coords="260,182,344,163,345,169,261,187"/>
-<area shape="poly" id="edge9_Node000007_Node000006" title=" " alt="" coords="297,190,580,176,581,181,297,195"/>
-<area shape="rect" id="Node000008" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69" title="pop the last node in the least frequently used linked list" alt="" coords="345,240,548,265"/>
-<area shape="poly" id="edge8_Node000007_Node000008" title=" " alt="" coords="259,208,370,233,369,238,258,214"/>
-</map>
diff --git a/d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index a4e7f9181..000000000
--- a/d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0591dc07f3e2271183514438a924765e
\ No newline at end of file
diff --git a/d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 5792f04ce..000000000
--- a/d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,271 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<!--zoomable 211 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 582;
-var viewHeight = 211;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="self test implementation">
-<polygon fill="#999999" stroke="#666666" points="32.5,-104.88 0,-104.88 0,-85.62 32.5,-85.62 32.5,-104.88"/>
-<text text-anchor="middle" x="16.25" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c" target="_top" xlink:title="Returns the total capacity of the cache.">
-<polygon fill="white" stroke="#666666" points="209,-202.5 78.25,-202.5 78.25,-172 209,-172 209,-202.5"/>
-<text text-anchor="start" x="86.25" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="143.62" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">::capacity</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.19,-104.92C30.07,-119.41 46.83,-146.73 68.5,-162.25 70.44,-163.64 72.46,-164.96 74.55,-166.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.87,-169.28 83.35,-170.84 76.14,-163.08 72.87,-169.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0" target="_top" xlink:title="returns true if the cache is empty, false otherwise.">
-<polygon fill="white" stroke="#666666" points="209,-153.5 78.25,-153.5 78.25,-123 209,-123 209,-153.5"/>
-<text text-anchor="start" x="86.25" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="143.62" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.89,-101.24C43.01,-105.07 56.49,-110.08 68.5,-114.25 72.96,-115.8 77.57,-117.37 82.23,-118.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.06,-122.23 91.65,-122.05 83.26,-115.58 81.06,-122.23"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781" target="_top" xlink:title="get the value of the key&#45;value pair if exists">
-<polygon fill="white" stroke="#666666" points="218.75,-104.88 68.5,-104.88 68.5,-85.62 218.75,-85.62 218.75,-104.88"/>
-<text text-anchor="middle" x="143.62" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::get</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.88,-95.25C39.5,-95.25 47.78,-95.25 56.81,-95.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.61,-98.75 66.61,-95.25 56.61,-91.75 56.61,-98.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e" target="_top" xlink:title="upsert a key&#45;value pair">
-<polygon fill="white" stroke="#666666" points="218.75,-67.88 68.5,-67.88 68.5,-48.62 218.75,-48.62 218.75,-67.88"/>
-<text text-anchor="middle" x="143.62" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::put</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.79,-88.95C42.87,-85 56.34,-79.97 68.5,-76.25 74.28,-74.48 80.35,-72.78 86.43,-71.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.04,-74.62 95.85,-68.74 85.3,-67.84 87.04,-74.62"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195" target="_top" xlink:title="Returns the number of items present in the cache.">
-<polygon fill="white" stroke="#666666" points="209,-30.5 78.25,-30.5 78.25,0 209,0 209,-30.5"/>
-<text text-anchor="start" x="86.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="143.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge10_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge10_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.72,-85.51C32.47,-73.07 49.21,-51.65 68.5,-39.25 70.33,-38.07 72.23,-36.94 74.18,-35.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.45,-39.14 82.87,-31.58 72.36,-32.86 75.45,-39.14"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" target="_top" xlink:title="increase the frequency of node and push it in the respective list.">
-<polygon fill="white" stroke="#666666" points="396.38,-113.5 265.62,-113.5 265.62,-83 396.38,-83 396.38,-113.5"/>
-<text text-anchor="start" x="273.62" y="-100" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="331" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.22,-96.46C230.69,-96.64 242.55,-96.83 254.04,-97.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.83,-100.52 263.88,-97.18 253.94,-93.52 253.83,-100.52"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
-<polygon fill="white" stroke="#666666" points="574,-91.5 443.25,-91.5 443.25,-61 574,-61 574,-91.5"/>
-<text text-anchor="start" x="451.25" y="-78" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="508.62" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M396.4,-90.18C407.9,-88.74 419.98,-87.23 431.76,-85.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="431.95,-89.26 441.44,-84.54 431.08,-82.31 431.95,-89.26"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge7_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge7_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.4,-68.34C210.49,-72.46 233.06,-77.33 254.38,-81.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.39,-85.3 263.9,-83.99 254.87,-78.46 253.39,-85.3"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge9_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge9_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M218.96,-61.94C280.96,-65.01 368.95,-69.37 431.45,-72.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="431.14,-75.96 441.3,-72.96 431.49,-68.97 431.14,-75.96"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69" target="_top" xlink:title="pop the last node in the least frequently used linked list">
-<polygon fill="white" stroke="#666666" points="407.25,-26.88 254.75,-26.88 254.75,-7.62 407.25,-7.62 407.25,-26.88"/>
-<text text-anchor="middle" x="331" y="-13.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::pop</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge8_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.97,-48.22C215.11,-42.66 246.59,-35.7 273.34,-29.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.99,-33.22 283,-27.65 272.48,-26.39 273.99,-33.22"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 2ece4a362..000000000
--- a/d9/d65/lfu__cache_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,188 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="582pt" height="211pt"
- viewBox="0.00 0.00 582.00 210.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 206.5)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="self test implementation">
-<polygon fill="#999999" stroke="#666666" points="32.5,-104.88 0,-104.88 0,-85.62 32.5,-85.62 32.5,-104.88"/>
-<text text-anchor="middle" x="16.25" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c" target="_top" xlink:title="Returns the total capacity of the cache.">
-<polygon fill="white" stroke="#666666" points="209,-202.5 78.25,-202.5 78.25,-172 209,-172 209,-202.5"/>
-<text text-anchor="start" x="86.25" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="143.62" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">::capacity</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.19,-104.92C30.07,-119.41 46.83,-146.73 68.5,-162.25 70.44,-163.64 72.46,-164.96 74.55,-166.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.87,-169.28 83.35,-170.84 76.14,-163.08 72.87,-169.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0" target="_top" xlink:title="returns true if the cache is empty, false otherwise.">
-<polygon fill="white" stroke="#666666" points="209,-153.5 78.25,-153.5 78.25,-123 209,-123 209,-153.5"/>
-<text text-anchor="start" x="86.25" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="143.62" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.89,-101.24C43.01,-105.07 56.49,-110.08 68.5,-114.25 72.96,-115.8 77.57,-117.37 82.23,-118.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.06,-122.23 91.65,-122.05 83.26,-115.58 81.06,-122.23"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781" target="_top" xlink:title="get the value of the key&#45;value pair if exists">
-<polygon fill="white" stroke="#666666" points="218.75,-104.88 68.5,-104.88 68.5,-85.62 218.75,-85.62 218.75,-104.88"/>
-<text text-anchor="middle" x="143.62" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::get</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.88,-95.25C39.5,-95.25 47.78,-95.25 56.81,-95.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.61,-98.75 66.61,-95.25 56.61,-91.75 56.61,-98.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e" target="_top" xlink:title="upsert a key&#45;value pair">
-<polygon fill="white" stroke="#666666" points="218.75,-67.88 68.5,-67.88 68.5,-48.62 218.75,-48.62 218.75,-67.88"/>
-<text text-anchor="middle" x="143.62" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::put</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.79,-88.95C42.87,-85 56.34,-79.97 68.5,-76.25 74.28,-74.48 80.35,-72.78 86.43,-71.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.04,-74.62 95.85,-68.74 85.3,-67.84 87.04,-74.62"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195" target="_top" xlink:title="Returns the number of items present in the cache.">
-<polygon fill="white" stroke="#666666" points="209,-30.5 78.25,-30.5 78.25,0 209,0 209,-30.5"/>
-<text text-anchor="start" x="86.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="143.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge10_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge10_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.72,-85.51C32.47,-73.07 49.21,-51.65 68.5,-39.25 70.33,-38.07 72.23,-36.94 74.18,-35.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.45,-39.14 82.87,-31.58 72.36,-32.86 75.45,-39.14"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" target="_top" xlink:title="increase the frequency of node and push it in the respective list.">
-<polygon fill="white" stroke="#666666" points="396.38,-113.5 265.62,-113.5 265.62,-83 396.38,-83 396.38,-113.5"/>
-<text text-anchor="start" x="273.62" y="-100" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="331" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.22,-96.46C230.69,-96.64 242.55,-96.83 254.04,-97.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.83,-100.52 263.88,-97.18 253.94,-93.52 253.83,-100.52"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
-<polygon fill="white" stroke="#666666" points="574,-91.5 443.25,-91.5 443.25,-61 574,-61 574,-91.5"/>
-<text text-anchor="start" x="451.25" y="-78" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="508.62" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M396.4,-90.18C407.9,-88.74 419.98,-87.23 431.76,-85.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="431.95,-89.26 441.44,-84.54 431.08,-82.31 431.95,-89.26"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge7_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge7_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.4,-68.34C210.49,-72.46 233.06,-77.33 254.38,-81.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.39,-85.3 263.9,-83.99 254.87,-78.46 253.39,-85.3"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge9_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge9_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M218.96,-61.94C280.96,-65.01 368.95,-69.37 431.45,-72.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="431.14,-75.96 441.3,-72.96 431.49,-68.97 431.14,-75.96"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69" target="_top" xlink:title="pop the last node in the least frequently used linked list">
-<polygon fill="white" stroke="#666666" points="407.25,-26.88 254.75,-26.88 254.75,-7.62 407.25,-7.62 407.25,-26.88"/>
-<text text-anchor="middle" x="331" y="-13.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::pop</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge8_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.97,-48.22C215.11,-42.66 246.59,-35.7 273.34,-29.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.99,-33.22 283,-27.65 272.48,-26.39 273.99,-33.22"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index bc9db1e6c..000000000
--- a/d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,23 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="main function" alt="" coords="5,136,55,161"/>
-<area shape="rect" id="Node000002" href="$d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="self test implementation" alt="" coords="103,136,146,161"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,146,87,146,87,151,55,151"/>
-<area shape="rect" id="Node000003" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c" title="Returns the total capacity of the cache." alt="" coords="207,5,381,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="130,134,154,96,172,75,192,57,201,51,204,56,196,61,176,79,158,99,135,137"/>
-<area shape="rect" id="Node000004" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0" title="returns true if the cache is empty, false otherwise." alt="" coords="207,71,381,111"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="146,138,193,120,211,114,213,119,195,126,147,143"/>
-<area shape="rect" id="Node000005" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781" title="get the value of the key&#45;value pair if exists" alt="" coords="194,136,394,161"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="147,146,178,146,178,151,147,151"/>
-<area shape="rect" id="Node000008" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e" title="upsert a key&#45;value pair" alt="" coords="194,185,394,210"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="147,154,195,171,219,178,217,183,193,176,145,159"/>
-<area shape="rect" id="Node000010" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195" title="Returns the number of items present in the cache." alt="" coords="207,235,381,275"/>
-<area shape="poly" id="edge11_Node000002_Node000010" title=" " alt="" coords="136,160,161,190,196,221,203,225,200,230,192,225,157,194,132,163"/>
-<area shape="rect" id="Node000006" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" title="increase the frequency of node and push it in the respective list." alt="" coords="457,124,631,165"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="395,144,441,143,441,149,395,149"/>
-<area shape="rect" id="Node000007" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" title="push the node at first position in the linked list of given frequency" alt="" coords="694,153,868,194"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="632,152,679,158,678,164,631,158"/>
-<area shape="poly" id="edge8_Node000008_Node000006" title=" " alt="" coords="357,182,441,163,442,169,358,187"/>
-<area shape="poly" id="edge10_Node000008_Node000007" title=" " alt="" coords="394,190,678,176,678,181,395,195"/>
-<area shape="rect" id="Node000009" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69" title="pop the last node in the least frequently used linked list" alt="" coords="442,240,646,265"/>
-<area shape="poly" id="edge9_Node000008_Node000009" title=" " alt="" coords="357,208,468,233,467,238,355,214"/>
-</map>
diff --git a/d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 9641dce67..000000000
--- a/d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d353b232a9a0af8fc1835fc904dbe96e
\ No newline at end of file
diff --git a/d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index d212d090a..000000000
--- a/d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,289 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 211 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 655;
-var viewHeight = 211;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-104.88 0,-104.88 0,-85.62 37,-85.62 37,-104.88"/>
-<text text-anchor="middle" x="18.5" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="self test implementation">
-<polygon fill="white" stroke="#666666" points="105.5,-104.88 73,-104.88 73,-85.62 105.5,-85.62 105.5,-104.88"/>
-<text text-anchor="middle" x="89.25" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-95.25C44.58,-95.25 53.31,-95.25 61.45,-95.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-98.75 71.2,-95.25 61.2,-91.75 61.2,-98.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c" target="_top" xlink:title="Returns the total capacity of the cache.">
-<polygon fill="white" stroke="#666666" points="282,-202.5 151.25,-202.5 151.25,-172 282,-172 282,-202.5"/>
-<text text-anchor="start" x="159.25" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="216.62" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">::capacity</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.19,-104.92C103.07,-119.41 119.83,-146.73 141.5,-162.25 143.44,-163.64 145.46,-164.96 147.55,-166.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.87,-169.28 156.35,-170.84 149.14,-163.08 145.87,-169.28"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0" target="_top" xlink:title="returns true if the cache is empty, false otherwise.">
-<polygon fill="white" stroke="#666666" points="282,-153.5 151.25,-153.5 151.25,-123 282,-123 282,-153.5"/>
-<text text-anchor="start" x="159.25" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="216.62" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.89,-101.24C116.01,-105.07 129.49,-110.08 141.5,-114.25 145.96,-115.8 150.57,-117.37 155.23,-118.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.06,-122.23 164.65,-122.05 156.26,-115.58 154.06,-122.23"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781" target="_top" xlink:title="get the value of the key&#45;value pair if exists">
-<polygon fill="white" stroke="#666666" points="291.75,-104.88 141.5,-104.88 141.5,-85.62 291.75,-85.62 291.75,-104.88"/>
-<text text-anchor="middle" x="216.62" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::get</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.88,-95.25C112.5,-95.25 120.78,-95.25 129.81,-95.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.61,-98.75 139.61,-95.25 129.61,-91.75 129.61,-98.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e" target="_top" xlink:title="upsert a key&#45;value pair">
-<polygon fill="white" stroke="#666666" points="291.75,-67.88 141.5,-67.88 141.5,-48.62 291.75,-48.62 291.75,-67.88"/>
-<text text-anchor="middle" x="216.62" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::put</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.79,-88.95C115.87,-85 129.34,-79.97 141.5,-76.25 147.28,-74.48 153.35,-72.78 159.43,-71.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.04,-74.62 168.85,-68.74 158.3,-67.84 160.04,-74.62"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195" target="_top" xlink:title="Returns the number of items present in the cache.">
-<polygon fill="white" stroke="#666666" points="282,-30.5 151.25,-30.5 151.25,0 282,0 282,-30.5"/>
-<text text-anchor="start" x="159.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="216.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge11_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge11_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.72,-85.51C105.47,-73.07 122.21,-51.65 141.5,-39.25 143.33,-38.07 145.23,-36.94 147.18,-35.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.45,-39.14 155.87,-31.58 145.36,-32.86 148.45,-39.14"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" target="_top" xlink:title="increase the frequency of node and push it in the respective list.">
-<polygon fill="white" stroke="#666666" points="469.38,-113.5 338.62,-113.5 338.62,-83 469.38,-83 469.38,-113.5"/>
-<text text-anchor="start" x="346.62" y="-100" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="404" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.22,-96.46C303.69,-96.64 315.55,-96.83 327.04,-97.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.83,-100.52 336.88,-97.18 326.94,-93.52 326.83,-100.52"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
-<polygon fill="white" stroke="#666666" points="647,-91.5 516.25,-91.5 516.25,-61 647,-61 647,-91.5"/>
-<text text-anchor="start" x="524.25" y="-78" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="581.62" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M469.4,-90.18C480.9,-88.74 492.98,-87.23 504.76,-85.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="504.95,-89.26 514.44,-84.54 504.08,-82.31 504.95,-89.26"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge8_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge8_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.4,-68.34C283.49,-72.46 306.06,-77.33 327.38,-81.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.39,-85.3 336.9,-83.99 327.87,-78.46 326.39,-85.3"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge10_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge10_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M291.96,-61.94C353.96,-65.01 441.95,-69.37 504.45,-72.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="504.14,-75.96 514.3,-72.96 504.49,-68.97 504.14,-75.96"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69" target="_top" xlink:title="pop the last node in the least frequently used linked list">
-<polygon fill="white" stroke="#666666" points="480.25,-26.88 327.75,-26.88 327.75,-7.62 480.25,-7.62 480.25,-26.88"/>
-<text text-anchor="middle" x="404" y="-13.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::pop</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge9_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.97,-48.22C288.11,-42.66 319.59,-35.7 346.34,-29.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="346.99,-33.22 356,-27.65 345.48,-26.39 346.99,-33.22"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 26e01d9e0..000000000
--- a/d9/d65/lfu__cache_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,206 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="655pt" height="211pt"
- viewBox="0.00 0.00 655.00 210.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 206.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-104.88 0,-104.88 0,-85.62 37,-85.62 37,-104.88"/>
-<text text-anchor="middle" x="18.5" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="self test implementation">
-<polygon fill="white" stroke="#666666" points="105.5,-104.88 73,-104.88 73,-85.62 105.5,-85.62 105.5,-104.88"/>
-<text text-anchor="middle" x="89.25" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-95.25C44.58,-95.25 53.31,-95.25 61.45,-95.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-98.75 71.2,-95.25 61.2,-91.75 61.2,-98.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c" target="_top" xlink:title="Returns the total capacity of the cache.">
-<polygon fill="white" stroke="#666666" points="282,-202.5 151.25,-202.5 151.25,-172 282,-172 282,-202.5"/>
-<text text-anchor="start" x="159.25" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="216.62" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">::capacity</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.19,-104.92C103.07,-119.41 119.83,-146.73 141.5,-162.25 143.44,-163.64 145.46,-164.96 147.55,-166.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.87,-169.28 156.35,-170.84 149.14,-163.08 145.87,-169.28"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0" target="_top" xlink:title="returns true if the cache is empty, false otherwise.">
-<polygon fill="white" stroke="#666666" points="282,-153.5 151.25,-153.5 151.25,-123 282,-123 282,-153.5"/>
-<text text-anchor="start" x="159.25" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="216.62" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.89,-101.24C116.01,-105.07 129.49,-110.08 141.5,-114.25 145.96,-115.8 150.57,-117.37 155.23,-118.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.06,-122.23 164.65,-122.05 156.26,-115.58 154.06,-122.23"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781" target="_top" xlink:title="get the value of the key&#45;value pair if exists">
-<polygon fill="white" stroke="#666666" points="291.75,-104.88 141.5,-104.88 141.5,-85.62 291.75,-85.62 291.75,-104.88"/>
-<text text-anchor="middle" x="216.62" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::get</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.88,-95.25C112.5,-95.25 120.78,-95.25 129.81,-95.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.61,-98.75 139.61,-95.25 129.61,-91.75 129.61,-98.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e" target="_top" xlink:title="upsert a key&#45;value pair">
-<polygon fill="white" stroke="#666666" points="291.75,-67.88 141.5,-67.88 141.5,-48.62 291.75,-48.62 291.75,-67.88"/>
-<text text-anchor="middle" x="216.62" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::put</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.79,-88.95C115.87,-85 129.34,-79.97 141.5,-76.25 147.28,-74.48 153.35,-72.78 159.43,-71.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.04,-74.62 168.85,-68.74 158.3,-67.84 160.04,-74.62"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195" target="_top" xlink:title="Returns the number of items present in the cache.">
-<polygon fill="white" stroke="#666666" points="282,-30.5 151.25,-30.5 151.25,0 282,0 282,-30.5"/>
-<text text-anchor="start" x="159.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="216.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge11_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge11_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.72,-85.51C105.47,-73.07 122.21,-51.65 141.5,-39.25 143.33,-38.07 145.23,-36.94 147.18,-35.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.45,-39.14 155.87,-31.58 145.36,-32.86 148.45,-39.14"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" target="_top" xlink:title="increase the frequency of node and push it in the respective list.">
-<polygon fill="white" stroke="#666666" points="469.38,-113.5 338.62,-113.5 338.62,-83 469.38,-83 469.38,-113.5"/>
-<text text-anchor="start" x="346.62" y="-100" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="404" y="-88.75" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.22,-96.46C303.69,-96.64 315.55,-96.83 327.04,-97.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.83,-100.52 336.88,-97.18 326.94,-93.52 326.83,-100.52"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
-<polygon fill="white" stroke="#666666" points="647,-91.5 516.25,-91.5 516.25,-61 647,-61 647,-91.5"/>
-<text text-anchor="start" x="524.25" y="-78" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="581.62" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M469.4,-90.18C480.9,-88.74 492.98,-87.23 504.76,-85.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="504.95,-89.26 514.44,-84.54 504.08,-82.31 504.95,-89.26"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge8_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge8_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.4,-68.34C283.49,-72.46 306.06,-77.33 327.38,-81.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.39,-85.3 336.9,-83.99 327.87,-78.46 326.39,-85.3"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge10_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge10_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M291.96,-61.94C353.96,-65.01 441.95,-69.37 504.45,-72.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="504.14,-75.96 514.3,-72.96 504.49,-68.97 504.14,-75.96"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69" target="_top" xlink:title="pop the last node in the least frequently used linked list">
-<polygon fill="white" stroke="#666666" points="480.25,-26.88 327.75,-26.88 327.75,-7.62 480.25,-7.62 480.25,-26.88"/>
-<text text-anchor="middle" x="404" y="-13.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::pop</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge9_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.97,-48.22C288.11,-42.66 319.59,-35.7 346.34,-29.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="346.99,-33.22 356,-27.65 345.48,-26.39 346.99,-33.22"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d65/lfu__cache_8cpp_source.html b/d9/d65/lfu__cache_8cpp_source.html
new file mode 100644
index 000000000..5e8ab5681
--- /dev/null
+++ b/d9/d65/lfu__cache_8cpp_source.html
@@ -0,0 +1,392 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/lfu_cache.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d65/lfu__cache_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">lfu_cache.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/d65/lfu__cache_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;cassert&gt;</span>        <span class="comment">// for assert</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;iostream&gt;</span>       <span class="comment">// for std::cout</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;unordered_map&gt;</span>  <span class="comment">// for std::unordered_map</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/d6f/namespaceothers.html">others</a> {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="}">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../db/dde/namespaceothers_1_1_cache.html">   37</a></span><span class="keyword">namespace </span>Cache {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="keyword">class </span><a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a> {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75">   47</a></span>    T <a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>;           </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5">   48</a></span>    <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node&lt;T&gt;</a> *<a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5">prev</a>;  </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"><a class="line" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd">   49</a></span>    <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node&lt;T&gt;</a> *<a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd">next</a>;  </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keyword">explicit</span> <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a>(T <a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>) : <a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>(<a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>), <a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5">prev</a>(nullptr), <a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd">next</a>(nullptr) {}</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>};</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> K, <span class="keyword">typename</span> V&gt;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="keyword">using </span>CacheNode = D_Node&lt;std::pair&lt;K, V&gt;&gt;;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> K, <span class="keyword">typename</span> V&gt;</div>
+<div class="foldopen" id="foldopen00064" data-start="{" data-end="};">
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">   64</a></span><span class="keyword">class </span><a class="code hl_class" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">LFUCache</a> {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    std::unordered_map&lt;K, std::pair&lt;CacheNode&lt;K, V&gt; *, <span class="keywordtype">int</span>&gt;&gt;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"><a class="line" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">   66</a></span>        <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>;  </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    std::unordered_map&lt;int, std::pair&lt;CacheNode&lt;K, V&gt; *, <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a> *&gt;&gt;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"><a class="line" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2">   68</a></span>        <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>;  </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"><a class="line" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285">   70</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285">minFreq</a>;    </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"><a class="line" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5">   71</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5">_capacity</a>;  </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"><a class="line" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#affd7776c246caa2d0f92fd8616f6e5dc">   78</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#affd7776c246caa2d0f92fd8616f6e5dc">LFUCache</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5">_capacity</a>) : <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285">minFreq</a>(0), <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5">_capacity</a>(<a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5">_capacity</a>) {}</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> <span class="keyword">private</span>:</div>
+<div class="foldopen" id="foldopen00088" data-start="{" data-end="}">
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"><a class="line" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047">   88</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047">push</a>(<span class="keywordtype">int</span> freq, <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        <span class="comment">// if freq is not present, then make a new list with node as the head as</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        <span class="comment">// well as tail.</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        <span class="keywordflow">if</span> (!<a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>.count(freq)) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>            <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>[freq] = {<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>};</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        }</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        std::pair&lt;CacheNode&lt;K, V&gt; *, <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a> *&gt; &amp;p = <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>[freq];</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        <span class="comment">// insert the node at the beginning of the linked list and update the</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        <span class="comment">// head.</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        p.first-&gt;prev = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next = p.first;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        p.first = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    }</div>
+</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="foldopen" id="foldopen00109" data-start="{" data-end="}">
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"><a class="line" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9">  109</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9">increase_frequency</a>(std::pair&lt;<a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a> *, <span class="keywordtype">int</span>&gt; &amp;p_node) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = p_node.first;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        <span class="keywordtype">int</span> freq = p_node.second;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        std::pair&lt;CacheNode&lt;K, V&gt; *, <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a> *&gt; &amp;p = <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>[freq];</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        <span class="comment">// if the given node is the only node in the list,</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        <span class="comment">// then erase the frequency from map</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        <span class="comment">// and increase minFreq by 1.</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        <span class="keywordflow">if</span> (p.first == <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> &amp;&amp; p.second == <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>            <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>.erase(freq);</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285">minFreq</a> == freq) {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>                <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285">minFreq</a> = freq + 1;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>            }</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>            <span class="comment">// remove the given node from current freq linked list</span></div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>            <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a> *prev = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;prev;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>            <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a> *next = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;prev = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>            <span class="keywordflow">if</span> (prev) {</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>                prev-&gt;<a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd">next</a> = next;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>                p.first = next;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>            }</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span> </div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>            <span class="keywordflow">if</span> (next) {</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>                next-&gt;<a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5">prev</a> = prev;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>                p.second = prev;</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>            }</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        }</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        <a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047">push</a>(freq + 1, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        ++p_node.second;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    }</div>
+</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span> </div>
+<div class="foldopen" id="foldopen00149" data-start="{" data-end="}">
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"><a class="line" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69">  149</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69">pop</a>() {</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>        std::pair&lt;CacheNode&lt;K, V&gt; *, <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a> *&gt; &amp;p = <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>[<a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285">minFreq</a>];</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>        <span class="comment">// if there is only one node</span></div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>        <span class="comment">// remove the node and erase</span></div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        <span class="comment">// the frequency from freq_map</span></div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>        <span class="keywordflow">if</span> (p.first == p.second) {</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>            <span class="keyword">delete</span> p.first;</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>            <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>.erase(<a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285">minFreq</a>);</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        }</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span> </div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        <span class="comment">// remove the last node in the linked list</span></div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a> *temp = p.second;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        p.second = temp-&gt;<a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5">prev</a>;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>        p.second-&gt;next = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>        <span class="keyword">delete</span> temp;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    }</div>
+</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span> </div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00174" data-start="{" data-end="}">
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"><a class="line" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e">  174</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e">put</a>(K key, V value) {</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        <span class="comment">// update the value if key already exists</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.count(key)) {</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>            <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>[key].first-&gt;data.second = value;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>            <a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9">increase_frequency</a>(<a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>[key]);</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        }</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span> </div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>        <span class="comment">// if the cache is full</span></div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>        <span class="comment">// remove the least frequently used item</span></div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.size() == <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5">_capacity</a>) {</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>            <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.erase(<a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>[<a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285">minFreq</a>].second-&gt;data.first);</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>            <a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69">pop</a>();</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>        }</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span> </div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        <span class="comment">// insert the new node and set minFreq to 1</span></div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>        <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a>({key, value});</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>        <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>[key] = {<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>, 1};</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>        <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285">minFreq</a> = 1;</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        <a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047">push</a>(1, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    }</div>
+</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span> </div>
+<div class="foldopen" id="foldopen00202" data-start="{" data-end="}">
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"><a class="line" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781">  202</a></span>    V <a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781">get</a>(K key) {</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>        <span class="keywordflow">if</span> (!<a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.count(key)) {</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>            <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;key is not present in the cache&quot;</span>);</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>        }</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span> </div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>        <span class="comment">// increase the frequency and return the value</span></div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>        V value = <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>[key].first-&gt;data.second;</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>        <a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9">increase_frequency</a>(<a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>[key]);</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>        <span class="keywordflow">return</span> value;</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    }</div>
+</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span> </div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"><a class="line" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195">  217</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195">size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.size(); }</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span> </div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"><a class="line" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c">  223</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c">capacity</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5">_capacity</a>; }</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span> </div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"><a class="line" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0">  229</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0">empty</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.empty(); }</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span> </div>
+<div class="foldopen" id="foldopen00235" data-start="{" data-end="}">
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"><a class="line" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a8857531ecc8ed2e36868e267148eff36">  235</a></span>    <a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a8857531ecc8ed2e36868e267148eff36">~LFUCache</a>() {</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>        <span class="keyword">auto</span> it = <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.begin();</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>        <span class="keywordflow">while</span> (it != <a class="code hl_variable" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.end()) {</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>            <span class="keyword">delete</span> it-&gt;second.first;</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>            ++it;</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>        }</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    }</div>
+</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>};</div>
+</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>}  <span class="comment">// namespace Cache</span></div>
+</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>}  <span class="comment">// namespace others</span></div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span> </div>
+<div class="foldopen" id="foldopen00250" data-start="{" data-end="}">
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"><a class="line" href="../../d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  250</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    <a class="code hl_class" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache&lt;int, int&gt;</a> cache(5);</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span> </div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    <span class="comment">// test the initial state of the cache</span></div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>    assert(cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195">size</a>() == 0);</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>    assert(cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c">capacity</a>() == 5);</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    assert(cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0">empty</a>());</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span> </div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    <span class="comment">// test insertion in the cache</span></div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>    cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e">put</a>(1, 10);</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>    cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e">put</a>(-2, 20);</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span> </div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    <span class="comment">// test the state of cache after inserting some items</span></div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>    assert(cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195">size</a>() == 2);</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>    assert(cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c">capacity</a>() == 5);</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>    assert(!cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0">empty</a>());</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span> </div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>    <span class="comment">// test getting items from the cache</span></div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>    assert(cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781">get</a>(1) == 10);</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>    assert(cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781">get</a>(-2) == 20);</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span> </div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e">put</a>(-3, -30);</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e">put</a>(4, 40);</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>    cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e">put</a>(5, -50);</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>    cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e">put</a>(6, 60);</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span> </div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>    <span class="comment">// test the state after inserting more items than the capacity</span></div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>    assert(cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195">size</a>() == 5);</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>    assert(cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c">capacity</a>() == 5);</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>    assert(!cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0">empty</a>());</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span> </div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>    <span class="comment">// test retrieval of all items in the cache</span></div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>    assert(cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781">get</a>(1) == 10);</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    assert(cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781">get</a>(-2) == 20);</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span> </div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>    <span class="comment">// fetching -3 throws runtime_error</span></div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>    <span class="comment">// as -3 was evicted being the least frequently used</span></div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>    <span class="comment">// when 6 was added</span></div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>    <span class="comment">// assert(cache.get(-3) == -30);</span></div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span> </div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>    assert(cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781">get</a>(4) == 40);</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>    assert(cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781">get</a>(5) == -50);</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>    assert(cache.<a class="code hl_function" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781">get</a>(6) == 60);</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span> </div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test - passed\n&quot;</span>;</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>}</div>
+</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span> </div>
+<div class="foldopen" id="foldopen00301" data-start="{" data-end="}">
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"><a class="line" href="../../d9/d65/lfu__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  301</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d65/lfu__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>    <a class="code hl_function" href="../../d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run the self test implementation</span></div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>}</div>
+</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_d___node_html"><div class="ttname"><a href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node</a></div><div class="ttdoc">Node for a doubly linked list with data, prev and next pointers.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/daa/lru__cache2_8cpp_source.html#l00042">lru_cache2.cpp:42</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_d___node_html_a0043eb287c54b3b2fb91ce354878a7bd"><div class="ttname"><a href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd">others::Cache::D_Node::next</a></div><div class="ttdeci">D_Node&lt; T &gt; * next</div><div class="ttdoc">next node in the doubly linked list</div><div class="ttdef"><b>Definition</b> <a href="#l00049">lfu_cache.cpp:49</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_d___node_html_a19e954cbb710ea8318bcb6aaef78e2d5"><div class="ttname"><a href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5">others::Cache::D_Node::prev</a></div><div class="ttdeci">D_Node&lt; T &gt; * prev</div><div class="ttdoc">previous node in the doubly linked list</div><div class="ttdef"><b>Definition</b> <a href="#l00048">lfu_cache.cpp:48</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_d___node_html_a8902e7ff872fa3c80fe6ce5f5cf5cc75"><div class="ttname"><a href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75">others::Cache::D_Node::data</a></div><div class="ttdeci">T data</div><div class="ttdoc">data of the node</div><div class="ttdef"><b>Definition</b> <a href="#l00047">lfu_cache.cpp:47</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html"><div class="ttname"><a href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache</a></div><div class="ttdoc">LFUCache.</div><div class="ttdef"><b>Definition</b> <a href="#l00064">lfu_cache.cpp:64</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_a16a25c102554c5653721a5112ef676c9"><div class="ttname"><a href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9">others::Cache::LFUCache::increase_frequency</a></div><div class="ttdeci">void increase_frequency(std::pair&lt; CacheNode&lt; K, V &gt; *, int &gt; &amp;p_node)</div><div class="ttdoc">increase the frequency of node and push it in the respective list.</div><div class="ttdef"><b>Definition</b> <a href="#l00109">lfu_cache.cpp:109</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_a3acc10e6bb67d9d9c4187f625723e6c5"><div class="ttname"><a href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5">others::Cache::LFUCache::_capacity</a></div><div class="ttdeci">int _capacity</div><div class="ttdoc">maximum capacity of the cache</div><div class="ttdef"><b>Definition</b> <a href="#l00071">lfu_cache.cpp:71</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_a58e37d3713f28d36abbb8cdf6c432781"><div class="ttname"><a href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781">others::Cache::LFUCache::get</a></div><div class="ttdeci">V get(K key)</div><div class="ttdoc">get the value of the key-value pair if exists</div><div class="ttdef"><b>Definition</b> <a href="#l00202">lfu_cache.cpp:202</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_a68e1be0a3e0a6478aa35f04000e0e9b0"><div class="ttname"><a href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0">others::Cache::LFUCache::empty</a></div><div class="ttdeci">bool empty() const</div><div class="ttdoc">returns true if the cache is empty, false otherwise.</div><div class="ttdef"><b>Definition</b> <a href="#l00229">lfu_cache.cpp:229</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_a6de844d1589a809239cc07752f311285"><div class="ttname"><a href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285">others::Cache::LFUCache::minFreq</a></div><div class="ttdeci">int minFreq</div><div class="ttdoc">minimum frequency in the cache</div><div class="ttdef"><b>Definition</b> <a href="#l00070">lfu_cache.cpp:70</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_a8857531ecc8ed2e36868e267148eff36"><div class="ttname"><a href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a8857531ecc8ed2e36868e267148eff36">others::Cache::LFUCache::~LFUCache</a></div><div class="ttdeci">~LFUCache()</div><div class="ttdoc">destructs the cache, iterates on the map and deletes every node present in the cache.</div><div class="ttdef"><b>Definition</b> <a href="#l00235">lfu_cache.cpp:235</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_ab3561ab204754295199f9566924f7e69"><div class="ttname"><a href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69">others::Cache::LFUCache::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdoc">pop the last node in the least frequently used linked list</div><div class="ttdef"><b>Definition</b> <a href="#l00149">lfu_cache.cpp:149</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_aba5d59d0f6ab0c0d30a92551ca5a05f2"><div class="ttname"><a href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2">others::Cache::LFUCache::freq_map</a></div><div class="ttdeci">std::unordered_map&lt; int, std::pair&lt; CacheNode&lt; K, V &gt; *, CacheNode&lt; K, V &gt; * &gt; &gt; freq_map</div><div class="ttdoc">maps the frequency to doubly linked list</div><div class="ttdef"><b>Definition</b> <a href="#l00068">lfu_cache.cpp:68</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_ac27c9076377cbed2a2acc45a189fed2c"><div class="ttname"><a href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c">others::Cache::LFUCache::capacity</a></div><div class="ttdeci">int capacity() const</div><div class="ttdoc">Returns the total capacity of the cache.</div><div class="ttdef"><b>Definition</b> <a href="#l00223">lfu_cache.cpp:223</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_ac7684879e2e5da3d8bc5b1699ee42d35"><div class="ttname"><a href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35">others::Cache::LFUCache::node_map</a></div><div class="ttdeci">std::unordered_map&lt; K, std::pair&lt; CacheNode&lt; K, V &gt; *, int &gt; &gt; node_map</div><div class="ttdoc">maps the key to the node address and frequency</div><div class="ttdef"><b>Definition</b> <a href="#l00066">lfu_cache.cpp:66</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_adad4ab43141fb8ba43facd3a71e07047"><div class="ttname"><a href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047">others::Cache::LFUCache::push</a></div><div class="ttdeci">void push(int freq, CacheNode&lt; K, V &gt; *node)</div><div class="ttdoc">push the node at first position in the linked list of given frequency</div><div class="ttdef"><b>Definition</b> <a href="#l00088">lfu_cache.cpp:88</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_adbfb2ef7358423fdf1f49d410f55f195"><div class="ttname"><a href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195">others::Cache::LFUCache::size</a></div><div class="ttdeci">int size() const</div><div class="ttdoc">Returns the number of items present in the cache.</div><div class="ttdef"><b>Definition</b> <a href="#l00217">lfu_cache.cpp:217</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_af6f8e5a66a45436b490dfe015ff8866e"><div class="ttname"><a href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e">others::Cache::LFUCache::put</a></div><div class="ttdeci">void put(K key, V value)</div><div class="ttdoc">upsert a key-value pair</div><div class="ttdef"><b>Definition</b> <a href="#l00174">lfu_cache.cpp:174</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_affd7776c246caa2d0f92fd8616f6e5dc"><div class="ttname"><a href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#affd7776c246caa2d0f92fd8616f6e5dc">others::Cache::LFUCache::LFUCache</a></div><div class="ttdeci">LFUCache(int _capacity)</div><div class="ttdoc">Constructor, Initialize with minFreq and _capacity.</div><div class="ttdef"><b>Definition</b> <a href="#l00078">lfu_cache.cpp:78</a></div></div>
+<div class="ttc" id="alfu__cache_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">self test implementation</div><div class="ttdef"><b>Definition</b> <a href="#l00250">lfu_cache.cpp:250</a></div></div>
+<div class="ttc" id="alfu__cache_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d65/lfu__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition</b> <a href="#l00301">lfu_cache.cpp:301</a></div></div>
+<div class="ttc" id="anamespaceothers_html"><div class="ttname"><a href="../../d0/d6f/namespaceothers.html">others</a></div><div class="ttdoc">for vector</div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../d9/d65/lfu__cache_8cpp.html">lfu_cache.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/d66/group__machine__learning.html b/d9/d66/group__machine__learning.html
index 43d2bd834..099c5032f 100644
--- a/d9/d66/group__machine__learning.html
+++ b/d9/d66/group__machine__learning.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Machine Learning Algorithms</title>
+<title>TheAlgorithms/C++: Machine Learning Algorithms</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -136,11 +153,11 @@ Namespaces</h2></td></tr>
 Functions</h2></td></tr>
 <tr class="memitem:gaf5ce14f026d6d231bef29161bac2b485" id="r_gaf5ce14f026d6d231bef29161bac2b485"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#gaf5ce14f026d6d231bef29161bac2b485">_random</a> (double a, double b)</td></tr>
 <tr class="separator:gaf5ce14f026d6d231bef29161bac2b485"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:gabc90175770bf0d5853c466e14993a08c" id="r_gabc90175770bf0d5853c466e14993a08c"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#gabc90175770bf0d5853c466e14993a08c">save_2d_data</a> (const char *fname, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;X)</td></tr>
+<tr class="memitem:gabc90175770bf0d5853c466e14993a08c" id="r_gabc90175770bf0d5853c466e14993a08c"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#gabc90175770bf0d5853c466e14993a08c">save_2d_data</a> (const char *fname, const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</td></tr>
 <tr class="separator:gabc90175770bf0d5853c466e14993a08c"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ga60f9186ccb682724a8792a2bf81e9b9e" id="r_ga60f9186ccb682724a8792a2bf81e9b9e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ga60f9186ccb682724a8792a2bf81e9b9e">get_min_2d</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;X, double *val, int *x_idx, int *y_idx)</td></tr>
+<tr class="memitem:ga60f9186ccb682724a8792a2bf81e9b9e" id="r_ga60f9186ccb682724a8792a2bf81e9b9e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ga60f9186ccb682724a8792a2bf81e9b9e">get_min_2d</a> (const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X, double *val, int *x_idx, int *y_idx)</td></tr>
 <tr class="separator:ga60f9186ccb682724a8792a2bf81e9b9e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:gae0208548f8b393528e5db01717e88e67" id="r_gae0208548f8b393528e5db01717e88e67"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#gae0208548f8b393528e5db01717e88e67">save_nd_data</a> (const char *fname, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;X)</td></tr>
+<tr class="memitem:gae0208548f8b393528e5db01717e88e67" id="r_gae0208548f8b393528e5db01717e88e67"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#gae0208548f8b393528e5db01717e88e67">save_nd_data</a> (const char *fname, const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;X)</td></tr>
 <tr class="separator:gae0208548f8b393528e5db01717e88e67"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
@@ -149,6 +166,39 @@ Variables</h2></td></tr>
 <tr class="separator:ga5118e5cbc4f0886e27b3a7a2544dded1"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<h2 class="groupheader">Macro Definition Documentation</h2>
+<a id="ga525335710b53cb064ca56b936120431e" name="ga525335710b53cb064ca56b936120431e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ga525335710b53cb064ca56b936120431e">&#9670;&#160;</a></span>_USE_MATH_DEFINES <span class="overload">[1/2]</span></h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">#define _USE_MATH_DEFINES</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00026">26</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ga525335710b53cb064ca56b936120431e" name="ga525335710b53cb064ca56b936120431e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ga525335710b53cb064ca56b936120431e">&#9670;&#160;</a></span>_USE_MATH_DEFINES <span class="overload">[2/2]</span></h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">#define _USE_MATH_DEFINES</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00021">21</a> of file <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html">kohonen_som_trace.cpp</a>.</p>
+
+</div>
+</div>
 <h2 class="groupheader">Function Documentation</h2>
 <a id="gaf5ce14f026d6d231bef29161bac2b485" name="gaf5ce14f026d6d231bef29161bac2b485"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#gaf5ce14f026d6d231bef29161bac2b485">&#9670;&#160;</a></span>_random()</h2>
@@ -182,16 +232,12 @@ Variables</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>random number in the range \([a,b]\) </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   53</span>                                   {</div>
-<div class="line"><span class="lineno">   54</span>    <span class="keywordflow">return</span> ((b - a) * (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 100) / 100.f) + a;</div>
-<div class="line"><span class="lineno">   55</span>}</div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-</div><!-- 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="../../d9/d66/group__machine__learning_gaf5ce14f026d6d231bef29161bac2b485_cgraph.svg" width="203" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   53</span>                                   {</div>
+<div class="line"><span class="lineno">   54</span>    <span class="keywordflow">return</span> ((b - a) * (std::rand() % 100) / 100.f) + a;</div>
+<div class="line"><span class="lineno">   55</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ga60f9186ccb682724a8792a2bf81e9b9e" name="ga60f9186ccb682724a8792a2bf81e9b9e"></a>
@@ -203,7 +249,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void get_min_2d </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -232,14 +278,16 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00105">105</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  106</span>                                        {</div>
 <div class="line"><span class="lineno">  107</span>    val[0] = INFINITY;  <span class="comment">// initial min value</span></div>
-<div class="line"><span class="lineno">  108</span>    <span class="keywordtype">size_t</span> N = X.<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">  108</span>    <span class="keywordtype">size_t</span> N = X.size();</div>
 <div class="line"><span class="lineno">  109</span> </div>
 <div class="line"><span class="lineno">  110</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N; i++) {  <span class="comment">// traverse each x-index</span></div>
-<div class="line"><span class="lineno">  111</span>        <span class="keyword">auto</span> result = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min_element.html">std::min_element</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(X[i]), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(X[i]));</div>
+<div class="line"><span class="lineno">  111</span>        <span class="keyword">auto</span> result = std::min_element(std::begin(X[i]), std::end(X[i]));</div>
 <div class="line"><span class="lineno">  112</span>        <span class="keywordtype">double</span> d_min = *result;</div>
-<div class="line"><span class="lineno">  113</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/ptrdiff_t.html">std::ptrdiff_t</a> j = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">std::distance</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(X[i]), result);</div>
+<div class="line"><span class="lineno">  113</span>        std::ptrdiff_t j = std::distance(std::begin(X[i]), result);</div>
 <div class="line"><span class="lineno">  114</span> </div>
 <div class="line"><span class="lineno">  115</span>        <span class="keywordflow">if</span> (d_min &lt; val[0]) {  <span class="comment">// if a lower value is found</span></div>
 <div class="line"><span class="lineno">  116</span>                               <span class="comment">// save the value and its index</span></div>
@@ -249,18 +297,7 @@ Here is the call graph for this function:</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>}</div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="adistance_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/distance.html">std::distance</a></div><div class="ttdeci">T distance(T... args)</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="amin_element_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min_element.html">std::min_element</a></div><div class="ttdeci">T min_element(T... args)</div></div>
-<div class="ttc" id="aptrdiff_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/ptrdiff_t.html">std::ptrdiff_t</a></div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-</div><!-- 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="../../d9/d66/group__machine__learning_ga60f9186ccb682724a8792a2bf81e9b9e_cgraph.svg" width="268" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="gabc90175770bf0d5853c466e14993a08c" name="gabc90175770bf0d5853c466e14993a08c"></a>
@@ -277,7 +314,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -292,16 +329,18 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>0 if all ok </dd>
 <dd>
 -1 if file creation failed </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html#l00065">65</a> of file <a class="el" href="../../d4/def/kohonen__som__topology_8cpp_source.html">kohonen_som_topology.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   66</span>                                                          {</div>
-<div class="line"><span class="lineno">   67</span>    <span class="keywordtype">size_t</span> num_points = X.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();       <span class="comment">// number of rows</span></div>
-<div class="line"><span class="lineno">   68</span>    <span class="keywordtype">size_t</span> num_features = X[0].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();  <span class="comment">// number of columns</span></div>
+<div class="line"><span class="lineno">   67</span>    <span class="keywordtype">size_t</span> num_points = X.size();       <span class="comment">// number of rows</span></div>
+<div class="line"><span class="lineno">   68</span>    <span class="keywordtype">size_t</span> num_features = X[0].size();  <span class="comment">// number of columns</span></div>
 <div class="line"><span class="lineno">   69</span> </div>
-<div class="line"><span class="lineno">   70</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a> fp;</div>
-<div class="line"><span class="lineno">   71</span>    fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html">open</a>(fname);</div>
-<div class="line"><span class="lineno">   72</span>    <span class="keywordflow">if</span> (!fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">is_open</a>()) {</div>
+<div class="line"><span class="lineno">   70</span>    std::ofstream fp;</div>
+<div class="line"><span class="lineno">   71</span>    fp.open(fname);</div>
+<div class="line"><span class="lineno">   72</span>    <span class="keywordflow">if</span> (!fp.is_open()) {</div>
 <div class="line"><span class="lineno">   73</span>        <span class="comment">// error with opening file to write</span></div>
-<div class="line"><span class="lineno">   74</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Error opening file &quot;</span> &lt;&lt; fname &lt;&lt; <span class="stringliteral">&quot;: &quot;</span></div>
-<div class="line"><span class="lineno">   75</span>                  &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strerror.html">std::strerror</a>(errno) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   74</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Error opening file &quot;</span> &lt;&lt; fname &lt;&lt; <span class="stringliteral">&quot;: &quot;</span></div>
+<div class="line"><span class="lineno">   75</span>                  &lt;&lt; std::strerror(errno) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   76</span>        <span class="keywordflow">return</span> -1;</div>
 <div class="line"><span class="lineno">   77</span>    }</div>
 <div class="line"><span class="lineno">   78</span> </div>
@@ -319,21 +358,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   90</span>        }</div>
 <div class="line"><span class="lineno">   91</span>    }</div>
 <div class="line"><span class="lineno">   92</span> </div>
-<div class="line"><span class="lineno">   93</span>    fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html">close</a>();</div>
+<div class="line"><span class="lineno">   93</span>    fp.close();</div>
 <div class="line"><span class="lineno">   94</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   95</span>}</div>
-<div class="ttc" id="abasic_ofstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div></div>
-<div class="ttc" id="aclose_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html">std::ofstream::close</a></div><div class="ttdeci">T close(T... args)</div></div>
-<div class="ttc" id="ais_open_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">std::ofstream::is_open</a></div><div class="ttdeci">T is_open(T... args)</div></div>
-<div class="ttc" id="aopen_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html">std::ofstream::open</a></div><div class="ttdeci">T open(T... args)</div></div>
-<div class="ttc" id="astrerror_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strerror.html">std::strerror</a></div><div class="ttdeci">T strerror(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d66/group__machine__learning_gabc90175770bf0d5853c466e14993a08c_cgraph.svg" width="312" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="gae0208548f8b393528e5db01717e88e67" name="gae0208548f8b393528e5db01717e88e67"></a>
@@ -350,7 +378,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -365,15 +393,17 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>0 if all ok </dd>
 <dd>
 -1 if file creation failed </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d9/d49/kohonen__som__trace_8cpp_source.html">kohonen_som_trace.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   59</span>                                                          {</div>
-<div class="line"><span class="lineno">   60</span>    <span class="keywordtype">size_t</span> num_points = X.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();       <span class="comment">// number of rows</span></div>
-<div class="line"><span class="lineno">   61</span>    <span class="keywordtype">size_t</span> num_features = X[0].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();  <span class="comment">// number of columns</span></div>
+<div class="line"><span class="lineno">   60</span>    <span class="keywordtype">size_t</span> num_points = X.size();       <span class="comment">// number of rows</span></div>
+<div class="line"><span class="lineno">   61</span>    <span class="keywordtype">size_t</span> num_features = X[0].size();  <span class="comment">// number of columns</span></div>
 <div class="line"><span class="lineno">   62</span> </div>
-<div class="line"><span class="lineno">   63</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a> fp;</div>
-<div class="line"><span class="lineno">   64</span>    fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html">open</a>(fname);</div>
-<div class="line"><span class="lineno">   65</span>    <span class="keywordflow">if</span> (!fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">is_open</a>()) {</div>
+<div class="line"><span class="lineno">   63</span>    std::ofstream fp;</div>
+<div class="line"><span class="lineno">   64</span>    fp.open(fname);</div>
+<div class="line"><span class="lineno">   65</span>    <span class="keywordflow">if</span> (!fp.is_open()) {</div>
 <div class="line"><span class="lineno">   66</span>        <span class="comment">// error with opening file to write</span></div>
-<div class="line"><span class="lineno">   67</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Error opening file &quot;</span> &lt;&lt; fname &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   67</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Error opening file &quot;</span> &lt;&lt; fname &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   68</span>        <span class="keywordflow">return</span> -1;</div>
 <div class="line"><span class="lineno">   69</span>    }</div>
 <div class="line"><span class="lineno">   70</span> </div>
@@ -391,15 +421,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   82</span>        }</div>
 <div class="line"><span class="lineno">   83</span>    }</div>
 <div class="line"><span class="lineno">   84</span> </div>
-<div class="line"><span class="lineno">   85</span>    fp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html">close</a>();</div>
+<div class="line"><span class="lineno">   85</span>    fp.close();</div>
 <div class="line"><span class="lineno">   86</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   87</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d66/group__machine__learning_gae0208548f8b393528e5db01717e88e67_cgraph.svg" width="312" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Variable Documentation</h2>
@@ -424,6 +449,8 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 <p>Maximum number of iterations to learn </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../d5/db0/adaline__learning_8cpp_source.html">adaline_learning.cpp</a>.</p>
+
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/d66/group__machine__learning_ga60f9186ccb682724a8792a2bf81e9b9e_cgraph.map b/d9/d66/group__machine__learning_ga60f9186ccb682724a8792a2bf81e9b9e_cgraph.map
deleted file mode 100644
index 8bcefe58b..000000000
--- a/d9/d66/group__machine__learning_ga60f9186ccb682724a8792a2bf81e9b9e_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="get_min_2d" name="get_min_2d">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,80,94,106"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="163,5,242,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="72,77,140,40,151,35,153,40,143,45,74,82"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/distance.html#" title=" " alt="" coords="154,55,250,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="94,83,139,75,140,81,95,88"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="168,104,236,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="95,97,153,106,152,112,94,102"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min_element.html#" title=" " alt="" coords="142,153,263,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="75,104,143,140,153,145,151,149,140,145,72,108"/>
-</map>
diff --git a/d9/d66/group__machine__learning_ga60f9186ccb682724a8792a2bf81e9b9e_cgraph.md5 b/d9/d66/group__machine__learning_ga60f9186ccb682724a8792a2bf81e9b9e_cgraph.md5
deleted file mode 100644
index 3ba742091..000000000
--- a/d9/d66/group__machine__learning_ga60f9186ccb682724a8792a2bf81e9b9e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-23593b8f6c50add3f5754c44b15661ee
\ No newline at end of file
diff --git a/d9/d66/group__machine__learning_ga60f9186ccb682724a8792a2bf81e9b9e_cgraph.svg b/d9/d66/group__machine__learning_ga60f9186ccb682724a8792a2bf81e9b9e_cgraph.svg
deleted file mode 100644
index 87edb7a76..000000000
--- a/d9/d66/group__machine__learning_ga60f9186ccb682724a8792a2bf81e9b9e_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: get_min_2d Pages: 1 -->
-<svg width="201pt" height="138pt"
- viewBox="0.00 0.00 201.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>get_min_2d</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="66.25,-74.25 0,-74.25 0,-55 66.25,-55 66.25,-74.25"/>
-<text text-anchor="middle" x="33.12" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_min_2d</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.12,-130.25 118.38,-130.25 118.38,-111 177.12,-111 177.12,-130.25"/>
-<text text-anchor="middle" x="147.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M50.89,-74.75C64.5,-82.77 84.29,-94.03 102.25,-102.62 104.81,-103.85 107.49,-105.07 110.19,-106.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.66,-109.42 119.24,-110.1 111.39,-102.98 108.66,-109.42"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="183.88,-93.25 111.62,-93.25 111.62,-74 183.88,-74 183.88,-93.25"/>
-<text text-anchor="middle" x="147.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.7,-70.12C77.23,-71.9 89.1,-73.9 100.43,-75.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.56,-79.21 110,-77.43 100.72,-72.31 99.56,-79.21"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173.38,-56.25 122.12,-56.25 122.12,-37 173.38,-37 173.38,-56.25"/>
-<text text-anchor="middle" x="147.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.7,-59.42C80.4,-57.23 96.4,-54.67 110.48,-52.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.94,-55.89 120.27,-50.86 109.84,-48.98 110.94,-55.89"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.25,-19.25 102.25,-19.25 102.25,0 193.25,0 193.25,-19.25"/>
-<text text-anchor="middle" x="147.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M51.21,-54.65C64.82,-46.87 84.48,-36.01 102.25,-27.62 104.82,-26.41 107.5,-25.2 110.21,-24.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.41,-27.31 119.26,-20.19 108.68,-20.86 111.41,-27.31"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d66/group__machine__learning_ga60f9186ccb682724a8792a2bf81e9b9e_cgraph_org.svg b/d9/d66/group__machine__learning_ga60f9186ccb682724a8792a2bf81e9b9e_cgraph_org.svg
deleted file mode 100644
index e38e794ac..000000000
--- a/d9/d66/group__machine__learning_ga60f9186ccb682724a8792a2bf81e9b9e_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: get_min_2d Pages: 1 -->
-<svg width="201pt" height="138pt"
- viewBox="0.00 0.00 201.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>get_min_2d</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="66.25,-74.25 0,-74.25 0,-55 66.25,-55 66.25,-74.25"/>
-<text text-anchor="middle" x="33.12" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_min_2d</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.12,-130.25 118.38,-130.25 118.38,-111 177.12,-111 177.12,-130.25"/>
-<text text-anchor="middle" x="147.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M50.89,-74.75C64.5,-82.77 84.29,-94.03 102.25,-102.62 104.81,-103.85 107.49,-105.07 110.19,-106.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.66,-109.42 119.24,-110.1 111.39,-102.98 108.66,-109.42"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/distance.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="183.88,-93.25 111.62,-93.25 111.62,-74 183.88,-74 183.88,-93.25"/>
-<text text-anchor="middle" x="147.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::distance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.7,-70.12C77.23,-71.9 89.1,-73.9 100.43,-75.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.56,-79.21 110,-77.43 100.72,-72.31 99.56,-79.21"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173.38,-56.25 122.12,-56.25 122.12,-37 173.38,-37 173.38,-56.25"/>
-<text text-anchor="middle" x="147.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.7,-59.42C80.4,-57.23 96.4,-54.67 110.48,-52.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.94,-55.89 120.27,-50.86 109.84,-48.98 110.94,-55.89"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.25,-19.25 102.25,-19.25 102.25,0 193.25,0 193.25,-19.25"/>
-<text text-anchor="middle" x="147.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M51.21,-54.65C64.82,-46.87 84.48,-36.01 102.25,-27.62 104.82,-26.41 107.5,-25.2 110.21,-24.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.41,-27.31 119.26,-20.19 108.68,-20.86 111.41,-27.31"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d66/group__machine__learning_gabc90175770bf0d5853c466e14993a08c_cgraph.map b/d9/d66/group__machine__learning_gabc90175770bf0d5853c466e14993a08c_cgraph.map
deleted file mode 100644
index d95f798e4..000000000
--- a/d9/d66/group__machine__learning_gabc90175770bf0d5853c466e14993a08c_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="save_2d_data" name="save_2d_data">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,80,108,106"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="163,5,300,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="80,77,155,40,169,34,171,39,157,45,82,82"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="156,55,307,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="108,83,140,78,140,83,108,88"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="164,104,298,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="108,97,149,103,149,108,108,102"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/strerror.html#" title=" " alt="" coords="187,153,276,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="83,104,157,140,173,146,172,151,155,145,81,109"/>
-</map>
diff --git a/d9/d66/group__machine__learning_gabc90175770bf0d5853c466e14993a08c_cgraph.md5 b/d9/d66/group__machine__learning_gabc90175770bf0d5853c466e14993a08c_cgraph.md5
deleted file mode 100644
index 1c7772232..000000000
--- a/d9/d66/group__machine__learning_gabc90175770bf0d5853c466e14993a08c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6b0b738779bd2ef2ce664cfb36a2a0c0
\ No newline at end of file
diff --git a/d9/d66/group__machine__learning_gabc90175770bf0d5853c466e14993a08c_cgraph.svg b/d9/d66/group__machine__learning_gabc90175770bf0d5853c466e14993a08c_cgraph.svg
deleted file mode 100644
index 694048a64..000000000
--- a/d9/d66/group__machine__learning_gabc90175770bf0d5853c466e14993a08c_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: save_2d_data Pages: 1 -->
-<svg width="234pt" height="138pt"
- viewBox="0.00 0.00 234.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>save_2d_data</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="76.75,-74.25 0,-74.25 0,-55 76.75,-55 76.75,-74.25"/>
-<text text-anchor="middle" x="38.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_2d_data</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221,-130.25 118,-130.25 118,-111 221,-111 221,-130.25"/>
-<text text-anchor="middle" x="169.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M56.78,-74.68C71.4,-82.87 93.02,-94.4 112.75,-102.62 116.28,-104.1 119.98,-105.53 123.72,-106.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.25,-110.09 132.84,-110.06 124.54,-103.47 122.25,-110.09"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.25,-93.25 112.75,-93.25 112.75,-74 226.25,-74 226.25,-93.25"/>
-<text text-anchor="middle" x="169.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.07,-70.17C84.64,-71.29 92.82,-72.49 101.06,-73.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.38,-77.14 110.78,-75.13 101.4,-70.21 100.38,-77.14"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.88,-56.25 119.12,-56.25 119.12,-37 219.88,-37 219.88,-56.25"/>
-<text text-anchor="middle" x="169.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.07,-59.37C86.69,-58.03 97.28,-56.55 107.74,-55.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.06,-58.58 117.48,-53.74 107.09,-51.65 108.06,-58.58"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strerror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="202.62,-19.25 136.38,-19.25 136.38,0 202.62,0 202.62,-19.25"/>
-<text text-anchor="middle" x="169.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strerror</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M57.4,-54.55C72.04,-46.61 93.35,-35.59 112.75,-27.62 116.81,-25.96 121.1,-24.34 125.4,-22.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.29,-26.19 134.63,-19.65 124.03,-19.57 126.29,-26.19"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d66/group__machine__learning_gabc90175770bf0d5853c466e14993a08c_cgraph_org.svg b/d9/d66/group__machine__learning_gabc90175770bf0d5853c466e14993a08c_cgraph_org.svg
deleted file mode 100644
index 63f9239eb..000000000
--- a/d9/d66/group__machine__learning_gabc90175770bf0d5853c466e14993a08c_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: save_2d_data Pages: 1 -->
-<svg width="234pt" height="138pt"
- viewBox="0.00 0.00 234.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>save_2d_data</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="76.75,-74.25 0,-74.25 0,-55 76.75,-55 76.75,-74.25"/>
-<text text-anchor="middle" x="38.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_2d_data</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221,-130.25 118,-130.25 118,-111 221,-111 221,-130.25"/>
-<text text-anchor="middle" x="169.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M56.78,-74.68C71.4,-82.87 93.02,-94.4 112.75,-102.62 116.28,-104.1 119.98,-105.53 123.72,-106.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.25,-110.09 132.84,-110.06 124.54,-103.47 122.25,-110.09"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.25,-93.25 112.75,-93.25 112.75,-74 226.25,-74 226.25,-93.25"/>
-<text text-anchor="middle" x="169.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.07,-70.17C84.64,-71.29 92.82,-72.49 101.06,-73.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.38,-77.14 110.78,-75.13 101.4,-70.21 100.38,-77.14"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.88,-56.25 119.12,-56.25 119.12,-37 219.88,-37 219.88,-56.25"/>
-<text text-anchor="middle" x="169.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.07,-59.37C86.69,-58.03 97.28,-56.55 107.74,-55.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.06,-58.58 117.48,-53.74 107.09,-51.65 108.06,-58.58"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/strerror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="202.62,-19.25 136.38,-19.25 136.38,0 202.62,0 202.62,-19.25"/>
-<text text-anchor="middle" x="169.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::strerror</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M57.4,-54.55C72.04,-46.61 93.35,-35.59 112.75,-27.62 116.81,-25.96 121.1,-24.34 125.4,-22.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.29,-26.19 134.63,-19.65 124.03,-19.57 126.29,-26.19"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d66/group__machine__learning_gae0208548f8b393528e5db01717e88e67_cgraph.map b/d9/d66/group__machine__learning_gae0208548f8b393528e5db01717e88e67_cgraph.map
deleted file mode 100644
index ef4dfd0b9..000000000
--- a/d9/d66/group__machine__learning_gae0208548f8b393528e5db01717e88e67_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="save_nd_data" name="save_nd_data">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,108,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="163,5,300,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="104,51,168,33,169,38,106,57"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="156,55,307,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="108,65,140,65,140,70,108,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="164,104,298,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="106,78,169,97,168,102,104,84"/>
-</map>
diff --git a/d9/d66/group__machine__learning_gae0208548f8b393528e5db01717e88e67_cgraph.md5 b/d9/d66/group__machine__learning_gae0208548f8b393528e5db01717e88e67_cgraph.md5
deleted file mode 100644
index d1eafb87c..000000000
--- a/d9/d66/group__machine__learning_gae0208548f8b393528e5db01717e88e67_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f888672822fa70ef785ca1531af7cfa8
\ No newline at end of file
diff --git a/d9/d66/group__machine__learning_gae0208548f8b393528e5db01717e88e67_cgraph.svg b/d9/d66/group__machine__learning_gae0208548f8b393528e5db01717e88e67_cgraph.svg
deleted file mode 100644
index 61cd18a41..000000000
--- a/d9/d66/group__machine__learning_gae0208548f8b393528e5db01717e88e67_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: save_nd_data Pages: 1 -->
-<svg width="234pt" height="101pt"
- viewBox="0.00 0.00 234.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>save_nd_data</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="76.75,-56.25 0,-56.25 0,-37 76.75,-37 76.75,-56.25"/>
-<text text-anchor="middle" x="38.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_nd_data</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221,-93.25 118,-93.25 118,-74 221,-74 221,-93.25"/>
-<text text-anchor="middle" x="169.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.66,-56.74C89.32,-60.94 106.54,-65.87 122.19,-70.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="121.23,-73.72 131.8,-73.11 123.15,-66.99 121.23,-73.72"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.25,-56.25 112.75,-56.25 112.75,-37 226.25,-37 226.25,-56.25"/>
-<text text-anchor="middle" x="169.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.07,-46.62C84.56,-46.62 92.63,-46.62 100.78,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.76,-50.13 110.76,-46.63 100.76,-43.13 100.76,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.88,-19.25 119.12,-19.25 119.12,0 219.88,0 219.88,-19.25"/>
-<text text-anchor="middle" x="169.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.66,-36.51C89.32,-32.31 106.54,-27.38 122.19,-22.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.15,-26.26 131.8,-20.14 121.23,-19.53 123.15,-26.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d66/group__machine__learning_gae0208548f8b393528e5db01717e88e67_cgraph_org.svg b/d9/d66/group__machine__learning_gae0208548f8b393528e5db01717e88e67_cgraph_org.svg
deleted file mode 100644
index ba3d011d7..000000000
--- a/d9/d66/group__machine__learning_gae0208548f8b393528e5db01717e88e67_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: save_nd_data Pages: 1 -->
-<svg width="234pt" height="101pt"
- viewBox="0.00 0.00 234.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>save_nd_data</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="76.75,-56.25 0,-56.25 0,-37 76.75,-37 76.75,-56.25"/>
-<text text-anchor="middle" x="38.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_nd_data</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221,-93.25 118,-93.25 118,-74 221,-74 221,-93.25"/>
-<text text-anchor="middle" x="169.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.66,-56.74C89.32,-60.94 106.54,-65.87 122.19,-70.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="121.23,-73.72 131.8,-73.11 123.15,-66.99 121.23,-73.72"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.25,-56.25 112.75,-56.25 112.75,-37 226.25,-37 226.25,-56.25"/>
-<text text-anchor="middle" x="169.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.07,-46.62C84.56,-46.62 92.63,-46.62 100.78,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.76,-50.13 110.76,-46.63 100.76,-43.13 100.76,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.88,-19.25 119.12,-19.25 119.12,0 219.88,0 219.88,-19.25"/>
-<text text-anchor="middle" x="169.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.66,-36.51C89.32,-32.31 106.54,-27.38 122.19,-22.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.15,-26.26 131.8,-20.14 121.23,-19.53 123.15,-26.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d66/group__machine__learning_gaf5ce14f026d6d231bef29161bac2b485_cgraph.map b/d9/d66/group__machine__learning_gaf5ce14f026d6d231bef29161bac2b485_cgraph.map
deleted file mode 100644
index ca40de314..000000000
--- a/d9/d66/group__machine__learning_gaf5ce14f026d6d231bef29161bac2b485_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="_random" name="_random">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,77,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="125,5,197,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="77,16,109,16,109,21,77,21"/>
-</map>
diff --git a/d9/d66/group__machine__learning_gaf5ce14f026d6d231bef29161bac2b485_cgraph.md5 b/d9/d66/group__machine__learning_gaf5ce14f026d6d231bef29161bac2b485_cgraph.md5
deleted file mode 100644
index b9f58c43f..000000000
--- a/d9/d66/group__machine__learning_gaf5ce14f026d6d231bef29161bac2b485_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d70e8a4be5dea77e98acc8099b037caf
\ No newline at end of file
diff --git a/d9/d66/group__machine__learning_gaf5ce14f026d6d231bef29161bac2b485_cgraph.svg b/d9/d66/group__machine__learning_gaf5ce14f026d6d231bef29161bac2b485_cgraph.svg
deleted file mode 100644
index 6ffa667c1..000000000
--- a/d9/d66/group__machine__learning_gaf5ce14f026d6d231bef29161bac2b485_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: _random Pages: 1 -->
-<svg width="152pt" height="27pt"
- viewBox="0.00 0.00 151.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>_random</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
-<text text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.75,-19.25 89.5,-19.25 89.5,0 143.75,0 143.75,-19.25"/>
-<text text-anchor="middle" x="116.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.64,-9.62C61.12,-9.62 69.45,-9.62 77.51,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.49,-13.13 87.49,-9.63 77.49,-6.13 77.49,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d66/group__machine__learning_gaf5ce14f026d6d231bef29161bac2b485_cgraph_org.svg b/d9/d66/group__machine__learning_gaf5ce14f026d6d231bef29161bac2b485_cgraph_org.svg
deleted file mode 100644
index d7ccee0e0..000000000
--- a/d9/d66/group__machine__learning_gaf5ce14f026d6d231bef29161bac2b485_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: _random Pages: 1 -->
-<svg width="152pt" height="27pt"
- viewBox="0.00 0.00 151.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>_random</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
-<text text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.75,-19.25 89.5,-19.25 89.5,0 143.75,0 143.75,-19.25"/>
-<text text-anchor="middle" x="116.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.64,-9.62C61.12,-9.62 69.45,-9.62 77.51,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.49,-13.13 87.49,-9.63 77.49,-6.13 77.49,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d69/median__search_8cpp.html b/d9/d69/median__search_8cpp.html
index 36138e6f6..9a28085b8 100644
--- a/d9/d69/median__search_8cpp.html
+++ b/d9/d69/median__search_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: search/median_search.cpp File Reference</title>
+<title>TheAlgorithms/C++: search/median_search.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for median_search.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d89/median__search_8cpp__incl.svg" width="351" height="111"><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">
+</div>
+<p><a href="../../d9/d69/median__search_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dca/namespacesearch.html">search</a></td></tr>
@@ -134,7 +153,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a868847218f694e78bf433a0ff7648bae" id="r_a868847218f694e78bf433a0ff7648bae"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a868847218f694e78bf433a0ff7648bae">search::median_search::median_of_medians</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;A, const int &amp;idx)</td></tr>
+<tr class="memitem:a868847218f694e78bf433a0ff7648bae" id="r_a868847218f694e78bf433a0ff7648bae"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a868847218f694e78bf433a0ff7648bae">search::median_search::median_of_medians</a> (const std::vector&lt; int &gt; &amp;A, const int &amp;idx)</td></tr>
 <tr class="separator:a868847218f694e78bf433a0ff7648bae"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae1a3968e7947464bee7714f6d43b7002" id="r_ae1a3968e7947464bee7714f6d43b7002"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae1a3968e7947464bee7714f6d43b7002">test</a> ()</td></tr>
 <tr class="separator:ae1a3968e7947464bee7714f6d43b7002"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -149,6 +168,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd>Unknown author </dd>
 <dd>
 <a href="https://github.com/Rp-sushil" target="_blank">Sushil Kumar</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/d69/median__search_8cpp_source.html">median_search.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -165,44 +186,38 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d69/median__search_8cpp_source.html#l00128">128</a> of file <a class="el" href="../../d9/d69/median__search_8cpp_source.html">median_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  129</span>{</div>
 <div class="line"><span class="lineno">  130</span>    <a class="code hl_function" href="#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
 <div class="line"><span class="lineno">  131</span>    <span class="keywordtype">int</span> n = 0;</div>
-<div class="line"><span class="lineno">  132</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter Size of Array: &quot;</span>;</div>
-<div class="line"><span class="lineno">  133</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;</div>
-<div class="line"><span class="lineno">  134</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> a(n);</div>
-<div class="line"><span class="lineno">  135</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter Array: &quot;</span>;</div>
+<div class="line"><span class="lineno">  132</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter Size of Array: &quot;</span>;</div>
+<div class="line"><span class="lineno">  133</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><span class="lineno">  134</span>    std::vector&lt;int&gt; a(n);</div>
+<div class="line"><span class="lineno">  135</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter Array: &quot;</span>;</div>
 <div class="line"><span class="lineno">  136</span>    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; n; i++){</div>
-<div class="line"><span class="lineno">  137</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; a[i];</div>
+<div class="line"><span class="lineno">  137</span>        std::cin &gt;&gt; a[i];</div>
 <div class="line"><span class="lineno">  138</span>    }</div>
-<div class="line"><span class="lineno">  139</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Median: &quot;</span>;            <span class="comment">// Median defination: https://en.wikipedia.org/wiki/Median</span></div>
+<div class="line"><span class="lineno">  139</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Median: &quot;</span>;            <span class="comment">// Median defination: https://en.wikipedia.org/wiki/Median</span></div>
 <div class="line"><span class="lineno">  140</span>    <span class="keywordtype">int</span> x = <a class="code hl_function" href="#a868847218f694e78bf433a0ff7648bae">search::median_search::median_of_medians</a>(a,  (n - 1) / 2);</div>
 <div class="line"><span class="lineno">  141</span>    <span class="keywordflow">if</span>(n % 2 == 0){</div>
 <div class="line"><span class="lineno">  142</span>        <span class="keywordtype">int</span> y = <a class="code hl_function" href="#a868847218f694e78bf433a0ff7648bae">search::median_search::median_of_medians</a>(a, n / 2);</div>
-<div class="line"><span class="lineno">  143</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; (float(x) + float(y))/2.0;</div>
+<div class="line"><span class="lineno">  143</span>        std::cout &lt;&lt; (float(x) + float(y))/2.0;</div>
 <div class="line"><span class="lineno">  144</span>    }</div>
 <div class="line"><span class="lineno">  145</span>    <span class="keywordflow">else</span>{</div>
-<div class="line"><span class="lineno">  146</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; x;</div>
+<div class="line"><span class="lineno">  146</span>        std::cout &lt;&lt; x;</div>
 <div class="line"><span class="lineno">  147</span>    }</div>
-<div class="line"><span class="lineno">  148</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTo find i-th smallest element &quot;</span>;</div>
-<div class="line"><span class="lineno">  149</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter i: &quot;</span>;</div>
+<div class="line"><span class="lineno">  148</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTo find i-th smallest element &quot;</span>;</div>
+<div class="line"><span class="lineno">  149</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter i: &quot;</span>;</div>
 <div class="line"><span class="lineno">  150</span>    <span class="keywordtype">int</span> idx = 0;</div>
-<div class="line"><span class="lineno">  151</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; idx;</div>
+<div class="line"><span class="lineno">  151</span>    std::cin &gt;&gt; idx;</div>
 <div class="line"><span class="lineno">  152</span>    idx--;</div>
-<div class="line"><span class="lineno">  153</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; idx + 1&lt;&lt; <span class="stringliteral">&quot;-th smallest element: &quot;</span> &lt;&lt; <a class="code hl_function" href="#a868847218f694e78bf433a0ff7648bae">search::median_search::median_of_medians</a>(a, idx) &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><span class="lineno">  153</span>    std::cout &lt;&lt; idx + 1&lt;&lt; <span class="stringliteral">&quot;-th smallest element: &quot;</span> &lt;&lt; <a class="code hl_function" href="#a868847218f694e78bf433a0ff7648bae">search::median_search::median_of_medians</a>(a, idx) &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
 <div class="line"><span class="lineno">  154</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  155</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="amedian__search_8cpp_html_a868847218f694e78bf433a0ff7648bae"><div class="ttname"><a href="#a868847218f694e78bf433a0ff7648bae">search::median_search::median_of_medians</a></div><div class="ttdeci">int median_of_medians(const std::vector&lt; int &gt; &amp;A, const int &amp;idx)</div><div class="ttdef"><b>Definition</b> median_search.cpp:62</div></div>
-<div class="ttc" id="amedian__search_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> median_search.cpp:107</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amedian__search_8cpp_html_a868847218f694e78bf433a0ff7648bae"><div class="ttname"><a href="#a868847218f694e78bf433a0ff7648bae">search::median_search::median_of_medians</a></div><div class="ttdeci">int median_of_medians(const std::vector&lt; int &gt; &amp;A, const int &amp;idx)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d69/median__search_8cpp_source.html#l00062">median_search.cpp:62</a></div></div>
+<div class="ttc" id="amedian__search_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d69/median__search_8cpp_source.html#l00107">median_search.cpp:107</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a868847218f694e78bf433a0ff7648bae" name="a868847218f694e78bf433a0ff7648bae"></a>
@@ -214,7 +229,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">int search::median_search::median_of_medians </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -231,35 +246,37 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>corresponding element which we want to search. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d69/median__search_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../d9/d69/median__search_8cpp_source.html">median_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>                                                                {</div>
 <div class="line"><span class="lineno">   63</span>    <span class="keywordtype">int</span> pivot = 0;                  <span class="comment">// initialized with zero</span></div>
-<div class="line"><span class="lineno">   64</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> a(A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>());</div>
-<div class="line"><span class="lineno">   65</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> m;</div>
+<div class="line"><span class="lineno">   64</span>    std::vector&lt;int&gt; a(A.begin(), A.end());</div>
+<div class="line"><span class="lineno">   65</span>    std::vector&lt;int&gt; m;</div>
 <div class="line"><span class="lineno">   66</span>    <span class="keywordtype">int</span> r = a.size();</div>
 <div class="line"><span class="lineno">   67</span>    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; r; i += 5){</div>
-<div class="line"><span class="lineno">   68</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a>(a.begin() + i, a.begin() + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(r, i + 5));</div>
-<div class="line"><span class="lineno">   69</span>        <span class="keywordtype">int</span> mid = (i + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(r, i + 5)) / 2;</div>
-<div class="line"><span class="lineno">   70</span>        m.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(a[mid]);</div>
+<div class="line"><span class="lineno">   68</span>        std::sort(a.begin() + i, a.begin() + std::min(r, i + 5));</div>
+<div class="line"><span class="lineno">   69</span>        <span class="keywordtype">int</span> mid = (i + std::min(r, i + 5)) / 2;</div>
+<div class="line"><span class="lineno">   70</span>        m.push_back(a[mid]);</div>
 <div class="line"><span class="lineno">   71</span>    }</div>
-<div class="line"><span class="lineno">   72</span>    <span class="keywordtype">int</span> sz = int(m.<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>    <span class="keywordtype">int</span> sz = int(m.size());</div>
 <div class="line"><span class="lineno">   73</span>    <span class="keywordflow">if</span>(sz &lt;= 5){</div>
-<div class="line"><span class="lineno">   74</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a>(m.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), m.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>());</div>
+<div class="line"><span class="lineno">   74</span>        std::sort(m.begin(), m.end());</div>
 <div class="line"><span class="lineno">   75</span>        pivot = m[(sz- 1) / 2];</div>
 <div class="line"><span class="lineno">   76</span>    }</div>
 <div class="line"><span class="lineno">   77</span>    <span class="keywordflow">else</span>{</div>
 <div class="line"><span class="lineno">   78</span>        pivot = <a class="code hl_function" href="#a868847218f694e78bf433a0ff7648bae">median_of_medians</a>(m, idx);</div>
 <div class="line"><span class="lineno">   79</span>    }</div>
-<div class="line"><span class="lineno">   80</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> low;</div>
-<div class="line"><span class="lineno">   81</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> high;</div>
+<div class="line"><span class="lineno">   80</span>    std::vector&lt;int&gt; low;</div>
+<div class="line"><span class="lineno">   81</span>    std::vector&lt;int&gt; high;</div>
 <div class="line"><span class="lineno">   82</span>    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; r; i++){</div>
 <div class="line"><span class="lineno">   83</span>        <span class="keywordflow">if</span>(a[i] &lt; pivot){</div>
-<div class="line"><span class="lineno">   84</span>            low.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(a[i]);</div>
+<div class="line"><span class="lineno">   84</span>            low.push_back(a[i]);</div>
 <div class="line"><span class="lineno">   85</span>        }</div>
 <div class="line"><span class="lineno">   86</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span>(a[i] &gt; pivot){</div>
-<div class="line"><span class="lineno">   87</span>            high.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(a[i]);</div>
+<div class="line"><span class="lineno">   87</span>            high.push_back(a[i]);</div>
 <div class="line"><span class="lineno">   88</span>        }</div>
 <div class="line"><span class="lineno">   89</span>    }</div>
-<div class="line"><span class="lineno">   90</span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = int(low.<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>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = int(low.size());</div>
 <div class="line"><span class="lineno">   91</span>    <span class="keywordflow">if</span>(idx &lt; k){</div>
 <div class="line"><span class="lineno">   92</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a868847218f694e78bf433a0ff7648bae">median_of_medians</a>(low, idx);</div>
 <div class="line"><span class="lineno">   93</span>    }</div>
@@ -270,19 +287,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   98</span>        <span class="keywordflow">return</span> pivot;</div>
 <div class="line"><span class="lineno">   99</span>    }</div>
 <div class="line"><span class="lineno">  100</span>}</div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</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="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="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="asort_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a></div><div class="ttdeci">T sort(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d69/median__search_8cpp_a868847218f694e78bf433a0ff7648bae_cgraph.svg" width="370" height="283"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae1a3968e7947464bee7714f6d43b7002" name="ae1a3968e7947464bee7714f6d43b7002"></a>
@@ -300,22 +306,24 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Function to test above algorithm </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d69/median__search_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../d9/d69/median__search_8cpp_source.html">median_search.cpp</a>.</p>
 <div class="fragment"><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/container/vector.html">std::vector&lt;int&gt;</a> A{25,21,98,100,76,22,43,60,89,87};</div>
+<div class="line"><span class="lineno">  108</span>    std::vector&lt;int&gt; A{25,21,98,100,76,22,43,60,89,87};</div>
 <div class="line"><span class="lineno">  109</span>    <span class="keywordtype">int</span> i = 3;</div>
 <div class="line"><span class="lineno">  110</span>    assert(A[6] == search::median_search::median_of_medians(A, i));     <span class="comment">// A[6]  = 43, is the fourth smallest element.</span></div>
-<div class="line"><span class="lineno">  111</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;test case:1 passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:1 passed\n&quot;</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/container/vector.html">std::vector&lt;int&gt;</a> B{1,2,3,4,5,6};</div>
+<div class="line"><span class="lineno">  113</span>    std::vector&lt;int&gt; B{1,2,3,4,5,6};</div>
 <div class="line"><span class="lineno">  114</span>    <span class="keywordtype">int</span> j = 4;</div>
 <div class="line"><span class="lineno">  115</span>    assert(B[4] == search::median_search::median_of_medians(B, j));     <span class="comment">// B[4] = 5, is the fifth smallest element.</span></div>
-<div class="line"><span class="lineno">  116</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;test case:2 passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  116</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:2 passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  117</span>    </div>
-<div class="line"><span class="lineno">  118</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> C{1,2,3,4,5,1000,8,9,99};</div>
+<div class="line"><span class="lineno">  118</span>    std::vector&lt;int&gt; C{1,2,3,4,5,1000,8,9,99};</div>
 <div class="line"><span class="lineno">  119</span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = 3;</div>
 <div class="line"><span class="lineno">  120</span>    assert(C[3] == search::median_search::median_of_medians(C, k));     <span class="comment">// C[3] = 4, is the fourth smallest element.</span></div>
-<div class="line"><span class="lineno">  121</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;test case:3 passed\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  122</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;--All tests passed--\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  121</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:3 passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  122</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;--All tests passed--\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  123</span>}</div>
 </div><!-- fragment -->
 </div>
diff --git a/d9/d69/median__search_8cpp_a868847218f694e78bf433a0ff7648bae_cgraph.map b/d9/d69/median__search_8cpp_a868847218f694e78bf433a0ff7648bae_cgraph.map
deleted file mode 100644
index f593e99f2..000000000
--- a/d9/d69/median__search_8cpp_a868847218f694e78bf433a0ff7648bae_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="search::median_search::median_of_medians" name="search::median_search::median_of_medians">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,122,162,162"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="45,122,43,112,49,103,63,97,84,95,106,98,119,104,116,109,104,103,83,100,64,102,53,107,48,113,50,121"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="226,5,348,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="104,119,150,79,208,40,219,35,221,40,211,44,153,84,107,123"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="231,55,343,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="133,119,209,89,226,83,228,88,211,94,135,124"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="253,104,321,130"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="162,130,237,120,238,126,162,135"/>
-<area shape="rect" id="Node000005" 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="210,153,364,179"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="162,149,194,153,194,158,162,154"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="229,203,344,228"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="137,161,211,189,228,195,226,200,209,194,135,166"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/sort.html#" title=" " alt="" coords="252,252,322,278"/>
-<area shape="poly" id="edge7_Node000001_Node000007" title=" " alt="" coords="108,161,153,200,211,238,238,250,236,255,208,243,150,204,104,165"/>
-</map>
diff --git a/d9/d69/median__search_8cpp_a868847218f694e78bf433a0ff7648bae_cgraph.md5 b/d9/d69/median__search_8cpp_a868847218f694e78bf433a0ff7648bae_cgraph.md5
deleted file mode 100644
index fcf2c656e..000000000
--- a/d9/d69/median__search_8cpp_a868847218f694e78bf433a0ff7648bae_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a04aca9f360b8cda8c4eed31461764de
\ No newline at end of file
diff --git a/d9/d69/median__search_8cpp_a868847218f694e78bf433a0ff7648bae_cgraph.svg b/d9/d69/median__search_8cpp_a868847218f694e78bf433a0ff7648bae_cgraph.svg
deleted file mode 100644
index 2f2331eb9..000000000
--- a/d9/d69/median__search_8cpp_a868847218f694e78bf433a0ff7648bae_cgraph.svg
+++ /dev/null
@@ -1,165 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: search::median_search::median_of_medians Pages: 1 -->
-<svg width="277pt" height="212pt"
- viewBox="0.00 0.00 277.00 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>search::median_search::median_of_medians</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="117.25,-116.88 0,-116.88 0,-86.38 117.25,-86.38 117.25,-116.88"/>
-<text text-anchor="start" x="8" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">search::median_search</text>
-<text text-anchor="middle" x="58.62" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">::median_of_medians</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.6,-117.36C26.09,-126.43 35.09,-134.88 58.62,-134.88 71.49,-134.88 80.02,-132.35 84.2,-128.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.64,-129.23 85.45,-118.86 80.7,-128.33 87.64,-129.23"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257,-204.25 165.25,-204.25 165.25,-185 257,-185 257,-204.25"/>
-<text text-anchor="middle" x="211.12" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.22,-117.18C92.81,-133.95 122.95,-160.42 153.25,-176.62 155.77,-177.97 158.4,-179.24 161.1,-180.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.71,-183.63 170.29,-184.05 162.27,-177.12 159.71,-183.63"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.25,-167.25 169,-167.25 169,-148 253.25,-148 253.25,-167.25"/>
-<text text-anchor="middle" x="211.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.27,-117.28C113.45,-124.42 134.27,-132.78 153.25,-139.62 157.41,-141.12 161.76,-142.62 166.12,-144.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.86,-147.35 175.46,-147.12 167.03,-140.7 164.86,-147.35"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-130.25 185.5,-130.25 185.5,-111 236.75,-111 236.75,-130.25"/>
-<text text-anchor="middle" x="211.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.38,-108.92C136.51,-111.33 157.23,-113.95 174.23,-116.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.47,-119.53 183.83,-117.31 174.35,-112.58 173.47,-119.53"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269,-93.25 153.25,-93.25 153.25,-74 269,-74 269,-93.25"/>
-<text text-anchor="middle" x="211.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.38,-94.72C125.27,-93.77 133.43,-92.8 141.49,-91.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.75,-95.33 151.27,-90.66 140.92,-88.38 141.75,-95.33"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.38,-56.25 167.88,-56.25 167.88,-37 254.38,-37 254.38,-56.25"/>
-<text text-anchor="middle" x="211.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.66,-85.9C114.58,-79.08 134.81,-71.18 153.25,-64.62 157.41,-63.15 161.77,-61.66 166.13,-60.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.04,-63.59 175.47,-57.17 164.88,-56.94 167.04,-63.59"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.12,-19.25 185.12,-19.25 185.12,0 237.12,0 237.12,-19.25"/>
-<text text-anchor="middle" x="211.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.58,-85.99C93.25,-69.44 123.23,-43.55 153.25,-27.62 159.67,-24.22 166.85,-21.32 173.89,-18.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.76,-22.32 183.26,-15.99 172.67,-15.64 174.76,-22.32"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d69/median__search_8cpp_a868847218f694e78bf433a0ff7648bae_cgraph_org.svg b/d9/d69/median__search_8cpp_a868847218f694e78bf433a0ff7648bae_cgraph_org.svg
deleted file mode 100644
index 2ad482332..000000000
--- a/d9/d69/median__search_8cpp_a868847218f694e78bf433a0ff7648bae_cgraph_org.svg
+++ /dev/null
@@ -1,139 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: search::median_search::median_of_medians Pages: 1 -->
-<svg width="277pt" height="212pt"
- viewBox="0.00 0.00 277.00 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>search::median_search::median_of_medians</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="117.25,-116.88 0,-116.88 0,-86.38 117.25,-86.38 117.25,-116.88"/>
-<text text-anchor="start" x="8" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">search::median_search</text>
-<text text-anchor="middle" x="58.62" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">::median_of_medians</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.6,-117.36C26.09,-126.43 35.09,-134.88 58.62,-134.88 71.49,-134.88 80.02,-132.35 84.2,-128.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.64,-129.23 85.45,-118.86 80.7,-128.33 87.64,-129.23"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257,-204.25 165.25,-204.25 165.25,-185 257,-185 257,-204.25"/>
-<text text-anchor="middle" x="211.12" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.22,-117.18C92.81,-133.95 122.95,-160.42 153.25,-176.62 155.77,-177.97 158.4,-179.24 161.1,-180.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.71,-183.63 170.29,-184.05 162.27,-177.12 159.71,-183.63"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.25,-167.25 169,-167.25 169,-148 253.25,-148 253.25,-167.25"/>
-<text text-anchor="middle" x="211.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.27,-117.28C113.45,-124.42 134.27,-132.78 153.25,-139.62 157.41,-141.12 161.76,-142.62 166.12,-144.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.86,-147.35 175.46,-147.12 167.03,-140.7 164.86,-147.35"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-130.25 185.5,-130.25 185.5,-111 236.75,-111 236.75,-130.25"/>
-<text text-anchor="middle" x="211.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.38,-108.92C136.51,-111.33 157.23,-113.95 174.23,-116.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.47,-119.53 183.83,-117.31 174.35,-112.58 173.47,-119.53"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269,-93.25 153.25,-93.25 153.25,-74 269,-74 269,-93.25"/>
-<text text-anchor="middle" x="211.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.38,-94.72C125.27,-93.77 133.43,-92.8 141.49,-91.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.75,-95.33 151.27,-90.66 140.92,-88.38 141.75,-95.33"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.38,-56.25 167.88,-56.25 167.88,-37 254.38,-37 254.38,-56.25"/>
-<text text-anchor="middle" x="211.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.66,-85.9C114.58,-79.08 134.81,-71.18 153.25,-64.62 157.41,-63.15 161.77,-61.66 166.13,-60.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.04,-63.59 175.47,-57.17 164.88,-56.94 167.04,-63.59"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.12,-19.25 185.12,-19.25 185.12,0 237.12,0 237.12,-19.25"/>
-<text text-anchor="middle" x="211.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.58,-85.99C93.25,-69.44 123.23,-43.55 153.25,-27.62 159.67,-24.22 166.85,-21.32 173.89,-18.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.76,-22.32 183.26,-15.99 172.67,-15.64 174.76,-22.32"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 506641a27..000000000
--- a/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" title=" " alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index f524bb217..000000000
--- a/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d3e392789b36ef8a470c82b495ed242d
\ No newline at end of file
diff --git a/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 0e6ddfb1b..000000000
--- a/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 0c8afdd3b..000000000
--- a/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d69/median__search_8cpp_source.html b/d9/d69/median__search_8cpp_source.html
new file mode 100644
index 000000000..907df1f8d
--- /dev/null
+++ b/d9/d69/median__search_8cpp_source.html
@@ -0,0 +1,245 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: search/median_search.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d69/median__search_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">median_search.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/d69/median__search_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a> {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../da/dd4/namespacemedian__search.html">median_search</a> {</div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae">   62</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae">median_of_medians</a>(<span class="keyword">const</span> std::vector&lt;int&gt;&amp; A,  <span class="keyword">const</span> <span class="keywordtype">int</span>&amp; idx) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordtype">int</span> pivot = 0;                  <span class="comment">// initialized with zero</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    std::vector&lt;int&gt; a(A.begin(), A.end());</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    std::vector&lt;int&gt; m;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordtype">int</span> r = a.size();</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; r; i += 5){</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        std::sort(a.begin() + i, a.begin() + std::min(r, i + 5));</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        <span class="keywordtype">int</span> mid = (i + std::min(r, i + 5)) / 2;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        m.push_back(a[mid]);</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keywordtype">int</span> sz = int(m.size());</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">if</span>(sz &lt;= 5){</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        std::sort(m.begin(), m.end());</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        pivot = m[(sz- 1) / 2];</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    }</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="keywordflow">else</span>{</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        pivot = <a class="code hl_function" href="../../d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae">median_of_medians</a>(m, idx);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    std::vector&lt;int&gt; low;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    std::vector&lt;int&gt; high;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; r; i++){</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordflow">if</span>(a[i] &lt; pivot){</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            low.push_back(a[i]);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        }</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span>(a[i] &gt; pivot){</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            high.push_back(a[i]);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="keywordtype">int</span> k = int(low.size());</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordflow">if</span>(idx &lt; k){</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae">median_of_medians</a>(low, idx);</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    }</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keywordflow">else</span> <span class="keywordflow">if</span>(idx &gt; k){</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae">median_of_medians</a>(high, idx-k-1);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="keywordflow">else</span>{</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        <span class="keywordflow">return</span> pivot;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    }</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>}</div>
+</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>}  <span class="comment">// namespace median_search</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>}  <span class="comment">// namespace search</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
+<div class="foldopen" id="foldopen00107" data-start="{" data-end="}">
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"><a class="line" href="../../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">  107</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>(){</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    std::vector&lt;int&gt; A{25,21,98,100,76,22,43,60,89,87};</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="keywordtype">int</span> i = 3;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    assert(A[6] == search::median_search::median_of_medians(A, i));     <span class="comment">// A[6]  = 43, is the fourth smallest element.</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:1 passed\n&quot;</span>;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    std::vector&lt;int&gt; B{1,2,3,4,5,6};</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="keywordtype">int</span> j = 4;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    assert(B[4] == search::median_search::median_of_medians(B, j));     <span class="comment">// B[4] = 5, is the fifth smallest element.</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:2 passed\n&quot;</span>;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    </div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    std::vector&lt;int&gt; C{1,2,3,4,5,1000,8,9,99};</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <span class="keywordtype">int</span> k = 3;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    assert(C[3] == search::median_search::median_of_medians(C, k));     <span class="comment">// C[3] = 4, is the fourth smallest element.</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:3 passed\n&quot;</span>;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;--All tests passed--\n&quot;</span>;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>}</div>
+</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
+<div class="foldopen" id="foldopen00128" data-start="{" data-end="}">
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"><a class="line" href="../../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  128</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>()</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>{</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <a class="code hl_function" href="../../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <span class="keywordtype">int</span> n = 0;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter Size of Array: &quot;</span>;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    std::vector&lt;int&gt; a(n);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter Array: &quot;</span>;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; n; i++){</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        std::cin &gt;&gt; a[i];</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    }</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Median: &quot;</span>;            <span class="comment">// Median defination: https://en.wikipedia.org/wiki/Median</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="keywordtype">int</span> x = search::median_search::median_of_medians(a,  (n - 1) / 2);</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <span class="keywordflow">if</span>(n % 2 == 0){</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        <span class="keywordtype">int</span> y = search::median_search::median_of_medians(a, n / 2);</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        std::cout &lt;&lt; (float(x) + float(y))/2.0;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    }</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <span class="keywordflow">else</span>{</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        std::cout &lt;&lt; x;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    }</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTo find i-th smallest element &quot;</span>;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter i: &quot;</span>;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    <span class="keywordtype">int</span> idx = 0;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    std::cin &gt;&gt; idx;</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    idx--;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    std::cout &lt;&lt; idx + 1&lt;&lt; <span class="stringliteral">&quot;-th smallest element: &quot;</span> &lt;&lt; search::median_search::median_of_medians(a, idx) &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>}</div>
+</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span> </div>
+<div class="ttc" id="amedian__search_8cpp_html_a868847218f694e78bf433a0ff7648bae"><div class="ttname"><a href="../../d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae">search::median_search::median_of_medians</a></div><div class="ttdeci">int median_of_medians(const std::vector&lt; int &gt; &amp;A, const int &amp;idx)</div><div class="ttdef"><b>Definition</b> <a href="#l00062">median_search.cpp:62</a></div></div>
+<div class="ttc" id="amedian__search_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00107">median_search.cpp:107</a></div></div>
+<div class="ttc" id="amedian__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00128">median_search.cpp:128</a></div></div>
+<div class="ttc" id="anamespacemedian__search_html"><div class="ttname"><a href="../../da/dd4/namespacemedian__search.html">median_search</a></div><div class="ttdoc">Functions for Median search algorithm.</div></div>
+<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> <a href="../../df/dd5/binary__search_8cpp_source.html#l00047">binary_search.cpp:47</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../d9/d69/median__search_8cpp.html">median_search.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/d6b/coin__change_8cpp_source.html b/d9/d6b/coin__change_8cpp_source.html
new file mode 100644
index 000000000..4a531d4c2
--- /dev/null
+++ b/d9/d6b/coin__change_8cpp_source.html
@@ -0,0 +1,189 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/coin_change.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d6b/coin__change_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">coin_change.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;climits&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment">// Function to find the Minimum number of coins required to get Sum S</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="keywordtype">int</span> findMinCoins(<span class="keywordtype">int</span> arr[], <span class="keywordtype">int</span> n, <span class="keywordtype">int</span> N) {</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>    <span class="comment">// dp[i] = no of coins required to get a total of i</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    std::vector&lt;int&gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(N + 1);</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    <span class="comment">// 0 coins are needed for 0 sum</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[0] = 0;</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>        <span class="comment">// initialize minimum number of coins needed to infinity</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>        <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i] = INT_MAX;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        <span class="keywordtype">int</span> res = INT_MAX;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        <span class="comment">// do for each coin</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> c = 0; c &lt; n; c++) {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>            <span class="keywordflow">if</span> (i - arr[c] &gt;=</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>                0)  <span class="comment">// check if coins doesn&#39;t become negative by including it</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>                res = <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i - arr[c]];</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>            <span class="comment">// if total can be reached by including current coin c,</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>            <span class="comment">// update minimum number of coins needed dp[i]</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>            <span class="keywordflow">if</span> (res != INT_MAX)</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>                <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i] = min(<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i], res + 1);</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        }</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    }</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="comment">// The Minimum No of Coins Required for N = dp[N]</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[<a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>];</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>}</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="comment">// No of Coins We Have</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordtype">int</span> arr[] = {1, 2, 3, 4};</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordtype">int</span> n = <span class="keyword">sizeof</span>(arr) / <span class="keyword">sizeof</span>(arr[0]);</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="comment">// Total Change Required</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 15;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    cout &lt;&lt; <span class="stringliteral">&quot;Minimum Number of Coins Required &quot;</span> &lt;&lt; findMinCoins(arr, n, N)</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>         &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</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> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><b>coin_change.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/d70/namespacequeue__using__array.html b/d9/d70/namespacequeue__using__array.html
index 29e97df19..5f7935884 100644
--- a/d9/d70/namespacequeue__using__array.html
+++ b/d9/d70/namespacequeue__using__array.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: queue_using_array Namespace Reference</title>
+<title>TheAlgorithms/C++: queue_using_array Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d9/d75/namespacednf__sort.html b/d9/d75/namespacednf__sort.html
index ed1bd9c7b..a2b684d4c 100644
--- a/d9/d75/namespacednf__sort.html
+++ b/d9/d75/namespacednf__sort.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dnf_sort Namespace Reference</title>
+<title>TheAlgorithms/C++: dnf_sort Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d9/d80/trapped__rainwater_8cpp.html b/d9/d80/trapped__rainwater_8cpp.html
index 9d6eca16f..7d73dc35f 100644
--- a/d9/d80/trapped__rainwater_8cpp.html
+++ b/d9/d80/trapped__rainwater_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/trapped_rainwater.cpp File Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming/trapped_rainwater.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for trapped_rainwater.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d7f/trapped__rainwater_8cpp__incl.svg" width="427" height="126"><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">
+</div>
+<p><a href="../../d9/d80/trapped__rainwater_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
@@ -132,7 +151,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a066e0e739e7c276eee6e61d5b4d37ce8" id="r_a066e0e739e7c276eee6e61d5b4d37ce8"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint32_t &gt; &amp;heights)</td></tr>
+<tr class="memitem:a066e0e739e7c276eee6e61d5b4d37ce8" id="r_a066e0e739e7c276eee6e61d5b4d37ce8"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a> (const std::vector&lt; uint32_t &gt; &amp;heights)</td></tr>
 <tr class="memdesc:a066e0e739e7c276eee6e61d5b4d37ce8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to calculate the trapped rainwater.  <br /></td></tr>
 <tr class="separator:a066e0e739e7c276eee6e61d5b4d37ce8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -145,6 +164,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of the <a href="https://www.geeksforgeeks.org/trapping-rain-water/" target="_blank">Trapped Rainwater Problem</a> </p>
 <p>This implementation calculates the amount of rainwater that can be trapped between walls represented by an array of heights. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/TruongNhanNguyen" target="_blank">SOZEL</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/d80/trapped__rainwater_8cpp_source.html">trapped_rainwater.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -163,17 +184,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d80/trapped__rainwater_8cpp_source.html#l00101">101</a> of file <a class="el" href="../../d9/d80/trapped__rainwater_8cpp_source.html">trapped_rainwater.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  101</span>           {</div>
 <div class="line"><span class="lineno">  102</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  103</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  104</span>}</div>
-<div class="ttc" id="atrapped__rainwater_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> trapped_rainwater.cpp:62</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d80/trapped__rainwater_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="515" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="atrapped__rainwater_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d80/trapped__rainwater_8cpp_source.html#l00062">trapped_rainwater.cpp:62</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -201,48 +219,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>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d80/trapped__rainwater_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../d9/d80/trapped__rainwater_8cpp_source.html">trapped_rainwater.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>                   {</div>
-<div class="line"><span class="lineno">   63</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a> test_basic = {0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1};</div>
+<div class="line"><span class="lineno">   63</span>    std::vector&lt;uint32_t&gt; test_basic = {0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1};</div>
 <div class="line"><span class="lineno">   64</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(test_basic) == 6);</div>
 <div class="line"><span class="lineno">   65</span> </div>
-<div class="line"><span class="lineno">   66</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a> test_peak_under_water = {3, 0, 2, 0, 4};</div>
+<div class="line"><span class="lineno">   66</span>    std::vector&lt;uint32_t&gt; test_peak_under_water = {3, 0, 2, 0, 4};</div>
 <div class="line"><span class="lineno">   67</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(test_peak_under_water) == 7);</div>
 <div class="line"><span class="lineno">   68</span> </div>
-<div class="line"><span class="lineno">   69</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a> test_bucket = {5, 1, 5};</div>
+<div class="line"><span class="lineno">   69</span>    std::vector&lt;uint32_t&gt; test_bucket = {5, 1, 5};</div>
 <div class="line"><span class="lineno">   70</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(test_bucket) == 4);</div>
 <div class="line"><span class="lineno">   71</span> </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&lt;uint32_t&gt;</a> test_skewed_bucket = {4, 1, 5};</div>
+<div class="line"><span class="lineno">   72</span>    std::vector&lt;uint32_t&gt; test_skewed_bucket = {4, 1, 5};</div>
 <div class="line"><span class="lineno">   73</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(test_skewed_bucket) == 3);</div>
 <div class="line"><span class="lineno">   74</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&lt;uint32_t&gt;</a> test_empty = {};</div>
+<div class="line"><span class="lineno">   75</span>    std::vector&lt;uint32_t&gt; test_empty = {};</div>
 <div class="line"><span class="lineno">   76</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(test_empty) == 0);</div>
 <div class="line"><span class="lineno">   77</span> </div>
-<div class="line"><span class="lineno">   78</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a> test_flat = {0, 0, 0, 0, 0};</div>
+<div class="line"><span class="lineno">   78</span>    std::vector&lt;uint32_t&gt; test_flat = {0, 0, 0, 0, 0};</div>
 <div class="line"><span class="lineno">   79</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(test_flat) == 0);</div>
 <div class="line"><span class="lineno">   80</span> </div>
-<div class="line"><span class="lineno">   81</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a> test_no_trapped_water = {1, 1, 2, 4, 0, 0, 0};</div>
+<div class="line"><span class="lineno">   81</span>    std::vector&lt;uint32_t&gt; test_no_trapped_water = {1, 1, 2, 4, 0, 0, 0};</div>
 <div class="line"><span class="lineno">   82</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(test_no_trapped_water) == 0);</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&lt;uint32_t&gt;</a> test_single_elevation = {5};</div>
+<div class="line"><span class="lineno">   84</span>    std::vector&lt;uint32_t&gt; test_single_elevation = {5};</div>
 <div class="line"><span class="lineno">   85</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(test_single_elevation) == 0);</div>
 <div class="line"><span class="lineno">   86</span> </div>
-<div class="line"><span class="lineno">   87</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a> test_two_point_elevation = {5, 1};</div>
+<div class="line"><span class="lineno">   87</span>    std::vector&lt;uint32_t&gt; test_two_point_elevation = {5, 1};</div>
 <div class="line"><span class="lineno">   88</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(test_two_point_elevation) ==</div>
 <div class="line"><span class="lineno">   89</span>           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&lt;uint32_t&gt;</a> test_large_elevation_map_difference = {5, 1, 6, 1,</div>
+<div class="line"><span class="lineno">   91</span>    std::vector&lt;uint32_t&gt; test_large_elevation_map_difference = {5, 1, 6, 1,</div>
 <div class="line"><span class="lineno">   92</span>                                                                 7, 1, 8};</div>
 <div class="line"><span class="lineno">   93</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(</div>
 <div class="line"><span class="lineno">   94</span>               test_large_elevation_map_difference) == 15);</div>
 <div class="line"><span class="lineno">   95</span>}</div>
-<div class="ttc" id="anamespacedynamic__programming_html_a066e0e739e7c276eee6e61d5b4d37ce8"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a></div><div class="ttdeci">uint32_t trappedRainwater(const std::vector&lt; uint32_t &gt; &amp;heights)</div><div class="ttdoc">Function to calculate the trapped rainwater.</div><div class="ttdef"><b>Definition</b> trapped_rainwater.cpp:27</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d80/trapped__rainwater_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="418" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacedynamic__programming_html_a066e0e739e7c276eee6e61d5b4d37ce8"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a></div><div class="ttdeci">uint32_t trappedRainwater(const std::vector&lt; uint32_t &gt; &amp;heights)</div><div class="ttdoc">Function to calculate the trapped rainwater.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d80/trapped__rainwater_8cpp_source.html#l00027">trapped_rainwater.cpp:27</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/d80/trapped__rainwater_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d9/d80/trapped__rainwater_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index f8ab413f7..000000000
--- a/d9/d80/trapped__rainwater_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,55,49,80"/>
-<area shape="rect" id="Node000002" href="$dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8" title="Function to calculate the trapped rainwater." alt="" coords="97,47,249,88"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,65,81,65,81,70,49,70"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="318,5,391,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="249,44,303,29,304,34,250,49"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="320,55,389,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="250,65,305,65,305,70,250,70"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="297,104,412,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="250,86,290,97,289,102,249,91"/>
-</map>
diff --git a/d9/d80/trapped__rainwater_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d9/d80/trapped__rainwater_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 9e81044d7..000000000
--- a/d9/d80/trapped__rainwater_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-24ed3c31a50a8e646f51ce7bd657d22a
\ No newline at end of file
diff --git a/d9/d80/trapped__rainwater_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d9/d80/trapped__rainwater_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index f66c1d927..000000000
--- a/d9/d80/trapped__rainwater_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="313pt" height="101pt"
- viewBox="0.00 0.00 313.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-56.25 0,-56.25 0,-37 32.5,-37 32.5,-56.25"/>
-<text text-anchor="middle" x="16.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8" target="_top" xlink:title="Function to calculate the trapped rainwater.">
-<polygon fill="white" stroke="#666666" points="182.75,-61.88 68.5,-61.88 68.5,-31.38 182.75,-31.38 182.75,-61.88"/>
-<text text-anchor="start" x="76.5" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="125.62" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::trappedRainwater</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.63,-46.62C39.32,-46.62 47.66,-46.62 56.57,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.57,-50.13 66.57,-46.63 56.57,-43.13 56.57,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="289.12,-93.25 234.88,-93.25 234.88,-74 289.12,-74 289.12,-93.25"/>
-<text text-anchor="middle" x="262" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.22,-62.21C196.84,-65.96 211.06,-69.87 223.55,-73.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.45,-76.64 233.02,-75.92 224.31,-69.89 222.45,-76.64"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="287.62,-56.25 236.38,-56.25 236.38,-37 287.62,-37 287.62,-56.25"/>
-<text text-anchor="middle" x="262" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.22,-46.62C197.28,-46.62 211.97,-46.62 224.76,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.37,-50.13 234.37,-46.63 224.37,-43.13 224.37,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-19.25 218.75,-19.25 218.75,0 305.25,0 305.25,-19.25"/>
-<text text-anchor="middle" x="262" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.22,-31.04C193.22,-28.29 203.55,-25.44 213.27,-22.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.19,-26.14 222.9,-20.11 212.33,-19.4 214.19,-26.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d80/trapped__rainwater_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d9/d80/trapped__rainwater_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1c3504ec8..000000000
--- a/d9/d80/trapped__rainwater_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="313pt" height="101pt"
- viewBox="0.00 0.00 313.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-56.25 0,-56.25 0,-37 32.5,-37 32.5,-56.25"/>
-<text text-anchor="middle" x="16.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8" target="_top" xlink:title="Function to calculate the trapped rainwater.">
-<polygon fill="white" stroke="#666666" points="182.75,-61.88 68.5,-61.88 68.5,-31.38 182.75,-31.38 182.75,-61.88"/>
-<text text-anchor="start" x="76.5" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="125.62" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::trappedRainwater</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.63,-46.62C39.32,-46.62 47.66,-46.62 56.57,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.57,-50.13 66.57,-46.63 56.57,-43.13 56.57,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="289.12,-93.25 234.88,-93.25 234.88,-74 289.12,-74 289.12,-93.25"/>
-<text text-anchor="middle" x="262" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.22,-62.21C196.84,-65.96 211.06,-69.87 223.55,-73.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.45,-76.64 233.02,-75.92 224.31,-69.89 222.45,-76.64"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="287.62,-56.25 236.38,-56.25 236.38,-37 287.62,-37 287.62,-56.25"/>
-<text text-anchor="middle" x="262" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.22,-46.62C197.28,-46.62 211.97,-46.62 224.76,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.37,-50.13 234.37,-46.63 224.37,-43.13 224.37,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-19.25 218.75,-19.25 218.75,0 305.25,0 305.25,-19.25"/>
-<text text-anchor="middle" x="262" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.22,-31.04C193.22,-28.29 203.55,-25.44 213.27,-22.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.19,-26.14 222.9,-20.11 212.33,-19.4 214.19,-26.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d80/trapped__rainwater_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d80/trapped__rainwater_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 22d23d3bb..000000000
--- a/d9/d80/trapped__rainwater_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,55,55,80"/>
-<area shape="rect" id="Node000002" href="$d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,55,146,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,65,87,65,87,70,55,70"/>
-<area shape="rect" id="Node000003" href="$dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8" title="Function to calculate the trapped rainwater." alt="" coords="194,47,346,88"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,65,178,65,178,70,146,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="416,5,488,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="346,44,400,29,401,34,348,49"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="418,55,486,80"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="347,65,402,65,402,70,347,70"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="394,104,510,130"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="348,86,388,97,386,102,346,91"/>
-</map>
diff --git a/d9/d80/trapped__rainwater_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d80/trapped__rainwater_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index f5adb3637..000000000
--- a/d9/d80/trapped__rainwater_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9d9b9a28bb3fd483ee9089311f8f072a
\ No newline at end of file
diff --git a/d9/d80/trapped__rainwater_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d80/trapped__rainwater_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index b7d112921..000000000
--- a/d9/d80/trapped__rainwater_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,138 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="386pt" height="101pt"
- viewBox="0.00 0.00 386.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-56.25 73,-56.25 73,-37 105.5,-37 105.5,-56.25"/>
-<text text-anchor="middle" x="89.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-46.62C44.58,-46.62 53.31,-46.62 61.45,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-50.13 71.2,-46.63 61.2,-43.13 61.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8" target="_top" xlink:title="Function to calculate the trapped rainwater.">
-<polygon fill="white" stroke="#666666" points="255.75,-61.88 141.5,-61.88 141.5,-31.38 255.75,-31.38 255.75,-61.88"/>
-<text text-anchor="start" x="149.5" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="198.62" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::trappedRainwater</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.63,-46.62C112.32,-46.62 120.66,-46.62 129.57,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.57,-50.13 139.57,-46.63 129.57,-43.13 129.57,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="362.12,-93.25 307.88,-93.25 307.88,-74 362.12,-74 362.12,-93.25"/>
-<text text-anchor="middle" x="335" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.22,-62.21C269.84,-65.96 284.06,-69.87 296.55,-73.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.45,-76.64 306.02,-75.92 297.31,-69.89 295.45,-76.64"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="360.62,-56.25 309.38,-56.25 309.38,-37 360.62,-37 360.62,-56.25"/>
-<text text-anchor="middle" x="335" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.22,-46.62C270.28,-46.62 284.97,-46.62 297.76,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.37,-50.13 307.37,-46.63 297.37,-43.13 297.37,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="378.25,-19.25 291.75,-19.25 291.75,0 378.25,0 378.25,-19.25"/>
-<text text-anchor="middle" x="335" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.22,-31.04C266.22,-28.29 276.55,-25.44 286.27,-22.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.19,-26.14 295.9,-20.11 285.33,-19.4 287.19,-26.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d80/trapped__rainwater_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/d80/trapped__rainwater_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 9aa728d9b..000000000
--- a/d9/d80/trapped__rainwater_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,112 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="386pt" height="101pt"
- viewBox="0.00 0.00 386.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-56.25 73,-56.25 73,-37 105.5,-37 105.5,-56.25"/>
-<text text-anchor="middle" x="89.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-46.62C44.58,-46.62 53.31,-46.62 61.45,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-50.13 71.2,-46.63 61.2,-43.13 61.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8" target="_top" xlink:title="Function to calculate the trapped rainwater.">
-<polygon fill="white" stroke="#666666" points="255.75,-61.88 141.5,-61.88 141.5,-31.38 255.75,-31.38 255.75,-61.88"/>
-<text text-anchor="start" x="149.5" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="198.62" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::trappedRainwater</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.63,-46.62C112.32,-46.62 120.66,-46.62 129.57,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.57,-50.13 139.57,-46.63 129.57,-43.13 129.57,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="362.12,-93.25 307.88,-93.25 307.88,-74 362.12,-74 362.12,-93.25"/>
-<text text-anchor="middle" x="335" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.22,-62.21C269.84,-65.96 284.06,-69.87 296.55,-73.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.45,-76.64 306.02,-75.92 297.31,-69.89 295.45,-76.64"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="360.62,-56.25 309.38,-56.25 309.38,-37 360.62,-37 360.62,-56.25"/>
-<text text-anchor="middle" x="335" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.22,-46.62C270.28,-46.62 284.97,-46.62 297.76,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.37,-50.13 307.37,-46.63 297.37,-43.13 297.37,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="378.25,-19.25 291.75,-19.25 291.75,0 378.25,0 378.25,-19.25"/>
-<text text-anchor="middle" x="335" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.22,-31.04C266.22,-28.29 276.55,-25.44 286.27,-22.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.19,-26.14 295.9,-20.11 285.33,-19.4 287.19,-26.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d80/trapped__rainwater_8cpp_source.html b/d9/d80/trapped__rainwater_8cpp_source.html
new file mode 100644
index 000000000..0ed1fc0d2
--- /dev/null
+++ b/d9/d80/trapped__rainwater_8cpp_source.html
@@ -0,0 +1,229 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/trapped_rainwater.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d80/trapped__rainwater_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">trapped_rainwater.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/d80/trapped__rainwater_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cstddef&gt;</span>    </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;vector&gt;</span>  </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment"> * @namespace</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment"> * @brief Dynamic Programming Algorithms</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a> {</div>
+<div class="foldopen" id="foldopen00027" data-start="{" data-end="}">
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">   27</a></span>uint32_t <a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">trappedRainwater</a>(<span class="keyword">const</span> std::vector&lt;uint32_t&gt;&amp; heights) {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    std::size_t n = heights.size();</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordflow">if</span> (n &lt;= 2)</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        <span class="keywordflow">return</span> 0;  <span class="comment">// No water can be trapped with less than 3 walls</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    std::vector&lt;uint32_t&gt; leftMax(n), rightMax(n);</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="comment">// Calculate the maximum height of wall to the left of each wall</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    leftMax[0] = heights[0];</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">for</span> (std::size_t i = 1; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        leftMax[i] = std::max(leftMax[i - 1], heights[i]);</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    }</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="comment">// Calculate the maximum height of wall to the right of each wall</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    rightMax[n - 1] = heights[n - 1];</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">for</span> (std::size_t i = n - 2; i &lt; n; --i) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        rightMax[i] = std::max(rightMax[i + 1], heights[i]);</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    }</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="comment">// Calculate the trapped rainwater between walls</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    uint32_t trappedWater = 0;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">for</span> (std::size_t i = 0; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        trappedWater +=</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>            std::max(0u, std::min(leftMax[i], rightMax[i]) - heights[i]);</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">return</span> trappedWater;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>}</div>
+</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>}  <span class="comment">// namespace dynamic_programming</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   62</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    std::vector&lt;uint32_t&gt; test_basic = {0, 1, 0, 2, 1, 0, 1, 3, 2, 1, 2, 1};</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(test_basic) == 6);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    std::vector&lt;uint32_t&gt; test_peak_under_water = {3, 0, 2, 0, 4};</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(test_peak_under_water) == 7);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    std::vector&lt;uint32_t&gt; test_bucket = {5, 1, 5};</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(test_bucket) == 4);</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    std::vector&lt;uint32_t&gt; test_skewed_bucket = {4, 1, 5};</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(test_skewed_bucket) == 3);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    std::vector&lt;uint32_t&gt; test_empty = {};</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(test_empty) == 0);</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    std::vector&lt;uint32_t&gt; test_flat = {0, 0, 0, 0, 0};</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(test_flat) == 0);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    std::vector&lt;uint32_t&gt; test_no_trapped_water = {1, 1, 2, 4, 0, 0, 0};</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(test_no_trapped_water) == 0);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::vector&lt;uint32_t&gt; test_single_elevation = {5};</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(test_single_elevation) == 0);</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    std::vector&lt;uint32_t&gt; test_two_point_elevation = {5, 1};</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(test_two_point_elevation) ==</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>           0);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    std::vector&lt;uint32_t&gt; test_large_elevation_map_difference = {5, 1, 6, 1,</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>                                                                 7, 1, 8};</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a>(</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>               test_large_elevation_map_difference) == 15);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>}</div>
+</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="foldopen" id="foldopen00101" data-start="{" data-end="}">
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"><a class="line" href="../../d9/d80/trapped__rainwater_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  101</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d80/trapped__rainwater_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <a class="code hl_function" href="../../d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>}</div>
+</div>
+<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
+<div class="ttc" id="anamespacedynamic__programming_html_a066e0e739e7c276eee6e61d5b4d37ce8"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8">dynamic_programming::trappedRainwater</a></div><div class="ttdeci">uint32_t trappedRainwater(const std::vector&lt; uint32_t &gt; &amp;heights)</div><div class="ttdoc">Function to calculate the trapped rainwater.</div><div class="ttdef"><b>Definition</b> <a href="#l00027">trapped_rainwater.cpp:27</a></div></div>
+<div class="ttc" id="atrapped__rainwater_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d9/d80/trapped__rainwater_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> <a href="#l00062">trapped_rainwater.cpp:62</a></div></div>
+<div class="ttc" id="atrapped__rainwater_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d80/trapped__rainwater_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00101">trapped_rainwater.cpp:101</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../d9/d80/trapped__rainwater_8cpp.html">trapped_rainwater.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/d85/selection__sort__iterative_8cpp_source.html b/d9/d85/selection__sort__iterative_8cpp_source.html
new file mode 100644
index 000000000..a85934aef
--- /dev/null
+++ b/d9/d85/selection__sort__iterative_8cpp_source.html
@@ -0,0 +1,267 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/selection_sort_iterative.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d85/selection__sort__iterative_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">selection_sort_iterative.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/******************************************************************************</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * @file</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * @brief Implementation of the [Selection</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * sort](https://en.wikipedia.org/wiki/Selection_sort) implementation using</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * swapping</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> * @details</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> * The selection sort algorithm divides the input vector into two parts: a</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> * sorted subvector of items which is built up from left to right at the front</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> * (left) of the vector, and a subvector of the remaining unsorted items that</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment"> * occupy the rest of the vector. Initially, the sorted subvector is empty, and</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment"> * the unsorted subvector is the entire input vector. The algorithm proceeds by</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment"> * finding the smallest (or largest, depending on the sorting order) element in</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment"> * the unsorted subvector, exchanging (swapping) it with the leftmost unsorted</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment"> * element (putting it in sorted order), and moving the subvector boundaries one</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment"> * element to the right.</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment"> * ### Implementation</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment"> * SelectionSort</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment"> * The algorithm divides the input vector into two parts: the subvector of items</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment"> * already sorted, which is built up from left to right. Initially, the sorted</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"> * subvector is empty and the unsorted subvector is the entire input vector. The</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"> * algorithm proceeds by finding the smallest element in the unsorted subvector,</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment"> * exchanging (swapping) it with the leftmost unsorted element (putting it in</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment"> * sorted order), and moving the subvector boundaries one element to the right.</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment"> * @author [Lajat Manekar](https://github.com/Lazeeez)</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment"> * @author Unknown author</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="comment">/******************************************************************************</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="comment"> * @namespace sorting</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="comment"> * @brief Sorting algorithms</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="comment">/******************************************************************************</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="comment"> * @brief The main function which implements Selection sort</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="comment"> * @param arr vector to be sorted</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="comment"> * @param len length of vector to be sorted</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="comment"> * @returns @param array resultant sorted vector</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>std::vector&lt;uint64_t&gt; selectionSort(<span class="keyword">const</span> std::vector&lt;uint64_t&gt; &amp;arr,</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>                                    uint64_t len) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    std::vector&lt;uint64_t&gt; array(</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        arr.begin(),</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        arr.end());  <span class="comment">// declare a vector in which result will be stored</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">for</span> (uint64_t it = 0; it &lt; len; ++it) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        uint64_t min = it;  <span class="comment">// set min value</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="keywordflow">for</span> (uint64_t it2 = it + 1; it2 &lt; len; ++it2) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            <span class="keywordflow">if</span> (array[it2] &lt; array[min]) {  <span class="comment">// check which element is smaller</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>                min = it2;  <span class="comment">// store index of smallest element to min</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>            }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        }</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="keywordflow">if</span> (min != it) {  <span class="comment">// swap if min does not match to i</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            uint64_t tmp = array[min];</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            array[min] = array[it];</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            array[it] = tmp;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keywordflow">return</span> array;  <span class="comment">// return sorted vector</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>}</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="comment">/*******************************************************************************</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span><span class="comment"> * @brief Self-test implementations</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="comment"> * @returns void</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="comment">// testcase #1</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="comment">// [1, 0, 0, 1, 1, 0, 2, 1] returns [0, 0, 0, 1, 1, 1, 1, 2]</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    std::vector&lt;uint64_t&gt; vector1 = {1, 0, 0, 1, 1, 0, 2, 1};</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    uint64_t vector1size = vector1.size();</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test... &quot;</span>;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    std::vector&lt;uint64_t&gt; result_test1;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    result_test1 = sorting::selectionSort(vector1, vector1size);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    assert(std::is_sorted(result_test1.begin(), result_test1.end()));</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="comment">// testcase #2</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="comment">// [19, 22, 540, 241, 156, 140, 12, 1] returns [1, 12, 19, 22, 140, 156,</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="comment">// 241,540]</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    std::vector&lt;uint64_t&gt; vector2 = {19, 22, 540, 241, 156, 140, 12, 1};</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    uint64_t vector2size = vector2.size();</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test... &quot;</span>;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    std::vector&lt;uint64_t&gt; result_test2;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    result_test2 = sorting::selectionSort(vector2, vector2size);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    assert(std::is_sorted(result_test2.begin(), result_test2.end()));</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="comment">// testcase #3</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="comment">// [11, 20, 30, 41, 15, 60, 82, 15] returns [11, 15, 15, 20, 30, 41, 60, 82]</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    std::vector&lt;uint64_t&gt; vector3 = {11, 20, 30, 41, 15, 60, 82, 15};</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    uint64_t vector3size = vector3.size();</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test... &quot;</span>;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    std::vector&lt;uint64_t&gt; result_test3;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    result_test3 = sorting::selectionSort(vector3, vector3size);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    assert(std::is_sorted(result_test3.begin(), result_test3.end()));</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="comment">// testcase #4</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="comment">// [1, 9, 11, 546, 26, 65, 212, 14, -11] returns [-11, 1, 9, 11, 14, 26, 65,</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="comment">// 212, 546]</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::vector&lt;uint64_t&gt; vector4 = {1, 9, 11, 546, 26, 65, 212, 14};</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    uint64_t vector4size = vector2.size();</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;4th test... &quot;</span>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::vector&lt;uint64_t&gt; result_test4;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    result_test4 = sorting::selectionSort(vector4, vector4size);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    assert(std::is_sorted(result_test4.begin(), result_test4.end()));</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>}</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span><span class="comment">/*******************************************************************************</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span><span class="comment"> * @brief Main function</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span><span class="comment"> * @returns 0 on exit</span></div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>}</div>
+<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00100">caesar_cipher.cpp:100</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><b>selection_sort_iterative.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.map b/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.map
index 37a7c2e4c..a34b2b0ed 100644
--- a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.map
+++ b/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.map
@@ -1,5 +1,5 @@
 <map id="std::is_unsigned&lt; uint128_t &gt;" name="std::is_unsigned&lt; uint128_t &gt;">
 <area shape="rect" id="Node000001" title=" " alt="" coords="5,79,199,105"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integral_constant.html" title=" " alt="" coords="51,5,153,31"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="51,5,153,31"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="105,46,105,79,99,79,99,46"/>
 </map>
diff --git a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.md5 b/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.md5
index 443f973ea..a5d3325c5 100644
--- a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.md5
+++ b/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.md5
@@ -1 +1 @@
-a18170162392886a96741c2eb8222654
\ No newline at end of file
+a8f7d2e6c774fe67f34c2f81999b394c
\ No newline at end of file
diff --git a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.svg b/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.svg
index c817ebd59..dc67d8b81 100644
--- a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.svg
+++ b/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="110.5,-74.5 34.5,-74.5 34.5,-55.25 110.5,-55.25 110.5,-74.5"/>
 <text text-anchor="middle" x="72.5" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph_org.svg b/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph_org.svg
index 91dcbf896..9a8e4ed1b 100644
--- a/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph_org.svg
+++ b/d9/d85/structstd_1_1is__unsigned_3_01uint128__t_01_4__inherit__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="110.5,-74.5 34.5,-74.5 34.5,-55.25 110.5,-55.25 110.5,-74.5"/>
 <text text-anchor="middle" x="72.5" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/d9/d89/fibonacci_8cpp.html b/d9/d89/fibonacci_8cpp.html
index c2156b90e..31a0a49d5 100644
--- a/d9/d89/fibonacci_8cpp.html
+++ b/d9/d89/fibonacci_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/fibonacci.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/fibonacci.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for fibonacci.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d0f/fibonacci_8cpp__incl.svg" width="255" height="111"><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">
+</div>
+<p><a href="../../d9/d89/fibonacci_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -149,6 +168,8 @@ Functions</h2></td></tr>
 \[\text{fib}(n) = \text{fib}(n-1) + \text{fib}(n-2)\]
 </p>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../de/de4/fibonacci__large_8cpp.html" title="Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library ...">fibonacci_large.cpp</a>, <a class="el" href="../../d4/d32/fibonacci__fast_8cpp.html" title="Faster computation of Fibonacci series.">fibonacci_fast.cpp</a>, <a class="el" href="../../de/d47/string__fibonacci_8cpp.html" title="This Programme returns the Nth fibonacci as a string.">string_fibonacci.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/d89/fibonacci_8cpp_source.html">fibonacci.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="aeaaf5439cb29de4630c7dff2fd914b28" name="aeaaf5439cb29de4630c7dff2fd914b28"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aeaaf5439cb29de4630c7dff2fd914b28">&#9670;&#160;</a></span>fibonacci()</h2>
@@ -173,6 +194,8 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>n-th element of the Fibonacci's sequence </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d89/fibonacci_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../d9/d89/fibonacci_8cpp_source.html">fibonacci.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   32</span>                               {</div>
 <div class="line"><span class="lineno">   33</span>    <span class="comment">// If the input is 0 or 1 just return the same (Base Case)</span></div>
 <div class="line"><span class="lineno">   34</span>    <span class="comment">// This will set the first 2 values of the sequence</span></div>
@@ -204,17 +227,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d89/fibonacci_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../d9/d89/fibonacci_8cpp_source.html">fibonacci.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   64</span>           {</div>
 <div class="line"><span class="lineno">   65</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   66</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   67</span>}</div>
-<div class="ttc" id="afibonacci_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> fibonacci.cpp:49</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d89/fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afibonacci_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d89/fibonacci_8cpp_source.html#l00049">fibonacci.cpp:49</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -242,6 +262,8 @@ Here is the call graph for this function:</div>
 
 <p>Self-test implementation. </p>
 <dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d89/fibonacci_8cpp_source.html#l00049">49</a> of file <a class="el" href="../../d9/d89/fibonacci_8cpp_source.html">fibonacci.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   49</span>                   {</div>
 <div class="line"><span class="lineno">   50</span>    assert(math::fibonacci::fibonacci(0) == 0);</div>
 <div class="line"><span class="lineno">   51</span>    assert(math::fibonacci::fibonacci(1) == 1);</div>
@@ -250,9 +272,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   54</span>    assert(math::fibonacci::fibonacci(4) == 3);</div>
 <div class="line"><span class="lineno">   55</span>    assert(math::fibonacci::fibonacci(15) == 610);</div>
 <div class="line"><span class="lineno">   56</span>    assert(math::fibonacci::fibonacci(20) == 6765);</div>
-<div class="line"><span class="lineno">   57</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have passed successfully!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   57</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have passed successfully!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   58</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><!-- fragment -->
 </div>
 </div>
diff --git a/d9/d89/fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d89/fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 19c086a36..000000000
--- a/d9/d89/fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementation." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/d9/d89/fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d89/fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 1d8bd50d5..000000000
--- a/d9/d89/fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f7fe1edb2eb3a1db4663c8809409b97f
\ No newline at end of file
diff --git a/d9/d89/fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d89/fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 66dd17b5e..000000000
--- a/d9/d89/fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementation.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d89/fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/d89/fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index abff14eec..000000000
--- a/d9/d89/fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementation.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d89/fibonacci_8cpp_source.html b/d9/d89/fibonacci_8cpp_source.html
new file mode 100644
index 000000000..3ed6b12c0
--- /dev/null
+++ b/d9/d89/fibonacci_8cpp_source.html
@@ -0,0 +1,182 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/fibonacci.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d89/fibonacci_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">fibonacci.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/d89/fibonacci_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/d76/namespacefibonacci.html">fibonacci</a> {</div>
+<div class="foldopen" id="foldopen00032" data-start="{" data-end="}">
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../d9/d89/fibonacci_8cpp.html#aeaaf5439cb29de4630c7dff2fd914b28">   32</a></span>uint64_t <a class="code hl_namespace" href="../../df/d76/namespacefibonacci.html">fibonacci</a>(uint64_t n) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="comment">// If the input is 0 or 1 just return the same (Base Case)</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="comment">// This will set the first 2 values of the sequence</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordflow">if</span> (n &lt;= 1) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        <span class="keywordflow">return</span> n;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    }</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="comment">// Add the preceding 2 values of the sequence to get next</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d76/namespacefibonacci.html">fibonacci</a>(n - 1) + <a class="code hl_namespace" href="../../df/d76/namespacefibonacci.html">fibonacci</a>(n - 2);</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>}</div>
+</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>}  <span class="comment">// namespace fibonacci</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="foldopen" id="foldopen00049" data-start="{" data-end="}">
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"><a class="line" href="../../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   49</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    assert(math::fibonacci::fibonacci(0) == 0);</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    assert(math::fibonacci::fibonacci(1) == 1);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    assert(math::fibonacci::fibonacci(2) == 1);</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    assert(math::fibonacci::fibonacci(3) == 2);</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    assert(math::fibonacci::fibonacci(4) == 3);</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    assert(math::fibonacci::fibonacci(15) == 610);</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    assert(math::fibonacci::fibonacci(20) == 6765);</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have passed successfully!\n&quot;</span>;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}</div>
+</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="foldopen" id="foldopen00064" data-start="{" data-end="}">
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   64</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <a class="code hl_function" href="../../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>}</div>
+</div>
+<div class="ttc" id="afibonacci_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> <a href="#l00049">fibonacci.cpp:49</a></div></div>
+<div class="ttc" id="afibonacci_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00064">fibonacci.cpp:64</a></div></div>
+<div class="ttc" id="anamespacefibonacci_html"><div class="ttname"><a href="../../df/d76/namespacefibonacci.html">fibonacci</a></div><div class="ttdoc">Functions for Fibonacci sequence.</div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d9/d89/fibonacci_8cpp.html">fibonacci.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/d90/struct_btree.html b/d9/d90/struct_btree.html
index 5b85fc211..4cb0e0d74 100644
--- a/d9/d90/struct_btree.html
+++ b/d9/d90/struct_btree.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Btree Struct Reference</title>
+<title>TheAlgorithms/C++: Btree Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,18 +135,67 @@ Collaboration diagram for Btree:</div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a8377267e55cdc8b366ccb332312427cd" id="r_a8377267e55cdc8b366ccb332312427cd"><td class="memItemLeft" align="right" valign="top"><a id="a8377267e55cdc8b366ccb332312427cd" name="a8377267e55cdc8b366ccb332312427cd"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
+<tr class="memitem:a8377267e55cdc8b366ccb332312427cd" id="r_a8377267e55cdc8b366ccb332312427cd"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8377267e55cdc8b366ccb332312427cd">data</a></td></tr>
 <tr class="separator:a8377267e55cdc8b366ccb332312427cd"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a1e8d38ee6254e3fe11dde3540ce7301e" id="r_a1e8d38ee6254e3fe11dde3540ce7301e"><td class="memItemLeft" align="right" valign="top"><a id="a1e8d38ee6254e3fe11dde3540ce7301e" name="a1e8d38ee6254e3fe11dde3540ce7301e"></a>
-struct <a class="el" href="../../d9/d90/struct_btree.html">Btree</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>left</b></td></tr>
+<tr class="memitem:a1e8d38ee6254e3fe11dde3540ce7301e" id="r_a1e8d38ee6254e3fe11dde3540ce7301e"><td class="memItemLeft" align="right" valign="top">struct <a class="el" href="../../d9/d90/struct_btree.html">Btree</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1e8d38ee6254e3fe11dde3540ce7301e">left</a></td></tr>
 <tr class="separator:a1e8d38ee6254e3fe11dde3540ce7301e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a87e9234afb3e704333af3a2da6b905d3" id="r_a87e9234afb3e704333af3a2da6b905d3"><td class="memItemLeft" align="right" valign="top"><a id="a87e9234afb3e704333af3a2da6b905d3" name="a87e9234afb3e704333af3a2da6b905d3"></a>
-struct <a class="el" href="../../d9/d90/struct_btree.html">Btree</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>right</b></td></tr>
+<tr class="memitem:a87e9234afb3e704333af3a2da6b905d3" id="r_a87e9234afb3e704333af3a2da6b905d3"><td class="memItemLeft" align="right" valign="top">struct <a class="el" href="../../d9/d90/struct_btree.html">Btree</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a87e9234afb3e704333af3a2da6b905d3">right</a></td></tr>
 <tr class="separator:a87e9234afb3e704333af3a2da6b905d3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../d5/dc5/morrisinorder_8cpp_source.html#l00010">10</a> of file <a class="el" href="../../d5/dc5/morrisinorder_8cpp_source.html">morrisinorder.cpp</a>.</p>
+</div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="a8377267e55cdc8b366ccb332312427cd" name="a8377267e55cdc8b366ccb332312427cd"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a8377267e55cdc8b366ccb332312427cd">&#9670;&#160;</a></span>data</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int Btree::data</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d5/dc5/morrisinorder_8cpp_source.html#l00011">11</a> of file <a class="el" href="../../d5/dc5/morrisinorder_8cpp_source.html">morrisinorder.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a1e8d38ee6254e3fe11dde3540ce7301e" name="a1e8d38ee6254e3fe11dde3540ce7301e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a1e8d38ee6254e3fe11dde3540ce7301e">&#9670;&#160;</a></span>left</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">struct <a class="el" href="../../d9/d90/struct_btree.html">Btree</a>* Btree::left</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d5/dc5/morrisinorder_8cpp_source.html#l00012">12</a> of file <a class="el" href="../../d5/dc5/morrisinorder_8cpp_source.html">morrisinorder.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a87e9234afb3e704333af3a2da6b905d3" name="a87e9234afb3e704333af3a2da6b905d3"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a87e9234afb3e704333af3a2da6b905d3">&#9670;&#160;</a></span>right</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">struct <a class="el" href="../../d9/d90/struct_btree.html">Btree</a>* Btree::right</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d5/dc5/morrisinorder_8cpp_source.html#l00013">13</a> of file <a class="el" href="../../d5/dc5/morrisinorder_8cpp_source.html">morrisinorder.cpp</a>.</p>
+
+</div>
+</div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>data_structures/<b>morrisinorder.cpp</b></li>
+<li>data_structures/<a class="el" href="../../d5/dc5/morrisinorder_8cpp_source.html">morrisinorder.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d9/d92/chaining_8cpp.html b/d9/d92/chaining_8cpp.html
index 6b4da2bc8..5603f140b 100644
--- a/d9/d92/chaining_8cpp.html
+++ b/d9/d92/chaining_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: hashing/chaining.cpp File Reference</title>
+<title>TheAlgorithms/C++: hashing/chaining.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for chaining.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d57/chaining_8cpp__incl.svg" width="336" height="111"><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">
+</div>
+<p><a href="../../d9/d92/chaining_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d1c/classhash__chain.html">hash_chain</a></td></tr>
@@ -139,6 +158,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/vasutomar" target="_blank">vasutomar</a> </dd>
 <dd>
 <a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/d92/chaining_8cpp_source.html">chaining.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -155,42 +176,44 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p><dl class="section return"><dt>Returns</dt><dd><code>0</code> always </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d92/chaining_8cpp_source.html#l00133">133</a> of file <a class="el" href="../../d9/d92/chaining_8cpp_source.html">chaining.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  133</span>           {</div>
 <div class="line"><span class="lineno">  134</span>    <span class="keywordtype">int</span> c = 0, x = 0, mod = 0, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = 0;</div>
-<div class="line"><span class="lineno">  135</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the size of Hash Table. = &quot;</span> &lt;&lt; <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">  136</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; mod;</div>
+<div class="line"><span class="lineno">  135</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the size of Hash Table. = &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  136</span>    std::cin &gt;&gt; mod;</div>
 <div class="line"><span class="lineno">  137</span> </div>
 <div class="line"><span class="lineno">  138</span>    <a class="code hl_class" href="../../dd/d1c/classhash__chain.html">hash_chain</a> mychain(mod);</div>
 <div class="line"><span class="lineno">  139</span> </div>
 <div class="line"><span class="lineno">  140</span>    <span class="keywordtype">bool</span> loop = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  141</span>    <span class="keywordflow">while</span> (loop) {</div>
-<div class="line"><span class="lineno">  142</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  143</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;PLEASE CHOOSE -&quot;</span> &lt;&lt; <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">  144</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1. Add element.&quot;</span> &lt;&lt; <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">  145</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2. Find element.&quot;</span> &lt;&lt; <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">  146</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;3. Generate Hash.&quot;</span> &lt;&lt; <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">  147</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;4. Display Hash table.&quot;</span> &lt;&lt; <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">  148</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;5. Exit.&quot;</span> &lt;&lt; <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">  149</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; c;</div>
+<div class="line"><span class="lineno">  142</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  143</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;PLEASE CHOOSE -&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  144</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;1. Add element.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  145</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;2. Find element.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  146</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;3. Generate Hash.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  147</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;4. Display Hash table.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  148</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;5. Exit.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  149</span>        std::cin &gt;&gt; c;</div>
 <div class="line"><span class="lineno">  150</span>        <span class="keywordflow">switch</span> (c) {</div>
 <div class="line"><span class="lineno">  151</span>            <span class="keywordflow">case</span> 1:</div>
-<div class="line"><span class="lineno">  152</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter element to add = &quot;</span> &lt;&lt; <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">  153</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; x;</div>
+<div class="line"><span class="lineno">  152</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter element to add = &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  153</span>                std::cin &gt;&gt; x;</div>
 <div class="line"><span class="lineno">  154</span>                <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = mychain.hash(x);</div>
 <div class="line"><span class="lineno">  155</span>                <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = std::abs(<a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>);</div>
 <div class="line"><span class="lineno">  156</span>                mychain.add(x, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>);</div>
 <div class="line"><span class="lineno">  157</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  158</span>            <span class="keywordflow">case</span> 2:</div>
-<div class="line"><span class="lineno">  159</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter element to search = &quot;</span> &lt;&lt; <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">  160</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; x;</div>
+<div class="line"><span class="lineno">  159</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter element to search = &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  160</span>                std::cin &gt;&gt; x;</div>
 <div class="line"><span class="lineno">  161</span>                <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = mychain.hash(x);</div>
 <div class="line"><span class="lineno">  162</span>                mychain.find(x, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>);</div>
 <div class="line"><span class="lineno">  163</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  164</span>            <span class="keywordflow">case</span> 3:</div>
-<div class="line"><span class="lineno">  165</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter element to generate hash = &quot;</span> &lt;&lt; <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">  166</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; x;</div>
-<div class="line"><span class="lineno">  167</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hash of &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; is = &quot;</span> &lt;&lt; mychain.hash(x)</div>
-<div class="line"><span class="lineno">  168</span>                          &lt;&lt; <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">  165</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter element to generate hash = &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  166</span>                std::cin &gt;&gt; x;</div>
+<div class="line"><span class="lineno">  167</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Hash of &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; is = &quot;</span> &lt;&lt; mychain.hash(x)</div>
+<div class="line"><span class="lineno">  168</span>                          &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  169</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  170</span>            <span class="keywordflow">case</span> 4:</div>
 <div class="line"><span class="lineno">  171</span>                mychain.display();</div>
@@ -199,7 +222,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  174</span>                loop = <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  175</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  176</span>        }</div>
-<div class="line"><span class="lineno">  177</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  177</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  178</span>    }</div>
 <div class="line"><span class="lineno">  179</span>    <span class="comment">/*add(1,&amp;head1);</span></div>
 <div class="line"><span class="lineno">  180</span><span class="comment">    add(2,&amp;head1);</span></div>
@@ -209,17 +232,9 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  184</span><span class="comment">    display(&amp;head2);*/</span></div>
 <div class="line"><span class="lineno">  185</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  186</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="aclasshash__chain_html"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html">hash_chain</a></div><div class="ttdoc">Chain class with a given modulus.</div><div class="ttdef"><b>Definition</b> chaining.cpp:16</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="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> hash_search.cpp:45</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d92/chaining_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="364" height="288"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclasshash__chain_html"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html">hash_chain</a></div><div class="ttdoc">Chain class with a given modulus.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d92/chaining_8cpp_source.html#l00016">chaining.cpp:16</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00045">hash_search.cpp:45</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/d92/chaining_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d92/chaining_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 63e92e518..000000000
--- a/d9/d92/chaining_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,132,55,158"/>
-<area shape="rect" id="Node000002" href="$dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff" title="create and add a new node with a give value and at a given height" alt="" coords="113,5,229,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="36,130,62,91,101,48,119,36,122,41,104,52,66,94,41,133"/>
-<area shape="rect" id="Node000003" href="$d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" title=" " alt="" coords="303,56,342,82"/>
-<area shape="poly" id="edge9_Node000001_Node000003" title=" " alt="" coords="44,129,69,109,102,92,151,77,202,69,288,65,288,70,203,74,152,82,104,97,72,114,47,134"/>
-<area shape="rect" id="Node000004" href="$dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed" title="Display the chain." alt="" coords="103,156,239,182"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="55,146,88,152,87,157,54,152"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="287,156,358,182"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="47,156,72,176,104,192,147,199,191,199,234,193,271,183,273,189,235,198,192,204,146,205,102,197,69,180,44,160"/>
-<area shape="rect" id="Node000006" href="$dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a" title="Find if a value and corresponding hash exist." alt="" coords="113,107,229,132"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="54,138,97,130,98,135,55,143"/>
-<area shape="rect" id="Node000007" href="$dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64" title="Compute the hash of a value for current chain." alt="" coords="109,257,232,283"/>
-<area shape="poly" id="edge10_Node000001_Node000007" title=" " alt="" coords="41,156,66,195,104,236,122,248,119,252,101,240,62,198,36,159"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="213,29,289,55,288,60,211,34"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="239,166,271,166,271,172,239,172"/>
-<area shape="poly" id="edge8_Node000006_Node000003" title=" " alt="" coords="211,104,288,77,289,82,213,109"/>
-<area shape="poly" id="edge7_Node000006_Node000005" title=" " alt="" coords="214,130,273,150,272,155,212,136"/>
-</map>
diff --git a/d9/d92/chaining_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d92/chaining_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index bb4df6bb2..000000000
--- a/d9/d92/chaining_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-16475ee34d82480eae3c7aa7e1475989
\ No newline at end of file
diff --git a/d9/d92/chaining_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d92/chaining_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index ae4161d5f..000000000
--- a/d9/d92/chaining_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,191 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="273pt" height="216pt"
- viewBox="0.00 0.00 272.75 216.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 212.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-113.25 0,-113.25 0,-94 37,-94 37,-113.25"/>
-<text text-anchor="middle" x="18.5" y="-99.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff" target="_top" xlink:title="create and add a new node with a give value and at a given height">
-<polygon fill="white" stroke="#666666" points="167.75,-208.25 80.5,-208.25 80.5,-189 167.75,-189 167.75,-208.25"/>
-<text text-anchor="middle" x="124.12" y="-194.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain::add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.88,-113.53C33.39,-128.45 51.26,-156.84 73,-174.62 76.97,-177.87 81.46,-180.81 86.07,-183.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.38,-186.49 94.88,-187.93 87.57,-180.26 84.38,-186.49"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.4,-170.25 223.6,-170.25 223.6,-151 252.4,-151 252.4,-170.25"/>
-<text text-anchor="middle" x="238" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge9_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge9_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.02,-113.57C40.17,-122.54 56.41,-135.26 73,-141.62 119.74,-159.57 179.06,-161.87 212.02,-161.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="211.84,-165.03 221.77,-161.32 211.7,-158.03 211.84,-165.03"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed" target="_top" xlink:title="Display the chain.">
-<polygon fill="white" stroke="#666666" points="175.25,-95.25 73,-95.25 73,-76 175.25,-76 175.25,-95.25"/>
-<text text-anchor="middle" x="124.12" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain::display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.08,-100.57C44.14,-99.35 52.74,-97.85 61.73,-96.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.08,-99.78 71.33,-94.62 60.88,-92.88 62.08,-99.78"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.75,-95.25 211.25,-95.25 211.25,-76 264.75,-76 264.75,-95.25"/>
-<text text-anchor="middle" x="238" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.91,-93.5C40,-84.47 56.18,-71.87 73,-66.62 115.28,-53.43 166.28,-63.09 200.06,-72.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.78,-76.09 209.37,-75.65 200.82,-69.39 198.78,-76.09"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a" target="_top" xlink:title="Find if a value and corresponding hash exist.">
-<polygon fill="white" stroke="#666666" points="167.75,-132.25 80.5,-132.25 80.5,-113 167.75,-113 167.75,-132.25"/>
-<text text-anchor="middle" x="124.12" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.08,-106.85C46.09,-108.5 57.61,-110.61 69.26,-112.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.45,-116.16 78.92,-114.52 69.71,-109.27 68.45,-116.16"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64" target="_top" xlink:title="Compute the hash of a value for current chain.">
-<polygon fill="white" stroke="#666666" points="170.38,-19.25 77.88,-19.25 77.88,0 170.38,0 170.38,-19.25"/>
-<text text-anchor="middle" x="124.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain::hash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge10_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge10_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.91,-93.86C33.47,-79.15 51.4,-51.18 73,-33.62 76.98,-30.39 81.47,-27.46 86.09,-24.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.59,-28.02 94.9,-20.35 84.4,-21.79 87.59,-28.02"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.81,-188.54C172.8,-182.43 195.47,-174.73 212.44,-168.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.38,-172.34 221.72,-165.81 211.13,-165.72 213.38,-172.34"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.5,-85.62C183.49,-85.62 191.64,-85.62 199.27,-85.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="199.25,-89.13 209.25,-85.63 199.25,-82.13 199.25,-89.13"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge8_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge8_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.81,-132.71C172.8,-138.82 195.47,-146.52 212.44,-152.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="211.13,-155.53 221.72,-155.44 213.38,-148.91 211.13,-155.53"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge7_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge7_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.7,-112.51C169.51,-107.95 185.95,-102.51 200.41,-97.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.19,-101.16 209.58,-94.69 198.99,-94.51 201.19,-101.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/d92/chaining_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/d92/chaining_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 395a2cc44..000000000
--- a/d9/d92/chaining_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,165 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="273pt" height="216pt"
- viewBox="0.00 0.00 272.75 216.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 212.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-113.25 0,-113.25 0,-94 37,-94 37,-113.25"/>
-<text text-anchor="middle" x="18.5" y="-99.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff" target="_top" xlink:title="create and add a new node with a give value and at a given height">
-<polygon fill="white" stroke="#666666" points="167.75,-208.25 80.5,-208.25 80.5,-189 167.75,-189 167.75,-208.25"/>
-<text text-anchor="middle" x="124.12" y="-194.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain::add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.88,-113.53C33.39,-128.45 51.26,-156.84 73,-174.62 76.97,-177.87 81.46,-180.81 86.07,-183.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.38,-186.49 94.88,-187.93 87.57,-180.26 84.38,-186.49"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.4,-170.25 223.6,-170.25 223.6,-151 252.4,-151 252.4,-170.25"/>
-<text text-anchor="middle" x="238" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge9_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge9_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.02,-113.57C40.17,-122.54 56.41,-135.26 73,-141.62 119.74,-159.57 179.06,-161.87 212.02,-161.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="211.84,-165.03 221.77,-161.32 211.7,-158.03 211.84,-165.03"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed" target="_top" xlink:title="Display the chain.">
-<polygon fill="white" stroke="#666666" points="175.25,-95.25 73,-95.25 73,-76 175.25,-76 175.25,-95.25"/>
-<text text-anchor="middle" x="124.12" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain::display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.08,-100.57C44.14,-99.35 52.74,-97.85 61.73,-96.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.08,-99.78 71.33,-94.62 60.88,-92.88 62.08,-99.78"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.75,-95.25 211.25,-95.25 211.25,-76 264.75,-76 264.75,-95.25"/>
-<text text-anchor="middle" x="238" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.91,-93.5C40,-84.47 56.18,-71.87 73,-66.62 115.28,-53.43 166.28,-63.09 200.06,-72.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.78,-76.09 209.37,-75.65 200.82,-69.39 198.78,-76.09"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a" target="_top" xlink:title="Find if a value and corresponding hash exist.">
-<polygon fill="white" stroke="#666666" points="167.75,-132.25 80.5,-132.25 80.5,-113 167.75,-113 167.75,-132.25"/>
-<text text-anchor="middle" x="124.12" y="-118.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.08,-106.85C46.09,-108.5 57.61,-110.61 69.26,-112.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.45,-116.16 78.92,-114.52 69.71,-109.27 68.45,-116.16"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64" target="_top" xlink:title="Compute the hash of a value for current chain.">
-<polygon fill="white" stroke="#666666" points="170.38,-19.25 77.88,-19.25 77.88,0 170.38,0 170.38,-19.25"/>
-<text text-anchor="middle" x="124.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain::hash</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge10_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge10_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.91,-93.86C33.47,-79.15 51.4,-51.18 73,-33.62 76.98,-30.39 81.47,-27.46 86.09,-24.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.59,-28.02 94.9,-20.35 84.4,-21.79 87.59,-28.02"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.81,-188.54C172.8,-182.43 195.47,-174.73 212.44,-168.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.38,-172.34 221.72,-165.81 211.13,-165.72 213.38,-172.34"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.5,-85.62C183.49,-85.62 191.64,-85.62 199.27,-85.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="199.25,-89.13 209.25,-85.63 199.25,-82.13 199.25,-89.13"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge8_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge8_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.81,-132.71C172.8,-138.82 195.47,-146.52 212.44,-152.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="211.13,-155.53 221.72,-155.44 213.38,-148.91 211.13,-155.53"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge7_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge7_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.7,-112.51C169.51,-107.95 185.95,-102.51 200.41,-97.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.19,-101.16 209.58,-94.69 198.99,-94.51 201.19,-101.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/d92/chaining_8cpp_source.html b/d9/d92/chaining_8cpp_source.html
new file mode 100644
index 000000000..e53fb2429
--- /dev/null
+++ b/d9/d92/chaining_8cpp_source.html
@@ -0,0 +1,303 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: hashing/chaining.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/d92/chaining_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">chaining.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/d92/chaining_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;memory&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="foldopen" id="foldopen00016" data-start="{" data-end="};">
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"><a class="line" href="../../dd/d1c/classhash__chain.html">   16</a></span><span class="keyword">class </span><a class="code hl_class" href="../../dd/d1c/classhash__chain.html">hash_chain</a> {</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> <span class="keyword">private</span>:</div>
+<div class="foldopen" id="foldopen00021" data-start="{" data-end="};">
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"><a class="line" href="../../dd/d1c/classhash__chain.html#a8b204861e9470377c956d3b5cd313036">   21</a></span>    <span class="keyword">using </span><a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> = <span class="keyword">struct </span><a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>{};                         </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        std::shared_ptr&lt;struct Node&gt; next;  </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    };</div>
+</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"><a class="line" href="../../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0">   26</a></span>    std::vector&lt;std::shared_ptr&lt;Node&gt;&gt; <a class="code hl_variable" href="../../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0">head</a>;  </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2">   27</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2">_mod</a>;                                 </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00035" data-start="{" data-end="}">
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595">   35</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595">hash_chain</a>(<span class="keywordtype">int</span> mod) : <a class="code hl_variable" href="../../dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2">_mod</a>(mod) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        <span class="keywordflow">while</span> (mod--) <a class="code hl_variable" href="../../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0">head</a>.push_back(<span class="keyword">nullptr</span>);</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    }</div>
+</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="foldopen" id="foldopen00045" data-start="{" data-end="}">
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="../../dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff">   45</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff">add</a>(<span class="keywordtype">int</span> x, <span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        std::shared_ptr&lt;Node&gt; curr;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        std::shared_ptr&lt;Node&gt; temp(<span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>);</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        temp-&gt;data = x;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        temp-&gt;next = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordflow">if</span> (!<a class="code hl_variable" href="../../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0">head</a>[<a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>]) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>            <a class="code hl_variable" href="../../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0">head</a>[<a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>] = temp;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            curr = <a class="code hl_variable" href="../../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0">head</a>[<a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>];</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            curr = <a class="code hl_variable" href="../../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0">head</a>[<a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>];</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            <span class="keywordflow">while</span> (curr-&gt;next) curr = curr-&gt;next;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            curr-&gt;next = temp;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        }</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    }</div>
+</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="foldopen" id="foldopen00063" data-start="{" data-end="}">
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"><a class="line" href="../../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed">   63</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed">display</a>() {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        std::shared_ptr&lt;Node&gt; temp = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <span class="keywordtype">int</span> i = 0;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2">_mod</a>; i++) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            <span class="keywordflow">if</span> (!<a class="code hl_variable" href="../../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0">head</a>[i]) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Key &quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; is empty&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Key &quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; has values = &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>                temp = <a class="code hl_variable" href="../../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0">head</a>[i];</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>                <span class="keywordflow">while</span> (temp-&gt;next) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>                    std::cout &lt;&lt; temp-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>                    temp = temp-&gt;next;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>                }</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>                std::cout &lt;&lt; temp-&gt;data;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>                std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            }</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    }</div>
+</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"><a class="line" href="../../dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64">   91</a></span>    <span class="keyword">virtual</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64">hash</a>(<span class="keywordtype">int</span> x)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> x % <a class="code hl_variable" href="../../dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2">_mod</a>; }</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="foldopen" id="foldopen00101" data-start="{" data-end="}">
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"><a class="line" href="../../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a">  101</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a">find</a>(<span class="keywordtype">int</span> x, <span class="keywordtype">int</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        std::shared_ptr&lt;Node&gt; temp = <a class="code hl_variable" href="../../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0">head</a>[<a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>];</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        <span class="keywordflow">if</span> (!<a class="code hl_variable" href="../../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0">head</a>[<a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>]) {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>            <span class="comment">// index does not exist!</span></div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Element not found&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        }</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        <span class="comment">// scan for data value</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        <span class="keywordflow">while</span> (temp-&gt;data != x &amp;&amp; temp-&gt;next) temp = temp-&gt;next;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        <span class="keywordflow">if</span> (temp-&gt;next) {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Element found&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        }</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        <span class="comment">// implicit else condition</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        <span class="comment">// i.e., temp-&gt;next == nullptr</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>        <span class="keywordflow">if</span> (temp-&gt;data == x) {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Element found&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        }</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        <span class="comment">// further implicit else condition</span></div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Element not found&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    }</div>
+</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>};</div>
+</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
+<div class="foldopen" id="foldopen00133" data-start="{" data-end="}">
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"><a class="line" href="../../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  133</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <span class="keywordtype">int</span> c = 0, x = 0, mod = 0, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = 0;</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the size of Hash Table. = &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    std::cin &gt;&gt; mod;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span> </div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <a class="code hl_class" href="../../dd/d1c/classhash__chain.html">hash_chain</a> mychain(mod);</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span> </div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="keywordtype">bool</span> loop = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <span class="keywordflow">while</span> (loop) {</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;PLEASE CHOOSE -&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;1. Add element.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;2. Find element.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;3. Generate Hash.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;4. Display Hash table.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;5. Exit.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        std::cin &gt;&gt; c;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>        <span class="keywordflow">switch</span> (c) {</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>            <span class="keywordflow">case</span> 1:</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter element to add = &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>                std::cin &gt;&gt; x;</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>                <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = mychain.<a class="code hl_function" href="../../dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64">hash</a>(x);</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>                <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = std::abs(<a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>);</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>                mychain.<a class="code hl_function" href="../../dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff">add</a>(x, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>);</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>            <span class="keywordflow">case</span> 2:</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter element to search = &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>                std::cin &gt;&gt; x;</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>                <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = mychain.<a class="code hl_function" href="../../dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64">hash</a>(x);</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>                mychain.<a class="code hl_function" href="../../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a">find</a>(x, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>);</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>            <span class="keywordflow">case</span> 3:</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter element to generate hash = &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>                std::cin &gt;&gt; x;</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Hash of &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; is = &quot;</span> &lt;&lt; mychain.<a class="code hl_function" href="../../dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64">hash</a>(x)</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>                          &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>            <span class="keywordflow">case</span> 4:</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>                mychain.<a class="code hl_function" href="../../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed">display</a>();</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>            <span class="keywordflow">default</span>:</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>                loop = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        }</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    }</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    <span class="comment">/*add(1,&amp;head1);</span></div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span><span class="comment">    add(2,&amp;head1);</span></div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span><span class="comment">    add(3,&amp;head2);</span></div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span><span class="comment">    add(5,&amp;head1);</span></div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span><span class="comment">    display(&amp;head1);</span></div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span><span class="comment">    display(&amp;head2);*/</span></div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>}</div>
+</div>
+<div class="ttc" id="achaining_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00133">chaining.cpp:133</a></div></div>
+<div class="ttc" id="aclasshash__chain_html"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html">hash_chain</a></div><div class="ttdoc">Chain class with a given modulus.</div><div class="ttdef"><b>Definition</b> <a href="#l00016">chaining.cpp:16</a></div></div>
+<div class="ttc" id="aclasshash__chain_html_a55aa5c6753cb8853152d469c375d946a"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a">hash_chain::find</a></div><div class="ttdeci">bool find(int x, int h) const</div><div class="ttdoc">Find if a value and corresponding hash exist.</div><div class="ttdef"><b>Definition</b> <a href="#l00101">chaining.cpp:101</a></div></div>
+<div class="ttc" id="aclasshash__chain_html_a6b4b4de1a8c96f98a63a77f650a9dcff"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff">hash_chain::add</a></div><div class="ttdeci">void add(int x, int h)</div><div class="ttdoc">create and add a new node with a give value and at a given height</div><div class="ttdef"><b>Definition</b> <a href="#l00045">chaining.cpp:45</a></div></div>
+<div class="ttc" id="aclasshash__chain_html_a706964ad13587fc9a8b3fe8381d410ed"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed">hash_chain::display</a></div><div class="ttdeci">void display()</div><div class="ttdoc">Display the chain.</div><div class="ttdef"><b>Definition</b> <a href="#l00063">chaining.cpp:63</a></div></div>
+<div class="ttc" id="aclasshash__chain_html_a80c8b902a15b4fd062ed727ecf8f3595"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595">hash_chain::hash_chain</a></div><div class="ttdeci">hash_chain(int mod)</div><div class="ttdoc">Construct a new chain object.</div><div class="ttdef"><b>Definition</b> <a href="#l00035">chaining.cpp:35</a></div></div>
+<div class="ttc" id="aclasshash__chain_html_a846a2f921f8fb7ea572e03901b671d64"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64">hash_chain::hash</a></div><div class="ttdeci">virtual int hash(int x) const</div><div class="ttdoc">Compute the hash of a value for current chain.</div><div class="ttdef"><b>Definition</b> <a href="#l00091">chaining.cpp:91</a></div></div>
+<div class="ttc" id="aclasshash__chain_html_ae8457d13620497fa2046ac566252c4b0"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0">hash_chain::head</a></div><div class="ttdeci">std::vector&lt; std::shared_ptr&lt; Node &gt; &gt; head</div><div class="ttdoc">array of nodes</div><div class="ttdef"><b>Definition</b> <a href="#l00026">chaining.cpp:26</a></div></div>
+<div class="ttc" id="aclasshash__chain_html_ae9ddce410015ed8dda6380130d82d6c2"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2">hash_chain::_mod</a></div><div class="ttdeci">int _mod</div><div class="ttdoc">modulus of the class</div><div class="ttdef"><b>Definition</b> <a href="#l00027">chaining.cpp:27</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00045">hash_search.cpp:45</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_ece9b94c107bbaa1dd68197a8c9983b9.html">hashing</a></li><li class="navelem"><a class="el" href="../../d9/d92/chaining_8cpp.html">chaining.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/da2/exponential__dist_8cpp.html b/d9/da2/exponential__dist_8cpp.html
index 5fa751c9e..5699d86a0 100644
--- a/d9/da2/exponential__dist_8cpp.html
+++ b/d9/da2/exponential__dist_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: probability/exponential_dist.cpp File Reference</title>
+<title>TheAlgorithms/C++: probability/exponential_dist.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for exponential_dist.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d5e/exponential__dist_8cpp__incl.svg" width="431" height="126"><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">
+</div>
+<p><a href="../../d9/da2/exponential__dist_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/ded/namespaceprobability.html">probability</a></td></tr>
@@ -158,6 +177,8 @@ Functions</h2></td></tr>
 \[P(x, \lambda) = \lambda e^{-\lambda x}\]
 </p>
 <p>Summary of variables used: \(\lambda\) : rate parameter </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/da2/exponential__dist_8cpp_source.html">exponential_dist.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a1c8b6e787f72a209ef96c096eedf7afc" name="a1c8b6e787f72a209ef96c096eedf7afc"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a1c8b6e787f72a209ef96c096eedf7afc">&#9670;&#160;</a></span>exponential_expected()</h2>
@@ -179,19 +200,15 @@ Functions</h2></td></tr>
 \[\mu = \frac{1}{\lambda}\]
 </p>
  </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/da2/exponential__dist_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../d9/da2/exponential__dist_8cpp_source.html">exponential_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   37</span>                                           {</div>
 <div class="line"><span class="lineno">   38</span>    <span class="keywordflow">if</span> (lambda &lt;= 0) {</div>
-<div class="line"><span class="lineno">   39</span>        <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>(<span class="stringliteral">&quot;lambda must be greater than 0&quot;</span>);</div>
+<div class="line"><span class="lineno">   39</span>        <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;lambda must be greater than 0&quot;</span>);</div>
 <div class="line"><span class="lineno">   40</span>    }</div>
 <div class="line"><span class="lineno">   41</span>    <span class="keywordflow">return</span> 1 / lambda;</div>
 <div class="line"><span class="lineno">   42</span>}</div>
-<div class="ttc" id="ainvalid_argument_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/da2/exponential__dist_8cpp_a1c8b6e787f72a209ef96c096eedf7afc_cgraph.svg" width="195" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac7b0091e17479d47438a281fefc2549a" name="ac7b0091e17479d47438a281fefc2549a"></a>
@@ -214,18 +231,15 @@ Here is the call graph for this function:</div>
 \[\sigma = \frac{1}{\lambda}\]
 </p>
  </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/da2/exponential__dist_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d9/da2/exponential__dist_8cpp_source.html">exponential_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   59</span>                                      {</div>
 <div class="line"><span class="lineno">   60</span>    <span class="keywordflow">if</span> (lambda &lt;= 0) {</div>
-<div class="line"><span class="lineno">   61</span>        <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>(<span class="stringliteral">&quot;lambda must be greater than 0&quot;</span>);</div>
+<div class="line"><span class="lineno">   61</span>        <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;lambda must be greater than 0&quot;</span>);</div>
 <div class="line"><span class="lineno">   62</span>    }</div>
 <div class="line"><span class="lineno">   63</span>    <span class="keywordflow">return</span> 1 / lambda;</div>
 <div class="line"><span class="lineno">   64</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/da2/exponential__dist_8cpp_ac7b0091e17479d47438a281fefc2549a_cgraph.svg" width="159" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af435dbeb43a05c8c7785f53bf4ce1df1" name="af435dbeb43a05c8c7785f53bf4ce1df1"></a>
@@ -248,19 +262,15 @@ Here is the call graph for this function:</div>
 \[\sigma^2 = \frac{1}{\lambda^2}\]
 </p>
  </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/da2/exponential__dist_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../d9/da2/exponential__dist_8cpp_source.html">exponential_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   48</span>                                      {</div>
 <div class="line"><span class="lineno">   49</span>    <span class="keywordflow">if</span> (lambda &lt;= 0) {</div>
-<div class="line"><span class="lineno">   50</span>        <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>(<span class="stringliteral">&quot;lambda must be greater than 0&quot;</span>);</div>
+<div class="line"><span class="lineno">   50</span>        <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;lambda must be greater than 0&quot;</span>);</div>
 <div class="line"><span class="lineno">   51</span>    }</div>
-<div class="line"><span class="lineno">   52</span>    <span class="keywordflow">return</span> 1 / <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">pow</a>(lambda, 2);</div>
+<div class="line"><span class="lineno">   52</span>    <span class="keywordflow">return</span> 1 / pow(lambda, 2);</div>
 <div class="line"><span class="lineno">   53</span>}</div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/da2/exponential__dist_8cpp_af435dbeb43a05c8c7785f53bf4ce1df1_cgraph.svg" width="159" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -280,17 +290,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/da2/exponential__dist_8cpp_source.html#l00148">148</a> of file <a class="el" href="../../d9/da2/exponential__dist_8cpp_source.html">exponential_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  148</span>           {</div>
 <div class="line"><span class="lineno">  149</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Self test implementation</span></div>
 <div class="line"><span class="lineno">  150</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  151</span>}</div>
-<div class="ttc" id="aexponential__dist_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> exponential_dist.cpp:72</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/da2/exponential__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="346" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aexponential__dist_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/da2/exponential__dist_8cpp_source.html#l00072">exponential_dist.cpp:72</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -318,6 +325,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/da2/exponential__dist_8cpp_source.html#l00072">72</a> of file <a class="el" href="../../d9/da2/exponential__dist_8cpp_source.html">exponential_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   72</span>                   {</div>
 <div class="line"><span class="lineno">   73</span>    <span class="keywordtype">double</span> lambda_1 = 1;</div>
 <div class="line"><span class="lineno">   74</span>    <span class="keywordtype">double</span> expected_1 = 1;</div>
@@ -339,7 +348,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   90</span> </div>
 <div class="line"><span class="lineno">   91</span>    <span class="keyword">const</span> <span class="keywordtype">float</span> threshold = 1e-3f;</div>
 <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/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test for lambda = 1 \n&quot;</span>;</div>
+<div class="line"><span class="lineno">   93</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test for lambda = 1 \n&quot;</span>;</div>
 <div class="line"><span class="lineno">   94</span>    assert(</div>
 <div class="line"><span class="lineno">   95</span>        std::abs(expected_1 - probability::geometric_dist::exponential_expected(</div>
 <div class="line"><span class="lineno">   96</span>                                  lambda_1)) &lt; threshold);</div>
@@ -347,9 +356,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   98</span>                                lambda_1)) &lt; threshold);</div>
 <div class="line"><span class="lineno">   99</span>    assert(std::abs(std_1 - probability::geometric_dist::exponential_std(</div>
 <div class="line"><span class="lineno">  100</span>                                lambda_1)) &lt; threshold);</div>
-<div class="line"><span class="lineno">  101</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;ALL TEST PASSED\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ALL TEST PASSED\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  102</span> </div>
-<div class="line"><span class="lineno">  103</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test for lambda = 2 \n&quot;</span>;</div>
+<div class="line"><span class="lineno">  103</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test for lambda = 2 \n&quot;</span>;</div>
 <div class="line"><span class="lineno">  104</span>    assert(</div>
 <div class="line"><span class="lineno">  105</span>        std::abs(expected_2 - probability::geometric_dist::exponential_expected(</div>
 <div class="line"><span class="lineno">  106</span>                                  lambda_2)) &lt; threshold);</div>
@@ -357,9 +366,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  108</span>                                lambda_2)) &lt; threshold);</div>
 <div class="line"><span class="lineno">  109</span>    assert(std::abs(std_2 - probability::geometric_dist::exponential_std(</div>
 <div class="line"><span class="lineno">  110</span>                                lambda_2)) &lt; threshold);</div>
-<div class="line"><span class="lineno">  111</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;ALL TEST PASSED\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ALL TEST PASSED\n\n&quot;</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> &lt;&lt; <span class="stringliteral">&quot;Test for lambda = 3 \n&quot;</span>;</div>
+<div class="line"><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test for lambda = 3 \n&quot;</span>;</div>
 <div class="line"><span class="lineno">  114</span>    assert(</div>
 <div class="line"><span class="lineno">  115</span>        std::abs(expected_3 - probability::geometric_dist::exponential_expected(</div>
 <div class="line"><span class="lineno">  116</span>                                  lambda_3)) &lt; threshold);</div>
@@ -367,40 +376,32 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  118</span>                                lambda_3)) &lt; threshold);</div>
 <div class="line"><span class="lineno">  119</span>    assert(std::abs(std_3 - probability::geometric_dist::exponential_std(</div>
 <div class="line"><span class="lineno">  120</span>                                lambda_3)) &lt; threshold);</div>
-<div class="line"><span class="lineno">  121</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;ALL TEST PASSED\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  121</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ALL TEST PASSED\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  122</span> </div>
-<div class="line"><span class="lineno">  123</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test for lambda = 0 \n&quot;</span>;</div>
+<div class="line"><span class="lineno">  123</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test for lambda = 0 \n&quot;</span>;</div>
 <div class="line"><span class="lineno">  124</span>    <span class="keywordflow">try</span> {</div>
 <div class="line"><span class="lineno">  125</span>        <a class="code hl_function" href="#a1c8b6e787f72a209ef96c096eedf7afc">probability::geometric_dist::exponential_expected</a>(lambda_4);</div>
 <div class="line"><span class="lineno">  126</span>        <a class="code hl_function" href="#af435dbeb43a05c8c7785f53bf4ce1df1">probability::geometric_dist::exponential_var</a>(lambda_4);</div>
 <div class="line"><span class="lineno">  127</span>        <a class="code hl_function" href="#ac7b0091e17479d47438a281fefc2549a">probability::geometric_dist::exponential_std</a>(lambda_4);</div>
-<div class="line"><span class="lineno">  128</span>    } <span class="keywordflow">catch</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>&amp; err) {</div>
-<div class="line"><span class="lineno">  129</span>        assert(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>(err.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/exception/what.html">what</a>()) == <span class="stringliteral">&quot;lambda must be greater than 0&quot;</span>);</div>
+<div class="line"><span class="lineno">  128</span>    } <span class="keywordflow">catch</span> (std::invalid_argument&amp; err) {</div>
+<div class="line"><span class="lineno">  129</span>        assert(std::string(err.what()) == <span class="stringliteral">&quot;lambda must be greater than 0&quot;</span>);</div>
 <div class="line"><span class="lineno">  130</span>    }</div>
-<div class="line"><span class="lineno">  131</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;ALL TEST PASSED\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  131</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ALL TEST PASSED\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  132</span> </div>
-<div class="line"><span class="lineno">  133</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test for lambda = -2.3 \n&quot;</span>;</div>
+<div class="line"><span class="lineno">  133</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test for lambda = -2.3 \n&quot;</span>;</div>
 <div class="line"><span class="lineno">  134</span>    <span class="keywordflow">try</span> {</div>
 <div class="line"><span class="lineno">  135</span>        <a class="code hl_function" href="#a1c8b6e787f72a209ef96c096eedf7afc">probability::geometric_dist::exponential_expected</a>(lambda_5);</div>
 <div class="line"><span class="lineno">  136</span>        <a class="code hl_function" href="#af435dbeb43a05c8c7785f53bf4ce1df1">probability::geometric_dist::exponential_var</a>(lambda_5);</div>
 <div class="line"><span class="lineno">  137</span>        <a class="code hl_function" href="#ac7b0091e17479d47438a281fefc2549a">probability::geometric_dist::exponential_std</a>(lambda_5);</div>
-<div class="line"><span class="lineno">  138</span>    } <span class="keywordflow">catch</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>&amp; err) {</div>
-<div class="line"><span class="lineno">  139</span>        assert(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>(err.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/exception/what.html">what</a>()) == <span class="stringliteral">&quot;lambda must be greater than 0&quot;</span>);</div>
+<div class="line"><span class="lineno">  138</span>    } <span class="keywordflow">catch</span> (std::invalid_argument&amp; err) {</div>
+<div class="line"><span class="lineno">  139</span>        assert(std::string(err.what()) == <span class="stringliteral">&quot;lambda must be greater than 0&quot;</span>);</div>
 <div class="line"><span class="lineno">  140</span>    }</div>
-<div class="line"><span class="lineno">  141</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;ALL TEST PASSED\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  141</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ALL TEST PASSED\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  142</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="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="aexponential__dist_8cpp_html_a1c8b6e787f72a209ef96c096eedf7afc"><div class="ttname"><a href="#a1c8b6e787f72a209ef96c096eedf7afc">probability::geometric_dist::exponential_expected</a></div><div class="ttdeci">double exponential_expected(double lambda)</div><div class="ttdoc">the expected value of the exponential distribution</div><div class="ttdef"><b>Definition</b> exponential_dist.cpp:37</div></div>
-<div class="ttc" id="aexponential__dist_8cpp_html_ac7b0091e17479d47438a281fefc2549a"><div class="ttname"><a href="#ac7b0091e17479d47438a281fefc2549a">probability::geometric_dist::exponential_std</a></div><div class="ttdeci">double exponential_std(double lambda)</div><div class="ttdoc">the standard deviation of the exponential distribution</div><div class="ttdef"><b>Definition</b> exponential_dist.cpp:59</div></div>
-<div class="ttc" id="aexponential__dist_8cpp_html_af435dbeb43a05c8c7785f53bf4ce1df1"><div class="ttname"><a href="#af435dbeb43a05c8c7785f53bf4ce1df1">probability::geometric_dist::exponential_var</a></div><div class="ttdeci">double exponential_var(double lambda)</div><div class="ttdoc">the variance of the exponential distribution</div><div class="ttdef"><b>Definition</b> exponential_dist.cpp:48</div></div>
-<div class="ttc" id="awhat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/exception/what.html">std::invalid_argument::what</a></div><div class="ttdeci">T what(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/da2/exponential__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="248" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aexponential__dist_8cpp_html_a1c8b6e787f72a209ef96c096eedf7afc"><div class="ttname"><a href="#a1c8b6e787f72a209ef96c096eedf7afc">probability::geometric_dist::exponential_expected</a></div><div class="ttdeci">double exponential_expected(double lambda)</div><div class="ttdoc">the expected value of the exponential distribution</div><div class="ttdef"><b>Definition</b> <a href="../../d9/da2/exponential__dist_8cpp_source.html#l00037">exponential_dist.cpp:37</a></div></div>
+<div class="ttc" id="aexponential__dist_8cpp_html_ac7b0091e17479d47438a281fefc2549a"><div class="ttname"><a href="#ac7b0091e17479d47438a281fefc2549a">probability::geometric_dist::exponential_std</a></div><div class="ttdeci">double exponential_std(double lambda)</div><div class="ttdoc">the standard deviation of the exponential distribution</div><div class="ttdef"><b>Definition</b> <a href="../../d9/da2/exponential__dist_8cpp_source.html#l00059">exponential_dist.cpp:59</a></div></div>
+<div class="ttc" id="aexponential__dist_8cpp_html_af435dbeb43a05c8c7785f53bf4ce1df1"><div class="ttname"><a href="#af435dbeb43a05c8c7785f53bf4ce1df1">probability::geometric_dist::exponential_var</a></div><div class="ttdeci">double exponential_var(double lambda)</div><div class="ttdoc">the variance of the exponential distribution</div><div class="ttdef"><b>Definition</b> <a href="../../d9/da2/exponential__dist_8cpp_source.html#l00048">exponential_dist.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/da2/exponential__dist_8cpp_a1c8b6e787f72a209ef96c096eedf7afc_cgraph.map b/d9/da2/exponential__dist_8cpp_a1c8b6e787f72a209ef96c096eedf7afc_cgraph.map
deleted file mode 100644
index 23ef02301..000000000
--- a/d9/da2/exponential__dist_8cpp_a1c8b6e787f72a209ef96c096eedf7afc_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="probability::geometric_dist::exponential_expected" name="probability::geometric_dist::exponential_expected">
-<area shape="rect" id="Node000001" title="the expected value of the exponential distribution" alt="" coords="5,29,189,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="62,29,60,19,66,10,78,5,97,3,117,5,129,11,126,16,115,10,97,8,80,10,69,14,65,20,67,28"/>
-</map>
diff --git a/d9/da2/exponential__dist_8cpp_a1c8b6e787f72a209ef96c096eedf7afc_cgraph.md5 b/d9/da2/exponential__dist_8cpp_a1c8b6e787f72a209ef96c096eedf7afc_cgraph.md5
deleted file mode 100644
index 0878c2308..000000000
--- a/d9/da2/exponential__dist_8cpp_a1c8b6e787f72a209ef96c096eedf7afc_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ff895a711de292f98636438a15f73b2a
\ No newline at end of file
diff --git a/d9/da2/exponential__dist_8cpp_a1c8b6e787f72a209ef96c096eedf7afc_cgraph.svg b/d9/da2/exponential__dist_8cpp_a1c8b6e787f72a209ef96c096eedf7afc_cgraph.svg
deleted file mode 100644
index b4ffdb0ac..000000000
--- a/d9/da2/exponential__dist_8cpp_a1c8b6e787f72a209ef96c096eedf7afc_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::exponential_expected Pages: 1 -->
-<svg width="146pt" height="57pt"
- viewBox="0.00 0.00 145.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>probability::geometric_dist::exponential_expected</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="the expected value of the exponential distribution">
-<polygon fill="#999999" stroke="#666666" points="137.5,-30.5 0,-30.5 0,0 137.5,0 137.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="middle" x="68.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::exponential_expected</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44.38,-30.99C39.41,-40.06 47.53,-48.5 68.75,-48.5 80.35,-48.5 88.04,-45.97 91.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.26,-42.83 92.94,-32.49 88.31,-42.02 95.26,-42.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/da2/exponential__dist_8cpp_a1c8b6e787f72a209ef96c096eedf7afc_cgraph_org.svg b/d9/da2/exponential__dist_8cpp_a1c8b6e787f72a209ef96c096eedf7afc_cgraph_org.svg
deleted file mode 100644
index c114f1346..000000000
--- a/d9/da2/exponential__dist_8cpp_a1c8b6e787f72a209ef96c096eedf7afc_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::exponential_expected Pages: 1 -->
-<svg width="146pt" height="57pt"
- viewBox="0.00 0.00 145.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>probability::geometric_dist::exponential_expected</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="the expected value of the exponential distribution">
-<polygon fill="#999999" stroke="#666666" points="137.5,-30.5 0,-30.5 0,0 137.5,0 137.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="middle" x="68.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::exponential_expected</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M44.38,-30.99C39.41,-40.06 47.53,-48.5 68.75,-48.5 80.35,-48.5 88.04,-45.97 91.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.26,-42.83 92.94,-32.49 88.31,-42.02 95.26,-42.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/da2/exponential__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d9/da2/exponential__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 319918ba1..000000000
--- a/d9/da2/exponential__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,13,49,38"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/error/exception/what.html#" title=" " alt="" coords="97,5,242,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,23,81,23,81,28,49,28"/>
-</map>
diff --git a/d9/da2/exponential__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d9/da2/exponential__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 0cf23edce..000000000
--- a/d9/da2/exponential__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fd0ca36cc9d6dc3ed3c6004e7bb148ad
\ No newline at end of file
diff --git a/d9/da2/exponential__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d9/da2/exponential__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 32da2a1d3..000000000
--- a/d9/da2/exponential__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="186pt" height="39pt"
- viewBox="0.00 0.00 185.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-24.88 0,-24.88 0,-5.63 32.5,-5.63 32.5,-24.88"/>
-<text text-anchor="middle" x="16.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.5,-30.5 68.5,-30.5 68.5,0 177.5,0 177.5,-30.5"/>
-<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::invalid_argument</text>
-<text text-anchor="middle" x="123" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::what</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.71,-15.25C39.43,-15.25 47.8,-15.25 56.71,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.67,-18.75 66.67,-15.25 56.67,-11.75 56.67,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/da2/exponential__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d9/da2/exponential__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1b2ea8af7..000000000
--- a/d9/da2/exponential__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="186pt" height="39pt"
- viewBox="0.00 0.00 185.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-24.88 0,-24.88 0,-5.63 32.5,-5.63 32.5,-24.88"/>
-<text text-anchor="middle" x="16.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.5,-30.5 68.5,-30.5 68.5,0 177.5,0 177.5,-30.5"/>
-<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::invalid_argument</text>
-<text text-anchor="middle" x="123" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::what</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.71,-15.25C39.43,-15.25 47.8,-15.25 56.71,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.67,-18.75 66.67,-15.25 56.67,-11.75 56.67,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/da2/exponential__dist_8cpp_ac7b0091e17479d47438a281fefc2549a_cgraph.map b/d9/da2/exponential__dist_8cpp_ac7b0091e17479d47438a281fefc2549a_cgraph.map
deleted file mode 100644
index 9ceef43ee..000000000
--- a/d9/da2/exponential__dist_8cpp_ac7b0091e17479d47438a281fefc2549a_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="probability::geometric_dist::exponential_std" name="probability::geometric_dist::exponential_std">
-<area shape="rect" id="Node000001" title="the standard deviation of the exponential distribution" alt="" coords="5,29,154,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="51,29,49,19,54,11,64,5,80,3,96,5,106,12,103,16,94,10,79,8,66,10,58,14,54,20,56,28"/>
-</map>
diff --git a/d9/da2/exponential__dist_8cpp_ac7b0091e17479d47438a281fefc2549a_cgraph.md5 b/d9/da2/exponential__dist_8cpp_ac7b0091e17479d47438a281fefc2549a_cgraph.md5
deleted file mode 100644
index a99ab7935..000000000
--- a/d9/da2/exponential__dist_8cpp_ac7b0091e17479d47438a281fefc2549a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ed79ee4d1ea4c9c4877f1a08548d4d28
\ No newline at end of file
diff --git a/d9/da2/exponential__dist_8cpp_ac7b0091e17479d47438a281fefc2549a_cgraph.svg b/d9/da2/exponential__dist_8cpp_ac7b0091e17479d47438a281fefc2549a_cgraph.svg
deleted file mode 100644
index bf0bf1245..000000000
--- a/d9/da2/exponential__dist_8cpp_ac7b0091e17479d47438a281fefc2549a_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::exponential_std Pages: 1 -->
-<svg width="119pt" height="57pt"
- viewBox="0.00 0.00 119.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>probability::geometric_dist::exponential_std</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="the standard deviation of the exponential distribution">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::exponential_std</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.91,-30.99C31.89,-40.06 38.46,-48.5 55.62,-48.5 65.01,-48.5 71.23,-45.97 74.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.74,-42.78 75.2,-32.49 70.77,-42.12 77.74,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/da2/exponential__dist_8cpp_ac7b0091e17479d47438a281fefc2549a_cgraph_org.svg b/d9/da2/exponential__dist_8cpp_ac7b0091e17479d47438a281fefc2549a_cgraph_org.svg
deleted file mode 100644
index ed5223480..000000000
--- a/d9/da2/exponential__dist_8cpp_ac7b0091e17479d47438a281fefc2549a_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::exponential_std Pages: 1 -->
-<svg width="119pt" height="57pt"
- viewBox="0.00 0.00 119.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>probability::geometric_dist::exponential_std</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="the standard deviation of the exponential distribution">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::exponential_std</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.91,-30.99C31.89,-40.06 38.46,-48.5 55.62,-48.5 65.01,-48.5 71.23,-45.97 74.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.74,-42.78 75.2,-32.49 70.77,-42.12 77.74,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/da2/exponential__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/da2/exponential__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 154dabe33..000000000
--- a/d9/da2/exponential__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,13,55,38"/>
-<area shape="rect" id="Node000002" href="$d9/da2/exponential__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,13,146,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,23,87,23,87,28,55,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/error/exception/what.html#" title=" " alt="" coords="194,5,339,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,23,178,23,178,28,146,28"/>
-</map>
diff --git a/d9/da2/exponential__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/da2/exponential__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 957fc6fd8..000000000
--- a/d9/da2/exponential__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-18e1a9230f6e6404a44726440b39cecd
\ No newline at end of file
diff --git a/d9/da2/exponential__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/da2/exponential__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 252af272a..000000000
--- a/d9/da2/exponential__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="259pt" height="39pt"
- viewBox="0.00 0.00 258.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-24.88 0,-24.88 0,-5.63 37,-5.63 37,-24.88"/>
-<text text-anchor="middle" x="18.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/da2/exponential__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-24.88 73,-24.88 73,-5.63 105.5,-5.63 105.5,-24.88"/>
-<text text-anchor="middle" x="89.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-15.25C44.58,-15.25 53.31,-15.25 61.45,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-18.75 71.2,-15.25 61.2,-11.75 61.2,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="250.5,-30.5 141.5,-30.5 141.5,0 250.5,0 250.5,-30.5"/>
-<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::invalid_argument</text>
-<text text-anchor="middle" x="196" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::what</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.71,-15.25C112.43,-15.25 120.8,-15.25 129.71,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.67,-18.75 139.67,-15.25 129.67,-11.75 129.67,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/da2/exponential__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/da2/exponential__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 458d78b5d..000000000
--- a/d9/da2/exponential__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="259pt" height="39pt"
- viewBox="0.00 0.00 258.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-24.88 0,-24.88 0,-5.63 37,-5.63 37,-24.88"/>
-<text text-anchor="middle" x="18.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/da2/exponential__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-24.88 73,-24.88 73,-5.63 105.5,-5.63 105.5,-24.88"/>
-<text text-anchor="middle" x="89.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-15.25C44.58,-15.25 53.31,-15.25 61.45,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-18.75 71.2,-15.25 61.2,-11.75 61.2,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="250.5,-30.5 141.5,-30.5 141.5,0 250.5,0 250.5,-30.5"/>
-<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::invalid_argument</text>
-<text text-anchor="middle" x="196" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::what</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.71,-15.25C112.43,-15.25 120.8,-15.25 129.71,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.67,-18.75 139.67,-15.25 129.67,-11.75 129.67,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/da2/exponential__dist_8cpp_af435dbeb43a05c8c7785f53bf4ce1df1_cgraph.map b/d9/da2/exponential__dist_8cpp_af435dbeb43a05c8c7785f53bf4ce1df1_cgraph.map
deleted file mode 100644
index 899fc7b12..000000000
--- a/d9/da2/exponential__dist_8cpp_af435dbeb43a05c8c7785f53bf4ce1df1_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="probability::geometric_dist::exponential_var" name="probability::geometric_dist::exponential_var">
-<area shape="rect" id="Node000001" title="the variance of the exponential distribution" alt="" coords="5,29,154,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="51,29,49,19,54,11,64,5,80,3,96,5,106,12,103,16,94,10,79,8,66,10,58,14,54,20,56,28"/>
-</map>
diff --git a/d9/da2/exponential__dist_8cpp_af435dbeb43a05c8c7785f53bf4ce1df1_cgraph.md5 b/d9/da2/exponential__dist_8cpp_af435dbeb43a05c8c7785f53bf4ce1df1_cgraph.md5
deleted file mode 100644
index 724449b40..000000000
--- a/d9/da2/exponential__dist_8cpp_af435dbeb43a05c8c7785f53bf4ce1df1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1856649fa4105093a554c1732bd6e8a1
\ No newline at end of file
diff --git a/d9/da2/exponential__dist_8cpp_af435dbeb43a05c8c7785f53bf4ce1df1_cgraph.svg b/d9/da2/exponential__dist_8cpp_af435dbeb43a05c8c7785f53bf4ce1df1_cgraph.svg
deleted file mode 100644
index d23ca819a..000000000
--- a/d9/da2/exponential__dist_8cpp_af435dbeb43a05c8c7785f53bf4ce1df1_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::exponential_var Pages: 1 -->
-<svg width="119pt" height="57pt"
- viewBox="0.00 0.00 119.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>probability::geometric_dist::exponential_var</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="the variance of the exponential distribution">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::exponential_var</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.91,-30.99C31.89,-40.06 38.46,-48.5 55.62,-48.5 65.01,-48.5 71.23,-45.97 74.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.74,-42.78 75.2,-32.49 70.77,-42.12 77.74,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/da2/exponential__dist_8cpp_af435dbeb43a05c8c7785f53bf4ce1df1_cgraph_org.svg b/d9/da2/exponential__dist_8cpp_af435dbeb43a05c8c7785f53bf4ce1df1_cgraph_org.svg
deleted file mode 100644
index fb1ba5ed3..000000000
--- a/d9/da2/exponential__dist_8cpp_af435dbeb43a05c8c7785f53bf4ce1df1_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::exponential_var Pages: 1 -->
-<svg width="119pt" height="57pt"
- viewBox="0.00 0.00 119.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>probability::geometric_dist::exponential_var</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="the variance of the exponential distribution">
-<polygon fill="#999999" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::exponential_var</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.91,-30.99C31.89,-40.06 38.46,-48.5 55.62,-48.5 65.01,-48.5 71.23,-45.97 74.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.74,-42.78 75.2,-32.49 70.77,-42.12 77.74,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/da2/exponential__dist_8cpp_source.html b/d9/da2/exponential__dist_8cpp_source.html
new file mode 100644
index 000000000..fa7c92ec6
--- /dev/null
+++ b/d9/da2/exponential__dist_8cpp_source.html
@@ -0,0 +1,262 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: probability/exponential_dist.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/da2/exponential__dist_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">exponential_dist.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/da2/exponential__dist_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cassert&gt;</span>    <span class="comment">// For assert</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cmath&gt;</span>      <span class="comment">// For std::pow</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;iostream&gt;</span>   <span class="comment">// For I/O operation</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;stdexcept&gt;</span>  <span class="comment">// For std::invalid_argument</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;string&gt;</span>     <span class="comment">// For std::string</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a> {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d8a/namespacegeometric__dist.html">geometric_dist</a> {</div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="}">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../d9/da2/exponential__dist_8cpp.html#a1c8b6e787f72a209ef96c096eedf7afc">   37</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d9/da2/exponential__dist_8cpp.html#a1c8b6e787f72a209ef96c096eedf7afc">exponential_expected</a>(<span class="keywordtype">double</span> lambda) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">if</span> (lambda &lt;= 0) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;lambda must be greater than 0&quot;</span>);</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    }</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">return</span> 1 / lambda;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>}</div>
+</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="foldopen" id="foldopen00048" data-start="{" data-end="}">
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="../../d9/da2/exponential__dist_8cpp.html#af435dbeb43a05c8c7785f53bf4ce1df1">   48</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d9/da2/exponential__dist_8cpp.html#af435dbeb43a05c8c7785f53bf4ce1df1">exponential_var</a>(<span class="keywordtype">double</span> lambda) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">if</span> (lambda &lt;= 0) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;lambda must be greater than 0&quot;</span>);</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">return</span> 1 / pow(lambda, 2);</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>}</div>
+</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="foldopen" id="foldopen00059" data-start="{" data-end="}">
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d9/da2/exponential__dist_8cpp.html#ac7b0091e17479d47438a281fefc2549a">   59</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d9/da2/exponential__dist_8cpp.html#ac7b0091e17479d47438a281fefc2549a">exponential_std</a>(<span class="keywordtype">double</span> lambda) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">if</span> (lambda &lt;= 0) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;lambda must be greater than 0&quot;</span>);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    }</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordflow">return</span> 1 / lambda;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>}</div>
+</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>}  <span class="comment">// namespace geometric_dist</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>}  <span class="comment">// namespace probability</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="foldopen" id="foldopen00072" data-start="{" data-end="}">
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"><a class="line" href="../../d9/da2/exponential__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   72</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/da2/exponential__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordtype">double</span> lambda_1 = 1;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keywordtype">double</span> expected_1 = 1;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="keywordtype">double</span> var_1 = 1;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keywordtype">double</span> std_1 = 1;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordtype">double</span> lambda_2 = 2;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keywordtype">double</span> expected_2 = 0.5;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordtype">double</span> var_2 = 0.25;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keywordtype">double</span> std_2 = 0.5;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordtype">double</span> lambda_3 = 3;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="keywordtype">double</span> expected_3 = 0.333333;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keywordtype">double</span> var_3 = 0.111111;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordtype">double</span> std_3 = 0.333333;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keywordtype">double</span> lambda_4 = 0;     <span class="comment">// Test 0</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keywordtype">double</span> lambda_5 = -2.3;  <span class="comment">// Test negative value</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keyword">const</span> <span class="keywordtype">float</span> threshold = 1e-3f;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test for lambda = 1 \n&quot;</span>;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    assert(</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        std::abs(expected_1 - probability::geometric_dist::exponential_expected(</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>                                  lambda_1)) &lt; threshold);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    assert(std::abs(var_1 - probability::geometric_dist::exponential_var(</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>                                lambda_1)) &lt; threshold);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    assert(std::abs(std_1 - probability::geometric_dist::exponential_std(</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>                                lambda_1)) &lt; threshold);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ALL TEST PASSED\n\n&quot;</span>;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test for lambda = 2 \n&quot;</span>;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    assert(</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        std::abs(expected_2 - probability::geometric_dist::exponential_expected(</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>                                  lambda_2)) &lt; threshold);</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    assert(std::abs(var_2 - probability::geometric_dist::exponential_var(</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>                                lambda_2)) &lt; threshold);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    assert(std::abs(std_2 - probability::geometric_dist::exponential_std(</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>                                lambda_2)) &lt; threshold);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ALL TEST PASSED\n\n&quot;</span>;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test for lambda = 3 \n&quot;</span>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    assert(</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        std::abs(expected_3 - probability::geometric_dist::exponential_expected(</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>                                  lambda_3)) &lt; threshold);</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    assert(std::abs(var_3 - probability::geometric_dist::exponential_var(</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>                                lambda_3)) &lt; threshold);</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    assert(std::abs(std_3 - probability::geometric_dist::exponential_std(</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>                                lambda_3)) &lt; threshold);</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ALL TEST PASSED\n\n&quot;</span>;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span> </div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test for lambda = 0 \n&quot;</span>;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    <span class="keywordflow">try</span> {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        probability::geometric_dist::exponential_expected(lambda_4);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        probability::geometric_dist::exponential_var(lambda_4);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        probability::geometric_dist::exponential_std(lambda_4);</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    } <span class="keywordflow">catch</span> (std::invalid_argument&amp; err) {</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        assert(std::string(err.what()) == <span class="stringliteral">&quot;lambda must be greater than 0&quot;</span>);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    }</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ALL TEST PASSED\n\n&quot;</span>;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test for lambda = -2.3 \n&quot;</span>;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <span class="keywordflow">try</span> {</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>        probability::geometric_dist::exponential_expected(lambda_5);</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        probability::geometric_dist::exponential_var(lambda_5);</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        probability::geometric_dist::exponential_std(lambda_5);</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    } <span class="keywordflow">catch</span> (std::invalid_argument&amp; err) {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>        assert(std::string(err.what()) == <span class="stringliteral">&quot;lambda must be greater than 0&quot;</span>);</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    }</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ALL TEST PASSED\n\n&quot;</span>;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>}</div>
+</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span> </div>
+<div class="foldopen" id="foldopen00148" data-start="{" data-end="}">
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"><a class="line" href="../../d9/da2/exponential__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  148</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/da2/exponential__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    <a class="code hl_function" href="../../d9/da2/exponential__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Self test implementation</span></div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>}</div>
+</div>
+<div class="ttc" id="aexponential__dist_8cpp_html_a1c8b6e787f72a209ef96c096eedf7afc"><div class="ttname"><a href="../../d9/da2/exponential__dist_8cpp.html#a1c8b6e787f72a209ef96c096eedf7afc">probability::geometric_dist::exponential_expected</a></div><div class="ttdeci">double exponential_expected(double lambda)</div><div class="ttdoc">the expected value of the exponential distribution</div><div class="ttdef"><b>Definition</b> <a href="#l00037">exponential_dist.cpp:37</a></div></div>
+<div class="ttc" id="aexponential__dist_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d9/da2/exponential__dist_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> <a href="#l00072">exponential_dist.cpp:72</a></div></div>
+<div class="ttc" id="aexponential__dist_8cpp_html_ac7b0091e17479d47438a281fefc2549a"><div class="ttname"><a href="../../d9/da2/exponential__dist_8cpp.html#ac7b0091e17479d47438a281fefc2549a">probability::geometric_dist::exponential_std</a></div><div class="ttdeci">double exponential_std(double lambda)</div><div class="ttdoc">the standard deviation of the exponential distribution</div><div class="ttdef"><b>Definition</b> <a href="#l00059">exponential_dist.cpp:59</a></div></div>
+<div class="ttc" id="aexponential__dist_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/da2/exponential__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00148">exponential_dist.cpp:148</a></div></div>
+<div class="ttc" id="aexponential__dist_8cpp_html_af435dbeb43a05c8c7785f53bf4ce1df1"><div class="ttname"><a href="../../d9/da2/exponential__dist_8cpp.html#af435dbeb43a05c8c7785f53bf4ce1df1">probability::geometric_dist::exponential_var</a></div><div class="ttdeci">double exponential_var(double lambda)</div><div class="ttdoc">the variance of the exponential distribution</div><div class="ttdef"><b>Definition</b> <a href="#l00048">exponential_dist.cpp:48</a></div></div>
+<div class="ttc" id="anamespacegeometric__dist_html"><div class="ttname"><a href="../../dd/d8a/namespacegeometric__dist.html">geometric_dist</a></div><div class="ttdoc">Functions for the Geometric Distribution algorithm implementation.</div></div>
+<div class="ttc" id="anamespaceprobability_html"><div class="ttname"><a href="../../d4/ded/namespaceprobability.html">probability</a></div><div class="ttdoc">Probability algorithms.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_82e494173a87936756866de2fa774307.html">probability</a></li><li class="navelem"><a class="el" href="../../d9/da2/exponential__dist_8cpp.html">exponential_dist.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/daa/namespacemidpoint__rule.html b/d9/daa/namespacemidpoint__rule.html
index 0b4431fbf..d9d7fc574 100644
--- a/d9/daa/namespacemidpoint__rule.html
+++ b/d9/daa/namespacemidpoint__rule.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: midpoint_rule Namespace Reference</title>
+<title>TheAlgorithms/C++: midpoint_rule Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d9/dab/bloom__filter_8cpp.html b/d9/dab/bloom__filter_8cpp.html
index 109286afa..605d4411d 100644
--- a/d9/dab/bloom__filter_8cpp.html
+++ b/d9/dab/bloom__filter_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/bloom_filter.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/bloom_filter.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -125,7 +142,9 @@ Include dependency graph for bloom_filter.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d2d/bloom__filter_8cpp__incl.svg" width="551" height="126"><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">
+</div>
+<p><a href="../../d9/dab/bloom__filter_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dae/classdata__structures_1_1_bitset.html">data_structures::Bitset</a></td></tr>
@@ -143,16 +162,16 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a271c753baf6dc5ac6f19fa03c5873eb4" id="r_a271c753baf6dc5ac6f19fa03c5873eb4"><td class="memItemLeft" align="right" valign="top">static <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4">data_structures::hashDJB2</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> const &amp;s)</td></tr>
+<tr class="memitem:a271c753baf6dc5ac6f19fa03c5873eb4" id="r_a271c753baf6dc5ac6f19fa03c5873eb4"><td class="memItemLeft" align="right" valign="top">static std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4">data_structures::hashDJB2</a> (std::string const &amp;s)</td></tr>
 <tr class="memdesc:a271c753baf6dc5ac6f19fa03c5873eb4"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="http://www.cse.yorku.ca/~oz/hash.html" target="_blank">Function djb2</a> to get hash for the given string.  <br /></td></tr>
 <tr class="separator:a271c753baf6dc5ac6f19fa03c5873eb4"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a35eb2bc3edbb52f9c5f0b1e51046ef15" id="r_a35eb2bc3edbb52f9c5f0b1e51046ef15"><td class="memItemLeft" align="right" valign="top">static <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15">data_structures::hashStr</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> const &amp;s)</td></tr>
+<tr class="memitem:a35eb2bc3edbb52f9c5f0b1e51046ef15" id="r_a35eb2bc3edbb52f9c5f0b1e51046ef15"><td class="memItemLeft" align="right" valign="top">static std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15">data_structures::hashStr</a> (std::string const &amp;s)</td></tr>
 <tr class="memdesc:a35eb2bc3edbb52f9c5f0b1e51046ef15"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://stackoverflow.com/questions/8317508/hash-function-for-a-string" target="_blank">Hash function</a>, to get hash for the given string.  <br /></td></tr>
 <tr class="separator:a35eb2bc3edbb52f9c5f0b1e51046ef15"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa6deb9d4a0f63ea97aef3dce4c6c6677" id="r_aa6deb9d4a0f63ea97aef3dce4c6c6677"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677">data_structures::hashInt_1</a> (int x)</td></tr>
+<tr class="memitem:aa6deb9d4a0f63ea97aef3dce4c6c6677" id="r_aa6deb9d4a0f63ea97aef3dce4c6c6677"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677">data_structures::hashInt_1</a> (int x)</td></tr>
 <tr class="memdesc:aa6deb9d4a0f63ea97aef3dce4c6c6677"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://stackoverflow.com/questions/664014/what-integer-hash-function-are-good-that-accepts-an-integer-hash-key" target="_blank">Hash function for test</a>  <br /></td></tr>
 <tr class="separator:aa6deb9d4a0f63ea97aef3dce4c6c6677"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a9ed236419034917c5270c1dccd220b5c" id="r_a9ed236419034917c5270c1dccd220b5c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c">data_structures::hashInt_2</a> (int x)</td></tr>
+<tr class="memitem:a9ed236419034917c5270c1dccd220b5c" id="r_a9ed236419034917c5270c1dccd220b5c"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c">data_structures::hashInt_2</a> (int x)</td></tr>
 <tr class="memdesc:a9ed236419034917c5270c1dccd220b5c"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://stackoverflow.com/questions/664014/what-integer-hash-function-are-good-that-accepts-an-integer-hash-key" target="_blank">Hash function for test</a>  <br /></td></tr>
 <tr class="separator:a9ed236419034917c5270c1dccd220b5c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a71f57bf262fe55db928b19dc124cc0d8" id="r_a71f57bf262fe55db928b19dc124cc0d8"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a71f57bf262fe55db928b19dc124cc0d8">test_bloom_filter_string</a> ()</td></tr>
@@ -176,6 +195,8 @@ Functions</h2></td></tr>
 operation"</p>
 <p><a href="https://stackoverflow.com/a/30247022" target="_blank">Very good use case example</a></p>
 <p>Basic bloom filter doesn't support deleting of elements, so we don't need to implement deletion in bloom filter and bitset in our case. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/DanArmor" target="_blank">DanArmor</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -194,6 +215,8 @@ operation"</p>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00282">282</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  282</span>           {</div>
 <div class="line"><span class="lineno">  283</span>    <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  284</span> </div>
@@ -201,19 +224,13 @@ operation"</p>
 <div class="line"><span class="lineno">  286</span>    <a class="code hl_function" href="#a71f57bf262fe55db928b19dc124cc0d8">test_bloom_filter_string</a>();</div>
 <div class="line"><span class="lineno">  287</span>    <a class="code hl_function" href="#a30edc0d2bb59c185baec81d69d20ed3b">test_bloom_filter_int</a>();</div>
 <div class="line"><span class="lineno">  288</span>    </div>
-<div class="line"><span class="lineno">  289</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  289</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  290</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  291</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="abloom__filter_8cpp_html_a30edc0d2bb59c185baec81d69d20ed3b"><div class="ttname"><a href="#a30edc0d2bb59c185baec81d69d20ed3b">test_bloom_filter_int</a></div><div class="ttdeci">static void test_bloom_filter_int()</div><div class="ttdoc">Test for bloom filter with int as generic type.</div><div class="ttdef"><b>Definition</b> bloom_filter.cpp:246</div></div>
-<div class="ttc" id="abloom__filter_8cpp_html_a6e509afe40db07681f676ad8da4fb905"><div class="ttname"><a href="#a6e509afe40db07681f676ad8da4fb905">test_bitset</a></div><div class="ttdeci">static void test_bitset()</div><div class="ttdoc">Test for bitset.</div><div class="ttdef"><b>Definition</b> bloom_filter.cpp:267</div></div>
-<div class="ttc" id="abloom__filter_8cpp_html_a71f57bf262fe55db928b19dc124cc0d8"><div class="ttname"><a href="#a71f57bf262fe55db928b19dc124cc0d8">test_bloom_filter_string</a></div><div class="ttdeci">static void test_bloom_filter_string()</div><div class="ttdoc">Test for bloom filter with string as generic type.</div><div class="ttdef"><b>Definition</b> bloom_filter.cpp:226</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d9/dab/bloom__filter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="524"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="abloom__filter_8cpp_html_a30edc0d2bb59c185baec81d69d20ed3b"><div class="ttname"><a href="#a30edc0d2bb59c185baec81d69d20ed3b">test_bloom_filter_int</a></div><div class="ttdeci">static void test_bloom_filter_int()</div><div class="ttdoc">Test for bloom filter with int as generic type.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dab/bloom__filter_8cpp_source.html#l00246">bloom_filter.cpp:246</a></div></div>
+<div class="ttc" id="abloom__filter_8cpp_html_a6e509afe40db07681f676ad8da4fb905"><div class="ttname"><a href="#a6e509afe40db07681f676ad8da4fb905">test_bitset</a></div><div class="ttdeci">static void test_bitset()</div><div class="ttdoc">Test for bitset.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dab/bloom__filter_8cpp_source.html#l00267">bloom_filter.cpp:267</a></div></div>
+<div class="ttc" id="abloom__filter_8cpp_html_a71f57bf262fe55db928b19dc124cc0d8"><div class="ttname"><a href="#a71f57bf262fe55db928b19dc124cc0d8">test_bloom_filter_string</a></div><div class="ttdeci">static void test_bloom_filter_string()</div><div class="ttdoc">Test for bloom filter with string as generic type.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dab/bloom__filter_8cpp_source.html#l00226">bloom_filter.cpp:226</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6e509afe40db07681f676ad8da4fb905" name="a6e509afe40db07681f676ad8da4fb905"></a>
@@ -241,9 +258,11 @@ Here is the call graph for this function:</div>
 
 <p>Test for bitset. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00267">267</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  267</span>                          {</div>
 <div class="line"><span class="lineno">  268</span>    <a class="code hl_class" href="../../d9/dae/classdata__structures_1_1_bitset.html">data_structures::Bitset</a> set(2);</div>
-<div class="line"><span class="lineno">  269</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::size_t&gt;</a> toCheck{0, 1, 5, 8, 63, 64, 67, 127};</div>
+<div class="line"><span class="lineno">  269</span>    std::vector&lt;std::size_t&gt; toCheck{0, 1, 5, 8, 63, 64, 67, 127};</div>
 <div class="line"><span class="lineno">  270</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> x : toCheck) {</div>
 <div class="line"><span class="lineno">  271</span>        set.add(x);</div>
 <div class="line"><span class="lineno">  272</span>        assert(set.contains(x));</div>
@@ -251,14 +270,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  274</span>    assert(set.contains(128) == <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">  275</span>    assert(set.contains(256) == <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">  276</span>}</div>
-<div class="ttc" id="aclassdata__structures_1_1_bitset_html"><div class="ttname"><a href="../../d9/dae/classdata__structures_1_1_bitset.html">data_structures::Bitset</a></div><div class="ttdoc">Simple bitset implementation for bloom filter.</div><div class="ttdef"><b>Definition</b> bloom_filter.cpp:40</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dab/bloom__filter_8cpp_a6e509afe40db07681f676ad8da4fb905_cgraph.svg" width="498" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1_bitset_html"><div class="ttname"><a href="../../d9/dae/classdata__structures_1_1_bitset.html">data_structures::Bitset</a></div><div class="ttdoc">Simple bitset implementation for bloom filter.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dab/bloom__filter_8cpp_source.html#l00040">bloom_filter.cpp:40</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a30edc0d2bb59c185baec81d69d20ed3b" name="a30edc0d2bb59c185baec81d69d20ed3b"></a>
@@ -286,11 +299,13 @@ Here is the call graph for this function:</div>
 
 <p>Test for bloom filter with int as generic type. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00246">246</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  246</span>                                    {</div>
 <div class="line"><span class="lineno">  247</span>    <a class="code hl_class" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html">data_structures::BloomFilter&lt;int&gt;</a> filter(</div>
 <div class="line"><span class="lineno">  248</span>        20, {<a class="code hl_function" href="../../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677">data_structures::hashInt_1</a>, <a class="code hl_function" href="../../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c">data_structures::hashInt_2</a>});</div>
-<div class="line"><span class="lineno">  249</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> toCheck{100, 200, 300, 50};</div>
-<div class="line"><span class="lineno">  250</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> toFalse{1, 2, 3, 4, 5, 6, 7, 8};</div>
+<div class="line"><span class="lineno">  249</span>    std::vector&lt;int&gt; toCheck{100, 200, 300, 50};</div>
+<div class="line"><span class="lineno">  250</span>    std::vector&lt;int&gt; toFalse{1, 2, 3, 4, 5, 6, 7, 8};</div>
 <div class="line"><span class="lineno">  251</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x : toCheck) {</div>
 <div class="line"><span class="lineno">  252</span>        filter.add(x);</div>
 <div class="line"><span class="lineno">  253</span>    }</div>
@@ -301,15 +316,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  258</span>        assert(filter.contains(x));</div>
 <div class="line"><span class="lineno">  259</span>    }</div>
 <div class="line"><span class="lineno">  260</span>}</div>
-<div class="ttc" id="aclassdata__structures_1_1_bloom_filter_html"><div class="ttname"><a href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html">data_structures::BloomFilter</a></div><div class="ttdoc">Bloom filter template class.</div><div class="ttdef"><b>Definition</b> bloom_filter.cpp:99</div></div>
-<div class="ttc" id="anamespacedata__structures_html_a9ed236419034917c5270c1dccd220b5c"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c">data_structures::hashInt_2</a></div><div class="ttdeci">std::size_t hashInt_2(int x)</div><div class="ttdoc">Hash function for test</div><div class="ttdef"><b>Definition</b> bloom_filter.cpp:213</div></div>
-<div class="ttc" id="anamespacedata__structures_html_aa6deb9d4a0f63ea97aef3dce4c6c6677"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677">data_structures::hashInt_1</a></div><div class="ttdeci">std::size_t hashInt_1(int x)</div><div class="ttdoc">Hash function for test</div><div class="ttdef"><b>Definition</b> bloom_filter.cpp:199</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dab/bloom__filter_8cpp_a30edc0d2bb59c185baec81d69d20ed3b_cgraph.svg" width="374" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1_bloom_filter_html"><div class="ttname"><a href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html">data_structures::BloomFilter</a></div><div class="ttdoc">Bloom filter template class.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dab/bloom__filter_8cpp_source.html#l00099">bloom_filter.cpp:99</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html_a9ed236419034917c5270c1dccd220b5c"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c">data_structures::hashInt_2</a></div><div class="ttdeci">std::size_t hashInt_2(int x)</div><div class="ttdoc">Hash function for test</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dab/bloom__filter_8cpp_source.html#l00213">bloom_filter.cpp:213</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html_aa6deb9d4a0f63ea97aef3dce4c6c6677"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677">data_structures::hashInt_1</a></div><div class="ttdeci">std::size_t hashInt_1(int x)</div><div class="ttdoc">Hash function for test</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dab/bloom__filter_8cpp_source.html#l00199">bloom_filter.cpp:199</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a71f57bf262fe55db928b19dc124cc0d8" name="a71f57bf262fe55db928b19dc124cc0d8"></a>
@@ -337,11 +347,13 @@ Here is the call graph for this function:</div>
 
 <p>Test for bloom filter with string as generic type. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00226">226</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  226</span>                                       {</div>
 <div class="line"><span class="lineno">  227</span>    <a class="code hl_class" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html">data_structures::BloomFilter&lt;std::string&gt;</a> filter(</div>
 <div class="line"><span class="lineno">  228</span>        10, {<a class="code hl_function" href="../../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4">data_structures::hashDJB2</a>, <a class="code hl_function" href="../../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15">data_structures::hashStr</a>});</div>
-<div class="line"><span class="lineno">  229</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::string&gt;</a> toCheck{<span class="stringliteral">&quot;hello&quot;</span>, <span class="stringliteral">&quot;world&quot;</span>, <span class="stringliteral">&quot;!&quot;</span>};</div>
-<div class="line"><span class="lineno">  230</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::string&gt;</a> toFalse{<span class="stringliteral">&quot;false&quot;</span>, <span class="stringliteral">&quot;world2&quot;</span>, <span class="stringliteral">&quot;!!!&quot;</span>};</div>
+<div class="line"><span class="lineno">  229</span>    std::vector&lt;std::string&gt; toCheck{<span class="stringliteral">&quot;hello&quot;</span>, <span class="stringliteral">&quot;world&quot;</span>, <span class="stringliteral">&quot;!&quot;</span>};</div>
+<div class="line"><span class="lineno">  230</span>    std::vector&lt;std::string&gt; toFalse{<span class="stringliteral">&quot;false&quot;</span>, <span class="stringliteral">&quot;world2&quot;</span>, <span class="stringliteral">&quot;!!!&quot;</span>};</div>
 <div class="line"><span class="lineno">  231</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; x : toCheck) {</div>
 <div class="line"><span class="lineno">  232</span>        filter.add(x);</div>
 <div class="line"><span class="lineno">  233</span>    }</div>
@@ -352,14 +364,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  238</span>        assert(filter.contains(x));</div>
 <div class="line"><span class="lineno">  239</span>    }</div>
 <div class="line"><span class="lineno">  240</span>}</div>
-<div class="ttc" id="anamespacedata__structures_html_a271c753baf6dc5ac6f19fa03c5873eb4"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4">data_structures::hashDJB2</a></div><div class="ttdeci">static std::size_t hashDJB2(std::string const &amp;s)</div><div class="ttdoc">Function djb2 to get hash for the given string.</div><div class="ttdef"><b>Definition</b> bloom_filter.cpp:166</div></div>
-<div class="ttc" id="anamespacedata__structures_html_a35eb2bc3edbb52f9c5f0b1e51046ef15"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15">data_structures::hashStr</a></div><div class="ttdeci">static std::size_t hashStr(std::string const &amp;s)</div><div class="ttdoc">Hash function, to get hash for the given string.</div><div class="ttdef"><b>Definition</b> bloom_filter.cpp:182</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dab/bloom__filter_8cpp_a71f57bf262fe55db928b19dc124cc0d8_cgraph.svg" width="396" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacedata__structures_html_a271c753baf6dc5ac6f19fa03c5873eb4"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4">data_structures::hashDJB2</a></div><div class="ttdeci">static std::size_t hashDJB2(std::string const &amp;s)</div><div class="ttdoc">Function djb2 to get hash for the given string.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dab/bloom__filter_8cpp_source.html#l00166">bloom_filter.cpp:166</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html_a35eb2bc3edbb52f9c5f0b1e51046ef15"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15">data_structures::hashStr</a></div><div class="ttdeci">static std::size_t hashStr(std::string const &amp;s)</div><div class="ttdoc">Hash function, to get hash for the given string.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dab/bloom__filter_8cpp_source.html#l00182">bloom_filter.cpp:182</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/dab/bloom__filter_8cpp_a30edc0d2bb59c185baec81d69d20ed3b_cgraph.map b/d9/dab/bloom__filter_8cpp_a30edc0d2bb59c185baec81d69d20ed3b_cgraph.map
deleted file mode 100644
index 5fa7e0ede..000000000
--- a/d9/dab/bloom__filter_8cpp_a30edc0d2bb59c185baec81d69d20ed3b_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test_bloom_filter_int" name="test_bloom_filter_int">
-<area shape="rect" id="Node000001" title="Test for bloom filter with int as generic type." alt="" coords="5,31,144,56"/>
-<area shape="rect" id="Node000002" href="$d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677" title="Hash function for test" alt="" coords="192,5,368,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="144,32,176,28,177,34,144,38"/>
-<area shape="rect" id="Node000003" href="$d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c" title="Hash function for test" alt="" coords="192,55,368,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="144,49,177,53,176,58,144,54"/>
-</map>
diff --git a/d9/dab/bloom__filter_8cpp_a30edc0d2bb59c185baec81d69d20ed3b_cgraph.md5 b/d9/dab/bloom__filter_8cpp_a30edc0d2bb59c185baec81d69d20ed3b_cgraph.md5
deleted file mode 100644
index c108f4ab0..000000000
--- a/d9/dab/bloom__filter_8cpp_a30edc0d2bb59c185baec81d69d20ed3b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-95678864bffe5469b795193a7ca1813c
\ No newline at end of file
diff --git a/d9/dab/bloom__filter_8cpp_a30edc0d2bb59c185baec81d69d20ed3b_cgraph.svg b/d9/dab/bloom__filter_8cpp_a30edc0d2bb59c185baec81d69d20ed3b_cgraph.svg
deleted file mode 100644
index 1c3abc9da..000000000
--- a/d9/dab/bloom__filter_8cpp_a30edc0d2bb59c185baec81d69d20ed3b_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_bloom_filter_int Pages: 1 -->
-<svg width="280pt" height="64pt"
- viewBox="0.00 0.00 280.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test_bloom_filter_int</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test for bloom filter with int as generic type.">
-<polygon fill="#999999" stroke="#666666" points="103.75,-37.25 0,-37.25 0,-18 103.75,-18 103.75,-37.25"/>
-<text text-anchor="middle" x="51.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_bloom_filter_int</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677" target="_top" xlink:title="Hash function for test">
-<polygon fill="white" stroke="#666666" points="272,-56.25 139.75,-56.25 139.75,-37 272,-37 272,-56.25"/>
-<text text-anchor="middle" x="205.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::hashInt_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.91,-34C111.74,-34.98 119.96,-36.01 128.2,-37.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.54,-40.49 137.89,-38.25 128.41,-33.54 127.54,-40.49"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c" target="_top" xlink:title="Hash function for test">
-<polygon fill="white" stroke="#666666" points="272,-19.25 139.75,-19.25 139.75,0 272,0 272,-19.25"/>
-<text text-anchor="middle" x="205.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::hashInt_2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.91,-21.58C111.74,-20.65 119.96,-19.68 128.2,-18.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.37,-22.21 137.89,-17.56 127.55,-15.26 128.37,-22.21"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dab/bloom__filter_8cpp_a30edc0d2bb59c185baec81d69d20ed3b_cgraph_org.svg b/d9/dab/bloom__filter_8cpp_a30edc0d2bb59c185baec81d69d20ed3b_cgraph_org.svg
deleted file mode 100644
index e9d62c487..000000000
--- a/d9/dab/bloom__filter_8cpp_a30edc0d2bb59c185baec81d69d20ed3b_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_bloom_filter_int Pages: 1 -->
-<svg width="280pt" height="64pt"
- viewBox="0.00 0.00 280.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test_bloom_filter_int</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test for bloom filter with int as generic type.">
-<polygon fill="#999999" stroke="#666666" points="103.75,-37.25 0,-37.25 0,-18 103.75,-18 103.75,-37.25"/>
-<text text-anchor="middle" x="51.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_bloom_filter_int</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677" target="_top" xlink:title="Hash function for test">
-<polygon fill="white" stroke="#666666" points="272,-56.25 139.75,-56.25 139.75,-37 272,-37 272,-56.25"/>
-<text text-anchor="middle" x="205.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::hashInt_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.91,-34C111.74,-34.98 119.96,-36.01 128.2,-37.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.54,-40.49 137.89,-38.25 128.41,-33.54 127.54,-40.49"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c" target="_top" xlink:title="Hash function for test">
-<polygon fill="white" stroke="#666666" points="272,-19.25 139.75,-19.25 139.75,0 272,0 272,-19.25"/>
-<text text-anchor="middle" x="205.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::hashInt_2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.91,-21.58C111.74,-20.65 119.96,-19.68 128.2,-18.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.37,-22.21 137.89,-17.56 127.55,-15.26 128.37,-22.21"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dab/bloom__filter_8cpp_a6e509afe40db07681f676ad8da4fb905_cgraph.map b/d9/dab/bloom__filter_8cpp_a6e509afe40db07681f676ad8da4fb905_cgraph.map
deleted file mode 100644
index ef1172f6b..000000000
--- a/d9/dab/bloom__filter_8cpp_a6e509afe40db07681f676ad8da4fb905_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="test_bitset" name="test_bitset">
-<area shape="rect" id="Node000001" title="Test for bitset." alt="" coords="5,35,88,60"/>
-<area shape="rect" id="Node000002" href="$d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c" title="Turn bit on position x to 1s." alt="" coords="136,5,318,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="88,38,129,31,129,37,89,43"/>
-<area shape="rect" id="Node000005" href="$d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac" title="Doest bitset contains element x." alt="" coords="150,55,304,96"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="89,51,135,59,134,64,88,56"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="366,5,492,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="319,16,351,16,351,21,319,21"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="372,59,487,84"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="279,29,363,52,362,57,278,34"/>
-<area shape="poly" id="edge5_Node000005_Node000004" title=" " alt="" coords="304,71,356,70,356,76,304,77"/>
-</map>
diff --git a/d9/dab/bloom__filter_8cpp_a6e509afe40db07681f676ad8da4fb905_cgraph.md5 b/d9/dab/bloom__filter_8cpp_a6e509afe40db07681f676ad8da4fb905_cgraph.md5
deleted file mode 100644
index 3ada70321..000000000
--- a/d9/dab/bloom__filter_8cpp_a6e509afe40db07681f676ad8da4fb905_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-43ef84589b9ea60c15838ac3109a0df1
\ No newline at end of file
diff --git a/d9/dab/bloom__filter_8cpp_a6e509afe40db07681f676ad8da4fb905_cgraph.svg b/d9/dab/bloom__filter_8cpp_a6e509afe40db07681f676ad8da4fb905_cgraph.svg
deleted file mode 100644
index 09547b632..000000000
--- a/d9/dab/bloom__filter_8cpp_a6e509afe40db07681f676ad8da4fb905_cgraph.svg
+++ /dev/null
@@ -1,129 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_bitset Pages: 1 -->
-<svg width="373pt" height="76pt"
- viewBox="0.00 0.00 373.25 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>test_bitset</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test for bitset.">
-<polygon fill="#999999" stroke="#666666" points="61.75,-45.88 0,-45.88 0,-26.62 61.75,-26.62 61.75,-45.88"/>
-<text text-anchor="middle" x="30.88" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_bitset</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c" target="_top" xlink:title="Turn bit on position x to 1s.">
-<polygon fill="white" stroke="#666666" points="234.5,-67.88 97.75,-67.88 97.75,-48.62 234.5,-48.62 234.5,-67.88"/>
-<text text-anchor="middle" x="166.12" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset::add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.11,-41.24C71.34,-42.77 81.92,-44.51 92.7,-46.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.03,-49.73 102.47,-47.91 93.17,-42.82 92.03,-49.73"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac" target="_top" xlink:title="Doest bitset contains element x.">
-<polygon fill="white" stroke="#666666" points="223.62,-30.5 108.62,-30.5 108.62,0 223.62,0 223.62,-30.5"/>
-<text text-anchor="start" x="116.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
-<text text-anchor="middle" x="166.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.11,-31.48C72.58,-29.84 84.77,-27.91 97.03,-25.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.43,-29.46 106.76,-24.45 96.34,-22.55 97.43,-29.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="365.25,-67.88 270.5,-67.88 270.5,-48.62 365.25,-48.62 365.25,-67.88"/>
-<text text-anchor="middle" x="317.88" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.99,-58.25C243,-58.25 251.11,-58.25 258.96,-58.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.72,-61.75 268.72,-58.25 258.72,-54.75 258.72,-61.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="361.12,-27.88 274.62,-27.88 274.62,-8.62 361.12,-8.62 361.12,-27.88"/>
-<text text-anchor="middle" x="317.88" y="-14.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.91,-48.16C224.07,-43.04 247.55,-36.77 268.06,-31.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="268.88,-34.69 277.64,-28.73 267.07,-27.93 268.88,-34.69"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge5_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge5_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M223.74,-16.38C236.55,-16.64 250.12,-16.91 262.82,-17.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.61,-20.66 272.68,-17.36 262.75,-13.66 262.61,-20.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dab/bloom__filter_8cpp_a6e509afe40db07681f676ad8da4fb905_cgraph_org.svg b/d9/dab/bloom__filter_8cpp_a6e509afe40db07681f676ad8da4fb905_cgraph_org.svg
deleted file mode 100644
index 790c4e93d..000000000
--- a/d9/dab/bloom__filter_8cpp_a6e509afe40db07681f676ad8da4fb905_cgraph_org.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_bitset Pages: 1 -->
-<svg width="373pt" height="76pt"
- viewBox="0.00 0.00 373.25 75.88" 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 71.88)">
-<title>test_bitset</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test for bitset.">
-<polygon fill="#999999" stroke="#666666" points="61.75,-45.88 0,-45.88 0,-26.62 61.75,-26.62 61.75,-45.88"/>
-<text text-anchor="middle" x="30.88" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_bitset</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c" target="_top" xlink:title="Turn bit on position x to 1s.">
-<polygon fill="white" stroke="#666666" points="234.5,-67.88 97.75,-67.88 97.75,-48.62 234.5,-48.62 234.5,-67.88"/>
-<text text-anchor="middle" x="166.12" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset::add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.11,-41.24C71.34,-42.77 81.92,-44.51 92.7,-46.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.03,-49.73 102.47,-47.91 93.17,-42.82 92.03,-49.73"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac" target="_top" xlink:title="Doest bitset contains element x.">
-<polygon fill="white" stroke="#666666" points="223.62,-30.5 108.62,-30.5 108.62,0 223.62,0 223.62,-30.5"/>
-<text text-anchor="start" x="116.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
-<text text-anchor="middle" x="166.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.11,-31.48C72.58,-29.84 84.77,-27.91 97.03,-25.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.43,-29.46 106.76,-24.45 96.34,-22.55 97.43,-29.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="365.25,-67.88 270.5,-67.88 270.5,-48.62 365.25,-48.62 365.25,-67.88"/>
-<text text-anchor="middle" x="317.88" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.99,-58.25C243,-58.25 251.11,-58.25 258.96,-58.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.72,-61.75 268.72,-58.25 258.72,-54.75 258.72,-61.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="361.12,-27.88 274.62,-27.88 274.62,-8.62 361.12,-8.62 361.12,-27.88"/>
-<text text-anchor="middle" x="317.88" y="-14.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.91,-48.16C224.07,-43.04 247.55,-36.77 268.06,-31.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="268.88,-34.69 277.64,-28.73 267.07,-27.93 268.88,-34.69"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge5_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge5_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M223.74,-16.38C236.55,-16.64 250.12,-16.91 262.82,-17.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.61,-20.66 272.68,-17.36 262.75,-13.66 262.61,-20.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dab/bloom__filter_8cpp_a71f57bf262fe55db928b19dc124cc0d8_cgraph.map b/d9/dab/bloom__filter_8cpp_a71f57bf262fe55db928b19dc124cc0d8_cgraph.map
deleted file mode 100644
index 23693d7be..000000000
--- a/d9/dab/bloom__filter_8cpp_a71f57bf262fe55db928b19dc124cc0d8_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test_bloom_filter_string" name="test_bloom_filter_string">
-<area shape="rect" id="Node000001" title="Test for bloom filter with string as generic type." alt="" coords="5,31,162,56"/>
-<area shape="rect" id="Node000002" href="$d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4" title="Function djb2 to get hash for the given string." alt="" coords="210,5,390,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="162,32,194,28,194,33,162,37"/>
-<area shape="rect" id="Node000003" href="$d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15" title="Hash function, to get hash for the given string." alt="" coords="218,55,382,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="162,50,202,54,202,59,162,55"/>
-</map>
diff --git a/d9/dab/bloom__filter_8cpp_a71f57bf262fe55db928b19dc124cc0d8_cgraph.md5 b/d9/dab/bloom__filter_8cpp_a71f57bf262fe55db928b19dc124cc0d8_cgraph.md5
deleted file mode 100644
index 2bf3910e4..000000000
--- a/d9/dab/bloom__filter_8cpp_a71f57bf262fe55db928b19dc124cc0d8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9cbc3192e3b54282f4b1dee905d36b41
\ No newline at end of file
diff --git a/d9/dab/bloom__filter_8cpp_a71f57bf262fe55db928b19dc124cc0d8_cgraph.svg b/d9/dab/bloom__filter_8cpp_a71f57bf262fe55db928b19dc124cc0d8_cgraph.svg
deleted file mode 100644
index 0d366bead..000000000
--- a/d9/dab/bloom__filter_8cpp_a71f57bf262fe55db928b19dc124cc0d8_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_bloom_filter_string Pages: 1 -->
-<svg width="297pt" height="64pt"
- viewBox="0.00 0.00 296.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test_bloom_filter_string</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test for bloom filter with string as generic type.">
-<polygon fill="#999999" stroke="#666666" points="117.25,-37.25 0,-37.25 0,-18 117.25,-18 117.25,-37.25"/>
-<text text-anchor="middle" x="58.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_bloom_filter_string</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4" target="_top" xlink:title="Function djb2 to get hash for the given string.">
-<polygon fill="white" stroke="#666666" points="288.5,-56.25 153.25,-56.25 153.25,-37 288.5,-37 288.5,-56.25"/>
-<text text-anchor="middle" x="220.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::hashDJB2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.48,-34.48C125.28,-35.41 133.38,-36.37 141.47,-37.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141,-40.8 151.34,-38.5 141.82,-33.85 141,-40.8"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15" target="_top" xlink:title="Hash function, to get hash for the given string.">
-<polygon fill="white" stroke="#666666" points="282.5,-19.25 159.25,-19.25 159.25,0 282.5,0 282.5,-19.25"/>
-<text text-anchor="middle" x="220.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::hashStr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.48,-21.13C127.25,-20.03 137.5,-18.88 147.58,-17.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.81,-21.24 157.36,-16.65 147.03,-14.29 147.81,-21.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dab/bloom__filter_8cpp_a71f57bf262fe55db928b19dc124cc0d8_cgraph_org.svg b/d9/dab/bloom__filter_8cpp_a71f57bf262fe55db928b19dc124cc0d8_cgraph_org.svg
deleted file mode 100644
index 267837718..000000000
--- a/d9/dab/bloom__filter_8cpp_a71f57bf262fe55db928b19dc124cc0d8_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_bloom_filter_string Pages: 1 -->
-<svg width="297pt" height="64pt"
- viewBox="0.00 0.00 296.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test_bloom_filter_string</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test for bloom filter with string as generic type.">
-<polygon fill="#999999" stroke="#666666" points="117.25,-37.25 0,-37.25 0,-18 117.25,-18 117.25,-37.25"/>
-<text text-anchor="middle" x="58.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_bloom_filter_string</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4" target="_top" xlink:title="Function djb2 to get hash for the given string.">
-<polygon fill="white" stroke="#666666" points="288.5,-56.25 153.25,-56.25 153.25,-37 288.5,-37 288.5,-56.25"/>
-<text text-anchor="middle" x="220.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::hashDJB2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.48,-34.48C125.28,-35.41 133.38,-36.37 141.47,-37.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141,-40.8 151.34,-38.5 141.82,-33.85 141,-40.8"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15" target="_top" xlink:title="Hash function, to get hash for the given string.">
-<polygon fill="white" stroke="#666666" points="282.5,-19.25 159.25,-19.25 159.25,0 282.5,0 282.5,-19.25"/>
-<text text-anchor="middle" x="220.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::hashStr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.48,-21.13C127.25,-20.03 137.5,-18.88 147.58,-17.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.81,-21.24 157.36,-16.65 147.03,-14.29 147.81,-21.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dab/bloom__filter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/dab/bloom__filter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index e66961475..000000000
--- a/d9/dab/bloom__filter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,26 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,144,55,170"/>
-<area shape="rect" id="Node000002" href="$d9/dab/bloom__filter_8cpp.html#a6e509afe40db07681f676ad8da4fb905" title="Test for bitset." alt="" coords="140,63,222,88"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,141,141,94,143,98,56,146"/>
-<area shape="rect" id="Node000007" href="$d9/dab/bloom__filter_8cpp.html#a30edc0d2bb59c185baec81d69d20ed3b" title="Test for bloom filter with int as generic type." alt="" coords="112,144,250,170"/>
-<area shape="poly" id="edge7_Node000001_Node000007" title=" " alt="" coords="55,154,96,154,96,160,55,160"/>
-<area shape="rect" id="Node000010" href="$d9/dab/bloom__filter_8cpp.html#a71f57bf262fe55db928b19dc124cc0d8" title="Test for bloom filter with string as generic type." alt="" coords="103,219,259,244"/>
-<area shape="poly" id="edge10_Node000001_Node000010" title=" " alt="" coords="56,166,140,209,138,214,54,171"/>
-<area shape="rect" id="Node000003" href="$d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c" title="Turn bit on position x to 1s." alt="" coords="307,5,489,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="222,62,331,33,332,38,223,67"/>
-<area shape="rect" id="Node000006" href="$d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac" title="Doest bitset contains element x." alt="" coords="322,55,475,96"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="223,73,306,73,306,78,223,78"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="537,5,664,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="490,16,522,16,522,21,490,21"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="543,59,658,84"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="451,29,535,52,533,57,449,34"/>
-<area shape="poly" id="edge6_Node000006_Node000005" title=" " alt="" coords="475,71,527,70,527,76,475,77"/>
-<area shape="rect" id="Node000008" href="$d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677" title="Hash function for test" alt="" coords="310,120,486,146"/>
-<area shape="poly" id="edge8_Node000007_Node000008" title=" " alt="" coords="250,147,294,142,295,147,250,152"/>
-<area shape="rect" id="Node000009" href="$d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c" title="Hash function for test" alt="" coords="310,169,486,195"/>
-<area shape="poly" id="edge9_Node000007_Node000009" title=" " alt="" coords="250,162,295,167,294,173,250,167"/>
-<area shape="rect" id="Node000011" href="$d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4" title="Function djb2 to get hash for the given string." alt="" coords="308,219,488,244"/>
-<area shape="poly" id="edge11_Node000010_Node000011" title=" " alt="" coords="260,229,292,229,292,234,260,234"/>
-<area shape="rect" id="Node000012" href="$d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15" title="Hash function, to get hash for the given string." alt="" coords="316,268,480,294"/>
-<area shape="poly" id="edge12_Node000010_Node000012" title=" " alt="" coords="241,242,324,261,323,267,240,248"/>
-</map>
diff --git a/d9/dab/bloom__filter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/dab/bloom__filter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index ac248f00f..000000000
--- a/d9/dab/bloom__filter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5c79e0962469f629e0521f0766d4fe82
\ No newline at end of file
diff --git a/d9/dab/bloom__filter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/dab/bloom__filter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 97b2c12cb..000000000
--- a/d9/dab/bloom__filter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,312 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 224 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 502;
-var viewHeight = 224;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-112.25 0,-112.25 0,-93 37,-93 37,-112.25"/>
-<text text-anchor="middle" x="18.5" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dab/bloom__filter_8cpp.html#a6e509afe40db07681f676ad8da4fb905" target="_top" xlink:title="Test for bitset.">
-<polygon fill="white" stroke="#666666" points="162.5,-173.25 100.75,-173.25 100.75,-154 162.5,-154 162.5,-173.25"/>
-<text text-anchor="middle" x="131.62" y="-159.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_bitset</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-112.43C54.91,-122.06 81.97,-136.92 102.43,-148.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.67,-151.17 111.12,-152.92 104.04,-145.04 100.67,-151.17"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d9/dab/bloom__filter_8cpp.html#a30edc0d2bb59c185baec81d69d20ed3b" target="_top" xlink:title="Test for bloom filter with int as generic type.">
-<polygon fill="white" stroke="#666666" points="183.5,-112.25 79.75,-112.25 79.75,-93 183.5,-93 183.5,-112.25"/>
-<text text-anchor="middle" x="131.62" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_bloom_filter_int</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-102.62C46,-102.62 56.96,-102.62 68.31,-102.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.19,-106.13 78.19,-102.63 68.19,-99.13 68.19,-106.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d9/dab/bloom__filter_8cpp.html#a71f57bf262fe55db928b19dc124cc0d8" target="_top" xlink:title="Test for bloom filter with string as generic type.">
-<polygon fill="white" stroke="#666666" points="190.25,-56.25 73,-56.25 73,-37 190.25,-37 190.25,-56.25"/>
-<text text-anchor="middle" x="131.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_bloom_filter_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge10_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge10_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-93.63C54.31,-85.08 80.13,-72.07 100.31,-61.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.85,-65.04 109.21,-57.42 98.7,-58.79 101.85,-65.04"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c" target="_top" xlink:title="Turn bit on position x to 1s.">
-<polygon fill="white" stroke="#666666" points="363,-216.25 226.25,-216.25 226.25,-197 363,-197 363,-216.25"/>
-<text text-anchor="middle" x="294.62" y="-202.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset::add</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.91,-171.71C185.94,-177.86 218.11,-186.46 244.77,-193.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.79,-196.94 254.35,-196.14 245.6,-190.17 243.79,-196.94"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac" target="_top" xlink:title="Doest bitset contains element x.">
-<polygon fill="white" stroke="#666666" points="352.12,-178.88 237.12,-178.88 237.12,-148.38 352.12,-148.38 352.12,-178.88"/>
-<text text-anchor="start" x="245.12" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
-<text text-anchor="middle" x="294.62" y="-154.12" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.91,-163.62C180.59,-163.62 203.66,-163.62 225.49,-163.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.24,-167.13 235.24,-163.63 225.24,-160.13 225.24,-167.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="493.75,-216.25 399,-216.25 399,-197 493.75,-197 493.75,-216.25"/>
-<text text-anchor="middle" x="446.38" y="-202.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M363.49,-206.62C371.5,-206.62 379.61,-206.62 387.46,-206.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="387.22,-210.13 397.22,-206.63 387.22,-203.13 387.22,-210.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="489.62,-176.25 403.12,-176.25 403.12,-157 489.62,-157 489.62,-176.25"/>
-<text text-anchor="middle" x="446.38" y="-162.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.41,-196.53C352.57,-191.42 376.05,-185.14 396.56,-179.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="397.38,-183.07 406.14,-177.11 395.57,-176.31 397.38,-183.07"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge6_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge6_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M352.24,-164.76C365.05,-165.02 378.62,-165.29 391.32,-165.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="391.11,-169.04 401.18,-165.74 391.25,-162.04 391.11,-169.04"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677" target="_top" xlink:title="Hash function for test">
-<polygon fill="white" stroke="#666666" points="360.75,-130.25 228.5,-130.25 228.5,-111 360.75,-111 360.75,-130.25"/>
-<text text-anchor="middle" x="294.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::hashInt_1</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge8_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.57,-108.32C194.21,-109.51 205.65,-110.79 216.99,-112.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="216.43,-115.52 226.75,-113.15 217.2,-108.56 216.43,-115.52"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c" target="_top" xlink:title="Hash function for test">
-<polygon fill="white" stroke="#666666" points="360.75,-93.25 228.5,-93.25 228.5,-74 360.75,-74 360.75,-93.25"/>
-<text text-anchor="middle" x="294.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::hashInt_2</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge9_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge9_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.57,-96.61C194.21,-95.36 205.65,-94.01 216.99,-92.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.23,-96.16 226.75,-91.52 216.41,-89.21 217.23,-96.16"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4" target="_top" xlink:title="Function djb2 to get hash for the given string.">
-<polygon fill="white" stroke="#666666" points="362.25,-56.25 227,-56.25 227,-37 362.25,-37 362.25,-56.25"/>
-<text text-anchor="middle" x="294.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::hashDJB2</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge11_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge11_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.75,-46.62C198.74,-46.62 207.05,-46.62 215.32,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.04,-50.13 225.04,-46.63 215.04,-43.13 215.04,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15" target="_top" xlink:title="Hash function, to get hash for the given string.">
-<polygon fill="white" stroke="#666666" points="356.25,-19.25 233,-19.25 233,0 356.25,0 356.25,-19.25"/>
-<text text-anchor="middle" x="294.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::hashStr</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node12 -->
-<g id="edge12_Node000010_Node000012" class="edge">
-<title>Node10&#45;&gt;Node12</title>
-<g id="a_edge12_Node000010_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.62,-36.51C195.79,-32.11 218.46,-26.9 238.72,-22.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.25,-25.71 248.21,-20.06 237.68,-18.89 239.25,-25.71"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="bloom__filter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dab/bloom__filter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/dab/bloom__filter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 34a766236..000000000
--- a/d9/dab/bloom__filter_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,229 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="502pt" height="224pt"
- viewBox="0.00 0.00 501.75 224.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 220.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-112.25 0,-112.25 0,-93 37,-93 37,-112.25"/>
-<text text-anchor="middle" x="18.5" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dab/bloom__filter_8cpp.html#a6e509afe40db07681f676ad8da4fb905" target="_top" xlink:title="Test for bitset.">
-<polygon fill="white" stroke="#666666" points="162.5,-173.25 100.75,-173.25 100.75,-154 162.5,-154 162.5,-173.25"/>
-<text text-anchor="middle" x="131.62" y="-159.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_bitset</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-112.43C54.91,-122.06 81.97,-136.92 102.43,-148.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.67,-151.17 111.12,-152.92 104.04,-145.04 100.67,-151.17"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d9/dab/bloom__filter_8cpp.html#a30edc0d2bb59c185baec81d69d20ed3b" target="_top" xlink:title="Test for bloom filter with int as generic type.">
-<polygon fill="white" stroke="#666666" points="183.5,-112.25 79.75,-112.25 79.75,-93 183.5,-93 183.5,-112.25"/>
-<text text-anchor="middle" x="131.62" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_bloom_filter_int</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-102.62C46,-102.62 56.96,-102.62 68.31,-102.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.19,-106.13 78.19,-102.63 68.19,-99.13 68.19,-106.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d9/dab/bloom__filter_8cpp.html#a71f57bf262fe55db928b19dc124cc0d8" target="_top" xlink:title="Test for bloom filter with string as generic type.">
-<polygon fill="white" stroke="#666666" points="190.25,-56.25 73,-56.25 73,-37 190.25,-37 190.25,-56.25"/>
-<text text-anchor="middle" x="131.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_bloom_filter_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge10_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge10_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-93.63C54.31,-85.08 80.13,-72.07 100.31,-61.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.85,-65.04 109.21,-57.42 98.7,-58.79 101.85,-65.04"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c" target="_top" xlink:title="Turn bit on position x to 1s.">
-<polygon fill="white" stroke="#666666" points="363,-216.25 226.25,-216.25 226.25,-197 363,-197 363,-216.25"/>
-<text text-anchor="middle" x="294.62" y="-202.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset::add</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.91,-171.71C185.94,-177.86 218.11,-186.46 244.77,-193.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.79,-196.94 254.35,-196.14 245.6,-190.17 243.79,-196.94"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac" target="_top" xlink:title="Doest bitset contains element x.">
-<polygon fill="white" stroke="#666666" points="352.12,-178.88 237.12,-178.88 237.12,-148.38 352.12,-148.38 352.12,-178.88"/>
-<text text-anchor="start" x="245.12" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
-<text text-anchor="middle" x="294.62" y="-154.12" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.91,-163.62C180.59,-163.62 203.66,-163.62 225.49,-163.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.24,-167.13 235.24,-163.63 225.24,-160.13 225.24,-167.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="493.75,-216.25 399,-216.25 399,-197 493.75,-197 493.75,-216.25"/>
-<text text-anchor="middle" x="446.38" y="-202.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M363.49,-206.62C371.5,-206.62 379.61,-206.62 387.46,-206.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="387.22,-210.13 397.22,-206.63 387.22,-203.13 387.22,-210.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="489.62,-176.25 403.12,-176.25 403.12,-157 489.62,-157 489.62,-176.25"/>
-<text text-anchor="middle" x="446.38" y="-162.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.41,-196.53C352.57,-191.42 376.05,-185.14 396.56,-179.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="397.38,-183.07 406.14,-177.11 395.57,-176.31 397.38,-183.07"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge6_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge6_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M352.24,-164.76C365.05,-165.02 378.62,-165.29 391.32,-165.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="391.11,-169.04 401.18,-165.74 391.25,-162.04 391.11,-169.04"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677" target="_top" xlink:title="Hash function for test">
-<polygon fill="white" stroke="#666666" points="360.75,-130.25 228.5,-130.25 228.5,-111 360.75,-111 360.75,-130.25"/>
-<text text-anchor="middle" x="294.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::hashInt_1</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge8_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.57,-108.32C194.21,-109.51 205.65,-110.79 216.99,-112.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="216.43,-115.52 226.75,-113.15 217.2,-108.56 216.43,-115.52"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c" target="_top" xlink:title="Hash function for test">
-<polygon fill="white" stroke="#666666" points="360.75,-93.25 228.5,-93.25 228.5,-74 360.75,-74 360.75,-93.25"/>
-<text text-anchor="middle" x="294.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::hashInt_2</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge9_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge9_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.57,-96.61C194.21,-95.36 205.65,-94.01 216.99,-92.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.23,-96.16 226.75,-91.52 216.41,-89.21 217.23,-96.16"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4" target="_top" xlink:title="Function djb2 to get hash for the given string.">
-<polygon fill="white" stroke="#666666" points="362.25,-56.25 227,-56.25 227,-37 362.25,-37 362.25,-56.25"/>
-<text text-anchor="middle" x="294.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::hashDJB2</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge11_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge11_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.75,-46.62C198.74,-46.62 207.05,-46.62 215.32,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.04,-50.13 225.04,-46.63 215.04,-43.13 215.04,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15" target="_top" xlink:title="Hash function, to get hash for the given string.">
-<polygon fill="white" stroke="#666666" points="356.25,-19.25 233,-19.25 233,0 356.25,0 356.25,-19.25"/>
-<text text-anchor="middle" x="294.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::hashStr</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node12 -->
-<g id="edge12_Node000010_Node000012" class="edge">
-<title>Node10&#45;&gt;Node12</title>
-<g id="a_edge12_Node000010_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.62,-36.51C195.79,-32.11 218.46,-26.9 238.72,-22.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.25,-25.71 248.21,-20.06 237.68,-18.89 239.25,-25.71"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dab/bloom__filter_8cpp_source.html b/d9/dab/bloom__filter_8cpp_source.html
new file mode 100644
index 000000000..bd6af5da5
--- /dev/null
+++ b/d9/dab/bloom__filter_8cpp_source.html
@@ -0,0 +1,356 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/bloom_filter.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/dab/bloom__filter_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">bloom_filter.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/dab/bloom__filter_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;cassert&gt;</span>           </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;functional&gt;</span>        </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;initializer_list&gt;</span>  </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;string&gt;</span>            </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;vector&gt;</span>            </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;iostream&gt;</span>          </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d3c/namespacedata__structures.html">data_structures</a> {</div>
+<div class="foldopen" id="foldopen00040" data-start="{" data-end="};">
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../d9/dae/classdata__structures_1_1_bitset.html">   40</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d9/dae/classdata__structures_1_1_bitset.html">Bitset</a> {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73">   42</a></span>    std::vector&lt;std::size_t&gt; <a class="code hl_variable" href="../../d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73">data</a>;  </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="../../d9/dae/classdata__structures_1_1_bitset.html#ad7f7d479079a95bcc9175465395fa23f">   43</a></span>    <span class="keyword">static</span> <span class="keyword">const</span> std::size_t <a class="code hl_variable" href="../../d9/dae/classdata__structures_1_1_bitset.html#ad7f7d479079a95bcc9175465395fa23f">blockSize</a> =</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="keyword">sizeof</span>(std::size_t);  </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130">Bitset</a>(std::size_t);</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    std::size_t <a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">size</a>();</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c">add</a>(std::size_t);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac">contains</a>(std::size_t);</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>};</div>
+</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="../../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">   57</a></span>std::size_t <a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">Bitset::size</a>() { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73">data</a>.size(); }</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"><a class="line" href="../../d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130">   63</a></span><a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130">Bitset::Bitset</a>(std::size_t initSize) : <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>(initSize) {}</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="foldopen" id="foldopen00071" data-start="{" data-end="}">
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"><a class="line" href="../../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c">   71</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c">Bitset::add</a>(std::size_t x) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    std::size_t blockIndex = x / <a class="code hl_variable" href="../../d9/dae/classdata__structures_1_1_bitset.html#ad7f7d479079a95bcc9175465395fa23f">blockSize</a>;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">if</span> (blockIndex &gt;= <a class="code hl_variable" href="../../d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73">data</a>.size()) {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        <a class="code hl_variable" href="../../d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73">data</a>.resize(blockIndex + 1);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    }</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <a class="code hl_variable" href="../../d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73">data</a>[blockIndex] |= 1 &lt;&lt; (x % <a class="code hl_variable" href="../../d9/dae/classdata__structures_1_1_bitset.html#ad7f7d479079a95bcc9175465395fa23f">blockSize</a>);</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>}</div>
+</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="foldopen" id="foldopen00086" data-start="{" data-end="}">
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="../../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac">   86</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac">Bitset::contains</a>(std::size_t x) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    std::size_t blockIndex = x / <a class="code hl_variable" href="../../d9/dae/classdata__structures_1_1_bitset.html#ad7f7d479079a95bcc9175465395fa23f">blockSize</a>;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keywordflow">if</span> (blockIndex &gt;= <a class="code hl_variable" href="../../d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73">data</a>.size()) {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73">data</a>[blockIndex] &amp; (1 &lt;&lt; (x % <a class="code hl_variable" href="../../d9/dae/classdata__structures_1_1_bitset.html#ad7f7d479079a95bcc9175465395fa23f">blockSize</a>));</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>}</div>
+</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00099" data-start="{" data-end="};">
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"><a class="line" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html">   99</a></span><span class="keyword">class </span><a class="code hl_class" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html">BloomFilter</a> {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"><a class="line" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119">  101</a></span>    <a class="code hl_class" href="../../d9/dae/classdata__structures_1_1_bitset.html">Bitset</a> <a class="code hl_variable" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119">set</a>;  </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    std::vector&lt;std::function&lt;std::size_t(T)&gt;&gt;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"><a class="line" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80">  103</a></span>        <a class="code hl_variable" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80">hashFunks</a>;  </div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <a class="code hl_function" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a">BloomFilter</a>(std::size_t,</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>                std::initializer_list&lt;std::function&lt;std::size_t(T)&gt;&gt;);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840">add</a>(T);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b">contains</a>(T);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>};</div>
+</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00121" data-start="{" data-end="}">
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"><a class="line" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a">  121</a></span><a class="code hl_function" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a">BloomFilter&lt;T&gt;::BloomFilter</a>(</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    std::size_t size,</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    std::initializer_list&lt;std::function&lt;std::size_t(T)&gt;&gt; funks)</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    : set(size), hashFunks(funks) {}</div>
+</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00134" data-start="{" data-end="}">
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"><a class="line" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840">  134</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840">BloomFilter&lt;T&gt;::add</a>(T x) {</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <span class="keywordflow">for</span> (std::size_t i = 0; i &lt; hashFunks.size(); i++) {</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        set.<a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c">add</a>(hashFunks[i](x) % (<span class="keyword">sizeof</span>(std::size_t) * set.<a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">size</a>()));</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    }</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>}</div>
+</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span> </div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00149" data-start="{" data-end="}">
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"><a class="line" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b">  149</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b">BloomFilter&lt;T&gt;::contains</a>(T x) {</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    <span class="keywordflow">for</span> (std::size_t i = 0; i &lt; hashFunks.size(); i++) {</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>        <span class="keywordflow">if</span> (set.<a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac">contains</a>(hashFunks[i](x) %</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>                         (<span class="keyword">sizeof</span>(std::size_t) * set.<a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">size</a>())) == <span class="keyword">false</span>) {</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        }</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    }</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>}</div>
+</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span> </div>
+<div class="foldopen" id="foldopen00166" data-start="{" data-end="}">
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"><a class="line" href="../../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4">  166</a></span><span class="keyword">static</span> std::size_t <a class="code hl_function" href="../../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4">hashDJB2</a>(std::string <span class="keyword">const</span>&amp; s) {</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    std::size_t hash = 5381;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    <span class="keywordflow">for</span> (<span class="keywordtype">char</span> c : s) {</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>        hash = ((hash &lt;&lt; 5) + hash) + c;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    }</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    <span class="keywordflow">return</span> hash;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>}</div>
+</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span> </div>
+<div class="foldopen" id="foldopen00182" data-start="{" data-end="}">
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"><a class="line" href="../../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15">  182</a></span><span class="keyword">static</span> std::size_t <a class="code hl_function" href="../../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15">hashStr</a>(std::string <span class="keyword">const</span>&amp; s) {</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    std::size_t hash = 37;</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    std::size_t primeNum1 = 54059;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    std::size_t primeNum2 = 76963;</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    <span class="keywordflow">for</span> (<span class="keywordtype">char</span> c : s) {</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>        hash = (hash * primeNum1) ^ (c * primeNum2);</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    }</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    <span class="keywordflow">return</span> hash;</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>}</div>
+</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span> </div>
+<div class="foldopen" id="foldopen00199" data-start="{" data-end="}">
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"><a class="line" href="../../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677">  199</a></span>std::size_t <a class="code hl_function" href="../../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677">hashInt_1</a>(<span class="keywordtype">int</span> x) {</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    x = ((x &gt;&gt; 16) ^ x) * 0x45d9f3b;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    x = ((x &gt;&gt; 16) ^ x) * 0x45d9f3b;</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    x = (x &gt;&gt; 16) ^ x;</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    <span class="keywordflow">return</span> x;</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>}</div>
+</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span> </div>
+<div class="foldopen" id="foldopen00213" data-start="{" data-end="}">
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"><a class="line" href="../../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c">  213</a></span>std::size_t <a class="code hl_function" href="../../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c">hashInt_2</a>(<span class="keywordtype">int</span> x) {</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    <span class="keyword">auto</span> y = <span class="keyword">static_cast&lt;</span>std::size_t<span class="keyword">&gt;</span>(x);</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    y = (y ^ (y &gt;&gt; 30)) * <span class="keyword">static_cast&lt;</span>std::size_t<span class="keyword">&gt;</span>(0xbf58476d1ce4e5b9);</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    y = (y ^ (y &gt;&gt; 27)) * <span class="keyword">static_cast&lt;</span>std::size_t<span class="keyword">&gt;</span>(0x94d049bb133111eb);</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    y = y ^ (y &gt;&gt; 31);</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    <span class="keywordflow">return</span> y;</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>}</div>
+</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>}  <span class="comment">// namespace data_structures</span></div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span> </div>
+<div class="foldopen" id="foldopen00226" data-start="{" data-end="}">
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"><a class="line" href="../../d9/dab/bloom__filter_8cpp.html#a71f57bf262fe55db928b19dc124cc0d8">  226</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/dab/bloom__filter_8cpp.html#a71f57bf262fe55db928b19dc124cc0d8">test_bloom_filter_string</a>() {</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    <a class="code hl_class" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html">data_structures::BloomFilter&lt;std::string&gt;</a> filter(</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>        10, {<a class="code hl_function" href="../../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4">data_structures::hashDJB2</a>, <a class="code hl_function" href="../../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15">data_structures::hashStr</a>});</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    std::vector&lt;std::string&gt; toCheck{<span class="stringliteral">&quot;hello&quot;</span>, <span class="stringliteral">&quot;world&quot;</span>, <span class="stringliteral">&quot;!&quot;</span>};</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    std::vector&lt;std::string&gt; toFalse{<span class="stringliteral">&quot;false&quot;</span>, <span class="stringliteral">&quot;world2&quot;</span>, <span class="stringliteral">&quot;!!!&quot;</span>};</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; x : toCheck) {</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>        filter.add(x);</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    }</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; x : toFalse) {</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>        assert(filter.contains(x) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    }</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; x : toCheck) {</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>        assert(filter.contains(x));</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    }</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>}</div>
+</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span> </div>
+<div class="foldopen" id="foldopen00246" data-start="{" data-end="}">
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"><a class="line" href="../../d9/dab/bloom__filter_8cpp.html#a30edc0d2bb59c185baec81d69d20ed3b">  246</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/dab/bloom__filter_8cpp.html#a30edc0d2bb59c185baec81d69d20ed3b">test_bloom_filter_int</a>() {</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    <a class="code hl_class" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html">data_structures::BloomFilter&lt;int&gt;</a> filter(</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>        20, {<a class="code hl_function" href="../../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677">data_structures::hashInt_1</a>, <a class="code hl_function" href="../../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c">data_structures::hashInt_2</a>});</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    std::vector&lt;int&gt; toCheck{100, 200, 300, 50};</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    std::vector&lt;int&gt; toFalse{1, 2, 3, 4, 5, 6, 7, 8};</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x : toCheck) {</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>        filter.add(x);</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    }</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x : toFalse) {</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>        assert(filter.contains(x) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    }</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x : toCheck) {</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>        assert(filter.contains(x));</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>    }</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>}</div>
+</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span> </div>
+<div class="foldopen" id="foldopen00267" data-start="{" data-end="}">
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"><a class="line" href="../../d9/dab/bloom__filter_8cpp.html#a6e509afe40db07681f676ad8da4fb905">  267</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/dab/bloom__filter_8cpp.html#a6e509afe40db07681f676ad8da4fb905">test_bitset</a>() {</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>    <a class="code hl_class" href="../../d9/dae/classdata__structures_1_1_bitset.html">data_structures::Bitset</a> set(2);</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>    std::vector&lt;std::size_t&gt; toCheck{0, 1, 5, 8, 63, 64, 67, 127};</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> x : toCheck) {</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>        set.<a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c">add</a>(x);</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>        assert(set.<a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac">contains</a>(x));</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>    }</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>    assert(set.<a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac">contains</a>(128) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    assert(set.<a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac">contains</a>(256) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>}</div>
+</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span> </div>
+<div class="foldopen" id="foldopen00282" data-start="{" data-end="}">
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"><a class="line" href="../../d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  282</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span> </div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>    <a class="code hl_function" href="../../d9/dab/bloom__filter_8cpp.html#a6e509afe40db07681f676ad8da4fb905">test_bitset</a>();  <span class="comment">// run test for bitset, because bloom filter is depending on it</span></div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>    <a class="code hl_function" href="../../d9/dab/bloom__filter_8cpp.html#a71f57bf262fe55db928b19dc124cc0d8">test_bloom_filter_string</a>();</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>    <a class="code hl_function" href="../../d9/dab/bloom__filter_8cpp.html#a30edc0d2bb59c185baec81d69d20ed3b">test_bloom_filter_int</a>();</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>    </div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>}</div>
+</div>
+<div class="ttc" id="abloom__filter_8cpp_html_a30edc0d2bb59c185baec81d69d20ed3b"><div class="ttname"><a href="../../d9/dab/bloom__filter_8cpp.html#a30edc0d2bb59c185baec81d69d20ed3b">test_bloom_filter_int</a></div><div class="ttdeci">static void test_bloom_filter_int()</div><div class="ttdoc">Test for bloom filter with int as generic type.</div><div class="ttdef"><b>Definition</b> <a href="#l00246">bloom_filter.cpp:246</a></div></div>
+<div class="ttc" id="abloom__filter_8cpp_html_a6e509afe40db07681f676ad8da4fb905"><div class="ttname"><a href="../../d9/dab/bloom__filter_8cpp.html#a6e509afe40db07681f676ad8da4fb905">test_bitset</a></div><div class="ttdeci">static void test_bitset()</div><div class="ttdoc">Test for bitset.</div><div class="ttdef"><b>Definition</b> <a href="#l00267">bloom_filter.cpp:267</a></div></div>
+<div class="ttc" id="abloom__filter_8cpp_html_a71f57bf262fe55db928b19dc124cc0d8"><div class="ttname"><a href="../../d9/dab/bloom__filter_8cpp.html#a71f57bf262fe55db928b19dc124cc0d8">test_bloom_filter_string</a></div><div class="ttdeci">static void test_bloom_filter_string()</div><div class="ttdoc">Test for bloom filter with string as generic type.</div><div class="ttdef"><b>Definition</b> <a href="#l00226">bloom_filter.cpp:226</a></div></div>
+<div class="ttc" id="abloom__filter_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00282">bloom_filter.cpp:282</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_bitset_html"><div class="ttname"><a href="../../d9/dae/classdata__structures_1_1_bitset.html">data_structures::Bitset</a></div><div class="ttdoc">Simple bitset implementation for bloom filter.</div><div class="ttdef"><b>Definition</b> <a href="#l00040">bloom_filter.cpp:40</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_bitset_html_a15b05aabb28f9b1896b0a61e8ef60130"><div class="ttname"><a href="../../d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130">data_structures::Bitset::Bitset</a></div><div class="ttdeci">Bitset(std::size_t)</div><div class="ttdoc">BitSet class constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00063">bloom_filter.cpp:63</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_bitset_html_a17dbe1b1d559302312e8091f82f7499c"><div class="ttname"><a href="../../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c">data_structures::Bitset::add</a></div><div class="ttdeci">void add(std::size_t)</div><div class="ttdoc">Turn bit on position x to 1s.</div><div class="ttdef"><b>Definition</b> <a href="#l00071">bloom_filter.cpp:71</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_bitset_html_a2f1f44d6a12b0de4aaf242872b1c7b54"><div class="ttname"><a href="../../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">data_structures::Bitset::size</a></div><div class="ttdeci">std::size_t size()</div><div class="ttdoc">Utility function to return the size of the inner array.</div><div class="ttdef"><b>Definition</b> <a href="#l00057">bloom_filter.cpp:57</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_bitset_html_a9ef54c7c3f6494b36ead3ae2e5cf43ac"><div class="ttname"><a href="../../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac">data_structures::Bitset::contains</a></div><div class="ttdeci">bool contains(std::size_t)</div><div class="ttdoc">Doest bitset contains element x.</div><div class="ttdef"><b>Definition</b> <a href="#l00086">bloom_filter.cpp:86</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_bitset_html_ad7f7d479079a95bcc9175465395fa23f"><div class="ttname"><a href="../../d9/dae/classdata__structures_1_1_bitset.html#ad7f7d479079a95bcc9175465395fa23f">data_structures::Bitset::blockSize</a></div><div class="ttdeci">static const std::size_t blockSize</div><div class="ttdef"><b>Definition</b> <a href="#l00043">bloom_filter.cpp:43</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_bitset_html_ae86688cf99b77342deedb75149573e73"><div class="ttname"><a href="../../d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73">data_structures::Bitset::data</a></div><div class="ttdeci">std::vector&lt; std::size_t &gt; data</div><div class="ttdoc">short info of this variable</div><div class="ttdef"><b>Definition</b> <a href="#l00042">bloom_filter.cpp:42</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_bloom_filter_html"><div class="ttname"><a href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html">data_structures::BloomFilter</a></div><div class="ttdoc">Bloom filter template class.</div><div class="ttdef"><b>Definition</b> <a href="#l00099">bloom_filter.cpp:99</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_bloom_filter_html_a576db259488dbfb67624a9652a5ab08b"><div class="ttname"><a href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b">data_structures::BloomFilter::contains</a></div><div class="ttdeci">bool contains(T)</div><div class="ttdoc">Check element function for Bloom filter.</div><div class="ttdef"><b>Definition</b> <a href="#l00149">bloom_filter.cpp:149</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_bloom_filter_html_a65ca6742d3be88d4aca4f080068a7a80"><div class="ttname"><a href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80">data_structures::BloomFilter::hashFunks</a></div><div class="ttdeci">std::vector&lt; std::function&lt; std::size_t(T)&gt; &gt; hashFunks</div><div class="ttdoc">hash functions for T type</div><div class="ttdef"><b>Definition</b> <a href="#l00103">bloom_filter.cpp:103</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_bloom_filter_html_a67bed8ef62fcb1f33b6c72df47dcf840"><div class="ttname"><a href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840">data_structures::BloomFilter::add</a></div><div class="ttdeci">void add(T)</div><div class="ttdoc">Add function for Bloom filter.</div><div class="ttdef"><b>Definition</b> <a href="#l00134">bloom_filter.cpp:134</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_bloom_filter_html_a6910d29951b57ab56e7a3db405aa1f1a"><div class="ttname"><a href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a">data_structures::BloomFilter::BloomFilter</a></div><div class="ttdeci">BloomFilter(std::size_t, std::initializer_list&lt; std::function&lt; std::size_t(T)&gt; &gt;)</div><div class="ttdoc">Constructor for Bloom filter.</div><div class="ttdef"><b>Definition</b> <a href="#l00121">bloom_filter.cpp:121</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_bloom_filter_html_a90268d7901e2c1ab5f8bf8b24a30e119"><div class="ttname"><a href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119">data_structures::BloomFilter::set</a></div><div class="ttdeci">Bitset set</div><div class="ttdoc">inner bitset for elements</div><div class="ttdef"><b>Definition</b> <a href="#l00101">bloom_filter.cpp:101</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html">data_structures</a></div><div class="ttdoc">for IO operations</div></div>
+<div class="ttc" id="anamespacedata__structures_html_a271c753baf6dc5ac6f19fa03c5873eb4"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4">data_structures::hashDJB2</a></div><div class="ttdeci">static std::size_t hashDJB2(std::string const &amp;s)</div><div class="ttdoc">Function djb2 to get hash for the given string.</div><div class="ttdef"><b>Definition</b> <a href="#l00166">bloom_filter.cpp:166</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html_a35eb2bc3edbb52f9c5f0b1e51046ef15"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15">data_structures::hashStr</a></div><div class="ttdeci">static std::size_t hashStr(std::string const &amp;s)</div><div class="ttdoc">Hash function, to get hash for the given string.</div><div class="ttdef"><b>Definition</b> <a href="#l00182">bloom_filter.cpp:182</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html_a9ed236419034917c5270c1dccd220b5c"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c">data_structures::hashInt_2</a></div><div class="ttdeci">std::size_t hashInt_2(int x)</div><div class="ttdoc">Hash function for test</div><div class="ttdef"><b>Definition</b> <a href="#l00213">bloom_filter.cpp:213</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html_aa6deb9d4a0f63ea97aef3dce4c6c6677"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677">data_structures::hashInt_1</a></div><div class="ttdeci">std::size_t hashInt_1(int x)</div><div class="ttdoc">Hash function for test</div><div class="ttdef"><b>Definition</b> <a href="#l00199">bloom_filter.cpp:199</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d9/dab/bloom__filter_8cpp.html">bloom_filter.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/dad/rb__tree_8cpp_source.html b/d9/dad/rb__tree_8cpp_source.html
new file mode 100644
index 000000000..a9cd66aa6
--- /dev/null
+++ b/d9/dad/rb__tree_8cpp_source.html
@@ -0,0 +1,651 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/rb_tree.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/dad/rb__tree_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">rb_tree.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include&lt;iostream&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span> </div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span>{</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span>    <span class="keywordtype">int</span> key;</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *parent;</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    <span class="keywordtype">char</span> color;</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *left;</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *right;</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>};</div>
+<div class="foldopen" id="foldopen00013" data-start="{" data-end="};">
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"><a class="line" href="../../d8/d72/class_r_btree.html">   13</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d8/d72/class_r_btree.html">RBtree</a></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>{</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *root;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *q;</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="keyword">public</span>:</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <a class="code hl_class" href="../../d8/d72/class_r_btree.html">RBtree</a>()</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        q = NULL;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        root = NULL;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    }</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    <span class="keywordtype">void</span> insert();</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="keywordtype">void</span> insertfix(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *);</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="keywordtype">void</span> leftrotate(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *);</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="keywordtype">void</span> rightrotate(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *);</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordtype">void</span> del();</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* successor(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *);</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordtype">void</span> delfix(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *);</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordtype">void</span> disp();</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordtype">void</span> display(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *);</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordtype">void</span> <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>();</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>};</div>
+</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keywordtype">void</span> RBtree::insert()</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>{</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordtype">int</span> z, i = 0;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    cout &lt;&lt; <span class="stringliteral">&quot;\nEnter key of the node to be inserted: &quot;</span>;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    cin &gt;&gt; z;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *p, *q;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    t-&gt;key = z;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    t-&gt;left = NULL;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    t-&gt;right = NULL;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    t-&gt;color = <span class="charliteral">&#39;r&#39;</span>;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    p = root;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    q = NULL;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">if</span> (root == NULL)</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        root = t;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        t-&gt;parent = NULL;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <span class="keywordflow">while</span> (p != NULL)</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            q = p;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            <span class="keywordflow">if</span> (p-&gt;key &lt; t-&gt;key)</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>                p = p-&gt;right;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>                p = p-&gt;left;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        }</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        t-&gt;parent = q;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">if</span> (q-&gt;key &lt; t-&gt;key)</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            q-&gt;right = t;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            q-&gt;left = t;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    insertfix(t);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>}</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="keywordtype">void</span> RBtree::insertfix(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t)</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>{</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *u;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">if</span> (root == t)</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        t-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordflow">while</span> (t-&gt;parent != NULL &amp;&amp; t-&gt;parent-&gt;color == <span class="charliteral">&#39;r&#39;</span>)</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a> = t-&gt;parent-&gt;parent;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>-&gt;left == t-&gt;parent)</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>-&gt;right != NULL)</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>                u = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>-&gt;right;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>                <span class="keywordflow">if</span> (u-&gt;color == <span class="charliteral">&#39;r&#39;</span>)</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>                {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>                    t-&gt;parent-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>                    u-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>                    <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>-&gt;color = <span class="charliteral">&#39;r&#39;</span>;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>                    t = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>                }</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>            }</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>            {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>                <span class="keywordflow">if</span> (t-&gt;parent-&gt;right == t)</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>                {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>                    t = t-&gt;parent;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>                    leftrotate(t);</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>                }</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>                t-&gt;parent-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>                <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>-&gt;color = <span class="charliteral">&#39;r&#39;</span>;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>                rightrotate(g);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>            }</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        }</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>            <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>-&gt;left != NULL)</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>                u = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>-&gt;left;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>                <span class="keywordflow">if</span> (u-&gt;color == <span class="charliteral">&#39;r&#39;</span>)</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>                {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>                    t-&gt;parent-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>                    u-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>                    <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>-&gt;color = <span class="charliteral">&#39;r&#39;</span>;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>                    t = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>                }</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>            }</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>            {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>                <span class="keywordflow">if</span> (t-&gt;parent-&gt;left == t)</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>                {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>                    t = t-&gt;parent;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>                    rightrotate(t);</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>                }</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>                t-&gt;parent-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>                <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>-&gt;color = <span class="charliteral">&#39;r&#39;</span>;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>                leftrotate(g);</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>            }</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        }</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        root-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    }</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>}</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span><span class="keywordtype">void</span> RBtree::del()</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>{</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <span class="keywordflow">if</span> (root == NULL)</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nEmpty Tree.&quot;</span>;</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    }</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    <span class="keywordtype">int</span> x;</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the key of the node to be deleted: &quot;</span>;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    cin &gt;&gt; x;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *p;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    p = root;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *y = NULL;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *q = NULL;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    <span class="keywordtype">int</span> found = 0;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    <span class="keywordflow">while</span> (p != NULL &amp;&amp; found == 0)</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    {</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>        <span class="keywordflow">if</span> (p-&gt;key == x)</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>            found = 1;</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        <span class="keywordflow">if</span> (found == 0)</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>        {</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>            <span class="keywordflow">if</span> (p-&gt;key &lt; x)</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>                p = p-&gt;right;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>                p = p-&gt;left;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>        }</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    }</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    <span class="keywordflow">if</span> (found == 0)</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    {</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nElement Not Found.&quot;</span>;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    }</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    {</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nDeleted Element: &quot;</span> &lt;&lt; p-&gt;key;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nColour: &quot;</span>;</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>        <span class="keywordflow">if</span> (p-&gt;color == <span class="charliteral">&#39;b&#39;</span>)</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>            cout &lt;&lt; <span class="stringliteral">&quot;Black\n&quot;</span>;</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>            cout &lt;&lt; <span class="stringliteral">&quot;Red\n&quot;</span>;</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span> </div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        <span class="keywordflow">if</span> (p-&gt;parent != NULL)</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>            cout &lt;&lt; <span class="stringliteral">&quot;\nParent: &quot;</span> &lt;&lt; p-&gt;parent-&gt;key;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>            cout &lt;&lt; <span class="stringliteral">&quot;\nThere is no parent of the node.  &quot;</span>;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        <span class="keywordflow">if</span> (p-&gt;right != NULL)</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>            cout &lt;&lt; <span class="stringliteral">&quot;\nRight Child: &quot;</span> &lt;&lt; p-&gt;right-&gt;key;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>            cout &lt;&lt; <span class="stringliteral">&quot;\nThere is no right child of the node.  &quot;</span>;</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>        <span class="keywordflow">if</span> (p-&gt;left != NULL)</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>            cout &lt;&lt; <span class="stringliteral">&quot;\nLeft Child: &quot;</span> &lt;&lt; p-&gt;left-&gt;key;</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>            cout &lt;&lt; <span class="stringliteral">&quot;\nThere is no left child of the node.  &quot;</span>;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nNode Deleted.&quot;</span>;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        <span class="keywordflow">if</span> (p-&gt;left == NULL || p-&gt;right == NULL)</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>            y = p;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>            y = successor(p);</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        <span class="keywordflow">if</span> (y-&gt;left != NULL)</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>            q = y-&gt;left;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>        {</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>            <span class="keywordflow">if</span> (y-&gt;right != NULL)</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>                q = y-&gt;right;</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>                q = NULL;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>        }</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>        <span class="keywordflow">if</span> (q != NULL)</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>            q-&gt;parent = y-&gt;parent;</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>        <span class="keywordflow">if</span> (y-&gt;parent == NULL)</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>            root = q;</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>        {</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>            <span class="keywordflow">if</span> (y == y-&gt;parent-&gt;left)</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>                y-&gt;parent-&gt;left = q;</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>                y-&gt;parent-&gt;right = q;</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>        }</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>        <span class="keywordflow">if</span> (y != p)</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>        {</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>            p-&gt;color = y-&gt;color;</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>            p-&gt;key = y-&gt;key;</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>        }</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>        <span class="keywordflow">if</span> (y-&gt;color == <span class="charliteral">&#39;b&#39;</span>)</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>            delfix(q);</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    }</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>}</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span> </div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span><span class="keywordtype">void</span> RBtree::delfix(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *p)</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>{</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *s;</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    <span class="keywordflow">while</span> (p != root &amp;&amp; p-&gt;color == <span class="charliteral">&#39;b&#39;</span>)</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    {</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>        <span class="keywordflow">if</span> (p-&gt;parent-&gt;left == p)</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>        {</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>            s = p-&gt;parent-&gt;right;</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>            <span class="keywordflow">if</span> (s-&gt;color == <span class="charliteral">&#39;r&#39;</span>)</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>            {</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>                s-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>                p-&gt;parent-&gt;color = <span class="charliteral">&#39;r&#39;</span>;</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>                leftrotate(p-&gt;parent);</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>                s = p-&gt;parent-&gt;right;</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>            }</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>            <span class="keywordflow">if</span> (s-&gt;right-&gt;color == <span class="charliteral">&#39;b&#39;</span>&amp;&amp;s-&gt;left-&gt;color == <span class="charliteral">&#39;b&#39;</span>)</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>            {</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>                s-&gt;color = <span class="charliteral">&#39;r&#39;</span>;</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>                p = p-&gt;parent;</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>            }</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>            {</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>                <span class="keywordflow">if</span> (s-&gt;right-&gt;color == <span class="charliteral">&#39;b&#39;</span>)</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>                {</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>                    s-&gt;left-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>                    s-&gt;color = <span class="charliteral">&#39;r&#39;</span>;</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>                    rightrotate(s);</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>                    s = p-&gt;parent-&gt;right;</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>                }</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>                s-&gt;color = p-&gt;parent-&gt;color;</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>                p-&gt;parent-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>                s-&gt;right-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>                leftrotate(p-&gt;parent);</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>                p = root;</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>            }</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>        }</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>        {</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>            s = p-&gt;parent-&gt;left;</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>            <span class="keywordflow">if</span> (s-&gt;color == <span class="charliteral">&#39;r&#39;</span>)</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>            {</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>                s-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>                p-&gt;parent-&gt;color = <span class="charliteral">&#39;r&#39;</span>;</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>                rightrotate(p-&gt;parent);</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>                s = p-&gt;parent-&gt;left;</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>            }</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>            <span class="keywordflow">if</span> (s-&gt;left-&gt;color == <span class="charliteral">&#39;b&#39;</span>&amp;&amp;s-&gt;right-&gt;color == <span class="charliteral">&#39;b&#39;</span>)</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>            {</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>                s-&gt;color = <span class="charliteral">&#39;r&#39;</span>;</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>                p = p-&gt;parent;</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>            }</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>            {</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>                <span class="keywordflow">if</span> (s-&gt;left-&gt;color == <span class="charliteral">&#39;b&#39;</span>)</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>                {</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>                    s-&gt;right-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>                    s-&gt;color = <span class="charliteral">&#39;r&#39;</span>;</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>                    leftrotate(s);</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>                    s = p-&gt;parent-&gt;left;</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>                }</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>                s-&gt;color = p-&gt;parent-&gt;color;</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>                p-&gt;parent-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>                s-&gt;left-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>                rightrotate(p-&gt;parent);</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>                p = root;</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>            }</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>        }</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>        p-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>        root-&gt;color = <span class="charliteral">&#39;b&#39;</span>;</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>    }</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>}</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span> </div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span><span class="keywordtype">void</span> RBtree::leftrotate(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *p)</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>{</div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>    <span class="keywordflow">if</span> (p-&gt;right == NULL)</div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>    <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>    {</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *y = p-&gt;right;</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>        <span class="keywordflow">if</span> (y-&gt;left != NULL)</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>        {</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>            p-&gt;right = y-&gt;left;</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>            y-&gt;left-&gt;parent = p;</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>        }</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>            p-&gt;right = NULL;</div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>        <span class="keywordflow">if</span> (p-&gt;parent != NULL)</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>            y-&gt;parent = p-&gt;parent;</div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>        <span class="keywordflow">if</span> (p-&gt;parent == NULL)</div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>            root = y;</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>        {</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>            <span class="keywordflow">if</span> (p == p-&gt;parent-&gt;left)</div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>                p-&gt;parent-&gt;left = y;</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>                p-&gt;parent-&gt;right = y;</div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>        }</div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>        y-&gt;left = p;</div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>        p-&gt;parent = y;</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>    }</div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>}</div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span><span class="keywordtype">void</span> RBtree::rightrotate(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *p)</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>{</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>    <span class="keywordflow">if</span> (p-&gt;left == NULL)</div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>    <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>    {</div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *y = p-&gt;left;</div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>        <span class="keywordflow">if</span> (y-&gt;right != NULL)</div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>        {</div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>            p-&gt;left = y-&gt;right;</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>            y-&gt;right-&gt;parent = p;</div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>        }</div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>            p-&gt;left = NULL;</div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>        <span class="keywordflow">if</span> (p-&gt;parent != NULL)</div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>            y-&gt;parent = p-&gt;parent;</div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>        <span class="keywordflow">if</span> (p-&gt;parent == NULL)</div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>            root = y;</div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>        {</div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>            <span class="keywordflow">if</span> (p == p-&gt;parent-&gt;left)</div>
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span>                p-&gt;parent-&gt;left = y;</div>
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>                p-&gt;parent-&gt;right = y;</div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>        }</div>
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>        y-&gt;right = p;</div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>        p-&gt;parent = y;</div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>    }</div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>}</div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span> </div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* RBtree::successor(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *p)</div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>{</div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *y = NULL;</div>
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>    <span class="keywordflow">if</span> (p-&gt;left != NULL)</div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>    {</div>
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>        y = p-&gt;left;</div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>        <span class="keywordflow">while</span> (y-&gt;right != NULL)</div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>            y = y-&gt;right;</div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>    }</div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>    <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>    {</div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>        y = p-&gt;right;</div>
+<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>        <span class="keywordflow">while</span> (y-&gt;left != NULL)</div>
+<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>            y = y-&gt;left;</div>
+<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>    }</div>
+<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>    <span class="keywordflow">return</span> y;</div>
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>}</div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span> </div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span><span class="keywordtype">void</span> RBtree::disp()</div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>{</div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>    display(root);</div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>}</div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span><span class="keywordtype">void</span> RBtree::display(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *p)</div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>{</div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>    <span class="keywordflow">if</span> (root == NULL)</div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>    {</div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nEmpty Tree.&quot;</span>;</div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>    }</div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>    <span class="keywordflow">if</span> (p != NULL)</div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>    {</div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n\t NODE: &quot;</span>;</div>
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n Key: &quot;</span> &lt;&lt; p-&gt;key;</div>
+<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n Colour: &quot;</span>;</div>
+<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>        <span class="keywordflow">if</span> (p-&gt;color == <span class="charliteral">&#39;b&#39;</span>)</div>
+<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>            cout &lt;&lt; <span class="stringliteral">&quot;Black&quot;</span>;</div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>            cout &lt;&lt; <span class="stringliteral">&quot;Red&quot;</span>;</div>
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>        <span class="keywordflow">if</span> (p-&gt;parent != NULL)</div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n Parent: &quot;</span> &lt;&lt; p-&gt;parent-&gt;key;</div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n There is no parent of the node.  &quot;</span>;</div>
+<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>        <span class="keywordflow">if</span> (p-&gt;right != NULL)</div>
+<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n Right Child: &quot;</span> &lt;&lt; p-&gt;right-&gt;key;</div>
+<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n There is no right child of the node.  &quot;</span>;</div>
+<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span>        <span class="keywordflow">if</span> (p-&gt;left != NULL)</div>
+<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n Left Child: &quot;</span> &lt;&lt; p-&gt;left-&gt;key;</div>
+<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n There is no left child of the node.  &quot;</span>;</div>
+<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>        cout &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span>        <span class="keywordflow">if</span> (p-&gt;left)</div>
+<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>        {</div>
+<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n\nLeft:\n&quot;</span>;</div>
+<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>            display(p-&gt;left);</div>
+<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>        }</div>
+<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>        <span class="comment">/*else</span></div>
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span><span class="comment">         cout&lt;&lt;&quot;\nNo Left Child.\n&quot;;*/</span></div>
+<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>        <span class="keywordflow">if</span> (p-&gt;right)</div>
+<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>        {</div>
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n\nRight:\n&quot;</span>;</div>
+<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>            display(p-&gt;right);</div>
+<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>        }</div>
+<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>        <span class="comment">/*else</span></div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span><span class="comment">         cout&lt;&lt;&quot;\nNo Right Child.\n&quot;*/</span></div>
+<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>    }</div>
+<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>}</div>
+<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span><span class="keywordtype">void</span> RBtree::search()</div>
+<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>{</div>
+<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>    <span class="keywordflow">if</span> (root == NULL)</div>
+<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span>    {</div>
+<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nEmpty Tree\n&quot;</span>;</div>
+<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>    }</div>
+<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>    <span class="keywordtype">int</span> x;</div>
+<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span>    cout &lt;&lt; <span class="stringliteral">&quot;\n Enter key of the node to be searched: &quot;</span>;</div>
+<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>    cin &gt;&gt; x;</div>
+<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *p = root;</div>
+<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>    <span class="keywordtype">int</span> found = 0;</div>
+<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>    <span class="keywordflow">while</span> (p != NULL &amp;&amp; found == 0)</div>
+<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>    {</div>
+<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>        <span class="keywordflow">if</span> (p-&gt;key == x)</div>
+<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>            found = 1;</div>
+<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span>        <span class="keywordflow">if</span> (found == 0)</div>
+<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>        {</div>
+<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>            <span class="keywordflow">if</span> (p-&gt;key &lt; x)</div>
+<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>                p = p-&gt;right;</div>
+<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>                p = p-&gt;left;</div>
+<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>        }</div>
+<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span>    }</div>
+<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span>    <span class="keywordflow">if</span> (found == 0)</div>
+<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nElement Not Found.&quot;</span>;</div>
+<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span>    <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span>    {</div>
+<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n\t FOUND NODE: &quot;</span>;</div>
+<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n Key: &quot;</span> &lt;&lt; p-&gt;key;</div>
+<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n Colour: &quot;</span>;</div>
+<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span>        <span class="keywordflow">if</span> (p-&gt;color == <span class="charliteral">&#39;b&#39;</span>)</div>
+<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>            cout &lt;&lt; <span class="stringliteral">&quot;Black&quot;</span>;</div>
+<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>            cout &lt;&lt; <span class="stringliteral">&quot;Red&quot;</span>;</div>
+<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>        <span class="keywordflow">if</span> (p-&gt;parent != NULL)</div>
+<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n Parent: &quot;</span> &lt;&lt; p-&gt;parent-&gt;key;</div>
+<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n There is no parent of the node.  &quot;</span>;</div>
+<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span>        <span class="keywordflow">if</span> (p-&gt;right != NULL)</div>
+<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n Right Child: &quot;</span> &lt;&lt; p-&gt;right-&gt;key;</div>
+<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n There is no right child of the node.  &quot;</span>;</div>
+<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span>        <span class="keywordflow">if</span> (p-&gt;left != NULL)</div>
+<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n Left Child: &quot;</span> &lt;&lt; p-&gt;left-&gt;key;</div>
+<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span>            cout &lt;&lt; <span class="stringliteral">&quot;\n There is no left child of the node.  &quot;</span>;</div>
+<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span>        cout &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span> </div>
+<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span>    }</div>
+<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span>}</div>
+<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>()</div>
+<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span>{</div>
+<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span>    <span class="keywordtype">int</span> ch, y = 0;</div>
+<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span>    <a class="code hl_class" href="../../d8/d72/class_r_btree.html">RBtree</a> obj;</div>
+<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span>    <span class="keywordflow">do</span></div>
+<div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span>    {</div>
+<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n\t RED BLACK TREE &quot;</span>;</div>
+<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n 1. Insert in the tree &quot;</span>;</div>
+<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n 2. Delete a node from the tree&quot;</span>;</div>
+<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n 3. Search for an element in the tree&quot;</span>;</div>
+<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n 4. Display the tree &quot;</span>;</div>
+<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n 5. Exit &quot;</span>;</div>
+<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nEnter Your Choice: &quot;</span>;</div>
+<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span>        cin &gt;&gt; ch;</div>
+<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span>        <span class="keywordflow">switch</span> (ch)</div>
+<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span>        {</div>
+<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span>        <span class="keywordflow">case</span> 1: obj.insert();</div>
+<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span>            cout &lt;&lt; <span class="stringliteral">&quot;\nNode Inserted.\n&quot;</span>;</div>
+<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>        <span class="keywordflow">case</span> 2: obj.del();</div>
+<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span>        <span class="keywordflow">case</span> 3: obj.search();</div>
+<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span>        <span class="keywordflow">case</span> 4: obj.disp();</div>
+<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span>        <span class="keywordflow">case</span> 5: y = 1;</div>
+<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>        <span class="keywordflow">default</span>: cout &lt;&lt; <span class="stringliteral">&quot;\nEnter a Valid Choice.&quot;</span>;</div>
+<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span>        }</div>
+<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>        cout &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span> </div>
+<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>    } <span class="keywordflow">while</span> (y != 1);</div>
+<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span>    <span class="keywordflow">return</span> 1;</div>
+<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span>}</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="aclass_r_btree_html"><div class="ttname"><a href="../../d8/d72/class_r_btree.html">RBtree</a></div><div class="ttdef"><b>Definition</b> <a href="#l00013">rb_tree.cpp:14</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00115">composite_simpson_rule.cpp:115</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
+<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> <a href="../../df/dd5/binary__search_8cpp_source.html#l00047">binary_search.cpp:47</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><b>rb_tree.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/dae/classdata__structures_1_1_bitset.html b/d9/dae/classdata__structures_1_1_bitset.html
index accfde954..6d560bdd6 100644
--- a/d9/dae/classdata__structures_1_1_bitset.html
+++ b/d9/dae/classdata__structures_1_1_bitset.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::Bitset Class Reference</title>
+<title>TheAlgorithms/C++: data_structures::Bitset Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,38 +135,39 @@ $(function(){initNavTree('d9/dae/classdata__structures_1_1_bitset.html','../../'
 <div class="dynheader">
 Collaboration diagram for data_structures::Bitset:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d9a/classdata__structures_1_1_bitset__coll__graph.svg" width="288" height="214"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d9a/classdata__structures_1_1_bitset__coll__graph.svg" width="179" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:a15b05aabb28f9b1896b0a61e8ef60130" id="r_a15b05aabb28f9b1896b0a61e8ef60130"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a15b05aabb28f9b1896b0a61e8ef60130">Bitset</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>)</td></tr>
+<tr class="memitem:a15b05aabb28f9b1896b0a61e8ef60130" id="r_a15b05aabb28f9b1896b0a61e8ef60130"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a15b05aabb28f9b1896b0a61e8ef60130">Bitset</a> (std::size_t)</td></tr>
 <tr class="memdesc:a15b05aabb28f9b1896b0a61e8ef60130"><td class="mdescLeft">&#160;</td><td class="mdescRight">BitSet class constructor.  <br /></td></tr>
 <tr class="separator:a15b05aabb28f9b1896b0a61e8ef60130"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2f1f44d6a12b0de4aaf242872b1c7b54" id="r_a2f1f44d6a12b0de4aaf242872b1c7b54"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2f1f44d6a12b0de4aaf242872b1c7b54">size</a> ()</td></tr>
+<tr class="memitem:a2f1f44d6a12b0de4aaf242872b1c7b54" id="r_a2f1f44d6a12b0de4aaf242872b1c7b54"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2f1f44d6a12b0de4aaf242872b1c7b54">size</a> ()</td></tr>
 <tr class="memdesc:a2f1f44d6a12b0de4aaf242872b1c7b54"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to return the size of the inner array.  <br /></td></tr>
 <tr class="separator:a2f1f44d6a12b0de4aaf242872b1c7b54"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a17dbe1b1d559302312e8091f82f7499c" id="r_a17dbe1b1d559302312e8091f82f7499c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a17dbe1b1d559302312e8091f82f7499c">add</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>)</td></tr>
+<tr class="memitem:a17dbe1b1d559302312e8091f82f7499c" id="r_a17dbe1b1d559302312e8091f82f7499c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a17dbe1b1d559302312e8091f82f7499c">add</a> (std::size_t)</td></tr>
 <tr class="memdesc:a17dbe1b1d559302312e8091f82f7499c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Turn bit on position x to 1s.  <br /></td></tr>
 <tr class="separator:a17dbe1b1d559302312e8091f82f7499c"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a9ef54c7c3f6494b36ead3ae2e5cf43ac" id="r_a9ef54c7c3f6494b36ead3ae2e5cf43ac"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9ef54c7c3f6494b36ead3ae2e5cf43ac">contains</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>)</td></tr>
+<tr class="memitem:a9ef54c7c3f6494b36ead3ae2e5cf43ac" id="r_a9ef54c7c3f6494b36ead3ae2e5cf43ac"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9ef54c7c3f6494b36ead3ae2e5cf43ac">contains</a> (std::size_t)</td></tr>
 <tr class="memdesc:a9ef54c7c3f6494b36ead3ae2e5cf43ac"><td class="mdescLeft">&#160;</td><td class="mdescRight">Doest bitset contains element x.  <br /></td></tr>
 <tr class="separator:a9ef54c7c3f6494b36ead3ae2e5cf43ac"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:ae86688cf99b77342deedb75149573e73" id="r_ae86688cf99b77342deedb75149573e73"><td class="memItemLeft" align="right" valign="top"><a id="ae86688cf99b77342deedb75149573e73" name="ae86688cf99b77342deedb75149573e73"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
-<tr class="memdesc:ae86688cf99b77342deedb75149573e73"><td class="mdescLeft">&#160;</td><td class="mdescRight">short info of this variable <br /></td></tr>
+<tr class="memitem:ae86688cf99b77342deedb75149573e73" id="r_ae86688cf99b77342deedb75149573e73"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::size_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae86688cf99b77342deedb75149573e73">data</a></td></tr>
+<tr class="memdesc:ae86688cf99b77342deedb75149573e73"><td class="mdescLeft">&#160;</td><td class="mdescRight">short info of this variable  <br /></td></tr>
 <tr class="separator:ae86688cf99b77342deedb75149573e73"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-static-attribs" name="pri-static-attribs"></a>
 Static Private Attributes</h2></td></tr>
-<tr class="memitem:ad7f7d479079a95bcc9175465395fa23f" id="r_ad7f7d479079a95bcc9175465395fa23f"><td class="memItemLeft" align="right" valign="top">static const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad7f7d479079a95bcc9175465395fa23f">blockSize</a></td></tr>
+<tr class="memitem:ad7f7d479079a95bcc9175465395fa23f" id="r_ad7f7d479079a95bcc9175465395fa23f"><td class="memItemLeft" align="right" valign="top">static const std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad7f7d479079a95bcc9175465395fa23f">blockSize</a></td></tr>
 <tr class="separator:ad7f7d479079a95bcc9175465395fa23f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Simple bitset implementation for bloom filter. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a15b05aabb28f9b1896b0a61e8ef60130" name="a15b05aabb28f9b1896b0a61e8ef60130"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a15b05aabb28f9b1896b0a61e8ef60130">&#9670;&#160;</a></span>Bitset()</h2>
@@ -163,7 +181,7 @@ Static Private Attributes</h2></td></tr>
         <tr>
           <td class="memname">data_structures::Bitset::Bitset </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></td>          <td class="paramname"><span class="paramname"><em>initSize</em></span></td><td>)</td>
+          <td class="paramtype">std::size_t</td>          <td class="paramname"><span class="paramname"><em>initSize</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -181,8 +199,10 @@ Static Private Attributes</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00063">63</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   63</span>: <a class="code hl_variable" href="#ae86688cf99b77342deedb75149573e73">data</a>(initSize) {}</div>
-<div class="ttc" id="aclassdata__structures_1_1_bitset_html_ae86688cf99b77342deedb75149573e73"><div class="ttname"><a href="#ae86688cf99b77342deedb75149573e73">data_structures::Bitset::data</a></div><div class="ttdeci">std::vector&lt; std::size_t &gt; data</div><div class="ttdoc">short info of this variable</div><div class="ttdef"><b>Definition</b> bloom_filter.cpp:42</div></div>
+<div class="ttc" id="aclassdata__structures_1_1_bitset_html_ae86688cf99b77342deedb75149573e73"><div class="ttname"><a href="#ae86688cf99b77342deedb75149573e73">data_structures::Bitset::data</a></div><div class="ttdeci">std::vector&lt; std::size_t &gt; data</div><div class="ttdoc">short info of this variable</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dab/bloom__filter_8cpp_source.html#l00042">bloom_filter.cpp:42</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -196,7 +216,7 @@ Static Private Attributes</h2></td></tr>
         <tr>
           <td class="memname">void data_structures::Bitset::add </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></td>          <td class="paramname"><span class="paramname"><em>x</em></span></td><td>)</td>
+          <td class="paramtype">std::size_t</td>          <td class="paramname"><span class="paramname"><em>x</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -210,23 +230,17 @@ Static Private Attributes</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00071">71</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   71</span>                            {</div>
-<div class="line"><span class="lineno">   72</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> blockIndex = x / <a class="code hl_variable" href="#ad7f7d479079a95bcc9175465395fa23f">blockSize</a>;</div>
-<div class="line"><span class="lineno">   73</span>    <span class="keywordflow">if</span> (blockIndex &gt;= <a class="code hl_variable" href="#ae86688cf99b77342deedb75149573e73">data</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">   74</span>        <a class="code hl_variable" href="#ae86688cf99b77342deedb75149573e73">data</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/resize.html">resize</a>(blockIndex + 1);</div>
+<div class="line"><span class="lineno">   72</span>    std::size_t blockIndex = x / <a class="code hl_variable" href="#ad7f7d479079a95bcc9175465395fa23f">blockSize</a>;</div>
+<div class="line"><span class="lineno">   73</span>    <span class="keywordflow">if</span> (blockIndex &gt;= <a class="code hl_variable" href="#ae86688cf99b77342deedb75149573e73">data</a>.size()) {</div>
+<div class="line"><span class="lineno">   74</span>        <a class="code hl_variable" href="#ae86688cf99b77342deedb75149573e73">data</a>.resize(blockIndex + 1);</div>
 <div class="line"><span class="lineno">   75</span>    }</div>
 <div class="line"><span class="lineno">   76</span>    <a class="code hl_variable" href="#ae86688cf99b77342deedb75149573e73">data</a>[blockIndex] |= 1 &lt;&lt; (x % <a class="code hl_variable" href="#ad7f7d479079a95bcc9175465395fa23f">blockSize</a>);</div>
 <div class="line"><span class="lineno">   77</span>}</div>
-<div class="ttc" id="aclassdata__structures_1_1_bitset_html_ad7f7d479079a95bcc9175465395fa23f"><div class="ttname"><a href="#ad7f7d479079a95bcc9175465395fa23f">data_structures::Bitset::blockSize</a></div><div class="ttdeci">static const std::size_t blockSize</div><div class="ttdef"><b>Definition</b> bloom_filter.cpp:43</div></div>
-<div class="ttc" id="aresize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/resize.html">std::vector::resize</a></div><div class="ttdeci">T resize(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="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dae/classdata__structures_1_1_bitset_a17dbe1b1d559302312e8091f82f7499c_cgraph.svg" width="368" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1_bitset_html_ad7f7d479079a95bcc9175465395fa23f"><div class="ttname"><a href="#ad7f7d479079a95bcc9175465395fa23f">data_structures::Bitset::blockSize</a></div><div class="ttdeci">static const std::size_t blockSize</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dab/bloom__filter_8cpp_source.html#l00043">bloom_filter.cpp:43</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a9ef54c7c3f6494b36ead3ae2e5cf43ac" name="a9ef54c7c3f6494b36ead3ae2e5cf43ac"></a>
@@ -238,7 +252,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool data_structures::Bitset::contains </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></td>          <td class="paramname"><span class="paramname"><em>x</em></span></td><td>)</td>
+          <td class="paramtype">std::size_t</td>          <td class="paramname"><span class="paramname"><em>x</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -254,19 +268,16 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>true if bit position x is 1 </dd>
 <dd>
 false if bit position x is 0 </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00086">86</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   86</span>                                 {</div>
-<div class="line"><span class="lineno">   87</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> blockIndex = x / <a class="code hl_variable" href="#ad7f7d479079a95bcc9175465395fa23f">blockSize</a>;</div>
-<div class="line"><span class="lineno">   88</span>    <span class="keywordflow">if</span> (blockIndex &gt;= <a class="code hl_variable" href="#ae86688cf99b77342deedb75149573e73">data</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">   87</span>    std::size_t blockIndex = x / <a class="code hl_variable" href="#ad7f7d479079a95bcc9175465395fa23f">blockSize</a>;</div>
+<div class="line"><span class="lineno">   88</span>    <span class="keywordflow">if</span> (blockIndex &gt;= <a class="code hl_variable" href="#ae86688cf99b77342deedb75149573e73">data</a>.size()) {</div>
 <div class="line"><span class="lineno">   89</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   90</span>    }</div>
 <div class="line"><span class="lineno">   91</span>    <span class="keywordflow">return</span> <a class="code hl_variable" href="#ae86688cf99b77342deedb75149573e73">data</a>[blockIndex] &amp; (1 &lt;&lt; (x % <a class="code hl_variable" href="#ad7f7d479079a95bcc9175465395fa23f">blockSize</a>));</div>
 <div class="line"><span class="lineno">   92</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dae/classdata__structures_1_1_bitset_a9ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph.svg" width="328" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2f1f44d6a12b0de4aaf242872b1c7b54" name="a2f1f44d6a12b0de4aaf242872b1c7b54"></a>
@@ -276,7 +287,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> data_structures::Bitset::size </td>
+          <td class="memname">std::size_t data_structures::Bitset::size </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td></td>
@@ -286,13 +297,10 @@ Here is the call graph for this function:</div>
 
 <p>Utility function to return the size of the inner array. </p>
 <dl class="section return"><dt>Returns</dt><dd>the size of inner array </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   57</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#ae86688cf99b77342deedb75149573e73">data</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); }</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="../../d9/dae/classdata__structures_1_1_bitset_a2f1f44d6a12b0de4aaf242872b1c7b54_cgraph.svg" width="328" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   57</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#ae86688cf99b77342deedb75149573e73">data</a>.size(); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
@@ -306,7 +314,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> data_structures::Bitset::blockSize</td>
+          <td class="memname">const std::size_t data_structures::Bitset::blockSize</td>
         </tr>
       </table>
   </td>
@@ -316,13 +324,41 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <b>Initial value:</b><div class="fragment"><div class="line">=</div>
-<div class="line">        <span class="keyword">sizeof</span>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>)</div>
+<div class="line">        <span class="keyword">sizeof</span>(std::size_t)</div>
 </div><!-- fragment --><p>size of integer type, that we are using in our bitset </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00043">43</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ae86688cf99b77342deedb75149573e73" name="ae86688cf99b77342deedb75149573e73"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ae86688cf99b77342deedb75149573e73">&#9670;&#160;</a></span>data</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::size_t&gt; data_structures::Bitset::data</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>short info of this variable </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../d9/dab/bloom__filter_8cpp.html">bloom_filter.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d9/dae/classdata__structures_1_1_bitset_a17dbe1b1d559302312e8091f82f7499c_cgraph.map b/d9/dae/classdata__structures_1_1_bitset_a17dbe1b1d559302312e8091f82f7499c_cgraph.map
deleted file mode 100644
index af4df28b9..000000000
--- a/d9/dae/classdata__structures_1_1_bitset_a17dbe1b1d559302312e8091f82f7499c_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="data_structures::Bitset::add" name="data_structures::Bitset::add">
-<area shape="rect" id="Node000001" title="Turn bit on position x to 1s." alt="" coords="5,31,188,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="236,5,362,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="188,29,220,25,221,31,189,35"/>
-<area shape="rect" id="Node000003" 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,55,356,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="189,52,226,56,226,62,188,57"/>
-</map>
diff --git a/d9/dae/classdata__structures_1_1_bitset_a17dbe1b1d559302312e8091f82f7499c_cgraph.md5 b/d9/dae/classdata__structures_1_1_bitset_a17dbe1b1d559302312e8091f82f7499c_cgraph.md5
deleted file mode 100644
index 5d4144b52..000000000
--- a/d9/dae/classdata__structures_1_1_bitset_a17dbe1b1d559302312e8091f82f7499c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-79822147814108bbb07d1b97c44ef400
\ No newline at end of file
diff --git a/d9/dae/classdata__structures_1_1_bitset_a17dbe1b1d559302312e8091f82f7499c_cgraph.svg b/d9/dae/classdata__structures_1_1_bitset_a17dbe1b1d559302312e8091f82f7499c_cgraph.svg
deleted file mode 100644
index 9080b54d5..000000000
--- a/d9/dae/classdata__structures_1_1_bitset_a17dbe1b1d559302312e8091f82f7499c_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::Bitset::add Pages: 1 -->
-<svg width="276pt" height="64pt"
- viewBox="0.00 0.00 275.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>data_structures::Bitset::add</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Turn bit on position x to 1s.">
-<polygon fill="#999999" stroke="#666666" points="136.75,-37.25 0,-37.25 0,-18 136.75,-18 136.75,-37.25"/>
-<text text-anchor="middle" x="68.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset::add</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.5,-56.25 172.75,-56.25 172.75,-37 267.5,-37 267.5,-56.25"/>
-<text text-anchor="middle" x="220.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M137.24,-36.24C145.25,-37.25 153.36,-38.28 161.21,-39.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.62,-42.73 170.99,-40.52 161.51,-35.79 160.62,-42.73"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263.38,-19.25 176.88,-19.25 176.88,0 263.38,0 263.38,-19.25"/>
-<text text-anchor="middle" x="220.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M137.24,-19.47C146.71,-18.33 156.33,-17.17 165.48,-16.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.77,-19.56 175.29,-14.89 164.94,-12.61 165.77,-19.56"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dae/classdata__structures_1_1_bitset_a17dbe1b1d559302312e8091f82f7499c_cgraph_org.svg b/d9/dae/classdata__structures_1_1_bitset_a17dbe1b1d559302312e8091f82f7499c_cgraph_org.svg
deleted file mode 100644
index acf9d04b1..000000000
--- a/d9/dae/classdata__structures_1_1_bitset_a17dbe1b1d559302312e8091f82f7499c_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::Bitset::add Pages: 1 -->
-<svg width="276pt" height="64pt"
- viewBox="0.00 0.00 275.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>data_structures::Bitset::add</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Turn bit on position x to 1s.">
-<polygon fill="#999999" stroke="#666666" points="136.75,-37.25 0,-37.25 0,-18 136.75,-18 136.75,-37.25"/>
-<text text-anchor="middle" x="68.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset::add</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.5,-56.25 172.75,-56.25 172.75,-37 267.5,-37 267.5,-56.25"/>
-<text text-anchor="middle" x="220.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M137.24,-36.24C145.25,-37.25 153.36,-38.28 161.21,-39.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.62,-42.73 170.99,-40.52 161.51,-35.79 160.62,-42.73"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263.38,-19.25 176.88,-19.25 176.88,0 263.38,0 263.38,-19.25"/>
-<text text-anchor="middle" x="220.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M137.24,-19.47C146.71,-18.33 156.33,-17.17 165.48,-16.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.77,-19.56 175.29,-14.89 164.94,-12.61 165.77,-19.56"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dae/classdata__structures_1_1_bitset_a2f1f44d6a12b0de4aaf242872b1c7b54_cgraph.map b/d9/dae/classdata__structures_1_1_bitset_a2f1f44d6a12b0de4aaf242872b1c7b54_cgraph.map
deleted file mode 100644
index e8f34c1f1..000000000
--- a/d9/dae/classdata__structures_1_1_bitset_a2f1f44d6a12b0de4aaf242872b1c7b54_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::Bitset::size" name="data_structures::Bitset::size">
-<area shape="rect" id="Node000001" title="Utility function to return the size of the inner array." alt="" coords="5,5,159,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="207,13,322,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,23,191,23,191,28,159,28"/>
-</map>
diff --git a/d9/dae/classdata__structures_1_1_bitset_a2f1f44d6a12b0de4aaf242872b1c7b54_cgraph.md5 b/d9/dae/classdata__structures_1_1_bitset_a2f1f44d6a12b0de4aaf242872b1c7b54_cgraph.md5
deleted file mode 100644
index 79a11a945..000000000
--- a/d9/dae/classdata__structures_1_1_bitset_a2f1f44d6a12b0de4aaf242872b1c7b54_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b67f3fde07367f4b6a1e39ba01df95c5
\ No newline at end of file
diff --git a/d9/dae/classdata__structures_1_1_bitset_a2f1f44d6a12b0de4aaf242872b1c7b54_cgraph.svg b/d9/dae/classdata__structures_1_1_bitset_a2f1f44d6a12b0de4aaf242872b1c7b54_cgraph.svg
deleted file mode 100644
index 994d7f2b4..000000000
--- a/d9/dae/classdata__structures_1_1_bitset_a2f1f44d6a12b0de4aaf242872b1c7b54_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::Bitset::size Pages: 1 -->
-<svg width="246pt" height="39pt"
- viewBox="0.00 0.00 245.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::Bitset::size</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to return the size of the inner array.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.5,-24.88 151,-24.88 151,-5.63 237.5,-5.63 237.5,-24.88"/>
-<text text-anchor="middle" x="194.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-15.25C123.28,-15.25 131.51,-15.25 139.47,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.38,-18.75 149.38,-15.25 139.38,-11.75 139.38,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dae/classdata__structures_1_1_bitset_a2f1f44d6a12b0de4aaf242872b1c7b54_cgraph_org.svg b/d9/dae/classdata__structures_1_1_bitset_a2f1f44d6a12b0de4aaf242872b1c7b54_cgraph_org.svg
deleted file mode 100644
index cfce5ae2d..000000000
--- a/d9/dae/classdata__structures_1_1_bitset_a2f1f44d6a12b0de4aaf242872b1c7b54_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::Bitset::size Pages: 1 -->
-<svg width="246pt" height="39pt"
- viewBox="0.00 0.00 245.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::Bitset::size</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function to return the size of the inner array.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.5,-24.88 151,-24.88 151,-5.63 237.5,-5.63 237.5,-24.88"/>
-<text text-anchor="middle" x="194.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-15.25C123.28,-15.25 131.51,-15.25 139.47,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.38,-18.75 149.38,-15.25 139.38,-11.75 139.38,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dae/classdata__structures_1_1_bitset_a9ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph.map b/d9/dae/classdata__structures_1_1_bitset_a9ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph.map
deleted file mode 100644
index 79d210c9b..000000000
--- a/d9/dae/classdata__structures_1_1_bitset_a9ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::Bitset::contains" name="data_structures::Bitset::contains">
-<area shape="rect" id="Node000001" title="Doest bitset contains element x." alt="" coords="5,5,159,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="207,13,322,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,23,191,23,191,28,159,28"/>
-</map>
diff --git a/d9/dae/classdata__structures_1_1_bitset_a9ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph.md5 b/d9/dae/classdata__structures_1_1_bitset_a9ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph.md5
deleted file mode 100644
index c3a6839a3..000000000
--- a/d9/dae/classdata__structures_1_1_bitset_a9ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-31a0fb7cf25529d882b01d763b26d476
\ No newline at end of file
diff --git a/d9/dae/classdata__structures_1_1_bitset_a9ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph.svg b/d9/dae/classdata__structures_1_1_bitset_a9ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph.svg
deleted file mode 100644
index 16137307c..000000000
--- a/d9/dae/classdata__structures_1_1_bitset_a9ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::Bitset::contains Pages: 1 -->
-<svg width="246pt" height="39pt"
- viewBox="0.00 0.00 245.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::Bitset::contains</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Doest bitset contains element x.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.5,-24.88 151,-24.88 151,-5.63 237.5,-5.63 237.5,-24.88"/>
-<text text-anchor="middle" x="194.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-15.25C123.28,-15.25 131.51,-15.25 139.47,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.38,-18.75 149.38,-15.25 139.38,-11.75 139.38,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dae/classdata__structures_1_1_bitset_a9ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph_org.svg b/d9/dae/classdata__structures_1_1_bitset_a9ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph_org.svg
deleted file mode 100644
index 4e301d533..000000000
--- a/d9/dae/classdata__structures_1_1_bitset_a9ef54c7c3f6494b36ead3ae2e5cf43ac_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::Bitset::contains Pages: 1 -->
-<svg width="246pt" height="39pt"
- viewBox="0.00 0.00 245.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::Bitset::contains</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Doest bitset contains element x.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.5,-24.88 151,-24.88 151,-5.63 237.5,-5.63 237.5,-24.88"/>
-<text text-anchor="middle" x="194.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.26,-15.25C123.28,-15.25 131.51,-15.25 139.47,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.38,-18.75 149.38,-15.25 139.38,-11.75 139.38,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/db6/classgreedy__algorithms_1_1dijkstra_1_1_graph-members.html b/d9/db6/classgreedy__algorithms_1_1dijkstra_1_1_graph-members.html
index 7d64ecda4..e2f6d0e25 100644
--- a/d9/db6/classgreedy__algorithms_1_1dijkstra_1_1_graph-members.html
+++ b/d9/db6/classgreedy__algorithms_1_1dijkstra_1_1_graph-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d9/dbf/test__stack_8cpp_source.html b/d9/dbf/test__stack_8cpp_source.html
new file mode 100644
index 000000000..0fc2254ad
--- /dev/null
+++ b/d9/dbf/test__stack_8cpp_source.html
@@ -0,0 +1,348 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/test_stack.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/dbf/test__stack_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">test_stack.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &lt;stdexcept&gt;</span>  </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &quot;<a class="code" href="../../df/d47/stack_8hpp.html">./stack.hpp</a>&quot;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="keywordtype">void</span> testConstructedStackIsEmpty() {</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    <span class="keyword">const</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack&lt;T&gt;</a> curStack;</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    assert(curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5">isEmptyStack</a>());</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>}</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="keywordtype">void</span> testPush() {</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="keyword">using </span>valueType = int;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack&lt;valueType&gt;</a> curStack;</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(10);</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(20);</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(30);</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(40);</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keyword">const</span> <span class="keyword">auto</span> expectedData = std::vector&lt;valueType&gt;({40, 30, 20, 10});</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    assert(curStack.toVector() == expectedData);</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>}</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keywordtype">void</span> testTop() {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="keyword">using </span>valueType = unsigned;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack&lt;valueType&gt;</a> curStack;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(1);</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(2);</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(3);</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(4);</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    assert(curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">top</a>() == <span class="keyword">static_cast&lt;</span>valueType<span class="keyword">&gt;</span>(4));</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>}</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="keywordtype">void</span> testPop() {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keyword">using </span>valueType = int;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack&lt;valueType&gt;</a> curStack;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(100);</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(200);</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(300);</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    assert(curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">top</a>() == <span class="keyword">static_cast&lt;</span>valueType<span class="keyword">&gt;</span>(300));</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>();</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    assert(curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">top</a>() == <span class="keyword">static_cast&lt;</span>valueType<span class="keyword">&gt;</span>(200));</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>();</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    assert(curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">top</a>() == <span class="keyword">static_cast&lt;</span>valueType<span class="keyword">&gt;</span>(100));</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>();</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    assert(curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5">isEmptyStack</a>());</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>}</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="keywordtype">void</span> testClear() {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack&lt;int&gt;</a> curStack;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(1000);</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(2000);</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092">clear</a>();</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    assert(curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5">isEmptyStack</a>());</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>}</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="keywordtype">void</span> testCopyOfStackHasSameData() {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack&lt;int&gt;</a> stackA;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(10);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(200);</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(3000);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="keyword">const</span> <span class="keyword">auto</span> stackB(stackA);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    assert(stackA.toVector() == stackB.toVector());</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>}</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span><span class="keywordtype">void</span> testPushingToCopyDoesNotChangeOriginal() {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keyword">using </span>valueType = int;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack&lt;valueType&gt;</a> stackA;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(10);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(20);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(30);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keyword">auto</span> stackB(stackA);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    stackB.push(40);</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="keyword">const</span> <span class="keyword">auto</span> expectedDataA = std::vector&lt;valueType&gt;({30, 20, 10});</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keyword">const</span> <span class="keyword">auto</span> expectedDataB = std::vector&lt;valueType&gt;({40, 30, 20, 10});</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    assert(stackA.toVector() == expectedDataA);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    assert(stackB.toVector() == expectedDataB);</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>}</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span><span class="keywordtype">void</span> testPoppingFromCopyDoesNotChangeOriginal() {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keyword">using </span>valueType = int;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack&lt;valueType&gt;</a> stackA;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(10);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(20);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(30);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="keyword">auto</span> stackB(stackA);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    stackB.pop();</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="keyword">const</span> <span class="keyword">auto</span> expectedDataA = std::vector&lt;valueType&gt;({30, 20, 10});</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keyword">const</span> <span class="keyword">auto</span> expectedDataB = std::vector&lt;valueType&gt;({20, 10});</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    assert(stackA.toVector() == expectedDataA);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    assert(stackB.toVector() == expectedDataB);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>}</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span><span class="keywordtype">void</span> testPushingToOrginalDoesNotChangeCopy() {</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keyword">using </span>valueType = int;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack&lt;valueType&gt;</a> stackA;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(10);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(20);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(30);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="keyword">const</span> <span class="keyword">auto</span> stackB(stackA);</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(40);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="keyword">const</span> <span class="keyword">auto</span> expectedDataA = std::vector&lt;valueType&gt;({40, 30, 20, 10});</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keyword">const</span> <span class="keyword">auto</span> expectedDataB = std::vector&lt;valueType&gt;({30, 20, 10});</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    assert(stackA.toVector() == expectedDataA);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    assert(stackB.toVector() == expectedDataB);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>}</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span><span class="keywordtype">void</span> testPoppingFromOrginalDoesNotChangeCopy() {</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="keyword">using </span>valueType = int;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack&lt;valueType&gt;</a> stackA;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(10);</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(20);</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(30);</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="keyword">const</span> <span class="keyword">auto</span> stackB(stackA);</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>();</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    <span class="keyword">const</span> <span class="keyword">auto</span> expectedDataA = std::vector&lt;valueType&gt;({20, 10});</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <span class="keyword">const</span> <span class="keyword">auto</span> expectedDataB = std::vector&lt;valueType&gt;({30, 20, 10});</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span> </div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    assert(stackA.toVector() == expectedDataA);</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    assert(stackB.toVector() == expectedDataB);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>}</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span><span class="keywordtype">void</span> testAssign() {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <span class="keyword">using </span>valueType = int;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack&lt;valueType&gt;</a> stackA;</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(10);</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(20);</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(30);</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack&lt;valueType&gt;</a> stackB = stackA;</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>();</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    stackB.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(40);</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    <span class="keyword">const</span> <span class="keyword">auto</span> expectedDataA = std::vector&lt;valueType&gt;({20, 10});</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <span class="keyword">const</span> <span class="keyword">auto</span> expectedDataB = std::vector&lt;valueType&gt;({40, 30, 20, 10});</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span> </div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    assert(stackA.toVector() == expectedDataA);</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    assert(stackB.toVector() == expectedDataB);</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span> </div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    stackB = stackA;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    stackA.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>();</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    stackB.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(5);</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    stackB.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(6);</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span> </div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    <span class="keyword">const</span> <span class="keyword">auto</span> otherExpectedDataA = std::vector&lt;valueType&gt;({10});</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <span class="keyword">const</span> <span class="keyword">auto</span> otherExpectedDataB = std::vector&lt;valueType&gt;({6, 5, 20, 10});</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span> </div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    assert(stackA.toVector() == otherExpectedDataA);</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    assert(stackB.toVector() == otherExpectedDataB);</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>}</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span> </div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span><span class="keywordtype">void</span> testTopThrowsAnInvalidArgumentWhenStackEmpty() {</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    <span class="keyword">const</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack&lt;long double&gt;</a> curStack;</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    <span class="keywordtype">bool</span> wasException = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    <span class="keywordflow">try</span> {</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>        curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">top</a>();</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::invalid_argument&amp;) {</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        wasException = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    }</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    assert(wasException);</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>}</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span> </div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span><span class="keywordtype">void</span> testPopThrowsAnInvalidArgumentWhenStackEmpty() {</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack&lt;bool&gt;</a> curStack;</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    <span class="keywordtype">bool</span> wasException = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    <span class="keywordflow">try</span> {</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        curStack.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>();</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::invalid_argument&amp;) {</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        wasException = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    }</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    assert(wasException);</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>}</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span> </div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    testConstructedStackIsEmpty&lt;int&gt;();</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    testConstructedStackIsEmpty&lt;char&gt;();</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span> </div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    testPush();</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    testPop();</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    testClear();</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span> </div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    testCopyOfStackHasSameData();</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    testPushingToCopyDoesNotChangeOriginal();</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    testPoppingFromCopyDoesNotChangeOriginal();</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    testPushingToOrginalDoesNotChangeCopy();</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    testPoppingFromOrginalDoesNotChangeCopy();</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span> </div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    testAssign();</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span> </div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    testTopThrowsAnInvalidArgumentWhenStackEmpty();</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    testPopThrowsAnInvalidArgumentWhenStackEmpty();</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span> </div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests pass!\n&quot;</span>;</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>}</div>
+<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00019">stack.hpp:19</a></div></div>
+<div class="ttc" id="aclassstack_html_a163eb9a6206c874c9bf98d032fca11c5"><div class="ttname"><a href="../../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5">stack::isEmptyStack</a></div><div class="ttdeci">bool isEmptyStack() const</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00044">stack.hpp:44</a></div></div>
+<div class="ttc" id="aclassstack_html_a3647fb4418890f19e0dc414b8092b8b0"><div class="ttname"><a href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00062">stack.hpp:62</a></div></div>
+<div class="ttc" id="aclassstack_html_a6f13157faa1a762c59e67da8b9516092"><div class="ttname"><a href="../../d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092">stack::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00069">stack.hpp:69</a></div></div>
+<div class="ttc" id="aclassstack_html_a90df277532c23519aa7ac3c08ed90a1d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack::push</a></div><div class="ttdeci">void push(const value_type &amp;item)</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00047">stack.hpp:47</a></div></div>
+<div class="ttc" id="aclassstack_html_ae09630c4384903d187801921b2ddc709"><div class="ttname"><a href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">stack::top</a></div><div class="ttdeci">value_type top() const</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00056">stack.hpp:56</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="astack_8hpp_html"><div class="ttname"><a href="../../df/d47/stack_8hpp.html">stack.hpp</a></div><div class="ttdoc">This class specifies the basic operation on a stack as a linked list.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><b>test_stack.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/dc9/namespacebase64__encoding.html b/d9/dc9/namespacebase64__encoding.html
index f66c56052..862435823 100644
--- a/d9/dc9/namespacebase64__encoding.html
+++ b/d9/dc9/namespacebase64__encoding.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: base64_encoding Namespace Reference</title>
+<title>TheAlgorithms/C++: base64_encoding Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d9/dca/namespacesearch.html b/d9/dca/namespacesearch.html
index 3bcdcb52e..25bcec117 100644
--- a/d9/dca/namespacesearch.html
+++ b/d9/dca/namespacesearch.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: search Namespace Reference</title>
+<title>TheAlgorithms/C++: search Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -114,12 +131,12 @@ $(function(){initNavTree('d9/dca/namespacesearch.html','../../'); initResizable(
 <div class="textblock"><p>for std::assert </p>
 <p>Search algorithms.</p>
 <p>for assert</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a> function 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 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::sort function for IO operations for std::vector</p>
+<p>for IO operations for std::vector</p>
 <p>Search algorithms</p>
-<p>for io operations, and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>for io operations, and std::pair for std::vector</p>
 <p>Algorithms for searching</p>
-<p>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 IO operations for std::vector</p>
 <p>Searching algorithms </p>
 </div></div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d9/dcc/selectionsortlinkedlist_8cpp_source.html b/d9/dcc/selectionsortlinkedlist_8cpp_source.html
new file mode 100644
index 000000000..a9c8335b2
--- /dev/null
+++ b/d9/dcc/selectionsortlinkedlist_8cpp_source.html
@@ -0,0 +1,315 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: operations_on_datastructures/selectionsortlinkedlist.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/dcc/selectionsortlinkedlist_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">selectionsortlinkedlist.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment">// node defined</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="keyword">class </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> {</div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span>    <span class="keywordtype">int</span> data;</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *<a class="code hl_typedef" href="../../d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6">link</a>;</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>(<span class="keywordtype">int</span> d) {</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> = d;</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>        <a class="code hl_typedef" href="../../d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6">link</a> = NULL;</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    }</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>};</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment">// printing the linked list</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="keywordtype">void</span> print(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *head) {</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *current = head;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="keywordflow">while</span> (current != NULL) {</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        cout &lt;&lt; current-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        current = current-&gt;link;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    }</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    cout &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>}</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment">// creating the linked list with &#39;n&#39; nodes</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *createlist(<span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *head = NULL;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = NULL;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *temp = NULL;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        <span class="keywordtype">int</span> num;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        cin &gt;&gt; num;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        temp = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>(num);</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        <span class="keywordflow">if</span> (head == NULL) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>            head = temp;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>            t = temp;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>            <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        }</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        <span class="keywordflow">if</span> (t-&gt;link == NULL)</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>            t-&gt;link = temp;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        t = temp;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">return</span> head;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>}</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="comment">// performing selection sort on the linked list in an iterative manner</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="keywordtype">void</span> my_selection_sort_linked_list(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *&amp;head) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *min = head;  <span class="comment">// throughout the algorithm &#39;min&#39; is used to denote the</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>                       <span class="comment">// node with min value out of all the nodes left for</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>                       <span class="comment">// scanning while scanning if we find a node &#39;X&#39; with</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>                       <span class="comment">// value lesser than min, then we update the pointers in</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>                       <span class="comment">// such a way that &#39;X&#39; becomes the predecessor of &#39;min&#39;</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *current =</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        min-&gt;link;  <span class="comment">// &#39;current&#39; refers to the current node we are scanning</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *previous = min;  <span class="comment">//&#39;previous&#39; refers to the node that is previous to</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>                           <span class="comment">// the current node</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *temp =</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        NULL;  <span class="comment">// &#39;temp&#39; in this algo is used to point to the last node of the</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>               <span class="comment">// sorted part of the linked list.</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>               <span class="comment">// eg. If at any time instance the state of the linked list is</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>               <span class="comment">// suppose 1-&gt;2-&gt;5-&gt;3-&gt;8-&gt;NULL then, we see that &quot;1-&gt;2&quot; is the</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>               <span class="comment">// sorted part of the LL, and therefore temp will be pointing to</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>               <span class="comment">// the last node of the sorted part,i.e,&#39;2&#39; We keep on arranging</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>               <span class="comment">// the Linked list in such a way that after each iteration the</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>               <span class="comment">// node with &#39;min&#39; value is placed at its correct position. Eg.</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>               <span class="comment">// Let suppose initially we have 5-&gt;4-&gt;1-&gt;3-&gt;2-&gt;NULL After 1st</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>               <span class="comment">// iteration : 1-&gt;4-&gt;5-&gt;3-&gt;2-&gt;NULL and so on</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordflow">while</span> (</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        min-&gt;link !=</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        NULL)  <span class="comment">// so that all the nodes are scanned or until there exists a node</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        <span class="comment">// pick the first node from the unsorted part and assume that it is the</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        <span class="comment">// minimum and then start scanning from the next node</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="keywordflow">while</span> (current != NULL)  <span class="comment">// suppose you choose the min node to be X,</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>                                 <span class="comment">// then scan starts from the (X+1)th node until</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>                                 <span class="comment">// its NULL. current = (X+1)th node and min = X</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>            <span class="keywordflow">if</span> (current-&gt;data &lt; min-&gt;data)  <span class="comment">// if the current node is smaller</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>                                            <span class="comment">// than the presumed node &#39;min&#39;</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>            {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>                <span class="keywordflow">if</span> (temp == NULL)  <span class="comment">// temp stays null for the first iteration,</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>                                   <span class="comment">// therefore it symbolizes that we are</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>                                   <span class="comment">// scanning for the first time</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>                {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>                    <span class="keywordflow">if</span> (previous ==</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>                        min)  <span class="comment">// if the &#39;previous&#39; is pointing to the &#39;min&#39; node</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>                    {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>                        <span class="comment">// Update the pointers</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>                        head = current;  <span class="comment">// update the head pointer with the</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>                                         <span class="comment">// current node</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>                        min-&gt;link = current-&gt;link;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>                        current-&gt;link = previous;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>                        min = current;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>                        current = previous-&gt;link;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>                    } <span class="keywordflow">else</span>  <span class="comment">// if the &#39;previous&#39; is not pointing to the &#39;min&#39;</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>                            <span class="comment">// node</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>                    {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>                        <span class="comment">// Update the pointers</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>                        head = current;  <span class="comment">// update the head pointer with the</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>                                         <span class="comment">// current node</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>                        previous-&gt;link = current-&gt;link;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>                        current-&gt;link = min;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>                        min = current;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>                        current = previous-&gt;link;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>                    }</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>                } <span class="keywordflow">else</span>  <span class="comment">// if &#39;temp&#39; is not NULL, i.e., its not the 1st</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>                        <span class="comment">// iteration</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>                {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>                    temp-&gt;link = current;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>                    previous-&gt;link = current-&gt;link;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>                    current-&gt;link = min;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>                    min = current;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>                    current = previous-&gt;link;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>                }</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>            } <span class="keywordflow">else</span>  <span class="comment">// if the current node is greater than min, just move the</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>                    <span class="comment">// previous and the current pointer a step further</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>            {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>                previous = previous-&gt;link;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>                current = current-&gt;link;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>            }</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        }</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        <span class="comment">// update the pointers. Set &#39;temp&#39; to the last node in the sorted part.</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        <span class="comment">// Make &#39;min&#39; move a step further so that &#39;min&#39; points to the 1st node</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <span class="comment">// of the unsorted part start the iteration again</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        temp = min;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        min = min-&gt;link;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        previous = min;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        current = min-&gt;link;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    }</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>}</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span><span class="comment">// Test cases:</span></div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span> </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span><span class="comment">// enter the no. of nodes : 5</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span><span class="comment">// 8 9 3 1 4</span></div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span><span class="comment">// original list is : 8 9 3 1 4</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span><span class="comment">// sorted list is : 1 3 4 8 9</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span><span class="comment">// enter the no. of nodes : 3</span></div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span><span class="comment">// -1 -2 -3</span></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span><span class="comment">// original list is : -1 -2 -3</span></div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span><span class="comment">// sorted list is : -3 -2 -1</span></div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span> </div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span><span class="comment">// enter the no. of nodes : 8</span></div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span><span class="comment">// 8 7 6 5 4 3 2 1</span></div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span><span class="comment">// original list is : 8 7 6 5 4 3 2 1</span></div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span><span class="comment">// sorted list is : 1 2 3 4 5 6 7 8</span></div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span><span class="comment">// enter the no. of nodes : 6</span></div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span><span class="comment">// 5 3 4 1 -2 -4</span></div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span><span class="comment">// original list is : 5 3 4 1 -2 -4</span></div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span><span class="comment">// sorted list is : -4 -2 1 3 4 5</span></div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span> </div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *head = NULL;</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    <span class="keywordtype">int</span> n;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    cout &lt;&lt; <span class="stringliteral">&quot;enter the no. of nodes : &quot;</span>;  <span class="comment">// taking input from user about the</span></div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>                                          <span class="comment">// number of nodes in linked list</span></div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    cin &gt;&gt; n;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    <span class="keywordflow">if</span> (n == 0)</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    head = createlist(n);  <span class="comment">// creating the list</span></div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    cout &lt;&lt; <span class="stringliteral">&quot;original list is : &quot;</span>;</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    print(head);                          <span class="comment">// printing the original linked list</span></div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    my_selection_sort_linked_list(head);  <span class="comment">// applying selection sort</span></div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    cout &lt;&lt; <span class="stringliteral">&quot;sorted list is : &quot;</span>;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    print(head);  <span class="comment">// printing the sorted linked list</span></div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>}</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_ad6fcd983304f85afa199d97a9b0ca9f6"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6">link</a></div><div class="ttdeci">struct list * link</div><div class="ttdoc">pointer to nodes</div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><b>selectionsortlinkedlist.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/dd1/namespacelinear__recurrence__matrix.html b/d9/dd1/namespacelinear__recurrence__matrix.html
index 84d404f1b..f9127b624 100644
--- a/d9/dd1/namespacelinear__recurrence__matrix.html
+++ b/d9/dd1/namespacelinear__recurrence__matrix.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: linear_recurrence_matrix Namespace Reference</title>
+<title>TheAlgorithms/C++: linear_recurrence_matrix Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d9/dd2/cocktail__selection__sort_8cpp_source.html b/d9/dd2/cocktail__selection__sort_8cpp_source.html
new file mode 100644
index 000000000..ae8f170ce
--- /dev/null
+++ b/d9/dd2/cocktail__selection__sort_8cpp_source.html
@@ -0,0 +1,240 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/cocktail_selection_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/dd2/cocktail__selection__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">cocktail_selection_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">// Returns Sorted elements after performing Cocktail Selection Sort</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment">// It is a Sorting algorithm which chooses the minimum and maximum element in an</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment">// array simultaneously, and swaps it with the lowest and highest available</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment">// position iteratively or recursively</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment">// Iterative Version</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="keywordtype">void</span> CocktailSelectionSort(std::vector&lt;int&gt; *vec, <span class="keywordtype">int</span> low, <span class="keywordtype">int</span> high) {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <span class="keywordflow">while</span> (low &lt;= high) {</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>        <span class="keywordtype">int</span> minimum = (*vec)[low];</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>        <span class="keywordtype">int</span> minimumindex = low;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>        <span class="keywordtype">int</span> maximum = (*vec)[high];</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>        <span class="keywordtype">int</span> maximumindex = high;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = low; i &lt;= high; i++) {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>            <span class="keywordflow">if</span> ((*vec)[i] &gt;= maximum) {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>                maximum = (*vec)[i];</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>                maximumindex = i;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>            }</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>            <span class="keywordflow">if</span> ((*vec)[i] &lt;= minimum) {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>                minimum = (*vec)[i];</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>                minimumindex = i;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>            }</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        }</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>        <span class="keywordflow">if</span> (low != maximumindex || high != minimumindex) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>            std::swap((*vec)[low], (*vec)[minimumindex]);</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>            std::swap((*vec)[high], (*vec)[maximumindex]);</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>            std::swap((*vec)[low], (*vec)[high]);</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        }</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        low++;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        high--;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    }</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>}</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="comment">// Recursive Version</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="keywordtype">void</span> CocktailSelectionSort_v2(std::vector&lt;int&gt; *vec, <span class="keywordtype">int</span> low, <span class="keywordtype">int</span> high) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">if</span> (low &gt;= high)</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordtype">int</span> minimum = (*vec)[low];</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordtype">int</span> minimumindex = low;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordtype">int</span> maximum = (*vec)[high];</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordtype">int</span> maximumindex = high;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = low; i &lt;= high; i++) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        <span class="keywordflow">if</span> ((*vec)[i] &gt;= maximum) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            maximum = (*vec)[i];</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            maximumindex = i;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        <span class="keywordflow">if</span> ((*vec)[i] &lt;= minimum) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>            minimum = (*vec)[i];</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            minimumindex = i;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        }</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    }</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordflow">if</span> (low != maximumindex || high != minimumindex) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        std::swap((*vec)[low], (*vec)[minimumindex]);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        std::swap((*vec)[high], (*vec)[maximumindex]);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        std::swap((*vec)[low], (*vec)[high]);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    CocktailSelectionSort(vec, low + 1, high - 1);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>}</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="comment">// main function, select any one of iterative or recursive version</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="keywordtype">int</span> n;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter number of elements\n&quot;</span>;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    std::vector&lt;int&gt; v(n);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter all the elements\n&quot;</span>;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        std::cin &gt;&gt; v[i];</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    }</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="keywordtype">int</span> method;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter method: \n\t0: iterative\n\t1: recursive:\t&quot;</span>;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    std::cin &gt;&gt; method;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keywordflow">if</span> (method == 0) {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        CocktailSelectionSort(&amp;v, 0, n - 1);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (method == 1) {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        CocktailSelectionSort_v2(&amp;v, 0, n - 1);</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Unknown method&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    }</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted elements are\n&quot;</span>;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        std::cout &lt;&lt; v[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    }</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><b>cocktail_selection_sort.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/dd7/interpolation__search_8cpp_source.html b/d9/dd7/interpolation__search_8cpp_source.html
new file mode 100644
index 000000000..59e9c2b96
--- /dev/null
+++ b/d9/dd7/interpolation__search_8cpp_source.html
@@ -0,0 +1,265 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: search/interpolation_search.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/dd7/interpolation__search_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">interpolation_search.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment">/******************************************************************************</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * @file</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * @brief [Interpolation search</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * algorithm](https://en.wikipedia.org/wiki/interpolation_search)</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> * @details</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> * interpolation search resembles the method by which people search a telephone</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> * directory for a name (the key value by which the book&#39;s entries are ordered):</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment"> * in each step the algorithm calculates where in the remaining search space</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment"> * the sought item might be, based on the key values at the bounds of the search</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment"> * space and the value of the sought key, usually via a linear interpolation.</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment"> * The key value actually found at this estimated position is then compared to</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment"> * the key value being sought. If it is not equal, then depending on the</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment"> * comparison, the remaining search space is reduced to the part before or</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment"> * after the estimated position. This method will only work if calculations</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment"> * on the size of differences between key values are sensible.</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment"></span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment"> * ### Complexities</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment"> * //n is the number of element in the array.</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"> * Worst-case time complexity   O(n)                (when items are distributed</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment"> exponentially)</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment"> * Average time complexity      O(log2(log2 n))</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment"> * space complexity  0(1)</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment"> * @author [Lajat Manekar](https://github.com/Lazeeez)</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment"> * @author Unknown author</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="comment">/******************************************************************************</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="comment"> * @namespace search</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="comment"> * @brief Searching algorithms</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a> {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="comment">/******************************************************************************</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="comment"> * @namespace interpolation_search</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="comment"> * @brief Functions for the [Interpolation</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="comment"> *Search](https://en.wikipedia.org/wiki/interpolation_search) algorithm</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="comment"> *implementation</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d1/d64/namespaceinterpolation__search.html">interpolation_search</a> {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="comment">/******************************************************************************</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="comment"> * @brief The main function which implements interpolation search</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="comment"> * @param arr vector to be searched in</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="comment"> * @param number value to be searched</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="comment"> * @returns integer index of `number` in vector `arr`</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>uint64_t interpolationSearch(<span class="keyword">const</span> std::vector&lt;uint64_t&gt; &amp;arr,</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>                             uint64_t number) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    uint64_t size = arr.size();</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    uint64_t low = 0, high = (size - 1);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="comment">// Since vector is sorted, an element present in array must be in range</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="comment">// defined by corner</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordflow">while</span> (low &lt;= high &amp;&amp; number &gt;= arr[low] &amp;&amp; number &lt;= arr[high]) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="keywordflow">if</span> (low == high) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            <span class="keywordflow">if</span> (arr[low] == number) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                <span class="keywordflow">return</span> low;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        <span class="comment">// Probing the position with keeping uniform distribution in mind.</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        uint64_t pos =</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            low +</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            ((<span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>(high - low) / (arr[high] - arr[low])) *</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>             (number - arr[low]));</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        <span class="keywordflow">if</span> (arr[pos] == number) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            <span class="keywordflow">return</span> pos;  <span class="comment">// Condition of target found</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        }</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <span class="keywordflow">if</span> (arr[pos] &lt; number) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            low = pos + 1;  <span class="comment">// If x is larger, x is in upper part</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        }</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            high = pos - 1;  <span class="comment">// If x is smaller, x is in the lower part</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>}</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>}  <span class="comment">// namespace interpolation_search</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>}  <span class="comment">// namespace search</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span><span class="comment">/*******************************************************************************</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span><span class="comment"> * @brief Self-test implementation</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span><span class="comment"> * @returns void</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_namespace" href="../../d9/df4/namespacetests.html">tests</a>() {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="comment">// testcase</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="comment">// array = [10, 12, 13, 16, 18, 19, 20, 21, 1, 2, 3, 4, 22, 23, 24, 33, 35,</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="comment">// 42, 47] , Value = 33 should return 15</span></div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    std::vector&lt;uint64_t&gt; arr = {{10, 12, 13, 16, 18, 19, 20, 21, 1, 2, 3, 4,</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>                                  22, 23, 24, 33, 35, 42, 47}};</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    sort(arr.begin(), arr.end());</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    uint64_t number = 33;  <span class="comment">// Element to be searched</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    uint64_t expected_answer = 15;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    uint64_t derived_answer =</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        search::interpolation_search::interpolationSearch(arr, number);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase: &quot;</span>;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    assert(derived_answer == expected_answer);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>}</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span><span class="comment">/*******************************************************************************</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span><span class="comment"> * @brief Main function</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span><span class="comment"> * @returns 0 on exit</span></div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <a class="code hl_namespace" href="../../d9/df4/namespacetests.html">tests</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespaceinterpolation__search_html"><div class="ttname"><a href="../../d1/d64/namespaceinterpolation__search.html">interpolation_search</a></div><div class="ttdoc">Functions for the Recursive version of Inorder, Preorder, and Postorder Traversal of the Tree algorit...</div></div>
+<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> <a href="../../df/dd5/binary__search_8cpp_source.html#l00047">binary_search.cpp:47</a></div></div>
+<div class="ttc" id="anamespacetests_html"><div class="ttname"><a href="../../d9/df4/namespacetests.html">tests</a></div><div class="ttdoc">Testcases to check Union of Two Arrays.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><b>interpolation_search.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/dde/classbinary__search__tree.html b/d9/dde/classbinary__search__tree.html
index 2707dec1b..d251b5daa 100644
--- a/d9/dde/classbinary__search__tree.html
+++ b/d9/dde/classbinary__search__tree.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: binary_search_tree&lt; T &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: binary_search_tree&lt; T &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,7 +136,7 @@ $(function(){initNavTree('d9/dde/classbinary__search__tree.html','../../'); init
 <div class="dynheader">
 Collaboration diagram for binary_search_tree&lt; T &gt;:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/da6/classbinary__search__tree__coll__graph.svg" width="376" height="171"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/da6/classbinary__search__tree__coll__graph.svg" width="331" height="171"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
@@ -148,51 +165,51 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:a42b16f26928b5e994925100594a167a0" id="r_a42b16f26928b5e994925100594a167a0"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a42b16f26928b5e994925100594a167a0">find_max</a> (T &amp;ret_value)</td></tr>
 <tr class="memdesc:a42b16f26928b5e994925100594a167a0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Find the largest value in the BST.  <br /></td></tr>
 <tr class="separator:a42b16f26928b5e994925100594a167a0"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a564fe43e7e8f7ecb6f10667a70fbc6f3" id="r_a564fe43e7e8f7ecb6f10667a70fbc6f3"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a564fe43e7e8f7ecb6f10667a70fbc6f3">size</a> ()</td></tr>
+<tr class="memitem:a564fe43e7e8f7ecb6f10667a70fbc6f3" id="r_a564fe43e7e8f7ecb6f10667a70fbc6f3"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a564fe43e7e8f7ecb6f10667a70fbc6f3">size</a> ()</td></tr>
 <tr class="memdesc:a564fe43e7e8f7ecb6f10667a70fbc6f3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the number of values in the BST.  <br /></td></tr>
 <tr class="separator:a564fe43e7e8f7ecb6f10667a70fbc6f3"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a1f23830316204664514f396a4eb5275a" id="r_a1f23830316204664514f396a4eb5275a"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1f23830316204664514f396a4eb5275a">get_elements_inorder</a> ()</td></tr>
+<tr class="memitem:a1f23830316204664514f396a4eb5275a" id="r_a1f23830316204664514f396a4eb5275a"><td class="memItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1f23830316204664514f396a4eb5275a">get_elements_inorder</a> ()</td></tr>
 <tr class="memdesc:a1f23830316204664514f396a4eb5275a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get all values of the BST in in-order order.  <br /></td></tr>
 <tr class="separator:a1f23830316204664514f396a4eb5275a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a5764c1cf848f84a5b77462036a6d8c13" id="r_a5764c1cf848f84a5b77462036a6d8c13"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5764c1cf848f84a5b77462036a6d8c13">get_elements_preorder</a> ()</td></tr>
+<tr class="memitem:a5764c1cf848f84a5b77462036a6d8c13" id="r_a5764c1cf848f84a5b77462036a6d8c13"><td class="memItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5764c1cf848f84a5b77462036a6d8c13">get_elements_preorder</a> ()</td></tr>
 <tr class="memdesc:a5764c1cf848f84a5b77462036a6d8c13"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get all values of the BST in pre-order order.  <br /></td></tr>
 <tr class="separator:a5764c1cf848f84a5b77462036a6d8c13"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a5c011e1b0863d79c3a7c11a0426bdcff" id="r_a5c011e1b0863d79c3a7c11a0426bdcff"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5c011e1b0863d79c3a7c11a0426bdcff">get_elements_postorder</a> ()</td></tr>
+<tr class="memitem:a5c011e1b0863d79c3a7c11a0426bdcff" id="r_a5c011e1b0863d79c3a7c11a0426bdcff"><td class="memItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5c011e1b0863d79c3a7c11a0426bdcff">get_elements_postorder</a> ()</td></tr>
 <tr class="memdesc:a5c011e1b0863d79c3a7c11a0426bdcff"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get all values of the BST in post-order order.  <br /></td></tr>
 <tr class="separator:a5c011e1b0863d79c3a7c11a0426bdcff"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
 Private Member Functions</h2></td></tr>
-<tr class="memitem:a75f897af6aa732a9901454401c869bcb" id="r_a75f897af6aa732a9901454401c869bcb"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a75f897af6aa732a9901454401c869bcb">find_max</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>, T &amp;ret_value)</td></tr>
+<tr class="memitem:a75f897af6aa732a9901454401c869bcb" id="r_a75f897af6aa732a9901454401c869bcb"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a75f897af6aa732a9901454401c869bcb">find_max</a> (std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>, T &amp;ret_value)</td></tr>
 <tr class="memdesc:a75f897af6aa732a9901454401c869bcb"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to find the maximum value in the BST.  <br /></td></tr>
 <tr class="separator:a75f897af6aa732a9901454401c869bcb"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af9a2c7c187a7ca3142c77ce342ef3153" id="r_af9a2c7c187a7ca3142c77ce342ef3153"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>, T &amp;ret_value)</td></tr>
+<tr class="memitem:af9a2c7c187a7ca3142c77ce342ef3153" id="r_af9a2c7c187a7ca3142c77ce342ef3153"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a> (std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>, T &amp;ret_value)</td></tr>
 <tr class="memdesc:af9a2c7c187a7ca3142c77ce342ef3153"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to find the minimum value in the BST.  <br /></td></tr>
 <tr class="separator:af9a2c7c187a7ca3142c77ce342ef3153"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a9d1e7e10efa74d741bf48cf032df3778" id="r_a9d1e7e10efa74d741bf48cf032df3778"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9d1e7e10efa74d741bf48cf032df3778">insert</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>, T new_value)</td></tr>
+<tr class="memitem:a9d1e7e10efa74d741bf48cf032df3778" id="r_a9d1e7e10efa74d741bf48cf032df3778"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9d1e7e10efa74d741bf48cf032df3778">insert</a> (std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>, T new_value)</td></tr>
 <tr class="memdesc:a9d1e7e10efa74d741bf48cf032df3778"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to insert a value into the BST.  <br /></td></tr>
 <tr class="separator:a9d1e7e10efa74d741bf48cf032df3778"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af4a865ce5244608819b169fc78a41153" id="r_af4a865ce5244608819b169fc78a41153"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af4a865ce5244608819b169fc78a41153">remove</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;parent, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>, T rm_value)</td></tr>
+<tr class="memitem:af4a865ce5244608819b169fc78a41153" id="r_af4a865ce5244608819b169fc78a41153"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af4a865ce5244608819b169fc78a41153">remove</a> (std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;parent, std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>, T rm_value)</td></tr>
 <tr class="memdesc:af4a865ce5244608819b169fc78a41153"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to remove a value from the BST.  <br /></td></tr>
 <tr class="separator:af4a865ce5244608819b169fc78a41153"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa4f84b2eec9b9201af1840868ddb5fb2" id="r_aa4f84b2eec9b9201af1840868ddb5fb2"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>, T value)</td></tr>
+<tr class="memitem:aa4f84b2eec9b9201af1840868ddb5fb2" id="r_aa4f84b2eec9b9201af1840868ddb5fb2"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a> (std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>, T value)</td></tr>
 <tr class="memdesc:aa4f84b2eec9b9201af1840868ddb5fb2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to check if a value is in the BST.  <br /></td></tr>
 <tr class="separator:aa4f84b2eec9b9201af1840868ddb5fb2"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2fcf37549bd002c174a45b0b4203c2bd" id="r_a2fcf37549bd002c174a45b0b4203c2bd"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; void(T)&gt; callback, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
+<tr class="memitem:a2fcf37549bd002c174a45b0b4203c2bd" id="r_a2fcf37549bd002c174a45b0b4203c2bd"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a> (std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
 <tr class="memdesc:a2fcf37549bd002c174a45b0b4203c2bd"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to traverse the tree in in-order order.  <br /></td></tr>
 <tr class="separator:a2fcf37549bd002c174a45b0b4203c2bd"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ab81edd415324d372632c42dc7dbcb9e1" id="r_ab81edd415324d372632c42dc7dbcb9e1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; void(T)&gt; callback, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
+<tr class="memitem:ab81edd415324d372632c42dc7dbcb9e1" id="r_ab81edd415324d372632c42dc7dbcb9e1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a> (std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
 <tr class="memdesc:ab81edd415324d372632c42dc7dbcb9e1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to traverse the tree in pre-order order.  <br /></td></tr>
 <tr class="separator:ab81edd415324d372632c42dc7dbcb9e1"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a87c0a35845d27e0f6fc1f4eaa0333362" id="r_a87c0a35845d27e0f6fc1f4eaa0333362"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; void(T)&gt; callback, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
+<tr class="memitem:a87c0a35845d27e0f6fc1f4eaa0333362" id="r_a87c0a35845d27e0f6fc1f4eaa0333362"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a> (std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
 <tr class="memdesc:a87c0a35845d27e0f6fc1f4eaa0333362"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to traverse the tree in post-order order.  <br /></td></tr>
 <tr class="separator:a87c0a35845d27e0f6fc1f4eaa0333362"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:aa08f65f6f3bfcb14f8c3d1e65305ae50" id="r_aa08f65f6f3bfcb14f8c3d1e65305ae50"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a></td></tr>
+<tr class="memitem:aa08f65f6f3bfcb14f8c3d1e65305ae50" id="r_aa08f65f6f3bfcb14f8c3d1e65305ae50"><td class="memItemLeft" align="right" valign="top">std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a></td></tr>
 <tr class="separator:aa08f65f6f3bfcb14f8c3d1e65305ae50"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a07ba32ce1a2af6e357600ac8c8e98dbc" id="r_a07ba32ce1a2af6e357600ac8c8e98dbc"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a> = 0</td></tr>
+<tr class="memitem:a07ba32ce1a2af6e357600ac8c8e98dbc" id="r_a07ba32ce1a2af6e357600ac8c8e98dbc"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a> = 0</td></tr>
 <tr class="separator:a07ba32ce1a2af6e357600ac8c8e98dbc"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -204,6 +221,8 @@ class binary_search_tree&lt; T &gt;</div><p>The Binary Search Tree class. </p>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00020">20</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="aa67321ed575ca313cd71d833d91234a6" name="aa67321ed575ca313cd71d833d91234a6"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aa67321ed575ca313cd71d833d91234a6">&#9670;&#160;</a></span>binary_search_tree()</h2>
@@ -231,12 +250,14 @@ template&lt;class T &gt; </div>
 </div><div class="memdoc">
 
 <p>Construct a new Binary Search Tree object. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00247">247</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  247</span>                         {</div>
 <div class="line"><span class="lineno">  248</span>        <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  249</span>        <a class="code hl_variable" href="#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a> = 0;</div>
 <div class="line"><span class="lineno">  250</span>    }</div>
-<div class="ttc" id="aclassbinary__search__tree_html_a07ba32ce1a2af6e357600ac8c8e98dbc"><div class="ttname"><a href="#a07ba32ce1a2af6e357600ac8c8e98dbc">binary_search_tree::size_</a></div><div class="ttdeci">std::size_t size_</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:43</div></div>
-<div class="ttc" id="aclassbinary__search__tree_html_aa08f65f6f3bfcb14f8c3d1e65305ae50"><div class="ttname"><a href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">binary_search_tree::root_</a></div><div class="ttdeci">std::unique_ptr&lt; bst_node &gt; root_</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:42</div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_a07ba32ce1a2af6e357600ac8c8e98dbc"><div class="ttname"><a href="#a07ba32ce1a2af6e357600ac8c8e98dbc">binary_search_tree::size_</a></div><div class="ttdeci">std::size_t size_</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00043">binary_search_tree2.cpp:43</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_aa08f65f6f3bfcb14f8c3d1e65305ae50"><div class="ttname"><a href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">binary_search_tree::root_</a></div><div class="ttdeci">std::unique_ptr&lt; bst_node &gt; root_</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00042">binary_search_tree2.cpp:42</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -255,7 +276,7 @@ template&lt;class T &gt; </div>
         <tr>
           <td class="memname">bool <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::contains </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>node</em></span>, </td>
+          <td class="paramtype">std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>node</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -281,6 +302,8 @@ template&lt;class T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>true If the value was found in the BST. </dd>
 <dd>
 false Otherwise. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00177">177</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  177</span>                                                          {</div>
 <div class="line"><span class="lineno">  178</span>        <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
 <div class="line"><span class="lineno">  179</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
@@ -294,14 +317,9 @@ false Otherwise. </dd></dl>
 <div class="line"><span class="lineno">  187</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  188</span>        }</div>
 <div class="line"><span class="lineno">  189</span>    }</div>
-<div class="ttc" id="aclassbinary__search__tree_html_aa4f84b2eec9b9201af1840868ddb5fb2"><div class="ttname"><a href="#aa4f84b2eec9b9201af1840868ddb5fb2">binary_search_tree::contains</a></div><div class="ttdeci">bool contains(std::unique_ptr&lt; bst_node &gt; &amp;node, T value)</div><div class="ttdoc">Recursive function to check if a value is in the BST.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:177</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph.svg" width="143" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassbinary__search__tree_html_aa4f84b2eec9b9201af1840868ddb5fb2"><div class="ttname"><a href="#aa4f84b2eec9b9201af1840868ddb5fb2">binary_search_tree::contains</a></div><div class="ttdeci">bool contains(std::unique_ptr&lt; bst_node &gt; &amp;node, T value)</div><div class="ttdoc">Recursive function to check if a value is in the BST.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00177">binary_search_tree2.cpp:177</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6bf5b410299df2320ddf2709dda61f63" name="a6bf5b410299df2320ddf2709dda61f63"></a>
@@ -339,13 +357,10 @@ template&lt;class T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>true If value is in the BST. </dd>
 <dd>
 false Otherwise. </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  289</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, value); }</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="../../d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph.svg" width="143" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00289">289</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  289</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, value); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a75f897af6aa732a9901454401c869bcb" name="a75f897af6aa732a9901454401c869bcb"></a>
@@ -362,7 +377,7 @@ template&lt;class T &gt; </div>
         <tr>
           <td class="memname">bool <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::find_max </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>node</em></span>, </td>
+          <td class="paramtype">std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>node</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -388,6 +403,8 @@ template&lt;class T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>true If the maximum value was successfully found. </dd>
 <dd>
 false Otherwise. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   53</span>                                                               {</div>
 <div class="line"><span class="lineno">   54</span>        <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
 <div class="line"><span class="lineno">   55</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
@@ -397,13 +414,8 @@ false Otherwise. </dd></dl>
 <div class="line"><span class="lineno">   59</span>        }</div>
 <div class="line"><span class="lineno">   60</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a75f897af6aa732a9901454401c869bcb">find_max</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right, ret_value);</div>
 <div class="line"><span class="lineno">   61</span>    }</div>
-<div class="ttc" id="aclassbinary__search__tree_html_a75f897af6aa732a9901454401c869bcb"><div class="ttname"><a href="#a75f897af6aa732a9901454401c869bcb">binary_search_tree::find_max</a></div><div class="ttdeci">bool find_max(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)</div><div class="ttdoc">Recursive function to find the maximum value in the BST.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:53</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph.svg" width="143" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassbinary__search__tree_html_a75f897af6aa732a9901454401c869bcb"><div class="ttname"><a href="#a75f897af6aa732a9901454401c869bcb">binary_search_tree::find_max</a></div><div class="ttdeci">bool find_max(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)</div><div class="ttdoc">Recursive function to find the maximum value in the BST.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00053">binary_search_tree2.cpp:53</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a42b16f26928b5e994925100594a167a0" name="a42b16f26928b5e994925100594a167a0"></a>
@@ -441,13 +453,10 @@ template&lt;class T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>true If maximum value was successfully found. </dd>
 <dd>
 false Otherwise. </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  307</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a75f897af6aa732a9901454401c869bcb">find_max</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, ret_value); }</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="../../d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph.svg" width="143" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00307">307</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  307</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a75f897af6aa732a9901454401c869bcb">find_max</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, ret_value); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af9a2c7c187a7ca3142c77ce342ef3153" name="af9a2c7c187a7ca3142c77ce342ef3153"></a>
@@ -464,7 +473,7 @@ template&lt;class T &gt; </div>
         <tr>
           <td class="memname">bool <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::find_min </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>node</em></span>, </td>
+          <td class="paramtype">std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>node</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -490,6 +499,8 @@ template&lt;class T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>true If the minimum value was successfully found. </dd>
 <dd>
 false Otherwise. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00071">71</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   71</span>                                                               {</div>
 <div class="line"><span class="lineno">   72</span>        <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
 <div class="line"><span class="lineno">   73</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
@@ -500,13 +511,8 @@ false Otherwise. </dd></dl>
 <div class="line"><span class="lineno">   78</span> </div>
 <div class="line"><span class="lineno">   79</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left, ret_value);</div>
 <div class="line"><span class="lineno">   80</span>    }</div>
-<div class="ttc" id="aclassbinary__search__tree_html_af9a2c7c187a7ca3142c77ce342ef3153"><div class="ttname"><a href="#af9a2c7c187a7ca3142c77ce342ef3153">binary_search_tree::find_min</a></div><div class="ttdeci">bool find_min(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)</div><div class="ttdoc">Recursive function to find the minimum value in the BST.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:71</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph.svg" width="143" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassbinary__search__tree_html_af9a2c7c187a7ca3142c77ce342ef3153"><div class="ttname"><a href="#af9a2c7c187a7ca3142c77ce342ef3153">binary_search_tree::find_min</a></div><div class="ttdeci">bool find_min(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)</div><div class="ttdoc">Recursive function to find the minimum value in the BST.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00071">binary_search_tree2.cpp:71</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad9912e8574538e86f9bd2c38e7e63d03" name="ad9912e8574538e86f9bd2c38e7e63d03"></a>
@@ -544,13 +550,10 @@ template&lt;class T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>true If minimum value was successfully found. </dd>
 <dd>
 false Otherwise. </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  298</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, ret_value); }</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="../../d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph.svg" width="143" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00298">298</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  298</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, ret_value); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1f23830316204664514f396a4eb5275a" name="a1f23830316204664514f396a4eb5275a"></a>
@@ -565,7 +568,7 @@ template&lt;class T &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::get_elements_inorder </td>
+          <td class="memname">std::vector&lt; T &gt; <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::get_elements_inorder </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td></td>
@@ -580,21 +583,17 @@ template&lt;class T &gt; </div>
 
 <p>Get all values of the BST in in-order order. </p>
 <dl class="section return"><dt>Returns</dt><dd>std::vector&lt;T&gt; List of values, sorted in in-order order. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00321">321</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  321</span>                                        {</div>
-<div class="line"><span class="lineno">  322</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
+<div class="line"><span class="lineno">  322</span>        std::vector&lt;T&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  323</span>        <a class="code hl_function" href="#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>([&amp;](T node_value) { <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(node_value); },</div>
 <div class="line"><span class="lineno">  324</span>                         <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
 <div class="line"><span class="lineno">  325</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  326</span>    }</div>
-<div class="ttc" id="aclassbinary__search__tree_html_a2fcf37549bd002c174a45b0b4203c2bd"><div class="ttname"><a href="#a2fcf37549bd002c174a45b0b4203c2bd">binary_search_tree::traverse_inorder</a></div><div class="ttdeci">void traverse_inorder(std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; bst_node &gt; &amp;node)</div><div class="ttdoc">Recursive function to traverse the tree in in-order order.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:197</div></div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph.svg" width="344" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassbinary__search__tree_html_a2fcf37549bd002c174a45b0b4203c2bd"><div class="ttname"><a href="#a2fcf37549bd002c174a45b0b4203c2bd">binary_search_tree::traverse_inorder</a></div><div class="ttdeci">void traverse_inorder(std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; bst_node &gt; &amp;node)</div><div class="ttdoc">Recursive function to traverse the tree in in-order order.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00197">binary_search_tree2.cpp:197</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5c011e1b0863d79c3a7c11a0426bdcff" name="a5c011e1b0863d79c3a7c11a0426bdcff"></a>
@@ -609,7 +608,7 @@ template&lt;class T &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::get_elements_postorder </td>
+          <td class="memname">std::vector&lt; T &gt; <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::get_elements_postorder </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td></td>
@@ -624,19 +623,16 @@ template&lt;class T &gt; </div>
 
 <p>Get all values of the BST in post-order order. </p>
 <dl class="section return"><dt>Returns</dt><dd>std::vector&lt;T&gt; List of values, sorted in post-order order. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00345">345</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  345</span>                                          {</div>
-<div class="line"><span class="lineno">  346</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
+<div class="line"><span class="lineno">  346</span>        std::vector&lt;T&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  347</span>        <a class="code hl_function" href="#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>([&amp;](T node_value) { <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(node_value); },</div>
 <div class="line"><span class="lineno">  348</span>                           <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
 <div class="line"><span class="lineno">  349</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  350</span>    }</div>
-<div class="ttc" id="aclassbinary__search__tree_html_a87c0a35845d27e0f6fc1f4eaa0333362"><div class="ttname"><a href="#a87c0a35845d27e0f6fc1f4eaa0333362">binary_search_tree::traverse_postorder</a></div><div class="ttdeci">void traverse_postorder(std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; bst_node &gt; &amp;node)</div><div class="ttdoc">Recursive function to traverse the tree in post-order order.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:231</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph.svg" width="364" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassbinary__search__tree_html_a87c0a35845d27e0f6fc1f4eaa0333362"><div class="ttname"><a href="#a87c0a35845d27e0f6fc1f4eaa0333362">binary_search_tree::traverse_postorder</a></div><div class="ttdeci">void traverse_postorder(std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; bst_node &gt; &amp;node)</div><div class="ttdoc">Recursive function to traverse the tree in post-order order.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00231">binary_search_tree2.cpp:231</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5764c1cf848f84a5b77462036a6d8c13" name="a5764c1cf848f84a5b77462036a6d8c13"></a>
@@ -651,7 +647,7 @@ template&lt;class T &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::get_elements_preorder </td>
+          <td class="memname">std::vector&lt; T &gt; <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::get_elements_preorder </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td></td>
@@ -666,19 +662,16 @@ template&lt;class T &gt; </div>
 
 <p>Get all values of the BST in pre-order order. </p>
 <dl class="section return"><dt>Returns</dt><dd>std::vector&lt;T&gt; List of values, sorted in pre-order order. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00333">333</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  333</span>                                         {</div>
-<div class="line"><span class="lineno">  334</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
+<div class="line"><span class="lineno">  334</span>        std::vector&lt;T&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  335</span>        <a class="code hl_function" href="#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>([&amp;](T node_value) { <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(node_value); },</div>
 <div class="line"><span class="lineno">  336</span>                          <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
 <div class="line"><span class="lineno">  337</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  338</span>    }</div>
-<div class="ttc" id="aclassbinary__search__tree_html_ab81edd415324d372632c42dc7dbcb9e1"><div class="ttname"><a href="#ab81edd415324d372632c42dc7dbcb9e1">binary_search_tree::traverse_preorder</a></div><div class="ttdeci">void traverse_preorder(std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; bst_node &gt; &amp;node)</div><div class="ttdoc">Recursive function to traverse the tree in pre-order order.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:214</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph.svg" width="352" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassbinary__search__tree_html_ab81edd415324d372632c42dc7dbcb9e1"><div class="ttname"><a href="#ab81edd415324d372632c42dc7dbcb9e1">binary_search_tree::traverse_preorder</a></div><div class="ttdeci">void traverse_preorder(std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; bst_node &gt; &amp;node)</div><div class="ttdoc">Recursive function to traverse the tree in pre-order order.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00214">binary_search_tree2.cpp:214</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a9d1e7e10efa74d741bf48cf032df3778" name="a9d1e7e10efa74d741bf48cf032df3778"></a>
@@ -695,7 +688,7 @@ template&lt;class T &gt; </div>
         <tr>
           <td class="memname">bool <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::insert </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>node</em></span>, </td>
+          <td class="paramtype">std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>node</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -721,15 +714,17 @@ template&lt;class T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>true If the insert operation was successful. </dd>
 <dd>
 false Otherwise. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00090">90</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   90</span>                                                            {</div>
 <div class="line"><span class="lineno">   91</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> == <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> &amp;&amp; !<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>) {</div>
-<div class="line"><span class="lineno">   92</span>            <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr&lt;bst_node&gt;</a>(<span class="keyword">new</span> bst_node(new_value));</div>
+<div class="line"><span class="lineno">   92</span>            <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = std::unique_ptr&lt;bst_node&gt;(<span class="keyword">new</span> bst_node(new_value));</div>
 <div class="line"><span class="lineno">   93</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   94</span>        }</div>
 <div class="line"><span class="lineno">   95</span> </div>
 <div class="line"><span class="lineno">   96</span>        <span class="keywordflow">if</span> (new_value &lt; node-&gt;value) {</div>
 <div class="line"><span class="lineno">   97</span>            <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left) {</div>
-<div class="line"><span class="lineno">   98</span>                <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr&lt;bst_node&gt;</a>(<span class="keyword">new</span> bst_node(new_value));</div>
+<div class="line"><span class="lineno">   98</span>                <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left = std::unique_ptr&lt;bst_node&gt;(<span class="keyword">new</span> bst_node(new_value));</div>
 <div class="line"><span class="lineno">   99</span>                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  100</span>            } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">  101</span>                <span class="keywordflow">return</span> <a class="code hl_function" href="#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left, new_value);</div>
@@ -737,7 +732,7 @@ false Otherwise. </dd></dl>
 <div class="line"><span class="lineno">  103</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (new_value &gt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value) {</div>
 <div class="line"><span class="lineno">  104</span>            <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right) {</div>
 <div class="line"><span class="lineno">  105</span>                <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right =</div>
-<div class="line"><span class="lineno">  106</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr&lt;bst_node&gt;</a>(<span class="keyword">new</span> bst_node(new_value));</div>
+<div class="line"><span class="lineno">  106</span>                    std::unique_ptr&lt;bst_node&gt;(<span class="keyword">new</span> bst_node(new_value));</div>
 <div class="line"><span class="lineno">  107</span>                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  108</span>            } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">  109</span>                <span class="keywordflow">return</span> <a class="code hl_function" href="#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right, new_value);</div>
@@ -746,14 +741,8 @@ false Otherwise. </dd></dl>
 <div class="line"><span class="lineno">  112</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  113</span>        }</div>
 <div class="line"><span class="lineno">  114</span>    }</div>
-<div class="ttc" id="aclassbinary__search__tree_html_a9d1e7e10efa74d741bf48cf032df3778"><div class="ttname"><a href="#a9d1e7e10efa74d741bf48cf032df3778">binary_search_tree::insert</a></div><div class="ttdeci">bool insert(std::unique_ptr&lt; bst_node &gt; &amp;node, T new_value)</div><div class="ttdoc">Recursive function to insert a value into the BST.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:90</div></div>
-<div class="ttc" id="aunique_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph.svg" width="143" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassbinary__search__tree_html_a9d1e7e10efa74d741bf48cf032df3778"><div class="ttname"><a href="#a9d1e7e10efa74d741bf48cf032df3778">binary_search_tree::insert</a></div><div class="ttdeci">bool insert(std::unique_ptr&lt; bst_node &gt; &amp;node, T new_value)</div><div class="ttdoc">Recursive function to insert a value into the BST.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00090">binary_search_tree2.cpp:90</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a8168edf29316f2b436eac1fc416c52e0" name="a8168edf29316f2b436eac1fc416c52e0"></a>
@@ -791,6 +780,8 @@ template&lt;class T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>true If the insertion was successful. </dd>
 <dd>
 false Otherwise. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00259">259</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  259</span>                             {</div>
 <div class="line"><span class="lineno">  260</span>        <span class="keywordtype">bool</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, new_value);</div>
 <div class="line"><span class="lineno">  261</span>        <span class="keywordflow">if</span> (result) {</div>
@@ -798,12 +789,7 @@ false Otherwise. </dd></dl>
 <div class="line"><span class="lineno">  263</span>        }</div>
 <div class="line"><span class="lineno">  264</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  265</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph.svg" width="322" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af4a865ce5244608819b169fc78a41153" name="af4a865ce5244608819b169fc78a41153"></a>
@@ -820,12 +806,12 @@ template&lt;class T &gt; </div>
         <tr>
           <td class="memname">bool <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::remove </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>parent</em></span>, </td>
+          <td class="paramtype">std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>parent</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>node</em></span>, </td>
+          <td class="paramtype">std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>node</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -852,6 +838,8 @@ template&lt;class T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>true If the removal operation was successful. </dd>
 <dd>
 false Otherwise. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00125">125</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  126</span>                                                           {</div>
 <div class="line"><span class="lineno">  127</span>        <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
 <div class="line"><span class="lineno">  128</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
@@ -865,15 +853,15 @@ false Otherwise. </dd></dl>
 <div class="line"><span class="lineno">  136</span>                <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value = successor_node_value;</div>
 <div class="line"><span class="lineno">  137</span>                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  138</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left || <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right) {</div>
-<div class="line"><span class="lineno">  139</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr&lt;bst_node&gt;</a>&amp; non_null =</div>
+<div class="line"><span class="lineno">  139</span>                std::unique_ptr&lt;bst_node&gt;&amp; non_null =</div>
 <div class="line"><span class="lineno">  140</span>                    (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left ? <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left : <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right);</div>
 <div class="line"><span class="lineno">  141</span> </div>
 <div class="line"><span class="lineno">  142</span>                <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> == <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>) {</div>
-<div class="line"><span class="lineno">  143</span>                    <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(non_null);</div>
+<div class="line"><span class="lineno">  143</span>                    <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = std::move(non_null);</div>
 <div class="line"><span class="lineno">  144</span>                } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rm_value &lt; parent-&gt;value) {</div>
-<div class="line"><span class="lineno">  145</span>                    parent-&gt;left = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(non_null);</div>
+<div class="line"><span class="lineno">  145</span>                    parent-&gt;left = std::move(non_null);</div>
 <div class="line"><span class="lineno">  146</span>                } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  147</span>                    parent-&gt;right = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(non_null);</div>
+<div class="line"><span class="lineno">  147</span>                    parent-&gt;right = std::move(non_null);</div>
 <div class="line"><span class="lineno">  148</span>                }</div>
 <div class="line"><span class="lineno">  149</span> </div>
 <div class="line"><span class="lineno">  150</span>                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
@@ -894,14 +882,8 @@ false Otherwise. </dd></dl>
 <div class="line"><span class="lineno">  165</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right, rm_value);</div>
 <div class="line"><span class="lineno">  166</span>        }</div>
 <div class="line"><span class="lineno">  167</span>    }</div>
-<div class="ttc" id="aclassbinary__search__tree_html_af4a865ce5244608819b169fc78a41153"><div class="ttname"><a href="#af4a865ce5244608819b169fc78a41153">binary_search_tree::remove</a></div><div class="ttdeci">bool remove(std::unique_ptr&lt; bst_node &gt; &amp;parent, std::unique_ptr&lt; bst_node &gt; &amp;node, T rm_value)</div><div class="ttdoc">Recursive function to remove a value from the BST.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:125</div></div>
-<div class="ttc" id="amove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></div><div class="ttdeci">T move(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph.svg" width="322" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassbinary__search__tree_html_af4a865ce5244608819b169fc78a41153"><div class="ttname"><a href="#af4a865ce5244608819b169fc78a41153">binary_search_tree::remove</a></div><div class="ttdeci">bool remove(std::unique_ptr&lt; bst_node &gt; &amp;parent, std::unique_ptr&lt; bst_node &gt; &amp;node, T rm_value)</div><div class="ttdoc">Recursive function to remove a value from the BST.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00125">binary_search_tree2.cpp:125</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a99771c2e1353e8ddfd4bb9d30b7a98fb" name="a99771c2e1353e8ddfd4bb9d30b7a98fb"></a>
@@ -939,6 +921,8 @@ template&lt;class T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>true If the removal was successful. </dd>
 <dd>
 false Otherwise. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00274">274</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  274</span>                            {</div>
 <div class="line"><span class="lineno">  275</span>        <span class="keywordtype">bool</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, <a class="code hl_variable" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, rm_value);</div>
 <div class="line"><span class="lineno">  276</span>        <span class="keywordflow">if</span> (result) {</div>
@@ -946,12 +930,7 @@ false Otherwise. </dd></dl>
 <div class="line"><span class="lineno">  278</span>        }</div>
 <div class="line"><span class="lineno">  279</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  280</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.svg" width="502" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a564fe43e7e8f7ecb6f10667a70fbc6f3" name="a564fe43e7e8f7ecb6f10667a70fbc6f3"></a>
@@ -966,7 +945,7 @@ template&lt;class T &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::size </td>
+          <td class="memname">std::size_t <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::size </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td></td>
@@ -980,7 +959,9 @@ template&lt;class T &gt; </div>
 </div><div class="memdoc">
 
 <p>Get the number of values in the BST. </p>
-<dl class="section return"><dt>Returns</dt><dd><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> Number of values in the BST. </dd></dl>
+<dl class="section return"><dt>Returns</dt><dd>std::size_t Number of values in the BST. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00314">314</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  314</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a>; }</div>
 </div><!-- fragment -->
 </div>
@@ -999,12 +980,12 @@ template&lt;class T &gt; </div>
         <tr>
           <td class="memname">void <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::traverse_inorder </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; void(T)&gt;</td>          <td class="paramname"><span class="paramname"><em>callback</em></span>, </td>
+          <td class="paramtype">std::function&lt; void(T)&gt;</td>          <td class="paramname"><span class="paramname"><em>callback</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>node</em></span>&#160;)</td>
+          <td class="paramtype">std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>node</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -1022,6 +1003,8 @@ template&lt;class T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00197">197</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  198</span>                                                         {</div>
 <div class="line"><span class="lineno">  199</span>        <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
 <div class="line"><span class="lineno">  200</span>            <span class="keywordflow">return</span>;</div>
@@ -1031,12 +1014,7 @@ template&lt;class T &gt; </div>
 <div class="line"><span class="lineno">  204</span>        callback(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value);</div>
 <div class="line"><span class="lineno">  205</span>        <a class="code hl_function" href="#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right);</div>
 <div class="line"><span class="lineno">  206</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph.svg" width="143" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a87c0a35845d27e0f6fc1f4eaa0333362" name="a87c0a35845d27e0f6fc1f4eaa0333362"></a>
@@ -1053,12 +1031,12 @@ template&lt;class T &gt; </div>
         <tr>
           <td class="memname">void <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::traverse_postorder </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; void(T)&gt;</td>          <td class="paramname"><span class="paramname"><em>callback</em></span>, </td>
+          <td class="paramtype">std::function&lt; void(T)&gt;</td>          <td class="paramname"><span class="paramname"><em>callback</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>node</em></span>&#160;)</td>
+          <td class="paramtype">std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>node</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -1076,6 +1054,8 @@ template&lt;class T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00231">231</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  232</span>                                                           {</div>
 <div class="line"><span class="lineno">  233</span>        <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
 <div class="line"><span class="lineno">  234</span>            <span class="keywordflow">return</span>;</div>
@@ -1085,12 +1065,7 @@ template&lt;class T &gt; </div>
 <div class="line"><span class="lineno">  238</span>        <a class="code hl_function" href="#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right);</div>
 <div class="line"><span class="lineno">  239</span>        callback(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value);</div>
 <div class="line"><span class="lineno">  240</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph.svg" width="148" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ab81edd415324d372632c42dc7dbcb9e1" name="ab81edd415324d372632c42dc7dbcb9e1"></a>
@@ -1107,12 +1082,12 @@ template&lt;class T &gt; </div>
         <tr>
           <td class="memname">void <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::traverse_preorder </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; void(T)&gt;</td>          <td class="paramname"><span class="paramname"><em>callback</em></span>, </td>
+          <td class="paramtype">std::function&lt; void(T)&gt;</td>          <td class="paramname"><span class="paramname"><em>callback</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>node</em></span>&#160;)</td>
+          <td class="paramtype">std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>node</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -1130,6 +1105,8 @@ template&lt;class T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00214">214</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  215</span>                                                          {</div>
 <div class="line"><span class="lineno">  216</span>        <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
 <div class="line"><span class="lineno">  217</span>            <span class="keywordflow">return</span>;</div>
@@ -1139,12 +1116,7 @@ template&lt;class T &gt; </div>
 <div class="line"><span class="lineno">  221</span>        <a class="code hl_function" href="#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left);</div>
 <div class="line"><span class="lineno">  222</span>        <a class="code hl_function" href="#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right);</div>
 <div class="line"><span class="lineno">  223</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph.svg" width="143" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
@@ -1160,7 +1132,7 @@ template&lt;class T &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt;<a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a>&gt; <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::root_</td>
+          <td class="memname">std::unique_ptr&lt;<a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a>&gt; <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::root_</td>
         </tr>
       </table>
   </td>
@@ -1171,6 +1143,8 @@ template&lt;class T &gt; </div>
 </div><div class="memdoc">
 <p>Pointer to the root of the BST. </p>
 
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
+
 </div>
 </div>
 <a id="a07ba32ce1a2af6e357600ac8c8e98dbc" name="a07ba32ce1a2af6e357600ac8c8e98dbc"></a>
@@ -1185,7 +1159,7 @@ template&lt;class T &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::size_ = 0</td>
+          <td class="memname">std::size_t <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::size_ = 0</td>
         </tr>
       </table>
   </td>
@@ -1196,10 +1170,12 @@ template&lt;class T &gt; </div>
 </div><div class="memdoc">
 <p>Number of elements/nodes in the BST. </p>
 
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00043">43</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../df/d42/binary__search__tree2_8cpp.html">binary_search_tree2.cpp</a></li>
+<li>data_structures/<a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph.map b/d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph.map
deleted file mode 100644
index 2505196cf..000000000
--- a/d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="binary_search_tree::get_elements_inorder" name="binary_search_tree::get_elements_inorder">
-<area shape="rect" id="Node000001" title="Get all values of the BST in in&#45;order order." alt="" coords="5,29,159,70"/>
-<area shape="rect" id="Node000002" href="$d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd" title="Recursive function to traverse the tree in in&#45;order order." alt="" coords="207,29,338,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,47,191,47,191,52,159,52"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="236,29,234,19,240,10,253,5,272,3,293,5,305,11,303,16,292,10,272,8,254,10,244,15,239,20,241,28"/>
-</map>
diff --git a/d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph.md5 b/d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph.md5
deleted file mode 100644
index 60a97f5a3..000000000
--- a/d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a5a3d5f581caced7886143e2b98bc0d1
\ No newline at end of file
diff --git a/d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph.svg b/d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph.svg
deleted file mode 100644
index 93892dafc..000000000
--- a/d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::get_elements_inorder Pages: 1 -->
-<svg width="258pt" height="57pt"
- viewBox="0.00 0.00 257.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::get_elements_inorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get all values of the BST in in&#45;order order.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_elements_inorder</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd" target="_top" xlink:title="Recursive function to traverse the tree in in&#45;order order.">
-<polygon fill="white" stroke="#666666" points="249.5,-30.5 151,-30.5 151,0 249.5,0 249.5,-30.5"/>
-<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="200.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_inorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.34,-15.25C123.24,-15.25 131.37,-15.25 139.32,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.27,-18.75 149.27,-15.25 139.27,-11.75 139.27,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.95,-30.99C169.79,-40.06 178.22,-48.5 200.25,-48.5 212.3,-48.5 220.28,-45.97 224.19,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.64,-42.84 225.36,-32.49 220.69,-42 227.64,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph_org.svg b/d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph_org.svg
deleted file mode 100644
index 2180a472c..000000000
--- a/d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph_org.svg
+++ /dev/null
@@ -1,50 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::get_elements_inorder Pages: 1 -->
-<svg width="258pt" height="57pt"
- viewBox="0.00 0.00 257.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::get_elements_inorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get all values of the BST in in&#45;order order.">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_elements_inorder</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd" target="_top" xlink:title="Recursive function to traverse the tree in in&#45;order order.">
-<polygon fill="white" stroke="#666666" points="249.5,-30.5 151,-30.5 151,0 249.5,0 249.5,-30.5"/>
-<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="200.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_inorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.34,-15.25C123.24,-15.25 131.37,-15.25 139.32,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.27,-18.75 149.27,-15.25 139.27,-11.75 139.27,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.95,-30.99C169.79,-40.06 178.22,-48.5 200.25,-48.5 212.3,-48.5 220.28,-45.97 224.19,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.64,-42.84 225.36,-32.49 220.69,-42 227.64,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph.map b/d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph.map
deleted file mode 100644
index 984e5bcb1..000000000
--- a/d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="binary_search_tree::traverse_inorder" name="binary_search_tree::traverse_inorder">
-<area shape="rect" id="Node000001" title="Recursive function to traverse the tree in in&#45;order order." alt="" coords="5,29,137,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,29,44,20,48,11,57,5,71,3,86,5,95,12,91,16,84,10,71,8,59,10,52,14,49,20,50,28"/>
-</map>
diff --git a/d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph.md5 b/d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph.md5
deleted file mode 100644
index 4ba8699f7..000000000
--- a/d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-69b581b1f66e8723358f5796f63c8def
\ No newline at end of file
diff --git a/d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph.svg b/d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph.svg
deleted file mode 100644
index d663e726d..000000000
--- a/d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::traverse_inorder Pages: 1 -->
-<svg width="107pt" height="57pt"
- viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::traverse_inorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to traverse the tree in in&#45;order order.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_inorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.56,-48.5 63.07,-45.97 65.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.23,-42.75 66.58,-32.49 62.26,-42.17 69.23,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph_org.svg b/d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph_org.svg
deleted file mode 100644
index 30d8a7d20..000000000
--- a/d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::traverse_inorder Pages: 1 -->
-<svg width="107pt" height="57pt"
- viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::traverse_inorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to traverse the tree in in&#45;order order.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_inorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.56,-48.5 63.07,-45.97 65.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.23,-42.75 66.58,-32.49 62.26,-42.17 69.23,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph.map b/d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph.map
deleted file mode 100644
index 6db5294e2..000000000
--- a/d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="binary_search_tree::find_max" name="binary_search_tree::find_max">
-<area shape="rect" id="Node000001" title="Find the largest value in the BST." alt="" coords="5,29,137,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,29,44,20,48,11,57,5,71,3,86,5,95,12,91,16,84,10,71,8,59,10,52,14,49,20,50,28"/>
-</map>
diff --git a/d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph.md5 b/d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph.md5
deleted file mode 100644
index 92a66fcb3..000000000
--- a/d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4ca8a999839ead2cbdf7c7164fd64bad
\ No newline at end of file
diff --git a/d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph.svg b/d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph.svg
deleted file mode 100644
index 67c232bd8..000000000
--- a/d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::find_max Pages: 1 -->
-<svg width="107pt" height="57pt"
- viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::find_max</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Find the largest value in the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.56,-48.5 63.07,-45.97 65.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.23,-42.75 66.58,-32.49 62.26,-42.17 69.23,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph_org.svg b/d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph_org.svg
deleted file mode 100644
index 9315c5197..000000000
--- a/d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::find_max Pages: 1 -->
-<svg width="107pt" height="57pt"
- viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::find_max</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Find the largest value in the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.56,-48.5 63.07,-45.97 65.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.23,-42.75 66.58,-32.49 62.26,-42.17 69.23,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph.map b/d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph.map
deleted file mode 100644
index a3b81c52a..000000000
--- a/d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="binary_search_tree::get_elements_preorder" name="binary_search_tree::get_elements_preorder">
-<area shape="rect" id="Node000001" title="Get all values of the BST in pre&#45;order order." alt="" coords="5,29,167,70"/>
-<area shape="rect" id="Node000002" href="$d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1" title="Recursive function to traverse the tree in pre&#45;order order." alt="" coords="215,29,346,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="167,47,199,47,199,52,167,52"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="243,29,241,19,248,10,261,5,280,3,302,5,314,11,312,16,300,10,280,8,262,10,251,15,247,20,249,28"/>
-</map>
diff --git a/d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph.md5 b/d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph.md5
deleted file mode 100644
index efee099f9..000000000
--- a/d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-33a023938c7c97af165b7458f2853978
\ No newline at end of file
diff --git a/d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph.svg b/d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph.svg
deleted file mode 100644
index b7db75f42..000000000
--- a/d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::get_elements_preorder Pages: 1 -->
-<svg width="264pt" height="57pt"
- viewBox="0.00 0.00 263.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::get_elements_preorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get all values of the BST in pre&#45;order order.">
-<polygon fill="#999999" stroke="#666666" points="121,-30.5 0,-30.5 0,0 121,0 121,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="60.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_elements_preorder</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1" target="_top" xlink:title="Recursive function to traverse the tree in pre&#45;order order.">
-<polygon fill="white" stroke="#666666" points="255.5,-30.5 157,-30.5 157,0 255.5,0 255.5,-30.5"/>
-<text text-anchor="start" x="165" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="206.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_preorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.21,-15.25C129.2,-15.25 137.38,-15.25 145.37,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.36,-18.75 155.36,-15.25 145.36,-11.75 145.36,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.42,-30.99C175.15,-40.06 183.76,-48.5 206.25,-48.5 218.55,-48.5 226.7,-45.97 230.69,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="234.14,-42.84 231.89,-32.49 227.19,-41.98 234.14,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph_org.svg b/d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph_org.svg
deleted file mode 100644
index b16eb574d..000000000
--- a/d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph_org.svg
+++ /dev/null
@@ -1,50 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::get_elements_preorder Pages: 1 -->
-<svg width="264pt" height="57pt"
- viewBox="0.00 0.00 263.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::get_elements_preorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get all values of the BST in pre&#45;order order.">
-<polygon fill="#999999" stroke="#666666" points="121,-30.5 0,-30.5 0,0 121,0 121,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="60.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_elements_preorder</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1" target="_top" xlink:title="Recursive function to traverse the tree in pre&#45;order order.">
-<polygon fill="white" stroke="#666666" points="255.5,-30.5 157,-30.5 157,0 255.5,0 255.5,-30.5"/>
-<text text-anchor="start" x="165" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="206.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_preorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.21,-15.25C129.2,-15.25 137.38,-15.25 145.37,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.36,-18.75 155.36,-15.25 145.36,-11.75 145.36,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.42,-30.99C175.15,-40.06 183.76,-48.5 206.25,-48.5 218.55,-48.5 226.7,-45.97 230.69,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="234.14,-42.84 231.89,-32.49 227.19,-41.98 234.14,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph.map b/d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph.map
deleted file mode 100644
index 1c44fd3e1..000000000
--- a/d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="binary_search_tree::get_elements_postorder" name="binary_search_tree::get_elements_postorder">
-<area shape="rect" id="Node000001" title="Get all values of the BST in post&#45;order order." alt="" coords="5,29,174,70"/>
-<area shape="rect" id="Node000002" href="$d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362" title="Recursive function to traverse the tree in post&#45;order order." alt="" coords="222,29,359,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="174,47,206,47,206,52,174,52"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="252,29,250,19,257,10,270,5,290,3,312,5,325,11,323,16,311,10,290,8,271,10,260,15,255,20,257,28"/>
-</map>
diff --git a/d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph.md5 b/d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph.md5
deleted file mode 100644
index f595a33c4..000000000
--- a/d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-eeafe46063f867880c85af66dd8628d4
\ No newline at end of file
diff --git a/d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph.svg b/d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph.svg
deleted file mode 100644
index 43132eec7..000000000
--- a/d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::get_elements_postorder Pages: 1 -->
-<svg width="273pt" height="57pt"
- viewBox="0.00 0.00 273.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::get_elements_postorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get all values of the BST in post&#45;order order.">
-<polygon fill="#999999" stroke="#666666" points="126.25,-30.5 0,-30.5 0,0 126.25,0 126.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_elements_postorder</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362" target="_top" xlink:title="Recursive function to traverse the tree in post&#45;order order.">
-<polygon fill="white" stroke="#666666" points="265.25,-30.5 162.25,-30.5 162.25,0 265.25,0 265.25,-30.5"/>
-<text text-anchor="start" x="170.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="213.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_postorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.72,-15.25C134.61,-15.25 142.68,-15.25 150.56,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.42,-18.75 160.42,-15.25 150.42,-11.75 150.42,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.06,-30.99C181.61,-40.06 190.51,-48.5 213.75,-48.5 226.46,-48.5 234.88,-45.97 239.01,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="242.46,-42.85 240.25,-32.49 235.51,-41.96 242.46,-42.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph_org.svg b/d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph_org.svg
deleted file mode 100644
index cd851e1f8..000000000
--- a/d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph_org.svg
+++ /dev/null
@@ -1,50 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::get_elements_postorder Pages: 1 -->
-<svg width="273pt" height="57pt"
- viewBox="0.00 0.00 273.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::get_elements_postorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get all values of the BST in post&#45;order order.">
-<polygon fill="#999999" stroke="#666666" points="126.25,-30.5 0,-30.5 0,0 126.25,0 126.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_elements_postorder</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362" target="_top" xlink:title="Recursive function to traverse the tree in post&#45;order order.">
-<polygon fill="white" stroke="#666666" points="265.25,-30.5 162.25,-30.5 162.25,0 265.25,0 265.25,-30.5"/>
-<text text-anchor="start" x="170.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="213.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_postorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.72,-15.25C134.61,-15.25 142.68,-15.25 150.56,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.42,-18.75 160.42,-15.25 150.42,-11.75 150.42,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.06,-30.99C181.61,-40.06 190.51,-48.5 213.75,-48.5 226.46,-48.5 234.88,-45.97 239.01,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="242.46,-42.85 240.25,-32.49 235.51,-41.96 242.46,-42.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph.map b/d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph.map
deleted file mode 100644
index 849fde14b..000000000
--- a/d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="binary_search_tree::contains" name="binary_search_tree::contains">
-<area shape="rect" id="Node000001" title="Check if a value is in the BST." alt="" coords="5,29,137,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,29,44,20,48,11,57,5,71,3,86,5,95,12,91,16,84,10,71,8,59,10,52,14,49,20,50,28"/>
-</map>
diff --git a/d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph.md5 b/d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph.md5
deleted file mode 100644
index 9f91a5d3c..000000000
--- a/d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-28674d48e1c2e722423b179c61936ff5
\ No newline at end of file
diff --git a/d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph.svg b/d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph.svg
deleted file mode 100644
index 2f61e9c40..000000000
--- a/d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::contains Pages: 1 -->
-<svg width="107pt" height="57pt"
- viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::contains</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Check if a value is in the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.56,-48.5 63.07,-45.97 65.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.23,-42.75 66.58,-32.49 62.26,-42.17 69.23,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph_org.svg b/d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph_org.svg
deleted file mode 100644
index 7cb6a0533..000000000
--- a/d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::contains Pages: 1 -->
-<svg width="107pt" height="57pt"
- viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::contains</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Check if a value is in the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.56,-48.5 63.07,-45.97 65.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.23,-42.75 66.58,-32.49 62.26,-42.17 69.23,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph.map b/d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph.map
deleted file mode 100644
index 15d6bc032..000000000
--- a/d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="binary_search_tree::find_max" name="binary_search_tree::find_max">
-<area shape="rect" id="Node000001" title="Recursive function to find the maximum value in the BST." alt="" coords="5,29,137,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,29,44,20,48,11,57,5,71,3,86,5,95,12,91,16,84,10,71,8,59,10,52,14,49,20,50,28"/>
-</map>
diff --git a/d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph.md5 b/d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph.md5
deleted file mode 100644
index fb6580a2f..000000000
--- a/d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8ffc926120dd3bf299ef6bde45a3269a
\ No newline at end of file
diff --git a/d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph.svg b/d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph.svg
deleted file mode 100644
index b31dd3318..000000000
--- a/d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::find_max Pages: 1 -->
-<svg width="107pt" height="57pt"
- viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::find_max</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to find the maximum value in the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.56,-48.5 63.07,-45.97 65.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.23,-42.75 66.58,-32.49 62.26,-42.17 69.23,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph_org.svg b/d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph_org.svg
deleted file mode 100644
index 95f84f52d..000000000
--- a/d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::find_max Pages: 1 -->
-<svg width="107pt" height="57pt"
- viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::find_max</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to find the maximum value in the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.56,-48.5 63.07,-45.97 65.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.23,-42.75 66.58,-32.49 62.26,-42.17 69.23,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph.map b/d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph.map
deleted file mode 100644
index 4da834697..000000000
--- a/d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="binary_search_tree::insert" name="binary_search_tree::insert">
-<area shape="rect" id="Node000001" title="Insert a new value into the BST." alt="" coords="5,29,137,70"/>
-<area shape="rect" id="Node000002" href="$d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" title="Recursive function to insert a value into the BST." alt="" coords="185,29,316,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="137,47,169,47,169,52,137,52"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="216,29,214,19,220,10,232,5,250,3,270,5,282,11,279,16,268,10,250,8,234,10,223,14,220,20,221,28"/>
-</map>
diff --git a/d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph.md5 b/d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph.md5
deleted file mode 100644
index 6959a4896..000000000
--- a/d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-080e7b67ba287b77252c55e83a217f60
\ No newline at end of file
diff --git a/d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph.svg b/d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph.svg
deleted file mode 100644
index 7e6dde691..000000000
--- a/d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::insert Pages: 1 -->
-<svg width="241pt" height="57pt"
- viewBox="0.00 0.00 241.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Insert a new value into the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="white" stroke="#666666" points="233,-30.5 134.5,-30.5 134.5,0 233,0 233,-30.5"/>
-<text text-anchor="start" x="142.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="183.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.84,-15.25C106.67,-15.25 114.85,-15.25 122.91,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.66,-18.75 132.66,-15.25 122.66,-11.75 122.66,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.92,-30.99C155.05,-40.06 163,-48.5 183.75,-48.5 195.1,-48.5 202.62,-45.97 206.31,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="209.76,-42.82 207.41,-32.49 202.8,-42.03 209.76,-42.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph_org.svg b/d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph_org.svg
deleted file mode 100644
index 36c5208c9..000000000
--- a/d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph_org.svg
+++ /dev/null
@@ -1,50 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::insert Pages: 1 -->
-<svg width="241pt" height="57pt"
- viewBox="0.00 0.00 241.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Insert a new value into the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="white" stroke="#666666" points="233,-30.5 134.5,-30.5 134.5,0 233,0 233,-30.5"/>
-<text text-anchor="start" x="142.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="183.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.84,-15.25C106.67,-15.25 114.85,-15.25 122.91,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.66,-18.75 132.66,-15.25 122.66,-11.75 122.66,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.92,-30.99C155.05,-40.06 163,-48.5 183.75,-48.5 195.1,-48.5 202.62,-45.97 206.31,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="209.76,-42.82 207.41,-32.49 202.8,-42.03 209.76,-42.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph.map b/d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph.map
deleted file mode 100644
index d20c05ea2..000000000
--- a/d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="binary_search_tree::traverse_postorder" name="binary_search_tree::traverse_postorder">
-<area shape="rect" id="Node000001" title="Recursive function to traverse the tree in post&#45;order order." alt="" coords="5,29,143,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="47,29,46,20,50,11,60,5,74,3,89,5,99,12,95,16,87,10,74,8,61,10,54,14,51,20,52,28"/>
-</map>
diff --git a/d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph.md5 b/d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph.md5
deleted file mode 100644
index 34891a516..000000000
--- a/d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6cb06dd2e2f53fad3f0f8f3b20452652
\ No newline at end of file
diff --git a/d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph.svg b/d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph.svg
deleted file mode 100644
index 39cce735b..000000000
--- a/d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::traverse_postorder Pages: 1 -->
-<svg width="111pt" height="57pt"
- viewBox="0.00 0.00 111.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::traverse_postorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to traverse the tree in post&#45;order order.">
-<polygon fill="#999999" stroke="#666666" points="103,-30.5 0,-30.5 0,0 103,0 103,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="51.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_postorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.25,-30.99C29.52,-40.06 35.61,-48.5 51.5,-48.5 60.19,-48.5 65.95,-45.97 68.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.24,-42.76 69.62,-32.49 65.26,-42.15 72.24,-42.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph_org.svg b/d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph_org.svg
deleted file mode 100644
index f2ad138db..000000000
--- a/d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::traverse_postorder Pages: 1 -->
-<svg width="111pt" height="57pt"
- viewBox="0.00 0.00 111.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::traverse_postorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to traverse the tree in post&#45;order order.">
-<polygon fill="#999999" stroke="#666666" points="103,-30.5 0,-30.5 0,0 103,0 103,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="51.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_postorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.25,-30.99C29.52,-40.06 35.61,-48.5 51.5,-48.5 60.19,-48.5 65.95,-45.97 68.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.24,-42.76 69.62,-32.49 65.26,-42.15 72.24,-42.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.map b/d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.map
deleted file mode 100644
index 40f88b60c..000000000
--- a/d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="binary_search_tree::remove" name="binary_search_tree::remove">
-<area shape="rect" id="Node000001" title="Remove a specified value from the BST." alt="" coords="5,59,137,99"/>
-<area shape="rect" id="Node000002" href="$d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153" title="Recursive function to remove a value from the BST." alt="" coords="185,59,316,99"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="137,76,169,76,169,82,137,82"/>
-<area shape="poly" id="edge5_Node000002_Node000002" title=" " alt="" coords="216,59,214,49,220,40,232,34,250,32,270,34,282,41,279,45,268,40,250,37,234,39,223,44,220,50,221,58"/>
-<area shape="rect" id="Node000003" href="$d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" title="Recursive function to find the maximum value in the BST." alt="" coords="364,29,495,70"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="316,66,348,60,349,66,317,71"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="390,94,469,120"/>
-<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="317,87,375,96,375,101,316,92"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="395,29,394,19,399,10,411,5,430,3,449,5,461,11,458,16,448,10,430,8,413,10,403,14,399,20,401,28"/>
-</map>
diff --git a/d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.md5 b/d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.md5
deleted file mode 100644
index c491ea24e..000000000
--- a/d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-57246ae55ac34f923eacdd7a9b26c28d
\ No newline at end of file
diff --git a/d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.svg b/d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.svg
deleted file mode 100644
index 53c98e3fc..000000000
--- a/d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.svg
+++ /dev/null
@@ -1,122 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::remove Pages: 1 -->
-<svg width="376pt" height="94pt"
- viewBox="0.00 0.00 375.50 93.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89.88)">
-<title>binary_search_tree::remove</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Remove a specified value from the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-45.88 0,-45.88 0,-15.37 98.5,-15.37 98.5,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::remove</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153" target="_top" xlink:title="Recursive function to remove a value from the BST.">
-<polygon fill="white" stroke="#666666" points="233,-45.88 134.5,-45.88 134.5,-15.37 233,-15.37 233,-45.88"/>
-<text text-anchor="start" x="142.5" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="183.75" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::remove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.84,-30.62C106.67,-30.62 114.85,-30.62 122.91,-30.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.66,-34.13 132.66,-30.63 122.66,-27.13 122.66,-34.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge5_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge5_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.92,-46.36C155.05,-55.43 163,-63.88 183.75,-63.88 195.1,-63.88 202.62,-61.35 206.31,-57.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="209.76,-58.2 207.41,-47.86 202.8,-57.4 209.76,-58.2"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" target="_top" xlink:title="Recursive function to find the maximum value in the BST.">
-<polygon fill="white" stroke="#666666" points="367.5,-67.88 269,-67.88 269,-37.38 367.5,-37.38 367.5,-67.88"/>
-<text text-anchor="start" x="277" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="318.25" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M233.34,-38.69C241.17,-39.99 249.35,-41.35 257.41,-42.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="256.74,-46.13 267.18,-44.31 257.89,-39.22 256.74,-46.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="348,-19.25 288.5,-19.25 288.5,0 348,0 348,-19.25"/>
-<text text-anchor="middle" x="318.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M233.34,-22.92C247.76,-20.64 263.39,-18.16 277.21,-15.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.5,-19.47 286.83,-14.45 276.4,-12.56 277.5,-19.47"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M294.42,-68.36C289.55,-77.43 297.5,-85.88 318.25,-85.88 329.6,-85.88 337.12,-83.35 340.81,-79.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.26,-80.2 341.91,-69.86 337.3,-79.4 344.26,-80.2"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph_org.svg b/d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph_org.svg
deleted file mode 100644
index 2be4809c1..000000000
--- a/d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph_org.svg
+++ /dev/null
@@ -1,96 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::remove Pages: 1 -->
-<svg width="376pt" height="94pt"
- viewBox="0.00 0.00 375.50 93.88" 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.88)">
-<title>binary_search_tree::remove</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Remove a specified value from the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-45.88 0,-45.88 0,-15.37 98.5,-15.37 98.5,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::remove</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153" target="_top" xlink:title="Recursive function to remove a value from the BST.">
-<polygon fill="white" stroke="#666666" points="233,-45.88 134.5,-45.88 134.5,-15.37 233,-15.37 233,-45.88"/>
-<text text-anchor="start" x="142.5" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="183.75" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::remove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.84,-30.62C106.67,-30.62 114.85,-30.62 122.91,-30.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.66,-34.13 132.66,-30.63 122.66,-27.13 122.66,-34.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge5_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge5_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.92,-46.36C155.05,-55.43 163,-63.88 183.75,-63.88 195.1,-63.88 202.62,-61.35 206.31,-57.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="209.76,-58.2 207.41,-47.86 202.8,-57.4 209.76,-58.2"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" target="_top" xlink:title="Recursive function to find the maximum value in the BST.">
-<polygon fill="white" stroke="#666666" points="367.5,-67.88 269,-67.88 269,-37.38 367.5,-37.38 367.5,-67.88"/>
-<text text-anchor="start" x="277" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="318.25" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M233.34,-38.69C241.17,-39.99 249.35,-41.35 257.41,-42.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="256.74,-46.13 267.18,-44.31 257.89,-39.22 256.74,-46.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="348,-19.25 288.5,-19.25 288.5,0 348,0 348,-19.25"/>
-<text text-anchor="middle" x="318.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M233.34,-22.92C247.76,-20.64 263.39,-18.16 277.21,-15.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.5,-19.47 286.83,-14.45 276.4,-12.56 277.5,-19.47"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M294.42,-68.36C289.55,-77.43 297.5,-85.88 318.25,-85.88 329.6,-85.88 337.12,-83.35 340.81,-79.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.26,-80.2 341.91,-69.86 337.3,-79.4 344.26,-80.2"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph.map b/d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph.map
deleted file mode 100644
index 7bf449b9e..000000000
--- a/d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="binary_search_tree::insert" name="binary_search_tree::insert">
-<area shape="rect" id="Node000001" title="Recursive function to insert a value into the BST." alt="" coords="5,29,137,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,29,44,20,48,11,57,5,71,3,86,5,95,12,91,16,84,10,71,8,59,10,52,14,49,20,50,28"/>
-</map>
diff --git a/d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph.md5 b/d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph.md5
deleted file mode 100644
index 288355a36..000000000
--- a/d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a2b315f8c7f44346f4bd6c9569afa64c
\ No newline at end of file
diff --git a/d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph.svg b/d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph.svg
deleted file mode 100644
index 0920bddd5..000000000
--- a/d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::insert Pages: 1 -->
-<svg width="107pt" height="57pt"
- viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.56,-48.5 63.07,-45.97 65.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.23,-42.75 66.58,-32.49 62.26,-42.17 69.23,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph_org.svg b/d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph_org.svg
deleted file mode 100644
index 493378c9b..000000000
--- a/d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::insert Pages: 1 -->
-<svg width="107pt" height="57pt"
- viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.56,-48.5 63.07,-45.97 65.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.23,-42.75 66.58,-32.49 62.26,-42.17 69.23,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph.map b/d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph.map
deleted file mode 100644
index 41dd6d2b6..000000000
--- a/d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="binary_search_tree::contains" name="binary_search_tree::contains">
-<area shape="rect" id="Node000001" title="Recursive function to check if a value is in the BST." alt="" coords="5,29,137,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,29,44,20,48,11,57,5,71,3,86,5,95,12,91,16,84,10,71,8,59,10,52,14,49,20,50,28"/>
-</map>
diff --git a/d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph.md5 b/d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph.md5
deleted file mode 100644
index 28e6b2c2e..000000000
--- a/d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-653e50a907d5cc12636be440c9003711
\ No newline at end of file
diff --git a/d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph.svg b/d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph.svg
deleted file mode 100644
index 9466d6036..000000000
--- a/d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::contains Pages: 1 -->
-<svg width="107pt" height="57pt"
- viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::contains</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to check if a value is in the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.56,-48.5 63.07,-45.97 65.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.23,-42.75 66.58,-32.49 62.26,-42.17 69.23,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph_org.svg b/d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph_org.svg
deleted file mode 100644
index 8fdd23b00..000000000
--- a/d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::contains Pages: 1 -->
-<svg width="107pt" height="57pt"
- viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::contains</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to check if a value is in the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.56,-48.5 63.07,-45.97 65.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.23,-42.75 66.58,-32.49 62.26,-42.17 69.23,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph.map b/d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph.map
deleted file mode 100644
index 6e43fc8a4..000000000
--- a/d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="binary_search_tree::traverse_preorder" name="binary_search_tree::traverse_preorder">
-<area shape="rect" id="Node000001" title="Recursive function to traverse the tree in pre&#45;order order." alt="" coords="5,29,137,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,29,44,20,48,11,57,5,71,3,86,5,95,12,91,16,84,10,71,8,59,10,52,14,49,20,50,28"/>
-</map>
diff --git a/d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph.md5 b/d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph.md5
deleted file mode 100644
index a0b0b0ee6..000000000
--- a/d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a3a9f2348cd097efdd9727e6a854905b
\ No newline at end of file
diff --git a/d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph.svg b/d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph.svg
deleted file mode 100644
index c77c08599..000000000
--- a/d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::traverse_preorder Pages: 1 -->
-<svg width="107pt" height="57pt"
- viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::traverse_preorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to traverse the tree in pre&#45;order order.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_preorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.56,-48.5 63.07,-45.97 65.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.23,-42.75 66.58,-32.49 62.26,-42.17 69.23,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph_org.svg b/d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph_org.svg
deleted file mode 100644
index 13dce6c9a..000000000
--- a/d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::traverse_preorder Pages: 1 -->
-<svg width="107pt" height="57pt"
- viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::traverse_preorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to traverse the tree in pre&#45;order order.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_preorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.56,-48.5 63.07,-45.97 65.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.23,-42.75 66.58,-32.49 62.26,-42.17 69.23,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph.map b/d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph.map
deleted file mode 100644
index 1d66ec6cd..000000000
--- a/d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="binary_search_tree::find_min" name="binary_search_tree::find_min">
-<area shape="rect" id="Node000001" title="Find the smallest value in the BST." alt="" coords="5,29,137,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,29,44,20,48,11,57,5,71,3,86,5,95,12,91,16,84,10,71,8,59,10,52,14,49,20,50,28"/>
-</map>
diff --git a/d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph.md5 b/d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph.md5
deleted file mode 100644
index 3422914f9..000000000
--- a/d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2fbc10be889a7c7f43f67501e4067ad9
\ No newline at end of file
diff --git a/d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph.svg b/d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph.svg
deleted file mode 100644
index 2a4474821..000000000
--- a/d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::find_min Pages: 1 -->
-<svg width="107pt" height="57pt"
- viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::find_min</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Find the smallest value in the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.56,-48.5 63.07,-45.97 65.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.23,-42.75 66.58,-32.49 62.26,-42.17 69.23,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph_org.svg b/d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph_org.svg
deleted file mode 100644
index 111f09d29..000000000
--- a/d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::find_min Pages: 1 -->
-<svg width="107pt" height="57pt"
- viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::find_min</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Find the smallest value in the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.56,-48.5 63.07,-45.97 65.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.23,-42.75 66.58,-32.49 62.26,-42.17 69.23,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph.map b/d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph.map
deleted file mode 100644
index 714195c8c..000000000
--- a/d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="binary_search_tree::remove" name="binary_search_tree::remove">
-<area shape="rect" id="Node000001" title="Recursive function to remove a value from the BST." alt="" coords="5,59,137,99"/>
-<area shape="poly" id="edge4_Node000001_Node000001" title=" " alt="" coords="37,59,35,49,41,40,53,34,71,32,91,34,102,41,100,45,89,40,71,37,54,39,44,44,40,50,42,58"/>
-<area shape="rect" id="Node000002" href="$d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" title="Recursive function to find the maximum value in the BST." alt="" coords="185,29,316,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="137,66,169,60,170,66,138,71"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="211,94,290,120"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="138,87,196,96,195,101,137,92"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="216,29,214,19,220,10,232,5,250,3,270,5,282,11,279,16,268,10,250,8,234,10,223,14,220,20,221,28"/>
-</map>
diff --git a/d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph.md5 b/d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph.md5
deleted file mode 100644
index 34ce69c97..000000000
--- a/d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-755986238065a3a12feb3908e83fef59
\ No newline at end of file
diff --git a/d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph.svg b/d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph.svg
deleted file mode 100644
index b7b159587..000000000
--- a/d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::remove Pages: 1 -->
-<svg width="241pt" height="94pt"
- viewBox="0.00 0.00 241.00 93.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89.88)">
-<title>binary_search_tree::remove</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to remove a value from the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-45.88 0,-45.88 0,-15.37 98.5,-15.37 98.5,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::remove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.42,-46.36C20.55,-55.43 28.5,-63.88 49.25,-63.88 60.6,-63.88 68.12,-61.35 71.81,-57.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.26,-58.2 72.91,-47.86 68.3,-57.4 75.26,-58.2"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" target="_top" xlink:title="Recursive function to find the maximum value in the BST.">
-<polygon fill="white" stroke="#666666" points="233,-67.88 134.5,-67.88 134.5,-37.38 233,-37.38 233,-67.88"/>
-<text text-anchor="start" x="142.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="183.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.84,-38.69C106.67,-39.99 114.85,-41.35 122.91,-42.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.24,-46.13 132.68,-44.31 123.39,-39.22 122.24,-46.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="213.5,-19.25 154,-19.25 154,0 213.5,0 213.5,-19.25"/>
-<text text-anchor="middle" x="183.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.84,-22.92C113.26,-20.64 128.89,-18.16 142.71,-15.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143,-19.47 152.33,-14.45 141.9,-12.56 143,-19.47"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.92,-68.36C155.05,-77.43 163,-85.88 183.75,-85.88 195.1,-85.88 202.62,-83.35 206.31,-79.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="209.76,-80.2 207.41,-69.86 202.8,-79.4 209.76,-80.2"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph_org.svg b/d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph_org.svg
deleted file mode 100644
index 9179b4206..000000000
--- a/d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph_org.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::remove Pages: 1 -->
-<svg width="241pt" height="94pt"
- viewBox="0.00 0.00 241.00 93.88" 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.88)">
-<title>binary_search_tree::remove</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to remove a value from the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-45.88 0,-45.88 0,-15.37 98.5,-15.37 98.5,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::remove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.42,-46.36C20.55,-55.43 28.5,-63.88 49.25,-63.88 60.6,-63.88 68.12,-61.35 71.81,-57.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.26,-58.2 72.91,-47.86 68.3,-57.4 75.26,-58.2"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" target="_top" xlink:title="Recursive function to find the maximum value in the BST.">
-<polygon fill="white" stroke="#666666" points="233,-67.88 134.5,-67.88 134.5,-37.38 233,-37.38 233,-67.88"/>
-<text text-anchor="start" x="142.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="183.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.84,-38.69C106.67,-39.99 114.85,-41.35 122.91,-42.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.24,-46.13 132.68,-44.31 123.39,-39.22 122.24,-46.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="213.5,-19.25 154,-19.25 154,0 213.5,0 213.5,-19.25"/>
-<text text-anchor="middle" x="183.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.84,-22.92C113.26,-20.64 128.89,-18.16 142.71,-15.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143,-19.47 152.33,-14.45 141.9,-12.56 143,-19.47"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.92,-68.36C155.05,-77.43 163,-85.88 183.75,-85.88 195.1,-85.88 202.62,-83.35 206.31,-79.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="209.76,-80.2 207.41,-69.86 202.8,-79.4 209.76,-80.2"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph.map b/d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph.map
deleted file mode 100644
index 4f021515a..000000000
--- a/d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="binary_search_tree::find_min" name="binary_search_tree::find_min">
-<area shape="rect" id="Node000001" title="Recursive function to find the minimum value in the BST." alt="" coords="5,29,137,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,29,44,20,48,11,57,5,71,3,86,5,95,12,91,16,84,10,71,8,59,10,52,14,49,20,50,28"/>
-</map>
diff --git a/d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph.md5 b/d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph.md5
deleted file mode 100644
index cfe9794ea..000000000
--- a/d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b1e8a77cfcc4494204bfe90be1f5755e
\ No newline at end of file
diff --git a/d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph.svg b/d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph.svg
deleted file mode 100644
index 4bfb56ca1..000000000
--- a/d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::find_min Pages: 1 -->
-<svg width="107pt" height="57pt"
- viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::find_min</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to find the minimum value in the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.56,-48.5 63.07,-45.97 65.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.23,-42.75 66.58,-32.49 62.26,-42.17 69.23,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph_org.svg b/d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph_org.svg
deleted file mode 100644
index c70a95680..000000000
--- a/d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binary_search_tree::find_min Pages: 1 -->
-<svg width="107pt" height="57pt"
- viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>binary_search_tree::find_min</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to find the minimum value in the BST.">
-<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.56,-48.5 63.07,-45.97 65.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.23,-42.75 66.58,-32.49 62.26,-42.17 69.23,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dde/structdouble__hashing_1_1_entry.html b/d9/dde/structdouble__hashing_1_1_entry.html
index 461f1475e..87957b041 100644
--- a/d9/dde/structdouble__hashing_1_1_entry.html
+++ b/d9/dde/structdouble__hashing_1_1_entry.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: double_hashing::Entry Struct Reference</title>
+<title>TheAlgorithms/C++: double_hashing::Entry Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -114,22 +131,71 @@ $(function(){initNavTree('d9/dde/structdouble__hashing_1_1_entry.html','../../')
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:a287b92112b6b43b34808a93778873475" id="r_a287b92112b6b43b34808a93778873475"><td class="memItemLeft" align="right" valign="top"><a id="a287b92112b6b43b34808a93778873475" name="a287b92112b6b43b34808a93778873475"></a>
-&#160;</td><td class="memItemRight" valign="bottom"><b>Entry</b> (int <a class="el" href="#ae114967c89dbba3b754dc4976bba3248">key</a>=notPresent)</td></tr>
-<tr class="memdesc:a287b92112b6b43b34808a93778873475"><td class="mdescLeft">&#160;</td><td class="mdescRight">constructor <br /></td></tr>
+<tr class="memitem:a287b92112b6b43b34808a93778873475" id="r_a287b92112b6b43b34808a93778873475"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a287b92112b6b43b34808a93778873475">Entry</a> (int <a class="el" href="#ae114967c89dbba3b754dc4976bba3248">key</a>=notPresent)</td></tr>
+<tr class="memdesc:a287b92112b6b43b34808a93778873475"><td class="mdescLeft">&#160;</td><td class="mdescRight">constructor  <br /></td></tr>
 <tr class="separator:a287b92112b6b43b34808a93778873475"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:ae114967c89dbba3b754dc4976bba3248" id="r_ae114967c89dbba3b754dc4976bba3248"><td class="memItemLeft" align="right" valign="top"><a id="ae114967c89dbba3b754dc4976bba3248" name="ae114967c89dbba3b754dc4976bba3248"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>key</b></td></tr>
-<tr class="memdesc:ae114967c89dbba3b754dc4976bba3248"><td class="mdescLeft">&#160;</td><td class="mdescRight">key value <br /></td></tr>
+<tr class="memitem:ae114967c89dbba3b754dc4976bba3248" id="r_ae114967c89dbba3b754dc4976bba3248"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae114967c89dbba3b754dc4976bba3248">key</a></td></tr>
+<tr class="memdesc:ae114967c89dbba3b754dc4976bba3248"><td class="mdescLeft">&#160;</td><td class="mdescRight">key value  <br /></td></tr>
 <tr class="separator:ae114967c89dbba3b754dc4976bba3248"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a class="el" href="../../db/d8b/struct_node.html">Node</a> object that holds key </p>
-</div><hr/>The documentation for this struct was generated from the following file:<ul>
-<li>hashing/<a class="el" href="../../d6/d80/double__hash__hash__table_8cpp.html">double_hash_hash_table.cpp</a></li>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
+</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
+<a id="a287b92112b6b43b34808a93778873475" name="a287b92112b6b43b34808a93778873475"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a287b92112b6b43b34808a93778873475">&#9670;&#160;</a></span>Entry()</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">double_hashing::Entry::Entry </td>
+          <td>(</td>
+          <td class="paramtype">int</td>          <td class="paramname"><span class="paramname"><em>key</em></span><span class="paramdefsep"> = </span><span class="paramdefval">notPresent</span></td><td>)</td>
+          <td></td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">explicit</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>constructor </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="ae114967c89dbba3b754dc4976bba3248" name="ae114967c89dbba3b754dc4976bba3248"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ae114967c89dbba3b754dc4976bba3248">&#9670;&#160;</a></span>key</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int double_hashing::Entry::key</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>key value </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<hr/>The documentation for this struct was generated from the following file:<ul>
+<li>hashing/<a class="el" href="../../d6/d80/double__hash__hash__table_8cpp_source.html">double_hash_hash_table.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp.html b/d9/dec/unbounded__0__1__knapsack_8cpp.html
index 9eb9230a2..25d9cc8d5 100644
--- a/d9/dec/unbounded__0__1__knapsack_8cpp.html
+++ b/d9/dec/unbounded__0__1__knapsack_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/unbounded_0_1_knapsack.cpp File Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming/unbounded_0_1_knapsack.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for unbounded_0_1_knapsack.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d85/unbounded__0__1__knapsack_8cpp__incl.svg" width="336" height="126"><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">
+</div>
+<p><a href="../../d9/dec/unbounded__0__1__knapsack_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
@@ -134,10 +153,10 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:afe447a5979582174908695952c8a079c" id="r_afe447a5979582174908695952c8a079c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afe447a5979582174908695952c8a079c">dynamic_programming::unbounded_knapsack::KnapSackFilling</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> i, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> W, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> &gt; &amp;val, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> &gt; &amp;wt, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; &amp;dp)</td></tr>
+<tr class="memitem:afe447a5979582174908695952c8a079c" id="r_afe447a5979582174908695952c8a079c"><td class="memItemLeft" align="right" valign="top">std::uint16_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afe447a5979582174908695952c8a079c">dynamic_programming::unbounded_knapsack::KnapSackFilling</a> (std::uint16_t i, std::uint16_t W, const std::vector&lt; std::uint16_t &gt; &amp;val, const std::vector&lt; std::uint16_t &gt; &amp;wt, std::vector&lt; std::vector&lt; int &gt; &gt; &amp;dp)</td></tr>
 <tr class="memdesc:afe447a5979582174908695952c8a079c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.  <br /></td></tr>
 <tr class="separator:afe447a5979582174908695952c8a079c"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a1bcff7f76de48fa7f629480f8f18b5ef" id="r_a1bcff7f76de48fa7f629480f8f18b5ef"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1bcff7f76de48fa7f629480f8f18b5ef">dynamic_programming::unbounded_knapsack::unboundedKnapsack</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> N, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> W, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> &gt; &amp;val, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> &gt; &amp;wt)</td></tr>
+<tr class="memitem:a1bcff7f76de48fa7f629480f8f18b5ef" id="r_a1bcff7f76de48fa7f629480f8f18b5ef"><td class="memItemLeft" align="right" valign="top">std::uint16_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1bcff7f76de48fa7f629480f8f18b5ef">dynamic_programming::unbounded_knapsack::unboundedKnapsack</a> (std::uint16_t N, std::uint16_t W, const std::vector&lt; std::uint16_t &gt; &amp;val, const std::vector&lt; std::uint16_t &gt; &amp;wt)</td></tr>
 <tr class="memdesc:a1bcff7f76de48fa7f629480f8f18b5ef"><td class="mdescLeft">&#160;</td><td class="mdescRight">Wrapper function to initiate the unbounded knapsack calculation.  <br /></td></tr>
 <tr class="separator:a1bcff7f76de48fa7f629480f8f18b5ef"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
@@ -157,6 +176,8 @@ Algorithm</h3>
 <p>The approach uses dynamic programming to build a solution iteratively. A 2D array is used for memoization to store intermediate results, allowing the function to avoid redundant calculations.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/yeolesanskruti" target="_blank">Sanskruti Yeole</a> </dd></dl>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../db/d16/0__1__knapsack_8cpp.html" title="Implementation of [0-1 Knapsack Problem] (https://en.wikipedia.org/wiki/Knapsack_problem)">dynamic_programming/0_1_knapsack.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/dec/unbounded__0__1__knapsack_8cpp_source.html">unbounded_0_1_knapsack.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="afe447a5979582174908695952c8a079c" name="afe447a5979582174908695952c8a079c"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#afe447a5979582174908695952c8a079c">&#9670;&#160;</a></span>KnapSackFilling()</h2>
@@ -165,29 +186,29 @@ Algorithm</h3>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> dynamic_programming::unbounded_knapsack::KnapSackFilling </td>
+          <td class="memname">std::uint16_t dynamic_programming::unbounded_knapsack::KnapSackFilling </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a></td>          <td class="paramname"><span class="paramname"><em>i</em></span>, </td>
+          <td class="paramtype">std::uint16_t</td>          <td class="paramname"><span class="paramname"><em>i</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a></td>          <td class="paramname"><span class="paramname"><em>W</em></span>, </td>
+          <td class="paramtype">std::uint16_t</td>          <td class="paramname"><span class="paramname"><em>W</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>val</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::uint16_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>val</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>wt</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::uint16_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>wt</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>dp</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; int &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>dp</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -216,6 +237,8 @@ Algorithm</h3>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The maximum value that can be obtained for the given index and capacity. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dec/unbounded__0__1__knapsack_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d9/dec/unbounded__0__1__knapsack_8cpp_source.html">unbounded_0_1_knapsack.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   61</span>                                                             {</div>
 <div class="line"><span class="lineno">   62</span>    <span class="keywordflow">if</span> (i == 0) {</div>
 <div class="line"><span class="lineno">   63</span>        <span class="keywordflow">if</span> (wt[0] &lt;= W) {</div>
@@ -236,17 +259,11 @@ Algorithm</h3>
 <div class="line"><span class="lineno">   78</span>                                        <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);  <span class="comment">// Value taking item i</span></div>
 <div class="line"><span class="lineno">   79</span>    }</div>
 <div class="line"><span class="lineno">   80</span>    <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][W] =</div>
-<div class="line"><span class="lineno">   81</span>               <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(take, nottake);  <span class="comment">// Store and return the maximum value</span></div>
+<div class="line"><span class="lineno">   81</span>               std::max(take, nottake);  <span class="comment">// Store and return the maximum value</span></div>
 <div class="line"><span class="lineno">   82</span>}</div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="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="aunbounded__0__1__knapsack_8cpp_html_afe447a5979582174908695952c8a079c"><div class="ttname"><a href="#afe447a5979582174908695952c8a079c">dynamic_programming::unbounded_knapsack::KnapSackFilling</a></div><div class="ttdeci">std::uint16_t KnapSackFilling(std::uint16_t i, std::uint16_t W, const std::vector&lt; std::uint16_t &gt; &amp;val, const std::vector&lt; std::uint16_t &gt; &amp;wt, std::vector&lt; std::vector&lt; int &gt; &gt; &amp;dp)</div><div class="ttdoc">Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.</div><div class="ttdef"><b>Definition</b> unbounded_0_1_knapsack.cpp:58</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dec/unbounded__0__1__knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.svg" width="287" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></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> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></div>
+<div class="ttc" id="aunbounded__0__1__knapsack_8cpp_html_afe447a5979582174908695952c8a079c"><div class="ttname"><a href="#afe447a5979582174908695952c8a079c">dynamic_programming::unbounded_knapsack::KnapSackFilling</a></div><div class="ttdeci">std::uint16_t KnapSackFilling(std::uint16_t i, std::uint16_t W, const std::vector&lt; std::uint16_t &gt; &amp;val, const std::vector&lt; std::uint16_t &gt; &amp;wt, std::vector&lt; std::vector&lt; int &gt; &gt; &amp;dp)</div><div class="ttdoc">Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dec/unbounded__0__1__knapsack_8cpp_source.html#l00058">unbounded_0_1_knapsack.cpp:58</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -266,17 +283,14 @@ Here is the call graph for this function:</div>
 
 <p>main function </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on successful exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dec/unbounded__0__1__knapsack_8cpp_source.html#l00170">170</a> of file <a class="el" href="../../d9/dec/unbounded__0__1__knapsack_8cpp_source.html">unbounded_0_1_knapsack.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  170</span>           {</div>
 <div class="line"><span class="lineno">  171</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// Run self test implementation</span></div>
 <div class="line"><span class="lineno">  172</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  173</span>}</div>
-<div class="ttc" id="aunbounded__0__1__knapsack_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">self test implementation</div><div class="ttdef"><b>Definition</b> unbounded_0_1_knapsack.cpp:111</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="278" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aunbounded__0__1__knapsack_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">self test implementation</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dec/unbounded__0__1__knapsack_8cpp_source.html#l00111">unbounded_0_1_knapsack.cpp:111</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -304,71 +318,64 @@ Here is the call graph for this function:</div>
 
 <p>self test implementation </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dec/unbounded__0__1__knapsack_8cpp_source.html#l00111">111</a> of file <a class="el" href="../../d9/dec/unbounded__0__1__knapsack_8cpp_source.html">unbounded_0_1_knapsack.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  111</span>                    {</div>
 <div class="line"><span class="lineno">  112</span>    <span class="comment">// Test Case 1</span></div>
-<div class="line"><span class="lineno">  113</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> N1 = 4;                            <span class="comment">// Number of items</span></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&lt;std::uint16_t&gt;</a> wt1 = {1, 3, 4, 5};   <span class="comment">// Weights of the items</span></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&lt;std::uint16_t&gt;</a> val1 = {6, 1, 7, 7};  <span class="comment">// Values of the items</span></div>
-<div class="line"><span class="lineno">  116</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> W1 = 8;  <span class="comment">// Maximum capacity of the knapsack</span></div>
+<div class="line"><span class="lineno">  113</span>    std::uint16_t N1 = 4;                            <span class="comment">// Number of items</span></div>
+<div class="line"><span class="lineno">  114</span>    std::vector&lt;std::uint16_t&gt; wt1 = {1, 3, 4, 5};   <span class="comment">// Weights of the items</span></div>
+<div class="line"><span class="lineno">  115</span>    std::vector&lt;std::uint16_t&gt; val1 = {6, 1, 7, 7};  <span class="comment">// Values of the items</span></div>
+<div class="line"><span class="lineno">  116</span>    std::uint16_t W1 = 8;  <span class="comment">// Maximum capacity of the knapsack</span></div>
 <div class="line"><span class="lineno">  117</span>    <span class="comment">// Test the function and assert the expected output</span></div>
 <div class="line"><span class="lineno">  118</span>    assert(dynamic_programming::unbounded_knapsack::unboundedKnapsack(</div>
 <div class="line"><span class="lineno">  119</span>               N1, W1, val1, wt1) == 48);</div>
-<div class="line"><span class="lineno">  120</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value &quot;</span></div>
+<div class="line"><span class="lineno">  120</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value &quot;</span></div>
 <div class="line"><span class="lineno">  121</span>              &lt;&lt; <a class="code hl_function" href="#a1bcff7f76de48fa7f629480f8f18b5ef">dynamic_programming::unbounded_knapsack::unboundedKnapsack</a>(</div>
 <div class="line"><span class="lineno">  122</span>                     N1, W1, val1, wt1)</div>
-<div class="line"><span class="lineno">  123</span>              &lt;&lt; <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">  123</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  124</span> </div>
 <div class="line"><span class="lineno">  125</span>    <span class="comment">// Test Case 2</span></div>
-<div class="line"><span class="lineno">  126</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> N2 = 3;                              <span class="comment">// Number of items</span></div>
-<div class="line"><span class="lineno">  127</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint16_t&gt;</a> wt2 = {10, 20, 30};     <span class="comment">// Weights of the items</span></div>
-<div class="line"><span class="lineno">  128</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint16_t&gt;</a> val2 = {60, 100, 120};  <span class="comment">// Values of the items</span></div>
-<div class="line"><span class="lineno">  129</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> W2 = 5;  <span class="comment">// Maximum capacity of the knapsack</span></div>
+<div class="line"><span class="lineno">  126</span>    std::uint16_t N2 = 3;                              <span class="comment">// Number of items</span></div>
+<div class="line"><span class="lineno">  127</span>    std::vector&lt;std::uint16_t&gt; wt2 = {10, 20, 30};     <span class="comment">// Weights of the items</span></div>
+<div class="line"><span class="lineno">  128</span>    std::vector&lt;std::uint16_t&gt; val2 = {60, 100, 120};  <span class="comment">// Values of the items</span></div>
+<div class="line"><span class="lineno">  129</span>    std::uint16_t W2 = 5;  <span class="comment">// Maximum capacity of the knapsack</span></div>
 <div class="line"><span class="lineno">  130</span>    <span class="comment">// Test the function and assert the expected output</span></div>
 <div class="line"><span class="lineno">  131</span>    assert(dynamic_programming::unbounded_knapsack::unboundedKnapsack(</div>
 <div class="line"><span class="lineno">  132</span>               N2, W2, val2, wt2) == 0);</div>
-<div class="line"><span class="lineno">  133</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value &quot;</span></div>
+<div class="line"><span class="lineno">  133</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value &quot;</span></div>
 <div class="line"><span class="lineno">  134</span>              &lt;&lt; <a class="code hl_function" href="#a1bcff7f76de48fa7f629480f8f18b5ef">dynamic_programming::unbounded_knapsack::unboundedKnapsack</a>(</div>
 <div class="line"><span class="lineno">  135</span>                     N2, W2, val2, wt2)</div>
-<div class="line"><span class="lineno">  136</span>              &lt;&lt; <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">  136</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  137</span> </div>
 <div class="line"><span class="lineno">  138</span>    <span class="comment">// Test Case 3</span></div>
-<div class="line"><span class="lineno">  139</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> N3 = 3;                           <span class="comment">// Number of items</span></div>
-<div class="line"><span class="lineno">  140</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint16_t&gt;</a> wt3 = {2, 4, 6};     <span class="comment">// Weights of the items</span></div>
-<div class="line"><span class="lineno">  141</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint16_t&gt;</a> val3 = {5, 11, 13};  <span class="comment">// Values of the items</span></div>
-<div class="line"><span class="lineno">  142</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> W3 = 27;  <span class="comment">// Maximum capacity of the knapsack</span></div>
+<div class="line"><span class="lineno">  139</span>    std::uint16_t N3 = 3;                           <span class="comment">// Number of items</span></div>
+<div class="line"><span class="lineno">  140</span>    std::vector&lt;std::uint16_t&gt; wt3 = {2, 4, 6};     <span class="comment">// Weights of the items</span></div>
+<div class="line"><span class="lineno">  141</span>    std::vector&lt;std::uint16_t&gt; val3 = {5, 11, 13};  <span class="comment">// Values of the items</span></div>
+<div class="line"><span class="lineno">  142</span>    std::uint16_t W3 = 27;  <span class="comment">// Maximum capacity of the knapsack</span></div>
 <div class="line"><span class="lineno">  143</span>    <span class="comment">// Test the function and assert the expected output</span></div>
 <div class="line"><span class="lineno">  144</span>    assert(dynamic_programming::unbounded_knapsack::unboundedKnapsack(</div>
 <div class="line"><span class="lineno">  145</span>               N3, W3, val3, wt3) == 27);</div>
-<div class="line"><span class="lineno">  146</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value &quot;</span></div>
+<div class="line"><span class="lineno">  146</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value &quot;</span></div>
 <div class="line"><span class="lineno">  147</span>              &lt;&lt; <a class="code hl_function" href="#a1bcff7f76de48fa7f629480f8f18b5ef">dynamic_programming::unbounded_knapsack::unboundedKnapsack</a>(</div>
 <div class="line"><span class="lineno">  148</span>                     N3, W3, val3, wt3)</div>
-<div class="line"><span class="lineno">  149</span>              &lt;&lt; <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">  149</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  150</span> </div>
 <div class="line"><span class="lineno">  151</span>    <span class="comment">// Test Case 4</span></div>
-<div class="line"><span class="lineno">  152</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> N4 = 0;                  <span class="comment">// Number of items</span></div>
-<div class="line"><span class="lineno">  153</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint16_t&gt;</a> wt4 = {};   <span class="comment">// Weights of the items</span></div>
-<div class="line"><span class="lineno">  154</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint16_t&gt;</a> val4 = {};  <span class="comment">// Values of the items</span></div>
-<div class="line"><span class="lineno">  155</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> W4 = 10;                 <span class="comment">// Maximum capacity of the knapsack</span></div>
+<div class="line"><span class="lineno">  152</span>    std::uint16_t N4 = 0;                  <span class="comment">// Number of items</span></div>
+<div class="line"><span class="lineno">  153</span>    std::vector&lt;std::uint16_t&gt; wt4 = {};   <span class="comment">// Weights of the items</span></div>
+<div class="line"><span class="lineno">  154</span>    std::vector&lt;std::uint16_t&gt; val4 = {};  <span class="comment">// Values of the items</span></div>
+<div class="line"><span class="lineno">  155</span>    std::uint16_t W4 = 10;                 <span class="comment">// Maximum capacity of the knapsack</span></div>
 <div class="line"><span class="lineno">  156</span>    assert(dynamic_programming::unbounded_knapsack::unboundedKnapsack(</div>
 <div class="line"><span class="lineno">  157</span>               N4, W4, val4, wt4) == 0);</div>
-<div class="line"><span class="lineno">  158</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value for empty arrays: &quot;</span></div>
+<div class="line"><span class="lineno">  158</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value for empty arrays: &quot;</span></div>
 <div class="line"><span class="lineno">  159</span>              &lt;&lt; <a class="code hl_function" href="#a1bcff7f76de48fa7f629480f8f18b5ef">dynamic_programming::unbounded_knapsack::unboundedKnapsack</a>(</div>
 <div class="line"><span class="lineno">  160</span>                     N4, W4, val4, wt4)</div>
-<div class="line"><span class="lineno">  161</span>              &lt;&lt; <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">  161</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  162</span> </div>
-<div class="line"><span class="lineno">  163</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All test cases passed!&quot;</span> &lt;&lt; <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">  163</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  164</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="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="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a></div></div>
-<div class="ttc" id="aunbounded__0__1__knapsack_8cpp_html_a1bcff7f76de48fa7f629480f8f18b5ef"><div class="ttname"><a href="#a1bcff7f76de48fa7f629480f8f18b5ef">dynamic_programming::unbounded_knapsack::unboundedKnapsack</a></div><div class="ttdeci">std::uint16_t unboundedKnapsack(std::uint16_t N, std::uint16_t W, const std::vector&lt; std::uint16_t &gt; &amp;val, const std::vector&lt; std::uint16_t &gt; &amp;wt)</div><div class="ttdoc">Wrapper function to initiate the unbounded knapsack calculation.</div><div class="ttdef"><b>Definition</b> unbounded_0_1_knapsack.cpp:93</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dec/unbounded__0__1__knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="180" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aunbounded__0__1__knapsack_8cpp_html_a1bcff7f76de48fa7f629480f8f18b5ef"><div class="ttname"><a href="#a1bcff7f76de48fa7f629480f8f18b5ef">dynamic_programming::unbounded_knapsack::unboundedKnapsack</a></div><div class="ttdeci">std::uint16_t unboundedKnapsack(std::uint16_t N, std::uint16_t W, const std::vector&lt; std::uint16_t &gt; &amp;val, const std::vector&lt; std::uint16_t &gt; &amp;wt)</div><div class="ttdoc">Wrapper function to initiate the unbounded knapsack calculation.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dec/unbounded__0__1__knapsack_8cpp_source.html#l00093">unbounded_0_1_knapsack.cpp:93</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1bcff7f76de48fa7f629480f8f18b5ef" name="a1bcff7f76de48fa7f629480f8f18b5ef"></a>
@@ -378,24 +385,24 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> dynamic_programming::unbounded_knapsack::unboundedKnapsack </td>
+          <td class="memname">std::uint16_t dynamic_programming::unbounded_knapsack::unboundedKnapsack </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a></td>          <td class="paramname"><span class="paramname"><em>N</em></span>, </td>
+          <td class="paramtype">std::uint16_t</td>          <td class="paramname"><span class="paramname"><em>N</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a></td>          <td class="paramname"><span class="paramname"><em>W</em></span>, </td>
+          <td class="paramtype">std::uint16_t</td>          <td class="paramname"><span class="paramname"><em>W</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>val</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::uint16_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>val</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint16_t</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>wt</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; std::uint16_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>wt</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -411,19 +418,16 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The maximum value that can be obtained for the given capacity. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dec/unbounded__0__1__knapsack_8cpp_source.html#l00093">93</a> of file <a class="el" href="../../d9/dec/unbounded__0__1__knapsack_8cpp_source.html">unbounded_0_1_knapsack.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   95</span>                                                                  {</div>
 <div class="line"><span class="lineno">   96</span>    <span class="keywordflow">if</span> (N == 0)</div>
 <div class="line"><span class="lineno">   97</span>        <span class="keywordflow">return</span> 0;  <span class="comment">// Expect 0 since no items</span></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&lt;std::vector&lt;int&gt;</a>&gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(</div>
-<div class="line"><span class="lineno">   99</span>        N, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(W + 1, -1));  <span class="comment">// Initialize memoization table</span></div>
+<div class="line"><span class="lineno">   98</span>    std::vector&lt;std::vector&lt;int&gt;&gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(</div>
+<div class="line"><span class="lineno">   99</span>        N, std::vector&lt;int&gt;(W + 1, -1));  <span class="comment">// Initialize memoization table</span></div>
 <div class="line"><span class="lineno">  100</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="#afe447a5979582174908695952c8a079c">KnapSackFilling</a>(N - 1, W, val, wt, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);  <span class="comment">// Start the calculation</span></div>
 <div class="line"><span class="lineno">  101</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.svg" width="490" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.map b/d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.map
deleted file mode 100644
index 6e36ba40b..000000000
--- a/d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="dynamic_programming::unbounded_knapsack::unboundedKnapsack" name="dynamic_programming::unbounded_knapsack::unboundedKnapsack">
-<area shape="rect" id="Node000001" title="Wrapper function to initiate the unbounded knapsack calculation." alt="" coords="5,29,161,85"/>
-<area shape="poly" id="edge4_Node000001_Node000001" title=" " alt="" coords="43,29,43,19,51,10,64,5,83,3,105,5,118,12,115,17,103,10,83,8,65,10,54,15,48,21,48,29"/>
-<area shape="rect" id="Node000002" href="$d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c" title="Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach." alt="" coords="209,29,364,85"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="161,54,193,54,193,60,161,60"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="254,29,254,19,260,10,271,5,286,3,303,5,314,12,311,16,302,10,286,8,272,10,264,14,259,21,259,29"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="412,44,484,70"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="364,54,396,54,396,60,364,60"/>
-</map>
diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.md5 b/d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.md5
deleted file mode 100644
index b66d8f293..000000000
--- a/d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2ea70cc9a7326aa2107dae6f120e7207
\ No newline at end of file
diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.svg b/d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.svg
deleted file mode 100644
index c30a9ddf2..000000000
--- a/d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph.svg
+++ /dev/null
@@ -1,105 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::unbounded_knapsack::unboundedKnapsack Pages: 1 -->
-<svg width="367pt" height="68pt"
- viewBox="0.00 0.00 367.25 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>dynamic_programming::unbounded_knapsack::unboundedKnapsack</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Wrapper function to initiate the unbounded knapsack calculation.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-41.75 0,-41.75 0,0 116.5,0 116.5,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::unbounded_knapsack</text>
-<text text-anchor="middle" x="58.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::unboundedKnapsack</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.1,-42.07C27.42,-51.55 36.8,-59.75 58.25,-59.75 70.65,-59.75 79.01,-57.01 83.35,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.64,-54.1 85.99,-43.52 79.9,-52.2 86.64,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c" target="_top" xlink:title="Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.">
-<polygon fill="white" stroke="#666666" points="269,-41.75 152.5,-41.75 152.5,0 269,0 269,-41.75"/>
-<text text-anchor="start" x="160.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="start" x="160.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::unbounded_knapsack</text>
-<text text-anchor="middle" x="210.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::KnapSackFilling</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.58,-20.88C124.48,-20.88 132.67,-20.88 140.75,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.57,-24.38 150.57,-20.88 140.57,-17.38 140.57,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.35,-42.07C186.21,-51.55 193.68,-59.75 210.75,-59.75 220.35,-59.75 226.91,-57.16 230.44,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.83,-54.08 232.79,-43.54 227.03,-52.43 233.83,-54.08"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="359.25,-30.5 305,-30.5 305,-11.25 359.25,-11.25 359.25,-30.5"/>
-<text text-anchor="middle" x="332.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M269.34,-20.88C277.48,-20.88 285.67,-20.88 293.3,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.25,-24.38 303.25,-20.88 293.25,-17.38 293.25,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph_org.svg b/d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph_org.svg
deleted file mode 100644
index 7e215eb74..000000000
--- a/d9/dec/unbounded__0__1__knapsack_8cpp_a1bcff7f76de48fa7f629480f8f18b5ef_cgraph_org.svg
+++ /dev/null
@@ -1,79 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::unbounded_knapsack::unboundedKnapsack Pages: 1 -->
-<svg width="367pt" height="68pt"
- viewBox="0.00 0.00 367.25 67.75" 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 63.75)">
-<title>dynamic_programming::unbounded_knapsack::unboundedKnapsack</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Wrapper function to initiate the unbounded knapsack calculation.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-41.75 0,-41.75 0,0 116.5,0 116.5,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::unbounded_knapsack</text>
-<text text-anchor="middle" x="58.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::unboundedKnapsack</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.1,-42.07C27.42,-51.55 36.8,-59.75 58.25,-59.75 70.65,-59.75 79.01,-57.01 83.35,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.64,-54.1 85.99,-43.52 79.9,-52.2 86.64,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c" target="_top" xlink:title="Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.">
-<polygon fill="white" stroke="#666666" points="269,-41.75 152.5,-41.75 152.5,0 269,0 269,-41.75"/>
-<text text-anchor="start" x="160.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="start" x="160.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::unbounded_knapsack</text>
-<text text-anchor="middle" x="210.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::KnapSackFilling</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.58,-20.88C124.48,-20.88 132.67,-20.88 140.75,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.57,-24.38 150.57,-20.88 140.57,-17.38 140.57,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.35,-42.07C186.21,-51.55 193.68,-59.75 210.75,-59.75 220.35,-59.75 226.91,-57.16 230.44,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.83,-54.08 232.79,-43.54 227.03,-52.43 233.83,-54.08"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="359.25,-30.5 305,-30.5 305,-11.25 359.25,-11.25 359.25,-30.5"/>
-<text text-anchor="middle" x="332.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M269.34,-20.88C277.48,-20.88 285.67,-20.88 293.3,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.25,-24.38 303.25,-20.88 293.25,-17.38 293.25,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/d9/dec/unbounded__0__1__knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index 055db682b..000000000
--- a/d9/dec/unbounded__0__1__knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="self test implementation" alt="" coords="5,5,56,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="104,5,175,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,16,88,16,88,21,56,21"/>
-</map>
diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/d9/dec/unbounded__0__1__knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index d839b38cd..000000000
--- a/d9/dec/unbounded__0__1__knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3f7143541dfbea83ed597655d04aca76
\ No newline at end of file
diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/d9/dec/unbounded__0__1__knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index a5ceda360..000000000
--- a/d9/dec/unbounded__0__1__knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 135.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="self test implementation">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-19.25 73.75,-19.25 73.75,0 127.25,0 127.25,-19.25"/>
-<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.14,-9.62 53.69,-9.62 62.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.84,-13.13 71.83,-9.63 61.83,-6.13 61.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/d9/dec/unbounded__0__1__knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index da3bbee87..000000000
--- a/d9/dec/unbounded__0__1__knapsack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 135.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="self test implementation">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-19.25 73.75,-19.25 73.75,0 127.25,0 127.25,-19.25"/>
-<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.14,-9.62 53.69,-9.62 62.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.84,-13.13 71.83,-9.63 61.83,-6.13 61.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index fa4375fe4..000000000
--- a/d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="main function" alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="self test implementation" alt="" coords="103,5,153,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,88,16,88,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="201,5,272,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,16,185,16,185,21,153,21"/>
-</map>
diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index f6f66b098..000000000
--- a/d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c409a1a966c43cec22ad0eeaf0d32ac0
\ No newline at end of file
diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 023b5a468..000000000
--- a/d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="208pt" height="27pt"
- viewBox="0.00 0.00 208.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="self test implementation">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-9.62C44.55,-9.62 53.37,-9.62 61.69,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-13.13 71.43,-9.63 61.43,-6.13 61.43,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.25,-19.25 146.75,-19.25 146.75,0 200.25,0 200.25,-19.25"/>
-<text text-anchor="middle" x="173.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.94,-9.62C118.14,-9.62 126.69,-9.62 135.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.84,-13.13 144.83,-9.63 134.83,-6.13 134.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 384adff5d..000000000
--- a/d9/dec/unbounded__0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="208pt" height="27pt"
- viewBox="0.00 0.00 208.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="self test implementation">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-9.62C44.55,-9.62 53.37,-9.62 61.69,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-13.13 71.43,-9.63 61.43,-6.13 61.43,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.25,-19.25 146.75,-19.25 146.75,0 200.25,0 200.25,-19.25"/>
-<text text-anchor="middle" x="173.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.94,-9.62C118.14,-9.62 126.69,-9.62 135.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.84,-13.13 144.83,-9.63 134.83,-6.13 134.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.map b/d9/dec/unbounded__0__1__knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.map
deleted file mode 100644
index 0d1c61feb..000000000
--- a/d9/dec/unbounded__0__1__knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="dynamic_programming::unbounded_knapsack::KnapSackFilling" name="dynamic_programming::unbounded_knapsack::KnapSackFilling">
-<area shape="rect" id="Node000001" title="Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach." alt="" coords="5,29,161,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="50,29,51,19,57,10,68,5,83,3,100,5,111,12,108,16,98,10,83,8,69,10,60,14,56,21,56,29"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="209,44,281,70"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="161,54,193,54,193,60,161,60"/>
-</map>
diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.md5 b/d9/dec/unbounded__0__1__knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.md5
deleted file mode 100644
index 5e2afbee1..000000000
--- a/d9/dec/unbounded__0__1__knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8aff1469cd7bc4ca5af477bfb3eef1a3
\ No newline at end of file
diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.svg b/d9/dec/unbounded__0__1__knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.svg
deleted file mode 100644
index 83c7de1ea..000000000
--- a/d9/dec/unbounded__0__1__knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::unbounded_knapsack::KnapSackFilling Pages: 1 -->
-<svg width="215pt" height="68pt"
- viewBox="0.00 0.00 214.75 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>dynamic_programming::unbounded_knapsack::KnapSackFilling</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-41.75 0,-41.75 0,0 116.5,0 116.5,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::unbounded_knapsack</text>
-<text text-anchor="middle" x="58.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::KnapSackFilling</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.85,-42.07C33.71,-51.55 41.18,-59.75 58.25,-59.75 67.85,-59.75 74.41,-57.16 77.94,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.33,-54.08 80.29,-43.54 74.53,-52.43 81.33,-54.08"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="206.75,-30.5 152.5,-30.5 152.5,-11.25 206.75,-11.25 206.75,-30.5"/>
-<text text-anchor="middle" x="179.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.84,-20.88C124.98,-20.88 133.17,-20.88 140.8,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.75,-24.38 150.75,-20.88 140.75,-17.38 140.75,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph_org.svg b/d9/dec/unbounded__0__1__knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph_org.svg
deleted file mode 100644
index cf654eff0..000000000
--- a/d9/dec/unbounded__0__1__knapsack_8cpp_afe447a5979582174908695952c8a079c_cgraph_org.svg
+++ /dev/null
@@ -1,50 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::unbounded_knapsack::KnapSackFilling Pages: 1 -->
-<svg width="215pt" height="68pt"
- viewBox="0.00 0.00 214.75 67.75" 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 63.75)">
-<title>dynamic_programming::unbounded_knapsack::KnapSackFilling</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-41.75 0,-41.75 0,0 116.5,0 116.5,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::unbounded_knapsack</text>
-<text text-anchor="middle" x="58.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::KnapSackFilling</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.85,-42.07C33.71,-51.55 41.18,-59.75 58.25,-59.75 67.85,-59.75 74.41,-57.16 77.94,-53.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.33,-54.08 80.29,-43.54 74.53,-52.43 81.33,-54.08"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="206.75,-30.5 152.5,-30.5 152.5,-11.25 206.75,-11.25 206.75,-30.5"/>
-<text text-anchor="middle" x="179.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.84,-20.88C124.98,-20.88 133.17,-20.88 140.8,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.75,-24.38 150.75,-20.88 140.75,-17.38 140.75,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dec/unbounded__0__1__knapsack_8cpp_source.html b/d9/dec/unbounded__0__1__knapsack_8cpp_source.html
new file mode 100644
index 000000000..1501c03e5
--- /dev/null
+++ b/d9/dec/unbounded__0__1__knapsack_8cpp_source.html
@@ -0,0 +1,260 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/unbounded_0_1_knapsack.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/dec/unbounded__0__1__knapsack_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">unbounded_0_1_knapsack.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;cassert&gt;</span>   <span class="comment">// For using assert function to validate test cases</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;cstdint&gt;</span>   <span class="comment">// For fixed-width integer types like std::uint16_t</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;iostream&gt;</span>  <span class="comment">// Standard input-output stream</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;vector&gt;</span>    <span class="comment">// Standard library for using dynamic arrays (vectors)</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a> {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="keyword">namespace </span>unbounded_knapsack {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="foldopen" id="foldopen00058" data-start="{" data-end="}">
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c">   58</a></span>std::uint16_t <a class="code hl_function" href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c">KnapSackFilling</a>(std::uint16_t i, std::uint16_t W,</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>                              <span class="keyword">const</span> std::vector&lt;std::uint16_t&gt;&amp; val,</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>                              <span class="keyword">const</span> std::vector&lt;std::uint16_t&gt;&amp; wt,</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>                              std::vector&lt;std::vector&lt;int&gt;&gt;&amp; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordflow">if</span> (i == 0) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">if</span> (wt[0] &lt;= W) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            <span class="keywordflow">return</span> (W / wt[0]) *</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>                   val[0];  <span class="comment">// Take as many of the first item as possible</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            <span class="keywordflow">return</span> 0;  <span class="comment">// Can&#39;t take the first item</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keywordflow">if</span> (<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][W] != -1)</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][W];  <span class="comment">// Return result if available</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordtype">int</span> nottake =</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        <a class="code hl_function" href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c">KnapSackFilling</a>(i - 1, W, val, wt, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);  <span class="comment">// Value without taking item i</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="keywordtype">int</span> take = 0;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keywordflow">if</span> (W &gt;= wt[i]) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        take = val[i] + <a class="code hl_function" href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c">KnapSackFilling</a>(i, W - wt[i], val, wt,</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>                                        <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);  <span class="comment">// Value taking item i</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][W] =</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>               std::max(take, nottake);  <span class="comment">// Store and return the maximum value</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>}</div>
+</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="foldopen" id="foldopen00093" data-start="{" data-end="}">
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"><a class="line" href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef">   93</a></span>std::uint16_t <a class="code hl_function" href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef">unboundedKnapsack</a>(std::uint16_t N, std::uint16_t W,</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>                                <span class="keyword">const</span> std::vector&lt;std::uint16_t&gt;&amp; val,</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>                                <span class="keyword">const</span> std::vector&lt;std::uint16_t&gt;&amp; wt) {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="keywordflow">if</span> (N == 0)</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        <span class="keywordflow">return</span> 0;  <span class="comment">// Expect 0 since no items</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    std::vector&lt;std::vector&lt;int&gt;&gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        N, std::vector&lt;int&gt;(W + 1, -1));  <span class="comment">// Initialize memoization table</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c">KnapSackFilling</a>(N - 1, W, val, wt, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);  <span class="comment">// Start the calculation</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>}</div>
+</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>}  <span class="comment">// namespace unbounded_knapsack</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>}  <span class="comment">// namespace dynamic_programming</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="foldopen" id="foldopen00111" data-start="{" data-end="}">
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"><a class="line" href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">  111</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="comment">// Test Case 1</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    std::uint16_t N1 = 4;                            <span class="comment">// Number of items</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::vector&lt;std::uint16_t&gt; wt1 = {1, 3, 4, 5};   <span class="comment">// Weights of the items</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    std::vector&lt;std::uint16_t&gt; val1 = {6, 1, 7, 7};  <span class="comment">// Values of the items</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::uint16_t W1 = 8;  <span class="comment">// Maximum capacity of the knapsack</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="comment">// Test the function and assert the expected output</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    assert(dynamic_programming::unbounded_knapsack::unboundedKnapsack(</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>               N1, W1, val1, wt1) == 48);</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value &quot;</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>              &lt;&lt; dynamic_programming::unbounded_knapsack::unboundedKnapsack(</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>                     N1, W1, val1, wt1)</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    <span class="comment">// Test Case 2</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    std::uint16_t N2 = 3;                              <span class="comment">// Number of items</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    std::vector&lt;std::uint16_t&gt; wt2 = {10, 20, 30};     <span class="comment">// Weights of the items</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    std::vector&lt;std::uint16_t&gt; val2 = {60, 100, 120};  <span class="comment">// Values of the items</span></div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    std::uint16_t W2 = 5;  <span class="comment">// Maximum capacity of the knapsack</span></div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="comment">// Test the function and assert the expected output</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    assert(dynamic_programming::unbounded_knapsack::unboundedKnapsack(</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>               N2, W2, val2, wt2) == 0);</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value &quot;</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>              &lt;&lt; dynamic_programming::unbounded_knapsack::unboundedKnapsack(</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>                     N2, W2, val2, wt2)</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span> </div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <span class="comment">// Test Case 3</span></div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    std::uint16_t N3 = 3;                           <span class="comment">// Number of items</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    std::vector&lt;std::uint16_t&gt; wt3 = {2, 4, 6};     <span class="comment">// Weights of the items</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    std::vector&lt;std::uint16_t&gt; val3 = {5, 11, 13};  <span class="comment">// Values of the items</span></div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    std::uint16_t W3 = 27;  <span class="comment">// Maximum capacity of the knapsack</span></div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <span class="comment">// Test the function and assert the expected output</span></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    assert(dynamic_programming::unbounded_knapsack::unboundedKnapsack(</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>               N3, W3, val3, wt3) == 27);</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value &quot;</span></div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>              &lt;&lt; dynamic_programming::unbounded_knapsack::unboundedKnapsack(</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>                     N3, W3, val3, wt3)</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    <span class="comment">// Test Case 4</span></div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    std::uint16_t N4 = 0;                  <span class="comment">// Number of items</span></div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    std::vector&lt;std::uint16_t&gt; wt4 = {};   <span class="comment">// Weights of the items</span></div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    std::vector&lt;std::uint16_t&gt; val4 = {};  <span class="comment">// Values of the items</span></div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    std::uint16_t W4 = 10;                 <span class="comment">// Maximum capacity of the knapsack</span></div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    assert(dynamic_programming::unbounded_knapsack::unboundedKnapsack(</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>               N4, W4, val4, wt4) == 0);</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value for empty arrays: &quot;</span></div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>              &lt;&lt; dynamic_programming::unbounded_knapsack::unboundedKnapsack(</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>                     N4, W4, val4, wt4)</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span> </div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>}</div>
+</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span> </div>
+<div class="foldopen" id="foldopen00170" data-start="{" data-end="}">
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"><a class="line" href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  170</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    <a class="code hl_function" href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// Run self test implementation</span></div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>}</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> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></div>
+<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
+<div class="ttc" id="aunbounded__0__1__knapsack_8cpp_html_a1bcff7f76de48fa7f629480f8f18b5ef"><div class="ttname"><a href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef">dynamic_programming::unbounded_knapsack::unboundedKnapsack</a></div><div class="ttdeci">std::uint16_t unboundedKnapsack(std::uint16_t N, std::uint16_t W, const std::vector&lt; std::uint16_t &gt; &amp;val, const std::vector&lt; std::uint16_t &gt; &amp;wt)</div><div class="ttdoc">Wrapper function to initiate the unbounded knapsack calculation.</div><div class="ttdef"><b>Definition</b> <a href="#l00093">unbounded_0_1_knapsack.cpp:93</a></div></div>
+<div class="ttc" id="aunbounded__0__1__knapsack_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">self test implementation</div><div class="ttdef"><b>Definition</b> <a href="#l00111">unbounded_0_1_knapsack.cpp:111</a></div></div>
+<div class="ttc" id="aunbounded__0__1__knapsack_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition</b> <a href="#l00170">unbounded_0_1_knapsack.cpp:170</a></div></div>
+<div class="ttc" id="aunbounded__0__1__knapsack_8cpp_html_afe447a5979582174908695952c8a079c"><div class="ttname"><a href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c">dynamic_programming::unbounded_knapsack::KnapSackFilling</a></div><div class="ttdeci">std::uint16_t KnapSackFilling(std::uint16_t i, std::uint16_t W, const std::vector&lt; std::uint16_t &gt; &amp;val, const std::vector&lt; std::uint16_t &gt; &amp;wt, std::vector&lt; std::vector&lt; int &gt; &gt; &amp;dp)</div><div class="ttdoc">Recursive function to calculate the maximum value obtainable using an unbounded knapsack approach.</div><div class="ttdef"><b>Definition</b> <a href="#l00058">unbounded_0_1_knapsack.cpp:58</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../d9/dec/unbounded__0__1__knapsack_8cpp.html">unbounded_0_1_knapsack.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/dee/classdouble__linked__list.html b/d9/dee/classdouble__linked__list.html
index 12e71a01b..26c296027 100644
--- a/d9/dee/classdouble__linked__list.html
+++ b/d9/dee/classdouble__linked__list.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: double_linked_list Class Reference</title>
+<title>TheAlgorithms/C++: double_linked_list Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,10 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:a0525cf734dfd9cd399f3c8d0df138dce" id="r_a0525cf734dfd9cd399f3c8d0df138dce"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0525cf734dfd9cd399f3c8d0df138dce">reverseShow</a> ()</td></tr>
 <tr class="separator:a0525cf734dfd9cd399f3c8d0df138dce"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
-<h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../d7/d85/doubly__linked__list_8cpp_source.html#l00011">11</a> of file <a class="el" href="../../d7/d85/doubly__linked__list_8cpp_source.html">doubly_linked_list.cpp</a>.</p>
+</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a999c63fbdcc64f1fd367282d417a991e" name="a999c63fbdcc64f1fd367282d417a991e"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a999c63fbdcc64f1fd367282d417a991e">&#9670;&#160;</a></span>double_linked_list()</h2>
 
@@ -147,6 +167,8 @@ Public Member Functions</h2></td></tr>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d85/doubly__linked__list_8cpp_source.html#l00013">13</a> of file <a class="el" href="../../d7/d85/doubly__linked__list_8cpp_source.html">doubly_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   13</span>{ start = NULL; }</div>
 </div><!-- fragment -->
 </div>
@@ -166,6 +188,8 @@ Public Member Functions</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d85/doubly__linked__list_8cpp_source.html#l00021">21</a> of file <a class="el" href="../../d7/d85/doubly__linked__list_8cpp_source.html">doubly_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   21</span>                                     {</div>
 <div class="line"><span class="lineno">   22</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = start;</div>
 <div class="line"><span class="lineno">   23</span>    <span class="keywordflow">if</span> (start != NULL) {</div>
@@ -185,8 +209,8 @@ Public Member Functions</h2></td></tr>
 <div class="line"><span class="lineno">   37</span>        start = n;</div>
 <div class="line"><span class="lineno">   38</span>    }</div>
 <div class="line"><span class="lineno">   39</span>}</div>
-<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -204,6 +228,8 @@ Public Member Functions</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d85/doubly__linked__list_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../d7/d85/doubly__linked__list_8cpp_source.html">doubly_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   41</span>                                     {</div>
 <div class="line"><span class="lineno">   42</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = start;</div>
 <div class="line"><span class="lineno">   43</span>    <span class="keywordflow">while</span> (t != NULL &amp;&amp; t-&gt;val != x) {</div>
@@ -244,17 +270,18 @@ Public Member Functions</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d85/doubly__linked__list_8cpp_source.html#l00089">89</a> of file <a class="el" href="../../d7/d85/doubly__linked__list_8cpp_source.html">doubly_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   89</span>                                     {</div>
 <div class="line"><span class="lineno">   90</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = start;</div>
 <div class="line"><span class="lineno">   91</span>    <span class="keywordflow">while</span> (t != NULL &amp;&amp; t-&gt;next != NULL) {</div>
 <div class="line"><span class="lineno">   92</span>        t = t-&gt;next;</div>
 <div class="line"><span class="lineno">   93</span>    }</div>
 <div class="line"><span class="lineno">   94</span>    <span class="keywordflow">while</span> (t != NULL) {</div>
-<div class="line"><span class="lineno">   95</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; t-&gt;val &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><span class="lineno">   95</span>        std::cout &lt;&lt; t-&gt;val &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
 <div class="line"><span class="lineno">   96</span>        t = t-&gt;prev;</div>
 <div class="line"><span class="lineno">   97</span>    }</div>
 <div class="line"><span class="lineno">   98</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><!-- fragment -->
 </div>
 </div>
@@ -272,19 +299,21 @@ Public Member Functions</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d85/doubly__linked__list_8cpp_source.html#l00065">65</a> of file <a class="el" href="../../d7/d85/doubly__linked__list_8cpp_source.html">doubly_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   65</span>                                     {</div>
 <div class="line"><span class="lineno">   66</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = start;</div>
 <div class="line"><span class="lineno">   67</span>    <span class="keywordtype">int</span> found = 0;</div>
 <div class="line"><span class="lineno">   68</span>    <span class="keywordflow">while</span> (t != NULL) {</div>
 <div class="line"><span class="lineno">   69</span>        <span class="keywordflow">if</span> (t-&gt;val == x) {</div>
-<div class="line"><span class="lineno">   70</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nFound&quot;</span>;</div>
+<div class="line"><span class="lineno">   70</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nFound&quot;</span>;</div>
 <div class="line"><span class="lineno">   71</span>            found = 1;</div>
 <div class="line"><span class="lineno">   72</span>            <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">   73</span>        }</div>
 <div class="line"><span class="lineno">   74</span>        t = t-&gt;next;</div>
 <div class="line"><span class="lineno">   75</span>    }</div>
 <div class="line"><span class="lineno">   76</span>    <span class="keywordflow">if</span> (found == 0) {</div>
-<div class="line"><span class="lineno">   77</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nNot Found&quot;</span>;</div>
+<div class="line"><span class="lineno">   77</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nNot Found&quot;</span>;</div>
 <div class="line"><span class="lineno">   78</span>    }</div>
 <div class="line"><span class="lineno">   79</span>}</div>
 </div><!-- fragment -->
@@ -304,10 +333,12 @@ Public Member Functions</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d85/doubly__linked__list_8cpp_source.html#l00081">81</a> of file <a class="el" href="../../d7/d85/doubly__linked__list_8cpp_source.html">doubly_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   81</span>                              {</div>
 <div class="line"><span class="lineno">   82</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = start;</div>
 <div class="line"><span class="lineno">   83</span>    <span class="keywordflow">while</span> (t != NULL) {</div>
-<div class="line"><span class="lineno">   84</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; t-&gt;val &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><span class="lineno">   84</span>        std::cout &lt;&lt; t-&gt;val &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
 <div class="line"><span class="lineno">   85</span>        t = t-&gt;next;</div>
 <div class="line"><span class="lineno">   86</span>    }</div>
 <div class="line"><span class="lineno">   87</span>}</div>
@@ -315,7 +346,7 @@ Public Member Functions</h2></td></tr>
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>data_structures/<b>doubly_linked_list.cpp</b></li>
+<li>data_structures/<a class="el" href="../../d7/d85/doubly__linked__list_8cpp_source.html">doubly_linked_list.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d9/def/namespacesublist__search.html b/d9/def/namespacesublist__search.html
index 8304ebb82..7256aed09 100644
--- a/d9/def/namespacesublist__search.html
+++ b/d9/def/namespacesublist__search.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sublist_search Namespace Reference</title>
+<title>TheAlgorithms/C++: sublist_search Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/d9/df0/fast__integer__input_8cpp.html b/d9/df0/fast__integer__input_8cpp.html
index f9b828528..4752e1e4c 100644
--- a/d9/df0/fast__integer__input_8cpp.html
+++ b/d9/df0/fast__integer__input_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/fast_integer_input.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/fast_integer_input.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,7 +135,9 @@ Include dependency graph for fast_integer_input.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d40/fast__integer__input_8cpp__incl.svg" width="140" height="126"><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">
+</div>
+<p><a href="../../d9/df0/fast__integer__input_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a4e097ac8509b717bdc8ab09ecd86ae82" id="r_a4e097ac8509b717bdc8ab09ecd86ae82"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4e097ac8509b717bdc8ab09ecd86ae82">fastinput</a> (int *number)</td></tr>
@@ -128,6 +147,8 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Read integers from stdin continuously as they are entered without waiting for the <code>\n</code> character. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/df0/fast__integer__input_8cpp_source.html">fast_integer_input.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a4e097ac8509b717bdc8ab09ecd86ae82" name="a4e097ac8509b717bdc8ab09ecd86ae82"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a4e097ac8509b717bdc8ab09ecd86ae82">&#9670;&#160;</a></span>fastinput()</h2>
@@ -144,6 +165,8 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Function to read the number from stdin. The function reads input until a non numeric character is entered. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/df0/fast__integer__input_8cpp_source.html#l00011">11</a> of file <a class="el" href="../../d9/df0/fast__integer__input_8cpp_source.html">fast_integer_input.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   11</span>                            {</div>
 <div class="line"><span class="lineno">   12</span>    <span class="comment">// variable to indicate sign of input integer</span></div>
 <div class="line"><span class="lineno">   13</span>    <span class="keywordtype">bool</span> negative = <span class="keyword">false</span>;</div>
@@ -151,18 +174,18 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   15</span>    *number = 0;</div>
 <div class="line"><span class="lineno">   16</span> </div>
 <div class="line"><span class="lineno">   17</span>    <span class="comment">// extract current character from buffer</span></div>
-<div class="line"><span class="lineno">   18</span>    c = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/getchar.html">std::getchar</a>();</div>
+<div class="line"><span class="lineno">   18</span>    c = std::getchar();</div>
 <div class="line"><span class="lineno">   19</span>    <span class="keywordflow">if</span> (c == <span class="charliteral">&#39;-&#39;</span>) {</div>
 <div class="line"><span class="lineno">   20</span>        <span class="comment">// number is negative</span></div>
 <div class="line"><span class="lineno">   21</span>        negative = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   22</span> </div>
 <div class="line"><span class="lineno">   23</span>        <span class="comment">// extract the next character from the buffer</span></div>
-<div class="line"><span class="lineno">   24</span>        c = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/getchar.html">std::getchar</a>();</div>
+<div class="line"><span class="lineno">   24</span>        c = std::getchar();</div>
 <div class="line"><span class="lineno">   25</span>    }</div>
 <div class="line"><span class="lineno">   26</span> </div>
 <div class="line"><span class="lineno">   27</span>    <span class="comment">// Keep on extracting characters if they are integers</span></div>
 <div class="line"><span class="lineno">   28</span>    <span class="comment">// i.e ASCII Value lies from &#39;0&#39;(48) to &#39;9&#39; (57)</span></div>
-<div class="line"><span class="lineno">   29</span>    <span class="keywordflow">for</span> (; (c &gt; 47 &amp;&amp; c &lt; 58); c = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/getchar.html">std::getchar</a>())</div>
+<div class="line"><span class="lineno">   29</span>    <span class="keywordflow">for</span> (; (c &gt; 47 &amp;&amp; c &lt; 58); c = std::getchar())</div>
 <div class="line"><span class="lineno">   30</span>        *number = *number * 10 + c - 48;</div>
 <div class="line"><span class="lineno">   31</span> </div>
 <div class="line"><span class="lineno">   32</span>    <span class="comment">// if scanned input has a negative sign, negate the</span></div>
@@ -170,13 +193,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   34</span>    <span class="keywordflow">if</span> (negative)</div>
 <div class="line"><span class="lineno">   35</span>        *(number) *= -1;</div>
 <div class="line"><span class="lineno">   36</span>}</div>
-<div class="ttc" id="agetchar_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/c/getchar.html">std::getchar</a></div><div class="ttdeci">T getchar(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/df0/fast__integer__input_8cpp_a4e097ac8509b717bdc8ab09ecd86ae82_cgraph.svg" width="220" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -194,21 +211,16 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/df0/fast__integer__input_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../d9/df0/fast__integer__input_8cpp_source.html">fast_integer_input.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   39</span>           {</div>
 <div class="line"><span class="lineno">   40</span>    <span class="keywordtype">int</span> number;</div>
 <div class="line"><span class="lineno">   41</span>    <a class="code hl_function" href="#a4e097ac8509b717bdc8ab09ecd86ae82">fastinput</a>(&amp;number);</div>
-<div class="line"><span class="lineno">   42</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; number &lt;&lt; <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">   42</span>    std::cout &lt;&lt; number &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   43</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   44</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="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="afast__integer__input_8cpp_html_a4e097ac8509b717bdc8ab09ecd86ae82"><div class="ttname"><a href="#a4e097ac8509b717bdc8ab09ecd86ae82">fastinput</a></div><div class="ttdeci">void fastinput(int *number)</div><div class="ttdef"><b>Definition</b> fast_integer_input.cpp:11</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/df0/fast__integer__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="318" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afast__integer__input_8cpp_html_a4e097ac8509b717bdc8ab09ecd86ae82"><div class="ttname"><a href="#a4e097ac8509b717bdc8ab09ecd86ae82">fastinput</a></div><div class="ttdeci">void fastinput(int *number)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/df0/fast__integer__input_8cpp_source.html#l00011">fast_integer_input.cpp:11</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/df0/fast__integer__input_8cpp_a4e097ac8509b717bdc8ab09ecd86ae82_cgraph.map b/d9/df0/fast__integer__input_8cpp_a4e097ac8509b717bdc8ab09ecd86ae82_cgraph.map
deleted file mode 100644
index f365c26de..000000000
--- a/d9/df0/fast__integer__input_8cpp_a4e097ac8509b717bdc8ab09ecd86ae82_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="fastinput" name="fastinput">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,77,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/c/getchar.html#" title=" " alt="" coords="125,5,215,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="77,16,109,16,109,21,77,21"/>
-</map>
diff --git a/d9/df0/fast__integer__input_8cpp_a4e097ac8509b717bdc8ab09ecd86ae82_cgraph.md5 b/d9/df0/fast__integer__input_8cpp_a4e097ac8509b717bdc8ab09ecd86ae82_cgraph.md5
deleted file mode 100644
index 102712e5a..000000000
--- a/d9/df0/fast__integer__input_8cpp_a4e097ac8509b717bdc8ab09ecd86ae82_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d2341f2fa5df99a5903201d51df122a4
\ No newline at end of file
diff --git a/d9/df0/fast__integer__input_8cpp_a4e097ac8509b717bdc8ab09ecd86ae82_cgraph.svg b/d9/df0/fast__integer__input_8cpp_a4e097ac8509b717bdc8ab09ecd86ae82_cgraph.svg
deleted file mode 100644
index 9ce35961c..000000000
--- a/d9/df0/fast__integer__input_8cpp_a4e097ac8509b717bdc8ab09ecd86ae82_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: fastinput Pages: 1 -->
-<svg width="165pt" height="27pt"
- viewBox="0.00 0.00 165.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>fastinput</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
-<text text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fastinput</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/getchar.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="157.25,-19.25 89.5,-19.25 89.5,0 157.25,0 157.25,-19.25"/>
-<text text-anchor="middle" x="123.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getchar</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.86,-9.62C61.29,-9.62 69.61,-9.62 77.82,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.73,-13.13 87.73,-9.63 77.73,-6.13 77.73,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/df0/fast__integer__input_8cpp_a4e097ac8509b717bdc8ab09ecd86ae82_cgraph_org.svg b/d9/df0/fast__integer__input_8cpp_a4e097ac8509b717bdc8ab09ecd86ae82_cgraph_org.svg
deleted file mode 100644
index 70db42c3f..000000000
--- a/d9/df0/fast__integer__input_8cpp_a4e097ac8509b717bdc8ab09ecd86ae82_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: fastinput Pages: 1 -->
-<svg width="165pt" height="27pt"
- viewBox="0.00 0.00 165.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>fastinput</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
-<text text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fastinput</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/getchar.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="157.25,-19.25 89.5,-19.25 89.5,0 157.25,0 157.25,-19.25"/>
-<text text-anchor="middle" x="123.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getchar</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.86,-9.62C61.29,-9.62 69.61,-9.62 77.82,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.73,-13.13 87.73,-9.63 77.73,-6.13 77.73,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/df0/fast__integer__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/df0/fast__integer__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index b91bafd33..000000000
--- a/d9/df0/fast__integer__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,35,87,27,88,33,56,40"/>
-<area shape="rect" id="Node000003" href="$d9/df0/fast__integer__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82" title=" " alt="" coords="103,55,174,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,46,88,54,87,59,55,52"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/c/getchar.html#" title=" " alt="" coords="222,55,312,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="174,65,206,65,206,70,174,70"/>
-</map>
diff --git a/d9/df0/fast__integer__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/df0/fast__integer__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 883159d57..000000000
--- a/d9/df0/fast__integer__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8a8c9283dbb876eb717474de7a6e1ef6
\ No newline at end of file
diff --git a/d9/df0/fast__integer__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/df0/fast__integer__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index ac607c704..000000000
--- a/d9/df0/fast__integer__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="238pt" height="64pt"
- viewBox="0.00 0.00 238.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-56.25 73,-56.25 73,-37 126.5,-37 126.5,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.64,-33.65 53.16,-35.69 61.53,-37.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.71,-41.1 71.25,-40.03 62.34,-34.3 60.71,-41.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df0/fast__integer__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fastinput</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C44.64,-21.91 53.16,-19.98 61.53,-18.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.27,-21.5 71.25,-15.87 60.72,-14.67 62.27,-21.5"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/getchar.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="230.25,-19.25 162.5,-19.25 162.5,0 230.25,0 230.25,-19.25"/>
-<text text-anchor="middle" x="196.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getchar</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.86,-9.62C134.29,-9.62 142.61,-9.62 150.82,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.73,-13.13 160.73,-9.63 150.73,-6.13 150.73,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/df0/fast__integer__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/df0/fast__integer__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 5cec30340..000000000
--- a/d9/df0/fast__integer__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="238pt" height="64pt"
- viewBox="0.00 0.00 238.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-56.25 73,-56.25 73,-37 126.5,-37 126.5,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.64,-33.65 53.16,-35.69 61.53,-37.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.71,-41.1 71.25,-40.03 62.34,-34.3 60.71,-41.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df0/fast__integer__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fastinput</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C44.64,-21.91 53.16,-19.98 61.53,-18.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.27,-21.5 71.25,-15.87 60.72,-14.67 62.27,-21.5"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/getchar.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="230.25,-19.25 162.5,-19.25 162.5,0 230.25,0 230.25,-19.25"/>
-<text text-anchor="middle" x="196.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getchar</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.86,-9.62C134.29,-9.62 142.61,-9.62 150.82,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.73,-13.13 160.73,-9.63 150.73,-6.13 150.73,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/df0/fast__integer__input_8cpp_source.html b/d9/df0/fast__integer__input_8cpp_source.html
new file mode 100644
index 000000000..507a351f5
--- /dev/null
+++ b/d9/df0/fast__integer__input_8cpp_source.html
@@ -0,0 +1,179 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/fast_integer_input.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/df0/fast__integer__input_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">fast_integer_input.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/df0/fast__integer__input_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="foldopen" id="foldopen00011" data-start="{" data-end="}">
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"><a class="line" href="../../d9/df0/fast__integer__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82">   11</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df0/fast__integer__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82">fastinput</a>(<span class="keywordtype">int</span> *number) {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="comment">// variable to indicate sign of input integer</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <span class="keywordtype">bool</span> negative = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordtype">int</span> c;</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    *number = 0;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="comment">// extract current character from buffer</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    c = std::getchar();</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    <span class="keywordflow">if</span> (c == <span class="charliteral">&#39;-&#39;</span>) {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        <span class="comment">// number is negative</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        negative = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        <span class="comment">// extract the next character from the buffer</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        c = std::getchar();</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    }</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="comment">// Keep on extracting characters if they are integers</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="comment">// i.e ASCII Value lies from &#39;0&#39;(48) to &#39;9&#39; (57)</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordflow">for</span> (; (c &gt; 47 &amp;&amp; c &lt; 58); c = std::getchar())</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        *number = *number * 10 + c - 48;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="comment">// if scanned input has a negative sign, negate the</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="comment">// value of the input number</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">if</span> (negative)</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        *(number) *= -1;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>}</div>
+</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="foldopen" id="foldopen00039" data-start="{" data-end="}">
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   39</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordtype">int</span> number;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <a class="code hl_function" href="../../d9/df0/fast__integer__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82">fastinput</a>(&amp;number);</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    std::cout &lt;&lt; number &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>}</div>
+</div>
+<div class="ttc" id="afast__integer__input_8cpp_html_a4e097ac8509b717bdc8ab09ecd86ae82"><div class="ttname"><a href="../../d9/df0/fast__integer__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82">fastinput</a></div><div class="ttdeci">void fastinput(int *number)</div><div class="ttdef"><b>Definition</b> <a href="#l00011">fast_integer_input.cpp:11</a></div></div>
+<div class="ttc" id="afast__integer__input_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00039">fast_integer_input.cpp:39</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../d9/df0/fast__integer__input_8cpp.html">fast_integer_input.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/df4/namespacetests.html b/d9/df4/namespacetests.html
index 7c9cc243b..264d9c30a 100644
--- a/d9/df4/namespacetests.html
+++ b/d9/df4/namespacetests.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: tests Namespace Reference</title>
+<title>TheAlgorithms/C++: tests Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -131,7 +148,7 @@ Functions</h2></td></tr>
 <tr class="memdesc:af7b81d7a1534216af6a36a80135beb86"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check a shift of zero.  <br /></td></tr>
 <tr class="separator:af7b81d7a1534216af6a36a80135beb86"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aacafde185abd8670abee51157f273dc2" id="r_aacafde185abd8670abee51157f273dc2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aacafde185abd8670abee51157f273dc2">test6</a> ()</td></tr>
-<tr class="memdesc:aacafde185abd8670abee51157f273dc2"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check correct functionality with an array sorted using <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a>.  <br /></td></tr>
+<tr class="memdesc:aacafde185abd8670abee51157f273dc2"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check correct functionality with an array sorted using std::sort.  <br /></td></tr>
 <tr class="separator:aacafde185abd8670abee51157f273dc2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -178,19 +195,19 @@ Functions</h2></td></tr>
 <p>&lt; Check if both elements are same</p>
 <p>&lt; Check if result is empty</p>
 <p>&lt; Should only print newline</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d14/array__left__rotation_8cpp_source.html#l00075">75</a> of file <a class="el" href="../../d9/d14/array__left__rotation_8cpp_source.html">array_left_rotation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   75</span>             {</div>
-<div class="line"><span class="lineno">   76</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST CASE 1\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   77</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {1, 2, 3, 4, 5}\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   78</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected result: {3, 4, 5, 1, 2}\n&quot;</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&lt;int32_t&gt;</a> arr = {1, 2, 3, 4, 5};</div>
-<div class="line"><span class="lineno">   80</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> res = shift_left(arr, 2);</div>
-<div class="line"><span class="lineno">   81</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> expected = {3, 4, 5, 1, 2};</div>
+<div class="line"><span class="lineno">   76</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 1\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   77</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {1, 2, 3, 4, 5}\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   78</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {3, 4, 5, 1, 2}\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   79</span>    std::vector&lt;int32_t&gt; arr = {1, 2, 3, 4, 5};</div>
+<div class="line"><span class="lineno">   80</span>    std::vector&lt;int32_t&gt; res = shift_left(arr, 2);</div>
+<div class="line"><span class="lineno">   81</span>    std::vector&lt;int32_t&gt; expected = {3, 4, 5, 1, 2};</div>
 <div class="line"><span class="lineno">   82</span>    assert(res == expected);</div>
-<div class="line"><span class="lineno">   83</span>    print(res);  <span class="comment">///&lt; Should print 3 4 5 1 2</span></div>
-<div class="line"><span class="lineno">   84</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   83</span>    print(res);  </div>
+<div class="line"><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   85</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="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -229,16 +246,18 @@ Functions</h2></td></tr>
 <p>&lt; Ensure that there is only one element</p>
 <p>&lt; Check if result is equal to b</p>
 <p>&lt; Should print 2 3</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d14/array__left__rotation_8cpp_source.html#l00090">90</a> of file <a class="el" href="../../d9/d14/array__left__rotation_8cpp_source.html">array_left_rotation.cpp</a>.</p>
 <div class="fragment"><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/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST CASE 2\n&quot;</span>;</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> &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {}\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   93</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected result: {}\n&quot;</span>;</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&lt;int32_t&gt;</a> arr = {};</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&lt;int32_t&gt;</a> res = shift_left(arr, 2);</div>
-<div class="line"><span class="lineno">   96</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> expected = {};</div>
+<div class="line"><span class="lineno">   91</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 2\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {}\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   93</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {}\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   94</span>    std::vector&lt;int32_t&gt; arr = {};</div>
+<div class="line"><span class="lineno">   95</span>    std::vector&lt;int32_t&gt; res = shift_left(arr, 2);</div>
+<div class="line"><span class="lineno">   96</span>    std::vector&lt;int32_t&gt; expected = {};</div>
 <div class="line"><span class="lineno">   97</span>    assert(res == expected);</div>
-<div class="line"><span class="lineno">   98</span>    print(res);  <span class="comment">///&lt; Should print empty newline</span></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> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   98</span>    print(res);  </div>
+<div class="line"><span class="lineno">   99</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  100</span>}</div>
 </div><!-- fragment -->
 </div>
@@ -281,16 +300,18 @@ Functions</h2></td></tr>
 <p>&lt; Check for equality</p>
 <p>&lt; Check if result is correct</p>
 <p>&lt; Should print 2 3 4 6</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d14/array__left__rotation_8cpp_source.html#l00105">105</a> of file <a class="el" href="../../d9/d14/array__left__rotation_8cpp_source.html">array_left_rotation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  105</span>             {</div>
-<div class="line"><span class="lineno">  106</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST CASE 3\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  107</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {1, 2, 3, 4, 5}\n&quot;</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> &lt;&lt; <span class="stringliteral">&quot;Expected result: {}\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  109</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> arr = {1, 2, 3, 4, 5};</div>
-<div class="line"><span class="lineno">  110</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> res = shift_left(arr, 7);  <span class="comment">///&lt; 7 &gt; 5</span></div>
-<div class="line"><span class="lineno">  111</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> expected = {};</div>
+<div class="line"><span class="lineno">  106</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 3\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  107</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {1, 2, 3, 4, 5}\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  108</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {}\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  109</span>    std::vector&lt;int32_t&gt; arr = {1, 2, 3, 4, 5};</div>
+<div class="line"><span class="lineno">  110</span>    std::vector&lt;int32_t&gt; res = shift_left(arr, 7);  </div>
+<div class="line"><span class="lineno">  111</span>    std::vector&lt;int32_t&gt; expected = {};</div>
 <div class="line"><span class="lineno">  112</span>    assert(res == expected);</div>
-<div class="line"><span class="lineno">  113</span>    print(res);  <span class="comment">///&lt; Should print empty newline</span></div>
-<div class="line"><span class="lineno">  114</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  113</span>    print(res);  </div>
+<div class="line"><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  115</span>}</div>
 </div><!-- fragment -->
 </div>
@@ -327,32 +348,28 @@ Functions</h2></td></tr>
 <p>&lt; Should print 4 6</p>
 <p>&lt; Check if result is correct</p>
 <p>&lt; Should print 2 3 4 6 7</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d14/array__left__rotation_8cpp_source.html#l00120">120</a> of file <a class="el" href="../../d9/d14/array__left__rotation_8cpp_source.html">array_left_rotation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  120</span>             {</div>
-<div class="line"><span class="lineno">  121</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST CASE 4\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  122</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {2, 4, ..., 420}\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  123</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected result: {4, 6, ..., 420, 2}\n&quot;</span>;</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&lt;int32_t&gt;</a> arr;</div>
+<div class="line"><span class="lineno">  121</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 4\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  122</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {2, 4, ..., 420}\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  123</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {4, 6, ..., 420, 2}\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  124</span>    std::vector&lt;int32_t&gt; arr;</div>
 <div class="line"><span class="lineno">  125</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= 210; i++) {</div>
-<div class="line"><span class="lineno">  126</span>        arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(i * 2);</div>
+<div class="line"><span class="lineno">  126</span>        arr.push_back(i * 2);</div>
 <div class="line"><span class="lineno">  127</span>    }</div>
 <div class="line"><span class="lineno">  128</span>    print(arr);</div>
-<div class="line"><span class="lineno">  129</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> res = shift_left(arr, 1);</div>
-<div class="line"><span class="lineno">  130</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> expected;</div>
+<div class="line"><span class="lineno">  129</span>    std::vector&lt;int32_t&gt; res = shift_left(arr, 1);</div>
+<div class="line"><span class="lineno">  130</span>    std::vector&lt;int32_t&gt; expected;</div>
 <div class="line"><span class="lineno">  131</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; 210; i++) {</div>
-<div class="line"><span class="lineno">  132</span>        expected.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(arr[i]);</div>
+<div class="line"><span class="lineno">  132</span>        expected.push_back(arr[i]);</div>
 <div class="line"><span class="lineno">  133</span>    }</div>
-<div class="line"><span class="lineno">  134</span>    expected.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(2);</div>
+<div class="line"><span class="lineno">  134</span>    expected.push_back(2);</div>
 <div class="line"><span class="lineno">  135</span>    assert(res == expected);</div>
-<div class="line"><span class="lineno">  136</span>    print(res);  <span class="comment">///&lt; Should print {4, 6, ..., 420, 2}</span></div>
-<div class="line"><span class="lineno">  137</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  136</span>    print(res);  </div>
+<div class="line"><span class="lineno">  137</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  138</span>}</div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-</div><!-- 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="../../d9/df4/namespacetests_a2b9769e44683dcb67fe1083ad91e134d_cgraph.svg" width="300" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af7b81d7a1534216af6a36a80135beb86" name="af7b81d7a1534216af6a36a80135beb86"></a>
@@ -385,15 +402,17 @@ Here is the call graph for this function:</div>
 <p>&lt; Should print 2 3 4</p>
 <p>&lt; Check if result is correct</p>
 <p>&lt; Should print 1 2 3 4 5 6 7 9</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d14/array__left__rotation_8cpp_source.html#l00143">143</a> of file <a class="el" href="../../d9/d14/array__left__rotation_8cpp_source.html">array_left_rotation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  143</span>             {</div>
-<div class="line"><span class="lineno">  144</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST CASE 5\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  145</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {1, 2, 3, 4, 5}\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  146</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected result: {1, 2, 3, 4, 5}\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  147</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> arr = {1, 2, 3, 4, 5};</div>
-<div class="line"><span class="lineno">  148</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> res = shift_left(arr, 0);</div>
+<div class="line"><span class="lineno">  144</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 5\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  145</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initialized arr = {1, 2, 3, 4, 5}\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  146</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {1, 2, 3, 4, 5}\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  147</span>    std::vector&lt;int32_t&gt; arr = {1, 2, 3, 4, 5};</div>
+<div class="line"><span class="lineno">  148</span>    std::vector&lt;int32_t&gt; res = shift_left(arr, 0);</div>
 <div class="line"><span class="lineno">  149</span>    assert(res == arr);</div>
-<div class="line"><span class="lineno">  150</span>    print(res);  <span class="comment">///&lt; Should print 1 2 3 4 5</span></div>
-<div class="line"><span class="lineno">  151</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  150</span>    print(res);  </div>
+<div class="line"><span class="lineno">  151</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  152</span>}</div>
 </div><!-- fragment -->
 </div>
@@ -413,7 +432,7 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 
-<p>A Test to check correct functionality with an array sorted using <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a>. </p>
+<p>A Test to check correct functionality with an array sorted using std::sort. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
 <p>&lt; Sort vector a</p>
 <p>&lt; Sort vector b</p>
@@ -427,31 +446,25 @@ Here is the call graph for this function:</div>
 <p>&lt; Sort vector b</p>
 <p>&lt; Check if result is correct</p>
 <p>&lt; Should print 1 2 3 4 5 6 7 8 9 11</p>
-<div class="fragment"><div class="line"><span class="lineno">  166</span>             {</div>
-<div class="line"><span class="lineno">  167</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST CASE 6\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  168</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Intialized a = {1, 3, 3, 2, 5, 9, 4, 7, 3, 2} &quot;</span>;</div>
-<div class="line"><span class="lineno">  169</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;b = {11, 3, 7, 8, 6}\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  170</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected result: {3, 7}\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  171</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> a = {1, 3, 3, 2, 5, 9, 4, 7, 3, 2};</div>
-<div class="line"><span class="lineno">  172</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> b = {11, 3, 7, 8, 6};</div>
-<div class="line"><span class="lineno">  173</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a>(a.begin(), a.end());  <span class="comment">///&lt; Sort vector a</span></div>
-<div class="line"><span class="lineno">  174</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a>(b.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), b.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>());  <span class="comment">///&lt; Sort vector b</span></div>
-<div class="line"><span class="lineno">  175</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = get_intersection(a, b);</div>
-<div class="line"><span class="lineno">  176</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> expected = {3, 7};</div>
-<div class="line"><span class="lineno">  177</span>    assert(result == expected);  <span class="comment">///&lt; Check if result is correct</span></div>
-<div class="line"><span class="lineno">  178</span>    print(result);               <span class="comment">///&lt; Should print 3 7</span></div>
-<div class="line"><span class="lineno">  179</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  180</span>}</div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-<div class="ttc" id="asort_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a></div><div class="ttdeci">T sort(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.svg" width="268" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../de/dc5/intersection__of__two__arrays_8cpp_source.html#l00166">166</a> of file <a class="el" href="../../de/dc5/intersection__of__two__arrays_8cpp_source.html">intersection_of_two_arrays.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  166</span>             {</div>
+<div class="line"><span class="lineno">  167</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 6\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  168</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Intialized a = {1, 3, 3, 2, 5, 9, 4, 7, 3, 2} &quot;</span>;</div>
+<div class="line"><span class="lineno">  169</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;b = {11, 3, 7, 8, 6}\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  170</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {3, 7}\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  171</span>    std::vector&lt;int32_t&gt; a = {1, 3, 3, 2, 5, 9, 4, 7, 3, 2};</div>
+<div class="line"><span class="lineno">  172</span>    std::vector&lt;int32_t&gt; b = {11, 3, 7, 8, 6};</div>
+<div class="line"><span class="lineno">  173</span>    std::sort(a.begin(), a.end());  </div>
+<div class="line"><span class="lineno">  174</span>    std::sort(b.begin(), b.end());  </div>
+<div class="line"><span class="lineno">  175</span>    std::vector&lt;int32_t&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = get_intersection(a, b);</div>
+<div class="line"><span class="lineno">  176</span>    std::vector&lt;int32_t&gt; expected = {3, 7};</div>
+<div class="line"><span class="lineno">  177</span>    assert(result == expected);  </div>
+<div class="line"><span class="lineno">  178</span>    print(result);               </div>
+<div class="line"><span class="lineno">  179</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  180</span>}</div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/df4/namespacetests_a2b9769e44683dcb67fe1083ad91e134d_cgraph.map b/d9/df4/namespacetests_a2b9769e44683dcb67fe1083ad91e134d_cgraph.map
deleted file mode 100644
index 99c98e7fc..000000000
--- a/d9/df4/namespacetests_a2b9769e44683dcb67fe1083ad91e134d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="tests::test4" name="tests::test4">
-<area shape="rect" id="Node000001" title="A Test to check a very large input." alt="" coords="5,5,93,31"/>
-<area shape="rect" id="Node000002" 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="141,5,295,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="93,16,125,16,125,21,93,21"/>
-</map>
diff --git a/d9/df4/namespacetests_a2b9769e44683dcb67fe1083ad91e134d_cgraph.md5 b/d9/df4/namespacetests_a2b9769e44683dcb67fe1083ad91e134d_cgraph.md5
deleted file mode 100644
index 5de416b93..000000000
--- a/d9/df4/namespacetests_a2b9769e44683dcb67fe1083ad91e134d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-45c6e33c9a201dccdc24b76ad6666258
\ No newline at end of file
diff --git a/d9/df4/namespacetests_a2b9769e44683dcb67fe1083ad91e134d_cgraph.svg b/d9/df4/namespacetests_a2b9769e44683dcb67fe1083ad91e134d_cgraph.svg
deleted file mode 100644
index 7d5302885..000000000
--- a/d9/df4/namespacetests_a2b9769e44683dcb67fe1083ad91e134d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests::test4 Pages: 1 -->
-<svg width="225pt" height="27pt"
- viewBox="0.00 0.00 225.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>tests::test4</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A Test to check a very large input.">
-<polygon fill="#999999" stroke="#666666" points="65.5,-19.25 0,-19.25 0,0 65.5,0 65.5,-19.25"/>
-<text text-anchor="middle" x="32.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="217.25,-19.25 101.5,-19.25 101.5,0 217.25,0 217.25,-19.25"/>
-<text text-anchor="middle" x="159.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M65.84,-9.62C73.28,-9.62 81.48,-9.62 89.82,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.73,-13.13 99.73,-9.63 89.73,-6.13 89.73,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/df4/namespacetests_a2b9769e44683dcb67fe1083ad91e134d_cgraph_org.svg b/d9/df4/namespacetests_a2b9769e44683dcb67fe1083ad91e134d_cgraph_org.svg
deleted file mode 100644
index 987fce65f..000000000
--- a/d9/df4/namespacetests_a2b9769e44683dcb67fe1083ad91e134d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests::test4 Pages: 1 -->
-<svg width="225pt" height="27pt"
- viewBox="0.00 0.00 225.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>tests::test4</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A Test to check a very large input.">
-<polygon fill="#999999" stroke="#666666" points="65.5,-19.25 0,-19.25 0,0 65.5,0 65.5,-19.25"/>
-<text text-anchor="middle" x="32.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="217.25,-19.25 101.5,-19.25 101.5,0 217.25,0 217.25,-19.25"/>
-<text text-anchor="middle" x="159.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M65.84,-9.62C73.28,-9.62 81.48,-9.62 89.82,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.73,-13.13 99.73,-9.63 89.73,-6.13 89.73,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.map b/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.map
deleted file mode 100644
index 52ef48ee0..000000000
--- a/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="tests::test6" name="tests::test6">
-<area shape="rect" id="Node000001" title="A Test to check correct functionality with an array sorted using std::sort." alt="" coords="5,55,93,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="141,5,263,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="91,51,144,34,146,39,92,57"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="146,55,258,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="93,65,130,65,130,70,93,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/sort.html#" title=" " alt="" coords="167,104,236,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="92,78,153,98,151,104,91,84"/>
-</map>
diff --git a/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.md5 b/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.md5
deleted file mode 100644
index 1e4f2c853..000000000
--- a/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-29fa5ae27623c67806a3df3d9ccdfa63
\ No newline at end of file
diff --git a/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.svg b/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.svg
deleted file mode 100644
index 536205df2..000000000
--- a/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests::test6 Pages: 1 -->
-<svg width="201pt" height="101pt"
- viewBox="0.00 0.00 201.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>tests::test6</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A Test to check correct functionality with an array sorted using std::sort.">
-<polygon fill="#999999" stroke="#666666" points="65.5,-56.25 0,-56.25 0,-37 65.5,-37 65.5,-56.25"/>
-<text text-anchor="middle" x="32.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test6</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.25,-93.25 101.5,-93.25 101.5,-74 193.25,-74 193.25,-93.25"/>
-<text text-anchor="middle" x="147.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M64.53,-56.74C76.94,-60.81 91.46,-65.58 104.79,-69.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.61,-73.26 114.2,-73.05 105.79,-66.61 103.61,-73.26"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.5,-56.25 105.25,-56.25 105.25,-37 189.5,-37 189.5,-56.25"/>
-<text text-anchor="middle" x="147.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M65.72,-46.62C74.41,-46.62 84.06,-46.62 93.58,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.53,-50.13 103.53,-46.63 93.53,-43.13 93.53,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173.38,-19.25 121.38,-19.25 121.38,0 173.38,0 173.38,-19.25"/>
-<text text-anchor="middle" x="147.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M64.53,-36.51C78.64,-31.88 95.48,-26.35 110.2,-21.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.11,-24.89 119.52,-18.45 108.93,-18.24 111.11,-24.89"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph_org.svg b/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph_org.svg
deleted file mode 100644
index 7467631c8..000000000
--- a/d9/df4/namespacetests_aacafde185abd8670abee51157f273dc2_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests::test6 Pages: 1 -->
-<svg width="201pt" height="101pt"
- viewBox="0.00 0.00 201.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>tests::test6</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A Test to check correct functionality with an array sorted using std::sort.">
-<polygon fill="#999999" stroke="#666666" points="65.5,-56.25 0,-56.25 0,-37 65.5,-37 65.5,-56.25"/>
-<text text-anchor="middle" x="32.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test6</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.25,-93.25 101.5,-93.25 101.5,-74 193.25,-74 193.25,-93.25"/>
-<text text-anchor="middle" x="147.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M64.53,-56.74C76.94,-60.81 91.46,-65.58 104.79,-69.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.61,-73.26 114.2,-73.05 105.79,-66.61 103.61,-73.26"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.5,-56.25 105.25,-56.25 105.25,-37 189.5,-37 189.5,-56.25"/>
-<text text-anchor="middle" x="147.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M65.72,-46.62C74.41,-46.62 84.06,-46.62 93.58,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.53,-50.13 103.53,-46.63 93.53,-43.13 93.53,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173.38,-19.25 121.38,-19.25 121.38,0 173.38,0 173.38,-19.25"/>
-<text text-anchor="middle" x="147.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M64.53,-36.51C78.64,-31.88 95.48,-26.35 110.2,-21.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.11,-24.89 119.52,-18.45 108.93,-18.24 111.11,-24.89"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html b/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html
index 7633b8f76..fe1e75be0 100644
--- a/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html
+++ b/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others::recursive_tree_traversals::Node Struct Reference</title>
+<title>TheAlgorithms/C++: others::recursive_tree_traversals::Node Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -116,14 +133,13 @@ $(function(){initNavTree('d9/df7/structothers_1_1recursive__tree__traversals_1_1
 <div class="dynheader">
 Collaboration diagram for others::recursive_tree_traversals::Node:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.svg" width="207" height="140"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.svg" width="207" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a59cc94ba784aeaefec2e915ddfdb1ade" id="r_a59cc94ba784aeaefec2e915ddfdb1ade"><td class="memItemLeft" align="right" valign="top"><a id="a59cc94ba784aeaefec2e915ddfdb1ade" name="a59cc94ba784aeaefec2e915ddfdb1ade"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a>&#160;</td><td class="memItemRight" valign="bottom"><b>data</b> = 0</td></tr>
-<tr class="memdesc:a59cc94ba784aeaefec2e915ddfdb1ade"><td class="mdescLeft">&#160;</td><td class="mdescRight">The value/key of the node. <br /></td></tr>
+<tr class="memitem:a59cc94ba784aeaefec2e915ddfdb1ade" id="r_a59cc94ba784aeaefec2e915ddfdb1ade"><td class="memItemLeft" align="right" valign="top">std::uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a59cc94ba784aeaefec2e915ddfdb1ade">data</a> = 0</td></tr>
+<tr class="memdesc:a59cc94ba784aeaefec2e915ddfdb1ade"><td class="mdescLeft">&#160;</td><td class="mdescRight">The value/key of the node.  <br /></td></tr>
 <tr class="separator:a59cc94ba784aeaefec2e915ddfdb1ade"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a5a8a7bc2d2f847994220ae9e0b60fff3" id="r_a5a8a7bc2d2f847994220ae9e0b60fff3"><td class="memItemLeft" align="right" valign="top">struct <a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a> {}</td></tr>
 <tr class="memdesc:a5a8a7bc2d2f847994220ae9e0b60fff3"><td class="mdescLeft">&#160;</td><td class="mdescRight">struct pointer to left subtree.  <br /></td></tr>
@@ -142,7 +158,27 @@ Public Attributes</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00079">79</a> of file <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a>.</p>
 </div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="a59cc94ba784aeaefec2e915ddfdb1ade" name="a59cc94ba784aeaefec2e915ddfdb1ade"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a59cc94ba784aeaefec2e915ddfdb1ade">&#9670;&#160;</a></span>data</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::uint64_t others::recursive_tree_traversals::Node::data = 0</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>The value/key of the node. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00080">80</a> of file <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a>.</p>
+
+</div>
+</div>
 <a id="a5a8a7bc2d2f847994220ae9e0b60fff3" name="a5a8a7bc2d2f847994220ae9e0b60fff3"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a5a8a7bc2d2f847994220ae9e0b60fff3">&#9670;&#160;</a></span>left</h2>
 
@@ -156,7 +192,9 @@ Public Attributes</h2></td></tr>
 </div><div class="memdoc">
 
 <p>struct pointer to left subtree. </p>
-<div class="fragment"><div class="line"><span class="lineno">   81</span>{};     <span class="comment">///&lt; struct pointer to left subtree.</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00081">81</a> of file <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   81</span>{};     </div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -173,12 +211,14 @@ Public Attributes</h2></td></tr>
 </div><div class="memdoc">
 
 <p>struct pointer to right subtree. </p>
-<div class="fragment"><div class="line"><span class="lineno">   82</span>{};    <span class="comment">///&lt; struct pointer to right subtree.</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00082">82</a> of file <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   82</span>{};    </div>
 </div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>others/<a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp.html">recursive_tree_traversal.cpp</a></li>
+<li>others/<a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/d9/dfd/circular__queue__using__linked__list_8cpp_source.html b/d9/dfd/circular__queue__using__linked__list_8cpp_source.html
new file mode 100644
index 000000000..bba86cc31
--- /dev/null
+++ b/d9/dfd/circular__queue__using__linked__list_8cpp_source.html
@@ -0,0 +1,223 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/circular_queue_using_linked_list.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/dfd/circular__queue__using__linked__list_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">circular_queue_using_linked_list.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span> </div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> {</div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span>    <span class="keywordtype">int</span> data;</div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span>    <span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* next;</div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span>};</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="keyword">class </span><a class="code hl_class" href="../../dc/db5/struct_queue.html">Queue</a> {</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* front = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* rear = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    <a class="code hl_class" href="../../dc/db5/struct_queue.html">Queue</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dc/db5/struct_queue.html">Queue</a>&amp;) = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <a class="code hl_class" href="../../dc/db5/struct_queue.html">Queue</a>&amp; operator=(<span class="keyword">const</span> <a class="code hl_class" href="../../dc/db5/struct_queue.html">Queue</a>&amp;) = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <a class="code hl_class" href="../../dc/db5/struct_queue.html">Queue</a>() = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <a class="code hl_class" href="../../dc/db5/struct_queue.html">~Queue</a>() {</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>        <span class="keywordflow">while</span> (front) {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>            dequeue();</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        }</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    }</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    <span class="keywordtype">void</span> createNode(<span class="keywordtype">int</span> val) {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        <span class="keyword">auto</span>* nn = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        nn-&gt;data = val;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        nn-&gt;next = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        front = nn;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        rear = nn;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    }</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordtype">void</span> enqueue(<span class="keywordtype">int</span> val) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        <span class="keywordflow">if</span> (front == <span class="keyword">nullptr</span> || rear == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>            createNode(val);</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* nn = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>            nn-&gt;data = val;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>            rear-&gt;next = nn;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            nn-&gt;next = front;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>            rear = nn;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        }</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordtype">void</span> dequeue() {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="keywordflow">if</span> (front == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        }</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="keyword">const</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* <span class="keyword">const</span> n = front;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="keywordflow">if</span> (front == rear) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            front = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>            rear = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            front = front-&gt;next;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            rear-&gt;next = front;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="keyword">delete</span> n;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordtype">void</span> traverse() {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordflow">if</span> (front == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        }</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="keyword">const</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* ptr = front;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            std::cout &lt;&lt; ptr-&gt;data &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            ptr = ptr-&gt;next;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        } <span class="keywordflow">while</span> (ptr != front);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>};</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">void</span>) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <a class="code hl_class" href="../../dc/db5/struct_queue.html">Queue</a> q;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    q.enqueue(10);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    q.enqueue(20);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    q.enqueue(30);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    q.enqueue(40);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    q.enqueue(50);</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    q.enqueue(60);</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    q.enqueue(70);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    q.traverse();</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    q.dequeue();</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    q.traverse();</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>}</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="astruct_queue_html"><div class="ttname"><a href="../../dc/db5/struct_queue.html">Queue</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00017">binary_search_tree.cpp:17</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><b>circular_queue_using_linked_list.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/d9/dfd/comb__sort_8cpp.html b/d9/dfd/comb__sort_8cpp.html
index 29398506e..c6b5a9ee6 100644
--- a/d9/dfd/comb__sort_8cpp.html
+++ b/d9/dfd/comb__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/comb_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/comb_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for comb_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dbe/comb__sort_8cpp__incl.svg" width="270" height="111"><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">
+</div>
+<p><a href="../../d9/dfd/comb__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:aede08143e63105faba10e9ee8e745fd5" id="r_aede08143e63105faba10e9ee8e745fd5"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aede08143e63105faba10e9ee8e745fd5">FindNextGap</a> (int gap)</td></tr>
@@ -140,6 +159,8 @@ Functions</h2></td></tr>
 <li>Bubble sort compares adjacent values whereas comb sort uses gap larger than 1</li>
 <li>Best case Time complexity O(n) Worst case Time complexity O(n^2) </li>
 </ul>
+
+<p class="definition">Definition in file <a class="el" href="../../d9/dfd/comb__sort_8cpp_source.html">comb_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a0f4e7569090083fb53d5cdeaf0e2974f" name="a0f4e7569090083fb53d5cdeaf0e2974f"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0f4e7569090083fb53d5cdeaf0e2974f">&#9670;&#160;</a></span>CombSort()</h2>
@@ -178,44 +199,28 @@ Functions</h2></td></tr>
 <p>Keep running until gap = 1 or none elements were swapped</p>
 <p>Find next gap</p>
 <p><a class="el" href="../../de/d4a/class_compare.html" title="Comparator class for priority queue.">Compare</a> all elements with current gap</p>
-<div class="fragment"><div class="line"><span class="lineno">   42</span>                                      {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   43</span><span class="comment">    /**</span></div>
-<div class="line"><span class="lineno">   44</span><span class="comment">     *</span></div>
-<div class="line"><span class="lineno">   45</span><span class="comment">     * initial gap will be maximum and the maximum possible value is</span></div>
-<div class="line"><span class="lineno">   46</span><span class="comment">     * the size of the array that is n and which is equal to r in this</span></div>
-<div class="line"><span class="lineno">   47</span><span class="comment">     * case so to avoid passing an extra parameter n that is the size of</span></div>
-<div class="line"><span class="lineno">   48</span><span class="comment">     * the array we are using r to initialize the initial gap.</span></div>
-<div class="line"><span class="lineno">   49</span><span class="comment">     *</span></div>
-<div class="line"><span class="lineno">   50</span><span class="comment">     */</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dfd/comb__sort_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d9/dfd/comb__sort_8cpp_source.html">comb_sort.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   42</span>                                      {</div>
 <div class="line"><span class="lineno">   51</span>    <span class="keywordtype">int</span> gap = r;</div>
-<div class="line"><span class="lineno">   52</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   53</span><span class="comment">    /// Initialize swapped as true to make sure that loop runs</span></div>
-<div class="line"><span class="lineno">   54</span><span class="comment"></span>    <span class="keywordtype">bool</span> swapped = <span class="keyword">true</span>;</div>
-<div class="line"><span class="lineno">   55</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   56</span><span class="comment">    /// Keep running until gap = 1 or none elements were swapped</span></div>
-<div class="line"><span class="lineno">   57</span><span class="comment"></span>    <span class="keywordflow">while</span> (gap != 1 || swapped) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   58</span><span class="comment">        /// Find next gap</span></div>
-<div class="line"><span class="lineno">   59</span><span class="comment"></span>        gap = <a class="code hl_function" href="#aede08143e63105faba10e9ee8e745fd5">FindNextGap</a>(gap);</div>
+<div class="line"><span class="lineno">   52</span> </div>
+<div class="line"><span class="lineno">   54</span>    <span class="keywordtype">bool</span> swapped = <span class="keyword">true</span>;</div>
+<div class="line"><span class="lineno">   55</span> </div>
+<div class="line"><span class="lineno">   57</span>    <span class="keywordflow">while</span> (gap != 1 || swapped) {</div>
+<div class="line"><span class="lineno">   59</span>        gap = <a class="code hl_function" href="#aede08143e63105faba10e9ee8e745fd5">FindNextGap</a>(gap);</div>
 <div class="line"><span class="lineno">   60</span> </div>
 <div class="line"><span class="lineno">   61</span>        swapped = <span class="keyword">false</span>;</div>
-<div class="line"><span class="lineno">   62</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   63</span><span class="comment">        /// Compare all elements with current gap</span></div>
-<div class="line"><span class="lineno">   64</span><span class="comment"></span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = l; i &lt; r - gap; ++i) {</div>
+<div class="line"><span class="lineno">   62</span> </div>
+<div class="line"><span class="lineno">   64</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = l; i &lt; r - gap; ++i) {</div>
 <div class="line"><span class="lineno">   65</span>            <span class="keywordflow">if</span> (arr[i] &gt; arr[i + gap]) {</div>
-<div class="line"><span class="lineno">   66</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(arr[i], arr[i + gap]);</div>
+<div class="line"><span class="lineno">   66</span>                std::swap(arr[i], arr[i + gap]);</div>
 <div class="line"><span class="lineno">   67</span>                swapped = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   68</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>}</div>
-<div class="ttc" id="acomb__sort_8cpp_html_aede08143e63105faba10e9ee8e745fd5"><div class="ttname"><a href="#aede08143e63105faba10e9ee8e745fd5">FindNextGap</a></div><div class="ttdeci">int FindNextGap(int gap)</div><div class="ttdef"><b>Definition</b> comb_sort.cpp:29</div></div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- 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="../../d9/dfd/comb__sort_8cpp_a0f4e7569090083fb53d5cdeaf0e2974f_cgraph.svg" width="358" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomb__sort_8cpp_html_aede08143e63105faba10e9ee8e745fd5"><div class="ttname"><a href="#aede08143e63105faba10e9ee8e745fd5">FindNextGap</a></div><div class="ttdeci">int FindNextGap(int gap)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dfd/comb__sort_8cpp_source.html#l00029">comb_sort.cpp:29</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aede08143e63105faba10e9ee8e745fd5" name="aede08143e63105faba10e9ee8e745fd5"></a>
@@ -239,18 +244,14 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new gap </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dfd/comb__sort_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../d9/dfd/comb__sort_8cpp_source.html">comb_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   29</span>                         {</div>
 <div class="line"><span class="lineno">   30</span>    gap = (gap * 10) / 13;</div>
 <div class="line"><span class="lineno">   31</span> </div>
-<div class="line"><span class="lineno">   32</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(1, gap);</div>
+<div class="line"><span class="lineno">   32</span>    <span class="keywordflow">return</span> std::max(1, gap);</div>
 <div class="line"><span class="lineno">   33</span>}</div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-</div><!-- 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="../../d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph.svg" width="230" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -270,30 +271,23 @@ Here is the call graph for this function:</div>
 <p>Main function </p>
 <p>Running predefined tests</p>
 <p>For user interaction</p>
-<div class="fragment"><div class="line"><span class="lineno">   88</span>           {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   89</span><span class="comment">    /// Running predefined tests</span></div>
-<div class="line"><span class="lineno">   90</span><span class="comment"></span>    <a class="code hl_function" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
-<div class="line"><span class="lineno">   91</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   92</span><span class="comment">    /// For user interaction</span></div>
-<div class="line"><span class="lineno">   93</span><span class="comment"></span>    <span class="keywordtype">int</span> n;</div>
-<div class="line"><span class="lineno">   94</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;</div>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dfd/comb__sort_8cpp_source.html#l00088">88</a> of file <a class="el" href="../../d9/dfd/comb__sort_8cpp_source.html">comb_sort.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   88</span>           {</div>
+<div class="line"><span class="lineno">   90</span>    <a class="code hl_function" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
+<div class="line"><span class="lineno">   91</span> </div>
+<div class="line"><span class="lineno">   93</span>    <span class="keywordtype">int</span> n;</div>
+<div class="line"><span class="lineno">   94</span>    std::cin &gt;&gt; n;</div>
 <div class="line"><span class="lineno">   95</span>    <span class="keywordtype">int</span> *arr = <span class="keyword">new</span> <span class="keywordtype">int</span>[n];</div>
 <div class="line"><span class="lineno">   96</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) std::cin &gt;&gt; arr[i];</div>
 <div class="line"><span class="lineno">   97</span>    <a class="code hl_function" href="#a0f4e7569090083fb53d5cdeaf0e2974f">CombSort</a>(arr, 0, n);</div>
-<div class="line"><span class="lineno">   98</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; arr[i] &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><span class="lineno">   98</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) std::cout &lt;&lt; arr[i] &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
 <div class="line"><span class="lineno">   99</span>    <span class="keyword">delete</span>[] arr;</div>
 <div class="line"><span class="lineno">  100</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  101</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="acomb__sort_8cpp_html_a0f4e7569090083fb53d5cdeaf0e2974f"><div class="ttname"><a href="#a0f4e7569090083fb53d5cdeaf0e2974f">CombSort</a></div><div class="ttdeci">void CombSort(int *arr, int l, int r)</div><div class="ttdef"><b>Definition</b> comb_sort.cpp:42</div></div>
-<div class="ttc" id="acomb__sort_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> comb_sort.cpp:73</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="574" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomb__sort_8cpp_html_a0f4e7569090083fb53d5cdeaf0e2974f"><div class="ttname"><a href="#a0f4e7569090083fb53d5cdeaf0e2974f">CombSort</a></div><div class="ttdeci">void CombSort(int *arr, int l, int r)</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dfd/comb__sort_8cpp_source.html#l00042">comb_sort.cpp:42</a></div></div>
+<div class="ttc" id="acomb__sort_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dfd/comb__sort_8cpp_source.html#l00073">comb_sort.cpp:73</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a88ec9ad42717780d6caaff9d3d6977f9" name="a88ec9ad42717780d6caaff9d3d6977f9"></a>
@@ -312,26 +306,20 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 <p>Test 1</p>
 <p>Test 2</p>
-<div class="fragment"><div class="line"><span class="lineno">   73</span>             {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   74</span><span class="comment">    /// Test 1</span></div>
-<div class="line"><span class="lineno">   75</span><span class="comment"></span>    <span class="keywordtype">int</span> arr1[10] = {34, 56, 6, 23, 76, 34, 76, 343, 4, 76};</div>
-<div class="line"><span class="lineno">   76</span>    <a class="code hl_function" href="#a0f4e7569090083fb53d5cdeaf0e2974f">CombSort</a>(arr1, 0, 10);</div>
-<div class="line"><span class="lineno">   77</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr1, arr1 + 10));</div>
-<div class="line"><span class="lineno">   78</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 passed\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   79</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   80</span><span class="comment">    /// Test 2</span></div>
-<div class="line"><span class="lineno">   81</span><span class="comment"></span>    <span class="keywordtype">int</span> arr2[8] = {-6, 56, -45, 56, 0, -1, 8, 8};</div>
-<div class="line"><span class="lineno">   82</span>    <a class="code hl_function" href="#a0f4e7569090083fb53d5cdeaf0e2974f">CombSort</a>(arr2, 0, 8);</div>
-<div class="line"><span class="lineno">   83</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr2, arr2 + 8));</div>
-<div class="line"><span class="lineno">   84</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   85</span>}</div>
-<div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dfd/comb__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg" width="476" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d9/dfd/comb__sort_8cpp_source.html#l00073">73</a> of file <a class="el" href="../../d9/dfd/comb__sort_8cpp_source.html">comb_sort.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   73</span>             {</div>
+<div class="line"><span class="lineno">   75</span>    <span class="keywordtype">int</span> arr1[10] = {34, 56, 6, 23, 76, 34, 76, 343, 4, 76};</div>
+<div class="line"><span class="lineno">   76</span>    <a class="code hl_function" href="#a0f4e7569090083fb53d5cdeaf0e2974f">CombSort</a>(arr1, 0, 10);</div>
+<div class="line"><span class="lineno">   77</span>    assert(std::is_sorted(arr1, arr1 + 10));</div>
+<div class="line"><span class="lineno">   78</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   79</span> </div>
+<div class="line"><span class="lineno">   81</span>    <span class="keywordtype">int</span> arr2[8] = {-6, 56, -45, 56, 0, -1, 8, 8};</div>
+<div class="line"><span class="lineno">   82</span>    <a class="code hl_function" href="#a0f4e7569090083fb53d5cdeaf0e2974f">CombSort</a>(arr2, 0, 8);</div>
+<div class="line"><span class="lineno">   83</span>    assert(std::is_sorted(arr2, arr2 + 8));</div>
+<div class="line"><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   85</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/d9/dfd/comb__sort_8cpp_a0f4e7569090083fb53d5cdeaf0e2974f_cgraph.map b/d9/dfd/comb__sort_8cpp_a0f4e7569090083fb53d5cdeaf0e2974f_cgraph.map
deleted file mode 100644
index c12925bcd..000000000
--- a/d9/dfd/comb__sort_8cpp_a0f4e7569090083fb53d5cdeaf0e2974f_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="CombSort" name="CombSort">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,86,56"/>
-<area shape="rect" id="Node000002" href="$d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5" title=" " alt="" coords="134,5,232,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="86,33,118,27,119,33,87,39"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="144,55,222,80"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="87,48,129,55,128,61,86,53"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="280,5,352,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="232,16,264,16,264,21,232,21"/>
-</map>
diff --git a/d9/dfd/comb__sort_8cpp_a0f4e7569090083fb53d5cdeaf0e2974f_cgraph.md5 b/d9/dfd/comb__sort_8cpp_a0f4e7569090083fb53d5cdeaf0e2974f_cgraph.md5
deleted file mode 100644
index 91d7359fa..000000000
--- a/d9/dfd/comb__sort_8cpp_a0f4e7569090083fb53d5cdeaf0e2974f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2fb382b5d6eb2628fed0dc75145acb0a
\ No newline at end of file
diff --git a/d9/dfd/comb__sort_8cpp_a0f4e7569090083fb53d5cdeaf0e2974f_cgraph.svg b/d9/dfd/comb__sort_8cpp_a0f4e7569090083fb53d5cdeaf0e2974f_cgraph.svg
deleted file mode 100644
index c3fa5dc9a..000000000
--- a/d9/dfd/comb__sort_8cpp_a0f4e7569090083fb53d5cdeaf0e2974f_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: CombSort Pages: 1 -->
-<svg width="268pt" height="64pt"
- viewBox="0.00 0.00 268.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>CombSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="60.25,-37.25 0,-37.25 0,-18 60.25,-18 60.25,-37.25"/>
-<text text-anchor="middle" x="30.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">CombSort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170,-56.25 96.25,-56.25 96.25,-37 170,-37 170,-56.25"/>
-<text text-anchor="middle" x="133.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">FindNextGap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M60.61,-33.17C68.22,-34.6 76.6,-36.18 84.86,-37.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.01,-41.14 94.49,-39.54 85.3,-34.26 84.01,-41.14"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="162.5,-19.25 103.75,-19.25 103.75,0 162.5,0 162.5,-19.25"/>
-<text text-anchor="middle" x="133.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M60.61,-22.37C70.53,-20.6 81.77,-18.6 92.35,-16.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.75,-20.2 101.98,-15 91.52,-13.31 92.75,-20.2"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.25,-56.25 206,-56.25 206,-37 260.25,-37 260.25,-56.25"/>
-<text text-anchor="middle" x="233.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.34,-46.62C178.09,-46.62 186.29,-46.62 194.11,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.04,-50.13 204.04,-46.63 194.04,-43.13 194.04,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dfd/comb__sort_8cpp_a0f4e7569090083fb53d5cdeaf0e2974f_cgraph_org.svg b/d9/dfd/comb__sort_8cpp_a0f4e7569090083fb53d5cdeaf0e2974f_cgraph_org.svg
deleted file mode 100644
index 9a6a505f3..000000000
--- a/d9/dfd/comb__sort_8cpp_a0f4e7569090083fb53d5cdeaf0e2974f_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: CombSort Pages: 1 -->
-<svg width="268pt" height="64pt"
- viewBox="0.00 0.00 268.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>CombSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="60.25,-37.25 0,-37.25 0,-18 60.25,-18 60.25,-37.25"/>
-<text text-anchor="middle" x="30.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">CombSort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170,-56.25 96.25,-56.25 96.25,-37 170,-37 170,-56.25"/>
-<text text-anchor="middle" x="133.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">FindNextGap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M60.61,-33.17C68.22,-34.6 76.6,-36.18 84.86,-37.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.01,-41.14 94.49,-39.54 85.3,-34.26 84.01,-41.14"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="162.5,-19.25 103.75,-19.25 103.75,0 162.5,0 162.5,-19.25"/>
-<text text-anchor="middle" x="133.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M60.61,-22.37C70.53,-20.6 81.77,-18.6 92.35,-16.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.75,-20.2 101.98,-15 91.52,-13.31 92.75,-20.2"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.25,-56.25 206,-56.25 206,-37 260.25,-37 260.25,-56.25"/>
-<text text-anchor="middle" x="233.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.34,-46.62C178.09,-46.62 186.29,-46.62 194.11,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.04,-50.13 204.04,-46.63 194.04,-43.13 194.04,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dfd/comb__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map b/d9/dfd/comb__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
deleted file mode 100644
index a44e476e1..000000000
--- a/d9/dfd/comb__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,56,80"/>
-<area shape="rect" id="Node000002" href="$d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f" title=" " alt="" coords="114,29,194,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,60,98,51,99,56,57,65"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="104,79,204,104"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="57,70,89,76,88,81,56,75"/>
-<area shape="rect" id="Node000003" href="$d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5" title=" " alt="" coords="252,5,350,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="194,33,236,26,237,31,195,38"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="262,55,340,80"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="195,46,247,56,246,61,194,52"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="398,5,471,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="351,16,382,16,382,21,351,21"/>
-</map>
diff --git a/d9/dfd/comb__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 b/d9/dfd/comb__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
deleted file mode 100644
index 6c4e3eab5..000000000
--- a/d9/dfd/comb__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c05509b64ef95b927f374e50acb19725
\ No newline at end of file
diff --git a/d9/dfd/comb__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg b/d9/dfd/comb__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
deleted file mode 100644
index e0109a9a7..000000000
--- a/d9/dfd/comb__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="357pt" height="82pt"
- viewBox="0.00 0.00 357.00 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.5,-56.25 81.25,-56.25 81.25,-37 141.5,-37 141.5,-56.25"/>
-<text text-anchor="middle" x="111.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">CombSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-31.47C47.31,-33.39 58.73,-35.78 69.78,-38.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.06,-41.53 79.56,-40.16 70.49,-34.68 69.06,-41.53"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149,-19.25 73.75,-19.25 73.75,0 149,0 149,-19.25"/>
-<text text-anchor="middle" x="111.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-23.98C45.23,-22.58 53.63,-20.91 62.18,-19.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.78,-22.66 71.91,-17.28 61.42,-15.79 62.78,-22.66"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.75,-74.25 185,-74.25 185,-55 258.75,-55 258.75,-74.25"/>
-<text text-anchor="middle" x="221.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">FindNextGap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.74,-51.5C151.52,-53.12 162.68,-54.97 173.47,-56.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.58,-60.16 183.02,-58.34 173.73,-53.26 172.58,-60.16"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.25,-37.25 192.5,-37.25 192.5,-18 251.25,-18 251.25,-37.25"/>
-<text text-anchor="middle" x="221.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.74,-41.48C153.87,-39.36 168.13,-36.86 181.17,-34.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.5,-38.07 190.75,-32.9 180.3,-31.18 181.5,-38.07"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="349,-74.25 294.75,-74.25 294.75,-55 349,-55 349,-74.25"/>
-<text text-anchor="middle" x="321.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.09,-64.62C266.84,-64.62 275.04,-64.62 282.86,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.79,-68.13 292.79,-64.63 282.79,-61.13 282.79,-68.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dfd/comb__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg b/d9/dfd/comb__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
deleted file mode 100644
index 0ccfce282..000000000
--- a/d9/dfd/comb__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="357pt" height="82pt"
- viewBox="0.00 0.00 357.00 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.5,-56.25 81.25,-56.25 81.25,-37 141.5,-37 141.5,-56.25"/>
-<text text-anchor="middle" x="111.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">CombSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-31.47C47.31,-33.39 58.73,-35.78 69.78,-38.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.06,-41.53 79.56,-40.16 70.49,-34.68 69.06,-41.53"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149,-19.25 73.75,-19.25 73.75,0 149,0 149,-19.25"/>
-<text text-anchor="middle" x="111.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-23.98C45.23,-22.58 53.63,-20.91 62.18,-19.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.78,-22.66 71.91,-17.28 61.42,-15.79 62.78,-22.66"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.75,-74.25 185,-74.25 185,-55 258.75,-55 258.75,-74.25"/>
-<text text-anchor="middle" x="221.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">FindNextGap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.74,-51.5C151.52,-53.12 162.68,-54.97 173.47,-56.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.58,-60.16 183.02,-58.34 173.73,-53.26 172.58,-60.16"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.25,-37.25 192.5,-37.25 192.5,-18 251.25,-18 251.25,-37.25"/>
-<text text-anchor="middle" x="221.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.74,-41.48C153.87,-39.36 168.13,-36.86 181.17,-34.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.5,-38.07 190.75,-32.9 180.3,-31.18 181.5,-38.07"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="349,-74.25 294.75,-74.25 294.75,-55 349,-55 349,-74.25"/>
-<text text-anchor="middle" x="321.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.09,-64.62C266.84,-64.62 275.04,-64.62 282.86,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.79,-68.13 292.79,-64.63 282.79,-61.13 282.79,-68.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 34789cde6..000000000
--- a/d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,53,55,79"/>
-<area shape="rect" id="Node000002" href="$d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f" title=" " alt="" coords="211,29,291,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,61,195,45,196,51,55,66"/>
-<area shape="rect" id="Node000006" href="$d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" title=" " alt="" coords="103,79,153,104"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="56,70,89,79,87,84,54,75"/>
-<area shape="rect" id="Node000003" href="$d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5" title=" " alt="" coords="349,5,448,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="291,33,334,26,334,31,292,38"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="359,55,438,80"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="292,46,345,56,344,61,291,52"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="496,5,568,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="448,16,480,16,480,21,448,21"/>
-<area shape="poly" id="edge6_Node000006_Node000002" title=" " alt="" coords="153,79,202,59,204,64,155,84"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="201,79,301,104"/>
-<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="154,89,185,89,185,94,154,94"/>
-</map>
diff --git a/d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 45f3d8dd5..000000000
--- a/d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d853dd5d86dd38a2eb0183a30d70a063
\ No newline at end of file
diff --git a/d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 9abf5fbb6..000000000
--- a/d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,164 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="430pt" height="82pt"
- viewBox="0.00 0.00 430.00 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-38.25 0,-38.25 0,-19 37,-19 37,-38.25"/>
-<text text-anchor="middle" x="18.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.5,-56.25 154.25,-56.25 154.25,-37 214.5,-37 214.5,-56.25"/>
-<text text-anchor="middle" x="184.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">CombSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-30.59C62.43,-33.34 108.81,-38.44 142.59,-42.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.13,-45.62 152.45,-43.23 142.9,-38.66 142.13,-45.62"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-23.93C44.64,-21.93 53.57,-19.56 61.98,-17.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.71,-20.74 71.48,-14.79 60.91,-13.98 62.71,-20.74"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="331.75,-74.25 258,-74.25 258,-55 331.75,-55 331.75,-74.25"/>
-<text text-anchor="middle" x="294.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">FindNextGap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.74,-51.5C224.52,-53.12 235.68,-54.97 246.47,-56.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="245.58,-60.16 256.02,-58.34 246.73,-53.26 245.58,-60.16"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.25,-37.25 265.5,-37.25 265.5,-18 324.25,-18 324.25,-37.25"/>
-<text text-anchor="middle" x="294.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.74,-41.48C226.87,-39.36 241.13,-36.86 254.17,-34.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.5,-38.07 263.75,-32.9 253.3,-31.18 254.5,-38.07"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="422,-74.25 367.75,-74.25 367.75,-55 422,-55 422,-74.25"/>
-<text text-anchor="middle" x="394.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M332.09,-64.62C339.84,-64.62 348.04,-64.62 355.86,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.79,-68.13 365.79,-64.63 355.79,-61.13 355.79,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node2 -->
-<g id="edge6_Node000006_Node000002" class="edge">
-<title>Node6&#45;&gt;Node2</title>
-<g id="a_edge6_Node000006_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.19,-17.11C121.92,-21.5 135.83,-27.19 148.58,-32.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.93,-35.51 157.51,-36.05 149.58,-29.03 146.93,-35.51"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222,-19.25 146.75,-19.25 146.75,0 222,0 222,-19.25"/>
-<text text-anchor="middle" x="184.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.19,-9.62C118.15,-9.62 126.45,-9.62 134.89,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.88,-13.13 144.88,-9.63 134.88,-6.13 134.88,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 6ffc2ae37..000000000
--- a/d9/dfd/comb__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,138 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="430pt" height="82pt"
- viewBox="0.00 0.00 430.00 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-38.25 0,-38.25 0,-19 37,-19 37,-38.25"/>
-<text text-anchor="middle" x="18.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.5,-56.25 154.25,-56.25 154.25,-37 214.5,-37 214.5,-56.25"/>
-<text text-anchor="middle" x="184.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">CombSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-30.59C62.43,-33.34 108.81,-38.44 142.59,-42.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.13,-45.62 152.45,-43.23 142.9,-38.66 142.13,-45.62"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-23.93C44.64,-21.93 53.57,-19.56 61.98,-17.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.71,-20.74 71.48,-14.79 60.91,-13.98 62.71,-20.74"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="331.75,-74.25 258,-74.25 258,-55 331.75,-55 331.75,-74.25"/>
-<text text-anchor="middle" x="294.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">FindNextGap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.74,-51.5C224.52,-53.12 235.68,-54.97 246.47,-56.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="245.58,-60.16 256.02,-58.34 246.73,-53.26 245.58,-60.16"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.25,-37.25 265.5,-37.25 265.5,-18 324.25,-18 324.25,-37.25"/>
-<text text-anchor="middle" x="294.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.74,-41.48C226.87,-39.36 241.13,-36.86 254.17,-34.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.5,-38.07 263.75,-32.9 253.3,-31.18 254.5,-38.07"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="422,-74.25 367.75,-74.25 367.75,-55 422,-55 422,-74.25"/>
-<text text-anchor="middle" x="394.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M332.09,-64.62C339.84,-64.62 348.04,-64.62 355.86,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="355.79,-68.13 365.79,-64.63 355.79,-61.13 355.79,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node2 -->
-<g id="edge6_Node000006_Node000002" class="edge">
-<title>Node6&#45;&gt;Node2</title>
-<g id="a_edge6_Node000006_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.19,-17.11C121.92,-21.5 135.83,-27.19 148.58,-32.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.93,-35.51 157.51,-36.05 149.58,-29.03 146.93,-35.51"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222,-19.25 146.75,-19.25 146.75,0 222,0 222,-19.25"/>
-<text text-anchor="middle" x="184.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.19,-9.62C118.15,-9.62 126.45,-9.62 134.89,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.88,-13.13 144.88,-9.63 134.88,-6.13 134.88,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph.map b/d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph.map
deleted file mode 100644
index e51ffbd42..000000000
--- a/d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="FindNextGap" name="FindNextGap">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,104,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="152,5,224,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="104,16,136,16,136,21,104,21"/>
-</map>
diff --git a/d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph.md5 b/d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph.md5
deleted file mode 100644
index 90785ffbd..000000000
--- a/d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-36bbfc1e45d8b0056a034365daf170b5
\ No newline at end of file
diff --git a/d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph.svg b/d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph.svg
deleted file mode 100644
index ebb72f4e7..000000000
--- a/d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: FindNextGap Pages: 1 -->
-<svg width="172pt" height="27pt"
- viewBox="0.00 0.00 172.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>FindNextGap</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="73.75,-19.25 0,-19.25 0,0 73.75,0 73.75,-19.25"/>
-<text text-anchor="middle" x="36.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">FindNextGap</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164,-19.25 109.75,-19.25 109.75,0 164,0 164,-19.25"/>
-<text text-anchor="middle" x="136.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.09,-9.62C81.84,-9.62 90.04,-9.62 97.86,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.79,-13.13 107.79,-9.63 97.79,-6.13 97.79,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph_org.svg b/d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph_org.svg
deleted file mode 100644
index 813dd3be8..000000000
--- a/d9/dfd/comb__sort_8cpp_aede08143e63105faba10e9ee8e745fd5_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: FindNextGap Pages: 1 -->
-<svg width="172pt" height="27pt"
- viewBox="0.00 0.00 172.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>FindNextGap</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="73.75,-19.25 0,-19.25 0,0 73.75,0 73.75,-19.25"/>
-<text text-anchor="middle" x="36.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">FindNextGap</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164,-19.25 109.75,-19.25 109.75,0 164,0 164,-19.25"/>
-<text text-anchor="middle" x="136.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.09,-9.62C81.84,-9.62 90.04,-9.62 97.86,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.79,-13.13 107.79,-9.63 97.79,-6.13 97.79,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/d9/dfd/comb__sort_8cpp_source.html b/d9/dfd/comb__sort_8cpp_source.html
new file mode 100644
index 000000000..86eee6da8
--- /dev/null
+++ b/d9/dfd/comb__sort_8cpp_source.html
@@ -0,0 +1,203 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/comb_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('d9/dfd/comb__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">comb_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../d9/dfd/comb__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="foldopen" id="foldopen00029" data-start="{" data-end="}">
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5">   29</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5">FindNextGap</a>(<span class="keywordtype">int</span> gap) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    gap = (gap * 10) / 13;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordflow">return</span> std::max(1, gap);</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>}</div>
+</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="foldopen" id="foldopen00042" data-start="{" data-end="}">
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f">   42</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f">CombSort</a>(<span class="keywordtype">int</span> *arr, <span class="keywordtype">int</span> l, <span class="keywordtype">int</span> r) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordtype">int</span> gap = r;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordtype">bool</span> swapped = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">while</span> (gap != 1 || swapped) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        gap = <a class="code hl_function" href="../../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5">FindNextGap</a>(gap);</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        swapped = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = l; i &lt; r - gap; ++i) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            <span class="keywordflow">if</span> (arr[i] &gt; arr[i + gap]) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>                std::swap(arr[i], arr[i + gap]);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>                swapped = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    }</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>}</div>
+</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="foldopen" id="foldopen00073" data-start="{" data-end="}">
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"><a class="line" href="../../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">   73</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>() {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="keywordtype">int</span> arr1[10] = {34, 56, 6, 23, 76, 34, 76, 343, 4, 76};</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <a class="code hl_function" href="../../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f">CombSort</a>(arr1, 0, 10);</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    assert(std::is_sorted(arr1, arr1 + 10));</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 passed\n&quot;</span>;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keywordtype">int</span> arr2[8] = {-6, 56, -45, 56, 0, -1, 8, 8};</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <a class="code hl_function" href="../../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f">CombSort</a>(arr2, 0, 8);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    assert(std::is_sorted(arr2, arr2 + 8));</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed\n&quot;</span>;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>}</div>
+</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="foldopen" id="foldopen00088" data-start="{" data-end="}">
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"><a class="line" href="../../d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   88</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <a class="code hl_function" href="../../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="keywordtype">int</span> n;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keywordtype">int</span> *arr = <span class="keyword">new</span> <span class="keywordtype">int</span>[n];</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) std::cin &gt;&gt; arr[i];</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <a class="code hl_function" href="../../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f">CombSort</a>(arr, 0, n);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) std::cout &lt;&lt; arr[i] &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="keyword">delete</span>[] arr;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>}</div>
+</div>
+<div class="ttc" id="acomb__sort_8cpp_html_a0f4e7569090083fb53d5cdeaf0e2974f"><div class="ttname"><a href="../../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f">CombSort</a></div><div class="ttdeci">void CombSort(int *arr, int l, int r)</div><div class="ttdef"><b>Definition</b> <a href="#l00042">comb_sort.cpp:42</a></div></div>
+<div class="ttc" id="acomb__sort_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="#l00073">comb_sort.cpp:73</a></div></div>
+<div class="ttc" id="acomb__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00088">comb_sort.cpp:88</a></div></div>
+<div class="ttc" id="acomb__sort_8cpp_html_aede08143e63105faba10e9ee8e745fd5"><div class="ttname"><a href="../../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5">FindNextGap</a></div><div class="ttdeci">int FindNextGap(int gap)</div><div class="ttdef"><b>Definition</b> <a href="#l00029">comb_sort.cpp:29</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../d9/dfd/comb__sort_8cpp.html">comb_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html
index 888c0d6af..283b08bbb 100644
--- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html
+++ b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -146,10 +163,10 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:abaff2ea6d309e1133fd95bbd1e39946e" id="r_abaff2ea6d309e1133fd95bbd1e39946e"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abaff2ea6d309e1133fd95bbd1e39946e">AyStarSearch</a> (const Puzzle &amp;initial, const Puzzle &amp;final)</td></tr>
 <tr class="memdesc:abaff2ea6d309e1133fd95bbd1e39946e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Parameterized constructor for <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html" title="A class defining A* search algorithm. for some initial state and final state.">AyStarSearch</a>.  <br /></td></tr>
 <tr class="separator:abaff2ea6d309e1133fd95bbd1e39946e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0a26aa9ad3d73707370d9fe83707aca4" id="r_a0a26aa9ad3d73707370d9fe83707aca4"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; Puzzle &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0a26aa9ad3d73707370d9fe83707aca4">Solution</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt; FinalState, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">MapOfPuzzleInfoWithPuzzleInfo</a> &amp;parent_of)</td></tr>
+<tr class="memitem:a0a26aa9ad3d73707370d9fe83707aca4" id="r_a0a26aa9ad3d73707370d9fe83707aca4"><td class="memItemLeft" align="right" valign="top">std::vector&lt; Puzzle &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0a26aa9ad3d73707370d9fe83707aca4">Solution</a> (std::shared_ptr&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt; FinalState, const MapOfPuzzleInfoWithPuzzleInfo &amp;parent_of)</td></tr>
 <tr class="memdesc:a0a26aa9ad3d73707370d9fe83707aca4"><td class="mdescLeft">&#160;</td><td class="mdescRight">A helper solution: launches when a solution for <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html" title="A class defining A* search algorithm. for some initial state and final state.">AyStarSearch</a> is found.  <br /></td></tr>
 <tr class="separator:a0a26aa9ad3d73707370d9fe83707aca4"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a48284e156fdd48fd0c41008c7e48f201" id="r_a48284e156fdd48fd0c41008c7e48f201"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; Puzzle &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a48284e156fdd48fd0c41008c7e48f201">a_star_search</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; uint32_t(const Puzzle &amp;, const Puzzle &amp;)&gt; &amp;dist, const uint32_t permissible_depth=30)</td></tr>
+<tr class="memitem:a48284e156fdd48fd0c41008c7e48f201" id="r_a48284e156fdd48fd0c41008c7e48f201"><td class="memItemLeft" align="right" valign="top">std::vector&lt; Puzzle &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a48284e156fdd48fd0c41008c7e48f201">a_star_search</a> (const std::function&lt; uint32_t(const Puzzle &amp;, const Puzzle &amp;)&gt; &amp;dist, const uint32_t permissible_depth=30)</td></tr>
 <tr class="separator:a48284e156fdd48fd0c41008c7e48f201"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-types" name="pri-types"></a>
@@ -161,11 +178,9 @@ typedef struct machine_learning::aystar_search::AyStarSearch::Info&#160;</td><td
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:ac11d62d01fac136efbd2bace6c55cea5" id="r_ac11d62d01fac136efbd2bace6c55cea5"><td class="memItemLeft" align="right" valign="top"><a id="ac11d62d01fac136efbd2bace6c55cea5" name="ac11d62d01fac136efbd2bace6c55cea5"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>Initial</b></td></tr>
+<tr class="memitem:ac11d62d01fac136efbd2bace6c55cea5" id="r_ac11d62d01fac136efbd2bace6c55cea5"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac11d62d01fac136efbd2bace6c55cea5">Initial</a></td></tr>
 <tr class="separator:ac11d62d01fac136efbd2bace6c55cea5"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a1686cbc0c50ae9e6f949b1e4b46be9ff" id="r_a1686cbc0c50ae9e6f949b1e4b46be9ff"><td class="memItemLeft" align="right" valign="top"><a id="a1686cbc0c50ae9e6f949b1e4b46be9ff" name="a1686cbc0c50ae9e6f949b1e4b46be9ff"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>Final</b></td></tr>
+<tr class="memitem:a1686cbc0c50ae9e6f949b1e4b46be9ff" id="r_a1686cbc0c50ae9e6f949b1e4b46be9ff"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1686cbc0c50ae9e6f949b1e4b46be9ff">Final</a></td></tr>
 <tr class="separator:a1686cbc0c50ae9e6f949b1e4b46be9ff"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -181,6 +196,8 @@ class machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;</div><p>A cl
 <li>For <code><a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html" title="A class defining A* search algorithm. for some initial state and final state.">AyStarSearch</a></code> to work, the definitions for template Puzzle is compulsory. a. Comparison operator for template Puzzle (<code>&lt;</code>, <code>==</code>, and <code>&lt;=</code>) b. <code>generate_possible_moves()</code> </li>
 </ol>
 </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00288">288</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 </div><h2 class="groupheader">Member Typedef Documentation</h2>
 <a id="a0c683b037f42e827a16420ce8bccfab9" name="a0c683b037f42e827a16420ce8bccfab9"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0c683b037f42e827a16420ce8bccfab9">&#9670;&#160;</a></span>MapOfPuzzleInfoWithInteger</h2>
@@ -196,9 +213,10 @@ template&lt;typename Puzzle &gt; </div>
       </table>
 </div><div class="memdoc">
 <b>Initial value:</b><div class="fragment"><div class="line"> </div>
-<div class="line">        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map&lt;std::shared_ptr&lt;Info&gt;</a>, uint32_t, comparison_operator&gt;</div>
-<div class="ttc" id="amap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a></div></div>
+<div class="line">        std::map&lt;std::shared_ptr&lt;Info&gt;, uint32_t, comparison_operator&gt;</div>
 </div><!-- fragment -->
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00382">382</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
+
 </div>
 </div>
 <a id="a9e0065bda9eeaa2247a32e89f326b9a8" name="a9e0065bda9eeaa2247a32e89f326b9a8"></a>
@@ -215,10 +233,11 @@ template&lt;typename Puzzle &gt; </div>
       </table>
 </div><div class="memdoc">
 <b>Initial value:</b><div class="fragment"><div class="line"> </div>
-<div class="line">        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map&lt;std::shared_ptr&lt;Info&gt;</a>, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Info&gt;</a>,</div>
+<div class="line">        std::map&lt;std::shared_ptr&lt;Info&gt;, std::shared_ptr&lt;Info&gt;,</div>
 <div class="line">                 comparison_operator&gt;</div>
-<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div></div>
 </div><!-- fragment -->
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00378">378</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
+
 </div>
 </div>
 <a id="ae8c3627dd2c94f297eb0fbbcad4ad101" name="ae8c3627dd2c94f297eb0fbbcad4ad101"></a>
@@ -235,9 +254,10 @@ template&lt;typename Puzzle &gt; </div>
       </table>
 </div><div class="memdoc">
 <b>Initial value:</b><div class="fragment"><div class="line"> </div>
-<div class="line">        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set.html">std::set&lt;std::shared_ptr&lt;Info&gt;</a>, comparison_operator&gt;</div>
-<div class="ttc" id="aset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set.html">std::set</a></div></div>
+<div class="line">        std::set&lt;std::shared_ptr&lt;Info&gt;, comparison_operator&gt;</div>
 </div><!-- fragment -->
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00385">385</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
+
 </div>
 </div>
 <h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
@@ -278,17 +298,13 @@ template&lt;typename Puzzle &gt; </div>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">  392</span>                                                             {</div>
-<div class="line"><span class="lineno">  393</span>        Initial = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;Info&gt;</a>(initial);</div>
-<div class="line"><span class="lineno">  394</span>        Final = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;Info&gt;</a>(<span class="keyword">final</span>);</div>
-<div class="line"><span class="lineno">  395</span>    }</div>
-<div class="ttc" id="amake_shared_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared</a></div><div class="ttdeci">T make_shared(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.svg" width="351" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00392">392</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  392</span>                                                             {</div>
+<div class="line"><span class="lineno">  393</span>        Initial = std::make_shared&lt;Info&gt;(initial);</div>
+<div class="line"><span class="lineno">  394</span>        Final = std::make_shared&lt;Info&gt;(<span class="keyword">final</span>);</div>
+<div class="line"><span class="lineno">  395</span>    }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Function Documentation</h2>
@@ -304,9 +320,9 @@ template&lt;typename Puzzle &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; Puzzle &gt; <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a>&lt; Puzzle &gt;::a_star_search </td>
+          <td class="memname">std::vector&lt; Puzzle &gt; <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a>&lt; Puzzle &gt;::a_star_search </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; uint32_t(const Puzzle &amp;, const Puzzle &amp;)&gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>dist</em></span>, </td>
+          <td class="paramtype">const std::function&lt; uint32_t(const Puzzle &amp;, const Puzzle &amp;)&gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>dist</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -332,12 +348,14 @@ template&lt;typename Puzzle &gt; </div>
 <p>Stores the g_score</p>
 <p>Stores the list to explore</p>
 <p>Stores the list that are explored</p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00429">429</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  431</span>                                               {</div>
 <div class="line"><span class="lineno">  432</span>        MapOfPuzzleInfoWithPuzzleInfo</div>
-<div class="line"><span class="lineno">  433</span>            parent_of;                       <span class="comment">/// Stores the parent of the states</span></div>
-<div class="line"><span class="lineno">  434</span>        MapOfPuzzleInfoWithInteger g_score;  <span class="comment">/// Stores the g_score</span></div>
-<div class="line"><span class="lineno">  435</span>        SetOfPuzzleInfo open_list;           <span class="comment">/// Stores the list to explore</span></div>
-<div class="line"><span class="lineno">  436</span>        SetOfPuzzleInfo closed_list;  <span class="comment">/// Stores the list that are explored</span></div>
+<div class="line"><span class="lineno">  433</span>            parent_of;                       </div>
+<div class="line"><span class="lineno">  434</span>        MapOfPuzzleInfoWithInteger g_score;  </div>
+<div class="line"><span class="lineno">  435</span>        SetOfPuzzleInfo open_list;           </div>
+<div class="line"><span class="lineno">  436</span>        SetOfPuzzleInfo closed_list;  </div>
 <div class="line"><span class="lineno">  437</span> </div>
 <div class="line"><span class="lineno">  438</span>        <span class="comment">// Before starting the AyStartSearch, initialize the set and maps</span></div>
 <div class="line"><span class="lineno">  439</span>        open_list.emplace(Initial);</div>
@@ -360,7 +378,7 @@ template&lt;typename Puzzle &gt; </div>
 <div class="line"><span class="lineno">  456</span>            }</div>
 <div class="line"><span class="lineno">  457</span> </div>
 <div class="line"><span class="lineno">  458</span>            <span class="comment">// current_state, stores lowest f score so far for this state.</span></div>
-<div class="line"><span class="lineno">  459</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Info&gt;</a> current_state = *it_low_f_score;</div>
+<div class="line"><span class="lineno">  459</span>            std::shared_ptr&lt;Info&gt; current_state = *it_low_f_score;</div>
 <div class="line"><span class="lineno">  460</span> </div>
 <div class="line"><span class="lineno">  461</span>            <span class="comment">// if this current state is equal to final, return</span></div>
 <div class="line"><span class="lineno">  462</span>            <span class="keywordflow">if</span> (*(current_state-&gt;state) == *(Final-&gt;state)) {</div>
@@ -375,13 +393,13 @@ template&lt;typename Puzzle &gt; </div>
 <div class="line"><span class="lineno">  471</span>            }</div>
 <div class="line"><span class="lineno">  472</span>            <span class="comment">// Generate all possible moves (neighbors) given the current</span></div>
 <div class="line"><span class="lineno">  473</span>            <span class="comment">// state</span></div>
-<div class="line"><span class="lineno">  474</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Puzzle&gt;</a> total_possible_moves =</div>
+<div class="line"><span class="lineno">  474</span>            std::vector&lt;Puzzle&gt; total_possible_moves =</div>
 <div class="line"><span class="lineno">  475</span>                current_state-&gt;state-&gt;generate_possible_moves();</div>
 <div class="line"><span class="lineno">  476</span> </div>
 <div class="line"><span class="lineno">  477</span>            <span class="keywordflow">for</span> (Puzzle &amp;neighbor : total_possible_moves) {</div>
 <div class="line"><span class="lineno">  478</span>                <span class="comment">// calculate score of neighbors with respect to</span></div>
 <div class="line"><span class="lineno">  479</span>                <span class="comment">// current_state</span></div>
-<div class="line"><span class="lineno">  480</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Info&gt;</a> Neighbor = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;Info&gt;</a>(</div>
+<div class="line"><span class="lineno">  480</span>                std::shared_ptr&lt;Info&gt; Neighbor = std::make_shared&lt;Info&gt;(</div>
 <div class="line"><span class="lineno">  481</span>                    neighbor, dist(neighbor, *(Final-&gt;state)),</div>
 <div class="line"><span class="lineno">  482</span>                    current_state-&gt;depth + 1U);</div>
 <div class="line"><span class="lineno">  483</span>                uint32_t temp_g_score = Neighbor-&gt;depth;</div>
@@ -425,16 +443,10 @@ template&lt;typename Puzzle &gt; </div>
 <div class="line"><span class="lineno">  521</span>            closed_list.emplace(current_state);</div>
 <div class="line"><span class="lineno">  522</span>        }</div>
 <div class="line"><span class="lineno">  523</span>        <span class="comment">// Cannot find the solution, return empty vector</span></div>
-<div class="line"><span class="lineno">  524</span>        <span class="keywordflow">return</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Puzzle&gt;</a>(0);</div>
+<div class="line"><span class="lineno">  524</span>        <span class="keywordflow">return</span> std::vector&lt;Puzzle&gt;(0);</div>
 <div class="line"><span class="lineno">  525</span>    }</div>
-<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_ay_star_search_html_a0a26aa9ad3d73707370d9fe83707aca4"><div class="ttname"><a href="#a0a26aa9ad3d73707370d9fe83707aca4">machine_learning::aystar_search::AyStarSearch::Solution</a></div><div class="ttdeci">std::vector&lt; Puzzle &gt; Solution(std::shared_ptr&lt; Info &gt; FinalState, const MapOfPuzzleInfoWithPuzzleInfo &amp;parent_of)</div><div class="ttdoc">A helper solution: launches when a solution for AyStarSearch is found.</div><div class="ttdef"><b>Definition</b> a_star_search.cpp:405</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.svg" width="615" height="515"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_ay_star_search_html_a0a26aa9ad3d73707370d9fe83707aca4"><div class="ttname"><a href="#a0a26aa9ad3d73707370d9fe83707aca4">machine_learning::aystar_search::AyStarSearch::Solution</a></div><div class="ttdeci">std::vector&lt; Puzzle &gt; Solution(std::shared_ptr&lt; Info &gt; FinalState, const MapOfPuzzleInfoWithPuzzleInfo &amp;parent_of)</div><div class="ttdoc">A helper solution: launches when a solution for AyStarSearch is found.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/dec/a__star__search_8cpp_source.html#l00405">a_star_search.cpp:405</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0a26aa9ad3d73707370d9fe83707aca4" name="a0a26aa9ad3d73707370d9fe83707aca4"></a>
@@ -449,14 +461,14 @@ template&lt;typename Puzzle &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; Puzzle &gt; <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a>&lt; Puzzle &gt;<a class="el" href="../../dd/d4f/class_solution.html">::Solution</a> </td>
+          <td class="memname">std::vector&lt; Puzzle &gt; <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a>&lt; Puzzle &gt;<a class="el" href="../../dd/d4f/class_solution.html">::Solution</a> </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt;</td>          <td class="paramname"><span class="paramname"><em>FinalState</em></span>, </td>
+          <td class="paramtype">std::shared_ptr&lt; <a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &gt;</td>          <td class="paramname"><span class="paramname"><em>FinalState</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">MapOfPuzzleInfoWithPuzzleInfo</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>parent_of</em></span>&#160;)</td>
+          <td class="paramtype">const MapOfPuzzleInfoWithPuzzleInfo &amp;</td>          <td class="paramname"><span class="paramname"><em>parent_of</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -475,6 +487,8 @@ template&lt;typename Puzzle &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the list of moves denoting moves from final state to initial state (in reverse) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00405">405</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  407</span>                                                        {</div>
 <div class="line"><span class="lineno">  408</span>        <span class="comment">//  Useful for traversing from final state to current state.</span></div>
 <div class="line"><span class="lineno">  409</span>        <span class="keyword">auto</span> current_state = FinalState;</div>
@@ -482,24 +496,71 @@ template&lt;typename Puzzle &gt; </div>
 <div class="line"><span class="lineno">  411</span><span class="comment">         * For storing the solution tree starting from initial state to</span></div>
 <div class="line"><span class="lineno">  412</span><span class="comment">         * final state</span></div>
 <div class="line"><span class="lineno">  413</span><span class="comment">         */</span></div>
-<div class="line"><span class="lineno">  414</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Puzzle&gt;</a> answer;</div>
+<div class="line"><span class="lineno">  414</span>        std::vector&lt;Puzzle&gt; answer;</div>
 <div class="line"><span class="lineno">  415</span>        <span class="keywordflow">while</span> (current_state != <span class="keyword">nullptr</span>) {</div>
-<div class="line"><span class="lineno">  416</span>            answer.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(*current_state-&gt;state);</div>
+<div class="line"><span class="lineno">  416</span>            answer.emplace_back(*current_state-&gt;state);</div>
 <div class="line"><span class="lineno">  417</span>            current_state = parent_of.find(current_state)-&gt;second;</div>
 <div class="line"><span class="lineno">  418</span>        }</div>
 <div class="line"><span class="lineno">  419</span>        <span class="keywordflow">return</span> answer;</div>
 <div class="line"><span class="lineno">  420</span>    }</div>
-<div class="ttc" id="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a0a26aa9ad3d73707370d9fe83707aca4_cgraph.svg" width="400" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a1686cbc0c50ae9e6f949b1e4b46be9ff" name="a1686cbc0c50ae9e6f949b1e4b46be9ff"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a1686cbc0c50ae9e6f949b1e4b46be9ff">&#9670;&#160;</a></span>Final</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename Puzzle &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::shared_ptr&lt;<a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a>&gt; <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a>&lt; Puzzle &gt;::Final</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00366">366</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ac11d62d01fac136efbd2bace6c55cea5" name="ac11d62d01fac136efbd2bace6c55cea5"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ac11d62d01fac136efbd2bace6c55cea5">&#9670;&#160;</a></span>Initial</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename Puzzle &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::shared_ptr&lt;<a class="el" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a>&gt; <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a>&lt; Puzzle &gt;::Initial</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00365">365</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>machine_learning/<b>a_star_search.cpp</b></li>
+<li>machine_learning/<a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a0a26aa9ad3d73707370d9fe83707aca4_cgraph.map b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a0a26aa9ad3d73707370d9fe83707aca4_cgraph.map
deleted file mode 100644
index 61407a9e7..000000000
--- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a0a26aa9ad3d73707370d9fe83707aca4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="machine_learning::aystar_search::AyStarSearch::Solution" name="machine_learning::aystar_search::AyStarSearch::Solution">
-<area shape="rect" id="Node000001" title="A helper solution: launches when a solution for AyStarSearch is found." alt="" coords="5,16,172,71"/>
-<area shape="rect" id="Node000002" 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="220,5,395,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="172,31,204,27,204,33,172,36"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/map/find.html#" title=" " alt="" coords="257,55,358,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="172,50,241,58,241,63,172,55"/>
-</map>
diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a0a26aa9ad3d73707370d9fe83707aca4_cgraph.md5 b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a0a26aa9ad3d73707370d9fe83707aca4_cgraph.md5
deleted file mode 100644
index aaa6ee913..000000000
--- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a0a26aa9ad3d73707370d9fe83707aca4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bddf2fcadc95f9d9711dde24e4a40d79
\ No newline at end of file
diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a0a26aa9ad3d73707370d9fe83707aca4_cgraph.svg b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a0a26aa9ad3d73707370d9fe83707aca4_cgraph.svg
deleted file mode 100644
index 5cbcb23e1..000000000
--- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a0a26aa9ad3d73707370d9fe83707aca4_cgraph.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::aystar_search::AyStarSearch::Solution Pages: 1 -->
-<svg width="300pt" height="64pt"
- viewBox="0.00 0.00 300.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>machine_learning::aystar_search::AyStarSearch::Solution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A helper solution: launches when a solution for AyStarSearch is found.">
-<polygon fill="#999999" stroke="#666666" points="124.75,-48.5 0,-48.5 0,-6.75 124.75,-6.75 124.75,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search::AyStarSearch::</text>
-<text text-anchor="middle" x="62.38" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">Solution</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.25,-56.25 160.75,-56.25 160.75,-37 292.25,-37 292.25,-56.25"/>
-<text text-anchor="middle" x="226.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.13,-34.86C132.98,-35.78 141.08,-36.73 149.12,-37.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.57,-41.13 158.91,-38.82 149.38,-34.18 148.57,-41.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.5,-19.25 188.5,-19.25 188.5,0 264.5,0 264.5,-19.25"/>
-<text text-anchor="middle" x="226.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.13,-20.77C142.27,-18.87 160.63,-16.83 176.9,-15.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.27,-18.5 186.82,-13.92 176.5,-11.54 177.27,-18.5"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a0a26aa9ad3d73707370d9fe83707aca4_cgraph_org.svg b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a0a26aa9ad3d73707370d9fe83707aca4_cgraph_org.svg
deleted file mode 100644
index 26db34c38..000000000
--- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a0a26aa9ad3d73707370d9fe83707aca4_cgraph_org.svg
+++ /dev/null
@@ -1,59 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::aystar_search::AyStarSearch::Solution Pages: 1 -->
-<svg width="300pt" height="64pt"
- viewBox="0.00 0.00 300.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>machine_learning::aystar_search::AyStarSearch::Solution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A helper solution: launches when a solution for AyStarSearch is found.">
-<polygon fill="#999999" stroke="#666666" points="124.75,-48.5 0,-48.5 0,-6.75 124.75,-6.75 124.75,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search::AyStarSearch::</text>
-<text text-anchor="middle" x="62.38" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">Solution</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.25,-56.25 160.75,-56.25 160.75,-37 292.25,-37 292.25,-56.25"/>
-<text text-anchor="middle" x="226.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.13,-34.86C132.98,-35.78 141.08,-36.73 149.12,-37.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.57,-41.13 158.91,-38.82 149.38,-34.18 148.57,-41.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.5,-19.25 188.5,-19.25 188.5,0 264.5,0 264.5,-19.25"/>
-<text text-anchor="middle" x="226.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.13,-20.77C142.27,-18.87 160.63,-16.83 176.9,-15.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.27,-18.5 186.82,-13.92 176.5,-11.54 177.27,-18.5"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.map b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.map
deleted file mode 100644
index deac0209a..000000000
--- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.map
+++ /dev/null
@@ -1,26 +0,0 @@
-<map id="machine_learning::aystar_search::AyStarSearch::a_star_search" name="machine_learning::aystar_search::AyStarSearch::a_star_search">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,213,172,269"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/set/begin.html#" title=" " alt="" coords="251,5,355,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="98,211,116,173,142,127,176,80,218,40,235,30,238,35,221,44,180,83,147,129,121,175,103,214"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/set/emplace.html#" title=" " alt="" coords="242,55,364,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="105,211,151,150,182,117,218,89,226,85,229,89,221,94,186,121,155,153,109,214"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/set/empty.html#" title=" " alt="" coords="248,104,358,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="118,211,163,173,218,138,232,132,234,137,221,143,167,178,121,215"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/map/end.html#" title=" " alt="" coords="252,153,354,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="159,210,219,188,238,181,240,186,221,193,160,215"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/set/end.html#" title=" " alt="" coords="256,203,350,228"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="172,228,240,220,240,225,173,234"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/set/erase.html#" title=" " alt="" coords="250,252,356,278"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="173,248,235,255,235,260,172,253"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/map/find.html#" title=" " alt="" coords="471,361,572,387"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="162,267,221,288,346,325,456,355,455,360,344,331,219,293,160,272"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/set/find.html#" title=" " alt="" coords="256,353,350,379"/>
-<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="126,267,170,300,221,332,249,345,247,350,218,337,167,304,122,271"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="240,403,366,428"/>
-<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="109,267,155,329,186,362,221,389,229,394,226,398,218,394,182,366,151,333,105,271"/>
-<area shape="rect" id="Node000011" href="$da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4" title="A helper solution: launches when a solution for AyStarSearch is found." alt="" coords="220,453,386,509"/>
-<area shape="poly" id="edge10_Node000001_Node000011" title=" " alt="" coords="104,268,149,351,182,397,222,439,225,442,221,446,218,443,178,401,145,354,100,270"/>
-<area shape="poly" id="edge12_Node000011_Node000008" title=" " alt="" coords="361,450,385,438,479,392,481,397,387,443,363,455"/>
-<area shape="rect" id="Node000012" 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="434,468,609,494"/>
-<area shape="poly" id="edge11_Node000011_Node000012" title=" " alt="" coords="387,478,418,478,418,484,387,484"/>
-</map>
diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.md5 b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.md5
deleted file mode 100644
index a7a53e0ee..000000000
--- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ea9374a8cfdd69dbb408d5db342f7f0e
\ No newline at end of file
diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.svg b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.svg
deleted file mode 100644
index 46e5d9112..000000000
--- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph.svg
+++ /dev/null
@@ -1,258 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::aystar_search::AyStarSearch::a_star_search Pages: 1 -->
-<svg width="461pt" height="386pt"
- viewBox="0.00 0.00 461.00 385.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 381.5)">
-<title>machine_learning::aystar_search::AyStarSearch::a_star_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124.75,-221.75 0,-221.75 0,-180 124.75,-180 124.75,-221.75"/>
-<text text-anchor="start" x="8" y="-208.25" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="start" x="8" y="-197" font-family="Helvetica,sans-Serif" font-size="10.00">_search::AyStarSearch::</text>
-<text text-anchor="middle" x="62.38" y="-185.75" font-family="Helvetica,sans-Serif" font-size="10.00">a_star_search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.25,-377.5 184,-377.5 184,-358.25 262.25,-358.25 262.25,-377.5"/>
-<text text-anchor="middle" x="223.12" y="-364" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.54,-222.09C85.1,-254.51 115.34,-316.17 160.75,-349.88 164.56,-352.7 168.81,-355.09 173.25,-357.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.81,-360.3 182.4,-360.61 174.32,-353.77 171.81,-360.3"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/emplace.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269,-340.5 177.25,-340.5 177.25,-321.25 269,-321.25 269,-340.5"/>
-<text text-anchor="middle" x="223.12" y="-327" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::emplace</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.18,-221.85C92.67,-247.11 123.66,-289.09 160.75,-312.88 162.61,-314.07 164.55,-315.18 166.54,-316.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.96,-319.35 175.52,-320.24 167.82,-312.96 164.96,-319.35"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.12,-303.5 182.12,-303.5 182.12,-284.25 264.12,-284.25 264.12,-303.5"/>
-<text text-anchor="middle" x="223.12" y="-290" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.72,-222.01C104.46,-238.72 132.6,-261.55 160.75,-275.88 164.02,-277.54 167.46,-279.07 170.98,-280.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.66,-283.72 180.25,-283.83 172.04,-277.14 169.66,-283.72"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="261.12,-266.5 185.12,-266.5 185.12,-247.25 261.12,-247.25 261.12,-266.5"/>
-<text text-anchor="middle" x="223.12" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.62,-222.23C130.14,-227.9 145.98,-233.84 160.75,-238.88 165.43,-240.47 170.34,-242.06 175.25,-243.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.9,-246.83 184.49,-246.39 175.94,-240.14 173.9,-246.83"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.5,-229.5 187.75,-229.5 187.75,-210.25 258.5,-210.25 258.5,-229.5"/>
-<text text-anchor="middle" x="223.12" y="-216" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.21,-208.28C142.16,-210.3 160.24,-212.47 176.13,-214.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.42,-217.81 185.77,-215.52 176.26,-210.86 175.42,-217.81"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.62,-192.5 183.62,-192.5 183.62,-173.25 262.62,-173.25 262.62,-192.5"/>
-<text text-anchor="middle" x="223.12" y="-179" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.21,-193.86C140.75,-192.1 157.23,-190.23 172.11,-188.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.09,-192.07 181.63,-187.47 171.3,-185.12 172.09,-192.07"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="425.25,-110.5 349.25,-110.5 349.25,-91.25 425.25,-91.25 425.25,-110.5"/>
-<text text-anchor="middle" x="387.25" y="-97" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.89,-179.54C131.06,-174.17 146.41,-168.59 160.75,-163.88 221.09,-144.03 291.78,-124.94 337.71,-113.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="338.55,-116.47 347.36,-110.6 336.81,-109.69 338.55,-116.47"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.5,-116.5 187.75,-116.5 187.75,-97.25 258.5,-97.25 258.5,-116.5"/>
-<text text-anchor="middle" x="223.12" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.06,-179.68C108.04,-164.71 134.96,-144.9 160.75,-130.88 167.37,-127.28 174.64,-123.94 181.8,-120.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.68,-124.39 190.7,-117.45 180.11,-117.88 182.68,-124.39"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.12,-79.5 176.12,-79.5 176.12,-60.25 270.12,-60.25 270.12,-79.5"/>
-<text text-anchor="middle" x="223.12" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.14,-179.71C92.58,-154.22 123.52,-111.86 160.75,-87.88 162.57,-86.7 164.47,-85.6 166.42,-84.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.52,-87.92 175.19,-80.61 164.63,-81.54 167.52,-87.92"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4" target="_top" xlink:title="A helper solution: launches when a solution for AyStarSearch is found.">
-<polygon fill="white" stroke="#666666" points="285.5,-41.75 160.75,-41.75 160.75,0 285.5,0 285.5,-41.75"/>
-<text text-anchor="start" x="168.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="start" x="168.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_search::AyStarSearch::</text>
-<text text-anchor="middle" x="223.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Solution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.6,-179.65C87.25,-148.02 118.56,-88.24 160.75,-50.88 161.53,-50.19 162.32,-49.51 163.13,-48.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.07,-51.76 171.13,-43.07 160.98,-46.09 165.07,-51.76"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node8 -->
-<g id="edge12_Node000011_Node000008" class="edge">
-<title>Node11&#45;&gt;Node8</title>
-<g id="a_edge12_Node000011_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.73,-42.15C273.7,-45.07 279.75,-48.05 285.5,-50.88 309.26,-62.58 336.12,-75.91 356.13,-85.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="354.33,-88.88 364.84,-90.2 357.45,-82.61 354.33,-88.88"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="453,-30.5 321.5,-30.5 321.5,-11.25 453,-11.25 453,-30.5"/>
-<text text-anchor="middle" x="387.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge11_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge11_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.88,-20.88C293.73,-20.88 301.83,-20.88 309.87,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.65,-24.38 319.65,-20.88 309.65,-17.38 309.65,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph_org.svg b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph_org.svg
deleted file mode 100644
index 50cc372ea..000000000
--- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_a48284e156fdd48fd0c41008c7e48f201_cgraph_org.svg
+++ /dev/null
@@ -1,232 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::aystar_search::AyStarSearch::a_star_search Pages: 1 -->
-<svg width="461pt" height="386pt"
- viewBox="0.00 0.00 461.00 385.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 381.5)">
-<title>machine_learning::aystar_search::AyStarSearch::a_star_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="124.75,-221.75 0,-221.75 0,-180 124.75,-180 124.75,-221.75"/>
-<text text-anchor="start" x="8" y="-208.25" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="start" x="8" y="-197" font-family="Helvetica,sans-Serif" font-size="10.00">_search::AyStarSearch::</text>
-<text text-anchor="middle" x="62.38" y="-185.75" font-family="Helvetica,sans-Serif" font-size="10.00">a_star_search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.25,-377.5 184,-377.5 184,-358.25 262.25,-358.25 262.25,-377.5"/>
-<text text-anchor="middle" x="223.12" y="-364" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.54,-222.09C85.1,-254.51 115.34,-316.17 160.75,-349.88 164.56,-352.7 168.81,-355.09 173.25,-357.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.81,-360.3 182.4,-360.61 174.32,-353.77 171.81,-360.3"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/emplace.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269,-340.5 177.25,-340.5 177.25,-321.25 269,-321.25 269,-340.5"/>
-<text text-anchor="middle" x="223.12" y="-327" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::emplace</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.18,-221.85C92.67,-247.11 123.66,-289.09 160.75,-312.88 162.61,-314.07 164.55,-315.18 166.54,-316.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.96,-319.35 175.52,-320.24 167.82,-312.96 164.96,-319.35"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.12,-303.5 182.12,-303.5 182.12,-284.25 264.12,-284.25 264.12,-303.5"/>
-<text text-anchor="middle" x="223.12" y="-290" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.72,-222.01C104.46,-238.72 132.6,-261.55 160.75,-275.88 164.02,-277.54 167.46,-279.07 170.98,-280.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.66,-283.72 180.25,-283.83 172.04,-277.14 169.66,-283.72"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="261.12,-266.5 185.12,-266.5 185.12,-247.25 261.12,-247.25 261.12,-266.5"/>
-<text text-anchor="middle" x="223.12" y="-253" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.62,-222.23C130.14,-227.9 145.98,-233.84 160.75,-238.88 165.43,-240.47 170.34,-242.06 175.25,-243.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.9,-246.83 184.49,-246.39 175.94,-240.14 173.9,-246.83"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.5,-229.5 187.75,-229.5 187.75,-210.25 258.5,-210.25 258.5,-229.5"/>
-<text text-anchor="middle" x="223.12" y="-216" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.21,-208.28C142.16,-210.3 160.24,-212.47 176.13,-214.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.42,-217.81 185.77,-215.52 176.26,-210.86 175.42,-217.81"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.62,-192.5 183.62,-192.5 183.62,-173.25 262.62,-173.25 262.62,-192.5"/>
-<text text-anchor="middle" x="223.12" y="-179" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.21,-193.86C140.75,-192.1 157.23,-190.23 172.11,-188.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.09,-192.07 181.63,-187.47 171.3,-185.12 172.09,-192.07"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="425.25,-110.5 349.25,-110.5 349.25,-91.25 425.25,-91.25 425.25,-110.5"/>
-<text text-anchor="middle" x="387.25" y="-97" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.89,-179.54C131.06,-174.17 146.41,-168.59 160.75,-163.88 221.09,-144.03 291.78,-124.94 337.71,-113.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="338.55,-116.47 347.36,-110.6 336.81,-109.69 338.55,-116.47"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/set/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.5,-116.5 187.75,-116.5 187.75,-97.25 258.5,-97.25 258.5,-116.5"/>
-<text text-anchor="middle" x="223.12" y="-103" font-family="Helvetica,sans-Serif" font-size="10.00">std::set::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.06,-179.68C108.04,-164.71 134.96,-144.9 160.75,-130.88 167.37,-127.28 174.64,-123.94 181.8,-120.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.68,-124.39 190.7,-117.45 180.11,-117.88 182.68,-124.39"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.12,-79.5 176.12,-79.5 176.12,-60.25 270.12,-60.25 270.12,-79.5"/>
-<text text-anchor="middle" x="223.12" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.14,-179.71C92.58,-154.22 123.52,-111.86 160.75,-87.88 162.57,-86.7 164.47,-85.6 166.42,-84.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.52,-87.92 175.19,-80.61 164.63,-81.54 167.52,-87.92"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4" target="_top" xlink:title="A helper solution: launches when a solution for AyStarSearch is found.">
-<polygon fill="white" stroke="#666666" points="285.5,-41.75 160.75,-41.75 160.75,0 285.5,0 285.5,-41.75"/>
-<text text-anchor="start" x="168.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="start" x="168.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_search::AyStarSearch::</text>
-<text text-anchor="middle" x="223.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Solution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.6,-179.65C87.25,-148.02 118.56,-88.24 160.75,-50.88 161.53,-50.19 162.32,-49.51 163.13,-48.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.07,-51.76 171.13,-43.07 160.98,-46.09 165.07,-51.76"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node8 -->
-<g id="edge12_Node000011_Node000008" class="edge">
-<title>Node11&#45;&gt;Node8</title>
-<g id="a_edge12_Node000011_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.73,-42.15C273.7,-45.07 279.75,-48.05 285.5,-50.88 309.26,-62.58 336.12,-75.91 356.13,-85.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="354.33,-88.88 364.84,-90.2 357.45,-82.61 354.33,-88.88"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="453,-30.5 321.5,-30.5 321.5,-11.25 453,-11.25 453,-30.5"/>
-<text text-anchor="middle" x="387.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge11_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge11_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.88,-20.88C293.73,-20.88 301.83,-20.88 309.87,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="309.65,-24.38 319.65,-20.88 309.65,-17.38 309.65,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.map b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.map
deleted file mode 100644
index fe25dbea2..000000000
--- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="machine_learning::aystar_search::AyStarSearch::AyStarSearch" name="machine_learning::aystar_search::AyStarSearch::AyStarSearch">
-<area shape="rect" id="Node000001" title="Parameterized constructor for AyStarSearch." alt="" coords="5,5,172,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="220,20,345,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="172,30,204,30,204,36,172,36"/>
-</map>
diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.md5 b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.md5
deleted file mode 100644
index aba8b815b..000000000
--- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d14d5243e43435e5f283d3393ac918e5
\ No newline at end of file
diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.svg b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.svg
deleted file mode 100644
index 11482b8cd..000000000
--- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::aystar_search::AyStarSearch::AyStarSearch Pages: 1 -->
-<svg width="263pt" height="50pt"
- viewBox="0.00 0.00 262.75 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>machine_learning::aystar_search::AyStarSearch::AyStarSearch</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Parameterized constructor for AyStarSearch.">
-<polygon fill="#999999" stroke="#666666" points="124.75,-41.75 0,-41.75 0,0 124.75,0 124.75,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_search::AyStarSearch::</text>
-<text text-anchor="middle" x="62.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">AyStarSearch</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-30.5 160.75,-30.5 160.75,-11.25 254.75,-11.25 254.75,-30.5"/>
-<text text-anchor="middle" x="207.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.01,-20.88C132.97,-20.88 141.09,-20.88 148.98,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.81,-24.38 158.81,-20.88 148.81,-17.38 148.81,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph_org.svg b/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph_org.svg
deleted file mode 100644
index d4bc10daf..000000000
--- a/da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search_abaff2ea6d309e1133fd95bbd1e39946e_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::aystar_search::AyStarSearch::AyStarSearch Pages: 1 -->
-<svg width="263pt" height="50pt"
- viewBox="0.00 0.00 262.75 49.75" 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.75)">
-<title>machine_learning::aystar_search::AyStarSearch::AyStarSearch</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Parameterized constructor for AyStarSearch.">
-<polygon fill="#999999" stroke="#666666" points="124.75,-41.75 0,-41.75 0,0 124.75,0 124.75,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_search::AyStarSearch::</text>
-<text text-anchor="middle" x="62.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">AyStarSearch</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-30.5 160.75,-30.5 160.75,-11.25 254.75,-11.25 254.75,-30.5"/>
-<text text-anchor="middle" x="207.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.01,-20.88C132.97,-20.88 141.09,-20.88 148.98,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.81,-24.38 158.81,-20.88 148.81,-17.38 148.81,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d0d/longest__common__string_8cpp.html b/da/d0d/longest__common__string_8cpp.html
index 5967c64cc..1329e1255 100644
--- a/da/d0d/longest__common__string_8cpp.html
+++ b/da/d0d/longest__common__string_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/longest_common_string.cpp File Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming/longest_common_string.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for longest_common_string.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d68/longest__common__string_8cpp__incl.svg" width="407" height="126"><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">
+</div>
+<p><a href="../../da/d0d/longest__common__string_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d86/struct_test_case.html">TestCase</a></td></tr>
@@ -132,10 +151,10 @@ Classes</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:aa38b6b17bc5d46ed88acdd8414e18fa5" id="r_aa38b6b17bc5d46ed88acdd8414e18fa5"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa38b6b17bc5d46ed88acdd8414e18fa5">longest_common_string_length</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;string_a, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;string_b)</td></tr>
+<tr class="memitem:aa38b6b17bc5d46ed88acdd8414e18fa5" id="r_aa38b6b17bc5d46ed88acdd8414e18fa5"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa38b6b17bc5d46ed88acdd8414e18fa5">longest_common_string_length</a> (const std::string &amp;string_a, const std::string &amp;string_b)</td></tr>
 <tr class="memdesc:aa38b6b17bc5d46ed88acdd8414e18fa5"><td class="mdescLeft">&#160;</td><td class="mdescRight">computes the length of the longest common string created from input strings  <br /></td></tr>
 <tr class="separator:aa38b6b17bc5d46ed88acdd8414e18fa5"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a967854a526bc15403d783a033155fc5c" id="r_a967854a526bc15403d783a033155fc5c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../da/d86/struct_test_case.html">TestCase</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a967854a526bc15403d783a033155fc5c">get_test_cases</a> ()</td></tr>
+<tr class="memitem:a967854a526bc15403d783a033155fc5c" id="r_a967854a526bc15403d783a033155fc5c"><td class="memItemLeft" align="right" valign="top">std::vector&lt; <a class="el" href="../../da/d86/struct_test_case.html">TestCase</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a967854a526bc15403d783a033155fc5c">get_test_cases</a> ()</td></tr>
 <tr class="separator:a967854a526bc15403d783a033155fc5c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a9b229daad982a186a4d8d90aa8f38561" id="r_a9b229daad982a186a4d8d90aa8f38561"><td class="memTemplParams" colspan="2">template&lt;typename <a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a> &gt; </td></tr>
 <tr class="memitem:a9b229daad982a186a4d8d90aa8f38561"><td class="memTemplItemLeft" align="right" valign="top">static void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a9b229daad982a186a4d8d90aa8f38561">test_longest_common_string_length</a> (const <a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a> &amp;test_cases)</td></tr>
@@ -145,7 +164,7 @@ Functions</h2></td></tr>
 <tr class="memitem:ad1e613c1b85cc04ed931b6c745fec155"><td class="memTemplItemLeft" align="right" valign="top">static void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ad1e613c1b85cc04ed931b6c745fec155">test_longest_common_string_length_is_symmetric</a> (const <a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a> &amp;test_cases)</td></tr>
 <tr class="memdesc:ad1e613c1b85cc04ed931b6c745fec155"><td class="mdescLeft">&#160;</td><td class="mdescRight">checks if the function <a class="el" href="#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> returns the same result when its argument are flipped  <br /></td></tr>
 <tr class="separator:ad1e613c1b85cc04ed931b6c745fec155"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:acb03dbbcee6d607db471021168be8541" id="r_acb03dbbcee6d607db471021168be8541"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acb03dbbcee6d607db471021168be8541">reverse_str</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;in_str)</td></tr>
+<tr class="memitem:acb03dbbcee6d607db471021168be8541" id="r_acb03dbbcee6d607db471021168be8541"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acb03dbbcee6d607db471021168be8541">reverse_str</a> (const std::string &amp;in_str)</td></tr>
 <tr class="memdesc:acb03dbbcee6d607db471021168be8541"><td class="mdescLeft">&#160;</td><td class="mdescRight">reverses a given string  <br /></td></tr>
 <tr class="separator:acb03dbbcee6d607db471021168be8541"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a23ab67b0d9600697695fc8679462d8fe" id="r_a23ab67b0d9600697695fc8679462d8fe"><td class="memTemplParams" colspan="2">template&lt;typename <a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a> &gt; </td></tr>
@@ -165,6 +184,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/nikhilarora068" target="_blank">Nikhil Arora</a> </dd>
 <dd>
 <a href="https://github.com/vil02" target="_blank">Piotr Idzik</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html">longest_common_string.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a967854a526bc15403d783a033155fc5c" name="a967854a526bc15403d783a033155fc5c"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a967854a526bc15403d783a033155fc5c">&#9670;&#160;</a></span>get_test_cases()</h2>
@@ -173,7 +194,7 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../da/d86/struct_test_case.html">TestCase</a> &gt; get_test_cases </td>
+          <td class="memname">std::vector&lt; <a class="el" href="../../da/d86/struct_test_case.html">TestCase</a> &gt; get_test_cases </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td></td>
@@ -181,6 +202,8 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <dl class="section return"><dt>Returns</dt><dd>example data used in the tests of <a class="el" href="#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html#l00069">69</a> of file <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html">longest_common_string.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   69</span>                                     {</div>
 <div class="line"><span class="lineno">   70</span>    <span class="keywordflow">return</span> {<a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;&quot;</span>, <span class="stringliteral">&quot;&quot;</span>, 0),</div>
 <div class="line"><span class="lineno">   71</span>            <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;ab&quot;</span>, <span class="stringliteral">&quot;ab&quot;</span>, 2),</div>
@@ -196,7 +219,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   81</span>            <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;x1x2x3x&quot;</span>, <span class="stringliteral">&quot;123&quot;</span>, 3),</div>
 <div class="line"><span class="lineno">   82</span>            <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;x12x3x&quot;</span>, <span class="stringliteral">&quot;123&quot;</span>, 3)};</div>
 <div class="line"><span class="lineno">   83</span>}</div>
-<div class="ttc" id="astruct_test_case_html"><div class="ttname"><a href="../../da/d86/struct_test_case.html">TestCase</a></div><div class="ttdoc">represents single example inputs and expected output of the function longest_common_string_length</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:54</div></div>
+<div class="ttc" id="astruct_test_case_html"><div class="ttname"><a href="../../da/d86/struct_test_case.html">TestCase</a></div><div class="ttdoc">represents single example inputs and expected output of the function longest_common_string_length</div><div class="ttdef"><b>Definition</b> <a href="../../da/d0d/longest__common__string_8cpp_source.html#l00054">longest_common_string.cpp:54</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -207,20 +230,20 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> longest_common_string_length </td>
+          <td class="memname">std::size_t longest_common_string_length </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>string_a</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>string_a</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>string_b</em></span>&#160;)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>string_b</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
 
 <p>computes the length of the longest common string created from input strings </p>
-<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>for assert for std::cout for std::string for std::move for std::vector</p>
 <p>has O(str_a.size()*str_b.size()) time and memory complexity </p><dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramname">string_a</td><td>first input string </td></tr>
@@ -229,19 +252,21 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the length of the longest common string which can be strated from str_a and str_b </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html">longest_common_string.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   29</span>                                                                    {</div>
-<div class="line"><span class="lineno">   30</span>    <span class="keyword">const</span> <span class="keyword">auto</span> size_a = string_a.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
-<div class="line"><span class="lineno">   31</span>    <span class="keyword">const</span> <span class="keyword">auto</span> size_b = string_b.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
-<div class="line"><span class="lineno">   32</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::size_t&gt;</a>&gt; sub_sols(</div>
-<div class="line"><span class="lineno">   33</span>        size_a + 1, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::size_t&gt;</a>(size_b + 1, 0));</div>
+<div class="line"><span class="lineno">   30</span>    <span class="keyword">const</span> <span class="keyword">auto</span> size_a = string_a.size();</div>
+<div class="line"><span class="lineno">   31</span>    <span class="keyword">const</span> <span class="keyword">auto</span> size_b = string_b.size();</div>
+<div class="line"><span class="lineno">   32</span>    std::vector&lt;std::vector&lt;std::size_t&gt;&gt; sub_sols(</div>
+<div class="line"><span class="lineno">   33</span>        size_a + 1, std::vector&lt;std::size_t&gt;(size_b + 1, 0));</div>
 <div class="line"><span class="lineno">   34</span> </div>
-<div class="line"><span class="lineno">   35</span>    <span class="keyword">const</span> <span class="keyword">auto</span> limit = <span class="keyword">static_cast&lt;</span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a><span class="keyword">&gt;</span>(-1);</div>
-<div class="line"><span class="lineno">   36</span>    <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> pos_a = size_a - 1; pos_a != limit; --pos_a) {</div>
-<div class="line"><span class="lineno">   37</span>        <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> pos_b = size_b - 1; pos_b != limit; --pos_b) {</div>
+<div class="line"><span class="lineno">   35</span>    <span class="keyword">const</span> <span class="keyword">auto</span> limit = <span class="keyword">static_cast&lt;</span>std::size_t<span class="keyword">&gt;</span>(-1);</div>
+<div class="line"><span class="lineno">   36</span>    <span class="keywordflow">for</span> (std::size_t pos_a = size_a - 1; pos_a != limit; --pos_a) {</div>
+<div class="line"><span class="lineno">   37</span>        <span class="keywordflow">for</span> (std::size_t pos_b = size_b - 1; pos_b != limit; --pos_b) {</div>
 <div class="line"><span class="lineno">   38</span>            <span class="keywordflow">if</span> (string_a[pos_a] == string_b[pos_b]) {</div>
 <div class="line"><span class="lineno">   39</span>                sub_sols[pos_a][pos_b] = 1 + sub_sols[pos_a + 1][pos_b + 1];</div>
 <div class="line"><span class="lineno">   40</span>            } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   41</span>                sub_sols[pos_a][pos_b] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(sub_sols[pos_a + 1][pos_b],</div>
+<div class="line"><span class="lineno">   41</span>                sub_sols[pos_a][pos_b] = std::max(sub_sols[pos_a + 1][pos_b],</div>
 <div class="line"><span class="lineno">   42</span>                                                  sub_sols[pos_a][pos_b + 1]);</div>
 <div class="line"><span class="lineno">   43</span>            }</div>
 <div class="line"><span class="lineno">   44</span>        }</div>
@@ -249,16 +274,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   46</span> </div>
 <div class="line"><span class="lineno">   47</span>    <span class="keywordflow">return</span> sub_sols[0][0];</div>
 <div class="line"><span class="lineno">   48</span>}</div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-<div class="ttc" id="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph.svg" width="330" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -278,17 +294,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html#l00156">156</a> of file <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html">longest_common_string.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  156</span>           {</div>
 <div class="line"><span class="lineno">  157</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();</div>
 <div class="line"><span class="lineno">  158</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  159</span>}</div>
-<div class="ttc" id="alongest__common__string_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">runs all tests for longest_common_string_length funcion</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:142</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="505"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="alongest__common__string_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">runs all tests for longest_common_string_length funcion</div><div class="ttdef"><b>Definition</b> <a href="../../da/d0d/longest__common__string_8cpp_source.html#l00142">longest_common_string.cpp:142</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="acb03dbbcee6d607db471021168be8541" name="acb03dbbcee6d607db471021168be8541"></a>
@@ -298,9 +311,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> reverse_str </td>
+          <td class="memname">std::string reverse_str </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>in_str</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>in_str</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -314,17 +327,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the string in which the characters appear in the reversed order as in in_str </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  119</span>                                               {</div>
-<div class="line"><span class="lineno">  120</span>    <span class="keywordflow">return</span> {in_str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html">rbegin</a>(), in_str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html">rend</a>()};</div>
-<div class="line"><span class="lineno">  121</span>}</div>
-<div class="ttc" id="arbegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html">std::string::rbegin</a></div><div class="ttdeci">T rbegin(T... args)</div></div>
-<div class="ttc" id="arend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html">std::string::rend</a></div><div class="ttdeci">T rend(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph.svg" width="268" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html#l00119">119</a> of file <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html">longest_common_string.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  119</span>                                               {</div>
+<div class="line"><span class="lineno">  120</span>    <span class="keywordflow">return</span> {in_str.rbegin(), in_str.rend()};</div>
+<div class="line"><span class="lineno">  121</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a9b229daad982a186a4d8d90aa8f38561" name="a9b229daad982a186a4d8d90aa8f38561"></a>
@@ -365,19 +373,16 @@ template&lt;typename <a class="el" href="../../d5/d58/class_test_cases.html">Tes
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html#l00091">91</a> of file <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html">longest_common_string.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   91</span>                                                                           {</div>
 <div class="line"><span class="lineno">   92</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; cur_tc : test_cases) {</div>
 <div class="line"><span class="lineno">   93</span>        assert(<a class="code hl_function" href="#aa38b6b17bc5d46ed88acdd8414e18fa5">longest_common_string_length</a>(cur_tc.string_a, cur_tc.string_b) ==</div>
 <div class="line"><span class="lineno">   94</span>               cur_tc.common_string_len);</div>
 <div class="line"><span class="lineno">   95</span>    }</div>
 <div class="line"><span class="lineno">   96</span>}</div>
-<div class="ttc" id="alongest__common__string_8cpp_html_aa38b6b17bc5d46ed88acdd8414e18fa5"><div class="ttname"><a href="#aa38b6b17bc5d46ed88acdd8414e18fa5">longest_common_string_length</a></div><div class="ttdeci">std::size_t longest_common_string_length(const std::string &amp;string_a, const std::string &amp;string_b)</div><div class="ttdoc">computes the length of the longest common string created from input strings</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:28</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph.svg" width="527" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="alongest__common__string_8cpp_html_aa38b6b17bc5d46ed88acdd8414e18fa5"><div class="ttname"><a href="#aa38b6b17bc5d46ed88acdd8414e18fa5">longest_common_string_length</a></div><div class="ttdeci">std::size_t longest_common_string_length(const std::string &amp;string_a, const std::string &amp;string_b)</div><div class="ttdoc">computes the length of the longest common string created from input strings</div><div class="ttdef"><b>Definition</b> <a href="../../da/d0d/longest__common__string_8cpp_source.html#l00028">longest_common_string.cpp:28</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a23ab67b0d9600697695fc8679462d8fe" name="a23ab67b0d9600697695fc8679462d8fe"></a>
@@ -418,6 +423,8 @@ template&lt;typename <a class="el" href="../../d5/d58/class_test_cases.html">Tes
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html#l00130">130</a> of file <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html">longest_common_string.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  131</span>                                 {</div>
 <div class="line"><span class="lineno">  132</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; cur_tc : test_cases) {</div>
 <div class="line"><span class="lineno">  133</span>        assert(<a class="code hl_function" href="#aa38b6b17bc5d46ed88acdd8414e18fa5">longest_common_string_length</a>(<a class="code hl_function" href="#acb03dbbcee6d607db471021168be8541">reverse_str</a>(cur_tc.string_a),</div>
@@ -425,13 +432,8 @@ template&lt;typename <a class="el" href="../../d5/d58/class_test_cases.html">Tes
 <div class="line"><span class="lineno">  135</span>               cur_tc.common_string_len);</div>
 <div class="line"><span class="lineno">  136</span>    }</div>
 <div class="line"><span class="lineno">  137</span>}</div>
-<div class="ttc" id="alongest__common__string_8cpp_html_acb03dbbcee6d607db471021168be8541"><div class="ttname"><a href="#acb03dbbcee6d607db471021168be8541">reverse_str</a></div><div class="ttdeci">std::string reverse_str(const std::string &amp;in_str)</div><div class="ttdoc">reverses a given string</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:119</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.svg" width="570" height="188"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="alongest__common__string_8cpp_html_acb03dbbcee6d607db471021168be8541"><div class="ttname"><a href="#acb03dbbcee6d607db471021168be8541">reverse_str</a></div><div class="ttdeci">std::string reverse_str(const std::string &amp;in_str)</div><div class="ttdoc">reverses a given string</div><div class="ttdef"><b>Definition</b> <a href="../../da/d0d/longest__common__string_8cpp_source.html#l00119">longest_common_string.cpp:119</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad1e613c1b85cc04ed931b6c745fec155" name="ad1e613c1b85cc04ed931b6c745fec155"></a>
@@ -472,18 +474,15 @@ template&lt;typename <a class="el" href="../../d5/d58/class_test_cases.html">Tes
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html#l00105">105</a> of file <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html">longest_common_string.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  106</span>                                 {</div>
 <div class="line"><span class="lineno">  107</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; cur_tc : test_cases) {</div>
 <div class="line"><span class="lineno">  108</span>        assert(<a class="code hl_function" href="#aa38b6b17bc5d46ed88acdd8414e18fa5">longest_common_string_length</a>(cur_tc.string_b, cur_tc.string_a) ==</div>
 <div class="line"><span class="lineno">  109</span>               cur_tc.common_string_len);</div>
 <div class="line"><span class="lineno">  110</span>    }</div>
 <div class="line"><span class="lineno">  111</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph.svg" width="566" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -510,6 +509,8 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>runs all tests for <a class="el" href="#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> funcion </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html#l00142">142</a> of file <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html">longest_common_string.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  142</span>                    {</div>
 <div class="line"><span class="lineno">  143</span>    <span class="keyword">const</span> <span class="keyword">auto</span> test_cases = <a class="code hl_function" href="#a967854a526bc15403d783a033155fc5c">get_test_cases</a>();</div>
 <div class="line"><span class="lineno">  144</span>    assert(test_cases.size() &gt; 0);</div>
@@ -517,19 +518,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  146</span>    <a class="code hl_function" href="#ad1e613c1b85cc04ed931b6c745fec155">test_longest_common_string_length_is_symmetric</a>(test_cases);</div>
 <div class="line"><span class="lineno">  147</span>    <a class="code hl_function" href="#a23ab67b0d9600697695fc8679462d8fe">test_longest_common_string_length_for_reversed_inputs</a>(test_cases);</div>
 <div class="line"><span class="lineno">  148</span> </div>
-<div class="line"><span class="lineno">  149</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  149</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  150</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="alongest__common__string_8cpp_html_a23ab67b0d9600697695fc8679462d8fe"><div class="ttname"><a href="#a23ab67b0d9600697695fc8679462d8fe">test_longest_common_string_length_for_reversed_inputs</a></div><div class="ttdeci">static void test_longest_common_string_length_for_reversed_inputs(const TestCases &amp;test_cases)</div><div class="ttdoc">checks if the function longest_common_string_length returns the same result when its inputs are rever...</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:130</div></div>
-<div class="ttc" id="alongest__common__string_8cpp_html_a967854a526bc15403d783a033155fc5c"><div class="ttname"><a href="#a967854a526bc15403d783a033155fc5c">get_test_cases</a></div><div class="ttdeci">std::vector&lt; TestCase &gt; get_test_cases()</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:69</div></div>
-<div class="ttc" id="alongest__common__string_8cpp_html_a9b229daad982a186a4d8d90aa8f38561"><div class="ttname"><a href="#a9b229daad982a186a4d8d90aa8f38561">test_longest_common_string_length</a></div><div class="ttdeci">static void test_longest_common_string_length(const TestCases &amp;test_cases)</div><div class="ttdoc">checks the function longest_common_string_length agains example data</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:91</div></div>
-<div class="ttc" id="alongest__common__string_8cpp_html_ad1e613c1b85cc04ed931b6c745fec155"><div class="ttname"><a href="#ad1e613c1b85cc04ed931b6c745fec155">test_longest_common_string_length_is_symmetric</a></div><div class="ttdeci">static void test_longest_common_string_length_is_symmetric(const TestCases &amp;test_cases)</div><div class="ttdoc">checks if the function longest_common_string_length returns the same result when its argument are fli...</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:105</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="100%" height="505"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="alongest__common__string_8cpp_html_a23ab67b0d9600697695fc8679462d8fe"><div class="ttname"><a href="#a23ab67b0d9600697695fc8679462d8fe">test_longest_common_string_length_for_reversed_inputs</a></div><div class="ttdeci">static void test_longest_common_string_length_for_reversed_inputs(const TestCases &amp;test_cases)</div><div class="ttdoc">checks if the function longest_common_string_length returns the same result when its inputs are rever...</div><div class="ttdef"><b>Definition</b> <a href="../../da/d0d/longest__common__string_8cpp_source.html#l00130">longest_common_string.cpp:130</a></div></div>
+<div class="ttc" id="alongest__common__string_8cpp_html_a967854a526bc15403d783a033155fc5c"><div class="ttname"><a href="#a967854a526bc15403d783a033155fc5c">get_test_cases</a></div><div class="ttdeci">std::vector&lt; TestCase &gt; get_test_cases()</div><div class="ttdef"><b>Definition</b> <a href="../../da/d0d/longest__common__string_8cpp_source.html#l00069">longest_common_string.cpp:69</a></div></div>
+<div class="ttc" id="alongest__common__string_8cpp_html_a9b229daad982a186a4d8d90aa8f38561"><div class="ttname"><a href="#a9b229daad982a186a4d8d90aa8f38561">test_longest_common_string_length</a></div><div class="ttdeci">static void test_longest_common_string_length(const TestCases &amp;test_cases)</div><div class="ttdoc">checks the function longest_common_string_length agains example data</div><div class="ttdef"><b>Definition</b> <a href="../../da/d0d/longest__common__string_8cpp_source.html#l00091">longest_common_string.cpp:91</a></div></div>
+<div class="ttc" id="alongest__common__string_8cpp_html_ad1e613c1b85cc04ed931b6c745fec155"><div class="ttname"><a href="#ad1e613c1b85cc04ed931b6c745fec155">test_longest_common_string_length_is_symmetric</a></div><div class="ttdeci">static void test_longest_common_string_length_is_symmetric(const TestCases &amp;test_cases)</div><div class="ttdoc">checks if the function longest_common_string_length returns the same result when its argument are fli...</div><div class="ttdef"><b>Definition</b> <a href="../../da/d0d/longest__common__string_8cpp_source.html#l00105">longest_common_string.cpp:105</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.map b/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.map
deleted file mode 100644
index 88437e457..000000000
--- a/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="test_longest_common_string_length_for_reversed_inputs" name="test_longest_common_string_length_for_reversed_inputs">
-<area shape="rect" id="Node000001" title="checks if the function longest_common_string_length returns the same result when its inputs are rever..." alt="" coords="5,68,187,123"/>
-<area shape="rect" id="Node000002" href="$da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings" alt="" coords="235,46,394,86"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="187,81,219,76,219,82,187,86"/>
-<area shape="rect" id="Node000005" href="$da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541" title="reverses a given string" alt="" coords="271,111,358,136"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="187,104,257,113,256,119,187,110"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="467,5,539,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="394,43,451,28,453,34,395,48"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="448,55,559,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="395,64,432,64,432,70,395,69"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/rbegin.html#" title=" " alt="" coords="442,108,564,134"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="358,120,426,119,426,125,358,126"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/rend.html#" title=" " alt="" coords="447,157,559,183"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="359,132,434,150,433,156,357,137"/>
-</map>
diff --git a/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.md5 b/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.md5
deleted file mode 100644
index a2e1d74b6..000000000
--- a/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-316158dbc79b6fd882f0a06cff88034a
\ No newline at end of file
diff --git a/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.svg b/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.svg
deleted file mode 100644
index 4b271d117..000000000
--- a/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.svg
+++ /dev/null
@@ -1,158 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_longest_common_string_length_for_reversed_inputs Pages: 1 -->
-<svg width="427pt" height="141pt"
- viewBox="0.00 0.00 427.25 141.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 137.25)">
-<title>test_longest_common_string_length_for_reversed_inputs</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="checks if the function longest_common_string_length returns the same result when its inputs are rever...">
-<polygon fill="#999999" stroke="#666666" points="136,-86.5 0,-86.5 0,-44.75 136,-44.75 136,-86.5"/>
-<text text-anchor="start" x="8" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
-<text text-anchor="start" x="8" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_for_reversed</text>
-<text text-anchor="middle" x="68" y="-50.5" font-family="Helvetica,sans-Serif" font-size="10.00">_inputs</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="computes the length of the longest common string created from input strings">
-<polygon fill="white" stroke="#666666" points="291.5,-102.88 172,-102.88 172,-72.38 291.5,-72.38 291.5,-102.88"/>
-<text text-anchor="start" x="180" y="-89.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
-<text text-anchor="middle" x="231.75" y="-78.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.19,-74.76C144.16,-75.85 152.3,-76.96 160.31,-78.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.63,-81.48 170.01,-79.36 160.57,-74.55 159.63,-81.48"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541" target="_top" xlink:title="reverses a given string">
-<polygon fill="white" stroke="#666666" points="264.12,-54.25 199.38,-54.25 199.38,-35 264.12,-35 264.12,-54.25"/>
-<text text-anchor="middle" x="231.75" y="-40.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_str</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.19,-56.9C153.79,-54.62 172.28,-52.22 188.2,-50.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.32,-53.66 197.78,-48.91 187.42,-46.72 188.32,-53.66"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.5,-133.25 346.25,-133.25 346.25,-114 400.5,-114 400.5,-133.25"/>
-<text text-anchor="middle" x="373.38" y="-119.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M291.96,-102.89C306.57,-106.66 321.8,-110.59 335.03,-114"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.06,-117.36 344.61,-116.47 335.8,-110.58 334.06,-117.36"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415.12,-96.25 331.62,-96.25 331.62,-77 415.12,-77 415.12,-96.25"/>
-<text text-anchor="middle" x="373.38" y="-82.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M291.96,-87.2C301.27,-87.13 310.83,-87.07 319.96,-87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="319.76,-90.5 329.74,-86.93 319.71,-83.5 319.76,-90.5"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="419.25,-56.25 327.5,-56.25 327.5,-37 419.25,-37 419.25,-56.25"/>
-<text text-anchor="middle" x="373.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rbegin</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.43,-45.08C279.61,-45.3 298.26,-45.56 315.76,-45.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.49,-49.31 325.54,-45.95 315.59,-42.31 315.49,-49.31"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415.5,-19.25 331.25,-19.25 331.25,0 415.5,0 415.5,-19.25"/>
-<text text-anchor="middle" x="373.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rend</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.43,-36.68C281.18,-32.48 302.15,-27.23 321.14,-22.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="321.73,-25.93 330.58,-20.1 320.03,-19.14 321.73,-25.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph_org.svg b/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph_org.svg
deleted file mode 100644
index 5d493cee0..000000000
--- a/da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph_org.svg
+++ /dev/null
@@ -1,132 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_longest_common_string_length_for_reversed_inputs Pages: 1 -->
-<svg width="427pt" height="141pt"
- viewBox="0.00 0.00 427.25 141.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 137.25)">
-<title>test_longest_common_string_length_for_reversed_inputs</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="checks if the function longest_common_string_length returns the same result when its inputs are rever...">
-<polygon fill="#999999" stroke="#666666" points="136,-86.5 0,-86.5 0,-44.75 136,-44.75 136,-86.5"/>
-<text text-anchor="start" x="8" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
-<text text-anchor="start" x="8" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_for_reversed</text>
-<text text-anchor="middle" x="68" y="-50.5" font-family="Helvetica,sans-Serif" font-size="10.00">_inputs</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="computes the length of the longest common string created from input strings">
-<polygon fill="white" stroke="#666666" points="291.5,-102.88 172,-102.88 172,-72.38 291.5,-72.38 291.5,-102.88"/>
-<text text-anchor="start" x="180" y="-89.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
-<text text-anchor="middle" x="231.75" y="-78.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.19,-74.76C144.16,-75.85 152.3,-76.96 160.31,-78.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.63,-81.48 170.01,-79.36 160.57,-74.55 159.63,-81.48"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541" target="_top" xlink:title="reverses a given string">
-<polygon fill="white" stroke="#666666" points="264.12,-54.25 199.38,-54.25 199.38,-35 264.12,-35 264.12,-54.25"/>
-<text text-anchor="middle" x="231.75" y="-40.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_str</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.19,-56.9C153.79,-54.62 172.28,-52.22 188.2,-50.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.32,-53.66 197.78,-48.91 187.42,-46.72 188.32,-53.66"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.5,-133.25 346.25,-133.25 346.25,-114 400.5,-114 400.5,-133.25"/>
-<text text-anchor="middle" x="373.38" y="-119.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M291.96,-102.89C306.57,-106.66 321.8,-110.59 335.03,-114"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.06,-117.36 344.61,-116.47 335.8,-110.58 334.06,-117.36"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415.12,-96.25 331.62,-96.25 331.62,-77 415.12,-77 415.12,-96.25"/>
-<text text-anchor="middle" x="373.38" y="-82.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M291.96,-87.2C301.27,-87.13 310.83,-87.07 319.96,-87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="319.76,-90.5 329.74,-86.93 319.71,-83.5 319.76,-90.5"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="419.25,-56.25 327.5,-56.25 327.5,-37 419.25,-37 419.25,-56.25"/>
-<text text-anchor="middle" x="373.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rbegin</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.43,-45.08C279.61,-45.3 298.26,-45.56 315.76,-45.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.49,-49.31 325.54,-45.95 315.59,-42.31 315.49,-49.31"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415.5,-19.25 331.25,-19.25 331.25,0 415.5,0 415.5,-19.25"/>
-<text text-anchor="middle" x="373.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rend</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.43,-36.68C281.18,-32.48 302.15,-27.23 321.14,-22.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="321.73,-25.93 330.58,-20.1 320.03,-19.14 321.73,-25.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index e239e213d..000000000
--- a/da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,25 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="runs all tests for longest_common_string_length funcion" alt="" coords="5,96,56,122"/>
-<area shape="rect" id="Node000002" href="$da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c" title=" " alt="" coords="142,5,252,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="41,94,67,67,102,41,126,31,128,36,105,46,70,71,45,98"/>
-<area shape="rect" id="Node000003" href="$da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561" title="checks the function longest_common_string_length agains example data" alt="" coords="123,55,272,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,101,107,91,108,96,57,107"/>
-<area shape="rect" id="Node000007" href="$da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe" title="checks if the function longest_common_string_length returns the same result when its inputs are rever..." alt="" coords="107,185,288,241"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="46,120,72,145,105,171,113,175,110,180,102,175,69,149,42,124"/>
-<area shape="rect" id="Node000011" href="$da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155" title="checks if the function longest_common_string_length returns the same result when its argument are fli..." alt="" coords="104,120,291,161"/>
-<area shape="poly" id="edge11_Node000001_Node000011" title=" " alt="" coords="57,111,89,117,88,122,56,116"/>
-<area shape="rect" id="Node000004" href="$da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings" alt="" coords="339,120,498,161"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="269,94,333,113,332,118,268,99"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="571,84,644,110"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="498,120,556,106,557,111,500,125"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="552,133,663,159"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="499,140,536,141,536,147,499,146"/>
-<area shape="poly" id="edge7_Node000007_Node000004" title=" " alt="" coords="284,182,339,164,340,169,286,187"/>
-<area shape="rect" id="Node000008" href="$da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541" title="reverses a given string" alt="" coords="376,200,462,226"/>
-<area shape="poly" id="edge8_Node000007_Node000008" title=" " alt="" coords="288,210,360,210,360,216,288,216"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/rbegin.html#" title=" " alt="" coords="546,193,669,219"/>
-<area shape="poly" id="edge9_Node000008_Node000009" title=" " alt="" coords="462,209,531,206,531,212,462,214"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/rend.html#" title=" " alt="" coords="551,243,664,268"/>
-<area shape="poly" id="edge10_Node000008_Node000010" title=" " alt="" coords="463,220,537,237,536,242,462,225"/>
-<area shape="poly" id="edge12_Node000011_Node000004" title=" " alt="" coords="291,138,323,138,323,144,291,144"/>
-</map>
diff --git a/da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 182c16f46..000000000
--- a/da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ad88c3fa0cc0641fbc18f2e1421bf422
\ No newline at end of file
diff --git a/da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index a00cf4175..000000000
--- a/da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,307 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<!--zoomable 205 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 506;
-var viewHeight = 205;
-var sectionId = 'dynsection-7';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="runs all tests for longest_common_string_length funcion">
-<polygon fill="#999999" stroke="#666666" points="37.75,-129.25 0,-129.25 0,-110 37.75,-110 37.75,-129.25"/>
-<text text-anchor="middle" x="18.88" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="185.38,-197.25 102.62,-197.25 102.62,-178 185.38,-178 185.38,-197.25"/>
-<text text-anchor="middle" x="144" y="-183.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_test_cases</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28,-129.39C37.75,-140.48 55.14,-158.39 73.75,-168.62 79.21,-171.63 85.18,-174.18 91.25,-176.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.17,-179.68 100.76,-179.39 92.3,-173.01 90.17,-179.68"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561" target="_top" xlink:title="checks the function longest_common_string_length agains example data">
-<polygon fill="white" stroke="#666666" points="200,-159.88 88,-159.88 88,-129.38 200,-129.38 200,-159.88"/>
-<text text-anchor="start" x="96" y="-146.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
-<text text-anchor="middle" x="144" y="-135.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.04,-123.31C48.54,-125.45 62.47,-128.27 76.74,-131.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.68,-134.53 86.18,-133.09 77.08,-127.67 75.68,-134.53"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe" target="_top" xlink:title="checks if the function longest_common_string_length returns the same result when its inputs are rever...">
-<polygon fill="white" stroke="#666666" points="212,-62.5 76,-62.5 76,-20.75 212,-20.75 212,-62.5"/>
-<text text-anchor="start" x="84" y="-49" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
-<text text-anchor="start" x="84" y="-37.75" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_for_reversed</text>
-<text text-anchor="middle" x="144" y="-26.5" font-family="Helvetica,sans-Serif" font-size="10.00">_inputs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.04,-109.77C39.19,-99.27 56.43,-82.68 73.75,-71.62 75.57,-70.46 77.45,-69.32 79.36,-68.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.73,-71.45 87.85,-63.61 77.39,-65.3 80.73,-71.45"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155" target="_top" xlink:title="checks if the function longest_common_string_length returns the same result when its argument are fli...">
-<polygon fill="white" stroke="#666666" points="214.25,-110.88 73.75,-110.88 73.75,-80.38 214.25,-80.38 214.25,-110.88"/>
-<text text-anchor="start" x="81.75" y="-97.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
-<text text-anchor="middle" x="144" y="-86.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_is_symmetric</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge11_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge11_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.04,-116.08C44.94,-114.74 53.31,-113.11 62.29,-111.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.85,-114.81 71.99,-109.47 61.51,-107.94 62.85,-114.81"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="computes the length of the longest common string created from input strings">
-<polygon fill="white" stroke="#666666" points="369.75,-110.88 250.25,-110.88 250.25,-80.38 369.75,-80.38 369.75,-110.88"/>
-<text text-anchor="start" x="258.25" y="-97.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
-<text text-anchor="middle" x="310" y="-86.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.34,-128.99C212.65,-124.41 229.55,-119.36 245.48,-114.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.28,-118.02 254.86,-111.8 244.28,-111.31 246.28,-118.02"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="478.75,-138.25 424.5,-138.25 424.5,-119 478.75,-119 478.75,-138.25"/>
-<text text-anchor="middle" x="451.62" y="-124.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M370.21,-109.62C384.82,-113.07 400.05,-116.67 413.28,-119.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="412.32,-123.17 422.86,-122.06 413.93,-116.36 412.32,-123.17"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="493.38,-101.25 409.88,-101.25 409.88,-82 493.38,-82 493.38,-101.25"/>
-<text text-anchor="middle" x="451.62" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M370.21,-93.93C379.52,-93.66 389.08,-93.39 398.21,-93.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="398.09,-96.63 407.99,-92.85 397.89,-89.63 398.09,-96.63"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge7_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge7_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.82,-62.97C223.25,-67.39 237.32,-72.02 250.51,-76.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="249.31,-79.66 259.91,-79.46 251.5,-73.01 249.31,-79.66"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541" target="_top" xlink:title="reverses a given string">
-<polygon fill="white" stroke="#666666" points="342.38,-51.25 277.62,-51.25 277.62,-32 342.38,-32 342.38,-51.25"/>
-<text text-anchor="middle" x="310" y="-37.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_str</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge8_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M212.18,-41.62C230.26,-41.62 249.33,-41.62 265.73,-41.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.62,-45.13 275.62,-41.63 265.62,-38.13 265.62,-45.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="497.5,-56.25 405.75,-56.25 405.75,-37 497.5,-37 497.5,-56.25"/>
-<text text-anchor="middle" x="451.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rbegin</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge9_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M342.68,-42.76C357.86,-43.3 376.51,-43.97 394.01,-44.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.67,-48.09 403.79,-44.95 393.92,-41.09 393.67,-48.09"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="493.75,-19.25 409.5,-19.25 409.5,0 493.75,0 493.75,-19.25"/>
-<text text-anchor="middle" x="451.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rend</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge10_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge10_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M342.68,-34.36C359.08,-30.6 379.54,-25.92 398.21,-21.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="398.82,-25.09 407.78,-19.44 397.26,-18.27 398.82,-25.09"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node4 -->
-<g id="edge12_Node000011_Node000004" class="edge">
-<title>Node11&#45;&gt;Node4</title>
-<g id="a_edge12_Node000011_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.55,-95.62C222.47,-95.62 230.55,-95.62 238.48,-95.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.44,-99.13 248.44,-95.63 238.44,-92.13 238.44,-99.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index 8630b401e..000000000
--- a/da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,224 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="506pt" height="205pt"
- viewBox="0.00 0.00 505.50 205.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 201.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="runs all tests for longest_common_string_length funcion">
-<polygon fill="#999999" stroke="#666666" points="37.75,-129.25 0,-129.25 0,-110 37.75,-110 37.75,-129.25"/>
-<text text-anchor="middle" x="18.88" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="185.38,-197.25 102.62,-197.25 102.62,-178 185.38,-178 185.38,-197.25"/>
-<text text-anchor="middle" x="144" y="-183.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_test_cases</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28,-129.39C37.75,-140.48 55.14,-158.39 73.75,-168.62 79.21,-171.63 85.18,-174.18 91.25,-176.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.17,-179.68 100.76,-179.39 92.3,-173.01 90.17,-179.68"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561" target="_top" xlink:title="checks the function longest_common_string_length agains example data">
-<polygon fill="white" stroke="#666666" points="200,-159.88 88,-159.88 88,-129.38 200,-129.38 200,-159.88"/>
-<text text-anchor="start" x="96" y="-146.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
-<text text-anchor="middle" x="144" y="-135.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.04,-123.31C48.54,-125.45 62.47,-128.27 76.74,-131.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.68,-134.53 86.18,-133.09 77.08,-127.67 75.68,-134.53"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe" target="_top" xlink:title="checks if the function longest_common_string_length returns the same result when its inputs are rever...">
-<polygon fill="white" stroke="#666666" points="212,-62.5 76,-62.5 76,-20.75 212,-20.75 212,-62.5"/>
-<text text-anchor="start" x="84" y="-49" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
-<text text-anchor="start" x="84" y="-37.75" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_for_reversed</text>
-<text text-anchor="middle" x="144" y="-26.5" font-family="Helvetica,sans-Serif" font-size="10.00">_inputs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.04,-109.77C39.19,-99.27 56.43,-82.68 73.75,-71.62 75.57,-70.46 77.45,-69.32 79.36,-68.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.73,-71.45 87.85,-63.61 77.39,-65.3 80.73,-71.45"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155" target="_top" xlink:title="checks if the function longest_common_string_length returns the same result when its argument are fli...">
-<polygon fill="white" stroke="#666666" points="214.25,-110.88 73.75,-110.88 73.75,-80.38 214.25,-80.38 214.25,-110.88"/>
-<text text-anchor="start" x="81.75" y="-97.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
-<text text-anchor="middle" x="144" y="-86.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_is_symmetric</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge11_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge11_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.04,-116.08C44.94,-114.74 53.31,-113.11 62.29,-111.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.85,-114.81 71.99,-109.47 61.51,-107.94 62.85,-114.81"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="computes the length of the longest common string created from input strings">
-<polygon fill="white" stroke="#666666" points="369.75,-110.88 250.25,-110.88 250.25,-80.38 369.75,-80.38 369.75,-110.88"/>
-<text text-anchor="start" x="258.25" y="-97.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
-<text text-anchor="middle" x="310" y="-86.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.34,-128.99C212.65,-124.41 229.55,-119.36 245.48,-114.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.28,-118.02 254.86,-111.8 244.28,-111.31 246.28,-118.02"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="478.75,-138.25 424.5,-138.25 424.5,-119 478.75,-119 478.75,-138.25"/>
-<text text-anchor="middle" x="451.62" y="-124.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M370.21,-109.62C384.82,-113.07 400.05,-116.67 413.28,-119.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="412.32,-123.17 422.86,-122.06 413.93,-116.36 412.32,-123.17"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="493.38,-101.25 409.88,-101.25 409.88,-82 493.38,-82 493.38,-101.25"/>
-<text text-anchor="middle" x="451.62" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M370.21,-93.93C379.52,-93.66 389.08,-93.39 398.21,-93.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="398.09,-96.63 407.99,-92.85 397.89,-89.63 398.09,-96.63"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge7_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge7_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M209.82,-62.97C223.25,-67.39 237.32,-72.02 250.51,-76.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="249.31,-79.66 259.91,-79.46 251.5,-73.01 249.31,-79.66"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541" target="_top" xlink:title="reverses a given string">
-<polygon fill="white" stroke="#666666" points="342.38,-51.25 277.62,-51.25 277.62,-32 342.38,-32 342.38,-51.25"/>
-<text text-anchor="middle" x="310" y="-37.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_str</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge8_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M212.18,-41.62C230.26,-41.62 249.33,-41.62 265.73,-41.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.62,-45.13 275.62,-41.63 265.62,-38.13 265.62,-45.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="497.5,-56.25 405.75,-56.25 405.75,-37 497.5,-37 497.5,-56.25"/>
-<text text-anchor="middle" x="451.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rbegin</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge9_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M342.68,-42.76C357.86,-43.3 376.51,-43.97 394.01,-44.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.67,-48.09 403.79,-44.95 393.92,-41.09 393.67,-48.09"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="493.75,-19.25 409.5,-19.25 409.5,0 493.75,0 493.75,-19.25"/>
-<text text-anchor="middle" x="451.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rend</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge10_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge10_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M342.68,-34.36C359.08,-30.6 379.54,-25.92 398.21,-21.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="398.82,-25.09 407.78,-19.44 397.26,-18.27 398.82,-25.09"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node4 -->
-<g id="edge12_Node000011_Node000004" class="edge">
-<title>Node11&#45;&gt;Node4</title>
-<g id="a_edge12_Node000011_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.55,-95.62C222.47,-95.62 230.55,-95.62 238.48,-95.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.44,-99.13 248.44,-95.63 238.44,-92.13 238.44,-99.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph.map b/da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph.map
deleted file mode 100644
index d07415c48..000000000
--- a/da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="test_longest_common_string_length" name="test_longest_common_string_length">
-<area shape="rect" id="Node000001" title="checks the function longest_common_string_length agains example data" alt="" coords="5,23,155,64"/>
-<area shape="rect" id="Node000002" href="$da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings" alt="" coords="203,23,362,64"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,41,187,41,187,46,155,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="430,5,502,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="362,30,413,23,414,28,363,35"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="410,55,521,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="363,51,395,56,394,61,362,57"/>
-</map>
diff --git a/da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph.md5 b/da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph.md5
deleted file mode 100644
index 179d49a6d..000000000
--- a/da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7f4356d3190259fe9e0fd366dfe76683
\ No newline at end of file
diff --git a/da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph.svg b/da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph.svg
deleted file mode 100644
index d3e80236b..000000000
--- a/da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_longest_common_string_length Pages: 1 -->
-<svg width="395pt" height="64pt"
- viewBox="0.00 0.00 395.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test_longest_common_string_length</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="checks the function longest_common_string_length agains example data">
-<polygon fill="#999999" stroke="#666666" points="112,-42.88 0,-42.88 0,-12.37 112,-12.37 112,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
-<text text-anchor="middle" x="56" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="computes the length of the longest common string created from input strings">
-<polygon fill="white" stroke="#666666" points="267.5,-42.88 148,-42.88 148,-12.37 267.5,-12.37 267.5,-42.88"/>
-<text text-anchor="start" x="156" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
-<text text-anchor="middle" x="207.75" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.34,-27.62C120.15,-27.62 128.27,-27.62 136.32,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.11,-31.13 146.11,-27.63 136.11,-24.13 136.11,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="372.38,-56.25 318.12,-56.25 318.12,-37 372.38,-37 372.38,-56.25"/>
-<text text-anchor="middle" x="345.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.79,-35.9C280.84,-37.73 294.33,-39.62 306.28,-41.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.75,-44.76 316.14,-42.68 306.72,-37.83 305.75,-44.76"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387,-19.25 303.5,-19.25 303.5,0 387,0 387,-19.25"/>
-<text text-anchor="middle" x="345.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.79,-19.78C275.84,-18.71 284.05,-17.62 291.97,-16.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="292.36,-20.05 301.81,-15.26 291.43,-13.11 292.36,-20.05"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph_org.svg b/da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph_org.svg
deleted file mode 100644
index d585a5606..000000000
--- a/da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph_org.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_longest_common_string_length Pages: 1 -->
-<svg width="395pt" height="64pt"
- viewBox="0.00 0.00 395.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test_longest_common_string_length</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="checks the function longest_common_string_length agains example data">
-<polygon fill="#999999" stroke="#666666" points="112,-42.88 0,-42.88 0,-12.37 112,-12.37 112,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
-<text text-anchor="middle" x="56" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="computes the length of the longest common string created from input strings">
-<polygon fill="white" stroke="#666666" points="267.5,-42.88 148,-42.88 148,-12.37 267.5,-12.37 267.5,-42.88"/>
-<text text-anchor="start" x="156" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
-<text text-anchor="middle" x="207.75" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.34,-27.62C120.15,-27.62 128.27,-27.62 136.32,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.11,-31.13 146.11,-27.63 136.11,-24.13 136.11,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="372.38,-56.25 318.12,-56.25 318.12,-37 372.38,-37 372.38,-56.25"/>
-<text text-anchor="middle" x="345.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.79,-35.9C280.84,-37.73 294.33,-39.62 306.28,-41.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.75,-44.76 316.14,-42.68 306.72,-37.83 305.75,-44.76"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387,-19.25 303.5,-19.25 303.5,0 387,0 387,-19.25"/>
-<text text-anchor="middle" x="345.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.79,-19.78C275.84,-18.71 284.05,-17.62 291.97,-16.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="292.36,-20.05 301.81,-15.26 291.43,-13.11 292.36,-20.05"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph.map b/da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph.map
deleted file mode 100644
index eb5d4579f..000000000
--- a/da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="longest_common_string_length" name="longest_common_string_length">
-<area shape="rect" id="Node000001" title="computes the length of the longest common string created from input strings" alt="" coords="5,23,165,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="232,5,304,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="165,30,216,23,217,28,165,35"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="213,55,324,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="165,51,198,56,197,61,165,57"/>
-</map>
diff --git a/da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph.md5 b/da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph.md5
deleted file mode 100644
index 434dffc38..000000000
--- a/da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3b0ce34bb9fe0c659936838ea1287939
\ No newline at end of file
diff --git a/da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph.svg b/da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph.svg
deleted file mode 100644
index 3e05a3f4c..000000000
--- a/da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: longest_common_string_length Pages: 1 -->
-<svg width="247pt" height="64pt"
- viewBox="0.00 0.00 247.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>longest_common_string_length</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="computes the length of the longest common string created from input strings">
-<polygon fill="#999999" stroke="#666666" points="119.5,-42.88 0,-42.88 0,-12.37 119.5,-12.37 119.5,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
-<text text-anchor="middle" x="59.75" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224.38,-56.25 170.12,-56.25 170.12,-37 224.38,-37 224.38,-56.25"/>
-<text text-anchor="middle" x="197.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.79,-35.9C132.84,-37.73 146.33,-39.62 158.28,-41.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.75,-44.76 168.14,-42.68 158.72,-37.83 157.75,-44.76"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="239,-19.25 155.5,-19.25 155.5,0 239,0 239,-19.25"/>
-<text text-anchor="middle" x="197.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.79,-19.78C127.84,-18.71 136.05,-17.62 143.97,-16.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.36,-20.05 153.81,-15.26 143.43,-13.11 144.36,-20.05"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph_org.svg b/da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph_org.svg
deleted file mode 100644
index 4f42c61d3..000000000
--- a/da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: longest_common_string_length Pages: 1 -->
-<svg width="247pt" height="64pt"
- viewBox="0.00 0.00 247.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>longest_common_string_length</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="computes the length of the longest common string created from input strings">
-<polygon fill="#999999" stroke="#666666" points="119.5,-42.88 0,-42.88 0,-12.37 119.5,-12.37 119.5,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
-<text text-anchor="middle" x="59.75" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224.38,-56.25 170.12,-56.25 170.12,-37 224.38,-37 224.38,-56.25"/>
-<text text-anchor="middle" x="197.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.79,-35.9C132.84,-37.73 146.33,-39.62 158.28,-41.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.75,-44.76 168.14,-42.68 158.72,-37.83 157.75,-44.76"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="239,-19.25 155.5,-19.25 155.5,0 239,0 239,-19.25"/>
-<text text-anchor="middle" x="197.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.79,-19.78C127.84,-18.71 136.05,-17.62 143.97,-16.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.36,-20.05 153.81,-15.26 143.43,-13.11 144.36,-20.05"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph.map b/da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph.map
deleted file mode 100644
index bbc9a1311..000000000
--- a/da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="reverse_str" name="reverse_str">
-<area shape="rect" id="Node000001" title="reverses a given string" alt="" coords="5,31,92,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/rbegin.html#" title=" " alt="" coords="140,5,262,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="92,34,124,28,125,34,93,39"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/rend.html#" title=" " alt="" coords="145,55,257,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="93,48,129,54,129,59,92,53"/>
-</map>
diff --git a/da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph.md5 b/da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph.md5
deleted file mode 100644
index cf9e0ce50..000000000
--- a/da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-62bba1e3ba4c0f13c529cdd88132faa3
\ No newline at end of file
diff --git a/da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph.svg b/da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph.svg
deleted file mode 100644
index e653c3558..000000000
--- a/da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: reverse_str Pages: 1 -->
-<svg width="201pt" height="64pt"
- viewBox="0.00 0.00 200.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>reverse_str</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="reverses a given string">
-<polygon fill="#999999" stroke="#666666" points="64.75,-37.25 0,-37.25 0,-18 64.75,-18 64.75,-37.25"/>
-<text text-anchor="middle" x="32.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_str</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="192.5,-56.25 100.75,-56.25 100.75,-37 192.5,-37 192.5,-56.25"/>
-<text text-anchor="middle" x="146.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rbegin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M65.24,-33.02C72.73,-34.29 80.93,-35.67 89.14,-37.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.34,-40.48 98.78,-38.7 89.5,-33.58 88.34,-40.48"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="188.75,-19.25 104.5,-19.25 104.5,0 188.75,0 188.75,-19.25"/>
-<text text-anchor="middle" x="146.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rend</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M65.24,-22.52C73.81,-21.14 83.32,-19.62 92.7,-18.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.21,-21.58 102.53,-16.54 92.1,-14.66 93.21,-21.58"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph_org.svg b/da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph_org.svg
deleted file mode 100644
index 449863109..000000000
--- a/da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: reverse_str Pages: 1 -->
-<svg width="201pt" height="64pt"
- viewBox="0.00 0.00 200.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>reverse_str</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="reverses a given string">
-<polygon fill="#999999" stroke="#666666" points="64.75,-37.25 0,-37.25 0,-18 64.75,-18 64.75,-37.25"/>
-<text text-anchor="middle" x="32.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_str</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="192.5,-56.25 100.75,-56.25 100.75,-37 192.5,-37 192.5,-56.25"/>
-<text text-anchor="middle" x="146.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rbegin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M65.24,-33.02C72.73,-34.29 80.93,-35.67 89.14,-37.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.34,-40.48 98.78,-38.7 89.5,-33.58 88.34,-40.48"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="188.75,-19.25 104.5,-19.25 104.5,0 188.75,0 188.75,-19.25"/>
-<text text-anchor="middle" x="146.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rend</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M65.24,-22.52C73.81,-21.14 83.32,-19.62 92.7,-18.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.21,-21.58 102.53,-16.54 92.1,-14.66 93.21,-21.58"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph.map b/da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph.map
deleted file mode 100644
index cfb59f936..000000000
--- a/da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="test_longest_common_string_length_is_symmetric" name="test_longest_common_string_length_is_symmetric">
-<area shape="rect" id="Node000001" title="checks if the function longest_common_string_length returns the same result when its argument are fli..." alt="" coords="5,23,193,64"/>
-<area shape="rect" id="Node000002" href="$da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings" alt="" coords="241,23,400,64"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="193,41,225,41,225,46,193,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="468,5,540,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="400,30,451,23,452,28,401,35"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="448,55,559,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="401,51,433,56,432,61,400,57"/>
-</map>
diff --git a/da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph.md5 b/da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph.md5
deleted file mode 100644
index 1ad744a14..000000000
--- a/da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b7f32fb6e59c474b34416734a72f7567
\ No newline at end of file
diff --git a/da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph.svg b/da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph.svg
deleted file mode 100644
index dffb67ee0..000000000
--- a/da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_longest_common_string_length_is_symmetric Pages: 1 -->
-<svg width="424pt" height="64pt"
- viewBox="0.00 0.00 423.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test_longest_common_string_length_is_symmetric</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="checks if the function longest_common_string_length returns the same result when its argument are fli...">
-<polygon fill="#999999" stroke="#666666" points="140.5,-42.88 0,-42.88 0,-12.37 140.5,-12.37 140.5,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
-<text text-anchor="middle" x="70.25" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_is_symmetric</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="computes the length of the longest common string created from input strings">
-<polygon fill="white" stroke="#666666" points="296,-42.88 176.5,-42.88 176.5,-12.37 296,-12.37 296,-42.88"/>
-<text text-anchor="start" x="184.5" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
-<text text-anchor="middle" x="236.25" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.8,-27.62C148.72,-27.62 156.8,-27.62 164.73,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.69,-31.13 174.69,-27.63 164.69,-24.13 164.69,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.88,-56.25 346.62,-56.25 346.62,-37 400.88,-37 400.88,-56.25"/>
-<text text-anchor="middle" x="373.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M296.29,-35.9C309.34,-37.73 322.83,-39.62 334.78,-41.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.25,-44.76 344.64,-42.68 335.22,-37.83 334.25,-44.76"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415.5,-19.25 332,-19.25 332,0 415.5,0 415.5,-19.25"/>
-<text text-anchor="middle" x="373.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M296.29,-19.78C304.34,-18.71 312.55,-17.62 320.47,-16.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.86,-20.05 330.31,-15.26 319.93,-13.11 320.86,-20.05"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph_org.svg b/da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph_org.svg
deleted file mode 100644
index 854b7f66f..000000000
--- a/da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph_org.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_longest_common_string_length_is_symmetric Pages: 1 -->
-<svg width="424pt" height="64pt"
- viewBox="0.00 0.00 423.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test_longest_common_string_length_is_symmetric</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="checks if the function longest_common_string_length returns the same result when its argument are fli...">
-<polygon fill="#999999" stroke="#666666" points="140.5,-42.88 0,-42.88 0,-12.37 140.5,-12.37 140.5,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
-<text text-anchor="middle" x="70.25" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_is_symmetric</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="computes the length of the longest common string created from input strings">
-<polygon fill="white" stroke="#666666" points="296,-42.88 176.5,-42.88 176.5,-12.37 296,-12.37 296,-42.88"/>
-<text text-anchor="start" x="184.5" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
-<text text-anchor="middle" x="236.25" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.8,-27.62C148.72,-27.62 156.8,-27.62 164.73,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.69,-31.13 174.69,-27.63 164.69,-24.13 164.69,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.88,-56.25 346.62,-56.25 346.62,-37 400.88,-37 400.88,-56.25"/>
-<text text-anchor="middle" x="373.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M296.29,-35.9C309.34,-37.73 322.83,-39.62 334.78,-41.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.25,-44.76 344.64,-42.68 335.22,-37.83 334.25,-44.76"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415.5,-19.25 332,-19.25 332,0 415.5,0 415.5,-19.25"/>
-<text text-anchor="middle" x="373.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M296.29,-19.78C304.34,-18.71 312.55,-17.62 320.47,-16.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.86,-20.05 330.31,-15.26 319.93,-13.11 320.86,-20.05"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 0e8eadc1a..000000000
--- a/da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,27 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,96,55,122"/>
-<area shape="rect" id="Node000002" href="$da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="runs all tests for longest_common_string_length funcion" alt="" coords="103,96,153,122"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,106,88,106,88,112,55,112"/>
-<area shape="rect" id="Node000003" href="$da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c" title=" " alt="" coords="240,5,350,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="138,94,164,67,200,41,223,31,225,36,202,46,168,71,142,98"/>
-<area shape="rect" id="Node000004" href="$da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561" title="checks the function longest_common_string_length agains example data" alt="" coords="220,55,369,96"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="153,101,204,91,206,96,154,107"/>
-<area shape="rect" id="Node000008" href="$da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe" title="checks if the function longest_common_string_length returns the same result when its inputs are rever..." alt="" coords="204,185,385,241"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="143,120,169,145,203,171,210,175,207,180,199,175,166,149,140,124"/>
-<area shape="rect" id="Node000012" href="$da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155" title="checks if the function longest_common_string_length returns the same result when its argument are fli..." alt="" coords="201,120,388,161"/>
-<area shape="poly" id="edge12_Node000002_Node000012" title=" " alt="" coords="154,111,186,117,185,122,153,116"/>
-<area shape="rect" id="Node000005" href="$da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings" alt="" coords="436,120,596,161"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="367,94,431,113,429,118,365,99"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="669,84,741,110"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="596,120,653,106,654,111,597,125"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="649,133,760,159"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="596,140,634,141,634,147,596,146"/>
-<area shape="poly" id="edge8_Node000008_Node000005" title=" " alt="" coords="382,182,436,164,438,169,383,187"/>
-<area shape="rect" id="Node000009" href="$da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541" title="reverses a given string" alt="" coords="473,200,559,226"/>
-<area shape="poly" id="edge9_Node000008_Node000009" title=" " alt="" coords="386,210,457,210,457,216,386,216"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/rbegin.html#" title=" " alt="" coords="644,193,766,219"/>
-<area shape="poly" id="edge10_Node000009_Node000010" title=" " alt="" coords="559,209,628,206,628,212,560,214"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/rend.html#" title=" " alt="" coords="649,243,761,268"/>
-<area shape="poly" id="edge11_Node000009_Node000011" title=" " alt="" coords="560,220,634,237,633,242,559,225"/>
-<area shape="poly" id="edge13_Node000012_Node000005" title=" " alt="" coords="389,138,421,138,421,144,389,144"/>
-</map>
diff --git a/da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index ed02e69d0..000000000
--- a/da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-75251397415c32038149e763c090b8e0
\ No newline at end of file
diff --git a/da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 2a9205b95..000000000
--- a/da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,325 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 205 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 579;
-var viewHeight = 205;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-129.25 0,-129.25 0,-110 37,-110 37,-129.25"/>
-<text text-anchor="middle" x="18.5" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="runs all tests for longest_common_string_length funcion">
-<polygon fill="white" stroke="#666666" points="110.75,-129.25 73,-129.25 73,-110 110.75,-110 110.75,-129.25"/>
-<text text-anchor="middle" x="91.88" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-119.62C44.55,-119.62 53.37,-119.62 61.69,-119.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-123.13 71.43,-119.63 61.43,-116.13 61.43,-123.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.38,-197.25 175.62,-197.25 175.62,-178 258.38,-178 258.38,-197.25"/>
-<text text-anchor="middle" x="217" y="-183.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_test_cases</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101,-129.39C110.75,-140.48 128.14,-158.39 146.75,-168.62 152.21,-171.63 158.18,-174.18 164.25,-176.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.17,-179.68 173.76,-179.39 165.3,-173.01 163.17,-179.68"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561" target="_top" xlink:title="checks the function longest_common_string_length agains example data">
-<polygon fill="white" stroke="#666666" points="273,-159.88 161,-159.88 161,-129.38 273,-129.38 273,-159.88"/>
-<text text-anchor="start" x="169" y="-146.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
-<text text-anchor="middle" x="217" y="-135.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.04,-123.31C121.54,-125.45 135.47,-128.27 149.74,-131.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.68,-134.53 159.18,-133.09 150.08,-127.67 148.68,-134.53"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe" target="_top" xlink:title="checks if the function longest_common_string_length returns the same result when its inputs are rever...">
-<polygon fill="white" stroke="#666666" points="285,-62.5 149,-62.5 149,-20.75 285,-20.75 285,-62.5"/>
-<text text-anchor="start" x="157" y="-49" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
-<text text-anchor="start" x="157" y="-37.75" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_for_reversed</text>
-<text text-anchor="middle" x="217" y="-26.5" font-family="Helvetica,sans-Serif" font-size="10.00">_inputs</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.04,-109.77C112.19,-99.27 129.43,-82.68 146.75,-71.62 148.57,-70.46 150.45,-69.32 152.36,-68.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.73,-71.45 160.85,-63.61 150.39,-65.3 153.73,-71.45"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155" target="_top" xlink:title="checks if the function longest_common_string_length returns the same result when its argument are fli...">
-<polygon fill="white" stroke="#666666" points="287.25,-110.88 146.75,-110.88 146.75,-80.38 287.25,-80.38 287.25,-110.88"/>
-<text text-anchor="start" x="154.75" y="-97.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
-<text text-anchor="middle" x="217" y="-86.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_is_symmetric</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge12_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge12_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.04,-116.08C117.94,-114.74 126.31,-113.11 135.29,-111.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.85,-114.81 144.99,-109.47 134.51,-107.94 135.85,-114.81"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="computes the length of the longest common string created from input strings">
-<polygon fill="white" stroke="#666666" points="442.75,-110.88 323.25,-110.88 323.25,-80.38 442.75,-80.38 442.75,-110.88"/>
-<text text-anchor="start" x="331.25" y="-97.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
-<text text-anchor="middle" x="383" y="-86.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.34,-128.99C285.65,-124.41 302.55,-119.36 318.48,-114.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="319.28,-118.02 327.86,-111.8 317.28,-111.31 319.28,-118.02"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="551.75,-138.25 497.5,-138.25 497.5,-119 551.75,-119 551.75,-138.25"/>
-<text text-anchor="middle" x="524.62" y="-124.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M443.21,-109.62C457.82,-113.07 473.05,-116.67 486.28,-119.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="485.32,-123.17 495.86,-122.06 486.93,-116.36 485.32,-123.17"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="566.38,-101.25 482.88,-101.25 482.88,-82 566.38,-82 566.38,-101.25"/>
-<text text-anchor="middle" x="524.62" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M443.21,-93.93C452.52,-93.66 462.08,-93.39 471.21,-93.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="471.09,-96.63 480.99,-92.85 470.89,-89.63 471.09,-96.63"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge8_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge8_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.82,-62.97C296.25,-67.39 310.32,-72.02 323.51,-76.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.31,-79.66 332.91,-79.46 324.5,-73.01 322.31,-79.66"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541" target="_top" xlink:title="reverses a given string">
-<polygon fill="white" stroke="#666666" points="415.38,-51.25 350.62,-51.25 350.62,-32 415.38,-32 415.38,-51.25"/>
-<text text-anchor="middle" x="383" y="-37.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_str</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge9_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.18,-41.62C303.26,-41.62 322.33,-41.62 338.73,-41.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="338.62,-45.13 348.62,-41.63 338.62,-38.13 338.62,-45.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="570.5,-56.25 478.75,-56.25 478.75,-37 570.5,-37 570.5,-56.25"/>
-<text text-anchor="middle" x="524.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rbegin</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge10_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge10_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.68,-42.76C430.86,-43.3 449.51,-43.97 467.01,-44.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="466.67,-48.09 476.79,-44.95 466.92,-41.09 466.67,-48.09"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="566.75,-19.25 482.5,-19.25 482.5,0 566.75,0 566.75,-19.25"/>
-<text text-anchor="middle" x="524.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rend</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge11_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge11_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.68,-34.36C432.08,-30.6 452.54,-25.92 471.21,-21.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="471.82,-25.09 480.78,-19.44 470.26,-18.27 471.82,-25.09"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node5 -->
-<g id="edge13_Node000012_Node000005" class="edge">
-<title>Node12&#45;&gt;Node5</title>
-<g id="a_edge13_Node000012_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M287.55,-95.62C295.47,-95.62 303.55,-95.62 311.48,-95.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="311.44,-99.13 321.44,-95.63 311.44,-92.13 311.44,-99.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index e11268c8f..000000000
--- a/da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,242 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="579pt" height="205pt"
- viewBox="0.00 0.00 578.50 205.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 201.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-129.25 0,-129.25 0,-110 37,-110 37,-129.25"/>
-<text text-anchor="middle" x="18.5" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="runs all tests for longest_common_string_length funcion">
-<polygon fill="white" stroke="#666666" points="110.75,-129.25 73,-129.25 73,-110 110.75,-110 110.75,-129.25"/>
-<text text-anchor="middle" x="91.88" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-119.62C44.55,-119.62 53.37,-119.62 61.69,-119.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-123.13 71.43,-119.63 61.43,-116.13 61.43,-123.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.38,-197.25 175.62,-197.25 175.62,-178 258.38,-178 258.38,-197.25"/>
-<text text-anchor="middle" x="217" y="-183.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_test_cases</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101,-129.39C110.75,-140.48 128.14,-158.39 146.75,-168.62 152.21,-171.63 158.18,-174.18 164.25,-176.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.17,-179.68 173.76,-179.39 165.3,-173.01 163.17,-179.68"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561" target="_top" xlink:title="checks the function longest_common_string_length agains example data">
-<polygon fill="white" stroke="#666666" points="273,-159.88 161,-159.88 161,-129.38 273,-129.38 273,-159.88"/>
-<text text-anchor="start" x="169" y="-146.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
-<text text-anchor="middle" x="217" y="-135.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.04,-123.31C121.54,-125.45 135.47,-128.27 149.74,-131.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.68,-134.53 159.18,-133.09 150.08,-127.67 148.68,-134.53"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe" target="_top" xlink:title="checks if the function longest_common_string_length returns the same result when its inputs are rever...">
-<polygon fill="white" stroke="#666666" points="285,-62.5 149,-62.5 149,-20.75 285,-20.75 285,-62.5"/>
-<text text-anchor="start" x="157" y="-49" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
-<text text-anchor="start" x="157" y="-37.75" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_for_reversed</text>
-<text text-anchor="middle" x="217" y="-26.5" font-family="Helvetica,sans-Serif" font-size="10.00">_inputs</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.04,-109.77C112.19,-99.27 129.43,-82.68 146.75,-71.62 148.57,-70.46 150.45,-69.32 152.36,-68.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.73,-71.45 160.85,-63.61 150.39,-65.3 153.73,-71.45"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155" target="_top" xlink:title="checks if the function longest_common_string_length returns the same result when its argument are fli...">
-<polygon fill="white" stroke="#666666" points="287.25,-110.88 146.75,-110.88 146.75,-80.38 287.25,-80.38 287.25,-110.88"/>
-<text text-anchor="start" x="154.75" y="-97.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
-<text text-anchor="middle" x="217" y="-86.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_is_symmetric</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge12_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge12_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.04,-116.08C117.94,-114.74 126.31,-113.11 135.29,-111.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.85,-114.81 144.99,-109.47 134.51,-107.94 135.85,-114.81"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="computes the length of the longest common string created from input strings">
-<polygon fill="white" stroke="#666666" points="442.75,-110.88 323.25,-110.88 323.25,-80.38 442.75,-80.38 442.75,-110.88"/>
-<text text-anchor="start" x="331.25" y="-97.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
-<text text-anchor="middle" x="383" y="-86.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.34,-128.99C285.65,-124.41 302.55,-119.36 318.48,-114.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="319.28,-118.02 327.86,-111.8 317.28,-111.31 319.28,-118.02"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="551.75,-138.25 497.5,-138.25 497.5,-119 551.75,-119 551.75,-138.25"/>
-<text text-anchor="middle" x="524.62" y="-124.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M443.21,-109.62C457.82,-113.07 473.05,-116.67 486.28,-119.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="485.32,-123.17 495.86,-122.06 486.93,-116.36 485.32,-123.17"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="566.38,-101.25 482.88,-101.25 482.88,-82 566.38,-82 566.38,-101.25"/>
-<text text-anchor="middle" x="524.62" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M443.21,-93.93C452.52,-93.66 462.08,-93.39 471.21,-93.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="471.09,-96.63 480.99,-92.85 470.89,-89.63 471.09,-96.63"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge8_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge8_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.82,-62.97C296.25,-67.39 310.32,-72.02 323.51,-76.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.31,-79.66 332.91,-79.46 324.5,-73.01 322.31,-79.66"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541" target="_top" xlink:title="reverses a given string">
-<polygon fill="white" stroke="#666666" points="415.38,-51.25 350.62,-51.25 350.62,-32 415.38,-32 415.38,-51.25"/>
-<text text-anchor="middle" x="383" y="-37.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_str</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge9_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.18,-41.62C303.26,-41.62 322.33,-41.62 338.73,-41.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="338.62,-45.13 348.62,-41.63 338.62,-38.13 338.62,-45.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="570.5,-56.25 478.75,-56.25 478.75,-37 570.5,-37 570.5,-56.25"/>
-<text text-anchor="middle" x="524.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rbegin</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge10_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge10_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.68,-42.76C430.86,-43.3 449.51,-43.97 467.01,-44.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="466.67,-48.09 476.79,-44.95 466.92,-41.09 466.67,-48.09"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="566.75,-19.25 482.5,-19.25 482.5,0 566.75,0 566.75,-19.25"/>
-<text text-anchor="middle" x="524.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rend</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge11_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge11_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.68,-34.36C432.08,-30.6 452.54,-25.92 471.21,-21.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="471.82,-25.09 480.78,-19.44 470.26,-18.27 471.82,-25.09"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node5 -->
-<g id="edge13_Node000012_Node000005" class="edge">
-<title>Node12&#45;&gt;Node5</title>
-<g id="a_edge13_Node000012_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M287.55,-95.62C295.47,-95.62 303.55,-95.62 311.48,-95.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="311.44,-99.13 321.44,-95.63 311.44,-92.13 311.44,-99.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d0d/longest__common__string_8cpp_source.html b/da/d0d/longest__common__string_8cpp_source.html
new file mode 100644
index 000000000..60270bbd7
--- /dev/null
+++ b/da/d0d/longest__common__string_8cpp_source.html
@@ -0,0 +1,267 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/longest_common_string.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/d0d/longest__common__string_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">longest_common_string.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/d0d/longest__common__string_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;string&gt;</span>    </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;utility&gt;</span>   </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="foldopen" id="foldopen00028" data-start="{" data-end="}">
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"><a class="line" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5">   28</a></span>std::size_t <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5">longest_common_string_length</a>(<span class="keyword">const</span> std::string&amp; string_a,</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>                                         <span class="keyword">const</span> std::string&amp; string_b) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keyword">const</span> <span class="keyword">auto</span> size_a = string_a.size();</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keyword">const</span> <span class="keyword">auto</span> size_b = string_b.size();</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    std::vector&lt;std::vector&lt;std::size_t&gt;&gt; sub_sols(</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        size_a + 1, std::vector&lt;std::size_t&gt;(size_b + 1, 0));</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keyword">const</span> <span class="keyword">auto</span> limit = <span class="keyword">static_cast&lt;</span>std::size_t<span class="keyword">&gt;</span>(-1);</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">for</span> (std::size_t pos_a = size_a - 1; pos_a != limit; --pos_a) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        <span class="keywordflow">for</span> (std::size_t pos_b = size_b - 1; pos_b != limit; --pos_b) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>            <span class="keywordflow">if</span> (string_a[pos_a] == string_b[pos_b]) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>                sub_sols[pos_a][pos_b] = 1 + sub_sols[pos_a + 1][pos_b + 1];</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>                sub_sols[pos_a][pos_b] = std::max(sub_sols[pos_a + 1][pos_b],</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>                                                  sub_sols[pos_a][pos_b + 1]);</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>            }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        }</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">return</span> sub_sols[0][0];</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>}</div>
+</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="foldopen" id="foldopen00054" data-start="{" data-end="};">
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="../../da/d86/struct_test_case.html">   54</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a> {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keyword">const</span> std::string string_a;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keyword">const</span> std::string string_b;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keyword">const</span> std::size_t common_string_len;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(std::string string_a, std::string string_b,</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>             <span class="keyword">const</span> std::size_t in_common_string_len)</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        : string_a(std::move(string_a)),</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>          string_b(std::move(string_b)),</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>          common_string_len(in_common_string_len) {}</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>};</div>
+</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="foldopen" id="foldopen00069" data-start="{" data-end="}">
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="../../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c">   69</a></span>std::vector&lt;TestCase&gt; <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c">get_test_cases</a>() {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keywordflow">return</span> {<a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;&quot;</span>, <span class="stringliteral">&quot;&quot;</span>, 0),</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>            <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;ab&quot;</span>, <span class="stringliteral">&quot;ab&quot;</span>, 2),</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;ab&quot;</span>, <span class="stringliteral">&quot;ba&quot;</span>, 1),</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;&quot;</span>, <span class="stringliteral">&quot;xyz&quot;</span>, 0),</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;abcde&quot;</span>, <span class="stringliteral">&quot;ace&quot;</span>, 3),</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;BADANA&quot;</span>, <span class="stringliteral">&quot;ANADA&quot;</span>, 3),</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>            <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;BADANA&quot;</span>, <span class="stringliteral">&quot;CANADAS&quot;</span>, 3),</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;a1a234a5aaaa6&quot;</span>, <span class="stringliteral">&quot;A1AAAA234AAA56AAAAA&quot;</span>, 6),</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;123x&quot;</span>, <span class="stringliteral">&quot;123&quot;</span>, 3),</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;12x3x&quot;</span>, <span class="stringliteral">&quot;123&quot;</span>, 3),</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>            <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;1x2x3x&quot;</span>, <span class="stringliteral">&quot;123&quot;</span>, 3),</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>            <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;x1x2x3x&quot;</span>, <span class="stringliteral">&quot;123&quot;</span>, 3),</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>            <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;x12x3x&quot;</span>, <span class="stringliteral">&quot;123&quot;</span>, 3)};</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>}</div>
+</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> TestCases&gt;</div>
+<div class="foldopen" id="foldopen00091" data-start="{" data-end="}">
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"><a class="line" href="../../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561">   91</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561">test_longest_common_string_length</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d5/d58/class_test_cases.html">TestCases</a>&amp; test_cases) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; cur_tc : test_cases) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        assert(<a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5">longest_common_string_length</a>(cur_tc.string_a, cur_tc.string_b) ==</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>               cur_tc.common_string_len);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    }</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>}</div>
+</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> TestCases&gt;</div>
+<div class="foldopen" id="foldopen00105" data-start="{" data-end="}">
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"><a class="line" href="../../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155">  105</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155">test_longest_common_string_length_is_symmetric</a>(</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="keyword">const</span> <a class="code hl_class" href="../../d5/d58/class_test_cases.html">TestCases</a>&amp; test_cases) {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; cur_tc : test_cases) {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        assert(<a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5">longest_common_string_length</a>(cur_tc.string_b, cur_tc.string_a) ==</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>               cur_tc.common_string_len);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    }</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>}</div>
+</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="foldopen" id="foldopen00119" data-start="{" data-end="}">
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"><a class="line" href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541">  119</a></span>std::string <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541">reverse_str</a>(<span class="keyword">const</span> std::string&amp; in_str) {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <span class="keywordflow">return</span> {in_str.rbegin(), in_str.rend()};</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>}</div>
+</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span> </div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> TestCases&gt;</div>
+<div class="foldopen" id="foldopen00130" data-start="{" data-end="}">
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"><a class="line" href="../../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe">  130</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe">test_longest_common_string_length_for_reversed_inputs</a>(</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <span class="keyword">const</span> <a class="code hl_class" href="../../d5/d58/class_test_cases.html">TestCases</a>&amp; test_cases) {</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; cur_tc : test_cases) {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        assert(<a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5">longest_common_string_length</a>(<a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541">reverse_str</a>(cur_tc.string_a),</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>                                            <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541">reverse_str</a>(cur_tc.string_b)) ==</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>               cur_tc.common_string_len);</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    }</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>}</div>
+</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
+<div class="foldopen" id="foldopen00142" data-start="{" data-end="}">
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"><a class="line" href="../../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">  142</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <span class="keyword">const</span> <span class="keyword">auto</span> test_cases = <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c">get_test_cases</a>();</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    assert(test_cases.size() &gt; 0);</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561">test_longest_common_string_length</a>(test_cases);</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155">test_longest_common_string_length_is_symmetric</a>(test_cases);</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe">test_longest_common_string_length_for_reversed_inputs</a>(test_cases);</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span> </div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>}</div>
+</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
+<div class="foldopen" id="foldopen00156" data-start="{" data-end="}">
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"><a class="line" href="../../da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  156</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>}</div>
+</div>
+<div class="ttc" id="aclass_test_cases_html"><div class="ttname"><a href="../../d5/d58/class_test_cases.html">TestCases</a></div><div class="ttdoc">class encapsulating the necessary test cases</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d32/inorder__successor__of__bst_8cpp_source.html#l00225">inorder_successor_of_bst.cpp:225</a></div></div>
+<div class="ttc" id="alongest__common__string_8cpp_html_a23ab67b0d9600697695fc8679462d8fe"><div class="ttname"><a href="../../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe">test_longest_common_string_length_for_reversed_inputs</a></div><div class="ttdeci">static void test_longest_common_string_length_for_reversed_inputs(const TestCases &amp;test_cases)</div><div class="ttdoc">checks if the function longest_common_string_length returns the same result when its inputs are rever...</div><div class="ttdef"><b>Definition</b> <a href="#l00130">longest_common_string.cpp:130</a></div></div>
+<div class="ttc" id="alongest__common__string_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">runs all tests for longest_common_string_length funcion</div><div class="ttdef"><b>Definition</b> <a href="#l00142">longest_common_string.cpp:142</a></div></div>
+<div class="ttc" id="alongest__common__string_8cpp_html_a967854a526bc15403d783a033155fc5c"><div class="ttname"><a href="../../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c">get_test_cases</a></div><div class="ttdeci">std::vector&lt; TestCase &gt; get_test_cases()</div><div class="ttdef"><b>Definition</b> <a href="#l00069">longest_common_string.cpp:69</a></div></div>
+<div class="ttc" id="alongest__common__string_8cpp_html_a9b229daad982a186a4d8d90aa8f38561"><div class="ttname"><a href="../../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561">test_longest_common_string_length</a></div><div class="ttdeci">static void test_longest_common_string_length(const TestCases &amp;test_cases)</div><div class="ttdoc">checks the function longest_common_string_length agains example data</div><div class="ttdef"><b>Definition</b> <a href="#l00091">longest_common_string.cpp:91</a></div></div>
+<div class="ttc" id="alongest__common__string_8cpp_html_aa38b6b17bc5d46ed88acdd8414e18fa5"><div class="ttname"><a href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5">longest_common_string_length</a></div><div class="ttdeci">std::size_t longest_common_string_length(const std::string &amp;string_a, const std::string &amp;string_b)</div><div class="ttdoc">computes the length of the longest common string created from input strings</div><div class="ttdef"><b>Definition</b> <a href="#l00028">longest_common_string.cpp:28</a></div></div>
+<div class="ttc" id="alongest__common__string_8cpp_html_acb03dbbcee6d607db471021168be8541"><div class="ttname"><a href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541">reverse_str</a></div><div class="ttdeci">std::string reverse_str(const std::string &amp;in_str)</div><div class="ttdoc">reverses a given string</div><div class="ttdef"><b>Definition</b> <a href="#l00119">longest_common_string.cpp:119</a></div></div>
+<div class="ttc" id="alongest__common__string_8cpp_html_ad1e613c1b85cc04ed931b6c745fec155"><div class="ttname"><a href="../../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155">test_longest_common_string_length_is_symmetric</a></div><div class="ttdeci">static void test_longest_common_string_length_is_symmetric(const TestCases &amp;test_cases)</div><div class="ttdoc">checks if the function longest_common_string_length returns the same result when its argument are fli...</div><div class="ttdef"><b>Definition</b> <a href="#l00105">longest_common_string.cpp:105</a></div></div>
+<div class="ttc" id="alongest__common__string_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00156">longest_common_string.cpp:156</a></div></div>
+<div class="ttc" id="astruct_test_case_html"><div class="ttname"><a href="../../da/d86/struct_test_case.html">TestCase</a></div><div class="ttdoc">represents single example inputs and expected output of the function longest_common_string_length</div><div class="ttdef"><b>Definition</b> <a href="#l00054">longest_common_string.cpp:54</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../da/d0d/longest__common__string_8cpp.html">longest_common_string.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.map b/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.map
index fb8468ced..693945efd 100644
--- a/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.map
+++ b/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.map
@@ -1,5 +1,5 @@
 <map id="graph::topological_sort::Graph" name="graph::topological_sort::Graph">
 <area shape="rect" id="Node000001" title="Class that represents a directed graph and provides methods for manipulating the graph." alt="" coords="22,109,146,150"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="5,5,163,46"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,5,163,46"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="87,62,87,109,81,109,81,62"/>
 </map>
diff --git a/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.md5 b/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.md5
index f75483b46..59ce320bf 100644
--- a/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.md5
+++ b/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.md5
@@ -1 +1 @@
-3b2e9757bc23370a01bb8ca8c6dedc02
\ No newline at end of file
+466577473fd3a5b5fe23a1908abe3a45
\ No newline at end of file
diff --git a/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.svg b/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.svg
index 21658eeeb..f8d49376d 100644
--- a/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.svg
+++ b/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph.svg
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="118,-108.25 0,-108.25 0,-77.75 118,-77.75 118,-108.25"/>
 <text text-anchor="start" x="8" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="59" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
diff --git a/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph_org.svg b/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph_org.svg
index 37678e7c7..4aa982765 100644
--- a/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph_org.svg
+++ b/da/d15/classgraph_1_1topological__sort_1_1_graph__coll__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="118,-108.25 0,-108.25 0,-77.75 118,-77.75 118,-108.25"/>
 <text text-anchor="start" x="8" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="59" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
diff --git a/da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html b/da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html
index 10d09f233..b67930e0d 100644
--- a/da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html
+++ b/da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: operations_on_datastructures::circular_linked_list::Node Struct Reference</title>
+<title>TheAlgorithms/C++: operations_on_datastructures::circular_linked_list::Node Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -131,17 +148,17 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a7461292b8b91aed86404d0ab019dfdd1" id="r_a7461292b8b91aed86404d0ab019dfdd1"><td class="memItemLeft" align="right" valign="top"><a id="a7461292b8b91aed86404d0ab019dfdd1" name="a7461292b8b91aed86404d0ab019dfdd1"></a>
-int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
-<tr class="memdesc:a7461292b8b91aed86404d0ab019dfdd1"><td class="mdescLeft">&#160;</td><td class="mdescRight">The value of the <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>. <br /></td></tr>
+<tr class="memitem:a7461292b8b91aed86404d0ab019dfdd1" id="r_a7461292b8b91aed86404d0ab019dfdd1"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7461292b8b91aed86404d0ab019dfdd1">data</a></td></tr>
+<tr class="memdesc:a7461292b8b91aed86404d0ab019dfdd1"><td class="mdescLeft">&#160;</td><td class="mdescRight">The value of the <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>.  <br /></td></tr>
 <tr class="separator:a7461292b8b91aed86404d0ab019dfdd1"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a7c867b8e1034a6f5da490c8b8c09cb77" id="r_a7c867b8e1034a6f5da490c8b8c09cb77"><td class="memItemLeft" align="right" valign="top"><a id="a7c867b8e1034a6f5da490c8b8c09cb77" name="a7c867b8e1034a6f5da490c8b8c09cb77"></a>
-<a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>next</b></td></tr>
-<tr class="memdesc:a7c867b8e1034a6f5da490c8b8c09cb77"><td class="mdescLeft">&#160;</td><td class="mdescRight">The <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>'s successor. <br /></td></tr>
+<tr class="memitem:a7c867b8e1034a6f5da490c8b8c09cb77" id="r_a7c867b8e1034a6f5da490c8b8c09cb77"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7c867b8e1034a6f5da490c8b8c09cb77">next</a></td></tr>
+<tr class="memdesc:a7c867b8e1034a6f5da490c8b8c09cb77"><td class="mdescLeft">&#160;</td><td class="mdescRight">The <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>'s successor.  <br /></td></tr>
 <tr class="separator:a7c867b8e1034a6f5da490c8b8c09cb77"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>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. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a005dc56b0c58350a13f4796b9b30b6c5" name="a005dc56b0c58350a13f4796b9b30b6c5"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a005dc56b0c58350a13f4796b9b30b6c5">&#9670;&#160;</a></span>Node() <span class="overload">[1/2]</span></h2>
@@ -175,12 +192,14 @@ int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
 </dl>
 <p>&lt; Set value of <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> data</p>
 <p>&lt; Initialize successor</p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   39</span>                                 {</div>
-<div class="line"><span class="lineno">   40</span>        <a class="code hl_variable" href="#a7461292b8b91aed86404d0ab019dfdd1">data</a> = _data;    <span class="comment">///&lt; Set value of Node data</span></div>
-<div class="line"><span class="lineno">   41</span>        <a class="code hl_variable" href="#a7c867b8e1034a6f5da490c8b8c09cb77">next</a> = <span class="keyword">nullptr</span>;  <span class="comment">///&lt; Initialize successor</span></div>
+<div class="line"><span class="lineno">   40</span>        <a class="code hl_variable" href="#a7461292b8b91aed86404d0ab019dfdd1">data</a> = _data;    </div>
+<div class="line"><span class="lineno">   41</span>        <a class="code hl_variable" href="#a7c867b8e1034a6f5da490c8b8c09cb77">next</a> = <span class="keyword">nullptr</span>;  </div>
 <div class="line"><span class="lineno">   42</span>    }</div>
-<div class="ttc" id="astructoperations__on__datastructures_1_1circular__linked__list_1_1_node_html_a7461292b8b91aed86404d0ab019dfdd1"><div class="ttname"><a href="#a7461292b8b91aed86404d0ab019dfdd1">operations_on_datastructures::circular_linked_list::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The value of the Node.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:33</div></div>
-<div class="ttc" id="astructoperations__on__datastructures_1_1circular__linked__list_1_1_node_html_a7c867b8e1034a6f5da490c8b8c09cb77"><div class="ttname"><a href="#a7c867b8e1034a6f5da490c8b8c09cb77">operations_on_datastructures::circular_linked_list::Node::next</a></div><div class="ttdeci">Node * next</div><div class="ttdoc">The Node's successor.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:34</div></div>
+<div class="ttc" id="astructoperations__on__datastructures_1_1circular__linked__list_1_1_node_html_a7461292b8b91aed86404d0ab019dfdd1"><div class="ttname"><a href="#a7461292b8b91aed86404d0ab019dfdd1">operations_on_datastructures::circular_linked_list::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The value of the Node.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d33/circular__linked__list_8cpp_source.html#l00033">circular_linked_list.cpp:33</a></div></div>
+<div class="ttc" id="astructoperations__on__datastructures_1_1circular__linked__list_1_1_node_html_a7c867b8e1034a6f5da490c8b8c09cb77"><div class="ttname"><a href="#a7c867b8e1034a6f5da490c8b8c09cb77">operations_on_datastructures::circular_linked_list::Node::next</a></div><div class="ttdeci">Node * next</div><div class="ttdoc">The Node's successor.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d33/circular__linked__list_8cpp_source.html#l00034">circular_linked_list.cpp:34</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -221,15 +240,54 @@ int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
 </dl>
 <p>&lt; Set value of <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> data</p>
 <p>&lt; Initialize successor</p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   48</span>                                              {</div>
-<div class="line"><span class="lineno">   49</span>        <a class="code hl_variable" href="#a7461292b8b91aed86404d0ab019dfdd1">data</a> = _data;  <span class="comment">///&lt; Set value of Node data</span></div>
-<div class="line"><span class="lineno">   50</span>        <a class="code hl_variable" href="#a7c867b8e1034a6f5da490c8b8c09cb77">next</a> = _next;  <span class="comment">///&lt; Initialize successor</span></div>
+<div class="line"><span class="lineno">   49</span>        <a class="code hl_variable" href="#a7461292b8b91aed86404d0ab019dfdd1">data</a> = _data;  </div>
+<div class="line"><span class="lineno">   50</span>        <a class="code hl_variable" href="#a7c867b8e1034a6f5da490c8b8c09cb77">next</a> = _next;  </div>
 <div class="line"><span class="lineno">   51</span>    }</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a7461292b8b91aed86404d0ab019dfdd1" name="a7461292b8b91aed86404d0ab019dfdd1"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a7461292b8b91aed86404d0ab019dfdd1">&#9670;&#160;</a></span>data</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int64_t operations_on_datastructures::circular_linked_list::Node::data</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>The value of the <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>. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a7c867b8e1034a6f5da490c8b8c09cb77" name="a7c867b8e1034a6f5da490c8b8c09cb77"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a7c867b8e1034a6f5da490c8b8c09cb77">&#9670;&#160;</a></span>next</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><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::Node::next</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>The <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>'s successor. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>operations_on_datastructures/<a class="el" href="../../de/d33/circular__linked__list_8cpp.html">circular_linked_list.cpp</a></li>
+<li>operations_on_datastructures/<a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/da/d18/quadratic__equations__complex__numbers_8cpp.html b/da/d18/quadratic__equations__complex__numbers_8cpp.html
index 58f45d219..31c105210 100644
--- a/da/d18/quadratic__equations__complex__numbers_8cpp.html
+++ b/da/d18/quadratic__equations__complex__numbers_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/quadratic_equations_complex_numbers.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/quadratic_equations_complex_numbers.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -125,7 +142,9 @@ Include dependency graph for quadratic_equations_complex_numbers.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../df/db0/quadratic__equations__complex__numbers_8cpp__incl.svg" width="614" height="126"><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">
+</div>
+<p><a href="../../da/d18/quadratic__equations__complex__numbers_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -134,10 +153,10 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:aacb1411ef2029e81f249c21e17c96fdb" id="r_aacb1411ef2029e81f249c21e17c96fdb"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; long double &gt;, 2 &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a> (long double a, long double b, long double c)</td></tr>
+<tr class="memitem:aacb1411ef2029e81f249c21e17c96fdb" id="r_aacb1411ef2029e81f249c21e17c96fdb"><td class="memItemLeft" align="right" valign="top">std::array&lt; std::complex&lt; long double &gt;, 2 &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a> (long double a, long double b, long double c)</td></tr>
 <tr class="memdesc:aacb1411ef2029e81f249c21e17c96fdb"><td class="mdescLeft">&#160;</td><td class="mdescRight">Quadratic equation calculator.  <br /></td></tr>
 <tr class="separator:aacb1411ef2029e81f249c21e17c96fdb"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af7a6d4e3dc85a6288c8f1f7094830c5a" id="r_af7a6d4e3dc85a6288c8f1f7094830c5a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af7a6d4e3dc85a6288c8f1f7094830c5a">assertArray</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; long double &gt;, 2 &gt; input, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; long double &gt;, 2 &gt; expected, size_t precision=10)</td></tr>
+<tr class="memitem:af7a6d4e3dc85a6288c8f1f7094830c5a" id="r_af7a6d4e3dc85a6288c8f1f7094830c5a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af7a6d4e3dc85a6288c8f1f7094830c5a">assertArray</a> (std::array&lt; std::complex&lt; long double &gt;, 2 &gt; input, std::array&lt; std::complex&lt; long double &gt;, 2 &gt; expected, size_t precision=10)</td></tr>
 <tr class="memdesc:af7a6d4e3dc85a6288c8f1f7094830c5a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Asserts an array of complex numbers.  <br /></td></tr>
 <tr class="separator:af7a6d4e3dc85a6288c8f1f7094830c5a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -152,6 +171,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Renjian-buchai" target="_blank">Renjian-buchai</a></dd></dl>
 <p>@description Calculates any quadratic equation in form ax^2 + bx + c.</p>
 <p>Quadratic equation: x = (-b +/- sqrt(b^2 - 4ac)) / 2a </p>
+
+<p class="definition">Definition in file <a class="el" href="../../da/d18/quadratic__equations__complex__numbers_8cpp_source.html">quadratic_equations_complex_numbers.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="af7a6d4e3dc85a6288c8f1f7094830c5a" name="af7a6d4e3dc85a6288c8f1f7094830c5a"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#af7a6d4e3dc85a6288c8f1f7094830c5a">&#9670;&#160;</a></span>assertArray()</h2>
@@ -162,12 +183,12 @@ Functions</h2></td></tr>
         <tr>
           <td class="memname">void assertArray </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; long double &gt;, 2 &gt;</td>          <td class="paramname"><span class="paramname"><em>input</em></span>, </td>
+          <td class="paramtype">std::array&lt; std::complex&lt; long double &gt;, 2 &gt;</td>          <td class="paramname"><span class="paramname"><em>input</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; long double &gt;, 2 &gt;</td>          <td class="paramname"><span class="paramname"><em>expected</em></span>, </td>
+          <td class="paramtype">std::array&lt; std::complex&lt; long double &gt;, 2 &gt;</td>          <td class="paramname"><span class="paramname"><em>expected</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -186,30 +207,25 @@ Functions</h2></td></tr>
   </table>
   </dd>
 </dl>
-<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html#a5">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/quadratic_equations_complex_numbers.cpp</a>.</dd>
+<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html#a1">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/quadratic_equations_complex_numbers.cpp</a>.</dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d18/quadratic__equations__complex__numbers_8cpp_source.html#l00100">100</a> of file <a class="el" href="../../da/d18/quadratic__equations__complex__numbers_8cpp_source.html">quadratic_equations_complex_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  102</span>                                        {</div>
-<div class="line"><span class="lineno">  103</span>    <span class="keywordtype">long</span> <span class="keywordtype">double</span> exponent = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(10, precision);</div>
-<div class="line"><span class="lineno">  104</span>    input[0].real(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(input[0].real() * exponent));</div>
-<div class="line"><span class="lineno">  105</span>    input[1].real(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(input[1].real() * exponent));</div>
-<div class="line"><span class="lineno">  106</span>    input[0].imag(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(input[0].imag() * exponent));</div>
-<div class="line"><span class="lineno">  107</span>    input[1].imag(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(input[1].imag() * exponent));</div>
+<div class="line"><span class="lineno">  103</span>    <span class="keywordtype">long</span> <span class="keywordtype">double</span> exponent = std::pow(10, precision);</div>
+<div class="line"><span class="lineno">  104</span>    input[0].real(std::round(input[0].real() * exponent));</div>
+<div class="line"><span class="lineno">  105</span>    input[1].real(std::round(input[1].real() * exponent));</div>
+<div class="line"><span class="lineno">  106</span>    input[0].imag(std::round(input[0].imag() * exponent));</div>
+<div class="line"><span class="lineno">  107</span>    input[1].imag(std::round(input[1].imag() * exponent));</div>
 <div class="line"><span class="lineno">  108</span> </div>
-<div class="line"><span class="lineno">  109</span>    expected[0].real(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(expected[0].real() * exponent));</div>
-<div class="line"><span class="lineno">  110</span>    expected[1].real(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(expected[1].real() * exponent));</div>
-<div class="line"><span class="lineno">  111</span>    expected[0].imag(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(expected[0].imag() * exponent));</div>
-<div class="line"><span class="lineno">  112</span>    expected[1].imag(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(expected[1].imag() * exponent));</div>
+<div class="line"><span class="lineno">  109</span>    expected[0].real(std::round(expected[0].real() * exponent));</div>
+<div class="line"><span class="lineno">  110</span>    expected[1].real(std::round(expected[1].real() * exponent));</div>
+<div class="line"><span class="lineno">  111</span>    expected[0].imag(std::round(expected[0].imag() * exponent));</div>
+<div class="line"><span class="lineno">  112</span>    expected[1].imag(std::round(expected[1].imag() * exponent));</div>
 <div class="line"><span class="lineno">  113</span> </div>
 <div class="line"><span class="lineno">  114</span>    assert(input == expected);</div>
 <div class="line"><span class="lineno">  115</span>}</div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-<div class="ttc" id="around_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a></div><div class="ttdeci">T round(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d18/quadratic__equations__complex__numbers_8cpp_af7a6d4e3dc85a6288c8f1f7094830c5a_cgraph.svg" width="227" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -229,17 +245,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d18/quadratic__equations__complex__numbers_8cpp_source.html#l00186">186</a> of file <a class="el" href="../../da/d18/quadratic__equations__complex__numbers_8cpp_source.html">quadratic_equations_complex_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  186</span>           {</div>
 <div class="line"><span class="lineno">  187</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Run self-test implementation.</span></div>
 <div class="line"><span class="lineno">  188</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  189</span>}</div>
-<div class="ttc" id="aquadratic__equations__complex__numbers_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations to test quadraticEquation function.</div><div class="ttdef"><b>Definition</b> quadratic_equations_complex_numbers.cpp:122</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d18/quadratic__equations__complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="490" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aquadratic__equations__complex__numbers_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations to test quadraticEquation function.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d18/quadratic__equations__complex__numbers_8cpp_source.html#l00122">quadratic_equations_complex_numbers.cpp:122</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -267,54 +280,56 @@ Here is the call graph for this function:</div>
 
 <p>Self-test implementations to test quadraticEquation function. </p>
 <dl class="section note"><dt>Note</dt><dd>There are 4 different types of solutions: Real and equal, real, complex, complex and equal. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d18/quadratic__equations__complex__numbers_8cpp_source.html#l00122">122</a> of file <a class="el" href="../../da/d18/quadratic__equations__complex__numbers_8cpp_source.html">quadratic_equations_complex_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  122</span>                   {</div>
 <div class="line"><span class="lineno">  123</span>    <span class="comment">// Values are equal and real.</span></div>
-<div class="line"><span class="lineno">  124</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
+<div class="line"><span class="lineno">  124</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
 <div class="line"><span class="lineno">  125</span>                 <span class="stringliteral">&quot;a=1 \n&quot;</span></div>
 <div class="line"><span class="lineno">  126</span>                 <span class="stringliteral">&quot;b=-2 \n&quot;</span></div>
 <div class="line"><span class="lineno">  127</span>                 <span class="stringliteral">&quot;c=1 \n&quot;</span></div>
 <div class="line"><span class="lineno">  128</span>                 <span class="stringliteral">&quot;Expected output: \n&quot;</span></div>
 <div class="line"><span class="lineno">  129</span>                 <span class="stringliteral">&quot;(1, 0), (1, 0)\n\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  130</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::complex&lt;long double&gt;</a>, 2&gt; equalCase{</div>
-<div class="line"><span class="lineno">  131</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{1, 0}, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{1, 0}};</div>
+<div class="line"><span class="lineno">  130</span>    std::array&lt;std::complex&lt;long double&gt;, 2&gt; equalCase{</div>
+<div class="line"><span class="lineno">  131</span>        std::complex&lt;long double&gt;{1, 0}, std::complex&lt;long double&gt;{1, 0}};</div>
 <div class="line"><span class="lineno">  132</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a>(1, -2, 1) == equalCase);</div>
 <div class="line"><span class="lineno">  133</span> </div>
 <div class="line"><span class="lineno">  134</span>    <span class="comment">// Values are equal and complex.</span></div>
-<div class="line"><span class="lineno">  135</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
+<div class="line"><span class="lineno">  135</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
 <div class="line"><span class="lineno">  136</span>                 <span class="stringliteral">&quot;a=1 \n&quot;</span></div>
 <div class="line"><span class="lineno">  137</span>                 <span class="stringliteral">&quot;b=4 \n&quot;</span></div>
 <div class="line"><span class="lineno">  138</span>                 <span class="stringliteral">&quot;c=5 \n&quot;</span></div>
 <div class="line"><span class="lineno">  139</span>                 <span class="stringliteral">&quot;Expected output: \n&quot;</span></div>
 <div class="line"><span class="lineno">  140</span>                 <span class="stringliteral">&quot;(-2, -1), (-2, 1)\n\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  141</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::complex&lt;long double&gt;</a>, 2&gt; complexCase{</div>
-<div class="line"><span class="lineno">  142</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{-2, -1}, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{-2, 1}};</div>
+<div class="line"><span class="lineno">  141</span>    std::array&lt;std::complex&lt;long double&gt;, 2&gt; complexCase{</div>
+<div class="line"><span class="lineno">  142</span>        std::complex&lt;long double&gt;{-2, -1}, std::complex&lt;long double&gt;{-2, 1}};</div>
 <div class="line"><span class="lineno">  143</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a>(1, 4, 5) == complexCase);</div>
 <div class="line"><span class="lineno">  144</span> </div>
 <div class="line"><span class="lineno">  145</span>    <span class="comment">// Values are real.</span></div>
-<div class="line"><span class="lineno">  146</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
+<div class="line"><span class="lineno">  146</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
 <div class="line"><span class="lineno">  147</span>                 <span class="stringliteral">&quot;a=1 \n&quot;</span></div>
 <div class="line"><span class="lineno">  148</span>                 <span class="stringliteral">&quot;b=5 \n&quot;</span></div>
 <div class="line"><span class="lineno">  149</span>                 <span class="stringliteral">&quot;c=1 \n&quot;</span></div>
 <div class="line"><span class="lineno">  150</span>                 <span class="stringliteral">&quot;Expected output: \n&quot;</span></div>
 <div class="line"><span class="lineno">  151</span>                 <span class="stringliteral">&quot;(-4.7912878475, 0), (-0.2087121525, 0)\n\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  152</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::complex&lt;long double&gt;</a>, 2&gt; floatCase{</div>
-<div class="line"><span class="lineno">  153</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{-4.7912878475, 0},</div>
-<div class="line"><span class="lineno">  154</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{-0.2087121525, 0}};</div>
+<div class="line"><span class="lineno">  152</span>    std::array&lt;std::complex&lt;long double&gt;, 2&gt; floatCase{</div>
+<div class="line"><span class="lineno">  153</span>        std::complex&lt;long double&gt;{-4.7912878475, 0},</div>
+<div class="line"><span class="lineno">  154</span>        std::complex&lt;long double&gt;{-0.2087121525, 0}};</div>
 <div class="line"><span class="lineno">  155</span>    <a class="code hl_function" href="#af7a6d4e3dc85a6288c8f1f7094830c5a">assertArray</a>(<a class="code hl_function" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a>(1, 5, 1), floatCase);</div>
 <div class="line"><span class="lineno">  156</span> </div>
 <div class="line"><span class="lineno">  157</span>    <span class="comment">// Values are complex.</span></div>
-<div class="line"><span class="lineno">  158</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
+<div class="line"><span class="lineno">  158</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
 <div class="line"><span class="lineno">  159</span>                 <span class="stringliteral">&quot;a=1 \n&quot;</span></div>
 <div class="line"><span class="lineno">  160</span>                 <span class="stringliteral">&quot;b=1 \n&quot;</span></div>
 <div class="line"><span class="lineno">  161</span>                 <span class="stringliteral">&quot;c=1 \n&quot;</span></div>
 <div class="line"><span class="lineno">  162</span>                 <span class="stringliteral">&quot;Expected output: \n&quot;</span></div>
 <div class="line"><span class="lineno">  163</span>                 <span class="stringliteral">&quot;(-0.5, -0.8660254038), (-0.5, 0.8660254038)\n\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  164</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::complex&lt;long double&gt;</a>, 2&gt; ifloatCase{</div>
-<div class="line"><span class="lineno">  165</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{-0.5, -0.8660254038},</div>
-<div class="line"><span class="lineno">  166</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{-0.5, 0.8660254038}};</div>
+<div class="line"><span class="lineno">  164</span>    std::array&lt;std::complex&lt;long double&gt;, 2&gt; ifloatCase{</div>
+<div class="line"><span class="lineno">  165</span>        std::complex&lt;long double&gt;{-0.5, -0.8660254038},</div>
+<div class="line"><span class="lineno">  166</span>        std::complex&lt;long double&gt;{-0.5, 0.8660254038}};</div>
 <div class="line"><span class="lineno">  167</span>    <a class="code hl_function" href="#af7a6d4e3dc85a6288c8f1f7094830c5a">assertArray</a>(<a class="code hl_function" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a>(1, 1, 1), ifloatCase);</div>
 <div class="line"><span class="lineno">  168</span> </div>
-<div class="line"><span class="lineno">  169</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Exception test: \n&quot;</span></div>
+<div class="line"><span class="lineno">  169</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Exception test: \n&quot;</span></div>
 <div class="line"><span class="lineno">  170</span>                 <span class="stringliteral">&quot;Input: \n&quot;</span></div>
 <div class="line"><span class="lineno">  171</span>                 <span class="stringliteral">&quot;a=0 \n&quot;</span></div>
 <div class="line"><span class="lineno">  172</span>                 <span class="stringliteral">&quot;b=0 \n&quot;</span></div>
@@ -322,22 +337,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  174</span>                 <span class="stringliteral">&quot;Expected output: Exception thrown \n&quot;</span>;</div>
 <div class="line"><span class="lineno">  175</span>    <span class="keywordflow">try</span> {</div>
 <div class="line"><span class="lineno">  176</span>        <a class="code hl_function" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a>(0, 0, 0);</div>
-<div class="line"><span class="lineno">  177</span>    } <span class="keywordflow">catch</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>&amp; e) {</div>
-<div class="line"><span class="lineno">  178</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Exception thrown successfully \n&quot;</span>;</div>
+<div class="line"><span class="lineno">  177</span>    } <span class="keywordflow">catch</span> (std::invalid_argument&amp; e) {</div>
+<div class="line"><span class="lineno">  178</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Exception thrown successfully \n&quot;</span>;</div>
 <div class="line"><span class="lineno">  179</span>    }</div>
 <div class="line"><span class="lineno">  180</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div></div>
-<div class="ttc" id="ainvalid_argument_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></div></div>
-<div class="ttc" id="anamespacemath_html_aacb1411ef2029e81f249c21e17c96fdb"><div class="ttname"><a href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a></div><div class="ttdeci">std::array&lt; std::complex&lt; long double &gt;, 2 &gt; quadraticEquation(long double a, long double b, long double c)</div><div class="ttdoc">Quadratic equation calculator.</div><div class="ttdef"><b>Definition</b> quadratic_equations_complex_numbers.cpp:53</div></div>
-<div class="ttc" id="aquadratic__equations__complex__numbers_8cpp_html_af7a6d4e3dc85a6288c8f1f7094830c5a"><div class="ttname"><a href="#af7a6d4e3dc85a6288c8f1f7094830c5a">assertArray</a></div><div class="ttdeci">void assertArray(std::array&lt; std::complex&lt; long double &gt;, 2 &gt; input, std::array&lt; std::complex&lt; long double &gt;, 2 &gt; expected, size_t precision=10)</div><div class="ttdoc">Asserts an array of complex numbers.</div><div class="ttdef"><b>Definition</b> quadratic_equations_complex_numbers.cpp:100</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d18/quadratic__equations__complex__numbers_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="392" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemath_html_aacb1411ef2029e81f249c21e17c96fdb"><div class="ttname"><a href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a></div><div class="ttdeci">std::array&lt; std::complex&lt; long double &gt;, 2 &gt; quadraticEquation(long double a, long double b, long double c)</div><div class="ttdoc">Quadratic equation calculator.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d18/quadratic__equations__complex__numbers_8cpp_source.html#l00053">quadratic_equations_complex_numbers.cpp:53</a></div></div>
+<div class="ttc" id="aquadratic__equations__complex__numbers_8cpp_html_af7a6d4e3dc85a6288c8f1f7094830c5a"><div class="ttname"><a href="#af7a6d4e3dc85a6288c8f1f7094830c5a">assertArray</a></div><div class="ttdeci">void assertArray(std::array&lt; std::complex&lt; long double &gt;, 2 &gt; input, std::array&lt; std::complex&lt; long double &gt;, 2 &gt; expected, size_t precision=10)</div><div class="ttdoc">Asserts an array of complex numbers.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d18/quadratic__equations__complex__numbers_8cpp_source.html#l00100">quadratic_equations_complex_numbers.cpp:100</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/da/d18/quadratic__equations__complex__numbers_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/da/d18/quadratic__equations__complex__numbers_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index dacbd1887..000000000
--- a/da/d18/quadratic__equations__complex__numbers_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations to test quadraticEquation function." alt="" coords="5,80,49,106"/>
-<area shape="rect" id="Node000002" href="$da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a" title="Asserts an array of complex numbers." alt="" coords="134,55,222,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,87,118,75,119,80,49,92"/>
-<area shape="rect" id="Node000005" href="$dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb" title="Quadratic equation calculator." alt="" coords="97,104,259,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="49,94,82,99,81,104,49,99"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="311,5,382,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="222,52,295,30,297,35,223,57"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/round.html#" title=" " alt="" coords="307,55,386,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="222,65,292,65,292,70,222,70"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="312,104,381,130"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="259,114,296,114,296,120,259,120"/>
-</map>
diff --git a/da/d18/quadratic__equations__complex__numbers_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/da/d18/quadratic__equations__complex__numbers_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 0bb9434a2..000000000
--- a/da/d18/quadratic__equations__complex__numbers_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-81c188ff2f592b92e23e34e76cf709ca
\ No newline at end of file
diff --git a/da/d18/quadratic__equations__complex__numbers_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/da/d18/quadratic__equations__complex__numbers_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index e396e7633..000000000
--- a/da/d18/quadratic__equations__complex__numbers_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="294pt" height="101pt"
- viewBox="0.00 0.00 293.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations to test quadraticEquation function.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a" target="_top" xlink:title="Asserts an array of complex numbers.">
-<polygon fill="white" stroke="#666666" points="162.5,-56.25 96.25,-56.25 96.25,-37 162.5,-37 162.5,-56.25"/>
-<text text-anchor="middle" x="129.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">assertArray</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.7,-30.27C46.23,-32.58 66.56,-36.06 85.01,-39.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.23,-42.63 94.68,-40.86 85.41,-35.73 84.23,-42.63"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb" target="_top" xlink:title="Quadratic equation calculator.">
-<polygon fill="white" stroke="#666666" points="190.25,-19.25 68.5,-19.25 68.5,0 190.25,0 190.25,-19.25"/>
-<text text-anchor="middle" x="129.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::quadraticEquation</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.7,-25.12C39.49,-24.02 47.98,-22.65 57.08,-21.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.62,-24.63 66.93,-19.58 56.5,-17.72 57.62,-24.63"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282.75,-93.25 229.25,-93.25 229.25,-74 282.75,-74 282.75,-93.25"/>
-<text text-anchor="middle" x="256" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.79,-56.25C179.71,-61.27 200.49,-67.44 218.03,-72.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="216.99,-75.99 227.57,-75.48 218.98,-69.28 216.99,-75.99"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.75,-56.25 226.25,-56.25 226.25,-37 285.75,-37 285.75,-56.25"/>
-<text text-anchor="middle" x="256" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.79,-46.62C178.73,-46.62 198.09,-46.62 214.95,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.63,-50.13 224.63,-46.63 214.63,-43.13 214.63,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282,-19.25 230,-19.25 230,0 282,0 282,-19.25"/>
-<text text-anchor="middle" x="256" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.5,-9.62C200,-9.62 209.57,-9.62 218.32,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.15,-13.13 228.15,-9.63 218.15,-6.13 218.15,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d18/quadratic__equations__complex__numbers_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/da/d18/quadratic__equations__complex__numbers_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 606b164aa..000000000
--- a/da/d18/quadratic__equations__complex__numbers_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="294pt" height="101pt"
- viewBox="0.00 0.00 293.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations to test quadraticEquation function.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a" target="_top" xlink:title="Asserts an array of complex numbers.">
-<polygon fill="white" stroke="#666666" points="162.5,-56.25 96.25,-56.25 96.25,-37 162.5,-37 162.5,-56.25"/>
-<text text-anchor="middle" x="129.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">assertArray</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.7,-30.27C46.23,-32.58 66.56,-36.06 85.01,-39.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.23,-42.63 94.68,-40.86 85.41,-35.73 84.23,-42.63"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb" target="_top" xlink:title="Quadratic equation calculator.">
-<polygon fill="white" stroke="#666666" points="190.25,-19.25 68.5,-19.25 68.5,0 190.25,0 190.25,-19.25"/>
-<text text-anchor="middle" x="129.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::quadraticEquation</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.7,-25.12C39.49,-24.02 47.98,-22.65 57.08,-21.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.62,-24.63 66.93,-19.58 56.5,-17.72 57.62,-24.63"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282.75,-93.25 229.25,-93.25 229.25,-74 282.75,-74 282.75,-93.25"/>
-<text text-anchor="middle" x="256" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.79,-56.25C179.71,-61.27 200.49,-67.44 218.03,-72.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="216.99,-75.99 227.57,-75.48 218.98,-69.28 216.99,-75.99"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.75,-56.25 226.25,-56.25 226.25,-37 285.75,-37 285.75,-56.25"/>
-<text text-anchor="middle" x="256" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.79,-46.62C178.73,-46.62 198.09,-46.62 214.95,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.63,-50.13 224.63,-46.63 214.63,-43.13 214.63,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282,-19.25 230,-19.25 230,0 282,0 282,-19.25"/>
-<text text-anchor="middle" x="256" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.5,-9.62C200,-9.62 209.57,-9.62 218.32,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.15,-13.13 228.15,-9.63 218.15,-6.13 218.15,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d18/quadratic__equations__complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/d18/quadratic__equations__complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index aecf35bd5..000000000
--- a/da/d18/quadratic__equations__complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,80,55,106"/>
-<area shape="rect" id="Node000002" href="$da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations to test quadraticEquation function." alt="" coords="103,80,146,106"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,90,87,90,87,96,55,96"/>
-<area shape="rect" id="Node000003" href="$da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a" title="Asserts an array of complex numbers." alt="" coords="231,55,319,80"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,87,216,75,216,80,147,92"/>
-<area shape="rect" id="Node000006" href="$dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb" title="Quadratic equation calculator." alt="" coords="194,104,356,130"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="147,94,179,99,178,104,146,99"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="408,5,480,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="319,52,393,30,394,35,320,57"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/round.html#" title=" " alt="" coords="404,55,484,80"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="320,65,389,65,389,70,320,70"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="409,104,479,130"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="357,114,394,114,394,120,357,120"/>
-</map>
diff --git a/da/d18/quadratic__equations__complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/d18/quadratic__equations__complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index c9d1fffba..000000000
--- a/da/d18/quadratic__equations__complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8d2e05b1ca520a908b5034e87cf75519
\ No newline at end of file
diff --git a/da/d18/quadratic__equations__complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/d18/quadratic__equations__complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 7b8875b7c..000000000
--- a/da/d18/quadratic__equations__complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,155 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="367pt" height="101pt"
- viewBox="0.00 0.00 366.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations to test quadraticEquation function.">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a" target="_top" xlink:title="Asserts an array of complex numbers.">
-<polygon fill="white" stroke="#666666" points="235.5,-56.25 169.25,-56.25 169.25,-37 235.5,-37 235.5,-56.25"/>
-<text text-anchor="middle" x="202.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">assertArray</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.7,-30.27C119.23,-32.58 139.56,-36.06 158.01,-39.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.23,-42.63 167.68,-40.86 158.41,-35.73 157.23,-42.63"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb" target="_top" xlink:title="Quadratic equation calculator.">
-<polygon fill="white" stroke="#666666" points="263.25,-19.25 141.5,-19.25 141.5,0 263.25,0 263.25,-19.25"/>
-<text text-anchor="middle" x="202.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::quadraticEquation</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.7,-25.12C112.49,-24.02 120.98,-22.65 130.08,-21.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.62,-24.63 139.93,-19.58 129.5,-17.72 130.62,-24.63"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="355.75,-93.25 302.25,-93.25 302.25,-74 355.75,-74 355.75,-93.25"/>
-<text text-anchor="middle" x="329" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.79,-56.25C252.71,-61.27 273.49,-67.44 291.03,-72.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.99,-75.99 300.57,-75.48 291.98,-69.28 289.99,-75.99"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.75,-56.25 299.25,-56.25 299.25,-37 358.75,-37 358.75,-56.25"/>
-<text text-anchor="middle" x="329" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.79,-46.62C251.73,-46.62 271.09,-46.62 287.95,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.63,-50.13 297.63,-46.63 287.63,-43.13 287.63,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="355,-19.25 303,-19.25 303,0 355,0 355,-19.25"/>
-<text text-anchor="middle" x="329" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.5,-9.62C273,-9.62 282.57,-9.62 291.32,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.15,-13.13 301.15,-9.63 291.15,-6.13 291.15,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d18/quadratic__equations__complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/da/d18/quadratic__equations__complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 2e3eccee1..000000000
--- a/da/d18/quadratic__equations__complex__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,129 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="367pt" height="101pt"
- viewBox="0.00 0.00 366.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations to test quadraticEquation function.">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a" target="_top" xlink:title="Asserts an array of complex numbers.">
-<polygon fill="white" stroke="#666666" points="235.5,-56.25 169.25,-56.25 169.25,-37 235.5,-37 235.5,-56.25"/>
-<text text-anchor="middle" x="202.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">assertArray</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.7,-30.27C119.23,-32.58 139.56,-36.06 158.01,-39.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.23,-42.63 167.68,-40.86 158.41,-35.73 157.23,-42.63"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb" target="_top" xlink:title="Quadratic equation calculator.">
-<polygon fill="white" stroke="#666666" points="263.25,-19.25 141.5,-19.25 141.5,0 263.25,0 263.25,-19.25"/>
-<text text-anchor="middle" x="202.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::quadraticEquation</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.7,-25.12C112.49,-24.02 120.98,-22.65 130.08,-21.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.62,-24.63 139.93,-19.58 129.5,-17.72 130.62,-24.63"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="355.75,-93.25 302.25,-93.25 302.25,-74 355.75,-74 355.75,-93.25"/>
-<text text-anchor="middle" x="329" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.79,-56.25C252.71,-61.27 273.49,-67.44 291.03,-72.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.99,-75.99 300.57,-75.48 291.98,-69.28 289.99,-75.99"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.75,-56.25 299.25,-56.25 299.25,-37 358.75,-37 358.75,-56.25"/>
-<text text-anchor="middle" x="329" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.79,-46.62C251.73,-46.62 271.09,-46.62 287.95,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.63,-50.13 297.63,-46.63 287.63,-43.13 287.63,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="355,-19.25 303,-19.25 303,0 355,0 355,-19.25"/>
-<text text-anchor="middle" x="329" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M263.5,-9.62C273,-9.62 282.57,-9.62 291.32,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.15,-13.13 301.15,-9.63 291.15,-6.13 291.15,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d18/quadratic__equations__complex__numbers_8cpp_af7a6d4e3dc85a6288c8f1f7094830c5a_cgraph.map b/da/d18/quadratic__equations__complex__numbers_8cpp_af7a6d4e3dc85a6288c8f1f7094830c5a_cgraph.map
deleted file mode 100644
index 0db66ea46..000000000
--- a/da/d18/quadratic__equations__complex__numbers_8cpp_af7a6d4e3dc85a6288c8f1f7094830c5a_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="assertArray" name="assertArray">
-<area shape="rect" id="Node000001" title="Asserts an array of complex numbers." alt="" coords="5,31,94,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="146,5,217,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="94,32,130,25,131,31,95,38"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/round.html#" title=" " alt="" coords="142,55,221,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="95,49,127,55,126,60,94,54"/>
-</map>
diff --git a/da/d18/quadratic__equations__complex__numbers_8cpp_af7a6d4e3dc85a6288c8f1f7094830c5a_cgraph.md5 b/da/d18/quadratic__equations__complex__numbers_8cpp_af7a6d4e3dc85a6288c8f1f7094830c5a_cgraph.md5
deleted file mode 100644
index ab0573fb8..000000000
--- a/da/d18/quadratic__equations__complex__numbers_8cpp_af7a6d4e3dc85a6288c8f1f7094830c5a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d002d0d09ff524a2c7a6d99a07d8b6b5
\ No newline at end of file
diff --git a/da/d18/quadratic__equations__complex__numbers_8cpp_af7a6d4e3dc85a6288c8f1f7094830c5a_cgraph.svg b/da/d18/quadratic__equations__complex__numbers_8cpp_af7a6d4e3dc85a6288c8f1f7094830c5a_cgraph.svg
deleted file mode 100644
index b0a898964..000000000
--- a/da/d18/quadratic__equations__complex__numbers_8cpp_af7a6d4e3dc85a6288c8f1f7094830c5a_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: assertArray Pages: 1 -->
-<svg width="170pt" height="64pt"
- viewBox="0.00 0.00 169.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>assertArray</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Asserts an array of complex numbers.">
-<polygon fill="#999999" stroke="#666666" points="66.25,-37.25 0,-37.25 0,-18 66.25,-18 66.25,-37.25"/>
-<text text-anchor="middle" x="33.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">assertArray</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158.75,-56.25 105.25,-56.25 105.25,-37 158.75,-37 158.75,-56.25"/>
-<text text-anchor="middle" x="132" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.65,-34C75.29,-35.7 84.69,-37.54 93.56,-39.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.85,-42.71 103.34,-41.2 94.2,-35.84 92.85,-42.71"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161.75,-19.25 102.25,-19.25 102.25,0 161.75,0 161.75,-19.25"/>
-<text text-anchor="middle" x="132" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.65,-21.58C74.42,-20.14 82.81,-18.58 90.88,-17.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.29,-20.56 100.49,-15.29 90.02,-13.68 91.29,-20.56"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d18/quadratic__equations__complex__numbers_8cpp_af7a6d4e3dc85a6288c8f1f7094830c5a_cgraph_org.svg b/da/d18/quadratic__equations__complex__numbers_8cpp_af7a6d4e3dc85a6288c8f1f7094830c5a_cgraph_org.svg
deleted file mode 100644
index 74fbba007..000000000
--- a/da/d18/quadratic__equations__complex__numbers_8cpp_af7a6d4e3dc85a6288c8f1f7094830c5a_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: assertArray Pages: 1 -->
-<svg width="170pt" height="64pt"
- viewBox="0.00 0.00 169.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>assertArray</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Asserts an array of complex numbers.">
-<polygon fill="#999999" stroke="#666666" points="66.25,-37.25 0,-37.25 0,-18 66.25,-18 66.25,-37.25"/>
-<text text-anchor="middle" x="33.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">assertArray</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158.75,-56.25 105.25,-56.25 105.25,-37 158.75,-37 158.75,-56.25"/>
-<text text-anchor="middle" x="132" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.65,-34C75.29,-35.7 84.69,-37.54 93.56,-39.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.85,-42.71 103.34,-41.2 94.2,-35.84 92.85,-42.71"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161.75,-19.25 102.25,-19.25 102.25,0 161.75,0 161.75,-19.25"/>
-<text text-anchor="middle" x="132" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.65,-21.58C74.42,-20.14 82.81,-18.58 90.88,-17.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.29,-20.56 100.49,-15.29 90.02,-13.68 91.29,-20.56"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d18/quadratic__equations__complex__numbers_8cpp_source.html b/da/d18/quadratic__equations__complex__numbers_8cpp_source.html
new file mode 100644
index 000000000..96c4e2078
--- /dev/null
+++ b/da/d18/quadratic__equations__complex__numbers_8cpp_source.html
@@ -0,0 +1,283 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/quadratic_equations_complex_numbers.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/d18/quadratic__equations__complex__numbers_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">quadratic_equations_complex_numbers.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;array&gt;</span>      </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#include &lt;cmath&gt;</span>      </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;complex&gt;</span>    </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#include &lt;exception&gt;</span>  </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#include &lt;iomanip&gt;</span>    </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="foldopen" id="foldopen00053" data-start="{" data-end="}">
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">   53</a></span>std::array&lt;std::complex&lt;long double&gt;, 2&gt; <a class="code hl_function" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">quadraticEquation</a>(<span class="keywordtype">long</span> <span class="keywordtype">double</span> a,</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>                                                           <span class="keywordtype">long</span> <span class="keywordtype">double</span> b,</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>                                                           <span class="keywordtype">long</span> <span class="keywordtype">double</span> c) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">if</span> (a == 0) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;quadratic coefficient cannot be 0&quot;</span>);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordtype">long</span> <span class="keywordtype">double</span> discriminant = b * b - 4 * a * c;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    std::array&lt;std::complex&lt;long double&gt;, 2&gt; solutions{0, 0};</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordflow">if</span> (discriminant == 0) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        solutions[0] = -b * 0.5 / a;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        solutions[1] = -b * 0.5 / a;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="keywordflow">return</span> solutions;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="comment">// Complex root (discriminant &lt; 0)</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="comment">// Note that the left term (-b / 2a) is always real. The imaginary part</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="comment">// appears when b^2 - 4ac &lt; 0, so sqrt(b^2 - 4ac) has no real roots. So,</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="comment">// the imaginary component is i * (+/-)sqrt(abs(b^2 - 4ac)) / 2a.</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">if</span> (discriminant &gt; 0) {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        <span class="comment">// Since discriminant &gt; 0, there are only real roots. Therefore,</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        <span class="comment">// imaginary component = 0.</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        solutions[0] = std::complex&lt;long double&gt;{</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            (-b - std::sqrt(discriminant)) * 0.5 / a, 0};</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        solutions[1] = std::complex&lt;long double&gt;{</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            (-b + std::sqrt(discriminant)) * 0.5 / a, 0};</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="keywordflow">return</span> solutions;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    }</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="comment">// Since b^2 - 4ac is &lt; 0, for faster computation, -discriminant is</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="comment">// enough to make it positive.</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    solutions[0] = std::complex&lt;long double&gt;{</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        -b * 0.5 / a, -std::sqrt(-discriminant) * 0.5 / a};</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    solutions[1] = std::complex&lt;long double&gt;{</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        -b * 0.5 / a, std::sqrt(-discriminant) * 0.5 / a};</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keywordflow">return</span> solutions;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>}</div>
+</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="foldopen" id="foldopen00100" data-start="{" data-end="}">
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"><a class="line" href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a">  100</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a">assertArray</a>(std::array&lt;std::complex&lt;long double&gt;, 2&gt; input,</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>                 std::array&lt;std::complex&lt;long double&gt;, 2&gt; expected,</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>                 <span class="keywordtype">size_t</span> precision = 10) {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="keywordtype">long</span> <span class="keywordtype">double</span> exponent = std::pow(10, precision);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    input[0].real(std::round(input[0].real() * exponent));</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    input[1].real(std::round(input[1].real() * exponent));</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    input[0].imag(std::round(input[0].imag() * exponent));</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    input[1].imag(std::round(input[1].imag() * exponent));</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    expected[0].real(std::round(expected[0].real() * exponent));</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    expected[1].real(std::round(expected[1].real() * exponent));</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    expected[0].imag(std::round(expected[0].imag() * exponent));</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    expected[1].imag(std::round(expected[1].imag() * exponent));</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    assert(input == expected);</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>}</div>
+</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="foldopen" id="foldopen00122" data-start="{" data-end="}">
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"><a class="line" href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  122</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    <span class="comment">// Values are equal and real.</span></div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>                 <span class="stringliteral">&quot;a=1 \n&quot;</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>                 <span class="stringliteral">&quot;b=-2 \n&quot;</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>                 <span class="stringliteral">&quot;c=1 \n&quot;</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>                 <span class="stringliteral">&quot;Expected output: \n&quot;</span></div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>                 <span class="stringliteral">&quot;(1, 0), (1, 0)\n\n&quot;</span>;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    std::array&lt;std::complex&lt;long double&gt;, 2&gt; equalCase{</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        std::complex&lt;long double&gt;{1, 0}, std::complex&lt;long double&gt;{1, 0}};</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a>(1, -2, 1) == equalCase);</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span> </div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <span class="comment">// Values are equal and complex.</span></div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>                 <span class="stringliteral">&quot;a=1 \n&quot;</span></div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>                 <span class="stringliteral">&quot;b=4 \n&quot;</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>                 <span class="stringliteral">&quot;c=5 \n&quot;</span></div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>                 <span class="stringliteral">&quot;Expected output: \n&quot;</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>                 <span class="stringliteral">&quot;(-2, -1), (-2, 1)\n\n&quot;</span>;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    std::array&lt;std::complex&lt;long double&gt;, 2&gt; complexCase{</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        std::complex&lt;long double&gt;{-2, -1}, std::complex&lt;long double&gt;{-2, 1}};</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a>(1, 4, 5) == complexCase);</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span> </div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <span class="comment">// Values are real.</span></div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>                 <span class="stringliteral">&quot;a=1 \n&quot;</span></div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>                 <span class="stringliteral">&quot;b=5 \n&quot;</span></div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>                 <span class="stringliteral">&quot;c=1 \n&quot;</span></div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>                 <span class="stringliteral">&quot;Expected output: \n&quot;</span></div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>                 <span class="stringliteral">&quot;(-4.7912878475, 0), (-0.2087121525, 0)\n\n&quot;</span>;</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    std::array&lt;std::complex&lt;long double&gt;, 2&gt; floatCase{</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>        std::complex&lt;long double&gt;{-4.7912878475, 0},</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        std::complex&lt;long double&gt;{-0.2087121525, 0}};</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    <a class="code hl_function" href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a">assertArray</a>(<a class="code hl_function" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a>(1, 5, 1), floatCase);</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span> </div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    <span class="comment">// Values are complex.</span></div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>                 <span class="stringliteral">&quot;a=1 \n&quot;</span></div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>                 <span class="stringliteral">&quot;b=1 \n&quot;</span></div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>                 <span class="stringliteral">&quot;c=1 \n&quot;</span></div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>                 <span class="stringliteral">&quot;Expected output: \n&quot;</span></div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>                 <span class="stringliteral">&quot;(-0.5, -0.8660254038), (-0.5, 0.8660254038)\n\n&quot;</span>;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    std::array&lt;std::complex&lt;long double&gt;, 2&gt; ifloatCase{</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>        std::complex&lt;long double&gt;{-0.5, -0.8660254038},</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        std::complex&lt;long double&gt;{-0.5, 0.8660254038}};</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    <a class="code hl_function" href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a">assertArray</a>(<a class="code hl_function" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a>(1, 1, 1), ifloatCase);</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span> </div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Exception test: \n&quot;</span></div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>                 <span class="stringliteral">&quot;Input: \n&quot;</span></div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>                 <span class="stringliteral">&quot;a=0 \n&quot;</span></div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>                 <span class="stringliteral">&quot;b=0 \n&quot;</span></div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>                 <span class="stringliteral">&quot;c=0\n&quot;</span></div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>                 <span class="stringliteral">&quot;Expected output: Exception thrown \n&quot;</span>;</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    <span class="keywordflow">try</span> {</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        <a class="code hl_function" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a>(0, 0, 0);</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    } <span class="keywordflow">catch</span> (std::invalid_argument&amp; e) {</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Exception thrown successfully \n&quot;</span>;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    }</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>}</div>
+</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span> </div>
+<div class="foldopen" id="foldopen00186" data-start="{" data-end="}">
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"><a class="line" href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  186</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    <a class="code hl_function" href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Run self-test implementation.</span></div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>}</div>
+</div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_aacb1411ef2029e81f249c21e17c96fdb"><div class="ttname"><a href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a></div><div class="ttdeci">std::array&lt; std::complex&lt; long double &gt;, 2 &gt; quadraticEquation(long double a, long double b, long double c)</div><div class="ttdoc">Quadratic equation calculator.</div><div class="ttdef"><b>Definition</b> <a href="#l00053">quadratic_equations_complex_numbers.cpp:53</a></div></div>
+<div class="ttc" id="aquadratic__equations__complex__numbers_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations to test quadraticEquation function.</div><div class="ttdef"><b>Definition</b> <a href="#l00122">quadratic_equations_complex_numbers.cpp:122</a></div></div>
+<div class="ttc" id="aquadratic__equations__complex__numbers_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00186">quadratic_equations_complex_numbers.cpp:186</a></div></div>
+<div class="ttc" id="aquadratic__equations__complex__numbers_8cpp_html_af7a6d4e3dc85a6288c8f1f7094830c5a"><div class="ttname"><a href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a">assertArray</a></div><div class="ttdeci">void assertArray(std::array&lt; std::complex&lt; long double &gt;, 2 &gt; input, std::array&lt; std::complex&lt; long double &gt;, 2 &gt; expected, size_t precision=10)</div><div class="ttdoc">Asserts an array of complex numbers.</div><div class="ttdef"><b>Definition</b> <a href="#l00100">quadratic_equations_complex_numbers.cpp:100</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html">quadratic_equations_complex_numbers.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html
index 0c158e3c5..d8258c83d 100644
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html
+++ b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: probability::geometric_dist::geometric_distribution Class Reference</title>
+<title>TheAlgorithms/C++: probability::geometric_dist::geometric_distribution Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -141,19 +158,20 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:a8aae1cebcf42ed2332f1c7217c401aa3" id="r_a8aae1cebcf42ed2332f1c7217c401aa3"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8aae1cebcf42ed2332f1c7217c401aa3">draw_sample</a> () const</td></tr>
 <tr class="memdesc:a8aae1cebcf42ed2332f1c7217c401aa3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Generates a (discrete) sample according to the geometrical distribution.  <br /></td></tr>
 <tr class="separator:a8aae1cebcf42ed2332f1c7217c401aa3"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a4620163a196709484225774d87de6d69" id="r_a4620163a196709484225774d87de6d69"><td class="memItemLeft" align="right" valign="top">float&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4620163a196709484225774d87de6d69">range_tries</a> (const uint32_t &amp;min_tries=1, const uint32_t &amp;max_tries=<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">std::numeric_limits</a>&lt; uint32_t &gt;::max()) const</td></tr>
+<tr class="memitem:a4620163a196709484225774d87de6d69" id="r_a4620163a196709484225774d87de6d69"><td class="memItemLeft" align="right" valign="top">float&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4620163a196709484225774d87de6d69">range_tries</a> (const uint32_t &amp;min_tries=1, const uint32_t &amp;max_tries=std::numeric_limits&lt; uint32_t &gt;::max()) const</td></tr>
 <tr class="memdesc:a4620163a196709484225774d87de6d69"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function computes the probability to have success in a given range of tries.  <br /></td></tr>
 <tr class="separator:a4620163a196709484225774d87de6d69"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:ad5ed23a251dbe55ad1ed06bf1a465ad3" id="r_ad5ed23a251dbe55ad1ed06bf1a465ad3"><td class="memItemLeft" align="right" valign="top"><a id="ad5ed23a251dbe55ad1ed06bf1a465ad3" name="ad5ed23a251dbe55ad1ed06bf1a465ad3"></a>
-float&#160;</td><td class="memItemRight" valign="bottom"><b>p</b></td></tr>
-<tr class="memdesc:ad5ed23a251dbe55ad1ed06bf1a465ad3"><td class="mdescLeft">&#160;</td><td class="mdescRight">The succes probability p. <br /></td></tr>
+<tr class="memitem:ad5ed23a251dbe55ad1ed06bf1a465ad3" id="r_ad5ed23a251dbe55ad1ed06bf1a465ad3"><td class="memItemLeft" align="right" valign="top">float&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a></td></tr>
+<tr class="memdesc:ad5ed23a251dbe55ad1ed06bf1a465ad3"><td class="mdescLeft">&#160;</td><td class="mdescRight">The succes probability p.  <br /></td></tr>
 <tr class="separator:ad5ed23a251dbe55ad1ed06bf1a465ad3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A class to model the geometric distribution. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html">geometric_dist.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="aa12088ba133dd0910103db0eb0ef2797" name="aa12088ba133dd0910103db0eb0ef2797"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aa12088ba133dd0910103db0eb0ef2797">&#9670;&#160;</a></span>geometric_distribution()</h2>
@@ -185,8 +203,10 @@ float&#160;</td><td class="memItemRight" valign="bottom"><b>p</b></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html">geometric_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   64</span>: <a class="code hl_variable" href="#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>(<a class="code hl_variable" href="#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>) {}</div>
-<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_ad5ed23a251dbe55ad1ed06bf1a465ad3"><div class="ttname"><a href="#ad5ed23a251dbe55ad1ed06bf1a465ad3">probability::geometric_dist::geometric_distribution::p</a></div><div class="ttdeci">float p</div><div class="ttdoc">The succes probability p.</div><div class="ttdef"><b>Definition</b> geometric_dist.cpp:57</div></div>
+<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_ad5ed23a251dbe55ad1ed06bf1a465ad3"><div class="ttname"><a href="#ad5ed23a251dbe55ad1ed06bf1a465ad3">probability::geometric_dist::geometric_distribution::p</a></div><div class="ttdeci">float p</div><div class="ttdoc">The succes probability p.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d72/geometric__dist_8cpp_source.html#l00057">geometric_dist.cpp:57</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -222,16 +242,12 @@ float&#160;</td><td class="memItemRight" valign="bottom"><b>p</b></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The probability to have success within k trials </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  104</span>                                                           {</div>
-<div class="line"><span class="lineno">  105</span>        <span class="keywordflow">return</span> 1.0f - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>((1.0f - <a class="code hl_variable" href="#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>), <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(k));</div>
-<div class="line"><span class="lineno">  106</span>    }</div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph.svg" width="315" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html#l00104">104</a> of file <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html">geometric_dist.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  104</span>                                                           {</div>
+<div class="line"><span class="lineno">  105</span>        <span class="keywordflow">return</span> 1.0f - std::pow((1.0f - <a class="code hl_variable" href="#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>), <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(k));</div>
+<div class="line"><span class="lineno">  106</span>    }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a8aae1cebcf42ed2332f1c7217c401aa3" name="a8aae1cebcf42ed2332f1c7217c401aa3"></a>
@@ -259,20 +275,17 @@ Here is the call graph for this function:</div>
 
 <p>Generates a (discrete) sample according to the geometrical distribution. </p>
 <dl class="section return"><dt>Returns</dt><dd>A geometrically distributed number in [1,\infty) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html#l00125">125</a> of file <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html">geometric_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  125</span>                                 {</div>
 <div class="line"><span class="lineno">  126</span>        <span class="keywordtype">float</span> uniform_sample = <a class="code hl_function" href="../../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba">generate_uniform</a>();</div>
 <div class="line"><span class="lineno">  127</span>        <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(</div>
 <div class="line"><span class="lineno">  128</span>                   <a class="code hl_function" href="#aaf762e88c66918d7afda4234f28a7ddf">inverse_cumulative_distribution</a>(uniform_sample)) +</div>
 <div class="line"><span class="lineno">  129</span>               1;</div>
 <div class="line"><span class="lineno">  130</span>    }</div>
-<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_aaf762e88c66918d7afda4234f28a7ddf"><div class="ttname"><a href="#aaf762e88c66918d7afda4234f28a7ddf">probability::geometric_dist::geometric_distribution::inverse_cumulative_distribution</a></div><div class="ttdeci">float inverse_cumulative_distribution(const float &amp;cdf) const</div><div class="ttdoc">The inverse cumulative distribution function.</div><div class="ttdef"><b>Definition</b> geometric_dist.cpp:116</div></div>
-<div class="ttc" id="ageometric__dist_8cpp_html_a82964ca6180507deb5fafc71050012ba"><div class="ttname"><a href="../../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba">probability::geometric_dist::generate_uniform</a></div><div class="ttdeci">float generate_uniform()</div><div class="ttdoc">Returns a random number between [0,1].</div><div class="ttdef"><b>Definition</b> geometric_dist.cpp:48</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a8aae1cebcf42ed2332f1c7217c401aa3_cgraph.svg" width="567" height="155"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_aaf762e88c66918d7afda4234f28a7ddf"><div class="ttname"><a href="#aaf762e88c66918d7afda4234f28a7ddf">probability::geometric_dist::geometric_distribution::inverse_cumulative_distribution</a></div><div class="ttdeci">float inverse_cumulative_distribution(const float &amp;cdf) const</div><div class="ttdoc">The inverse cumulative distribution function.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d72/geometric__dist_8cpp_source.html#l00116">geometric_dist.cpp:116</a></div></div>
+<div class="ttc" id="ageometric__dist_8cpp_html_a82964ca6180507deb5fafc71050012ba"><div class="ttname"><a href="../../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba">probability::geometric_dist::generate_uniform</a></div><div class="ttdeci">float generate_uniform()</div><div class="ttdoc">Returns a random number between [0,1].</div><div class="ttdef"><b>Definition</b> <a href="../../de/d72/geometric__dist_8cpp_source.html#l00048">geometric_dist.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a41051365f8ac7700f2ed5880a6760413" name="a41051365f8ac7700f2ed5880a6760413"></a>
@@ -300,6 +313,8 @@ Here is the call graph for this function:</div>
 
 <p>The expected value of a geometrically distributed random variable X. </p>
 <dl class="section return"><dt>Returns</dt><dd>E[X] = 1/p </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html#l00071">71</a> of file <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html">geometric_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   71</span>{ <span class="keywordflow">return</span> 1.0f / <a class="code hl_variable" href="#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>; }</div>
 </div><!-- fragment -->
 </div>
@@ -335,16 +350,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The number of (exact) trials. </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  116</span>                                                                  {</div>
-<div class="line"><span class="lineno">  117</span>        <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">std::log</a>(1.0f - cdf) / <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">std::log</a>(1.0f - <a class="code hl_variable" href="#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>);</div>
-<div class="line"><span class="lineno">  118</span>    }</div>
-<div class="ttc" id="alog_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/log.html">std::log</a></div><div class="ttdeci">T log(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aaf762e88c66918d7afda4234f28a7ddf_cgraph.svg" width="335" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html#l00116">116</a> of file <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html">geometric_dist.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  116</span>                                                                  {</div>
+<div class="line"><span class="lineno">  117</span>        <span class="keywordflow">return</span> std::log(1.0f - cdf) / std::log(1.0f - <a class="code hl_variable" href="#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>);</div>
+<div class="line"><span class="lineno">  118</span>    }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aee973db9f0435e0cb4cc70f8eb3447a1" name="aee973db9f0435e0cb4cc70f8eb3447a1"></a>
@@ -378,15 +389,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>A number between [0,1] according to p * (1-p)^{k-1} </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   93</span>                                                       {</div>
-<div class="line"><span class="lineno">   94</span>        <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>((1.0f - <a class="code hl_variable" href="#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>), <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(k - 1)) * <a class="code hl_variable" href="#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>;</div>
-<div class="line"><span class="lineno">   95</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aee973db9f0435e0cb4cc70f8eb3447a1_cgraph.svg" width="315" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html#l00093">93</a> of file <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html">geometric_dist.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   93</span>                                                       {</div>
+<div class="line"><span class="lineno">   94</span>        <span class="keywordflow">return</span> std::pow((1.0f - <a class="code hl_variable" href="#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>), <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(k - 1)) * <a class="code hl_variable" href="#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>;</div>
+<div class="line"><span class="lineno">   95</span>    }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4620163a196709484225774d87de6d69" name="a4620163a196709484225774d87de6d69"></a>
@@ -406,7 +414,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const uint32_t &amp;</td>          <td class="paramname"><span class="paramname"><em>max_tries</em></span><span class="paramdefsep"> = </span><span class="paramdefval"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">std::numeric_limits</a>&lt;uint32_t&gt;::max()</span>&#160;) const</td>
+          <td class="paramtype">const uint32_t &amp;</td>          <td class="paramname"><span class="paramname"><em>max_tries</em></span><span class="paramdefsep"> = </span><span class="paramdefval">std::numeric_limits&lt;uint32_t&gt;::max()</span>&#160;) const</td>
         </tr>
       </table>
   </td>
@@ -425,21 +433,17 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The probability of having success within a range of tries [min_tries, max_tries] </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html#l00145">145</a> of file <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html">geometric_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  147</span>                                                                  {</div>
 <div class="line"><span class="lineno">  148</span>        <span class="keywordtype">float</span> cdf_lower = <a class="code hl_function" href="#a08328dc7d62188427111f176b56a105a">cumulative_distribution</a>(min_tries - 1);</div>
-<div class="line"><span class="lineno">  149</span>        <span class="keywordtype">float</span> cdf_upper = max_tries == <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html">std::numeric_limits&lt;uint32_t&gt;::max</a>()</div>
+<div class="line"><span class="lineno">  149</span>        <span class="keywordtype">float</span> cdf_upper = max_tries == std::numeric_limits&lt;uint32_t&gt;::max()</div>
 <div class="line"><span class="lineno">  150</span>                              ? 1.0f</div>
 <div class="line"><span class="lineno">  151</span>                              : <a class="code hl_function" href="#a08328dc7d62188427111f176b56a105a">cumulative_distribution</a>(max_tries);</div>
 <div class="line"><span class="lineno">  152</span>        <span class="keywordflow">return</span> cdf_upper - cdf_lower;</div>
 <div class="line"><span class="lineno">  153</span>    }</div>
-<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_a08328dc7d62188427111f176b56a105a"><div class="ttname"><a href="#a08328dc7d62188427111f176b56a105a">probability::geometric_dist::geometric_distribution::cumulative_distribution</a></div><div class="ttdeci">float cumulative_distribution(const uint32_t &amp;k) const</div><div class="ttdoc">The cumulative distribution function.</div><div class="ttdef"><b>Definition</b> geometric_dist.cpp:104</div></div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html">std::numeric_limits::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a4620163a196709484225774d87de6d69_cgraph.svg" width="547" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_a08328dc7d62188427111f176b56a105a"><div class="ttname"><a href="#a08328dc7d62188427111f176b56a105a">probability::geometric_dist::geometric_distribution::cumulative_distribution</a></div><div class="ttdeci">float cumulative_distribution(const uint32_t &amp;k) const</div><div class="ttdoc">The cumulative distribution function.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d72/geometric__dist_8cpp_source.html#l00104">geometric_dist.cpp:104</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0a10c512e13dd3a052e1c6d7f4d6f0f2" name="a0a10c512e13dd3a052e1c6d7f4d6f0f2"></a>
@@ -467,15 +471,11 @@ Here is the call graph for this function:</div>
 
 <p>The standard deviation of a geometrically distributed random variable X. </p>
 <dl class="section return"><dt>Returns</dt><dd>\sigma = \sqrt{V[X]} </dd></dl>
-<div class="fragment"><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/numeric/math/sqrt.html">std::sqrt</a>(<a class="code hl_function" href="#aea8b0d649f0dc9a6f8baf3341a0b4960">variance</a>()); }</div>
-<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_aea8b0d649f0dc9a6f8baf3341a0b4960"><div class="ttname"><a href="#aea8b0d649f0dc9a6f8baf3341a0b4960">probability::geometric_dist::geometric_distribution::variance</a></div><div class="ttdeci">float variance() const</div><div class="ttdoc">The variance of a geometrically distributed random variable X.</div><div class="ttdef"><b>Definition</b> geometric_dist.cpp:77</div></div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a0a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph.svg" width="428" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html#l00084">84</a> of file <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html">geometric_dist.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   84</span>{ <span class="keywordflow">return</span> std::sqrt(<a class="code hl_function" href="#aea8b0d649f0dc9a6f8baf3341a0b4960">variance</a>()); }</div>
+<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_aea8b0d649f0dc9a6f8baf3341a0b4960"><div class="ttname"><a href="#aea8b0d649f0dc9a6f8baf3341a0b4960">probability::geometric_dist::geometric_distribution::variance</a></div><div class="ttdeci">float variance() const</div><div class="ttdoc">The variance of a geometrically distributed random variable X.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d72/geometric__dist_8cpp_source.html#l00077">geometric_dist.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aea8b0d649f0dc9a6f8baf3341a0b4960" name="aea8b0d649f0dc9a6f8baf3341a0b4960"></a>
@@ -503,12 +503,41 @@ Here is the call graph for this function:</div>
 
 <p>The variance of a geometrically distributed random variable X. </p>
 <dl class="section return"><dt>Returns</dt><dd>V[X] = (1 - p) / p^2 </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html">geometric_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   77</span>{ <span class="keywordflow">return</span> (1.0f - <a class="code hl_variable" href="#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>) / (<a class="code hl_variable" href="#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a> * <a class="code hl_variable" href="#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>); }</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="ad5ed23a251dbe55ad1ed06bf1a465ad3" name="ad5ed23a251dbe55ad1ed06bf1a465ad3"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ad5ed23a251dbe55ad1ed06bf1a465ad3">&#9670;&#160;</a></span>p</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">float probability::geometric_dist::geometric_distribution::p</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>The succes probability p. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html">geometric_dist.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>probability/<a class="el" href="../../de/d72/geometric__dist_8cpp.html">geometric_dist.cpp</a></li>
+<li>probability/<a class="el" href="../../de/d72/geometric__dist_8cpp_source.html">geometric_dist.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph.map b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph.map
deleted file mode 100644
index 67483171d..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="probability::geometric_dist::geometric_distribution::cumulative_distribution" name="probability::geometric_dist::geometric_distribution::cumulative_distribution">
-<area shape="rect" id="Node000001" title="The cumulative distribution function." alt="" coords="5,5,190,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="238,20,309,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="190,30,222,30,222,36,190,36"/>
-</map>
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph.md5 b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph.md5
deleted file mode 100644
index d49ceea5b..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2649ff52598a11edb7b2a7d82d116400
\ No newline at end of file
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph.svg b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph.svg
deleted file mode 100644
index 27c3d0224..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::geometric_distribution::cumulative_distribution Pages: 1 -->
-<svg width="236pt" height="50pt"
- viewBox="0.00 0.00 235.75 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>probability::geometric_dist::geometric_distribution::cumulative_distribution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The cumulative distribution function.">
-<polygon fill="#999999" stroke="#666666" points="138.25,-41.75 0,-41.75 0,0 138.25,0 138.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="69.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::cumulative_distribution</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.75,-30.5 174.25,-30.5 174.25,-11.25 227.75,-11.25 227.75,-30.5"/>
-<text text-anchor="middle" x="201" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.49,-20.88C146.75,-20.88 154.93,-20.88 162.51,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.32,-24.38 172.32,-20.88 162.32,-17.38 162.32,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph_org.svg b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph_org.svg
deleted file mode 100644
index 1f66313f2..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a08328dc7d62188427111f176b56a105a_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::geometric_distribution::cumulative_distribution Pages: 1 -->
-<svg width="236pt" height="50pt"
- viewBox="0.00 0.00 235.75 49.75" 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.75)">
-<title>probability::geometric_dist::geometric_distribution::cumulative_distribution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The cumulative distribution function.">
-<polygon fill="#999999" stroke="#666666" points="138.25,-41.75 0,-41.75 0,0 138.25,0 138.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="69.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::cumulative_distribution</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.75,-30.5 174.25,-30.5 174.25,-11.25 227.75,-11.25 227.75,-30.5"/>
-<text text-anchor="middle" x="201" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.49,-20.88C146.75,-20.88 154.93,-20.88 162.51,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.32,-24.38 172.32,-20.88 162.32,-17.38 162.32,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a0a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph.map b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a0a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph.map
deleted file mode 100644
index 2a4d88260..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a0a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="probability::geometric_dist::geometric_distribution::standard_deviation" name="probability::geometric_dist::geometric_distribution::standard_deviation">
-<area shape="rect" id="Node000001" title="The standard deviation of a geometrically distributed random variable X." alt="" coords="5,24,190,79"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="295,5,364,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="190,36,279,23,280,28,191,41"/>
-<area shape="rect" id="Node000003" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960" title="The variance of a geometrically distributed random variable X." alt="" coords="238,56,422,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="191,62,222,66,222,71,190,67"/>
-</map>
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a0a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph.md5 b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a0a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph.md5
deleted file mode 100644
index 33f0dcfdb..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a0a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6c40e6c02844b196b425b9cdfa20cf0f
\ No newline at end of file
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a0a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph.svg b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a0a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph.svg
deleted file mode 100644
index 138c163c7..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a0a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph.svg
+++ /dev/null
@@ -1,87 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::geometric_distribution::standard_deviation Pages: 1 -->
-<svg width="321pt" height="88pt"
- viewBox="0.00 0.00 320.50 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>probability::geometric_dist::geometric_distribution::standard_deviation</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The standard deviation of a geometrically distributed random variable X.">
-<polygon fill="#999999" stroke="#666666" points="138.25,-65.75 0,-65.75 0,-24 138.25,-24 138.25,-65.75"/>
-<text text-anchor="start" x="8" y="-52.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="69.12" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::standard_deviation</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269.38,-79.5 217.38,-79.5 217.38,-60.25 269.38,-60.25 269.38,-79.5"/>
-<text text-anchor="middle" x="243.38" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.7,-54.83C161.65,-58.16 186.33,-61.74 205.86,-64.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.1,-68 215.5,-65.97 206.1,-61.07 205.1,-68"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960" target="_top" xlink:title="The variance of a geometrically distributed random variable X.">
-<polygon fill="white" stroke="#666666" points="312.5,-41.75 174.25,-41.75 174.25,0 312.5,0 312.5,-41.75"/>
-<text text-anchor="start" x="182.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="182.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="243.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.7,-35.32C146.54,-34.23 154.59,-33.11 162.56,-32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.84,-35.49 172.26,-30.64 161.87,-28.56 162.84,-35.49"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a0a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph_org.svg b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a0a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph_org.svg
deleted file mode 100644
index 7b57bb52c..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a0a10c512e13dd3a052e1c6d7f4d6f0f2_cgraph_org.svg
+++ /dev/null
@@ -1,61 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::geometric_distribution::standard_deviation Pages: 1 -->
-<svg width="321pt" height="88pt"
- viewBox="0.00 0.00 320.50 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>probability::geometric_dist::geometric_distribution::standard_deviation</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The standard deviation of a geometrically distributed random variable X.">
-<polygon fill="#999999" stroke="#666666" points="138.25,-65.75 0,-65.75 0,-24 138.25,-24 138.25,-65.75"/>
-<text text-anchor="start" x="8" y="-52.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="69.12" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::standard_deviation</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269.38,-79.5 217.38,-79.5 217.38,-60.25 269.38,-60.25 269.38,-79.5"/>
-<text text-anchor="middle" x="243.38" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.7,-54.83C161.65,-58.16 186.33,-61.74 205.86,-64.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.1,-68 215.5,-65.97 206.1,-61.07 205.1,-68"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960" target="_top" xlink:title="The variance of a geometrically distributed random variable X.">
-<polygon fill="white" stroke="#666666" points="312.5,-41.75 174.25,-41.75 174.25,0 312.5,0 312.5,-41.75"/>
-<text text-anchor="start" x="182.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="182.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="243.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.7,-35.32C146.54,-34.23 154.59,-33.11 162.56,-32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.84,-35.49 172.26,-30.64 161.87,-28.56 162.84,-35.49"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a4620163a196709484225774d87de6d69_cgraph.map b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a4620163a196709484225774d87de6d69_cgraph.map
deleted file mode 100644
index 99c5e4f4c..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a4620163a196709484225774d87de6d69_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="probability::geometric_dist::geometric_distribution::range_tries" name="probability::geometric_dist::geometric_distribution::range_tries">
-<area shape="rect" id="Node000001" title="This function computes the probability to have success in a given range of tries." alt="" coords="5,39,190,94"/>
-<area shape="rect" id="Node000002" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a" title="The cumulative distribution function." alt="" coords="238,5,422,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="190,51,222,46,222,51,191,56"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/numeric_limits/max.html#" title=" " alt="" coords="248,86,412,111"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="191,77,233,82,232,88,190,82"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="470,20,541,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="422,30,454,30,454,36,422,36"/>
-</map>
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a4620163a196709484225774d87de6d69_cgraph.md5 b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a4620163a196709484225774d87de6d69_cgraph.md5
deleted file mode 100644
index c0e7fd540..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a4620163a196709484225774d87de6d69_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cf801f9a45e9b64e9067e20b4eda3b23
\ No newline at end of file
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a4620163a196709484225774d87de6d69_cgraph.svg b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a4620163a196709484225774d87de6d69_cgraph.svg
deleted file mode 100644
index b54409600..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a4620163a196709484225774d87de6d69_cgraph.svg
+++ /dev/null
@@ -1,105 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::geometric_distribution::range_tries Pages: 1 -->
-<svg width="410pt" height="88pt"
- viewBox="0.00 0.00 410.00 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>probability::geometric_dist::geometric_distribution::range_tries</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function computes the probability to have success in a given range of tries.">
-<polygon fill="#999999" stroke="#666666" points="138.25,-54.5 0,-54.5 0,-12.75 138.25,-12.75 138.25,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="8" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="69.12" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">::range_tries</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a" target="_top" xlink:title="The cumulative distribution function.">
-<polygon fill="white" stroke="#666666" points="312.5,-79.5 174.25,-79.5 174.25,-37.75 312.5,-37.75 312.5,-79.5"/>
-<text text-anchor="start" x="182.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="182.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="243.38" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">::cumulative_distribution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.7,-43.58C146.54,-44.72 154.59,-45.88 162.56,-47.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.86,-50.48 172.26,-48.45 162.87,-43.55 161.86,-50.48"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305,-19.25 181.75,-19.25 181.75,0 305,0 305,-19.25"/>
-<text text-anchor="middle" x="243.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.7,-24.07C149.03,-22.63 159.72,-21.14 170.13,-19.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.36,-23.19 179.79,-18.35 169.4,-16.26 170.36,-23.19"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="402,-68.25 348.5,-68.25 348.5,-49 402,-49 402,-68.25"/>
-<text text-anchor="middle" x="375.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M312.74,-58.62C321,-58.62 329.18,-58.62 336.76,-58.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.57,-62.13 346.57,-58.63 336.57,-55.13 336.57,-62.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a4620163a196709484225774d87de6d69_cgraph_org.svg b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a4620163a196709484225774d87de6d69_cgraph_org.svg
deleted file mode 100644
index f4a6f8ae6..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a4620163a196709484225774d87de6d69_cgraph_org.svg
+++ /dev/null
@@ -1,79 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::geometric_distribution::range_tries Pages: 1 -->
-<svg width="410pt" height="88pt"
- viewBox="0.00 0.00 410.00 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>probability::geometric_dist::geometric_distribution::range_tries</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function computes the probability to have success in a given range of tries.">
-<polygon fill="#999999" stroke="#666666" points="138.25,-54.5 0,-54.5 0,-12.75 138.25,-12.75 138.25,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="8" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="69.12" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">::range_tries</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a" target="_top" xlink:title="The cumulative distribution function.">
-<polygon fill="white" stroke="#666666" points="312.5,-79.5 174.25,-79.5 174.25,-37.75 312.5,-37.75 312.5,-79.5"/>
-<text text-anchor="start" x="182.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="182.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="243.38" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">::cumulative_distribution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.7,-43.58C146.54,-44.72 154.59,-45.88 162.56,-47.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.86,-50.48 172.26,-48.45 162.87,-43.55 161.86,-50.48"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305,-19.25 181.75,-19.25 181.75,0 305,0 305,-19.25"/>
-<text text-anchor="middle" x="243.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.7,-24.07C149.03,-22.63 159.72,-21.14 170.13,-19.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.36,-23.19 179.79,-18.35 169.4,-16.26 170.36,-23.19"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="402,-68.25 348.5,-68.25 348.5,-49 402,-49 402,-68.25"/>
-<text text-anchor="middle" x="375.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M312.74,-58.62C321,-58.62 329.18,-58.62 336.76,-58.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.57,-62.13 346.57,-58.63 336.57,-55.13 336.57,-62.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a8aae1cebcf42ed2332f1c7217c401aa3_cgraph.map b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a8aae1cebcf42ed2332f1c7217c401aa3_cgraph.map
deleted file mode 100644
index 88c8fed89..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a8aae1cebcf42ed2332f1c7217c401aa3_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="probability::geometric_dist::geometric_distribution::draw_sample" name="probability::geometric_dist::geometric_distribution::draw_sample">
-<area shape="rect" id="Node000001" title="Generates a (discrete) sample according to the geometrical distribution." alt="" coords="5,58,190,114"/>
-<area shape="rect" id="Node000002" href="$de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba" title="Returns a random number between [0,1]." alt="" coords="265,29,422,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="190,70,249,61,250,66,190,75"/>
-<area shape="rect" id="Node000003" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf" title="The inverse cumulative distribution function." alt="" coords="238,94,449,150"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="190,97,222,101,222,107,190,102"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="308,29,306,19,312,10,324,5,343,3,364,5,376,11,373,16,362,10,343,8,326,10,315,15,311,20,313,28"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/log.html#" title=" " alt="" coords="497,109,561,134"/>
-<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="450,119,481,119,481,124,450,124"/>
-</map>
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a8aae1cebcf42ed2332f1c7217c401aa3_cgraph.md5 b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a8aae1cebcf42ed2332f1c7217c401aa3_cgraph.md5
deleted file mode 100644
index 6b93d7c06..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a8aae1cebcf42ed2332f1c7217c401aa3_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b69f35135fc18fbb6342ed383a572b27
\ No newline at end of file
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a8aae1cebcf42ed2332f1c7217c401aa3_cgraph.svg b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a8aae1cebcf42ed2332f1c7217c401aa3_cgraph.svg
deleted file mode 100644
index fbdb81f0a..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a8aae1cebcf42ed2332f1c7217c401aa3_cgraph.svg
+++ /dev/null
@@ -1,115 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::geometric_distribution::draw_sample Pages: 1 -->
-<svg width="425pt" height="116pt"
- viewBox="0.00 0.00 425.00 116.12" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 112.12)">
-<title>probability::geometric_dist::geometric_distribution::draw_sample</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Generates a (discrete) sample according to the geometrical distribution.">
-<polygon fill="#999999" stroke="#666666" points="138.25,-68.75 0,-68.75 0,-27 138.25,-27 138.25,-68.75"/>
-<text text-anchor="start" x="8" y="-55.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="8" y="-44" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="69.12" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">::draw_sample</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba" target="_top" xlink:title="Returns a random number between [0,1].">
-<polygon fill="white" stroke="#666666" points="312.5,-90.12 194.5,-90.12 194.5,-59.62 312.5,-59.62 312.5,-90.12"/>
-<text text-anchor="start" x="202.5" y="-76.62" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="middle" x="253.5" y="-65.38" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::generate_uniform</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.55,-58.01C153.13,-60.16 168.54,-62.44 183.15,-64.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.24,-68.01 192.65,-66.01 183.27,-61.09 182.24,-68.01"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf" target="_top" xlink:title="The inverse cumulative distribution function.">
-<polygon fill="white" stroke="#666666" points="332.75,-41.75 174.25,-41.75 174.25,0 332.75,0 332.75,-41.75"/>
-<text text-anchor="start" x="182.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="182.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="253.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::inverse_cumulative_distribution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.55,-37.74C146.39,-36.58 154.46,-35.39 162.51,-34.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163,-37.66 172.38,-32.74 161.97,-30.74 163,-37.66"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.8,-90.61C223.76,-99.68 231.99,-108.12 253.5,-108.12 265.26,-108.12 273.05,-105.6 276.87,-101.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="280.32,-102.46 278.02,-92.11 273.37,-101.63 280.32,-102.46"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/log.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="417,-30.5 368.75,-30.5 368.75,-11.25 417,-11.25 417,-30.5"/>
-<text text-anchor="middle" x="392.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::log</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.22,-20.88C341.54,-20.88 349.65,-20.88 357.07,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="356.92,-24.38 366.92,-20.88 356.92,-17.38 356.92,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a8aae1cebcf42ed2332f1c7217c401aa3_cgraph_org.svg b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a8aae1cebcf42ed2332f1c7217c401aa3_cgraph_org.svg
deleted file mode 100644
index 226a17448..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_a8aae1cebcf42ed2332f1c7217c401aa3_cgraph_org.svg
+++ /dev/null
@@ -1,89 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::geometric_distribution::draw_sample Pages: 1 -->
-<svg width="425pt" height="116pt"
- viewBox="0.00 0.00 425.00 116.12" 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 112.12)">
-<title>probability::geometric_dist::geometric_distribution::draw_sample</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Generates a (discrete) sample according to the geometrical distribution.">
-<polygon fill="#999999" stroke="#666666" points="138.25,-68.75 0,-68.75 0,-27 138.25,-27 138.25,-68.75"/>
-<text text-anchor="start" x="8" y="-55.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="8" y="-44" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="69.12" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">::draw_sample</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba" target="_top" xlink:title="Returns a random number between [0,1].">
-<polygon fill="white" stroke="#666666" points="312.5,-90.12 194.5,-90.12 194.5,-59.62 312.5,-59.62 312.5,-90.12"/>
-<text text-anchor="start" x="202.5" y="-76.62" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="middle" x="253.5" y="-65.38" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::generate_uniform</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.55,-58.01C153.13,-60.16 168.54,-62.44 183.15,-64.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.24,-68.01 192.65,-66.01 183.27,-61.09 182.24,-68.01"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf" target="_top" xlink:title="The inverse cumulative distribution function.">
-<polygon fill="white" stroke="#666666" points="332.75,-41.75 174.25,-41.75 174.25,0 332.75,0 332.75,-41.75"/>
-<text text-anchor="start" x="182.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="182.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="253.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::inverse_cumulative_distribution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.55,-37.74C146.39,-36.58 154.46,-35.39 162.51,-34.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163,-37.66 172.38,-32.74 161.97,-30.74 163,-37.66"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.8,-90.61C223.76,-99.68 231.99,-108.12 253.5,-108.12 265.26,-108.12 273.05,-105.6 276.87,-101.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="280.32,-102.46 278.02,-92.11 273.37,-101.63 280.32,-102.46"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/log.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="417,-30.5 368.75,-30.5 368.75,-11.25 417,-11.25 417,-30.5"/>
-<text text-anchor="middle" x="392.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::log</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.22,-20.88C341.54,-20.88 349.65,-20.88 357.07,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="356.92,-24.38 366.92,-20.88 356.92,-17.38 356.92,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aaf762e88c66918d7afda4234f28a7ddf_cgraph.map b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aaf762e88c66918d7afda4234f28a7ddf_cgraph.map
deleted file mode 100644
index 84ba822ce..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aaf762e88c66918d7afda4234f28a7ddf_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="probability::geometric_dist::geometric_distribution::inverse_cumulative_distribution" name="probability::geometric_dist::geometric_distribution::inverse_cumulative_distribution">
-<area shape="rect" id="Node000001" title="The inverse cumulative distribution function." alt="" coords="5,5,217,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/log.html#" title=" " alt="" coords="265,20,329,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="217,30,249,30,249,36,217,36"/>
-</map>
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aaf762e88c66918d7afda4234f28a7ddf_cgraph.md5 b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aaf762e88c66918d7afda4234f28a7ddf_cgraph.md5
deleted file mode 100644
index d14e9882e..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aaf762e88c66918d7afda4234f28a7ddf_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6d4d47ff40518a661c301b3ef7c0c094
\ No newline at end of file
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aaf762e88c66918d7afda4234f28a7ddf_cgraph.svg b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aaf762e88c66918d7afda4234f28a7ddf_cgraph.svg
deleted file mode 100644
index 0fa69a2f8..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aaf762e88c66918d7afda4234f28a7ddf_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::geometric_distribution::inverse_cumulative_distribution Pages: 1 -->
-<svg width="251pt" height="50pt"
- viewBox="0.00 0.00 250.75 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>probability::geometric_dist::geometric_distribution::inverse_cumulative_distribution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The inverse cumulative distribution function.">
-<polygon fill="#999999" stroke="#666666" points="158.5,-41.75 0,-41.75 0,0 158.5,0 158.5,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="79.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::inverse_cumulative_distribution</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/log.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242.75,-30.5 194.5,-30.5 194.5,-11.25 242.75,-11.25 242.75,-30.5"/>
-<text text-anchor="middle" x="218.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::log</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.97,-20.88C167.29,-20.88 175.4,-20.88 182.82,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.67,-24.38 192.67,-20.88 182.67,-17.38 182.67,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aaf762e88c66918d7afda4234f28a7ddf_cgraph_org.svg b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aaf762e88c66918d7afda4234f28a7ddf_cgraph_org.svg
deleted file mode 100644
index b40f9d12d..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aaf762e88c66918d7afda4234f28a7ddf_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::geometric_distribution::inverse_cumulative_distribution Pages: 1 -->
-<svg width="251pt" height="50pt"
- viewBox="0.00 0.00 250.75 49.75" 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.75)">
-<title>probability::geometric_dist::geometric_distribution::inverse_cumulative_distribution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The inverse cumulative distribution function.">
-<polygon fill="#999999" stroke="#666666" points="158.5,-41.75 0,-41.75 0,0 158.5,0 158.5,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="79.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::inverse_cumulative_distribution</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/log.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242.75,-30.5 194.5,-30.5 194.5,-11.25 242.75,-11.25 242.75,-30.5"/>
-<text text-anchor="middle" x="218.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::log</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.97,-20.88C167.29,-20.88 175.4,-20.88 182.82,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.67,-24.38 192.67,-20.88 182.67,-17.38 182.67,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aee973db9f0435e0cb4cc70f8eb3447a1_cgraph.map b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aee973db9f0435e0cb4cc70f8eb3447a1_cgraph.map
deleted file mode 100644
index 3001d83fa..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aee973db9f0435e0cb4cc70f8eb3447a1_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="probability::geometric_dist::geometric_distribution::probability_density" name="probability::geometric_dist::geometric_distribution::probability_density">
-<area shape="rect" id="Node000001" title="The probability density function." alt="" coords="5,5,190,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="238,20,309,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="190,30,222,30,222,36,190,36"/>
-</map>
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aee973db9f0435e0cb4cc70f8eb3447a1_cgraph.md5 b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aee973db9f0435e0cb4cc70f8eb3447a1_cgraph.md5
deleted file mode 100644
index b582660e0..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aee973db9f0435e0cb4cc70f8eb3447a1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-102ba1d75f61cf033978633641c716f4
\ No newline at end of file
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aee973db9f0435e0cb4cc70f8eb3447a1_cgraph.svg b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aee973db9f0435e0cb4cc70f8eb3447a1_cgraph.svg
deleted file mode 100644
index 5b2f67cb1..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aee973db9f0435e0cb4cc70f8eb3447a1_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::geometric_distribution::probability_density Pages: 1 -->
-<svg width="236pt" height="50pt"
- viewBox="0.00 0.00 235.75 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>probability::geometric_dist::geometric_distribution::probability_density</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The probability density function.">
-<polygon fill="#999999" stroke="#666666" points="138.25,-41.75 0,-41.75 0,0 138.25,0 138.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="69.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::probability_density</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.75,-30.5 174.25,-30.5 174.25,-11.25 227.75,-11.25 227.75,-30.5"/>
-<text text-anchor="middle" x="201" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.49,-20.88C146.75,-20.88 154.93,-20.88 162.51,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.32,-24.38 172.32,-20.88 162.32,-17.38 162.32,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aee973db9f0435e0cb4cc70f8eb3447a1_cgraph_org.svg b/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aee973db9f0435e0cb4cc70f8eb3447a1_cgraph_org.svg
deleted file mode 100644
index a608e7356..000000000
--- a/da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution_aee973db9f0435e0cb4cc70f8eb3447a1_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::geometric_distribution::probability_density Pages: 1 -->
-<svg width="236pt" height="50pt"
- viewBox="0.00 0.00 235.75 49.75" 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.75)">
-<title>probability::geometric_dist::geometric_distribution::probability_density</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The probability density function.">
-<polygon fill="#999999" stroke="#666666" points="138.25,-41.75 0,-41.75 0,0 138.25,0 138.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="69.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::probability_density</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.75,-30.5 174.25,-30.5 174.25,-11.25 227.75,-11.25 227.75,-30.5"/>
-<text text-anchor="middle" x="201" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.49,-20.88C146.75,-20.88 154.93,-20.88 162.51,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.32,-24.38 172.32,-20.88 162.32,-17.38 162.32,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d21/class_longest___substring.html b/da/d21/class_longest___substring.html
index 3da1e2f6b..6f0079185 100644
--- a/da/d21/class_longest___substring.html
+++ b/da/d21/class_longest___substring.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Longest_Substring Class Reference</title>
+<title>TheAlgorithms/C++: Longest_Substring Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -116,12 +133,14 @@ $(function(){initNavTree('da/d21/class_longest___substring.html','../../'); init
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:af8a3672bc8d95e7da4f9a45e5e2e387d" id="r_af8a3672bc8d95e7da4f9a45e5e2e387d"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af8a3672bc8d95e7da4f9a45e5e2e387d">lengthOfLongestSubstring</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s)</td></tr>
+<tr class="memitem:af8a3672bc8d95e7da4f9a45e5e2e387d" id="r_af8a3672bc8d95e7da4f9a45e5e2e387d"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af8a3672bc8d95e7da4f9a45e5e2e387d">lengthOfLongestSubstring</a> (std::string s)</td></tr>
 <tr class="memdesc:af8a3672bc8d95e7da4f9a45e5e2e387d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to find the length of the longest substring without repeating characters.  <br /></td></tr>
 <tr class="separator:af8a3672bc8d95e7da4f9a45e5e2e387d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Class that solves the Longest Substring Without Repeating Characters problem. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/db8/longest__substring__without__repeating__characters_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../d4/db8/longest__substring__without__repeating__characters_8cpp_source.html">longest_substring_without_repeating_characters.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="af8a3672bc8d95e7da4f9a45e5e2e387d" name="af8a3672bc8d95e7da4f9a45e5e2e387d"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#af8a3672bc8d95e7da4f9a45e5e2e387d">&#9670;&#160;</a></span>lengthOfLongestSubstring()</h2>
@@ -135,7 +154,7 @@ Public Member Functions</h2></td></tr>
         <tr>
           <td class="memname">int Longest_Substring::lengthOfLongestSubstring </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>s</em></span></td><td>)</td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>s</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -154,17 +173,19 @@ Public Member Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Length of the longest substring. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/db8/longest__substring__without__repeating__characters_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../d4/db8/longest__substring__without__repeating__characters_8cpp_source.html">longest_substring_without_repeating_characters.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   44</span>                                              {</div>
 <div class="line"><span class="lineno">   45</span>        <span class="comment">// If the size of string is 1, then it will be the answer.</span></div>
-<div class="line"><span class="lineno">   46</span>        <span class="keywordflow">if</span> (s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() == 1) <span class="keywordflow">return</span> 1;</div>
+<div class="line"><span class="lineno">   46</span>        <span class="keywordflow">if</span> (s.size() == 1) <span class="keywordflow">return</span> 1;</div>
 <div class="line"><span class="lineno">   47</span> </div>
 <div class="line"><span class="lineno">   48</span>        <span class="comment">// Map used to store the character frequency.</span></div>
-<div class="line"><span class="lineno">   49</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map&lt;char, int&gt;</a> m;</div>
-<div class="line"><span class="lineno">   50</span>        <span class="keywordtype">int</span> n = s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>();</div>
+<div class="line"><span class="lineno">   49</span>        std::unordered_map&lt;char, int&gt; m;</div>
+<div class="line"><span class="lineno">   50</span>        <span class="keywordtype">int</span> n = s.length();</div>
 <div class="line"><span class="lineno">   51</span> </div>
 <div class="line"><span class="lineno">   52</span>        <span class="comment">// Deque to remove from back if repeating characters are present.</span></div>
-<div class="line"><span class="lineno">   53</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque.html">std::deque&lt;char&gt;</a> temp;</div>
-<div class="line"><span class="lineno">   54</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque.html">std::deque&lt;char&gt;</a> res;</div>
+<div class="line"><span class="lineno">   53</span>        std::deque&lt;char&gt; temp;</div>
+<div class="line"><span class="lineno">   54</span>        std::deque&lt;char&gt; res;</div>
 <div class="line"><span class="lineno">   55</span>        <span class="keywordtype">int</span> i, j;</div>
 <div class="line"><span class="lineno">   56</span> </div>
 <div class="line"><span class="lineno">   57</span>        <span class="comment">// Sliding window approach using two pointers.</span></div>
@@ -173,44 +194,34 @@ Public Member Functions</h2></td></tr>
 <div class="line"><span class="lineno">   60</span> </div>
 <div class="line"><span class="lineno">   61</span>            <span class="comment">// If repeating character found, update result and remove from the front.</span></div>
 <div class="line"><span class="lineno">   62</span>            <span class="keywordflow">if</span> (m[s[j]] &gt; 1) {</div>
-<div class="line"><span class="lineno">   63</span>                <span class="keywordflow">if</span> (temp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque/size.html">size</a>() &gt; res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque/size.html">size</a>()) {</div>
+<div class="line"><span class="lineno">   63</span>                <span class="keywordflow">if</span> (temp.size() &gt; res.size()) {</div>
 <div class="line"><span class="lineno">   64</span>                    res = temp;</div>
 <div class="line"><span class="lineno">   65</span>                }</div>
 <div class="line"><span class="lineno">   66</span> </div>
 <div class="line"><span class="lineno">   67</span>                <span class="keywordflow">while</span> (m[s[j]] &gt; 1) {</div>
-<div class="line"><span class="lineno">   68</span>                    temp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque/pop_front.html">pop_front</a>();</div>
+<div class="line"><span class="lineno">   68</span>                    temp.pop_front();</div>
 <div class="line"><span class="lineno">   69</span>                    m[s[i]]--;</div>
 <div class="line"><span class="lineno">   70</span>                    i++;</div>
 <div class="line"><span class="lineno">   71</span>                }</div>
 <div class="line"><span class="lineno">   72</span>            }</div>
 <div class="line"><span class="lineno">   73</span> </div>
 <div class="line"><span class="lineno">   74</span>            <span class="comment">// Add the current character to the deque.</span></div>
-<div class="line"><span class="lineno">   75</span>            temp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque/push_back.html">push_back</a>(s[j]);</div>
+<div class="line"><span class="lineno">   75</span>            temp.push_back(s[j]);</div>
 <div class="line"><span class="lineno">   76</span>            j++;</div>
 <div class="line"><span class="lineno">   77</span>        }</div>
 <div class="line"><span class="lineno">   78</span> </div>
 <div class="line"><span class="lineno">   79</span>        <span class="comment">// Final check to update result.</span></div>
-<div class="line"><span class="lineno">   80</span>        <span class="keywordflow">if</span> (temp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque/size.html">size</a>() &gt; res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque/size.html">size</a>()) {</div>
+<div class="line"><span class="lineno">   80</span>        <span class="keywordflow">if</span> (temp.size() &gt; res.size()) {</div>
 <div class="line"><span class="lineno">   81</span>            res = temp;</div>
 <div class="line"><span class="lineno">   82</span>        }</div>
 <div class="line"><span class="lineno">   83</span> </div>
-<div class="line"><span class="lineno">   84</span>        <span class="keywordflow">return</span> res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/deque/size.html">size</a>();  <span class="comment">// Return the length of the longest substring.</span></div>
+<div class="line"><span class="lineno">   84</span>        <span class="keywordflow">return</span> res.size();  <span class="comment">// Return the length of the longest substring.</span></div>
 <div class="line"><span class="lineno">   85</span>    }</div>
-<div class="ttc" id="adeque_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/deque.html">std::deque</a></div></div>
-<div class="ttc" id="apop_front_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/deque/pop_front.html">std::deque::pop_front</a></div><div class="ttdeci">T pop_front(T... args)</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/deque/push_back.html">std::deque::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-<div class="ttc" id="aunordered_map_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.svg" width="384" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>others/<a class="el" href="../../d4/db8/longest__substring__without__repeating__characters_8cpp.html">longest_substring_without_repeating_characters.cpp</a></li>
+<li>others/<a class="el" href="../../d4/db8/longest__substring__without__repeating__characters_8cpp_source.html">longest_substring_without_repeating_characters.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.map b/da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.map
deleted file mode 100644
index 7673d2053..000000000
--- a/da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="Longest_Substring::lengthOfLongestSubstring" name="Longest_Substring::lengthOfLongestSubstring">
-<area shape="rect" id="Node000001" title="Function to find the length of the longest substring without repeating characters." alt="" coords="5,47,177,88"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="240,5,362,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="176,54,256,33,257,39,177,59"/>
-<area shape="poly" id="edge5_Node000001_Node000002" title=" " alt="" coords="146,44,224,25,225,30,148,49"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/deque/pop_front.html#" title=" " alt="" coords="229,55,374,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="177,65,214,65,214,70,177,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/deque/push_back.html#" title=" " alt="" coords="225,104,378,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="177,85,229,97,228,102,176,90"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/deque/size.html#" title=" " alt="" coords="244,153,358,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="126,86,173,113,226,140,240,145,238,150,224,145,170,118,124,91"/>
-</map>
diff --git a/da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.md5 b/da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.md5
deleted file mode 100644
index f844eac89..000000000
--- a/da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5ded94fdecb46e5c02f228d958402fa6
\ No newline at end of file
diff --git a/da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.svg b/da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.svg
deleted file mode 100644
index 6356599ca..000000000
--- a/da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph.svg
+++ /dev/null
@@ -1,129 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Longest_Substring::lengthOfLongestSubstring Pages: 1 -->
-<svg width="288pt" height="138pt"
- viewBox="0.00 0.00 287.50 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>Longest_Substring::lengthOfLongestSubstring</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to find the length of the longest substring without repeating characters.">
-<polygon fill="#999999" stroke="#666666" points="128.5,-98.88 0,-98.88 0,-68.38 128.5,-68.38 128.5,-98.88"/>
-<text text-anchor="start" x="8" y="-85.38" font-family="Helvetica,sans-Serif" font-size="10.00">Longest_Substring::</text>
-<text text-anchor="middle" x="64.25" y="-74.12" font-family="Helvetica,sans-Serif" font-size="10.00">lengthOfLongestSubstring</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.88,-130.25 176.12,-130.25 176.12,-111 267.88,-111 267.88,-130.25"/>
-<text text-anchor="middle" x="222" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.6,-92.03C149.19,-96.62 171.18,-102.19 188.54,-107.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.19,-110.56 197.77,-110.15 189.25,-103.87 187.19,-110.56"/>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge5_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge5_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.17,-99.37C124.03,-104.37 145.26,-109.58 164.58,-113.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.71,-117.13 174.21,-115.75 165.14,-110.28 163.71,-117.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/pop_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="276.12,-93.25 167.88,-93.25 167.88,-74 276.12,-74 276.12,-93.25"/>
-<text text-anchor="middle" x="222" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::pop_front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.6,-83.62C137.72,-83.62 147.11,-83.62 156.26,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.16,-87.13 166.16,-83.63 156.16,-80.13 156.16,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279.5,-56.25 164.5,-56.25 164.5,-37 279.5,-37 279.5,-56.25"/>
-<text text-anchor="middle" x="222" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.6,-68.58C141.5,-65.51 154.94,-62.32 167.46,-59.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.25,-62.75 177.17,-57.04 166.64,-55.94 168.25,-62.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.88,-19.25 179.12,-19.25 179.12,0 264.88,0 264.88,-19.25"/>
-<text text-anchor="middle" x="222" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.81,-67.89C109.46,-55.76 138.02,-39.17 164.5,-27.62 167.85,-26.16 171.36,-24.76 174.91,-23.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.93,-26.79 184.2,-20.17 173.6,-20.18 175.93,-26.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph_org.svg b/da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph_org.svg
deleted file mode 100644
index 26167f772..000000000
--- a/da/d21/class_longest___substring_af8a3672bc8d95e7da4f9a45e5e2e387d_cgraph_org.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Longest_Substring::lengthOfLongestSubstring Pages: 1 -->
-<svg width="288pt" height="138pt"
- viewBox="0.00 0.00 287.50 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>Longest_Substring::lengthOfLongestSubstring</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to find the length of the longest substring without repeating characters.">
-<polygon fill="#999999" stroke="#666666" points="128.5,-98.88 0,-98.88 0,-68.38 128.5,-68.38 128.5,-98.88"/>
-<text text-anchor="start" x="8" y="-85.38" font-family="Helvetica,sans-Serif" font-size="10.00">Longest_Substring::</text>
-<text text-anchor="middle" x="64.25" y="-74.12" font-family="Helvetica,sans-Serif" font-size="10.00">lengthOfLongestSubstring</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.88,-130.25 176.12,-130.25 176.12,-111 267.88,-111 267.88,-130.25"/>
-<text text-anchor="middle" x="222" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.6,-92.03C149.19,-96.62 171.18,-102.19 188.54,-107.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.19,-110.56 197.77,-110.15 189.25,-103.87 187.19,-110.56"/>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge5_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge5_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.17,-99.37C124.03,-104.37 145.26,-109.58 164.58,-113.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.71,-117.13 174.21,-115.75 165.14,-110.28 163.71,-117.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/pop_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="276.12,-93.25 167.88,-93.25 167.88,-74 276.12,-74 276.12,-93.25"/>
-<text text-anchor="middle" x="222" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::pop_front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.6,-83.62C137.72,-83.62 147.11,-83.62 156.26,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.16,-87.13 166.16,-83.63 156.16,-80.13 156.16,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="279.5,-56.25 164.5,-56.25 164.5,-37 279.5,-37 279.5,-56.25"/>
-<text text-anchor="middle" x="222" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.6,-68.58C141.5,-65.51 154.94,-62.32 167.46,-59.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.25,-62.75 177.17,-57.04 166.64,-55.94 168.25,-62.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/deque/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.88,-19.25 179.12,-19.25 179.12,0 264.88,0 264.88,-19.25"/>
-<text text-anchor="middle" x="222" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::deque::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.81,-67.89C109.46,-55.76 138.02,-39.17 164.5,-27.62 167.85,-26.16 171.36,-24.76 174.91,-23.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.93,-26.79 184.2,-20.17 173.6,-20.18 175.93,-26.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d23/eulers__totient__function_8cpp.html b/da/d23/eulers__totient__function_8cpp.html
index 7ec181b22..71d69abe3 100644
--- a/da/d23/eulers__totient__function_8cpp.html
+++ b/da/d23/eulers__totient__function_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/eulers_totient_function.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/eulers_totient_function.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for eulers_totient_function.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d5b/eulers__totient__function_8cpp__incl.svg" width="255" height="126"><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">
+</div>
+<p><a href="../../da/d23/eulers__totient__function_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -164,6 +183,8 @@ Some known values are:</p><ul>
 <li>\(\phi(1420) = 560\) <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/mann2108" target="_blank">Mann Mehta</a> </dd></dl>
 </li>
 </ul>
+
+<p class="definition">Definition in file <a class="el" href="../../da/d23/eulers__totient__function_8cpp_source.html">eulers_totient_function.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">&#9670;&#160;</a></span>main()</h2>
@@ -193,17 +214,14 @@ Some known values are:</p><ul>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d23/eulers__totient__function_8cpp_source.html#l00079">79</a> of file <a class="el" href="../../da/d23/eulers__totient__function_8cpp_source.html">eulers_totient_function.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   79</span>                                 {</div>
 <div class="line"><span class="lineno">   80</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
 <div class="line"><span class="lineno">   81</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   82</span>}</div>
-<div class="ttc" id="aeulers__totient__function_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> eulers_totient_function.cpp:61</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d23/eulers__totient__function_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="326" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aeulers__totient__function_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d23/eulers__totient__function_8cpp_source.html#l00061">eulers_totient_function.cpp:61</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -231,6 +249,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d23/eulers__totient__function_8cpp_source.html#l00061">61</a> of file <a class="el" href="../../da/d23/eulers__totient__function_8cpp_source.html">eulers_totient_function.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   61</span>                   {</div>
 <div class="line"><span class="lineno">   62</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5">math::phiFunction</a>(1) == 1);</div>
 <div class="line"><span class="lineno">   63</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5">math::phiFunction</a>(2) == 1);</div>
@@ -240,16 +260,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   67</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5">math::phiFunction</a>(3141592) == 1570792);</div>
 <div class="line"><span class="lineno">   68</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5">math::phiFunction</a>(27182818) == 12545904);</div>
 <div class="line"><span class="lineno">   69</span> </div>
-<div class="line"><span class="lineno">   70</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   70</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   71</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="anamespacemath_html_ac37d3ba52eb296597d7a024ba8c4a5a5"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5">math::phiFunction</a></div><div class="ttdeci">uint64_t phiFunction(uint64_t n)</div><div class="ttdoc">Function to calculate Euler's Totient.</div><div class="ttdef"><b>Definition</b> eulers_totient_function.cpp:41</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d23/eulers__totient__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="228" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemath_html_ac37d3ba52eb296597d7a024ba8c4a5a5"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5">math::phiFunction</a></div><div class="ttdeci">uint64_t phiFunction(uint64_t n)</div><div class="ttdoc">Function to calculate Euler's Totient.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d23/eulers__totient__function_8cpp_source.html#l00041">eulers_totient_function.cpp:41</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/da/d23/eulers__totient__function_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/da/d23/eulers__totient__function_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
deleted file mode 100644
index 9e330990e..000000000
--- a/da/d23/eulers__totient__function_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5" title="Function to calculate Euler&#39;s Totient." alt="" coords="194,5,319,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,179,16,179,21,146,21"/>
-</map>
diff --git a/da/d23/eulers__totient__function_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/da/d23/eulers__totient__function_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
deleted file mode 100644
index feaead9ef..000000000
--- a/da/d23/eulers__totient__function_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c3b94c08587cbbf03e58caf02caed5da
\ No newline at end of file
diff --git a/da/d23/eulers__totient__function_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/da/d23/eulers__totient__function_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
deleted file mode 100644
index a6b700a21..000000000
--- a/da/d23/eulers__totient__function_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="244pt" height="27pt"
- viewBox="0.00 0.00 243.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5" target="_top" xlink:title="Function to calculate Euler&#39;s Totient.">
-<polygon fill="white" stroke="#666666" points="235.5,-19.25 141.5,-19.25 141.5,0 235.5,0 235.5,-19.25"/>
-<text text-anchor="middle" x="188.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::phiFunction</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.87,-9.62C112.67,-9.62 121.09,-9.62 129.93,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.72,-13.13 139.72,-9.63 129.72,-6.13 129.72,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d23/eulers__totient__function_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/da/d23/eulers__totient__function_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
deleted file mode 100644
index 670c169b3..000000000
--- a/da/d23/eulers__totient__function_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="244pt" height="27pt"
- viewBox="0.00 0.00 243.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5" target="_top" xlink:title="Function to calculate Euler&#39;s Totient.">
-<polygon fill="white" stroke="#666666" points="235.5,-19.25 141.5,-19.25 141.5,0 235.5,0 235.5,-19.25"/>
-<text text-anchor="middle" x="188.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::phiFunction</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.87,-9.62C112.67,-9.62 121.09,-9.62 129.93,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.72,-13.13 139.72,-9.63 129.72,-6.13 129.72,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d23/eulers__totient__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/da/d23/eulers__totient__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 354d09e7a..000000000
--- a/da/d23/eulers__totient__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="$dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5" title="Function to calculate Euler&#39;s Totient." alt="" coords="97,5,222,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/da/d23/eulers__totient__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/da/d23/eulers__totient__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 854b7f8a5..000000000
--- a/da/d23/eulers__totient__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a85efb899b9c875ea79147a97c66607a
\ No newline at end of file
diff --git a/da/d23/eulers__totient__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/da/d23/eulers__totient__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index f4497983e..000000000
--- a/da/d23/eulers__totient__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="171pt" height="27pt"
- viewBox="0.00 0.00 170.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5" target="_top" xlink:title="Function to calculate Euler&#39;s Totient.">
-<polygon fill="white" stroke="#666666" points="162.5,-19.25 68.5,-19.25 68.5,0 162.5,0 162.5,-19.25"/>
-<text text-anchor="middle" x="115.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::phiFunction</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.87,-9.62C39.67,-9.62 48.09,-9.62 56.93,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.72,-13.13 66.72,-9.63 56.72,-6.13 56.72,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d23/eulers__totient__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/da/d23/eulers__totient__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 303f51433..000000000
--- a/da/d23/eulers__totient__function_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="171pt" height="27pt"
- viewBox="0.00 0.00 170.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5" target="_top" xlink:title="Function to calculate Euler&#39;s Totient.">
-<polygon fill="white" stroke="#666666" points="162.5,-19.25 68.5,-19.25 68.5,0 162.5,0 162.5,-19.25"/>
-<text text-anchor="middle" x="115.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::phiFunction</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.87,-9.62C39.67,-9.62 48.09,-9.62 56.93,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.72,-13.13 66.72,-9.63 56.72,-6.13 56.72,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d23/eulers__totient__function_8cpp_source.html b/da/d23/eulers__totient__function_8cpp_source.html
new file mode 100644
index 000000000..0e8b65229
--- /dev/null
+++ b/da/d23/eulers__totient__function_8cpp_source.html
@@ -0,0 +1,185 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/eulers_totient_function.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/d23/eulers__totient__function_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">eulers_totient_function.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/d23/eulers__totient__function_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="foldopen" id="foldopen00041" data-start="{" data-end="}">
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5">   41</a></span>uint64_t <a class="code hl_function" href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5">phiFunction</a>(uint64_t n) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    uint64_t result = n;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">for</span> (uint64_t i = 2; i * i &lt;= n; i++) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="keywordflow">if</span> (n % i != 0)</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>            <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">while</span> (n % i == 0) n /= i;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        result -= result / i;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordflow">if</span> (n &gt; 1)</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        result -= result / n;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>}</div>
+</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="foldopen" id="foldopen00061" data-start="{" data-end="}">
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"><a class="line" href="../../da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   61</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5">math::phiFunction</a>(1) == 1);</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5">math::phiFunction</a>(2) == 1);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5">math::phiFunction</a>(10) == 4);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5">math::phiFunction</a>(123456) == 41088);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5">math::phiFunction</a>(808017424794) == 263582333856);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5">math::phiFunction</a>(3141592) == 1570792);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5">math::phiFunction</a>(27182818) == 12545904);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>}</div>
+</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="foldopen" id="foldopen00079" data-start="{" data-end="}">
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="../../da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">   79</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[]) {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <a class="code hl_function" href="../../da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>}</div>
+</div>
+<div class="ttc" id="aeulers__totient__function_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../da/d23/eulers__totient__function_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> <a href="#l00061">eulers_totient_function.cpp:61</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_ac37d3ba52eb296597d7a024ba8c4a5a5"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5">math::phiFunction</a></div><div class="ttdeci">uint64_t phiFunction(uint64_t n)</div><div class="ttdoc">Function to calculate Euler's Totient.</div><div class="ttdef"><b>Definition</b> <a href="#l00041">eulers_totient_function.cpp:41</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../da/d23/eulers__totient__function_8cpp.html">eulers_totient_function.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/d24/sqrt__double_8cpp.html b/da/d24/sqrt__double_8cpp.html
index ff8afe600..2b34ae27a 100644
--- a/da/d24/sqrt__double_8cpp.html
+++ b/da/d24/sqrt__double_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/sqrt_double.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/sqrt_double.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for sqrt_double.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/dfc/sqrt__double_8cpp__incl.svg" width="171" height="111"><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">
+</div>
+<p><a href="../../da/d24/sqrt__double_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ae662282ad0740d2063ac404ca3bd74fc" id="r_ae662282ad0740d2063ac404ca3bd74fc"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae662282ad0740d2063ac404ca3bd74fc">Sqrt</a> (double a)</td></tr>
@@ -132,6 +151,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Calculate the square root of any positive real number in  \(O(\log
 N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bisection_method" target="_blank">bisection method</a> of root-finding. </p>
 <dl class="section see"><dt>See also</dt><dd>Can be implemented using faster and better algorithms like <a class="el" href="../../de/dd3/newton__raphson__method_8cpp.html" title="Solve the equation  using Newton-Raphson method for both real and complex solutions.">newton_raphson_method.cpp</a> and <a class="el" href="../../dd/d29/false__position_8cpp.html" title="Solve the equation  using false position method, also known as the Secant method.">false_position.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../da/d24/sqrt__double_8cpp_source.html">sqrt_double.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -148,24 +169,18 @@ N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bis
       </table>
 </div><div class="memdoc">
 <p>main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d24/sqrt__double_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../da/d24/sqrt__double_8cpp_source.html">sqrt_double.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   42</span>           {</div>
 <div class="line"><span class="lineno">   43</span>    <span class="keywordtype">double</span> n{};</div>
-<div class="line"><span class="lineno">   44</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;</div>
+<div class="line"><span class="lineno">   44</span>    std::cin &gt;&gt; n;</div>
 <div class="line"><span class="lineno">   45</span>    assert(n &gt;= 0);</div>
 <div class="line"><span class="lineno">   46</span>    <span class="comment">// Change this line for a better precision</span></div>
-<div class="line"><span class="lineno">   47</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>.precision(12);</div>
-<div class="line"><span class="lineno">   48</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/fixed.html">std::fixed</a> &lt;&lt; <a class="code hl_function" href="#ae662282ad0740d2063ac404ca3bd74fc">Sqrt</a>(n);</div>
+<div class="line"><span class="lineno">   47</span>    std::cout.precision(12);</div>
+<div class="line"><span class="lineno">   48</span>    std::cout &lt;&lt; std::fixed &lt;&lt; <a class="code hl_function" href="#ae662282ad0740d2063ac404ca3bd74fc">Sqrt</a>(n);</div>
 <div class="line"><span class="lineno">   49</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="afixed_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/fixed.html">std::fixed</a></div><div class="ttdeci">T fixed(T... args)</div></div>
-<div class="ttc" id="asqrt__double_8cpp_html_ae662282ad0740d2063ac404ca3bd74fc"><div class="ttname"><a href="#ae662282ad0740d2063ac404ca3bd74fc">Sqrt</a></div><div class="ttdeci">double Sqrt(double a)</div><div class="ttdef"><b>Definition</b> sqrt_double.cpp:16</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="184" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asqrt__double_8cpp_html_ae662282ad0740d2063ac404ca3bd74fc"><div class="ttname"><a href="#ae662282ad0740d2063ac404ca3bd74fc">Sqrt</a></div><div class="ttdeci">double Sqrt(double a)</div><div class="ttdef"><b>Definition</b> <a href="../../da/d24/sqrt__double_8cpp_source.html#l00016">sqrt_double.cpp:16</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae662282ad0740d2063ac404ca3bd74fc" name="ae662282ad0740d2063ac404ca3bd74fc"></a>
@@ -183,6 +198,8 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Bisection method implemented for the function \(x^2-a=0\) whose roots are \(\pm\sqrt{a}\) and only the positive root is returned. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d24/sqrt__double_8cpp_source.html#l00016">16</a> of file <a class="el" href="../../da/d24/sqrt__double_8cpp_source.html">sqrt_double.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   16</span>                      {</div>
 <div class="line"><span class="lineno">   17</span>    <span class="keywordflow">if</span> (a &gt; 0 &amp;&amp; a &lt; 1) {</div>
 <div class="line"><span class="lineno">   18</span>        <span class="keywordflow">return</span> 1 / <a class="code hl_function" href="#ae662282ad0740d2063ac404ca3bd74fc">Sqrt</a>(1 / a);</div>
@@ -207,13 +224,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   37</span>    }</div>
 <div class="line"><span class="lineno">   38</span>    <span class="keywordflow">return</span> -1;</div>
 <div class="line"><span class="lineno">   39</span>}</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:119</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d24/sqrt__double_8cpp_ae662282ad0740d2063ac404ca3bd74fc_cgraph.svg" width="56" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00119">composite_simpson_rule.cpp:119</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/da/d24/sqrt__double_8cpp_ae662282ad0740d2063ac404ca3bd74fc_cgraph.map b/da/d24/sqrt__double_8cpp_ae662282ad0740d2063ac404ca3bd74fc_cgraph.map
deleted file mode 100644
index a3921abc4..000000000
--- a/da/d24/sqrt__double_8cpp_ae662282ad0740d2063ac404ca3bd74fc_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="Sqrt" name="Sqrt">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,51,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="18,29,18,12,21,5,28,3,35,6,38,13,34,15,31,10,28,8,25,9,23,13,24,29"/>
-</map>
diff --git a/da/d24/sqrt__double_8cpp_ae662282ad0740d2063ac404ca3bd74fc_cgraph.md5 b/da/d24/sqrt__double_8cpp_ae662282ad0740d2063ac404ca3bd74fc_cgraph.md5
deleted file mode 100644
index 846442f2e..000000000
--- a/da/d24/sqrt__double_8cpp_ae662282ad0740d2063ac404ca3bd74fc_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e24fc689d3e03dedf2ba0b8016c64b1e
\ No newline at end of file
diff --git a/da/d24/sqrt__double_8cpp_ae662282ad0740d2063ac404ca3bd74fc_cgraph.svg b/da/d24/sqrt__double_8cpp_ae662282ad0740d2063ac404ca3bd74fc_cgraph.svg
deleted file mode 100644
index 14262c124..000000000
--- a/da/d24/sqrt__double_8cpp_ae662282ad0740d2063ac404ca3bd74fc_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Sqrt Pages: 1 -->
-<svg width="42pt" height="45pt"
- viewBox="0.00 0.00 42.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>Sqrt</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="34,-19.25 0,-19.25 0,0 34,0 34,-19.25"/>
-<text text-anchor="middle" x="17" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M11.68,-19.54C9.25,-28.15 11.02,-37.25 17,-37.25 20.18,-37.25 22.16,-34.68 22.97,-30.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="26.46,-30.84 22.41,-21.05 19.48,-31.23 26.46,-30.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d24/sqrt__double_8cpp_ae662282ad0740d2063ac404ca3bd74fc_cgraph_org.svg b/da/d24/sqrt__double_8cpp_ae662282ad0740d2063ac404ca3bd74fc_cgraph_org.svg
deleted file mode 100644
index 2e0f95257..000000000
--- a/da/d24/sqrt__double_8cpp_ae662282ad0740d2063ac404ca3bd74fc_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Sqrt Pages: 1 -->
-<svg width="42pt" height="45pt"
- viewBox="0.00 0.00 42.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>Sqrt</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="34,-19.25 0,-19.25 0,0 34,0 34,-19.25"/>
-<text text-anchor="middle" x="17" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M11.68,-19.54C9.25,-28.15 11.02,-37.25 17,-37.25 20.18,-37.25 22.16,-34.68 22.97,-30.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="26.46,-30.84 22.41,-21.05 19.48,-31.23 26.46,-30.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 8efa667af..000000000
--- a/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,43,55,68"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/fixed.html#" title=" " alt="" coords="103,5,178,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,45,87,33,89,38,56,50"/>
-<area shape="rect" id="Node000003" href="$da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc" title=" " alt="" coords="118,79,163,104"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,61,104,77,102,82,54,66"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="121,79,117,70,119,61,127,54,140,52,154,55,162,62,158,65,152,60,140,57,129,59,124,64,122,70,126,77"/>
-</map>
diff --git a/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 9ce4773a0..000000000
--- a/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-da54cbb2722c22289ed68982a49d9ce0
\ No newline at end of file
diff --git a/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 104d301fa..000000000
--- a/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="138pt" height="82pt"
- viewBox="0.00 0.00 137.50 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-46.25 0,-46.25 0,-27 37,-27 37,-46.25"/>
-<text text-anchor="middle" x="18.5" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/fixed.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.5,-74.25 73,-74.25 73,-55 129.5,-55 129.5,-74.25"/>
-<text text-anchor="middle" x="101.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::fixed</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.42,-42.84C44.67,-45.35 53.34,-48.36 61.89,-51.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.52,-54.55 71.11,-54.52 62.81,-47.94 60.52,-54.55"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="118.25,-19.25 84.25,-19.25 84.25,0 118.25,0 118.25,-19.25"/>
-<text text-anchor="middle" x="101.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.42,-30.63C47.91,-27.12 61.37,-22.62 73.14,-18.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.94,-22.11 82.32,-15.62 71.72,-15.47 73.94,-22.11"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.3,-19.54C82.39,-28.15 86.7,-37.25 101.25,-37.25 109.2,-37.25 114.1,-34.53 115.94,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="119.44,-30.37 114.44,-21.03 112.52,-31.45 119.44,-30.37"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 4bef32b10..000000000
--- a/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="138pt" height="82pt"
- viewBox="0.00 0.00 137.50 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-46.25 0,-46.25 0,-27 37,-27 37,-46.25"/>
-<text text-anchor="middle" x="18.5" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/fixed.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.5,-74.25 73,-74.25 73,-55 129.5,-55 129.5,-74.25"/>
-<text text-anchor="middle" x="101.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::fixed</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.42,-42.84C44.67,-45.35 53.34,-48.36 61.89,-51.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.52,-54.55 71.11,-54.52 62.81,-47.94 60.52,-54.55"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="118.25,-19.25 84.25,-19.25 84.25,0 118.25,0 118.25,-19.25"/>
-<text text-anchor="middle" x="101.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.42,-30.63C47.91,-27.12 61.37,-22.62 73.14,-18.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.94,-22.11 82.32,-15.62 71.72,-15.47 73.94,-22.11"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.3,-19.54C82.39,-28.15 86.7,-37.25 101.25,-37.25 109.2,-37.25 114.1,-34.53 115.94,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="119.44,-30.37 114.44,-21.03 112.52,-31.45 119.44,-30.37"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d24/sqrt__double_8cpp_source.html b/da/d24/sqrt__double_8cpp_source.html
new file mode 100644
index 000000000..84921b756
--- /dev/null
+++ b/da/d24/sqrt__double_8cpp_source.html
@@ -0,0 +1,180 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/sqrt_double.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/d24/sqrt__double_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">sqrt_double.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/d24/sqrt__double_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="foldopen" id="foldopen00016" data-start="{" data-end="}">
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"><a class="line" href="../../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc">   16</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc">Sqrt</a>(<span class="keywordtype">double</span> a) {</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="keywordflow">if</span> (a &gt; 0 &amp;&amp; a &lt; 1) {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        <span class="keywordflow">return</span> 1 / <a class="code hl_function" href="../../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc">Sqrt</a>(1 / a);</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    }</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="keywordtype">double</span> l = 0, r = a;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="comment">/* Epsilon is the precision.</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment">    A great precision is</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment">    between 1e-7 and 1e-12.</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment">    double epsilon = 1e-12;</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment">    */</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="keywordtype">double</span> epsilon = 1e-12;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordflow">while</span> (l &lt;= r) {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        <span class="keywordtype">double</span> mid = (l + r) / 2;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>        <span class="keywordflow">if</span> (mid * mid &gt; a) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>            r = mid;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>            <span class="keywordflow">if</span> (a - mid * mid &lt; epsilon) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>                <span class="keywordflow">return</span> mid;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>            }</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>            l = mid;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        }</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    }</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>}</div>
+</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="foldopen" id="foldopen00042" data-start="{" data-end="}">
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   42</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordtype">double</span> n{};</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    assert(n &gt;= 0);</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="comment">// Change this line for a better precision</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    std::cout.precision(12);</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    std::cout &lt;&lt; std::fixed &lt;&lt; <a class="code hl_function" href="../../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc">Sqrt</a>(n);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>}</div>
+</div>
+<div class="ttc" id="asqrt__double_8cpp_html_ae662282ad0740d2063ac404ca3bd74fc"><div class="ttname"><a href="../../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc">Sqrt</a></div><div class="ttdeci">double Sqrt(double a)</div><div class="ttdef"><b>Definition</b> <a href="#l00016">sqrt_double.cpp:16</a></div></div>
+<div class="ttc" id="asqrt__double_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00042">sqrt_double.cpp:42</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../da/d24/sqrt__double_8cpp.html">sqrt_double.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/d27/prim_8cpp_source.html b/da/d27/prim_8cpp_source.html
new file mode 100644
index 000000000..c5be67f0a
--- /dev/null
+++ b/da/d27/prim_8cpp_source.html
@@ -0,0 +1,196 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/prim.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/d27/prim_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">prim.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">// C++ program to implement Prim&#39;s Algorithm</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &lt;queue&gt;</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="keyword">using </span>PII = std::pair&lt;int, int&gt;;</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="keywordtype">int</span> prim(<span class="keywordtype">int</span> x, <span class="keyword">const</span> std::vector&lt;std::vector&lt;PII&gt; &gt; &amp;<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>) {</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    <span class="comment">// priority queue to maintain edges with respect to weights</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    std::priority_queue&lt;PII, std::vector&lt;PII&gt;, std::greater&lt;PII&gt; &gt; Q;</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    std::vector&lt;bool&gt; marked(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.size(), <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="keywordtype">int</span> minimum_cost = 0;</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    Q.push(std::make_pair(0, x));</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="keywordflow">while</span> (!Q.empty()) {</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>        <span class="comment">// Select the edge with minimum weight</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>        PII p = Q.top();</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        Q.pop();</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        x = p.second;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        <span class="comment">// Checking for cycle</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        <span class="keywordflow">if</span> (marked[x] == <span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>            <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        }</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        minimum_cost += p.first;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        marked[x] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        <span class="keywordflow">for</span> (<span class="keyword">const</span> PII &amp;neighbor : <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[x]) {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>            <span class="keywordtype">int</span> y = neighbor.second;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>            <span class="keywordflow">if</span> (marked[y] == <span class="keyword">false</span>) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>                Q.push(neighbor);</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>            }</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        }</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    }</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordflow">return</span> minimum_cost;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>}</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordtype">int</span> nodes = 0, edges = 0;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    std::cin &gt;&gt; nodes &gt;&gt; edges;  <span class="comment">// number of nodes &amp; edges in graph</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordflow">if</span> (nodes == 0 || edges == 0) {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    }</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    std::vector&lt;std::vector&lt;PII&gt; &gt; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>(nodes);</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="comment">// Edges with their nodes &amp; weight</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; edges; ++i) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="keywordtype">int</span> x = 0, y = 0, weight = 0;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        std::cin &gt;&gt; x &gt;&gt; y &gt;&gt; weight;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[x].push_back(std::make_pair(weight, y));</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[y].push_back(std::make_pair(weight, x));</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="comment">// Selecting 1 as the starting node</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordtype">int</span> minimum_cost = prim(1, <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>);</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    std::cout &lt;&lt; minimum_cost &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></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><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><b>prim.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.map b/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.map
index 0df715ad5..e8a02954e 100644
--- a/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.map
+++ b/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.map
@@ -1,8 +1,8 @@
 <map id="data_structures::trie_using_hashmap::Trie" name="data_structures::trie_using_hashmap::Trie">
 <area shape="rect" id="Node000001" title="Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t..." alt="" coords="286,5,435,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="5,84,168,140"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,84,168,140"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="182,80,293,44,294,49,183,85"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map.html" title=" " alt="" coords="277,70,444,155"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="277,70,444,155"/>
 <area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="183,110,276,110,276,115,183,115"/>
 <area shape="rect" id="Node000003" href="$d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html" title="struct representing a trie node." alt="" coords="541,152,729,193"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="526,189,405,195,340,193,276,185,208,167,147,143,149,138,210,162,277,179,341,187,405,190,526,184"/>
diff --git a/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.md5 b/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.md5
index a1b041ada..00c18e602 100644
--- a/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.md5
+++ b/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.md5
@@ -1 +1 @@
-446e1ad803da03d2ddb723938022620b
\ No newline at end of file
+1335981d0644c15d1eb8fffc40fac314
\ No newline at end of file
diff --git a/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.svg b/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.svg
index 2023bbf50..d23928394 100644
--- a/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.svg
+++ b/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph.svg
@@ -68,7 +68,7 @@ var sectionId = 'dynsection-0';
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="121.75,-81.12 0,-81.12 0,-39.38 121.75,-39.38 121.75,-81.12"/>
 <text text-anchor="start" x="8" y="-67.62" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; data</text>
 <text text-anchor="start" x="8" y="-56.38" font-family="Helvetica,sans-Serif" font-size="10.00">_structures::trie_using</text>
@@ -89,7 +89,7 @@ var sectionId = 'dynsection-0';
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="329,-92.38 203.5,-92.38 203.5,-28.12 329,-28.12 329,-92.38"/>
 <text text-anchor="start" x="211.5" y="-78.88" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
 <text text-anchor="start" x="211.5" y="-67.62" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; char16_t, std::shared</text>
diff --git a/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph_org.svg b/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph_org.svg
index 38adf8ac0..65c929e12 100644
--- a/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph_org.svg
+++ b/da/d32/classdata__structures_1_1trie__using__hashmap_1_1_trie__coll__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="121.75,-81.12 0,-81.12 0,-39.38 121.75,-39.38 121.75,-81.12"/>
 <text text-anchor="start" x="8" y="-67.62" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; data</text>
 <text text-anchor="start" x="8" y="-56.38" font-family="Helvetica,sans-Serif" font-size="10.00">_structures::trie_using</text>
@@ -42,7 +42,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="329,-92.38 203.5,-92.38 203.5,-28.12 329,-28.12 329,-92.38"/>
 <text text-anchor="start" x="211.5" y="-78.88" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
 <text text-anchor="start" x="211.5" y="-67.62" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; char16_t, std::shared</text>
diff --git a/da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html b/da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html
index 875b0eaf8..e8488a47c 100644
--- a/da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html
+++ b/da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::sparse_table::Sparse_table Struct Reference</title>
+<title>TheAlgorithms/C++: data_structures::sparse_table::Sparse_table Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -114,7 +131,7 @@ $(function(){initNavTree('da/d37/structdata__structures_1_1sparse__table_1_1_spa
 <div class="dynheader">
 Collaboration diagram for data_structures::sparse_table::Sparse_table:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.svg" width="263" height="332"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/daa/structdata__structures_1_1sparse__table_1_1_sparse__table__coll__graph.svg" width="263" height="244"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
@@ -125,21 +142,23 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:ad71ecd43d0af1127df5f4006258f9635" id="r_ad71ecd43d0af1127df5f4006258f9635"><td class="memItemLeft" align="right" valign="top"><a id="ad71ecd43d0af1127df5f4006258f9635" name="ad71ecd43d0af1127df5f4006258f9635"></a>
-size_t&#160;</td><td class="memItemRight" valign="bottom"><b>n</b> = 0</td></tr>
-<tr class="memdesc:ad71ecd43d0af1127df5f4006258f9635"><td class="mdescLeft">&#160;</td><td class="mdescRight">size of input array. <br /></td></tr>
+<tr class="memitem:ad71ecd43d0af1127df5f4006258f9635" id="r_ad71ecd43d0af1127df5f4006258f9635"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad71ecd43d0af1127df5f4006258f9635">n</a> = 0</td></tr>
+<tr class="memdesc:ad71ecd43d0af1127df5f4006258f9635"><td class="mdescLeft">&#160;</td><td class="mdescRight">size of input array.  <br /></td></tr>
 <tr class="separator:ad71ecd43d0af1127df5f4006258f9635"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ab78620742305a35ff2f8d61179f47d3e" id="r_ab78620742305a35ff2f8d61179f47d3e"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int64_t, <a class="el" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab78620742305a35ff2f8d61179f47d3e">A</a> = {}</td></tr>
+<tr class="memitem:ab78620742305a35ff2f8d61179f47d3e" id="r_ab78620742305a35ff2f8d61179f47d3e"><td class="memItemLeft" align="right" valign="top">std::array&lt; int64_t, <a class="el" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab78620742305a35ff2f8d61179f47d3e">A</a> = {}</td></tr>
 <tr class="memdesc:ab78620742305a35ff2f8d61179f47d3e"><td class="mdescLeft">&#160;</td><td class="mdescRight">input array to perform RMQ.  <br /></td></tr>
 <tr class="separator:ab78620742305a35ff2f8d61179f47d3e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad36b9a20fed47b068e407008c04e9f81" id="r_ad36b9a20fed47b068e407008c04e9f81"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int64_t, <a class="el" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &gt;, <a class="el" href="../../d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e">M</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad36b9a20fed47b068e407008c04e9f81">ST</a> {}</td></tr>
+<tr class="memitem:ad36b9a20fed47b068e407008c04e9f81" id="r_ad36b9a20fed47b068e407008c04e9f81"><td class="memItemLeft" align="right" valign="top">std::array&lt; std::array&lt; int64_t, <a class="el" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &gt;, <a class="el" href="../../d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e">M</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad36b9a20fed47b068e407008c04e9f81">ST</a> {}</td></tr>
 <tr class="memdesc:ad36b9a20fed47b068e407008c04e9f81"><td class="mdescLeft">&#160;</td><td class="mdescRight">the sparse table storing <code>min()</code> values for given interval.  <br /></td></tr>
 <tr class="separator:ad36b9a20fed47b068e407008c04e9f81"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a6cf72f93b1551f0d943c585b4f173be3" id="r_a6cf72f93b1551f0d943c585b4f173be3"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int64_t, <a class="el" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6cf72f93b1551f0d943c585b4f173be3">LOG</a> = {}</td></tr>
+<tr class="memitem:a6cf72f93b1551f0d943c585b4f173be3" id="r_a6cf72f93b1551f0d943c585b4f173be3"><td class="memItemLeft" align="right" valign="top">std::array&lt; int64_t, <a class="el" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6cf72f93b1551f0d943c585b4f173be3">LOG</a> = {}</td></tr>
 <tr class="memdesc:a6cf72f93b1551f0d943c585b4f173be3"><td class="mdescLeft">&#160;</td><td class="mdescRight">where floor(log2(i)) are precomputed.  <br /></td></tr>
 <tr class="separator:a6cf72f93b1551f0d943c585b4f173be3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
-<h2 class="groupheader">Member Function Documentation</h2>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html#l00051">51</a> of file <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html">sparse_table.cpp</a>.</p>
+</div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="a0c8cbe7239232863f104793c08273039" name="a0c8cbe7239232863f104793c08273039"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0c8cbe7239232863f104793c08273039">&#9670;&#160;</a></span>query()</h2>
 
@@ -180,22 +199,21 @@ size_t&#160;</td><td class="memItemRight" valign="bottom"><b>n</b> = 0</td></tr>
 <p>&lt; represents minimum value over the range [g,l]</p>
 <p>&lt; represents minimum value over the range [g, r - pow(2,g) + 1]</p>
 <p>&lt; represents minimum value over the whole range [l,r]</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html#l00110">110</a> of file <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html">sparse_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  110</span>                                        {</div>
-<div class="line"><span class="lineno">  111</span>        int64_t <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a> = <a class="code hl_variable" href="#a6cf72f93b1551f0d943c585b4f173be3">LOG</a>[r - <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> + 1];  <span class="comment">///&lt; smallest power of 2 covering [l,r]</span></div>
-<div class="line"><span class="lineno">  112</span>        int64_t x = <a class="code hl_variable" href="#ad36b9a20fed47b068e407008c04e9f81">ST</a>[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>][<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>];  <span class="comment">///&lt; represents minimum value over the range</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  113</span><span class="comment">                               ///&lt; [g,l]</span></div>
-<div class="line"><span class="lineno">  114</span><span class="comment"></span>        int64_t y =</div>
-<div class="line"><span class="lineno">  115</span>            <a class="code hl_variable" href="#ad36b9a20fed47b068e407008c04e9f81">ST</a>[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>][r - (1 &lt;&lt; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>) + 1];  <span class="comment">///&lt; represents minimum value over the</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  116</span><span class="comment">                                      ///&lt; range [g, r - pow(2,g) + 1]</span></div>
-<div class="line"><span class="lineno">  117</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  118</span>        <span class="keywordflow">return</span> (<a class="code hl_variable" href="#ab78620742305a35ff2f8d61179f47d3e">A</a>[x] &lt;= <a class="code hl_variable" href="#ab78620742305a35ff2f8d61179f47d3e">A</a>[y] ? x : y);  <span class="comment">///&lt; represents minimum value over</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  119</span><span class="comment">                                        ///&lt; the whole range [l,r]</span></div>
-<div class="line"><span class="lineno">  120</span><span class="comment"></span>    }</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:115</div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:119</div></div>
-<div class="ttc" id="astructdata__structures_1_1sparse__table_1_1_sparse__table_html_a6cf72f93b1551f0d943c585b4f173be3"><div class="ttname"><a href="#a6cf72f93b1551f0d943c585b4f173be3">data_structures::sparse_table::Sparse_table::LOG</a></div><div class="ttdeci">std::array&lt; int64_t, N &gt; LOG</div><div class="ttdoc">where floor(log2(i)) are precomputed.</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:60</div></div>
-<div class="ttc" id="astructdata__structures_1_1sparse__table_1_1_sparse__table_html_ab78620742305a35ff2f8d61179f47d3e"><div class="ttname"><a href="#ab78620742305a35ff2f8d61179f47d3e">data_structures::sparse_table::Sparse_table::A</a></div><div class="ttdeci">std::array&lt; int64_t, N &gt; A</div><div class="ttdoc">input array to perform RMQ.</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:57</div></div>
-<div class="ttc" id="astructdata__structures_1_1sparse__table_1_1_sparse__table_html_ad36b9a20fed47b068e407008c04e9f81"><div class="ttname"><a href="#ad36b9a20fed47b068e407008c04e9f81">data_structures::sparse_table::Sparse_table::ST</a></div><div class="ttdeci">std::array&lt; std::array&lt; int64_t, N &gt;, M &gt; ST</div><div class="ttdoc">the sparse table storing min() values for given interval.</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:59</div></div>
+<div class="line"><span class="lineno">  111</span>        int64_t <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a> = <a class="code hl_variable" href="#a6cf72f93b1551f0d943c585b4f173be3">LOG</a>[r - <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> + 1];  </div>
+<div class="line"><span class="lineno">  112</span>        int64_t x = <a class="code hl_variable" href="#ad36b9a20fed47b068e407008c04e9f81">ST</a>[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>][<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>];  </div>
+<div class="line"><span class="lineno">  114</span>        int64_t y =</div>
+<div class="line"><span class="lineno">  115</span>            <a class="code hl_variable" href="#ad36b9a20fed47b068e407008c04e9f81">ST</a>[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>][r - (1 &lt;&lt; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>) + 1];  </div>
+<div class="line"><span class="lineno">  117</span> </div>
+<div class="line"><span class="lineno">  118</span>        <span class="keywordflow">return</span> (<a class="code hl_variable" href="#ab78620742305a35ff2f8d61179f47d3e">A</a>[x] &lt;= <a class="code hl_variable" href="#ab78620742305a35ff2f8d61179f47d3e">A</a>[y] ? x : y);  </div>
+<div class="line"><span class="lineno">  120</span>    }</div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00115">composite_simpson_rule.cpp:115</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00119">composite_simpson_rule.cpp:119</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1sparse__table_1_1_sparse__table_html_a6cf72f93b1551f0d943c585b4f173be3"><div class="ttname"><a href="#a6cf72f93b1551f0d943c585b4f173be3">data_structures::sparse_table::Sparse_table::LOG</a></div><div class="ttdeci">std::array&lt; int64_t, N &gt; LOG</div><div class="ttdoc">where floor(log2(i)) are precomputed.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00060">sparse_table.cpp:60</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1sparse__table_1_1_sparse__table_html_ab78620742305a35ff2f8d61179f47d3e"><div class="ttname"><a href="#ab78620742305a35ff2f8d61179f47d3e">data_structures::sparse_table::Sparse_table::A</a></div><div class="ttdeci">std::array&lt; int64_t, N &gt; A</div><div class="ttdoc">input array to perform RMQ.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00057">sparse_table.cpp:57</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1sparse__table_1_1_sparse__table_html_ad36b9a20fed47b068e407008c04e9f81"><div class="ttname"><a href="#ad36b9a20fed47b068e407008c04e9f81">data_structures::sparse_table::Sparse_table::ST</a></div><div class="ttdeci">std::array&lt; std::array&lt; int64_t, N &gt;, M &gt; ST</div><div class="ttdoc">the sparse table storing min() values for given interval.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00059">sparse_table.cpp:59</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -207,14 +225,16 @@ size_t&#160;</td><td class="memItemRight" valign="bottom"><b>n</b> = 0</td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;int64_t, <a class="el" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>&gt; data_structures::sparse_table::Sparse_table::A = {}</td>
+          <td class="memname">std::array&lt;int64_t, <a class="el" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>&gt; data_structures::sparse_table::Sparse_table::A = {}</td>
         </tr>
       </table>
 </div><div class="memdoc">
 
 <p>input array to perform RMQ. </p>
 <dl class="section warning"><dt>Warning</dt><dd>check if <code>N</code> is not less than <code>n</code>. if so, manually increase the value of N </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   57</span>{};  <span class="comment">///&lt; input array to perform RMQ.</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html">sparse_table.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   57</span>{};  </div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -225,14 +245,34 @@ size_t&#160;</td><td class="memItemRight" valign="bottom"><b>n</b> = 0</td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;int64_t, <a class="el" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>&gt; data_structures::sparse_table::Sparse_table::LOG = {}</td>
+          <td class="memname">std::array&lt;int64_t, <a class="el" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>&gt; data_structures::sparse_table::Sparse_table::LOG = {}</td>
         </tr>
       </table>
 </div><div class="memdoc">
 
 <p>where floor(log2(i)) are precomputed. </p>
-<div class="fragment"><div class="line"><span class="lineno">   60</span>{};  <span class="comment">///&lt; where floor(log2(i)) are precomputed.</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html#l00060">60</a> of file <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html">sparse_table.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   60</span>{};  </div>
 </div><!-- fragment -->
+</div>
+</div>
+<a id="ad71ecd43d0af1127df5f4006258f9635" name="ad71ecd43d0af1127df5f4006258f9635"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ad71ecd43d0af1127df5f4006258f9635">&#9670;&#160;</a></span>n</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">size_t data_structures::sparse_table::Sparse_table::n = 0</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>size of input array. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html#l00052">52</a> of file <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html">sparse_table.cpp</a>.</p>
+
 </div>
 </div>
 <a id="ad36b9a20fed47b068e407008c04e9f81" name="ad36b9a20fed47b068e407008c04e9f81"></a>
@@ -242,18 +282,20 @@ size_t&#160;</td><td class="memItemRight" valign="bottom"><b>n</b> = 0</td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;int64_t, <a class="el" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>&gt;, <a class="el" href="../../d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e">M</a>&gt; data_structures::sparse_table::Sparse_table::ST {}</td>
+          <td class="memname">std::array&lt;std::array&lt;int64_t, <a class="el" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>&gt;, <a class="el" href="../../d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e">M</a>&gt; data_structures::sparse_table::Sparse_table::ST {}</td>
         </tr>
       </table>
 </div><div class="memdoc">
 
 <p>the sparse table storing <code>min()</code> values for given interval. </p>
-<div class="fragment"><div class="line"><span class="lineno">   59</span>{};  <span class="comment">///&lt; the sparse table storing `min()` values for given interval.</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d8/dab/sparse__table_8cpp_source.html">sparse_table.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   59</span>{};  </div>
 </div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../d8/dab/sparse__table_8cpp.html">sparse_table.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d8/dab/sparse__table_8cpp_source.html">sparse_table.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/da/d39/volume_8cpp.html b/da/d39/volume_8cpp.html
index 0b8987a93..1f0d27469 100644
--- a/da/d39/volume_8cpp.html
+++ b/da/d39/volume_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/volume.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/volume.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for volume.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d5e/volume_8cpp__incl.svg" width="336" height="111"><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">
+</div>
+<p><a href="../../da/d39/volume_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -170,6 +189,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Implmentations for the <a href="https://en.wikipedia.org/wiki/Volume" target="_blank">volume</a> of various 3D shapes. </p>
 <p>The volume of a 3D shape is the amount of 3D space that the shape takes up. All shapes have a formula to get the volume of any given shape. These implementations support multiple return types.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Focusucof" target="_blank">Focusucof</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../da/d39/volume_8cpp_source.html">volume.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -188,17 +209,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d39/volume_8cpp_source.html#l00235">235</a> of file <a class="el" href="../../da/d39/volume_8cpp_source.html">volume.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  235</span>           {</div>
 <div class="line"><span class="lineno">  236</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  237</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  238</span>}</div>
-<div class="ttc" id="avolume_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> volume.cpp:112</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="608" height="398"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="avolume_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d39/volume_8cpp_source.html#l00112">volume.cpp:112</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -226,6 +244,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d39/volume_8cpp_source.html#l00112">112</a> of file <a class="el" href="../../da/d39/volume_8cpp_source.html">volume.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  112</span>                   {</div>
 <div class="line"><span class="lineno">  113</span>    <span class="comment">// Input variables</span></div>
 <div class="line"><span class="lineno">  114</span>    uint32_t int_length = 0; <span class="comment">// 32 bit integer length input</span></div>
@@ -249,12 +269,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  132</span>    int_expected = 125;</div>
 <div class="line"><span class="lineno">  133</span>    int_volume = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725">math::cube_volume</a>(int_length);</div>
 <div class="line"><span class="lineno">  134</span> </div>
-<div class="line"><span class="lineno">  135</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A CUBE&quot;</span> &lt;&lt; <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">  136</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; <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">  137</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; <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">  138</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_volume &lt;&lt; <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">  135</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A CUBE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  136</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  137</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  138</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_volume &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  139</span>    assert(int_volume == int_expected);</div>
-<div class="line"><span class="lineno">  140</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  140</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  141</span> </div>
 <div class="line"><span class="lineno">  142</span>    <span class="comment">// 2nd test</span></div>
 <div class="line"><span class="lineno">  143</span>    int_length = 4;</div>
@@ -263,14 +283,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  146</span>    int_expected = 60;</div>
 <div class="line"><span class="lineno">  147</span>    int_volume = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12">math::rect_prism_volume</a>(int_length, int_width, int_height);</div>
 <div class="line"><span class="lineno">  148</span> </div>
-<div class="line"><span class="lineno">  149</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A RECTANGULAR PRISM&quot;</span> &lt;&lt; <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">  150</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; <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">  151</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Width: &quot;</span> &lt;&lt; int_width &lt;&lt; <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">  152</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; <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">  153</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; <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">  154</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_volume &lt;&lt; <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">  149</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A RECTANGULAR PRISM&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  150</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  151</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Width: &quot;</span> &lt;&lt; int_width &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  152</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  153</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  154</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_volume &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  155</span>    assert(int_volume == int_expected);</div>
-<div class="line"><span class="lineno">  156</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  156</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  157</span> </div>
 <div class="line"><span class="lineno">  158</span>    <span class="comment">// 3rd test</span></div>
 <div class="line"><span class="lineno">  159</span>    double_radius = 5;</div>
@@ -278,13 +298,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  161</span>    double_expected = 183.16666666666666;  <span class="comment">// truncated to 14 decimal places</span></div>
 <div class="line"><span class="lineno">  162</span>    double_volume = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7">math::cone_volume</a>(double_radius, double_height);</div>
 <div class="line"><span class="lineno">  163</span> </div>
-<div class="line"><span class="lineno">  164</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A CONE&quot;</span> &lt;&lt; <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">  165</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; <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">  166</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; double_height &lt;&lt; <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">  167</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; <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">  168</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_volume &lt;&lt; <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">  164</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A CONE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  165</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  166</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; double_height &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  167</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  168</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_volume &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  169</span>    assert(double_volume == double_expected);</div>
-<div class="line"><span class="lineno">  170</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  170</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  171</span> </div>
 <div class="line"><span class="lineno">  172</span>    <span class="comment">// 4th test</span></div>
 <div class="line"><span class="lineno">  173</span>    int_base = 3;</div>
@@ -293,14 +313,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  176</span>    int_expected = 30;</div>
 <div class="line"><span class="lineno">  177</span>    int_volume = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c">math::triangle_prism_volume</a>(int_base, int_height, int_depth);</div>
 <div class="line"><span class="lineno">  178</span> </div>
-<div class="line"><span class="lineno">  179</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A TRIANGULAR PRISM&quot;</span> &lt;&lt; <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">  180</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Base: &quot;</span> &lt;&lt; int_base &lt;&lt; <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">  181</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; <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">  182</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Depth: &quot;</span> &lt;&lt; int_depth &lt;&lt; <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">  183</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; <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">  184</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_volume &lt;&lt; <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">  179</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A TRIANGULAR PRISM&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  180</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Base: &quot;</span> &lt;&lt; int_base &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  181</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  182</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Depth: &quot;</span> &lt;&lt; int_depth &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  183</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  184</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_volume &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  185</span>    assert(int_volume == int_expected);</div>
-<div class="line"><span class="lineno">  186</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  186</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  187</span> </div>
 <div class="line"><span class="lineno">  188</span>    <span class="comment">// 5th test</span></div>
 <div class="line"><span class="lineno">  189</span>    int_length = 10;</div>
@@ -309,26 +329,26 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  192</span>    int_expected = 50;</div>
 <div class="line"><span class="lineno">  193</span>    int_volume = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c">math::pyramid_volume</a>(int_length, int_width, int_height);</div>
 <div class="line"><span class="lineno">  194</span> </div>
-<div class="line"><span class="lineno">  195</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A PYRAMID&quot;</span> &lt;&lt; <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">  196</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; <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">  197</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Width: &quot;</span> &lt;&lt; int_width &lt;&lt; <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">  198</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; <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">  199</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; <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">  200</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_volume &lt;&lt; <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">  195</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A PYRAMID&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  196</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  197</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Width: &quot;</span> &lt;&lt; int_width &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  198</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  199</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  200</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_volume &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  201</span>    assert(int_volume == int_expected);</div>
-<div class="line"><span class="lineno">  202</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  203</span> </div>
 <div class="line"><span class="lineno">  204</span>    <span class="comment">// 6th test</span></div>
 <div class="line"><span class="lineno">  205</span>    double_radius = 3;</div>
 <div class="line"><span class="lineno">  206</span>    double_expected = 113.04;</div>
 <div class="line"><span class="lineno">  207</span>    double_volume = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551">math::sphere_volume</a>(double_radius);</div>
 <div class="line"><span class="lineno">  208</span> </div>
-<div class="line"><span class="lineno">  209</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A SPHERE&quot;</span> &lt;&lt; <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">  210</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; <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">  211</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; <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">  212</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_volume &lt;&lt; <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">  209</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A SPHERE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  210</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  211</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  212</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_volume &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  213</span>    assert(double_volume == double_expected);</div>
-<div class="line"><span class="lineno">  214</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  214</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  215</span> </div>
 <div class="line"><span class="lineno">  216</span>    <span class="comment">// 7th test</span></div>
 <div class="line"><span class="lineno">  217</span>    double_radius = 5;</div>
@@ -336,29 +356,22 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  219</span>    double_expected = 157;</div>
 <div class="line"><span class="lineno">  220</span>    double_volume = <a class="code hl_function" href="../../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca">math::cylinder_volume</a>(double_radius, double_height);</div>
 <div class="line"><span class="lineno">  221</span> </div>
-<div class="line"><span class="lineno">  222</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A CYLINDER&quot;</span> &lt;&lt; <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">  223</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; <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">  224</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; double_height &lt;&lt; <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">  225</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; <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">  226</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_volume &lt;&lt; <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">  222</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A CYLINDER&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  223</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  224</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; double_height &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  225</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  226</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_volume &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  227</span>    assert(double_volume == double_expected);</div>
-<div class="line"><span class="lineno">  228</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  228</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  229</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="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="anamespacemath_html_a2d704a7b72a6b2db8b76c8581b577b2c"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c">math::triangle_prism_volume</a></div><div class="ttdeci">T triangle_prism_volume(T base, T height, T depth)</div><div class="ttdoc">The volume of a triangular prism.</div><div class="ttdef"><b>Definition</b> volume.cpp:67</div></div>
-<div class="ttc" id="anamespacemath_html_a34d66a77c19ce9b8b3a3d14352b34551"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551">math::sphere_volume</a></div><div class="ttdeci">T sphere_volume(T radius, double PI=3.14)</div><div class="ttdoc">The volume of a sphere</div><div class="ttdef"><b>Definition</b> volume.cpp:91</div></div>
-<div class="ttc" id="anamespacemath_html_a3fdc74c24697ec5bb5c3698c96117c12"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12">math::rect_prism_volume</a></div><div class="ttdeci">T rect_prism_volume(T length, T width, T height)</div><div class="ttdoc">The volume of a rectangular prism.</div><div class="ttdef"><b>Definition</b> volume.cpp:41</div></div>
-<div class="ttc" id="anamespacemath_html_a3fe35440c27758ecc2287e08217d63a7"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7">math::cone_volume</a></div><div class="ttdeci">T cone_volume(T radius, T height, double PI=3.14)</div><div class="ttdoc">The volume of a cone</div><div class="ttdef"><b>Definition</b> volume.cpp:53</div></div>
-<div class="ttc" id="anamespacemath_html_a94db02b3c9e55a69ac1696f30e2f761c"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c">math::pyramid_volume</a></div><div class="ttdeci">T pyramid_volume(T length, T width, T height)</div><div class="ttdoc">The volume of a pyramid</div><div class="ttdef"><b>Definition</b> volume.cpp:80</div></div>
-<div class="ttc" id="anamespacemath_html_abde24398be43538c62e4a496968e60ca"><div class="ttname"><a href="../../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca">math::cylinder_volume</a></div><div class="ttdeci">T cylinder_volume(T radius, T height, double PI=3.14)</div><div class="ttdoc">The volume of a cylinder</div><div class="ttdef"><b>Definition</b> volume.cpp:103</div></div>
-<div class="ttc" id="anamespacemath_html_ae413098478fa38acaac887b7654f0725"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725">math::cube_volume</a></div><div class="ttdeci">T cube_volume(T length)</div><div class="ttdoc">The volume of a cube</div><div class="ttdef"><b>Definition</b> volume.cpp:28</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="511" height="398"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemath_html_a2d704a7b72a6b2db8b76c8581b577b2c"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c">math::triangle_prism_volume</a></div><div class="ttdeci">T triangle_prism_volume(T base, T height, T depth)</div><div class="ttdoc">The volume of a triangular prism.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d39/volume_8cpp_source.html#l00067">volume.cpp:67</a></div></div>
+<div class="ttc" id="anamespacemath_html_a34d66a77c19ce9b8b3a3d14352b34551"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551">math::sphere_volume</a></div><div class="ttdeci">T sphere_volume(T radius, double PI=3.14)</div><div class="ttdoc">The volume of a sphere</div><div class="ttdef"><b>Definition</b> <a href="../../da/d39/volume_8cpp_source.html#l00091">volume.cpp:91</a></div></div>
+<div class="ttc" id="anamespacemath_html_a3fdc74c24697ec5bb5c3698c96117c12"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12">math::rect_prism_volume</a></div><div class="ttdeci">T rect_prism_volume(T length, T width, T height)</div><div class="ttdoc">The volume of a rectangular prism.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d39/volume_8cpp_source.html#l00041">volume.cpp:41</a></div></div>
+<div class="ttc" id="anamespacemath_html_a3fe35440c27758ecc2287e08217d63a7"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7">math::cone_volume</a></div><div class="ttdeci">T cone_volume(T radius, T height, double PI=3.14)</div><div class="ttdoc">The volume of a cone</div><div class="ttdef"><b>Definition</b> <a href="../../da/d39/volume_8cpp_source.html#l00053">volume.cpp:53</a></div></div>
+<div class="ttc" id="anamespacemath_html_a94db02b3c9e55a69ac1696f30e2f761c"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c">math::pyramid_volume</a></div><div class="ttdeci">T pyramid_volume(T length, T width, T height)</div><div class="ttdoc">The volume of a pyramid</div><div class="ttdef"><b>Definition</b> <a href="../../da/d39/volume_8cpp_source.html#l00080">volume.cpp:80</a></div></div>
+<div class="ttc" id="anamespacemath_html_abde24398be43538c62e4a496968e60ca"><div class="ttname"><a href="../../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca">math::cylinder_volume</a></div><div class="ttdeci">T cylinder_volume(T radius, T height, double PI=3.14)</div><div class="ttdoc">The volume of a cylinder</div><div class="ttdef"><b>Definition</b> <a href="../../da/d39/volume_8cpp_source.html#l00103">volume.cpp:103</a></div></div>
+<div class="ttc" id="anamespacemath_html_ae413098478fa38acaac887b7654f0725"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725">math::cube_volume</a></div><div class="ttdeci">T cube_volume(T length)</div><div class="ttdoc">The volume of a cube</div><div class="ttdef"><b>Definition</b> <a href="../../da/d39/volume_8cpp_source.html#l00028">volume.cpp:28</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 0b850235a..000000000
--- a/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,33 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,195,49,220"/>
-<area shape="rect" id="Node000002" href="$dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7" title="The volume of a cone" alt="" coords="113,169,248,195"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,201,97,193,98,198,49,207"/>
-<area shape="rect" id="Node000006" href="$dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725" title="The volume of a cube" alt="" coords="113,268,248,294"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="45,219,69,237,98,254,110,260,108,265,95,259,66,242,42,223"/>
-<area shape="rect" id="Node000007" href="$dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca" title="The volume of a cylinder" alt="" coords="105,219,257,244"/>
-<area shape="poly" id="edge8_Node000001_Node000007" title=" " alt="" coords="49,208,90,215,89,220,48,213"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="145,367,216,392"/>
-<area shape="poly" id="edge11_Node000001_Node000008" title=" " alt="" coords="33,220,40,248,52,284,71,322,98,353,113,363,131,370,129,375,111,368,95,358,67,325,47,286,35,250,28,221"/>
-<area shape="rect" id="Node000009" href="$dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c" title="The volume of a pyramid" alt="" coords="104,5,258,31"/>
-<area shape="poly" id="edge12_Node000001_Node000009" title=" " alt="" coords="27,194,33,162,45,121,65,78,95,40,98,37,102,42,99,44,69,81,50,123,38,164,33,195"/>
-<area shape="rect" id="Node000010" href="$dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12" title="The volume of a rectangular prism." alt="" coords="97,55,265,80"/>
-<area shape="poly" id="edge14_Node000001_Node000010" title=" " alt="" coords="30,193,52,144,71,115,95,91,102,86,105,90,98,95,75,119,57,146,35,195"/>
-<area shape="rect" id="Node000011" href="$dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551" title="The volume of a sphere" alt="" coords="108,317,254,343"/>
-<area shape="poly" id="edge16_Node000001_Node000011" title=" " alt="" coords="36,220,59,262,77,285,98,304,104,308,101,312,95,308,73,288,55,265,32,222"/>
-<area shape="rect" id="Node000012" href="$dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c" title="The volume of a triangular prism." alt="" coords="111,104,250,145"/>
-<area shape="poly" id="edge18_Node000001_Node000012" title=" " alt="" coords="42,192,95,155,105,150,107,154,98,159,45,196"/>
-<area shape="rect" id="Node000003" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="320,112,377,138"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="228,166,264,154,305,139,307,144,266,159,229,171"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="313,243,384,268"/>
-<area shape="poly" id="edge5_Node000002_Node000005" title=" " alt="" coords="237,193,266,204,317,232,315,236,264,209,235,198"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="327,113,324,103,326,94,335,88,349,85,364,88,372,95,368,99,361,93,349,91,337,93,330,97,329,103,332,111"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="432,112,505,138"/>
-<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="377,122,417,122,417,128,377,128"/>
-<area shape="poly" id="edge7_Node000006_Node000005" title=" " alt="" coords="248,268,297,261,298,266,249,273"/>
-<area shape="poly" id="edge9_Node000007_Node000003" title=" " alt="" coords="241,216,264,205,299,178,326,148,330,151,302,182,266,210,243,221"/>
-<area shape="poly" id="edge10_Node000007_Node000005" title=" " alt="" coords="258,240,298,246,297,251,257,245"/>
-<area shape="poly" id="edge13_Node000009_Node000003" title=" " alt="" coords="243,29,266,40,302,68,330,98,326,102,299,72,264,44,241,34"/>
-<area shape="poly" id="edge15_Node000010_Node000003" title=" " alt="" coords="229,78,266,90,307,106,305,111,264,95,228,84"/>
-<area shape="poly" id="edge17_Node000011_Node000005" title=" " alt="" coords="235,314,264,304,315,275,318,280,266,309,237,319"/>
-<area shape="poly" id="edge19_Node000012_Node000003" title=" " alt="" coords="251,122,305,122,305,128,251,128"/>
-</map>
diff --git a/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 0fef6ee3b..000000000
--- a/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a2042f44422579dc6741441ab872465c
\ No newline at end of file
diff --git a/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 0a1b21557..000000000
--- a/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,318 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="383pt" height="298pt"
- viewBox="0.00 0.00 382.50 298.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 294.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-148.25 0,-148.25 0,-129 32.5,-129 32.5,-148.25"/>
-<text text-anchor="middle" x="16.25" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7" target="_top" xlink:title="The volume of a cone">
-<polygon fill="white" stroke="#666666" points="182.38,-167.25 80.88,-167.25 80.88,-148 182.38,-148 182.38,-167.25"/>
-<text text-anchor="middle" x="131.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cone_volume</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.54,-141.19C42.32,-142.83 55.71,-145.07 69.45,-147.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.55,-150.77 78.99,-148.97 69.71,-143.87 68.55,-150.77"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725" target="_top" xlink:title="The volume of a cube">
-<polygon fill="white" stroke="#666666" points="182.38,-93.25 80.88,-93.25 80.88,-74 182.38,-74 182.38,-93.25"/>
-<text text-anchor="middle" x="131.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cube_volume</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.72,-128.56C38.65,-120.3 53.7,-108.84 68.5,-101.62 71.43,-100.19 74.5,-98.86 77.64,-97.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.8,-100.91 87.02,-94.23 76.43,-94.32 78.8,-100.91"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca" target="_top" xlink:title="The volume of a cylinder">
-<polygon fill="white" stroke="#666666" points="188.75,-130.25 74.5,-130.25 74.5,-111 188.75,-111 188.75,-130.25"/>
-<text text-anchor="middle" x="131.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cylinder_volume</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge8_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.54,-136.2C40.78,-134.89 51.6,-133.17 63.03,-131.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="63.29,-134.86 72.61,-129.84 62.19,-127.95 63.29,-134.86"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158.38,-19.25 104.88,-19.25 104.88,0 158.38,0 158.38,-19.25"/>
-<text text-anchor="middle" x="131.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge11_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge11_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M18.98,-128.66C23.27,-106.96 36.47,-55.16 68.5,-27.62 75.5,-21.6 84.42,-17.59 93.3,-14.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.03,-18.35 102.91,-12.57 92.36,-11.55 94.03,-18.35"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c" target="_top" xlink:title="The volume of a pyramid">
-<polygon fill="white" stroke="#666666" points="189.12,-290.25 74.12,-290.25 74.12,-271 189.12,-271 189.12,-290.25"/>
-<text text-anchor="middle" x="131.62" y="-276.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::pyramid_volume</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge12_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge12_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M18.45,-148.66C21.8,-172.18 33.45,-231.23 68.5,-262.62 69.27,-263.31 70.06,-263.98 70.88,-264.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.71,-267.39 79.05,-269.71 72.42,-261.45 68.71,-267.39"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12" target="_top" xlink:title="The volume of a rectangular prism.">
-<polygon fill="white" stroke="#666666" points="194.75,-253.25 68.5,-253.25 68.5,-234 194.75,-234 194.75,-253.25"/>
-<text text-anchor="middle" x="131.62" y="-239.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::rect_prism_volume</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge14_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge14_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.43,-148.48C26.71,-166.35 42.38,-204.14 68.5,-224.62 70.23,-225.98 72.06,-227.24 73.96,-228.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.1,-231.4 82.59,-232.86 75.31,-225.17 72.1,-231.4"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551" target="_top" xlink:title="The volume of a sphere">
-<polygon fill="white" stroke="#666666" points="186.5,-56.25 76.75,-56.25 76.75,-37 186.5,-37 186.5,-56.25"/>
-<text text-anchor="middle" x="131.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sphere_volume</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge16_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge16_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.47,-128.6C28.72,-112.63 45.03,-81.51 68.5,-64.62 69.87,-63.64 71.29,-62.71 72.75,-61.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.18,-65.03 81.55,-57.41 71.04,-58.77 74.18,-65.03"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c" target="_top" xlink:title="The volume of a triangular prism.">
-<polygon fill="white" stroke="#666666" points="183.88,-215.88 79.38,-215.88 79.38,-185.38 183.88,-185.38 183.88,-215.88"/>
-<text text-anchor="start" x="87.38" y="-202.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::triangle_prism</text>
-<text text-anchor="middle" x="131.62" y="-191.12" font-family="Helvetica,sans-Serif" font-size="10.00">_volume</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge18_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge18_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.85,-148.65C38.85,-156.94 53.95,-168.61 68.5,-176.62 70.81,-177.9 73.2,-179.13 75.63,-180.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.92,-183.39 84.47,-184.37 76.83,-177.02 73.92,-183.39"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278.62,-210.25 236.38,-210.25 236.38,-191 278.62,-191 278.62,-210.25"/>
-<text text-anchor="middle" x="257.5" y="-196.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.28,-167.73C176.27,-170.48 185.91,-173.56 194.75,-176.62 204.86,-180.13 215.77,-184.25 225.57,-188.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.06,-191.26 234.65,-191.68 226.64,-184.75 224.06,-191.26"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="284.25,-112.25 230.75,-112.25 230.75,-93 284.25,-93 284.25,-112.25"/>
-<text text-anchor="middle" x="257.5" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.93,-147.59C180.31,-145.3 187.85,-142.63 194.75,-139.62 207.91,-133.89 221.69,-125.86 232.88,-118.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="234.62,-121.78 241.08,-113.38 230.79,-115.92 234.62,-121.78"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.43,-210.54C237.01,-219.15 241.7,-228.25 257.5,-228.25 266.14,-228.25 271.46,-225.53 273.45,-221.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="276.94,-221.31 271.82,-212.03 270.04,-222.47 276.94,-221.31"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="374.5,-210.25 320.25,-210.25 320.25,-191 374.5,-191 374.5,-210.25"/>
-<text text-anchor="middle" x="347.38" y="-196.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.88,-200.62C287.72,-200.62 298.37,-200.62 308.57,-200.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="308.26,-204.13 318.26,-200.63 308.26,-197.13 308.26,-204.13"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge7_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge7_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.65,-91.3C194.81,-93.16 207.61,-95.13 219.07,-96.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.54,-100.34 228.95,-98.4 219.6,-93.42 218.54,-100.34"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge9_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge9_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.55,-130.67C183.54,-132.85 189.44,-135.48 194.75,-138.62 213.65,-149.82 230.91,-168.16 242.34,-181.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.37,-183.87 248.33,-189.52 244.85,-179.51 239.37,-183.87"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge10_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge10_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.13,-112.42C199.26,-110.94 209.6,-109.44 219.03,-108.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.53,-111.53 228.92,-106.63 218.52,-104.61 219.53,-111.53"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge13_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge13_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.55,-270.58C183.54,-268.4 189.44,-265.77 194.75,-262.62 213.65,-251.43 230.91,-233.09 242.34,-219.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.85,-221.74 248.33,-211.73 239.37,-217.38 244.85,-221.74"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node3 -->
-<g id="edge15_Node000010_Node000003" class="edge">
-<title>Node10&#45;&gt;Node3</title>
-<g id="a_edge15_Node000010_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.28,-233.52C176.27,-230.77 185.91,-227.69 194.75,-224.62 204.86,-221.12 215.77,-217 225.57,-213.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.64,-216.5 234.65,-209.57 224.06,-209.99 226.64,-216.5"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge17_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge17_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M173.29,-56.69C180.56,-58.97 187.97,-61.62 194.75,-64.62 208.14,-70.56 222.12,-78.95 233.38,-86.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.37,-89.2 241.61,-91.89 235.29,-83.4 231.37,-89.2"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node3 -->
-<g id="edge19_Node000012_Node000003" class="edge">
-<title>Node12&#45;&gt;Node3</title>
-<g id="a_edge19_Node000012_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.08,-200.62C197.74,-200.62 212.1,-200.62 224.4,-200.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.4,-204.13 234.4,-200.63 224.4,-197.13 224.4,-204.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 9b26ead22..000000000
--- a/da/d39/volume_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,292 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="383pt" height="298pt"
- viewBox="0.00 0.00 382.50 298.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 294.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-148.25 0,-148.25 0,-129 32.5,-129 32.5,-148.25"/>
-<text text-anchor="middle" x="16.25" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7" target="_top" xlink:title="The volume of a cone">
-<polygon fill="white" stroke="#666666" points="182.38,-167.25 80.88,-167.25 80.88,-148 182.38,-148 182.38,-167.25"/>
-<text text-anchor="middle" x="131.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cone_volume</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.54,-141.19C42.32,-142.83 55.71,-145.07 69.45,-147.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.55,-150.77 78.99,-148.97 69.71,-143.87 68.55,-150.77"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725" target="_top" xlink:title="The volume of a cube">
-<polygon fill="white" stroke="#666666" points="182.38,-93.25 80.88,-93.25 80.88,-74 182.38,-74 182.38,-93.25"/>
-<text text-anchor="middle" x="131.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cube_volume</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.72,-128.56C38.65,-120.3 53.7,-108.84 68.5,-101.62 71.43,-100.19 74.5,-98.86 77.64,-97.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.8,-100.91 87.02,-94.23 76.43,-94.32 78.8,-100.91"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca" target="_top" xlink:title="The volume of a cylinder">
-<polygon fill="white" stroke="#666666" points="188.75,-130.25 74.5,-130.25 74.5,-111 188.75,-111 188.75,-130.25"/>
-<text text-anchor="middle" x="131.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cylinder_volume</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge8_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge8_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.54,-136.2C40.78,-134.89 51.6,-133.17 63.03,-131.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="63.29,-134.86 72.61,-129.84 62.19,-127.95 63.29,-134.86"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158.38,-19.25 104.88,-19.25 104.88,0 158.38,0 158.38,-19.25"/>
-<text text-anchor="middle" x="131.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge11_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge11_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M18.98,-128.66C23.27,-106.96 36.47,-55.16 68.5,-27.62 75.5,-21.6 84.42,-17.59 93.3,-14.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.03,-18.35 102.91,-12.57 92.36,-11.55 94.03,-18.35"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c" target="_top" xlink:title="The volume of a pyramid">
-<polygon fill="white" stroke="#666666" points="189.12,-290.25 74.12,-290.25 74.12,-271 189.12,-271 189.12,-290.25"/>
-<text text-anchor="middle" x="131.62" y="-276.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::pyramid_volume</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge12_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge12_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M18.45,-148.66C21.8,-172.18 33.45,-231.23 68.5,-262.62 69.27,-263.31 70.06,-263.98 70.88,-264.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.71,-267.39 79.05,-269.71 72.42,-261.45 68.71,-267.39"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12" target="_top" xlink:title="The volume of a rectangular prism.">
-<polygon fill="white" stroke="#666666" points="194.75,-253.25 68.5,-253.25 68.5,-234 194.75,-234 194.75,-253.25"/>
-<text text-anchor="middle" x="131.62" y="-239.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::rect_prism_volume</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge14_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge14_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.43,-148.48C26.71,-166.35 42.38,-204.14 68.5,-224.62 70.23,-225.98 72.06,-227.24 73.96,-228.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.1,-231.4 82.59,-232.86 75.31,-225.17 72.1,-231.4"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551" target="_top" xlink:title="The volume of a sphere">
-<polygon fill="white" stroke="#666666" points="186.5,-56.25 76.75,-56.25 76.75,-37 186.5,-37 186.5,-56.25"/>
-<text text-anchor="middle" x="131.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sphere_volume</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge16_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge16_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.47,-128.6C28.72,-112.63 45.03,-81.51 68.5,-64.62 69.87,-63.64 71.29,-62.71 72.75,-61.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.18,-65.03 81.55,-57.41 71.04,-58.77 74.18,-65.03"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c" target="_top" xlink:title="The volume of a triangular prism.">
-<polygon fill="white" stroke="#666666" points="183.88,-215.88 79.38,-215.88 79.38,-185.38 183.88,-185.38 183.88,-215.88"/>
-<text text-anchor="start" x="87.38" y="-202.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::triangle_prism</text>
-<text text-anchor="middle" x="131.62" y="-191.12" font-family="Helvetica,sans-Serif" font-size="10.00">_volume</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge18_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge18_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.85,-148.65C38.85,-156.94 53.95,-168.61 68.5,-176.62 70.81,-177.9 73.2,-179.13 75.63,-180.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.92,-183.39 84.47,-184.37 76.83,-177.02 73.92,-183.39"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278.62,-210.25 236.38,-210.25 236.38,-191 278.62,-191 278.62,-210.25"/>
-<text text-anchor="middle" x="257.5" y="-196.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.28,-167.73C176.27,-170.48 185.91,-173.56 194.75,-176.62 204.86,-180.13 215.77,-184.25 225.57,-188.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.06,-191.26 234.65,-191.68 226.64,-184.75 224.06,-191.26"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="284.25,-112.25 230.75,-112.25 230.75,-93 284.25,-93 284.25,-112.25"/>
-<text text-anchor="middle" x="257.5" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.93,-147.59C180.31,-145.3 187.85,-142.63 194.75,-139.62 207.91,-133.89 221.69,-125.86 232.88,-118.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="234.62,-121.78 241.08,-113.38 230.79,-115.92 234.62,-121.78"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.43,-210.54C237.01,-219.15 241.7,-228.25 257.5,-228.25 266.14,-228.25 271.46,-225.53 273.45,-221.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="276.94,-221.31 271.82,-212.03 270.04,-222.47 276.94,-221.31"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="374.5,-210.25 320.25,-210.25 320.25,-191 374.5,-191 374.5,-210.25"/>
-<text text-anchor="middle" x="347.38" y="-196.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.88,-200.62C287.72,-200.62 298.37,-200.62 308.57,-200.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="308.26,-204.13 318.26,-200.63 308.26,-197.13 308.26,-204.13"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge7_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge7_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.65,-91.3C194.81,-93.16 207.61,-95.13 219.07,-96.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.54,-100.34 228.95,-98.4 219.6,-93.42 218.54,-100.34"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge9_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge9_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.55,-130.67C183.54,-132.85 189.44,-135.48 194.75,-138.62 213.65,-149.82 230.91,-168.16 242.34,-181.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.37,-183.87 248.33,-189.52 244.85,-179.51 239.37,-183.87"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge10_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge10_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.13,-112.42C199.26,-110.94 209.6,-109.44 219.03,-108.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.53,-111.53 228.92,-106.63 218.52,-104.61 219.53,-111.53"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge13_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge13_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.55,-270.58C183.54,-268.4 189.44,-265.77 194.75,-262.62 213.65,-251.43 230.91,-233.09 242.34,-219.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.85,-221.74 248.33,-211.73 239.37,-217.38 244.85,-221.74"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node3 -->
-<g id="edge15_Node000010_Node000003" class="edge">
-<title>Node10&#45;&gt;Node3</title>
-<g id="a_edge15_Node000010_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.28,-233.52C176.27,-230.77 185.91,-227.69 194.75,-224.62 204.86,-221.12 215.77,-217 225.57,-213.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.64,-216.5 234.65,-209.57 224.06,-209.99 226.64,-216.5"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge17_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge17_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M173.29,-56.69C180.56,-58.97 187.97,-61.62 194.75,-64.62 208.14,-70.56 222.12,-78.95 233.38,-86.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.37,-89.2 241.61,-91.89 235.29,-83.4 231.37,-89.2"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node3 -->
-<g id="edge19_Node000012_Node000003" class="edge">
-<title>Node12&#45;&gt;Node3</title>
-<g id="a_edge19_Node000012_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.08,-200.62C197.74,-200.62 212.1,-200.62 224.4,-200.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.4,-204.13 234.4,-200.63 224.4,-197.13 224.4,-204.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index c959fc4dc..000000000
--- a/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,35 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,195,55,220"/>
-<area shape="rect" id="Node000002" href="$da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,195,146,220"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,205,87,205,87,210,55,210"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7" title="The volume of a cone" alt="" coords="210,169,346,195"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,201,195,193,196,198,146,207"/>
-<area shape="rect" id="Node000007" href="$dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725" title="The volume of a cube" alt="" coords="210,268,346,294"/>
-<area shape="poly" id="edge7_Node000002_Node000007" title=" " alt="" coords="143,219,167,237,195,254,207,260,205,265,193,259,164,242,139,223"/>
-<area shape="rect" id="Node000008" href="$dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca" title="The volume of a cylinder" alt="" coords="202,219,354,244"/>
-<area shape="poly" id="edge9_Node000002_Node000008" title=" " alt="" coords="146,208,187,215,186,220,146,213"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="242,367,314,392"/>
-<area shape="poly" id="edge12_Node000002_Node000009" title=" " alt="" coords="131,220,137,248,150,284,169,322,196,353,211,363,228,370,226,375,208,368,192,358,164,325,145,286,132,250,125,221"/>
-<area shape="rect" id="Node000010" href="$dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c" title="The volume of a pyramid" alt="" coords="202,5,355,31"/>
-<area shape="poly" id="edge13_Node000002_Node000010" title=" " alt="" coords="125,194,130,162,142,121,162,78,192,40,195,37,199,42,196,44,167,81,147,123,136,164,130,195"/>
-<area shape="rect" id="Node000011" href="$dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12" title="The volume of a rectangular prism." alt="" coords="194,55,362,80"/>
-<area shape="poly" id="edge15_Node000002_Node000011" title=" " alt="" coords="127,193,150,144,168,115,192,91,200,86,203,90,196,95,173,119,154,146,132,195"/>
-<area shape="rect" id="Node000012" href="$dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551" title="The volume of a sphere" alt="" coords="205,317,351,343"/>
-<area shape="poly" id="edge17_Node000002_Node000012" title=" " alt="" coords="134,220,157,262,174,285,196,304,201,308,198,312,192,308,170,288,152,265,129,222"/>
-<area shape="rect" id="Node000013" href="$dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c" title="The volume of a triangular prism." alt="" coords="208,104,348,145"/>
-<area shape="poly" id="edge19_Node000002_Node000013" title=" " alt="" coords="140,192,193,155,202,150,205,154,195,159,143,196"/>
-<area shape="rect" id="Node000004" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="418,112,474,138"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="325,166,361,154,402,139,404,144,363,159,327,171"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="410,243,482,268"/>
-<area shape="poly" id="edge6_Node000003_Node000006" title=" " alt="" coords="334,193,363,204,414,232,412,236,361,209,332,198"/>
-<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="425,113,421,103,423,94,432,88,446,85,461,88,469,95,466,99,459,93,446,91,434,93,428,97,426,103,430,111"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="530,112,602,138"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="475,122,514,122,514,128,475,128"/>
-<area shape="poly" id="edge8_Node000007_Node000006" title=" " alt="" coords="346,268,394,261,395,266,347,273"/>
-<area shape="poly" id="edge10_Node000008_Node000004" title=" " alt="" coords="338,216,361,205,396,178,424,148,428,151,400,182,364,210,341,221"/>
-<area shape="poly" id="edge11_Node000008_Node000006" title=" " alt="" coords="355,240,395,246,394,251,354,245"/>
-<area shape="poly" id="edge14_Node000010_Node000004" title=" " alt="" coords="341,29,364,40,400,68,428,98,424,102,396,72,361,44,338,34"/>
-<area shape="poly" id="edge16_Node000011_Node000004" title=" " alt="" coords="327,78,363,90,404,106,402,111,361,95,325,84"/>
-<area shape="poly" id="edge18_Node000012_Node000006" title=" " alt="" coords="333,314,361,304,413,275,415,280,363,309,335,319"/>
-<area shape="poly" id="edge20_Node000013_Node000004" title=" " alt="" coords="348,122,402,122,402,128,348,128"/>
-</map>
diff --git a/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index ed37e25d6..000000000
--- a/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-61f18d2a4263c96e3cb9bdb9e010288d
\ No newline at end of file
diff --git a/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index fc43891dc..000000000
--- a/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,336 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="456pt" height="298pt"
- viewBox="0.00 0.00 455.50 298.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 294.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-148.25 0,-148.25 0,-129 37,-129 37,-148.25"/>
-<text text-anchor="middle" x="18.5" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-148.25 73,-148.25 73,-129 105.5,-129 105.5,-148.25"/>
-<text text-anchor="middle" x="89.25" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-138.62C44.58,-138.62 53.31,-138.62 61.45,-138.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-142.13 71.2,-138.63 61.2,-135.13 61.2,-142.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7" target="_top" xlink:title="The volume of a cone">
-<polygon fill="white" stroke="#666666" points="255.38,-167.25 153.88,-167.25 153.88,-148 255.38,-148 255.38,-167.25"/>
-<text text-anchor="middle" x="204.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cone_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.54,-141.19C115.32,-142.83 128.71,-145.07 142.45,-147.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.55,-150.77 151.99,-148.97 142.71,-143.87 141.55,-150.77"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725" target="_top" xlink:title="The volume of a cube">
-<polygon fill="white" stroke="#666666" points="255.38,-93.25 153.88,-93.25 153.88,-74 255.38,-74 255.38,-93.25"/>
-<text text-anchor="middle" x="204.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cube_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge7_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge7_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.72,-128.56C111.65,-120.3 126.7,-108.84 141.5,-101.62 144.43,-100.19 147.5,-98.86 150.64,-97.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.8,-100.91 160.02,-94.23 149.43,-94.32 151.8,-100.91"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca" target="_top" xlink:title="The volume of a cylinder">
-<polygon fill="white" stroke="#666666" points="261.75,-130.25 147.5,-130.25 147.5,-111 261.75,-111 261.75,-130.25"/>
-<text text-anchor="middle" x="204.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cylinder_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge9_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge9_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.54,-136.2C113.78,-134.89 124.6,-133.17 136.03,-131.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.29,-134.86 145.61,-129.84 135.19,-127.95 136.29,-134.86"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.38,-19.25 177.88,-19.25 177.88,0 231.38,0 231.38,-19.25"/>
-<text text-anchor="middle" x="204.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge12_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge12_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.98,-128.66C96.27,-106.96 109.47,-55.16 141.5,-27.62 148.5,-21.6 157.42,-17.59 166.3,-14.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.03,-18.35 175.91,-12.57 165.36,-11.55 167.03,-18.35"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c" target="_top" xlink:title="The volume of a pyramid">
-<polygon fill="white" stroke="#666666" points="262.12,-290.25 147.12,-290.25 147.12,-271 262.12,-271 262.12,-290.25"/>
-<text text-anchor="middle" x="204.62" y="-276.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::pyramid_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge13_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge13_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.45,-148.66C94.8,-172.18 106.45,-231.23 141.5,-262.62 142.27,-263.31 143.06,-263.98 143.88,-264.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.71,-267.39 152.05,-269.71 145.42,-261.45 141.71,-267.39"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12" target="_top" xlink:title="The volume of a rectangular prism.">
-<polygon fill="white" stroke="#666666" points="267.75,-253.25 141.5,-253.25 141.5,-234 267.75,-234 267.75,-253.25"/>
-<text text-anchor="middle" x="204.62" y="-239.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::rect_prism_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge15_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge15_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.43,-148.48C99.71,-166.35 115.38,-204.14 141.5,-224.62 143.23,-225.98 145.06,-227.24 146.96,-228.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.1,-231.4 155.59,-232.86 148.31,-225.17 145.1,-231.4"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551" target="_top" xlink:title="The volume of a sphere">
-<polygon fill="white" stroke="#666666" points="259.5,-56.25 149.75,-56.25 149.75,-37 259.5,-37 259.5,-56.25"/>
-<text text-anchor="middle" x="204.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sphere_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge17_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge17_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.47,-128.6C101.72,-112.63 118.03,-81.51 141.5,-64.62 142.87,-63.64 144.29,-62.71 145.75,-61.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.18,-65.03 154.55,-57.41 144.04,-58.77 147.18,-65.03"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c" target="_top" xlink:title="The volume of a triangular prism.">
-<polygon fill="white" stroke="#666666" points="256.88,-215.88 152.38,-215.88 152.38,-185.38 256.88,-185.38 256.88,-215.88"/>
-<text text-anchor="start" x="160.38" y="-202.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::triangle_prism</text>
-<text text-anchor="middle" x="204.62" y="-191.12" font-family="Helvetica,sans-Serif" font-size="10.00">_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node13 -->
-<g id="edge19_Node000002_Node000013" class="edge">
-<title>Node2&#45;&gt;Node13</title>
-<g id="a_edge19_Node000002_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.85,-148.65C111.85,-156.94 126.95,-168.61 141.5,-176.62 143.81,-177.9 146.2,-179.13 148.63,-180.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.92,-183.39 157.47,-184.37 149.83,-177.02 146.92,-183.39"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="351.62,-210.25 309.38,-210.25 309.38,-191 351.62,-191 351.62,-210.25"/>
-<text text-anchor="middle" x="330.5" y="-196.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M240.28,-167.73C249.27,-170.48 258.91,-173.56 267.75,-176.62 277.86,-180.13 288.77,-184.25 298.57,-188.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.06,-191.26 307.65,-191.68 299.64,-184.75 297.06,-191.26"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="357.25,-112.25 303.75,-112.25 303.75,-93 357.25,-93 357.25,-112.25"/>
-<text text-anchor="middle" x="330.5" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.93,-147.59C253.31,-145.3 260.85,-142.63 267.75,-139.62 280.91,-133.89 294.69,-125.86 305.88,-118.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.62,-121.78 314.08,-113.38 303.79,-115.92 307.62,-121.78"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M316.43,-210.54C310.01,-219.15 314.7,-228.25 330.5,-228.25 339.14,-228.25 344.46,-225.53 346.45,-221.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="349.94,-221.31 344.82,-212.03 343.04,-222.47 349.94,-221.31"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="447.5,-210.25 393.25,-210.25 393.25,-191 447.5,-191 447.5,-210.25"/>
-<text text-anchor="middle" x="420.38" y="-196.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M351.88,-200.62C360.72,-200.62 371.37,-200.62 381.57,-200.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="381.26,-204.13 391.26,-200.63 381.26,-197.13 381.26,-204.13"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge8_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge8_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.65,-91.3C267.81,-93.16 280.61,-95.13 292.07,-96.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.54,-100.34 301.95,-98.4 292.6,-93.42 291.54,-100.34"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge10_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge10_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M250.55,-130.67C256.54,-132.85 262.44,-135.48 267.75,-138.62 286.65,-149.82 303.91,-168.16 315.34,-181.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="312.37,-183.87 321.33,-189.52 317.85,-179.51 312.37,-183.87"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge11_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge11_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.13,-112.42C272.26,-110.94 282.6,-109.44 292.03,-108.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="292.53,-111.53 301.92,-106.63 291.52,-104.61 292.53,-111.53"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node4 -->
-<g id="edge14_Node000010_Node000004" class="edge">
-<title>Node10&#45;&gt;Node4</title>
-<g id="a_edge14_Node000010_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M250.55,-270.58C256.54,-268.4 262.44,-265.77 267.75,-262.62 286.65,-251.43 303.91,-233.09 315.34,-219.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.85,-221.74 321.33,-211.73 312.37,-217.38 317.85,-221.74"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node4 -->
-<g id="edge16_Node000011_Node000004" class="edge">
-<title>Node11&#45;&gt;Node4</title>
-<g id="a_edge16_Node000011_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M240.28,-233.52C249.27,-230.77 258.91,-227.69 267.75,-224.62 277.86,-221.12 288.77,-217 298.57,-213.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.64,-216.5 307.65,-209.57 297.06,-209.99 299.64,-216.5"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node6 -->
-<g id="edge18_Node000012_Node000006" class="edge">
-<title>Node12&#45;&gt;Node6</title>
-<g id="a_edge18_Node000012_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M246.29,-56.69C253.56,-58.97 260.97,-61.62 267.75,-64.62 281.14,-70.56 295.12,-78.95 306.38,-86.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.37,-89.2 314.61,-91.89 308.29,-83.4 304.37,-89.2"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node4 -->
-<g id="edge20_Node000013_Node000004" class="edge">
-<title>Node13&#45;&gt;Node4</title>
-<g id="a_edge20_Node000013_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M257.08,-200.62C270.74,-200.62 285.1,-200.62 297.4,-200.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.4,-204.13 307.4,-200.63 297.4,-197.13 297.4,-204.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 26dd50053..000000000
--- a/da/d39/volume_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,310 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="456pt" height="298pt"
- viewBox="0.00 0.00 455.50 298.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 294.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-148.25 0,-148.25 0,-129 37,-129 37,-148.25"/>
-<text text-anchor="middle" x="18.5" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-148.25 73,-148.25 73,-129 105.5,-129 105.5,-148.25"/>
-<text text-anchor="middle" x="89.25" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-138.62C44.58,-138.62 53.31,-138.62 61.45,-138.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-142.13 71.2,-138.63 61.2,-135.13 61.2,-142.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7" target="_top" xlink:title="The volume of a cone">
-<polygon fill="white" stroke="#666666" points="255.38,-167.25 153.88,-167.25 153.88,-148 255.38,-148 255.38,-167.25"/>
-<text text-anchor="middle" x="204.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cone_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.54,-141.19C115.32,-142.83 128.71,-145.07 142.45,-147.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.55,-150.77 151.99,-148.97 142.71,-143.87 141.55,-150.77"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725" target="_top" xlink:title="The volume of a cube">
-<polygon fill="white" stroke="#666666" points="255.38,-93.25 153.88,-93.25 153.88,-74 255.38,-74 255.38,-93.25"/>
-<text text-anchor="middle" x="204.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cube_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge7_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge7_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.72,-128.56C111.65,-120.3 126.7,-108.84 141.5,-101.62 144.43,-100.19 147.5,-98.86 150.64,-97.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.8,-100.91 160.02,-94.23 149.43,-94.32 151.8,-100.91"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca" target="_top" xlink:title="The volume of a cylinder">
-<polygon fill="white" stroke="#666666" points="261.75,-130.25 147.5,-130.25 147.5,-111 261.75,-111 261.75,-130.25"/>
-<text text-anchor="middle" x="204.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cylinder_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge9_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge9_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.54,-136.2C113.78,-134.89 124.6,-133.17 136.03,-131.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.29,-134.86 145.61,-129.84 135.19,-127.95 136.29,-134.86"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.38,-19.25 177.88,-19.25 177.88,0 231.38,0 231.38,-19.25"/>
-<text text-anchor="middle" x="204.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge12_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge12_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.98,-128.66C96.27,-106.96 109.47,-55.16 141.5,-27.62 148.5,-21.6 157.42,-17.59 166.3,-14.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.03,-18.35 175.91,-12.57 165.36,-11.55 167.03,-18.35"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c" target="_top" xlink:title="The volume of a pyramid">
-<polygon fill="white" stroke="#666666" points="262.12,-290.25 147.12,-290.25 147.12,-271 262.12,-271 262.12,-290.25"/>
-<text text-anchor="middle" x="204.62" y="-276.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::pyramid_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge13_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge13_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.45,-148.66C94.8,-172.18 106.45,-231.23 141.5,-262.62 142.27,-263.31 143.06,-263.98 143.88,-264.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.71,-267.39 152.05,-269.71 145.42,-261.45 141.71,-267.39"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12" target="_top" xlink:title="The volume of a rectangular prism.">
-<polygon fill="white" stroke="#666666" points="267.75,-253.25 141.5,-253.25 141.5,-234 267.75,-234 267.75,-253.25"/>
-<text text-anchor="middle" x="204.62" y="-239.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::rect_prism_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge15_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge15_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.43,-148.48C99.71,-166.35 115.38,-204.14 141.5,-224.62 143.23,-225.98 145.06,-227.24 146.96,-228.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.1,-231.4 155.59,-232.86 148.31,-225.17 145.1,-231.4"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551" target="_top" xlink:title="The volume of a sphere">
-<polygon fill="white" stroke="#666666" points="259.5,-56.25 149.75,-56.25 149.75,-37 259.5,-37 259.5,-56.25"/>
-<text text-anchor="middle" x="204.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sphere_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge17_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge17_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.47,-128.6C101.72,-112.63 118.03,-81.51 141.5,-64.62 142.87,-63.64 144.29,-62.71 145.75,-61.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.18,-65.03 154.55,-57.41 144.04,-58.77 147.18,-65.03"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c" target="_top" xlink:title="The volume of a triangular prism.">
-<polygon fill="white" stroke="#666666" points="256.88,-215.88 152.38,-215.88 152.38,-185.38 256.88,-185.38 256.88,-215.88"/>
-<text text-anchor="start" x="160.38" y="-202.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::triangle_prism</text>
-<text text-anchor="middle" x="204.62" y="-191.12" font-family="Helvetica,sans-Serif" font-size="10.00">_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node13 -->
-<g id="edge19_Node000002_Node000013" class="edge">
-<title>Node2&#45;&gt;Node13</title>
-<g id="a_edge19_Node000002_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.85,-148.65C111.85,-156.94 126.95,-168.61 141.5,-176.62 143.81,-177.9 146.2,-179.13 148.63,-180.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.92,-183.39 157.47,-184.37 149.83,-177.02 146.92,-183.39"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="351.62,-210.25 309.38,-210.25 309.38,-191 351.62,-191 351.62,-210.25"/>
-<text text-anchor="middle" x="330.5" y="-196.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M240.28,-167.73C249.27,-170.48 258.91,-173.56 267.75,-176.62 277.86,-180.13 288.77,-184.25 298.57,-188.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.06,-191.26 307.65,-191.68 299.64,-184.75 297.06,-191.26"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="357.25,-112.25 303.75,-112.25 303.75,-93 357.25,-93 357.25,-112.25"/>
-<text text-anchor="middle" x="330.5" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.93,-147.59C253.31,-145.3 260.85,-142.63 267.75,-139.62 280.91,-133.89 294.69,-125.86 305.88,-118.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.62,-121.78 314.08,-113.38 303.79,-115.92 307.62,-121.78"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M316.43,-210.54C310.01,-219.15 314.7,-228.25 330.5,-228.25 339.14,-228.25 344.46,-225.53 346.45,-221.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="349.94,-221.31 344.82,-212.03 343.04,-222.47 349.94,-221.31"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="447.5,-210.25 393.25,-210.25 393.25,-191 447.5,-191 447.5,-210.25"/>
-<text text-anchor="middle" x="420.38" y="-196.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M351.88,-200.62C360.72,-200.62 371.37,-200.62 381.57,-200.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="381.26,-204.13 391.26,-200.63 381.26,-197.13 381.26,-204.13"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge8_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge8_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.65,-91.3C267.81,-93.16 280.61,-95.13 292.07,-96.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.54,-100.34 301.95,-98.4 292.6,-93.42 291.54,-100.34"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge10_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge10_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M250.55,-130.67C256.54,-132.85 262.44,-135.48 267.75,-138.62 286.65,-149.82 303.91,-168.16 315.34,-181.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="312.37,-183.87 321.33,-189.52 317.85,-179.51 312.37,-183.87"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge11_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge11_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.13,-112.42C272.26,-110.94 282.6,-109.44 292.03,-108.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="292.53,-111.53 301.92,-106.63 291.52,-104.61 292.53,-111.53"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node4 -->
-<g id="edge14_Node000010_Node000004" class="edge">
-<title>Node10&#45;&gt;Node4</title>
-<g id="a_edge14_Node000010_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M250.55,-270.58C256.54,-268.4 262.44,-265.77 267.75,-262.62 286.65,-251.43 303.91,-233.09 315.34,-219.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.85,-221.74 321.33,-211.73 312.37,-217.38 317.85,-221.74"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node4 -->
-<g id="edge16_Node000011_Node000004" class="edge">
-<title>Node11&#45;&gt;Node4</title>
-<g id="a_edge16_Node000011_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M240.28,-233.52C249.27,-230.77 258.91,-227.69 267.75,-224.62 277.86,-221.12 288.77,-217 298.57,-213.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.64,-216.5 307.65,-209.57 297.06,-209.99 299.64,-216.5"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node6 -->
-<g id="edge18_Node000012_Node000006" class="edge">
-<title>Node12&#45;&gt;Node6</title>
-<g id="a_edge18_Node000012_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M246.29,-56.69C253.56,-58.97 260.97,-61.62 267.75,-64.62 281.14,-70.56 295.12,-78.95 306.38,-86.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.37,-89.2 314.61,-91.89 308.29,-83.4 304.37,-89.2"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node4 -->
-<g id="edge20_Node000013_Node000004" class="edge">
-<title>Node13&#45;&gt;Node4</title>
-<g id="a_edge20_Node000013_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M257.08,-200.62C270.74,-200.62 285.1,-200.62 297.4,-200.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.4,-204.13 307.4,-200.63 297.4,-197.13 297.4,-204.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d39/volume_8cpp_source.html b/da/d39/volume_8cpp_source.html
new file mode 100644
index 000000000..6c1221c07
--- /dev/null
+++ b/da/d39/volume_8cpp_source.html
@@ -0,0 +1,332 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/volume.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/d39/volume_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">volume.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/d39/volume_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cmath&gt;</span>     </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cstdint&gt;</span>   </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00028" data-start="{" data-end="}">
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725">   28</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725">cube_volume</a>(T length) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordflow">return</span> std::pow(length, 3);</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>}</div>
+</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00041" data-start="{" data-end="}">
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12">   41</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12">rect_prism_volume</a>(T length, T width, T <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">return</span> length * width * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>}</div>
+</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00053" data-start="{" data-end="}">
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7">   53</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7">cone_volume</a>(T radius, T <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>, <span class="keywordtype">double</span> PI = 3.14) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">return</span> std::pow(radius, 2) * PI * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> / 3;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>}</div>
+</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00067" data-start="{" data-end="}">
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c">   67</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c">triangle_prism_volume</a>(T base, T <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>, T depth) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keywordflow">return</span> base * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> * depth / 2;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>}</div>
+</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00080" data-start="{" data-end="}">
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c">   80</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c">pyramid_volume</a>(T length, T width, T <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keywordflow">return</span> length * width * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> / 3;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>}</div>
+</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00091" data-start="{" data-end="}">
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551">   91</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551">sphere_volume</a>(T radius, <span class="keywordtype">double</span> PI = 3.14) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keywordflow">return</span> PI * std::pow(radius, 3) * 4 / 3;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>}</div>
+</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00103" data-start="{" data-end="}">
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca">  103</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca">cylinder_volume</a>(T radius, T <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>, <span class="keywordtype">double</span> PI = 3.14) {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="keywordflow">return</span> PI * std::pow(radius, 2) * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>}</div>
+</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="foldopen" id="foldopen00112" data-start="{" data-end="}">
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"><a class="line" href="../../da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  112</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="comment">// Input variables</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    uint32_t int_length = 0; <span class="comment">// 32 bit integer length input</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    uint32_t int_width = 0;  <span class="comment">// 32 bit integer width input</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    uint32_t int_base = 0;   <span class="comment">// 32 bit integer base input</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    uint32_t int_height = 0; <span class="comment">// 32 bit integer height input</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    uint32_t int_depth = 0;  <span class="comment">// 32 bit integer depth input</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <span class="keywordtype">double</span> double_radius = NAN; <span class="comment">// double radius input</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="keywordtype">double</span> double_height = NAN; <span class="comment">// double height input</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span> </div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    <span class="comment">// Output variables</span></div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    uint32_t int_expected = 0; <span class="comment">// 32 bit integer expected output</span></div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    uint32_t int_volume = 0;   <span class="comment">// 32 bit integer output</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    <span class="keywordtype">double</span> double_expected = NAN; <span class="comment">// double expected output</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    <span class="keywordtype">double</span> double_volume = NAN;   <span class="comment">// double output</span></div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="comment">// 1st test</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    int_length = 5;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    int_expected = 125;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    int_volume = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725">math::cube_volume</a>(int_length);</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A CUBE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_volume &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    assert(int_volume == int_expected);</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    <span class="comment">// 2nd test</span></div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    int_length = 4;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    int_width = 3;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    int_height = 5;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    int_expected = 60;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    int_volume = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12">math::rect_prism_volume</a>(int_length, int_width, int_height);</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span> </div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A RECTANGULAR PRISM&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Width: &quot;</span> &lt;&lt; int_width &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_volume &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    assert(int_volume == int_expected);</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span> </div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    <span class="comment">// 3rd test</span></div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    double_radius = 5;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    double_height = 7;</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    double_expected = 183.16666666666666;  <span class="comment">// truncated to 14 decimal places</span></div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    double_volume = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7">math::cone_volume</a>(double_radius, double_height);</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span> </div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A CONE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; double_height &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_volume &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    assert(double_volume == double_expected);</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span> </div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <span class="comment">// 4th test</span></div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    int_base = 3;</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    int_height = 4;</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    int_depth = 5;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    int_expected = 30;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    int_volume = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c">math::triangle_prism_volume</a>(int_base, int_height, int_depth);</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A TRIANGULAR PRISM&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Base: &quot;</span> &lt;&lt; int_base &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Depth: &quot;</span> &lt;&lt; int_depth &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_volume &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    assert(int_volume == int_expected);</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span> </div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    <span class="comment">// 5th test</span></div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    int_length = 10;</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    int_width = 3;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    int_height = 5;</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    int_expected = 50;</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    int_volume = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c">math::pyramid_volume</a>(int_length, int_width, int_height);</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span> </div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A PYRAMID&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Width: &quot;</span> &lt;&lt; int_width &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_volume &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    assert(int_volume == int_expected);</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span> </div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    <span class="comment">// 6th test</span></div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    double_radius = 3;</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    double_expected = 113.04;</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    double_volume = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551">math::sphere_volume</a>(double_radius);</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span> </div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A SPHERE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_volume &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    assert(double_volume == double_expected);</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span> </div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    <span class="comment">// 7th test</span></div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    double_radius = 5;</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    double_height = 2;</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    double_expected = 157;</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    double_volume = <a class="code hl_function" href="../../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca">math::cylinder_volume</a>(double_radius, double_height);</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span> </div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;VOLUME OF A CYLINDER&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; double_height &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_volume &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    assert(double_volume == double_expected);</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>}</div>
+</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span> </div>
+<div class="foldopen" id="foldopen00235" data-start="{" data-end="}">
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"><a class="line" href="../../da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  235</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    <a class="code hl_function" href="../../da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>}</div>
+</div>
+<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00038">avltree.cpp:38</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_a2d704a7b72a6b2db8b76c8581b577b2c"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c">math::triangle_prism_volume</a></div><div class="ttdeci">T triangle_prism_volume(T base, T height, T depth)</div><div class="ttdoc">The volume of a triangular prism.</div><div class="ttdef"><b>Definition</b> <a href="#l00067">volume.cpp:67</a></div></div>
+<div class="ttc" id="anamespacemath_html_a34d66a77c19ce9b8b3a3d14352b34551"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551">math::sphere_volume</a></div><div class="ttdeci">T sphere_volume(T radius, double PI=3.14)</div><div class="ttdoc">The volume of a sphere</div><div class="ttdef"><b>Definition</b> <a href="#l00091">volume.cpp:91</a></div></div>
+<div class="ttc" id="anamespacemath_html_a3fdc74c24697ec5bb5c3698c96117c12"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12">math::rect_prism_volume</a></div><div class="ttdeci">T rect_prism_volume(T length, T width, T height)</div><div class="ttdoc">The volume of a rectangular prism.</div><div class="ttdef"><b>Definition</b> <a href="#l00041">volume.cpp:41</a></div></div>
+<div class="ttc" id="anamespacemath_html_a3fe35440c27758ecc2287e08217d63a7"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7">math::cone_volume</a></div><div class="ttdeci">T cone_volume(T radius, T height, double PI=3.14)</div><div class="ttdoc">The volume of a cone</div><div class="ttdef"><b>Definition</b> <a href="#l00053">volume.cpp:53</a></div></div>
+<div class="ttc" id="anamespacemath_html_a94db02b3c9e55a69ac1696f30e2f761c"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c">math::pyramid_volume</a></div><div class="ttdeci">T pyramid_volume(T length, T width, T height)</div><div class="ttdoc">The volume of a pyramid</div><div class="ttdef"><b>Definition</b> <a href="#l00080">volume.cpp:80</a></div></div>
+<div class="ttc" id="anamespacemath_html_abde24398be43538c62e4a496968e60ca"><div class="ttname"><a href="../../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca">math::cylinder_volume</a></div><div class="ttdeci">T cylinder_volume(T radius, T height, double PI=3.14)</div><div class="ttdoc">The volume of a cylinder</div><div class="ttdef"><b>Definition</b> <a href="#l00103">volume.cpp:103</a></div></div>
+<div class="ttc" id="anamespacemath_html_ae413098478fa38acaac887b7654f0725"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725">math::cube_volume</a></div><div class="ttdeci">T cube_volume(T length)</div><div class="ttdoc">The volume of a cube</div><div class="ttdef"><b>Definition</b> <a href="#l00028">volume.cpp:28</a></div></div>
+<div class="ttc" id="avolume_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../da/d39/volume_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> <a href="#l00112">volume.cpp:112</a></div></div>
+<div class="ttc" id="avolume_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00235">volume.cpp:235</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../da/d39/volume_8cpp.html">volume.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/d41/uint128__t_8hpp.html b/da/d41/uint128__t_8hpp.html
index 4be03fba3..5e1a6e0e3 100644
--- a/da/d41/uint128__t_8hpp.html
+++ b/da/d41/uint128__t_8hpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ciphers/uint128_t.hpp File Reference</title>
+<title>TheAlgorithms/C++: ciphers/uint128_t.hpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -144,12 +161,12 @@ Classes</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="define-members" name="define-members"></a>
 Macros</h2></td></tr>
 <tr class="memitem:acce684d03a24f9c13a9ed36de6d24a57" id="r_acce684d03a24f9c13a9ed36de6d24a57"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acce684d03a24f9c13a9ed36de6d24a57">CIPHERS_UINT128_T_HPP_</a></td></tr>
-<tr class="memdesc:acce684d03a24f9c13a9ed36de6d24a57"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a></code> and other operations  <br /></td></tr>
+<tr class="memdesc:acce684d03a24f9c13a9ed36de6d24a57"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <code>std::reverse</code> and other operations  <br /></td></tr>
 <tr class="separator:acce684d03a24f9c13a9ed36de6d24a57"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a3ff77262ffd6743df5b808d41382a6f3" id="r_a3ff77262ffd6743df5b808d41382a6f3"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3ff77262ffd6743df5b808d41382a6f3">add</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;first, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;second)</td></tr>
+<tr class="memitem:a3ff77262ffd6743df5b808d41382a6f3" id="r_a3ff77262ffd6743df5b808d41382a6f3"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3ff77262ffd6743df5b808d41382a6f3">add</a> (const std::string &amp;first, const std::string &amp;second)</td></tr>
 <tr class="memdesc:a3ff77262ffd6743df5b808d41382a6f3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Adding two string.  <br /></td></tr>
 <tr class="separator:a3ff77262ffd6743df5b808d41382a6f3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aaaf018bfb929bea8e60320cfad566a04" id="r_aaaf018bfb929bea8e60320cfad566a04"><td class="memTemplParams" colspan="2">template&lt;typename T , typename  = typename std::enable_if&lt;                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt; </td></tr>
@@ -204,6 +221,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of 128-bit unsigned integers. </p><dl class="section note"><dt>Note</dt><dd>The implementation can be flagged as not completed. This header is used with enough operations as a part of bigger integer types 256-bit integer. </dd></dl>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AshishYUO" target="_blank">Ashish Daulatabad</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 </div><h2 class="groupheader">Macro Definition Documentation</h2>
 <a id="acce684d03a24f9c13a9ed36de6d24a57" name="acce684d03a24f9c13a9ed36de6d24a57"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#acce684d03a24f9c13a9ed36de6d24a57">&#9670;&#160;</a></span>CIPHERS_UINT128_T_HPP_</h2>
@@ -217,8 +236,10 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 
-<p>for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a></code> and other operations </p>
-<p>for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></code> overload for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></code> for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></code> library </p>
+<p>for <code>std::reverse</code> and other operations </p>
+<p>for <code>std::cout</code> overload for <code>std::string</code> for <code>std::pair</code> library </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00021">21</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 
 </div>
 </div>
@@ -230,14 +251,14 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> add </td>
+          <td class="memname">std::string add </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>first</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>first</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>second</em></span>&#160;)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>second</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -251,37 +272,28 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>string denoting the addition of both the strings </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00038">38</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   38</span>                                                               {</div>
-<div class="line"><span class="lineno">   39</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> third;</div>
+<div class="line"><span class="lineno">   39</span>    std::string third;</div>
 <div class="line"><span class="lineno">   40</span>    int16_t <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> = 0, carry = 0;</div>
-<div class="line"><span class="lineno">   41</span>    <span class="keywordflow">for</span> (int32_t i = <span class="keyword">static_cast&lt;</span>int32_t<span class="keyword">&gt;</span>(first.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) - 1,</div>
-<div class="line"><span class="lineno">   42</span>                 j = <span class="keyword">static_cast&lt;</span>int32_t<span class="keyword">&gt;</span>(second.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) - 1;</div>
+<div class="line"><span class="lineno">   41</span>    <span class="keywordflow">for</span> (int32_t i = <span class="keyword">static_cast&lt;</span>int32_t<span class="keyword">&gt;</span>(first.size()) - 1,</div>
+<div class="line"><span class="lineno">   42</span>                 j = <span class="keyword">static_cast&lt;</span>int32_t<span class="keyword">&gt;</span>(second.size()) - 1;</div>
 <div class="line"><span class="lineno">   43</span>         i &gt;= 0 || j &gt;= 0; --i, --j) {</div>
 <div class="line"><span class="lineno">   44</span>        <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> = ((i &gt;= 0 ? first[i] - <span class="charliteral">&#39;0&#39;</span> : 0) + (j &gt;= 0 ? second[j] - <span class="charliteral">&#39;0&#39;</span> : 0) +</div>
 <div class="line"><span class="lineno">   45</span>               carry);</div>
 <div class="line"><span class="lineno">   46</span>        carry = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> / 10;</div>
 <div class="line"><span class="lineno">   47</span>        <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> %= 10;</div>
-<div class="line"><span class="lineno">   48</span>        third.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/push_back.html">push_back</a>(sum + <span class="charliteral">&#39;0&#39;</span>);</div>
+<div class="line"><span class="lineno">   48</span>        third.push_back(sum + <span class="charliteral">&#39;0&#39;</span>);</div>
 <div class="line"><span class="lineno">   49</span>    }</div>
 <div class="line"><span class="lineno">   50</span>    <span class="keywordflow">if</span> (carry) {</div>
-<div class="line"><span class="lineno">   51</span>        third.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/push_back.html">push_back</a>(<span class="charliteral">&#39;1&#39;</span>);</div>
+<div class="line"><span class="lineno">   51</span>        third.push_back(<span class="charliteral">&#39;1&#39;</span>);</div>
 <div class="line"><span class="lineno">   52</span>    }</div>
-<div class="line"><span class="lineno">   53</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a>(third.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">begin</a>(), third.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">end</a>());</div>
+<div class="line"><span class="lineno">   53</span>    std::reverse(third.begin(), third.end());</div>
 <div class="line"><span class="lineno">   54</span>    <span class="keywordflow">return</span> third;</div>
 <div class="line"><span class="lineno">   55</span>}</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">std::string::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">std::string::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div 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&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:232</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/push_back.html">std::string::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="areverse_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a></div><div class="ttdeci">T reverse(T... args)</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d41/uint128__t_8hpp_a3ff77262ffd6743df5b808d41382a6f3_cgraph.svg" width="252" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00232">vector_ops.hpp:232</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a78df90238f0ea15d5c6f813873b85464" name="a78df90238f0ea15d5c6f813873b85464"></a>
@@ -312,10 +324,12 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l01079">1079</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1079</span>                                                      {</div>
 <div class="line"><span class="lineno"> 1080</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) != q;</div>
 <div class="line"><span class="lineno"> 1081</span>}</div>
-<div class="ttc" id="aclassuint128__t_html"><div class="ttname"><a href="../../db/d9a/classuint128__t.html">uint128_t</a></div><div class="ttdoc">class for 128-bit unsigned integer</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:60</div></div>
+<div class="ttc" id="aclassuint128__t_html"><div class="ttname"><a href="../../db/d9a/classuint128__t.html">uint128_t</a></div><div class="ttdoc">class for 128-bit unsigned integer</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00060">uint128_t.hpp:60</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -347,6 +361,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l01034">1034</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1034</span>                                                          {</div>
 <div class="line"><span class="lineno"> 1035</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) % q;</div>
 <div class="line"><span class="lineno"> 1036</span>}</div>
@@ -381,6 +397,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l01041">1041</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1041</span>                                                           {</div>
 <div class="line"><span class="lineno"> 1042</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) &amp; q;</div>
 <div class="line"><span class="lineno"> 1043</span>}</div>
@@ -415,6 +433,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l01060">1060</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1060</span>                                                      {</div>
 <div class="line"><span class="lineno"> 1061</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) &amp;&amp; q;</div>
 <div class="line"><span class="lineno"> 1062</span>}</div>
@@ -449,6 +469,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l01022">1022</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1022</span>                                                          {</div>
 <div class="line"><span class="lineno"> 1023</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) * q;</div>
 <div class="line"><span class="lineno"> 1024</span>}</div>
@@ -483,6 +505,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l01010">1010</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1010</span>                                                           {</div>
 <div class="line"><span class="lineno"> 1011</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) + q;</div>
 <div class="line"><span class="lineno"> 1012</span>}</div>
@@ -517,6 +541,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l01016">1016</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1016</span>                                                          {</div>
 <div class="line"><span class="lineno"> 1017</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) - q;</div>
 <div class="line"><span class="lineno"> 1018</span>}</div>
@@ -551,6 +577,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l01028">1028</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1028</span>                                                          {</div>
 <div class="line"><span class="lineno"> 1029</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) / q;</div>
 <div class="line"><span class="lineno"> 1030</span>}</div>
@@ -585,6 +613,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l01085">1085</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1085</span>                                                     {</div>
 <div class="line"><span class="lineno"> 1086</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) &lt; q;</div>
 <div class="line"><span class="lineno"> 1087</span>}</div>
@@ -619,6 +649,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l01091">1091</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1091</span>                                                      {</div>
 <div class="line"><span class="lineno"> 1092</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) &lt;= q;</div>
 <div class="line"><span class="lineno"> 1093</span>}</div>
@@ -653,6 +685,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l01073">1073</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1073</span>                                                      {</div>
 <div class="line"><span class="lineno"> 1074</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) == q;</div>
 <div class="line"><span class="lineno"> 1075</span>}</div>
@@ -687,6 +721,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l01097">1097</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1097</span>                                                     {</div>
 <div class="line"><span class="lineno"> 1098</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) &gt; q;</div>
 <div class="line"><span class="lineno"> 1099</span>}</div>
@@ -721,6 +757,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l01103">1103</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1103</span>                                                      {</div>
 <div class="line"><span class="lineno"> 1104</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) &gt;= q;</div>
 <div class="line"><span class="lineno"> 1105</span>}</div>
@@ -755,6 +793,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l01053">1053</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1053</span>                                                          {</div>
 <div class="line"><span class="lineno"> 1054</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) ^ q;</div>
 <div class="line"><span class="lineno"> 1055</span>}</div>
@@ -789,6 +829,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l01047">1047</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1047</span>                                                          {</div>
 <div class="line"><span class="lineno"> 1048</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) | q;</div>
 <div class="line"><span class="lineno"> 1049</span>}</div>
@@ -823,6 +865,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l01066">1066</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1066</span>                                                      {</div>
 <div class="line"><span class="lineno"> 1067</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) || q;</div>
 <div class="line"><span class="lineno"> 1068</span>}</div>
diff --git a/da/d41/uint128__t_8hpp_a3ff77262ffd6743df5b808d41382a6f3_cgraph.map b/da/d41/uint128__t_8hpp_a3ff77262ffd6743df5b808d41382a6f3_cgraph.map
deleted file mode 100644
index 3e355ba96..000000000
--- a/da/d41/uint128__t_8hpp_a3ff77262ffd6743df5b808d41382a6f3_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="add" name="add">
-<area shape="rect" id="Node000001" title="Adding two string." alt="" coords="5,104,48,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/begin.html#" title=" " alt="" coords="112,5,230,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="34,102,59,71,94,40,102,35,105,40,97,44,63,75,38,106"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/end.html#" title=" " alt="" coords="117,55,225,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="47,107,95,89,112,83,114,88,97,94,49,112"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/push_back.html#" title=" " alt="" coords="96,104,246,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="48,114,81,114,81,120,48,120"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/reverse.html#" title=" " alt="" coords="126,153,216,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="49,122,97,140,114,146,112,151,95,145,47,127"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="115,203,226,228"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="38,128,63,159,97,189,105,194,102,198,94,194,59,163,34,131"/>
-</map>
diff --git a/da/d41/uint128__t_8hpp_a3ff77262ffd6743df5b808d41382a6f3_cgraph.md5 b/da/d41/uint128__t_8hpp_a3ff77262ffd6743df5b808d41382a6f3_cgraph.md5
deleted file mode 100644
index 051eda6f3..000000000
--- a/da/d41/uint128__t_8hpp_a3ff77262ffd6743df5b808d41382a6f3_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6ada718eb7b3ebc6ce96449c7f4694a3
\ No newline at end of file
diff --git a/da/d41/uint128__t_8hpp_a3ff77262ffd6743df5b808d41382a6f3_cgraph.svg b/da/d41/uint128__t_8hpp_a3ff77262ffd6743df5b808d41382a6f3_cgraph.svg
deleted file mode 100644
index 90bf52e1b..000000000
--- a/da/d41/uint128__t_8hpp_a3ff77262ffd6743df5b808d41382a6f3_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: add Pages: 1 -->
-<svg width="189pt" height="175pt"
- viewBox="0.00 0.00 188.50 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>add</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Adding two string.">
-<polygon fill="#999999" stroke="#666666" points="31.75,-93.25 0,-93.25 0,-74 31.75,-74 31.75,-93.25"/>
-<text text-anchor="middle" x="15.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">add</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="168.5,-167.25 79.75,-167.25 79.75,-148 168.5,-148 168.5,-167.25"/>
-<text text-anchor="middle" x="124.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.28,-93.36C31.95,-105.81 48.56,-127.22 67.75,-139.62 69.56,-140.8 71.46,-141.9 73.42,-142.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.61,-145.96 82.16,-146.94 74.53,-139.6 71.61,-145.96"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164.75,-130.25 83.5,-130.25 83.5,-111 164.75,-111 164.75,-130.25"/>
-<text text-anchor="middle" x="124.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.95,-89.45C42.04,-93.3 55.64,-98.4 67.75,-102.62 71.93,-104.08 76.29,-105.57 80.66,-107.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.39,-110.29 89.98,-110.1 81.58,-103.65 79.39,-110.29"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="180.5,-93.25 67.75,-93.25 67.75,-74 180.5,-74 180.5,-93.25"/>
-<text text-anchor="middle" x="124.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.1,-83.62C38.87,-83.62 47.36,-83.62 56.41,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.14,-87.13 66.14,-83.63 56.14,-80.13 56.14,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158,-56.25 90.25,-56.25 90.25,-37 158,-37 158,-56.25"/>
-<text text-anchor="middle" x="124.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.95,-77.8C42.04,-73.95 55.64,-68.85 67.75,-64.62 71.93,-63.17 76.29,-61.68 80.66,-60.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.58,-63.6 89.98,-57.15 79.39,-56.96 81.58,-63.6"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.88,-19.25 82.38,-19.25 82.38,0 165.88,0 165.88,-19.25"/>
-<text text-anchor="middle" x="124.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.28,-73.89C31.95,-61.44 48.56,-40.03 67.75,-27.62 69.56,-26.45 71.46,-25.35 73.42,-24.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.53,-27.65 82.16,-20.31 71.61,-21.29 74.53,-27.65"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d41/uint128__t_8hpp_a3ff77262ffd6743df5b808d41382a6f3_cgraph_org.svg b/da/d41/uint128__t_8hpp_a3ff77262ffd6743df5b808d41382a6f3_cgraph_org.svg
deleted file mode 100644
index 7cfe1abce..000000000
--- a/da/d41/uint128__t_8hpp_a3ff77262ffd6743df5b808d41382a6f3_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: add Pages: 1 -->
-<svg width="189pt" height="175pt"
- viewBox="0.00 0.00 188.50 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>add</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Adding two string.">
-<polygon fill="#999999" stroke="#666666" points="31.75,-93.25 0,-93.25 0,-74 31.75,-74 31.75,-93.25"/>
-<text text-anchor="middle" x="15.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">add</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="168.5,-167.25 79.75,-167.25 79.75,-148 168.5,-148 168.5,-167.25"/>
-<text text-anchor="middle" x="124.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.28,-93.36C31.95,-105.81 48.56,-127.22 67.75,-139.62 69.56,-140.8 71.46,-141.9 73.42,-142.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.61,-145.96 82.16,-146.94 74.53,-139.6 71.61,-145.96"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164.75,-130.25 83.5,-130.25 83.5,-111 164.75,-111 164.75,-130.25"/>
-<text text-anchor="middle" x="124.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.95,-89.45C42.04,-93.3 55.64,-98.4 67.75,-102.62 71.93,-104.08 76.29,-105.57 80.66,-107.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.39,-110.29 89.98,-110.1 81.58,-103.65 79.39,-110.29"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="180.5,-93.25 67.75,-93.25 67.75,-74 180.5,-74 180.5,-93.25"/>
-<text text-anchor="middle" x="124.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.1,-83.62C38.87,-83.62 47.36,-83.62 56.41,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.14,-87.13 66.14,-83.63 56.14,-80.13 56.14,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158,-56.25 90.25,-56.25 90.25,-37 158,-37 158,-56.25"/>
-<text text-anchor="middle" x="124.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.95,-77.8C42.04,-73.95 55.64,-68.85 67.75,-64.62 71.93,-63.17 76.29,-61.68 80.66,-60.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.58,-63.6 89.98,-57.15 79.39,-56.96 81.58,-63.6"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.88,-19.25 82.38,-19.25 82.38,0 165.88,0 165.88,-19.25"/>
-<text text-anchor="middle" x="124.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.28,-73.89C31.95,-61.44 48.56,-40.03 67.75,-27.62 69.56,-26.45 71.46,-25.35 73.42,-24.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.53,-27.65 82.16,-20.31 71.61,-21.29 74.53,-27.65"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d41/uint128__t_8hpp_source.html b/da/d41/uint128__t_8hpp_source.html
index 92f4e0686..bec3b034f 100644
--- a/da/d41/uint128__t_8hpp_source.html
+++ b/da/d41/uint128__t_8hpp_source.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ciphers/uint128_t.hpp Source File</title>
+<title>TheAlgorithms/C++: ciphers/uint128_t.hpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -107,23 +124,15 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
   <div class="headertitle"><div class="title">uint128_t.hpp</div></div>
 </div><!--header-->
 <div class="contents">
-<a href="../../da/d41/uint128__t_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * @file</span></div>
-<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> *</span></div>
-<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * @details Implementation of 128-bit unsigned integers.</span></div>
-<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * @note The implementation can be flagged as not completed. This header is used</span></div>
-<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> * with enough operations as a part of bigger integer types 256-bit integer.</span></div>
-<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> * @author [Ashish Daulatabad](https://github.com/AshishYUO)</span></div>
-<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> */</span></div>
-<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
-<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  <span class="comment">/// for `std::reverse` and other operations</span></div>
+<a href="../../da/d41/uint128__t_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
 <div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
-<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;ostream&gt;</span>    <span class="comment">/// for `std::cout` overload</span></div>
-<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;string&gt;</span>     <span class="comment">/// for `std::string`</span></div>
-<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;utility&gt;</span>    <span class="comment">/// for `std::pair` library</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;ostream&gt;</span>    </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;string&gt;</span>     </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;utility&gt;</span>    </div>
 <div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
 <div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#ifdef _MSC_VER</span></div>
-<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;intrin.h&gt;</span>  <span class="comment">/// for _BitScanForward64 and __BitScanReverse64 operation</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;intrin.h&gt;</span>  </div>
 <div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#endif</span></div>
 <div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
 <div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#ifndef CIPHERS_UINT128_T_HPP_</span></div>
@@ -131,59 +140,41 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="keyword">class </span><a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>;</div>
 <div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
 <div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">template</span> &lt;&gt;</div>
-<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"><a class="line" href="../../d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html">   25</a></span><span class="keyword">struct </span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral</a>&lt;<a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>&gt; : <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a> {};</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"><a class="line" href="../../d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html">   25</a></span><span class="keyword">struct </span>std::is_integral&lt;<a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>&gt; : std::true_type {};</div>
 <div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">template</span> &lt;&gt;</div>
-<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html">   27</a></span><span class="keyword">struct </span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_arithmetic.html">std::is_arithmetic</a>&lt;<a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>&gt; : <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a> {};</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html">   27</a></span><span class="keyword">struct </span>std::is_arithmetic&lt;<a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>&gt; : std::true_type {};</div>
 <div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">template</span> &lt;&gt;</div>
-<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html">   29</a></span><span class="keyword">struct </span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_unsigned.html">std::is_unsigned</a>&lt;<a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>&gt; : <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a> {};</div>
-<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment"></span> </div>
-<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="comment"> * @brief Adding two string</span></div>
-<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="comment"> * @details Adds two long integer, only used for printing numbers</span></div>
-<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="comment"> * @param first First integer string</span></div>
-<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="comment"> * @param second Second integer string</span></div>
-<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="comment"> * @returns string denoting the addition of both the strings</span></div>
-<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html">   29</a></span><span class="keyword">struct </span>std::is_unsigned&lt;<a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>&gt; : std::true_type {};</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
 <div class="foldopen" id="foldopen00038" data-start="{" data-end="}">
-<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">   38</a></span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> <a class="code hl_function" href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;first, <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;second) {</div>
-<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> third;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">   38</a></span>std::string <a class="code hl_function" href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a>(<span class="keyword">const</span> std::string &amp;first, <span class="keyword">const</span> std::string &amp;second) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    std::string third;</div>
 <div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    int16_t sum = 0, carry = 0;</div>
-<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">for</span> (int32_t i = <span class="keyword">static_cast&lt;</span>int32_t<span class="keyword">&gt;</span>(first.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) - 1,</div>
-<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>                 j = <span class="keyword">static_cast&lt;</span>int32_t<span class="keyword">&gt;</span>(second.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) - 1;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">for</span> (int32_t i = <span class="keyword">static_cast&lt;</span>int32_t<span class="keyword">&gt;</span>(first.size()) - 1,</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>                 j = <span class="keyword">static_cast&lt;</span>int32_t<span class="keyword">&gt;</span>(second.size()) - 1;</div>
 <div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>         i &gt;= 0 || j &gt;= 0; --i, --j) {</div>
 <div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        sum = ((i &gt;= 0 ? first[i] - <span class="charliteral">&#39;0&#39;</span> : 0) + (j &gt;= 0 ? second[j] - <span class="charliteral">&#39;0&#39;</span> : 0) +</div>
 <div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>               carry);</div>
 <div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        carry = sum / 10;</div>
 <div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        sum %= 10;</div>
-<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        third.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/push_back.html">push_back</a>(sum + <span class="charliteral">&#39;0&#39;</span>);</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        third.push_back(sum + <span class="charliteral">&#39;0&#39;</span>);</div>
 <div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    }</div>
 <div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordflow">if</span> (carry) {</div>
-<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        third.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/push_back.html">push_back</a>(<span class="charliteral">&#39;1&#39;</span>);</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        third.push_back(<span class="charliteral">&#39;1&#39;</span>);</div>
 <div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    }</div>
-<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a>(third.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">begin</a>(), third.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">end</a>());</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    std::reverse(third.begin(), third.end());</div>
 <div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">return</span> third;</div>
-<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>}<span class="comment"></span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>}</div>
 </div>
-<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="comment"> * @class uint128_t</span></div>
-<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="comment"> * @brief class for 128-bit unsigned integer</span></div>
-<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="comment"> */</span></div>
 <div class="foldopen" id="foldopen00060" data-start="{" data-end="};">
 <div class="line"><a id="l00060" name="l00060"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html">   60</a></span><span class="keyword">class </span><a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> {</div>
-<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    uint64_t f{}, s{};  <span class="comment">/// First and second half of 128 bit number</span></div>
-<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="comment"></span> </div>
-<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span><span class="comment">     * @brief Get integer from given string.</span></div>
-<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span><span class="comment">     * @details Create an integer from a given string</span></div>
-<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="comment">     * @param str integer string, can be hexadecimal (starting on 0x... or</span></div>
-<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="comment">     * number)</span></div>
-<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span><span class="comment">     * @returns void</span></div>
-<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    uint64_t f{}, s{};  </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
 <div class="foldopen" id="foldopen00070" data-start="{" data-end="}">
-<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df">   70</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df">__get_integer_from_string</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df">   70</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df">__get_integer_from_string</a>(<span class="keyword">const</span> std::string &amp;str) {</div>
 <div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        this-&gt;f = this-&gt;s = 0;</div>
-<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        <span class="keywordflow">if</span> (str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() &gt; 1 &amp;&amp; str[1] == <span class="charliteral">&#39;x&#39;</span>) {  <span class="comment">// if hexadecimal</span></div>
-<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 2; i &lt; str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>(); ++i) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        <span class="keywordflow">if</span> (str.size() &gt; 1 &amp;&amp; str[1] == <span class="charliteral">&#39;x&#39;</span>) {  <span class="comment">// if hexadecimal</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 2; i &lt; str.size(); ++i) {</div>
 <div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>                *<span class="keyword">this</span> *= 16LL;</div>
 <div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>                <span class="keywordflow">if</span> (str[i] &gt;= <span class="charliteral">&#39;0&#39;</span> &amp;&amp; str[i] &lt;= <span class="charliteral">&#39;9&#39;</span>) {</div>
 <div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>                    *<span class="keyword">this</span> += (str[i] - <span class="charliteral">&#39;0&#39;</span>);</div>
@@ -204,55 +195,25 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
 <div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> <span class="keyword">public</span>:</div>
 <div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>() = <span class="keywordflow">default</span>;</div>
-<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span><span class="comment"></span> </div>
-<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span><span class="comment">     * @brief Parameterized constructor</span></div>
-<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span><span class="comment">     * @param low lower part 8-bit unisgned integer</span></div>
-<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l00101" name="l00101"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040">  101</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040">uint128_t</a>(T low) : s(low) {}</div>
-<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span><span class="comment"></span> </div>
-<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span><span class="comment">     * @brief Parameterized constructor</span></div>
-<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span><span class="comment">     * @param str Integer string (hexadecimal starting with 0x.. or decimal)</span></div>
-<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
 <div class="foldopen" id="foldopen00107" data-start="{" data-end="}">
-<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac">  107</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac">uint128_t</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str) {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac">  107</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac">uint128_t</a>(<span class="keyword">const</span> std::string &amp;str) {</div>
 <div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df">__get_integer_from_string</a>(str);</div>
 <div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    }</div>
 </div>
-<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span><span class="comment"></span> </div>
-<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span><span class="comment">     * @brief Parameterized constructor</span></div>
-<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span><span class="comment">     * @param high higher part 64-bit unsigned integer</span></div>
-<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span><span class="comment">     * @param low lower part 64-bit unsigned integer</span></div>
-<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span> </div>
 <div class="line"><a id="l00116" name="l00116"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a95ac8be8f414fcbce09301b912f5079d">  116</a></span>    <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a95ac8be8f414fcbce09301b912f5079d">uint128_t</a>(<span class="keyword">const</span> uint64_t high, <span class="keyword">const</span> uint64_t low) : f(high), s(low) {}</div>
-<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span><span class="comment"></span> </div>
-<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span><span class="comment">     * @brief Copy constructor</span></div>
-<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span><span class="comment">     * @param num 128-bit unsigned integer</span></div>
-<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span> </div>
 <div class="line"><a id="l00122" name="l00122"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b">  122</a></span>    <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b">uint128_t</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;num) = <span class="keywordflow">default</span>;</div>
-<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span><span class="comment"></span> </div>
-<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span><span class="comment">     * @brief Move constructor</span></div>
-<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span><span class="comment">     * @param num 128-bit unsigned integer</span></div>
-<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
 <div class="line"><a id="l00128" name="l00128"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a7d56143b2e291e8087188192533d2e3c">  128</a></span>    <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a7d56143b2e291e8087188192533d2e3c">uint128_t</a>(<a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&amp;num) noexcept : f(num.f), s(num.s) {}</div>
-<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span><span class="comment"></span> </div>
-<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span><span class="comment">     * @brief Destructor for uint128_t</span></div>
-<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
 <div class="line"><a id="l00133" name="l00133"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a4147188abcdcdb12c61bfbe4e4c0a363">  133</a></span>    <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a4147188abcdcdb12c61bfbe4e4c0a363">~uint128_t</a>() = <span class="keywordflow">default</span>;</div>
-<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span><span class="comment"></span> </div>
-<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span><span class="comment">     * @brief Leading zeroes in binary</span></div>
-<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span><span class="comment">     * @details Calculates leading zeros in 128-bit integer</span></div>
-<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span><span class="comment">     * @returns Integer denoting leading zeroes</span></div>
-<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
 <div class="foldopen" id="foldopen00140" data-start="{" data-end="}">
 <div class="line"><a id="l00140" name="l00140"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2">  140</a></span>    <span class="keyword">inline</span> uint32_t <a class="code hl_function" href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2">_lez</a>() {</div>
 <div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span><span class="preprocessor">#ifndef _MSC_VER</span></div>
@@ -272,12 +233,7 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span><span class="preprocessor">#endif</span></div>
 <div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    }</div>
 </div>
-<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span><span class="comment"></span> </div>
-<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span><span class="comment">     * @brief Trailing zeroes in binary</span></div>
-<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span><span class="comment">     * @details Calculates leading zeros in 128-bit integer</span></div>
-<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span><span class="comment">     * @returns Integer denoting Trailing zeroes</span></div>
-<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span> </div>
 <div class="foldopen" id="foldopen00163" data-start="{" data-end="}">
 <div class="line"><a id="l00163" name="l00163"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e">  163</a></span>    <span class="keyword">inline</span> uint32_t <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e">_trz</a>() {</div>
 <div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span><span class="preprocessor">#ifndef _MSC_VER</span></div>
@@ -297,110 +253,57 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span><span class="preprocessor">#endif</span></div>
 <div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    }</div>
 </div>
-<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span><span class="comment"></span> </div>
-<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span><span class="comment">     * @brief casting operator to boolean value</span></div>
-<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span><span class="comment">     * @returns true if value of this is non-zero, else false</span></div>
-<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span> </div>
 <div class="line"><a id="l00185" name="l00185"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a6d45302022ef7f5195458f41b8aedb6e">  185</a></span>    <span class="keyword">inline</span> <span class="keyword">explicit</span> <span class="keyword">operator</span> bool()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (f || s); }</div>
-<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span><span class="comment"></span> </div>
-<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span><span class="comment">     * @brief casting operator to any integer valu</span></div>
-<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span><span class="comment">     * @tparam T any integer type</span></div>
-<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span><span class="comment">     * @returns integer value casted to mentioned type</span></div>
-<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span> </div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00194" data-start="{" data-end="}">
 <div class="line"><a id="l00194" name="l00194"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a75767cb2b6fd47ecb1f721755fdc7639">  194</a></span>    <span class="keyword">inline</span> <span class="keyword">explicit</span> <span class="keyword">operator</span> T()<span class="keyword"> const </span>{</div>
 <div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>        <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>T<span class="keyword">&gt;</span>(s);</div>
 <div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    }</div>
 </div>
-<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span><span class="comment"></span> </div>
-<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span><span class="comment">     * @brief returns lower 64-bit integer part</span></div>
-<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span><span class="comment">     * @returns returns lower 64-bit integer part</span></div>
-<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span> </div>
 <div class="line"><a id="l00202" name="l00202"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd">  202</a></span>    <span class="keyword">inline</span> uint64_t <a class="code hl_function" href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd">lower</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> s; }</div>
-<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span><span class="comment"></span> </div>
-<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span><span class="comment">     * @brief returns upper 64-bit integer part</span></div>
-<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span><span class="comment">     * @returns returns upper 64-bit integer part</span></div>
-<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span> </div>
 <div class="line"><a id="l00208" name="l00208"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">  208</a></span>    <span class="keyword">inline</span> uint64_t <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">upper</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> f; }</div>
-<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span><span class="comment"></span> </div>
-<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span><span class="comment">     * @brief operator = for other types</span></div>
-<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span><span class="comment">     * @tparam T denoting any integer type</span></div>
-<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span><span class="comment">     * @param p an integer to assign it&#39;s value</span></div>
-<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span><span class="comment">     * @returns this pointer with it&#39;s value equal to `p`</span></div>
-<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span> </div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00218" data-start="{" data-end="}">
 <div class="line"><a id="l00218" name="l00218"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544">  218</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544">operator=</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>        this-&gt;s = p;</div>
 <div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    }</div>
 </div>
-<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span><span class="comment"></span> </div>
-<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span><span class="comment">     * @brief operator = for type string</span></div>
-<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span><span class="comment">     * @param p a string to assign it&#39;s value to equivalent integer</span></div>
-<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span><span class="comment">     * @returns this pointer with it&#39;s value equal to `p`</span></div>
-<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span> </div>
 <div class="foldopen" id="foldopen00228" data-start="{" data-end="}">
-<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74">  228</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74">operator=</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;p) {</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74">  228</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74">operator=</a>(<span class="keyword">const</span> std::string &amp;p) {</div>
 <div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>        this-&gt;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df">__get_integer_from_string</a>(p);</div>
 <div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    }</div>
 </div>
-<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span><span class="comment"></span> </div>
-<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span><span class="comment">     * @brief operator = for uint128_t</span></div>
-<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span><span class="comment">     * @param p an 128-bit integer to assign it&#39;s value</span></div>
-<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span><span class="comment">     * @returns this pointer with it&#39;s value equal to `p`</span></div>
-<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span> </div>
 <div class="line"><a id="l00238" name="l00238"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5">  238</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5">operator=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) = <span class="keywordflow">default</span>;</div>
-<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span><span class="comment"></span> </div>
-<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span><span class="comment">     * @brief Move assignment operator</span></div>
-<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span> </div>
 <div class="line"><a id="l00243" name="l00243"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a3c4a7e775a0820196fc08303bbeed44a">  243</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a3c4a7e775a0820196fc08303bbeed44a">operator=</a>(<a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&amp;p) = <span class="keywordflow">default</span>;</div>
-<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span><span class="comment"></span> </div>
-<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span><span class="comment">     * @brief operator + for uint128_t and other integer types.</span></div>
-<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span><span class="comment">     * @returns addition of this and p, returning uint128_t integer</span></div>
-<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span> </div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00253" data-start="{" data-end="}">
 <div class="line"><a id="l00253" name="l00253"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d">  253</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d">operator+</a>(<span class="keyword">const</span> T p) {</div>
 <div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(f + (p + s &lt; s), p + s);</div>
 <div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>    }</div>
 </div>
-<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span><span class="comment"></span> </div>
-<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span><span class="comment">     * @brief operator + for uint128_t and other integer types.</span></div>
-<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span><span class="comment">     * @param p 128-bit unsigned integer</span></div>
-<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span><span class="comment">     * @returns addition of this and p, returning uint128_t integer</span></div>
-<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span> </div>
 <div class="foldopen" id="foldopen00262" data-start="{" data-end="}">
 <div class="line"><a id="l00262" name="l00262"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606">  262</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606">operator+</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) {</div>
 <div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(f + (p.s + s &lt; s) + p.f, p.s + s);</div>
 <div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>    }</div>
 </div>
-<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span><span class="comment"></span> </div>
-<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span><span class="comment">     * @brief operator += for uint128_t and other integer types.</span></div>
-<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span><span class="comment">     * @returns addition of this and p, returning this</span></div>
-<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span> </div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00274" data-start="{" data-end="}">
 <div class="line"><a id="l00274" name="l00274"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004">  274</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004">operator+=</a>(<span class="keyword">const</span> T p) {</div>
 <div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>        <span class="keywordtype">bool</span> app = p + s &lt; s;</div>
@@ -409,12 +312,7 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>    }</div>
 </div>
-<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span><span class="comment"></span> </div>
-<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span><span class="comment">     * @brief operator += for uint128_t</span></div>
-<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span><span class="comment">     * @param p 128-bit unsigned integer</span></div>
-<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span><span class="comment">     * @returns addition of this and p, returning this</span></div>
-<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span> </div>
 <div class="foldopen" id="foldopen00286" data-start="{" data-end="}">
 <div class="line"><a id="l00286" name="l00286"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb">  286</a></span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb">operator+=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) {</div>
 <div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>        <span class="keywordtype">bool</span> app = p.s + s &lt; s;</div>
@@ -423,92 +321,55 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>    }</div>
 </div>
-<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span><span class="comment"></span> </div>
-<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span><span class="comment">     * @brief pre-increment operator</span></div>
-<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span><span class="comment">     * @returns incremented value of this.</span></div>
-<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span> </div>
 <div class="foldopen" id="foldopen00297" data-start="{" data-end="}">
 <div class="line"><a id="l00297" name="l00297"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e">  297</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e">operator++</a>() {</div>
 <div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>        *<span class="keyword">this</span> += 1;</div>
 <div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>    }</div>
 </div>
-<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span><span class="comment"></span> </div>
-<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span><span class="comment">     * @brief post-increment operator</span></div>
-<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span><span class="comment">     * @returns incremented value of this.</span></div>
-<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span> </div>
 <div class="foldopen" id="foldopen00306" data-start="{" data-end="}">
 <div class="line"><a id="l00306" name="l00306"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6">  306</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6">operator++</a>(<span class="keywordtype">int</span>) {</div>
 <div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>        ++*<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>    }</div>
 </div>
-<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span><span class="comment"></span> </div>
-<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span><span class="comment">     * @brief operator - for uint128_t and other integer types.</span></div>
-<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span><span class="comment">     * @returns subtraction of this and p, returning uint128_t integer</span></div>
-<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span> </div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00319" data-start="{" data-end="}">
 <div class="line"><a id="l00319" name="l00319"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec">  319</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec">operator-</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>        <span class="keywordtype">bool</span> app = p &gt; s;</div>
 <div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(f - app, s - p);</div>
 <div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>    }</div>
 </div>
-<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span><span class="comment"></span> </div>
-<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span><span class="comment">     * @brief operator - for uint128_t</span></div>
-<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span><span class="comment">     * @returns subtraction of this and p, returning uint128_t integer</span></div>
-<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span> </div>
 <div class="foldopen" id="foldopen00329" data-start="{" data-end="}">
 <div class="line"><a id="l00329" name="l00329"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c">  329</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c">operator-</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) {</div>
 <div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>        <span class="keywordtype">bool</span> app = p.s &gt; s;</div>
 <div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(f - p.f - app, s - p.s);</div>
 <div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>    }</div>
 </div>
-<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span><span class="comment"></span> </div>
-<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span><span class="comment">     * @brief operator - using twos complement</span></div>
-<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span><span class="comment">     * @returns 2&#39;s complement of this.</span></div>
-<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span> </div>
 <div class="line"><a id="l00338" name="l00338"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3">  338</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3">operator-</a>() { <span class="keywordflow">return</span> ~*<span class="keyword">this</span> + <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(1); }</div>
-<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span><span class="comment"></span> </div>
-<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span><span class="comment">     * @brief operator -- (pre-decrement)</span></div>
-<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span><span class="comment">     * @returns decremented value of this</span></div>
-<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span> </div>
 <div class="foldopen" id="foldopen00344" data-start="{" data-end="}">
 <div class="line"><a id="l00344" name="l00344"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed">  344</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed">operator--</a>() {</div>
 <div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span>        *<span class="keyword">this</span> -= 1;</div>
 <div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>    }</div>
 </div>
-<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span><span class="comment"></span> </div>
-<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span><span class="comment">     * @brief operator -- (post-decrement)</span></div>
-<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span><span class="comment">     * @returns decremented value of this</span></div>
-<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span> </div>
 <div class="foldopen" id="foldopen00353" data-start="{" data-end="}">
 <div class="line"><a id="l00353" name="l00353"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a2ecb71686e1c9ed0267124580c91c414">  353</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a2ecb71686e1c9ed0267124580c91c414">operator--</a>(<span class="keywordtype">int</span> p) {</div>
 <div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>        --*<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>    }</div>
 </div>
-<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span><span class="comment"></span> </div>
-<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span><span class="comment">     * @brief operator -= for uint128_t and other integer types.</span></div>
-<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span><span class="comment">     * @returns subtraction of this and p, returning this</span></div>
-<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span> </div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00366" data-start="{" data-end="}">
 <div class="line"><a id="l00366" name="l00366"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798">  366</a></span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798">operator-=</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>        <span class="keywordtype">bool</span> app = p &gt; s;</div>
@@ -517,12 +378,7 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>    }</div>
 </div>
-<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span><span class="comment"></span> </div>
-<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span><span class="comment">     * @brief operator -= for uint128_t</span></div>
-<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span><span class="comment">     * @param p 128-bit unsigned integer</span></div>
-<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span><span class="comment">     * @returns subtraction of this and p, returning this</span></div>
-<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span> </div>
 <div class="foldopen" id="foldopen00378" data-start="{" data-end="}">
 <div class="line"><a id="l00378" name="l00378"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8">  378</a></span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8">operator-=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) {</div>
 <div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>        <span class="keywordtype">bool</span> app = p.s &gt; s;</div>
@@ -531,26 +387,15 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>    }</div>
 </div>
-<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span><span class="comment"></span> </div>
-<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span><span class="comment">     * @brief operator * for uint128_t and other integer types.</span></div>
-<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span><span class="comment">     * @returns multiplication of this and p, returning uint128_t integer</span></div>
-<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span> </div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00393" data-start="{" data-end="}">
 <div class="line"><a id="l00393" name="l00393"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30">  393</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30">operator*</a>(<span class="keyword">const</span> T p) {</div>
 <div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> * <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p);</div>
 <div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>    }</div>
 </div>
-<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span><span class="comment"></span> </div>
-<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span><span class="comment">     * @brief operator * for uint128_t and other integer types.</span></div>
-<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span><span class="comment">     * @param p 128-bit unsigned integer</span></div>
-<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span><span class="comment">     * @returns multiplication of this and p, returning uint128_t integer</span></div>
-<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span> </div>
 <div class="foldopen" id="foldopen00402" data-start="{" data-end="}">
 <div class="line"><a id="l00402" name="l00402"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860">  402</a></span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860">operator*</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) {</div>
 <div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>        uint64_t f_first = s &gt;&gt; 32, f_second = s &amp; 0xFFFFFFFF,</div>
@@ -566,27 +411,16 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(this-&gt;f * p.s + this-&gt;s * p.f + carry + cc, tmp + fo);</div>
 <div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>    }</div>
 </div>
-<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span><span class="comment"></span> </div>
-<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span><span class="comment">     * @brief operator *= for uint128_t and other integer types.</span></div>
-<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span><span class="comment">     * @returns multiplication of this and p, returning this</span></div>
-<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span> </div>
+<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00424" data-start="{" data-end="}">
 <div class="line"><a id="l00424" name="l00424"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092">  424</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092">operator*=</a>(<span class="keyword">const</span> T p) {</div>
 <div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span>        *<span class="keyword">this</span> *= <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p);</div>
 <div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span>    }</div>
 </div>
-<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span><span class="comment"></span> </div>
-<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span><span class="comment">     * @brief operator *= for uint128_t and other integer types.</span></div>
-<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span><span class="comment">     * @param p 128-bit unsigned integer</span></div>
-<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span><span class="comment">     * @returns multiplication of this and p, returning this</span></div>
-<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span> </div>
 <div class="foldopen" id="foldopen00434" data-start="{" data-end="}">
 <div class="line"><a id="l00434" name="l00434"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295">  434</a></span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295">operator*=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) {</div>
 <div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>        uint64_t f_first = s &gt;&gt; 32, f_second = s &amp; 0xFFFFFFFF,</div>
@@ -603,15 +437,9 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span>    }</div>
 </div>
-<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span><span class="comment"></span> </div>
-<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span><span class="comment">     * @brief divide function for uint128_t and other integer types.</span></div>
-<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span><span class="comment">     * @details divide this value and</span></div>
-<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span><span class="comment">     * @param p 128-bit unsigned integer</span></div>
-<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span><span class="comment">     * @returns pair denoting quotient and remainder.</span></div>
-<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span> </div>
 <div class="foldopen" id="foldopen00455" data-start="{" data-end="}">
-<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c">  455</a></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;uint128_t, uint128_t&gt;</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c">divide</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) {</div>
+<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c">  455</a></span>    std::pair&lt;uint128_t, uint128_t&gt; <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c">divide</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) {</div>
 <div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>        <span class="keywordflow">if</span> (*<span class="keyword">this</span> &lt; p) {  <span class="comment">// if this is less than divisor</span></div>
 <div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>            <span class="keywordflow">return</span> {<a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(0), *<span class="keyword">this</span>};</div>
 <div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (*<span class="keyword">this</span> == p) {  <span class="comment">// if this is equal to divisor</span></div>
@@ -640,22 +468,11 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span>        <span class="keywordflow">return</span> {quotient &lt;&lt; left, tmp2};</div>
 <div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>    }</div>
 </div>
-<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span><span class="comment"></span> </div>
-<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span><span class="comment">     * @brief operator / for uint128_t and other integer types.</span></div>
-<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span><span class="comment">     * @param p 128-bit unsigned integer</span></div>
-<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span><span class="comment">     * @returns unsigned 128-bit quotient.</span></div>
-<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span> </div>
 <div class="line"><a id="l00489" name="l00489"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee">  489</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee">operator/</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c">divide</a>(p).first; }</div>
-<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span><span class="comment"></span> </div>
-<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span><span class="comment">     * @brief operator / for uint128_t and other integer types.</span></div>
-<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span><span class="comment">     * @returns unsigned 128-bit quotient.</span></div>
-<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span> </div>
+<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00499" data-start="{" data-end="}">
 <div class="line"><a id="l00499" name="l00499"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94">  499</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94">operator/</a>(<span class="keyword">const</span> T p) {</div>
 <div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span>        <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> tmp = *<span class="keyword">this</span>;</div>
@@ -663,309 +480,169 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span>        <span class="keywordflow">return</span> tmp;</div>
 <div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>    }</div>
 </div>
-<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span><span class="comment"></span> </div>
-<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span><span class="comment">     * @brief operator /= for uint128_t</span></div>
-<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span><span class="comment">     * @param p 128-bit unsigned integer</span></div>
-<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span><span class="comment">     * @returns this set as unsigned 128-bit quotient.</span></div>
-<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span> </div>
 <div class="foldopen" id="foldopen00510" data-start="{" data-end="}">
 <div class="line"><a id="l00510" name="l00510"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db">  510</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db">operator/=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) {</div>
 <div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span>        *<span class="keyword">this</span> = <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c">divide</a>(p).first;</div>
 <div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span>    }</div>
 </div>
-<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span><span class="comment"></span> </div>
-<div class="line"><a id="l00515" name="l00515"></a><span class="lineno">  515</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00516" name="l00516"></a><span class="lineno">  516</span><span class="comment">     * @brief operator /= for uint128_t and other integer types.</span></div>
-<div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span><span class="comment">     * @returns this set as unsigned 128-bit quotient.</span></div>
-<div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span> </div>
+<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00523" data-start="{" data-end="}">
 <div class="line"><a id="l00523" name="l00523"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b">  523</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b">operator/=</a>(<span class="keyword">const</span> T p) {</div>
 <div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span>        *<span class="keyword">this</span> /= <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(0, p);</div>
 <div class="line"><a id="l00525" name="l00525"></a><span class="lineno">  525</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span>    }</div>
 </div>
-<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span><span class="comment"></span> </div>
-<div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00529" name="l00529"></a><span class="lineno">  529</span><span class="comment">     * @brief operator % for uint128_t</span></div>
-<div class="line"><a id="l00530" name="l00530"></a><span class="lineno">  530</span><span class="comment">     * @param p 128-bit unsigned integer</span></div>
-<div class="line"><a id="l00531" name="l00531"></a><span class="lineno">  531</span><span class="comment">     * @returns unsigned 128-bit remainder.</span></div>
-<div class="line"><a id="l00532" name="l00532"></a><span class="lineno">  532</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span> </div>
 <div class="line"><a id="l00533" name="l00533"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#abfc6a8765039cacc829a5cd386b5a066">  533</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#abfc6a8765039cacc829a5cd386b5a066">operator%</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c">divide</a>(p).second; }</div>
-<div class="line"><a id="l00534" name="l00534"></a><span class="lineno">  534</span><span class="comment"></span> </div>
-<div class="line"><a id="l00535" name="l00535"></a><span class="lineno">  535</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00536" name="l00536"></a><span class="lineno">  536</span><span class="comment">     * @brief operator % for uint128_t and other integer types.</span></div>
-<div class="line"><a id="l00537" name="l00537"></a><span class="lineno">  537</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00538" name="l00538"></a><span class="lineno">  538</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00539" name="l00539"></a><span class="lineno">  539</span><span class="comment">     * @returns unsigned 128-bit remainder.</span></div>
-<div class="line"><a id="l00540" name="l00540"></a><span class="lineno">  540</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00534" name="l00534"></a><span class="lineno">  534</span> </div>
+<div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00543" data-start="{" data-end="}">
 <div class="line"><a id="l00543" name="l00543"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#add9938b97fc66560cec2d32e8c83eaad">  543</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#add9938b97fc66560cec2d32e8c83eaad">operator%</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00544" name="l00544"></a><span class="lineno">  544</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> % <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p);</div>
 <div class="line"><a id="l00545" name="l00545"></a><span class="lineno">  545</span>    }</div>
 </div>
-<div class="line"><a id="l00546" name="l00546"></a><span class="lineno">  546</span><span class="comment"></span> </div>
-<div class="line"><a id="l00547" name="l00547"></a><span class="lineno">  547</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00548" name="l00548"></a><span class="lineno">  548</span><span class="comment">     * @brief operator %= for uint128_t</span></div>
-<div class="line"><a id="l00549" name="l00549"></a><span class="lineno">  549</span><span class="comment">     * @param p 128-bit unsigned integer</span></div>
-<div class="line"><a id="l00550" name="l00550"></a><span class="lineno">  550</span><span class="comment">     * @returns this set as unsigned 128-bit remainder.</span></div>
-<div class="line"><a id="l00551" name="l00551"></a><span class="lineno">  551</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00546" name="l00546"></a><span class="lineno">  546</span> </div>
 <div class="foldopen" id="foldopen00552" data-start="{" data-end="}">
 <div class="line"><a id="l00552" name="l00552"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2">  552</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2">operator%=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) {</div>
 <div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</span>        *<span class="keyword">this</span> = <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c">divide</a>(p).second;</div>
 <div class="line"><a id="l00554" name="l00554"></a><span class="lineno">  554</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00555" name="l00555"></a><span class="lineno">  555</span>    }</div>
 </div>
-<div class="line"><a id="l00556" name="l00556"></a><span class="lineno">  556</span><span class="comment"></span> </div>
-<div class="line"><a id="l00557" name="l00557"></a><span class="lineno">  557</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00558" name="l00558"></a><span class="lineno">  558</span><span class="comment">     * @brief operator %= for uint128_t</span></div>
-<div class="line"><a id="l00559" name="l00559"></a><span class="lineno">  559</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00560" name="l00560"></a><span class="lineno">  560</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00561" name="l00561"></a><span class="lineno">  561</span><span class="comment">     * @returns this set as unsigned 128-bit remainder.</span></div>
-<div class="line"><a id="l00562" name="l00562"></a><span class="lineno">  562</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00563" name="l00563"></a><span class="lineno">  563</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00564" name="l00564"></a><span class="lineno">  564</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00556" name="l00556"></a><span class="lineno">  556</span> </div>
+<div class="line"><a id="l00563" name="l00563"></a><span class="lineno">  563</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00564" name="l00564"></a><span class="lineno">  564</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00565" data-start="{" data-end="}">
 <div class="line"><a id="l00565" name="l00565"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40">  565</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40">operator%=</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00566" name="l00566"></a><span class="lineno">  566</span>        *<span class="keyword">this</span> %= <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p);</div>
 <div class="line"><a id="l00567" name="l00567"></a><span class="lineno">  567</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00568" name="l00568"></a><span class="lineno">  568</span>    }</div>
 </div>
-<div class="line"><a id="l00569" name="l00569"></a><span class="lineno">  569</span><span class="comment"></span> </div>
-<div class="line"><a id="l00570" name="l00570"></a><span class="lineno">  570</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00571" name="l00571"></a><span class="lineno">  571</span><span class="comment">     * @brief operator &lt; for uint128_t</span></div>
-<div class="line"><a id="l00572" name="l00572"></a><span class="lineno">  572</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00573" name="l00573"></a><span class="lineno">  573</span><span class="comment">     * @returns true if this is less than other, else false</span></div>
-<div class="line"><a id="l00574" name="l00574"></a><span class="lineno">  574</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00569" name="l00569"></a><span class="lineno">  569</span> </div>
 <div class="foldopen" id="foldopen00575" data-start="{" data-end="}">
 <div class="line"><a id="l00575" name="l00575"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4">  575</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4">operator&lt;</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;other) {</div>
 <div class="line"><a id="l00576" name="l00576"></a><span class="lineno">  576</span>        <span class="keywordflow">return</span> f &lt; other.f || (f == other.f &amp;&amp; s &lt; other.s);</div>
 <div class="line"><a id="l00577" name="l00577"></a><span class="lineno">  577</span>    }</div>
 </div>
-<div class="line"><a id="l00578" name="l00578"></a><span class="lineno">  578</span><span class="comment"></span> </div>
-<div class="line"><a id="l00579" name="l00579"></a><span class="lineno">  579</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00580" name="l00580"></a><span class="lineno">  580</span><span class="comment">     * @brief operator &lt;= for uint128_t</span></div>
-<div class="line"><a id="l00581" name="l00581"></a><span class="lineno">  581</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00582" name="l00582"></a><span class="lineno">  582</span><span class="comment">     * @returns true if this is less than or equal to other, else false</span></div>
-<div class="line"><a id="l00583" name="l00583"></a><span class="lineno">  583</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00578" name="l00578"></a><span class="lineno">  578</span> </div>
 <div class="foldopen" id="foldopen00584" data-start="{" data-end="}">
 <div class="line"><a id="l00584" name="l00584"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a">  584</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a">operator&lt;=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;other) {</div>
 <div class="line"><a id="l00585" name="l00585"></a><span class="lineno">  585</span>        <span class="keywordflow">return</span> f &lt; other.f || (f == other.f &amp;&amp; s &lt;= other.s);</div>
 <div class="line"><a id="l00586" name="l00586"></a><span class="lineno">  586</span>    }</div>
 </div>
-<div class="line"><a id="l00587" name="l00587"></a><span class="lineno">  587</span><span class="comment"></span> </div>
-<div class="line"><a id="l00588" name="l00588"></a><span class="lineno">  588</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00589" name="l00589"></a><span class="lineno">  589</span><span class="comment">     * @brief operator &gt; for uint128_t</span></div>
-<div class="line"><a id="l00590" name="l00590"></a><span class="lineno">  590</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00591" name="l00591"></a><span class="lineno">  591</span><span class="comment">     * @returns true if this is greater than other, else false</span></div>
-<div class="line"><a id="l00592" name="l00592"></a><span class="lineno">  592</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00587" name="l00587"></a><span class="lineno">  587</span> </div>
 <div class="foldopen" id="foldopen00593" data-start="{" data-end="}">
 <div class="line"><a id="l00593" name="l00593"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440">  593</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440">operator&gt;</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;other) {</div>
 <div class="line"><a id="l00594" name="l00594"></a><span class="lineno">  594</span>        <span class="keywordflow">return</span> f &gt; other.f || (f == other.f &amp;&amp; s &gt; other.s);</div>
 <div class="line"><a id="l00595" name="l00595"></a><span class="lineno">  595</span>    }</div>
 </div>
-<div class="line"><a id="l00596" name="l00596"></a><span class="lineno">  596</span><span class="comment"></span> </div>
-<div class="line"><a id="l00597" name="l00597"></a><span class="lineno">  597</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00598" name="l00598"></a><span class="lineno">  598</span><span class="comment">     * @brief operator &gt;= for uint128_t</span></div>
-<div class="line"><a id="l00599" name="l00599"></a><span class="lineno">  599</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00600" name="l00600"></a><span class="lineno">  600</span><span class="comment">     * @returns true if this is greater than or equal than other, else false</span></div>
-<div class="line"><a id="l00601" name="l00601"></a><span class="lineno">  601</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00596" name="l00596"></a><span class="lineno">  596</span> </div>
 <div class="foldopen" id="foldopen00602" data-start="{" data-end="}">
 <div class="line"><a id="l00602" name="l00602"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292">  602</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292">operator&gt;=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;other) {</div>
 <div class="line"><a id="l00603" name="l00603"></a><span class="lineno">  603</span>        <span class="keywordflow">return</span> (f &gt; other.f) || (f == other.f &amp;&amp; s &gt;= other.s);</div>
 <div class="line"><a id="l00604" name="l00604"></a><span class="lineno">  604</span>    }</div>
 </div>
-<div class="line"><a id="l00605" name="l00605"></a><span class="lineno">  605</span><span class="comment"></span> </div>
-<div class="line"><a id="l00606" name="l00606"></a><span class="lineno">  606</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00607" name="l00607"></a><span class="lineno">  607</span><span class="comment">     * @brief operator == for uint128_t</span></div>
-<div class="line"><a id="l00608" name="l00608"></a><span class="lineno">  608</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00609" name="l00609"></a><span class="lineno">  609</span><span class="comment">     * @returns true if this is equal than other, else false</span></div>
-<div class="line"><a id="l00610" name="l00610"></a><span class="lineno">  610</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00605" name="l00605"></a><span class="lineno">  605</span> </div>
 <div class="foldopen" id="foldopen00611" data-start="{" data-end="}">
 <div class="line"><a id="l00611" name="l00611"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e">  611</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e">operator==</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;other) {</div>
 <div class="line"><a id="l00612" name="l00612"></a><span class="lineno">  612</span>        <span class="keywordflow">return</span> f == other.f &amp;&amp; s == other.s;</div>
 <div class="line"><a id="l00613" name="l00613"></a><span class="lineno">  613</span>    }</div>
 </div>
-<div class="line"><a id="l00614" name="l00614"></a><span class="lineno">  614</span><span class="comment"></span> </div>
-<div class="line"><a id="l00615" name="l00615"></a><span class="lineno">  615</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00616" name="l00616"></a><span class="lineno">  616</span><span class="comment">     * @brief operator != for uint128_t</span></div>
-<div class="line"><a id="l00617" name="l00617"></a><span class="lineno">  617</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00618" name="l00618"></a><span class="lineno">  618</span><span class="comment">     * @returns true if this is not equal than other, else false</span></div>
-<div class="line"><a id="l00619" name="l00619"></a><span class="lineno">  619</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00614" name="l00614"></a><span class="lineno">  614</span> </div>
 <div class="foldopen" id="foldopen00620" data-start="{" data-end="}">
 <div class="line"><a id="l00620" name="l00620"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e">  620</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e">operator!=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;other) {</div>
 <div class="line"><a id="l00621" name="l00621"></a><span class="lineno">  621</span>        <span class="keywordflow">return</span> f != other.f || s != other.s;</div>
 <div class="line"><a id="l00622" name="l00622"></a><span class="lineno">  622</span>    }</div>
 </div>
-<div class="line"><a id="l00623" name="l00623"></a><span class="lineno">  623</span><span class="comment"></span> </div>
-<div class="line"><a id="l00624" name="l00624"></a><span class="lineno">  624</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00625" name="l00625"></a><span class="lineno">  625</span><span class="comment">     * @brief operator ! for uint128_t</span></div>
-<div class="line"><a id="l00626" name="l00626"></a><span class="lineno">  626</span><span class="comment">     * @returns true if this has zero value, else false</span></div>
-<div class="line"><a id="l00627" name="l00627"></a><span class="lineno">  627</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00623" name="l00623"></a><span class="lineno">  623</span> </div>
 <div class="line"><a id="l00628" name="l00628"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d">  628</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d">operator!</a>() { <span class="keywordflow">return</span> !f &amp;&amp; !s; }</div>
-<div class="line"><a id="l00629" name="l00629"></a><span class="lineno">  629</span><span class="comment"></span> </div>
-<div class="line"><a id="l00630" name="l00630"></a><span class="lineno">  630</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00631" name="l00631"></a><span class="lineno">  631</span><span class="comment">     * @brief operator &amp;&amp; for uint128_t</span></div>
-<div class="line"><a id="l00632" name="l00632"></a><span class="lineno">  632</span><span class="comment">     * @param b number to be compared with this</span></div>
-<div class="line"><a id="l00633" name="l00633"></a><span class="lineno">  633</span><span class="comment">     * @returns true if both of the values are not zero, else false</span></div>
-<div class="line"><a id="l00634" name="l00634"></a><span class="lineno">  634</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00629" name="l00629"></a><span class="lineno">  629</span> </div>
 <div class="foldopen" id="foldopen00635" data-start="{" data-end="}">
 <div class="line"><a id="l00635" name="l00635"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1">  635</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1">operator&amp;&amp;</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;b) {</div>
 <div class="line"><a id="l00636" name="l00636"></a><span class="lineno">  636</span>        <span class="keywordflow">return</span> (s || f) &amp;&amp; (b.s || b.f);</div>
 <div class="line"><a id="l00637" name="l00637"></a><span class="lineno">  637</span>    }</div>
 </div>
-<div class="line"><a id="l00638" name="l00638"></a><span class="lineno">  638</span><span class="comment"></span> </div>
-<div class="line"><a id="l00639" name="l00639"></a><span class="lineno">  639</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00640" name="l00640"></a><span class="lineno">  640</span><span class="comment">     * @brief operator || for uint128_t</span></div>
-<div class="line"><a id="l00641" name="l00641"></a><span class="lineno">  641</span><span class="comment">     * @param b number to be compared with this</span></div>
-<div class="line"><a id="l00642" name="l00642"></a><span class="lineno">  642</span><span class="comment">     * @returns true if one of the values are not zero, else false</span></div>
-<div class="line"><a id="l00643" name="l00643"></a><span class="lineno">  643</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00638" name="l00638"></a><span class="lineno">  638</span> </div>
 <div class="foldopen" id="foldopen00644" data-start="{" data-end="}">
 <div class="line"><a id="l00644" name="l00644"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03">  644</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03">operator||</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;b) {</div>
 <div class="line"><a id="l00645" name="l00645"></a><span class="lineno">  645</span>        <span class="keywordflow">return</span> (s || f) || (b.s || b.f);</div>
 <div class="line"><a id="l00646" name="l00646"></a><span class="lineno">  646</span>    }</div>
 </div>
-<div class="line"><a id="l00647" name="l00647"></a><span class="lineno">  647</span><span class="comment"></span> </div>
-<div class="line"><a id="l00648" name="l00648"></a><span class="lineno">  648</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00649" name="l00649"></a><span class="lineno">  649</span><span class="comment">     * @brief operator () for uint128_t</span></div>
-<div class="line"><a id="l00650" name="l00650"></a><span class="lineno">  650</span><span class="comment">     * @returns true if this value is non-zero, else false</span></div>
-<div class="line"><a id="l00651" name="l00651"></a><span class="lineno">  651</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00647" name="l00647"></a><span class="lineno">  647</span> </div>
 <div class="line"><a id="l00652" name="l00652"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733">  652</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733">operator()</a>() { <span class="keywordflow">return</span> s || f; }</div>
-<div class="line"><a id="l00653" name="l00653"></a><span class="lineno">  653</span><span class="comment"></span> </div>
-<div class="line"><a id="l00654" name="l00654"></a><span class="lineno">  654</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00655" name="l00655"></a><span class="lineno">  655</span><span class="comment">     * @brief operator &lt; for other types</span></div>
-<div class="line"><a id="l00656" name="l00656"></a><span class="lineno">  656</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00657" name="l00657"></a><span class="lineno">  657</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00658" name="l00658"></a><span class="lineno">  658</span><span class="comment">     * @returns true if this is less than other, else false</span></div>
-<div class="line"><a id="l00659" name="l00659"></a><span class="lineno">  659</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00660" name="l00660"></a><span class="lineno">  660</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00661" name="l00661"></a><span class="lineno">  661</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00653" name="l00653"></a><span class="lineno">  653</span> </div>
+<div class="line"><a id="l00660" name="l00660"></a><span class="lineno">  660</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00661" name="l00661"></a><span class="lineno">  661</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00662" data-start="{" data-end="}">
 <div class="line"><a id="l00662" name="l00662"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc">  662</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc">operator&lt;</a>(<span class="keyword">const</span> T other) {</div>
 <div class="line"><a id="l00663" name="l00663"></a><span class="lineno">  663</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> &lt; <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(other);</div>
 <div class="line"><a id="l00664" name="l00664"></a><span class="lineno">  664</span>    }</div>
 </div>
-<div class="line"><a id="l00665" name="l00665"></a><span class="lineno">  665</span><span class="comment"></span> </div>
-<div class="line"><a id="l00666" name="l00666"></a><span class="lineno">  666</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00667" name="l00667"></a><span class="lineno">  667</span><span class="comment">     * @brief operator &lt;= for other types</span></div>
-<div class="line"><a id="l00668" name="l00668"></a><span class="lineno">  668</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00669" name="l00669"></a><span class="lineno">  669</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00670" name="l00670"></a><span class="lineno">  670</span><span class="comment">     * @returns true if this is less than or equal to other, else false</span></div>
-<div class="line"><a id="l00671" name="l00671"></a><span class="lineno">  671</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00672" name="l00672"></a><span class="lineno">  672</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00673" name="l00673"></a><span class="lineno">  673</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00665" name="l00665"></a><span class="lineno">  665</span> </div>
+<div class="line"><a id="l00672" name="l00672"></a><span class="lineno">  672</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00673" name="l00673"></a><span class="lineno">  673</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00674" data-start="{" data-end="}">
 <div class="line"><a id="l00674" name="l00674"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c">  674</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c">operator&lt;=</a>(<span class="keyword">const</span> T other) {</div>
 <div class="line"><a id="l00675" name="l00675"></a><span class="lineno">  675</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> &lt;= <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(other);</div>
 <div class="line"><a id="l00676" name="l00676"></a><span class="lineno">  676</span>    }</div>
 </div>
-<div class="line"><a id="l00677" name="l00677"></a><span class="lineno">  677</span><span class="comment"></span> </div>
-<div class="line"><a id="l00678" name="l00678"></a><span class="lineno">  678</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00679" name="l00679"></a><span class="lineno">  679</span><span class="comment">     * @brief operator &gt; for other types</span></div>
-<div class="line"><a id="l00680" name="l00680"></a><span class="lineno">  680</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00681" name="l00681"></a><span class="lineno">  681</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00682" name="l00682"></a><span class="lineno">  682</span><span class="comment">     * @returns true if this is greater than other, else false</span></div>
-<div class="line"><a id="l00683" name="l00683"></a><span class="lineno">  683</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00684" name="l00684"></a><span class="lineno">  684</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00685" name="l00685"></a><span class="lineno">  685</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00677" name="l00677"></a><span class="lineno">  677</span> </div>
+<div class="line"><a id="l00684" name="l00684"></a><span class="lineno">  684</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00685" name="l00685"></a><span class="lineno">  685</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00686" data-start="{" data-end="}">
 <div class="line"><a id="l00686" name="l00686"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e">  686</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e">operator&gt;</a>(<span class="keyword">const</span> T other) {</div>
 <div class="line"><a id="l00687" name="l00687"></a><span class="lineno">  687</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> &gt; <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(other);</div>
 <div class="line"><a id="l00688" name="l00688"></a><span class="lineno">  688</span>    }</div>
 </div>
-<div class="line"><a id="l00689" name="l00689"></a><span class="lineno">  689</span><span class="comment"></span> </div>
-<div class="line"><a id="l00690" name="l00690"></a><span class="lineno">  690</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00691" name="l00691"></a><span class="lineno">  691</span><span class="comment">     * @brief operator &gt;= for other types</span></div>
-<div class="line"><a id="l00692" name="l00692"></a><span class="lineno">  692</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00693" name="l00693"></a><span class="lineno">  693</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00694" name="l00694"></a><span class="lineno">  694</span><span class="comment">     * @returns true if this is greater than or equal other, else false</span></div>
-<div class="line"><a id="l00695" name="l00695"></a><span class="lineno">  695</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00696" name="l00696"></a><span class="lineno">  696</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00697" name="l00697"></a><span class="lineno">  697</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00689" name="l00689"></a><span class="lineno">  689</span> </div>
+<div class="line"><a id="l00696" name="l00696"></a><span class="lineno">  696</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00697" name="l00697"></a><span class="lineno">  697</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00698" data-start="{" data-end="}">
 <div class="line"><a id="l00698" name="l00698"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481">  698</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481">operator&gt;=</a>(<span class="keyword">const</span> T other) {</div>
 <div class="line"><a id="l00699" name="l00699"></a><span class="lineno">  699</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> &gt;= <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(other);</div>
 <div class="line"><a id="l00700" name="l00700"></a><span class="lineno">  700</span>    }</div>
 </div>
-<div class="line"><a id="l00701" name="l00701"></a><span class="lineno">  701</span><span class="comment"></span> </div>
-<div class="line"><a id="l00702" name="l00702"></a><span class="lineno">  702</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00703" name="l00703"></a><span class="lineno">  703</span><span class="comment">     * @brief operator == for other types</span></div>
-<div class="line"><a id="l00704" name="l00704"></a><span class="lineno">  704</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00705" name="l00705"></a><span class="lineno">  705</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00706" name="l00706"></a><span class="lineno">  706</span><span class="comment">     * @returns true if this is equal to other, else false</span></div>
-<div class="line"><a id="l00707" name="l00707"></a><span class="lineno">  707</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00708" name="l00708"></a><span class="lineno">  708</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00709" name="l00709"></a><span class="lineno">  709</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00701" name="l00701"></a><span class="lineno">  701</span> </div>
+<div class="line"><a id="l00708" name="l00708"></a><span class="lineno">  708</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00709" name="l00709"></a><span class="lineno">  709</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00710" data-start="{" data-end="}">
 <div class="line"><a id="l00710" name="l00710"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896">  710</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896">operator==</a>(<span class="keyword">const</span> T other) {</div>
 <div class="line"><a id="l00711" name="l00711"></a><span class="lineno">  711</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> == <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(other);</div>
 <div class="line"><a id="l00712" name="l00712"></a><span class="lineno">  712</span>    }</div>
 </div>
-<div class="line"><a id="l00713" name="l00713"></a><span class="lineno">  713</span><span class="comment"></span> </div>
-<div class="line"><a id="l00714" name="l00714"></a><span class="lineno">  714</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00715" name="l00715"></a><span class="lineno">  715</span><span class="comment">     * @brief operator != for other types</span></div>
-<div class="line"><a id="l00716" name="l00716"></a><span class="lineno">  716</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00717" name="l00717"></a><span class="lineno">  717</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00718" name="l00718"></a><span class="lineno">  718</span><span class="comment">     * @returns true if this is not equal to other, else false</span></div>
-<div class="line"><a id="l00719" name="l00719"></a><span class="lineno">  719</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00720" name="l00720"></a><span class="lineno">  720</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00721" name="l00721"></a><span class="lineno">  721</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00713" name="l00713"></a><span class="lineno">  713</span> </div>
+<div class="line"><a id="l00720" name="l00720"></a><span class="lineno">  720</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00721" name="l00721"></a><span class="lineno">  721</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00722" data-start="{" data-end="}">
 <div class="line"><a id="l00722" name="l00722"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696">  722</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696">operator!=</a>(<span class="keyword">const</span> T other) {</div>
 <div class="line"><a id="l00723" name="l00723"></a><span class="lineno">  723</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> != <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(other);</div>
 <div class="line"><a id="l00724" name="l00724"></a><span class="lineno">  724</span>    }</div>
 </div>
-<div class="line"><a id="l00725" name="l00725"></a><span class="lineno">  725</span><span class="comment"></span> </div>
-<div class="line"><a id="l00726" name="l00726"></a><span class="lineno">  726</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00727" name="l00727"></a><span class="lineno">  727</span><span class="comment">     * @brief operator &amp;&amp; for other types</span></div>
-<div class="line"><a id="l00728" name="l00728"></a><span class="lineno">  728</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00729" name="l00729"></a><span class="lineno">  729</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00730" name="l00730"></a><span class="lineno">  730</span><span class="comment">     * @returns true if this is both values are non-zero, else false</span></div>
-<div class="line"><a id="l00731" name="l00731"></a><span class="lineno">  731</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00732" name="l00732"></a><span class="lineno">  732</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00733" name="l00733"></a><span class="lineno">  733</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00725" name="l00725"></a><span class="lineno">  725</span> </div>
+<div class="line"><a id="l00732" name="l00732"></a><span class="lineno">  732</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00733" name="l00733"></a><span class="lineno">  733</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00734" data-start="{" data-end="}">
 <div class="line"><a id="l00734" name="l00734"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a">  734</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a">operator&amp;&amp;</a>(<span class="keyword">const</span> T b) {</div>
 <div class="line"><a id="l00735" name="l00735"></a><span class="lineno">  735</span>        <span class="keywordflow">return</span> (f || s) &amp;&amp; b;</div>
 <div class="line"><a id="l00736" name="l00736"></a><span class="lineno">  736</span>    }</div>
 </div>
-<div class="line"><a id="l00737" name="l00737"></a><span class="lineno">  737</span><span class="comment"></span> </div>
-<div class="line"><a id="l00738" name="l00738"></a><span class="lineno">  738</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00739" name="l00739"></a><span class="lineno">  739</span><span class="comment">     * @brief operator || for other types</span></div>
-<div class="line"><a id="l00740" name="l00740"></a><span class="lineno">  740</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00741" name="l00741"></a><span class="lineno">  741</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00742" name="l00742"></a><span class="lineno">  742</span><span class="comment">     * @returns true if this is either one of the values are non-zero, else</span></div>
-<div class="line"><a id="l00743" name="l00743"></a><span class="lineno">  743</span><span class="comment">     * false</span></div>
-<div class="line"><a id="l00744" name="l00744"></a><span class="lineno">  744</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00745" name="l00745"></a><span class="lineno">  745</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00746" name="l00746"></a><span class="lineno">  746</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00737" name="l00737"></a><span class="lineno">  737</span> </div>
+<div class="line"><a id="l00745" name="l00745"></a><span class="lineno">  745</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00746" name="l00746"></a><span class="lineno">  746</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00747" data-start="{" data-end="}">
 <div class="line"><a id="l00747" name="l00747"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503">  747</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503">operator||</a>(<span class="keyword">const</span> T b) {</div>
 <div class="line"><a id="l00748" name="l00748"></a><span class="lineno">  748</span>        <span class="keywordflow">return</span> (f || s) || b;</div>
 <div class="line"><a id="l00749" name="l00749"></a><span class="lineno">  749</span>    }</div>
 </div>
-<div class="line"><a id="l00750" name="l00750"></a><span class="lineno">  750</span><span class="comment"></span> </div>
-<div class="line"><a id="l00751" name="l00751"></a><span class="lineno">  751</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00752" name="l00752"></a><span class="lineno">  752</span><span class="comment">     * @brief operator ~ for uint128_t</span></div>
-<div class="line"><a id="l00753" name="l00753"></a><span class="lineno">  753</span><span class="comment">     * @returns 1&#39;s complement of this number</span></div>
-<div class="line"><a id="l00754" name="l00754"></a><span class="lineno">  754</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00750" name="l00750"></a><span class="lineno">  750</span> </div>
 <div class="line"><a id="l00755" name="l00755"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f">  755</a></span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f">operator~</a>() { <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(~this-&gt;f, ~this-&gt;s); }</div>
-<div class="line"><a id="l00756" name="l00756"></a><span class="lineno">  756</span><span class="comment"></span> </div>
-<div class="line"><a id="l00757" name="l00757"></a><span class="lineno">  757</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00758" name="l00758"></a><span class="lineno">  758</span><span class="comment">     * @brief operator &lt;&lt; for uint128_t</span></div>
-<div class="line"><a id="l00759" name="l00759"></a><span class="lineno">  759</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00760" name="l00760"></a><span class="lineno">  760</span><span class="comment">     * @param p number denoting number of shifts</span></div>
-<div class="line"><a id="l00761" name="l00761"></a><span class="lineno">  761</span><span class="comment">     * @returns value of this shifted by p to left</span></div>
-<div class="line"><a id="l00762" name="l00762"></a><span class="lineno">  762</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00763" name="l00763"></a><span class="lineno">  763</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00764" name="l00764"></a><span class="lineno">  764</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00756" name="l00756"></a><span class="lineno">  756</span> </div>
+<div class="line"><a id="l00763" name="l00763"></a><span class="lineno">  763</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00764" name="l00764"></a><span class="lineno">  764</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00765" data-start="{" data-end="}">
 <div class="line"><a id="l00765" name="l00765"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190">  765</a></span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190">operator&lt;&lt;</a>(<span class="keyword">const</span> T p) {</div>
 <div class="line"><a id="l00766" name="l00766"></a><span class="lineno">  766</span>        <span class="keywordflow">if</span> (!p) {</div>
@@ -979,15 +656,9 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00774" name="l00774"></a><span class="lineno">  774</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(0);</div>
 <div class="line"><a id="l00775" name="l00775"></a><span class="lineno">  775</span>    }</div>
 </div>
-<div class="line"><a id="l00776" name="l00776"></a><span class="lineno">  776</span><span class="comment"></span> </div>
-<div class="line"><a id="l00777" name="l00777"></a><span class="lineno">  777</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00778" name="l00778"></a><span class="lineno">  778</span><span class="comment">     * @brief operator &lt;&lt;= for uint128_t</span></div>
-<div class="line"><a id="l00779" name="l00779"></a><span class="lineno">  779</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00780" name="l00780"></a><span class="lineno">  780</span><span class="comment">     * @param p number denoting number of shifts</span></div>
-<div class="line"><a id="l00781" name="l00781"></a><span class="lineno">  781</span><span class="comment">     * @returns this shifted by p to left</span></div>
-<div class="line"><a id="l00782" name="l00782"></a><span class="lineno">  782</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00783" name="l00783"></a><span class="lineno">  783</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00784" name="l00784"></a><span class="lineno">  784</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00776" name="l00776"></a><span class="lineno">  776</span> </div>
+<div class="line"><a id="l00783" name="l00783"></a><span class="lineno">  783</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00784" name="l00784"></a><span class="lineno">  784</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00785" data-start="{" data-end="}">
 <div class="line"><a id="l00785" name="l00785"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a">  785</a></span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a">operator&lt;&lt;=</a>(<span class="keyword">const</span> T p) {</div>
 <div class="line"><a id="l00786" name="l00786"></a><span class="lineno">  786</span>        <span class="keywordflow">if</span> (p) {</div>
@@ -1002,15 +673,9 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00795" name="l00795"></a><span class="lineno">  795</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00796" name="l00796"></a><span class="lineno">  796</span>    }</div>
 </div>
-<div class="line"><a id="l00797" name="l00797"></a><span class="lineno">  797</span><span class="comment"></span> </div>
-<div class="line"><a id="l00798" name="l00798"></a><span class="lineno">  798</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00799" name="l00799"></a><span class="lineno">  799</span><span class="comment">     * @brief operator &gt;&gt; for uint128_t</span></div>
-<div class="line"><a id="l00800" name="l00800"></a><span class="lineno">  800</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00801" name="l00801"></a><span class="lineno">  801</span><span class="comment">     * @param p number denoting number of shifts</span></div>
-<div class="line"><a id="l00802" name="l00802"></a><span class="lineno">  802</span><span class="comment">     * @returns value of this shifted by p to right</span></div>
-<div class="line"><a id="l00803" name="l00803"></a><span class="lineno">  803</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00804" name="l00804"></a><span class="lineno">  804</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00805" name="l00805"></a><span class="lineno">  805</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00797" name="l00797"></a><span class="lineno">  797</span> </div>
+<div class="line"><a id="l00804" name="l00804"></a><span class="lineno">  804</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00805" name="l00805"></a><span class="lineno">  805</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00806" data-start="{" data-end="}">
 <div class="line"><a id="l00806" name="l00806"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848">  806</a></span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848">operator&gt;&gt;</a>(<span class="keyword">const</span> T p) {</div>
 <div class="line"><a id="l00807" name="l00807"></a><span class="lineno">  807</span>        <span class="keywordflow">if</span> (!p) {</div>
@@ -1024,15 +689,9 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00815" name="l00815"></a><span class="lineno">  815</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(0);</div>
 <div class="line"><a id="l00816" name="l00816"></a><span class="lineno">  816</span>    }</div>
 </div>
-<div class="line"><a id="l00817" name="l00817"></a><span class="lineno">  817</span><span class="comment"></span> </div>
-<div class="line"><a id="l00818" name="l00818"></a><span class="lineno">  818</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00819" name="l00819"></a><span class="lineno">  819</span><span class="comment">     * @brief operator &gt;&gt;= for uint128_t</span></div>
-<div class="line"><a id="l00820" name="l00820"></a><span class="lineno">  820</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00821" name="l00821"></a><span class="lineno">  821</span><span class="comment">     * @param p number denoting number of shifts</span></div>
-<div class="line"><a id="l00822" name="l00822"></a><span class="lineno">  822</span><span class="comment">     * @returns this shifted by p to right</span></div>
-<div class="line"><a id="l00823" name="l00823"></a><span class="lineno">  823</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00824" name="l00824"></a><span class="lineno">  824</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00825" name="l00825"></a><span class="lineno">  825</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00817" name="l00817"></a><span class="lineno">  817</span> </div>
+<div class="line"><a id="l00824" name="l00824"></a><span class="lineno">  824</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00825" name="l00825"></a><span class="lineno">  825</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00826" data-start="{" data-end="}">
 <div class="line"><a id="l00826" name="l00826"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9">  826</a></span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9">operator&gt;&gt;=</a>(<span class="keyword">const</span> T p) {</div>
 <div class="line"><a id="l00827" name="l00827"></a><span class="lineno">  827</span>        <span class="keywordflow">if</span> (p) {</div>
@@ -1047,38 +706,22 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00836" name="l00836"></a><span class="lineno">  836</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00837" name="l00837"></a><span class="lineno">  837</span>    }</div>
 </div>
-<div class="line"><a id="l00838" name="l00838"></a><span class="lineno">  838</span><span class="comment"></span> </div>
-<div class="line"><a id="l00839" name="l00839"></a><span class="lineno">  839</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00840" name="l00840"></a><span class="lineno">  840</span><span class="comment">     * @brief operator &amp; for uint128_t (bitwise operator)</span></div>
-<div class="line"><a id="l00841" name="l00841"></a><span class="lineno">  841</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00842" name="l00842"></a><span class="lineno">  842</span><span class="comment">     * @returns value of this &amp; p (&amp; is bit-wise operator)</span></div>
-<div class="line"><a id="l00843" name="l00843"></a><span class="lineno">  843</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00838" name="l00838"></a><span class="lineno">  838</span> </div>
 <div class="foldopen" id="foldopen00844" data-start="{" data-end="}">
 <div class="line"><a id="l00844" name="l00844"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244">  844</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244">operator&amp;</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) {</div>
 <div class="line"><a id="l00845" name="l00845"></a><span class="lineno">  845</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(this-&gt;f &amp; p.f, this-&gt;s &amp; p.s);</div>
 <div class="line"><a id="l00846" name="l00846"></a><span class="lineno">  846</span>    }</div>
 </div>
-<div class="line"><a id="l00847" name="l00847"></a><span class="lineno">  847</span><span class="comment"></span> </div>
-<div class="line"><a id="l00848" name="l00848"></a><span class="lineno">  848</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00849" name="l00849"></a><span class="lineno">  849</span><span class="comment">     * @brief operator &amp; for other types (bitwise operator)</span></div>
-<div class="line"><a id="l00850" name="l00850"></a><span class="lineno">  850</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00851" name="l00851"></a><span class="lineno">  851</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00852" name="l00852"></a><span class="lineno">  852</span><span class="comment">     * @returns value of this &amp; p (&amp; is bit-wise operator)</span></div>
-<div class="line"><a id="l00853" name="l00853"></a><span class="lineno">  853</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00854" name="l00854"></a><span class="lineno">  854</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00855" name="l00855"></a><span class="lineno">  855</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00847" name="l00847"></a><span class="lineno">  847</span> </div>
+<div class="line"><a id="l00854" name="l00854"></a><span class="lineno">  854</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00855" name="l00855"></a><span class="lineno">  855</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00856" data-start="{" data-end="}">
 <div class="line"><a id="l00856" name="l00856"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4">  856</a></span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4">operator&amp;</a>(<span class="keyword">const</span> T p) {</div>
 <div class="line"><a id="l00857" name="l00857"></a><span class="lineno">  857</span>        <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> tmp = *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00858" name="l00858"></a><span class="lineno">  858</span>        <span class="keywordflow">return</span> tmp &amp; <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p);</div>
 <div class="line"><a id="l00859" name="l00859"></a><span class="lineno">  859</span>    }</div>
 </div>
-<div class="line"><a id="l00860" name="l00860"></a><span class="lineno">  860</span><span class="comment"></span> </div>
-<div class="line"><a id="l00861" name="l00861"></a><span class="lineno">  861</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00862" name="l00862"></a><span class="lineno">  862</span><span class="comment">     * @brief operator &amp;= for uint128_t (bitwise operator)</span></div>
-<div class="line"><a id="l00863" name="l00863"></a><span class="lineno">  863</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00864" name="l00864"></a><span class="lineno">  864</span><span class="comment">     * @returns this = this &amp; p (&amp; is bit-wise operator)</span></div>
-<div class="line"><a id="l00865" name="l00865"></a><span class="lineno">  865</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00860" name="l00860"></a><span class="lineno">  860</span> </div>
 <div class="foldopen" id="foldopen00866" data-start="{" data-end="}">
 <div class="line"><a id="l00866" name="l00866"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050">  866</a></span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050">operator&amp;=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) {</div>
 <div class="line"><a id="l00867" name="l00867"></a><span class="lineno">  867</span>        this-&gt;f &amp;= p.f;</div>
@@ -1086,52 +729,30 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00869" name="l00869"></a><span class="lineno">  869</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00870" name="l00870"></a><span class="lineno">  870</span>    }</div>
 </div>
-<div class="line"><a id="l00871" name="l00871"></a><span class="lineno">  871</span><span class="comment"></span> </div>
-<div class="line"><a id="l00872" name="l00872"></a><span class="lineno">  872</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00873" name="l00873"></a><span class="lineno">  873</span><span class="comment">     * @brief operator &amp;= for other types (bitwise operator)</span></div>
-<div class="line"><a id="l00874" name="l00874"></a><span class="lineno">  874</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00875" name="l00875"></a><span class="lineno">  875</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00876" name="l00876"></a><span class="lineno">  876</span><span class="comment">     * @returns this = this &amp; p (&amp; is bit-wise operator)</span></div>
-<div class="line"><a id="l00877" name="l00877"></a><span class="lineno">  877</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00878" name="l00878"></a><span class="lineno">  878</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00879" name="l00879"></a><span class="lineno">  879</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00871" name="l00871"></a><span class="lineno">  871</span> </div>
+<div class="line"><a id="l00878" name="l00878"></a><span class="lineno">  878</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00879" name="l00879"></a><span class="lineno">  879</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00880" data-start="{" data-end="}">
 <div class="line"><a id="l00880" name="l00880"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640">  880</a></span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640">operator&amp;=</a>(<span class="keyword">const</span> T p) {</div>
 <div class="line"><a id="l00881" name="l00881"></a><span class="lineno">  881</span>        *<span class="keyword">this</span> &amp;= <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p);</div>
 <div class="line"><a id="l00882" name="l00882"></a><span class="lineno">  882</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00883" name="l00883"></a><span class="lineno">  883</span>    }</div>
 </div>
-<div class="line"><a id="l00884" name="l00884"></a><span class="lineno">  884</span><span class="comment"></span> </div>
-<div class="line"><a id="l00885" name="l00885"></a><span class="lineno">  885</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00886" name="l00886"></a><span class="lineno">  886</span><span class="comment">     * @brief operator | for other types (bitwise operator)</span></div>
-<div class="line"><a id="l00887" name="l00887"></a><span class="lineno">  887</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00888" name="l00888"></a><span class="lineno">  888</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00889" name="l00889"></a><span class="lineno">  889</span><span class="comment">     * @returns value of this | p (| is bit-wise operator)</span></div>
-<div class="line"><a id="l00890" name="l00890"></a><span class="lineno">  890</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00891" name="l00891"></a><span class="lineno">  891</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00892" name="l00892"></a><span class="lineno">  892</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00884" name="l00884"></a><span class="lineno">  884</span> </div>
+<div class="line"><a id="l00891" name="l00891"></a><span class="lineno">  891</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00892" name="l00892"></a><span class="lineno">  892</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00893" data-start="{" data-end="}">
 <div class="line"><a id="l00893" name="l00893"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304">  893</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304">operator|</a>(<span class="keyword">const</span> T p) {</div>
 <div class="line"><a id="l00894" name="l00894"></a><span class="lineno">  894</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p | s);</div>
 <div class="line"><a id="l00895" name="l00895"></a><span class="lineno">  895</span>    }</div>
 </div>
-<div class="line"><a id="l00896" name="l00896"></a><span class="lineno">  896</span><span class="comment"></span> </div>
-<div class="line"><a id="l00897" name="l00897"></a><span class="lineno">  897</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00898" name="l00898"></a><span class="lineno">  898</span><span class="comment">     * @brief operator | for uint128_t (bitwise operator)</span></div>
-<div class="line"><a id="l00899" name="l00899"></a><span class="lineno">  899</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00900" name="l00900"></a><span class="lineno">  900</span><span class="comment">     * @returns value of this | p (| is bit-wise OR operator)</span></div>
-<div class="line"><a id="l00901" name="l00901"></a><span class="lineno">  901</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00896" name="l00896"></a><span class="lineno">  896</span> </div>
 <div class="foldopen" id="foldopen00902" data-start="{" data-end="}">
 <div class="line"><a id="l00902" name="l00902"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd">  902</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd">operator|</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) {</div>
 <div class="line"><a id="l00903" name="l00903"></a><span class="lineno">  903</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(this-&gt;f | p.f, this-&gt;s | p.s);</div>
 <div class="line"><a id="l00904" name="l00904"></a><span class="lineno">  904</span>    }</div>
 </div>
-<div class="line"><a id="l00905" name="l00905"></a><span class="lineno">  905</span><span class="comment"></span> </div>
-<div class="line"><a id="l00906" name="l00906"></a><span class="lineno">  906</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00907" name="l00907"></a><span class="lineno">  907</span><span class="comment">     * @brief operator |= for uint128_t (bitwise operator)</span></div>
-<div class="line"><a id="l00908" name="l00908"></a><span class="lineno">  908</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00909" name="l00909"></a><span class="lineno">  909</span><span class="comment">     * @returns this = this | p (| is bit-wise OR operator)</span></div>
-<div class="line"><a id="l00910" name="l00910"></a><span class="lineno">  910</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00905" name="l00905"></a><span class="lineno">  905</span> </div>
 <div class="foldopen" id="foldopen00911" data-start="{" data-end="}">
 <div class="line"><a id="l00911" name="l00911"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d">  911</a></span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d">operator|=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) {</div>
 <div class="line"><a id="l00912" name="l00912"></a><span class="lineno">  912</span>        f |= p.f;</div>
@@ -1139,52 +760,30 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00914" name="l00914"></a><span class="lineno">  914</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00915" name="l00915"></a><span class="lineno">  915</span>    }</div>
 </div>
-<div class="line"><a id="l00916" name="l00916"></a><span class="lineno">  916</span><span class="comment"></span> </div>
-<div class="line"><a id="l00917" name="l00917"></a><span class="lineno">  917</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00918" name="l00918"></a><span class="lineno">  918</span><span class="comment">     * @brief operator |= for other types (bitwise operator)</span></div>
-<div class="line"><a id="l00919" name="l00919"></a><span class="lineno">  919</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00920" name="l00920"></a><span class="lineno">  920</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00921" name="l00921"></a><span class="lineno">  921</span><span class="comment">     * @returns this = this | p (| is bit-wise OR operator)</span></div>
-<div class="line"><a id="l00922" name="l00922"></a><span class="lineno">  922</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00923" name="l00923"></a><span class="lineno">  923</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00924" name="l00924"></a><span class="lineno">  924</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00916" name="l00916"></a><span class="lineno">  916</span> </div>
+<div class="line"><a id="l00923" name="l00923"></a><span class="lineno">  923</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00924" name="l00924"></a><span class="lineno">  924</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00925" data-start="{" data-end="}">
 <div class="line"><a id="l00925" name="l00925"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee">  925</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee">operator|=</a>(<span class="keyword">const</span> T p) {</div>
 <div class="line"><a id="l00926" name="l00926"></a><span class="lineno">  926</span>        s |= p.s;</div>
 <div class="line"><a id="l00927" name="l00927"></a><span class="lineno">  927</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00928" name="l00928"></a><span class="lineno">  928</span>    }</div>
 </div>
-<div class="line"><a id="l00929" name="l00929"></a><span class="lineno">  929</span><span class="comment"></span> </div>
-<div class="line"><a id="l00930" name="l00930"></a><span class="lineno">  930</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00931" name="l00931"></a><span class="lineno">  931</span><span class="comment">     * @brief operator ^ for other types (bitwise operator)</span></div>
-<div class="line"><a id="l00932" name="l00932"></a><span class="lineno">  932</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00933" name="l00933"></a><span class="lineno">  933</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00934" name="l00934"></a><span class="lineno">  934</span><span class="comment">     * @returns value of this ^ p (^ is bit-wise XOR operator)</span></div>
-<div class="line"><a id="l00935" name="l00935"></a><span class="lineno">  935</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00936" name="l00936"></a><span class="lineno">  936</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00937" name="l00937"></a><span class="lineno">  937</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00929" name="l00929"></a><span class="lineno">  929</span> </div>
+<div class="line"><a id="l00936" name="l00936"></a><span class="lineno">  936</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00937" name="l00937"></a><span class="lineno">  937</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00938" data-start="{" data-end="}">
 <div class="line"><a id="l00938" name="l00938"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37">  938</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37">operator^</a>(<span class="keyword">const</span> T p) {</div>
 <div class="line"><a id="l00939" name="l00939"></a><span class="lineno">  939</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(this-&gt;f, this-&gt;s ^ p);</div>
 <div class="line"><a id="l00940" name="l00940"></a><span class="lineno">  940</span>    }</div>
 </div>
-<div class="line"><a id="l00941" name="l00941"></a><span class="lineno">  941</span><span class="comment"></span> </div>
-<div class="line"><a id="l00942" name="l00942"></a><span class="lineno">  942</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00943" name="l00943"></a><span class="lineno">  943</span><span class="comment">     * @brief operator ^ for uint128_t (bitwise operator)</span></div>
-<div class="line"><a id="l00944" name="l00944"></a><span class="lineno">  944</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00945" name="l00945"></a><span class="lineno">  945</span><span class="comment">     * @returns value of this ^ p (^ is bit-wise XOR operator)</span></div>
-<div class="line"><a id="l00946" name="l00946"></a><span class="lineno">  946</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00941" name="l00941"></a><span class="lineno">  941</span> </div>
 <div class="foldopen" id="foldopen00947" data-start="{" data-end="}">
 <div class="line"><a id="l00947" name="l00947"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a9487ed06019d846add5dc8874e41eb8b">  947</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../db/d9a/classuint128__t.html#a9487ed06019d846add5dc8874e41eb8b">operator^</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) {</div>
 <div class="line"><a id="l00948" name="l00948"></a><span class="lineno">  948</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(this-&gt;f ^ p.f, this-&gt;s ^ p.s);</div>
 <div class="line"><a id="l00949" name="l00949"></a><span class="lineno">  949</span>    }</div>
 </div>
-<div class="line"><a id="l00950" name="l00950"></a><span class="lineno">  950</span><span class="comment"></span> </div>
-<div class="line"><a id="l00951" name="l00951"></a><span class="lineno">  951</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00952" name="l00952"></a><span class="lineno">  952</span><span class="comment">     * @brief operator ^= for uint128_t (bitwise operator)</span></div>
-<div class="line"><a id="l00953" name="l00953"></a><span class="lineno">  953</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00954" name="l00954"></a><span class="lineno">  954</span><span class="comment">     * @returns this = this ^ p (^ is bit-wise XOR operator)</span></div>
-<div class="line"><a id="l00955" name="l00955"></a><span class="lineno">  955</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00950" name="l00950"></a><span class="lineno">  950</span> </div>
 <div class="foldopen" id="foldopen00956" data-start="{" data-end="}">
 <div class="line"><a id="l00956" name="l00956"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a">  956</a></span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a">operator^=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) {</div>
 <div class="line"><a id="l00957" name="l00957"></a><span class="lineno">  957</span>        f ^= p.f;</div>
@@ -1192,37 +791,22 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00959" name="l00959"></a><span class="lineno">  959</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00960" name="l00960"></a><span class="lineno">  960</span>    }</div>
 </div>
-<div class="line"><a id="l00961" name="l00961"></a><span class="lineno">  961</span><span class="comment"></span> </div>
-<div class="line"><a id="l00962" name="l00962"></a><span class="lineno">  962</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00963" name="l00963"></a><span class="lineno">  963</span><span class="comment">     * @brief operator ^= for other types (bitwise operator)</span></div>
-<div class="line"><a id="l00964" name="l00964"></a><span class="lineno">  964</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00965" name="l00965"></a><span class="lineno">  965</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00966" name="l00966"></a><span class="lineno">  966</span><span class="comment">     * @returns this = this ^ p (^ is bit-wise XOR operator)</span></div>
-<div class="line"><a id="l00967" name="l00967"></a><span class="lineno">  967</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00968" name="l00968"></a><span class="lineno">  968</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00969" name="l00969"></a><span class="lineno">  969</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00961" name="l00961"></a><span class="lineno">  961</span> </div>
+<div class="line"><a id="l00968" name="l00968"></a><span class="lineno">  968</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00969" name="l00969"></a><span class="lineno">  969</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00970" data-start="{" data-end="}">
 <div class="line"><a id="l00970" name="l00970"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67">  970</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67">operator^=</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00971" name="l00971"></a><span class="lineno">  971</span>        s ^= p;</div>
 <div class="line"><a id="l00972" name="l00972"></a><span class="lineno">  972</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00973" name="l00973"></a><span class="lineno">  973</span>    }</div>
 </div>
-<div class="line"><a id="l00974" name="l00974"></a><span class="lineno">  974</span><span class="comment"></span> </div>
-<div class="line"><a id="l00975" name="l00975"></a><span class="lineno">  975</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00976" name="l00976"></a><span class="lineno">  976</span><span class="comment">     * @brief operator &lt;&lt; for printing uint128_t integer</span></div>
-<div class="line"><a id="l00977" name="l00977"></a><span class="lineno">  977</span><span class="comment">     * @details Prints the uint128_t integer in decimal form</span></div>
-<div class="line"><a id="l00978" name="l00978"></a><span class="lineno">  978</span><span class="comment">     * @note Note that this operator is costly since it uses strings to print</span></div>
-<div class="line"><a id="l00979" name="l00979"></a><span class="lineno">  979</span><span class="comment">     * the value</span></div>
-<div class="line"><a id="l00980" name="l00980"></a><span class="lineno">  980</span><span class="comment">     * @param op ostream object</span></div>
-<div class="line"><a id="l00981" name="l00981"></a><span class="lineno">  981</span><span class="comment">     * @param p 128-bit integer</span></div>
-<div class="line"><a id="l00982" name="l00982"></a><span class="lineno">  982</span><span class="comment">     * @returns op, ostream object.</span></div>
-<div class="line"><a id="l00983" name="l00983"></a><span class="lineno">  983</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00974" name="l00974"></a><span class="lineno">  974</span> </div>
 <div class="foldopen" id="foldopen00984" data-start="{" data-end="};">
-<div class="line"><a id="l00984" name="l00984"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953">  984</a></span>    <span class="keyword">friend</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;<a class="code hl_friend" href="../../db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953">operator&lt;&lt;</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;op, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) {</div>
+<div class="line"><a id="l00984" name="l00984"></a><span class="lineno"><a class="line" href="../../db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953">  984</a></span>    <span class="keyword">friend</span> std::ostream &amp;<a class="code hl_friend" href="../../db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953">operator&lt;&lt;</a>(std::ostream &amp;op, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p) {</div>
 <div class="line"><a id="l00985" name="l00985"></a><span class="lineno">  985</span>        <span class="keywordflow">if</span> (!p.f) {</div>
 <div class="line"><a id="l00986" name="l00986"></a><span class="lineno">  986</span>            op &lt;&lt; p.s;</div>
 <div class="line"><a id="l00987" name="l00987"></a><span class="lineno">  987</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00988" name="l00988"></a><span class="lineno">  988</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> out = <span class="stringliteral">&quot;0&quot;</span>, p_2 = <span class="stringliteral">&quot;1&quot;</span>;</div>
+<div class="line"><a id="l00988" name="l00988"></a><span class="lineno">  988</span>            std::string out = <span class="stringliteral">&quot;0&quot;</span>, p_2 = <span class="stringliteral">&quot;1&quot;</span>;</div>
 <div class="line"><a id="l00989" name="l00989"></a><span class="lineno">  989</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 64; ++i) {</div>
 <div class="line"><a id="l00990" name="l00990"></a><span class="lineno">  990</span>                <span class="keywordflow">if</span> (p.s &amp; (1LL &lt;&lt; i)) {</div>
 <div class="line"><a id="l00991" name="l00991"></a><span class="lineno">  991</span>                    out = <a class="code hl_function" href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a>(out, p_2);</div>
@@ -1244,199 +828,185 @@ $(function(){initNavTree('da/d41/uint128__t_8hpp_source.html','../../'); initRes
 </div>
 <div class="line"><a id="l01006" name="l01006"></a><span class="lineno"> 1006</span> </div>
 <div class="line"><a id="l01007" name="l01007"></a><span class="lineno"> 1007</span><span class="comment">// Arithmetic operators</span></div>
-<div class="line"><a id="l01008" name="l01008"></a><span class="lineno"> 1008</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01009" name="l01009"></a><span class="lineno"> 1009</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l01008" name="l01008"></a><span class="lineno"> 1008</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01009" name="l01009"></a><span class="lineno"> 1009</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01010" name="l01010"></a><span class="lineno"> 1010</span><span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> operator+(<span class="keyword">const</span> T &amp;p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
 <div class="line"><a id="l01011" name="l01011"></a><span class="lineno"> 1011</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) + q;</div>
 <div class="line"><a id="l01012" name="l01012"></a><span class="lineno"> 1012</span>}</div>
 <div class="line"><a id="l01013" name="l01013"></a><span class="lineno"> 1013</span> </div>
-<div class="line"><a id="l01014" name="l01014"></a><span class="lineno"> 1014</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01015" name="l01015"></a><span class="lineno"> 1015</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l01014" name="l01014"></a><span class="lineno"> 1014</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01015" name="l01015"></a><span class="lineno"> 1015</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01016" name="l01016"></a><span class="lineno"> 1016</span><span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> operator-(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
 <div class="line"><a id="l01017" name="l01017"></a><span class="lineno"> 1017</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) - q;</div>
 <div class="line"><a id="l01018" name="l01018"></a><span class="lineno"> 1018</span>}</div>
 <div class="line"><a id="l01019" name="l01019"></a><span class="lineno"> 1019</span> </div>
-<div class="line"><a id="l01020" name="l01020"></a><span class="lineno"> 1020</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01021" name="l01021"></a><span class="lineno"> 1021</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l01020" name="l01020"></a><span class="lineno"> 1020</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01021" name="l01021"></a><span class="lineno"> 1021</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01022" name="l01022"></a><span class="lineno"> 1022</span><span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> operator*(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
 <div class="line"><a id="l01023" name="l01023"></a><span class="lineno"> 1023</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) * q;</div>
 <div class="line"><a id="l01024" name="l01024"></a><span class="lineno"> 1024</span>}</div>
 <div class="line"><a id="l01025" name="l01025"></a><span class="lineno"> 1025</span> </div>
-<div class="line"><a id="l01026" name="l01026"></a><span class="lineno"> 1026</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01027" name="l01027"></a><span class="lineno"> 1027</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l01026" name="l01026"></a><span class="lineno"> 1026</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01027" name="l01027"></a><span class="lineno"> 1027</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01028" name="l01028"></a><span class="lineno"> 1028</span><span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> operator/(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
 <div class="line"><a id="l01029" name="l01029"></a><span class="lineno"> 1029</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) / q;</div>
 <div class="line"><a id="l01030" name="l01030"></a><span class="lineno"> 1030</span>}</div>
 <div class="line"><a id="l01031" name="l01031"></a><span class="lineno"> 1031</span> </div>
-<div class="line"><a id="l01032" name="l01032"></a><span class="lineno"> 1032</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01033" name="l01033"></a><span class="lineno"> 1033</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l01032" name="l01032"></a><span class="lineno"> 1032</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01033" name="l01033"></a><span class="lineno"> 1033</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01034" name="l01034"></a><span class="lineno"> 1034</span><span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> operator%(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
 <div class="line"><a id="l01035" name="l01035"></a><span class="lineno"> 1035</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) % q;</div>
 <div class="line"><a id="l01036" name="l01036"></a><span class="lineno"> 1036</span>}</div>
 <div class="line"><a id="l01037" name="l01037"></a><span class="lineno"> 1037</span> </div>
 <div class="line"><a id="l01038" name="l01038"></a><span class="lineno"> 1038</span><span class="comment">// Bitwise operators</span></div>
-<div class="line"><a id="l01039" name="l01039"></a><span class="lineno"> 1039</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01040" name="l01040"></a><span class="lineno"> 1040</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l01039" name="l01039"></a><span class="lineno"> 1039</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01040" name="l01040"></a><span class="lineno"> 1040</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01041" name="l01041"></a><span class="lineno"> 1041</span><span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> operator&amp;(<span class="keyword">const</span> T &amp;p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
 <div class="line"><a id="l01042" name="l01042"></a><span class="lineno"> 1042</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) &amp; q;</div>
 <div class="line"><a id="l01043" name="l01043"></a><span class="lineno"> 1043</span>}</div>
 <div class="line"><a id="l01044" name="l01044"></a><span class="lineno"> 1044</span> </div>
-<div class="line"><a id="l01045" name="l01045"></a><span class="lineno"> 1045</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01046" name="l01046"></a><span class="lineno"> 1046</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l01045" name="l01045"></a><span class="lineno"> 1045</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01046" name="l01046"></a><span class="lineno"> 1046</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01047" name="l01047"></a><span class="lineno"> 1047</span><span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> operator|(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
 <div class="line"><a id="l01048" name="l01048"></a><span class="lineno"> 1048</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) | q;</div>
 <div class="line"><a id="l01049" name="l01049"></a><span class="lineno"> 1049</span>}</div>
 <div class="line"><a id="l01050" name="l01050"></a><span class="lineno"> 1050</span> </div>
-<div class="line"><a id="l01051" name="l01051"></a><span class="lineno"> 1051</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01052" name="l01052"></a><span class="lineno"> 1052</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l01051" name="l01051"></a><span class="lineno"> 1051</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01052" name="l01052"></a><span class="lineno"> 1052</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01053" name="l01053"></a><span class="lineno"> 1053</span><span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> operator^(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
 <div class="line"><a id="l01054" name="l01054"></a><span class="lineno"> 1054</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) ^ q;</div>
 <div class="line"><a id="l01055" name="l01055"></a><span class="lineno"> 1055</span>}</div>
 <div class="line"><a id="l01056" name="l01056"></a><span class="lineno"> 1056</span> </div>
 <div class="line"><a id="l01057" name="l01057"></a><span class="lineno"> 1057</span><span class="comment">// Boolean operators</span></div>
-<div class="line"><a id="l01058" name="l01058"></a><span class="lineno"> 1058</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01059" name="l01059"></a><span class="lineno"> 1059</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l01058" name="l01058"></a><span class="lineno"> 1058</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01059" name="l01059"></a><span class="lineno"> 1059</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01060" name="l01060"></a><span class="lineno"> 1060</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> operator&amp;&amp;(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
 <div class="line"><a id="l01061" name="l01061"></a><span class="lineno"> 1061</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) &amp;&amp; q;</div>
 <div class="line"><a id="l01062" name="l01062"></a><span class="lineno"> 1062</span>}</div>
 <div class="line"><a id="l01063" name="l01063"></a><span class="lineno"> 1063</span> </div>
-<div class="line"><a id="l01064" name="l01064"></a><span class="lineno"> 1064</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01065" name="l01065"></a><span class="lineno"> 1065</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l01064" name="l01064"></a><span class="lineno"> 1064</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01065" name="l01065"></a><span class="lineno"> 1065</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01066" name="l01066"></a><span class="lineno"> 1066</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> operator||(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
 <div class="line"><a id="l01067" name="l01067"></a><span class="lineno"> 1067</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) || q;</div>
 <div class="line"><a id="l01068" name="l01068"></a><span class="lineno"> 1068</span>}</div>
 <div class="line"><a id="l01069" name="l01069"></a><span class="lineno"> 1069</span> </div>
 <div class="line"><a id="l01070" name="l01070"></a><span class="lineno"> 1070</span><span class="comment">// Comparison operators</span></div>
-<div class="line"><a id="l01071" name="l01071"></a><span class="lineno"> 1071</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01072" name="l01072"></a><span class="lineno"> 1072</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l01071" name="l01071"></a><span class="lineno"> 1071</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01072" name="l01072"></a><span class="lineno"> 1072</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01073" name="l01073"></a><span class="lineno"> 1073</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> operator==(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
 <div class="line"><a id="l01074" name="l01074"></a><span class="lineno"> 1074</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) == q;</div>
 <div class="line"><a id="l01075" name="l01075"></a><span class="lineno"> 1075</span>}</div>
 <div class="line"><a id="l01076" name="l01076"></a><span class="lineno"> 1076</span> </div>
-<div class="line"><a id="l01077" name="l01077"></a><span class="lineno"> 1077</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01078" name="l01078"></a><span class="lineno"> 1078</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
-<div class="line"><a id="l01079" name="l01079"></a><span class="lineno"> 1079</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html">operator!=</a>(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
+<div class="line"><a id="l01077" name="l01077"></a><span class="lineno"> 1077</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01078" name="l01078"></a><span class="lineno"> 1078</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
+<div class="line"><a id="l01079" name="l01079"></a><span class="lineno"> 1079</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> operator!=(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
 <div class="line"><a id="l01080" name="l01080"></a><span class="lineno"> 1080</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) != q;</div>
 <div class="line"><a id="l01081" name="l01081"></a><span class="lineno"> 1081</span>}</div>
 <div class="line"><a id="l01082" name="l01082"></a><span class="lineno"> 1082</span> </div>
-<div class="line"><a id="l01083" name="l01083"></a><span class="lineno"> 1083</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01084" name="l01084"></a><span class="lineno"> 1084</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l01083" name="l01083"></a><span class="lineno"> 1083</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01084" name="l01084"></a><span class="lineno"> 1084</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01085" name="l01085"></a><span class="lineno"> 1085</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> operator&lt;(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
 <div class="line"><a id="l01086" name="l01086"></a><span class="lineno"> 1086</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) &lt; q;</div>
 <div class="line"><a id="l01087" name="l01087"></a><span class="lineno"> 1087</span>}</div>
 <div class="line"><a id="l01088" name="l01088"></a><span class="lineno"> 1088</span> </div>
-<div class="line"><a id="l01089" name="l01089"></a><span class="lineno"> 1089</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01090" name="l01090"></a><span class="lineno"> 1090</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
-<div class="line"><a id="l01091" name="l01091"></a><span class="lineno"> 1091</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html">operator&lt;=</a>(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
+<div class="line"><a id="l01089" name="l01089"></a><span class="lineno"> 1089</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01090" name="l01090"></a><span class="lineno"> 1090</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
+<div class="line"><a id="l01091" name="l01091"></a><span class="lineno"> 1091</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> operator&lt;=(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
 <div class="line"><a id="l01092" name="l01092"></a><span class="lineno"> 1092</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) &lt;= q;</div>
 <div class="line"><a id="l01093" name="l01093"></a><span class="lineno"> 1093</span>}</div>
 <div class="line"><a id="l01094" name="l01094"></a><span class="lineno"> 1094</span> </div>
-<div class="line"><a id="l01095" name="l01095"></a><span class="lineno"> 1095</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01096" name="l01096"></a><span class="lineno"> 1096</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
-<div class="line"><a id="l01097" name="l01097"></a><span class="lineno"> 1097</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html">operator&gt;</a>(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
+<div class="line"><a id="l01095" name="l01095"></a><span class="lineno"> 1095</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01096" name="l01096"></a><span class="lineno"> 1096</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
+<div class="line"><a id="l01097" name="l01097"></a><span class="lineno"> 1097</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> operator&gt;(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
 <div class="line"><a id="l01098" name="l01098"></a><span class="lineno"> 1098</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) &gt; q;</div>
 <div class="line"><a id="l01099" name="l01099"></a><span class="lineno"> 1099</span>}</div>
 <div class="line"><a id="l01100" name="l01100"></a><span class="lineno"> 1100</span> </div>
-<div class="line"><a id="l01101" name="l01101"></a><span class="lineno"> 1101</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01102" name="l01102"></a><span class="lineno"> 1102</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
-<div class="line"><a id="l01103" name="l01103"></a><span class="lineno"> 1103</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html">operator&gt;=</a>(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
+<div class="line"><a id="l01101" name="l01101"></a><span class="lineno"> 1101</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01102" name="l01102"></a><span class="lineno"> 1102</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
+<div class="line"><a id="l01103" name="l01103"></a><span class="lineno"> 1103</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> operator&gt;=(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;q) {</div>
 <div class="line"><a id="l01104" name="l01104"></a><span class="lineno"> 1104</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p) &gt;= q;</div>
 <div class="line"><a id="l01105" name="l01105"></a><span class="lineno"> 1105</span>}</div>
 <div class="line"><a id="l01106" name="l01106"></a><span class="lineno"> 1106</span> </div>
 <div class="line"><a id="l01107" name="l01107"></a><span class="lineno"> 1107</span><span class="preprocessor">#endif  </span><span class="comment">// CIPHERS_UINT128_T_HPP_</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::ostream</a></div></div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">std::string::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aclassuint128__t_html"><div class="ttname"><a href="../../db/d9a/classuint128__t.html">uint128_t</a></div><div class="ttdoc">class for 128-bit unsigned integer</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:60</div></div>
-<div class="ttc" id="aclassuint128__t_html_a0500a90bcde5a8254750c361eed9bc40"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40">uint128_t::operator%=</a></div><div class="ttdeci">uint128_t &amp; operator%=(const T &amp;p)</div><div class="ttdoc">operator %= for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:565</div></div>
-<div class="ttc" id="aclassuint128__t_html_a07945fe010079a35e18812636d5c70c3"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3">uint128_t::operator-</a></div><div class="ttdeci">uint128_t operator-()</div><div class="ttdoc">operator - using twos complement</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:338</div></div>
-<div class="ttc" id="aclassuint128__t_html_a0a4623fae71566dfcf2e742c8c156798"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798">uint128_t::operator-=</a></div><div class="ttdeci">uint128_t &amp; operator-=(const T &amp;p)</div><div class="ttdoc">operator -= for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:366</div></div>
-<div class="ttc" id="aclassuint128__t_html_a0ad881643c707f6ae3c5de3822a8cb8a"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a">uint128_t::operator&amp;&amp;</a></div><div class="ttdeci">bool operator&amp;&amp;(const T b)</div><div class="ttdoc">operator &amp;&amp; for other types</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:734</div></div>
-<div class="ttc" id="aclassuint128__t_html_a0ae5fc0c2bcc9138b32d7582466aa7f9"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9">uint128_t::operator&gt;&gt;=</a></div><div class="ttdeci">uint128_t &amp; operator&gt;&gt;=(const T p)</div><div class="ttdoc">operator &gt;&gt;= for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:826</div></div>
-<div class="ttc" id="aclassuint128__t_html_a0b6612186d8f678452e011d08ee1f5ac"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac">uint128_t::uint128_t</a></div><div class="ttdeci">uint128_t(const std::string &amp;str)</div><div class="ttdoc">Parameterized constructor.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:107</div></div>
-<div class="ttc" id="aclassuint128__t_html_a0fd125cc2b7702370a4aefa740d57606"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606">uint128_t::operator+</a></div><div class="ttdeci">uint128_t operator+(const uint128_t &amp;p)</div><div class="ttdoc">operator + for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:262</div></div>
-<div class="ttc" id="aclassuint128__t_html_a16e7e1211ba6c27e9a229d97fb0d9190"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190">uint128_t::operator&lt;&lt;</a></div><div class="ttdeci">uint128_t operator&lt;&lt;(const T p)</div><div class="ttdoc">operator &lt;&lt; for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:765</div></div>
-<div class="ttc" id="aclassuint128__t_html_a16eb351c1d0ed3b89c771c63808e035a"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a">uint128_t::operator&lt;=</a></div><div class="ttdeci">bool operator&lt;=(const uint128_t &amp;other)</div><div class="ttdoc">operator &lt;= for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:584</div></div>
-<div class="ttc" id="aclassuint128__t_html_a1d390c6ea5450680dcaff341235f0fed"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed">uint128_t::operator--</a></div><div class="ttdeci">uint128_t &amp; operator--()</div><div class="ttdoc">operator – (pre-decrement)</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:344</div></div>
-<div class="ttc" id="aclassuint128__t_html_a1ee2f1ffbd9984faad34883eb45e9705"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">uint128_t::upper</a></div><div class="ttdeci">uint64_t upper() const</div><div class="ttdoc">returns upper 64-bit integer part</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:208</div></div>
-<div class="ttc" id="aclassuint128__t_html_a225146042c6456a3c5595645870ca640"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640">uint128_t::operator&amp;=</a></div><div class="ttdeci">uint128_t &amp; operator&amp;=(const T p)</div><div class="ttdoc">operator &amp;= for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:880</div></div>
-<div class="ttc" id="aclassuint128__t_html_a279209a184db20a7ffc8e687fdb05be2"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2">uint128_t::operator%=</a></div><div class="ttdeci">uint128_t &amp; operator%=(const uint128_t &amp;p)</div><div class="ttdoc">operator %= for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:552</div></div>
-<div class="ttc" id="aclassuint128__t_html_a291d2787d668e8d06a7cfab0f5144440"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440">uint128_t::operator&gt;</a></div><div class="ttdeci">bool operator&gt;(const uint128_t &amp;other)</div><div class="ttdoc">operator &gt; for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:593</div></div>
-<div class="ttc" id="aclassuint128__t_html_a2ecb71686e1c9ed0267124580c91c414"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a2ecb71686e1c9ed0267124580c91c414">uint128_t::operator--</a></div><div class="ttdeci">uint128_t operator--(int p)</div><div class="ttdoc">operator – (post-decrement)</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:353</div></div>
-<div class="ttc" id="aclassuint128__t_html_a2fda65032d9fdbaf9142a6322654dbdd"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd">uint128_t::operator|</a></div><div class="ttdeci">uint128_t operator|(const uint128_t &amp;p)</div><div class="ttdoc">operator | for uint128_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:902</div></div>
-<div class="ttc" id="aclassuint128__t_html_a300ed88fe2054788cc6e0b6a8fdf66db"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db">uint128_t::operator/=</a></div><div class="ttdeci">uint128_t &amp; operator/=(const uint128_t &amp;p)</div><div class="ttdoc">operator /= for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:510</div></div>
-<div class="ttc" id="aclassuint128__t_html_a3016b71f92a0c7e090a7c5b6a3935092"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092">uint128_t::operator*=</a></div><div class="ttdeci">uint128_t &amp; operator*=(const T p)</div><div class="ttdoc">operator *= for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:424</div></div>
-<div class="ttc" id="aclassuint128__t_html_a3072a7e43da3600c345c81bc80c957ee"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee">uint128_t::operator/</a></div><div class="ttdeci">uint128_t operator/(const uint128_t &amp;p)</div><div class="ttdoc">operator / for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:489</div></div>
-<div class="ttc" id="aclassuint128__t_html_a312509b1c5b3ae5eaaf342f2ba131d03"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03">uint128_t::operator||</a></div><div class="ttdeci">bool operator||(const uint128_t &amp;b)</div><div class="ttdoc">operator || for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:644</div></div>
-<div class="ttc" id="aclassuint128__t_html_a334bc710f411f108a0243b24ac73b481"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481">uint128_t::operator&gt;=</a></div><div class="ttdeci">bool operator&gt;=(const T other)</div><div class="ttdoc">operator &gt;= for other types</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:698</div></div>
+<div class="ttc" id="aclassuint128__t_html"><div class="ttname"><a href="../../db/d9a/classuint128__t.html">uint128_t</a></div><div class="ttdoc">class for 128-bit unsigned integer</div><div class="ttdef"><b>Definition</b> <a href="#l00060">uint128_t.hpp:60</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a0500a90bcde5a8254750c361eed9bc40"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40">uint128_t::operator%=</a></div><div class="ttdeci">uint128_t &amp; operator%=(const T &amp;p)</div><div class="ttdoc">operator %= for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00565">uint128_t.hpp:565</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a07945fe010079a35e18812636d5c70c3"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3">uint128_t::operator-</a></div><div class="ttdeci">uint128_t operator-()</div><div class="ttdoc">operator - using twos complement</div><div class="ttdef"><b>Definition</b> <a href="#l00338">uint128_t.hpp:338</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a0a4623fae71566dfcf2e742c8c156798"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798">uint128_t::operator-=</a></div><div class="ttdeci">uint128_t &amp; operator-=(const T &amp;p)</div><div class="ttdoc">operator -= for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00366">uint128_t.hpp:366</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a0ad881643c707f6ae3c5de3822a8cb8a"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a">uint128_t::operator&amp;&amp;</a></div><div class="ttdeci">bool operator&amp;&amp;(const T b)</div><div class="ttdoc">operator &amp;&amp; for other types</div><div class="ttdef"><b>Definition</b> <a href="#l00734">uint128_t.hpp:734</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a0ae5fc0c2bcc9138b32d7582466aa7f9"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9">uint128_t::operator&gt;&gt;=</a></div><div class="ttdeci">uint128_t &amp; operator&gt;&gt;=(const T p)</div><div class="ttdoc">operator &gt;&gt;= for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00826">uint128_t.hpp:826</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a0b6612186d8f678452e011d08ee1f5ac"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac">uint128_t::uint128_t</a></div><div class="ttdeci">uint128_t(const std::string &amp;str)</div><div class="ttdoc">Parameterized constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00107">uint128_t.hpp:107</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a0fd125cc2b7702370a4aefa740d57606"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606">uint128_t::operator+</a></div><div class="ttdeci">uint128_t operator+(const uint128_t &amp;p)</div><div class="ttdoc">operator + for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00262">uint128_t.hpp:262</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a16e7e1211ba6c27e9a229d97fb0d9190"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190">uint128_t::operator&lt;&lt;</a></div><div class="ttdeci">uint128_t operator&lt;&lt;(const T p)</div><div class="ttdoc">operator &lt;&lt; for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00765">uint128_t.hpp:765</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a16eb351c1d0ed3b89c771c63808e035a"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a">uint128_t::operator&lt;=</a></div><div class="ttdeci">bool operator&lt;=(const uint128_t &amp;other)</div><div class="ttdoc">operator &lt;= for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00584">uint128_t.hpp:584</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a1d390c6ea5450680dcaff341235f0fed"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed">uint128_t::operator--</a></div><div class="ttdeci">uint128_t &amp; operator--()</div><div class="ttdoc">operator – (pre-decrement)</div><div class="ttdef"><b>Definition</b> <a href="#l00344">uint128_t.hpp:344</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a1ee2f1ffbd9984faad34883eb45e9705"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">uint128_t::upper</a></div><div class="ttdeci">uint64_t upper() const</div><div class="ttdoc">returns upper 64-bit integer part</div><div class="ttdef"><b>Definition</b> <a href="#l00208">uint128_t.hpp:208</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a225146042c6456a3c5595645870ca640"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640">uint128_t::operator&amp;=</a></div><div class="ttdeci">uint128_t &amp; operator&amp;=(const T p)</div><div class="ttdoc">operator &amp;= for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00880">uint128_t.hpp:880</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a279209a184db20a7ffc8e687fdb05be2"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2">uint128_t::operator%=</a></div><div class="ttdeci">uint128_t &amp; operator%=(const uint128_t &amp;p)</div><div class="ttdoc">operator %= for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00552">uint128_t.hpp:552</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a291d2787d668e8d06a7cfab0f5144440"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440">uint128_t::operator&gt;</a></div><div class="ttdeci">bool operator&gt;(const uint128_t &amp;other)</div><div class="ttdoc">operator &gt; for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00593">uint128_t.hpp:593</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a2ecb71686e1c9ed0267124580c91c414"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a2ecb71686e1c9ed0267124580c91c414">uint128_t::operator--</a></div><div class="ttdeci">uint128_t operator--(int p)</div><div class="ttdoc">operator – (post-decrement)</div><div class="ttdef"><b>Definition</b> <a href="#l00353">uint128_t.hpp:353</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a2fda65032d9fdbaf9142a6322654dbdd"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd">uint128_t::operator|</a></div><div class="ttdeci">uint128_t operator|(const uint128_t &amp;p)</div><div class="ttdoc">operator | for uint128_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00902">uint128_t.hpp:902</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a300ed88fe2054788cc6e0b6a8fdf66db"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db">uint128_t::operator/=</a></div><div class="ttdeci">uint128_t &amp; operator/=(const uint128_t &amp;p)</div><div class="ttdoc">operator /= for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00510">uint128_t.hpp:510</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a3016b71f92a0c7e090a7c5b6a3935092"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092">uint128_t::operator*=</a></div><div class="ttdeci">uint128_t &amp; operator*=(const T p)</div><div class="ttdoc">operator *= for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00424">uint128_t.hpp:424</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a3072a7e43da3600c345c81bc80c957ee"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee">uint128_t::operator/</a></div><div class="ttdeci">uint128_t operator/(const uint128_t &amp;p)</div><div class="ttdoc">operator / for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00489">uint128_t.hpp:489</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a312509b1c5b3ae5eaaf342f2ba131d03"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03">uint128_t::operator||</a></div><div class="ttdeci">bool operator||(const uint128_t &amp;b)</div><div class="ttdoc">operator || for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00644">uint128_t.hpp:644</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a334bc710f411f108a0243b24ac73b481"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481">uint128_t::operator&gt;=</a></div><div class="ttdeci">bool operator&gt;=(const T other)</div><div class="ttdoc">operator &gt;= for other types</div><div class="ttdef"><b>Definition</b> <a href="#l00698">uint128_t.hpp:698</a></div></div>
 <div class="ttc" id="aclassuint128__t_html_a3c4a7e775a0820196fc08303bbeed44a"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a3c4a7e775a0820196fc08303bbeed44a">uint128_t::operator=</a></div><div class="ttdeci">uint128_t &amp; operator=(uint128_t &amp;&amp;p)=default</div><div class="ttdoc">Move assignment operator.</div></div>
-<div class="ttc" id="aclassuint128__t_html_a3facc74d6d078604fe2c80d0abfd3304"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304">uint128_t::operator|</a></div><div class="ttdeci">uint128_t operator|(const T p)</div><div class="ttdoc">operator | for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:893</div></div>
+<div class="ttc" id="aclassuint128__t_html_a3facc74d6d078604fe2c80d0abfd3304"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304">uint128_t::operator|</a></div><div class="ttdeci">uint128_t operator|(const T p)</div><div class="ttdoc">operator | for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00893">uint128_t.hpp:893</a></div></div>
 <div class="ttc" id="aclassuint128__t_html_a4147188abcdcdb12c61bfbe4e4c0a363"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a4147188abcdcdb12c61bfbe4e4c0a363">uint128_t::~uint128_t</a></div><div class="ttdeci">~uint128_t()=default</div><div class="ttdoc">Destructor for uint128_t.</div></div>
-<div class="ttc" id="aclassuint128__t_html_a43eafd4824666b413befe5edbc90ae7f"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f">uint128_t::operator~</a></div><div class="ttdeci">uint128_t operator~()</div><div class="ttdoc">operator ~ for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:755</div></div>
-<div class="ttc" id="aclassuint128__t_html_a44e472cf685cac6edc5172eac2e66860"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860">uint128_t::operator*</a></div><div class="ttdeci">uint128_t operator*(const uint128_t &amp;p)</div><div class="ttdoc">operator * for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:402</div></div>
-<div class="ttc" id="aclassuint128__t_html_a44fd2a4a4cc1d13f93ac222db5a46c67"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67">uint128_t::operator^=</a></div><div class="ttdeci">uint128_t &amp; operator^=(const T &amp;p)</div><div class="ttdoc">operator ^= for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:970</div></div>
-<div class="ttc" id="aclassuint128__t_html_a4562c218813c8705bccb25d8786ca77c"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c">uint128_t::operator&lt;=</a></div><div class="ttdeci">bool operator&lt;=(const T other)</div><div class="ttdoc">operator &lt;= for other types</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:674</div></div>
-<div class="ttc" id="aclassuint128__t_html_a488e65a14d4c32a096011aa4725cdb30"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30">uint128_t::operator*</a></div><div class="ttdeci">uint128_t operator*(const T p)</div><div class="ttdoc">operator * for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:393</div></div>
-<div class="ttc" id="aclassuint128__t_html_a5133f854a93efe47fd1f0f6a9589856d"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d">uint128_t::operator+</a></div><div class="ttdeci">uint128_t operator+(const T p)</div><div class="ttdoc">operator + for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:253</div></div>
-<div class="ttc" id="aclassuint128__t_html_a55a3f122c4d982c60c2eb9fc09b9e004"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004">uint128_t::operator+=</a></div><div class="ttdeci">uint128_t &amp; operator+=(const T p)</div><div class="ttdoc">operator += for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:274</div></div>
-<div class="ttc" id="aclassuint128__t_html_a56f579c802a6cc16f31e43af274453dc"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc">uint128_t::operator&lt;</a></div><div class="ttdeci">bool operator&lt;(const T other)</div><div class="ttdoc">operator &lt; for other types</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:662</div></div>
-<div class="ttc" id="aclassuint128__t_html_a5f2ace9fdcd459f74f8e43ef30a2a953"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953">uint128_t::operator&lt;&lt;</a></div><div class="ttdeci">friend std::ostream &amp; operator&lt;&lt;(std::ostream &amp;op, const uint128_t &amp;p)</div><div class="ttdoc">operator &lt;&lt; for printing uint128_t integer</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:984</div></div>
+<div class="ttc" id="aclassuint128__t_html_a43eafd4824666b413befe5edbc90ae7f"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f">uint128_t::operator~</a></div><div class="ttdeci">uint128_t operator~()</div><div class="ttdoc">operator ~ for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00755">uint128_t.hpp:755</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a44e472cf685cac6edc5172eac2e66860"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860">uint128_t::operator*</a></div><div class="ttdeci">uint128_t operator*(const uint128_t &amp;p)</div><div class="ttdoc">operator * for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00402">uint128_t.hpp:402</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a44fd2a4a4cc1d13f93ac222db5a46c67"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67">uint128_t::operator^=</a></div><div class="ttdeci">uint128_t &amp; operator^=(const T &amp;p)</div><div class="ttdoc">operator ^= for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00970">uint128_t.hpp:970</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a4562c218813c8705bccb25d8786ca77c"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c">uint128_t::operator&lt;=</a></div><div class="ttdeci">bool operator&lt;=(const T other)</div><div class="ttdoc">operator &lt;= for other types</div><div class="ttdef"><b>Definition</b> <a href="#l00674">uint128_t.hpp:674</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a488e65a14d4c32a096011aa4725cdb30"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30">uint128_t::operator*</a></div><div class="ttdeci">uint128_t operator*(const T p)</div><div class="ttdoc">operator * for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00393">uint128_t.hpp:393</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a5133f854a93efe47fd1f0f6a9589856d"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d">uint128_t::operator+</a></div><div class="ttdeci">uint128_t operator+(const T p)</div><div class="ttdoc">operator + for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00253">uint128_t.hpp:253</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a55a3f122c4d982c60c2eb9fc09b9e004"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004">uint128_t::operator+=</a></div><div class="ttdeci">uint128_t &amp; operator+=(const T p)</div><div class="ttdoc">operator += for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00274">uint128_t.hpp:274</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a56f579c802a6cc16f31e43af274453dc"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc">uint128_t::operator&lt;</a></div><div class="ttdeci">bool operator&lt;(const T other)</div><div class="ttdoc">operator &lt; for other types</div><div class="ttdef"><b>Definition</b> <a href="#l00662">uint128_t.hpp:662</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a5f2ace9fdcd459f74f8e43ef30a2a953"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953">uint128_t::operator&lt;&lt;</a></div><div class="ttdeci">friend std::ostream &amp; operator&lt;&lt;(std::ostream &amp;op, const uint128_t &amp;p)</div><div class="ttdoc">operator &lt;&lt; for printing uint128_t integer</div><div class="ttdef"><b>Definition</b> <a href="#l00984">uint128_t.hpp:984</a></div></div>
 <div class="ttc" id="aclassuint128__t_html_a60bf2739c93bb1cd41654fd60c76ae6b"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b">uint128_t::uint128_t</a></div><div class="ttdeci">uint128_t(const uint128_t &amp;num)=default</div><div class="ttdoc">Copy constructor.</div></div>
-<div class="ttc" id="aclassuint128__t_html_a6110aa452a6d114fcd2f42d2bc106fee"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee">uint128_t::operator|=</a></div><div class="ttdeci">uint128_t &amp; operator|=(const T p)</div><div class="ttdoc">operator |= for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:925</div></div>
-<div class="ttc" id="aclassuint128__t_html_a6824700c9c732a4200e7493fe7ed0eec"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec">uint128_t::operator-</a></div><div class="ttdeci">uint128_t operator-(const T &amp;p)</div><div class="ttdoc">operator - for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:319</div></div>
-<div class="ttc" id="aclassuint128__t_html_a6f24982de03e0e3d04ac7f8ae30f5848"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848">uint128_t::operator&gt;&gt;</a></div><div class="ttdeci">uint128_t operator&gt;&gt;(const T p)</div><div class="ttdoc">operator &gt;&gt; for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:806</div></div>
-<div class="ttc" id="aclassuint128__t_html_a7737bb30a5480c7286546b911d82e696"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696">uint128_t::operator!=</a></div><div class="ttdeci">bool operator!=(const T other)</div><div class="ttdoc">operator != for other types</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:722</div></div>
-<div class="ttc" id="aclassuint128__t_html_a7a95e3accdac1cb38c9767f9550c0896"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896">uint128_t::operator==</a></div><div class="ttdeci">bool operator==(const T other)</div><div class="ttdoc">operator == for other types</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:710</div></div>
-<div class="ttc" id="aclassuint128__t_html_a7b1de5584505c189664d0edd306e979e"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e">uint128_t::operator==</a></div><div class="ttdeci">bool operator==(const uint128_t &amp;other)</div><div class="ttdoc">operator == for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:611</div></div>
-<div class="ttc" id="aclassuint128__t_html_a7d2285a8a6e20b77f82f1f0351afe76e"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e">uint128_t::_trz</a></div><div class="ttdeci">uint32_t _trz()</div><div class="ttdoc">Trailing zeroes in binary.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:163</div></div>
-<div class="ttc" id="aclassuint128__t_html_a7d56143b2e291e8087188192533d2e3c"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a7d56143b2e291e8087188192533d2e3c">uint128_t::uint128_t</a></div><div class="ttdeci">uint128_t(uint128_t &amp;&amp;num) noexcept</div><div class="ttdoc">Move constructor.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:128</div></div>
-<div class="ttc" id="aclassuint128__t_html_a817b66c32268cf46244058a50db99503"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503">uint128_t::operator||</a></div><div class="ttdeci">bool operator||(const T b)</div><div class="ttdoc">operator || for other types</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:747</div></div>
-<div class="ttc" id="aclassuint128__t_html_a81a568510e6d0b0950133dd9fc37fc0c"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c">uint128_t::operator-</a></div><div class="ttdeci">uint128_t operator-(const uint128_t &amp;p)</div><div class="ttdoc">operator - for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:329</div></div>
-<div class="ttc" id="aclassuint128__t_html_a82c63f8c18b8d2d255b8b0d373ac7d6e"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e">uint128_t::operator&gt;</a></div><div class="ttdeci">bool operator&gt;(const T other)</div><div class="ttdoc">operator &gt; for other types</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:686</div></div>
-<div class="ttc" id="aclassuint128__t_html_a857a3c69c1e775a1bd3935c2bfbb02df"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df">uint128_t::__get_integer_from_string</a></div><div class="ttdeci">void __get_integer_from_string(const std::string &amp;str)</div><div class="ttdoc">First and second half of 128 bit number.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:70</div></div>
-<div class="ttc" id="aclassuint128__t_html_a8bf81f7f5f5c98f197822ec88e106c6c"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c">uint128_t::divide</a></div><div class="ttdeci">std::pair&lt; uint128_t, uint128_t &gt; divide(const uint128_t &amp;p)</div><div class="ttdoc">divide function for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:455</div></div>
-<div class="ttc" id="aclassuint128__t_html_a9487ed06019d846add5dc8874e41eb8b"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a9487ed06019d846add5dc8874e41eb8b">uint128_t::operator^</a></div><div class="ttdeci">uint128_t operator^(const uint128_t &amp;p)</div><div class="ttdoc">operator ^ for uint128_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:947</div></div>
-<div class="ttc" id="aclassuint128__t_html_a95ac8be8f414fcbce09301b912f5079d"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a95ac8be8f414fcbce09301b912f5079d">uint128_t::uint128_t</a></div><div class="ttdeci">uint128_t(const uint64_t high, const uint64_t low)</div><div class="ttdoc">Parameterized constructor.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:116</div></div>
-<div class="ttc" id="aclassuint128__t_html_a96fc7c2df4325bb1a0c22b566bcc6295"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295">uint128_t::operator*=</a></div><div class="ttdeci">uint128_t &amp; operator*=(const uint128_t &amp;p)</div><div class="ttdoc">operator *= for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:434</div></div>
-<div class="ttc" id="aclassuint128__t_html_a9704e6a4d32750461bff663e40e537cb"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb">uint128_t::operator+=</a></div><div class="ttdeci">uint128_t &amp; operator+=(const uint128_t &amp;p)</div><div class="ttdoc">operator += for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:286</div></div>
-<div class="ttc" id="aclassuint128__t_html_a9fa81ef0d54ecb9050d0be4249358ca4"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4">uint128_t::operator&amp;</a></div><div class="ttdeci">uint128_t operator&amp;(const T p)</div><div class="ttdoc">operator &amp; for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:856</div></div>
-<div class="ttc" id="aclassuint128__t_html_aa5b93187b1d199071f204b9987d5d16a"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a">uint128_t::operator&lt;&lt;=</a></div><div class="ttdeci">uint128_t &amp; operator&lt;&lt;=(const T p)</div><div class="ttdoc">operator &lt;&lt;= for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:785</div></div>
-<div class="ttc" id="aclassuint128__t_html_aa69e1064c0b0b1df1c61acd2ea04fabd"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd">uint128_t::lower</a></div><div class="ttdeci">uint64_t lower() const</div><div class="ttdoc">returns lower 64-bit integer part</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:202</div></div>
-<div class="ttc" id="aclassuint128__t_html_aaacb9fda7adcfee224f1b09124c0438b"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b">uint128_t::operator/=</a></div><div class="ttdeci">uint128_t &amp; operator/=(const T p)</div><div class="ttdoc">operator /= for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:523</div></div>
-<div class="ttc" id="aclassuint128__t_html_aab88fd72d0370b12e4a257e378b82d37"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37">uint128_t::operator^</a></div><div class="ttdeci">uint128_t operator^(const T p)</div><div class="ttdoc">operator ^ for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:938</div></div>
-<div class="ttc" id="aclassuint128__t_html_ab07413c67d205e406abf3a9f554d59e1"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1">uint128_t::operator&amp;&amp;</a></div><div class="ttdeci">bool operator&amp;&amp;(const uint128_t &amp;b)</div><div class="ttdoc">operator &amp;&amp; for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:635</div></div>
-<div class="ttc" id="aclassuint128__t_html_ab3359b104bbb5a31c11c2027387c4b4e"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e">uint128_t::operator!=</a></div><div class="ttdeci">bool operator!=(const uint128_t &amp;other)</div><div class="ttdoc">operator != for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:620</div></div>
+<div class="ttc" id="aclassuint128__t_html_a6110aa452a6d114fcd2f42d2bc106fee"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee">uint128_t::operator|=</a></div><div class="ttdeci">uint128_t &amp; operator|=(const T p)</div><div class="ttdoc">operator |= for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00925">uint128_t.hpp:925</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a6824700c9c732a4200e7493fe7ed0eec"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec">uint128_t::operator-</a></div><div class="ttdeci">uint128_t operator-(const T &amp;p)</div><div class="ttdoc">operator - for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00319">uint128_t.hpp:319</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a6f24982de03e0e3d04ac7f8ae30f5848"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848">uint128_t::operator&gt;&gt;</a></div><div class="ttdeci">uint128_t operator&gt;&gt;(const T p)</div><div class="ttdoc">operator &gt;&gt; for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00806">uint128_t.hpp:806</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a7737bb30a5480c7286546b911d82e696"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696">uint128_t::operator!=</a></div><div class="ttdeci">bool operator!=(const T other)</div><div class="ttdoc">operator != for other types</div><div class="ttdef"><b>Definition</b> <a href="#l00722">uint128_t.hpp:722</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a7a95e3accdac1cb38c9767f9550c0896"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896">uint128_t::operator==</a></div><div class="ttdeci">bool operator==(const T other)</div><div class="ttdoc">operator == for other types</div><div class="ttdef"><b>Definition</b> <a href="#l00710">uint128_t.hpp:710</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a7b1de5584505c189664d0edd306e979e"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e">uint128_t::operator==</a></div><div class="ttdeci">bool operator==(const uint128_t &amp;other)</div><div class="ttdoc">operator == for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00611">uint128_t.hpp:611</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a7d2285a8a6e20b77f82f1f0351afe76e"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e">uint128_t::_trz</a></div><div class="ttdeci">uint32_t _trz()</div><div class="ttdoc">Trailing zeroes in binary.</div><div class="ttdef"><b>Definition</b> <a href="#l00163">uint128_t.hpp:163</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a7d56143b2e291e8087188192533d2e3c"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a7d56143b2e291e8087188192533d2e3c">uint128_t::uint128_t</a></div><div class="ttdeci">uint128_t(uint128_t &amp;&amp;num) noexcept</div><div class="ttdoc">Move constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00128">uint128_t.hpp:128</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a817b66c32268cf46244058a50db99503"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503">uint128_t::operator||</a></div><div class="ttdeci">bool operator||(const T b)</div><div class="ttdoc">operator || for other types</div><div class="ttdef"><b>Definition</b> <a href="#l00747">uint128_t.hpp:747</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a81a568510e6d0b0950133dd9fc37fc0c"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c">uint128_t::operator-</a></div><div class="ttdeci">uint128_t operator-(const uint128_t &amp;p)</div><div class="ttdoc">operator - for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00329">uint128_t.hpp:329</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a82c63f8c18b8d2d255b8b0d373ac7d6e"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e">uint128_t::operator&gt;</a></div><div class="ttdeci">bool operator&gt;(const T other)</div><div class="ttdoc">operator &gt; for other types</div><div class="ttdef"><b>Definition</b> <a href="#l00686">uint128_t.hpp:686</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a857a3c69c1e775a1bd3935c2bfbb02df"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df">uint128_t::__get_integer_from_string</a></div><div class="ttdeci">void __get_integer_from_string(const std::string &amp;str)</div><div class="ttdoc">First and second half of 128 bit number.</div><div class="ttdef"><b>Definition</b> <a href="#l00070">uint128_t.hpp:70</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a8bf81f7f5f5c98f197822ec88e106c6c"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c">uint128_t::divide</a></div><div class="ttdeci">std::pair&lt; uint128_t, uint128_t &gt; divide(const uint128_t &amp;p)</div><div class="ttdoc">divide function for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00455">uint128_t.hpp:455</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a9487ed06019d846add5dc8874e41eb8b"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a9487ed06019d846add5dc8874e41eb8b">uint128_t::operator^</a></div><div class="ttdeci">uint128_t operator^(const uint128_t &amp;p)</div><div class="ttdoc">operator ^ for uint128_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00947">uint128_t.hpp:947</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a95ac8be8f414fcbce09301b912f5079d"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a95ac8be8f414fcbce09301b912f5079d">uint128_t::uint128_t</a></div><div class="ttdeci">uint128_t(const uint64_t high, const uint64_t low)</div><div class="ttdoc">Parameterized constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00116">uint128_t.hpp:116</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a96fc7c2df4325bb1a0c22b566bcc6295"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295">uint128_t::operator*=</a></div><div class="ttdeci">uint128_t &amp; operator*=(const uint128_t &amp;p)</div><div class="ttdoc">operator *= for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00434">uint128_t.hpp:434</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a9704e6a4d32750461bff663e40e537cb"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb">uint128_t::operator+=</a></div><div class="ttdeci">uint128_t &amp; operator+=(const uint128_t &amp;p)</div><div class="ttdoc">operator += for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00286">uint128_t.hpp:286</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a9fa81ef0d54ecb9050d0be4249358ca4"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4">uint128_t::operator&amp;</a></div><div class="ttdeci">uint128_t operator&amp;(const T p)</div><div class="ttdoc">operator &amp; for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00856">uint128_t.hpp:856</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_aa5b93187b1d199071f204b9987d5d16a"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a">uint128_t::operator&lt;&lt;=</a></div><div class="ttdeci">uint128_t &amp; operator&lt;&lt;=(const T p)</div><div class="ttdoc">operator &lt;&lt;= for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00785">uint128_t.hpp:785</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_aa69e1064c0b0b1df1c61acd2ea04fabd"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd">uint128_t::lower</a></div><div class="ttdeci">uint64_t lower() const</div><div class="ttdoc">returns lower 64-bit integer part</div><div class="ttdef"><b>Definition</b> <a href="#l00202">uint128_t.hpp:202</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_aaacb9fda7adcfee224f1b09124c0438b"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b">uint128_t::operator/=</a></div><div class="ttdeci">uint128_t &amp; operator/=(const T p)</div><div class="ttdoc">operator /= for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00523">uint128_t.hpp:523</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_aab88fd72d0370b12e4a257e378b82d37"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37">uint128_t::operator^</a></div><div class="ttdeci">uint128_t operator^(const T p)</div><div class="ttdoc">operator ^ for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00938">uint128_t.hpp:938</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_ab07413c67d205e406abf3a9f554d59e1"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1">uint128_t::operator&amp;&amp;</a></div><div class="ttdeci">bool operator&amp;&amp;(const uint128_t &amp;b)</div><div class="ttdoc">operator &amp;&amp; for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00635">uint128_t.hpp:635</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_ab3359b104bbb5a31c11c2027387c4b4e"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e">uint128_t::operator!=</a></div><div class="ttdeci">bool operator!=(const uint128_t &amp;other)</div><div class="ttdoc">operator != for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00620">uint128_t.hpp:620</a></div></div>
 <div class="ttc" id="aclassuint128__t_html_ab6aa4d14ed52c7c640468c45350da0c5"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5">uint128_t::operator=</a></div><div class="ttdeci">uint128_t &amp; operator=(const uint128_t &amp;p)=default</div><div class="ttdoc">operator = for uint128_t</div></div>
-<div class="ttc" id="aclassuint128__t_html_ab88330f3c4f3bcde75dc5ef9eb8eb39d"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d">uint128_t::operator|=</a></div><div class="ttdeci">uint128_t &amp; operator|=(const uint128_t &amp;p)</div><div class="ttdoc">operator |= for uint128_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:911</div></div>
-<div class="ttc" id="aclassuint128__t_html_abae08ef3c1d6dc512edd68ca68327f74"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74">uint128_t::operator=</a></div><div class="ttdeci">uint128_t &amp; operator=(const std::string &amp;p)</div><div class="ttdoc">operator = for type string</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:228</div></div>
-<div class="ttc" id="aclassuint128__t_html_abea727c69c2acd74ffe21464199d27c8"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8">uint128_t::operator-=</a></div><div class="ttdeci">uint128_t &amp; operator-=(const uint128_t &amp;p)</div><div class="ttdoc">operator -= for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:378</div></div>
-<div class="ttc" id="aclassuint128__t_html_abfc6a8765039cacc829a5cd386b5a066"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#abfc6a8765039cacc829a5cd386b5a066">uint128_t::operator%</a></div><div class="ttdeci">uint128_t operator%(const uint128_t &amp;p)</div><div class="ttdoc">operator % for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:533</div></div>
-<div class="ttc" id="aclassuint128__t_html_ac7d55ed3bac01075b9cd11cc59508050"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050">uint128_t::operator&amp;=</a></div><div class="ttdeci">uint128_t &amp; operator&amp;=(const uint128_t &amp;p)</div><div class="ttdoc">operator &amp;= for uint128_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:866</div></div>
-<div class="ttc" id="aclassuint128__t_html_ac8d293d20cdf65c48d8d1e0ba7034c8e"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e">uint128_t::operator++</a></div><div class="ttdeci">uint128_t &amp; operator++()</div><div class="ttdoc">pre-increment operator</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:297</div></div>
-<div class="ttc" id="aclassuint128__t_html_ac924cc09bbb919532dc42f1f93f6f544"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544">uint128_t::operator=</a></div><div class="ttdeci">uint128_t &amp; operator=(const T &amp;p)</div><div class="ttdoc">operator = for other types</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:218</div></div>
-<div class="ttc" id="aclassuint128__t_html_ac9a4365fb9ea5e2d2c751258f09168a4"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4">uint128_t::operator&lt;</a></div><div class="ttdeci">bool operator&lt;(const uint128_t &amp;other)</div><div class="ttdoc">operator &lt; for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:575</div></div>
-<div class="ttc" id="aclassuint128__t_html_ad1717d3a38391258befa413b7e2b9244"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244">uint128_t::operator&amp;</a></div><div class="ttdeci">uint128_t operator&amp;(const uint128_t &amp;p)</div><div class="ttdoc">operator &amp; for uint128_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:844</div></div>
-<div class="ttc" id="aclassuint128__t_html_ad24d6fe1fe63f415fee806b377dfa47d"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d">uint128_t::operator!</a></div><div class="ttdeci">bool operator!()</div><div class="ttdoc">operator ! for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:628</div></div>
-<div class="ttc" id="aclassuint128__t_html_adce2432b148fe18179a5ea272f4eb040"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040">uint128_t::uint128_t</a></div><div class="ttdeci">uint128_t(T low)</div><div class="ttdoc">Parameterized constructor.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:101</div></div>
-<div class="ttc" id="aclassuint128__t_html_add9938b97fc66560cec2d32e8c83eaad"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#add9938b97fc66560cec2d32e8c83eaad">uint128_t::operator%</a></div><div class="ttdeci">uint128_t operator%(const T &amp;p)</div><div class="ttdoc">operator % for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:543</div></div>
-<div class="ttc" id="aclassuint128__t_html_ae3f0ef8a3f68d9cbd9d99e772f1a947a"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a">uint128_t::operator^=</a></div><div class="ttdeci">uint128_t &amp; operator^=(const uint128_t &amp;p)</div><div class="ttdoc">operator ^= for uint128_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:956</div></div>
-<div class="ttc" id="aclassuint128__t_html_ae7af1bad048942eeabc092d8e0194292"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292">uint128_t::operator&gt;=</a></div><div class="ttdeci">bool operator&gt;=(const uint128_t &amp;other)</div><div class="ttdoc">operator &gt;= for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:602</div></div>
-<div class="ttc" id="aclassuint128__t_html_aed49b24b99293ae6b14ac9850f5deb94"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94">uint128_t::operator/</a></div><div class="ttdeci">uint128_t operator/(const T p)</div><div class="ttdoc">operator / for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:499</div></div>
-<div class="ttc" id="aclassuint128__t_html_af139bb6e630f1a61919f180978611cd2"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2">uint128_t::_lez</a></div><div class="ttdeci">uint32_t _lez()</div><div class="ttdoc">Leading zeroes in binary.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:140</div></div>
-<div class="ttc" id="aclassuint128__t_html_af4ce01d81a0369218f7d46567d136733"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733">uint128_t::operator()</a></div><div class="ttdeci">bool operator()()</div><div class="ttdoc">operator () for uint128_t</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:652</div></div>
-<div class="ttc" id="aclassuint128__t_html_af71990a1fba93a5528ddb1e6662bffd6"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6">uint128_t::operator++</a></div><div class="ttdeci">uint128_t operator++(int)</div><div class="ttdoc">post-increment operator</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:306</div></div>
-<div class="ttc" id="aenable_if_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a></div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">std::string::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="aintegral_constant_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a></div></div>
-<div class="ttc" id="ais_arithmetic_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/is_arithmetic.html">std::is_arithmetic</a></div></div>
-<div class="ttc" id="ais_integral_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral</a></div></div>
-<div class="ttc" id="ais_unsigned_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/is_unsigned.html">std::is_unsigned</a></div></div>
-<div class="ttc" id="aoperator_cmp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html">std::rel_ops::operator!=</a></div><div class="ttdeci">T operator!=(T... args)</div></div>
-<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/push_back.html">std::string::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="areverse_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a></div><div class="ttdeci">T reverse(T... args)</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-<div class="ttc" id="auint128__t_8hpp_html_a3ff77262ffd6743df5b808d41382a6f3"><div class="ttname"><a href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a></div><div class="ttdeci">std::string add(const std::string &amp;first, const std::string &amp;second)</div><div class="ttdoc">Adding two string.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:38</div></div>
+<div class="ttc" id="aclassuint128__t_html_ab88330f3c4f3bcde75dc5ef9eb8eb39d"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d">uint128_t::operator|=</a></div><div class="ttdeci">uint128_t &amp; operator|=(const uint128_t &amp;p)</div><div class="ttdoc">operator |= for uint128_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00911">uint128_t.hpp:911</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_abae08ef3c1d6dc512edd68ca68327f74"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74">uint128_t::operator=</a></div><div class="ttdeci">uint128_t &amp; operator=(const std::string &amp;p)</div><div class="ttdoc">operator = for type string</div><div class="ttdef"><b>Definition</b> <a href="#l00228">uint128_t.hpp:228</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_abea727c69c2acd74ffe21464199d27c8"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8">uint128_t::operator-=</a></div><div class="ttdeci">uint128_t &amp; operator-=(const uint128_t &amp;p)</div><div class="ttdoc">operator -= for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00378">uint128_t.hpp:378</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_abfc6a8765039cacc829a5cd386b5a066"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#abfc6a8765039cacc829a5cd386b5a066">uint128_t::operator%</a></div><div class="ttdeci">uint128_t operator%(const uint128_t &amp;p)</div><div class="ttdoc">operator % for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00533">uint128_t.hpp:533</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_ac7d55ed3bac01075b9cd11cc59508050"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050">uint128_t::operator&amp;=</a></div><div class="ttdeci">uint128_t &amp; operator&amp;=(const uint128_t &amp;p)</div><div class="ttdoc">operator &amp;= for uint128_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00866">uint128_t.hpp:866</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_ac8d293d20cdf65c48d8d1e0ba7034c8e"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e">uint128_t::operator++</a></div><div class="ttdeci">uint128_t &amp; operator++()</div><div class="ttdoc">pre-increment operator</div><div class="ttdef"><b>Definition</b> <a href="#l00297">uint128_t.hpp:297</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_ac924cc09bbb919532dc42f1f93f6f544"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544">uint128_t::operator=</a></div><div class="ttdeci">uint128_t &amp; operator=(const T &amp;p)</div><div class="ttdoc">operator = for other types</div><div class="ttdef"><b>Definition</b> <a href="#l00218">uint128_t.hpp:218</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_ac9a4365fb9ea5e2d2c751258f09168a4"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4">uint128_t::operator&lt;</a></div><div class="ttdeci">bool operator&lt;(const uint128_t &amp;other)</div><div class="ttdoc">operator &lt; for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00575">uint128_t.hpp:575</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_ad1717d3a38391258befa413b7e2b9244"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244">uint128_t::operator&amp;</a></div><div class="ttdeci">uint128_t operator&amp;(const uint128_t &amp;p)</div><div class="ttdoc">operator &amp; for uint128_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00844">uint128_t.hpp:844</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_ad24d6fe1fe63f415fee806b377dfa47d"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d">uint128_t::operator!</a></div><div class="ttdeci">bool operator!()</div><div class="ttdoc">operator ! for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00628">uint128_t.hpp:628</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_adce2432b148fe18179a5ea272f4eb040"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040">uint128_t::uint128_t</a></div><div class="ttdeci">uint128_t(T low)</div><div class="ttdoc">Parameterized constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00101">uint128_t.hpp:101</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_add9938b97fc66560cec2d32e8c83eaad"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#add9938b97fc66560cec2d32e8c83eaad">uint128_t::operator%</a></div><div class="ttdeci">uint128_t operator%(const T &amp;p)</div><div class="ttdoc">operator % for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00543">uint128_t.hpp:543</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_ae3f0ef8a3f68d9cbd9d99e772f1a947a"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a">uint128_t::operator^=</a></div><div class="ttdeci">uint128_t &amp; operator^=(const uint128_t &amp;p)</div><div class="ttdoc">operator ^= for uint128_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00956">uint128_t.hpp:956</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_ae7af1bad048942eeabc092d8e0194292"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292">uint128_t::operator&gt;=</a></div><div class="ttdeci">bool operator&gt;=(const uint128_t &amp;other)</div><div class="ttdoc">operator &gt;= for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00602">uint128_t.hpp:602</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_aed49b24b99293ae6b14ac9850f5deb94"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94">uint128_t::operator/</a></div><div class="ttdeci">uint128_t operator/(const T p)</div><div class="ttdoc">operator / for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00499">uint128_t.hpp:499</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_af139bb6e630f1a61919f180978611cd2"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2">uint128_t::_lez</a></div><div class="ttdeci">uint32_t _lez()</div><div class="ttdoc">Leading zeroes in binary.</div><div class="ttdef"><b>Definition</b> <a href="#l00140">uint128_t.hpp:140</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_af4ce01d81a0369218f7d46567d136733"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733">uint128_t::operator()</a></div><div class="ttdeci">bool operator()()</div><div class="ttdoc">operator () for uint128_t</div><div class="ttdef"><b>Definition</b> <a href="#l00652">uint128_t.hpp:652</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_af71990a1fba93a5528ddb1e6662bffd6"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6">uint128_t::operator++</a></div><div class="ttdeci">uint128_t operator++(int)</div><div class="ttdoc">post-increment operator</div><div class="ttdef"><b>Definition</b> <a href="#l00306">uint128_t.hpp:306</a></div></div>
+<div class="ttc" id="auint128__t_8hpp_html_a3ff77262ffd6743df5b808d41382a6f3"><div class="ttname"><a href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a></div><div class="ttdeci">std::string add(const std::string &amp;first, const std::string &amp;second)</div><div class="ttdoc">Adding two string.</div><div class="ttdef"><b>Definition</b> <a href="#l00038">uint128_t.hpp:38</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/da/d49/classgreedy__algorithms_1_1_digit_separation.html b/da/d49/classgreedy__algorithms_1_1_digit_separation.html
index 2c007897a..3f834dcbc 100644
--- a/da/d49/classgreedy__algorithms_1_1_digit_separation.html
+++ b/da/d49/classgreedy__algorithms_1_1_digit_separation.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: greedy_algorithms::DigitSeparation Class Reference</title>
+<title>TheAlgorithms/C++: greedy_algorithms::DigitSeparation Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,15 +136,17 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:afd54c969a6c9bab16b4a064fbc8ed40e" id="r_afd54c969a6c9bab16b4a064fbc8ed40e"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afd54c969a6c9bab16b4a064fbc8ed40e">DigitSeparation</a> ()</td></tr>
 <tr class="memdesc:afd54c969a6c9bab16b4a064fbc8ed40e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Default constructor for the <a class="el" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html" title="A class that provides methods to separate the digits of a large positive number.">DigitSeparation</a> class.  <br /></td></tr>
 <tr class="separator:afd54c969a6c9bab16b4a064fbc8ed40e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a34769a780845e9d4279152899bd3bf79" id="r_a34769a780845e9d4279152899bd3bf79"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a34769a780845e9d4279152899bd3bf79">digitSeparationReverseOrder</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> largeNumber) const</td></tr>
+<tr class="memitem:a34769a780845e9d4279152899bd3bf79" id="r_a34769a780845e9d4279152899bd3bf79"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a34769a780845e9d4279152899bd3bf79">digitSeparationReverseOrder</a> (std::int64_t largeNumber) const</td></tr>
 <tr class="memdesc:a34769a780845e9d4279152899bd3bf79"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of digitSeparationReverseOrder method.  <br /></td></tr>
 <tr class="separator:a34769a780845e9d4279152899bd3bf79"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a1809ae6828223999374bde5b197a59c8" id="r_a1809ae6828223999374bde5b197a59c8"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1809ae6828223999374bde5b197a59c8">digitSeparationForwardOrder</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> largeNumber) const</td></tr>
+<tr class="memitem:a1809ae6828223999374bde5b197a59c8" id="r_a1809ae6828223999374bde5b197a59c8"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1809ae6828223999374bde5b197a59c8">digitSeparationForwardOrder</a> (std::int64_t largeNumber) const</td></tr>
 <tr class="memdesc:a1809ae6828223999374bde5b197a59c8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of digitSeparationForwardOrder method.  <br /></td></tr>
 <tr class="separator:a1809ae6828223999374bde5b197a59c8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A class that provides methods to separate the digits of a large positive number. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d36/digit__separation_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../d3/d36/digit__separation_8cpp_source.html">digit_separation.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="afd54c969a6c9bab16b4a064fbc8ed40e" name="afd54c969a6c9bab16b4a064fbc8ed40e"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#afd54c969a6c9bab16b4a064fbc8ed40e">&#9670;&#160;</a></span>DigitSeparation()</h2>
@@ -153,6 +172,8 @@ Public Member Functions</h2></td></tr>
 </div><div class="memdoc">
 
 <p>Default constructor for the <a class="el" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html" title="A class that provides methods to separate the digits of a large positive number.">DigitSeparation</a> class. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d36/digit__separation_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../d3/d36/digit__separation_8cpp_source.html">digit_separation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   40</span>{}</div>
 </div><!-- fragment -->
 </div>
@@ -168,9 +189,9 @@ Public Member Functions</h2></td></tr>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> &gt; greedy_algorithms::DigitSeparation::digitSeparationForwardOrder </td>
+          <td class="memname">std::vector&lt; std::int64_t &gt; greedy_algorithms::DigitSeparation::digitSeparationForwardOrder </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a></td>          <td class="paramname"><span class="paramname"><em>largeNumber</em></span></td><td>)</td>
+          <td class="paramtype">std::int64_t</td>          <td class="paramname"><span class="paramname"><em>largeNumber</em></span></td><td>)</td>
           <td> const</td>
         </tr>
       </table>
@@ -189,22 +210,17 @@ Public Member Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>A vector of digits in forward order. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d36/digit__separation_8cpp_source.html#l00068">68</a> of file <a class="el" href="../../d3/d36/digit__separation_8cpp_source.html">digit_separation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   69</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&lt;std::int64_t&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> =</div>
+<div class="line"><span class="lineno">   70</span>        std::vector&lt;std::int64_t&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> =</div>
 <div class="line"><span class="lineno">   71</span>            <a class="code hl_function" href="#a34769a780845e9d4279152899bd3bf79">digitSeparationReverseOrder</a>(largeNumber);</div>
-<div class="line"><span class="lineno">   72</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a>(<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.begin(), <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.end());</div>
+<div class="line"><span class="lineno">   72</span>        std::reverse(<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.begin(), <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.end());</div>
 <div class="line"><span class="lineno">   73</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   74</span>    }</div>
-<div class="ttc" id="aclassgreedy__algorithms_1_1_digit_separation_html_a34769a780845e9d4279152899bd3bf79"><div class="ttname"><a href="#a34769a780845e9d4279152899bd3bf79">greedy_algorithms::DigitSeparation::digitSeparationReverseOrder</a></div><div class="ttdeci">std::vector&lt; std::int64_t &gt; digitSeparationReverseOrder(std::int64_t largeNumber) const</div><div class="ttdoc">Implementation of digitSeparationReverseOrder method.</div><div class="ttdef"><b>Definition</b> digit_separation.cpp:48</div></div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-<div class="ttc" id="areverse_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a></div><div class="ttdeci">T reverse(T... args)</div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph.svg" width="468" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassgreedy__algorithms_1_1_digit_separation_html_a34769a780845e9d4279152899bd3bf79"><div class="ttname"><a href="#a34769a780845e9d4279152899bd3bf79">greedy_algorithms::DigitSeparation::digitSeparationReverseOrder</a></div><div class="ttdeci">std::vector&lt; std::int64_t &gt; digitSeparationReverseOrder(std::int64_t largeNumber) const</div><div class="ttdoc">Implementation of digitSeparationReverseOrder method.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d36/digit__separation_8cpp_source.html#l00048">digit_separation.cpp:48</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a34769a780845e9d4279152899bd3bf79" name="a34769a780845e9d4279152899bd3bf79"></a>
@@ -217,9 +233,9 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> &gt; greedy_algorithms::DigitSeparation::digitSeparationReverseOrder </td>
+          <td class="memname">std::vector&lt; std::int64_t &gt; greedy_algorithms::DigitSeparation::digitSeparationReverseOrder </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a></td>          <td class="paramname"><span class="paramname"><em>largeNumber</em></span></td><td>)</td>
+          <td class="paramtype">std::int64_t</td>          <td class="paramname"><span class="paramname"><em>largeNumber</em></span></td><td>)</td>
           <td> const</td>
         </tr>
       </table>
@@ -238,8 +254,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>A vector of digits in reverse order. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d36/digit__separation_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../d3/d36/digit__separation_8cpp_source.html">digit_separation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   49</span>                                      {</div>
-<div class="line"><span class="lineno">   50</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::int64_t&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
+<div class="line"><span class="lineno">   50</span>        std::vector&lt;std::int64_t&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   51</span>        <span class="keywordflow">if</span> (largeNumber != 0) {</div>
 <div class="line"><span class="lineno">   52</span>            <span class="keywordflow">while</span> (largeNumber != 0) {</div>
 <div class="line"><span class="lineno">   53</span>                <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(std::abs(largeNumber % 10));</div>
@@ -254,7 +272,7 @@ Here is the call graph for this function:</div>
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>greedy_algorithms/<a class="el" href="../../d3/d36/digit__separation_8cpp.html">digit_separation.cpp</a></li>
+<li>greedy_algorithms/<a class="el" href="../../d3/d36/digit__separation_8cpp_source.html">digit_separation.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph.map b/da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph.map
deleted file mode 100644
index edb494389..000000000
--- a/da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="greedy_algorithms::DigitSeparation::digitSeparationForwardOrder" name="greedy_algorithms::DigitSeparation::digitSeparationForwardOrder">
-<area shape="rect" id="Node000001" title="Implementation of digitSeparationForwardOrder method." alt="" coords="5,39,210,94"/>
-<area shape="rect" id="Node000002" href="$da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79" title="Implementation of digitSeparationReverseOrder method." alt="" coords="258,5,462,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="210,50,242,46,242,51,210,56"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/reverse.html#" title=" " alt="" coords="315,86,405,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="210,77,300,88,299,94,210,82"/>
-</map>
diff --git a/da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph.md5 b/da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph.md5
deleted file mode 100644
index c33953a26..000000000
--- a/da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c6f4b15afebce0a61636f63d76449450
\ No newline at end of file
diff --git a/da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph.svg b/da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph.svg
deleted file mode 100644
index 15e02d776..000000000
--- a/da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph.svg
+++ /dev/null
@@ -1,87 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: greedy_algorithms::DigitSeparation::digitSeparationForwardOrder Pages: 1 -->
-<svg width="351pt" height="88pt"
- viewBox="0.00 0.00 350.50 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>greedy_algorithms::DigitSeparation::digitSeparationForwardOrder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Implementation of digitSeparationForwardOrder method.">
-<polygon fill="#999999" stroke="#666666" points="153.25,-54.5 0,-54.5 0,-12.75 153.25,-12.75 153.25,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="8" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
-<text text-anchor="middle" x="76.62" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">ForwardOrder</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79" target="_top" xlink:title="Implementation of digitSeparationReverseOrder method.">
-<polygon fill="white" stroke="#666666" points="342.5,-79.5 189.25,-79.5 189.25,-37.75 342.5,-37.75 342.5,-79.5"/>
-<text text-anchor="start" x="197.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="197.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
-<text text-anchor="middle" x="265.88" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">ReverseOrder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.52,-43.76C161.44,-44.82 169.54,-45.9 177.58,-46.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177,-50.42 187.37,-48.28 177.93,-43.49 177,-50.42"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="299.75,-19.25 232,-19.25 232,0 299.75,0 299.75,-19.25"/>
-<text text-anchor="middle" x="265.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.52,-23.9C176.23,-20.99 200.39,-17.89 220.37,-15.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.64,-18.82 230.12,-14.08 219.75,-11.88 220.64,-18.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph_org.svg b/da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph_org.svg
deleted file mode 100644
index 36e90de00..000000000
--- a/da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph_org.svg
+++ /dev/null
@@ -1,61 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: greedy_algorithms::DigitSeparation::digitSeparationForwardOrder Pages: 1 -->
-<svg width="351pt" height="88pt"
- viewBox="0.00 0.00 350.50 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>greedy_algorithms::DigitSeparation::digitSeparationForwardOrder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Implementation of digitSeparationForwardOrder method.">
-<polygon fill="#999999" stroke="#666666" points="153.25,-54.5 0,-54.5 0,-12.75 153.25,-12.75 153.25,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="8" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
-<text text-anchor="middle" x="76.62" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">ForwardOrder</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79" target="_top" xlink:title="Implementation of digitSeparationReverseOrder method.">
-<polygon fill="white" stroke="#666666" points="342.5,-79.5 189.25,-79.5 189.25,-37.75 342.5,-37.75 342.5,-79.5"/>
-<text text-anchor="start" x="197.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="197.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
-<text text-anchor="middle" x="265.88" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">ReverseOrder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.52,-43.76C161.44,-44.82 169.54,-45.9 177.58,-46.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177,-50.42 187.37,-48.28 177.93,-43.49 177,-50.42"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="299.75,-19.25 232,-19.25 232,0 299.75,0 299.75,-19.25"/>
-<text text-anchor="middle" x="265.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.52,-23.9C176.23,-20.99 200.39,-17.89 220.37,-15.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.64,-18.82 230.12,-14.08 219.75,-11.88 220.64,-18.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d4b/depth__first__search__with__stack_8cpp.html b/da/d4b/depth__first__search__with__stack_8cpp.html
index 366b73573..521eb5ede 100644
--- a/da/d4b/depth__first__search__with__stack_8cpp.html
+++ b/da/d4b/depth__first__search__with__stack_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph/depth_first_search_with_stack.cpp File Reference</title>
+<title>TheAlgorithms/C++: graph/depth_first_search_with_stack.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for depth_first_search_with_stack.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/dfe/depth__first__search__with__stack_8cpp__incl.svg" width="407" height="126"><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">
+</div>
+<p><a href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></td></tr>
@@ -136,10 +155,10 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:aadebe9c855821d6515ca5b171222ef7b" id="r_aadebe9c855821d6515ca5b171222ef7b"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &gt; *adj, size_t u, size_t v)</td></tr>
+<tr class="memitem:aadebe9c855821d6515ca5b171222ef7b" id="r_aadebe9c855821d6515ca5b171222ef7b"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a> (std::vector&lt; std::vector&lt; size_t &gt; &gt; *adj, size_t u, size_t v)</td></tr>
 <tr class="memdesc:aadebe9c855821d6515ca5b171222ef7b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Adds and edge between two vertices of graph say u and v in this case.  <br /></td></tr>
 <tr class="separator:aadebe9c855821d6515ca5b171222ef7b"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a5738da9f508f6a9e87f123c9fb6f2ea9" id="r_a5738da9f508f6a9e87f123c9fb6f2ea9"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5738da9f508f6a9e87f123c9fb6f2ea9">graph::depth_first_search::dfs</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &gt; &amp;graph, size_t start)</td></tr>
+<tr class="memitem:a5738da9f508f6a9e87f123c9fb6f2ea9" id="r_a5738da9f508f6a9e87f123c9fb6f2ea9"><td class="memItemLeft" align="right" valign="top">std::vector&lt; size_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5738da9f508f6a9e87f123c9fb6f2ea9">graph::depth_first_search::dfs</a> (const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;graph, size_t start)</td></tr>
 <tr class="memdesc:a5738da9f508f6a9e87f123c9fb6f2ea9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Explores the given vertex, exploring a vertex means traversing over all the vertices which are connected to the vertex that is currently being explored and push it onto the stack.  <br /></td></tr>
 <tr class="separator:a5738da9f508f6a9e87f123c9fb6f2ea9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
@@ -152,17 +171,14 @@ Functions</h2></td></tr>
 Variables</h2></td></tr>
 <tr class="memitem:afb80b42b42381658a12a57a975ecd0c7" id="r_afb80b42b42381658a12a57a975ecd0c7"><td class="memItemLeft" align="right" valign="top">constexpr int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afb80b42b42381658a12a57a975ecd0c7">WHITE</a> = 0</td></tr>
 <tr class="separator:afb80b42b42381658a12a57a975ecd0c7"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a43e30173f12330e85cce6239a277527e" id="r_a43e30173f12330e85cce6239a277527e"><td class="memItemLeft" align="right" valign="top"><a id="a43e30173f12330e85cce6239a277527e" name="a43e30173f12330e85cce6239a277527e"></a>
-constexpr int&#160;</td><td class="memItemRight" valign="bottom"><b>GREY</b> = 1</td></tr>
-<tr class="memdesc:a43e30173f12330e85cce6239a277527e"><td class="mdescLeft">&#160;</td><td class="mdescRight">indicates the node hasn't been explored <br /></td></tr>
+<tr class="memitem:a43e30173f12330e85cce6239a277527e" id="r_a43e30173f12330e85cce6239a277527e"><td class="memItemLeft" align="right" valign="top">constexpr int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a43e30173f12330e85cce6239a277527e">GREY</a> = 1</td></tr>
+<tr class="memdesc:a43e30173f12330e85cce6239a277527e"><td class="mdescLeft">&#160;</td><td class="mdescRight">indicates the node hasn't been explored  <br /></td></tr>
 <tr class="separator:a43e30173f12330e85cce6239a277527e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a7f1cd94cf4da32933e8551cb3577e18b" id="r_a7f1cd94cf4da32933e8551cb3577e18b"><td class="memItemLeft" align="right" valign="top"><a id="a7f1cd94cf4da32933e8551cb3577e18b" name="a7f1cd94cf4da32933e8551cb3577e18b"></a>
-constexpr int&#160;</td><td class="memItemRight" valign="bottom"><b>BLACK</b> = 2</td></tr>
-<tr class="memdesc:a7f1cd94cf4da32933e8551cb3577e18b"><td class="mdescLeft">&#160;</td><td class="mdescRight">indicates node is in stack waiting to be explored <br /></td></tr>
+<tr class="memitem:a7f1cd94cf4da32933e8551cb3577e18b" id="r_a7f1cd94cf4da32933e8551cb3577e18b"><td class="memItemLeft" align="right" valign="top">constexpr int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7f1cd94cf4da32933e8551cb3577e18b">BLACK</a> = 2</td></tr>
+<tr class="memdesc:a7f1cd94cf4da32933e8551cb3577e18b"><td class="mdescLeft">&#160;</td><td class="mdescRight">indicates node is in stack waiting to be explored  <br /></td></tr>
 <tr class="separator:a7f1cd94cf4da32933e8551cb3577e18b"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a330a2b0a904f01802ada1f8f3b28e76c" id="r_a330a2b0a904f01802ada1f8f3b28e76c"><td class="memItemLeft" align="right" valign="top"><a id="a330a2b0a904f01802ada1f8f3b28e76c" name="a330a2b0a904f01802ada1f8f3b28e76c"></a>
-constexpr int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>INF</b> = <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">std::numeric_limits</a>&lt;int16_t&gt;::max()</td></tr>
-<tr class="memdesc:a330a2b0a904f01802ada1f8f3b28e76c"><td class="mdescLeft">&#160;</td><td class="mdescRight">indicates node has already been explored <br /></td></tr>
+<tr class="memitem:a330a2b0a904f01802ada1f8f3b28e76c" id="r_a330a2b0a904f01802ada1f8f3b28e76c"><td class="memItemLeft" align="right" valign="top">constexpr int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a330a2b0a904f01802ada1f8f3b28e76c">INF</a> = std::numeric_limits&lt;int16_t&gt;::max()</td></tr>
+<tr class="memdesc:a330a2b0a904f01802ada1f8f3b28e76c"><td class="mdescLeft">&#160;</td><td class="mdescRight">indicates node has already been explored  <br /></td></tr>
 <tr class="separator:a330a2b0a904f01802ada1f8f3b28e76c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -188,6 +204,8 @@ constexpr int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>INF</b>
 <li>Push all its neighbours which are not coloured BLACK.</li>
 <li>Repeat steps 4 and 5 until the stack is empty. </li>
 </ol>
+
+<p class="definition">Definition in file <a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html">depth_first_search_with_stack.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="aadebe9c855821d6515ca5b171222ef7b" name="aadebe9c855821d6515ca5b171222ef7b"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aadebe9c855821d6515ca5b171222ef7b">&#9670;&#160;</a></span>addEdge()</h2>
@@ -198,7 +216,7 @@ constexpr int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>INF</b>
         <tr>
           <td class="memname">void graph::depth_first_search::addEdge </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; size_t &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -222,6 +240,8 @@ constexpr int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>INF</b>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html">depth_first_search_with_stack.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   64</span>                                                                    {</div>
 <div class="line"><span class="lineno">   65</span>    <span class="comment">/*</span></div>
 <div class="line"><span class="lineno">   66</span><span class="comment">    *</span></div>
@@ -242,9 +262,9 @@ constexpr int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>INF</b>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; graph::depth_first_search::dfs </td>
+          <td class="memname">std::vector&lt; size_t &gt; graph::depth_first_search::dfs </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>graph</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>graph</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -268,53 +288,43 @@ constexpr int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>INF</b>
 <p>push the node to the final result vector</p>
 <p>exploring the neighbours of the current node</p>
 <p><a class="el" href="../../db/d8b/struct_node.html">Node</a> has been explored</p>
-<div class="fragment"><div class="line"><span class="lineno">   87</span>                                                                                {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   88</span><span class="comment">    /// checked[i] stores the status of each node</span></div>
-<div class="line"><span class="lineno">   89</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;size_t&gt;</a> checked(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.size(), <a class="code hl_variable" href="#afb80b42b42381658a12a57a975ecd0c7">WHITE</a>), traversed_path;</div>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00087">87</a> of file <a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html">depth_first_search_with_stack.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   87</span>                                                                                {</div>
+<div class="line"><span class="lineno">   89</span>    std::vector&lt;size_t&gt; checked(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.size(), <a class="code hl_variable" href="#afb80b42b42381658a12a57a975ecd0c7">WHITE</a>), traversed_path;</div>
 <div class="line"><span class="lineno">   90</span> </div>
 <div class="line"><span class="lineno">   91</span>    checked[start] = <a class="code hl_variable" href="#a43e30173f12330e85cce6239a277527e">GREY</a>;</div>
-<div class="line"><span class="lineno">   92</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;size_t&gt;</a> <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;</div>
+<div class="line"><span class="lineno">   92</span>    std::stack&lt;size_t&gt; <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;</div>
 <div class="line"><span class="lineno">   93</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(start);</div>
-<div class="line"><span class="lineno">   94</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   95</span><span class="comment">    /// while stack is not empty we keep exploring the node on top of stack</span></div>
-<div class="line"><span class="lineno">   96</span><span class="comment"></span>    <span class="keywordflow">while</span> (!<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.empty()) {</div>
+<div class="line"><span class="lineno">   94</span> </div>
+<div class="line"><span class="lineno">   96</span>    <span class="keywordflow">while</span> (!<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.empty()) {</div>
 <div class="line"><span class="lineno">   97</span>        <span class="keywordtype">int</span> act = <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">top</a>();</div>
 <div class="line"><span class="lineno">   98</span>        <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>();</div>
 <div class="line"><span class="lineno">   99</span> </div>
-<div class="line"><span class="lineno">  100</span>        <span class="keywordflow">if</span> (checked[act] == <a class="code hl_variable" href="#a43e30173f12330e85cce6239a277527e">GREY</a>) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  101</span><span class="comment">            /// push the node to the final result vector</span></div>
-<div class="line"><span class="lineno">  102</span><span class="comment"></span>            traversed_path.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(act + 1);</div>
-<div class="line"><span class="lineno">  103</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  104</span><span class="comment">            /// exploring the neighbours of the current node</span></div>
-<div class="line"><span class="lineno">  105</span><span class="comment"></span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> it : <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[act]) {</div>
+<div class="line"><span class="lineno">  100</span>        <span class="keywordflow">if</span> (checked[act] == <a class="code hl_variable" href="#a43e30173f12330e85cce6239a277527e">GREY</a>) {</div>
+<div class="line"><span class="lineno">  102</span>            traversed_path.push_back(act + 1);</div>
+<div class="line"><span class="lineno">  103</span> </div>
+<div class="line"><span class="lineno">  105</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> it : <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[act]) {</div>
 <div class="line"><span class="lineno">  106</span>                <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(it);</div>
 <div class="line"><span class="lineno">  107</span>                <span class="keywordflow">if</span> (checked[it] != <a class="code hl_variable" href="#a7f1cd94cf4da32933e8551cb3577e18b">BLACK</a>) {</div>
 <div class="line"><span class="lineno">  108</span>                    checked[it] = <a class="code hl_variable" href="#a43e30173f12330e85cce6239a277527e">GREY</a>;</div>
 <div class="line"><span class="lineno">  109</span>                }</div>
 <div class="line"><span class="lineno">  110</span>            }</div>
-<div class="line"><span class="lineno">  111</span>            checked[act] = <a class="code hl_variable" href="#a7f1cd94cf4da32933e8551cb3577e18b">BLACK</a>;  <span class="comment">/// Node has been explored</span></div>
+<div class="line"><span class="lineno">  111</span>            checked[act] = <a class="code hl_variable" href="#a7f1cd94cf4da32933e8551cb3577e18b">BLACK</a>;  </div>
 <div class="line"><span class="lineno">  112</span>        }</div>
 <div class="line"><span class="lineno">  113</span>    }</div>
 <div class="line"><span class="lineno">  114</span>    <span class="keywordflow">return</span> traversed_path;</div>
 <div class="line"><span class="lineno">  115</span>}</div>
-<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> stack.hpp:19</div></div>
-<div class="ttc" id="aclassstack_html_a3647fb4418890f19e0dc414b8092b8b0"><div class="ttname"><a href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition</b> stack.hpp:62</div></div>
-<div class="ttc" id="aclassstack_html_a90df277532c23519aa7ac3c08ed90a1d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack::push</a></div><div class="ttdeci">void push(const value_type &amp;item)</div><div class="ttdef"><b>Definition</b> stack.hpp:47</div></div>
-<div class="ttc" id="aclassstack_html_ae09630c4384903d187801921b2ddc709"><div class="ttname"><a href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">stack::top</a></div><div class="ttdeci">value_type top() const</div><div class="ttdef"><b>Definition</b> stack.hpp:56</div></div>
-<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a43e30173f12330e85cce6239a277527e"><div class="ttname"><a href="#a43e30173f12330e85cce6239a277527e">GREY</a></div><div class="ttdeci">constexpr int GREY</div><div class="ttdoc">indicates the node hasn't been explored</div><div class="ttdef"><b>Definition</b> depth_first_search_with_stack.cpp:39</div></div>
-<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a7f1cd94cf4da32933e8551cb3577e18b"><div class="ttname"><a href="#a7f1cd94cf4da32933e8551cb3577e18b">BLACK</a></div><div class="ttdeci">constexpr int BLACK</div><div class="ttdoc">indicates node is in stack waiting to be explored</div><div class="ttdef"><b>Definition</b> depth_first_search_with_stack.cpp:40</div></div>
-<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_afb80b42b42381658a12a57a975ecd0c7"><div class="ttname"><a href="#afb80b42b42381658a12a57a975ecd0c7">WHITE</a></div><div class="ttdeci">constexpr int WHITE</div><div class="ttdef"><b>Definition</b> depth_first_search_with_stack.cpp:38</div></div>
+<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00019">stack.hpp:19</a></div></div>
+<div class="ttc" id="aclassstack_html_a3647fb4418890f19e0dc414b8092b8b0"><div class="ttname"><a href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00062">stack.hpp:62</a></div></div>
+<div class="ttc" id="aclassstack_html_a90df277532c23519aa7ac3c08ed90a1d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack::push</a></div><div class="ttdeci">void push(const value_type &amp;item)</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00047">stack.hpp:47</a></div></div>
+<div class="ttc" id="aclassstack_html_ae09630c4384903d187801921b2ddc709"><div class="ttname"><a href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">stack::top</a></div><div class="ttdeci">value_type top() const</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00056">stack.hpp:56</a></div></div>
+<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a43e30173f12330e85cce6239a277527e"><div class="ttname"><a href="#a43e30173f12330e85cce6239a277527e">GREY</a></div><div class="ttdeci">constexpr int GREY</div><div class="ttdoc">indicates the node hasn't been explored</div><div class="ttdef"><b>Definition</b> <a href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00039">depth_first_search_with_stack.cpp:39</a></div></div>
+<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a7f1cd94cf4da32933e8551cb3577e18b"><div class="ttname"><a href="#a7f1cd94cf4da32933e8551cb3577e18b">BLACK</a></div><div class="ttdeci">constexpr int BLACK</div><div class="ttdoc">indicates node is in stack waiting to be explored</div><div class="ttdef"><b>Definition</b> <a href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00040">depth_first_search_with_stack.cpp:40</a></div></div>
+<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_afb80b42b42381658a12a57a975ecd0c7"><div class="ttname"><a href="#afb80b42b42381658a12a57a975ecd0c7">WHITE</a></div><div class="ttdeci">constexpr int WHITE</div><div class="ttdef"><b>Definition</b> <a href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00038">depth_first_search_with_stack.cpp:38</a></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 class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition</b> paranthesis_matching.cpp:20</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="astack_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a></div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d4b/depth__first__search__with__stack_8cpp_a5738da9f508f6a9e87f123c9fb6f2ea9_cgraph.svg" width="510" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00020">paranthesis_matching.cpp:20</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -338,53 +348,43 @@ Here is the call graph for this function:</div>
 <p>taking input for the edges</p>
 <p>taking input for the starting position</p>
 <p>Printing the order of traversal</p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00173">173</a> of file <a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html">depth_first_search_with_stack.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  173</span>           {</div>
 <div class="line"><span class="lineno">  174</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// execute the tests</span></div>
 <div class="line"><span class="lineno">  175</span> </div>
 <div class="line"><span class="lineno">  176</span>    <span class="keywordtype">size_t</span> vertices = 0, edges = 0, start_pos = 1;</div>
-<div class="line"><span class="lineno">  177</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;size_t&gt;</a> traversal;</div>
+<div class="line"><span class="lineno">  177</span>    std::vector&lt;size_t&gt; traversal;</div>
 <div class="line"><span class="lineno">  178</span> </div>
-<div class="line"><span class="lineno">  179</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the Vertices : &quot;</span>;</div>
-<div class="line"><span class="lineno">  180</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; vertices;</div>
-<div class="line"><span class="lineno">  181</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the Edges : &quot;</span>;</div>
-<div class="line"><span class="lineno">  182</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; edges;</div>
-<div class="line"><span class="lineno">  183</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  184</span><span class="comment">    /// creating a graph</span></div>
-<div class="line"><span class="lineno">  185</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;size_t&gt;</a> &gt; adj(vertices, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;size_t&gt;</a>());</div>
-<div class="line"><span class="lineno">  186</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  187</span><span class="comment">    /// taking input for the edges</span></div>
-<div class="line"><span class="lineno">  188</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the vertices which have edges between them : &quot;</span> &lt;&lt; <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">  179</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the Vertices : &quot;</span>;</div>
+<div class="line"><span class="lineno">  180</span>    std::cin &gt;&gt; vertices;</div>
+<div class="line"><span class="lineno">  181</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the Edges : &quot;</span>;</div>
+<div class="line"><span class="lineno">  182</span>    std::cin &gt;&gt; edges;</div>
+<div class="line"><span class="lineno">  183</span> </div>
+<div class="line"><span class="lineno">  185</span>    std::vector&lt;std::vector&lt;size_t&gt; &gt; adj(vertices, std::vector&lt;size_t&gt;());</div>
+<div class="line"><span class="lineno">  186</span> </div>
+<div class="line"><span class="lineno">  188</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the vertices which have edges between them : &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  189</span>    <span class="keywordflow">while</span> (edges--) {</div>
 <div class="line"><span class="lineno">  190</span>        <span class="keywordtype">size_t</span> u = 0, v = 0;</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_istream.html">std::cin</a> &gt;&gt; u &gt;&gt; v;</div>
+<div class="line"><span class="lineno">  191</span>        std::cin &gt;&gt; u &gt;&gt; v;</div>
 <div class="line"><span class="lineno">  192</span>        <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&amp;adj, u, v);</div>
 <div class="line"><span class="lineno">  193</span>    }</div>
-<div class="line"><span class="lineno">  194</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  195</span><span class="comment">    /// taking input for the starting position</span></div>
-<div class="line"><span class="lineno">  196</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the starting vertex [1,n]: &quot;</span> &lt;&lt; <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">  197</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; start_pos;</div>
+<div class="line"><span class="lineno">  194</span> </div>
+<div class="line"><span class="lineno">  196</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the starting vertex [1,n]: &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  197</span>    std::cin &gt;&gt; start_pos;</div>
 <div class="line"><span class="lineno">  198</span>    start_pos -= 1;</div>
 <div class="line"><span class="lineno">  199</span>    traversal = <a class="code hl_function" href="#a5738da9f508f6a9e87f123c9fb6f2ea9">graph::depth_first_search::dfs</a>(adj, start_pos);</div>
-<div class="line"><span class="lineno">  200</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  201</span><span class="comment">    /// Printing the order of traversal</span></div>
-<div class="line"><span class="lineno">  202</span><span class="comment"></span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> x : traversal) {</div>
-<div class="line"><span class="lineno">  203</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; x &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><span class="lineno">  200</span> </div>
+<div class="line"><span class="lineno">  202</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> x : traversal) {</div>
+<div class="line"><span class="lineno">  203</span>        std::cout &lt;&lt; x &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
 <div class="line"><span class="lineno">  204</span>    }</div>
 <div class="line"><span class="lineno">  205</span> </div>
 <div class="line"><span class="lineno">  206</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  207</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition</b> depth_first_search_with_stack.cpp:123</div></div>
-<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a5738da9f508f6a9e87f123c9fb6f2ea9"><div class="ttname"><a href="#a5738da9f508f6a9e87f123c9fb6f2ea9">graph::depth_first_search::dfs</a></div><div class="ttdeci">std::vector&lt; size_t &gt; dfs(const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;graph, size_t start)</div><div class="ttdoc">Explores the given vertex, exploring a vertex means traversing over all the vertices which are connec...</div><div class="ttdef"><b>Definition</b> depth_first_search_with_stack.cpp:87</div></div>
-<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_aadebe9c855821d6515ca5b171222ef7b"><div class="ttname"><a href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a></div><div class="ttdeci">void addEdge(std::vector&lt; std::vector&lt; size_t &gt; &gt; *adj, size_t u, size_t v)</div><div class="ttdoc">Adds and edge between two vertices of graph say u and v in this case.</div><div class="ttdef"><b>Definition</b> depth_first_search_with_stack.cpp:64</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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d4b/depth__first__search__with__stack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="278" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition</b> <a href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00123">depth_first_search_with_stack.cpp:123</a></div></div>
+<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a5738da9f508f6a9e87f123c9fb6f2ea9"><div class="ttname"><a href="#a5738da9f508f6a9e87f123c9fb6f2ea9">graph::depth_first_search::dfs</a></div><div class="ttdeci">std::vector&lt; size_t &gt; dfs(const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;graph, size_t start)</div><div class="ttdoc">Explores the given vertex, exploring a vertex means traversing over all the vertices which are connec...</div><div class="ttdef"><b>Definition</b> <a href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00087">depth_first_search_with_stack.cpp:87</a></div></div>
+<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_aadebe9c855821d6515ca5b171222ef7b"><div class="ttname"><a href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a></div><div class="ttdeci">void addEdge(std::vector&lt; std::vector&lt; size_t &gt; &gt; *adj, size_t u, size_t v)</div><div class="ttdoc">Adds and edge between two vertices of graph say u and v in this case.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00064">depth_first_search_with_stack.cpp:64</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -416,60 +416,132 @@ Here is the call graph for this function:</div>
 <p>for the above sample data, this is the expected output</p>
 <p>Test 3</p>
 <p>for the above sample data, this is the expected output</p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00123">123</a> of file <a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html">depth_first_search_with_stack.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  123</span>                    {</div>
 <div class="line"><span class="lineno">  124</span>    <span class="keywordtype">size_t</span> start_pos;</div>
-<div class="line"><span class="lineno">  125</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  126</span><span class="comment">    /// Test 1</span></div>
-<div class="line"><span class="lineno">  127</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Case 1: &quot;</span> &lt;&lt; <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">  125</span> </div>
+<div class="line"><span class="lineno">  127</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Case 1: &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  128</span>    start_pos = 1;</div>
-<div class="line"><span class="lineno">  129</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;size_t&gt;</a> &gt; g1(3, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;size_t&gt;</a>());</div>
+<div class="line"><span class="lineno">  129</span>    std::vector&lt;std::vector&lt;size_t&gt; &gt; g1(3, std::vector&lt;size_t&gt;());</div>
 <div class="line"><span class="lineno">  130</span> </div>
 <div class="line"><span class="lineno">  131</span>    <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&amp;g1, 1, 2);</div>
 <div class="line"><span class="lineno">  132</span>    <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&amp;g1, 2, 3);</div>
 <div class="line"><span class="lineno">  133</span>    <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&amp;g1, 3, 1);</div>
 <div class="line"><span class="lineno">  134</span> </div>
-<div class="line"><span class="lineno">  135</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;size_t&gt;</a> expected1 {1, 2, 3}; <span class="comment">/// for the above sample data, this is the expected output</span></div>
+<div class="line"><span class="lineno">  135</span>    std::vector&lt;size_t&gt; expected1 {1, 2, 3}; </div>
 <div class="line"><span class="lineno">  136</span>    assert(graph::depth_first_search::dfs(g1, start_pos - 1) == expected1);</div>
-<div class="line"><span class="lineno">  137</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed&quot;</span> &lt;&lt; <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">  138</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  139</span><span class="comment">    /// Test 2</span></div>
-<div class="line"><span class="lineno">  140</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Case 2: &quot;</span> &lt;&lt; <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">  137</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  138</span> </div>
+<div class="line"><span class="lineno">  140</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Case 2: &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  141</span>    start_pos = 1;</div>
-<div class="line"><span class="lineno">  142</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;size_t&gt;</a> &gt; g2(4, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;size_t&gt;</a>());</div>
+<div class="line"><span class="lineno">  142</span>    std::vector&lt;std::vector&lt;size_t&gt; &gt; g2(4, std::vector&lt;size_t&gt;());</div>
 <div class="line"><span class="lineno">  143</span> </div>
 <div class="line"><span class="lineno">  144</span>    <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&amp;g2, 1, 2);</div>
 <div class="line"><span class="lineno">  145</span>    <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&amp;g2, 1, 3);</div>
 <div class="line"><span class="lineno">  146</span>    <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&amp;g2, 2, 4);</div>
 <div class="line"><span class="lineno">  147</span>    <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&amp;g2, 4, 1);</div>
 <div class="line"><span class="lineno">  148</span> </div>
-<div class="line"><span class="lineno">  149</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;size_t&gt;</a> expected2 {1, 3, 2, 4}; <span class="comment">/// for the above sample data, this is the expected output</span></div>
+<div class="line"><span class="lineno">  149</span>    std::vector&lt;size_t&gt; expected2 {1, 3, 2, 4}; </div>
 <div class="line"><span class="lineno">  150</span>    assert(graph::depth_first_search::dfs(g2, start_pos - 1) == expected2);</div>
-<div class="line"><span class="lineno">  151</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed&quot;</span> &lt;&lt; <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">  152</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  153</span><span class="comment">    /// Test 3</span></div>
-<div class="line"><span class="lineno">  154</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Case 3: &quot;</span> &lt;&lt; <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">  151</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  152</span> </div>
+<div class="line"><span class="lineno">  154</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Case 3: &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  155</span>    start_pos = 2;</div>
-<div class="line"><span class="lineno">  156</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;size_t&gt;</a> &gt; g3(4, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;size_t&gt;</a>());</div>
+<div class="line"><span class="lineno">  156</span>    std::vector&lt;std::vector&lt;size_t&gt; &gt; g3(4, std::vector&lt;size_t&gt;());</div>
 <div class="line"><span class="lineno">  157</span> </div>
 <div class="line"><span class="lineno">  158</span>    <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&amp;g3, 1, 2);</div>
 <div class="line"><span class="lineno">  159</span>    <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&amp;g3, 1, 3);</div>
 <div class="line"><span class="lineno">  160</span>    <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&amp;g3, 2, 4);</div>
 <div class="line"><span class="lineno">  161</span>    <a class="code hl_function" href="#aadebe9c855821d6515ca5b171222ef7b">graph::depth_first_search::addEdge</a>(&amp;g3, 4, 1);</div>
 <div class="line"><span class="lineno">  162</span> </div>
-<div class="line"><span class="lineno">  163</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;size_t&gt;</a> expected3 {2, 4, 1, 3}; <span class="comment">/// for the above sample data, this is the expected output</span></div>
+<div class="line"><span class="lineno">  163</span>    std::vector&lt;size_t&gt; expected3 {2, 4, 1, 3}; </div>
 <div class="line"><span class="lineno">  164</span>    assert(graph::depth_first_search::dfs(g3, start_pos - 1) == expected3);</div>
-<div class="line"><span class="lineno">  165</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed&quot;</span> &lt;&lt; <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">  165</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  166</span> </div>
 <div class="line"><span class="lineno">  167</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d4b/depth__first__search__with__stack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="180" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Variable Documentation</h2>
+<a id="a7f1cd94cf4da32933e8551cb3577e18b" name="a7f1cd94cf4da32933e8551cb3577e18b"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a7f1cd94cf4da32933e8551cb3577e18b">&#9670;&#160;</a></span>BLACK</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int BLACK = 2</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">constexpr</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>indicates node is in stack waiting to be explored </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html">depth_first_search_with_stack.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a43e30173f12330e85cce6239a277527e" name="a43e30173f12330e85cce6239a277527e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a43e30173f12330e85cce6239a277527e">&#9670;&#160;</a></span>GREY</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int GREY = 1</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">constexpr</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>indicates the node hasn't been explored </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html">depth_first_search_with_stack.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a330a2b0a904f01802ada1f8f3b28e76c" name="a330a2b0a904f01802ada1f8f3b28e76c"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a330a2b0a904f01802ada1f8f3b28e76c">&#9670;&#160;</a></span>INF</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int64_t INF = std::numeric_limits&lt;int16_t&gt;::max()</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">constexpr</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>indicates node has already been explored </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html">depth_first_search_with_stack.cpp</a>.</p>
+
+</div>
+</div>
 <a id="afb80b42b42381658a12a57a975ecd0c7" name="afb80b42b42381658a12a57a975ecd0c7"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#afb80b42b42381658a12a57a975ecd0c7">&#9670;&#160;</a></span>WHITE</h2>
 
@@ -489,7 +561,9 @@ Here is the call graph for this function:</div>
   </tr>
 </table>
 </div><div class="memdoc">
-<p>for IO operations header for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a> header for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> header for preprocessor macro assert() header for limits of integral types </p>
+<p>for IO operations header for std::stack header for std::vector header for preprocessor macro assert() header for limits of integral types </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html">depth_first_search_with_stack.cpp</a>.</p>
 
 </div>
 </div>
diff --git a/da/d4b/depth__first__search__with__stack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/da/d4b/depth__first__search__with__stack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index 7cc6e6992..000000000
--- a/da/d4b/depth__first__search__with__stack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,56,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="104,5,175,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,16,88,16,88,21,56,21"/>
-</map>
diff --git a/da/d4b/depth__first__search__with__stack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/da/d4b/depth__first__search__with__stack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 52a7413c5..000000000
--- a/da/d4b/depth__first__search__with__stack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-53c50817a16c14e9053dbcf470acfa9d
\ No newline at end of file
diff --git a/da/d4b/depth__first__search__with__stack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/da/d4b/depth__first__search__with__stack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index b4e2a7999..000000000
--- a/da/d4b/depth__first__search__with__stack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 135.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-19.25 73.75,-19.25 73.75,0 127.25,0 127.25,-19.25"/>
-<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.14,-9.62 53.69,-9.62 62.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.84,-13.13 71.83,-9.63 61.83,-6.13 61.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d4b/depth__first__search__with__stack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/da/d4b/depth__first__search__with__stack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index 42f72b633..000000000
--- a/da/d4b/depth__first__search__with__stack_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 135.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-19.25 73.75,-19.25 73.75,0 127.25,0 127.25,-19.25"/>
-<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.94,-9.62C45.14,-9.62 53.69,-9.62 62.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.84,-13.13 71.83,-9.63 61.83,-6.13 61.84,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d4b/depth__first__search__with__stack_8cpp_a5738da9f508f6a9e87f123c9fb6f2ea9_cgraph.map b/da/d4b/depth__first__search__with__stack_8cpp_a5738da9f508f6a9e87f123c9fb6f2ea9_cgraph.map
deleted file mode 100644
index a6a61d01f..000000000
--- a/da/d4b/depth__first__search__with__stack_8cpp_a5738da9f508f6a9e87f123c9fb6f2ea9_cgraph.map
+++ /dev/null
@@ -1,14 +0,0 @@
-<map id="graph::depth_first_search::dfs" name="graph::depth_first_search::dfs">
-<area shape="rect" id="Node000001" title="Explores the given vertex, exploring a vertex means traversing over all the vertices which are connec..." alt="" coords="5,72,128,113"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="31,72,29,63,35,54,48,48,67,46,87,48,99,55,97,59,85,53,66,51,49,53,38,58,34,64,36,71"/>
-<area shape="rect" id="Node000002" href="$d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" title=" " alt="" coords="212,5,294,31"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="108,70,175,40,196,32,198,37,177,45,110,74"/>
-<area shape="rect" id="Node000003" href="$d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" title=" " alt="" coords="208,55,298,80"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="128,82,192,73,193,78,128,87"/>
-<area shape="rect" id="Node000005" 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="176,104,330,130"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="128,98,161,102,160,108,128,103"/>
-<area shape="rect" id="Node000006" href="$d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" title=" " alt="" coords="213,153,292,179"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="111,111,177,140,199,148,197,153,175,145,109,116"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="378,55,503,80"/>
-<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="298,65,363,65,363,70,298,70"/>
-</map>
diff --git a/da/d4b/depth__first__search__with__stack_8cpp_a5738da9f508f6a9e87f123c9fb6f2ea9_cgraph.md5 b/da/d4b/depth__first__search__with__stack_8cpp_a5738da9f508f6a9e87f123c9fb6f2ea9_cgraph.md5
deleted file mode 100644
index 8ad4f9558..000000000
--- a/da/d4b/depth__first__search__with__stack_8cpp_a5738da9f508f6a9e87f123c9fb6f2ea9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d93bebf7695f3d516651f57455a0725f
\ No newline at end of file
diff --git a/da/d4b/depth__first__search__with__stack_8cpp_a5738da9f508f6a9e87f123c9fb6f2ea9_cgraph.svg b/da/d4b/depth__first__search__with__stack_8cpp_a5738da9f508f6a9e87f123c9fb6f2ea9_cgraph.svg
deleted file mode 100644
index 37cee60b4..000000000
--- a/da/d4b/depth__first__search__with__stack_8cpp_a5738da9f508f6a9e87f123c9fb6f2ea9_cgraph.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::depth_first_search::dfs Pages: 1 -->
-<svg width="382pt" height="138pt"
- viewBox="0.00 0.00 381.50 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>graph::depth_first_search::dfs</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Explores the given vertex, exploring a vertex means traversing over all the vertices which are connec...">
-<polygon fill="#999999" stroke="#666666" points="91.75,-79.88 0,-79.88 0,-49.38 91.75,-49.38 91.75,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::depth_first</text>
-<text text-anchor="middle" x="45.88" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">_search::dfs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.11,-80.36C16.06,-89.43 24.31,-97.88 45.88,-97.88 57.67,-97.88 65.48,-95.35 69.31,-91.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.76,-92.21 70.46,-81.86 65.81,-91.38 72.76,-92.21"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-130.25 154.75,-130.25 154.75,-111 216.5,-111 216.5,-130.25"/>
-<text text-anchor="middle" x="185.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.56,-80.22C92.5,-87.51 110.85,-96.01 127.75,-102.62 132.79,-104.6 138.14,-106.51 143.47,-108.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.23,-111.59 152.82,-111.36 144.4,-104.94 142.23,-111.59"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.12,-93.25 152.12,-93.25 152.12,-74 219.12,-74 219.12,-93.25"/>
-<text text-anchor="middle" x="185.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.98,-70.85C107.49,-72.99 124.82,-75.38 140.27,-77.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.77,-80.97 150.15,-78.87 140.73,-74.04 139.77,-80.97"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.5,-56.25 127.75,-56.25 127.75,-37 243.5,-37 243.5,-56.25"/>
-<text text-anchor="middle" x="185.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.98,-58.73C99.75,-57.72 107.98,-56.64 116.19,-55.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="116.39,-59.07 125.85,-54.3 115.48,-52.13 116.39,-59.07"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.38,-19.25 155.88,-19.25 155.88,0 215.38,0 215.38,-19.25"/>
-<text text-anchor="middle" x="185.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M78.76,-48.94C93.49,-41.98 111.33,-33.95 127.75,-27.62 133.17,-25.54 138.94,-23.5 144.65,-21.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.57,-24.97 154.01,-18.57 143.42,-18.31 145.57,-24.97"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373.5,-93.25 279.5,-93.25 279.5,-74 373.5,-74 373.5,-93.25"/>
-<text text-anchor="middle" x="326.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.54,-83.62C234,-83.62 251.43,-83.62 267.93,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="267.65,-87.13 277.65,-83.63 267.65,-80.13 267.65,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d4b/depth__first__search__with__stack_8cpp_a5738da9f508f6a9e87f123c9fb6f2ea9_cgraph_org.svg b/da/d4b/depth__first__search__with__stack_8cpp_a5738da9f508f6a9e87f123c9fb6f2ea9_cgraph_org.svg
deleted file mode 100644
index 9d8b3ac07..000000000
--- a/da/d4b/depth__first__search__with__stack_8cpp_a5738da9f508f6a9e87f123c9fb6f2ea9_cgraph_org.svg
+++ /dev/null
@@ -1,121 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::depth_first_search::dfs Pages: 1 -->
-<svg width="382pt" height="138pt"
- viewBox="0.00 0.00 381.50 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>graph::depth_first_search::dfs</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Explores the given vertex, exploring a vertex means traversing over all the vertices which are connec...">
-<polygon fill="#999999" stroke="#666666" points="91.75,-79.88 0,-79.88 0,-49.38 91.75,-49.38 91.75,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::depth_first</text>
-<text text-anchor="middle" x="45.88" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">_search::dfs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.11,-80.36C16.06,-89.43 24.31,-97.88 45.88,-97.88 57.67,-97.88 65.48,-95.35 69.31,-91.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.76,-92.21 70.46,-81.86 65.81,-91.38 72.76,-92.21"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-130.25 154.75,-130.25 154.75,-111 216.5,-111 216.5,-130.25"/>
-<text text-anchor="middle" x="185.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.56,-80.22C92.5,-87.51 110.85,-96.01 127.75,-102.62 132.79,-104.6 138.14,-106.51 143.47,-108.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.23,-111.59 152.82,-111.36 144.4,-104.94 142.23,-111.59"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.12,-93.25 152.12,-93.25 152.12,-74 219.12,-74 219.12,-93.25"/>
-<text text-anchor="middle" x="185.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.98,-70.85C107.49,-72.99 124.82,-75.38 140.27,-77.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.77,-80.97 150.15,-78.87 140.73,-74.04 139.77,-80.97"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.5,-56.25 127.75,-56.25 127.75,-37 243.5,-37 243.5,-56.25"/>
-<text text-anchor="middle" x="185.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.98,-58.73C99.75,-57.72 107.98,-56.64 116.19,-55.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="116.39,-59.07 125.85,-54.3 115.48,-52.13 116.39,-59.07"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.38,-19.25 155.88,-19.25 155.88,0 215.38,0 215.38,-19.25"/>
-<text text-anchor="middle" x="185.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M78.76,-48.94C93.49,-41.98 111.33,-33.95 127.75,-27.62 133.17,-25.54 138.94,-23.5 144.65,-21.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.57,-24.97 154.01,-18.57 143.42,-18.31 145.57,-24.97"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373.5,-93.25 279.5,-93.25 279.5,-74 373.5,-74 373.5,-93.25"/>
-<text text-anchor="middle" x="326.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.54,-83.62C234,-83.62 251.43,-83.62 267.93,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="267.65,-87.13 277.65,-83.63 267.65,-80.13 267.65,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d4b/depth__first__search__with__stack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/d4b/depth__first__search__with__stack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index b1955b46c..000000000
--- a/da/d4b/depth__first__search__with__stack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="201,5,272,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,185,16,185,21,55,21"/>
-<area shape="rect" id="Node000003" href="$da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title=" " alt="" coords="103,31,153,56"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,22,89,31,87,36,54,27"/>
-<area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="153,35,185,27,186,33,154,40"/>
-</map>
diff --git a/da/d4b/depth__first__search__with__stack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/d4b/depth__first__search__with__stack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index e2dbb74e0..000000000
--- a/da/d4b/depth__first__search__with__stack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-15ecf0d64cad19021d9762e4126fcb9b
\ No newline at end of file
diff --git a/da/d4b/depth__first__search__with__stack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/d4b/depth__first__search__with__stack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index e4fd629c7..000000000
--- a/da/d4b/depth__first__search__with__stack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="208pt" height="46pt"
- viewBox="0.00 0.00 208.25 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-38.25 0,-38.25 0,-19 37,-19 37,-38.25"/>
-<text text-anchor="middle" x="18.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.25,-38.25 146.75,-38.25 146.75,-19 200.25,-19 200.25,-38.25"/>
-<text text-anchor="middle" x="173.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-28.62C61.19,-28.62 104,-28.62 135.07,-28.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.83,-32.13 144.83,-28.63 134.83,-25.13 134.83,-32.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-23.93C44.64,-21.93 53.57,-19.56 61.98,-17.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.71,-20.74 71.48,-14.79 60.91,-13.98 62.71,-20.74"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.94,-13.94C118.22,-15.67 126.89,-17.74 135.39,-19.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.34,-23.12 144.88,-22.03 135.96,-16.31 134.34,-23.12"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d4b/depth__first__search__with__stack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/da/d4b/depth__first__search__with__stack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index ed965abb0..000000000
--- a/da/d4b/depth__first__search__with__stack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="208pt" height="46pt"
- viewBox="0.00 0.00 208.25 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-38.25 0,-38.25 0,-19 37,-19 37,-38.25"/>
-<text text-anchor="middle" x="18.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.25,-38.25 146.75,-38.25 146.75,-19 200.25,-19 200.25,-38.25"/>
-<text text-anchor="middle" x="173.5" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-28.62C61.19,-28.62 104,-28.62 135.07,-28.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.83,-32.13 144.83,-28.63 134.83,-25.13 134.83,-32.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-23.93C44.64,-21.93 53.57,-19.56 61.98,-17.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.71,-20.74 71.48,-14.79 60.91,-13.98 62.71,-20.74"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge3_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge3_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.94,-13.94C118.22,-15.67 126.89,-17.74 135.39,-19.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.34,-23.12 144.88,-22.03 135.96,-16.31 134.34,-23.12"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d4b/depth__first__search__with__stack_8cpp_source.html b/da/d4b/depth__first__search__with__stack_8cpp_source.html
new file mode 100644
index 000000000..4603da922
--- /dev/null
+++ b/da/d4b/depth__first__search__with__stack_8cpp_source.html
@@ -0,0 +1,287 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/depth_first_search_with_stack.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/d4b/depth__first__search__with__stack_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">depth_first_search_with_stack.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/d4b/depth__first__search__with__stack_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &lt;iostream&gt;</span>      </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#include &lt;stack&gt;</span>         </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;vector&gt;</span>        </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#include &lt;cassert&gt;</span>       </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#include &lt;limits&gt;</span>        </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#afb80b42b42381658a12a57a975ecd0c7">   38</a></span><span class="keyword">constexpr</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#afb80b42b42381658a12a57a975ecd0c7">WHITE</a> = 0; </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a43e30173f12330e85cce6239a277527e">   39</a></span><span class="keyword">constexpr</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a43e30173f12330e85cce6239a277527e">GREY</a> = 1;  </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a7f1cd94cf4da32933e8551cb3577e18b">   40</a></span><span class="keyword">constexpr</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a7f1cd94cf4da32933e8551cb3577e18b">BLACK</a> = 2; </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">   41</a></span><span class="keyword">constexpr</span> int64_t <a class="code hl_variable" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a> = std::numeric_limits&lt;int16_t&gt;::max();</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/da7/namespacedepth__first__search.html">depth_first_search</a> {</div>
+<div class="foldopen" id="foldopen00064" data-start="{" data-end="}">
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#aadebe9c855821d6515ca5b171222ef7b">   64</a></span><span class="keywordtype">void</span> addEdge(std::vector&lt;std::vector&lt;size_t&gt;&gt; *adj, <span class="keywordtype">size_t</span> u, <span class="keywordtype">size_t</span> v) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="comment">/*</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="comment">    *</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="comment">    * Here we are considering undirected graph that&#39;s the</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span><span class="comment">    * reason we are adding v to the adjacency list representation of u</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="comment">    * and also adding u to the adjacency list representation of v</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="comment">    *</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="comment">    */</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    (*adj)[u - 1].push_back(v - 1);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>}</div>
+</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="foldopen" id="foldopen00087" data-start="{" data-end="}">
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"><a class="line" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9">   87</a></span>std::vector&lt;size_t&gt; <a class="code hl_function" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9">dfs</a>(<span class="keyword">const</span> std::vector&lt;std::vector&lt;size_t&gt; &gt; &amp;<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, <span class="keywordtype">size_t</span> start) {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::vector&lt;size_t&gt; checked(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.size(), <a class="code hl_variable" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#afb80b42b42381658a12a57a975ecd0c7">WHITE</a>), traversed_path;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    checked[start] = <a class="code hl_variable" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a43e30173f12330e85cce6239a277527e">GREY</a>;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    std::stack&lt;size_t&gt; <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(start);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="keywordflow">while</span> (!<a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.empty()) {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        <span class="keywordtype">int</span> act = <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">top</a>();</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>();</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        <span class="keywordflow">if</span> (checked[act] == <a class="code hl_variable" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a43e30173f12330e85cce6239a277527e">GREY</a>) {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>            traversed_path.push_back(act + 1);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> it : <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[act]) {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>                <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(it);</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>                <span class="keywordflow">if</span> (checked[it] != <a class="code hl_variable" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a7f1cd94cf4da32933e8551cb3577e18b">BLACK</a>) {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>                    checked[it] = <a class="code hl_variable" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a43e30173f12330e85cce6239a277527e">GREY</a>;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>                }</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>            }</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>            checked[act] = <a class="code hl_variable" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a7f1cd94cf4da32933e8551cb3577e18b">BLACK</a>;  </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        }</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    }</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="keywordflow">return</span> traversed_path;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>}</div>
+</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>}  <span class="comment">// namespace depth_first_search</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>}  <span class="comment">// namespace graph</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="foldopen" id="foldopen00123" data-start="{" data-end="}">
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"><a class="line" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">  123</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    <span class="keywordtype">size_t</span> start_pos;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Case 1: &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    start_pos = 1;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    std::vector&lt;std::vector&lt;size_t&gt; &gt; g1(3, std::vector&lt;size_t&gt;());</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    graph::depth_first_search::addEdge(&amp;g1, 1, 2);</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    graph::depth_first_search::addEdge(&amp;g1, 2, 3);</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    graph::depth_first_search::addEdge(&amp;g1, 3, 1);</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    std::vector&lt;size_t&gt; expected1 {1, 2, 3}; </div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    assert(graph::depth_first_search::dfs(g1, start_pos - 1) == expected1);</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Case 2: &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    start_pos = 1;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    std::vector&lt;std::vector&lt;size_t&gt; &gt; g2(4, std::vector&lt;size_t&gt;());</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span> </div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    graph::depth_first_search::addEdge(&amp;g2, 1, 2);</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    graph::depth_first_search::addEdge(&amp;g2, 1, 3);</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    graph::depth_first_search::addEdge(&amp;g2, 2, 4);</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    graph::depth_first_search::addEdge(&amp;g2, 4, 1);</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span> </div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    std::vector&lt;size_t&gt; expected2 {1, 3, 2, 4}; </div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    assert(graph::depth_first_search::dfs(g2, start_pos - 1) == expected2);</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span> </div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Case 3: &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    start_pos = 2;</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    std::vector&lt;std::vector&lt;size_t&gt; &gt; g3(4, std::vector&lt;size_t&gt;());</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span> </div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    graph::depth_first_search::addEdge(&amp;g3, 1, 2);</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    graph::depth_first_search::addEdge(&amp;g3, 1, 3);</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    graph::depth_first_search::addEdge(&amp;g3, 2, 4);</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    graph::depth_first_search::addEdge(&amp;g3, 4, 1);</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span> </div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    std::vector&lt;size_t&gt; expected3 {2, 4, 1, 3}; </div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    assert(graph::depth_first_search::dfs(g3, start_pos - 1) == expected3);</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span> </div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>}</div>
+</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span> </div>
+<div class="foldopen" id="foldopen00173" data-start="{" data-end="}">
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"><a class="line" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  173</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    <a class="code hl_function" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// execute the tests</span></div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span> </div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    <span class="keywordtype">size_t</span> vertices = 0, edges = 0, start_pos = 1;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    std::vector&lt;size_t&gt; traversal;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the Vertices : &quot;</span>;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    std::cin &gt;&gt; vertices;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the Edges : &quot;</span>;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    std::cin &gt;&gt; edges;</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span> </div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    std::vector&lt;std::vector&lt;size_t&gt; &gt; adj(vertices, std::vector&lt;size_t&gt;());</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span> </div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the vertices which have edges between them : &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    <span class="keywordflow">while</span> (edges--) {</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>        <span class="keywordtype">size_t</span> u = 0, v = 0;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>        std::cin &gt;&gt; u &gt;&gt; v;</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>        graph::depth_first_search::addEdge(&amp;adj, u, v);</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    }</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span> </div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the starting vertex [1,n]: &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    std::cin &gt;&gt; start_pos;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    start_pos -= 1;</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    traversal = graph::depth_first_search::dfs(adj, start_pos);</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span> </div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> x : traversal) {</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>        std::cout &lt;&lt; x &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    }</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span> </div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>}</div>
+</div>
+<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00019">stack.hpp:19</a></div></div>
+<div class="ttc" id="aclassstack_html_a3647fb4418890f19e0dc414b8092b8b0"><div class="ttname"><a href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00062">stack.hpp:62</a></div></div>
+<div class="ttc" id="aclassstack_html_a90df277532c23519aa7ac3c08ed90a1d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack::push</a></div><div class="ttdeci">void push(const value_type &amp;item)</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00047">stack.hpp:47</a></div></div>
+<div class="ttc" id="aclassstack_html_ae09630c4384903d187801921b2ddc709"><div class="ttname"><a href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">stack::top</a></div><div class="ttdeci">value_type top() const</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00056">stack.hpp:56</a></div></div>
+<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a330a2b0a904f01802ada1f8f3b28e76c"><div class="ttname"><a href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c">INF</a></div><div class="ttdeci">constexpr int64_t INF</div><div class="ttdoc">indicates node has already been explored</div><div class="ttdef"><b>Definition</b> <a href="#l00041">depth_first_search_with_stack.cpp:41</a></div></div>
+<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a43e30173f12330e85cce6239a277527e"><div class="ttname"><a href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a43e30173f12330e85cce6239a277527e">GREY</a></div><div class="ttdeci">constexpr int GREY</div><div class="ttdoc">indicates the node hasn't been explored</div><div class="ttdef"><b>Definition</b> <a href="#l00039">depth_first_search_with_stack.cpp:39</a></div></div>
+<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition</b> <a href="#l00123">depth_first_search_with_stack.cpp:123</a></div></div>
+<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a5738da9f508f6a9e87f123c9fb6f2ea9"><div class="ttname"><a href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9">graph::depth_first_search::dfs</a></div><div class="ttdeci">std::vector&lt; size_t &gt; dfs(const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;graph, size_t start)</div><div class="ttdoc">Explores the given vertex, exploring a vertex means traversing over all the vertices which are connec...</div><div class="ttdef"><b>Definition</b> <a href="#l00087">depth_first_search_with_stack.cpp:87</a></div></div>
+<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a7f1cd94cf4da32933e8551cb3577e18b"><div class="ttname"><a href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a7f1cd94cf4da32933e8551cb3577e18b">BLACK</a></div><div class="ttdeci">constexpr int BLACK</div><div class="ttdoc">indicates node is in stack waiting to be explored</div><div class="ttdef"><b>Definition</b> <a href="#l00040">depth_first_search_with_stack.cpp:40</a></div></div>
+<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00173">depth_first_search_with_stack.cpp:173</a></div></div>
+<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_afb80b42b42381658a12a57a975ecd0c7"><div class="ttname"><a href="../../da/d4b/depth__first__search__with__stack_8cpp.html#afb80b42b42381658a12a57a975ecd0c7">WHITE</a></div><div class="ttdeci">constexpr int WHITE</div><div class="ttdef"><b>Definition</b> <a href="#l00038">depth_first_search_with_stack.cpp:38</a></div></div>
+<div class="ttc" id="anamespacedepth__first__search_html"><div class="ttname"><a href="../../d8/da7/namespacedepth__first__search.html">depth_first_search</a></div><div class="ttdoc">Functions for Depth First Search algorithm.</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 class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00020">paranthesis_matching.cpp:20</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a class="el" href="../../da/d4b/depth__first__search__with__stack_8cpp.html">depth_first_search_with_stack.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html
index 9df44571a..a93014625 100644
--- a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html
+++ b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp File Reference</title>
+<title>TheAlgorithms/C++: bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for count_of_trailing_ciphers_in_factorial_n.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/dbe/count__of__trailing__ciphers__in__factorial__n_8cpp__incl.svg" width="255" height="140"><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">
+</div>
+<p><a href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></td></tr>
@@ -147,6 +166,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p><a href="https://www.tutorialspoint.com/count-trailing-zeros-in-factorial-of-a-number-in-cplusplus" target="_blank">Count the number of ciphers</a> in <code>n!</code> implementation </p>
 <p>Given an integer number as input. The goal is to find the number of trailing zeroes in the factorial calculated for that number. A factorial of a number N is a product of all numbers in the range [1, N].</p>
 <p>We know that we get a trailing zero only if the number is multiple of 10 or has a factor pair (2,5). In all factorials of any number greater than 5, we have many 2s more than 5s in the prime factorization of that number. Dividing a number by powers of 5 will give us the count of 5s in its factors. So, the number of 5s will tell us the number of trailing zeroes. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Swastyy" target="_blank">Swastika Gupta</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html">count_of_trailing_ciphers_in_factorial_n.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -165,17 +186,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html#l00096">96</a> of file <a class="el" href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html">count_of_trailing_ciphers_in_factorial_n.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   96</span>           {</div>
 <div class="line"><span class="lineno">   97</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   98</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   99</span>}</div>
-<div class="ttc" id="acount__of__trailing__ciphers__in__factorial__n_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> count_of_trailing_ciphers_in_factorial_n.cpp:60</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acount__of__trailing__ciphers__in__factorial__n_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html#l00060">count_of_trailing_ciphers_in_factorial_n.cpp:60</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0d5e1d651d0d30bd682f176d8f2b83d0" name="a0d5e1d651d0d30bd682f176d8f2b83d0"></a>
@@ -201,6 +219,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>count, Number of ciphers in <code>n!</code>. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html">count_of_trailing_ciphers_in_factorial_n.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   41</span>                                                 {</div>
 <div class="line"><span class="lineno">   42</span>    <span class="comment">// count is to store the number of 5&#39;s in factorial(n)</span></div>
 <div class="line"><span class="lineno">   43</span>    uint64_t count = 0;</div>
@@ -213,12 +233,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   50</span> </div>
 <div class="line"><span class="lineno">   51</span>    <span class="keywordflow">return</span> count;</div>
 <div class="line"><span class="lineno">   52</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_a0d5e1d651d0d30bd682f176d8f2b83d0_cgraph.svg" width="220" height="106"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -246,46 +261,41 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html#l00060">60</a> of file <a class="el" href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html">count_of_trailing_ciphers_in_factorial_n.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   60</span>                   {</div>
 <div class="line"><span class="lineno">   61</span>    <span class="comment">// 1st test</span></div>
-<div class="line"><span class="lineno">   62</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1st test &quot;</span>;</div>
+<div class="line"><span class="lineno">   62</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test &quot;</span>;</div>
 <div class="line"><span class="lineno">   63</span>    assert(bit_manipulation::count_of_trailing_ciphers_in_factorial_n::</div>
 <div class="line"><span class="lineno">   64</span>               <a class="code hl_function" href="#a0d5e1d651d0d30bd682f176d8f2b83d0">numberOfCiphersInFactorialN</a>(395) == 97);</div>
-<div class="line"><span class="lineno">   65</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   65</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   66</span> </div>
 <div class="line"><span class="lineno">   67</span>    <span class="comment">// 2nd test</span></div>
-<div class="line"><span class="lineno">   68</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2nd test &quot;</span>;</div>
+<div class="line"><span class="lineno">   68</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test &quot;</span>;</div>
 <div class="line"><span class="lineno">   69</span>    assert(bit_manipulation::count_of_trailing_ciphers_in_factorial_n::</div>
 <div class="line"><span class="lineno">   70</span>               <a class="code hl_function" href="#a0d5e1d651d0d30bd682f176d8f2b83d0">numberOfCiphersInFactorialN</a>(977) == 242);</div>
-<div class="line"><span class="lineno">   71</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   72</span> </div>
 <div class="line"><span class="lineno">   73</span>    <span class="comment">// 3rd test</span></div>
-<div class="line"><span class="lineno">   74</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;3rd test &quot;</span>;</div>
+<div class="line"><span class="lineno">   74</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test &quot;</span>;</div>
 <div class="line"><span class="lineno">   75</span>    assert(bit_manipulation::count_of_trailing_ciphers_in_factorial_n::</div>
 <div class="line"><span class="lineno">   76</span>               <a class="code hl_function" href="#a0d5e1d651d0d30bd682f176d8f2b83d0">numberOfCiphersInFactorialN</a>(871) == 215);</div>
-<div class="line"><span class="lineno">   77</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   77</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   78</span> </div>
 <div class="line"><span class="lineno">   79</span>    <span class="comment">// 4th test</span></div>
-<div class="line"><span class="lineno">   80</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;4th test &quot;</span>;</div>
+<div class="line"><span class="lineno">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;4th test &quot;</span>;</div>
 <div class="line"><span class="lineno">   81</span>    assert(bit_manipulation::count_of_trailing_ciphers_in_factorial_n::</div>
 <div class="line"><span class="lineno">   82</span>               <a class="code hl_function" href="#a0d5e1d651d0d30bd682f176d8f2b83d0">numberOfCiphersInFactorialN</a>(239) == 57);</div>
-<div class="line"><span class="lineno">   83</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   83</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   84</span> </div>
 <div class="line"><span class="lineno">   85</span>    <span class="comment">// 5th test</span></div>
-<div class="line"><span class="lineno">   86</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;5th test &quot;</span>;</div>
+<div class="line"><span class="lineno">   86</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;5th test &quot;</span>;</div>
 <div class="line"><span class="lineno">   87</span>    assert(bit_manipulation::count_of_trailing_ciphers_in_factorial_n::</div>
 <div class="line"><span class="lineno">   88</span>               <a class="code hl_function" href="#a0d5e1d651d0d30bd682f176d8f2b83d0">numberOfCiphersInFactorialN</a>(0) == 0);</div>
-<div class="line"><span class="lineno">   89</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   90</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="acount__of__trailing__ciphers__in__factorial__n_8cpp_html_a0d5e1d651d0d30bd682f176d8f2b83d0"><div class="ttname"><a href="#a0d5e1d651d0d30bd682f176d8f2b83d0">bit_manipulation::count_of_trailing_ciphers_in_factorial_n::numberOfCiphersInFactorialN</a></div><div class="ttdeci">uint64_t numberOfCiphersInFactorialN(uint64_t n)</div><div class="ttdoc">Function to count the number of the trailing ciphers.</div><div class="ttdef"><b>Definition</b> count_of_trailing_ciphers_in_factorial_n.cpp:41</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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acount__of__trailing__ciphers__in__factorial__n_8cpp_html_a0d5e1d651d0d30bd682f176d8f2b83d0"><div class="ttname"><a href="#a0d5e1d651d0d30bd682f176d8f2b83d0">bit_manipulation::count_of_trailing_ciphers_in_factorial_n::numberOfCiphersInFactorialN</a></div><div class="ttdeci">uint64_t numberOfCiphersInFactorialN(uint64_t n)</div><div class="ttdoc">Function to count the number of the trailing ciphers.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html#l00041">count_of_trailing_ciphers_in_factorial_n.cpp:41</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_a0d5e1d651d0d30bd682f176d8f2b83d0_cgraph.map b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_a0d5e1d651d0d30bd682f176d8f2b83d0_cgraph.map
deleted file mode 100644
index e196cd4f3..000000000
--- a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_a0d5e1d651d0d30bd682f176d8f2b83d0_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="bit_manipulation::count_of_trailing_ciphers_in_factorial_n::numberOfCiphersInFactorialN" name="bit_manipulation::count_of_trailing_ciphers_in_factorial_n::numberOfCiphersInFactorialN">
-<area shape="rect" id="Node000001" title="Function to count the number of the trailing ciphers." alt="" coords="5,29,215,100"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="68,28,70,18,78,10,92,5,110,3,131,5,145,12,142,17,130,10,110,8,93,10,81,14,75,21,73,29"/>
-</map>
diff --git a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_a0d5e1d651d0d30bd682f176d8f2b83d0_cgraph.md5 b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_a0d5e1d651d0d30bd682f176d8f2b83d0_cgraph.md5
deleted file mode 100644
index 7b8930fa6..000000000
--- a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_a0d5e1d651d0d30bd682f176d8f2b83d0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8db6bce5b538bde6d9d3203e9dd41c61
\ No newline at end of file
diff --git a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_a0d5e1d651d0d30bd682f176d8f2b83d0_cgraph.svg b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_a0d5e1d651d0d30bd682f176d8f2b83d0_cgraph.svg
deleted file mode 100644
index 4df1ad3e6..000000000
--- a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_a0d5e1d651d0d30bd682f176d8f2b83d0_cgraph.svg
+++ /dev/null
@@ -1,59 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: bit_manipulation::count_of_trailing_ciphers_in_factorial_n::numberOfCiphersInFactorialN Pages: 1 -->
-<svg width="165pt" height="79pt"
- viewBox="0.00 0.00 165.00 79.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 75)">
-<title>bit_manipulation::count_of_trailing_ciphers_in_factorial_n::numberOfCiphersInFactorialN</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to count the number of the trailing ciphers.">
-<polygon fill="#999999" stroke="#666666" points="157,-53 0,-53 0,0 157,0 157,-53"/>
-<text text-anchor="start" x="8" y="-39.5" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::count</text>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">_of_trailing_ciphers_in</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_factorial_n::numberOfCiphersIn</text>
-<text text-anchor="middle" x="78.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">FactorialN</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M49.09,-53.44C48.46,-63.11 58.26,-71 78.5,-71 90.52,-71 98.85,-68.22 103.51,-63.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.69,-65.41 107.32,-54.83 100.23,-62.71 106.69,-65.41"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_a0d5e1d651d0d30bd682f176d8f2b83d0_cgraph_org.svg b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_a0d5e1d651d0d30bd682f176d8f2b83d0_cgraph_org.svg
deleted file mode 100644
index d0f267436..000000000
--- a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_a0d5e1d651d0d30bd682f176d8f2b83d0_cgraph_org.svg
+++ /dev/null
@@ -1,33 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: bit_manipulation::count_of_trailing_ciphers_in_factorial_n::numberOfCiphersInFactorialN Pages: 1 -->
-<svg width="165pt" height="79pt"
- viewBox="0.00 0.00 165.00 79.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 75)">
-<title>bit_manipulation::count_of_trailing_ciphers_in_factorial_n::numberOfCiphersInFactorialN</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to count the number of the trailing ciphers.">
-<polygon fill="#999999" stroke="#666666" points="157,-53 0,-53 0,0 157,0 157,-53"/>
-<text text-anchor="start" x="8" y="-39.5" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::count</text>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">_of_trailing_ciphers_in</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_factorial_n::numberOfCiphersIn</text>
-<text text-anchor="middle" x="78.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">FactorialN</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M49.09,-53.44C48.46,-63.11 58.26,-71 78.5,-71 90.52,-71 98.85,-68.22 103.51,-63.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.69,-65.41 107.32,-54.83 100.23,-62.71 106.69,-65.41"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index e85e01374..000000000
--- a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 5901bc148..000000000
--- a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-729fb887ee50b6291b0542ba0592a5c7
\ No newline at end of file
diff --git a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 2e04695b9..000000000
--- a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1813bd719..000000000
--- a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index e86b23286..000000000
--- a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index b8b4ca676..000000000
--- a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-afaa3670dacf841e2a13de1f642a9142
\ No newline at end of file
diff --git a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 258e1aa1e..000000000
--- a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 51cfa4382..000000000
--- a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html
new file mode 100644
index 000000000..d953f5a72
--- /dev/null
+++ b/da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html
@@ -0,0 +1,206 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">count_of_trailing_ciphers_in_factorial_n.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a> {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html">count_of_trailing_ciphers_in_factorial_n</a> {</div>
+<div class="foldopen" id="foldopen00041" data-start="{" data-end="}">
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#a0d5e1d651d0d30bd682f176d8f2b83d0">   41</a></span>uint64_t <a class="code hl_function" href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#a0d5e1d651d0d30bd682f176d8f2b83d0">numberOfCiphersInFactorialN</a>(uint64_t n) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="comment">// count is to store the number of 5&#39;s in factorial(n)</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    uint64_t count = 0;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="comment">// Keep dividing n by powers of</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="comment">// 5 and update count</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">for</span> (uint64_t i = 5; n / i &gt;= 1; i *= 5) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        count += <span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>(n) / i;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordflow">return</span> count;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>}</div>
+</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>}  <span class="comment">// namespace count_of_trailing_ciphers_in_factorial_n</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>}  <span class="comment">// namespace bit_manipulation</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="foldopen" id="foldopen00060" data-start="{" data-end="}">
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"><a class="line" href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   60</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="comment">// 1st test</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test &quot;</span>;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    assert(bit_manipulation::count_of_trailing_ciphers_in_factorial_n::</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>               numberOfCiphersInFactorialN(395) == 97);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="comment">// 2nd test</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test &quot;</span>;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    assert(bit_manipulation::count_of_trailing_ciphers_in_factorial_n::</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>               numberOfCiphersInFactorialN(977) == 242);</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="comment">// 3rd test</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test &quot;</span>;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    assert(bit_manipulation::count_of_trailing_ciphers_in_factorial_n::</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>               numberOfCiphersInFactorialN(871) == 215);</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="comment">// 4th test</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;4th test &quot;</span>;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    assert(bit_manipulation::count_of_trailing_ciphers_in_factorial_n::</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>               numberOfCiphersInFactorialN(239) == 57);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="comment">// 5th test</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;5th test &quot;</span>;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    assert(bit_manipulation::count_of_trailing_ciphers_in_factorial_n::</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>               numberOfCiphersInFactorialN(0) == 0);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>}</div>
+</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="foldopen" id="foldopen00096" data-start="{" data-end="}">
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"><a class="line" href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   96</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <a class="code hl_function" href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>}</div>
+</div>
+<div class="ttc" id="acount__of__trailing__ciphers__in__factorial__n_8cpp_html_a0d5e1d651d0d30bd682f176d8f2b83d0"><div class="ttname"><a href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#a0d5e1d651d0d30bd682f176d8f2b83d0">bit_manipulation::count_of_trailing_ciphers_in_factorial_n::numberOfCiphersInFactorialN</a></div><div class="ttdeci">uint64_t numberOfCiphersInFactorialN(uint64_t n)</div><div class="ttdoc">Function to count the number of the trailing ciphers.</div><div class="ttdef"><b>Definition</b> <a href="#l00041">count_of_trailing_ciphers_in_factorial_n.cpp:41</a></div></div>
+<div class="ttc" id="acount__of__trailing__ciphers__in__factorial__n_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_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> <a href="#l00060">count_of_trailing_ciphers_in_factorial_n.cpp:60</a></div></div>
+<div class="ttc" id="acount__of__trailing__ciphers__in__factorial__n_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00096">count_of_trailing_ciphers_in_factorial_n.cpp:96</a></div></div>
+<div class="ttc" id="anamespacebit__manipulation_html"><div class="ttname"><a href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacecount__of__trailing__ciphers__in__factorial__n_html"><div class="ttname"><a href="../../dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html">count_of_trailing_ciphers_in_factorial_n</a></div><div class="ttdoc">Functions for the Count the number of ciphers in n! implementation.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_f3c4fbc4e901afa0a54d0623c5574aa7.html">bit_manipulation</a></li><li class="navelem"><a class="el" href="../../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html">count_of_trailing_ciphers_in_factorial_n.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/d52/minimum__edit__distance_8cpp.html b/da/d52/minimum__edit__distance_8cpp.html
index ab93f648d..af2bea271 100644
--- a/da/d52/minimum__edit__distance_8cpp.html
+++ b/da/d52/minimum__edit__distance_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/minimum_edit_distance.cpp File Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming/minimum_edit_distance.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for minimum_edit_distance.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d3d/minimum__edit__distance_8cpp__incl.svg" width="336" height="126"><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">
+</div>
+<p><a href="../../da/d52/minimum__edit__distance_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
@@ -137,7 +156,7 @@ Functions</h2></td></tr>
 <tr class="memitem:a0138c226bd79ffe6d839c787cfc60347" id="r_a0138c226bd79ffe6d839c787cfc60347"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0138c226bd79ffe6d839c787cfc60347">dynamic_programming::minimum_edit_distance::min</a> (uint64_t x, uint64_t y, uint64_t z)</td></tr>
 <tr class="memdesc:a0138c226bd79ffe6d839c787cfc60347"><td class="mdescLeft">&#160;</td><td class="mdescRight">Takes input of the cost of three operations: Insert, Replace and Delete and return the minimum cost among them.  <br /></td></tr>
 <tr class="separator:a0138c226bd79ffe6d839c787cfc60347"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ade2fcfe0359f3c7691bfaa04b14943e2" id="r_ade2fcfe0359f3c7691bfaa04b14943e2"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ade2fcfe0359f3c7691bfaa04b14943e2">dynamic_programming::minimum_edit_distance::editDistDP</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> str1, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> str2, uint64_t m, uint64_t n)</td></tr>
+<tr class="memitem:ade2fcfe0359f3c7691bfaa04b14943e2" id="r_ade2fcfe0359f3c7691bfaa04b14943e2"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ade2fcfe0359f3c7691bfaa04b14943e2">dynamic_programming::minimum_edit_distance::editDistDP</a> (std::string str1, std::string str2, uint64_t m, uint64_t n)</td></tr>
 <tr class="memdesc:ade2fcfe0359f3c7691bfaa04b14943e2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Calculates and stores the result of all the sub-problems, so that we don't have to recur to compute the minimum cost of a particular operation if it is already computed and stored in the <code>dp</code> vector.  <br /></td></tr>
 <tr class="separator:ade2fcfe0359f3c7691bfaa04b14943e2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -157,6 +176,8 @@ Algorithm</h3>
 <li>Else, (If last characters are not the same), we will consider all three operations (Insert, Remove, Replace) on the last character of the first string and compute the minimum cost for all three operations and take the minimum of three values in the DP array. For Insert: Recur for m and n-1 For Remove: Recur for for m-1 and n For Replace: Recur for for m-1 and n-1</li>
 </ol>
 <dl class="section author"><dt>Author</dt><dd><a href="../../github.com/nirzak" target="_blank">Nirjas Jakilim</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../da/d52/minimum__edit__distance_8cpp_source.html">minimum_edit_distance.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ade2fcfe0359f3c7691bfaa04b14943e2" name="ade2fcfe0359f3c7691bfaa04b14943e2"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ade2fcfe0359f3c7691bfaa04b14943e2">&#9670;&#160;</a></span>editDistDP()</h2>
@@ -167,12 +188,12 @@ Algorithm</h3>
         <tr>
           <td class="memname">uint64_t dynamic_programming::minimum_edit_distance::editDistDP </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>str1</em></span>, </td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>str1</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>str2</em></span>, </td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>str2</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -209,51 +230,40 @@ Algorithm</h3>
 <p>If last characters are same, ignore last char and recur for remaining string</p>
 <p>If the last character is different, consider all possibilities and find the minimum</p>
 <p>returning the minimum cost of operations needed to convert str1 to str2</p>
-<div class="fragment"><div class="line"><span class="lineno">   93</span>                                {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   94</span><span class="comment">    /// Create a table to store results of subproblems</span></div>
-<div class="line"><span class="lineno">   95</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;uint64_t&gt;</a>&gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(</div>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d52/minimum__edit__distance_8cpp_source.html#l00092">92</a> of file <a class="el" href="../../da/d52/minimum__edit__distance_8cpp_source.html">minimum_edit_distance.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   93</span>                                {</div>
+<div class="line"><span class="lineno">   95</span>    std::vector&lt;std::vector&lt;uint64_t&gt;&gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(</div>
 <div class="line"><span class="lineno">   96</span>        m + 1,</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&lt;uint64_t&gt;</a>(</div>
+<div class="line"><span class="lineno">   97</span>        std::vector&lt;uint64_t&gt;(</div>
 <div class="line"><span class="lineno">   98</span>            n +</div>
-<div class="line"><span class="lineno">   99</span>            1));  <span class="comment">/// creasting 2D vector dp to store the results of subproblems</span></div>
-<div class="line"><span class="lineno">  100</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  101</span><span class="comment">    /// Fill d[][] in bottom up manner</span></div>
-<div class="line"><span class="lineno">  102</span><span class="comment"></span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt;= m; i++) {</div>
-<div class="line"><span class="lineno">  103</span>        <span class="keywordflow">for</span> (uint64_t j = 0; j &lt;= n; j++) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  104</span><span class="comment">            /// If first string is empty, only option is to</span></div>
-<div class="line"><span class="lineno">  105</span><span class="comment">            /// insert all characters of second string</span></div>
-<div class="line"><span class="lineno">  106</span><span class="comment"></span>            <span class="keywordflow">if</span> (i == 0) {</div>
-<div class="line"><span class="lineno">  107</span>                <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j] = j;  <span class="comment">/// Minimum operations = j</span></div>
+<div class="line"><span class="lineno">   99</span>            1));  </div>
+<div class="line"><span class="lineno">  100</span> </div>
+<div class="line"><span class="lineno">  102</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt;= m; i++) {</div>
+<div class="line"><span class="lineno">  103</span>        <span class="keywordflow">for</span> (uint64_t j = 0; j &lt;= n; j++) {</div>
+<div class="line"><span class="lineno">  106</span>            <span class="keywordflow">if</span> (i == 0) {</div>
+<div class="line"><span class="lineno">  107</span>                <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j] = j;  </div>
 <div class="line"><span class="lineno">  108</span>            }</div>
-<div class="line"><span class="lineno">  109</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  110</span><span class="comment">            /// If second string is empty, only option is to</span></div>
-<div class="line"><span class="lineno">  111</span><span class="comment">            /// remove all characters of second string</span></div>
-<div class="line"><span class="lineno">  112</span><span class="comment"></span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (j == 0) {</div>
-<div class="line"><span class="lineno">  113</span>                <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j] = i;  <span class="comment">/// Minimum operations = i</span></div>
+<div class="line"><span class="lineno">  109</span> </div>
+<div class="line"><span class="lineno">  112</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (j == 0) {</div>
+<div class="line"><span class="lineno">  113</span>                <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j] = i;  </div>
 <div class="line"><span class="lineno">  114</span>            }</div>
-<div class="line"><span class="lineno">  115</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  116</span><span class="comment">            /// If last characters are same, ignore last char</span></div>
-<div class="line"><span class="lineno">  117</span><span class="comment">            /// and recur for remaining string</span></div>
-<div class="line"><span class="lineno">  118</span><span class="comment"></span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str1[i - 1] == str2[j - 1]) {</div>
+<div class="line"><span class="lineno">  115</span> </div>
+<div class="line"><span class="lineno">  118</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str1[i - 1] == str2[j - 1]) {</div>
 <div class="line"><span class="lineno">  119</span>                <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j] = <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i - 1][j - 1];</div>
 <div class="line"><span class="lineno">  120</span>            }</div>
-<div class="line"><span class="lineno">  121</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  122</span><span class="comment">            /// If the last character is different, consider all</span></div>
-<div class="line"><span class="lineno">  123</span><span class="comment">            /// possibilities and find the minimum</span></div>
-<div class="line"><span class="lineno">  124</span><span class="comment"></span>            <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  125</span>                <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j] = 1 + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a>(<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j - 1],       <span class="comment">// Insert</span></div>
+<div class="line"><span class="lineno">  121</span> </div>
+<div class="line"><span class="lineno">  124</span>            <span class="keywordflow">else</span> {</div>
+<div class="line"><span class="lineno">  125</span>                <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j] = 1 + min(<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j - 1],       <span class="comment">// Insert</span></div>
 <div class="line"><span class="lineno">  126</span>                                   <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i - 1][j],       <span class="comment">// Remove</span></div>
 <div class="line"><span class="lineno">  127</span>                                   <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i - 1][j - 1]);  <span class="comment">// Replace</span></div>
 <div class="line"><span class="lineno">  128</span>            }</div>
 <div class="line"><span class="lineno">  129</span>        }</div>
 <div class="line"><span class="lineno">  130</span>    }</div>
 <div class="line"><span class="lineno">  131</span> </div>
-<div class="line"><span class="lineno">  132</span>    <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[m][n];  <span class="comment">/// returning the minimum cost of operations needed to</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  133</span><span class="comment">                      /// convert str1 to str2</span></div>
-<div class="line"><span class="lineno">  134</span><span class="comment"></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="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="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
+<div class="line"><span class="lineno">  132</span>    <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[m][n];  </div>
+<div class="line"><span class="lineno">  134</span>}</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> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -285,17 +295,14 @@ Algorithm</h3>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d52/minimum__edit__distance_8cpp_source.html#l00173">173</a> of file <a class="el" href="../../da/d52/minimum__edit__distance_8cpp_source.html">minimum_edit_distance.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  173</span>                                 {</div>
 <div class="line"><span class="lineno">  174</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  175</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  176</span>}</div>
-<div class="ttc" id="aminimum__edit__distance_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> minimum_edit_distance.cpp:142</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d52/minimum__edit__distance_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="322" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aminimum__edit__distance_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d52/minimum__edit__distance_8cpp_source.html#l00142">minimum_edit_distance.cpp:142</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0138c226bd79ffe6d839c787cfc60347" name="a0138c226bd79ffe6d839c787cfc60347"></a>
@@ -339,14 +346,16 @@ z if <code>z</code> is the minimum value </dd></dl>
 <p>returns x, if x is the minimum value</p>
 <p>returns y, if y is the minimum value</p>
 <p>returns z if z is the minimum value</p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d52/minimum__edit__distance_8cpp_source.html#l00068">68</a> of file <a class="el" href="../../da/d52/minimum__edit__distance_8cpp_source.html">minimum_edit_distance.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   68</span>                                                 {</div>
 <div class="line"><span class="lineno">   69</span>    <span class="keywordflow">if</span> (x &lt;= y &amp;&amp; x &lt;= z) {</div>
-<div class="line"><span class="lineno">   70</span>        <span class="keywordflow">return</span> x;  <span class="comment">/// returns x, if x is the minimum value</span></div>
+<div class="line"><span class="lineno">   70</span>        <span class="keywordflow">return</span> x;  </div>
 <div class="line"><span class="lineno">   71</span>    }</div>
 <div class="line"><span class="lineno">   72</span>    <span class="keywordflow">if</span> (y &lt;= x &amp;&amp; y &lt;= z) {</div>
-<div class="line"><span class="lineno">   73</span>        <span class="keywordflow">return</span> y;  <span class="comment">/// returns y, if y is the minimum value</span></div>
+<div class="line"><span class="lineno">   73</span>        <span class="keywordflow">return</span> y;  </div>
 <div class="line"><span class="lineno">   74</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   75</span>        <span class="keywordflow">return</span> z;  <span class="comment">/// returns z if z is the minimum value</span></div>
+<div class="line"><span class="lineno">   75</span>        <span class="keywordflow">return</span> z;  </div>
 <div class="line"><span class="lineno">   76</span>    }</div>
 <div class="line"><span class="lineno">   77</span>}</div>
 </div><!-- fragment -->
@@ -377,41 +386,34 @@ z if <code>z</code> is the minimum value </dd></dl>
 
 <p>Self-test implementations. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d52/minimum__edit__distance_8cpp_source.html#l00142">142</a> of file <a class="el" href="../../da/d52/minimum__edit__distance_8cpp_source.html">minimum_edit_distance.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  142</span>                   {</div>
 <div class="line"><span class="lineno">  143</span>    <span class="comment">// 1st test</span></div>
-<div class="line"><span class="lineno">  144</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> str1 = <span class="stringliteral">&quot;INTENTION&quot;</span>;  <span class="comment">// Sample input of 1st string</span></div>
-<div class="line"><span class="lineno">  145</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> str2 = <span class="stringliteral">&quot;EXECUTION&quot;</span>;  <span class="comment">// Sample input of 2nd string</span></div>
+<div class="line"><span class="lineno">  144</span>    std::string str1 = <span class="stringliteral">&quot;INTENTION&quot;</span>;  <span class="comment">// Sample input of 1st string</span></div>
+<div class="line"><span class="lineno">  145</span>    std::string str2 = <span class="stringliteral">&quot;EXECUTION&quot;</span>;  <span class="comment">// Sample input of 2nd string</span></div>
 <div class="line"><span class="lineno">  146</span>    uint64_t expected_output1 = 5;   <span class="comment">// Expected minimum cost</span></div>
 <div class="line"><span class="lineno">  147</span>    uint64_t output1 = <a class="code hl_function" href="#ade2fcfe0359f3c7691bfaa04b14943e2">dynamic_programming::minimum_edit_distance::editDistDP</a>(</div>
-<div class="line"><span class="lineno">  148</span>        str1, str2, str1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>(),</div>
-<div class="line"><span class="lineno">  149</span>        str2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>());  <span class="comment">// calling the editDistDP function and storing the</span></div>
+<div class="line"><span class="lineno">  148</span>        str1, str2, str1.length(),</div>
+<div class="line"><span class="lineno">  149</span>        str2.length());  <span class="comment">// calling the editDistDP function and storing the</span></div>
 <div class="line"><span class="lineno">  150</span>                         <span class="comment">// result on output1</span></div>
 <div class="line"><span class="lineno">  151</span>    assert(output1 ==</div>
 <div class="line"><span class="lineno">  152</span>           expected_output1);  <span class="comment">// comparing the output with the expected output</span></div>
-<div class="line"><span class="lineno">  153</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Minimum Number of Operations Required: &quot;</span> &lt;&lt; output1</div>
-<div class="line"><span class="lineno">  154</span>              &lt;&lt; <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">  153</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Minimum Number of Operations Required: &quot;</span> &lt;&lt; output1</div>
+<div class="line"><span class="lineno">  154</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  155</span> </div>
 <div class="line"><span class="lineno">  156</span>    <span class="comment">// 2nd test</span></div>
-<div class="line"><span class="lineno">  157</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> str3 = <span class="stringliteral">&quot;SATURDAY&quot;</span>;</div>
-<div class="line"><span class="lineno">  158</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> str4 = <span class="stringliteral">&quot;SUNDAY&quot;</span>;</div>
+<div class="line"><span class="lineno">  157</span>    std::string str3 = <span class="stringliteral">&quot;SATURDAY&quot;</span>;</div>
+<div class="line"><span class="lineno">  158</span>    std::string str4 = <span class="stringliteral">&quot;SUNDAY&quot;</span>;</div>
 <div class="line"><span class="lineno">  159</span>    uint64_t expected_output2 = 3;</div>
 <div class="line"><span class="lineno">  160</span>    uint64_t output2 = <a class="code hl_function" href="#ade2fcfe0359f3c7691bfaa04b14943e2">dynamic_programming::minimum_edit_distance::editDistDP</a>(</div>
-<div class="line"><span class="lineno">  161</span>        str3, str4, str3.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>(), str4.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>());</div>
+<div class="line"><span class="lineno">  161</span>        str3, str4, str3.length(), str4.length());</div>
 <div class="line"><span class="lineno">  162</span>    assert(output2 == expected_output2);</div>
-<div class="line"><span class="lineno">  163</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Minimum Number of Operations Required: &quot;</span> &lt;&lt; output2</div>
-<div class="line"><span class="lineno">  164</span>              &lt;&lt; <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">  163</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Minimum Number of Operations Required: &quot;</span> &lt;&lt; output2</div>
+<div class="line"><span class="lineno">  164</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  165</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="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="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="aminimum__edit__distance_8cpp_html_ade2fcfe0359f3c7691bfaa04b14943e2"><div class="ttname"><a href="#ade2fcfe0359f3c7691bfaa04b14943e2">dynamic_programming::minimum_edit_distance::editDistDP</a></div><div class="ttdeci">uint64_t editDistDP(std::string str1, std::string str2, uint64_t m, uint64_t n)</div><div class="ttdoc">Calculates and stores the result of all the sub-problems, so that we don't have to recur to compute t...</div><div class="ttdef"><b>Definition</b> minimum_edit_distance.cpp:92</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::length</a></div><div class="ttdeci">T length(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d52/minimum__edit__distance_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="224" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aminimum__edit__distance_8cpp_html_ade2fcfe0359f3c7691bfaa04b14943e2"><div class="ttname"><a href="#ade2fcfe0359f3c7691bfaa04b14943e2">dynamic_programming::minimum_edit_distance::editDistDP</a></div><div class="ttdeci">uint64_t editDistDP(std::string str1, std::string str2, uint64_t m, uint64_t n)</div><div class="ttdoc">Calculates and stores the result of all the sub-problems, so that we don't have to recur to compute t...</div><div class="ttdef"><b>Definition</b> <a href="../../da/d52/minimum__edit__distance_8cpp_source.html#l00092">minimum_edit_distance.cpp:92</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/da/d52/minimum__edit__distance_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/da/d52/minimum__edit__distance_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
deleted file mode 100644
index 2c3b1278e..000000000
--- a/da/d52/minimum__edit__distance_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="main function" alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,31,146,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,41,87,41,87,46,55,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="220,5,291,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,37,204,25,205,31,147,42"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="194,55,316,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="147,45,179,51,178,56,146,50"/>
-</map>
diff --git a/da/d52/minimum__edit__distance_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/da/d52/minimum__edit__distance_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
deleted file mode 100644
index b16a52379..000000000
--- a/da/d52/minimum__edit__distance_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-47edd03b069725b7fec56bef0e6b0ab5
\ No newline at end of file
diff --git a/da/d52/minimum__edit__distance_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/da/d52/minimum__edit__distance_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
deleted file mode 100644
index 9caf27590..000000000
--- a/da/d52/minimum__edit__distance_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="241pt" height="64pt"
- viewBox="0.00 0.00 241.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.12,-56.25 160.62,-56.25 160.62,-37 214.12,-37 214.12,-56.25"/>
-<text text-anchor="middle" x="187.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-30.68C117.45,-33 134.14,-36.3 149.29,-39.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.49,-42.7 158.98,-41.21 149.85,-35.84 148.49,-42.7"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.25,-19.25 141.5,-19.25 141.5,0 233.25,0 233.25,-19.25"/>
-<text text-anchor="middle" x="187.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-24.73C112.49,-23.46 120.92,-21.88 129.76,-20.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.4,-23.67 139.58,-18.39 129.11,-16.79 130.4,-23.67"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d52/minimum__edit__distance_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/da/d52/minimum__edit__distance_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
deleted file mode 100644
index 2e146d002..000000000
--- a/da/d52/minimum__edit__distance_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="241pt" height="64pt"
- viewBox="0.00 0.00 241.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.12,-56.25 160.62,-56.25 160.62,-37 214.12,-37 214.12,-56.25"/>
-<text text-anchor="middle" x="187.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-30.68C117.45,-33 134.14,-36.3 149.29,-39.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.49,-42.7 158.98,-41.21 149.85,-35.84 148.49,-42.7"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.25,-19.25 141.5,-19.25 141.5,0 233.25,0 233.25,-19.25"/>
-<text text-anchor="middle" x="187.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-24.73C112.49,-23.46 120.92,-21.88 129.76,-20.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.4,-23.67 139.58,-18.39 129.11,-16.79 130.4,-23.67"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d52/minimum__edit__distance_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/da/d52/minimum__edit__distance_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index d5ce8fa7e..000000000
--- a/da/d52/minimum__edit__distance_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,31,49,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="122,5,194,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,37,107,25,108,31,49,42"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="97,55,219,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="49,45,82,51,81,56,48,50"/>
-</map>
diff --git a/da/d52/minimum__edit__distance_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/da/d52/minimum__edit__distance_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 151083193..000000000
--- a/da/d52/minimum__edit__distance_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-07b428c2c3526928ee1215ab64993828
\ No newline at end of file
diff --git a/da/d52/minimum__edit__distance_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/da/d52/minimum__edit__distance_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 7c2650efd..000000000
--- a/da/d52/minimum__edit__distance_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="168pt" height="64pt"
- viewBox="0.00 0.00 168.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.12,-56.25 87.62,-56.25 87.62,-37 141.12,-37 141.12,-56.25"/>
-<text text-anchor="middle" x="114.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-30.68C44.45,-33 61.14,-36.3 76.29,-39.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.49,-42.7 85.98,-41.21 76.85,-35.84 75.49,-42.7"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-19.25 68.5,-19.25 68.5,0 160.25,0 160.25,-19.25"/>
-<text text-anchor="middle" x="114.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-24.73C39.49,-23.46 47.92,-21.88 56.76,-20.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.4,-23.67 66.58,-18.39 56.11,-16.79 57.4,-23.67"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d52/minimum__edit__distance_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/da/d52/minimum__edit__distance_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 2cdd692e6..000000000
--- a/da/d52/minimum__edit__distance_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="168pt" height="64pt"
- viewBox="0.00 0.00 168.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.12,-56.25 87.62,-56.25 87.62,-37 141.12,-37 141.12,-56.25"/>
-<text text-anchor="middle" x="114.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-30.68C44.45,-33 61.14,-36.3 76.29,-39.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.49,-42.7 85.98,-41.21 76.85,-35.84 75.49,-42.7"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-19.25 68.5,-19.25 68.5,0 160.25,0 160.25,-19.25"/>
-<text text-anchor="middle" x="114.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-24.73C39.49,-23.46 47.92,-21.88 56.76,-20.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.4,-23.67 66.58,-18.39 56.11,-16.79 57.4,-23.67"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d52/minimum__edit__distance_8cpp_source.html b/da/d52/minimum__edit__distance_8cpp_source.html
new file mode 100644
index 000000000..1beaca2e7
--- /dev/null
+++ b/da/d52/minimum__edit__distance_8cpp_source.html
@@ -0,0 +1,234 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/minimum_edit_distance.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/d52/minimum__edit__distance_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">minimum_edit_distance.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/d52/minimum__edit__distance_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="preprocessor">#include &lt;cstdint&gt;</span>   </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a> {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="keyword">namespace </span>minimum_edit_distance {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="foldopen" id="foldopen00068" data-start="{" data-end="}">
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"><a class="line" href="../../da/d52/minimum__edit__distance_8cpp.html#a0138c226bd79ffe6d839c787cfc60347">   68</a></span>uint64_t min(uint64_t x, uint64_t y, uint64_t z) {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordflow">if</span> (x &lt;= y &amp;&amp; x &lt;= z) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        <span class="keywordflow">return</span> x;  </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keywordflow">if</span> (y &lt;= x &amp;&amp; y &lt;= z) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        <span class="keywordflow">return</span> y;  </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        <span class="keywordflow">return</span> z;  </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    }</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>}</div>
+</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="foldopen" id="foldopen00092" data-start="{" data-end="}">
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="../../da/d52/minimum__edit__distance_8cpp.html#ade2fcfe0359f3c7691bfaa04b14943e2">   92</a></span>uint64_t editDistDP(std::string str1, std::string str2, uint64_t m,</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>                    uint64_t n) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    std::vector&lt;std::vector&lt;uint64_t&gt;&gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        m + 1,</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        std::vector&lt;uint64_t&gt;(</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>            n +</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>            1));  </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt;= m; i++) {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        <span class="keywordflow">for</span> (uint64_t j = 0; j &lt;= n; j++) {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>            <span class="keywordflow">if</span> (i == 0) {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>                <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j] = j;  </div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>            }</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (j == 0) {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>                <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j] = i;  </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>            }</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str1[i - 1] == str2[j - 1]) {</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>                <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j] = <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i - 1][j - 1];</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>            }</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>            <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>                <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j] = 1 + min(<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][j - 1],       <span class="comment">// Insert</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>                                   <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i - 1][j],       <span class="comment">// Remove</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>                                   <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i - 1][j - 1]);  <span class="comment">// Replace</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>            }</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        }</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    }</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[m][n];  </div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>}</div>
+</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>}  <span class="comment">// namespace minimum_edit_distance</span></div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>}  <span class="comment">// namespace dynamic_programming</span></div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span> </div>
+<div class="foldopen" id="foldopen00142" data-start="{" data-end="}">
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"><a class="line" href="../../da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  142</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <span class="comment">// 1st test</span></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    std::string str1 = <span class="stringliteral">&quot;INTENTION&quot;</span>;  <span class="comment">// Sample input of 1st string</span></div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    std::string str2 = <span class="stringliteral">&quot;EXECUTION&quot;</span>;  <span class="comment">// Sample input of 2nd string</span></div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    uint64_t expected_output1 = 5;   <span class="comment">// Expected minimum cost</span></div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    uint64_t output1 = dynamic_programming::minimum_edit_distance::editDistDP(</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        str1, str2, str1.length(),</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        str2.length());  <span class="comment">// calling the editDistDP function and storing the</span></div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>                         <span class="comment">// result on output1</span></div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    assert(output1 ==</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>           expected_output1);  <span class="comment">// comparing the output with the expected output</span></div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Minimum Number of Operations Required: &quot;</span> &lt;&lt; output1</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span> </div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    <span class="comment">// 2nd test</span></div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    std::string str3 = <span class="stringliteral">&quot;SATURDAY&quot;</span>;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    std::string str4 = <span class="stringliteral">&quot;SUNDAY&quot;</span>;</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    uint64_t expected_output2 = 3;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    uint64_t output2 = dynamic_programming::minimum_edit_distance::editDistDP(</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        str3, str4, str3.length(), str4.length());</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    assert(output2 == expected_output2);</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Minimum Number of Operations Required: &quot;</span> &lt;&lt; output2</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>}</div>
+</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span> </div>
+<div class="foldopen" id="foldopen00173" data-start="{" data-end="}">
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"><a class="line" href="../../da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">  173</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[]) {</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    <a class="code hl_function" href="../../da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>}</div>
+</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="aminimum__edit__distance_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../da/d52/minimum__edit__distance_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> <a href="#l00142">minimum_edit_distance.cpp:142</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> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></div>
+<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../da/d52/minimum__edit__distance_8cpp.html">minimum_edit_distance.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/d5a/class_complex.html b/da/d5a/class_complex.html
index 3b48dec90..095eed762 100644
--- a/da/d5a/class_complex.html
+++ b/da/d5a/class_complex.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Complex Class Reference</title>
+<title>TheAlgorithms/C++: Complex Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -156,15 +173,15 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a843ce2f85af4c57db9063c86f3cd9607" id="r_a843ce2f85af4c57db9063c86f3cd9607"><td class="memItemLeft" align="right" valign="top"><a id="a843ce2f85af4c57db9063c86f3cd9607" name="a843ce2f85af4c57db9063c86f3cd9607"></a>
-double&#160;</td><td class="memItemRight" valign="bottom"><b>re</b></td></tr>
+<tr class="memitem:a843ce2f85af4c57db9063c86f3cd9607" id="r_a843ce2f85af4c57db9063c86f3cd9607"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a843ce2f85af4c57db9063c86f3cd9607">re</a></td></tr>
 <tr class="separator:a843ce2f85af4c57db9063c86f3cd9607"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a776d595d5a1b576e9136cbc6bac0589c" id="r_a776d595d5a1b576e9136cbc6bac0589c"><td class="memItemLeft" align="right" valign="top"><a id="a776d595d5a1b576e9136cbc6bac0589c" name="a776d595d5a1b576e9136cbc6bac0589c"></a>
-double&#160;</td><td class="memItemRight" valign="bottom"><b>im</b></td></tr>
+<tr class="memitem:a776d595d5a1b576e9136cbc6bac0589c" id="r_a776d595d5a1b576e9136cbc6bac0589c"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a776d595d5a1b576e9136cbc6bac0589c">im</a></td></tr>
 <tr class="separator:a776d595d5a1b576e9136cbc6bac0589c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Class <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. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00020">20</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a3cfc522c782726f49ee20af17b77f867" name="a3cfc522c782726f49ee20af17b77f867"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a3cfc522c782726f49ee20af17b77f867">&#9670;&#160;</a></span>Complex() <span class="overload">[1/2]</span></h2>
@@ -207,6 +224,8 @@ double&#160;</td><td class="memItemRight" valign="bottom"><b>im</b></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00043">43</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   43</span>                                                                            {</div>
 <div class="line"><span class="lineno">   44</span>        <span class="keywordflow">if</span> (!is_polar) {</div>
 <div class="line"><span class="lineno">   45</span>            re = x;</div>
@@ -214,17 +233,10 @@ double&#160;</td><td class="memItemRight" valign="bottom"><b>im</b></td></tr>
 <div class="line"><span class="lineno">   47</span>            <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">   48</span>        }</div>
 <div class="line"><span class="lineno">   49</span> </div>
-<div class="line"><span class="lineno">   50</span>        re = x * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a>(y);</div>
-<div class="line"><span class="lineno">   51</span>        im = x * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a>(y);</div>
+<div class="line"><span class="lineno">   50</span>        re = x * std::cos(y);</div>
+<div class="line"><span class="lineno">   51</span>        im = x * std::sin(y);</div>
 <div class="line"><span class="lineno">   52</span>    }</div>
-<div class="ttc" id="acos_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a></div><div class="ttdeci">T cos(T... args)</div></div>
-<div class="ttc" id="asin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a></div><div class="ttdeci">T sin(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d5a/class_complex_a3cfc522c782726f49ee20af17b77f867_cgraph.svg" width="260" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a466cd7b664cc6a864937ceb3dead1323" name="a466cd7b664cc6a864937ceb3dead1323"></a>
@@ -257,9 +269,11 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   58</span>: re(other.<a class="code hl_function" href="#a312e4b19146128408fb06e0150b0faf6">real</a>()), im(other.<a class="code hl_function" href="#af8aacf982e2e6c142921bc850f6dc974">imag</a>()) {}</div>
-<div class="ttc" id="aclass_complex_html_a312e4b19146128408fb06e0150b0faf6"><div class="ttname"><a href="#a312e4b19146128408fb06e0150b0faf6">Complex::real</a></div><div class="ttdeci">double real() const</div><div class="ttdoc">Member function to get real value of our complex number. Member function (getter) to access the class...</div><div class="ttdef"><b>Definition</b> complex_numbers.cpp:64</div></div>
-<div class="ttc" id="aclass_complex_html_af8aacf982e2e6c142921bc850f6dc974"><div class="ttname"><a href="#af8aacf982e2e6c142921bc850f6dc974">Complex::imag</a></div><div class="ttdeci">double imag() const</div><div class="ttdoc">Member function to get imaginary value of our complex number. Member function (getter) to access the ...</div><div class="ttdef"><b>Definition</b> complex_numbers.cpp:70</div></div>
+<div class="ttc" id="aclass_complex_html_a312e4b19146128408fb06e0150b0faf6"><div class="ttname"><a href="#a312e4b19146128408fb06e0150b0faf6">Complex::real</a></div><div class="ttdeci">double real() const</div><div class="ttdoc">Member function to get real value of our complex number. Member function (getter) to access the class...</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d67/complex__numbers_8cpp_source.html#l00064">complex_numbers.cpp:64</a></div></div>
+<div class="ttc" id="aclass_complex_html_af8aacf982e2e6c142921bc850f6dc974"><div class="ttname"><a href="#af8aacf982e2e6c142921bc850f6dc974">Complex::imag</a></div><div class="ttdeci">double imag() const</div><div class="ttdoc">Member function to get imaginary value of our complex number. Member function (getter) to access the ...</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d67/complex__numbers_8cpp_source.html#l00070">complex_numbers.cpp:70</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -289,16 +303,12 @@ Here is the call graph for this function:</div>
 
 <p>Member function to give the modulus of our complex number. Member function to which gives the absolute value (modulus) of our complex number. </p>
 <dl class="section return"><dt>Returns</dt><dd>\( \sqrt{z \bar{z}} \) where \( z \) is our complex number. </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   79</span>                       {</div>
-<div class="line"><span class="lineno">   80</span>        <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(this-&gt;re * this-&gt;re + this-&gt;im * this-&gt;im);</div>
-<div class="line"><span class="lineno">   81</span>    }</div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d5a/class_complex_ae5b51b749ea4964104b9527af9d8f556_cgraph.svg" width="231" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00079">79</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   79</span>                       {</div>
+<div class="line"><span class="lineno">   80</span>        <span class="keywordflow">return</span> std::sqrt(this-&gt;re * this-&gt;re + this-&gt;im * this-&gt;im);</div>
+<div class="line"><span class="lineno">   81</span>    }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae1e03712837450549e0c9b4017533a41" name="ae1e03712837450549e0c9b4017533a41"></a>
@@ -326,14 +336,10 @@ Here is the call graph for this function:</div>
 
 <p>Member function to give the argument of our complex number. </p>
 <dl class="section return"><dt>Returns</dt><dd>Argument of our <a class="el" href="../../da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> number in radians. </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   87</span>{ <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/atan2.html">std::atan2</a>(this-&gt;im, this-&gt;re); }</div>
-<div class="ttc" id="aatan2_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/atan2.html">std::atan2</a></div><div class="ttdeci">T atan2(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d5a/class_complex_ae1e03712837450549e0c9b4017533a41_cgraph.svg" width="238" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00087">87</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   87</span>{ <span class="keywordflow">return</span> std::atan2(this-&gt;im, this-&gt;re); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af8aacf982e2e6c142921bc850f6dc974" name="af8aacf982e2e6c142921bc850f6dc974"></a>
@@ -360,6 +366,8 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>Member function to get imaginary value of our complex number. Member function (getter) to access the class' im value. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00070">70</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   70</span>{ <span class="keywordflow">return</span> this-&gt;im; }</div>
 </div><!-- fragment -->
 </div>
@@ -395,13 +403,15 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>result current number times other number. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00117">117</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  117</span>                                            {</div>
 <div class="line"><span class="lineno">  118</span>        <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(this-&gt;re * other.re - this-&gt;im * other.im,</div>
 <div class="line"><span class="lineno">  119</span>                       this-&gt;re * other.im + this-&gt;im * other.re);</div>
 <div class="line"><span class="lineno">  120</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  121</span>    }</div>
-<div class="ttc" id="aclass_complex_html"><div class="ttname"><a href="../../da/d5a/class_complex.html">Complex</a></div><div class="ttdoc">Class Complex to represent complex numbers as a field.</div><div class="ttdef"><b>Definition</b> complex_numbers.cpp:20</div></div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
+<div class="ttc" id="aclass_complex_html"><div class="ttname"><a href="../../da/d5a/class_complex.html">Complex</a></div><div class="ttdoc">Class Complex to represent complex numbers as a field.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d67/complex__numbers_8cpp_source.html#l00020">complex_numbers.cpp:20</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -436,6 +446,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>result current number plus other number </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00095">95</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   95</span>                                            {</div>
 <div class="line"><span class="lineno">   96</span>        <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(this-&gt;re + other.re, this-&gt;im + other.im);</div>
 <div class="line"><span class="lineno">   97</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
@@ -474,6 +486,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>result current number subtract other number </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00106">106</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  106</span>                                            {</div>
 <div class="line"><span class="lineno">  107</span>        <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(this-&gt;re - other.re, this-&gt;im - other.im);</div>
 <div class="line"><span class="lineno">  108</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
@@ -512,6 +526,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>result Current number divided by other number. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00142">142</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  142</span>                                            {</div>
 <div class="line"><span class="lineno">  143</span>        <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = *<span class="keyword">this</span> * ~other;</div>
 <div class="line"><span class="lineno">  144</span>        <span class="keywordtype">double</span> denominator =</div>
@@ -521,17 +537,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  148</span>                             <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.imag() / denominator);</div>
 <div class="line"><span class="lineno">  149</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  150</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  151</span>            <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>(<span class="stringliteral">&quot;Undefined Value&quot;</span>);</div>
+<div class="line"><span class="lineno">  151</span>            <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Undefined Value&quot;</span>);</div>
 <div class="line"><span class="lineno">  152</span>        }</div>
 <div class="line"><span class="lineno">  153</span>    }</div>
-<div class="ttc" id="aclass_complex_html_a3cfc522c782726f49ee20af17b77f867"><div class="ttname"><a href="#a3cfc522c782726f49ee20af17b77f867">Complex::Complex</a></div><div class="ttdeci">Complex(double x=0.f, double y=0.f, bool is_polar=false)</div><div class="ttdoc">Complex Constructor which initialises our complex number.</div><div class="ttdef"><b>Definition</b> complex_numbers.cpp:43</div></div>
-<div class="ttc" id="ainvalid_argument_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.svg" width="442" height="159"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclass_complex_html_a3cfc522c782726f49ee20af17b77f867"><div class="ttname"><a href="#a3cfc522c782726f49ee20af17b77f867">Complex::Complex</a></div><div class="ttdeci">Complex(double x=0.f, double y=0.f, bool is_polar=false)</div><div class="ttdoc">Complex Constructor which initialises our complex number.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d67/complex__numbers_8cpp_source.html#l00043">complex_numbers.cpp:43</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4ac9f529d54cacf2969f2c7179b4c4ac" name="a4ac9f529d54cacf2969f2c7179b4c4ac"></a>
@@ -558,17 +568,14 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>Operator overload of '=' on <a class="el" href="../../da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> class. Operator overload to be able to copy RHS instance of <a class="el" href="../../da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> to LHS instance of <a class="el" href="../../da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a>. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00160">160</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  160</span>                                                   {</div>
 <div class="line"><span class="lineno">  161</span>        this-&gt;re = other.<a class="code hl_function" href="#a312e4b19146128408fb06e0150b0faf6">real</a>();</div>
 <div class="line"><span class="lineno">  162</span>        this-&gt;im = other.<a class="code hl_function" href="#af8aacf982e2e6c142921bc850f6dc974">imag</a>();</div>
 <div class="line"><span class="lineno">  163</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  164</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d5a/class_complex_a4ac9f529d54cacf2969f2c7179b4c4ac_cgraph.svg" width="304" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a8d5427f6c42c15283031d73e1418c59d" name="a8d5427f6c42c15283031d73e1418c59d"></a>
@@ -596,6 +603,8 @@ Here is the call graph for this function:</div>
 
 <p>Operator overload of '~' on <a class="el" href="../../da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> class. Operator overload of the BITWISE NOT which gives us the conjugate of our complex number. NOTE: This is overloading the BITWISE operator but its not a BITWISE operation in this definition. </p>
 <dl class="section return"><dt>Returns</dt><dd>result The conjugate of our complex number. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00130">130</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  130</span>                              {</div>
 <div class="line"><span class="lineno">  131</span>        <a class="code hl_class" href="../../da/d5a/class_complex.html">Complex</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(this-&gt;re, -(this-&gt;im));</div>
 <div class="line"><span class="lineno">  132</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
@@ -627,12 +636,63 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>Member function to get real value of our complex number. Member function (getter) to access the class' re value. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   64</span>{ <span class="keywordflow">return</span> this-&gt;re; }</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a776d595d5a1b576e9136cbc6bac0589c" name="a776d595d5a1b576e9136cbc6bac0589c"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a776d595d5a1b576e9136cbc6bac0589c">&#9670;&#160;</a></span>im</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">double Complex::im</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00024">24</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a843ce2f85af4c57db9063c86f3cd9607" name="a843ce2f85af4c57db9063c86f3cd9607"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a843ce2f85af4c57db9063c86f3cd9607">&#9670;&#160;</a></span>re</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">double Complex::re</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html#l00022">22</a> of file <a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>math/<a class="el" href="../../d5/d67/complex__numbers_8cpp.html">complex_numbers.cpp</a></li>
+<li>math/<a class="el" href="../../d5/d67/complex__numbers_8cpp_source.html">complex_numbers.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/da/d5a/class_complex_a3cfc522c782726f49ee20af17b77f867_cgraph.map b/da/d5a/class_complex_a3cfc522c782726f49ee20af17b77f867_cgraph.map
deleted file mode 100644
index db120e262..000000000
--- a/da/d5a/class_complex_a3cfc522c782726f49ee20af17b77f867_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="Complex::Complex" name="Complex::Complex">
-<area shape="rect" id="Node000001" title="Complex Constructor which initialises our complex number." alt="" coords="5,31,139,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/cos.html#" title=" " alt="" coords="187,5,255,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="139,29,171,24,172,29,140,35"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sin.html#" title=" " alt="" coords="189,55,253,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="140,52,174,57,173,63,139,57"/>
-</map>
diff --git a/da/d5a/class_complex_a3cfc522c782726f49ee20af17b77f867_cgraph.md5 b/da/d5a/class_complex_a3cfc522c782726f49ee20af17b77f867_cgraph.md5
deleted file mode 100644
index 28863f2a0..000000000
--- a/da/d5a/class_complex_a3cfc522c782726f49ee20af17b77f867_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-571e1e55ea1d94b80bc88c0850dfcc0d
\ No newline at end of file
diff --git a/da/d5a/class_complex_a3cfc522c782726f49ee20af17b77f867_cgraph.svg b/da/d5a/class_complex_a3cfc522c782726f49ee20af17b77f867_cgraph.svg
deleted file mode 100644
index 71bda5f90..000000000
--- a/da/d5a/class_complex_a3cfc522c782726f49ee20af17b77f867_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Complex::Complex Pages: 1 -->
-<svg width="195pt" height="64pt"
- viewBox="0.00 0.00 195.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>Complex::Complex</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Complex Constructor which initialises our complex number.">
-<polygon fill="#999999" stroke="#666666" points="100,-37.25 0,-37.25 0,-18 100,-18 100,-37.25"/>
-<text text-anchor="middle" x="50" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::Complex</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="187.25,-56.25 136,-56.25 136,-37 187.25,-37 187.25,-56.25"/>
-<text text-anchor="middle" x="161.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.36,-36.18C108.44,-37.58 116.67,-39.01 124.36,-40.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.56,-43.75 134.01,-42.01 124.76,-36.86 123.56,-43.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="185.75,-19.25 137.5,-19.25 137.5,0 185.75,0 185.75,-19.25"/>
-<text text-anchor="middle" x="161.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.36,-19.52C108.99,-18.1 117.8,-16.66 125.93,-15.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.45,-18.78 135.75,-13.71 125.31,-11.88 126.45,-18.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d5a/class_complex_a3cfc522c782726f49ee20af17b77f867_cgraph_org.svg b/da/d5a/class_complex_a3cfc522c782726f49ee20af17b77f867_cgraph_org.svg
deleted file mode 100644
index 29d52e342..000000000
--- a/da/d5a/class_complex_a3cfc522c782726f49ee20af17b77f867_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Complex::Complex Pages: 1 -->
-<svg width="195pt" height="64pt"
- viewBox="0.00 0.00 195.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>Complex::Complex</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Complex Constructor which initialises our complex number.">
-<polygon fill="#999999" stroke="#666666" points="100,-37.25 0,-37.25 0,-18 100,-18 100,-37.25"/>
-<text text-anchor="middle" x="50" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::Complex</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="187.25,-56.25 136,-56.25 136,-37 187.25,-37 187.25,-56.25"/>
-<text text-anchor="middle" x="161.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.36,-36.18C108.44,-37.58 116.67,-39.01 124.36,-40.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.56,-43.75 134.01,-42.01 124.76,-36.86 123.56,-43.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="185.75,-19.25 137.5,-19.25 137.5,0 185.75,0 185.75,-19.25"/>
-<text text-anchor="middle" x="161.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.36,-19.52C108.99,-18.1 117.8,-16.66 125.93,-15.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.45,-18.78 135.75,-13.71 125.31,-11.88 126.45,-18.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d5a/class_complex_a4ac9f529d54cacf2969f2c7179b4c4ac_cgraph.map b/da/d5a/class_complex_a4ac9f529d54cacf2969f2c7179b4c4ac_cgraph.map
deleted file mode 100644
index aed876afc..000000000
--- a/da/d5a/class_complex_a4ac9f529d54cacf2969f2c7179b4c4ac_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="Complex::operator=" name="Complex::operator=">
-<area shape="rect" id="Node000001" title="Operator overload of &#39;=&#39; on Complex class. Operator overload to be able to copy RHS instance of Compl..." alt="" coords="5,31,142,56"/>
-<area shape="rect" id="Node000002" href="$da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974" title="Member function to get imaginary value of our complex number. Member function (getter) to access the ..." alt="" coords="190,5,299,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="142,31,174,26,175,31,143,36"/>
-<area shape="rect" id="Node000003" href="$da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6" title="Member function to get real value of our complex number. Member function (getter) to access the class..." alt="" coords="193,55,296,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="143,50,178,56,177,61,142,56"/>
-</map>
diff --git a/da/d5a/class_complex_a4ac9f529d54cacf2969f2c7179b4c4ac_cgraph.md5 b/da/d5a/class_complex_a4ac9f529d54cacf2969f2c7179b4c4ac_cgraph.md5
deleted file mode 100644
index 0e0b009a6..000000000
--- a/da/d5a/class_complex_a4ac9f529d54cacf2969f2c7179b4c4ac_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ff61a61696db9f9b0fc1179437dfa7ff
\ No newline at end of file
diff --git a/da/d5a/class_complex_a4ac9f529d54cacf2969f2c7179b4c4ac_cgraph.svg b/da/d5a/class_complex_a4ac9f529d54cacf2969f2c7179b4c4ac_cgraph.svg
deleted file mode 100644
index 3c3ef5b70..000000000
--- a/da/d5a/class_complex_a4ac9f529d54cacf2969f2c7179b4c4ac_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Complex::operator= Pages: 1 -->
-<svg width="228pt" height="64pt"
- viewBox="0.00 0.00 228.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>Complex::operator=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Operator overload of &#39;=&#39; on Complex class. Operator overload to be able to copy RHS instance of Compl...">
-<polygon fill="#999999" stroke="#666666" points="102.25,-37.25 0,-37.25 0,-18 102.25,-18 102.25,-37.25"/>
-<text text-anchor="middle" x="51.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::operator=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974" target="_top" xlink:title="Member function to get imaginary value of our complex number. Member function (getter) to access the ...">
-<polygon fill="white" stroke="#666666" points="220.25,-56.25 138.25,-56.25 138.25,-37 220.25,-37 220.25,-56.25"/>
-<text text-anchor="middle" x="179.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.7,-35.24C110.71,-36.45 119,-37.7 127.03,-38.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.24,-42.33 136.65,-40.36 127.28,-35.41 126.24,-42.33"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6" target="_top" xlink:title="Member function to get real value of our complex number. Member function (getter) to access the class...">
-<polygon fill="white" stroke="#666666" points="217.62,-19.25 140.88,-19.25 140.88,0 217.62,0 217.62,-19.25"/>
-<text text-anchor="middle" x="179.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.7,-20.41C111.47,-19.16 120.57,-17.86 129.29,-16.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.58,-20.11 138.98,-15.23 128.59,-13.18 129.58,-20.11"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d5a/class_complex_a4ac9f529d54cacf2969f2c7179b4c4ac_cgraph_org.svg b/da/d5a/class_complex_a4ac9f529d54cacf2969f2c7179b4c4ac_cgraph_org.svg
deleted file mode 100644
index f61d5a01b..000000000
--- a/da/d5a/class_complex_a4ac9f529d54cacf2969f2c7179b4c4ac_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Complex::operator= Pages: 1 -->
-<svg width="228pt" height="64pt"
- viewBox="0.00 0.00 228.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>Complex::operator=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Operator overload of &#39;=&#39; on Complex class. Operator overload to be able to copy RHS instance of Compl...">
-<polygon fill="#999999" stroke="#666666" points="102.25,-37.25 0,-37.25 0,-18 102.25,-18 102.25,-37.25"/>
-<text text-anchor="middle" x="51.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::operator=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974" target="_top" xlink:title="Member function to get imaginary value of our complex number. Member function (getter) to access the ...">
-<polygon fill="white" stroke="#666666" points="220.25,-56.25 138.25,-56.25 138.25,-37 220.25,-37 220.25,-56.25"/>
-<text text-anchor="middle" x="179.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.7,-35.24C110.71,-36.45 119,-37.7 127.03,-38.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.24,-42.33 136.65,-40.36 127.28,-35.41 126.24,-42.33"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6" target="_top" xlink:title="Member function to get real value of our complex number. Member function (getter) to access the class...">
-<polygon fill="white" stroke="#666666" points="217.62,-19.25 140.88,-19.25 140.88,0 217.62,0 217.62,-19.25"/>
-<text text-anchor="middle" x="179.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.7,-20.41C111.47,-19.16 120.57,-17.86 129.29,-16.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.58,-20.11 138.98,-15.23 128.59,-13.18 129.58,-20.11"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.map b/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.map
deleted file mode 100644
index e60303da3..000000000
--- a/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="Complex::operator/" name="Complex::operator/">
-<area shape="rect" id="Node000001" title="Operator overload of &#39;/&#39; on Complex class. Operator overload to be able to divide two complex numbers..." alt="" coords="5,79,138,104"/>
-<area shape="rect" id="Node000002" href="$da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867" title="Complex Constructor which initialises our complex number." alt="" coords="186,29,319,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="121,75,187,57,188,62,122,81"/>
-<area shape="rect" id="Node000005" href="$da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974" title="Member function to get imaginary value of our complex number. Member function (getter) to access the ..." alt="" coords="198,79,307,104"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="138,89,182,89,182,94,138,94"/>
-<area shape="rect" id="Node000006" href="$da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6" title="Member function to get real value of our complex number. Member function (getter) to access the class..." alt="" coords="201,128,304,154"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="122,102,188,121,187,126,121,108"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/cos.html#" title=" " alt="" coords="367,5,435,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="319,29,351,23,352,29,320,34"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sin.html#" title=" " alt="" coords="369,55,433,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="320,51,354,57,353,62,319,56"/>
-</map>
diff --git a/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.md5 b/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.md5
deleted file mode 100644
index e9b20ae6b..000000000
--- a/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1df6004932b22273f0110421ebe6a226
\ No newline at end of file
diff --git a/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.svg b/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.svg
deleted file mode 100644
index c4f90ae65..000000000
--- a/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Complex::operator/ Pages: 1 -->
-<svg width="331pt" height="119pt"
- viewBox="0.00 0.00 330.50 119.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 115.25)">
-<title>Complex::operator/</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Operator overload of &#39;/&#39; on Complex class. Operator overload to be able to divide two complex numbers...">
-<polygon fill="#999999" stroke="#666666" points="99.25,-56.25 0,-56.25 0,-37 99.25,-37 99.25,-56.25"/>
-<text text-anchor="middle" x="49.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::operator/</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867" target="_top" xlink:title="Complex Constructor which initialises our complex number.">
-<polygon fill="white" stroke="#666666" points="235.25,-93.25 135.25,-93.25 135.25,-74 235.25,-74 235.25,-93.25"/>
-<text text-anchor="middle" x="185.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::Complex</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.14,-56.74C102.46,-60.98 120.47,-65.97 136.8,-70.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.75,-73.83 146.32,-73.12 137.62,-67.08 135.75,-73.83"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974" target="_top" xlink:title="Member function to get imaginary value of our complex number. Member function (getter) to access the ...">
-<polygon fill="white" stroke="#666666" points="226.25,-56.25 144.25,-56.25 144.25,-37 226.25,-37 226.25,-56.25"/>
-<text text-anchor="middle" x="185.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.62,-46.62C110.34,-46.62 121.73,-46.62 132.55,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.5,-50.13 142.5,-46.63 132.5,-43.13 132.5,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6" target="_top" xlink:title="Member function to get real value of our complex number. Member function (getter) to access the class...">
-<polygon fill="white" stroke="#666666" points="223.62,-19.25 146.88,-19.25 146.88,0 223.62,0 223.62,-19.25"/>
-<text text-anchor="middle" x="185.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.14,-36.51C102.46,-32.27 120.47,-27.28 136.8,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.62,-26.17 146.32,-20.13 135.75,-19.42 137.62,-26.17"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="322.5,-111.25 271.25,-111.25 271.25,-92 322.5,-92 322.5,-111.25"/>
-<text text-anchor="middle" x="296.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.61,-91.73C243.69,-93.06 251.92,-94.41 259.61,-95.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.83,-99.09 269.26,-97.25 259.96,-92.18 258.83,-99.09"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321,-74.25 272.75,-74.25 272.75,-55 321,-55 321,-74.25"/>
-<text text-anchor="middle" x="296.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.61,-75.07C244.24,-73.57 253.05,-72.05 261.18,-70.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.75,-74.09 271,-68.94 260.55,-67.2 261.75,-74.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph_org.svg b/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph_org.svg
deleted file mode 100644
index a14f05fd5..000000000
--- a/da/d5a/class_complex_ac38437c10eb798f176c384a695171b90_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Complex::operator/ Pages: 1 -->
-<svg width="331pt" height="119pt"
- viewBox="0.00 0.00 330.50 119.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 115.25)">
-<title>Complex::operator/</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Operator overload of &#39;/&#39; on Complex class. Operator overload to be able to divide two complex numbers...">
-<polygon fill="#999999" stroke="#666666" points="99.25,-56.25 0,-56.25 0,-37 99.25,-37 99.25,-56.25"/>
-<text text-anchor="middle" x="49.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::operator/</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867" target="_top" xlink:title="Complex Constructor which initialises our complex number.">
-<polygon fill="white" stroke="#666666" points="235.25,-93.25 135.25,-93.25 135.25,-74 235.25,-74 235.25,-93.25"/>
-<text text-anchor="middle" x="185.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::Complex</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.14,-56.74C102.46,-60.98 120.47,-65.97 136.8,-70.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.75,-73.83 146.32,-73.12 137.62,-67.08 135.75,-73.83"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974" target="_top" xlink:title="Member function to get imaginary value of our complex number. Member function (getter) to access the ...">
-<polygon fill="white" stroke="#666666" points="226.25,-56.25 144.25,-56.25 144.25,-37 226.25,-37 226.25,-56.25"/>
-<text text-anchor="middle" x="185.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.62,-46.62C110.34,-46.62 121.73,-46.62 132.55,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.5,-50.13 142.5,-46.63 132.5,-43.13 132.5,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6" target="_top" xlink:title="Member function to get real value of our complex number. Member function (getter) to access the class...">
-<polygon fill="white" stroke="#666666" points="223.62,-19.25 146.88,-19.25 146.88,0 223.62,0 223.62,-19.25"/>
-<text text-anchor="middle" x="185.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.14,-36.51C102.46,-32.27 120.47,-27.28 136.8,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.62,-26.17 146.32,-20.13 135.75,-19.42 137.62,-26.17"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="322.5,-111.25 271.25,-111.25 271.25,-92 322.5,-92 322.5,-111.25"/>
-<text text-anchor="middle" x="296.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.61,-91.73C243.69,-93.06 251.92,-94.41 259.61,-95.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.83,-99.09 269.26,-97.25 259.96,-92.18 258.83,-99.09"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321,-74.25 272.75,-74.25 272.75,-55 321,-55 321,-74.25"/>
-<text text-anchor="middle" x="296.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.61,-75.07C244.24,-73.57 253.05,-72.05 261.18,-70.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.75,-74.09 271,-68.94 260.55,-67.2 261.75,-74.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d5a/class_complex_ae1e03712837450549e0c9b4017533a41_cgraph.map b/da/d5a/class_complex_ae1e03712837450549e0c9b4017533a41_cgraph.map
deleted file mode 100644
index 7182de923..000000000
--- a/da/d5a/class_complex_ae1e03712837450549e0c9b4017533a41_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="Complex::arg" name="Complex::arg">
-<area shape="rect" id="Node000001" title="Member function to give the argument of our complex number." alt="" coords="5,5,105,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/atan2.html#" title=" " alt="" coords="153,5,232,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="105,16,137,16,137,21,105,21"/>
-</map>
diff --git a/da/d5a/class_complex_ae1e03712837450549e0c9b4017533a41_cgraph.md5 b/da/d5a/class_complex_ae1e03712837450549e0c9b4017533a41_cgraph.md5
deleted file mode 100644
index 1d60b2bc3..000000000
--- a/da/d5a/class_complex_ae1e03712837450549e0c9b4017533a41_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9cadaab83bd3ebd66498947b3d283e1c
\ No newline at end of file
diff --git a/da/d5a/class_complex_ae1e03712837450549e0c9b4017533a41_cgraph.svg b/da/d5a/class_complex_ae1e03712837450549e0c9b4017533a41_cgraph.svg
deleted file mode 100644
index 1b591ebc5..000000000
--- a/da/d5a/class_complex_ae1e03712837450549e0c9b4017533a41_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Complex::arg Pages: 1 -->
-<svg width="178pt" height="27pt"
- viewBox="0.00 0.00 178.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>Complex::arg</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Member function to give the argument of our complex number.">
-<polygon fill="#999999" stroke="#666666" points="74.5,-19.25 0,-19.25 0,0 74.5,0 74.5,-19.25"/>
-<text text-anchor="middle" x="37.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::arg</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/atan2.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170,-19.25 110.5,-19.25 110.5,0 170,0 170,-19.25"/>
-<text text-anchor="middle" x="140.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::atan2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75,-9.62C82.81,-9.62 91.09,-9.62 99.02,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.77,-13.13 108.77,-9.63 98.77,-6.13 98.77,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d5a/class_complex_ae1e03712837450549e0c9b4017533a41_cgraph_org.svg b/da/d5a/class_complex_ae1e03712837450549e0c9b4017533a41_cgraph_org.svg
deleted file mode 100644
index 0e002bbb0..000000000
--- a/da/d5a/class_complex_ae1e03712837450549e0c9b4017533a41_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Complex::arg Pages: 1 -->
-<svg width="178pt" height="27pt"
- viewBox="0.00 0.00 178.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>Complex::arg</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Member function to give the argument of our complex number.">
-<polygon fill="#999999" stroke="#666666" points="74.5,-19.25 0,-19.25 0,0 74.5,0 74.5,-19.25"/>
-<text text-anchor="middle" x="37.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::arg</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/atan2.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170,-19.25 110.5,-19.25 110.5,0 170,0 170,-19.25"/>
-<text text-anchor="middle" x="140.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::atan2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75,-9.62C82.81,-9.62 91.09,-9.62 99.02,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.77,-13.13 108.77,-9.63 98.77,-6.13 98.77,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d5a/class_complex_ae5b51b749ea4964104b9527af9d8f556_cgraph.map b/da/d5a/class_complex_ae5b51b749ea4964104b9527af9d8f556_cgraph.map
deleted file mode 100644
index 17a470699..000000000
--- a/da/d5a/class_complex_ae5b51b749ea4964104b9527af9d8f556_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="Complex::abs" name="Complex::abs">
-<area shape="rect" id="Node000001" title="Member function to give the modulus of our complex number. Member function to which gives the absolut..." alt="" coords="5,5,108,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="156,5,225,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="108,16,140,16,140,21,108,21"/>
-</map>
diff --git a/da/d5a/class_complex_ae5b51b749ea4964104b9527af9d8f556_cgraph.md5 b/da/d5a/class_complex_ae5b51b749ea4964104b9527af9d8f556_cgraph.md5
deleted file mode 100644
index 32f90666f..000000000
--- a/da/d5a/class_complex_ae5b51b749ea4964104b9527af9d8f556_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3128a983ad80f5c14d79b6d27940928b
\ No newline at end of file
diff --git a/da/d5a/class_complex_ae5b51b749ea4964104b9527af9d8f556_cgraph.svg b/da/d5a/class_complex_ae5b51b749ea4964104b9527af9d8f556_cgraph.svg
deleted file mode 100644
index ab73b8068..000000000
--- a/da/d5a/class_complex_ae5b51b749ea4964104b9527af9d8f556_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Complex::abs Pages: 1 -->
-<svg width="173pt" height="27pt"
- viewBox="0.00 0.00 172.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>Complex::abs</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Member function to give the modulus of our complex number. Member function to which gives the absolut...">
-<polygon fill="#999999" stroke="#666666" points="76.75,-19.25 0,-19.25 0,0 76.75,0 76.75,-19.25"/>
-<text text-anchor="middle" x="38.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::abs</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164.75,-19.25 112.75,-19.25 112.75,0 164.75,0 164.75,-19.25"/>
-<text text-anchor="middle" x="138.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.13,-9.62C84.97,-9.62 93.23,-9.62 101.03,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.91,-13.13 110.91,-9.63 100.91,-6.13 100.91,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d5a/class_complex_ae5b51b749ea4964104b9527af9d8f556_cgraph_org.svg b/da/d5a/class_complex_ae5b51b749ea4964104b9527af9d8f556_cgraph_org.svg
deleted file mode 100644
index 52d8710da..000000000
--- a/da/d5a/class_complex_ae5b51b749ea4964104b9527af9d8f556_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Complex::abs Pages: 1 -->
-<svg width="173pt" height="27pt"
- viewBox="0.00 0.00 172.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>Complex::abs</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Member function to give the modulus of our complex number. Member function to which gives the absolut...">
-<polygon fill="#999999" stroke="#666666" points="76.75,-19.25 0,-19.25 0,0 76.75,0 76.75,-19.25"/>
-<text text-anchor="middle" x="38.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Complex::abs</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164.75,-19.25 112.75,-19.25 112.75,0 164.75,0 164.75,-19.25"/>
-<text text-anchor="middle" x="138.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.13,-9.62C84.97,-9.62 93.23,-9.62 101.03,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.91,-13.13 110.91,-9.63 100.91,-6.13 100.91,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d61/structsearch_1_1sublist__search_1_1_node.html b/da/d61/structsearch_1_1sublist__search_1_1_node.html
index 57d016c89..00dc4bc9d 100644
--- a/da/d61/structsearch_1_1sublist__search_1_1_node.html
+++ b/da/d61/structsearch_1_1sublist__search_1_1_node.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: search::sublist_search::Node Struct Reference</title>
+<title>TheAlgorithms/C++: search::sublist_search::Node Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,9 +138,8 @@ Collaboration diagram for search::sublist_search::Node:</div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a912ae0b339da401fc33ad21494c60e2b" id="r_a912ae0b339da401fc33ad21494c60e2b"><td class="memItemLeft" align="right" valign="top"><a id="a912ae0b339da401fc33ad21494c60e2b" name="a912ae0b339da401fc33ad21494c60e2b"></a>
-uint32_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b> = 0</td></tr>
-<tr class="memdesc:a912ae0b339da401fc33ad21494c60e2b"><td class="mdescLeft">&#160;</td><td class="mdescRight">the key/value of the node <br /></td></tr>
+<tr class="memitem:a912ae0b339da401fc33ad21494c60e2b" id="r_a912ae0b339da401fc33ad21494c60e2b"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a912ae0b339da401fc33ad21494c60e2b">data</a> = 0</td></tr>
+<tr class="memdesc:a912ae0b339da401fc33ad21494c60e2b"><td class="mdescLeft">&#160;</td><td class="mdescRight">the key/value of the node  <br /></td></tr>
 <tr class="separator:a912ae0b339da401fc33ad21494c60e2b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:afe96e03dd6a404480ab43d1e88363a7a" id="r_afe96e03dd6a404480ab43d1e88363a7a"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afe96e03dd6a404480ab43d1e88363a7a">next</a> {}</td></tr>
 <tr class="memdesc:afe96e03dd6a404480ab43d1e88363a7a"><td class="mdescLeft">&#160;</td><td class="mdescRight">pointer to the next node  <br /></td></tr>
@@ -131,7 +147,27 @@ uint32_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b> = 0</td>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>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. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html">sublist_search.cpp</a>.</p>
 </div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="a912ae0b339da401fc33ad21494c60e2b" name="a912ae0b339da401fc33ad21494c60e2b"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a912ae0b339da401fc33ad21494c60e2b">&#9670;&#160;</a></span>data</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">uint32_t search::sublist_search::Node::data = 0</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>the key/value of the node </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html#l00049">49</a> of file <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html">sublist_search.cpp</a>.</p>
+
+</div>
+</div>
 <a id="afe96e03dd6a404480ab43d1e88363a7a" name="afe96e03dd6a404480ab43d1e88363a7a"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#afe96e03dd6a404480ab43d1e88363a7a">&#9670;&#160;</a></span>next</h2>
 
@@ -145,12 +181,14 @@ uint32_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b> = 0</td>
 </div><div class="memdoc">
 
 <p>pointer to the next node </p>
-<div class="fragment"><div class="line"><span class="lineno">   50</span>{};       <span class="comment">///&lt; pointer to the next node</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html#l00050">50</a> of file <a class="el" href="../../d5/d45/sublist__search_8cpp_source.html">sublist_search.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   50</span>{};       </div>
 </div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>search/<a class="el" href="../../d5/d45/sublist__search_8cpp.html">sublist_search.cpp</a></li>
+<li>search/<a class="el" href="../../d5/d45/sublist__search_8cpp_source.html">sublist_search.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/da/d66/classrange__queries_1_1per_seg_tree-members.html b/da/d66/classrange__queries_1_1per_seg_tree-members.html
index 441d767ea..60c514711 100644
--- a/da/d66/classrange__queries_1_1per_seg_tree-members.html
+++ b/da/d66/classrange__queries_1_1per_seg_tree-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/da/d68/searching__of__element__in__dynamic__array_8cpp_source.html b/da/d68/searching__of__element__in__dynamic__array_8cpp_source.html
new file mode 100644
index 000000000..5bfbf3023
--- /dev/null
+++ b/da/d68/searching__of__element__in__dynamic__array_8cpp_source.html
@@ -0,0 +1,218 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/searching_of_element_in_dynamic_array.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/d68/searching__of__element__in__dynamic__array_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">searching_of_element_in_dynamic_array.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> *this program is use to find any elemet in any row with variable array size</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> *aplication of pointer is use in it</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> *important point start from here to:</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> *the index value of array can be go to 1 to 100000</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> *check till array[1000]</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> *end here</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> *how to work example:</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> **Question:</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment"> ***number of array 2</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment"> ***quarry 3</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment"> ***array 1 is {1 2 3 4 5}</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment"> ***array 2 is {6 7}</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment"> ****i) what is 2nd element in 1st array</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment"> ****ii) what is 1st element in 2nd array</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment"> ****iii) what is 5th element in 1st array</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment"> *****output:</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment"> *****Enter Number of array you want to Store : 2</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment"> *****Enter Number of Question or Quary you want to do Related to Array : 3</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment"> *****Enter number of element in 1 rows : 5</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment"> *****Enter the element of Array 1 2 3 4 5</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"> *****Enter number of element in 2 rows : 2</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"> *****Enter the element of Array 6 7</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment"> *****enter the number of row which element You want to find : 1</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment"> *****enter the position of element which You want to find : 2</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment"> *****The element is 2</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment"> *****enter the number of row which element You want to find : 2</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment"> *****enter the position of element which You want to find : 1</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment"> *****The element is 6</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment"> *****enter the number of row which element You want to find : 1</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="comment"> *****enter the position of element which You want to find : 5</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="comment"> *****The element is 5</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="comment">// this is main fuction</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="comment">// ***</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    int64_t r, mr = 0, x, q, i, z;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter Number of array you want to Store :&quot;</span>;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    std::cin &gt;&gt; x;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter Number of &quot;</span>;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Question or Quary you &quot;</span>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;want to do Related to Array :&quot;</span>;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    std::cin &gt;&gt; q;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="comment">// create a Array in run time because use can</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="comment">// change the size of each array which he/she is going to store</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="comment">// create a 2D array</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordtype">int</span>** ar = <span class="keyword">new</span> <span class="keywordtype">int</span>*[x]();</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="comment">// this for loop is use for entering different variable size array</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="comment">// ***</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">for</span> (r = 0; r &lt; x; r++) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter number of element in &quot;</span> &lt;&lt; r + 1 &lt;&lt; <span class="stringliteral">&quot; rows :&quot;</span>;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        std::cin &gt;&gt; mr;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="comment">// creating a 1D array</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        <span class="keywordtype">int</span>* ac = <span class="keyword">new</span> <span class="keywordtype">int</span>[mr]();</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the element of Array &quot;</span>;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="comment">// this for loop is use for storing values in array</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <span class="comment">// ***</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        <span class="keywordflow">for</span> (i = 0; i &lt; mr; i++) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            <span class="comment">// entering the value of rows in array in Horizontal</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            std::cin &gt;&gt; ac[i];</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        <span class="comment">// Change the position of Array so that new arrays entery will be done</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        ar[r] = ac;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="comment">// this for loop is use for display result of querry</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="comment">// ***</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordflow">for</span> (z = 0; z &lt; q; z++) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        int64_t r1 = 0, q1 = 0;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;enter the number of row which element you want to find :&quot;</span>;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        std::cin &gt;&gt; r1;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        r1 = r1 - 1;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;enter the position of element which you want to find :&quot;</span>;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        std::cin &gt;&gt; q1;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        q1 = q1 - 1;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        <span class="comment">// use this to find desire position of element in desire array</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;The element is &quot;</span> &lt;&lt; ar[r1][q1] &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><b>searching_of_element_in_dynamic_array.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/d6d/namespaceoperations__on__datastructures.html b/da/d6d/namespaceoperations__on__datastructures.html
index 9d978466c..5acb23c23 100644
--- a/da/d6d/namespaceoperations__on__datastructures.html
+++ b/da/d6d/namespaceoperations__on__datastructures.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: operations_on_datastructures Namespace Reference</title>
+<title>TheAlgorithms/C++: operations_on_datastructures Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,40 +127,40 @@ $(function(){initNavTree('da/d6d/namespaceoperations__on__datastructures.html','
 </div><!--header-->
 <div class="contents">
 
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>  
+<p>for std::vector  
 <a href="#details">More...</a></p>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a6109193567a5b7e36a27f2b4865fce20" id="r_a6109193567a5b7e36a27f2b4865fce20"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6109193567a5b7e36a27f2b4865fce20">print</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;array)</td></tr>
+<tr class="memitem:a6109193567a5b7e36a27f2b4865fce20" id="r_a6109193567a5b7e36a27f2b4865fce20"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6109193567a5b7e36a27f2b4865fce20">print</a> (const std::vector&lt; int32_t &gt; &amp;array)</td></tr>
 <tr class="memdesc:a6109193567a5b7e36a27f2b4865fce20"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints the values of a vector sequentially, ending with a newline character.  <br /></td></tr>
 <tr class="separator:a6109193567a5b7e36a27f2b4865fce20"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:afce39cf843989a39811a49ebe29dd6d8" id="r_afce39cf843989a39811a49ebe29dd6d8"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afce39cf843989a39811a49ebe29dd6d8">shift_left</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;array, size_t shift)</td></tr>
+<tr class="memitem:afce39cf843989a39811a49ebe29dd6d8" id="r_afce39cf843989a39811a49ebe29dd6d8"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afce39cf843989a39811a49ebe29dd6d8">shift_left</a> (const std::vector&lt; int32_t &gt; &amp;array, size_t shift)</td></tr>
 <tr class="memdesc:afce39cf843989a39811a49ebe29dd6d8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Shifts the given vector to the left by the shift amount and returns a new vector with the result. The original vector is not mutated.  <br /></td></tr>
 <tr class="separator:afce39cf843989a39811a49ebe29dd6d8"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a1bfb8711f49e591eb168ccaa3df6fb86" id="r_a1bfb8711f49e591eb168ccaa3df6fb86"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1bfb8711f49e591eb168ccaa3df6fb86">shift_right</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;array, size_t shift)</td></tr>
+<tr class="memitem:a1bfb8711f49e591eb168ccaa3df6fb86" id="r_a1bfb8711f49e591eb168ccaa3df6fb86"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1bfb8711f49e591eb168ccaa3df6fb86">shift_right</a> (const std::vector&lt; int32_t &gt; &amp;array, size_t shift)</td></tr>
 <tr class="memdesc:a1bfb8711f49e591eb168ccaa3df6fb86"><td class="mdescLeft">&#160;</td><td class="mdescRight">Shifts the given vector to the right by the shift amount and returns a new vector with the result. The original vector is not mutated.  <br /></td></tr>
 <tr class="separator:a1bfb8711f49e591eb168ccaa3df6fb86"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:adaf9a06f0c236c2d95c97e441ea2d12e" id="r_adaf9a06f0c236c2d95c97e441ea2d12e"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adaf9a06f0c236c2d95c97e441ea2d12e">get_intersection</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;first, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;second)</td></tr>
+<tr class="memitem:adaf9a06f0c236c2d95c97e441ea2d12e" id="r_adaf9a06f0c236c2d95c97e441ea2d12e"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adaf9a06f0c236c2d95c97e441ea2d12e">get_intersection</a> (const std::vector&lt; int32_t &gt; &amp;first, const std::vector&lt; int32_t &gt; &amp;second)</td></tr>
 <tr class="memdesc:adaf9a06f0c236c2d95c97e441ea2d12e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the intersection of two sorted arrays, and returns them in a vector.  <br /></td></tr>
 <tr class="separator:adaf9a06f0c236c2d95c97e441ea2d12e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2b8ff06a84b041457873840bf82e2d74" id="r_a2b8ff06a84b041457873840bf82e2d74"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2b8ff06a84b041457873840bf82e2d74">get_union</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;first, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;second)</td></tr>
+<tr class="memitem:a2b8ff06a84b041457873840bf82e2d74" id="r_a2b8ff06a84b041457873840bf82e2d74"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2b8ff06a84b041457873840bf82e2d74">get_union</a> (const std::vector&lt; int32_t &gt; &amp;first, const std::vector&lt; int32_t &gt; &amp;second)</td></tr>
 <tr class="memdesc:a2b8ff06a84b041457873840bf82e2d74"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the union of two sorted arrays, and returns them in a vector.  <br /></td></tr>
 <tr class="separator:a2b8ff06a84b041457873840bf82e2d74"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
-<div class="textblock"><p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a></p>
-<p>For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>.</p>
+<div class="textblock"><p>for std::vector </p>
+<p>for std::priority_queue</p>
+<p>For std::vector.</p>
 <p>for assert for IO operations</p>
 <p>Operations on Data Structures</p>
 <p>for assert for IO Operations</p>
 <p>Operations on data structures</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a> for assert for IO operations</p>
+<p>for std::sort for assert for IO operations</p>
 <p>Operations on Data Structures</p>
-<p>For assert For IO operations For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></p>
+<p>For assert For IO operations For std::queue</p>
 <p>Operations on Data Structures</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/count.html">std::count</a> for assert for tolower for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> for string operations for IO Operations</p>
+<p>for std::count for assert for tolower for std::uint32_t for string operations for IO Operations</p>
 <p>Operations on data structures </p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="adaf9a06f0c236c2d95c97e441ea2d12e" name="adaf9a06f0c236c2d95c97e441ea2d12e"></a>
@@ -153,14 +170,14 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; operations_on_datastructures::get_intersection </td>
+          <td class="memname">std::vector&lt; int32_t &gt; operations_on_datastructures::get_intersection </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>first</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; int32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>first</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>second</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; int32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>second</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -168,12 +185,12 @@ Functions</h2></td></tr>
 <p>Gets the intersection of two sorted arrays, and returns them in a vector. </p>
 <p>An algorithm is used that compares the elements of the two vectors, incrementing the index of the smaller of the two. If the elements are the same, the element is appended to the result array to be returned. </p><dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramname">first</td><td>A <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> of sorted integer values </td></tr>
-    <tr><td class="paramname">second</td><td>A <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> of sorted integer values </td></tr>
+    <tr><td class="paramname">first</td><td>A std::vector of sorted integer values </td></tr>
+    <tr><td class="paramname">second</td><td>A std::vector of sorted integer values </td></tr>
   </table>
   </dd>
 </dl>
-<dl class="section return"><dt>Returns</dt><dd>A <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> of the intersection of the two arrays, in ascending order </dd></dl>
+<dl class="section return"><dt>Returns</dt><dd>A std::vector of the intersection of the two arrays, in ascending order </dd></dl>
 <p>&lt; Vector to hold the intersection</p>
 <p>&lt; Index for the first array</p>
 <p>&lt; Index for the second array</p>
@@ -184,39 +201,32 @@ Functions</h2></td></tr>
 <p>&lt; Add the element if it is unique</p>
 <p>&lt; Increment index of first array</p>
 <p>&lt; Increment index of second array too</p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc5/intersection__of__two__arrays_8cpp_source.html#l00049">49</a> of file <a class="el" href="../../de/dc5/intersection__of__two__arrays_8cpp_source.html">intersection_of_two_arrays.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   50</span>                                                                        {</div>
-<div class="line"><span class="lineno">   51</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> res;         <span class="comment">///&lt; Vector to hold the intersection</span></div>
-<div class="line"><span class="lineno">   52</span>    <span class="keywordtype">size_t</span> f_index = 0;               <span class="comment">///&lt; Index for the first array</span></div>
-<div class="line"><span class="lineno">   53</span>    <span class="keywordtype">size_t</span> s_index = 0;               <span class="comment">///&lt; Index for the second array</span></div>
-<div class="line"><span class="lineno">   54</span>    <span class="keywordtype">size_t</span> f_length = first.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();   <span class="comment">///&lt; Length of first array</span></div>
-<div class="line"><span class="lineno">   55</span>    <span class="keywordtype">size_t</span> s_length = second.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();  <span class="comment">///&lt; Length of second array</span></div>
+<div class="line"><span class="lineno">   51</span>    std::vector&lt;int32_t&gt; res;         </div>
+<div class="line"><span class="lineno">   52</span>    <span class="keywordtype">size_t</span> f_index = 0;               </div>
+<div class="line"><span class="lineno">   53</span>    <span class="keywordtype">size_t</span> s_index = 0;               </div>
+<div class="line"><span class="lineno">   54</span>    <span class="keywordtype">size_t</span> f_length = first.size();   </div>
+<div class="line"><span class="lineno">   55</span>    <span class="keywordtype">size_t</span> s_length = second.size();  </div>
 <div class="line"><span class="lineno">   56</span> </div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordflow">while</span> (f_index &lt; f_length &amp;&amp; s_index &lt; s_length) {</div>
 <div class="line"><span class="lineno">   58</span>        <span class="keywordflow">if</span> (first[f_index] &lt; second[s_index]) {</div>
-<div class="line"><span class="lineno">   59</span>            f_index++;  <span class="comment">///&lt; Increment index of second array</span></div>
+<div class="line"><span class="lineno">   59</span>            f_index++;  </div>
 <div class="line"><span class="lineno">   60</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (first[f_index] &gt; second[s_index]) {</div>
-<div class="line"><span class="lineno">   61</span>            s_index++;  <span class="comment">///&lt; Increment index of second array</span></div>
+<div class="line"><span class="lineno">   61</span>            s_index++;  </div>
 <div class="line"><span class="lineno">   62</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   63</span>            <span class="keywordflow">if</span> ((res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() == 0) || (first[f_index] != res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/back.html">back</a>())) {</div>
-<div class="line"><span class="lineno">   64</span>                res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(</div>
-<div class="line"><span class="lineno">   65</span>                    first[f_index]);  <span class="comment">///&lt; Add the element if it is unique</span></div>
+<div class="line"><span class="lineno">   63</span>            <span class="keywordflow">if</span> ((res.size() == 0) || (first[f_index] != res.back())) {</div>
+<div class="line"><span class="lineno">   64</span>                res.push_back(</div>
+<div class="line"><span class="lineno">   65</span>                    first[f_index]);  </div>
 <div class="line"><span class="lineno">   66</span>            }</div>
-<div class="line"><span class="lineno">   67</span>            f_index++;  <span class="comment">///&lt; Increment index of first array</span></div>
-<div class="line"><span class="lineno">   68</span>            s_index++;  <span class="comment">///&lt; Increment index of second array too</span></div>
+<div class="line"><span class="lineno">   67</span>            f_index++;  </div>
+<div class="line"><span class="lineno">   68</span>            s_index++;  </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">return</span> res;</div>
 <div class="line"><span class="lineno">   72</span>}</div>
-<div class="ttc" id="aback_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/back.html">std::vector::back</a></div><div class="ttdeci">T back(T... args)</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="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>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.svg" width="406" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2b8ff06a84b041457873840bf82e2d74" name="a2b8ff06a84b041457873840bf82e2d74"></a>
@@ -226,14 +236,14 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; operations_on_datastructures::get_union </td>
+          <td class="memname">std::vector&lt; int32_t &gt; operations_on_datastructures::get_union </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>first</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; int32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>first</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>second</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; int32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>second</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -241,12 +251,12 @@ Here is the call graph for this function:</div>
 <p>Gets the union of two sorted arrays, and returns them in a vector. </p>
 <p>An algorithm is used that compares the elements of the two vectors, appending the one that has a lower value, and incrementing the index for that array. If one of the arrays reaches its end, all the elements of the other are appended to the resultant vector. </p><dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramname">first</td><td>A <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> of sorted integer values </td></tr>
-    <tr><td class="paramname">second</td><td>A <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> of sorted integer values </td></tr>
+    <tr><td class="paramname">first</td><td>A std::vector of sorted integer values </td></tr>
+    <tr><td class="paramname">second</td><td>A std::vector of sorted integer values </td></tr>
   </table>
   </dd>
 </dl>
-<dl class="section return"><dt>Returns</dt><dd>A <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> of the union of the two arrays, in ascending order </dd></dl>
+<dl class="section return"><dt>Returns</dt><dd>A std::vector of the union of the two arrays, in ascending order </dd></dl>
 <p>&lt; Vector to hold the union</p>
 <p>&lt; Index for the first array</p>
 <p>&lt; Index for the second array</p>
@@ -265,53 +275,49 @@ Here is the call graph for this function:</div>
 <p>&lt; Add the element if it is unique</p>
 <p>&lt; Add remaining elements</p>
 <p>&lt; Add the element if it is unique</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d9c/union__of__two__arrays_8cpp_source.html#l00049">49</a> of file <a class="el" href="../../d8/d9c/union__of__two__arrays_8cpp_source.html">union_of_two_arrays.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   50</span>                                                                 {</div>
-<div class="line"><span class="lineno">   51</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> res;         <span class="comment">///&lt; Vector to hold the union</span></div>
-<div class="line"><span class="lineno">   52</span>    <span class="keywordtype">size_t</span> f_index = 0;               <span class="comment">///&lt; Index for the first array</span></div>
-<div class="line"><span class="lineno">   53</span>    <span class="keywordtype">size_t</span> s_index = 0;               <span class="comment">///&lt; Index for the second array</span></div>
-<div class="line"><span class="lineno">   54</span>    <span class="keywordtype">size_t</span> f_length = first.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();   <span class="comment">///&lt; Length of first array</span></div>
-<div class="line"><span class="lineno">   55</span>    <span class="keywordtype">size_t</span> s_length = second.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();  <span class="comment">///&lt; Length of second array</span></div>
-<div class="line"><span class="lineno">   56</span>    int32_t next = 0;  <span class="comment">///&lt; Integer to store value of the next element</span></div>
+<div class="line"><span class="lineno">   51</span>    std::vector&lt;int32_t&gt; res;         </div>
+<div class="line"><span class="lineno">   52</span>    <span class="keywordtype">size_t</span> f_index = 0;               </div>
+<div class="line"><span class="lineno">   53</span>    <span class="keywordtype">size_t</span> s_index = 0;               </div>
+<div class="line"><span class="lineno">   54</span>    <span class="keywordtype">size_t</span> f_length = first.size();   </div>
+<div class="line"><span class="lineno">   55</span>    <span class="keywordtype">size_t</span> s_length = second.size();  </div>
+<div class="line"><span class="lineno">   56</span>    int32_t next = 0;  </div>
 <div class="line"><span class="lineno">   57</span> </div>
 <div class="line"><span class="lineno">   58</span>    <span class="keywordflow">while</span> (f_index &lt; f_length &amp;&amp; s_index &lt; s_length) {</div>
 <div class="line"><span class="lineno">   59</span>        <span class="keywordflow">if</span> (first[f_index] &lt; second[s_index]) {</div>
-<div class="line"><span class="lineno">   60</span>            next = first[f_index];  <span class="comment">///&lt; Append from first array</span></div>
-<div class="line"><span class="lineno">   61</span>            f_index++;              <span class="comment">///&lt; Increment index of second array</span></div>
+<div class="line"><span class="lineno">   60</span>            next = first[f_index];  </div>
+<div class="line"><span class="lineno">   61</span>            f_index++;              </div>
 <div class="line"><span class="lineno">   62</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (first[f_index] &gt; second[s_index]) {</div>
-<div class="line"><span class="lineno">   63</span>            next = second[s_index];  <span class="comment">///&lt; Append from second array</span></div>
-<div class="line"><span class="lineno">   64</span>            s_index++;               <span class="comment">///&lt; Increment index of second array</span></div>
+<div class="line"><span class="lineno">   63</span>            next = second[s_index];  </div>
+<div class="line"><span class="lineno">   64</span>            s_index++;               </div>
 <div class="line"><span class="lineno">   65</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   66</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a> = first[f_index];  <span class="comment">///&lt; Element is the same in both</span></div>
-<div class="line"><span class="lineno">   67</span>            f_index++;              <span class="comment">///&lt; Increment index of first array</span></div>
-<div class="line"><span class="lineno">   68</span>            s_index++;              <span class="comment">///&lt; Increment index of second array too</span></div>
+<div class="line"><span class="lineno">   66</span>            next = first[f_index];  </div>
+<div class="line"><span class="lineno">   67</span>            f_index++;              </div>
+<div class="line"><span class="lineno">   68</span>            s_index++;              </div>
 <div class="line"><span class="lineno">   69</span>        }</div>
-<div class="line"><span class="lineno">   70</span>        <span class="keywordflow">if</span> ((res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() == 0) || (next != res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/back.html">back</a>())) {</div>
-<div class="line"><span class="lineno">   71</span>            res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(next);  <span class="comment">///&lt; Add the element if it is unique</span></div>
+<div class="line"><span class="lineno">   70</span>        <span class="keywordflow">if</span> ((res.size() == 0) || (next != res.back())) {</div>
+<div class="line"><span class="lineno">   71</span>            res.push_back(next);  </div>
 <div class="line"><span class="lineno">   72</span>        }</div>
 <div class="line"><span class="lineno">   73</span>    }</div>
 <div class="line"><span class="lineno">   74</span>    <span class="keywordflow">while</span> (f_index &lt; f_length) {</div>
-<div class="line"><span class="lineno">   75</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a> = first[f_index];  <span class="comment">///&lt; Add remaining elements</span></div>
-<div class="line"><span class="lineno">   76</span>        <span class="keywordflow">if</span> ((res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() == 0) || (next != res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/back.html">back</a>())) {</div>
-<div class="line"><span class="lineno">   77</span>            res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(next);  <span class="comment">///&lt; Add the element if it is unique</span></div>
+<div class="line"><span class="lineno">   75</span>        next = first[f_index];  </div>
+<div class="line"><span class="lineno">   76</span>        <span class="keywordflow">if</span> ((res.size() == 0) || (next != res.back())) {</div>
+<div class="line"><span class="lineno">   77</span>            res.push_back(next);  </div>
 <div class="line"><span class="lineno">   78</span>        }</div>
 <div class="line"><span class="lineno">   79</span>        f_index++;</div>
 <div class="line"><span class="lineno">   80</span>    }</div>
 <div class="line"><span class="lineno">   81</span>    <span class="keywordflow">while</span> (s_index &lt; s_length) {</div>
-<div class="line"><span class="lineno">   82</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a> = second[s_index];  <span class="comment">///&lt; Add remaining elements</span></div>
-<div class="line"><span class="lineno">   83</span>        <span class="keywordflow">if</span> ((res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() == 0) || (next != res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/back.html">back</a>())) {</div>
-<div class="line"><span class="lineno">   84</span>            res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(next);  <span class="comment">///&lt; Add the element if it is unique</span></div>
+<div class="line"><span class="lineno">   82</span>        next = second[s_index];  </div>
+<div class="line"><span class="lineno">   83</span>        <span class="keywordflow">if</span> ((res.size() == 0) || (next != res.back())) {</div>
+<div class="line"><span class="lineno">   84</span>            res.push_back(next);  </div>
 <div class="line"><span class="lineno">   85</span>        }</div>
 <div class="line"><span class="lineno">   86</span>        s_index++;</div>
 <div class="line"><span class="lineno">   87</span>    }</div>
 <div class="line"><span class="lineno">   88</span>    <span class="keywordflow">return</span> res;</div>
 <div class="line"><span class="lineno">   89</span>}</div>
-<div class="ttc" id="anext_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/next.html">std::next</a></div><div class="ttdeci">T next(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.svg" width="406" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6109193567a5b7e36a27f2b4865fce20" name="a6109193567a5b7e36a27f2b4865fce20"></a>
@@ -323,7 +329,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void operations_on_datastructures::print </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>array</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; int32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>array</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -351,13 +357,14 @@ Here is the call graph for this function:</div>
 <p>Print newline</p>
 <p>Print each value in the array</p>
 <p>Print newline</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d14/array__left__rotation_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../d9/d14/array__left__rotation_8cpp_source.html">array_left_rotation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   29</span>                                            {</div>
 <div class="line"><span class="lineno">   30</span>    <span class="keywordflow">for</span> (int32_t i : array) {</div>
-<div class="line"><span class="lineno">   31</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;  <span class="comment">/// Print each value in the array</span></div>
+<div class="line"><span class="lineno">   31</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;  </div>
 <div class="line"><span class="lineno">   32</span>    }</div>
-<div class="line"><span class="lineno">   33</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;  <span class="comment">/// Print newline</span></div>
+<div class="line"><span class="lineno">   33</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;  </div>
 <div class="line"><span class="lineno">   34</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><!-- fragment -->
 </div>
 </div>
@@ -368,9 +375,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; operations_on_datastructures::shift_left </td>
+          <td class="memname">std::vector&lt; int32_t &gt; operations_on_datastructures::shift_left </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>array</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; int32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>array</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -383,36 +390,33 @@ Here is the call graph for this function:</div>
 <p>Shifts the given vector to the left by the shift amount and returns a new vector with the result. The original vector is not mutated. </p>
 <p>Shifts the values of the vector, by creating a new vector and adding values from the shift index to the end, then appending the rest of the elements from the start of the vector. </p><dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramname">array</td><td>A reference to the input <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
+    <tr><td class="paramname">array</td><td>A reference to the input std::vector </td></tr>
     <tr><td class="paramname">shift</td><td>The amount to be shifted to the left </td></tr>
   </table>
   </dd>
 </dl>
-<dl class="section return"><dt>Returns</dt><dd>A <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> with the shifted values </dd></dl>
+<dl class="section return"><dt>Returns</dt><dd>A std::vector with the shifted values </dd></dl>
 <p>&lt; We got an invalid shift, return empty array</p>
 <p>&lt; Result array</p>
 <p>&lt; Add values after the shift index</p>
 <p>&lt; Add the values from the start</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d14/array__left__rotation_8cpp_source.html#l00046">46</a> of file <a class="el" href="../../d9/d14/array__left__rotation_8cpp_source.html">array_left_rotation.cpp</a>.</p>
 <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> (array.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() &lt;= shift) {</div>
-<div class="line"><span class="lineno">   49</span>        <span class="keywordflow">return</span> {};  <span class="comment">///&lt; We got an invalid shift, return empty array</span></div>
+<div class="line"><span class="lineno">   48</span>    <span class="keywordflow">if</span> (array.size() &lt;= shift) {</div>
+<div class="line"><span class="lineno">   49</span>        <span class="keywordflow">return</span> {};  </div>
 <div class="line"><span class="lineno">   50</span>    }</div>
-<div class="line"><span class="lineno">   51</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> res(array.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>());  <span class="comment">///&lt; Result array</span></div>
-<div class="line"><span class="lineno">   52</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = shift; i &lt; array.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
-<div class="line"><span class="lineno">   53</span>        res[i - shift] = array[i];  <span class="comment">///&lt; Add values after the shift index</span></div>
+<div class="line"><span class="lineno">   51</span>    std::vector&lt;int32_t&gt; res(array.size());  </div>
+<div class="line"><span class="lineno">   52</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = shift; i &lt; array.size(); i++) {</div>
+<div class="line"><span class="lineno">   53</span>        res[i - shift] = array[i];  </div>
 <div class="line"><span class="lineno">   54</span>    }</div>
 <div class="line"><span class="lineno">   55</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; shift; i++) {</div>
-<div class="line"><span class="lineno">   56</span>        res[array.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() - shift + i] =</div>
-<div class="line"><span class="lineno">   57</span>            array[i];  <span class="comment">///&lt; Add the values from the start</span></div>
+<div class="line"><span class="lineno">   56</span>        res[array.size() - shift + i] =</div>
+<div class="line"><span class="lineno">   57</span>            array[i];  </div>
 <div class="line"><span class="lineno">   58</span>    }</div>
 <div class="line"><span class="lineno">   59</span>    <span class="keywordflow">return</span> res;</div>
 <div class="line"><span class="lineno">   60</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.svg" width="367" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1bfb8711f49e591eb168ccaa3df6fb86" name="a1bfb8711f49e591eb168ccaa3df6fb86"></a>
@@ -422,9 +426,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; operations_on_datastructures::shift_right </td>
+          <td class="memname">std::vector&lt; int32_t &gt; operations_on_datastructures::shift_right </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>array</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; int32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>array</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -437,36 +441,33 @@ Here is the call graph for this function:</div>
 <p>Shifts the given vector to the right by the shift amount and returns a new vector with the result. The original vector is not mutated. </p>
 <p>Shifts the values of the vector, by creating a new vector and adding values from the shift index to the end, then appending the rest of the elements to the start of the vector. </p><dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramname">array</td><td>A reference to the input <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
+    <tr><td class="paramname">array</td><td>A reference to the input std::vector </td></tr>
     <tr><td class="paramname">shift</td><td>The amount to be shifted to the right </td></tr>
   </table>
   </dd>
 </dl>
-<dl class="section return"><dt>Returns</dt><dd>A <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> with the shifted values </dd></dl>
+<dl class="section return"><dt>Returns</dt><dd>A std::vector with the shifted values </dd></dl>
 <p>&lt; We got an invalid shift, return empty array</p>
 <p>&lt; Result array</p>
 <p>&lt; Add values after the shift index</p>
 <p>&lt; Add the values from the start</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d57/array__right__rotation_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../d6/d57/array__right__rotation_8cpp_source.html">array_right_rotation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   48</span>                                               {</div>
-<div class="line"><span class="lineno">   49</span>    <span class="keywordflow">if</span> (array.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() &lt;= shift) {</div>
-<div class="line"><span class="lineno">   50</span>        <span class="keywordflow">return</span> {};  <span class="comment">///&lt; We got an invalid shift, return empty array</span></div>
+<div class="line"><span class="lineno">   49</span>    <span class="keywordflow">if</span> (array.size() &lt;= shift) {</div>
+<div class="line"><span class="lineno">   50</span>        <span class="keywordflow">return</span> {};  </div>
 <div class="line"><span class="lineno">   51</span>    }</div>
-<div class="line"><span class="lineno">   52</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int32_t&gt;</a> res(array.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>());  <span class="comment">///&lt; Result array</span></div>
-<div class="line"><span class="lineno">   53</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = shift; i &lt; array.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
-<div class="line"><span class="lineno">   54</span>        res[i] = array[i - shift];  <span class="comment">///&lt; Add values after the shift index</span></div>
+<div class="line"><span class="lineno">   52</span>    std::vector&lt;int32_t&gt; res(array.size());  </div>
+<div class="line"><span class="lineno">   53</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = shift; i &lt; array.size(); i++) {</div>
+<div class="line"><span class="lineno">   54</span>        res[i] = array[i - shift];  </div>
 <div class="line"><span class="lineno">   55</span>    }</div>
 <div class="line"><span class="lineno">   56</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; shift; i++) {</div>
 <div class="line"><span class="lineno">   57</span>        res[i] =</div>
-<div class="line"><span class="lineno">   58</span>            array[array.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() - shift + i];  <span class="comment">///&lt; Add the values from the start</span></div>
+<div class="line"><span class="lineno">   58</span>            array[array.size() - shift + i];  </div>
 <div class="line"><span class="lineno">   59</span>    }</div>
 <div class="line"><span class="lineno">   60</span>    <span class="keywordflow">return</span> res;</div>
 <div class="line"><span class="lineno">   61</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.svg" width="367" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.map b/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.map
deleted file mode 100644
index c3f2f1fd7..000000000
--- a/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="operations_on_datastructures::shift_right" name="operations_on_datastructures::shift_right">
-<area shape="rect" id="Node000001" title="Shifts the given vector to the right by the shift amount and returns a new vector with the result...." alt="" coords="5,5,198,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="246,13,361,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="198,23,230,23,230,28,198,28"/>
-</map>
diff --git a/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.md5 b/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.md5
deleted file mode 100644
index 488896de4..000000000
--- a/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f5e25a3ff024932c5a51b7b1efdd2a05
\ No newline at end of file
diff --git a/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.svg b/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.svg
deleted file mode 100644
index cecab8559..000000000
--- a/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::shift_right Pages: 1 -->
-<svg width="275pt" height="39pt"
- viewBox="0.00 0.00 274.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>operations_on_datastructures::shift_right</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Shifts the given vector to the right by the shift amount and returns a new vector with the result....">
-<polygon fill="#999999" stroke="#666666" points="144.25,-30.5 0,-30.5 0,0 144.25,0 144.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::shift_right</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.75,-24.88 180.25,-24.88 180.25,-5.63 266.75,-5.63 266.75,-24.88"/>
-<text text-anchor="middle" x="223.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.75,-15.25C152.71,-15.25 160.71,-15.25 168.39,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.26,-18.75 178.26,-15.25 168.26,-11.75 168.26,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph_org.svg b/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph_org.svg
deleted file mode 100644
index 8dbdb2427..000000000
--- a/da/d6d/namespaceoperations__on__datastructures_a1bfb8711f49e591eb168ccaa3df6fb86_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::shift_right Pages: 1 -->
-<svg width="275pt" height="39pt"
- viewBox="0.00 0.00 274.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>operations_on_datastructures::shift_right</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Shifts the given vector to the right by the shift amount and returns a new vector with the result....">
-<polygon fill="#999999" stroke="#666666" points="144.25,-30.5 0,-30.5 0,0 144.25,0 144.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::shift_right</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.75,-24.88 180.25,-24.88 180.25,-5.63 266.75,-5.63 266.75,-24.88"/>
-<text text-anchor="middle" x="223.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.75,-15.25C152.71,-15.25 160.71,-15.25 168.39,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.26,-18.75 178.26,-15.25 168.26,-11.75 168.26,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.map b/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.map
deleted file mode 100644
index aaddbadd6..000000000
--- a/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="operations_on_datastructures::get_union" name="operations_on_datastructures::get_union">
-<area shape="rect" id="Node000001" title="Gets the union of two sorted arrays, and returns them in a vector." alt="" coords="5,47,198,88"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="263,5,382,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="195,44,248,32,249,37,196,49"/>
-<area shape="rect" id="Node000003" 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="246,55,400,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="198,65,230,65,230,70,198,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="265,104,380,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="196,86,251,98,249,103,195,91"/>
-</map>
diff --git a/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.md5 b/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.md5
deleted file mode 100644
index 108aa866d..000000000
--- a/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bcd05b03e4b3054b424c6943fd327030
\ No newline at end of file
diff --git a/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.svg b/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.svg
deleted file mode 100644
index 6291ccf69..000000000
--- a/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::get_union Pages: 1 -->
-<svg width="304pt" height="101pt"
- viewBox="0.00 0.00 304.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>operations_on_datastructures::get_union</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Gets the union of two sorted arrays, and returns them in a vector.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-61.88 0,-61.88 0,-31.38 144.25,-31.38 144.25,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="middle" x="72.12" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::get_union</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282.88,-93.25 193.38,-93.25 193.38,-74 282.88,-74 282.88,-93.25"/>
-<text text-anchor="middle" x="238.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.68,-62.32C155.91,-65.3 169.59,-68.39 182.29,-71.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.15,-74.59 191.68,-73.37 182.69,-67.76 181.15,-74.59"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296,-56.25 180.25,-56.25 180.25,-37 296,-37 296,-56.25"/>
-<text text-anchor="middle" x="238.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.58,-46.62C152.58,-46.62 160.72,-46.62 168.69,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.68,-50.13 178.68,-46.63 168.68,-43.13 168.68,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="281.38,-19.25 194.88,-19.25 194.88,0 281.38,0 281.38,-19.25"/>
-<text text-anchor="middle" x="238.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.68,-30.93C156.32,-27.86 170.43,-24.67 183.45,-21.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.11,-25.17 193.1,-19.56 182.57,-18.34 184.11,-25.17"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph_org.svg b/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph_org.svg
deleted file mode 100644
index a18f2ac09..000000000
--- a/da/d6d/namespaceoperations__on__datastructures_a2b8ff06a84b041457873840bf82e2d74_cgraph_org.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::get_union Pages: 1 -->
-<svg width="304pt" height="101pt"
- viewBox="0.00 0.00 304.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>operations_on_datastructures::get_union</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Gets the union of two sorted arrays, and returns them in a vector.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-61.88 0,-61.88 0,-31.38 144.25,-31.38 144.25,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="middle" x="72.12" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::get_union</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282.88,-93.25 193.38,-93.25 193.38,-74 282.88,-74 282.88,-93.25"/>
-<text text-anchor="middle" x="238.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.68,-62.32C155.91,-65.3 169.59,-68.39 182.29,-71.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.15,-74.59 191.68,-73.37 182.69,-67.76 181.15,-74.59"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296,-56.25 180.25,-56.25 180.25,-37 296,-37 296,-56.25"/>
-<text text-anchor="middle" x="238.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.58,-46.62C152.58,-46.62 160.72,-46.62 168.69,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.68,-50.13 178.68,-46.63 168.68,-43.13 168.68,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="281.38,-19.25 194.88,-19.25 194.88,0 281.38,0 281.38,-19.25"/>
-<text text-anchor="middle" x="238.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.68,-30.93C156.32,-27.86 170.43,-24.67 183.45,-21.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.11,-25.17 193.1,-19.56 182.57,-18.34 184.11,-25.17"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.map b/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.map
deleted file mode 100644
index 600fed6c4..000000000
--- a/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="operations_on_datastructures::get_intersection" name="operations_on_datastructures::get_intersection">
-<area shape="rect" id="Node000001" title="Gets the intersection of two sorted arrays, and returns them in a vector." alt="" coords="5,47,198,88"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="263,5,382,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="195,44,248,32,249,37,196,49"/>
-<area shape="rect" id="Node000003" 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="246,55,400,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="198,65,230,65,230,70,198,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="265,104,380,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="196,86,251,98,249,103,195,91"/>
-</map>
diff --git a/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.md5 b/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.md5
deleted file mode 100644
index 39e81ed39..000000000
--- a/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2f60d246ed68f9e25d3c25cb94b3090a
\ No newline at end of file
diff --git a/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.svg b/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.svg
deleted file mode 100644
index 0818fbf21..000000000
--- a/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::get_intersection Pages: 1 -->
-<svg width="304pt" height="101pt"
- viewBox="0.00 0.00 304.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>operations_on_datastructures::get_intersection</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Gets the intersection of two sorted arrays, and returns them in a vector.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-61.88 0,-61.88 0,-31.38 144.25,-31.38 144.25,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="middle" x="72.12" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::get_intersection</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282.88,-93.25 193.38,-93.25 193.38,-74 282.88,-74 282.88,-93.25"/>
-<text text-anchor="middle" x="238.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.68,-62.32C155.91,-65.3 169.59,-68.39 182.29,-71.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.15,-74.59 191.68,-73.37 182.69,-67.76 181.15,-74.59"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296,-56.25 180.25,-56.25 180.25,-37 296,-37 296,-56.25"/>
-<text text-anchor="middle" x="238.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.58,-46.62C152.58,-46.62 160.72,-46.62 168.69,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.68,-50.13 178.68,-46.63 168.68,-43.13 168.68,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="281.38,-19.25 194.88,-19.25 194.88,0 281.38,0 281.38,-19.25"/>
-<text text-anchor="middle" x="238.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.68,-30.93C156.32,-27.86 170.43,-24.67 183.45,-21.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.11,-25.17 193.1,-19.56 182.57,-18.34 184.11,-25.17"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph_org.svg b/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph_org.svg
deleted file mode 100644
index 17d5f03a9..000000000
--- a/da/d6d/namespaceoperations__on__datastructures_adaf9a06f0c236c2d95c97e441ea2d12e_cgraph_org.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::get_intersection Pages: 1 -->
-<svg width="304pt" height="101pt"
- viewBox="0.00 0.00 304.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>operations_on_datastructures::get_intersection</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Gets the intersection of two sorted arrays, and returns them in a vector.">
-<polygon fill="#999999" stroke="#666666" points="144.25,-61.88 0,-61.88 0,-31.38 144.25,-31.38 144.25,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="middle" x="72.12" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::get_intersection</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282.88,-93.25 193.38,-93.25 193.38,-74 282.88,-74 282.88,-93.25"/>
-<text text-anchor="middle" x="238.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.68,-62.32C155.91,-65.3 169.59,-68.39 182.29,-71.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.15,-74.59 191.68,-73.37 182.69,-67.76 181.15,-74.59"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296,-56.25 180.25,-56.25 180.25,-37 296,-37 296,-56.25"/>
-<text text-anchor="middle" x="238.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.58,-46.62C152.58,-46.62 160.72,-46.62 168.69,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.68,-50.13 178.68,-46.63 168.68,-43.13 168.68,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="281.38,-19.25 194.88,-19.25 194.88,0 281.38,0 281.38,-19.25"/>
-<text text-anchor="middle" x="238.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.68,-30.93C156.32,-27.86 170.43,-24.67 183.45,-21.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.11,-25.17 193.1,-19.56 182.57,-18.34 184.11,-25.17"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.map b/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.map
deleted file mode 100644
index 2f6937d45..000000000
--- a/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="operations_on_datastructures::shift_left" name="operations_on_datastructures::shift_left">
-<area shape="rect" id="Node000001" title="Shifts the given vector to the left by the shift amount and returns a new vector with the result...." alt="" coords="5,5,198,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="246,13,361,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="198,23,230,23,230,28,198,28"/>
-</map>
diff --git a/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.md5 b/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.md5
deleted file mode 100644
index 12ef778e0..000000000
--- a/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-14dc21fcd42b7e6eab77f4df2162358f
\ No newline at end of file
diff --git a/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.svg b/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.svg
deleted file mode 100644
index d10286ab3..000000000
--- a/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::shift_left Pages: 1 -->
-<svg width="275pt" height="39pt"
- viewBox="0.00 0.00 274.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>operations_on_datastructures::shift_left</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Shifts the given vector to the left by the shift amount and returns a new vector with the result....">
-<polygon fill="#999999" stroke="#666666" points="144.25,-30.5 0,-30.5 0,0 144.25,0 144.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::shift_left</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.75,-24.88 180.25,-24.88 180.25,-5.63 266.75,-5.63 266.75,-24.88"/>
-<text text-anchor="middle" x="223.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.75,-15.25C152.71,-15.25 160.71,-15.25 168.39,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.26,-18.75 178.26,-15.25 168.26,-11.75 168.26,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph_org.svg b/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph_org.svg
deleted file mode 100644
index 7789d8deb..000000000
--- a/da/d6d/namespaceoperations__on__datastructures_afce39cf843989a39811a49ebe29dd6d8_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::shift_left Pages: 1 -->
-<svg width="275pt" height="39pt"
- viewBox="0.00 0.00 274.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>operations_on_datastructures::shift_left</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Shifts the given vector to the left by the shift amount and returns a new vector with the result....">
-<polygon fill="#999999" stroke="#666666" points="144.25,-30.5 0,-30.5 0,0 144.25,0 144.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="middle" x="72.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::shift_left</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.75,-24.88 180.25,-24.88 180.25,-5.63 266.75,-5.63 266.75,-24.88"/>
-<text text-anchor="middle" x="223.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.75,-15.25C152.71,-15.25 160.71,-15.25 168.39,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.26,-18.75 178.26,-15.25 168.26,-11.75 168.26,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html b/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html
index d85bb12ac..70370dcf2 100644
--- a/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html
+++ b/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info Struct Reference</title>
+<title>TheAlgorithms/C++: machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -150,21 +167,20 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a94862762ad167506dcb0cdebf007d04c" id="r_a94862762ad167506dcb0cdebf007d04c"><td class="memItemLeft" align="right" valign="top"><a id="a94862762ad167506dcb0cdebf007d04c" name="a94862762ad167506dcb0cdebf007d04c"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; Puzzle &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>state</b></td></tr>
+<tr class="memitem:a94862762ad167506dcb0cdebf007d04c" id="r_a94862762ad167506dcb0cdebf007d04c"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; Puzzle &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a94862762ad167506dcb0cdebf007d04c">state</a></td></tr>
 <tr class="separator:a94862762ad167506dcb0cdebf007d04c"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a331d1070d008a4f9d55775a51013baa3" id="r_a331d1070d008a4f9d55775a51013baa3"><td class="memItemLeft" align="right" valign="top"><a id="a331d1070d008a4f9d55775a51013baa3" name="a331d1070d008a4f9d55775a51013baa3"></a>
-size_t&#160;</td><td class="memItemRight" valign="bottom"><b>heuristic_value</b> = 0</td></tr>
-<tr class="memdesc:a331d1070d008a4f9d55775a51013baa3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Holds the current state. <br /></td></tr>
+<tr class="memitem:a331d1070d008a4f9d55775a51013baa3" id="r_a331d1070d008a4f9d55775a51013baa3"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a> = 0</td></tr>
+<tr class="memdesc:a331d1070d008a4f9d55775a51013baa3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Holds the current state.  <br /></td></tr>
 <tr class="separator:a331d1070d008a4f9d55775a51013baa3"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a003a30bb165be50ce503c17df90c128d" id="r_a003a30bb165be50ce503c17df90c128d"><td class="memItemLeft" align="right" valign="top"><a id="a003a30bb165be50ce503c17df90c128d" name="a003a30bb165be50ce503c17df90c128d"></a>
-size_t&#160;</td><td class="memItemRight" valign="bottom"><b>depth</b> = 0</td></tr>
-<tr class="memdesc:a003a30bb165be50ce503c17df90c128d"><td class="mdescLeft">&#160;</td><td class="mdescRight">stores h score <br /></td></tr>
+<tr class="memitem:a003a30bb165be50ce503c17df90c128d" id="r_a003a30bb165be50ce503c17df90c128d"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a003a30bb165be50ce503c17df90c128d">depth</a> = 0</td></tr>
+<tr class="memdesc:a003a30bb165be50ce503c17df90c128d"><td class="mdescLeft">&#160;</td><td class="mdescRight">stores h score  <br /></td></tr>
 <tr class="separator:a003a30bb165be50ce503c17df90c128d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><div class="compoundTemplParams">template&lt;typename Puzzle&gt;<br />
 struct machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info</div><p>Struct that handles all the information related to the current state. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00293">293</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="aaa7ea27346659f0abe2df82ca57fc5a7" name="aaa7ea27346659f0abe2df82ca57fc5a7"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aaa7ea27346659f0abe2df82ca57fc5a7">&#9670;&#160;</a></span>Info() <span class="overload">[1/5]</span></h2>
@@ -228,8 +244,9 @@ template&lt;typename Puzzle &gt; </div>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">  307</span>: state(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;Puzzle&gt;</a>(A)) {}</div>
-<div class="ttc" id="amake_shared_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared</a></div><div class="ttdeci">T make_shared(T... args)</div></div>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00307">307</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  307</span>: state(std::make_shared&lt;Puzzle&gt;(A)) {}</div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -276,11 +293,13 @@ template&lt;typename Puzzle &gt; </div>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">  316</span>            : state(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;Puzzle&gt;</a>(A)),</div>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00315">315</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  316</span>            : state(std::make_shared&lt;Puzzle&gt;(A)),</div>
 <div class="line"><span class="lineno">  317</span>              <a class="code hl_variable" href="#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a>(h_value),</div>
 <div class="line"><span class="lineno">  318</span>              <a class="code hl_variable" href="#a003a30bb165be50ce503c17df90c128d">depth</a>(d) {}</div>
-<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_a003a30bb165be50ce503c17df90c128d"><div class="ttname"><a href="#a003a30bb165be50ce503c17df90c128d">machine_learning::aystar_search::AyStarSearch::Info::depth</a></div><div class="ttdeci">size_t depth</div><div class="ttdoc">stores h score</div><div class="ttdef"><b>Definition</b> a_star_search.cpp:296</div></div>
-<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_a331d1070d008a4f9d55775a51013baa3"><div class="ttname"><a href="#a331d1070d008a4f9d55775a51013baa3">machine_learning::aystar_search::AyStarSearch::Info::heuristic_value</a></div><div class="ttdeci">size_t heuristic_value</div><div class="ttdoc">Holds the current state.</div><div class="ttdef"><b>Definition</b> a_star_search.cpp:295</div></div>
+<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_a003a30bb165be50ce503c17df90c128d"><div class="ttname"><a href="#a003a30bb165be50ce503c17df90c128d">machine_learning::aystar_search::AyStarSearch::Info::depth</a></div><div class="ttdeci">size_t depth</div><div class="ttdoc">stores h score</div><div class="ttdef"><b>Definition</b> <a href="../../dd/dec/a__star__search_8cpp_source.html#l00296">a_star_search.cpp:296</a></div></div>
+<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_a331d1070d008a4f9d55775a51013baa3"><div class="ttname"><a href="#a331d1070d008a4f9d55775a51013baa3">machine_learning::aystar_search::AyStarSearch::Info::heuristic_value</a></div><div class="ttdeci">size_t heuristic_value</div><div class="ttdoc">Holds the current state.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/dec/a__star__search_8cpp_source.html#l00295">a_star_search.cpp:295</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -316,7 +335,9 @@ template&lt;typename Puzzle &gt; </div>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">  325</span>            : state(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;Puzzle&gt;</a>(A.state)),</div>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00324">324</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  325</span>            : state(std::make_shared&lt;Puzzle&gt;(A.state)),</div>
 <div class="line"><span class="lineno">  326</span>              <a class="code hl_variable" href="#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a>(A.heuristic_value),</div>
 <div class="line"><span class="lineno">  327</span>              <a class="code hl_variable" href="#a003a30bb165be50ce503c17df90c128d">depth</a>(A.depth) {}</div>
 </div><!-- fragment -->
@@ -354,10 +375,11 @@ template&lt;typename Puzzle &gt; </div>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">  334</span>            : state(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;Puzzle&gt;</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(A.state))),</div>
-<div class="line"><span class="lineno">  335</span>              <a class="code hl_variable" href="#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(A.heuristic_value)),</div>
-<div class="line"><span class="lineno">  336</span>              <a class="code hl_variable" href="#a003a30bb165be50ce503c17df90c128d">depth</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(A.depth)) {}</div>
-<div class="ttc" id="amove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></div><div class="ttdeci">T move(T... args)</div></div>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00333">333</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  334</span>            : state(std::make_shared&lt;Puzzle&gt;(std::move(A.state))),</div>
+<div class="line"><span class="lineno">  335</span>              <a class="code hl_variable" href="#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a>(std::move(A.heuristic_value)),</div>
+<div class="line"><span class="lineno">  336</span>              <a class="code hl_variable" href="#a003a30bb165be50ce503c17df90c128d">depth</a>(std::move(A.depth)) {}</div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -394,6 +416,8 @@ template&lt;typename Puzzle &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00342">342</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  342</span>                                       {</div>
 <div class="line"><span class="lineno">  343</span>            state = A.state;</div>
 <div class="line"><span class="lineno">  344</span>            <a class="code hl_variable" href="#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a> = A.heuristic_value;</div>
@@ -435,22 +459,78 @@ template&lt;typename Puzzle &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00353">353</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  353</span>                                           {</div>
-<div class="line"><span class="lineno">  354</span>            state = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(A.state);</div>
-<div class="line"><span class="lineno">  355</span>            <a class="code hl_variable" href="#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(A.heuristic_value);</div>
-<div class="line"><span class="lineno">  356</span>            <a class="code hl_variable" href="#a003a30bb165be50ce503c17df90c128d">depth</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(A.depth);</div>
+<div class="line"><span class="lineno">  354</span>            state = std::move(A.state);</div>
+<div class="line"><span class="lineno">  355</span>            <a class="code hl_variable" href="#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a> = std::move(A.heuristic_value);</div>
+<div class="line"><span class="lineno">  356</span>            <a class="code hl_variable" href="#a003a30bb165be50ce503c17df90c128d">depth</a> = std::move(A.depth);</div>
 <div class="line"><span class="lineno">  357</span>            <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  358</span>        }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_ad3993dbca9c5b3ef9ac361dc7f62ce57_cgraph.svg" width="304" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a003a30bb165be50ce503c17df90c128d" name="a003a30bb165be50ce503c17df90c128d"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a003a30bb165be50ce503c17df90c128d">&#9670;&#160;</a></span>depth</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename Puzzle &gt; </div>
+      <table class="memname">
+        <tr>
+          <td class="memname">size_t <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a>&lt; Puzzle &gt;::Info::depth = 0</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>stores h score </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00296">296</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a331d1070d008a4f9d55775a51013baa3" name="a331d1070d008a4f9d55775a51013baa3"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a331d1070d008a4f9d55775a51013baa3">&#9670;&#160;</a></span>heuristic_value</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename Puzzle &gt; </div>
+      <table class="memname">
+        <tr>
+          <td class="memname">size_t <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a>&lt; Puzzle &gt;::Info::heuristic_value = 0</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Holds the current state. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00295">295</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a94862762ad167506dcb0cdebf007d04c" name="a94862762ad167506dcb0cdebf007d04c"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a94862762ad167506dcb0cdebf007d04c">&#9670;&#160;</a></span>state</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename Puzzle &gt; </div>
+      <table class="memname">
+        <tr>
+          <td class="memname">std::shared_ptr&lt;Puzzle&gt; <a class="el" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a>&lt; Puzzle &gt;::Info::state</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00294">294</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>machine_learning/<b>a_star_search.cpp</b></li>
+<li>machine_learning/<a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_ad3993dbca9c5b3ef9ac361dc7f62ce57_cgraph.map b/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_ad3993dbca9c5b3ef9ac361dc7f62ce57_cgraph.map
deleted file mode 100644
index dc01d1742..000000000
--- a/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_ad3993dbca9c5b3ef9ac361dc7f62ce57_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="machine_learning::aystar_search::AyStarSearch::Info::operator=" name="machine_learning::aystar_search::AyStarSearch::Info::operator=">
-<area shape="rect" id="Node000001" title="move assignment operator" alt="" coords="5,5,172,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="220,20,299,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="172,30,204,30,204,36,172,36"/>
-</map>
diff --git a/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_ad3993dbca9c5b3ef9ac361dc7f62ce57_cgraph.md5 b/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_ad3993dbca9c5b3ef9ac361dc7f62ce57_cgraph.md5
deleted file mode 100644
index b037e6acc..000000000
--- a/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_ad3993dbca9c5b3ef9ac361dc7f62ce57_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-abb8ff5f41185534f4a7823585ff7ae8
\ No newline at end of file
diff --git a/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_ad3993dbca9c5b3ef9ac361dc7f62ce57_cgraph.svg b/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_ad3993dbca9c5b3ef9ac361dc7f62ce57_cgraph.svg
deleted file mode 100644
index 13624b23a..000000000
--- a/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_ad3993dbca9c5b3ef9ac361dc7f62ce57_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::aystar_search::AyStarSearch::Info::operator= Pages: 1 -->
-<svg width="228pt" height="50pt"
- viewBox="0.00 0.00 228.25 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>machine_learning::aystar_search::AyStarSearch::Info::operator=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="move assignment operator">
-<polygon fill="#999999" stroke="#666666" points="124.75,-41.75 0,-41.75 0,0 124.75,0 124.75,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_search::AyStarSearch::</text>
-<text text-anchor="middle" x="62.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Info::operator=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-30.5 160.75,-30.5 160.75,-11.25 220.25,-11.25 220.25,-30.5"/>
-<text text-anchor="middle" x="190.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.96,-20.88C133.18,-20.88 141.44,-20.88 149.17,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.91,-24.38 158.91,-20.88 148.91,-17.38 148.91,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_ad3993dbca9c5b3ef9ac361dc7f62ce57_cgraph_org.svg b/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_ad3993dbca9c5b3ef9ac361dc7f62ce57_cgraph_org.svg
deleted file mode 100644
index 9ad66f12f..000000000
--- a/da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_ad3993dbca9c5b3ef9ac361dc7f62ce57_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::aystar_search::AyStarSearch::Info::operator= Pages: 1 -->
-<svg width="228pt" height="50pt"
- viewBox="0.00 0.00 228.25 49.75" 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.75)">
-<title>machine_learning::aystar_search::AyStarSearch::Info::operator=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="move assignment operator">
-<polygon fill="#999999" stroke="#666666" points="124.75,-41.75 0,-41.75 0,0 124.75,0 124.75,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_search::AyStarSearch::</text>
-<text text-anchor="middle" x="62.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Info::operator=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-30.5 160.75,-30.5 160.75,-11.25 220.25,-11.25 220.25,-30.5"/>
-<text text-anchor="middle" x="190.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.96,-20.88C133.18,-20.88 141.44,-20.88 149.17,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.91,-24.38 158.91,-20.88 148.91,-17.38 148.91,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d73/classgraph_1_1_lowest_common_ancestor-members.html b/da/d73/classgraph_1_1_lowest_common_ancestor-members.html
index fc33dd9e3..b6ba2bb3e 100644
--- a/da/d73/classgraph_1_1_lowest_common_ancestor-members.html
+++ b/da/d73/classgraph_1_1_lowest_common_ancestor-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.map b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.map
index e458a21a2..b4d76942f 100644
--- a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.map
+++ b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.map
@@ -1,11 +1,9 @@
 <map id="strings::boyer_moore::pattern" name="strings::boyer_moore::pattern">
-<area shape="rect" id="Node000001" title="A structure representing all the data we need to search the preprocessed pattern in text." alt="" coords="63,213,206,253"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string.html" title=" " alt="" coords="28,109,108,135"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="85,146,125,211,120,214,81,149"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string.html" title=" " alt="" coords="5,5,131,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="71,61,71,109,65,109,65,61"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="132,109,274,135"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="189,149,149,214,145,211,185,146"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/size_t.html" title=" " alt="" coords="162,13,244,38"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="205,54,205,108,200,108,200,54"/>
+<area shape="rect" id="Node000001" title="A structure representing all the data we need to search the preprocessed pattern in text." alt="" coords="64,199,208,240"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="28,95,108,121"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="86,133,126,197,122,200,81,136"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="5,5,131,46"/>
+<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="71,61,71,95,65,95,65,61"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="132,95,274,121"/>
+<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="190,136,150,200,146,197,185,133"/>
 </map>
diff --git a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.md5 b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.md5
index ace466e06..5b8d06bb7 100644
--- a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.md5
+++ b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.md5
@@ -1 +1 @@
-a8a3d83907b4a330504f55723ba112d4
\ No newline at end of file
+8397fb0fedfe483208ae3bf4cb72d014
\ No newline at end of file
diff --git a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.svg b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.svg
index 15b408bdb..f7cb310f7 100644
--- a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.svg
+++ b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.svg
@@ -4,8 +4,8 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: strings::boyer_moore::pattern Pages: 1 -->
-<svg width="209pt" height="194pt"
- viewBox="0.00 0.00 209.38 194.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="209pt" height="184pt"
+ viewBox="0.00 0.00 209.38 183.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
 <svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
@@ -17,22 +17,22 @@
 ]]></style>
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
 <svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 190)">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 179.75)">
 <title>strings::boyer_moore::pattern</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="A structure representing all the data we need to search the preprocessed pattern in text.">
-<polygon fill="#999999" stroke="#666666" points="150.75,-30.5 43.25,-30.5 43.25,0 150.75,0 150.75,-30.5"/>
-<text text-anchor="start" x="51.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="97" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pattern</text>
+<polygon fill="#999999" stroke="#666666" points="151.75,-30.5 44.25,-30.5 44.25,0 151.75,0 151.75,-30.5"/>
+<text text-anchor="start" x="52.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
+<text text-anchor="middle" x="98" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pattern</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="76.75,-108.25 17.25,-108.25 17.25,-89 76.75,-89 76.75,-108.25"/>
 <text text-anchor="middle" x="47" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string</text>
 </a>
@@ -42,19 +42,19 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M58.39,-79.09C67.39,-64.44 79.77,-44.29 88.06,-30.79"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="55.59,-76.96 53.33,-87.32 61.55,-80.63 55.59,-76.96"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M58.62,-79.09C67.8,-64.44 80.43,-44.29 88.88,-30.79"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="55.8,-76.99 53.46,-87.32 61.73,-80.71 55.8,-76.99"/>
 </a>
 </g>
-<text text-anchor="middle" x="84.73" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> pat</text>
+<text text-anchor="middle" x="85.32" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> pat</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="94,-186 0,-186 0,-155.5 94,-155.5 94,-186"/>
-<text text-anchor="start" x="8" y="-172.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::basic_string&lt;</text>
-<text text-anchor="middle" x="47" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00"> Char &gt;</text>
+<g id="a_Node000003"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="94,-175.75 0,-175.75 0,-145.25 94,-145.25 94,-175.75"/>
+<text text-anchor="start" x="8" y="-162.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::basic_string&lt;</text>
+<text text-anchor="middle" x="47" y="-151" font-family="Helvetica,sans-Serif" font-size="10.00"> Char &gt;</text>
 </a>
 </g>
 </g>
@@ -62,15 +62,15 @@
 <g id="edge2_Node000002_Node000003" class="edge">
 <title>Node3&#45;&gt;Node2</title>
 <g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47,-143.98C47,-131.48 47,-117.27 47,-108.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="43.5,-143.71 47,-153.71 50.5,-143.71 43.5,-143.71"/>
+<path fill="none" stroke="#63b8ff" d="M47,-133.77C47,-124.79 47,-115.29 47,-108.6"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="43.5,-133.49 47,-143.49 50.5,-133.49 43.5,-133.49"/>
 </a>
 </g>
 </g>
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="201.38,-108.25 94.62,-108.25 94.62,-89 201.38,-89 201.38,-108.25"/>
 <text text-anchor="middle" x="148" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; size_t &gt;</text>
 </a>
@@ -80,31 +80,12 @@
 <g id="edge3_Node000001_Node000004" class="edge">
 <title>Node4&#45;&gt;Node1</title>
 <g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M136.38,-79.09C127.2,-64.44 114.57,-44.29 106.12,-30.79"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="133.27,-80.71 141.54,-87.32 139.2,-76.99 133.27,-80.71"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M136.61,-79.09C127.61,-64.44 115.23,-44.29 106.94,-30.79"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="133.45,-80.63 141.67,-87.32 139.41,-76.96 133.45,-80.63"/>
 </a>
 </g>
-<text text-anchor="middle" x="155.17" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> bad_char</text>
-<text text-anchor="middle" x="155.17" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">good_suffix</text>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="178.88,-180.38 117.12,-180.38 117.12,-161.12 178.88,-161.12 178.88,-180.38"/>
-<text text-anchor="middle" x="148" y="-166.88" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M148,-149.37C148,-135.89 148,-118.89 148,-108.66"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="144.5,-149.36 148,-159.36 151.5,-149.36 144.5,-149.36"/>
-</a>
-</g>
-<text text-anchor="middle" x="169.38" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="155.53" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> bad_char</text>
+<text text-anchor="middle" x="155.53" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">good_suffix</text>
 </g>
 </g>
 </svg>
diff --git a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph_org.svg b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph_org.svg
index 22b93d1e4..fbee08020 100644
--- a/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph_org.svg
+++ b/da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph_org.svg
@@ -4,24 +4,24 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: strings::boyer_moore::pattern Pages: 1 -->
-<svg width="209pt" height="194pt"
- viewBox="0.00 0.00 209.38 194.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 190)">
+<svg width="209pt" height="184pt"
+ viewBox="0.00 0.00 209.38 183.75" 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 179.75)">
 <title>strings::boyer_moore::pattern</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="A structure representing all the data we need to search the preprocessed pattern in text.">
-<polygon fill="#999999" stroke="#666666" points="150.75,-30.5 43.25,-30.5 43.25,0 150.75,0 150.75,-30.5"/>
-<text text-anchor="start" x="51.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
-<text text-anchor="middle" x="97" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pattern</text>
+<polygon fill="#999999" stroke="#666666" points="151.75,-30.5 44.25,-30.5 44.25,0 151.75,0 151.75,-30.5"/>
+<text text-anchor="start" x="52.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
+<text text-anchor="middle" x="98" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pattern</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="76.75,-108.25 17.25,-108.25 17.25,-89 76.75,-89 76.75,-108.25"/>
 <text text-anchor="middle" x="47" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string</text>
 </a>
@@ -31,19 +31,19 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M58.39,-79.09C67.39,-64.44 79.77,-44.29 88.06,-30.79"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="55.59,-76.96 53.33,-87.32 61.55,-80.63 55.59,-76.96"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M58.62,-79.09C67.8,-64.44 80.43,-44.29 88.88,-30.79"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="55.8,-76.99 53.46,-87.32 61.73,-80.71 55.8,-76.99"/>
 </a>
 </g>
-<text text-anchor="middle" x="84.73" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> pat</text>
+<text text-anchor="middle" x="85.32" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> pat</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="94,-186 0,-186 0,-155.5 94,-155.5 94,-186"/>
-<text text-anchor="start" x="8" y="-172.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::basic_string&lt;</text>
-<text text-anchor="middle" x="47" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00"> Char &gt;</text>
+<g id="a_Node000003"><a xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="94,-175.75 0,-175.75 0,-145.25 94,-145.25 94,-175.75"/>
+<text text-anchor="start" x="8" y="-162.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::basic_string&lt;</text>
+<text text-anchor="middle" x="47" y="-151" font-family="Helvetica,sans-Serif" font-size="10.00"> Char &gt;</text>
 </a>
 </g>
 </g>
@@ -51,15 +51,15 @@
 <g id="edge2_Node000002_Node000003" class="edge">
 <title>Node3&#45;&gt;Node2</title>
 <g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47,-143.98C47,-131.48 47,-117.27 47,-108.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="43.5,-143.71 47,-153.71 50.5,-143.71 43.5,-143.71"/>
+<path fill="none" stroke="#63b8ff" d="M47,-133.77C47,-124.79 47,-115.29 47,-108.6"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="43.5,-133.49 47,-143.49 50.5,-133.49 43.5,-133.49"/>
 </a>
 </g>
 </g>
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="201.38,-108.25 94.62,-108.25 94.62,-89 201.38,-89 201.38,-108.25"/>
 <text text-anchor="middle" x="148" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; size_t &gt;</text>
 </a>
@@ -69,31 +69,12 @@
 <g id="edge3_Node000001_Node000004" class="edge">
 <title>Node4&#45;&gt;Node1</title>
 <g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M136.38,-79.09C127.2,-64.44 114.57,-44.29 106.12,-30.79"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="133.27,-80.71 141.54,-87.32 139.2,-76.99 133.27,-80.71"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M136.61,-79.09C127.61,-64.44 115.23,-44.29 106.94,-30.79"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="133.45,-80.63 141.67,-87.32 139.41,-76.96 133.45,-80.63"/>
 </a>
 </g>
-<text text-anchor="middle" x="155.17" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> bad_char</text>
-<text text-anchor="middle" x="155.17" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">good_suffix</text>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="178.88,-180.38 117.12,-180.38 117.12,-161.12 178.88,-161.12 178.88,-180.38"/>
-<text text-anchor="middle" x="148" y="-166.88" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M148,-149.37C148,-135.89 148,-118.89 148,-108.66"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="144.5,-149.36 148,-159.36 151.5,-149.36 144.5,-149.36"/>
-</a>
-</g>
-<text text-anchor="middle" x="169.38" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
+<text text-anchor="middle" x="155.53" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> bad_char</text>
+<text text-anchor="middle" x="155.53" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">good_suffix</text>
 </g>
 </g>
 </svg>
diff --git a/da/d77/spirograph_8cpp.html b/da/d77/spirograph_8cpp.html
index 30b246209..b00b8495a 100644
--- a/da/d77/spirograph_8cpp.html
+++ b/da/d77/spirograph_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graphics/spirograph.cpp File Reference</title>
+<title>TheAlgorithms/C++: graphics/spirograph.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -127,7 +144,9 @@ Include dependency graph for spirograph.cpp:</div>
 <div class="dyncontent">
 <div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d2/d4b/spirograph_8cpp__incl.svg" width="100%" height="383"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
 </div>
-</div><table class="memberdecls">
+</div>
+<p><a href="../../da/d77/spirograph_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/dd3/namespacespirograph.html">spirograph</a></td></tr>
@@ -140,8 +159,8 @@ Macros</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:aeca22dbe4563358960e907a40cd3e1ac" id="r_aeca22dbe4563358960e907a40cd3e1ac"><td class="memTemplParams" colspan="2">template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> N&gt; </td></tr>
-<tr class="memitem:aeca22dbe4563358960e907a40cd3e1ac"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac">spirograph::spirograph</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; double, double &gt;, N &gt; *points, double l, double k, double rot)</td></tr>
+<tr class="memitem:aeca22dbe4563358960e907a40cd3e1ac" id="r_aeca22dbe4563358960e907a40cd3e1ac"><td class="memTemplParams" colspan="2">template&lt;std::size_t N&gt; </td></tr>
+<tr class="memitem:aeca22dbe4563358960e907a40cd3e1ac"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac">spirograph::spirograph</a> (std::array&lt; std::pair&lt; double, double &gt;, N &gt; *points, double l, double k, double rot)</td></tr>
 <tr class="separator:aeca22dbe4563358960e907a40cd3e1ac"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a8e83a64e8443fff1e5ffdc1c299c1e99" id="r_a8e83a64e8443fff1e5ffdc1c299c1e99"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99">spirograph::test</a> ()</td></tr>
 <tr class="memdesc:a8e83a64e8443fff1e5ffdc1c299c1e99"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test function to save resulting points to a CSV file.  <br /></td></tr>
@@ -154,6 +173,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
 <p>Implementation of the program is based on the geometry shown in the figure below:</p>
 <p><a href="https://commons.wikimedia.org/wiki/File:Resonance_Cascade.svg"><img src="https://upload.wikimedia.org/wikipedia/commons/3/39/Resonance_Cascade.svg" alt="Spirograph geometry from Wikipedia" style="pointer-events: none; width: 250px" class="inline"/></a> </p>
+
+<p class="definition">Definition in file <a class="el" href="../../da/d77/spirograph_8cpp_source.html">spirograph.cpp</a>.</p>
 </div><h2 class="groupheader">Macro Definition Documentation</h2>
 <a id="a525335710b53cb064ca56b936120431e" name="a525335710b53cb064ca56b936120431e"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a525335710b53cb064ca56b936120431e">&#9670;&#160;</a></span>_USE_MATH_DEFINES</h2>
@@ -168,6 +189,8 @@ Functions</h2></td></tr>
 </div><div class="memdoc">
 <p>required for MSVC compiler </p>
 
+<p class="definition">Definition at line <a class="el" href="../../da/d77/spirograph_8cpp_source.html#l00023">23</a> of file <a class="el" href="../../da/d77/spirograph_8cpp_source.html">spirograph.cpp</a>.</p>
+
 </div>
 </div>
 <h2 class="groupheader">Function Documentation</h2>
@@ -190,6 +213,8 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d77/spirograph_8cpp_source.html#l00268">268</a> of file <a class="el" href="../../da/d77/spirograph_8cpp_source.html">spirograph.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  268</span>                                {</div>
 <div class="line"><span class="lineno">  269</span>    <a class="code hl_function" href="../../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99">spirograph::test</a>();</div>
 <div class="line"><span class="lineno">  270</span> </div>
@@ -207,13 +232,8 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  282</span> </div>
 <div class="line"><span class="lineno">  283</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  284</span>}</div>
-<div class="ttc" id="anamespacespirograph_html_a8e83a64e8443fff1e5ffdc1c299c1e99"><div class="ttname"><a href="../../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99">spirograph::test</a></div><div class="ttdeci">void test()</div><div class="ttdoc">Test function to save resulting points to a CSV file.</div><div class="ttdef"><b>Definition</b> spirograph.cpp:93</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg" width="419" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacespirograph_html_a8e83a64e8443fff1e5ffdc1c299c1e99"><div class="ttname"><a href="../../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99">spirograph::test</a></div><div class="ttdeci">void test()</div><div class="ttdoc">Test function to save resulting points to a CSV file.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d77/spirograph_8cpp_source.html#l00093">spirograph.cpp:93</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
deleted file mode 100644
index 15882bc9b..000000000
--- a/da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,80,55,106"/>
-<area shape="rect" id="Node000002" href="$da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99" title="Test function to save resulting points to a CSV file." alt="" coords="103,80,214,106"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,90,87,90,87,96,55,96"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="269,5,406,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="183,77,261,40,276,34,278,39,263,45,185,82"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="262,55,413,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="214,82,247,78,247,83,215,88"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setw.html#" title=" " alt="" coords="300,104,375,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="215,98,286,107,285,113,214,103"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_stringstream/str.html#" title=" " alt="" coords="266,153,409,179"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="186,104,263,140,278,145,276,150,261,145,184,109"/>
-</map>
diff --git a/da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
deleted file mode 100644
index 316f9a719..000000000
--- a/da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e4a41e74615008325e45e5d6d3f87018
\ No newline at end of file
diff --git a/da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
deleted file mode 100644
index 6ef3159b3..000000000
--- a/da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="314pt" height="138pt"
- viewBox="0.00 0.00 314.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99" target="_top" xlink:title="Test function to save resulting points to a CSV file.">
-<polygon fill="white" stroke="#666666" points="156.5,-74.25 73,-74.25 73,-55 156.5,-55 156.5,-74.25"/>
-<text text-anchor="middle" x="114.75" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">spirograph::test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-64.62C44.2,-64.62 52.6,-64.62 61.24,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.13,-68.13 71.13,-64.63 61.13,-61.13 61.13,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="300.75,-130.25 197.75,-130.25 197.75,-111 300.75,-111 300.75,-130.25"/>
-<text text-anchor="middle" x="249.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.01,-74.62C149.34,-82.78 171.98,-94.28 192.5,-102.62 196.1,-104.09 199.86,-105.51 203.66,-106.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.33,-110.12 212.92,-110.07 204.61,-103.51 202.33,-110.12"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306,-93.25 192.5,-93.25 192.5,-74 306,-74 306,-93.25"/>
-<text text-anchor="middle" x="249.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.95,-70.53C164.68,-71.64 172.94,-72.83 181.22,-74.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.58,-77.46 190.97,-75.41 181.57,-70.53 180.58,-77.46"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="277.5,-56.25 221,-56.25 221,-37 277.5,-37 277.5,-56.25"/>
-<text text-anchor="middle" x="249.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.95,-59.03C173.86,-56.73 193.33,-54.09 209.93,-51.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="209.96,-55.36 219.4,-50.54 209.02,-48.42 209.96,-55.36"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="302.62,-19.25 195.88,-19.25 195.88,0 302.62,0 302.62,-19.25"/>
-<text text-anchor="middle" x="249.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stringstream::str</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.66,-54.61C150,-46.71 172.31,-35.71 192.5,-27.62 196.1,-26.18 199.87,-24.77 203.67,-23.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="204.62,-26.79 212.95,-20.23 202.35,-20.17 204.62,-26.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
deleted file mode 100644
index 95ecaec7a..000000000
--- a/da/d77/spirograph_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="314pt" height="138pt"
- viewBox="0.00 0.00 314.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99" target="_top" xlink:title="Test function to save resulting points to a CSV file.">
-<polygon fill="white" stroke="#666666" points="156.5,-74.25 73,-74.25 73,-55 156.5,-55 156.5,-74.25"/>
-<text text-anchor="middle" x="114.75" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">spirograph::test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-64.62C44.2,-64.62 52.6,-64.62 61.24,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.13,-68.13 71.13,-64.63 61.13,-61.13 61.13,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="300.75,-130.25 197.75,-130.25 197.75,-111 300.75,-111 300.75,-130.25"/>
-<text text-anchor="middle" x="249.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.01,-74.62C149.34,-82.78 171.98,-94.28 192.5,-102.62 196.1,-104.09 199.86,-105.51 203.66,-106.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.33,-110.12 212.92,-110.07 204.61,-103.51 202.33,-110.12"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306,-93.25 192.5,-93.25 192.5,-74 306,-74 306,-93.25"/>
-<text text-anchor="middle" x="249.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.95,-70.53C164.68,-71.64 172.94,-72.83 181.22,-74.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.58,-77.46 190.97,-75.41 181.57,-70.53 180.58,-77.46"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="277.5,-56.25 221,-56.25 221,-37 277.5,-37 277.5,-56.25"/>
-<text text-anchor="middle" x="249.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.95,-59.03C173.86,-56.73 193.33,-54.09 209.93,-51.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="209.96,-55.36 219.4,-50.54 209.02,-48.42 209.96,-55.36"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="302.62,-19.25 195.88,-19.25 195.88,0 302.62,0 302.62,-19.25"/>
-<text text-anchor="middle" x="249.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stringstream::str</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.66,-54.61C150,-46.71 172.31,-35.71 192.5,-27.62 196.1,-26.18 199.87,-24.77 203.67,-23.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="204.62,-26.79 212.95,-20.23 202.35,-20.17 204.62,-26.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d77/spirograph_8cpp_source.html b/da/d77/spirograph_8cpp_source.html
new file mode 100644
index 000000000..5f69d50d7
--- /dev/null
+++ b/da/d77/spirograph_8cpp_source.html
@@ -0,0 +1,355 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graphics/spirograph.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/d77/spirograph_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">spirograph.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/d77/spirograph_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#ifdef USE_GLUT</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#ifdef __APPLE__</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;GLUT/glut.h&gt;</span>  <span class="comment">// include path on Macs is different</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;GL/glut.h&gt;</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#endif  </span><span class="comment">// __APPLE__</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"><a class="line" href="../../da/d77/spirograph_8cpp.html#a525335710b53cb064ca56b936120431e">   23</a></span><span class="preprocessor">#define _USE_MATH_DEFINES </span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;array&gt;</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;cstdlib&gt;</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;fstream&gt;</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;iomanip&gt;</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;sstream&gt;</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#include &lt;omp.h&gt;</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../da/dd3/namespacespirograph.html">spirograph</a> {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="keyword">template</span> &lt;std::<span class="keywordtype">size_t</span> N&gt;</div>
+<div class="foldopen" id="foldopen00070" data-start="{" data-end="}">
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"><a class="line" href="../../da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac">   70</a></span><span class="keywordtype">void</span> <a class="code hl_namespace" href="../../da/dd3/namespacespirograph.html">spirograph</a>(std::array&lt;std::pair&lt;double, double&gt;, N&gt; *points, <span class="keywordtype">double</span> l,</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>                <span class="keywordtype">double</span> k, <span class="keywordtype">double</span> rot) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keywordtype">double</span> dt = rot * 2.f * M_PI / N;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordtype">double</span> R = 1.f;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> k1 = 1.f - k;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    int32_t step = 0;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span><span class="preprocessor">#pragma omp for</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordflow">for</span> (step = 0; step &lt; N; step++) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <span class="keywordtype">double</span> t = dt * step;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <span class="keywordtype">double</span> first = R * (k1 * std::cos(t) + l * k * std::cos(k1 * t / k));</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordtype">double</span> second = R * (k1 * std::sin(t) - l * k * std::sin(k1 * t / k));</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        points[0][step].first = first;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        points[0][step].second = second;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    }</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>}</div>
+</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="foldopen" id="foldopen00093" data-start="{" data-end="}">
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"><a class="line" href="../../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99">   93</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99">test</a>() {</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> N = 500;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keywordtype">double</span> l = 0.3, k = 0.75, rot = 10.;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    std::stringstream fname;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    fname &lt;&lt; std::setw(3) &lt;&lt; <span class="stringliteral">&quot;spirograph_&quot;</span> &lt;&lt; l &lt;&lt; <span class="stringliteral">&quot;_&quot;</span> &lt;&lt; k &lt;&lt; <span class="stringliteral">&quot;_&quot;</span> &lt;&lt; rot</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>          &lt;&lt; <span class="stringliteral">&quot;.csv&quot;</span>;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    std::ofstream fp(fname.str());</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="keywordflow">if</span> (!fp.is_open()) {</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        perror(fname.str().c_str());</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        exit(EXIT_FAILURE);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    }</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    std::array&lt;std::pair&lt;double, double&gt;, N&gt; points;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <a class="code hl_namespace" href="../../da/dd3/namespacespirograph.html">spirograph</a>(&amp;points, l, k, rot);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; N; i++) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        fp &lt;&lt; points[i].first &lt;&lt; <span class="stringliteral">&quot;,&quot;</span> &lt;&lt; points[i].first;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        <span class="keywordflow">if</span> (i &lt; N - 1) {</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>            fp &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        }</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    }</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    fp.close();</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>}</div>
+</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span><span class="preprocessor">#ifdef USE_GLUT</span></div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span><span class="keyword">static</span> <span class="keywordtype">bool</span> paused = 0; </div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span><span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> animation_speed = 25; </div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span><span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">double</span> step = 0.01;   </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span><span class="keyword">static</span> <span class="keywordtype">double</span> l_ratio = step * 10; </div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span><span class="keyword">static</span> <span class="keywordtype">double</span> k_ratio = step;      </div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span><span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">double</span> num_rot = 20.; </div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span><span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> glutBitmapString(<span class="keywordtype">void</span> *font, <span class="keywordtype">char</span> *message) {</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <span class="keywordflow">for</span> (<span class="keywordtype">char</span> *ch = message; *ch != <span class="charliteral">&#39;\0&#39;</span>; ch++) glutBitmapCharacter(font, *ch);</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>}</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span> </div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> N&gt;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span><span class="keywordtype">void</span> display_graph(<span class="keyword">const</span> std::array&lt;std::pair&lt;double, double&gt;, N&gt; &amp;points,</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>                   <span class="keywordtype">double</span> l, <span class="keywordtype">double</span> k) {</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    glClearColor(1.0f, 1.0f, 1.0f,</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>                 0.0f);            <span class="comment">// Set background color to white and opaque</span></div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    glClear(GL_COLOR_BUFFER_BIT);  <span class="comment">// Clear the color buffer (background)</span></div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    glBegin(GL_LINES);         <span class="comment">// draw line segments</span></div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    glColor3f(0.f, 0.f, 1.f);  <span class="comment">// blue</span></div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    glPointSize(2.f);          <span class="comment">// point size in pixels</span></div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span> </div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 1; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>        glVertex2f(points[i - 1].first, points[i - 1].second);  <span class="comment">// line from</span></div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>        glVertex2f(points[i].first, points[i].second);          <span class="comment">// line to</span></div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    }</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    glEnd();</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span> </div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    glColor3f(0.f, 0.f, 0.f);</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    std::stringstream buffer;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    buffer &lt;&lt; std::setw(3) &lt;&lt; <span class="stringliteral">&quot;l = &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    glRasterPos2f(-.85, .85);</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    glutBitmapString(GLUT_BITMAP_TIMES_ROMAN_24,</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>                     <span class="keyword">const_cast&lt;</span><span class="keywordtype">char</span> *<span class="keyword">&gt;</span>(buffer.str().c_str()));</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    buffer.str(<span class="stringliteral">&quot;&quot;</span>);</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    buffer.clear();</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    buffer &lt;&lt; std::setw(3) &lt;&lt; <span class="stringliteral">&quot;k = &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    glRasterPos2f(-.85, .70);</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    glutBitmapString(GLUT_BITMAP_TIMES_ROMAN_24,</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>                     <span class="keyword">const_cast&lt;</span><span class="keywordtype">char</span> *<span class="keyword">&gt;</span>(buffer.str().c_str()));</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span> </div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    glutSwapBuffers();</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>}</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>() {</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 5000;  <span class="comment">// number of samples</span></div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span> </div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    <span class="keyword">static</span> <span class="keywordtype">bool</span> direction1 = <span class="keyword">true</span>;  <span class="comment">// increment if true, otherwise decrement</span></div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    <span class="keyword">static</span> <span class="keywordtype">bool</span> direction2 = <span class="keyword">true</span>;  <span class="comment">// increment if true, otherwise decrement</span></div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span> </div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    std::array&lt;std::pair&lt;double, double&gt;, <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>&gt; points;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span> </div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    <a class="code hl_namespace" href="../../da/dd3/namespacespirograph.html">spirograph</a>(&amp;points, l_ratio, k_ratio, num_rot);</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    display_graph(points, l_ratio, k_ratio);</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span> </div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    <span class="keywordflow">if</span> (paused)</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        <span class="comment">// if paused, do not update l_ratio and k_ratio</span></div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span> </div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    <span class="keywordflow">if</span> (direction1) {                 <span class="comment">// increment k_ratio</span></div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>        <span class="keywordflow">if</span> (k_ratio &gt;= (1.f - step))  <span class="comment">// maximum limit</span></div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>            direction1 = <span class="keyword">false</span>;       <span class="comment">// reverse direction of k_ratio</span></div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>            k_ratio += step;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    } <span class="keywordflow">else</span> {                    <span class="comment">// decrement k_ratio</span></div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>        <span class="keywordflow">if</span> (k_ratio &lt;= step) {  <span class="comment">// minimum limit</span></div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>            direction1 = <span class="keyword">true</span>;  <span class="comment">// reverse direction of k_ratio</span></div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span> </div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>            <span class="keywordflow">if</span> (direction2) {                 <span class="comment">// increment l_ratio</span></div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>                <span class="keywordflow">if</span> (l_ratio &gt;= (1.f - step))  <span class="comment">// max limit of l_ratio</span></div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>                    direction2 = <span class="keyword">false</span>;       <span class="comment">// reverse direction of l_ratio</span></div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>                <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>                    l_ratio += step;</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>            } <span class="keywordflow">else</span> {                    <span class="comment">// decrement l_ratio</span></div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>                <span class="keywordflow">if</span> (l_ratio &lt;= step)    <span class="comment">// minimum limit of l_ratio</span></div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>                    direction2 = <span class="keyword">true</span>;  <span class="comment">// reverse direction of l_ratio</span></div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>                <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>                    l_ratio -= step;</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>            }</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>        } <span class="keywordflow">else</span> {  <span class="comment">// no min limit of k_ratio</span></div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>            k_ratio -= step;</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>        }</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    }</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>}</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span> </div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span><span class="keywordtype">void</span> timer_cb(<span class="keywordtype">int</span> t) {</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    glutTimerFunc(animation_speed, timer_cb, 0);</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    glutPostRedisplay();</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>}</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span> </div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span><span class="keywordtype">void</span> keyboard_cb(<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> key, <span class="keywordtype">int</span> x, <span class="keywordtype">int</span> y) {</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    <span class="keywordflow">switch</span> (key) {</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39; &#39;</span>:              <span class="comment">// spacebar toggles pause</span></div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>            paused = !paused;  <span class="comment">// toggle</span></div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>        <span class="keywordflow">case</span> GLUT_KEY_UP:</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;+&#39;</span>:  <span class="comment">// up arrow key</span></div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>            k_ratio += step;</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>        <span class="keywordflow">case</span> GLUT_KEY_DOWN:</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;_&#39;</span>:  <span class="comment">// down arrow key</span></div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>            k_ratio -= step;</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>        <span class="keywordflow">case</span> GLUT_KEY_RIGHT:</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;=&#39;</span>:  <span class="comment">// left arrow key</span></div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>            l_ratio += step;</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>        <span class="keywordflow">case</span> GLUT_KEY_LEFT:</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>        <span class="keywordflow">case</span> <span class="charliteral">&#39;-&#39;</span>:  <span class="comment">// right arrow key</span></div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>            l_ratio -= step;</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>        <span class="keywordflow">case</span> 0x1B:  <span class="comment">// escape key exits</span></div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>            exit(EXIT_SUCCESS);</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>        <span class="keywordflow">default</span>:</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    }</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>}</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>}  <span class="comment">// namespace spirograph</span></div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span> </div>
+<div class="foldopen" id="foldopen00268" data-start="{" data-end="}">
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"><a class="line" href="../../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">  268</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> **argv) {</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>    <a class="code hl_function" href="../../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99">spirograph::test</a>();</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span> </div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span><span class="preprocessor">#ifdef USE_GLUT</span></div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    glutInit(&amp;argc, argv);</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>    glutInitDisplayMode(GLUT_RGB | GLUT_DOUBLE);</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>    glutCreateWindow(<span class="stringliteral">&quot;Spirograph&quot;</span>);</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    glutInitWindowSize(400, 400);</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>    <span class="comment">// glutIdleFunc(glutPostRedisplay);</span></div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>    glutTimerFunc(spirograph::animation_speed, spirograph::timer_cb, 0);</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>    glutKeyboardFunc(spirograph::keyboard_cb);</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>    glutDisplayFunc(spirograph::test2);</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>    glutMainLoop();</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span> </div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>}</div>
+</div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00119">composite_simpson_rule.cpp:119</a></div></div>
+<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00187">dsu_path_compression.cpp:187</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacespirograph_html"><div class="ttname"><a href="../../da/dd3/namespacespirograph.html">spirograph</a></div></div>
+<div class="ttc" id="anamespacespirograph_html_a8e83a64e8443fff1e5ffdc1c299c1e99"><div class="ttname"><a href="../../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99">spirograph::test</a></div><div class="ttdeci">void test()</div><div class="ttdoc">Test function to save resulting points to a CSV file.</div><div class="ttdef"><b>Definition</b> <a href="#l00093">spirograph.cpp:93</a></div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_e79632891301b850df87e9c0030293fa.html">graphics</a></li><li class="navelem"><a class="el" href="../../da/d77/spirograph_8cpp.html">spirograph.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/d7b/primality__test_8cpp.html b/da/d7b/primality__test_8cpp.html
index daba8d91e..6ebe62d32 100644
--- a/da/d7b/primality__test_8cpp.html
+++ b/da/d7b/primality__test_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/primality_test.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/primality_test.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,7 +135,9 @@ Include dependency graph for primality_test.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d7d/primality__test_8cpp__incl.svg" width="175" height="111"><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">
+</div>
+<p><a href="../../da/d7b/primality__test_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a2bfa6adead2bdcbf1dac94cbe08d7eaf" id="r_a2bfa6adead2bdcbf1dac94cbe08d7eaf"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2bfa6adead2bdcbf1dac94cbe08d7eaf">IsPrime</a> (int number)</td></tr>
@@ -131,6 +150,8 @@ Functions</h2></td></tr>
 <p>A simple and efficient implementation of a function to test if a number is prime, based on the fact that </p><blockquote class="doxtable">
 <p>&zwj;Every Prime number, except 2 and 3, are of the form \(6k\pm1\) for integer values of k. This gives a 3x speed improvement. </p>
 </blockquote>
+
+<p class="definition">Definition in file <a class="el" href="../../da/d7b/primality__test_8cpp_source.html">primality_test.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a2bfa6adead2bdcbf1dac94cbe08d7eaf" name="a2bfa6adead2bdcbf1dac94cbe08d7eaf"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a2bfa6adead2bdcbf1dac94cbe08d7eaf">&#9670;&#160;</a></span>IsPrime()</h2>
@@ -153,6 +174,8 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if prime else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d7b/primality__test_8cpp_source.html#l00018">18</a> of file <a class="el" href="../../da/d7b/primality__test_8cpp_source.html">primality_test.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   18</span>                         {</div>
 <div class="line"><span class="lineno">   19</span>    <span class="keywordflow">if</span> (((!(number &amp; 1)) &amp;&amp; number != 2) || (number &lt; 2) ||</div>
 <div class="line"><span class="lineno">   20</span>        (number % 3 == 0 &amp;&amp; number != 3))</div>
@@ -164,7 +187,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   26</span>    }</div>
 <div class="line"><span class="lineno">   27</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   28</span>}</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -183,28 +206,22 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d7b/primality__test_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../da/d7b/primality__test_8cpp_source.html">primality_test.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   31</span>           {</div>
 <div class="line"><span class="lineno">   32</span>    <span class="comment">// Main Function</span></div>
-<div class="line"><span class="lineno">   33</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the value of n to check if Prime\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   33</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the value of n to check if Prime\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   34</span>    <span class="keywordtype">int</span> n;</div>
-<div class="line"><span class="lineno">   35</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;</div>
+<div class="line"><span class="lineno">   35</span>    std::cin &gt;&gt; n;</div>
 <div class="line"><span class="lineno">   36</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="#a2bfa6adead2bdcbf1dac94cbe08d7eaf">IsPrime</a>(n))</div>
-<div class="line"><span class="lineno">   37</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is Prime&quot;</span> &lt;&lt; <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">   37</span>        std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is Prime&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   38</span>    <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">   39</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is not Prime&quot;</span> &lt;&lt; <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">   39</span>        std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is not Prime&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   40</span> </div>
 <div class="line"><span class="lineno">   41</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   42</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="aprimality__test_8cpp_html_a2bfa6adead2bdcbf1dac94cbe08d7eaf"><div class="ttname"><a href="#a2bfa6adead2bdcbf1dac94cbe08d7eaf">IsPrime</a></div><div class="ttdeci">bool IsPrime(int number)</div><div class="ttdef"><b>Definition</b> primality_test.cpp:18</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="180" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aprimality__test_8cpp_html_a2bfa6adead2bdcbf1dac94cbe08d7eaf"><div class="ttname"><a href="#a2bfa6adead2bdcbf1dac94cbe08d7eaf">IsPrime</a></div><div class="ttdeci">bool IsPrime(int number)</div><div class="ttdef"><b>Definition</b> <a href="../../da/d7b/primality__test_8cpp_source.html#l00018">primality_test.cpp:18</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index d6bc66dc5..000000000
--- a/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,35,87,27,88,33,56,40"/>
-<area shape="rect" id="Node000003" href="$da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf" title=" " alt="" coords="105,55,172,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,46,91,54,89,59,55,52"/>
-</map>
diff --git a/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index ded039669..000000000
--- a/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b459915509cfdc75e7cc6514758d9634
\ No newline at end of file
diff --git a/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 0d81a81b5..000000000
--- a/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="64pt"
- viewBox="0.00 0.00 134.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-56.25 73,-56.25 73,-37 126.5,-37 126.5,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.64,-33.65 53.16,-35.69 61.53,-37.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.71,-41.1 71.25,-40.03 62.34,-34.3 60.71,-41.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="124.62,-19.25 74.88,-19.25 74.88,0 124.62,0 124.62,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">IsPrime</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C45.19,-21.79 54.47,-19.68 63.45,-17.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.08,-21.09 73.05,-15.46 62.53,-14.26 64.08,-21.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 0652bc5bc..000000000
--- a/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="64pt"
- viewBox="0.00 0.00 134.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-56.25 73,-56.25 73,-37 126.5,-37 126.5,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.64,-33.65 53.16,-35.69 61.53,-37.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.71,-41.1 71.25,-40.03 62.34,-34.3 60.71,-41.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="124.62,-19.25 74.88,-19.25 74.88,0 124.62,0 124.62,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">IsPrime</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C45.19,-21.79 54.47,-19.68 63.45,-17.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.08,-21.09 73.05,-15.46 62.53,-14.26 64.08,-21.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d7b/primality__test_8cpp_source.html b/da/d7b/primality__test_8cpp_source.html
new file mode 100644
index 000000000..f8ce43899
--- /dev/null
+++ b/da/d7b/primality__test_8cpp_source.html
@@ -0,0 +1,170 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/primality_test.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/d7b/primality__test_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">primality_test.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/d7b/primality__test_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="foldopen" id="foldopen00018" data-start="{" data-end="}">
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"><a class="line" href="../../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">   18</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">IsPrime</a>(<span class="keywordtype">int</span> number) {</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    <span class="keywordflow">if</span> (((!(number &amp; 1)) &amp;&amp; number != 2) || (number &lt; 2) ||</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        (number % 3 == 0 &amp;&amp; number != 3))</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 1; 36 * k * k - 12 * k &lt; number; ++k) {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        <span class="keywordflow">if</span> ((number % (6 * k + 1) == 0) || (number % (6 * k - 1) == 0))</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    }</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>}</div>
+</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="foldopen" id="foldopen00031" data-start="{" data-end="}">
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="../../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   31</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="comment">// Main Function</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the value of n to check if Prime\n&quot;</span>;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordtype">int</span> n;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="../../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">IsPrime</a>(n))</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is Prime&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is not Prime&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>}</div>
+</div>
+<div class="ttc" id="aprimality__test_8cpp_html_a2bfa6adead2bdcbf1dac94cbe08d7eaf"><div class="ttname"><a href="../../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">IsPrime</a></div><div class="ttdeci">bool IsPrime(int number)</div><div class="ttdef"><b>Definition</b> <a href="#l00018">primality_test.cpp:18</a></div></div>
+<div class="ttc" id="aprimality__test_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00031">primality_test.cpp:31</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../da/d7b/primality__test_8cpp.html">primality_test.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/d82/namespacecycle__detection.html b/da/d82/namespacecycle__detection.html
index 8418e7d2d..9a9bbb9d3 100644
--- a/da/d82/namespacecycle__detection.html
+++ b/da/d82/namespacecycle__detection.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: cycle_detection Namespace Reference</title>
+<title>TheAlgorithms/C++: cycle_detection Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/da/d83/kosaraju_8cpp_source.html b/da/d83/kosaraju_8cpp_source.html
new file mode 100644
index 000000000..2f223b6b1
--- /dev/null
+++ b/da/d83/kosaraju_8cpp_source.html
@@ -0,0 +1,238 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/kosaraju.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/d83/kosaraju_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">kosaraju.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/* Implementation of Kosaraju&#39;s Algorithm to find out the strongly connected</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment">   components (SCCs) in a graph. Author:Anirban166</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment">*/</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;stack&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="keywordtype">void</span> print(<span class="keyword">const</span> std::vector&lt;std::vector&lt;int&gt; &gt; &amp;a, <span class="keywordtype">int</span> V) {</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>        <span class="keywordflow">if</span> (!a[i].empty()) {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;i=&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;--&gt;&quot;</span>;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        }</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j : a[i]) {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>            std::cout &lt;&lt; j &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        }</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        <span class="keywordflow">if</span> (!a[i].empty()) {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>            std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        }</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    }</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>}</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="keywordtype">void</span> push_vertex(<span class="keywordtype">int</span> v, std::stack&lt;int&gt; *st, std::vector&lt;bool&gt; *vis,</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>                 <span class="keyword">const</span> std::vector&lt;std::vector&lt;int&gt; &gt; &amp;adj) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    (*vis)[v] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = adj[v].begin(); i != adj[v].end(); i++) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        <span class="keywordflow">if</span> ((*vis)[*i] == <span class="keyword">false</span>) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>            push_vertex(*i, st, vis, adj);</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    }</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    st-&gt;push(v);</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>}</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9">dfs</a>(<span class="keywordtype">int</span> v, std::vector&lt;bool&gt; *vis,</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>         <span class="keyword">const</span> std::vector&lt;std::vector&lt;int&gt; &gt; &amp;grev) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    (*vis)[v] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="comment">// cout&lt;&lt;v&lt;&lt;&quot; &quot;;</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = grev[v].begin(); i != grev[v].end(); i++) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        <span class="keywordflow">if</span> ((*vis)[*i] == <span class="keyword">false</span>) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            <a class="code hl_function" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9">dfs</a>(*i, vis, grev);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        }</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>}</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="comment">// function/method to implement Kosaraju&#39;s Algorithm:</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="keywordtype">int</span> kosaraju(<span class="keywordtype">int</span> V, <span class="keyword">const</span> std::vector&lt;std::vector&lt;int&gt; &gt; &amp;adj) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    std::vector&lt;bool&gt; vis(V, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    std::stack&lt;int&gt; st;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> v = 0; v &lt; V; v++) {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="keywordflow">if</span> (vis[v] == <span class="keyword">false</span>) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>            push_vertex(v, &amp;st, &amp;vis, adj);</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        }</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    }</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="comment">// making new graph (grev) with reverse edges as in adj[]:</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::vector&lt;std::vector&lt;int&gt; &gt; grev(V);</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V + 1; i++) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> j = adj[i].begin(); j != adj[i].end(); j++) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>            grev[*j].push_back(i);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="comment">// cout&lt;&lt;&quot;grev=&quot;&lt;&lt;endl; -&gt;debug statement</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="comment">// print(grev,V);       -&gt;debug statement</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="comment">// reinitialise visited to 0</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) vis[i] = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keywordtype">int</span> count_scc = 0;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="keywordflow">while</span> (!st.empty()) {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        <span class="keywordtype">int</span> t = st.top();</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        st.pop();</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        <span class="keywordflow">if</span> (vis[t] == <span class="keyword">false</span>) {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>            <a class="code hl_function" href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9">dfs</a>(t, &amp;vis, grev);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>            count_scc++;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        }</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    }</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="comment">// cout&lt;&lt;&quot;count_scc=&quot;&lt;&lt;count_scc&lt;&lt;endl; //in case you want to print here</span></div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="comment">// itself, uncomment &amp; change return type of function to void.</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="keywordflow">return</span> count_scc;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>}</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span><span class="comment">// All critical/corner cases have been taken care of.</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span><span class="comment">// Input your required values: (not hardcoded)</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="keywordtype">int</span> t = 0;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    std::cin &gt;&gt; t;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="keywordflow">while</span> (t--) {</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        <span class="keywordtype">int</span> a = 0, b = 0;  <span class="comment">// a-&gt;number of nodes, b-&gt;directed edges.</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        std::cin &gt;&gt; a &gt;&gt; b;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        <span class="keywordtype">int</span> m = 0, n = 0;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        std::vector&lt;std::vector&lt;int&gt; &gt; adj(a + 1);</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; b; i++)  <span class="comment">// take total b inputs of 2 vertices each</span></div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>                                     <span class="comment">// required to form an edge.</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>            std::cin &gt;&gt; m &gt;&gt; n;  <span class="comment">// take input m,n denoting edge from m-&gt;n.</span></div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>            adj[m].push_back(n);</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        }</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        <span class="comment">// pass number of nodes and adjacency array as parameters to function:</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        std::cout &lt;&lt; kosaraju(a, adj) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    }</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>}</div>
+<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a5738da9f508f6a9e87f123c9fb6f2ea9"><div class="ttname"><a href="../../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9">graph::depth_first_search::dfs</a></div><div class="ttdeci">std::vector&lt; size_t &gt; dfs(const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;graph, size_t start)</div><div class="ttdoc">Explores the given vertex, exploring a vertex means traversing over all the vertices which are connec...</div><div class="ttdef"><b>Definition</b> <a href="../../da/d4b/depth__first__search__with__stack_8cpp_source.html#l00087">depth_first_search_with_stack.cpp:87</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><b>kosaraju.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.map b/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.map
index ebc53d664..e038a3919 100644
--- a/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.map
+++ b/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.map
@@ -1,12 +1,10 @@
 <map id="data_structures::tree_234::Tree234" name="data_structures::tree_234::Tree234">
-<area shape="rect" id="Node000001" title="2&#45;3&#45;4 tree class" alt="" coords="5,286,147,327"/>
-<area shape="rect" id="Node000002" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html" title="2&#45;3&#45;4 tree node class" alt="" coords="101,183,243,223"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="141,236,128,249,94,288,90,284,124,246,137,232"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array.html" title=" " alt="" coords="171,286,349,327"/>
-<area shape="poly" id="edge5_Node000005_Node000002" title=" " alt="" coords="166,238,166,250,171,261,182,274,196,284,193,288,178,278,166,264,161,251,160,238"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array.html" title=" " alt="" coords="95,94,249,120"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="175,135,175,182,169,182,169,135"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="129,5,215,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="175,47,175,94,169,94,169,47"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="244,273,229,249,202,226,206,222,233,246,249,270"/>
+<area shape="rect" id="Node000001" title="2&#45;3&#45;4 tree class" alt="" coords="5,198,147,238"/>
+<area shape="rect" id="Node000002" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html" title="2&#45;3&#45;4 tree node class" alt="" coords="101,94,243,135"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="141,147,128,160,94,199,90,196,124,157,137,144"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="171,198,349,238"/>
+<area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="166,149,166,161,171,172,182,185,196,195,193,199,178,189,166,175,161,163,160,150"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="95,5,249,31"/>
+<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="175,46,175,93,169,93,169,46"/>
+<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="244,185,229,160,202,137,206,133,233,157,249,182"/>
 </map>
diff --git a/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.md5 b/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.md5
index adee3327d..311c24f06 100644
--- a/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.md5
+++ b/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.md5
@@ -1 +1 @@
-6aa4e88ecd3e95cdd753db2a6dffe59c
\ No newline at end of file
+294e39635514ac7ee87ad9b79e3c803e
\ No newline at end of file
diff --git a/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.svg b/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.svg
index 0afcf7892..6d58a848a 100644
--- a/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.svg
+++ b/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph.svg
@@ -4,8 +4,8 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: data_structures::tree_234::Tree234 Pages: 1 -->
-<svg width="266pt" height="249pt"
- viewBox="0.00 0.00 265.88 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="266pt" height="183pt"
+ viewBox="0.00 0.00 265.88 182.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
 <svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
@@ -17,7 +17,7 @@
 ]]></style>
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
 <svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 178.75)">
 <title>data_structures::tree_234::Tree234</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -49,20 +49,20 @@
 </g>
 <text text-anchor="middle" x="102.62" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> root_</text>
 </g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<!-- Node4 -->
+<g id="Node000004" class="node">
+<title>Node4</title>
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="257.88,-30.5 124.12,-30.5 124.12,0 257.88,0 257.88,-30.5"/>
 <text text-anchor="start" x="132.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; data_structures</text>
 <text text-anchor="middle" x="191" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::tree_234::Node *, 4 &gt;</text>
 </a>
 </g>
 </g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000002" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000002"><a xlink:title=" ">
+<!-- Node2&#45;&gt;Node4 -->
+<g id="edge4_Node000004_Node000002" class="edge">
+<title>Node2&#45;&gt;Node4</title>
+<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
 <path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M118.32,-66.69C117.97,-60.35 118.85,-53.85 122.25,-48.5 126.99,-41.04 133.95,-35.28 141.66,-30.84"/>
 <polygon fill="#9a32cd" stroke="#9a32cd" points="114.79,-66.77 119.78,-76.11 121.71,-65.7 114.79,-66.77"/>
 </a>
@@ -72,7 +72,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="182.88,-174.75 67.12,-174.75 67.12,-155.5 182.88,-155.5 182.88,-174.75"/>
 <text text-anchor="middle" x="125" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; int64_t, 3 &gt;</text>
 </a>
@@ -88,29 +88,10 @@
 </g>
 <text text-anchor="middle" x="138.5" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> items</text>
 </g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="157.38,-241.25 92.62,-241.25 92.62,-222 157.38,-222 157.38,-241.25"/>
-<text text-anchor="middle" x="125" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::int64_t</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M125,-210.15C125,-198.32 125,-184.04 125,-175.02"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="121.5,-210.14 125,-220.14 128.5,-210.14 121.5,-210.14"/>
-</a>
-</g>
-<text text-anchor="middle" x="146.38" y="-194.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
+<!-- Node4&#45;&gt;Node2 -->
+<g id="edge3_Node000002_Node000004" class="edge">
+<title>Node4&#45;&gt;Node2</title>
+<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
 <path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M180.84,-41.3C177.6,-47.69 173.63,-54.29 169,-59.75 163.36,-66.4 156.1,-72.43 149.1,-77.43"/>
 <polygon fill="#9a32cd" stroke="#9a32cd" points="183.96,-42.9 184.97,-32.36 177.6,-39.97 183.96,-42.9"/>
 </a>
diff --git a/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph_org.svg b/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph_org.svg
index 7694d1e0d..ccf4753ee 100644
--- a/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph_org.svg
+++ b/da/d85/classdata__structures_1_1tree__234_1_1_tree234__coll__graph_org.svg
@@ -4,9 +4,9 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: data_structures::tree_234::Tree234 Pages: 1 -->
-<svg width="266pt" height="249pt"
- viewBox="0.00 0.00 265.88 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
+<svg width="266pt" height="183pt"
+ viewBox="0.00 0.00 265.88 182.75" 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 178.75)">
 <title>data_structures::tree_234::Tree234</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -38,20 +38,20 @@
 </g>
 <text text-anchor="middle" x="102.62" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> root_</text>
 </g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<!-- Node4 -->
+<g id="Node000004" class="node">
+<title>Node4</title>
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="257.88,-30.5 124.12,-30.5 124.12,0 257.88,0 257.88,-30.5"/>
 <text text-anchor="start" x="132.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; data_structures</text>
 <text text-anchor="middle" x="191" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::tree_234::Node *, 4 &gt;</text>
 </a>
 </g>
 </g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000002" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000002"><a xlink:title=" ">
+<!-- Node2&#45;&gt;Node4 -->
+<g id="edge4_Node000004_Node000002" class="edge">
+<title>Node2&#45;&gt;Node4</title>
+<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
 <path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M118.32,-66.69C117.97,-60.35 118.85,-53.85 122.25,-48.5 126.99,-41.04 133.95,-35.28 141.66,-30.84"/>
 <polygon fill="#9a32cd" stroke="#9a32cd" points="114.79,-66.77 119.78,-76.11 121.71,-65.7 114.79,-66.77"/>
 </a>
@@ -61,7 +61,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="182.88,-174.75 67.12,-174.75 67.12,-155.5 182.88,-155.5 182.88,-174.75"/>
 <text text-anchor="middle" x="125" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; int64_t, 3 &gt;</text>
 </a>
@@ -77,29 +77,10 @@
 </g>
 <text text-anchor="middle" x="138.5" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> items</text>
 </g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="157.38,-241.25 92.62,-241.25 92.62,-222 157.38,-222 157.38,-241.25"/>
-<text text-anchor="middle" x="125" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::int64_t</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M125,-210.15C125,-198.32 125,-184.04 125,-175.02"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="121.5,-210.14 125,-220.14 128.5,-210.14 121.5,-210.14"/>
-</a>
-</g>
-<text text-anchor="middle" x="146.38" y="-194.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
+<!-- Node4&#45;&gt;Node2 -->
+<g id="edge3_Node000002_Node000004" class="edge">
+<title>Node4&#45;&gt;Node2</title>
+<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
 <path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M180.84,-41.3C177.6,-47.69 173.63,-54.29 169,-59.75 163.36,-66.4 156.1,-72.43 149.1,-77.43"/>
 <polygon fill="#9a32cd" stroke="#9a32cd" points="183.96,-42.9 184.97,-32.36 177.6,-39.97 183.96,-42.9"/>
 </a>
diff --git a/da/d86/struct_test_case.html b/da/d86/struct_test_case.html
index 64b81736c..6256bb5ce 100644
--- a/da/d86/struct_test_case.html
+++ b/da/d86/struct_test_case.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: TestCase Struct Reference</title>
+<title>TheAlgorithms/C++: TestCase Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -117,28 +134,27 @@ $(function(){initNavTree('da/d86/struct_test_case.html','../../'); initResizable
 <div class="dynheader">
 Collaboration diagram for TestCase:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d57/struct_test_case__coll__graph.svg" width="282" height="231"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d57/struct_test_case__coll__graph.svg" width="136" height="231"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:ad044f5ab2a58785ace621cac7544eeb0" id="r_ad044f5ab2a58785ace621cac7544eeb0"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad044f5ab2a58785ace621cac7544eeb0">TestCase</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> string_a, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> string_b, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> in_common_string_len)</td></tr>
+<tr class="memitem:ad044f5ab2a58785ace621cac7544eeb0" id="r_ad044f5ab2a58785ace621cac7544eeb0"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad044f5ab2a58785ace621cac7544eeb0">TestCase</a> (std::string string_a, std::string string_b, const std::size_t in_common_string_len)</td></tr>
 <tr class="separator:ad044f5ab2a58785ace621cac7544eeb0"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:ad8acf635a7ad1c56949657128110d666" id="r_ad8acf635a7ad1c56949657128110d666"><td class="memItemLeft" align="right" valign="top"><a id="ad8acf635a7ad1c56949657128110d666" name="ad8acf635a7ad1c56949657128110d666"></a>
-const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><b>string_a</b></td></tr>
+<tr class="memitem:ad8acf635a7ad1c56949657128110d666" id="r_ad8acf635a7ad1c56949657128110d666"><td class="memItemLeft" align="right" valign="top">const std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad8acf635a7ad1c56949657128110d666">string_a</a></td></tr>
 <tr class="separator:ad8acf635a7ad1c56949657128110d666"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ada0ced4634fc8828fc623ba7067bb7a6" id="r_ada0ced4634fc8828fc623ba7067bb7a6"><td class="memItemLeft" align="right" valign="top"><a id="ada0ced4634fc8828fc623ba7067bb7a6" name="ada0ced4634fc8828fc623ba7067bb7a6"></a>
-const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><b>string_b</b></td></tr>
+<tr class="memitem:ada0ced4634fc8828fc623ba7067bb7a6" id="r_ada0ced4634fc8828fc623ba7067bb7a6"><td class="memItemLeft" align="right" valign="top">const std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ada0ced4634fc8828fc623ba7067bb7a6">string_b</a></td></tr>
 <tr class="separator:ada0ced4634fc8828fc623ba7067bb7a6"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aaf21352a77ef2b7379d98d6803588913" id="r_aaf21352a77ef2b7379d98d6803588913"><td class="memItemLeft" align="right" valign="top"><a id="aaf21352a77ef2b7379d98d6803588913" name="aaf21352a77ef2b7379d98d6803588913"></a>
-const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><b>common_string_len</b></td></tr>
+<tr class="memitem:aaf21352a77ef2b7379d98d6803588913" id="r_aaf21352a77ef2b7379d98d6803588913"><td class="memItemLeft" align="right" valign="top">const std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aaf21352a77ef2b7379d98d6803588913">common_string_len</a></td></tr>
 <tr class="separator:aaf21352a77ef2b7379d98d6803588913"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>represents single example inputs and expected output of the function <a class="el" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html#l00054">54</a> of file <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html">longest_common_string.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="ad044f5ab2a58785ace621cac7544eeb0" name="ad044f5ab2a58785ace621cac7544eeb0"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ad044f5ab2a58785ace621cac7544eeb0">&#9670;&#160;</a></span>TestCase()</h2>
@@ -152,17 +168,17 @@ const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/ty
         <tr>
           <td class="memname">TestCase::TestCase </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>string_a</em></span>, </td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>string_a</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>string_b</em></span>, </td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>string_b</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></td>          <td class="paramname"><span class="paramname"><em>in_common_string_len</em></span>&#160;)</td>
+          <td class="paramtype">const std::size_t</td>          <td class="paramname"><span class="paramname"><em>in_common_string_len</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -171,15 +187,65 @@ const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/ty
   </tr>
 </table>
 </div><div class="memdoc">
-<div class="fragment"><div class="line"><span class="lineno">   61</span>        : string_a(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(string_a)),</div>
-<div class="line"><span class="lineno">   62</span>          string_b(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(string_b)),</div>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html">longest_common_string.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   61</span>        : string_a(std::move(string_a)),</div>
+<div class="line"><span class="lineno">   62</span>          string_b(std::move(string_b)),</div>
 <div class="line"><span class="lineno">   63</span>          common_string_len(in_common_string_len) {}</div>
-<div class="ttc" id="amove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></div><div class="ttdeci">T move(T... args)</div></div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="aaf21352a77ef2b7379d98d6803588913" name="aaf21352a77ef2b7379d98d6803588913"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aaf21352a77ef2b7379d98d6803588913">&#9670;&#160;</a></span>common_string_len</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">const std::size_t TestCase::common_string_len</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html">longest_common_string.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ad8acf635a7ad1c56949657128110d666" name="ad8acf635a7ad1c56949657128110d666"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ad8acf635a7ad1c56949657128110d666">&#9670;&#160;</a></span>string_a</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">const std::string TestCase::string_a</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html">longest_common_string.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ada0ced4634fc8828fc623ba7067bb7a6" name="ada0ced4634fc8828fc623ba7067bb7a6"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ada0ced4634fc8828fc623ba7067bb7a6">&#9670;&#160;</a></span>string_b</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">const std::string TestCase::string_b</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html#l00056">56</a> of file <a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html">longest_common_string.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>dynamic_programming/<a class="el" href="../../da/d0d/longest__common__string_8cpp.html">longest_common_string.cpp</a></li>
+<li>dynamic_programming/<a class="el" href="../../da/d0d/longest__common__string_8cpp_source.html">longest_common_string.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/da/d8d/depth__first__search_8cpp.html b/da/d8d/depth__first__search_8cpp.html
index 8fba9e89f..98ca03fb4 100644
--- a/da/d8d/depth__first__search_8cpp.html
+++ b/da/d8d/depth__first__search_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph/depth_first_search.cpp File Reference</title>
+<title>TheAlgorithms/C++: graph/depth_first_search.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for depth_first_search.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d4e/depth__first__search_8cpp__incl.svg" width="262" height="111"><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">
+</div>
+<p><a href="../../da/d8d/depth__first__search_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></td></tr>
@@ -130,13 +149,13 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:ad4016cfc80485a43748895a2c26c7d08" id="r_ad4016cfc80485a43748895a2c26c7d08"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#ad4016cfc80485a43748895a2c26c7d08">graph::addEdge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &gt; *adj, size_t u, size_t v)</td></tr>
+<tr class="memitem:ad4016cfc80485a43748895a2c26c7d08" id="r_ad4016cfc80485a43748895a2c26c7d08"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#ad4016cfc80485a43748895a2c26c7d08">graph::addEdge</a> (std::vector&lt; std::vector&lt; size_t &gt; &gt; *adj, size_t u, size_t v)</td></tr>
 <tr class="memdesc:ad4016cfc80485a43748895a2c26c7d08"><td class="mdescLeft">&#160;</td><td class="mdescRight">Adds and edge between two vertices of graph say u and v in this case.  <br /></td></tr>
 <tr class="separator:ad4016cfc80485a43748895a2c26c7d08"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a64c1db5aad7502c6f08e4652f6edd463" id="r_a64c1db5aad7502c6f08e4652f6edd463"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463">graph::explore</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &gt; &amp;adj, size_t v, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; *visited)</td></tr>
+<tr class="memitem:a64c1db5aad7502c6f08e4652f6edd463" id="r_a64c1db5aad7502c6f08e4652f6edd463"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463">graph::explore</a> (const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;adj, size_t v, std::vector&lt; bool &gt; *visited)</td></tr>
 <tr class="memdesc:a64c1db5aad7502c6f08e4652f6edd463"><td class="mdescLeft">&#160;</td><td class="mdescRight">Explores the given vertex, exploring a vertex means traversing over all the vertices which are connected to the vertex that is currently being explored.  <br /></td></tr>
 <tr class="separator:a64c1db5aad7502c6f08e4652f6edd463"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ab5428a3519267a28bba4b4310cfbb6ae" id="r_ab5428a3519267a28bba4b4310cfbb6ae"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae">graph::depth_first_search</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &gt; &amp;adj, size_t start)</td></tr>
+<tr class="memitem:ab5428a3519267a28bba4b4310cfbb6ae" id="r_ab5428a3519267a28bba4b4310cfbb6ae"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae">graph::depth_first_search</a> (const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;adj, size_t start)</td></tr>
 <tr class="memdesc:ab5428a3519267a28bba4b4310cfbb6ae"><td class="mdescLeft">&#160;</td><td class="mdescRight">initiates depth first search algorithm.  <br /></td></tr>
 <tr class="separator:ab5428a3519267a28bba4b4310cfbb6ae"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
@@ -163,6 +182,8 @@ Functions</h2></td></tr>
 <p class="startli">While exploring vertex we mark the vertex as visited and start exploring the vertices connected to this vertex in recursive way. </p>
 </li>
 </ol>
+
+<p class="definition">Definition in file <a class="el" href="../../da/d8d/depth__first__search_8cpp_source.html">depth_first_search.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -182,43 +203,33 @@ Functions</h2></td></tr>
 <p>creating graph</p>
 <p>taking input for edges</p>
 <p>running depth first search over graph</p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d8d/depth__first__search_8cpp_source.html#l00109">109</a> of file <a class="el" href="../../da/d8d/depth__first__search_8cpp_source.html">depth_first_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  109</span>           {</div>
 <div class="line"><span class="lineno">  110</span>    <span class="keywordtype">size_t</span> vertices = 0, edges = 0;</div>
-<div class="line"><span class="lineno">  111</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the Vertices : &quot;</span>;</div>
-<div class="line"><span class="lineno">  112</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; vertices;</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> &lt;&lt; <span class="stringliteral">&quot;Enter the Edges : &quot;</span>;</div>
-<div class="line"><span class="lineno">  114</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; edges;</div>
-<div class="line"><span class="lineno">  115</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  116</span><span class="comment">    /// creating graph</span></div>
-<div class="line"><span class="lineno">  117</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;size_t&gt;</a>&gt; adj(vertices, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;size_t&gt;</a>());</div>
-<div class="line"><span class="lineno">  118</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  119</span><span class="comment">    /// taking input for edges</span></div>
-<div class="line"><span class="lineno">  120</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the vertices which have edges between them : &quot;</span></div>
-<div class="line"><span class="lineno">  121</span>              &lt;&lt; <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">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the Vertices : &quot;</span>;</div>
+<div class="line"><span class="lineno">  112</span>    std::cin &gt;&gt; vertices;</div>
+<div class="line"><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the Edges : &quot;</span>;</div>
+<div class="line"><span class="lineno">  114</span>    std::cin &gt;&gt; edges;</div>
+<div class="line"><span class="lineno">  115</span> </div>
+<div class="line"><span class="lineno">  117</span>    std::vector&lt;std::vector&lt;size_t&gt;&gt; adj(vertices, std::vector&lt;size_t&gt;());</div>
+<div class="line"><span class="lineno">  118</span> </div>
+<div class="line"><span class="lineno">  120</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the vertices which have edges between them : &quot;</span></div>
+<div class="line"><span class="lineno">  121</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  122</span>    <span class="keywordflow">while</span> (edges--) {</div>
 <div class="line"><span class="lineno">  123</span>        <span class="keywordtype">size_t</span> u = 0, v = 0;</div>
-<div class="line"><span class="lineno">  124</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; u &gt;&gt; v;</div>
+<div class="line"><span class="lineno">  124</span>        std::cin &gt;&gt; u &gt;&gt; v;</div>
 <div class="line"><span class="lineno">  125</span>        <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj, u, v);</div>
 <div class="line"><span class="lineno">  126</span>    }</div>
-<div class="line"><span class="lineno">  127</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  128</span><span class="comment">    /// running depth first search over graph</span></div>
-<div class="line"><span class="lineno">  129</span><span class="comment"></span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae">graph::depth_first_search</a>(adj, 2);</div>
+<div class="line"><span class="lineno">  127</span> </div>
+<div class="line"><span class="lineno">  129</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae">graph::depth_first_search</a>(adj, 2);</div>
 <div class="line"><span class="lineno">  130</span> </div>
-<div class="line"><span class="lineno">  131</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  131</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  132</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  133</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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_a9125ceb66bfbec3093bba64c2c1e99e2"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a></div><div class="ttdeci">void addEdge(std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, int v)</div><div class="ttdoc">Function that add edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition</b> connected_components.cpp:46</div></div>
-<div class="ttc" id="anamespacegraph_html_ab5428a3519267a28bba4b4310cfbb6ae"><div class="ttname"><a href="../../df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae">graph::depth_first_search</a></div><div class="ttdeci">void depth_first_search(const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;adj, size_t start)</div><div class="ttdoc">initiates depth first search algorithm.</div><div class="ttdef"><b>Definition</b> depth_first_search.cpp:99</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d8d/depth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="220" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacegraph_html_a9125ceb66bfbec3093bba64c2c1e99e2"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a></div><div class="ttdeci">void addEdge(std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, int v)</div><div class="ttdoc">Function that add edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition</b> <a href="../../df/ddd/connected__components_8cpp_source.html#l00046">connected_components.cpp:46</a></div></div>
+<div class="ttc" id="anamespacegraph_html_ab5428a3519267a28bba4b4310cfbb6ae"><div class="ttname"><a href="../../df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae">graph::depth_first_search</a></div><div class="ttdeci">void depth_first_search(const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;adj, size_t start)</div><div class="ttdoc">initiates depth first search algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d8d/depth__first__search_8cpp_source.html#l00099">depth_first_search.cpp:99</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/da/d8d/depth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/d8d/depth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 7111b2a51..000000000
--- a/da/d8d/depth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2" title="Function that add edge between two nodes or vertices of graph." alt="" coords="103,5,215,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,36,87,30,88,35,56,41"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="123,55,194,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,45,109,55,108,61,55,51"/>
-</map>
diff --git a/da/d8d/depth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/d8d/depth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 2420af21a..000000000
--- a/da/d8d/depth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0e7fe15bc79d406e69de6413255cad89
\ No newline at end of file
diff --git a/da/d8d/depth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/d8d/depth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 2a070a166..000000000
--- a/da/d8d/depth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="165pt" height="64pt"
- viewBox="0.00 0.00 165.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2" target="_top" xlink:title="Function that add edge between two nodes or vertices of graph.">
-<polygon fill="white" stroke="#666666" points="157.25,-56.25 73,-56.25 73,-37 157.25,-37 157.25,-56.25"/>
-<text text-anchor="middle" x="115.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.3,-31.2C44.38,-32.62 52.92,-34.34 61.7,-36.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.88,-39.5 71.37,-38.04 62.26,-32.64 60.88,-39.5"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.88,-19.25 88.38,-19.25 88.38,0 141.88,0 141.88,-19.25"/>
-<text text-anchor="middle" x="115.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.3,-24.24C48.51,-22.11 63.4,-19.27 77.08,-16.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.53,-20.15 86.7,-14.84 76.22,-13.27 77.53,-20.15"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d8d/depth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/da/d8d/depth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 2703ee19f..000000000
--- a/da/d8d/depth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="165pt" height="64pt"
- viewBox="0.00 0.00 165.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2" target="_top" xlink:title="Function that add edge between two nodes or vertices of graph.">
-<polygon fill="white" stroke="#666666" points="157.25,-56.25 73,-56.25 73,-37 157.25,-37 157.25,-56.25"/>
-<text text-anchor="middle" x="115.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.3,-31.2C44.38,-32.62 52.92,-34.34 61.7,-36.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.88,-39.5 71.37,-38.04 62.26,-32.64 60.88,-39.5"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.88,-19.25 88.38,-19.25 88.38,0 141.88,0 141.88,-19.25"/>
-<text text-anchor="middle" x="115.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.3,-24.24C48.51,-22.11 63.4,-19.27 77.08,-16.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.53,-20.15 86.7,-14.84 76.22,-13.27 77.53,-20.15"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d8d/depth__first__search_8cpp_source.html b/da/d8d/depth__first__search_8cpp_source.html
new file mode 100644
index 000000000..efc4d9666
--- /dev/null
+++ b/da/d8d/depth__first__search_8cpp_source.html
@@ -0,0 +1,210 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/depth_first_search.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/d8d/depth__first__search_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">depth_first_search.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/d8d/depth__first__search_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> {</div>
+<div class="foldopen" id="foldopen00056" data-start="{" data-end="}">
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="../../df/dce/namespacegraph.html#ad4016cfc80485a43748895a2c26c7d08">   56</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">addEdge</a>(std::vector&lt;std::vector&lt;size_t&gt;&gt; *adj, <span class="keywordtype">size_t</span> u, <span class="keywordtype">size_t</span> v) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="comment">/*</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="comment">     * Here we are considering undirected graph that&#39;s the</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="comment">     * reason we are adding v to the adjacency list representation of u</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="comment">     * and also adding u to the adjacency list representation of v</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    (*adj)[u - 1].push_back(v - 1);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    (*adj)[v - 1].push_back(u - 1);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>}</div>
+</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="foldopen" id="foldopen00080" data-start="{" data-end="}">
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="../../df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463">   80</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8">explore</a>(<span class="keyword">const</span> std::vector&lt;std::vector&lt;size_t&gt;&gt; &amp;adj, <span class="keywordtype">size_t</span> v,</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>             std::vector&lt;bool&gt; *visited) {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    std::cout &lt;&lt; v + 1 &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    (*visited)[v] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> x : adj[v]) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        <span class="keywordflow">if</span> (!(*visited)[x]) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            <a class="code hl_function" href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8">explore</a>(adj, x, visited);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>}</div>
+</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="foldopen" id="foldopen00099" data-start="{" data-end="}">
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"><a class="line" href="../../df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae">   99</a></span><span class="keywordtype">void</span> <a class="code hl_namespace" href="../../d8/da7/namespacedepth__first__search.html">depth_first_search</a>(<span class="keyword">const</span> std::vector&lt;std::vector&lt;size_t&gt;&gt; &amp;adj,</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>                        <span class="keywordtype">size_t</span> start) {</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keywordtype">size_t</span> vertices = adj.size();</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    std::vector&lt;bool&gt; visited(vertices, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8">explore</a>(adj, start, &amp;visited);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>}</div>
+</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>}  <span class="comment">// namespace graph</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="foldopen" id="foldopen00109" data-start="{" data-end="}">
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"><a class="line" href="../../da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  109</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordtype">size_t</span> vertices = 0, edges = 0;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the Vertices : &quot;</span>;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    std::cin &gt;&gt; vertices;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the Edges : &quot;</span>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::cin &gt;&gt; edges;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    std::vector&lt;std::vector&lt;size_t&gt;&gt; adj(vertices, std::vector&lt;size_t&gt;());</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the vertices which have edges between them : &quot;</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="keywordflow">while</span> (edges--) {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        <span class="keywordtype">size_t</span> u = 0, v = 0;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        std::cin &gt;&gt; u &gt;&gt; v;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj, u, v);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    }</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span> </div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    graph::depth_first_search(adj, 2);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>}</div>
+</div>
+<div class="ttc" id="adepth__first__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00109">depth_first_search.cpp:109</a></div></div>
+<div class="ttc" id="anamespacedepth__first__search_html"><div class="ttname"><a href="../../d8/da7/namespacedepth__first__search.html">depth_first_search</a></div><div class="ttdoc">Functions for Depth First Search algorithm.</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 class="ttc" id="anamespacegraph_html_a3ae80bc4c6a79d041b4f3a6589eb7fb8"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8">graph::explore</a></div><div class="ttdeci">void explore(const std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, std::vector&lt; bool &gt; *visited)</div><div class="ttdoc">Utility function for depth first seach algorithm this function explores the vertex which is passed in...</div><div class="ttdef"><b>Definition</b> <a href="../../df/ddd/connected__components_8cpp_source.html#l00059">connected_components.cpp:59</a></div></div>
+<div class="ttc" id="anamespacegraph_html_a9125ceb66bfbec3093bba64c2c1e99e2"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a></div><div class="ttdeci">void addEdge(std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, int v)</div><div class="ttdoc">Function that add edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition</b> <a href="../../df/ddd/connected__components_8cpp_source.html#l00046">connected_components.cpp:46</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a class="el" href="../../da/d8d/depth__first__search_8cpp.html">depth_first_search.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html b/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html
index 2e6c99cf4..250fed87e 100644
--- a/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html
+++ b/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: machine_learning::k_nearest_neighbors::Knn Class Reference</title>
+<title>TheAlgorithms/C++: machine_learning::k_nearest_neighbors::Knn Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,7 @@ Collaboration diagram for machine_learning::k_nearest_neighbors::Knn:</div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:a188d29ffcefdb5900a8cd41eccd89200" id="r_a188d29ffcefdb5900a8cd41eccd89200"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a188d29ffcefdb5900a8cd41eccd89200">Knn</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; double &gt; &gt; &amp;X, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;Y)</td></tr>
+<tr class="memitem:a188d29ffcefdb5900a8cd41eccd89200" id="r_a188d29ffcefdb5900a8cd41eccd89200"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a188d29ffcefdb5900a8cd41eccd89200">Knn</a> (std::vector&lt; std::vector&lt; double &gt; &gt; &amp;X, std::vector&lt; int &gt; &amp;Y)</td></tr>
 <tr class="memdesc:a188d29ffcefdb5900a8cd41eccd89200"><td class="mdescLeft">&#160;</td><td class="mdescRight">Construct a new <a class="el" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html" title="K-Nearest Neighbors (Knn) class using Euclidean distance as distance metric.">Knn</a> object.  <br /></td></tr>
 <tr class="separator:a188d29ffcefdb5900a8cd41eccd89200"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a9f5885c40112481ae5b588fe81d7910b" id="r_a9f5885c40112481ae5b588fe81d7910b"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9f5885c40112481ae5b588fe81d7910b">Knn</a> (const <a class="el" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html">Knn</a> &amp;model)=default</td></tr>
@@ -137,21 +154,23 @@ Public Member Functions</h2></td></tr>
 &#160;</td><td class="memItemRight" valign="bottom"><b>~Knn</b> ()=default</td></tr>
 <tr class="memdesc:afe732a33112b457b738f403622d226e5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Destroy the <a class="el" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html" title="K-Nearest Neighbors (Knn) class using Euclidean distance as distance metric.">Knn</a> object. <br /></td></tr>
 <tr class="separator:afe732a33112b457b738f403622d226e5"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a62e152db014cd4de675fa906e5ef2861" id="r_a62e152db014cd4de675fa906e5ef2861"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a62e152db014cd4de675fa906e5ef2861">predict</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; double &gt; &amp;sample, int k)</td></tr>
+<tr class="memitem:a62e152db014cd4de675fa906e5ef2861" id="r_a62e152db014cd4de675fa906e5ef2861"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a62e152db014cd4de675fa906e5ef2861">predict</a> (std::vector&lt; double &gt; &amp;sample, int k)</td></tr>
 <tr class="memdesc:a62e152db014cd4de675fa906e5ef2861"><td class="mdescLeft">&#160;</td><td class="mdescRight">Classify sample.  <br /></td></tr>
 <tr class="separator:a62e152db014cd4de675fa906e5ef2861"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a16ddc13621eec6ac5f83658b3401a581" id="r_a16ddc13621eec6ac5f83658b3401a581"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; double &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a16ddc13621eec6ac5f83658b3401a581">X_</a> {}</td></tr>
+<tr class="memitem:a16ddc13621eec6ac5f83658b3401a581" id="r_a16ddc13621eec6ac5f83658b3401a581"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; double &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a16ddc13621eec6ac5f83658b3401a581">X_</a> {}</td></tr>
 <tr class="memdesc:a16ddc13621eec6ac5f83658b3401a581"><td class="mdescLeft">&#160;</td><td class="mdescRight">attributes vector  <br /></td></tr>
 <tr class="separator:a16ddc13621eec6ac5f83658b3401a581"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a209383503fb6c03afac405a80bace964" id="r_a209383503fb6c03afac405a80bace964"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a209383503fb6c03afac405a80bace964">Y_</a> {}</td></tr>
+<tr class="memitem:a209383503fb6c03afac405a80bace964" id="r_a209383503fb6c03afac405a80bace964"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a209383503fb6c03afac405a80bace964">Y_</a> {}</td></tr>
 <tr class="memdesc:a209383503fb6c03afac405a80bace964"><td class="mdescLeft">&#160;</td><td class="mdescRight">labels vector  <br /></td></tr>
 <tr class="separator:a209383503fb6c03afac405a80bace964"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>K-Nearest Neighbors (<a class="el" href="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html" title="K-Nearest Neighbors (Knn) class using Euclidean distance as distance metric.">Knn</a>) class using Euclidean distance as distance metric. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html">k_nearest_neighbors.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a188d29ffcefdb5900a8cd41eccd89200" name="a188d29ffcefdb5900a8cd41eccd89200"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a188d29ffcefdb5900a8cd41eccd89200">&#9670;&#160;</a></span>Knn() <span class="overload">[1/3]</span></h2>
@@ -165,12 +184,12 @@ Private Attributes</h2></td></tr>
         <tr>
           <td class="memname">machine_learning::k_nearest_neighbors::Knn::Knn </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>Y</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>Y</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -188,9 +207,11 @@ Private Attributes</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html">k_nearest_neighbors.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   68</span>        : <a class="code hl_variable" href="#a16ddc13621eec6ac5f83658b3401a581">X_</a>(X), <a class="code hl_variable" href="#a209383503fb6c03afac405a80bace964">Y_</a>(Y){};</div>
-<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_a16ddc13621eec6ac5f83658b3401a581"><div class="ttname"><a href="#a16ddc13621eec6ac5f83658b3401a581">machine_learning::k_nearest_neighbors::Knn::X_</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; double &gt; &gt; X_</div><div class="ttdoc">attributes vector</div><div class="ttdef"><b>Definition</b> k_nearest_neighbors.cpp:57</div></div>
-<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_a209383503fb6c03afac405a80bace964"><div class="ttname"><a href="#a209383503fb6c03afac405a80bace964">machine_learning::k_nearest_neighbors::Knn::Y_</a></div><div class="ttdeci">std::vector&lt; int &gt; Y_</div><div class="ttdoc">labels vector</div><div class="ttdef"><b>Definition</b> k_nearest_neighbors.cpp:58</div></div>
+<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_a16ddc13621eec6ac5f83658b3401a581"><div class="ttname"><a href="#a16ddc13621eec6ac5f83658b3401a581">machine_learning::k_nearest_neighbors::Knn::X_</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; double &gt; &gt; X_</div><div class="ttdoc">attributes vector</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html#l00057">k_nearest_neighbors.cpp:57</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1k__nearest__neighbors_1_1_knn_html_a209383503fb6c03afac405a80bace964"><div class="ttname"><a href="#a209383503fb6c03afac405a80bace964">machine_learning::k_nearest_neighbors::Knn::Y_</a></div><div class="ttdeci">std::vector&lt; int &gt; Y_</div><div class="ttdoc">labels vector</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html#l00058">k_nearest_neighbors.cpp:58</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -317,7 +338,7 @@ Private Attributes</h2></td></tr>
         <tr>
           <td class="memname">int machine_learning::k_nearest_neighbors::Knn::predict </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>sample</em></span>, </td>
+          <td class="paramtype">std::vector&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>sample</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -341,25 +362,27 @@ Private Attributes</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>int label of most frequent neighbors </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html#l00103">103</a> of file <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html">k_nearest_neighbors.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  103</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&lt;int&gt;</a> neighbors;</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&lt;std::pair&lt;double, int&gt;</a>&gt; distances;</div>
-<div class="line"><span class="lineno">  106</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; this-&gt;<a class="code hl_variable" href="#a16ddc13621eec6ac5f83658b3401a581">X_</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); ++i) {</div>
-<div class="line"><span class="lineno">  107</span>            <span class="keyword">auto</span> current = this-&gt;<a class="code hl_variable" href="#a16ddc13621eec6ac5f83658b3401a581">X_</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/at.html">at</a>(i);</div>
-<div class="line"><span class="lineno">  108</span>            <span class="keyword">auto</span> label = this-&gt;<a class="code hl_variable" href="#a209383503fb6c03afac405a80bace964">Y_</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/at.html">at</a>(i);</div>
-<div class="line"><span class="lineno">  109</span>            <span class="keyword">auto</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/distance.html">distance</a> = <a class="code hl_function" href="../../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69">euclidean_distance</a>(current, sample);</div>
-<div class="line"><span class="lineno">  110</span>            distances.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(distance, label);</div>
+<div class="line"><span class="lineno">  104</span>        std::vector&lt;int&gt; neighbors;</div>
+<div class="line"><span class="lineno">  105</span>        std::vector&lt;std::pair&lt;double, int&gt;&gt; distances;</div>
+<div class="line"><span class="lineno">  106</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; this-&gt;<a class="code hl_variable" href="#a16ddc13621eec6ac5f83658b3401a581">X_</a>.size(); ++i) {</div>
+<div class="line"><span class="lineno">  107</span>            <span class="keyword">auto</span> current = this-&gt;<a class="code hl_variable" href="#a16ddc13621eec6ac5f83658b3401a581">X_</a>.at(i);</div>
+<div class="line"><span class="lineno">  108</span>            <span class="keyword">auto</span> label = this-&gt;<a class="code hl_variable" href="#a209383503fb6c03afac405a80bace964">Y_</a>.at(i);</div>
+<div class="line"><span class="lineno">  109</span>            <span class="keyword">auto</span> distance = <a class="code hl_function" href="../../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69">euclidean_distance</a>(current, sample);</div>
+<div class="line"><span class="lineno">  110</span>            distances.emplace_back(distance, label);</div>
 <div class="line"><span class="lineno">  111</span>        }</div>
-<div class="line"><span class="lineno">  112</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a>(distances.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), distances.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>());</div>
+<div class="line"><span class="lineno">  112</span>        std::sort(distances.begin(), distances.end());</div>
 <div class="line"><span class="lineno">  113</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>; i++) {</div>
-<div class="line"><span class="lineno">  114</span>            <span class="keyword">auto</span> label = distances.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/at.html">at</a>(i).second;</div>
-<div class="line"><span class="lineno">  115</span>            neighbors.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(label);</div>
+<div class="line"><span class="lineno">  114</span>            <span class="keyword">auto</span> label = distances.at(i).second;</div>
+<div class="line"><span class="lineno">  115</span>            neighbors.push_back(label);</div>
 <div class="line"><span class="lineno">  116</span>        }</div>
-<div class="line"><span class="lineno">  117</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map&lt;int, int&gt;</a> frequency;</div>
+<div class="line"><span class="lineno">  117</span>        std::unordered_map&lt;int, int&gt; frequency;</div>
 <div class="line"><span class="lineno">  118</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> neighbor : neighbors) {</div>
 <div class="line"><span class="lineno">  119</span>            ++frequency[neighbor];</div>
 <div class="line"><span class="lineno">  120</span>        }</div>
-<div class="line"><span class="lineno">  121</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;int, int&gt;</a> predicted;</div>
+<div class="line"><span class="lineno">  121</span>        std::pair&lt;int, int&gt; predicted;</div>
 <div class="line"><span class="lineno">  122</span>        predicted.first = -1;</div>
 <div class="line"><span class="lineno">  123</span>        predicted.second = -1;</div>
 <div class="line"><span class="lineno">  124</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; kv : frequency) {</div>
@@ -370,25 +393,9 @@ Private Attributes</h2></td></tr>
 <div class="line"><span class="lineno">  129</span>        }</div>
 <div class="line"><span class="lineno">  130</span>        <span class="keywordflow">return</span> predicted.first;</div>
 <div class="line"><span class="lineno">  131</span>    }</div>
-<div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/at.html">std::vector::at</a></div><div class="ttdeci">T at(T... args)</div></div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-<div class="ttc" id="adistance_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/distance.html">std::distance</a></div><div class="ttdeci">T distance(T... args)</div></div>
-<div class="ttc" id="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="ak__nearest__neighbors_8cpp_html_ad6ae16e50bb153ebaa7251d0aaa97b69"><div class="ttname"><a href="../../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69">machine_learning::k_nearest_neighbors::euclidean_distance</a></div><div class="ttdeci">double euclidean_distance(const std::vector&lt; T &gt; &amp;a, const std::vector&lt; T &gt; &amp;b)</div><div class="ttdoc">Compute the Euclidean distance between two vectors.</div><div class="ttdef"><b>Definition</b> k_nearest_neighbors.cpp:43</div></div>
-<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="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="asort_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a></div><div class="ttdeci">T sort(T... args)</div></div>
-<div class="ttc" id="aunordered_map_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a></div></div>
-<div 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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn_a62e152db014cd4de675fa906e5ef2861_cgraph.svg" width="551" height="440"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="ak__nearest__neighbors_8cpp_html_ad6ae16e50bb153ebaa7251d0aaa97b69"><div class="ttname"><a href="../../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69">machine_learning::k_nearest_neighbors::euclidean_distance</a></div><div class="ttdeci">double euclidean_distance(const std::vector&lt; T &gt; &amp;a, const std::vector&lt; T &gt; &amp;b)</div><div class="ttdoc">Compute the Euclidean distance between two vectors.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html#l00043">k_nearest_neighbors.cpp:43</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
@@ -402,7 +409,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;double&gt; &gt; machine_learning::k_nearest_neighbors::Knn::X_ {}</td>
+          <td class="memname">std::vector&lt;std::vector&lt;double&gt; &gt; machine_learning::k_nearest_neighbors::Knn::X_ {}</td>
         </tr>
       </table>
   </td>
@@ -413,7 +420,9 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>attributes vector </p>
-<div class="fragment"><div class="line"><span class="lineno">   57</span>{};  <span class="comment">///&lt; attributes vector</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html">k_nearest_neighbors.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   57</span>{};  </div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -427,7 +436,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;int&gt; machine_learning::k_nearest_neighbors::Knn::Y_ {}</td>
+          <td class="memname">std::vector&lt;int&gt; machine_learning::k_nearest_neighbors::Knn::Y_ {}</td>
         </tr>
       </table>
   </td>
@@ -438,12 +447,14 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>labels vector </p>
-<div class="fragment"><div class="line"><span class="lineno">   58</span>{};                  <span class="comment">///&lt; labels vector</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html">k_nearest_neighbors.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   58</span>{};                  </div>
 </div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>machine_learning/<a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp.html">k_nearest_neighbors.cpp</a></li>
+<li>machine_learning/<a class="el" href="../../d4/d3e/k__nearest__neighbors_8cpp_source.html">k_nearest_neighbors.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn_a62e152db014cd4de675fa906e5ef2861_cgraph.map b/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn_a62e152db014cd4de675fa906e5ef2861_cgraph.map
deleted file mode 100644
index 2a907e1bc..000000000
--- a/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn_a62e152db014cd4de675fa906e5ef2861_cgraph.map
+++ /dev/null
@@ -1,32 +0,0 @@
-<map id="machine_learning::k_nearest_neighbors::Knn::predict" name="machine_learning::k_nearest_neighbors::Knn::predict">
-<area shape="rect" id="Node000001" title="Classify sample." alt="" coords="5,214,148,270"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/at.html#" title=" " alt="" coords="232,5,334,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="86,213,102,176,125,132,156,87,194,48,217,34,219,39,197,52,160,91,130,135,107,178,91,215"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="421,56,543,82"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="92,213,133,158,162,130,194,108,246,86,302,73,356,66,405,63,405,69,356,71,303,78,248,91,197,113,165,134,137,161,96,216"/>
-<area shape="rect" id="Node000004" 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="196,261,371,287"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="149,251,181,256,181,261,148,256"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="426,105,538,131"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="101,212,142,174,167,157,195,142,249,125,306,115,361,111,410,111,410,116,361,116,307,121,251,130,197,147,170,161,145,178,105,216"/>
-<area shape="rect" id="Node000006" href="$d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69" title="Compute the Euclidean distance between two vectors." alt="" coords="212,181,354,237"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="148,228,196,220,197,225,149,233"/>
-<area shape="rect" id="Node000012" 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="206,311,360,336"/>
-<area shape="poly" id="edge14_Node000001_Node000012" title=" " alt="" coords="132,268,197,297,214,303,212,308,195,302,130,273"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="226,360,341,386"/>
-<area shape="poly" id="edge15_Node000001_Node000013" title=" " alt="" coords="104,269,145,309,197,347,212,354,210,358,194,351,142,313,100,273"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/sort.html#" title=" " alt="" coords="249,409,318,435"/>
-<area shape="poly" id="edge16_Node000001_Node000014" title=" " alt="" coords="94,269,135,333,163,367,197,396,234,412,232,417,194,400,160,371,130,337,89,272"/>
-<area shape="poly" id="edge8_Node000006_Node000003" title=" " alt="" coords="310,178,358,134,418,91,426,86,428,91,420,95,361,138,314,182"/>
-<area shape="poly" id="edge9_Node000006_Node000005" title=" " alt="" coords="338,178,418,140,429,135,432,140,420,145,340,183"/>
-<area shape="poly" id="edge10_Node000006_Node000006" title=" " alt="" coords="244,180,244,171,252,162,265,156,283,154,304,157,317,164,315,169,303,162,283,160,266,161,255,166,249,173,249,181"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/accumulate.html#" title=" " alt="" coords="425,204,539,230"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="355,209,409,211,409,217,355,214"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/back_inserter.html#" title=" " alt="" coords="420,253,545,279"/>
-<area shape="poly" id="edge7_Node000006_Node000008" title=" " alt="" coords="356,227,421,246,420,251,354,232"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/shrink_to_fit.html#" title=" " alt="" coords="419,303,545,344"/>
-<area shape="poly" id="edge11_Node000006_Node000009" title=" " alt="" coords="353,235,373,247,397,268,421,289,426,293,423,297,417,294,393,272,369,251,350,240"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="448,368,517,394"/>
-<area shape="poly" id="edge12_Node000006_Node000010" title=" " alt="" coords="357,234,373,247,391,275,397,302,403,328,421,354,435,364,432,368,417,357,398,330,392,303,386,277,369,251,353,238"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/transform.html#" title=" " alt="" coords="431,155,533,180"/>
-<area shape="poly" id="edge13_Node000006_Node000011" title=" " alt="" coords="354,191,416,179,417,184,355,197"/>
-</map>
diff --git a/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn_a62e152db014cd4de675fa906e5ef2861_cgraph.md5 b/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn_a62e152db014cd4de675fa906e5ef2861_cgraph.md5
deleted file mode 100644
index 86133a5f5..000000000
--- a/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn_a62e152db014cd4de675fa906e5ef2861_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-20827012b237e163d463f2ea102bfeda
\ No newline at end of file
diff --git a/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn_a62e152db014cd4de675fa906e5ef2861_cgraph.svg b/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn_a62e152db014cd4de675fa906e5ef2861_cgraph.svg
deleted file mode 100644
index dd09e0ba9..000000000
--- a/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn_a62e152db014cd4de675fa906e5ef2861_cgraph.svg
+++ /dev/null
@@ -1,313 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::k_nearest_neighbors::Knn::predict Pages: 1 -->
-<svg width="413pt" height="330pt"
- viewBox="0.00 0.00 413.00 330.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 326.25)">
-<title>machine_learning::k_nearest_neighbors::Knn::predict</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Classify sample.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-165.5 0,-165.5 0,-123.75 106.75,-123.75 106.75,-165.5"/>
-<text text-anchor="start" x="8" y="-152" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::k</text>
-<text text-anchor="start" x="8" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">_nearest_neighbors::</text>
-<text text-anchor="middle" x="53.38" y="-129.5" font-family="Helvetica,sans-Serif" font-size="10.00">Knn::predict</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.88,-322.25 170.12,-322.25 170.12,-303 246.88,-303 246.88,-322.25"/>
-<text text-anchor="middle" x="208.5" y="-308.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::at</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.12,-165.78C74.53,-196.89 101.72,-254.93 142.75,-288.62 147.74,-292.72 153.49,-296.15 159.46,-299.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.66,-302.06 168.23,-302.75 160.4,-295.62 157.66,-302.06"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="403.5,-284.25 311.75,-284.25 311.75,-265 403.5,-265 403.5,-284.25"/>
-<text text-anchor="middle" x="357.62" y="-270.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.7,-165.6C81.57,-188.83 108.86,-225.42 142.75,-243.62 191.4,-269.76 254.81,-276.09 299.92,-276.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.73,-280.25 309.75,-276.79 299.77,-273.25 299.73,-280.25"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.25,-130.25 142.75,-130.25 142.75,-111 274.25,-111 274.25,-130.25"/>
-<text text-anchor="middle" x="208.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.07,-136.37C115.04,-135.12 123.39,-133.81 131.74,-132.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.23,-135.97 141.57,-130.96 131.15,-129.05 132.23,-135.97"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="399.75,-247.25 315.5,-247.25 315.5,-228 399.75,-228 399.75,-247.25"/>
-<text text-anchor="middle" x="357.62" y="-233.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.09,-165.94C89.56,-183.12 115.16,-206.23 142.75,-217.62 194.48,-239 259.07,-242.19 303.66,-241.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="303.71,-244.66 313.59,-240.85 303.49,-237.67 303.71,-244.66"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69" target="_top" xlink:title="Compute the Euclidean distance between two vectors.">
-<polygon fill="white" stroke="#666666" points="261.88,-190.5 155.12,-190.5 155.12,-148.75 261.88,-148.75 261.88,-190.5"/>
-<text text-anchor="start" x="163.12" y="-177" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::k</text>
-<text text-anchor="start" x="163.12" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">_nearest_neighbors::</text>
-<text text-anchor="middle" x="208.5" y="-154.5" font-family="Helvetica,sans-Serif" font-size="10.00">euclidean_distance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.07,-153.23C118.86,-155.15 131.49,-157.22 143.68,-159.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.78,-162.6 153.21,-160.76 143.91,-155.7 142.78,-162.6"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.38,-93.25 150.62,-93.25 150.62,-74 266.38,-74 266.38,-93.25"/>
-<text text-anchor="middle" x="208.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge14_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge14_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.17,-123.36C109.14,-115.87 126.47,-107.79 142.75,-101.62 146.93,-100.04 151.3,-98.53 155.72,-97.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.74,-100.46 165.27,-94.19 154.69,-93.76 156.74,-100.46"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.75,-56.25 165.25,-56.25 165.25,-37 251.75,-37 251.75,-56.25"/>
-<text text-anchor="middle" x="208.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node13 -->
-<g id="edge15_Node000001_Node000013" class="edge">
-<title>Node1&#45;&gt;Node13</title>
-<g id="a_edge15_Node000001_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.64,-123.26C89.21,-105.16 115.2,-79.8 142.75,-64.62 146.39,-62.62 150.27,-60.83 154.25,-59.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.27,-62.57 163.51,-55.91 152.91,-55.98 155.27,-62.57"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.5,-19.25 182.5,-19.25 182.5,0 234.5,0 234.5,-19.25"/>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node14 -->
-<g id="edge16_Node000001_Node000014" class="edge">
-<title>Node1&#45;&gt;Node14</title>
-<g id="a_edge16_Node000001_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M64.74,-123.52C78.78,-97.12 106.34,-52.4 142.75,-27.62 151.14,-21.92 161.3,-18.01 171.06,-15.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.79,-18.76 180.74,-13.08 170.2,-11.94 171.79,-18.76"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge8_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge8_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.84,-190.95C249.09,-210.17 279.55,-238.17 310.25,-256.62 312.14,-257.76 314.11,-258.85 316.13,-259.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.55,-263.01 325.1,-264.02 317.48,-256.65 314.55,-263.01"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge9_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge9_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M250.28,-190.91C268.45,-200.12 290.24,-210.8 310.25,-219.62 313.04,-220.86 315.95,-222.09 318.88,-223.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.49,-226.52 328.08,-227 320.1,-220.02 317.49,-226.52"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge10_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge10_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.98,-190.82C178.35,-200.3 187.53,-208.5 208.5,-208.5 220.62,-208.5 228.8,-205.76 233.04,-201.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.33,-202.85 235.62,-192.28 229.59,-200.99 236.33,-202.85"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.5,-173.25 314.75,-173.25 314.75,-154 400.5,-154 400.5,-173.25"/>
-<text text-anchor="middle" x="357.62" y="-159.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::accumulate</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.2,-167.48C275.46,-166.93 289.72,-166.35 303.02,-165.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="303.07,-169.31 312.92,-165.41 302.78,-162.32 303.07,-169.31"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/back_inserter.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="404.62,-136.25 310.62,-136.25 310.62,-117 404.62,-117 404.62,-136.25"/>
-<text text-anchor="middle" x="357.62" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::back_inserter</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.2,-154.22C278.26,-149.53 295.76,-144.41 311.28,-139.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="312.12,-143.28 320.74,-137.11 310.16,-136.56 312.12,-143.28"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="405,-98.88 310.25,-98.88 310.25,-68.38 405,-68.38 405,-98.88"/>
-<text text-anchor="start" x="318.25" y="-85.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::shrink</text>
-<text text-anchor="middle" x="357.62" y="-74.12" font-family="Helvetica,sans-Serif" font-size="10.00">_to_fit</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge11_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge11_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.45,-148.31C264.56,-145.59 269.59,-142.68 274.25,-139.62 292.15,-127.89 292.61,-119.75 310.25,-107.62 311.6,-106.69 313,-105.78 314.42,-104.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.97,-108.02 322.79,-99.91 312.4,-102 315.97,-108.02"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.62,-50.25 331.62,-50.25 331.62,-31 383.62,-31 383.62,-50.25"/>
-<text text-anchor="middle" x="357.62" y="-36.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge12_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge12_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.24,-149.33C266.59,-146.46 270.68,-143.24 274.25,-139.62 301.67,-111.9 282.22,-86.72 310.25,-59.62 313.47,-56.52 317.26,-53.89 321.27,-51.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.48,-54.98 330.11,-47.62 319.56,-48.61 322.48,-54.98"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/transform.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="396,-210.25 319.25,-210.25 319.25,-191 396,-191 396,-210.25"/>
-<text text-anchor="middle" x="357.62" y="-196.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::transform</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge13_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge13_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.2,-180.73C277.18,-183.89 293.42,-187.31 308.14,-190.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.06,-193.76 317.57,-192.4 308.51,-186.91 307.06,-193.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn_a62e152db014cd4de675fa906e5ef2861_cgraph_org.svg b/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn_a62e152db014cd4de675fa906e5ef2861_cgraph_org.svg
deleted file mode 100644
index 66373cce4..000000000
--- a/da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn_a62e152db014cd4de675fa906e5ef2861_cgraph_org.svg
+++ /dev/null
@@ -1,287 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::k_nearest_neighbors::Knn::predict Pages: 1 -->
-<svg width="413pt" height="330pt"
- viewBox="0.00 0.00 413.00 330.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 326.25)">
-<title>machine_learning::k_nearest_neighbors::Knn::predict</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Classify sample.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-165.5 0,-165.5 0,-123.75 106.75,-123.75 106.75,-165.5"/>
-<text text-anchor="start" x="8" y="-152" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::k</text>
-<text text-anchor="start" x="8" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">_nearest_neighbors::</text>
-<text text-anchor="middle" x="53.38" y="-129.5" font-family="Helvetica,sans-Serif" font-size="10.00">Knn::predict</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.88,-322.25 170.12,-322.25 170.12,-303 246.88,-303 246.88,-322.25"/>
-<text text-anchor="middle" x="208.5" y="-308.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::at</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.12,-165.78C74.53,-196.89 101.72,-254.93 142.75,-288.62 147.74,-292.72 153.49,-296.15 159.46,-299.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.66,-302.06 168.23,-302.75 160.4,-295.62 157.66,-302.06"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="403.5,-284.25 311.75,-284.25 311.75,-265 403.5,-265 403.5,-284.25"/>
-<text text-anchor="middle" x="357.62" y="-270.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.7,-165.6C81.57,-188.83 108.86,-225.42 142.75,-243.62 191.4,-269.76 254.81,-276.09 299.92,-276.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.73,-280.25 309.75,-276.79 299.77,-273.25 299.73,-280.25"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.25,-130.25 142.75,-130.25 142.75,-111 274.25,-111 274.25,-130.25"/>
-<text text-anchor="middle" x="208.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.07,-136.37C115.04,-135.12 123.39,-133.81 131.74,-132.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.23,-135.97 141.57,-130.96 131.15,-129.05 132.23,-135.97"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="399.75,-247.25 315.5,-247.25 315.5,-228 399.75,-228 399.75,-247.25"/>
-<text text-anchor="middle" x="357.62" y="-233.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.09,-165.94C89.56,-183.12 115.16,-206.23 142.75,-217.62 194.48,-239 259.07,-242.19 303.66,-241.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="303.71,-244.66 313.59,-240.85 303.49,-237.67 303.71,-244.66"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69" target="_top" xlink:title="Compute the Euclidean distance between two vectors.">
-<polygon fill="white" stroke="#666666" points="261.88,-190.5 155.12,-190.5 155.12,-148.75 261.88,-148.75 261.88,-190.5"/>
-<text text-anchor="start" x="163.12" y="-177" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::k</text>
-<text text-anchor="start" x="163.12" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">_nearest_neighbors::</text>
-<text text-anchor="middle" x="208.5" y="-154.5" font-family="Helvetica,sans-Serif" font-size="10.00">euclidean_distance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.07,-153.23C118.86,-155.15 131.49,-157.22 143.68,-159.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.78,-162.6 153.21,-160.76 143.91,-155.7 142.78,-162.6"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.38,-93.25 150.62,-93.25 150.62,-74 266.38,-74 266.38,-93.25"/>
-<text text-anchor="middle" x="208.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge14_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge14_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.17,-123.36C109.14,-115.87 126.47,-107.79 142.75,-101.62 146.93,-100.04 151.3,-98.53 155.72,-97.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.74,-100.46 165.27,-94.19 154.69,-93.76 156.74,-100.46"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.75,-56.25 165.25,-56.25 165.25,-37 251.75,-37 251.75,-56.25"/>
-<text text-anchor="middle" x="208.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node13 -->
-<g id="edge15_Node000001_Node000013" class="edge">
-<title>Node1&#45;&gt;Node13</title>
-<g id="a_edge15_Node000001_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.64,-123.26C89.21,-105.16 115.2,-79.8 142.75,-64.62 146.39,-62.62 150.27,-60.83 154.25,-59.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.27,-62.57 163.51,-55.91 152.91,-55.98 155.27,-62.57"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.5,-19.25 182.5,-19.25 182.5,0 234.5,0 234.5,-19.25"/>
-<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node14 -->
-<g id="edge16_Node000001_Node000014" class="edge">
-<title>Node1&#45;&gt;Node14</title>
-<g id="a_edge16_Node000001_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M64.74,-123.52C78.78,-97.12 106.34,-52.4 142.75,-27.62 151.14,-21.92 161.3,-18.01 171.06,-15.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.79,-18.76 180.74,-13.08 170.2,-11.94 171.79,-18.76"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge8_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge8_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.84,-190.95C249.09,-210.17 279.55,-238.17 310.25,-256.62 312.14,-257.76 314.11,-258.85 316.13,-259.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.55,-263.01 325.1,-264.02 317.48,-256.65 314.55,-263.01"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge9_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge9_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M250.28,-190.91C268.45,-200.12 290.24,-210.8 310.25,-219.62 313.04,-220.86 315.95,-222.09 318.88,-223.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.49,-226.52 328.08,-227 320.1,-220.02 317.49,-226.52"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge10_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge10_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M180.98,-190.82C178.35,-200.3 187.53,-208.5 208.5,-208.5 220.62,-208.5 228.8,-205.76 233.04,-201.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.33,-202.85 235.62,-192.28 229.59,-200.99 236.33,-202.85"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="400.5,-173.25 314.75,-173.25 314.75,-154 400.5,-154 400.5,-173.25"/>
-<text text-anchor="middle" x="357.62" y="-159.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::accumulate</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.2,-167.48C275.46,-166.93 289.72,-166.35 303.02,-165.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="303.07,-169.31 312.92,-165.41 302.78,-162.32 303.07,-169.31"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/back_inserter.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="404.62,-136.25 310.62,-136.25 310.62,-117 404.62,-117 404.62,-136.25"/>
-<text text-anchor="middle" x="357.62" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::back_inserter</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.2,-154.22C278.26,-149.53 295.76,-144.41 311.28,-139.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="312.12,-143.28 320.74,-137.11 310.16,-136.56 312.12,-143.28"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="405,-98.88 310.25,-98.88 310.25,-68.38 405,-68.38 405,-98.88"/>
-<text text-anchor="start" x="318.25" y="-85.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::shrink</text>
-<text text-anchor="middle" x="357.62" y="-74.12" font-family="Helvetica,sans-Serif" font-size="10.00">_to_fit</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge11_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge11_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.45,-148.31C264.56,-145.59 269.59,-142.68 274.25,-139.62 292.15,-127.89 292.61,-119.75 310.25,-107.62 311.6,-106.69 313,-105.78 314.42,-104.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.97,-108.02 322.79,-99.91 312.4,-102 315.97,-108.02"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.62,-50.25 331.62,-50.25 331.62,-31 383.62,-31 383.62,-50.25"/>
-<text text-anchor="middle" x="357.62" y="-36.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge12_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge12_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.24,-149.33C266.59,-146.46 270.68,-143.24 274.25,-139.62 301.67,-111.9 282.22,-86.72 310.25,-59.62 313.47,-56.52 317.26,-53.89 321.27,-51.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="322.48,-54.98 330.11,-47.62 319.56,-48.61 322.48,-54.98"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/transform.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="396,-210.25 319.25,-210.25 319.25,-191 396,-191 396,-210.25"/>
-<text text-anchor="middle" x="357.62" y="-196.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::transform</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge13_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge13_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.2,-180.73C277.18,-183.89 293.42,-187.31 308.14,-190.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.06,-193.76 317.57,-192.4 308.51,-186.91 307.06,-193.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d9a/class_graph.html b/da/d9a/class_graph.html
index 928d7d046..fe63a0ecc 100644
--- a/da/d9a/class_graph.html
+++ b/da/d9a/class_graph.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Graph Class Reference</title>
+<title>TheAlgorithms/C++: Graph Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -141,13 +158,13 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:ab08a73091aea1a70c34cd15200401596" id="r_ab08a73091aea1a70c34cd15200401596"><td class="memItemLeft" align="right" valign="top"><a id="ab08a73091aea1a70c34cd15200401596" name="ab08a73091aea1a70c34cd15200401596"></a>
 <a class="el" href="../../da/d9a/class_graph.html">Graph</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><b>operator=</b> (<a class="el" href="../../da/d9a/class_graph.html">Graph</a> const &amp;)=default</td></tr>
 <tr class="separator:ab08a73091aea1a70c34cd15200401596"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:adcbd1b60cab30b97c54d700eee8e456d" id="r_adcbd1b60cab30b97c54d700eee8e456d"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adcbd1b60cab30b97c54d700eee8e456d">Graph</a> (unsigned int vertices, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">AdjList</a> adjList)</td></tr>
+<tr class="memitem:adcbd1b60cab30b97c54d700eee8e456d" id="r_adcbd1b60cab30b97c54d700eee8e456d"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adcbd1b60cab30b97c54d700eee8e456d">Graph</a> (unsigned int vertices, AdjList adjList)</td></tr>
 <tr class="separator:adcbd1b60cab30b97c54d700eee8e456d"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8c95e00effaea0cd9404dd74cd802ae3" id="r_a8c95e00effaea0cd9404dd74cd802ae3"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8c95e00effaea0cd9404dd74cd802ae3">Graph</a> (unsigned int vertices, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">AdjList</a> &amp;&amp;adjList)</td></tr>
+<tr class="memitem:a8c95e00effaea0cd9404dd74cd802ae3" id="r_a8c95e00effaea0cd9404dd74cd802ae3"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8c95e00effaea0cd9404dd74cd802ae3">Graph</a> (unsigned int vertices, AdjList &amp;&amp;adjList)</td></tr>
 <tr class="separator:a8c95e00effaea0cd9404dd74cd802ae3"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa99d44d3179d5bbbfa84a5031cf80cb1" id="r_aa99d44d3179d5bbbfa84a5031cf80cb1"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa99d44d3179d5bbbfa84a5031cf80cb1">Graph</a> (unsigned int vertices, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d7/d77/class_edge.html">Edge</a> &gt; const &amp;edges)</td></tr>
+<tr class="memitem:aa99d44d3179d5bbbfa84a5031cf80cb1" id="r_aa99d44d3179d5bbbfa84a5031cf80cb1"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa99d44d3179d5bbbfa84a5031cf80cb1">Graph</a> (unsigned int vertices, std::vector&lt; <a class="el" href="../../d7/d77/class_edge.html">Edge</a> &gt; const &amp;edges)</td></tr>
 <tr class="separator:aa99d44d3179d5bbbfa84a5031cf80cb1"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a5a090e1a63a5c47bdd1a539b21f7fd1d" id="r_a5a090e1a63a5c47bdd1a539b21f7fd1d"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/remove_reference.html">std::remove_reference</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">AdjList</a> &gt;::type const &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5a090e1a63a5c47bdd1a539b21f7fd1d">getAdjList</a> () const</td></tr>
+<tr class="memitem:a5a090e1a63a5c47bdd1a539b21f7fd1d" id="r_a5a090e1a63a5c47bdd1a539b21f7fd1d"><td class="memItemLeft" align="right" valign="top">std::remove_reference&lt; AdjList &gt;::type const &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5a090e1a63a5c47bdd1a539b21f7fd1d">getAdjList</a> () const</td></tr>
 <tr class="separator:a5a090e1a63a5c47bdd1a539b21f7fd1d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a8dcb5ce0b4a6f65827f5055d9d53a3f1" id="r_a8dcb5ce0b4a6f65827f5055d9d53a3f1"><td class="memItemLeft" align="right" valign="top">unsigned int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8dcb5ce0b4a6f65827f5055d9d53a3f1">getVertices</a> () const</td></tr>
 <tr class="separator:a8dcb5ce0b4a6f65827f5055d9d53a3f1"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -166,17 +183,13 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a6afcd41564ea00294a4c089414979ca1" id="r_a6afcd41564ea00294a4c089414979ca1"><td class="memItemLeft" align="right" valign="top"><a id="a6afcd41564ea00294a4c089414979ca1" name="a6afcd41564ea00294a4c089414979ca1"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>vertexNum</b></td></tr>
+<tr class="memitem:a6afcd41564ea00294a4c089414979ca1" id="r_a6afcd41564ea00294a4c089414979ca1"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6afcd41564ea00294a4c089414979ca1">vertexNum</a></td></tr>
 <tr class="separator:a6afcd41564ea00294a4c089414979ca1"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a10ff9c6c323cf435f18e424dbb62235e" id="r_a10ff9c6c323cf435f18e424dbb62235e"><td class="memItemLeft" align="right" valign="top"><a id="a10ff9c6c323cf435f18e424dbb62235e" name="a10ff9c6c323cf435f18e424dbb62235e"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>edgeNum</b></td></tr>
+<tr class="memitem:a10ff9c6c323cf435f18e424dbb62235e" id="r_a10ff9c6c323cf435f18e424dbb62235e"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a10ff9c6c323cf435f18e424dbb62235e">edgeNum</a></td></tr>
 <tr class="separator:a10ff9c6c323cf435f18e424dbb62235e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a28d19ea9c7d111f55fee78331abe88bd" id="r_a28d19ea9c7d111f55fee78331abe88bd"><td class="memItemLeft" align="right" valign="top"><a id="a28d19ea9c7d111f55fee78331abe88bd" name="a28d19ea9c7d111f55fee78331abe88bd"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d7/d77/class_edge.html">Edge</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>edges</b></td></tr>
+<tr class="memitem:a28d19ea9c7d111f55fee78331abe88bd" id="r_a28d19ea9c7d111f55fee78331abe88bd"><td class="memItemLeft" align="right" valign="top">std::vector&lt; <a class="el" href="../../d7/d77/class_edge.html">Edge</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a28d19ea9c7d111f55fee78331abe88bd">edges</a></td></tr>
 <tr class="separator:a28d19ea9c7d111f55fee78331abe88bd"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a268ba18d421817ad8713c2e92f19d82a" id="r_a268ba18d421817ad8713c2e92f19d82a"><td class="memItemLeft" align="right" valign="top"><a id="a268ba18d421817ad8713c2e92f19d82a" name="a268ba18d421817ad8713c2e92f19d82a"></a>
-int **&#160;</td><td class="memItemRight" valign="bottom"><b>edges</b></td></tr>
+<tr class="memitem:a268ba18d421817ad8713c2e92f19d82a" id="r_a268ba18d421817ad8713c2e92f19d82a"><td class="memItemLeft" align="right" valign="top">int **&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a268ba18d421817ad8713c2e92f19d82a">edges</a></td></tr>
 <tr class="separator:a268ba18d421817ad8713c2e92f19d82a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
@@ -186,46 +199,36 @@ Private Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a61943646676002a5e75f7b6493c25713" id="r_a61943646676002a5e75f7b6493c25713"><td class="memItemLeft" align="right" valign="top"><a id="a61943646676002a5e75f7b6493c25713" name="a61943646676002a5e75f7b6493c25713"></a>
-unsigned int&#160;</td><td class="memItemRight" valign="bottom"><b>m_vertices</b> = 0</td></tr>
+<tr class="memitem:a61943646676002a5e75f7b6493c25713" id="r_a61943646676002a5e75f7b6493c25713"><td class="memItemLeft" align="right" valign="top">unsigned int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a61943646676002a5e75f7b6493c25713">m_vertices</a> = 0</td></tr>
 <tr class="separator:a61943646676002a5e75f7b6493c25713"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a13697caf8be6275ebb7b9497c9a9d6e5" id="r_a13697caf8be6275ebb7b9497c9a9d6e5"><td class="memItemLeft" align="right" valign="top"><a id="a13697caf8be6275ebb7b9497c9a9d6e5" name="a13697caf8be6275ebb7b9497c9a9d6e5"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">AdjList</a>&#160;</td><td class="memItemRight" valign="bottom"><b>m_adjList</b></td></tr>
+<tr class="memitem:a13697caf8be6275ebb7b9497c9a9d6e5" id="r_a13697caf8be6275ebb7b9497c9a9d6e5"><td class="memItemLeft" align="right" valign="top">AdjList&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a13697caf8be6275ebb7b9497c9a9d6e5">m_adjList</a></td></tr>
 <tr class="separator:a13697caf8be6275ebb7b9497c9a9d6e5"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a92a601c0ada840011e2719cb753b490b" id="r_a92a601c0ada840011e2719cb753b490b"><td class="memItemLeft" align="right" valign="top"><a id="a92a601c0ada840011e2719cb753b490b" name="a92a601c0ada840011e2719cb753b490b"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>residual_capacity</b></td></tr>
+<tr class="memitem:a92a601c0ada840011e2719cb753b490b" id="r_a92a601c0ada840011e2719cb753b490b"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a92a601c0ada840011e2719cb753b490b">residual_capacity</a></td></tr>
 <tr class="separator:a92a601c0ada840011e2719cb753b490b"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8a34b80e2f3749992e0e9b83de742fba" id="r_a8a34b80e2f3749992e0e9b83de742fba"><td class="memItemLeft" align="right" valign="top"><a id="a8a34b80e2f3749992e0e9b83de742fba" name="a8a34b80e2f3749992e0e9b83de742fba"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>capacity</b></td></tr>
+<tr class="memitem:a8a34b80e2f3749992e0e9b83de742fba" id="r_a8a34b80e2f3749992e0e9b83de742fba"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8a34b80e2f3749992e0e9b83de742fba">capacity</a></td></tr>
 <tr class="separator:a8a34b80e2f3749992e0e9b83de742fba"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae93ae98711b868af601d424954fe94ac" id="r_ae93ae98711b868af601d424954fe94ac"><td class="memItemLeft" align="right" valign="top"><a id="ae93ae98711b868af601d424954fe94ac" name="ae93ae98711b868af601d424954fe94ac"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>total_nodes</b> = 0</td></tr>
+<tr class="memitem:ae93ae98711b868af601d424954fe94ac" id="r_ae93ae98711b868af601d424954fe94ac"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae93ae98711b868af601d424954fe94ac">total_nodes</a> = 0</td></tr>
 <tr class="separator:ae93ae98711b868af601d424954fe94ac"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad621c5393837c21780ff3477431707ac" id="r_ad621c5393837c21780ff3477431707ac"><td class="memItemLeft" align="right" valign="top"><a id="ad621c5393837c21780ff3477431707ac" name="ad621c5393837c21780ff3477431707ac"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>total_edges</b> = 0</td></tr>
+<tr class="memitem:ad621c5393837c21780ff3477431707ac" id="r_ad621c5393837c21780ff3477431707ac"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad621c5393837c21780ff3477431707ac">total_edges</a> = 0</td></tr>
 <tr class="separator:ad621c5393837c21780ff3477431707ac"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a9912e31b32405d21a4c22a9ab8dece30" id="r_a9912e31b32405d21a4c22a9ab8dece30"><td class="memItemLeft" align="right" valign="top"><a id="a9912e31b32405d21a4c22a9ab8dece30" name="a9912e31b32405d21a4c22a9ab8dece30"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>source</b> = 0</td></tr>
+<tr class="memitem:a9912e31b32405d21a4c22a9ab8dece30" id="r_a9912e31b32405d21a4c22a9ab8dece30"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9912e31b32405d21a4c22a9ab8dece30">source</a> = 0</td></tr>
 <tr class="separator:a9912e31b32405d21a4c22a9ab8dece30"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a47336f7cfe4698ef887a34e03f1a3856" id="r_a47336f7cfe4698ef887a34e03f1a3856"><td class="memItemLeft" align="right" valign="top"><a id="a47336f7cfe4698ef887a34e03f1a3856" name="a47336f7cfe4698ef887a34e03f1a3856"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>sink</b> = 0</td></tr>
+<tr class="memitem:a47336f7cfe4698ef887a34e03f1a3856" id="r_a47336f7cfe4698ef887a34e03f1a3856"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a47336f7cfe4698ef887a34e03f1a3856">sink</a> = 0</td></tr>
 <tr class="separator:a47336f7cfe4698ef887a34e03f1a3856"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a9474bfdf769cc0d23f5b16c181a29431" id="r_a9474bfdf769cc0d23f5b16c181a29431"><td class="memItemLeft" align="right" valign="top"><a id="a9474bfdf769cc0d23f5b16c181a29431" name="a9474bfdf769cc0d23f5b16c181a29431"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>parent</b></td></tr>
+<tr class="memitem:a9474bfdf769cc0d23f5b16c181a29431" id="r_a9474bfdf769cc0d23f5b16c181a29431"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9474bfdf769cc0d23f5b16c181a29431">parent</a></td></tr>
 <tr class="separator:a9474bfdf769cc0d23f5b16c181a29431"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a73268574e2528b8e760191113ef6d1eb" id="r_a73268574e2528b8e760191113ef6d1eb"><td class="memItemLeft" align="right" valign="top"><a id="a73268574e2528b8e760191113ef6d1eb" name="a73268574e2528b8e760191113ef6d1eb"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">std::tuple</a>&lt; int, int, int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>edge_participated</b></td></tr>
+<tr class="memitem:a73268574e2528b8e760191113ef6d1eb" id="r_a73268574e2528b8e760191113ef6d1eb"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::tuple&lt; int, int, int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a73268574e2528b8e760191113ef6d1eb">edge_participated</a></td></tr>
 <tr class="separator:a73268574e2528b8e760191113ef6d1eb"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af1abf6ea5346e12dea4df46262ff35aa" id="r_af1abf6ea5346e12dea4df46262ff35aa"><td class="memItemLeft" align="right" valign="top"><a id="af1abf6ea5346e12dea4df46262ff35aa" name="af1abf6ea5346e12dea4df46262ff35aa"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/bitset.html">std::bitset</a>&lt; MAXN &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>visited</b></td></tr>
+<tr class="memitem:af1abf6ea5346e12dea4df46262ff35aa" id="r_af1abf6ea5346e12dea4df46262ff35aa"><td class="memItemLeft" align="right" valign="top">std::bitset&lt; MAXN &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af1abf6ea5346e12dea4df46262ff35aa">visited</a></td></tr>
 <tr class="separator:af1abf6ea5346e12dea4df46262ff35aa"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa0aaff1a0c13bdf209ea40b83ac01ae6" id="r_aa0aaff1a0c13bdf209ea40b83ac01ae6"><td class="memItemLeft" align="right" valign="top"><a id="aa0aaff1a0c13bdf209ea40b83ac01ae6" name="aa0aaff1a0c13bdf209ea40b83ac01ae6"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td></tr>
+<tr class="memitem:aa0aaff1a0c13bdf209ea40b83ac01ae6" id="r_aa0aaff1a0c13bdf209ea40b83ac01ae6"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa0aaff1a0c13bdf209ea40b83ac01ae6">max_flow</a> = 0</td></tr>
 <tr class="separator:aa0aaff1a0c13bdf209ea40b83ac01ae6"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of graph class.</p>
 <p>The graph will be represented using Adjacency List representation. This class contains 2 data members "m_vertices" &amp; "m_adjList" used to represent the number of vertices and adjacency list of the graph respectively. The vertices are labelled 0 - (m_vertices - 1). </p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html#l00014">14</a> of file <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html">bellman_ford.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="ad3b98f95ee53f91afad11b8eaddc35e0" name="ad3b98f95ee53f91afad11b8eaddc35e0"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ad3b98f95ee53f91afad11b8eaddc35e0">&#9670;&#160;</a></span>Graph() <span class="overload">[1/6]</span></h2>
@@ -253,12 +256,13 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html#l00020">20</a> of file <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html">bellman_ford.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   20</span>                        {</div>
 <div class="line"><span class="lineno">   21</span>        this-&gt;vertexNum = V;</div>
 <div class="line"><span class="lineno">   22</span>        this-&gt;edgeNum = E;</div>
-<div class="line"><span class="lineno">   23</span>        this-&gt;edges.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">reserve</a>(E);</div>
+<div class="line"><span class="lineno">   23</span>        this-&gt;edges.reserve(E);</div>
 <div class="line"><span class="lineno">   24</span>    }</div>
-<div class="ttc" id="areserve_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">std::vector::reserve</a></div><div class="ttdeci">T reserve(T... args)</div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -284,6 +288,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d31/floyd__warshall_8cpp_source.html#l00017">17</a> of file <a class="el" href="../../df/d31/floyd__warshall_8cpp_source.html">floyd_warshall.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   17</span>                 {</div>
 <div class="line"><span class="lineno">   18</span>        this-&gt;vertexNum = V;</div>
 <div class="line"><span class="lineno">   19</span>        this-&gt;edges = <span class="keyword">new</span> <span class="keywordtype">int</span> *[V];</div>
@@ -318,6 +324,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d31/floyd__warshall_8cpp_source.html#l00027">27</a> of file <a class="el" href="../../df/d31/floyd__warshall_8cpp_source.html">floyd_warshall.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   27</span>             {</div>
 <div class="line"><span class="lineno">   28</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; vertexNum; i++) {</div>
 <div class="line"><span class="lineno">   29</span>            <span class="keyword">delete</span>[] edges[i];</div>
@@ -349,6 +357,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   57</span>: m_adjList({}) {}</div>
 </div><!-- fragment -->
 </div>
@@ -370,7 +380,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">AdjList</a></td>          <td class="paramname"><span class="paramname"><em>adjList</em></span>&#160;)</td>
+          <td class="paramtype">AdjList</td>          <td class="paramname"><span class="paramname"><em>adjList</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -387,8 +397,9 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">   70</span>        : m_vertices(vertices), m_adjList(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(adjList)) {}</div>
-<div class="ttc" id="amove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></div><div class="ttdeci">T move(T... args)</div></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00069">69</a> of file <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   70</span>        : m_vertices(vertices), m_adjList(std::move(adjList)) {}</div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -409,7 +420,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">AdjList</a> &amp;&amp;</td>          <td class="paramname"><span class="paramname"><em>adjList</em></span>&#160;)</td>
+          <td class="paramtype">AdjList &amp;&amp;</td>          <td class="paramname"><span class="paramname"><em>adjList</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -426,7 +437,9 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">   78</span>        : m_vertices(vertices), m_adjList(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(adjList)) {}</div>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   78</span>        : m_vertices(vertices), m_adjList(std::move(adjList)) {}</div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -447,7 +460,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d7/d77/class_edge.html">Edge</a> &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>edges</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; <a class="el" href="../../d7/d77/class_edge.html">Edge</a> &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>edges</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -465,16 +478,17 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00089">89</a> of file <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   90</span>        : m_vertices(vertices) {</div>
 <div class="line"><span class="lineno">   91</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span>&amp; edge : edges) {</div>
 <div class="line"><span class="lineno">   92</span>            <span class="keywordflow">if</span> (edge.src &gt;= vertices || edge.dest &gt;= vertices) {</div>
-<div class="line"><span class="lineno">   93</span>                <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/range_error.html">std::range_error</a>(</div>
+<div class="line"><span class="lineno">   93</span>                <span class="keywordflow">throw</span> std::range_error(</div>
 <div class="line"><span class="lineno">   94</span>                    <span class="stringliteral">&quot;Either src or dest of edge out of range&quot;</span>);</div>
 <div class="line"><span class="lineno">   95</span>            }</div>
 <div class="line"><span class="lineno">   96</span>            m_adjList[edge.src].emplace_back(edge.dest);</div>
 <div class="line"><span class="lineno">   97</span>        }</div>
 <div class="line"><span class="lineno">   98</span>    }</div>
-<div class="ttc" id="arange_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/range_error.html">std::range_error</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -508,9 +522,11 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00125">125</a> of file <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  125</span>                                   {</div>
 <div class="line"><span class="lineno">  126</span>        <span class="keywordflow">if</span> (edge.src &gt;= m_vertices || edge.dest &gt;= m_vertices) {</div>
-<div class="line"><span class="lineno">  127</span>            <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/range_error.html">std::range_error</a>(<span class="stringliteral">&quot;Either src or dest of edge out of range&quot;</span>);</div>
+<div class="line"><span class="lineno">  127</span>            <span class="keywordflow">throw</span> std::range_error(<span class="stringliteral">&quot;Either src or dest of edge out of range&quot;</span>);</div>
 <div class="line"><span class="lineno">  128</span>        }</div>
 <div class="line"><span class="lineno">  129</span>        m_adjList[edge.src].emplace_back(edge.dest);</div>
 <div class="line"><span class="lineno">  130</span>    }</div>
@@ -548,6 +564,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html#l00027">27</a> of file <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html">bellman_ford.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   27</span>                                               {</div>
 <div class="line"><span class="lineno">   28</span>        <span class="keyword">static</span> <span class="keywordtype">int</span> edgeInd = 0;</div>
 <div class="line"><span class="lineno">   29</span>        <span class="keywordflow">if</span> (edgeInd &lt; this-&gt;edgeNum) {</div>
@@ -558,7 +576,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
 <div class="line"><span class="lineno">   34</span>            this-&gt;edges[edgeInd++] = newEdge;</div>
 <div class="line"><span class="lineno">   35</span>        }</div>
 <div class="line"><span class="lineno">   36</span>    }</div>
-<div class="ttc" id="aclass_edge_html"><div class="ttname"><a href="../../d7/d77/class_edge.html">Edge</a></div><div class="ttdef"><b>Definition</b> bellman_ford.cpp:8</div></div>
+<div class="ttc" id="aclass_edge_html"><div class="ttname"><a href="../../d7/d77/class_edge.html">Edge</a></div><div class="ttdef"><b>Definition</b> <a href="../../df/d14/bellman__ford_8cpp_source.html#l00008">bellman_ford.cpp:8</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -593,6 +611,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d31/floyd__warshall_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../df/d31/floyd__warshall_8cpp_source.html">floyd_warshall.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   35</span>                                               {</div>
 <div class="line"><span class="lineno">   36</span>        this-&gt;edges[src][dst] = weight;</div>
 <div class="line"><span class="lineno">   37</span>    }</div>
@@ -633,9 +653,11 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00137">137</a> of file <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  137</span>                                                                {</div>
 <div class="line"><span class="lineno">  138</span>        <span class="keywordflow">if</span> (source &gt;= m_vertices || destination &gt;= m_vertices) {</div>
-<div class="line"><span class="lineno">  139</span>            <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/range_error.html">std::range_error</a>(</div>
+<div class="line"><span class="lineno">  139</span>            <span class="keywordflow">throw</span> std::range_error(</div>
 <div class="line"><span class="lineno">  140</span>                <span class="stringliteral">&quot;Either source or destination of edge out of range&quot;</span>);</div>
 <div class="line"><span class="lineno">  141</span>        }</div>
 <div class="line"><span class="lineno">  142</span>        m_adjList[source].emplace_back(destination);</div>
@@ -672,6 +694,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00119">119</a> of file <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  119</span>{ m_vertices += num; }</div>
 </div><!-- fragment -->
 </div>
@@ -702,18 +726,20 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00026">26</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   26</span>                                   {  <span class="comment">//  to find the augmented - path</span></div>
-<div class="line"><span class="lineno">   27</span>        visited.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/bitset/reset.html">reset</a>();</div>
-<div class="line"><span class="lineno">   28</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue&lt;int&gt;</a> q;</div>
+<div class="line"><span class="lineno">   27</span>        visited.reset();</div>
+<div class="line"><span class="lineno">   28</span>        std::queue&lt;int&gt; q;</div>
 <div class="line"><span class="lineno">   29</span>        q.push(source);</div>
 <div class="line"><span class="lineno">   30</span>        <span class="keywordtype">bool</span> is_path_found = <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   31</span>        <span class="keywordflow">while</span> (q.empty() == <span class="keyword">false</span> &amp;&amp; is_path_found == <span class="keyword">false</span>) {</div>
 <div class="line"><span class="lineno">   32</span>            <span class="keywordtype">int</span> current_node = q.front();</div>
-<div class="line"><span class="lineno">   33</span>            visited.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/bitset/set.html">set</a>(current_node);</div>
+<div class="line"><span class="lineno">   33</span>            visited.set(current_node);</div>
 <div class="line"><span class="lineno">   34</span>            q.pop();</div>
 <div class="line"><span class="lineno">   35</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; total_nodes; ++i) {</div>
 <div class="line"><span class="lineno">   36</span>                <span class="keywordflow">if</span> (residual_capacity[current_node][i] &gt; 0 &amp;&amp; !visited[i]) {</div>
-<div class="line"><span class="lineno">   37</span>                    visited.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/bitset/set.html">set</a>(i);</div>
+<div class="line"><span class="lineno">   37</span>                    visited.set(i);</div>
 <div class="line"><span class="lineno">   38</span>                    parent[i] = current_node;</div>
 <div class="line"><span class="lineno">   39</span>                    <span class="keywordflow">if</span> (i == sink) {</div>
 <div class="line"><span class="lineno">   40</span>                        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
@@ -724,9 +750,6 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
 <div class="line"><span class="lineno">   45</span>        }</div>
 <div class="line"><span class="lineno">   46</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   47</span>    }</div>
-<div class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div></div>
-<div class="ttc" id="areset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/bitset/reset.html">std::bitset::reset</a></div><div class="ttdeci">T reset(T... args)</div></div>
-<div class="ttc" id="aset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/bitset/set.html">std::bitset::set</a></div><div class="ttdeci">T set(T... args)</div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -752,13 +775,15 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>                          {</div>
 <div class="line"><span class="lineno">   63</span>        <span class="keywordflow">while</span> (bfs(source, sink)) {</div>
 <div class="line"><span class="lineno">   64</span>            <span class="keywordtype">int</span> current_node = sink;</div>
-<div class="line"><span class="lineno">   65</span>            <span class="keywordtype">int</span> flow = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html">std::numeric_limits&lt;int&gt;::max</a>();</div>
+<div class="line"><span class="lineno">   65</span>            <span class="keywordtype">int</span> flow = std::numeric_limits&lt;int&gt;::max();</div>
 <div class="line"><span class="lineno">   66</span>            <span class="keywordflow">while</span> (current_node != source) {</div>
 <div class="line"><span class="lineno">   67</span>                <span class="keywordtype">int</span> parent_ = parent[current_node];</div>
-<div class="line"><span class="lineno">   68</span>                flow = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(flow, residual_capacity[parent_][current_node]);</div>
+<div class="line"><span class="lineno">   68</span>                flow = std::min(flow, residual_capacity[parent_][current_node]);</div>
 <div class="line"><span class="lineno">   69</span>                current_node = parent_;</div>
 <div class="line"><span class="lineno">   70</span>            }</div>
 <div class="line"><span class="lineno">   71</span>            current_node = sink;</div>
@@ -771,8 +796,6 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
 <div class="line"><span class="lineno">   78</span>            }</div>
 <div class="line"><span class="lineno">   79</span>        }</div>
 <div class="line"><span class="lineno">   80</span>    }</div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html">std::numeric_limits::max</a></div><div class="ttdeci">T max(T... args)</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><!-- fragment -->
 </div>
 </div>
@@ -786,7 +809,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/remove_reference.html">std::remove_reference</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">AdjList</a> &gt;::type const  &amp; Graph::getAdjList </td>
+          <td class="memname">std::remove_reference&lt; AdjList &gt;::type const  &amp; Graph::getAdjList </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td> const</td>
@@ -800,6 +823,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
 </div><div class="memdoc">
 <p>Return a const reference of the adjacency list.</p>
 <dl class="section return"><dt>Returns</dt><dd>const reference to the adjacency list </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00104">104</a> of file <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  104</span>                                                               {</div>
 <div class="line"><span class="lineno">  105</span>        <span class="keywordflow">return</span> m_adjList;</div>
 <div class="line"><span class="lineno">  106</span>    }</div>
@@ -829,6 +854,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
 </table>
 </div><div class="memdoc">
 <dl class="section return"><dt>Returns</dt><dd>number of vertices in the graph. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00111">111</a> of file <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  111</span>{ <span class="keywordflow">return</span> m_vertices; }</div>
 </div><!-- fragment -->
 </div>
@@ -855,32 +882,29 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00081">81</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   81</span>                           {</div>
 <div class="line"><span class="lineno">   82</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; total_nodes; ++i) {</div>
 <div class="line"><span class="lineno">   83</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; total_nodes; ++j) {</div>
 <div class="line"><span class="lineno">   84</span>                <span class="keywordflow">if</span> (capacity[i][j] &amp;&amp;</div>
 <div class="line"><span class="lineno">   85</span>                    residual_capacity[i][j] &lt; capacity[i][j]) {</div>
-<div class="line"><span class="lineno">   86</span>                    edge_participated.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html">std::make_tuple</a>(</div>
+<div class="line"><span class="lineno">   86</span>                    edge_participated.emplace_back(std::make_tuple(</div>
 <div class="line"><span class="lineno">   87</span>                        i, j, capacity[i][j] - residual_capacity[i][j]));</div>
 <div class="line"><span class="lineno">   88</span>                }</div>
 <div class="line"><span class="lineno">   89</span>            }</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/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nNodes : &quot;</span> &lt;&lt; total_nodes &lt;&lt; <span class="stringliteral">&quot;\nMax flow: &quot;</span> &lt;&lt; max_flow</div>
-<div class="line"><span class="lineno">   92</span>                  &lt;&lt; <span class="stringliteral">&quot;\nEdge present in flow: &quot;</span> &lt;&lt; edge_participated.<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">   91</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nNodes : &quot;</span> &lt;&lt; total_nodes &lt;&lt; <span class="stringliteral">&quot;\nMax flow: &quot;</span> &lt;&lt; max_flow</div>
+<div class="line"><span class="lineno">   92</span>                  &lt;&lt; <span class="stringliteral">&quot;\nEdge present in flow: &quot;</span> &lt;&lt; edge_participated.size()</div>
 <div class="line"><span class="lineno">   93</span>                  &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
-<div class="line"><span class="lineno">   94</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nSource\tDestination\tCapacity\total_nodes&quot;</span>;</div>
+<div class="line"><span class="lineno">   94</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nSource\tDestination\tCapacity\total_nodes&quot;</span>;</div>
 <div class="line"><span class="lineno">   95</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; edge_data : edge_participated) {</div>
 <div class="line"><span class="lineno">   96</span>            <span class="keywordtype">int</span> source = 0, destination = 0, capacity_ = 0;</div>
-<div class="line"><span class="lineno">   97</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a>(source, destination, capacity_) = edge_data;</div>
-<div class="line"><span class="lineno">   98</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; source &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; destination &lt;&lt; <span class="stringliteral">&quot;\t\t&quot;</span> &lt;&lt; capacity_</div>
+<div class="line"><span class="lineno">   97</span>            std::tie(source, destination, capacity_) = edge_data;</div>
+<div class="line"><span class="lineno">   98</span>            std::cout &lt;&lt; source &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; destination &lt;&lt; <span class="stringliteral">&quot;\t\t&quot;</span> &lt;&lt; capacity_</div>
 <div class="line"><span class="lineno">   99</span>                      &lt;&lt; <span class="charliteral">&#39;\t&#39;</span>;</div>
 <div class="line"><span class="lineno">  100</span>        }</div>
 <div class="line"><span class="lineno">  101</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="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div>
-<div class="ttc" id="amake_tuple_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html">std::make_tuple</a></div><div class="ttdeci">T make_tuple(T... args)</div></div>
-<div class="ttc" id="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="atie_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/tuple/tie.html">std::tie</a></div><div class="ttdeci">T tie(T... args)</div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -906,28 +930,381 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow</b> = 0</td><
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00050">50</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   50</span>                     {</div>
-<div class="line"><span class="lineno">   51</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; total_nodes &gt;&gt; total_edges &gt;&gt; source &gt;&gt; sink;</div>
-<div class="line"><span class="lineno">   52</span>        parent = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(total_nodes, -1);</div>
-<div class="line"><span class="lineno">   53</span>        capacity = residual_capacity = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;int&gt;</a> &gt;(</div>
-<div class="line"><span class="lineno">   54</span>            total_nodes, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(total_nodes));</div>
+<div class="line"><span class="lineno">   51</span>        std::cin &gt;&gt; total_nodes &gt;&gt; total_edges &gt;&gt; source &gt;&gt; sink;</div>
+<div class="line"><span class="lineno">   52</span>        parent = std::vector&lt;int&gt;(total_nodes, -1);</div>
+<div class="line"><span class="lineno">   53</span>        capacity = residual_capacity = std::vector&lt;std::vector&lt;int&gt; &gt;(</div>
+<div class="line"><span class="lineno">   54</span>            total_nodes, std::vector&lt;int&gt;(total_nodes));</div>
 <div class="line"><span class="lineno">   55</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> start = 0, destination = 0, capacity_ = 0, i = 0;</div>
 <div class="line"><span class="lineno">   56</span>             i &lt; total_edges; ++i) {</div>
-<div class="line"><span class="lineno">   57</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; start &gt;&gt; destination &gt;&gt; capacity_;</div>
+<div class="line"><span class="lineno">   57</span>            std::cin &gt;&gt; start &gt;&gt; destination &gt;&gt; capacity_;</div>
 <div class="line"><span class="lineno">   58</span>            residual_capacity[start][destination] = capacity_;</div>
 <div class="line"><span class="lineno">   59</span>            capacity[start][destination] = capacity_;</div>
 <div class="line"><span class="lineno">   60</span>        }</div>
 <div class="line"><span class="lineno">   61</span>    }</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></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>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a8a34b80e2f3749992e0e9b83de742fba" name="a8a34b80e2f3749992e0e9b83de742fba"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a8a34b80e2f3749992e0e9b83de742fba">&#9670;&#160;</a></span>capacity</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::vector&lt;int&gt; &gt; Graph::capacity</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00019">19</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a73268574e2528b8e760191113ef6d1eb" name="a73268574e2528b8e760191113ef6d1eb"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a73268574e2528b8e760191113ef6d1eb">&#9670;&#160;</a></span>edge_participated</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::tuple&lt;int, int, int&gt; &gt; Graph::edge_participated</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00023">23</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a10ff9c6c323cf435f18e424dbb62235e" name="a10ff9c6c323cf435f18e424dbb62235e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a10ff9c6c323cf435f18e424dbb62235e">&#9670;&#160;</a></span>edgeNum</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int Graph::edgeNum</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html#l00016">16</a> of file <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html">bellman_ford.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a28d19ea9c7d111f55fee78331abe88bd" name="a28d19ea9c7d111f55fee78331abe88bd"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a28d19ea9c7d111f55fee78331abe88bd">&#9670;&#160;</a></span>edges <span class="overload">[1/2]</span></h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;<a class="el" href="../../d7/d77/class_edge.html">Edge</a>&gt; Graph::edges</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html#l00017">17</a> of file <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html">bellman_ford.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a268ba18d421817ad8713c2e92f19d82a" name="a268ba18d421817ad8713c2e92f19d82a"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a268ba18d421817ad8713c2e92f19d82a">&#9670;&#160;</a></span>edges <span class="overload">[2/2]</span></h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int** Graph::edges</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d31/floyd__warshall_8cpp_source.html#l00014">14</a> of file <a class="el" href="../../df/d31/floyd__warshall_8cpp_source.html">floyd_warshall.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a13697caf8be6275ebb7b9497c9a9d6e5" name="a13697caf8be6275ebb7b9497c9a9d6e5"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a13697caf8be6275ebb7b9497c9a9d6e5">&#9670;&#160;</a></span>m_adjList</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">AdjList Graph::m_adjList</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00147">147</a> of file <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a61943646676002a5e75f7b6493c25713" name="a61943646676002a5e75f7b6493c25713"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a61943646676002a5e75f7b6493c25713">&#9670;&#160;</a></span>m_vertices</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">unsigned int Graph::m_vertices = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html#l00146">146</a> of file <a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a>.</p>
+
+</div>
+</div>
+<a id="aa0aaff1a0c13bdf209ea40b83ac01ae6" name="aa0aaff1a0c13bdf209ea40b83ac01ae6"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aa0aaff1a0c13bdf209ea40b83ac01ae6">&#9670;&#160;</a></span>max_flow</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int Graph::max_flow = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00025">25</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a9474bfdf769cc0d23f5b16c181a29431" name="a9474bfdf769cc0d23f5b16c181a29431"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a9474bfdf769cc0d23f5b16c181a29431">&#9670;&#160;</a></span>parent</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;int&gt; Graph::parent</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00022">22</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a92a601c0ada840011e2719cb753b490b" name="a92a601c0ada840011e2719cb753b490b"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a92a601c0ada840011e2719cb753b490b">&#9670;&#160;</a></span>residual_capacity</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::vector&lt;int&gt; &gt; Graph::residual_capacity</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00019">19</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a47336f7cfe4698ef887a34e03f1a3856" name="a47336f7cfe4698ef887a34e03f1a3856"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a47336f7cfe4698ef887a34e03f1a3856">&#9670;&#160;</a></span>sink</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int Graph::sink = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00021">21</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a9912e31b32405d21a4c22a9ab8dece30" name="a9912e31b32405d21a4c22a9ab8dece30"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a9912e31b32405d21a4c22a9ab8dece30">&#9670;&#160;</a></span>source</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int Graph::source = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00021">21</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ad621c5393837c21780ff3477431707ac" name="ad621c5393837c21780ff3477431707ac"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ad621c5393837c21780ff3477431707ac">&#9670;&#160;</a></span>total_edges</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int Graph::total_edges = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00021">21</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ae93ae98711b868af601d424954fe94ac" name="ae93ae98711b868af601d424954fe94ac"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ae93ae98711b868af601d424954fe94ac">&#9670;&#160;</a></span>total_nodes</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int Graph::total_nodes = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00020">20</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a6afcd41564ea00294a4c089414979ca1" name="a6afcd41564ea00294a4c089414979ca1"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a6afcd41564ea00294a4c089414979ca1">&#9670;&#160;</a></span>vertexNum</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int Graph::vertexNum</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html#l00016">16</a> of file <a class="el" href="../../df/d14/bellman__ford_8cpp_source.html">bellman_ford.cpp</a>.</p>
+
+</div>
+</div>
+<a id="af1abf6ea5346e12dea4df46262ff35aa" name="af1abf6ea5346e12dea4df46262ff35aa"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#af1abf6ea5346e12dea4df46262ff35aa">&#9670;&#160;</a></span>visited</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::bitset&lt;MAXN&gt; Graph::visited</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html#l00024">24</a> of file <a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following files:<ul>
-<li>dynamic_programming/<b>bellman_ford.cpp</b></li>
-<li>dynamic_programming/<b>floyd_warshall.cpp</b></li>
-<li>graph/<b>cycle_check_directed_graph.cpp</b></li>
-<li>graph/<b>max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</b></li>
+<li>dynamic_programming/<a class="el" href="../../df/d14/bellman__ford_8cpp_source.html">bellman_ford.cpp</a></li>
+<li>dynamic_programming/<a class="el" href="../../df/d31/floyd__warshall_8cpp_source.html">floyd_warshall.cpp</a></li>
+<li>graph/<a class="el" href="../../d3/dec/cycle__check__directed__graph_8cpp_source.html">cycle_check_directed_graph.cpp</a></li>
+<li>graph/<a class="el" href="../../d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html">max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/da/d9a/palindrome__of__number_8cpp.html b/da/d9a/palindrome__of__number_8cpp.html
index 85860e5c1..fcff7acbd 100644
--- a/da/d9a/palindrome__of__number_8cpp.html
+++ b/da/d9a/palindrome__of__number_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/palindrome_of_number.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/palindrome_of_number.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for palindrome_of_number.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d6c/palindrome__of__number_8cpp__incl.svg" width="266" height="126"><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">
+</div>
+<p><a href="../../da/d9a/palindrome__of__number_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
@@ -128,7 +147,9 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Check if a number is <a href="https://en.wikipedia.org/wiki/Palindrome" target="_blank">palindrome</a> or not. </p>
-<p>This program cheats by using the STL library's <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a> function. </p>
+<p>This program cheats by using the STL library's std::reverse function. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../da/d9a/palindrome__of__number_8cpp_source.html">palindrome_of_number.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -145,36 +166,26 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d9a/palindrome__of__number_8cpp_source.html#l00019">19</a> of file <a class="el" href="../../da/d9a/palindrome__of__number_8cpp_source.html">palindrome_of_number.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   19</span>           {</div>
 <div class="line"><span class="lineno">   20</span>    <span class="keywordtype">int</span> num;</div>
-<div class="line"><span class="lineno">   21</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter number = &quot;</span>;</div>
-<div class="line"><span class="lineno">   22</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; num;</div>
+<div class="line"><span class="lineno">   21</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter number = &quot;</span>;</div>
+<div class="line"><span class="lineno">   22</span>    std::cin &gt;&gt; num;</div>
 <div class="line"><span class="lineno">   23</span> </div>
-<div class="line"><span class="lineno">   24</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s1 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html">std::to_string</a>(num);  <span class="comment">// convert number to string</span></div>
-<div class="line"><span class="lineno">   25</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s2 = s1;</div>
+<div class="line"><span class="lineno">   24</span>    std::string s1 = std::to_string(num);  <span class="comment">// convert number to string</span></div>
+<div class="line"><span class="lineno">   25</span>    std::string s2 = s1;</div>
 <div class="line"><span class="lineno">   26</span> </div>
-<div class="line"><span class="lineno">   27</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a>(s1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">begin</a>(), s1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">end</a>());  <span class="comment">// reverse the string</span></div>
+<div class="line"><span class="lineno">   27</span>    std::reverse(s1.begin(), s1.end());  <span class="comment">// reverse the string</span></div>
 <div class="line"><span class="lineno">   28</span> </div>
 <div class="line"><span class="lineno">   29</span>    <span class="keywordflow">if</span> (s1 == s2)  <span class="comment">// check if reverse and original string are identical</span></div>
-<div class="line"><span class="lineno">   30</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;true&quot;</span>;</div>
+<div class="line"><span class="lineno">   30</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;true&quot;</span>;</div>
 <div class="line"><span class="lineno">   31</span>    <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">   32</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;false&quot;</span>;</div>
+<div class="line"><span class="lineno">   32</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;false&quot;</span>;</div>
 <div class="line"><span class="lineno">   33</span> </div>
 <div class="line"><span class="lineno">   34</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   35</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">std::string::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">std::string::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="areverse_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a></div><div class="ttdeci">T reverse(T... args)</div></div>
-<div class="ttc" id="ato_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html">std::to_string</a></div><div class="ttdeci">T to_string(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="227" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 709731982..000000000
--- a/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,80,55,106"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/begin.html#" title=" " alt="" coords="103,5,221,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="46,77,101,40,109,36,112,40,104,44,49,82"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/end.html#" title=" " alt="" coords="108,55,216,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,86,92,78,93,83,56,91"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/reverse.html#" title=" " alt="" coords="117,104,207,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,95,102,103,101,108,55,100"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/to_string.html#" title=" " alt="" coords="113,153,210,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="50,104,104,140,112,144,110,149,101,144,47,108"/>
-</map>
diff --git a/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 0c77e9a30..000000000
--- a/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8b3ffd359f6b81b12f68efabfaba789a
\ No newline at end of file
diff --git a/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 146337fbf..000000000
--- a/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="170pt" height="138pt"
- viewBox="0.00 0.00 169.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161.75,-130.25 73,-130.25 73,-111 161.75,-111 161.75,-130.25"/>
-<text text-anchor="middle" x="117.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.73,-74.52C42.25,-82.73 58.05,-94.35 73,-102.62 74.93,-103.69 76.93,-104.73 78.97,-105.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.4,-108.87 87.95,-109.87 80.32,-102.51 77.4,-108.87"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158,-93.25 76.75,-93.25 76.75,-74 158,-74 158,-93.25"/>
-<text text-anchor="middle" x="117.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.27,-68.11C45.37,-69.7 55.42,-71.67 65.61,-73.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.66,-77.05 75.14,-75.54 66,-70.18 64.66,-77.05"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.25,-56.25 83.5,-56.25 83.5,-37 151.25,-37 151.25,-56.25"/>
-<text text-anchor="middle" x="117.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.27,-61.32C47.05,-59.51 59.68,-57.16 71.95,-54.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.36,-58.36 81.55,-53.1 71.08,-51.48 72.36,-58.36"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="153.88,-19.25 80.88,-19.25 80.88,0 153.88,0 153.88,-19.25"/>
-<text text-anchor="middle" x="117.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::to_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.2,-54.7C42.74,-46.74 58.33,-35.63 73,-27.62 75.07,-26.5 77.22,-25.39 79.42,-24.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.78,-27.55 88.43,-20.23 77.88,-21.18 80.78,-27.55"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 1cff1499a..000000000
--- a/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="170pt" height="138pt"
- viewBox="0.00 0.00 169.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161.75,-130.25 73,-130.25 73,-111 161.75,-111 161.75,-130.25"/>
-<text text-anchor="middle" x="117.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.73,-74.52C42.25,-82.73 58.05,-94.35 73,-102.62 74.93,-103.69 76.93,-104.73 78.97,-105.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.4,-108.87 87.95,-109.87 80.32,-102.51 77.4,-108.87"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158,-93.25 76.75,-93.25 76.75,-74 158,-74 158,-93.25"/>
-<text text-anchor="middle" x="117.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.27,-68.11C45.37,-69.7 55.42,-71.67 65.61,-73.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.66,-77.05 75.14,-75.54 66,-70.18 64.66,-77.05"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.25,-56.25 83.5,-56.25 83.5,-37 151.25,-37 151.25,-56.25"/>
-<text text-anchor="middle" x="117.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.27,-61.32C47.05,-59.51 59.68,-57.16 71.95,-54.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.36,-58.36 81.55,-53.1 71.08,-51.48 72.36,-58.36"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="153.88,-19.25 80.88,-19.25 80.88,0 153.88,0 153.88,-19.25"/>
-<text text-anchor="middle" x="117.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::to_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.2,-54.7C42.74,-46.74 58.33,-35.63 73,-27.62 75.07,-26.5 77.22,-25.39 79.42,-24.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.78,-27.55 88.43,-20.23 77.88,-21.18 80.78,-27.55"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/d9a/palindrome__of__number_8cpp_source.html b/da/d9a/palindrome__of__number_8cpp_source.html
new file mode 100644
index 000000000..6cee17be6
--- /dev/null
+++ b/da/d9a/palindrome__of__number_8cpp_source.html
@@ -0,0 +1,168 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/palindrome_of_number.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/d9a/palindrome__of__number_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">palindrome_of_number.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/d9a/palindrome__of__number_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#ifdef _MSC_VER</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment">// Required to compile std::toString function using MSVC</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;string&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
+<div class="foldopen" id="foldopen00019" data-start="{" data-end="}">
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"><a class="line" href="../../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   19</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="keywordtype">int</span> num;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter number = &quot;</span>;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    std::cin &gt;&gt; num;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    std::string s1 = std::to_string(num);  <span class="comment">// convert number to string</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    std::string s2 = s1;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    std::reverse(s1.begin(), s1.end());  <span class="comment">// reverse the string</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordflow">if</span> (s1 == s2)  <span class="comment">// check if reverse and original string are identical</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;true&quot;</span>;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;false&quot;</span>;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>}</div>
+</div>
+<div class="ttc" id="apalindrome__of__number_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00019">palindrome_of_number.cpp:19</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../da/d9a/palindrome__of__number_8cpp.html">palindrome_of_number.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/d9c/namespacegames.html b/da/d9c/namespacegames.html
index 02cc8d4af..27b29c779 100644
--- a/da/d9c/namespacegames.html
+++ b/da/d9c/namespacegames.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: games Namespace Reference</title>
+<title>TheAlgorithms/C++: games Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/da/da2/node_8hpp__dep__incl.map b/da/da2/node_8hpp__dep__incl.map
index abe573173..4d56083f4 100644
--- a/da/da2/node_8hpp__dep__incl.map
+++ b/da/da2/node_8hpp__dep__incl.map
@@ -2,6 +2,12 @@
 <area shape="rect" id="Node000001" title="Provides Node class and related utilities." alt="" coords="108,5,276,31"/>
 <area shape="rect" id="Node000002" href="$d7/ded/queue_8hpp_source.html" title=" " alt="" coords="5,79,181,105"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="164,43,111,81,108,76,161,38"/>
-<area shape="rect" id="Node000003" href="$df/d47/stack_8hpp.html" title="This class specifies the basic operation on a stack as a linked list." alt="" coords="204,79,376,105"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="222,38,275,76,272,81,219,43"/>
+<area shape="rect" id="Node000004" href="$df/d47/stack_8hpp.html" title="This class specifies the basic operation on a stack as a linked list." alt="" coords="204,79,376,105"/>
+<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="222,38,275,76,272,81,219,43"/>
+<area shape="rect" id="Node000003" href="$d8/dce/test__queue_8cpp_source.html" title=" " alt="" coords="24,153,162,193"/>
+<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="96,120,96,152,90,152,90,120"/>
+<area shape="rect" id="Node000005" href="$d9/dbf/test__stack_8cpp_source.html" title=" " alt="" coords="203,153,340,193"/>
+<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="287,120,279,153,274,152,281,119"/>
+<area shape="rect" id="Node000006" href="$db/dbd/test__stack__students_8cpp_source.html" title=" " alt="" coords="364,153,507,193"/>
+<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="327,110,401,150,399,155,324,114"/>
 </map>
diff --git a/da/da2/node_8hpp__dep__incl.md5 b/da/da2/node_8hpp__dep__incl.md5
index 58897071a..661f618c3 100644
--- a/da/da2/node_8hpp__dep__incl.md5
+++ b/da/da2/node_8hpp__dep__incl.md5
@@ -1 +1 @@
-79e3f55fe94bb7ad05ca1e929505dbca
\ No newline at end of file
+9b10195edfcc8863bd26549b2ef7edbe
\ No newline at end of file
diff --git a/da/da2/node_8hpp__dep__incl.svg b/da/da2/node_8hpp__dep__incl.svg
index 756f18d19..5ae3f5b0d 100644
--- a/da/da2/node_8hpp__dep__incl.svg
+++ b/da/da2/node_8hpp__dep__incl.svg
@@ -4,8 +4,8 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: data_structures/node.hpp Pages: 1 -->
-<svg width="286pt" height="83pt"
- viewBox="0.00 0.00 286.38 82.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="384pt" height="149pt"
+ viewBox="0.00 0.00 384.12 149.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
 <svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
@@ -17,14 +17,14 @@
 ]]></style>
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
 <svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.5)">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 145)">
 <title>data_structures/node.hpp</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="Provides Node class and related utilities.">
-<polygon fill="#999999" stroke="#666666" points="202.88,-74.5 76.62,-74.5 76.62,-55.25 202.88,-55.25 202.88,-74.5"/>
-<text text-anchor="middle" x="139.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/node.hpp</text>
+<polygon fill="#999999" stroke="#666666" points="202.88,-141 76.62,-141 76.62,-121.75 202.88,-121.75 202.88,-141"/>
+<text text-anchor="middle" x="139.75" y="-127.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/node.hpp</text>
 </a>
 </g>
 </g>
@@ -32,8 +32,8 @@
 <g id="Node000002" class="node">
 <title>Node2</title>
 <g id="a_Node000002"><a xlink:href="../../d7/ded/queue_8hpp_source.html" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="131.5,-19.25 0,-19.25 0,0 131.5,0 131.5,-19.25"/>
-<text text-anchor="middle" x="65.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/queue.hpp</text>
+<polygon fill="white" stroke="#666666" points="131.5,-85.75 0,-85.75 0,-66.5 131.5,-66.5 131.5,-85.75"/>
+<text text-anchor="middle" x="65.75" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/queue.hpp</text>
 </a>
 </g>
 </g>
@@ -41,26 +41,83 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node1&#45;&gt;Node2</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.99,-48.22C105,-38.87 88.97,-27.33 78.12,-19.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.81,-50.96 125.97,-53.96 119.9,-45.28 115.81,-50.96"/>
+<path fill="none" stroke="#63b8ff" d="M117.99,-114.72C105,-105.37 88.97,-93.83 78.12,-86.02"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="115.81,-117.46 125.97,-120.46 119.9,-111.78 115.81,-117.46"/>
+</a>
+</g>
+</g>
+<!-- Node4 -->
+<g id="Node000004" class="node">
+<title>Node4</title>
+<g id="a_Node000004"><a xlink:href="../../df/d47/stack_8hpp.html" target="_top" xlink:title="This class specifies the basic operation on a stack as a linked list.">
+<polygon fill="white" stroke="#666666" points="278.38,-85.75 149.12,-85.75 149.12,-66.5 278.38,-66.5 278.38,-85.75"/>
+<text text-anchor="middle" x="213.75" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/stack.hpp</text>
+</a>
+</g>
+</g>
+<!-- Node1&#45;&gt;Node4 -->
+<g id="edge3_Node000001_Node000004" class="edge">
+<title>Node1&#45;&gt;Node4</title>
+<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
+<path fill="none" stroke="#63b8ff" d="M161.51,-114.72C174.5,-105.37 190.53,-93.83 201.38,-86.02"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="159.6,-111.78 153.53,-120.46 163.69,-117.46 159.6,-111.78"/>
 </a>
 </g>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/d47/stack_8hpp.html" target="_top" xlink:title="This class specifies the basic operation on a stack as a linked list.">
-<polygon fill="white" stroke="#666666" points="278.38,-19.25 149.12,-19.25 149.12,0 278.38,0 278.38,-19.25"/>
-<text text-anchor="middle" x="213.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/stack.hpp</text>
+<g id="a_Node000003"><a xlink:href="../../d8/dce/test__queue_8cpp_source.html" target="_top" xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="117.25,-30.5 14.25,-30.5 14.25,0 117.25,0 117.25,-30.5"/>
+<text text-anchor="start" x="22.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/test</text>
+<text text-anchor="middle" x="65.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_queue.cpp</text>
 </a>
 </g>
 </g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.51,-48.22C174.5,-38.87 190.53,-27.33 201.38,-19.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.6,-45.28 153.53,-53.96 163.69,-50.96 159.6,-45.28"/>
+<!-- Node2&#45;&gt;Node3 -->
+<g id="edge2_Node000002_Node000003" class="edge">
+<title>Node2&#45;&gt;Node3</title>
+<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
+<path fill="none" stroke="#63b8ff" d="M65.75,-54.92C65.75,-46.99 65.75,-38.06 65.75,-30.78"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="62.25,-54.67 65.75,-64.67 69.25,-54.67 62.25,-54.67"/>
+</a>
+</g>
+</g>
+<!-- Node5 -->
+<g id="Node000005" class="node">
+<title>Node5</title>
+<g id="a_Node000005"><a xlink:href="../../d9/dbf/test__stack_8cpp_source.html" target="_top" xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="251.25,-30.5 148.25,-30.5 148.25,0 251.25,0 251.25,-30.5"/>
+<text text-anchor="start" x="156.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/test</text>
+<text text-anchor="middle" x="199.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_stack.cpp</text>
+</a>
+</g>
+</g>
+<!-- Node4&#45;&gt;Node5 -->
+<g id="edge4_Node000004_Node000005" class="edge">
+<title>Node4&#45;&gt;Node5</title>
+<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
+<path fill="none" stroke="#63b8ff" d="M209.01,-55.2C207.11,-47.2 204.96,-38.15 203.21,-30.78"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="205.56,-55.79 211.27,-64.71 212.37,-54.17 205.56,-55.79"/>
+</a>
+</g>
+</g>
+<!-- Node6 -->
+<g id="Node000006" class="node">
+<title>Node6</title>
+<g id="a_Node000006"><a xlink:href="../../db/dbd/test__stack__students_8cpp_source.html" target="_top" xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="376.12,-30.5 269.38,-30.5 269.38,0 376.12,0 376.12,-30.5"/>
+<text text-anchor="start" x="277.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/test</text>
+<text text-anchor="middle" x="322.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_stack_students.cpp</text>
+</a>
+</g>
+</g>
+<!-- Node4&#45;&gt;Node6 -->
+<g id="edge5_Node000004_Node000006" class="edge">
+<title>Node4&#45;&gt;Node6</title>
+<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
+<path fill="none" stroke="#63b8ff" d="M240.09,-60.9C256.98,-51.77 278.85,-39.96 295.85,-30.78"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="238.77,-57.63 231.64,-65.46 242.1,-63.79 238.77,-57.63"/>
 </a>
 </g>
 </g>
diff --git a/da/da2/node_8hpp__dep__incl_org.svg b/da/da2/node_8hpp__dep__incl_org.svg
index fa9779e6c..46ec185d5 100644
--- a/da/da2/node_8hpp__dep__incl_org.svg
+++ b/da/da2/node_8hpp__dep__incl_org.svg
@@ -4,16 +4,16 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: data_structures/node.hpp Pages: 1 -->
-<svg width="286pt" height="83pt"
- viewBox="0.00 0.00 286.38 82.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.5)">
+<svg width="384pt" height="149pt"
+ viewBox="0.00 0.00 384.12 149.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 145)">
 <title>data_structures/node.hpp</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="Provides Node class and related utilities.">
-<polygon fill="#999999" stroke="#666666" points="202.88,-74.5 76.62,-74.5 76.62,-55.25 202.88,-55.25 202.88,-74.5"/>
-<text text-anchor="middle" x="139.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/node.hpp</text>
+<polygon fill="#999999" stroke="#666666" points="202.88,-141 76.62,-141 76.62,-121.75 202.88,-121.75 202.88,-141"/>
+<text text-anchor="middle" x="139.75" y="-127.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/node.hpp</text>
 </a>
 </g>
 </g>
@@ -21,8 +21,8 @@
 <g id="Node000002" class="node">
 <title>Node2</title>
 <g id="a_Node000002"><a xlink:href="../../d7/ded/queue_8hpp_source.html" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="131.5,-19.25 0,-19.25 0,0 131.5,0 131.5,-19.25"/>
-<text text-anchor="middle" x="65.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/queue.hpp</text>
+<polygon fill="white" stroke="#666666" points="131.5,-85.75 0,-85.75 0,-66.5 131.5,-66.5 131.5,-85.75"/>
+<text text-anchor="middle" x="65.75" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/queue.hpp</text>
 </a>
 </g>
 </g>
@@ -30,26 +30,83 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node1&#45;&gt;Node2</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.99,-48.22C105,-38.87 88.97,-27.33 78.12,-19.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.81,-50.96 125.97,-53.96 119.9,-45.28 115.81,-50.96"/>
+<path fill="none" stroke="#63b8ff" d="M117.99,-114.72C105,-105.37 88.97,-93.83 78.12,-86.02"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="115.81,-117.46 125.97,-120.46 119.9,-111.78 115.81,-117.46"/>
+</a>
+</g>
+</g>
+<!-- Node4 -->
+<g id="Node000004" class="node">
+<title>Node4</title>
+<g id="a_Node000004"><a xlink:href="../../df/d47/stack_8hpp.html" target="_top" xlink:title="This class specifies the basic operation on a stack as a linked list.">
+<polygon fill="white" stroke="#666666" points="278.38,-85.75 149.12,-85.75 149.12,-66.5 278.38,-66.5 278.38,-85.75"/>
+<text text-anchor="middle" x="213.75" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/stack.hpp</text>
+</a>
+</g>
+</g>
+<!-- Node1&#45;&gt;Node4 -->
+<g id="edge3_Node000001_Node000004" class="edge">
+<title>Node1&#45;&gt;Node4</title>
+<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
+<path fill="none" stroke="#63b8ff" d="M161.51,-114.72C174.5,-105.37 190.53,-93.83 201.38,-86.02"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="159.6,-111.78 153.53,-120.46 163.69,-117.46 159.6,-111.78"/>
 </a>
 </g>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/d47/stack_8hpp.html" target="_top" xlink:title="This class specifies the basic operation on a stack as a linked list.">
-<polygon fill="white" stroke="#666666" points="278.38,-19.25 149.12,-19.25 149.12,0 278.38,0 278.38,-19.25"/>
-<text text-anchor="middle" x="213.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/stack.hpp</text>
+<g id="a_Node000003"><a xlink:href="../../d8/dce/test__queue_8cpp_source.html" target="_top" xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="117.25,-30.5 14.25,-30.5 14.25,0 117.25,0 117.25,-30.5"/>
+<text text-anchor="start" x="22.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/test</text>
+<text text-anchor="middle" x="65.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_queue.cpp</text>
 </a>
 </g>
 </g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.51,-48.22C174.5,-38.87 190.53,-27.33 201.38,-19.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.6,-45.28 153.53,-53.96 163.69,-50.96 159.6,-45.28"/>
+<!-- Node2&#45;&gt;Node3 -->
+<g id="edge2_Node000002_Node000003" class="edge">
+<title>Node2&#45;&gt;Node3</title>
+<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
+<path fill="none" stroke="#63b8ff" d="M65.75,-54.92C65.75,-46.99 65.75,-38.06 65.75,-30.78"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="62.25,-54.67 65.75,-64.67 69.25,-54.67 62.25,-54.67"/>
+</a>
+</g>
+</g>
+<!-- Node5 -->
+<g id="Node000005" class="node">
+<title>Node5</title>
+<g id="a_Node000005"><a xlink:href="../../d9/dbf/test__stack_8cpp_source.html" target="_top" xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="251.25,-30.5 148.25,-30.5 148.25,0 251.25,0 251.25,-30.5"/>
+<text text-anchor="start" x="156.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/test</text>
+<text text-anchor="middle" x="199.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_stack.cpp</text>
+</a>
+</g>
+</g>
+<!-- Node4&#45;&gt;Node5 -->
+<g id="edge4_Node000004_Node000005" class="edge">
+<title>Node4&#45;&gt;Node5</title>
+<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
+<path fill="none" stroke="#63b8ff" d="M209.01,-55.2C207.11,-47.2 204.96,-38.15 203.21,-30.78"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="205.56,-55.79 211.27,-64.71 212.37,-54.17 205.56,-55.79"/>
+</a>
+</g>
+</g>
+<!-- Node6 -->
+<g id="Node000006" class="node">
+<title>Node6</title>
+<g id="a_Node000006"><a xlink:href="../../db/dbd/test__stack__students_8cpp_source.html" target="_top" xlink:title=" ">
+<polygon fill="white" stroke="#666666" points="376.12,-30.5 269.38,-30.5 269.38,0 376.12,0 376.12,-30.5"/>
+<text text-anchor="start" x="277.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/test</text>
+<text text-anchor="middle" x="322.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_stack_students.cpp</text>
+</a>
+</g>
+</g>
+<!-- Node4&#45;&gt;Node6 -->
+<g id="edge5_Node000004_Node000006" class="edge">
+<title>Node4&#45;&gt;Node6</title>
+<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
+<path fill="none" stroke="#63b8ff" d="M240.09,-60.9C256.98,-51.77 278.85,-39.96 295.85,-30.78"/>
+<polygon fill="#63b8ff" stroke="#63b8ff" points="238.77,-57.63 231.64,-65.46 242.1,-63.79 238.77,-57.63"/>
 </a>
 </g>
 </g>
diff --git a/da/da3/uint256__t_8hpp.html b/da/da3/uint256__t_8hpp.html
index 21f23f8bc..555f2b6d0 100644
--- a/da/da3/uint256__t_8hpp.html
+++ b/da/da3/uint256__t_8hpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ciphers/uint256_t.hpp File Reference</title>
+<title>TheAlgorithms/C++: ciphers/uint256_t.hpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -142,7 +159,7 @@ Classes</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="define-members" name="define-members"></a>
 Macros</h2></td></tr>
 <tr class="memitem:a1d8c5ec5b5e419c5c8a740251485102c" id="r_a1d8c5ec5b5e419c5c8a740251485102c"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1d8c5ec5b5e419c5c8a740251485102c">CIPHERS_UINT256_T_HPP_</a></td></tr>
-<tr class="memdesc:a1d8c5ec5b5e419c5c8a740251485102c"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></code> library  <br /></td></tr>
+<tr class="memdesc:a1d8c5ec5b5e419c5c8a740251485102c"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <code>std::pair</code> library  <br /></td></tr>
 <tr class="separator:a1d8c5ec5b5e419c5c8a740251485102c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
@@ -199,6 +216,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of 256-bit unsigned integers. </p><dl class="section note"><dt>Note</dt><dd>The implementation can be flagged as not completed. This header is used with enough operations to demonstrate the usage of ECDH (Elliptic Curve Diffie-Hellman) Key exchange. </dd></dl>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AshishYUO" target="_blank">Ashish Daulatabad</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 </div><h2 class="groupheader">Macro Definition Documentation</h2>
 <a id="a1d8c5ec5b5e419c5c8a740251485102c" name="a1d8c5ec5b5e419c5c8a740251485102c"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a1d8c5ec5b5e419c5c8a740251485102c">&#9670;&#160;</a></span>CIPHERS_UINT256_T_HPP_</h2>
@@ -212,8 +231,10 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 
-<p>for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></code> library </p>
-<p>for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></code> for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> integer </p>
+<p>for <code>std::pair</code> library </p>
+<p>for <code>std::string</code> for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> integer </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00016">16</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 
 </div>
 </div>
@@ -246,10 +267,12 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l01046">1046</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1046</span>                                                      {</div>
 <div class="line"><span class="lineno"> 1047</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) != q;</div>
 <div class="line"><span class="lineno"> 1048</span>}</div>
-<div class="ttc" id="aclassuint256__t_html"><div class="ttname"><a href="../../d1/d83/classuint256__t.html">uint256_t</a></div><div class="ttdoc">class for 256-bit unsigned integer</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:33</div></div>
+<div class="ttc" id="aclassuint256__t_html"><div class="ttname"><a href="../../d1/d83/classuint256__t.html">uint256_t</a></div><div class="ttdoc">class for 256-bit unsigned integer</div><div class="ttdef"><b>Definition</b> <a href="../../da/da3/uint256__t_8hpp_source.html#l00033">uint256_t.hpp:33</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -281,6 +304,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l01001">1001</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1001</span>                                                          {</div>
 <div class="line"><span class="lineno"> 1002</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) % q;</div>
 <div class="line"><span class="lineno"> 1003</span>}</div>
@@ -315,6 +340,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l01008">1008</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1008</span>                                                           {</div>
 <div class="line"><span class="lineno"> 1009</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) &amp; q;</div>
 <div class="line"><span class="lineno"> 1010</span>}</div>
@@ -349,6 +376,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l01027">1027</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1027</span>                                                      {</div>
 <div class="line"><span class="lineno"> 1028</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) &amp;&amp; q;</div>
 <div class="line"><span class="lineno"> 1029</span>}</div>
@@ -383,6 +412,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00989">989</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  989</span>                                                          {</div>
 <div class="line"><span class="lineno">  990</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) * q;</div>
 <div class="line"><span class="lineno">  991</span>}</div>
@@ -417,6 +448,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00977">977</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  977</span>                                                          {</div>
 <div class="line"><span class="lineno">  978</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) + q;</div>
 <div class="line"><span class="lineno">  979</span>}</div>
@@ -451,6 +484,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00983">983</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  983</span>                                                          {</div>
 <div class="line"><span class="lineno">  984</span>    <span class="keywordflow">return</span> (<a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) - q);</div>
 <div class="line"><span class="lineno">  985</span>}</div>
@@ -485,6 +520,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00995">995</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  995</span>                                                          {</div>
 <div class="line"><span class="lineno">  996</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) / q;</div>
 <div class="line"><span class="lineno">  997</span>}</div>
@@ -519,6 +556,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l01052">1052</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1052</span>                                                     {</div>
 <div class="line"><span class="lineno"> 1053</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) &lt; q;</div>
 <div class="line"><span class="lineno"> 1054</span>}</div>
@@ -553,6 +592,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l01058">1058</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1058</span>                                                      {</div>
 <div class="line"><span class="lineno"> 1059</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) &lt;= q;</div>
 <div class="line"><span class="lineno"> 1060</span>}</div>
@@ -587,6 +628,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l01040">1040</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1040</span>                                                      {</div>
 <div class="line"><span class="lineno"> 1041</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) == q;</div>
 <div class="line"><span class="lineno"> 1042</span>}</div>
@@ -621,6 +664,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l01064">1064</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1064</span>                                                     {</div>
 <div class="line"><span class="lineno"> 1065</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) &gt; q;</div>
 <div class="line"><span class="lineno"> 1066</span>}</div>
@@ -655,6 +700,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l01070">1070</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1070</span>                                                      {</div>
 <div class="line"><span class="lineno"> 1071</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) &gt;= q;</div>
 <div class="line"><span class="lineno"> 1072</span>}</div>
@@ -689,6 +736,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l01020">1020</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1020</span>                                                          {</div>
 <div class="line"><span class="lineno"> 1021</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) ^ q;</div>
 <div class="line"><span class="lineno"> 1022</span>}</div>
@@ -723,6 +772,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l01014">1014</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1014</span>                                                          {</div>
 <div class="line"><span class="lineno"> 1015</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) | q;</div>
 <div class="line"><span class="lineno"> 1016</span>}</div>
@@ -757,6 +808,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l01033">1033</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1033</span>                                                      {</div>
 <div class="line"><span class="lineno"> 1034</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) || q;</div>
 <div class="line"><span class="lineno"> 1035</span>}</div>
diff --git a/da/da3/uint256__t_8hpp_source.html b/da/da3/uint256__t_8hpp_source.html
index c1a161f4c..eb4b26bb9 100644
--- a/da/da3/uint256__t_8hpp_source.html
+++ b/da/da3/uint256__t_8hpp_source.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ciphers/uint256_t.hpp Source File</title>
+<title>TheAlgorithms/C++: ciphers/uint256_t.hpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -107,19 +124,11 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
   <div class="headertitle"><div class="title">uint256_t.hpp</div></div>
 </div><!--header-->
 <div class="contents">
-<a href="../../da/da3/uint256__t_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * @file</span></div>
-<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> *</span></div>
-<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * @details Implementation of 256-bit unsigned integers.</span></div>
-<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * @note The implementation can be flagged as not completed. This header is used</span></div>
-<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> * with enough operations to demonstrate the usage of ECDH (Elliptic Curve</span></div>
-<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> * Diffie-Hellman) Key exchange.</span></div>
-<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> * @author [Ashish Daulatabad](https://github.com/AshishYUO)</span></div>
-<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> */</span></div>
-<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;string&gt;</span>   <span class="comment">/// for `std::string`</span></div>
-<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;utility&gt;</span>  <span class="comment">/// for `std::pair` library</span></div>
+<a href="../../da/da3/uint256__t_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;string&gt;</span>   </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;utility&gt;</span>  </div>
 <div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
-<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &quot;<a class="code" href="../../da/d41/uint128__t_8hpp.html">uint128_t.hpp</a>&quot;</span>  <span class="comment">/// for uint128_t integer</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &quot;<a class="code" href="../../da/d41/uint128__t_8hpp.html">uint128_t.hpp</a>&quot;</span>  </div>
 <div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span> </div>
 <div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#ifndef CIPHERS_UINT256_T_HPP_</span></div>
 <div class="line"><a id="l00016" name="l00016"></a><span class="lineno"><a class="line" href="../../da/da3/uint256__t_8hpp.html#a1d8c5ec5b5e419c5c8a740251485102c">   16</a></span><span class="preprocessor">#define CIPHERS_UINT256_T_HPP_</span></div>
@@ -127,34 +136,23 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="keyword">class </span><a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>;</div>
 <div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
 <div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="keyword">template</span> &lt;&gt;</div>
-<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"><a class="line" href="../../d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html">   21</a></span><span class="keyword">struct </span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral</a>&lt;<a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>&gt; : <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a> {};</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"><a class="line" href="../../d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html">   21</a></span><span class="keyword">struct </span>std::is_integral&lt;<a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>&gt; : std::true_type {};</div>
 <div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
 <div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keyword">template</span> &lt;&gt;</div>
-<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"><a class="line" href="../../dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html">   24</a></span><span class="keyword">struct </span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_arithmetic.html">std::is_arithmetic</a>&lt;<a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>&gt; : <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a> {};</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"><a class="line" href="../../dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html">   24</a></span><span class="keyword">struct </span>std::is_arithmetic&lt;<a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>&gt; : std::true_type {};</div>
 <div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
 <div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">template</span> &lt;&gt;</div>
-<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html">   27</a></span><span class="keyword">struct </span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_unsigned.html">std::is_unsigned</a>&lt;<a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>&gt; : <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a> {};</div>
-<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment"></span> </div>
-<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment"> * @class uint256_t</span></div>
-<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="comment"> * @brief class for 256-bit unsigned integer</span></div>
-<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html">   27</a></span><span class="keyword">struct </span>std::is_unsigned&lt;<a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>&gt; : std::true_type {};</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
 <div class="foldopen" id="foldopen00033" data-start="{" data-end="};">
 <div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html">   33</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> {</div>
-<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> f{}, s{};  <span class="comment">/// First and second half of 256 bit number</span></div>
-<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="comment"></span> </div>
-<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="comment">     * @brief Get integer from given string.</span></div>
-<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="comment">     * @details Create an integer from a given string</span></div>
-<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="comment">     * @param str integer string, can be hexadecimal (starting on 0x... or</span></div>
-<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="comment">     * number)</span></div>
-<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="comment">     * @returns void</span></div>
-<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> f{}, s{};  </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
 <div class="foldopen" id="foldopen00043" data-start="{" data-end="}">
-<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4">   43</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4">__get_integer_from_string</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4">   43</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4">__get_integer_from_string</a>(<span class="keyword">const</span> std::string &amp;str) {</div>
 <div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        this-&gt;f = this-&gt;s = <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(0);</div>
-<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="keywordflow">if</span> (str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() &gt; 1 &amp;&amp; str[1] == <span class="charliteral">&#39;x&#39;</span>) {</div>
-<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 2; i &lt; str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>(); ++i) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="keywordflow">if</span> (str.size() &gt; 1 &amp;&amp; str[1] == <span class="charliteral">&#39;x&#39;</span>) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 2; i &lt; str.size(); ++i) {</div>
 <div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>                *<span class="keyword">this</span> *= 16LL;</div>
 <div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>                <span class="keywordflow">if</span> (str[i] &gt;= <span class="charliteral">&#39;0&#39;</span> &amp;&amp; str[i] &lt;= <span class="charliteral">&#39;9&#39;</span>) {</div>
 <div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>                    *<span class="keyword">this</span> += (str[i] - <span class="charliteral">&#39;0&#39;</span>);</div>
@@ -176,68 +174,33 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> <span class="keyword">public</span>:</div>
 <div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="comment">// Constructors</span></div>
 <div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>() = <span class="keywordflow">default</span>;</div>
-<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="comment"></span> </div>
-<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="comment">     * @brief Parameterized constructor</span></div>
-<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="comment">     * @tparam T template for integer types</span></div>
-<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="comment">     * @param low Integer denoting lower 128-bits</span></div>
-<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc">   75</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc">uint256_t</a>(T low) : s(low), f(0) {}</div>
-<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="comment"></span> </div>
-<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span><span class="comment">     * @brief Parameterized constructor</span></div>
-<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span><span class="comment">     * @param str Integer string (hexadecimal starting with 0x.. or decimal)</span></div>
-<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
 <div class="foldopen" id="foldopen00081" data-start="{" data-end="}">
-<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39">   81</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39">uint256_t</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39">   81</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39">uint256_t</a>(<span class="keyword">const</span> std::string &amp;str) {</div>
 <div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <a class="code hl_function" href="../../d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4">__get_integer_from_string</a>(str);</div>
 <div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    }</div>
 </div>
-<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span><span class="comment"></span> </div>
-<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span><span class="comment">     * @brief Copy constructor</span></div>
-<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span><span class="comment">     * @param num 256-bit unsigned integer</span></div>
-<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
 <div class="line"><a id="l00089" name="l00089"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a42bf7490b31d8c750a67fd9bb6f2df2e">   89</a></span>    <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a42bf7490b31d8c750a67fd9bb6f2df2e">uint256_t</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;num) = <span class="keywordflow">default</span>;</div>
-<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span><span class="comment"></span> </div>
-<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span><span class="comment">     * @brief Move constructor</span></div>
-<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span><span class="comment">     * @param num 256-bit unsigned integer</span></div>
-<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
 <div class="foldopen" id="foldopen00095" data-start="{" data-end="}">
 <div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa">   95</a></span>    <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa">uint256_t</a>(<a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;&amp;num) noexcept</div>
-<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        : f(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(num.f)), s(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(num.s)) {}</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        : f(std::move(num.f)), s(std::move(num.s)) {}</div>
 </div>
-<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span><span class="comment"></span> </div>
-<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span><span class="comment">     * @brief Parameterized constructor</span></div>
-<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span><span class="comment">     * @param high higher part 128-bit unsigned integer</span></div>
-<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span><span class="comment">     * @param low lower part 128-bit unsigned integer</span></div>
-<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
 <div class="foldopen" id="foldopen00103" data-start="{" data-end="}">
 <div class="line"><a id="l00103" name="l00103"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3">  103</a></span>    <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3">uint256_t</a>(<a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> high, <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> low)</div>
-<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        : f(<a class="code hl_namespace" href="../../d8/dcc/namespacestd.html">std</a>::move(high)), s(<a class="code hl_namespace" href="../../d8/dcc/namespacestd.html">std</a>::move(low)) {}</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        : f(std::move(high)), s(std::move(low)) {}</div>
 </div>
-<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span><span class="comment"></span> </div>
-<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span><span class="comment">     * @brief Parameterized constructor</span></div>
-<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span><span class="comment">     * @param high higher part 64-bit unsigned integer</span></div>
-<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span><span class="comment">     * @param low lower part 64-bit unsigned integer</span></div>
-<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
 <div class="line"><a id="l00111" name="l00111"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052">  111</a></span>    <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052">uint256_t</a>(<span class="keyword">const</span> uint64_t high, <span class="keyword">const</span> uint64_t low) : f(high), s(low) {}</div>
-<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span><span class="comment"></span> </div>
-<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span><span class="comment">     * @brief Destructor for uint256_t</span></div>
-<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
 <div class="line"><a id="l00116" name="l00116"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a3ff17ab14b2371eb3239107d10947067">  116</a></span>    <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a3ff17ab14b2371eb3239107d10947067">~uint256_t</a>() = <span class="keywordflow">default</span>;</div>
-<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span><span class="comment"></span> </div>
-<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span><span class="comment">     * @brief Leading zeroes in binary</span></div>
-<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span><span class="comment">     * @details Calculates leading zeros in 256-bit integer</span></div>
-<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span><span class="comment">     * @returns Integer denoting leading zeroes</span></div>
-<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span> </div>
 <div class="foldopen" id="foldopen00123" data-start="{" data-end="}">
 <div class="line"><a id="l00123" name="l00123"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163">  123</a></span>    <span class="keyword">inline</span> uint32_t <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163">_lez</a>() {</div>
 <div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        <span class="keywordflow">if</span> (f) {</div>
@@ -246,12 +209,7 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <span class="keywordflow">return</span> 128 + s.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2">_lez</a>();</div>
 <div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    }</div>
 </div>
-<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span><span class="comment"></span> </div>
-<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span><span class="comment">     * @brief Trailing zeroes in binary</span></div>
-<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span><span class="comment">     * @details Calculates leading zeros in 256-bit integer</span></div>
-<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span><span class="comment">     * @returns Integer denoting Trailing zeroes</span></div>
-<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
 <div class="foldopen" id="foldopen00135" data-start="{" data-end="}">
 <div class="line"><a id="l00135" name="l00135"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250">  135</a></span>    <span class="keyword">inline</span> uint32_t <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250">_trz</a>() {</div>
 <div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        <span class="keywordflow">if</span> (s) {</div>
@@ -260,118 +218,61 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>        <span class="keywordflow">return</span> 128 + f.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e">_trz</a>();</div>
 <div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    }</div>
 </div>
-<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span><span class="comment"></span> </div>
-<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span><span class="comment">     * @brief casting operator to boolean value</span></div>
-<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span><span class="comment">     * @returns true if value of this is non-zero, else false</span></div>
-<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
 <div class="line"><a id="l00146" name="l00146"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a28aa5786bbfce1b00398a8d38691bdaa">  146</a></span>    <span class="keyword">inline</span> <span class="keyword">explicit</span> <span class="keyword">operator</span> bool()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> f || s; }</div>
-<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span><span class="comment"></span> </div>
-<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span><span class="comment">     * @brief casting operator to any integer value</span></div>
-<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span><span class="comment">     * @tparam T any integer type</span></div>
-<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span><span class="comment">     * @returns integer value casted to mentioned type</span></div>
-<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span> </div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00155" data-start="{" data-end="}">
 <div class="line"><a id="l00155" name="l00155"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a9e1b39a46ea16bc6587e25e294c6c363">  155</a></span>    <span class="keyword">inline</span> <span class="keyword">explicit</span> <span class="keyword">operator</span> T()<span class="keyword"> const </span>{</div>
 <div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>        <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>T<span class="keyword">&gt;</span>(s);</div>
 <div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    }</div>
 </div>
-<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span><span class="comment"></span> </div>
-<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span><span class="comment">     * @brief casting operator to uint128_t</span></div>
-<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span><span class="comment">     * @returns returns lower 128-bit integer part</span></div>
-<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span> </div>
 <div class="line"><a id="l00163" name="l00163"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#ad5bd38b2d3becca998457af1124d6e8b">  163</a></span>    <span class="keyword">inline</span> <span class="keyword">explicit</span> <span class="keyword">operator</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> s; }</div>
-<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span><span class="comment"></span> </div>
-<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span><span class="comment">     * @brief returns lower 128-bit integer part</span></div>
-<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span><span class="comment">     * @returns returns lower 128-bit integer part</span></div>
-<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span> </div>
 <div class="line"><a id="l00169" name="l00169"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1">  169</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1">lower</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> s; }</div>
-<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span><span class="comment"></span> </div>
-<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span><span class="comment">     * @brief returns upper 128-bit integer part</span></div>
-<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span><span class="comment">     * @returns returns upper 128-bit integer part</span></div>
-<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span> </div>
 <div class="line"><a id="l00175" name="l00175"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5">  175</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5">upper</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> f; }</div>
-<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span><span class="comment"></span> </div>
-<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span><span class="comment">     * @brief operator = for uint256_t</span></div>
-<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span><span class="comment">     * @param p an 256-bit integer to assign it&#39;s value</span></div>
-<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span><span class="comment">     * @returns this pointer with it&#39;s value equal to `p`</span></div>
-<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
 <div class="line"><a id="l00182" name="l00182"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc">  182</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc">operator=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p) = <span class="keywordflow">default</span>;</div>
-<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span><span class="comment"></span> </div>
-<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span><span class="comment">     * @brief operator = for other types</span></div>
-<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span><span class="comment">     * @tparam T denoting any integer type</span></div>
-<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span><span class="comment">     * @param p an integer to assign it&#39;s value</span></div>
-<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span><span class="comment">     * @returns this pointer with it&#39;s value equal to `p`</span></div>
-<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span> </div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00192" data-start="{" data-end="}">
 <div class="line"><a id="l00192" name="l00192"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#addff5645f6005e7b50a6ad0731e4f19c">  192</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#addff5645f6005e7b50a6ad0731e4f19c">operator=</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        this-&gt;s = p;</div>
 <div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    }</div>
 </div>
-<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span><span class="comment"></span> </div>
-<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span><span class="comment">     * @brief operator = for type string</span></div>
-<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span><span class="comment">     * @param p a string to assign it&#39;s value to equivalent integer</span></div>
-<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span><span class="comment">     * @returns this pointer with it&#39;s value equal to `p`</span></div>
-<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span> </div>
 <div class="foldopen" id="foldopen00202" data-start="{" data-end="}">
-<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2">  202</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2">operator=</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;p) {</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2">  202</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2">operator=</a>(<span class="keyword">const</span> std::string &amp;p) {</div>
 <div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>        <a class="code hl_function" href="../../d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4">__get_integer_from_string</a>(p);</div>
 <div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    }</div>
 </div>
-<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span><span class="comment"></span> </div>
-<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span><span class="comment">     * @brief Move assignment operator</span></div>
-<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span> </div>
 <div class="line"><a id="l00210" name="l00210"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a6c5e025f901f6af4b748f98013350638">  210</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#a6c5e025f901f6af4b748f98013350638">operator=</a>(<a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;&amp;p) = <span class="keywordflow">default</span>;</div>
-<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span><span class="comment"></span> </div>
-<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span><span class="comment">     * @brief operator + for uint256_t and other integer types.</span></div>
-<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span><span class="comment">     * @returns addition of this and p, returning uint256_t integer</span></div>
-<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span> </div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00220" data-start="{" data-end="}">
 <div class="line"><a id="l00220" name="l00220"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f">  220</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f">operator+</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>        <span class="keywordtype">bool</span> app = s + p &lt; s;</div>
 <div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(f + app, s + p);</div>
 <div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    }</div>
 </div>
-<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span><span class="comment"></span> </div>
-<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span><span class="comment">     * @brief operator + for uint256_t and other integer types.</span></div>
-<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span><span class="comment">     * @param p 256-bit unsigned integer</span></div>
-<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span><span class="comment">     * @returns addition of this and p, returning uint256_t integer</span></div>
-<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span> </div>
 <div class="foldopen" id="foldopen00230" data-start="{" data-end="}">
 <div class="line"><a id="l00230" name="l00230"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#af18e2e3d7ed635c4056062bc906fef75">  230</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#af18e2e3d7ed635c4056062bc906fef75">operator+</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p) {</div>
 <div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>        <span class="keywordtype">bool</span> app = (s + p.s &lt; s);</div>
 <div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>        <span class="keywordflow">return</span> {f + app + p.f, s + p.s};</div>
 <div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    }</div>
 </div>
-<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span><span class="comment"></span> </div>
-<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span><span class="comment">     * @brief operator += for uint256_t and other integer types.</span></div>
-<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span><span class="comment">     * @returns addition of this and p, returning this</span></div>
-<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span> </div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00243" data-start="{" data-end="}">
 <div class="line"><a id="l00243" name="l00243"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1">  243</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1">operator+=</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>        <span class="keywordtype">bool</span> app = (p + s &lt; s);</div>
@@ -380,12 +281,7 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>    }</div>
 </div>
-<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span><span class="comment"></span> </div>
-<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span><span class="comment">     * @brief operator += for uint256_t</span></div>
-<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span><span class="comment">     * @param p 256-bit unsigned integer</span></div>
-<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span><span class="comment">     * @returns addition of this and p, returning this</span></div>
-<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span> </div>
 <div class="foldopen" id="foldopen00255" data-start="{" data-end="}">
 <div class="line"><a id="l00255" name="l00255"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#ac75a46fe3625caf10e07db1eb75a1d6e">  255</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#ac75a46fe3625caf10e07db1eb75a1d6e">operator+=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p) {</div>
 <div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>        <span class="keywordtype">bool</span> app = (s + p.s &lt; s);</div>
@@ -394,92 +290,55 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>    }</div>
 </div>
-<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span><span class="comment"></span> </div>
-<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span><span class="comment">     * @brief pre-increment operator</span></div>
-<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span><span class="comment">     * @returns incremented value of this.</span></div>
-<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span> </div>
 <div class="foldopen" id="foldopen00266" data-start="{" data-end="}">
 <div class="line"><a id="l00266" name="l00266"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9">  266</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9">operator++</a>() {</div>
 <div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>        *<span class="keyword">this</span> += 1;</div>
 <div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>    }</div>
 </div>
-<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span><span class="comment"></span> </div>
-<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span><span class="comment">     * @brief post-increment operator</span></div>
-<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span><span class="comment">     * @returns incremented value of this.</span></div>
-<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span> </div>
 <div class="foldopen" id="foldopen00275" data-start="{" data-end="}">
 <div class="line"><a id="l00275" name="l00275"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a7bbe36e2ebd52df5efab118897b3050c">  275</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a7bbe36e2ebd52df5efab118897b3050c">operator++</a>(<span class="keywordtype">int</span>) {</div>
 <div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>        ++*<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>    }</div>
 </div>
-<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span><span class="comment"></span> </div>
-<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span><span class="comment">     * @brief operator - for uint256_t and other integer types.</span></div>
-<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span><span class="comment">     * @returns subtraction of this and p, returning uint256_t integer</span></div>
-<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span> </div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00288" data-start="{" data-end="}">
 <div class="line"><a id="l00288" name="l00288"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4">  288</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4">operator-</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>        <span class="keywordtype">bool</span> app = (p &gt; s);</div>
 <div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(f - app, s - p);</div>
 <div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>    }</div>
 </div>
-<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span><span class="comment"></span> </div>
-<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span><span class="comment">     * @brief operator - for uint256_t</span></div>
-<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span><span class="comment">     * @returns subtraction of this and p, returning uint256_t integer</span></div>
-<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span> </div>
 <div class="foldopen" id="foldopen00298" data-start="{" data-end="}">
 <div class="line"><a id="l00298" name="l00298"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#ab909ef62a0c85121e7d743c016fb723d">  298</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#ab909ef62a0c85121e7d743c016fb723d">operator-</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p) {</div>
 <div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>        <span class="keywordtype">bool</span> app = s &lt; p.s;</div>
 <div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>        <span class="keywordflow">return</span> {f - p.f - app, s - p.s};</div>
 <div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>    }</div>
 </div>
-<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span><span class="comment"></span> </div>
-<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span><span class="comment">     * @brief operator - using twos complement</span></div>
-<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span><span class="comment">     * @returns 2&#39;s complement of this.</span></div>
-<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span> </div>
 <div class="line"><a id="l00307" name="l00307"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a406c951a07d8173685dbe384c6ab6a06">  307</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a406c951a07d8173685dbe384c6ab6a06">operator-</a>() { <span class="keywordflow">return</span> ~*<span class="keyword">this</span> + <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(1); }</div>
-<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span><span class="comment"></span> </div>
-<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span><span class="comment">     * @brief operator -- (pre-decrement)</span></div>
-<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span><span class="comment">     * @returns decremented value of this</span></div>
-<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span> </div>
 <div class="foldopen" id="foldopen00313" data-start="{" data-end="}">
 <div class="line"><a id="l00313" name="l00313"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183">  313</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183">operator--</a>() {</div>
 <div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>        *<span class="keyword">this</span> -= 1;</div>
 <div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>    }</div>
 </div>
-<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span><span class="comment"></span> </div>
-<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span><span class="comment">     * @brief operator -- (post-decrement)</span></div>
-<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span><span class="comment">     * @returns decremented value of this</span></div>
-<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span> </div>
 <div class="foldopen" id="foldopen00322" data-start="{" data-end="}">
 <div class="line"><a id="l00322" name="l00322"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a28d26847f9b19a4f86c187791cb0db13">  322</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a28d26847f9b19a4f86c187791cb0db13">operator--</a>(<span class="keywordtype">int</span> p) {</div>
 <div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>        --*<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>    }</div>
 </div>
-<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span><span class="comment"></span> </div>
-<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span><span class="comment">     * @brief operator -= for uint256_t and other integer types.</span></div>
-<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span><span class="comment">     * @returns subtraction of this and p, returning this</span></div>
-<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span> </div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00335" data-start="{" data-end="}">
 <div class="line"><a id="l00335" name="l00335"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7">  335</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7">operator-=</a>(<span class="keyword">const</span> T p) {</div>
 <div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>        <span class="keywordtype">bool</span> app = (p &gt; s);</div>
@@ -488,12 +347,7 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>    }</div>
 </div>
-<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span><span class="comment"></span> </div>
-<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span><span class="comment">     * @brief operator -= for uint256_t</span></div>
-<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span><span class="comment">     * @param p 256-bit unsigned integer</span></div>
-<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span><span class="comment">     * @returns subtraction of this and p, returning this</span></div>
-<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span> </div>
 <div class="foldopen" id="foldopen00347" data-start="{" data-end="}">
 <div class="line"><a id="l00347" name="l00347"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a5e84ed2a2f99cee81ede4a0107702a45">  347</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#a5e84ed2a2f99cee81ede4a0107702a45">operator-=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p) {</div>
 <div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>        <span class="keywordtype">bool</span> app = s &lt; p.s;</div>
@@ -502,26 +356,15 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>    }</div>
 </div>
-<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span><span class="comment"></span> </div>
-<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span><span class="comment">     * @brief operator * for uint256_t and other integer types.</span></div>
-<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span><span class="comment">     * @returns multiplication of this and p, returning uint256_t integer</span></div>
-<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span> </div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00362" data-start="{" data-end="}">
 <div class="line"><a id="l00362" name="l00362"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616">  362</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616">operator*</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> * <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p);</div>
 <div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>    }</div>
 </div>
-<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span><span class="comment"></span> </div>
-<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span><span class="comment">     * @brief operator * for uint256_t and other integer types.</span></div>
-<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span><span class="comment">     * @param p 256-bit unsigned integer</span></div>
-<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span><span class="comment">     * @returns multiplication of this and p, returning uint256_t integer</span></div>
-<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span> </div>
 <div class="foldopen" id="foldopen00371" data-start="{" data-end="}">
 <div class="line"><a id="l00371" name="l00371"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967">  371</a></span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967">operator*</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p) {</div>
 <div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>        <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> f_first(s.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">upper</a>()), f_second(s.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd">lower</a>()), s_first(p.s.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">upper</a>()),</div>
@@ -536,26 +379,15 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>                tmp + fo};</div>
 <div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>    }</div>
 </div>
-<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span><span class="comment"></span> </div>
-<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span><span class="comment">     * @brief operator *= for uint256_t and other integer types.</span></div>
-<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span><span class="comment">     * @returns multiplication of this and p, returning this</span></div>
-<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span> </div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00392" data-start="{" data-end="}">
 <div class="line"><a id="l00392" name="l00392"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028">  392</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028">operator*=</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>        <span class="keywordflow">return</span> (*<span class="keyword">this</span> *= <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p));</div>
 <div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>    }</div>
 </div>
-<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span><span class="comment"></span> </div>
-<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span><span class="comment">     * @brief operator *= for uint256_t and other integer types.</span></div>
-<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span><span class="comment">     * @param p 256-bit unsigned integer</span></div>
-<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span><span class="comment">     * @returns multiplication of this and p, returning this</span></div>
-<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span> </div>
 <div class="foldopen" id="foldopen00401" data-start="{" data-end="}">
 <div class="line"><a id="l00401" name="l00401"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a4645040fe68ff01d83400f173fd2bb21">  401</a></span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#a4645040fe68ff01d83400f173fd2bb21">operator*=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p) {</div>
 <div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>        <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> f_first(s.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">upper</a>()), f_second(s.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd">lower</a>()), s_first(p.s.<a class="code hl_function" href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">upper</a>()),</div>
@@ -571,15 +403,9 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>    }</div>
 </div>
-<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span><span class="comment"></span> </div>
-<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span><span class="comment">     * @brief divide function for uint256_t and other integer types.</span></div>
-<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span><span class="comment">     * @details divide this value and</span></div>
-<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span><span class="comment">     * @param p 256-bit unsigned integer</span></div>
-<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span><span class="comment">     * @returns pair denoting quotient and remainder.</span></div>
-<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span> </div>
 <div class="foldopen" id="foldopen00421" data-start="{" data-end="}">
-<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1">  421</a></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;uint256_t, uint256_t&gt;</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1">divide</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p) {</div>
+<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1">  421</a></span>    std::pair&lt;uint256_t, uint256_t&gt; <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1">divide</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p) {</div>
 <div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>        <span class="keywordflow">if</span> (*<span class="keyword">this</span> &lt; p) {  <span class="comment">// if this is less than divisor</span></div>
 <div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span>            <span class="keywordflow">return</span> {<a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(0), *<span class="keyword">this</span>};</div>
 <div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (*<span class="keyword">this</span> == p) {  <span class="comment">// if this is equal to divisor</span></div>
@@ -608,15 +434,9 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span>        <span class="keywordflow">return</span> {quotient &lt;&lt; left, tmp2};</div>
 <div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span>    }</div>
 </div>
-<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span><span class="comment"></span> </div>
-<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span><span class="comment">     * @brief operator / for uint256_t and other integer types.</span></div>
-<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span><span class="comment">     * @returns unsigned 256-bit quotient.</span></div>
-<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span> </div>
+<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00458" data-start="{" data-end="}">
 <div class="line"><a id="l00458" name="l00458"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6">  458</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6">operator/</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span>        <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> tmp = *<span class="keyword">this</span>;</div>
@@ -624,56 +444,29 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>        <span class="keywordflow">return</span> tmp;</div>
 <div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>    }</div>
 </div>
-<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span><span class="comment"></span> </div>
-<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span><span class="comment">     * @brief operator / for uint256_t and other integer types.</span></div>
-<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span><span class="comment">     * @param p 256-bit unsigned integer</span></div>
-<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span><span class="comment">     * @returns unsigned 256-bit quotient.</span></div>
-<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span> </div>
 <div class="line"><a id="l00469" name="l00469"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a4fdeb4d4bf8cca4ee99b8487e59831df">  469</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a4fdeb4d4bf8cca4ee99b8487e59831df">operator/</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1">divide</a>(p).first; }</div>
-<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span><span class="comment"></span> </div>
-<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span><span class="comment">     * @brief operator /= for uint256_t</span></div>
-<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span><span class="comment">     * @param p 256-bit unsigned integer</span></div>
-<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span><span class="comment">     * @returns this set as unsigned 256-bit quotient.</span></div>
-<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span> </div>
 <div class="foldopen" id="foldopen00476" data-start="{" data-end="}">
 <div class="line"><a id="l00476" name="l00476"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4">  476</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4">operator/=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p) {</div>
 <div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span>        *<span class="keyword">this</span> = <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1">divide</a>(p).first;</div>
 <div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span>    }</div>
 </div>
-<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span><span class="comment"></span> </div>
-<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span><span class="comment">     * @brief operator /= for uint256_t and other integer types.</span></div>
-<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span><span class="comment">     * @returns this set as unsigned 256-bit quotient.</span></div>
-<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span> </div>
+<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00489" data-start="{" data-end="}">
 <div class="line"><a id="l00489" name="l00489"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#abc793979ec70bb8e5cf177d83649a259">  489</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#abc793979ec70bb8e5cf177d83649a259">operator/=</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span>        *<span class="keyword">this</span> /= <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p);</div>
 <div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span>    }</div>
 </div>
-<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span><span class="comment"></span> </div>
-<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span><span class="comment">     * @brief operator % for uint256_t</span></div>
-<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span><span class="comment">     * @param p 256-bit unsigned integer</span></div>
-<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span><span class="comment">     * @returns unsigned 256-bit remainder.</span></div>
-<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span> </div>
 <div class="line"><a id="l00499" name="l00499"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#ad4928175eaaaa2b559bc945affe63ad2">  499</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#ad4928175eaaaa2b559bc945affe63ad2">operator%</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1">divide</a>(p).second; }</div>
-<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span><span class="comment"></span> </div>
-<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span><span class="comment">     * @brief operator % for uint256_t and other integer types.</span></div>
-<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span><span class="comment">     * @returns unsigned 256-bit remainder.</span></div>
-<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span> </div>
+<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00509" data-start="{" data-end="}">
 <div class="line"><a id="l00509" name="l00509"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a7bd9693b88c4df08b1f8d1fd81c597cc">  509</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a7bd9693b88c4df08b1f8d1fd81c597cc">operator%</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span>        <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> tmp = *<span class="keyword">this</span>;</div>
@@ -681,261 +474,143 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span>        <span class="keywordflow">return</span> tmp;</div>
 <div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span>    }</div>
 </div>
-<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span><span class="comment"></span> </div>
-<div class="line"><a id="l00515" name="l00515"></a><span class="lineno">  515</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00516" name="l00516"></a><span class="lineno">  516</span><span class="comment">     * @brief operator %= for uint256_t</span></div>
-<div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span><span class="comment">     * @param p 256-bit unsigned integer</span></div>
-<div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span><span class="comment">     * @returns this set as unsigned 256-bit remainder.</span></div>
-<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span> </div>
 <div class="foldopen" id="foldopen00520" data-start="{" data-end="}">
 <div class="line"><a id="l00520" name="l00520"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a2cd43a4a92dc825a010a17578b3bdedb">  520</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#a2cd43a4a92dc825a010a17578b3bdedb">operator%=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p) {</div>
 <div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span>        *<span class="keyword">this</span> = <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1">divide</a>(p).second;</div>
 <div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00523" name="l00523"></a><span class="lineno">  523</span>    }</div>
 </div>
-<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span><span class="comment"></span> </div>
-<div class="line"><a id="l00525" name="l00525"></a><span class="lineno">  525</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span><span class="comment">     * @brief operator %= for uint256_t</span></div>
-<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span><span class="comment">     * @tparam T denoting integral type</span></div>
-<div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span><span class="comment">     * @param p a type of integer variable</span></div>
-<div class="line"><a id="l00529" name="l00529"></a><span class="lineno">  529</span><span class="comment">     * @returns this set as unsigned 256-bit remainder.</span></div>
-<div class="line"><a id="l00530" name="l00530"></a><span class="lineno">  530</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00531" name="l00531"></a><span class="lineno">  531</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00532" name="l00532"></a><span class="lineno">  532</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span> </div>
+<div class="line"><a id="l00531" name="l00531"></a><span class="lineno">  531</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00532" name="l00532"></a><span class="lineno">  532</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00533" data-start="{" data-end="}">
 <div class="line"><a id="l00533" name="l00533"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a76914bc727eab927a3941ef71275327d">  533</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#a76914bc727eab927a3941ef71275327d">operator%=</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00534" name="l00534"></a><span class="lineno">  534</span>        *<span class="keyword">this</span> %= <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p);</div>
 <div class="line"><a id="l00535" name="l00535"></a><span class="lineno">  535</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00536" name="l00536"></a><span class="lineno">  536</span>    }</div>
 </div>
-<div class="line"><a id="l00537" name="l00537"></a><span class="lineno">  537</span><span class="comment"></span> </div>
-<div class="line"><a id="l00538" name="l00538"></a><span class="lineno">  538</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00539" name="l00539"></a><span class="lineno">  539</span><span class="comment">     * @brief operator &lt; for uint256_t</span></div>
-<div class="line"><a id="l00540" name="l00540"></a><span class="lineno">  540</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</span><span class="comment">     * @returns true if this is less than other, else false</span></div>
-<div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00537" name="l00537"></a><span class="lineno">  537</span> </div>
 <div class="foldopen" id="foldopen00543" data-start="{" data-end="}">
 <div class="line"><a id="l00543" name="l00543"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96">  543</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96">operator&lt;</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;other) {</div>
 <div class="line"><a id="l00544" name="l00544"></a><span class="lineno">  544</span>        <span class="keywordflow">return</span> f &lt; other.f || (f == other.f &amp;&amp; s &lt; other.s);</div>
 <div class="line"><a id="l00545" name="l00545"></a><span class="lineno">  545</span>    }</div>
 </div>
-<div class="line"><a id="l00546" name="l00546"></a><span class="lineno">  546</span><span class="comment"></span> </div>
-<div class="line"><a id="l00547" name="l00547"></a><span class="lineno">  547</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00548" name="l00548"></a><span class="lineno">  548</span><span class="comment">     * @brief operator &lt;= for uint256_t</span></div>
-<div class="line"><a id="l00549" name="l00549"></a><span class="lineno">  549</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00550" name="l00550"></a><span class="lineno">  550</span><span class="comment">     * @returns true if this is less than or equal to other, else false</span></div>
-<div class="line"><a id="l00551" name="l00551"></a><span class="lineno">  551</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00546" name="l00546"></a><span class="lineno">  546</span> </div>
 <div class="foldopen" id="foldopen00552" data-start="{" data-end="}">
 <div class="line"><a id="l00552" name="l00552"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88">  552</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88">operator&lt;=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;other) {</div>
 <div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</span>        <span class="keywordflow">return</span> f &lt; other.f || (f == other.f &amp;&amp; s &lt;= other.s);</div>
 <div class="line"><a id="l00554" name="l00554"></a><span class="lineno">  554</span>    }</div>
 </div>
-<div class="line"><a id="l00555" name="l00555"></a><span class="lineno">  555</span><span class="comment"></span> </div>
-<div class="line"><a id="l00556" name="l00556"></a><span class="lineno">  556</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00557" name="l00557"></a><span class="lineno">  557</span><span class="comment">     * @brief operator &gt; for uint256_t</span></div>
-<div class="line"><a id="l00558" name="l00558"></a><span class="lineno">  558</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00559" name="l00559"></a><span class="lineno">  559</span><span class="comment">     * @returns true if this is greater than other, else false</span></div>
-<div class="line"><a id="l00560" name="l00560"></a><span class="lineno">  560</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00555" name="l00555"></a><span class="lineno">  555</span> </div>
 <div class="foldopen" id="foldopen00561" data-start="{" data-end="}">
 <div class="line"><a id="l00561" name="l00561"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d">  561</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d">operator&gt;</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;other) {</div>
 <div class="line"><a id="l00562" name="l00562"></a><span class="lineno">  562</span>        <span class="keywordflow">return</span> f &gt; other.f || (f == other.f &amp;&amp; s &gt; other.s);</div>
 <div class="line"><a id="l00563" name="l00563"></a><span class="lineno">  563</span>    }</div>
 </div>
-<div class="line"><a id="l00564" name="l00564"></a><span class="lineno">  564</span><span class="comment"></span> </div>
-<div class="line"><a id="l00565" name="l00565"></a><span class="lineno">  565</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00566" name="l00566"></a><span class="lineno">  566</span><span class="comment">     * @brief operator &gt;= for uint256_t</span></div>
-<div class="line"><a id="l00567" name="l00567"></a><span class="lineno">  567</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00568" name="l00568"></a><span class="lineno">  568</span><span class="comment">     * @returns true if this is greater than or equal than other, else false</span></div>
-<div class="line"><a id="l00569" name="l00569"></a><span class="lineno">  569</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00564" name="l00564"></a><span class="lineno">  564</span> </div>
 <div class="foldopen" id="foldopen00570" data-start="{" data-end="}">
 <div class="line"><a id="l00570" name="l00570"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad">  570</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad">operator&gt;=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;other) {</div>
 <div class="line"><a id="l00571" name="l00571"></a><span class="lineno">  571</span>        <span class="keywordflow">return</span> (f &gt; other.f) || (f == other.f &amp;&amp; s &gt;= other.s);</div>
 <div class="line"><a id="l00572" name="l00572"></a><span class="lineno">  572</span>    }</div>
 </div>
-<div class="line"><a id="l00573" name="l00573"></a><span class="lineno">  573</span><span class="comment"></span> </div>
-<div class="line"><a id="l00574" name="l00574"></a><span class="lineno">  574</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00575" name="l00575"></a><span class="lineno">  575</span><span class="comment">     * @brief operator == for uint256_t</span></div>
-<div class="line"><a id="l00576" name="l00576"></a><span class="lineno">  576</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00577" name="l00577"></a><span class="lineno">  577</span><span class="comment">     * @returns true if this is equal than other, else false</span></div>
-<div class="line"><a id="l00578" name="l00578"></a><span class="lineno">  578</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00573" name="l00573"></a><span class="lineno">  573</span> </div>
 <div class="foldopen" id="foldopen00579" data-start="{" data-end="}">
 <div class="line"><a id="l00579" name="l00579"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261">  579</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261">operator==</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;other) {</div>
 <div class="line"><a id="l00580" name="l00580"></a><span class="lineno">  580</span>        <span class="keywordflow">return</span> f == other.f &amp;&amp; s == other.s;</div>
 <div class="line"><a id="l00581" name="l00581"></a><span class="lineno">  581</span>    }</div>
 </div>
-<div class="line"><a id="l00582" name="l00582"></a><span class="lineno">  582</span><span class="comment"></span> </div>
-<div class="line"><a id="l00583" name="l00583"></a><span class="lineno">  583</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00584" name="l00584"></a><span class="lineno">  584</span><span class="comment">     * @brief operator != for uint256_t</span></div>
-<div class="line"><a id="l00585" name="l00585"></a><span class="lineno">  585</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00586" name="l00586"></a><span class="lineno">  586</span><span class="comment">     * @returns true if this is not equal than other, else false</span></div>
-<div class="line"><a id="l00587" name="l00587"></a><span class="lineno">  587</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00582" name="l00582"></a><span class="lineno">  582</span> </div>
 <div class="foldopen" id="foldopen00588" data-start="{" data-end="}">
 <div class="line"><a id="l00588" name="l00588"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#aae68a7bd17c14a926fb77758b5c8e547">  588</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#aae68a7bd17c14a926fb77758b5c8e547">operator!=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;other) {</div>
 <div class="line"><a id="l00589" name="l00589"></a><span class="lineno">  589</span>        <span class="keywordflow">return</span> !((*this) == other);</div>
 <div class="line"><a id="l00590" name="l00590"></a><span class="lineno">  590</span>    }</div>
 </div>
-<div class="line"><a id="l00591" name="l00591"></a><span class="lineno">  591</span><span class="comment"></span> </div>
-<div class="line"><a id="l00592" name="l00592"></a><span class="lineno">  592</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00593" name="l00593"></a><span class="lineno">  593</span><span class="comment">     * @brief operator ! for uint256_t</span></div>
-<div class="line"><a id="l00594" name="l00594"></a><span class="lineno">  594</span><span class="comment">     * @returns true if this has zero value, else false</span></div>
-<div class="line"><a id="l00595" name="l00595"></a><span class="lineno">  595</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00591" name="l00591"></a><span class="lineno">  591</span> </div>
 <div class="line"><a id="l00596" name="l00596"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a028c585069fa53b74c153667ff66352c">  596</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a028c585069fa53b74c153667ff66352c">operator!</a>() { <span class="keywordflow">return</span> !f &amp;&amp; !s; }</div>
-<div class="line"><a id="l00597" name="l00597"></a><span class="lineno">  597</span><span class="comment"></span> </div>
-<div class="line"><a id="l00598" name="l00598"></a><span class="lineno">  598</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00599" name="l00599"></a><span class="lineno">  599</span><span class="comment">     * @brief operator &amp;&amp; for uint256_t</span></div>
-<div class="line"><a id="l00600" name="l00600"></a><span class="lineno">  600</span><span class="comment">     * @param b number to be compared with this</span></div>
-<div class="line"><a id="l00601" name="l00601"></a><span class="lineno">  601</span><span class="comment">     * @returns true if both of the values are not zero, else false</span></div>
-<div class="line"><a id="l00602" name="l00602"></a><span class="lineno">  602</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00597" name="l00597"></a><span class="lineno">  597</span> </div>
 <div class="foldopen" id="foldopen00603" data-start="{" data-end="}">
 <div class="line"><a id="l00603" name="l00603"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963">  603</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963">operator&amp;&amp;</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;b) {</div>
 <div class="line"><a id="l00604" name="l00604"></a><span class="lineno">  604</span>        <span class="keywordflow">return</span> (s || f) &amp;&amp; (b.s || b.f);</div>
 <div class="line"><a id="l00605" name="l00605"></a><span class="lineno">  605</span>    }</div>
 </div>
-<div class="line"><a id="l00606" name="l00606"></a><span class="lineno">  606</span><span class="comment"></span> </div>
-<div class="line"><a id="l00607" name="l00607"></a><span class="lineno">  607</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00608" name="l00608"></a><span class="lineno">  608</span><span class="comment">     * @brief operator || for uint256_t</span></div>
-<div class="line"><a id="l00609" name="l00609"></a><span class="lineno">  609</span><span class="comment">     * @param b number to be compared with this</span></div>
-<div class="line"><a id="l00610" name="l00610"></a><span class="lineno">  610</span><span class="comment">     * @returns true if one of the values are not zero, else false</span></div>
-<div class="line"><a id="l00611" name="l00611"></a><span class="lineno">  611</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00606" name="l00606"></a><span class="lineno">  606</span> </div>
 <div class="foldopen" id="foldopen00612" data-start="{" data-end="}">
 <div class="line"><a id="l00612" name="l00612"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a41f4bb928c4ee067732503395b65f9d7">  612</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a41f4bb928c4ee067732503395b65f9d7">operator||</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;b) {</div>
 <div class="line"><a id="l00613" name="l00613"></a><span class="lineno">  613</span>        <span class="keywordflow">return</span> (s || f) || (b.s || b.f);</div>
 <div class="line"><a id="l00614" name="l00614"></a><span class="lineno">  614</span>    }</div>
 </div>
-<div class="line"><a id="l00615" name="l00615"></a><span class="lineno">  615</span><span class="comment"></span> </div>
-<div class="line"><a id="l00616" name="l00616"></a><span class="lineno">  616</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00617" name="l00617"></a><span class="lineno">  617</span><span class="comment">     * @brief operator () for uint256_t</span></div>
-<div class="line"><a id="l00618" name="l00618"></a><span class="lineno">  618</span><span class="comment">     * @returns true if this value is non-zero, else false</span></div>
-<div class="line"><a id="l00619" name="l00619"></a><span class="lineno">  619</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00615" name="l00615"></a><span class="lineno">  615</span> </div>
 <div class="line"><a id="l00620" name="l00620"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b">  620</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b">operator()</a>() { <span class="keywordflow">return</span> s || f; }</div>
-<div class="line"><a id="l00621" name="l00621"></a><span class="lineno">  621</span><span class="comment"></span> </div>
-<div class="line"><a id="l00622" name="l00622"></a><span class="lineno">  622</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00623" name="l00623"></a><span class="lineno">  623</span><span class="comment">     * @brief operator &lt; for other types</span></div>
-<div class="line"><a id="l00624" name="l00624"></a><span class="lineno">  624</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00625" name="l00625"></a><span class="lineno">  625</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00626" name="l00626"></a><span class="lineno">  626</span><span class="comment">     * @returns true if this is less than other, else false</span></div>
-<div class="line"><a id="l00627" name="l00627"></a><span class="lineno">  627</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00628" name="l00628"></a><span class="lineno">  628</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00629" name="l00629"></a><span class="lineno">  629</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00621" name="l00621"></a><span class="lineno">  621</span> </div>
+<div class="line"><a id="l00628" name="l00628"></a><span class="lineno">  628</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00629" name="l00629"></a><span class="lineno">  629</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00630" data-start="{" data-end="}">
 <div class="line"><a id="l00630" name="l00630"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#ac6bdcf64653af8173987bf7217e99056">  630</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#ac6bdcf64653af8173987bf7217e99056">operator&lt;</a>(<span class="keyword">const</span> T &amp;other) {</div>
 <div class="line"><a id="l00631" name="l00631"></a><span class="lineno">  631</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> &lt; <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(other);</div>
 <div class="line"><a id="l00632" name="l00632"></a><span class="lineno">  632</span>    }</div>
 </div>
-<div class="line"><a id="l00633" name="l00633"></a><span class="lineno">  633</span><span class="comment"></span> </div>
-<div class="line"><a id="l00634" name="l00634"></a><span class="lineno">  634</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00635" name="l00635"></a><span class="lineno">  635</span><span class="comment">     * @brief operator &lt;= for other types</span></div>
-<div class="line"><a id="l00636" name="l00636"></a><span class="lineno">  636</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00637" name="l00637"></a><span class="lineno">  637</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00638" name="l00638"></a><span class="lineno">  638</span><span class="comment">     * @returns true if this is less than or equal to other, else false</span></div>
-<div class="line"><a id="l00639" name="l00639"></a><span class="lineno">  639</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00640" name="l00640"></a><span class="lineno">  640</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00641" name="l00641"></a><span class="lineno">  641</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00633" name="l00633"></a><span class="lineno">  633</span> </div>
+<div class="line"><a id="l00640" name="l00640"></a><span class="lineno">  640</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00641" name="l00641"></a><span class="lineno">  641</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00642" data-start="{" data-end="}">
 <div class="line"><a id="l00642" name="l00642"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a2029e9777f999bffef6004429b4f19f2">  642</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a2029e9777f999bffef6004429b4f19f2">operator&lt;=</a>(<span class="keyword">const</span> T &amp;other) {</div>
 <div class="line"><a id="l00643" name="l00643"></a><span class="lineno">  643</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> &lt;= <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(other);</div>
 <div class="line"><a id="l00644" name="l00644"></a><span class="lineno">  644</span>    }</div>
 </div>
-<div class="line"><a id="l00645" name="l00645"></a><span class="lineno">  645</span><span class="comment"></span> </div>
-<div class="line"><a id="l00646" name="l00646"></a><span class="lineno">  646</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00647" name="l00647"></a><span class="lineno">  647</span><span class="comment">     * @brief operator &gt; for other types</span></div>
-<div class="line"><a id="l00648" name="l00648"></a><span class="lineno">  648</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00649" name="l00649"></a><span class="lineno">  649</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00650" name="l00650"></a><span class="lineno">  650</span><span class="comment">     * @returns true if this is greater than other, else false</span></div>
-<div class="line"><a id="l00651" name="l00651"></a><span class="lineno">  651</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00652" name="l00652"></a><span class="lineno">  652</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00653" name="l00653"></a><span class="lineno">  653</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00645" name="l00645"></a><span class="lineno">  645</span> </div>
+<div class="line"><a id="l00652" name="l00652"></a><span class="lineno">  652</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00653" name="l00653"></a><span class="lineno">  653</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00654" data-start="{" data-end="}">
 <div class="line"><a id="l00654" name="l00654"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#ad74d33215517459c2b33ace7a9c6bc13">  654</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#ad74d33215517459c2b33ace7a9c6bc13">operator&gt;</a>(<span class="keyword">const</span> T &amp;other) {</div>
 <div class="line"><a id="l00655" name="l00655"></a><span class="lineno">  655</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> &gt; <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(other);</div>
 <div class="line"><a id="l00656" name="l00656"></a><span class="lineno">  656</span>    }</div>
 </div>
-<div class="line"><a id="l00657" name="l00657"></a><span class="lineno">  657</span><span class="comment"></span> </div>
-<div class="line"><a id="l00658" name="l00658"></a><span class="lineno">  658</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00659" name="l00659"></a><span class="lineno">  659</span><span class="comment">     * @brief operator &gt;= for other types</span></div>
-<div class="line"><a id="l00660" name="l00660"></a><span class="lineno">  660</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00661" name="l00661"></a><span class="lineno">  661</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00662" name="l00662"></a><span class="lineno">  662</span><span class="comment">     * @returns true if this is greater than or equal other, else false</span></div>
-<div class="line"><a id="l00663" name="l00663"></a><span class="lineno">  663</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00664" name="l00664"></a><span class="lineno">  664</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00665" name="l00665"></a><span class="lineno">  665</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00657" name="l00657"></a><span class="lineno">  657</span> </div>
+<div class="line"><a id="l00664" name="l00664"></a><span class="lineno">  664</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00665" name="l00665"></a><span class="lineno">  665</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00666" data-start="{" data-end="}">
 <div class="line"><a id="l00666" name="l00666"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#aff4d49cf84de64301b169ad974f00bad">  666</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#aff4d49cf84de64301b169ad974f00bad">operator&gt;=</a>(<span class="keyword">const</span> T &amp;other) {</div>
 <div class="line"><a id="l00667" name="l00667"></a><span class="lineno">  667</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> &gt;= <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(other);</div>
 <div class="line"><a id="l00668" name="l00668"></a><span class="lineno">  668</span>    }</div>
 </div>
-<div class="line"><a id="l00669" name="l00669"></a><span class="lineno">  669</span><span class="comment"></span> </div>
-<div class="line"><a id="l00670" name="l00670"></a><span class="lineno">  670</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00671" name="l00671"></a><span class="lineno">  671</span><span class="comment">     * @brief operator == for other types</span></div>
-<div class="line"><a id="l00672" name="l00672"></a><span class="lineno">  672</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00673" name="l00673"></a><span class="lineno">  673</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00674" name="l00674"></a><span class="lineno">  674</span><span class="comment">     * @returns true if this is equal to other, else false</span></div>
-<div class="line"><a id="l00675" name="l00675"></a><span class="lineno">  675</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00676" name="l00676"></a><span class="lineno">  676</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00677" name="l00677"></a><span class="lineno">  677</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00669" name="l00669"></a><span class="lineno">  669</span> </div>
+<div class="line"><a id="l00676" name="l00676"></a><span class="lineno">  676</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00677" name="l00677"></a><span class="lineno">  677</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00678" data-start="{" data-end="}">
 <div class="line"><a id="l00678" name="l00678"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484">  678</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484">operator==</a>(<span class="keyword">const</span> T &amp;other) {</div>
 <div class="line"><a id="l00679" name="l00679"></a><span class="lineno">  679</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> == <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(other);</div>
 <div class="line"><a id="l00680" name="l00680"></a><span class="lineno">  680</span>    }</div>
 </div>
-<div class="line"><a id="l00681" name="l00681"></a><span class="lineno">  681</span><span class="comment"></span> </div>
-<div class="line"><a id="l00682" name="l00682"></a><span class="lineno">  682</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00683" name="l00683"></a><span class="lineno">  683</span><span class="comment">     * @brief operator != for other types</span></div>
-<div class="line"><a id="l00684" name="l00684"></a><span class="lineno">  684</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00685" name="l00685"></a><span class="lineno">  685</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00686" name="l00686"></a><span class="lineno">  686</span><span class="comment">     * @returns true if this is not equal to other, else false</span></div>
-<div class="line"><a id="l00687" name="l00687"></a><span class="lineno">  687</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00688" name="l00688"></a><span class="lineno">  688</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00689" name="l00689"></a><span class="lineno">  689</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00681" name="l00681"></a><span class="lineno">  681</span> </div>
+<div class="line"><a id="l00688" name="l00688"></a><span class="lineno">  688</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00689" name="l00689"></a><span class="lineno">  689</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00690" data-start="{" data-end="}">
 <div class="line"><a id="l00690" name="l00690"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a89cf7fa466458ee08edd9a809d072bcb">  690</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a89cf7fa466458ee08edd9a809d072bcb">operator!=</a>(<span class="keyword">const</span> T &amp;other) {</div>
 <div class="line"><a id="l00691" name="l00691"></a><span class="lineno">  691</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> != <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(other);</div>
 <div class="line"><a id="l00692" name="l00692"></a><span class="lineno">  692</span>    }</div>
 </div>
-<div class="line"><a id="l00693" name="l00693"></a><span class="lineno">  693</span><span class="comment"></span> </div>
-<div class="line"><a id="l00694" name="l00694"></a><span class="lineno">  694</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00695" name="l00695"></a><span class="lineno">  695</span><span class="comment">     * @brief operator &amp;&amp; for other types</span></div>
-<div class="line"><a id="l00696" name="l00696"></a><span class="lineno">  696</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00697" name="l00697"></a><span class="lineno">  697</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00698" name="l00698"></a><span class="lineno">  698</span><span class="comment">     * @returns true if this is both values are non-zero, else false</span></div>
-<div class="line"><a id="l00699" name="l00699"></a><span class="lineno">  699</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00700" name="l00700"></a><span class="lineno">  700</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00701" name="l00701"></a><span class="lineno">  701</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00693" name="l00693"></a><span class="lineno">  693</span> </div>
+<div class="line"><a id="l00700" name="l00700"></a><span class="lineno">  700</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00701" name="l00701"></a><span class="lineno">  701</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00702" data-start="{" data-end="}">
 <div class="line"><a id="l00702" name="l00702"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a303287d7bc8686dcb47fcb04720ad409">  702</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a303287d7bc8686dcb47fcb04720ad409">operator&amp;&amp;</a>(<span class="keyword">const</span> T &amp;b) {</div>
 <div class="line"><a id="l00703" name="l00703"></a><span class="lineno">  703</span>        <span class="keywordflow">return</span> (s || f) &amp;&amp; (b);</div>
 <div class="line"><a id="l00704" name="l00704"></a><span class="lineno">  704</span>    }</div>
 </div>
-<div class="line"><a id="l00705" name="l00705"></a><span class="lineno">  705</span><span class="comment"></span> </div>
-<div class="line"><a id="l00706" name="l00706"></a><span class="lineno">  706</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00707" name="l00707"></a><span class="lineno">  707</span><span class="comment">     * @brief operator || for other types</span></div>
-<div class="line"><a id="l00708" name="l00708"></a><span class="lineno">  708</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00709" name="l00709"></a><span class="lineno">  709</span><span class="comment">     * @param other number to be compared with this</span></div>
-<div class="line"><a id="l00710" name="l00710"></a><span class="lineno">  710</span><span class="comment">     * @returns true if this is either one of the values are non-zero, else</span></div>
-<div class="line"><a id="l00711" name="l00711"></a><span class="lineno">  711</span><span class="comment">     * false</span></div>
-<div class="line"><a id="l00712" name="l00712"></a><span class="lineno">  712</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00713" name="l00713"></a><span class="lineno">  713</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00714" name="l00714"></a><span class="lineno">  714</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00705" name="l00705"></a><span class="lineno">  705</span> </div>
+<div class="line"><a id="l00713" name="l00713"></a><span class="lineno">  713</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00714" name="l00714"></a><span class="lineno">  714</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00715" data-start="{" data-end="}">
 <div class="line"><a id="l00715" name="l00715"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a4886747ffff15cdeb6bc93712629f9e7">  715</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a4886747ffff15cdeb6bc93712629f9e7">operator||</a>(<span class="keyword">const</span> T &amp;b) {</div>
 <div class="line"><a id="l00716" name="l00716"></a><span class="lineno">  716</span>        <span class="keywordflow">return</span> (s || f) || (b);</div>
 <div class="line"><a id="l00717" name="l00717"></a><span class="lineno">  717</span>    }</div>
 </div>
-<div class="line"><a id="l00718" name="l00718"></a><span class="lineno">  718</span><span class="comment"></span> </div>
-<div class="line"><a id="l00719" name="l00719"></a><span class="lineno">  719</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00720" name="l00720"></a><span class="lineno">  720</span><span class="comment">     * @brief operator ~ for uint256_t</span></div>
-<div class="line"><a id="l00721" name="l00721"></a><span class="lineno">  721</span><span class="comment">     * @returns 1&#39;s complement of this number</span></div>
-<div class="line"><a id="l00722" name="l00722"></a><span class="lineno">  722</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00718" name="l00718"></a><span class="lineno">  718</span> </div>
 <div class="line"><a id="l00723" name="l00723"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a6eec1f632aebfc44fee8a74c395e10c2">  723</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a6eec1f632aebfc44fee8a74c395e10c2">operator~</a>() { <span class="keywordflow">return</span> {~f, ~s}; }</div>
-<div class="line"><a id="l00724" name="l00724"></a><span class="lineno">  724</span><span class="comment"></span> </div>
-<div class="line"><a id="l00725" name="l00725"></a><span class="lineno">  725</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00726" name="l00726"></a><span class="lineno">  726</span><span class="comment">     * @brief operator &lt;&lt; for uint256_t</span></div>
-<div class="line"><a id="l00727" name="l00727"></a><span class="lineno">  727</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00728" name="l00728"></a><span class="lineno">  728</span><span class="comment">     * @param p number denoting number of shifts</span></div>
-<div class="line"><a id="l00729" name="l00729"></a><span class="lineno">  729</span><span class="comment">     * @returns value of this shifted by p to left</span></div>
-<div class="line"><a id="l00730" name="l00730"></a><span class="lineno">  730</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00731" name="l00731"></a><span class="lineno">  731</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00732" name="l00732"></a><span class="lineno">  732</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00724" name="l00724"></a><span class="lineno">  724</span> </div>
+<div class="line"><a id="l00731" name="l00731"></a><span class="lineno">  731</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00732" name="l00732"></a><span class="lineno">  732</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00733" data-start="{" data-end="}">
 <div class="line"><a id="l00733" name="l00733"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5">  733</a></span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5">operator&lt;&lt;</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00734" name="l00734"></a><span class="lineno">  734</span>        <span class="keywordflow">if</span> (!p) {</div>
@@ -947,15 +622,9 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00740" name="l00740"></a><span class="lineno">  740</span>                         (this-&gt;s &lt;&lt; p));</div>
 <div class="line"><a id="l00741" name="l00741"></a><span class="lineno">  741</span>    }</div>
 </div>
-<div class="line"><a id="l00742" name="l00742"></a><span class="lineno">  742</span><span class="comment"></span> </div>
-<div class="line"><a id="l00743" name="l00743"></a><span class="lineno">  743</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00744" name="l00744"></a><span class="lineno">  744</span><span class="comment">     * @brief operator &lt;&lt;= for uint256_t</span></div>
-<div class="line"><a id="l00745" name="l00745"></a><span class="lineno">  745</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00746" name="l00746"></a><span class="lineno">  746</span><span class="comment">     * @param p number denoting number of shifts</span></div>
-<div class="line"><a id="l00747" name="l00747"></a><span class="lineno">  747</span><span class="comment">     * @returns this shifted by p to left</span></div>
-<div class="line"><a id="l00748" name="l00748"></a><span class="lineno">  748</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00749" name="l00749"></a><span class="lineno">  749</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00750" name="l00750"></a><span class="lineno">  750</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00742" name="l00742"></a><span class="lineno">  742</span> </div>
+<div class="line"><a id="l00749" name="l00749"></a><span class="lineno">  749</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00750" name="l00750"></a><span class="lineno">  750</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00751" data-start="{" data-end="}">
 <div class="line"><a id="l00751" name="l00751"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5">  751</a></span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5">operator&lt;&lt;=</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00752" name="l00752"></a><span class="lineno">  752</span>        <span class="keywordflow">if</span> (p) {</div>
@@ -970,15 +639,9 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00761" name="l00761"></a><span class="lineno">  761</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00762" name="l00762"></a><span class="lineno">  762</span>    }</div>
 </div>
-<div class="line"><a id="l00763" name="l00763"></a><span class="lineno">  763</span><span class="comment"></span> </div>
-<div class="line"><a id="l00764" name="l00764"></a><span class="lineno">  764</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00765" name="l00765"></a><span class="lineno">  765</span><span class="comment">     * @brief operator &gt;&gt; for uint256_t</span></div>
-<div class="line"><a id="l00766" name="l00766"></a><span class="lineno">  766</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00767" name="l00767"></a><span class="lineno">  767</span><span class="comment">     * @param p number denoting number of shifts</span></div>
-<div class="line"><a id="l00768" name="l00768"></a><span class="lineno">  768</span><span class="comment">     * @returns value of this shifted by p to right</span></div>
-<div class="line"><a id="l00769" name="l00769"></a><span class="lineno">  769</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00770" name="l00770"></a><span class="lineno">  770</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00771" name="l00771"></a><span class="lineno">  771</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00763" name="l00763"></a><span class="lineno">  763</span> </div>
+<div class="line"><a id="l00770" name="l00770"></a><span class="lineno">  770</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00771" name="l00771"></a><span class="lineno">  771</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00772" data-start="{" data-end="}">
 <div class="line"><a id="l00772" name="l00772"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51">  772</a></span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51">operator&gt;&gt;</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00773" name="l00773"></a><span class="lineno">  773</span>        <span class="keywordflow">if</span> (!p) {</div>
@@ -990,15 +653,9 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00779" name="l00779"></a><span class="lineno">  779</span>                         (this-&gt;s &gt;&gt; p) + (this-&gt;f &lt;&lt; (128 - p)));</div>
 <div class="line"><a id="l00780" name="l00780"></a><span class="lineno">  780</span>    }</div>
 </div>
-<div class="line"><a id="l00781" name="l00781"></a><span class="lineno">  781</span><span class="comment"></span> </div>
-<div class="line"><a id="l00782" name="l00782"></a><span class="lineno">  782</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00783" name="l00783"></a><span class="lineno">  783</span><span class="comment">     * @brief operator &gt;&gt;= for uint256_t</span></div>
-<div class="line"><a id="l00784" name="l00784"></a><span class="lineno">  784</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00785" name="l00785"></a><span class="lineno">  785</span><span class="comment">     * @param p number denoting number of shifts</span></div>
-<div class="line"><a id="l00786" name="l00786"></a><span class="lineno">  786</span><span class="comment">     * @returns this shifted by p to right</span></div>
-<div class="line"><a id="l00787" name="l00787"></a><span class="lineno">  787</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00788" name="l00788"></a><span class="lineno">  788</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00789" name="l00789"></a><span class="lineno">  789</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00781" name="l00781"></a><span class="lineno">  781</span> </div>
+<div class="line"><a id="l00788" name="l00788"></a><span class="lineno">  788</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00789" name="l00789"></a><span class="lineno">  789</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00790" data-start="{" data-end="}">
 <div class="line"><a id="l00790" name="l00790"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#ad9ce2370b1497efbcc426793048e1f78">  790</a></span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#ad9ce2370b1497efbcc426793048e1f78">operator&gt;&gt;=</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00791" name="l00791"></a><span class="lineno">  791</span>        <span class="keywordflow">if</span> (p) {</div>
@@ -1013,37 +670,21 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00800" name="l00800"></a><span class="lineno">  800</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00801" name="l00801"></a><span class="lineno">  801</span>    }</div>
 </div>
-<div class="line"><a id="l00802" name="l00802"></a><span class="lineno">  802</span><span class="comment"></span> </div>
-<div class="line"><a id="l00803" name="l00803"></a><span class="lineno">  803</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00804" name="l00804"></a><span class="lineno">  804</span><span class="comment">     * @brief operator &amp; for other types (bitwise operator)</span></div>
-<div class="line"><a id="l00805" name="l00805"></a><span class="lineno">  805</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00806" name="l00806"></a><span class="lineno">  806</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00807" name="l00807"></a><span class="lineno">  807</span><span class="comment">     * @returns value of this &amp; p (&amp; is bit-wise operator)</span></div>
-<div class="line"><a id="l00808" name="l00808"></a><span class="lineno">  808</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00809" name="l00809"></a><span class="lineno">  809</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00810" name="l00810"></a><span class="lineno">  810</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00802" name="l00802"></a><span class="lineno">  802</span> </div>
+<div class="line"><a id="l00809" name="l00809"></a><span class="lineno">  809</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00810" name="l00810"></a><span class="lineno">  810</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00811" data-start="{" data-end="}">
 <div class="line"><a id="l00811" name="l00811"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8">  811</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8">operator&amp;</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00812" name="l00812"></a><span class="lineno">  812</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> &amp; <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p);</div>
 <div class="line"><a id="l00813" name="l00813"></a><span class="lineno">  813</span>    }</div>
 </div>
-<div class="line"><a id="l00814" name="l00814"></a><span class="lineno">  814</span><span class="comment"></span> </div>
-<div class="line"><a id="l00815" name="l00815"></a><span class="lineno">  815</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00816" name="l00816"></a><span class="lineno">  816</span><span class="comment">     * @brief operator &amp; for uint256_t (bitwise operator)</span></div>
-<div class="line"><a id="l00817" name="l00817"></a><span class="lineno">  817</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00818" name="l00818"></a><span class="lineno">  818</span><span class="comment">     * @returns value of this &amp; p (&amp; is bit-wise operator)</span></div>
-<div class="line"><a id="l00819" name="l00819"></a><span class="lineno">  819</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00814" name="l00814"></a><span class="lineno">  814</span> </div>
 <div class="foldopen" id="foldopen00820" data-start="{" data-end="}">
 <div class="line"><a id="l00820" name="l00820"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839">  820</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839">operator&amp;</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p) {</div>
 <div class="line"><a id="l00821" name="l00821"></a><span class="lineno">  821</span>        <span class="keywordflow">return</span> {f &amp; p.f, s &amp; p.s};</div>
 <div class="line"><a id="l00822" name="l00822"></a><span class="lineno">  822</span>    }</div>
 </div>
-<div class="line"><a id="l00823" name="l00823"></a><span class="lineno">  823</span><span class="comment"></span> </div>
-<div class="line"><a id="l00824" name="l00824"></a><span class="lineno">  824</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00825" name="l00825"></a><span class="lineno">  825</span><span class="comment">     * @brief operator &amp;= for uint256_t (bitwise operator)</span></div>
-<div class="line"><a id="l00826" name="l00826"></a><span class="lineno">  826</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00827" name="l00827"></a><span class="lineno">  827</span><span class="comment">     * @returns this = this &amp; p (&amp; is bit-wise operator)</span></div>
-<div class="line"><a id="l00828" name="l00828"></a><span class="lineno">  828</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00823" name="l00823"></a><span class="lineno">  823</span> </div>
 <div class="foldopen" id="foldopen00829" data-start="{" data-end="}">
 <div class="line"><a id="l00829" name="l00829"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d">  829</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d">operator&amp;=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p) {</div>
 <div class="line"><a id="l00830" name="l00830"></a><span class="lineno">  830</span>        f &amp;= p.f;</div>
@@ -1051,67 +692,39 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00832" name="l00832"></a><span class="lineno">  832</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00833" name="l00833"></a><span class="lineno">  833</span>    }</div>
 </div>
-<div class="line"><a id="l00834" name="l00834"></a><span class="lineno">  834</span><span class="comment"></span> </div>
-<div class="line"><a id="l00835" name="l00835"></a><span class="lineno">  835</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00836" name="l00836"></a><span class="lineno">  836</span><span class="comment">     * @brief operator &amp;= for other types (bitwise operator)</span></div>
-<div class="line"><a id="l00837" name="l00837"></a><span class="lineno">  837</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00838" name="l00838"></a><span class="lineno">  838</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00839" name="l00839"></a><span class="lineno">  839</span><span class="comment">     * @returns this = this &amp; p (&amp; is bit-wise operator)</span></div>
-<div class="line"><a id="l00840" name="l00840"></a><span class="lineno">  840</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00841" name="l00841"></a><span class="lineno">  841</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00842" name="l00842"></a><span class="lineno">  842</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00834" name="l00834"></a><span class="lineno">  834</span> </div>
+<div class="line"><a id="l00841" name="l00841"></a><span class="lineno">  841</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00842" name="l00842"></a><span class="lineno">  842</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00843" data-start="{" data-end="}">
 <div class="line"><a id="l00843" name="l00843"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#afa79020c27caea31236d04ecaa0e5ef5">  843</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#afa79020c27caea31236d04ecaa0e5ef5">operator&amp;=</a>(<span class="keyword">const</span> T p) {</div>
 <div class="line"><a id="l00844" name="l00844"></a><span class="lineno">  844</span>        s &amp;= p.s;</div>
 <div class="line"><a id="l00845" name="l00845"></a><span class="lineno">  845</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00846" name="l00846"></a><span class="lineno">  846</span>    }</div>
 </div>
-<div class="line"><a id="l00847" name="l00847"></a><span class="lineno">  847</span><span class="comment"></span> </div>
-<div class="line"><a id="l00848" name="l00848"></a><span class="lineno">  848</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00849" name="l00849"></a><span class="lineno">  849</span><span class="comment">     * @brief operator | for other types (bitwise operator)</span></div>
-<div class="line"><a id="l00850" name="l00850"></a><span class="lineno">  850</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00851" name="l00851"></a><span class="lineno">  851</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00852" name="l00852"></a><span class="lineno">  852</span><span class="comment">     * @returns value of this | p (| is bit-wise operator)</span></div>
-<div class="line"><a id="l00853" name="l00853"></a><span class="lineno">  853</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00854" name="l00854"></a><span class="lineno">  854</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00855" name="l00855"></a><span class="lineno">  855</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00847" name="l00847"></a><span class="lineno">  847</span> </div>
+<div class="line"><a id="l00854" name="l00854"></a><span class="lineno">  854</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00855" name="l00855"></a><span class="lineno">  855</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00856" data-start="{" data-end="}">
 <div class="line"><a id="l00856" name="l00856"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf">  856</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf">operator|</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00857" name="l00857"></a><span class="lineno">  857</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> | <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p);</div>
 <div class="line"><a id="l00858" name="l00858"></a><span class="lineno">  858</span>    }</div>
 </div>
-<div class="line"><a id="l00859" name="l00859"></a><span class="lineno">  859</span><span class="comment"></span> </div>
-<div class="line"><a id="l00860" name="l00860"></a><span class="lineno">  860</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00861" name="l00861"></a><span class="lineno">  861</span><span class="comment">     * @brief operator | for uint256_t (bitwise operator)</span></div>
-<div class="line"><a id="l00862" name="l00862"></a><span class="lineno">  862</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00863" name="l00863"></a><span class="lineno">  863</span><span class="comment">     * @returns value of this | p (| is bit-wise OR operator)</span></div>
-<div class="line"><a id="l00864" name="l00864"></a><span class="lineno">  864</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00859" name="l00859"></a><span class="lineno">  859</span> </div>
 <div class="foldopen" id="foldopen00865" data-start="{" data-end="}">
 <div class="line"><a id="l00865" name="l00865"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2">  865</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2">operator|</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p) {</div>
 <div class="line"><a id="l00866" name="l00866"></a><span class="lineno">  866</span>        <span class="keywordflow">return</span> {this-&gt;f | p.f, this-&gt;s | p.s};</div>
 <div class="line"><a id="l00867" name="l00867"></a><span class="lineno">  867</span>    }</div>
 </div>
-<div class="line"><a id="l00868" name="l00868"></a><span class="lineno">  868</span><span class="comment"></span> </div>
-<div class="line"><a id="l00869" name="l00869"></a><span class="lineno">  869</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00870" name="l00870"></a><span class="lineno">  870</span><span class="comment">     * @brief operator |= for other types (bitwise operator)</span></div>
-<div class="line"><a id="l00871" name="l00871"></a><span class="lineno">  871</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00872" name="l00872"></a><span class="lineno">  872</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00873" name="l00873"></a><span class="lineno">  873</span><span class="comment">     * @returns this = this | p (| is bit-wise OR operator)</span></div>
-<div class="line"><a id="l00874" name="l00874"></a><span class="lineno">  874</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00875" name="l00875"></a><span class="lineno">  875</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00876" name="l00876"></a><span class="lineno">  876</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00868" name="l00868"></a><span class="lineno">  868</span> </div>
+<div class="line"><a id="l00875" name="l00875"></a><span class="lineno">  875</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00876" name="l00876"></a><span class="lineno">  876</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00877" data-start="{" data-end="}">
 <div class="line"><a id="l00877" name="l00877"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#af0a6e09fcf1cbf234ed32df6d7265a0b">  877</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#af0a6e09fcf1cbf234ed32df6d7265a0b">operator|=</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00878" name="l00878"></a><span class="lineno">  878</span>        s |= p;</div>
 <div class="line"><a id="l00879" name="l00879"></a><span class="lineno">  879</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00880" name="l00880"></a><span class="lineno">  880</span>    }</div>
 </div>
-<div class="line"><a id="l00881" name="l00881"></a><span class="lineno">  881</span><span class="comment"></span> </div>
-<div class="line"><a id="l00882" name="l00882"></a><span class="lineno">  882</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00883" name="l00883"></a><span class="lineno">  883</span><span class="comment">     * @brief operator |= for uint256_t (bitwise operator)</span></div>
-<div class="line"><a id="l00884" name="l00884"></a><span class="lineno">  884</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00885" name="l00885"></a><span class="lineno">  885</span><span class="comment">     * @returns this = this | p (| is bit-wise OR operator)</span></div>
-<div class="line"><a id="l00886" name="l00886"></a><span class="lineno">  886</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00881" name="l00881"></a><span class="lineno">  881</span> </div>
 <div class="foldopen" id="foldopen00887" data-start="{" data-end="}">
 <div class="line"><a id="l00887" name="l00887"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc">  887</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc">operator|=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p) {</div>
 <div class="line"><a id="l00888" name="l00888"></a><span class="lineno">  888</span>        f |= p.f;</div>
@@ -1119,37 +732,21 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00890" name="l00890"></a><span class="lineno">  890</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00891" name="l00891"></a><span class="lineno">  891</span>    }</div>
 </div>
-<div class="line"><a id="l00892" name="l00892"></a><span class="lineno">  892</span><span class="comment"></span> </div>
-<div class="line"><a id="l00893" name="l00893"></a><span class="lineno">  893</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00894" name="l00894"></a><span class="lineno">  894</span><span class="comment">     * @brief operator ^ for other types (bitwise operator)</span></div>
-<div class="line"><a id="l00895" name="l00895"></a><span class="lineno">  895</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00896" name="l00896"></a><span class="lineno">  896</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00897" name="l00897"></a><span class="lineno">  897</span><span class="comment">     * @returns value of this ^ p (^ is bit-wise XOR operator)</span></div>
-<div class="line"><a id="l00898" name="l00898"></a><span class="lineno">  898</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00899" name="l00899"></a><span class="lineno">  899</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00900" name="l00900"></a><span class="lineno">  900</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00892" name="l00892"></a><span class="lineno">  892</span> </div>
+<div class="line"><a id="l00899" name="l00899"></a><span class="lineno">  899</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00900" name="l00900"></a><span class="lineno">  900</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00901" data-start="{" data-end="}">
 <div class="line"><a id="l00901" name="l00901"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e">  901</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e">operator^</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00902" name="l00902"></a><span class="lineno">  902</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(f, s ^ p);</div>
 <div class="line"><a id="l00903" name="l00903"></a><span class="lineno">  903</span>    }</div>
 </div>
-<div class="line"><a id="l00904" name="l00904"></a><span class="lineno">  904</span><span class="comment"></span> </div>
-<div class="line"><a id="l00905" name="l00905"></a><span class="lineno">  905</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00906" name="l00906"></a><span class="lineno">  906</span><span class="comment">     * @brief operator ^ for uint256_t (bitwise operator)</span></div>
-<div class="line"><a id="l00907" name="l00907"></a><span class="lineno">  907</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00908" name="l00908"></a><span class="lineno">  908</span><span class="comment">     * @returns value of this ^ p (^ is bit-wise XOR operator)</span></div>
-<div class="line"><a id="l00909" name="l00909"></a><span class="lineno">  909</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00904" name="l00904"></a><span class="lineno">  904</span> </div>
 <div class="foldopen" id="foldopen00910" data-start="{" data-end="}">
 <div class="line"><a id="l00910" name="l00910"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a74d1e1dd8cd2b31e00813ed939943be7">  910</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../d1/d83/classuint256__t.html#a74d1e1dd8cd2b31e00813ed939943be7">operator^</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p) {</div>
 <div class="line"><a id="l00911" name="l00911"></a><span class="lineno">  911</span>        <span class="keywordflow">return</span> {this-&gt;f ^ p.f, this-&gt;s ^ p.s};</div>
 <div class="line"><a id="l00912" name="l00912"></a><span class="lineno">  912</span>    }</div>
 </div>
-<div class="line"><a id="l00913" name="l00913"></a><span class="lineno">  913</span><span class="comment"></span> </div>
-<div class="line"><a id="l00914" name="l00914"></a><span class="lineno">  914</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00915" name="l00915"></a><span class="lineno">  915</span><span class="comment">     * @brief operator ^= for uint256_t (bitwise operator)</span></div>
-<div class="line"><a id="l00916" name="l00916"></a><span class="lineno">  916</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00917" name="l00917"></a><span class="lineno">  917</span><span class="comment">     * @returns this = this ^ p (^ is bit-wise XOR operator)</span></div>
-<div class="line"><a id="l00918" name="l00918"></a><span class="lineno">  918</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00913" name="l00913"></a><span class="lineno">  913</span> </div>
 <div class="foldopen" id="foldopen00919" data-start="{" data-end="}">
 <div class="line"><a id="l00919" name="l00919"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7">  919</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7">operator^=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;p) {</div>
 <div class="line"><a id="l00920" name="l00920"></a><span class="lineno">  920</span>        f ^= p.f;</div>
@@ -1157,37 +754,22 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 <div class="line"><a id="l00922" name="l00922"></a><span class="lineno">  922</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00923" name="l00923"></a><span class="lineno">  923</span>    }</div>
 </div>
-<div class="line"><a id="l00924" name="l00924"></a><span class="lineno">  924</span><span class="comment"></span> </div>
-<div class="line"><a id="l00925" name="l00925"></a><span class="lineno">  925</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00926" name="l00926"></a><span class="lineno">  926</span><span class="comment">     * @brief operator ^= for other types (bitwise operator)</span></div>
-<div class="line"><a id="l00927" name="l00927"></a><span class="lineno">  927</span><span class="comment">     * @tparam T integral type</span></div>
-<div class="line"><a id="l00928" name="l00928"></a><span class="lineno">  928</span><span class="comment">     * @param p number to be operated</span></div>
-<div class="line"><a id="l00929" name="l00929"></a><span class="lineno">  929</span><span class="comment">     * @returns this = this ^ p (^ is bit-wise XOR operator)</span></div>
-<div class="line"><a id="l00930" name="l00930"></a><span class="lineno">  930</span><span class="comment">     */</span></div>
-<div class="line"><a id="l00931" name="l00931"></a><span class="lineno">  931</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00932" name="l00932"></a><span class="lineno">  932</span>                              <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00924" name="l00924"></a><span class="lineno">  924</span> </div>
+<div class="line"><a id="l00931" name="l00931"></a><span class="lineno">  931</span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00932" name="l00932"></a><span class="lineno">  932</span>                              std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="foldopen" id="foldopen00933" data-start="{" data-end="}">
 <div class="line"><a id="l00933" name="l00933"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a3dc4d3ab175f5f2a3172eb8d99a60fc3">  933</a></span>    <span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;<a class="code hl_function" href="../../d1/d83/classuint256__t.html#a3dc4d3ab175f5f2a3172eb8d99a60fc3">operator^=</a>(<span class="keyword">const</span> T &amp;p) {</div>
 <div class="line"><a id="l00934" name="l00934"></a><span class="lineno">  934</span>        s ^= p;</div>
 <div class="line"><a id="l00935" name="l00935"></a><span class="lineno">  935</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><a id="l00936" name="l00936"></a><span class="lineno">  936</span>    }</div>
 </div>
-<div class="line"><a id="l00937" name="l00937"></a><span class="lineno">  937</span><span class="comment"></span> </div>
-<div class="line"><a id="l00938" name="l00938"></a><span class="lineno">  938</span><span class="comment">    /**</span></div>
-<div class="line"><a id="l00939" name="l00939"></a><span class="lineno">  939</span><span class="comment">     * @brief operator &lt;&lt; for printing uint256_t integer</span></div>
-<div class="line"><a id="l00940" name="l00940"></a><span class="lineno">  940</span><span class="comment">     * @details Prints the uint256_t integer in decimal form</span></div>
-<div class="line"><a id="l00941" name="l00941"></a><span class="lineno">  941</span><span class="comment">     * @note Note that this operator is costly since it uses strings to print</span></div>
-<div class="line"><a id="l00942" name="l00942"></a><span class="lineno">  942</span><span class="comment">     * the value</span></div>
-<div class="line"><a id="l00943" name="l00943"></a><span class="lineno">  943</span><span class="comment">     * @param op ostream object</span></div>
-<div class="line"><a id="l00944" name="l00944"></a><span class="lineno">  944</span><span class="comment">     * @param p 256-bit integer</span></div>
-<div class="line"><a id="l00945" name="l00945"></a><span class="lineno">  945</span><span class="comment">     * @returns op, ostream object.</span></div>
-<div class="line"><a id="l00946" name="l00946"></a><span class="lineno">  946</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00937" name="l00937"></a><span class="lineno">  937</span> </div>
 <div class="foldopen" id="foldopen00947" data-start="{" data-end="};">
-<div class="line"><a id="l00947" name="l00947"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a91badfd31be84b12cbb6d85ebc04d13a">  947</a></span>    <span class="keyword">friend</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;<a class="code hl_friend" href="../../d1/d83/classuint256__t.html#a91badfd31be84b12cbb6d85ebc04d13a">operator&lt;&lt;</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;op, <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> p) {</div>
+<div class="line"><a id="l00947" name="l00947"></a><span class="lineno"><a class="line" href="../../d1/d83/classuint256__t.html#a91badfd31be84b12cbb6d85ebc04d13a">  947</a></span>    <span class="keyword">friend</span> std::ostream &amp;<a class="code hl_friend" href="../../d1/d83/classuint256__t.html#a91badfd31be84b12cbb6d85ebc04d13a">operator&lt;&lt;</a>(std::ostream &amp;op, <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> p) {</div>
 <div class="line"><a id="l00948" name="l00948"></a><span class="lineno">  948</span>        <span class="keywordflow">if</span> (!p.f) {</div>
 <div class="line"><a id="l00949" name="l00949"></a><span class="lineno">  949</span>            op &lt;&lt; p.s;</div>
 <div class="line"><a id="l00950" name="l00950"></a><span class="lineno">  950</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><a id="l00951" name="l00951"></a><span class="lineno">  951</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> out = <span class="stringliteral">&quot;0&quot;</span>, p_2 = <span class="stringliteral">&quot;1&quot;</span>;</div>
+<div class="line"><a id="l00951" name="l00951"></a><span class="lineno">  951</span>            std::string out = <span class="stringliteral">&quot;0&quot;</span>, p_2 = <span class="stringliteral">&quot;1&quot;</span>;</div>
 <div class="line"><a id="l00952" name="l00952"></a><span class="lineno">  952</span>            <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> L(1);</div>
 <div class="line"><a id="l00953" name="l00953"></a><span class="lineno">  953</span>            <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; 128; ++i) {</div>
 <div class="line"><a id="l00954" name="l00954"></a><span class="lineno">  954</span>                <span class="keywordflow">if</span> ((p.s &amp; L)) {</div>
@@ -1213,204 +795,192 @@ $(function(){initNavTree('da/da3/uint256__t_8hpp_source.html','../../'); initRes
 </div>
 <div class="line"><a id="l00973" name="l00973"></a><span class="lineno">  973</span> </div>
 <div class="line"><a id="l00974" name="l00974"></a><span class="lineno">  974</span><span class="comment">// Artihmetic</span></div>
-<div class="line"><a id="l00975" name="l00975"></a><span class="lineno">  975</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00976" name="l00976"></a><span class="lineno">  976</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00975" name="l00975"></a><span class="lineno">  975</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00976" name="l00976"></a><span class="lineno">  976</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l00977" name="l00977"></a><span class="lineno">  977</span><span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> operator+(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
 <div class="line"><a id="l00978" name="l00978"></a><span class="lineno">  978</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) + q;</div>
 <div class="line"><a id="l00979" name="l00979"></a><span class="lineno">  979</span>}</div>
 <div class="line"><a id="l00980" name="l00980"></a><span class="lineno">  980</span> </div>
-<div class="line"><a id="l00981" name="l00981"></a><span class="lineno">  981</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00982" name="l00982"></a><span class="lineno">  982</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00981" name="l00981"></a><span class="lineno">  981</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00982" name="l00982"></a><span class="lineno">  982</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l00983" name="l00983"></a><span class="lineno">  983</span><span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> operator-(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
 <div class="line"><a id="l00984" name="l00984"></a><span class="lineno">  984</span>    <span class="keywordflow">return</span> (<a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) - q);</div>
 <div class="line"><a id="l00985" name="l00985"></a><span class="lineno">  985</span>}</div>
 <div class="line"><a id="l00986" name="l00986"></a><span class="lineno">  986</span> </div>
-<div class="line"><a id="l00987" name="l00987"></a><span class="lineno">  987</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00988" name="l00988"></a><span class="lineno">  988</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00987" name="l00987"></a><span class="lineno">  987</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00988" name="l00988"></a><span class="lineno">  988</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l00989" name="l00989"></a><span class="lineno">  989</span><span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> operator*(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
 <div class="line"><a id="l00990" name="l00990"></a><span class="lineno">  990</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) * q;</div>
 <div class="line"><a id="l00991" name="l00991"></a><span class="lineno">  991</span>}</div>
 <div class="line"><a id="l00992" name="l00992"></a><span class="lineno">  992</span> </div>
-<div class="line"><a id="l00993" name="l00993"></a><span class="lineno">  993</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l00994" name="l00994"></a><span class="lineno">  994</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00993" name="l00993"></a><span class="lineno">  993</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l00994" name="l00994"></a><span class="lineno">  994</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l00995" name="l00995"></a><span class="lineno">  995</span><span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> operator/(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
 <div class="line"><a id="l00996" name="l00996"></a><span class="lineno">  996</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) / q;</div>
 <div class="line"><a id="l00997" name="l00997"></a><span class="lineno">  997</span>}</div>
 <div class="line"><a id="l00998" name="l00998"></a><span class="lineno">  998</span> </div>
-<div class="line"><a id="l00999" name="l00999"></a><span class="lineno">  999</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01000" name="l01000"></a><span class="lineno"> 1000</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l00999" name="l00999"></a><span class="lineno">  999</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01000" name="l01000"></a><span class="lineno"> 1000</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01001" name="l01001"></a><span class="lineno"> 1001</span><span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> operator%(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
 <div class="line"><a id="l01002" name="l01002"></a><span class="lineno"> 1002</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) % q;</div>
 <div class="line"><a id="l01003" name="l01003"></a><span class="lineno"> 1003</span>}</div>
 <div class="line"><a id="l01004" name="l01004"></a><span class="lineno"> 1004</span> </div>
 <div class="line"><a id="l01005" name="l01005"></a><span class="lineno"> 1005</span><span class="comment">// Bitwise operators</span></div>
-<div class="line"><a id="l01006" name="l01006"></a><span class="lineno"> 1006</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01007" name="l01007"></a><span class="lineno"> 1007</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l01006" name="l01006"></a><span class="lineno"> 1006</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01007" name="l01007"></a><span class="lineno"> 1007</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01008" name="l01008"></a><span class="lineno"> 1008</span><span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> operator&amp;(<span class="keyword">const</span> T &amp;p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
 <div class="line"><a id="l01009" name="l01009"></a><span class="lineno"> 1009</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) &amp; q;</div>
 <div class="line"><a id="l01010" name="l01010"></a><span class="lineno"> 1010</span>}</div>
 <div class="line"><a id="l01011" name="l01011"></a><span class="lineno"> 1011</span> </div>
-<div class="line"><a id="l01012" name="l01012"></a><span class="lineno"> 1012</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01013" name="l01013"></a><span class="lineno"> 1013</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l01012" name="l01012"></a><span class="lineno"> 1012</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01013" name="l01013"></a><span class="lineno"> 1013</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01014" name="l01014"></a><span class="lineno"> 1014</span><span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> operator|(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
 <div class="line"><a id="l01015" name="l01015"></a><span class="lineno"> 1015</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) | q;</div>
 <div class="line"><a id="l01016" name="l01016"></a><span class="lineno"> 1016</span>}</div>
 <div class="line"><a id="l01017" name="l01017"></a><span class="lineno"> 1017</span> </div>
-<div class="line"><a id="l01018" name="l01018"></a><span class="lineno"> 1018</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01019" name="l01019"></a><span class="lineno"> 1019</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l01018" name="l01018"></a><span class="lineno"> 1018</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01019" name="l01019"></a><span class="lineno"> 1019</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01020" name="l01020"></a><span class="lineno"> 1020</span><span class="keyword">inline</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> operator^(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
 <div class="line"><a id="l01021" name="l01021"></a><span class="lineno"> 1021</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) ^ q;</div>
 <div class="line"><a id="l01022" name="l01022"></a><span class="lineno"> 1022</span>}</div>
 <div class="line"><a id="l01023" name="l01023"></a><span class="lineno"> 1023</span> </div>
 <div class="line"><a id="l01024" name="l01024"></a><span class="lineno"> 1024</span><span class="comment">// Boolean operators</span></div>
-<div class="line"><a id="l01025" name="l01025"></a><span class="lineno"> 1025</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01026" name="l01026"></a><span class="lineno"> 1026</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l01025" name="l01025"></a><span class="lineno"> 1025</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01026" name="l01026"></a><span class="lineno"> 1026</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01027" name="l01027"></a><span class="lineno"> 1027</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> operator&amp;&amp;(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
 <div class="line"><a id="l01028" name="l01028"></a><span class="lineno"> 1028</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) &amp;&amp; q;</div>
 <div class="line"><a id="l01029" name="l01029"></a><span class="lineno"> 1029</span>}</div>
 <div class="line"><a id="l01030" name="l01030"></a><span class="lineno"> 1030</span> </div>
-<div class="line"><a id="l01031" name="l01031"></a><span class="lineno"> 1031</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01032" name="l01032"></a><span class="lineno"> 1032</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l01031" name="l01031"></a><span class="lineno"> 1031</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01032" name="l01032"></a><span class="lineno"> 1032</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01033" name="l01033"></a><span class="lineno"> 1033</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> operator||(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
 <div class="line"><a id="l01034" name="l01034"></a><span class="lineno"> 1034</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) || q;</div>
 <div class="line"><a id="l01035" name="l01035"></a><span class="lineno"> 1035</span>}</div>
 <div class="line"><a id="l01036" name="l01036"></a><span class="lineno"> 1036</span> </div>
 <div class="line"><a id="l01037" name="l01037"></a><span class="lineno"> 1037</span><span class="comment">// Comparison operators</span></div>
-<div class="line"><a id="l01038" name="l01038"></a><span class="lineno"> 1038</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01039" name="l01039"></a><span class="lineno"> 1039</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l01038" name="l01038"></a><span class="lineno"> 1038</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01039" name="l01039"></a><span class="lineno"> 1039</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01040" name="l01040"></a><span class="lineno"> 1040</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> operator==(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
 <div class="line"><a id="l01041" name="l01041"></a><span class="lineno"> 1041</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) == q;</div>
 <div class="line"><a id="l01042" name="l01042"></a><span class="lineno"> 1042</span>}</div>
 <div class="line"><a id="l01043" name="l01043"></a><span class="lineno"> 1043</span> </div>
-<div class="line"><a id="l01044" name="l01044"></a><span class="lineno"> 1044</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01045" name="l01045"></a><span class="lineno"> 1045</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
-<div class="line"><a id="l01046" name="l01046"></a><span class="lineno"> 1046</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html">operator!=</a>(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
+<div class="line"><a id="l01044" name="l01044"></a><span class="lineno"> 1044</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01045" name="l01045"></a><span class="lineno"> 1045</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
+<div class="line"><a id="l01046" name="l01046"></a><span class="lineno"> 1046</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> operator!=(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
 <div class="line"><a id="l01047" name="l01047"></a><span class="lineno"> 1047</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) != q;</div>
 <div class="line"><a id="l01048" name="l01048"></a><span class="lineno"> 1048</span>}</div>
 <div class="line"><a id="l01049" name="l01049"></a><span class="lineno"> 1049</span> </div>
-<div class="line"><a id="l01050" name="l01050"></a><span class="lineno"> 1050</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01051" name="l01051"></a><span class="lineno"> 1051</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
+<div class="line"><a id="l01050" name="l01050"></a><span class="lineno"> 1050</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01051" name="l01051"></a><span class="lineno"> 1051</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
 <div class="line"><a id="l01052" name="l01052"></a><span class="lineno"> 1052</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> operator&lt;(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
 <div class="line"><a id="l01053" name="l01053"></a><span class="lineno"> 1053</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) &lt; q;</div>
 <div class="line"><a id="l01054" name="l01054"></a><span class="lineno"> 1054</span>}</div>
 <div class="line"><a id="l01055" name="l01055"></a><span class="lineno"> 1055</span> </div>
-<div class="line"><a id="l01056" name="l01056"></a><span class="lineno"> 1056</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01057" name="l01057"></a><span class="lineno"> 1057</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
-<div class="line"><a id="l01058" name="l01058"></a><span class="lineno"> 1058</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html">operator&lt;=</a>(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
+<div class="line"><a id="l01056" name="l01056"></a><span class="lineno"> 1056</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01057" name="l01057"></a><span class="lineno"> 1057</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
+<div class="line"><a id="l01058" name="l01058"></a><span class="lineno"> 1058</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> operator&lt;=(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
 <div class="line"><a id="l01059" name="l01059"></a><span class="lineno"> 1059</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) &lt;= q;</div>
 <div class="line"><a id="l01060" name="l01060"></a><span class="lineno"> 1060</span>}</div>
 <div class="line"><a id="l01061" name="l01061"></a><span class="lineno"> 1061</span> </div>
-<div class="line"><a id="l01062" name="l01062"></a><span class="lineno"> 1062</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01063" name="l01063"></a><span class="lineno"> 1063</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
-<div class="line"><a id="l01064" name="l01064"></a><span class="lineno"> 1064</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html">operator&gt;</a>(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
+<div class="line"><a id="l01062" name="l01062"></a><span class="lineno"> 1062</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01063" name="l01063"></a><span class="lineno"> 1063</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
+<div class="line"><a id="l01064" name="l01064"></a><span class="lineno"> 1064</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> operator&gt;(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
 <div class="line"><a id="l01065" name="l01065"></a><span class="lineno"> 1065</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) &gt; q;</div>
 <div class="line"><a id="l01066" name="l01066"></a><span class="lineno"> 1066</span>}</div>
 <div class="line"><a id="l01067" name="l01067"></a><span class="lineno"> 1067</span> </div>
-<div class="line"><a id="l01068" name="l01068"></a><span class="lineno"> 1068</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a>&lt;</div>
-<div class="line"><a id="l01069" name="l01069"></a><span class="lineno"> 1069</span>                          <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>, T&gt;::type&gt;</div>
-<div class="line"><a id="l01070" name="l01070"></a><span class="lineno"> 1070</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html">operator&gt;=</a>(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
+<div class="line"><a id="l01068" name="l01068"></a><span class="lineno"> 1068</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> = <span class="keyword">typename</span> std::enable_if&lt;</div>
+<div class="line"><a id="l01069" name="l01069"></a><span class="lineno"> 1069</span>                          std::is_integral&lt;T&gt;::value, T&gt;::type&gt;</div>
+<div class="line"><a id="l01070" name="l01070"></a><span class="lineno"> 1070</span><span class="keyword">inline</span> <span class="keywordtype">bool</span> operator&gt;=(<span class="keyword">const</span> T p, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;q) {</div>
 <div class="line"><a id="l01071" name="l01071"></a><span class="lineno"> 1071</span>    <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(p) &gt;= q;</div>
 <div class="line"><a id="l01072" name="l01072"></a><span class="lineno"> 1072</span>}</div>
 <div class="line"><a id="l01073" name="l01073"></a><span class="lineno"> 1073</span> </div>
 <div class="line"><a id="l01074" name="l01074"></a><span class="lineno"> 1074</span><span class="preprocessor">#endif  </span><span class="comment">// CIPHERS_UINT256_T_HPP_</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::ostream</a></div></div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="aclassuint128__t_html"><div class="ttname"><a href="../../db/d9a/classuint128__t.html">uint128_t</a></div><div class="ttdoc">class for 128-bit unsigned integer</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:60</div></div>
-<div class="ttc" id="aclassuint128__t_html_a1ee2f1ffbd9984faad34883eb45e9705"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">uint128_t::upper</a></div><div class="ttdeci">uint64_t upper() const</div><div class="ttdoc">returns upper 64-bit integer part</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:208</div></div>
-<div class="ttc" id="aclassuint128__t_html_a7d2285a8a6e20b77f82f1f0351afe76e"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e">uint128_t::_trz</a></div><div class="ttdeci">uint32_t _trz()</div><div class="ttdoc">Trailing zeroes in binary.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:163</div></div>
-<div class="ttc" id="aclassuint128__t_html_aa69e1064c0b0b1df1c61acd2ea04fabd"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd">uint128_t::lower</a></div><div class="ttdeci">uint64_t lower() const</div><div class="ttdoc">returns lower 64-bit integer part</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:202</div></div>
-<div class="ttc" id="aclassuint128__t_html_af139bb6e630f1a61919f180978611cd2"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2">uint128_t::_lez</a></div><div class="ttdeci">uint32_t _lez()</div><div class="ttdoc">Leading zeroes in binary.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:140</div></div>
-<div class="ttc" id="aclassuint256__t_html"><div class="ttname"><a href="../../d1/d83/classuint256__t.html">uint256_t</a></div><div class="ttdoc">class for 256-bit unsigned integer</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:33</div></div>
-<div class="ttc" id="aclassuint256__t_html_a02616a4a46727b4c158b2b90de8c75c3"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3">uint256_t::uint256_t</a></div><div class="ttdeci">uint256_t(uint128_t high, uint128_t low)</div><div class="ttdoc">Parameterized constructor.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:103</div></div>
-<div class="ttc" id="aclassuint256__t_html_a028c585069fa53b74c153667ff66352c"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a028c585069fa53b74c153667ff66352c">uint256_t::operator!</a></div><div class="ttdeci">bool operator!()</div><div class="ttdoc">operator ! for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:596</div></div>
-<div class="ttc" id="aclassuint256__t_html_a033d66c965e8d1fbc5bafb59ad60e163"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163">uint256_t::_lez</a></div><div class="ttdeci">uint32_t _lez()</div><div class="ttdoc">Leading zeroes in binary.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:123</div></div>
-<div class="ttc" id="aclassuint256__t_html_a092a766421ba5833452e86a2357d7cfa"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa">uint256_t::uint256_t</a></div><div class="ttdeci">uint256_t(uint256_t &amp;&amp;num) noexcept</div><div class="ttdoc">Move constructor.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:95</div></div>
-<div class="ttc" id="aclassuint256__t_html_a0d96ce2d022dc30c2f303ab0698f52f5"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5">uint256_t::operator&lt;&lt;=</a></div><div class="ttdeci">uint256_t &amp; operator&lt;&lt;=(const T &amp;p)</div><div class="ttdoc">operator &lt;&lt;= for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:751</div></div>
-<div class="ttc" id="aclassuint256__t_html_a19c88f8f2736750822b82ef9a7096d88"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88">uint256_t::operator&lt;=</a></div><div class="ttdeci">bool operator&lt;=(const uint256_t &amp;other)</div><div class="ttdoc">operator &lt;= for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:552</div></div>
-<div class="ttc" id="aclassuint256__t_html_a1fa3d95584d071add9b46597d3747b39"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39">uint256_t::uint256_t</a></div><div class="ttdeci">uint256_t(const std::string &amp;str)</div><div class="ttdoc">Parameterized constructor.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:81</div></div>
-<div class="ttc" id="aclassuint256__t_html_a2029e9777f999bffef6004429b4f19f2"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a2029e9777f999bffef6004429b4f19f2">uint256_t::operator&lt;=</a></div><div class="ttdeci">bool operator&lt;=(const T &amp;other)</div><div class="ttdoc">operator &lt;= for other types</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:642</div></div>
-<div class="ttc" id="aclassuint256__t_html_a20dc3a017b1a740c4bafd3f146a90b0f"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f">uint256_t::operator+</a></div><div class="ttdeci">uint256_t operator+(const T &amp;p)</div><div class="ttdoc">operator + for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:220</div></div>
-<div class="ttc" id="aclassuint256__t_html_a28d26847f9b19a4f86c187791cb0db13"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a28d26847f9b19a4f86c187791cb0db13">uint256_t::operator--</a></div><div class="ttdeci">uint256_t operator--(int p)</div><div class="ttdoc">operator – (post-decrement)</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:322</div></div>
-<div class="ttc" id="aclassuint256__t_html_a2b5f745c05d10fa85ba5c409ad92d052"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052">uint256_t::uint256_t</a></div><div class="ttdeci">uint256_t(const uint64_t high, const uint64_t low)</div><div class="ttdoc">Parameterized constructor.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:111</div></div>
-<div class="ttc" id="aclassuint256__t_html_a2cd43a4a92dc825a010a17578b3bdedb"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a2cd43a4a92dc825a010a17578b3bdedb">uint256_t::operator%=</a></div><div class="ttdeci">uint256_t &amp; operator%=(const uint256_t &amp;p)</div><div class="ttdoc">operator %= for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:520</div></div>
-<div class="ttc" id="aclassuint256__t_html_a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2">uint256_t::operator|</a></div><div class="ttdeci">uint256_t operator|(const uint256_t &amp;p)</div><div class="ttdoc">operator | for uint256_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:865</div></div>
-<div class="ttc" id="aclassuint256__t_html_a303287d7bc8686dcb47fcb04720ad409"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a303287d7bc8686dcb47fcb04720ad409">uint256_t::operator&amp;&amp;</a></div><div class="ttdeci">bool operator&amp;&amp;(const T &amp;b)</div><div class="ttdoc">operator &amp;&amp; for other types</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:702</div></div>
-<div class="ttc" id="aclassuint256__t_html_a357cdfee6a79e0484cd1e07511eb9f2d"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d">uint256_t::operator&amp;=</a></div><div class="ttdeci">uint256_t &amp; operator&amp;=(const uint256_t &amp;p)</div><div class="ttdoc">operator &amp;= for uint256_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:829</div></div>
-<div class="ttc" id="aclassuint256__t_html_a3dc4d3ab175f5f2a3172eb8d99a60fc3"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a3dc4d3ab175f5f2a3172eb8d99a60fc3">uint256_t::operator^=</a></div><div class="ttdeci">uint256_t &amp; operator^=(const T &amp;p)</div><div class="ttdoc">operator ^= for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:933</div></div>
+<div class="ttc" id="aclassuint128__t_html"><div class="ttname"><a href="../../db/d9a/classuint128__t.html">uint128_t</a></div><div class="ttdoc">class for 128-bit unsigned integer</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00060">uint128_t.hpp:60</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a1ee2f1ffbd9984faad34883eb45e9705"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">uint128_t::upper</a></div><div class="ttdeci">uint64_t upper() const</div><div class="ttdoc">returns upper 64-bit integer part</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00208">uint128_t.hpp:208</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_a7d2285a8a6e20b77f82f1f0351afe76e"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e">uint128_t::_trz</a></div><div class="ttdeci">uint32_t _trz()</div><div class="ttdoc">Trailing zeroes in binary.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00163">uint128_t.hpp:163</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_aa69e1064c0b0b1df1c61acd2ea04fabd"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd">uint128_t::lower</a></div><div class="ttdeci">uint64_t lower() const</div><div class="ttdoc">returns lower 64-bit integer part</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00202">uint128_t.hpp:202</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_af139bb6e630f1a61919f180978611cd2"><div class="ttname"><a href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2">uint128_t::_lez</a></div><div class="ttdeci">uint32_t _lez()</div><div class="ttdoc">Leading zeroes in binary.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00140">uint128_t.hpp:140</a></div></div>
+<div class="ttc" id="aclassuint256__t_html"><div class="ttname"><a href="../../d1/d83/classuint256__t.html">uint256_t</a></div><div class="ttdoc">class for 256-bit unsigned integer</div><div class="ttdef"><b>Definition</b> <a href="#l00033">uint256_t.hpp:33</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a02616a4a46727b4c158b2b90de8c75c3"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3">uint256_t::uint256_t</a></div><div class="ttdeci">uint256_t(uint128_t high, uint128_t low)</div><div class="ttdoc">Parameterized constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00103">uint256_t.hpp:103</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a028c585069fa53b74c153667ff66352c"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a028c585069fa53b74c153667ff66352c">uint256_t::operator!</a></div><div class="ttdeci">bool operator!()</div><div class="ttdoc">operator ! for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00596">uint256_t.hpp:596</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a033d66c965e8d1fbc5bafb59ad60e163"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163">uint256_t::_lez</a></div><div class="ttdeci">uint32_t _lez()</div><div class="ttdoc">Leading zeroes in binary.</div><div class="ttdef"><b>Definition</b> <a href="#l00123">uint256_t.hpp:123</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a092a766421ba5833452e86a2357d7cfa"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa">uint256_t::uint256_t</a></div><div class="ttdeci">uint256_t(uint256_t &amp;&amp;num) noexcept</div><div class="ttdoc">Move constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00095">uint256_t.hpp:95</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a0d96ce2d022dc30c2f303ab0698f52f5"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5">uint256_t::operator&lt;&lt;=</a></div><div class="ttdeci">uint256_t &amp; operator&lt;&lt;=(const T &amp;p)</div><div class="ttdoc">operator &lt;&lt;= for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00751">uint256_t.hpp:751</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a19c88f8f2736750822b82ef9a7096d88"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88">uint256_t::operator&lt;=</a></div><div class="ttdeci">bool operator&lt;=(const uint256_t &amp;other)</div><div class="ttdoc">operator &lt;= for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00552">uint256_t.hpp:552</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a1fa3d95584d071add9b46597d3747b39"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39">uint256_t::uint256_t</a></div><div class="ttdeci">uint256_t(const std::string &amp;str)</div><div class="ttdoc">Parameterized constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00081">uint256_t.hpp:81</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a2029e9777f999bffef6004429b4f19f2"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a2029e9777f999bffef6004429b4f19f2">uint256_t::operator&lt;=</a></div><div class="ttdeci">bool operator&lt;=(const T &amp;other)</div><div class="ttdoc">operator &lt;= for other types</div><div class="ttdef"><b>Definition</b> <a href="#l00642">uint256_t.hpp:642</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a20dc3a017b1a740c4bafd3f146a90b0f"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f">uint256_t::operator+</a></div><div class="ttdeci">uint256_t operator+(const T &amp;p)</div><div class="ttdoc">operator + for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00220">uint256_t.hpp:220</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a28d26847f9b19a4f86c187791cb0db13"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a28d26847f9b19a4f86c187791cb0db13">uint256_t::operator--</a></div><div class="ttdeci">uint256_t operator--(int p)</div><div class="ttdoc">operator – (post-decrement)</div><div class="ttdef"><b>Definition</b> <a href="#l00322">uint256_t.hpp:322</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a2b5f745c05d10fa85ba5c409ad92d052"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052">uint256_t::uint256_t</a></div><div class="ttdeci">uint256_t(const uint64_t high, const uint64_t low)</div><div class="ttdoc">Parameterized constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00111">uint256_t.hpp:111</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a2cd43a4a92dc825a010a17578b3bdedb"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a2cd43a4a92dc825a010a17578b3bdedb">uint256_t::operator%=</a></div><div class="ttdeci">uint256_t &amp; operator%=(const uint256_t &amp;p)</div><div class="ttdoc">operator %= for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00520">uint256_t.hpp:520</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2">uint256_t::operator|</a></div><div class="ttdeci">uint256_t operator|(const uint256_t &amp;p)</div><div class="ttdoc">operator | for uint256_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00865">uint256_t.hpp:865</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a303287d7bc8686dcb47fcb04720ad409"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a303287d7bc8686dcb47fcb04720ad409">uint256_t::operator&amp;&amp;</a></div><div class="ttdeci">bool operator&amp;&amp;(const T &amp;b)</div><div class="ttdoc">operator &amp;&amp; for other types</div><div class="ttdef"><b>Definition</b> <a href="#l00702">uint256_t.hpp:702</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a357cdfee6a79e0484cd1e07511eb9f2d"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d">uint256_t::operator&amp;=</a></div><div class="ttdeci">uint256_t &amp; operator&amp;=(const uint256_t &amp;p)</div><div class="ttdoc">operator &amp;= for uint256_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00829">uint256_t.hpp:829</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a3dc4d3ab175f5f2a3172eb8d99a60fc3"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a3dc4d3ab175f5f2a3172eb8d99a60fc3">uint256_t::operator^=</a></div><div class="ttdeci">uint256_t &amp; operator^=(const T &amp;p)</div><div class="ttdoc">operator ^= for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00933">uint256_t.hpp:933</a></div></div>
 <div class="ttc" id="aclassuint256__t_html_a3ff17ab14b2371eb3239107d10947067"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a3ff17ab14b2371eb3239107d10947067">uint256_t::~uint256_t</a></div><div class="ttdeci">~uint256_t()=default</div><div class="ttdoc">Destructor for uint256_t.</div></div>
-<div class="ttc" id="aclassuint256__t_html_a406c951a07d8173685dbe384c6ab6a06"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a406c951a07d8173685dbe384c6ab6a06">uint256_t::operator-</a></div><div class="ttdeci">uint256_t operator-()</div><div class="ttdoc">operator - using twos complement</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:307</div></div>
-<div class="ttc" id="aclassuint256__t_html_a41f4bb928c4ee067732503395b65f9d7"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a41f4bb928c4ee067732503395b65f9d7">uint256_t::operator||</a></div><div class="ttdeci">bool operator||(const uint256_t &amp;b)</div><div class="ttdoc">operator || for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:612</div></div>
+<div class="ttc" id="aclassuint256__t_html_a406c951a07d8173685dbe384c6ab6a06"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a406c951a07d8173685dbe384c6ab6a06">uint256_t::operator-</a></div><div class="ttdeci">uint256_t operator-()</div><div class="ttdoc">operator - using twos complement</div><div class="ttdef"><b>Definition</b> <a href="#l00307">uint256_t.hpp:307</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a41f4bb928c4ee067732503395b65f9d7"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a41f4bb928c4ee067732503395b65f9d7">uint256_t::operator||</a></div><div class="ttdeci">bool operator||(const uint256_t &amp;b)</div><div class="ttdoc">operator || for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00612">uint256_t.hpp:612</a></div></div>
 <div class="ttc" id="aclassuint256__t_html_a42bf7490b31d8c750a67fd9bb6f2df2e"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a42bf7490b31d8c750a67fd9bb6f2df2e">uint256_t::uint256_t</a></div><div class="ttdeci">uint256_t(const uint256_t &amp;num)=default</div><div class="ttdoc">Copy constructor.</div></div>
-<div class="ttc" id="aclassuint256__t_html_a4645040fe68ff01d83400f173fd2bb21"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a4645040fe68ff01d83400f173fd2bb21">uint256_t::operator*=</a></div><div class="ttdeci">uint256_t &amp; operator*=(const uint256_t &amp;p)</div><div class="ttdoc">operator *= for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:401</div></div>
-<div class="ttc" id="aclassuint256__t_html_a47a19142e86b7369e18da1fc0a713c51"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51">uint256_t::operator&gt;&gt;</a></div><div class="ttdeci">uint256_t operator&gt;&gt;(const T &amp;p)</div><div class="ttdoc">operator &gt;&gt; for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:772</div></div>
-<div class="ttc" id="aclassuint256__t_html_a4831263abc4430c363fdabce6e6e96d5"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5">uint256_t::operator&lt;&lt;</a></div><div class="ttdeci">uint256_t operator&lt;&lt;(const T &amp;p)</div><div class="ttdoc">operator &lt;&lt; for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:733</div></div>
-<div class="ttc" id="aclassuint256__t_html_a4886747ffff15cdeb6bc93712629f9e7"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a4886747ffff15cdeb6bc93712629f9e7">uint256_t::operator||</a></div><div class="ttdeci">bool operator||(const T &amp;b)</div><div class="ttdoc">operator || for other types</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:715</div></div>
+<div class="ttc" id="aclassuint256__t_html_a4645040fe68ff01d83400f173fd2bb21"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a4645040fe68ff01d83400f173fd2bb21">uint256_t::operator*=</a></div><div class="ttdeci">uint256_t &amp; operator*=(const uint256_t &amp;p)</div><div class="ttdoc">operator *= for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00401">uint256_t.hpp:401</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a47a19142e86b7369e18da1fc0a713c51"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51">uint256_t::operator&gt;&gt;</a></div><div class="ttdeci">uint256_t operator&gt;&gt;(const T &amp;p)</div><div class="ttdoc">operator &gt;&gt; for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00772">uint256_t.hpp:772</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a4831263abc4430c363fdabce6e6e96d5"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5">uint256_t::operator&lt;&lt;</a></div><div class="ttdeci">uint256_t operator&lt;&lt;(const T &amp;p)</div><div class="ttdoc">operator &lt;&lt; for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00733">uint256_t.hpp:733</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a4886747ffff15cdeb6bc93712629f9e7"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a4886747ffff15cdeb6bc93712629f9e7">uint256_t::operator||</a></div><div class="ttdeci">bool operator||(const T &amp;b)</div><div class="ttdoc">operator || for other types</div><div class="ttdef"><b>Definition</b> <a href="#l00715">uint256_t.hpp:715</a></div></div>
 <div class="ttc" id="aclassuint256__t_html_a4c6db67d21c4927a45a4e1e7c2357bfc"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc">uint256_t::operator=</a></div><div class="ttdeci">uint256_t &amp; operator=(const uint256_t &amp;p)=default</div><div class="ttdoc">operator = for uint256_t</div></div>
-<div class="ttc" id="aclassuint256__t_html_a4fdeb4d4bf8cca4ee99b8487e59831df"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a4fdeb4d4bf8cca4ee99b8487e59831df">uint256_t::operator/</a></div><div class="ttdeci">uint256_t operator/(const uint256_t &amp;p)</div><div class="ttdoc">operator / for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:469</div></div>
-<div class="ttc" id="aclassuint256__t_html_a5363ec0f36de1a8a9c985907db4e95d1"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1">uint256_t::operator+=</a></div><div class="ttdeci">uint256_t &amp; operator+=(const T &amp;p)</div><div class="ttdoc">operator += for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:243</div></div>
-<div class="ttc" id="aclassuint256__t_html_a5e84ed2a2f99cee81ede4a0107702a45"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a5e84ed2a2f99cee81ede4a0107702a45">uint256_t::operator-=</a></div><div class="ttdeci">uint256_t &amp; operator-=(const uint256_t &amp;p)</div><div class="ttdoc">operator -= for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:347</div></div>
+<div class="ttc" id="aclassuint256__t_html_a4fdeb4d4bf8cca4ee99b8487e59831df"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a4fdeb4d4bf8cca4ee99b8487e59831df">uint256_t::operator/</a></div><div class="ttdeci">uint256_t operator/(const uint256_t &amp;p)</div><div class="ttdoc">operator / for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00469">uint256_t.hpp:469</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a5363ec0f36de1a8a9c985907db4e95d1"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1">uint256_t::operator+=</a></div><div class="ttdeci">uint256_t &amp; operator+=(const T &amp;p)</div><div class="ttdoc">operator += for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00243">uint256_t.hpp:243</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a5e84ed2a2f99cee81ede4a0107702a45"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a5e84ed2a2f99cee81ede4a0107702a45">uint256_t::operator-=</a></div><div class="ttdeci">uint256_t &amp; operator-=(const uint256_t &amp;p)</div><div class="ttdoc">operator -= for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00347">uint256_t.hpp:347</a></div></div>
 <div class="ttc" id="aclassuint256__t_html_a6c5e025f901f6af4b748f98013350638"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a6c5e025f901f6af4b748f98013350638">uint256_t::operator=</a></div><div class="ttdeci">uint256_t &amp; operator=(uint256_t &amp;&amp;p)=default</div><div class="ttdoc">Move assignment operator.</div></div>
-<div class="ttc" id="aclassuint256__t_html_a6eadaa829087e07eebafca3981566bb8"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8">uint256_t::operator&amp;</a></div><div class="ttdeci">uint256_t operator&amp;(const T &amp;p)</div><div class="ttdoc">operator &amp; for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:811</div></div>
-<div class="ttc" id="aclassuint256__t_html_a6eec1f632aebfc44fee8a74c395e10c2"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a6eec1f632aebfc44fee8a74c395e10c2">uint256_t::operator~</a></div><div class="ttdeci">uint256_t operator~()</div><div class="ttdoc">operator ~ for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:723</div></div>
-<div class="ttc" id="aclassuint256__t_html_a74d1e1dd8cd2b31e00813ed939943be7"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a74d1e1dd8cd2b31e00813ed939943be7">uint256_t::operator^</a></div><div class="ttdeci">uint256_t operator^(const uint256_t &amp;p)</div><div class="ttdoc">operator ^ for uint256_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:910</div></div>
-<div class="ttc" id="aclassuint256__t_html_a76914bc727eab927a3941ef71275327d"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a76914bc727eab927a3941ef71275327d">uint256_t::operator%=</a></div><div class="ttdeci">uint256_t &amp; operator%=(const T &amp;p)</div><div class="ttdoc">operator %= for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:533</div></div>
-<div class="ttc" id="aclassuint256__t_html_a7ac99dea14428200f0101452293e2b3b"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b">uint256_t::operator()</a></div><div class="ttdeci">bool operator()()</div><div class="ttdoc">operator () for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:620</div></div>
-<div class="ttc" id="aclassuint256__t_html_a7bbe36e2ebd52df5efab118897b3050c"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a7bbe36e2ebd52df5efab118897b3050c">uint256_t::operator++</a></div><div class="ttdeci">uint256_t operator++(int)</div><div class="ttdoc">post-increment operator</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:275</div></div>
-<div class="ttc" id="aclassuint256__t_html_a7bd9693b88c4df08b1f8d1fd81c597cc"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a7bd9693b88c4df08b1f8d1fd81c597cc">uint256_t::operator%</a></div><div class="ttdeci">uint256_t operator%(const T &amp;p)</div><div class="ttdoc">operator % for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:509</div></div>
-<div class="ttc" id="aclassuint256__t_html_a8161d52d369e525f4e61129376adfcf1"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1">uint256_t::divide</a></div><div class="ttdeci">std::pair&lt; uint256_t, uint256_t &gt; divide(const uint256_t &amp;p)</div><div class="ttdoc">divide function for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:421</div></div>
-<div class="ttc" id="aclassuint256__t_html_a86aab081bb7db2771e4a4f30c3eed8e2"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2">uint256_t::operator=</a></div><div class="ttdeci">uint256_t &amp; operator=(const std::string &amp;p)</div><div class="ttdoc">operator = for type string</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:202</div></div>
-<div class="ttc" id="aclassuint256__t_html_a88978d00fa6a624c50c2737dc2c294b4"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4">uint256_t::operator-</a></div><div class="ttdeci">uint256_t operator-(const T &amp;p)</div><div class="ttdoc">operator - for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:288</div></div>
-<div class="ttc" id="aclassuint256__t_html_a89cf7fa466458ee08edd9a809d072bcb"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a89cf7fa466458ee08edd9a809d072bcb">uint256_t::operator!=</a></div><div class="ttdeci">bool operator!=(const T &amp;other)</div><div class="ttdoc">operator != for other types</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:690</div></div>
-<div class="ttc" id="aclassuint256__t_html_a90ce75bec5b525de55bbf92c564a2261"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261">uint256_t::operator==</a></div><div class="ttdeci">bool operator==(const uint256_t &amp;other)</div><div class="ttdoc">operator == for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:579</div></div>
-<div class="ttc" id="aclassuint256__t_html_a91badfd31be84b12cbb6d85ebc04d13a"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a91badfd31be84b12cbb6d85ebc04d13a">uint256_t::operator&lt;&lt;</a></div><div class="ttdeci">friend std::ostream &amp; operator&lt;&lt;(std::ostream &amp;op, uint256_t p)</div><div class="ttdoc">operator &lt;&lt; for printing uint256_t integer</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:947</div></div>
-<div class="ttc" id="aclassuint256__t_html_a9879f7ec85fc148e1931fcb492ddc484"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484">uint256_t::operator==</a></div><div class="ttdeci">bool operator==(const T &amp;other)</div><div class="ttdoc">operator == for other types</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:678</div></div>
-<div class="ttc" id="aclassuint256__t_html_a9bc6cc460108306a59281ce4ca216839"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839">uint256_t::operator&amp;</a></div><div class="ttdeci">uint256_t operator&amp;(const uint256_t &amp;p)</div><div class="ttdoc">operator &amp; for uint256_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:820</div></div>
-<div class="ttc" id="aclassuint256__t_html_a9ddd133cee83f3a2ab6ed60a7ccbc250"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250">uint256_t::_trz</a></div><div class="ttdeci">uint32_t _trz()</div><div class="ttdoc">Trailing zeroes in binary.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:135</div></div>
-<div class="ttc" id="aclassuint256__t_html_a9f6f3e39783c893473315bada864a183"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183">uint256_t::operator--</a></div><div class="ttdeci">uint256_t &amp; operator--()</div><div class="ttdoc">operator – (pre-decrement)</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:313</div></div>
-<div class="ttc" id="aclassuint256__t_html_aa0e532832640e9fe273b35c481b18963"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963">uint256_t::operator&amp;&amp;</a></div><div class="ttdeci">bool operator&amp;&amp;(const uint256_t &amp;b)</div><div class="ttdoc">operator &amp;&amp; for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:603</div></div>
-<div class="ttc" id="aclassuint256__t_html_aa28ae272e9176557133a10dffa3b94dc"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc">uint256_t::operator|=</a></div><div class="ttdeci">uint256_t &amp; operator|=(const uint256_t &amp;p)</div><div class="ttdoc">operator |= for uint256_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:887</div></div>
-<div class="ttc" id="aclassuint256__t_html_aa4cf08fa6a33f17594b5a842866f39a1"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1">uint256_t::lower</a></div><div class="ttdeci">uint128_t lower() const</div><div class="ttdoc">returns lower 128-bit integer part</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:169</div></div>
-<div class="ttc" id="aclassuint256__t_html_aa9e585b186e71d7cbe9c1d7387c38967"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967">uint256_t::operator*</a></div><div class="ttdeci">uint256_t operator*(const uint256_t &amp;p)</div><div class="ttdoc">operator * for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:371</div></div>
-<div class="ttc" id="aclassuint256__t_html_aaca9288fd28fc07e1386f1586bd51616"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616">uint256_t::operator*</a></div><div class="ttdeci">uint256_t operator*(const T &amp;p)</div><div class="ttdoc">operator * for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:362</div></div>
-<div class="ttc" id="aclassuint256__t_html_aae68a7bd17c14a926fb77758b5c8e547"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#aae68a7bd17c14a926fb77758b5c8e547">uint256_t::operator!=</a></div><div class="ttdeci">bool operator!=(const uint256_t &amp;other)</div><div class="ttdoc">operator != for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:588</div></div>
-<div class="ttc" id="aclassuint256__t_html_ab909ef62a0c85121e7d743c016fb723d"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#ab909ef62a0c85121e7d743c016fb723d">uint256_t::operator-</a></div><div class="ttdeci">uint256_t operator-(const uint256_t &amp;p)</div><div class="ttdoc">operator - for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:298</div></div>
-<div class="ttc" id="aclassuint256__t_html_abc793979ec70bb8e5cf177d83649a259"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#abc793979ec70bb8e5cf177d83649a259">uint256_t::operator/=</a></div><div class="ttdeci">uint256_t &amp; operator/=(const T &amp;p)</div><div class="ttdoc">operator /= for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:489</div></div>
-<div class="ttc" id="aclassuint256__t_html_ac1b36e64de42f3622e7d6ec5efa273d4"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4">uint256_t::operator/=</a></div><div class="ttdeci">uint256_t &amp; operator/=(const uint256_t &amp;p)</div><div class="ttdoc">operator /= for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:476</div></div>
-<div class="ttc" id="aclassuint256__t_html_ac6bdcf64653af8173987bf7217e99056"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#ac6bdcf64653af8173987bf7217e99056">uint256_t::operator&lt;</a></div><div class="ttdeci">bool operator&lt;(const T &amp;other)</div><div class="ttdoc">operator &lt; for other types</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:630</div></div>
-<div class="ttc" id="aclassuint256__t_html_ac75a46fe3625caf10e07db1eb75a1d6e"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#ac75a46fe3625caf10e07db1eb75a1d6e">uint256_t::operator+=</a></div><div class="ttdeci">uint256_t &amp; operator+=(const uint256_t &amp;p)</div><div class="ttdoc">operator += for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:255</div></div>
-<div class="ttc" id="aclassuint256__t_html_ac92ac0b2368990fbbaf3cca3ee8247d7"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7">uint256_t::operator^=</a></div><div class="ttdeci">uint256_t &amp; operator^=(const uint256_t &amp;p)</div><div class="ttdoc">operator ^= for uint256_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:919</div></div>
-<div class="ttc" id="aclassuint256__t_html_acac9901ab133caa57d058a377d873bf6"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6">uint256_t::operator/</a></div><div class="ttdeci">uint256_t operator/(const T &amp;p)</div><div class="ttdoc">operator / for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:458</div></div>
-<div class="ttc" id="aclassuint256__t_html_acadd235e0029ec43d5990d24affaf42d"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d">uint256_t::operator&gt;</a></div><div class="ttdeci">bool operator&gt;(const uint256_t &amp;other)</div><div class="ttdoc">operator &gt; for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:561</div></div>
-<div class="ttc" id="aclassuint256__t_html_acb61fe17d064c61adc02defa651f9a5e"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e">uint256_t::operator^</a></div><div class="ttdeci">uint256_t operator^(const T &amp;p)</div><div class="ttdoc">operator ^ for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:901</div></div>
-<div class="ttc" id="aclassuint256__t_html_acd3970c633eb2c597874e2712392f0c7"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7">uint256_t::operator-=</a></div><div class="ttdeci">uint256_t operator-=(const T p)</div><div class="ttdoc">operator -= for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:335</div></div>
-<div class="ttc" id="aclassuint256__t_html_acefecc3b1a4044f2be5ab46eea0099bf"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf">uint256_t::operator|</a></div><div class="ttdeci">uint256_t operator|(const T &amp;p)</div><div class="ttdoc">operator | for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:856</div></div>
-<div class="ttc" id="aclassuint256__t_html_ad4928175eaaaa2b559bc945affe63ad2"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#ad4928175eaaaa2b559bc945affe63ad2">uint256_t::operator%</a></div><div class="ttdeci">uint256_t operator%(const uint256_t &amp;p)</div><div class="ttdoc">operator % for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:499</div></div>
-<div class="ttc" id="aclassuint256__t_html_ad74d33215517459c2b33ace7a9c6bc13"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#ad74d33215517459c2b33ace7a9c6bc13">uint256_t::operator&gt;</a></div><div class="ttdeci">bool operator&gt;(const T &amp;other)</div><div class="ttdoc">operator &gt; for other types</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:654</div></div>
-<div class="ttc" id="aclassuint256__t_html_ad9ce2370b1497efbcc426793048e1f78"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#ad9ce2370b1497efbcc426793048e1f78">uint256_t::operator&gt;&gt;=</a></div><div class="ttdeci">uint256_t &amp; operator&gt;&gt;=(const T &amp;p)</div><div class="ttdoc">operator &gt;&gt;= for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:790</div></div>
-<div class="ttc" id="aclassuint256__t_html_addff5645f6005e7b50a6ad0731e4f19c"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#addff5645f6005e7b50a6ad0731e4f19c">uint256_t::operator=</a></div><div class="ttdeci">uint256_t &amp; operator=(const T &amp;p)</div><div class="ttdoc">operator = for other types</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:192</div></div>
-<div class="ttc" id="aclassuint256__t_html_adf09395f9113a69a05fed7e25b46c8ad"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad">uint256_t::operator&gt;=</a></div><div class="ttdeci">bool operator&gt;=(const uint256_t &amp;other)</div><div class="ttdoc">operator &gt;= for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:570</div></div>
-<div class="ttc" id="aclassuint256__t_html_aecb2883133c8c8b9fcfb77ab69b03ab5"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5">uint256_t::upper</a></div><div class="ttdeci">uint128_t upper() const</div><div class="ttdoc">returns upper 128-bit integer part</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:175</div></div>
-<div class="ttc" id="aclassuint256__t_html_aed0f8c3d5be23644c4bcb2fd2551e1dc"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc">uint256_t::uint256_t</a></div><div class="ttdeci">uint256_t(T low)</div><div class="ttdoc">Parameterized constructor.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:75</div></div>
-<div class="ttc" id="aclassuint256__t_html_af0a6e09fcf1cbf234ed32df6d7265a0b"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#af0a6e09fcf1cbf234ed32df6d7265a0b">uint256_t::operator|=</a></div><div class="ttdeci">uint256_t &amp; operator|=(const T &amp;p)</div><div class="ttdoc">operator |= for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:877</div></div>
-<div class="ttc" id="aclassuint256__t_html_af0ad4080bb5ddc16b54a7e87911005c9"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9">uint256_t::operator++</a></div><div class="ttdeci">uint256_t &amp; operator++()</div><div class="ttdoc">pre-increment operator</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:266</div></div>
-<div class="ttc" id="aclassuint256__t_html_af18e2e3d7ed635c4056062bc906fef75"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#af18e2e3d7ed635c4056062bc906fef75">uint256_t::operator+</a></div><div class="ttdeci">uint256_t operator+(const uint256_t &amp;p)</div><div class="ttdoc">operator + for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:230</div></div>
-<div class="ttc" id="aclassuint256__t_html_af2193ff0d0e93143fb71f4847df16028"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028">uint256_t::operator*=</a></div><div class="ttdeci">uint256_t &amp; operator*=(const T &amp;p)</div><div class="ttdoc">operator *= for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:392</div></div>
-<div class="ttc" id="aclassuint256__t_html_afa79020c27caea31236d04ecaa0e5ef5"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#afa79020c27caea31236d04ecaa0e5ef5">uint256_t::operator&amp;=</a></div><div class="ttdeci">uint256_t &amp; operator&amp;=(const T p)</div><div class="ttdoc">operator &amp;= for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:843</div></div>
-<div class="ttc" id="aclassuint256__t_html_afe9f4828d73dd51a080585dd0b99af96"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96">uint256_t::operator&lt;</a></div><div class="ttdeci">bool operator&lt;(const uint256_t &amp;other)</div><div class="ttdoc">operator &lt; for uint256_t</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:543</div></div>
-<div class="ttc" id="aclassuint256__t_html_afee82fa5052e9d8c946b9205b943cec4"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4">uint256_t::__get_integer_from_string</a></div><div class="ttdeci">void __get_integer_from_string(const std::string &amp;str)</div><div class="ttdoc">First and second half of 256 bit number.</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:43</div></div>
-<div class="ttc" id="aclassuint256__t_html_aff4d49cf84de64301b169ad974f00bad"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#aff4d49cf84de64301b169ad974f00bad">uint256_t::operator&gt;=</a></div><div class="ttdeci">bool operator&gt;=(const T &amp;other)</div><div class="ttdoc">operator &gt;= for other types</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:666</div></div>
-<div class="ttc" id="aenable_if_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/enable_if.html">std::enable_if</a></div></div>
-<div class="ttc" id="aintegral_constant_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a></div></div>
-<div class="ttc" id="ais_arithmetic_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/is_arithmetic.html">std::is_arithmetic</a></div></div>
-<div class="ttc" id="ais_integral_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral</a></div></div>
-<div class="ttc" id="ais_unsigned_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/is_unsigned.html">std::is_unsigned</a></div></div>
-<div class="ttc" id="amove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></div><div class="ttdeci">T move(T... args)</div></div>
-<div class="ttc" id="anamespacestd_html"><div class="ttname"><a href="../../d8/dcc/namespacestd.html">std</a></div><div class="ttdoc">STL namespace.</div></div>
-<div class="ttc" id="aoperator_cmp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html">std::rel_ops::operator!=</a></div><div class="ttdeci">T operator!=(T... args)</div></div>
-<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
+<div class="ttc" id="aclassuint256__t_html_a6eadaa829087e07eebafca3981566bb8"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8">uint256_t::operator&amp;</a></div><div class="ttdeci">uint256_t operator&amp;(const T &amp;p)</div><div class="ttdoc">operator &amp; for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00811">uint256_t.hpp:811</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a6eec1f632aebfc44fee8a74c395e10c2"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a6eec1f632aebfc44fee8a74c395e10c2">uint256_t::operator~</a></div><div class="ttdeci">uint256_t operator~()</div><div class="ttdoc">operator ~ for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00723">uint256_t.hpp:723</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a74d1e1dd8cd2b31e00813ed939943be7"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a74d1e1dd8cd2b31e00813ed939943be7">uint256_t::operator^</a></div><div class="ttdeci">uint256_t operator^(const uint256_t &amp;p)</div><div class="ttdoc">operator ^ for uint256_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00910">uint256_t.hpp:910</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a76914bc727eab927a3941ef71275327d"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a76914bc727eab927a3941ef71275327d">uint256_t::operator%=</a></div><div class="ttdeci">uint256_t &amp; operator%=(const T &amp;p)</div><div class="ttdoc">operator %= for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00533">uint256_t.hpp:533</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a7ac99dea14428200f0101452293e2b3b"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b">uint256_t::operator()</a></div><div class="ttdeci">bool operator()()</div><div class="ttdoc">operator () for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00620">uint256_t.hpp:620</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a7bbe36e2ebd52df5efab118897b3050c"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a7bbe36e2ebd52df5efab118897b3050c">uint256_t::operator++</a></div><div class="ttdeci">uint256_t operator++(int)</div><div class="ttdoc">post-increment operator</div><div class="ttdef"><b>Definition</b> <a href="#l00275">uint256_t.hpp:275</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a7bd9693b88c4df08b1f8d1fd81c597cc"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a7bd9693b88c4df08b1f8d1fd81c597cc">uint256_t::operator%</a></div><div class="ttdeci">uint256_t operator%(const T &amp;p)</div><div class="ttdoc">operator % for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00509">uint256_t.hpp:509</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a8161d52d369e525f4e61129376adfcf1"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1">uint256_t::divide</a></div><div class="ttdeci">std::pair&lt; uint256_t, uint256_t &gt; divide(const uint256_t &amp;p)</div><div class="ttdoc">divide function for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00421">uint256_t.hpp:421</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a86aab081bb7db2771e4a4f30c3eed8e2"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2">uint256_t::operator=</a></div><div class="ttdeci">uint256_t &amp; operator=(const std::string &amp;p)</div><div class="ttdoc">operator = for type string</div><div class="ttdef"><b>Definition</b> <a href="#l00202">uint256_t.hpp:202</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a88978d00fa6a624c50c2737dc2c294b4"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4">uint256_t::operator-</a></div><div class="ttdeci">uint256_t operator-(const T &amp;p)</div><div class="ttdoc">operator - for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00288">uint256_t.hpp:288</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a89cf7fa466458ee08edd9a809d072bcb"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a89cf7fa466458ee08edd9a809d072bcb">uint256_t::operator!=</a></div><div class="ttdeci">bool operator!=(const T &amp;other)</div><div class="ttdoc">operator != for other types</div><div class="ttdef"><b>Definition</b> <a href="#l00690">uint256_t.hpp:690</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a90ce75bec5b525de55bbf92c564a2261"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261">uint256_t::operator==</a></div><div class="ttdeci">bool operator==(const uint256_t &amp;other)</div><div class="ttdoc">operator == for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00579">uint256_t.hpp:579</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a91badfd31be84b12cbb6d85ebc04d13a"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a91badfd31be84b12cbb6d85ebc04d13a">uint256_t::operator&lt;&lt;</a></div><div class="ttdeci">friend std::ostream &amp; operator&lt;&lt;(std::ostream &amp;op, uint256_t p)</div><div class="ttdoc">operator &lt;&lt; for printing uint256_t integer</div><div class="ttdef"><b>Definition</b> <a href="#l00947">uint256_t.hpp:947</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a9879f7ec85fc148e1931fcb492ddc484"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484">uint256_t::operator==</a></div><div class="ttdeci">bool operator==(const T &amp;other)</div><div class="ttdoc">operator == for other types</div><div class="ttdef"><b>Definition</b> <a href="#l00678">uint256_t.hpp:678</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a9bc6cc460108306a59281ce4ca216839"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839">uint256_t::operator&amp;</a></div><div class="ttdeci">uint256_t operator&amp;(const uint256_t &amp;p)</div><div class="ttdoc">operator &amp; for uint256_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00820">uint256_t.hpp:820</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a9ddd133cee83f3a2ab6ed60a7ccbc250"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250">uint256_t::_trz</a></div><div class="ttdeci">uint32_t _trz()</div><div class="ttdoc">Trailing zeroes in binary.</div><div class="ttdef"><b>Definition</b> <a href="#l00135">uint256_t.hpp:135</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_a9f6f3e39783c893473315bada864a183"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183">uint256_t::operator--</a></div><div class="ttdeci">uint256_t &amp; operator--()</div><div class="ttdoc">operator – (pre-decrement)</div><div class="ttdef"><b>Definition</b> <a href="#l00313">uint256_t.hpp:313</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_aa0e532832640e9fe273b35c481b18963"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963">uint256_t::operator&amp;&amp;</a></div><div class="ttdeci">bool operator&amp;&amp;(const uint256_t &amp;b)</div><div class="ttdoc">operator &amp;&amp; for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00603">uint256_t.hpp:603</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_aa28ae272e9176557133a10dffa3b94dc"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc">uint256_t::operator|=</a></div><div class="ttdeci">uint256_t &amp; operator|=(const uint256_t &amp;p)</div><div class="ttdoc">operator |= for uint256_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00887">uint256_t.hpp:887</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_aa4cf08fa6a33f17594b5a842866f39a1"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1">uint256_t::lower</a></div><div class="ttdeci">uint128_t lower() const</div><div class="ttdoc">returns lower 128-bit integer part</div><div class="ttdef"><b>Definition</b> <a href="#l00169">uint256_t.hpp:169</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_aa9e585b186e71d7cbe9c1d7387c38967"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967">uint256_t::operator*</a></div><div class="ttdeci">uint256_t operator*(const uint256_t &amp;p)</div><div class="ttdoc">operator * for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00371">uint256_t.hpp:371</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_aaca9288fd28fc07e1386f1586bd51616"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616">uint256_t::operator*</a></div><div class="ttdeci">uint256_t operator*(const T &amp;p)</div><div class="ttdoc">operator * for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00362">uint256_t.hpp:362</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_aae68a7bd17c14a926fb77758b5c8e547"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#aae68a7bd17c14a926fb77758b5c8e547">uint256_t::operator!=</a></div><div class="ttdeci">bool operator!=(const uint256_t &amp;other)</div><div class="ttdoc">operator != for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00588">uint256_t.hpp:588</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_ab909ef62a0c85121e7d743c016fb723d"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#ab909ef62a0c85121e7d743c016fb723d">uint256_t::operator-</a></div><div class="ttdeci">uint256_t operator-(const uint256_t &amp;p)</div><div class="ttdoc">operator - for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00298">uint256_t.hpp:298</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_abc793979ec70bb8e5cf177d83649a259"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#abc793979ec70bb8e5cf177d83649a259">uint256_t::operator/=</a></div><div class="ttdeci">uint256_t &amp; operator/=(const T &amp;p)</div><div class="ttdoc">operator /= for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00489">uint256_t.hpp:489</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_ac1b36e64de42f3622e7d6ec5efa273d4"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4">uint256_t::operator/=</a></div><div class="ttdeci">uint256_t &amp; operator/=(const uint256_t &amp;p)</div><div class="ttdoc">operator /= for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00476">uint256_t.hpp:476</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_ac6bdcf64653af8173987bf7217e99056"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#ac6bdcf64653af8173987bf7217e99056">uint256_t::operator&lt;</a></div><div class="ttdeci">bool operator&lt;(const T &amp;other)</div><div class="ttdoc">operator &lt; for other types</div><div class="ttdef"><b>Definition</b> <a href="#l00630">uint256_t.hpp:630</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_ac75a46fe3625caf10e07db1eb75a1d6e"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#ac75a46fe3625caf10e07db1eb75a1d6e">uint256_t::operator+=</a></div><div class="ttdeci">uint256_t &amp; operator+=(const uint256_t &amp;p)</div><div class="ttdoc">operator += for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00255">uint256_t.hpp:255</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_ac92ac0b2368990fbbaf3cca3ee8247d7"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7">uint256_t::operator^=</a></div><div class="ttdeci">uint256_t &amp; operator^=(const uint256_t &amp;p)</div><div class="ttdoc">operator ^= for uint256_t (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00919">uint256_t.hpp:919</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_acac9901ab133caa57d058a377d873bf6"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6">uint256_t::operator/</a></div><div class="ttdeci">uint256_t operator/(const T &amp;p)</div><div class="ttdoc">operator / for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00458">uint256_t.hpp:458</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_acadd235e0029ec43d5990d24affaf42d"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d">uint256_t::operator&gt;</a></div><div class="ttdeci">bool operator&gt;(const uint256_t &amp;other)</div><div class="ttdoc">operator &gt; for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00561">uint256_t.hpp:561</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_acb61fe17d064c61adc02defa651f9a5e"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e">uint256_t::operator^</a></div><div class="ttdeci">uint256_t operator^(const T &amp;p)</div><div class="ttdoc">operator ^ for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00901">uint256_t.hpp:901</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_acd3970c633eb2c597874e2712392f0c7"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7">uint256_t::operator-=</a></div><div class="ttdeci">uint256_t operator-=(const T p)</div><div class="ttdoc">operator -= for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00335">uint256_t.hpp:335</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_acefecc3b1a4044f2be5ab46eea0099bf"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf">uint256_t::operator|</a></div><div class="ttdeci">uint256_t operator|(const T &amp;p)</div><div class="ttdoc">operator | for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00856">uint256_t.hpp:856</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_ad4928175eaaaa2b559bc945affe63ad2"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#ad4928175eaaaa2b559bc945affe63ad2">uint256_t::operator%</a></div><div class="ttdeci">uint256_t operator%(const uint256_t &amp;p)</div><div class="ttdoc">operator % for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00499">uint256_t.hpp:499</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_ad74d33215517459c2b33ace7a9c6bc13"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#ad74d33215517459c2b33ace7a9c6bc13">uint256_t::operator&gt;</a></div><div class="ttdeci">bool operator&gt;(const T &amp;other)</div><div class="ttdoc">operator &gt; for other types</div><div class="ttdef"><b>Definition</b> <a href="#l00654">uint256_t.hpp:654</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_ad9ce2370b1497efbcc426793048e1f78"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#ad9ce2370b1497efbcc426793048e1f78">uint256_t::operator&gt;&gt;=</a></div><div class="ttdeci">uint256_t &amp; operator&gt;&gt;=(const T &amp;p)</div><div class="ttdoc">operator &gt;&gt;= for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00790">uint256_t.hpp:790</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_addff5645f6005e7b50a6ad0731e4f19c"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#addff5645f6005e7b50a6ad0731e4f19c">uint256_t::operator=</a></div><div class="ttdeci">uint256_t &amp; operator=(const T &amp;p)</div><div class="ttdoc">operator = for other types</div><div class="ttdef"><b>Definition</b> <a href="#l00192">uint256_t.hpp:192</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_adf09395f9113a69a05fed7e25b46c8ad"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad">uint256_t::operator&gt;=</a></div><div class="ttdeci">bool operator&gt;=(const uint256_t &amp;other)</div><div class="ttdoc">operator &gt;= for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00570">uint256_t.hpp:570</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_aecb2883133c8c8b9fcfb77ab69b03ab5"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5">uint256_t::upper</a></div><div class="ttdeci">uint128_t upper() const</div><div class="ttdoc">returns upper 128-bit integer part</div><div class="ttdef"><b>Definition</b> <a href="#l00175">uint256_t.hpp:175</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_aed0f8c3d5be23644c4bcb2fd2551e1dc"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc">uint256_t::uint256_t</a></div><div class="ttdeci">uint256_t(T low)</div><div class="ttdoc">Parameterized constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00075">uint256_t.hpp:75</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_af0a6e09fcf1cbf234ed32df6d7265a0b"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#af0a6e09fcf1cbf234ed32df6d7265a0b">uint256_t::operator|=</a></div><div class="ttdeci">uint256_t &amp; operator|=(const T &amp;p)</div><div class="ttdoc">operator |= for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00877">uint256_t.hpp:877</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_af0ad4080bb5ddc16b54a7e87911005c9"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9">uint256_t::operator++</a></div><div class="ttdeci">uint256_t &amp; operator++()</div><div class="ttdoc">pre-increment operator</div><div class="ttdef"><b>Definition</b> <a href="#l00266">uint256_t.hpp:266</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_af18e2e3d7ed635c4056062bc906fef75"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#af18e2e3d7ed635c4056062bc906fef75">uint256_t::operator+</a></div><div class="ttdeci">uint256_t operator+(const uint256_t &amp;p)</div><div class="ttdoc">operator + for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00230">uint256_t.hpp:230</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_af2193ff0d0e93143fb71f4847df16028"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028">uint256_t::operator*=</a></div><div class="ttdeci">uint256_t &amp; operator*=(const T &amp;p)</div><div class="ttdoc">operator *= for uint256_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="#l00392">uint256_t.hpp:392</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_afa79020c27caea31236d04ecaa0e5ef5"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#afa79020c27caea31236d04ecaa0e5ef5">uint256_t::operator&amp;=</a></div><div class="ttdeci">uint256_t &amp; operator&amp;=(const T p)</div><div class="ttdoc">operator &amp;= for other types (bitwise operator)</div><div class="ttdef"><b>Definition</b> <a href="#l00843">uint256_t.hpp:843</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_afe9f4828d73dd51a080585dd0b99af96"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96">uint256_t::operator&lt;</a></div><div class="ttdeci">bool operator&lt;(const uint256_t &amp;other)</div><div class="ttdoc">operator &lt; for uint256_t</div><div class="ttdef"><b>Definition</b> <a href="#l00543">uint256_t.hpp:543</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_afee82fa5052e9d8c946b9205b943cec4"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4">uint256_t::__get_integer_from_string</a></div><div class="ttdeci">void __get_integer_from_string(const std::string &amp;str)</div><div class="ttdoc">First and second half of 256 bit number.</div><div class="ttdef"><b>Definition</b> <a href="#l00043">uint256_t.hpp:43</a></div></div>
+<div class="ttc" id="aclassuint256__t_html_aff4d49cf84de64301b169ad974f00bad"><div class="ttname"><a href="../../d1/d83/classuint256__t.html#aff4d49cf84de64301b169ad974f00bad">uint256_t::operator&gt;=</a></div><div class="ttdeci">bool operator&gt;=(const T &amp;other)</div><div class="ttdoc">operator &gt;= for other types</div><div class="ttdef"><b>Definition</b> <a href="#l00666">uint256_t.hpp:666</a></div></div>
 <div class="ttc" id="auint128__t_8hpp_html"><div class="ttname"><a href="../../da/d41/uint128__t_8hpp.html">uint128_t.hpp</a></div></div>
-<div class="ttc" id="auint128__t_8hpp_html_a3ff77262ffd6743df5b808d41382a6f3"><div class="ttname"><a href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a></div><div class="ttdeci">std::string add(const std::string &amp;first, const std::string &amp;second)</div><div class="ttdoc">Adding two string.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:38</div></div>
+<div class="ttc" id="auint128__t_8hpp_html_a3ff77262ffd6743df5b808d41382a6f3"><div class="ttname"><a href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a></div><div class="ttdeci">std::string add(const std::string &amp;first, const std::string &amp;second)</div><div class="ttdoc">Adding two string.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00038">uint128_t.hpp:38</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/da/da4/structoperations__on__datastructures_1_1circular__linked__list_1_1_node-members.html b/da/da4/structoperations__on__datastructures_1_1circular__linked__list_1_1_node-members.html
index 465dfc4b4..260d277cb 100644
--- a/da/da4/structoperations__on__datastructures_1_1circular__linked__list_1_1_node-members.html
+++ b/da/da4/structoperations__on__datastructures_1_1circular__linked__list_1_1_node-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/da/dac/classdata__structures_1_1_segment_tree-members.html b/da/dac/classdata__structures_1_1_segment_tree-members.html
index dd070faa6..8c56e9d1e 100644
--- a/da/dac/classdata__structures_1_1_segment_tree-members.html
+++ b/da/dac/classdata__structures_1_1_segment_tree-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/da/dac/n__queens__all__solution__optimised_8cpp.html b/da/dac/n__queens__all__solution__optimised_8cpp.html
index 6e7344720..6634f6f92 100644
--- a/da/dac/n__queens__all__solution__optimised_8cpp.html
+++ b/da/dac/n__queens__all__solution__optimised_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: backtracking/n_queens_all_solution_optimised.cpp File Reference</title>
+<title>TheAlgorithms/C++: backtracking/n_queens_all_solution_optimised.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for n_queens_all_solution_optimised.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d0f/n__queens__all__solution__optimised_8cpp__incl.svg" width="192" height="126"><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">
+</div>
+<p><a href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html">backtracking</a></td></tr>
@@ -133,13 +152,13 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a04090463be4942a69ea91fe7386da905" id="r_a04090463be4942a69ea91fe7386da905"><td class="memTemplParams" colspan="2">template&lt;size_t n&gt; </td></tr>
-<tr class="memitem:a04090463be4942a69ea91fe7386da905"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a04090463be4942a69ea91fe7386da905">backtracking::n_queens_optimized::PrintSol</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; &amp;board)</td></tr>
+<tr class="memitem:a04090463be4942a69ea91fe7386da905"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a04090463be4942a69ea91fe7386da905">backtracking::n_queens_optimized::PrintSol</a> (const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board)</td></tr>
 <tr class="separator:a04090463be4942a69ea91fe7386da905"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a9e48455584a4faa33e83dd1891efd9b9" id="r_a9e48455584a4faa33e83dd1891efd9b9"><td class="memTemplParams" colspan="2">template&lt;size_t n&gt; </td></tr>
-<tr class="memitem:a9e48455584a4faa33e83dd1891efd9b9"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a9e48455584a4faa33e83dd1891efd9b9">backtracking::n_queens_optimized::CanIMove</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; &amp;board, int row, int col)</td></tr>
+<tr class="memitem:a9e48455584a4faa33e83dd1891efd9b9"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a9e48455584a4faa33e83dd1891efd9b9">backtracking::n_queens_optimized::CanIMove</a> (const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board, int row, int col)</td></tr>
 <tr class="separator:a9e48455584a4faa33e83dd1891efd9b9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a23c0547e4fd1708e6fb643b08327a60f" id="r_a23c0547e4fd1708e6fb643b08327a60f"><td class="memTemplParams" colspan="2">template&lt;size_t n&gt; </td></tr>
-<tr class="memitem:a23c0547e4fd1708e6fb643b08327a60f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a23c0547e4fd1708e6fb643b08327a60f">backtracking::n_queens_optimized::NQueenSol</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; board, int col)</td></tr>
+<tr class="memitem:a23c0547e4fd1708e6fb643b08327a60f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a23c0547e4fd1708e6fb643b08327a60f">backtracking::n_queens_optimized::NQueenSol</a> (std::array&lt; std::array&lt; int, n &gt;, n &gt; board, int col)</td></tr>
 <tr class="separator:a23c0547e4fd1708e6fb643b08327a60f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
 <tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function.  <br /></td></tr>
@@ -150,6 +169,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/deadshotsb" target="_blank">Sombit Bose</a> </dd>
 <dd>
 <a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html">n_queens_all_solution_optimised.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a9e48455584a4faa33e83dd1891efd9b9" name="a9e48455584a4faa33e83dd1891efd9b9"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a9e48455584a4faa33e83dd1891efd9b9">&#9670;&#160;</a></span>CanIMove()</h2>
@@ -162,7 +183,7 @@ template&lt;size_t n&gt; </div>
         <tr>
           <td class="memname">bool backtracking::n_queens_optimized::CanIMove </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>board</em></span>, </td>
+          <td class="paramtype">const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>board</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -196,33 +217,27 @@ template&lt;size_t n&gt; </div>
 <p>check in the row</p>
 <p>check the first diagonal</p>
 <p>check the second diagonal</p>
-<div class="fragment"><div class="line"><span class="lineno">   60</span>                       {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   61</span><span class="comment">    /// check in the row</span></div>
-<div class="line"><span class="lineno">   62</span><span class="comment"></span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= col; i++) {</div>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html">n_queens_all_solution_optimised.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   60</span>                       {</div>
+<div class="line"><span class="lineno">   62</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= col; i++) {</div>
 <div class="line"><span class="lineno">   63</span>        <span class="keywordflow">if</span> (board[row][i] == 1) {</div>
 <div class="line"><span class="lineno">   64</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   65</span>        }</div>
-<div class="line"><span class="lineno">   66</span>    }<span class="comment"></span></div>
-<div class="line"><span class="lineno">   67</span><span class="comment">    /// check the first diagonal</span></div>
-<div class="line"><span class="lineno">   68</span><span class="comment"></span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = row, j = col; i &gt;= 0 &amp;&amp; j &gt;= 0; i--, j--) {</div>
+<div class="line"><span class="lineno">   66</span>    }</div>
+<div class="line"><span class="lineno">   68</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = row, j = col; i &gt;= 0 &amp;&amp; j &gt;= 0; i--, j--) {</div>
 <div class="line"><span class="lineno">   69</span>        <span class="keywordflow">if</span> (board[i][j] == 1) {</div>
 <div class="line"><span class="lineno">   70</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   71</span>        }</div>
-<div class="line"><span class="lineno">   72</span>    }<span class="comment"></span></div>
-<div class="line"><span class="lineno">   73</span><span class="comment">    /// check the second diagonal</span></div>
-<div class="line"><span class="lineno">   74</span><span class="comment"></span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = row, j = col; i &lt;= n - 1 &amp;&amp; j &gt;= 0; i++, j--) {</div>
+<div class="line"><span class="lineno">   72</span>    }</div>
+<div class="line"><span class="lineno">   74</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = row, j = col; i &lt;= n - 1 &amp;&amp; j &gt;= 0; i++, j--) {</div>
 <div class="line"><span class="lineno">   75</span>        <span class="keywordflow">if</span> (board[i][j] == 1) {</div>
 <div class="line"><span class="lineno">   76</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   77</span>        }</div>
 <div class="line"><span class="lineno">   78</span>    }</div>
 <div class="line"><span class="lineno">   79</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   80</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dac/n__queens__all__solution__optimised_8cpp_a9e48455584a4faa33e83dd1891efd9b9_cgraph.svg" width="171" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -242,9 +257,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>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html#l00109">109</a> of file <a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html">n_queens_all_solution_optimised.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  109</span>           {</div>
 <div class="line"><span class="lineno">  110</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> n = 4;</div>
-<div class="line"><span class="lineno">  111</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;int, n&gt;</a>, n&gt; board{};</div>
+<div class="line"><span class="lineno">  111</span>    std::array&lt;std::array&lt;int, n&gt;, n&gt; board{};</div>
 <div class="line"><span class="lineno">  112</span> </div>
 <div class="line"><span class="lineno">  113</span>    <span class="keywordflow">if</span> (n % 2 == 0) {</div>
 <div class="line"><span class="lineno">  114</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= n / 2 - 1; i++) {</div>
@@ -265,8 +282,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  129</span>    }</div>
 <div class="line"><span class="lineno">  130</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  131</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a23c0547e4fd1708e6fb643b08327a60f"><div class="ttname"><a href="#a23c0547e4fd1708e6fb643b08327a60f">backtracking::n_queens_optimized::NQueenSol</a></div><div class="ttdeci">void NQueenSol(std::array&lt; std::array&lt; int, n &gt;, n &gt; board, int col)</div><div class="ttdef"><b>Definition</b> n_queens_all_solution_optimised.cpp:89</div></div>
+<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a23c0547e4fd1708e6fb643b08327a60f"><div class="ttname"><a href="#a23c0547e4fd1708e6fb643b08327a60f">backtracking::n_queens_optimized::NQueenSol</a></div><div class="ttdeci">void NQueenSol(std::array&lt; std::array&lt; int, n &gt;, n &gt; board, int col)</div><div class="ttdef"><b>Definition</b> <a href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html#l00089">n_queens_all_solution_optimised.cpp:89</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -281,7 +297,7 @@ template&lt;size_t n&gt; </div>
         <tr>
           <td class="memname">void backtracking::n_queens_optimized::NQueenSol </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt;</td>          <td class="paramname"><span class="paramname"><em>board</em></span>, </td>
+          <td class="paramtype">std::array&lt; std::array&lt; int, n &gt;, n &gt;</td>          <td class="paramname"><span class="paramname"><em>board</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -303,6 +319,8 @@ template&lt;size_t n&gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html#l00089">89</a> of file <a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html">n_queens_all_solution_optimised.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   89</span>                                                             {</div>
 <div class="line"><span class="lineno">   90</span>    <span class="keywordflow">if</span> (col &gt;= n) {</div>
 <div class="line"><span class="lineno">   91</span>        PrintSol&lt;n&gt;(board);</div>
@@ -316,12 +334,7 @@ template&lt;size_t n&gt; </div>
 <div class="line"><span class="lineno">   99</span>        }</div>
 <div class="line"><span class="lineno">  100</span>    }</div>
 <div class="line"><span class="lineno">  101</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dac/n__queens__all__solution__optimised_8cpp_a23c0547e4fd1708e6fb643b08327a60f_cgraph.svg" width="171" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a04090463be4942a69ea91fe7386da905" name="a04090463be4942a69ea91fe7386da905"></a>
@@ -335,7 +348,7 @@ template&lt;size_t n&gt; </div>
         <tr>
           <td class="memname">void backtracking::n_queens_optimized::PrintSol </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt;, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>board</em></span></td><td>)</td>
+          <td class="paramtype">const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>board</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -352,32 +365,27 @@ template&lt;size_t n&gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html#l00030">30</a> of file <a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp_source.html">n_queens_all_solution_optimised.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   30</span>                                                          {</div>
 <div class="line"><span class="lineno">   31</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
 <div class="line"><span class="lineno">   32</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
-<div class="line"><span class="lineno">   33</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; board[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   33</span>            std::cout &lt;&lt; board[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   34</span>        }</div>
-<div class="line"><span class="lineno">   35</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   35</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   36</span>    }</div>
-<div class="line"><span class="lineno">   37</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   37</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   38</span>    <span class="keywordflow">if</span> (n % 2 == 0 || (n % 2 == 1 &amp;&amp; board[n / 2 + 1][0] != 1)) {</div>
 <div class="line"><span class="lineno">   39</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
 <div class="line"><span class="lineno">   40</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
-<div class="line"><span class="lineno">   41</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; board[j][i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   41</span>                std::cout &lt;&lt; board[j][i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   42</span>            }</div>
-<div class="line"><span class="lineno">   43</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   43</span>            std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   44</span>        }</div>
-<div class="line"><span class="lineno">   45</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   45</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   46</span>    }</div>
 <div class="line"><span class="lineno">   47</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="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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph.svg" width="290" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph.map b/da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph.map
deleted file mode 100644
index b4e9af8ff..000000000
--- a/da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="backtracking::n_queens_optimized::PrintSol" name="backtracking::n_queens_optimized::PrintSol">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,165,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="53,29,52,19,57,11,68,5,85,3,103,5,114,11,111,16,101,10,85,8,70,10,61,14,57,20,59,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="213,37,284,62"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="165,47,197,47,197,52,165,52"/>
-</map>
diff --git a/da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph.md5 b/da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph.md5
deleted file mode 100644
index ab6aa498b..000000000
--- a/da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-288600765dfd88c7ef660613ae7027d5
\ No newline at end of file
diff --git a/da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph.svg b/da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph.svg
deleted file mode 100644
index 2e30d91ed..000000000
--- a/da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::n_queens_optimized::PrintSol Pages: 1 -->
-<svg width="217pt" height="57pt"
- viewBox="0.00 0.00 217.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::n_queens_optimized::PrintSol</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="119.5,-30.5 0,-30.5 0,0 119.5,0 119.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::n_queens</text>
-<text text-anchor="middle" x="59.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_optimized::PrintSol</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.04,-30.99C33.61,-40.06 40.85,-48.5 59.75,-48.5 70.09,-48.5 76.93,-45.97 80.29,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.75,-42.8 81.3,-32.49 76.79,-42.08 83.75,-42.8"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209,-24.88 155.5,-24.88 155.5,-5.63 209,-5.63 209,-24.88"/>
-<text text-anchor="middle" x="182.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.94,-15.25C128.07,-15.25 136.22,-15.25 143.8,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.65,-18.75 153.65,-15.25 143.65,-11.75 143.65,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph_org.svg b/da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph_org.svg
deleted file mode 100644
index e13036fe4..000000000
--- a/da/dac/n__queens__all__solution__optimised_8cpp_a04090463be4942a69ea91fe7386da905_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::n_queens_optimized::PrintSol Pages: 1 -->
-<svg width="217pt" height="57pt"
- viewBox="0.00 0.00 217.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::n_queens_optimized::PrintSol</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="119.5,-30.5 0,-30.5 0,0 119.5,0 119.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::n_queens</text>
-<text text-anchor="middle" x="59.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_optimized::PrintSol</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.04,-30.99C33.61,-40.06 40.85,-48.5 59.75,-48.5 70.09,-48.5 76.93,-45.97 80.29,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.75,-42.8 81.3,-32.49 76.79,-42.08 83.75,-42.8"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209,-24.88 155.5,-24.88 155.5,-5.63 209,-5.63 209,-24.88"/>
-<text text-anchor="middle" x="182.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.94,-15.25C128.07,-15.25 136.22,-15.25 143.8,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.65,-18.75 153.65,-15.25 143.65,-11.75 143.65,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/dac/n__queens__all__solution__optimised_8cpp_a23c0547e4fd1708e6fb643b08327a60f_cgraph.map b/da/dac/n__queens__all__solution__optimised_8cpp_a23c0547e4fd1708e6fb643b08327a60f_cgraph.map
deleted file mode 100644
index d1ca41f46..000000000
--- a/da/dac/n__queens__all__solution__optimised_8cpp_a23c0547e4fd1708e6fb643b08327a60f_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="backtracking::n_queens_optimized::NQueenSol" name="backtracking::n_queens_optimized::NQueenSol">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,165,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="54,29,53,19,58,11,69,5,85,3,103,5,113,11,110,16,101,10,85,8,70,10,61,14,58,20,59,28"/>
-</map>
diff --git a/da/dac/n__queens__all__solution__optimised_8cpp_a23c0547e4fd1708e6fb643b08327a60f_cgraph.md5 b/da/dac/n__queens__all__solution__optimised_8cpp_a23c0547e4fd1708e6fb643b08327a60f_cgraph.md5
deleted file mode 100644
index bc1de13a0..000000000
--- a/da/dac/n__queens__all__solution__optimised_8cpp_a23c0547e4fd1708e6fb643b08327a60f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-427717707d61a559f4ad8ba32e8d6df1
\ No newline at end of file
diff --git a/da/dac/n__queens__all__solution__optimised_8cpp_a23c0547e4fd1708e6fb643b08327a60f_cgraph.svg b/da/dac/n__queens__all__solution__optimised_8cpp_a23c0547e4fd1708e6fb643b08327a60f_cgraph.svg
deleted file mode 100644
index 66518a940..000000000
--- a/da/dac/n__queens__all__solution__optimised_8cpp_a23c0547e4fd1708e6fb643b08327a60f_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::n_queens_optimized::NQueenSol Pages: 1 -->
-<svg width="128pt" height="57pt"
- viewBox="0.00 0.00 127.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::n_queens_optimized::NQueenSol</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="119.5,-30.5 0,-30.5 0,0 119.5,0 119.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::n_queens</text>
-<text text-anchor="middle" x="59.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_optimized::NQueenSol</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.57,-30.99C34.25,-40.06 41.31,-48.5 59.75,-48.5 69.83,-48.5 76.51,-45.97 79.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.25,-42.79 80.77,-32.49 76.28,-42.09 83.25,-42.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/dac/n__queens__all__solution__optimised_8cpp_a23c0547e4fd1708e6fb643b08327a60f_cgraph_org.svg b/da/dac/n__queens__all__solution__optimised_8cpp_a23c0547e4fd1708e6fb643b08327a60f_cgraph_org.svg
deleted file mode 100644
index c2448cb15..000000000
--- a/da/dac/n__queens__all__solution__optimised_8cpp_a23c0547e4fd1708e6fb643b08327a60f_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::n_queens_optimized::NQueenSol Pages: 1 -->
-<svg width="128pt" height="57pt"
- viewBox="0.00 0.00 127.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::n_queens_optimized::NQueenSol</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="119.5,-30.5 0,-30.5 0,0 119.5,0 119.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::n_queens</text>
-<text text-anchor="middle" x="59.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_optimized::NQueenSol</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.57,-30.99C34.25,-40.06 41.31,-48.5 59.75,-48.5 69.83,-48.5 76.51,-45.97 79.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.25,-42.79 80.77,-32.49 76.28,-42.09 83.25,-42.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/dac/n__queens__all__solution__optimised_8cpp_a9e48455584a4faa33e83dd1891efd9b9_cgraph.map b/da/dac/n__queens__all__solution__optimised_8cpp_a9e48455584a4faa33e83dd1891efd9b9_cgraph.map
deleted file mode 100644
index 97da12603..000000000
--- a/da/dac/n__queens__all__solution__optimised_8cpp_a9e48455584a4faa33e83dd1891efd9b9_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="backtracking::n_queens_optimized::CanIMove" name="backtracking::n_queens_optimized::CanIMove">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,165,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="54,29,53,19,58,11,69,5,85,3,103,5,113,11,110,16,101,10,85,8,70,10,61,14,58,20,59,28"/>
-</map>
diff --git a/da/dac/n__queens__all__solution__optimised_8cpp_a9e48455584a4faa33e83dd1891efd9b9_cgraph.md5 b/da/dac/n__queens__all__solution__optimised_8cpp_a9e48455584a4faa33e83dd1891efd9b9_cgraph.md5
deleted file mode 100644
index 96afab673..000000000
--- a/da/dac/n__queens__all__solution__optimised_8cpp_a9e48455584a4faa33e83dd1891efd9b9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-67cf7f4ed7be596a3b1a8a8b5b73fb1d
\ No newline at end of file
diff --git a/da/dac/n__queens__all__solution__optimised_8cpp_a9e48455584a4faa33e83dd1891efd9b9_cgraph.svg b/da/dac/n__queens__all__solution__optimised_8cpp_a9e48455584a4faa33e83dd1891efd9b9_cgraph.svg
deleted file mode 100644
index a7dfa4105..000000000
--- a/da/dac/n__queens__all__solution__optimised_8cpp_a9e48455584a4faa33e83dd1891efd9b9_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::n_queens_optimized::CanIMove Pages: 1 -->
-<svg width="128pt" height="57pt"
- viewBox="0.00 0.00 127.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::n_queens_optimized::CanIMove</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="119.5,-30.5 0,-30.5 0,0 119.5,0 119.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::n_queens</text>
-<text text-anchor="middle" x="59.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_optimized::CanIMove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.57,-30.99C34.25,-40.06 41.31,-48.5 59.75,-48.5 69.83,-48.5 76.51,-45.97 79.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.25,-42.79 80.77,-32.49 76.28,-42.09 83.25,-42.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/dac/n__queens__all__solution__optimised_8cpp_a9e48455584a4faa33e83dd1891efd9b9_cgraph_org.svg b/da/dac/n__queens__all__solution__optimised_8cpp_a9e48455584a4faa33e83dd1891efd9b9_cgraph_org.svg
deleted file mode 100644
index 4c5533a77..000000000
--- a/da/dac/n__queens__all__solution__optimised_8cpp_a9e48455584a4faa33e83dd1891efd9b9_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::n_queens_optimized::CanIMove Pages: 1 -->
-<svg width="128pt" height="57pt"
- viewBox="0.00 0.00 127.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::n_queens_optimized::CanIMove</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="119.5,-30.5 0,-30.5 0,0 119.5,0 119.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::n_queens</text>
-<text text-anchor="middle" x="59.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_optimized::CanIMove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.57,-30.99C34.25,-40.06 41.31,-48.5 59.75,-48.5 69.83,-48.5 76.51,-45.97 79.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.25,-42.79 80.77,-32.49 76.28,-42.09 83.25,-42.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/dac/n__queens__all__solution__optimised_8cpp_source.html b/da/dac/n__queens__all__solution__optimised_8cpp_source.html
new file mode 100644
index 000000000..25017e64c
--- /dev/null
+++ b/da/dac/n__queens__all__solution__optimised_8cpp_source.html
@@ -0,0 +1,238 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: backtracking/n_queens_all_solution_optimised.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/dac/n__queens__all__solution__optimised_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">n_queens_all_solution_optimised.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/dac/n__queens__all__solution__optimised_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;array&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../db/dc0/namespacebacktracking.html">backtracking</a> {</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d14/namespacen__queens__optimized.html">n_queens_optimized</a> {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> n&gt;</div>
+<div class="foldopen" id="foldopen00030" data-start="{" data-end="}">
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"><a class="line" href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905">   30</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905">PrintSol</a>(<span class="keyword">const</span> std::array&lt;std::array&lt;int, n&gt;, n&gt; &amp;board) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>            std::cout &lt;&lt; board[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        }</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    }</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">if</span> (n % 2 == 0 || (n % 2 == 1 &amp;&amp; board[n / 2 + 1][0] != 1)) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n; j++) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>                std::cout &lt;&lt; board[j][i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>            }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>            std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        }</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    }</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>}</div>
+</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> n&gt;</div>
+<div class="foldopen" id="foldopen00059" data-start="{" data-end="}">
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9">   59</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9">CanIMove</a>(<span class="keyword">const</span> std::array&lt;std::array&lt;int, n&gt;, n&gt; &amp;board, <span class="keywordtype">int</span> row,</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>              <span class="keywordtype">int</span> col) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= col; i++) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">if</span> (board[row][i] == 1) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = row, j = col; i &gt;= 0 &amp;&amp; j &gt;= 0; i--, j--) {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        <span class="keywordflow">if</span> (board[i][j] == 1) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    }</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = row, j = col; i &lt;= n - 1 &amp;&amp; j &gt;= 0; i++, j--) {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        <span class="keywordflow">if</span> (board[i][j] == 1) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    }</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>}</div>
+</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> n&gt;</div>
+<div class="foldopen" id="foldopen00089" data-start="{" data-end="}">
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"><a class="line" href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f">   89</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f">NQueenSol</a>(std::array&lt;std::array&lt;int, n&gt;, n&gt; board, <span class="keywordtype">int</span> col) {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="keywordflow">if</span> (col &gt;= n) {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        PrintSol&lt;n&gt;(board);</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    }</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        <span class="keywordflow">if</span> (CanIMove&lt;n&gt;(board, i, col)) {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            board[i][col] = 1;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            NQueenSol&lt;n&gt;(board, col + 1);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>            board[i][col] = 0;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        }</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    }</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>}</div>
+</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>}  <span class="comment">// namespace n_queens_optimized</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>}  <span class="comment">// namespace backtracking</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="foldopen" id="foldopen00109" data-start="{" data-end="}">
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"><a class="line" href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  109</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> n = 4;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::array&lt;std::array&lt;int, n&gt;, n&gt; board{};</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="keywordflow">if</span> (n % 2 == 0) {</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= n / 2 - 1; i++) {</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>            <span class="keywordflow">if</span> (backtracking::n_queens_optimized::CanIMove(board, i, 0)) {</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>                board[i][0] = 1;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>                backtracking::n_queens_optimized::NQueenSol(board, 1);</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>                board[i][0] = 0;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>            }</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        }</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= n / 2; i++) {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>            <span class="keywordflow">if</span> (backtracking::n_queens_optimized::CanIMove(board, i, 0)) {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>                board[i][0] = 1;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>                backtracking::n_queens_optimized::NQueenSol(board, 1);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>                board[i][0] = 0;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>            }</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        }</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    }</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>}</div>
+</div>
+<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a04090463be4942a69ea91fe7386da905"><div class="ttname"><a href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905">backtracking::n_queens_optimized::PrintSol</a></div><div class="ttdeci">void PrintSol(const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board)</div><div class="ttdef"><b>Definition</b> <a href="#l00030">n_queens_all_solution_optimised.cpp:30</a></div></div>
+<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a23c0547e4fd1708e6fb643b08327a60f"><div class="ttname"><a href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f">backtracking::n_queens_optimized::NQueenSol</a></div><div class="ttdeci">void NQueenSol(std::array&lt; std::array&lt; int, n &gt;, n &gt; board, int col)</div><div class="ttdef"><b>Definition</b> <a href="#l00089">n_queens_all_solution_optimised.cpp:89</a></div></div>
+<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_a9e48455584a4faa33e83dd1891efd9b9"><div class="ttname"><a href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9">backtracking::n_queens_optimized::CanIMove</a></div><div class="ttdeci">bool CanIMove(const std::array&lt; std::array&lt; int, n &gt;, n &gt; &amp;board, int row, int col)</div><div class="ttdef"><b>Definition</b> <a href="#l00059">n_queens_all_solution_optimised.cpp:59</a></div></div>
+<div class="ttc" id="an__queens__all__solution__optimised_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00109">n_queens_all_solution_optimised.cpp:109</a></div></div>
+<div class="ttc" id="anamespacebacktracking_html"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html">backtracking</a></div><div class="ttdoc">for vector container</div></div>
+<div class="ttc" id="anamespacen__queens__optimized_html"><div class="ttname"><a href="../../d8/d14/namespacen__queens__optimized.html">n_queens_optimized</a></div><div class="ttdoc">Functions for Eight Queens puzzle optimized.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a class="el" href="../../da/dac/n__queens__all__solution__optimised_8cpp.html">n_queens_all_solution_optimised.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/db8/count__of__set__bits_8cpp.html b/da/db8/count__of__set__bits_8cpp.html
index 81a32e205..e0e32fd2a 100644
--- a/da/db8/count__of__set__bits_8cpp.html
+++ b/da/db8/count__of__set__bits_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: bit_manipulation/count_of_set_bits.cpp File Reference</title>
+<title>TheAlgorithms/C++: bit_manipulation/count_of_set_bits.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for count_of_set_bits.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d9f/count__of__set__bits_8cpp__incl.svg" width="255" height="126"><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">
+</div>
+<p><a href="../../da/db8/count__of__set__bits_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></td></tr>
@@ -133,7 +152,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a86c98dc299e4db28b73e08309d977e62" id="r_a86c98dc299e4db28b73e08309d977e62"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a86c98dc299e4db28b73e08309d977e62">bit_manipulation::count_of_set_bits::countSetBits</a> (std ::int64_t n)</td></tr>
+<tr class="memitem:a86c98dc299e4db28b73e08309d977e62" id="r_a86c98dc299e4db28b73e08309d977e62"><td class="memItemLeft" align="right" valign="top">std::uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a86c98dc299e4db28b73e08309d977e62">bit_manipulation::count_of_set_bits::countSetBits</a> (std ::int64_t n)</td></tr>
 <tr class="memdesc:a86c98dc299e4db28b73e08309d977e62"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function implements set bit count.  <br /></td></tr>
 <tr class="separator:a86c98dc299e4db28b73e08309d977e62"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
 <p>A binary number consists of two digits. They are 0 &amp; 1. Digit 1 is known as set bit in computer terms. Worst Case Time Complexity: O(log n) Space complexity: O(1) </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Swastyy" target="_blank">Swastika Gupta</a> </dd>
 <dd>
 <a href="https://github.com/prashant-th18" target="_blank">Prashant Thakur</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../da/db8/count__of__set__bits_8cpp_source.html">count_of_set_bits.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a86c98dc299e4db28b73e08309d977e62" name="a86c98dc299e4db28b73e08309d977e62"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a86c98dc299e4db28b73e08309d977e62">&#9670;&#160;</a></span>countSetBits()</h2>
@@ -156,7 +177,7 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> bit_manipulation::count_of_set_bits::countSetBits </td>
+          <td class="memname">std::uint64_t bit_manipulation::count_of_set_bits::countSetBits </td>
           <td>(</td>
           <td class="paramtype">std ::int64_t</td>          <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
           <td></td>
@@ -172,6 +193,8 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>total number of set-bits in the binary representation of number <code>n</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/db8/count__of__set__bits_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../da/db8/count__of__set__bits_8cpp_source.html">count_of_set_bits.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   39</span>                   {  <span class="comment">// int64_t is preferred over int so that</span></div>
 <div class="line"><span class="lineno">   40</span>                        <span class="comment">// no Overflow can be there.</span></div>
 <div class="line"><span class="lineno">   41</span> </div>
@@ -187,12 +210,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   51</span>    <span class="comment">// set-bits in it. Means if my number is having &quot;3&quot; set bits, then this</span></div>
 <div class="line"><span class="lineno">   52</span>    <span class="comment">// while loop will run only &quot;3&quot; times!!</span></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">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph.svg" width="187" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -212,6 +230,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../da/db8/count__of__set__bits_8cpp_source.html#l00080">80</a> of file <a class="el" href="../../da/db8/count__of__set__bits_8cpp_source.html">count_of_set_bits.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   80</span>           {</div>
 <div class="line"><span class="lineno">   81</span>    test();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   82</span>    <span class="keywordflow">return</span> 0;</div>
@@ -241,6 +261,8 @@ Here is the call graph for this function:</div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/db8/count__of__set__bits_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../da/db8/count__of__set__bits_8cpp_source.html">count_of_set_bits.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   57</span>                   {</div>
 <div class="line"><span class="lineno">   58</span>    <span class="comment">// n = 4 return 1</span></div>
 <div class="line"><span class="lineno">   59</span>    assert(bit_manipulation::count_of_set_bits::countSetBits(4) == 1);</div>
@@ -258,10 +280,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   71</span>    assert(bit_manipulation::count_of_set_bits::countSetBits(97) == 3);</div>
 <div class="line"><span class="lineno">   72</span>    <span class="comment">// n = 31 return 5</span></div>
 <div class="line"><span class="lineno">   73</span>    assert(bit_manipulation::count_of_set_bits::countSetBits(31) == 5);</div>
-<div class="line"><span class="lineno">   74</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All test cases successfully passed!&quot;</span> &lt;&lt; <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">   74</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   75</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="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><!-- fragment -->
 </div>
 </div>
diff --git a/da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph.map b/da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph.map
deleted file mode 100644
index c4440c820..000000000
--- a/da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="bit_manipulation::count_of_set_bits::countSetBits" name="bit_manipulation::count_of_set_bits::countSetBits">
-<area shape="rect" id="Node000001" title="The main function implements set bit count." alt="" coords="5,29,181,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="59,29,58,19,63,10,75,5,93,3,112,5,124,11,121,16,111,10,93,8,77,10,67,14,63,20,65,28"/>
-</map>
diff --git a/da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph.md5 b/da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph.md5
deleted file mode 100644
index 2cfc0e1ab..000000000
--- a/da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a371fd3fbac51fe7453dcf76db9829e2
\ No newline at end of file
diff --git a/da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph.svg b/da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph.svg
deleted file mode 100644
index 701871f2f..000000000
--- a/da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: bit_manipulation::count_of_set_bits::countSetBits Pages: 1 -->
-<svg width="140pt" height="57pt"
- viewBox="0.00 0.00 139.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>bit_manipulation::count_of_set_bits::countSetBits</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function implements set bit count.">
-<polygon fill="#999999" stroke="#666666" points="131.5,-30.5 0,-30.5 0,0 131.5,0 131.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::count</text>
-<text text-anchor="middle" x="65.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_of_set_bits::countSetBits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.45,-30.99C37.69,-40.06 45.46,-48.5 65.75,-48.5 76.85,-48.5 84.2,-45.97 87.8,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.26,-42.82 88.88,-32.49 84.3,-42.04 91.26,-42.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph_org.svg b/da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph_org.svg
deleted file mode 100644
index 0e23e5945..000000000
--- a/da/db8/count__of__set__bits_8cpp_a86c98dc299e4db28b73e08309d977e62_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: bit_manipulation::count_of_set_bits::countSetBits Pages: 1 -->
-<svg width="140pt" height="57pt"
- viewBox="0.00 0.00 139.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>bit_manipulation::count_of_set_bits::countSetBits</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function implements set bit count.">
-<polygon fill="#999999" stroke="#666666" points="131.5,-30.5 0,-30.5 0,0 131.5,0 131.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::count</text>
-<text text-anchor="middle" x="65.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_of_set_bits::countSetBits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.45,-30.99C37.69,-40.06 45.46,-48.5 65.75,-48.5 76.85,-48.5 84.2,-45.97 87.8,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.26,-42.82 88.88,-32.49 84.3,-42.04 91.26,-42.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/db8/count__of__set__bits_8cpp_source.html b/da/db8/count__of__set__bits_8cpp_source.html
new file mode 100644
index 000000000..d1f91b0c7
--- /dev/null
+++ b/da/db8/count__of__set__bits_8cpp_source.html
@@ -0,0 +1,193 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: bit_manipulation/count_of_set_bits.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/db8/count__of__set__bits_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">count_of_set_bits.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/db8/count__of__set__bits_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a> {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/dae/namespacecount__of__set__bits.html">count_of_set_bits</a> {</div>
+<div class="foldopen" id="foldopen00038" data-start="{" data-end="}">
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="../../da/db8/count__of__set__bits_8cpp.html#a86c98dc299e4db28b73e08309d977e62">   38</a></span>std::uint64_t <a class="code hl_function" href="../../da/db8/count__of__set__bits_8cpp.html#a86c98dc299e4db28b73e08309d977e62">countSetBits</a>(</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    std ::int64_t n) {  <span class="comment">// int64_t is preferred over int so that</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>                        <span class="comment">// no Overflow can be there.</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordtype">int</span> count = 0;  <span class="comment">// &quot;count&quot; variable is used to count number of set-bits(&#39;1&#39;)</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>                    <span class="comment">// in binary representation of number &#39;n&#39;</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">while</span> (n != 0) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        ++count;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        n = (n &amp; (n - 1));</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">return</span> count;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="comment">// Why this algorithm is better than the standard one?</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="comment">// Because this algorithm runs the same number of times as the number of</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="comment">// set-bits in it. Means if my number is having &quot;3&quot; set bits, then this</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="comment">// while loop will run only &quot;3&quot; times!!</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>}</div>
+</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>}  <span class="comment">// namespace count_of_set_bits</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>}  <span class="comment">// namespace bit_manipulation</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="keyword">static</span> <span class="keywordtype">void</span> test() {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="comment">// n = 4 return 1</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    assert(bit_manipulation::count_of_set_bits::countSetBits(4) == 1);</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="comment">// n = 6 return 2</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    assert(bit_manipulation::count_of_set_bits::countSetBits(6) == 2);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="comment">// n = 13 return 3</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    assert(bit_manipulation::count_of_set_bits::countSetBits(13) == 3);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="comment">// n = 9 return 2</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    assert(bit_manipulation::count_of_set_bits::countSetBits(9) == 2);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="comment">// n = 15 return 4</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    assert(bit_manipulation::count_of_set_bits::countSetBits(15) == 4);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="comment">// n = 25 return 3</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    assert(bit_manipulation::count_of_set_bits::countSetBits(25) == 3);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="comment">// n = 97 return 3</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    assert(bit_manipulation::count_of_set_bits::countSetBits(97) == 3);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="comment">// n = 31 return 5</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    assert(bit_manipulation::count_of_set_bits::countSetBits(31) == 5);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>}</div>
+<div class="foldopen" id="foldopen00080" data-start="{" data-end="}">
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="../../da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   80</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    test();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>}</div>
+</div>
+<div class="ttc" id="acount__of__set__bits_8cpp_html_a86c98dc299e4db28b73e08309d977e62"><div class="ttname"><a href="../../da/db8/count__of__set__bits_8cpp.html#a86c98dc299e4db28b73e08309d977e62">bit_manipulation::count_of_set_bits::countSetBits</a></div><div class="ttdeci">std::uint64_t countSetBits(std ::int64_t n)</div><div class="ttdoc">The main function implements set bit count.</div><div class="ttdef"><b>Definition</b> <a href="#l00038">count_of_set_bits.cpp:38</a></div></div>
+<div class="ttc" id="acount__of__set__bits_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00080">count_of_set_bits.cpp:80</a></div></div>
+<div class="ttc" id="anamespacebit__manipulation_html"><div class="ttname"><a href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacecount__of__set__bits_html"><div class="ttname"><a href="../../dd/dae/namespacecount__of__set__bits.html">count_of_set_bits</a></div><div class="ttdoc">Functions for the count sets bits implementation.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_f3c4fbc4e901afa0a54d0623c5574aa7.html">bit_manipulation</a></li><li class="navelem"><a class="el" href="../../da/db8/count__of__set__bits_8cpp.html">count_of_set_bits.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.map b/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.map
index 37a7c2e4c..a34b2b0ed 100644
--- a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.map
+++ b/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.map
@@ -1,5 +1,5 @@
 <map id="std::is_unsigned&lt; uint128_t &gt;" name="std::is_unsigned&lt; uint128_t &gt;">
 <area shape="rect" id="Node000001" title=" " alt="" coords="5,79,199,105"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integral_constant.html" title=" " alt="" coords="51,5,153,31"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="51,5,153,31"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="105,46,105,79,99,79,99,46"/>
 </map>
diff --git a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.md5 b/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.md5
index 443f973ea..a5d3325c5 100644
--- a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.md5
+++ b/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.md5
@@ -1 +1 @@
-a18170162392886a96741c2eb8222654
\ No newline at end of file
+a8f7d2e6c774fe67f34c2f81999b394c
\ No newline at end of file
diff --git a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.svg b/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.svg
index c817ebd59..dc67d8b81 100644
--- a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.svg
+++ b/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="110.5,-74.5 34.5,-74.5 34.5,-55.25 110.5,-55.25 110.5,-74.5"/>
 <text text-anchor="middle" x="72.5" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph_org.svg b/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph_org.svg
index 91dcbf896..9a8e4ed1b 100644
--- a/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph_org.svg
+++ b/da/dc1/structstd_1_1is__unsigned_3_01uint128__t_01_4__coll__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="110.5,-74.5 34.5,-74.5 34.5,-55.25 110.5,-55.25 110.5,-74.5"/>
 <text text-anchor="middle" x="72.5" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/da/dc3/linked__list_8cpp.html b/da/dc3/linked__list_8cpp.html
index d3557b65a..5220f72ca 100644
--- a/da/dc3/linked__list_8cpp.html
+++ b/da/dc3/linked__list_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/linked_list.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/linked_list.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for linked_list.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/db7/linked__list_8cpp__incl.svg" width="252" height="126"><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">
+</div>
+<p><a href="../../da/dc3/linked__list_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">data_structures::linked_list::link</a></td></tr>
@@ -141,7 +160,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:ab1a372fe1e605bc0e0987dcdd7361180" id="r_ab1a372fe1e605bc0e0987dcdd7361180"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab1a372fe1e605bc0e0987dcdd7361180">data_structures::linked_list::isDigit</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;s)</td></tr>
+<tr class="memitem:ab1a372fe1e605bc0e0987dcdd7361180" id="r_ab1a372fe1e605bc0e0987dcdd7361180"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab1a372fe1e605bc0e0987dcdd7361180">data_structures::linked_list::isDigit</a> (const std::string &amp;s)</td></tr>
 <tr class="separator:ab1a372fe1e605bc0e0987dcdd7361180"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
 <tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -154,6 +173,8 @@ Algorithm</h3>
 <p>Values can be added by iterating to the end of a <a class="el" href="../../d8/d10/structlist.html">list(by following
 the pointers)</a> starting from the first link. Whichever link points to null is considered the last link and is pointed to the new value.</p>
 <p>Values can be removed by also iterating through the list. When the node containing the value is found, the node pointing to the current node is made to point to the node that the current node is pointing to, and then returning the current node to heap store. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ab1a372fe1e605bc0e0987dcdd7361180" name="ab1a372fe1e605bc0e0987dcdd7361180"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ab1a372fe1e605bc0e0987dcdd7361180">&#9670;&#160;</a></span>isDigit()</h2>
@@ -164,7 +185,7 @@ the pointers)</a> starting from the first link. Whichever link points to null is
         <tr>
           <td class="memname">bool data_structures::linked_list::isDigit </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>s</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -178,22 +199,18 @@ the pointers)</a> starting from the first link. Whichever link points to null is
 <dl class="section return"><dt>Returns</dt><dd>true if there are only digits present in the string </dd>
 <dd>
 false if any other character is found </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   40</span>                                 {</div>
 <div class="line"><span class="lineno">   41</span>    <span class="comment">// function statements here</span></div>
 <div class="line"><span class="lineno">   42</span>    <span class="keywordflow">for</span> (<span class="keywordtype">char</span> i : s) {</div>
-<div class="line"><span class="lineno">   43</span>        <span class="keywordflow">if</span> (!<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/isdigit.html">isdigit</a>(i)) {</div>
+<div class="line"><span class="lineno">   43</span>        <span class="keywordflow">if</span> (!isdigit(i)) {</div>
 <div class="line"><span class="lineno">   44</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   45</span>        }</div>
 <div class="line"><span class="lineno">   46</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="ttc" id="aisdigit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/isdigit.html">std::isdigit</a></div><div class="ttdeci">T isdigit(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.svg" width="164" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -211,80 +228,71 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Main function: Allows the user add and delete values from the list. Also allows user to search for and display values in the list. </p><dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00222">222</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  222</span>           {</div>
 <div class="line"><span class="lineno">  223</span>    <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>;</div>
 <div class="line"><span class="lineno">  224</span>    <span class="keywordtype">int</span> choice = 0;</div>
 <div class="line"><span class="lineno">  225</span>    <span class="keywordtype">int</span> x = 0;</div>
-<div class="line"><span class="lineno">  226</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s;</div>
+<div class="line"><span class="lineno">  226</span>    std::string s;</div>
 <div class="line"><span class="lineno">  227</span>    <span class="keywordflow">do</span> {</div>
-<div class="line"><span class="lineno">  228</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n1. Insert&quot;</span>;</div>
-<div class="line"><span class="lineno">  229</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n2. Delete&quot;</span>;</div>
-<div class="line"><span class="lineno">  230</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n3. Search&quot;</span>;</div>
-<div class="line"><span class="lineno">  231</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n4. Print&quot;</span>;</div>
-<div class="line"><span class="lineno">  232</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n0. Exit&quot;</span>;</div>
-<div class="line"><span class="lineno">  233</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n\nEnter you choice : &quot;</span>;</div>
-<div class="line"><span class="lineno">  234</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; choice;</div>
+<div class="line"><span class="lineno">  228</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n1. Insert&quot;</span>;</div>
+<div class="line"><span class="lineno">  229</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n2. Delete&quot;</span>;</div>
+<div class="line"><span class="lineno">  230</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n3. Search&quot;</span>;</div>
+<div class="line"><span class="lineno">  231</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n4. Print&quot;</span>;</div>
+<div class="line"><span class="lineno">  232</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n0. Exit&quot;</span>;</div>
+<div class="line"><span class="lineno">  233</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n\nEnter you choice : &quot;</span>;</div>
+<div class="line"><span class="lineno">  234</span>        std::cin &gt;&gt; choice;</div>
 <div class="line"><span class="lineno">  235</span>        <span class="keywordflow">switch</span> (choice) {</div>
 <div class="line"><span class="lineno">  236</span>            <span class="keywordflow">case</span> 0:</div>
-<div class="line"><span class="lineno">  237</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nQuitting the program...\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  237</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\nQuitting the program...\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  238</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  239</span>            <span class="keywordflow">case</span> 1:</div>
-<div class="line"><span class="lineno">  240</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter the element to be inserted : &quot;</span>;</div>
-<div class="line"><span class="lineno">  241</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; s;</div>
+<div class="line"><span class="lineno">  240</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the element to be inserted : &quot;</span>;</div>
+<div class="line"><span class="lineno">  241</span>                std::cin &gt;&gt; s;</div>
 <div class="line"><span class="lineno">  242</span> </div>
 <div class="line"><span class="lineno">  243</span>                <span class="keywordflow">if</span> (data_structures::linked_list::isDigit(s)) {</div>
-<div class="line"><span class="lineno">  244</span>                    x = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html">std::stoi</a>(s);</div>
+<div class="line"><span class="lineno">  244</span>                    x = std::stoi(s);</div>
 <div class="line"><span class="lineno">  245</span>                    <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>.push_back(x);</div>
 <div class="line"><span class="lineno">  246</span>                } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  247</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Wrong Input!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  247</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;Wrong Input!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  248</span>                }</div>
 <div class="line"><span class="lineno">  249</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  250</span>            <span class="keywordflow">case</span> 2:</div>
-<div class="line"><span class="lineno">  251</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter the element to be removed : &quot;</span>;</div>
-<div class="line"><span class="lineno">  252</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; s;</div>
+<div class="line"><span class="lineno">  251</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the element to be removed : &quot;</span>;</div>
+<div class="line"><span class="lineno">  252</span>                std::cin &gt;&gt; s;</div>
 <div class="line"><span class="lineno">  253</span>                <span class="keywordflow">if</span> (data_structures::linked_list::isDigit(s)) {</div>
-<div class="line"><span class="lineno">  254</span>                    x = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html">std::stoi</a>(s);</div>
+<div class="line"><span class="lineno">  254</span>                    x = std::stoi(s);</div>
 <div class="line"><span class="lineno">  255</span>                    <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>.erase(x);</div>
 <div class="line"><span class="lineno">  256</span>                } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  257</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Wrong Input!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  257</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;Wrong Input!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  258</span>                }</div>
 <div class="line"><span class="lineno">  259</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  260</span>            <span class="keywordflow">case</span> 3:</div>
-<div class="line"><span class="lineno">  261</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter the element to be searched : &quot;</span>;</div>
-<div class="line"><span class="lineno">  262</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; s;</div>
+<div class="line"><span class="lineno">  261</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the element to be searched : &quot;</span>;</div>
+<div class="line"><span class="lineno">  262</span>                std::cin &gt;&gt; s;</div>
 <div class="line"><span class="lineno">  263</span>                <span class="keywordflow">if</span> (data_structures::linked_list::isDigit(s)) {</div>
-<div class="line"><span class="lineno">  264</span>                    x = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html">std::stoi</a>(s);</div>
-<div class="line"><span class="lineno">  265</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;data_structures::linked_list::link&gt;</a> found =</div>
+<div class="line"><span class="lineno">  264</span>                    x = std::stoi(s);</div>
+<div class="line"><span class="lineno">  265</span>                    std::shared_ptr&lt;data_structures::linked_list::link&gt; found =</div>
 <div class="line"><span class="lineno">  266</span>                        <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>.search(x);</div>
 <div class="line"><span class="lineno">  267</span>                } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  268</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Wrong Input!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  268</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;Wrong Input!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  269</span>                }</div>
 <div class="line"><span class="lineno">  270</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  271</span>            <span class="keywordflow">case</span> 4:</div>
 <div class="line"><span class="lineno">  272</span>                <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>.display();</div>
-<div class="line"><span class="lineno">  273</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  273</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  274</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  275</span>            <span class="keywordflow">default</span>:</div>
-<div class="line"><span class="lineno">  276</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Invalid Input\n&quot;</span> &lt;&lt; <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">  276</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Invalid Input\n&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  277</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  278</span>        }</div>
 <div class="line"><span class="lineno">  279</span>    } <span class="keywordflow">while</span> (choice != 0);</div>
 <div class="line"><span class="lineno">  280</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  281</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a></div><div class="ttdef"><b>Definition</b> reverse_a_linked_list.cpp:68</div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:119</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="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div></div>
-<div class="ttc" id="astol_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html">std::stoi</a></div><div class="ttdeci">T stoi(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="180" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a></div><div class="ttdef"><b>Definition</b> <a href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00068">reverse_a_linked_list.cpp:68</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00119">composite_simpson_rule.cpp:119</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.map b/da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.map
deleted file mode 100644
index 03ccc890f..000000000
--- a/da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="data_structures::linked_list::isDigit" name="data_structures::linked_list::isDigit">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,159,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="52,29,51,19,56,11,66,5,82,3,99,5,109,11,106,16,97,10,82,8,68,10,59,14,56,20,57,28"/>
-</map>
diff --git a/da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.md5 b/da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.md5
deleted file mode 100644
index edd046da9..000000000
--- a/da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9c384d21fdacc398d943f956d6300ac8
\ No newline at end of file
diff --git a/da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.svg b/da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.svg
deleted file mode 100644
index fa3dfda2a..000000000
--- a/da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::isDigit Pages: 1 -->
-<svg width="123pt" height="57pt"
- viewBox="0.00 0.00 123.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>data_structures::linked_list::isDigit</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::isDigit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.12,-30.99C32.96,-40.06 39.76,-48.5 57.5,-48.5 67.2,-48.5 73.63,-45.97 76.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.25,-42.78 77.73,-32.49 73.28,-42.11 80.25,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph_org.svg b/da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph_org.svg
deleted file mode 100644
index 536df65b8..000000000
--- a/da/dc3/linked__list_8cpp_ab1a372fe1e605bc0e0987dcdd7361180_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::linked_list::isDigit Pages: 1 -->
-<svg width="123pt" height="57pt"
- viewBox="0.00 0.00 123.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>data_structures::linked_list::isDigit</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::linked</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_list::isDigit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.12,-30.99C32.96,-40.06 39.76,-48.5 57.5,-48.5 67.2,-48.5 73.63,-45.97 76.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.25,-42.78 77.73,-32.49 73.28,-42.11 80.25,-42.78"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 816c662ea..000000000
--- a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,35,87,27,88,33,56,40"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/stol.html#" title=" " alt="" coords="104,55,172,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,46,89,54,88,59,55,52"/>
-</map>
diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 17f05a85b..000000000
--- a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c603039fabf0cb12a3b6f966237503b1
\ No newline at end of file
diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index e11f30717..000000000
--- a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="64pt"
- viewBox="0.00 0.00 134.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-56.25 73,-56.25 73,-37 126.5,-37 126.5,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.64,-33.65 53.16,-35.69 61.53,-37.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.71,-41.1 71.25,-40.03 62.34,-34.3 60.71,-41.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125.38,-19.25 74.12,-19.25 74.12,0 125.38,0 125.38,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stoi</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C44.91,-21.85 53.81,-19.83 62.49,-17.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="63.18,-21.29 72.15,-15.67 61.63,-14.47 63.18,-21.29"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 698f753d8..000000000
--- a/da/dc3/linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="64pt"
- viewBox="0.00 0.00 134.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-56.25 73,-56.25 73,-37 126.5,-37 126.5,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.64,-33.65 53.16,-35.69 61.53,-37.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.71,-41.1 71.25,-40.03 62.34,-34.3 60.71,-41.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125.38,-19.25 74.12,-19.25 74.12,0 125.38,0 125.38,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stoi</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C44.91,-21.85 53.81,-19.83 62.49,-17.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="63.18,-21.29 72.15,-15.67 61.63,-14.47 63.18,-21.29"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/dc3/linked__list_8cpp_source.html b/da/dc3/linked__list_8cpp_source.html
new file mode 100644
index 000000000..66df0e049
--- /dev/null
+++ b/da/dc3/linked__list_8cpp_source.html
@@ -0,0 +1,378 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/linked_list.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/dc3/linked__list_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">linked_list.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/dc3/linked__list_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;memory&gt;</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;string&gt;</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d3c/namespacedata__structures.html">data_structures</a> {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d3/db0/namespacelinked__list.html">linked_list</a> {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="foldopen" id="foldopen00040" data-start="{" data-end="}">
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180">   40</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180">isDigit</a>(<span class="keyword">const</span> std::string&amp; s) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="comment">// function statements here</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">for</span> (<span class="keywordtype">char</span> i : s) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="keywordflow">if</span> (!isdigit(i)) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    }</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>}</div>
+</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="foldopen" id="foldopen00053" data-start="{" data-end="};">
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">   53</a></span><span class="keyword">class </span><a class="code hl_class" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#ac121ce37b6ea864b160ebcada0bce936">   55</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#ac121ce37b6ea864b160ebcada0bce936">pvalue</a>;                   </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af94c06f3220e5406245680f58b8e7081">   56</a></span>    std::shared_ptr&lt;link&gt; <a class="code hl_variable" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af94c06f3220e5406245680f58b8e7081">psucc</a>;  </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"><a class="line" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#acf96f3a9a1d3b15268c38e8822300c11">   63</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#acf96f3a9a1d3b15268c38e8822300c11">val</a>() { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#ac121ce37b6ea864b160ebcada0bce936">pvalue</a>; }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3">   69</a></span>    std::shared_ptr&lt;link&gt;&amp; <a class="code hl_function" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3">succ</a>() { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af94c06f3220e5406245680f58b8e7081">psucc</a>; }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb">   75</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb">link</a>(<span class="keywordtype">int</span> value = 0) : <a class="code hl_variable" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#ac121ce37b6ea864b160ebcada0bce936">pvalue</a>(value), <a class="code hl_variable" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af94c06f3220e5406245680f58b8e7081">psucc</a>(nullptr) {}</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>};</div>
+</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span><span class="keyword">class </span><a class="code hl_struct" href="../../d8/d10/structlist.html">list</a> {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"><a class="line" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1">   83</a></span>    std::shared_ptr&lt;link&gt; <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>;  </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"><a class="line" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">   84</a></span>    std::shared_ptr&lt;link&gt; <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a>;   </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00089" data-start="{" data-end="}">
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"><a class="line" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826">   89</a></span>    <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826">list</a>() {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        <span class="comment">// Initialize the first link</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a> = std::make_shared&lt;link&gt;();</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        <span class="comment">// Initialize the last link with the first link</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a> = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    }</div>
+</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>();</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a6e9859d1a0755fb51e41904d20c95496">push_back</a>(<span class="keywordtype">int</span> new_elem);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a332b965afd9d6bea8d3246673acd52c7">push_front</a>(<span class="keywordtype">int</span> new_elem);</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a009b19ac8cca40f2e4daa2e5989fa4f3">erase</a>(<span class="keywordtype">int</span> old_elem);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a1313837c0e9ec67fd9fbd17987e2d615">display</a>();</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    std::shared_ptr&lt;link&gt; <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>(<span class="keywordtype">int</span> find_elem);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="keywordtype">void</span> reverse();</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>};</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
+<div class="foldopen" id="foldopen00111" data-start="{" data-end="}">
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"><a class="line" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897">  111</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897">list::isEmpty</a>() {</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a> == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    }</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>}</div>
+</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="foldopen" id="foldopen00123" data-start="{" data-end="}">
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"><a class="line" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a6e9859d1a0755fb51e41904d20c95496">  123</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a6e9859d1a0755fb51e41904d20c95496">list::push_back</a>(<span class="keywordtype">int</span> new_elem) {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ() = std::make_shared&lt;link&gt;(new_elem);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a> = <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ();</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a>-&gt;succ() = std::make_shared&lt;link&gt;(new_elem);</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a> = <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a>-&gt;succ();</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    }</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>}</div>
+</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
+<div class="foldopen" id="foldopen00137" data-start="{" data-end="}">
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"><a class="line" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a332b965afd9d6bea8d3246673acd52c7">  137</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a332b965afd9d6bea8d3246673acd52c7">list::push_front</a>(<span class="keywordtype">int</span> new_elem) {</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>        <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ() = std::make_shared&lt;link&gt;(new_elem);</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a> = <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ();</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        std::shared_ptr&lt;link&gt; t = std::make_shared&lt;link&gt;(new_elem);</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        t-&gt;succ() = <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ();</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>-&gt;succ() = t;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    }</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>}</div>
+</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span> </div>
+<div class="foldopen" id="foldopen00152" data-start="{" data-end="}">
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"><a class="line" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a009b19ac8cca40f2e4daa2e5989fa4f3">  152</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a009b19ac8cca40f2e4daa2e5989fa4f3">list::erase</a>(<span class="keywordtype">int</span> old_elem) {</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;List is Empty!&quot;</span>;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    }</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    std::shared_ptr&lt;link&gt; t = <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    std::shared_ptr&lt;link&gt; to_be_removed = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    <span class="keywordflow">while</span> (t != <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a> &amp;&amp; t-&gt;succ()-&gt;val() != old_elem) {</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>        t = t-&gt;succ();</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    }</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    <span class="keywordflow">if</span> (t == <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a>) {</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Element not found\n&quot;</span>;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    }</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    to_be_removed = t-&gt;succ();</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    t-&gt;succ() = t-&gt;succ()-&gt;succ();</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    to_be_removed.reset();</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    <span class="keywordflow">if</span> (t-&gt;succ() == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a> = t;</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    }</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a> == <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a>){</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>        <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a> = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    }</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>}</div>
+</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
+<div class="foldopen" id="foldopen00181" data-start="{" data-end="}">
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"><a class="line" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a1313837c0e9ec67fd9fbd17987e2d615">  181</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a1313837c0e9ec67fd9fbd17987e2d615">list::display</a>() {</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;List is Empty!&quot;</span>;</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    }</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    std::shared_ptr&lt;link&gt; t = <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>;</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    <span class="keywordflow">while</span> (t-&gt;succ() != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>        std::cout &lt;&lt; t-&gt;succ()-&gt;val() &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        t = t-&gt;succ();</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    }</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>}</div>
+</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span> </div>
+<div class="foldopen" id="foldopen00197" data-start="{" data-end="}">
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"><a class="line" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ad3423f7518671351340932db3c24959a">  197</a></span>std::shared_ptr&lt;link&gt; <a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ad3423f7518671351340932db3c24959a">list::search</a>(<span class="keywordtype">int</span> find_elem) {</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897">isEmpty</a>()) {</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;List is Empty!&quot;</span>;</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>        <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    }</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    std::shared_ptr&lt;link&gt; t = <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1">first</a>;</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    <span class="keywordflow">while</span> (t != <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a> &amp;&amp; t-&gt;succ()-&gt;val() != find_elem) {</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>        t = t-&gt;succ();</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    }</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    <span class="keywordflow">if</span> (t == <a class="code hl_variable" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">last</a>) {</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Element not found\n&quot;</span>;</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>        <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    }</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Element was found\n&quot;</span>;</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    <span class="keywordflow">return</span> t-&gt;succ();</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>}</div>
+</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>}  <span class="comment">// namespace linked_list</span></div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>}  <span class="comment">// namespace data_structures</span></div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span> </div>
+<div class="foldopen" id="foldopen00222" data-start="{" data-end="}">
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"><a class="line" href="../../da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  222</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    <a class="code hl_class" href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a> l;</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    <span class="keywordtype">int</span> choice = 0;</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    <span class="keywordtype">int</span> x = 0;</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    std::string s;</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n1. Insert&quot;</span>;</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n2. Delete&quot;</span>;</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n3. Search&quot;</span>;</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n4. Print&quot;</span>;</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n0. Exit&quot;</span>;</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n\nEnter you choice : &quot;</span>;</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>        std::cin &gt;&gt; choice;</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>        <span class="keywordflow">switch</span> (choice) {</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>            <span class="keywordflow">case</span> 0:</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\nQuitting the program...\n&quot;</span>;</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>            <span class="keywordflow">case</span> 1:</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the element to be inserted : &quot;</span>;</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>                std::cin &gt;&gt; s;</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span> </div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>                <span class="keywordflow">if</span> (data_structures::linked_list::isDigit(s)) {</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>                    x = std::stoi(s);</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>                    l.push_back(x);</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>                } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;Wrong Input!\n&quot;</span>;</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>                }</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>            <span class="keywordflow">case</span> 2:</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the element to be removed : &quot;</span>;</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>                std::cin &gt;&gt; s;</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>                <span class="keywordflow">if</span> (data_structures::linked_list::isDigit(s)) {</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>                    x = std::stoi(s);</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>                    l.erase(x);</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>                } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;Wrong Input!\n&quot;</span>;</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>                }</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>            <span class="keywordflow">case</span> 3:</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the element to be searched : &quot;</span>;</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>                std::cin &gt;&gt; s;</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>                <span class="keywordflow">if</span> (data_structures::linked_list::isDigit(s)) {</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>                    x = std::stoi(s);</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>                    std::shared_ptr&lt;data_structures::linked_list::link&gt; found =</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>                        l.search(x);</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>                } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;Wrong Input!\n&quot;</span>;</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>                }</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>            <span class="keywordflow">case</span> 4:</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>                l.display();</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>            <span class="keywordflow">default</span>:</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Invalid Input\n&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>        }</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>    } <span class="keywordflow">while</span> (choice != 0);</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>}</div>
+</div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1link_html"><div class="ttname"><a href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">data_structures::linked_list::link</a></div><div class="ttdef"><b>Definition</b> <a href="#l00053">linked_list.cpp:53</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1link_html_aba4672fbc40c38962d1510b843a577bb"><div class="ttname"><a href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb">data_structures::linked_list::link::link</a></div><div class="ttdeci">link(int value=0)</div><div class="ttdef"><b>Definition</b> <a href="#l00075">linked_list.cpp:75</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1link_html_ac121ce37b6ea864b160ebcada0bce936"><div class="ttname"><a href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#ac121ce37b6ea864b160ebcada0bce936">data_structures::linked_list::link::pvalue</a></div><div class="ttdeci">int pvalue</div><div class="ttdoc">value of the current link</div><div class="ttdef"><b>Definition</b> <a href="#l00055">linked_list.cpp:55</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1link_html_acf96f3a9a1d3b15268c38e8822300c11"><div class="ttname"><a href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#acf96f3a9a1d3b15268c38e8822300c11">data_structures::linked_list::link::val</a></div><div class="ttdeci">int val()</div><div class="ttdef"><b>Definition</b> <a href="#l00063">linked_list.cpp:63</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1link_html_af6bbeb9bfde1683ba917071edeedd5c3"><div class="ttname"><a href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3">data_structures::linked_list::link::succ</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; &amp; succ()</div><div class="ttdef"><b>Definition</b> <a href="#l00069">linked_list.cpp:69</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1link_html_af94c06f3220e5406245680f58b8e7081"><div class="ttname"><a href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af94c06f3220e5406245680f58b8e7081">data_structures::linked_list::link::psucc</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; psucc</div><div class="ttdoc">pointer to the next value on the list</div><div class="ttdef"><b>Definition</b> <a href="#l00056">linked_list.cpp:56</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a></div><div class="ttdef"><b>Definition</b> <a href="../../d6/d05/reverse__a__linked__list_8cpp_source.html#l00068">reverse_a_linked_list.cpp:68</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a009b19ac8cca40f2e4daa2e5989fa4f3"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a009b19ac8cca40f2e4daa2e5989fa4f3">data_structures::linked_list::list::erase</a></div><div class="ttdeci">void erase(int old_elem)</div><div class="ttdef"><b>Definition</b> <a href="#l00152">linked_list.cpp:152</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a1313837c0e9ec67fd9fbd17987e2d615"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a1313837c0e9ec67fd9fbd17987e2d615">data_structures::linked_list::list::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition</b> <a href="#l00181">linked_list.cpp:181</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a332b965afd9d6bea8d3246673acd52c7"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a332b965afd9d6bea8d3246673acd52c7">data_structures::linked_list::list::push_front</a></div><div class="ttdeci">void push_front(int new_elem)</div><div class="ttdef"><b>Definition</b> <a href="#l00137">linked_list.cpp:137</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a454ab4918f579869dfed4bb420a3f897"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897">data_structures::linked_list::list::isEmpty</a></div><div class="ttdeci">bool isEmpty()</div><div class="ttdef"><b>Definition</b> <a href="#l00111">linked_list.cpp:111</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a50e209b55b83622254177050945e7826"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826">data_structures::linked_list::list::list</a></div><div class="ttdeci">list()</div><div class="ttdef"><b>Definition</b> <a href="#l00089">linked_list.cpp:89</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a6e9859d1a0755fb51e41904d20c95496"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a6e9859d1a0755fb51e41904d20c95496">data_structures::linked_list::list::push_back</a></div><div class="ttdeci">void push_back(int new_elem)</div><div class="ttdef"><b>Definition</b> <a href="#l00123">linked_list.cpp:123</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_aa3801cea564a3b3bb7b03abfffdcf1e1"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1">data_structures::linked_list::list::first</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; first</div><div class="ttdoc">link before the actual first element</div><div class="ttdef"><b>Definition</b> <a href="#l00083">linked_list.cpp:83</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_ad3423f7518671351340932db3c24959a"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ad3423f7518671351340932db3c24959a">data_structures::linked_list::list::search</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; search(int find_elem)</div><div class="ttdef"><b>Definition</b> <a href="#l00197">linked_list.cpp:197</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_af39bcc08641ce0c813023f364a9a9015"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015">data_structures::linked_list::list::last</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; last</div><div class="ttdoc">last link on the list</div><div class="ttdef"><b>Definition</b> <a href="#l00084">linked_list.cpp:84</a></div></div>
+<div class="ttc" id="alinked__list_8cpp_html_ab1a372fe1e605bc0e0987dcdd7361180"><div class="ttname"><a href="../../da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180">data_structures::linked_list::isDigit</a></div><div class="ttdeci">bool isDigit(const std::string &amp;s)</div><div class="ttdef"><b>Definition</b> <a href="#l00040">linked_list.cpp:40</a></div></div>
+<div class="ttc" id="alinked__list_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00222">linked_list.cpp:222</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html">data_structures</a></div><div class="ttdoc">for IO operations</div></div>
+<div class="ttc" id="anamespacelinked__list_html"><div class="ttname"><a href="../../d3/db0/namespacelinked__list.html">linked_list</a></div><div class="ttdoc">Functions for singly linked list algorithm.</div></div>
+<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> <a href="../../df/dd5/binary__search_8cpp_source.html#l00047">binary_search.cpp:47</a></div></div>
+<div class="ttc" id="astructlist_html"><div class="ttname"><a href="../../d8/d10/structlist.html">list</a></div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00029">hash_search.cpp:29</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../da/dc3/linked__list_8cpp.html">linked_list.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/dc9/fibonacci__matrix__exponentiation_8cpp.html b/da/dc9/fibonacci__matrix__exponentiation_8cpp.html
index 6e08ab355..5923b6d80 100644
--- a/da/dc9/fibonacci__matrix__exponentiation_8cpp.html
+++ b/da/dc9/fibonacci__matrix__exponentiation_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/fibonacci_matrix_exponentiation.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/fibonacci_matrix_exponentiation.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for fibonacci_matrix_exponentiation.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/ded/fibonacci__matrix__exponentiation_8cpp__incl.svg" width="336" height="126"><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">
+</div>
+<p><a href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:abc3bc08249058d57cfc8f54a29d9cf9f" id="r_abc3bc08249058d57cfc8f54a29d9cf9f"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abc3bc08249058d57cfc8f54a29d9cf9f">fibo</a> (uint64_t n, uint64_t mod)</td></tr>
@@ -138,6 +157,8 @@ Functions</h2></td></tr>
 <dd>
 [unknown author]() </dd></dl>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d9/d89/fibonacci_8cpp.html" title="n-th Fibonacci number.">fibonacci.cpp</a>, <a class="el" href="../../d4/d32/fibonacci__fast_8cpp.html" title="Faster computation of Fibonacci series.">fibonacci_fast.cpp</a>, <a class="el" href="../../de/d47/string__fibonacci_8cpp.html" title="This Programme returns the Nth fibonacci as a string.">string_fibonacci.cpp</a>, <a class="el" href="../../de/de4/fibonacci__large_8cpp.html" title="Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library ...">fibonacci_large.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html">fibonacci_matrix_exponentiation.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="abc3bc08249058d57cfc8f54a29d9cf9f" name="abc3bc08249058d57cfc8f54a29d9cf9f"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#abc3bc08249058d57cfc8f54a29d9cf9f">&#9670;&#160;</a></span>fibo()</h2>
@@ -164,11 +185,13 @@ Functions</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html#l00025">25</a> of file <a class="el" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html">fibonacci_matrix_exponentiation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   25</span>                                        {</div>
-<div class="line"><span class="lineno">   26</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(2, 0);</div>
-<div class="line"><span class="lineno">   27</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;uint64_t&gt;</a>&gt; transition(2,</div>
-<div class="line"><span class="lineno">   28</span>                                                  <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a>(2, 0));</div>
-<div class="line"><span class="lineno">   29</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;uint64_t&gt;</a>&gt; Identity(2, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a>(2, 0));</div>
+<div class="line"><span class="lineno">   26</span>    std::vector&lt;uint64_t&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(2, 0);</div>
+<div class="line"><span class="lineno">   27</span>    std::vector&lt;std::vector&lt;uint64_t&gt;&gt; transition(2,</div>
+<div class="line"><span class="lineno">   28</span>                                                  std::vector&lt;uint64_t&gt;(2, 0));</div>
+<div class="line"><span class="lineno">   29</span>    std::vector&lt;std::vector&lt;uint64_t&gt;&gt; Identity(2, std::vector&lt;uint64_t&gt;(2, 0));</div>
 <div class="line"><span class="lineno">   30</span>    n--;</div>
 <div class="line"><span class="lineno">   31</span>    <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>[0] = 1, <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>[1] = 1;</div>
 <div class="line"><span class="lineno">   32</span>    Identity[0][0] = 1;</div>
@@ -181,8 +204,8 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   39</span> </div>
 <div class="line"><span class="lineno">   40</span>    <span class="keywordflow">while</span> (n) {</div>
 <div class="line"><span class="lineno">   41</span>        <span class="keywordflow">if</span> (n % 2) {</div>
-<div class="line"><span class="lineno">   42</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;uint64_t&gt;</a>&gt; res(2,</div>
-<div class="line"><span class="lineno">   43</span>                                                   <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a>(2, 0));</div>
+<div class="line"><span class="lineno">   42</span>            std::vector&lt;std::vector&lt;uint64_t&gt;&gt; res(2,</div>
+<div class="line"><span class="lineno">   43</span>                                                   std::vector&lt;uint64_t&gt;(2, 0));</div>
 <div class="line"><span class="lineno">   44</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 2; i++) {</div>
 <div class="line"><span class="lineno">   45</span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; 2; j++) {</div>
 <div class="line"><span class="lineno">   46</span>                    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> &lt; 2; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++) {</div>
@@ -201,8 +224,8 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   59</span>            }</div>
 <div class="line"><span class="lineno">   60</span>            n--;</div>
 <div class="line"><span class="lineno">   61</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   62</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;uint64_t&gt;</a>&gt; res1(</div>
-<div class="line"><span class="lineno">   63</span>                2, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a>(2, 0));</div>
+<div class="line"><span class="lineno">   62</span>            std::vector&lt;std::vector&lt;uint64_t&gt;&gt; res1(</div>
+<div class="line"><span class="lineno">   63</span>                2, std::vector&lt;uint64_t&gt;(2, 0));</div>
 <div class="line"><span class="lineno">   64</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 2; i++) {</div>
 <div class="line"><span class="lineno">   65</span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; 2; j++) {</div>
 <div class="line"><span class="lineno">   66</span>                    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> &lt; 2; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++) {</div>
@@ -226,9 +249,8 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   84</span>            (result[1] % mod * Identity[1][0] % mod) % mod) %</div>
 <div class="line"><span class="lineno">   85</span>           mod;</div>
 <div class="line"><span class="lineno">   86</span>}</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</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 class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -247,26 +269,20 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html#l00108">108</a> of file <a class="el" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html">fibonacci_matrix_exponentiation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  108</span>           {</div>
 <div class="line"><span class="lineno">  109</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
 <div class="line"><span class="lineno">  110</span>    uint64_t mod = 1000000007;</div>
-<div class="line"><span class="lineno">  111</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the value of N: &quot;</span>;</div>
+<div class="line"><span class="lineno">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the value of N: &quot;</span>;</div>
 <div class="line"><span class="lineno">  112</span>    uint64_t n = 0;</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_istream.html">std::cin</a> &gt;&gt; n;</div>
-<div class="line"><span class="lineno">  114</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot;th Fibonacci number in modulo &quot;</span> &lt;&lt; mod &lt;&lt; <span class="stringliteral">&quot;: &quot;</span></div>
-<div class="line"><span class="lineno">  115</span>              &lt;&lt; <a class="code hl_function" href="#abc3bc08249058d57cfc8f54a29d9cf9f">fibo</a>(n, mod) &lt;&lt; <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">  113</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><span class="lineno">  114</span>    std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot;th Fibonacci number in modulo &quot;</span> &lt;&lt; mod &lt;&lt; <span class="stringliteral">&quot;: &quot;</span></div>
+<div class="line"><span class="lineno">  115</span>              &lt;&lt; <a class="code hl_function" href="#abc3bc08249058d57cfc8f54a29d9cf9f">fibo</a>(n, mod) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  116</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="afibonacci__matrix__exponentiation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> fibonacci_matrix_exponentiation.cpp:91</div></div>
-<div class="ttc" id="afibonacci__matrix__exponentiation_8cpp_html_abc3bc08249058d57cfc8f54a29d9cf9f"><div class="ttname"><a href="#abc3bc08249058d57cfc8f54a29d9cf9f">fibo</a></div><div class="ttdeci">uint64_t fibo(uint64_t n, uint64_t mod)</div><div class="ttdef"><b>Definition</b> fibonacci_matrix_exponentiation.cpp:25</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dc9/fibonacci__matrix__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="270" height="138"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afibonacci__matrix__exponentiation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html#l00091">fibonacci_matrix_exponentiation.cpp:91</a></div></div>
+<div class="ttc" id="afibonacci__matrix__exponentiation_8cpp_html_abc3bc08249058d57cfc8f54a29d9cf9f"><div class="ttname"><a href="#abc3bc08249058d57cfc8f54a29d9cf9f">fibo</a></div><div class="ttdeci">uint64_t fibo(uint64_t n, uint64_t mod)</div><div class="ttdef"><b>Definition</b> <a href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html#l00025">fibonacci_matrix_exponentiation.cpp:25</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -292,25 +308,22 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Function to test above algorithm </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html#l00091">91</a> of file <a class="el" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html">fibonacci_matrix_exponentiation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   91</span>                   {</div>
 <div class="line"><span class="lineno">   92</span>    assert(<a class="code hl_function" href="#abc3bc08249058d57cfc8f54a29d9cf9f">fibo</a>(6, 1000000007) == 8);</div>
-<div class="line"><span class="lineno">   93</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;test case:1 passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   93</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:1 passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   94</span>    assert(<a class="code hl_function" href="#abc3bc08249058d57cfc8f54a29d9cf9f">fibo</a>(5, 1000000007) == 5);</div>
-<div class="line"><span class="lineno">   95</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;test case:2 passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   95</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:2 passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   96</span>    assert(<a class="code hl_function" href="#abc3bc08249058d57cfc8f54a29d9cf9f">fibo</a>(10, 1000000007) == 55);</div>
-<div class="line"><span class="lineno">   97</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;test case:3 passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   97</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:3 passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   98</span>    assert(<a class="code hl_function" href="#abc3bc08249058d57cfc8f54a29d9cf9f">fibo</a>(500, 100) == 25);</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> &lt;&lt; <span class="stringliteral">&quot;test case:3 passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   99</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:3 passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  100</span>    assert(<a class="code hl_function" href="#abc3bc08249058d57cfc8f54a29d9cf9f">fibo</a>(500, 10000) == 4125);</div>
-<div class="line"><span class="lineno">  101</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;test case:3 passed\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  102</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;--All tests passed--\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:3 passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  102</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;--All tests passed--\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  103</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dc9/fibonacci__matrix__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="144" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/da/dc9/fibonacci__matrix__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/da/dc9/fibonacci__matrix__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index f2b5921ab..000000000
--- a/da/dc9/fibonacci__matrix__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="$da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f" title=" " alt="" coords="97,5,139,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/da/dc9/fibonacci__matrix__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/da/dc9/fibonacci__matrix__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 5ab3a8404..000000000
--- a/da/dc9/fibonacci__matrix__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c0358d380b74354cb3e6590922b97ff7
\ No newline at end of file
diff --git a/da/dc9/fibonacci__matrix__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/da/dc9/fibonacci__matrix__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index a906498ef..000000000
--- a/da/dc9/fibonacci__matrix__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="108pt" height="27pt"
- viewBox="0.00 0.00 108.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="100.25,-19.25 68.5,-19.25 68.5,0 100.25,0 100.25,-19.25"/>
-<text text-anchor="middle" x="84.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.92,-9.62C40.11,-9.62 48.82,-9.62 56.97,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.76,-13.13 66.76,-9.63 56.76,-6.13 56.76,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/dc9/fibonacci__matrix__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/da/dc9/fibonacci__matrix__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index db1d386b6..000000000
--- a/da/dc9/fibonacci__matrix__exponentiation_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="108pt" height="27pt"
- viewBox="0.00 0.00 108.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="100.25,-19.25 68.5,-19.25 68.5,0 100.25,0 100.25,-19.25"/>
-<text text-anchor="middle" x="84.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.92,-9.62C40.11,-9.62 48.82,-9.62 56.97,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.76,-13.13 66.76,-9.63 56.76,-6.13 56.76,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/dc9/fibonacci__matrix__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/dc9/fibonacci__matrix__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 6e181a731..000000000
--- a/da/dc9/fibonacci__matrix__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,56,55,82"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,55,94,36,97,41,56,60"/>
-<area shape="rect" id="Node000003" href="$da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f" title=" " alt="" coords="222,81,264,107"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,69,207,87,206,93,55,74"/>
-<area shape="rect" id="Node000004" href="$da/dc9/fibonacci__matrix__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title=" " alt="" coords="117,107,160,132"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,78,104,101,102,106,54,83"/>
-<area shape="poly" id="edge4_Node000004_Node000003" title=" " alt="" coords="160,112,206,100,208,105,161,117"/>
-</map>
diff --git a/da/dc9/fibonacci__matrix__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/dc9/fibonacci__matrix__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index faaa4c9dd..000000000
--- a/da/dc9/fibonacci__matrix__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0b4e69227131474b2c14d2ac8d188dfc
\ No newline at end of file
diff --git a/da/dc9/fibonacci__matrix__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/dc9/fibonacci__matrix__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 6be1219af..000000000
--- a/da/dc9/fibonacci__matrix__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,110 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="202pt" height="103pt"
- viewBox="0.00 0.00 202.25 103.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 99.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-57.25 0,-57.25 0,-38 37,-38 37,-57.25"/>
-<text text-anchor="middle" x="18.5" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-95.25 73,-95.25 73,-76 126.5,-76 126.5,-95.25"/>
-<text text-anchor="middle" x="99.75" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-56.25C46.36,-60.51 57.34,-65.77 67.53,-70.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.86,-73.73 76.39,-74.9 68.88,-67.42 65.86,-73.73"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194.25,-38.25 162.5,-38.25 162.5,-19 194.25,-19 194.25,-38.25"/>
-<text text-anchor="middle" x="178.38" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.3,-45.48C65.05,-42.14 118.75,-35.68 151,-31.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.2,-35.3 160.71,-30.63 150.36,-28.35 151.2,-35.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116,-19.25 83.5,-19.25 83.5,0 116,0 116,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-39C48.04,-33.94 61.56,-27.46 73.21,-21.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.38,-25.19 81.88,-17.71 71.35,-18.88 74.38,-25.19"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.26,-13.47C126.29,-15.96 139.61,-19.26 151.25,-22.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.14,-25.48 160.68,-24.49 151.82,-18.68 150.14,-25.48"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/dc9/fibonacci__matrix__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/da/dc9/fibonacci__matrix__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 2fad053d3..000000000
--- a/da/dc9/fibonacci__matrix__exponentiation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="202pt" height="103pt"
- viewBox="0.00 0.00 202.25 103.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 99.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-57.25 0,-57.25 0,-38 37,-38 37,-57.25"/>
-<text text-anchor="middle" x="18.5" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-95.25 73,-95.25 73,-76 126.5,-76 126.5,-95.25"/>
-<text text-anchor="middle" x="99.75" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-56.25C46.36,-60.51 57.34,-65.77 67.53,-70.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.86,-73.73 76.39,-74.9 68.88,-67.42 65.86,-73.73"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194.25,-38.25 162.5,-38.25 162.5,-19 194.25,-19 194.25,-38.25"/>
-<text text-anchor="middle" x="178.38" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.3,-45.48C65.05,-42.14 118.75,-35.68 151,-31.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.2,-35.3 160.71,-30.63 150.36,-28.35 151.2,-35.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116,-19.25 83.5,-19.25 83.5,0 116,0 116,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-39C48.04,-33.94 61.56,-27.46 73.21,-21.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.38,-25.19 81.88,-17.71 71.35,-18.88 74.38,-25.19"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.26,-13.47C126.29,-15.96 139.61,-19.26 151.25,-22.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.14,-25.48 160.68,-24.49 151.82,-18.68 150.14,-25.48"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html b/da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html
new file mode 100644
index 000000000..9eec26f8d
--- /dev/null
+++ b/da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html
@@ -0,0 +1,238 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/fibonacci_matrix_exponentiation.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">fibonacci_matrix_exponentiation.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="foldopen" id="foldopen00025" data-start="{" data-end="}">
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"><a class="line" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f">   25</a></span>uint64_t <a class="code hl_function" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f">fibo</a>(uint64_t n, uint64_t mod) {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    std::vector&lt;uint64_t&gt; result(2, 0);</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    std::vector&lt;std::vector&lt;uint64_t&gt;&gt; transition(2,</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>                                                  std::vector&lt;uint64_t&gt;(2, 0));</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    std::vector&lt;std::vector&lt;uint64_t&gt;&gt; Identity(2, std::vector&lt;uint64_t&gt;(2, 0));</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    n--;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    result[0] = 1, result[1] = 1;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    Identity[0][0] = 1;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    Identity[0][1] = 0;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    Identity[1][0] = 0;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    Identity[1][1] = 1;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    transition[0][0] = 0;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    transition[1][0] = transition[1][1] = transition[0][1] = 1;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">while</span> (n) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        <span class="keywordflow">if</span> (n % 2) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>            std::vector&lt;std::vector&lt;uint64_t&gt;&gt; res(2,</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>                                                   std::vector&lt;uint64_t&gt;(2, 0));</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 2; i++) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; 2; j++) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>                    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; k &lt; 2; k++) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>                        res[i][j] =</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>                            (res[i][j] % mod +</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>                             ((Identity[i][k] % mod * transition[k][j] % mod)) %</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>                                 mod) %</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>                            mod;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>                    }</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>                }</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 2; i++) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; 2; j++) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>                    Identity[i][j] = res[i][j];</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>                }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            }</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            n--;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            std::vector&lt;std::vector&lt;uint64_t&gt;&gt; res1(</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>                2, std::vector&lt;uint64_t&gt;(2, 0));</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 2; i++) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; 2; j++) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>                    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; k &lt; 2; k++) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>                        res1[i][j] =</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                            (res1[i][j] % mod + ((transition[i][k] % mod *</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>                                                  transition[k][j] % mod)) %</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>                                                    mod) %</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>                            mod;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>                    }</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>                }</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            }</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 2; i++) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; 2; j++) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>                    transition[i][j] = res1[i][j];</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>                }</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>            n = n / 2;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        }</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    }</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordflow">return</span> ((result[0] % mod * Identity[0][0] % mod) % mod +</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            (result[1] % mod * Identity[1][0] % mod) % mod) %</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>           mod;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>}</div>
+</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="foldopen" id="foldopen00091" data-start="{" data-end="}">
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"><a class="line" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   91</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    assert(<a class="code hl_function" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f">fibo</a>(6, 1000000007) == 8);</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:1 passed\n&quot;</span>;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    assert(<a class="code hl_function" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f">fibo</a>(5, 1000000007) == 5);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:2 passed\n&quot;</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    assert(<a class="code hl_function" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f">fibo</a>(10, 1000000007) == 55);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:3 passed\n&quot;</span>;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    assert(<a class="code hl_function" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f">fibo</a>(500, 100) == 25);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:3 passed\n&quot;</span>;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    assert(<a class="code hl_function" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f">fibo</a>(500, 10000) == 4125);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test case:3 passed\n&quot;</span>;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;--All tests passed--\n&quot;</span>;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>}</div>
+</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="foldopen" id="foldopen00108" data-start="{" data-end="}">
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"><a class="line" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  108</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <a class="code hl_function" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    uint64_t mod = 1000000007;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the value of N: &quot;</span>;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    uint64_t n = 0;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot;th Fibonacci number in modulo &quot;</span> &lt;&lt; mod &lt;&lt; <span class="stringliteral">&quot;: &quot;</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>              &lt;&lt; <a class="code hl_function" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f">fibo</a>(n, mod) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>}</div>
+</div>
+<div class="ttc" id="afibonacci__matrix__exponentiation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00091">fibonacci_matrix_exponentiation.cpp:91</a></div></div>
+<div class="ttc" id="afibonacci__matrix__exponentiation_8cpp_html_abc3bc08249058d57cfc8f54a29d9cf9f"><div class="ttname"><a href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f">fibo</a></div><div class="ttdeci">uint64_t fibo(uint64_t n, uint64_t mod)</div><div class="ttdef"><b>Definition</b> <a href="#l00025">fibonacci_matrix_exponentiation.cpp:25</a></div></div>
+<div class="ttc" id="afibonacci__matrix__exponentiation_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00108">fibonacci_matrix_exponentiation.cpp:108</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../da/dc9/fibonacci__matrix__exponentiation_8cpp.html">fibonacci_matrix_exponentiation.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/dd1/structquadratic__probing_1_1_entry.html b/da/dd1/structquadratic__probing_1_1_entry.html
index 4a459f70d..844c6d4ea 100644
--- a/da/dd1/structquadratic__probing_1_1_entry.html
+++ b/da/dd1/structquadratic__probing_1_1_entry.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: quadratic_probing::Entry Struct Reference</title>
+<title>TheAlgorithms/C++: quadratic_probing::Entry Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -114,22 +131,71 @@ $(function(){initNavTree('da/dd1/structquadratic__probing_1_1_entry.html','../..
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:a9df1118010a233d13ab3dd699bcb513e" id="r_a9df1118010a233d13ab3dd699bcb513e"><td class="memItemLeft" align="right" valign="top"><a id="a9df1118010a233d13ab3dd699bcb513e" name="a9df1118010a233d13ab3dd699bcb513e"></a>
-&#160;</td><td class="memItemRight" valign="bottom"><b>Entry</b> (int <a class="el" href="#a75f72858f08a2fc8b94402de98db12d8">key</a>=notPresent)</td></tr>
-<tr class="memdesc:a9df1118010a233d13ab3dd699bcb513e"><td class="mdescLeft">&#160;</td><td class="mdescRight">constructor <br /></td></tr>
+<tr class="memitem:a9df1118010a233d13ab3dd699bcb513e" id="r_a9df1118010a233d13ab3dd699bcb513e"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9df1118010a233d13ab3dd699bcb513e">Entry</a> (int <a class="el" href="#a75f72858f08a2fc8b94402de98db12d8">key</a>=notPresent)</td></tr>
+<tr class="memdesc:a9df1118010a233d13ab3dd699bcb513e"><td class="mdescLeft">&#160;</td><td class="mdescRight">constructor  <br /></td></tr>
 <tr class="separator:a9df1118010a233d13ab3dd699bcb513e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a75f72858f08a2fc8b94402de98db12d8" id="r_a75f72858f08a2fc8b94402de98db12d8"><td class="memItemLeft" align="right" valign="top"><a id="a75f72858f08a2fc8b94402de98db12d8" name="a75f72858f08a2fc8b94402de98db12d8"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>key</b></td></tr>
-<tr class="memdesc:a75f72858f08a2fc8b94402de98db12d8"><td class="mdescLeft">&#160;</td><td class="mdescRight">key value <br /></td></tr>
+<tr class="memitem:a75f72858f08a2fc8b94402de98db12d8" id="r_a75f72858f08a2fc8b94402de98db12d8"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a75f72858f08a2fc8b94402de98db12d8">key</a></td></tr>
+<tr class="memdesc:a75f72858f08a2fc8b94402de98db12d8"><td class="mdescLeft">&#160;</td><td class="mdescRight">key value  <br /></td></tr>
 <tr class="separator:a75f72858f08a2fc8b94402de98db12d8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a class="el" href="../../db/d8b/struct_node.html">Node</a> that holds key </p>
-</div><hr/>The documentation for this struct was generated from the following file:<ul>
-<li>hashing/<a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp.html">quadratic_probing_hash_table.cpp</a></li>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
+</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
+<a id="a9df1118010a233d13ab3dd699bcb513e" name="a9df1118010a233d13ab3dd699bcb513e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a9df1118010a233d13ab3dd699bcb513e">&#9670;&#160;</a></span>Entry()</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">quadratic_probing::Entry::Entry </td>
+          <td>(</td>
+          <td class="paramtype">int</td>          <td class="paramname"><span class="paramname"><em>key</em></span><span class="paramdefsep"> = </span><span class="paramdefval">notPresent</span></td><td>)</td>
+          <td></td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">explicit</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>constructor </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a75f72858f08a2fc8b94402de98db12d8" name="a75f72858f08a2fc8b94402de98db12d8"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a75f72858f08a2fc8b94402de98db12d8">&#9670;&#160;</a></span>key</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int quadratic_probing::Entry::key</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>key value </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<hr/>The documentation for this struct was generated from the following file:<ul>
+<li>hashing/<a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/da/dd3/classmachine__learning_1_1adaline__coll__graph.map b/da/dd3/classmachine__learning_1_1adaline__coll__graph.map
index ecfe1c5b2..7f9116bc5 100644
--- a/da/dd3/classmachine__learning_1_1adaline__coll__graph.map
+++ b/da/dd3/classmachine__learning_1_1adaline__coll__graph.map
@@ -1,5 +1,5 @@
 <map id="machine_learning::adaline" name="machine_learning::adaline">
 <area shape="rect" id="Node000001" title=" " alt="" coords="5,94,177,120"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="18,5,164,31"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="18,5,164,31"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="94,47,94,94,88,94,88,47"/>
 </map>
diff --git a/da/dd3/classmachine__learning_1_1adaline__coll__graph.md5 b/da/dd3/classmachine__learning_1_1adaline__coll__graph.md5
index 7adf979eb..defc46e9e 100644
--- a/da/dd3/classmachine__learning_1_1adaline__coll__graph.md5
+++ b/da/dd3/classmachine__learning_1_1adaline__coll__graph.md5
@@ -1 +1 @@
-bf28e6affa6d7d482f9836ce87321f78
\ No newline at end of file
+51c5feecf8fa742ba289f67074bdf6f5
\ No newline at end of file
diff --git a/da/dd3/classmachine__learning_1_1adaline__coll__graph.svg b/da/dd3/classmachine__learning_1_1adaline__coll__graph.svg
index b7600d3d6..7a94f723c 100644
--- a/da/dd3/classmachine__learning_1_1adaline__coll__graph.svg
+++ b/da/dd3/classmachine__learning_1_1adaline__coll__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="118.75,-85.75 9.75,-85.75 9.75,-66.5 118.75,-66.5 118.75,-85.75"/>
 <text text-anchor="middle" x="64.25" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; double &gt;</text>
 </a>
diff --git a/da/dd3/classmachine__learning_1_1adaline__coll__graph_org.svg b/da/dd3/classmachine__learning_1_1adaline__coll__graph_org.svg
index cf550a142..bcd5fd430 100644
--- a/da/dd3/classmachine__learning_1_1adaline__coll__graph_org.svg
+++ b/da/dd3/classmachine__learning_1_1adaline__coll__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="118.75,-85.75 9.75,-85.75 9.75,-66.5 118.75,-66.5 118.75,-85.75"/>
 <text text-anchor="middle" x="64.25" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; double &gt;</text>
 </a>
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html
index 186c30f05..41b8ac6e2 100644
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html
+++ b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: divide_and_conquer/karatsuba_algorithm_for_fast_multiplication.cpp File Reference</title>
+<title>TheAlgorithms/C++: divide_and_conquer/karatsuba_algorithm_for_fast_multiplication.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,11 +139,13 @@ Include dependency graph for karatsuba_algorithm_for_fast_multiplication.cpp:</d
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d2c/karatsuba__algorithm__for__fast__multiplication_8cpp__incl.svg" width="336" height="140"><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">
+</div>
+<p><a href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/dba/namespacedivide__and__conquer.html">divide_and_conquer</a></td></tr>
-<tr class="memdesc:dd/dba/namespacedivide__and__conquer"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
+<tr class="memdesc:dd/dba/namespacedivide__and__conquer"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::vector <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d41/namespacekaratsuba__algorithm.html">karatsuba_algorithm</a></td></tr>
 <tr class="memdesc:de/d41/namespacekaratsuba__algorithm"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the <a href="https://en.wikipedia.org/wiki/Karatsuba_algorithm" target="_blank">Karatsuba algorithm for fast multiplication</a> implementation. <br /></td></tr>
@@ -134,13 +153,13 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:ad76f5cac3ef8dc034f6abb99b64c2b20" id="r_ad76f5cac3ef8dc034f6abb99b64c2b20"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad76f5cac3ef8dc034f6abb99b64c2b20">divide_and_conquer::karatsuba_algorithm::add_strings</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> first, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> second)</td></tr>
+<tr class="memitem:ad76f5cac3ef8dc034f6abb99b64c2b20" id="r_ad76f5cac3ef8dc034f6abb99b64c2b20"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad76f5cac3ef8dc034f6abb99b64c2b20">divide_and_conquer::karatsuba_algorithm::add_strings</a> (std::string first, std::string second)</td></tr>
 <tr class="memdesc:ad76f5cac3ef8dc034f6abb99b64c2b20"><td class="mdescLeft">&#160;</td><td class="mdescRight">Binary addition.  <br /></td></tr>
 <tr class="separator:ad76f5cac3ef8dc034f6abb99b64c2b20"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aad9e3edfe156b59fc06a5585403fe0d6" id="r_aad9e3edfe156b59fc06a5585403fe0d6"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aad9e3edfe156b59fc06a5585403fe0d6">divide_and_conquer::karatsuba_algorithm::safe_substr</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, int64_t x1, int64_t x2, int64_t n)</td></tr>
+<tr class="memitem:aad9e3edfe156b59fc06a5585403fe0d6" id="r_aad9e3edfe156b59fc06a5585403fe0d6"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aad9e3edfe156b59fc06a5585403fe0d6">divide_and_conquer::karatsuba_algorithm::safe_substr</a> (const std::string &amp;str, int64_t x1, int64_t x2, int64_t n)</td></tr>
 <tr class="memdesc:aad9e3edfe156b59fc06a5585403fe0d6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Wrapper function for substr that considers leading zeros.  <br /></td></tr>
 <tr class="separator:aad9e3edfe156b59fc06a5585403fe0d6"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a7a890d2f26855ada3b9f1d43aec70a86" id="r_a7a890d2f26855ada3b9f1d43aec70a86"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7a890d2f26855ada3b9f1d43aec70a86">divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> str1, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> str2)</td></tr>
+<tr class="memitem:a7a890d2f26855ada3b9f1d43aec70a86" id="r_a7a890d2f26855ada3b9f1d43aec70a86"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7a890d2f26855ada3b9f1d43aec70a86">divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm</a> (std::string str1, std::string str2)</td></tr>
 <tr class="memdesc:a7a890d2f26855ada3b9f1d43aec70a86"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function implements Karatsuba's algorithm for fast multiplication.  <br /></td></tr>
 <tr class="separator:a7a890d2f26855ada3b9f1d43aec70a86"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -155,6 +174,8 @@ Functions</h2></td></tr>
 <p>Given two strings in binary notation we want to multiply them and return the value. Simple approach is to multiply bits one by one which will give the time complexity of around O(n^2). To make it more efficient we will be using Karatsuba algorithm to find the product which will solve the problem O(nlogn) of time. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Swastyy" target="_blank">Swastika Gupta</a> </dd>
 <dd>
 <a href="https://github.com/poypoyan" target="_blank">Ameer Carlo Lubang</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html">karatsuba_algorithm_for_fast_multiplication.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ad76f5cac3ef8dc034f6abb99b64c2b20" name="ad76f5cac3ef8dc034f6abb99b64c2b20"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ad76f5cac3ef8dc034f6abb99b64c2b20">&#9670;&#160;</a></span>add_strings()</h2>
@@ -163,14 +184,14 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> divide_and_conquer::karatsuba_algorithm::add_strings </td>
+          <td class="memname">std::string divide_and_conquer::karatsuba_algorithm::add_strings </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>first</em></span>, </td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>first</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>second</em></span>&#160;)</td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>second</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -184,13 +205,15 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the sum binary string </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html">karatsuba_algorithm_for_fast_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   37</span>                                                         {</div>
-<div class="line"><span class="lineno">   38</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  <span class="comment">// to store the resulting sum bits</span></div>
+<div class="line"><span class="lineno">   38</span>    std::string <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  <span class="comment">// to store the resulting sum bits</span></div>
 <div class="line"><span class="lineno">   39</span> </div>
 <div class="line"><span class="lineno">   40</span>    <span class="comment">// make the string lengths equal</span></div>
-<div class="line"><span class="lineno">   41</span>    int64_t len1 = first.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
-<div class="line"><span class="lineno">   42</span>    int64_t len2 = second.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
-<div class="line"><span class="lineno">   43</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> zero = <span class="stringliteral">&quot;0&quot;</span>;</div>
+<div class="line"><span class="lineno">   41</span>    int64_t len1 = first.size();</div>
+<div class="line"><span class="lineno">   42</span>    int64_t len2 = second.size();</div>
+<div class="line"><span class="lineno">   43</span>    std::string zero = <span class="stringliteral">&quot;0&quot;</span>;</div>
 <div class="line"><span class="lineno">   44</span>    <span class="keywordflow">if</span> (len1 &lt; len2) {</div>
 <div class="line"><span class="lineno">   45</span>        <span class="keywordflow">for</span> (int64_t i = 0; i &lt; len2 - len1; i++) {</div>
 <div class="line"><span class="lineno">   46</span>            zero += first;</div>
@@ -205,11 +228,11 @@ Functions</h2></td></tr>
 <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> </div>
-<div class="line"><span class="lineno">   58</span>    int64_t length = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(len1, len2);</div>
+<div class="line"><span class="lineno">   58</span>    int64_t length = std::max(len1, len2);</div>
 <div class="line"><span class="lineno">   59</span>    int64_t carry = 0;</div>
 <div class="line"><span class="lineno">   60</span>    <span class="keywordflow">for</span> (int64_t i = length - 1; i &gt;= 0; i--) {</div>
-<div class="line"><span class="lineno">   61</span>        int64_t firstBit = first.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/at.html">at</a>(i) - <span class="charliteral">&#39;0&#39;</span>;</div>
-<div class="line"><span class="lineno">   62</span>        int64_t secondBit = second.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/at.html">at</a>(i) - <span class="charliteral">&#39;0&#39;</span>;</div>
+<div class="line"><span class="lineno">   61</span>        int64_t firstBit = first.at(i) - <span class="charliteral">&#39;0&#39;</span>;</div>
+<div class="line"><span class="lineno">   62</span>        int64_t secondBit = second.at(i) - <span class="charliteral">&#39;0&#39;</span>;</div>
 <div class="line"><span class="lineno">   63</span> </div>
 <div class="line"><span class="lineno">   64</span>        int64_t <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> = (char(firstBit ^ secondBit ^ carry)) + <span class="charliteral">&#39;0&#39;</span>;  <span class="comment">// sum of 3 bits</span></div>
 <div class="line"><span class="lineno">   65</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.insert(<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.begin(), sum);</div>
@@ -223,18 +246,9 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   73</span>    }</div>
 <div class="line"><span class="lineno">   74</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   75</span>}</div>
-<div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/at.html">std::string::at</a></div><div class="ttdeci">T at(T... args)</div></div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:232</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ad76f5cac3ef8dc034f6abb99b64c2b20_cgraph.svg" width="316" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00232">vector_ops.hpp:232</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7a890d2f26855ada3b9f1d43aec70a86" name="a7a890d2f26855ada3b9f1d43aec70a86"></a>
@@ -246,12 +260,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">int64_t divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>str1</em></span>, </td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>str1</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>str2</em></span>&#160;)</td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>str2</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -265,10 +279,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the product number value </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html#l00112">112</a> of file <a class="el" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html">karatsuba_algorithm_for_fast_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  112</span>                                                            {</div>
-<div class="line"><span class="lineno">  113</span>    int64_t len1 = str1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
-<div class="line"><span class="lineno">  114</span>    int64_t len2 = str2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
-<div class="line"><span class="lineno">  115</span>    int64_t n = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(len1, len2);</div>
+<div class="line"><span class="lineno">  113</span>    int64_t len1 = str1.size();</div>
+<div class="line"><span class="lineno">  114</span>    int64_t len2 = str2.size();</div>
+<div class="line"><span class="lineno">  115</span>    int64_t n = std::max(len1, len2);</div>
 <div class="line"><span class="lineno">  116</span> </div>
 <div class="line"><span class="lineno">  117</span>    <span class="keywordflow">if</span> (n == 0) {</div>
 <div class="line"><span class="lineno">  118</span>        <span class="keywordflow">return</span> 0;</div>
@@ -280,11 +296,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  124</span>    int64_t fh = n / 2;     <span class="comment">// first half of string</span></div>
 <div class="line"><span class="lineno">  125</span>    int64_t sh = n - fh;  <span class="comment">// second half of string</span></div>
 <div class="line"><span class="lineno">  126</span> </div>
-<div class="line"><span class="lineno">  127</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> Xl = <a class="code hl_function" href="#aad9e3edfe156b59fc06a5585403fe0d6">divide_and_conquer::karatsuba_algorithm::safe_substr</a>(str1, 0, fh, n);   <span class="comment">// first half of first string</span></div>
-<div class="line"><span class="lineno">  128</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> Xr = <a class="code hl_function" href="#aad9e3edfe156b59fc06a5585403fe0d6">divide_and_conquer::karatsuba_algorithm::safe_substr</a>(str1, fh, sh, n);  <span class="comment">// second half of first string</span></div>
+<div class="line"><span class="lineno">  127</span>    std::string Xl = <a class="code hl_function" href="#aad9e3edfe156b59fc06a5585403fe0d6">divide_and_conquer::karatsuba_algorithm::safe_substr</a>(str1, 0, fh, n);   <span class="comment">// first half of first string</span></div>
+<div class="line"><span class="lineno">  128</span>    std::string Xr = <a class="code hl_function" href="#aad9e3edfe156b59fc06a5585403fe0d6">divide_and_conquer::karatsuba_algorithm::safe_substr</a>(str1, fh, sh, n);  <span class="comment">// second half of first string</span></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/string/basic_string.html">std::string</a> Yl = <a class="code hl_function" href="#aad9e3edfe156b59fc06a5585403fe0d6">divide_and_conquer::karatsuba_algorithm::safe_substr</a>(str2, 0, fh, n);   <span class="comment">// first half of second string</span></div>
-<div class="line"><span class="lineno">  131</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> Yr = <a class="code hl_function" href="#aad9e3edfe156b59fc06a5585403fe0d6">divide_and_conquer::karatsuba_algorithm::safe_substr</a>(str2, fh, sh, n);  <span class="comment">// second half of second string</span></div>
+<div class="line"><span class="lineno">  130</span>    std::string Yl = <a class="code hl_function" href="#aad9e3edfe156b59fc06a5585403fe0d6">divide_and_conquer::karatsuba_algorithm::safe_substr</a>(str2, 0, fh, n);   <span class="comment">// first half of second string</span></div>
+<div class="line"><span class="lineno">  131</span>    std::string Yr = <a class="code hl_function" href="#aad9e3edfe156b59fc06a5585403fe0d6">divide_and_conquer::karatsuba_algorithm::safe_substr</a>(str2, fh, sh, n);  <span class="comment">// second half of second string</span></div>
 <div class="line"><span class="lineno">  132</span> </div>
 <div class="line"><span class="lineno">  133</span>    <span class="comment">// calculating the three products of inputs of size n/2 recursively</span></div>
 <div class="line"><span class="lineno">  134</span>    int64_t product1 = <a class="code hl_namespace" href="../../de/d41/namespacekaratsuba__algorithm.html">karatsuba_algorithm</a>(Xl, Yl);</div>
@@ -297,14 +313,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  141</span>           (product3 - product1 - product2) * (1 &lt;&lt; sh) +</div>
 <div class="line"><span class="lineno">  142</span>           product2;  <span class="comment">// combining the three products to get the final result.</span></div>
 <div class="line"><span class="lineno">  143</span>}</div>
-<div class="ttc" id="akaratsuba__algorithm__for__fast__multiplication_8cpp_html_aad9e3edfe156b59fc06a5585403fe0d6"><div class="ttname"><a href="#aad9e3edfe156b59fc06a5585403fe0d6">divide_and_conquer::karatsuba_algorithm::safe_substr</a></div><div class="ttdeci">std::string safe_substr(const std::string &amp;str, int64_t x1, int64_t x2, int64_t n)</div><div class="ttdoc">Wrapper function for substr that considers leading zeros.</div><div class="ttdef"><b>Definition</b> karatsuba_algorithm_for_fast_multiplication.cpp:86</div></div>
+<div class="ttc" id="akaratsuba__algorithm__for__fast__multiplication_8cpp_html_aad9e3edfe156b59fc06a5585403fe0d6"><div class="ttname"><a href="#aad9e3edfe156b59fc06a5585403fe0d6">divide_and_conquer::karatsuba_algorithm::safe_substr</a></div><div class="ttdeci">std::string safe_substr(const std::string &amp;str, int64_t x1, int64_t x2, int64_t n)</div><div class="ttdoc">Wrapper function for substr that considers leading zeros.</div><div class="ttdef"><b>Definition</b> <a href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html#l00086">karatsuba_algorithm_for_fast_multiplication.cpp:86</a></div></div>
 <div class="ttc" id="anamespacekaratsuba__algorithm_html"><div class="ttname"><a href="../../de/d41/namespacekaratsuba__algorithm.html">karatsuba_algorithm</a></div><div class="ttdoc">Functions for the Karatsuba algorithm for fast multiplication implementation.</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_a7a890d2f26855ada3b9f1d43aec70a86_cgraph.svg" width="523" height="276"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -324,17 +335,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html#l00181">181</a> of file <a class="el" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html">karatsuba_algorithm_for_fast_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  181</span>           {</div>
 <div class="line"><span class="lineno">  182</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  183</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  184</span>}</div>
-<div class="ttc" id="akaratsuba__algorithm__for__fast__multiplication_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> karatsuba_algorithm_for_fast_multiplication.cpp:151</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="akaratsuba__algorithm__for__fast__multiplication_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html#l00151">karatsuba_algorithm_for_fast_multiplication.cpp:151</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aad9e3edfe156b59fc06a5585403fe0d6" name="aad9e3edfe156b59fc06a5585403fe0d6"></a>
@@ -344,9 +352,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> divide_and_conquer::karatsuba_algorithm::safe_substr </td>
+          <td class="memname">std::string divide_and_conquer::karatsuba_algorithm::safe_substr </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -379,11 +387,13 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>the "safe" substring for the algorithm <em>without</em> leading zeros </dd>
 <dd>
 "0" if substring spans to leading zeros only </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html#l00086">86</a> of file <a class="el" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html">karatsuba_algorithm_for_fast_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   86</span>                                                                               {</div>
-<div class="line"><span class="lineno">   87</span>    int64_t len = str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
+<div class="line"><span class="lineno">   87</span>    int64_t len = str.size();</div>
 <div class="line"><span class="lineno">   88</span> </div>
 <div class="line"><span class="lineno">   89</span>    <span class="keywordflow">if</span> (len &gt;= n) {</div>
-<div class="line"><span class="lineno">   90</span>        <span class="keywordflow">return</span> str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html">substr</a>(x1, x2);</div>
+<div class="line"><span class="lineno">   90</span>        <span class="keywordflow">return</span> str.substr(x1, x2);</div>
 <div class="line"><span class="lineno">   91</span>    }</div>
 <div class="line"><span class="lineno">   92</span> </div>
 <div class="line"><span class="lineno">   93</span>    int64_t y1 = x1 - (n - len);  <span class="comment">// index in str of first char of substring of &quot;whole&quot; string</span></div>
@@ -392,18 +402,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   96</span>    <span class="keywordflow">if</span> (y2 &lt; 0) {</div>
 <div class="line"><span class="lineno">   97</span>        <span class="keywordflow">return</span> <span class="stringliteral">&quot;0&quot;</span>;</div>
 <div class="line"><span class="lineno">   98</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (y1 &lt; 0) {</div>
-<div class="line"><span class="lineno">   99</span>        <span class="keywordflow">return</span> str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html">substr</a>(0, y2 + 1);</div>
+<div class="line"><span class="lineno">   99</span>        <span class="keywordflow">return</span> str.substr(0, y2 + 1);</div>
 <div class="line"><span class="lineno">  100</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  101</span>        <span class="keywordflow">return</span> str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html">substr</a>(y1, x2);</div>
+<div class="line"><span class="lineno">  101</span>        <span class="keywordflow">return</span> str.substr(y1, x2);</div>
 <div class="line"><span class="lineno">  102</span>    }</div>
 <div class="line"><span class="lineno">  103</span>}</div>
-<div class="ttc" id="asubstr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html">std::string::substr</a></div><div class="ttdeci">T substr(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aad9e3edfe156b59fc06a5585403fe0d6_cgraph.svg" width="328" height="100"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -431,39 +435,34 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html#l00151">151</a> of file <a class="el" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html">karatsuba_algorithm_for_fast_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  151</span>                   {</div>
 <div class="line"><span class="lineno">  152</span>    <span class="comment">// 1st test</span></div>
-<div class="line"><span class="lineno">  153</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s11 = <span class="stringliteral">&quot;1&quot;</span>;     <span class="comment">// 1</span></div>
-<div class="line"><span class="lineno">  154</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s12 = <span class="stringliteral">&quot;1010&quot;</span>;  <span class="comment">// 10</span></div>
-<div class="line"><span class="lineno">  155</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1st test... &quot;</span>;</div>
+<div class="line"><span class="lineno">  153</span>    std::string s11 = <span class="stringliteral">&quot;1&quot;</span>;     <span class="comment">// 1</span></div>
+<div class="line"><span class="lineno">  154</span>    std::string s12 = <span class="stringliteral">&quot;1010&quot;</span>;  <span class="comment">// 10</span></div>
+<div class="line"><span class="lineno">  155</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test... &quot;</span>;</div>
 <div class="line"><span class="lineno">  156</span>    assert(divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm(</div>
 <div class="line"><span class="lineno">  157</span>               s11, s12) == 10);</div>
-<div class="line"><span class="lineno">  158</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  158</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  159</span> </div>
 <div class="line"><span class="lineno">  160</span>    <span class="comment">// 2nd test</span></div>
-<div class="line"><span class="lineno">  161</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s21 = <span class="stringliteral">&quot;11&quot;</span>;    <span class="comment">// 3</span></div>
-<div class="line"><span class="lineno">  162</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s22 = <span class="stringliteral">&quot;1010&quot;</span>;  <span class="comment">// 10</span></div>
-<div class="line"><span class="lineno">  163</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2nd test... &quot;</span>;</div>
+<div class="line"><span class="lineno">  161</span>    std::string s21 = <span class="stringliteral">&quot;11&quot;</span>;    <span class="comment">// 3</span></div>
+<div class="line"><span class="lineno">  162</span>    std::string s22 = <span class="stringliteral">&quot;1010&quot;</span>;  <span class="comment">// 10</span></div>
+<div class="line"><span class="lineno">  163</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test... &quot;</span>;</div>
 <div class="line"><span class="lineno">  164</span>    assert(divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm(</div>
 <div class="line"><span class="lineno">  165</span>               s21, s22) == 30);</div>
-<div class="line"><span class="lineno">  166</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  166</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  167</span> </div>
 <div class="line"><span class="lineno">  168</span>    <span class="comment">// 3rd test</span></div>
-<div class="line"><span class="lineno">  169</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s31 = <span class="stringliteral">&quot;110&quot;</span>;   <span class="comment">// 6</span></div>
-<div class="line"><span class="lineno">  170</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s32 = <span class="stringliteral">&quot;1010&quot;</span>;  <span class="comment">// 10</span></div>
-<div class="line"><span class="lineno">  171</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;3rd test... &quot;</span>;</div>
+<div class="line"><span class="lineno">  169</span>    std::string s31 = <span class="stringliteral">&quot;110&quot;</span>;   <span class="comment">// 6</span></div>
+<div class="line"><span class="lineno">  170</span>    std::string s32 = <span class="stringliteral">&quot;1010&quot;</span>;  <span class="comment">// 10</span></div>
+<div class="line"><span class="lineno">  171</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test... &quot;</span>;</div>
 <div class="line"><span class="lineno">  172</span>    assert(divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm(</div>
 <div class="line"><span class="lineno">  173</span>               s31, s32) == 60);</div>
-<div class="line"><span class="lineno">  174</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  174</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  175</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="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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_a7a890d2f26855ada3b9f1d43aec70a86_cgraph.map b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_a7a890d2f26855ada3b9f1d43aec70a86_cgraph.map
deleted file mode 100644
index 18279119c..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_a7a890d2f26855ada3b9f1d43aec70a86_cgraph.map
+++ /dev/null
@@ -1,20 +0,0 @@
-<map id="divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm" name="divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm">
-<area shape="rect" id="Node000001" title="The main function implements Karatsuba&#39;s algorithm for fast multiplication." alt="" coords="5,94,152,150"/>
-<area shape="rect" id="Node000002" href="$da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ad76f5cac3ef8dc034f6abb99b64c2b20" title="Binary addition." alt="" coords="200,61,346,116"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="152,107,184,101,185,106,153,112"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="420,6,492,32"/>
-<area shape="poly" id="edge6_Node000001_Node000004" title=" " alt="" coords="102,92,144,53,170,36,199,22,252,8,307,3,360,4,405,8,404,14,359,9,308,9,253,14,201,27,173,40,148,58,106,96"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="400,141,511,167"/>
-<area shape="poly" id="edge11_Node000001_Node000005" title=" " alt="" coords="152,125,384,145,384,150,152,131"/>
-<area shape="rect" id="Node000006" href="$da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aad9e3edfe156b59fc06a5585403fe0d6" title="Wrapper function for substr that considers leading zeros." alt="" coords="200,215,346,271"/>
-<area shape="poly" id="edge7_Node000001_Node000006" title=" " alt="" coords="126,148,216,205,213,209,123,153"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="236,60,237,50,243,42,256,36,273,34,292,37,304,44,302,48,291,42,273,39,257,41,247,46,242,52,242,60"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/at.html#" title=" " alt="" coords="406,76,505,101"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="346,86,391,86,391,91,346,91"/>
-<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="345,58,405,35,407,40,347,63"/>
-<area shape="poly" id="edge5_Node000002_Node000005" title=" " alt="" coords="347,112,404,133,402,138,346,117"/>
-<area shape="poly" id="edge9_Node000006_Node000005" title=" " alt="" coords="330,212,413,171,415,176,332,217"/>
-<area shape="poly" id="edge8_Node000006_Node000006" title=" " alt="" coords="236,215,237,205,243,196,256,191,273,189,292,191,304,198,302,203,291,196,273,194,257,196,247,200,242,207,242,215"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/substr.html#" title=" " alt="" coords="394,230,517,256"/>
-<area shape="poly" id="edge10_Node000006_Node000007" title=" " alt="" coords="346,240,378,240,378,246,346,246"/>
-</map>
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_a7a890d2f26855ada3b9f1d43aec70a86_cgraph.md5 b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_a7a890d2f26855ada3b9f1d43aec70a86_cgraph.md5
deleted file mode 100644
index 43884c46c..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_a7a890d2f26855ada3b9f1d43aec70a86_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bced3e05197fe4dd73769f724c42a7e4
\ No newline at end of file
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_a7a890d2f26855ada3b9f1d43aec70a86_cgraph.svg b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_a7a890d2f26855ada3b9f1d43aec70a86_cgraph.svg
deleted file mode 100644
index 943dbda31..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_a7a890d2f26855ada3b9f1d43aec70a86_cgraph.svg
+++ /dev/null
@@ -1,206 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm Pages: 1 -->
-<svg width="392pt" height="207pt"
- viewBox="0.00 0.00 392.00 207.23" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 203.23)">
-<title>divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function implements Karatsuba&#39;s algorithm for fast multiplication.">
-<polygon fill="#999999" stroke="#666666" points="109.75,-132.75 0,-132.75 0,-91 109.75,-91 109.75,-132.75"/>
-<text text-anchor="start" x="8" y="-119.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-108" font-family="Helvetica,sans-Serif" font-size="10.00">::karatsuba_algorithm</text>
-<text text-anchor="middle" x="54.88" y="-96.75" font-family="Helvetica,sans-Serif" font-size="10.00">::karatsuba_algorithm</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ad76f5cac3ef8dc034f6abb99b64c2b20" target="_top" xlink:title="Binary addition.">
-<polygon fill="white" stroke="#666666" points="255.5,-157.75 145.75,-157.75 145.75,-116 255.5,-116 255.5,-157.75"/>
-<text text-anchor="start" x="153.75" y="-144.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="153.75" y="-133" font-family="Helvetica,sans-Serif" font-size="10.00">::karatsuba_algorithm</text>
-<text text-anchor="middle" x="200.62" y="-121.75" font-family="Helvetica,sans-Serif" font-size="10.00">::add_strings</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.22,-121.33C118.11,-122.7 126.3,-124.12 134.38,-125.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.74,-128.97 144.19,-127.23 134.94,-122.07 133.74,-128.97"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="364.88,-198.5 310.62,-198.5 310.62,-179.25 364.88,-179.25 364.88,-198.5"/>
-<text text-anchor="middle" x="337.75" y="-185" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge6_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge6_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.12,-133.02C90.76,-150.59 117.06,-174.35 145.75,-184.88 196.37,-203.44 259.72,-200.04 299.22,-195.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.5,-198.58 308.93,-193.76 298.55,-191.64 299.5,-198.58"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="379.5,-97.5 296,-97.5 296,-78.25 379.5,-78.25 379.5,-97.5"/>
-<text text-anchor="middle" x="337.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge11_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge11_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.03,-107.25C160.21,-102.96 234.38,-96.62 284.08,-92.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.36,-95.86 294.02,-91.53 283.76,-88.89 284.36,-95.86"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aad9e3edfe156b59fc06a5585403fe0d6" target="_top" xlink:title="Wrapper function for substr that considers leading zeros.">
-<polygon fill="white" stroke="#666666" points="255.5,-41.75 145.75,-41.75 145.75,0 255.5,0 255.5,-41.75"/>
-<text text-anchor="start" x="153.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="153.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::karatsuba_algorithm</text>
-<text text-anchor="middle" x="200.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::safe_substr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.58,-90.54C109.58,-77.88 135.15,-61.69 156.6,-48.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.28,-51.19 164.85,-42.89 154.53,-45.28 158.28,-51.19"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.32,-158.07C172.91,-167.55 181.34,-175.75 200.62,-175.75 211.77,-175.75 219.3,-173.01 223.19,-168.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.49,-170.09 225.56,-159.54 219.71,-168.37 226.49,-170.09"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="374.62,-146.5 300.88,-146.5 300.88,-127.25 374.62,-127.25 374.62,-146.5"/>
-<text text-anchor="middle" x="337.75" y="-133" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::at</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.81,-136.88C266.81,-136.88 278.3,-136.88 289.05,-136.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.86,-140.38 298.86,-136.88 288.86,-133.38 288.86,-140.38"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.81,-157.73C270.75,-163.48 286.61,-169.58 300.29,-174.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.74,-178 309.33,-178.32 301.25,-171.46 298.74,-178"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.81,-117.23C270.03,-112.07 285.08,-106.61 298.3,-101.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.27,-105.19 307.48,-98.49 296.89,-98.61 299.27,-105.19"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge9_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge9_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M244.38,-42.07C264.55,-52.07 288.14,-63.77 306.43,-72.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.65,-75.87 315.16,-77.17 307.76,-69.59 304.65,-75.87"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge8_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge8_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.32,-42.07C172.91,-51.55 181.34,-59.75 200.62,-59.75 211.77,-59.75 219.3,-57.01 223.19,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.49,-54.09 225.56,-43.54 219.71,-52.37 226.49,-54.09"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="384,-30.5 291.5,-30.5 291.5,-11.25 384,-11.25 384,-30.5"/>
-<text text-anchor="middle" x="337.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::substr</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge10_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge10_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.81,-20.88C263.7,-20.88 271.85,-20.88 279.79,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="279.72,-24.38 289.72,-20.88 279.72,-17.38 279.72,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_a7a890d2f26855ada3b9f1d43aec70a86_cgraph_org.svg b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_a7a890d2f26855ada3b9f1d43aec70a86_cgraph_org.svg
deleted file mode 100644
index 6689abe61..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_a7a890d2f26855ada3b9f1d43aec70a86_cgraph_org.svg
+++ /dev/null
@@ -1,180 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm Pages: 1 -->
-<svg width="392pt" height="207pt"
- viewBox="0.00 0.00 392.00 207.23" 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 203.23)">
-<title>divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function implements Karatsuba&#39;s algorithm for fast multiplication.">
-<polygon fill="#999999" stroke="#666666" points="109.75,-132.75 0,-132.75 0,-91 109.75,-91 109.75,-132.75"/>
-<text text-anchor="start" x="8" y="-119.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-108" font-family="Helvetica,sans-Serif" font-size="10.00">::karatsuba_algorithm</text>
-<text text-anchor="middle" x="54.88" y="-96.75" font-family="Helvetica,sans-Serif" font-size="10.00">::karatsuba_algorithm</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ad76f5cac3ef8dc034f6abb99b64c2b20" target="_top" xlink:title="Binary addition.">
-<polygon fill="white" stroke="#666666" points="255.5,-157.75 145.75,-157.75 145.75,-116 255.5,-116 255.5,-157.75"/>
-<text text-anchor="start" x="153.75" y="-144.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="153.75" y="-133" font-family="Helvetica,sans-Serif" font-size="10.00">::karatsuba_algorithm</text>
-<text text-anchor="middle" x="200.62" y="-121.75" font-family="Helvetica,sans-Serif" font-size="10.00">::add_strings</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.22,-121.33C118.11,-122.7 126.3,-124.12 134.38,-125.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.74,-128.97 144.19,-127.23 134.94,-122.07 133.74,-128.97"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="364.88,-198.5 310.62,-198.5 310.62,-179.25 364.88,-179.25 364.88,-198.5"/>
-<text text-anchor="middle" x="337.75" y="-185" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge6_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge6_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.12,-133.02C90.76,-150.59 117.06,-174.35 145.75,-184.88 196.37,-203.44 259.72,-200.04 299.22,-195.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.5,-198.58 308.93,-193.76 298.55,-191.64 299.5,-198.58"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="379.5,-97.5 296,-97.5 296,-78.25 379.5,-78.25 379.5,-97.5"/>
-<text text-anchor="middle" x="337.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge11_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge11_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.03,-107.25C160.21,-102.96 234.38,-96.62 284.08,-92.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.36,-95.86 294.02,-91.53 283.76,-88.89 284.36,-95.86"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aad9e3edfe156b59fc06a5585403fe0d6" target="_top" xlink:title="Wrapper function for substr that considers leading zeros.">
-<polygon fill="white" stroke="#666666" points="255.5,-41.75 145.75,-41.75 145.75,0 255.5,0 255.5,-41.75"/>
-<text text-anchor="start" x="153.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="153.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::karatsuba_algorithm</text>
-<text text-anchor="middle" x="200.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::safe_substr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.58,-90.54C109.58,-77.88 135.15,-61.69 156.6,-48.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.28,-51.19 164.85,-42.89 154.53,-45.28 158.28,-51.19"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.32,-158.07C172.91,-167.55 181.34,-175.75 200.62,-175.75 211.77,-175.75 219.3,-173.01 223.19,-168.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.49,-170.09 225.56,-159.54 219.71,-168.37 226.49,-170.09"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="374.62,-146.5 300.88,-146.5 300.88,-127.25 374.62,-127.25 374.62,-146.5"/>
-<text text-anchor="middle" x="337.75" y="-133" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::at</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.81,-136.88C266.81,-136.88 278.3,-136.88 289.05,-136.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.86,-140.38 298.86,-136.88 288.86,-133.38 288.86,-140.38"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.81,-157.73C270.75,-163.48 286.61,-169.58 300.29,-174.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.74,-178 309.33,-178.32 301.25,-171.46 298.74,-178"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.81,-117.23C270.03,-112.07 285.08,-106.61 298.3,-101.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.27,-105.19 307.48,-98.49 296.89,-98.61 299.27,-105.19"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge9_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge9_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M244.38,-42.07C264.55,-52.07 288.14,-63.77 306.43,-72.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.65,-75.87 315.16,-77.17 307.76,-69.59 304.65,-75.87"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge8_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge8_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.32,-42.07C172.91,-51.55 181.34,-59.75 200.62,-59.75 211.77,-59.75 219.3,-57.01 223.19,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.49,-54.09 225.56,-43.54 219.71,-52.37 226.49,-54.09"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="384,-30.5 291.5,-30.5 291.5,-11.25 384,-11.25 384,-30.5"/>
-<text text-anchor="middle" x="337.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::substr</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge10_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge10_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.81,-20.88C263.7,-20.88 271.85,-20.88 279.79,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="279.72,-24.38 289.72,-20.88 279.72,-17.38 279.72,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index e85e01374..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 5901bc148..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-729fb887ee50b6291b0542ba0592a5c7
\ No newline at end of file
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 2e04695b9..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1813bd719..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aad9e3edfe156b59fc06a5585403fe0d6_cgraph.map b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aad9e3edfe156b59fc06a5585403fe0d6_cgraph.map
deleted file mode 100644
index f0a7bb232..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aad9e3edfe156b59fc06a5585403fe0d6_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="divide_and_conquer::karatsuba_algorithm::safe_substr" name="divide_and_conquer::karatsuba_algorithm::safe_substr">
-<area shape="rect" id="Node000001" title="Wrapper function for substr that considers leading zeros." alt="" coords="5,29,152,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="42,29,43,19,49,10,61,5,79,3,98,5,110,12,107,17,96,10,78,8,63,10,52,14,48,21,47,29"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="206,19,317,45"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="152,44,190,39,191,44,152,50"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/substr.html#" title=" " alt="" coords="200,68,323,94"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="152,64,185,68,184,74,152,69"/>
-</map>
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aad9e3edfe156b59fc06a5585403fe0d6_cgraph.md5 b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aad9e3edfe156b59fc06a5585403fe0d6_cgraph.md5
deleted file mode 100644
index 6f3ab137a..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aad9e3edfe156b59fc06a5585403fe0d6_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-48242cc278b84067e30ad8d69ae80b5e
\ No newline at end of file
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aad9e3edfe156b59fc06a5585403fe0d6_cgraph.svg b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aad9e3edfe156b59fc06a5585403fe0d6_cgraph.svg
deleted file mode 100644
index 4c303732d..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aad9e3edfe156b59fc06a5585403fe0d6_cgraph.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::karatsuba_algorithm::safe_substr Pages: 1 -->
-<svg width="246pt" height="75pt"
- viewBox="0.00 0.00 246.25 74.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 70.5)">
-<title>divide_and_conquer::karatsuba_algorithm::safe_substr</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Wrapper function for substr that considers leading zeros.">
-<polygon fill="#999999" stroke="#666666" points="109.75,-48.5 0,-48.5 0,-6.75 109.75,-6.75 109.75,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">::karatsuba_algorithm</text>
-<text text-anchor="middle" x="54.88" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::safe_substr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.57,-48.82C27.16,-58.3 35.59,-66.5 54.88,-66.5 66.02,-66.5 73.55,-63.76 77.44,-59.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.74,-60.84 79.81,-50.29 73.96,-59.12 80.74,-60.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.75,-56.25 150.25,-56.25 150.25,-37 233.75,-37 233.75,-56.25"/>
-<text text-anchor="middle" x="192" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.06,-35.24C119.56,-36.58 129.43,-37.97 138.87,-39.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.23,-42.74 148.62,-40.67 139.21,-35.81 138.23,-42.74"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.25,-19.25 145.75,-19.25 145.75,0 238.25,0 238.25,-19.25"/>
-<text text-anchor="middle" x="192" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::substr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.06,-20.41C118.04,-19.34 126.29,-18.25 134.32,-17.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.54,-20.68 143.99,-15.89 133.61,-13.74 134.54,-20.68"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aad9e3edfe156b59fc06a5585403fe0d6_cgraph_org.svg b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aad9e3edfe156b59fc06a5585403fe0d6_cgraph_org.svg
deleted file mode 100644
index c08304349..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_aad9e3edfe156b59fc06a5585403fe0d6_cgraph_org.svg
+++ /dev/null
@@ -1,68 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::karatsuba_algorithm::safe_substr Pages: 1 -->
-<svg width="246pt" height="75pt"
- viewBox="0.00 0.00 246.25 74.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 70.5)">
-<title>divide_and_conquer::karatsuba_algorithm::safe_substr</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Wrapper function for substr that considers leading zeros.">
-<polygon fill="#999999" stroke="#666666" points="109.75,-48.5 0,-48.5 0,-6.75 109.75,-6.75 109.75,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">::karatsuba_algorithm</text>
-<text text-anchor="middle" x="54.88" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::safe_substr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.57,-48.82C27.16,-58.3 35.59,-66.5 54.88,-66.5 66.02,-66.5 73.55,-63.76 77.44,-59.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.74,-60.84 79.81,-50.29 73.96,-59.12 80.74,-60.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.75,-56.25 150.25,-56.25 150.25,-37 233.75,-37 233.75,-56.25"/>
-<text text-anchor="middle" x="192" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.06,-35.24C119.56,-36.58 129.43,-37.97 138.87,-39.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.23,-42.74 148.62,-40.67 139.21,-35.81 138.23,-42.74"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.25,-19.25 145.75,-19.25 145.75,0 238.25,0 238.25,-19.25"/>
-<text text-anchor="middle" x="192" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::substr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.06,-20.41C118.04,-19.34 126.29,-18.25 134.32,-17.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.54,-20.68 143.99,-15.89 133.61,-13.74 134.54,-20.68"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ad76f5cac3ef8dc034f6abb99b64c2b20_cgraph.map b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ad76f5cac3ef8dc034f6abb99b64c2b20_cgraph.map
deleted file mode 100644
index beff60c2d..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ad76f5cac3ef8dc034f6abb99b64c2b20_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="divide_and_conquer::karatsuba_algorithm::add_strings" name="divide_and_conquer::karatsuba_algorithm::add_strings">
-<area shape="rect" id="Node000001" title="Binary addition." alt="" coords="5,40,152,95"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="43,39,44,29,50,21,62,15,79,13,97,16,109,23,106,27,96,21,78,18,63,20,53,25,49,31,49,39"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/at.html#" title=" " alt="" coords="206,5,304,31"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="151,44,191,33,193,38,153,50"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="219,55,292,80"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="152,65,203,65,203,70,152,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="200,104,311,130"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="153,85,193,97,191,102,151,91"/>
-</map>
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ad76f5cac3ef8dc034f6abb99b64c2b20_cgraph.md5 b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ad76f5cac3ef8dc034f6abb99b64c2b20_cgraph.md5
deleted file mode 100644
index 7ebbead74..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ad76f5cac3ef8dc034f6abb99b64c2b20_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-61f8de8d022fa5bb94f1c73fff53e984
\ No newline at end of file
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ad76f5cac3ef8dc034f6abb99b64c2b20_cgraph.svg b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ad76f5cac3ef8dc034f6abb99b64c2b20_cgraph.svg
deleted file mode 100644
index de98ffaf4..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ad76f5cac3ef8dc034f6abb99b64c2b20_cgraph.svg
+++ /dev/null
@@ -1,112 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::karatsuba_algorithm::add_strings Pages: 1 -->
-<svg width="237pt" height="101pt"
- viewBox="0.00 0.00 237.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>divide_and_conquer::karatsuba_algorithm::add_strings</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Binary addition.">
-<polygon fill="#999999" stroke="#666666" points="109.75,-67.5 0,-67.5 0,-25.75 109.75,-25.75 109.75,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">::karatsuba_algorithm</text>
-<text text-anchor="middle" x="54.88" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::add_strings</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.4,-67.82C28.07,-77.3 36.22,-85.5 54.88,-85.5 65.66,-85.5 72.93,-82.76 76.7,-78.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.01,-79.83 78.99,-69.29 73.21,-78.17 80.01,-79.83"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224.38,-93.25 150.62,-93.25 150.62,-74 224.38,-74 224.38,-93.25"/>
-<text text-anchor="middle" x="187.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::at</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.14,-61.99C120.01,-64.79 130.23,-67.69 139.86,-70.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.81,-73.75 149.38,-73.11 140.72,-67.02 138.81,-73.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.62,-56.25 160.38,-56.25 160.38,-37 214.62,-37 214.62,-56.25"/>
-<text text-anchor="middle" x="187.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.14,-46.62C123.07,-46.62 136.6,-46.62 148.61,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.53,-50.13 158.53,-46.63 148.53,-43.13 148.53,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="229.25,-19.25 145.75,-19.25 145.75,0 229.25,0 229.25,-19.25"/>
-<text text-anchor="middle" x="187.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.14,-31.26C120.01,-28.46 130.23,-25.56 139.86,-22.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.72,-26.23 149.38,-20.14 138.81,-19.5 140.72,-26.23"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ad76f5cac3ef8dc034f6abb99b64c2b20_cgraph_org.svg b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ad76f5cac3ef8dc034f6abb99b64c2b20_cgraph_org.svg
deleted file mode 100644
index b8638ca46..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ad76f5cac3ef8dc034f6abb99b64c2b20_cgraph_org.svg
+++ /dev/null
@@ -1,86 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::karatsuba_algorithm::add_strings Pages: 1 -->
-<svg width="237pt" height="101pt"
- viewBox="0.00 0.00 237.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>divide_and_conquer::karatsuba_algorithm::add_strings</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Binary addition.">
-<polygon fill="#999999" stroke="#666666" points="109.75,-67.5 0,-67.5 0,-25.75 109.75,-25.75 109.75,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">::karatsuba_algorithm</text>
-<text text-anchor="middle" x="54.88" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::add_strings</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.4,-67.82C28.07,-77.3 36.22,-85.5 54.88,-85.5 65.66,-85.5 72.93,-82.76 76.7,-78.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.01,-79.83 78.99,-69.29 73.21,-78.17 80.01,-79.83"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224.38,-93.25 150.62,-93.25 150.62,-74 224.38,-74 224.38,-93.25"/>
-<text text-anchor="middle" x="187.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::at</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.14,-61.99C120.01,-64.79 130.23,-67.69 139.86,-70.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.81,-73.75 149.38,-73.11 140.72,-67.02 138.81,-73.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.62,-56.25 160.38,-56.25 160.38,-37 214.62,-37 214.62,-56.25"/>
-<text text-anchor="middle" x="187.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.14,-46.62C123.07,-46.62 136.6,-46.62 148.61,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.53,-50.13 158.53,-46.63 148.53,-43.13 148.53,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="229.25,-19.25 145.75,-19.25 145.75,0 229.25,0 229.25,-19.25"/>
-<text text-anchor="middle" x="187.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.14,-31.26C120.01,-28.46 130.23,-25.56 139.86,-22.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.72,-26.23 149.38,-20.14 138.81,-19.5 140.72,-26.23"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index add648d10..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 0d0215923..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2ca630194e4c5928111e41d3b7c2c2d9
\ No newline at end of file
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 2b031f97c..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 9f9799b8e..000000000
--- a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html
new file mode 100644
index 000000000..47cbe7562
--- /dev/null
+++ b/da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html
@@ -0,0 +1,285 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: divide_and_conquer/karatsuba_algorithm_for_fast_multiplication.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">karatsuba_algorithm_for_fast_multiplication.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cstring&gt;</span>   </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/dba/namespacedivide__and__conquer.html">divide_and_conquer</a> {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../de/d41/namespacekaratsuba__algorithm.html">karatsuba_algorithm</a> {</div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="}">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ad76f5cac3ef8dc034f6abb99b64c2b20">   37</a></span>std::string <a class="code hl_function" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ad76f5cac3ef8dc034f6abb99b64c2b20">add_strings</a>(std::string first, std::string second) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    std::string result;  <span class="comment">// to store the resulting sum bits</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="comment">// make the string lengths equal</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    int64_t len1 = first.size();</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    int64_t len2 = second.size();</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    std::string zero = <span class="stringliteral">&quot;0&quot;</span>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">if</span> (len1 &lt; len2) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="keywordflow">for</span> (int64_t i = 0; i &lt; len2 - len1; i++) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            zero += first;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            first = zero;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            zero = <span class="stringliteral">&quot;0&quot;</span>; <span class="comment">// Prevents CI from failing</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (len1 &gt; len2) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        <span class="keywordflow">for</span> (int64_t i = 0; i &lt; len1 - len2; i++) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            zero += second;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            second = zero;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            zero = <span class="stringliteral">&quot;0&quot;</span>; <span class="comment">// Prevents CI from failing</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    int64_t length = std::max(len1, len2);</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    int64_t carry = 0;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">for</span> (int64_t i = length - 1; i &gt;= 0; i--) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        int64_t firstBit = first.at(i) - <span class="charliteral">&#39;0&#39;</span>;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        int64_t secondBit = second.at(i) - <span class="charliteral">&#39;0&#39;</span>;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        int64_t sum = (char(firstBit ^ secondBit ^ carry)) + <span class="charliteral">&#39;0&#39;</span>;  <span class="comment">// sum of 3 bits</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        result.insert(result.begin(), sum);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        carry = char((firstBit &amp; secondBit) | (secondBit &amp; carry) |</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                (firstBit &amp; carry));  <span class="comment">// sum of 3 bits</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordflow">if</span> (carry) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        result.insert(result.begin(), <span class="charliteral">&#39;1&#39;</span>);  <span class="comment">// adding 1 incase of overflow</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    }</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>}</div>
+</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="foldopen" id="foldopen00086" data-start="{" data-end="}">
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aad9e3edfe156b59fc06a5585403fe0d6">   86</a></span>std::string <a class="code hl_function" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aad9e3edfe156b59fc06a5585403fe0d6">safe_substr</a>(<span class="keyword">const</span> std::string &amp;str, int64_t x1, int64_t x2, int64_t n) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    int64_t len = str.size();</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keywordflow">if</span> (len &gt;= n) {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        <span class="keywordflow">return</span> str.substr(x1, x2);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    }</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    int64_t y1 = x1 - (n - len);  <span class="comment">// index in str of first char of substring of &quot;whole&quot; string</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    int64_t y2 = (x1 + x2 - 1) - (n - len);  <span class="comment">// index in str of last char of substring of &quot;whole&quot; string</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="keywordflow">if</span> (y2 &lt; 0) {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        <span class="keywordflow">return</span> <span class="stringliteral">&quot;0&quot;</span>;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (y1 &lt; 0) {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        <span class="keywordflow">return</span> str.substr(0, y2 + 1);</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        <span class="keywordflow">return</span> str.substr(y1, x2);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    }</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>}</div>
+</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="foldopen" id="foldopen00112" data-start="{" data-end="}">
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"><a class="line" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#a7a890d2f26855ada3b9f1d43aec70a86">  112</a></span>int64_t <a class="code hl_namespace" href="../../de/d41/namespacekaratsuba__algorithm.html">karatsuba_algorithm</a>(std::string str1, std::string str2) {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    int64_t len1 = str1.size();</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    int64_t len2 = str2.size();</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    int64_t n = std::max(len1, len2);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="keywordflow">if</span> (n == 0) {</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    }</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <span class="keywordflow">if</span> (n == 1) {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        <span class="keywordflow">return</span> (str1[0] - <span class="charliteral">&#39;0&#39;</span>) * (str2[0] - <span class="charliteral">&#39;0&#39;</span>);</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    }</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    int64_t fh = n / 2;     <span class="comment">// first half of string</span></div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    int64_t sh = n - fh;  <span class="comment">// second half of string</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    std::string Xl = <a class="code hl_function" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aad9e3edfe156b59fc06a5585403fe0d6">divide_and_conquer::karatsuba_algorithm::safe_substr</a>(str1, 0, fh, n);   <span class="comment">// first half of first string</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    std::string Xr = <a class="code hl_function" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aad9e3edfe156b59fc06a5585403fe0d6">divide_and_conquer::karatsuba_algorithm::safe_substr</a>(str1, fh, sh, n);  <span class="comment">// second half of first string</span></div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    std::string Yl = <a class="code hl_function" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aad9e3edfe156b59fc06a5585403fe0d6">divide_and_conquer::karatsuba_algorithm::safe_substr</a>(str2, 0, fh, n);   <span class="comment">// first half of second string</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    std::string Yr = <a class="code hl_function" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aad9e3edfe156b59fc06a5585403fe0d6">divide_and_conquer::karatsuba_algorithm::safe_substr</a>(str2, fh, sh, n);  <span class="comment">// second half of second string</span></div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <span class="comment">// calculating the three products of inputs of size n/2 recursively</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    int64_t product1 = <a class="code hl_namespace" href="../../de/d41/namespacekaratsuba__algorithm.html">karatsuba_algorithm</a>(Xl, Yl);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    int64_t product2 = <a class="code hl_namespace" href="../../de/d41/namespacekaratsuba__algorithm.html">karatsuba_algorithm</a>(Xr, Yr);</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    int64_t product3 = <a class="code hl_namespace" href="../../de/d41/namespacekaratsuba__algorithm.html">karatsuba_algorithm</a>(</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        <a class="code hl_function" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ad76f5cac3ef8dc034f6abb99b64c2b20">divide_and_conquer::karatsuba_algorithm::add_strings</a>(Xl, Xr),</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>        <a class="code hl_function" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ad76f5cac3ef8dc034f6abb99b64c2b20">divide_and_conquer::karatsuba_algorithm::add_strings</a>(Yl, Yr));</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span> </div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="keywordflow">return</span> product1 * (1 &lt;&lt; (2 * sh)) +</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>           (product3 - product1 - product2) * (1 &lt;&lt; sh) +</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>           product2;  <span class="comment">// combining the three products to get the final result.</span></div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>}</div>
+</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>}  <span class="comment">// namespace karatsuba_algorithm</span></div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>}  <span class="comment">// namespace divide_and_conquer</span></div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span> </div>
+<div class="foldopen" id="foldopen00151" data-start="{" data-end="}">
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"><a class="line" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  151</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    <span class="comment">// 1st test</span></div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    std::string s11 = <span class="stringliteral">&quot;1&quot;</span>;     <span class="comment">// 1</span></div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    std::string s12 = <span class="stringliteral">&quot;1010&quot;</span>;  <span class="comment">// 10</span></div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test... &quot;</span>;</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    assert(divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm(</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>               s11, s12) == 10);</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span> </div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    <span class="comment">// 2nd test</span></div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    std::string s21 = <span class="stringliteral">&quot;11&quot;</span>;    <span class="comment">// 3</span></div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    std::string s22 = <span class="stringliteral">&quot;1010&quot;</span>;  <span class="comment">// 10</span></div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test... &quot;</span>;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    assert(divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm(</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>               s21, s22) == 30);</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span> </div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    <span class="comment">// 3rd test</span></div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    std::string s31 = <span class="stringliteral">&quot;110&quot;</span>;   <span class="comment">// 6</span></div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    std::string s32 = <span class="stringliteral">&quot;1010&quot;</span>;  <span class="comment">// 10</span></div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test... &quot;</span>;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    assert(divide_and_conquer::karatsuba_algorithm::karatsuba_algorithm(</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>               s31, s32) == 60);</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>}</div>
+</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
+<div class="foldopen" id="foldopen00181" data-start="{" data-end="}">
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"><a class="line" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  181</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    <a class="code hl_function" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>}</div>
+</div>
+<div class="ttc" id="akaratsuba__algorithm__for__fast__multiplication_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_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> <a href="#l00151">karatsuba_algorithm_for_fast_multiplication.cpp:151</a></div></div>
+<div class="ttc" id="akaratsuba__algorithm__for__fast__multiplication_8cpp_html_aad9e3edfe156b59fc06a5585403fe0d6"><div class="ttname"><a href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aad9e3edfe156b59fc06a5585403fe0d6">divide_and_conquer::karatsuba_algorithm::safe_substr</a></div><div class="ttdeci">std::string safe_substr(const std::string &amp;str, int64_t x1, int64_t x2, int64_t n)</div><div class="ttdoc">Wrapper function for substr that considers leading zeros.</div><div class="ttdef"><b>Definition</b> <a href="#l00086">karatsuba_algorithm_for_fast_multiplication.cpp:86</a></div></div>
+<div class="ttc" id="akaratsuba__algorithm__for__fast__multiplication_8cpp_html_ad76f5cac3ef8dc034f6abb99b64c2b20"><div class="ttname"><a href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ad76f5cac3ef8dc034f6abb99b64c2b20">divide_and_conquer::karatsuba_algorithm::add_strings</a></div><div class="ttdeci">std::string add_strings(std::string first, std::string second)</div><div class="ttdoc">Binary addition.</div><div class="ttdef"><b>Definition</b> <a href="#l00037">karatsuba_algorithm_for_fast_multiplication.cpp:37</a></div></div>
+<div class="ttc" id="akaratsuba__algorithm__for__fast__multiplication_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00181">karatsuba_algorithm_for_fast_multiplication.cpp:181</a></div></div>
+<div class="ttc" id="anamespacedivide__and__conquer_html"><div class="ttname"><a href="../../dd/dba/namespacedivide__and__conquer.html">divide_and_conquer</a></div><div class="ttdoc">for std::vector</div></div>
+<div class="ttc" id="anamespacekaratsuba__algorithm_html"><div class="ttname"><a href="../../de/d41/namespacekaratsuba__algorithm.html">karatsuba_algorithm</a></div><div class="ttdoc">Functions for the Karatsuba algorithm for fast multiplication implementation.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_93bc990c5cceb745f78af6949e9ef947.html">divide_and_conquer</a></li><li class="navelem"><a class="el" href="../../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html">karatsuba_algorithm_for_fast_multiplication.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/dd3/namespacespirograph.html b/da/dd3/namespacespirograph.html
index a13f69456..259faddc6 100644
--- a/da/dd3/namespacespirograph.html
+++ b/da/dd3/namespacespirograph.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: spirograph Namespace Reference</title>
+<title>TheAlgorithms/C++: spirograph Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -112,8 +129,8 @@ $(function(){initNavTree('da/dd3/namespacespirograph.html','../../'); initResiza
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:aeca22dbe4563358960e907a40cd3e1ac" id="r_aeca22dbe4563358960e907a40cd3e1ac"><td class="memTemplParams" colspan="2">template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> N&gt; </td></tr>
-<tr class="memitem:aeca22dbe4563358960e907a40cd3e1ac"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aeca22dbe4563358960e907a40cd3e1ac">spirograph</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; double, double &gt;, N &gt; *points, double l, double k, double rot)</td></tr>
+<tr class="memitem:aeca22dbe4563358960e907a40cd3e1ac" id="r_aeca22dbe4563358960e907a40cd3e1ac"><td class="memTemplParams" colspan="2">template&lt;std::size_t N&gt; </td></tr>
+<tr class="memitem:aeca22dbe4563358960e907a40cd3e1ac"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aeca22dbe4563358960e907a40cd3e1ac">spirograph</a> (std::array&lt; std::pair&lt; double, double &gt;, N &gt; *points, double l, double k, double rot)</td></tr>
 <tr class="separator:aeca22dbe4563358960e907a40cd3e1ac"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a8e83a64e8443fff1e5ffdc1c299c1e99" id="r_a8e83a64e8443fff1e5ffdc1c299c1e99"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8e83a64e8443fff1e5ffdc1c299c1e99">test</a> ()</td></tr>
 <tr class="memdesc:a8e83a64e8443fff1e5ffdc1c299c1e99"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test function to save resulting points to a CSV file.  <br /></td></tr>
@@ -128,12 +145,12 @@ Functions</h2></td></tr>
 <div class="memitem">
 <div class="memproto">
 <div class="memtemplate">
-template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> N&gt; </div>
+template&lt;std::size_t N&gt; </div>
       <table class="memname">
         <tr>
           <td class="memname">void spirograph::spirograph </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; double, double &gt;, N &gt; *</td>          <td class="paramname"><span class="paramname"><em>points</em></span>, </td>
+          <td class="paramtype">std::array&lt; std::pair&lt; double, double &gt;, N &gt; *</td>          <td class="paramname"><span class="paramname"><em>points</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -177,13 +194,15 @@ y &amp;=&amp; R\left[ (1-k) \sin (t) - l\cdot k\cdot\sin \left(\frac{1-k}{k}t\ri
 </dl>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramdir">[out]</td><td class="paramname">points</td><td>Array of 2D points represented as <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a> </td></tr>
+    <tr><td class="paramdir">[out]</td><td class="paramname">points</td><td>Array of 2D points represented as std::pair </td></tr>
     <tr><td class="paramdir"></td><td class="paramname">l</td><td>the relative distance of marker from the centre of inner circle and \(0\le l\le1\) </td></tr>
     <tr><td class="paramdir"></td><td class="paramname">k</td><td>the ratio of radius of inner circle to outer circle and \(0&lt;k&lt;1\) </td></tr>
     <tr><td class="paramdir"></td><td class="paramname">rot</td><td>the number of rotations to perform (can be fractional value) </td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d77/spirograph_8cpp_source.html#l00070">70</a> of file <a class="el" href="../../da/d77/spirograph_8cpp_source.html">spirograph.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   71</span>                                      {</div>
 <div class="line"><span class="lineno">   72</span>    <span class="keywordtype">double</span> dt = rot * 2.f * M_PI / N;</div>
 <div class="line"><span class="lineno">   73</span>    <span class="keywordtype">double</span> R = 1.f;</div>
@@ -195,20 +214,13 @@ y &amp;=&amp; R\left[ (1-k) \sin (t) - l\cdot k\cdot\sin \left(\frac{1-k}{k}t\ri
 <div class="line"><span class="lineno">   79</span><span class="preprocessor">#endif</span></div>
 <div class="line"><span class="lineno">   80</span>    <span class="keywordflow">for</span> (step = 0; step &lt; N; step++) {</div>
 <div class="line"><span class="lineno">   81</span>        <span class="keywordtype">double</span> t = dt * step;</div>
-<div class="line"><span class="lineno">   82</span>        <span class="keywordtype">double</span> first = R * (k1 * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a>(t) + l * k * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a>(k1 * t / k));</div>
-<div class="line"><span class="lineno">   83</span>        <span class="keywordtype">double</span> second = R * (k1 * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a>(t) - l * k * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a>(k1 * t / k));</div>
+<div class="line"><span class="lineno">   82</span>        <span class="keywordtype">double</span> first = R * (k1 * std::cos(t) + l * k * std::cos(k1 * t / k));</div>
+<div class="line"><span class="lineno">   83</span>        <span class="keywordtype">double</span> second = R * (k1 * std::sin(t) - l * k * std::sin(k1 * t / k));</div>
 <div class="line"><span class="lineno">   84</span>        points[0][step].first = first;</div>
 <div class="line"><span class="lineno">   85</span>        points[0][step].second = second;</div>
 <div class="line"><span class="lineno">   86</span>    }</div>
 <div class="line"><span class="lineno">   87</span>}</div>
-<div class="ttc" id="acos_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a></div><div class="ttdeci">T cos(T... args)</div></div>
-<div class="ttc" id="asin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a></div><div class="ttdeci">T sin(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dd3/namespacespirograph_aeca22dbe4563358960e907a40cd3e1ac_cgraph.svg" width="276" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a8e83a64e8443fff1e5ffdc1c299c1e99" name="a8e83a64e8443fff1e5ffdc1c299c1e99"></a>
@@ -227,19 +239,21 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>Test function to save resulting points to a CSV file. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d77/spirograph_8cpp_source.html#l00093">93</a> of file <a class="el" href="../../da/d77/spirograph_8cpp_source.html">spirograph.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   93</span>            {</div>
 <div class="line"><span class="lineno">   94</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> N = 500;</div>
 <div class="line"><span class="lineno">   95</span>    <span class="keywordtype">double</span> l = 0.3, k = 0.75, rot = 10.;</div>
-<div class="line"><span class="lineno">   96</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">std::stringstream</a> fname;</div>
-<div class="line"><span class="lineno">   97</span>    fname &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(3) &lt;&lt; <span class="stringliteral">&quot;spirograph_&quot;</span> &lt;&lt; l &lt;&lt; <span class="stringliteral">&quot;_&quot;</span> &lt;&lt; k &lt;&lt; <span class="stringliteral">&quot;_&quot;</span> &lt;&lt; rot</div>
+<div class="line"><span class="lineno">   96</span>    std::stringstream fname;</div>
+<div class="line"><span class="lineno">   97</span>    fname &lt;&lt; std::setw(3) &lt;&lt; <span class="stringliteral">&quot;spirograph_&quot;</span> &lt;&lt; l &lt;&lt; <span class="stringliteral">&quot;_&quot;</span> &lt;&lt; k &lt;&lt; <span class="stringliteral">&quot;_&quot;</span> &lt;&lt; rot</div>
 <div class="line"><span class="lineno">   98</span>          &lt;&lt; <span class="stringliteral">&quot;.csv&quot;</span>;</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_ofstream.html">std::ofstream</a> fp(fname.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html">str</a>());</div>
+<div class="line"><span class="lineno">   99</span>    std::ofstream fp(fname.str());</div>
 <div class="line"><span class="lineno">  100</span>    <span class="keywordflow">if</span> (!fp.is_open()) {</div>
-<div class="line"><span class="lineno">  101</span>        perror(fname.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html">str</a>().c_str());</div>
+<div class="line"><span class="lineno">  101</span>        perror(fname.str().c_str());</div>
 <div class="line"><span class="lineno">  102</span>        exit(EXIT_FAILURE);</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>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::pair&lt;double, double&gt;</a>, N&gt; points;</div>
+<div class="line"><span class="lineno">  105</span>    std::array&lt;std::pair&lt;double, double&gt;, N&gt; points;</div>
 <div class="line"><span class="lineno">  106</span> </div>
 <div class="line"><span class="lineno">  107</span>    <a class="code hl_namespace" href="../../da/dd3/namespacespirograph.html">spirograph</a>(&amp;points, l, k, rot);</div>
 <div class="line"><span class="lineno">  108</span> </div>
@@ -252,18 +266,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  115</span> </div>
 <div class="line"><span class="lineno">  116</span>    fp.close();</div>
 <div class="line"><span class="lineno">  117</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="abasic_ofstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a></div></div>
-<div class="ttc" id="abasic_stringstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">std::stringstream</a></div></div>
 <div class="ttc" id="anamespacespirograph_html"><div class="ttname"><a href="../../da/dd3/namespacespirograph.html">spirograph</a></div></div>
-<div class="ttc" id="asetw_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a></div><div class="ttdeci">T setw(T... args)</div></div>
-<div class="ttc" id="astr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html">std::stringstream::str</a></div><div class="ttdeci">T str(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dd3/namespacespirograph_a8e83a64e8443fff1e5ffdc1c299c1e99_cgraph.svg" width="322" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/da/dd3/namespacespirograph_a8e83a64e8443fff1e5ffdc1c299c1e99_cgraph.map b/da/dd3/namespacespirograph_a8e83a64e8443fff1e5ffdc1c299c1e99_cgraph.map
deleted file mode 100644
index 2f31c74f3..000000000
--- a/da/dd3/namespacespirograph_a8e83a64e8443fff1e5ffdc1c299c1e99_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="spirograph::test" name="spirograph::test">
-<area shape="rect" id="Node000001" title="Test function to save resulting points to a CSV file." alt="" coords="5,80,117,106"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="172,5,309,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="86,77,164,40,179,34,180,39,166,45,88,82"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="165,55,316,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="117,82,149,78,150,83,118,88"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setw.html#" title=" " alt="" coords="203,104,278,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="118,98,188,107,188,113,117,103"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_stringstream/str.html#" title=" " alt="" coords="169,153,312,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="89,104,166,140,181,145,179,150,164,145,86,109"/>
-</map>
diff --git a/da/dd3/namespacespirograph_a8e83a64e8443fff1e5ffdc1c299c1e99_cgraph.md5 b/da/dd3/namespacespirograph_a8e83a64e8443fff1e5ffdc1c299c1e99_cgraph.md5
deleted file mode 100644
index d2e5fbaa4..000000000
--- a/da/dd3/namespacespirograph_a8e83a64e8443fff1e5ffdc1c299c1e99_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bbddb3e33b1c20b2af3fb7bbd3570179
\ No newline at end of file
diff --git a/da/dd3/namespacespirograph_a8e83a64e8443fff1e5ffdc1c299c1e99_cgraph.svg b/da/dd3/namespacespirograph_a8e83a64e8443fff1e5ffdc1c299c1e99_cgraph.svg
deleted file mode 100644
index 83c3811a2..000000000
--- a/da/dd3/namespacespirograph_a8e83a64e8443fff1e5ffdc1c299c1e99_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: spirograph::test Pages: 1 -->
-<svg width="241pt" height="138pt"
- viewBox="0.00 0.00 241.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>spirograph::test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test function to save resulting points to a CSV file.">
-<polygon fill="#999999" stroke="#666666" points="83.5,-74.25 0,-74.25 0,-55 83.5,-55 83.5,-74.25"/>
-<text text-anchor="middle" x="41.75" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">spirograph::test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.75,-130.25 124.75,-130.25 124.75,-111 227.75,-111 227.75,-130.25"/>
-<text text-anchor="middle" x="176.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.01,-74.62C76.34,-82.78 98.98,-94.28 119.5,-102.62 123.1,-104.09 126.86,-105.51 130.66,-106.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.33,-110.12 139.92,-110.07 131.61,-103.51 129.33,-110.12"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-93.25 119.5,-93.25 119.5,-74 233,-74 233,-93.25"/>
-<text text-anchor="middle" x="176.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.95,-70.53C91.68,-71.64 99.94,-72.83 108.22,-74.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="107.58,-77.46 117.97,-75.41 108.57,-70.53 107.58,-77.46"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.5,-56.25 148,-56.25 148,-37 204.5,-37 204.5,-56.25"/>
-<text text-anchor="middle" x="176.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.95,-59.03C100.86,-56.73 120.33,-54.09 136.93,-51.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.96,-55.36 146.4,-50.54 136.02,-48.42 136.96,-55.36"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="229.62,-19.25 122.88,-19.25 122.88,0 229.62,0 229.62,-19.25"/>
-<text text-anchor="middle" x="176.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stringstream::str</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.66,-54.61C77,-46.71 99.31,-35.71 119.5,-27.62 123.1,-26.18 126.87,-24.77 130.67,-23.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.62,-26.79 139.95,-20.23 129.35,-20.17 131.62,-26.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/dd3/namespacespirograph_a8e83a64e8443fff1e5ffdc1c299c1e99_cgraph_org.svg b/da/dd3/namespacespirograph_a8e83a64e8443fff1e5ffdc1c299c1e99_cgraph_org.svg
deleted file mode 100644
index 287e3b0e9..000000000
--- a/da/dd3/namespacespirograph_a8e83a64e8443fff1e5ffdc1c299c1e99_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: spirograph::test Pages: 1 -->
-<svg width="241pt" height="138pt"
- viewBox="0.00 0.00 241.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>spirograph::test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test function to save resulting points to a CSV file.">
-<polygon fill="#999999" stroke="#666666" points="83.5,-74.25 0,-74.25 0,-55 83.5,-55 83.5,-74.25"/>
-<text text-anchor="middle" x="41.75" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">spirograph::test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.75,-130.25 124.75,-130.25 124.75,-111 227.75,-111 227.75,-130.25"/>
-<text text-anchor="middle" x="176.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.01,-74.62C76.34,-82.78 98.98,-94.28 119.5,-102.62 123.1,-104.09 126.86,-105.51 130.66,-106.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.33,-110.12 139.92,-110.07 131.61,-103.51 129.33,-110.12"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-93.25 119.5,-93.25 119.5,-74 233,-74 233,-93.25"/>
-<text text-anchor="middle" x="176.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.95,-70.53C91.68,-71.64 99.94,-72.83 108.22,-74.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="107.58,-77.46 117.97,-75.41 108.57,-70.53 107.58,-77.46"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.5,-56.25 148,-56.25 148,-37 204.5,-37 204.5,-56.25"/>
-<text text-anchor="middle" x="176.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.95,-59.03C100.86,-56.73 120.33,-54.09 136.93,-51.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.96,-55.36 146.4,-50.54 136.02,-48.42 136.96,-55.36"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="229.62,-19.25 122.88,-19.25 122.88,0 229.62,0 229.62,-19.25"/>
-<text text-anchor="middle" x="176.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stringstream::str</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.66,-54.61C77,-46.71 99.31,-35.71 119.5,-27.62 123.1,-26.18 126.87,-24.77 130.67,-23.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.62,-26.79 139.95,-20.23 129.35,-20.17 131.62,-26.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/dd3/namespacespirograph_aeca22dbe4563358960e907a40cd3e1ac_cgraph.map b/da/dd3/namespacespirograph_aeca22dbe4563358960e907a40cd3e1ac_cgraph.map
deleted file mode 100644
index 7cff0a0b7..000000000
--- a/da/dd3/namespacespirograph_aeca22dbe4563358960e907a40cd3e1ac_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="spirograph::spirograph" name="spirograph::spirograph">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,155,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/cos.html#" title=" " alt="" coords="203,5,271,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,29,186,24,187,29,156,34"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sin.html#" title=" " alt="" coords="205,55,269,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="156,52,190,58,189,63,155,58"/>
-</map>
diff --git a/da/dd3/namespacespirograph_aeca22dbe4563358960e907a40cd3e1ac_cgraph.md5 b/da/dd3/namespacespirograph_aeca22dbe4563358960e907a40cd3e1ac_cgraph.md5
deleted file mode 100644
index 7f904ed20..000000000
--- a/da/dd3/namespacespirograph_aeca22dbe4563358960e907a40cd3e1ac_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b842218c4ccc3ef0692aeef90d31b548
\ No newline at end of file
diff --git a/da/dd3/namespacespirograph_aeca22dbe4563358960e907a40cd3e1ac_cgraph.svg b/da/dd3/namespacespirograph_aeca22dbe4563358960e907a40cd3e1ac_cgraph.svg
deleted file mode 100644
index 3eac4e393..000000000
--- a/da/dd3/namespacespirograph_aeca22dbe4563358960e907a40cd3e1ac_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: spirograph::spirograph Pages: 1 -->
-<svg width="207pt" height="64pt"
- viewBox="0.00 0.00 207.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>spirograph::spirograph</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="112,-37.25 0,-37.25 0,-18 112,-18 112,-37.25"/>
-<text text-anchor="middle" x="56" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">spirograph::spirograph</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="199.25,-56.25 148,-56.25 148,-37 199.25,-37 199.25,-56.25"/>
-<text text-anchor="middle" x="173.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.44,-36.74C120.51,-38.06 128.63,-39.4 136.19,-40.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.58,-44.08 146.01,-42.25 136.71,-37.18 135.58,-44.08"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.75,-19.25 149.5,-19.25 149.5,0 197.75,0 197.75,-19.25"/>
-<text text-anchor="middle" x="173.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.44,-18.99C121.16,-17.64 129.96,-16.27 138.03,-15.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.41,-18.49 147.75,-13.5 137.33,-11.58 138.41,-18.49"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/dd3/namespacespirograph_aeca22dbe4563358960e907a40cd3e1ac_cgraph_org.svg b/da/dd3/namespacespirograph_aeca22dbe4563358960e907a40cd3e1ac_cgraph_org.svg
deleted file mode 100644
index d3918651e..000000000
--- a/da/dd3/namespacespirograph_aeca22dbe4563358960e907a40cd3e1ac_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: spirograph::spirograph Pages: 1 -->
-<svg width="207pt" height="64pt"
- viewBox="0.00 0.00 207.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>spirograph::spirograph</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="112,-37.25 0,-37.25 0,-18 112,-18 112,-37.25"/>
-<text text-anchor="middle" x="56" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">spirograph::spirograph</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="199.25,-56.25 148,-56.25 148,-37 199.25,-37 199.25,-56.25"/>
-<text text-anchor="middle" x="173.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.44,-36.74C120.51,-38.06 128.63,-39.4 136.19,-40.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.58,-44.08 146.01,-42.25 136.71,-37.18 135.58,-44.08"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.75,-19.25 149.5,-19.25 149.5,0 197.75,0 197.75,-19.25"/>
-<text text-anchor="middle" x="173.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.44,-18.99C121.16,-17.64 129.96,-16.27 138.03,-15.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.41,-18.49 147.75,-13.5 137.33,-11.58 138.41,-18.49"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/dd4/namespacemedian__search.html b/da/dd4/namespacemedian__search.html
index c880a1496..ea35eae4b 100644
--- a/da/dd4/namespacemedian__search.html
+++ b/da/dd4/namespacemedian__search.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: median_search Namespace Reference</title>
+<title>TheAlgorithms/C++: median_search Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/da/dda/namespaceradix__sort.html b/da/dda/namespaceradix__sort.html
index 8d2f6d706..b955aed0f 100644
--- a/da/dda/namespaceradix__sort.html
+++ b/da/dda/namespaceradix__sort.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: radix_sort Namespace Reference</title>
+<title>TheAlgorithms/C++: radix_sort Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/da/de7/decimal__to__hexadecimal_8cpp.html b/da/de7/decimal__to__hexadecimal_8cpp.html
index c013ff104..b552b8ebe 100644
--- a/da/de7/decimal__to__hexadecimal_8cpp.html
+++ b/da/de7/decimal__to__hexadecimal_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/decimal_to_hexadecimal.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/decimal_to_hexadecimal.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,7 +135,9 @@ Include dependency graph for decimal_to_hexadecimal.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/da1/decimal__to__hexadecimal_8cpp__incl.svg" width="240" height="111"><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">
+</div>
+<p><a href="../../da/de7/decimal__to__hexadecimal_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a840291bc02cba5474a4cb46a9b9566fe" id="r_a840291bc02cba5474a4cb46a9b9566fe"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a840291bc02cba5474a4cb46a9b9566fe">main</a> (void)</td></tr>
@@ -126,6 +145,8 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Convert decimal number to hexadecimal representation. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../da/de7/decimal__to__hexadecimal_8cpp_source.html">decimal_to_hexadecimal.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a840291bc02cba5474a4cb46a9b9566fe" name="a840291bc02cba5474a4cb46a9b9566fe"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a840291bc02cba5474a4cb46a9b9566fe">&#9670;&#160;</a></span>main()</h2>
@@ -142,15 +163,17 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main program </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/de7/decimal__to__hexadecimal_8cpp_source.html#l00011">11</a> of file <a class="el" href="../../da/de7/decimal__to__hexadecimal_8cpp_source.html">decimal_to_hexadecimal.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   11</span>               {</div>
 <div class="line"><span class="lineno">   12</span>    <span class="keywordtype">int</span> valueToConvert = 0;  <span class="comment">// Holds user input</span></div>
 <div class="line"><span class="lineno">   13</span>    <span class="keywordtype">int</span> hexArray[8];         <span class="comment">// Contains hex values backwards</span></div>
 <div class="line"><span class="lineno">   14</span>    <span class="keywordtype">int</span> i = 0;               <span class="comment">// counter</span></div>
 <div class="line"><span class="lineno">   15</span>    <span class="keywordtype">char</span> HexValues[] = <span class="stringliteral">&quot;0123456789ABCDEF&quot;</span>;</div>
 <div class="line"><span class="lineno">   16</span> </div>
-<div class="line"><span class="lineno">   17</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter a Decimal Value&quot;</span></div>
-<div class="line"><span class="lineno">   18</span>              &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;  <span class="comment">// Displays request to stdout</span></div>
-<div class="line"><span class="lineno">   19</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt;</div>
+<div class="line"><span class="lineno">   17</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter a Decimal Value&quot;</span></div>
+<div class="line"><span class="lineno">   18</span>              &lt;&lt; std::endl;  <span class="comment">// Displays request to stdout</span></div>
+<div class="line"><span class="lineno">   19</span>    std::cin &gt;&gt;</div>
 <div class="line"><span class="lineno">   20</span>        valueToConvert;  <span class="comment">// Stores value into valueToConvert via user input</span></div>
 <div class="line"><span class="lineno">   21</span> </div>
 <div class="line"><span class="lineno">   22</span>    <span class="keywordflow">while</span> (valueToConvert &gt; 15) {             <span class="comment">// Dec to Hex Algorithm</span></div>
@@ -160,21 +183,13 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   26</span>    }</div>
 <div class="line"><span class="lineno">   27</span>    hexArray[i] = valueToConvert;  <span class="comment">// Gets last value</span></div>
 <div class="line"><span class="lineno">   28</span> </div>
-<div class="line"><span class="lineno">   29</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hex Value: &quot;</span>;</div>
-<div class="line"><span class="lineno">   30</span>    <span class="keywordflow">while</span> (i &gt;= 0) <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; HexValues[hexArray[i--]];</div>
+<div class="line"><span class="lineno">   29</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hex Value: &quot;</span>;</div>
+<div class="line"><span class="lineno">   30</span>    <span class="keywordflow">while</span> (i &gt;= 0) std::cout &lt;&lt; HexValues[hexArray[i--]];</div>
 <div class="line"><span class="lineno">   31</span> </div>
-<div class="line"><span class="lineno">   32</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   32</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   33</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   34</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg" width="180" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map b/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map
deleted file mode 100644
index 490da38cb..000000000
--- a/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 b/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5
deleted file mode 100644
index 2f2fe09b6..000000000
--- a/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fa87532068062fd8189cade55ca11658
\ No newline at end of file
diff --git a/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg b/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg
deleted file mode 100644
index 5c76e5177..000000000
--- a/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 134.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-9.62C44.56,-9.62 52.97,-9.62 61.25,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.21,-13.13 71.21,-9.63 61.21,-6.13 61.21,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg b/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg
deleted file mode 100644
index 575e4300e..000000000
--- a/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="27pt"
- viewBox="0.00 0.00 134.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-9.62C44.56,-9.62 52.97,-9.62 61.25,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.21,-13.13 71.21,-9.63 61.21,-6.13 61.21,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/de7/decimal__to__hexadecimal_8cpp_source.html b/da/de7/decimal__to__hexadecimal_8cpp_source.html
new file mode 100644
index 000000000..e3ce0a10e
--- /dev/null
+++ b/da/de7/decimal__to__hexadecimal_8cpp_source.html
@@ -0,0 +1,167 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/decimal_to_hexadecimal.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/de7/decimal__to__hexadecimal_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">decimal_to_hexadecimal.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/de7/decimal__to__hexadecimal_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="foldopen" id="foldopen00011" data-start="{" data-end="}">
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"><a class="line" href="../../da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">   11</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">main</a>(<span class="keywordtype">void</span>) {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="keywordtype">int</span> valueToConvert = 0;  <span class="comment">// Holds user input</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <span class="keywordtype">int</span> hexArray[8];         <span class="comment">// Contains hex values backwards</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordtype">int</span> i = 0;               <span class="comment">// counter</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="keywordtype">char</span> HexValues[] = <span class="stringliteral">&quot;0123456789ABCDEF&quot;</span>;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter a Decimal Value&quot;</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>              &lt;&lt; std::endl;  <span class="comment">// Displays request to stdout</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    std::cin &gt;&gt;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        valueToConvert;  <span class="comment">// Stores value into valueToConvert via user input</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    <span class="keywordflow">while</span> (valueToConvert &gt; 15) {             <span class="comment">// Dec to Hex Algorithm</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        hexArray[i++] = valueToConvert % 16;  <span class="comment">// Gets remainder</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        valueToConvert /= 16;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        <span class="comment">// valueToConvert &gt;&gt;= 4;  // This will divide by 2^4=16 and is faster</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    }</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    hexArray[i] = valueToConvert;  <span class="comment">// Gets last value</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Hex Value: &quot;</span>;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">while</span> (i &gt;= 0) std::cout &lt;&lt; HexValues[hexArray[i--]];</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>}</div>
+</div>
+<div class="ttc" id="adecimal__to__hexadecimal_8cpp_html_a840291bc02cba5474a4cb46a9b9566fe"><div class="ttname"><a href="../../da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">main</a></div><div class="ttdeci">int main(void)</div><div class="ttdef"><b>Definition</b> <a href="#l00011">decimal_to_hexadecimal.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../da/de7/decimal__to__hexadecimal_8cpp.html">decimal_to_hexadecimal.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/de8/dijkstra__greedy_8cpp.html b/da/de8/dijkstra__greedy_8cpp.html
index ec8a46731..cfbe6471b 100644
--- a/da/de8/dijkstra__greedy_8cpp.html
+++ b/da/de8/dijkstra__greedy_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: greedy_algorithms/dijkstra_greedy.cpp File Reference</title>
+<title>TheAlgorithms/C++: greedy_algorithms/dijkstra_greedy.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for dijkstra_greedy.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/dc8/dijkstra__greedy_8cpp__incl.svg" width="335" height="126"><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">
+</div>
+<p><a href="../../da/de8/dijkstra__greedy_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html">greedy_algorithms::dijkstra::Graph</a></td></tr>
@@ -141,10 +160,10 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:af6cb29ca6dc5771439f6ea7262058a71" id="r_af6cb29ca6dc5771439f6ea7262058a71"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71">greedy_algorithms::dijkstra::minimum_distance</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; mdist, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; vset, int V)</td></tr>
+<tr class="memitem:af6cb29ca6dc5771439f6ea7262058a71" id="r_af6cb29ca6dc5771439f6ea7262058a71"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71">greedy_algorithms::dijkstra::minimum_distance</a> (std::vector&lt; int &gt; mdist, std::vector&lt; bool &gt; vset, int V)</td></tr>
 <tr class="memdesc:af6cb29ca6dc5771439f6ea7262058a71"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function that finds the vertex with the minimum distance in <code>mdist</code>.  <br /></td></tr>
 <tr class="separator:af6cb29ca6dc5771439f6ea7262058a71"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a7341d7c76a6145e991cdd231f689fca8" id="r_a7341d7c76a6145e991cdd231f689fca8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8">greedy_algorithms::dijkstra::print</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; dist, int V)</td></tr>
+<tr class="memitem:a7341d7c76a6145e991cdd231f689fca8" id="r_a7341d7c76a6145e991cdd231f689fca8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8">greedy_algorithms::dijkstra::print</a> (std::vector&lt; int &gt; dist, int V)</td></tr>
 <tr class="memdesc:a7341d7c76a6145e991cdd231f689fca8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to print the distances to vertices.  <br /></td></tr>
 <tr class="separator:a7341d7c76a6145e991cdd231f689fca8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af915876d0ca33cc71a6a6191a8cd3ccd" id="r_af915876d0ca33cc71a6a6191a8cd3ccd"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af915876d0ca33cc71a6a6191a8cd3ccd">greedy_algorithms::dijkstra::dijkstra</a> (<a class="el" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html">Graph</a> graph, int src)</td></tr>
@@ -164,6 +183,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd>
 <dd>
 <a href="https://github.com/arpanjain97" target="_blank">Arpan Jain</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html">dijkstra_greedy.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -182,17 +203,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html#l00199">199</a> of file <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html">dijkstra_greedy.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  199</span>           {</div>
 <div class="line"><span class="lineno">  200</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  201</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  202</span>}</div>
-<div class="ttc" id="adijkstra__greedy_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> dijkstra_greedy.cpp:160</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="159" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="adijkstra__greedy_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../da/de8/dijkstra__greedy_8cpp_source.html#l00160">dijkstra_greedy.cpp:160</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -220,6 +238,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html#l00160">160</a> of file <a class="el" href="../../da/de8/dijkstra__greedy_8cpp_source.html">dijkstra_greedy.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  160</span>                    {</div>
 <div class="line"><span class="lineno">  161</span>    <a class="code hl_class" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html">greedy_algorithms::dijkstra::Graph</a> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>(8);</div>
 <div class="line"><span class="lineno">  162</span> </div>
@@ -252,10 +272,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  189</span> </div>
 <div class="line"><span class="lineno">  190</span>    assert(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edges[1][3] == 3);</div>
 <div class="line"><span class="lineno">  191</span> </div>
-<div class="line"><span class="lineno">  192</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  192</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  193</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="aclassgreedy__algorithms_1_1dijkstra_1_1_graph_html"><div class="ttname"><a href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html">greedy_algorithms::dijkstra::Graph</a></div><div class="ttdoc">Wrapper class for storing a graph.</div><div class="ttdef"><b>Definition</b> dijkstra_greedy.cpp:35</div></div>
+<div class="ttc" id="aclassgreedy__algorithms_1_1dijkstra_1_1_graph_html"><div class="ttname"><a href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html">greedy_algorithms::dijkstra::Graph</a></div><div class="ttdoc">Wrapper class for storing a graph.</div><div class="ttdef"><b>Definition</b> <a href="../../da/de8/dijkstra__greedy_8cpp_source.html#l00035">dijkstra_greedy.cpp:35</a></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>
diff --git a/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 2ab19cd06..000000000
--- a/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$da/de8/dijkstra__greedy_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,5,153,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,88,16,88,21,55,21"/>
-</map>
diff --git a/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index a4288c571..000000000
--- a/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ed234f3308411cd94ef89d2c5e550bb7
\ No newline at end of file
diff --git a/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index fe8a2402e..000000000
--- a/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="119pt" height="27pt"
- viewBox="0.00 0.00 118.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/de8/dijkstra__greedy_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-9.62C44.55,-9.62 53.37,-9.62 61.69,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-13.13 71.43,-9.63 61.43,-6.13 61.43,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 45d98052a..000000000
--- a/da/de8/dijkstra__greedy_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="119pt" height="27pt"
- viewBox="0.00 0.00 118.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/de8/dijkstra__greedy_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-9.62C44.55,-9.62 53.37,-9.62 61.69,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-13.13 71.43,-9.63 61.43,-6.13 61.43,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/de8/dijkstra__greedy_8cpp_source.html b/da/de8/dijkstra__greedy_8cpp_source.html
new file mode 100644
index 000000000..e3cb5cb00
--- /dev/null
+++ b/da/de8/dijkstra__greedy_8cpp_source.html
@@ -0,0 +1,294 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: greedy_algorithms/dijkstra_greedy.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/de8/dijkstra__greedy_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">dijkstra_greedy.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/de8/dijkstra__greedy_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;climits&gt;</span>   </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a> {</div>
+<div class="foldopen" id="foldopen00031" data-start="{" data-end="}">
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html">   31</a></span><span class="keyword">namespace </span>dijkstra {</div>
+<div class="foldopen" id="foldopen00035" data-start="{" data-end="};">
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html">   35</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html">Graph</a> {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordtype">int</span> vertexNum = 0;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    std::vector&lt;std::vector&lt;int&gt;&gt; edges{};</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="foldopen" id="foldopen00044" data-start="{" data-end="}">
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc">   44</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc">Graph</a>(<span class="keyword">const</span> <span class="keywordtype">int</span> V) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="comment">// Initialize the array edges</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        this-&gt;edges = std::vector&lt;std::vector&lt;int&gt;&gt;(V, std::vector&lt;int&gt;(V, 0));</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            edges[i] = std::vector&lt;int&gt;(V, 0);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        <span class="comment">// Fills the array with zeros</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; V; j++) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>                edges[i][j] = 0;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        this-&gt;vertexNum = V;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    }</div>
+</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="foldopen" id="foldopen00068" data-start="{" data-end="}">
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"><a class="line" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79">   68</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79">add_edge</a>(<span class="keywordtype">int</span> src, <span class="keywordtype">int</span> dst, <span class="keywordtype">int</span> weight) {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        this-&gt;edges[src][dst] = weight;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    }</div>
+</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>};</div>
+</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="foldopen" id="foldopen00082" data-start="{" data-end="}">
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71">   82</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71">minimum_distance</a>(std::vector&lt;int&gt; mdist, std::vector&lt;bool&gt; vset, <span class="keywordtype">int</span> V) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordtype">int</span> minVal = INT_MAX, minInd = 0;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        <span class="keywordflow">if</span> (!vset[i] &amp;&amp; (mdist[i] &lt; minVal)) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            minVal = mdist[i];</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            minInd = i;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordflow">return</span> minInd;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>}</div>
+</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="foldopen" id="foldopen00104" data-start="{" data-end="}">
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"><a class="line" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8">  104</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8">print</a>(std::vector&lt;int&gt; dist, <span class="keywordtype">int</span> V) {</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nVertex  Distance\n&quot;</span>;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        <span class="keywordflow">if</span> (dist[i] &lt; INT_MAX) {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>            std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; dist[i] &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        }</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>            std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;\tINF&quot;</span> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        }</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    }</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>}</div>
+</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="foldopen" id="foldopen00124" data-start="{" data-end="}">
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"><a class="line" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af915876d0ca33cc71a6a6191a8cd3ccd">  124</a></span><span class="keywordtype">void</span> dijkstra(<a class="code hl_class" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html">Graph</a> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, <span class="keywordtype">int</span> src) {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    <span class="keywordtype">int</span> V = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.vertexNum;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    std::vector&lt;int&gt; mdist{};  <span class="comment">// Stores updated distances to the vertex</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    std::vector&lt;bool&gt; vset{};  <span class="comment">// `vset[i]` is true if the vertex `i` is included in the shortest path tree</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    <span class="comment">// Initialize `mdist and `vset`. Set the distance of the source as zero</span></div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        mdist[i] = INT_MAX;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        vset[i] = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    }</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    mdist[src] = 0;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span> </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <span class="comment">// iterate to find the shortest path</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> count = 0; count &lt; V - 1; count++) {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>        <span class="keywordtype">int</span> u = <a class="code hl_function" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71">minimum_distance</a>(mdist, vset, V);</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span> </div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        vset[u] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span> </div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> v = 0; v &lt; V; v++) {</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>            <span class="keywordflow">if</span> (!vset[v] &amp;&amp; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edges[u][v] &amp;&amp;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>                mdist[u] + <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edges[u][v] &lt; mdist[v]) {</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>                mdist[v] = mdist[u] + <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edges[u][v];</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>            }</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        }</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    }</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    <a class="code hl_function" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8">print</a>(mdist, V);</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>}</div>
+</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>}  <span class="comment">// namespace dijkstra</span></div>
+</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>}  <span class="comment">// namespace greedy_algorithms</span></div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span> </div>
+<div class="foldopen" id="foldopen00160" data-start="{" data-end="}">
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"><a class="line" href="../../da/de8/dijkstra__greedy_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">  160</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../da/de8/dijkstra__greedy_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    <a class="code hl_class" href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html">greedy_algorithms::dijkstra::Graph</a> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>(8);</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span> </div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    <span class="comment">// 1st test.</span></div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(6, 2, 4);</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(2, 6, 4);</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span> </div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    assert(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edges[6][2] == 4);</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span> </div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    <span class="comment">// 2nd test.</span></div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(0, 1, 1);</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(1, 0, 1);</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span> </div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    assert(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edges[0][1] == 1);</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span> </div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    <span class="comment">// 3rd test.</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(0, 2, 7);</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(2, 0, 7);</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(1, 2, 1);</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(2, 1, 1);</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span> </div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    assert(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edges[0][2] == 7);</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span> </div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    <span class="comment">// 4th test.</span></div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(1, 3, 3);</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(3, 1, 3);</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(1, 4, 2);</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(4, 1, 2);</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.add_edge(2, 3, 2);</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span> </div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    assert(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edges[1][3] == 3);</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span> </div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>}</div>
+</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span> </div>
+<div class="foldopen" id="foldopen00199" data-start="{" data-end="}">
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"><a class="line" href="../../da/de8/dijkstra__greedy_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  199</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../da/de8/dijkstra__greedy_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    <a class="code hl_function" href="../../da/de8/dijkstra__greedy_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>}</div>
+</div>
+<div class="ttc" id="aclassgreedy__algorithms_1_1dijkstra_1_1_graph_html"><div class="ttname"><a href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html">greedy_algorithms::dijkstra::Graph</a></div><div class="ttdoc">Wrapper class for storing a graph.</div><div class="ttdef"><b>Definition</b> <a href="#l00035">dijkstra_greedy.cpp:35</a></div></div>
+<div class="ttc" id="aclassgreedy__algorithms_1_1dijkstra_1_1_graph_html_a224b6efacbad55d59e11b046f792fe79"><div class="ttname"><a href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79">greedy_algorithms::dijkstra::Graph::add_edge</a></div><div class="ttdeci">void add_edge(int src, int dst, int weight)</div><div class="ttdoc">Adds an edge to the graph.</div><div class="ttdef"><b>Definition</b> <a href="#l00068">dijkstra_greedy.cpp:68</a></div></div>
+<div class="ttc" id="aclassgreedy__algorithms_1_1dijkstra_1_1_graph_html_afefaeb247734a7c64bd04e68e3c1c4bc"><div class="ttname"><a href="../../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc">greedy_algorithms::dijkstra::Graph::Graph</a></div><div class="ttdeci">Graph(const int V)</div><div class="ttdoc">Constructs a graph.</div><div class="ttdef"><b>Definition</b> <a href="#l00044">dijkstra_greedy.cpp:44</a></div></div>
+<div class="ttc" id="adijkstra__greedy_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../da/de8/dijkstra__greedy_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> <a href="#l00160">dijkstra_greedy.cpp:160</a></div></div>
+<div class="ttc" id="adijkstra__greedy_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/de8/dijkstra__greedy_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00199">dijkstra_greedy.cpp:199</a></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 class="ttc" id="anamespacegreedy__algorithms_1_1dijkstra_html_a7341d7c76a6145e991cdd231f689fca8"><div class="ttname"><a href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8">greedy_algorithms::dijkstra::print</a></div><div class="ttdeci">void print(std::vector&lt; int &gt; dist, int V)</div><div class="ttdoc">Utility function to print the distances to vertices.</div><div class="ttdef"><b>Definition</b> <a href="#l00104">dijkstra_greedy.cpp:104</a></div></div>
+<div class="ttc" id="anamespacegreedy__algorithms_1_1dijkstra_html_af6cb29ca6dc5771439f6ea7262058a71"><div class="ttname"><a href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71">greedy_algorithms::dijkstra::minimum_distance</a></div><div class="ttdeci">int minimum_distance(std::vector&lt; int &gt; mdist, std::vector&lt; bool &gt; vset, int V)</div><div class="ttdoc">Utility function that finds the vertex with the minimum distance in mdist.</div><div class="ttdef"><b>Definition</b> <a href="#l00082">dijkstra_greedy.cpp:82</a></div></div>
+<div class="ttc" id="anamespacegreedy__algorithms_html"><div class="ttname"><a href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></div><div class="ttdoc">for string class</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d1f/binary__addition_8cpp_source.html#l00027">binary_addition.cpp:27</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_0eaa691bd54ab0922ca7f50599de6d22.html">greedy_algorithms</a></li><li class="navelem"><a class="el" href="../../da/de8/dijkstra__greedy_8cpp.html">dijkstra_greedy.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/df2/durand__kerner__roots_8cpp.html b/da/df2/durand__kerner__roots_8cpp.html
index 7dae5de80..cc5b0b0bd 100644
--- a/da/df2/durand__kerner__roots_8cpp.html
+++ b/da/df2/durand__kerner__roots_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/durand_kerner_roots.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/durand_kerner_roots.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -128,7 +145,9 @@ Include dependency graph for durand_kerner_roots.cpp:</div>
 <div class="dyncontent">
 <div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/d26/durand__kerner__roots_8cpp__incl.svg" width="100%" height="394"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
 </div>
-</div><table class="memberdecls">
+</div>
+<p><a href="../../da/df2/durand__kerner__roots_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="define-members" name="define-members"></a>
 Macros</h2></td></tr>
 <tr class="memitem:af270a96662132d0385cb6b4637c5a689" id="r_af270a96662132d0385cb6b4637c5a689"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af270a96662132d0385cb6b4637c5a689">ACCURACY</a>&#160;&#160;&#160;1e-10</td></tr>
@@ -139,13 +158,13 @@ Macros</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:ae2ab49ba1969d7a5988f9bc2c8924569" id="r_ae2ab49ba1969d7a5988f9bc2c8924569"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae2ab49ba1969d7a5988f9bc2c8924569">poly_function</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;coeffs, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; x)</td></tr>
+<tr class="memitem:ae2ab49ba1969d7a5988f9bc2c8924569" id="r_ae2ab49ba1969d7a5988f9bc2c8924569"><td class="memItemLeft" align="right" valign="top">std::complex&lt; double &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae2ab49ba1969d7a5988f9bc2c8924569">poly_function</a> (const std::valarray&lt; double &gt; &amp;coeffs, std::complex&lt; double &gt; x)</td></tr>
 <tr class="separator:ae2ab49ba1969d7a5988f9bc2c8924569"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a90219e35062007d1f1b68e9af071ab5c" id="r_a90219e35062007d1f1b68e9af071ab5c"><td class="memItemLeft" align="right" valign="top">const char *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a90219e35062007d1f1b68e9af071ab5c">complex_str</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; &amp;x)</td></tr>
+<tr class="memitem:a90219e35062007d1f1b68e9af071ab5c" id="r_a90219e35062007d1f1b68e9af071ab5c"><td class="memItemLeft" align="right" valign="top">const char *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a90219e35062007d1f1b68e9af071ab5c">complex_str</a> (const std::complex&lt; double &gt; &amp;x)</td></tr>
 <tr class="separator:a90219e35062007d1f1b68e9af071ab5c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a024b8bc4755863315456d573a6732377" id="r_a024b8bc4755863315456d573a6732377"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a024b8bc4755863315456d573a6732377">check_termination</a> (long double delta)</td></tr>
 <tr class="separator:a024b8bc4755863315456d573a6732377"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2c35b320ace8677f9b331faf94f8b2fd" id="r_a2c35b320ace8677f9b331faf94f8b2fd"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint32_t, double &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2c35b320ace8677f9b331faf94f8b2fd">durand_kerner_algo</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;coeffs, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; &gt; *roots, bool write_log=false)</td></tr>
+<tr class="memitem:a2c35b320ace8677f9b331faf94f8b2fd" id="r_a2c35b320ace8677f9b331faf94f8b2fd"><td class="memItemLeft" align="right" valign="top">std::pair&lt; uint32_t, double &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2c35b320ace8677f9b331faf94f8b2fd">durand_kerner_algo</a> (const std::valarray&lt; double &gt; &amp;coeffs, std::valarray&lt; std::complex&lt; double &gt; &gt; *roots, bool write_log=false)</td></tr>
 <tr class="separator:a2c35b320ace8677f9b331faf94f8b2fd"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a1440a7779ac56f47a3f355ce4a8c7da0" id="r_a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a> ()</td></tr>
 <tr class="separator:a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -170,6 +189,8 @@ Functions</h2></td></tr>
    iteration." style="pointer-events: none;" width="400" class="inline"/> <img src="https://raw.githubusercontent.com/TheAlgorithms/C-Plus-Plus/docs/images/numerical_methods/durand_kerner_roots.svg" alt="Roots evolution - shows the initial approximation of the
    roots and their convergence to a final approximation along with the iterative
    approximations" style="pointer-events: none;" width="400" class="inline"/> </p>
+
+<p class="definition">Definition in file <a class="el" href="../../da/df2/durand__kerner__roots_8cpp_source.html">durand_kerner_roots.cpp</a>.</p>
 </div><h2 class="groupheader">Macro Definition Documentation</h2>
 <a id="af270a96662132d0385cb6b4637c5a689" name="af270a96662132d0385cb6b4637c5a689"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#af270a96662132d0385cb6b4637c5a689">&#9670;&#160;</a></span>ACCURACY</h2>
@@ -184,6 +205,8 @@ Functions</h2></td></tr>
 </div><div class="memdoc">
 <p>maximum accuracy limit </p>
 
+<p class="definition">Definition at line <a class="el" href="../../da/df2/durand__kerner__roots_8cpp_source.html#l00046">46</a> of file <a class="el" href="../../da/df2/durand__kerner__roots_8cpp_source.html">durand_kerner_roots.cpp</a>.</p>
+
 </div>
 </div>
 <h2 class="groupheader">Function Documentation</h2>
@@ -210,6 +233,8 @@ Functions</h2></td></tr>
 <dl class="section return"><dt>Returns</dt><dd><code>false</code> if termination not reached </dd>
 <dd>
 <code>true</code> if termination reached </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/df2/durand__kerner__roots_8cpp_source.html#l00092">92</a> of file <a class="el" href="../../da/df2/durand__kerner__roots_8cpp_source.html">durand_kerner_roots.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   92</span>                                          {</div>
 <div class="line"><span class="lineno">   93</span>    <span class="keyword">static</span> <span class="keywordtype">long</span> <span class="keywordtype">double</span> past_delta = INFINITY;</div>
 <div class="line"><span class="lineno">   94</span>    <span class="keywordflow">if</span> (std::abs(past_delta - delta) &lt;= <a class="code hl_define" href="#af270a96662132d0385cb6b4637c5a689">ACCURACY</a> || delta &lt; <a class="code hl_define" href="#af270a96662132d0385cb6b4637c5a689">ACCURACY</a>)</div>
@@ -217,7 +242,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   96</span>    past_delta = delta;</div>
 <div class="line"><span class="lineno">   97</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   98</span>}</div>
-<div class="ttc" id="adurand__kerner__roots_8cpp_html_af270a96662132d0385cb6b4637c5a689"><div class="ttname"><a href="#af270a96662132d0385cb6b4637c5a689">ACCURACY</a></div><div class="ttdeci">#define ACCURACY</div><div class="ttdef"><b>Definition</b> durand_kerner_roots.cpp:46</div></div>
+<div class="ttc" id="adurand__kerner__roots_8cpp_html_af270a96662132d0385cb6b4637c5a689"><div class="ttname"><a href="#af270a96662132d0385cb6b4637c5a689">ACCURACY</a></div><div class="ttdeci">#define ACCURACY</div><div class="ttdef"><b>Definition</b> <a href="../../da/df2/durand__kerner__roots_8cpp_source.html#l00046">durand_kerner_roots.cpp:46</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -230,7 +255,7 @@ Functions</h2></td></tr>
         <tr>
           <td class="memname">const char * complex_str </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>x</em></span></td><td>)</td>
+          <td class="paramtype">const std::complex&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>x</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -242,23 +267,17 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>pointer to converted string </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/df2/durand__kerner__roots_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../da/df2/durand__kerner__roots_8cpp_source.html">durand_kerner_roots.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   77</span>                                                     {</div>
 <div class="line"><span class="lineno">   78</span><span class="preprocessor">#define MAX_BUFF_SIZE 50</span></div>
 <div class="line"><span class="lineno">   79</span>    <span class="keyword">static</span> <span class="keywordtype">char</span> msg[MAX_BUFF_SIZE];</div>
 <div class="line"><span class="lineno">   80</span> </div>
-<div class="line"><span class="lineno">   81</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fprintf.html">std::snprintf</a>(msg, MAX_BUFF_SIZE, <span class="stringliteral">&quot;% 7.04g%+7.04gj&quot;</span>, x.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">real</a>(), x.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">imag</a>());</div>
+<div class="line"><span class="lineno">   81</span>    std::snprintf(msg, MAX_BUFF_SIZE, <span class="stringliteral">&quot;% 7.04g%+7.04gj&quot;</span>, x.real(), x.imag());</div>
 <div class="line"><span class="lineno">   82</span> </div>
 <div class="line"><span class="lineno">   83</span>    <span class="keywordflow">return</span> msg;</div>
 <div class="line"><span class="lineno">   84</span>}</div>
-<div class="ttc" id="afprintf_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/c/fprintf.html">std::snprintf</a></div><div class="ttdeci">T snprintf(T... args)</div></div>
-<div class="ttc" id="aimag_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">std::complex::imag</a></div><div class="ttdeci">T imag(T... args)</div></div>
-<div class="ttc" id="areal_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">std::complex::real</a></div><div class="ttdeci">T real(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/df2/durand__kerner__roots_8cpp_a90219e35062007d1f1b68e9af071ab5c_cgraph.svg" width="284" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2c35b320ace8677f9b331faf94f8b2fd" name="a2c35b320ace8677f9b331faf94f8b2fd"></a>
@@ -268,14 +287,14 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint32_t, double &gt; durand_kerner_algo </td>
+          <td class="memname">std::pair&lt; uint32_t, double &gt; durand_kerner_algo </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>coeffs</em></span>, </td>
+          <td class="paramtype">const std::valarray&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>coeffs</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>roots</em></span>, </td>
+          <td class="paramtype">std::valarray&lt; std::complex&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>roots</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -294,20 +313,22 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>pair of values - number of iterations taken and final accuracy achieved </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/df2/durand__kerner__roots_8cpp_source.html#l00110">110</a> of file <a class="el" href="../../da/df2/durand__kerner__roots_8cpp_source.html">durand_kerner_roots.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  112</span>                                                                    {</div>
 <div class="line"><span class="lineno">  113</span>    <span class="keywordtype">long</span> <span class="keywordtype">double</span> tol_condition = 1;</div>
 <div class="line"><span class="lineno">  114</span>    uint32_t iter = 0;</div>
 <div class="line"><span class="lineno">  115</span>    <span class="keywordtype">int</span> n;</div>
-<div class="line"><span class="lineno">  116</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a> log_file;</div>
+<div class="line"><span class="lineno">  116</span>    std::ofstream log_file;</div>
 <div class="line"><span class="lineno">  117</span> </div>
 <div class="line"><span class="lineno">  118</span>    <span class="keywordflow">if</span> (write_log) {</div>
 <div class="line"><span class="lineno">  119</span>        <span class="comment">/*</span></div>
 <div class="line"><span class="lineno">  120</span><span class="comment">         * store intermediate values to a CSV file</span></div>
 <div class="line"><span class="lineno">  121</span><span class="comment">         */</span></div>
-<div class="line"><span class="lineno">  122</span>        log_file.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html">open</a>(<span class="stringliteral">&quot;durand_kerner.log.csv&quot;</span>);</div>
-<div class="line"><span class="lineno">  123</span>        <span class="keywordflow">if</span> (!log_file.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">is_open</a>()) {</div>
-<div class="line"><span class="lineno">  124</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/perror.html">perror</a>(<span class="stringliteral">&quot;Unable to create a storage log file!&quot;</span>);</div>
-<div class="line"><span class="lineno">  125</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  122</span>        log_file.open(<span class="stringliteral">&quot;durand_kerner.log.csv&quot;</span>);</div>
+<div class="line"><span class="lineno">  123</span>        <span class="keywordflow">if</span> (!log_file.is_open()) {</div>
+<div class="line"><span class="lineno">  124</span>            perror(<span class="stringliteral">&quot;Unable to create a storage log file!&quot;</span>);</div>
+<div class="line"><span class="lineno">  125</span>            std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  126</span>        }</div>
 <div class="line"><span class="lineno">  127</span>        log_file &lt;&lt; <span class="stringliteral">&quot;iter#,&quot;</span>;</div>
 <div class="line"><span class="lineno">  128</span> </div>
@@ -326,7 +347,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  141</span>        iter++;</div>
 <div class="line"><span class="lineno">  142</span>        break_loop = <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  143</span> </div>
-<div class="line"><span class="lineno">  144</span>        <span class="keywordflow">if</span> (log_file.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">is_open</a>())</div>
+<div class="line"><span class="lineno">  144</span>        <span class="keywordflow">if</span> (log_file.is_open())</div>
 <div class="line"><span class="lineno">  145</span>            log_file &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span> &lt;&lt; iter &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
 <div class="line"><span class="lineno">  146</span> </div>
 <div class="line"><span class="lineno">  147</span><span class="preprocessor">#ifdef _OPENMP</span></div>
@@ -336,17 +357,17 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  151</span>            <span class="keywordflow">if</span> (break_loop)</div>
 <div class="line"><span class="lineno">  152</span>                <span class="keywordflow">continue</span>;</div>
 <div class="line"><span class="lineno">  153</span> </div>
-<div class="line"><span class="lineno">  154</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> numerator, denominator;</div>
+<div class="line"><span class="lineno">  154</span>            std::complex&lt;double&gt; numerator, denominator;</div>
 <div class="line"><span class="lineno">  155</span>            numerator = <a class="code hl_function" href="#ae2ab49ba1969d7a5988f9bc2c8924569">poly_function</a>(coeffs, (*roots)[n]);</div>
 <div class="line"><span class="lineno">  156</span>            denominator = 1.0;</div>
 <div class="line"><span class="lineno">  157</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; roots-&gt;size(); i++)</div>
 <div class="line"><span class="lineno">  158</span>                <span class="keywordflow">if</span> (i != n)</div>
 <div class="line"><span class="lineno">  159</span>                    denominator *= (*roots)[n] - (*roots)[i];</div>
 <div class="line"><span class="lineno">  160</span> </div>
-<div class="line"><span class="lineno">  161</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a> delta = numerator / denominator;</div>
+<div class="line"><span class="lineno">  161</span>            std::complex&lt;long double&gt; delta = numerator / denominator;</div>
 <div class="line"><span class="lineno">  162</span> </div>
-<div class="line"><span class="lineno">  163</span>            <span class="keywordflow">if</span> (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/isnan.html">std::isnan</a>(std::abs(delta)) || <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/isinf.html">std::isinf</a>(std::abs(delta))) {</div>
-<div class="line"><span class="lineno">  164</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;\n\nOverflow/underrun error - got value = &quot;</span></div>
+<div class="line"><span class="lineno">  163</span>            <span class="keywordflow">if</span> (std::isnan(std::abs(delta)) || std::isinf(std::abs(delta))) {</div>
+<div class="line"><span class="lineno">  164</span>                std::cerr &lt;&lt; <span class="stringliteral">&quot;\n\nOverflow/underrun error - got value = &quot;</span></div>
 <div class="line"><span class="lineno">  165</span>                          &lt;&lt; std::abs(delta) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  166</span>                <span class="comment">// return std::pair&lt;uint32_t, double&gt;(iter, tol_condition);</span></div>
 <div class="line"><span class="lineno">  167</span>                break_loop = <span class="keyword">true</span>;</div>
@@ -357,54 +378,38 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  172</span><span class="preprocessor">#ifdef _OPENMP</span></div>
 <div class="line"><span class="lineno">  173</span><span class="preprocessor">#pragma omp critical</span></div>
 <div class="line"><span class="lineno">  174</span><span class="preprocessor">#endif</span></div>
-<div class="line"><span class="lineno">  175</span>            tol_condition = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(tol_condition, std::abs(std::abs(delta)));</div>
+<div class="line"><span class="lineno">  175</span>            tol_condition = std::max(tol_condition, std::abs(std::abs(delta)));</div>
 <div class="line"><span class="lineno">  176</span>        }</div>
 <div class="line"><span class="lineno">  177</span>        <span class="comment">// tol_condition /= (degree - 1);</span></div>
 <div class="line"><span class="lineno">  178</span> </div>
 <div class="line"><span class="lineno">  179</span>        <span class="keywordflow">if</span> (break_loop)</div>
 <div class="line"><span class="lineno">  180</span>            <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  181</span> </div>
-<div class="line"><span class="lineno">  182</span>        <span class="keywordflow">if</span> (log_file.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">is_open</a>()) {</div>
+<div class="line"><span class="lineno">  182</span>        <span class="keywordflow">if</span> (log_file.is_open()) {</div>
 <div class="line"><span class="lineno">  183</span>            <span class="keywordflow">for</span> (n = 0; n &lt; roots-&gt;size(); n++)</div>
 <div class="line"><span class="lineno">  184</span>                log_file &lt;&lt; <a class="code hl_function" href="#a90219e35062007d1f1b68e9af071ab5c">complex_str</a>((*roots)[n]) &lt;&lt; <span class="stringliteral">&quot;,&quot;</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="preprocessor">#if defined(DEBUG) || !defined(NDEBUG)</span></div>
 <div class="line"><span class="lineno">  188</span>        <span class="keywordflow">if</span> (iter % 500 == 0) {</div>
-<div class="line"><span class="lineno">  189</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Iter: &quot;</span> &lt;&lt; iter &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><span class="lineno">  189</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Iter: &quot;</span> &lt;&lt; iter &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
 <div class="line"><span class="lineno">  190</span>            <span class="keywordflow">for</span> (n = 0; n &lt; roots-&gt;size(); n++)</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> &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; <a class="code hl_function" href="#a90219e35062007d1f1b68e9af071ab5c">complex_str</a>((*roots)[n]);</div>
-<div class="line"><span class="lineno">  192</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\t\tabsolute average change: &quot;</span> &lt;&lt; tol_condition</div>
+<div class="line"><span class="lineno">  191</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; <a class="code hl_function" href="#a90219e35062007d1f1b68e9af071ab5c">complex_str</a>((*roots)[n]);</div>
+<div class="line"><span class="lineno">  192</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\t\tabsolute average change: &quot;</span> &lt;&lt; tol_condition</div>
 <div class="line"><span class="lineno">  193</span>                      &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  194</span>        }</div>
 <div class="line"><span class="lineno">  195</span><span class="preprocessor">#endif</span></div>
 <div class="line"><span class="lineno">  196</span> </div>
-<div class="line"><span class="lineno">  197</span>        <span class="keywordflow">if</span> (log_file.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">is_open</a>())</div>
+<div class="line"><span class="lineno">  197</span>        <span class="keywordflow">if</span> (log_file.is_open())</div>
 <div class="line"><span class="lineno">  198</span>            log_file &lt;&lt; tol_condition;</div>
 <div class="line"><span class="lineno">  199</span>    }</div>
 <div class="line"><span class="lineno">  200</span> </div>
-<div class="line"><span class="lineno">  201</span>    <span class="keywordflow">return</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;uint32_t, long double&gt;</a>(iter, tol_condition);</div>
+<div class="line"><span class="lineno">  201</span>    <span class="keywordflow">return</span> std::pair&lt;uint32_t, long double&gt;(iter, tol_condition);</div>
 <div class="line"><span class="lineno">  202</span>}</div>
-<div class="ttc" id="abasic_ofstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div></div>
-<div class="ttc" id="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div></div>
-<div class="ttc" id="adurand__kerner__roots_8cpp_html_a024b8bc4755863315456d573a6732377"><div class="ttname"><a href="#a024b8bc4755863315456d573a6732377">check_termination</a></div><div class="ttdeci">bool check_termination(long double delta)</div><div class="ttdef"><b>Definition</b> durand_kerner_roots.cpp:92</div></div>
-<div class="ttc" id="adurand__kerner__roots_8cpp_html_a90219e35062007d1f1b68e9af071ab5c"><div class="ttname"><a href="#a90219e35062007d1f1b68e9af071ab5c">complex_str</a></div><div class="ttdeci">const char * complex_str(const std::complex&lt; double &gt; &amp;x)</div><div class="ttdef"><b>Definition</b> durand_kerner_roots.cpp:77</div></div>
-<div class="ttc" id="adurand__kerner__roots_8cpp_html_ae2ab49ba1969d7a5988f9bc2c8924569"><div class="ttname"><a href="#ae2ab49ba1969d7a5988f9bc2c8924569">poly_function</a></div><div class="ttdeci">std::complex&lt; double &gt; poly_function(const std::valarray&lt; double &gt; &amp;coeffs, std::complex&lt; double &gt; x)</div><div class="ttdef"><b>Definition</b> durand_kerner_roots.cpp:54</div></div>
-<div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
-<div class="ttc" id="ais_open_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">std::ofstream::is_open</a></div><div class="ttdeci">T is_open(T... args)</div></div>
-<div class="ttc" id="aisinf_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/isinf.html">std::isinf</a></div><div class="ttdeci">T isinf(T... args)</div></div>
-<div class="ttc" id="aisnan_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/isnan.html">std::isnan</a></div><div class="ttdeci">T isnan(T... args)</div></div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="aopen_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html">std::ofstream::open</a></div><div class="ttdeci">T open(T... args)</div></div>
-<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
-<div class="ttc" id="aperror_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/c/perror.html">std::perror</a></div><div class="ttdeci">T perror(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/df2/durand__kerner__roots_8cpp_a2c35b320ace8677f9b331faf94f8b2fd_cgraph.svg" width="526" height="431"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="adurand__kerner__roots_8cpp_html_a024b8bc4755863315456d573a6732377"><div class="ttname"><a href="#a024b8bc4755863315456d573a6732377">check_termination</a></div><div class="ttdeci">bool check_termination(long double delta)</div><div class="ttdef"><b>Definition</b> <a href="../../da/df2/durand__kerner__roots_8cpp_source.html#l00092">durand_kerner_roots.cpp:92</a></div></div>
+<div class="ttc" id="adurand__kerner__roots_8cpp_html_a90219e35062007d1f1b68e9af071ab5c"><div class="ttname"><a href="#a90219e35062007d1f1b68e9af071ab5c">complex_str</a></div><div class="ttdeci">const char * complex_str(const std::complex&lt; double &gt; &amp;x)</div><div class="ttdef"><b>Definition</b> <a href="../../da/df2/durand__kerner__roots_8cpp_source.html#l00077">durand_kerner_roots.cpp:77</a></div></div>
+<div class="ttc" id="adurand__kerner__roots_8cpp_html_ae2ab49ba1969d7a5988f9bc2c8924569"><div class="ttname"><a href="#ae2ab49ba1969d7a5988f9bc2c8924569">poly_function</a></div><div class="ttdeci">std::complex&lt; double &gt; poly_function(const std::valarray&lt; double &gt; &amp;coeffs, std::complex&lt; double &gt; x)</div><div class="ttdef"><b>Definition</b> <a href="../../da/df2/durand__kerner__roots_8cpp_source.html#l00054">durand_kerner_roots.cpp:54</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a3c04138a5bfe5d72780bb7e82a18e627" name="a3c04138a5bfe5d72780bb7e82a18e627"></a>
@@ -425,37 +430,39 @@ Here is the call graph for this function:</div>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../da/df2/durand__kerner__roots_8cpp_source.html#l00284">284</a> of file <a class="el" href="../../da/df2/durand__kerner__roots_8cpp_source.html">durand_kerner_roots.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  284</span>                                {</div>
 <div class="line"><span class="lineno">  285</span>    <span class="comment">/* initialize random seed: */</span></div>
-<div class="line"><span class="lineno">  286</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>));</div>
+<div class="line"><span class="lineno">  286</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
 <div class="line"><span class="lineno">  287</span> </div>
 <div class="line"><span class="lineno">  288</span>    <span class="keywordflow">if</span> (argc &lt; 2) {</div>
 <div class="line"><span class="lineno">  289</span>        <a class="code hl_function" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();  <span class="comment">// run tests when no input is provided</span></div>
 <div class="line"><span class="lineno">  290</span>        <a class="code hl_function" href="#a0283886819c7c140a023582b7269e2d0">test2</a>();  <span class="comment">// and skip tests when input polynomial is provided</span></div>
-<div class="line"><span class="lineno">  291</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Please pass the coefficients of the polynomial as &quot;</span></div>
+<div class="line"><span class="lineno">  291</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Please pass the coefficients of the polynomial as &quot;</span></div>
 <div class="line"><span class="lineno">  292</span>                     <span class="stringliteral">&quot;commandline &quot;</span></div>
 <div class="line"><span class="lineno">  293</span>                     <span class="stringliteral">&quot;arguments.\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  294</span>        <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  295</span>    }</div>
 <div class="line"><span class="lineno">  296</span> </div>
 <div class="line"><span class="lineno">  297</span>    <span class="keywordtype">int</span> n, degree = argc - 1;              <span class="comment">// detected polynomial degree</span></div>
-<div class="line"><span class="lineno">  298</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> coeffs(degree);  <span class="comment">// create coefficiencts array</span></div>
+<div class="line"><span class="lineno">  298</span>    std::valarray&lt;double&gt; coeffs(degree);  <span class="comment">// create coefficiencts array</span></div>
 <div class="line"><span class="lineno">  299</span> </div>
 <div class="line"><span class="lineno">  300</span>    <span class="comment">// number of roots = degree - 1</span></div>
-<div class="line"><span class="lineno">  301</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;std::complex&lt;double&gt;</a>&gt; s0(degree - 1);</div>
+<div class="line"><span class="lineno">  301</span>    std::valarray&lt;std::complex&lt;double&gt;&gt; s0(degree - 1);</div>
 <div class="line"><span class="lineno">  302</span> </div>
-<div class="line"><span class="lineno">  303</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Computing the roots for:\n\t&quot;</span>;</div>
+<div class="line"><span class="lineno">  303</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Computing the roots for:\n\t&quot;</span>;</div>
 <div class="line"><span class="lineno">  304</span>    <span class="keywordflow">for</span> (n = 0; n &lt; degree; n++) {</div>
-<div class="line"><span class="lineno">  305</span>        coeffs[n] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strtof.html">strtod</a>(argv[n + 1], <span class="keyword">nullptr</span>);</div>
+<div class="line"><span class="lineno">  305</span>        coeffs[n] = strtod(argv[n + 1], <span class="keyword">nullptr</span>);</div>
 <div class="line"><span class="lineno">  306</span>        <span class="keywordflow">if</span> (n &lt; degree - 1 &amp;&amp; coeffs[n] != 0)</div>
-<div class="line"><span class="lineno">  307</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; coeffs[n] &lt;&lt; <span class="stringliteral">&quot;) x^&quot;</span> &lt;&lt; degree - n - 1 &lt;&lt; <span class="stringliteral">&quot; + &quot;</span>;</div>
+<div class="line"><span class="lineno">  307</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; coeffs[n] &lt;&lt; <span class="stringliteral">&quot;) x^&quot;</span> &lt;&lt; degree - n - 1 &lt;&lt; <span class="stringliteral">&quot; + &quot;</span>;</div>
 <div class="line"><span class="lineno">  308</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (coeffs[n] != 0)</div>
-<div class="line"><span class="lineno">  309</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; coeffs[n] &lt;&lt; <span class="stringliteral">&quot;) x^&quot;</span> &lt;&lt; degree - n - 1</div>
+<div class="line"><span class="lineno">  309</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; coeffs[n] &lt;&lt; <span class="stringliteral">&quot;) x^&quot;</span> &lt;&lt; degree - n - 1</div>
 <div class="line"><span class="lineno">  310</span>                      &lt;&lt; <span class="stringliteral">&quot; = 0\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  311</span> </div>
 <div class="line"><span class="lineno">  312</span>        <span class="comment">/* initialize root approximations with random values */</span></div>
 <div class="line"><span class="lineno">  313</span>        <span class="keywordflow">if</span> (n &lt; degree - 1) {</div>
-<div class="line"><span class="lineno">  314</span>            s0[n] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 100, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 100);</div>
+<div class="line"><span class="lineno">  314</span>            s0[n] = std::complex&lt;double&gt;(std::rand() % 100, std::rand() % 100);</div>
 <div class="line"><span class="lineno">  315</span>            s0[n] -= 50.f;</div>
 <div class="line"><span class="lineno">  316</span>            s0[n] /= 50.f;</div>
 <div class="line"><span class="lineno">  317</span>        }</div>
@@ -468,30 +475,24 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  324</span>        coeffs /= tmp;</div>
 <div class="line"><span class="lineno">  325</span>    }</div>
 <div class="line"><span class="lineno">  326</span> </div>
-<div class="line"><span class="lineno">  327</span>    clock_t end_time, start_time = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">clock</a>();</div>
+<div class="line"><span class="lineno">  327</span>    clock_t end_time, start_time = clock();</div>
 <div class="line"><span class="lineno">  328</span>    <span class="keyword">auto</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="#a2c35b320ace8677f9b331faf94f8b2fd">durand_kerner_algo</a>(coeffs, &amp;s0, <span class="keyword">true</span>);</div>
-<div class="line"><span class="lineno">  329</span>    end_time = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">clock</a>();</div>
+<div class="line"><span class="lineno">  329</span>    end_time = clock();</div>
 <div class="line"><span class="lineno">  330</span> </div>
-<div class="line"><span class="lineno">  331</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nIterations: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.first &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  331</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nIterations: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.first &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  332</span>    <span class="keywordflow">for</span> (n = 0; n &lt; degree - 1; n++)</div>
-<div class="line"><span class="lineno">  333</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; <a class="code hl_function" href="#a90219e35062007d1f1b68e9af071ab5c">complex_str</a>(s0[n]) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  334</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;absolute average change: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.second &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  335</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Time taken: &quot;</span></div>
+<div class="line"><span class="lineno">  333</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; <a class="code hl_function" href="#a90219e35062007d1f1b68e9af071ab5c">complex_str</a>(s0[n]) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  334</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;absolute average change: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.second &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  335</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Time taken: &quot;</span></div>
 <div class="line"><span class="lineno">  336</span>              &lt;&lt; <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end_time - start_time) / CLOCKS_PER_SEC</div>
 <div class="line"><span class="lineno">  337</span>              &lt;&lt; <span class="stringliteral">&quot; sec\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  338</span> </div>
 <div class="line"><span class="lineno">  339</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  340</span>}</div>
-<div class="ttc" id="aclock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a></div><div class="ttdeci">T clock(T... args)</div></div>
-<div class="ttc" id="adurand__kerner__roots_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> durand_kerner_roots.cpp:243</div></div>
-<div class="ttc" id="adurand__kerner__roots_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition</b> durand_kerner_roots.cpp:208</div></div>
-<div class="ttc" id="adurand__kerner__roots_8cpp_html_a2c35b320ace8677f9b331faf94f8b2fd"><div class="ttname"><a href="#a2c35b320ace8677f9b331faf94f8b2fd">durand_kerner_algo</a></div><div class="ttdeci">std::pair&lt; uint32_t, double &gt; durand_kerner_algo(const std::valarray&lt; double &gt; &amp;coeffs, std::valarray&lt; std::complex&lt; double &gt; &gt; *roots, bool write_log=false)</div><div class="ttdef"><b>Definition</b> durand_kerner_roots.cpp:110</div></div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="astrtof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strtof.html">std::strtod</a></div><div class="ttdeci">T strtod(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></div></div>
+<div class="ttc" id="adurand__kerner__roots_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> <a href="../../da/df2/durand__kerner__roots_8cpp_source.html#l00243">durand_kerner_roots.cpp:243</a></div></div>
+<div class="ttc" id="adurand__kerner__roots_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition</b> <a href="../../da/df2/durand__kerner__roots_8cpp_source.html#l00208">durand_kerner_roots.cpp:208</a></div></div>
+<div class="ttc" id="adurand__kerner__roots_8cpp_html_a2c35b320ace8677f9b331faf94f8b2fd"><div class="ttname"><a href="#a2c35b320ace8677f9b331faf94f8b2fd">durand_kerner_algo</a></div><div class="ttdeci">std::pair&lt; uint32_t, double &gt; durand_kerner_algo(const std::valarray&lt; double &gt; &amp;coeffs, std::valarray&lt; std::complex&lt; double &gt; &gt; *roots, bool write_log=false)</div><div class="ttdef"><b>Definition</b> <a href="../../da/df2/durand__kerner__roots_8cpp_source.html#l00110">durand_kerner_roots.cpp:110</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -502,14 +503,14 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt; poly_function </td>
+          <td class="memname">std::complex&lt; double &gt; poly_function </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>coeffs</em></span>, </td>
+          <td class="paramtype">const std::valarray&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>coeffs</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; double &gt;</td>          <td class="paramname"><span class="paramname"><em>x</em></span>&#160;)</td>
+          <td class="paramtype">std::complex&lt; double &gt;</td>          <td class="paramname"><span class="paramname"><em>x</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -521,6 +522,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>\(f(x)\) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/df2/durand__kerner__roots_8cpp_source.html#l00054">54</a> of file <a class="el" href="../../da/df2/durand__kerner__roots_8cpp_source.html">durand_kerner_roots.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   55</span>                                                         {</div>
 <div class="line"><span class="lineno">   56</span>    <span class="keywordtype">double</span> real = 0.f, imag = 0.f;</div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordtype">int</span> n;</div>
@@ -529,21 +532,15 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   60</span>    <span class="comment">// #pragma omp target teams distribute reduction(+ : real, imag)</span></div>
 <div class="line"><span class="lineno">   61</span>    <span class="comment">// #endif</span></div>
 <div class="line"><span class="lineno">   62</span>    <span class="keywordflow">for</span> (n = 0; n &lt; coeffs.size(); n++) {</div>
-<div class="line"><span class="lineno">   63</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a> tmp =</div>
-<div class="line"><span class="lineno">   64</span>            coeffs[n] * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(x, coeffs.size() - n - 1);</div>
-<div class="line"><span class="lineno">   65</span>        real += tmp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">real</a>();</div>
-<div class="line"><span class="lineno">   66</span>        imag += tmp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">imag</a>();</div>
+<div class="line"><span class="lineno">   63</span>        std::complex&lt;double&gt; tmp =</div>
+<div class="line"><span class="lineno">   64</span>            coeffs[n] * std::pow(x, coeffs.size() - n - 1);</div>
+<div class="line"><span class="lineno">   65</span>        real += tmp.real();</div>
+<div class="line"><span class="lineno">   66</span>        imag += tmp.imag();</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> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>(real, imag);</div>
+<div class="line"><span class="lineno">   69</span>    <span class="keywordflow">return</span> std::complex&lt;double&gt;(real, imag);</div>
 <div class="line"><span class="lineno">   70</span>}</div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/df2/durand__kerner__roots_8cpp_ae2ab49ba1969d7a5988f9bc2c8924569_cgraph.svg" width="290" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1440a7779ac56f47a3f355ce4a8c7da0" name="a1440a7779ac56f47a3f355ce4a8c7da0"></a>
@@ -561,17 +558,19 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Self test the algorithm by checking the roots for \(x^2+4=0\) to which the roots are \(0 \pm 2i\) </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/df2/durand__kerner__roots_8cpp_source.html#l00208">208</a> of file <a class="el" href="../../da/df2/durand__kerner__roots_8cpp_source.html">durand_kerner_roots.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  208</span>             {</div>
-<div class="line"><span class="lineno">  209</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> coeffs = {1, 0, 4};  <span class="comment">// x^2 - 2 = 0</span></div>
-<div class="line"><span class="lineno">  210</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;std::complex&lt;double&gt;</a>&gt; roots(2);</div>
-<div class="line"><span class="lineno">  211</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;std::complex&lt;double&gt;</a>&gt; expected = {</div>
-<div class="line"><span class="lineno">  212</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>(0., 2.),</div>
-<div class="line"><span class="lineno">  213</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>(0., -2.)  <span class="comment">// known expected roots</span></div>
+<div class="line"><span class="lineno">  209</span>    <span class="keyword">const</span> std::valarray&lt;double&gt; coeffs = {1, 0, 4};  <span class="comment">// x^2 - 2 = 0</span></div>
+<div class="line"><span class="lineno">  210</span>    std::valarray&lt;std::complex&lt;double&gt;&gt; roots(2);</div>
+<div class="line"><span class="lineno">  211</span>    std::valarray&lt;std::complex&lt;double&gt;&gt; expected = {</div>
+<div class="line"><span class="lineno">  212</span>        std::complex&lt;double&gt;(0., 2.),</div>
+<div class="line"><span class="lineno">  213</span>        std::complex&lt;double&gt;(0., -2.)  <span class="comment">// known expected roots</span></div>
 <div class="line"><span class="lineno">  214</span>    };</div>
 <div class="line"><span class="lineno">  215</span> </div>
 <div class="line"><span class="lineno">  216</span>    <span class="comment">/* initialize root approximations with random values */</span></div>
 <div class="line"><span class="lineno">  217</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> n = 0; n &lt; roots.size(); n++) {</div>
-<div class="line"><span class="lineno">  218</span>        roots[n] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 100, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 100);</div>
+<div class="line"><span class="lineno">  218</span>        roots[n] = std::complex&lt;double&gt;(std::rand() % 100, std::rand() % 100);</div>
 <div class="line"><span class="lineno">  219</span>        roots[n] -= 50.f;</div>
 <div class="line"><span class="lineno">  220</span>        roots[n] /= 25.f;</div>
 <div class="line"><span class="lineno">  221</span>    }</div>
@@ -587,16 +586,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  231</span>        assert(err1);</div>
 <div class="line"><span class="lineno">  232</span>    }</div>
 <div class="line"><span class="lineno">  233</span> </div>
-<div class="line"><span class="lineno">  234</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 passed! - &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.first &lt;&lt; <span class="stringliteral">&quot; iterations, &quot;</span></div>
+<div class="line"><span class="lineno">  234</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 passed! - &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.first &lt;&lt; <span class="stringliteral">&quot; iterations, &quot;</span></div>
 <div class="line"><span class="lineno">  235</span>              &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.second &lt;&lt; <span class="stringliteral">&quot; accuracy&quot;</span></div>
 <div class="line"><span class="lineno">  236</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  237</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg" width="623" height="431"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0283886819c7c140a023582b7269e2d0" name="a0283886819c7c140a023582b7269e2d0"></a>
@@ -614,18 +608,20 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Self test the algorithm by checking the roots for \(0.015625x^3-1=0\) to which the roots are \((4+0i),\,(-2\pm3.464i)\) </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/df2/durand__kerner__roots_8cpp_source.html#l00243">243</a> of file <a class="el" href="../../da/df2/durand__kerner__roots_8cpp_source.html">durand_kerner_roots.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  243</span>             {</div>
-<div class="line"><span class="lineno">  244</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> coeffs = {<span class="comment">// 0.015625 x^3 - 1 = 0</span></div>
+<div class="line"><span class="lineno">  244</span>    <span class="keyword">const</span> std::valarray&lt;double&gt; coeffs = {<span class="comment">// 0.015625 x^3 - 1 = 0</span></div>
 <div class="line"><span class="lineno">  245</span>                                          1. / 64., 0., 0., -1.};</div>
-<div class="line"><span class="lineno">  246</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;std::complex&lt;double&gt;</a>&gt; roots(3);</div>
-<div class="line"><span class="lineno">  247</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;std::complex&lt;double&gt;</a>&gt; expected = {</div>
-<div class="line"><span class="lineno">  248</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>(4., 0.), <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>(-2., 3.46410162),</div>
-<div class="line"><span class="lineno">  249</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>(-2., -3.46410162)  <span class="comment">// known expected roots</span></div>
+<div class="line"><span class="lineno">  246</span>    std::valarray&lt;std::complex&lt;double&gt;&gt; roots(3);</div>
+<div class="line"><span class="lineno">  247</span>    <span class="keyword">const</span> std::valarray&lt;std::complex&lt;double&gt;&gt; expected = {</div>
+<div class="line"><span class="lineno">  248</span>        std::complex&lt;double&gt;(4., 0.), std::complex&lt;double&gt;(-2., 3.46410162),</div>
+<div class="line"><span class="lineno">  249</span>        std::complex&lt;double&gt;(-2., -3.46410162)  <span class="comment">// known expected roots</span></div>
 <div class="line"><span class="lineno">  250</span>    };</div>
 <div class="line"><span class="lineno">  251</span> </div>
 <div class="line"><span class="lineno">  252</span>    <span class="comment">/* initialize root approximations with random values */</span></div>
 <div class="line"><span class="lineno">  253</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> n = 0; n &lt; roots.size(); n++) {</div>
-<div class="line"><span class="lineno">  254</span>        roots[n] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;double&gt;</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 100, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 100);</div>
+<div class="line"><span class="lineno">  254</span>        roots[n] = std::complex&lt;double&gt;(std::rand() % 100, std::rand() % 100);</div>
 <div class="line"><span class="lineno">  255</span>        roots[n] -= 50.f;</div>
 <div class="line"><span class="lineno">  256</span>        roots[n] /= 25.f;</div>
 <div class="line"><span class="lineno">  257</span>    }</div>
@@ -641,16 +637,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  267</span>        assert(err1);</div>
 <div class="line"><span class="lineno">  268</span>    }</div>
 <div class="line"><span class="lineno">  269</span> </div>
-<div class="line"><span class="lineno">  270</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2 passed! - &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.first &lt;&lt; <span class="stringliteral">&quot; iterations, &quot;</span></div>
+<div class="line"><span class="lineno">  270</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 passed! - &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.first &lt;&lt; <span class="stringliteral">&quot; iterations, &quot;</span></div>
 <div class="line"><span class="lineno">  271</span>              &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.second &lt;&lt; <span class="stringliteral">&quot; accuracy&quot;</span></div>
 <div class="line"><span class="lineno">  272</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  273</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg" width="623" height="431"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
deleted file mode 100644
index d98a695b1..000000000
--- a/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
+++ /dev/null
@@ -1,35 +0,0 @@
-<map id="test2" name="test2">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,228,56,254"/>
-<area shape="rect" id="Node000002" href="$da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd" title=" " alt="" coords="104,203,238,228"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,234,88,228,89,233,56,239"/>
-<area shape="rect" id="Node000016" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="135,252,207,278"/>
-<area shape="poly" id="edge17_Node000001_Node000016" title=" " alt="" coords="56,242,120,254,119,259,55,248"/>
-<area shape="rect" id="Node000003" href="$da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377" title=" " alt="" coords="298,5,425,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="175,201,189,169,212,126,244,80,284,40,289,37,292,41,288,44,248,83,217,128,194,171,180,204"/>
-<area shape="rect" id="Node000004" href="$da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c" title=" " alt="" coords="316,104,408,130"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="188,200,231,170,285,138,300,132,302,137,287,143,234,174,191,204"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="328,153,396,179"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="223,199,312,176,313,181,224,205"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="286,203,437,228"/>
-<area shape="poly" id="edge8_Node000002_Node000009" title=" " alt="" coords="239,213,270,213,270,218,239,218"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/isinf.html#" title=" " alt="" coords="326,252,397,278"/>
-<area shape="poly" id="edge9_Node000002_Node000010" title=" " alt="" coords="224,226,312,249,310,254,223,232"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/isnan.html#" title=" " alt="" coords="322,301,401,327"/>
-<area shape="poly" id="edge10_Node000002_Node000011" title=" " alt="" coords="219,227,239,237,255,250,264,263,273,276,287,288,309,298,306,303,285,292,269,279,260,267,251,254,237,242,217,231"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="326,351,398,376"/>
-<area shape="poly" id="edge11_Node000002_Node000012" title=" " alt="" coords="224,227,240,237,251,250,258,264,264,289,270,314,277,326,288,337,312,352,310,356,284,342,273,329,265,316,259,290,253,265,247,253,236,242,221,231"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="294,400,429,426"/>
-<area shape="poly" id="edge12_Node000002_Node000013" title=" " alt="" coords="226,227,240,238,254,257,262,277,264,314,267,351,274,369,288,387,290,389,286,393,284,391,269,372,262,352,259,315,256,278,250,260,236,241,222,231"/>
-<area shape="rect" id="Node000014" href="$da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569" title=" " alt="" coords="312,55,411,80"/>
-<area shape="poly" id="edge13_Node000002_Node000014" title=" " alt="" coords="179,201,220,147,250,116,285,89,297,82,299,87,287,94,254,120,224,151,183,204"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/imag.html#" title=" " alt="" coords="485,55,618,80"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="408,102,484,82,485,87,409,107"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/real.html#" title=" " alt="" coords="489,104,614,130"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="408,114,473,114,473,120,408,120"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/c/fprintf.html#" title=" " alt="" coords="506,153,597,179"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="409,126,492,148,490,153,408,131"/>
-<area shape="poly" id="edge14_Node000014_Node000005" title=" " alt="" coords="411,65,470,65,470,70,411,70"/>
-<area shape="poly" id="edge16_Node000014_Node000006" title=" " alt="" coords="412,78,486,97,484,102,411,83"/>
-<area shape="rect" id="Node000015" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="516,5,587,31"/>
-<area shape="poly" id="edge15_Node000014_Node000015" title=" " alt="" coords="411,52,500,29,502,34,412,57"/>
-</map>
diff --git a/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
deleted file mode 100644
index a6c79582a..000000000
--- a/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9497ddabf33a67575cb55954b5500841
\ No newline at end of file
diff --git a/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
deleted file mode 100644
index 82c58f396..000000000
--- a/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
+++ /dev/null
@@ -1,335 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="467pt" height="323pt"
- viewBox="0.00 0.00 467.25 323.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 319.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-148.25 0,-148.25 0,-129 37.75,-129 37.75,-148.25"/>
-<text text-anchor="middle" x="18.88" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="174.5,-167.25 73.75,-167.25 73.75,-148 174.5,-148 174.5,-167.25"/>
-<text text-anchor="middle" x="124.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">durand_kerner_algo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.86,-141.93C44.85,-143.22 53.29,-144.77 62.11,-146.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.45,-149.83 71.92,-148.2 62.72,-142.95 61.45,-149.83"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.25,-130.25 97,-130.25 97,-111 151.25,-111 151.25,-130.25"/>
-<text text-anchor="middle" x="124.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge17_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge17_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.86,-135.49C51.1,-133.18 69.56,-129.96 85.93,-127.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.09,-130.63 95.34,-125.47 84.88,-123.74 86.09,-130.63"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="315,-315.25 219.5,-315.25 219.5,-296 315,-296 315,-315.25"/>
-<text text-anchor="middle" x="267.25" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">check_termination</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.84,-167.41C138.49,-191.51 166.68,-254.25 210.5,-287.62 211.66,-288.51 212.87,-289.35 214.11,-290.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.39,-293.2 222.86,-294.82 215.68,-287.02 212.39,-293.2"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="301.88,-241.25 232.62,-241.25 232.62,-222 301.88,-222 301.88,-241.25"/>
-<text text-anchor="middle" x="267.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">complex_str</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.07,-167.72C154.25,-179.95 183.16,-200.54 210.5,-213.62 214.05,-215.32 217.8,-216.92 221.6,-218.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.35,-221.67 230.95,-221.78 222.73,-215.09 220.35,-221.67"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.88,-204.25 241.62,-204.25 241.62,-185 292.88,-185 292.88,-204.25"/>
-<text text-anchor="middle" x="267.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.69,-167.74C184.52,-173.2 210.08,-179.9 230.47,-185.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.48,-188.6 240.04,-187.75 231.26,-181.83 229.48,-188.6"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324,-167.25 210.5,-167.25 210.5,-148 324,-148 324,-167.25"/>
-<text text-anchor="middle" x="267.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.88,-157.62C182.65,-157.62 190.78,-157.62 198.86,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.69,-161.13 208.69,-157.63 198.69,-154.13 198.69,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isinf.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-130.25 240.5,-130.25 240.5,-111 294,-111 294,-130.25"/>
-<text text-anchor="middle" x="267.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::isinf</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge9_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.69,-147.51C184.11,-142.16 209.08,-135.61 229.26,-130.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.97,-133.75 238.76,-127.83 228.2,-126.98 229.97,-133.75"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isnan.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.62,-93.25 237.88,-93.25 237.88,-74 296.62,-74 296.62,-93.25"/>
-<text text-anchor="middle" x="267.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::isnan</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge10_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge10_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.33,-147.52C164.61,-145.3 169.85,-142.68 174.5,-139.62 193.95,-126.86 190.82,-114.03 210.5,-101.62 215.48,-98.49 221.06,-95.85 226.71,-93.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.79,-96.97 236.1,-90.41 225.51,-90.35 227.79,-96.97"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294.38,-56.25 240.12,-56.25 240.12,-37 294.38,-37 294.38,-56.25"/>
-<text text-anchor="middle" x="267.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge11_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge11_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.52,-147.62C166.86,-145.45 170.98,-142.81 174.5,-139.62 201.89,-114.79 182.65,-88.94 210.5,-64.62 215.88,-59.93 222.5,-56.45 229.28,-53.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.97,-57.34 238.46,-51 227.87,-50.66 229.97,-57.34"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="317.62,-19.25 216.88,-19.25 216.88,0 317.62,0 317.62,-19.25"/>
-<text text-anchor="middle" x="267.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node13 -->
-<g id="edge12_Node000002_Node000013" class="edge">
-<title>Node2&#45;&gt;Node13</title>
-<g id="a_edge12_Node000002_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.93,-147.54C167.83,-145.39 171.46,-142.78 174.5,-139.62 210.75,-101.95 173.55,-64.62 210.5,-27.62 210.99,-27.13 211.5,-26.65 212.02,-26.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.91,-29.13 220.14,-20.56 209.92,-23.38 213.91,-29.13"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.12,-278.25 230.38,-278.25 230.38,-259 304.12,-259 304.12,-278.25"/>
-<text text-anchor="middle" x="267.25" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">poly_function</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node14 -->
-<g id="edge13_Node000002_Node000014" class="edge">
-<title>Node2&#45;&gt;Node14</title>
-<g id="a_edge13_Node000002_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.62,-167.6C144.45,-186.53 174.89,-227.79 210.5,-250.62 213.36,-252.46 216.43,-254.12 219.59,-255.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.95,-258.73 228.53,-259.33 220.63,-252.27 217.95,-258.73"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="459.25,-278.25 360,-278.25 360,-259 459.25,-259 459.25,-278.25"/>
-<text text-anchor="middle" x="409.62" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.23,-240.58C319.31,-245.08 340.33,-250.62 359.16,-255.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="358.23,-258.96 368.79,-258.12 360.01,-252.19 358.23,-258.96"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="456.62,-241.25 362.62,-241.25 362.62,-222 456.62,-222 456.62,-241.25"/>
-<text text-anchor="middle" x="409.62" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.23,-231.62C316.87,-231.62 334.4,-231.62 350.96,-231.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.72,-235.13 360.72,-231.63 350.72,-228.13 350.72,-235.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/fprintf.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="443.5,-204.25 375.75,-204.25 375.75,-185 443.5,-185 443.5,-204.25"/>
-<text text-anchor="middle" x="409.62" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::snprintf</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.23,-222.67C320.9,-217.75 344.28,-211.58 364.37,-206.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.2,-209.69 373.98,-203.76 363.42,-202.92 365.2,-209.69"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node5 -->
-<g id="edge14_Node000014_Node000005" class="edge">
-<title>Node14&#45;&gt;Node5</title>
-<g id="a_edge14_Node000014_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.4,-268.62C317.8,-268.62 333.38,-268.62 348.35,-268.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.12,-272.13 358.12,-268.63 348.12,-265.13 348.12,-272.13"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node6 -->
-<g id="edge16_Node000014_Node000006" class="edge">
-<title>Node14&#45;&gt;Node6</title>
-<g id="a_edge16_Node000014_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.4,-259.1C321.22,-254.66 341.48,-249.32 359.64,-244.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="360.39,-247.96 369.17,-242.02 358.61,-241.19 360.39,-247.96"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="436.38,-315.25 382.88,-315.25 382.88,-296 436.38,-296 436.38,-315.25"/>
-<text text-anchor="middle" x="409.62" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge15_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge15_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.4,-278.15C325.1,-283.61 351.01,-290.44 371.82,-295.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="370.76,-299.26 381.33,-298.43 372.55,-292.5 370.76,-299.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
deleted file mode 100644
index 0664c7cf2..000000000
--- a/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
+++ /dev/null
@@ -1,309 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="467pt" height="323pt"
- viewBox="0.00 0.00 467.25 323.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 319.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-148.25 0,-148.25 0,-129 37.75,-129 37.75,-148.25"/>
-<text text-anchor="middle" x="18.88" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="174.5,-167.25 73.75,-167.25 73.75,-148 174.5,-148 174.5,-167.25"/>
-<text text-anchor="middle" x="124.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">durand_kerner_algo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.86,-141.93C44.85,-143.22 53.29,-144.77 62.11,-146.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.45,-149.83 71.92,-148.2 62.72,-142.95 61.45,-149.83"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.25,-130.25 97,-130.25 97,-111 151.25,-111 151.25,-130.25"/>
-<text text-anchor="middle" x="124.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge17_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge17_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.86,-135.49C51.1,-133.18 69.56,-129.96 85.93,-127.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.09,-130.63 95.34,-125.47 84.88,-123.74 86.09,-130.63"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="315,-315.25 219.5,-315.25 219.5,-296 315,-296 315,-315.25"/>
-<text text-anchor="middle" x="267.25" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">check_termination</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.84,-167.41C138.49,-191.51 166.68,-254.25 210.5,-287.62 211.66,-288.51 212.87,-289.35 214.11,-290.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.39,-293.2 222.86,-294.82 215.68,-287.02 212.39,-293.2"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="301.88,-241.25 232.62,-241.25 232.62,-222 301.88,-222 301.88,-241.25"/>
-<text text-anchor="middle" x="267.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">complex_str</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.07,-167.72C154.25,-179.95 183.16,-200.54 210.5,-213.62 214.05,-215.32 217.8,-216.92 221.6,-218.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.35,-221.67 230.95,-221.78 222.73,-215.09 220.35,-221.67"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.88,-204.25 241.62,-204.25 241.62,-185 292.88,-185 292.88,-204.25"/>
-<text text-anchor="middle" x="267.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.69,-167.74C184.52,-173.2 210.08,-179.9 230.47,-185.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.48,-188.6 240.04,-187.75 231.26,-181.83 229.48,-188.6"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324,-167.25 210.5,-167.25 210.5,-148 324,-148 324,-167.25"/>
-<text text-anchor="middle" x="267.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.88,-157.62C182.65,-157.62 190.78,-157.62 198.86,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.69,-161.13 208.69,-157.63 198.69,-154.13 198.69,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isinf.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-130.25 240.5,-130.25 240.5,-111 294,-111 294,-130.25"/>
-<text text-anchor="middle" x="267.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::isinf</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge9_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.69,-147.51C184.11,-142.16 209.08,-135.61 229.26,-130.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.97,-133.75 238.76,-127.83 228.2,-126.98 229.97,-133.75"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isnan.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.62,-93.25 237.88,-93.25 237.88,-74 296.62,-74 296.62,-93.25"/>
-<text text-anchor="middle" x="267.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::isnan</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge10_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge10_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.33,-147.52C164.61,-145.3 169.85,-142.68 174.5,-139.62 193.95,-126.86 190.82,-114.03 210.5,-101.62 215.48,-98.49 221.06,-95.85 226.71,-93.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.79,-96.97 236.1,-90.41 225.51,-90.35 227.79,-96.97"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294.38,-56.25 240.12,-56.25 240.12,-37 294.38,-37 294.38,-56.25"/>
-<text text-anchor="middle" x="267.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge11_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge11_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.52,-147.62C166.86,-145.45 170.98,-142.81 174.5,-139.62 201.89,-114.79 182.65,-88.94 210.5,-64.62 215.88,-59.93 222.5,-56.45 229.28,-53.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.97,-57.34 238.46,-51 227.87,-50.66 229.97,-57.34"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="317.62,-19.25 216.88,-19.25 216.88,0 317.62,0 317.62,-19.25"/>
-<text text-anchor="middle" x="267.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node13 -->
-<g id="edge12_Node000002_Node000013" class="edge">
-<title>Node2&#45;&gt;Node13</title>
-<g id="a_edge12_Node000002_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.93,-147.54C167.83,-145.39 171.46,-142.78 174.5,-139.62 210.75,-101.95 173.55,-64.62 210.5,-27.62 210.99,-27.13 211.5,-26.65 212.02,-26.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.91,-29.13 220.14,-20.56 209.92,-23.38 213.91,-29.13"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.12,-278.25 230.38,-278.25 230.38,-259 304.12,-259 304.12,-278.25"/>
-<text text-anchor="middle" x="267.25" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">poly_function</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node14 -->
-<g id="edge13_Node000002_Node000014" class="edge">
-<title>Node2&#45;&gt;Node14</title>
-<g id="a_edge13_Node000002_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.62,-167.6C144.45,-186.53 174.89,-227.79 210.5,-250.62 213.36,-252.46 216.43,-254.12 219.59,-255.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.95,-258.73 228.53,-259.33 220.63,-252.27 217.95,-258.73"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="459.25,-278.25 360,-278.25 360,-259 459.25,-259 459.25,-278.25"/>
-<text text-anchor="middle" x="409.62" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.23,-240.58C319.31,-245.08 340.33,-250.62 359.16,-255.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="358.23,-258.96 368.79,-258.12 360.01,-252.19 358.23,-258.96"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="456.62,-241.25 362.62,-241.25 362.62,-222 456.62,-222 456.62,-241.25"/>
-<text text-anchor="middle" x="409.62" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.23,-231.62C316.87,-231.62 334.4,-231.62 350.96,-231.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.72,-235.13 360.72,-231.63 350.72,-228.13 350.72,-235.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/fprintf.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="443.5,-204.25 375.75,-204.25 375.75,-185 443.5,-185 443.5,-204.25"/>
-<text text-anchor="middle" x="409.62" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::snprintf</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.23,-222.67C320.9,-217.75 344.28,-211.58 364.37,-206.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.2,-209.69 373.98,-203.76 363.42,-202.92 365.2,-209.69"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node5 -->
-<g id="edge14_Node000014_Node000005" class="edge">
-<title>Node14&#45;&gt;Node5</title>
-<g id="a_edge14_Node000014_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.4,-268.62C317.8,-268.62 333.38,-268.62 348.35,-268.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.12,-272.13 358.12,-268.63 348.12,-265.13 348.12,-272.13"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node6 -->
-<g id="edge16_Node000014_Node000006" class="edge">
-<title>Node14&#45;&gt;Node6</title>
-<g id="a_edge16_Node000014_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.4,-259.1C321.22,-254.66 341.48,-249.32 359.64,-244.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="360.39,-247.96 369.17,-242.02 358.61,-241.19 360.39,-247.96"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="436.38,-315.25 382.88,-315.25 382.88,-296 436.38,-296 436.38,-315.25"/>
-<text text-anchor="middle" x="409.62" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge15_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge15_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.4,-278.15C325.1,-283.61 351.01,-290.44 371.82,-295.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="370.76,-299.26 381.33,-298.43 372.55,-292.5 370.76,-299.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
deleted file mode 100644
index 5fd7b4301..000000000
--- a/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
+++ /dev/null
@@ -1,35 +0,0 @@
-<map id="test1" name="test1">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,228,56,254"/>
-<area shape="rect" id="Node000002" href="$da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd" title=" " alt="" coords="104,203,238,228"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,234,88,228,89,233,56,239"/>
-<area shape="rect" id="Node000016" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="135,252,207,278"/>
-<area shape="poly" id="edge17_Node000001_Node000016" title=" " alt="" coords="56,242,120,254,119,259,55,248"/>
-<area shape="rect" id="Node000003" href="$da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377" title=" " alt="" coords="298,5,425,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="175,201,189,169,212,126,244,80,284,40,289,37,292,41,288,44,248,83,217,128,194,171,180,204"/>
-<area shape="rect" id="Node000004" href="$da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c" title=" " alt="" coords="316,104,408,130"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="188,200,231,170,285,138,300,132,302,137,287,143,234,174,191,204"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="328,153,396,179"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="223,199,312,176,313,181,224,205"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="286,203,437,228"/>
-<area shape="poly" id="edge8_Node000002_Node000009" title=" " alt="" coords="239,213,270,213,270,218,239,218"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/isinf.html#" title=" " alt="" coords="326,252,397,278"/>
-<area shape="poly" id="edge9_Node000002_Node000010" title=" " alt="" coords="224,226,312,249,310,254,223,232"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/isnan.html#" title=" " alt="" coords="322,301,401,327"/>
-<area shape="poly" id="edge10_Node000002_Node000011" title=" " alt="" coords="219,227,239,237,255,250,264,263,273,276,287,288,309,298,306,303,285,292,269,279,260,267,251,254,237,242,217,231"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="326,351,398,376"/>
-<area shape="poly" id="edge11_Node000002_Node000012" title=" " alt="" coords="224,227,240,237,251,250,258,264,264,289,270,314,277,326,288,337,312,352,310,356,284,342,273,329,265,316,259,290,253,265,247,253,236,242,221,231"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="294,400,429,426"/>
-<area shape="poly" id="edge12_Node000002_Node000013" title=" " alt="" coords="226,227,240,238,254,257,262,277,264,314,267,351,274,369,288,387,290,389,286,393,284,391,269,372,262,352,259,315,256,278,250,260,236,241,222,231"/>
-<area shape="rect" id="Node000014" href="$da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569" title=" " alt="" coords="312,55,411,80"/>
-<area shape="poly" id="edge13_Node000002_Node000014" title=" " alt="" coords="179,201,220,147,250,116,285,89,297,82,299,87,287,94,254,120,224,151,183,204"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/imag.html#" title=" " alt="" coords="485,55,618,80"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="408,102,484,82,485,87,409,107"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/real.html#" title=" " alt="" coords="489,104,614,130"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="408,114,473,114,473,120,408,120"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/c/fprintf.html#" title=" " alt="" coords="506,153,597,179"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="409,126,492,148,490,153,408,131"/>
-<area shape="poly" id="edge14_Node000014_Node000005" title=" " alt="" coords="411,65,470,65,470,70,411,70"/>
-<area shape="poly" id="edge16_Node000014_Node000006" title=" " alt="" coords="412,78,486,97,484,102,411,83"/>
-<area shape="rect" id="Node000015" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="516,5,587,31"/>
-<area shape="poly" id="edge15_Node000014_Node000015" title=" " alt="" coords="411,52,500,29,502,34,412,57"/>
-</map>
diff --git a/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
deleted file mode 100644
index 1ae57325b..000000000
--- a/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-85d293a7a159a1a01ba132fccd4cc405
\ No newline at end of file
diff --git a/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg b/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
deleted file mode 100644
index 92143fcaf..000000000
--- a/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
+++ /dev/null
@@ -1,335 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="467pt" height="323pt"
- viewBox="0.00 0.00 467.25 323.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 319.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-148.25 0,-148.25 0,-129 37.75,-129 37.75,-148.25"/>
-<text text-anchor="middle" x="18.88" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="174.5,-167.25 73.75,-167.25 73.75,-148 174.5,-148 174.5,-167.25"/>
-<text text-anchor="middle" x="124.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">durand_kerner_algo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.86,-141.93C44.85,-143.22 53.29,-144.77 62.11,-146.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.45,-149.83 71.92,-148.2 62.72,-142.95 61.45,-149.83"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.25,-130.25 97,-130.25 97,-111 151.25,-111 151.25,-130.25"/>
-<text text-anchor="middle" x="124.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge17_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge17_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.86,-135.49C51.1,-133.18 69.56,-129.96 85.93,-127.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.09,-130.63 95.34,-125.47 84.88,-123.74 86.09,-130.63"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="315,-315.25 219.5,-315.25 219.5,-296 315,-296 315,-315.25"/>
-<text text-anchor="middle" x="267.25" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">check_termination</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.84,-167.41C138.49,-191.51 166.68,-254.25 210.5,-287.62 211.66,-288.51 212.87,-289.35 214.11,-290.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.39,-293.2 222.86,-294.82 215.68,-287.02 212.39,-293.2"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="301.88,-241.25 232.62,-241.25 232.62,-222 301.88,-222 301.88,-241.25"/>
-<text text-anchor="middle" x="267.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">complex_str</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.07,-167.72C154.25,-179.95 183.16,-200.54 210.5,-213.62 214.05,-215.32 217.8,-216.92 221.6,-218.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.35,-221.67 230.95,-221.78 222.73,-215.09 220.35,-221.67"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.88,-204.25 241.62,-204.25 241.62,-185 292.88,-185 292.88,-204.25"/>
-<text text-anchor="middle" x="267.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.69,-167.74C184.52,-173.2 210.08,-179.9 230.47,-185.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.48,-188.6 240.04,-187.75 231.26,-181.83 229.48,-188.6"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324,-167.25 210.5,-167.25 210.5,-148 324,-148 324,-167.25"/>
-<text text-anchor="middle" x="267.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.88,-157.62C182.65,-157.62 190.78,-157.62 198.86,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.69,-161.13 208.69,-157.63 198.69,-154.13 198.69,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isinf.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-130.25 240.5,-130.25 240.5,-111 294,-111 294,-130.25"/>
-<text text-anchor="middle" x="267.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::isinf</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge9_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.69,-147.51C184.11,-142.16 209.08,-135.61 229.26,-130.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.97,-133.75 238.76,-127.83 228.2,-126.98 229.97,-133.75"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isnan.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.62,-93.25 237.88,-93.25 237.88,-74 296.62,-74 296.62,-93.25"/>
-<text text-anchor="middle" x="267.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::isnan</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge10_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge10_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.33,-147.52C164.61,-145.3 169.85,-142.68 174.5,-139.62 193.95,-126.86 190.82,-114.03 210.5,-101.62 215.48,-98.49 221.06,-95.85 226.71,-93.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.79,-96.97 236.1,-90.41 225.51,-90.35 227.79,-96.97"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294.38,-56.25 240.12,-56.25 240.12,-37 294.38,-37 294.38,-56.25"/>
-<text text-anchor="middle" x="267.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge11_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge11_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.52,-147.62C166.86,-145.45 170.98,-142.81 174.5,-139.62 201.89,-114.79 182.65,-88.94 210.5,-64.62 215.88,-59.93 222.5,-56.45 229.28,-53.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.97,-57.34 238.46,-51 227.87,-50.66 229.97,-57.34"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="317.62,-19.25 216.88,-19.25 216.88,0 317.62,0 317.62,-19.25"/>
-<text text-anchor="middle" x="267.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node13 -->
-<g id="edge12_Node000002_Node000013" class="edge">
-<title>Node2&#45;&gt;Node13</title>
-<g id="a_edge12_Node000002_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.93,-147.54C167.83,-145.39 171.46,-142.78 174.5,-139.62 210.75,-101.95 173.55,-64.62 210.5,-27.62 210.99,-27.13 211.5,-26.65 212.02,-26.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.91,-29.13 220.14,-20.56 209.92,-23.38 213.91,-29.13"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.12,-278.25 230.38,-278.25 230.38,-259 304.12,-259 304.12,-278.25"/>
-<text text-anchor="middle" x="267.25" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">poly_function</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node14 -->
-<g id="edge13_Node000002_Node000014" class="edge">
-<title>Node2&#45;&gt;Node14</title>
-<g id="a_edge13_Node000002_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.62,-167.6C144.45,-186.53 174.89,-227.79 210.5,-250.62 213.36,-252.46 216.43,-254.12 219.59,-255.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.95,-258.73 228.53,-259.33 220.63,-252.27 217.95,-258.73"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="459.25,-278.25 360,-278.25 360,-259 459.25,-259 459.25,-278.25"/>
-<text text-anchor="middle" x="409.62" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.23,-240.58C319.31,-245.08 340.33,-250.62 359.16,-255.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="358.23,-258.96 368.79,-258.12 360.01,-252.19 358.23,-258.96"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="456.62,-241.25 362.62,-241.25 362.62,-222 456.62,-222 456.62,-241.25"/>
-<text text-anchor="middle" x="409.62" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.23,-231.62C316.87,-231.62 334.4,-231.62 350.96,-231.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.72,-235.13 360.72,-231.63 350.72,-228.13 350.72,-235.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/fprintf.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="443.5,-204.25 375.75,-204.25 375.75,-185 443.5,-185 443.5,-204.25"/>
-<text text-anchor="middle" x="409.62" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::snprintf</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.23,-222.67C320.9,-217.75 344.28,-211.58 364.37,-206.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.2,-209.69 373.98,-203.76 363.42,-202.92 365.2,-209.69"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node5 -->
-<g id="edge14_Node000014_Node000005" class="edge">
-<title>Node14&#45;&gt;Node5</title>
-<g id="a_edge14_Node000014_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.4,-268.62C317.8,-268.62 333.38,-268.62 348.35,-268.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.12,-272.13 358.12,-268.63 348.12,-265.13 348.12,-272.13"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node6 -->
-<g id="edge16_Node000014_Node000006" class="edge">
-<title>Node14&#45;&gt;Node6</title>
-<g id="a_edge16_Node000014_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.4,-259.1C321.22,-254.66 341.48,-249.32 359.64,-244.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="360.39,-247.96 369.17,-242.02 358.61,-241.19 360.39,-247.96"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="436.38,-315.25 382.88,-315.25 382.88,-296 436.38,-296 436.38,-315.25"/>
-<text text-anchor="middle" x="409.62" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge15_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge15_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.4,-278.15C325.1,-283.61 351.01,-290.44 371.82,-295.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="370.76,-299.26 381.33,-298.43 372.55,-292.5 370.76,-299.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
deleted file mode 100644
index cbcedd04a..000000000
--- a/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
+++ /dev/null
@@ -1,309 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="467pt" height="323pt"
- viewBox="0.00 0.00 467.25 323.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 319.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-148.25 0,-148.25 0,-129 37.75,-129 37.75,-148.25"/>
-<text text-anchor="middle" x="18.88" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="174.5,-167.25 73.75,-167.25 73.75,-148 174.5,-148 174.5,-167.25"/>
-<text text-anchor="middle" x="124.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">durand_kerner_algo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.86,-141.93C44.85,-143.22 53.29,-144.77 62.11,-146.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.45,-149.83 71.92,-148.2 62.72,-142.95 61.45,-149.83"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.25,-130.25 97,-130.25 97,-111 151.25,-111 151.25,-130.25"/>
-<text text-anchor="middle" x="124.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge17_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge17_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.86,-135.49C51.1,-133.18 69.56,-129.96 85.93,-127.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.09,-130.63 95.34,-125.47 84.88,-123.74 86.09,-130.63"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="315,-315.25 219.5,-315.25 219.5,-296 315,-296 315,-315.25"/>
-<text text-anchor="middle" x="267.25" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">check_termination</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.84,-167.41C138.49,-191.51 166.68,-254.25 210.5,-287.62 211.66,-288.51 212.87,-289.35 214.11,-290.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.39,-293.2 222.86,-294.82 215.68,-287.02 212.39,-293.2"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="301.88,-241.25 232.62,-241.25 232.62,-222 301.88,-222 301.88,-241.25"/>
-<text text-anchor="middle" x="267.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">complex_str</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.07,-167.72C154.25,-179.95 183.16,-200.54 210.5,-213.62 214.05,-215.32 217.8,-216.92 221.6,-218.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.35,-221.67 230.95,-221.78 222.73,-215.09 220.35,-221.67"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="292.88,-204.25 241.62,-204.25 241.62,-185 292.88,-185 292.88,-204.25"/>
-<text text-anchor="middle" x="267.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.69,-167.74C184.52,-173.2 210.08,-179.9 230.47,-185.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.48,-188.6 240.04,-187.75 231.26,-181.83 229.48,-188.6"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324,-167.25 210.5,-167.25 210.5,-148 324,-148 324,-167.25"/>
-<text text-anchor="middle" x="267.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.88,-157.62C182.65,-157.62 190.78,-157.62 198.86,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="198.69,-161.13 208.69,-157.63 198.69,-154.13 198.69,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isinf.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-130.25 240.5,-130.25 240.5,-111 294,-111 294,-130.25"/>
-<text text-anchor="middle" x="267.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::isinf</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge9_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.69,-147.51C184.11,-142.16 209.08,-135.61 229.26,-130.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.97,-133.75 238.76,-127.83 228.2,-126.98 229.97,-133.75"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isnan.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.62,-93.25 237.88,-93.25 237.88,-74 296.62,-74 296.62,-93.25"/>
-<text text-anchor="middle" x="267.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::isnan</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge10_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge10_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.33,-147.52C164.61,-145.3 169.85,-142.68 174.5,-139.62 193.95,-126.86 190.82,-114.03 210.5,-101.62 215.48,-98.49 221.06,-95.85 226.71,-93.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.79,-96.97 236.1,-90.41 225.51,-90.35 227.79,-96.97"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294.38,-56.25 240.12,-56.25 240.12,-37 294.38,-37 294.38,-56.25"/>
-<text text-anchor="middle" x="267.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge11_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge11_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.52,-147.62C166.86,-145.45 170.98,-142.81 174.5,-139.62 201.89,-114.79 182.65,-88.94 210.5,-64.62 215.88,-59.93 222.5,-56.45 229.28,-53.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.97,-57.34 238.46,-51 227.87,-50.66 229.97,-57.34"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="317.62,-19.25 216.88,-19.25 216.88,0 317.62,0 317.62,-19.25"/>
-<text text-anchor="middle" x="267.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node13 -->
-<g id="edge12_Node000002_Node000013" class="edge">
-<title>Node2&#45;&gt;Node13</title>
-<g id="a_edge12_Node000002_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.93,-147.54C167.83,-145.39 171.46,-142.78 174.5,-139.62 210.75,-101.95 173.55,-64.62 210.5,-27.62 210.99,-27.13 211.5,-26.65 212.02,-26.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.91,-29.13 220.14,-20.56 209.92,-23.38 213.91,-29.13"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.12,-278.25 230.38,-278.25 230.38,-259 304.12,-259 304.12,-278.25"/>
-<text text-anchor="middle" x="267.25" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">poly_function</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node14 -->
-<g id="edge13_Node000002_Node000014" class="edge">
-<title>Node2&#45;&gt;Node14</title>
-<g id="a_edge13_Node000002_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.62,-167.6C144.45,-186.53 174.89,-227.79 210.5,-250.62 213.36,-252.46 216.43,-254.12 219.59,-255.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.95,-258.73 228.53,-259.33 220.63,-252.27 217.95,-258.73"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="459.25,-278.25 360,-278.25 360,-259 459.25,-259 459.25,-278.25"/>
-<text text-anchor="middle" x="409.62" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.23,-240.58C319.31,-245.08 340.33,-250.62 359.16,-255.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="358.23,-258.96 368.79,-258.12 360.01,-252.19 358.23,-258.96"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="456.62,-241.25 362.62,-241.25 362.62,-222 456.62,-222 456.62,-241.25"/>
-<text text-anchor="middle" x="409.62" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.23,-231.62C316.87,-231.62 334.4,-231.62 350.96,-231.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="350.72,-235.13 360.72,-231.63 350.72,-228.13 350.72,-235.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/fprintf.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="443.5,-204.25 375.75,-204.25 375.75,-185 443.5,-185 443.5,-204.25"/>
-<text text-anchor="middle" x="409.62" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::snprintf</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.23,-222.67C320.9,-217.75 344.28,-211.58 364.37,-206.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.2,-209.69 373.98,-203.76 363.42,-202.92 365.2,-209.69"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node5 -->
-<g id="edge14_Node000014_Node000005" class="edge">
-<title>Node14&#45;&gt;Node5</title>
-<g id="a_edge14_Node000014_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.4,-268.62C317.8,-268.62 333.38,-268.62 348.35,-268.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.12,-272.13 358.12,-268.63 348.12,-265.13 348.12,-272.13"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node6 -->
-<g id="edge16_Node000014_Node000006" class="edge">
-<title>Node14&#45;&gt;Node6</title>
-<g id="a_edge16_Node000014_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.4,-259.1C321.22,-254.66 341.48,-249.32 359.64,-244.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="360.39,-247.96 369.17,-242.02 358.61,-241.19 360.39,-247.96"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="436.38,-315.25 382.88,-315.25 382.88,-296 436.38,-296 436.38,-315.25"/>
-<text text-anchor="middle" x="409.62" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge15_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge15_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.4,-278.15C325.1,-283.61 351.01,-290.44 371.82,-295.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="370.76,-299.26 381.33,-298.43 372.55,-292.5 370.76,-299.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/df2/durand__kerner__roots_8cpp_a2c35b320ace8677f9b331faf94f8b2fd_cgraph.map b/da/df2/durand__kerner__roots_8cpp_a2c35b320ace8677f9b331faf94f8b2fd_cgraph.map
deleted file mode 100644
index dfb4af796..000000000
--- a/da/df2/durand__kerner__roots_8cpp_a2c35b320ace8677f9b331faf94f8b2fd_cgraph.map
+++ /dev/null
@@ -1,31 +0,0 @@
-<map id="durand_kerner_algo" name="durand_kerner_algo">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,203,140,228"/>
-<area shape="rect" id="Node000002" href="$da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377" title=" " alt="" coords="200,5,327,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="76,201,91,169,114,126,146,80,186,40,191,37,194,41,189,44,150,83,118,128,95,171,81,204"/>
-<area shape="rect" id="Node000003" href="$da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c" title=" " alt="" coords="217,104,310,130"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="90,200,132,170,186,138,201,132,204,137,189,143,135,174,93,204"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="229,153,298,179"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="125,199,214,176,215,181,126,205"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="188,203,339,228"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="140,213,172,213,172,218,140,218"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/isinf.html#" title=" " alt="" coords="228,252,299,278"/>
-<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="126,226,213,249,212,254,125,232"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/isnan.html#" title=" " alt="" coords="224,301,302,327"/>
-<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="93,227,135,257,189,288,211,297,209,302,186,293,132,261,90,231"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="227,351,300,376"/>
-<area shape="poly" id="edge10_Node000001_Node000011" title=" " alt="" coords="85,227,126,280,155,311,189,337,214,349,211,354,186,342,152,315,122,284,80,230"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="196,400,330,426"/>
-<area shape="poly" id="edge11_Node000001_Node000012" title=" " alt="" coords="81,227,95,260,118,303,150,348,189,387,194,390,191,394,186,391,146,351,114,305,91,262,76,230"/>
-<area shape="rect" id="Node000013" href="$da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569" title=" " alt="" coords="214,55,312,80"/>
-<area shape="poly" id="edge12_Node000001_Node000013" title=" " alt="" coords="80,201,122,147,152,116,186,89,199,82,201,87,189,94,155,120,126,151,85,204"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/imag.html#" title=" " alt="" coords="387,55,519,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="309,102,385,82,387,87,311,107"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/real.html#" title=" " alt="" coords="390,104,516,130"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="310,114,375,114,375,120,310,120"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/c/fprintf.html#" title=" " alt="" coords="408,153,498,179"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="311,126,394,148,392,153,309,131"/>
-<area shape="poly" id="edge13_Node000013_Node000004" title=" " alt="" coords="313,65,371,65,371,70,313,70"/>
-<area shape="poly" id="edge15_Node000013_Node000005" title=" " alt="" coords="314,78,387,97,386,102,312,83"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="418,5,489,31"/>
-<area shape="poly" id="edge14_Node000013_Node000014" title=" " alt="" coords="312,52,402,29,403,34,314,57"/>
-</map>
diff --git a/da/df2/durand__kerner__roots_8cpp_a2c35b320ace8677f9b331faf94f8b2fd_cgraph.md5 b/da/df2/durand__kerner__roots_8cpp_a2c35b320ace8677f9b331faf94f8b2fd_cgraph.md5
deleted file mode 100644
index fa7657413..000000000
--- a/da/df2/durand__kerner__roots_8cpp_a2c35b320ace8677f9b331faf94f8b2fd_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-afa3f355444f9d2c3d14fd5a354be2c2
\ No newline at end of file
diff --git a/da/df2/durand__kerner__roots_8cpp_a2c35b320ace8677f9b331faf94f8b2fd_cgraph.svg b/da/df2/durand__kerner__roots_8cpp_a2c35b320ace8677f9b331faf94f8b2fd_cgraph.svg
deleted file mode 100644
index b49c6aa8d..000000000
--- a/da/df2/durand__kerner__roots_8cpp_a2c35b320ace8677f9b331faf94f8b2fd_cgraph.svg
+++ /dev/null
@@ -1,299 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: durand_kerner_algo Pages: 1 -->
-<svg width="394pt" height="323pt"
- viewBox="0.00 0.00 393.50 323.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 319.25)">
-<title>durand_kerner_algo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="100.75,-167.25 0,-167.25 0,-148 100.75,-148 100.75,-167.25"/>
-<text text-anchor="middle" x="50.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">durand_kerner_algo</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="241.25,-315.25 145.75,-315.25 145.75,-296 241.25,-296 241.25,-315.25"/>
-<text text-anchor="middle" x="193.5" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">check_termination</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.09,-167.41C64.74,-191.51 92.93,-254.25 136.75,-287.62 137.91,-288.51 139.12,-289.35 140.36,-290.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.64,-293.2 149.11,-294.82 141.93,-287.02 138.64,-293.2"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.12,-241.25 158.88,-241.25 158.88,-222 228.12,-222 228.12,-241.25"/>
-<text text-anchor="middle" x="193.5" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">complex_str</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M64.32,-167.72C80.5,-179.95 109.41,-200.54 136.75,-213.62 140.3,-215.32 144.05,-216.92 147.85,-218.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.6,-221.67 157.2,-221.78 148.98,-215.09 146.6,-221.67"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.12,-204.25 167.88,-204.25 167.88,-185 219.12,-185 219.12,-204.25"/>
-<text text-anchor="middle" x="193.5" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.94,-167.74C110.77,-173.2 136.33,-179.9 156.72,-185.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.73,-188.6 166.29,-187.75 157.51,-181.83 155.73,-188.6"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="250.25,-167.25 136.75,-167.25 136.75,-148 250.25,-148 250.25,-167.25"/>
-<text text-anchor="middle" x="193.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.13,-157.62C108.9,-157.62 117.03,-157.62 125.11,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.94,-161.13 134.94,-157.63 124.94,-154.13 124.94,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isinf.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-130.25 166.75,-130.25 166.75,-111 220.25,-111 220.25,-130.25"/>
-<text text-anchor="middle" x="193.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::isinf</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.94,-147.51C110.36,-142.16 135.33,-135.61 155.51,-130.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.22,-133.75 165.01,-127.83 154.45,-126.98 156.22,-133.75"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isnan.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222.88,-93.25 164.12,-93.25 164.12,-74 222.88,-74 222.88,-93.25"/>
-<text text-anchor="middle" x="193.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::isnan</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M64.32,-147.53C80.5,-135.3 109.41,-114.71 136.75,-101.62 141.95,-99.14 147.58,-96.87 153.19,-94.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.06,-98.25 162.42,-91.74 151.82,-91.61 154.06,-98.25"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.62,-56.25 166.38,-56.25 166.38,-37 220.62,-37 220.62,-56.25"/>
-<text text-anchor="middle" x="193.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M57.87,-147.65C70.7,-128.72 101.14,-87.46 136.75,-64.62 142.4,-61 148.84,-58.05 155.29,-55.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.15,-59.07 164.57,-52.64 153.98,-52.41 156.15,-59.07"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.88,-19.25 143.12,-19.25 143.12,0 243.88,0 243.88,-19.25"/>
-<text text-anchor="middle" x="193.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge11_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge11_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.09,-147.84C64.74,-123.74 92.93,-61 136.75,-27.62 137.91,-26.74 139.12,-25.9 140.36,-25.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.93,-28.23 149.11,-20.43 138.64,-22.05 141.93,-28.23"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="230.38,-278.25 156.62,-278.25 156.62,-259 230.38,-259 230.38,-278.25"/>
-<text text-anchor="middle" x="193.5" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">poly_function</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node13 -->
-<g id="edge12_Node000001_Node000013" class="edge">
-<title>Node1&#45;&gt;Node13</title>
-<g id="a_edge12_Node000001_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M57.87,-167.6C70.7,-186.53 101.14,-227.79 136.75,-250.62 139.61,-252.46 142.68,-254.12 145.84,-255.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.2,-258.73 154.78,-259.33 146.88,-252.27 144.2,-258.73"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385.5,-278.25 286.25,-278.25 286.25,-259 385.5,-259 385.5,-278.25"/>
-<text text-anchor="middle" x="335.88" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.48,-240.58C245.56,-245.08 266.58,-250.62 285.41,-255.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.48,-258.96 295.04,-258.12 286.26,-252.19 284.48,-258.96"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="382.88,-241.25 288.88,-241.25 288.88,-222 382.88,-222 382.88,-241.25"/>
-<text text-anchor="middle" x="335.88" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.48,-231.62C243.12,-231.62 260.65,-231.62 277.21,-231.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="276.97,-235.13 286.97,-231.63 276.97,-228.13 276.97,-235.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/fprintf.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="369.75,-204.25 302,-204.25 302,-185 369.75,-185 369.75,-204.25"/>
-<text text-anchor="middle" x="335.88" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::snprintf</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.48,-222.67C247.15,-217.75 270.53,-211.58 290.62,-206.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.45,-209.69 300.23,-203.76 289.67,-202.92 291.45,-209.69"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node4 -->
-<g id="edge13_Node000013_Node000004" class="edge">
-<title>Node13&#45;&gt;Node4</title>
-<g id="a_edge13_Node000013_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M230.65,-268.62C244.05,-268.62 259.63,-268.62 274.6,-268.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="274.37,-272.13 284.37,-268.63 274.37,-265.13 274.37,-272.13"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node5 -->
-<g id="edge15_Node000013_Node000005" class="edge">
-<title>Node13&#45;&gt;Node5</title>
-<g id="a_edge15_Node000013_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M230.65,-259.1C247.47,-254.66 267.73,-249.32 285.89,-244.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.64,-247.96 295.42,-242.02 284.86,-241.19 286.64,-247.96"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="362.62,-315.25 309.12,-315.25 309.12,-296 362.62,-296 362.62,-315.25"/>
-<text text-anchor="middle" x="335.88" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge14_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge14_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M230.65,-278.15C251.35,-283.61 277.26,-290.44 298.07,-295.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.01,-299.26 307.58,-298.43 298.8,-292.5 297.01,-299.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/df2/durand__kerner__roots_8cpp_a2c35b320ace8677f9b331faf94f8b2fd_cgraph_org.svg b/da/df2/durand__kerner__roots_8cpp_a2c35b320ace8677f9b331faf94f8b2fd_cgraph_org.svg
deleted file mode 100644
index 1722d6205..000000000
--- a/da/df2/durand__kerner__roots_8cpp_a2c35b320ace8677f9b331faf94f8b2fd_cgraph_org.svg
+++ /dev/null
@@ -1,273 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: durand_kerner_algo Pages: 1 -->
-<svg width="394pt" height="323pt"
- viewBox="0.00 0.00 393.50 323.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 319.25)">
-<title>durand_kerner_algo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="100.75,-167.25 0,-167.25 0,-148 100.75,-148 100.75,-167.25"/>
-<text text-anchor="middle" x="50.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">durand_kerner_algo</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="241.25,-315.25 145.75,-315.25 145.75,-296 241.25,-296 241.25,-315.25"/>
-<text text-anchor="middle" x="193.5" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">check_termination</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.09,-167.41C64.74,-191.51 92.93,-254.25 136.75,-287.62 137.91,-288.51 139.12,-289.35 140.36,-290.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.64,-293.2 149.11,-294.82 141.93,-287.02 138.64,-293.2"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.12,-241.25 158.88,-241.25 158.88,-222 228.12,-222 228.12,-241.25"/>
-<text text-anchor="middle" x="193.5" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">complex_str</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M64.32,-167.72C80.5,-179.95 109.41,-200.54 136.75,-213.62 140.3,-215.32 144.05,-216.92 147.85,-218.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.6,-221.67 157.2,-221.78 148.98,-215.09 146.6,-221.67"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.12,-204.25 167.88,-204.25 167.88,-185 219.12,-185 219.12,-204.25"/>
-<text text-anchor="middle" x="193.5" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.94,-167.74C110.77,-173.2 136.33,-179.9 156.72,-185.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.73,-188.6 166.29,-187.75 157.51,-181.83 155.73,-188.6"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="250.25,-167.25 136.75,-167.25 136.75,-148 250.25,-148 250.25,-167.25"/>
-<text text-anchor="middle" x="193.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.13,-157.62C108.9,-157.62 117.03,-157.62 125.11,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.94,-161.13 134.94,-157.63 124.94,-154.13 124.94,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isinf.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-130.25 166.75,-130.25 166.75,-111 220.25,-111 220.25,-130.25"/>
-<text text-anchor="middle" x="193.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::isinf</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.94,-147.51C110.36,-142.16 135.33,-135.61 155.51,-130.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.22,-133.75 165.01,-127.83 154.45,-126.98 156.22,-133.75"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isnan.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222.88,-93.25 164.12,-93.25 164.12,-74 222.88,-74 222.88,-93.25"/>
-<text text-anchor="middle" x="193.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::isnan</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M64.32,-147.53C80.5,-135.3 109.41,-114.71 136.75,-101.62 141.95,-99.14 147.58,-96.87 153.19,-94.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.06,-98.25 162.42,-91.74 151.82,-91.61 154.06,-98.25"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.62,-56.25 166.38,-56.25 166.38,-37 220.62,-37 220.62,-56.25"/>
-<text text-anchor="middle" x="193.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M57.87,-147.65C70.7,-128.72 101.14,-87.46 136.75,-64.62 142.4,-61 148.84,-58.05 155.29,-55.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.15,-59.07 164.57,-52.64 153.98,-52.41 156.15,-59.07"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.88,-19.25 143.12,-19.25 143.12,0 243.88,0 243.88,-19.25"/>
-<text text-anchor="middle" x="193.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge11_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge11_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.09,-147.84C64.74,-123.74 92.93,-61 136.75,-27.62 137.91,-26.74 139.12,-25.9 140.36,-25.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.93,-28.23 149.11,-20.43 138.64,-22.05 141.93,-28.23"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="230.38,-278.25 156.62,-278.25 156.62,-259 230.38,-259 230.38,-278.25"/>
-<text text-anchor="middle" x="193.5" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">poly_function</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node13 -->
-<g id="edge12_Node000001_Node000013" class="edge">
-<title>Node1&#45;&gt;Node13</title>
-<g id="a_edge12_Node000001_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M57.87,-167.6C70.7,-186.53 101.14,-227.79 136.75,-250.62 139.61,-252.46 142.68,-254.12 145.84,-255.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.2,-258.73 154.78,-259.33 146.88,-252.27 144.2,-258.73"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="385.5,-278.25 286.25,-278.25 286.25,-259 385.5,-259 385.5,-278.25"/>
-<text text-anchor="middle" x="335.88" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.48,-240.58C245.56,-245.08 266.58,-250.62 285.41,-255.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.48,-258.96 295.04,-258.12 286.26,-252.19 284.48,-258.96"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="382.88,-241.25 288.88,-241.25 288.88,-222 382.88,-222 382.88,-241.25"/>
-<text text-anchor="middle" x="335.88" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.48,-231.62C243.12,-231.62 260.65,-231.62 277.21,-231.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="276.97,-235.13 286.97,-231.63 276.97,-228.13 276.97,-235.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/fprintf.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="369.75,-204.25 302,-204.25 302,-185 369.75,-185 369.75,-204.25"/>
-<text text-anchor="middle" x="335.88" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::snprintf</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.48,-222.67C247.15,-217.75 270.53,-211.58 290.62,-206.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.45,-209.69 300.23,-203.76 289.67,-202.92 291.45,-209.69"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node4 -->
-<g id="edge13_Node000013_Node000004" class="edge">
-<title>Node13&#45;&gt;Node4</title>
-<g id="a_edge13_Node000013_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M230.65,-268.62C244.05,-268.62 259.63,-268.62 274.6,-268.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="274.37,-272.13 284.37,-268.63 274.37,-265.13 274.37,-272.13"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node5 -->
-<g id="edge15_Node000013_Node000005" class="edge">
-<title>Node13&#45;&gt;Node5</title>
-<g id="a_edge15_Node000013_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M230.65,-259.1C247.47,-254.66 267.73,-249.32 285.89,-244.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="286.64,-247.96 295.42,-242.02 284.86,-241.19 286.64,-247.96"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="362.62,-315.25 309.12,-315.25 309.12,-296 362.62,-296 362.62,-315.25"/>
-<text text-anchor="middle" x="335.88" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge14_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge14_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M230.65,-278.15C251.35,-283.61 277.26,-290.44 298.07,-295.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.01,-299.26 307.58,-298.43 298.8,-292.5 297.01,-299.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/df2/durand__kerner__roots_8cpp_a90219e35062007d1f1b68e9af071ab5c_cgraph.map b/da/df2/durand__kerner__roots_8cpp_a90219e35062007d1f1b68e9af071ab5c_cgraph.map
deleted file mode 100644
index 522e7b1b0..000000000
--- a/da/df2/durand__kerner__roots_8cpp_a90219e35062007d1f1b68e9af071ab5c_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="complex_str" name="complex_str">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,98,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/imag.html#" title=" " alt="" coords="146,5,278,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="95,51,152,34,154,39,97,57"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/real.html#" title=" " alt="" coords="149,55,274,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="98,65,134,65,134,70,98,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/c/fprintf.html#" title=" " alt="" coords="167,104,257,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="97,78,154,96,152,101,95,84"/>
-</map>
diff --git a/da/df2/durand__kerner__roots_8cpp_a90219e35062007d1f1b68e9af071ab5c_cgraph.md5 b/da/df2/durand__kerner__roots_8cpp_a90219e35062007d1f1b68e9af071ab5c_cgraph.md5
deleted file mode 100644
index 6ed29590b..000000000
--- a/da/df2/durand__kerner__roots_8cpp_a90219e35062007d1f1b68e9af071ab5c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f1267f9382e77cf4a9fe57de44e5a034
\ No newline at end of file
diff --git a/da/df2/durand__kerner__roots_8cpp_a90219e35062007d1f1b68e9af071ab5c_cgraph.svg b/da/df2/durand__kerner__roots_8cpp_a90219e35062007d1f1b68e9af071ab5c_cgraph.svg
deleted file mode 100644
index c51096ec1..000000000
--- a/da/df2/durand__kerner__roots_8cpp_a90219e35062007d1f1b68e9af071ab5c_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: complex_str Pages: 1 -->
-<svg width="213pt" height="101pt"
- viewBox="0.00 0.00 212.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>complex_str</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="69.25,-56.25 0,-56.25 0,-37 69.25,-37 69.25,-56.25"/>
-<text text-anchor="middle" x="34.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">complex_str</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.5,-93.25 105.25,-93.25 105.25,-74 204.5,-74 204.5,-93.25"/>
-<text text-anchor="middle" x="154.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M67.94,-56.74C81.1,-60.85 96.52,-65.68 110.63,-70.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="109.57,-73.43 120.16,-73.07 111.66,-66.75 109.57,-73.43"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.88,-56.25 107.88,-56.25 107.88,-37 201.88,-37 201.88,-56.25"/>
-<text text-anchor="middle" x="154.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.51,-46.62C77.86,-46.62 87.04,-46.62 96.17,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.13,-50.13 106.13,-46.63 96.13,-43.13 96.13,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/fprintf.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="188.75,-19.25 121,-19.25 121,0 188.75,0 188.75,-19.25"/>
-<text text-anchor="middle" x="154.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::snprintf</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M67.94,-36.51C81.1,-32.4 96.52,-27.57 110.63,-23.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.66,-26.5 120.16,-20.18 109.57,-19.82 111.66,-26.5"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/df2/durand__kerner__roots_8cpp_a90219e35062007d1f1b68e9af071ab5c_cgraph_org.svg b/da/df2/durand__kerner__roots_8cpp_a90219e35062007d1f1b68e9af071ab5c_cgraph_org.svg
deleted file mode 100644
index edc16d877..000000000
--- a/da/df2/durand__kerner__roots_8cpp_a90219e35062007d1f1b68e9af071ab5c_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: complex_str Pages: 1 -->
-<svg width="213pt" height="101pt"
- viewBox="0.00 0.00 212.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>complex_str</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="69.25,-56.25 0,-56.25 0,-37 69.25,-37 69.25,-56.25"/>
-<text text-anchor="middle" x="34.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">complex_str</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.5,-93.25 105.25,-93.25 105.25,-74 204.5,-74 204.5,-93.25"/>
-<text text-anchor="middle" x="154.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M67.94,-56.74C81.1,-60.85 96.52,-65.68 110.63,-70.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="109.57,-73.43 120.16,-73.07 111.66,-66.75 109.57,-73.43"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.88,-56.25 107.88,-56.25 107.88,-37 201.88,-37 201.88,-56.25"/>
-<text text-anchor="middle" x="154.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.51,-46.62C77.86,-46.62 87.04,-46.62 96.17,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.13,-50.13 106.13,-46.63 96.13,-43.13 96.13,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/fprintf.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="188.75,-19.25 121,-19.25 121,0 188.75,0 188.75,-19.25"/>
-<text text-anchor="middle" x="154.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::snprintf</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M67.94,-36.51C81.1,-32.4 96.52,-27.57 110.63,-23.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.66,-26.5 120.16,-20.18 109.57,-19.82 111.66,-26.5"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/df2/durand__kerner__roots_8cpp_ae2ab49ba1969d7a5988f9bc2c8924569_cgraph.map b/da/df2/durand__kerner__roots_8cpp_ae2ab49ba1969d7a5988f9bc2c8924569_cgraph.map
deleted file mode 100644
index 4c14e683c..000000000
--- a/da/df2/durand__kerner__roots_8cpp_ae2ab49ba1969d7a5988f9bc2c8924569_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="poly_function" name="poly_function">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,104,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/imag.html#" title=" " alt="" coords="152,5,284,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="99,51,158,33,159,39,101,57"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="182,55,254,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="104,65,166,65,166,70,104,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/complex/real.html#" title=" " alt="" coords="155,104,280,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="101,78,159,96,158,102,99,84"/>
-</map>
diff --git a/da/df2/durand__kerner__roots_8cpp_ae2ab49ba1969d7a5988f9bc2c8924569_cgraph.md5 b/da/df2/durand__kerner__roots_8cpp_ae2ab49ba1969d7a5988f9bc2c8924569_cgraph.md5
deleted file mode 100644
index d77f1e2ab..000000000
--- a/da/df2/durand__kerner__roots_8cpp_ae2ab49ba1969d7a5988f9bc2c8924569_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8bea26c55137a2a13f922232ef4bcd7c
\ No newline at end of file
diff --git a/da/df2/durand__kerner__roots_8cpp_ae2ab49ba1969d7a5988f9bc2c8924569_cgraph.svg b/da/df2/durand__kerner__roots_8cpp_ae2ab49ba1969d7a5988f9bc2c8924569_cgraph.svg
deleted file mode 100644
index fd7228aaa..000000000
--- a/da/df2/durand__kerner__roots_8cpp_ae2ab49ba1969d7a5988f9bc2c8924569_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: poly_function Pages: 1 -->
-<svg width="217pt" height="101pt"
- viewBox="0.00 0.00 217.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>poly_function</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="73.75,-56.25 0,-56.25 0,-37 73.75,-37 73.75,-56.25"/>
-<text text-anchor="middle" x="36.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">poly_function</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209,-93.25 109.75,-93.25 109.75,-74 209,-74 209,-93.25"/>
-<text text-anchor="middle" x="159.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.8,-56.74C84.35,-60.9 100.24,-65.77 114.74,-70.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="113.45,-73.49 124.04,-73.08 115.51,-66.8 113.45,-73.49"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="186.12,-56.25 132.62,-56.25 132.62,-37 186.12,-37 186.12,-56.25"/>
-<text text-anchor="middle" x="159.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.03,-46.62C88.8,-46.62 105.88,-46.62 120.79,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.69,-50.13 130.69,-46.63 120.69,-43.13 120.69,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="206.38,-19.25 112.38,-19.25 112.38,0 206.38,0 206.38,-19.25"/>
-<text text-anchor="middle" x="159.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.8,-36.51C84.35,-32.35 100.24,-27.48 114.74,-23.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.51,-26.45 124.04,-20.17 113.45,-19.76 115.51,-26.45"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/da/df2/durand__kerner__roots_8cpp_ae2ab49ba1969d7a5988f9bc2c8924569_cgraph_org.svg b/da/df2/durand__kerner__roots_8cpp_ae2ab49ba1969d7a5988f9bc2c8924569_cgraph_org.svg
deleted file mode 100644
index 1094f8a1c..000000000
--- a/da/df2/durand__kerner__roots_8cpp_ae2ab49ba1969d7a5988f9bc2c8924569_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: poly_function Pages: 1 -->
-<svg width="217pt" height="101pt"
- viewBox="0.00 0.00 217.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>poly_function</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="73.75,-56.25 0,-56.25 0,-37 73.75,-37 73.75,-56.25"/>
-<text text-anchor="middle" x="36.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">poly_function</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209,-93.25 109.75,-93.25 109.75,-74 209,-74 209,-93.25"/>
-<text text-anchor="middle" x="159.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::imag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.8,-56.74C84.35,-60.9 100.24,-65.77 114.74,-70.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="113.45,-73.49 124.04,-73.08 115.51,-66.8 113.45,-73.49"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="186.12,-56.25 132.62,-56.25 132.62,-37 186.12,-37 186.12,-56.25"/>
-<text text-anchor="middle" x="159.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.03,-46.62C88.8,-46.62 105.88,-46.62 120.79,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.69,-50.13 130.69,-46.63 120.69,-43.13 120.69,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/complex/real.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="206.38,-19.25 112.38,-19.25 112.38,0 206.38,0 206.38,-19.25"/>
-<text text-anchor="middle" x="159.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::complex::real</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.8,-36.51C84.35,-32.35 100.24,-27.48 114.74,-23.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.51,-26.45 124.04,-20.17 113.45,-19.76 115.51,-26.45"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/da/df2/durand__kerner__roots_8cpp_source.html b/da/df2/durand__kerner__roots_8cpp_source.html
new file mode 100644
index 000000000..d99e97508
--- /dev/null
+++ b/da/df2/durand__kerner__roots_8cpp_source.html
@@ -0,0 +1,432 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/durand_kerner_roots.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('da/df2/durand__kerner__roots_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">durand_kerner_roots.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../da/df2/durand__kerner__roots_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#include &lt;complex&gt;</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="preprocessor">#include &lt;cstdlib&gt;</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#include &lt;fstream&gt;</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &lt;valarray&gt;</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="preprocessor">#include &lt;omp.h&gt;</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"><a class="line" href="../../da/df2/durand__kerner__roots_8cpp.html#af270a96662132d0385cb6b4637c5a689">   46</a></span><span class="preprocessor">#define ACCURACY 1e-10 </span></div>
+<div class="foldopen" id="foldopen00054" data-start="{" data-end="}">
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="../../da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569">   54</a></span>std::complex&lt;double&gt; <a class="code hl_function" href="../../da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569">poly_function</a>(<span class="keyword">const</span> std::valarray&lt;double&gt; &amp;coeffs,</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>                                   std::complex&lt;double&gt; x) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordtype">double</span> real = 0.f, imag = 0.f;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordtype">int</span> n;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="comment">// #ifdef _OPENMP</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="comment">// #pragma omp target teams distribute reduction(+ : real, imag)</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="comment">// #endif</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordflow">for</span> (n = 0; n &lt; coeffs.size(); n++) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        std::complex&lt;double&gt; tmp =</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            coeffs[n] * std::pow(x, coeffs.size() - n - 1);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        real += tmp.real();</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        imag += tmp.imag();</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordflow">return</span> std::complex&lt;double&gt;(real, imag);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>}</div>
+</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="foldopen" id="foldopen00077" data-start="{" data-end="}">
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c">   77</a></span><span class="keyword">const</span> <span class="keywordtype">char</span> *<a class="code hl_function" href="../../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c">complex_str</a>(<span class="keyword">const</span> std::complex&lt;double&gt; &amp;x) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span><span class="preprocessor">#define MAX_BUFF_SIZE 50</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keyword">static</span> <span class="keywordtype">char</span> msg[MAX_BUFF_SIZE];</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    std::snprintf(msg, MAX_BUFF_SIZE, <span class="stringliteral">&quot;% 7.04g%+7.04gj&quot;</span>, x.real(), x.imag());</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordflow">return</span> msg;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>}</div>
+</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="foldopen" id="foldopen00092" data-start="{" data-end="}">
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="../../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377">   92</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377">check_termination</a>(<span class="keywordtype">long</span> <span class="keywordtype">double</span> delta) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="keyword">static</span> <span class="keywordtype">long</span> <span class="keywordtype">double</span> past_delta = INFINITY;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keywordflow">if</span> (std::abs(past_delta - delta) &lt;= <a class="code hl_define" href="../../da/df2/durand__kerner__roots_8cpp.html#af270a96662132d0385cb6b4637c5a689">ACCURACY</a> || delta &lt; <a class="code hl_define" href="../../da/df2/durand__kerner__roots_8cpp.html#af270a96662132d0385cb6b4637c5a689">ACCURACY</a>)</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    past_delta = delta;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>}</div>
+</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="foldopen" id="foldopen00110" data-start="{" data-end="}">
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"><a class="line" href="../../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd">  110</a></span>std::pair&lt;uint32_t, double&gt; <a class="code hl_function" href="../../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd">durand_kerner_algo</a>(</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <span class="keyword">const</span> std::valarray&lt;double&gt; &amp;coeffs,</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    std::valarray&lt;std::complex&lt;double&gt;&gt; *roots, <span class="keywordtype">bool</span> write_log = <span class="keyword">false</span>) {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="keywordtype">long</span> <span class="keywordtype">double</span> tol_condition = 1;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    uint32_t iter = 0;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <span class="keywordtype">int</span> n;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::ofstream log_file;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span> </div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <span class="keywordflow">if</span> (write_log) {</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>        <span class="comment">/*</span></div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span><span class="comment">         * store intermediate values to a CSV file</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span><span class="comment">         */</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        log_file.open(<span class="stringliteral">&quot;durand_kerner.log.csv&quot;</span>);</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        <span class="keywordflow">if</span> (!log_file.is_open()) {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>            perror(<span class="stringliteral">&quot;Unable to create a storage log file!&quot;</span>);</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>            std::exit(EXIT_FAILURE);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        }</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        log_file &lt;&lt; <span class="stringliteral">&quot;iter#,&quot;</span>;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        <span class="keywordflow">for</span> (n = 0; n &lt; roots-&gt;size(); n++) log_file &lt;&lt; <span class="stringliteral">&quot;root_&quot;</span> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        log_file &lt;&lt; <span class="stringliteral">&quot;avg. correction&quot;</span>;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        log_file &lt;&lt; <span class="stringliteral">&quot;\n0,&quot;</span>;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        <span class="keywordflow">for</span> (n = 0; n &lt; roots-&gt;size(); n++)</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>            log_file &lt;&lt; <a class="code hl_function" href="../../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c">complex_str</a>((*roots)[n]) &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    }</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span> </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <span class="keywordtype">bool</span> break_loop = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <span class="keywordflow">while</span> (!<a class="code hl_function" href="../../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377">check_termination</a>(tol_condition) &amp;&amp; iter &lt; INT16_MAX &amp;&amp;</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>           !break_loop) {</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        tol_condition = 0;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        iter++;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        break_loop = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span> </div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        <span class="keywordflow">if</span> (log_file.is_open())</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>            log_file &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span> &lt;&lt; iter &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span> </div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span><span class="preprocessor">#pragma omp parallel for shared(break_loop, tol_condition)</span></div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>        <span class="keywordflow">for</span> (n = 0; n &lt; roots-&gt;size(); n++) {</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>            <span class="keywordflow">if</span> (break_loop)</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>                <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span> </div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>            std::complex&lt;double&gt; numerator, denominator;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>            numerator = <a class="code hl_function" href="../../da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569">poly_function</a>(coeffs, (*roots)[n]);</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>            denominator = 1.0;</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; roots-&gt;size(); i++)</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>                <span class="keywordflow">if</span> (i != n)</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>                    denominator *= (*roots)[n] - (*roots)[i];</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span> </div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>            std::complex&lt;long double&gt; delta = numerator / denominator;</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span> </div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>            <span class="keywordflow">if</span> (std::isnan(std::abs(delta)) || std::isinf(std::abs(delta))) {</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>                std::cerr &lt;&lt; <span class="stringliteral">&quot;\n\nOverflow/underrun error - got value = &quot;</span></div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>                          &lt;&lt; std::abs(delta) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>                <span class="comment">// return std::pair&lt;uint32_t, double&gt;(iter, tol_condition);</span></div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>                break_loop = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>            }</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span> </div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>            (*roots)[n] -= delta;</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span> </div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span><span class="preprocessor">#pragma omp critical</span></div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>            tol_condition = std::max(tol_condition, std::abs(std::abs(delta)));</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        }</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        <span class="comment">// tol_condition /= (degree - 1);</span></div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        <span class="keywordflow">if</span> (break_loop)</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span> </div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>        <span class="keywordflow">if</span> (log_file.is_open()) {</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>            <span class="keywordflow">for</span> (n = 0; n &lt; roots-&gt;size(); n++)</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>                log_file &lt;&lt; <a class="code hl_function" href="../../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c">complex_str</a>((*roots)[n]) &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        }</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span> </div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span><span class="preprocessor">#if defined(DEBUG) || !defined(NDEBUG)</span></div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>        <span class="keywordflow">if</span> (iter % 500 == 0) {</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Iter: &quot;</span> &lt;&lt; iter &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>            <span class="keywordflow">for</span> (n = 0; n &lt; roots-&gt;size(); n++)</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; <a class="code hl_function" href="../../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c">complex_str</a>((*roots)[n]);</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\t\tabsolute average change: &quot;</span> &lt;&lt; tol_condition</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>                      &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>        }</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span> </div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>        <span class="keywordflow">if</span> (log_file.is_open())</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>            log_file &lt;&lt; tol_condition;</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    }</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span> </div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    <span class="keywordflow">return</span> std::pair&lt;uint32_t, long double&gt;(iter, tol_condition);</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>}</div>
+</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span> </div>
+<div class="foldopen" id="foldopen00208" data-start="{" data-end="}">
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"><a class="line" href="../../da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">  208</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>() {</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    <span class="keyword">const</span> std::valarray&lt;double&gt; coeffs = {1, 0, 4};  <span class="comment">// x^2 - 2 = 0</span></div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    std::valarray&lt;std::complex&lt;double&gt;&gt; roots(2);</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    std::valarray&lt;std::complex&lt;double&gt;&gt; expected = {</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>        std::complex&lt;double&gt;(0., 2.),</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>        std::complex&lt;double&gt;(0., -2.)  <span class="comment">// known expected roots</span></div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    };</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span> </div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    <span class="comment">/* initialize root approximations with random values */</span></div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> n = 0; n &lt; roots.size(); n++) {</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>        roots[n] = std::complex&lt;double&gt;(std::rand() % 100, std::rand() % 100);</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>        roots[n] -= 50.f;</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>        roots[n] /= 25.f;</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    }</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span> </div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    <span class="keyword">auto</span> result = <a class="code hl_function" href="../../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd">durand_kerner_algo</a>(coeffs, &amp;roots, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span> </div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; roots.size(); i++) {</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>        <span class="comment">// check if approximations are have &lt; 0.1% error with one of the</span></div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>        <span class="comment">// expected roots</span></div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>        <span class="keywordtype">bool</span> err1 = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; roots.size(); j++)</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>            err1 |= std::abs(std::abs(roots[i] - expected[j])) &lt; 1e-3;</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>        assert(err1);</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    }</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span> </div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 passed! - &quot;</span> &lt;&lt; result.first &lt;&lt; <span class="stringliteral">&quot; iterations, &quot;</span></div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>              &lt;&lt; result.second &lt;&lt; <span class="stringliteral">&quot; accuracy&quot;</span></div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>}</div>
+</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span> </div>
+<div class="foldopen" id="foldopen00243" data-start="{" data-end="}">
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"><a class="line" href="../../da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0">  243</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>() {</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    <span class="keyword">const</span> std::valarray&lt;double&gt; coeffs = {<span class="comment">// 0.015625 x^3 - 1 = 0</span></div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>                                          1. / 64., 0., 0., -1.};</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    std::valarray&lt;std::complex&lt;double&gt;&gt; roots(3);</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    <span class="keyword">const</span> std::valarray&lt;std::complex&lt;double&gt;&gt; expected = {</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>        std::complex&lt;double&gt;(4., 0.), std::complex&lt;double&gt;(-2., 3.46410162),</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>        std::complex&lt;double&gt;(-2., -3.46410162)  <span class="comment">// known expected roots</span></div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    };</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span> </div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    <span class="comment">/* initialize root approximations with random values */</span></div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> n = 0; n &lt; roots.size(); n++) {</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>        roots[n] = std::complex&lt;double&gt;(std::rand() % 100, std::rand() % 100);</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>        roots[n] -= 50.f;</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>        roots[n] /= 25.f;</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    }</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span> </div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>    <span class="keyword">auto</span> result = <a class="code hl_function" href="../../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd">durand_kerner_algo</a>(coeffs, &amp;roots, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span> </div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; roots.size(); i++) {</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>        <span class="comment">// check if approximations are have &lt; 0.1% error with one of the</span></div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>        <span class="comment">// expected roots</span></div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>        <span class="keywordtype">bool</span> err1 = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; roots.size(); j++)</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>            err1 |= std::abs(std::abs(roots[i] - expected[j])) &lt; 1e-3;</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>        assert(err1);</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>    }</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span> </div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 passed! - &quot;</span> &lt;&lt; result.first &lt;&lt; <span class="stringliteral">&quot; iterations, &quot;</span></div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>              &lt;&lt; result.second &lt;&lt; <span class="stringliteral">&quot; accuracy&quot;</span></div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>}</div>
+</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span> </div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span><span class="comment">/***</span></div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span><span class="comment"> * Main function.</span></div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span><span class="comment"> * The comandline input arguments are taken as coeffiecients of a</span></div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span><span class="comment"> *polynomial. For example, this command</span></div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span><span class="comment"> * ```sh</span></div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span><span class="comment"> * ./durand_kerner_roots 1 0 -4</span></div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span><span class="comment"> * ```</span></div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span><span class="comment"> * will find roots of the polynomial \f$1\cdot x^2 + 0\cdot x^1 + (-4)=0\f$</span></div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span><span class="comment"> **/</span></div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> **argv) {</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>    <span class="comment">/* initialize random seed: */</span></div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span> </div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>    <span class="keywordflow">if</span> (argc &lt; 2) {</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>        <a class="code hl_function" href="../../da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();  <span class="comment">// run tests when no input is provided</span></div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>        <a class="code hl_function" href="../../da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>();  <span class="comment">// and skip tests when input polynomial is provided</span></div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Please pass the coefficients of the polynomial as &quot;</span></div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>                     <span class="stringliteral">&quot;commandline &quot;</span></div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>                     <span class="stringliteral">&quot;arguments.\n&quot;</span>;</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>    }</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span> </div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>    <span class="keywordtype">int</span> n, degree = argc - 1;              <span class="comment">// detected polynomial degree</span></div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>    std::valarray&lt;double&gt; coeffs(degree);  <span class="comment">// create coefficiencts array</span></div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span> </div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>    <span class="comment">// number of roots = degree - 1</span></div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>    std::valarray&lt;std::complex&lt;double&gt;&gt; s0(degree - 1);</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span> </div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Computing the roots for:\n\t&quot;</span>;</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>    <span class="keywordflow">for</span> (n = 0; n &lt; degree; n++) {</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>        coeffs[n] = strtod(argv[n + 1], <span class="keyword">nullptr</span>);</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>        <span class="keywordflow">if</span> (n &lt; degree - 1 &amp;&amp; coeffs[n] != 0)</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; coeffs[n] &lt;&lt; <span class="stringliteral">&quot;) x^&quot;</span> &lt;&lt; degree - n - 1 &lt;&lt; <span class="stringliteral">&quot; + &quot;</span>;</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (coeffs[n] != 0)</div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; coeffs[n] &lt;&lt; <span class="stringliteral">&quot;) x^&quot;</span> &lt;&lt; degree - n - 1</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>                      &lt;&lt; <span class="stringliteral">&quot; = 0\n&quot;</span>;</div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span> </div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>        <span class="comment">/* initialize root approximations with random values */</span></div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>        <span class="keywordflow">if</span> (n &lt; degree - 1) {</div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>            s0[n] = std::complex&lt;double&gt;(std::rand() % 100, std::rand() % 100);</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>            s0[n] -= 50.f;</div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>            s0[n] /= 50.f;</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>        }</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>    }</div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span> </div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>    <span class="comment">// numerical errors less when the first coefficient is &quot;1&quot;</span></div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>    <span class="comment">// hence, we normalize the first coefficient</span></div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>    {</div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>        <span class="keywordtype">double</span> tmp = coeffs[0];</div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>        coeffs /= tmp;</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>    }</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span> </div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>    clock_t end_time, start_time = clock();</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>    <span class="keyword">auto</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="../../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd">durand_kerner_algo</a>(coeffs, &amp;s0, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>    end_time = clock();</div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span> </div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nIterations: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.first &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>    <span class="keywordflow">for</span> (n = 0; n &lt; degree - 1; n++)</div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; <a class="code hl_function" href="../../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c">complex_str</a>(s0[n]) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;absolute average change: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.second &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Time taken: &quot;</span></div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>              &lt;&lt; <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end_time - start_time) / CLOCKS_PER_SEC</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>              &lt;&lt; <span class="stringliteral">&quot; sec\n&quot;</span>;</div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span> </div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>}</div>
+<div class="ttc" id="adurand__kerner__roots_8cpp_html_a024b8bc4755863315456d573a6732377"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377">check_termination</a></div><div class="ttdeci">bool check_termination(long double delta)</div><div class="ttdef"><b>Definition</b> <a href="#l00092">durand_kerner_roots.cpp:92</a></div></div>
+<div class="ttc" id="adurand__kerner__roots_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> <a href="#l00243">durand_kerner_roots.cpp:243</a></div></div>
+<div class="ttc" id="adurand__kerner__roots_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition</b> <a href="#l00208">durand_kerner_roots.cpp:208</a></div></div>
+<div class="ttc" id="adurand__kerner__roots_8cpp_html_a2c35b320ace8677f9b331faf94f8b2fd"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd">durand_kerner_algo</a></div><div class="ttdeci">std::pair&lt; uint32_t, double &gt; durand_kerner_algo(const std::valarray&lt; double &gt; &amp;coeffs, std::valarray&lt; std::complex&lt; double &gt; &gt; *roots, bool write_log=false)</div><div class="ttdef"><b>Definition</b> <a href="#l00110">durand_kerner_roots.cpp:110</a></div></div>
+<div class="ttc" id="adurand__kerner__roots_8cpp_html_a90219e35062007d1f1b68e9af071ab5c"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c">complex_str</a></div><div class="ttdeci">const char * complex_str(const std::complex&lt; double &gt; &amp;x)</div><div class="ttdef"><b>Definition</b> <a href="#l00077">durand_kerner_roots.cpp:77</a></div></div>
+<div class="ttc" id="adurand__kerner__roots_8cpp_html_ae2ab49ba1969d7a5988f9bc2c8924569"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569">poly_function</a></div><div class="ttdeci">std::complex&lt; double &gt; poly_function(const std::valarray&lt; double &gt; &amp;coeffs, std::complex&lt; double &gt; x)</div><div class="ttdef"><b>Definition</b> <a href="#l00054">durand_kerner_roots.cpp:54</a></div></div>
+<div class="ttc" id="adurand__kerner__roots_8cpp_html_af270a96662132d0385cb6b4637c5a689"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#af270a96662132d0385cb6b4637c5a689">ACCURACY</a></div><div class="ttdeci">#define ACCURACY</div><div class="ttdef"><b>Definition</b> <a href="#l00046">durand_kerner_roots.cpp:46</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../da/df2/durand__kerner__roots_8cpp.html">durand_kerner_roots.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/da/df3/classmachine__learning_1_1aystar__search_1_1_ay_star_search-members.html b/da/df3/classmachine__learning_1_1aystar__search_1_1_ay_star_search-members.html
index 8fbff1dce..b66ee3581 100644
--- a/da/df3/classmachine__learning_1_1aystar__search_1_1_ay_star_search-members.html
+++ b/da/df3/classmachine__learning_1_1aystar__search_1_1_ay_star_search-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/da/dfa/structbinary__search__tree_1_1bst__node-members.html b/da/dfa/structbinary__search__tree_1_1bst__node-members.html
index 56f9f175f..b1cfcce84 100644
--- a/da/dfa/structbinary__search__tree_1_1bst__node-members.html
+++ b/da/dfa/structbinary__search__tree_1_1bst__node-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/db/d01/brent__method__extrema_8cpp.html b/db/d01/brent__method__extrema_8cpp.html
index 21df81c9b..775607b2b 100644
--- a/db/d01/brent__method__extrema_8cpp.html
+++ b/db/d01/brent__method__extrema_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/brent_method_extrema.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/brent_method_extrema.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,12 +141,13 @@ Include dependency graph for brent_method_extrema.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d0e/brent__method__extrema_8cpp__incl.svg" width="515" height="126"><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">
+</div>
+<p><a href="../../db/d01/brent__method__extrema_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="define-members" name="define-members"></a>
 Macros</h2></td></tr>
-<tr class="memitem:a525335710b53cb064ca56b936120431e" id="r_a525335710b53cb064ca56b936120431e"><td class="memItemLeft" align="right" valign="top"><a id="a525335710b53cb064ca56b936120431e" name="a525335710b53cb064ca56b936120431e"></a>
-#define&#160;</td><td class="memItemRight" valign="bottom"><b>_USE_MATH_DEFINES</b></td></tr>
-<tr class="memdesc:a525335710b53cb064ca56b936120431e"><td class="mdescLeft">&#160;</td><td class="mdescRight">required for MS Visual C++ <br /></td></tr>
+<tr class="memitem:a525335710b53cb064ca56b936120431e" id="r_a525335710b53cb064ca56b936120431e"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a525335710b53cb064ca56b936120431e">_USE_MATH_DEFINES</a></td></tr>
+<tr class="memdesc:a525335710b53cb064ca56b936120431e"><td class="mdescLeft">&#160;</td><td class="mdescRight">required for MS Visual C++  <br /></td></tr>
 <tr class="separator:a525335710b53cb064ca56b936120431e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a002b2f4894492820fe708b1b7e7c5e70" id="r_a002b2f4894492820fe708b1b7e7c5e70"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></td></tr>
 <tr class="memdesc:a002b2f4894492820fe708b1b7e7c5e70"><td class="mdescLeft">&#160;</td><td class="mdescRight">system accuracy limit  <br /></td></tr>
@@ -137,7 +155,7 @@ Macros</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a1aa76a6d5fd4d333f9072beff1dc486b" id="r_a1aa76a6d5fd4d333f9072beff1dc486b"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; double(double)&gt; &amp;f, double lim_a, double lim_b)</td></tr>
+<tr class="memitem:a1aa76a6d5fd4d333f9072beff1dc486b" id="r_a1aa76a6d5fd4d333f9072beff1dc486b"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a> (const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b)</td></tr>
 <tr class="memdesc:a1aa76a6d5fd4d333f9072beff1dc486b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the real root of a function in the given interval.  <br /></td></tr>
 <tr class="separator:a1aa76a6d5fd4d333f9072beff1dc486b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a1440a7779ac56f47a3f355ce4a8c7da0" id="r_a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a> ()</td></tr>
@@ -162,7 +180,27 @@ Functions</h2></td></tr>
 </blockquote>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d6/d7a/golden__search__extrema_8cpp.html" title="Find extrema of a univariate real function in a given interval using golden section search algorithm.">golden_search_extrema.cpp</a></dd></dl>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../db/d01/brent__method__extrema_8cpp_source.html">brent_method_extrema.cpp</a>.</p>
 </div><h2 class="groupheader">Macro Definition Documentation</h2>
+<a id="a525335710b53cb064ca56b936120431e" name="a525335710b53cb064ca56b936120431e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a525335710b53cb064ca56b936120431e">&#9670;&#160;</a></span>_USE_MATH_DEFINES</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">#define _USE_MATH_DEFINES</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>required for MS Visual C++ </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d01/brent__method__extrema_8cpp_source.html#l00016">16</a> of file <a class="el" href="../../db/d01/brent__method__extrema_8cpp_source.html">brent_method_extrema.cpp</a>.</p>
+
+</div>
+</div>
 <a id="a002b2f4894492820fe708b1b7e7c5e70" name="a002b2f4894492820fe708b1b7e7c5e70"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a002b2f4894492820fe708b1b7e7c5e70">&#9670;&#160;</a></span>EPSILON</h2>
 
@@ -174,15 +212,15 @@ Functions</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
-<b>Value:</b><div class="fragment"><div class="line">    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(  \</div>
-<div class="line">        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">std::numeric_limits&lt;double&gt;::epsilon</a>())</div>
-<div class="ttc" id="anumeric_limits_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/numeric_limits.html">std::numeric_limits</a></div></div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
+<b>Value:</b><div class="fragment"><div class="line">    std::sqrt(  \</div>
+<div class="line">        std::numeric_limits&lt;double&gt;::epsilon())</div>
 </div><!-- fragment -->
 <p>system accuracy limit </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d01/brent__method__extrema_8cpp_source.html#l00024">24</a> of file <a class="el" href="../../db/d01/brent__method__extrema_8cpp_source.html">brent_method_extrema.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   24</span><span class="preprocessor">#define EPSILON \</span></div>
 <div class="line"><span class="lineno">   25</span><span class="preprocessor">    std::sqrt(  \</span></div>
-<div class="line"><span class="lineno">   26</span><span class="preprocessor">        std::numeric_limits&lt;double&gt;::epsilon())  </span><span class="comment">///&lt; system accuracy limit</span></div>
+<div class="line"><span class="lineno">   26</span><span class="preprocessor">        std::numeric_limits&lt;double&gt;::epsilon())  </span></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -196,7 +234,7 @@ Functions</h2></td></tr>
         <tr>
           <td class="memname">double get_minima </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; double(double)&gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>f</em></span>, </td>
+          <td class="paramtype">const std::function&lt; double(double)&gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>f</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -221,18 +259,20 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>root found in the interval </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d01/brent__method__extrema_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../db/d01/brent__method__extrema_8cpp_source.html">brent_method_extrema.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   37</span>                                {</div>
 <div class="line"><span class="lineno">   38</span>    uint32_t iters = 0;</div>
 <div class="line"><span class="lineno">   39</span> </div>
 <div class="line"><span class="lineno">   40</span>    <span class="keywordflow">if</span> (lim_a &gt; lim_b) {</div>
-<div class="line"><span class="lineno">   41</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(lim_a, lim_b);</div>
+<div class="line"><span class="lineno">   41</span>        std::swap(lim_a, lim_b);</div>
 <div class="line"><span class="lineno">   42</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (std::abs(lim_a - lim_b) &lt;= <a class="code hl_define" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>) {</div>
-<div class="line"><span class="lineno">   43</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Search range must be greater than &quot;</span> &lt;&lt; <a class="code hl_define" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   43</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Search range must be greater than &quot;</span> &lt;&lt; <a class="code hl_define" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   44</span>        <span class="keywordflow">return</span> lim_a;</div>
 <div class="line"><span class="lineno">   45</span>    }</div>
 <div class="line"><span class="lineno">   46</span> </div>
 <div class="line"><span class="lineno">   47</span>    <span class="comment">// golden ratio value</span></div>
-<div class="line"><span class="lineno">   48</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> M_GOLDEN_RATIO = (3.f - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(5.f)) / 2.f;</div>
+<div class="line"><span class="lineno">   48</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> M_GOLDEN_RATIO = (3.f - std::sqrt(5.f)) / 2.f;</div>
 <div class="line"><span class="lineno">   49</span> </div>
 <div class="line"><span class="lineno">   50</span>    <span class="keywordtype">double</span> v = lim_a + M_GOLDEN_RATIO * (lim_b - lim_a);</div>
 <div class="line"><span class="lineno">   51</span>    <span class="keywordtype">double</span> u, w = v, x = v;</div>
@@ -317,20 +357,13 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  130</span>        iters++;</div>
 <div class="line"><span class="lineno">  131</span>    } <span class="keywordflow">while</span> (std::abs(x - mid_point) &gt; (tolerance - (lim_b - lim_a) / 2.f));</div>
 <div class="line"><span class="lineno">  132</span> </div>
-<div class="line"><span class="lineno">  133</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; (iters: &quot;</span> &lt;&lt; iters &lt;&lt; <span class="stringliteral">&quot;) &quot;</span>;</div>
+<div class="line"><span class="lineno">  133</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; (iters: &quot;</span> &lt;&lt; iters &lt;&lt; <span class="stringliteral">&quot;) &quot;</span>;</div>
 <div class="line"><span class="lineno">  134</span> </div>
 <div class="line"><span class="lineno">  135</span>    <span class="keywordflow">return</span> x;</div>
 <div class="line"><span class="lineno">  136</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::cerr</a></div></div>
-<div class="ttc" id="abrent__method__extrema_8cpp_html_a002b2f4894492820fe708b1b7e7c5e70"><div class="ttname"><a href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div><div class="ttdeci">#define EPSILON</div><div class="ttdoc">system accuracy limit</div><div class="ttdef"><b>Definition</b> brent_method_extrema.cpp:24</div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a4251b4df4748a0b9c43a48f61bdd2397"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">numerical_methods::simpson_method::f</a></div><div class="ttdeci">double f(double x)</div><div class="ttdoc">A function f(x) that will be used to test the method.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:113</div></div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- 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="../../db/d01/brent__method__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.svg" width="226" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="abrent__method__extrema_8cpp_html_a002b2f4894492820fe708b1b7e7c5e70"><div class="ttname"><a href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div><div class="ttdeci">#define EPSILON</div><div class="ttdoc">system accuracy limit</div><div class="ttdef"><b>Definition</b> <a href="../../db/d01/brent__method__extrema_8cpp_source.html#l00024">brent_method_extrema.cpp:24</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a4251b4df4748a0b9c43a48f61bdd2397"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">numerical_methods::simpson_method::f</a></div><div class="ttdeci">double f(double x)</div><div class="ttdoc">A function f(x) that will be used to test the method.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00113">composite_simpson_rule.cpp:113</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -348,10 +381,12 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d01/brent__method__extrema_8cpp_source.html#l00205">205</a> of file <a class="el" href="../../db/d01/brent__method__extrema_8cpp_source.html">brent_method_extrema.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  205</span>           {</div>
-<div class="line"><span class="lineno">  206</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>.precision(18);</div>
+<div class="line"><span class="lineno">  206</span>    std::cout.precision(18);</div>
 <div class="line"><span class="lineno">  207</span> </div>
-<div class="line"><span class="lineno">  208</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Computations performed with machine epsilon: &quot;</span> &lt;&lt; <a class="code hl_define" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div>
+<div class="line"><span class="lineno">  208</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Computations performed with machine epsilon: &quot;</span> &lt;&lt; <a class="code hl_define" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div>
 <div class="line"><span class="lineno">  209</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  210</span> </div>
 <div class="line"><span class="lineno">  211</span>    <a class="code hl_function" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();</div>
@@ -360,15 +395,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  214</span> </div>
 <div class="line"><span class="lineno">  215</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  216</span>}</div>
-<div class="ttc" id="abrent__method__extrema_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">Test function to find root for the function  in the interval    Expected result: .</div><div class="ttdef"><b>Definition</b> brent_method_extrema.cpp:166</div></div>
-<div class="ttc" id="abrent__method__extrema_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">Test function to find root for the function  in the interval    Expected result = 2.</div><div class="ttdef"><b>Definition</b> brent_method_extrema.cpp:144</div></div>
-<div class="ttc" id="abrent__method__extrema_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">Test function to find maxima for the function  in the interval    Expected result: .</div><div class="ttdef"><b>Definition</b> brent_method_extrema.cpp:189</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d01/brent__method__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="422" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="abrent__method__extrema_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">Test function to find root for the function  in the interval    Expected result: .</div><div class="ttdef"><b>Definition</b> <a href="../../db/d01/brent__method__extrema_8cpp_source.html#l00166">brent_method_extrema.cpp:166</a></div></div>
+<div class="ttc" id="abrent__method__extrema_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">Test function to find root for the function  in the interval    Expected result = 2.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d01/brent__method__extrema_8cpp_source.html#l00144">brent_method_extrema.cpp:144</a></div></div>
+<div class="ttc" id="abrent__method__extrema_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">Test function to find maxima for the function  in the interval    Expected result: .</div><div class="ttdef"><b>Definition</b> <a href="../../db/d01/brent__method__extrema_8cpp_source.html#l00189">brent_method_extrema.cpp:189</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1440a7779ac56f47a3f355ce4a8c7da0" name="a1440a7779ac56f47a3f355ce4a8c7da0"></a>
@@ -388,29 +418,25 @@ Here is the call graph for this function:</div>
 
 <p>Test function to find root for the function \(f(x)= (x-2)^2\) in the interval \([1,5]\) <br  />
  Expected result = 2. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d01/brent__method__extrema_8cpp_source.html#l00144">144</a> of file <a class="el" href="../../db/d01/brent__method__extrema_8cpp_source.html">brent_method_extrema.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  144</span>             {</div>
 <div class="line"><span class="lineno">  145</span>    <span class="comment">// define the function to minimize as a lambda function</span></div>
-<div class="line"><span class="lineno">  146</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt;double(<span class="keywordtype">double</span>)&gt; f1 = [](<span class="keywordtype">double</span> x) {</div>
+<div class="line"><span class="lineno">  146</span>    std::function&lt;double(<span class="keywordtype">double</span>)&gt; f1 = [](<span class="keywordtype">double</span> x) {</div>
 <div class="line"><span class="lineno">  147</span>        <span class="keywordflow">return</span> (x - 2) * (x - 2);</div>
 <div class="line"><span class="lineno">  148</span>    };</div>
 <div class="line"><span class="lineno">  149</span> </div>
-<div class="line"><span class="lineno">  150</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1.... &quot;</span>;</div>
+<div class="line"><span class="lineno">  150</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1.... &quot;</span>;</div>
 <div class="line"><span class="lineno">  151</span> </div>
 <div class="line"><span class="lineno">  152</span>    <span class="keywordtype">double</span> minima = <a class="code hl_function" href="#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a>(f1, -1, 5);</div>
 <div class="line"><span class="lineno">  153</span> </div>
-<div class="line"><span class="lineno">  154</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; minima &lt;&lt; <span class="stringliteral">&quot;...&quot;</span>;</div>
+<div class="line"><span class="lineno">  154</span>    std::cout &lt;&lt; minima &lt;&lt; <span class="stringliteral">&quot;...&quot;</span>;</div>
 <div class="line"><span class="lineno">  155</span> </div>
 <div class="line"><span class="lineno">  156</span>    assert(std::abs(minima - 2) &lt; <a class="code hl_define" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>);</div>
-<div class="line"><span class="lineno">  157</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  157</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  158</span>}</div>
-<div class="ttc" id="abrent__method__extrema_8cpp_html_a1aa76a6d5fd4d333f9072beff1dc486b"><div class="ttname"><a href="#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a></div><div class="ttdeci">double get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b)</div><div class="ttdoc">Get the real root of a function in the given interval.</div><div class="ttdef"><b>Definition</b> brent_method_extrema.cpp:36</div></div>
-<div class="ttc" id="afunction_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d01/brent__method__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg" width="324" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="abrent__method__extrema_8cpp_html_a1aa76a6d5fd4d333f9072beff1dc486b"><div class="ttname"><a href="#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a></div><div class="ttdeci">double get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b)</div><div class="ttdoc">Get the real root of a function in the given interval.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d01/brent__method__extrema_8cpp_source.html#l00036">brent_method_extrema.cpp:36</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0283886819c7c140a023582b7269e2d0" name="a0283886819c7c140a023582b7269e2d0"></a>
@@ -430,29 +456,25 @@ Here is the call graph for this function:</div>
 
 <p>Test function to find root for the function \(f(x)= x^{\frac{1}{x}}\) in the interval \([-2,10]\) <br  />
  Expected result: \(e\approx 2.71828182845904509\). </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d01/brent__method__extrema_8cpp_source.html#l00166">166</a> of file <a class="el" href="../../db/d01/brent__method__extrema_8cpp_source.html">brent_method_extrema.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  166</span>             {</div>
 <div class="line"><span class="lineno">  167</span>    <span class="comment">// define the function to maximize as a lambda function</span></div>
 <div class="line"><span class="lineno">  168</span>    <span class="comment">// since we are maximixing, we negated the function return value</span></div>
-<div class="line"><span class="lineno">  169</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt;double(<span class="keywordtype">double</span>)&gt; func = [](<span class="keywordtype">double</span> x) {</div>
-<div class="line"><span class="lineno">  170</span>        <span class="keywordflow">return</span> -<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(x, 1.f / x);</div>
+<div class="line"><span class="lineno">  169</span>    std::function&lt;double(<span class="keywordtype">double</span>)&gt; func = [](<span class="keywordtype">double</span> x) {</div>
+<div class="line"><span class="lineno">  170</span>        <span class="keywordflow">return</span> -std::pow(x, 1.f / x);</div>
 <div class="line"><span class="lineno">  171</span>    };</div>
 <div class="line"><span class="lineno">  172</span> </div>
-<div class="line"><span class="lineno">  173</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2.... &quot;</span>;</div>
+<div class="line"><span class="lineno">  173</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2.... &quot;</span>;</div>
 <div class="line"><span class="lineno">  174</span> </div>
 <div class="line"><span class="lineno">  175</span>    <span class="keywordtype">double</span> minima = <a class="code hl_function" href="#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a>(func, -2, 5);</div>
 <div class="line"><span class="lineno">  176</span> </div>
-<div class="line"><span class="lineno">  177</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; minima &lt;&lt; <span class="stringliteral">&quot; (&quot;</span> &lt;&lt; M_E &lt;&lt; <span class="stringliteral">&quot;)...&quot;</span>;</div>
+<div class="line"><span class="lineno">  177</span>    std::cout &lt;&lt; minima &lt;&lt; <span class="stringliteral">&quot; (&quot;</span> &lt;&lt; M_E &lt;&lt; <span class="stringliteral">&quot;)...&quot;</span>;</div>
 <div class="line"><span class="lineno">  178</span> </div>
 <div class="line"><span class="lineno">  179</span>    assert(std::abs(minima - M_E) &lt; <a class="code hl_define" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>);</div>
-<div class="line"><span class="lineno">  180</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  180</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  181</span>}</div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d01/brent__method__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg" width="324" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6d0455dd5c30adda100e95f0423c786e" name="a6d0455dd5c30adda100e95f0423c786e"></a>
@@ -472,27 +494,23 @@ Here is the call graph for this function:</div>
 
 <p>Test function to find <em>maxima</em> for the function \(f(x)= \cos x\) in the interval \([0,12]\) <br  />
  Expected result: \(\pi\approx 3.14159265358979312\). </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d01/brent__method__extrema_8cpp_source.html#l00189">189</a> of file <a class="el" href="../../db/d01/brent__method__extrema_8cpp_source.html">brent_method_extrema.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  189</span>             {</div>
 <div class="line"><span class="lineno">  190</span>    <span class="comment">// define the function to maximize as a lambda function</span></div>
 <div class="line"><span class="lineno">  191</span>    <span class="comment">// since we are maximixing, we negated the function return value</span></div>
-<div class="line"><span class="lineno">  192</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt;double(<span class="keywordtype">double</span>)&gt; func = [](<span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a>(x); };</div>
+<div class="line"><span class="lineno">  192</span>    std::function&lt;double(<span class="keywordtype">double</span>)&gt; func = [](<span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> std::cos(x); };</div>
 <div class="line"><span class="lineno">  193</span> </div>
-<div class="line"><span class="lineno">  194</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3.... &quot;</span>;</div>
+<div class="line"><span class="lineno">  194</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3.... &quot;</span>;</div>
 <div class="line"><span class="lineno">  195</span> </div>
 <div class="line"><span class="lineno">  196</span>    <span class="keywordtype">double</span> minima = <a class="code hl_function" href="#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a>(func, -4, 12);</div>
 <div class="line"><span class="lineno">  197</span> </div>
-<div class="line"><span class="lineno">  198</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; minima &lt;&lt; <span class="stringliteral">&quot; (&quot;</span> &lt;&lt; M_PI &lt;&lt; <span class="stringliteral">&quot;)...&quot;</span>;</div>
+<div class="line"><span class="lineno">  198</span>    std::cout &lt;&lt; minima &lt;&lt; <span class="stringliteral">&quot; (&quot;</span> &lt;&lt; M_PI &lt;&lt; <span class="stringliteral">&quot;)...&quot;</span>;</div>
 <div class="line"><span class="lineno">  199</span> </div>
 <div class="line"><span class="lineno">  200</span>    assert(std::abs(minima - M_PI) &lt; <a class="code hl_define" href="#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>);</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> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  201</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  202</span>}</div>
-<div class="ttc" id="acos_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a></div><div class="ttdeci">T cos(T... args)</div></div>
-</div><!-- 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="../../db/d01/brent__method__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg" width="324" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/db/d01/brent__method__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/db/d01/brent__method__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
deleted file mode 100644
index 7e32e2f1d..000000000
--- a/db/d01/brent__method__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="test2" name="test2">
-<area shape="rect" id="Node000001" title="Test function to find root for the function &#160;in the interval &#160;&#160;&#160;Expected result: ." alt="" coords="5,55,56,80"/>
-<area shape="rect" id="Node000002" href="$db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" title="Get the real root of a function in the given interval." alt="" coords="104,29,192,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,60,88,52,89,58,57,65"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="112,79,184,104"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="57,70,97,79,96,84,56,75"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="244,5,314,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="192,31,229,25,230,30,193,37"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="240,55,318,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="193,48,225,54,224,60,192,53"/>
-</map>
diff --git a/db/d01/brent__method__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/db/d01/brent__method__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
deleted file mode 100644
index 65c2860d3..000000000
--- a/db/d01/brent__method__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-14652a9c98011545eb5be58cdcf902f5
\ No newline at end of file
diff --git a/db/d01/brent__method__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/db/d01/brent__method__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
deleted file mode 100644
index 57c8dde16..000000000
--- a/db/d01/brent__method__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="243pt" height="82pt"
- viewBox="0.00 0.00 242.75 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test function to find root for the function &#160;in the interval &#160;&#160;&#160;Expected result: .">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" target="_top" xlink:title="Get the real root of a function in the given interval.">
-<polygon fill="white" stroke="#666666" points="140,-56.25 73.75,-56.25 73.75,-37 140,-37 140,-56.25"/>
-<text text-anchor="middle" x="106.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-31.65C45.24,-33.23 53.75,-35.11 62.29,-37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-40.39 71.95,-39.13 62.94,-33.55 61.43,-40.39"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="133.62,-19.25 80.12,-19.25 80.12,0 133.62,0 133.62,-19.25"/>
-<text text-anchor="middle" x="106.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-23.81C47.02,-21.94 58.08,-19.63 68.66,-17.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.28,-20.86 78.35,-15.39 67.85,-14.01 69.28,-20.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.38,-74.25 179.38,-74.25 179.38,-55 231.38,-55 231.38,-74.25"/>
-<text text-anchor="middle" x="205.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.28,-52.67C149.13,-54.32 158.79,-56.12 167.85,-57.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.96,-61.21 177.43,-59.6 168.24,-54.33 166.96,-61.21"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.75,-37.25 176,-37.25 176,-18 234.75,-18 234.75,-37.25"/>
-<text text-anchor="middle" x="205.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.28,-40.25C148.09,-38.71 156.53,-37.05 164.64,-35.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.16,-38.91 174.3,-33.55 163.81,-32.04 165.16,-38.91"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d01/brent__method__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/db/d01/brent__method__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
deleted file mode 100644
index 885443500..000000000
--- a/db/d01/brent__method__extrema_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="243pt" height="82pt"
- viewBox="0.00 0.00 242.75 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test function to find root for the function &#160;in the interval &#160;&#160;&#160;Expected result: .">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" target="_top" xlink:title="Get the real root of a function in the given interval.">
-<polygon fill="white" stroke="#666666" points="140,-56.25 73.75,-56.25 73.75,-37 140,-37 140,-56.25"/>
-<text text-anchor="middle" x="106.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-31.65C45.24,-33.23 53.75,-35.11 62.29,-37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-40.39 71.95,-39.13 62.94,-33.55 61.43,-40.39"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="133.62,-19.25 80.12,-19.25 80.12,0 133.62,0 133.62,-19.25"/>
-<text text-anchor="middle" x="106.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-23.81C47.02,-21.94 58.08,-19.63 68.66,-17.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.28,-20.86 78.35,-15.39 67.85,-14.01 69.28,-20.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.38,-74.25 179.38,-74.25 179.38,-55 231.38,-55 231.38,-74.25"/>
-<text text-anchor="middle" x="205.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.28,-52.67C149.13,-54.32 158.79,-56.12 167.85,-57.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.96,-61.21 177.43,-59.6 168.24,-54.33 166.96,-61.21"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.75,-37.25 176,-37.25 176,-18 234.75,-18 234.75,-37.25"/>
-<text text-anchor="middle" x="205.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.28,-40.25C148.09,-38.71 156.53,-37.05 164.64,-35.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.16,-38.91 174.3,-33.55 163.81,-32.04 165.16,-38.91"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d01/brent__method__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/db/d01/brent__method__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
deleted file mode 100644
index ab594fba1..000000000
--- a/db/d01/brent__method__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="test1" name="test1">
-<area shape="rect" id="Node000001" title="Test function to find root for the function &#160;in the interval &#160;&#160;&#160;Expected result = 2." alt="" coords="5,31,56,56"/>
-<area shape="rect" id="Node000002" href="$db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" title="Get the real root of a function in the given interval." alt="" coords="104,31,192,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,41,88,41,88,46,56,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="244,5,314,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="192,32,229,25,230,30,193,38"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="240,55,318,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="193,49,225,55,224,60,192,54"/>
-</map>
diff --git a/db/d01/brent__method__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/db/d01/brent__method__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
deleted file mode 100644
index 24851deed..000000000
--- a/db/d01/brent__method__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ffef50ce6fc5d161d5b0ebd97455b9f6
\ No newline at end of file
diff --git a/db/d01/brent__method__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg b/db/d01/brent__method__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
deleted file mode 100644
index 0398184be..000000000
--- a/db/d01/brent__method__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="243pt" height="64pt"
- viewBox="0.00 0.00 242.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test function to find root for the function &#160;in the interval &#160;&#160;&#160;Expected result = 2.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" target="_top" xlink:title="Get the real root of a function in the given interval.">
-<polygon fill="white" stroke="#666666" points="140,-37.25 73.75,-37.25 73.75,-18 140,-18 140,-37.25"/>
-<text text-anchor="middle" x="106.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-27.62C45.16,-27.62 53.56,-27.62 62.01,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.91,-31.13 71.91,-27.63 61.91,-24.13 61.91,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.38,-56.25 179.38,-56.25 179.38,-37 231.38,-37 231.38,-56.25"/>
-<text text-anchor="middle" x="205.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.28,-34C149.13,-35.75 158.79,-37.65 167.85,-39.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.95,-42.82 177.44,-41.32 168.3,-35.96 166.95,-42.82"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.75,-19.25 176,-19.25 176,0 234.75,0 234.75,-19.25"/>
-<text text-anchor="middle" x="205.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.28,-21.58C148.09,-20.12 156.53,-18.55 164.64,-17.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.11,-20.51 174.29,-15.24 163.82,-13.63 165.11,-20.51"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d01/brent__method__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/db/d01/brent__method__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
deleted file mode 100644
index 5d5c98851..000000000
--- a/db/d01/brent__method__extrema_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="243pt" height="64pt"
- viewBox="0.00 0.00 242.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test function to find root for the function &#160;in the interval &#160;&#160;&#160;Expected result = 2.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" target="_top" xlink:title="Get the real root of a function in the given interval.">
-<polygon fill="white" stroke="#666666" points="140,-37.25 73.75,-37.25 73.75,-18 140,-18 140,-37.25"/>
-<text text-anchor="middle" x="106.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-27.62C45.16,-27.62 53.56,-27.62 62.01,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.91,-31.13 71.91,-27.63 61.91,-24.13 61.91,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.38,-56.25 179.38,-56.25 179.38,-37 231.38,-37 231.38,-56.25"/>
-<text text-anchor="middle" x="205.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.28,-34C149.13,-35.75 158.79,-37.65 167.85,-39.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.95,-42.82 177.44,-41.32 168.3,-35.96 166.95,-42.82"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.75,-19.25 176,-19.25 176,0 234.75,0 234.75,-19.25"/>
-<text text-anchor="middle" x="205.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.28,-21.58C148.09,-20.12 156.53,-18.55 164.64,-17.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.11,-20.51 174.29,-15.24 163.82,-13.63 165.11,-20.51"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d01/brent__method__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.map b/db/d01/brent__method__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.map
deleted file mode 100644
index 7ffb59a75..000000000
--- a/db/d01/brent__method__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="get_minima" name="get_minima">
-<area shape="rect" id="Node000001" title="Get the real root of a function in the given interval." alt="" coords="5,31,94,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="146,5,216,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="94,32,130,25,131,30,95,38"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="142,55,220,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="95,49,127,55,126,60,94,54"/>
-</map>
diff --git a/db/d01/brent__method__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.md5 b/db/d01/brent__method__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.md5
deleted file mode 100644
index c8f7e0220..000000000
--- a/db/d01/brent__method__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e288b36e24f716f01f00988b97207f0f
\ No newline at end of file
diff --git a/db/d01/brent__method__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.svg b/db/d01/brent__method__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.svg
deleted file mode 100644
index ad82b50fd..000000000
--- a/db/d01/brent__method__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: get_minima Pages: 1 -->
-<svg width="169pt" height="64pt"
- viewBox="0.00 0.00 169.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>get_minima</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get the real root of a function in the given interval.">
-<polygon fill="#999999" stroke="#666666" points="66.25,-37.25 0,-37.25 0,-18 66.25,-18 66.25,-37.25"/>
-<text text-anchor="middle" x="33.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="157.62,-56.25 105.62,-56.25 105.62,-37 157.62,-37 157.62,-56.25"/>
-<text text-anchor="middle" x="131.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.53,-34C75.38,-35.75 85.04,-37.65 94.1,-39.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.2,-42.82 103.69,-41.32 94.55,-35.96 93.2,-42.82"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161,-19.25 102.25,-19.25 102.25,0 161,0 161,-19.25"/>
-<text text-anchor="middle" x="131.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.53,-21.58C74.34,-20.12 82.78,-18.55 90.89,-17.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.36,-20.51 100.54,-15.24 90.07,-13.63 91.36,-20.51"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d01/brent__method__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph_org.svg b/db/d01/brent__method__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph_org.svg
deleted file mode 100644
index 509f2e6a3..000000000
--- a/db/d01/brent__method__extrema_8cpp_a1aa76a6d5fd4d333f9072beff1dc486b_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: get_minima Pages: 1 -->
-<svg width="169pt" height="64pt"
- viewBox="0.00 0.00 169.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>get_minima</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get the real root of a function in the given interval.">
-<polygon fill="#999999" stroke="#666666" points="66.25,-37.25 0,-37.25 0,-18 66.25,-18 66.25,-37.25"/>
-<text text-anchor="middle" x="33.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="157.62,-56.25 105.62,-56.25 105.62,-37 157.62,-37 157.62,-56.25"/>
-<text text-anchor="middle" x="131.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.53,-34C75.38,-35.75 85.04,-37.65 94.1,-39.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.2,-42.82 103.69,-41.32 94.55,-35.96 93.2,-42.82"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161,-19.25 102.25,-19.25 102.25,0 161,0 161,-19.25"/>
-<text text-anchor="middle" x="131.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.53,-21.58C74.34,-20.12 82.78,-18.55 90.89,-17.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.36,-20.51 100.54,-15.24 90.07,-13.63 91.36,-20.51"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d01/brent__method__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map b/db/d01/brent__method__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
deleted file mode 100644
index 3729d62f0..000000000
--- a/db/d01/brent__method__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="test3" name="test3">
-<area shape="rect" id="Node000001" title="Test function to find maxima for the function &#160;in the interval &#160;&#160;&#160;Expected result: ." alt="" coords="5,31,56,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/cos.html#" title=" " alt="" coords="114,5,182,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,36,98,26,99,31,57,41"/>
-<area shape="rect" id="Node000003" href="$db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" title="Get the real root of a function in the given interval." alt="" coords="104,55,192,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="57,46,89,53,88,58,56,51"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="244,29,314,55"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="192,56,229,49,230,54,193,62"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="240,79,318,104"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="193,73,225,79,224,84,192,78"/>
-</map>
diff --git a/db/d01/brent__method__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 b/db/d01/brent__method__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
deleted file mode 100644
index b35101b71..000000000
--- a/db/d01/brent__method__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f82f41e8556c3934fb11596d63fe5970
\ No newline at end of file
diff --git a/db/d01/brent__method__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg b/db/d01/brent__method__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
deleted file mode 100644
index 4e59866dc..000000000
--- a/db/d01/brent__method__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<svg width="243pt" height="82pt"
- viewBox="0.00 0.00 242.75 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test function to find maxima for the function &#160;in the interval &#160;&#160;&#160;Expected result: .">
-<polygon fill="#999999" stroke="#666666" points="37.75,-55.25 0,-55.25 0,-36 37.75,-36 37.75,-55.25"/>
-<text text-anchor="middle" x="18.88" y="-41.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-74.25 81.25,-74.25 81.25,-55 132.5,-55 132.5,-74.25"/>
-<text text-anchor="middle" x="106.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-49.65C47.34,-51.69 58.86,-54.24 69.78,-56.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.81,-60.02 79.33,-58.76 70.33,-53.19 68.81,-60.02"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" target="_top" xlink:title="Get the real root of a function in the given interval.">
-<polygon fill="white" stroke="#666666" points="140,-37.25 73.75,-37.25 73.75,-18 140,-18 140,-37.25"/>
-<text text-anchor="middle" x="106.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-41.81C45.24,-40.32 53.75,-38.53 62.29,-36.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.87,-40.2 71.94,-34.73 61.44,-33.35 62.87,-40.2"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.38,-56.25 179.38,-56.25 179.38,-37 231.38,-37 231.38,-56.25"/>
-<text text-anchor="middle" x="205.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.28,-34C149.13,-35.75 158.79,-37.65 167.85,-39.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.95,-42.82 177.44,-41.32 168.3,-35.96 166.95,-42.82"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.75,-19.25 176,-19.25 176,0 234.75,0 234.75,-19.25"/>
-<text text-anchor="middle" x="205.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.28,-21.58C148.09,-20.12 156.53,-18.55 164.64,-17.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.11,-20.51 174.29,-15.24 163.82,-13.63 165.11,-20.51"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d01/brent__method__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg b/db/d01/brent__method__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
deleted file mode 100644
index 371a23385..000000000
--- a/db/d01/brent__method__extrema_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<svg width="243pt" height="82pt"
- viewBox="0.00 0.00 242.75 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test function to find maxima for the function &#160;in the interval &#160;&#160;&#160;Expected result: .">
-<polygon fill="#999999" stroke="#666666" points="37.75,-55.25 0,-55.25 0,-36 37.75,-36 37.75,-55.25"/>
-<text text-anchor="middle" x="18.88" y="-41.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-74.25 81.25,-74.25 81.25,-55 132.5,-55 132.5,-74.25"/>
-<text text-anchor="middle" x="106.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-49.65C47.34,-51.69 58.86,-54.24 69.78,-56.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.81,-60.02 79.33,-58.76 70.33,-53.19 68.81,-60.02"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" target="_top" xlink:title="Get the real root of a function in the given interval.">
-<polygon fill="white" stroke="#666666" points="140,-37.25 73.75,-37.25 73.75,-18 140,-18 140,-37.25"/>
-<text text-anchor="middle" x="106.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.11,-41.81C45.24,-40.32 53.75,-38.53 62.29,-36.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.87,-40.2 71.94,-34.73 61.44,-33.35 62.87,-40.2"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.38,-56.25 179.38,-56.25 179.38,-37 231.38,-37 231.38,-56.25"/>
-<text text-anchor="middle" x="205.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.28,-34C149.13,-35.75 158.79,-37.65 167.85,-39.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.95,-42.82 177.44,-41.32 168.3,-35.96 166.95,-42.82"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.75,-19.25 176,-19.25 176,0 234.75,0 234.75,-19.25"/>
-<text text-anchor="middle" x="205.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.28,-21.58C148.09,-20.12 156.53,-18.55 164.64,-17.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.11,-20.51 174.29,-15.24 163.82,-13.63 165.11,-20.51"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d01/brent__method__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d01/brent__method__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 7c55f87ed..000000000
--- a/db/d01/brent__method__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,55,80"/>
-<area shape="rect" id="Node000002" href="$db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" title="Test function to find root for the function &#160;in the interval &#160;&#160;&#160;Expected result = 2." alt="" coords="103,55,153,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,65,88,65,88,70,55,70"/>
-<area shape="rect" id="Node000006" href="$db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0" title="Test function to find root for the function &#160;in the interval &#160;&#160;&#160;Expected result: ." alt="" coords="103,5,153,31"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="54,53,88,35,90,40,56,58"/>
-<area shape="rect" id="Node000008" href="$db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" title="Test function to find maxima for the function &#160;in the interval &#160;&#160;&#160;Expected result: ." alt="" coords="103,104,153,130"/>
-<area shape="poly" id="edge8_Node000001_Node000008" title=" " alt="" coords="56,77,90,95,88,100,54,82"/>
-<area shape="rect" id="Node000003" href="$db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" title="Get the real root of a function in the given interval." alt="" coords="201,55,289,80"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,65,185,65,185,70,153,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="342,31,411,56"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="289,57,326,50,327,55,290,62"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="337,80,416,106"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="290,73,323,80,322,85,289,79"/>
-<area shape="poly" id="edge6_Node000006_Node000003" title=" " alt="" coords="155,26,200,46,198,51,152,31"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="210,5,281,31"/>
-<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="153,16,194,16,194,21,153,21"/>
-<area shape="poly" id="edge10_Node000008_Node000003" title=" " alt="" coords="152,104,198,84,200,89,155,109"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/cos.html#" title=" " alt="" coords="211,104,279,130"/>
-<area shape="poly" id="edge9_Node000008_Node000009" title=" " alt="" coords="153,114,195,114,195,120,153,120"/>
-</map>
diff --git a/db/d01/brent__method__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d01/brent__method__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index c1f6bb369..000000000
--- a/db/d01/brent__method__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0e4ba6442127a29c9d76da28e5277598
\ No newline at end of file
diff --git a/db/d01/brent__method__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d01/brent__method__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 865dc4ac6..000000000
--- a/db/d01/brent__method__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,209 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="316pt" height="101pt"
- viewBox="0.00 0.00 315.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title="Test function to find root for the function &#160;in the interval &#160;&#160;&#160;Expected result = 2.">
-<polygon fill="white" stroke="#666666" points="110.75,-56.25 73,-56.25 73,-37 110.75,-37 110.75,-56.25"/>
-<text text-anchor="middle" x="91.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-46.62C44.55,-46.62 53.37,-46.62 61.69,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-50.13 71.43,-46.63 61.43,-43.13 61.43,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title="Test function to find root for the function &#160;in the interval &#160;&#160;&#160;Expected result: .">
-<polygon fill="white" stroke="#666666" points="110.75,-93.25 73,-93.25 73,-74 110.75,-74 110.75,-93.25"/>
-<text text-anchor="middle" x="91.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-55.77C44.89,-59.79 54.18,-64.6 62.84,-69.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.11,-72.14 71.6,-73.63 64.33,-65.92 61.11,-72.14"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" target="_top" xlink:title="Test function to find maxima for the function &#160;in the interval &#160;&#160;&#160;Expected result: .">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge8_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-37.48C44.89,-33.46 54.18,-28.65 62.84,-24.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.33,-27.33 71.6,-19.62 61.11,-21.11 64.33,-27.33"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" target="_top" xlink:title="Get the real root of a function in the given interval.">
-<polygon fill="white" stroke="#666666" points="213,-56.25 146.75,-56.25 146.75,-37 213,-37 213,-56.25"/>
-<text text-anchor="middle" x="179.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-46.62C118.16,-46.62 126.56,-46.62 135.01,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.91,-50.13 144.91,-46.63 134.91,-43.13 134.91,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.38,-74.25 252.38,-74.25 252.38,-55 304.38,-55 304.38,-74.25"/>
-<text text-anchor="middle" x="278.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.28,-52.67C222.13,-54.32 231.79,-56.12 240.85,-57.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.96,-61.21 250.43,-59.6 241.24,-54.33 239.96,-61.21"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="307.75,-37.25 249,-37.25 249,-18 307.75,-18 307.75,-37.25"/>
-<text text-anchor="middle" x="278.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.28,-40.25C221.09,-38.71 229.53,-37.05 237.64,-35.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.16,-38.91 247.3,-33.55 236.81,-32.04 238.16,-38.91"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge6_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge6_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-75.78C121,-71.52 133.55,-66.13 145.14,-61.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.23,-64.48 154.03,-57.31 143.47,-58.05 146.23,-64.48"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="206.62,-93.25 153.12,-93.25 153.12,-74 206.62,-74 206.62,-93.25"/>
-<text text-anchor="middle" x="179.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-83.62C119.93,-83.62 130.84,-83.62 141.32,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.32,-87.13 151.32,-83.63 141.32,-80.13 141.32,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node3 -->
-<g id="edge10_Node000008_Node000003" class="edge">
-<title>Node8&#45;&gt;Node3</title>
-<g id="a_edge10_Node000008_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-17.47C121,-21.73 133.55,-27.12 145.14,-32.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.47,-35.2 154.03,-35.94 146.23,-28.77 143.47,-35.2"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="205.5,-19.25 154.25,-19.25 154.25,0 205.5,0 205.5,-19.25"/>
-<text text-anchor="middle" x="179.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge9_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-9.62C120.24,-9.62 131.62,-9.62 142.43,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.3,-13.13 152.3,-9.63 142.3,-6.13 142.3,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d01/brent__method__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/db/d01/brent__method__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index b117ef0c9..000000000
--- a/db/d01/brent__method__extrema_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,183 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="316pt" height="101pt"
- viewBox="0.00 0.00 315.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title="Test function to find root for the function &#160;in the interval &#160;&#160;&#160;Expected result = 2.">
-<polygon fill="white" stroke="#666666" points="110.75,-56.25 73,-56.25 73,-37 110.75,-37 110.75,-56.25"/>
-<text text-anchor="middle" x="91.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-46.62C44.55,-46.62 53.37,-46.62 61.69,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-50.13 71.43,-46.63 61.43,-43.13 61.43,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title="Test function to find root for the function &#160;in the interval &#160;&#160;&#160;Expected result: .">
-<polygon fill="white" stroke="#666666" points="110.75,-93.25 73,-93.25 73,-74 110.75,-74 110.75,-93.25"/>
-<text text-anchor="middle" x="91.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-55.77C44.89,-59.79 54.18,-64.6 62.84,-69.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.11,-72.14 71.6,-73.63 64.33,-65.92 61.11,-72.14"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" target="_top" xlink:title="Test function to find maxima for the function &#160;in the interval &#160;&#160;&#160;Expected result: .">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge8_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-37.48C44.89,-33.46 54.18,-28.65 62.84,-24.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.33,-27.33 71.6,-19.62 61.11,-21.11 64.33,-27.33"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b" target="_top" xlink:title="Get the real root of a function in the given interval.">
-<polygon fill="white" stroke="#666666" points="213,-56.25 146.75,-56.25 146.75,-37 213,-37 213,-56.25"/>
-<text text-anchor="middle" x="179.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_minima</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-46.62C118.16,-46.62 126.56,-46.62 135.01,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.91,-50.13 144.91,-46.63 134.91,-43.13 134.91,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.38,-74.25 252.38,-74.25 252.38,-55 304.38,-55 304.38,-74.25"/>
-<text text-anchor="middle" x="278.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.28,-52.67C222.13,-54.32 231.79,-56.12 240.85,-57.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.96,-61.21 250.43,-59.6 241.24,-54.33 239.96,-61.21"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="307.75,-37.25 249,-37.25 249,-18 307.75,-18 307.75,-37.25"/>
-<text text-anchor="middle" x="278.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M213.28,-40.25C221.09,-38.71 229.53,-37.05 237.64,-35.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.16,-38.91 247.3,-33.55 236.81,-32.04 238.16,-38.91"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge6_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge6_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-75.78C121,-71.52 133.55,-66.13 145.14,-61.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.23,-64.48 154.03,-57.31 143.47,-58.05 146.23,-64.48"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="206.62,-93.25 153.12,-93.25 153.12,-74 206.62,-74 206.62,-93.25"/>
-<text text-anchor="middle" x="179.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-83.62C119.93,-83.62 130.84,-83.62 141.32,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.32,-87.13 151.32,-83.63 141.32,-80.13 141.32,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node3 -->
-<g id="edge10_Node000008_Node000003" class="edge">
-<title>Node8&#45;&gt;Node3</title>
-<g id="a_edge10_Node000008_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-17.47C121,-21.73 133.55,-27.12 145.14,-32.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.47,-35.2 154.03,-35.94 146.23,-28.77 143.47,-35.2"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="205.5,-19.25 154.25,-19.25 154.25,0 205.5,0 205.5,-19.25"/>
-<text text-anchor="middle" x="179.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge9_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.11,-9.62C120.24,-9.62 131.62,-9.62 142.43,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.3,-13.13 152.3,-9.63 142.3,-6.13 142.3,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d01/brent__method__extrema_8cpp_source.html b/db/d01/brent__method__extrema_8cpp_source.html
new file mode 100644
index 000000000..c4ebe9b27
--- /dev/null
+++ b/db/d01/brent__method__extrema_8cpp_source.html
@@ -0,0 +1,330 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/brent_method_extrema.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/d01/brent__method__extrema_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">brent_method_extrema.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../db/d01/brent__method__extrema_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"><a class="line" href="../../db/d01/brent__method__extrema_8cpp.html#a525335710b53cb064ca56b936120431e">   16</a></span><span class="preprocessor">#define _USE_MATH_DEFINES  </span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;functional&gt;</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;limits&gt;</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="foldopen" id="foldopen00024" data-start="" data-end="">
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"><a class="line" href="../../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">   24</a></span><span class="preprocessor">#define EPSILON \</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">    std::sqrt(  \</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">        std::numeric_limits&lt;double&gt;::epsilon())  </span></div>
+</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="foldopen" id="foldopen00036" data-start="{" data-end="}">
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">   36</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a>(<span class="keyword">const</span> std::function&lt;<span class="keywordtype">double</span>(<span class="keywordtype">double</span>)&gt; &amp;f, <span class="keywordtype">double</span> lim_a,</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>                  <span class="keywordtype">double</span> lim_b) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    uint32_t iters = 0;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">if</span> (lim_a &gt; lim_b) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        std::swap(lim_a, lim_b);</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (std::abs(lim_a - lim_b) &lt;= <a class="code hl_define" href="../../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Search range must be greater than &quot;</span> &lt;&lt; <a class="code hl_define" href="../../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="keywordflow">return</span> lim_a;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="comment">// golden ratio value</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> M_GOLDEN_RATIO = (3.f - std::sqrt(5.f)) / 2.f;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordtype">double</span> v = lim_a + M_GOLDEN_RATIO * (lim_b - lim_a);</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordtype">double</span> u, w = v, x = v;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordtype">double</span> fu, fv = f(v);</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordtype">double</span> fw = fv, fx = fv;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordtype">double</span> mid_point = (lim_a + lim_b) / 2.f;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordtype">double</span> p = 0, q = 0, r = 0;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordtype">double</span> d, e = 0;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordtype">double</span> tolerance, tolerance2;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        mid_point = (lim_a + lim_b) / 2.f;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        tolerance = <a class="code hl_define" href="../../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a> * std::abs(x);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        tolerance2 = 2 * tolerance;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="keywordflow">if</span> (std::abs(e) &gt; tolerance2) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            <span class="comment">// fit parabola</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            r = (x - w) * (fx - fv);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            q = (x - v) * (fx - fw);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            p = (x - v) * q - (x - w) * r;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>            q = 2.f * (q - r);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            <span class="keywordflow">if</span> (q &gt; 0)</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>                p = -p;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>                q = -q;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>            r = e;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            e = d;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        }</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="keywordflow">if</span> (std::abs(p) &lt; std::abs(0.5 * q * r) &amp;&amp; p &lt; q * (lim_b - x)) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>            <span class="comment">// parabolic interpolation step</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>            d = p / q;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            u = x + d;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            <span class="keywordflow">if</span> (u - lim_a &lt; tolerance2 || lim_b - u &lt; tolerance2)</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>                d = x &lt; mid_point ? tolerance : -tolerance;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            <span class="comment">// golden section interpolation step</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>            e = (x &lt; mid_point ? lim_b : lim_a) - x;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>            d = M_GOLDEN_RATIO * e;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        <span class="comment">// evaluate not too close to x</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        <span class="keywordflow">if</span> (std::abs(d) &gt;= tolerance)</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>            u = d;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (d &gt; 0)</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            u = tolerance;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>            u = -tolerance;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        u += x;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        fu = f(u);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        <span class="comment">// update variables</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        <span class="keywordflow">if</span> (fu &lt;= fx) {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>            <span class="keywordflow">if</span> (u &lt; x)</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>                lim_b = x;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>                lim_a = x;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>            v = w;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            fv = fw;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>            w = x;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>            fw = fx;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>            x = u;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>            fx = fu;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>            <span class="keywordflow">if</span> (u &lt; x)</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>                lim_a = u;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>                lim_b = u;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>            <span class="keywordflow">if</span> (fu &lt;= fw || x == w) {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>                v = w;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>                fv = fw;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>                w = u;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>                fw = fu;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (fu &lt;= fv || v == x || v == w) {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>                v = u;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>                fv = fu;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>            }</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        }</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        iters++;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    } <span class="keywordflow">while</span> (std::abs(x - mid_point) &gt; (tolerance - (lim_b - lim_a) / 2.f));</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; (iters: &quot;</span> &lt;&lt; iters &lt;&lt; <span class="stringliteral">&quot;) &quot;</span>;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <span class="keywordflow">return</span> x;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>}</div>
+</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span> </div>
+<div class="foldopen" id="foldopen00144" data-start="{" data-end="}">
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"><a class="line" href="../../db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">  144</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>() {</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <span class="comment">// define the function to minimize as a lambda function</span></div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    std::function&lt;double(<span class="keywordtype">double</span>)&gt; f1 = [](<span class="keywordtype">double</span> x) {</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        <span class="keywordflow">return</span> (x - 2) * (x - 2);</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    };</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span> </div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1.... &quot;</span>;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    <span class="keywordtype">double</span> minima = <a class="code hl_function" href="../../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a>(f1, -1, 5);</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span> </div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    std::cout &lt;&lt; minima &lt;&lt; <span class="stringliteral">&quot;...&quot;</span>;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span> </div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    assert(std::abs(minima - 2) &lt; <a class="code hl_define" href="../../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>);</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>}</div>
+</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span> </div>
+<div class="foldopen" id="foldopen00166" data-start="{" data-end="}">
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"><a class="line" href="../../db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0">  166</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>() {</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    <span class="comment">// define the function to maximize as a lambda function</span></div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    <span class="comment">// since we are maximixing, we negated the function return value</span></div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    std::function&lt;double(<span class="keywordtype">double</span>)&gt; func = [](<span class="keywordtype">double</span> x) {</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        <span class="keywordflow">return</span> -std::pow(x, 1.f / x);</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    };</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span> </div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2.... &quot;</span>;</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span> </div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    <span class="keywordtype">double</span> minima = <a class="code hl_function" href="../../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a>(func, -2, 5);</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    std::cout &lt;&lt; minima &lt;&lt; <span class="stringliteral">&quot; (&quot;</span> &lt;&lt; M_E &lt;&lt; <span class="stringliteral">&quot;)...&quot;</span>;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    assert(std::abs(minima - M_E) &lt; <a class="code hl_define" href="../../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>);</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>}</div>
+</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span> </div>
+<div class="foldopen" id="foldopen00189" data-start="{" data-end="}">
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"><a class="line" href="../../db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">  189</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a>() {</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    <span class="comment">// define the function to maximize as a lambda function</span></div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    <span class="comment">// since we are maximixing, we negated the function return value</span></div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    std::function&lt;double(<span class="keywordtype">double</span>)&gt; func = [](<span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> std::cos(x); };</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span> </div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3.... &quot;</span>;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span> </div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    <span class="keywordtype">double</span> minima = <a class="code hl_function" href="../../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a>(func, -4, 12);</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span> </div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    std::cout &lt;&lt; minima &lt;&lt; <span class="stringliteral">&quot; (&quot;</span> &lt;&lt; M_PI &lt;&lt; <span class="stringliteral">&quot;)...&quot;</span>;</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span> </div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    assert(std::abs(minima - M_PI) &lt; <a class="code hl_define" href="../../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a>);</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>}</div>
+</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span> </div>
+<div class="foldopen" id="foldopen00205" data-start="{" data-end="}">
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"><a class="line" href="../../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  205</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    std::cout.precision(18);</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span> </div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Computations performed with machine epsilon: &quot;</span> &lt;&lt; <a class="code hl_define" href="../../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span> </div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    <a class="code hl_function" href="../../db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    <a class="code hl_function" href="../../db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>();</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    <a class="code hl_function" href="../../db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a>();</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span> </div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>}</div>
+</div>
+<div class="ttc" id="abrent__method__extrema_8cpp_html_a002b2f4894492820fe708b1b7e7c5e70"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div><div class="ttdeci">#define EPSILON</div><div class="ttdoc">system accuracy limit</div><div class="ttdef"><b>Definition</b> <a href="#l00024">brent_method_extrema.cpp:24</a></div></div>
+<div class="ttc" id="abrent__method__extrema_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">Test function to find root for the function  in the interval    Expected result: .</div><div class="ttdef"><b>Definition</b> <a href="#l00166">brent_method_extrema.cpp:166</a></div></div>
+<div class="ttc" id="abrent__method__extrema_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">Test function to find root for the function  in the interval    Expected result = 2.</div><div class="ttdef"><b>Definition</b> <a href="#l00144">brent_method_extrema.cpp:144</a></div></div>
+<div class="ttc" id="abrent__method__extrema_8cpp_html_a1aa76a6d5fd4d333f9072beff1dc486b"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a></div><div class="ttdeci">double get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b)</div><div class="ttdoc">Get the real root of a function in the given interval.</div><div class="ttdef"><b>Definition</b> <a href="#l00036">brent_method_extrema.cpp:36</a></div></div>
+<div class="ttc" id="abrent__method__extrema_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">Test function to find maxima for the function  in the interval    Expected result: .</div><div class="ttdef"><b>Definition</b> <a href="#l00189">brent_method_extrema.cpp:189</a></div></div>
+<div class="ttc" id="abrent__method__extrema_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00205">brent_method_extrema.cpp:205</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../db/d01/brent__method__extrema_8cpp.html">brent_method_extrema.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/d03/_s_t-example.html b/db/d03/_s_t-example.html
index 8b94c22dd..aa904fd33 100644
--- a/db/d03/_s_t-example.html
+++ b/db/d03/_s_t-example.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ST</title>
+<title>TheAlgorithms/C++: ST</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/db/d03/namespacewildcard__matching.html b/db/d03/namespacewildcard__matching.html
index ebb9d0486..98043f097 100644
--- a/db/d03/namespacewildcard__matching.html
+++ b/db/d03/namespacewildcard__matching.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: wildcard_matching Namespace Reference</title>
+<title>TheAlgorithms/C++: wildcard_matching Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/db/d07/spiral__print_8cpp.html b/db/d07/spiral__print_8cpp.html
index 93f1e9524..40c570d5a 100644
--- a/db/d07/spiral__print_8cpp.html
+++ b/db/d07/spiral__print_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/spiral_print.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/spiral_print.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,7 +135,9 @@ Include dependency graph for spiral_print.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d4c/spiral__print_8cpp__incl.svg" width="160" height="111"><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">
+</div>
+<p><a href="../../db/d07/spiral__print_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:acfff36db81326fb990a643ab198ee8a5" id="r_acfff36db81326fb990a643ab198ee8a5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acfff36db81326fb990a643ab198ee8a5">genArray</a> (int **a, int r, int c)</td></tr>
@@ -130,6 +149,8 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Print the elements of a matrix traversing it spirally. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../db/d07/spiral__print_8cpp_source.html">spiral_print.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="acfff36db81326fb990a643ab198ee8a5" name="acfff36db81326fb990a643ab198ee8a5"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#acfff36db81326fb990a643ab198ee8a5">&#9670;&#160;</a></span>genArray()</h2>
@@ -162,25 +183,20 @@ Functions</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d07/spiral__print_8cpp_source.html#l00012">12</a> of file <a class="el" href="../../db/d07/spiral__print_8cpp_source.html">spiral_print.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   12</span>                                     {</div>
 <div class="line"><span class="lineno">   13</span>    <span class="keywordtype">int</span> value = 1;</div>
 <div class="line"><span class="lineno">   14</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; r; i++) {</div>
 <div class="line"><span class="lineno">   15</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; c; j++) {</div>
 <div class="line"><span class="lineno">   16</span>            a[i][j] = value;</div>
-<div class="line"><span class="lineno">   17</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; a[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   17</span>            std::cout &lt;&lt; a[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   18</span>            value++;</div>
 <div class="line"><span class="lineno">   19</span>        }</div>
-<div class="line"><span class="lineno">   20</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   20</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   21</span>    }</div>
 <div class="line"><span class="lineno">   22</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="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><!-- 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="../../db/d07/spiral__print_8cpp_acfff36db81326fb990a643ab198ee8a5_cgraph.svg" width="204" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -198,9 +214,11 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d07/spiral__print_8cpp_source.html#l00069">69</a> of file <a class="el" href="../../db/d07/spiral__print_8cpp_source.html">spiral_print.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   69</span>           {</div>
 <div class="line"><span class="lineno">   70</span>    <span class="keywordtype">int</span> r, c;</div>
-<div class="line"><span class="lineno">   71</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; r &gt;&gt; c;</div>
+<div class="line"><span class="lineno">   71</span>    std::cin &gt;&gt; r &gt;&gt; c;</div>
 <div class="line"><span class="lineno">   72</span>    <span class="keywordtype">int</span> **a = <span class="keyword">new</span> <span class="keywordtype">int</span> *[r];</div>
 <div class="line"><span class="lineno">   73</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; r; i++) a[i] = <span class="keyword">new</span> <span class="keywordtype">int</span>[c];</div>
 <div class="line"><span class="lineno">   74</span> </div>
@@ -211,15 +229,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   79</span>    <span class="keyword">delete</span>[] a;</div>
 <div class="line"><span class="lineno">   80</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   81</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="aspiral__print_8cpp_html_a850d3f55e1a8d227176cdcc67352c197"><div class="ttname"><a href="#a850d3f55e1a8d227176cdcc67352c197">spiralPrint</a></div><div class="ttdeci">void spiralPrint(int **a, int r, int c)</div><div class="ttdef"><b>Definition</b> spiral_print.cpp:29</div></div>
-<div class="ttc" id="aspiral__print_8cpp_html_acfff36db81326fb990a643ab198ee8a5"><div class="ttname"><a href="#acfff36db81326fb990a643ab198ee8a5">genArray</a></div><div class="ttdeci">void genArray(int **a, int r, int c)</div><div class="ttdef"><b>Definition</b> spiral_print.cpp:12</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d07/spiral__print_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="307" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aspiral__print_8cpp_html_a850d3f55e1a8d227176cdcc67352c197"><div class="ttname"><a href="#a850d3f55e1a8d227176cdcc67352c197">spiralPrint</a></div><div class="ttdeci">void spiralPrint(int **a, int r, int c)</div><div class="ttdef"><b>Definition</b> <a href="../../db/d07/spiral__print_8cpp_source.html#l00029">spiral_print.cpp:29</a></div></div>
+<div class="ttc" id="aspiral__print_8cpp_html_acfff36db81326fb990a643ab198ee8a5"><div class="ttname"><a href="#acfff36db81326fb990a643ab198ee8a5">genArray</a></div><div class="ttdeci">void genArray(int **a, int r, int c)</div><div class="ttdef"><b>Definition</b> <a href="../../db/d07/spiral__print_8cpp_source.html#l00012">spiral_print.cpp:12</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a850d3f55e1a8d227176cdcc67352c197" name="a850d3f55e1a8d227176cdcc67352c197"></a>
@@ -257,40 +269,38 @@ Here is the call graph for this function:</div>
 <p>Print the end col</p>
 <p>Print the end row</p>
 <p>Print the start Col</p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d07/spiral__print_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../db/d07/spiral__print_8cpp_source.html">spiral_print.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   29</span>                                        {</div>
 <div class="line"><span class="lineno">   30</span>    <span class="keywordtype">int</span> startRow = 0, endRow = r - 1;</div>
 <div class="line"><span class="lineno">   31</span>    <span class="keywordtype">int</span> startCol = 0, endCol = c - 1;</div>
 <div class="line"><span class="lineno">   32</span>    <span class="keywordtype">int</span> cnt = 0;</div>
 <div class="line"><span class="lineno">   33</span> </div>
-<div class="line"><span class="lineno">   34</span>    <span class="keywordflow">while</span> (startRow &lt;= endRow &amp;&amp; startCol &lt;= endCol) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   35</span><span class="comment">        /// Print start row</span></div>
-<div class="line"><span class="lineno">   36</span><span class="comment"></span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = startCol; i &lt;= endCol; i++, cnt++) {</div>
-<div class="line"><span class="lineno">   37</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; a[startRow][i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   34</span>    <span class="keywordflow">while</span> (startRow &lt;= endRow &amp;&amp; startCol &lt;= endCol) {</div>
+<div class="line"><span class="lineno">   36</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = startCol; i &lt;= endCol; i++, cnt++) {</div>
+<div class="line"><span class="lineno">   37</span>            std::cout &lt;&lt; a[startRow][i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   38</span>        }</div>
 <div class="line"><span class="lineno">   39</span>        startRow++;</div>
-<div class="line"><span class="lineno">   40</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   41</span><span class="comment">        /// Print the end col</span></div>
-<div class="line"><span class="lineno">   42</span><span class="comment"></span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = startRow; i &lt;= endRow; i++, cnt++) {</div>
-<div class="line"><span class="lineno">   43</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; a[i][endCol] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   40</span> </div>
+<div class="line"><span class="lineno">   42</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = startRow; i &lt;= endRow; i++, cnt++) {</div>
+<div class="line"><span class="lineno">   43</span>            std::cout &lt;&lt; a[i][endCol] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   44</span>        }</div>
 <div class="line"><span class="lineno">   45</span>        endCol--;</div>
-<div class="line"><span class="lineno">   46</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   47</span><span class="comment">        /// Print the end row</span></div>
-<div class="line"><span class="lineno">   48</span><span class="comment"></span>        <span class="keywordflow">if</span> (cnt == r * c) {</div>
+<div class="line"><span class="lineno">   46</span> </div>
+<div class="line"><span class="lineno">   48</span>        <span class="keywordflow">if</span> (cnt == r * c) {</div>
 <div class="line"><span class="lineno">   49</span>            <span class="keywordflow">break</span>;</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">for</span> (<span class="keywordtype">int</span> i = endCol; i &gt;= startCol; i--, cnt++) {</div>
-<div class="line"><span class="lineno">   53</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; a[endRow][i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   53</span>            std::cout &lt;&lt; a[endRow][i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   54</span>        }</div>
 <div class="line"><span class="lineno">   55</span>        endRow--;</div>
-<div class="line"><span class="lineno">   56</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   57</span><span class="comment">        /// Print the start Col</span></div>
-<div class="line"><span class="lineno">   58</span><span class="comment"></span>        <span class="keywordflow">if</span> (cnt == r * c) {</div>
+<div class="line"><span class="lineno">   56</span> </div>
+<div class="line"><span class="lineno">   58</span>        <span class="keywordflow">if</span> (cnt == r * c) {</div>
 <div class="line"><span class="lineno">   59</span>            <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">   60</span>        }</div>
 <div class="line"><span class="lineno">   61</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = endRow; i &gt;= startRow; i--, cnt++) {</div>
-<div class="line"><span class="lineno">   62</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; a[i][startCol] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   62</span>            std::cout &lt;&lt; a[i][startCol] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   63</span>        }</div>
 <div class="line"><span class="lineno">   64</span>        startCol++;</div>
 <div class="line"><span class="lineno">   65</span>    }</div>
diff --git a/db/d07/spiral__print_8cpp_acfff36db81326fb990a643ab198ee8a5_cgraph.map b/db/d07/spiral__print_8cpp_acfff36db81326fb990a643ab198ee8a5_cgraph.map
deleted file mode 100644
index ddac5d486..000000000
--- a/db/d07/spiral__print_8cpp_acfff36db81326fb990a643ab198ee8a5_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="genArray" name="genArray">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,79,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="127,5,198,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="79,16,111,16,111,21,79,21"/>
-</map>
diff --git a/db/d07/spiral__print_8cpp_acfff36db81326fb990a643ab198ee8a5_cgraph.md5 b/db/d07/spiral__print_8cpp_acfff36db81326fb990a643ab198ee8a5_cgraph.md5
deleted file mode 100644
index 7d12c8118..000000000
--- a/db/d07/spiral__print_8cpp_acfff36db81326fb990a643ab198ee8a5_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0745b8351029a14007dd28cec18e0ea4
\ No newline at end of file
diff --git a/db/d07/spiral__print_8cpp_acfff36db81326fb990a643ab198ee8a5_cgraph.svg b/db/d07/spiral__print_8cpp_acfff36db81326fb990a643ab198ee8a5_cgraph.svg
deleted file mode 100644
index 7355164e5..000000000
--- a/db/d07/spiral__print_8cpp_acfff36db81326fb990a643ab198ee8a5_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: genArray Pages: 1 -->
-<svg width="153pt" height="27pt"
- viewBox="0.00 0.00 152.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>genArray</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="55,-19.25 0,-19.25 0,0 55,0 55,-19.25"/>
-<text text-anchor="middle" x="27.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">genArray</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="144.5,-19.25 91,-19.25 91,0 144.5,0 144.5,-19.25"/>
-<text text-anchor="middle" x="117.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.46,-9.62C62.95,-9.62 71.22,-9.62 79.21,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.05,-13.13 89.05,-9.63 79.05,-6.13 79.05,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d07/spiral__print_8cpp_acfff36db81326fb990a643ab198ee8a5_cgraph_org.svg b/db/d07/spiral__print_8cpp_acfff36db81326fb990a643ab198ee8a5_cgraph_org.svg
deleted file mode 100644
index c9cf7cb47..000000000
--- a/db/d07/spiral__print_8cpp_acfff36db81326fb990a643ab198ee8a5_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: genArray Pages: 1 -->
-<svg width="153pt" height="27pt"
- viewBox="0.00 0.00 152.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>genArray</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="55,-19.25 0,-19.25 0,0 55,0 55,-19.25"/>
-<text text-anchor="middle" x="27.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">genArray</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="144.5,-19.25 91,-19.25 91,0 144.5,0 144.5,-19.25"/>
-<text text-anchor="middle" x="117.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.46,-9.62C62.95,-9.62 71.22,-9.62 79.21,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.05,-13.13 89.05,-9.63 79.05,-6.13 79.05,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d07/spiral__print_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d07/spiral__print_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 17ebc9048..000000000
--- a/db/d07/spiral__print_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5" title=" " alt="" coords="106,5,179,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,35,90,27,91,32,56,41"/>
-<area shape="rect" id="Node000004" href="$db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197" title=" " alt="" coords="103,55,182,80"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,46,88,53,87,58,55,51"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="230,5,301,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="179,16,214,16,214,21,179,21"/>
-</map>
diff --git a/db/d07/spiral__print_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d07/spiral__print_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 2f259b43f..000000000
--- a/db/d07/spiral__print_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-33dbc1238b07ac885e0fd308009680f2
\ No newline at end of file
diff --git a/db/d07/spiral__print_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d07/spiral__print_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index caa5e8fbd..000000000
--- a/db/d07/spiral__print_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="230pt" height="64pt"
- viewBox="0.00 0.00 230.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="130.25,-56.25 75.25,-56.25 75.25,-37 130.25,-37 130.25,-56.25"/>
-<text text-anchor="middle" x="102.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">genArray</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-31.75C45.14,-33.55 54.6,-35.73 63.83,-37.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.86,-41.23 73.39,-40.07 64.44,-34.41 62.86,-41.23"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-19.25 73,-19.25 73,0 132.5,0 132.5,-19.25"/>
-<text text-anchor="middle" x="102.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">spiralPrint</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-23.72C44.51,-22.15 53.07,-20.28 61.59,-18.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.12,-21.88 71.14,-16.32 60.62,-15.04 62.12,-21.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222,-56.25 168.5,-56.25 168.5,-37 222,-37 222,-56.25"/>
-<text text-anchor="middle" x="195.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.41,-46.62C138.68,-46.62 147.95,-46.62 156.8,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.58,-50.13 166.58,-46.63 156.58,-43.13 156.58,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d07/spiral__print_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/db/d07/spiral__print_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 95e77144a..000000000
--- a/db/d07/spiral__print_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="230pt" height="64pt"
- viewBox="0.00 0.00 230.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="130.25,-56.25 75.25,-56.25 75.25,-37 130.25,-37 130.25,-56.25"/>
-<text text-anchor="middle" x="102.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">genArray</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-31.75C45.14,-33.55 54.6,-35.73 63.83,-37.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.86,-41.23 73.39,-40.07 64.44,-34.41 62.86,-41.23"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-19.25 73,-19.25 73,0 132.5,0 132.5,-19.25"/>
-<text text-anchor="middle" x="102.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">spiralPrint</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-23.72C44.51,-22.15 53.07,-20.28 61.59,-18.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.12,-21.88 71.14,-16.32 60.62,-15.04 62.12,-21.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222,-56.25 168.5,-56.25 168.5,-37 222,-37 222,-56.25"/>
-<text text-anchor="middle" x="195.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.41,-46.62C138.68,-46.62 147.95,-46.62 156.8,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.58,-50.13 166.58,-46.63 156.58,-43.13 156.58,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d07/spiral__print_8cpp_source.html b/db/d07/spiral__print_8cpp_source.html
new file mode 100644
index 000000000..3bf2afb3c
--- /dev/null
+++ b/db/d07/spiral__print_8cpp_source.html
@@ -0,0 +1,209 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/spiral_print.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/d07/spiral__print_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">spiral_print.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../db/d07/spiral__print_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span> </div>
+<div class="foldopen" id="foldopen00012" data-start="{" data-end="}">
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"><a class="line" href="../../db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5">   12</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5">genArray</a>(<span class="keywordtype">int</span> **a, <span class="keywordtype">int</span> r, <span class="keywordtype">int</span> c) {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <span class="keywordtype">int</span> value = 1;</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; r; i++) {</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; c; j++) {</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>            a[i][j] = value;</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>            std::cout &lt;&lt; a[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>            value++;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        }</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    }</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>}</div>
+</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="foldopen" id="foldopen00029" data-start="{" data-end="}">
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197">   29</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197">spiralPrint</a>(<span class="keywordtype">int</span> **a, <span class="keywordtype">int</span> r, <span class="keywordtype">int</span> c) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordtype">int</span> startRow = 0, endRow = r - 1;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordtype">int</span> startCol = 0, endCol = c - 1;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordtype">int</span> cnt = 0;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">while</span> (startRow &lt;= endRow &amp;&amp; startCol &lt;= endCol) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = startCol; i &lt;= endCol; i++, cnt++) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>            std::cout &lt;&lt; a[startRow][i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        }</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        startRow++;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = startRow; i &lt;= endRow; i++, cnt++) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>            std::cout &lt;&lt; a[i][endCol] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        }</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        endCol--;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="keywordflow">if</span> (cnt == r * c) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = endCol; i &gt;= startCol; i--, cnt++) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            std::cout &lt;&lt; a[endRow][i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        endRow--;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordflow">if</span> (cnt == r * c) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        }</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = endRow; i &gt;= startRow; i--, cnt++) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            std::cout &lt;&lt; a[i][startCol] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        startCol++;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>}</div>
+</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="foldopen" id="foldopen00069" data-start="{" data-end="}">
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="../../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   69</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keywordtype">int</span> r, c;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::cin &gt;&gt; r &gt;&gt; c;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keywordtype">int</span> **a = <span class="keyword">new</span> <span class="keywordtype">int</span> *[r];</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; r; i++) a[i] = <span class="keyword">new</span> <span class="keywordtype">int</span>[c];</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <a class="code hl_function" href="../../db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5">genArray</a>(a, r, c);</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <a class="code hl_function" href="../../db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197">spiralPrint</a>(a, r, c);</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; r; i++) <span class="keyword">delete</span>[] a[i];</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keyword">delete</span>[] a;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>}</div>
+</div>
+<div class="ttc" id="aspiral__print_8cpp_html_a850d3f55e1a8d227176cdcc67352c197"><div class="ttname"><a href="../../db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197">spiralPrint</a></div><div class="ttdeci">void spiralPrint(int **a, int r, int c)</div><div class="ttdef"><b>Definition</b> <a href="#l00029">spiral_print.cpp:29</a></div></div>
+<div class="ttc" id="aspiral__print_8cpp_html_acfff36db81326fb990a643ab198ee8a5"><div class="ttname"><a href="../../db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5">genArray</a></div><div class="ttdeci">void genArray(int **a, int r, int c)</div><div class="ttdef"><b>Definition</b> <a href="#l00012">spiral_print.cpp:12</a></div></div>
+<div class="ttc" id="aspiral__print_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00069">spiral_print.cpp:69</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../db/d07/spiral__print_8cpp.html">spiral_print.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/d09/duval_8cpp.html b/db/d09/duval_8cpp.html
index 291310b08..75404e29c 100644
--- a/db/d09/duval_8cpp.html
+++ b/db/d09/duval_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: strings/duval.cpp File Reference</title>
+<title>TheAlgorithms/C++: strings/duval.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -125,7 +142,9 @@ Include dependency graph for duval.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d52/duval_8cpp__incl.svg" width="572" height="111"><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">
+</div>
+<p><a href="../../db/d09/duval_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/dd6/namespacestring.html">string</a></td></tr>
@@ -151,6 +170,8 @@ Functions</h2></td></tr>
 <p>Duval's algorithm works by iterating over the string and finding the smallest rotation of the string that is a Lyndon word. This is done by comparing the string with its suffixes and finding the smallest suffix that is lexicographically smaller than the string. This suffix is then added to the result and the process is repeated with the remaining string. The algorithm has a time complexity of O(n) where n is the length of the string.</p>
 <dl class="section note"><dt>Note</dt><dd>While Lyndon words are described in the context of strings, Duval's algorithm can be used to find the lexicographically smallest cyclic shift of any sequence of comparable elements.</dd></dl>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/aminegh20" target="_blank">Amine Ghoussaini</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../db/d09/duval_8cpp_source.html">duval.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -169,17 +190,14 @@ Functions</h2></td></tr>
 
 <p>main function </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d09/duval_8cpp_source.html#l00115">115</a> of file <a class="el" href="../../db/d09/duval_8cpp_source.html">duval.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  115</span>           {</div>
 <div class="line"><span class="lineno">  116</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self test implementations</span></div>
 <div class="line"><span class="lineno">  117</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  118</span>}</div>
-<div class="ttc" id="aduval_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">self test implementation returns void</div><div class="ttdef"><b>Definition</b> duval.cpp:77</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d09/duval_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aduval_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">self test implementation returns void</div><div class="ttdef"><b>Definition</b> <a href="../../db/d09/duval_8cpp_source.html#l00077">duval.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -206,53 +224,44 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>self test implementation returns void </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d09/duval_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../db/d09/duval_8cpp_source.html">duval.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   77</span>                   {</div>
 <div class="line"><span class="lineno">   78</span>    <span class="keyword">using namespace </span><a class="code hl_namespace" href="../../d6/dd6/namespacestring.html">string</a>;</div>
 <div class="line"><span class="lineno">   79</span> </div>
 <div class="line"><span class="lineno">   80</span>    <span class="comment">// Test 1</span></div>
-<div class="line"><span class="lineno">   81</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s1 = <span class="stringliteral">&quot;abcab&quot;</span>;</div>
+<div class="line"><span class="lineno">   81</span>    std::string s1 = <span class="stringliteral">&quot;abcab&quot;</span>;</div>
 <div class="line"><span class="lineno">   82</span>    assert(<a class="code hl_function" href="../../d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632">duval</a>(s1) == 3);</div>
 <div class="line"><span class="lineno">   83</span> </div>
 <div class="line"><span class="lineno">   84</span>    <span class="comment">// Test 2</span></div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s2 = <span class="stringliteral">&quot;011100&quot;</span>;</div>
+<div class="line"><span class="lineno">   85</span>    std::string s2 = <span class="stringliteral">&quot;011100&quot;</span>;</div>
 <div class="line"><span class="lineno">   86</span>    assert(<a class="code hl_function" href="../../d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632">duval</a>(s2) == 4);</div>
 <div class="line"><span class="lineno">   87</span> </div>
 <div class="line"><span class="lineno">   88</span>    <span class="comment">// Test 3</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&lt;int&gt;</a> v = {5, 2, 1, 3, 4};</div>
+<div class="line"><span class="lineno">   89</span>    std::vector&lt;int&gt; v = {5, 2, 1, 3, 4};</div>
 <div class="line"><span class="lineno">   90</span>    assert(<a class="code hl_function" href="../../d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632">duval</a>(v) == 2);</div>
 <div class="line"><span class="lineno">   91</span> </div>
 <div class="line"><span class="lineno">   92</span>    <span class="comment">// Test 4</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/array.html">std::array&lt;int, 5&gt;</a> a = {1, 2, 3, 4, 5};</div>
+<div class="line"><span class="lineno">   93</span>    std::array&lt;int, 5&gt; a = {1, 2, 3, 4, 5};</div>
 <div class="line"><span class="lineno">   94</span>    assert(<a class="code hl_function" href="../../d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632">duval</a>(a) == 0);</div>
 <div class="line"><span class="lineno">   95</span> </div>
 <div class="line"><span class="lineno">   96</span>    <span class="comment">// Test 5</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/deque.html">std::deque&lt;char&gt;</a> d = {<span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;z&#39;</span>, <span class="charliteral">&#39;c&#39;</span>, <span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;b&#39;</span>};</div>
+<div class="line"><span class="lineno">   97</span>    std::deque&lt;char&gt; d = {<span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;z&#39;</span>, <span class="charliteral">&#39;c&#39;</span>, <span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;b&#39;</span>};</div>
 <div class="line"><span class="lineno">   98</span>    assert(<a class="code hl_function" href="../../d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632">duval</a>(d) == 3);</div>
 <div class="line"><span class="lineno">   99</span> </div>
 <div class="line"><span class="lineno">  100</span>    <span class="comment">// Test 6</span></div>
-<div class="line"><span class="lineno">  101</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s3;</div>
+<div class="line"><span class="lineno">  101</span>    std::string s3;</div>
 <div class="line"><span class="lineno">  102</span>    assert(<a class="code hl_function" href="../../d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632">duval</a>(s3) == 0);</div>
 <div class="line"><span class="lineno">  103</span> </div>
 <div class="line"><span class="lineno">  104</span>    <span class="comment">// Test 7</span></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&lt;int&gt;</a> v2 = {5, 2, 1, 3, -4};</div>
+<div class="line"><span class="lineno">  105</span>    std::vector&lt;int&gt; v2 = {5, 2, 1, 3, -4};</div>
 <div class="line"><span class="lineno">  106</span>    assert(<a class="code hl_function" href="../../d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632">duval</a>(v2) == 4);</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> &lt;&lt; <span class="stringliteral">&quot;All tests passed!&quot;</span> &lt;&lt; <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">  108</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  109</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="adeque_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/deque.html">std::deque</a></div></div>
-<div class="ttc" id="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="anamespacestring_html"><div class="ttname"><a href="../../d6/dd6/namespacestring.html">string</a></div><div class="ttdoc">string manipulation algorithms</div><div class="ttdef"><b>Definition</b> duval.cpp:41</div></div>
-<div class="ttc" id="anamespacestring_html_ac2a35302e6bed93c4b2c6f55a21a5632"><div class="ttname"><a href="../../d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632">string::duval</a></div><div class="ttdeci">size_t duval(const T &amp;s)</div><div class="ttdoc">Find the lexicographically smallest cyclic shift of a sequence.</div><div class="ttdef"><b>Definition</b> duval.cpp:49</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d09/duval_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacestring_html"><div class="ttname"><a href="../../d6/dd6/namespacestring.html">string</a></div><div class="ttdoc">string manipulation algorithms</div><div class="ttdef"><b>Definition</b> <a href="../../db/d09/duval_8cpp_source.html#l00041">duval.cpp:41</a></div></div>
+<div class="ttc" id="anamespacestring_html_ac2a35302e6bed93c4b2c6f55a21a5632"><div class="ttname"><a href="../../d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632">string::duval</a></div><div class="ttdeci">size_t duval(const T &amp;s)</div><div class="ttdoc">Find the lexicographically smallest cyclic shift of a sequence.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d09/duval_8cpp_source.html#l00049">duval.cpp:49</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/db/d09/duval_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/db/d09/duval_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 1853db70f..000000000
--- a/db/d09/duval_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="self test implementation returns void" alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/db/d09/duval_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/db/d09/duval_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 79b328cc0..000000000
--- a/db/d09/duval_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0f712e92fb452db1f16641cf4d4a41f1
\ No newline at end of file
diff --git a/db/d09/duval_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/db/d09/duval_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index d6192d460..000000000
--- a/db/d09/duval_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="self test implementation returns void">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d09/duval_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/db/d09/duval_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 8a4cb2e79..000000000
--- a/db/d09/duval_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="self test implementation returns void">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d09/duval_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d09/duval_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 13647bb3b..000000000
--- a/db/d09/duval_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="main function" alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="self test implementation returns void" alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/db/d09/duval_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d09/duval_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 1b359626b..000000000
--- a/db/d09/duval_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-01a04610bd48d17509f81817a2e9ea57
\ No newline at end of file
diff --git a/db/d09/duval_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d09/duval_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 8d6df03ed..000000000
--- a/db/d09/duval_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="self test implementation returns void">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d09/duval_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/db/d09/duval_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 77c7d8040..000000000
--- a/db/d09/duval_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="self test implementation returns void">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d09/duval_8cpp_source.html b/db/d09/duval_8cpp_source.html
new file mode 100644
index 000000000..a08a72ed6
--- /dev/null
+++ b/db/d09/duval_8cpp_source.html
@@ -0,0 +1,222 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: strings/duval.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/d09/duval_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">duval.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../db/d09/duval_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;array&gt;</span>    </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;cassert&gt;</span>  </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;cstddef&gt;</span>  </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &lt;deque&gt;</span>    </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#include &lt;iostream&gt;</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;string&gt;</span>   </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#include &lt;vector&gt;</span>   </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="foldopen" id="foldopen00041" data-start="{" data-end="}">
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../d6/dd6/namespacestring.html">   41</a></span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/dd6/namespacestring.html">string</a> {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00049" data-start="{" data-end="}">
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"><a class="line" href="../../d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632">   49</a></span><span class="keywordtype">size_t</span> <a class="code hl_function" href="../../d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632">duval</a>(<span class="keyword">const</span> T&amp; s) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordtype">size_t</span> n = s.size();</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordtype">size_t</span> i = 0, ans = 0;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">while</span> (i &lt; n) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        ans = i;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <span class="keywordtype">size_t</span> j = i + 1, k = i;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="keywordflow">while</span> (j &lt; (n + n) &amp;&amp; s[j % n] &gt;= s[k % n]) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            <span class="keywordflow">if</span> (s[k % n] &lt; s[j % n]) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>                k = i;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>                k++;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            }</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            j++;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        }</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">while</span> (i &lt;= k) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            i += j - k;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">return</span> ans;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="comment">// returns 0-indexed position of the least cyclic shift</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>}</div>
+</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>}  <span class="comment">// namespace string</span></div>
+</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="foldopen" id="foldopen00077" data-start="{" data-end="}">
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   77</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keyword">using namespace </span><a class="code hl_namespace" href="../../d6/dd6/namespacestring.html">string</a>;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="comment">// Test 1</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    std::string s1 = <span class="stringliteral">&quot;abcab&quot;</span>;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    assert(duval(s1) == 3);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="comment">// Test 2</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::string s2 = <span class="stringliteral">&quot;011100&quot;</span>;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    assert(duval(s2) == 4);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="comment">// Test 3</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::vector&lt;int&gt; v = {5, 2, 1, 3, 4};</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    assert(duval(v) == 2);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="comment">// Test 4</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    std::array&lt;int, 5&gt; a = {1, 2, 3, 4, 5};</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    assert(duval(a) == 0);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <span class="comment">// Test 5</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    std::deque&lt;char&gt; d = {<span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;z&#39;</span>, <span class="charliteral">&#39;c&#39;</span>, <span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;b&#39;</span>};</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    assert(duval(d) == 3);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="comment">// Test 6</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    std::string s3;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    assert(duval(s3) == 0);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="comment">// Test 7</span></div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    std::vector&lt;int&gt; v2 = {5, 2, 1, 3, -4};</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    assert(duval(v2) == 4);</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>}</div>
+</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span> </div>
+<div class="foldopen" id="foldopen00115" data-start="{" data-end="}">
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"><a class="line" href="../../db/d09/duval_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  115</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../db/d09/duval_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <a class="code hl_function" href="../../db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self test implementations</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>}</div>
+</div>
+<div class="ttc" id="aduval_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">self test implementation returns void</div><div class="ttdef"><b>Definition</b> <a href="#l00077">duval.cpp:77</a></div></div>
+<div class="ttc" id="aduval_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d09/duval_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition</b> <a href="#l00115">duval.cpp:115</a></div></div>
+<div class="ttc" id="anamespacestring_html"><div class="ttname"><a href="../../d6/dd6/namespacestring.html">string</a></div><div class="ttdoc">string manipulation algorithms</div><div class="ttdef"><b>Definition</b> <a href="#l00041">duval.cpp:41</a></div></div>
+<div class="ttc" id="anamespacestring_html_ac2a35302e6bed93c4b2c6f55a21a5632"><div class="ttname"><a href="../../d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632">string::duval</a></div><div class="ttdeci">size_t duval(const T &amp;s)</div><div class="ttdoc">Find the lexicographically smallest cyclic shift of a sequence.</div><div class="ttdef"><b>Definition</b> <a href="#l00049">duval.cpp:49</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_73a3cc5065b223eb41b02873c0e19f0e.html">strings</a></li><li class="navelem"><a class="el" href="../../db/d09/duval_8cpp.html">duval.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/d0d/prime__factorization_8cpp.html b/db/d0d/prime__factorization_8cpp.html
index 1e1c98482..59a1b63af 100644
--- a/db/d0d/prime__factorization_8cpp.html
+++ b/db/d0d/prime__factorization_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/prime_factorization.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/prime_factorization.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for prime_factorization.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/def/prime__factorization_8cpp__incl.svg" width="346" height="111"><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">
+</div>
+<p><a href="../../db/d0d/prime__factorization_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:affe577b9bce8f604f5e2f861c63c7099" id="r_affe577b9bce8f604f5e2f861c63c7099"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#affe577b9bce8f604f5e2f861c63c7099">SieveOfEratosthenes</a> (int N)</td></tr>
@@ -136,13 +155,15 @@ Functions</h2></td></tr>
 Variables</h2></td></tr>
 <tr class="memitem:a7fe38b570a51e448430d6a0f072c2f23" id="r_a7fe38b570a51e448430d6a0f072c2f23"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7fe38b570a51e448430d6a0f072c2f23">isprime</a> [1000006]</td></tr>
 <tr class="separator:a7fe38b570a51e448430d6a0f072c2f23"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af097796783684712b8326e5b82bfd4fe" id="r_af097796783684712b8326e5b82bfd4fe"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af097796783684712b8326e5b82bfd4fe">prime_numbers</a></td></tr>
+<tr class="memitem:af097796783684712b8326e5b82bfd4fe" id="r_af097796783684712b8326e5b82bfd4fe"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af097796783684712b8326e5b82bfd4fe">prime_numbers</a></td></tr>
 <tr class="separator:af097796783684712b8326e5b82bfd4fe"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:acfb0df439a4beae5a34ef131ce737c1b" id="r_acfb0df439a4beae5a34ef131ce737c1b"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acfb0df439a4beae5a34ef131ce737c1b">factors</a></td></tr>
+<tr class="memitem:acfb0df439a4beae5a34ef131ce737c1b" id="r_acfb0df439a4beae5a34ef131ce737c1b"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::pair&lt; int, int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acfb0df439a4beae5a34ef131ce737c1b">factors</a></td></tr>
 <tr class="separator:acfb0df439a4beae5a34ef131ce737c1b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Prime factorization of positive integers. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../db/d0d/prime__factorization_8cpp_source.html">prime_factorization.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -159,11 +180,13 @@ Variables</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main program </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d0d/prime__factorization_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../db/d0d/prime__factorization_8cpp_source.html">prime_factorization.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>           {</div>
 <div class="line"><span class="lineno">   63</span>    <span class="keywordtype">int</span> num;</div>
-<div class="line"><span class="lineno">   64</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\t\tComputes the prime factorization\n\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   65</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Type in a number: &quot;</span>;</div>
-<div class="line"><span class="lineno">   66</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; num;</div>
+<div class="line"><span class="lineno">   64</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\t\tComputes the prime factorization\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   65</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Type in a number: &quot;</span>;</div>
+<div class="line"><span class="lineno">   66</span>    std::cin &gt;&gt; num;</div>
 <div class="line"><span class="lineno">   67</span> </div>
 <div class="line"><span class="lineno">   68</span>    <a class="code hl_function" href="#affe577b9bce8f604f5e2f861c63c7099">SieveOfEratosthenes</a>(num);</div>
 <div class="line"><span class="lineno">   69</span> </div>
@@ -171,23 +194,15 @@ Variables</h2></td></tr>
 <div class="line"><span class="lineno">   71</span> </div>
 <div class="line"><span class="lineno">   72</span>    <span class="comment">// Prime factors with their powers in the given number in new line</span></div>
 <div class="line"><span class="lineno">   73</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> it : <a class="code hl_variable" href="#acfb0df439a4beae5a34ef131ce737c1b">factors</a>) {</div>
-<div class="line"><span class="lineno">   74</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; it.first &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; it.second &lt;&lt; <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">   74</span>        std::cout &lt;&lt; it.first &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; it.second &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   75</span>    }</div>
 <div class="line"><span class="lineno">   76</span> </div>
 <div class="line"><span class="lineno">   77</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   78</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="aprime__factorization_8cpp_html_a0ece0145fb29a5cf48378c23dde2da46"><div class="ttname"><a href="#a0ece0145fb29a5cf48378c23dde2da46">prime_factorization</a></div><div class="ttdeci">void prime_factorization(int num)</div><div class="ttdef"><b>Definition</b> prime_factorization.cpp:40</div></div>
-<div class="ttc" id="aprime__factorization_8cpp_html_acfb0df439a4beae5a34ef131ce737c1b"><div class="ttname"><a href="#acfb0df439a4beae5a34ef131ce737c1b">factors</a></div><div class="ttdeci">std::vector&lt; std::pair&lt; int, int &gt; &gt; factors</div><div class="ttdef"><b>Definition</b> prime_factorization.cpp:19</div></div>
-<div class="ttc" id="aprime__factorization_8cpp_html_affe577b9bce8f604f5e2f861c63c7099"><div class="ttname"><a href="#affe577b9bce8f604f5e2f861c63c7099">SieveOfEratosthenes</a></div><div class="ttdeci">void SieveOfEratosthenes(int N)</div><div class="ttdef"><b>Definition</b> prime_factorization.cpp:23</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="456" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aprime__factorization_8cpp_html_a0ece0145fb29a5cf48378c23dde2da46"><div class="ttname"><a href="#a0ece0145fb29a5cf48378c23dde2da46">prime_factorization</a></div><div class="ttdeci">void prime_factorization(int num)</div><div class="ttdef"><b>Definition</b> <a href="../../db/d0d/prime__factorization_8cpp_source.html#l00040">prime_factorization.cpp:40</a></div></div>
+<div class="ttc" id="aprime__factorization_8cpp_html_acfb0df439a4beae5a34ef131ce737c1b"><div class="ttname"><a href="#acfb0df439a4beae5a34ef131ce737c1b">factors</a></div><div class="ttdeci">std::vector&lt; std::pair&lt; int, int &gt; &gt; factors</div><div class="ttdef"><b>Definition</b> <a href="../../db/d0d/prime__factorization_8cpp_source.html#l00019">prime_factorization.cpp:19</a></div></div>
+<div class="ttc" id="aprime__factorization_8cpp_html_affe577b9bce8f604f5e2f861c63c7099"><div class="ttname"><a href="#affe577b9bce8f604f5e2f861c63c7099">SieveOfEratosthenes</a></div><div class="ttdeci">void SieveOfEratosthenes(int N)</div><div class="ttdef"><b>Definition</b> <a href="../../db/d0d/prime__factorization_8cpp_source.html#l00023">prime_factorization.cpp:23</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0ece0145fb29a5cf48378c23dde2da46" name="a0ece0145fb29a5cf48378c23dde2da46"></a>
@@ -205,6 +220,8 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Prime factorization of a number </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d0d/prime__factorization_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../db/d0d/prime__factorization_8cpp_source.html">prime_factorization.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   40</span>                                  {</div>
 <div class="line"><span class="lineno">   41</span>    <span class="keywordtype">int</span> number = num;</div>
 <div class="line"><span class="lineno">   42</span> </div>
@@ -222,17 +239,11 @@ Here is the call graph for this function:</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> (count)</div>
-<div class="line"><span class="lineno">   57</span>            <a class="code hl_variable" href="#acfb0df439a4beae5a34ef131ce737c1b">factors</a>.push_back(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(<a class="code hl_variable" href="#af097796783684712b8326e5b82bfd4fe">prime_numbers</a>[i], count));</div>
+<div class="line"><span class="lineno">   57</span>            <a class="code hl_variable" href="#acfb0df439a4beae5a34ef131ce737c1b">factors</a>.push_back(std::make_pair(<a class="code hl_variable" href="#af097796783684712b8326e5b82bfd4fe">prime_numbers</a>[i], count));</div>
 <div class="line"><span class="lineno">   58</span>    }</div>
 <div class="line"><span class="lineno">   59</span>}</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="aprime__factorization_8cpp_html_af097796783684712b8326e5b82bfd4fe"><div class="ttname"><a href="#af097796783684712b8326e5b82bfd4fe">prime_numbers</a></div><div class="ttdeci">std::vector&lt; int &gt; prime_numbers</div><div class="ttdef"><b>Definition</b> prime_factorization.cpp:16</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.svg" width="298" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aprime__factorization_8cpp_html_af097796783684712b8326e5b82bfd4fe"><div class="ttname"><a href="#af097796783684712b8326e5b82bfd4fe">prime_numbers</a></div><div class="ttdeci">std::vector&lt; int &gt; prime_numbers</div><div class="ttdef"><b>Definition</b> <a href="../../db/d0d/prime__factorization_8cpp_source.html#l00016">prime_factorization.cpp:16</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="affe577b9bce8f604f5e2f861c63c7099" name="affe577b9bce8f604f5e2f861c63c7099"></a>
@@ -250,9 +261,11 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Calculating prime number upto a given range </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d0d/prime__factorization_8cpp_source.html#l00023">23</a> of file <a class="el" href="../../db/d0d/prime__factorization_8cpp_source.html">prime_factorization.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   23</span>                                {</div>
 <div class="line"><span class="lineno">   24</span>    <span class="comment">// initializes the array isprime</span></div>
-<div class="line"><span class="lineno">   25</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/memset.html">memset</a>(<a class="code hl_variable" href="#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>, <span class="keyword">true</span>, <span class="keyword">sizeof</span> <a class="code hl_variable" href="#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>);</div>
+<div class="line"><span class="lineno">   25</span>    memset(<a class="code hl_variable" href="#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>, <span class="keyword">true</span>, <span class="keyword">sizeof</span> <a class="code hl_variable" href="#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>);</div>
 <div class="line"><span class="lineno">   26</span> </div>
 <div class="line"><span class="lineno">   27</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i &lt;= <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
 <div class="line"><span class="lineno">   28</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>[i]) {</div>
@@ -262,19 +275,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   32</span> </div>
 <div class="line"><span class="lineno">   33</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i &lt;= <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
 <div class="line"><span class="lineno">   34</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>[i])</div>
-<div class="line"><span class="lineno">   35</span>            <a class="code hl_variable" href="#af097796783684712b8326e5b82bfd4fe">prime_numbers</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(i);</div>
+<div class="line"><span class="lineno">   35</span>            <a class="code hl_variable" href="#af097796783684712b8326e5b82bfd4fe">prime_numbers</a>.push_back(i);</div>
 <div class="line"><span class="lineno">   36</span>    }</div>
 <div class="line"><span class="lineno">   37</span>}</div>
-<div class="ttc" id="amemset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/memset.html">std::memset</a></div><div class="ttdeci">T memset(T... args)</div></div>
-<div class="ttc" id="aprime__factorization_8cpp_html_a7fe38b570a51e448430d6a0f072c2f23"><div class="ttname"><a href="#a7fe38b570a51e448430d6a0f072c2f23">isprime</a></div><div class="ttdeci">bool isprime[1000006]</div><div class="ttdef"><b>Definition</b> prime_factorization.cpp:13</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.svg" width="359" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aprime__factorization_8cpp_html_a7fe38b570a51e448430d6a0f072c2f23"><div class="ttname"><a href="#a7fe38b570a51e448430d6a0f072c2f23">isprime</a></div><div class="ttdeci">bool isprime[1000006]</div><div class="ttdef"><b>Definition</b> <a href="../../db/d0d/prime__factorization_8cpp_source.html#l00013">prime_factorization.cpp:13</a></div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Variable Documentation</h2>
@@ -285,12 +291,14 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt;int, int&gt; &gt; factors</td>
+          <td class="memname">std::vector&lt;std::pair&lt;int, int&gt; &gt; factors</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>list of prime factor-pairs </p>
 
+<p class="definition">Definition at line <a class="el" href="../../db/d0d/prime__factorization_8cpp_source.html#l00019">19</a> of file <a class="el" href="../../db/d0d/prime__factorization_8cpp_source.html">prime_factorization.cpp</a>.</p>
+
 </div>
 </div>
 <a id="a7fe38b570a51e448430d6a0f072c2f23" name="a7fe38b570a51e448430d6a0f072c2f23"></a>
@@ -306,6 +314,8 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 <p>Declaring variables for maintaing prime numbers and to check whether a number is prime or not </p>
 
+<p class="definition">Definition at line <a class="el" href="../../db/d0d/prime__factorization_8cpp_source.html#l00013">13</a> of file <a class="el" href="../../db/d0d/prime__factorization_8cpp_source.html">prime_factorization.cpp</a>.</p>
+
 </div>
 </div>
 <a id="af097796783684712b8326e5b82bfd4fe" name="af097796783684712b8326e5b82bfd4fe"></a>
@@ -315,12 +325,14 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;int&gt; prime_numbers</td>
+          <td class="memname">std::vector&lt;int&gt; prime_numbers</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>list of prime numbers </p>
 
+<p class="definition">Definition at line <a class="el" href="../../db/d0d/prime__factorization_8cpp_source.html#l00016">16</a> of file <a class="el" href="../../db/d0d/prime__factorization_8cpp_source.html">prime_factorization.cpp</a>.</p>
+
 </div>
 </div>
 </div><!-- contents -->
diff --git a/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.map b/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.map
deleted file mode 100644
index 11779fb82..000000000
--- a/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="prime_factorization" name="prime_factorization">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,137,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="185,5,292,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="137,16,169,16,169,21,137,21"/>
-</map>
diff --git a/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.md5 b/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.md5
deleted file mode 100644
index dba3c0665..000000000
--- a/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-39463249eda957912050e25fa5b14204
\ No newline at end of file
diff --git a/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.svg b/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.svg
deleted file mode 100644
index 39ef96ac5..000000000
--- a/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: prime_factorization Pages: 1 -->
-<svg width="223pt" height="27pt"
- viewBox="0.00 0.00 223.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>prime_factorization</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-19.25 0,-19.25 0,0 98.5,0 98.5,-19.25"/>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">prime_factorization</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215,-19.25 134.5,-19.25 134.5,0 215,0 215,-19.25"/>
-<text text-anchor="middle" x="174.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.71,-9.62C106.61,-9.62 114.81,-9.62 122.77,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.68,-13.13 132.68,-9.63 122.68,-6.13 122.68,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph_org.svg b/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph_org.svg
deleted file mode 100644
index 82dccc3d6..000000000
--- a/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: prime_factorization Pages: 1 -->
-<svg width="223pt" height="27pt"
- viewBox="0.00 0.00 223.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>prime_factorization</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="98.5,-19.25 0,-19.25 0,0 98.5,0 98.5,-19.25"/>
-<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">prime_factorization</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215,-19.25 134.5,-19.25 134.5,0 215,0 215,-19.25"/>
-<text text-anchor="middle" x="174.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.71,-9.62C106.61,-9.62 114.81,-9.62 122.77,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.68,-13.13 132.68,-9.63 122.68,-6.13 122.68,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index a81e81a96..000000000
--- a/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,55,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="140,5,211,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,56,102,40,124,32,126,37,104,45,56,61"/>
-<area shape="rect" id="Node000003" href="$db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46" title=" " alt="" coords="110,55,241,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,65,94,65,94,70,55,70"/>
-<area shape="rect" id="Node000005" href="$db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099" title=" " alt="" coords="103,104,248,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="56,74,104,90,120,96,118,101,102,95,54,79"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="320,55,427,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="242,65,304,65,304,70,242,70"/>
-<area shape="rect" id="Node000006" 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="296,104,450,130"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="248,114,280,114,280,120,248,120"/>
-</map>
diff --git a/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index b80f4f7c7..000000000
--- a/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a678cdb0c261d5929793570d49f4c22a
\ No newline at end of file
diff --git a/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index c78c6957f..000000000
--- a/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="342pt" height="101pt"
- viewBox="0.00 0.00 341.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.25,-93.25 100.75,-93.25 100.75,-74 154.25,-74 154.25,-93.25"/>
-<text text-anchor="middle" x="127.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-53.03C47.7,-56.75 61.08,-61.5 73,-65.62 78.42,-67.5 84.15,-69.46 89.78,-71.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.32,-74.56 98.91,-74.44 90.56,-67.93 88.32,-74.56"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-56.25 78.25,-56.25 78.25,-37 176.75,-37 176.75,-56.25"/>
-<text text-anchor="middle" x="127.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">prime_factorization</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.17,-46.62C45.45,-46.62 55.85,-46.62 66.61,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.35,-50.13 76.35,-46.63 66.35,-43.13 66.35,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="182,-19.25 73,-19.25 73,0 182,0 182,-19.25"/>
-<text text-anchor="middle" x="127.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">SieveOfEratosthenes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-40.22C47.7,-36.5 61.08,-31.75 73,-27.62 76.99,-26.25 81.14,-24.82 85.3,-23.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.41,-26.73 94.76,-20.21 84.17,-20.1 86.41,-26.73"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="316.12,-56.25 235.62,-56.25 235.62,-37 316.12,-37 316.12,-56.25"/>
-<text text-anchor="middle" x="275.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.24,-46.62C192.35,-46.62 209.03,-46.62 224.27,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.07,-50.13 234.07,-46.63 224.07,-43.13 224.07,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="333.75,-19.25 218,-19.25 218,0 333.75,0 333.75,-19.25"/>
-<text text-anchor="middle" x="275.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.17,-9.62C190.05,-9.62 198.25,-9.62 206.37,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.25,-13.13 216.25,-9.63 206.25,-6.13 206.25,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 29ce4d945..000000000
--- a/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="342pt" height="101pt"
- viewBox="0.00 0.00 341.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.25,-93.25 100.75,-93.25 100.75,-74 154.25,-74 154.25,-93.25"/>
-<text text-anchor="middle" x="127.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-53.03C47.7,-56.75 61.08,-61.5 73,-65.62 78.42,-67.5 84.15,-69.46 89.78,-71.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.32,-74.56 98.91,-74.44 90.56,-67.93 88.32,-74.56"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-56.25 78.25,-56.25 78.25,-37 176.75,-37 176.75,-56.25"/>
-<text text-anchor="middle" x="127.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">prime_factorization</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.17,-46.62C45.45,-46.62 55.85,-46.62 66.61,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.35,-50.13 76.35,-46.63 66.35,-43.13 66.35,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="182,-19.25 73,-19.25 73,0 182,0 182,-19.25"/>
-<text text-anchor="middle" x="127.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">SieveOfEratosthenes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-40.22C47.7,-36.5 61.08,-31.75 73,-27.62 76.99,-26.25 81.14,-24.82 85.3,-23.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.41,-26.73 94.76,-20.21 84.17,-20.1 86.41,-26.73"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="316.12,-56.25 235.62,-56.25 235.62,-37 316.12,-37 316.12,-56.25"/>
-<text text-anchor="middle" x="275.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.24,-46.62C192.35,-46.62 209.03,-46.62 224.27,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.07,-50.13 234.07,-46.63 224.07,-43.13 224.07,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="333.75,-19.25 218,-19.25 218,0 333.75,0 333.75,-19.25"/>
-<text text-anchor="middle" x="275.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.17,-9.62C190.05,-9.62 198.25,-9.62 206.37,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.25,-13.13 216.25,-9.63 206.25,-6.13 206.25,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.map b/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.map
deleted file mode 100644
index 012fe26d4..000000000
--- a/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="SieveOfEratosthenes" name="SieveOfEratosthenes">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,151,31"/>
-<area shape="rect" id="Node000002" 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="199,5,353,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="151,16,183,16,183,21,151,21"/>
-</map>
diff --git a/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.md5 b/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.md5
deleted file mode 100644
index 5e595e59d..000000000
--- a/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a0cdbe92287bf56c25c5b7ac7c1c3dec
\ No newline at end of file
diff --git a/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.svg b/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.svg
deleted file mode 100644
index 13007e494..000000000
--- a/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: SieveOfEratosthenes Pages: 1 -->
-<svg width="269pt" height="27pt"
- viewBox="0.00 0.00 268.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>SieveOfEratosthenes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="109,-19.25 0,-19.25 0,0 109,0 109,-19.25"/>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">SieveOfEratosthenes</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.75,-19.25 145,-19.25 145,0 260.75,0 260.75,-19.25"/>
-<text text-anchor="middle" x="202.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.17,-9.62C117.05,-9.62 125.25,-9.62 133.37,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.25,-13.13 143.25,-9.63 133.25,-6.13 133.25,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph_org.svg b/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph_org.svg
deleted file mode 100644
index d91433ddb..000000000
--- a/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: SieveOfEratosthenes Pages: 1 -->
-<svg width="269pt" height="27pt"
- viewBox="0.00 0.00 268.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>SieveOfEratosthenes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="109,-19.25 0,-19.25 0,0 109,0 109,-19.25"/>
-<text text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">SieveOfEratosthenes</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.75,-19.25 145,-19.25 145,0 260.75,0 260.75,-19.25"/>
-<text text-anchor="middle" x="202.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.17,-9.62C117.05,-9.62 125.25,-9.62 133.37,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.25,-13.13 143.25,-9.63 133.25,-6.13 133.25,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d0d/prime__factorization_8cpp_source.html b/db/d0d/prime__factorization_8cpp_source.html
new file mode 100644
index 000000000..0f26607c7
--- /dev/null
+++ b/db/d0d/prime__factorization_8cpp_source.html
@@ -0,0 +1,215 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/prime_factorization.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/d0d/prime__factorization_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">prime_factorization.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../db/d0d/prime__factorization_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"><a class="line" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">   13</a></span><span class="keywordtype">bool</span> <a class="code hl_variable" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>[1000006];</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"><a class="line" href="../../db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe">   16</a></span>std::vector&lt;int&gt; <a class="code hl_variable" href="../../db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe">prime_numbers</a>;</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"><a class="line" href="../../db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b">   19</a></span>std::vector&lt;std::pair&lt;int, int&gt;&gt; <a class="code hl_variable" href="../../db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b">factors</a>;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="foldopen" id="foldopen00023" data-start="{" data-end="}">
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"><a class="line" href="../../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099">   23</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099">SieveOfEratosthenes</a>(<span class="keywordtype">int</span> N) {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="comment">// initializes the array isprime</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    memset(<a class="code hl_variable" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>, <span class="keyword">true</span>, <span class="keyword">sizeof</span> <a class="code hl_variable" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>);</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i &lt;= N; i++) {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>[i]) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 2 * i; j &lt;= N; j += i) <a class="code hl_variable" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>[j] = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        }</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    }</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i &lt;= N; i++) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a>[i])</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>            <a class="code hl_variable" href="../../db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe">prime_numbers</a>.push_back(i);</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    }</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>}</div>
+</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="foldopen" id="foldopen00040" data-start="{" data-end="}">
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46">   40</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46">prime_factorization</a>(<span class="keywordtype">int</span> num) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordtype">int</span> number = num;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; <a class="code hl_variable" href="../../db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe">prime_numbers</a>[i] &lt;= num; i++) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="keywordtype">int</span> count = 0;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="comment">// termination condition</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="keywordflow">if</span> (number == 1) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        <span class="keywordflow">while</span> (number % <a class="code hl_variable" href="../../db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe">prime_numbers</a>[i] == 0) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            count++;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            number = number / <a class="code hl_variable" href="../../db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe">prime_numbers</a>[i];</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        <span class="keywordflow">if</span> (count)</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            <a class="code hl_variable" href="../../db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b">factors</a>.push_back(std::make_pair(<a class="code hl_variable" href="../../db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe">prime_numbers</a>[i], count));</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>}</div>
+</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   62</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordtype">int</span> num;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\t\tComputes the prime factorization\n\n&quot;</span>;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Type in a number: &quot;</span>;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    std::cin &gt;&gt; num;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <a class="code hl_function" href="../../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099">SieveOfEratosthenes</a>(num);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <a class="code hl_function" href="../../db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46">prime_factorization</a>(num);</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="comment">// Prime factors with their powers in the given number in new line</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> it : <a class="code hl_variable" href="../../db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b">factors</a>) {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        std::cout &lt;&lt; it.first &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; it.second &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    }</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>}</div>
+</div>
+<div class="ttc" id="aprime__factorization_8cpp_html_a0ece0145fb29a5cf48378c23dde2da46"><div class="ttname"><a href="../../db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46">prime_factorization</a></div><div class="ttdeci">void prime_factorization(int num)</div><div class="ttdef"><b>Definition</b> <a href="#l00040">prime_factorization.cpp:40</a></div></div>
+<div class="ttc" id="aprime__factorization_8cpp_html_a7fe38b570a51e448430d6a0f072c2f23"><div class="ttname"><a href="../../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">isprime</a></div><div class="ttdeci">bool isprime[1000006]</div><div class="ttdef"><b>Definition</b> <a href="#l00013">prime_factorization.cpp:13</a></div></div>
+<div class="ttc" id="aprime__factorization_8cpp_html_acfb0df439a4beae5a34ef131ce737c1b"><div class="ttname"><a href="../../db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b">factors</a></div><div class="ttdeci">std::vector&lt; std::pair&lt; int, int &gt; &gt; factors</div><div class="ttdef"><b>Definition</b> <a href="#l00019">prime_factorization.cpp:19</a></div></div>
+<div class="ttc" id="aprime__factorization_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00062">prime_factorization.cpp:62</a></div></div>
+<div class="ttc" id="aprime__factorization_8cpp_html_af097796783684712b8326e5b82bfd4fe"><div class="ttname"><a href="../../db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe">prime_numbers</a></div><div class="ttdeci">std::vector&lt; int &gt; prime_numbers</div><div class="ttdef"><b>Definition</b> <a href="#l00016">prime_factorization.cpp:16</a></div></div>
+<div class="ttc" id="aprime__factorization_8cpp_html_affe577b9bce8f604f5e2f861c63c7099"><div class="ttname"><a href="../../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099">SieveOfEratosthenes</a></div><div class="ttdeci">void SieveOfEratosthenes(int N)</div><div class="ttdef"><b>Definition</b> <a href="#l00023">prime_factorization.cpp:23</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../db/d0d/prime__factorization_8cpp.html">prime_factorization.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.map b/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.map
index 98a1020ff..29dbfdc0f 100644
--- a/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.map
+++ b/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.map
@@ -1,7 +1,5 @@
 <map id="data_structures::queue_using_array::Queue_Array" name="data_structures::queue_using_array::Queue_Array">
-<area shape="rect" id="Node000001" title="Queue_Array class containing the main data and also index of head and tail of the array." alt="" coords="5,198,185,238"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array.html" title=" " alt="" coords="29,94,161,135"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="98,150,98,197,92,197,92,150"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="52,5,138,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="98,46,98,93,92,93,92,46"/>
+<area shape="rect" id="Node000001" title="Queue_Array class containing the main data and also index of head and tail of the array." alt="" coords="5,109,185,150"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="29,5,161,46"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="98,62,98,109,92,109,92,62"/>
 </map>
diff --git a/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.md5 b/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.md5
index 8461d1c84..5095286a1 100644
--- a/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.md5
+++ b/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.md5
@@ -1 +1 @@
-c6fff7c9babad1e1e9b77c000b8dc3f1
\ No newline at end of file
+c911091842386f47fd5ab4f5193056dc
\ No newline at end of file
diff --git a/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.svg b/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.svg
index edd1c3be5..fc80b789a 100644
--- a/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.svg
+++ b/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.svg
@@ -4,8 +4,8 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: data_structures::queue_using_array::Queue_Array Pages: 1 -->
-<svg width="143pt" height="183pt"
- viewBox="0.00 0.00 142.50 182.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="143pt" height="116pt"
+ viewBox="0.00 0.00 142.50 116.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
 <svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
@@ -17,7 +17,7 @@
 ]]></style>
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
 <svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 178.75)">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 112.25)">
 <title>data_structures::queue_using_array::Queue_Array</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="116.5,-108.25 18,-108.25 18,-77.75 116.5,-77.75 116.5,-108.25"/>
 <text text-anchor="start" x="26" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; int16_t,</text>
 <text text-anchor="middle" x="67.25" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00"> max_size &gt;</text>
@@ -49,25 +49,6 @@
 </g>
 <text text-anchor="middle" x="74.38" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> arr</text>
 </g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="99.62,-174.75 34.88,-174.75 34.88,-155.5 99.62,-155.5 99.62,-174.75"/>
-<text text-anchor="middle" x="67.25" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::int16_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M67.25,-143.92C67.25,-132.66 67.25,-118.89 67.25,-108.67"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="63.75,-143.73 67.25,-153.73 70.75,-143.73 63.75,-143.73"/>
-</a>
-</g>
-<text text-anchor="middle" x="88.62" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
 </g>
 </svg>
 </svg>
diff --git a/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph_org.svg b/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph_org.svg
index d8545abd2..003a88b14 100644
--- a/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph_org.svg
+++ b/db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph_org.svg
@@ -4,9 +4,9 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: data_structures::queue_using_array::Queue_Array Pages: 1 -->
-<svg width="143pt" height="183pt"
- viewBox="0.00 0.00 142.50 182.75" 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 178.75)">
+<svg width="143pt" height="116pt"
+ viewBox="0.00 0.00 142.50 116.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 112.25)">
 <title>data_structures::queue_using_array::Queue_Array</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="116.5,-108.25 18,-108.25 18,-77.75 116.5,-77.75 116.5,-108.25"/>
 <text text-anchor="start" x="26" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; int16_t,</text>
 <text text-anchor="middle" x="67.25" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00"> max_size &gt;</text>
@@ -38,24 +38,5 @@
 </g>
 <text text-anchor="middle" x="74.38" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> arr</text>
 </g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="99.62,-174.75 34.88,-174.75 34.88,-155.5 99.62,-155.5 99.62,-174.75"/>
-<text text-anchor="middle" x="67.25" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::int16_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M67.25,-143.92C67.25,-132.66 67.25,-118.89 67.25,-108.67"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="63.75,-143.73 67.25,-153.73 70.75,-143.73 63.75,-143.73"/>
-</a>
-</g>
-<text text-anchor="middle" x="88.62" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
 </g>
 </svg>
diff --git a/db/d10/classdsu__coll__graph.map b/db/d10/classdsu__coll__graph.map
deleted file mode 100644
index 52e8e1508..000000000
--- a/db/d10/classdsu__coll__graph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="dsu" name="dsu">
-<area shape="rect" id="Node000001" title="Disjoint sets union data structure, class based representation." alt="" coords="61,243,103,268"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="5,94,159,120"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="85,135,85,242,79,242,79,135"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="35,5,129,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="85,47,85,94,79,94,79,47"/>
-</map>
diff --git a/db/d10/classdsu__coll__graph.md5 b/db/d10/classdsu__coll__graph.md5
deleted file mode 100644
index cb468c547..000000000
--- a/db/d10/classdsu__coll__graph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6e4f85876f6fd169bd7520fe9ea2e678
\ No newline at end of file
diff --git a/db/d10/classdsu__coll__graph.svg b/db/d10/classdsu__coll__graph.svg
deleted file mode 100644
index 3ab17a602..000000000
--- a/db/d10/classdsu__coll__graph.svg
+++ /dev/null
@@ -1,89 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dsu Pages: 1 -->
-<svg width="123pt" height="205pt"
- viewBox="0.00 0.00 123.00 205.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 201.25)">
-<title>dsu</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Disjoint sets union data structure, class based representation.">
-<polygon fill="#999999" stroke="#666666" points="73.38,-19.25 41.62,-19.25 41.62,0 73.38,0 73.38,-19.25"/>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="115,-130.75 0,-130.75 0,-111.5 115,-111.5 115,-130.75"/>
-<text text-anchor="middle" x="57.5" y="-117.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; uint64_t &gt;</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node2&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M57.5,-99.92C57.5,-76 57.5,-37.22 57.5,-19.71"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="54,-99.65 57.5,-109.65 61,-99.65 54,-99.65"/>
-</a>
-</g>
-<text text-anchor="middle" x="84.88" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> depth</text>
-<text text-anchor="middle" x="84.88" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">maxElement</text>
-<text text-anchor="middle" x="84.88" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">minElement</text>
-<text text-anchor="middle" x="84.88" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">p</text>
-<text text-anchor="middle" x="84.88" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">setSize</text>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="92.5,-197.25 22.5,-197.25 22.5,-178 92.5,-178 92.5,-197.25"/>
-<text text-anchor="middle" x="57.5" y="-183.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint64_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M57.5,-166.15C57.5,-154.32 57.5,-140.04 57.5,-131.02"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="54,-166.14 57.5,-176.14 61,-166.14 54,-166.14"/>
-</a>
-</g>
-<text text-anchor="middle" x="78.88" y="-150.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d10/classdsu__coll__graph_org.svg b/db/d10/classdsu__coll__graph_org.svg
deleted file mode 100644
index 15ef269d8..000000000
--- a/db/d10/classdsu__coll__graph_org.svg
+++ /dev/null
@@ -1,63 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dsu Pages: 1 -->
-<svg width="123pt" height="205pt"
- viewBox="0.00 0.00 123.00 205.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 201.25)">
-<title>dsu</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Disjoint sets union data structure, class based representation.">
-<polygon fill="#999999" stroke="#666666" points="73.38,-19.25 41.62,-19.25 41.62,0 73.38,0 73.38,-19.25"/>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="115,-130.75 0,-130.75 0,-111.5 115,-111.5 115,-130.75"/>
-<text text-anchor="middle" x="57.5" y="-117.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; uint64_t &gt;</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node2&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M57.5,-99.92C57.5,-76 57.5,-37.22 57.5,-19.71"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="54,-99.65 57.5,-109.65 61,-99.65 54,-99.65"/>
-</a>
-</g>
-<text text-anchor="middle" x="84.88" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> depth</text>
-<text text-anchor="middle" x="84.88" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">maxElement</text>
-<text text-anchor="middle" x="84.88" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">minElement</text>
-<text text-anchor="middle" x="84.88" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">p</text>
-<text text-anchor="middle" x="84.88" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">setSize</text>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="92.5,-197.25 22.5,-197.25 22.5,-178 92.5,-178 92.5,-197.25"/>
-<text text-anchor="middle" x="57.5" y="-183.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint64_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M57.5,-166.15C57.5,-154.32 57.5,-140.04 57.5,-131.02"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="54,-166.14 57.5,-176.14 61,-166.14 54,-166.14"/>
-</a>
-</g>
-<text text-anchor="middle" x="78.88" y="-150.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
-</g>
-</svg>
diff --git a/db/d16/0__1__knapsack_8cpp.html b/db/d16/0__1__knapsack_8cpp.html
index 54422754f..7690552ec 100644
--- a/db/d16/0__1__knapsack_8cpp.html
+++ b/db/d16/0__1__knapsack_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/0_1_knapsack.cpp File Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming/0_1_knapsack.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for 0_1_knapsack.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/da8/0__1__knapsack_8cpp__incl.svg" width="326" height="126"><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">
+</div>
+<p><a href="../../db/d16/0__1__knapsack_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
@@ -135,7 +154,7 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a15edf30f336885e5b851f6b7199c6cd1" id="r_a15edf30f336885e5b851f6b7199c6cd1"><td class="memTemplParams" colspan="2">template&lt;size_t n&gt; </td></tr>
-<tr class="memitem:a15edf30f336885e5b851f6b7199c6cd1"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a15edf30f336885e5b851f6b7199c6cd1">dynamic_programming::knapsack::maxKnapsackValue</a> (const int capacity, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt; &amp;weight, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt; &amp;value)</td></tr>
+<tr class="memitem:a15edf30f336885e5b851f6b7199c6cd1"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a15edf30f336885e5b851f6b7199c6cd1">dynamic_programming::knapsack::maxKnapsackValue</a> (const int capacity, const std::array&lt; int, n &gt; &amp;weight, const std::array&lt; int, n &gt; &amp;value)</td></tr>
 <tr class="memdesc:a15edf30f336885e5b851f6b7199c6cd1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Picking up all those items whose combined weight is below the given capacity and calculating the value of those picked items. Trying all possible combinations will yield the maximum knapsack value.  <br /></td></tr>
 <tr class="separator:a15edf30f336885e5b851f6b7199c6cd1"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -154,6 +173,8 @@ Algorithm</h3>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Anmol3299" target="_blank">Anmol</a> </dd>
 <dd>
 <a href="https://github.com/Pardeep009" target="_blank">Pardeep</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../db/d16/0__1__knapsack_8cpp_source.html">0_1_knapsack.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -172,18 +193,15 @@ Algorithm</h3>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d16/0__1__knapsack_8cpp_source.html#l00126">126</a> of file <a class="el" href="../../db/d16/0__1__knapsack_8cpp_source.html">0_1_knapsack.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  126</span>           {</div>
 <div class="line"><span class="lineno">  127</span>    <span class="comment">// Testing</span></div>
 <div class="line"><span class="lineno">  128</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
 <div class="line"><span class="lineno">  129</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  130</span>}</div>
-<div class="ttc" id="a0__1__knapsack_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the above algorithm.</div><div class="ttdef"><b>Definition</b> 0_1_knapsack.cpp:96</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d16/0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="a0__1__knapsack_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the above algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d16/0__1__knapsack_8cpp_source.html#l00096">0_1_knapsack.cpp:96</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a15edf30f336885e5b851f6b7199c6cd1" name="a15edf30f336885e5b851f6b7199c6cd1"></a>
@@ -202,12 +220,12 @@ template&lt;size_t n&gt; </div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>weight</em></span>, </td>
+          <td class="paramtype">const std::array&lt; int, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>weight</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>value</em></span>&#160;)</td>
+          <td class="paramtype">const std::array&lt; int, n &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>value</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -228,9 +246,11 @@ template&lt;size_t n&gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>maximum value obtainable with a given capacity. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d16/0__1__knapsack_8cpp_source.html#l00051">51</a> of file <a class="el" href="../../db/d16/0__1__knapsack_8cpp_source.html">0_1_knapsack.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   52</span>                                                    {</div>
-<div class="line"><span class="lineno">   53</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;int&gt;</a> &gt; maxValue(n + 1,</div>
-<div class="line"><span class="lineno">   54</span>                                            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(capacity + 1, 0));</div>
+<div class="line"><span class="lineno">   53</span>    std::vector&lt;std::vector&lt;int&gt; &gt; maxValue(n + 1,</div>
+<div class="line"><span class="lineno">   54</span>                                            std::vector&lt;int&gt;(capacity + 1, 0));</div>
 <div class="line"><span class="lineno">   55</span>    <span class="comment">// outer loop will select no of items allowed</span></div>
 <div class="line"><span class="lineno">   56</span>    <span class="comment">// inner loop will select the capacity of the knapsack bag</span></div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordtype">int</span> items = <span class="keyword">sizeof</span>(weight) / <span class="keyword">sizeof</span>(weight[0]);</div>
@@ -253,7 +273,7 @@ template&lt;size_t n&gt; </div>
 <div class="line"><span class="lineno">   74</span>                <span class="comment">// not picking the current item</span></div>
 <div class="line"><span class="lineno">   75</span>                <span class="keywordtype">int</span> profit2 = maxValue[i - 1][j];</div>
 <div class="line"><span class="lineno">   76</span> </div>
-<div class="line"><span class="lineno">   77</span>                maxValue[i][j] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(profit1, profit2);</div>
+<div class="line"><span class="lineno">   77</span>                maxValue[i][j] = std::max(profit1, profit2);</div>
 <div class="line"><span class="lineno">   78</span>            } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">   79</span>                <span class="comment">// as the weight of the current item is greater than the allowed weight, so</span></div>
 <div class="line"><span class="lineno">   80</span>                <span class="comment">// maxProfit will be profit obtained by excluding the current item.</span></div>
@@ -265,14 +285,7 @@ template&lt;size_t n&gt; </div>
 <div class="line"><span class="lineno">   86</span>    <span class="comment">// returning maximum value</span></div>
 <div class="line"><span class="lineno">   87</span>    <span class="keywordflow">return</span> maxValue[items][capacity];</div>
 <div class="line"><span class="lineno">   88</span>}</div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d16/0__1__knapsack_8cpp_a15edf30f336885e5b851f6b7199c6cd1_cgraph.svg" width="340" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -300,41 +313,35 @@ Here is the call graph for this function:</div>
 
 <p>Function to test the above algorithm. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d16/0__1__knapsack_8cpp_source.html#l00096">96</a> of file <a class="el" href="../../db/d16/0__1__knapsack_8cpp_source.html">0_1_knapsack.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   96</span>                   {</div>
 <div class="line"><span class="lineno">   97</span>    <span class="comment">// Test 1</span></div>
 <div class="line"><span class="lineno">   98</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> n1 = 3;                             <span class="comment">// number of items</span></div>
-<div class="line"><span class="lineno">   99</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n1&gt;</a> weight1 = {10, 20, 30};   <span class="comment">// weight of each item</span></div>
-<div class="line"><span class="lineno">  100</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n1&gt;</a> value1 = {60, 100, 120};  <span class="comment">// value of each item</span></div>
+<div class="line"><span class="lineno">   99</span>    std::array&lt;int, n1&gt; weight1 = {10, 20, 30};   <span class="comment">// weight of each item</span></div>
+<div class="line"><span class="lineno">  100</span>    std::array&lt;int, n1&gt; value1 = {60, 100, 120};  <span class="comment">// value of each item</span></div>
 <div class="line"><span class="lineno">  101</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> capacity1 = 50;                     <span class="comment">// capacity of carrying bag</span></div>
 <div class="line"><span class="lineno">  102</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> max_value1 = <a class="code hl_function" href="#a15edf30f336885e5b851f6b7199c6cd1">dynamic_programming::knapsack::maxKnapsackValue</a>(</div>
 <div class="line"><span class="lineno">  103</span>        capacity1, weight1, value1);</div>
 <div class="line"><span class="lineno">  104</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> expected_max_value1 = 220;</div>
 <div class="line"><span class="lineno">  105</span>    assert(max_value1 == expected_max_value1);</div>
-<div class="line"><span class="lineno">  106</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value with &quot;</span> &lt;&lt; n1 &lt;&lt; <span class="stringliteral">&quot; items is &quot;</span></div>
-<div class="line"><span class="lineno">  107</span>              &lt;&lt; max_value1 &lt;&lt; <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">  106</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value with &quot;</span> &lt;&lt; n1 &lt;&lt; <span class="stringliteral">&quot; items is &quot;</span></div>
+<div class="line"><span class="lineno">  107</span>              &lt;&lt; max_value1 &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  108</span> </div>
 <div class="line"><span class="lineno">  109</span>    <span class="comment">// Test 2</span></div>
 <div class="line"><span class="lineno">  110</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> n2 = 4;                               <span class="comment">// number of items</span></div>
-<div class="line"><span class="lineno">  111</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n2&gt;</a> weight2 = {24, 10, 10, 7};  <span class="comment">// weight of each item</span></div>
-<div class="line"><span class="lineno">  112</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n2&gt;</a> value2 = {24, 18, 18, 10};  <span class="comment">// value of each item</span></div>
+<div class="line"><span class="lineno">  111</span>    std::array&lt;int, n2&gt; weight2 = {24, 10, 10, 7};  <span class="comment">// weight of each item</span></div>
+<div class="line"><span class="lineno">  112</span>    std::array&lt;int, n2&gt; value2 = {24, 18, 18, 10};  <span class="comment">// value of each item</span></div>
 <div class="line"><span class="lineno">  113</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> capacity2 = 25;                       <span class="comment">// capacity of carrying bag</span></div>
 <div class="line"><span class="lineno">  114</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> max_value2 = <a class="code hl_function" href="#a15edf30f336885e5b851f6b7199c6cd1">dynamic_programming::knapsack::maxKnapsackValue</a>(</div>
 <div class="line"><span class="lineno">  115</span>        capacity2, weight2, value2);</div>
 <div class="line"><span class="lineno">  116</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> expected_max_value2 = 36;</div>
 <div class="line"><span class="lineno">  117</span>    assert(max_value2 == expected_max_value2);</div>
-<div class="line"><span class="lineno">  118</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value with &quot;</span> &lt;&lt; n2 &lt;&lt; <span class="stringliteral">&quot; items is &quot;</span></div>
-<div class="line"><span class="lineno">  119</span>              &lt;&lt; max_value2 &lt;&lt; <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">  118</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value with &quot;</span> &lt;&lt; n2 &lt;&lt; <span class="stringliteral">&quot; items is &quot;</span></div>
+<div class="line"><span class="lineno">  119</span>              &lt;&lt; max_value2 &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  120</span>}</div>
-<div class="ttc" id="a0__1__knapsack_8cpp_html_a15edf30f336885e5b851f6b7199c6cd1"><div class="ttname"><a href="#a15edf30f336885e5b851f6b7199c6cd1">dynamic_programming::knapsack::maxKnapsackValue</a></div><div class="ttdeci">int maxKnapsackValue(const int capacity, const std::array&lt; int, n &gt; &amp;weight, const std::array&lt; int, n &gt; &amp;value)</div><div class="ttdoc">Picking up all those items whose combined weight is below the given capacity and calculating the valu...</div><div class="ttdef"><b>Definition</b> 0_1_knapsack.cpp:51</div></div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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><!-- 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="../../db/d16/0__1__knapsack_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="a0__1__knapsack_8cpp_html_a15edf30f336885e5b851f6b7199c6cd1"><div class="ttname"><a href="#a15edf30f336885e5b851f6b7199c6cd1">dynamic_programming::knapsack::maxKnapsackValue</a></div><div class="ttdeci">int maxKnapsackValue(const int capacity, const std::array&lt; int, n &gt; &amp;weight, const std::array&lt; int, n &gt; &amp;value)</div><div class="ttdoc">Picking up all those items whose combined weight is below the given capacity and calculating the valu...</div><div class="ttdef"><b>Definition</b> <a href="../../db/d16/0__1__knapsack_8cpp_source.html#l00051">0_1_knapsack.cpp:51</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/db/d16/0__1__knapsack_8cpp_a15edf30f336885e5b851f6b7199c6cd1_cgraph.map b/db/d16/0__1__knapsack_8cpp_a15edf30f336885e5b851f6b7199c6cd1_cgraph.map
deleted file mode 100644
index 671a24d22..000000000
--- a/db/d16/0__1__knapsack_8cpp_a15edf30f336885e5b851f6b7199c6cd1_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="dynamic_programming::knapsack::maxKnapsackValue" name="dynamic_programming::knapsack::maxKnapsackValue">
-<area shape="rect" id="Node000001" title="Picking up all those items whose combined weight is below the given capacity and calculating the valu..." alt="" coords="5,29,214,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="74,29,72,19,78,10,90,5,110,3,130,5,142,11,140,16,129,10,109,8,92,10,81,15,77,20,79,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="262,37,334,62"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="214,47,246,47,246,52,214,52"/>
-</map>
diff --git a/db/d16/0__1__knapsack_8cpp_a15edf30f336885e5b851f6b7199c6cd1_cgraph.md5 b/db/d16/0__1__knapsack_8cpp_a15edf30f336885e5b851f6b7199c6cd1_cgraph.md5
deleted file mode 100644
index 8ee64cddd..000000000
--- a/db/d16/0__1__knapsack_8cpp_a15edf30f336885e5b851f6b7199c6cd1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e1576fe66a7ae64b1010e4a706d93963
\ No newline at end of file
diff --git a/db/d16/0__1__knapsack_8cpp_a15edf30f336885e5b851f6b7199c6cd1_cgraph.svg b/db/d16/0__1__knapsack_8cpp_a15edf30f336885e5b851f6b7199c6cd1_cgraph.svg
deleted file mode 100644
index 33c0a973a..000000000
--- a/db/d16/0__1__knapsack_8cpp_a15edf30f336885e5b851f6b7199c6cd1_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::knapsack::maxKnapsackValue Pages: 1 -->
-<svg width="255pt" height="57pt"
- viewBox="0.00 0.00 254.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>dynamic_programming::knapsack::maxKnapsackValue</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Picking up all those items whose combined weight is below the given capacity and calculating the valu...">
-<polygon fill="#999999" stroke="#666666" points="156.25,-30.5 0,-30.5 0,0 156.25,0 156.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="78.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::knapsack::maxKnapsackValue</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.1,-30.99C47.99,-40.06 56.33,-48.5 78.12,-48.5 90.04,-48.5 97.94,-45.97 101.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.26,-42.83 102.97,-32.49 98.31,-42 105.26,-42.83"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.5,-24.88 192.25,-24.88 192.25,-5.63 246.5,-5.63 246.5,-24.88"/>
-<text text-anchor="middle" x="219.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.49,-15.25C164.87,-15.25 173.1,-15.25 180.68,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.48,-18.75 190.48,-15.25 180.48,-11.75 180.48,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d16/0__1__knapsack_8cpp_a15edf30f336885e5b851f6b7199c6cd1_cgraph_org.svg b/db/d16/0__1__knapsack_8cpp_a15edf30f336885e5b851f6b7199c6cd1_cgraph_org.svg
deleted file mode 100644
index ad75a6046..000000000
--- a/db/d16/0__1__knapsack_8cpp_a15edf30f336885e5b851f6b7199c6cd1_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::knapsack::maxKnapsackValue Pages: 1 -->
-<svg width="255pt" height="57pt"
- viewBox="0.00 0.00 254.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>dynamic_programming::knapsack::maxKnapsackValue</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Picking up all those items whose combined weight is below the given capacity and calculating the valu...">
-<polygon fill="#999999" stroke="#666666" points="156.25,-30.5 0,-30.5 0,0 156.25,0 156.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="78.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::knapsack::maxKnapsackValue</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.1,-30.99C47.99,-40.06 56.33,-48.5 78.12,-48.5 90.04,-48.5 97.94,-45.97 101.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.26,-42.83 102.97,-32.49 98.31,-42 105.26,-42.83"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.5,-24.88 192.25,-24.88 192.25,-5.63 246.5,-5.63 246.5,-24.88"/>
-<text text-anchor="middle" x="219.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.49,-15.25C164.87,-15.25 173.1,-15.25 180.68,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.48,-18.75 190.48,-15.25 180.48,-11.75 180.48,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d16/0__1__knapsack_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/db/d16/0__1__knapsack_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 819c3a10b..000000000
--- a/db/d16/0__1__knapsack_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Function to test the above algorithm." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/db/d16/0__1__knapsack_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/db/d16/0__1__knapsack_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 50d9243aa..000000000
--- a/db/d16/0__1__knapsack_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ce9c02b54a55a52c5e6f99142cae3be1
\ No newline at end of file
diff --git a/db/d16/0__1__knapsack_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/db/d16/0__1__knapsack_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 8a3b2b1dd..000000000
--- a/db/d16/0__1__knapsack_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the above algorithm.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d16/0__1__knapsack_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/db/d16/0__1__knapsack_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 9a36b29f4..000000000
--- a/db/d16/0__1__knapsack_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the above algorithm.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d16/0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d16/0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index a0f601d7c..000000000
--- a/db/d16/0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function to test the above algorithm." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/db/d16/0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d16/0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index c356f959e..000000000
--- a/db/d16/0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-59a49c93f2f2012e2b8144d02e4f7bd1
\ No newline at end of file
diff --git a/db/d16/0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d16/0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 45c850912..000000000
--- a/db/d16/0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the above algorithm.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d16/0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/db/d16/0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 285eae49b..000000000
--- a/db/d16/0__1__knapsack_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the above algorithm.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d16/0__1__knapsack_8cpp_source.html b/db/d16/0__1__knapsack_8cpp_source.html
new file mode 100644
index 000000000..8885d37c1
--- /dev/null
+++ b/db/d16/0__1__knapsack_8cpp_source.html
@@ -0,0 +1,228 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/0_1_knapsack.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/d16/0__1__knapsack_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">0_1_knapsack.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../db/d16/0__1__knapsack_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;array&gt;</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a> {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="keyword">namespace </span>knapsack {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> n&gt;</div>
+<div class="foldopen" id="foldopen00051" data-start="{" data-end="}">
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="../../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1">   51</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1">maxKnapsackValue</a>(<span class="keyword">const</span> <span class="keywordtype">int</span> capacity, <span class="keyword">const</span> std::array&lt;int, n&gt; &amp;weight,</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>                     <span class="keyword">const</span> std::array&lt;int, n&gt; &amp;value) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    std::vector&lt;std::vector&lt;int&gt; &gt; maxValue(n + 1,</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>                                            std::vector&lt;int&gt;(capacity + 1, 0));</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="comment">// outer loop will select no of items allowed</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="comment">// inner loop will select the capacity of the knapsack bag</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordtype">int</span> items = <span class="keyword">sizeof</span>(weight) / <span class="keyword">sizeof</span>(weight[0]);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; items + 1; ++i) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; capacity + 1; ++j) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            <span class="keywordflow">if</span> (i == 0 || j == 0) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>                <span class="comment">// if no of items is zero or capacity is zero, then maxValue</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>                <span class="comment">// will be zero</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>                maxValue[i][j] = 0;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (weight[i - 1] &lt;= j) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>                <span class="comment">// if the ith item&#39;s weight(in the actual array it will be at i-1)</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>                <span class="comment">// is less than or equal to the allowed weight i.e. j then we</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>                <span class="comment">// can pick that item for our knapsack. maxValue will be the</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                <span class="comment">// obtained either by picking the current item or by not picking</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>                <span class="comment">// current item</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>                <span class="comment">// picking the current item</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>                <span class="keywordtype">int</span> profit1 = value[i - 1] + maxValue[i - 1][j - weight[i - 1]];</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>                <span class="comment">// not picking the current item</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>                <span class="keywordtype">int</span> profit2 = maxValue[i - 1][j];</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>                maxValue[i][j] = std::max(profit1, profit2);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>                <span class="comment">// as the weight of the current item is greater than the allowed weight, so</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>                <span class="comment">// maxProfit will be profit obtained by excluding the current item.</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>                maxValue[i][j] = maxValue[i - 1][j];</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>            }</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        }</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    }</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="comment">// returning maximum value</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="keywordflow">return</span> maxValue[items][capacity];</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>}</div>
+</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>}  <span class="comment">// namespace knapsack</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>}  <span class="comment">// namespace dynamic_programming</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="foldopen" id="foldopen00096" data-start="{" data-end="}">
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"><a class="line" href="../../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   96</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="comment">// Test 1</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> n1 = 3;                             <span class="comment">// number of items</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    std::array&lt;int, n1&gt; weight1 = {10, 20, 30};   <span class="comment">// weight of each item</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    std::array&lt;int, n1&gt; value1 = {60, 100, 120};  <span class="comment">// value of each item</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> capacity1 = 50;                     <span class="comment">// capacity of carrying bag</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> max_value1 = dynamic_programming::knapsack::maxKnapsackValue(</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        capacity1, weight1, value1);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> expected_max_value1 = 220;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    assert(max_value1 == expected_max_value1);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value with &quot;</span> &lt;&lt; n1 &lt;&lt; <span class="stringliteral">&quot; items is &quot;</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>              &lt;&lt; max_value1 &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="comment">// Test 2</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> n2 = 4;                               <span class="comment">// number of items</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::array&lt;int, n2&gt; weight2 = {24, 10, 10, 7};  <span class="comment">// weight of each item</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    std::array&lt;int, n2&gt; value2 = {24, 18, 18, 10};  <span class="comment">// value of each item</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> capacity2 = 25;                       <span class="comment">// capacity of carrying bag</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> max_value2 = dynamic_programming::knapsack::maxKnapsackValue(</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        capacity2, weight2, value2);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> expected_max_value2 = 36;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    assert(max_value2 == expected_max_value2);</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value with &quot;</span> &lt;&lt; n2 &lt;&lt; <span class="stringliteral">&quot; items is &quot;</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>              &lt;&lt; max_value2 &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>}</div>
+</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span> </div>
+<div class="foldopen" id="foldopen00126" data-start="{" data-end="}">
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"><a class="line" href="../../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  126</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    <span class="comment">// Testing</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    <a class="code hl_function" href="../../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>}</div>
+</div>
+<div class="ttc" id="a0__1__knapsack_8cpp_html_a15edf30f336885e5b851f6b7199c6cd1"><div class="ttname"><a href="../../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1">dynamic_programming::knapsack::maxKnapsackValue</a></div><div class="ttdeci">int maxKnapsackValue(const int capacity, const std::array&lt; int, n &gt; &amp;weight, const std::array&lt; int, n &gt; &amp;value)</div><div class="ttdoc">Picking up all those items whose combined weight is below the given capacity and calculating the valu...</div><div class="ttdef"><b>Definition</b> <a href="#l00051">0_1_knapsack.cpp:51</a></div></div>
+<div class="ttc" id="a0__1__knapsack_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the above algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00096">0_1_knapsack.cpp:96</a></div></div>
+<div class="ttc" id="a0__1__knapsack_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00126">0_1_knapsack.cpp:126</a></div></div>
+<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../db/d16/0__1__knapsack_8cpp.html">0_1_knapsack.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/d19/structlinear__probing_1_1_entry.html b/db/d19/structlinear__probing_1_1_entry.html
index b6a6bf239..346cc2c27 100644
--- a/db/d19/structlinear__probing_1_1_entry.html
+++ b/db/d19/structlinear__probing_1_1_entry.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: linear_probing::Entry Struct Reference</title>
+<title>TheAlgorithms/C++: linear_probing::Entry Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -114,22 +131,71 @@ $(function(){initNavTree('db/d19/structlinear__probing_1_1_entry.html','../../')
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:a2139f643a3caf074da1db8a9fa16fa77" id="r_a2139f643a3caf074da1db8a9fa16fa77"><td class="memItemLeft" align="right" valign="top"><a id="a2139f643a3caf074da1db8a9fa16fa77" name="a2139f643a3caf074da1db8a9fa16fa77"></a>
-&#160;</td><td class="memItemRight" valign="bottom"><b>Entry</b> (int <a class="el" href="#a4d84e90b73022083761f85f8586c4c2a">key</a>=notPresent)</td></tr>
-<tr class="memdesc:a2139f643a3caf074da1db8a9fa16fa77"><td class="mdescLeft">&#160;</td><td class="mdescRight">constructor <br /></td></tr>
+<tr class="memitem:a2139f643a3caf074da1db8a9fa16fa77" id="r_a2139f643a3caf074da1db8a9fa16fa77"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2139f643a3caf074da1db8a9fa16fa77">Entry</a> (int <a class="el" href="#a4d84e90b73022083761f85f8586c4c2a">key</a>=notPresent)</td></tr>
+<tr class="memdesc:a2139f643a3caf074da1db8a9fa16fa77"><td class="mdescLeft">&#160;</td><td class="mdescRight">constructor  <br /></td></tr>
 <tr class="separator:a2139f643a3caf074da1db8a9fa16fa77"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a4d84e90b73022083761f85f8586c4c2a" id="r_a4d84e90b73022083761f85f8586c4c2a"><td class="memItemLeft" align="right" valign="top"><a id="a4d84e90b73022083761f85f8586c4c2a" name="a4d84e90b73022083761f85f8586c4c2a"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>key</b></td></tr>
-<tr class="memdesc:a4d84e90b73022083761f85f8586c4c2a"><td class="mdescLeft">&#160;</td><td class="mdescRight">key value <br /></td></tr>
+<tr class="memitem:a4d84e90b73022083761f85f8586c4c2a" id="r_a4d84e90b73022083761f85f8586c4c2a"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4d84e90b73022083761f85f8586c4c2a">key</a></td></tr>
+<tr class="memdesc:a4d84e90b73022083761f85f8586c4c2a"><td class="mdescLeft">&#160;</td><td class="mdescRight">key value  <br /></td></tr>
 <tr class="separator:a4d84e90b73022083761f85f8586c4c2a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a class="el" href="../../db/d8b/struct_node.html">Node</a> object that holds key </p>
-</div><hr/>The documentation for this struct was generated from the following file:<ul>
-<li>hashing/<a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp.html">linear_probing_hash_table.cpp</a></li>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
+</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
+<a id="a2139f643a3caf074da1db8a9fa16fa77" name="a2139f643a3caf074da1db8a9fa16fa77"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a2139f643a3caf074da1db8a9fa16fa77">&#9670;&#160;</a></span>Entry()</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">linear_probing::Entry::Entry </td>
+          <td>(</td>
+          <td class="paramtype">int</td>          <td class="paramname"><span class="paramname"><em>key</em></span><span class="paramdefsep"> = </span><span class="paramdefval">notPresent</span></td><td>)</td>
+          <td></td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">explicit</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>constructor </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a4d84e90b73022083761f85f8586c4c2a" name="a4d84e90b73022083761f85f8586c4c2a"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a4d84e90b73022083761f85f8586c4c2a">&#9670;&#160;</a></span>key</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int linear_probing::Entry::key</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>key value </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a>.</p>
+
+</div>
+</div>
+<hr/>The documentation for this struct was generated from the following file:<ul>
+<li>hashing/<a class="el" href="../../d1/dc7/linear__probing__hash__table_8cpp_source.html">linear_probing_hash_table.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/db/d1e/classgraph_1_1_graph-members.html b/db/d1e/classgraph_1_1_graph-members.html
index b06522797..35b434886 100644
--- a/db/d1e/classgraph_1_1_graph-members.html
+++ b/db/d1e/classgraph_1_1_graph-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/db/d27/n__bonacci_8cpp.html b/db/d27/n__bonacci_8cpp.html
index fb3dc7759..930794e6e 100644
--- a/db/d27/n__bonacci_8cpp.html
+++ b/db/d27/n__bonacci_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/n_bonacci.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/n_bonacci.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for n_bonacci.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d95/n__bonacci_8cpp__incl.svg" width="336" height="111"><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">
+</div>
+<p><a href="../../db/d27/n__bonacci_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -134,7 +153,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a6849b68f760be628d5975ab3eddec63d" id="r_a6849b68f760be628d5975ab3eddec63d"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6849b68f760be628d5975ab3eddec63d">math::n_bonacci::N_bonacci</a> (const uint64_t &amp;n, const uint64_t &amp;m)</td></tr>
+<tr class="memitem:a6849b68f760be628d5975ab3eddec63d" id="r_a6849b68f760be628d5975ab3eddec63d"><td class="memItemLeft" align="right" valign="top">std::vector&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6849b68f760be628d5975ab3eddec63d">math::n_bonacci::N_bonacci</a> (const uint64_t &amp;n, const uint64_t &amp;m)</td></tr>
 <tr class="memdesc:a6849b68f760be628d5975ab3eddec63d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Finds the N-Bonacci series for the <code>n</code> parameter value and <code>m</code> parameter terms.  <br /></td></tr>
 <tr class="separator:a6849b68f760be628d5975ab3eddec63d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -149,6 +168,8 @@ Functions</h2></td></tr>
 <p>In general, in N-bonacci sequence, we generate sum of preceding N numbers from the next term.</p>
 <p>For example, a 3-bonacci sequence is the following: 0, 0, 1, 1, 2, 4, 7, 13, 24, 44, 81 In this code we take N and M as input where M is the number of terms to be printed of the N-bonacci series</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Swastyy" target="_blank">Swastika Gupta</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../db/d27/n__bonacci_8cpp_source.html">n_bonacci.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -167,17 +188,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d27/n__bonacci_8cpp_source.html#l00104">104</a> of file <a class="el" href="../../db/d27/n__bonacci_8cpp_source.html">n_bonacci.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  104</span>           {</div>
 <div class="line"><span class="lineno">  105</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  106</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  107</span>}</div>
-<div class="ttc" id="an__bonacci_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> n_bonacci.cpp:69</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d27/n__bonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="an__bonacci_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d27/n__bonacci_8cpp_source.html#l00069">n_bonacci.cpp:69</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6849b68f760be628d5975ab3eddec63d" name="a6849b68f760be628d5975ab3eddec63d"></a>
@@ -187,7 +205,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; math::n_bonacci::N_bonacci </td>
+          <td class="memname">std::vector&lt; uint64_t &gt; math::n_bonacci::N_bonacci </td>
           <td>(</td>
           <td class="paramtype">const uint64_t &amp;</td>          <td class="paramname"><span class="paramname"><em>n</em></span>, </td>
         </tr>
@@ -210,21 +228,21 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>the n-bonacci sequence as vector array </dd></dl>
 <p>we initialise the (n-1)th term as 1 which is the sum of preceding N zeros</p>
 <p>similarily the sum of preceding N zeros and the (N+1)th 1 is also 1</p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d27/n__bonacci_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../db/d27/n__bonacci_8cpp_source.html">n_bonacci.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   40</span>                                                                    {</div>
-<div class="line"><span class="lineno">   41</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> a(</div>
+<div class="line"><span class="lineno">   41</span>    std::vector&lt;uint64_t&gt; a(</div>
 <div class="line"><span class="lineno">   42</span>        m, 0);  <span class="comment">// we create an array of size m filled with zeros</span></div>
 <div class="line"><span class="lineno">   43</span>    <span class="keywordflow">if</span> (m &lt; n || n == 0) {</div>
 <div class="line"><span class="lineno">   44</span>        <span class="keywordflow">return</span> a;</div>
 <div class="line"><span class="lineno">   45</span>    }</div>
 <div class="line"><span class="lineno">   46</span> </div>
-<div class="line"><span class="lineno">   47</span>    a[n - 1] = 1;  <span class="comment">/// we initialise the (n-1)th term as 1 which is the sum of</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">   48</span><span class="comment">                   /// preceding N zeros</span></div>
-<div class="line"><span class="lineno">   49</span><span class="comment"></span>    <span class="keywordflow">if</span> (n == m) {</div>
+<div class="line"><span class="lineno">   47</span>    a[n - 1] = 1;  </div>
+<div class="line"><span class="lineno">   49</span>    <span class="keywordflow">if</span> (n == m) {</div>
 <div class="line"><span class="lineno">   50</span>        <span class="keywordflow">return</span> a;</div>
 <div class="line"><span class="lineno">   51</span>    }</div>
-<div class="line"><span class="lineno">   52</span>    a[n] = 1;  <span class="comment">/// similarily the sum of preceding N zeros and the (N+1)th 1 is</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">   53</span><span class="comment">               /// also 1</span></div>
-<div class="line"><span class="lineno">   54</span><span class="comment"></span>    <span class="keywordflow">for</span> (uint64_t i = n + 1; i &lt; m; i++) {</div>
+<div class="line"><span class="lineno">   52</span>    a[n] = 1;  </div>
+<div class="line"><span class="lineno">   54</span>    <span class="keywordflow">for</span> (uint64_t i = n + 1; i &lt; m; i++) {</div>
 <div class="line"><span class="lineno">   55</span>        <span class="comment">// this is an optimized solution that works in O(M) time and takes O(M)</span></div>
 <div class="line"><span class="lineno">   56</span>        <span class="comment">// extra space here we use the concept of the sliding window the current</span></div>
 <div class="line"><span class="lineno">   57</span>        <span class="comment">// term can be computed using the given formula</span></div>
@@ -232,13 +250,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   59</span>    }</div>
 <div class="line"><span class="lineno">   60</span>    <span class="keywordflow">return</span> a;</div>
 <div class="line"><span class="lineno">   61</span>}</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d27/n__bonacci_8cpp_a6849b68f760be628d5975ab3eddec63d_cgraph.svg" width="147" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -266,18 +278,20 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d27/n__bonacci_8cpp_source.html#l00069">69</a> of file <a class="el" href="../../db/d27/n__bonacci_8cpp_source.html">n_bonacci.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   69</span>                   {</div>
 <div class="line"><span class="lineno">   70</span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a> {</div>
 <div class="line"><span class="lineno">   71</span>        <span class="keyword">const</span> uint64_t n;</div>
 <div class="line"><span class="lineno">   72</span>        <span class="keyword">const</span> uint64_t m;</div>
-<div class="line"><span class="lineno">   73</span>        <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> expected;</div>
+<div class="line"><span class="lineno">   73</span>        <span class="keyword">const</span> std::vector&lt;uint64_t&gt; expected;</div>
 <div class="line"><span class="lineno">   74</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="keyword">const</span> uint64_t in_n, <span class="keyword">const</span> uint64_t in_m,</div>
-<div class="line"><span class="lineno">   75</span>                 <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/initializer_list.html">std::initializer_list&lt;uint64_t&gt;</a> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</div>
+<div class="line"><span class="lineno">   75</span>                 std::initializer_list&lt;uint64_t&gt; <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</div>
 <div class="line"><span class="lineno">   76</span>            : n(in_n), m(in_m), expected(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
 <div class="line"><span class="lineno">   77</span>            assert(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>.size() == m);</div>
 <div class="line"><span class="lineno">   78</span>        }</div>
 <div class="line"><span class="lineno">   79</span>    };</div>
-<div class="line"><span class="lineno">   80</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;TestCase&gt;</a> test_cases = {</div>
+<div class="line"><span class="lineno">   80</span>    <span class="keyword">const</span> std::vector&lt;TestCase&gt; test_cases = {</div>
 <div class="line"><span class="lineno">   81</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(0, 0, {}),</div>
 <div class="line"><span class="lineno">   82</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(0, 1, {0}),</div>
 <div class="line"><span class="lineno">   83</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(0, 2, {0, 0}),</div>
@@ -294,19 +308,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   94</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;tc : test_cases) {</div>
 <div class="line"><span class="lineno">   95</span>        assert(math::n_bonacci::N_bonacci(tc.n, tc.m) == tc.expected);</div>
 <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/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   97</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   98</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="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="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
-<div class="ttc" id="ainitializer_list_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/initializer_list.html">std::initializer_list</a></div></div>
-<div class="ttc" id="astruct_test_case_html"><div class="ttname"><a href="../../da/d86/struct_test_case.html">TestCase</a></div><div class="ttdoc">represents single example inputs and expected output of the function longest_common_string_length</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:54</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d27/n__bonacci_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="astruct_test_case_html"><div class="ttname"><a href="../../da/d86/struct_test_case.html">TestCase</a></div><div class="ttdoc">represents single example inputs and expected output of the function longest_common_string_length</div><div class="ttdef"><b>Definition</b> <a href="../../da/d0d/longest__common__string_8cpp_source.html#l00054">longest_common_string.cpp:54</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/db/d27/n__bonacci_8cpp_a6849b68f760be628d5975ab3eddec63d_cgraph.map b/db/d27/n__bonacci_8cpp_a6849b68f760be628d5975ab3eddec63d_cgraph.map
deleted file mode 100644
index ad11b0d1f..000000000
--- a/db/d27/n__bonacci_8cpp_a6849b68f760be628d5975ab3eddec63d_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="math::n_bonacci::N_bonacci" name="math::n_bonacci::N_bonacci">
-<area shape="rect" id="Node000001" title="Finds the N&#45;Bonacci series for the n parameter value and m parameter terms." alt="" coords="5,29,141,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="46,29,45,20,49,11,59,5,73,3,88,5,97,12,94,16,86,10,73,8,61,10,53,14,50,20,52,28"/>
-</map>
diff --git a/db/d27/n__bonacci_8cpp_a6849b68f760be628d5975ab3eddec63d_cgraph.md5 b/db/d27/n__bonacci_8cpp_a6849b68f760be628d5975ab3eddec63d_cgraph.md5
deleted file mode 100644
index 614f4f0a5..000000000
--- a/db/d27/n__bonacci_8cpp_a6849b68f760be628d5975ab3eddec63d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b6ff78d7080b73cedbf2649a41899071
\ No newline at end of file
diff --git a/db/d27/n__bonacci_8cpp_a6849b68f760be628d5975ab3eddec63d_cgraph.svg b/db/d27/n__bonacci_8cpp_a6849b68f760be628d5975ab3eddec63d_cgraph.svg
deleted file mode 100644
index 6e09d721e..000000000
--- a/db/d27/n__bonacci_8cpp_a6849b68f760be628d5975ab3eddec63d_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::n_bonacci::N_bonacci Pages: 1 -->
-<svg width="110pt" height="57pt"
- viewBox="0.00 0.00 109.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::n_bonacci::N_bonacci</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Finds the N&#45;Bonacci series for the n parameter value and m parameter terms.">
-<polygon fill="#999999" stroke="#666666" points="101.5,-30.5 0,-30.5 0,0 101.5,0 101.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::n_bonacci::N</text>
-<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_bonacci</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.76,-30.99C29.09,-40.06 35.09,-48.5 50.75,-48.5 59.31,-48.5 64.99,-45.97 67.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.24,-42.76 68.61,-32.49 64.26,-42.16 71.24,-42.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d27/n__bonacci_8cpp_a6849b68f760be628d5975ab3eddec63d_cgraph_org.svg b/db/d27/n__bonacci_8cpp_a6849b68f760be628d5975ab3eddec63d_cgraph_org.svg
deleted file mode 100644
index 0a180ea64..000000000
--- a/db/d27/n__bonacci_8cpp_a6849b68f760be628d5975ab3eddec63d_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::n_bonacci::N_bonacci Pages: 1 -->
-<svg width="110pt" height="57pt"
- viewBox="0.00 0.00 109.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::n_bonacci::N_bonacci</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Finds the N&#45;Bonacci series for the n parameter value and m parameter terms.">
-<polygon fill="#999999" stroke="#666666" points="101.5,-30.5 0,-30.5 0,0 101.5,0 101.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::n_bonacci::N</text>
-<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_bonacci</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.76,-30.99C29.09,-40.06 35.09,-48.5 50.75,-48.5 59.31,-48.5 64.99,-45.97 67.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.24,-42.76 68.61,-32.49 64.26,-42.16 71.24,-42.76"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d27/n__bonacci_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/db/d27/n__bonacci_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index e85e01374..000000000
--- a/db/d27/n__bonacci_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/db/d27/n__bonacci_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/db/d27/n__bonacci_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 5901bc148..000000000
--- a/db/d27/n__bonacci_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-729fb887ee50b6291b0542ba0592a5c7
\ No newline at end of file
diff --git a/db/d27/n__bonacci_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/db/d27/n__bonacci_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 2e04695b9..000000000
--- a/db/d27/n__bonacci_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d27/n__bonacci_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/db/d27/n__bonacci_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1813bd719..000000000
--- a/db/d27/n__bonacci_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d27/n__bonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d27/n__bonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index da56e458a..000000000
--- a/db/d27/n__bonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/db/d27/n__bonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d27/n__bonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index c00724f15..000000000
--- a/db/d27/n__bonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-328ccd935b56d7c2448667538e9698ab
\ No newline at end of file
diff --git a/db/d27/n__bonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d27/n__bonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index cf86c3101..000000000
--- a/db/d27/n__bonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d27/n__bonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/db/d27/n__bonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index ccf6c00a8..000000000
--- a/db/d27/n__bonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d27/n__bonacci_8cpp_source.html b/db/d27/n__bonacci_8cpp_source.html
new file mode 100644
index 000000000..2755eaffb
--- /dev/null
+++ b/db/d27/n__bonacci_8cpp_source.html
@@ -0,0 +1,215 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/n_bonacci.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/d27/n__bonacci_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">n_bonacci.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../db/d27/n__bonacci_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../de/d36/namespacen__bonacci.html">n_bonacci</a> {</div>
+<div class="foldopen" id="foldopen00040" data-start="{" data-end="}">
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d">   40</a></span>std::vector&lt;uint64_t&gt; <a class="code hl_function" href="../../db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d">N_bonacci</a>(<span class="keyword">const</span> uint64_t &amp;n, <span class="keyword">const</span> uint64_t &amp;m) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    std::vector&lt;uint64_t&gt; a(</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        m, 0);  <span class="comment">// we create an array of size m filled with zeros</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">if</span> (m &lt; n || n == 0) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="keywordflow">return</span> a;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    a[n - 1] = 1;  </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">if</span> (n == m) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordflow">return</span> a;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    a[n] = 1;  </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">for</span> (uint64_t i = n + 1; i &lt; m; i++) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="comment">// this is an optimized solution that works in O(M) time and takes O(M)</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        <span class="comment">// extra space here we use the concept of the sliding window the current</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        <span class="comment">// term can be computed using the given formula</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        a[i] = 2 * a[i - 1] - a[i - 1 - n];</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    }</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">return</span> a;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>}</div>
+</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>}  <span class="comment">// namespace n_bonacci</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="foldopen" id="foldopen00069" data-start="{" data-end="}">
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="../../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   69</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a> {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        <span class="keyword">const</span> uint64_t n;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        <span class="keyword">const</span> uint64_t m;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        <span class="keyword">const</span> std::vector&lt;uint64_t&gt; expected;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="keyword">const</span> uint64_t in_n, <span class="keyword">const</span> uint64_t in_m,</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>                 std::initializer_list&lt;uint64_t&gt; <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>            : n(in_n), m(in_m), expected(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            assert(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>.size() == m);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        }</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    };</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keyword">const</span> std::vector&lt;TestCase&gt; test_cases = {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(0, 0, {}),</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(0, 1, {0}),</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(0, 2, {0, 0}),</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(1, 0, {}),</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(1, 1, {1}),</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(1, 2, {1, 1}),</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(1, 3, {1, 1, 1}),</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(5, 15, {0, 0, 0, 0, 1, 1, 2, 4, 8, 16, 31, 61, 120, 236, 464}),</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>            6, 17,</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>            {0, 0, 0, 0, 0, 1, 1, 2, 4, 8, 16, 32, 63, 125, 248, 492, 976}),</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(56, 15, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0})};</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;tc : test_cases) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        assert(math::n_bonacci::N_bonacci(tc.n, tc.m) == tc.expected);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>}</div>
+</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="foldopen" id="foldopen00104" data-start="{" data-end="}">
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"><a class="line" href="../../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  104</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <a class="code hl_function" href="../../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>}</div>
+</div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="an__bonacci_8cpp_html_a6849b68f760be628d5975ab3eddec63d"><div class="ttname"><a href="../../db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d">math::n_bonacci::N_bonacci</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; N_bonacci(const uint64_t &amp;n, const uint64_t &amp;m)</div><div class="ttdoc">Finds the N-Bonacci series for the n parameter value and m parameter terms.</div><div class="ttdef"><b>Definition</b> <a href="#l00040">n_bonacci.cpp:40</a></div></div>
+<div class="ttc" id="an__bonacci_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../db/d27/n__bonacci_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> <a href="#l00069">n_bonacci.cpp:69</a></div></div>
+<div class="ttc" id="an__bonacci_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00104">n_bonacci.cpp:104</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacen__bonacci_html"><div class="ttname"><a href="../../de/d36/namespacen__bonacci.html">n_bonacci</a></div><div class="ttdoc">Functions for the N-bonacci implementation.</div></div>
+<div class="ttc" id="astruct_test_case_html"><div class="ttname"><a href="../../da/d86/struct_test_case.html">TestCase</a></div><div class="ttdoc">represents single example inputs and expected output of the function longest_common_string_length</div><div class="ttdef"><b>Definition</b> <a href="../../da/d0d/longest__common__string_8cpp_source.html#l00054">longest_common_string.cpp:54</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../db/d27/n__bonacci_8cpp.html">n_bonacci.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.map b/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.map
index 1c290bf5a..8ef3ab8ac 100644
--- a/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.map
+++ b/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.map
@@ -1,6 +1,6 @@
 <map id="geometry::jarvis::Convexhull" name="geometry::jarvis::Convexhull">
 <area shape="rect" id="Node000001" title=" " alt="" coords="5,198,193,223"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="24,94,174,135"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="24,94,174,135"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="102,150,102,197,96,197,96,150"/>
 <area shape="rect" id="Node000003" href="$d9/d5a/structgeometry_1_1jarvis_1_1_point.html" title=" " alt="" coords="23,5,175,31"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="102,46,102,93,96,93,96,46"/>
diff --git a/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.md5 b/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.md5
index b353428b0..a9132d370 100644
--- a/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.md5
+++ b/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.md5
@@ -1 +1 @@
-c3bbb9056e2668f7667acc9eeec8fd5c
\ No newline at end of file
+1a39b8de8effcdc40a56a17c1d88e784
\ No newline at end of file
diff --git a/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.svg b/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.svg
index 512ba3059..c2d763e79 100644
--- a/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.svg
+++ b/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="126.25,-97 14.25,-97 14.25,-66.5 126.25,-66.5 126.25,-97"/>
 <text text-anchor="start" x="22.25" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; geometry</text>
 <text text-anchor="middle" x="70.25" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">::jarvis::Point &gt;</text>
diff --git a/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph_org.svg b/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph_org.svg
index 4249a8ec1..3d7c3a11d 100644
--- a/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph_org.svg
+++ b/db/d29/classgeometry_1_1jarvis_1_1_convexhull__coll__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="126.25,-97 14.25,-97 14.25,-66.5 126.25,-66.5 126.25,-97"/>
 <text text-anchor="start" x="22.25" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; geometry</text>
 <text text-anchor="middle" x="70.25" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">::jarvis::Point &gt;</text>
diff --git a/db/d32/structdata__structures_1_1sparse__table_1_1_sparse__table-members.html b/db/d32/structdata__structures_1_1sparse__table_1_1_sparse__table-members.html
index f74239542..61cbe5130 100644
--- a/db/d32/structdata__structures_1_1sparse__table_1_1_sparse__table-members.html
+++ b/db/d32/structdata__structures_1_1sparse__table_1_1_sparse__table-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/db/d36/classothers_1_1_cache_1_1_l_f_u_cache-members.html b/db/d36/classothers_1_1_cache_1_1_l_f_u_cache-members.html
index afafec019..ae7d1968e 100644
--- a/db/d36/classothers_1_1_cache_1_1_l_f_u_cache-members.html
+++ b/db/d36/classothers_1_1_cache_1_1_l_f_u_cache-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/db/d3c/tower__of__hanoi_8cpp.html b/db/d3c/tower__of__hanoi_8cpp.html
index cca65956d..779dcf472 100644
--- a/db/d3c/tower__of__hanoi_8cpp.html
+++ b/db/d3c/tower__of__hanoi_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/tower_of_hanoi.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/tower_of_hanoi.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,7 +136,9 @@ Include dependency graph for tower_of_hanoi.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/ddb/tower__of__hanoi_8cpp__incl.svg" width="186" height="111"><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">
+</div>
+<p><a href="../../db/d3c/tower__of__hanoi_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d2c/structtower.html">tower</a></td></tr>
@@ -138,6 +157,8 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Solve the <a href="https://en.wikipedia.org/wiki/Tower_of_Hanoi" target="_blank">Tower of Hanoi</a> problem. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp_source.html">tower_of_hanoi.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -154,6 +175,8 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp_source.html#l00065">65</a> of file <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp_source.html">tower_of_hanoi.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   65</span>           {</div>
 <div class="line"><span class="lineno">   66</span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../d2/d2c/structtower.html">tower</a> F, U, T;</div>
 <div class="line"><span class="lineno">   67</span> </div>
@@ -163,8 +186,8 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   71</span> </div>
 <div class="line"><span class="lineno">   72</span>    <span class="keywordtype">int</span> no;</div>
 <div class="line"><span class="lineno">   73</span> </div>
-<div class="line"><span class="lineno">   74</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter number of discs : &quot;</span>;</div>
-<div class="line"><span class="lineno">   75</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; no;</div>
+<div class="line"><span class="lineno">   74</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter number of discs : &quot;</span>;</div>
+<div class="line"><span class="lineno">   75</span>    std::cin &gt;&gt; no;</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 = no; i &gt; 0; i--) {</div>
 <div class="line"><span class="lineno">   78</span>        F.values[F.top++] = i;</div>
@@ -175,17 +198,10 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   83</span> </div>
 <div class="line"><span class="lineno">   84</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   85</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="astructtower_html"><div class="ttname"><a href="../../d2/d2c/structtower.html">tower</a></div><div class="ttdef"><b>Definition</b> tower_of_hanoi.cpp:11</div></div>
-<div class="ttc" id="astructtower_html_acb535964abd34c47678a4ade0628223d"><div class="ttname"><a href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">tower::top</a></div><div class="ttdeci">int top</div><div class="ttdoc">top tower ID</div><div class="ttdef"><b>Definition</b> tower_of_hanoi.cpp:15</div></div>
-<div class="ttc" id="atower__of__hanoi_8cpp_html_ab037f72a5eac476535a6cfbbcb965417"><div class="ttname"><a href="#ab037f72a5eac476535a6cfbbcb965417">TH</a></div><div class="ttdeci">void TH(int n, tower *From, tower *Using, tower *To)</div><div class="ttdef"><b>Definition</b> tower_of_hanoi.cpp:52</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="242" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astructtower_html"><div class="ttname"><a href="../../d2/d2c/structtower.html">tower</a></div><div class="ttdef"><b>Definition</b> <a href="../../db/d3c/tower__of__hanoi_8cpp_source.html#l00011">tower_of_hanoi.cpp:11</a></div></div>
+<div class="ttc" id="astructtower_html_acb535964abd34c47678a4ade0628223d"><div class="ttname"><a href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">tower::top</a></div><div class="ttdeci">int top</div><div class="ttdoc">top tower ID</div><div class="ttdef"><b>Definition</b> <a href="../../db/d3c/tower__of__hanoi_8cpp_source.html#l00015">tower_of_hanoi.cpp:15</a></div></div>
+<div class="ttc" id="atower__of__hanoi_8cpp_html_ab037f72a5eac476535a6cfbbcb965417"><div class="ttname"><a href="#ab037f72a5eac476535a6cfbbcb965417">TH</a></div><div class="ttdeci">void TH(int n, tower *From, tower *Using, tower *To)</div><div class="ttdef"><b>Definition</b> <a href="../../db/d3c/tower__of__hanoi_8cpp_source.html#l00052">tower_of_hanoi.cpp:52</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af4cfc41e546f1f8d25f01e0804e8b61d" name="af4cfc41e546f1f8d25f01e0804e8b61d"></a>
@@ -213,12 +229,14 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp_source.html">tower_of_hanoi.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   39</span>                                 {</div>
 <div class="line"><span class="lineno">   40</span>    --From-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a>;</div>
 <div class="line"><span class="lineno">   41</span>    To-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">values</a>[To-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a>] = From-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">values</a>[From-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a>];</div>
 <div class="line"><span class="lineno">   42</span>    ++To-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a>;</div>
 <div class="line"><span class="lineno">   43</span>}</div>
-<div class="ttc" id="astructtower_html_a3ebb75c13c57d51a8a1ba1ea54a515e9"><div class="ttname"><a href="../../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">tower::values</a></div><div class="ttdeci">int values[10]</div><div class="ttdoc">Values in the tower.</div><div class="ttdef"><b>Definition</b> tower_of_hanoi.cpp:13</div></div>
+<div class="ttc" id="astructtower_html_a3ebb75c13c57d51a8a1ba1ea54a515e9"><div class="ttname"><a href="../../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">tower::values</a></div><div class="ttdeci">int values[10]</div><div class="ttdoc">Values in the tower.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d3c/tower__of__hanoi_8cpp_source.html#l00013">tower_of_hanoi.cpp:13</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -246,18 +264,20 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Display the towers </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp_source.html#l00019">19</a> of file <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp_source.html">tower_of_hanoi.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   20</span>                                       {</div>
-<div class="line"><span class="lineno">   21</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n\n\tF : &quot;</span>;</div>
+<div class="line"><span class="lineno">   21</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n\n\tF : &quot;</span>;</div>
 <div class="line"><span class="lineno">   22</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; F-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a>; i++) {</div>
-<div class="line"><span class="lineno">   23</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; F-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">values</a>[i] &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><span class="lineno">   23</span>        std::cout &lt;&lt; F-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">values</a>[i] &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
 <div class="line"><span class="lineno">   24</span>    }</div>
-<div class="line"><span class="lineno">   25</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n\tU : &quot;</span>;</div>
+<div class="line"><span class="lineno">   25</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n\tU : &quot;</span>;</div>
 <div class="line"><span class="lineno">   26</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; U-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a>; i++) {</div>
-<div class="line"><span class="lineno">   27</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; U-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">values</a>[i] &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><span class="lineno">   27</span>        std::cout &lt;&lt; U-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">values</a>[i] &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
 <div class="line"><span class="lineno">   28</span>    }</div>
-<div class="line"><span class="lineno">   29</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n\tT : &quot;</span>;</div>
+<div class="line"><span class="lineno">   29</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n\tT : &quot;</span>;</div>
 <div class="line"><span class="lineno">   30</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; T-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a>; i++) {</div>
-<div class="line"><span class="lineno">   31</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; T-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">values</a>[i] &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><span class="lineno">   31</span>        std::cout &lt;&lt; T-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">values</a>[i] &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
 <div class="line"><span class="lineno">   32</span>    }</div>
 <div class="line"><span class="lineno">   33</span>}</div>
 </div><!-- fragment -->
@@ -300,6 +320,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp_source.html#l00052">52</a> of file <a class="el" href="../../db/d3c/tower__of__hanoi_8cpp_source.html">tower_of_hanoi.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   52</span>                                                     {</div>
 <div class="line"><span class="lineno">   53</span>    <span class="keywordflow">if</span> (n == 1) {</div>
 <div class="line"><span class="lineno">   54</span>        <a class="code hl_function" href="#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a>(From, To);</div>
@@ -311,13 +333,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   60</span>        <a class="code hl_function" href="#ab037f72a5eac476535a6cfbbcb965417">TH</a>(n - 1, Using, From, To);</div>
 <div class="line"><span class="lineno">   61</span>    }</div>
 <div class="line"><span class="lineno">   62</span>}</div>
-<div class="ttc" id="atower__of__hanoi_8cpp_html_af4cfc41e546f1f8d25f01e0804e8b61d"><div class="ttname"><a href="#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a></div><div class="ttdeci">void mov(tower *From, tower *To)</div><div class="ttdef"><b>Definition</b> tower_of_hanoi.cpp:39</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.svg" width="144" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="atower__of__hanoi_8cpp_html_af4cfc41e546f1f8d25f01e0804e8b61d"><div class="ttname"><a href="#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a></div><div class="ttdeci">void mov(tower *From, tower *To)</div><div class="ttdef"><b>Definition</b> <a href="../../db/d3c/tower__of__hanoi_8cpp_source.html#l00039">tower_of_hanoi.cpp:39</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.map b/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.map
deleted file mode 100644
index d5ee63c9d..000000000
--- a/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="TH" name="TH">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,45,55"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="8,30,5,21,7,12,14,5,25,3,37,6,43,12,39,16,34,10,25,8,16,10,12,14,11,20,13,28"/>
-<area shape="rect" id="Node000002" href="$db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d" title=" " alt="" coords="93,29,139,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="45,40,77,40,77,45,45,45"/>
-</map>
diff --git a/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.md5 b/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.md5
deleted file mode 100644
index 4c0af01bf..000000000
--- a/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e1d2841de77893c347fd45e19112d7cd
\ No newline at end of file
diff --git a/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.svg b/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.svg
deleted file mode 100644
index d42a01eb0..000000000
--- a/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.svg
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: TH Pages: 1 -->
-<svg width="108pt" height="45pt"
- viewBox="0.00 0.00 108.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>TH</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="29.5,-19.25 0,-19.25 0,0 29.5,0 29.5,-19.25"/>
-<text text-anchor="middle" x="14.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TH</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M4.08,-19.54C-0.78,-28.15 2.77,-37.25 14.75,-37.25 21.3,-37.25 25.33,-34.53 26.84,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="30.35,-30.51 25.61,-21.04 23.41,-31.4 30.35,-30.51"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="100.25,-19.25 65.5,-19.25 65.5,0 100.25,0 100.25,-19.25"/>
-<text text-anchor="middle" x="82.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">mov</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.77,-9.62C36.78,-9.62 45.52,-9.62 53.83,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="53.55,-13.13 63.55,-9.63 53.55,-6.13 53.55,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph_org.svg b/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph_org.svg
deleted file mode 100644
index b6e7feb48..000000000
--- a/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph_org.svg
+++ /dev/null
@@ -1,48 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: TH Pages: 1 -->
-<svg width="108pt" height="45pt"
- viewBox="0.00 0.00 108.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>TH</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="29.5,-19.25 0,-19.25 0,0 29.5,0 29.5,-19.25"/>
-<text text-anchor="middle" x="14.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TH</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M4.08,-19.54C-0.78,-28.15 2.77,-37.25 14.75,-37.25 21.3,-37.25 25.33,-34.53 26.84,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="30.35,-30.51 25.61,-21.04 23.41,-31.4 30.35,-30.51"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="100.25,-19.25 65.5,-19.25 65.5,0 100.25,0 100.25,-19.25"/>
-<text text-anchor="middle" x="82.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">mov</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.77,-9.62C36.78,-9.62 45.52,-9.62 53.83,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="53.55,-13.13 63.55,-9.63 53.55,-6.13 53.55,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index ccd9b9a12..000000000
--- a/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,55,55"/>
-<area shape="rect" id="Node000002" href="$db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417" title=" " alt="" coords="103,29,142,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,40,87,40,87,45,55,45"/>
-<area shape="poly" id="edge3_Node000002_Node000002" title=" " alt="" coords="106,30,103,21,104,12,111,5,122,3,134,6,140,12,136,16,132,10,122,8,114,10,109,14,108,20,111,28"/>
-<area shape="rect" id="Node000003" href="$db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d" title=" " alt="" coords="190,29,236,55"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="142,40,174,40,174,45,142,45"/>
-</map>
diff --git a/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index e870b30b2..000000000
--- a/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5f6bef9872d26ff27dd079913699ca9b
\ No newline at end of file
diff --git a/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 01523fdef..000000000
--- a/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="181pt" height="45pt"
- viewBox="0.00 0.00 181.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="102.5,-19.25 73,-19.25 73,0 102.5,0 102.5,-19.25"/>
-<text text-anchor="middle" x="87.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TH</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.17,-9.62C44.51,-9.62 53.17,-9.62 61.18,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.07,-13.13 71.07,-9.63 61.07,-6.13 61.07,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.08,-19.54C72.22,-28.15 75.77,-37.25 87.75,-37.25 94.3,-37.25 98.33,-34.53 99.84,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.35,-30.51 98.61,-21.04 96.41,-31.4 103.35,-30.51"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173.25,-19.25 138.5,-19.25 138.5,0 173.25,0 173.25,-19.25"/>
-<text text-anchor="middle" x="155.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">mov</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.77,-9.62C109.78,-9.62 118.52,-9.62 126.83,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.55,-13.13 136.55,-9.63 126.55,-6.13 126.55,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 1ddbc2cb1..000000000
--- a/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="181pt" height="45pt"
- viewBox="0.00 0.00 181.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="102.5,-19.25 73,-19.25 73,0 102.5,0 102.5,-19.25"/>
-<text text-anchor="middle" x="87.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TH</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.17,-9.62C44.51,-9.62 53.17,-9.62 61.18,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.07,-13.13 71.07,-9.63 61.07,-6.13 61.07,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.08,-19.54C72.22,-28.15 75.77,-37.25 87.75,-37.25 94.3,-37.25 98.33,-34.53 99.84,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.35,-30.51 98.61,-21.04 96.41,-31.4 103.35,-30.51"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173.25,-19.25 138.5,-19.25 138.5,0 173.25,0 173.25,-19.25"/>
-<text text-anchor="middle" x="155.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">mov</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.77,-9.62C109.78,-9.62 118.52,-9.62 126.83,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.55,-13.13 136.55,-9.63 126.55,-6.13 126.55,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d3c/tower__of__hanoi_8cpp_source.html b/db/d3c/tower__of__hanoi_8cpp_source.html
new file mode 100644
index 000000000..0dbce8d36
--- /dev/null
+++ b/db/d3c/tower__of__hanoi_8cpp_source.html
@@ -0,0 +1,216 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/tower_of_hanoi.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/d3c/tower__of__hanoi_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">tower_of_hanoi.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../db/d3c/tower__of__hanoi_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="foldopen" id="foldopen00011" data-start="{" data-end="};">
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"><a class="line" href="../../d2/d2c/structtower.html">   11</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../d2/d2c/structtower.html">tower</a> {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"><a class="line" href="../../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">   13</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">values</a>[10];</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"><a class="line" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">   15</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a>;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>};</div>
+</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
+<div class="foldopen" id="foldopen00019" data-start="{" data-end="}">
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"><a class="line" href="../../db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed">   19</a></span><span class="keywordtype">void</span> show(<span class="keyword">const</span> <span class="keyword">struct</span> <a class="code hl_struct" href="../../d2/d2c/structtower.html">tower</a> *<span class="keyword">const</span> F, <span class="keyword">const</span> <span class="keyword">struct</span> <a class="code hl_struct" href="../../d2/d2c/structtower.html">tower</a> *<span class="keyword">const</span> T,</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>          <span class="keyword">const</span> <span class="keyword">struct</span> <a class="code hl_struct" href="../../d2/d2c/structtower.html">tower</a> *<span class="keyword">const</span> U) {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n\n\tF : &quot;</span>;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; F-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a>; i++) {</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        std::cout &lt;&lt; F-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">values</a>[i] &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    }</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n\tU : &quot;</span>;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; U-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a>; i++) {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        std::cout &lt;&lt; U-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">values</a>[i] &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    }</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n\tT : &quot;</span>;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; T-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a>; i++) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        std::cout &lt;&lt; T-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">values</a>[i] &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    }</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>}</div>
+</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="foldopen" id="foldopen00039" data-start="{" data-end="}">
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">   39</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a>(<a class="code hl_struct" href="../../d2/d2c/structtower.html">tower</a> *From, <a class="code hl_struct" href="../../d2/d2c/structtower.html">tower</a> *To) {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    --From-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a>;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    To-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">values</a>[To-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a>] = From-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">values</a>[From-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a>];</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    ++To-&gt;<a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a>;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>}</div>
+</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="foldopen" id="foldopen00052" data-start="{" data-end="}">
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">   52</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">TH</a>(<span class="keywordtype">int</span> n, <a class="code hl_struct" href="../../d2/d2c/structtower.html">tower</a> *From, <a class="code hl_struct" href="../../d2/d2c/structtower.html">tower</a> *Using, <a class="code hl_struct" href="../../d2/d2c/structtower.html">tower</a> *To) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">if</span> (n == 1) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <a class="code hl_function" href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a>(From, To);</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        show(From, To, Using);</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        <a class="code hl_function" href="../../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">TH</a>(n - 1, From, To, Using);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <a class="code hl_function" href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a>(From, To);</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        show(From, To, Using);</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        <a class="code hl_function" href="../../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">TH</a>(n - 1, Using, From, To);</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    }</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>}</div>
+</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="foldopen" id="foldopen00065" data-start="{" data-end="}">
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="../../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   65</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../d2/d2c/structtower.html">tower</a> F, U, T;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    F.<a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a> = 0;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    U.<a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a> = 0;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    T.<a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a> = 0;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keywordtype">int</span> no;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter number of discs : &quot;</span>;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    std::cin &gt;&gt; no;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = no; i &gt; 0; i--) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        F.<a class="code hl_variable" href="../../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">values</a>[F.<a class="code hl_variable" href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">top</a>++] = i;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    show(&amp;F, &amp;T, &amp;U);</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <a class="code hl_function" href="../../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">TH</a>(no, &amp;F, &amp;U, &amp;T);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>}</div>
+</div>
+<div class="ttc" id="astructtower_html"><div class="ttname"><a href="../../d2/d2c/structtower.html">tower</a></div><div class="ttdef"><b>Definition</b> <a href="#l00011">tower_of_hanoi.cpp:11</a></div></div>
+<div class="ttc" id="astructtower_html_a3ebb75c13c57d51a8a1ba1ea54a515e9"><div class="ttname"><a href="../../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9">tower::values</a></div><div class="ttdeci">int values[10]</div><div class="ttdoc">Values in the tower.</div><div class="ttdef"><b>Definition</b> <a href="#l00013">tower_of_hanoi.cpp:13</a></div></div>
+<div class="ttc" id="astructtower_html_acb535964abd34c47678a4ade0628223d"><div class="ttname"><a href="../../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">tower::top</a></div><div class="ttdeci">int top</div><div class="ttdoc">top tower ID</div><div class="ttdef"><b>Definition</b> <a href="#l00015">tower_of_hanoi.cpp:15</a></div></div>
+<div class="ttc" id="atower__of__hanoi_8cpp_html_ab037f72a5eac476535a6cfbbcb965417"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">TH</a></div><div class="ttdeci">void TH(int n, tower *From, tower *Using, tower *To)</div><div class="ttdef"><b>Definition</b> <a href="#l00052">tower_of_hanoi.cpp:52</a></div></div>
+<div class="ttc" id="atower__of__hanoi_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00065">tower_of_hanoi.cpp:65</a></div></div>
+<div class="ttc" id="atower__of__hanoi_8cpp_html_af4cfc41e546f1f8d25f01e0804e8b61d"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a></div><div class="ttdeci">void mov(tower *From, tower *To)</div><div class="ttdef"><b>Definition</b> <a href="#l00039">tower_of_hanoi.cpp:39</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../db/d3c/tower__of__hanoi_8cpp.html">tower_of_hanoi.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/d3f/wave__sort_8cpp.html b/db/d3f/wave__sort_8cpp.html
index ee9f15e63..9d67e7969 100644
--- a/db/d3f/wave__sort_8cpp.html
+++ b/db/d3f/wave__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/wave_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/wave_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for wave_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d79/wave__sort_8cpp__incl.svg" width="350" height="111"><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">
+</div>
+<p><a href="../../db/d3f/wave__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -135,7 +154,7 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a7d4f243b9dc13ace4ef77e30dbc56f12" id="r_a7d4f243b9dc13ace4ef77e30dbc56f12"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a7d4f243b9dc13ace4ef77e30dbc56f12"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a7d4f243b9dc13ace4ef77e30dbc56f12">sorting::wave_sort::waveSort</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;in_arr, int64_t n)</td></tr>
+<tr class="memitem:a7d4f243b9dc13ace4ef77e30dbc56f12"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a7d4f243b9dc13ace4ef77e30dbc56f12">sorting::wave_sort::waveSort</a> (const std::vector&lt; T &gt; &amp;in_arr, int64_t n)</td></tr>
 <tr class="memdesc:a7d4f243b9dc13ace4ef77e30dbc56f12"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function implements that implements the Wave Sort algorithm.  <br /></td></tr>
 <tr class="separator:a7d4f243b9dc13ace4ef77e30dbc56f12"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of the <a href="https://www.geeksforgeeks.org/sort-array-wave-form-2/" target="_blank">Wave sort</a> algorithm. </p>
 <p>Wave Sort is a sorting algorithm that works in \(O(nlogn)\) time assuming the sort function used works in \(O(nlogn)\) time. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Swastyy" target="_blank">Swastika Gupta</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../db/d3f/wave__sort_8cpp_source.html">wave_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -166,17 +187,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d3f/wave__sort_8cpp_source.html#l00091">91</a> of file <a class="el" href="../../db/d3f/wave__sort_8cpp_source.html">wave_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   91</span>           {</div>
 <div class="line"><span class="lineno">   92</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   93</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   94</span>}</div>
-<div class="ttc" id="awave__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> wave_sort.cpp:53</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d3f/wave__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="awave__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d3f/wave__sort_8cpp_source.html#l00053">wave_sort.cpp:53</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -204,49 +222,43 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d3f/wave__sort_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../db/d3f/wave__sort_8cpp_source.html">wave_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   53</span>                   {</div>
 <div class="line"><span class="lineno">   54</span>    <span class="comment">// [10, 90, 49, 2, 1, 5, 23] return [2, 1, 10, 5, 49, 23, 90]</span></div>
-<div class="line"><span class="lineno">   55</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> array1 = {10, 90, 49, 2, 1, 5, 23};</div>
-<div class="line"><span class="lineno">   56</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
-<div class="line"><span class="lineno">   57</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> arr1 = <a class="code hl_function" href="#a7d4f243b9dc13ace4ef77e30dbc56f12">sorting::wave_sort::waveSort</a>(array1, 7);</div>
-<div class="line"><span class="lineno">   58</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> o1 = {2, 1, 10, 5, 49, 23, 90};</div>
+<div class="line"><span class="lineno">   55</span>    std::vector&lt;int64_t&gt; array1 = {10, 90, 49, 2, 1, 5, 23};</div>
+<div class="line"><span class="lineno">   56</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
+<div class="line"><span class="lineno">   57</span>    std::vector&lt;int64_t&gt; arr1 = <a class="code hl_function" href="#a7d4f243b9dc13ace4ef77e30dbc56f12">sorting::wave_sort::waveSort</a>(array1, 7);</div>
+<div class="line"><span class="lineno">   58</span>    <span class="keyword">const</span> std::vector&lt;int64_t&gt; o1 = {2, 1, 10, 5, 49, 23, 90};</div>
 <div class="line"><span class="lineno">   59</span>    assert(arr1 == o1);</div>
-<div class="line"><span class="lineno">   60</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   60</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   61</span> </div>
 <div class="line"><span class="lineno">   62</span>    <span class="comment">// [1, 3, 4, 2, 7, 8] return [2, 1, 4, 3, 8, 7]</span></div>
-<div class="line"><span class="lineno">   63</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> array2 = {1, 3, 4, 2, 7, 8};</div>
-<div class="line"><span class="lineno">   64</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
-<div class="line"><span class="lineno">   65</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> arr2 = <a class="code hl_function" href="#a7d4f243b9dc13ace4ef77e30dbc56f12">sorting::wave_sort::waveSort</a>(array2, 6);</div>
-<div class="line"><span class="lineno">   66</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> o2 = {2, 1, 4, 3, 8, 7};</div>
+<div class="line"><span class="lineno">   63</span>    std::vector&lt;int64_t&gt; array2 = {1, 3, 4, 2, 7, 8};</div>
+<div class="line"><span class="lineno">   64</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
+<div class="line"><span class="lineno">   65</span>    std::vector&lt;int64_t&gt; arr2 = <a class="code hl_function" href="#a7d4f243b9dc13ace4ef77e30dbc56f12">sorting::wave_sort::waveSort</a>(array2, 6);</div>
+<div class="line"><span class="lineno">   66</span>    <span class="keyword">const</span> std::vector&lt;int64_t&gt; o2 = {2, 1, 4, 3, 8, 7};</div>
 <div class="line"><span class="lineno">   67</span>    assert(arr2 == o2);</div>
-<div class="line"><span class="lineno">   68</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   68</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   69</span> </div>
 <div class="line"><span class="lineno">   70</span>    <span class="comment">// [3, 3, 3, 3] return [3, 3, 3, 3]</span></div>
-<div class="line"><span class="lineno">   71</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> array3 = {3, 3, 3, 3};</div>
-<div class="line"><span class="lineno">   72</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
-<div class="line"><span class="lineno">   73</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> arr3 = <a class="code hl_function" href="#a7d4f243b9dc13ace4ef77e30dbc56f12">sorting::wave_sort::waveSort</a>(array3, 4);</div>
-<div class="line"><span class="lineno">   74</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> o3 = {3, 3, 3, 3};</div>
+<div class="line"><span class="lineno">   71</span>    std::vector&lt;int64_t&gt; array3 = {3, 3, 3, 3};</div>
+<div class="line"><span class="lineno">   72</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
+<div class="line"><span class="lineno">   73</span>    std::vector&lt;int64_t&gt; arr3 = <a class="code hl_function" href="#a7d4f243b9dc13ace4ef77e30dbc56f12">sorting::wave_sort::waveSort</a>(array3, 4);</div>
+<div class="line"><span class="lineno">   74</span>    <span class="keyword">const</span> std::vector&lt;int64_t&gt; o3 = {3, 3, 3, 3};</div>
 <div class="line"><span class="lineno">   75</span>    assert(arr3 == o3);</div>
-<div class="line"><span class="lineno">   76</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   76</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   77</span> </div>
 <div class="line"><span class="lineno">   78</span>    <span class="comment">// [9, 4, 6, 8, 14, 3] return [4, 3, 8, 6, 14, 9]</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&lt;int64_t&gt;</a> array4 = {9, 4, 6, 8, 14, 3};</div>
-<div class="line"><span class="lineno">   80</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 4... &quot;</span>;</div>
-<div class="line"><span class="lineno">   81</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> arr4 = <a class="code hl_function" href="#a7d4f243b9dc13ace4ef77e30dbc56f12">sorting::wave_sort::waveSort</a>(array4, 6);</div>
-<div class="line"><span class="lineno">   82</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> o4 = {4, 3, 8, 6, 14, 9};</div>
+<div class="line"><span class="lineno">   79</span>    std::vector&lt;int64_t&gt; array4 = {9, 4, 6, 8, 14, 3};</div>
+<div class="line"><span class="lineno">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4... &quot;</span>;</div>
+<div class="line"><span class="lineno">   81</span>    std::vector&lt;int64_t&gt; arr4 = <a class="code hl_function" href="#a7d4f243b9dc13ace4ef77e30dbc56f12">sorting::wave_sort::waveSort</a>(array4, 6);</div>
+<div class="line"><span class="lineno">   82</span>    <span class="keyword">const</span> std::vector&lt;int64_t&gt; o4 = {4, 3, 8, 6, 14, 9};</div>
 <div class="line"><span class="lineno">   83</span>    assert(arr4 == o4);</div>
-<div class="line"><span class="lineno">   84</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   85</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="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="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-<div class="ttc" id="awave__sort_8cpp_html_a7d4f243b9dc13ace4ef77e30dbc56f12"><div class="ttname"><a href="#a7d4f243b9dc13ace4ef77e30dbc56f12">sorting::wave_sort::waveSort</a></div><div class="ttdeci">std::vector&lt; T &gt; waveSort(const std::vector&lt; T &gt; &amp;in_arr, int64_t n)</div><div class="ttdoc">The main function implements that implements the Wave Sort algorithm.</div><div class="ttdef"><b>Definition</b> wave_sort.cpp:34</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d3f/wave__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="awave__sort_8cpp_html_a7d4f243b9dc13ace4ef77e30dbc56f12"><div class="ttname"><a href="#a7d4f243b9dc13ace4ef77e30dbc56f12">sorting::wave_sort::waveSort</a></div><div class="ttdeci">std::vector&lt; T &gt; waveSort(const std::vector&lt; T &gt; &amp;in_arr, int64_t n)</div><div class="ttdoc">The main function implements that implements the Wave Sort algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d3f/wave__sort_8cpp_source.html#l00034">wave_sort.cpp:34</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7d4f243b9dc13ace4ef77e30dbc56f12" name="a7d4f243b9dc13ace4ef77e30dbc56f12"></a>
@@ -258,9 +270,9 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; sorting::wave_sort::waveSort </td>
+          <td class="memname">std::vector&lt; T &gt; sorting::wave_sort::waveSort </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>in_arr</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>in_arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -284,26 +296,21 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>arr the wave sorted array </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d3f/wave__sort_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../db/d3f/wave__sort_8cpp_source.html">wave_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   34</span>                                                             {</div>
-<div class="line"><span class="lineno">   35</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> arr(in_arr);</div>
+<div class="line"><span class="lineno">   35</span>    std::vector&lt;T&gt; arr(in_arr);</div>
 <div class="line"><span class="lineno">   36</span> </div>
 <div class="line"><span class="lineno">   37</span>    <span class="keywordflow">for</span> (int64_t i = 0; i &lt; n; i++) {</div>
 <div class="line"><span class="lineno">   38</span>        arr[i] = in_arr[i];</div>
 <div class="line"><span class="lineno">   39</span>    }</div>
-<div class="line"><span class="lineno">   40</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a>(arr.begin(), arr.end());</div>
+<div class="line"><span class="lineno">   40</span>    std::sort(arr.begin(), arr.end());</div>
 <div class="line"><span class="lineno">   41</span>    <span class="keywordflow">for</span> (int64_t i = 0; i &lt; n - 1; i += 2) {  <span class="comment">// swap all the adjacent elements</span></div>
-<div class="line"><span class="lineno">   42</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(arr[i], arr[i + 1]);</div>
+<div class="line"><span class="lineno">   42</span>        std::swap(arr[i], arr[i + 1]);</div>
 <div class="line"><span class="lineno">   43</span>    }</div>
 <div class="line"><span class="lineno">   44</span>    <span class="keywordflow">return</span> arr;</div>
 <div class="line"><span class="lineno">   45</span>}</div>
-<div class="ttc" id="asort_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a></div><div class="ttdeci">T sort(T... args)</div></div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- 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="../../db/d3f/wave__sort_8cpp_a7d4f243b9dc13ace4ef77e30dbc56f12_cgraph.svg" width="310" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/db/d3f/wave__sort_8cpp_a7d4f243b9dc13ace4ef77e30dbc56f12_cgraph.map b/db/d3f/wave__sort_8cpp_a7d4f243b9dc13ace4ef77e30dbc56f12_cgraph.map
deleted file mode 100644
index db00b49d7..000000000
--- a/db/d3f/wave__sort_8cpp_a7d4f243b9dc13ace4ef77e30dbc56f12_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="sorting::wave_sort::waveSort" name="sorting::wave_sort::waveSort">
-<area shape="rect" id="Node000001" title="The main function implements that implements the Wave Sort algorithm." alt="" coords="5,72,134,113"/>
-<area shape="poly" id="edge5_Node000001_Node000001" title=" " alt="" coords="36,72,35,63,40,54,52,48,70,46,89,48,100,55,97,59,87,53,69,51,53,53,44,58,40,64,41,71"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="182,5,304,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="114,69,181,40,192,35,194,40,183,45,116,74"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="187,55,299,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="134,81,171,75,172,81,134,86"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/sort.html#" title=" " alt="" coords="208,104,278,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="134,99,194,107,193,113,134,104"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="204,153,282,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="118,111,183,140,194,145,192,149,181,145,115,116"/>
-</map>
diff --git a/db/d3f/wave__sort_8cpp_a7d4f243b9dc13ace4ef77e30dbc56f12_cgraph.md5 b/db/d3f/wave__sort_8cpp_a7d4f243b9dc13ace4ef77e30dbc56f12_cgraph.md5
deleted file mode 100644
index ebfc56fd0..000000000
--- a/db/d3f/wave__sort_8cpp_a7d4f243b9dc13ace4ef77e30dbc56f12_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-20434bc02d440749d5295199c47a2167
\ No newline at end of file
diff --git a/db/d3f/wave__sort_8cpp_a7d4f243b9dc13ace4ef77e30dbc56f12_cgraph.svg b/db/d3f/wave__sort_8cpp_a7d4f243b9dc13ace4ef77e30dbc56f12_cgraph.svg
deleted file mode 100644
index 3f3bfeedb..000000000
--- a/db/d3f/wave__sort_8cpp_a7d4f243b9dc13ace4ef77e30dbc56f12_cgraph.svg
+++ /dev/null
@@ -1,129 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::wave_sort::waveSort Pages: 1 -->
-<svg width="232pt" height="138pt"
- viewBox="0.00 0.00 232.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>sorting::wave_sort::waveSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function implements that implements the Wave Sort algorithm.">
-<polygon fill="#999999" stroke="#666666" points="96.25,-79.88 0,-79.88 0,-49.38 96.25,-49.38 96.25,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::wave_sort</text>
-<text text-anchor="middle" x="48.12" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::waveSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.09,-80.36C20.39,-89.43 28.07,-97.88 48.12,-97.88 59.09,-97.88 66.36,-95.35 69.93,-91.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.38,-92.19 71,-81.87 66.42,-91.42 73.38,-92.19"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-130.25 132.25,-130.25 132.25,-111 224,-111 224,-130.25"/>
-<text text-anchor="middle" x="178.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.53,-80.33C97.64,-87.33 115.77,-95.56 132.25,-102.62 135.05,-103.82 137.95,-105.04 140.88,-106.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.43,-109.45 150.01,-109.98 142.07,-102.96 139.43,-109.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-93.25 136,-93.25 136,-74 220.25,-74 220.25,-93.25"/>
-<text text-anchor="middle" x="178.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.42,-71.65C105.54,-73 115.14,-74.42 124.41,-75.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.6,-79.22 134.01,-77.22 124.63,-72.29 123.6,-79.22"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.12,-56.25 152.12,-56.25 152.12,-37 204.12,-37 204.12,-56.25"/>
-<text text-anchor="middle" x="178.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.42,-57.97C111.11,-55.91 127.06,-53.67 140.87,-51.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.98,-55.24 150.4,-50.38 140.01,-48.31 140.98,-55.24"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="207.5,-19.25 148.75,-19.25 148.75,0 207.5,0 207.5,-19.25"/>
-<text text-anchor="middle" x="178.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.38,-49.03C98.33,-42.32 116.1,-34.46 132.25,-27.62 135.05,-26.44 137.96,-25.23 140.89,-24.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.08,-27.32 150.03,-20.31 139.44,-20.83 142.08,-27.32"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d3f/wave__sort_8cpp_a7d4f243b9dc13ace4ef77e30dbc56f12_cgraph_org.svg b/db/d3f/wave__sort_8cpp_a7d4f243b9dc13ace4ef77e30dbc56f12_cgraph_org.svg
deleted file mode 100644
index c122cddd2..000000000
--- a/db/d3f/wave__sort_8cpp_a7d4f243b9dc13ace4ef77e30dbc56f12_cgraph_org.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::wave_sort::waveSort Pages: 1 -->
-<svg width="232pt" height="138pt"
- viewBox="0.00 0.00 232.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>sorting::wave_sort::waveSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function implements that implements the Wave Sort algorithm.">
-<polygon fill="#999999" stroke="#666666" points="96.25,-79.88 0,-79.88 0,-49.38 96.25,-49.38 96.25,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::wave_sort</text>
-<text text-anchor="middle" x="48.12" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::waveSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.09,-80.36C20.39,-89.43 28.07,-97.88 48.12,-97.88 59.09,-97.88 66.36,-95.35 69.93,-91.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.38,-92.19 71,-81.87 66.42,-91.42 73.38,-92.19"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-130.25 132.25,-130.25 132.25,-111 224,-111 224,-130.25"/>
-<text text-anchor="middle" x="178.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M82.53,-80.33C97.64,-87.33 115.77,-95.56 132.25,-102.62 135.05,-103.82 137.95,-105.04 140.88,-106.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.43,-109.45 150.01,-109.98 142.07,-102.96 139.43,-109.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.25,-93.25 136,-93.25 136,-74 220.25,-74 220.25,-93.25"/>
-<text text-anchor="middle" x="178.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.42,-71.65C105.54,-73 115.14,-74.42 124.41,-75.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.6,-79.22 134.01,-77.22 124.63,-72.29 123.6,-79.22"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.12,-56.25 152.12,-56.25 152.12,-37 204.12,-37 204.12,-56.25"/>
-<text text-anchor="middle" x="178.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.42,-57.97C111.11,-55.91 127.06,-53.67 140.87,-51.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.98,-55.24 150.4,-50.38 140.01,-48.31 140.98,-55.24"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="207.5,-19.25 148.75,-19.25 148.75,0 207.5,0 207.5,-19.25"/>
-<text text-anchor="middle" x="178.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.38,-49.03C98.33,-42.32 116.1,-34.46 132.25,-27.62 135.05,-26.44 137.96,-25.23 140.89,-24.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.08,-27.32 150.03,-20.31 139.44,-20.83 142.08,-27.32"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d3f/wave__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/db/d3f/wave__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index e85e01374..000000000
--- a/db/d3f/wave__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/db/d3f/wave__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/db/d3f/wave__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 5901bc148..000000000
--- a/db/d3f/wave__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-729fb887ee50b6291b0542ba0592a5c7
\ No newline at end of file
diff --git a/db/d3f/wave__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/db/d3f/wave__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 2e04695b9..000000000
--- a/db/d3f/wave__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d3f/wave__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/db/d3f/wave__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1813bd719..000000000
--- a/db/d3f/wave__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d3f/wave__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d3f/wave__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index d5310dcf3..000000000
--- a/db/d3f/wave__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/db/d3f/wave__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d3f/wave__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 735d21a00..000000000
--- a/db/d3f/wave__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f178a9d2df622c57e88a156f01513741
\ No newline at end of file
diff --git a/db/d3f/wave__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d3f/wave__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 704f255b3..000000000
--- a/db/d3f/wave__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d3f/wave__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/db/d3f/wave__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 3cfb496bb..000000000
--- a/db/d3f/wave__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d3f/wave__sort_8cpp_source.html b/db/d3f/wave__sort_8cpp_source.html
new file mode 100644
index 000000000..f5adfcff5
--- /dev/null
+++ b/db/d3f/wave__sort_8cpp_source.html
@@ -0,0 +1,210 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/wave_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/d3f/wave__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">wave_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../db/d3f/wave__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/d21/namespacewave__sort.html">wave_sort</a> {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00034" data-start="{" data-end="}">
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../db/d3f/wave__sort_8cpp.html#a7d4f243b9dc13ace4ef77e30dbc56f12">   34</a></span>std::vector&lt;T&gt; <a class="code hl_function" href="../../db/d3f/wave__sort_8cpp.html#a7d4f243b9dc13ace4ef77e30dbc56f12">waveSort</a>(<span class="keyword">const</span> std::vector&lt;T&gt; &amp;in_arr, int64_t n) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    std::vector&lt;T&gt; arr(in_arr);</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">for</span> (int64_t i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        arr[i] = in_arr[i];</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    }</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    std::sort(arr.begin(), arr.end());</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">for</span> (int64_t i = 0; i &lt; n - 1; i += 2) {  <span class="comment">// swap all the adjacent elements</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        std::swap(arr[i], arr[i + 1]);</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">return</span> arr;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>}</div>
+</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>}  <span class="comment">// namespace wave_sort</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="foldopen" id="foldopen00053" data-start="{" data-end="}">
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   53</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="comment">// [10, 90, 49, 2, 1, 5, 23] return [2, 1, 10, 5, 49, 23, 90]</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    std::vector&lt;int64_t&gt; array1 = {10, 90, 49, 2, 1, 5, 23};</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    std::vector&lt;int64_t&gt; arr1 = sorting::wave_sort::waveSort(array1, 7);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keyword">const</span> std::vector&lt;int64_t&gt; o1 = {2, 1, 10, 5, 49, 23, 90};</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    assert(arr1 == o1);</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="comment">// [1, 3, 4, 2, 7, 8] return [2, 1, 4, 3, 8, 7]</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    std::vector&lt;int64_t&gt; array2 = {1, 3, 4, 2, 7, 8};</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    std::vector&lt;int64_t&gt; arr2 = sorting::wave_sort::waveSort(array2, 6);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keyword">const</span> std::vector&lt;int64_t&gt; o2 = {2, 1, 4, 3, 8, 7};</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    assert(arr2 == o2);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="comment">// [3, 3, 3, 3] return [3, 3, 3, 3]</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::vector&lt;int64_t&gt; array3 = {3, 3, 3, 3};</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    std::vector&lt;int64_t&gt; arr3 = sorting::wave_sort::waveSort(array3, 4);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keyword">const</span> std::vector&lt;int64_t&gt; o3 = {3, 3, 3, 3};</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    assert(arr3 == o3);</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="comment">// [9, 4, 6, 8, 14, 3] return [4, 3, 8, 6, 14, 9]</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    std::vector&lt;int64_t&gt; array4 = {9, 4, 6, 8, 14, 3};</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4... &quot;</span>;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    std::vector&lt;int64_t&gt; arr4 = sorting::wave_sort::waveSort(array4, 6);</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keyword">const</span> std::vector&lt;int64_t&gt; o4 = {4, 3, 8, 6, 14, 9};</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    assert(arr4 == o4);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>}</div>
+</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="foldopen" id="foldopen00091" data-start="{" data-end="}">
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"><a class="line" href="../../db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   91</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <a class="code hl_function" href="../../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>}</div>
+</div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+<div class="ttc" id="anamespacewave__sort_html"><div class="ttname"><a href="../../d9/d21/namespacewave__sort.html">wave_sort</a></div><div class="ttdoc">Functions for the Wave sort implementation.</div></div>
+<div class="ttc" id="awave__sort_8cpp_html_a7d4f243b9dc13ace4ef77e30dbc56f12"><div class="ttname"><a href="../../db/d3f/wave__sort_8cpp.html#a7d4f243b9dc13ace4ef77e30dbc56f12">sorting::wave_sort::waveSort</a></div><div class="ttdeci">std::vector&lt; T &gt; waveSort(const std::vector&lt; T &gt; &amp;in_arr, int64_t n)</div><div class="ttdoc">The main function implements that implements the Wave Sort algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00034">wave_sort.cpp:34</a></div></div>
+<div class="ttc" id="awave__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../db/d3f/wave__sort_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> <a href="#l00053">wave_sort.cpp:53</a></div></div>
+<div class="ttc" id="awave__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00091">wave_sort.cpp:91</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../db/d3f/wave__sort_8cpp.html">wave_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/d40/integral__approximation2_8cpp.html b/db/d40/integral__approximation2_8cpp.html
index ef1a45ab2..62939cdca 100644
--- a/db/d40/integral__approximation2_8cpp.html
+++ b/db/d40/integral__approximation2_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/integral_approximation2.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/integral_approximation2.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -127,7 +144,9 @@ Include dependency graph for integral_approximation2.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d5c/integral__approximation2_8cpp__incl.svg" width="598" height="111"><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">
+</div>
+<p><a href="../../db/d40/integral__approximation2_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -144,10 +163,10 @@ Typedefs</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a71249ee535f16f8ed2e9cc8f0199a2cf" id="r_a71249ee535f16f8ed2e9cc8f0199a2cf"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; double &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a71249ee535f16f8ed2e9cc8f0199a2cf">math::monte_carlo::generate_samples</a> (const double &amp;start_point, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">Function</a> &amp;pdf, const uint32_t &amp;num_samples, const uint32_t &amp;discard=100000)</td></tr>
+<tr class="memitem:a71249ee535f16f8ed2e9cc8f0199a2cf" id="r_a71249ee535f16f8ed2e9cc8f0199a2cf"><td class="memItemLeft" align="right" valign="top">std::vector&lt; double &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a71249ee535f16f8ed2e9cc8f0199a2cf">math::monte_carlo::generate_samples</a> (const double &amp;start_point, const Function &amp;pdf, const uint32_t &amp;num_samples, const uint32_t &amp;discard=100000)</td></tr>
 <tr class="memdesc:a71249ee535f16f8ed2e9cc8f0199a2cf"><td class="mdescLeft">&#160;</td><td class="mdescRight">short-hand for std::functions used in this implementation  <br /></td></tr>
 <tr class="separator:a71249ee535f16f8ed2e9cc8f0199a2cf"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af7da9ba8932f1f48b9bbc2d80471af51" id="r_af7da9ba8932f1f48b9bbc2d80471af51"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af7da9ba8932f1f48b9bbc2d80471af51">math::monte_carlo::integral_monte_carlo</a> (const double &amp;start_point, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">Function</a> &amp;function, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">Function</a> &amp;pdf, const uint32_t &amp;num_samples=1000000)</td></tr>
+<tr class="memitem:af7da9ba8932f1f48b9bbc2d80471af51" id="r_af7da9ba8932f1f48b9bbc2d80471af51"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af7da9ba8932f1f48b9bbc2d80471af51">math::monte_carlo::integral_monte_carlo</a> (const double &amp;start_point, const Function &amp;function, const Function &amp;pdf, const uint32_t &amp;num_samples=1000000)</td></tr>
 <tr class="memdesc:af7da9ba8932f1f48b9bbc2d80471af51"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute an approximation of an integral using Monte Carlo integration.  <br /></td></tr>
 <tr class="separator:af7da9ba8932f1f48b9bbc2d80471af51"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -162,7 +181,26 @@ Functions</h2></td></tr>
 <p>In mathematics, Monte Carlo integration is a technique for numerical integration using random numbers. It is a particular Monte Carlo method that numerically computes a definite integral. While other algorithms usually evaluate the integrand at a regular grid, Monte Carlo randomly chooses points at which the integrand is evaluated. This method is particularly useful for higher-dimensional integrals.</p>
 <p>This implementation supports arbitrary pdfs. These pdfs are sampled using the <a href="https://en.wikipedia.org/wiki/Metropolis–Hastings_algorithm" target="_blank">Metropolis-Hastings algorithm</a>. This can be swapped out by every other sampling techniques for example the inverse method. Metropolis-Hastings was chosen because it is the most general and can also be extended for a higher dimensional sampling space.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/DerAndereDomenic" target="_blank">Domenic Zingsheim</a> </dd></dl>
-</div><h2 class="groupheader">Typedef Documentation</h2>
+
+<p class="definition">Definition in file <a class="el" href="../../db/d40/integral__approximation2_8cpp_source.html">integral_approximation2.cpp</a>.</p>
+</div><h2 class="groupheader">Macro Definition Documentation</h2>
+<a id="a525335710b53cb064ca56b936120431e" name="a525335710b53cb064ca56b936120431e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a525335710b53cb064ca56b936120431e">&#9670;&#160;</a></span>_USE_MATH_DEFINES</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">#define _USE_MATH_DEFINES</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../db/d40/integral__approximation2_8cpp_source.html#l00024">24</a> of file <a class="el" href="../../db/d40/integral__approximation2_8cpp_source.html">integral_approximation2.cpp</a>.</p>
+
+</div>
+</div>
+<h2 class="groupheader">Typedef Documentation</h2>
 <a id="aa546b0e9315b7d9e9a8f6b71dd643de7" name="aa546b0e9315b7d9e9a8f6b71dd643de7"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aa546b0e9315b7d9e9a8f6b71dd643de7">&#9670;&#160;</a></span>Function</h2>
 
@@ -170,14 +208,15 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname">using <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">math::monte_carlo::Function</a></td>
+          <td class="memname">using math::monte_carlo::Function</td>
         </tr>
       </table>
 </div><div class="memdoc">
-<b>Initial value:</b><div class="fragment"><div class="line"> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt;double(</div>
+<b>Initial value:</b><div class="fragment"><div class="line"> std::function&lt;double(</div>
 <div class="line">    <span class="keywordtype">double</span>&amp;)&gt;</div>
-<div class="ttc" id="afunction_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a></div></div>
 </div><!-- fragment -->
+<p class="definition">Definition at line <a class="el" href="../../db/d40/integral__approximation2_8cpp_source.html#l00046">46</a> of file <a class="el" href="../../db/d40/integral__approximation2_8cpp_source.html">integral_approximation2.cpp</a>.</p>
+
 </div>
 </div>
 <h2 class="groupheader">Function Documentation</h2>
@@ -188,14 +227,14 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; double &gt; math::monte_carlo::generate_samples </td>
+          <td class="memname">std::vector&lt; double &gt; math::monte_carlo::generate_samples </td>
           <td>(</td>
           <td class="paramtype">const double &amp;</td>          <td class="paramname"><span class="paramname"><em>start_point</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">Function</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>pdf</em></span>, </td>
+          <td class="paramtype">const Function &amp;</td>          <td class="paramname"><span class="paramname"><em>pdf</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -222,22 +261,24 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>A vector of size num_samples with samples distributed according to the pdf </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d40/integral__approximation2_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../db/d40/integral__approximation2_8cpp_source.html">integral_approximation2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   67</span>                                                                       {</div>
-<div class="line"><span class="lineno">   68</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> samples;</div>
-<div class="line"><span class="lineno">   69</span>    samples.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">reserve</a>(num_samples);</div>
+<div class="line"><span class="lineno">   68</span>    std::vector&lt;double&gt; samples;</div>
+<div class="line"><span class="lineno">   69</span>    samples.reserve(num_samples);</div>
 <div class="line"><span class="lineno">   70</span> </div>
 <div class="line"><span class="lineno">   71</span>    <span class="keywordtype">double</span> x_t = start_point;</div>
 <div class="line"><span class="lineno">   72</span> </div>
-<div class="line"><span class="lineno">   73</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random.html">std::default_random_engine</a> generator;</div>
-<div class="line"><span class="lineno">   74</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution.html">std::uniform_real_distribution&lt;double&gt;</a> uniform(0.0, 1.0);</div>
-<div class="line"><span class="lineno">   75</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/normal_distribution.html">std::normal_distribution&lt;double&gt;</a> normal(0.0, 1.0);</div>
-<div class="line"><span class="lineno">   76</span>    generator.seed(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">time</a>(<span class="keyword">nullptr</span>));</div>
+<div class="line"><span class="lineno">   73</span>    std::default_random_engine generator;</div>
+<div class="line"><span class="lineno">   74</span>    std::uniform_real_distribution&lt;double&gt; uniform(0.0, 1.0);</div>
+<div class="line"><span class="lineno">   75</span>    std::normal_distribution&lt;double&gt; normal(0.0, 1.0);</div>
+<div class="line"><span class="lineno">   76</span>    generator.seed(time(<span class="keyword">nullptr</span>));</div>
 <div class="line"><span class="lineno">   77</span> </div>
 <div class="line"><span class="lineno">   78</span>    <span class="keywordflow">for</span> (uint32_t t = 0; t &lt; num_samples + discard; ++t) {</div>
 <div class="line"><span class="lineno">   79</span>        <span class="comment">// Generate a new proposal according to some mutation strategy.</span></div>
 <div class="line"><span class="lineno">   80</span>        <span class="comment">// This is arbitrary and can be swapped.</span></div>
 <div class="line"><span class="lineno">   81</span>        <span class="keywordtype">double</span> x_dash = normal(generator) + x_t;</div>
-<div class="line"><span class="lineno">   82</span>        <span class="keywordtype">double</span> acceptance_probability = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(pdf(x_dash) / pdf(x_t), 1.0);</div>
+<div class="line"><span class="lineno">   82</span>        <span class="keywordtype">double</span> acceptance_probability = std::min(pdf(x_dash) / pdf(x_t), 1.0);</div>
 <div class="line"><span class="lineno">   83</span>        <span class="keywordtype">double</span> u = uniform(generator);</div>
 <div class="line"><span class="lineno">   84</span> </div>
 <div class="line"><span class="lineno">   85</span>        <span class="comment">// Accept &quot;new state&quot; according to the acceptance_probability</span></div>
@@ -246,26 +287,13 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   88</span>        }</div>
 <div class="line"><span class="lineno">   89</span> </div>
 <div class="line"><span class="lineno">   90</span>        <span class="keywordflow">if</span> (t &gt;= discard) {</div>
-<div class="line"><span class="lineno">   91</span>            samples.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(x_t);</div>
+<div class="line"><span class="lineno">   91</span>            samples.push_back(x_t);</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> </div>
 <div class="line"><span class="lineno">   95</span>    <span class="keywordflow">return</span> samples;</div>
 <div class="line"><span class="lineno">   96</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="anormal_distribution_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/normal_distribution.html">std::normal_distribution</a></div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="arandom_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random.html">std::default_random_engine</a></div></div>
-<div class="ttc" id="areserve_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">std::vector::reserve</a></div><div class="ttdeci">T reserve(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-<div class="ttc" id="auniform_real_distribution_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution.html">std::uniform_real_distribution</a></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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d40/integral__approximation2_8cpp_a71249ee535f16f8ed2e9cc8f0199a2cf_cgraph.svg" width="351" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af7da9ba8932f1f48b9bbc2d80471af51" name="af7da9ba8932f1f48b9bbc2d80471af51"></a>
@@ -282,12 +310,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">Function</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>function</em></span>, </td>
+          <td class="paramtype">const Function &amp;</td>          <td class="paramname"><span class="paramname"><em>function</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">Function</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>pdf</em></span>, </td>
+          <td class="paramtype">const Function &amp;</td>          <td class="paramname"><span class="paramname"><em>pdf</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -308,9 +336,11 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The approximation of the integral according to 1/N \sum_{i}^N f(x_i) / p(x_i) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d40/integral__approximation2_8cpp_source.html#l00112">112</a> of file <a class="el" href="../../db/d40/integral__approximation2_8cpp_source.html">integral_approximation2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  114</span>                                                                   {</div>
 <div class="line"><span class="lineno">  115</span>    <span class="keywordtype">double</span> integral = 0.0;</div>
-<div class="line"><span class="lineno">  116</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> samples =</div>
+<div class="line"><span class="lineno">  116</span>    std::vector&lt;double&gt; samples =</div>
 <div class="line"><span class="lineno">  117</span>        <a class="code hl_function" href="#a71249ee535f16f8ed2e9cc8f0199a2cf">generate_samples</a>(start_point, pdf, num_samples);</div>
 <div class="line"><span class="lineno">  118</span> </div>
 <div class="line"><span class="lineno">  119</span>    <span class="keywordflow">for</span> (<span class="keywordtype">double</span> sample : samples) {</div>
@@ -319,13 +349,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  122</span> </div>
 <div class="line"><span class="lineno">  123</span>    <span class="keywordflow">return</span> integral / <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(samples.size());</div>
 <div class="line"><span class="lineno">  124</span>}</div>
-<div class="ttc" id="aintegral__approximation2_8cpp_html_a71249ee535f16f8ed2e9cc8f0199a2cf"><div class="ttname"><a href="#a71249ee535f16f8ed2e9cc8f0199a2cf">math::monte_carlo::generate_samples</a></div><div class="ttdeci">std::vector&lt; double &gt; generate_samples(const double &amp;start_point, const Function &amp;pdf, const uint32_t &amp;num_samples, const uint32_t &amp;discard=100000)</div><div class="ttdoc">short-hand for std::functions used in this implementation</div><div class="ttdef"><b>Definition</b> integral_approximation2.cpp:64</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d40/integral__approximation2_8cpp_af7da9ba8932f1f48b9bbc2d80471af51_cgraph.svg" width="540" height="143"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aintegral__approximation2_8cpp_html_a71249ee535f16f8ed2e9cc8f0199a2cf"><div class="ttname"><a href="#a71249ee535f16f8ed2e9cc8f0199a2cf">math::monte_carlo::generate_samples</a></div><div class="ttdeci">std::vector&lt; double &gt; generate_samples(const double &amp;start_point, const Function &amp;pdf, const uint32_t &amp;num_samples, const uint32_t &amp;discard=100000)</div><div class="ttdoc">short-hand for std::functions used in this implementation</div><div class="ttdef"><b>Definition</b> <a href="../../db/d40/integral__approximation2_8cpp_source.html#l00064">integral_approximation2.cpp:64</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -345,17 +370,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d40/integral__approximation2_8cpp_source.html#l00215">215</a> of file <a class="el" href="../../db/d40/integral__approximation2_8cpp_source.html">integral_approximation2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  215</span>           {</div>
 <div class="line"><span class="lineno">  216</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  217</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  218</span>}</div>
-<div class="ttc" id="aintegral__approximation2_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> integral_approximation2.cpp:133</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d40/integral__approximation2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aintegral__approximation2_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d40/integral__approximation2_8cpp_source.html#l00133">integral_approximation2.cpp:133</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -383,25 +405,27 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d40/integral__approximation2_8cpp_source.html#l00133">133</a> of file <a class="el" href="../../db/d40/integral__approximation2_8cpp_source.html">integral_approximation2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  133</span>                   {</div>
-<div class="line"><span class="lineno">  134</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Disclaimer: Because this is a randomized algorithm,&quot;</span></div>
-<div class="line"><span class="lineno">  135</span>              &lt;&lt; <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">  136</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div>
+<div class="line"><span class="lineno">  134</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Disclaimer: Because this is a randomized algorithm,&quot;</span></div>
+<div class="line"><span class="lineno">  135</span>              &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  136</span>    std::cout</div>
 <div class="line"><span class="lineno">  137</span>        &lt;&lt; <span class="stringliteral">&quot;it may happen that singular samples deviate from the true result.&quot;</span></div>
-<div class="line"><span class="lineno">  138</span>        &lt;&lt; <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">  139</span>        &lt;&lt; <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">  138</span>        &lt;&lt; std::endl</div>
+<div class="line"><span class="lineno">  139</span>        &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  140</span>    ;</div>
 <div class="line"><span class="lineno">  141</span> </div>
-<div class="line"><span class="lineno">  142</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">math::monte_carlo::Function</a> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">f</a>;</div>
-<div class="line"><span class="lineno">  143</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">math::monte_carlo::Function</a> pdf;</div>
+<div class="line"><span class="lineno">  142</span>    math::monte_carlo::Function <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">f</a>;</div>
+<div class="line"><span class="lineno">  143</span>    math::monte_carlo::Function pdf;</div>
 <div class="line"><span class="lineno">  144</span>    <span class="keywordtype">double</span> integral = 0;</div>
-<div class="line"><span class="lineno">  145</span>    <span class="keywordtype">double</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/lower_bound.html">lower_bound</a> = 0, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/upper_bound.html">upper_bound</a> = 0;</div>
+<div class="line"><span class="lineno">  145</span>    <span class="keywordtype">double</span> lower_bound = 0, upper_bound = 0;</div>
 <div class="line"><span class="lineno">  146</span> </div>
 <div class="line"><span class="lineno">  147</span>    <span class="comment">/* \int_{-2}^{2} -x^2 + 4 dx */</span></div>
 <div class="line"><span class="lineno">  148</span>    <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">f</a> = [&amp;](<span class="keywordtype">double</span>&amp; x) { <span class="keywordflow">return</span> -x * x + 4.0; };</div>
 <div class="line"><span class="lineno">  149</span> </div>
-<div class="line"><span class="lineno">  150</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/lower_bound.html">lower_bound</a> = -2.0;</div>
-<div class="line"><span class="lineno">  151</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/upper_bound.html">upper_bound</a> = 2.0;</div>
+<div class="line"><span class="lineno">  150</span>    lower_bound = -2.0;</div>
+<div class="line"><span class="lineno">  151</span>    upper_bound = 2.0;</div>
 <div class="line"><span class="lineno">  152</span>    pdf = [&amp;](<span class="keywordtype">double</span>&amp; x) {</div>
 <div class="line"><span class="lineno">  153</span>        <span class="keywordflow">if</span> (x &gt;= lower_bound &amp;&amp; x &lt;= -1.0) {</div>
 <div class="line"><span class="lineno">  154</span>            <span class="keywordflow">return</span> 0.1;</div>
@@ -418,14 +442,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  165</span>    integral = <a class="code hl_function" href="#af7da9ba8932f1f48b9bbc2d80471af51">math::monte_carlo::integral_monte_carlo</a>(</div>
 <div class="line"><span class="lineno">  166</span>        (upper_bound - lower_bound) / 2.0, f, pdf);</div>
 <div class="line"><span class="lineno">  167</span> </div>
-<div class="line"><span class="lineno">  168</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;This number should be close to 10.666666: &quot;</span> &lt;&lt; integral</div>
-<div class="line"><span class="lineno">  169</span>              &lt;&lt; <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">  168</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;This number should be close to 10.666666: &quot;</span> &lt;&lt; integral</div>
+<div class="line"><span class="lineno">  169</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  170</span> </div>
 <div class="line"><span class="lineno">  171</span>    <span class="comment">/* \int_{0}^{1} e^x dx */</span></div>
-<div class="line"><span class="lineno">  172</span>    <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">f</a> = [&amp;](<span class="keywordtype">double</span>&amp; x) { <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a>(x); };</div>
+<div class="line"><span class="lineno">  172</span>    <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">f</a> = [&amp;](<span class="keywordtype">double</span>&amp; x) { <span class="keywordflow">return</span> std::exp(x); };</div>
 <div class="line"><span class="lineno">  173</span> </div>
-<div class="line"><span class="lineno">  174</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/lower_bound.html">lower_bound</a> = 0.0;</div>
-<div class="line"><span class="lineno">  175</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/upper_bound.html">upper_bound</a> = 1.0;</div>
+<div class="line"><span class="lineno">  174</span>    lower_bound = 0.0;</div>
+<div class="line"><span class="lineno">  175</span>    upper_bound = 1.0;</div>
 <div class="line"><span class="lineno">  176</span>    pdf = [&amp;](<span class="keywordtype">double</span>&amp; x) {</div>
 <div class="line"><span class="lineno">  177</span>        <span class="keywordflow">if</span> (x &gt;= lower_bound &amp;&amp; x &lt;= 0.2) {</div>
 <div class="line"><span class="lineno">  178</span>            <span class="keywordflow">return</span> 0.1;</div>
@@ -442,39 +466,27 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  189</span>    integral = <a class="code hl_function" href="#af7da9ba8932f1f48b9bbc2d80471af51">math::monte_carlo::integral_monte_carlo</a>(</div>
 <div class="line"><span class="lineno">  190</span>        (upper_bound - lower_bound) / 2.0, f, pdf);</div>
 <div class="line"><span class="lineno">  191</span> </div>
-<div class="line"><span class="lineno">  192</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;This number should be close to 1.7182818: &quot;</span> &lt;&lt; integral</div>
-<div class="line"><span class="lineno">  193</span>              &lt;&lt; <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">  192</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;This number should be close to 1.7182818: &quot;</span> &lt;&lt; integral</div>
+<div class="line"><span class="lineno">  193</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  194</span> </div>
 <div class="line"><span class="lineno">  195</span>    <span class="comment">/* \int_{-\infty}^{\infty} sinc(x) dx, sinc(x) = sin(pi * x) / (pi * x)</span></div>
 <div class="line"><span class="lineno">  196</span><span class="comment">       This is a difficult integral because of its infinite domain.</span></div>
 <div class="line"><span class="lineno">  197</span><span class="comment">       Therefore, it may deviate largely from the expected result.</span></div>
 <div class="line"><span class="lineno">  198</span><span class="comment">    */</span></div>
-<div class="line"><span class="lineno">  199</span>    <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">f</a> = [&amp;](<span class="keywordtype">double</span>&amp; x) { <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a>(M_PI * x) / (M_PI * x); };</div>
+<div class="line"><span class="lineno">  199</span>    <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">f</a> = [&amp;](<span class="keywordtype">double</span>&amp; x) { <span class="keywordflow">return</span> std::sin(M_PI * x) / (M_PI * x); };</div>
 <div class="line"><span class="lineno">  200</span> </div>
 <div class="line"><span class="lineno">  201</span>    pdf = [&amp;](<span class="keywordtype">double</span>&amp; x) {</div>
-<div class="line"><span class="lineno">  202</span>        <span class="keywordflow">return</span> 1.0 / <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(2.0 * M_PI) * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a>(-x * x / 2.0);</div>
+<div class="line"><span class="lineno">  202</span>        <span class="keywordflow">return</span> 1.0 / std::sqrt(2.0 * M_PI) * std::exp(-x * x / 2.0);</div>
 <div class="line"><span class="lineno">  203</span>    };</div>
 <div class="line"><span class="lineno">  204</span> </div>
 <div class="line"><span class="lineno">  205</span>    integral = <a class="code hl_function" href="#af7da9ba8932f1f48b9bbc2d80471af51">math::monte_carlo::integral_monte_carlo</a>(0.0, f, pdf, 10000000);</div>
 <div class="line"><span class="lineno">  206</span> </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> &lt;&lt; <span class="stringliteral">&quot;This number should be close to 1.0: &quot;</span> &lt;&lt; integral</div>
-<div class="line"><span class="lineno">  208</span>              &lt;&lt; <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">  207</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;This number should be close to 1.0: &quot;</span> &lt;&lt; integral</div>
+<div class="line"><span class="lineno">  208</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  209</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="acomposite__simpson__rule_8cpp_html_a4251b4df4748a0b9c43a48f61bdd2397"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">numerical_methods::simpson_method::f</a></div><div class="ttdeci">double f(double x)</div><div class="ttdoc">A function f(x) that will be used to test the method.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:113</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="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div>
-<div class="ttc" id="aintegral__approximation2_8cpp_html_af7da9ba8932f1f48b9bbc2d80471af51"><div class="ttname"><a href="#af7da9ba8932f1f48b9bbc2d80471af51">math::monte_carlo::integral_monte_carlo</a></div><div class="ttdeci">double integral_monte_carlo(const double &amp;start_point, const Function &amp;function, const Function &amp;pdf, const uint32_t &amp;num_samples=1000000)</div><div class="ttdoc">Compute an approximation of an integral using Monte Carlo integration.</div><div class="ttdef"><b>Definition</b> integral_approximation2.cpp:112</div></div>
-<div class="ttc" id="alower_bound_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/lower_bound.html">std::lower_bound</a></div><div class="ttdeci">T lower_bound(T... args)</div></div>
-<div class="ttc" id="asin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a></div><div class="ttdeci">T sin(T... args)</div></div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
-<div class="ttc" id="aupper_bound_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/upper_bound.html">std::upper_bound</a></div><div class="ttdeci">T upper_bound(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d40/integral__approximation2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a4251b4df4748a0b9c43a48f61bdd2397"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397">numerical_methods::simpson_method::f</a></div><div class="ttdeci">double f(double x)</div><div class="ttdoc">A function f(x) that will be used to test the method.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00113">composite_simpson_rule.cpp:113</a></div></div>
+<div class="ttc" id="aintegral__approximation2_8cpp_html_af7da9ba8932f1f48b9bbc2d80471af51"><div class="ttname"><a href="#af7da9ba8932f1f48b9bbc2d80471af51">math::monte_carlo::integral_monte_carlo</a></div><div class="ttdeci">double integral_monte_carlo(const double &amp;start_point, const Function &amp;function, const Function &amp;pdf, const uint32_t &amp;num_samples=1000000)</div><div class="ttdoc">Compute an approximation of an integral using Monte Carlo integration.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d40/integral__approximation2_8cpp_source.html#l00112">integral_approximation2.cpp:112</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/db/d40/integral__approximation2_8cpp_a71249ee535f16f8ed2e9cc8f0199a2cf_cgraph.map b/db/d40/integral__approximation2_8cpp_a71249ee535f16f8ed2e9cc8f0199a2cf_cgraph.map
deleted file mode 100644
index c526bfe93..000000000
--- a/db/d40/integral__approximation2_8cpp_a71249ee535f16f8ed2e9cc8f0199a2cf_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="math::monte_carlo::generate_samples" name="math::monte_carlo::generate_samples">
-<area shape="rect" id="Node000001" title="short&#45;hand for std::functions used in this implementation" alt="" coords="5,47,143,88"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="37,47,35,37,41,28,54,23,74,21,95,23,108,29,105,34,94,28,74,26,56,28,45,32,40,38,42,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="234,5,302,31"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="143,47,218,28,220,33,144,53"/>
-<area shape="rect" id="Node000003" 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="191,55,345,80"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="143,65,175,65,175,70,143,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/reserve.html#" title=" " alt="" coords="201,104,335,130"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="144,82,201,97,199,102,143,88"/>
-</map>
diff --git a/db/d40/integral__approximation2_8cpp_a71249ee535f16f8ed2e9cc8f0199a2cf_cgraph.md5 b/db/d40/integral__approximation2_8cpp_a71249ee535f16f8ed2e9cc8f0199a2cf_cgraph.md5
deleted file mode 100644
index 9bc382ed5..000000000
--- a/db/d40/integral__approximation2_8cpp_a71249ee535f16f8ed2e9cc8f0199a2cf_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6e59671e4799cabb0ddcc6bb203b23ff
\ No newline at end of file
diff --git a/db/d40/integral__approximation2_8cpp_a71249ee535f16f8ed2e9cc8f0199a2cf_cgraph.svg b/db/d40/integral__approximation2_8cpp_a71249ee535f16f8ed2e9cc8f0199a2cf_cgraph.svg
deleted file mode 100644
index 66686ce84..000000000
--- a/db/d40/integral__approximation2_8cpp_a71249ee535f16f8ed2e9cc8f0199a2cf_cgraph.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::monte_carlo::generate_samples Pages: 1 -->
-<svg width="263pt" height="101pt"
- viewBox="0.00 0.00 262.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>math::monte_carlo::generate_samples</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="short&#45;hand for std::functions used in this implementation">
-<polygon fill="#999999" stroke="#666666" points="103,-61.88 0,-61.88 0,-31.38 103,-31.38 103,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::monte_carlo::</text>
-<text text-anchor="middle" x="51.5" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">generate_samples</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.74,-62.36C20.48,-71.43 29.07,-79.88 51.5,-79.88 63.77,-79.88 71.89,-77.35 75.88,-73.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.33,-74.22 77.08,-63.86 72.38,-73.36 79.33,-74.22"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222.5,-93.25 171.25,-93.25 171.25,-74 222.5,-74 222.5,-93.25"/>
-<text text-anchor="middle" x="196.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.45,-59.77C122.2,-64.61 143.03,-69.99 160.15,-74.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.79,-77.67 169.35,-76.78 160.54,-70.89 158.79,-77.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-56.25 139,-56.25 139,-37 254.75,-37 254.75,-56.25"/>
-<text text-anchor="middle" x="196.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.45,-46.62C111.22,-46.62 119.34,-46.62 127.41,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.23,-50.13 137.23,-46.63 127.23,-43.13 127.23,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/reserve.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.25,-19.25 146.5,-19.25 146.5,0 247.25,0 247.25,-19.25"/>
-<text text-anchor="middle" x="196.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::reserve</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.45,-33.48C117.3,-29.9 132.27,-26.04 146.05,-22.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.53,-25.97 155.34,-20.09 144.78,-19.2 146.53,-25.97"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d40/integral__approximation2_8cpp_a71249ee535f16f8ed2e9cc8f0199a2cf_cgraph_org.svg b/db/d40/integral__approximation2_8cpp_a71249ee535f16f8ed2e9cc8f0199a2cf_cgraph_org.svg
deleted file mode 100644
index b3bfae277..000000000
--- a/db/d40/integral__approximation2_8cpp_a71249ee535f16f8ed2e9cc8f0199a2cf_cgraph_org.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::monte_carlo::generate_samples Pages: 1 -->
-<svg width="263pt" height="101pt"
- viewBox="0.00 0.00 262.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>math::monte_carlo::generate_samples</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="short&#45;hand for std::functions used in this implementation">
-<polygon fill="#999999" stroke="#666666" points="103,-61.88 0,-61.88 0,-31.38 103,-31.38 103,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::monte_carlo::</text>
-<text text-anchor="middle" x="51.5" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">generate_samples</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.74,-62.36C20.48,-71.43 29.07,-79.88 51.5,-79.88 63.77,-79.88 71.89,-77.35 75.88,-73.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.33,-74.22 77.08,-63.86 72.38,-73.36 79.33,-74.22"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222.5,-93.25 171.25,-93.25 171.25,-74 222.5,-74 222.5,-93.25"/>
-<text text-anchor="middle" x="196.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.45,-59.77C122.2,-64.61 143.03,-69.99 160.15,-74.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.79,-77.67 169.35,-76.78 160.54,-70.89 158.79,-77.67"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-56.25 139,-56.25 139,-37 254.75,-37 254.75,-56.25"/>
-<text text-anchor="middle" x="196.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.45,-46.62C111.22,-46.62 119.34,-46.62 127.41,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.23,-50.13 137.23,-46.63 127.23,-43.13 127.23,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/reserve.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="247.25,-19.25 146.5,-19.25 146.5,0 247.25,0 247.25,-19.25"/>
-<text text-anchor="middle" x="196.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::reserve</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.45,-33.48C117.3,-29.9 132.27,-26.04 146.05,-22.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.53,-25.97 155.34,-20.09 144.78,-19.2 146.53,-25.97"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d40/integral__approximation2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/db/d40/integral__approximation2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index e890aa115..000000000
--- a/db/d40/integral__approximation2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,80,49,106"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="45,77,95,40,98,38,101,42,98,44,48,82"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/exp.html#" title=" " alt="" coords="98,55,166,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="48,85,82,77,84,82,50,90"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sin.html#" title=" " alt="" coords="100,104,164,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="50,95,85,103,84,109,49,100"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="98,153,167,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="48,104,98,140,101,142,98,146,95,144,45,108"/>
-</map>
diff --git a/db/d40/integral__approximation2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/db/d40/integral__approximation2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 1a52531fc..000000000
--- a/db/d40/integral__approximation2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f7c52ce989430da0ad39e012eb8f3633
\ No newline at end of file
diff --git a/db/d40/integral__approximation2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/db/d40/integral__approximation2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 5c54917e4..000000000
--- a/db/d40/integral__approximation2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="138pt"
- viewBox="0.00 0.00 130.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-74.25 0,-74.25 0,-55 32.5,-55 32.5,-74.25"/>
-<text text-anchor="middle" x="16.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-130.25 68.5,-130.25 68.5,-111 122,-111 122,-130.25"/>
-<text text-anchor="middle" x="95.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.66,-74.73C40.96,-82.45 55.56,-93.3 68.5,-102.62 69.18,-103.12 69.87,-103.61 70.57,-104.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.34,-106.82 78.53,-109.73 72.38,-101.1 68.34,-106.82"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="120.88,-93.25 69.62,-93.25 69.62,-74 120.88,-74 120.88,-93.25"/>
-<text text-anchor="middle" x="95.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-68.47C40.19,-70.28 49.29,-72.53 58.22,-74.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.28,-78.11 67.82,-77.1 58.95,-71.31 57.28,-78.11"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="119.38,-56.25 71.12,-56.25 71.12,-37 119.38,-37 119.38,-56.25"/>
-<text text-anchor="middle" x="95.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-60.98C40.58,-59.17 50.28,-56.9 59.66,-54.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.38,-58.14 69.32,-52.45 58.79,-51.32 60.38,-58.14"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="121.25,-19.25 69.25,-19.25 69.25,0 121.25,0 121.25,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.13,-54.52C41.42,-47.05 55.8,-36.65 68.5,-27.62 69.18,-27.14 69.88,-26.65 70.58,-26.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.38,-29.16 78.55,-20.55 68.35,-23.44 72.38,-29.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d40/integral__approximation2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/db/d40/integral__approximation2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 4d6786e1a..000000000
--- a/db/d40/integral__approximation2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="138pt"
- viewBox="0.00 0.00 130.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-74.25 0,-74.25 0,-55 32.5,-55 32.5,-74.25"/>
-<text text-anchor="middle" x="16.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-130.25 68.5,-130.25 68.5,-111 122,-111 122,-130.25"/>
-<text text-anchor="middle" x="95.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.66,-74.73C40.96,-82.45 55.56,-93.3 68.5,-102.62 69.18,-103.12 69.87,-103.61 70.57,-104.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.34,-106.82 78.53,-109.73 72.38,-101.1 68.34,-106.82"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="120.88,-93.25 69.62,-93.25 69.62,-74 120.88,-74 120.88,-93.25"/>
-<text text-anchor="middle" x="95.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-68.47C40.19,-70.28 49.29,-72.53 58.22,-74.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.28,-78.11 67.82,-77.1 58.95,-71.31 57.28,-78.11"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="119.38,-56.25 71.12,-56.25 71.12,-37 119.38,-37 119.38,-56.25"/>
-<text text-anchor="middle" x="95.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-60.98C40.58,-59.17 50.28,-56.9 59.66,-54.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.38,-58.14 69.32,-52.45 58.79,-51.32 60.38,-58.14"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="121.25,-19.25 69.25,-19.25 69.25,0 121.25,0 121.25,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.13,-54.52C41.42,-47.05 55.8,-36.65 68.5,-27.62 69.18,-27.14 69.88,-26.65 70.58,-26.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.38,-29.16 78.55,-20.55 68.35,-23.44 72.38,-29.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d40/integral__approximation2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d40/integral__approximation2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 110429a02..000000000
--- a/db/d40/integral__approximation2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,80,55,106"/>
-<area shape="rect" id="Node000002" href="$db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,80,146,106"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,90,87,90,87,96,55,96"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="142,77,192,40,195,38,198,42,196,44,145,82"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/exp.html#" title=" " alt="" coords="196,55,264,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="146,85,180,77,181,82,147,90"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sin.html#" title=" " alt="" coords="198,104,262,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="147,95,183,103,182,109,146,100"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="195,153,264,179"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="146,104,196,140,198,142,195,146,192,144,143,108"/>
-</map>
diff --git a/db/d40/integral__approximation2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d40/integral__approximation2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 14e03729a..000000000
--- a/db/d40/integral__approximation2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-99eced2e92c4878ee05448ada282565d
\ No newline at end of file
diff --git a/db/d40/integral__approximation2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d40/integral__approximation2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index f409a0fc2..000000000
--- a/db/d40/integral__approximation2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="138pt"
- viewBox="0.00 0.00 203.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-74.25 73,-74.25 73,-55 105.5,-55 105.5,-74.25"/>
-<text text-anchor="middle" x="89.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-64.62C44.58,-64.62 53.31,-64.62 61.45,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-68.13 71.2,-64.63 61.2,-61.13 61.2,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-130.25 141.5,-130.25 141.5,-111 195,-111 195,-130.25"/>
-<text text-anchor="middle" x="168.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.66,-74.73C113.96,-82.45 128.56,-93.3 141.5,-102.62 142.18,-103.12 142.87,-103.61 143.57,-104.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.34,-106.82 151.53,-109.73 145.38,-101.1 141.34,-106.82"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.88,-93.25 142.62,-93.25 142.62,-74 193.88,-74 193.88,-93.25"/>
-<text text-anchor="middle" x="168.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-68.47C113.19,-70.28 122.29,-72.53 131.22,-74.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.28,-78.11 140.82,-77.1 131.95,-71.31 130.28,-78.11"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="192.38,-56.25 144.12,-56.25 144.12,-37 192.38,-37 192.38,-56.25"/>
-<text text-anchor="middle" x="168.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-60.98C113.58,-59.17 123.28,-56.9 132.66,-54.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.38,-58.14 142.32,-52.45 131.79,-51.32 133.38,-58.14"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194.25,-19.25 142.25,-19.25 142.25,0 194.25,0 194.25,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.13,-54.52C114.42,-47.05 128.8,-36.65 141.5,-27.62 142.18,-27.14 142.88,-26.65 143.58,-26.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.38,-29.16 151.55,-20.55 141.35,-23.44 145.38,-29.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d40/integral__approximation2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/db/d40/integral__approximation2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index cf4030745..000000000
--- a/db/d40/integral__approximation2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="138pt"
- viewBox="0.00 0.00 203.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-74.25 73,-74.25 73,-55 105.5,-55 105.5,-74.25"/>
-<text text-anchor="middle" x="89.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-64.62C44.58,-64.62 53.31,-64.62 61.45,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-68.13 71.2,-64.63 61.2,-61.13 61.2,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-130.25 141.5,-130.25 141.5,-111 195,-111 195,-130.25"/>
-<text text-anchor="middle" x="168.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.66,-74.73C113.96,-82.45 128.56,-93.3 141.5,-102.62 142.18,-103.12 142.87,-103.61 143.57,-104.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.34,-106.82 151.53,-109.73 145.38,-101.1 141.34,-106.82"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.88,-93.25 142.62,-93.25 142.62,-74 193.88,-74 193.88,-93.25"/>
-<text text-anchor="middle" x="168.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-68.47C113.19,-70.28 122.29,-72.53 131.22,-74.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.28,-78.11 140.82,-77.1 131.95,-71.31 130.28,-78.11"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="192.38,-56.25 144.12,-56.25 144.12,-37 192.38,-37 192.38,-56.25"/>
-<text text-anchor="middle" x="168.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-60.98C113.58,-59.17 123.28,-56.9 132.66,-54.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.38,-58.14 142.32,-52.45 131.79,-51.32 133.38,-58.14"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194.25,-19.25 142.25,-19.25 142.25,0 194.25,0 194.25,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.13,-54.52C114.42,-47.05 128.8,-36.65 141.5,-27.62 142.18,-27.14 142.88,-26.65 143.58,-26.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.38,-29.16 151.55,-20.55 141.35,-23.44 145.38,-29.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d40/integral__approximation2_8cpp_af7da9ba8932f1f48b9bbc2d80471af51_cgraph.map b/db/d40/integral__approximation2_8cpp_af7da9ba8932f1f48b9bbc2d80471af51_cgraph.map
deleted file mode 100644
index 1031a1269..000000000
--- a/db/d40/integral__approximation2_8cpp_af7da9ba8932f1f48b9bbc2d80471af51_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="math::monte_carlo::integral_monte_carlo" name="math::monte_carlo::integral_monte_carlo">
-<area shape="rect" id="Node000001" title="Compute an approximation of an integral using Monte Carlo integration." alt="" coords="5,76,147,117"/>
-<area shape="poly" id="edge6_Node000001_Node000001" title=" " alt="" coords="40,76,38,67,44,58,57,52,76,50,96,52,109,59,106,63,95,57,76,55,58,57,48,62,44,68,45,75"/>
-<area shape="rect" id="Node000002" href="$db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf" title="short&#45;hand for std::functions used in this implementation" alt="" coords="195,47,332,88"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="147,83,179,78,180,83,148,88"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="206,112,321,138"/>
-<area shape="poly" id="edge7_Node000001_Node000006" title=" " alt="" coords="148,105,191,111,190,117,147,110"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="228,47,226,37,232,28,244,23,263,21,284,23,296,29,294,34,282,28,263,26,246,28,235,32,231,38,233,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="423,5,491,31"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="332,47,408,28,409,33,333,53"/>
-<area shape="rect" id="Node000004" 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="380,55,534,80"/>
-<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="333,65,365,65,365,70,333,70"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/reserve.html#" title=" " alt="" coords="390,104,524,130"/>
-<area shape="poly" id="edge5_Node000002_Node000005" title=" " alt="" coords="333,82,390,97,389,102,332,88"/>
-</map>
diff --git a/db/d40/integral__approximation2_8cpp_af7da9ba8932f1f48b9bbc2d80471af51_cgraph.md5 b/db/d40/integral__approximation2_8cpp_af7da9ba8932f1f48b9bbc2d80471af51_cgraph.md5
deleted file mode 100644
index 38a10defe..000000000
--- a/db/d40/integral__approximation2_8cpp_af7da9ba8932f1f48b9bbc2d80471af51_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0483166e6298ee719c0e4bfa270c14d8
\ No newline at end of file
diff --git a/db/d40/integral__approximation2_8cpp_af7da9ba8932f1f48b9bbc2d80471af51_cgraph.svg b/db/d40/integral__approximation2_8cpp_af7da9ba8932f1f48b9bbc2d80471af51_cgraph.svg
deleted file mode 100644
index c77597fef..000000000
--- a/db/d40/integral__approximation2_8cpp_af7da9ba8932f1f48b9bbc2d80471af51_cgraph.svg
+++ /dev/null
@@ -1,157 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::monte_carlo::integral_monte_carlo Pages: 1 -->
-<svg width="405pt" height="107pt"
- viewBox="0.00 0.00 404.75 107.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 103.25)">
-<title>math::monte_carlo::integral_monte_carlo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compute an approximation of an integral using Monte Carlo integration.">
-<polygon fill="#999999" stroke="#666666" points="106,-45.88 0,-45.88 0,-15.37 106,-15.37 106,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::monte_carlo::</text>
-<text text-anchor="middle" x="53" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">integral_monte_carlo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge6_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge6_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.1,-46.36C23.02,-55.43 31.32,-63.88 53,-63.88 64.86,-63.88 72.71,-61.35 76.56,-57.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.01,-58.21 77.72,-47.86 73.06,-57.38 80.01,-58.21"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf" target="_top" xlink:title="short&#45;hand for std::functions used in this implementation">
-<polygon fill="white" stroke="#666666" points="245,-67.88 142,-67.88 142,-37.38 245,-37.38 245,-67.88"/>
-<text text-anchor="start" x="150" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::monte_carlo::</text>
-<text text-anchor="middle" x="193.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">generate_samples</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.36,-38.94C114.27,-40.2 122.5,-41.51 130.59,-42.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.98,-46.24 140.4,-44.35 131.08,-39.32 129.98,-46.24"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-19.25 150.25,-19.25 150.25,0 236.75,0 236.75,-19.25"/>
-<text text-anchor="middle" x="193.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.36,-22.69C116.94,-21.08 128.07,-19.39 138.7,-17.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.12,-21.26 148.48,-16.3 138.07,-14.34 139.12,-21.26"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M168.6,-68.36C163.52,-77.43 171.82,-85.88 193.5,-85.88 205.36,-85.88 213.21,-83.35 217.06,-79.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.51,-80.21 218.22,-69.86 213.56,-79.38 220.51,-80.21"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="364.5,-99.25 313.25,-99.25 313.25,-80 364.5,-80 364.5,-99.25"/>
-<text text-anchor="middle" x="338.88" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.45,-65.77C264.2,-70.61 285.03,-75.99 302.15,-80.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.79,-83.67 311.35,-82.78 302.54,-76.89 300.79,-83.67"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="396.75,-62.25 281,-62.25 281,-43 396.75,-43 396.75,-62.25"/>
-<text text-anchor="middle" x="338.88" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.45,-52.62C253.22,-52.62 261.34,-52.62 269.41,-52.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.23,-56.13 279.23,-52.63 269.23,-49.13 269.23,-56.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/reserve.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="389.25,-25.25 288.5,-25.25 288.5,-6 389.25,-6 389.25,-25.25"/>
-<text text-anchor="middle" x="338.88" y="-11.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::reserve</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.45,-39.48C259.3,-35.9 274.27,-32.04 288.05,-28.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.53,-31.97 297.34,-26.09 286.78,-25.2 288.53,-31.97"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d40/integral__approximation2_8cpp_af7da9ba8932f1f48b9bbc2d80471af51_cgraph_org.svg b/db/d40/integral__approximation2_8cpp_af7da9ba8932f1f48b9bbc2d80471af51_cgraph_org.svg
deleted file mode 100644
index a1328e500..000000000
--- a/db/d40/integral__approximation2_8cpp_af7da9ba8932f1f48b9bbc2d80471af51_cgraph_org.svg
+++ /dev/null
@@ -1,131 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::monte_carlo::integral_monte_carlo Pages: 1 -->
-<svg width="405pt" height="107pt"
- viewBox="0.00 0.00 404.75 107.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 103.25)">
-<title>math::monte_carlo::integral_monte_carlo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compute an approximation of an integral using Monte Carlo integration.">
-<polygon fill="#999999" stroke="#666666" points="106,-45.88 0,-45.88 0,-15.37 106,-15.37 106,-45.88"/>
-<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::monte_carlo::</text>
-<text text-anchor="middle" x="53" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">integral_monte_carlo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge6_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge6_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.1,-46.36C23.02,-55.43 31.32,-63.88 53,-63.88 64.86,-63.88 72.71,-61.35 76.56,-57.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.01,-58.21 77.72,-47.86 73.06,-57.38 80.01,-58.21"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf" target="_top" xlink:title="short&#45;hand for std::functions used in this implementation">
-<polygon fill="white" stroke="#666666" points="245,-67.88 142,-67.88 142,-37.38 245,-37.38 245,-67.88"/>
-<text text-anchor="start" x="150" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">math::monte_carlo::</text>
-<text text-anchor="middle" x="193.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">generate_samples</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.36,-38.94C114.27,-40.2 122.5,-41.51 130.59,-42.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.98,-46.24 140.4,-44.35 131.08,-39.32 129.98,-46.24"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-19.25 150.25,-19.25 150.25,0 236.75,0 236.75,-19.25"/>
-<text text-anchor="middle" x="193.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.36,-22.69C116.94,-21.08 128.07,-19.39 138.7,-17.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.12,-21.26 148.48,-16.3 138.07,-14.34 139.12,-21.26"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M168.6,-68.36C163.52,-77.43 171.82,-85.88 193.5,-85.88 205.36,-85.88 213.21,-83.35 217.06,-79.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.51,-80.21 218.22,-69.86 213.56,-79.38 220.51,-80.21"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="364.5,-99.25 313.25,-99.25 313.25,-80 364.5,-80 364.5,-99.25"/>
-<text text-anchor="middle" x="338.88" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.45,-65.77C264.2,-70.61 285.03,-75.99 302.15,-80.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.79,-83.67 311.35,-82.78 302.54,-76.89 300.79,-83.67"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="396.75,-62.25 281,-62.25 281,-43 396.75,-43 396.75,-62.25"/>
-<text text-anchor="middle" x="338.88" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.45,-52.62C253.22,-52.62 261.34,-52.62 269.41,-52.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.23,-56.13 279.23,-52.63 269.23,-49.13 269.23,-56.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/reserve.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="389.25,-25.25 288.5,-25.25 288.5,-6 389.25,-6 389.25,-25.25"/>
-<text text-anchor="middle" x="338.88" y="-11.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::reserve</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.45,-39.48C259.3,-35.9 274.27,-32.04 288.05,-28.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.53,-31.97 297.34,-26.09 286.78,-25.2 288.53,-31.97"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d40/integral__approximation2_8cpp_source.html b/db/d40/integral__approximation2_8cpp_source.html
new file mode 100644
index 000000000..fecbd878f
--- /dev/null
+++ b/db/d40/integral__approximation2_8cpp_source.html
@@ -0,0 +1,300 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/integral_approximation2.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/d40/integral__approximation2_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">integral_approximation2.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../db/d40/integral__approximation2_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#define _USE_MATH_DEFINES  </span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;cmath&gt;</span>           </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;cstdint&gt;</span>         </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;ctime&gt;</span>           </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;functional&gt;</span>      </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;iostream&gt;</span>        </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;random&gt;</span>          </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;vector&gt;</span>          </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/da4/namespacemonte__carlo.html">monte_carlo</a> {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="keyword">using </span>Function = std::function&lt;double(</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordtype">double</span>&amp;)&gt;;  </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="foldopen" id="foldopen00064" data-start="{" data-end="}">
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf">   64</a></span>std::vector&lt;double&gt; <a class="code hl_function" href="../../db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf">generate_samples</a>(<span class="keyword">const</span> <span class="keywordtype">double</span>&amp; start_point,</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>                                     <span class="keyword">const</span> Function&amp; pdf,</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>                                     <span class="keyword">const</span> uint32_t&amp; num_samples,</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>                                     <span class="keyword">const</span> uint32_t&amp; discard = 100000) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    std::vector&lt;double&gt; samples;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    samples.reserve(num_samples);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordtype">double</span> x_t = start_point;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    std::default_random_engine generator;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    std::uniform_real_distribution&lt;double&gt; uniform(0.0, 1.0);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    std::normal_distribution&lt;double&gt; normal(0.0, 1.0);</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    generator.seed(time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordflow">for</span> (uint32_t t = 0; t &lt; num_samples + discard; ++t) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        <span class="comment">// Generate a new proposal according to some mutation strategy.</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="comment">// This is arbitrary and can be swapped.</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <span class="keywordtype">double</span> x_dash = normal(generator) + x_t;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <span class="keywordtype">double</span> acceptance_probability = std::min(pdf(x_dash) / pdf(x_t), 1.0);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordtype">double</span> u = uniform(generator);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        <span class="comment">// Accept &quot;new state&quot; according to the acceptance_probability</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        <span class="keywordflow">if</span> (u &lt;= acceptance_probability) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            x_t = x_dash;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        <span class="keywordflow">if</span> (t &gt;= discard) {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>            samples.push_back(x_t);</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        }</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    }</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keywordflow">return</span> samples;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>}</div>
+</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="foldopen" id="foldopen00112" data-start="{" data-end="}">
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"><a class="line" href="../../db/d40/integral__approximation2_8cpp.html#af7da9ba8932f1f48b9bbc2d80471af51">  112</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../db/d40/integral__approximation2_8cpp.html#af7da9ba8932f1f48b9bbc2d80471af51">integral_monte_carlo</a>(<span class="keyword">const</span> <span class="keywordtype">double</span>&amp; start_point, <span class="keyword">const</span> Function&amp; function,</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>                            <span class="keyword">const</span> Function&amp; pdf,</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>                            <span class="keyword">const</span> uint32_t&amp; num_samples = 1000000) {</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <span class="keywordtype">double</span> integral = 0.0;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::vector&lt;double&gt; samples =</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        <a class="code hl_function" href="../../db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf">generate_samples</a>(start_point, pdf, num_samples);</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <span class="keywordflow">for</span> (<span class="keywordtype">double</span> sample : samples) {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        integral += function(sample) / pdf(sample);</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    }</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span> </div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    <span class="keywordflow">return</span> integral / <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(samples.size());</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>}</div>
+</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>}  <span class="comment">// namespace monte_carlo</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
+<div class="foldopen" id="foldopen00133" data-start="{" data-end="}">
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"><a class="line" href="../../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  133</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Disclaimer: Because this is a randomized algorithm,&quot;</span></div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    std::cout</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        &lt;&lt; <span class="stringliteral">&quot;it may happen that singular samples deviate from the true result.&quot;</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>        &lt;&lt; std::endl</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>        &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    ;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    math::monte_carlo::Function f;</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    math::monte_carlo::Function pdf;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <span class="keywordtype">double</span> integral = 0;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <span class="keywordtype">double</span> lower_bound = 0, upper_bound = 0;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span> </div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    <span class="comment">/* \int_{-2}^{2} -x^2 + 4 dx */</span></div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    f = [&amp;](<span class="keywordtype">double</span>&amp; x) { <span class="keywordflow">return</span> -x * x + 4.0; };</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span> </div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    lower_bound = -2.0;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    upper_bound = 2.0;</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    pdf = [&amp;](<span class="keywordtype">double</span>&amp; x) {</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>        <span class="keywordflow">if</span> (x &gt;= lower_bound &amp;&amp; x &lt;= -1.0) {</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>            <span class="keywordflow">return</span> 0.1;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>        }</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>        <span class="keywordflow">if</span> (x &lt;= upper_bound &amp;&amp; x &gt;= 1.0) {</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>            <span class="keywordflow">return</span> 0.1;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>        }</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        <span class="keywordflow">if</span> (x &gt; -1.0 &amp;&amp; x &lt; 1.0) {</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>            <span class="keywordflow">return</span> 0.4;</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        }</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        <span class="keywordflow">return</span> 0.0;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    };</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span> </div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    integral = math::monte_carlo::integral_monte_carlo(</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        (upper_bound - lower_bound) / 2.0, f, pdf);</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span> </div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;This number should be close to 10.666666: &quot;</span> &lt;&lt; integral</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span> </div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    <span class="comment">/* \int_{0}^{1} e^x dx */</span></div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    f = [&amp;](<span class="keywordtype">double</span>&amp; x) { <span class="keywordflow">return</span> std::exp(x); };</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span> </div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    lower_bound = 0.0;</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    upper_bound = 1.0;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    pdf = [&amp;](<span class="keywordtype">double</span>&amp; x) {</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        <span class="keywordflow">if</span> (x &gt;= lower_bound &amp;&amp; x &lt;= 0.2) {</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>            <span class="keywordflow">return</span> 0.1;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        }</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        <span class="keywordflow">if</span> (x &gt; 0.2 &amp;&amp; x &lt;= 0.4) {</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>            <span class="keywordflow">return</span> 0.4;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>        }</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>        <span class="keywordflow">if</span> (x &gt; 0.4 &amp;&amp; x &lt; upper_bound) {</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>            <span class="keywordflow">return</span> 1.5;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        }</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        <span class="keywordflow">return</span> 0.0;</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    };</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span> </div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    integral = math::monte_carlo::integral_monte_carlo(</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>        (upper_bound - lower_bound) / 2.0, f, pdf);</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span> </div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;This number should be close to 1.7182818: &quot;</span> &lt;&lt; integral</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span> </div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    <span class="comment">/* \int_{-\infty}^{\infty} sinc(x) dx, sinc(x) = sin(pi * x) / (pi * x)</span></div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span><span class="comment">       This is a difficult integral because of its infinite domain.</span></div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span><span class="comment">       Therefore, it may deviate largely from the expected result.</span></div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span><span class="comment">    */</span></div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    f = [&amp;](<span class="keywordtype">double</span>&amp; x) { <span class="keywordflow">return</span> std::sin(M_PI * x) / (M_PI * x); };</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span> </div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    pdf = [&amp;](<span class="keywordtype">double</span>&amp; x) {</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>        <span class="keywordflow">return</span> 1.0 / std::sqrt(2.0 * M_PI) * std::exp(-x * x / 2.0);</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    };</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span> </div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    integral = math::monte_carlo::integral_monte_carlo(0.0, f, pdf, 10000000);</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span> </div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;This number should be close to 1.0: &quot;</span> &lt;&lt; integral</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>}</div>
+</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span> </div>
+<div class="foldopen" id="foldopen00215" data-start="{" data-end="}">
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"><a class="line" href="../../db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  215</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    <a class="code hl_function" href="../../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>}</div>
+</div>
+<div class="ttc" id="aintegral__approximation2_8cpp_html_a71249ee535f16f8ed2e9cc8f0199a2cf"><div class="ttname"><a href="../../db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf">math::monte_carlo::generate_samples</a></div><div class="ttdeci">std::vector&lt; double &gt; generate_samples(const double &amp;start_point, const Function &amp;pdf, const uint32_t &amp;num_samples, const uint32_t &amp;discard=100000)</div><div class="ttdoc">short-hand for std::functions used in this implementation</div><div class="ttdef"><b>Definition</b> <a href="#l00064">integral_approximation2.cpp:64</a></div></div>
+<div class="ttc" id="aintegral__approximation2_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../db/d40/integral__approximation2_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> <a href="#l00133">integral_approximation2.cpp:133</a></div></div>
+<div class="ttc" id="aintegral__approximation2_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00215">integral_approximation2.cpp:215</a></div></div>
+<div class="ttc" id="aintegral__approximation2_8cpp_html_af7da9ba8932f1f48b9bbc2d80471af51"><div class="ttname"><a href="../../db/d40/integral__approximation2_8cpp.html#af7da9ba8932f1f48b9bbc2d80471af51">math::monte_carlo::integral_monte_carlo</a></div><div class="ttdeci">double integral_monte_carlo(const double &amp;start_point, const Function &amp;function, const Function &amp;pdf, const uint32_t &amp;num_samples=1000000)</div><div class="ttdoc">Compute an approximation of an integral using Monte Carlo integration.</div><div class="ttdef"><b>Definition</b> <a href="#l00112">integral_approximation2.cpp:112</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemonte__carlo_html"><div class="ttname"><a href="../../d0/da4/namespacemonte__carlo.html">monte_carlo</a></div><div class="ttdoc">Functions for the Monte Carlo Integration implementation.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../db/d40/integral__approximation2_8cpp.html">integral_approximation2.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html
index e05df6efa..d90abd52c 100644
--- a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html
+++ b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::stack_using_queue::Stack Struct Reference</title>
+<title>TheAlgorithms/C++: data_structures::stack_using_queue::Stack Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -117,7 +134,7 @@ $(function(){initNavTree('db/d5b/structdata__structures_1_1stack__using__queue_1
 <div class="dynheader">
 Collaboration diagram for data_structures::stack_using_queue::Stack:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.svg" width="163" height="244"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/dea/structdata__structures_1_1stack__using__queue_1_1_stack__coll__graph.svg" width="163" height="155"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
@@ -136,19 +153,19 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:acf8ca54d5dd6676f255fff3dedacc7c6" id="r_acf8ca54d5dd6676f255fff3dedacc7c6"><td class="memItemLeft" align="right" valign="top"><a id="acf8ca54d5dd6676f255fff3dedacc7c6" name="acf8ca54d5dd6676f255fff3dedacc7c6"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>main_q</b></td></tr>
-<tr class="memdesc:acf8ca54d5dd6676f255fff3dedacc7c6"><td class="mdescLeft">&#160;</td><td class="mdescRight">stores the current state of the stack <br /></td></tr>
+<tr class="memitem:acf8ca54d5dd6676f255fff3dedacc7c6" id="r_acf8ca54d5dd6676f255fff3dedacc7c6"><td class="memItemLeft" align="right" valign="top">std::queue&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a></td></tr>
+<tr class="memdesc:acf8ca54d5dd6676f255fff3dedacc7c6"><td class="mdescLeft">&#160;</td><td class="mdescRight">stores the current state of the stack  <br /></td></tr>
 <tr class="separator:acf8ca54d5dd6676f255fff3dedacc7c6"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2f80f87fc6f6ded938426698bba89323" id="r_a2f80f87fc6f6ded938426698bba89323"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2f80f87fc6f6ded938426698bba89323">auxiliary_q</a></td></tr>
+<tr class="memitem:a2f80f87fc6f6ded938426698bba89323" id="r_a2f80f87fc6f6ded938426698bba89323"><td class="memItemLeft" align="right" valign="top">std::queue&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2f80f87fc6f6ded938426698bba89323">auxiliary_q</a></td></tr>
 <tr class="separator:a2f80f87fc6f6ded938426698bba89323"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:afdfd2f4418c70b1bda50f2c3e416d80b" id="r_afdfd2f4418c70b1bda50f2c3e416d80b"><td class="memItemLeft" align="right" valign="top"><a id="afdfd2f4418c70b1bda50f2c3e416d80b" name="afdfd2f4418c70b1bda50f2c3e416d80b"></a>
-uint32_t&#160;</td><td class="memItemRight" valign="bottom"><b>current_size</b> = 0</td></tr>
-<tr class="memdesc:afdfd2f4418c70b1bda50f2c3e416d80b"><td class="mdescLeft">&#160;</td><td class="mdescRight">stores the current size of the stack <br /></td></tr>
+<tr class="memitem:afdfd2f4418c70b1bda50f2c3e416d80b" id="r_afdfd2f4418c70b1bda50f2c3e416d80b"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afdfd2f4418c70b1bda50f2c3e416d80b">current_size</a> = 0</td></tr>
+<tr class="memdesc:afdfd2f4418c70b1bda50f2c3e416d80b"><td class="mdescLeft">&#160;</td><td class="mdescRight">stores the current size of the stack  <br /></td></tr>
 <tr class="separator:afdfd2f4418c70b1bda50f2c3e416d80b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a class="el" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Class implementation for basic methods of <a class="el" href="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Data Structure. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d43/stack__using__queue_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../d7/d43/stack__using__queue_8cpp_source.html">stack_using_queue.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="abdd461689df4983a3ad3b05d853cf5eb" name="abdd461689df4983a3ad3b05d853cf5eb"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#abdd461689df4983a3ad3b05d853cf5eb">&#9670;&#160;</a></span>pop()</h2>
@@ -175,23 +192,18 @@ uint32_t&#160;</td><td class="memItemRight" valign="bottom"><b>current_size</b>
 
 <p>Removes the topmost element from the stack. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d43/stack__using__queue_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../d7/d43/stack__using__queue_8cpp_source.html">stack_using_queue.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>               {</div>
-<div class="line"><span class="lineno">   63</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/empty.html">empty</a>()) {</div>
+<div class="line"><span class="lineno">   63</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>.empty()) {</div>
 <div class="line"><span class="lineno">   64</span>            <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">   65</span>        }</div>
-<div class="line"><span class="lineno">   66</span>        <a class="code hl_variable" href="#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/pop.html">pop</a>();</div>
+<div class="line"><span class="lineno">   66</span>        <a class="code hl_variable" href="#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>.pop();</div>
 <div class="line"><span class="lineno">   67</span>        <a class="code hl_variable" href="#afdfd2f4418c70b1bda50f2c3e416d80b">current_size</a>--;</div>
 <div class="line"><span class="lineno">   68</span>    }</div>
-<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/empty.html">std::queue::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
-<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/pop.html">std::queue::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
-<div class="ttc" id="astructdata__structures_1_1stack__using__queue_1_1_stack_html_acf8ca54d5dd6676f255fff3dedacc7c6"><div class="ttname"><a href="#acf8ca54d5dd6676f255fff3dedacc7c6">data_structures::stack_using_queue::Stack::main_q</a></div><div class="ttdeci">std::queue&lt; int64_t &gt; main_q</div><div class="ttdoc">stores the current state of the stack</div><div class="ttdef"><b>Definition</b> stack_using_queue.cpp:32</div></div>
-<div class="ttc" id="astructdata__structures_1_1stack__using__queue_1_1_stack_html_afdfd2f4418c70b1bda50f2c3e416d80b"><div class="ttname"><a href="#afdfd2f4418c70b1bda50f2c3e416d80b">data_structures::stack_using_queue::Stack::current_size</a></div><div class="ttdeci">uint32_t current_size</div><div class="ttdoc">stores the current size of the stack</div><div class="ttdef"><b>Definition</b> stack_using_queue.cpp:35</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_abdd461689df4983a3ad3b05d853cf5eb_cgraph.svg" width="358" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astructdata__structures_1_1stack__using__queue_1_1_stack_html_acf8ca54d5dd6676f255fff3dedacc7c6"><div class="ttname"><a href="#acf8ca54d5dd6676f255fff3dedacc7c6">data_structures::stack_using_queue::Stack::main_q</a></div><div class="ttdeci">std::queue&lt; int64_t &gt; main_q</div><div class="ttdoc">stores the current state of the stack</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d43/stack__using__queue_8cpp_source.html#l00032">stack_using_queue.cpp:32</a></div></div>
+<div class="ttc" id="astructdata__structures_1_1stack__using__queue_1_1_stack_html_afdfd2f4418c70b1bda50f2c3e416d80b"><div class="ttname"><a href="#afdfd2f4418c70b1bda50f2c3e416d80b">data_structures::stack_using_queue::Stack::current_size</a></div><div class="ttdeci">uint32_t current_size</div><div class="ttdoc">stores the current size of the stack</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d43/stack__using__queue_8cpp_source.html#l00035">stack_using_queue.cpp:35</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af04a8f3536a52d8c9916086b656eefc2" name="af04a8f3536a52d8c9916086b656eefc2"></a>
@@ -225,25 +237,19 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d43/stack__using__queue_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../d7/d43/stack__using__queue_8cpp_source.html">stack_using_queue.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   48</span>                       {</div>
-<div class="line"><span class="lineno">   49</span>        <a class="code hl_variable" href="#a2f80f87fc6f6ded938426698bba89323">auxiliary_q</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(val);</div>
-<div class="line"><span class="lineno">   50</span>        <span class="keywordflow">while</span> (!<a class="code hl_variable" href="#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/empty.html">empty</a>()) {</div>
-<div class="line"><span class="lineno">   51</span>            <a class="code hl_variable" href="#a2f80f87fc6f6ded938426698bba89323">auxiliary_q</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(<a class="code hl_variable" href="#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/front.html">front</a>());</div>
-<div class="line"><span class="lineno">   52</span>            <a class="code hl_variable" href="#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/pop.html">pop</a>();</div>
+<div class="line"><span class="lineno">   49</span>        <a class="code hl_variable" href="#a2f80f87fc6f6ded938426698bba89323">auxiliary_q</a>.push(val);</div>
+<div class="line"><span class="lineno">   50</span>        <span class="keywordflow">while</span> (!<a class="code hl_variable" href="#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>.empty()) {</div>
+<div class="line"><span class="lineno">   51</span>            <a class="code hl_variable" href="#a2f80f87fc6f6ded938426698bba89323">auxiliary_q</a>.push(<a class="code hl_variable" href="#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>.front());</div>
+<div class="line"><span class="lineno">   52</span>            <a class="code hl_variable" href="#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>.pop();</div>
 <div class="line"><span class="lineno">   53</span>        }</div>
-<div class="line"><span class="lineno">   54</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">swap</a>(<a class="code hl_variable" href="#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>, <a class="code hl_variable" href="#a2f80f87fc6f6ded938426698bba89323">auxiliary_q</a>);</div>
+<div class="line"><span class="lineno">   54</span>        swap(<a class="code hl_variable" href="#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>, <a class="code hl_variable" href="#a2f80f87fc6f6ded938426698bba89323">auxiliary_q</a>);</div>
 <div class="line"><span class="lineno">   55</span>        <a class="code hl_variable" href="#afdfd2f4418c70b1bda50f2c3e416d80b">current_size</a>++;</div>
 <div class="line"><span class="lineno">   56</span>    }</div>
-<div class="ttc" id="afront_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/front.html">std::queue::front</a></div><div class="ttdeci">T front(T... args)</div></div>
-<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/push.html">std::queue::push</a></div><div class="ttdeci">T push(T... args)</div></div>
-<div class="ttc" id="astructdata__structures_1_1stack__using__queue_1_1_stack_html_a2f80f87fc6f6ded938426698bba89323"><div class="ttname"><a href="#a2f80f87fc6f6ded938426698bba89323">data_structures::stack_using_queue::Stack::auxiliary_q</a></div><div class="ttdeci">std::queue&lt; int64_t &gt; auxiliary_q</div><div class="ttdef"><b>Definition</b> stack_using_queue.cpp:33</div></div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- 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="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_af04a8f3536a52d8c9916086b656eefc2_cgraph.svg" width="364" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astructdata__structures_1_1stack__using__queue_1_1_stack_html_a2f80f87fc6f6ded938426698bba89323"><div class="ttname"><a href="#a2f80f87fc6f6ded938426698bba89323">data_structures::stack_using_queue::Stack::auxiliary_q</a></div><div class="ttdeci">std::queue&lt; int64_t &gt; auxiliary_q</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d43/stack__using__queue_8cpp_source.html#l00033">stack_using_queue.cpp:33</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac0ddec9ab8f778dad23ec446d7a77b39" name="ac0ddec9ab8f778dad23ec446d7a77b39"></a>
@@ -271,6 +277,8 @@ Here is the call graph for this function:</div>
 
 <p>Utility function to return the current size of the stack. </p>
 <dl class="section return"><dt>Returns</dt><dd>current size of stack </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d43/stack__using__queue_8cpp_source.html#l00074">74</a> of file <a class="el" href="../../d7/d43/stack__using__queue_8cpp_source.html">stack_using_queue.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   74</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#afdfd2f4418c70b1bda50f2c3e416d80b">current_size</a>; }</div>
 </div><!-- fragment -->
 </div>
@@ -298,13 +306,10 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Returns the top most element of the stack </p><dl class="section return"><dt>Returns</dt><dd>top element of the queue </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   41</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/front.html">front</a>(); }</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="../../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_a5540434e1b41245205eee86f664906f7_cgraph.svg" width="344" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d7/d43/stack__using__queue_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../d7/d43/stack__using__queue_8cpp_source.html">stack_using_queue.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   41</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#acf8ca54d5dd6676f255fff3dedacc7c6">main_q</a>.front(); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
@@ -315,16 +320,54 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a>&lt;int64_t&gt; data_structures::stack_using_queue::Stack::auxiliary_q</td>
+          <td class="memname">std::queue&lt;int64_t&gt; data_structures::stack_using_queue::Stack::auxiliary_q</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>used to carry out intermediate operations to implement stack </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d7/d43/stack__using__queue_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../d7/d43/stack__using__queue_8cpp_source.html">stack_using_queue.cpp</a>.</p>
+
+</div>
+</div>
+<a id="afdfd2f4418c70b1bda50f2c3e416d80b" name="afdfd2f4418c70b1bda50f2c3e416d80b"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#afdfd2f4418c70b1bda50f2c3e416d80b">&#9670;&#160;</a></span>current_size</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">uint32_t data_structures::stack_using_queue::Stack::current_size = 0</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>stores the current size of the stack </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d43/stack__using__queue_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../d7/d43/stack__using__queue_8cpp_source.html">stack_using_queue.cpp</a>.</p>
+
+</div>
+</div>
+<a id="acf8ca54d5dd6676f255fff3dedacc7c6" name="acf8ca54d5dd6676f255fff3dedacc7c6"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#acf8ca54d5dd6676f255fff3dedacc7c6">&#9670;&#160;</a></span>main_q</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::queue&lt;int64_t&gt; data_structures::stack_using_queue::Stack::main_q</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>stores the current state of the stack </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d43/stack__using__queue_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../d7/d43/stack__using__queue_8cpp_source.html">stack_using_queue.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>data_structures/<b>stack_using_queue.cpp</b></li>
+<li>data_structures/<a class="el" href="../../d7/d43/stack__using__queue_8cpp_source.html">stack_using_queue.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_a5540434e1b41245205eee86f664906f7_cgraph.map b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_a5540434e1b41245205eee86f664906f7_cgraph.map
deleted file mode 100644
index 5eb6712f1..000000000
--- a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_a5540434e1b41245205eee86f664906f7_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="data_structures::stack_using_queue::Stack::top" name="data_structures::stack_using_queue::Stack::top">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,175,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/front.html#" title=" " alt="" coords="223,13,339,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="175,23,207,23,207,28,175,28"/>
-</map>
diff --git a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_a5540434e1b41245205eee86f664906f7_cgraph.md5 b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_a5540434e1b41245205eee86f664906f7_cgraph.md5
deleted file mode 100644
index 2d7418b63..000000000
--- a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_a5540434e1b41245205eee86f664906f7_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b68e250986a42b2152ab3bae5043d846
\ No newline at end of file
diff --git a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_a5540434e1b41245205eee86f664906f7_cgraph.svg b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_a5540434e1b41245205eee86f664906f7_cgraph.svg
deleted file mode 100644
index 1ac120b05..000000000
--- a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_a5540434e1b41245205eee86f664906f7_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::stack_using_queue::Stack::top Pages: 1 -->
-<svg width="258pt" height="39pt"
- viewBox="0.00 0.00 258.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::stack_using_queue::Stack::top</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-30.5 0,-30.5 0,0 127,0 127,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::stack</text>
-<text text-anchor="middle" x="63.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_using_queue::Stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="250.25,-24.88 163,-24.88 163,-5.63 250.25,-5.63 250.25,-24.88"/>
-<text text-anchor="middle" x="206.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.22,-15.25C135.23,-15.25 143.38,-15.25 151.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.01,-18.75 161.01,-15.25 151.01,-11.75 151.01,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_a5540434e1b41245205eee86f664906f7_cgraph_org.svg b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_a5540434e1b41245205eee86f664906f7_cgraph_org.svg
deleted file mode 100644
index eeb96e0bd..000000000
--- a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_a5540434e1b41245205eee86f664906f7_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::stack_using_queue::Stack::top Pages: 1 -->
-<svg width="258pt" height="39pt"
- viewBox="0.00 0.00 258.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>data_structures::stack_using_queue::Stack::top</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127,-30.5 0,-30.5 0,0 127,0 127,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::stack</text>
-<text text-anchor="middle" x="63.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_using_queue::Stack::top</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="250.25,-24.88 163,-24.88 163,-5.63 250.25,-5.63 250.25,-24.88"/>
-<text text-anchor="middle" x="206.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.22,-15.25C135.23,-15.25 143.38,-15.25 151.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.01,-18.75 161.01,-15.25 151.01,-11.75 151.01,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_abdd461689df4983a3ad3b05d853cf5eb_cgraph.map b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_abdd461689df4983a3ad3b05d853cf5eb_cgraph.map
deleted file mode 100644
index f6c95915c..000000000
--- a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_abdd461689df4983a3ad3b05d853cf5eb_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="data_structures::stack_using_queue::Stack::pop" name="data_structures::stack_using_queue::Stack::pop">
-<area shape="rect" id="Node000001" title="Removes the topmost element from the stack." alt="" coords="5,23,178,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/empty.html#" title=" " alt="" coords="226,5,352,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="178,30,210,26,210,31,179,35"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/pop.html#" title=" " alt="" coords="233,55,344,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="179,51,218,56,217,62,178,57"/>
-</map>
diff --git a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_abdd461689df4983a3ad3b05d853cf5eb_cgraph.md5 b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_abdd461689df4983a3ad3b05d853cf5eb_cgraph.md5
deleted file mode 100644
index c658d3ce4..000000000
--- a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_abdd461689df4983a3ad3b05d853cf5eb_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-63f182dc7bc5944d594bac16a59bedfc
\ No newline at end of file
diff --git a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_abdd461689df4983a3ad3b05d853cf5eb_cgraph.svg b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_abdd461689df4983a3ad3b05d853cf5eb_cgraph.svg
deleted file mode 100644
index 67e856582..000000000
--- a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_abdd461689df4983a3ad3b05d853cf5eb_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::stack_using_queue::Stack::pop Pages: 1 -->
-<svg width="268pt" height="64pt"
- viewBox="0.00 0.00 268.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>data_structures::stack_using_queue::Stack::pop</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Removes the topmost element from the stack.">
-<polygon fill="#999999" stroke="#666666" points="129.25,-42.88 0,-42.88 0,-12.37 129.25,-12.37 129.25,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::stack</text>
-<text text-anchor="middle" x="64.62" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_using_queue::Stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260,-56.25 165.25,-56.25 165.25,-37 260,-37 260,-56.25"/>
-<text text-anchor="middle" x="212.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.66,-35.96C137.59,-36.99 145.66,-38.04 153.49,-39.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.88,-42.51 163.25,-40.33 153.79,-35.57 152.88,-42.51"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.38,-19.25 170.88,-19.25 170.88,0 254.38,0 254.38,-19.25"/>
-<text text-anchor="middle" x="212.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.66,-19.73C139.58,-18.51 149.71,-17.26 159.33,-16.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.75,-19.55 169.25,-14.85 158.89,-12.6 159.75,-19.55"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_abdd461689df4983a3ad3b05d853cf5eb_cgraph_org.svg b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_abdd461689df4983a3ad3b05d853cf5eb_cgraph_org.svg
deleted file mode 100644
index df49f0e03..000000000
--- a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_abdd461689df4983a3ad3b05d853cf5eb_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::stack_using_queue::Stack::pop Pages: 1 -->
-<svg width="268pt" height="64pt"
- viewBox="0.00 0.00 268.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>data_structures::stack_using_queue::Stack::pop</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Removes the topmost element from the stack.">
-<polygon fill="#999999" stroke="#666666" points="129.25,-42.88 0,-42.88 0,-12.37 129.25,-12.37 129.25,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::stack</text>
-<text text-anchor="middle" x="64.62" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_using_queue::Stack::pop</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260,-56.25 165.25,-56.25 165.25,-37 260,-37 260,-56.25"/>
-<text text-anchor="middle" x="212.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.66,-35.96C137.59,-36.99 145.66,-38.04 153.49,-39.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.88,-42.51 163.25,-40.33 153.79,-35.57 152.88,-42.51"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.38,-19.25 170.88,-19.25 170.88,0 254.38,0 254.38,-19.25"/>
-<text text-anchor="middle" x="212.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.66,-19.73C139.58,-18.51 149.71,-17.26 159.33,-16.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.75,-19.55 169.25,-14.85 158.89,-12.6 159.75,-19.55"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_af04a8f3536a52d8c9916086b656eefc2_cgraph.map b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_af04a8f3536a52d8c9916086b656eefc2_cgraph.map
deleted file mode 100644
index c712febed..000000000
--- a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_af04a8f3536a52d8c9916086b656eefc2_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="data_structures::stack_using_queue::Stack::push" name="data_structures::stack_using_queue::Stack::push">
-<area shape="rect" id="Node000001" title="Inserts an element to the top of the stack." alt="" coords="5,72,185,113"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/empty.html#" title=" " alt="" coords="233,5,359,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="151,69,244,34,246,39,153,74"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/front.html#" title=" " alt="" coords="238,55,354,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="185,79,222,74,223,79,185,84"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/pop.html#" title=" " alt="" coords="240,104,352,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="185,101,226,106,225,111,185,106"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/push.html#" title=" " alt="" coords="237,153,355,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="154,111,245,145,243,150,152,116"/>
-</map>
diff --git a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_af04a8f3536a52d8c9916086b656eefc2_cgraph.md5 b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_af04a8f3536a52d8c9916086b656eefc2_cgraph.md5
deleted file mode 100644
index 5ef981c30..000000000
--- a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_af04a8f3536a52d8c9916086b656eefc2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cc8bb8efb3ddbc23ab8df81cc7854e37
\ No newline at end of file
diff --git a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_af04a8f3536a52d8c9916086b656eefc2_cgraph.svg b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_af04a8f3536a52d8c9916086b656eefc2_cgraph.svg
deleted file mode 100644
index af3d8d9ef..000000000
--- a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_af04a8f3536a52d8c9916086b656eefc2_cgraph.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::stack_using_queue::Stack::push Pages: 1 -->
-<svg width="273pt" height="138pt"
- viewBox="0.00 0.00 273.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>data_structures::stack_using_queue::Stack::push</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Inserts an element to the top of the stack.">
-<polygon fill="#999999" stroke="#666666" points="134.5,-79.88 0,-79.88 0,-49.38 134.5,-49.38 134.5,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::stack</text>
-<text text-anchor="middle" x="67.25" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">_using_queue::Stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="265.25,-130.25 170.5,-130.25 170.5,-111 265.25,-111 265.25,-130.25"/>
-<text text-anchor="middle" x="217.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.05,-80.37C131.98,-88.64 158.62,-98.68 179.81,-106.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.34,-109.84 188.93,-110.09 180.8,-103.29 178.34,-109.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="261.5,-93.25 174.25,-93.25 174.25,-74 261.5,-74 261.5,-93.25"/>
-<text text-anchor="middle" x="217.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.74,-73.12C144.08,-74.32 153.6,-75.54 162.68,-76.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.04,-80.14 172.4,-77.94 162.93,-73.2 162.04,-80.14"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.62,-56.25 176.12,-56.25 176.12,-37 259.62,-37 259.62,-56.25"/>
-<text text-anchor="middle" x="217.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.74,-56.57C144.85,-55.35 155.15,-54.1 164.9,-52.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.02,-56.43 174.52,-51.75 164.18,-49.48 165.02,-56.43"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.25,-19.25 173.5,-19.25 173.5,0 262.25,0 262.25,-19.25"/>
-<text text-anchor="middle" x="217.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.44,-49.01C131.98,-41.04 157.96,-31.43 178.87,-23.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.01,-27 188.17,-20.25 177.58,-20.43 180.01,-27"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_af04a8f3536a52d8c9916086b656eefc2_cgraph_org.svg b/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_af04a8f3536a52d8c9916086b656eefc2_cgraph_org.svg
deleted file mode 100644
index 237110b67..000000000
--- a/db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack_af04a8f3536a52d8c9916086b656eefc2_cgraph_org.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::stack_using_queue::Stack::push Pages: 1 -->
-<svg width="273pt" height="138pt"
- viewBox="0.00 0.00 273.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>data_structures::stack_using_queue::Stack::push</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Inserts an element to the top of the stack.">
-<polygon fill="#999999" stroke="#666666" points="134.5,-79.88 0,-79.88 0,-49.38 134.5,-49.38 134.5,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::stack</text>
-<text text-anchor="middle" x="67.25" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">_using_queue::Stack::push</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="265.25,-130.25 170.5,-130.25 170.5,-111 265.25,-111 265.25,-130.25"/>
-<text text-anchor="middle" x="217.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.05,-80.37C131.98,-88.64 158.62,-98.68 179.81,-106.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.34,-109.84 188.93,-110.09 180.8,-103.29 178.34,-109.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="261.5,-93.25 174.25,-93.25 174.25,-74 261.5,-74 261.5,-93.25"/>
-<text text-anchor="middle" x="217.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.74,-73.12C144.08,-74.32 153.6,-75.54 162.68,-76.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.04,-80.14 172.4,-77.94 162.93,-73.2 162.04,-80.14"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.62,-56.25 176.12,-56.25 176.12,-37 259.62,-37 259.62,-56.25"/>
-<text text-anchor="middle" x="217.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.74,-56.57C144.85,-55.35 155.15,-54.1 164.9,-52.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.02,-56.43 174.52,-51.75 164.18,-49.48 165.02,-56.43"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.25,-19.25 173.5,-19.25 173.5,0 262.25,0 262.25,-19.25"/>
-<text text-anchor="middle" x="217.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.44,-49.01C131.98,-41.04 157.96,-31.43 178.87,-23.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.01,-27 188.17,-20.25 177.58,-20.43 180.01,-27"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d62/class_easter_year_month_day-members.html b/db/d62/class_easter_year_month_day-members.html
index 88b7e7f82..81459a566 100644
--- a/db/d62/class_easter_year_month_day-members.html
+++ b/db/d62/class_easter_year_month_day-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.map b/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.map
index 9fe7ce4e4..3b30a0950 100644
--- a/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.map
+++ b/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.map
@@ -1,7 +1,5 @@
 <map id="math::ncr_modulo_p::NCRModuloP" name="math::ncr_modulo_p::NCRModuloP">
-<area shape="rect" id="Node000001" title="Class which contains all methods required for calculating nCr mod p." alt="" coords="9,183,148,223"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="5,94,152,120"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="81,135,81,182,76,182,76,135"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="35,5,122,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="81,47,81,94,76,94,76,47"/>
+<area shape="rect" id="Node000001" title="Class which contains all methods required for calculating nCr mod p." alt="" coords="9,94,148,135"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,5,152,31"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="81,46,81,93,76,93,76,46"/>
 </map>
diff --git a/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.md5 b/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.md5
index dd23966a2..0d27973da 100644
--- a/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.md5
+++ b/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.md5
@@ -1 +1 @@
-a4f915c326bfb68f957e0df8cc1226e7
\ No newline at end of file
+a7f650c577dde9d58c7239a706f0ce3c
\ No newline at end of file
diff --git a/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.svg b/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.svg
index d9de30083..cd1a99965 100644
--- a/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.svg
+++ b/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.svg
@@ -4,8 +4,8 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: math::ncr_modulo_p::NCRModuloP Pages: 1 -->
-<svg width="118pt" height="172pt"
- viewBox="0.00 0.00 117.75 171.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="118pt" height="105pt"
+ viewBox="0.00 0.00 117.75 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
 <svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
@@ -17,7 +17,7 @@
 ]]></style>
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
 <svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 167.5)">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 101)">
 <title>math::ncr_modulo_p::NCRModuloP</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="109.75,-97 0,-97 0,-77.75 109.75,-77.75 109.75,-97"/>
 <text text-anchor="middle" x="54.88" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int64_t &gt;</text>
 </a>
@@ -48,25 +48,6 @@
 </g>
 <text text-anchor="middle" x="63.12" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> fac</text>
 </g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="87.25,-163.5 22.5,-163.5 22.5,-144.25 87.25,-144.25 87.25,-163.5"/>
-<text text-anchor="middle" x="54.88" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">std::int64_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M54.88,-132.4C54.88,-120.57 54.88,-106.29 54.88,-97.27"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="51.38,-132.39 54.88,-142.39 58.38,-132.39 51.38,-132.39"/>
-</a>
-</g>
-<text text-anchor="middle" x="76.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
 </g>
 </svg>
 </svg>
diff --git a/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph_org.svg b/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph_org.svg
index 5c2bf6d7b..b676f1517 100644
--- a/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph_org.svg
+++ b/db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph_org.svg
@@ -4,9 +4,9 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: math::ncr_modulo_p::NCRModuloP Pages: 1 -->
-<svg width="118pt" height="172pt"
- viewBox="0.00 0.00 117.75 171.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 167.5)">
+<svg width="118pt" height="105pt"
+ viewBox="0.00 0.00 117.75 105.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 101)">
 <title>math::ncr_modulo_p::NCRModuloP</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="109.75,-97 0,-97 0,-77.75 109.75,-77.75 109.75,-97"/>
 <text text-anchor="middle" x="54.88" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int64_t &gt;</text>
 </a>
@@ -37,24 +37,5 @@
 </g>
 <text text-anchor="middle" x="63.12" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> fac</text>
 </g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="87.25,-163.5 22.5,-163.5 22.5,-144.25 87.25,-144.25 87.25,-163.5"/>
-<text text-anchor="middle" x="54.88" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">std::int64_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M54.88,-132.4C54.88,-120.57 54.88,-106.29 54.88,-97.27"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="51.38,-132.39 54.88,-142.39 58.38,-132.39 51.38,-132.39"/>
-</a>
-</g>
-<text text-anchor="middle" x="76.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
 </g>
 </svg>
diff --git a/db/d66/struct_item.html b/db/d66/struct_item.html
index 4884cecb3..800540f2e 100644
--- a/db/d66/struct_item.html
+++ b/db/d66/struct_item.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Item Struct Reference</title>
+<title>TheAlgorithms/C++: Item Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -113,15 +130,49 @@ $(function(){initNavTree('db/d66/struct_item.html','../../'); initResizable(true
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a05e743552459fc8c2abdc80a0f4f0b0a" id="r_a05e743552459fc8c2abdc80a0f4f0b0a"><td class="memItemLeft" align="right" valign="top"><a id="a05e743552459fc8c2abdc80a0f4f0b0a" name="a05e743552459fc8c2abdc80a0f4f0b0a"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>weight</b></td></tr>
+<tr class="memitem:a05e743552459fc8c2abdc80a0f4f0b0a" id="r_a05e743552459fc8c2abdc80a0f4f0b0a"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a05e743552459fc8c2abdc80a0f4f0b0a">weight</a></td></tr>
 <tr class="separator:a05e743552459fc8c2abdc80a0f4f0b0a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a62e6c5a24f2618be18e46407857c98de" id="r_a62e6c5a24f2618be18e46407857c98de"><td class="memItemLeft" align="right" valign="top"><a id="a62e6c5a24f2618be18e46407857c98de" name="a62e6c5a24f2618be18e46407857c98de"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>profit</b></td></tr>
+<tr class="memitem:a62e6c5a24f2618be18e46407857c98de" id="r_a62e6c5a24f2618be18e46407857c98de"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a62e6c5a24f2618be18e46407857c98de">profit</a></td></tr>
 <tr class="separator:a62e6c5a24f2618be18e46407857c98de"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../d0/d61/knapsack_8cpp_source.html#l00004">4</a> of file <a class="el" href="../../d0/d61/knapsack_8cpp_source.html">knapsack.cpp</a>.</p>
+</div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="a62e6c5a24f2618be18e46407857c98de" name="a62e6c5a24f2618be18e46407857c98de"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a62e6c5a24f2618be18e46407857c98de">&#9670;&#160;</a></span>profit</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int Item::profit</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d61/knapsack_8cpp_source.html#l00006">6</a> of file <a class="el" href="../../d0/d61/knapsack_8cpp_source.html">knapsack.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a05e743552459fc8c2abdc80a0f4f0b0a" name="a05e743552459fc8c2abdc80a0f4f0b0a"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a05e743552459fc8c2abdc80a0f4f0b0a">&#9670;&#160;</a></span>weight</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int Item::weight</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d61/knapsack_8cpp_source.html#l00005">5</a> of file <a class="el" href="../../d0/d61/knapsack_8cpp_source.html">knapsack.cpp</a>.</p>
+
+</div>
+</div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>greedy_algorithms/<b>knapsack.cpp</b></li>
+<li>greedy_algorithms/<a class="el" href="../../d0/d61/knapsack_8cpp_source.html">knapsack.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.map b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.map
index 395f85cd7..310a4980d 100644
--- a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.map
+++ b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.map
@@ -1,6 +1,4 @@
 <map id="others::recursive_tree_traversals::Node" name="others::recursive_tree_traversals::Node">
-<area shape="rect" id="Node000001" title="The structure to hold Nodes of the tree." alt="" coords="5,94,153,135"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="170,105,179,114,171,123,154,126,153,121,169,118,174,114,166,110"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="32,5,126,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="82,46,82,93,76,93,76,46"/>
+<area shape="rect" id="Node000001" title="The structure to hold Nodes of the tree." alt="" coords="5,5,153,46"/>
+<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="169,18,179,26,171,33,153,36,153,30,169,28,174,26,167,23"/>
 </map>
diff --git a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.md5 b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.md5
index 54ad8b67b..ad24b7c0e 100644
--- a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.md5
+++ b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.md5
@@ -1 +1 @@
-7fea014a1b03b545b163375d893501b6
\ No newline at end of file
+497fc4849cb44b66f75cc66ee5812524
\ No newline at end of file
diff --git a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.svg b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.svg
index a0d14f4f2..89101252d 100644
--- a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.svg
+++ b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.svg
@@ -4,8 +4,8 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: others::recursive_tree_traversals::Node Pages: 1 -->
-<svg width="155pt" height="105pt"
- viewBox="0.00 0.00 155.25 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="155pt" height="39pt"
+ viewBox="0.00 0.00 155.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
 <svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
@@ -17,7 +17,7 @@
 ]]></style>
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
 <svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 101)">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
 <title>others::recursive_tree_traversals::Node</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -30,35 +30,16 @@
 </g>
 </g>
 <!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
+<g id="edge1_Node000001_Node000001" class="edge">
 <title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M122,-20.31C126.06,-19.11 128.5,-17.42 128.5,-15.25 128.5,-11.49 121.2,-9.19 110.83,-8.34"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="121.61,-16.83 112.32,-21.92 122.76,-23.73 121.61,-16.83"/>
+<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M122,-19.22C126.06,-18.28 128.5,-16.95 128.5,-15.25 128.5,-12.3 121.2,-10.49 110.83,-9.82"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="121.79,-15.72 112.33,-20.48 122.7,-22.66 121.79,-15.72"/>
 </a>
 </g>
 <text text-anchor="middle" x="137.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> left</text>
 <text text-anchor="middle" x="137.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">right</text>
 </g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="90.25,-97 20.25,-97 20.25,-77.75 90.25,-77.75 90.25,-97"/>
-<text text-anchor="middle" x="55.25" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint64_t</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node2&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M55.25,-66.17C55.25,-54.91 55.25,-41.14 55.25,-30.92"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="51.75,-65.98 55.25,-75.98 58.75,-65.98 51.75,-65.98"/>
-</a>
-</g>
-<text text-anchor="middle" x="66.12" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
-</g>
 </g>
 </svg>
 </svg>
diff --git a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph_org.svg b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph_org.svg
index 6e4274dc8..78688f8c1 100644
--- a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph_org.svg
+++ b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph_org.svg
@@ -4,9 +4,9 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: others::recursive_tree_traversals::Node Pages: 1 -->
-<svg width="155pt" height="105pt"
- viewBox="0.00 0.00 155.25 105.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 101)">
+<svg width="155pt" height="39pt"
+ viewBox="0.00 0.00 155.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
 <title>others::recursive_tree_traversals::Node</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -19,34 +19,15 @@
 </g>
 </g>
 <!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
+<g id="edge1_Node000001_Node000001" class="edge">
 <title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M122,-20.31C126.06,-19.11 128.5,-17.42 128.5,-15.25 128.5,-11.49 121.2,-9.19 110.83,-8.34"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="121.61,-16.83 112.32,-21.92 122.76,-23.73 121.61,-16.83"/>
+<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M122,-19.22C126.06,-18.28 128.5,-16.95 128.5,-15.25 128.5,-12.3 121.2,-10.49 110.83,-9.82"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="121.79,-15.72 112.33,-20.48 122.7,-22.66 121.79,-15.72"/>
 </a>
 </g>
 <text text-anchor="middle" x="137.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> left</text>
 <text text-anchor="middle" x="137.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">right</text>
 </g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="90.25,-97 20.25,-97 20.25,-77.75 90.25,-77.75 90.25,-97"/>
-<text text-anchor="middle" x="55.25" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint64_t</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node2&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M55.25,-66.17C55.25,-54.91 55.25,-41.14 55.25,-30.92"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="51.75,-65.98 55.25,-75.98 58.75,-65.98 51.75,-65.98"/>
-</a>
-</g>
-<text text-anchor="middle" x="66.12" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
-</g>
 </g>
 </svg>
diff --git a/db/d6b/kelvin__to__celsius_8cpp.html b/db/d6b/kelvin__to__celsius_8cpp.html
index 0a33c3c8c..9e21f52df 100644
--- a/db/d6b/kelvin__to__celsius_8cpp.html
+++ b/db/d6b/kelvin__to__celsius_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/kelvin_to_celsius.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/kelvin_to_celsius.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for kelvin_to_celsius.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/df0/kelvin__to__celsius_8cpp__incl.svg" width="252" height="111"><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">
+</div>
+<p><a href="../../db/d6b/kelvin__to__celsius_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d6f/namespaceothers.html">others</a></td></tr>
@@ -153,6 +172,8 @@ Functions</h2></td></tr>
 <li>K is the Kelvin temperature</li>
 </ul>
 <p>Check out <a href="https://en.wikipedia.org/wiki/Kelvin" target="_blank">Kelvin</a> and <a href="https://en.wikipedia.org/wiki/Celsius" target="_blank">Celsius</a> on Wikipedia for more information about their story, how do they work, when and why they should be used, etc.. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../db/d6b/kelvin__to__celsius_8cpp_source.html">kelvin_to_celsius.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -171,17 +192,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d6b/kelvin__to__celsius_8cpp_source.html#l00078">78</a> of file <a class="el" href="../../db/d6b/kelvin__to__celsius_8cpp_source.html">kelvin_to_celsius.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   78</span>           {</div>
 <div class="line"><span class="lineno">   79</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   80</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   81</span>}</div>
-<div class="ttc" id="akelvin__to__celsius_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> kelvin_to_celsius.cpp:62</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d6b/kelvin__to__celsius_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="372" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="akelvin__to__celsius_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d6b/kelvin__to__celsius_8cpp_source.html#l00062">kelvin_to_celsius.cpp:62</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -209,6 +227,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d6b/kelvin__to__celsius_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../db/d6b/kelvin__to__celsius_8cpp_source.html">kelvin_to_celsius.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>                    {</div>
 <div class="line"><span class="lineno">   63</span>    assert(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">others::are_almost_equal</a>(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec">others::kelvin_to_celsius</a>(230), -43.15));</div>
 <div class="line"><span class="lineno">   64</span>    assert(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">others::are_almost_equal</a>(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec">others::kelvin_to_celsius</a>(512), 238.85));</div>
@@ -218,17 +238,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   68</span>    assert(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">others::are_almost_equal</a>(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec">others::kelvin_to_celsius</a>(15), -258.15));</div>
 <div class="line"><span class="lineno">   69</span>    assert(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">others::are_almost_equal</a>(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec">others::kelvin_to_celsius</a>(273.15), 0));</div>
 <div class="line"><span class="lineno">   70</span> </div>
-<div class="line"><span class="lineno">   71</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   72</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="anamespaceothers_html_a48677fae5d683070432b1a905722d9ec"><div class="ttname"><a href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec">others::kelvin_to_celsius</a></div><div class="ttdeci">double kelvin_to_celsius(double temperature_in_k)</div><div class="ttdoc">Conversion from Kelvin to Celsius algorithm.</div><div class="ttdef"><b>Definition</b> kelvin_to_celsius.cpp:49</div></div>
-<div class="ttc" id="anamespaceothers_html_aa17dc6d061dff34f6b9a610bc5e26703"><div class="ttname"><a href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">others::are_almost_equal</a></div><div class="ttdeci">bool are_almost_equal(double a, double b, double absolute_tolerance=0.0001)</div><div class="ttdoc">Compare two floating point numbers with a certain tolerance. This is needed as with some values,...</div><div class="ttdef"><b>Definition</b> kelvin_to_celsius.cpp:40</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d6b/kelvin__to__celsius_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="275" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespaceothers_html_a48677fae5d683070432b1a905722d9ec"><div class="ttname"><a href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec">others::kelvin_to_celsius</a></div><div class="ttdeci">double kelvin_to_celsius(double temperature_in_k)</div><div class="ttdoc">Conversion from Kelvin to Celsius algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d6b/kelvin__to__celsius_8cpp_source.html#l00049">kelvin_to_celsius.cpp:49</a></div></div>
+<div class="ttc" id="anamespaceothers_html_aa17dc6d061dff34f6b9a610bc5e26703"><div class="ttname"><a href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">others::are_almost_equal</a></div><div class="ttdeci">bool are_almost_equal(double a, double b, double absolute_tolerance=0.0001)</div><div class="ttdoc">Compare two floating point numbers with a certain tolerance. This is needed as with some values,...</div><div class="ttdef"><b>Definition</b> <a href="../../db/d6b/kelvin__to__celsius_8cpp_source.html#l00040">kelvin_to_celsius.cpp:40</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/db/d6b/kelvin__to__celsius_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/db/d6b/kelvin__to__celsius_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index b29426624..000000000
--- a/db/d6b/kelvin__to__celsius_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,42,56,68"/>
-<area shape="rect" id="Node000002" href="$d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703" title="Compare two floating point numbers with a certain tolerance. This is needed as with some values,..." alt="" coords="122,5,251,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,48,106,38,107,43,57,53"/>
-<area shape="rect" id="Node000003" href="$d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec" title="Conversion from Kelvin to Celsius algorithm." alt="" coords="104,70,269,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="57,57,97,64,96,69,56,62"/>
-</map>
diff --git a/db/d6b/kelvin__to__celsius_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/db/d6b/kelvin__to__celsius_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 5d0c314c7..000000000
--- a/db/d6b/kelvin__to__celsius_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1651ce05cf87a2a5228515f0aeef2511
\ No newline at end of file
diff --git a/db/d6b/kelvin__to__celsius_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/db/d6b/kelvin__to__celsius_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index 3bc7993a3..000000000
--- a/db/d6b/kelvin__to__celsius_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="206pt" height="76pt"
- viewBox="0.00 0.00 205.75 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-40.25 0,-40.25 0,-21 37.75,-21 37.75,-40.25"/>
-<text text-anchor="middle" x="18.88" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703" target="_top" xlink:title="Compare two floating point numbers with a certain tolerance. This is needed as with some values,...">
-<polygon fill="white" stroke="#666666" points="184.25,-67.88 87.25,-67.88 87.25,-37.38 184.25,-37.38 184.25,-67.88"/>
-<text text-anchor="start" x="95.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::are_almost</text>
-<text text-anchor="middle" x="135.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_equal</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.08,-34.11C48.46,-36.1 62.12,-38.72 75.89,-41.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.93,-44.73 85.41,-43.18 76.25,-37.86 74.93,-44.73"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec" target="_top" xlink:title="Conversion from Kelvin to Celsius algorithm.">
-<polygon fill="white" stroke="#666666" points="197.75,-19.25 73.75,-19.25 73.75,0 197.75,0 197.75,-19.25"/>
-<text text-anchor="middle" x="135.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">others::kelvin_to_celsius</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.08,-27.3C46.52,-25.75 57.14,-23.81 68.21,-21.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.69,-25.26 77.89,-20.02 67.43,-18.37 68.69,-25.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d6b/kelvin__to__celsius_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/db/d6b/kelvin__to__celsius_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index 476ff9dab..000000000
--- a/db/d6b/kelvin__to__celsius_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="206pt" height="76pt"
- viewBox="0.00 0.00 205.75 75.88" 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 71.88)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-40.25 0,-40.25 0,-21 37.75,-21 37.75,-40.25"/>
-<text text-anchor="middle" x="18.88" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703" target="_top" xlink:title="Compare two floating point numbers with a certain tolerance. This is needed as with some values,...">
-<polygon fill="white" stroke="#666666" points="184.25,-67.88 87.25,-67.88 87.25,-37.38 184.25,-37.38 184.25,-67.88"/>
-<text text-anchor="start" x="95.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::are_almost</text>
-<text text-anchor="middle" x="135.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_equal</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.08,-34.11C48.46,-36.1 62.12,-38.72 75.89,-41.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.93,-44.73 85.41,-43.18 76.25,-37.86 74.93,-44.73"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec" target="_top" xlink:title="Conversion from Kelvin to Celsius algorithm.">
-<polygon fill="white" stroke="#666666" points="197.75,-19.25 73.75,-19.25 73.75,0 197.75,0 197.75,-19.25"/>
-<text text-anchor="middle" x="135.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">others::kelvin_to_celsius</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.08,-27.3C46.52,-25.75 57.14,-23.81 68.21,-21.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.69,-25.26 77.89,-20.02 67.43,-18.37 68.69,-25.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d6b/kelvin__to__celsius_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d6b/kelvin__to__celsius_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 954e1a44e..000000000
--- a/db/d6b/kelvin__to__celsius_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,42,55,68"/>
-<area shape="rect" id="Node000002" href="$db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,42,153,68"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,52,88,52,88,58,55,58"/>
-<area shape="rect" id="Node000003" href="$d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703" title="Compare two floating point numbers with a certain tolerance. This is needed as with some values,..." alt="" coords="219,5,348,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,48,203,38,204,43,154,53"/>
-<area shape="rect" id="Node000004" href="$d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec" title="Conversion from Kelvin to Celsius algorithm." alt="" coords="201,70,366,96"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="154,57,194,64,193,69,153,62"/>
-</map>
diff --git a/db/d6b/kelvin__to__celsius_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d6b/kelvin__to__celsius_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 10a3d2875..000000000
--- a/db/d6b/kelvin__to__celsius_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-05d85dfcdfa22a24c32e461e74b14c5a
\ No newline at end of file
diff --git a/db/d6b/kelvin__to__celsius_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d6b/kelvin__to__celsius_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 59d93832e..000000000
--- a/db/d6b/kelvin__to__celsius_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="279pt" height="76pt"
- viewBox="0.00 0.00 278.75 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-40.25 0,-40.25 0,-21 37,-21 37,-40.25"/>
-<text text-anchor="middle" x="18.5" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-40.25 73,-40.25 73,-21 110.75,-21 110.75,-40.25"/>
-<text text-anchor="middle" x="91.88" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-30.62C44.55,-30.62 53.37,-30.62 61.69,-30.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-34.13 71.43,-30.63 61.43,-27.13 61.43,-34.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703" target="_top" xlink:title="Compare two floating point numbers with a certain tolerance. This is needed as with some values,...">
-<polygon fill="white" stroke="#666666" points="257.25,-67.88 160.25,-67.88 160.25,-37.38 257.25,-37.38 257.25,-67.88"/>
-<text text-anchor="start" x="168.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::are_almost</text>
-<text text-anchor="middle" x="208.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_equal</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.08,-34.11C121.46,-36.1 135.12,-38.72 148.89,-41.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.93,-44.73 158.41,-43.18 149.25,-37.86 147.93,-44.73"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec" target="_top" xlink:title="Conversion from Kelvin to Celsius algorithm.">
-<polygon fill="white" stroke="#666666" points="270.75,-19.25 146.75,-19.25 146.75,0 270.75,0 270.75,-19.25"/>
-<text text-anchor="middle" x="208.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">others::kelvin_to_celsius</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.08,-27.3C119.52,-25.75 130.14,-23.81 141.21,-21.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.69,-25.26 150.89,-20.02 140.43,-18.37 141.69,-25.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d6b/kelvin__to__celsius_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/db/d6b/kelvin__to__celsius_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 114ea74ea..000000000
--- a/db/d6b/kelvin__to__celsius_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="279pt" height="76pt"
- viewBox="0.00 0.00 278.75 75.88" 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 71.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-40.25 0,-40.25 0,-21 37,-21 37,-40.25"/>
-<text text-anchor="middle" x="18.5" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-40.25 73,-40.25 73,-21 110.75,-21 110.75,-40.25"/>
-<text text-anchor="middle" x="91.88" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-30.62C44.55,-30.62 53.37,-30.62 61.69,-30.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-34.13 71.43,-30.63 61.43,-27.13 61.43,-34.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703" target="_top" xlink:title="Compare two floating point numbers with a certain tolerance. This is needed as with some values,...">
-<polygon fill="white" stroke="#666666" points="257.25,-67.88 160.25,-67.88 160.25,-37.38 257.25,-37.38 257.25,-67.88"/>
-<text text-anchor="start" x="168.25" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::are_almost</text>
-<text text-anchor="middle" x="208.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_equal</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.08,-34.11C121.46,-36.1 135.12,-38.72 148.89,-41.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.93,-44.73 158.41,-43.18 149.25,-37.86 147.93,-44.73"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec" target="_top" xlink:title="Conversion from Kelvin to Celsius algorithm.">
-<polygon fill="white" stroke="#666666" points="270.75,-19.25 146.75,-19.25 146.75,0 270.75,0 270.75,-19.25"/>
-<text text-anchor="middle" x="208.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">others::kelvin_to_celsius</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.08,-27.3C119.52,-25.75 130.14,-23.81 141.21,-21.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.69,-25.26 150.89,-20.02 140.43,-18.37 141.69,-25.26"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d6b/kelvin__to__celsius_8cpp_source.html b/db/d6b/kelvin__to__celsius_8cpp_source.html
new file mode 100644
index 000000000..3d06464a1
--- /dev/null
+++ b/db/d6b/kelvin__to__celsius_8cpp_source.html
@@ -0,0 +1,185 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/kelvin_to_celsius.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/d6b/kelvin__to__celsius_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">kelvin_to_celsius.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../db/d6b/kelvin__to__celsius_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cmath&gt;</span>     </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/d6f/namespaceothers.html">others</a> {</div>
+<div class="foldopen" id="foldopen00040" data-start="{" data-end="}">
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">   40</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">are_almost_equal</a>(<span class="keywordtype">double</span> a, <span class="keywordtype">double</span> b, <span class="keywordtype">double</span> absolute_tolerance = 0.0001) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">return</span> std::abs(a - b) &lt; absolute_tolerance;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>}</div>
+</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="foldopen" id="foldopen00049" data-start="{" data-end="}">
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"><a class="line" href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec">   49</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec">kelvin_to_celsius</a>(<span class="keywordtype">double</span> temperature_in_k) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> absolute_zero_in_c = -273.15;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordflow">if</span> (temperature_in_k &lt; absolute_zero_in_c) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;input temperature below absolute zero&quot;</span>);</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    }</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">return</span> temperature_in_k + absolute_zero_in_c;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>}</div>
+</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>}  <span class="comment">// namespace others</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">   62</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    assert(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">others::are_almost_equal</a>(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec">others::kelvin_to_celsius</a>(230), -43.15));</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    assert(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">others::are_almost_equal</a>(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec">others::kelvin_to_celsius</a>(512), 238.85));</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    assert(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">others::are_almost_equal</a>(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec">others::kelvin_to_celsius</a>(55), -218.15));</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    assert(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">others::are_almost_equal</a>(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec">others::kelvin_to_celsius</a>(77), -196.15));</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    assert(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">others::are_almost_equal</a>(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec">others::kelvin_to_celsius</a>(9.78), -263.37));</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    assert(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">others::are_almost_equal</a>(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec">others::kelvin_to_celsius</a>(15), -258.15));</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    assert(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">others::are_almost_equal</a>(<a class="code hl_function" href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec">others::kelvin_to_celsius</a>(273.15), 0));</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>}</div>
+</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="foldopen" id="foldopen00078" data-start="{" data-end="}">
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"><a class="line" href="../../db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   78</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <a class="code hl_function" href="../../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>}</div>
+</div>
+<div class="ttc" id="akelvin__to__celsius_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../db/d6b/kelvin__to__celsius_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> <a href="#l00062">kelvin_to_celsius.cpp:62</a></div></div>
+<div class="ttc" id="akelvin__to__celsius_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00078">kelvin_to_celsius.cpp:78</a></div></div>
+<div class="ttc" id="anamespaceothers_html"><div class="ttname"><a href="../../d0/d6f/namespaceothers.html">others</a></div><div class="ttdoc">for vector</div></div>
+<div class="ttc" id="anamespaceothers_html_a48677fae5d683070432b1a905722d9ec"><div class="ttname"><a href="../../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec">others::kelvin_to_celsius</a></div><div class="ttdeci">double kelvin_to_celsius(double temperature_in_k)</div><div class="ttdoc">Conversion from Kelvin to Celsius algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00049">kelvin_to_celsius.cpp:49</a></div></div>
+<div class="ttc" id="anamespaceothers_html_aa17dc6d061dff34f6b9a610bc5e26703"><div class="ttname"><a href="../../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703">others::are_almost_equal</a></div><div class="ttdeci">bool are_almost_equal(double a, double b, double absolute_tolerance=0.0001)</div><div class="ttdoc">Compare two floating point numbers with a certain tolerance. This is needed as with some values,...</div><div class="ttdef"><b>Definition</b> <a href="#l00040">kelvin_to_celsius.cpp:40</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../db/d6b/kelvin__to__celsius_8cpp.html">kelvin_to_celsius.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.map b/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.map
index 67a3e00d0..00e444f60 100644
--- a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.map
+++ b/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.map
@@ -1,5 +1,5 @@
 <map id="std::is_unsigned&lt; uint256_t &gt;" name="std::is_unsigned&lt; uint256_t &gt;">
 <area shape="rect" id="Node000001" title=" " alt="" coords="5,79,199,105"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integral_constant.html" title=" " alt="" coords="51,5,153,31"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="51,5,153,31"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="105,46,105,79,99,79,99,46"/>
 </map>
diff --git a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.md5 b/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.md5
index 89f87ec0c..6915f6ced 100644
--- a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.md5
+++ b/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.md5
@@ -1 +1 @@
-8a2c8d932f73b2177cbc2496a8096375
\ No newline at end of file
+5da2e6ca4e559ac9044af5cacb5a1e60
\ No newline at end of file
diff --git a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.svg b/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.svg
index b1edadbfb..b6a4e2c94 100644
--- a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.svg
+++ b/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="110.5,-74.5 34.5,-74.5 34.5,-55.25 110.5,-55.25 110.5,-74.5"/>
 <text text-anchor="middle" x="72.5" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph_org.svg b/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph_org.svg
index 6831071f6..906b30612 100644
--- a/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph_org.svg
+++ b/db/d6d/structstd_1_1is__unsigned_3_01uint256__t_01_4__inherit__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="110.5,-74.5 34.5,-74.5 34.5,-55.25 110.5,-55.25 110.5,-74.5"/>
 <text text-anchor="middle" x="72.5" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/db/d6f/namespaceheavy__light__decomposition.html b/db/d6f/namespaceheavy__light__decomposition.html
index f85307edd..84f278c7b 100644
--- a/db/d6f/namespaceheavy__light__decomposition.html
+++ b/db/d6f/namespaceheavy__light__decomposition.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: heavy_light_decomposition Namespace Reference</title>
+<title>TheAlgorithms/C++: heavy_light_decomposition Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/db/d71/quadratic__probing__hash__table_8cpp.html b/db/d71/quadratic__probing__hash__table_8cpp.html
index 83ef9e0b1..6caab37bb 100644
--- a/db/d71/quadratic__probing__hash__table_8cpp.html
+++ b/db/d71/quadratic__probing__hash__table_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: hashing/quadratic_probing_hash_table.cpp File Reference</title>
+<title>TheAlgorithms/C++: hashing/quadratic_probing_hash_table.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for quadratic_probing_hash_table.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d61/quadratic__probing__hash__table_8cpp__incl.svg" width="244" height="126"><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">
+</div>
+<p><a href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/dd1/structquadratic__probing_1_1_entry.html">quadratic_probing::Entry</a></td></tr>
@@ -164,23 +183,17 @@ Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:a90f9d8a71e3f148b65bcc0c1c8a49c70" id="r_a90f9d8a71e3f148b65bcc0c1c8a49c70"><td class="memItemLeft" align="right" valign="top"><a id="a90f9d8a71e3f148b65bcc0c1c8a49c70" name="a90f9d8a71e3f148b65bcc0c1c8a49c70"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>quadratic_probing::notPresent</b></td></tr>
+<tr class="memitem:a90f9d8a71e3f148b65bcc0c1c8a49c70" id="r_a90f9d8a71e3f148b65bcc0c1c8a49c70"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dd2/namespacequadratic__probing.html#a90f9d8a71e3f148b65bcc0c1c8a49c70">quadratic_probing::notPresent</a></td></tr>
 <tr class="separator:a90f9d8a71e3f148b65bcc0c1c8a49c70"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a149e32e186c3fac390ffa81dd6c73147" id="r_a149e32e186c3fac390ffa81dd6c73147"><td class="memItemLeft" align="right" valign="top"><a id="a149e32e186c3fac390ffa81dd6c73147" name="a149e32e186c3fac390ffa81dd6c73147"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../da/dd1/structquadratic__probing_1_1_entry.html">Entry</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>quadratic_probing::table</b></td></tr>
+<tr class="memitem:a149e32e186c3fac390ffa81dd6c73147" id="r_a149e32e186c3fac390ffa81dd6c73147"><td class="memItemLeft" align="right" valign="top">std::vector&lt; <a class="el" href="../../da/dd1/structquadratic__probing_1_1_entry.html">Entry</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dd2/namespacequadratic__probing.html#a149e32e186c3fac390ffa81dd6c73147">quadratic_probing::table</a></td></tr>
 <tr class="separator:a149e32e186c3fac390ffa81dd6c73147"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2d5722a3b692eeb1b96615fba6a248f3" id="r_a2d5722a3b692eeb1b96615fba6a248f3"><td class="memItemLeft" align="right" valign="top"><a id="a2d5722a3b692eeb1b96615fba6a248f3" name="a2d5722a3b692eeb1b96615fba6a248f3"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>quadratic_probing::totalSize</b></td></tr>
+<tr class="memitem:a2d5722a3b692eeb1b96615fba6a248f3" id="r_a2d5722a3b692eeb1b96615fba6a248f3"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dd2/namespacequadratic__probing.html#a2d5722a3b692eeb1b96615fba6a248f3">quadratic_probing::totalSize</a></td></tr>
 <tr class="separator:a2d5722a3b692eeb1b96615fba6a248f3"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aaa4b6c021ba71ecdac8b23b45d55c774" id="r_aaa4b6c021ba71ecdac8b23b45d55c774"><td class="memItemLeft" align="right" valign="top"><a id="aaa4b6c021ba71ecdac8b23b45d55c774" name="aaa4b6c021ba71ecdac8b23b45d55c774"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>quadratic_probing::tomb</b> = -1</td></tr>
+<tr class="memitem:aaa4b6c021ba71ecdac8b23b45d55c774" id="r_aaa4b6c021ba71ecdac8b23b45d55c774"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dd2/namespacequadratic__probing.html#aaa4b6c021ba71ecdac8b23b45d55c774">quadratic_probing::tomb</a> = -1</td></tr>
 <tr class="separator:aaa4b6c021ba71ecdac8b23b45d55c774"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a6c60d84648b0f7bf78789da196bcd2b3" id="r_a6c60d84648b0f7bf78789da196bcd2b3"><td class="memItemLeft" align="right" valign="top"><a id="a6c60d84648b0f7bf78789da196bcd2b3" name="a6c60d84648b0f7bf78789da196bcd2b3"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>quadratic_probing::size</b></td></tr>
+<tr class="memitem:a6c60d84648b0f7bf78789da196bcd2b3" id="r_a6c60d84648b0f7bf78789da196bcd2b3"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dd2/namespacequadratic__probing.html#a6c60d84648b0f7bf78789da196bcd2b3">quadratic_probing::size</a></td></tr>
 <tr class="separator:a6c60d84648b0f7bf78789da196bcd2b3"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad20bb8020424def88917e26979051fae" id="r_ad20bb8020424def88917e26979051fae"><td class="memItemLeft" align="right" valign="top"><a id="ad20bb8020424def88917e26979051fae" name="ad20bb8020424def88917e26979051fae"></a>
-bool&#160;</td><td class="memItemRight" valign="bottom"><b>quadratic_probing::rehashing</b></td></tr>
+<tr class="memitem:ad20bb8020424def88917e26979051fae" id="r_ad20bb8020424def88917e26979051fae"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dd2/namespacequadratic__probing.html#ad20bb8020424def88917e26979051fae">quadratic_probing::rehashing</a></td></tr>
 <tr class="separator:ad20bb8020424def88917e26979051fae"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -189,6 +202,8 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>quadratic_probing::re
 <dd>
 <a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
 <dl class="section note"><dt>Note</dt><dd>The implementation can be optimized by using OOP style. </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -205,48 +220,50 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>quadratic_probing::re
       </table>
 </div><div class="memdoc">
 <p>Main function </p><dl class="section return"><dt>Returns</dt><dd>None </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00246">246</a> of file <a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html">quadratic_probing_hash_table.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  246</span>           {</div>
 <div class="line"><span class="lineno">  247</span>    <span class="keywordtype">int</span> cmd = 0, <a class="code hl_function" href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hash</a> = 0, key = 0;</div>
-<div class="line"><span class="lineno">  248</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the initial size of Hash Table. = &quot;</span>;</div>
-<div class="line"><span class="lineno">  249</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; totalSize;</div>
-<div class="line"><span class="lineno">  250</span>    table = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Entry&gt;</a>(totalSize);</div>
+<div class="line"><span class="lineno">  248</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the initial size of Hash Table. = &quot;</span>;</div>
+<div class="line"><span class="lineno">  249</span>    std::cin &gt;&gt; totalSize;</div>
+<div class="line"><span class="lineno">  250</span>    table = std::vector&lt;Entry&gt;(totalSize);</div>
 <div class="line"><span class="lineno">  251</span>    <span class="keywordtype">bool</span> loop = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  252</span>    <span class="keywordflow">while</span> (loop) {</div>
-<div class="line"><span class="lineno">  253</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  254</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;PLEASE CHOOSE -&quot;</span> &lt;&lt; <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">  255</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1. Add key. (Numeric only)&quot;</span> &lt;&lt; <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">  256</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2. Remove key.&quot;</span> &lt;&lt; <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">  257</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;3. Find key.&quot;</span> &lt;&lt; <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">  258</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;4. Generate Hash. (Numeric only)&quot;</span> &lt;&lt; <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">  259</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;5. Display Hash table.&quot;</span> &lt;&lt; <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">  260</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;6. Exit.&quot;</span> &lt;&lt; <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">  261</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; cmd;</div>
+<div class="line"><span class="lineno">  253</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  254</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;PLEASE CHOOSE -&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  255</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;1. Add key. (Numeric only)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  256</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;2. Remove key.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  257</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;3. Find key.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  258</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;4. Generate Hash. (Numeric only)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  259</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;5. Display Hash table.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  260</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;6. Exit.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  261</span>        std::cin &gt;&gt; cmd;</div>
 <div class="line"><span class="lineno">  262</span>        <span class="keywordflow">switch</span> (cmd) {</div>
 <div class="line"><span class="lineno">  263</span>            <span class="keywordflow">case</span> 1:</div>
-<div class="line"><span class="lineno">  264</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter key to add = &quot;</span>;</div>
-<div class="line"><span class="lineno">  265</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; key;</div>
+<div class="line"><span class="lineno">  264</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter key to add = &quot;</span>;</div>
+<div class="line"><span class="lineno">  265</span>                std::cin &gt;&gt; key;</div>
 <div class="line"><span class="lineno">  266</span>                <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768">quadratic_probing::addInfo</a>(key);</div>
 <div class="line"><span class="lineno">  267</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  268</span>            <span class="keywordflow">case</span> 2:</div>
-<div class="line"><span class="lineno">  269</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter key to remove = &quot;</span>;</div>
-<div class="line"><span class="lineno">  270</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; key;</div>
+<div class="line"><span class="lineno">  269</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter key to remove = &quot;</span>;</div>
+<div class="line"><span class="lineno">  270</span>                std::cin &gt;&gt; key;</div>
 <div class="line"><span class="lineno">  271</span>                <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30">quadratic_probing::removalInfo</a>(key);</div>
 <div class="line"><span class="lineno">  272</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  273</span>            <span class="keywordflow">case</span> 3: {</div>
-<div class="line"><span class="lineno">  274</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter key to search = &quot;</span>;</div>
-<div class="line"><span class="lineno">  275</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; key;</div>
+<div class="line"><span class="lineno">  274</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter key to search = &quot;</span>;</div>
+<div class="line"><span class="lineno">  275</span>                std::cin &gt;&gt; key;</div>
 <div class="line"><span class="lineno">  276</span>                <a class="code hl_struct" href="../../da/dd1/structquadratic__probing_1_1_entry.html">quadratic_probing::Entry</a> entry =</div>
 <div class="line"><span class="lineno">  277</span>                    quadratic_probing::table[<a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf">quadratic_probing::quadraticProbe</a>(</div>
 <div class="line"><span class="lineno">  278</span>                        key, <span class="keyword">true</span>)];</div>
 <div class="line"><span class="lineno">  279</span>                <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">key</a> == quadratic_probing::notPresent) {</div>
-<div class="line"><span class="lineno">  280</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Key not present&quot;</span>;</div>
+<div class="line"><span class="lineno">  280</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;Key not present&quot;</span>;</div>
 <div class="line"><span class="lineno">  281</span>                }</div>
 <div class="line"><span class="lineno">  282</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  283</span>            }</div>
 <div class="line"><span class="lineno">  284</span>            <span class="keywordflow">case</span> 4:</div>
-<div class="line"><span class="lineno">  285</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter element to generate hash = &quot;</span>;</div>
-<div class="line"><span class="lineno">  286</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; key;</div>
-<div class="line"><span class="lineno">  287</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hash of &quot;</span> &lt;&lt; key</div>
+<div class="line"><span class="lineno">  285</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter element to generate hash = &quot;</span>;</div>
+<div class="line"><span class="lineno">  286</span>                std::cin &gt;&gt; key;</div>
+<div class="line"><span class="lineno">  287</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Hash of &quot;</span> &lt;&lt; key</div>
 <div class="line"><span class="lineno">  288</span>                          &lt;&lt; <span class="stringliteral">&quot; is = &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7">quadratic_probing::hashFxn</a>(key);</div>
 <div class="line"><span class="lineno">  289</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  290</span>            <span class="keywordflow">case</span> 5:</div>
@@ -257,28 +274,19 @@ bool&#160;</td><td class="memItemRight" valign="bottom"><b>quadratic_probing::re
 <div class="line"><span class="lineno">  295</span>                <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  296</span>                <span class="comment">// delete[] table;</span></div>
 <div class="line"><span class="lineno">  297</span>        }</div>
-<div class="line"><span class="lineno">  298</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  298</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  299</span>    }</div>
 <div class="line"><span class="lineno">  300</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  301</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> md5.cpp:288</div></div>
-<div class="ttc" id="anamespacequadratic__probing_html_a2093d91dd3d377cf0a5c939e45dcefc7"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7">quadratic_probing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdef"><b>Definition</b> quadratic_probing_hash_table.cpp:46</div></div>
-<div class="ttc" id="anamespacequadratic__probing_html_a312143ed316d48978084c025ff8d9768"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768">quadratic_probing::addInfo</a></div><div class="ttdeci">void addInfo(int key)</div><div class="ttdef"><b>Definition</b> quadratic_probing_hash_table.cpp:207</div></div>
-<div class="ttc" id="anamespacequadratic__probing_html_a40d617ebf4d6ba21bcda8d8d1faa2357"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357">quadratic_probing::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition</b> quadratic_probing_hash_table.cpp:142</div></div>
-<div class="ttc" id="anamespacequadratic__probing_html_a69fe1f7c36fe004ba83eef2ca82e7e30"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30">quadratic_probing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition</b> quadratic_probing_hash_table.cpp:222</div></div>
-<div class="ttc" id="anamespacequadratic__probing_html_ab431981b54c0bae1b2956f716aee1dcf"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf">quadratic_probing::quadraticProbe</a></div><div class="ttdeci">int quadraticProbe(int key, bool searching)</div><div class="ttdef"><b>Definition</b> quadratic_probing_hash_table.cpp:56</div></div>
-<div class="ttc" id="astructquadratic__probing_1_1_entry_html"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html">quadratic_probing::Entry</a></div><div class="ttdef"><b>Definition</b> quadratic_probing_hash_table.cpp:37</div></div>
-<div class="ttc" id="astructquadratic__probing_1_1_entry_html_a75f72858f08a2fc8b94402de98db12d8"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">quadratic_probing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition</b> quadratic_probing_hash_table.cpp:39</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>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../db/d71/quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="amd5_8cpp_html_a88705fab5f92adf3427b4cf76ff33edb"><div class="ttname"><a href="../../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb">hashing::md5::hash</a></div><div class="ttdeci">void * hash(const std::string &amp;message)</div><div class="ttdoc">Converts the string to bytestring and calls the main algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d96/md5_8cpp_source.html#l00288">md5.cpp:288</a></div></div>
+<div class="ttc" id="anamespacequadratic__probing_html_a2093d91dd3d377cf0a5c939e45dcefc7"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7">quadratic_probing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00046">quadratic_probing_hash_table.cpp:46</a></div></div>
+<div class="ttc" id="anamespacequadratic__probing_html_a312143ed316d48978084c025ff8d9768"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768">quadratic_probing::addInfo</a></div><div class="ttdeci">void addInfo(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00207">quadratic_probing_hash_table.cpp:207</a></div></div>
+<div class="ttc" id="anamespacequadratic__probing_html_a40d617ebf4d6ba21bcda8d8d1faa2357"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357">quadratic_probing::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition</b> <a href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00142">quadratic_probing_hash_table.cpp:142</a></div></div>
+<div class="ttc" id="anamespacequadratic__probing_html_a69fe1f7c36fe004ba83eef2ca82e7e30"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30">quadratic_probing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00222">quadratic_probing_hash_table.cpp:222</a></div></div>
+<div class="ttc" id="anamespacequadratic__probing_html_ab431981b54c0bae1b2956f716aee1dcf"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf">quadratic_probing::quadraticProbe</a></div><div class="ttdeci">int quadraticProbe(int key, bool searching)</div><div class="ttdef"><b>Definition</b> <a href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00056">quadratic_probing_hash_table.cpp:56</a></div></div>
+<div class="ttc" id="astructquadratic__probing_1_1_entry_html"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html">quadratic_probing::Entry</a></div><div class="ttdef"><b>Definition</b> <a href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00037">quadratic_probing_hash_table.cpp:37</a></div></div>
+<div class="ttc" id="astructquadratic__probing_1_1_entry_html_a75f72858f08a2fc8b94402de98db12d8"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">quadratic_probing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition</b> <a href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00039">quadratic_probing_hash_table.cpp:39</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/db/d71/quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d71/quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 8652e3a55..000000000
--- a/db/d71/quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,43 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,187,55,213"/>
-<area shape="rect" id="Node000002" href="$d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768" title=" " alt="" coords="103,212,234,252"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,203,88,211,87,216,54,208"/>
-<area shape="rect" id="Node000004" href="$d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" title=" " alt="" coords="482,316,614,356"/>
-<area shape="poly" id="edge20_Node000001_Node000004" title=" " alt="" coords="44,211,69,238,104,262,149,281,197,296,295,318,388,329,467,334,467,339,388,335,294,323,196,301,148,286,101,266,66,242,40,215"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="692,151,763,177"/>
-<area shape="poly" id="edge18_Node000001_Node000005" title=" " alt="" coords="34,185,59,139,78,112,101,89,146,58,185,40,227,31,282,21,377,7,453,5,490,10,528,21,615,59,643,76,668,97,708,137,704,141,664,100,639,80,612,64,526,26,489,15,453,10,377,12,282,27,229,36,187,46,148,62,104,93,82,115,63,141,39,188"/>
-<area shape="rect" id="Node000006" href="$d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" title=" " alt="" coords="662,434,793,475"/>
-<area shape="poly" id="edge19_Node000001_Node000006" title=" " alt="" coords="39,212,64,259,82,286,104,310,148,343,187,362,283,393,381,426,483,445,567,453,646,454,646,460,566,458,482,451,380,431,281,398,185,367,146,348,101,314,78,289,59,262,34,215"/>
-<area shape="rect" id="Node000012" href="$d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357" title=" " alt="" coords="292,36,424,76"/>
-<area shape="poly" id="edge17_Node000001_Node000012" title=" " alt="" coords="41,185,67,158,101,132,144,111,190,93,276,69,278,74,192,98,147,116,104,137,70,162,45,188"/>
-<area shape="rect" id="Node000013" href="$d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30" title=" " alt="" coords="103,146,234,187"/>
-<area shape="poly" id="edge21_Node000001_Node000013" title=" " alt="" coords="54,192,87,184,88,189,56,197"/>
-<area shape="rect" id="Node000003" href="$d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9" title=" " alt="" coords="282,215,434,241"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="235,228,267,227,267,233,235,233"/>
-<area shape="poly" id="edge15_Node000002_Node000005" title=" " alt="" coords="233,250,312,270,410,283,462,284,514,280,564,269,612,251,628,239,637,224,645,207,660,190,677,179,679,184,663,194,649,210,641,226,632,242,615,256,566,274,515,285,462,289,410,288,311,275,231,255"/>
-<area shape="poly" id="edge16_Node000002_Node000006" title=" " alt="" coords="199,250,319,329,399,373,483,409,566,432,647,445,646,450,565,437,481,414,397,378,316,333,196,255"/>
-<area shape="poly" id="edge13_Node000002_Node000012" title=" " alt="" coords="214,209,232,197,258,169,280,137,325,86,329,89,284,140,262,172,236,201,217,213"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="396,239,436,258,508,304,505,308,433,262,394,244"/>
-<area shape="rect" id="Node000011" href="$d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486" title=" " alt="" coords="482,201,614,242"/>
-<area shape="poly" id="edge10_Node000003_Node000011" title=" " alt="" coords="434,231,466,230,467,236,435,237"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="591,313,612,296,628,269,634,243,641,217,660,190,676,178,679,182,664,194,646,219,639,244,633,271,616,299,594,317"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="589,355,615,373,639,396,663,419,670,424,667,428,660,423,636,400,612,377,586,359"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="692,204,763,230"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="587,313,612,295,626,281,635,268,645,254,660,240,676,231,679,236,663,245,648,258,639,271,630,284,615,299,590,317"/>
-<area shape="rect" id="Node000008" href="$d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" title=" " alt="" coords="662,254,793,295"/>
-<area shape="poly" id="edge7_Node000004_Node000008" title=" " alt="" coords="609,312,651,298,652,303,611,318"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/round.html#" title=" " alt="" coords="688,319,767,345"/>
-<area shape="poly" id="edge8_Node000004_Node000009" title=" " alt="" coords="614,332,673,330,673,336,614,337"/>
-<area shape="rect" id="Node000010" href="$d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" title=" " alt="" coords="662,369,793,410"/>
-<area shape="poly" id="edge9_Node000004_Node000010" title=" " alt="" coords="615,353,647,363,646,368,613,358"/>
-<area shape="poly" id="edge11_Node000011_Node000003" title=" " alt="" coords="482,218,450,218,450,213,482,212"/>
-<area shape="poly" id="edge12_Node000011_Node000005" title=" " alt="" coords="613,198,676,177,678,182,614,203"/>
-<area shape="poly" id="edge14_Node000012_Node000005" title=" " alt="" coords="425,56,516,67,566,77,615,92,660,114,698,139,696,144,657,119,613,97,565,83,515,72,424,61"/>
-<area shape="poly" id="edge23_Node000013_Node000005" title=" " alt="" coords="234,145,282,136,392,129,502,133,601,142,677,153,676,158,600,147,502,138,392,135,282,141,235,150"/>
-<area shape="poly" id="edge24_Node000013_Node000006" title=" " alt="" coords="217,185,236,198,251,212,260,225,269,238,284,251,323,277,358,292,393,307,436,330,460,348,484,366,519,381,547,390,614,409,659,426,657,431,613,414,546,395,517,386,481,370,456,353,433,334,391,312,356,297,321,282,280,255,265,241,256,228,247,216,232,202,214,190"/>
-<area shape="poly" id="edge22_Node000013_Node000012" title=" " alt="" coords="199,143,281,92,300,82,303,86,283,97,202,148"/>
-<area shape="rect" id="Node000014" href="$d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a" title=" " alt="" coords="292,150,424,191"/>
-<area shape="poly" id="edge25_Node000013_Node000014" title=" " alt="" coords="235,165,277,166,277,172,235,171"/>
-<area shape="poly" id="edge27_Node000014_Node000004" title=" " alt="" coords="418,189,436,201,478,244,524,302,520,305,474,247,433,205,415,194"/>
-<area shape="poly" id="edge26_Node000014_Node000005" title=" " alt="" coords="424,167,676,162,676,168,424,172"/>
-</map>
diff --git a/db/d71/quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d71/quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index c0a742986..000000000
--- a/db/d71/quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1e05e731ad82cf8a3f7a7d53c6fc0457
\ No newline at end of file
diff --git a/db/d71/quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d71/quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 3375ca3c2..000000000
--- a/db/d71/quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,473 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 360 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 599;
-var viewHeight = 360;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-215.88 0,-215.88 0,-196.62 37,-196.62 37,-215.88"/>
-<text text-anchor="middle" x="18.5" y="-202.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="171.5,-197.5 73,-197.5 73,-167 171.5,-167 171.5,-197.5"/>
-<text text-anchor="start" x="81" y="-184" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="122.25" y="-172.75" font-family="Helvetica,sans-Serif" font-size="10.00">addInfo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.22,-202.07C44.27,-200.41 52.81,-198.39 61.72,-196.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.29,-199.75 71.22,-194.05 60.68,-192.94 62.29,-199.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="456.25,-119.5 357.75,-119.5 357.75,-89 456.25,-89 456.25,-119.5"/>
-<text text-anchor="start" x="365.75" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="407" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">quadraticProbe</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge20_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge20_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.41,-196.34C36.96,-185.14 54.09,-167.29 73,-158.25 161.72,-115.83 277.31,-105.83 346.35,-103.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="346.01,-107.47 355.93,-103.76 345.85,-100.47 346.01,-107.47"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="568.25,-242.88 514.75,-242.88 514.75,-223.62 568.25,-223.62 568.25,-242.88"/>
-<text text-anchor="middle" x="541.5" y="-229.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge18_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge18_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.54,-216.31C30.89,-233.43 48.04,-268.3 73,-288.25 122.82,-328.07 144.73,-326.96 207.5,-338.25 317,-357.94 357.2,-360.92 456.25,-310.25 484.34,-295.88 510.08,-269.59 525.53,-251.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="527.89,-254.4 531.65,-244.5 522.54,-249.9 527.89,-254.4"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="590.75,-30.5 492.25,-30.5 492.25,0 590.75,0 590.75,-30.5"/>
-<text text-anchor="start" x="500.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="541.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge19_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge19_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.65,-196.16C31.17,-178.95 48.58,-143.7 73,-122.25 122.59,-78.68 145.4,-81.64 207.5,-59.25 272.4,-35.85 289.44,-29.92 357.75,-20.25 398.44,-14.49 444.72,-13.28 480.53,-13.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="480.22,-16.98 490.25,-13.58 480.29,-9.98 480.22,-16.98"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="313.88,-329.5 215.38,-329.5 215.38,-299 313.88,-299 313.88,-329.5"/>
-<text text-anchor="start" x="223.38" y="-316" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="264.62" y="-304.75" font-family="Helvetica,sans-Serif" font-size="10.00">display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge17_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge17_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.96,-216.3C37.75,-227.33 54.86,-244.85 73,-255.25 113.75,-278.63 164.82,-293.79 203.84,-302.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="203.02,-306.29 213.55,-305.07 204.56,-299.46 203.02,-306.29"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="171.5,-246.5 73,-246.5 73,-216 171.5,-216 171.5,-246.5"/>
-<text text-anchor="start" x="81" y="-233" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="122.25" y="-221.75" font-family="Helvetica,sans-Serif" font-size="10.00">removalInfo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node13 -->
-<g id="edge21_Node000001_Node000013" class="edge">
-<title>Node1&#45;&gt;Node13</title>
-<g id="a_edge21_Node000001_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.22,-210.6C44.27,-212.34 52.81,-214.43 61.72,-216.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.68,-219.97 71.22,-218.96 62.35,-213.17 60.68,-219.97"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321.75,-194.88 207.5,-194.88 207.5,-175.62 321.75,-175.62 321.75,-194.88"/>
-<text text-anchor="middle" x="264.62" y="-181.38" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::add</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M171.95,-183.29C179.7,-183.46 187.84,-183.63 195.93,-183.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.71,-187.3 205.79,-184.01 195.86,-180.3 195.71,-187.3"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge15_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge15_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M169.95,-166.54C237.07,-146.85 362.98,-120.81 456.25,-166.25 479.59,-177.62 471.72,-196.36 492.25,-212.25 495.99,-215.14 500.19,-217.73 504.51,-220"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="502.74,-223.04 513.28,-224.13 505.72,-216.7 502.74,-223.04"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge16_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge16_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.3,-166.7C183.91,-138.24 273.18,-77.92 357.75,-47.25 397.37,-32.88 444.23,-24.84 480.58,-20.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="480.95,-23.9 490.48,-19.28 480.15,-16.94 480.95,-23.9"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge13_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge13_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M157.85,-197.9C162.64,-200.71 167.34,-203.84 171.5,-207.25 191.3,-223.5 190.9,-232.75 207.5,-252.25 218.45,-265.11 231.04,-279.09 241.52,-290.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.68,-292.59 248.03,-297.57 243.82,-287.85 238.68,-292.59"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.1,-175.15C301.64,-171.19 312.35,-166.38 321.75,-161.25 340.49,-151.02 360.32,-137.74 376.04,-126.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="377.95,-129.51 384.01,-120.82 373.85,-123.83 377.95,-129.51"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="456.25,-205.5 357.75,-205.5 357.75,-175 456.25,-175 456.25,-205.5"/>
-<text text-anchor="start" x="365.75" y="-192" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="407" y="-180.75" font-family="Helvetica,sans-Serif" font-size="10.00">rehash</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node11 -->
-<g id="edge10_Node000003_Node000011" class="edge">
-<title>Node3&#45;&gt;Node11</title>
-<g id="a_edge10_Node000003_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.91,-180.62C329.8,-180.77 337.94,-181.04 345.9,-181.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.7,-184.92 355.88,-181.98 346.09,-177.93 345.7,-184.92"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M440.19,-119.85C446.02,-123.66 451.69,-128.15 456.25,-133.25 481.94,-162.04 464.73,-185.2 492.25,-212.25 495.69,-215.64 499.77,-218.52 504.08,-220.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="502.45,-224.06 512.98,-225.24 505.48,-217.75 502.45,-224.06"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M436.53,-88.59C443.2,-84.53 450.13,-79.96 456.25,-75.25 473.93,-61.63 474.15,-53.3 492.25,-40.25 493.97,-39.01 495.76,-37.79 497.6,-36.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="498.96,-39.87 505.74,-31.73 495.36,-33.87 498.96,-39.87"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="568.25,-202.88 514.75,-202.88 514.75,-183.62 568.25,-183.62 568.25,-202.88"/>
-<text text-anchor="middle" x="541.5" y="-189.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M437.31,-119.88C443.81,-123.88 450.47,-128.43 456.25,-133.25 474.86,-148.79 472.41,-160.3 492.25,-174.25 495.88,-176.8 499.89,-179.07 504.01,-181.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="502.35,-184.17 512.92,-184.92 505.13,-177.74 502.35,-184.17"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="590.75,-165.5 492.25,-165.5 492.25,-135 590.75,-135 590.75,-165.5"/>
-<text text-anchor="start" x="500.25" y="-152" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="541.5" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">putProber</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M453.23,-119.95C463.36,-123.47 474.21,-127.24 484.71,-130.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="483.45,-134.15 494.05,-134.12 485.75,-127.54 483.45,-134.15"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="571.25,-116.88 511.75,-116.88 511.75,-97.62 571.25,-97.62 571.25,-116.88"/>
-<text text-anchor="middle" x="541.5" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge8_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge8_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M456.59,-105.35C471.01,-105.68 486.64,-106.03 500.46,-106.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="499.98,-109.83 510.06,-106.56 500.14,-102.84 499.98,-109.83"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="590.75,-79.5 492.25,-79.5 492.25,-49 590.75,-49 590.75,-79.5"/>
-<text text-anchor="start" x="500.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="541.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">searchingProber</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node10 -->
-<g id="edge9_Node000004_Node000010" class="edge">
-<title>Node4&#45;&gt;Node10</title>
-<g id="a_edge9_Node000004_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M456.59,-89.58C464.51,-87.19 472.79,-84.69 480.94,-82.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.91,-85.59 490.47,-79.35 479.89,-78.89 481.91,-85.59"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node3 -->
-<g id="edge11_Node000011_Node000003" class="edge">
-<title>Node11&#45;&gt;Node3</title>
-<g id="a_edge11_Node000011_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M357.39,-194.98C349.61,-194.92 341.44,-194.72 333.32,-194.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.57,-190.92 323.42,-193.95 333.25,-197.91 333.57,-190.92"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge12_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge12_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M456.21,-205.9C471.89,-210.99 489.04,-216.55 503.75,-221.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="502.42,-224.57 513.01,-224.33 504.58,-217.91 502.42,-224.57"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node5 -->
-<g id="edge14_Node000012_Node000005" class="edge">
-<title>Node12&#45;&gt;Node5</title>
-<g id="a_edge14_Node000012_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M314.35,-312.21C353.68,-309.31 409.9,-302.27 456.25,-285.25 479.1,-276.86 502.45,-261.84 518.75,-250.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="520.76,-252.96 526.71,-244.19 516.6,-247.34 520.76,-252.96"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node5 -->
-<g id="edge23_Node000013_Node000005" class="edge">
-<title>Node13&#45;&gt;Node5</title>
-<g id="a_edge23_Node000013_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M171.88,-245.51C183.45,-248.31 195.83,-250.82 207.5,-252.25 314.41,-265.37 441.77,-249.39 503.41,-239.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="503.68,-243.18 513,-238.13 502.57,-236.27 503.68,-243.18"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node6 -->
-<g id="edge24_Node000013_Node000006" class="edge">
-<title>Node13&#45;&gt;Node6</title>
-<g id="a_edge24_Node000013_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M157.42,-215.52C162.33,-212.71 167.17,-209.6 171.5,-206.25 190.42,-191.62 188.57,-180.86 207.5,-166.25 252.74,-131.33 273.33,-137.61 321.75,-107.25 338.69,-96.62 340.04,-89.55 357.75,-80.25 398.63,-58.79 412.77,-62.78 456.25,-47.25 467.08,-43.38 478.64,-39.1 489.61,-34.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="490.82,-38.24 498.92,-31.41 488.33,-31.69 490.82,-38.24"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node12 -->
-<g id="edge22_Node000013_Node000012" class="edge">
-<title>Node13&#45;&gt;Node12</title>
-<g id="a_edge22_Node000013_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.49,-246.98C163.21,-258.08 186.43,-273.09 207.5,-285.25 212.12,-287.92 217.02,-290.62 221.92,-293.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.06,-296.23 230.54,-297.8 223.33,-290.04 220.06,-296.23"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="313.88,-243.5 215.38,-243.5 215.38,-213 313.88,-213 313.88,-243.5"/>
-<text text-anchor="start" x="223.38" y="-230" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="264.62" y="-218.75" font-family="Helvetica,sans-Serif" font-size="10.00">remove</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge25_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge25_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M171.95,-230.21C182.19,-229.99 193.1,-229.76 203.69,-229.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="203.57,-233.03 213.5,-229.32 203.42,-226.04 203.57,-233.03"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node4 -->
-<g id="edge27_Node000014_Node000004" class="edge">
-<title>Node14&#45;&gt;Node4</title>
-<g id="a_edge27_Node000014_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.18,-212.61C312.94,-210.13 317.58,-207.34 321.75,-204.25 336.86,-193.06 367.69,-154.48 387.57,-128.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="390.14,-131.05 393.43,-120.98 384.58,-126.79 390.14,-131.05"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node5 -->
-<g id="edge26_Node000014_Node000005" class="edge">
-<title>Node14&#45;&gt;Node5</title>
-<g id="a_edge26_Node000014_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M314.13,-229.13C368.1,-230.11 454.12,-231.68 503.11,-232.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="502.86,-236.07 512.92,-232.75 502.99,-229.07 502.86,-236.07"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d71/quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/db/d71/quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 4c46edda7..000000000
--- a/db/d71/quadratic__probing__hash__table_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,390 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="599pt" height="360pt"
- viewBox="0.00 0.00 598.75 360.20" 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 356.2)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-215.88 0,-215.88 0,-196.62 37,-196.62 37,-215.88"/>
-<text text-anchor="middle" x="18.5" y="-202.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="171.5,-197.5 73,-197.5 73,-167 171.5,-167 171.5,-197.5"/>
-<text text-anchor="start" x="81" y="-184" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="122.25" y="-172.75" font-family="Helvetica,sans-Serif" font-size="10.00">addInfo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.22,-202.07C44.27,-200.41 52.81,-198.39 61.72,-196.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.29,-199.75 71.22,-194.05 60.68,-192.94 62.29,-199.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="456.25,-119.5 357.75,-119.5 357.75,-89 456.25,-89 456.25,-119.5"/>
-<text text-anchor="start" x="365.75" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="407" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">quadraticProbe</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge20_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge20_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.41,-196.34C36.96,-185.14 54.09,-167.29 73,-158.25 161.72,-115.83 277.31,-105.83 346.35,-103.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="346.01,-107.47 355.93,-103.76 345.85,-100.47 346.01,-107.47"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="568.25,-242.88 514.75,-242.88 514.75,-223.62 568.25,-223.62 568.25,-242.88"/>
-<text text-anchor="middle" x="541.5" y="-229.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge18_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge18_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.54,-216.31C30.89,-233.43 48.04,-268.3 73,-288.25 122.82,-328.07 144.73,-326.96 207.5,-338.25 317,-357.94 357.2,-360.92 456.25,-310.25 484.34,-295.88 510.08,-269.59 525.53,-251.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="527.89,-254.4 531.65,-244.5 522.54,-249.9 527.89,-254.4"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="590.75,-30.5 492.25,-30.5 492.25,0 590.75,0 590.75,-30.5"/>
-<text text-anchor="start" x="500.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="541.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashFxn</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge19_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge19_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.65,-196.16C31.17,-178.95 48.58,-143.7 73,-122.25 122.59,-78.68 145.4,-81.64 207.5,-59.25 272.4,-35.85 289.44,-29.92 357.75,-20.25 398.44,-14.49 444.72,-13.28 480.53,-13.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="480.22,-16.98 490.25,-13.58 480.29,-9.98 480.22,-16.98"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="313.88,-329.5 215.38,-329.5 215.38,-299 313.88,-299 313.88,-329.5"/>
-<text text-anchor="start" x="223.38" y="-316" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="264.62" y="-304.75" font-family="Helvetica,sans-Serif" font-size="10.00">display</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge17_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge17_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.96,-216.3C37.75,-227.33 54.86,-244.85 73,-255.25 113.75,-278.63 164.82,-293.79 203.84,-302.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="203.02,-306.29 213.55,-305.07 204.56,-299.46 203.02,-306.29"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="171.5,-246.5 73,-246.5 73,-216 171.5,-216 171.5,-246.5"/>
-<text text-anchor="start" x="81" y="-233" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="122.25" y="-221.75" font-family="Helvetica,sans-Serif" font-size="10.00">removalInfo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node13 -->
-<g id="edge21_Node000001_Node000013" class="edge">
-<title>Node1&#45;&gt;Node13</title>
-<g id="a_edge21_Node000001_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.22,-210.6C44.27,-212.34 52.81,-214.43 61.72,-216.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.68,-219.97 71.22,-218.96 62.35,-213.17 60.68,-219.97"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321.75,-194.88 207.5,-194.88 207.5,-175.62 321.75,-175.62 321.75,-194.88"/>
-<text text-anchor="middle" x="264.62" y="-181.38" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::add</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M171.95,-183.29C179.7,-183.46 187.84,-183.63 195.93,-183.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.71,-187.3 205.79,-184.01 195.86,-180.3 195.71,-187.3"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge15_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge15_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M169.95,-166.54C237.07,-146.85 362.98,-120.81 456.25,-166.25 479.59,-177.62 471.72,-196.36 492.25,-212.25 495.99,-215.14 500.19,-217.73 504.51,-220"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="502.74,-223.04 513.28,-224.13 505.72,-216.7 502.74,-223.04"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge16_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge16_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.3,-166.7C183.91,-138.24 273.18,-77.92 357.75,-47.25 397.37,-32.88 444.23,-24.84 480.58,-20.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="480.95,-23.9 490.48,-19.28 480.15,-16.94 480.95,-23.9"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge13_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge13_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M157.85,-197.9C162.64,-200.71 167.34,-203.84 171.5,-207.25 191.3,-223.5 190.9,-232.75 207.5,-252.25 218.45,-265.11 231.04,-279.09 241.52,-290.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.68,-292.59 248.03,-297.57 243.82,-287.85 238.68,-292.59"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.1,-175.15C301.64,-171.19 312.35,-166.38 321.75,-161.25 340.49,-151.02 360.32,-137.74 376.04,-126.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="377.95,-129.51 384.01,-120.82 373.85,-123.83 377.95,-129.51"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="456.25,-205.5 357.75,-205.5 357.75,-175 456.25,-175 456.25,-205.5"/>
-<text text-anchor="start" x="365.75" y="-192" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="407" y="-180.75" font-family="Helvetica,sans-Serif" font-size="10.00">rehash</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node11 -->
-<g id="edge10_Node000003_Node000011" class="edge">
-<title>Node3&#45;&gt;Node11</title>
-<g id="a_edge10_Node000003_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.91,-180.62C329.8,-180.77 337.94,-181.04 345.9,-181.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.7,-184.92 355.88,-181.98 346.09,-177.93 345.7,-184.92"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M440.19,-119.85C446.02,-123.66 451.69,-128.15 456.25,-133.25 481.94,-162.04 464.73,-185.2 492.25,-212.25 495.69,-215.64 499.77,-218.52 504.08,-220.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="502.45,-224.06 512.98,-225.24 505.48,-217.75 502.45,-224.06"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M436.53,-88.59C443.2,-84.53 450.13,-79.96 456.25,-75.25 473.93,-61.63 474.15,-53.3 492.25,-40.25 493.97,-39.01 495.76,-37.79 497.6,-36.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="498.96,-39.87 505.74,-31.73 495.36,-33.87 498.96,-39.87"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="568.25,-202.88 514.75,-202.88 514.75,-183.62 568.25,-183.62 568.25,-202.88"/>
-<text text-anchor="middle" x="541.5" y="-189.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M437.31,-119.88C443.81,-123.88 450.47,-128.43 456.25,-133.25 474.86,-148.79 472.41,-160.3 492.25,-174.25 495.88,-176.8 499.89,-179.07 504.01,-181.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="502.35,-184.17 512.92,-184.92 505.13,-177.74 502.35,-184.17"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="590.75,-165.5 492.25,-165.5 492.25,-135 590.75,-135 590.75,-165.5"/>
-<text text-anchor="start" x="500.25" y="-152" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="541.5" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">putProber</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M453.23,-119.95C463.36,-123.47 474.21,-127.24 484.71,-130.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="483.45,-134.15 494.05,-134.12 485.75,-127.54 483.45,-134.15"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/round.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="571.25,-116.88 511.75,-116.88 511.75,-97.62 571.25,-97.62 571.25,-116.88"/>
-<text text-anchor="middle" x="541.5" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::round</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge8_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge8_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M456.59,-105.35C471.01,-105.68 486.64,-106.03 500.46,-106.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="499.98,-109.83 510.06,-106.56 500.14,-102.84 499.98,-109.83"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="590.75,-79.5 492.25,-79.5 492.25,-49 590.75,-49 590.75,-79.5"/>
-<text text-anchor="start" x="500.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="541.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">searchingProber</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node10 -->
-<g id="edge9_Node000004_Node000010" class="edge">
-<title>Node4&#45;&gt;Node10</title>
-<g id="a_edge9_Node000004_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M456.59,-89.58C464.51,-87.19 472.79,-84.69 480.94,-82.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.91,-85.59 490.47,-79.35 479.89,-78.89 481.91,-85.59"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node3 -->
-<g id="edge11_Node000011_Node000003" class="edge">
-<title>Node11&#45;&gt;Node3</title>
-<g id="a_edge11_Node000011_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M357.39,-194.98C349.61,-194.92 341.44,-194.72 333.32,-194.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.57,-190.92 323.42,-193.95 333.25,-197.91 333.57,-190.92"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge12_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge12_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M456.21,-205.9C471.89,-210.99 489.04,-216.55 503.75,-221.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="502.42,-224.57 513.01,-224.33 504.58,-217.91 502.42,-224.57"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node5 -->
-<g id="edge14_Node000012_Node000005" class="edge">
-<title>Node12&#45;&gt;Node5</title>
-<g id="a_edge14_Node000012_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M314.35,-312.21C353.68,-309.31 409.9,-302.27 456.25,-285.25 479.1,-276.86 502.45,-261.84 518.75,-250.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="520.76,-252.96 526.71,-244.19 516.6,-247.34 520.76,-252.96"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node5 -->
-<g id="edge23_Node000013_Node000005" class="edge">
-<title>Node13&#45;&gt;Node5</title>
-<g id="a_edge23_Node000013_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M171.88,-245.51C183.45,-248.31 195.83,-250.82 207.5,-252.25 314.41,-265.37 441.77,-249.39 503.41,-239.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="503.68,-243.18 513,-238.13 502.57,-236.27 503.68,-243.18"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node6 -->
-<g id="edge24_Node000013_Node000006" class="edge">
-<title>Node13&#45;&gt;Node6</title>
-<g id="a_edge24_Node000013_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M157.42,-215.52C162.33,-212.71 167.17,-209.6 171.5,-206.25 190.42,-191.62 188.57,-180.86 207.5,-166.25 252.74,-131.33 273.33,-137.61 321.75,-107.25 338.69,-96.62 340.04,-89.55 357.75,-80.25 398.63,-58.79 412.77,-62.78 456.25,-47.25 467.08,-43.38 478.64,-39.1 489.61,-34.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="490.82,-38.24 498.92,-31.41 488.33,-31.69 490.82,-38.24"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node12 -->
-<g id="edge22_Node000013_Node000012" class="edge">
-<title>Node13&#45;&gt;Node12</title>
-<g id="a_edge22_Node000013_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.49,-246.98C163.21,-258.08 186.43,-273.09 207.5,-285.25 212.12,-287.92 217.02,-290.62 221.92,-293.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.06,-296.23 230.54,-297.8 223.33,-290.04 220.06,-296.23"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="313.88,-243.5 215.38,-243.5 215.38,-213 313.88,-213 313.88,-243.5"/>
-<text text-anchor="start" x="223.38" y="-230" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
-<text text-anchor="middle" x="264.62" y="-218.75" font-family="Helvetica,sans-Serif" font-size="10.00">remove</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge25_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge25_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M171.95,-230.21C182.19,-229.99 193.1,-229.76 203.69,-229.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="203.57,-233.03 213.5,-229.32 203.42,-226.04 203.57,-233.03"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node4 -->
-<g id="edge27_Node000014_Node000004" class="edge">
-<title>Node14&#45;&gt;Node4</title>
-<g id="a_edge27_Node000014_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.18,-212.61C312.94,-210.13 317.58,-207.34 321.75,-204.25 336.86,-193.06 367.69,-154.48 387.57,-128.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="390.14,-131.05 393.43,-120.98 384.58,-126.79 390.14,-131.05"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node5 -->
-<g id="edge26_Node000014_Node000005" class="edge">
-<title>Node14&#45;&gt;Node5</title>
-<g id="a_edge26_Node000014_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M314.13,-229.13C368.1,-230.11 454.12,-231.68 503.11,-232.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="502.86,-236.07 512.92,-232.75 502.99,-229.07 502.86,-236.07"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d71/quadratic__probing__hash__table_8cpp_source.html b/db/d71/quadratic__probing__hash__table_8cpp_source.html
new file mode 100644
index 000000000..2043089e1
--- /dev/null
+++ b/db/d71/quadratic__probing__hash__table_8cpp_source.html
@@ -0,0 +1,415 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: hashing/quadratic_probing_hash_table.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/d71/quadratic__probing__hash__table_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">quadratic_probing_hash_table.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../db/d71/quadratic__probing__hash__table_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d4/dd2/namespacequadratic__probing.html">quadratic_probing</a> {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment">// fwd declarations</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="keyword">using </span><a class="code hl_struct" href="../../da/dd1/structquadratic__probing_1_1_entry.html">Entry</a> = <span class="keyword">struct </span><a class="code hl_struct" href="../../da/dd1/structquadratic__probing_1_1_entry.html">Entry</a>;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b">putProber</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../da/dd1/structquadratic__probing_1_1_entry.html">Entry</a>&amp; entry, <span class="keywordtype">int</span> key);</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6">searchingProber</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../da/dd1/structquadratic__probing_1_1_entry.html">Entry</a>&amp; entry, <span class="keywordtype">int</span> key);</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9">add</a>(<span class="keywordtype">int</span> key);</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment">// globals</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keywordtype">int</span> notPresent;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>std::vector&lt;Entry&gt; table;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keywordtype">int</span> totalSize;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keywordtype">int</span> tomb = -1;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keywordtype">int</span> size;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keywordtype">bool</span> rehashing;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="};">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../da/dd1/structquadratic__probing_1_1_entry.html">   37</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../da/dd1/structquadratic__probing_1_1_entry.html">Entry</a> {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="../../da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e">   38</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e">Entry</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">key</a> = notPresent) : <a class="code hl_variable" href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">key</a>(<a class="code hl_variable" href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">key</a>) {}  </div>
+<div class="foldopen" id="foldopen00039" data-start="{" data-end="};">
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">   39</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">key</a>;                                            </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>};</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="foldopen" id="foldopen00046" data-start="{" data-end="}">
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"><a class="line" href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7">   46</a></span><span class="keywordtype">size_t</span> <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7">hashFxn</a>(<span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    std::hash&lt;int&gt; hash;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">return</span> hash(key);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>}</div>
+</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="foldopen" id="foldopen00056" data-start="{" data-end="}">
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf">   56</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf">quadraticProbe</a>(<span class="keywordtype">int</span> key, <span class="keywordtype">bool</span> searching) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordtype">int</span> hash = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(<a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7">hashFxn</a>(key));</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordtype">int</span> i = 0;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <a class="code hl_struct" href="../../da/dd1/structquadratic__probing_1_1_entry.html">Entry</a> entry;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="keywordtype">size_t</span> index =</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            (hash + <span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(std::round(std::pow(i, 2)))) %</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            totalSize;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        entry = table[index];</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <span class="keywordflow">if</span> (searching) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">key</a> == notPresent) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>                <span class="keywordflow">return</span> notPresent;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6">searchingProber</a>(entry, key)) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Found key!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>                <span class="keywordflow">return</span> index;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            }</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Found tombstone or equal hash, checking next&quot;</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>                      &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            i++;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b">putProber</a>(entry, key)) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>                <span class="keywordflow">if</span> (!rehashing) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;Spot found!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>                }</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>                <span class="keywordflow">return</span> index;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>            }</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            <span class="keywordflow">if</span> (!rehashing) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Spot taken, looking at next (next index = &quot;</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>                          &lt;&lt; (hash + <span class="keyword">static_cast&lt;</span><span class="keywordtype">size_t</span><span class="keyword">&gt;</span>(</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>                                         std::round(std::pow(i + 1, 2)))) %</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>                                 totalSize</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>                          &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>            }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>            i++;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        }</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        <span class="keywordflow">if</span> (i == totalSize * 100) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Quadratic probe failed (infinite loop)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>            <span class="keywordflow">return</span> notPresent;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        }</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    } <span class="keywordflow">while</span> (entry.<a class="code hl_variable" href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">key</a> != notPresent);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="keywordflow">return</span> notPresent;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>}</div>
+</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="foldopen" id="foldopen00106" data-start="{" data-end="}">
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"><a class="line" href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b">  106</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b">putProber</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../da/dd1/structquadratic__probing_1_1_entry.html">Entry</a>&amp; entry, <span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">key</a> == notPresent || entry.<a class="code hl_variable" href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">key</a> == tomb) {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    }</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>}</div>
+</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="foldopen" id="foldopen00119" data-start="{" data-end="}">
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"><a class="line" href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6">  119</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6">searchingProber</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../da/dd1/structquadratic__probing_1_1_entry.html">Entry</a>&amp; entry, <span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">key</a> == key) {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    }</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>}</div>
+</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
+<div class="foldopen" id="foldopen00131" data-start="{" data-end="}">
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"><a class="line" href="../../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d">  131</a></span><a class="code hl_struct" href="../../da/dd1/structquadratic__probing_1_1_entry.html">Entry</a> <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d">find</a>(<span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="keywordtype">int</span> index = <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf">quadraticProbe</a>(key, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <span class="keywordflow">if</span> (index == notPresent) {</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>        <span class="keywordflow">return</span> <a class="code hl_struct" href="../../da/dd1/structquadratic__probing_1_1_entry.html">Entry</a>();</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    }</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    <span class="keywordflow">return</span> table[index];</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>}</div>
+</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
+<div class="foldopen" id="foldopen00142" data-start="{" data-end="}">
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"><a class="line" href="../../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357">  142</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357">display</a>() {</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; totalSize; i++) {</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        <span class="keywordflow">if</span> (table[i].key == notPresent) {</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; Empty &quot;</span>;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (table[i].key == tomb) {</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; Tomb &quot;</span>;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>            std::cout &lt;&lt; table[i].key;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>            std::cout &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>        }</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    }</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>}</div>
+</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span> </div>
+<div class="foldopen" id="foldopen00160" data-start="{" data-end="}">
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"><a class="line" href="../../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486">  160</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486">rehash</a>() {</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    <span class="comment">// Necessary so wall of add info isn&#39;t printed all at once</span></div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    rehashing = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    <span class="keywordtype">int</span> oldSize = totalSize;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    std::vector&lt;Entry&gt; oldTable(table);</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    <span class="comment">// Really this should use the next prime number greater than totalSize * 2</span></div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    totalSize *= 2;</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    table = std::vector&lt;Entry&gt;(totalSize);</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; oldSize; i++) {</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>        <span class="keywordflow">if</span> (oldTable[i].key != -1 &amp;&amp; oldTable[i].key != notPresent) {</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>            size--;  <span class="comment">// Size stays the same (add increments size)</span></div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>            <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9">add</a>(oldTable[i].key);</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>        }</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    }</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    <span class="comment">// delete[] oldTable;</span></div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    rehashing = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Table was rehashed, new size is: &quot;</span> &lt;&lt; totalSize &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>}</div>
+</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="foldopen" id="foldopen00182" data-start="{" data-end="}">
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"><a class="line" href="../../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9">  182</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9">add</a>(<span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    <span class="keywordtype">int</span> index = <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf">quadraticProbe</a>(key, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    table[index].key = key;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    <span class="comment">// Load factor greater than 0.5 causes resizing</span></div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    <span class="keywordflow">if</span> (++size / <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(totalSize) &gt;= 0.5) {</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>        <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486">rehash</a>();</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    }</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>}</div>
+</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span> </div>
+<div class="foldopen" id="foldopen00194" data-start="{" data-end="}">
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"><a class="line" href="../../d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a">  194</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a">remove</a>(<span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    <span class="keywordtype">int</span> index = <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf">quadraticProbe</a>(key, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    <span class="keywordflow">if</span> (index == notPresent) {</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;key not found&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    }</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    table[index].key = tomb;</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Removal successful, leaving tombstone&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    size--;</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>}</div>
+</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span> </div>
+<div class="foldopen" id="foldopen00207" data-start="{" data-end="}">
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"><a class="line" href="../../d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768">  207</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768">addInfo</a>(<span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initial table: &quot;</span>;</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357">display</a>();</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;hash of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7">hashFxn</a>(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>              &lt;&lt; totalSize &lt;&lt; <span class="stringliteral">&quot; == &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7">hashFxn</a>(key) % totalSize;</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9">add</a>(key);</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;New table: &quot;</span>;</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357">display</a>();</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>}</div>
+</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span> </div>
+<div class="foldopen" id="foldopen00222" data-start="{" data-end="}">
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"><a class="line" href="../../d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30">  222</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30">removalInfo</a>(<span class="keywordtype">int</span> key) {</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initial table: &quot;</span>;</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357">display</a>();</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;hash of &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; is &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7">hashFxn</a>(key) &lt;&lt; <span class="stringliteral">&quot; % &quot;</span></div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>              &lt;&lt; totalSize &lt;&lt; <span class="stringliteral">&quot; == &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7">hashFxn</a>(key) % totalSize;</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a">remove</a>(key);</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;New table: &quot;</span>;</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357">display</a>();</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>}</div>
+</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span> </div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>}  <span class="comment">// namespace quadratic_probing</span></div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span><span class="keyword">using </span><a class="code hl_struct" href="../../da/dd1/structquadratic__probing_1_1_entry.html">quadratic_probing::Entry</a>;</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span><span class="keyword">using </span>quadratic_probing::table;</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span><span class="keyword">using </span>quadratic_probing::totalSize;</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span> </div>
+<div class="foldopen" id="foldopen00246" data-start="{" data-end="}">
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"><a class="line" href="../../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  246</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    <span class="keywordtype">int</span> cmd = 0, hash = 0, key = 0;</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the initial size of Hash Table. = &quot;</span>;</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    std::cin &gt;&gt; totalSize;</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    table = std::vector&lt;Entry&gt;(totalSize);</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    <span class="keywordtype">bool</span> loop = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    <span class="keywordflow">while</span> (loop) {</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;PLEASE CHOOSE -&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;1. Add key. (Numeric only)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;2. Remove key.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;3. Find key.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;4. Generate Hash. (Numeric only)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;5. Display Hash table.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;6. Exit.&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>        std::cin &gt;&gt; cmd;</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>        <span class="keywordflow">switch</span> (cmd) {</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>            <span class="keywordflow">case</span> 1:</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter key to add = &quot;</span>;</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>                std::cin &gt;&gt; key;</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>                <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768">quadratic_probing::addInfo</a>(key);</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>            <span class="keywordflow">case</span> 2:</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter key to remove = &quot;</span>;</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>                std::cin &gt;&gt; key;</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>                <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30">quadratic_probing::removalInfo</a>(key);</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>            <span class="keywordflow">case</span> 3: {</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter key to search = &quot;</span>;</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>                std::cin &gt;&gt; key;</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>                <a class="code hl_struct" href="../../da/dd1/structquadratic__probing_1_1_entry.html">quadratic_probing::Entry</a> entry =</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>                    quadratic_probing::table[<a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf">quadratic_probing::quadraticProbe</a>(</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>                        key, <span class="keyword">true</span>)];</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>                <span class="keywordflow">if</span> (entry.<a class="code hl_variable" href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">key</a> == quadratic_probing::notPresent) {</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;Key not present&quot;</span>;</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>                }</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>            }</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>            <span class="keywordflow">case</span> 4:</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Enter element to generate hash = &quot;</span>;</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>                std::cin &gt;&gt; key;</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Hash of &quot;</span> &lt;&lt; key</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>                          &lt;&lt; <span class="stringliteral">&quot; is = &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7">quadratic_probing::hashFxn</a>(key);</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>            <span class="keywordflow">case</span> 5:</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>                <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357">quadratic_probing::display</a>();</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>            <span class="keywordflow">default</span>:</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>                loop = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>                <span class="comment">// delete[] table;</span></div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>        }</div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>    }</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>}</div>
+</div>
+</div>
+</div>
+<div class="ttc" id="anamespacequadratic__probing_html"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html">quadratic_probing</a></div><div class="ttdoc">An implementation of hash table using quadratic probing algorithm.</div></div>
+<div class="ttc" id="anamespacequadratic__probing_html_a00ebcc6d39653eccc26f8432efbfc8d9"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9">quadratic_probing::add</a></div><div class="ttdeci">void add(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00182">quadratic_probing_hash_table.cpp:182</a></div></div>
+<div class="ttc" id="anamespacequadratic__probing_html_a07a0467b24102260fbb6b554c453c20a"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a">quadratic_probing::remove</a></div><div class="ttdeci">void remove(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00194">quadratic_probing_hash_table.cpp:194</a></div></div>
+<div class="ttc" id="anamespacequadratic__probing_html_a2093d91dd3d377cf0a5c939e45dcefc7"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7">quadratic_probing::hashFxn</a></div><div class="ttdeci">size_t hashFxn(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00046">quadratic_probing_hash_table.cpp:46</a></div></div>
+<div class="ttc" id="anamespacequadratic__probing_html_a312143ed316d48978084c025ff8d9768"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768">quadratic_probing::addInfo</a></div><div class="ttdeci">void addInfo(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00207">quadratic_probing_hash_table.cpp:207</a></div></div>
+<div class="ttc" id="anamespacequadratic__probing_html_a40d617ebf4d6ba21bcda8d8d1faa2357"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357">quadratic_probing::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition</b> <a href="#l00142">quadratic_probing_hash_table.cpp:142</a></div></div>
+<div class="ttc" id="anamespacequadratic__probing_html_a5ceee4128d92ca4412040b7104d1299d"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d">quadratic_probing::find</a></div><div class="ttdeci">Entry find(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00131">quadratic_probing_hash_table.cpp:131</a></div></div>
+<div class="ttc" id="anamespacequadratic__probing_html_a69fe1f7c36fe004ba83eef2ca82e7e30"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30">quadratic_probing::removalInfo</a></div><div class="ttdeci">void removalInfo(int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00222">quadratic_probing_hash_table.cpp:222</a></div></div>
+<div class="ttc" id="anamespacequadratic__probing_html_ab431981b54c0bae1b2956f716aee1dcf"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf">quadratic_probing::quadraticProbe</a></div><div class="ttdeci">int quadraticProbe(int key, bool searching)</div><div class="ttdef"><b>Definition</b> <a href="#l00056">quadratic_probing_hash_table.cpp:56</a></div></div>
+<div class="ttc" id="anamespacequadratic__probing_html_ada6f1f44f7e83b0094fbcbe170788486"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486">quadratic_probing::rehash</a></div><div class="ttdeci">void rehash()</div><div class="ttdef"><b>Definition</b> <a href="#l00160">quadratic_probing_hash_table.cpp:160</a></div></div>
+<div class="ttc" id="anamespacequadratic__probing_html_adccc63a7e57cc6dba75bd62f40feb88b"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b">quadratic_probing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00106">quadratic_probing_hash_table.cpp:106</a></div></div>
+<div class="ttc" id="anamespacequadratic__probing_html_aeb6bca8db4768226f8ea8291ea4f83f6"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6">quadratic_probing::searchingProber</a></div><div class="ttdeci">bool searchingProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition</b> <a href="#l00119">quadratic_probing_hash_table.cpp:119</a></div></div>
+<div class="ttc" id="aquadratic__probing__hash__table_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00246">quadratic_probing_hash_table.cpp:246</a></div></div>
+<div class="ttc" id="astructquadratic__probing_1_1_entry_html"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html">quadratic_probing::Entry</a></div><div class="ttdef"><b>Definition</b> <a href="#l00037">quadratic_probing_hash_table.cpp:37</a></div></div>
+<div class="ttc" id="astructquadratic__probing_1_1_entry_html_a75f72858f08a2fc8b94402de98db12d8"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8">quadratic_probing::Entry::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key value</div><div class="ttdef"><b>Definition</b> <a href="#l00039">quadratic_probing_hash_table.cpp:39</a></div></div>
+<div class="ttc" id="astructquadratic__probing_1_1_entry_html_a9df1118010a233d13ab3dd699bcb513e"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e">quadratic_probing::Entry::Entry</a></div><div class="ttdeci">Entry(int key=notPresent)</div><div class="ttdoc">constructor</div><div class="ttdef"><b>Definition</b> <a href="#l00038">quadratic_probing_hash_table.cpp:38</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_ece9b94c107bbaa1dd68197a8c9983b9.html">hashing</a></li><li class="navelem"><a class="el" href="../../db/d71/quadratic__probing__hash__table_8cpp.html">quadratic_probing_hash_table.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.map b/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.map
index 69161e812..0c51108ff 100644
--- a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.map
+++ b/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.map
@@ -1,5 +1,5 @@
 <map id="std::is_arithmetic&lt; uint128_t &gt;" name="std::is_arithmetic&lt; uint128_t &gt;">
 <area shape="rect" id="Node000001" title=" " alt="" coords="5,79,127,120"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integral_constant.html" title=" " alt="" coords="15,5,117,31"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="15,5,117,31"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="69,46,69,79,63,79,63,46"/>
 </map>
diff --git a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.md5 b/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.md5
index b333e0c57..3fc38ad4b 100644
--- a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.md5
+++ b/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.md5
@@ -1 +1 @@
-0a23f01e10a26977e4eb20ebb42ea582
\ No newline at end of file
+3d20965ba8a5558c00e18791af7f0bdd
\ No newline at end of file
diff --git a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.svg b/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.svg
index 7636272fa..9e9f0734f 100644
--- a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.svg
+++ b/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph.svg
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="83.5,-85.75 7.5,-85.75 7.5,-66.5 83.5,-66.5 83.5,-85.75"/>
 <text text-anchor="middle" x="45.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph_org.svg b/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph_org.svg
index 64d7e0a9e..0eab6ac6b 100644
--- a/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph_org.svg
+++ b/db/d7e/structstd_1_1is__arithmetic_3_01uint128__t_01_4__inherit__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="83.5,-85.75 7.5,-85.75 7.5,-66.5 83.5,-66.5 83.5,-85.75"/>
 <text text-anchor="middle" x="45.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/db/d80/gale__shapley_8cpp.html b/db/d80/gale__shapley_8cpp.html
index 21b64e28b..27ade4da3 100644
--- a/db/d80/gale__shapley_8cpp.html
+++ b/db/d80/gale__shapley_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: greedy_algorithms/gale_shapley.cpp File Reference</title>
+<title>TheAlgorithms/C++: greedy_algorithms/gale_shapley.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for gale_shapley.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/dab/gale__shapley_8cpp__incl.svg" width="339" height="126"><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">
+</div>
+<p><a href="../../db/d80/gale__shapley_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></td></tr>
@@ -134,7 +153,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a6d7e84df47dcf19e88f95f8f9040306c" id="r_a6d7e84df47dcf19e88f95f8f9040306c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching::gale_shapley</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> &gt; &gt; &amp;secondary_preferences, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> &gt; &gt; &amp;primary_preferences)</td></tr>
+<tr class="memitem:a6d7e84df47dcf19e88f95f8f9040306c" id="r_a6d7e84df47dcf19e88f95f8f9040306c"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::uint32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching::gale_shapley</a> (const std::vector&lt; std::vector&lt; std::uint32_t &gt; &gt; &amp;secondary_preferences, const std::vector&lt; std::vector&lt; std::uint32_t &gt; &gt; &amp;primary_preferences)</td></tr>
 <tr class="memdesc:a6d7e84df47dcf19e88f95f8f9040306c"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function that finds the stable matching between two sets of elements using the Gale-Shapley Algorithm.  <br /></td></tr>
 <tr class="separator:a6d7e84df47dcf19e88f95f8f9040306c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
@@ -150,6 +169,8 @@ Functions</h2></td></tr>
 <p><b>Gale Shapley Algorithm</b> aims to find a stable matching between two equally sized sets of elements given an ordinal preference for each element. The algorithm was introduced by David Gale and Lloyd Shapley in 1962.</p>
 <p>Reference: <a href="https://en.wikipedia.org/wiki/Gale%E2%80%93Shapley_algorithm" target="_blank">Wikipedia</a> <a href="https://en.wikipedia.org/wiki/Stable_matching_problem" target="_blank">Wikipedia</a></p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/BKarthik7" target="_blank">B Karthik</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../db/d80/gale__shapley_8cpp_source.html">gale_shapley.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -168,17 +189,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d80/gale__shapley_8cpp_source.html#l00152">152</a> of file <a class="el" href="../../db/d80/gale__shapley_8cpp_source.html">gale_shapley.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  152</span>           {</div>
 <div class="line"><span class="lineno">  153</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// Run self-test implementations</span></div>
 <div class="line"><span class="lineno">  154</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  155</span>}</div>
-<div class="ttc" id="agale__shapley_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> gale_shapley.cpp:114</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="471" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agale__shapley_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d80/gale__shapley_8cpp_source.html#l00114">gale_shapley.cpp:114</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -206,15 +224,17 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d80/gale__shapley_8cpp_source.html#l00114">114</a> of file <a class="el" href="../../db/d80/gale__shapley_8cpp_source.html">gale_shapley.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  114</span>                    {</div>
 <div class="line"><span class="lineno">  115</span>    <span class="comment">// Test Case 1</span></div>
-<div class="line"><span class="lineno">  116</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::uint32_t&gt;</a>&gt; primary_preferences = {</div>
+<div class="line"><span class="lineno">  116</span>    std::vector&lt;std::vector&lt;std::uint32_t&gt;&gt; primary_preferences = {</div>
 <div class="line"><span class="lineno">  117</span>        {0, 1, 2, 3}, {2, 1, 3, 0}, {1, 2, 0, 3}, {3, 0, 1, 2}};</div>
-<div class="line"><span class="lineno">  118</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::uint32_t&gt;</a>&gt; secondary_preferences = {</div>
+<div class="line"><span class="lineno">  118</span>    std::vector&lt;std::vector&lt;std::uint32_t&gt;&gt; secondary_preferences = {</div>
 <div class="line"><span class="lineno">  119</span>        {1, 0, 2, 3}, {3, 0, 1, 2}, {0, 2, 1, 3}, {1, 2, 0, 3}};</div>
 <div class="line"><span class="lineno">  120</span>    assert(<a class="code hl_function" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching::gale_shapley</a>(</div>
 <div class="line"><span class="lineno">  121</span>               secondary_preferences, primary_preferences) ==</div>
-<div class="line"><span class="lineno">  122</span>           <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint32_t&gt;</a>({0, 2, 1, 3}));</div>
+<div class="line"><span class="lineno">  122</span>           std::vector&lt;std::uint32_t&gt;({0, 2, 1, 3}));</div>
 <div class="line"><span class="lineno">  123</span> </div>
 <div class="line"><span class="lineno">  124</span>    <span class="comment">// Test Case 2</span></div>
 <div class="line"><span class="lineno">  125</span>    primary_preferences = {</div>
@@ -223,30 +243,24 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  128</span>        {1, 0, 2, 3}, {3, 0, 1, 2}, {0, 2, 1, 3}, {1, 2, 0, 3}};</div>
 <div class="line"><span class="lineno">  129</span>    assert(<a class="code hl_function" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching::gale_shapley</a>(</div>
 <div class="line"><span class="lineno">  130</span>               secondary_preferences, primary_preferences) ==</div>
-<div class="line"><span class="lineno">  131</span>           <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint32_t&gt;</a>({0, 3, 1, 2}));</div>
+<div class="line"><span class="lineno">  131</span>           std::vector&lt;std::uint32_t&gt;({0, 3, 1, 2}));</div>
 <div class="line"><span class="lineno">  132</span> </div>
 <div class="line"><span class="lineno">  133</span>    <span class="comment">// Test Case 3</span></div>
 <div class="line"><span class="lineno">  134</span>    primary_preferences = {{0, 1, 2}, {2, 1, 0}, {1, 2, 0}};</div>
 <div class="line"><span class="lineno">  135</span>    secondary_preferences = {{1, 0, 2}, {2, 0, 1}, {0, 2, 1}};</div>
 <div class="line"><span class="lineno">  136</span>    assert(<a class="code hl_function" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching::gale_shapley</a>(</div>
 <div class="line"><span class="lineno">  137</span>               secondary_preferences, primary_preferences) ==</div>
-<div class="line"><span class="lineno">  138</span>           <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint32_t&gt;</a>({0, 2, 1}));</div>
+<div class="line"><span class="lineno">  138</span>           std::vector&lt;std::uint32_t&gt;({0, 2, 1}));</div>
 <div class="line"><span class="lineno">  139</span> </div>
 <div class="line"><span class="lineno">  140</span>    <span class="comment">// Test Case 4</span></div>
 <div class="line"><span class="lineno">  141</span>    primary_preferences = {};</div>
 <div class="line"><span class="lineno">  142</span>    secondary_preferences = {};</div>
 <div class="line"><span class="lineno">  143</span>    assert(<a class="code hl_function" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching::gale_shapley</a>(</div>
 <div class="line"><span class="lineno">  144</span>               secondary_preferences, primary_preferences) ==</div>
-<div class="line"><span class="lineno">  145</span>           <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint32_t&gt;</a>({}));</div>
+<div class="line"><span class="lineno">  145</span>           std::vector&lt;std::uint32_t&gt;({}));</div>
 <div class="line"><span class="lineno">  146</span>}</div>
-<div class="ttc" id="anamespacegreedy__algorithms_1_1stable__matching_html_a6d7e84df47dcf19e88f95f8f9040306c"><div class="ttname"><a href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching::gale_shapley</a></div><div class="ttdeci">std::vector&lt; std::uint32_t &gt; gale_shapley(const std::vector&lt; std::vector&lt; std::uint32_t &gt; &gt; &amp;secondary_preferences, const std::vector&lt; std::vector&lt; std::uint32_t &gt; &gt; &amp;primary_preferences)</div><div class="ttdoc">The main function that finds the stable matching between two sets of elements using the Gale-Shapley ...</div><div class="ttdef"><b>Definition</b> gale_shapley.cpp:46</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="374" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacegreedy__algorithms_1_1stable__matching_html_a6d7e84df47dcf19e88f95f8f9040306c"><div class="ttname"><a href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching::gale_shapley</a></div><div class="ttdeci">std::vector&lt; std::uint32_t &gt; gale_shapley(const std::vector&lt; std::vector&lt; std::uint32_t &gt; &gt; &amp;secondary_preferences, const std::vector&lt; std::vector&lt; std::uint32_t &gt; &gt; &amp;primary_preferences)</div><div class="ttdoc">The main function that finds the stable matching between two sets of elements using the Gale-Shapley ...</div><div class="ttdef"><b>Definition</b> <a href="../../db/d80/gale__shapley_8cpp_source.html#l00046">gale_shapley.cpp:46</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index ff6f9b14b..000000000
--- a/db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,20,56,46"/>
-<area shape="rect" id="Node000002" href="$dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c" title="The main function that finds the stable matching between two sets of elements using the Gale&#45;Shapley ..." alt="" coords="104,5,252,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,30,88,30,88,36,56,36"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/find.html#" title=" " alt="" coords="300,20,368,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="252,30,284,30,284,36,252,36"/>
-</map>
diff --git a/db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 2402d847e..000000000
--- a/db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-10eb6585cdd9e9d606f67df39451ea7a
\ No newline at end of file
diff --git a/db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index 4b6ae1610..000000000
--- a/db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="280pt" height="50pt"
- viewBox="0.00 0.00 280.25 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-30.5 0,-30.5 0,-11.25 37.75,-11.25 37.75,-30.5"/>
-<text text-anchor="middle" x="18.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c" target="_top" xlink:title="The main function that finds the stable matching between two sets of elements using the Gale&#45;Shapley ...">
-<polygon fill="white" stroke="#666666" points="185,-41.75 73.75,-41.75 73.75,0 185,0 185,-41.75"/>
-<text text-anchor="start" x="81.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="81.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">stable_matching::gale</text>
-<text text-anchor="middle" x="129.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_shapley</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-20.88C44.73,-20.88 53.14,-20.88 62.01,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.89,-24.38 71.89,-20.88 61.89,-17.38 61.89,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272.25,-30.5 221,-30.5 221,-11.25 272.25,-11.25 272.25,-30.5"/>
-<text text-anchor="middle" x="246.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::find</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.3,-20.88C193.44,-20.88 201.66,-20.88 209.29,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="209.2,-24.38 219.2,-20.88 209.2,-17.38 209.2,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index 877b871db..000000000
--- a/db/d80/gale__shapley_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,59 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="280pt" height="50pt"
- viewBox="0.00 0.00 280.25 49.75" 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.75)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-30.5 0,-30.5 0,-11.25 37.75,-11.25 37.75,-30.5"/>
-<text text-anchor="middle" x="18.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c" target="_top" xlink:title="The main function that finds the stable matching between two sets of elements using the Gale&#45;Shapley ...">
-<polygon fill="white" stroke="#666666" points="185,-41.75 73.75,-41.75 73.75,0 185,0 185,-41.75"/>
-<text text-anchor="start" x="81.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="81.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">stable_matching::gale</text>
-<text text-anchor="middle" x="129.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_shapley</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.79,-20.88C44.73,-20.88 53.14,-20.88 62.01,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.89,-24.38 71.89,-20.88 61.89,-17.38 61.89,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272.25,-30.5 221,-30.5 221,-11.25 272.25,-11.25 272.25,-30.5"/>
-<text text-anchor="middle" x="246.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::find</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.3,-20.88C193.44,-20.88 201.66,-20.88 209.29,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="209.2,-24.38 219.2,-20.88 209.2,-17.38 209.2,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 436cb36a7..000000000
--- a/db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,20,55,46"/>
-<area shape="rect" id="Node000002" href="$db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,20,153,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,30,88,30,88,36,55,36"/>
-<area shape="rect" id="Node000003" href="$dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c" title="The main function that finds the stable matching between two sets of elements using the Gale&#45;Shapley ..." alt="" coords="201,5,349,61"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,30,185,30,185,36,153,36"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/find.html#" title=" " alt="" coords="397,20,466,46"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="350,30,382,30,382,36,350,36"/>
-</map>
diff --git a/db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 4dcf2c6b0..000000000
--- a/db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-57ab2bbadab7072265c0260236c9486c
\ No newline at end of file
diff --git a/db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 85a475d51..000000000
--- a/db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="353pt" height="50pt"
- viewBox="0.00 0.00 353.25 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-30.5 0,-30.5 0,-11.25 37,-11.25 37,-30.5"/>
-<text text-anchor="middle" x="18.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-30.5 73,-30.5 73,-11.25 110.75,-11.25 110.75,-30.5"/>
-<text text-anchor="middle" x="91.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-20.88C44.55,-20.88 53.37,-20.88 61.69,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-24.38 71.43,-20.88 61.43,-17.38 61.43,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c" target="_top" xlink:title="The main function that finds the stable matching between two sets of elements using the Gale&#45;Shapley ...">
-<polygon fill="white" stroke="#666666" points="258,-41.75 146.75,-41.75 146.75,0 258,0 258,-41.75"/>
-<text text-anchor="start" x="154.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="154.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">stable_matching::gale</text>
-<text text-anchor="middle" x="202.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_shapley</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.79,-20.88C117.73,-20.88 126.14,-20.88 135.01,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.89,-24.38 144.89,-20.88 134.89,-17.38 134.89,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="345.25,-30.5 294,-30.5 294,-11.25 345.25,-11.25 345.25,-30.5"/>
-<text text-anchor="middle" x="319.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::find</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.3,-20.88C266.44,-20.88 274.66,-20.88 282.29,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.2,-24.38 292.2,-20.88 282.2,-17.38 282.2,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 58dd6c5f7..000000000
--- a/db/d80/gale__shapley_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="353pt" height="50pt"
- viewBox="0.00 0.00 353.25 49.75" 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.75)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-30.5 0,-30.5 0,-11.25 37,-11.25 37,-30.5"/>
-<text text-anchor="middle" x="18.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-30.5 73,-30.5 73,-11.25 110.75,-11.25 110.75,-30.5"/>
-<text text-anchor="middle" x="91.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-20.88C44.55,-20.88 53.37,-20.88 61.69,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-24.38 71.43,-20.88 61.43,-17.38 61.43,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c" target="_top" xlink:title="The main function that finds the stable matching between two sets of elements using the Gale&#45;Shapley ...">
-<polygon fill="white" stroke="#666666" points="258,-41.75 146.75,-41.75 146.75,0 258,0 258,-41.75"/>
-<text text-anchor="start" x="154.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="154.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">stable_matching::gale</text>
-<text text-anchor="middle" x="202.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_shapley</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.79,-20.88C117.73,-20.88 126.14,-20.88 135.01,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.89,-24.38 144.89,-20.88 134.89,-17.38 134.89,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="345.25,-30.5 294,-30.5 294,-11.25 345.25,-11.25 345.25,-30.5"/>
-<text text-anchor="middle" x="319.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::find</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.3,-20.88C266.44,-20.88 274.66,-20.88 282.29,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="282.2,-24.38 292.2,-20.88 282.2,-17.38 282.2,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d80/gale__shapley_8cpp_source.html b/db/d80/gale__shapley_8cpp_source.html
new file mode 100644
index 000000000..767964f4d
--- /dev/null
+++ b/db/d80/gale__shapley_8cpp_source.html
@@ -0,0 +1,259 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: greedy_algorithms/gale_shapley.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/d80/gale__shapley_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">gale_shapley.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../db/d80/gale__shapley_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;cstdint&gt;</span>    </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a> {</div>
+<div class="foldopen" id="foldopen00034" data-start="{" data-end="}">
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html">   34</a></span><span class="keyword">namespace </span>stable_matching {</div>
+<div class="foldopen" id="foldopen00046" data-start="{" data-end="}">
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"><a class="line" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">   46</a></span>std::vector&lt;std::uint32_t&gt; <a class="code hl_function" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">gale_shapley</a>(</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keyword">const</span> std::vector&lt;std::vector&lt;std::uint32_t&gt;&gt;&amp; secondary_preferences,</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keyword">const</span> std::vector&lt;std::vector&lt;std::uint32_t&gt;&gt;&amp; primary_preferences) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    std::uint32_t num_elements = secondary_preferences.size();</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    std::vector&lt;std::uint32_t&gt; matches(num_elements, -1);</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    std::vector&lt;bool&gt; is_free_primary(num_elements, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    std::vector&lt;std::uint32_t&gt; proposal_index(</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        num_elements,</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        0);  <span class="comment">// Tracks the next secondary to propose for each primary</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        <span class="keywordtype">int</span> free_primary_index = -1;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <span class="comment">// Find the next free primary</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        <span class="keywordflow">for</span> (std::uint32_t i = 0; i &lt; num_elements; i++) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            <span class="keywordflow">if</span> (is_free_primary[i]) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>                free_primary_index = i;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <span class="comment">// If no free primary is found, break the loop</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        <span class="keywordflow">if</span> (free_primary_index == -1)</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        <span class="comment">// Get the next secondary to propose</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        std::uint32_t secondary_to_propose =</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            primary_preferences[free_primary_index]</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>                               [proposal_index[free_primary_index]];</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        proposal_index[free_primary_index]++;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        <span class="comment">// Get the current match of the secondary</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        std::uint32_t current_match = matches[secondary_to_propose];</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="comment">// If the secondary is free, match them</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <span class="keywordflow">if</span> (current_match == -1) {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>            matches[secondary_to_propose] = free_primary_index;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            is_free_primary[free_primary_index] = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>            <span class="comment">// Determine if the current match should be replaced</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            <span class="keyword">auto</span> new_proposer_rank =</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>                std::find(secondary_preferences[secondary_to_propose].begin(),</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>                          secondary_preferences[secondary_to_propose].end(),</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>                          free_primary_index);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>            <span class="keyword">auto</span> current_match_rank =</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>                std::find(secondary_preferences[secondary_to_propose].begin(),</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>                          secondary_preferences[secondary_to_propose].end(),</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>                          current_match);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>            <span class="comment">// If the new proposer is preferred over the current match</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            <span class="keywordflow">if</span> (new_proposer_rank &lt; current_match_rank) {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>                matches[secondary_to_propose] = free_primary_index;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>                is_free_primary[free_primary_index] = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>                is_free_primary[current_match] =</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>                    <span class="keyword">true</span>;  <span class="comment">// Current match is now free</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>            }</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        }</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    }</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="keywordflow">return</span> matches;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>}</div>
+</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>}  <span class="comment">// namespace stable_matching</span></div>
+</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>}  <span class="comment">// namespace greedy_algorithms</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="foldopen" id="foldopen00114" data-start="{" data-end="}">
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"><a class="line" href="../../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">  114</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <span class="comment">// Test Case 1</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::vector&lt;std::vector&lt;std::uint32_t&gt;&gt; primary_preferences = {</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        {0, 1, 2, 3}, {2, 1, 3, 0}, {1, 2, 0, 3}, {3, 0, 1, 2}};</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    std::vector&lt;std::vector&lt;std::uint32_t&gt;&gt; secondary_preferences = {</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>        {1, 0, 2, 3}, {3, 0, 1, 2}, {0, 2, 1, 3}, {1, 2, 0, 3}};</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    assert(<a class="code hl_function" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching::gale_shapley</a>(</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>               secondary_preferences, primary_preferences) ==</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>           std::vector&lt;std::uint32_t&gt;({0, 2, 1, 3}));</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    <span class="comment">// Test Case 2</span></div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    primary_preferences = {</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        {0, 2, 1, 3}, {2, 3, 0, 1}, {3, 1, 2, 0}, {2, 1, 0, 3}};</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    secondary_preferences = {</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        {1, 0, 2, 3}, {3, 0, 1, 2}, {0, 2, 1, 3}, {1, 2, 0, 3}};</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    assert(<a class="code hl_function" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching::gale_shapley</a>(</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>               secondary_preferences, primary_preferences) ==</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>           std::vector&lt;std::uint32_t&gt;({0, 3, 1, 2}));</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <span class="comment">// Test Case 3</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    primary_preferences = {{0, 1, 2}, {2, 1, 0}, {1, 2, 0}};</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    secondary_preferences = {{1, 0, 2}, {2, 0, 1}, {0, 2, 1}};</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    assert(<a class="code hl_function" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching::gale_shapley</a>(</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>               secondary_preferences, primary_preferences) ==</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>           std::vector&lt;std::uint32_t&gt;({0, 2, 1}));</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span> </div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="comment">// Test Case 4</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    primary_preferences = {};</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    secondary_preferences = {};</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    assert(<a class="code hl_function" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching::gale_shapley</a>(</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>               secondary_preferences, primary_preferences) ==</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>           std::vector&lt;std::uint32_t&gt;({}));</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>}</div>
+</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span> </div>
+<div class="foldopen" id="foldopen00152" data-start="{" data-end="}">
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"><a class="line" href="../../db/d80/gale__shapley_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  152</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../db/d80/gale__shapley_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    <a class="code hl_function" href="../../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// Run self-test implementations</span></div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>}</div>
+</div>
+<div class="ttc" id="agale__shapley_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../db/d80/gale__shapley_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> <a href="#l00114">gale_shapley.cpp:114</a></div></div>
+<div class="ttc" id="agale__shapley_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d80/gale__shapley_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00152">gale_shapley.cpp:152</a></div></div>
+<div class="ttc" id="anamespacegreedy__algorithms_1_1stable__matching_html_a6d7e84df47dcf19e88f95f8f9040306c"><div class="ttname"><a href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c">greedy_algorithms::stable_matching::gale_shapley</a></div><div class="ttdeci">std::vector&lt; std::uint32_t &gt; gale_shapley(const std::vector&lt; std::vector&lt; std::uint32_t &gt; &gt; &amp;secondary_preferences, const std::vector&lt; std::vector&lt; std::uint32_t &gt; &gt; &amp;primary_preferences)</div><div class="ttdoc">The main function that finds the stable matching between two sets of elements using the Gale-Shapley ...</div><div class="ttdef"><b>Definition</b> <a href="#l00046">gale_shapley.cpp:46</a></div></div>
+<div class="ttc" id="anamespacegreedy__algorithms_html"><div class="ttname"><a href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></div><div class="ttdoc">for string class</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d1f/binary__addition_8cpp_source.html#l00027">binary_addition.cpp:27</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_0eaa691bd54ab0922ca7f50599de6d22.html">greedy_algorithms</a></li><li class="navelem"><a class="el" href="../../db/d80/gale__shapley_8cpp.html">gale_shapley.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/d82/classlarge__number.html b/db/d82/classlarge__number.html
index b36fcc303..8d9a2d09e 100644
--- a/db/d82/classlarge__number.html
+++ b/db/d82/classlarge__number.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: large_number Class Reference</title>
+<title>TheAlgorithms/C++: large_number Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -130,7 +147,7 @@ Public Member Functions</h2></td></tr>
 <tr class="separator:af4598f1f2794b5e17e10c25e0501e41a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a0b1efd203274e38a67b78937dfb9b872" id="r_a0b1efd203274e38a67b78937dfb9b872"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0b1efd203274e38a67b78937dfb9b872">large_number</a> (const <a class="el" href="../../db/d82/classlarge__number.html">large_number</a> &amp;a)</td></tr>
 <tr class="separator:a0b1efd203274e38a67b78937dfb9b872"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a76ddf1ed1b00fb8c107ea56f7f91e42f" id="r_a76ddf1ed1b00fb8c107ea56f7f91e42f"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a76ddf1ed1b00fb8c107ea56f7f91e42f">large_number</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; unsigned char &gt; &amp;vec)</td></tr>
+<tr class="memitem:a76ddf1ed1b00fb8c107ea56f7f91e42f" id="r_a76ddf1ed1b00fb8c107ea56f7f91e42f"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a76ddf1ed1b00fb8c107ea56f7f91e42f">large_number</a> (std::vector&lt; unsigned char &gt; &amp;vec)</td></tr>
 <tr class="separator:a76ddf1ed1b00fb8c107ea56f7f91e42f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:adf804e60309bf016f7954fdcb0a4d103" id="r_adf804e60309bf016f7954fdcb0a4d103"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adf804e60309bf016f7954fdcb0a4d103">large_number</a> (char const *number_str)</td></tr>
 <tr class="separator:adf804e60309bf016f7954fdcb0a4d103"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -171,12 +188,12 @@ Private Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:af2b3ec9c35842d3a46ac7326f268af57" id="r_af2b3ec9c35842d3a46ac7326f268af57"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; unsigned char &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af2b3ec9c35842d3a46ac7326f268af57">_digits</a></td></tr>
+<tr class="memitem:af2b3ec9c35842d3a46ac7326f268af57" id="r_af2b3ec9c35842d3a46ac7326f268af57"><td class="memItemLeft" align="right" valign="top">std::vector&lt; unsigned char &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af2b3ec9c35842d3a46ac7326f268af57">_digits</a></td></tr>
 <tr class="separator:af2b3ec9c35842d3a46ac7326f268af57"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="friends" name="friends"></a>
 Friends</h2></td></tr>
-<tr class="memitem:a13282908dfc4888392ed3d1fc6aae492" id="r_a13282908dfc4888392ed3d1fc6aae492"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a13282908dfc4888392ed3d1fc6aae492">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, const <a class="el" href="../../db/d82/classlarge__number.html">large_number</a> &amp;a)</td></tr>
+<tr class="memitem:a13282908dfc4888392ed3d1fc6aae492" id="r_a13282908dfc4888392ed3d1fc6aae492"><td class="memItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a13282908dfc4888392ed3d1fc6aae492">operator&lt;&lt;</a> (std::ostream &amp;out, const <a class="el" href="../../db/d82/classlarge__number.html">large_number</a> &amp;a)</td></tr>
 <tr class="separator:a13282908dfc4888392ed3d1fc6aae492"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a7ba872b9a3ce1f3da6c06c5409663cca" id="r_a7ba872b9a3ce1f3da6c06c5409663cca"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7ba872b9a3ce1f3da6c06c5409663cca">operator==</a> (<a class="el" href="../../db/d82/classlarge__number.html">large_number</a> const &amp;a, <a class="el" href="../../db/d82/classlarge__number.html">large_number</a> const &amp;b)</td></tr>
 <tr class="separator:a7ba872b9a3ce1f3da6c06c5409663cca"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -188,6 +205,8 @@ Friends</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Store large unsigned numbers as a C++ vector The class provides convenience functions to add a digit to the number, perform multiplication of large number with long unsigned integers. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00024">24</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a10119a83839e65962621b73df46a5337" name="a10119a83839e65962621b73df46a5337"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a10119a83839e65962621b73df46a5337">&#9670;&#160;</a></span>large_number() <span class="overload">[1/5]</span></h2>
@@ -212,15 +231,11 @@ Friends</h2></td></tr>
 </table>
 </div><div class="memdoc">
 <p>&lt; initializer with value = 1 </p>
-<div class="fragment"><div class="line"><span class="lineno">   27</span>{ <a class="code hl_variable" href="#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(1); }</div>
-<div class="ttc" id="aclasslarge__number_html_af2b3ec9c35842d3a46ac7326f268af57"><div class="ttname"><a href="#af2b3ec9c35842d3a46ac7326f268af57">large_number::_digits</a></div><div class="ttdeci">std::vector&lt; unsigned char &gt; _digits</div><div class="ttdef"><b>Definition</b> large_number.h:285</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-</div><!-- 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="../../db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.svg" width="348" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00027">27</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   27</span>{ <a class="code hl_variable" href="#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.push_back(1); }</div>
+<div class="ttc" id="aclasslarge__number_html_af2b3ec9c35842d3a46ac7326f268af57"><div class="ttname"><a href="#af2b3ec9c35842d3a46ac7326f268af57">large_number::_digits</a></div><div class="ttdeci">std::vector&lt; unsigned char &gt; _digits</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d86/large__number_8h_source.html#l00285">large_number.h:285</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af4598f1f2794b5e17e10c25e0501e41a" name="af4598f1f2794b5e17e10c25e0501e41a"></a>
@@ -246,11 +261,8 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>&lt; initializer from an integer &lt; initializer from an integer initializer from another <a class="el" href="../../db/d82/classlarge__number.html">large_number</a> </p>
-<div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.svg" width="556" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00039">39</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 
 </div>
 </div>
@@ -278,6 +290,8 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 <p>initializer from a vector </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00048">48</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
+
 </div>
 </div>
 <a id="a76ddf1ed1b00fb8c107ea56f7f91e42f" name="a76ddf1ed1b00fb8c107ea56f7f91e42f"></a>
@@ -292,7 +306,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">large_number::large_number </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; unsigned char &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>vec</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; unsigned char &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>vec</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -304,6 +318,8 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 <p>initializer from a string </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00051">51</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
+
 </div>
 </div>
 <a id="adf804e60309bf016f7954fdcb0a4d103" name="adf804e60309bf016f7954fdcb0a4d103"></a>
@@ -328,14 +344,15 @@ Here is the call graph for this function:</div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00054">54</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   54</span>                                                  {</div>
-<div class="line"><span class="lineno">   55</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strlen.html">strlen</a>(number_str); i &gt; 0; i--) {</div>
+<div class="line"><span class="lineno">   55</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = strlen(number_str); i &gt; 0; i--) {</div>
 <div class="line"><span class="lineno">   56</span>            <span class="keywordtype">char</span> a = number_str[i - 1] - <span class="charliteral">&#39;0&#39;</span>;</div>
 <div class="line"><span class="lineno">   57</span>            <span class="keywordflow">if</span> (a &gt;= 0 &amp;&amp; a &lt;= 9)</div>
-<div class="line"><span class="lineno">   58</span>                <a class="code hl_variable" href="#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(a);</div>
+<div class="line"><span class="lineno">   58</span>                <a class="code hl_variable" href="#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.push_back(a);</div>
 <div class="line"><span class="lineno">   59</span>        }</div>
 <div class="line"><span class="lineno">   60</span>    }</div>
-<div class="ttc" id="astrlen_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strlen.html">std::strlen</a></div><div class="ttdeci">T strlen(T... args)</div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -363,22 +380,17 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>add a digit at MSB to the large number </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00118">118</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  118</span>                                       {</div>
 <div class="line"><span class="lineno">  119</span>        <span class="keywordflow">if</span> (value &gt; 9) {</div>
-<div class="line"><span class="lineno">  120</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;digit &gt; 9!!\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  121</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  120</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;digit &gt; 9!!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  121</span>            exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  122</span>        }</div>
 <div class="line"><span class="lineno">  123</span> </div>
-<div class="line"><span class="lineno">  124</span>        <a class="code hl_variable" href="#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(value);</div>
+<div class="line"><span class="lineno">  124</span>        <a class="code hl_variable" href="#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.push_back(value);</div>
 <div class="line"><span class="lineno">  125</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::cerr</a></div></div>
-<div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.svg" width="372" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae35a55607cf52c0b0d485f2129bd39ac" name="ae35a55607cf52c0b0d485f2129bd39ac"></a>
@@ -404,16 +416,13 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>returns i^th digit as an ASCII character </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00248">248</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  248</span>                                    {</div>
 <div class="line"><span class="lineno">  249</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>[<a class="code hl_function" href="#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>() - i - 1] + <span class="charliteral">&#39;0&#39;</span>;</div>
 <div class="line"><span class="lineno">  250</span>    }</div>
-<div class="ttc" id="aclasslarge__number_html_ac09a05ec4aafb4d9e0b4440d6f0e2a93"><div class="ttname"><a href="#ac09a05ec4aafb4d9e0b4440d6f0e2a93">large_number::num_digits</a></div><div class="ttdeci">size_t num_digits() const</div><div class="ttdef"><b>Definition</b> large_number.h:130</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d82/classlarge__number_ae35a55607cf52c0b0d485f2129bd39ac_cgraph.svg" width="556" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclasslarge__number_html_ac09a05ec4aafb4d9e0b4440d6f0e2a93"><div class="ttname"><a href="#ac09a05ec4aafb4d9e0b4440d6f0e2a93">large_number::num_digits</a></div><div class="ttdeci">size_t num_digits() const</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d86/large__number_8h_source.html#l00130">large_number.h:130</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2f5571e66305cf68bb8283e4aeda58bc" name="a2f5571e66305cf68bb8283e4aeda58bc"></a>
@@ -441,8 +450,10 @@ template&lt;class T &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>multiply large number with another integer and store the result in the same large number </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00258">258</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  258</span>                             {</div>
-<div class="line"><span class="lineno">  259</span>        <span class="keyword">static_assert</span>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>,</div>
+<div class="line"><span class="lineno">  259</span>        <span class="keyword">static_assert</span>(std::is_integral&lt;T&gt;::value,</div>
 <div class="line"><span class="lineno">  260</span>                      <span class="stringliteral">&quot;Can only have integer types.&quot;</span>);</div>
 <div class="line"><span class="lineno">  261</span>        <span class="comment">// assert(!(std::is_signed&lt;T&gt;::value)); //, &quot;Implemented only for</span></div>
 <div class="line"><span class="lineno">  262</span>        <span class="comment">// unsigned integer types.&quot;);</span></div>
@@ -466,14 +477,8 @@ template&lt;class T &gt; </div>
 <div class="line"><span class="lineno">  280</span>            carry /= 10;</div>
 <div class="line"><span class="lineno">  281</span>        }</div>
 <div class="line"><span class="lineno">  282</span>    }</div>
-<div class="ttc" id="aclasslarge__number_html_a60c436d1a1c5e3795d6177d3815ad615"><div class="ttname"><a href="#a60c436d1a1c5e3795d6177d3815ad615">large_number::add_digit</a></div><div class="ttdeci">void add_digit(unsigned int value)</div><div class="ttdef"><b>Definition</b> large_number.h:118</div></div>
-<div class="ttc" id="ais_integral_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.svg" width="584" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclasslarge__number_html_a60c436d1a1c5e3795d6177d3815ad615"><div class="ttname"><a href="#a60c436d1a1c5e3795d6177d3815ad615">large_number::add_digit</a></div><div class="ttdeci">void add_digit(unsigned int value)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d86/large__number_8h_source.html#l00118">large_number.h:118</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac09a05ec4aafb4d9e0b4440d6f0e2a93" name="ac09a05ec4aafb4d9e0b4440d6f0e2a93"></a>
@@ -499,14 +504,10 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Get number of digits in the number </p>
-<div class="fragment"><div class="line"><span class="lineno">  130</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); }</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><!-- 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="../../db/d82/classlarge__number_ac09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph.svg" width="344" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00130">130</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  130</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>.size(); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a771e9b28cfddf1ad94668566e396e350" name="a771e9b28cfddf1ad94668566e396e350"></a>
@@ -534,19 +535,16 @@ template&lt;class T &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>operator overload to increment </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00238">238</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  238</span>                                        {</div>
-<div class="line"><span class="lineno">  239</span>        <span class="keyword">static_assert</span>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral&lt;T&gt;::value</a>,</div>
+<div class="line"><span class="lineno">  239</span>        <span class="keyword">static_assert</span>(std::is_integral&lt;T&gt;::value,</div>
 <div class="line"><span class="lineno">  240</span>                      <span class="stringliteral">&quot;Must be integer addition unsigned integer types.&quot;</span>);</div>
 <div class="line"><span class="lineno">  241</span>        this-&gt;<a class="code hl_function" href="#a2f5571e66305cf68bb8283e4aeda58bc">multiply</a>(n);</div>
 <div class="line"><span class="lineno">  242</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  243</span>    }</div>
-<div class="ttc" id="aclasslarge__number_html_a2f5571e66305cf68bb8283e4aeda58bc"><div class="ttname"><a href="#a2f5571e66305cf68bb8283e4aeda58bc">large_number::multiply</a></div><div class="ttdeci">void multiply(const T n)</div><div class="ttdef"><b>Definition</b> large_number.h:258</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../db/d82/classlarge__number_a771e9b28cfddf1ad94668566e396e350_cgraph.svg" width="100%" height="364"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclasslarge__number_html_a2f5571e66305cf68bb8283e4aeda58bc"><div class="ttname"><a href="#a2f5571e66305cf68bb8283e4aeda58bc">large_number::multiply</a></div><div class="ttdeci">void multiply(const T n)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d86/large__number_8h_source.html#l00258">large_number.h:258</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4757697b1f7584b69e779a72abc4ae2a" name="a4757697b1f7584b69e779a72abc4ae2a"></a>
@@ -572,6 +570,8 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>operator overload to increment (prefix) </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00175">175</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  175</span>                               {</div>
 <div class="line"><span class="lineno">  176</span>        (*this) += 1;</div>
 <div class="line"><span class="lineno">  177</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -602,12 +602,14 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>operator overload to increment (postfix) </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00183">183</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  183</span>                                  {</div>
 <div class="line"><span class="lineno">  184</span>        <span class="keyword">static</span> <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> tmp(<a class="code hl_variable" href="#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>);</div>
 <div class="line"><span class="lineno">  185</span>        ++(*this);</div>
 <div class="line"><span class="lineno">  186</span>        <span class="keywordflow">return</span> tmp;</div>
 <div class="line"><span class="lineno">  187</span>    }</div>
-<div class="ttc" id="aclasslarge__number_html"><div class="ttname"><a href="../../db/d82/classlarge__number.html">large_number</a></div><div class="ttdef"><b>Definition</b> large_number.h:24</div></div>
+<div class="ttc" id="aclasslarge__number_html"><div class="ttname"><a href="../../db/d82/classlarge__number.html">large_number</a></div><div class="ttdef"><b>Definition</b> <a href="../../d4/d86/large__number_8h_source.html#l00024">large_number.h:24</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -633,8 +635,10 @@ Here is the call graph for this function:</div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00212">212</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  212</span>{ <span class="keywordflow">return</span> (*<span class="keyword">this</span>) += <a class="code hl_function" href="#a10119a83839e65962621b73df46a5337">large_number</a>(n); }</div>
-<div class="ttc" id="aclasslarge__number_html_a10119a83839e65962621b73df46a5337"><div class="ttname"><a href="#a10119a83839e65962621b73df46a5337">large_number::large_number</a></div><div class="ttdeci">large_number()</div><div class="ttdef"><b>Definition</b> large_number.h:27</div></div>
+<div class="ttc" id="aclasslarge__number_html_a10119a83839e65962621b73df46a5337"><div class="ttname"><a href="#a10119a83839e65962621b73df46a5337">large_number::large_number</a></div><div class="ttdeci">large_number()</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d86/large__number_8h_source.html#l00027">large_number.h:27</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -661,10 +665,12 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>operator overload to add </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00192">192</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  192</span>                                             {</div>
 <div class="line"><span class="lineno">  193</span>        <span class="comment">// if adding with another large_number</span></div>
 <div class="line"><span class="lineno">  194</span>        <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> *b = <span class="keyword">reinterpret_cast&lt;</span><a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> *<span class="keyword">&gt;</span>(&amp;n);</div>
-<div class="line"><span class="lineno">  195</span>        <span class="keyword">const</span> <span class="keywordtype">size_t</span> max_L = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(this-&gt;<a class="code hl_function" href="#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>(), b-&gt;<a class="code hl_function" href="#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>());</div>
+<div class="line"><span class="lineno">  195</span>        <span class="keyword">const</span> <span class="keywordtype">size_t</span> max_L = std::max(this-&gt;<a class="code hl_function" href="#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>(), b-&gt;<a class="code hl_function" href="#ac09a05ec4aafb4d9e0b4440d6f0e2a93">num_digits</a>());</div>
 <div class="line"><span class="lineno">  196</span>        <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> carry = 0;</div>
 <div class="line"><span class="lineno">  197</span>        <span class="keywordtype">size_t</span> i;</div>
 <div class="line"><span class="lineno">  198</span>        <span class="keywordflow">for</span> (i = 0; i &lt; max_L || carry != 0; i++) {</div>
@@ -680,13 +686,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  208</span>        }</div>
 <div class="line"><span class="lineno">  209</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  210</span>    }</div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-</div><!-- 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="../../db/d82/classlarge__number_aab5644405094740e34983cedfecb36cf_cgraph.svg" width="602" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ab84f29685709cbb3b6fd29b7b4a7bc7b" name="ab84f29685709cbb3b6fd29b7b4a7bc7b"></a>
@@ -712,6 +712,8 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>assignment operator </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00229">229</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  229</span>                                                   {</div>
 <div class="line"><span class="lineno">  230</span>        this-&gt;<a class="code hl_variable" href="#af2b3ec9c35842d3a46ac7326f268af57">_digits</a> = b.<a class="code hl_variable" href="#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>;</div>
 <div class="line"><span class="lineno">  231</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -742,6 +744,8 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>operator over load to access the i^th digit conveniently and also assign value to it </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00137">137</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  137</span>{ <span class="keywordflow">return</span> this-&gt;<a class="code hl_variable" href="#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>[n]; }</div>
 </div><!-- fragment -->
 </div>
@@ -768,6 +772,8 @@ Here is the call graph for this function:</div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00139">139</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  139</span>                                                           {</div>
 <div class="line"><span class="lineno">  140</span>        <span class="keywordflow">return</span> this-&gt;<a class="code hl_variable" href="#af2b3ec9c35842d3a46ac7326f268af57">_digits</a>[n];</div>
 <div class="line"><span class="lineno">  141</span>    }</div>
@@ -797,62 +803,58 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Function to check implementation </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00065">65</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   65</span>                       {</div>
-<div class="line"><span class="lineno">   66</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;------ Checking `large_number` class implementations\t&quot;</span></div>
-<div class="line"><span class="lineno">   67</span>                  &lt;&lt; <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">   66</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;------ Checking `large_number` class implementations\t&quot;</span></div>
+<div class="line"><span class="lineno">   67</span>                  &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   68</span>        <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> a(40);</div>
 <div class="line"><span class="lineno">   69</span>        <span class="comment">// 1. test multiplication</span></div>
 <div class="line"><span class="lineno">   70</span>        a *= 10;</div>
 <div class="line"><span class="lineno">   71</span>        <span class="keywordflow">if</span> (a != <a class="code hl_function" href="#a10119a83839e65962621b73df46a5337">large_number</a>(400)) {</div>
-<div class="line"><span class="lineno">   72</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;\tFailed 1/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=400)&quot;</span> &lt;&lt; <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">   72</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;\tFailed 1/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=400)&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   73</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   74</span>        }</div>
-<div class="line"><span class="lineno">   75</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tPassed 1/6...&quot;</span>;</div>
+<div class="line"><span class="lineno">   75</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\tPassed 1/6...&quot;</span>;</div>
 <div class="line"><span class="lineno">   76</span>        <span class="comment">// 2. test compound addition with integer</span></div>
 <div class="line"><span class="lineno">   77</span>        a += 120;</div>
 <div class="line"><span class="lineno">   78</span>        <span class="keywordflow">if</span> (a != <a class="code hl_function" href="#a10119a83839e65962621b73df46a5337">large_number</a>(520)) {</div>
-<div class="line"><span class="lineno">   79</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;\tFailed 2/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=520)&quot;</span> &lt;&lt; <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">   79</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;\tFailed 2/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=520)&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   80</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   81</span>        }</div>
-<div class="line"><span class="lineno">   82</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tPassed 2/6...&quot;</span>;</div>
+<div class="line"><span class="lineno">   82</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\tPassed 2/6...&quot;</span>;</div>
 <div class="line"><span class="lineno">   83</span>        <span class="comment">// 3. test compound multiplication again</span></div>
 <div class="line"><span class="lineno">   84</span>        a *= 10;</div>
 <div class="line"><span class="lineno">   85</span>        <span class="keywordflow">if</span> (a != <a class="code hl_function" href="#a10119a83839e65962621b73df46a5337">large_number</a>(5200)) {</div>
-<div class="line"><span class="lineno">   86</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;\tFailed 3/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=5200)&quot;</span> &lt;&lt; <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">   86</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;\tFailed 3/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=5200)&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   87</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</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/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tPassed 3/6...&quot;</span>;</div>
+<div class="line"><span class="lineno">   89</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\tPassed 3/6...&quot;</span>;</div>
 <div class="line"><span class="lineno">   90</span>        <span class="comment">// 4. test increment (prefix)</span></div>
 <div class="line"><span class="lineno">   91</span>        ++a;</div>
 <div class="line"><span class="lineno">   92</span>        <span class="keywordflow">if</span> (a != <a class="code hl_function" href="#a10119a83839e65962621b73df46a5337">large_number</a>(5201)) {</div>
-<div class="line"><span class="lineno">   93</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;\tFailed 4/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=5201)&quot;</span> &lt;&lt; <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">   93</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;\tFailed 4/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=5201)&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   94</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   95</span>        }</div>
-<div class="line"><span class="lineno">   96</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tPassed 4/6...&quot;</span>;</div>
+<div class="line"><span class="lineno">   96</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\tPassed 4/6...&quot;</span>;</div>
 <div class="line"><span class="lineno">   97</span>        <span class="comment">// 5. test increment (postfix)</span></div>
 <div class="line"><span class="lineno">   98</span>        a++;</div>
 <div class="line"><span class="lineno">   99</span>        <span class="keywordflow">if</span> (a != <a class="code hl_function" href="#a10119a83839e65962621b73df46a5337">large_number</a>(5202)) {</div>
-<div class="line"><span class="lineno">  100</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;\tFailed 5/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=5202)&quot;</span> &lt;&lt; <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">  100</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;\tFailed 5/6 (&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;!=5202)&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  101</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  102</span>        }</div>
-<div class="line"><span class="lineno">  103</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tPassed 5/6...&quot;</span>;</div>
+<div class="line"><span class="lineno">  103</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\tPassed 5/6...&quot;</span>;</div>
 <div class="line"><span class="lineno">  104</span>        <span class="comment">// 6. test addition with another large number</span></div>
 <div class="line"><span class="lineno">  105</span>        a = a + <a class="code hl_function" href="#a10119a83839e65962621b73df46a5337">large_number</a>(<span class="stringliteral">&quot;7000000000000000000000000000000&quot;</span>);</div>
 <div class="line"><span class="lineno">  106</span>        <span class="keywordflow">if</span> (a != <a class="code hl_function" href="#a10119a83839e65962621b73df46a5337">large_number</a>(<span class="stringliteral">&quot;7000000000000000000000000005202&quot;</span>)) {</div>
-<div class="line"><span class="lineno">  107</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;\tFailed 6/6 (&quot;</span> &lt;&lt; a</div>
-<div class="line"><span class="lineno">  108</span>                      &lt;&lt; <span class="stringliteral">&quot;!=7000000000000000000000000005202)&quot;</span> &lt;&lt; <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">  107</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;\tFailed 6/6 (&quot;</span> &lt;&lt; a</div>
+<div class="line"><span class="lineno">  108</span>                      &lt;&lt; <span class="stringliteral">&quot;!=7000000000000000000000000005202)&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  109</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  110</span>        }</div>
-<div class="line"><span class="lineno">  111</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tPassed 6/6...&quot;</span> &lt;&lt; <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">  111</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\tPassed 6/6...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  112</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  113</span>    }</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><!-- 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="../../db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.svg" width="526" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Friends And Related Symbol Documentation</h2>
@@ -883,6 +885,8 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>operator overload to compare two numbers </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00168">168</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  168</span>                                                                         {</div>
 <div class="line"><span class="lineno">  169</span>        <span class="keywordflow">return</span> !(a == b);</div>
 <div class="line"><span class="lineno">  170</span>    }</div>
@@ -918,6 +922,8 @@ template&lt;class T &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>operator overload to perform addition </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00220">220</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  220</span>                                                                      {</div>
 <div class="line"><span class="lineno">  221</span>        <span class="keyword">static</span> <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> c = a;</div>
 <div class="line"><span class="lineno">  222</span>        c += b;</div>
@@ -936,9 +942,9 @@ template&lt;class T &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; operator&lt;&lt; </td>
+          <td class="memname">std::ostream &amp; operator&lt;&lt; </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
+          <td class="paramtype">std::ostream &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -953,6 +959,8 @@ template&lt;class T &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>operator overload to compare two numbers </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00146">146</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  146</span>                                                                          {</div>
 <div class="line"><span class="lineno">  147</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = a.num_digits(); i &gt; 0; i--)</div>
 <div class="line"><span class="lineno">  148</span>            out &lt;&lt; static_cast&lt;int&gt;(a[i - 1]);</div>
@@ -988,6 +996,8 @@ template&lt;class T &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>operator overload to compare two numbers </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00155">155</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  155</span>                                                                         {</div>
 <div class="line"><span class="lineno">  156</span>        <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = a.num_digits();</div>
 <div class="line"><span class="lineno">  157</span>        <span class="keywordflow">if</span> (N != b.num_digits())</div>
@@ -997,7 +1007,7 @@ template&lt;class T &gt; </div>
 <div class="line"><span class="lineno">  161</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  162</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  163</span>    }</div>
-<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -1012,7 +1022,7 @@ template&lt;class T &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;unsigned char&gt; large_number::_digits</td>
+          <td class="memname">std::vector&lt;unsigned char&gt; large_number::_digits</td>
         </tr>
       </table>
   </td>
@@ -1023,6 +1033,8 @@ template&lt;class T &gt; </div>
 </div><div class="memdoc">
 <p>where individual digits are stored </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/d86/large__number_8h_source.html#l00285">285</a> of file <a class="el" href="../../d4/d86/large__number_8h_source.html">large_number.h</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
diff --git a/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.map b/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.map
deleted file mode 100644
index 2102bf426..000000000
--- a/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="large_number::large_number" name="large_number::large_number">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,141,46"/>
-<area shape="rect" id="Node000002" 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="189,13,343,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="141,23,173,23,173,28,141,28"/>
-</map>
diff --git a/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.md5 b/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.md5
deleted file mode 100644
index b093cff88..000000000
--- a/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8c538e4a2cfead881160513e0433f9c8
\ No newline at end of file
diff --git a/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.svg b/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.svg
deleted file mode 100644
index 3788d22d3..000000000
--- a/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: large_number::large_number Pages: 1 -->
-<svg width="261pt" height="39pt"
- viewBox="0.00 0.00 261.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>large_number::large_number</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="101.5,-30.5 0,-30.5 0,0 101.5,0 101.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::large</text>
-<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_number</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.25,-24.88 137.5,-24.88 137.5,-5.63 253.25,-5.63 253.25,-24.88"/>
-<text text-anchor="middle" x="195.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.63,-15.25C109.5,-15.25 117.74,-15.25 125.94,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.93,-18.75 135.93,-15.25 125.93,-11.75 125.93,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph_org.svg b/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph_org.svg
deleted file mode 100644
index ca57b4306..000000000
--- a/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: large_number::large_number Pages: 1 -->
-<svg width="261pt" height="39pt"
- viewBox="0.00 0.00 261.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>large_number::large_number</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="101.5,-30.5 0,-30.5 0,0 101.5,0 101.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::large</text>
-<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_number</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.25,-24.88 137.5,-24.88 137.5,-5.63 253.25,-5.63 253.25,-24.88"/>
-<text text-anchor="middle" x="195.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.63,-15.25C109.5,-15.25 117.74,-15.25 125.94,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.93,-18.75 135.93,-15.25 125.93,-11.75 125.93,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.map b/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.map
deleted file mode 100644
index ef25d6e9e..000000000
--- a/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="large_number::multiply" name="large_number::multiply">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,158,56"/>
-<area shape="rect" id="Node000002" href="$db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615" title=" " alt="" coords="211,5,370,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="158,32,195,27,196,32,158,37"/>
-<area shape="rect" id="Node000004" href="$db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93" title=" " alt="" coords="206,55,376,80"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="158,50,190,53,190,59,158,55"/>
-<area shape="rect" id="Node000003" 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="424,5,578,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="371,16,408,16,408,21,371,21"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="444,55,559,80"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="377,65,428,65,428,70,377,70"/>
-</map>
diff --git a/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.md5 b/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.md5
deleted file mode 100644
index 170f6a489..000000000
--- a/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fa0b778045388a6447a1c26c3d44a435
\ No newline at end of file
diff --git a/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.svg b/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.svg
deleted file mode 100644
index 8c78dea60..000000000
--- a/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: large_number::multiply Pages: 1 -->
-<svg width="438pt" height="64pt"
- viewBox="0.00 0.00 437.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>large_number::multiply</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="114.25,-37.25 0,-37.25 0,-18 114.25,-18 114.25,-37.25"/>
-<text text-anchor="middle" x="57.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273.88,-56.25 154.38,-56.25 154.38,-37 273.88,-37 273.88,-56.25"/>
-<text text-anchor="middle" x="214.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::add_digit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.52,-34.54C123.63,-35.65 133.16,-36.82 142.55,-37.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.05,-41.44 152.4,-39.18 142.9,-34.49 142.05,-41.44"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278,-19.25 150.25,-19.25 150.25,0 278,0 278,-19.25"/>
-<text text-anchor="middle" x="214.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::num_digits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.52,-21.08C122.35,-20.17 130.48,-19.22 138.57,-18.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.92,-21.77 148.45,-17.14 138.11,-14.81 138.92,-21.77"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="429.75,-56.25 314,-56.25 314,-37 429.75,-37 429.75,-56.25"/>
-<text text-anchor="middle" x="371.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.01,-46.62C283.26,-46.62 292.88,-46.62 302.33,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="302.2,-50.13 312.2,-46.63 302.2,-43.13 302.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415.12,-19.25 328.62,-19.25 328.62,0 415.12,0 415.12,-19.25"/>
-<text text-anchor="middle" x="371.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.47,-9.62C291.37,-9.62 304.82,-9.62 317.33,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.01,-13.13 327.01,-9.63 317.01,-6.13 317.01,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph_org.svg b/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph_org.svg
deleted file mode 100644
index d083feaec..000000000
--- a/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: large_number::multiply Pages: 1 -->
-<svg width="438pt" height="64pt"
- viewBox="0.00 0.00 437.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>large_number::multiply</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="114.25,-37.25 0,-37.25 0,-18 114.25,-18 114.25,-37.25"/>
-<text text-anchor="middle" x="57.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273.88,-56.25 154.38,-56.25 154.38,-37 273.88,-37 273.88,-56.25"/>
-<text text-anchor="middle" x="214.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::add_digit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.52,-34.54C123.63,-35.65 133.16,-36.82 142.55,-37.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.05,-41.44 152.4,-39.18 142.9,-34.49 142.05,-41.44"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278,-19.25 150.25,-19.25 150.25,0 278,0 278,-19.25"/>
-<text text-anchor="middle" x="214.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::num_digits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.52,-21.08C122.35,-20.17 130.48,-19.22 138.57,-18.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.92,-21.77 148.45,-17.14 138.11,-14.81 138.92,-21.77"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="429.75,-56.25 314,-56.25 314,-37 429.75,-37 429.75,-56.25"/>
-<text text-anchor="middle" x="371.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.01,-46.62C283.26,-46.62 292.88,-46.62 302.33,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="302.2,-50.13 312.2,-46.63 302.2,-43.13 302.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415.12,-19.25 328.62,-19.25 328.62,0 415.12,0 415.12,-19.25"/>
-<text text-anchor="middle" x="371.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.47,-9.62C291.37,-9.62 304.82,-9.62 317.33,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.01,-13.13 327.01,-9.63 317.01,-6.13 317.01,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.map b/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.map
deleted file mode 100644
index d6890f228..000000000
--- a/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="large_number::add_digit" name="large_number::add_digit">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,165,31"/>
-<area shape="rect" id="Node000002" 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="213,5,367,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="165,16,197,16,197,21,165,21"/>
-</map>
diff --git a/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.md5 b/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.md5
deleted file mode 100644
index f921c833f..000000000
--- a/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b6b0a094e2d9c0c260cadf8038202948
\ No newline at end of file
diff --git a/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.svg b/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.svg
deleted file mode 100644
index 0a9925e83..000000000
--- a/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: large_number::add_digit Pages: 1 -->
-<svg width="279pt" height="27pt"
- viewBox="0.00 0.00 279.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>large_number::add_digit</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="119.5,-19.25 0,-19.25 0,0 119.5,0 119.5,-19.25"/>
-<text text-anchor="middle" x="59.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::add_digit</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.25,-19.25 155.5,-19.25 155.5,0 271.25,0 271.25,-19.25"/>
-<text text-anchor="middle" x="213.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.81,-9.62C127.72,-9.62 135.89,-9.62 143.94,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.71,-13.13 153.71,-9.63 143.71,-6.13 143.71,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph_org.svg b/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph_org.svg
deleted file mode 100644
index 78bc1aaee..000000000
--- a/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: large_number::add_digit Pages: 1 -->
-<svg width="279pt" height="27pt"
- viewBox="0.00 0.00 279.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>large_number::add_digit</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="119.5,-19.25 0,-19.25 0,0 119.5,0 119.5,-19.25"/>
-<text text-anchor="middle" x="59.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::add_digit</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.25,-19.25 155.5,-19.25 155.5,0 271.25,0 271.25,-19.25"/>
-<text text-anchor="middle" x="213.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.81,-9.62C127.72,-9.62 135.89,-9.62 143.94,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.71,-13.13 153.71,-9.63 143.71,-6.13 143.71,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d82/classlarge__number_a771e9b28cfddf1ad94668566e396e350_cgraph.map b/db/d82/classlarge__number_a771e9b28cfddf1ad94668566e396e350_cgraph.map
deleted file mode 100644
index 931f76938..000000000
--- a/db/d82/classlarge__number_a771e9b28cfddf1ad94668566e396e350_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="large_number::operator*=" name="large_number::operator*=">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,173,56"/>
-<area shape="rect" id="Node000002" href="$db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc" title=" " alt="" coords="221,31,373,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="173,41,205,41,205,46,173,46"/>
-<area shape="rect" id="Node000003" href="$db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615" title=" " alt="" coords="426,5,586,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="373,32,410,27,411,32,374,37"/>
-<area shape="rect" id="Node000005" href="$db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93" title=" " alt="" coords="421,55,591,80"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="374,50,406,53,405,59,373,55"/>
-<area shape="rect" id="Node000004" 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="639,5,794,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="586,16,624,16,624,21,586,21"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="659,55,774,80"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="592,65,644,65,644,70,592,70"/>
-</map>
diff --git a/db/d82/classlarge__number_a771e9b28cfddf1ad94668566e396e350_cgraph.md5 b/db/d82/classlarge__number_a771e9b28cfddf1ad94668566e396e350_cgraph.md5
deleted file mode 100644
index c8e724f9a..000000000
--- a/db/d82/classlarge__number_a771e9b28cfddf1ad94668566e396e350_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-91396755b0819878bcb0c7854c3430e0
\ No newline at end of file
diff --git a/db/d82/classlarge__number_a771e9b28cfddf1ad94668566e396e350_cgraph.svg b/db/d82/classlarge__number_a771e9b28cfddf1ad94668566e396e350_cgraph.svg
deleted file mode 100644
index 3794b0c36..000000000
--- a/db/d82/classlarge__number_a771e9b28cfddf1ad94668566e396e350_cgraph.svg
+++ /dev/null
@@ -1,194 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: large_number::operator*= Pages: 1 -->
-<!--zoomable 64 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 599;
-var viewHeight = 64;
-var sectionId = 'dynsection-7';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>large_number::operator*=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="125.5,-37.25 0,-37.25 0,-18 125.5,-18 125.5,-37.25"/>
-<text text-anchor="middle" x="62.75" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::operator*=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275.75,-37.25 161.5,-37.25 161.5,-18 275.75,-18 275.75,-37.25"/>
-<text text-anchor="middle" x="218.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.89,-27.62C133.74,-27.62 141.8,-27.62 149.73,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.7,-31.13 159.7,-27.63 149.7,-24.13 149.7,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="435.38,-56.25 315.88,-56.25 315.88,-37 435.38,-37 435.38,-56.25"/>
-<text text-anchor="middle" x="375.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::add_digit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M276.02,-34.54C285.13,-35.65 294.66,-36.82 304.05,-37.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="303.55,-41.44 313.9,-39.18 304.4,-34.49 303.55,-41.44"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="439.5,-19.25 311.75,-19.25 311.75,0 439.5,0 439.5,-19.25"/>
-<text text-anchor="middle" x="375.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::num_digits</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M276.02,-21.08C283.85,-20.17 291.98,-19.22 300.07,-18.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.42,-21.77 309.95,-17.14 299.61,-14.81 300.42,-21.77"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="591.25,-56.25 475.5,-56.25 475.5,-37 591.25,-37 591.25,-56.25"/>
-<text text-anchor="middle" x="533.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M435.51,-46.62C444.76,-46.62 454.38,-46.62 463.83,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="463.7,-50.13 473.7,-46.63 463.7,-43.13 463.7,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="576.62,-19.25 490.12,-19.25 490.12,0 576.62,0 576.62,-19.25"/>
-<text text-anchor="middle" x="533.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M439.97,-9.62C452.87,-9.62 466.32,-9.62 478.83,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="478.51,-13.13 488.51,-9.63 478.51,-6.13 478.51,-13.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classlarge__number_a771e9b28cfddf1ad94668566e396e350_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d82/classlarge__number_a771e9b28cfddf1ad94668566e396e350_cgraph_org.svg b/db/d82/classlarge__number_a771e9b28cfddf1ad94668566e396e350_cgraph_org.svg
deleted file mode 100644
index 33d8283f1..000000000
--- a/db/d82/classlarge__number_a771e9b28cfddf1ad94668566e396e350_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: large_number::operator*= Pages: 1 -->
-<svg width="599pt" height="64pt"
- viewBox="0.00 0.00 599.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>large_number::operator*=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="125.5,-37.25 0,-37.25 0,-18 125.5,-18 125.5,-37.25"/>
-<text text-anchor="middle" x="62.75" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::operator*=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275.75,-37.25 161.5,-37.25 161.5,-18 275.75,-18 275.75,-37.25"/>
-<text text-anchor="middle" x="218.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.89,-27.62C133.74,-27.62 141.8,-27.62 149.73,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.7,-31.13 159.7,-27.63 149.7,-24.13 149.7,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="435.38,-56.25 315.88,-56.25 315.88,-37 435.38,-37 435.38,-56.25"/>
-<text text-anchor="middle" x="375.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::add_digit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M276.02,-34.54C285.13,-35.65 294.66,-36.82 304.05,-37.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="303.55,-41.44 313.9,-39.18 304.4,-34.49 303.55,-41.44"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="439.5,-19.25 311.75,-19.25 311.75,0 439.5,0 439.5,-19.25"/>
-<text text-anchor="middle" x="375.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::num_digits</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M276.02,-21.08C283.85,-20.17 291.98,-19.22 300.07,-18.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.42,-21.77 309.95,-17.14 299.61,-14.81 300.42,-21.77"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="591.25,-56.25 475.5,-56.25 475.5,-37 591.25,-37 591.25,-56.25"/>
-<text text-anchor="middle" x="533.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M435.51,-46.62C444.76,-46.62 454.38,-46.62 463.83,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="463.7,-50.13 473.7,-46.63 463.7,-43.13 463.7,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="576.62,-19.25 490.12,-19.25 490.12,0 576.62,0 576.62,-19.25"/>
-<text text-anchor="middle" x="533.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M439.97,-9.62C452.87,-9.62 466.32,-9.62 478.83,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="478.51,-13.13 488.51,-9.63 478.51,-6.13 478.51,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.map b/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.map
deleted file mode 100644
index fc162dc33..000000000
--- a/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="large_number::test" name="large_number::test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,35,135,60"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="215,5,286,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="135,34,199,24,200,29,135,40"/>
-<area shape="rect" id="Node000003" href="$db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337" title=" " alt="" coords="183,55,318,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="135,55,168,60,167,65,135,60"/>
-<area shape="rect" id="Node000004" 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="366,63,520,88"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="318,73,351,73,351,78,318,78"/>
-</map>
diff --git a/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.md5 b/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.md5
deleted file mode 100644
index 9d92cdc86..000000000
--- a/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-49746fddd58445ebd7346624a9176212
\ No newline at end of file
diff --git a/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.svg b/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.svg
deleted file mode 100644
index a6d62e70f..000000000
--- a/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: large_number::test Pages: 1 -->
-<svg width="394pt" height="76pt"
- viewBox="0.00 0.00 394.25 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>large_number::test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="97,-45.88 0,-45.88 0,-26.62 97,-26.62 97,-45.88"/>
-<text text-anchor="middle" x="48.5" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="210.5,-67.88 157,-67.88 157,-48.62 210.5,-48.62 210.5,-67.88"/>
-<text text-anchor="middle" x="183.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.23,-44.13C113.18,-46.76 130.7,-49.66 145.71,-52.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.7,-55.52 155.14,-53.69 145.84,-48.61 144.7,-55.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.5,-30.5 133,-30.5 133,0 234.5,0 234.5,-30.5"/>
-<text text-anchor="start" x="141" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::large</text>
-<text text-anchor="middle" x="183.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_number</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.23,-28.73C105.05,-27.5 113.24,-26.2 121.33,-24.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="121.83,-28.39 131.16,-23.38 120.74,-21.48 121.83,-28.39"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="386.25,-24.88 270.5,-24.88 270.5,-5.63 386.25,-5.63 386.25,-24.88"/>
-<text text-anchor="middle" x="328.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.63,-15.25C242.5,-15.25 250.74,-15.25 258.94,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.93,-18.75 268.93,-15.25 258.93,-11.75 258.93,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph_org.svg b/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph_org.svg
deleted file mode 100644
index ccdf6dc7a..000000000
--- a/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph_org.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: large_number::test Pages: 1 -->
-<svg width="394pt" height="76pt"
- viewBox="0.00 0.00 394.25 75.88" 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 71.88)">
-<title>large_number::test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="97,-45.88 0,-45.88 0,-26.62 97,-26.62 97,-45.88"/>
-<text text-anchor="middle" x="48.5" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="210.5,-67.88 157,-67.88 157,-48.62 210.5,-48.62 210.5,-67.88"/>
-<text text-anchor="middle" x="183.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.23,-44.13C113.18,-46.76 130.7,-49.66 145.71,-52.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.7,-55.52 155.14,-53.69 145.84,-48.61 144.7,-55.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.5,-30.5 133,-30.5 133,0 234.5,0 234.5,-30.5"/>
-<text text-anchor="start" x="141" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::large</text>
-<text text-anchor="middle" x="183.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_number</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.23,-28.73C105.05,-27.5 113.24,-26.2 121.33,-24.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="121.83,-28.39 131.16,-23.38 120.74,-21.48 121.83,-28.39"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="386.25,-24.88 270.5,-24.88 270.5,-5.63 386.25,-5.63 386.25,-24.88"/>
-<text text-anchor="middle" x="328.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.63,-15.25C242.5,-15.25 250.74,-15.25 258.94,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.93,-18.75 268.93,-15.25 258.93,-11.75 258.93,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d82/classlarge__number_aab5644405094740e34983cedfecb36cf_cgraph.map b/db/d82/classlarge__number_aab5644405094740e34983cedfecb36cf_cgraph.map
deleted file mode 100644
index efe8ac1a8..000000000
--- a/db/d82/classlarge__number_aab5644405094740e34983cedfecb36cf_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="large_number::operator+=" name="large_number::operator+=">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,176,80"/>
-<area shape="rect" id="Node000002" href="$db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615" title=" " alt="" coords="229,5,388,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="150,51,233,32,235,38,151,57"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="273,55,345,80"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="176,65,257,65,257,70,176,70"/>
-<area shape="rect" id="Node000005" href="$db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93" title=" " alt="" coords="224,104,394,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="151,78,235,97,233,103,150,84"/>
-<area shape="rect" id="Node000003" 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="442,5,596,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="389,16,426,16,426,21,389,21"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="462,104,577,130"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="395,114,446,114,446,120,395,120"/>
-</map>
diff --git a/db/d82/classlarge__number_aab5644405094740e34983cedfecb36cf_cgraph.md5 b/db/d82/classlarge__number_aab5644405094740e34983cedfecb36cf_cgraph.md5
deleted file mode 100644
index e9c755cb7..000000000
--- a/db/d82/classlarge__number_aab5644405094740e34983cedfecb36cf_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4433ac250640efe22c4e70de0905656e
\ No newline at end of file
diff --git a/db/d82/classlarge__number_aab5644405094740e34983cedfecb36cf_cgraph.svg b/db/d82/classlarge__number_aab5644405094740e34983cedfecb36cf_cgraph.svg
deleted file mode 100644
index 868cc540c..000000000
--- a/db/d82/classlarge__number_aab5644405094740e34983cedfecb36cf_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: large_number::operator+= Pages: 1 -->
-<svg width="451pt" height="101pt"
- viewBox="0.00 0.00 451.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>large_number::operator+=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127.75,-56.25 0,-56.25 0,-37 127.75,-37 127.75,-56.25"/>
-<text text-anchor="middle" x="63.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::operator+=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="287.38,-93.25 167.88,-93.25 167.88,-74 287.38,-74 287.38,-93.25"/>
-<text text-anchor="middle" x="227.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::add_digit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.07,-56.74C128.33,-61.14 151.11,-66.35 171.46,-71.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.48,-74.37 181,-73.19 172.04,-67.55 170.48,-74.37"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-56.25 200.5,-56.25 200.5,-37 254.75,-37 254.75,-56.25"/>
-<text text-anchor="middle" x="227.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.87,-46.62C148.54,-46.62 170.84,-46.62 189.02,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.79,-50.13 198.79,-46.63 188.79,-43.13 188.79,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.5,-19.25 163.75,-19.25 163.75,0 291.5,0 291.5,-19.25"/>
-<text text-anchor="middle" x="227.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::num_digits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.07,-36.51C128.33,-32.11 151.11,-26.9 171.46,-22.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.04,-25.7 181,-20.06 170.48,-18.88 172.04,-25.7"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="443.25,-93.25 327.5,-93.25 327.5,-74 443.25,-74 443.25,-93.25"/>
-<text text-anchor="middle" x="385.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M287.51,-83.62C296.76,-83.62 306.38,-83.62 315.83,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.7,-87.13 325.7,-83.63 315.7,-80.13 315.7,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="428.62,-19.25 342.12,-19.25 342.12,0 428.62,0 428.62,-19.25"/>
-<text text-anchor="middle" x="385.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M291.97,-9.62C304.87,-9.62 318.32,-9.62 330.83,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="330.51,-13.13 340.51,-9.63 330.51,-6.13 330.51,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d82/classlarge__number_aab5644405094740e34983cedfecb36cf_cgraph_org.svg b/db/d82/classlarge__number_aab5644405094740e34983cedfecb36cf_cgraph_org.svg
deleted file mode 100644
index d8e726770..000000000
--- a/db/d82/classlarge__number_aab5644405094740e34983cedfecb36cf_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: large_number::operator+= Pages: 1 -->
-<svg width="451pt" height="101pt"
- viewBox="0.00 0.00 451.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>large_number::operator+=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127.75,-56.25 0,-56.25 0,-37 127.75,-37 127.75,-56.25"/>
-<text text-anchor="middle" x="63.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::operator+=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="287.38,-93.25 167.88,-93.25 167.88,-74 287.38,-74 287.38,-93.25"/>
-<text text-anchor="middle" x="227.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::add_digit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.07,-56.74C128.33,-61.14 151.11,-66.35 171.46,-71.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.48,-74.37 181,-73.19 172.04,-67.55 170.48,-74.37"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-56.25 200.5,-56.25 200.5,-37 254.75,-37 254.75,-56.25"/>
-<text text-anchor="middle" x="227.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.87,-46.62C148.54,-46.62 170.84,-46.62 189.02,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.79,-50.13 198.79,-46.63 188.79,-43.13 188.79,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.5,-19.25 163.75,-19.25 163.75,0 291.5,0 291.5,-19.25"/>
-<text text-anchor="middle" x="227.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::num_digits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.07,-36.51C128.33,-32.11 151.11,-26.9 171.46,-22.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.04,-25.7 181,-20.06 170.48,-18.88 172.04,-25.7"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="443.25,-93.25 327.5,-93.25 327.5,-74 443.25,-74 443.25,-93.25"/>
-<text text-anchor="middle" x="385.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M287.51,-83.62C296.76,-83.62 306.38,-83.62 315.83,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.7,-87.13 325.7,-83.63 315.7,-80.13 315.7,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="428.62,-19.25 342.12,-19.25 342.12,0 428.62,0 428.62,-19.25"/>
-<text text-anchor="middle" x="385.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M291.97,-9.62C304.87,-9.62 318.32,-9.62 330.83,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="330.51,-13.13 340.51,-9.63 330.51,-6.13 330.51,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d82/classlarge__number_ac09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph.map b/db/d82/classlarge__number_ac09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph.map
deleted file mode 100644
index 5705a49b9..000000000
--- a/db/d82/classlarge__number_ac09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="large_number::num_digits" name="large_number::num_digits">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,176,31"/>
-<area shape="rect" id="Node000002" 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,5,339,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="176,16,208,16,208,21,176,21"/>
-</map>
diff --git a/db/d82/classlarge__number_ac09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph.md5 b/db/d82/classlarge__number_ac09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph.md5
deleted file mode 100644
index 26971f850..000000000
--- a/db/d82/classlarge__number_ac09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ac258cd0e7a40303d6135022b6aed846
\ No newline at end of file
diff --git a/db/d82/classlarge__number_ac09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph.svg b/db/d82/classlarge__number_ac09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph.svg
deleted file mode 100644
index c3ecc69c6..000000000
--- a/db/d82/classlarge__number_ac09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: large_number::num_digits Pages: 1 -->
-<svg width="258pt" height="27pt"
- viewBox="0.00 0.00 258.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>large_number::num_digits</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127.75,-19.25 0,-19.25 0,0 127.75,0 127.75,-19.25"/>
-<text text-anchor="middle" x="63.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::num_digits</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="250.25,-19.25 163.75,-19.25 163.75,0 250.25,0 250.25,-19.25"/>
-<text text-anchor="middle" x="207" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.01,-9.62C136.09,-9.62 144.31,-9.62 152.23,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.05,-13.13 162.05,-9.63 152.05,-6.13 152.05,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d82/classlarge__number_ac09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph_org.svg b/db/d82/classlarge__number_ac09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph_org.svg
deleted file mode 100644
index a354425f5..000000000
--- a/db/d82/classlarge__number_ac09a05ec4aafb4d9e0b4440d6f0e2a93_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: large_number::num_digits Pages: 1 -->
-<svg width="258pt" height="27pt"
- viewBox="0.00 0.00 258.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>large_number::num_digits</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="127.75,-19.25 0,-19.25 0,0 127.75,0 127.75,-19.25"/>
-<text text-anchor="middle" x="63.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::num_digits</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="250.25,-19.25 163.75,-19.25 163.75,0 250.25,0 250.25,-19.25"/>
-<text text-anchor="middle" x="207" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.01,-9.62C136.09,-9.62 144.31,-9.62 152.23,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.05,-13.13 162.05,-9.63 152.05,-6.13 152.05,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d82/classlarge__number_ae35a55607cf52c0b0d485f2129bd39ac_cgraph.map b/db/d82/classlarge__number_ae35a55607cf52c0b0d485f2129bd39ac_cgraph.map
deleted file mode 100644
index 4ffb757b2..000000000
--- a/db/d82/classlarge__number_ae35a55607cf52c0b0d485f2129bd39ac_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="large_number::digit_char" name="large_number::digit_char">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,169,31"/>
-<area shape="rect" id="Node000002" href="$db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93" title=" " alt="" coords="217,5,387,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="169,16,201,16,201,21,169,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="435,5,550,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="387,16,420,16,420,21,387,21"/>
-</map>
diff --git a/db/d82/classlarge__number_ae35a55607cf52c0b0d485f2129bd39ac_cgraph.md5 b/db/d82/classlarge__number_ae35a55607cf52c0b0d485f2129bd39ac_cgraph.md5
deleted file mode 100644
index 023b5c397..000000000
--- a/db/d82/classlarge__number_ae35a55607cf52c0b0d485f2129bd39ac_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c797a29c819be3760ae8821b138d6dd0
\ No newline at end of file
diff --git a/db/d82/classlarge__number_ae35a55607cf52c0b0d485f2129bd39ac_cgraph.svg b/db/d82/classlarge__number_ae35a55607cf52c0b0d485f2129bd39ac_cgraph.svg
deleted file mode 100644
index b2d163700..000000000
--- a/db/d82/classlarge__number_ae35a55607cf52c0b0d485f2129bd39ac_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: large_number::digit_char Pages: 1 -->
-<svg width="417pt" height="27pt"
- viewBox="0.00 0.00 416.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>large_number::digit_char</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="122.5,-19.25 0,-19.25 0,0 122.5,0 122.5,-19.25"/>
-<text text-anchor="middle" x="61.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::digit_char</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="286.25,-19.25 158.5,-19.25 158.5,0 286.25,0 286.25,-19.25"/>
-<text text-anchor="middle" x="222.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::num_digits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.86,-9.62C130.68,-9.62 138.76,-9.62 146.77,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.51,-13.13 156.51,-9.63 146.51,-6.13 146.51,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408.75,-19.25 322.25,-19.25 322.25,0 408.75,0 408.75,-19.25"/>
-<text text-anchor="middle" x="365.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M286.51,-9.62C294.59,-9.62 302.81,-9.62 310.73,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="310.55,-13.13 320.55,-9.63 310.55,-6.13 310.55,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d82/classlarge__number_ae35a55607cf52c0b0d485f2129bd39ac_cgraph_org.svg b/db/d82/classlarge__number_ae35a55607cf52c0b0d485f2129bd39ac_cgraph_org.svg
deleted file mode 100644
index e3f042e76..000000000
--- a/db/d82/classlarge__number_ae35a55607cf52c0b0d485f2129bd39ac_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: large_number::digit_char Pages: 1 -->
-<svg width="417pt" height="27pt"
- viewBox="0.00 0.00 416.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>large_number::digit_char</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="122.5,-19.25 0,-19.25 0,0 122.5,0 122.5,-19.25"/>
-<text text-anchor="middle" x="61.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::digit_char</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="286.25,-19.25 158.5,-19.25 158.5,0 286.25,0 286.25,-19.25"/>
-<text text-anchor="middle" x="222.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::num_digits</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.86,-9.62C130.68,-9.62 138.76,-9.62 146.77,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.51,-13.13 156.51,-9.63 146.51,-6.13 146.51,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408.75,-19.25 322.25,-19.25 322.25,0 408.75,0 408.75,-19.25"/>
-<text text-anchor="middle" x="365.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M286.51,-9.62C294.59,-9.62 302.81,-9.62 310.73,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="310.55,-13.13 320.55,-9.63 310.55,-6.13 310.55,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.map b/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.map
deleted file mode 100644
index 8a9a03fea..000000000
--- a/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="large_number::large_number" name="large_number::large_number">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,141,46"/>
-<area shape="rect" id="Node000002" href="$db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615" title=" " alt="" coords="189,13,348,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="141,23,173,23,173,28,141,28"/>
-<area shape="rect" id="Node000003" 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="396,13,550,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="348,23,381,23,381,28,348,28"/>
-</map>
diff --git a/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.md5 b/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.md5
deleted file mode 100644
index 0317314ea..000000000
--- a/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b8a48d1866f18f63e0be3f4e7b25b411
\ No newline at end of file
diff --git a/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.svg b/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.svg
deleted file mode 100644
index 721dc9e27..000000000
--- a/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: large_number::large_number Pages: 1 -->
-<svg width="417pt" height="39pt"
- viewBox="0.00 0.00 416.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>large_number::large_number</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="101.5,-30.5 0,-30.5 0,0 101.5,0 101.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::large</text>
-<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_number</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257,-24.88 137.5,-24.88 137.5,-5.63 257,-5.63 257,-24.88"/>
-<text text-anchor="middle" x="197.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::add_digit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.88,-15.25C109.58,-15.25 117.66,-15.25 125.7,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.5,-18.75 135.5,-15.25 125.5,-11.75 125.5,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408.75,-24.88 293,-24.88 293,-5.63 408.75,-5.63 408.75,-24.88"/>
-<text text-anchor="middle" x="350.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M257.31,-15.25C265.22,-15.25 273.39,-15.25 281.44,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.21,-18.75 291.21,-15.25 281.21,-11.75 281.21,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph_org.svg b/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph_org.svg
deleted file mode 100644
index c64ec3261..000000000
--- a/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: large_number::large_number Pages: 1 -->
-<svg width="417pt" height="39pt"
- viewBox="0.00 0.00 416.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>large_number::large_number</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="101.5,-30.5 0,-30.5 0,0 101.5,0 101.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::large</text>
-<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_number</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257,-24.88 137.5,-24.88 137.5,-5.63 257,-5.63 257,-24.88"/>
-<text text-anchor="middle" x="197.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">large_number::add_digit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.88,-15.25C109.58,-15.25 117.66,-15.25 125.7,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.5,-18.75 135.5,-15.25 125.5,-11.75 125.5,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="408.75,-24.88 293,-24.88 293,-5.63 408.75,-5.63 408.75,-24.88"/>
-<text text-anchor="middle" x="350.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M257.31,-15.25C265.22,-15.25 273.39,-15.25 281.44,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.21,-18.75 291.21,-15.25 281.21,-11.75 281.21,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d8b/struct_node.html b/db/d8b/struct_node.html
index 8efa9602f..fecc07dc4 100644
--- a/db/d8b/struct_node.html
+++ b/db/d8b/struct_node.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Node&lt; ValueType &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: Node&lt; ValueType &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,8 +139,7 @@ Collaboration diagram for Node&lt; ValueType &gt;:</div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-types" name="pub-types"></a>
 Public Types</h2></td></tr>
-<tr class="memitem:a13e548a3b57083015d76fd729e8f0356" id="r_a13e548a3b57083015d76fd729e8f0356"><td class="memItemLeft" align="right" valign="top"><a id="a13e548a3b57083015d76fd729e8f0356" name="a13e548a3b57083015d76fd729e8f0356"></a>
-using&#160;</td><td class="memItemRight" valign="bottom"><b>value_type</b> = ValueType</td></tr>
+<tr class="memitem:a13e548a3b57083015d76fd729e8f0356" id="r_a13e548a3b57083015d76fd729e8f0356"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a13e548a3b57083015d76fd729e8f0356">value_type</a> = ValueType</td></tr>
 <tr class="separator:a13e548a3b57083015d76fd729e8f0356"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
@@ -133,32 +149,49 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a9c1071551669a075fdd58d00065b468f" id="r_a9c1071551669a075fdd58d00065b468f"><td class="memItemLeft" align="right" valign="top"><a id="a9c1071551669a075fdd58d00065b468f" name="a9c1071551669a075fdd58d00065b468f"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
+<tr class="memitem:a9c1071551669a075fdd58d00065b468f" id="r_a9c1071551669a075fdd58d00065b468f"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9c1071551669a075fdd58d00065b468f">data</a></td></tr>
 <tr class="separator:a9c1071551669a075fdd58d00065b468f"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a15176b99cc8a5e244196ef9507064e43" id="r_a15176b99cc8a5e244196ef9507064e43"><td class="memItemLeft" align="right" valign="top"><a id="a15176b99cc8a5e244196ef9507064e43" name="a15176b99cc8a5e244196ef9507064e43"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>next</b></td></tr>
+<tr class="memitem:a15176b99cc8a5e244196ef9507064e43" id="r_a15176b99cc8a5e244196ef9507064e43"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a15176b99cc8a5e244196ef9507064e43">next</a></td></tr>
 <tr class="separator:a15176b99cc8a5e244196ef9507064e43"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aafcab960019c0424042fc29b9417d429" id="r_aafcab960019c0424042fc29b9417d429"><td class="memItemLeft" align="right" valign="top">ValueType&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aafcab960019c0424042fc29b9417d429">data</a> = {}</td></tr>
 <tr class="separator:aafcab960019c0424042fc29b9417d429"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ada4dcc40c3b713e2c6211691913fd9d7" id="r_ada4dcc40c3b713e2c6211691913fd9d7"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt; ValueType &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ada4dcc40c3b713e2c6211691913fd9d7">next</a> = {}</td></tr>
+<tr class="memitem:ada4dcc40c3b713e2c6211691913fd9d7" id="r_ada4dcc40c3b713e2c6211691913fd9d7"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt; ValueType &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ada4dcc40c3b713e2c6211691913fd9d7">next</a> = {}</td></tr>
 <tr class="separator:ada4dcc40c3b713e2c6211691913fd9d7"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a6c74895070ba94c7f278f84da71e0626" id="r_a6c74895070ba94c7f278f84da71e0626"><td class="memItemLeft" align="right" valign="top"><a id="a6c74895070ba94c7f278f84da71e0626" name="a6c74895070ba94c7f278f84da71e0626"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>val</b></td></tr>
+<tr class="memitem:a6c74895070ba94c7f278f84da71e0626" id="r_a6c74895070ba94c7f278f84da71e0626"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6c74895070ba94c7f278f84da71e0626">val</a></td></tr>
 <tr class="separator:a6c74895070ba94c7f278f84da71e0626"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8333c97a790aca4fa59c36690d94f142" id="r_a8333c97a790aca4fa59c36690d94f142"><td class="memItemLeft" align="right" valign="top"><a id="a8333c97a790aca4fa59c36690d94f142" name="a8333c97a790aca4fa59c36690d94f142"></a>
-<a class="el" href="../../db/d8b/struct_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>next</b></td></tr>
+<tr class="memitem:a8333c97a790aca4fa59c36690d94f142" id="r_a8333c97a790aca4fa59c36690d94f142"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d8b/struct_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8333c97a790aca4fa59c36690d94f142">next</a></td></tr>
 <tr class="separator:a8333c97a790aca4fa59c36690d94f142"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><div class="compoundTemplParams">template&lt;class ValueType&gt;<br />
-class Node&lt; ValueType &gt;</div><p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> Definition of the node as a linked-list </p><dl class="tparams"><dt>Template Parameters</dt><dd>
+class Node&lt; ValueType &gt;</div><p>for std::cout for std::shared_ptr for std::vector Definition of the node as a linked-list </p><dl class="tparams"><dt>Template Parameters</dt><dd>
   <table class="tparams">
     <tr><td class="paramname">ValueType</td><td>type of data nodes of the linked list should contain </td></tr>
   </table>
   </dd>
 </dl>
-</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">14</a> of file <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html">linkedlist_implentation_usingarray.cpp</a>.</p>
+</div><h2 class="groupheader">Member Typedef Documentation</h2>
+<a id="a13e548a3b57083015d76fd729e8f0356" name="a13e548a3b57083015d76fd729e8f0356"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a13e548a3b57083015d76fd729e8f0356">&#9670;&#160;</a></span>value_type</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;class ValueType &gt; </div>
+      <table class="memname">
+        <tr>
+          <td class="memname">using <a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt; ValueType &gt;::value_type = ValueType</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d09/node_8hpp_source.html#l00017">17</a> of file <a class="el" href="../../d3/d09/node_8hpp_source.html">node.hpp</a>.</p>
+
+</div>
+</div>
+<h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a8e229c3df1ce64226a1d2b51347dce0f" name="a8e229c3df1ce64226a1d2b51347dce0f"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a8e229c3df1ce64226a1d2b51347dce0f">&#9670;&#160;</a></span>Node()</h2>
 
@@ -187,13 +220,33 @@ template&lt;class ValueType &gt; </div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/dab/get__size__of__linked__list_8cpp_source.html#l00008">8</a> of file <a class="el" href="../../d7/dab/get__size__of__linked__list_8cpp_source.html">get_size_of_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">    8</span>: val(v), next(n) {}  <span class="comment">// Default constructor for Node</span></div>
 </div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
+<a id="a9c1071551669a075fdd58d00065b468f" name="a9c1071551669a075fdd58d00065b468f"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a9c1071551669a075fdd58d00065b468f">&#9670;&#160;</a></span>data <span class="overload">[1/2]</span></h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;class ValueType &gt; </div>
+      <table class="memname">
+        <tr>
+          <td class="memname">int <a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt; ValueType &gt;::data</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00015">15</a> of file <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html">linkedlist_implentation_usingarray.cpp</a>.</p>
+
+</div>
+</div>
 <a id="aafcab960019c0424042fc29b9417d429" name="aafcab960019c0424042fc29b9417d429"></a>
-<h2 class="memtitle"><span class="permalink"><a href="#aafcab960019c0424042fc29b9417d429">&#9670;&#160;</a></span>data</h2>
+<h2 class="memtitle"><span class="permalink"><a href="#aafcab960019c0424042fc29b9417d429">&#9670;&#160;</a></span>data <span class="overload">[2/2]</span></h2>
 
 <div class="memitem">
 <div class="memproto">
@@ -205,12 +258,14 @@ template&lt;class ValueType &gt; </div>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d09/node_8hpp_source.html#l00018">18</a> of file <a class="el" href="../../d3/d09/node_8hpp_source.html">node.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   18</span>{};</div>
 </div><!-- fragment -->
 </div>
 </div>
-<a id="ada4dcc40c3b713e2c6211691913fd9d7" name="ada4dcc40c3b713e2c6211691913fd9d7"></a>
-<h2 class="memtitle"><span class="permalink"><a href="#ada4dcc40c3b713e2c6211691913fd9d7">&#9670;&#160;</a></span>next</h2>
+<a id="a15176b99cc8a5e244196ef9507064e43" name="a15176b99cc8a5e244196ef9507064e43"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a15176b99cc8a5e244196ef9507064e43">&#9670;&#160;</a></span>next <span class="overload">[1/3]</span></h2>
 
 <div class="memitem">
 <div class="memproto">
@@ -218,18 +273,74 @@ template&lt;class ValueType &gt; </div>
 template&lt;class ValueType &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt;<a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt;ValueType&gt; &gt; <a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt; ValueType &gt;::next = {}</td>
+          <td class="memname">int <a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt; ValueType &gt;::next</td>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00016">16</a> of file <a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html">linkedlist_implentation_usingarray.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ada4dcc40c3b713e2c6211691913fd9d7" name="ada4dcc40c3b713e2c6211691913fd9d7"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ada4dcc40c3b713e2c6211691913fd9d7">&#9670;&#160;</a></span>next <span class="overload">[2/3]</span></h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;class ValueType &gt; </div>
+      <table class="memname">
+        <tr>
+          <td class="memname">std::shared_ptr&lt;<a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt;ValueType&gt; &gt; <a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt; ValueType &gt;::next = {}</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d09/node_8hpp_source.html#l00019">19</a> of file <a class="el" href="../../d3/d09/node_8hpp_source.html">node.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   19</span>{};</div>
 </div><!-- fragment -->
+</div>
+</div>
+<a id="a8333c97a790aca4fa59c36690d94f142" name="a8333c97a790aca4fa59c36690d94f142"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a8333c97a790aca4fa59c36690d94f142">&#9670;&#160;</a></span>next <span class="overload">[3/3]</span></h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;class ValueType &gt; </div>
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../db/d8b/struct_node.html">Node</a>* <a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt; ValueType &gt;::next</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/dab/get__size__of__linked__list_8cpp_source.html#l00006">6</a> of file <a class="el" href="../../d7/dab/get__size__of__linked__list_8cpp_source.html">get_size_of_linked_list.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a6c74895070ba94c7f278f84da71e0626" name="a6c74895070ba94c7f278f84da71e0626"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a6c74895070ba94c7f278f84da71e0626">&#9670;&#160;</a></span>val</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;class ValueType &gt; </div>
+      <table class="memname">
+        <tr>
+          <td class="memname">int <a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt; ValueType &gt;::val</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/dab/get__size__of__linked__list_8cpp_source.html#l00005">5</a> of file <a class="el" href="../../d7/dab/get__size__of__linked__list_8cpp_source.html">get_size_of_linked_list.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following files:<ul>
-<li>data_structures/<a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html">linkedlist_implentation_usingarray.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html">linkedlist_implentation_usingarray.cpp</a></li>
 <li>data_structures/<a class="el" href="../../d3/d09/node_8hpp_source.html">node.hpp</a></li>
-<li>operations_on_datastructures/<b>get_size_of_linked_list.cpp</b></li>
+<li>operations_on_datastructures/<a class="el" href="../../d7/dab/get__size__of__linked__list_8cpp_source.html">get_size_of_linked_list.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/db/d93/check__prime_8cpp.html b/db/d93/check__prime_8cpp.html
index 3a5ddd593..084124f87 100644
--- a/db/d93/check__prime_8cpp.html
+++ b/db/d93/check__prime_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/check_prime.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/check_prime.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for check_prime.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d39/check__prime_8cpp__incl.svg" width="171" height="111"><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">
+</div>
+<p><a href="../../db/d93/check__prime_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -144,6 +163,8 @@ Functions</h2></td></tr>
 <p>A prime number is any number that can be divided only by itself and 1. It must be positive and a whole number, therefore any prime number is part of the set of natural numbers. The majority of prime numbers are even numbers, with the exception of 2. This algorithm finds prime numbers using this information. additional ways to solve the prime check problem: <a href="https://cp-algorithms.com/algebra/primality_tests.html#practice-problems">https://cp-algorithms.com/algebra/primality_tests.html#practice-problems</a> </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/omkarlanghe" target="_blank">Omkar Langhe</a> </dd>
 <dd>
 <a href="https://github.com/ewd00010" target="_blank">ewd00010</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../db/d93/check__prime_8cpp_source.html">check_prime.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -162,17 +183,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d93/check__prime_8cpp_source.html#l00081">81</a> of file <a class="el" href="../../db/d93/check__prime_8cpp_source.html">check_prime.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   81</span>           {</div>
 <div class="line"><span class="lineno">   82</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// perform self-tests implementations</span></div>
 <div class="line"><span class="lineno">   83</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   84</span>}</div>
-<div class="ttc" id="acheck__prime_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> check_prime.cpp:62</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="314" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acheck__prime_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d93/check__prime_8cpp_source.html#l00062">check_prime.cpp:62</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -200,6 +218,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d93/check__prime_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../db/d93/check__prime_8cpp_source.html">check_prime.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>                    {</div>
 <div class="line"><span class="lineno">   63</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a>(1) == <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">   64</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a>(2) == <span class="keyword">true</span>);</div>
@@ -212,17 +232,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   71</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a>(50) == <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">   72</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a>(115249) == <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">   73</span> </div>
-<div class="line"><span class="lineno">   74</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!&quot;</span> &lt;&lt; <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">   74</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   75</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="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="anamespacemath_html_abd8f794b2229b42876169ff841b6e444"><div class="ttname"><a href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a></div><div class="ttdeci">bool is_prime(int64_t num)</div><div class="ttdoc">Function to check if the given number is prime or not.</div><div class="ttdef"><b>Definition</b> check_prime.cpp:31</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="216" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemath_html_abd8f794b2229b42876169ff841b6e444"><div class="ttname"><a href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a></div><div class="ttdeci">bool is_prime(int64_t num)</div><div class="ttdoc">Function to check if the given number is prime or not.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d93/check__prime_8cpp_source.html#l00031">check_prime.cpp:31</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index 9952e4656..000000000
--- a/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,31,56,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="122,5,193,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,36,106,26,107,31,56,41"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444" title="Function to check if the given number is prime or not." alt="" coords="104,55,211,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,46,89,52,88,57,55,51"/>
-</map>
diff --git a/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 1e06485d5..000000000
--- a/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9c5a2a03b8386cbd80dfb8b3134f2e02
\ No newline at end of file
diff --git a/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index 98c101fcc..000000000
--- a/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="162pt" height="64pt"
- viewBox="0.00 0.00 162.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="140.75,-56.25 87.25,-56.25 87.25,-37 140.75,-37 140.75,-56.25"/>
-<text text-anchor="middle" x="114" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.83,-31.29C48.62,-33.49 62.76,-36.38 75.86,-39.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.02,-42.45 85.51,-41.02 76.42,-35.59 75.02,-42.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444" target="_top" xlink:title="Function to check if the given number is prime or not.">
-<polygon fill="white" stroke="#666666" points="154.25,-19.25 73.75,-19.25 73.75,0 154.25,0 154.25,-19.25"/>
-<text text-anchor="middle" x="114" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::is_prime</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.83,-24.15C44.97,-22.78 53.56,-21.11 62.36,-19.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.87,-22.88 72.02,-17.55 61.54,-16.01 62.87,-22.88"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index fe9f27cca..000000000
--- a/db/d93/check__prime_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="162pt" height="64pt"
- viewBox="0.00 0.00 162.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="140.75,-56.25 87.25,-56.25 87.25,-37 140.75,-37 140.75,-56.25"/>
-<text text-anchor="middle" x="114" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.83,-31.29C48.62,-33.49 62.76,-36.38 75.86,-39.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.02,-42.45 85.51,-41.02 76.42,-35.59 75.02,-42.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444" target="_top" xlink:title="Function to check if the given number is prime or not.">
-<polygon fill="white" stroke="#666666" points="154.25,-19.25 73.75,-19.25 73.75,0 154.25,0 154.25,-19.25"/>
-<text text-anchor="middle" x="114" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::is_prime</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.83,-24.15C44.97,-22.78 53.56,-21.11 62.36,-19.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.87,-22.88 72.02,-17.55 61.54,-16.01 62.87,-22.88"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 99453d500..000000000
--- a/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,31,153,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,41,88,41,88,46,55,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="219,5,290,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,36,203,26,204,31,154,41"/>
-<area shape="rect" id="Node000004" href="$dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444" title="Function to check if the given number is prime or not." alt="" coords="201,55,308,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="154,46,186,52,185,57,153,51"/>
-</map>
diff --git a/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 830cc3234..000000000
--- a/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ecc3356383182ba366fc14e7f9dd3ffe
\ No newline at end of file
diff --git a/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 811b4f310..000000000
--- a/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="235pt" height="64pt"
- viewBox="0.00 0.00 235.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-37.25 73,-37.25 73,-18 110.75,-18 110.75,-37.25"/>
-<text text-anchor="middle" x="91.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-27.62C44.55,-27.62 53.37,-27.62 61.69,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-31.13 71.43,-27.63 61.43,-24.13 61.43,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="213.75,-56.25 160.25,-56.25 160.25,-37 213.75,-37 213.75,-56.25"/>
-<text text-anchor="middle" x="187" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.83,-31.29C121.62,-33.49 135.76,-36.38 148.86,-39.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.02,-42.45 158.51,-41.02 149.42,-35.59 148.02,-42.45"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444" target="_top" xlink:title="Function to check if the given number is prime or not.">
-<polygon fill="white" stroke="#666666" points="227.25,-19.25 146.75,-19.25 146.75,0 227.25,0 227.25,-19.25"/>
-<text text-anchor="middle" x="187" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::is_prime</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.83,-24.15C117.97,-22.78 126.56,-21.11 135.36,-19.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.87,-22.88 145.02,-17.55 134.54,-16.01 135.87,-22.88"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 93a12c257..000000000
--- a/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="235pt" height="64pt"
- viewBox="0.00 0.00 235.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-37.25 73,-37.25 73,-18 110.75,-18 110.75,-37.25"/>
-<text text-anchor="middle" x="91.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-27.62C44.55,-27.62 53.37,-27.62 61.69,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-31.13 71.43,-27.63 61.43,-24.13 61.43,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="213.75,-56.25 160.25,-56.25 160.25,-37 213.75,-37 213.75,-56.25"/>
-<text text-anchor="middle" x="187" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.83,-31.29C121.62,-33.49 135.76,-36.38 148.86,-39.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.02,-42.45 158.51,-41.02 149.42,-35.59 148.02,-42.45"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444" target="_top" xlink:title="Function to check if the given number is prime or not.">
-<polygon fill="white" stroke="#666666" points="227.25,-19.25 146.75,-19.25 146.75,0 227.25,0 227.25,-19.25"/>
-<text text-anchor="middle" x="187" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::is_prime</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.83,-24.15C117.97,-22.78 126.56,-21.11 135.36,-19.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.87,-22.88 145.02,-17.55 134.54,-16.01 135.87,-22.88"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d93/check__prime_8cpp_source.html b/db/d93/check__prime_8cpp_source.html
new file mode 100644
index 000000000..c005ae9ac
--- /dev/null
+++ b/db/d93/check__prime_8cpp_source.html
@@ -0,0 +1,189 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/check_prime.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/d93/check__prime_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">check_prime.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../db/d93/check__prime_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="foldopen" id="foldopen00031" data-start="{" data-end="}">
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">   31</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">is_prime</a>(int64_t num) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">if</span> (num &lt;= 1) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (num == 2 || num == 3) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (num % 2 == 0 || num % 3 == 0) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="keywordflow">for</span> (int64_t i = 5; i * i &lt;= num; i = i + 6) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            <span class="keywordflow">if</span> (num % i == 0 || num % (i + 2) == 0) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>            }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        }</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    }</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>}</div>
+</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">   62</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a>(1) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a>(2) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a>(3) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a>(4) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a>(-4) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a>(7) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a>(-7) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a>(19) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a>(50) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a>(115249) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>}</div>
+</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="foldopen" id="foldopen00081" data-start="{" data-end="}">
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="../../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   81</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <a class="code hl_function" href="../../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// perform self-tests implementations</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>}</div>
+</div>
+<div class="ttc" id="acheck__prime_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../db/d93/check__prime_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> <a href="#l00062">check_prime.cpp:62</a></div></div>
+<div class="ttc" id="acheck__prime_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00081">check_prime.cpp:81</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_abd8f794b2229b42876169ff841b6e444"><div class="ttname"><a href="../../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444">math::is_prime</a></div><div class="ttdeci">bool is_prime(int64_t num)</div><div class="ttdoc">Function to check if the given number is prime or not.</div><div class="ttdef"><b>Definition</b> <a href="#l00031">check_prime.cpp:31</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../db/d93/check__prime_8cpp.html">check_prime.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/d9a/classuint128__t.html b/db/d9a/classuint128__t.html
index dc5f9ab5d..423d5cd98 100644
--- a/db/d9a/classuint128__t.html
+++ b/db/d9a/classuint128__t.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: uint128_t Class Reference</title>
+<title>TheAlgorithms/C++: uint128_t Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -125,7 +142,7 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:adce2432b148fe18179a5ea272f4eb040"><td class="memTemplItemLeft" align="right" valign="top">&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#adce2432b148fe18179a5ea272f4eb040">uint128_t</a> (T low)</td></tr>
 <tr class="memdesc:adce2432b148fe18179a5ea272f4eb040"><td class="mdescLeft">&#160;</td><td class="mdescRight">Parameterized constructor.  <br /></td></tr>
 <tr class="separator:adce2432b148fe18179a5ea272f4eb040"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0b6612186d8f678452e011d08ee1f5ac" id="r_a0b6612186d8f678452e011d08ee1f5ac"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0b6612186d8f678452e011d08ee1f5ac">uint128_t</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str)</td></tr>
+<tr class="memitem:a0b6612186d8f678452e011d08ee1f5ac" id="r_a0b6612186d8f678452e011d08ee1f5ac"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0b6612186d8f678452e011d08ee1f5ac">uint128_t</a> (const std::string &amp;str)</td></tr>
 <tr class="memdesc:a0b6612186d8f678452e011d08ee1f5ac"><td class="mdescLeft">&#160;</td><td class="mdescRight">Parameterized constructor.  <br /></td></tr>
 <tr class="separator:a0b6612186d8f678452e011d08ee1f5ac"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a95ac8be8f414fcbce09301b912f5079d" id="r_a95ac8be8f414fcbce09301b912f5079d"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a95ac8be8f414fcbce09301b912f5079d">uint128_t</a> (const uint64_t high, const uint64_t low)</td></tr>
@@ -164,7 +181,7 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:ac924cc09bbb919532dc42f1f93f6f544"><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac924cc09bbb919532dc42f1f93f6f544">operator=</a> (const T &amp;p)</td></tr>
 <tr class="memdesc:ac924cc09bbb919532dc42f1f93f6f544"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator = for other types  <br /></td></tr>
 <tr class="separator:ac924cc09bbb919532dc42f1f93f6f544"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:abae08ef3c1d6dc512edd68ca68327f74" id="r_abae08ef3c1d6dc512edd68ca68327f74"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abae08ef3c1d6dc512edd68ca68327f74">operator=</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;p)</td></tr>
+<tr class="memitem:abae08ef3c1d6dc512edd68ca68327f74" id="r_abae08ef3c1d6dc512edd68ca68327f74"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abae08ef3c1d6dc512edd68ca68327f74">operator=</a> (const std::string &amp;p)</td></tr>
 <tr class="memdesc:abae08ef3c1d6dc512edd68ca68327f74"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator = for type string  <br /></td></tr>
 <tr class="separator:abae08ef3c1d6dc512edd68ca68327f74"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ab6aa4d14ed52c7c640468c45350da0c5" id="r_ab6aa4d14ed52c7c640468c45350da0c5"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab6aa4d14ed52c7c640468c45350da0c5">operator=</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)=default</td></tr>
@@ -231,7 +248,7 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:a96fc7c2df4325bb1a0c22b566bcc6295" id="r_a96fc7c2df4325bb1a0c22b566bcc6295"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a96fc7c2df4325bb1a0c22b566bcc6295">operator*=</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
 <tr class="memdesc:a96fc7c2df4325bb1a0c22b566bcc6295"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator *= for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types.  <br /></td></tr>
 <tr class="separator:a96fc7c2df4325bb1a0c22b566bcc6295"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8bf81f7f5f5c98f197822ec88e106c6c" id="r_a8bf81f7f5f5c98f197822ec88e106c6c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>, <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8bf81f7f5f5c98f197822ec88e106c6c">divide</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
+<tr class="memitem:a8bf81f7f5f5c98f197822ec88e106c6c" id="r_a8bf81f7f5f5c98f197822ec88e106c6c"><td class="memItemLeft" align="right" valign="top">std::pair&lt; <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>, <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8bf81f7f5f5c98f197822ec88e106c6c">divide</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
 <tr class="memdesc:a8bf81f7f5f5c98f197822ec88e106c6c"><td class="mdescLeft">&#160;</td><td class="mdescRight">divide function for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> and other integer types.  <br /></td></tr>
 <tr class="separator:a8bf81f7f5f5c98f197822ec88e106c6c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a3072a7e43da3600c345c81bc80c957ee" id="r_a3072a7e43da3600c345c81bc80c957ee"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3072a7e43da3600c345c81bc80c957ee">operator/</a> (const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
@@ -388,7 +405,7 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
 Private Member Functions</h2></td></tr>
-<tr class="memitem:a857a3c69c1e775a1bd3935c2bfbb02df" id="r_a857a3c69c1e775a1bd3935c2bfbb02df"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a857a3c69c1e775a1bd3935c2bfbb02df">__get_integer_from_string</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str)</td></tr>
+<tr class="memitem:a857a3c69c1e775a1bd3935c2bfbb02df" id="r_a857a3c69c1e775a1bd3935c2bfbb02df"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a857a3c69c1e775a1bd3935c2bfbb02df">__get_integer_from_string</a> (const std::string &amp;str)</td></tr>
 <tr class="memdesc:a857a3c69c1e775a1bd3935c2bfbb02df"><td class="mdescLeft">&#160;</td><td class="mdescRight">First and second half of 128 bit number.  <br /></td></tr>
 <tr class="separator:a857a3c69c1e775a1bd3935c2bfbb02df"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
@@ -401,12 +418,14 @@ Private Attributes</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="friends" name="friends"></a>
 Friends</h2></td></tr>
-<tr class="memitem:a5f2ace9fdcd459f74f8e43ef30a2a953" id="r_a5f2ace9fdcd459f74f8e43ef30a2a953"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5f2ace9fdcd459f74f8e43ef30a2a953">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;op, const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
+<tr class="memitem:a5f2ace9fdcd459f74f8e43ef30a2a953" id="r_a5f2ace9fdcd459f74f8e43ef30a2a953"><td class="memItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5f2ace9fdcd459f74f8e43ef30a2a953">operator&lt;&lt;</a> (std::ostream &amp;op, const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;p)</td></tr>
 <tr class="memdesc:a5f2ace9fdcd459f74f8e43ef30a2a953"><td class="mdescLeft">&#160;</td><td class="mdescRight">operator &lt;&lt; for printing <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> integer  <br /></td></tr>
 <tr class="separator:a5f2ace9fdcd459f74f8e43ef30a2a953"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>class for 128-bit unsigned integer </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00060">60</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="adce2432b148fe18179a5ea272f4eb040" name="adce2432b148fe18179a5ea272f4eb040"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#adce2432b148fe18179a5ea272f4eb040">&#9670;&#160;</a></span>uint128_t() <span class="overload">[1/5]</span></h2>
@@ -446,6 +465,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00101">101</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  101</span>: s(low) {}</div>
 </div><!-- fragment -->
 </div>
@@ -462,7 +483,7 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
         <tr>
           <td class="memname">uint128_t::uint128_t </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -480,16 +501,13 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00107">107</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  107</span>                                             {</div>
 <div class="line"><span class="lineno">  108</span>        <a class="code hl_function" href="#a857a3c69c1e775a1bd3935c2bfbb02df">__get_integer_from_string</a>(str);</div>
 <div class="line"><span class="lineno">  109</span>    }</div>
-<div class="ttc" id="aclassuint128__t_html_a857a3c69c1e775a1bd3935c2bfbb02df"><div class="ttname"><a href="#a857a3c69c1e775a1bd3935c2bfbb02df">uint128_t::__get_integer_from_string</a></div><div class="ttdeci">void __get_integer_from_string(const std::string &amp;str)</div><div class="ttdoc">First and second half of 128 bit number.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:70</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d9a/classuint128__t_a0b6612186d8f678452e011d08ee1f5ac_cgraph.svg" width="514" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassuint128__t_html_a857a3c69c1e775a1bd3935c2bfbb02df"><div class="ttname"><a href="#a857a3c69c1e775a1bd3935c2bfbb02df">uint128_t::__get_integer_from_string</a></div><div class="ttdeci">void __get_integer_from_string(const std::string &amp;str)</div><div class="ttdoc">First and second half of 128 bit number.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00070">uint128_t.hpp:70</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a95ac8be8f414fcbce09301b912f5079d" name="a95ac8be8f414fcbce09301b912f5079d"></a>
@@ -527,6 +545,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00116">116</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  116</span>: f(high), s(low) {}</div>
 </div><!-- fragment -->
 </div>
@@ -594,6 +614,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00128">128</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  128</span>: f(num.f), s(num.s) {}</div>
 </div><!-- fragment -->
 </div>
@@ -611,7 +633,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void uint128_t::__get_integer_from_string </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -631,10 +653,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00070">70</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   70</span>                                                         {</div>
 <div class="line"><span class="lineno">   71</span>        this-&gt;f = this-&gt;s = 0;</div>
-<div class="line"><span class="lineno">   72</span>        <span class="keywordflow">if</span> (str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() &gt; 1 &amp;&amp; str[1] == <span class="charliteral">&#39;x&#39;</span>) {  <span class="comment">// if hexadecimal</span></div>
-<div class="line"><span class="lineno">   73</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 2; i &lt; str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>(); ++i) {</div>
+<div class="line"><span class="lineno">   72</span>        <span class="keywordflow">if</span> (str.size() &gt; 1 &amp;&amp; str[1] == <span class="charliteral">&#39;x&#39;</span>) {  <span class="comment">// if hexadecimal</span></div>
+<div class="line"><span class="lineno">   73</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 2; i &lt; str.size(); ++i) {</div>
 <div class="line"><span class="lineno">   74</span>                *<span class="keyword">this</span> *= 16LL;</div>
 <div class="line"><span class="lineno">   75</span>                <span class="keywordflow">if</span> (str[i] &gt;= <span class="charliteral">&#39;0&#39;</span> &amp;&amp; str[i] &lt;= <span class="charliteral">&#39;9&#39;</span>) {</div>
 <div class="line"><span class="lineno">   76</span>                    *<span class="keyword">this</span> += (str[i] - <span class="charliteral">&#39;0&#39;</span>);</div>
@@ -651,13 +675,7 @@ Here is the call graph for this function:</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>    }</div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d9a/classuint128__t_a857a3c69c1e775a1bd3935c2bfbb02df_cgraph.svg" width="331" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af139bb6e630f1a61919f180978611cd2" name="af139bb6e630f1a61919f180978611cd2"></a>
@@ -685,6 +703,8 @@ Here is the call graph for this function:</div>
 
 <p>Leading zeroes in binary. </p>
 <p>Calculates leading zeros in 128-bit integer </p><dl class="section return"><dt>Returns</dt><dd>Integer denoting leading zeroes </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00140">140</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  140</span>                           {</div>
 <div class="line"><span class="lineno">  141</span><span class="preprocessor">#ifndef _MSC_VER</span></div>
 <div class="line"><span class="lineno">  142</span>        <span class="keywordflow">if</span> (f) {</div>
@@ -702,7 +722,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  154</span>        <span class="keywordflow">return</span> r;</div>
 <div class="line"><span class="lineno">  155</span><span class="preprocessor">#endif</span></div>
 <div class="line"><span class="lineno">  156</span>    }</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:119</div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00119">composite_simpson_rule.cpp:119</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -731,6 +751,8 @@ Here is the call graph for this function:</div>
 
 <p>Trailing zeroes in binary. </p>
 <p>Calculates leading zeros in 128-bit integer </p><dl class="section return"><dt>Returns</dt><dd>Integer denoting Trailing zeroes </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00163">163</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  163</span>                           {</div>
 <div class="line"><span class="lineno">  164</span><span class="preprocessor">#ifndef _MSC_VER</span></div>
 <div class="line"><span class="lineno">  165</span>        <span class="keywordflow">if</span> (f) {</div>
@@ -761,7 +783,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>, <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &gt; uint128_t::divide </td>
+          <td class="memname">std::pair&lt; <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a>, <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &gt; uint128_t::divide </td>
           <td>(</td>
           <td class="paramtype">const <a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>p</em></span></td><td>)</td>
           <td></td>
@@ -782,6 +804,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>pair denoting quotient and remainder. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00455">455</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  455</span>                                                             {</div>
 <div class="line"><span class="lineno">  456</span>        <span class="keywordflow">if</span> (*<span class="keyword">this</span> &lt; p) {  <span class="comment">// if this is less than divisor</span></div>
 <div class="line"><span class="lineno">  457</span>            <span class="keywordflow">return</span> {<a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(0), *<span class="keyword">this</span>};</div>
@@ -810,14 +834,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  480</span>        }</div>
 <div class="line"><span class="lineno">  481</span>        <span class="keywordflow">return</span> {quotient &lt;&lt; left, tmp2};</div>
 <div class="line"><span class="lineno">  482</span>    }</div>
-<div class="ttc" id="aclassuint128__t_html"><div class="ttname"><a href="../../db/d9a/classuint128__t.html">uint128_t</a></div><div class="ttdoc">class for 128-bit unsigned integer</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:60</div></div>
-<div class="ttc" id="aclassuint128__t_html_af139bb6e630f1a61919f180978611cd2"><div class="ttname"><a href="#af139bb6e630f1a61919f180978611cd2">uint128_t::_lez</a></div><div class="ttdeci">uint32_t _lez()</div><div class="ttdoc">Leading zeroes in binary.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:140</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d9a/classuint128__t_a8bf81f7f5f5c98f197822ec88e106c6c_cgraph.svg" width="282" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassuint128__t_html"><div class="ttname"><a href="../../db/d9a/classuint128__t.html">uint128_t</a></div><div class="ttdoc">class for 128-bit unsigned integer</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00060">uint128_t.hpp:60</a></div></div>
+<div class="ttc" id="aclassuint128__t_html_af139bb6e630f1a61919f180978611cd2"><div class="ttname"><a href="#af139bb6e630f1a61919f180978611cd2">uint128_t::_lez</a></div><div class="ttdeci">uint32_t _lez()</div><div class="ttdoc">Leading zeroes in binary.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00140">uint128_t.hpp:140</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa69e1064c0b0b1df1c61acd2ea04fabd" name="aa69e1064c0b0b1df1c61acd2ea04fabd"></a>
@@ -845,6 +864,8 @@ Here is the call graph for this function:</div>
 
 <p>returns lower 64-bit integer part </p>
 <dl class="section return"><dt>Returns</dt><dd>returns lower 64-bit integer part </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00202">202</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  202</span>{ <span class="keywordflow">return</span> s; }</div>
 </div><!-- fragment -->
 </div>
@@ -874,6 +895,8 @@ Here is the call graph for this function:</div>
 
 <p>casting operator to boolean value </p>
 <dl class="section return"><dt>Returns</dt><dd>true if value of this is non-zero, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00185">185</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  185</span>{ <span class="keywordflow">return</span> (f || s); }</div>
 </div><!-- fragment -->
 </div>
@@ -911,6 +934,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>integer value casted to mentioned type </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00194">194</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  194</span>                                       {</div>
 <div class="line"><span class="lineno">  195</span>        <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>T<span class="keyword">&gt;</span>(s);</div>
 <div class="line"><span class="lineno">  196</span>    }</div>
@@ -942,6 +967,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 
 <p>operator ! for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> </p>
 <dl class="section return"><dt>Returns</dt><dd>true if this has zero value, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00628">628</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  628</span>{ <span class="keywordflow">return</span> !f &amp;&amp; !s; }</div>
 </div><!-- fragment -->
 </div>
@@ -985,6 +1012,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is not equal to other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00722">722</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  722</span>                                          {</div>
 <div class="line"><span class="lineno">  723</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> != <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(other);</div>
 <div class="line"><span class="lineno">  724</span>    }</div>
@@ -1022,6 +1051,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is not equal than other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00620">620</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  620</span>                                                   {</div>
 <div class="line"><span class="lineno">  621</span>        <span class="keywordflow">return</span> f != other.f || s != other.s;</div>
 <div class="line"><span class="lineno">  622</span>    }</div>
@@ -1067,6 +1098,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>unsigned 128-bit remainder. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00543">543</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  543</span>                                           {</div>
 <div class="line"><span class="lineno">  544</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> % <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p);</div>
 <div class="line"><span class="lineno">  545</span>    }</div>
@@ -1104,14 +1137,11 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>unsigned 128-bit remainder. </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  533</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a8bf81f7f5f5c98f197822ec88e106c6c">divide</a>(p).second; }</div>
-<div class="ttc" id="aclassuint128__t_html_a8bf81f7f5f5c98f197822ec88e106c6c"><div class="ttname"><a href="#a8bf81f7f5f5c98f197822ec88e106c6c">uint128_t::divide</a></div><div class="ttdeci">std::pair&lt; uint128_t, uint128_t &gt; divide(const uint128_t &amp;p)</div><div class="ttdoc">divide function for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:455</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d9a/classuint128__t_abfc6a8765039cacc829a5cd386b5a066_cgraph.svg" width="471" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00533">533</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  533</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a8bf81f7f5f5c98f197822ec88e106c6c">divide</a>(p).second; }</div>
+<div class="ttc" id="aclassuint128__t_html_a8bf81f7f5f5c98f197822ec88e106c6c"><div class="ttname"><a href="#a8bf81f7f5f5c98f197822ec88e106c6c">uint128_t::divide</a></div><div class="ttdeci">std::pair&lt; uint128_t, uint128_t &gt; divide(const uint128_t &amp;p)</div><div class="ttdoc">divide function for uint128_t and other integer types.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00455">uint128_t.hpp:455</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0500a90bcde5a8254750c361eed9bc40" name="a0500a90bcde5a8254750c361eed9bc40"></a>
@@ -1153,6 +1183,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this set as unsigned 128-bit remainder. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00565">565</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  565</span>                                             {</div>
 <div class="line"><span class="lineno">  566</span>        *<span class="keyword">this</span> %= <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p);</div>
 <div class="line"><span class="lineno">  567</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -1191,16 +1223,13 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this set as unsigned 128-bit remainder. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00552">552</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  552</span>                                                     {</div>
 <div class="line"><span class="lineno">  553</span>        *<span class="keyword">this</span> = <a class="code hl_function" href="#a8bf81f7f5f5c98f197822ec88e106c6c">divide</a>(p).second;</div>
 <div class="line"><span class="lineno">  554</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  555</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d9a/classuint128__t_a279209a184db20a7ffc8e687fdb05be2_cgraph.svg" width="479" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a9fa81ef0d54ecb9050d0be4249358ca4" name="a9fa81ef0d54ecb9050d0be4249358ca4"></a>
@@ -1242,6 +1271,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>value of this &amp; p (&amp; is bit-wise operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00856">856</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  856</span>                                   {</div>
 <div class="line"><span class="lineno">  857</span>        <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> tmp = *<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  858</span>        <span class="keywordflow">return</span> tmp &amp; <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p);</div>
@@ -1280,6 +1311,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>value of this &amp; p (&amp; is bit-wise operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00844">844</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  844</span>                                                   {</div>
 <div class="line"><span class="lineno">  845</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(this-&gt;f &amp; p.f, this-&gt;s &amp; p.s);</div>
 <div class="line"><span class="lineno">  846</span>    }</div>
@@ -1325,6 +1358,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is both values are non-zero, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00734">734</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  734</span>                                      {</div>
 <div class="line"><span class="lineno">  735</span>        <span class="keywordflow">return</span> (f || s) &amp;&amp; b;</div>
 <div class="line"><span class="lineno">  736</span>    }</div>
@@ -1362,6 +1397,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if both of the values are not zero, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00635">635</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  635</span>                                               {</div>
 <div class="line"><span class="lineno">  636</span>        <span class="keywordflow">return</span> (s || f) &amp;&amp; (b.s || b.f);</div>
 <div class="line"><span class="lineno">  637</span>    }</div>
@@ -1407,6 +1444,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this = this &amp; p (&amp; is bit-wise operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00880">880</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  880</span>                                     {</div>
 <div class="line"><span class="lineno">  881</span>        *<span class="keyword">this</span> &amp;= <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p);</div>
 <div class="line"><span class="lineno">  882</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -1445,6 +1484,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this = this &amp; p (&amp; is bit-wise operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00866">866</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  866</span>                                              {</div>
 <div class="line"><span class="lineno">  867</span>        this-&gt;f &amp;= p.f;</div>
 <div class="line"><span class="lineno">  868</span>        this-&gt;s &amp;= p.s;</div>
@@ -1478,6 +1519,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 
 <p>operator () for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> </p>
 <dl class="section return"><dt>Returns</dt><dd>true if this value is non-zero, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00652">652</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  652</span>{ <span class="keywordflow">return</span> s || f; }</div>
 </div><!-- fragment -->
 </div>
@@ -1521,6 +1564,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>multiplication of this and p, returning <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> integer </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00393">393</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  393</span>                                          {</div>
 <div class="line"><span class="lineno">  394</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> * <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p);</div>
 <div class="line"><span class="lineno">  395</span>    }</div>
@@ -1558,6 +1603,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>multiplication of this and p, returning <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> integer </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00402">402</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  402</span>                                            {</div>
 <div class="line"><span class="lineno">  403</span>        uint64_t f_first = s &gt;&gt; 32, f_second = s &amp; 0xFFFFFFFF,</div>
 <div class="line"><span class="lineno">  404</span>                 s_first = p.s &gt;&gt; 32, s_second = p.s &amp; 0xFFFFFFFF;</div>
@@ -1613,6 +1660,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>multiplication of this and p, returning this </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00424">424</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  424</span>                                            {</div>
 <div class="line"><span class="lineno">  425</span>        *<span class="keyword">this</span> *= <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p);</div>
 <div class="line"><span class="lineno">  426</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -1651,6 +1700,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>multiplication of this and p, returning this </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00434">434</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  434</span>                                              {</div>
 <div class="line"><span class="lineno">  435</span>        uint64_t f_first = s &gt;&gt; 32, f_second = s &amp; 0xFFFFFFFF,</div>
 <div class="line"><span class="lineno">  436</span>                 s_first = p.s &gt;&gt; 32, s_second = p.s &amp; 0xFFFFFFFF;</div>
@@ -1707,6 +1758,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>addition of this and p, returning <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> integer </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00253">253</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  253</span>                                          {</div>
 <div class="line"><span class="lineno">  254</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(f + (p + s &lt; s), p + s);</div>
 <div class="line"><span class="lineno">  255</span>    }</div>
@@ -1744,6 +1797,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>addition of this and p, returning <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> integer </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00262">262</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  262</span>                                                   {</div>
 <div class="line"><span class="lineno">  263</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(f + (p.s + s &lt; s) + p.f, p.s + s);</div>
 <div class="line"><span class="lineno">  264</span>    }</div>
@@ -1775,6 +1830,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 
 <p>pre-increment operator </p>
 <dl class="section return"><dt>Returns</dt><dd>incremented value of this. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00297">297</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  297</span>                                   {</div>
 <div class="line"><span class="lineno">  298</span>        *<span class="keyword">this</span> += 1;</div>
 <div class="line"><span class="lineno">  299</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -1807,6 +1864,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 
 <p>post-increment operator </p>
 <dl class="section return"><dt>Returns</dt><dd>incremented value of this. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00306">306</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  306</span>                                     {</div>
 <div class="line"><span class="lineno">  307</span>        ++*<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  308</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -1853,6 +1912,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>addition of this and p, returning this </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00274">274</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  274</span>                                            {</div>
 <div class="line"><span class="lineno">  275</span>        <span class="keywordtype">bool</span> app = p + s &lt; s;</div>
 <div class="line"><span class="lineno">  276</span>        this-&gt;f += app;</div>
@@ -1893,6 +1954,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>addition of this and p, returning this </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00286">286</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  286</span>                                              {</div>
 <div class="line"><span class="lineno">  287</span>        <span class="keywordtype">bool</span> app = p.s + s &lt; s;</div>
 <div class="line"><span class="lineno">  288</span>        f = f + app + p.f;</div>
@@ -1927,6 +1990,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 
 <p>operator - using twos complement </p>
 <dl class="section return"><dt>Returns</dt><dd>2's complement of this. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00338">338</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  338</span>{ <span class="keywordflow">return</span> ~*<span class="keyword">this</span> + <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(1); }</div>
 </div><!-- fragment -->
 </div>
@@ -1970,6 +2035,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>subtraction of this and p, returning <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> integer </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00319">319</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  319</span>                                           {</div>
 <div class="line"><span class="lineno">  320</span>        <span class="keywordtype">bool</span> app = p &gt; s;</div>
 <div class="line"><span class="lineno">  321</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(f - app, s - p);</div>
@@ -2008,6 +2075,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>subtraction of this and p, returning <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> integer </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00329">329</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  329</span>                                                   {</div>
 <div class="line"><span class="lineno">  330</span>        <span class="keywordtype">bool</span> app = p.s &gt; s;</div>
 <div class="line"><span class="lineno">  331</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(f - p.f - app, s - p.s);</div>
@@ -2040,6 +2109,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 
 <p>operator &ndash; (pre-decrement) </p>
 <dl class="section return"><dt>Returns</dt><dd>decremented value of this </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00344">344</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  344</span>                                   {</div>
 <div class="line"><span class="lineno">  345</span>        *<span class="keyword">this</span> -= 1;</div>
 <div class="line"><span class="lineno">  346</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -2072,6 +2143,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 
 <p>operator &ndash; (post-decrement) </p>
 <dl class="section return"><dt>Returns</dt><dd>decremented value of this </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00353">353</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  353</span>                                       {</div>
 <div class="line"><span class="lineno">  354</span>        --*<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  355</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -2118,6 +2191,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>subtraction of this and p, returning this </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00366">366</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  366</span>                                      {</div>
 <div class="line"><span class="lineno">  367</span>        <span class="keywordtype">bool</span> app = p &gt; s;</div>
 <div class="line"><span class="lineno">  368</span>        f -= app;</div>
@@ -2158,6 +2233,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>subtraction of this and p, returning this </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00378">378</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  378</span>                                              {</div>
 <div class="line"><span class="lineno">  379</span>        <span class="keywordtype">bool</span> app = p.s &gt; s;</div>
 <div class="line"><span class="lineno">  380</span>        f = f - p.f - app;</div>
@@ -2206,6 +2283,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>unsigned 128-bit quotient. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00499">499</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  499</span>                                          {</div>
 <div class="line"><span class="lineno">  500</span>        <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> tmp = *<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  501</span>        tmp /= <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(0, p);</div>
@@ -2245,13 +2324,10 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>unsigned 128-bit quotient. </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  489</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a8bf81f7f5f5c98f197822ec88e106c6c">divide</a>(p).first; }</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="../../db/d9a/classuint128__t_a3072a7e43da3600c345c81bc80c957ee_cgraph.svg" width="463" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00489">489</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  489</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a8bf81f7f5f5c98f197822ec88e106c6c">divide</a>(p).first; }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aaacb9fda7adcfee224f1b09124c0438b" name="aaacb9fda7adcfee224f1b09124c0438b"></a>
@@ -2293,6 +2369,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this set as unsigned 128-bit quotient. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00523">523</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  523</span>                                            {</div>
 <div class="line"><span class="lineno">  524</span>        *<span class="keyword">this</span> /= <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(0, p);</div>
 <div class="line"><span class="lineno">  525</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -2331,16 +2409,13 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this set as unsigned 128-bit quotient. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00510">510</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  510</span>                                                     {</div>
 <div class="line"><span class="lineno">  511</span>        *<span class="keyword">this</span> = <a class="code hl_function" href="#a8bf81f7f5f5c98f197822ec88e106c6c">divide</a>(p).first;</div>
 <div class="line"><span class="lineno">  512</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  513</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d9a/classuint128__t_a300ed88fe2054788cc6e0b6a8fdf66db_cgraph.svg" width="471" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a56f579c802a6cc16f31e43af274453dc" name="a56f579c802a6cc16f31e43af274453dc"></a>
@@ -2382,6 +2457,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is less than other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00662">662</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  662</span>                                         {</div>
 <div class="line"><span class="lineno">  663</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> &lt; <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(other);</div>
 <div class="line"><span class="lineno">  664</span>    }</div>
@@ -2419,6 +2496,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is less than other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00575">575</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  575</span>                                                  {</div>
 <div class="line"><span class="lineno">  576</span>        <span class="keywordflow">return</span> f &lt; other.f || (f == other.f &amp;&amp; s &lt; other.s);</div>
 <div class="line"><span class="lineno">  577</span>    }</div>
@@ -2464,6 +2543,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>value of this shifted by p to left </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00765">765</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  765</span>                                    {</div>
 <div class="line"><span class="lineno">  766</span>        <span class="keywordflow">if</span> (!p) {</div>
 <div class="line"><span class="lineno">  767</span>            <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(f, s);</div>
@@ -2517,6 +2598,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this shifted by p to left </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00785">785</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  785</span>                                      {</div>
 <div class="line"><span class="lineno">  786</span>        <span class="keywordflow">if</span> (p) {</div>
 <div class="line"><span class="lineno">  787</span>            <span class="keywordflow">if</span> (p &gt;= 64 &amp;&amp; p &lt;= 128) {</div>
@@ -2571,6 +2654,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is less than or equal to other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00674">674</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  674</span>                                          {</div>
 <div class="line"><span class="lineno">  675</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> &lt;= <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(other);</div>
 <div class="line"><span class="lineno">  676</span>    }</div>
@@ -2608,6 +2693,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is less than or equal to other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00584">584</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  584</span>                                                   {</div>
 <div class="line"><span class="lineno">  585</span>        <span class="keywordflow">return</span> f &lt; other.f || (f == other.f &amp;&amp; s &lt;= other.s);</div>
 <div class="line"><span class="lineno">  586</span>    }</div>
@@ -2626,7 +2713,7 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
         <tr>
           <td class="memname"><a class="el" href="../../db/d9a/classuint128__t.html">uint128_t</a> &amp; uint128_t::operator= </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>p</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>p</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -2645,16 +2732,13 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this pointer with it's value equal to <code>p</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00228">228</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  228</span>                                                    {</div>
 <div class="line"><span class="lineno">  229</span>        this-&gt;<a class="code hl_function" href="#a857a3c69c1e775a1bd3935c2bfbb02df">__get_integer_from_string</a>(p);</div>
 <div class="line"><span class="lineno">  230</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  231</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d9a/classuint128__t_abae08ef3c1d6dc512edd68ca68327f74_cgraph.svg" width="516" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac924cc09bbb919532dc42f1f93f6f544" name="ac924cc09bbb919532dc42f1f93f6f544"></a>
@@ -2696,6 +2780,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this pointer with it's value equal to <code>p</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00218">218</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  218</span>                                            {</div>
 <div class="line"><span class="lineno">  219</span>        this-&gt;s = p;</div>
 <div class="line"><span class="lineno">  220</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -2776,6 +2862,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is equal to other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00710">710</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  710</span>                                          {</div>
 <div class="line"><span class="lineno">  711</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> == <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(other);</div>
 <div class="line"><span class="lineno">  712</span>    }</div>
@@ -2813,6 +2901,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is equal than other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00611">611</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  611</span>                                                   {</div>
 <div class="line"><span class="lineno">  612</span>        <span class="keywordflow">return</span> f == other.f &amp;&amp; s == other.s;</div>
 <div class="line"><span class="lineno">  613</span>    }</div>
@@ -2858,6 +2948,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is greater than other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00686">686</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  686</span>                                         {</div>
 <div class="line"><span class="lineno">  687</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> &gt; <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(other);</div>
 <div class="line"><span class="lineno">  688</span>    }</div>
@@ -2895,6 +2987,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is greater than other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00593">593</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  593</span>                                                  {</div>
 <div class="line"><span class="lineno">  594</span>        <span class="keywordflow">return</span> f &gt; other.f || (f == other.f &amp;&amp; s &gt; other.s);</div>
 <div class="line"><span class="lineno">  595</span>    }</div>
@@ -2940,6 +3034,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is greater than or equal other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00698">698</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  698</span>                                          {</div>
 <div class="line"><span class="lineno">  699</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span> &gt;= <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(other);</div>
 <div class="line"><span class="lineno">  700</span>    }</div>
@@ -2977,6 +3073,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is greater than or equal than other, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00602">602</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  602</span>                                                   {</div>
 <div class="line"><span class="lineno">  603</span>        <span class="keywordflow">return</span> (f &gt; other.f) || (f == other.f &amp;&amp; s &gt;= other.s);</div>
 <div class="line"><span class="lineno">  604</span>    }</div>
@@ -3022,6 +3120,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>value of this shifted by p to right </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00806">806</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  806</span>                                    {</div>
 <div class="line"><span class="lineno">  807</span>        <span class="keywordflow">if</span> (!p) {</div>
 <div class="line"><span class="lineno">  808</span>            <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(this-&gt;f, this-&gt;s);</div>
@@ -3075,6 +3175,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this shifted by p to right </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00826">826</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  826</span>                                      {</div>
 <div class="line"><span class="lineno">  827</span>        <span class="keywordflow">if</span> (p) {</div>
 <div class="line"><span class="lineno">  828</span>            <span class="keywordflow">if</span> (p &gt;= 64) {</div>
@@ -3129,6 +3231,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>value of this ^ p (^ is bit-wise <a class="el" href="../../d7/d47/namespace_x_o_r.html" title="Functions for XOR cipher algorithm.">XOR</a> operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00938">938</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  938</span>                                          {</div>
 <div class="line"><span class="lineno">  939</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(this-&gt;f, this-&gt;s ^ p);</div>
 <div class="line"><span class="lineno">  940</span>    }</div>
@@ -3166,6 +3270,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>value of this ^ p (^ is bit-wise <a class="el" href="../../d7/d47/namespace_x_o_r.html" title="Functions for XOR cipher algorithm.">XOR</a> operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00947">947</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  947</span>                                                   {</div>
 <div class="line"><span class="lineno">  948</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(this-&gt;f ^ p.f, this-&gt;s ^ p.s);</div>
 <div class="line"><span class="lineno">  949</span>    }</div>
@@ -3211,6 +3317,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this = this ^ p (^ is bit-wise <a class="el" href="../../d7/d47/namespace_x_o_r.html" title="Functions for XOR cipher algorithm.">XOR</a> operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00970">970</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  970</span>                                             {</div>
 <div class="line"><span class="lineno">  971</span>        s ^= p;</div>
 <div class="line"><span class="lineno">  972</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -3249,6 +3357,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this = this ^ p (^ is bit-wise <a class="el" href="../../d7/d47/namespace_x_o_r.html" title="Functions for XOR cipher algorithm.">XOR</a> operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00956">956</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  956</span>                                              {</div>
 <div class="line"><span class="lineno">  957</span>        f ^= p.f;</div>
 <div class="line"><span class="lineno">  958</span>        s ^= p.s;</div>
@@ -3296,6 +3406,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>value of this | p (| is bit-wise operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00893">893</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  893</span>                                          {</div>
 <div class="line"><span class="lineno">  894</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(p | s);</div>
 <div class="line"><span class="lineno">  895</span>    }</div>
@@ -3333,6 +3445,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>value of this | p (| is bit-wise OR operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00902">902</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  902</span>                                                   {</div>
 <div class="line"><span class="lineno">  903</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(this-&gt;f | p.f, this-&gt;s | p.s);</div>
 <div class="line"><span class="lineno">  904</span>    }</div>
@@ -3378,6 +3492,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this = this | p (| is bit-wise OR operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00925">925</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  925</span>                                            {</div>
 <div class="line"><span class="lineno">  926</span>        s |= p.s;</div>
 <div class="line"><span class="lineno">  927</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -3416,6 +3532,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>this = this | p (| is bit-wise OR operator) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00911">911</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  911</span>                                              {</div>
 <div class="line"><span class="lineno">  912</span>        f |= p.f;</div>
 <div class="line"><span class="lineno">  913</span>        s |= p.s;</div>
@@ -3463,6 +3581,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if this is either one of the values are non-zero, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00747">747</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  747</span>                                      {</div>
 <div class="line"><span class="lineno">  748</span>        <span class="keywordflow">return</span> (f || s) || b;</div>
 <div class="line"><span class="lineno">  749</span>    }</div>
@@ -3500,6 +3620,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if one of the values are not zero, else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00644">644</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  644</span>                                               {</div>
 <div class="line"><span class="lineno">  645</span>        <span class="keywordflow">return</span> (s || f) || (b.s || b.f);</div>
 <div class="line"><span class="lineno">  646</span>    }</div>
@@ -3531,6 +3653,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 
 <p>operator ~ for <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> </p>
 <dl class="section return"><dt>Returns</dt><dd>1's complement of this number </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00755">755</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  755</span>{ <span class="keywordflow">return</span> <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(~this-&gt;f, ~this-&gt;s); }</div>
 </div><!-- fragment -->
 </div>
@@ -3560,6 +3684,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 
 <p>returns upper 64-bit integer part </p>
 <dl class="section return"><dt>Returns</dt><dd>returns upper 64-bit integer part </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00208">208</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  208</span>{ <span class="keywordflow">return</span> f; }</div>
 </div><!-- fragment -->
 </div>
@@ -3575,9 +3701,9 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; operator&lt;&lt; </td>
+          <td class="memname">std::ostream &amp; operator&lt;&lt; </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>op</em></span>, </td>
+          <td class="paramtype">std::ostream &amp;</td>          <td class="paramname"><span class="paramname"><em>op</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -3602,11 +3728,13 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>op, ostream object. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00984">984</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  984</span>                                                                      {</div>
 <div class="line"><span class="lineno">  985</span>        <span class="keywordflow">if</span> (!p.f) {</div>
 <div class="line"><span class="lineno">  986</span>            op &lt;&lt; p.s;</div>
 <div class="line"><span class="lineno">  987</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  988</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> out = <span class="stringliteral">&quot;0&quot;</span>, p_2 = <span class="stringliteral">&quot;1&quot;</span>;</div>
+<div class="line"><span class="lineno">  988</span>            std::string out = <span class="stringliteral">&quot;0&quot;</span>, p_2 = <span class="stringliteral">&quot;1&quot;</span>;</div>
 <div class="line"><span class="lineno">  989</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 64; ++i) {</div>
 <div class="line"><span class="lineno">  990</span>                <span class="keywordflow">if</span> (p.s &amp; (1LL &lt;&lt; i)) {</div>
 <div class="line"><span class="lineno">  991</span>                    out = <a class="code hl_function" href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a>(out, p_2);</div>
@@ -3623,8 +3751,7 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
 <div class="line"><span class="lineno"> 1002</span>        }</div>
 <div class="line"><span class="lineno"> 1003</span>        <span class="keywordflow">return</span> op;</div>
 <div class="line"><span class="lineno"> 1004</span>    }</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="auint128__t_8hpp_html_a3ff77262ffd6743df5b808d41382a6f3"><div class="ttname"><a href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a></div><div class="ttdeci">std::string add(const std::string &amp;first, const std::string &amp;second)</div><div class="ttdoc">Adding two string.</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:38</div></div>
+<div class="ttc" id="auint128__t_8hpp_html_a3ff77262ffd6743df5b808d41382a6f3"><div class="ttname"><a href="../../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">add</a></div><div class="ttdeci">std::string add(const std::string &amp;first, const std::string &amp;second)</div><div class="ttdoc">Adding two string.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00038">uint128_t.hpp:38</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -3648,7 +3775,9 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
-<div class="fragment"><div class="line"><span class="lineno">   61</span>{}, s{};  <span class="comment">/// First and second half of 128 bit number</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00061">61</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   61</span>{}, s{};  </div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -3671,7 +3800,9 @@ template&lt;typename T , typename  = typename std::enable_if&lt;
   </tr>
 </table>
 </div><div class="memdoc">
-<div class="fragment"><div class="line"><span class="lineno">   61</span>{}, s{};  <span class="comment">/// First and second half of 128 bit number</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d41/uint128__t_8hpp_source.html#l00061">61</a> of file <a class="el" href="../../da/d41/uint128__t_8hpp_source.html">uint128_t.hpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   61</span>{}, s{};  </div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/db/d9a/classuint128__t_a0b6612186d8f678452e011d08ee1f5ac_cgraph.map b/db/d9a/classuint128__t_a0b6612186d8f678452e011d08ee1f5ac_cgraph.map
deleted file mode 100644
index 094e3fc87..000000000
--- a/db/d9a/classuint128__t_a0b6612186d8f678452e011d08ee1f5ac_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="uint128_t::uint128_t" name="uint128_t::uint128_t">
-<area shape="rect" id="Node000001" title="Parameterized constructor." alt="" coords="5,13,141,38"/>
-<area shape="rect" id="Node000002" href="$db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df" title="First and second half of 128 bit number." alt="" coords="189,5,349,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="141,23,173,23,173,28,141,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="397,13,508,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="350,23,381,23,381,28,350,28"/>
-</map>
diff --git a/db/d9a/classuint128__t_a0b6612186d8f678452e011d08ee1f5ac_cgraph.md5 b/db/d9a/classuint128__t_a0b6612186d8f678452e011d08ee1f5ac_cgraph.md5
deleted file mode 100644
index 2bbb5d8f4..000000000
--- a/db/d9a/classuint128__t_a0b6612186d8f678452e011d08ee1f5ac_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-559d8724022306e924159e9450c1769b
\ No newline at end of file
diff --git a/db/d9a/classuint128__t_a0b6612186d8f678452e011d08ee1f5ac_cgraph.svg b/db/d9a/classuint128__t_a0b6612186d8f678452e011d08ee1f5ac_cgraph.svg
deleted file mode 100644
index c56645964..000000000
--- a/db/d9a/classuint128__t_a0b6612186d8f678452e011d08ee1f5ac_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint128_t::uint128_t Pages: 1 -->
-<svg width="385pt" height="39pt"
- viewBox="0.00 0.00 385.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>uint128_t::uint128_t</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Parameterized constructor.">
-<polygon fill="#999999" stroke="#666666" points="101.5,-24.88 0,-24.88 0,-5.63 101.5,-5.63 101.5,-24.88"/>
-<text text-anchor="middle" x="50.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::uint128_t</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df" target="_top" xlink:title="First and second half of 128 bit number.">
-<polygon fill="white" stroke="#666666" points="257.75,-30.5 137.5,-30.5 137.5,0 257.75,0 257.75,-30.5"/>
-<text text-anchor="start" x="145.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::__get_integer</text>
-<text text-anchor="middle" x="197.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_from_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.61,-15.25C109.4,-15.25 117.57,-15.25 125.72,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.67,-18.75 135.67,-15.25 125.67,-11.75 125.67,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="377.25,-24.88 293.75,-24.88 293.75,-5.63 377.25,-5.63 377.25,-24.88"/>
-<text text-anchor="middle" x="335.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.22,-15.25C266.08,-15.25 274.09,-15.25 281.83,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.78,-18.75 291.78,-15.25 281.78,-11.75 281.78,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d9a/classuint128__t_a0b6612186d8f678452e011d08ee1f5ac_cgraph_org.svg b/db/d9a/classuint128__t_a0b6612186d8f678452e011d08ee1f5ac_cgraph_org.svg
deleted file mode 100644
index b3c32b25c..000000000
--- a/db/d9a/classuint128__t_a0b6612186d8f678452e011d08ee1f5ac_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint128_t::uint128_t Pages: 1 -->
-<svg width="385pt" height="39pt"
- viewBox="0.00 0.00 385.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>uint128_t::uint128_t</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Parameterized constructor.">
-<polygon fill="#999999" stroke="#666666" points="101.5,-24.88 0,-24.88 0,-5.63 101.5,-5.63 101.5,-24.88"/>
-<text text-anchor="middle" x="50.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::uint128_t</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df" target="_top" xlink:title="First and second half of 128 bit number.">
-<polygon fill="white" stroke="#666666" points="257.75,-30.5 137.5,-30.5 137.5,0 257.75,0 257.75,-30.5"/>
-<text text-anchor="start" x="145.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::__get_integer</text>
-<text text-anchor="middle" x="197.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_from_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.61,-15.25C109.4,-15.25 117.57,-15.25 125.72,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.67,-18.75 135.67,-15.25 125.67,-11.75 125.67,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="377.25,-24.88 293.75,-24.88 293.75,-5.63 377.25,-5.63 377.25,-24.88"/>
-<text text-anchor="middle" x="335.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.22,-15.25C266.08,-15.25 274.09,-15.25 281.83,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.78,-18.75 291.78,-15.25 281.78,-11.75 281.78,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d9a/classuint128__t_a279209a184db20a7ffc8e687fdb05be2_cgraph.map b/db/d9a/classuint128__t_a279209a184db20a7ffc8e687fdb05be2_cgraph.map
deleted file mode 100644
index 1540753a4..000000000
--- a/db/d9a/classuint128__t_a279209a184db20a7ffc8e687fdb05be2_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="uint128_t::operator%=" name="uint128_t::operator%=">
-<area shape="rect" id="Node000001" title="operator %= for uint128_t" alt="" coords="5,5,155,31"/>
-<area shape="rect" id="Node000002" href="$db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c" title="divide function for uint128_t and other integer types." alt="" coords="203,5,319,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,16,187,16,187,21,155,21"/>
-<area shape="rect" id="Node000003" href="$db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" title="Leading zeroes in binary." alt="" coords="367,5,473,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="320,16,351,16,351,21,320,21"/>
-</map>
diff --git a/db/d9a/classuint128__t_a279209a184db20a7ffc8e687fdb05be2_cgraph.md5 b/db/d9a/classuint128__t_a279209a184db20a7ffc8e687fdb05be2_cgraph.md5
deleted file mode 100644
index 2be24dd17..000000000
--- a/db/d9a/classuint128__t_a279209a184db20a7ffc8e687fdb05be2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-95e3a7d0f132f32c8d0ef82f04aedfc1
\ No newline at end of file
diff --git a/db/d9a/classuint128__t_a279209a184db20a7ffc8e687fdb05be2_cgraph.svg b/db/d9a/classuint128__t_a279209a184db20a7ffc8e687fdb05be2_cgraph.svg
deleted file mode 100644
index f9709bd62..000000000
--- a/db/d9a/classuint128__t_a279209a184db20a7ffc8e687fdb05be2_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint128_t::operator%= Pages: 1 -->
-<svg width="359pt" height="27pt"
- viewBox="0.00 0.00 359.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint128_t::operator%=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator %= for uint128_t">
-<polygon fill="#999999" stroke="#666666" points="112,-19.25 0,-19.25 0,0 112,0 112,-19.25"/>
-<text text-anchor="middle" x="56" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::operator%=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c" target="_top" xlink:title="divide function for uint128_t and other integer types.">
-<polygon fill="white" stroke="#666666" points="235.25,-19.25 148,-19.25 148,0 235.25,0 235.25,-19.25"/>
-<text text-anchor="middle" x="191.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.12,-9.62C120.14,-9.62 128.39,-9.62 136.39,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.36,-13.13 146.36,-9.63 136.36,-6.13 136.36,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="351,-19.25 271.25,-19.25 271.25,0 351,0 351,-19.25"/>
-<text text-anchor="middle" x="311.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.71,-9.62C243.46,-9.62 251.59,-9.62 259.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="259.42,-13.13 269.42,-9.63 259.42,-6.13 259.42,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d9a/classuint128__t_a279209a184db20a7ffc8e687fdb05be2_cgraph_org.svg b/db/d9a/classuint128__t_a279209a184db20a7ffc8e687fdb05be2_cgraph_org.svg
deleted file mode 100644
index 973eb4d12..000000000
--- a/db/d9a/classuint128__t_a279209a184db20a7ffc8e687fdb05be2_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint128_t::operator%= Pages: 1 -->
-<svg width="359pt" height="27pt"
- viewBox="0.00 0.00 359.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint128_t::operator%=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator %= for uint128_t">
-<polygon fill="#999999" stroke="#666666" points="112,-19.25 0,-19.25 0,0 112,0 112,-19.25"/>
-<text text-anchor="middle" x="56" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::operator%=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c" target="_top" xlink:title="divide function for uint128_t and other integer types.">
-<polygon fill="white" stroke="#666666" points="235.25,-19.25 148,-19.25 148,0 235.25,0 235.25,-19.25"/>
-<text text-anchor="middle" x="191.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.12,-9.62C120.14,-9.62 128.39,-9.62 136.39,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.36,-13.13 146.36,-9.63 136.36,-6.13 136.36,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="351,-19.25 271.25,-19.25 271.25,0 351,0 351,-19.25"/>
-<text text-anchor="middle" x="311.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M235.71,-9.62C243.46,-9.62 251.59,-9.62 259.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="259.42,-13.13 269.42,-9.63 259.42,-6.13 259.42,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d9a/classuint128__t_a300ed88fe2054788cc6e0b6a8fdf66db_cgraph.map b/db/d9a/classuint128__t_a300ed88fe2054788cc6e0b6a8fdf66db_cgraph.map
deleted file mode 100644
index daf097f72..000000000
--- a/db/d9a/classuint128__t_a300ed88fe2054788cc6e0b6a8fdf66db_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="uint128_t::operator/=" name="uint128_t::operator/=">
-<area shape="rect" id="Node000001" title="operator /= for uint128_t" alt="" coords="5,5,147,31"/>
-<area shape="rect" id="Node000002" href="$db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c" title="divide function for uint128_t and other integer types." alt="" coords="195,5,311,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="147,16,179,16,179,21,147,21"/>
-<area shape="rect" id="Node000003" href="$db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" title="Leading zeroes in binary." alt="" coords="359,5,465,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="312,16,343,16,343,21,312,21"/>
-</map>
diff --git a/db/d9a/classuint128__t_a300ed88fe2054788cc6e0b6a8fdf66db_cgraph.md5 b/db/d9a/classuint128__t_a300ed88fe2054788cc6e0b6a8fdf66db_cgraph.md5
deleted file mode 100644
index 1046dc902..000000000
--- a/db/d9a/classuint128__t_a300ed88fe2054788cc6e0b6a8fdf66db_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2e2e6ec35aff8c9b4afb2c10105f9723
\ No newline at end of file
diff --git a/db/d9a/classuint128__t_a300ed88fe2054788cc6e0b6a8fdf66db_cgraph.svg b/db/d9a/classuint128__t_a300ed88fe2054788cc6e0b6a8fdf66db_cgraph.svg
deleted file mode 100644
index f6a2e4cdb..000000000
--- a/db/d9a/classuint128__t_a300ed88fe2054788cc6e0b6a8fdf66db_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint128_t::operator/= Pages: 1 -->
-<svg width="353pt" height="27pt"
- viewBox="0.00 0.00 353.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint128_t::operator/=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator /= for uint128_t">
-<polygon fill="#999999" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
-<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::operator/=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c" target="_top" xlink:title="divide function for uint128_t and other integer types.">
-<polygon fill="white" stroke="#666666" points="229.25,-19.25 142,-19.25 142,0 229.25,0 229.25,-19.25"/>
-<text text-anchor="middle" x="185.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.38,-9.62C114.29,-9.62 122.47,-9.62 130.43,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.35,-13.13 140.35,-9.63 130.35,-6.13 130.35,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="345,-19.25 265.25,-19.25 265.25,0 345,0 345,-19.25"/>
-<text text-anchor="middle" x="305.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.71,-9.62C237.46,-9.62 245.59,-9.62 253.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.42,-13.13 263.42,-9.63 253.42,-6.13 253.42,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d9a/classuint128__t_a300ed88fe2054788cc6e0b6a8fdf66db_cgraph_org.svg b/db/d9a/classuint128__t_a300ed88fe2054788cc6e0b6a8fdf66db_cgraph_org.svg
deleted file mode 100644
index 6c2bc3e72..000000000
--- a/db/d9a/classuint128__t_a300ed88fe2054788cc6e0b6a8fdf66db_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint128_t::operator/= Pages: 1 -->
-<svg width="353pt" height="27pt"
- viewBox="0.00 0.00 353.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint128_t::operator/=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator /= for uint128_t">
-<polygon fill="#999999" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
-<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::operator/=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c" target="_top" xlink:title="divide function for uint128_t and other integer types.">
-<polygon fill="white" stroke="#666666" points="229.25,-19.25 142,-19.25 142,0 229.25,0 229.25,-19.25"/>
-<text text-anchor="middle" x="185.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.38,-9.62C114.29,-9.62 122.47,-9.62 130.43,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.35,-13.13 140.35,-9.63 130.35,-6.13 130.35,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="345,-19.25 265.25,-19.25 265.25,0 345,0 345,-19.25"/>
-<text text-anchor="middle" x="305.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.71,-9.62C237.46,-9.62 245.59,-9.62 253.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.42,-13.13 263.42,-9.63 253.42,-6.13 253.42,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d9a/classuint128__t_a3072a7e43da3600c345c81bc80c957ee_cgraph.map b/db/d9a/classuint128__t_a3072a7e43da3600c345c81bc80c957ee_cgraph.map
deleted file mode 100644
index 40d6cdc91..000000000
--- a/db/d9a/classuint128__t_a3072a7e43da3600c345c81bc80c957ee_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="uint128_t::operator/" name="uint128_t::operator/">
-<area shape="rect" id="Node000001" title="operator / for uint128_t and other integer types." alt="" coords="5,5,139,31"/>
-<area shape="rect" id="Node000002" href="$db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c" title="divide function for uint128_t and other integer types." alt="" coords="187,5,303,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="139,16,171,16,171,21,139,21"/>
-<area shape="rect" id="Node000003" href="$db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" title="Leading zeroes in binary." alt="" coords="351,5,457,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="304,16,335,16,335,21,304,21"/>
-</map>
diff --git a/db/d9a/classuint128__t_a3072a7e43da3600c345c81bc80c957ee_cgraph.md5 b/db/d9a/classuint128__t_a3072a7e43da3600c345c81bc80c957ee_cgraph.md5
deleted file mode 100644
index 28d1df709..000000000
--- a/db/d9a/classuint128__t_a3072a7e43da3600c345c81bc80c957ee_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-735cdd359a4e511098736659a1a10bec
\ No newline at end of file
diff --git a/db/d9a/classuint128__t_a3072a7e43da3600c345c81bc80c957ee_cgraph.svg b/db/d9a/classuint128__t_a3072a7e43da3600c345c81bc80c957ee_cgraph.svg
deleted file mode 100644
index 6c4085c32..000000000
--- a/db/d9a/classuint128__t_a3072a7e43da3600c345c81bc80c957ee_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint128_t::operator/ Pages: 1 -->
-<svg width="347pt" height="27pt"
- viewBox="0.00 0.00 347.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint128_t::operator/</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator / for uint128_t and other integer types.">
-<polygon fill="#999999" stroke="#666666" points="100,-19.25 0,-19.25 0,0 100,0 100,-19.25"/>
-<text text-anchor="middle" x="50" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::operator/</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c" target="_top" xlink:title="divide function for uint128_t and other integer types.">
-<polygon fill="white" stroke="#666666" points="223.25,-19.25 136,-19.25 136,0 223.25,0 223.25,-19.25"/>
-<text text-anchor="middle" x="179.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.34,-9.62C108.17,-9.62 116.3,-9.62 124.23,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.13,-13.13 134.13,-9.63 124.13,-6.13 124.13,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="339,-19.25 259.25,-19.25 259.25,0 339,0 339,-19.25"/>
-<text text-anchor="middle" x="299.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M223.71,-9.62C231.46,-9.62 239.59,-9.62 247.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="247.42,-13.13 257.42,-9.63 247.42,-6.13 247.42,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d9a/classuint128__t_a3072a7e43da3600c345c81bc80c957ee_cgraph_org.svg b/db/d9a/classuint128__t_a3072a7e43da3600c345c81bc80c957ee_cgraph_org.svg
deleted file mode 100644
index e24aa321a..000000000
--- a/db/d9a/classuint128__t_a3072a7e43da3600c345c81bc80c957ee_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint128_t::operator/ Pages: 1 -->
-<svg width="347pt" height="27pt"
- viewBox="0.00 0.00 347.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint128_t::operator/</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator / for uint128_t and other integer types.">
-<polygon fill="#999999" stroke="#666666" points="100,-19.25 0,-19.25 0,0 100,0 100,-19.25"/>
-<text text-anchor="middle" x="50" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::operator/</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c" target="_top" xlink:title="divide function for uint128_t and other integer types.">
-<polygon fill="white" stroke="#666666" points="223.25,-19.25 136,-19.25 136,0 223.25,0 223.25,-19.25"/>
-<text text-anchor="middle" x="179.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.34,-9.62C108.17,-9.62 116.3,-9.62 124.23,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.13,-13.13 134.13,-9.63 124.13,-6.13 124.13,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="339,-19.25 259.25,-19.25 259.25,0 339,0 339,-19.25"/>
-<text text-anchor="middle" x="299.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M223.71,-9.62C231.46,-9.62 239.59,-9.62 247.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="247.42,-13.13 257.42,-9.63 247.42,-6.13 247.42,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d9a/classuint128__t_a857a3c69c1e775a1bd3935c2bfbb02df_cgraph.map b/db/d9a/classuint128__t_a857a3c69c1e775a1bd3935c2bfbb02df_cgraph.map
deleted file mode 100644
index d1b54f538..000000000
--- a/db/d9a/classuint128__t_a857a3c69c1e775a1bd3935c2bfbb02df_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="uint128_t::__get_integer_from_string" name="uint128_t::__get_integer_from_string">
-<area shape="rect" id="Node000001" title="First and second half of 128 bit number." alt="" coords="5,5,166,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="214,13,325,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="166,23,198,23,198,28,166,28"/>
-</map>
diff --git a/db/d9a/classuint128__t_a857a3c69c1e775a1bd3935c2bfbb02df_cgraph.md5 b/db/d9a/classuint128__t_a857a3c69c1e775a1bd3935c2bfbb02df_cgraph.md5
deleted file mode 100644
index c7644a5b9..000000000
--- a/db/d9a/classuint128__t_a857a3c69c1e775a1bd3935c2bfbb02df_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2d956d26fd0f3b98d652243334a86705
\ No newline at end of file
diff --git a/db/d9a/classuint128__t_a857a3c69c1e775a1bd3935c2bfbb02df_cgraph.svg b/db/d9a/classuint128__t_a857a3c69c1e775a1bd3935c2bfbb02df_cgraph.svg
deleted file mode 100644
index 8006582ab..000000000
--- a/db/d9a/classuint128__t_a857a3c69c1e775a1bd3935c2bfbb02df_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint128_t::__get_integer_from_string Pages: 1 -->
-<svg width="248pt" height="39pt"
- viewBox="0.00 0.00 247.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>uint128_t::__get_integer_from_string</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="First and second half of 128 bit number.">
-<polygon fill="#999999" stroke="#666666" points="120.25,-30.5 0,-30.5 0,0 120.25,0 120.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::__get_integer</text>
-<text text-anchor="middle" x="60.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_from_string</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="239.75,-24.88 156.25,-24.88 156.25,-5.63 239.75,-5.63 239.75,-24.88"/>
-<text text-anchor="middle" x="198" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.72,-15.25C128.58,-15.25 136.59,-15.25 144.33,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.28,-18.75 154.28,-15.25 144.28,-11.75 144.28,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d9a/classuint128__t_a857a3c69c1e775a1bd3935c2bfbb02df_cgraph_org.svg b/db/d9a/classuint128__t_a857a3c69c1e775a1bd3935c2bfbb02df_cgraph_org.svg
deleted file mode 100644
index 14e640109..000000000
--- a/db/d9a/classuint128__t_a857a3c69c1e775a1bd3935c2bfbb02df_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint128_t::__get_integer_from_string Pages: 1 -->
-<svg width="248pt" height="39pt"
- viewBox="0.00 0.00 247.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>uint128_t::__get_integer_from_string</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="First and second half of 128 bit number.">
-<polygon fill="#999999" stroke="#666666" points="120.25,-30.5 0,-30.5 0,0 120.25,0 120.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::__get_integer</text>
-<text text-anchor="middle" x="60.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_from_string</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="239.75,-24.88 156.25,-24.88 156.25,-5.63 239.75,-5.63 239.75,-24.88"/>
-<text text-anchor="middle" x="198" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.72,-15.25C128.58,-15.25 136.59,-15.25 144.33,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.28,-18.75 154.28,-15.25 144.28,-11.75 144.28,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d9a/classuint128__t_a8bf81f7f5f5c98f197822ec88e106c6c_cgraph.map b/db/d9a/classuint128__t_a8bf81f7f5f5c98f197822ec88e106c6c_cgraph.map
deleted file mode 100644
index adf223b5f..000000000
--- a/db/d9a/classuint128__t_a8bf81f7f5f5c98f197822ec88e106c6c_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="uint128_t::divide" name="uint128_t::divide">
-<area shape="rect" id="Node000001" title="divide function for uint128_t and other integer types." alt="" coords="5,5,122,31"/>
-<area shape="rect" id="Node000002" href="$db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" title="Leading zeroes in binary." alt="" coords="170,5,276,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="122,16,154,16,154,21,122,21"/>
-</map>
diff --git a/db/d9a/classuint128__t_a8bf81f7f5f5c98f197822ec88e106c6c_cgraph.md5 b/db/d9a/classuint128__t_a8bf81f7f5f5c98f197822ec88e106c6c_cgraph.md5
deleted file mode 100644
index ecc17e8f4..000000000
--- a/db/d9a/classuint128__t_a8bf81f7f5f5c98f197822ec88e106c6c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ca3ca2f06d893ef1e8abdbbdb9ea3e8d
\ No newline at end of file
diff --git a/db/d9a/classuint128__t_a8bf81f7f5f5c98f197822ec88e106c6c_cgraph.svg b/db/d9a/classuint128__t_a8bf81f7f5f5c98f197822ec88e106c6c_cgraph.svg
deleted file mode 100644
index f8f8c8f99..000000000
--- a/db/d9a/classuint128__t_a8bf81f7f5f5c98f197822ec88e106c6c_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint128_t::divide Pages: 1 -->
-<svg width="211pt" height="27pt"
- viewBox="0.00 0.00 211.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint128_t::divide</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="divide function for uint128_t and other integer types.">
-<polygon fill="#999999" stroke="#666666" points="87.25,-19.25 0,-19.25 0,0 87.25,0 87.25,-19.25"/>
-<text text-anchor="middle" x="43.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="203,-19.25 123.25,-19.25 123.25,0 203,0 203,-19.25"/>
-<text text-anchor="middle" x="163.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.71,-9.62C95.46,-9.62 103.59,-9.62 111.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.42,-13.13 121.42,-9.63 111.42,-6.13 111.42,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d9a/classuint128__t_a8bf81f7f5f5c98f197822ec88e106c6c_cgraph_org.svg b/db/d9a/classuint128__t_a8bf81f7f5f5c98f197822ec88e106c6c_cgraph_org.svg
deleted file mode 100644
index d02e6632a..000000000
--- a/db/d9a/classuint128__t_a8bf81f7f5f5c98f197822ec88e106c6c_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint128_t::divide Pages: 1 -->
-<svg width="211pt" height="27pt"
- viewBox="0.00 0.00 211.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint128_t::divide</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="divide function for uint128_t and other integer types.">
-<polygon fill="#999999" stroke="#666666" points="87.25,-19.25 0,-19.25 0,0 87.25,0 87.25,-19.25"/>
-<text text-anchor="middle" x="43.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="203,-19.25 123.25,-19.25 123.25,0 203,0 203,-19.25"/>
-<text text-anchor="middle" x="163.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.71,-9.62C95.46,-9.62 103.59,-9.62 111.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.42,-13.13 121.42,-9.63 111.42,-6.13 111.42,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d9a/classuint128__t_abae08ef3c1d6dc512edd68ca68327f74_cgraph.map b/db/d9a/classuint128__t_abae08ef3c1d6dc512edd68ca68327f74_cgraph.map
deleted file mode 100644
index fffa4e03a..000000000
--- a/db/d9a/classuint128__t_abae08ef3c1d6dc512edd68ca68327f74_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="uint128_t::operator=" name="uint128_t::operator=">
-<area shape="rect" id="Node000001" title="operator = for type string" alt="" coords="5,13,143,38"/>
-<area shape="rect" id="Node000002" href="$db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df" title="First and second half of 128 bit number." alt="" coords="191,5,351,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="143,23,175,23,175,28,143,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="399,13,510,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="352,23,383,23,383,28,352,28"/>
-</map>
diff --git a/db/d9a/classuint128__t_abae08ef3c1d6dc512edd68ca68327f74_cgraph.md5 b/db/d9a/classuint128__t_abae08ef3c1d6dc512edd68ca68327f74_cgraph.md5
deleted file mode 100644
index 8519dc53a..000000000
--- a/db/d9a/classuint128__t_abae08ef3c1d6dc512edd68ca68327f74_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d288b3d1496c1a831fa01a743a84b488
\ No newline at end of file
diff --git a/db/d9a/classuint128__t_abae08ef3c1d6dc512edd68ca68327f74_cgraph.svg b/db/d9a/classuint128__t_abae08ef3c1d6dc512edd68ca68327f74_cgraph.svg
deleted file mode 100644
index dbd11363a..000000000
--- a/db/d9a/classuint128__t_abae08ef3c1d6dc512edd68ca68327f74_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint128_t::operator= Pages: 1 -->
-<svg width="387pt" height="39pt"
- viewBox="0.00 0.00 386.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>uint128_t::operator=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator = for type string">
-<polygon fill="#999999" stroke="#666666" points="103,-24.88 0,-24.88 0,-5.63 103,-5.63 103,-24.88"/>
-<text text-anchor="middle" x="51.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::operator=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df" target="_top" xlink:title="First and second half of 128 bit number.">
-<polygon fill="white" stroke="#666666" points="259.25,-30.5 139,-30.5 139,0 259.25,0 259.25,-30.5"/>
-<text text-anchor="start" x="147" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::__get_integer</text>
-<text text-anchor="middle" x="199.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_from_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.43,-15.25C111.18,-15.25 119.29,-15.25 127.37,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.22,-18.75 137.22,-15.25 127.22,-11.75 127.22,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="378.75,-24.88 295.25,-24.88 295.25,-5.63 378.75,-5.63 378.75,-24.88"/>
-<text text-anchor="middle" x="337" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.72,-15.25C267.58,-15.25 275.59,-15.25 283.33,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="283.28,-18.75 293.28,-15.25 283.28,-11.75 283.28,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d9a/classuint128__t_abae08ef3c1d6dc512edd68ca68327f74_cgraph_org.svg b/db/d9a/classuint128__t_abae08ef3c1d6dc512edd68ca68327f74_cgraph_org.svg
deleted file mode 100644
index 105cced73..000000000
--- a/db/d9a/classuint128__t_abae08ef3c1d6dc512edd68ca68327f74_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint128_t::operator= Pages: 1 -->
-<svg width="387pt" height="39pt"
- viewBox="0.00 0.00 386.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>uint128_t::operator=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator = for type string">
-<polygon fill="#999999" stroke="#666666" points="103,-24.88 0,-24.88 0,-5.63 103,-5.63 103,-24.88"/>
-<text text-anchor="middle" x="51.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::operator=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df" target="_top" xlink:title="First and second half of 128 bit number.">
-<polygon fill="white" stroke="#666666" points="259.25,-30.5 139,-30.5 139,0 259.25,0 259.25,-30.5"/>
-<text text-anchor="start" x="147" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::__get_integer</text>
-<text text-anchor="middle" x="199.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_from_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.43,-15.25C111.18,-15.25 119.29,-15.25 127.37,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.22,-18.75 137.22,-15.25 127.22,-11.75 127.22,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="378.75,-24.88 295.25,-24.88 295.25,-5.63 378.75,-5.63 378.75,-24.88"/>
-<text text-anchor="middle" x="337" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.72,-15.25C267.58,-15.25 275.59,-15.25 283.33,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="283.28,-18.75 293.28,-15.25 283.28,-11.75 283.28,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d9a/classuint128__t_abfc6a8765039cacc829a5cd386b5a066_cgraph.map b/db/d9a/classuint128__t_abfc6a8765039cacc829a5cd386b5a066_cgraph.map
deleted file mode 100644
index 6f6428478..000000000
--- a/db/d9a/classuint128__t_abfc6a8765039cacc829a5cd386b5a066_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="uint128_t::operator%" name="uint128_t::operator%">
-<area shape="rect" id="Node000001" title="operator % for uint128_t" alt="" coords="5,5,147,31"/>
-<area shape="rect" id="Node000002" href="$db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c" title="divide function for uint128_t and other integer types." alt="" coords="195,5,311,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="147,16,179,16,179,21,147,21"/>
-<area shape="rect" id="Node000003" href="$db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" title="Leading zeroes in binary." alt="" coords="359,5,465,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="312,16,343,16,343,21,312,21"/>
-</map>
diff --git a/db/d9a/classuint128__t_abfc6a8765039cacc829a5cd386b5a066_cgraph.md5 b/db/d9a/classuint128__t_abfc6a8765039cacc829a5cd386b5a066_cgraph.md5
deleted file mode 100644
index 5f51449df..000000000
--- a/db/d9a/classuint128__t_abfc6a8765039cacc829a5cd386b5a066_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7923655ffb2c58a2ec0947aa2ae1f731
\ No newline at end of file
diff --git a/db/d9a/classuint128__t_abfc6a8765039cacc829a5cd386b5a066_cgraph.svg b/db/d9a/classuint128__t_abfc6a8765039cacc829a5cd386b5a066_cgraph.svg
deleted file mode 100644
index e1e327b6a..000000000
--- a/db/d9a/classuint128__t_abfc6a8765039cacc829a5cd386b5a066_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint128_t::operator% Pages: 1 -->
-<svg width="353pt" height="27pt"
- viewBox="0.00 0.00 353.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint128_t::operator%</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator % for uint128_t">
-<polygon fill="#999999" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
-<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::operator%</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c" target="_top" xlink:title="divide function for uint128_t and other integer types.">
-<polygon fill="white" stroke="#666666" points="229.25,-19.25 142,-19.25 142,0 229.25,0 229.25,-19.25"/>
-<text text-anchor="middle" x="185.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.38,-9.62C114.29,-9.62 122.47,-9.62 130.43,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.35,-13.13 140.35,-9.63 130.35,-6.13 130.35,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="345,-19.25 265.25,-19.25 265.25,0 345,0 345,-19.25"/>
-<text text-anchor="middle" x="305.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.71,-9.62C237.46,-9.62 245.59,-9.62 253.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.42,-13.13 263.42,-9.63 253.42,-6.13 253.42,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d9a/classuint128__t_abfc6a8765039cacc829a5cd386b5a066_cgraph_org.svg b/db/d9a/classuint128__t_abfc6a8765039cacc829a5cd386b5a066_cgraph_org.svg
deleted file mode 100644
index 9a3bd6ffa..000000000
--- a/db/d9a/classuint128__t_abfc6a8765039cacc829a5cd386b5a066_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: uint128_t::operator% Pages: 1 -->
-<svg width="353pt" height="27pt"
- viewBox="0.00 0.00 353.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>uint128_t::operator%</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="operator % for uint128_t">
-<polygon fill="#999999" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
-<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::operator%</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c" target="_top" xlink:title="divide function for uint128_t and other integer types.">
-<polygon fill="white" stroke="#666666" points="229.25,-19.25 142,-19.25 142,0 229.25,0 229.25,-19.25"/>
-<text text-anchor="middle" x="185.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::divide</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.38,-9.62C114.29,-9.62 122.47,-9.62 130.43,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.35,-13.13 140.35,-9.63 130.35,-6.13 130.35,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2" target="_top" xlink:title="Leading zeroes in binary.">
-<polygon fill="white" stroke="#666666" points="345,-19.25 265.25,-19.25 265.25,0 345,0 345,-19.25"/>
-<text text-anchor="middle" x="305.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t::_lez</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.71,-9.62C237.46,-9.62 245.59,-9.62 253.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.42,-13.13 263.42,-9.63 253.42,-6.13 253.42,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d9f/iterative__factorial_8cpp.html b/db/d9f/iterative__factorial_8cpp.html
index 9818a29b4..515ff874f 100644
--- a/db/d9f/iterative__factorial_8cpp.html
+++ b/db/d9f/iterative__factorial_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/iterative_factorial.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/iterative_factorial.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for iterative_factorial.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d00/iterative__factorial_8cpp__incl.svg" width="358" height="111"><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">
+</div>
+<p><a href="../../db/d9f/iterative__factorial_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -149,6 +168,8 @@ Functions</h2></td></tr>
       = n\times(n-1)!\]
 </p>
 <p> for example: \(4! = 4\times3! = 4\times3\times2\times1 = 24\) </p>
+
+<p class="definition">Definition in file <a class="el" href="../../db/d9f/iterative__factorial_8cpp_source.html">iterative_factorial.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -167,17 +188,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d9f/iterative__factorial_8cpp_source.html#l00120">120</a> of file <a class="el" href="../../db/d9f/iterative__factorial_8cpp_source.html">iterative_factorial.cpp</a>.</p>
 <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="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Run self-test implementation</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="aiterative__factorial_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations to test iterativeFactorial function.</div><div class="ttdef"><b>Definition</b> iterative_factorial.cpp:69</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="354" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aiterative__factorial_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations to test iterativeFactorial function.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d9f/iterative__factorial_8cpp_source.html#l00069">iterative_factorial.cpp:69</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -205,61 +223,56 @@ Here is the call graph for this function:</div>
 
 <p>Self-test implementations to test iterativeFactorial function. </p>
 <dl class="section note"><dt>Note</dt><dd>There is 1 special case: 0! = 1. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d9f/iterative__factorial_8cpp_source.html#l00069">69</a> of file <a class="el" href="../../db/d9f/iterative__factorial_8cpp_source.html">iterative_factorial.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   69</span>                   {</div>
 <div class="line"><span class="lineno">   70</span>    <span class="comment">// Special case test</span></div>
-<div class="line"><span class="lineno">   71</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Exception case test \n&quot;</span></div>
+<div class="line"><span class="lineno">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Exception case test \n&quot;</span></div>
 <div class="line"><span class="lineno">   72</span>                 <span class="stringliteral">&quot;Input: 0 \n&quot;</span></div>
 <div class="line"><span class="lineno">   73</span>                 <span class="stringliteral">&quot;Expected output: 1 \n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   74</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a>(0) == 1);</div>
 <div class="line"><span class="lineno">   75</span> </div>
 <div class="line"><span class="lineno">   76</span>    <span class="comment">// Base case</span></div>
-<div class="line"><span class="lineno">   77</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Base case test \n&quot;</span></div>
+<div class="line"><span class="lineno">   77</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Base case test \n&quot;</span></div>
 <div class="line"><span class="lineno">   78</span>                 <span class="stringliteral">&quot;Input: 1 \n&quot;</span></div>
 <div class="line"><span class="lineno">   79</span>                 <span class="stringliteral">&quot;Expected output: 1 \n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   80</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a>(1) == 1);</div>
 <div class="line"><span class="lineno">   81</span> </div>
 <div class="line"><span class="lineno">   82</span>    <span class="comment">// Small case</span></div>
-<div class="line"><span class="lineno">   83</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Small number case test \n&quot;</span></div>
+<div class="line"><span class="lineno">   83</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Small number case test \n&quot;</span></div>
 <div class="line"><span class="lineno">   84</span>                 <span class="stringliteral">&quot;Input: 5 \n&quot;</span></div>
 <div class="line"><span class="lineno">   85</span>                 <span class="stringliteral">&quot;Expected output: 120 \n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   86</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a>(5) == 120);</div>
 <div class="line"><span class="lineno">   87</span> </div>
 <div class="line"><span class="lineno">   88</span>    <span class="comment">// Medium case</span></div>
-<div class="line"><span class="lineno">   89</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Medium number case test \n&quot;</span></div>
+<div class="line"><span class="lineno">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Medium number case test \n&quot;</span></div>
 <div class="line"><span class="lineno">   90</span>                 <span class="stringliteral">&quot;Input: 10 \n&quot;</span></div>
 <div class="line"><span class="lineno">   91</span>                 <span class="stringliteral">&quot;Expected output: 3628800 \n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   92</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a>(10) == 3628800);</div>
 <div class="line"><span class="lineno">   93</span> </div>
 <div class="line"><span class="lineno">   94</span>    <span class="comment">// Maximum case</span></div>
-<div class="line"><span class="lineno">   95</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Maximum case test \n&quot;</span></div>
+<div class="line"><span class="lineno">   95</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum case test \n&quot;</span></div>
 <div class="line"><span class="lineno">   96</span>                 <span class="stringliteral">&quot;Input: 20 \n&quot;</span></div>
 <div class="line"><span class="lineno">   97</span>                 <span class="stringliteral">&quot;Expected output: 2432902008176640000\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   98</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a>(20) == 2432902008176640000);</div>
 <div class="line"><span class="lineno">   99</span> </div>
 <div class="line"><span class="lineno">  100</span>    <span class="comment">// Exception test</span></div>
-<div class="line"><span class="lineno">  101</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Exception test \n&quot;</span></div>
+<div class="line"><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Exception test \n&quot;</span></div>
 <div class="line"><span class="lineno">  102</span>                 <span class="stringliteral">&quot;Input: 21 \n&quot;</span></div>
 <div class="line"><span class="lineno">  103</span>                 <span class="stringliteral">&quot;Expected output: Exception thrown \n&quot;</span>;</div>
 <div class="line"><span class="lineno">  104</span> </div>
 <div class="line"><span class="lineno">  105</span>    <span class="keywordtype">bool</span> wasExceptionThrown = <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  106</span>    <span class="keywordflow">try</span> {</div>
 <div class="line"><span class="lineno">  107</span>        <a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a>(21);</div>
-<div class="line"><span class="lineno">  108</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>&amp;) {</div>
+<div class="line"><span class="lineno">  108</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::invalid_argument&amp;) {</div>
 <div class="line"><span class="lineno">  109</span>        wasExceptionThrown = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  110</span>    }</div>
 <div class="line"><span class="lineno">  111</span>    assert(wasExceptionThrown);</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> &lt;&lt; <span class="stringliteral">&quot;All tests have passed successfully.\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have passed successfully.\n&quot;</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="ainvalid_argument_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></div></div>
-<div class="ttc" id="anamespacemath_html_a2565c745aac2f9561cc6fd9e56d9b77a"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a></div><div class="ttdeci">uint64_t iterativeFactorial(uint8_t n)</div><div class="ttdoc">Calculates the factorial iteratively.</div><div class="ttdef"><b>Definition</b> iterative_factorial.cpp:47</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="256" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemath_html_a2565c745aac2f9561cc6fd9e56d9b77a"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a></div><div class="ttdeci">uint64_t iterativeFactorial(uint8_t n)</div><div class="ttdoc">Calculates the factorial iteratively.</div><div class="ttdef"><b>Definition</b> <a href="../../db/d9f/iterative__factorial_8cpp_source.html#l00047">iterative_factorial.cpp:47</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index a3ccd6a0a..000000000
--- a/db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations to test iterativeFactorial function." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="$dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a" title="Calculates the factorial iteratively." alt="" coords="97,5,251,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,82,16,82,21,49,21"/>
-</map>
diff --git a/db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 316f0398c..000000000
--- a/db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0cce5031cae04071fc3753df9a39a4f7
\ No newline at end of file
diff --git a/db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index b8d11b889..000000000
--- a/db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="192pt" height="27pt"
- viewBox="0.00 0.00 192.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations to test iterativeFactorial function.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a" target="_top" xlink:title="Calculates the factorial iteratively.">
-<polygon fill="white" stroke="#666666" points="184.25,-19.25 68.5,-19.25 68.5,0 184.25,0 184.25,-19.25"/>
-<text text-anchor="middle" x="126.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::iterativeFactorial</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.74,-9.62C39.55,-9.62 48.06,-9.62 57.15,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.92,-13.13 66.92,-9.63 56.92,-6.13 56.92,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1b5ef5236..000000000
--- a/db/d9f/iterative__factorial_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="192pt" height="27pt"
- viewBox="0.00 0.00 192.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations to test iterativeFactorial function.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a" target="_top" xlink:title="Calculates the factorial iteratively.">
-<polygon fill="white" stroke="#666666" points="184.25,-19.25 68.5,-19.25 68.5,0 184.25,0 184.25,-19.25"/>
-<text text-anchor="middle" x="126.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::iterativeFactorial</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.74,-9.62C39.55,-9.62 48.06,-9.62 57.15,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.92,-13.13 66.92,-9.63 56.92,-6.13 56.92,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index b75d3dc63..000000000
--- a/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations to test iterativeFactorial function." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a" title="Calculates the factorial iteratively." alt="" coords="194,5,348,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,179,16,179,21,146,21"/>
-</map>
diff --git a/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index ff9ef3d38..000000000
--- a/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-93ed276ab8cae16f8df792181c059f11
\ No newline at end of file
diff --git a/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index fe143edc1..000000000
--- a/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="265pt" height="27pt"
- viewBox="0.00 0.00 265.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations to test iterativeFactorial function.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a" target="_top" xlink:title="Calculates the factorial iteratively.">
-<polygon fill="white" stroke="#666666" points="257.25,-19.25 141.5,-19.25 141.5,0 257.25,0 257.25,-19.25"/>
-<text text-anchor="middle" x="199.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::iterativeFactorial</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.74,-9.62C112.55,-9.62 121.06,-9.62 130.15,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.92,-13.13 139.92,-9.63 129.92,-6.13 129.92,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 42b2cfb31..000000000
--- a/db/d9f/iterative__factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="265pt" height="27pt"
- viewBox="0.00 0.00 265.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations to test iterativeFactorial function.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a" target="_top" xlink:title="Calculates the factorial iteratively.">
-<polygon fill="white" stroke="#666666" points="257.25,-19.25 141.5,-19.25 141.5,0 257.25,0 257.25,-19.25"/>
-<text text-anchor="middle" x="199.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::iterativeFactorial</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.74,-9.62C112.55,-9.62 121.06,-9.62 130.15,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.92,-13.13 139.92,-9.63 129.92,-6.13 129.92,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/d9f/iterative__factorial_8cpp_source.html b/db/d9f/iterative__factorial_8cpp_source.html
new file mode 100644
index 000000000..f85b183e2
--- /dev/null
+++ b/db/d9f/iterative__factorial_8cpp_source.html
@@ -0,0 +1,224 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/iterative_factorial.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/d9f/iterative__factorial_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">iterative_factorial.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../db/d9f/iterative__factorial_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;cstdint&gt;</span>    </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;exception&gt;</span>  </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="foldopen" id="foldopen00047" data-start="{" data-end="}">
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">   47</a></span>uint64_t <a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">iterativeFactorial</a>(uint8_t n) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">if</span> (n &gt; 20) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Maximum n value is 20&quot;</span>);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="comment">// 1 because it is the identity number of multiplication.</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    uint64_t accumulator = 1;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordflow">while</span> (n &gt; 1) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        accumulator *= n;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        --n;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">return</span> accumulator;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>}</div>
+</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="foldopen" id="foldopen00069" data-start="{" data-end="}">
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="../../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   69</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="comment">// Special case test</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Exception case test \n&quot;</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>                 <span class="stringliteral">&quot;Input: 0 \n&quot;</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>                 <span class="stringliteral">&quot;Expected output: 1 \n\n&quot;</span>;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a>(0) == 1);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="comment">// Base case</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Base case test \n&quot;</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>                 <span class="stringliteral">&quot;Input: 1 \n&quot;</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>                 <span class="stringliteral">&quot;Expected output: 1 \n\n&quot;</span>;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a>(1) == 1);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="comment">// Small case</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Small number case test \n&quot;</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>                 <span class="stringliteral">&quot;Input: 5 \n&quot;</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>                 <span class="stringliteral">&quot;Expected output: 120 \n\n&quot;</span>;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a>(5) == 120);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="comment">// Medium case</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Medium number case test \n&quot;</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>                 <span class="stringliteral">&quot;Input: 10 \n&quot;</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>                 <span class="stringliteral">&quot;Expected output: 3628800 \n\n&quot;</span>;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a>(10) == 3628800);</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="comment">// Maximum case</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Maximum case test \n&quot;</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>                 <span class="stringliteral">&quot;Input: 20 \n&quot;</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>                 <span class="stringliteral">&quot;Expected output: 2432902008176640000\n\n&quot;</span>;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a>(20) == 2432902008176640000);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="comment">// Exception test</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Exception test \n&quot;</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>                 <span class="stringliteral">&quot;Input: 21 \n&quot;</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>                 <span class="stringliteral">&quot;Expected output: Exception thrown \n&quot;</span>;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="keywordtype">bool</span> wasExceptionThrown = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="keywordflow">try</span> {</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        <a class="code hl_function" href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a>(21);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::invalid_argument&amp;) {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        wasExceptionThrown = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    }</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    assert(wasExceptionThrown);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have passed successfully.\n&quot;</span>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>}</div>
+</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="foldopen" id="foldopen00120" data-start="{" data-end="}">
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"><a class="line" href="../../db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  120</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <a class="code hl_function" href="../../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Run self-test implementation</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>}</div>
+</div>
+<div class="ttc" id="aiterative__factorial_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations to test iterativeFactorial function.</div><div class="ttdef"><b>Definition</b> <a href="#l00069">iterative_factorial.cpp:69</a></div></div>
+<div class="ttc" id="aiterative__factorial_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00120">iterative_factorial.cpp:120</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_a2565c745aac2f9561cc6fd9e56d9b77a"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a">math::iterativeFactorial</a></div><div class="ttdeci">uint64_t iterativeFactorial(uint8_t n)</div><div class="ttdoc">Calculates the factorial iteratively.</div><div class="ttdef"><b>Definition</b> <a href="#l00047">iterative_factorial.cpp:47</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../db/d9f/iterative__factorial_8cpp.html">iterative_factorial.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/da9/classqueue.html b/db/da9/classqueue.html
index adecdac0b..dd775366c 100644
--- a/db/da9/classqueue.html
+++ b/db/da9/classqueue.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: queue&lt; ValueType &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: queue&lt; ValueType &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,22 +136,21 @@ $(function(){initNavTree('db/da9/classqueue.html','../../'); initResizable(true)
 <div class="dynheader">
 Collaboration diagram for queue&lt; ValueType &gt;:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d31/classqueue__coll__graph.svg" width="280" height="332"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d31/classqueue__coll__graph.svg" width="214" height="332"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-types" name="pub-types"></a>
 Public Types</h2></td></tr>
-<tr class="memitem:ab0c58f54d07d7070c48cc2f9fd26aa90" id="r_ab0c58f54d07d7070c48cc2f9fd26aa90"><td class="memItemLeft" align="right" valign="top"><a id="ab0c58f54d07d7070c48cc2f9fd26aa90" name="ab0c58f54d07d7070c48cc2f9fd26aa90"></a>
-using&#160;</td><td class="memItemRight" valign="bottom"><b>value_type</b> = ValueType</td></tr>
+<tr class="memitem:ab0c58f54d07d7070c48cc2f9fd26aa90" id="r_ab0c58f54d07d7070c48cc2f9fd26aa90"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab0c58f54d07d7070c48cc2f9fd26aa90">value_type</a> = ValueType</td></tr>
 <tr class="separator:ab0c58f54d07d7070c48cc2f9fd26aa90"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:a353e4dd5772575905c78b0b30856e368" id="r_a353e4dd5772575905c78b0b30856e368"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a353e4dd5772575905c78b0b30856e368">display</a> () const</td></tr>
-<tr class="memdesc:a353e4dd5772575905c78b0b30856e368"><td class="mdescLeft">&#160;</td><td class="mdescRight">prints the queue into the <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>  <br /></td></tr>
+<tr class="memdesc:a353e4dd5772575905c78b0b30856e368"><td class="mdescLeft">&#160;</td><td class="mdescRight">prints the queue into the std::cout  <br /></td></tr>
 <tr class="separator:a353e4dd5772575905c78b0b30856e368"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a386fc1df8610948d3117b12f24655c7d" id="r_a386fc1df8610948d3117b12f24655c7d"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; value_type &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a386fc1df8610948d3117b12f24655c7d">toVector</a> () const</td></tr>
-<tr class="memdesc:a386fc1df8610948d3117b12f24655c7d"><td class="mdescLeft">&#160;</td><td class="mdescRight">converts the queue into the <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>  <br /></td></tr>
+<tr class="memitem:a386fc1df8610948d3117b12f24655c7d" id="r_a386fc1df8610948d3117b12f24655c7d"><td class="memItemLeft" align="right" valign="top">std::vector&lt; value_type &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a386fc1df8610948d3117b12f24655c7d">toVector</a> () const</td></tr>
+<tr class="memdesc:a386fc1df8610948d3117b12f24655c7d"><td class="mdescLeft">&#160;</td><td class="mdescRight">converts the queue into the std::vector  <br /></td></tr>
 <tr class="separator:a386fc1df8610948d3117b12f24655c7d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a4bc52ad6ed6b0cc33ad05f87f05f8bec" id="r_a4bc52ad6ed6b0cc33ad05f87f05f8bec"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4bc52ad6ed6b0cc33ad05f87f05f8bec">isEmptyQueue</a> () const</td></tr>
 <tr class="memdesc:a4bc52ad6ed6b0cc33ad05f87f05f8bec"><td class="mdescLeft">&#160;</td><td class="mdescRight">checks if the queue has no elements  <br /></td></tr>
@@ -153,8 +169,7 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-types" name="pri-types"></a>
 Private Types</h2></td></tr>
-<tr class="memitem:a509d8e7c43f334eb0e582690305a6519" id="r_a509d8e7c43f334eb0e582690305a6519"><td class="memItemLeft" align="right" valign="top"><a id="a509d8e7c43f334eb0e582690305a6519" name="a509d8e7c43f334eb0e582690305a6519"></a>
-using&#160;</td><td class="memItemRight" valign="bottom"><b>node_type</b> = <a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt;ValueType&gt;</td></tr>
+<tr class="memitem:a509d8e7c43f334eb0e582690305a6519" id="r_a509d8e7c43f334eb0e582690305a6519"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a509d8e7c43f334eb0e582690305a6519">node_type</a> = <a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt;ValueType&gt;</td></tr>
 <tr class="separator:a509d8e7c43f334eb0e582690305a6519"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
@@ -165,18 +180,64 @@ Private Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:af6780e9b43326f557da405b65f7ad094" id="r_af6780e9b43326f557da405b65f7ad094"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../db/d8b/struct_node.html">node_type</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af6780e9b43326f557da405b65f7ad094">queueFront</a></td></tr>
+<tr class="memitem:af6780e9b43326f557da405b65f7ad094" id="r_af6780e9b43326f557da405b65f7ad094"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../db/d8b/struct_node.html">node_type</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af6780e9b43326f557da405b65f7ad094">queueFront</a></td></tr>
 <tr class="separator:af6780e9b43326f557da405b65f7ad094"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a7611df63ebefae613d311039d7305143" id="r_a7611df63ebefae613d311039d7305143"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../db/d8b/struct_node.html">node_type</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7611df63ebefae613d311039d7305143">queueRear</a></td></tr>
+<tr class="memitem:a7611df63ebefae613d311039d7305143" id="r_a7611df63ebefae613d311039d7305143"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../db/d8b/struct_node.html">node_type</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7611df63ebefae613d311039d7305143">queueRear</a></td></tr>
 <tr class="separator:a7611df63ebefae613d311039d7305143"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad30c1f3cc9c107dcc10fc06c8580354e" id="r_ad30c1f3cc9c107dcc10fc06c8580354e"><td class="memItemLeft" align="right" valign="top"><a id="ad30c1f3cc9c107dcc10fc06c8580354e" name="ad30c1f3cc9c107dcc10fc06c8580354e"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><b>size</b> = 0</td></tr>
+<tr class="memitem:ad30c1f3cc9c107dcc10fc06c8580354e" id="r_ad30c1f3cc9c107dcc10fc06c8580354e"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad30c1f3cc9c107dcc10fc06c8580354e">size</a> = 0</td></tr>
 <tr class="separator:ad30c1f3cc9c107dcc10fc06c8580354e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><div class="compoundTemplParams">template&lt;class ValueType&gt;<br />
 class queue&lt; ValueType &gt;</div><p>Definition of the queue class </p>
-</div><h2 class="groupheader">Member Function Documentation</h2>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/ded/queue_8hpp_source.html#l00009">9</a> of file <a class="el" href="../../d7/ded/queue_8hpp_source.html">queue.hpp</a>.</p>
+</div><h2 class="groupheader">Member Typedef Documentation</h2>
+<a id="a509d8e7c43f334eb0e582690305a6519" name="a509d8e7c43f334eb0e582690305a6519"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a509d8e7c43f334eb0e582690305a6519">&#9670;&#160;</a></span>node_type</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;class ValueType &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">using <a class="el" href="../../db/da9/classqueue.html">queue</a>&lt; ValueType &gt;::node_type = <a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt;ValueType&gt;</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/ded/queue_8hpp_source.html#l00010">10</a> of file <a class="el" href="../../d7/ded/queue_8hpp_source.html">queue.hpp</a>.</p>
+
+</div>
+</div>
+<a id="ab0c58f54d07d7070c48cc2f9fd26aa90" name="ab0c58f54d07d7070c48cc2f9fd26aa90"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ab0c58f54d07d7070c48cc2f9fd26aa90">&#9670;&#160;</a></span>value_type</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;class ValueType &gt; </div>
+      <table class="memname">
+        <tr>
+          <td class="memname">using <a class="el" href="../../db/da9/classqueue.html">queue</a>&lt; ValueType &gt;::value_type = ValueType</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/ded/queue_8hpp_source.html#l00013">13</a> of file <a class="el" href="../../d7/ded/queue_8hpp_source.html">queue.hpp</a>.</p>
+
+</div>
+</div>
+<h2 class="groupheader">Member Function Documentation</h2>
 <a id="a6ed7f8dfefe8687841f36f2223069375" name="a6ed7f8dfefe8687841f36f2223069375"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a6ed7f8dfefe8687841f36f2223069375">&#9670;&#160;</a></span>clear()</h2>
 
@@ -203,13 +264,15 @@ template&lt;class ValueType &gt; </div>
 </div><div class="memdoc">
 
 <p>removes all elements from the queue </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/ded/queue_8hpp_source.html#l00090">90</a> of file <a class="el" href="../../d7/ded/queue_8hpp_source.html">queue.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   90</span>                 {</div>
 <div class="line"><span class="lineno">   91</span>        <a class="code hl_variable" href="#af6780e9b43326f557da405b65f7ad094">queueFront</a> = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">   92</span>        <a class="code hl_variable" href="#a7611df63ebefae613d311039d7305143">queueRear</a> = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">   93</span>        size = 0;</div>
 <div class="line"><span class="lineno">   94</span>    }</div>
-<div class="ttc" id="aclassqueue_html_a7611df63ebefae613d311039d7305143"><div class="ttname"><a href="#a7611df63ebefae613d311039d7305143">queue::queueRear</a></div><div class="ttdeci">std::shared_ptr&lt; node_type &gt; queueRear</div><div class="ttdef"><b>Definition</b> queue.hpp:99</div></div>
-<div class="ttc" id="aclassqueue_html_af6780e9b43326f557da405b65f7ad094"><div class="ttname"><a href="#af6780e9b43326f557da405b65f7ad094">queue::queueFront</a></div><div class="ttdeci">std::shared_ptr&lt; node_type &gt; queueFront</div><div class="ttdef"><b>Definition</b> queue.hpp:97</div></div>
+<div class="ttc" id="aclassqueue_html_a7611df63ebefae613d311039d7305143"><div class="ttname"><a href="#a7611df63ebefae613d311039d7305143">queue::queueRear</a></div><div class="ttdeci">std::shared_ptr&lt; node_type &gt; queueRear</div><div class="ttdef"><b>Definition</b> <a href="../../d7/ded/queue_8hpp_source.html#l00099">queue.hpp:99</a></div></div>
+<div class="ttc" id="aclassqueue_html_af6780e9b43326f557da405b65f7ad094"><div class="ttname"><a href="#af6780e9b43326f557da405b65f7ad094">queue::queueFront</a></div><div class="ttdeci">std::shared_ptr&lt; node_type &gt; queueFront</div><div class="ttdef"><b>Definition</b> <a href="../../d7/ded/queue_8hpp_source.html#l00097">queue.hpp:97</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -241,22 +304,19 @@ template&lt;class ValueType &gt; </div>
 <p>removes the first element from the queue </p>
 <dl class="exception"><dt>Exceptions</dt><dd>
   <table class="exception">
-    <tr><td class="paramname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></td><td>if queue is empty </td></tr>
+    <tr><td class="paramname">std::invalid_argument</td><td>if queue is empty </td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/ded/queue_8hpp_source.html#l00081">81</a> of file <a class="el" href="../../d7/ded/queue_8hpp_source.html">queue.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   81</span>                   {</div>
 <div class="line"><span class="lineno">   82</span>        <a class="code hl_function" href="#ac08ebdd38cb4ad74fc0a3f51888da604">ensureNotEmpty</a>();</div>
 <div class="line"><span class="lineno">   83</span>        <a class="code hl_variable" href="#af6780e9b43326f557da405b65f7ad094">queueFront</a> = <a class="code hl_variable" href="#af6780e9b43326f557da405b65f7ad094">queueFront</a>-&gt;next;</div>
 <div class="line"><span class="lineno">   84</span>        --size;</div>
 <div class="line"><span class="lineno">   85</span>    }</div>
-<div class="ttc" id="aclassqueue_html_ac08ebdd38cb4ad74fc0a3f51888da604"><div class="ttname"><a href="#ac08ebdd38cb4ad74fc0a3f51888da604">queue::ensureNotEmpty</a></div><div class="ttdeci">void ensureNotEmpty() const</div><div class="ttdoc">throws an exception if queue is empty</div><div class="ttdef"><b>Definition</b> queue.hpp:38</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph.svg" width="536" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassqueue_html_ac08ebdd38cb4ad74fc0a3f51888da604"><div class="ttname"><a href="#ac08ebdd38cb4ad74fc0a3f51888da604">queue::ensureNotEmpty</a></div><div class="ttdeci">void ensureNotEmpty() const</div><div class="ttdoc">throws an exception if queue is empty</div><div class="ttdef"><b>Definition</b> <a href="../../d7/ded/queue_8hpp_source.html#l00038">queue.hpp:38</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a353e4dd5772575905c78b0b30856e368" name="a353e4dd5772575905c78b0b30856e368"></a>
@@ -284,14 +344,15 @@ template&lt;class ValueType &gt; </div>
 </table>
 </div><div class="memdoc">
 
-<p>prints the queue into the <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> </p>
+<p>prints the queue into the std::cout </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/ded/queue_8hpp_source.html#l00017">17</a> of file <a class="el" href="../../d7/ded/queue_8hpp_source.html">queue.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   17</span>                         {</div>
-<div class="line"><span class="lineno">   18</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Front --&gt; &quot;</span>;</div>
+<div class="line"><span class="lineno">   18</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Front --&gt; &quot;</span>;</div>
 <div class="line"><span class="lineno">   19</span>        display_all(this-&gt;<a class="code hl_variable" href="#af6780e9b43326f557da405b65f7ad094">queueFront</a>.get());</div>
-<div class="line"><span class="lineno">   20</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
-<div class="line"><span class="lineno">   21</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Size of queue: &quot;</span> &lt;&lt; size &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><span class="lineno">   20</span>        std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><span class="lineno">   21</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Size of queue: &quot;</span> &lt;&lt; size &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
 <div class="line"><span class="lineno">   22</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><!-- fragment -->
 </div>
 </div>
@@ -321,8 +382,10 @@ template&lt;class ValueType &gt; </div>
 </div><div class="memdoc">
 
 <p>inserts a new item into the queue </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/ded/queue_8hpp_source.html#l00054">54</a> of file <a class="el" href="../../d7/ded/queue_8hpp_source.html">queue.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   54</span>                                         {</div>
-<div class="line"><span class="lineno">   55</span>        <span class="keyword">auto</span> newNode = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;node_type&gt;</a>();</div>
+<div class="line"><span class="lineno">   55</span>        <span class="keyword">auto</span> newNode = std::make_shared&lt;node_type&gt;();</div>
 <div class="line"><span class="lineno">   56</span>        newNode-&gt;data = item;</div>
 <div class="line"><span class="lineno">   57</span>        newNode-&gt;next = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">   58</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="#a4bc52ad6ed6b0cc33ad05f87f05f8bec">isEmptyQueue</a>()) {</div>
@@ -334,14 +397,8 @@ template&lt;class ValueType &gt; </div>
 <div class="line"><span class="lineno">   64</span>        }</div>
 <div class="line"><span class="lineno">   65</span>        ++size;</div>
 <div class="line"><span class="lineno">   66</span>    }</div>
-<div class="ttc" id="aclassqueue_html_a4bc52ad6ed6b0cc33ad05f87f05f8bec"><div class="ttname"><a href="#a4bc52ad6ed6b0cc33ad05f87f05f8bec">queue::isEmptyQueue</a></div><div class="ttdeci">bool isEmptyQueue() const</div><div class="ttdoc">checks if the queue has no elements</div><div class="ttdef"><b>Definition</b> queue.hpp:49</div></div>
-<div class="ttc" id="amake_shared_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared</a></div><div class="ttdeci">T make_shared(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph.svg" width="326" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassqueue_html_a4bc52ad6ed6b0cc33ad05f87f05f8bec"><div class="ttname"><a href="#a4bc52ad6ed6b0cc33ad05f87f05f8bec">queue::isEmptyQueue</a></div><div class="ttdeci">bool isEmptyQueue() const</div><div class="ttdoc">checks if the queue has no elements</div><div class="ttdef"><b>Definition</b> <a href="../../d7/ded/queue_8hpp_source.html#l00049">queue.hpp:49</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac08ebdd38cb4ad74fc0a3f51888da604" name="ac08ebdd38cb4ad74fc0a3f51888da604"></a>
@@ -372,22 +429,18 @@ template&lt;class ValueType &gt; </div>
 <p>throws an exception if queue is empty </p>
 <dl class="exception"><dt>Exceptions</dt><dd>
   <table class="exception">
-    <tr><td class="paramname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></td><td>if queue is empty </td></tr>
+    <tr><td class="paramname">std::invalid_argument</td><td>if queue is empty </td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/ded/queue_8hpp_source.html#l00038">38</a> of file <a class="el" href="../../d7/ded/queue_8hpp_source.html">queue.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   38</span>                                {</div>
 <div class="line"><span class="lineno">   39</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="#a4bc52ad6ed6b0cc33ad05f87f05f8bec">isEmptyQueue</a>()) {</div>
-<div class="line"><span class="lineno">   40</span>            <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>(<span class="stringliteral">&quot;Queue is empty.&quot;</span>);</div>
+<div class="line"><span class="lineno">   40</span>            <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Queue is empty.&quot;</span>);</div>
 <div class="line"><span class="lineno">   41</span>        }</div>
 <div class="line"><span class="lineno">   42</span>    }</div>
-<div class="ttc" id="ainvalid_argument_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/da9/classqueue_ac08ebdd38cb4ad74fc0a3f51888da604_cgraph.svg" width="372" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a75e231798bc706b8b0773a07f78713e7" name="a75e231798bc706b8b0773a07f78713e7"></a>
@@ -417,20 +470,17 @@ template&lt;class ValueType &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>the first element of the queue </dd></dl>
 <dl class="exception"><dt>Exceptions</dt><dd>
   <table class="exception">
-    <tr><td class="paramname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></td><td>if queue is empty </td></tr>
+    <tr><td class="paramname">std::invalid_argument</td><td>if queue is empty </td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/ded/queue_8hpp_source.html#l00072">72</a> of file <a class="el" href="../../d7/ded/queue_8hpp_source.html">queue.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   72</span>                             {</div>
 <div class="line"><span class="lineno">   73</span>        <a class="code hl_function" href="#ac08ebdd38cb4ad74fc0a3f51888da604">ensureNotEmpty</a>();</div>
 <div class="line"><span class="lineno">   74</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="#af6780e9b43326f557da405b65f7ad094">queueFront</a>-&gt;data;</div>
 <div class="line"><span class="lineno">   75</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/da9/classqueue_a75e231798bc706b8b0773a07f78713e7_cgraph.svg" width="510" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4bc52ad6ed6b0cc33ad05f87f05f8bec" name="a4bc52ad6ed6b0cc33ad05f87f05f8bec"></a>
@@ -460,6 +510,8 @@ template&lt;class ValueType &gt; </div>
 
 <p>checks if the queue has no elements </p>
 <dl class="section return"><dt>Returns</dt><dd>true if the queue is empty, false otherwise </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/ded/queue_8hpp_source.html#l00049">49</a> of file <a class="el" href="../../d7/ded/queue_8hpp_source.html">queue.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   49</span>{ <span class="keywordflow">return</span> (<a class="code hl_variable" href="#af6780e9b43326f557da405b65f7ad094">queueFront</a> == <span class="keyword">nullptr</span>); }</div>
 </div><!-- fragment -->
 </div>
@@ -476,7 +528,7 @@ template&lt;class ValueType &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; value_type &gt; <a class="el" href="../../db/da9/classqueue.html">queue</a>&lt; ValueType &gt;::toVector </td>
+          <td class="memname">std::vector&lt; value_type &gt; <a class="el" href="../../db/da9/classqueue.html">queue</a>&lt; ValueType &gt;::toVector </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td> const</td>
@@ -489,8 +541,10 @@ template&lt;class ValueType &gt; </div>
 </table>
 </div><div class="memdoc">
 
-<p>converts the queue into the <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
-<dl class="section return"><dt>Returns</dt><dd><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> containning all of the elements of the queue in the same order </dd></dl>
+<p>converts the queue into the std::vector </p>
+<dl class="section return"><dt>Returns</dt><dd>std::vector containning all of the elements of the queue in the same order </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/ded/queue_8hpp_source.html#l00029">29</a> of file <a class="el" href="../../d7/ded/queue_8hpp_source.html">queue.hpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   29</span>                                           {</div>
 <div class="line"><span class="lineno">   30</span>        <span class="keywordflow">return</span> push_all_to_vector(this-&gt;<a class="code hl_variable" href="#af6780e9b43326f557da405b65f7ad094">queueFront</a>.get(), this-&gt;size);</div>
 <div class="line"><span class="lineno">   31</span>    }</div>
@@ -510,7 +564,7 @@ template&lt;class ValueType &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt;<a class="el" href="../../db/d8b/struct_node.html">node_type</a>&gt; <a class="el" href="../../db/da9/classqueue.html">queue</a>&lt; ValueType &gt;::queueFront</td>
+          <td class="memname">std::shared_ptr&lt;<a class="el" href="../../db/d8b/struct_node.html">node_type</a>&gt; <a class="el" href="../../db/da9/classqueue.html">queue</a>&lt; ValueType &gt;::queueFront</td>
         </tr>
       </table>
   </td>
@@ -522,7 +576,9 @@ template&lt;class ValueType &gt; </div>
 <b>Initial value:</b><div class="fragment"><div class="line">=</div>
 <div class="line">        {}</div>
 </div><!-- fragment --><p>Pointer to the front of the queue </p>
-<div class="fragment"><div class="line"><span class="lineno">   98</span>        {}; <span class="comment">/**&lt; Pointer to the front of the queue */</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/ded/queue_8hpp_source.html#l00097">97</a> of file <a class="el" href="../../d7/ded/queue_8hpp_source.html">queue.hpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   98</span>        {}; </div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -538,7 +594,7 @@ template&lt;class ValueType &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt;<a class="el" href="../../db/d8b/struct_node.html">node_type</a>&gt; <a class="el" href="../../db/da9/classqueue.html">queue</a>&lt; ValueType &gt;::queueRear</td>
+          <td class="memname">std::shared_ptr&lt;<a class="el" href="../../db/d8b/struct_node.html">node_type</a>&gt; <a class="el" href="../../db/da9/classqueue.html">queue</a>&lt; ValueType &gt;::queueRear</td>
         </tr>
       </table>
   </td>
@@ -551,8 +607,36 @@ template&lt;class ValueType &gt; </div>
 <div class="line">        {}</div>
 </div><!-- fragment --><p>Pointer to the rear of the queue <br  />
  </p>
-<div class="fragment"><div class="line"><span class="lineno">  100</span>        {}; <span class="comment">/**&lt; Pointer to the rear of the queue  */</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/ded/queue_8hpp_source.html#l00099">99</a> of file <a class="el" href="../../d7/ded/queue_8hpp_source.html">queue.hpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  100</span>        {}; </div>
 </div><!-- fragment -->
+</div>
+</div>
+<a id="ad30c1f3cc9c107dcc10fc06c8580354e" name="ad30c1f3cc9c107dcc10fc06c8580354e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ad30c1f3cc9c107dcc10fc06c8580354e">&#9670;&#160;</a></span>size</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;class ValueType &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::size_t <a class="el" href="../../db/da9/classqueue.html">queue</a>&lt; ValueType &gt;::size = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/ded/queue_8hpp_source.html#l00101">101</a> of file <a class="el" href="../../d7/ded/queue_8hpp_source.html">queue.hpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
diff --git a/db/da9/classqueue_a75e231798bc706b8b0773a07f78713e7_cgraph.map b/db/da9/classqueue_a75e231798bc706b8b0773a07f78713e7_cgraph.map
deleted file mode 100644
index 34e52f502..000000000
--- a/db/da9/classqueue_a75e231798bc706b8b0773a07f78713e7_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="queue::front" name="queue::front">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,96,31"/>
-<area shape="rect" id="Node000002" href="$db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604" title="throws an exception if queue is empty" alt="" coords="144,5,306,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="96,16,128,16,128,21,96,21"/>
-<area shape="rect" id="Node000003" href="$db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec" title="checks if the queue has no elements" alt="" coords="354,5,504,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="306,16,339,16,339,21,306,21"/>
-</map>
diff --git a/db/da9/classqueue_a75e231798bc706b8b0773a07f78713e7_cgraph.md5 b/db/da9/classqueue_a75e231798bc706b8b0773a07f78713e7_cgraph.md5
deleted file mode 100644
index bb521a6bf..000000000
--- a/db/da9/classqueue_a75e231798bc706b8b0773a07f78713e7_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-42d364e23137d9bd8d645f3d20254653
\ No newline at end of file
diff --git a/db/da9/classqueue_a75e231798bc706b8b0773a07f78713e7_cgraph.svg b/db/da9/classqueue_a75e231798bc706b8b0773a07f78713e7_cgraph.svg
deleted file mode 100644
index d5cbdd8a8..000000000
--- a/db/da9/classqueue_a75e231798bc706b8b0773a07f78713e7_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: queue::front Pages: 1 -->
-<svg width="382pt" height="27pt"
- viewBox="0.00 0.00 382.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>queue::front</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="67.75,-19.25 0,-19.25 0,0 67.75,0 67.75,-19.25"/>
-<text text-anchor="middle" x="33.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604" target="_top" xlink:title="throws an exception if queue is empty">
-<polygon fill="white" stroke="#666666" points="225.5,-19.25 103.75,-19.25 103.75,0 225.5,0 225.5,-19.25"/>
-<text text-anchor="middle" x="164.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::ensureNotEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M68.03,-9.62C75.46,-9.62 83.62,-9.62 91.94,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.83,-13.13 101.83,-9.63 91.83,-6.13 91.83,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec" target="_top" xlink:title="checks if the queue has no elements">
-<polygon fill="white" stroke="#666666" points="374.25,-19.25 261.5,-19.25 261.5,0 374.25,0 374.25,-19.25"/>
-<text text-anchor="middle" x="317.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::isEmptyQueue</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M225.84,-9.62C233.79,-9.62 241.98,-9.62 250.03,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="249.77,-13.13 259.77,-9.63 249.77,-6.13 249.77,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/da9/classqueue_a75e231798bc706b8b0773a07f78713e7_cgraph_org.svg b/db/da9/classqueue_a75e231798bc706b8b0773a07f78713e7_cgraph_org.svg
deleted file mode 100644
index 679d64981..000000000
--- a/db/da9/classqueue_a75e231798bc706b8b0773a07f78713e7_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: queue::front Pages: 1 -->
-<svg width="382pt" height="27pt"
- viewBox="0.00 0.00 382.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>queue::front</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="67.75,-19.25 0,-19.25 0,0 67.75,0 67.75,-19.25"/>
-<text text-anchor="middle" x="33.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604" target="_top" xlink:title="throws an exception if queue is empty">
-<polygon fill="white" stroke="#666666" points="225.5,-19.25 103.75,-19.25 103.75,0 225.5,0 225.5,-19.25"/>
-<text text-anchor="middle" x="164.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::ensureNotEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M68.03,-9.62C75.46,-9.62 83.62,-9.62 91.94,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.83,-13.13 101.83,-9.63 91.83,-6.13 91.83,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec" target="_top" xlink:title="checks if the queue has no elements">
-<polygon fill="white" stroke="#666666" points="374.25,-19.25 261.5,-19.25 261.5,0 374.25,0 374.25,-19.25"/>
-<text text-anchor="middle" x="317.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::isEmptyQueue</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M225.84,-9.62C233.79,-9.62 241.98,-9.62 250.03,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="249.77,-13.13 259.77,-9.63 249.77,-6.13 249.77,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/da9/classqueue_ac08ebdd38cb4ad74fc0a3f51888da604_cgraph.map b/db/da9/classqueue_ac08ebdd38cb4ad74fc0a3f51888da604_cgraph.map
deleted file mode 100644
index e7f284ea9..000000000
--- a/db/da9/classqueue_ac08ebdd38cb4ad74fc0a3f51888da604_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="queue::ensureNotEmpty" name="queue::ensureNotEmpty">
-<area shape="rect" id="Node000001" title="throws an exception if queue is empty" alt="" coords="5,5,168,31"/>
-<area shape="rect" id="Node000002" href="$db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec" title="checks if the queue has no elements" alt="" coords="216,5,366,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="168,16,200,16,200,21,168,21"/>
-</map>
diff --git a/db/da9/classqueue_ac08ebdd38cb4ad74fc0a3f51888da604_cgraph.md5 b/db/da9/classqueue_ac08ebdd38cb4ad74fc0a3f51888da604_cgraph.md5
deleted file mode 100644
index 6ed4a7766..000000000
--- a/db/da9/classqueue_ac08ebdd38cb4ad74fc0a3f51888da604_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5a4a625cdfd2f8f12b75980e0f5e9945
\ No newline at end of file
diff --git a/db/da9/classqueue_ac08ebdd38cb4ad74fc0a3f51888da604_cgraph.svg b/db/da9/classqueue_ac08ebdd38cb4ad74fc0a3f51888da604_cgraph.svg
deleted file mode 100644
index 969eb6be7..000000000
--- a/db/da9/classqueue_ac08ebdd38cb4ad74fc0a3f51888da604_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: queue::ensureNotEmpty Pages: 1 -->
-<svg width="279pt" height="27pt"
- viewBox="0.00 0.00 278.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>queue::ensureNotEmpty</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="throws an exception if queue is empty">
-<polygon fill="#999999" stroke="#666666" points="121.75,-19.25 0,-19.25 0,0 121.75,0 121.75,-19.25"/>
-<text text-anchor="middle" x="60.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::ensureNotEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec" target="_top" xlink:title="checks if the queue has no elements">
-<polygon fill="white" stroke="#666666" points="270.5,-19.25 157.75,-19.25 157.75,0 270.5,0 270.5,-19.25"/>
-<text text-anchor="middle" x="214.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::isEmptyQueue</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.09,-9.62C130.04,-9.62 138.23,-9.62 146.28,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.02,-13.13 156.02,-9.63 146.02,-6.13 146.02,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/da9/classqueue_ac08ebdd38cb4ad74fc0a3f51888da604_cgraph_org.svg b/db/da9/classqueue_ac08ebdd38cb4ad74fc0a3f51888da604_cgraph_org.svg
deleted file mode 100644
index 19168e6c3..000000000
--- a/db/da9/classqueue_ac08ebdd38cb4ad74fc0a3f51888da604_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: queue::ensureNotEmpty Pages: 1 -->
-<svg width="279pt" height="27pt"
- viewBox="0.00 0.00 278.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>queue::ensureNotEmpty</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="throws an exception if queue is empty">
-<polygon fill="#999999" stroke="#666666" points="121.75,-19.25 0,-19.25 0,0 121.75,0 121.75,-19.25"/>
-<text text-anchor="middle" x="60.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::ensureNotEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec" target="_top" xlink:title="checks if the queue has no elements">
-<polygon fill="white" stroke="#666666" points="270.5,-19.25 157.75,-19.25 157.75,0 270.5,0 270.5,-19.25"/>
-<text text-anchor="middle" x="214.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::isEmptyQueue</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.09,-9.62C130.04,-9.62 138.23,-9.62 146.28,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.02,-13.13 156.02,-9.63 146.02,-6.13 146.02,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph.map b/db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph.map
deleted file mode 100644
index c3f6544e6..000000000
--- a/db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="queue::enQueue" name="queue::enQueue">
-<area shape="rect" id="Node000001" title="inserts a new item into the queue" alt="" coords="5,31,122,56"/>
-<area shape="rect" id="Node000002" href="$db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec" title="checks if the queue has no elements" alt="" coords="170,5,320,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="121,33,154,28,155,33,122,38"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="182,55,308,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="122,49,167,55,167,60,122,54"/>
-</map>
diff --git a/db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph.md5 b/db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph.md5
deleted file mode 100644
index 993d03d85..000000000
--- a/db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d3f453739f446945095205a5437a8b7b
\ No newline at end of file
diff --git a/db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph.svg b/db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph.svg
deleted file mode 100644
index 2d8df534e..000000000
--- a/db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: queue::enQueue Pages: 1 -->
-<svg width="244pt" height="64pt"
- viewBox="0.00 0.00 244.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>queue::enQueue</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="inserts a new item into the queue">
-<polygon fill="#999999" stroke="#666666" points="87.25,-37.25 0,-37.25 0,-18 87.25,-18 87.25,-37.25"/>
-<text text-anchor="middle" x="43.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::enQueue</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec" target="_top" xlink:title="checks if the queue has no elements">
-<polygon fill="white" stroke="#666666" points="236,-56.25 123.25,-56.25 123.25,-37 236,-37 236,-56.25"/>
-<text text-anchor="middle" x="179.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::isEmptyQueue</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.39,-33.69C95.19,-34.79 103.48,-35.97 111.78,-37.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.15,-40.59 121.54,-38.53 112.13,-33.66 111.15,-40.59"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.62,-19.25 132.62,-19.25 132.62,0 226.62,0 226.62,-19.25"/>
-<text text-anchor="middle" x="179.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.39,-21.88C98.19,-20.43 109.96,-18.85 121.35,-17.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="121.61,-20.81 131.06,-16.01 120.68,-13.88 121.61,-20.81"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph_org.svg b/db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph_org.svg
deleted file mode 100644
index 87704e6b2..000000000
--- a/db/da9/classqueue_ada88d0c1f34946d66386b7a11bee4e4d_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: queue::enQueue Pages: 1 -->
-<svg width="244pt" height="64pt"
- viewBox="0.00 0.00 244.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>queue::enQueue</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="inserts a new item into the queue">
-<polygon fill="#999999" stroke="#666666" points="87.25,-37.25 0,-37.25 0,-18 87.25,-18 87.25,-37.25"/>
-<text text-anchor="middle" x="43.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::enQueue</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec" target="_top" xlink:title="checks if the queue has no elements">
-<polygon fill="white" stroke="#666666" points="236,-56.25 123.25,-56.25 123.25,-37 236,-37 236,-56.25"/>
-<text text-anchor="middle" x="179.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::isEmptyQueue</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.39,-33.69C95.19,-34.79 103.48,-35.97 111.78,-37.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.15,-40.59 121.54,-38.53 112.13,-33.66 111.15,-40.59"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.62,-19.25 132.62,-19.25 132.62,0 226.62,0 226.62,-19.25"/>
-<text text-anchor="middle" x="179.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.39,-21.88C98.19,-20.43 109.96,-18.85 121.35,-17.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="121.61,-20.81 131.06,-16.01 120.68,-13.88 121.61,-20.81"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph.map b/db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph.map
deleted file mode 100644
index d687ba3a0..000000000
--- a/db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="queue::deQueue" name="queue::deQueue">
-<area shape="rect" id="Node000001" title="removes the first element from the queue" alt="" coords="5,5,122,31"/>
-<area shape="rect" id="Node000002" href="$db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604" title="throws an exception if queue is empty" alt="" coords="170,5,332,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="122,16,154,16,154,21,122,21"/>
-<area shape="rect" id="Node000003" href="$db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec" title="checks if the queue has no elements" alt="" coords="380,5,530,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="332,16,365,16,365,21,332,21"/>
-</map>
diff --git a/db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph.md5 b/db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph.md5
deleted file mode 100644
index 5c980bad8..000000000
--- a/db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3477881256f23be0473b9d7b7ae11d21
\ No newline at end of file
diff --git a/db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph.svg b/db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph.svg
deleted file mode 100644
index 062db8d7a..000000000
--- a/db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: queue::deQueue Pages: 1 -->
-<svg width="402pt" height="27pt"
- viewBox="0.00 0.00 401.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>queue::deQueue</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="removes the first element from the queue">
-<polygon fill="#999999" stroke="#666666" points="87.25,-19.25 0,-19.25 0,0 87.25,0 87.25,-19.25"/>
-<text text-anchor="middle" x="43.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::deQueue</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604" target="_top" xlink:title="throws an exception if queue is empty">
-<polygon fill="white" stroke="#666666" points="245,-19.25 123.25,-19.25 123.25,0 245,0 245,-19.25"/>
-<text text-anchor="middle" x="184.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::ensureNotEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.69,-9.62C95.24,-9.62 103.29,-9.62 111.38,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.29,-13.13 121.29,-9.63 111.29,-6.13 111.29,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec" target="_top" xlink:title="checks if the queue has no elements">
-<polygon fill="white" stroke="#666666" points="393.75,-19.25 281,-19.25 281,0 393.75,0 393.75,-19.25"/>
-<text text-anchor="middle" x="337.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::isEmptyQueue</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.34,-9.62C253.29,-9.62 261.48,-9.62 269.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.27,-13.13 279.27,-9.63 269.27,-6.13 269.27,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph_org.svg b/db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph_org.svg
deleted file mode 100644
index 44951284d..000000000
--- a/db/da9/classqueue_af27dbb72fb63f58f817a88550d7faa85_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: queue::deQueue Pages: 1 -->
-<svg width="402pt" height="27pt"
- viewBox="0.00 0.00 401.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>queue::deQueue</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="removes the first element from the queue">
-<polygon fill="#999999" stroke="#666666" points="87.25,-19.25 0,-19.25 0,0 87.25,0 87.25,-19.25"/>
-<text text-anchor="middle" x="43.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::deQueue</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604" target="_top" xlink:title="throws an exception if queue is empty">
-<polygon fill="white" stroke="#666666" points="245,-19.25 123.25,-19.25 123.25,0 245,0 245,-19.25"/>
-<text text-anchor="middle" x="184.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::ensureNotEmpty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.69,-9.62C95.24,-9.62 103.29,-9.62 111.38,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.29,-13.13 121.29,-9.63 111.29,-6.13 111.29,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec" target="_top" xlink:title="checks if the queue has no elements">
-<polygon fill="white" stroke="#666666" points="393.75,-19.25 281,-19.25 281,0 393.75,0 393.75,-19.25"/>
-<text text-anchor="middle" x="337.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue::isEmptyQueue</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.34,-9.62C253.29,-9.62 261.48,-9.62 269.53,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.27,-13.13 279.27,-9.63 269.27,-6.13 269.27,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/db2/counting__sort__string_8cpp_source.html b/db/db2/counting__sort__string_8cpp_source.html
new file mode 100644
index 000000000..9dd74c435
--- /dev/null
+++ b/db/db2/counting__sort__string_8cpp_source.html
@@ -0,0 +1,171 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/counting_sort_string.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/db2/counting__sort__string_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">counting_sort_string.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">// C++ Program for counting sort</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="keywordtype">void</span> countSort(<span class="keywordtype">string</span> arr) {</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span>    <span class="keywordtype">string</span> output;</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    <span class="keywordtype">int</span> count[256], i;</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 256; i++) count[i] = 0;</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="keywordflow">for</span> (i = 0; arr[i]; ++i) ++count[arr[i]];</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordflow">for</span> (i = 1; i &lt; 256; ++i) count[i] += count[i - 1];</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <span class="keywordflow">for</span> (i = 0; arr[i]; ++i) {</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>        output[count[arr[i]] - 1] = arr[i];</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        --count[arr[i]];</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    }</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keywordflow">for</span> (i = 0; arr[i]; ++i) arr[i] = output[i];</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    cout &lt;&lt; <span class="stringliteral">&quot;Sorted character array is &quot;</span> &lt;&lt; arr;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>}</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordtype">string</span> arr;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    cin &gt;&gt; arr;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    countSort(arr);</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><b>counting_sort_string.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/db5/slow__sort_8cpp_source.html b/db/db5/slow__sort_8cpp_source.html
new file mode 100644
index 000000000..557cbab73
--- /dev/null
+++ b/db/db5/slow__sort_8cpp_source.html
@@ -0,0 +1,194 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/slow_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/db5/slow__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">slow_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">// Returns the sorted vector after performing SlowSort</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment">// It is a sorting algorithm that is of humorous nature and not useful.</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment">// It&#39;s based on the principle of multiply and surrender, a tongue-in-cheek joke</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment">// of divide and conquer. It was published in 1986 by Andrei Broder and Jorge</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment">// Stolfi in their paper Pessimal Algorithms and Simplexity Analysis. This</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment">// algorithm multiplies a single problem into multiple subproblems It is</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment">// interesting because it is provably the least efficient sorting algorithm that</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment">// can be built asymptotically, and with the restriction that such an algorithm,</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment">// while being slow, must still all the time be working towards a result.</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="keywordtype">void</span> SlowSort(<span class="keywordtype">int</span> a[], <span class="keywordtype">int</span> i, <span class="keywordtype">int</span> j) {</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordflow">if</span> (i &gt;= j)</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <span class="keywordtype">int</span> m = i + (j - i) / 2;  <span class="comment">// midpoint, implemented this way to avoid</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>                              <span class="comment">// overflow</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="keywordtype">int</span> temp;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    SlowSort(a, i, m);</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    SlowSort(a, m + 1, j);</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keywordflow">if</span> (a[j] &lt; a[m]) {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        temp = a[j];  <span class="comment">// swapping a[j] &amp; a[m]</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        a[j] = a[m];</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        a[m] = temp;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    }</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    SlowSort(a, i, j - 1);</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>}</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment">// Sample Main function</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordtype">int</span> size;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the number of elements : &quot;</span>;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    std::cin &gt;&gt; size;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordtype">int</span> *arr = <span class="keyword">new</span> <span class="keywordtype">int</span>[size];</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the unsorted elements : &quot;</span>;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        std::cin &gt;&gt; arr[i];</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    }</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    SlowSort(arr, 0, size);</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted array\n&quot;</span>;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    }</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keyword">delete</span>[] arr;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><b>slow_sort.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/dbc/tree__234_8cpp.html b/db/dbc/tree__234_8cpp.html
index 491fe1c62..1b80bc9d0 100644
--- a/db/dbc/tree__234_8cpp.html
+++ b/db/dbc/tree__234_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/tree_234.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/tree_234.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -126,7 +143,9 @@ Include dependency graph for tree_234.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/dc8/tree__234_8cpp__incl.svg" width="584" height="126"><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">
+</div>
+<p><a href="../../db/dbc/tree__234_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">data_structures::tree_234::Node</a></td></tr>
@@ -160,6 +179,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A demo 2-3-4 tree implementation. </p>
 <p>2–3–4 tree is a self-balancing data structure that is an isometry of red–black trees. Though we seldom use them in practice, we study them to understand the theory behind Red-Black tree. Please read following links for more infomation. <a href="https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree" target="_blank">2–3–4 tree</a> <a href="https://www.educative.io/page/5689413791121408/80001" target="_blank">2-3-4 Trees: A Visual Introduction</a> We Only implement some basic and complicated operations in this demo. Other operations should be easy to be added. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/fedom" target="_blank">liuhuan</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">&#9670;&#160;</a></span>main()</h2>
@@ -189,24 +210,20 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l01298">1298</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1298</span>                                 {</div>
 <div class="line"><span class="lineno"> 1299</span>    <span class="keywordflow">if</span> (argc &lt; 2) {</div>
 <div class="line"><span class="lineno"> 1300</span>        <a class="code hl_function" href="#ae7880ce913f3058a35ff106d5be9e243">test1</a>();  <span class="comment">// execute 1st test</span></div>
 <div class="line"><span class="lineno"> 1301</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno"> 1302</span>        <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html">std::stoi</a>(argv[1]));  <span class="comment">// execute 2nd test</span></div>
+<div class="line"><span class="lineno"> 1302</span>        <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>(std::stoi(argv[1]));  <span class="comment">// execute 2nd test</span></div>
 <div class="line"><span class="lineno"> 1303</span>    }</div>
 <div class="line"><span class="lineno"> 1304</span> </div>
 <div class="line"><span class="lineno"> 1305</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno"> 1306</span>}</div>
-<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:187</div></div>
-<div class="ttc" id="astol_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html">std::stoi</a></div><div class="ttdeci">T stoi(T... args)</div></div>
-<div class="ttc" id="atree__234_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">simple test to insert a given array and delete some item, and print the tree</div><div class="ttdef"><b>Definition</b> tree_234.cpp:1263</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00187">dsu_path_compression.cpp:187</a></div></div>
+<div class="ttc" id="atree__234_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">simple test to insert a given array and delete some item, and print the tree</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l01263">tree_234.cpp:1263</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae7880ce913f3058a35ff106d5be9e243" name="ae7880ce913f3058a35ff106d5be9e243"></a>
@@ -233,8 +250,10 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>simple test to insert a given array and delete some item, and print the tree </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l01263">1263</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1263</span>                    {</div>
-<div class="line"><span class="lineno"> 1264</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int16_t, 13&gt;</a> arr = {3, 1, 5, 4, 2, 9, 10, 8, 7, 6, 16, 13, 14};</div>
+<div class="line"><span class="lineno"> 1264</span>    std::array&lt;int16_t, 13&gt; arr = {3, 1, 5, 4, 2, 9, 10, 8, 7, 6, 16, 13, 14};</div>
 <div class="line"><span class="lineno"> 1265</span>    <a class="code hl_class" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">data_structures::tree_234::Tree234</a> tree;</div>
 <div class="line"><span class="lineno"> 1266</span> </div>
 <div class="line"><span class="lineno"> 1267</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : arr) {</div>
@@ -245,17 +264,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno"> 1272</span>    tree.<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11">Remove</a>(5);</div>
 <div class="line"><span class="lineno"> 1273</span>    tree.<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165">Print</a>();</div>
 <div class="line"><span class="lineno"> 1274</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">data_structures::tree_234::Tree234</a></div><div class="ttdoc">2-3-4 tree class</div><div class="ttdef"><b>Definition</b> tree_234.cpp:323</div></div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a2e9a9db7792cf5383f4c4cc418255165"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165">data_structures::tree_234::Tree234::Print</a></div><div class="ttdeci">void Print(const char *file_name=nullptr)</div><div class="ttdoc">Print tree into a dot file.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:1131</div></div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a5da1be3f5b5d967ebb36a201f3ebad11"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11">data_structures::tree_234::Tree234::Remove</a></div><div class="ttdeci">bool Remove(int64_t item)</div><div class="ttdoc">Remove item from tree.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:929</div></div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a6749ebb40710c9752a2771eda03c6b3e"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">data_structures::tree_234::Tree234::Insert</a></div><div class="ttdeci">void Insert(int64_t item)</div><div class="ttdoc">Insert item to tree.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:655</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">data_structures::tree_234::Tree234</a></div><div class="ttdoc">2-3-4 tree class</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00323">tree_234.cpp:323</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a2e9a9db7792cf5383f4c4cc418255165"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165">data_structures::tree_234::Tree234::Print</a></div><div class="ttdeci">void Print(const char *file_name=nullptr)</div><div class="ttdoc">Print tree into a dot file.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l01131">tree_234.cpp:1131</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a5da1be3f5b5d967ebb36a201f3ebad11"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11">data_structures::tree_234::Tree234::Remove</a></div><div class="ttdeci">bool Remove(int64_t item)</div><div class="ttdoc">Remove item from tree.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00929">tree_234.cpp:929</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a6749ebb40710c9752a2771eda03c6b3e"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">data_structures::tree_234::Tree234::Insert</a></div><div class="ttdeci">void Insert(int64_t item)</div><div class="ttdoc">Insert item to tree.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00655">tree_234.cpp:655</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af1ac73779b0fcfbbdce3976c0ca57342" name="af1ac73779b0fcfbbdce3976c0ca57342"></a>
@@ -288,6 +301,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l01281">1281</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno"> 1281</span>                             {</div>
 <div class="line"><span class="lineno"> 1282</span>    <a class="code hl_class" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">data_structures::tree_234::Tree234</a> tree;</div>
 <div class="line"><span class="lineno"> 1283</span> </div>
@@ -296,16 +311,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno"> 1286</span>    }</div>
 <div class="line"><span class="lineno"> 1287</span> </div>
 <div class="line"><span class="lineno"> 1288</span>    tree.<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd">Traverse</a>();</div>
-<div class="line"><span class="lineno"> 1289</span>    tree.<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165">Print</a>((<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html">std::to_string</a>(n) + <span class="stringliteral">&quot;.dot&quot;</span>).c_str());</div>
+<div class="line"><span class="lineno"> 1289</span>    tree.<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165">Print</a>((std::to_string(n) + <span class="stringliteral">&quot;.dot&quot;</span>).c_str());</div>
 <div class="line"><span class="lineno"> 1290</span>}</div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a84ab7b4fe7442b5e2eeed8c050bb86bd"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd">data_structures::tree_234::Tree234::Traverse</a></div><div class="ttdeci">void Traverse()</div><div class="ttdoc">In-order traverse.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:562</div></div>
-<div class="ttc" id="ato_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html">std::to_string</a></div><div class="ttdeci">T to_string(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a84ab7b4fe7442b5e2eeed8c050bb86bd"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd">data_structures::tree_234::Tree234::Traverse</a></div><div class="ttdeci">void Traverse()</div><div class="ttdoc">In-order traverse.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00562">tree_234.cpp:562</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
deleted file mode 100644
index 9b45b2ca2..000000000
--- a/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ /dev/null
@@ -1,109 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,356,55,381"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/stol.html#" title=" " alt="" coords="103,306,171,332"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,355,92,337,95,341,56,360"/>
-<area shape="rect" id="Node000003" href="$db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" title="simple test to insert a given array and delete some item, and print the tree" alt="" coords="112,356,162,381"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,366,96,366,96,371,55,371"/>
-<area shape="rect" id="Node000038" href="$d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" title="Self&#45;implementations, 2nd test." alt="" coords="112,909,162,934"/>
-<area shape="poly" id="edge44_Node000001_Node000038" title=" " alt="" coords="36,381,133,893,128,894,31,382"/>
-<area shape="rect" id="Node000004" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e" title="Insert item to tree." alt="" coords="227,304,372,345"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="162,359,211,345,213,351,163,364"/>
-<area shape="rect" id="Node000014" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165" title="Print tree into a dot file." alt="" coords="229,137,370,178"/>
-<area shape="poly" id="edge14_Node000003_Node000014" title=" " alt="" coords="157,353,169,342,202,304,232,264,278,190,282,193,236,266,206,308,173,346,161,357"/>
-<area shape="rect" id="Node000019" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11" title="Remove item from tree." alt="" coords="219,549,380,590"/>
-<area shape="poly" id="edge19_Node000003_Node000019" title=" " alt="" coords="151,380,275,536,271,539,147,383"/>
-<area shape="rect" id="Node000005" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d" title="A insert implementation of pre&#45;split." alt="" coords="441,260,633,301"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="372,308,426,298,427,303,373,314"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/unique_ptr/get.html#" title=" " alt="" coords="738,268,871,293"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="633,278,722,278,722,283,633,283"/>
-<area shape="rect" id="Node000007" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" title="Merge node to a not&#45;full target node." alt="" coords="694,136,915,177"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="621,257,644,245,659,231,667,218,676,203,692,189,705,181,708,186,695,193,681,207,672,220,663,235,647,249,623,262"/>
-<area shape="rect" id="Node000013" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node." alt="" coords="720,203,889,243"/>
-<area shape="poly" id="edge13_Node000005_Node000013" title=" " alt="" coords="633,257,704,242,706,247,634,262"/>
-<area shape="rect" id="Node000008" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" title="Insert item to the proper position of the node and return the position index." alt="" coords="989,72,1144,113"/>
-<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="890,133,973,112,974,118,891,138"/>
-<area shape="rect" id="Node000011" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" title="Check if node is a full (4&#45;node)" alt="" coords="1249,136,1391,177"/>
-<area shape="poly" id="edge11_Node000007_Node000011" title=" " alt="" coords="915,154,1234,154,1234,159,915,159"/>
-<area shape="rect" id="Node000012" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" title="Set child pointer to the position of index." alt="" coords="994,452,1140,493"/>
-<area shape="poly" id="edge12_Node000007_Node000012" title=" " alt="" coords="900,175,917,189,938,221,946,253,946,284,942,315,937,346,937,376,945,407,965,437,981,451,978,455,961,441,940,409,932,377,932,345,936,315,941,284,941,254,933,223,913,193,897,179"/>
-<area shape="rect" id="Node000009" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" title="Check if item is in the node." alt="" coords="1246,5,1394,46"/>
-<area shape="poly" id="edge8_Node000008_Node000009" title=" " alt="" coords="1144,69,1230,47,1231,52,1146,74"/>
-<area shape="rect" id="Node000010" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" title="Insert a value to the index position." alt="" coords="1218,71,1422,111"/>
-<area shape="poly" id="edge9_Node000008_Node000010" title=" " alt="" coords="1145,89,1203,89,1203,94,1145,95"/>
-<area shape="poly" id="edge10_Node000008_Node000011" title=" " alt="" coords="1146,109,1235,132,1233,137,1144,115"/>
-<area shape="rect" id="Node000015" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="468,46,606,72"/>
-<area shape="poly" id="edge15_Node000014_Node000015" title=" " alt="" coords="329,135,374,107,427,81,452,72,454,77,429,85,377,111,332,139"/>
-<area shape="rect" id="Node000016" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="501,96,573,121"/>
-<area shape="poly" id="edge16_Node000014_Node000016" title=" " alt="" coords="370,140,486,116,487,121,371,146"/>
-<area shape="rect" id="Node000017" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="470,145,604,170"/>
-<area shape="poly" id="edge17_Node000014_Node000017" title=" " alt="" coords="371,155,454,155,454,160,371,160"/>
-<area shape="rect" id="Node000018" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be" title="Print the tree to a dot file. You can convert it to picture with graphviz." alt="" coords="452,195,622,235"/>
-<area shape="poly" id="edge18_Node000014_Node000018" title=" " alt="" coords="371,172,437,188,436,193,370,177"/>
-<area shape="rect" id="Node000020" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4" title="Main function implement the pre&#45;merge remove operation." alt="" coords="428,636,646,677"/>
-<area shape="poly" id="edge20_Node000019_Node000020" title=" " alt="" coords="359,588,466,628,464,633,357,593"/>
-<area shape="rect" id="Node000021" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657" title="Get the max item of the tree." alt="" coords="699,317,910,358"/>
-<area shape="poly" id="edge21_Node000020_Node000021" title=" " alt="" coords="542,635,559,582,589,512,633,438,661,403,692,373,705,364,708,368,695,377,665,407,638,441,594,515,564,584,547,637"/>
-<area shape="rect" id="Node000024" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36" title="Get the min item of the tree." alt="" coords="701,387,908,427"/>
-<area shape="poly" id="edge24_Node000020_Node000024" title=" " alt="" coords="559,634,768,436,772,440,562,637"/>
-<area shape="rect" id="Node000027" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" title="Check if node is a 2&#45;node." alt="" coords="994,844,1139,885"/>
-<area shape="poly" id="edge27_Node000020_Node000027" title=" " alt="" coords="560,675,617,728,654,756,695,779,979,843,978,848,693,784,652,760,614,732,556,679"/>
-<area shape="rect" id="Node000028" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18" title="Check if node is a 3&#45;node or 4&#45;node, this is useful when we delete item from 2&#45;3&#45;4 tree." alt="" coords="728,549,880,590"/>
-<area shape="poly" id="edge28_Node000020_Node000028" title=" " alt="" coords="602,633,724,593,725,598,603,638"/>
-<area shape="rect" id="Node000029" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e" title="Do the actual left rotate operation." alt="" coords="980,648,1153,689"/>
-<area shape="poly" id="edge29_Node000020_Node000029" title=" " alt="" coords="646,649,775,647,915,650,965,653,964,659,915,655,775,652,646,654"/>
-<area shape="rect" id="Node000030" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9" title="Merge the item at index of the parent node, and its left and right child." alt="" coords="730,664,878,705"/>
-<area shape="poly" id="edge30_Node000020_Node000030" title=" " alt="" coords="646,665,715,672,715,678,646,670"/>
-<area shape="rect" id="Node000035" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9" title="Do the actual right rotate operation." alt="" coords="976,909,1158,950"/>
-<area shape="poly" id="edge37_Node000020_Node000035" title=" " alt="" coords="551,676,617,796,659,857,678,880,695,894,726,910,759,922,828,937,896,943,960,941,960,946,896,948,827,943,757,927,724,915,692,899,674,883,654,860,613,798,546,678"/>
-<area shape="rect" id="Node000036" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9" title="A handy function to try if we can do a left rotate to the target node." alt="" coords="708,729,900,770"/>
-<area shape="poly" id="edge38_Node000020_Node000036" title=" " alt="" coords="591,675,695,714,718,722,716,727,693,719,589,680"/>
-<area shape="rect" id="Node000037" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3" title="A handy function to try if we can do a right rotate to the target node." alt="" coords="704,844,905,885"/>
-<area shape="poly" id="edge41_Node000020_Node000037" title=" " alt="" coords="554,675,611,747,650,788,695,823,716,835,713,840,692,828,647,792,607,751,550,679"/>
-<area shape="rect" id="Node000022" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57" title="Get max item (rightmost) in the current node." alt="" coords="982,191,1151,231"/>
-<area shape="poly" id="edge22_Node000021_Node000022" title=" " alt="" coords="894,314,913,304,928,289,937,274,945,258,961,242,971,236,974,241,965,246,950,261,941,276,933,292,917,308,896,319"/>
-<area shape="rect" id="Node000023" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94" title="Get rightmose child of the current node." alt="" coords="963,256,1170,297"/>
-<area shape="poly" id="edge23_Node000021_Node000023" title=" " alt="" coords="894,314,961,298,963,303,895,319"/>
-<area shape="rect" id="Node000025" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e" title="Get leftmose child of the current node." alt="" coords="968,321,1166,362"/>
-<area shape="poly" id="edge25_Node000024_Node000025" title=" " alt="" coords="888,383,967,364,968,369,890,389"/>
-<area shape="rect" id="Node000026" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71" title="get min item (leftmost) in the current node" alt="" coords="984,387,1149,427"/>
-<area shape="poly" id="edge26_Node000024_Node000026" title=" " alt="" coords="908,404,969,404,969,410,908,410"/>
-<area shape="poly" id="edge34_Node000030_Node000012" title=" " alt="" coords="840,661,877,634,913,600,928,575,934,551,942,527,961,504,978,492,981,496,965,508,947,530,939,552,933,577,917,603,881,638,843,666"/>
-<area shape="poly" id="edge33_Node000030_Node000027" title=" " alt="" coords="880,695,899,703,917,716,929,730,937,745,942,774,947,802,953,816,965,829,982,841,979,846,961,833,949,818,942,804,937,775,931,746,925,733,913,720,897,708,878,699"/>
-<area shape="rect" id="Node000031" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" title="Get the child pointer at position of index." alt="" coords="993,713,1140,754"/>
-<area shape="poly" id="edge31_Node000030_Node000031" title=" " alt="" coords="880,696,978,714,977,720,879,701"/>
-<area shape="rect" id="Node000032" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" title="Get item of the \index index." alt="" coords="995,779,1138,819"/>
-<area shape="poly" id="edge32_Node000030_Node000032" title=" " alt="" coords="880,699,916,715,932,728,941,740,950,752,964,763,982,773,980,777,962,768,946,756,937,743,928,731,914,720,878,704"/>
-<area shape="rect" id="Node000033" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1" title="Set the item count of the node." alt="" coords="991,517,1142,558"/>
-<area shape="poly" id="edge35_Node000030_Node000033" title=" " alt="" coords="831,661,900,609,962,569,976,562,979,567,964,573,903,614,834,666"/>
-<area shape="rect" id="Node000034" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc" title="Set item value at position of index." alt="" coords="996,583,1138,623"/>
-<area shape="poly" id="edge36_Node000030_Node000034" title=" " alt="" coords="872,661,983,626,985,631,873,666"/>
-<area shape="poly" id="edge39_Node000036_Node000027" title=" " alt="" coords="879,768,916,786,931,797,941,808,950,818,964,829,981,837,979,842,962,833,947,822,937,812,928,801,914,791,876,773"/>
-<area shape="poly" id="edge40_Node000036_Node000029" title=" " alt="" coords="874,726,914,714,985,691,987,696,916,719,875,731"/>
-<area shape="poly" id="edge42_Node000037_Node000027" title=" " alt="" coords="905,862,978,862,978,867,905,867"/>
-<area shape="poly" id="edge43_Node000037_Node000035" title=" " alt="" coords="890,883,968,902,967,908,888,888"/>
-<area shape="rect" id="Node000039" href="$dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" title="prints the minimum, maximum and size of the set to which i belongs to" alt="" coords="266,909,334,934"/>
-<area shape="poly" id="edge45_Node000038_Node000039" title=" " alt="" coords="162,919,250,919,250,924,162,924"/>
-<area shape="rect" id="Node000044" href="$dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="248,1084,352,1109"/>
-<area shape="poly" id="edge53_Node000038_Node000044" title=" " alt="" coords="152,933,278,1070,274,1074,148,937"/>
-<area shape="rect" id="Node000040" href="$dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" title="A utility function that returns the max element of the set to which i belongs to." alt="" coords="487,909,587,934"/>
-<area shape="poly" id="edge46_Node000039_Node000040" title=" " alt="" coords="334,919,471,919,471,924,334,924"/>
-<area shape="rect" id="Node000042" href="$dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" title="A utility function that returns the min element of the set to which i belongs to." alt="" coords="489,958,585,984"/>
-<area shape="poly" id="edge49_Node000039_Node000042" title=" " alt="" coords="335,926,474,955,473,961,334,931"/>
-<area shape="rect" id="Node000043" href="$dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" title="A utility function that returns the size of the set to which i belongs to." alt="" coords="500,860,574,885"/>
-<area shape="poly" id="edge51_Node000039_Node000043" title=" " alt="" coords="334,912,484,880,485,886,335,917"/>
-<area shape="rect" id="Node000041" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="759,984,850,1009"/>
-<area shape="poly" id="edge47_Node000040_Node000041" title=" " alt="" coords="588,929,646,943,751,975,750,981,645,948,587,934"/>
-<area shape="poly" id="edge48_Node000041_Node000041" title=" " alt="" coords="761,985,753,975,758,965,775,959,804,957,837,960,853,967,851,972,836,965,804,962,776,964,761,969,758,974,765,981"/>
-<area shape="poly" id="edge50_Node000042_Node000041" title=" " alt="" coords="586,973,744,988,743,993,585,978"/>
-<area shape="poly" id="edge52_Node000043_Node000041" title=" " alt="" coords="575,873,611,880,647,894,662,905,672,915,695,938,759,974,757,979,692,942,668,919,659,909,644,899,609,885,574,878"/>
-<area shape="poly" id="edge54_Node000044_Node000041" title=" " alt="" coords="352,1089,485,1072,645,1043,751,1012,753,1017,646,1048,486,1077,353,1094"/>
-<area shape="rect" id="Node000045" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="490,1008,584,1033"/>
-<area shape="poly" id="edge55_Node000044_Node000045" title=" " alt="" coords="337,1080,428,1050,474,1035,476,1040,429,1055,339,1086"/>
-<area shape="rect" id="Node000046" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="501,1109,573,1134"/>
-<area shape="poly" id="edge57_Node000044_Node000046" title=" " alt="" coords="353,1099,486,1114,485,1119,352,1105"/>
-<area shape="rect" id="Node000047" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="503,1158,571,1184"/>
-<area shape="poly" id="edge58_Node000044_Node000047" title=" " alt="" coords="332,1107,429,1144,488,1159,487,1165,428,1150,330,1112"/>
-<area shape="rect" id="Node000048" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="498,1208,576,1233"/>
-<area shape="poly" id="edge59_Node000044_Node000048" title=" " alt="" coords="316,1108,363,1151,395,1174,429,1194,483,1211,482,1216,427,1199,392,1179,360,1155,312,1112"/>
-<area shape="poly" id="edge56_Node000045_Node000041" title=" " alt="" coords="584,1013,743,999,744,1004,585,1019"/>
-</map>
diff --git a/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
deleted file mode 100644
index d8f6f4a62..000000000
--- a/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9ffc7dea6f08afce5288878e136fb1d7
\ No newline at end of file
diff --git a/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
deleted file mode 100644
index 3bb917159..000000000
--- a/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ /dev/null
@@ -1,1088 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 929 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 1070;
-var viewHeight = 929;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-658.25 0,-658.25 0,-639 37,-639 37,-658.25"/>
-<text text-anchor="middle" x="18.5" y="-644.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="124.25,-695.25 73,-695.25 73,-676 124.25,-676 124.25,-695.25"/>
-<text text-anchor="middle" x="98.62" y="-681.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stoi</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-657.02C45.76,-661.06 56.25,-666.03 66.07,-670.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.45,-673.79 74.99,-674.9 67.45,-667.46 64.45,-673.79"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title="simple test to insert a given array and delete some item, and print the tree">
-<polygon fill="white" stroke="#666666" points="117.5,-658.25 79.75,-658.25 79.75,-639 117.5,-639 117.5,-658.25"/>
-<text text-anchor="middle" x="98.62" y="-644.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-648.62C46.39,-648.62 57.8,-648.62 68.24,-648.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.91,-652.13 77.91,-648.63 67.91,-645.13 67.91,-652.13"/>
-</a>
-</g>
-</g>
-<!-- Node38 -->
-<g id="Node000038" class="node">
-<title>Node38</title>
-<g id="a_Node000038"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title="Self&#45;implementations, 2nd test.">
-<polygon fill="white" stroke="#666666" points="117.5,-243.25 79.75,-243.25 79.75,-224 117.5,-224 117.5,-243.25"/>
-<text text-anchor="middle" x="98.62" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node38 -->
-<g id="edge44_Node000001_Node000038" class="edge">
-<title>Node1&#45;&gt;Node38</title>
-<g id="a_edge44_Node000001_Node000038"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.35,-638.78C31.4,-585.4 79.4,-330.45 93.64,-254.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.06,-255.53 95.47,-245.05 90.18,-254.23 97.06,-255.53"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e" target="_top" xlink:title="Insert item to tree.">
-<polygon fill="white" stroke="#666666" points="275.25,-696.88 166.25,-696.88 166.25,-666.38 275.25,-666.38 275.25,-696.88"/>
-<text text-anchor="start" x="174.25" y="-683.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="220.75" y="-672.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Insert</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.87,-653.64C128.02,-656.43 141.33,-660.08 154.97,-663.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.9,-667.16 164.47,-666.44 155.75,-660.41 153.9,-667.16"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165" target="_top" xlink:title="Print tree into a dot file.">
-<polygon fill="white" stroke="#666666" points="273.75,-821.88 167.75,-821.88 167.75,-791.38 273.75,-791.38 273.75,-821.88"/>
-<text text-anchor="start" x="175.75" y="-808.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="220.75" y="-797.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Print</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node14 -->
-<g id="edge14_Node000003_Node000014" class="edge">
-<title>Node3&#45;&gt;Node14</title>
-<g id="a_edge14_Node000003_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.13,-658.71C118.32,-661.12 121.52,-663.81 124.25,-666.62 158.69,-702.21 189.13,-751.53 205.94,-781.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.83,-782.74 210.76,-789.76 208.94,-779.33 202.83,-782.74"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11" target="_top" xlink:title="Remove item from tree.">
-<polygon fill="white" stroke="#666666" points="281.25,-512.88 160.25,-512.88 160.25,-482.38 281.25,-482.38 281.25,-512.88"/>
-<text text-anchor="start" x="168.25" y="-499.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="220.75" y="-488.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Remove</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node19 -->
-<g id="edge19_Node000003_Node000019" class="edge">
-<title>Node3&#45;&gt;Node19</title>
-<g id="a_edge19_Node000003_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.51,-638.72C126.21,-615.21 173.71,-555.5 200.54,-521.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="203.09,-524.19 206.57,-514.19 197.61,-519.84 203.09,-524.19"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d" target="_top" xlink:title="A insert implementation of pre&#45;split.">
-<polygon fill="white" stroke="#666666" points="470.5,-729.88 327,-729.88 327,-699.38 470.5,-699.38 470.5,-729.88"/>
-<text text-anchor="start" x="335" y="-716.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="398.75" y="-705.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::InsertPreSplit</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.51,-691.71C288.27,-694.1 302.18,-696.7 315.88,-699.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.84,-702.64 325.31,-701.04 316.13,-695.76 314.84,-702.64"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="649.25,-724.25 549.25,-724.25 549.25,-705 649.25,-705 649.25,-724.25"/>
-<text text-anchor="middle" x="599.25" y="-710.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr::get</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.85,-714.62C492.63,-714.62 516.38,-714.62 537.4,-714.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="537.26,-718.13 547.26,-714.63 537.26,-711.13 537.26,-718.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" target="_top" xlink:title="Merge node to a not&#45;full target node.">
-<polygon fill="white" stroke="#666666" points="682.25,-822.88 516.25,-822.88 516.25,-792.38 682.25,-792.38 682.25,-822.88"/>
-<text text-anchor="start" x="524.25" y="-809.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.25" y="-798.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNodeNotFull</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M462.45,-730.21C468.69,-732.89 474.75,-736.01 480.25,-739.62 500.79,-753.13 495.75,-768.06 516.25,-781.62 519.3,-783.64 522.52,-785.52 525.85,-787.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="524.17,-790.33 534.71,-791.4 527.14,-783.99 524.17,-790.33"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" target="_top" xlink:title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node.">
-<polygon fill="white" stroke="#666666" points="662.75,-772.88 535.75,-772.88 535.75,-742.38 662.75,-742.38 662.75,-772.88"/>
-<text text-anchor="start" x="543.75" y="-759.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.25" y="-748.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::SplitNode</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node13 -->
-<g id="edge13_Node000005_Node000013" class="edge">
-<title>Node5&#45;&gt;Node13</title>
-<g id="a_edge13_Node000005_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.85,-730.03C488.36,-733.82 507.13,-737.89 524.75,-741.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="523.55,-745.02 534.06,-743.72 525.03,-738.18 523.55,-745.02"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" target="_top" xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="white" stroke="#666666" points="854.25,-870.88 737.75,-870.88 737.75,-840.38 854.25,-840.38 854.25,-870.88"/>
-<text text-anchor="start" x="745.75" y="-857.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-846.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M664.02,-823.34C683.96,-828.26 706.03,-833.7 726.29,-838.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="725.32,-842.06 735.87,-841.05 727,-835.26 725.32,-842.06"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="1039,-822.88 933,-822.88 933,-792.38 1039,-792.38 1039,-822.88"/>
-<text text-anchor="start" x="941" y="-809.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="986" y="-798.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node11 -->
-<g id="edge11_Node000007_Node000011" class="edge">
-<title>Node7&#45;&gt;Node11</title>
-<g id="a_edge11_Node000007_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M682.32,-807.62C753.73,-807.62 855.77,-807.62 921.2,-807.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="921.07,-811.13 931.07,-807.63 921.07,-804.13 921.07,-811.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="850.88,-585.88 741.12,-585.88 741.12,-555.38 850.88,-555.38 850.88,-585.88"/>
-<text text-anchor="start" x="749.12" y="-572.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-561.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node12 -->
-<g id="edge12_Node000007_Node000012" class="edge">
-<title>Node7&#45;&gt;Node12</title>
-<g id="a_edge12_Node000007_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M669.92,-791.92C674.48,-789.04 678.67,-785.64 682.25,-781.62 738.24,-718.74 662.51,-658.73 718.25,-595.62 721.83,-591.57 726.08,-588.17 730.7,-585.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="732.01,-588.58 739.31,-580.9 728.81,-582.36 732.01,-588.58"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="1041.62,-920.88 930.38,-920.88 930.38,-890.38 1041.62,-890.38 1041.62,-920.88"/>
-<text text-anchor="start" x="938.38" y="-907.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="986" y="-896.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge8_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge8_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M854.68,-870.97C875,-876.37 897.98,-882.48 918.93,-888.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="917.97,-891.42 928.54,-890.61 919.77,-884.66 917.97,-891.42"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="1062.25,-871.88 909.75,-871.88 909.75,-841.38 1062.25,-841.38 1062.25,-871.88"/>
-<text text-anchor="start" x="917.75" y="-858.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="986" y="-847.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge9_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge9_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M854.68,-855.93C868.45,-856.01 883.43,-856.08 898.19,-856.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="897.86,-859.66 907.88,-856.21 897.9,-852.66 897.86,-859.66"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node11 -->
-<g id="edge10_Node000008_Node000011" class="edge">
-<title>Node8&#45;&gt;Node11</title>
-<g id="a_edge10_Node000008_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M854.68,-840.9C875.82,-835.5 899.86,-829.36 921.48,-823.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="922.25,-827.26 931.08,-821.39 920.52,-820.48 922.25,-827.26"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="450.25,-890.25 347.25,-890.25 347.25,-871 450.25,-871 450.25,-890.25"/>
-<text text-anchor="middle" x="398.75" y="-876.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge15_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge15_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.89,-822.3C262.62,-834.88 290.6,-852.13 317.25,-862.62 323.23,-864.98 329.58,-867.06 335.99,-868.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.76,-872.19 345.32,-871.36 336.55,-865.42 334.76,-872.19"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="425.5,-853.25 372,-853.25 372,-834 425.5,-834 425.5,-853.25"/>
-<text text-anchor="middle" x="398.75" y="-839.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node16 -->
-<g id="edge16_Node000014_Node000016" class="edge">
-<title>Node14&#45;&gt;Node16</title>
-<g id="a_edge16_Node000014_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.08,-817.63C301.9,-823.47 335.44,-830.53 360.57,-835.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="359.83,-839.23 370.34,-837.86 361.27,-832.38 359.83,-839.23"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="449.12,-816.25 348.38,-816.25 348.38,-797 449.12,-797 449.12,-816.25"/>
-<text text-anchor="middle" x="398.75" y="-802.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node17 -->
-<g id="edge17_Node000014_Node000017" class="edge">
-<title>Node14&#45;&gt;Node17</title>
-<g id="a_edge17_Node000014_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.08,-806.62C293.74,-806.62 316.25,-806.62 336.64,-806.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.52,-810.13 346.52,-806.63 336.52,-803.13 336.52,-810.13"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be" target="_top" xlink:title="Print the tree to a dot file. You can convert it to picture with graphviz.">
-<polygon fill="white" stroke="#666666" points="462.62,-778.88 334.88,-778.88 334.88,-748.38 462.62,-748.38 462.62,-778.88"/>
-<text text-anchor="start" x="342.88" y="-765.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="398.75" y="-754.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::PrintNode</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node18 -->
-<g id="edge18_Node000014_Node000018" class="edge">
-<title>Node14&#45;&gt;Node18</title>
-<g id="a_edge18_Node000014_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.08,-793.84C289.62,-790.04 306.95,-785.81 323.61,-781.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="324.07,-785.23 332.95,-779.46 322.41,-778.43 324.07,-785.23"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4" target="_top" xlink:title="Main function implement the pre&#45;merge remove operation.">
-<polygon fill="white" stroke="#666666" points="480.25,-447.88 317.25,-447.88 317.25,-417.38 480.25,-417.38 480.25,-447.88"/>
-<text text-anchor="start" x="325.25" y="-434.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="398.75" y="-423.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::RemovePreMerge</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge20_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge20_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.35,-481.89C288.48,-472.98 318.87,-461.76 344.55,-452.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.65,-455.6 353.81,-448.85 343.22,-449.03 345.65,-455.6"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657" target="_top" xlink:title="Get the max item of the tree.">
-<polygon fill="white" stroke="#666666" points="678.12,-686.88 520.38,-686.88 520.38,-656.38 678.12,-656.38 678.12,-686.88"/>
-<text text-anchor="start" x="528.38" y="-673.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.25" y="-662.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node21 -->
-<g id="edge21_Node000020_Node000021" class="edge">
-<title>Node20&#45;&gt;Node21</title>
-<g id="a_edge21_Node000020_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M404.04,-448.13C415.52,-486.86 450.67,-588.65 516.25,-643.62 519.28,-646.17 522.56,-648.48 525.99,-650.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="524.23,-653.62 534.69,-655.28 527.55,-647.45 524.23,-653.62"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36" target="_top" xlink:title="Get the min item of the tree.">
-<polygon fill="white" stroke="#666666" points="676.62,-634.88 521.88,-634.88 521.88,-604.38 676.62,-604.38 676.62,-634.88"/>
-<text text-anchor="start" x="529.88" y="-621.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.25" y="-610.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node24 -->
-<g id="edge24_Node000020_Node000024" class="edge">
-<title>Node20&#45;&gt;Node24</title>
-<g id="a_edge24_Node000020_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M416.33,-448.25C451.22,-481.11 532.35,-557.54 573.44,-596.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="570.79,-598.57 580.47,-602.88 575.59,-593.47 570.79,-598.57"/>
-</a>
-</g>
-</g>
-<!-- Node27 -->
-<g id="Node000027" class="node">
-<title>Node27</title>
-<g id="a_Node000027"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" target="_top" xlink:title="Check if node is a 2&#45;node.">
-<polygon fill="white" stroke="#666666" points="850.5,-291.88 741.5,-291.88 741.5,-261.38 850.5,-261.38 850.5,-291.88"/>
-<text text-anchor="start" x="749.5" y="-278.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-267.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is2Node</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node27 -->
-<g id="edge27_Node000020_Node000027" class="edge">
-<title>Node20&#45;&gt;Node27</title>
-<g id="a_edge27_Node000020_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M414.35,-417C434.98,-395.88 474.81,-358.59 516.25,-338.62 521.13,-336.27 649.28,-308.23 730.1,-290.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="730.67,-294.14 739.7,-288.6 729.18,-287.3 730.67,-294.14"/>
-</a>
-</g>
-</g>
-<!-- Node28 -->
-<g id="Node000028" class="node">
-<title>Node28</title>
-<g id="a_Node000028"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18" target="_top" xlink:title="Check if node is a 3&#45;node or 4&#45;node, this is useful when we delete item from 2&#45;3&#45;4 tree.">
-<polygon fill="white" stroke="#666666" points="656.38,-512.88 542.12,-512.88 542.12,-482.38 656.38,-482.38 656.38,-512.88"/>
-<text text-anchor="start" x="550.12" y="-499.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.25" y="-488.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is34Node</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node28 -->
-<g id="edge28_Node000020_Node000028" class="edge">
-<title>Node20&#45;&gt;Node28</title>
-<g id="a_edge28_Node000020_Node000028"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M447.8,-448.36C475.37,-457.39 510.2,-468.79 539.41,-478.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="538.27,-481.67 548.86,-481.45 540.44,-475.01 538.27,-481.67"/>
-</a>
-</g>
-</g>
-<!-- Node29 -->
-<g id="Node000029" class="node">
-<title>Node29</title>
-<g id="a_Node000029"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e" target="_top" xlink:title="Do the actual left rotate operation.">
-<polygon fill="white" stroke="#666666" points="861,-438.88 731,-438.88 731,-408.38 861,-408.38 861,-438.88"/>
-<text text-anchor="start" x="739" y="-425.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-414.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::LeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node29 -->
-<g id="edge29_Node000020_Node000029" class="edge">
-<title>Node20&#45;&gt;Node29</title>
-<g id="a_edge29_Node000020_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M480.48,-436.21C537.01,-438.05 614.29,-439.23 682.25,-435.62 694.29,-434.99 707.02,-433.97 719.43,-432.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="719.59,-436.28 729.19,-431.81 718.9,-429.32 719.59,-436.28"/>
-</a>
-</g>
-</g>
-<!-- Node30 -->
-<g id="Node000030" class="node">
-<title>Node30</title>
-<g id="a_Node000030"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9" target="_top" xlink:title="Merge the item at index of the parent node, and its left and right child.">
-<polygon fill="white" stroke="#666666" points="654.88,-426.88 543.62,-426.88 543.62,-396.38 654.88,-396.38 654.88,-426.88"/>
-<text text-anchor="start" x="551.62" y="-413.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.25" y="-402.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Merge</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node30 -->
-<g id="edge30_Node000020_Node000030" class="edge">
-<title>Node20&#45;&gt;Node30</title>
-<g id="a_edge30_Node000020_Node000030"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M480.49,-424.08C497.67,-422.27 515.62,-420.37 532.17,-418.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="532.3,-422.12 541.88,-417.59 531.57,-415.16 532.3,-422.12"/>
-</a>
-</g>
-</g>
-<!-- Node35 -->
-<g id="Node000035" class="node">
-<title>Node35</title>
-<g id="a_Node000035"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9" target="_top" xlink:title="Do the actual right rotate operation.">
-<polygon fill="white" stroke="#666666" points="864.38,-242.88 727.62,-242.88 727.62,-212.38 864.38,-212.38 864.38,-242.88"/>
-<text text-anchor="start" x="735.62" y="-229.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-218.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::RightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node35 -->
-<g id="edge37_Node000020_Node000035" class="edge">
-<title>Node20&#45;&gt;Node35</title>
-<g id="a_edge37_Node000020_Node000035"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M407.59,-416.97C427.99,-376.92 483.42,-272.43 516.25,-252.62 576.14,-216.48 656.83,-213.09 715.99,-217.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="715.4,-220.5 725.63,-217.77 715.93,-213.52 715.4,-220.5"/>
-</a>
-</g>
-</g>
-<!-- Node36 -->
-<g id="Node000036" class="node">
-<title>Node36</title>
-<g id="a_Node000036"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9" target="_top" xlink:title="A handy function to try if we can do a left rotate to the target node.">
-<polygon fill="white" stroke="#666666" points="671.38,-377.88 527.12,-377.88 527.12,-347.38 671.38,-347.38 671.38,-377.88"/>
-<text text-anchor="start" x="535.12" y="-364.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.25" y="-353.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryLeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node36 -->
-<g id="edge38_Node000020_Node000036" class="edge">
-<title>Node20&#45;&gt;Node36</title>
-<g id="a_edge38_Node000020_Node000036"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M438.32,-416.91C460.89,-407.93 490.01,-396.68 516.25,-387.62 521.97,-385.65 527.93,-383.68 533.93,-381.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="534.78,-385.15 543.25,-378.8 532.66,-378.48 534.78,-385.15"/>
-</a>
-</g>
-</g>
-<!-- Node37 -->
-<g id="Node000037" class="node">
-<title>Node37</title>
-<g id="a_Node000037"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3" target="_top" xlink:title="A handy function to try if we can do a right rotate to the target node.">
-<polygon fill="white" stroke="#666666" points="674.75,-291.88 523.75,-291.88 523.75,-261.38 674.75,-261.38 674.75,-291.88"/>
-<text text-anchor="start" x="531.75" y="-278.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.25" y="-267.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryRightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node37 -->
-<g id="edge41_Node000020_Node000037" class="edge">
-<title>Node20&#45;&gt;Node37</title>
-<g id="a_edge41_Node000020_Node000037"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M410.11,-417.07C428.49,-390.6 469.33,-336.65 516.25,-305.62 521.09,-302.43 526.31,-299.54 531.71,-296.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.12,-300.14 540.85,-292.89 530.29,-293.73 533.12,-300.14"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57" target="_top" xlink:title="Get max item (rightmost) in the current node.">
-<polygon fill="white" stroke="#666666" points="859.12,-781.88 732.88,-781.88 732.88,-751.38 859.12,-751.38 859.12,-781.88"/>
-<text text-anchor="start" x="740.88" y="-768.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-757.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node21&#45;&gt;Node22 -->
-<g id="edge22_Node000021_Node000022" class="edge">
-<title>Node21&#45;&gt;Node22</title>
-<g id="a_edge22_Node000021_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M667.22,-687.31C672.5,-689.71 677.58,-692.46 682.25,-695.62 703.74,-710.19 696.98,-726.74 718.25,-741.62 720.43,-743.15 722.71,-744.59 725.06,-745.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="723.21,-748.93 733.71,-750.35 726.39,-742.69 723.21,-748.93"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94" target="_top" xlink:title="Get rightmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="873.75,-732.88 718.25,-732.88 718.25,-702.38 873.75,-702.38 873.75,-732.88"/>
-<text text-anchor="start" x="726.25" y="-719.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-708.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetRightmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node21&#45;&gt;Node23 -->
-<g id="edge23_Node000021_Node000023" class="edge">
-<title>Node21&#45;&gt;Node23</title>
-<g id="a_edge23_Node000021_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M666.73,-687.33C683.09,-691.19 700.75,-695.36 717.58,-699.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="716.48,-702.68 727.02,-701.57 718.09,-695.86 716.48,-702.68"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e" target="_top" xlink:title="Get leftmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="870.38,-683.88 721.62,-683.88 721.62,-653.38 870.38,-653.38 870.38,-683.88"/>
-<text text-anchor="start" x="729.62" y="-670.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-659.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetLeftmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node25 -->
-<g id="edge25_Node000024_Node000025" class="edge">
-<title>Node24&#45;&gt;Node25</title>
-<g id="a_edge25_Node000024_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M662.67,-635.33C681.45,-640.06 702.24,-645.29 721.66,-650.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="720.58,-653.51 731.13,-652.55 722.28,-646.72 720.58,-653.51"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71" target="_top" xlink:title="get min item (leftmost) in the current node">
-<polygon fill="white" stroke="#666666" points="857.62,-634.88 734.38,-634.88 734.38,-604.38 857.62,-604.38 857.62,-634.88"/>
-<text text-anchor="start" x="742.38" y="-621.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-610.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node26 -->
-<g id="edge26_Node000024_Node000026" class="edge">
-<title>Node24&#45;&gt;Node26</title>
-<g id="a_edge26_Node000024_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M676.94,-619.62C692.04,-619.62 707.83,-619.62 722.78,-619.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="722.5,-623.13 732.5,-619.63 722.5,-616.13 722.5,-623.13"/>
-</a>
-</g>
-</g>
-<!-- Node30&#45;&gt;Node12 -->
-<g id="edge34_Node000030_Node000012" class="edge">
-<title>Node30&#45;&gt;Node12</title>
-<g id="a_edge34_Node000030_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M626.8,-427.17C644.23,-438.39 666.62,-454.82 682.25,-473.62 705.12,-501.14 691.14,-522.28 718.25,-545.62 722.06,-548.9 726.3,-551.75 730.79,-554.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="729.02,-557.27 739.55,-558.43 732.04,-550.95 729.02,-557.27"/>
-</a>
-</g>
-</g>
-<!-- Node30&#45;&gt;Node27 -->
-<g id="edge33_Node000030_Node000027" class="edge">
-<title>Node30&#45;&gt;Node27</title>
-<g id="a_edge33_Node000030_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M655.37,-402.09C665.14,-398.48 674.62,-393.5 682.25,-386.62 712.74,-359.17 688.02,-329.37 718.25,-301.62 722.17,-298.02 726.62,-294.94 731.36,-292.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="732.53,-295.62 740.03,-288.14 729.5,-289.31 732.53,-295.62"/>
-</a>
-</g>
-</g>
-<!-- Node31 -->
-<g id="Node000031" class="node">
-<title>Node31</title>
-<g id="a_Node000031"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" target="_top" xlink:title="Get the child pointer at position of index.">
-<polygon fill="white" stroke="#666666" points="851.25,-389.88 740.75,-389.88 740.75,-359.38 851.25,-359.38 851.25,-389.88"/>
-<text text-anchor="start" x="748.75" y="-376.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-365.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetChild</text>
-</a>
-</g>
-</g>
-<!-- Node30&#45;&gt;Node31 -->
-<g id="edge31_Node000030_Node000031" class="edge">
-<title>Node30&#45;&gt;Node31</title>
-<g id="a_edge31_Node000030_Node000031"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M655.28,-401.17C678.29,-396.8 705.22,-391.68 729.27,-387.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="729.79,-390.58 738.96,-385.27 728.48,-383.7 729.79,-390.58"/>
-</a>
-</g>
-</g>
-<!-- Node32 -->
-<g id="Node000032" class="node">
-<title>Node32</title>
-<g id="a_Node000032"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" target="_top" xlink:title="Get item of the \index index.">
-<polygon fill="white" stroke="#666666" points="849.75,-340.88 742.25,-340.88 742.25,-310.38 849.75,-310.38 849.75,-340.88"/>
-<text text-anchor="start" x="750.25" y="-327.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-316.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetItem</text>
-</a>
-</g>
-</g>
-<!-- Node30&#45;&gt;Node32 -->
-<g id="edge32_Node000030_Node000032" class="edge">
-<title>Node30&#45;&gt;Node32</title>
-<g id="a_edge32_Node000030_Node000032"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M655.22,-398.96C664.59,-395.67 673.96,-391.6 682.25,-386.62 701.65,-374.98 698.96,-362.45 718.25,-350.62 722.46,-348.04 726.97,-345.69 731.61,-343.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="732.65,-346.93 740.53,-339.85 729.96,-340.47 732.65,-346.93"/>
-</a>
-</g>
-</g>
-<!-- Node33 -->
-<g id="Node000033" class="node">
-<title>Node33</title>
-<g id="a_Node000033"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1" target="_top" xlink:title="Set the item count of the node.">
-<polygon fill="white" stroke="#666666" points="852.75,-536.88 739.25,-536.88 739.25,-506.38 852.75,-506.38 852.75,-536.88"/>
-<text text-anchor="start" x="747.25" y="-523.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-512.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetCount</text>
-</a>
-</g>
-</g>
-<!-- Node30&#45;&gt;Node33 -->
-<g id="edge35_Node000030_Node000033" class="edge">
-<title>Node30&#45;&gt;Node33</title>
-<g id="a_edge35_Node000030_Node000033"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M620.39,-427.29C648.44,-448.92 698.1,-486.4 718.25,-496.62 721.73,-498.39 725.36,-500.07 729.07,-501.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="727.67,-504.87 738.25,-505.33 730.27,-498.37 727.67,-504.87"/>
-</a>
-</g>
-</g>
-<!-- Node34 -->
-<g id="Node000034" class="node">
-<title>Node34</title>
-<g id="a_Node000034"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc" target="_top" xlink:title="Set item value at position of index.">
-<polygon fill="white" stroke="#666666" points="849.38,-487.88 742.62,-487.88 742.62,-457.38 849.38,-457.38 849.38,-487.88"/>
-<text text-anchor="start" x="750.62" y="-474.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-463.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetItem</text>
-</a>
-</g>
-</g>
-<!-- Node30&#45;&gt;Node34 -->
-<g id="edge36_Node000030_Node000034" class="edge">
-<title>Node30&#45;&gt;Node34</title>
-<g id="a_edge36_Node000030_Node000034"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M650.4,-427.33C675.96,-435.34 707.24,-445.14 734.16,-453.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="732.98,-456.87 743.57,-456.52 735.08,-450.19 732.98,-456.87"/>
-</a>
-</g>
-</g>
-<!-- Node36&#45;&gt;Node27 -->
-<g id="edge39_Node000036_Node000027" class="edge">
-<title>Node36&#45;&gt;Node27</title>
-<g id="a_edge39_Node000036_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M654.09,-346.95C663.77,-343.21 673.54,-338.77 682.25,-333.62 700.68,-322.74 699.68,-312.28 718.25,-301.62 722.28,-299.31 726.56,-297.18 730.95,-295.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="732.02,-298.56 739.94,-291.52 729.36,-292.08 732.02,-298.56"/>
-</a>
-</g>
-</g>
-<!-- Node36&#45;&gt;Node29 -->
-<g id="edge40_Node000036_Node000029" class="edge">
-<title>Node36&#45;&gt;Node29</title>
-<g id="a_edge40_Node000036_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M651.9,-378.26C661.97,-381.34 672.45,-384.57 682.25,-387.62 699.63,-393.05 718.49,-399.03 735.72,-404.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="734.17,-407.72 744.76,-407.43 736.31,-401.05 734.17,-407.72"/>
-</a>
-</g>
-</g>
-<!-- Node37&#45;&gt;Node27 -->
-<g id="edge42_Node000037_Node000027" class="edge">
-<title>Node37&#45;&gt;Node27</title>
-<g id="a_edge42_Node000037_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M674.99,-276.62C693.03,-276.62 712.16,-276.62 729.73,-276.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="729.5,-280.13 739.5,-276.63 729.5,-273.13 729.5,-280.13"/>
-</a>
-</g>
-</g>
-<!-- Node37&#45;&gt;Node35 -->
-<g id="edge43_Node000037_Node000035" class="edge">
-<title>Node37&#45;&gt;Node35</title>
-<g id="a_edge43_Node000037_Node000035"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M662.67,-260.92C681.45,-256.19 702.24,-250.96 721.66,-246.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="722.28,-249.53 731.13,-243.7 720.58,-242.74 722.28,-249.53"/>
-</a>
-</g>
-</g>
-<!-- Node39 -->
-<g id="Node000039" class="node">
-<title>Node39</title>
-<g id="a_Node000039"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
-<polygon fill="white" stroke="#666666" points="246.38,-243.25 195.12,-243.25 195.12,-224 246.38,-224 246.38,-243.25"/>
-<text text-anchor="middle" x="220.75" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
-</a>
-</g>
-</g>
-<!-- Node38&#45;&gt;Node39 -->
-<g id="edge45_Node000038_Node000039" class="edge">
-<title>Node38&#45;&gt;Node39</title>
-<g id="a_edge45_Node000038_Node000039"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.87,-233.62C135.15,-233.62 161.59,-233.62 183.21,-233.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.12,-237.13 193.12,-233.63 183.12,-230.13 183.12,-237.13"/>
-</a>
-</g>
-</g>
-<!-- Node44 -->
-<g id="Node000044" class="node">
-<title>Node44</title>
-<g id="a_Node000044"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="259.88,-112.25 181.62,-112.25 181.62,-93 259.88,-93 259.88,-112.25"/>
-<text text-anchor="middle" x="220.75" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
-</a>
-</g>
-</g>
-<!-- Node38&#45;&gt;Node44 -->
-<g id="edge53_Node000038_Node000044" class="edge">
-<title>Node38&#45;&gt;Node44</title>
-<g id="a_edge53_Node000038_Node000044"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.65,-223.78C128.74,-201.87 177.38,-148.83 203.13,-120.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.41,-123.44 209.59,-113.7 200.26,-118.71 205.41,-123.44"/>
-</a>
-</g>
-</g>
-<!-- Node40 -->
-<g id="Node000040" class="node">
-<title>Node40</title>
-<g id="a_Node000040"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="436.38,-243.25 361.12,-243.25 361.12,-224 436.38,-224 436.38,-243.25"/>
-<text text-anchor="middle" x="398.75" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
-</a>
-</g>
-</g>
-<!-- Node39&#45;&gt;Node40 -->
-<g id="edge46_Node000039_Node000040" class="edge">
-<title>Node39&#45;&gt;Node40</title>
-<g id="a_edge46_Node000039_Node000040"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M246.59,-233.62C273.21,-233.62 316.11,-233.62 349.43,-233.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="349.25,-237.13 359.25,-233.63 349.25,-230.13 349.25,-237.13"/>
-</a>
-</g>
-</g>
-<!-- Node42 -->
-<g id="Node000042" class="node">
-<title>Node42</title>
-<g id="a_Node000042"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="434.88,-206.25 362.62,-206.25 362.62,-187 434.88,-187 434.88,-206.25"/>
-<text text-anchor="middle" x="398.75" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
-</a>
-</g>
-</g>
-<!-- Node39&#45;&gt;Node42 -->
-<g id="edge49_Node000039_Node000042" class="edge">
-<title>Node39&#45;&gt;Node42</title>
-<g id="a_edge49_Node000039_Node000042"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M246.59,-228.4C273.75,-222.69 317.87,-213.42 351.45,-206.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="351.85,-209.85 360.91,-204.37 350.41,-203 351.85,-209.85"/>
-</a>
-</g>
-</g>
-<!-- Node43 -->
-<g id="Node000043" class="node">
-<title>Node43</title>
-<g id="a_Node000043"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="426.62,-280.25 370.88,-280.25 370.88,-261 426.62,-261 426.62,-280.25"/>
-<text text-anchor="middle" x="398.75" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
-</a>
-</g>
-</g>
-<!-- Node39&#45;&gt;Node43 -->
-<g id="edge51_Node000039_Node000043" class="edge">
-<title>Node39&#45;&gt;Node43</title>
-<g id="a_edge51_Node000039_Node000043"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M246.59,-238.85C275.96,-245.02 325.17,-255.37 359.43,-262.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="358.44,-265.94 368.95,-264.57 359.88,-259.09 358.44,-265.94"/>
-</a>
-</g>
-</g>
-<!-- Node41 -->
-<g id="Node000041" class="node">
-<title>Node41</title>
-<g id="a_Node000041"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="633.5,-187.25 565,-187.25 565,-168 633.5,-168 633.5,-187.25"/>
-<text text-anchor="middle" x="599.25" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node40&#45;&gt;Node41 -->
-<g id="edge47_Node000040_Node000041" class="edge">
-<title>Node40&#45;&gt;Node41</title>
-<g id="a_edge47_Node000040_Node000041"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M436.79,-226.09C450.51,-223.1 466.16,-219.46 480.25,-215.62 506.66,-208.44 535.96,-199.01 558.75,-191.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="559.6,-194.75 567.94,-188.23 557.35,-188.12 559.6,-194.75"/>
-</a>
-</g>
-</g>
-<!-- Node41&#45;&gt;Node41 -->
-<g id="edge48_Node000041_Node000041" class="edge">
-<title>Node41&#45;&gt;Node41</title>
-<g id="a_edge48_Node000041_Node000041"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M568.45,-187.54C554.4,-196.15 564.67,-205.25 599.25,-205.25 619.24,-205.25 631.11,-202.21 634.85,-197.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="638.04,-196.54 630.68,-188.91 631.68,-199.46 638.04,-196.54"/>
-</a>
-</g>
-</g>
-<!-- Node42&#45;&gt;Node41 -->
-<g id="edge50_Node000042_Node000041" class="edge">
-<title>Node42&#45;&gt;Node41</title>
-<g id="a_edge50_Node000042_Node000041"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M435.24,-193.23C468.34,-190.06 517.86,-185.32 553.63,-181.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="553.6,-185.42 563.22,-180.98 552.93,-178.45 553.6,-185.42"/>
-</a>
-</g>
-</g>
-<!-- Node43&#45;&gt;Node41 -->
-<g id="edge52_Node000043_Node000041" class="edge">
-<title>Node43&#45;&gt;Node41</title>
-<g id="a_edge52_Node000043_Node000041"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M427.06,-268.1C443.24,-265.75 463.75,-261.24 480.25,-252.62 499.49,-242.58 498.43,-232.02 516.25,-219.62 531.29,-209.16 549.29,-199.65 564.59,-192.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="565.72,-195.67 573.31,-188.28 562.77,-189.33 565.72,-195.67"/>
-</a>
-</g>
-</g>
-<!-- Node44&#45;&gt;Node41 -->
-<g id="edge54_Node000044_Node000041" class="edge">
-<title>Node44&#45;&gt;Node41</title>
-<g id="a_edge54_Node000044_Node000041"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.21,-106.36C311.01,-111.73 403.09,-122.97 480.25,-140.62 507.23,-146.8 536.96,-156.13 559.83,-163.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="558.43,-167.11 569.03,-167.05 560.71,-160.49 558.43,-167.11"/>
-</a>
-</g>
-</g>
-<!-- Node45 -->
-<g id="Node000045" class="node">
-<title>Node45</title>
-<g id="a_Node000045"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="434.12,-169.25 363.38,-169.25 363.38,-150 434.12,-150 434.12,-169.25"/>
-<text text-anchor="middle" x="398.75" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node44&#45;&gt;Node45 -->
-<g id="edge55_Node000044_Node000045" class="edge">
-<title>Node44&#45;&gt;Node45</title>
-<g id="a_edge55_Node000044_Node000045"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.64,-112.62C268.63,-119.33 294.37,-128.27 317.25,-135.62 328.61,-139.28 340.94,-143.05 352.45,-146.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="351.14,-149.75 361.73,-149.24 353.13,-143.04 351.14,-149.75"/>
-</a>
-</g>
-</g>
-<!-- Node46 -->
-<g id="Node000046" class="node">
-<title>Node46</title>
-<g id="a_Node000046"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="425.88,-93.25 371.62,-93.25 371.62,-74 425.88,-74 425.88,-93.25"/>
-<text text-anchor="middle" x="398.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node44&#45;&gt;Node46 -->
-<g id="edge57_Node000044_Node000046" class="edge">
-<title>Node44&#45;&gt;Node46</title>
-<g id="a_edge57_Node000044_Node000046"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.37,-98.46C290.03,-95.25 330.75,-90.86 360.15,-87.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="360.14,-91.21 369.7,-86.65 359.38,-84.25 360.14,-91.21"/>
-</a>
-</g>
-</g>
-<!-- Node47 -->
-<g id="Node000047" class="node">
-<title>Node47</title>
-<g id="a_Node000047"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424.38,-56.25 373.12,-56.25 373.12,-37 424.38,-37 424.38,-56.25"/>
-<text text-anchor="middle" x="398.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node44&#45;&gt;Node47 -->
-<g id="edge58_Node000044_Node000047" class="edge">
-<title>Node44&#45;&gt;Node47</title>
-<g id="a_edge58_Node000044_Node000047"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M244.16,-92.53C263.28,-84.21 291.67,-72.52 317.25,-64.62 331.58,-60.2 347.65,-56.39 361.64,-53.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="362.24,-56.87 371.34,-51.44 360.84,-50.01 362.24,-56.87"/>
-</a>
-</g>
-</g>
-<!-- Node48 -->
-<g id="Node000048" class="node">
-<title>Node48</title>
-<g id="a_Node000048"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="428.12,-19.25 369.38,-19.25 369.38,0 428.12,0 428.12,-19.25"/>
-<text text-anchor="middle" x="398.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node44&#45;&gt;Node48 -->
-<g id="edge59_Node000044_Node000048" class="edge">
-<title>Node44&#45;&gt;Node48</title>
-<g id="a_edge59_Node000044_Node000048"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M231.32,-92.64C247.46,-76.41 281.82,-44.43 317.25,-27.62 329.86,-21.64 344.53,-17.61 357.88,-14.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="358.47,-18.35 367.68,-13.12 357.22,-11.47 358.47,-18.35"/>
-</a>
-</g>
-</g>
-<!-- Node45&#45;&gt;Node41 -->
-<g id="edge56_Node000045_Node000041" class="edge">
-<title>Node45&#45;&gt;Node41</title>
-<g id="a_edge56_Node000045_Node000041"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M434.33,-162.76C467.4,-165.76 517.45,-170.3 553.54,-173.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="552.95,-177.03 563.22,-174.45 553.58,-170.06 552.95,-177.03"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
deleted file mode 100644
index 46164d365..000000000
--- a/db/dbc/tree__234_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
+++ /dev/null
@@ -1,1005 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="1070pt" height="929pt"
- viewBox="0.00 0.00 1070.25 928.88" 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 924.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-658.25 0,-658.25 0,-639 37,-639 37,-658.25"/>
-<text text-anchor="middle" x="18.5" y="-644.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="124.25,-695.25 73,-695.25 73,-676 124.25,-676 124.25,-695.25"/>
-<text text-anchor="middle" x="98.62" y="-681.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::stoi</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-657.02C45.76,-661.06 56.25,-666.03 66.07,-670.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.45,-673.79 74.99,-674.9 67.45,-667.46 64.45,-673.79"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title="simple test to insert a given array and delete some item, and print the tree">
-<polygon fill="white" stroke="#666666" points="117.5,-658.25 79.75,-658.25 79.75,-639 117.5,-639 117.5,-658.25"/>
-<text text-anchor="middle" x="98.62" y="-644.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-648.62C46.39,-648.62 57.8,-648.62 68.24,-648.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.91,-652.13 77.91,-648.63 67.91,-645.13 67.91,-652.13"/>
-</a>
-</g>
-</g>
-<!-- Node38 -->
-<g id="Node000038" class="node">
-<title>Node38</title>
-<g id="a_Node000038"><a xlink:href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title="Self&#45;implementations, 2nd test.">
-<polygon fill="white" stroke="#666666" points="117.5,-243.25 79.75,-243.25 79.75,-224 117.5,-224 117.5,-243.25"/>
-<text text-anchor="middle" x="98.62" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node38 -->
-<g id="edge44_Node000001_Node000038" class="edge">
-<title>Node1&#45;&gt;Node38</title>
-<g id="a_edge44_Node000001_Node000038"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.35,-638.78C31.4,-585.4 79.4,-330.45 93.64,-254.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.06,-255.53 95.47,-245.05 90.18,-254.23 97.06,-255.53"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e" target="_top" xlink:title="Insert item to tree.">
-<polygon fill="white" stroke="#666666" points="275.25,-696.88 166.25,-696.88 166.25,-666.38 275.25,-666.38 275.25,-696.88"/>
-<text text-anchor="start" x="174.25" y="-683.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="220.75" y="-672.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Insert</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.87,-653.64C128.02,-656.43 141.33,-660.08 154.97,-663.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.9,-667.16 164.47,-666.44 155.75,-660.41 153.9,-667.16"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165" target="_top" xlink:title="Print tree into a dot file.">
-<polygon fill="white" stroke="#666666" points="273.75,-821.88 167.75,-821.88 167.75,-791.38 273.75,-791.38 273.75,-821.88"/>
-<text text-anchor="start" x="175.75" y="-808.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="220.75" y="-797.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Print</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node14 -->
-<g id="edge14_Node000003_Node000014" class="edge">
-<title>Node3&#45;&gt;Node14</title>
-<g id="a_edge14_Node000003_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.13,-658.71C118.32,-661.12 121.52,-663.81 124.25,-666.62 158.69,-702.21 189.13,-751.53 205.94,-781.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.83,-782.74 210.76,-789.76 208.94,-779.33 202.83,-782.74"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11" target="_top" xlink:title="Remove item from tree.">
-<polygon fill="white" stroke="#666666" points="281.25,-512.88 160.25,-512.88 160.25,-482.38 281.25,-482.38 281.25,-512.88"/>
-<text text-anchor="start" x="168.25" y="-499.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="220.75" y="-488.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Remove</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node19 -->
-<g id="edge19_Node000003_Node000019" class="edge">
-<title>Node3&#45;&gt;Node19</title>
-<g id="a_edge19_Node000003_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.51,-638.72C126.21,-615.21 173.71,-555.5 200.54,-521.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="203.09,-524.19 206.57,-514.19 197.61,-519.84 203.09,-524.19"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d" target="_top" xlink:title="A insert implementation of pre&#45;split.">
-<polygon fill="white" stroke="#666666" points="470.5,-729.88 327,-729.88 327,-699.38 470.5,-699.38 470.5,-729.88"/>
-<text text-anchor="start" x="335" y="-716.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="398.75" y="-705.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::InsertPreSplit</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.51,-691.71C288.27,-694.1 302.18,-696.7 315.88,-699.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.84,-702.64 325.31,-701.04 316.13,-695.76 314.84,-702.64"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="649.25,-724.25 549.25,-724.25 549.25,-705 649.25,-705 649.25,-724.25"/>
-<text text-anchor="middle" x="599.25" y="-710.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr::get</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.85,-714.62C492.63,-714.62 516.38,-714.62 537.4,-714.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="537.26,-718.13 547.26,-714.63 537.26,-711.13 537.26,-718.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" target="_top" xlink:title="Merge node to a not&#45;full target node.">
-<polygon fill="white" stroke="#666666" points="682.25,-822.88 516.25,-822.88 516.25,-792.38 682.25,-792.38 682.25,-822.88"/>
-<text text-anchor="start" x="524.25" y="-809.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.25" y="-798.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNodeNotFull</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M462.45,-730.21C468.69,-732.89 474.75,-736.01 480.25,-739.62 500.79,-753.13 495.75,-768.06 516.25,-781.62 519.3,-783.64 522.52,-785.52 525.85,-787.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="524.17,-790.33 534.71,-791.4 527.14,-783.99 524.17,-790.33"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" target="_top" xlink:title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node.">
-<polygon fill="white" stroke="#666666" points="662.75,-772.88 535.75,-772.88 535.75,-742.38 662.75,-742.38 662.75,-772.88"/>
-<text text-anchor="start" x="543.75" y="-759.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.25" y="-748.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::SplitNode</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node13 -->
-<g id="edge13_Node000005_Node000013" class="edge">
-<title>Node5&#45;&gt;Node13</title>
-<g id="a_edge13_Node000005_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M470.85,-730.03C488.36,-733.82 507.13,-737.89 524.75,-741.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="523.55,-745.02 534.06,-743.72 525.03,-738.18 523.55,-745.02"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" target="_top" xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="white" stroke="#666666" points="854.25,-870.88 737.75,-870.88 737.75,-840.38 854.25,-840.38 854.25,-870.88"/>
-<text text-anchor="start" x="745.75" y="-857.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-846.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M664.02,-823.34C683.96,-828.26 706.03,-833.7 726.29,-838.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="725.32,-842.06 735.87,-841.05 727,-835.26 725.32,-842.06"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="1039,-822.88 933,-822.88 933,-792.38 1039,-792.38 1039,-822.88"/>
-<text text-anchor="start" x="941" y="-809.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="986" y="-798.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node11 -->
-<g id="edge11_Node000007_Node000011" class="edge">
-<title>Node7&#45;&gt;Node11</title>
-<g id="a_edge11_Node000007_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M682.32,-807.62C753.73,-807.62 855.77,-807.62 921.2,-807.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="921.07,-811.13 931.07,-807.63 921.07,-804.13 921.07,-811.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="850.88,-585.88 741.12,-585.88 741.12,-555.38 850.88,-555.38 850.88,-585.88"/>
-<text text-anchor="start" x="749.12" y="-572.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-561.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node12 -->
-<g id="edge12_Node000007_Node000012" class="edge">
-<title>Node7&#45;&gt;Node12</title>
-<g id="a_edge12_Node000007_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M669.92,-791.92C674.48,-789.04 678.67,-785.64 682.25,-781.62 738.24,-718.74 662.51,-658.73 718.25,-595.62 721.83,-591.57 726.08,-588.17 730.7,-585.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="732.01,-588.58 739.31,-580.9 728.81,-582.36 732.01,-588.58"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="1041.62,-920.88 930.38,-920.88 930.38,-890.38 1041.62,-890.38 1041.62,-920.88"/>
-<text text-anchor="start" x="938.38" y="-907.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="986" y="-896.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge8_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge8_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M854.68,-870.97C875,-876.37 897.98,-882.48 918.93,-888.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="917.97,-891.42 928.54,-890.61 919.77,-884.66 917.97,-891.42"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="1062.25,-871.88 909.75,-871.88 909.75,-841.38 1062.25,-841.38 1062.25,-871.88"/>
-<text text-anchor="start" x="917.75" y="-858.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="986" y="-847.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge9_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge9_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M854.68,-855.93C868.45,-856.01 883.43,-856.08 898.19,-856.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="897.86,-859.66 907.88,-856.21 897.9,-852.66 897.86,-859.66"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node11 -->
-<g id="edge10_Node000008_Node000011" class="edge">
-<title>Node8&#45;&gt;Node11</title>
-<g id="a_edge10_Node000008_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M854.68,-840.9C875.82,-835.5 899.86,-829.36 921.48,-823.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="922.25,-827.26 931.08,-821.39 920.52,-820.48 922.25,-827.26"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="450.25,-890.25 347.25,-890.25 347.25,-871 450.25,-871 450.25,-890.25"/>
-<text text-anchor="middle" x="398.75" y="-876.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge15_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge15_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.89,-822.3C262.62,-834.88 290.6,-852.13 317.25,-862.62 323.23,-864.98 329.58,-867.06 335.99,-868.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.76,-872.19 345.32,-871.36 336.55,-865.42 334.76,-872.19"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="425.5,-853.25 372,-853.25 372,-834 425.5,-834 425.5,-853.25"/>
-<text text-anchor="middle" x="398.75" y="-839.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node16 -->
-<g id="edge16_Node000014_Node000016" class="edge">
-<title>Node14&#45;&gt;Node16</title>
-<g id="a_edge16_Node000014_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.08,-817.63C301.9,-823.47 335.44,-830.53 360.57,-835.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="359.83,-839.23 370.34,-837.86 361.27,-832.38 359.83,-839.23"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="449.12,-816.25 348.38,-816.25 348.38,-797 449.12,-797 449.12,-816.25"/>
-<text text-anchor="middle" x="398.75" y="-802.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node17 -->
-<g id="edge17_Node000014_Node000017" class="edge">
-<title>Node14&#45;&gt;Node17</title>
-<g id="a_edge17_Node000014_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.08,-806.62C293.74,-806.62 316.25,-806.62 336.64,-806.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.52,-810.13 346.52,-806.63 336.52,-803.13 336.52,-810.13"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be" target="_top" xlink:title="Print the tree to a dot file. You can convert it to picture with graphviz.">
-<polygon fill="white" stroke="#666666" points="462.62,-778.88 334.88,-778.88 334.88,-748.38 462.62,-748.38 462.62,-778.88"/>
-<text text-anchor="start" x="342.88" y="-765.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="398.75" y="-754.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::PrintNode</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node18 -->
-<g id="edge18_Node000014_Node000018" class="edge">
-<title>Node14&#45;&gt;Node18</title>
-<g id="a_edge18_Node000014_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M274.08,-793.84C289.62,-790.04 306.95,-785.81 323.61,-781.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="324.07,-785.23 332.95,-779.46 322.41,-778.43 324.07,-785.23"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4" target="_top" xlink:title="Main function implement the pre&#45;merge remove operation.">
-<polygon fill="white" stroke="#666666" points="480.25,-447.88 317.25,-447.88 317.25,-417.38 480.25,-417.38 480.25,-447.88"/>
-<text text-anchor="start" x="325.25" y="-434.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="398.75" y="-423.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::RemovePreMerge</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge20_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge20_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.35,-481.89C288.48,-472.98 318.87,-461.76 344.55,-452.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.65,-455.6 353.81,-448.85 343.22,-449.03 345.65,-455.6"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657" target="_top" xlink:title="Get the max item of the tree.">
-<polygon fill="white" stroke="#666666" points="678.12,-686.88 520.38,-686.88 520.38,-656.38 678.12,-656.38 678.12,-686.88"/>
-<text text-anchor="start" x="528.38" y="-673.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.25" y="-662.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node21 -->
-<g id="edge21_Node000020_Node000021" class="edge">
-<title>Node20&#45;&gt;Node21</title>
-<g id="a_edge21_Node000020_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M404.04,-448.13C415.52,-486.86 450.67,-588.65 516.25,-643.62 519.28,-646.17 522.56,-648.48 525.99,-650.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="524.23,-653.62 534.69,-655.28 527.55,-647.45 524.23,-653.62"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36" target="_top" xlink:title="Get the min item of the tree.">
-<polygon fill="white" stroke="#666666" points="676.62,-634.88 521.88,-634.88 521.88,-604.38 676.62,-604.38 676.62,-634.88"/>
-<text text-anchor="start" x="529.88" y="-621.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.25" y="-610.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node24 -->
-<g id="edge24_Node000020_Node000024" class="edge">
-<title>Node20&#45;&gt;Node24</title>
-<g id="a_edge24_Node000020_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M416.33,-448.25C451.22,-481.11 532.35,-557.54 573.44,-596.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="570.79,-598.57 580.47,-602.88 575.59,-593.47 570.79,-598.57"/>
-</a>
-</g>
-</g>
-<!-- Node27 -->
-<g id="Node000027" class="node">
-<title>Node27</title>
-<g id="a_Node000027"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" target="_top" xlink:title="Check if node is a 2&#45;node.">
-<polygon fill="white" stroke="#666666" points="850.5,-291.88 741.5,-291.88 741.5,-261.38 850.5,-261.38 850.5,-291.88"/>
-<text text-anchor="start" x="749.5" y="-278.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-267.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is2Node</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node27 -->
-<g id="edge27_Node000020_Node000027" class="edge">
-<title>Node20&#45;&gt;Node27</title>
-<g id="a_edge27_Node000020_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M414.35,-417C434.98,-395.88 474.81,-358.59 516.25,-338.62 521.13,-336.27 649.28,-308.23 730.1,-290.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="730.67,-294.14 739.7,-288.6 729.18,-287.3 730.67,-294.14"/>
-</a>
-</g>
-</g>
-<!-- Node28 -->
-<g id="Node000028" class="node">
-<title>Node28</title>
-<g id="a_Node000028"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18" target="_top" xlink:title="Check if node is a 3&#45;node or 4&#45;node, this is useful when we delete item from 2&#45;3&#45;4 tree.">
-<polygon fill="white" stroke="#666666" points="656.38,-512.88 542.12,-512.88 542.12,-482.38 656.38,-482.38 656.38,-512.88"/>
-<text text-anchor="start" x="550.12" y="-499.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.25" y="-488.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is34Node</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node28 -->
-<g id="edge28_Node000020_Node000028" class="edge">
-<title>Node20&#45;&gt;Node28</title>
-<g id="a_edge28_Node000020_Node000028"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M447.8,-448.36C475.37,-457.39 510.2,-468.79 539.41,-478.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="538.27,-481.67 548.86,-481.45 540.44,-475.01 538.27,-481.67"/>
-</a>
-</g>
-</g>
-<!-- Node29 -->
-<g id="Node000029" class="node">
-<title>Node29</title>
-<g id="a_Node000029"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e" target="_top" xlink:title="Do the actual left rotate operation.">
-<polygon fill="white" stroke="#666666" points="861,-438.88 731,-438.88 731,-408.38 861,-408.38 861,-438.88"/>
-<text text-anchor="start" x="739" y="-425.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-414.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::LeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node29 -->
-<g id="edge29_Node000020_Node000029" class="edge">
-<title>Node20&#45;&gt;Node29</title>
-<g id="a_edge29_Node000020_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M480.48,-436.21C537.01,-438.05 614.29,-439.23 682.25,-435.62 694.29,-434.99 707.02,-433.97 719.43,-432.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="719.59,-436.28 729.19,-431.81 718.9,-429.32 719.59,-436.28"/>
-</a>
-</g>
-</g>
-<!-- Node30 -->
-<g id="Node000030" class="node">
-<title>Node30</title>
-<g id="a_Node000030"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9" target="_top" xlink:title="Merge the item at index of the parent node, and its left and right child.">
-<polygon fill="white" stroke="#666666" points="654.88,-426.88 543.62,-426.88 543.62,-396.38 654.88,-396.38 654.88,-426.88"/>
-<text text-anchor="start" x="551.62" y="-413.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.25" y="-402.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Merge</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node30 -->
-<g id="edge30_Node000020_Node000030" class="edge">
-<title>Node20&#45;&gt;Node30</title>
-<g id="a_edge30_Node000020_Node000030"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M480.49,-424.08C497.67,-422.27 515.62,-420.37 532.17,-418.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="532.3,-422.12 541.88,-417.59 531.57,-415.16 532.3,-422.12"/>
-</a>
-</g>
-</g>
-<!-- Node35 -->
-<g id="Node000035" class="node">
-<title>Node35</title>
-<g id="a_Node000035"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9" target="_top" xlink:title="Do the actual right rotate operation.">
-<polygon fill="white" stroke="#666666" points="864.38,-242.88 727.62,-242.88 727.62,-212.38 864.38,-212.38 864.38,-242.88"/>
-<text text-anchor="start" x="735.62" y="-229.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-218.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::RightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node35 -->
-<g id="edge37_Node000020_Node000035" class="edge">
-<title>Node20&#45;&gt;Node35</title>
-<g id="a_edge37_Node000020_Node000035"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M407.59,-416.97C427.99,-376.92 483.42,-272.43 516.25,-252.62 576.14,-216.48 656.83,-213.09 715.99,-217.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="715.4,-220.5 725.63,-217.77 715.93,-213.52 715.4,-220.5"/>
-</a>
-</g>
-</g>
-<!-- Node36 -->
-<g id="Node000036" class="node">
-<title>Node36</title>
-<g id="a_Node000036"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9" target="_top" xlink:title="A handy function to try if we can do a left rotate to the target node.">
-<polygon fill="white" stroke="#666666" points="671.38,-377.88 527.12,-377.88 527.12,-347.38 671.38,-347.38 671.38,-377.88"/>
-<text text-anchor="start" x="535.12" y="-364.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.25" y="-353.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryLeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node36 -->
-<g id="edge38_Node000020_Node000036" class="edge">
-<title>Node20&#45;&gt;Node36</title>
-<g id="a_edge38_Node000020_Node000036"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M438.32,-416.91C460.89,-407.93 490.01,-396.68 516.25,-387.62 521.97,-385.65 527.93,-383.68 533.93,-381.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="534.78,-385.15 543.25,-378.8 532.66,-378.48 534.78,-385.15"/>
-</a>
-</g>
-</g>
-<!-- Node37 -->
-<g id="Node000037" class="node">
-<title>Node37</title>
-<g id="a_Node000037"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3" target="_top" xlink:title="A handy function to try if we can do a right rotate to the target node.">
-<polygon fill="white" stroke="#666666" points="674.75,-291.88 523.75,-291.88 523.75,-261.38 674.75,-261.38 674.75,-291.88"/>
-<text text-anchor="start" x="531.75" y="-278.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="599.25" y="-267.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryRightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node37 -->
-<g id="edge41_Node000020_Node000037" class="edge">
-<title>Node20&#45;&gt;Node37</title>
-<g id="a_edge41_Node000020_Node000037"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M410.11,-417.07C428.49,-390.6 469.33,-336.65 516.25,-305.62 521.09,-302.43 526.31,-299.54 531.71,-296.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.12,-300.14 540.85,-292.89 530.29,-293.73 533.12,-300.14"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57" target="_top" xlink:title="Get max item (rightmost) in the current node.">
-<polygon fill="white" stroke="#666666" points="859.12,-781.88 732.88,-781.88 732.88,-751.38 859.12,-751.38 859.12,-781.88"/>
-<text text-anchor="start" x="740.88" y="-768.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-757.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node21&#45;&gt;Node22 -->
-<g id="edge22_Node000021_Node000022" class="edge">
-<title>Node21&#45;&gt;Node22</title>
-<g id="a_edge22_Node000021_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M667.22,-687.31C672.5,-689.71 677.58,-692.46 682.25,-695.62 703.74,-710.19 696.98,-726.74 718.25,-741.62 720.43,-743.15 722.71,-744.59 725.06,-745.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="723.21,-748.93 733.71,-750.35 726.39,-742.69 723.21,-748.93"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94" target="_top" xlink:title="Get rightmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="873.75,-732.88 718.25,-732.88 718.25,-702.38 873.75,-702.38 873.75,-732.88"/>
-<text text-anchor="start" x="726.25" y="-719.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-708.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetRightmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node21&#45;&gt;Node23 -->
-<g id="edge23_Node000021_Node000023" class="edge">
-<title>Node21&#45;&gt;Node23</title>
-<g id="a_edge23_Node000021_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M666.73,-687.33C683.09,-691.19 700.75,-695.36 717.58,-699.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="716.48,-702.68 727.02,-701.57 718.09,-695.86 716.48,-702.68"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e" target="_top" xlink:title="Get leftmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="870.38,-683.88 721.62,-683.88 721.62,-653.38 870.38,-653.38 870.38,-683.88"/>
-<text text-anchor="start" x="729.62" y="-670.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-659.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetLeftmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node25 -->
-<g id="edge25_Node000024_Node000025" class="edge">
-<title>Node24&#45;&gt;Node25</title>
-<g id="a_edge25_Node000024_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M662.67,-635.33C681.45,-640.06 702.24,-645.29 721.66,-650.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="720.58,-653.51 731.13,-652.55 722.28,-646.72 720.58,-653.51"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71" target="_top" xlink:title="get min item (leftmost) in the current node">
-<polygon fill="white" stroke="#666666" points="857.62,-634.88 734.38,-634.88 734.38,-604.38 857.62,-604.38 857.62,-634.88"/>
-<text text-anchor="start" x="742.38" y="-621.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-610.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node26 -->
-<g id="edge26_Node000024_Node000026" class="edge">
-<title>Node24&#45;&gt;Node26</title>
-<g id="a_edge26_Node000024_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M676.94,-619.62C692.04,-619.62 707.83,-619.62 722.78,-619.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="722.5,-623.13 732.5,-619.63 722.5,-616.13 722.5,-623.13"/>
-</a>
-</g>
-</g>
-<!-- Node30&#45;&gt;Node12 -->
-<g id="edge34_Node000030_Node000012" class="edge">
-<title>Node30&#45;&gt;Node12</title>
-<g id="a_edge34_Node000030_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M626.8,-427.17C644.23,-438.39 666.62,-454.82 682.25,-473.62 705.12,-501.14 691.14,-522.28 718.25,-545.62 722.06,-548.9 726.3,-551.75 730.79,-554.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="729.02,-557.27 739.55,-558.43 732.04,-550.95 729.02,-557.27"/>
-</a>
-</g>
-</g>
-<!-- Node30&#45;&gt;Node27 -->
-<g id="edge33_Node000030_Node000027" class="edge">
-<title>Node30&#45;&gt;Node27</title>
-<g id="a_edge33_Node000030_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M655.37,-402.09C665.14,-398.48 674.62,-393.5 682.25,-386.62 712.74,-359.17 688.02,-329.37 718.25,-301.62 722.17,-298.02 726.62,-294.94 731.36,-292.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="732.53,-295.62 740.03,-288.14 729.5,-289.31 732.53,-295.62"/>
-</a>
-</g>
-</g>
-<!-- Node31 -->
-<g id="Node000031" class="node">
-<title>Node31</title>
-<g id="a_Node000031"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" target="_top" xlink:title="Get the child pointer at position of index.">
-<polygon fill="white" stroke="#666666" points="851.25,-389.88 740.75,-389.88 740.75,-359.38 851.25,-359.38 851.25,-389.88"/>
-<text text-anchor="start" x="748.75" y="-376.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-365.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetChild</text>
-</a>
-</g>
-</g>
-<!-- Node30&#45;&gt;Node31 -->
-<g id="edge31_Node000030_Node000031" class="edge">
-<title>Node30&#45;&gt;Node31</title>
-<g id="a_edge31_Node000030_Node000031"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M655.28,-401.17C678.29,-396.8 705.22,-391.68 729.27,-387.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="729.79,-390.58 738.96,-385.27 728.48,-383.7 729.79,-390.58"/>
-</a>
-</g>
-</g>
-<!-- Node32 -->
-<g id="Node000032" class="node">
-<title>Node32</title>
-<g id="a_Node000032"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" target="_top" xlink:title="Get item of the \index index.">
-<polygon fill="white" stroke="#666666" points="849.75,-340.88 742.25,-340.88 742.25,-310.38 849.75,-310.38 849.75,-340.88"/>
-<text text-anchor="start" x="750.25" y="-327.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-316.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetItem</text>
-</a>
-</g>
-</g>
-<!-- Node30&#45;&gt;Node32 -->
-<g id="edge32_Node000030_Node000032" class="edge">
-<title>Node30&#45;&gt;Node32</title>
-<g id="a_edge32_Node000030_Node000032"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M655.22,-398.96C664.59,-395.67 673.96,-391.6 682.25,-386.62 701.65,-374.98 698.96,-362.45 718.25,-350.62 722.46,-348.04 726.97,-345.69 731.61,-343.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="732.65,-346.93 740.53,-339.85 729.96,-340.47 732.65,-346.93"/>
-</a>
-</g>
-</g>
-<!-- Node33 -->
-<g id="Node000033" class="node">
-<title>Node33</title>
-<g id="a_Node000033"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1" target="_top" xlink:title="Set the item count of the node.">
-<polygon fill="white" stroke="#666666" points="852.75,-536.88 739.25,-536.88 739.25,-506.38 852.75,-506.38 852.75,-536.88"/>
-<text text-anchor="start" x="747.25" y="-523.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-512.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetCount</text>
-</a>
-</g>
-</g>
-<!-- Node30&#45;&gt;Node33 -->
-<g id="edge35_Node000030_Node000033" class="edge">
-<title>Node30&#45;&gt;Node33</title>
-<g id="a_edge35_Node000030_Node000033"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M620.39,-427.29C648.44,-448.92 698.1,-486.4 718.25,-496.62 721.73,-498.39 725.36,-500.07 729.07,-501.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="727.67,-504.87 738.25,-505.33 730.27,-498.37 727.67,-504.87"/>
-</a>
-</g>
-</g>
-<!-- Node34 -->
-<g id="Node000034" class="node">
-<title>Node34</title>
-<g id="a_Node000034"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc" target="_top" xlink:title="Set item value at position of index.">
-<polygon fill="white" stroke="#666666" points="849.38,-487.88 742.62,-487.88 742.62,-457.38 849.38,-457.38 849.38,-487.88"/>
-<text text-anchor="start" x="750.62" y="-474.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="796" y="-463.12" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetItem</text>
-</a>
-</g>
-</g>
-<!-- Node30&#45;&gt;Node34 -->
-<g id="edge36_Node000030_Node000034" class="edge">
-<title>Node30&#45;&gt;Node34</title>
-<g id="a_edge36_Node000030_Node000034"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M650.4,-427.33C675.96,-435.34 707.24,-445.14 734.16,-453.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="732.98,-456.87 743.57,-456.52 735.08,-450.19 732.98,-456.87"/>
-</a>
-</g>
-</g>
-<!-- Node36&#45;&gt;Node27 -->
-<g id="edge39_Node000036_Node000027" class="edge">
-<title>Node36&#45;&gt;Node27</title>
-<g id="a_edge39_Node000036_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M654.09,-346.95C663.77,-343.21 673.54,-338.77 682.25,-333.62 700.68,-322.74 699.68,-312.28 718.25,-301.62 722.28,-299.31 726.56,-297.18 730.95,-295.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="732.02,-298.56 739.94,-291.52 729.36,-292.08 732.02,-298.56"/>
-</a>
-</g>
-</g>
-<!-- Node36&#45;&gt;Node29 -->
-<g id="edge40_Node000036_Node000029" class="edge">
-<title>Node36&#45;&gt;Node29</title>
-<g id="a_edge40_Node000036_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M651.9,-378.26C661.97,-381.34 672.45,-384.57 682.25,-387.62 699.63,-393.05 718.49,-399.03 735.72,-404.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="734.17,-407.72 744.76,-407.43 736.31,-401.05 734.17,-407.72"/>
-</a>
-</g>
-</g>
-<!-- Node37&#45;&gt;Node27 -->
-<g id="edge42_Node000037_Node000027" class="edge">
-<title>Node37&#45;&gt;Node27</title>
-<g id="a_edge42_Node000037_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M674.99,-276.62C693.03,-276.62 712.16,-276.62 729.73,-276.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="729.5,-280.13 739.5,-276.63 729.5,-273.13 729.5,-280.13"/>
-</a>
-</g>
-</g>
-<!-- Node37&#45;&gt;Node35 -->
-<g id="edge43_Node000037_Node000035" class="edge">
-<title>Node37&#45;&gt;Node35</title>
-<g id="a_edge43_Node000037_Node000035"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M662.67,-260.92C681.45,-256.19 702.24,-250.96 721.66,-246.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="722.28,-249.53 731.13,-243.7 720.58,-242.74 722.28,-249.53"/>
-</a>
-</g>
-</g>
-<!-- Node39 -->
-<g id="Node000039" class="node">
-<title>Node39</title>
-<g id="a_Node000039"><a xlink:href="../../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a" target="_top" xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
-<polygon fill="white" stroke="#666666" points="246.38,-243.25 195.12,-243.25 195.12,-224 246.38,-224 246.38,-243.25"/>
-<text text-anchor="middle" x="220.75" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
-</a>
-</g>
-</g>
-<!-- Node38&#45;&gt;Node39 -->
-<g id="edge45_Node000038_Node000039" class="edge">
-<title>Node38&#45;&gt;Node39</title>
-<g id="a_edge45_Node000038_Node000039"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.87,-233.62C135.15,-233.62 161.59,-233.62 183.21,-233.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.12,-237.13 193.12,-233.63 183.12,-230.13 183.12,-237.13"/>
-</a>
-</g>
-</g>
-<!-- Node44 -->
-<g id="Node000044" class="node">
-<title>Node44</title>
-<g id="a_Node000044"><a xlink:href="../../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="259.88,-112.25 181.62,-112.25 181.62,-93 259.88,-93 259.88,-112.25"/>
-<text text-anchor="middle" x="220.75" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
-</a>
-</g>
-</g>
-<!-- Node38&#45;&gt;Node44 -->
-<g id="edge53_Node000038_Node000044" class="edge">
-<title>Node38&#45;&gt;Node44</title>
-<g id="a_edge53_Node000038_Node000044"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.65,-223.78C128.74,-201.87 177.38,-148.83 203.13,-120.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.41,-123.44 209.59,-113.7 200.26,-118.71 205.41,-123.44"/>
-</a>
-</g>
-</g>
-<!-- Node40 -->
-<g id="Node000040" class="node">
-<title>Node40</title>
-<g id="a_Node000040"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="436.38,-243.25 361.12,-243.25 361.12,-224 436.38,-224 436.38,-243.25"/>
-<text text-anchor="middle" x="398.75" y="-229.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
-</a>
-</g>
-</g>
-<!-- Node39&#45;&gt;Node40 -->
-<g id="edge46_Node000039_Node000040" class="edge">
-<title>Node39&#45;&gt;Node40</title>
-<g id="a_edge46_Node000039_Node000040"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M246.59,-233.62C273.21,-233.62 316.11,-233.62 349.43,-233.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="349.25,-237.13 359.25,-233.63 349.25,-230.13 349.25,-237.13"/>
-</a>
-</g>
-</g>
-<!-- Node42 -->
-<g id="Node000042" class="node">
-<title>Node42</title>
-<g id="a_Node000042"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="434.88,-206.25 362.62,-206.25 362.62,-187 434.88,-187 434.88,-206.25"/>
-<text text-anchor="middle" x="398.75" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
-</a>
-</g>
-</g>
-<!-- Node39&#45;&gt;Node42 -->
-<g id="edge49_Node000039_Node000042" class="edge">
-<title>Node39&#45;&gt;Node42</title>
-<g id="a_edge49_Node000039_Node000042"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M246.59,-228.4C273.75,-222.69 317.87,-213.42 351.45,-206.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="351.85,-209.85 360.91,-204.37 350.41,-203 351.85,-209.85"/>
-</a>
-</g>
-</g>
-<!-- Node43 -->
-<g id="Node000043" class="node">
-<title>Node43</title>
-<g id="a_Node000043"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="426.62,-280.25 370.88,-280.25 370.88,-261 426.62,-261 426.62,-280.25"/>
-<text text-anchor="middle" x="398.75" y="-266.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
-</a>
-</g>
-</g>
-<!-- Node39&#45;&gt;Node43 -->
-<g id="edge51_Node000039_Node000043" class="edge">
-<title>Node39&#45;&gt;Node43</title>
-<g id="a_edge51_Node000039_Node000043"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M246.59,-238.85C275.96,-245.02 325.17,-255.37 359.43,-262.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="358.44,-265.94 368.95,-264.57 359.88,-259.09 358.44,-265.94"/>
-</a>
-</g>
-</g>
-<!-- Node41 -->
-<g id="Node000041" class="node">
-<title>Node41</title>
-<g id="a_Node000041"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="633.5,-187.25 565,-187.25 565,-168 633.5,-168 633.5,-187.25"/>
-<text text-anchor="middle" x="599.25" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node40&#45;&gt;Node41 -->
-<g id="edge47_Node000040_Node000041" class="edge">
-<title>Node40&#45;&gt;Node41</title>
-<g id="a_edge47_Node000040_Node000041"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M436.79,-226.09C450.51,-223.1 466.16,-219.46 480.25,-215.62 506.66,-208.44 535.96,-199.01 558.75,-191.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="559.6,-194.75 567.94,-188.23 557.35,-188.12 559.6,-194.75"/>
-</a>
-</g>
-</g>
-<!-- Node41&#45;&gt;Node41 -->
-<g id="edge48_Node000041_Node000041" class="edge">
-<title>Node41&#45;&gt;Node41</title>
-<g id="a_edge48_Node000041_Node000041"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M568.45,-187.54C554.4,-196.15 564.67,-205.25 599.25,-205.25 619.24,-205.25 631.11,-202.21 634.85,-197.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="638.04,-196.54 630.68,-188.91 631.68,-199.46 638.04,-196.54"/>
-</a>
-</g>
-</g>
-<!-- Node42&#45;&gt;Node41 -->
-<g id="edge50_Node000042_Node000041" class="edge">
-<title>Node42&#45;&gt;Node41</title>
-<g id="a_edge50_Node000042_Node000041"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M435.24,-193.23C468.34,-190.06 517.86,-185.32 553.63,-181.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="553.6,-185.42 563.22,-180.98 552.93,-178.45 553.6,-185.42"/>
-</a>
-</g>
-</g>
-<!-- Node43&#45;&gt;Node41 -->
-<g id="edge52_Node000043_Node000041" class="edge">
-<title>Node43&#45;&gt;Node41</title>
-<g id="a_edge52_Node000043_Node000041"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M427.06,-268.1C443.24,-265.75 463.75,-261.24 480.25,-252.62 499.49,-242.58 498.43,-232.02 516.25,-219.62 531.29,-209.16 549.29,-199.65 564.59,-192.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="565.72,-195.67 573.31,-188.28 562.77,-189.33 565.72,-195.67"/>
-</a>
-</g>
-</g>
-<!-- Node44&#45;&gt;Node41 -->
-<g id="edge54_Node000044_Node000041" class="edge">
-<title>Node44&#45;&gt;Node41</title>
-<g id="a_edge54_Node000044_Node000041"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.21,-106.36C311.01,-111.73 403.09,-122.97 480.25,-140.62 507.23,-146.8 536.96,-156.13 559.83,-163.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="558.43,-167.11 569.03,-167.05 560.71,-160.49 558.43,-167.11"/>
-</a>
-</g>
-</g>
-<!-- Node45 -->
-<g id="Node000045" class="node">
-<title>Node45</title>
-<g id="a_Node000045"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="434.12,-169.25 363.38,-169.25 363.38,-150 434.12,-150 434.12,-169.25"/>
-<text text-anchor="middle" x="398.75" y="-155.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node44&#45;&gt;Node45 -->
-<g id="edge55_Node000044_Node000045" class="edge">
-<title>Node44&#45;&gt;Node45</title>
-<g id="a_edge55_Node000044_Node000045"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.64,-112.62C268.63,-119.33 294.37,-128.27 317.25,-135.62 328.61,-139.28 340.94,-143.05 352.45,-146.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="351.14,-149.75 361.73,-149.24 353.13,-143.04 351.14,-149.75"/>
-</a>
-</g>
-</g>
-<!-- Node46 -->
-<g id="Node000046" class="node">
-<title>Node46</title>
-<g id="a_Node000046"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="425.88,-93.25 371.62,-93.25 371.62,-74 425.88,-74 425.88,-93.25"/>
-<text text-anchor="middle" x="398.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node44&#45;&gt;Node46 -->
-<g id="edge57_Node000044_Node000046" class="edge">
-<title>Node44&#45;&gt;Node46</title>
-<g id="a_edge57_Node000044_Node000046"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.37,-98.46C290.03,-95.25 330.75,-90.86 360.15,-87.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="360.14,-91.21 369.7,-86.65 359.38,-84.25 360.14,-91.21"/>
-</a>
-</g>
-</g>
-<!-- Node47 -->
-<g id="Node000047" class="node">
-<title>Node47</title>
-<g id="a_Node000047"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="424.38,-56.25 373.12,-56.25 373.12,-37 424.38,-37 424.38,-56.25"/>
-<text text-anchor="middle" x="398.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node44&#45;&gt;Node47 -->
-<g id="edge58_Node000044_Node000047" class="edge">
-<title>Node44&#45;&gt;Node47</title>
-<g id="a_edge58_Node000044_Node000047"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M244.16,-92.53C263.28,-84.21 291.67,-72.52 317.25,-64.62 331.58,-60.2 347.65,-56.39 361.64,-53.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="362.24,-56.87 371.34,-51.44 360.84,-50.01 362.24,-56.87"/>
-</a>
-</g>
-</g>
-<!-- Node48 -->
-<g id="Node000048" class="node">
-<title>Node48</title>
-<g id="a_Node000048"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="428.12,-19.25 369.38,-19.25 369.38,0 428.12,0 428.12,-19.25"/>
-<text text-anchor="middle" x="398.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node44&#45;&gt;Node48 -->
-<g id="edge59_Node000044_Node000048" class="edge">
-<title>Node44&#45;&gt;Node48</title>
-<g id="a_edge59_Node000044_Node000048"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M231.32,-92.64C247.46,-76.41 281.82,-44.43 317.25,-27.62 329.86,-21.64 344.53,-17.61 357.88,-14.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="358.47,-18.35 367.68,-13.12 357.22,-11.47 358.47,-18.35"/>
-</a>
-</g>
-</g>
-<!-- Node45&#45;&gt;Node41 -->
-<g id="edge56_Node000045_Node000041" class="edge">
-<title>Node45&#45;&gt;Node41</title>
-<g id="a_edge56_Node000045_Node000041"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M434.33,-162.76C467.4,-165.76 517.45,-170.3 553.54,-173.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="552.95,-177.03 563.22,-174.45 553.58,-170.06 552.95,-177.03"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map b/db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map
deleted file mode 100644
index 025179928..000000000
--- a/db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map
+++ /dev/null
@@ -1,78 +0,0 @@
-<map id="test1" name="test1">
-<area shape="rect" id="Node000001" title="simple test to insert a given array and delete some item, and print the tree" alt="" coords="5,554,56,580"/>
-<area shape="rect" id="Node000002" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e" title="Insert item to tree." alt="" coords="112,355,257,395"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="40,552,155,406,160,409,44,555"/>
-<area shape="rect" id="Node000012" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165" title="Print tree into a dot file." alt="" coords="114,661,255,702"/>
-<area shape="poly" id="edge12_Node000001_Node000012" title=" " alt="" coords="51,578,145,650,142,654,48,582"/>
-<area shape="rect" id="Node000017" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11" title="Remove item from tree." alt="" coords="104,547,265,587"/>
-<area shape="poly" id="edge17_Node000001_Node000017" title=" " alt="" coords="56,564,88,564,88,570,56,570"/>
-<area shape="rect" id="Node000003" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d" title="A insert implementation of pre&#45;split." alt="" coords="326,220,517,261"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="220,352,369,267,372,271,223,357"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/unique_ptr/get.html#" title=" " alt="" coords="622,137,756,162"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="466,217,519,194,578,172,606,164,608,169,579,178,521,199,468,222"/>
-<area shape="rect" id="Node000005" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" title="Merge node to a not&#45;full target node." alt="" coords="578,187,800,227"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="517,226,562,220,563,225,518,231"/>
-<area shape="rect" id="Node000011" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node." alt="" coords="604,252,774,293"/>
-<area shape="poly" id="edge11_Node000003_Node000011" title=" " alt="" coords="518,249,589,258,589,263,517,254"/>
-<area shape="rect" id="Node000006" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" title="Insert item to the proper position of the node and return the position index." alt="" coords="874,72,1029,113"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="774,184,798,173,822,153,846,133,876,117,879,122,849,137,826,158,801,177,776,189"/>
-<area shape="rect" id="Node000009" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" title="Check if node is a full (4&#45;node)" alt="" coords="1134,136,1275,177"/>
-<area shape="poly" id="edge9_Node000005_Node000009" title=" " alt="" coords="798,183,847,176,990,163,1118,156,1118,162,991,169,848,182,799,189"/>
-<area shape="rect" id="Node000010" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" title="Set child pointer to the position of index." alt="" coords="878,191,1024,231"/>
-<area shape="poly" id="edge10_Node000005_Node000010" title=" " alt="" coords="800,206,863,207,862,212,800,211"/>
-<area shape="rect" id="Node000007" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" title="Check if item is in the node." alt="" coords="1130,71,1279,111"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="1030,89,1115,89,1115,94,1030,95"/>
-<area shape="rect" id="Node000008" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" title="Insert a value to the index position." alt="" coords="1103,5,1306,46"/>
-<area shape="poly" id="edge7_Node000006_Node000008" title=" " alt="" coords="1029,69,1109,48,1110,53,1030,74"/>
-<area shape="poly" id="edge8_Node000006_Node000009" title=" " alt="" coords="1030,109,1119,132,1118,137,1029,115"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="353,726,490,752"/>
-<area shape="poly" id="edge13_Node000012_Node000013" title=" " alt="" coords="256,697,314,711,349,720,348,725,312,716,254,702"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="386,776,457,801"/>
-<area shape="poly" id="edge14_Node000012_Node000014" title=" " alt="" coords="213,700,259,732,314,762,371,778,370,784,312,767,256,737,210,705"/>
-<area shape="rect" id="Node000015" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="354,612,489,637"/>
-<area shape="poly" id="edge15_Node000012_Node000015" title=" " alt="" coords="254,661,312,647,348,639,349,644,314,652,256,667"/>
-<area shape="rect" id="Node000016" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be" title="Print the tree to a dot file. You can convert it to picture with graphviz." alt="" coords="336,661,507,702"/>
-<area shape="poly" id="edge16_Node000012_Node000016" title=" " alt="" coords="255,679,321,679,321,684,255,684"/>
-<area shape="rect" id="Node000018" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4" title="Main function implement the pre&#45;merge remove operation." alt="" coords="313,547,530,587"/>
-<area shape="poly" id="edge18_Node000017_Node000018" title=" " alt="" coords="265,564,298,564,298,570,265,570"/>
-<area shape="rect" id="Node000019" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657" title="Get the max item of the tree." alt="" coords="584,747,794,787"/>
-<area shape="poly" id="edge19_Node000018_Node000019" title=" " alt="" coords="517,586,532,597,546,613,553,630,557,663,561,695,568,711,580,726,592,736,589,741,576,730,563,714,556,697,552,664,548,632,541,616,528,601,514,590"/>
-<area shape="rect" id="Node000022" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36" title="Get the min item of the tree." alt="" coords="586,844,792,885"/>
-<area shape="poly" id="edge22_Node000018_Node000022" title=" " alt="" coords="519,586,532,597,551,622,559,647,562,672,560,696,559,746,566,771,580,797,600,818,623,834,620,838,596,822,576,801,561,773,554,746,555,696,556,672,554,648,546,625,528,601,515,590"/>
-<area shape="rect" id="Node000025" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" title="Check if node is a 2&#45;node." alt="" coords="879,583,1024,623"/>
-<area shape="poly" id="edge25_Node000018_Node000025" title=" " alt="" coords="531,572,863,594,863,600,531,577"/>
-<area shape="rect" id="Node000026" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18" title="Check if node is a 3&#45;node or 4&#45;node, this is useful when we delete item from 2&#45;3&#45;4 tree." alt="" coords="613,325,765,366"/>
-<area shape="poly" id="edge26_Node000018_Node000026" title=" " alt="" coords="432,545,455,508,487,463,529,417,577,377,597,365,600,370,580,381,532,421,492,467,459,511,437,547"/>
-<area shape="rect" id="Node000027" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e" title="Do the actual left rotate operation." alt="" coords="865,517,1038,558"/>
-<area shape="poly" id="edge27_Node000018_Node000027" title=" " alt="" coords="462,544,516,521,578,503,640,494,689,492,800,503,852,511,851,516,799,508,688,498,640,499,579,508,518,526,464,549"/>
-<area shape="rect" id="Node000028" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9" title="Merge the item at index of the parent node, and its left and right child." alt="" coords="615,391,763,431"/>
-<area shape="poly" id="edge28_Node000018_Node000028" title=" " alt="" coords="449,544,507,503,577,459,623,436,626,440,580,464,510,508,452,548"/>
-<area shape="rect" id="Node000033" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9" title="Do the actual right rotate operation." alt="" coords="860,648,1042,689"/>
-<area shape="poly" id="edge35_Node000018_Node000033" title=" " alt="" coords="514,586,532,597,549,620,556,643,562,664,569,674,580,682,615,699,653,709,692,714,732,715,809,707,876,691,877,696,810,712,732,720,692,719,652,714,613,704,577,687,565,677,557,667,550,644,544,622,529,601,512,590"/>
-<area shape="rect" id="Node000034" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9" title="A handy function to try if we can do a left rotate to the target node." alt="" coords="593,517,785,558"/>
-<area shape="poly" id="edge36_Node000018_Node000034" title=" " alt="" coords="530,552,577,547,578,553,531,558"/>
-<area shape="rect" id="Node000035" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3" title="A handy function to try if we can do a right rotate to the target node." alt="" coords="588,632,790,673"/>
-<area shape="poly" id="edge39_Node000018_Node000035" title=" " alt="" coords="495,585,531,596,614,624,613,629,530,602,494,591"/>
-<area shape="rect" id="Node000020" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57" title="Get max item (rightmost) in the current node." alt="" coords="867,713,1036,754"/>
-<area shape="poly" id="edge20_Node000019_Node000020" title=" " alt="" coords="794,751,852,744,852,749,795,756"/>
-<area shape="rect" id="Node000021" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94" title="Get rightmose child of the current node." alt="" coords="848,779,1055,819"/>
-<area shape="poly" id="edge21_Node000019_Node000021" title=" " alt="" coords="795,777,833,782,832,787,795,783"/>
-<area shape="rect" id="Node000023" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e" title="Get leftmose child of the current node." alt="" coords="852,844,1050,885"/>
-<area shape="poly" id="edge23_Node000022_Node000023" title=" " alt="" coords="793,862,837,862,837,867,793,867"/>
-<area shape="rect" id="Node000024" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71" title="get min item (leftmost) in the current node" alt="" coords="869,909,1034,950"/>
-<area shape="poly" id="edge24_Node000022_Node000024" title=" " alt="" coords="774,883,854,903,853,908,773,888"/>
-<area shape="poly" id="edge32_Node000028_Node000010" title=" " alt="" coords="763,397,781,388,798,376,811,360,817,344,821,311,825,277,832,260,846,242,862,230,866,234,850,246,837,262,830,278,826,311,823,345,815,363,802,380,784,392,765,401"/>
-<area shape="poly" id="edge31_Node000028_Node000025" title=" " alt="" coords="719,430,759,463,802,504,816,522,824,538,833,553,849,568,866,578,864,582,846,572,829,556,820,541,811,525,798,507,756,467,716,434"/>
-<area shape="rect" id="Node000029" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" title="Get the child pointer at position of index." alt="" coords="878,452,1025,493"/>
-<area shape="poly" id="edge29_Node000028_Node000029" title=" " alt="" coords="764,426,863,449,862,454,763,431"/>
-<area shape="rect" id="Node000030" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" title="Get item of the \index index." alt="" coords="880,256,1023,297"/>
-<area shape="poly" id="edge30_Node000028_Node000030" title=" " alt="" coords="762,394,798,376,813,359,821,343,830,325,846,308,864,297,867,301,849,312,834,328,826,345,818,362,801,380,765,398"/>
-<area shape="rect" id="Node000031" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1" title="Set the item count of the node." alt="" coords="876,321,1027,362"/>
-<area shape="poly" id="edge33_Node000028_Node000031" title=" " alt="" coords="763,389,860,363,861,368,764,394"/>
-<area shape="rect" id="Node000032" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc" title="Set item value at position of index." alt="" coords="880,387,1022,427"/>
-<area shape="poly" id="edge34_Node000028_Node000032" title=" " alt="" coords="764,407,865,406,865,411,764,413"/>
-<area shape="poly" id="edge37_Node000034_Node000025" title=" " alt="" coords="774,556,864,579,863,584,773,561"/>
-<area shape="poly" id="edge38_Node000034_Node000027" title=" " alt="" coords="786,535,849,535,849,540,786,540"/>
-<area shape="poly" id="edge40_Node000035_Node000025" title=" " alt="" coords="789,631,862,617,863,622,790,636"/>
-<area shape="poly" id="edge41_Node000035_Node000033" title=" " alt="" coords="790,656,845,659,844,664,790,661"/>
-</map>
diff --git a/db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5 b/db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5
deleted file mode 100644
index 635736f14..000000000
--- a/db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f2f8fe8ce19bdf913b946f0833d90053
\ No newline at end of file
diff --git a/db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg b/db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg
deleted file mode 100644
index 347003604..000000000
--- a/db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg
+++ /dev/null
@@ -1,809 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<!--zoomable 717 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 984;
-var viewHeight = 717;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="simple test to insert a given array and delete some item, and print the tree">
-<polygon fill="#999999" stroke="#666666" points="37.75,-296.88 0,-296.88 0,-277.62 37.75,-277.62 37.75,-296.88"/>
-<text text-anchor="middle" x="18.88" y="-283.38" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e" target="_top" xlink:title="Insert item to tree.">
-<polygon fill="white" stroke="#666666" points="188.75,-446.5 79.75,-446.5 79.75,-416 188.75,-416 188.75,-446.5"/>
-<text text-anchor="start" x="87.75" y="-433" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="134.25" y="-421.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.67,-297.15C45.33,-319.59 88.86,-374.87 114.17,-407.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.21,-408.92 120.15,-414.61 116.71,-404.59 111.21,-408.92"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165" target="_top" xlink:title="Print tree into a dot file.">
-<polygon fill="white" stroke="#666666" points="187.25,-216.5 81.25,-216.5 81.25,-186 187.25,-186 187.25,-216.5"/>
-<text text-anchor="start" x="89.25" y="-203" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="134.25" y="-191.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Print</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge12_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge12_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.88,-277.38C50.06,-264.36 80.81,-241.03 103.76,-223.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.69,-226.55 111.55,-217.71 101.46,-220.97 105.69,-226.55"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11" target="_top" xlink:title="Remove item from tree.">
-<polygon fill="white" stroke="#666666" points="194.75,-302.5 73.75,-302.5 73.75,-272 194.75,-272 194.75,-302.5"/>
-<text text-anchor="start" x="81.75" y="-289" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="134.25" y="-277.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Remove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge17_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge17_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.09,-287.25C44.96,-287.25 53.25,-287.25 62.04,-287.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.86,-290.75 71.86,-287.25 61.86,-283.75 61.86,-290.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d" target="_top" xlink:title="A insert implementation of pre&#45;split.">
-<polygon fill="white" stroke="#666666" points="384,-547.5 240.5,-547.5 240.5,-517 384,-517 384,-547.5"/>
-<text text-anchor="start" x="248.5" y="-534" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="312.25" y="-522.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::InsertPreSplit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.36,-446.81C192.25,-463.96 240.51,-491.66 273.95,-510.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.09,-513.81 282.5,-515.75 275.57,-507.74 272.09,-513.81"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="562.75,-609.88 462.75,-609.88 462.75,-590.62 562.75,-590.62 562.75,-609.88"/>
-<text text-anchor="middle" x="512.75" y="-596.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr::get</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M346.32,-547.94C369.34,-558.42 400.94,-571.93 429.75,-581.25 436.67,-583.49 444.01,-585.58 451.33,-587.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="450.36,-590.85 460.91,-589.88 452.06,-584.06 450.36,-590.85"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" target="_top" xlink:title="Merge node to a not&#45;full target node.">
-<polygon fill="white" stroke="#666666" points="595.75,-572.5 429.75,-572.5 429.75,-542 595.75,-542 595.75,-572.5"/>
-<text text-anchor="start" x="437.75" y="-559" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="512.75" y="-547.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNodeNotFull</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M384.35,-541.2C395.28,-542.58 406.71,-544.02 418.04,-545.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="417.45,-548.9 427.81,-546.68 418.33,-541.96 417.45,-548.9"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" target="_top" xlink:title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node.">
-<polygon fill="white" stroke="#666666" points="576.25,-523.5 449.25,-523.5 449.25,-493 576.25,-493 576.25,-523.5"/>
-<text text-anchor="start" x="457.25" y="-510" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="512.75" y="-498.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::SplitNode</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node11 -->
-<g id="edge11_Node000003_Node000011" class="edge">
-<title>Node3&#45;&gt;Node11</title>
-<g id="a_edge11_Node000003_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M384.35,-523.65C401.69,-521.56 420.28,-519.31 437.75,-517.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="438.03,-520.69 447.54,-516.01 437.19,-513.74 438.03,-520.69"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" target="_top" xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="white" stroke="#666666" points="767.75,-658.5 651.25,-658.5 651.25,-628 767.75,-628 767.75,-658.5"/>
-<text text-anchor="start" x="659.25" y="-645" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-633.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M577.03,-572.89C583.51,-575.33 589.86,-578.11 595.75,-581.25 614.13,-591.05 613.94,-600.45 631.75,-611.25 638.71,-615.47 646.33,-619.38 653.97,-622.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="652.41,-626.05 662.97,-626.89 655.24,-619.65 652.41,-626.05"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="952.5,-610.5 846.5,-610.5 846.5,-580 952.5,-580 952.5,-610.5"/>
-<text text-anchor="start" x="854.5" y="-597" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="899.5" y="-585.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge9_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge9_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M595.14,-572.97C607.38,-574.97 619.87,-576.82 631.75,-578.25 700.85,-586.57 780.55,-590.98 834.71,-593.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="834.56,-596.7 844.69,-593.6 834.84,-589.7 834.56,-596.7"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="764.38,-569.5 654.62,-569.5 654.62,-539 764.38,-539 764.38,-569.5"/>
-<text text-anchor="start" x="662.62" y="-556" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-544.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge10_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge10_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M596.06,-555.98C611.69,-555.74 627.86,-555.49 642.89,-555.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="642.68,-558.76 652.63,-555.11 642.57,-551.77 642.68,-558.76"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="955.12,-659.5 843.88,-659.5 843.88,-629 955.12,-629 955.12,-659.5"/>
-<text text-anchor="start" x="851.88" y="-646" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="899.5" y="-634.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M768.18,-643.56C788.4,-643.66 811.27,-643.79 832.14,-643.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="831.97,-647.4 841.99,-643.95 832,-640.4 831.97,-647.4"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="975.75,-708.5 823.25,-708.5 823.25,-678 975.75,-678 975.75,-708.5"/>
-<text text-anchor="start" x="831.25" y="-695" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="899.5" y="-683.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M768.18,-658.59C787.13,-663.63 808.4,-669.29 828.18,-674.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="827.28,-677.93 837.84,-677.12 829.07,-671.16 827.28,-677.93"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge8_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge8_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M768.18,-628.52C789.32,-623.12 813.36,-616.99 834.98,-611.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="835.75,-614.88 844.58,-609.02 834.02,-608.1 835.75,-614.88"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="363.75,-167.88 260.75,-167.88 260.75,-148.62 363.75,-148.62 363.75,-167.88"/>
-<text text-anchor="middle" x="312.25" y="-154.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge13_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge13_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.26,-188.04C201.36,-184.49 216.63,-180.69 230.75,-177.25 239.28,-175.17 248.34,-173 257.17,-170.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.79,-174.35 266.72,-168.64 256.18,-167.54 257.79,-174.35"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="339,-130.88 285.5,-130.88 285.5,-111.62 339,-111.62 339,-130.88"/>
-<text text-anchor="middle" x="312.25" y="-117.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node14 -->
-<g id="edge14_Node000012_Node000014" class="edge">
-<title>Node12&#45;&gt;Node14</title>
-<g id="a_edge14_Node000012_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.57,-185.73C173.08,-171.61 202.32,-151.2 230.75,-139.25 244.36,-133.53 260.07,-129.49 273.98,-126.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="274.46,-130.19 283.66,-124.95 273.2,-123.3 274.46,-130.19"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="362.62,-253.88 261.88,-253.88 261.88,-234.62 362.62,-234.62 362.62,-253.88"/>
-<text text-anchor="middle" x="312.25" y="-240.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node15 -->
-<g id="edge15_Node000012_Node000015" class="edge">
-<title>Node12&#45;&gt;Node15</title>
-<g id="a_edge15_Node000012_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.26,-214.46C201.36,-218.01 216.63,-221.81 230.75,-225.25 239.28,-227.33 248.34,-229.5 257.17,-231.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="256.18,-234.96 266.72,-233.86 257.79,-228.15 256.18,-234.96"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be" target="_top" xlink:title="Print the tree to a dot file. You can convert it to picture with graphviz.">
-<polygon fill="white" stroke="#666666" points="376.12,-216.5 248.38,-216.5 248.38,-186 376.12,-186 376.12,-216.5"/>
-<text text-anchor="start" x="256.38" y="-203" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="312.25" y="-191.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::PrintNode</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node16 -->
-<g id="edge16_Node000012_Node000016" class="edge">
-<title>Node12&#45;&gt;Node16</title>
-<g id="a_edge16_Node000012_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.58,-201.25C202.97,-201.25 220.12,-201.25 236.63,-201.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.41,-204.75 246.41,-201.25 236.41,-197.75 236.41,-204.75"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4" target="_top" xlink:title="Main function implement the pre&#45;merge remove operation.">
-<polygon fill="white" stroke="#666666" points="393.75,-302.5 230.75,-302.5 230.75,-272 393.75,-272 393.75,-302.5"/>
-<text text-anchor="start" x="238.75" y="-289" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="312.25" y="-277.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::RemovePreMerge</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge18_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge18_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M194.84,-287.25C202.72,-287.25 210.95,-287.25 219.22,-287.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.99,-290.75 228.99,-287.25 218.99,-283.75 218.99,-290.75"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657" target="_top" xlink:title="Get the max item of the tree.">
-<polygon fill="white" stroke="#666666" points="591.62,-152.5 433.88,-152.5 433.88,-122 591.62,-122 591.62,-152.5"/>
-<text text-anchor="start" x="441.88" y="-139" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="512.75" y="-127.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node19 -->
-<g id="edge19_Node000018_Node000019" class="edge">
-<title>Node18&#45;&gt;Node19</title>
-<g id="a_edge19_Node000018_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M382.47,-271.61C386.53,-269.21 390.34,-266.44 393.75,-263.25 427.32,-231.82 396.98,-198.51 429.75,-166.25 432.58,-163.46 435.69,-160.94 439,-158.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="440.66,-161.75 447.47,-153.63 437.09,-155.73 440.66,-161.75"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36" target="_top" xlink:title="Get the min item of the tree.">
-<polygon fill="white" stroke="#666666" points="590.12,-79.5 435.38,-79.5 435.38,-49 590.12,-49 590.12,-79.5"/>
-<text text-anchor="start" x="443.38" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="512.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node22 -->
-<g id="edge22_Node000018_Node000022" class="edge">
-<title>Node18&#45;&gt;Node22</title>
-<g id="a_edge22_Node000018_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M383.66,-271.59C387.33,-269.19 390.74,-266.43 393.75,-263.25 440.9,-213.48 389.14,-168.49 429.75,-113.25 438.12,-101.86 450,-92.63 462.14,-85.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="463.49,-88.62 470.53,-80.71 460.09,-82.5 463.49,-88.62"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" target="_top" xlink:title="Check if node is a 2&#45;node.">
-<polygon fill="white" stroke="#666666" points="764,-275.5 655,-275.5 655,-245 764,-245 764,-275.5"/>
-<text text-anchor="start" x="663" y="-262" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-250.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is2Node</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node25 -->
-<g id="edge25_Node000018_Node000025" class="edge">
-<title>Node18&#45;&gt;Node25</title>
-<g id="a_edge25_Node000018_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M394.19,-281.72C467.74,-276.7 574.88,-269.38 643.13,-264.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="643.33,-268.21 653.06,-264.04 642.85,-261.23 643.33,-268.21"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18" target="_top" xlink:title="Check if node is a 3&#45;node or 4&#45;node, this is useful when we delete item from 2&#45;3&#45;4 tree.">
-<polygon fill="white" stroke="#666666" points="569.88,-468.5 455.62,-468.5 455.62,-438 569.88,-438 569.88,-468.5"/>
-<text text-anchor="start" x="463.62" y="-455" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="512.75" y="-443.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is34Node</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node26 -->
-<g id="edge26_Node000018_Node000026" class="edge">
-<title>Node18&#45;&gt;Node26</title>
-<g id="a_edge26_Node000018_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.94,-302.94C338.86,-332.03 379.03,-394.43 429.75,-428.25 434.5,-431.42 439.68,-434.2 445.03,-436.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="443.52,-439.8 454.1,-440.34 446.17,-433.32 443.52,-439.8"/>
-</a>
-</g>
-</g>
-<!-- Node27 -->
-<g id="Node000027" class="node">
-<title>Node27</title>
-<g id="a_Node000027"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e" target="_top" xlink:title="Do the actual left rotate operation.">
-<polygon fill="white" stroke="#666666" points="774.5,-324.5 644.5,-324.5 644.5,-294 774.5,-294 774.5,-324.5"/>
-<text text-anchor="start" x="652.5" y="-311" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-299.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::LeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node27 -->
-<g id="edge27_Node000018_Node000027" class="edge">
-<title>Node18&#45;&gt;Node27</title>
-<g id="a_edge27_Node000018_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.45,-302.83C366.43,-313.77 399.2,-327.44 429.75,-333.25 502.23,-347.04 522.38,-340.97 595.75,-333.25 608.45,-331.91 621.82,-329.75 634.75,-327.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="635.36,-330.71 644.47,-325.3 633.98,-323.84 635.36,-330.71"/>
-</a>
-</g>
-</g>
-<!-- Node28 -->
-<g id="Node000028" class="node">
-<title>Node28</title>
-<g id="a_Node000028"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9" target="_top" xlink:title="Merge the item at index of the parent node, and its left and right child.">
-<polygon fill="white" stroke="#666666" points="568.38,-419.5 457.12,-419.5 457.12,-389 568.38,-389 568.38,-419.5"/>
-<text text-anchor="start" x="465.12" y="-406" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="512.75" y="-394.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Merge</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node28 -->
-<g id="edge28_Node000018_Node000028" class="edge">
-<title>Node18&#45;&gt;Node28</title>
-<g id="a_edge28_Node000018_Node000028"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M334.06,-302.88C356.87,-319.64 394.87,-346.51 429.75,-366.25 440.73,-372.46 452.9,-378.52 464.43,-383.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="462.86,-387.04 473.41,-388.02 465.77,-380.67 462.86,-387.04"/>
-</a>
-</g>
-</g>
-<!-- Node33 -->
-<g id="Node000033" class="node">
-<title>Node33</title>
-<g id="a_Node000033"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9" target="_top" xlink:title="Do the actual right rotate operation.">
-<polygon fill="white" stroke="#666666" points="777.88,-226.5 641.12,-226.5 641.12,-196 777.88,-196 777.88,-226.5"/>
-<text text-anchor="start" x="649.12" y="-213" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::RightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node33 -->
-<g id="edge35_Node000018_Node000033" class="edge">
-<title>Node18&#45;&gt;Node33</title>
-<g id="a_edge35_Node000018_Node000033"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.73,-271.6C385.36,-269.2 389.76,-266.44 393.75,-263.25 419.25,-242.88 401.58,-215.73 429.75,-199.25 498.49,-159.05 593.91,-175.43 653.38,-192.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="652.38,-195.65 662.96,-195.13 654.36,-188.94 652.38,-195.65"/>
-</a>
-</g>
-</g>
-<!-- Node34 -->
-<g id="Node000034" class="node">
-<title>Node34</title>
-<g id="a_Node000034"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9" target="_top" xlink:title="A handy function to try if we can do a left rotate to the target node.">
-<polygon fill="white" stroke="#666666" points="584.88,-324.5 440.62,-324.5 440.62,-294 584.88,-294 584.88,-324.5"/>
-<text text-anchor="start" x="448.62" y="-311" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="512.75" y="-299.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryLeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node34 -->
-<g id="edge36_Node000018_Node000034" class="edge">
-<title>Node18&#45;&gt;Node34</title>
-<g id="a_edge36_Node000018_Node000034"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M393.99,-296.2C405.5,-297.47 417.36,-298.79 428.91,-300.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="428.5,-303.55 438.83,-301.17 429.27,-296.59 428.5,-303.55"/>
-</a>
-</g>
-</g>
-<!-- Node35 -->
-<g id="Node000035" class="node">
-<title>Node35</title>
-<g id="a_Node000035"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3" target="_top" xlink:title="A handy function to try if we can do a right rotate to the target node.">
-<polygon fill="white" stroke="#666666" points="588.25,-238.5 437.25,-238.5 437.25,-208 588.25,-208 588.25,-238.5"/>
-<text text-anchor="start" x="445.25" y="-225" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="512.75" y="-213.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryRightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node35 -->
-<g id="edge39_Node000018_Node000035" class="edge">
-<title>Node18&#45;&gt;Node35</title>
-<g id="a_edge39_Node000018_Node000035"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M367.03,-271.52C375.97,-268.82 385.13,-265.99 393.75,-263.25 414.18,-256.74 436.49,-249.28 456.15,-242.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.01,-245.97 465.34,-239.42 454.75,-239.35 457.01,-245.97"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57" target="_top" xlink:title="Get max item (rightmost) in the current node.">
-<polygon fill="white" stroke="#666666" points="772.62,-177.5 646.38,-177.5 646.38,-147 772.62,-147 772.62,-177.5"/>
-<text text-anchor="start" x="654.38" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge20_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge20_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M592.12,-147.31C606.3,-149.13 621.04,-151.02 635.07,-152.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="634.28,-156.25 644.64,-154.05 635.17,-149.31 634.28,-156.25"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94" target="_top" xlink:title="Get rightmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="787.25,-128.5 631.75,-128.5 631.75,-98 787.25,-98 787.25,-128.5"/>
-<text text-anchor="start" x="639.75" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetRightmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node21 -->
-<g id="edge21_Node000019_Node000021" class="edge">
-<title>Node19&#45;&gt;Node21</title>
-<g id="a_edge21_Node000019_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M592.12,-127.59C601.36,-126.45 610.84,-125.28 620.21,-124.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="620.56,-127.61 630.05,-122.92 619.7,-120.67 620.56,-127.61"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e" target="_top" xlink:title="Get leftmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="783.88,-79.5 635.12,-79.5 635.12,-49 783.88,-49 783.88,-79.5"/>
-<text text-anchor="start" x="643.12" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetLeftmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node23 -->
-<g id="edge23_Node000022_Node000023" class="edge">
-<title>Node22&#45;&gt;Node23</title>
-<g id="a_edge23_Node000022_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M590.44,-64.25C601.26,-64.25 612.44,-64.25 623.41,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="623.23,-67.75 633.23,-64.25 623.23,-60.75 623.23,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71" target="_top" xlink:title="get min item (leftmost) in the current node">
-<polygon fill="white" stroke="#666666" points="771.12,-30.5 647.88,-30.5 647.88,0 771.12,0 771.12,-30.5"/>
-<text text-anchor="start" x="655.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node24 -->
-<g id="edge24_Node000022_Node000024" class="edge">
-<title>Node22&#45;&gt;Node24</title>
-<g id="a_edge24_Node000022_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M576.17,-48.54C595.33,-43.72 616.56,-38.38 636.31,-33.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="637.12,-36.82 645.96,-30.99 635.41,-30.03 637.12,-36.82"/>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node10 -->
-<g id="edge32_Node000028_Node000010" class="edge">
-<title>Node28&#45;&gt;Node10</title>
-<g id="a_edge32_Node000028_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M568.76,-413.29C578.65,-416.94 588.2,-422.07 595.75,-429.25 629.97,-461.81 597.84,-496.36 631.75,-529.25 635.41,-532.8 639.59,-535.85 644.06,-538.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="642.35,-541.53 652.86,-542.85 645.47,-535.26 642.35,-541.53"/>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node25 -->
-<g id="edge31_Node000028_Node000025" class="edge">
-<title>Node28&#45;&gt;Node25</title>
-<g id="a_edge31_Node000028_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M534.03,-388.71C551.32,-375.01 576.36,-354.05 595.75,-333.25 613.93,-313.74 610.06,-300.77 631.75,-285.25 635.77,-282.37 640.14,-279.82 644.68,-277.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="645.76,-280.9 653.46,-273.63 642.91,-274.5 645.76,-280.9"/>
-</a>
-</g>
-</g>
-<!-- Node29 -->
-<g id="Node000029" class="node">
-<title>Node29</title>
-<g id="a_Node000029"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" target="_top" xlink:title="Get the child pointer at position of index.">
-<polygon fill="white" stroke="#666666" points="764.75,-373.5 654.25,-373.5 654.25,-343 764.75,-343 764.75,-373.5"/>
-<text text-anchor="start" x="662.25" y="-360" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-348.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetChild</text>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node29 -->
-<g id="edge29_Node000028_Node000029" class="edge">
-<title>Node28&#45;&gt;Node29</title>
-<g id="a_edge29_Node000028_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M568.78,-391.25C591.79,-385.82 618.72,-379.46 642.77,-373.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="643.55,-377.19 652.47,-371.48 641.94,-370.38 643.55,-377.19"/>
-</a>
-</g>
-</g>
-<!-- Node30 -->
-<g id="Node000030" class="node">
-<title>Node30</title>
-<g id="a_Node000030"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" target="_top" xlink:title="Get item of the \index index.">
-<polygon fill="white" stroke="#666666" points="763.25,-520.5 655.75,-520.5 655.75,-490 763.25,-490 763.25,-520.5"/>
-<text text-anchor="start" x="663.75" y="-507" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-495.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetItem</text>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node30 -->
-<g id="edge30_Node000028_Node000030" class="edge">
-<title>Node28&#45;&gt;Node30</title>
-<g id="a_edge30_Node000028_Node000030"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M568.63,-415.46C578.2,-418.91 587.67,-423.41 595.75,-429.25 618.23,-445.51 609.42,-463.78 631.75,-480.25 635.86,-483.28 640.35,-485.95 645.03,-488.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="643.58,-491.49 654.14,-492.37 646.43,-485.1 643.58,-491.49"/>
-</a>
-</g>
-</g>
-<!-- Node31 -->
-<g id="Node000031" class="node">
-<title>Node31</title>
-<g id="a_Node000031"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1" target="_top" xlink:title="Set the item count of the node.">
-<polygon fill="white" stroke="#666666" points="766.25,-471.5 652.75,-471.5 652.75,-441 766.25,-441 766.25,-471.5"/>
-<text text-anchor="start" x="660.75" y="-458" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-446.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetCount</text>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node31 -->
-<g id="edge33_Node000028_Node000031" class="edge">
-<title>Node28&#45;&gt;Node31</title>
-<g id="a_edge33_Node000028_Node000031"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M568.78,-418.94C591.3,-424.96 617.59,-431.98 641.24,-438.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="640.23,-441.64 650.79,-440.84 642.04,-434.88 640.23,-441.64"/>
-</a>
-</g>
-</g>
-<!-- Node32 -->
-<g id="Node000032" class="node">
-<title>Node32</title>
-<g id="a_Node000032"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc" target="_top" xlink:title="Set item value at position of index.">
-<polygon fill="white" stroke="#666666" points="762.88,-422.5 656.12,-422.5 656.12,-392 762.88,-392 762.88,-422.5"/>
-<text text-anchor="start" x="664.12" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetItem</text>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node32 -->
-<g id="edge34_Node000028_Node000032" class="edge">
-<title>Node28&#45;&gt;Node32</title>
-<g id="a_edge34_Node000028_Node000032"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M568.78,-405.1C592.37,-405.46 620.09,-405.89 644.59,-406.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="644.39,-409.76 654.44,-406.42 644.5,-402.76 644.39,-409.76"/>
-</a>
-</g>
-</g>
-<!-- Node34&#45;&gt;Node25 -->
-<g id="edge37_Node000034_Node000025" class="edge">
-<title>Node34&#45;&gt;Node25</title>
-<g id="a_edge37_Node000034_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M576.17,-293.54C597.68,-288.13 621.81,-282.06 643.52,-276.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="644.31,-280.01 653.15,-274.18 642.6,-273.22 644.31,-280.01"/>
-</a>
-</g>
-</g>
-<!-- Node34&#45;&gt;Node27 -->
-<g id="edge38_Node000034_Node000027" class="edge">
-<title>Node34&#45;&gt;Node27</title>
-<g id="a_edge38_Node000034_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M585.16,-309.25C600.71,-309.25 617.21,-309.25 632.92,-309.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="632.67,-312.75 642.67,-309.25 632.67,-305.75 632.67,-312.75"/>
-</a>
-</g>
-</g>
-<!-- Node35&#45;&gt;Node25 -->
-<g id="edge40_Node000035_Node000025" class="edge">
-<title>Node35&#45;&gt;Node25</title>
-<g id="a_edge40_Node000035_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M588.49,-237.45C606.53,-240.88 625.66,-244.51 643.23,-247.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="642.55,-251.28 653.03,-249.71 643.86,-244.41 642.55,-251.28"/>
-</a>
-</g>
-</g>
-<!-- Node35&#45;&gt;Node33 -->
-<g id="edge41_Node000035_Node000033" class="edge">
-<title>Node35&#45;&gt;Node33</title>
-<g id="a_edge41_Node000035_Node000033"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M588.49,-218.64C601.9,-217.82 615.91,-216.96 629.44,-216.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="629.38,-219.63 639.15,-215.52 628.95,-212.64 629.38,-219.63"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg b/db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg
deleted file mode 100644
index d8f3a569a..000000000
--- a/db/dbc/tree__234_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg
+++ /dev/null
@@ -1,726 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="984pt" height="717pt"
- viewBox="0.00 0.00 983.75 716.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 712.5)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="simple test to insert a given array and delete some item, and print the tree">
-<polygon fill="#999999" stroke="#666666" points="37.75,-296.88 0,-296.88 0,-277.62 37.75,-277.62 37.75,-296.88"/>
-<text text-anchor="middle" x="18.88" y="-283.38" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e" target="_top" xlink:title="Insert item to tree.">
-<polygon fill="white" stroke="#666666" points="188.75,-446.5 79.75,-446.5 79.75,-416 188.75,-416 188.75,-446.5"/>
-<text text-anchor="start" x="87.75" y="-433" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="134.25" y="-421.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.67,-297.15C45.33,-319.59 88.86,-374.87 114.17,-407.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.21,-408.92 120.15,-414.61 116.71,-404.59 111.21,-408.92"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165" target="_top" xlink:title="Print tree into a dot file.">
-<polygon fill="white" stroke="#666666" points="187.25,-216.5 81.25,-216.5 81.25,-186 187.25,-186 187.25,-216.5"/>
-<text text-anchor="start" x="89.25" y="-203" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="134.25" y="-191.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Print</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge12_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge12_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.88,-277.38C50.06,-264.36 80.81,-241.03 103.76,-223.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.69,-226.55 111.55,-217.71 101.46,-220.97 105.69,-226.55"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11" target="_top" xlink:title="Remove item from tree.">
-<polygon fill="white" stroke="#666666" points="194.75,-302.5 73.75,-302.5 73.75,-272 194.75,-272 194.75,-302.5"/>
-<text text-anchor="start" x="81.75" y="-289" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="134.25" y="-277.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Remove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge17_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge17_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.09,-287.25C44.96,-287.25 53.25,-287.25 62.04,-287.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.86,-290.75 71.86,-287.25 61.86,-283.75 61.86,-290.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d" target="_top" xlink:title="A insert implementation of pre&#45;split.">
-<polygon fill="white" stroke="#666666" points="384,-547.5 240.5,-547.5 240.5,-517 384,-517 384,-547.5"/>
-<text text-anchor="start" x="248.5" y="-534" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="312.25" y="-522.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::InsertPreSplit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.36,-446.81C192.25,-463.96 240.51,-491.66 273.95,-510.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.09,-513.81 282.5,-515.75 275.57,-507.74 272.09,-513.81"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="562.75,-609.88 462.75,-609.88 462.75,-590.62 562.75,-590.62 562.75,-609.88"/>
-<text text-anchor="middle" x="512.75" y="-596.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr::get</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M346.32,-547.94C369.34,-558.42 400.94,-571.93 429.75,-581.25 436.67,-583.49 444.01,-585.58 451.33,-587.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="450.36,-590.85 460.91,-589.88 452.06,-584.06 450.36,-590.85"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" target="_top" xlink:title="Merge node to a not&#45;full target node.">
-<polygon fill="white" stroke="#666666" points="595.75,-572.5 429.75,-572.5 429.75,-542 595.75,-542 595.75,-572.5"/>
-<text text-anchor="start" x="437.75" y="-559" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="512.75" y="-547.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNodeNotFull</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M384.35,-541.2C395.28,-542.58 406.71,-544.02 418.04,-545.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="417.45,-548.9 427.81,-546.68 418.33,-541.96 417.45,-548.9"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" target="_top" xlink:title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node.">
-<polygon fill="white" stroke="#666666" points="576.25,-523.5 449.25,-523.5 449.25,-493 576.25,-493 576.25,-523.5"/>
-<text text-anchor="start" x="457.25" y="-510" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="512.75" y="-498.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::SplitNode</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node11 -->
-<g id="edge11_Node000003_Node000011" class="edge">
-<title>Node3&#45;&gt;Node11</title>
-<g id="a_edge11_Node000003_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M384.35,-523.65C401.69,-521.56 420.28,-519.31 437.75,-517.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="438.03,-520.69 447.54,-516.01 437.19,-513.74 438.03,-520.69"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" target="_top" xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="white" stroke="#666666" points="767.75,-658.5 651.25,-658.5 651.25,-628 767.75,-628 767.75,-658.5"/>
-<text text-anchor="start" x="659.25" y="-645" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-633.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M577.03,-572.89C583.51,-575.33 589.86,-578.11 595.75,-581.25 614.13,-591.05 613.94,-600.45 631.75,-611.25 638.71,-615.47 646.33,-619.38 653.97,-622.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="652.41,-626.05 662.97,-626.89 655.24,-619.65 652.41,-626.05"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="952.5,-610.5 846.5,-610.5 846.5,-580 952.5,-580 952.5,-610.5"/>
-<text text-anchor="start" x="854.5" y="-597" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="899.5" y="-585.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge9_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge9_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M595.14,-572.97C607.38,-574.97 619.87,-576.82 631.75,-578.25 700.85,-586.57 780.55,-590.98 834.71,-593.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="834.56,-596.7 844.69,-593.6 834.84,-589.7 834.56,-596.7"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="764.38,-569.5 654.62,-569.5 654.62,-539 764.38,-539 764.38,-569.5"/>
-<text text-anchor="start" x="662.62" y="-556" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-544.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge10_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge10_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M596.06,-555.98C611.69,-555.74 627.86,-555.49 642.89,-555.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="642.68,-558.76 652.63,-555.11 642.57,-551.77 642.68,-558.76"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="955.12,-659.5 843.88,-659.5 843.88,-629 955.12,-629 955.12,-659.5"/>
-<text text-anchor="start" x="851.88" y="-646" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="899.5" y="-634.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M768.18,-643.56C788.4,-643.66 811.27,-643.79 832.14,-643.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="831.97,-647.4 841.99,-643.95 832,-640.4 831.97,-647.4"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="975.75,-708.5 823.25,-708.5 823.25,-678 975.75,-678 975.75,-708.5"/>
-<text text-anchor="start" x="831.25" y="-695" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="899.5" y="-683.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M768.18,-658.59C787.13,-663.63 808.4,-669.29 828.18,-674.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="827.28,-677.93 837.84,-677.12 829.07,-671.16 827.28,-677.93"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge8_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge8_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M768.18,-628.52C789.32,-623.12 813.36,-616.99 834.98,-611.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="835.75,-614.88 844.58,-609.02 834.02,-608.1 835.75,-614.88"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="363.75,-167.88 260.75,-167.88 260.75,-148.62 363.75,-148.62 363.75,-167.88"/>
-<text text-anchor="middle" x="312.25" y="-154.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge13_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge13_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.26,-188.04C201.36,-184.49 216.63,-180.69 230.75,-177.25 239.28,-175.17 248.34,-173 257.17,-170.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.79,-174.35 266.72,-168.64 256.18,-167.54 257.79,-174.35"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="339,-130.88 285.5,-130.88 285.5,-111.62 339,-111.62 339,-130.88"/>
-<text text-anchor="middle" x="312.25" y="-117.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node14 -->
-<g id="edge14_Node000012_Node000014" class="edge">
-<title>Node12&#45;&gt;Node14</title>
-<g id="a_edge14_Node000012_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.57,-185.73C173.08,-171.61 202.32,-151.2 230.75,-139.25 244.36,-133.53 260.07,-129.49 273.98,-126.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="274.46,-130.19 283.66,-124.95 273.2,-123.3 274.46,-130.19"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="362.62,-253.88 261.88,-253.88 261.88,-234.62 362.62,-234.62 362.62,-253.88"/>
-<text text-anchor="middle" x="312.25" y="-240.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node15 -->
-<g id="edge15_Node000012_Node000015" class="edge">
-<title>Node12&#45;&gt;Node15</title>
-<g id="a_edge15_Node000012_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.26,-214.46C201.36,-218.01 216.63,-221.81 230.75,-225.25 239.28,-227.33 248.34,-229.5 257.17,-231.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="256.18,-234.96 266.72,-233.86 257.79,-228.15 256.18,-234.96"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be" target="_top" xlink:title="Print the tree to a dot file. You can convert it to picture with graphviz.">
-<polygon fill="white" stroke="#666666" points="376.12,-216.5 248.38,-216.5 248.38,-186 376.12,-186 376.12,-216.5"/>
-<text text-anchor="start" x="256.38" y="-203" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="312.25" y="-191.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::PrintNode</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node16 -->
-<g id="edge16_Node000012_Node000016" class="edge">
-<title>Node12&#45;&gt;Node16</title>
-<g id="a_edge16_Node000012_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.58,-201.25C202.97,-201.25 220.12,-201.25 236.63,-201.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.41,-204.75 246.41,-201.25 236.41,-197.75 236.41,-204.75"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4" target="_top" xlink:title="Main function implement the pre&#45;merge remove operation.">
-<polygon fill="white" stroke="#666666" points="393.75,-302.5 230.75,-302.5 230.75,-272 393.75,-272 393.75,-302.5"/>
-<text text-anchor="start" x="238.75" y="-289" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="312.25" y="-277.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::RemovePreMerge</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge18_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge18_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M194.84,-287.25C202.72,-287.25 210.95,-287.25 219.22,-287.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.99,-290.75 228.99,-287.25 218.99,-283.75 218.99,-290.75"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657" target="_top" xlink:title="Get the max item of the tree.">
-<polygon fill="white" stroke="#666666" points="591.62,-152.5 433.88,-152.5 433.88,-122 591.62,-122 591.62,-152.5"/>
-<text text-anchor="start" x="441.88" y="-139" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="512.75" y="-127.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node19 -->
-<g id="edge19_Node000018_Node000019" class="edge">
-<title>Node18&#45;&gt;Node19</title>
-<g id="a_edge19_Node000018_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M382.47,-271.61C386.53,-269.21 390.34,-266.44 393.75,-263.25 427.32,-231.82 396.98,-198.51 429.75,-166.25 432.58,-163.46 435.69,-160.94 439,-158.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="440.66,-161.75 447.47,-153.63 437.09,-155.73 440.66,-161.75"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36" target="_top" xlink:title="Get the min item of the tree.">
-<polygon fill="white" stroke="#666666" points="590.12,-79.5 435.38,-79.5 435.38,-49 590.12,-49 590.12,-79.5"/>
-<text text-anchor="start" x="443.38" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="512.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::GetTreeMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node22 -->
-<g id="edge22_Node000018_Node000022" class="edge">
-<title>Node18&#45;&gt;Node22</title>
-<g id="a_edge22_Node000018_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M383.66,-271.59C387.33,-269.19 390.74,-266.43 393.75,-263.25 440.9,-213.48 389.14,-168.49 429.75,-113.25 438.12,-101.86 450,-92.63 462.14,-85.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="463.49,-88.62 470.53,-80.71 460.09,-82.5 463.49,-88.62"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631" target="_top" xlink:title="Check if node is a 2&#45;node.">
-<polygon fill="white" stroke="#666666" points="764,-275.5 655,-275.5 655,-245 764,-245 764,-275.5"/>
-<text text-anchor="start" x="663" y="-262" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-250.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is2Node</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node25 -->
-<g id="edge25_Node000018_Node000025" class="edge">
-<title>Node18&#45;&gt;Node25</title>
-<g id="a_edge25_Node000018_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M394.19,-281.72C467.74,-276.7 574.88,-269.38 643.13,-264.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="643.33,-268.21 653.06,-264.04 642.85,-261.23 643.33,-268.21"/>
-</a>
-</g>
-</g>
-<!-- Node26 -->
-<g id="Node000026" class="node">
-<title>Node26</title>
-<g id="a_Node000026"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18" target="_top" xlink:title="Check if node is a 3&#45;node or 4&#45;node, this is useful when we delete item from 2&#45;3&#45;4 tree.">
-<polygon fill="white" stroke="#666666" points="569.88,-468.5 455.62,-468.5 455.62,-438 569.88,-438 569.88,-468.5"/>
-<text text-anchor="start" x="463.62" y="-455" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="512.75" y="-443.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Is34Node</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node26 -->
-<g id="edge26_Node000018_Node000026" class="edge">
-<title>Node18&#45;&gt;Node26</title>
-<g id="a_edge26_Node000018_Node000026"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M321.94,-302.94C338.86,-332.03 379.03,-394.43 429.75,-428.25 434.5,-431.42 439.68,-434.2 445.03,-436.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="443.52,-439.8 454.1,-440.34 446.17,-433.32 443.52,-439.8"/>
-</a>
-</g>
-</g>
-<!-- Node27 -->
-<g id="Node000027" class="node">
-<title>Node27</title>
-<g id="a_Node000027"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e" target="_top" xlink:title="Do the actual left rotate operation.">
-<polygon fill="white" stroke="#666666" points="774.5,-324.5 644.5,-324.5 644.5,-294 774.5,-294 774.5,-324.5"/>
-<text text-anchor="start" x="652.5" y="-311" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-299.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::LeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node27 -->
-<g id="edge27_Node000018_Node000027" class="edge">
-<title>Node18&#45;&gt;Node27</title>
-<g id="a_edge27_Node000018_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.45,-302.83C366.43,-313.77 399.2,-327.44 429.75,-333.25 502.23,-347.04 522.38,-340.97 595.75,-333.25 608.45,-331.91 621.82,-329.75 634.75,-327.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="635.36,-330.71 644.47,-325.3 633.98,-323.84 635.36,-330.71"/>
-</a>
-</g>
-</g>
-<!-- Node28 -->
-<g id="Node000028" class="node">
-<title>Node28</title>
-<g id="a_Node000028"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9" target="_top" xlink:title="Merge the item at index of the parent node, and its left and right child.">
-<polygon fill="white" stroke="#666666" points="568.38,-419.5 457.12,-419.5 457.12,-389 568.38,-389 568.38,-419.5"/>
-<text text-anchor="start" x="465.12" y="-406" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="512.75" y="-394.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Merge</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node28 -->
-<g id="edge28_Node000018_Node000028" class="edge">
-<title>Node18&#45;&gt;Node28</title>
-<g id="a_edge28_Node000018_Node000028"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M334.06,-302.88C356.87,-319.64 394.87,-346.51 429.75,-366.25 440.73,-372.46 452.9,-378.52 464.43,-383.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="462.86,-387.04 473.41,-388.02 465.77,-380.67 462.86,-387.04"/>
-</a>
-</g>
-</g>
-<!-- Node33 -->
-<g id="Node000033" class="node">
-<title>Node33</title>
-<g id="a_Node000033"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9" target="_top" xlink:title="Do the actual right rotate operation.">
-<polygon fill="white" stroke="#666666" points="777.88,-226.5 641.12,-226.5 641.12,-196 777.88,-196 777.88,-226.5"/>
-<text text-anchor="start" x="649.12" y="-213" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::RightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node33 -->
-<g id="edge35_Node000018_Node000033" class="edge">
-<title>Node18&#45;&gt;Node33</title>
-<g id="a_edge35_Node000018_Node000033"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.73,-271.6C385.36,-269.2 389.76,-266.44 393.75,-263.25 419.25,-242.88 401.58,-215.73 429.75,-199.25 498.49,-159.05 593.91,-175.43 653.38,-192.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="652.38,-195.65 662.96,-195.13 654.36,-188.94 652.38,-195.65"/>
-</a>
-</g>
-</g>
-<!-- Node34 -->
-<g id="Node000034" class="node">
-<title>Node34</title>
-<g id="a_Node000034"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9" target="_top" xlink:title="A handy function to try if we can do a left rotate to the target node.">
-<polygon fill="white" stroke="#666666" points="584.88,-324.5 440.62,-324.5 440.62,-294 584.88,-294 584.88,-324.5"/>
-<text text-anchor="start" x="448.62" y="-311" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="512.75" y="-299.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryLeftRotate</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node34 -->
-<g id="edge36_Node000018_Node000034" class="edge">
-<title>Node18&#45;&gt;Node34</title>
-<g id="a_edge36_Node000018_Node000034"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M393.99,-296.2C405.5,-297.47 417.36,-298.79 428.91,-300.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="428.5,-303.55 438.83,-301.17 429.27,-296.59 428.5,-303.55"/>
-</a>
-</g>
-</g>
-<!-- Node35 -->
-<g id="Node000035" class="node">
-<title>Node35</title>
-<g id="a_Node000035"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3" target="_top" xlink:title="A handy function to try if we can do a right rotate to the target node.">
-<polygon fill="white" stroke="#666666" points="588.25,-238.5 437.25,-238.5 437.25,-208 588.25,-208 588.25,-238.5"/>
-<text text-anchor="start" x="445.25" y="-225" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="512.75" y="-213.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::TryRightRotate</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node35 -->
-<g id="edge39_Node000018_Node000035" class="edge">
-<title>Node18&#45;&gt;Node35</title>
-<g id="a_edge39_Node000018_Node000035"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M367.03,-271.52C375.97,-268.82 385.13,-265.99 393.75,-263.25 414.18,-256.74 436.49,-249.28 456.15,-242.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.01,-245.97 465.34,-239.42 454.75,-239.35 457.01,-245.97"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57" target="_top" xlink:title="Get max item (rightmost) in the current node.">
-<polygon fill="white" stroke="#666666" points="772.62,-177.5 646.38,-177.5 646.38,-147 772.62,-147 772.62,-177.5"/>
-<text text-anchor="start" x="654.38" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMaxItem</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge20_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge20_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M592.12,-147.31C606.3,-149.13 621.04,-151.02 635.07,-152.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="634.28,-156.25 644.64,-154.05 635.17,-149.31 634.28,-156.25"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94" target="_top" xlink:title="Get rightmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="787.25,-128.5 631.75,-128.5 631.75,-98 787.25,-98 787.25,-128.5"/>
-<text text-anchor="start" x="639.75" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetRightmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node21 -->
-<g id="edge21_Node000019_Node000021" class="edge">
-<title>Node19&#45;&gt;Node21</title>
-<g id="a_edge21_Node000019_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M592.12,-127.59C601.36,-126.45 610.84,-125.28 620.21,-124.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="620.56,-127.61 630.05,-122.92 619.7,-120.67 620.56,-127.61"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e" target="_top" xlink:title="Get leftmose child of the current node.">
-<polygon fill="white" stroke="#666666" points="783.88,-79.5 635.12,-79.5 635.12,-49 783.88,-49 783.88,-79.5"/>
-<text text-anchor="start" x="643.12" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetLeftmostChild</text>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node23 -->
-<g id="edge23_Node000022_Node000023" class="edge">
-<title>Node22&#45;&gt;Node23</title>
-<g id="a_edge23_Node000022_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M590.44,-64.25C601.26,-64.25 612.44,-64.25 623.41,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="623.23,-67.75 633.23,-64.25 623.23,-60.75 623.23,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71" target="_top" xlink:title="get min item (leftmost) in the current node">
-<polygon fill="white" stroke="#666666" points="771.12,-30.5 647.88,-30.5 647.88,0 771.12,0 771.12,-30.5"/>
-<text text-anchor="start" x="655.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetMinItem</text>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node24 -->
-<g id="edge24_Node000022_Node000024" class="edge">
-<title>Node22&#45;&gt;Node24</title>
-<g id="a_edge24_Node000022_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M576.17,-48.54C595.33,-43.72 616.56,-38.38 636.31,-33.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="637.12,-36.82 645.96,-30.99 635.41,-30.03 637.12,-36.82"/>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node10 -->
-<g id="edge32_Node000028_Node000010" class="edge">
-<title>Node28&#45;&gt;Node10</title>
-<g id="a_edge32_Node000028_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M568.76,-413.29C578.65,-416.94 588.2,-422.07 595.75,-429.25 629.97,-461.81 597.84,-496.36 631.75,-529.25 635.41,-532.8 639.59,-535.85 644.06,-538.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="642.35,-541.53 652.86,-542.85 645.47,-535.26 642.35,-541.53"/>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node25 -->
-<g id="edge31_Node000028_Node000025" class="edge">
-<title>Node28&#45;&gt;Node25</title>
-<g id="a_edge31_Node000028_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M534.03,-388.71C551.32,-375.01 576.36,-354.05 595.75,-333.25 613.93,-313.74 610.06,-300.77 631.75,-285.25 635.77,-282.37 640.14,-279.82 644.68,-277.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="645.76,-280.9 653.46,-273.63 642.91,-274.5 645.76,-280.9"/>
-</a>
-</g>
-</g>
-<!-- Node29 -->
-<g id="Node000029" class="node">
-<title>Node29</title>
-<g id="a_Node000029"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4" target="_top" xlink:title="Get the child pointer at position of index.">
-<polygon fill="white" stroke="#666666" points="764.75,-373.5 654.25,-373.5 654.25,-343 764.75,-343 764.75,-373.5"/>
-<text text-anchor="start" x="662.25" y="-360" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-348.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetChild</text>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node29 -->
-<g id="edge29_Node000028_Node000029" class="edge">
-<title>Node28&#45;&gt;Node29</title>
-<g id="a_edge29_Node000028_Node000029"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M568.78,-391.25C591.79,-385.82 618.72,-379.46 642.77,-373.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="643.55,-377.19 652.47,-371.48 641.94,-370.38 643.55,-377.19"/>
-</a>
-</g>
-</g>
-<!-- Node30 -->
-<g id="Node000030" class="node">
-<title>Node30</title>
-<g id="a_Node000030"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3" target="_top" xlink:title="Get item of the \index index.">
-<polygon fill="white" stroke="#666666" points="763.25,-520.5 655.75,-520.5 655.75,-490 763.25,-490 763.25,-520.5"/>
-<text text-anchor="start" x="663.75" y="-507" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-495.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::GetItem</text>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node30 -->
-<g id="edge30_Node000028_Node000030" class="edge">
-<title>Node28&#45;&gt;Node30</title>
-<g id="a_edge30_Node000028_Node000030"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M568.63,-415.46C578.2,-418.91 587.67,-423.41 595.75,-429.25 618.23,-445.51 609.42,-463.78 631.75,-480.25 635.86,-483.28 640.35,-485.95 645.03,-488.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="643.58,-491.49 654.14,-492.37 646.43,-485.1 643.58,-491.49"/>
-</a>
-</g>
-</g>
-<!-- Node31 -->
-<g id="Node000031" class="node">
-<title>Node31</title>
-<g id="a_Node000031"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1" target="_top" xlink:title="Set the item count of the node.">
-<polygon fill="white" stroke="#666666" points="766.25,-471.5 652.75,-471.5 652.75,-441 766.25,-441 766.25,-471.5"/>
-<text text-anchor="start" x="660.75" y="-458" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-446.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetCount</text>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node31 -->
-<g id="edge33_Node000028_Node000031" class="edge">
-<title>Node28&#45;&gt;Node31</title>
-<g id="a_edge33_Node000028_Node000031"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M568.78,-418.94C591.3,-424.96 617.59,-431.98 641.24,-438.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="640.23,-441.64 650.79,-440.84 642.04,-434.88 640.23,-441.64"/>
-</a>
-</g>
-</g>
-<!-- Node32 -->
-<g id="Node000032" class="node">
-<title>Node32</title>
-<g id="a_Node000032"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc" target="_top" xlink:title="Set item value at position of index.">
-<polygon fill="white" stroke="#666666" points="762.88,-422.5 656.12,-422.5 656.12,-392 762.88,-392 762.88,-422.5"/>
-<text text-anchor="start" x="664.12" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="709.5" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetItem</text>
-</a>
-</g>
-</g>
-<!-- Node28&#45;&gt;Node32 -->
-<g id="edge34_Node000028_Node000032" class="edge">
-<title>Node28&#45;&gt;Node32</title>
-<g id="a_edge34_Node000028_Node000032"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M568.78,-405.1C592.37,-405.46 620.09,-405.89 644.59,-406.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="644.39,-409.76 654.44,-406.42 644.5,-402.76 644.39,-409.76"/>
-</a>
-</g>
-</g>
-<!-- Node34&#45;&gt;Node25 -->
-<g id="edge37_Node000034_Node000025" class="edge">
-<title>Node34&#45;&gt;Node25</title>
-<g id="a_edge37_Node000034_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M576.17,-293.54C597.68,-288.13 621.81,-282.06 643.52,-276.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="644.31,-280.01 653.15,-274.18 642.6,-273.22 644.31,-280.01"/>
-</a>
-</g>
-</g>
-<!-- Node34&#45;&gt;Node27 -->
-<g id="edge38_Node000034_Node000027" class="edge">
-<title>Node34&#45;&gt;Node27</title>
-<g id="a_edge38_Node000034_Node000027"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M585.16,-309.25C600.71,-309.25 617.21,-309.25 632.92,-309.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="632.67,-312.75 642.67,-309.25 632.67,-305.75 632.67,-312.75"/>
-</a>
-</g>
-</g>
-<!-- Node35&#45;&gt;Node25 -->
-<g id="edge40_Node000035_Node000025" class="edge">
-<title>Node35&#45;&gt;Node25</title>
-<g id="a_edge40_Node000035_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M588.49,-237.45C606.53,-240.88 625.66,-244.51 643.23,-247.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="642.55,-251.28 653.03,-249.71 643.86,-244.41 642.55,-251.28"/>
-</a>
-</g>
-</g>
-<!-- Node35&#45;&gt;Node33 -->
-<g id="edge41_Node000035_Node000033" class="edge">
-<title>Node35&#45;&gt;Node33</title>
-<g id="a_edge41_Node000035_Node000033"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M588.49,-218.64C601.9,-217.82 615.91,-216.96 629.44,-216.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="629.38,-219.63 639.15,-215.52 628.95,-212.64 629.38,-219.63"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.map b/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.map
deleted file mode 100644
index 9a666ede3..000000000
--- a/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.map
+++ /dev/null
@@ -1,40 +0,0 @@
-<map id="test2" name="test2">
-<area shape="rect" id="Node000001" title="simple test to insert continuous number of range [0, n), and print the tree" alt="" coords="5,270,56,296"/>
-<area shape="rect" id="Node000002" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e" title="Insert item to tree." alt="" coords="113,160,258,201"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="44,268,102,219,124,206,127,211,105,224,47,272"/>
-<area shape="rect" id="Node000012" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165" title="Print tree into a dot file." alt="" coords="115,233,256,274"/>
-<area shape="poly" id="edge12_Node000001_Node000012" title=" " alt="" coords="56,276,99,267,100,273,57,281"/>
-<area shape="rect" id="Node000017" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/to_string.html#" title=" " alt="" coords="137,298,234,324"/>
-<area shape="poly" id="edge17_Node000001_Node000017" title=" " alt="" coords="57,285,122,297,121,302,56,290"/>
-<area shape="rect" id="Node000018" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd" title="In&#45;order traverse." alt="" coords="104,372,267,413"/>
-<area shape="poly" id="edge18_Node000001_Node000018" title=" " alt="" coords="51,294,105,334,143,361,140,365,102,338,48,298"/>
-<area shape="rect" id="Node000003" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d" title="A insert implementation of pre&#45;split." alt="" coords="315,133,506,174"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="258,169,299,164,300,169,259,174"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/unique_ptr/get.html#" title=" " alt="" coords="598,84,732,109"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="503,130,589,111,590,116,505,135"/>
-<area shape="rect" id="Node000005" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" title="Merge node to a not&#45;full target node." alt="" coords="554,133,776,174"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="507,151,539,151,539,156,507,156"/>
-<area shape="rect" id="Node000011" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node." alt="" coords="580,199,750,239"/>
-<area shape="poly" id="edge11_Node000003_Node000011" title=" " alt="" coords="493,172,569,192,568,197,492,177"/>
-<area shape="rect" id="Node000006" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" title="Insert item to the proper position of the node and return the position index." alt="" coords="824,72,979,113"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="745,130,808,114,809,119,747,135"/>
-<area shape="rect" id="Node000009" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" title="Check if node is a full (4&#45;node)" alt="" coords="1058,136,1199,177"/>
-<area shape="poly" id="edge9_Node000005_Node000009" title=" " alt="" coords="776,152,1042,153,1042,159,776,157"/>
-<area shape="rect" id="Node000010" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" title="Set child pointer to the position of index." alt="" coords="828,191,974,231"/>
-<area shape="poly" id="edge10_Node000005_Node000010" title=" " alt="" coords="752,172,814,187,813,192,751,177"/>
-<area shape="rect" id="Node000007" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" title="Check if item is in the node." alt="" coords="1054,5,1203,46"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="972,69,1041,48,1043,54,974,74"/>
-<area shape="rect" id="Node000008" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" title="Insert a value to the index position." alt="" coords="1027,71,1230,111"/>
-<area shape="poly" id="edge7_Node000006_Node000008" title=" " alt="" coords="979,89,1011,89,1011,94,979,95"/>
-<area shape="poly" id="edge8_Node000006_Node000009" title=" " alt="" coords="977,111,1044,130,1042,135,976,116"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="342,198,479,224"/>
-<area shape="poly" id="edge13_Node000012_Node000013" title=" " alt="" coords="256,238,326,224,327,229,257,243"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="375,368,446,393"/>
-<area shape="poly" id="edge14_Node000012_Node000014" title=" " alt="" coords="250,272,269,284,285,300,293,317,301,332,317,348,338,360,361,368,359,373,336,364,313,352,297,336,288,319,280,303,265,288,248,277"/>
-<area shape="rect" id="Node000015" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="344,248,478,273"/>
-<area shape="poly" id="edge15_Node000012_Node000015" title=" " alt="" coords="257,253,328,255,328,261,256,258"/>
-<area shape="rect" id="Node000016" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be" title="Print the tree to a dot file. You can convert it to picture with graphviz." alt="" coords="326,297,496,338"/>
-<area shape="poly" id="edge16_Node000012_Node000016" title=" " alt="" coords="257,271,322,290,321,295,256,276"/>
-<area shape="poly" id="edge19_Node000018_Node000014" title=" " alt="" coords="267,385,359,380,359,386,267,391"/>
-<area shape="poly" id="edge20_Node000018_Node000018" title=" " alt="" coords="155,372,154,362,159,353,169,347,185,345,203,348,213,354,210,359,201,353,185,351,171,352,162,357,159,363,161,371"/>
-</map>
diff --git a/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.md5 b/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.md5
deleted file mode 100644
index 0cd947ff0..000000000
--- a/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fcb93fa38292e69d097b5fdfd7987bb8
\ No newline at end of file
diff --git a/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.svg b/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.svg
deleted file mode 100644
index 84093d829..000000000
--- a/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.svg
+++ /dev/null
@@ -1,449 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<!--zoomable 314 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 927;
-var viewHeight = 314;
-var sectionId = 'dynsection-3';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="simple test to insert continuous number of range [0, n), and print the tree">
-<polygon fill="#999999" stroke="#666666" points="37.75,-106.88 0,-106.88 0,-87.62 37.75,-87.62 37.75,-106.88"/>
-<text text-anchor="middle" x="18.88" y="-93.38" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e" target="_top" xlink:title="Insert item to tree.">
-<polygon fill="white" stroke="#666666" points="189.5,-189.5 80.5,-189.5 80.5,-159 189.5,-159 189.5,-189.5"/>
-<text text-anchor="start" x="88.5" y="-176" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="135" y="-164.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.03,-107.18C40.45,-117.06 57.41,-132.29 73.75,-143.25 78.88,-146.69 84.44,-150.02 90.03,-153.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.27,-156.17 98.73,-157.81 91.57,-150 88.27,-156.17"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165" target="_top" xlink:title="Print tree into a dot file.">
-<polygon fill="white" stroke="#666666" points="188,-134.5 82,-134.5 82,-104 188,-104 188,-134.5"/>
-<text text-anchor="start" x="90" y="-121" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="135" y="-109.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Print</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge12_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge12_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.21,-100.78C47.28,-102.53 58.82,-104.76 70.73,-107.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.73,-110.43 80.22,-108.88 71.06,-103.55 69.73,-110.43"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="171.5,-85.88 98.5,-85.88 98.5,-66.62 171.5,-66.62 171.5,-85.88"/>
-<text text-anchor="middle" x="135" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::to_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge17_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge17_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.21,-93.88C51.44,-91.44 69.93,-88.04 87.15,-84.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.51,-88.36 96.71,-83.11 86.25,-81.48 87.51,-88.36"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd" target="_top" xlink:title="In&#45;order traverse.">
-<polygon fill="white" stroke="#666666" points="196.25,-30.5 73.75,-30.5 73.75,0 196.25,0 196.25,-30.5"/>
-<text text-anchor="start" x="81.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="135" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Traverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node18 -->
-<g id="edge18_Node000001_Node000018" class="edge">
-<title>Node1&#45;&gt;Node18</title>
-<g id="a_edge18_Node000001_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.08,-87.28C43.94,-79.12 59.76,-67.32 73.75,-57.25 82.89,-50.67 92.9,-43.63 102.08,-37.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.82,-40.29 110.04,-31.71 99.83,-34.54 103.82,-40.29"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d" target="_top" xlink:title="A insert implementation of pre&#45;split.">
-<polygon fill="white" stroke="#666666" points="375.75,-209.5 232.25,-209.5 232.25,-179 375.75,-179 375.75,-209.5"/>
-<text text-anchor="start" x="240.25" y="-196" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="304" y="-184.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::InsertPreSplit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.76,-180.69C199.63,-181.87 210.14,-183.13 220.63,-184.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.12,-187.85 230.47,-185.56 220.96,-180.9 220.12,-187.85"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="544.75,-246.88 444.75,-246.88 444.75,-227.62 544.75,-227.62 544.75,-246.88"/>
-<text text-anchor="middle" x="494.75" y="-233.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr::get</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M373.94,-209.96C395.08,-214.77 418.06,-220.01 438.19,-224.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="437.35,-227.99 447.88,-226.8 438.91,-221.17 437.35,-227.99"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" target="_top" xlink:title="Merge node to a not&#45;full target node.">
-<polygon fill="white" stroke="#666666" points="577.75,-209.5 411.75,-209.5 411.75,-179 577.75,-179 577.75,-209.5"/>
-<text text-anchor="start" x="419.75" y="-196" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="494.75" y="-184.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNodeNotFull</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M376.09,-194.25C383.9,-194.25 391.94,-194.25 399.98,-194.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.79,-197.75 409.79,-194.25 399.79,-190.75 399.79,-197.75"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" target="_top" xlink:title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node.">
-<polygon fill="white" stroke="#666666" points="558.25,-160.5 431.25,-160.5 431.25,-130 558.25,-130 558.25,-160.5"/>
-<text text-anchor="start" x="439.25" y="-147" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="494.75" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::SplitNode</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node11 -->
-<g id="edge11_Node000003_Node000011" class="edge">
-<title>Node3&#45;&gt;Node11</title>
-<g id="a_edge11_Node000003_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M365.5,-178.54C383.53,-173.86 403.47,-168.69 422.14,-163.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423,-167.23 431.8,-161.33 421.24,-160.46 423,-167.23"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" target="_top" xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="white" stroke="#666666" points="730.25,-255.5 613.75,-255.5 613.75,-225 730.25,-225 730.25,-255.5"/>
-<text text-anchor="start" x="621.75" y="-242" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="672" y="-230.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M555.57,-209.95C570.65,-213.91 586.96,-218.19 602.43,-222.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="601.5,-225.62 612.06,-224.78 603.27,-218.85 601.5,-225.62"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="895.5,-207.5 789.5,-207.5 789.5,-177 895.5,-177 895.5,-207.5"/>
-<text text-anchor="start" x="797.5" y="-194" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="842.5" y="-182.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge9_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge9_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M578.13,-193.77C639.32,-193.42 721.59,-192.94 777.8,-192.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="777.54,-196.12 787.52,-192.56 777.5,-189.12 777.54,-196.12"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="726.88,-166.5 617.12,-166.5 617.12,-136 726.88,-136 726.88,-166.5"/>
-<text text-anchor="start" x="625.12" y="-153" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="672" y="-141.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge10_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge10_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M559.52,-178.6C574.64,-174.89 590.78,-170.93 605.96,-167.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="606.46,-170.69 615.34,-164.91 604.79,-163.89 606.46,-170.69"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="898.12,-305.5 786.88,-305.5 786.88,-275 898.12,-275 898.12,-305.5"/>
-<text text-anchor="start" x="794.88" y="-292" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="842.5" y="-280.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M725.85,-255.93C742.24,-260.8 760.48,-266.21 777.54,-271.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="776.51,-274.62 787.09,-274.11 778.5,-267.91 776.51,-274.62"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="918.75,-256.5 766.25,-256.5 766.25,-226 918.75,-226 918.75,-256.5"/>
-<text text-anchor="start" x="774.25" y="-243" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="842.5" y="-231.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M730.52,-240.59C738.23,-240.64 746.27,-240.68 754.35,-240.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="754.23,-244.23 764.26,-240.79 754.28,-237.23 754.23,-244.23"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge8_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge8_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M728.17,-224.53C744.23,-219.96 761.9,-214.92 778.41,-210.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="778.95,-213.71 787.61,-207.6 777.03,-206.98 778.95,-213.71"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="355.5,-160.88 252.5,-160.88 252.5,-141.62 355.5,-141.62 355.5,-160.88"/>
-<text text-anchor="middle" x="304" y="-147.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge13_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge13_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.38,-129.29C205.1,-132.49 223.75,-136.06 241.07,-139.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="240.27,-142.79 250.75,-141.24 241.58,-135.92 240.27,-142.79"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="330.75,-33.88 277.25,-33.88 277.25,-14.62 330.75,-14.62 330.75,-33.88"/>
-<text text-anchor="middle" x="304" y="-20.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node14 -->
-<g id="edge14_Node000012_Node000014" class="edge">
-<title>Node12&#45;&gt;Node14</title>
-<g id="a_edge14_Node000012_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.81,-103.65C187.56,-101.19 192.14,-98.4 196.25,-95.25 217.43,-79.04 210.56,-62.76 232.25,-47.25 242.28,-40.08 254.67,-35.05 266.27,-31.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.82,-35.05 275.57,-29.09 265.01,-28.29 266.82,-35.05"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="354.38,-123.88 253.62,-123.88 253.62,-104.62 354.38,-104.62 354.38,-123.88"/>
-<text text-anchor="middle" x="304" y="-110.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node15 -->
-<g id="edge15_Node000012_Node000015" class="edge">
-<title>Node12&#45;&gt;Node15</title>
-<g id="a_edge15_Node000012_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.38,-117.68C205.41,-117.17 224.45,-116.6 242.05,-116.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="241.97,-119.58 251.86,-115.78 241.76,-112.58 241.97,-119.58"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be" target="_top" xlink:title="Print the tree to a dot file. You can convert it to picture with graphviz.">
-<polygon fill="white" stroke="#666666" points="367.88,-86.5 240.12,-86.5 240.12,-56 367.88,-56 367.88,-86.5"/>
-<text text-anchor="start" x="248.12" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="304" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::PrintNode</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node16 -->
-<g id="edge16_Node000012_Node000016" class="edge">
-<title>Node12&#45;&gt;Node16</title>
-<g id="a_edge16_Node000012_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.38,-104.19C203.85,-99.75 220.98,-94.83 237.17,-90.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.11,-93.54 246.75,-87.42 236.18,-86.82 238.11,-93.54"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node14 -->
-<g id="edge19_Node000018_Node000014" class="edge">
-<title>Node18&#45;&gt;Node14</title>
-<g id="a_edge19_Node000018_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M196.29,-18.5C219.41,-19.75 245.1,-21.13 265.49,-22.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.13,-25.71 275.3,-22.76 265.51,-18.72 265.13,-25.71"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node18 -->
-<g id="edge20_Node000018_Node000018" class="edge">
-<title>Node18&#45;&gt;Node18</title>
-<g id="a_edge20_Node000018_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.42,-30.99C110.22,-40.06 117.08,-48.5 135,-48.5 144.8,-48.5 151.29,-45.97 154.47,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.93,-42.79 155.43,-32.49 150.97,-42.1 157.93,-42.79"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph_org.svg b/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph_org.svg
deleted file mode 100644
index 053daa720..000000000
--- a/db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph_org.svg
+++ /dev/null
@@ -1,366 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="927pt" height="314pt"
- viewBox="0.00 0.00 926.75 313.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 309.5)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="simple test to insert continuous number of range [0, n), and print the tree">
-<polygon fill="#999999" stroke="#666666" points="37.75,-106.88 0,-106.88 0,-87.62 37.75,-87.62 37.75,-106.88"/>
-<text text-anchor="middle" x="18.88" y="-93.38" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e" target="_top" xlink:title="Insert item to tree.">
-<polygon fill="white" stroke="#666666" points="189.5,-189.5 80.5,-189.5 80.5,-159 189.5,-159 189.5,-189.5"/>
-<text text-anchor="start" x="88.5" y="-176" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="135" y="-164.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.03,-107.18C40.45,-117.06 57.41,-132.29 73.75,-143.25 78.88,-146.69 84.44,-150.02 90.03,-153.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.27,-156.17 98.73,-157.81 91.57,-150 88.27,-156.17"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165" target="_top" xlink:title="Print tree into a dot file.">
-<polygon fill="white" stroke="#666666" points="188,-134.5 82,-134.5 82,-104 188,-104 188,-134.5"/>
-<text text-anchor="start" x="90" y="-121" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="135" y="-109.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Print</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge12_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge12_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.21,-100.78C47.28,-102.53 58.82,-104.76 70.73,-107.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.73,-110.43 80.22,-108.88 71.06,-103.55 69.73,-110.43"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="171.5,-85.88 98.5,-85.88 98.5,-66.62 171.5,-66.62 171.5,-85.88"/>
-<text text-anchor="middle" x="135" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::to_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node17 -->
-<g id="edge17_Node000001_Node000017" class="edge">
-<title>Node1&#45;&gt;Node17</title>
-<g id="a_edge17_Node000001_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.21,-93.88C51.44,-91.44 69.93,-88.04 87.15,-84.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.51,-88.36 96.71,-83.11 86.25,-81.48 87.51,-88.36"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd" target="_top" xlink:title="In&#45;order traverse.">
-<polygon fill="white" stroke="#666666" points="196.25,-30.5 73.75,-30.5 73.75,0 196.25,0 196.25,-30.5"/>
-<text text-anchor="start" x="81.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="135" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::Traverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node18 -->
-<g id="edge18_Node000001_Node000018" class="edge">
-<title>Node1&#45;&gt;Node18</title>
-<g id="a_edge18_Node000001_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.08,-87.28C43.94,-79.12 59.76,-67.32 73.75,-57.25 82.89,-50.67 92.9,-43.63 102.08,-37.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.82,-40.29 110.04,-31.71 99.83,-34.54 103.82,-40.29"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d" target="_top" xlink:title="A insert implementation of pre&#45;split.">
-<polygon fill="white" stroke="#666666" points="375.75,-209.5 232.25,-209.5 232.25,-179 375.75,-179 375.75,-209.5"/>
-<text text-anchor="start" x="240.25" y="-196" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="304" y="-184.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::InsertPreSplit</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.76,-180.69C199.63,-181.87 210.14,-183.13 220.63,-184.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.12,-187.85 230.47,-185.56 220.96,-180.9 220.12,-187.85"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="544.75,-246.88 444.75,-246.88 444.75,-227.62 544.75,-227.62 544.75,-246.88"/>
-<text text-anchor="middle" x="494.75" y="-233.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr::get</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M373.94,-209.96C395.08,-214.77 418.06,-220.01 438.19,-224.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="437.35,-227.99 447.88,-226.8 438.91,-221.17 437.35,-227.99"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95" target="_top" xlink:title="Merge node to a not&#45;full target node.">
-<polygon fill="white" stroke="#666666" points="577.75,-209.5 411.75,-209.5 411.75,-179 577.75,-179 577.75,-209.5"/>
-<text text-anchor="start" x="419.75" y="-196" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="494.75" y="-184.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::MergeNodeNotFull</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M376.09,-194.25C383.9,-194.25 391.94,-194.25 399.98,-194.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.79,-197.75 409.79,-194.25 399.79,-190.75 399.79,-197.75"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9" target="_top" xlink:title="Split a 4&#45;node to 1 parent and 2 children, and return the parent node.">
-<polygon fill="white" stroke="#666666" points="558.25,-160.5 431.25,-160.5 431.25,-130 558.25,-130 558.25,-160.5"/>
-<text text-anchor="start" x="439.25" y="-147" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="494.75" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::SplitNode</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node11 -->
-<g id="edge11_Node000003_Node000011" class="edge">
-<title>Node3&#45;&gt;Node11</title>
-<g id="a_edge11_Node000003_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M365.5,-178.54C383.53,-173.86 403.47,-168.69 422.14,-163.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423,-167.23 431.8,-161.33 421.24,-160.46 423,-167.23"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb" target="_top" xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="white" stroke="#666666" points="730.25,-255.5 613.75,-255.5 613.75,-225 730.25,-225 730.25,-255.5"/>
-<text text-anchor="start" x="621.75" y="-242" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="672" y="-230.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M555.57,-209.95C570.65,-213.91 586.96,-218.19 602.43,-222.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="601.5,-225.62 612.06,-224.78 603.27,-218.85 601.5,-225.62"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="895.5,-207.5 789.5,-207.5 789.5,-177 895.5,-177 895.5,-207.5"/>
-<text text-anchor="start" x="797.5" y="-194" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="842.5" y="-182.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge9_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge9_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M578.13,-193.77C639.32,-193.42 721.59,-192.94 777.8,-192.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="777.54,-196.12 787.52,-192.56 777.5,-189.12 777.54,-196.12"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74" target="_top" xlink:title="Set child pointer to the position of index.">
-<polygon fill="white" stroke="#666666" points="726.88,-166.5 617.12,-166.5 617.12,-136 726.88,-136 726.88,-166.5"/>
-<text text-anchor="start" x="625.12" y="-153" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="672" y="-141.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::SetChild</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node10 -->
-<g id="edge10_Node000005_Node000010" class="edge">
-<title>Node5&#45;&gt;Node10</title>
-<g id="a_edge10_Node000005_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M559.52,-178.6C574.64,-174.89 590.78,-170.93 605.96,-167.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="606.46,-170.69 615.34,-164.91 604.79,-163.89 606.46,-170.69"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="898.12,-305.5 786.88,-305.5 786.88,-275 898.12,-275 898.12,-305.5"/>
-<text text-anchor="start" x="794.88" y="-292" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="842.5" y="-280.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M725.85,-255.93C742.24,-260.8 760.48,-266.21 777.54,-271.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="776.51,-274.62 787.09,-274.11 778.5,-267.91 776.51,-274.62"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="918.75,-256.5 766.25,-256.5 766.25,-226 918.75,-226 918.75,-256.5"/>
-<text text-anchor="start" x="774.25" y="-243" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="842.5" y="-231.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M730.52,-240.59C738.23,-240.64 746.27,-240.68 754.35,-240.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="754.23,-244.23 764.26,-240.79 754.28,-237.23 754.23,-244.23"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge8_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge8_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M728.17,-224.53C744.23,-219.96 761.9,-214.92 778.41,-210.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="778.95,-213.71 787.61,-207.6 777.03,-206.98 778.95,-213.71"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="355.5,-160.88 252.5,-160.88 252.5,-141.62 355.5,-141.62 355.5,-160.88"/>
-<text text-anchor="middle" x="304" y="-147.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge13_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge13_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.38,-129.29C205.1,-132.49 223.75,-136.06 241.07,-139.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="240.27,-142.79 250.75,-141.24 241.58,-135.92 240.27,-142.79"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="330.75,-33.88 277.25,-33.88 277.25,-14.62 330.75,-14.62 330.75,-33.88"/>
-<text text-anchor="middle" x="304" y="-20.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node14 -->
-<g id="edge14_Node000012_Node000014" class="edge">
-<title>Node12&#45;&gt;Node14</title>
-<g id="a_edge14_Node000012_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.81,-103.65C187.56,-101.19 192.14,-98.4 196.25,-95.25 217.43,-79.04 210.56,-62.76 232.25,-47.25 242.28,-40.08 254.67,-35.05 266.27,-31.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="266.82,-35.05 275.57,-29.09 265.01,-28.29 266.82,-35.05"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="354.38,-123.88 253.62,-123.88 253.62,-104.62 354.38,-104.62 354.38,-123.88"/>
-<text text-anchor="middle" x="304" y="-110.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node15 -->
-<g id="edge15_Node000012_Node000015" class="edge">
-<title>Node12&#45;&gt;Node15</title>
-<g id="a_edge15_Node000012_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.38,-117.68C205.41,-117.17 224.45,-116.6 242.05,-116.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="241.97,-119.58 251.86,-115.78 241.76,-112.58 241.97,-119.58"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be" target="_top" xlink:title="Print the tree to a dot file. You can convert it to picture with graphviz.">
-<polygon fill="white" stroke="#666666" points="367.88,-86.5 240.12,-86.5 240.12,-56 367.88,-56 367.88,-86.5"/>
-<text text-anchor="start" x="248.12" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="304" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234::PrintNode</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node16 -->
-<g id="edge16_Node000012_Node000016" class="edge">
-<title>Node12&#45;&gt;Node16</title>
-<g id="a_edge16_Node000012_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.38,-104.19C203.85,-99.75 220.98,-94.83 237.17,-90.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.11,-93.54 246.75,-87.42 236.18,-86.82 238.11,-93.54"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node14 -->
-<g id="edge19_Node000018_Node000014" class="edge">
-<title>Node18&#45;&gt;Node14</title>
-<g id="a_edge19_Node000018_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M196.29,-18.5C219.41,-19.75 245.1,-21.13 265.49,-22.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.13,-25.71 275.3,-22.76 265.51,-18.72 265.13,-25.71"/>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node18 -->
-<g id="edge20_Node000018_Node000018" class="edge">
-<title>Node18&#45;&gt;Node18</title>
-<g id="a_edge20_Node000018_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.42,-30.99C110.22,-40.06 117.08,-48.5 135,-48.5 144.8,-48.5 151.29,-45.97 154.47,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.93,-42.79 155.43,-32.49 150.97,-42.1 157.93,-42.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/dbc/tree__234_8cpp_source.html b/db/dbc/tree__234_8cpp_source.html
new file mode 100644
index 000000000..bdf9816ba
--- /dev/null
+++ b/db/dbc/tree__234_8cpp_source.html
@@ -0,0 +1,1077 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/tree_234.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/dbc/tree__234_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">tree_234.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../db/dbc/tree__234_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;array&gt;</span>     </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;fstream&gt;</span>   </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;memory&gt;</span>    </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;queue&gt;</span>     </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;string&gt;</span>    </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d3c/namespacedata__structures.html">data_structures</a> {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/dab/namespacetree__234.html">tree_234</a> {</div>
+<div class="foldopen" id="foldopen00035" data-start="{" data-end="};">
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">   35</a></span><span class="keyword">class </span><a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00041" data-start="{" data-end="}">
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5219979ea9a8baa3a273a9ec0f0c670">   41</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5219979ea9a8baa3a273a9ec0f0c670">Node</a>(int64_t item)</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        : <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a>(1),</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>          <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9">items</a>({{item, 0, 0}}),</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>          <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>({{<span class="keyword">nullptr</span>, <span class="keyword">nullptr</span>, <span class="keyword">nullptr</span>, <span class="keyword">nullptr</span>}}) {}</div>
+</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06">   50</a></span>    int8_t <a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06">GetCount</a>() { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a>; }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1">   61</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1">SetCount</a>(int8_t c) { <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a> = c; }</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8">   67</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8">IsLeaf</a>() { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[0] == <span class="keyword">nullptr</span>; }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd">   73</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd">IsFull</a>() { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a> == 3; }</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631">   79</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631">Is2Node</a>() { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a> == 1; }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18">   85</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18">Is34Node</a>() { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a> == 2 || <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a> == 3; }</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="foldopen" id="foldopen00092" data-start="{" data-end="}">
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f">   92</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f">Contains</a>(int64_t item) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        <span class="keywordflow">for</span> (int8_t i = 0; i &lt; <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a>; i++) {</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>            <span class="keywordflow">if</span> (item == <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9">items</a>[i]) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        }</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    }</div>
+</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="foldopen" id="foldopen00107" data-start="{" data-end="}">
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a650f0ef26b7450e1addb5d80bb0ed629">  107</a></span>    int8_t <a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a650f0ef26b7450e1addb5d80bb0ed629">GetItemIndex</a>(int64_t item) {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <span class="keywordflow">for</span> (int8_t i = 0; i &lt; <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a>; i++) {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9">items</a>[i] == item) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>                <span class="keywordflow">return</span> i;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>            }</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        }</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    }</div>
+</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57">  120</a></span>    int64_t <a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57">GetMaxItem</a>() { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9">items</a>[<a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a> - 1]; }</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span> </div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71">  126</a></span>    int64_t <a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71">GetMinItem</a>() { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9">items</a>[0]; }</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span> </div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3">  133</a></span>    int64_t <a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3">GetItem</a>(int8_t index) { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9">items</a>[index]; }</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="foldopen" id="foldopen00140" data-start="{" data-end="}">
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc">  140</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc">SetItem</a>(int8_t index, int64_t new_item) {</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        assert(index &gt;= 0 &amp;&amp; index &lt;= 2);</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span> </div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9">items</a>[index] = new_item;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    }</div>
+</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span> </div>
+<div class="foldopen" id="foldopen00163" data-start="{" data-end="}">
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb">  163</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb">InsertItem</a>(<span class="keywordtype">int</span> item) {</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>        assert(!<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd">IsFull</a>());</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span> </div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f">Contains</a>(item)) {</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>            <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        }</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span> </div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        int8_t i = 0;</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>        <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a>; i++) {</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9">items</a>[i] &gt; item) {</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>            }</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        }</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        <a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956">InsertItemByIndex</a>(i, item, <span class="keyword">nullptr</span>, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        <span class="keywordflow">return</span> i;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    }</div>
+</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span> </div>
+<div class="foldopen" id="foldopen00189" data-start="{" data-end="}">
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956">  189</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956">InsertItemByIndex</a>(int8_t index, int64_t item, <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *with_child,</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>                           <span class="keywordtype">bool</span> to_left = <span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>        assert(<a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count &lt; 3 &amp;&amp; index &gt;</a>= 0 &amp;&amp; index &lt; 3);</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span> </div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        <span class="keywordflow">for</span> (int8_t i = <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a> - 1; i &gt;= index; i--) {</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>            <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9">items</a>[i + 1] = <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9">items</a>[i];</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>        }</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span> </div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>        <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9">items</a>[index] = item;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span> </div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        int8_t start_index = to_left ? index : index + 1;</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span> </div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>        <span class="keywordflow">for</span> (int8_t i = <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a>; i &gt;= start_index; i--) {</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>            <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[i + 1] = <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[i];</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>        }</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span> </div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>        <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[start_index] = with_child;</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span> </div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>        <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a>++;</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    }</div>
+</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span> </div>
+<div class="foldopen" id="foldopen00217" data-start="{" data-end="}">
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a28944bb16ec22650b47fe3e80e3e13f8">  217</a></span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a28944bb16ec22650b47fe3e80e3e13f8">RemoveItemByIndex</a>(int8_t index, <span class="keywordtype">bool</span> keep_left) {</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>        assert(index &gt;= 0 &amp;&amp; index &lt; <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a>);</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>        <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *removed_child = keep_left ? <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[index + 1] : <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[index];</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>        <span class="keywordflow">for</span> (int8_t i = index; i &lt; <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a> - 1; i++) {</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>            <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9">items</a>[i] = <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9">items</a>[i + 1];</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>        }</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span> </div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>        <span class="keywordflow">for</span> (int8_t i = keep_left ? index + 1 : index; i &lt; <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a>; i++) {</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>            <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[i] = <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[i + 1];</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>        }</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span> </div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>        <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a>--;</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>        <span class="keywordflow">return</span> removed_child;</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    }</div>
+</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span> </div>
+<div class="foldopen" id="foldopen00237" data-start="{" data-end="}">
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad632a0440295bc88ceadae7478fe0d37">  237</a></span>    int8_t <a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad632a0440295bc88ceadae7478fe0d37">GetChildIndex</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *child) {</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>        <span class="keywordflow">for</span> (int8_t i = 0; i &lt; <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a> + 1; i++) {</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[i] == child) {</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>                <span class="keywordflow">return</span> i;</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>            }</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>        }</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span> </div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>        <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    }</div>
+</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span> </div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4">  252</a></span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4">GetChild</a>(int8_t index) { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[index]; }</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span> </div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74">  259</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74">SetChild</a>(int8_t index, <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *child) { <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[index] = child; }</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span> </div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94">  265</a></span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94">GetRightmostChild</a>() { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[<a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a>]; }</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span> </div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e">  271</a></span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e">GetLeftmostChild</a>() { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[0]; }</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span> </div>
+<div class="foldopen" id="foldopen00278" data-start="{" data-end="}">
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab654d7376d3449fdc78edab0e7fed06e">  278</a></span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab654d7376d3449fdc78edab0e7fed06e">GetItemLeftChild</a>(int8_t item_index) {</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>        <span class="keywordflow">if</span> (item_index &lt; 0 || item_index &gt; <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a> - 1) {</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>            <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>        }</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span> </div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[item_index];</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>    }</div>
+</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span> </div>
+<div class="foldopen" id="foldopen00291" data-start="{" data-end="}">
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a441cbee9896391f2b167d5aa7b4f8c95">  291</a></span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a441cbee9896391f2b167d5aa7b4f8c95">GetItemRightChild</a>(int8_t item_index) {</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>        <span class="keywordflow">if</span> (item_index &lt; 0 || item_index &gt; <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a> - 1) {</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>            <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>        }</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span> </div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[item_index + 1];</div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>    }</div>
+</div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span> </div>
+<div class="foldopen" id="foldopen00304" data-start="{" data-end="}">
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46">  304</a></span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46">GetNextPossibleChild</a>(int64_t item) {</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>        <span class="keywordtype">int</span> i = 0;</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>        <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a>; i++) {</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9">items</a>[i] &gt; item) {</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>            }</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>        }</div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[i];</div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>    }</div>
+</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span> </div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9">  315</a></span>    std::array&lt;int64_t, 3&gt; <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9">items</a>;  </div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span> </div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">  317</a></span>    std::array&lt;Node *, 4&gt; <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>;  </div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span> </div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"><a class="line" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">  319</a></span>    int8_t <a class="code hl_variable" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">count</a> = 0;  </div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>};</div>
+</div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span> </div>
+<div class="foldopen" id="foldopen00323" data-start="{" data-end="};">
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">  323</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">Tree234</a> {</div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>    <a class="code hl_class" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">Tree234</a>() = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>    <a class="code hl_class" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">Tree234</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">Tree234</a> &amp;) = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>    <a class="code hl_class" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">Tree234</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">Tree234</a> &amp;&amp;) = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>    <a class="code hl_class" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">Tree234</a> &amp;operator=(<span class="keyword">const</span> <a class="code hl_class" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">Tree234</a> &amp;) = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>    <a class="code hl_class" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">Tree234</a> &amp;operator=(<span class="keyword">const</span> <a class="code hl_class" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">Tree234</a> &amp;&amp;) = <span class="keyword">delete</span>;</div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span> </div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>    <a class="code hl_class" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">~Tree234</a>();</div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span> </div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">Insert</a>(int64_t item);</div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span> </div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11">Remove</a>(int64_t item);</div>
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span> </div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd">Traverse</a>();</div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span> </div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165">Print</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> *file_name = <span class="keyword">nullptr</span>);</div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span> </div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d">InsertPreSplit</a>(int64_t item);</div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span> </div>
+<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aa7e5e00033f38006a224f30bdbf3f703">InsertPostMerge</a>(int64_t item);</div>
+<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span> </div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">Insert</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *tree, int64_t item);</div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span> </div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805">MergeNode</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *dst_node, <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span> </div>
+<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95">MergeNodeNotFull</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *dst_node, <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
+<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span> </div>
+<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9">SplitNode</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span> </div>
+<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>    int64_t <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657">GetTreeMaxItem</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *tree);</div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span> </div>
+<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span>    int64_t <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36">GetTreeMinItem</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *tree);</div>
+<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span> </div>
+<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9">TryLeftRotate</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *parent, <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *to_child);</div>
+<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span> </div>
+<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3">TryRightRotate</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *parent, <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *to_child);</div>
+<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span> </div>
+<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9">RightRotate</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *parent, int8_t index);</div>
+<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span> </div>
+<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e">LeftRotate</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *parent, int8_t index);</div>
+<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span> </div>
+<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4">RemovePreMerge</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, int64_t item);</div>
+<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span> </div>
+<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9">Merge</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *parent, int8_t index);</div>
+<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span> </div>
+<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a273511e84a5243ffffe81be28bd24855">DeleteNode</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *tree);</div>
+<div class="line"><a id="l00515" name="l00515"></a><span class="lineno">  515</span> </div>
+<div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd">Traverse</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *tree);</div>
+<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span> </div>
+<div class="line"><a id="l00535" name="l00535"></a><span class="lineno">  535</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be">PrintNode</a>(std::ofstream &amp;ofs, <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, int64_t parent_index,</div>
+<div class="line"><a id="l00536" name="l00536"></a><span class="lineno">  536</span>                   int64_t index, int8_t parent_child_index);</div>
+<div class="line"><a id="l00537" name="l00537"></a><span class="lineno">  537</span> </div>
+<div class="line"><a id="l00538" name="l00538"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">  538</a></span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_variable" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">root_</a>{<span class="keyword">nullptr</span>};  </div>
+<div class="line"><a id="l00539" name="l00539"></a><span class="lineno">  539</span>};</div>
+</div>
+<div class="line"><a id="l00540" name="l00540"></a><span class="lineno">  540</span> </div>
+<div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</span>Tree234::~Tree234() { <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a273511e84a5243ffffe81be28bd24855">DeleteNode</a>(<a class="code hl_variable" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">root_</a>); }</div>
+<div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span> </div>
+<div class="foldopen" id="foldopen00547" data-start="{" data-end="}">
+<div class="line"><a id="l00547" name="l00547"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a273511e84a5243ffffe81be28bd24855">  547</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a273511e84a5243ffffe81be28bd24855">Tree234::DeleteNode</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *tree) {</div>
+<div class="line"><a id="l00548" name="l00548"></a><span class="lineno">  548</span>    <span class="keywordflow">if</span> (!tree) {</div>
+<div class="line"><a id="l00549" name="l00549"></a><span class="lineno">  549</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00550" name="l00550"></a><span class="lineno">  550</span>    }</div>
+<div class="line"><a id="l00551" name="l00551"></a><span class="lineno">  551</span>    <span class="keywordflow">for</span> (int8_t i = 0; i &lt;= tree-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06">GetCount</a>(); i++) {</div>
+<div class="line"><a id="l00552" name="l00552"></a><span class="lineno">  552</span>        <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a273511e84a5243ffffe81be28bd24855">DeleteNode</a>(tree-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4">GetChild</a>(i));</div>
+<div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</span>    }</div>
+<div class="line"><a id="l00554" name="l00554"></a><span class="lineno">  554</span> </div>
+<div class="line"><a id="l00555" name="l00555"></a><span class="lineno">  555</span>    <span class="keyword">delete</span> tree;</div>
+<div class="line"><a id="l00556" name="l00556"></a><span class="lineno">  556</span>}</div>
+</div>
+<div class="line"><a id="l00557" name="l00557"></a><span class="lineno">  557</span> </div>
+<div class="foldopen" id="foldopen00562" data-start="{" data-end="}">
+<div class="line"><a id="l00562" name="l00562"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd">  562</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd">Tree234::Traverse</a>() {</div>
+<div class="line"><a id="l00563" name="l00563"></a><span class="lineno">  563</span>    <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd">Traverse</a>(<a class="code hl_variable" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">root_</a>);</div>
+<div class="line"><a id="l00564" name="l00564"></a><span class="lineno">  564</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00565" name="l00565"></a><span class="lineno">  565</span>}</div>
+</div>
+<div class="line"><a id="l00566" name="l00566"></a><span class="lineno">  566</span> </div>
+<div class="foldopen" id="foldopen00567" data-start="{" data-end="}">
+<div class="line"><a id="l00567" name="l00567"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a936bb546e6a94d8b9d35b30ee1bb291a">  567</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd">Tree234::Traverse</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00568" name="l00568"></a><span class="lineno">  568</span>    <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00569" name="l00569"></a><span class="lineno">  569</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00570" name="l00570"></a><span class="lineno">  570</span>    }</div>
+<div class="line"><a id="l00571" name="l00571"></a><span class="lineno">  571</span> </div>
+<div class="line"><a id="l00572" name="l00572"></a><span class="lineno">  572</span>    int8_t i = 0;</div>
+<div class="line"><a id="l00573" name="l00573"></a><span class="lineno">  573</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetCount(); i++) {</div>
+<div class="line"><a id="l00574" name="l00574"></a><span class="lineno">  574</span>        <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd">Traverse</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetChild(i));</div>
+<div class="line"><a id="l00575" name="l00575"></a><span class="lineno">  575</span>        std::cout &lt;&lt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItem(i) &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><a id="l00576" name="l00576"></a><span class="lineno">  576</span>    }</div>
+<div class="line"><a id="l00577" name="l00577"></a><span class="lineno">  577</span> </div>
+<div class="line"><a id="l00578" name="l00578"></a><span class="lineno">  578</span>    <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd">Traverse</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetChild(i));</div>
+<div class="line"><a id="l00579" name="l00579"></a><span class="lineno">  579</span>}</div>
+</div>
+<div class="line"><a id="l00580" name="l00580"></a><span class="lineno">  580</span> </div>
+<div class="foldopen" id="foldopen00585" data-start="{" data-end="}">
+<div class="line"><a id="l00585" name="l00585"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d">  585</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d">Tree234::InsertPreSplit</a>(int64_t item) {</div>
+<div class="line"><a id="l00586" name="l00586"></a><span class="lineno">  586</span>    <span class="keywordflow">if</span> (!<a class="code hl_variable" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">root_</a>) {</div>
+<div class="line"><a id="l00587" name="l00587"></a><span class="lineno">  587</span>        <a class="code hl_variable" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">root_</a> = <span class="keyword">new</span> <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a>(item);</div>
+<div class="line"><a id="l00588" name="l00588"></a><span class="lineno">  588</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00589" name="l00589"></a><span class="lineno">  589</span>    }</div>
+<div class="line"><a id="l00590" name="l00590"></a><span class="lineno">  590</span> </div>
+<div class="line"><a id="l00591" name="l00591"></a><span class="lineno">  591</span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *parent = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00592" name="l00592"></a><span class="lineno">  592</span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_variable" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">root_</a>;</div>
+<div class="line"><a id="l00593" name="l00593"></a><span class="lineno">  593</span> </div>
+<div class="line"><a id="l00594" name="l00594"></a><span class="lineno">  594</span>    <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00595" name="l00595"></a><span class="lineno">  595</span>        <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00596" name="l00596"></a><span class="lineno">  596</span>            std::unique_ptr&lt;Node&gt; tmp(<span class="keyword">new</span> <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a>(item));</div>
+<div class="line"><a id="l00597" name="l00597"></a><span class="lineno">  597</span>            <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95">MergeNodeNotFull</a>(parent, tmp.get());</div>
+<div class="line"><a id="l00598" name="l00598"></a><span class="lineno">  598</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00599" name="l00599"></a><span class="lineno">  599</span>        }</div>
+<div class="line"><a id="l00600" name="l00600"></a><span class="lineno">  600</span> </div>
+<div class="line"><a id="l00601" name="l00601"></a><span class="lineno">  601</span>        <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;Contains(item)) {</div>
+<div class="line"><a id="l00602" name="l00602"></a><span class="lineno">  602</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00603" name="l00603"></a><span class="lineno">  603</span>        }</div>
+<div class="line"><a id="l00604" name="l00604"></a><span class="lineno">  604</span> </div>
+<div class="line"><a id="l00605" name="l00605"></a><span class="lineno">  605</span>        <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;IsFull()) {</div>
+<div class="line"><a id="l00606" name="l00606"></a><span class="lineno">  606</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9">SplitNode</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
+<div class="line"><a id="l00607" name="l00607"></a><span class="lineno">  607</span> </div>
+<div class="line"><a id="l00608" name="l00608"></a><span class="lineno">  608</span>            <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *cur_node = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00609" name="l00609"></a><span class="lineno">  609</span> </div>
+<div class="line"><a id="l00610" name="l00610"></a><span class="lineno">  610</span>            <span class="keywordflow">if</span> (item &lt; node-&gt;GetItem(0)) {</div>
+<div class="line"><a id="l00611" name="l00611"></a><span class="lineno">  611</span>                cur_node = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetChild(0);</div>
+<div class="line"><a id="l00612" name="l00612"></a><span class="lineno">  612</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00613" name="l00613"></a><span class="lineno">  613</span>                cur_node = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetChild(1);</div>
+<div class="line"><a id="l00614" name="l00614"></a><span class="lineno">  614</span>            }</div>
+<div class="line"><a id="l00615" name="l00615"></a><span class="lineno">  615</span> </div>
+<div class="line"><a id="l00616" name="l00616"></a><span class="lineno">  616</span>            <span class="keywordflow">if</span> (!parent) {</div>
+<div class="line"><a id="l00617" name="l00617"></a><span class="lineno">  617</span>                <span class="comment">// for the root node parent is nullptr, we simply assign the</span></div>
+<div class="line"><a id="l00618" name="l00618"></a><span class="lineno">  618</span>                <span class="comment">// split parent to root_</span></div>
+<div class="line"><a id="l00619" name="l00619"></a><span class="lineno">  619</span>                <a class="code hl_variable" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">root_</a> = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00620" name="l00620"></a><span class="lineno">  620</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00621" name="l00621"></a><span class="lineno">  621</span>                <span class="comment">// merge the split parent to its origin parent</span></div>
+<div class="line"><a id="l00622" name="l00622"></a><span class="lineno">  622</span>                <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95">MergeNodeNotFull</a>(parent, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
+<div class="line"><a id="l00623" name="l00623"></a><span class="lineno">  623</span>            }</div>
+<div class="line"><a id="l00624" name="l00624"></a><span class="lineno">  624</span> </div>
+<div class="line"><a id="l00625" name="l00625"></a><span class="lineno">  625</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = cur_node;</div>
+<div class="line"><a id="l00626" name="l00626"></a><span class="lineno">  626</span>        }</div>
+<div class="line"><a id="l00627" name="l00627"></a><span class="lineno">  627</span> </div>
+<div class="line"><a id="l00628" name="l00628"></a><span class="lineno">  628</span>        parent = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00629" name="l00629"></a><span class="lineno">  629</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = parent-&gt;GetNextPossibleChild(item);</div>
+<div class="line"><a id="l00630" name="l00630"></a><span class="lineno">  630</span>    }</div>
+<div class="line"><a id="l00631" name="l00631"></a><span class="lineno">  631</span>}</div>
+</div>
+<div class="line"><a id="l00632" name="l00632"></a><span class="lineno">  632</span> </div>
+<div class="foldopen" id="foldopen00637" data-start="{" data-end="}">
+<div class="line"><a id="l00637" name="l00637"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aa7e5e00033f38006a224f30bdbf3f703">  637</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aa7e5e00033f38006a224f30bdbf3f703">Tree234::InsertPostMerge</a>(int64_t item) {</div>
+<div class="line"><a id="l00638" name="l00638"></a><span class="lineno">  638</span>    <span class="keywordflow">if</span> (!<a class="code hl_variable" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">root_</a>) {</div>
+<div class="line"><a id="l00639" name="l00639"></a><span class="lineno">  639</span>        <a class="code hl_variable" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">root_</a> = <span class="keyword">new</span> <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a>(item);</div>
+<div class="line"><a id="l00640" name="l00640"></a><span class="lineno">  640</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00641" name="l00641"></a><span class="lineno">  641</span>    }</div>
+<div class="line"><a id="l00642" name="l00642"></a><span class="lineno">  642</span> </div>
+<div class="line"><a id="l00643" name="l00643"></a><span class="lineno">  643</span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *split_node = <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">Insert</a>(<a class="code hl_variable" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">root_</a>, item);</div>
+<div class="line"><a id="l00644" name="l00644"></a><span class="lineno">  644</span> </div>
+<div class="line"><a id="l00645" name="l00645"></a><span class="lineno">  645</span>    <span class="comment">// if root has split, then update root_</span></div>
+<div class="line"><a id="l00646" name="l00646"></a><span class="lineno">  646</span>    <span class="keywordflow">if</span> (split_node) {</div>
+<div class="line"><a id="l00647" name="l00647"></a><span class="lineno">  647</span>        <a class="code hl_variable" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">root_</a> = split_node;</div>
+<div class="line"><a id="l00648" name="l00648"></a><span class="lineno">  648</span>    }</div>
+<div class="line"><a id="l00649" name="l00649"></a><span class="lineno">  649</span>}</div>
+</div>
+<div class="line"><a id="l00650" name="l00650"></a><span class="lineno">  650</span> </div>
+<div class="line"><a id="l00655" name="l00655"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">  655</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">Tree234::Insert</a>(int64_t item) { <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d">InsertPreSplit</a>(item); }</div>
+<div class="line"><a id="l00656" name="l00656"></a><span class="lineno">  656</span> </div>
+<div class="foldopen" id="foldopen00663" data-start="{" data-end="}">
+<div class="line"><a id="l00663" name="l00663"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f">  663</a></span><a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">Tree234::Insert</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *tree, int64_t item) {</div>
+<div class="line"><a id="l00664" name="l00664"></a><span class="lineno">  664</span>    assert(tree != <span class="keyword">nullptr</span>);</div>
+<div class="line"><a id="l00665" name="l00665"></a><span class="lineno">  665</span> </div>
+<div class="line"><a id="l00666" name="l00666"></a><span class="lineno">  666</span>    std::unique_ptr&lt;Node&gt; split_node;</div>
+<div class="line"><a id="l00667" name="l00667"></a><span class="lineno">  667</span> </div>
+<div class="line"><a id="l00668" name="l00668"></a><span class="lineno">  668</span>    <span class="keywordflow">if</span> (tree-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f">Contains</a>(item)) {</div>
+<div class="line"><a id="l00669" name="l00669"></a><span class="lineno">  669</span>        <span class="comment">// return nullptr indicate current node not overflow</span></div>
+<div class="line"><a id="l00670" name="l00670"></a><span class="lineno">  670</span>        <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00671" name="l00671"></a><span class="lineno">  671</span>    }</div>
+<div class="line"><a id="l00672" name="l00672"></a><span class="lineno">  672</span> </div>
+<div class="line"><a id="l00673" name="l00673"></a><span class="lineno">  673</span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *next_node = tree-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46">GetNextPossibleChild</a>(item);</div>
+<div class="line"><a id="l00674" name="l00674"></a><span class="lineno">  674</span>    <span class="keywordflow">if</span> (next_node) {</div>
+<div class="line"><a id="l00675" name="l00675"></a><span class="lineno">  675</span>        split_node.reset(<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">Insert</a>(next_node, item));</div>
+<div class="line"><a id="l00676" name="l00676"></a><span class="lineno">  676</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00677" name="l00677"></a><span class="lineno">  677</span>        split_node.reset(<span class="keyword">new</span> <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a>(item));</div>
+<div class="line"><a id="l00678" name="l00678"></a><span class="lineno">  678</span>    }</div>
+<div class="line"><a id="l00679" name="l00679"></a><span class="lineno">  679</span> </div>
+<div class="line"><a id="l00680" name="l00680"></a><span class="lineno">  680</span>    <span class="keywordflow">if</span> (split_node) {</div>
+<div class="line"><a id="l00681" name="l00681"></a><span class="lineno">  681</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805">MergeNode</a>(tree, split_node.get());</div>
+<div class="line"><a id="l00682" name="l00682"></a><span class="lineno">  682</span>    }</div>
+<div class="line"><a id="l00683" name="l00683"></a><span class="lineno">  683</span> </div>
+<div class="line"><a id="l00684" name="l00684"></a><span class="lineno">  684</span>    <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00685" name="l00685"></a><span class="lineno">  685</span>}</div>
+</div>
+<div class="line"><a id="l00686" name="l00686"></a><span class="lineno">  686</span> </div>
+<div class="foldopen" id="foldopen00700" data-start="{" data-end="}">
+<div class="line"><a id="l00700" name="l00700"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805">  700</a></span><a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805">Tree234::MergeNode</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *dst_node, <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00701" name="l00701"></a><span class="lineno">  701</span>    assert(dst_node != <span class="keyword">nullptr</span> &amp;&amp; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> != <span class="keyword">nullptr</span>);</div>
+<div class="line"><a id="l00702" name="l00702"></a><span class="lineno">  702</span> </div>
+<div class="line"><a id="l00703" name="l00703"></a><span class="lineno">  703</span>    <span class="keywordflow">if</span> (!dst_node-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd">IsFull</a>()) {</div>
+<div class="line"><a id="l00704" name="l00704"></a><span class="lineno">  704</span>        <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95">MergeNodeNotFull</a>(dst_node, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
+<div class="line"><a id="l00705" name="l00705"></a><span class="lineno">  705</span>        <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00706" name="l00706"></a><span class="lineno">  706</span>    }</div>
+<div class="line"><a id="l00707" name="l00707"></a><span class="lineno">  707</span> </div>
+<div class="line"><a id="l00708" name="l00708"></a><span class="lineno">  708</span>    dst_node = <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9">SplitNode</a>(dst_node);</div>
+<div class="line"><a id="l00709" name="l00709"></a><span class="lineno">  709</span> </div>
+<div class="line"><a id="l00710" name="l00710"></a><span class="lineno">  710</span>    <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItem(0) &lt; dst_node-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3">GetItem</a>(0)) {</div>
+<div class="line"><a id="l00711" name="l00711"></a><span class="lineno">  711</span>        <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95">MergeNodeNotFull</a>(dst_node-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4">GetChild</a>(0), <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
+<div class="line"><a id="l00712" name="l00712"></a><span class="lineno">  712</span> </div>
+<div class="line"><a id="l00713" name="l00713"></a><span class="lineno">  713</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00714" name="l00714"></a><span class="lineno">  714</span>        <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95">MergeNodeNotFull</a>(dst_node-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4">GetChild</a>(1), <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
+<div class="line"><a id="l00715" name="l00715"></a><span class="lineno">  715</span>    }</div>
+<div class="line"><a id="l00716" name="l00716"></a><span class="lineno">  716</span> </div>
+<div class="line"><a id="l00717" name="l00717"></a><span class="lineno">  717</span>    <span class="keywordflow">return</span> dst_node;</div>
+<div class="line"><a id="l00718" name="l00718"></a><span class="lineno">  718</span>}</div>
+</div>
+<div class="line"><a id="l00719" name="l00719"></a><span class="lineno">  719</span> </div>
+<div class="foldopen" id="foldopen00730" data-start="{" data-end="}">
+<div class="line"><a id="l00730" name="l00730"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95">  730</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95">Tree234::MergeNodeNotFull</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *dst_node, <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00731" name="l00731"></a><span class="lineno">  731</span>    assert(dst_node &amp;&amp; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> &amp;&amp; !dst_node-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd">IsFull</a>() &amp;&amp; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;Is2Node());</div>
+<div class="line"><a id="l00732" name="l00732"></a><span class="lineno">  732</span> </div>
+<div class="line"><a id="l00733" name="l00733"></a><span class="lineno">  733</span>    int8_t i = dst_node-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb">InsertItem</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItem(0));</div>
+<div class="line"><a id="l00734" name="l00734"></a><span class="lineno">  734</span> </div>
+<div class="line"><a id="l00735" name="l00735"></a><span class="lineno">  735</span>    dst_node-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74">SetChild</a>(i, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetChild(0));</div>
+<div class="line"><a id="l00736" name="l00736"></a><span class="lineno">  736</span>    dst_node-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74">SetChild</a>(i + 1, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetChild(1));</div>
+<div class="line"><a id="l00737" name="l00737"></a><span class="lineno">  737</span>}</div>
+</div>
+<div class="line"><a id="l00738" name="l00738"></a><span class="lineno">  738</span> </div>
+<div class="foldopen" id="foldopen00745" data-start="{" data-end="}">
+<div class="line"><a id="l00745" name="l00745"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9">  745</a></span><a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9">Tree234::SplitNode</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00746" name="l00746"></a><span class="lineno">  746</span>    assert(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetCount() == 3);</div>
+<div class="line"><a id="l00747" name="l00747"></a><span class="lineno">  747</span> </div>
+<div class="line"><a id="l00748" name="l00748"></a><span class="lineno">  748</span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *left = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00749" name="l00749"></a><span class="lineno">  749</span> </div>
+<div class="line"><a id="l00750" name="l00750"></a><span class="lineno">  750</span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *right = <span class="keyword">new</span> <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItem(2));</div>
+<div class="line"><a id="l00751" name="l00751"></a><span class="lineno">  751</span>    right-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74">SetChild</a>(0, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetChild(2));</div>
+<div class="line"><a id="l00752" name="l00752"></a><span class="lineno">  752</span>    right-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74">SetChild</a>(1, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetChild(3));</div>
+<div class="line"><a id="l00753" name="l00753"></a><span class="lineno">  753</span> </div>
+<div class="line"><a id="l00754" name="l00754"></a><span class="lineno">  754</span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *parent = <span class="keyword">new</span> <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItem(1));</div>
+<div class="line"><a id="l00755" name="l00755"></a><span class="lineno">  755</span>    parent-&gt;SetChild(0, left);</div>
+<div class="line"><a id="l00756" name="l00756"></a><span class="lineno">  756</span>    parent-&gt;SetChild(1, right);</div>
+<div class="line"><a id="l00757" name="l00757"></a><span class="lineno">  757</span> </div>
+<div class="line"><a id="l00758" name="l00758"></a><span class="lineno">  758</span>    left-&gt;SetCount(1);</div>
+<div class="line"><a id="l00759" name="l00759"></a><span class="lineno">  759</span> </div>
+<div class="line"><a id="l00760" name="l00760"></a><span class="lineno">  760</span>    <span class="keywordflow">return</span> parent;</div>
+<div class="line"><a id="l00761" name="l00761"></a><span class="lineno">  761</span>}</div>
+</div>
+<div class="line"><a id="l00762" name="l00762"></a><span class="lineno">  762</span> </div>
+<div class="foldopen" id="foldopen00778" data-start="{" data-end="}">
+<div class="line"><a id="l00778" name="l00778"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9">  778</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9">Tree234::TryLeftRotate</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *parent, <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *to_child) {</div>
+<div class="line"><a id="l00779" name="l00779"></a><span class="lineno">  779</span>    <span class="keywordtype">int</span> to_child_index = parent-&gt;GetChildIndex(to_child);</div>
+<div class="line"><a id="l00780" name="l00780"></a><span class="lineno">  780</span> </div>
+<div class="line"><a id="l00781" name="l00781"></a><span class="lineno">  781</span>    <span class="comment">// child is right most, can not do left rotate to it</span></div>
+<div class="line"><a id="l00782" name="l00782"></a><span class="lineno">  782</span>    <span class="keywordflow">if</span> (to_child_index &gt;= parent-&gt;GetCount()) {</div>
+<div class="line"><a id="l00783" name="l00783"></a><span class="lineno">  783</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00784" name="l00784"></a><span class="lineno">  784</span>    }</div>
+<div class="line"><a id="l00785" name="l00785"></a><span class="lineno">  785</span> </div>
+<div class="line"><a id="l00786" name="l00786"></a><span class="lineno">  786</span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *right_sibling = parent-&gt;GetChild(to_child_index + 1);</div>
+<div class="line"><a id="l00787" name="l00787"></a><span class="lineno">  787</span> </div>
+<div class="line"><a id="l00788" name="l00788"></a><span class="lineno">  788</span>    <span class="comment">// right sibling is 2-node. can not do left rotate.</span></div>
+<div class="line"><a id="l00789" name="l00789"></a><span class="lineno">  789</span>    <span class="keywordflow">if</span> (right_sibling-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631">Is2Node</a>()) {</div>
+<div class="line"><a id="l00790" name="l00790"></a><span class="lineno">  790</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00791" name="l00791"></a><span class="lineno">  791</span>    }</div>
+<div class="line"><a id="l00792" name="l00792"></a><span class="lineno">  792</span> </div>
+<div class="line"><a id="l00793" name="l00793"></a><span class="lineno">  793</span>    <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e">LeftRotate</a>(parent, to_child_index);</div>
+<div class="line"><a id="l00794" name="l00794"></a><span class="lineno">  794</span> </div>
+<div class="line"><a id="l00795" name="l00795"></a><span class="lineno">  795</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00796" name="l00796"></a><span class="lineno">  796</span>}</div>
+</div>
+<div class="line"><a id="l00797" name="l00797"></a><span class="lineno">  797</span> </div>
+<div class="foldopen" id="foldopen00813" data-start="{" data-end="}">
+<div class="line"><a id="l00813" name="l00813"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3">  813</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3">Tree234::TryRightRotate</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *parent, <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *to_child) {</div>
+<div class="line"><a id="l00814" name="l00814"></a><span class="lineno">  814</span>    int8_t to_child_index = parent-&gt;GetChildIndex(to_child);</div>
+<div class="line"><a id="l00815" name="l00815"></a><span class="lineno">  815</span> </div>
+<div class="line"><a id="l00816" name="l00816"></a><span class="lineno">  816</span>    <span class="comment">// child is left most, can not do right rotate to it</span></div>
+<div class="line"><a id="l00817" name="l00817"></a><span class="lineno">  817</span>    <span class="keywordflow">if</span> (to_child_index &lt;= 0) {</div>
+<div class="line"><a id="l00818" name="l00818"></a><span class="lineno">  818</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00819" name="l00819"></a><span class="lineno">  819</span>    }</div>
+<div class="line"><a id="l00820" name="l00820"></a><span class="lineno">  820</span> </div>
+<div class="line"><a id="l00821" name="l00821"></a><span class="lineno">  821</span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *left_sibling = parent-&gt;GetChild(to_child_index - 1);</div>
+<div class="line"><a id="l00822" name="l00822"></a><span class="lineno">  822</span> </div>
+<div class="line"><a id="l00823" name="l00823"></a><span class="lineno">  823</span>    <span class="comment">// right sibling is 2-node. can not do left rotate.</span></div>
+<div class="line"><a id="l00824" name="l00824"></a><span class="lineno">  824</span>    <span class="keywordflow">if</span> (left_sibling-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631">Is2Node</a>()) {</div>
+<div class="line"><a id="l00825" name="l00825"></a><span class="lineno">  825</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00826" name="l00826"></a><span class="lineno">  826</span>    }</div>
+<div class="line"><a id="l00827" name="l00827"></a><span class="lineno">  827</span> </div>
+<div class="line"><a id="l00828" name="l00828"></a><span class="lineno">  828</span>    <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9">RightRotate</a>(parent, to_child_index - 1);</div>
+<div class="line"><a id="l00829" name="l00829"></a><span class="lineno">  829</span> </div>
+<div class="line"><a id="l00830" name="l00830"></a><span class="lineno">  830</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00831" name="l00831"></a><span class="lineno">  831</span>}</div>
+</div>
+<div class="line"><a id="l00832" name="l00832"></a><span class="lineno">  832</span> </div>
+<div class="foldopen" id="foldopen00845" data-start="{" data-end="}">
+<div class="line"><a id="l00845" name="l00845"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9">  845</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9">Tree234::RightRotate</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *parent, int8_t index) {</div>
+<div class="line"><a id="l00846" name="l00846"></a><span class="lineno">  846</span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *left = parent-&gt;GetItemLeftChild(index);</div>
+<div class="line"><a id="l00847" name="l00847"></a><span class="lineno">  847</span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *right = parent-&gt;GetItemRightChild(index);</div>
+<div class="line"><a id="l00848" name="l00848"></a><span class="lineno">  848</span> </div>
+<div class="line"><a id="l00849" name="l00849"></a><span class="lineno">  849</span>    assert(left &amp;&amp; left-&gt;Is34Node());</div>
+<div class="line"><a id="l00850" name="l00850"></a><span class="lineno">  850</span>    assert(right &amp;&amp; right-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631">Is2Node</a>());</div>
+<div class="line"><a id="l00851" name="l00851"></a><span class="lineno">  851</span> </div>
+<div class="line"><a id="l00852" name="l00852"></a><span class="lineno">  852</span>    right-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956">InsertItemByIndex</a>(0, parent-&gt;GetItem(index),</div>
+<div class="line"><a id="l00853" name="l00853"></a><span class="lineno">  853</span>                             left-&gt;GetRightmostChild(), <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00854" name="l00854"></a><span class="lineno">  854</span>    parent-&gt;SetItem(index, left-&gt;GetMaxItem());</div>
+<div class="line"><a id="l00855" name="l00855"></a><span class="lineno">  855</span>    left-&gt;RemoveItemByIndex(left-&gt;GetCount() - 1, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00856" name="l00856"></a><span class="lineno">  856</span>}</div>
+</div>
+<div class="line"><a id="l00857" name="l00857"></a><span class="lineno">  857</span> </div>
+<div class="foldopen" id="foldopen00869" data-start="{" data-end="}">
+<div class="line"><a id="l00869" name="l00869"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e">  869</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e">Tree234::LeftRotate</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *parent, int8_t index) {</div>
+<div class="line"><a id="l00870" name="l00870"></a><span class="lineno">  870</span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *left = parent-&gt;GetItemLeftChild(index);</div>
+<div class="line"><a id="l00871" name="l00871"></a><span class="lineno">  871</span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *right = parent-&gt;GetItemRightChild(index);</div>
+<div class="line"><a id="l00872" name="l00872"></a><span class="lineno">  872</span> </div>
+<div class="line"><a id="l00873" name="l00873"></a><span class="lineno">  873</span>    assert(right &amp;&amp; right-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18">Is34Node</a>());</div>
+<div class="line"><a id="l00874" name="l00874"></a><span class="lineno">  874</span>    assert(left &amp;&amp; left-&gt;Is2Node());</div>
+<div class="line"><a id="l00875" name="l00875"></a><span class="lineno">  875</span> </div>
+<div class="line"><a id="l00876" name="l00876"></a><span class="lineno">  876</span>    left-&gt;InsertItemByIndex(left-&gt;GetCount(), parent-&gt;GetItem(index),</div>
+<div class="line"><a id="l00877" name="l00877"></a><span class="lineno">  877</span>                            right-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e">GetLeftmostChild</a>(), <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00878" name="l00878"></a><span class="lineno">  878</span>    parent-&gt;SetItem(index, right-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71">GetMinItem</a>());</div>
+<div class="line"><a id="l00879" name="l00879"></a><span class="lineno">  879</span>    right-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a28944bb16ec22650b47fe3e80e3e13f8">RemoveItemByIndex</a>(0, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00880" name="l00880"></a><span class="lineno">  880</span>}</div>
+</div>
+<div class="line"><a id="l00881" name="l00881"></a><span class="lineno">  881</span> </div>
+<div class="foldopen" id="foldopen00895" data-start="{" data-end="}">
+<div class="line"><a id="l00895" name="l00895"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9">  895</a></span><a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9">Tree234::Merge</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *parent, int8_t index) {</div>
+<div class="line"><a id="l00896" name="l00896"></a><span class="lineno">  896</span>    assert(parent);</div>
+<div class="line"><a id="l00897" name="l00897"></a><span class="lineno">  897</span> </div>
+<div class="line"><a id="l00898" name="l00898"></a><span class="lineno">  898</span>    <span class="comment">// bool is_parent_2node = parent-&gt;Is2Node();</span></div>
+<div class="line"><a id="l00899" name="l00899"></a><span class="lineno">  899</span> </div>
+<div class="line"><a id="l00900" name="l00900"></a><span class="lineno">  900</span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *left_child = parent-&gt;GetItemLeftChild(index);</div>
+<div class="line"><a id="l00901" name="l00901"></a><span class="lineno">  901</span>    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *right_child = parent-&gt;GetItemRightChild(index);</div>
+<div class="line"><a id="l00902" name="l00902"></a><span class="lineno">  902</span> </div>
+<div class="line"><a id="l00903" name="l00903"></a><span class="lineno">  903</span>    assert(left_child-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631">Is2Node</a>() &amp;&amp; right_child-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631">Is2Node</a>());</div>
+<div class="line"><a id="l00904" name="l00904"></a><span class="lineno">  904</span> </div>
+<div class="line"><a id="l00905" name="l00905"></a><span class="lineno">  905</span>    int64_t item = parent-&gt;GetItem(index);</div>
+<div class="line"><a id="l00906" name="l00906"></a><span class="lineno">  906</span> </div>
+<div class="line"><a id="l00907" name="l00907"></a><span class="lineno">  907</span>    <span class="comment">// 1. merge parent&#39;s item and right child to left child</span></div>
+<div class="line"><a id="l00908" name="l00908"></a><span class="lineno">  908</span>    left_child-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc">SetItem</a>(1, item);</div>
+<div class="line"><a id="l00909" name="l00909"></a><span class="lineno">  909</span>    left_child-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc">SetItem</a>(2, right_child-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3">GetItem</a>(0));</div>
+<div class="line"><a id="l00910" name="l00910"></a><span class="lineno">  910</span>    left_child-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74">SetChild</a>(2, right_child-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4">GetChild</a>(0));</div>
+<div class="line"><a id="l00911" name="l00911"></a><span class="lineno">  911</span>    left_child-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74">SetChild</a>(3, right_child-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4">GetChild</a>(1));</div>
+<div class="line"><a id="l00912" name="l00912"></a><span class="lineno">  912</span> </div>
+<div class="line"><a id="l00913" name="l00913"></a><span class="lineno">  913</span>    left_child-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1">SetCount</a>(3);</div>
+<div class="line"><a id="l00914" name="l00914"></a><span class="lineno">  914</span> </div>
+<div class="line"><a id="l00915" name="l00915"></a><span class="lineno">  915</span>    <span class="comment">// 2. remove the parent&#39;s item</span></div>
+<div class="line"><a id="l00916" name="l00916"></a><span class="lineno">  916</span>    parent-&gt;RemoveItemByIndex(index, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00917" name="l00917"></a><span class="lineno">  917</span> </div>
+<div class="line"><a id="l00918" name="l00918"></a><span class="lineno">  918</span>    <span class="comment">// 3. delete the unused right child</span></div>
+<div class="line"><a id="l00919" name="l00919"></a><span class="lineno">  919</span>    <span class="keyword">delete</span> right_child;</div>
+<div class="line"><a id="l00920" name="l00920"></a><span class="lineno">  920</span> </div>
+<div class="line"><a id="l00921" name="l00921"></a><span class="lineno">  921</span>    <span class="keywordflow">return</span> left_child;</div>
+<div class="line"><a id="l00922" name="l00922"></a><span class="lineno">  922</span>}</div>
+</div>
+<div class="line"><a id="l00923" name="l00923"></a><span class="lineno">  923</span> </div>
+<div class="line"><a id="l00929" name="l00929"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11">  929</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11">Tree234::Remove</a>(int64_t item) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4">RemovePreMerge</a>(<a class="code hl_variable" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">root_</a>, item); }</div>
+<div class="line"><a id="l00930" name="l00930"></a><span class="lineno">  930</span> </div>
+<div class="foldopen" id="foldopen00937" data-start="{" data-end="}">
+<div class="line"><a id="l00937" name="l00937"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4">  937</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4">Tree234::RemovePreMerge</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, int64_t item) {</div>
+<div class="line"><a id="l00938" name="l00938"></a><span class="lineno">  938</span>    <span class="keywordflow">while</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00939" name="l00939"></a><span class="lineno">  939</span>        <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;IsLeaf()) {</div>
+<div class="line"><a id="l00940" name="l00940"></a><span class="lineno">  940</span>            <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;Contains(item)) {</div>
+<div class="line"><a id="l00941" name="l00941"></a><span class="lineno">  941</span>                <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;Is2Node()) {</div>
+<div class="line"><a id="l00942" name="l00942"></a><span class="lineno">  942</span>                    <span class="comment">// node must be root</span></div>
+<div class="line"><a id="l00943" name="l00943"></a><span class="lineno">  943</span>                    <span class="keyword">delete</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00944" name="l00944"></a><span class="lineno">  944</span>                    <a class="code hl_variable" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">root_</a> = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00945" name="l00945"></a><span class="lineno">  945</span>                } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00946" name="l00946"></a><span class="lineno">  946</span>                    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;RemoveItemByIndex(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItemIndex(item), <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00947" name="l00947"></a><span class="lineno">  947</span>                }</div>
+<div class="line"><a id="l00948" name="l00948"></a><span class="lineno">  948</span>                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00949" name="l00949"></a><span class="lineno">  949</span>            }</div>
+<div class="line"><a id="l00950" name="l00950"></a><span class="lineno">  950</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00951" name="l00951"></a><span class="lineno">  951</span>        }</div>
+<div class="line"><a id="l00952" name="l00952"></a><span class="lineno">  952</span> </div>
+<div class="line"><a id="l00953" name="l00953"></a><span class="lineno">  953</span>        <span class="comment">// node is internal</span></div>
+<div class="line"><a id="l00954" name="l00954"></a><span class="lineno">  954</span>        <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;Contains(item)) {</div>
+<div class="line"><a id="l00955" name="l00955"></a><span class="lineno">  955</span>            int8_t index = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItemIndex(item);</div>
+<div class="line"><a id="l00956" name="l00956"></a><span class="lineno">  956</span> </div>
+<div class="line"><a id="l00957" name="l00957"></a><span class="lineno">  957</span>            <span class="comment">// Here is important!!! What we do next depend on its children&#39;s</span></div>
+<div class="line"><a id="l00958" name="l00958"></a><span class="lineno">  958</span>            <span class="comment">// state. Why?</span></div>
+<div class="line"><a id="l00959" name="l00959"></a><span class="lineno">  959</span>            <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *left_child = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItemLeftChild(index);</div>
+<div class="line"><a id="l00960" name="l00960"></a><span class="lineno">  960</span>            <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *right_child = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItemRightChild(index);</div>
+<div class="line"><a id="l00961" name="l00961"></a><span class="lineno">  961</span>            assert(left_child &amp;&amp; right_child);</div>
+<div class="line"><a id="l00962" name="l00962"></a><span class="lineno">  962</span> </div>
+<div class="line"><a id="l00963" name="l00963"></a><span class="lineno">  963</span>            <span class="keywordflow">if</span> (left_child-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631">Is2Node</a>() &amp;&amp; right_child-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631">Is2Node</a>()) {</div>
+<div class="line"><a id="l00964" name="l00964"></a><span class="lineno">  964</span>                <span class="comment">// both left and right child are 2-node,we should not modify</span></div>
+<div class="line"><a id="l00965" name="l00965"></a><span class="lineno">  965</span>                <span class="comment">// current node in this situation. Because we are going to do</span></div>
+<div class="line"><a id="l00966" name="l00966"></a><span class="lineno">  966</span>                <span class="comment">// merge with its children which will move target item to next</span></div>
+<div class="line"><a id="l00967" name="l00967"></a><span class="lineno">  967</span>                <span class="comment">// layer. so if we replace the item with successor or</span></div>
+<div class="line"><a id="l00968" name="l00968"></a><span class="lineno">  968</span>                <span class="comment">// predecessor now, when we do the recursive remove with</span></div>
+<div class="line"><a id="l00969" name="l00969"></a><span class="lineno">  969</span>                <span class="comment">// successor or predecessor, we will result in removing the just</span></div>
+<div class="line"><a id="l00970" name="l00970"></a><span class="lineno">  970</span>                <span class="comment">// replaced one in the merged node. That&#39;s not what we want.</span></div>
+<div class="line"><a id="l00971" name="l00971"></a><span class="lineno">  971</span> </div>
+<div class="line"><a id="l00972" name="l00972"></a><span class="lineno">  972</span>                <span class="comment">// we need to convert the child 2-node to 3-node or 4-node</span></div>
+<div class="line"><a id="l00973" name="l00973"></a><span class="lineno">  973</span>                <span class="comment">// first. First we try to see if any of them can convert to</span></div>
+<div class="line"><a id="l00974" name="l00974"></a><span class="lineno">  974</span>                <span class="comment">// 3-node by rotate. By using rotate we keep the empty house for</span></div>
+<div class="line"><a id="l00975" name="l00975"></a><span class="lineno">  975</span>                <span class="comment">// the future insertion which will be more efficient than merge.</span></div>
+<div class="line"><a id="l00976" name="l00976"></a><span class="lineno">  976</span>                <span class="comment">//</span></div>
+<div class="line"><a id="l00977" name="l00977"></a><span class="lineno">  977</span>                <span class="comment">//            | ? | node | ? |</span></div>
+<div class="line"><a id="l00978" name="l00978"></a><span class="lineno">  978</span>                <span class="comment">//           /    |      |    \</span></div>
+<div class="line"><a id="l00979" name="l00979"></a><span class="lineno">  979</span><span class="comment">                //          /     |      |     \</span></div>
+<div class="line"><a id="l00980" name="l00980"></a><span class="lineno">  980</span><span class="comment">                //         /      |      |      \</span></div>
+<div class="line"><a id="l00981" name="l00981"></a><span class="lineno">  981</span><span class="comment">                //        /       |      |       \</span></div>
+<div class="line"><a id="l00982" name="l00982"></a><span class="lineno">  982</span><span class="comment">                //       /        |      |        \</span></div>
+<div class="line"><a id="l00983" name="l00983"></a><span class="lineno">  983</span><span class="comment">                //      /         |      |         \</span></div>
+<div class="line"><a id="l00984" name="l00984"></a><span class="lineno">  984</span><span class="comment">                //     ?  left_child  right_child   ?</span></div>
+<div class="line"><a id="l00985" name="l00985"></a><span class="lineno">  985</span>                <span class="comment">//</span></div>
+<div class="line"><a id="l00986" name="l00986"></a><span class="lineno">  986</span> </div>
+<div class="line"><a id="l00987" name="l00987"></a><span class="lineno">  987</span>                <span class="comment">// node must be the root</span></div>
+<div class="line"><a id="l00988" name="l00988"></a><span class="lineno">  988</span>                <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;Is2Node()) {</div>
+<div class="line"><a id="l00989" name="l00989"></a><span class="lineno">  989</span>                    <span class="comment">// this means we can&#39;t avoid merging the target item into</span></div>
+<div class="line"><a id="l00990" name="l00990"></a><span class="lineno">  990</span>                    <span class="comment">// next layer, and this will cause us do different process</span></div>
+<div class="line"><a id="l00991" name="l00991"></a><span class="lineno">  991</span>                    <span class="comment">// compared with other cases</span></div>
+<div class="line"><a id="l00992" name="l00992"></a><span class="lineno">  992</span>                    <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *new_root = <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9">Merge</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, index);</div>
+<div class="line"><a id="l00993" name="l00993"></a><span class="lineno">  993</span>                    <span class="keyword">delete</span> <a class="code hl_variable" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">root_</a>;</div>
+<div class="line"><a id="l00994" name="l00994"></a><span class="lineno">  994</span>                    <a class="code hl_variable" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">root_</a> = new_root;</div>
+<div class="line"><a id="l00995" name="l00995"></a><span class="lineno">  995</span>                    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_variable" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">root_</a>;</div>
+<div class="line"><a id="l00996" name="l00996"></a><span class="lineno">  996</span> </div>
+<div class="line"><a id="l00997" name="l00997"></a><span class="lineno">  997</span>                    <span class="comment">// now node point to the</span></div>
+<div class="line"><a id="l00998" name="l00998"></a><span class="lineno">  998</span>                    <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00999" name="l00999"></a><span class="lineno">  999</span>                }</div>
+<div class="line"><a id="l01000" name="l01000"></a><span class="lineno"> 1000</span> </div>
+<div class="line"><a id="l01001" name="l01001"></a><span class="lineno"> 1001</span>                <span class="comment">// here means we can avoid merging the target item into next</span></div>
+<div class="line"><a id="l01002" name="l01002"></a><span class="lineno"> 1002</span>                <span class="comment">// layer. So we convert one of its left or right child to 3-node</span></div>
+<div class="line"><a id="l01003" name="l01003"></a><span class="lineno"> 1003</span>                <span class="comment">// and then do the successor or predecessor swap and recursive</span></div>
+<div class="line"><a id="l01004" name="l01004"></a><span class="lineno"> 1004</span>                <span class="comment">// remove the next layer will successor or predecessor.</span></div>
+<div class="line"><a id="l01005" name="l01005"></a><span class="lineno"> 1005</span>                <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l01006" name="l01006"></a><span class="lineno"> 1006</span>                    <span class="keywordflow">if</span> (index &gt; 0) {</div>
+<div class="line"><a id="l01007" name="l01007"></a><span class="lineno"> 1007</span>                        <span class="comment">// left_child has left-sibling, we check if we can do a</span></div>
+<div class="line"><a id="l01008" name="l01008"></a><span class="lineno"> 1008</span>                        <span class="comment">// rotate</span></div>
+<div class="line"><a id="l01009" name="l01009"></a><span class="lineno"> 1009</span>                        <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *left_sibling = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItemLeftChild(index - 1);</div>
+<div class="line"><a id="l01010" name="l01010"></a><span class="lineno"> 1010</span>                        <span class="keywordflow">if</span> (left_sibling-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18">Is34Node</a>()) {</div>
+<div class="line"><a id="l01011" name="l01011"></a><span class="lineno"> 1011</span>                            <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9">RightRotate</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, index - 1);</div>
+<div class="line"><a id="l01012" name="l01012"></a><span class="lineno"> 1012</span>                            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l01013" name="l01013"></a><span class="lineno"> 1013</span>                        }</div>
+<div class="line"><a id="l01014" name="l01014"></a><span class="lineno"> 1014</span>                    }</div>
+<div class="line"><a id="l01015" name="l01015"></a><span class="lineno"> 1015</span> </div>
+<div class="line"><a id="l01016" name="l01016"></a><span class="lineno"> 1016</span>                    <span class="keywordflow">if</span> (index &lt; node-&gt;GetCount() - 1) {</div>
+<div class="line"><a id="l01017" name="l01017"></a><span class="lineno"> 1017</span>                        <span class="comment">// right_child has right-sibling, we check if we can do</span></div>
+<div class="line"><a id="l01018" name="l01018"></a><span class="lineno"> 1018</span>                        <span class="comment">// a rotate</span></div>
+<div class="line"><a id="l01019" name="l01019"></a><span class="lineno"> 1019</span>                        <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *right_sibling =</div>
+<div class="line"><a id="l01020" name="l01020"></a><span class="lineno"> 1020</span>                            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItemRightChild(index + 1);</div>
+<div class="line"><a id="l01021" name="l01021"></a><span class="lineno"> 1021</span>                        <span class="keywordflow">if</span> (right_sibling-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18">Is34Node</a>()) {</div>
+<div class="line"><a id="l01022" name="l01022"></a><span class="lineno"> 1022</span>                            <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e">LeftRotate</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, index + 1);</div>
+<div class="line"><a id="l01023" name="l01023"></a><span class="lineno"> 1023</span>                            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l01024" name="l01024"></a><span class="lineno"> 1024</span>                        }</div>
+<div class="line"><a id="l01025" name="l01025"></a><span class="lineno"> 1025</span>                    }</div>
+<div class="line"><a id="l01026" name="l01026"></a><span class="lineno"> 1026</span> </div>
+<div class="line"><a id="l01027" name="l01027"></a><span class="lineno"> 1027</span>                    <span class="comment">// we do a merge. We avoid merging the target item, which</span></div>
+<div class="line"><a id="l01028" name="l01028"></a><span class="lineno"> 1028</span>                    <span class="comment">// may trigger another merge in the recursion process.</span></div>
+<div class="line"><a id="l01029" name="l01029"></a><span class="lineno"> 1029</span>                    <span class="keywordflow">if</span> (index &gt; 0) {</div>
+<div class="line"><a id="l01030" name="l01030"></a><span class="lineno"> 1030</span>                        <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9">Merge</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, index - 1);</div>
+<div class="line"><a id="l01031" name="l01031"></a><span class="lineno"> 1031</span>                        <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l01032" name="l01032"></a><span class="lineno"> 1032</span>                    }</div>
+<div class="line"><a id="l01033" name="l01033"></a><span class="lineno"> 1033</span> </div>
+<div class="line"><a id="l01034" name="l01034"></a><span class="lineno"> 1034</span>                    <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9">Merge</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, index + 1);</div>
+<div class="line"><a id="l01035" name="l01035"></a><span class="lineno"> 1035</span> </div>
+<div class="line"><a id="l01036" name="l01036"></a><span class="lineno"> 1036</span>                } <span class="keywordflow">while</span> (<span class="keyword">false</span>);</div>
+<div class="line"><a id="l01037" name="l01037"></a><span class="lineno"> 1037</span>            }</div>
+<div class="line"><a id="l01038" name="l01038"></a><span class="lineno"> 1038</span> </div>
+<div class="line"><a id="l01039" name="l01039"></a><span class="lineno"> 1039</span>            <span class="comment">// refresh the left_child and right_child since they may be invalid</span></div>
+<div class="line"><a id="l01040" name="l01040"></a><span class="lineno"> 1040</span>            <span class="comment">// because of merge</span></div>
+<div class="line"><a id="l01041" name="l01041"></a><span class="lineno"> 1041</span>            left_child = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItemLeftChild(index);</div>
+<div class="line"><a id="l01042" name="l01042"></a><span class="lineno"> 1042</span>            right_child = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItemRightChild(index);</div>
+<div class="line"><a id="l01043" name="l01043"></a><span class="lineno"> 1043</span> </div>
+<div class="line"><a id="l01044" name="l01044"></a><span class="lineno"> 1044</span>            <span class="keywordflow">if</span> (left_child-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18">Is34Node</a>()) {</div>
+<div class="line"><a id="l01045" name="l01045"></a><span class="lineno"> 1045</span>                int64_t predecessor_item = <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657">GetTreeMaxItem</a>(left_child);</div>
+<div class="line"><a id="l01046" name="l01046"></a><span class="lineno"> 1046</span>                <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;SetItem(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItemIndex(item), predecessor_item);</div>
+<div class="line"><a id="l01047" name="l01047"></a><span class="lineno"> 1047</span> </div>
+<div class="line"><a id="l01048" name="l01048"></a><span class="lineno"> 1048</span>                <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = left_child;</div>
+<div class="line"><a id="l01049" name="l01049"></a><span class="lineno"> 1049</span>                item = predecessor_item;</div>
+<div class="line"><a id="l01050" name="l01050"></a><span class="lineno"> 1050</span>                <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l01051" name="l01051"></a><span class="lineno"> 1051</span>            }</div>
+<div class="line"><a id="l01052" name="l01052"></a><span class="lineno"> 1052</span> </div>
+<div class="line"><a id="l01053" name="l01053"></a><span class="lineno"> 1053</span>            <span class="keywordflow">if</span> (right_child-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18">Is34Node</a>()) {</div>
+<div class="line"><a id="l01054" name="l01054"></a><span class="lineno"> 1054</span>                int64_t successor_item = <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36">GetTreeMinItem</a>(right_child);</div>
+<div class="line"><a id="l01055" name="l01055"></a><span class="lineno"> 1055</span>                <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;SetItem(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItemIndex(item), successor_item);</div>
+<div class="line"><a id="l01056" name="l01056"></a><span class="lineno"> 1056</span>                <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = right_child;</div>
+<div class="line"><a id="l01057" name="l01057"></a><span class="lineno"> 1057</span>                item = successor_item;</div>
+<div class="line"><a id="l01058" name="l01058"></a><span class="lineno"> 1058</span>                <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l01059" name="l01059"></a><span class="lineno"> 1059</span>            }</div>
+<div class="line"><a id="l01060" name="l01060"></a><span class="lineno"> 1060</span>        }</div>
+<div class="line"><a id="l01061" name="l01061"></a><span class="lineno"> 1061</span> </div>
+<div class="line"><a id="l01062" name="l01062"></a><span class="lineno"> 1062</span>        <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *next_node = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetNextPossibleChild(item);</div>
+<div class="line"><a id="l01063" name="l01063"></a><span class="lineno"> 1063</span> </div>
+<div class="line"><a id="l01064" name="l01064"></a><span class="lineno"> 1064</span>        <span class="keywordflow">if</span> (next_node-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18">Is34Node</a>()) {</div>
+<div class="line"><a id="l01065" name="l01065"></a><span class="lineno"> 1065</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = next_node;</div>
+<div class="line"><a id="l01066" name="l01066"></a><span class="lineno"> 1066</span>            <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l01067" name="l01067"></a><span class="lineno"> 1067</span>        }</div>
+<div class="line"><a id="l01068" name="l01068"></a><span class="lineno"> 1068</span> </div>
+<div class="line"><a id="l01069" name="l01069"></a><span class="lineno"> 1069</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3">TryRightRotate</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, next_node)) {</div>
+<div class="line"><a id="l01070" name="l01070"></a><span class="lineno"> 1070</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = next_node;</div>
+<div class="line"><a id="l01071" name="l01071"></a><span class="lineno"> 1071</span>            <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l01072" name="l01072"></a><span class="lineno"> 1072</span>        }</div>
+<div class="line"><a id="l01073" name="l01073"></a><span class="lineno"> 1073</span> </div>
+<div class="line"><a id="l01074" name="l01074"></a><span class="lineno"> 1074</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9">TryLeftRotate</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, next_node)) {</div>
+<div class="line"><a id="l01075" name="l01075"></a><span class="lineno"> 1075</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = next_node;</div>
+<div class="line"><a id="l01076" name="l01076"></a><span class="lineno"> 1076</span>            <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l01077" name="l01077"></a><span class="lineno"> 1077</span>        }</div>
+<div class="line"><a id="l01078" name="l01078"></a><span class="lineno"> 1078</span> </div>
+<div class="line"><a id="l01079" name="l01079"></a><span class="lineno"> 1079</span>        <span class="comment">// get here means both left sibling and right sibling of next_node is</span></div>
+<div class="line"><a id="l01080" name="l01080"></a><span class="lineno"> 1080</span>        <span class="comment">// 2-node, so we do merge</span></div>
+<div class="line"><a id="l01081" name="l01081"></a><span class="lineno"> 1081</span>        int8_t child_index = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetChildIndex(next_node);</div>
+<div class="line"><a id="l01082" name="l01082"></a><span class="lineno"> 1082</span>        <span class="keywordflow">if</span> (child_index &gt; 0) {</div>
+<div class="line"><a id="l01083" name="l01083"></a><span class="lineno"> 1083</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9">Merge</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, child_index - 1);</div>
+<div class="line"><a id="l01084" name="l01084"></a><span class="lineno"> 1084</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l01085" name="l01085"></a><span class="lineno"> 1085</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9">Merge</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, child_index);</div>
+<div class="line"><a id="l01086" name="l01086"></a><span class="lineno"> 1086</span>        }</div>
+<div class="line"><a id="l01087" name="l01087"></a><span class="lineno"> 1087</span> </div>
+<div class="line"><a id="l01088" name="l01088"></a><span class="lineno"> 1088</span>    }  <span class="comment">// while</span></div>
+<div class="line"><a id="l01089" name="l01089"></a><span class="lineno"> 1089</span> </div>
+<div class="line"><a id="l01090" name="l01090"></a><span class="lineno"> 1090</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l01091" name="l01091"></a><span class="lineno"> 1091</span>}</div>
+</div>
+<div class="line"><a id="l01092" name="l01092"></a><span class="lineno"> 1092</span> </div>
+<div class="foldopen" id="foldopen01098" data-start="{" data-end="}">
+<div class="line"><a id="l01098" name="l01098"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657"> 1098</a></span>int64_t <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657">Tree234::GetTreeMaxItem</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *tree) {</div>
+<div class="line"><a id="l01099" name="l01099"></a><span class="lineno"> 1099</span>    assert(tree);</div>
+<div class="line"><a id="l01100" name="l01100"></a><span class="lineno"> 1100</span>    int64_t max = 0;</div>
+<div class="line"><a id="l01101" name="l01101"></a><span class="lineno"> 1101</span> </div>
+<div class="line"><a id="l01102" name="l01102"></a><span class="lineno"> 1102</span>    <span class="keywordflow">while</span> (tree) {</div>
+<div class="line"><a id="l01103" name="l01103"></a><span class="lineno"> 1103</span>        max = tree-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57">GetMaxItem</a>();</div>
+<div class="line"><a id="l01104" name="l01104"></a><span class="lineno"> 1104</span>        tree = tree-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94">GetRightmostChild</a>();</div>
+<div class="line"><a id="l01105" name="l01105"></a><span class="lineno"> 1105</span>    }</div>
+<div class="line"><a id="l01106" name="l01106"></a><span class="lineno"> 1106</span> </div>
+<div class="line"><a id="l01107" name="l01107"></a><span class="lineno"> 1107</span>    <span class="keywordflow">return</span> max;</div>
+<div class="line"><a id="l01108" name="l01108"></a><span class="lineno"> 1108</span>}</div>
+</div>
+<div class="line"><a id="l01109" name="l01109"></a><span class="lineno"> 1109</span> </div>
+<div class="foldopen" id="foldopen01115" data-start="{" data-end="}">
+<div class="line"><a id="l01115" name="l01115"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36"> 1115</a></span>int64_t <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36">Tree234::GetTreeMinItem</a>(<a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *tree) {</div>
+<div class="line"><a id="l01116" name="l01116"></a><span class="lineno"> 1116</span>    assert(tree);</div>
+<div class="line"><a id="l01117" name="l01117"></a><span class="lineno"> 1117</span>    int64_t min = 0;</div>
+<div class="line"><a id="l01118" name="l01118"></a><span class="lineno"> 1118</span> </div>
+<div class="line"><a id="l01119" name="l01119"></a><span class="lineno"> 1119</span>    <span class="keywordflow">while</span> (tree) {</div>
+<div class="line"><a id="l01120" name="l01120"></a><span class="lineno"> 1120</span>        min = tree-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71">GetMinItem</a>();</div>
+<div class="line"><a id="l01121" name="l01121"></a><span class="lineno"> 1121</span>        tree = tree-&gt;<a class="code hl_function" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e">GetLeftmostChild</a>();</div>
+<div class="line"><a id="l01122" name="l01122"></a><span class="lineno"> 1122</span>    }</div>
+<div class="line"><a id="l01123" name="l01123"></a><span class="lineno"> 1123</span> </div>
+<div class="line"><a id="l01124" name="l01124"></a><span class="lineno"> 1124</span>    <span class="keywordflow">return</span> min;</div>
+<div class="line"><a id="l01125" name="l01125"></a><span class="lineno"> 1125</span>}</div>
+</div>
+<div class="line"><a id="l01126" name="l01126"></a><span class="lineno"> 1126</span> </div>
+<div class="foldopen" id="foldopen01131" data-start="{" data-end="}">
+<div class="line"><a id="l01131" name="l01131"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165"> 1131</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165">Tree234::Print</a>(<span class="keyword">const</span> <span class="keywordtype">char</span> *file_name) {</div>
+<div class="line"><a id="l01132" name="l01132"></a><span class="lineno"> 1132</span>    <span class="keywordflow">if</span> (!file_name) {</div>
+<div class="line"><a id="l01133" name="l01133"></a><span class="lineno"> 1133</span>        file_name = <span class="stringliteral">&quot;out.dot&quot;</span>;</div>
+<div class="line"><a id="l01134" name="l01134"></a><span class="lineno"> 1134</span>    }</div>
+<div class="line"><a id="l01135" name="l01135"></a><span class="lineno"> 1135</span> </div>
+<div class="line"><a id="l01136" name="l01136"></a><span class="lineno"> 1136</span>    std::ofstream ofs;</div>
+<div class="line"><a id="l01137" name="l01137"></a><span class="lineno"> 1137</span> </div>
+<div class="line"><a id="l01138" name="l01138"></a><span class="lineno"> 1138</span>    ofs.open(file_name);</div>
+<div class="line"><a id="l01139" name="l01139"></a><span class="lineno"> 1139</span>    <span class="keywordflow">if</span> (!ofs) {</div>
+<div class="line"><a id="l01140" name="l01140"></a><span class="lineno"> 1140</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;create tree dot file failed, &quot;</span> &lt;&lt; file_name &lt;&lt; std::endl;</div>
+<div class="line"><a id="l01141" name="l01141"></a><span class="lineno"> 1141</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l01142" name="l01142"></a><span class="lineno"> 1142</span>    }</div>
+<div class="line"><a id="l01143" name="l01143"></a><span class="lineno"> 1143</span> </div>
+<div class="line"><a id="l01144" name="l01144"></a><span class="lineno"> 1144</span>    ofs &lt;&lt; <span class="stringliteral">&quot;digraph G {\n&quot;</span>;</div>
+<div class="line"><a id="l01145" name="l01145"></a><span class="lineno"> 1145</span>    ofs &lt;&lt; <span class="stringliteral">&quot;node [shape=record]\n&quot;</span>;</div>
+<div class="line"><a id="l01146" name="l01146"></a><span class="lineno"> 1146</span> </div>
+<div class="line"><a id="l01147" name="l01147"></a><span class="lineno"> 1147</span>    int64_t index = 0;</div>
+<div class="line"><a id="l01148" name="l01148"></a><span class="lineno"> 1148</span> </div>
+<div class="line"><a id="l01151" name="l01151"></a><span class="lineno"> 1151</span>    <span class="keyword">struct </span>NodeInfo {</div>
+<div class="line"><a id="l01152" name="l01152"></a><span class="lineno"> 1152</span>        <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;     </div>
+<div class="line"><a id="l01153" name="l01153"></a><span class="lineno"> 1153</span>        int64_t index;  </div>
+<div class="line"><a id="l01155" name="l01155"></a><span class="lineno"> 1155</span>    };</div>
+<div class="line"><a id="l01156" name="l01156"></a><span class="lineno"> 1156</span> </div>
+<div class="line"><a id="l01157" name="l01157"></a><span class="lineno"> 1157</span>    std::queue&lt;NodeInfo&gt; q;</div>
+<div class="line"><a id="l01158" name="l01158"></a><span class="lineno"> 1158</span> </div>
+<div class="line"><a id="l01159" name="l01159"></a><span class="lineno"> 1159</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">root_</a>) {</div>
+<div class="line"><a id="l01160" name="l01160"></a><span class="lineno"> 1160</span>        <span class="comment">// print root node</span></div>
+<div class="line"><a id="l01161" name="l01161"></a><span class="lineno"> 1161</span>        <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be">PrintNode</a>(ofs, <a class="code hl_variable" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">root_</a>, -1, index, 0);</div>
+<div class="line"><a id="l01162" name="l01162"></a><span class="lineno"> 1162</span> </div>
+<div class="line"><a id="l01163" name="l01163"></a><span class="lineno"> 1163</span>        NodeInfo ni{};</div>
+<div class="line"><a id="l01164" name="l01164"></a><span class="lineno"> 1164</span>        ni.node = <a class="code hl_variable" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">root_</a>;</div>
+<div class="line"><a id="l01165" name="l01165"></a><span class="lineno"> 1165</span>        ni.index = index;</div>
+<div class="line"><a id="l01166" name="l01166"></a><span class="lineno"> 1166</span> </div>
+<div class="line"><a id="l01167" name="l01167"></a><span class="lineno"> 1167</span>        q.push(ni);</div>
+<div class="line"><a id="l01168" name="l01168"></a><span class="lineno"> 1168</span> </div>
+<div class="line"><a id="l01169" name="l01169"></a><span class="lineno"> 1169</span>        <span class="keywordflow">while</span> (!q.empty()) {</div>
+<div class="line"><a id="l01170" name="l01170"></a><span class="lineno"> 1170</span>            NodeInfo node_info = q.front();</div>
+<div class="line"><a id="l01171" name="l01171"></a><span class="lineno"> 1171</span>            q.pop();</div>
+<div class="line"><a id="l01172" name="l01172"></a><span class="lineno"> 1172</span> </div>
+<div class="line"><a id="l01173" name="l01173"></a><span class="lineno"> 1173</span>            assert(node_info.node-&gt;GetCount() &gt; 0);</div>
+<div class="line"><a id="l01174" name="l01174"></a><span class="lineno"> 1174</span> </div>
+<div class="line"><a id="l01175" name="l01175"></a><span class="lineno"> 1175</span>            <span class="keywordflow">if</span> (!node_info.node-&gt;IsLeaf()) {</div>
+<div class="line"><a id="l01176" name="l01176"></a><span class="lineno"> 1176</span>                <span class="keywordflow">if</span> (node_info.node-&gt;GetCount() &gt; 0) {</div>
+<div class="line"><a id="l01177" name="l01177"></a><span class="lineno"> 1177</span>                    <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be">PrintNode</a>(ofs, node_info.node-&gt;GetChild(0), node_info.index,</div>
+<div class="line"><a id="l01178" name="l01178"></a><span class="lineno"> 1178</span>                              ++index, 0);</div>
+<div class="line"><a id="l01179" name="l01179"></a><span class="lineno"> 1179</span>                    ni.node = node_info.node-&gt;GetChild(0);</div>
+<div class="line"><a id="l01180" name="l01180"></a><span class="lineno"> 1180</span>                    ni.index = index;</div>
+<div class="line"><a id="l01181" name="l01181"></a><span class="lineno"> 1181</span>                    q.push(ni);</div>
+<div class="line"><a id="l01182" name="l01182"></a><span class="lineno"> 1182</span> </div>
+<div class="line"><a id="l01183" name="l01183"></a><span class="lineno"> 1183</span>                    <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be">PrintNode</a>(ofs, node_info.node-&gt;GetChild(1), node_info.index,</div>
+<div class="line"><a id="l01184" name="l01184"></a><span class="lineno"> 1184</span>                              ++index, 1);</div>
+<div class="line"><a id="l01185" name="l01185"></a><span class="lineno"> 1185</span>                    ni.node = node_info.node-&gt;GetChild(1);</div>
+<div class="line"><a id="l01186" name="l01186"></a><span class="lineno"> 1186</span>                    ni.index = index;</div>
+<div class="line"><a id="l01187" name="l01187"></a><span class="lineno"> 1187</span>                    q.push(ni);</div>
+<div class="line"><a id="l01188" name="l01188"></a><span class="lineno"> 1188</span>                }</div>
+<div class="line"><a id="l01189" name="l01189"></a><span class="lineno"> 1189</span> </div>
+<div class="line"><a id="l01190" name="l01190"></a><span class="lineno"> 1190</span>                <span class="keywordflow">if</span> (node_info.node-&gt;GetCount() &gt; 1) {</div>
+<div class="line"><a id="l01191" name="l01191"></a><span class="lineno"> 1191</span>                    <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be">PrintNode</a>(ofs, node_info.node-&gt;GetChild(2), node_info.index,</div>
+<div class="line"><a id="l01192" name="l01192"></a><span class="lineno"> 1192</span>                              ++index, 2);</div>
+<div class="line"><a id="l01193" name="l01193"></a><span class="lineno"> 1193</span>                    ni.node = node_info.node-&gt;GetChild(2);</div>
+<div class="line"><a id="l01194" name="l01194"></a><span class="lineno"> 1194</span>                    ni.index = index;</div>
+<div class="line"><a id="l01195" name="l01195"></a><span class="lineno"> 1195</span>                    q.push(ni);</div>
+<div class="line"><a id="l01196" name="l01196"></a><span class="lineno"> 1196</span>                }</div>
+<div class="line"><a id="l01197" name="l01197"></a><span class="lineno"> 1197</span> </div>
+<div class="line"><a id="l01198" name="l01198"></a><span class="lineno"> 1198</span>                <span class="keywordflow">if</span> (node_info.node-&gt;GetCount() &gt; 2) {</div>
+<div class="line"><a id="l01199" name="l01199"></a><span class="lineno"> 1199</span>                    <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be">PrintNode</a>(ofs, node_info.node-&gt;GetChild(3), node_info.index,</div>
+<div class="line"><a id="l01200" name="l01200"></a><span class="lineno"> 1200</span>                              ++index, 3);</div>
+<div class="line"><a id="l01201" name="l01201"></a><span class="lineno"> 1201</span>                    ni.node = node_info.node-&gt;GetChild(3);</div>
+<div class="line"><a id="l01202" name="l01202"></a><span class="lineno"> 1202</span>                    ni.index = index;</div>
+<div class="line"><a id="l01203" name="l01203"></a><span class="lineno"> 1203</span>                    q.push(ni);</div>
+<div class="line"><a id="l01204" name="l01204"></a><span class="lineno"> 1204</span>                }</div>
+<div class="line"><a id="l01205" name="l01205"></a><span class="lineno"> 1205</span>            }</div>
+<div class="line"><a id="l01206" name="l01206"></a><span class="lineno"> 1206</span>        }</div>
+<div class="line"><a id="l01207" name="l01207"></a><span class="lineno"> 1207</span>    }</div>
+<div class="line"><a id="l01208" name="l01208"></a><span class="lineno"> 1208</span> </div>
+<div class="line"><a id="l01209" name="l01209"></a><span class="lineno"> 1209</span>    ofs &lt;&lt; <span class="stringliteral">&quot;}\n&quot;</span>;</div>
+<div class="line"><a id="l01210" name="l01210"></a><span class="lineno"> 1210</span>    ofs.close();</div>
+<div class="line"><a id="l01211" name="l01211"></a><span class="lineno"> 1211</span>}</div>
+</div>
+<div class="line"><a id="l01212" name="l01212"></a><span class="lineno"> 1212</span> </div>
+<div class="foldopen" id="foldopen01226" data-start="{" data-end="}">
+<div class="line"><a id="l01226" name="l01226"></a><span class="lineno"><a class="line" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be"> 1226</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be">Tree234::PrintNode</a>(std::ofstream &amp;ofs, <a class="code hl_class" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, int64_t parent_index,</div>
+<div class="line"><a id="l01227" name="l01227"></a><span class="lineno"> 1227</span>                        int64_t index, int8_t parent_child_index) {</div>
+<div class="line"><a id="l01228" name="l01228"></a><span class="lineno"> 1228</span>    assert(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
+<div class="line"><a id="l01229" name="l01229"></a><span class="lineno"> 1229</span> </div>
+<div class="line"><a id="l01230" name="l01230"></a><span class="lineno"> 1230</span>    <span class="keywordflow">switch</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetCount()) {</div>
+<div class="line"><a id="l01231" name="l01231"></a><span class="lineno"> 1231</span>        <span class="keywordflow">case</span> 1:</div>
+<div class="line"><a id="l01232" name="l01232"></a><span class="lineno"> 1232</span>            ofs &lt;&lt; <span class="stringliteral">&quot;node_&quot;</span> &lt;&lt; index &lt;&lt; <span class="stringliteral">&quot; [label=\&quot;&lt;f0&gt; &quot;</span> &lt;&lt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItem(0)</div>
+<div class="line"><a id="l01233" name="l01233"></a><span class="lineno"> 1233</span>                &lt;&lt; <span class="stringliteral">&quot;\&quot;]\n&quot;</span>;</div>
+<div class="line"><a id="l01234" name="l01234"></a><span class="lineno"> 1234</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l01235" name="l01235"></a><span class="lineno"> 1235</span>        <span class="keywordflow">case</span> 2:</div>
+<div class="line"><a id="l01236" name="l01236"></a><span class="lineno"> 1236</span>            ofs &lt;&lt; <span class="stringliteral">&quot;node_&quot;</span> &lt;&lt; index &lt;&lt; <span class="stringliteral">&quot; [label=\&quot;&lt;f0&gt; &quot;</span> &lt;&lt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItem(0)</div>
+<div class="line"><a id="l01237" name="l01237"></a><span class="lineno"> 1237</span>                &lt;&lt; <span class="stringliteral">&quot; | &lt;f1&gt; &quot;</span> &lt;&lt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItem(1) &lt;&lt; <span class="stringliteral">&quot;\&quot;]\n&quot;</span>;</div>
+<div class="line"><a id="l01238" name="l01238"></a><span class="lineno"> 1238</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l01239" name="l01239"></a><span class="lineno"> 1239</span>        <span class="keywordflow">case</span> 3:</div>
+<div class="line"><a id="l01240" name="l01240"></a><span class="lineno"> 1240</span>            ofs &lt;&lt; <span class="stringliteral">&quot;node_&quot;</span> &lt;&lt; index &lt;&lt; <span class="stringliteral">&quot; [label=\&quot;&lt;f0&gt; &quot;</span> &lt;&lt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItem(0)</div>
+<div class="line"><a id="l01241" name="l01241"></a><span class="lineno"> 1241</span>                &lt;&lt; <span class="stringliteral">&quot; | &lt;f1&gt; &quot;</span> &lt;&lt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItem(1) &lt;&lt; <span class="stringliteral">&quot;| &lt;f2&gt; &quot;</span></div>
+<div class="line"><a id="l01242" name="l01242"></a><span class="lineno"> 1242</span>                &lt;&lt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;GetItem(2) &lt;&lt; <span class="stringliteral">&quot;\&quot;]\n&quot;</span>;</div>
+<div class="line"><a id="l01243" name="l01243"></a><span class="lineno"> 1243</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l01244" name="l01244"></a><span class="lineno"> 1244</span> </div>
+<div class="line"><a id="l01245" name="l01245"></a><span class="lineno"> 1245</span>        <span class="keywordflow">default</span>:</div>
+<div class="line"><a id="l01246" name="l01246"></a><span class="lineno"> 1246</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l01247" name="l01247"></a><span class="lineno"> 1247</span>    }</div>
+<div class="line"><a id="l01248" name="l01248"></a><span class="lineno"> 1248</span> </div>
+<div class="line"><a id="l01249" name="l01249"></a><span class="lineno"> 1249</span>    <span class="comment">// draw the edge</span></div>
+<div class="line"><a id="l01250" name="l01250"></a><span class="lineno"> 1250</span>    <span class="keywordflow">if</span> (parent_index &gt;= 0) {</div>
+<div class="line"><a id="l01251" name="l01251"></a><span class="lineno"> 1251</span>        ofs &lt;&lt; <span class="stringliteral">&quot;node_&quot;</span> &lt;&lt; parent_index &lt;&lt; <span class="stringliteral">&quot;:f&quot;</span></div>
+<div class="line"><a id="l01252" name="l01252"></a><span class="lineno"> 1252</span>            &lt;&lt; (parent_child_index == 0 ? 0 : parent_child_index - 1) &lt;&lt; <span class="stringliteral">&quot;:&quot;</span></div>
+<div class="line"><a id="l01253" name="l01253"></a><span class="lineno"> 1253</span>            &lt;&lt; (parent_child_index == 0 ? <span class="stringliteral">&quot;sw&quot;</span> : <span class="stringliteral">&quot;se&quot;</span>) &lt;&lt; <span class="stringliteral">&quot; -&gt; node_&quot;</span> &lt;&lt; index</div>
+<div class="line"><a id="l01254" name="l01254"></a><span class="lineno"> 1254</span>            &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l01255" name="l01255"></a><span class="lineno"> 1255</span>    }</div>
+<div class="line"><a id="l01256" name="l01256"></a><span class="lineno"> 1256</span>}</div>
+</div>
+<div class="line"><a id="l01257" name="l01257"></a><span class="lineno"> 1257</span>}  <span class="comment">// namespace tree_234</span></div>
+<div class="line"><a id="l01258" name="l01258"></a><span class="lineno"> 1258</span>}  <span class="comment">// namespace data_structures</span></div>
+<div class="line"><a id="l01259" name="l01259"></a><span class="lineno"> 1259</span> </div>
+<div class="line"><a id="l01260" name="l01260"></a><span class="lineno"> 1260</span> </div>
+<div class="foldopen" id="foldopen01263" data-start="{" data-end="}">
+<div class="line"><a id="l01263" name="l01263"></a><span class="lineno"><a class="line" href="../../db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243"> 1263</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>() {</div>
+<div class="line"><a id="l01264" name="l01264"></a><span class="lineno"> 1264</span>    std::array&lt;int16_t, 13&gt; arr = {3, 1, 5, 4, 2, 9, 10, 8, 7, 6, 16, 13, 14};</div>
+<div class="line"><a id="l01265" name="l01265"></a><span class="lineno"> 1265</span>    <a class="code hl_class" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">data_structures::tree_234::Tree234</a> tree;</div>
+<div class="line"><a id="l01266" name="l01266"></a><span class="lineno"> 1266</span> </div>
+<div class="line"><a id="l01267" name="l01267"></a><span class="lineno"> 1267</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i : arr) {</div>
+<div class="line"><a id="l01268" name="l01268"></a><span class="lineno"> 1268</span>        tree.<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">Insert</a>(i);</div>
+<div class="line"><a id="l01269" name="l01269"></a><span class="lineno"> 1269</span>    }</div>
+<div class="line"><a id="l01270" name="l01270"></a><span class="lineno"> 1270</span> </div>
+<div class="line"><a id="l01271" name="l01271"></a><span class="lineno"> 1271</span>    <span class="comment">// tree.Remove(10);</span></div>
+<div class="line"><a id="l01272" name="l01272"></a><span class="lineno"> 1272</span>    tree.<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11">Remove</a>(5);</div>
+<div class="line"><a id="l01273" name="l01273"></a><span class="lineno"> 1273</span>    tree.<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165">Print</a>();</div>
+<div class="line"><a id="l01274" name="l01274"></a><span class="lineno"> 1274</span>}</div>
+</div>
+<div class="line"><a id="l01275" name="l01275"></a><span class="lineno"> 1275</span> </div>
+<div class="foldopen" id="foldopen01281" data-start="{" data-end="}">
+<div class="line"><a id="l01281" name="l01281"></a><span class="lineno"><a class="line" href="../../db/dbc/tree__234_8cpp.html#af1ac73779b0fcfbbdce3976c0ca57342"> 1281</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>(int64_t n) {</div>
+<div class="line"><a id="l01282" name="l01282"></a><span class="lineno"> 1282</span>    <a class="code hl_class" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">data_structures::tree_234::Tree234</a> tree;</div>
+<div class="line"><a id="l01283" name="l01283"></a><span class="lineno"> 1283</span> </div>
+<div class="line"><a id="l01284" name="l01284"></a><span class="lineno"> 1284</span>    <span class="keywordflow">for</span> (int64_t i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l01285" name="l01285"></a><span class="lineno"> 1285</span>        tree.<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">Insert</a>(i);</div>
+<div class="line"><a id="l01286" name="l01286"></a><span class="lineno"> 1286</span>    }</div>
+<div class="line"><a id="l01287" name="l01287"></a><span class="lineno"> 1287</span> </div>
+<div class="line"><a id="l01288" name="l01288"></a><span class="lineno"> 1288</span>    tree.<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd">Traverse</a>();</div>
+<div class="line"><a id="l01289" name="l01289"></a><span class="lineno"> 1289</span>    tree.<a class="code hl_function" href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165">Print</a>((std::to_string(n) + <span class="stringliteral">&quot;.dot&quot;</span>).c_str());</div>
+<div class="line"><a id="l01290" name="l01290"></a><span class="lineno"> 1290</span>}</div>
+</div>
+<div class="line"><a id="l01291" name="l01291"></a><span class="lineno"> 1291</span> </div>
+<div class="foldopen" id="foldopen01298" data-start="{" data-end="}">
+<div class="line"><a id="l01298" name="l01298"></a><span class="lineno"><a class="line" href="../../db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97"> 1298</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[]) {</div>
+<div class="line"><a id="l01299" name="l01299"></a><span class="lineno"> 1299</span>    <span class="keywordflow">if</span> (argc &lt; 2) {</div>
+<div class="line"><a id="l01300" name="l01300"></a><span class="lineno"> 1300</span>        <a class="code hl_function" href="../../db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>();  <span class="comment">// execute 1st test</span></div>
+<div class="line"><a id="l01301" name="l01301"></a><span class="lineno"> 1301</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l01302" name="l01302"></a><span class="lineno"> 1302</span>        <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>(std::stoi(argv[1]));  <span class="comment">// execute 2nd test</span></div>
+<div class="line"><a id="l01303" name="l01303"></a><span class="lineno"> 1303</span>    }</div>
+<div class="line"><a id="l01304" name="l01304"></a><span class="lineno"> 1304</span> </div>
+<div class="line"><a id="l01305" name="l01305"></a><span class="lineno"> 1305</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l01306" name="l01306"></a><span class="lineno"> 1306</span>}</div>
+</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">data_structures::tree_234::Node</a></div><div class="ttdoc">2-3-4 tree node class</div><div class="ttdef"><b>Definition</b> <a href="#l00035">tree_234.cpp:35</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a164574a9209b5df66368530d090b32c4"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4">data_structures::tree_234::Node::GetChild</a></div><div class="ttdeci">Node * GetChild(int8_t index)</div><div class="ttdoc">Get the child pointer at position of index.</div><div class="ttdef"><b>Definition</b> <a href="#l00252">tree_234.cpp:252</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a22fd25c6c811c64b6b27b0850d8c532f"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f">data_structures::tree_234::Node::Contains</a></div><div class="ttdeci">bool Contains(int64_t item)</div><div class="ttdoc">Check if item is in the node.</div><div class="ttdef"><b>Definition</b> <a href="#l00092">tree_234.cpp:92</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a2753b6053b8c86c5bd987a44fdfa0a57"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57">data_structures::tree_234::Node::GetMaxItem</a></div><div class="ttdeci">int64_t GetMaxItem()</div><div class="ttdoc">Get max item (rightmost) in the current node.</div><div class="ttdef"><b>Definition</b> <a href="#l00120">tree_234.cpp:120</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a28944bb16ec22650b47fe3e80e3e13f8"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a28944bb16ec22650b47fe3e80e3e13f8">data_structures::tree_234::Node::RemoveItemByIndex</a></div><div class="ttdeci">Node * RemoveItemByIndex(int8_t index, bool keep_left)</div><div class="ttdoc">Insert a value to the index position.</div><div class="ttdef"><b>Definition</b> <a href="#l00217">tree_234.cpp:217</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a306a30931f54c84098b38d6bc8f4a956"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956">data_structures::tree_234::Node::InsertItemByIndex</a></div><div class="ttdeci">void InsertItemByIndex(int8_t index, int64_t item, Node *with_child, bool to_left=true)</div><div class="ttdoc">Insert a value to the index position.</div><div class="ttdef"><b>Definition</b> <a href="#l00189">tree_234.cpp:189</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a441cbee9896391f2b167d5aa7b4f8c95"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a441cbee9896391f2b167d5aa7b4f8c95">data_structures::tree_234::Node::GetItemRightChild</a></div><div class="ttdeci">Node * GetItemRightChild(int8_t item_index)</div><div class="ttdoc">Get right child of item at item_index.</div><div class="ttdef"><b>Definition</b> <a href="#l00291">tree_234.cpp:291</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a4808acb43668ff8cfd6f7cb44ceedad3"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3">data_structures::tree_234::Node::GetItem</a></div><div class="ttdeci">int64_t GetItem(int8_t index)</div><div class="ttdoc">Get item of the \index index.</div><div class="ttdef"><b>Definition</b> <a href="#l00133">tree_234.cpp:133</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a4a37381c0ef93d5ae2118b2e554974dd"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd">data_structures::tree_234::Node::IsFull</a></div><div class="ttdeci">bool IsFull()</div><div class="ttdoc">Check if node is a full (4-node)</div><div class="ttdef"><b>Definition</b> <a href="#l00073">tree_234.cpp:73</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a5438d0a47850f520b2262b5a42f75b71"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71">data_structures::tree_234::Node::GetMinItem</a></div><div class="ttdeci">int64_t GetMinItem()</div><div class="ttdoc">get min item (leftmost) in the current node</div><div class="ttdef"><b>Definition</b> <a href="#l00126">tree_234.cpp:126</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a607d8201b00b142bf1d6a34df2f936e8"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8">data_structures::tree_234::Node::IsLeaf</a></div><div class="ttdeci">bool IsLeaf()</div><div class="ttdoc">Check if node is a leaf.</div><div class="ttdef"><b>Definition</b> <a href="#l00067">tree_234.cpp:67</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a650f0ef26b7450e1addb5d80bb0ed629"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a650f0ef26b7450e1addb5d80bb0ed629">data_structures::tree_234::Node::GetItemIndex</a></div><div class="ttdeci">int8_t GetItemIndex(int64_t item)</div><div class="ttdoc">Get the index of the item in the node, 0-based.</div><div class="ttdef"><b>Definition</b> <a href="#l00107">tree_234.cpp:107</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a6c5f929afcbad5219646990edee22e18"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18">data_structures::tree_234::Node::Is34Node</a></div><div class="ttdeci">bool Is34Node()</div><div class="ttdoc">Check if node is a 3-node or 4-node, this is useful when we delete item from 2-3-4 tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00085">tree_234.cpp:85</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a731f9ae385840cf0a06d55e7f9924a94"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94">data_structures::tree_234::Node::GetRightmostChild</a></div><div class="ttdeci">Node * GetRightmostChild()</div><div class="ttdoc">Get rightmose child of the current node.</div><div class="ttdef"><b>Definition</b> <a href="#l00265">tree_234.cpp:265</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a8417d01c88b99ca56289843509fb71f9"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9">data_structures::tree_234::Node::items</a></div><div class="ttdeci">std::array&lt; int64_t, 3 &gt; items</div><div class="ttdoc">store items</div><div class="ttdef"><b>Definition</b> <a href="#l00315">tree_234.cpp:315</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a8e809ae85ae00e937f67ddb76951b6bb"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb">data_structures::tree_234::Node::InsertItem</a></div><div class="ttdeci">int InsertItem(int item)</div><div class="ttdoc">Insert item to the proper position of the node and return the position index.</div><div class="ttdef"><b>Definition</b> <a href="#l00163">tree_234.cpp:163</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a91322b3bb0b2b2175eb56e9e10d7db46"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46">data_structures::tree_234::Node::GetNextPossibleChild</a></div><div class="ttdeci">Node * GetNextPossibleChild(int64_t item)</div><div class="ttdoc">Get next node which is possibly contains item.</div><div class="ttdef"><b>Definition</b> <a href="#l00304">tree_234.cpp:304</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a934e6d53cfefae2b971e1241a8a4c921"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921">data_structures::tree_234::Node::count</a></div><div class="ttdeci">int8_t count</div><div class="ttdoc">track the current item count</div><div class="ttdef"><b>Definition</b> <a href="#l00319">tree_234.cpp:319</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_aaa89a3016b5dd1be3552321c34343cbc"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc">data_structures::tree_234::Node::SetItem</a></div><div class="ttdeci">void SetItem(int8_t index, int64_t new_item)</div><div class="ttdoc">Set item value at position of index.</div><div class="ttdef"><b>Definition</b> <a href="#l00140">tree_234.cpp:140</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_aac82e17daa088ede9ee00dc69c1e6f06"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06">data_structures::tree_234::Node::GetCount</a></div><div class="ttdeci">int8_t GetCount()</div><div class="ttdoc">Get the item count that current saved in the node.</div><div class="ttdef"><b>Definition</b> <a href="#l00050">tree_234.cpp:50</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_ab4e5f7b7b260bb81d9441652cc124c74"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74">data_structures::tree_234::Node::SetChild</a></div><div class="ttdeci">void SetChild(int8_t index, Node *child)</div><div class="ttdoc">Set child pointer to the position of index.</div><div class="ttdef"><b>Definition</b> <a href="#l00259">tree_234.cpp:259</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_ab654d7376d3449fdc78edab0e7fed06e"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab654d7376d3449fdc78edab0e7fed06e">data_structures::tree_234::Node::GetItemLeftChild</a></div><div class="ttdeci">Node * GetItemLeftChild(int8_t item_index)</div><div class="ttdoc">Get left child of item at item_index.</div><div class="ttdef"><b>Definition</b> <a href="#l00278">tree_234.cpp:278</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_ac6f619a1605cb46196360889fff4529e"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e">data_structures::tree_234::Node::GetLeftmostChild</a></div><div class="ttdeci">Node * GetLeftmostChild()</div><div class="ttdoc">Get leftmose child of the current node.</div><div class="ttdef"><b>Definition</b> <a href="#l00271">tree_234.cpp:271</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_ad5219979ea9a8baa3a273a9ec0f0c670"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5219979ea9a8baa3a273a9ec0f0c670">data_structures::tree_234::Node::Node</a></div><div class="ttdeci">Node(int64_t item)</div><div class="ttdoc">Node constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00041">tree_234.cpp:41</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_ad5d6b6ce5fab21ccc88c6bf3153eee5d"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d">data_structures::tree_234::Node::children</a></div><div class="ttdeci">std::array&lt; Node *, 4 &gt; children</div><div class="ttdoc">store the children pointers</div><div class="ttdef"><b>Definition</b> <a href="#l00317">tree_234.cpp:317</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_ad632a0440295bc88ceadae7478fe0d37"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad632a0440295bc88ceadae7478fe0d37">data_structures::tree_234::Node::GetChildIndex</a></div><div class="ttdeci">int8_t GetChildIndex(Node *child)</div><div class="ttdoc">Get the child's index of the children array.</div><div class="ttdef"><b>Definition</b> <a href="#l00237">tree_234.cpp:237</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_af564fd4b0992fff69f90de201542d3d1"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1">data_structures::tree_234::Node::SetCount</a></div><div class="ttdeci">void SetCount(int8_t c)</div><div class="ttdoc">Set the item count of the node.</div><div class="ttdef"><b>Definition</b> <a href="#l00061">tree_234.cpp:61</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_afd9f83e2d5d7f22f79c1348e98914631"><div class="ttname"><a href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631">data_structures::tree_234::Node::Is2Node</a></div><div class="ttdeci">bool Is2Node()</div><div class="ttdoc">Check if node is a 2-node.</div><div class="ttdef"><b>Definition</b> <a href="#l00079">tree_234.cpp:79</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">data_structures::tree_234::Tree234</a></div><div class="ttdoc">2-3-4 tree class</div><div class="ttdef"><b>Definition</b> <a href="#l00323">tree_234.cpp:323</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a07811b3c564a3a443b106c9aa717629d"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d">data_structures::tree_234::Tree234::InsertPreSplit</a></div><div class="ttdeci">void InsertPreSplit(int64_t item)</div><div class="ttdoc">A insert implementation of pre-split.</div><div class="ttdef"><b>Definition</b> <a href="#l00585">tree_234.cpp:585</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a11f0d016dff7f7e62b3dddb9fdf47805"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805">data_structures::tree_234::Tree234::MergeNode</a></div><div class="ttdeci">Node * MergeNode(Node *dst_node, Node *node)</div><div class="ttdoc">A helper function used during post-merge insert.</div><div class="ttdef"><b>Definition</b> <a href="#l00700">tree_234.cpp:700</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a273511e84a5243ffffe81be28bd24855"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a273511e84a5243ffffe81be28bd24855">data_structures::tree_234::Tree234::DeleteNode</a></div><div class="ttdeci">void DeleteNode(Node *tree)</div><div class="ttdoc">Recursive release the tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00547">tree_234.cpp:547</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a2e9a9db7792cf5383f4c4cc418255165"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165">data_structures::tree_234::Tree234::Print</a></div><div class="ttdeci">void Print(const char *file_name=nullptr)</div><div class="ttdoc">Print tree into a dot file.</div><div class="ttdef"><b>Definition</b> <a href="#l01131">tree_234.cpp:1131</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a348ea76c7629b2dcf740be062f970a36"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36">data_structures::tree_234::Tree234::root_</a></div><div class="ttdeci">Node * root_</div><div class="ttdoc">root node of the tree</div><div class="ttdef"><b>Definition</b> <a href="#l00538">tree_234.cpp:538</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a36f4d5f603f7edb7db7c73fb53ba14e9"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9">data_structures::tree_234::Tree234::Merge</a></div><div class="ttdeci">Node * Merge(Node *parent, int8_t index)</div><div class="ttdoc">Merge the item at index of the parent node, and its left and right child.</div><div class="ttdef"><b>Definition</b> <a href="#l00895">tree_234.cpp:895</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a370b625ca9f16bbef2b65e024ef78ea9"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9">data_structures::tree_234::Tree234::SplitNode</a></div><div class="ttdeci">Node * SplitNode(Node *node)</div><div class="ttdoc">Split a 4-node to 1 parent and 2 children, and return the parent node.</div><div class="ttdef"><b>Definition</b> <a href="#l00745">tree_234.cpp:745</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a5da1be3f5b5d967ebb36a201f3ebad11"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11">data_structures::tree_234::Tree234::Remove</a></div><div class="ttdeci">bool Remove(int64_t item)</div><div class="ttdoc">Remove item from tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00929">tree_234.cpp:929</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a61dd051a74e5f36c8dc03dae8dca6ef4"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4">data_structures::tree_234::Tree234::RemovePreMerge</a></div><div class="ttdeci">bool RemovePreMerge(Node *node, int64_t item)</div><div class="ttdoc">Main function implement the pre-merge remove operation.</div><div class="ttdef"><b>Definition</b> <a href="#l00937">tree_234.cpp:937</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a65a1235659356166a3e9b451c64fcc36"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36">data_structures::tree_234::Tree234::GetTreeMinItem</a></div><div class="ttdeci">int64_t GetTreeMinItem(Node *tree)</div><div class="ttdoc">Get the min item of the tree.</div><div class="ttdef"><b>Definition</b> <a href="#l01115">tree_234.cpp:1115</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a6749ebb40710c9752a2771eda03c6b3e"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">data_structures::tree_234::Tree234::Insert</a></div><div class="ttdeci">void Insert(int64_t item)</div><div class="ttdoc">Insert item to tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00655">tree_234.cpp:655</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_a84ab7b4fe7442b5e2eeed8c050bb86bd"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd">data_structures::tree_234::Tree234::Traverse</a></div><div class="ttdeci">void Traverse()</div><div class="ttdoc">In-order traverse.</div><div class="ttdef"><b>Definition</b> <a href="#l00562">tree_234.cpp:562</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_aa7e5e00033f38006a224f30bdbf3f703"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aa7e5e00033f38006a224f30bdbf3f703">data_structures::tree_234::Tree234::InsertPostMerge</a></div><div class="ttdeci">void InsertPostMerge(int64_t item)</div><div class="ttdoc">A insert implementation of post-merge.</div><div class="ttdef"><b>Definition</b> <a href="#l00637">tree_234.cpp:637</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_ac5361479dd996eb331759f33808657d9"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9">data_structures::tree_234::Tree234::TryLeftRotate</a></div><div class="ttdeci">bool TryLeftRotate(Node *parent, Node *to_child)</div><div class="ttdoc">A handy function to try if we can do a left rotate to the target node.</div><div class="ttdef"><b>Definition</b> <a href="#l00778">tree_234.cpp:778</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_ac85ba5abfd6d34dcd908b2afe6464657"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657">data_structures::tree_234::Tree234::GetTreeMaxItem</a></div><div class="ttdeci">int64_t GetTreeMaxItem(Node *tree)</div><div class="ttdoc">Get the max item of the tree.</div><div class="ttdef"><b>Definition</b> <a href="#l01098">tree_234.cpp:1098</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_ad37e29e2a4a6cc0eb65cbd5595e1da95"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95">data_structures::tree_234::Tree234::MergeNodeNotFull</a></div><div class="ttdeci">void MergeNodeNotFull(Node *dst_node, Node *node)</div><div class="ttdoc">Merge node to a not-full target node.</div><div class="ttdef"><b>Definition</b> <a href="#l00730">tree_234.cpp:730</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_ae58dca20f08eaf9313f6e7b0869c2d0e"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e">data_structures::tree_234::Tree234::LeftRotate</a></div><div class="ttdeci">void LeftRotate(Node *parent, int8_t index)</div><div class="ttdoc">Do the actual left rotate operation.</div><div class="ttdef"><b>Definition</b> <a href="#l00869">tree_234.cpp:869</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_ae68f8e62be02657c1287def6b38d7cc9"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9">data_structures::tree_234::Tree234::RightRotate</a></div><div class="ttdeci">void RightRotate(Node *parent, int8_t index)</div><div class="ttdoc">Do the actual right rotate operation.</div><div class="ttdef"><b>Definition</b> <a href="#l00845">tree_234.cpp:845</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_aec0642d1d151521ca7c70ea85cdb15d3"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3">data_structures::tree_234::Tree234::TryRightRotate</a></div><div class="ttdeci">bool TryRightRotate(Node *parent, Node *to_child)</div><div class="ttdoc">A handy function to try if we can do a right rotate to the target node.</div><div class="ttdef"><b>Definition</b> <a href="#l00813">tree_234.cpp:813</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_tree234_html_af260f0760344771bf8fce4fc9b1739be"><div class="ttname"><a href="../../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be">data_structures::tree_234::Tree234::PrintNode</a></div><div class="ttdeci">void PrintNode(std::ofstream &amp;ofs, Node *node, int64_t parent_index, int64_t index, int8_t parent_child_index)</div><div class="ttdoc">Print the tree to a dot file. You can convert it to picture with graphviz.</div><div class="ttdef"><b>Definition</b> <a href="#l01226">tree_234.cpp:1226</a></div></div>
+<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00187">dsu_path_compression.cpp:187</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html">data_structures</a></div><div class="ttdoc">for IO operations</div></div>
+<div class="ttc" id="anamespacetree__234_html"><div class="ttname"><a href="../../d6/dab/namespacetree__234.html">tree_234</a></div><div class="ttdoc">Functions for 2–3–4 tree</div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+<div class="ttc" id="atree__234_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">simple test to insert a given array and delete some item, and print the tree</div><div class="ttdef"><b>Definition</b> <a href="#l01263">tree_234.cpp:1263</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../db/dbc/tree__234_8cpp.html">tree_234.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/dbd/test__stack__students_8cpp_source.html b/db/dbd/test__stack__students_8cpp_source.html
new file mode 100644
index 000000000..9f14f2b12
--- /dev/null
+++ b/db/dbd/test__stack__students_8cpp_source.html
@@ -0,0 +1,198 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/test_stack_students.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/dbd/test__stack__students_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">test_stack_students.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * This program reads a data file consisting of students&#39; GPAs</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * followed by their names. The program then prints the highest</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * GPA and the names of the students with the highest GPA.</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * It uses stack to store the names of the students</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> * Run:</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> *     make all</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> *     ./main student.txt</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> ************************************************************</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment"> * */</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;fstream&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;iomanip&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;string&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &quot;<a class="code" href="../../df/d47/stack_8hpp.html">./stack.hpp</a>&quot;</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span>* argv[]) {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keywordtype">double</span> GPA = NAN;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    <span class="keywordtype">double</span> highestGPA = NAN;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    std::string name;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    assert(argc == 2);</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    std::ifstream infile;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <a class="code hl_class" href="../../d1/dc2/classstack.html">stack&lt;std::string&gt;</a> stk;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    infile.open(argv[1]);</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    std::cout &lt;&lt; std::fixed &lt;&lt; std::showpoint;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    std::cout &lt;&lt; std::setprecision(2);</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    infile &gt;&gt; GPA &gt;&gt; name;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    highestGPA = GPA;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordflow">while</span> (infile) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        <span class="keywordflow">if</span> (GPA &gt; highestGPA) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>            stk.<a class="code hl_function" href="../../d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092">clear</a>();</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>            stk.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(name);</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            highestGPA = GPA;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (GPA == highestGPA) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>            stk.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(name);</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        infile &gt;&gt; GPA &gt;&gt; name;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    }</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Highest GPA: &quot;</span> &lt;&lt; highestGPA &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Students the highest GPA are: &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">while</span> (!stk.<a class="code hl_function" href="../../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5">isEmptyStack</a>()) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        std::cout &lt;&lt; stk.<a class="code hl_function" href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">top</a>() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        stk.<a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>();</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>}</div>
+<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00019">stack.hpp:19</a></div></div>
+<div class="ttc" id="aclassstack_html_a163eb9a6206c874c9bf98d032fca11c5"><div class="ttname"><a href="../../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5">stack::isEmptyStack</a></div><div class="ttdeci">bool isEmptyStack() const</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00044">stack.hpp:44</a></div></div>
+<div class="ttc" id="aclassstack_html_a3647fb4418890f19e0dc414b8092b8b0"><div class="ttname"><a href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00062">stack.hpp:62</a></div></div>
+<div class="ttc" id="aclassstack_html_a6f13157faa1a762c59e67da8b9516092"><div class="ttname"><a href="../../d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092">stack::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00069">stack.hpp:69</a></div></div>
+<div class="ttc" id="aclassstack_html_a90df277532c23519aa7ac3c08ed90a1d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack::push</a></div><div class="ttdeci">void push(const value_type &amp;item)</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00047">stack.hpp:47</a></div></div>
+<div class="ttc" id="aclassstack_html_ae09630c4384903d187801921b2ddc709"><div class="ttname"><a href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">stack::top</a></div><div class="ttdeci">value_type top() const</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00056">stack.hpp:56</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="astack_8hpp_html"><div class="ttname"><a href="../../df/d47/stack_8hpp.html">stack.hpp</a></div><div class="ttdoc">This class specifies the basic operation on a stack as a linked list.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><b>test_stack_students.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/dc0/namespacebacktracking.html b/db/dc0/namespacebacktracking.html
index c6aee77a8..1a582da7e 100644
--- a/db/dc0/namespacebacktracking.html
+++ b/db/dc0/namespacebacktracking.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: backtracking Namespace Reference</title>
+<title>TheAlgorithms/C++: backtracking Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,7 @@ Classes</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a78540bcb5ef3473b2348cbc34748ec50" id="r_a78540bcb5ef3473b2348cbc34748ec50"><td class="memTemplParams" colspan="2">template&lt;size_t T&gt; </td></tr>
-<tr class="memitem:a78540bcb5ef3473b2348cbc34748ec50"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a78540bcb5ef3473b2348cbc34748ec50">minimax</a> (int depth, int node_index, bool is_max, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, T &gt; &amp;scores, double <a class="el" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>)</td></tr>
+<tr class="memitem:a78540bcb5ef3473b2348cbc34748ec50"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a78540bcb5ef3473b2348cbc34748ec50">minimax</a> (int depth, int node_index, bool is_max, const std::array&lt; int, T &gt; &amp;scores, double <a class="el" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>)</td></tr>
 <tr class="memdesc:a78540bcb5ef3473b2348cbc34748ec50"><td class="mdescLeft">&#160;</td><td class="mdescRight">Check which is the maximum/minimum number in the array.  <br /></td></tr>
 <tr class="separator:a78540bcb5ef3473b2348cbc34748ec50"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
@@ -132,21 +149,21 @@ Functions</h2></td></tr>
 <p>for assert</p>
 <p>Backtracking algorithms.</p>
 <p>for IO operations</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>for std::vector</p>
 <p>for assert for I/O operation</p>
 <p>Backtracking algorithms</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for IO operations</p>
+<p>for std::array for IO operations</p>
 <p>Backtracking algorithms</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></p>
+<p>for std::array</p>
 <p>Backtracking algorithms</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/count.html">std::count</a> for assert for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html">std::accumulate</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for log2</p>
+<p>for std::count for assert for IO operations for std::list for std::accumulate for std::vector</p>
+<p>for std::max, std::min for std::array for log2</p>
 <p>Backtracking algorithms</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for assert</p>
+<p>for std::array for assert</p>
 <p>Backtracking algorithms</p>
-<p>for IO operations for unordered_map for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>for IO operations for unordered_map for std::vector</p>
 <p>Backtracking 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></p>
+<p>for IO operations for std::vector</p>
 <p>Backtracking algorithms</p>
 <p>for assert</p>
 <p>Backtracking algorithms </p>
@@ -177,7 +194,7 @@ template&lt;size_t T&gt; </div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>scores</em></span>, </td>
+          <td class="paramtype">const std::array&lt; int, T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>scores</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -199,6 +216,8 @@ template&lt;size_t T&gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the maximum or minimum number </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/dfb/minimax_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../df/dfb/minimax_8cpp_source.html">minimax.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   40</span>                                                           {</div>
 <div class="line"><span class="lineno">   41</span>    <span class="keywordflow">if</span> (depth == <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>) {</div>
 <div class="line"><span class="lineno">   42</span>        <span class="keywordflow">return</span> scores[node_index];</div>
@@ -207,17 +226,10 @@ template&lt;size_t T&gt; </div>
 <div class="line"><span class="lineno">   45</span>    <span class="keywordtype">int</span> v1 = minimax(depth + 1, node_index * 2, !is_max, scores, <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>);</div>
 <div class="line"><span class="lineno">   46</span>    <span class="keywordtype">int</span> v2 = minimax(depth + 1, node_index * 2 + 1, !is_max, scores, <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>);</div>
 <div class="line"><span class="lineno">   47</span> </div>
-<div class="line"><span class="lineno">   48</span>    <span class="keywordflow">return</span> is_max ? <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(v1, v2) : <a class="code hl_namespace" href="../../d8/dcc/namespacestd.html">std</a>::min(v1, v2);</div>
+<div class="line"><span class="lineno">   48</span>    <span class="keywordflow">return</span> is_max ? std::max(v1, v2) : std::min(v1, v2);</div>
 <div class="line"><span class="lineno">   49</span>}</div>
-<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition</b> avltree.cpp:38</div></div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="anamespacestd_html"><div class="ttname"><a href="../../d8/dcc/namespacestd.html">std</a></div><div class="ttdoc">STL namespace.</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.svg" width="400" height="162"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00038">avltree.cpp:38</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.map b/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.map
deleted file mode 100644
index 5f1256fd2..000000000
--- a/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="backtracking::minimax" name="backtracking::minimax">
-<area shape="rect" id="Node000001" title="Check which is the maximum/minimum number in the array." alt="" coords="5,80,158,106"/>
-<area shape="poly" id="edge6_Node000001_Node000001" title=" " alt="" coords="54,81,49,71,52,62,63,56,82,53,101,56,111,63,108,67,99,61,81,59,65,61,56,65,55,71,59,78"/>
-<area shape="rect" id="Node000002" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="212,29,268,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="123,77,196,53,198,58,125,82"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="322,55,394,80"/>
-<area shape="poly" id="edge4_Node000001_Node000003" title=" " alt="" coords="158,83,306,70,307,75,158,89"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="206,131,274,156"/>
-<area shape="poly" id="edge5_Node000001_Node000004" title=" " alt="" coords="125,104,192,126,190,131,123,109"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="219,30,215,21,217,11,226,5,240,3,255,5,263,12,259,16,252,10,240,8,228,10,222,14,220,20,224,28"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="269,46,307,54,306,59,268,51"/>
-</map>
diff --git a/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.md5 b/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.md5
deleted file mode 100644
index ba550b848..000000000
--- a/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c8b7a04cbe2bf55b877010b7c942dac6
\ No newline at end of file
diff --git a/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.svg b/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.svg
deleted file mode 100644
index 2b71ec169..000000000
--- a/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph.svg
+++ /dev/null
@@ -1,128 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::minimax Pages: 1 -->
-<svg width="300pt" height="121pt"
- viewBox="0.00 0.00 299.75 121.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 117.25)">
-<title>backtracking::minimax</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Check which is the maximum/minimum number in the array.">
-<polygon fill="#999999" stroke="#666666" points="114.25,-57.25 0,-57.25 0,-38 114.25,-38 114.25,-57.25"/>
-<text text-anchor="middle" x="57.12" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::minimax</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge6_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge6_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.53,-57.54C30.05,-66.15 36.25,-75.25 57.12,-75.25 68.54,-75.25 75.57,-72.53 78.2,-68.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.65,-68.01 76.05,-59.02 74.81,-69.54 81.65,-68.01"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197,-95.25 154.75,-95.25 154.75,-76 197,-76 197,-95.25"/>
-<text text-anchor="middle" x="175.88" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.11,-57.71C106.06,-63.23 127.01,-70.05 143.96,-75.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.4,-78.74 152.99,-78.5 144.57,-72.08 142.4,-78.74"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.75,-76.25 237.5,-76.25 237.5,-57 291.75,-57 291.75,-76.25"/>
-<text text-anchor="middle" x="264.62" y="-62.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.55,-52.84C149.95,-56.12 194.63,-60.25 225.8,-63.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.26,-66.59 235.54,-64.03 225.9,-59.62 225.26,-66.59"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.5,-19.25 150.25,-19.25 150.25,0 201.5,0 201.5,-19.25"/>
-<text text-anchor="middle" x="175.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.11,-37.54C104.58,-32.5 123.39,-26.38 139.44,-21.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.17,-24.6 148.59,-18.18 138,-17.95 140.17,-24.6"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.98,-95.54C155.64,-104.15 160.27,-113.25 175.88,-113.25 184.41,-113.25 189.66,-110.53 191.63,-106.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.12,-106.32 190.02,-97.03 188.22,-107.47 195.12,-106.32"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.43,-81.12C206,-79.25 216.24,-77 226.06,-74.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.79,-78.28 235.81,-72.72 225.29,-71.44 226.79,-78.28"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph_org.svg b/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph_org.svg
deleted file mode 100644
index a0df8631c..000000000
--- a/db/dc0/namespacebacktracking_a78540bcb5ef3473b2348cbc34748ec50_cgraph_org.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::minimax Pages: 1 -->
-<svg width="300pt" height="121pt"
- viewBox="0.00 0.00 299.75 121.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 117.25)">
-<title>backtracking::minimax</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Check which is the maximum/minimum number in the array.">
-<polygon fill="#999999" stroke="#666666" points="114.25,-57.25 0,-57.25 0,-38 114.25,-38 114.25,-57.25"/>
-<text text-anchor="middle" x="57.12" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::minimax</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge6_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge6_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.53,-57.54C30.05,-66.15 36.25,-75.25 57.12,-75.25 68.54,-75.25 75.57,-72.53 78.2,-68.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.65,-68.01 76.05,-59.02 74.81,-69.54 81.65,-68.01"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197,-95.25 154.75,-95.25 154.75,-76 197,-76 197,-95.25"/>
-<text text-anchor="middle" x="175.88" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.11,-57.71C106.06,-63.23 127.01,-70.05 143.96,-75.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.4,-78.74 152.99,-78.5 144.57,-72.08 142.4,-78.74"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.75,-76.25 237.5,-76.25 237.5,-57 291.75,-57 291.75,-76.25"/>
-<text text-anchor="middle" x="264.62" y="-62.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.55,-52.84C149.95,-56.12 194.63,-60.25 225.8,-63.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.26,-66.59 235.54,-64.03 225.9,-59.62 225.26,-66.59"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.5,-19.25 150.25,-19.25 150.25,0 201.5,0 201.5,-19.25"/>
-<text text-anchor="middle" x="175.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.11,-37.54C104.58,-32.5 123.39,-26.38 139.44,-21.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.17,-24.6 148.59,-18.18 138,-17.95 140.17,-24.6"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.98,-95.54C155.64,-104.15 160.27,-113.25 175.88,-113.25 184.41,-113.25 189.66,-110.53 191.63,-106.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.12,-106.32 190.02,-97.03 188.22,-107.47 195.12,-106.32"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.43,-81.12C206,-79.25 216.24,-77 226.06,-74.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.79,-78.28 235.81,-72.72 225.29,-71.44 226.79,-78.28"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/dc4/floyd__cycle__detection__algo_8cpp.html b/db/dc4/floyd__cycle__detection__algo_8cpp.html
index 57d15f71f..29e4b42c8 100644
--- a/db/dc4/floyd__cycle__detection__algo_8cpp.html
+++ b/db/dc4/floyd__cycle__detection__algo_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: search/floyd_cycle_detection_algo.cpp File Reference</title>
+<title>TheAlgorithms/C++: search/floyd_cycle_detection_algo.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for floyd_cycle_detection_algo.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d78/floyd__cycle__detection__algo_8cpp__incl.svg" width="336" height="126"><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">
+</div>
+<p><a href="../../db/dc4/floyd__cycle__detection__algo_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dca/namespacesearch.html">search</a></td></tr>
@@ -135,7 +154,7 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a81ffc7a2c6bf530c8a496864e7a3ad88" id="r_a81ffc7a2c6bf530c8a496864e7a3ad88"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a81ffc7a2c6bf530c8a496864e7a3ad88"><td class="memTemplItemLeft" align="right" valign="top">int32_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a81ffc7a2c6bf530c8a496864e7a3ad88">search::cycle_detection::duplicateNumber</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;in_arr, const uint32_t &amp;n)</td></tr>
+<tr class="memitem:a81ffc7a2c6bf530c8a496864e7a3ad88"><td class="memTemplItemLeft" align="right" valign="top">int32_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a81ffc7a2c6bf530c8a496864e7a3ad88">search::cycle_detection::duplicateNumber</a> (const std::vector&lt; T &gt; &amp;in_arr, const uint32_t &amp;n)</td></tr>
 <tr class="memdesc:a81ffc7a2c6bf530c8a496864e7a3ad88"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function implements search algorithm.  <br /></td></tr>
 <tr class="separator:a81ffc7a2c6bf530c8a496864e7a3ad88"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Cycle_detection" target="_blank">Floyd's Cycle Detection</a> algorithm. </p>
 <p>Given an array of integers containing 'n + 1' integers, where each integer is in the range [1, n] inclusive. If there is only one duplicate number in the input array, this algorithm returns the duplicate number in O(1) space and the time complexity is less than O(n^2) without modifying the original array, otherwise, it returns -1. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Swastyy" target="_blank">Swastika Gupta</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../db/dc4/floyd__cycle__detection__algo_8cpp_source.html">floyd_cycle_detection_algo.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a81ffc7a2c6bf530c8a496864e7a3ad88" name="a81ffc7a2c6bf530c8a496864e7a3ad88"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a81ffc7a2c6bf530c8a496864e7a3ad88">&#9670;&#160;</a></span>duplicateNumber()</h2>
@@ -160,7 +181,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">int32_t search::cycle_detection::duplicateNumber </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>in_arr</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>in_arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -185,6 +206,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the duplicate number </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dc4/floyd__cycle__detection__algo_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../db/dc4/floyd__cycle__detection__algo_8cpp_source.html">floyd_cycle_detection_algo.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   37</span>                                                                       {</div>
 <div class="line"><span class="lineno">   38</span>    <span class="keywordflow">if</span> (n == 0 ||</div>
 <div class="line"><span class="lineno">   39</span>        n == 1) {  <span class="comment">// to find duplicate in an array its size should be atleast 2</span></div>
@@ -205,12 +228,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   54</span>    }</div>
 <div class="line"><span class="lineno">   55</span>    <span class="keywordflow">return</span> tortoise;</div>
 <div class="line"><span class="lineno">   56</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/dc4/floyd__cycle__detection__algo_8cpp_a81ffc7a2c6bf530c8a496864e7a3ad88_cgraph.svg" width="171" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -230,17 +248,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dc4/floyd__cycle__detection__algo_8cpp_source.html#l00095">95</a> of file <a class="el" href="../../db/dc4/floyd__cycle__detection__algo_8cpp_source.html">floyd_cycle_detection_algo.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   95</span>           {</div>
 <div class="line"><span class="lineno">   96</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   97</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   98</span>}</div>
-<div class="ttc" id="afloyd__cycle__detection__algo_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> floyd_cycle_detection_algo.cpp:64</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/dc4/floyd__cycle__detection__algo_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="315" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afloyd__cycle__detection__algo_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dc4/floyd__cycle__detection__algo_8cpp_source.html#l00064">floyd_cycle_detection_algo.cpp:64</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -268,42 +283,35 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dc4/floyd__cycle__detection__algo_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../db/dc4/floyd__cycle__detection__algo_8cpp_source.html">floyd_cycle_detection_algo.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   64</span>                   {</div>
 <div class="line"><span class="lineno">   65</span>    <span class="comment">// 1st test</span></div>
 <div class="line"><span class="lineno">   66</span>    <span class="comment">// [3, 4, 8, 5, 9, 1, 2, 6, 7, 4] return 4</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&lt;uint32_t&gt;</a> array1 = {3, 4, 8, 5, 9, 1, 2, 6, 7, 4};</div>
-<div class="line"><span class="lineno">   68</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
-<div class="line"><span class="lineno">   69</span>    assert(search::cycle_detection::duplicateNumber(array1, array1.<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">   67</span>    std::vector&lt;uint32_t&gt; array1 = {3, 4, 8, 5, 9, 1, 2, 6, 7, 4};</div>
+<div class="line"><span class="lineno">   68</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
+<div class="line"><span class="lineno">   69</span>    assert(search::cycle_detection::duplicateNumber(array1, array1.size()) ==</div>
 <div class="line"><span class="lineno">   70</span>           4);  <span class="comment">// here the duplicate number is 4</span></div>
-<div class="line"><span class="lineno">   71</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   72</span> </div>
 <div class="line"><span class="lineno">   73</span>    <span class="comment">// 2nd test</span></div>
 <div class="line"><span class="lineno">   74</span>    <span class="comment">// [1, 2, 3, 4, 2] return 2</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&lt;uint32_t&gt;</a> array2 = {1, 2, 3, 4, 2};</div>
-<div class="line"><span class="lineno">   76</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
-<div class="line"><span class="lineno">   77</span>    assert(search::cycle_detection::duplicateNumber(array2, array2.<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">   75</span>    std::vector&lt;uint32_t&gt; array2 = {1, 2, 3, 4, 2};</div>
+<div class="line"><span class="lineno">   76</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
+<div class="line"><span class="lineno">   77</span>    assert(search::cycle_detection::duplicateNumber(array2, array2.size()) ==</div>
 <div class="line"><span class="lineno">   78</span>           2);  <span class="comment">// here the duplicate number is 2</span></div>
-<div class="line"><span class="lineno">   79</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   79</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   80</span> </div>
 <div class="line"><span class="lineno">   81</span>    <span class="comment">// 3rd test</span></div>
 <div class="line"><span class="lineno">   82</span>    <span class="comment">// [] return -1</span></div>
-<div class="line"><span class="lineno">   83</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a> array3 = {};</div>
-<div class="line"><span class="lineno">   84</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
-<div class="line"><span class="lineno">   85</span>    assert(search::cycle_detection::duplicateNumber(array3, array3.<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">   83</span>    std::vector&lt;uint32_t&gt; array3 = {};</div>
+<div class="line"><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
+<div class="line"><span class="lineno">   85</span>    assert(search::cycle_detection::duplicateNumber(array3, array3.size()) ==</div>
 <div class="line"><span class="lineno">   86</span>           -1);  <span class="comment">// since the input array is empty no duplicate number exists in</span></div>
 <div class="line"><span class="lineno">   87</span>                 <span class="comment">// this case</span></div>
-<div class="line"><span class="lineno">   88</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   88</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   89</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="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="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>
-</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="../../db/dc4/floyd__cycle__detection__algo_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="218" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/db/dc4/floyd__cycle__detection__algo_8cpp_a81ffc7a2c6bf530c8a496864e7a3ad88_cgraph.map b/db/dc4/floyd__cycle__detection__algo_8cpp_a81ffc7a2c6bf530c8a496864e7a3ad88_cgraph.map
deleted file mode 100644
index 14d9ac85d..000000000
--- a/db/dc4/floyd__cycle__detection__algo_8cpp_a81ffc7a2c6bf530c8a496864e7a3ad88_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="search::cycle_detection::duplicateNumber" name="search::cycle_detection::duplicateNumber">
-<area shape="rect" id="Node000001" title="The main function implements search algorithm." alt="" coords="5,29,165,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="54,29,53,19,58,11,69,5,85,3,103,5,113,11,110,16,101,10,85,8,70,10,61,14,58,20,59,28"/>
-</map>
diff --git a/db/dc4/floyd__cycle__detection__algo_8cpp_a81ffc7a2c6bf530c8a496864e7a3ad88_cgraph.md5 b/db/dc4/floyd__cycle__detection__algo_8cpp_a81ffc7a2c6bf530c8a496864e7a3ad88_cgraph.md5
deleted file mode 100644
index 34bb0f05f..000000000
--- a/db/dc4/floyd__cycle__detection__algo_8cpp_a81ffc7a2c6bf530c8a496864e7a3ad88_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-45abc3a77e4b8e859d64946412573aa5
\ No newline at end of file
diff --git a/db/dc4/floyd__cycle__detection__algo_8cpp_a81ffc7a2c6bf530c8a496864e7a3ad88_cgraph.svg b/db/dc4/floyd__cycle__detection__algo_8cpp_a81ffc7a2c6bf530c8a496864e7a3ad88_cgraph.svg
deleted file mode 100644
index 6a76d56b9..000000000
--- a/db/dc4/floyd__cycle__detection__algo_8cpp_a81ffc7a2c6bf530c8a496864e7a3ad88_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: search::cycle_detection::duplicateNumber Pages: 1 -->
-<svg width="128pt" height="57pt"
- viewBox="0.00 0.00 127.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>search::cycle_detection::duplicateNumber</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function implements search algorithm.">
-<polygon fill="#999999" stroke="#666666" points="119.5,-30.5 0,-30.5 0,0 119.5,0 119.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">search::cycle_detection</text>
-<text text-anchor="middle" x="59.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::duplicateNumber</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.57,-30.99C34.25,-40.06 41.31,-48.5 59.75,-48.5 69.83,-48.5 76.51,-45.97 79.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.25,-42.79 80.77,-32.49 76.28,-42.09 83.25,-42.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/dc4/floyd__cycle__detection__algo_8cpp_a81ffc7a2c6bf530c8a496864e7a3ad88_cgraph_org.svg b/db/dc4/floyd__cycle__detection__algo_8cpp_a81ffc7a2c6bf530c8a496864e7a3ad88_cgraph_org.svg
deleted file mode 100644
index 21ddadd94..000000000
--- a/db/dc4/floyd__cycle__detection__algo_8cpp_a81ffc7a2c6bf530c8a496864e7a3ad88_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: search::cycle_detection::duplicateNumber Pages: 1 -->
-<svg width="128pt" height="57pt"
- viewBox="0.00 0.00 127.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>search::cycle_detection::duplicateNumber</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function implements search algorithm.">
-<polygon fill="#999999" stroke="#666666" points="119.5,-30.5 0,-30.5 0,0 119.5,0 119.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">search::cycle_detection</text>
-<text text-anchor="middle" x="59.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::duplicateNumber</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.57,-30.99C34.25,-40.06 41.31,-48.5 59.75,-48.5 69.83,-48.5 76.51,-45.97 79.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.25,-42.79 80.77,-32.49 76.28,-42.09 83.25,-42.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/dc4/floyd__cycle__detection__algo_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/db/dc4/floyd__cycle__detection__algo_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index b91b36709..000000000
--- a/db/dc4/floyd__cycle__detection__algo_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,31,49,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="119,5,190,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,37,103,26,104,31,49,42"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="97,55,212,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="49,45,82,51,81,56,48,50"/>
-</map>
diff --git a/db/dc4/floyd__cycle__detection__algo_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/db/dc4/floyd__cycle__detection__algo_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 32293e2cd..000000000
--- a/db/dc4/floyd__cycle__detection__algo_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9ede37fefc7d80f72bb03b7e9e2bb88e
\ No newline at end of file
diff --git a/db/dc4/floyd__cycle__detection__algo_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/db/dc4/floyd__cycle__detection__algo_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index d0d037cc6..000000000
--- a/db/dc4/floyd__cycle__detection__algo_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="163pt" height="64pt"
- viewBox="0.00 0.00 163.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.5,-56.25 85,-56.25 85,-37 138.5,-37 138.5,-56.25"/>
-<text text-anchor="middle" x="111.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-30.76C43.82,-33.02 59.34,-36.18 73.61,-39.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.69,-42.46 83.19,-41.02 74.09,-35.6 72.69,-42.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155,-19.25 68.5,-19.25 68.5,0 155,0 155,-19.25"/>
-<text text-anchor="middle" x="111.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-24.65C39.62,-23.32 48.25,-21.66 57.23,-19.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.6,-23.42 66.76,-18.09 56.28,-16.55 57.6,-23.42"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/dc4/floyd__cycle__detection__algo_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/db/dc4/floyd__cycle__detection__algo_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 4c2518914..000000000
--- a/db/dc4/floyd__cycle__detection__algo_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="163pt" height="64pt"
- viewBox="0.00 0.00 163.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.5,-56.25 85,-56.25 85,-37 138.5,-37 138.5,-56.25"/>
-<text text-anchor="middle" x="111.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-30.76C43.82,-33.02 59.34,-36.18 73.61,-39.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.69,-42.46 83.19,-41.02 74.09,-35.6 72.69,-42.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155,-19.25 68.5,-19.25 68.5,0 155,0 155,-19.25"/>
-<text text-anchor="middle" x="111.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-24.65C39.62,-23.32 48.25,-21.66 57.23,-19.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.6,-23.42 66.76,-18.09 56.28,-16.55 57.6,-23.42"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/dc4/floyd__cycle__detection__algo_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/dc4/floyd__cycle__detection__algo_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 1a02e0e80..000000000
--- a/db/dc4/floyd__cycle__detection__algo_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,31,146,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,41,87,41,87,46,55,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="216,5,287,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,37,200,26,201,31,147,42"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="194,55,309,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="147,45,179,51,178,56,146,50"/>
-</map>
diff --git a/db/dc4/floyd__cycle__detection__algo_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/dc4/floyd__cycle__detection__algo_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 7472ccf18..000000000
--- a/db/dc4/floyd__cycle__detection__algo_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6a8d5f7a7c985fe869dd7b69e305c106
\ No newline at end of file
diff --git a/db/dc4/floyd__cycle__detection__algo_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/dc4/floyd__cycle__detection__algo_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 174a1407a..000000000
--- a/db/dc4/floyd__cycle__detection__algo_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="236pt" height="64pt"
- viewBox="0.00 0.00 236.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="211.5,-56.25 158,-56.25 158,-37 211.5,-37 211.5,-56.25"/>
-<text text-anchor="middle" x="184.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-30.76C116.82,-33.02 132.34,-36.18 146.61,-39.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.69,-42.46 156.19,-41.02 147.09,-35.6 145.69,-42.46"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228,-19.25 141.5,-19.25 141.5,0 228,0 228,-19.25"/>
-<text text-anchor="middle" x="184.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-24.65C112.62,-23.32 121.25,-21.66 130.23,-19.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.6,-23.42 139.76,-18.09 129.28,-16.55 130.6,-23.42"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/dc4/floyd__cycle__detection__algo_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/db/dc4/floyd__cycle__detection__algo_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 4c4c2c56f..000000000
--- a/db/dc4/floyd__cycle__detection__algo_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="236pt" height="64pt"
- viewBox="0.00 0.00 236.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-37.25 73,-37.25 73,-18 105.5,-18 105.5,-37.25"/>
-<text text-anchor="middle" x="89.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-27.62C44.58,-27.62 53.31,-27.62 61.45,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-31.13 71.2,-27.63 61.2,-24.13 61.2,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="211.5,-56.25 158,-56.25 158,-37 211.5,-37 211.5,-56.25"/>
-<text text-anchor="middle" x="184.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-30.76C116.82,-33.02 132.34,-36.18 146.61,-39.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.69,-42.46 156.19,-41.02 147.09,-35.6 145.69,-42.46"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228,-19.25 141.5,-19.25 141.5,0 228,0 228,-19.25"/>
-<text text-anchor="middle" x="184.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-24.65C112.62,-23.32 121.25,-21.66 130.23,-19.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.6,-23.42 139.76,-18.09 129.28,-16.55 130.6,-23.42"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/dc4/floyd__cycle__detection__algo_8cpp_source.html b/db/dc4/floyd__cycle__detection__algo_8cpp_source.html
new file mode 100644
index 000000000..ee1c4dc1d
--- /dev/null
+++ b/db/dc4/floyd__cycle__detection__algo_8cpp_source.html
@@ -0,0 +1,210 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: search/floyd_cycle_detection_algo.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/dc4/floyd__cycle__detection__algo_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">floyd_cycle_detection_algo.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a> {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../da/d82/namespacecycle__detection.html">cycle_detection</a> {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="}">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88">   37</a></span>int32_t <a class="code hl_function" href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88">duplicateNumber</a>(<span class="keyword">const</span> std::vector&lt;T&gt; &amp;in_arr, <span class="keyword">const</span> uint32_t &amp;n) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">if</span> (n == 0 ||</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        n == 1) {  <span class="comment">// to find duplicate in an array its size should be atleast 2</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    }</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    uint32_t tortoise = in_arr[0];  <span class="comment">// variable tortoise is used for the longer</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>                                    <span class="comment">// jumps in the array</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    uint32_t hare =</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        in_arr[0];  <span class="comment">// variable hare is used for shorter jumps in the array</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        tortoise = in_arr[tortoise];</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        hare = in_arr[in_arr[hare]];</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    } <span class="keywordflow">while</span> (tortoise != hare);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    tortoise = in_arr[0];</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordflow">while</span> (tortoise != hare) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        tortoise = in_arr[tortoise];</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        hare = in_arr[hare];</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordflow">return</span> tortoise;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>}</div>
+</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>}  <span class="comment">// namespace cycle_detection</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}  <span class="comment">// namespace search</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="foldopen" id="foldopen00064" data-start="{" data-end="}">
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   64</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="comment">// 1st test</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="comment">// [3, 4, 8, 5, 9, 1, 2, 6, 7, 4] return 4</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    std::vector&lt;uint32_t&gt; array1 = {3, 4, 8, 5, 9, 1, 2, 6, 7, 4};</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    assert(search::cycle_detection::duplicateNumber(array1, array1.size()) ==</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>           4);  <span class="comment">// here the duplicate number is 4</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="comment">// 2nd test</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="comment">// [1, 2, 3, 4, 2] return 2</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    std::vector&lt;uint32_t&gt; array2 = {1, 2, 3, 4, 2};</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    assert(search::cycle_detection::duplicateNumber(array2, array2.size()) ==</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>           2);  <span class="comment">// here the duplicate number is 2</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="comment">// 3rd test</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="comment">// [] return -1</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    std::vector&lt;uint32_t&gt; array3 = {};</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    assert(search::cycle_detection::duplicateNumber(array3, array3.size()) ==</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>           -1);  <span class="comment">// since the input array is empty no duplicate number exists in</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>                 <span class="comment">// this case</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>}</div>
+</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="foldopen" id="foldopen00095" data-start="{" data-end="}">
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   95</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <a class="code hl_function" href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>}</div>
+</div>
+<div class="ttc" id="afloyd__cycle__detection__algo_8cpp_html_a81ffc7a2c6bf530c8a496864e7a3ad88"><div class="ttname"><a href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88">search::cycle_detection::duplicateNumber</a></div><div class="ttdeci">int32_t duplicateNumber(const std::vector&lt; T &gt; &amp;in_arr, const uint32_t &amp;n)</div><div class="ttdoc">The main function implements search algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00037">floyd_cycle_detection_algo.cpp:37</a></div></div>
+<div class="ttc" id="afloyd__cycle__detection__algo_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../db/dc4/floyd__cycle__detection__algo_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> <a href="#l00064">floyd_cycle_detection_algo.cpp:64</a></div></div>
+<div class="ttc" id="afloyd__cycle__detection__algo_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00095">floyd_cycle_detection_algo.cpp:95</a></div></div>
+<div class="ttc" id="anamespacecycle__detection_html"><div class="ttname"><a href="../../da/d82/namespacecycle__detection.html">cycle_detection</a></div><div class="ttdoc">Functions for the Floyd's Cycle Detection algorithm.</div></div>
+<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> <a href="../../df/dd5/binary__search_8cpp_source.html#l00047">binary_search.cpp:47</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../db/dc4/floyd__cycle__detection__algo_8cpp.html">floyd_cycle_detection_algo.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/dd3/ode__forward__euler_8cpp.html b/db/dd3/ode__forward__euler_8cpp.html
index 2159946f1..e1bdc2c9a 100644
--- a/db/dd3/ode__forward__euler_8cpp.html
+++ b/db/dd3/ode__forward__euler_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/ode_forward_euler.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/ode_forward_euler.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,22 +139,24 @@ Include dependency graph for ode_forward_euler.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/dc5/ode__forward__euler_8cpp__incl.svg" width="423" height="126"><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">
+</div>
+<p><a href="../../db/dd3/ode__forward__euler_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:abaeae8f62a018d197f0187a1c80a90fe" id="r_abaeae8f62a018d197f0187a1c80a90fe"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abaeae8f62a018d197f0187a1c80a90fe">problem</a> (const double &amp;x, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *y, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *dy)</td></tr>
+<tr class="memitem:abaeae8f62a018d197f0187a1c80a90fe" id="r_abaeae8f62a018d197f0187a1c80a90fe"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abaeae8f62a018d197f0187a1c80a90fe">problem</a> (const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</td></tr>
 <tr class="memdesc:abaeae8f62a018d197f0187a1c80a90fe"><td class="mdescLeft">&#160;</td><td class="mdescRight">Problem statement for a system with first-order differential equations. Updates the system differential variables.  <br /></td></tr>
 <tr class="separator:abaeae8f62a018d197f0187a1c80a90fe"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af3adf7b092a87868917ee5fb4255192b" id="r_af3adf7b092a87868917ee5fb4255192b"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af3adf7b092a87868917ee5fb4255192b">exact_solution</a> (const double &amp;x, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *y)</td></tr>
+<tr class="memitem:af3adf7b092a87868917ee5fb4255192b" id="r_af3adf7b092a87868917ee5fb4255192b"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af3adf7b092a87868917ee5fb4255192b">exact_solution</a> (const double &amp;x, std::valarray&lt; double &gt; *y)</td></tr>
 <tr class="memdesc:af3adf7b092a87868917ee5fb4255192b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Exact solution of the problem. Used for solution comparison.  <br /></td></tr>
 <tr class="separator:af3adf7b092a87868917ee5fb4255192b"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ga195d23bbdfcb80e83c9cda45c9ad5723" id="r_ga195d23bbdfcb80e83c9cda45c9ad5723"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723">forward_euler_step</a> (const double dx, const double x, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *y, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *dy)</td></tr>
+<tr class="memitem:ga195d23bbdfcb80e83c9cda45c9ad5723" id="r_ga195d23bbdfcb80e83c9cda45c9ad5723"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723">forward_euler_step</a> (const double dx, const double x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</td></tr>
 <tr class="memdesc:ga195d23bbdfcb80e83c9cda45c9ad5723"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute next step approximation using the forward-Euler method.  <br /></td></tr>
 <tr class="separator:ga195d23bbdfcb80e83c9cda45c9ad5723"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:gae0509f8843e2bc42de2abbd00a14b7b9" id="r_gae0509f8843e2bc42de2abbd00a14b7b9"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9">forward_euler</a> (double dx, double x0, double x_max, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *y, bool save_to_file=false)</td></tr>
+<tr class="memitem:gae0509f8843e2bc42de2abbd00a14b7b9" id="r_gae0509f8843e2bc42de2abbd00a14b7b9"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9">forward_euler</a> (double dx, double x0, double x_max, std::valarray&lt; double &gt; *y, bool save_to_file=false)</td></tr>
 <tr class="memdesc:gae0509f8843e2bc42de2abbd00a14b7b9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute approximation using the forward-Euler method in the given limits.  <br /></td></tr>
 <tr class="separator:gae0509f8843e2bc42de2abbd00a14b7b9"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa13517b8e5de1b75592052db7f7e237f" id="r_aa13517b8e5de1b75592052db7f7e237f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a> (const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;Y0)</td></tr>
+<tr class="memitem:aa13517b8e5de1b75592052db7f7e237f" id="r_aa13517b8e5de1b75592052db7f7e237f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a> (const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0)</td></tr>
 <tr class="separator:aa13517b8e5de1b75592052db7f7e237f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a0ddf1224851353fc92bfbff6f499fa97" id="r_a0ddf1224851353fc92bfbff6f499fa97"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0ddf1224851353fc92bfbff6f499fa97">main</a> (int argc, char *argv[])</td></tr>
 <tr class="separator:a0ddf1224851353fc92bfbff6f499fa97"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -164,6 +183,8 @@ Functions</h2></td></tr>
 <div class="line">dy[0] = y[1];</div>
 <div class="line">dy[1] = mu * (1.f - y[0] * y[0]) * y[1] - y[0];</div>
 </div><!-- fragment --> <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d6/dd3/ode__midpoint__euler_8cpp.html" title="Solve a multivariable first order ordinary differential equation (ODEs) using midpoint Euler method">ode_midpoint_euler.cpp</a>, <a class="el" href="../../d3/d06/ode__semi__implicit__euler_8cpp.html" title="Solve a multivariable first order ordinary differential equation (ODEs) using semi implicit Euler met...">ode_semi_implicit_euler.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../db/dd3/ode__forward__euler_8cpp_source.html">ode_forward_euler.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="af3adf7b092a87868917ee5fb4255192b" name="af3adf7b092a87868917ee5fb4255192b"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#af3adf7b092a87868917ee5fb4255192b">&#9670;&#160;</a></span>exact_solution()</h2>
@@ -179,7 +200,7 @@ Functions</h2></td></tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>&#160;)</td>
+          <td class="paramtype">std::valarray&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -192,18 +213,13 @@ Functions</h2></td></tr>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">   67</span>                                                             {</div>
-<div class="line"><span class="lineno">   68</span>    y[0][0] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a>(x);</div>
-<div class="line"><span class="lineno">   69</span>    y[0][1] = -<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a>(x);</div>
-<div class="line"><span class="lineno">   70</span>}</div>
-<div class="ttc" id="acos_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a></div><div class="ttdeci">T cos(T... args)</div></div>
-<div class="ttc" id="asin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a></div><div class="ttdeci">T sin(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg" width="232" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../db/dd3/ode__forward__euler_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../db/dd3/ode__forward__euler_8cpp_source.html">ode_forward_euler.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   67</span>                                                             {</div>
+<div class="line"><span class="lineno">   68</span>    y[0][0] = std::cos(x);</div>
+<div class="line"><span class="lineno">   69</span>    y[0][1] = -std::sin(x);</div>
+<div class="line"><span class="lineno">   70</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
@@ -225,41 +241,34 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Main Function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dd3/ode__forward__euler_8cpp_source.html#l00189">189</a> of file <a class="el" href="../../db/dd3/ode__forward__euler_8cpp_source.html">ode_forward_euler.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  189</span>                                 {</div>
 <div class="line"><span class="lineno">  190</span>    <span class="keywordtype">double</span> X0 = 0.f;                    <span class="comment">/* initial value of x0 */</span></div>
 <div class="line"><span class="lineno">  191</span>    <span class="keywordtype">double</span> X_MAX = 10.F;                <span class="comment">/* upper limit of integration */</span></div>
-<div class="line"><span class="lineno">  192</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> Y0{1.f, 0.f}; <span class="comment">/* initial value Y = y(x = x_0) */</span></div>
+<div class="line"><span class="lineno">  192</span>    std::valarray&lt;double&gt; Y0{1.f, 0.f}; <span class="comment">/* initial value Y = y(x = x_0) */</span></div>
 <div class="line"><span class="lineno">  193</span>    <span class="keywordtype">double</span> step_size = NAN;</div>
 <div class="line"><span class="lineno">  194</span> </div>
 <div class="line"><span class="lineno">  195</span>    <span class="keywordflow">if</span> (argc == 1) {</div>
-<div class="line"><span class="lineno">  196</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter the step size: &quot;</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_istream.html">std::cin</a> &gt;&gt; step_size;</div>
+<div class="line"><span class="lineno">  196</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the step size: &quot;</span>;</div>
+<div class="line"><span class="lineno">  197</span>        std::cin &gt;&gt; step_size;</div>
 <div class="line"><span class="lineno">  198</span>    } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">  199</span>        <span class="comment">// use commandline argument as independent variable step size</span></div>
-<div class="line"><span class="lineno">  200</span>        step_size = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a>(argv[1]);</div>
+<div class="line"><span class="lineno">  200</span>        step_size = std::atof(argv[1]);</div>
 <div class="line"><span class="lineno">  201</span>    }</div>
 <div class="line"><span class="lineno">  202</span> </div>
 <div class="line"><span class="lineno">  203</span>    <span class="comment">// get approximate solution</span></div>
 <div class="line"><span class="lineno">  204</span>    <span class="keywordtype">double</span> total_time = <a class="code hl_function" href="../../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9">forward_euler</a>(step_size, X0, X_MAX, &amp;Y0, <span class="keyword">true</span>);</div>
-<div class="line"><span class="lineno">  205</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tTime = &quot;</span> &lt;&lt; total_time &lt;&lt; <span class="stringliteral">&quot; ms\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  205</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tTime = &quot;</span> &lt;&lt; total_time &lt;&lt; <span class="stringliteral">&quot; ms\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  206</span> </div>
 <div class="line"><span class="lineno">  207</span>    <span class="comment">/* compute exact solution for comparion */</span></div>
 <div class="line"><span class="lineno">  208</span>    <a class="code hl_function" href="#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a>(X0, X_MAX, step_size, Y0);</div>
 <div class="line"><span class="lineno">  209</span> </div>
 <div class="line"><span class="lineno">  210</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  211</span>}</div>
-<div class="ttc" id="aatof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a></div><div class="ttdeci">T atof(T... args)</div></div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="agroup__ode_html_gae0509f8843e2bc42de2abbd00a14b7b9"><div class="ttname"><a href="../../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9">forward_euler</a></div><div class="ttdeci">double forward_euler(double dx, double x0, double x_max, std::valarray&lt; double &gt; *y, bool save_to_file=false)</div><div class="ttdoc">Compute approximation using the forward-Euler method in the given limits.</div><div class="ttdef"><b>Definition</b> ode_forward_euler.cpp:102</div></div>
-<div class="ttc" id="aode__forward__euler_8cpp_html_aa13517b8e5de1b75592052db7f7e237f"><div class="ttname"><a href="#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a></div><div class="ttdeci">void save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0)</div><div class="ttdef"><b>Definition</b> ode_forward_euler.cpp:153</div></div>
-<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="564" height="356"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agroup__ode_html_gae0509f8843e2bc42de2abbd00a14b7b9"><div class="ttname"><a href="../../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9">forward_euler</a></div><div class="ttdeci">double forward_euler(double dx, double x0, double x_max, std::valarray&lt; double &gt; *y, bool save_to_file=false)</div><div class="ttdoc">Compute approximation using the forward-Euler method in the given limits.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dd3/ode__forward__euler_8cpp_source.html#l00102">ode_forward_euler.cpp:102</a></div></div>
+<div class="ttc" id="aode__forward__euler_8cpp_html_aa13517b8e5de1b75592052db7f7e237f"><div class="ttname"><a href="#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a></div><div class="ttdeci">void save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0)</div><div class="ttdef"><b>Definition</b> <a href="../../db/dd3/ode__forward__euler_8cpp_source.html#l00153">ode_forward_euler.cpp:153</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abaeae8f62a018d197f0187a1c80a90fe" name="abaeae8f62a018d197f0187a1c80a90fe"></a>
@@ -276,12 +285,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
+          <td class="paramtype">std::valarray&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>y</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>dy</em></span>&#160;)</td>
+          <td class="paramtype">std::valarray&lt; double &gt; *</td>          <td class="paramname"><span class="paramname"><em>dy</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -296,6 +305,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dd3/ode__forward__euler_8cpp_source.html#l00054">54</a> of file <a class="el" href="../../db/dd3/ode__forward__euler_8cpp_source.html">ode_forward_euler.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   55</span>                                      {</div>
 <div class="line"><span class="lineno">   56</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> omega = 1.F;             <span class="comment">// some const for the problem</span></div>
 <div class="line"><span class="lineno">   57</span>    (*dy)[0] = (*y)[1];                   <span class="comment">// x dot // NOLINT</span></div>
@@ -328,7 +339,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>Y0</em></span>&#160;)</td>
+          <td class="paramtype">const std::valarray&lt; double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>Y0</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -342,18 +353,20 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dd3/ode__forward__euler_8cpp_source.html#l00153">153</a> of file <a class="el" href="../../db/dd3/ode__forward__euler_8cpp_source.html">ode_forward_euler.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  155</span>                                                        {</div>
 <div class="line"><span class="lineno">  156</span>    <span class="keywordtype">double</span> x = X0;</div>
-<div class="line"><span class="lineno">  157</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> y(Y0);</div>
+<div class="line"><span class="lineno">  157</span>    std::valarray&lt;double&gt; y(Y0);</div>
 <div class="line"><span class="lineno">  158</span> </div>
-<div class="line"><span class="lineno">  159</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a> fp(<span class="stringliteral">&quot;exact.csv&quot;</span>, std::ostream::out);</div>
+<div class="line"><span class="lineno">  159</span>    std::ofstream fp(<span class="stringliteral">&quot;exact.csv&quot;</span>, std::ostream::out);</div>
 <div class="line"><span class="lineno">  160</span>    <span class="keywordflow">if</span> (!fp.is_open()) {</div>
-<div class="line"><span class="lineno">  161</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/perror.html">std::perror</a>(<span class="stringliteral">&quot;Error! &quot;</span>);</div>
+<div class="line"><span class="lineno">  161</span>        std::perror(<span class="stringliteral">&quot;Error! &quot;</span>);</div>
 <div class="line"><span class="lineno">  162</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">  163</span>    }</div>
-<div class="line"><span class="lineno">  164</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Finding exact solution\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  164</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Finding exact solution\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  165</span> </div>
-<div class="line"><span class="lineno">  166</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> t1 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  166</span>    std::clock_t t1 = std::clock();</div>
 <div class="line"><span class="lineno">  167</span>    <span class="keywordflow">do</span> {</div>
 <div class="line"><span class="lineno">  168</span>        fp &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
 <div class="line"><span class="lineno">  169</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; y.size() - 1; i++) {</div>
@@ -366,23 +379,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  176</span>        x += step_size;</div>
 <div class="line"><span class="lineno">  177</span>    } <span class="keywordflow">while</span> (x &lt;= X_MAX);</div>
 <div class="line"><span class="lineno">  178</span> </div>
-<div class="line"><span class="lineno">  179</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> t2 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">  179</span>    std::clock_t t2 = std::clock();</div>
 <div class="line"><span class="lineno">  180</span>    <span class="keywordtype">double</span> total_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(t2 - t1) / CLOCKS_PER_SEC;</div>
-<div class="line"><span class="lineno">  181</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tTime = &quot;</span> &lt;&lt; total_time &lt;&lt; <span class="stringliteral">&quot; ms\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  181</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tTime = &quot;</span> &lt;&lt; total_time &lt;&lt; <span class="stringliteral">&quot; ms\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  182</span> </div>
 <div class="line"><span class="lineno">  183</span>    fp.close();</div>
 <div class="line"><span class="lineno">  184</span>}</div>
-<div class="ttc" id="abasic_ofstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a></div></div>
-<div class="ttc" id="aclock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a></div><div class="ttdeci">T clock(T... args)</div></div>
-<div class="ttc" id="aclock_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a></div></div>
-<div class="ttc" id="aode__forward__euler_8cpp_html_af3adf7b092a87868917ee5fb4255192b"><div class="ttname"><a href="#af3adf7b092a87868917ee5fb4255192b">exact_solution</a></div><div class="ttdeci">void exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y)</div><div class="ttdoc">Exact solution of the problem. Used for solution comparison.</div><div class="ttdef"><b>Definition</b> ode_forward_euler.cpp:67</div></div>
-<div class="ttc" id="aperror_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/c/perror.html">std::perror</a></div><div class="ttdeci">T perror(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg" width="467" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aode__forward__euler_8cpp_html_af3adf7b092a87868917ee5fb4255192b"><div class="ttname"><a href="#af3adf7b092a87868917ee5fb4255192b">exact_solution</a></div><div class="ttdeci">void exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y)</div><div class="ttdoc">Exact solution of the problem. Used for solution comparison.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dd3/ode__forward__euler_8cpp_source.html#l00067">ode_forward_euler.cpp:67</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
deleted file mode 100644
index ac5a9fc60..000000000
--- a/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ /dev/null
@@ -1,33 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,128,55,154"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/atof.html#" title=" " alt="" coords="138,79,208,104"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,130,102,113,123,106,124,111,104,118,56,135"/>
-<area shape="rect" id="Node000003" href="$d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9" title="Compute approximation using the forward&#45;Euler method in the given limits." alt="" coords="123,177,222,203"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,147,104,164,120,169,118,174,102,169,54,152"/>
-<area shape="rect" id="Node000011" href="$db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f" title=" " alt="" coords="103,128,243,154"/>
-<area shape="poly" id="edge10_Node000001_Node000011" title=" " alt="" coords="55,138,87,138,87,144,55,144"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/clock.html#" title=" " alt="" coords="328,227,406,252"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="224,200,313,223,311,228,222,205"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="298,79,435,104"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="221,174,242,164,256,152,265,139,274,126,289,113,297,109,300,113,293,118,278,130,269,142,260,155,244,168,223,179"/>
-<area shape="rect" id="Node000006" href="$d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723" title="Compute next step approximation using the forward&#45;Euler method." alt="" coords="301,325,432,351"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="185,202,228,255,258,286,292,312,300,316,297,321,290,316,255,290,224,259,181,205"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="291,128,442,154"/>
-<area shape="poly" id="edge7_Node000003_Node000008" title=" " alt="" coords="222,175,298,155,299,161,224,180"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/open.html#" title=" " alt="" coords="300,276,434,302"/>
-<area shape="poly" id="edge8_Node000003_Node000009" title=" " alt="" coords="193,201,237,231,292,262,304,268,302,273,290,267,234,236,190,206"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/c/perror.html#" title=" " alt="" coords="326,177,407,203"/>
-<area shape="poly" id="edge9_Node000003_Node000010" title=" " alt="" coords="223,188,311,188,311,193,223,193"/>
-<area shape="rect" id="Node000007" href="$db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti..." alt="" coords="491,325,558,351"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="433,336,475,336,475,341,433,341"/>
-<area shape="poly" id="edge11_Node000011_Node000004" title=" " alt="" coords="223,152,244,163,260,176,269,189,278,201,292,213,314,224,311,229,290,218,274,205,265,192,256,179,242,167,221,157"/>
-<area shape="poly" id="edge12_Node000011_Node000005" title=" " alt="" coords="226,125,298,106,299,111,227,130"/>
-<area shape="poly" id="edge16_Node000011_Node000008" title=" " alt="" coords="243,138,275,138,275,144,243,144"/>
-<area shape="poly" id="edge17_Node000011_Node000010" title=" " alt="" coords="227,152,312,174,311,179,226,157"/>
-<area shape="rect" id="Node000012" href="$db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b" title="Exact solution of the problem. Used for solution comparison." alt="" coords="314,29,419,55"/>
-<area shape="poly" id="edge13_Node000011_Node000012" title=" " alt="" coords="221,125,242,115,256,102,265,90,274,77,289,64,298,59,301,64,293,68,278,81,269,93,260,106,244,119,223,130"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/cos.html#" title=" " alt="" coords="490,55,559,80"/>
-<area shape="poly" id="edge14_Node000012_Node000013" title=" " alt="" coords="420,48,475,57,475,62,419,53"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sin.html#" title=" " alt="" coords="492,5,557,31"/>
-<area shape="poly" id="edge15_Node000012_Node000014" title=" " alt="" coords="419,32,477,23,477,28,420,37"/>
-</map>
diff --git a/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
deleted file mode 100644
index a340b3c3a..000000000
--- a/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8c25254ae2a11884d140ade79e6a902c
\ No newline at end of file
diff --git a/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
deleted file mode 100644
index 55b37b0bb..000000000
--- a/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ /dev/null
@@ -1,317 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="423pt" height="267pt"
- viewBox="0.00 0.00 423.00 267.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 263.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-167.25 0,-167.25 0,-148 37,-148 37,-167.25"/>
-<text text-anchor="middle" x="18.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/atof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.62,-204.25 99.62,-204.25 99.62,-185 151.62,-185 151.62,-204.25"/>
-<text text-anchor="middle" x="125.62" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::atof</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-163.98C47.72,-167.69 61.1,-172.44 73,-176.62 78.05,-178.4 83.38,-180.27 88.62,-182.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.12,-185.28 97.72,-185.27 89.43,-178.68 87.12,-185.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9" target="_top" xlink:title="Compute approximation using the forward&#45;Euler method in the given limits.">
-<polygon fill="white" stroke="#666666" points="162.88,-130.25 88.38,-130.25 88.38,-111 162.88,-111 162.88,-130.25"/>
-<text text-anchor="middle" x="125.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">forward_euler</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-151.27C47.72,-147.56 61.1,-142.81 73,-138.62 76.9,-137.25 80.97,-135.83 85.03,-134.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.96,-137.79 94.24,-131.19 83.65,-131.18 85.96,-137.79"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="178.25,-167.25 73,-167.25 73,-148 178.25,-148 178.25,-167.25"/>
-<text text-anchor="middle" x="125.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.33,-157.62C44.25,-157.62 52.63,-157.62 61.41,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.17,-161.13 71.17,-157.63 61.17,-154.13 61.17,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="300.38,-93.25 241.62,-93.25 241.62,-74 300.38,-74 300.38,-93.25"/>
-<text text-anchor="middle" x="271" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.18,-111.19C183.62,-105.92 209.12,-99.34 230.08,-93.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.93,-97.32 239.73,-91.44 229.18,-90.55 230.93,-97.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="322.5,-204.25 219.5,-204.25 219.5,-185 322.5,-185 322.5,-204.25"/>
-<text text-anchor="middle" x="271" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.66,-130.68C168.09,-132.9 173.47,-135.53 178.25,-138.62 197.79,-151.26 194.57,-164.22 214.25,-176.62 216.09,-177.78 218.01,-178.88 219.99,-179.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.27,-182.97 228.82,-183.89 221.14,-176.58 218.27,-182.97"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723" target="_top" xlink:title="Compute next step approximation using the forward&#45;Euler method.">
-<polygon fill="white" stroke="#666666" points="320.25,-19.25 221.75,-19.25 221.75,0 320.25,0 320.25,-19.25"/>
-<text text-anchor="middle" x="271" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">forward_euler_step</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.36,-110.66C146.63,-91.74 178.06,-50.5 214.25,-27.62 216.09,-26.46 218.01,-25.37 219.98,-24.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.14,-27.66 228.81,-20.35 218.26,-21.28 221.14,-27.66"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="327.75,-167.25 214.25,-167.25 214.25,-148 327.75,-148 327.75,-167.25"/>
-<text text-anchor="middle" x="271" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.18,-130.06C180.43,-134.51 201.3,-139.9 219.99,-144.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.98,-148.07 229.54,-147.18 220.73,-141.3 218.98,-148.07"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321.38,-56.25 220.62,-56.25 220.62,-37 321.38,-37 321.38,-56.25"/>
-<text text-anchor="middle" x="271" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.95,-110.56C156.61,-98.35 186.32,-77.79 214.25,-64.62 217.18,-63.24 220.25,-61.93 223.37,-60.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.5,-63.99 232.66,-57.24 222.07,-57.43 224.5,-63.99"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/perror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="301.12,-130.25 240.88,-130.25 240.88,-111 301.12,-111 301.12,-130.25"/>
-<text text-anchor="middle" x="271" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::perror</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node10 -->
-<g id="edge9_Node000003_Node000010" class="edge">
-<title>Node3&#45;&gt;Node10</title>
-<g id="a_edge9_Node000003_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.18,-120.62C183.38,-120.62 208.54,-120.62 229.36,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.22,-124.13 239.22,-120.63 229.22,-117.13 229.22,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" target="_top" xlink:title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti...">
-<polygon fill="white" stroke="#666666" points="414.62,-19.25 364.12,-19.25 364.12,0 414.62,0 414.62,-19.25"/>
-<text text-anchor="middle" x="389.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">problem</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M320.68,-9.62C331.33,-9.62 342.43,-9.62 352.47,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.19,-13.13 362.19,-9.63 352.19,-6.13 352.19,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node4 -->
-<g id="edge11_Node000011_Node000004" class="edge">
-<title>Node11&#45;&gt;Node4</title>
-<g id="a_edge11_Node000011_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.66,-147.57C168.09,-145.35 173.47,-142.72 178.25,-139.62 197.79,-126.99 194.57,-114.03 214.25,-101.62 219.23,-98.49 224.81,-95.85 230.46,-93.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.54,-96.97 239.85,-90.41 229.26,-90.35 231.54,-96.97"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge12_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge12_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M165.8,-167.74C182.48,-172.04 202.13,-177.11 219.85,-181.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.85,-185.04 229.4,-184.15 220.6,-178.26 218.85,-185.04"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node8 -->
-<g id="edge16_Node000011_Node000008" class="edge">
-<title>Node11&#45;&gt;Node8</title>
-<g id="a_edge16_Node000011_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M178.39,-157.62C186.24,-157.62 194.43,-157.62 202.56,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.44,-161.13 212.44,-157.63 202.44,-154.13 202.44,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node10 -->
-<g id="edge17_Node000011_Node000010" class="edge">
-<title>Node11&#45;&gt;Node10</title>
-<g id="a_edge17_Node000011_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M165.8,-147.51C185.58,-142.41 209.54,-136.23 229.5,-131.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.15,-134.52 238.96,-128.64 228.4,-127.75 230.15,-134.52"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b" target="_top" xlink:title="Exact solution of the problem. Used for solution comparison.">
-<polygon fill="white" stroke="#666666" points="310.5,-241.25 231.5,-241.25 231.5,-222 310.5,-222 310.5,-241.25"/>
-<text text-anchor="middle" x="271" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge13_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge13_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.66,-167.68C168.09,-169.9 173.47,-172.53 178.25,-175.62 197.79,-188.26 194.57,-201.22 214.25,-213.62 216.27,-214.9 218.38,-216.09 220.56,-217.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.14,-220.39 229.7,-221.24 221.97,-213.99 219.14,-220.39"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415,-222.25 363.75,-222.25 363.75,-203 415,-203 415,-222.25"/>
-<text text-anchor="middle" x="389.38" y="-208.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge14_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge14_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M310.75,-225.3C324.15,-223.11 339.1,-220.67 352.28,-218.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.52,-222.03 361.82,-216.96 351.39,-215.12 352.52,-222.03"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="413.5,-259.25 365.25,-259.25 365.25,-240 413.5,-240 413.5,-259.25"/>
-<text text-anchor="middle" x="389.38" y="-245.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node14 -->
-<g id="edge15_Node000012_Node000014" class="edge">
-<title>Node12&#45;&gt;Node14</title>
-<g id="a_edge15_Node000012_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M310.75,-237.62C324.66,-239.77 340.25,-242.18 353.78,-244.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="353.14,-247.72 363.56,-245.79 354.21,-240.8 353.14,-247.72"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
deleted file mode 100644
index e3f6e8a2d..000000000
--- a/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
+++ /dev/null
@@ -1,291 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="423pt" height="267pt"
- viewBox="0.00 0.00 423.00 267.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 263.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-167.25 0,-167.25 0,-148 37,-148 37,-167.25"/>
-<text text-anchor="middle" x="18.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/atof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.62,-204.25 99.62,-204.25 99.62,-185 151.62,-185 151.62,-204.25"/>
-<text text-anchor="middle" x="125.62" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::atof</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-163.98C47.72,-167.69 61.1,-172.44 73,-176.62 78.05,-178.4 83.38,-180.27 88.62,-182.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.12,-185.28 97.72,-185.27 89.43,-178.68 87.12,-185.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9" target="_top" xlink:title="Compute approximation using the forward&#45;Euler method in the given limits.">
-<polygon fill="white" stroke="#666666" points="162.88,-130.25 88.38,-130.25 88.38,-111 162.88,-111 162.88,-130.25"/>
-<text text-anchor="middle" x="125.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">forward_euler</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-151.27C47.72,-147.56 61.1,-142.81 73,-138.62 76.9,-137.25 80.97,-135.83 85.03,-134.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.96,-137.79 94.24,-131.19 83.65,-131.18 85.96,-137.79"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="178.25,-167.25 73,-167.25 73,-148 178.25,-148 178.25,-167.25"/>
-<text text-anchor="middle" x="125.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.33,-157.62C44.25,-157.62 52.63,-157.62 61.41,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.17,-161.13 71.17,-157.63 61.17,-154.13 61.17,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="300.38,-93.25 241.62,-93.25 241.62,-74 300.38,-74 300.38,-93.25"/>
-<text text-anchor="middle" x="271" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.18,-111.19C183.62,-105.92 209.12,-99.34 230.08,-93.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.93,-97.32 239.73,-91.44 229.18,-90.55 230.93,-97.32"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="322.5,-204.25 219.5,-204.25 219.5,-185 322.5,-185 322.5,-204.25"/>
-<text text-anchor="middle" x="271" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.66,-130.68C168.09,-132.9 173.47,-135.53 178.25,-138.62 197.79,-151.26 194.57,-164.22 214.25,-176.62 216.09,-177.78 218.01,-178.88 219.99,-179.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.27,-182.97 228.82,-183.89 221.14,-176.58 218.27,-182.97"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723" target="_top" xlink:title="Compute next step approximation using the forward&#45;Euler method.">
-<polygon fill="white" stroke="#666666" points="320.25,-19.25 221.75,-19.25 221.75,0 320.25,0 320.25,-19.25"/>
-<text text-anchor="middle" x="271" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">forward_euler_step</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.36,-110.66C146.63,-91.74 178.06,-50.5 214.25,-27.62 216.09,-26.46 218.01,-25.37 219.98,-24.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.14,-27.66 228.81,-20.35 218.26,-21.28 221.14,-27.66"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="327.75,-167.25 214.25,-167.25 214.25,-148 327.75,-148 327.75,-167.25"/>
-<text text-anchor="middle" x="271" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.18,-130.06C180.43,-134.51 201.3,-139.9 219.99,-144.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.98,-148.07 229.54,-147.18 220.73,-141.3 218.98,-148.07"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321.38,-56.25 220.62,-56.25 220.62,-37 321.38,-37 321.38,-56.25"/>
-<text text-anchor="middle" x="271" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::open</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node9 -->
-<g id="edge8_Node000003_Node000009" class="edge">
-<title>Node3&#45;&gt;Node9</title>
-<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.95,-110.56C156.61,-98.35 186.32,-77.79 214.25,-64.62 217.18,-63.24 220.25,-61.93 223.37,-60.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.5,-63.99 232.66,-57.24 222.07,-57.43 224.5,-63.99"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/perror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="301.12,-130.25 240.88,-130.25 240.88,-111 301.12,-111 301.12,-130.25"/>
-<text text-anchor="middle" x="271" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::perror</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node10 -->
-<g id="edge9_Node000003_Node000010" class="edge">
-<title>Node3&#45;&gt;Node10</title>
-<g id="a_edge9_Node000003_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.18,-120.62C183.38,-120.62 208.54,-120.62 229.36,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.22,-124.13 239.22,-120.63 229.22,-117.13 229.22,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe" target="_top" xlink:title="Problem statement for a system with first&#45;order differential equations. Updates the system differenti...">
-<polygon fill="white" stroke="#666666" points="414.62,-19.25 364.12,-19.25 364.12,0 414.62,0 414.62,-19.25"/>
-<text text-anchor="middle" x="389.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">problem</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M320.68,-9.62C331.33,-9.62 342.43,-9.62 352.47,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.19,-13.13 362.19,-9.63 352.19,-6.13 352.19,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node4 -->
-<g id="edge11_Node000011_Node000004" class="edge">
-<title>Node11&#45;&gt;Node4</title>
-<g id="a_edge11_Node000011_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.66,-147.57C168.09,-145.35 173.47,-142.72 178.25,-139.62 197.79,-126.99 194.57,-114.03 214.25,-101.62 219.23,-98.49 224.81,-95.85 230.46,-93.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.54,-96.97 239.85,-90.41 229.26,-90.35 231.54,-96.97"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge12_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge12_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M165.8,-167.74C182.48,-172.04 202.13,-177.11 219.85,-181.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.85,-185.04 229.4,-184.15 220.6,-178.26 218.85,-185.04"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node8 -->
-<g id="edge16_Node000011_Node000008" class="edge">
-<title>Node11&#45;&gt;Node8</title>
-<g id="a_edge16_Node000011_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M178.39,-157.62C186.24,-157.62 194.43,-157.62 202.56,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.44,-161.13 212.44,-157.63 202.44,-154.13 202.44,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node10 -->
-<g id="edge17_Node000011_Node000010" class="edge">
-<title>Node11&#45;&gt;Node10</title>
-<g id="a_edge17_Node000011_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M165.8,-147.51C185.58,-142.41 209.54,-136.23 229.5,-131.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.15,-134.52 238.96,-128.64 228.4,-127.75 230.15,-134.52"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b" target="_top" xlink:title="Exact solution of the problem. Used for solution comparison.">
-<polygon fill="white" stroke="#666666" points="310.5,-241.25 231.5,-241.25 231.5,-222 310.5,-222 310.5,-241.25"/>
-<text text-anchor="middle" x="271" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge13_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge13_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.66,-167.68C168.09,-169.9 173.47,-172.53 178.25,-175.62 197.79,-188.26 194.57,-201.22 214.25,-213.62 216.27,-214.9 218.38,-216.09 220.56,-217.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="219.14,-220.39 229.7,-221.24 221.97,-213.99 219.14,-220.39"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415,-222.25 363.75,-222.25 363.75,-203 415,-203 415,-222.25"/>
-<text text-anchor="middle" x="389.38" y="-208.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge14_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge14_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M310.75,-225.3C324.15,-223.11 339.1,-220.67 352.28,-218.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.52,-222.03 361.82,-216.96 351.39,-215.12 352.52,-222.03"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="413.5,-259.25 365.25,-259.25 365.25,-240 413.5,-240 413.5,-259.25"/>
-<text text-anchor="middle" x="389.38" y="-245.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node14 -->
-<g id="edge15_Node000012_Node000014" class="edge">
-<title>Node12&#45;&gt;Node14</title>
-<g id="a_edge15_Node000012_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M310.75,-237.62C324.66,-239.77 340.25,-242.18 353.78,-244.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="353.14,-247.72 363.56,-245.79 354.21,-240.8 353.14,-247.72"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map b/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map
deleted file mode 100644
index 1d0fbfec4..000000000
--- a/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="save_exact_solution" name="save_exact_solution">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,104,146,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/clock.html#" title=" " alt="" coords="230,5,308,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="93,101,137,71,193,40,215,31,217,36,195,45,140,76,96,106"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/close.html#" title=" " alt="" coords="201,55,338,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="128,101,200,82,202,87,130,106"/>
-<area shape="rect" id="Node000004" href="$db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b" title="Exact solution of the problem. Used for solution comparison." alt="" coords="217,104,322,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="146,114,201,114,201,120,146,120"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/basic_ofstream/is_open.html#" title=" " alt="" coords="194,153,345,179"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="130,128,202,146,200,151,128,133"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/c/perror.html#" title=" " alt="" coords="229,203,310,228"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="96,128,140,158,195,189,215,198,213,202,193,194,137,163,93,132"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/cos.html#" title=" " alt="" coords="393,80,461,106"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="322,106,377,98,378,103,323,111"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sin.html#" title=" " alt="" coords="395,129,459,155"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="323,123,380,132,379,137,322,128"/>
-</map>
diff --git a/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 b/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5
deleted file mode 100644
index 75b45e807..000000000
--- a/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-06ba2372c65249339fc942bfa3a5055a
\ No newline at end of file
diff --git a/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg b/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg
deleted file mode 100644
index a6716ec7e..000000000
--- a/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg
+++ /dev/null
@@ -1,173 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: save_exact_solution Pages: 1 -->
-<svg width="350pt" height="175pt"
- viewBox="0.00 0.00 350.00 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>save_exact_solution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="105.25,-93.25 0,-93.25 0,-74 105.25,-74 105.25,-93.25"/>
-<text text-anchor="middle" x="52.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.38,-167.25 168.62,-167.25 168.62,-148 227.38,-148 227.38,-167.25"/>
-<text text-anchor="middle" x="198" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.95,-93.69C83.61,-105.9 113.32,-126.46 141.25,-139.62 146.46,-142.08 152.1,-144.33 157.72,-146.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.35,-149.58 166.95,-149.45 158.58,-142.95 156.35,-149.58"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-130.25 146.5,-130.25 146.5,-111 249.5,-111 249.5,-130.25"/>
-<text text-anchor="middle" x="198" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.8,-93.74C109.48,-98.04 129.13,-103.11 146.85,-107.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.85,-111.04 156.4,-110.15 147.6,-104.26 145.85,-111.04"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b" target="_top" xlink:title="Exact solution of the problem. Used for solution comparison.">
-<polygon fill="white" stroke="#666666" points="237.5,-93.25 158.5,-93.25 158.5,-74 237.5,-74 237.5,-93.25"/>
-<text text-anchor="middle" x="198" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.39,-83.62C118.91,-83.62 133.46,-83.62 146.9,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.85,-87.13 156.85,-83.63 146.85,-80.13 146.85,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-56.25 141.25,-56.25 141.25,-37 254.75,-37 254.75,-56.25"/>
-<text text-anchor="middle" x="198" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.8,-73.51C109.48,-69.21 129.13,-64.14 146.85,-59.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.6,-62.99 156.4,-57.1 145.85,-56.21 147.6,-62.99"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/perror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.12,-19.25 167.88,-19.25 167.88,0 228.12,0 228.12,-19.25"/>
-<text text-anchor="middle" x="198" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::perror</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.95,-73.56C83.61,-61.35 113.32,-40.79 141.25,-27.62 146.17,-25.31 151.46,-23.17 156.76,-21.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.74,-24.61 166.09,-18.08 155.49,-17.98 157.74,-24.61"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="342,-111.25 290.75,-111.25 290.75,-92 342,-92 342,-111.25"/>
-<text text-anchor="middle" x="316.38" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.75,-89.62C251.15,-91.69 266.1,-94 279.28,-96.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.4,-99.45 288.82,-97.52 279.47,-92.53 278.4,-99.45"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="340.5,-74.25 292.25,-74.25 292.25,-55 340.5,-55 340.5,-74.25"/>
-<text text-anchor="middle" x="316.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.75,-77.3C251.66,-75.03 267.25,-72.48 280.78,-70.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.25,-73.74 290.56,-68.68 280.13,-66.83 281.25,-73.74"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph_org.svg b/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph_org.svg
deleted file mode 100644
index fa38b1c3e..000000000
--- a/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph_org.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: save_exact_solution Pages: 1 -->
-<svg width="350pt" height="175pt"
- viewBox="0.00 0.00 350.00 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>save_exact_solution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="105.25,-93.25 0,-93.25 0,-74 105.25,-74 105.25,-93.25"/>
-<text text-anchor="middle" x="52.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">save_exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.38,-167.25 168.62,-167.25 168.62,-148 227.38,-148 227.38,-167.25"/>
-<text text-anchor="middle" x="198" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.95,-93.69C83.61,-105.9 113.32,-126.46 141.25,-139.62 146.46,-142.08 152.1,-144.33 157.72,-146.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.35,-149.58 166.95,-149.45 158.58,-142.95 156.35,-149.58"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-130.25 146.5,-130.25 146.5,-111 249.5,-111 249.5,-130.25"/>
-<text text-anchor="middle" x="198" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::close</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.8,-93.74C109.48,-98.04 129.13,-103.11 146.85,-107.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.85,-111.04 156.4,-110.15 147.6,-104.26 145.85,-111.04"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b" target="_top" xlink:title="Exact solution of the problem. Used for solution comparison.">
-<polygon fill="white" stroke="#666666" points="237.5,-93.25 158.5,-93.25 158.5,-74 237.5,-74 237.5,-93.25"/>
-<text text-anchor="middle" x="198" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.39,-83.62C118.91,-83.62 133.46,-83.62 146.9,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.85,-87.13 156.85,-83.63 146.85,-80.13 146.85,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-56.25 141.25,-56.25 141.25,-37 254.75,-37 254.75,-56.25"/>
-<text text-anchor="middle" x="198" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::ofstream::is_open</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.8,-73.51C109.48,-69.21 129.13,-64.14 146.85,-59.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.6,-62.99 156.4,-57.1 145.85,-56.21 147.6,-62.99"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/c/perror.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.12,-19.25 167.88,-19.25 167.88,0 228.12,0 228.12,-19.25"/>
-<text text-anchor="middle" x="198" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::perror</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.95,-73.56C83.61,-61.35 113.32,-40.79 141.25,-27.62 146.17,-25.31 151.46,-23.17 156.76,-21.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.74,-24.61 166.09,-18.08 155.49,-17.98 157.74,-24.61"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="342,-111.25 290.75,-111.25 290.75,-92 342,-92 342,-111.25"/>
-<text text-anchor="middle" x="316.38" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.75,-89.62C251.15,-91.69 266.1,-94 279.28,-96.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.4,-99.45 288.82,-97.52 279.47,-92.53 278.4,-99.45"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="340.5,-74.25 292.25,-74.25 292.25,-55 340.5,-55 340.5,-74.25"/>
-<text text-anchor="middle" x="316.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M237.75,-77.3C251.66,-75.03 267.25,-72.48 280.78,-70.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.25,-73.74 290.56,-68.68 280.13,-66.83 281.25,-73.74"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map b/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map
deleted file mode 100644
index 20ef8b76a..000000000
--- a/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="exact_solution" name="exact_solution">
-<area shape="rect" id="Node000001" title="Exact solution of the problem. Used for solution comparison." alt="" coords="5,31,111,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/cos.html#" title=" " alt="" coords="159,5,227,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="111,31,143,25,144,30,112,36"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sin.html#" title=" " alt="" coords="161,55,225,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="112,50,146,56,145,62,111,56"/>
-</map>
diff --git a/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 b/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5
deleted file mode 100644
index bfa5784f3..000000000
--- a/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-775f69ca4eafdff6467315705aafdd17
\ No newline at end of file
diff --git a/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg b/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg
deleted file mode 100644
index 85206d2ac..000000000
--- a/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: exact_solution Pages: 1 -->
-<svg width="174pt" height="64pt"
- viewBox="0.00 0.00 174.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>exact_solution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Exact solution of the problem. Used for solution comparison.">
-<polygon fill="#999999" stroke="#666666" points="79,-37.25 0,-37.25 0,-18 79,-18 79,-37.25"/>
-<text text-anchor="middle" x="39.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="166.25,-56.25 115,-56.25 115,-37 166.25,-37 166.25,-56.25"/>
-<text text-anchor="middle" x="140.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.39,-35.08C87.34,-36.6 95.66,-38.2 103.51,-39.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.58,-43.09 113.06,-41.53 103.9,-36.21 102.58,-43.09"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164.75,-19.25 116.5,-19.25 116.5,0 164.75,0 164.75,-19.25"/>
-<text text-anchor="middle" x="140.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.39,-20.56C87.8,-19.04 96.63,-17.43 104.87,-15.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.3,-19.42 114.51,-14.19 104.05,-12.53 105.3,-19.42"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph_org.svg b/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph_org.svg
deleted file mode 100644
index b49865b04..000000000
--- a/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: exact_solution Pages: 1 -->
-<svg width="174pt" height="64pt"
- viewBox="0.00 0.00 174.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>exact_solution</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Exact solution of the problem. Used for solution comparison.">
-<polygon fill="#999999" stroke="#666666" points="79,-37.25 0,-37.25 0,-18 79,-18 79,-37.25"/>
-<text text-anchor="middle" x="39.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">exact_solution</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/cos.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="166.25,-56.25 115,-56.25 115,-37 166.25,-37 166.25,-56.25"/>
-<text text-anchor="middle" x="140.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::cos</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.39,-35.08C87.34,-36.6 95.66,-38.2 103.51,-39.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.58,-43.09 113.06,-41.53 103.9,-36.21 102.58,-43.09"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164.75,-19.25 116.5,-19.25 116.5,0 164.75,0 164.75,-19.25"/>
-<text text-anchor="middle" x="140.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.39,-20.56C87.8,-19.04 96.63,-17.43 104.87,-15.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.3,-19.42 114.51,-14.19 104.05,-12.53 105.3,-19.42"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/dd3/ode__forward__euler_8cpp_source.html b/db/dd3/ode__forward__euler_8cpp_source.html
new file mode 100644
index 000000000..410e7b43a
--- /dev/null
+++ b/db/dd3/ode__forward__euler_8cpp_source.html
@@ -0,0 +1,277 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/ode_forward_euler.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/dd3/ode__forward__euler_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">ode_forward_euler.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../db/dd3/ode__forward__euler_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &lt;fstream&gt;</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="preprocessor">#include &lt;valarray&gt;</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="foldopen" id="foldopen00054" data-start="{" data-end="}">
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="../../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">   54</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x, std::valarray&lt;double&gt; *y,</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>             std::valarray&lt;double&gt; *dy) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keyword">const</span> <span class="keywordtype">double</span> omega = 1.F;             <span class="comment">// some const for the problem</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    (*dy)[0] = (*y)[1];                   <span class="comment">// x dot // NOLINT</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    (*dy)[1] = -omega * omega * (*y)[0];  <span class="comment">// y dot // NOLINT</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>}</div>
+</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="foldopen" id="foldopen00067" data-start="{" data-end="}">
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b">   67</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b">exact_solution</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x, std::valarray&lt;double&gt; *y) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    y[0][0] = std::cos(x);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    y[0][1] = -std::sin(x);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>}</div>
+</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="foldopen" id="foldopen00086" data-start="{" data-end="}">
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="../../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723">   86</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723">forward_euler_step</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> dx, <span class="keyword">const</span> <span class="keywordtype">double</span> x,</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>                        std::valarray&lt;double&gt; *y, std::valarray&lt;double&gt; *dy) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <a class="code hl_function" href="../../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a>(x, y, dy);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    *y += *dy * dx;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>}</div>
+</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="foldopen" id="foldopen00102" data-start="{" data-end="}">
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"><a class="line" href="../../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9">  102</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9">forward_euler</a>(<span class="keywordtype">double</span> dx, <span class="keywordtype">double</span> x0, <span class="keywordtype">double</span> x_max,</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>                     std::valarray&lt;double&gt; *y, <span class="keywordtype">bool</span> save_to_file = <span class="keyword">false</span>) {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::valarray&lt;double&gt; dy = *y;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    std::ofstream fp;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <span class="keywordflow">if</span> (save_to_file) {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        fp.open(<span class="stringliteral">&quot;forward_euler.csv&quot;</span>, std::ofstream::out);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        <span class="keywordflow">if</span> (!fp.is_open()) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>            std::perror(<span class="stringliteral">&quot;Error! &quot;</span>);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        }</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    }</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::size_t L = y-&gt;size();</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <span class="comment">/* start integration */</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    std::clock_t t1 = std::clock();</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <span class="keywordtype">double</span> x = x0;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <span class="keywordflow">do</span> {  <span class="comment">// iterate for each step of independent variable</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        <span class="keywordflow">if</span> (save_to_file &amp;&amp; fp.is_open()) {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>            <span class="comment">// write to file</span></div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>            fp &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; L - 1; i++) {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>                fp &lt;&lt; y[0][i] &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;  <span class="comment">// NOLINT</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>            }</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>            fp &lt;&lt; y[0][L - 1] &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;  <span class="comment">// NOLINT</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        }</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        <a class="code hl_function" href="../../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723">forward_euler_step</a>(dx, x, y, &amp;dy);  <span class="comment">// perform integration</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        x += dx;                            <span class="comment">// update step</span></div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    } <span class="keywordflow">while</span> (x &lt;= x_max);  <span class="comment">// till upper limit of independent variable</span></div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <span class="comment">/* end of integration */</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    std::clock_t t2 = std::clock();</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span> </div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    <span class="keywordflow">if</span> (fp.is_open()) {</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        fp.close();</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    }</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span> </div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(t2 - t1) / CLOCKS_PER_SEC;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>}</div>
+</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span> </div>
+<div class="foldopen" id="foldopen00153" data-start="{" data-end="}">
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"><a class="line" href="../../db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f">  153</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a>(<span class="keyword">const</span> <span class="keywordtype">double</span> &amp;X0, <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;X_MAX,</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>                         <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;step_size,</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>                         <span class="keyword">const</span> std::valarray&lt;double&gt; &amp;Y0) {</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    <span class="keywordtype">double</span> x = X0;</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    std::valarray&lt;double&gt; y(Y0);</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span> </div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    std::ofstream fp(<span class="stringliteral">&quot;exact.csv&quot;</span>, std::ostream::out);</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    <span class="keywordflow">if</span> (!fp.is_open()) {</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        std::perror(<span class="stringliteral">&quot;Error! &quot;</span>);</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    }</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Finding exact solution\n&quot;</span>;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span> </div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    std::clock_t t1 = std::clock();</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        fp &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; y.size() - 1; i++) {</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>            fp &lt;&lt; y[i] &lt;&lt; <span class="stringliteral">&quot;,&quot;</span>;  <span class="comment">// NOLINT</span></div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>        }</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>        fp &lt;&lt; y[y.size() - 1] &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;  <span class="comment">// NOLINT</span></div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span> </div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        <a class="code hl_function" href="../../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b">exact_solution</a>(x, &amp;y);</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span> </div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        x += step_size;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    } <span class="keywordflow">while</span> (x &lt;= X_MAX);</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    std::clock_t t2 = std::clock();</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    <span class="keywordtype">double</span> total_time = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(t2 - t1) / CLOCKS_PER_SEC;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tTime = &quot;</span> &lt;&lt; total_time &lt;&lt; <span class="stringliteral">&quot; ms\n&quot;</span>;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span> </div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    fp.close();</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>}</div>
+</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span> </div>
+<div class="foldopen" id="foldopen00189" data-start="{" data-end="}">
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"><a class="line" href="../../db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">  189</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[]) {</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    <span class="keywordtype">double</span> X0 = 0.f;                    <span class="comment">/* initial value of x0 */</span></div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    <span class="keywordtype">double</span> X_MAX = 10.F;                <span class="comment">/* upper limit of integration */</span></div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    std::valarray&lt;double&gt; Y0{1.f, 0.f}; <span class="comment">/* initial value Y = y(x = x_0) */</span></div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    <span class="keywordtype">double</span> step_size = NAN;</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span> </div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    <span class="keywordflow">if</span> (argc == 1) {</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the step size: &quot;</span>;</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>        std::cin &gt;&gt; step_size;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        <span class="comment">// use commandline argument as independent variable step size</span></div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>        step_size = std::atof(argv[1]);</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    }</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span> </div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    <span class="comment">// get approximate solution</span></div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    <span class="keywordtype">double</span> total_time = <a class="code hl_function" href="../../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9">forward_euler</a>(step_size, X0, X_MAX, &amp;Y0, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tTime = &quot;</span> &lt;&lt; total_time &lt;&lt; <span class="stringliteral">&quot; ms\n&quot;</span>;</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span> </div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    <span class="comment">/* compute exact solution for comparion */</span></div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    <a class="code hl_function" href="../../db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a>(X0, X_MAX, step_size, Y0);</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span> </div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>}</div>
+</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="agroup__ode_html_ga195d23bbdfcb80e83c9cda45c9ad5723"><div class="ttname"><a href="../../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723">forward_euler_step</a></div><div class="ttdeci">void forward_euler_step(const double dx, const double x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Compute next step approximation using the forward-Euler method.</div><div class="ttdef"><b>Definition</b> <a href="#l00086">ode_forward_euler.cpp:86</a></div></div>
+<div class="ttc" id="agroup__ode_html_gae0509f8843e2bc42de2abbd00a14b7b9"><div class="ttname"><a href="../../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9">forward_euler</a></div><div class="ttdeci">double forward_euler(double dx, double x0, double x_max, std::valarray&lt; double &gt; *y, bool save_to_file=false)</div><div class="ttdoc">Compute approximation using the forward-Euler method in the given limits.</div><div class="ttdef"><b>Definition</b> <a href="#l00102">ode_forward_euler.cpp:102</a></div></div>
+<div class="ttc" id="aode__forward__euler_8cpp_html_aa13517b8e5de1b75592052db7f7e237f"><div class="ttname"><a href="../../db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f">save_exact_solution</a></div><div class="ttdeci">void save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0)</div><div class="ttdef"><b>Definition</b> <a href="#l00153">ode_forward_euler.cpp:153</a></div></div>
+<div class="ttc" id="aode__forward__euler_8cpp_html_abaeae8f62a018d197f0187a1c80a90fe"><div class="ttname"><a href="../../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe">problem</a></div><div class="ttdeci">void problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy)</div><div class="ttdoc">Problem statement for a system with first-order differential equations. Updates the system differenti...</div><div class="ttdef"><b>Definition</b> <a href="#l00054">ode_forward_euler.cpp:54</a></div></div>
+<div class="ttc" id="aode__forward__euler_8cpp_html_af3adf7b092a87868917ee5fb4255192b"><div class="ttname"><a href="../../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b">exact_solution</a></div><div class="ttdeci">void exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y)</div><div class="ttdoc">Exact solution of the problem. Used for solution comparison.</div><div class="ttdef"><b>Definition</b> <a href="#l00067">ode_forward_euler.cpp:67</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../db/dd3/ode__forward__euler_8cpp.html">ode_forward_euler.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/ddb/classhash__chain__coll__graph.map b/db/ddb/classhash__chain__coll__graph.map
index 510ddd67e..651d010f9 100644
--- a/db/ddb/classhash__chain__coll__graph.map
+++ b/db/ddb/classhash__chain__coll__graph.map
@@ -1,12 +1,12 @@
 <map id="hash_chain" name="hash_chain">
 <area shape="rect" id="Node000001" title="Chain class with a given modulus." alt="" coords="43,390,131,416"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="7,286,167,327"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="7,286,167,327"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="90,342,90,390,84,390,84,342"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="5,198,169,223"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="5,198,169,223"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="90,239,90,286,84,286,84,239"/>
 <area shape="rect" id="Node000004" href="$db/d8b/struct_node.html" title=" " alt="" coords="19,109,155,135"/>
 <area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="90,150,90,197,84,197,84,150"/>
 <area shape="poly" id="edge5_Node000004_Node000004" title=" " alt="" coords="172,114,182,122,174,130,156,132,155,127,171,125,177,122,169,118"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="11,5,163,46"/>
+<area shape="rect" id="Node000005" title=" " alt="" coords="11,5,163,46"/>
 <area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="90,61,90,109,84,109,84,61"/>
 </map>
diff --git a/db/ddb/classhash__chain__coll__graph.md5 b/db/ddb/classhash__chain__coll__graph.md5
index 0eb30c00c..e28b49fcf 100644
--- a/db/ddb/classhash__chain__coll__graph.md5
+++ b/db/ddb/classhash__chain__coll__graph.md5
@@ -1 +1 @@
-9a0469be3e837a0deef3b2d63f7ffd80
\ No newline at end of file
+f169a0514c6ffc2d25ca3e3354118a1c
\ No newline at end of file
diff --git a/db/ddb/classhash__chain__coll__graph.svg b/db/ddb/classhash__chain__coll__graph.svg
index 350e6b7f5..daa4e4144 100644
--- a/db/ddb/classhash__chain__coll__graph.svg
+++ b/db/ddb/classhash__chain__coll__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="121.38,-97 1.12,-97 1.12,-66.5 121.38,-66.5 121.38,-97"/>
 <text text-anchor="start" x="9.12" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::shared</text>
 <text text-anchor="middle" x="61.25" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">_ptr&lt; Node &gt; &gt;</text>
@@ -51,7 +51,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="122.5,-163.5 0,-163.5 0,-144.25 122.5,-144.25 122.5,-163.5"/>
 <text text-anchor="middle" x="61.25" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Node &gt;</text>
 </a>
@@ -99,7 +99,7 @@
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000005"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="118,-307.75 4.5,-307.75 4.5,-277.25 118,-277.25 118,-307.75"/>
 <text text-anchor="start" x="12.5" y="-294.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Node</text>
 <text text-anchor="middle" x="61.25" y="-283" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; ValueType &gt; &gt;</text>
diff --git a/db/ddb/classhash__chain__coll__graph_org.svg b/db/ddb/classhash__chain__coll__graph_org.svg
index 8ecda0205..eded5de43 100644
--- a/db/ddb/classhash__chain__coll__graph_org.svg
+++ b/db/ddb/classhash__chain__coll__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="121.38,-97 1.12,-97 1.12,-66.5 121.38,-66.5 121.38,-97"/>
 <text text-anchor="start" x="9.12" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::shared</text>
 <text text-anchor="middle" x="61.25" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">_ptr&lt; Node &gt; &gt;</text>
@@ -40,7 +40,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="122.5,-163.5 0,-163.5 0,-144.25 122.5,-144.25 122.5,-163.5"/>
 <text text-anchor="middle" x="61.25" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Node &gt;</text>
 </a>
@@ -88,7 +88,7 @@
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000005"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="118,-307.75 4.5,-307.75 4.5,-277.25 118,-277.25 118,-307.75"/>
 <text text-anchor="start" x="12.5" y="-294.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Node</text>
 <text text-anchor="middle" x="61.25" y="-283" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; ValueType &gt; &gt;</text>
diff --git a/db/ddc/namespaceaystar__search.html b/db/ddc/namespaceaystar__search.html
index ce08b6424..d6de35a39 100644
--- a/db/ddc/namespaceaystar__search.html
+++ b/db/ddc/namespaceaystar__search.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: aystar_search Namespace Reference</title>
+<title>TheAlgorithms/C++: aystar_search Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/db/dde/namespaceothers_1_1_cache.html b/db/dde/namespaceothers_1_1_cache.html
index cb4058a69..ab22ae01d 100644
--- a/db/dde/namespaceothers_1_1_cache.html
+++ b/db/dde/namespaceothers_1_1_cache.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others::Cache Namespace Reference</title>
+<title>TheAlgorithms/C++: others::Cache Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -128,14 +145,32 @@ Classes</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="typedef-members" name="typedef-members"></a>
 Typedefs</h2></td></tr>
-<tr class="memitem:a5c0dfbf62803f020205076c3da18d058" id="r_a5c0dfbf62803f020205076c3da18d058"><td class="memTemplParams" colspan="2"><a id="a5c0dfbf62803f020205076c3da18d058" name="a5c0dfbf62803f020205076c3da18d058"></a>
-template&lt;typename K , typename V &gt; </td></tr>
-<tr class="memitem:a5c0dfbf62803f020205076c3da18d058"><td class="memTemplItemLeft" align="right" valign="top">using&#160;</td><td class="memTemplItemRight" valign="bottom"><b>CacheNode</b> = <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a>&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt;K, V&gt;&gt;</td></tr>
+<tr class="memitem:a5c0dfbf62803f020205076c3da18d058" id="r_a5c0dfbf62803f020205076c3da18d058"><td class="memTemplParams" colspan="2">template&lt;typename K , typename V &gt; </td></tr>
+<tr class="memitem:a5c0dfbf62803f020205076c3da18d058"><td class="memTemplItemLeft" align="right" valign="top">using&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5c0dfbf62803f020205076c3da18d058">CacheNode</a> = <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a>&lt;std::pair&lt;K, V&gt;&gt;</td></tr>
 <tr class="separator:a5c0dfbf62803f020205076c3da18d058"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a class="el" href="../../db/dde/namespaceothers_1_1_cache.html" title="Cache algorithm.">Cache</a> algorithm. </p>
-</div></div><!-- contents -->
+</div><h2 class="groupheader">Typedef Documentation</h2>
+<a id="a5c0dfbf62803f020205076c3da18d058" name="a5c0dfbf62803f020205076c3da18d058"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a5c0dfbf62803f020205076c3da18d058">&#9670;&#160;</a></span>CacheNode</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename K , typename V &gt; </div>
+      <table class="memname">
+        <tr>
+          <td class="memname">using <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::CacheNode</a> = <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a>&lt;std::pair&lt;K, V&gt;&gt;</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
+
+</div>
+</div>
+</div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
diff --git a/db/de3/numeric__string__sort_8cpp_source.html b/db/de3/numeric__string__sort_8cpp_source.html
new file mode 100644
index 000000000..5b760f769
--- /dev/null
+++ b/db/de3/numeric__string__sort_8cpp_source.html
@@ -0,0 +1,193 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/numeric_string_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/de3/numeric__string__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">numeric_string_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">// Using general algorithms to sort a collection of strings results in</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment">// alphanumeric sort. If it is a numeric string, it leads to unnatural sorting</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment">// eg, an array of strings 1,10,100,2,20,200,3,30,300</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment">// would be sorted in that same order by using conventional sorting,</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment">// even though we know the correct sorting order is 1,2,3,10,20,30,100,200,300</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment">// This Programme uses a comparator to sort the array in Numerical order instead</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment">// of Alphanumeric order</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;string&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="keywordtype">bool</span> NumericSort(std::string a, std::string b) {</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="keywordflow">while</span> (a[0] == <span class="charliteral">&#39;0&#39;</span>) {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        a.erase(a.begin());</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    }</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="keywordflow">while</span> (b[0] == <span class="charliteral">&#39;0&#39;</span>) {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        b.erase(b.begin());</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    }</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    <span class="keywordtype">int</span> n = a.length();</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="keywordtype">int</span> m = b.length();</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="keywordflow">if</span> (n == m)</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        <span class="keywordflow">return</span> a &lt; b;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordflow">return</span> n &lt; m;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>}</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordtype">int</span> n;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter number of elements to be sorted Numerically\n&quot;</span>;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    std::vector&lt;std::string&gt; v(n);</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the string of Numbers\n&quot;</span>;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        std::cin &gt;&gt; v[i];</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    }</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    sort(v.begin(), v.end());</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Elements sorted normally \n&quot;</span>;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        std::cout &lt;&lt; v[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    std::sort(v.begin(), v.end(), NumericSort);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Elements sorted Numerically \n&quot;</span>;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        std::cout &lt;&lt; v[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    }</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><b>numeric_string_sort.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/df3/classmachine__learning_1_1aystar__search_1_1_eight_puzzle-members.html b/db/df3/classmachine__learning_1_1aystar__search_1_1_eight_puzzle-members.html
index 1eee0ff0a..b47bb7d25 100644
--- a/db/df3/classmachine__learning_1_1aystar__search_1_1_eight_puzzle-members.html
+++ b/db/df3/classmachine__learning_1_1aystar__search_1_1_eight_puzzle-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/db/df3/happy__number_8cpp.html b/db/df3/happy__number_8cpp.html
index dd85edd8a..bcc03b6db 100644
--- a/db/df3/happy__number_8cpp.html
+++ b/db/df3/happy__number_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/happy_number.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/happy_number.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,7 +135,9 @@ Include dependency graph for happy_number.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dd9/happy__number_8cpp__incl.svg" width="182" height="111"><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">
+</div>
+<p><a href="../../db/df3/happy__number_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a00ccdb1166a7c83ac3c33ac67a2532b7" id="r_a00ccdb1166a7c83ac3c33ac67a2532b7"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
@@ -129,6 +148,8 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A happy number is a number whose sum of digits is calculated until the sum is a single digit, and this sum turns out to be 1. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../db/df3/happy__number_8cpp_source.html">happy_number.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a00ccdb1166a7c83ac3c33ac67a2532b7" name="a00ccdb1166a7c83ac3c33ac67a2532b7"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a00ccdb1166a7c83ac3c33ac67a2532b7">&#9670;&#160;</a></span>is_happy()</h2>
@@ -147,6 +168,8 @@ template&lt;typename T &gt; </div>
       </table>
 </div><div class="memdoc">
 <p>Checks if a decimal number is a happy number </p><dl class="section return"><dt>Returns</dt><dd>true if happy else false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/df3/happy__number_8cpp_source.html#l00014">14</a> of file <a class="el" href="../../db/df3/happy__number_8cpp_source.html">happy_number.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   14</span>                   {</div>
 <div class="line"><span class="lineno">   15</span>    T s = 0;              <span class="comment">// stores sum of digits</span></div>
 <div class="line"><span class="lineno">   16</span>    <span class="keywordflow">while</span> (n &gt; 9) {       <span class="comment">// while number is &gt; 9, there are more than 1 digit</span></div>
@@ -178,27 +201,21 @@ template&lt;typename T &gt; </div>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/df3/happy__number_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../db/df3/happy__number_8cpp_source.html">happy_number.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   29</span>           {</div>
 <div class="line"><span class="lineno">   30</span>    <span class="keywordtype">int</span> n;</div>
-<div class="line"><span class="lineno">   31</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter a number:&quot;</span>;</div>
-<div class="line"><span class="lineno">   32</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;</div>
+<div class="line"><span class="lineno">   31</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter a number:&quot;</span>;</div>
+<div class="line"><span class="lineno">   32</span>    std::cin &gt;&gt; n;</div>
 <div class="line"><span class="lineno">   33</span> </div>
 <div class="line"><span class="lineno">   34</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="#a00ccdb1166a7c83ac3c33ac67a2532b7">is_happy</a>(n))</div>
-<div class="line"><span class="lineno">   35</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is a happy number&quot;</span> &lt;&lt; <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">   35</span>        std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is a happy number&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   36</span>    <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">   37</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is not a happy number&quot;</span> &lt;&lt; <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">   37</span>        std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is not a happy number&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   38</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   39</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="ahappy__number_8cpp_html_a00ccdb1166a7c83ac3c33ac67a2532b7"><div class="ttname"><a href="#a00ccdb1166a7c83ac3c33ac67a2532b7">is_happy</a></div><div class="ttdeci">bool is_happy(T n)</div><div class="ttdef"><b>Definition</b> happy_number.cpp:14</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="182" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ahappy__number_8cpp_html_a00ccdb1166a7c83ac3c33ac67a2532b7"><div class="ttname"><a href="#a00ccdb1166a7c83ac3c33ac67a2532b7">is_happy</a></div><div class="ttdeci">bool is_happy(T n)</div><div class="ttdef"><b>Definition</b> <a href="../../db/df3/happy__number_8cpp_source.html#l00014">happy_number.cpp:14</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 09f472ea5..000000000
--- a/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="104,5,175,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,35,88,27,89,33,56,40"/>
-<area shape="rect" id="Node000003" href="$db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7" title=" " alt="" coords="103,55,176,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,46,88,54,87,59,54,51"/>
-</map>
diff --git a/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index e11919944..000000000
--- a/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-91232e8f6a0d2d2021cd5e316ba02c56
\ No newline at end of file
diff --git a/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 96efb4db8..000000000
--- a/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="136pt" height="64pt"
- viewBox="0.00 0.00 136.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-56.25 73.75,-56.25 73.75,-37 127.25,-37 127.25,-56.25"/>
-<text text-anchor="middle" x="100.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.25,-31.84C44.62,-33.59 53.45,-35.69 62.12,-37.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.28,-41.14 71.82,-40.05 62.89,-34.33 61.28,-41.14"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="128,-19.25 73,-19.25 73,0 128,0 128,-19.25"/>
-<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">is_happy</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.25,-23.63C44.49,-22 53.14,-20.05 61.67,-18.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.21,-21.6 71.19,-15.99 60.67,-14.77 62.21,-21.6"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 09cbbd577..000000000
--- a/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="136pt" height="64pt"
- viewBox="0.00 0.00 136.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="127.25,-56.25 73.75,-56.25 73.75,-37 127.25,-37 127.25,-56.25"/>
-<text text-anchor="middle" x="100.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.25,-31.84C44.62,-33.59 53.45,-35.69 62.12,-37.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.28,-41.14 71.82,-40.05 62.89,-34.33 61.28,-41.14"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="128,-19.25 73,-19.25 73,0 128,0 128,-19.25"/>
-<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">is_happy</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.25,-23.63C44.49,-22 53.14,-20.05 61.67,-18.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.21,-21.6 71.19,-15.99 60.67,-14.77 62.21,-21.6"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/df3/happy__number_8cpp_source.html b/db/df3/happy__number_8cpp_source.html
new file mode 100644
index 000000000..fb1691d3b
--- /dev/null
+++ b/db/df3/happy__number_8cpp_source.html
@@ -0,0 +1,172 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/happy_number.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/df3/happy__number_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">happy_number.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../db/df3/happy__number_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00014" data-start="{" data-end="}">
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"><a class="line" href="../../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7">   14</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7">is_happy</a>(T n) {</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    T s = 0;              <span class="comment">// stores sum of digits</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <span class="keywordflow">while</span> (n &gt; 9) {       <span class="comment">// while number is &gt; 9, there are more than 1 digit</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>        <span class="keywordflow">while</span> (n != 0) {  <span class="comment">// get digit</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>            T d = n % 10;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>            s += d;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>            n /= 10;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        }</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        n = s;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        s = 0;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    }</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="keywordflow">return</span> (n == 1) ? true : <span class="keyword">false</span>;  <span class="comment">// true if k == 1</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>}</div>
+</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="foldopen" id="foldopen00029" data-start="{" data-end="}">
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   29</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordtype">int</span> n;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter a number:&quot;</span>;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="../../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7">is_happy</a>(n))</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is a happy number&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; is not a happy number&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>}</div>
+</div>
+<div class="ttc" id="ahappy__number_8cpp_html_a00ccdb1166a7c83ac3c33ac67a2532b7"><div class="ttname"><a href="../../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7">is_happy</a></div><div class="ttdeci">bool is_happy(T n)</div><div class="ttdef"><b>Definition</b> <a href="#l00014">happy_number.cpp:14</a></div></div>
+<div class="ttc" id="ahappy__number_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00029">happy_number.cpp:29</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../db/df3/happy__number_8cpp.html">happy_number.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/db/dfb/maximum__circular__subarray_8cpp.html b/db/dfb/maximum__circular__subarray_8cpp.html
index 0919611be..d1ea386c9 100644
--- a/db/dfb/maximum__circular__subarray_8cpp.html
+++ b/db/dfb/maximum__circular__subarray_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/maximum_circular_subarray.cpp File Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming/maximum_circular_subarray.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for maximum_circular_subarray.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/de6/maximum__circular__subarray_8cpp__incl.svg" width="252" height="126"><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">
+</div>
+<p><a href="../../db/dfb/maximum__circular__subarray_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
@@ -130,7 +149,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a5239174fa0d987f2c67edc1f2af82beb" id="r_a5239174fa0d987f2c67edc1f2af82beb"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb">dynamic_programming::maxCircularSum</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;arr)</td></tr>
+<tr class="memitem:a5239174fa0d987f2c67edc1f2af82beb" id="r_a5239174fa0d987f2c67edc1f2af82beb"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb">dynamic_programming::maxCircularSum</a> (std::vector&lt; int &gt; &amp;arr)</td></tr>
 <tr class="memdesc:a5239174fa0d987f2c67edc1f2af82beb"><td class="mdescLeft">&#160;</td><td class="mdescRight">returns the maximum contiguous circular sum of an array  <br /></td></tr>
 <tr class="separator:a5239174fa0d987f2c67edc1f2af82beb"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -143,6 +162,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>C++ program for maximum contiguous circular sum problem using <a href="https://en.wikipedia.org/wiki/Maximum_subarray_problem" target="_blank">Kadane's Algorithm</a> </p>
 <p>The idea is to modify Kadane’s algorithm to find a minimum contiguous subarray sum and the maximum contiguous subarray sum, then check for the maximum value between the max_value and the value left after subtracting min_value from the total sum. For more information, check <a href="https://www.geeksforgeeks.org/maximum-contiguous-circular-sum/" target="_blank">Geeks For Geeks</a> explanation page. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../db/dfb/maximum__circular__subarray_8cpp_source.html">maximum_circular_subarray.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">&#9670;&#160;</a></span>main()</h2>
@@ -172,17 +193,14 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dfb/maximum__circular__subarray_8cpp_source.html#l00087">87</a> of file <a class="el" href="../../db/dfb/maximum__circular__subarray_8cpp_source.html">maximum_circular_subarray.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   87</span>                                 {</div>
 <div class="line"><span class="lineno">   88</span>     <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   89</span>     <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   90</span>}</div>
-<div class="ttc" id="amaximum__circular__subarray_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> maximum_circular_subarray.cpp:64</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/dfb/maximum__circular__subarray_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="515" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amaximum__circular__subarray_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dfb/maximum__circular__subarray_8cpp_source.html#l00064">maximum_circular_subarray.cpp:64</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -210,6 +228,8 @@ Here is the call graph for this function:</div>
 
 <p>Self-test implementation. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dfb/maximum__circular__subarray_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../db/dfb/maximum__circular__subarray_8cpp_source.html">maximum_circular_subarray.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   64</span>                   {</div>
 <div class="line"><span class="lineno">   65</span>    <span class="comment">// Description of the test</span></div>
 <div class="line"><span class="lineno">   66</span>    <span class="comment">// Input: arr[] = {8, -8, 9, -9, 10, -11, 12}</span></div>
@@ -217,23 +237,16 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   68</span>    <span class="comment">// Explanation: Subarray 12, 8, -8, 9, -9, 10 gives the maximum sum, that is 22.</span></div>
 <div class="line"><span class="lineno">   69</span> </div>
 <div class="line"><span class="lineno">   70</span>    <span class="keywordtype">int</span> n = 7; <span class="comment">// size of the array</span></div>
-<div class="line"><span class="lineno">   71</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> arr = {8, -8, 9, -9, 10, -11, 12}; </div>
+<div class="line"><span class="lineno">   71</span>    std::vector&lt;int&gt; arr = {8, -8, 9, -9, 10, -11, 12}; </div>
 <div class="line"><span class="lineno">   72</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb">dynamic_programming::maxCircularSum</a>(arr) == 22); <span class="comment">// this ensures that the algorithm works as expected</span></div>
 <div class="line"><span class="lineno">   73</span> </div>
 <div class="line"><span class="lineno">   74</span>    arr = {8, -8, 10, -9, 10, -11, 12};</div>
 <div class="line"><span class="lineno">   75</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb">dynamic_programming::maxCircularSum</a>(arr) == 23);</div>
 <div class="line"><span class="lineno">   76</span> </div>
-<div class="line"><span class="lineno">   77</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   77</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   78</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="anamespacedynamic__programming_html_a5239174fa0d987f2c67edc1f2af82beb"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb">dynamic_programming::maxCircularSum</a></div><div class="ttdeci">int maxCircularSum(std::vector&lt; int &gt; &amp;arr)</div><div class="ttdoc">returns the maximum contiguous circular sum of an array</div><div class="ttdef"><b>Definition</b> maximum_circular_subarray.cpp:26</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/dfb/maximum__circular__subarray_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="418" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacedynamic__programming_html_a5239174fa0d987f2c67edc1f2af82beb"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb">dynamic_programming::maxCircularSum</a></div><div class="ttdeci">int maxCircularSum(std::vector&lt; int &gt; &amp;arr)</div><div class="ttdoc">returns the maximum contiguous circular sum of an array</div><div class="ttdef"><b>Definition</b> <a href="../../db/dfb/maximum__circular__subarray_8cpp_source.html#l00026">maximum_circular_subarray.cpp:26</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/db/dfb/maximum__circular__subarray_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/db/dfb/maximum__circular__subarray_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
deleted file mode 100644
index ec6aca280..000000000
--- a/db/dfb/maximum__circular__subarray_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,55,55,80"/>
-<area shape="rect" id="Node000002" href="$db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementation." alt="" coords="103,55,146,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,65,87,65,87,70,55,70"/>
-<area shape="rect" id="Node000003" href="$dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb" title="returns the maximum contiguous circular sum of an array" alt="" coords="194,47,346,88"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,65,178,65,178,70,146,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="416,5,488,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="346,44,400,29,401,34,348,49"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="418,55,486,80"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="347,65,402,65,402,70,347,70"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="394,104,510,130"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="348,86,388,97,386,102,346,91"/>
-</map>
diff --git a/db/dfb/maximum__circular__subarray_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/db/dfb/maximum__circular__subarray_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
deleted file mode 100644
index 5fefad8d0..000000000
--- a/db/dfb/maximum__circular__subarray_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d91566c02b05353fba3f861bd0e57682
\ No newline at end of file
diff --git a/db/dfb/maximum__circular__subarray_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/db/dfb/maximum__circular__subarray_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
deleted file mode 100644
index 60aa6e85d..000000000
--- a/db/dfb/maximum__circular__subarray_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ /dev/null
@@ -1,138 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="386pt" height="101pt"
- viewBox="0.00 0.00 386.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementation.">
-<polygon fill="white" stroke="#666666" points="105.5,-56.25 73,-56.25 73,-37 105.5,-37 105.5,-56.25"/>
-<text text-anchor="middle" x="89.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-46.62C44.58,-46.62 53.31,-46.62 61.45,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-50.13 71.2,-46.63 61.2,-43.13 61.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb" target="_top" xlink:title="returns the maximum contiguous circular sum of an array">
-<polygon fill="white" stroke="#666666" points="255.75,-61.88 141.5,-61.88 141.5,-31.38 255.75,-31.38 255.75,-61.88"/>
-<text text-anchor="start" x="149.5" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="198.62" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::maxCircularSum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.63,-46.62C112.32,-46.62 120.66,-46.62 129.57,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.57,-50.13 139.57,-46.63 129.57,-43.13 129.57,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="362.12,-93.25 307.88,-93.25 307.88,-74 362.12,-74 362.12,-93.25"/>
-<text text-anchor="middle" x="335" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.22,-62.21C269.84,-65.96 284.06,-69.87 296.55,-73.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.45,-76.64 306.02,-75.92 297.31,-69.89 295.45,-76.64"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="360.62,-56.25 309.38,-56.25 309.38,-37 360.62,-37 360.62,-56.25"/>
-<text text-anchor="middle" x="335" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.22,-46.62C270.28,-46.62 284.97,-46.62 297.76,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.37,-50.13 307.37,-46.63 297.37,-43.13 297.37,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="378.25,-19.25 291.75,-19.25 291.75,0 378.25,0 378.25,-19.25"/>
-<text text-anchor="middle" x="335" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.22,-31.04C266.22,-28.29 276.55,-25.44 286.27,-22.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.19,-26.14 295.9,-20.11 285.33,-19.4 287.19,-26.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/dfb/maximum__circular__subarray_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/db/dfb/maximum__circular__subarray_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
deleted file mode 100644
index 308574533..000000000
--- a/db/dfb/maximum__circular__subarray_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
+++ /dev/null
@@ -1,112 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="386pt" height="101pt"
- viewBox="0.00 0.00 386.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementation.">
-<polygon fill="white" stroke="#666666" points="105.5,-56.25 73,-56.25 73,-37 105.5,-37 105.5,-56.25"/>
-<text text-anchor="middle" x="89.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-46.62C44.58,-46.62 53.31,-46.62 61.45,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-50.13 71.2,-46.63 61.2,-43.13 61.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb" target="_top" xlink:title="returns the maximum contiguous circular sum of an array">
-<polygon fill="white" stroke="#666666" points="255.75,-61.88 141.5,-61.88 141.5,-31.38 255.75,-31.38 255.75,-61.88"/>
-<text text-anchor="start" x="149.5" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="198.62" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::maxCircularSum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.63,-46.62C112.32,-46.62 120.66,-46.62 129.57,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.57,-50.13 139.57,-46.63 129.57,-43.13 129.57,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="362.12,-93.25 307.88,-93.25 307.88,-74 362.12,-74 362.12,-93.25"/>
-<text text-anchor="middle" x="335" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.22,-62.21C269.84,-65.96 284.06,-69.87 296.55,-73.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.45,-76.64 306.02,-75.92 297.31,-69.89 295.45,-76.64"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="360.62,-56.25 309.38,-56.25 309.38,-37 360.62,-37 360.62,-56.25"/>
-<text text-anchor="middle" x="335" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.22,-46.62C270.28,-46.62 284.97,-46.62 297.76,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.37,-50.13 307.37,-46.63 297.37,-43.13 297.37,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="378.25,-19.25 291.75,-19.25 291.75,0 378.25,0 378.25,-19.25"/>
-<text text-anchor="middle" x="335" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.22,-31.04C266.22,-28.29 276.55,-25.44 286.27,-22.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.19,-26.14 295.9,-20.11 285.33,-19.4 287.19,-26.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/dfb/maximum__circular__subarray_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/db/dfb/maximum__circular__subarray_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 9107d179a..000000000
--- a/db/dfb/maximum__circular__subarray_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementation." alt="" coords="5,55,49,80"/>
-<area shape="rect" id="Node000002" href="$dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb" title="returns the maximum contiguous circular sum of an array" alt="" coords="97,47,249,88"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,65,81,65,81,70,49,70"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="318,5,391,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="249,44,303,29,304,34,250,49"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="320,55,389,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="250,65,305,65,305,70,250,70"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="297,104,412,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="250,86,290,97,289,102,249,91"/>
-</map>
diff --git a/db/dfb/maximum__circular__subarray_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/db/dfb/maximum__circular__subarray_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 6feb92e1b..000000000
--- a/db/dfb/maximum__circular__subarray_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-51fd8019e496a8cfa3f4560491e87b8f
\ No newline at end of file
diff --git a/db/dfb/maximum__circular__subarray_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/db/dfb/maximum__circular__subarray_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index c3e091c4f..000000000
--- a/db/dfb/maximum__circular__subarray_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="313pt" height="101pt"
- viewBox="0.00 0.00 313.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementation.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-56.25 0,-56.25 0,-37 32.5,-37 32.5,-56.25"/>
-<text text-anchor="middle" x="16.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb" target="_top" xlink:title="returns the maximum contiguous circular sum of an array">
-<polygon fill="white" stroke="#666666" points="182.75,-61.88 68.5,-61.88 68.5,-31.38 182.75,-31.38 182.75,-61.88"/>
-<text text-anchor="start" x="76.5" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="125.62" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::maxCircularSum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.63,-46.62C39.32,-46.62 47.66,-46.62 56.57,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.57,-50.13 66.57,-46.63 56.57,-43.13 56.57,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="289.12,-93.25 234.88,-93.25 234.88,-74 289.12,-74 289.12,-93.25"/>
-<text text-anchor="middle" x="262" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.22,-62.21C196.84,-65.96 211.06,-69.87 223.55,-73.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.45,-76.64 233.02,-75.92 224.31,-69.89 222.45,-76.64"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="287.62,-56.25 236.38,-56.25 236.38,-37 287.62,-37 287.62,-56.25"/>
-<text text-anchor="middle" x="262" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.22,-46.62C197.28,-46.62 211.97,-46.62 224.76,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.37,-50.13 234.37,-46.63 224.37,-43.13 224.37,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-19.25 218.75,-19.25 218.75,0 305.25,0 305.25,-19.25"/>
-<text text-anchor="middle" x="262" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.22,-31.04C193.22,-28.29 203.55,-25.44 213.27,-22.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.19,-26.14 222.9,-20.11 212.33,-19.4 214.19,-26.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/db/dfb/maximum__circular__subarray_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/db/dfb/maximum__circular__subarray_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 868b2c516..000000000
--- a/db/dfb/maximum__circular__subarray_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="313pt" height="101pt"
- viewBox="0.00 0.00 313.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementation.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-56.25 0,-56.25 0,-37 32.5,-37 32.5,-56.25"/>
-<text text-anchor="middle" x="16.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb" target="_top" xlink:title="returns the maximum contiguous circular sum of an array">
-<polygon fill="white" stroke="#666666" points="182.75,-61.88 68.5,-61.88 68.5,-31.38 182.75,-31.38 182.75,-61.88"/>
-<text text-anchor="start" x="76.5" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="125.62" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::maxCircularSum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.63,-46.62C39.32,-46.62 47.66,-46.62 56.57,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.57,-50.13 66.57,-46.63 56.57,-43.13 56.57,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="289.12,-93.25 234.88,-93.25 234.88,-74 289.12,-74 289.12,-93.25"/>
-<text text-anchor="middle" x="262" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.22,-62.21C196.84,-65.96 211.06,-69.87 223.55,-73.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.45,-76.64 233.02,-75.92 224.31,-69.89 222.45,-76.64"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="287.62,-56.25 236.38,-56.25 236.38,-37 287.62,-37 287.62,-56.25"/>
-<text text-anchor="middle" x="262" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.22,-46.62C197.28,-46.62 211.97,-46.62 224.76,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.37,-50.13 234.37,-46.63 224.37,-43.13 224.37,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-19.25 218.75,-19.25 218.75,0 305.25,0 305.25,-19.25"/>
-<text text-anchor="middle" x="262" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.22,-31.04C193.22,-28.29 203.55,-25.44 213.27,-22.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.19,-26.14 222.9,-20.11 212.33,-19.4 214.19,-26.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/db/dfb/maximum__circular__subarray_8cpp_source.html b/db/dfb/maximum__circular__subarray_8cpp_source.html
new file mode 100644
index 000000000..b9dbe9910
--- /dev/null
+++ b/db/dfb/maximum__circular__subarray_8cpp_source.html
@@ -0,0 +1,209 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/maximum_circular_subarray.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('db/dfb/maximum__circular__subarray_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">maximum_circular_subarray.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../db/dfb/maximum__circular__subarray_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;cassert&gt;</span>     </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a> {</div>
+<div class="foldopen" id="foldopen00026" data-start="{" data-end="}">
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"><a class="line" href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb">   26</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb">maxCircularSum</a>(std::vector&lt;int&gt;&amp; arr)</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>{</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="comment">// Edge Case</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordflow">if</span> (arr.size() == 1)</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        <span class="keywordflow">return</span> arr[0];</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>  </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="comment">// Sum variable which stores total sum of the array.</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordtype">int</span> sum = 0;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; arr.size(); i++) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        sum += arr[i];</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    }</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>  </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="comment">// Every variable stores first value of the array.</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordtype">int</span> current_max = arr[0], max_so_far = arr[0], current_min = arr[0], min_so_far = arr[0];</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>  </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="comment">// Concept of Kadane&#39;s Algorithm</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; arr.size(); i++) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="comment">// Kadane&#39;s Algorithm to find Maximum subarray sum.</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        current_max = std::max(current_max + arr[i], arr[i]);</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        max_so_far = std::max(max_so_far, current_max);</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>  </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="comment">// Kadane&#39;s Algorithm to find Minimum subarray sum.</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        current_min = std::min(current_min + arr[i], arr[i]);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        min_so_far = std::min(min_so_far, current_min);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>  </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">if</span> (min_so_far == sum)</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        <span class="keywordflow">return</span> max_so_far;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>  </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="comment">// Return the maximum value</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">return</span> std::max(max_so_far, sum - min_so_far);</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>}</div>
+</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}  <span class="comment">// namespace dynamic_programming</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="foldopen" id="foldopen00064" data-start="{" data-end="}">
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   64</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="comment">// Description of the test</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="comment">// Input: arr[] = {8, -8, 9, -9, 10, -11, 12}</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="comment">// Output: 22 </span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="comment">// Explanation: Subarray 12, 8, -8, 9, -9, 10 gives the maximum sum, that is 22.</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keywordtype">int</span> n = 7; <span class="comment">// size of the array</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::vector&lt;int&gt; arr = {8, -8, 9, -9, 10, -11, 12}; </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb">dynamic_programming::maxCircularSum</a>(arr) == 22); <span class="comment">// this ensures that the algorithm works as expected</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    arr = {8, -8, 10, -9, 10, -11, 12};</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb">dynamic_programming::maxCircularSum</a>(arr) == 23);</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>}</div>
+</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="foldopen" id="foldopen00087" data-start="{" data-end="}">
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"><a class="line" href="../../db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">   87</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[]) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>     <a class="code hl_function" href="../../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>     <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>}</div>
+</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="amaximum__circular__subarray_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementation.</div><div class="ttdef"><b>Definition</b> <a href="#l00064">maximum_circular_subarray.cpp:64</a></div></div>
+<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
+<div class="ttc" id="anamespacedynamic__programming_html_a5239174fa0d987f2c67edc1f2af82beb"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb">dynamic_programming::maxCircularSum</a></div><div class="ttdeci">int maxCircularSum(std::vector&lt; int &gt; &amp;arr)</div><div class="ttdoc">returns the maximum contiguous circular sum of an array</div><div class="ttdef"><b>Definition</b> <a href="#l00026">maximum_circular_subarray.cpp:26</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../db/dfb/maximum__circular__subarray_8cpp.html">maximum_circular_subarray.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dc/d13/classdata__structures_1_1tree__234_1_1_tree234-members.html b/dc/d13/classdata__structures_1_1tree__234_1_1_tree234-members.html
index 51d8181e1..a830d6ab2 100644
--- a/dc/d13/classdata__structures_1_1tree__234_1_1_tree234-members.html
+++ b/dc/d13/classdata__structures_1_1tree__234_1_1_tree234-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html
index 4409fac74..dadc94af4 100644
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html
+++ b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -131,11 +148,11 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:a4aa49765cce39ce48b9241e993e0cfb9"><td class="memTemplItemLeft" align="right" valign="top">&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a4aa49765cce39ce48b9241e993e0cfb9">Matrix</a> (const Integer rows, const Integer cols)</td></tr>
 <tr class="memdesc:a4aa49765cce39ce48b9241e993e0cfb9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructor.  <br /></td></tr>
 <tr class="separator:a4aa49765cce39ce48b9241e993e0cfb9"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae4e183ec8eab778cb243e4ae0b22a0f1" id="r_ae4e183ec8eab778cb243e4ae0b22a0f1"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> () const</td></tr>
+<tr class="memitem:ae4e183ec8eab778cb243e4ae0b22a0f1" id="r_ae4e183ec8eab778cb243e4ae0b22a0f1"><td class="memItemLeft" align="right" valign="top">std::pair&lt; size_t, size_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> () const</td></tr>
 <tr class="memdesc:ae4e183ec8eab778cb243e4ae0b22a0f1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the matrix shape.  <br /></td></tr>
 <tr class="separator:ae4e183ec8eab778cb243e4ae0b22a0f1"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ac4c64e5723fa12a043fd0a7f5ed5bb37" id="r_ac4c64e5723fa12a043fd0a7f5ed5bb37"><td class="memTemplParams" colspan="2">template&lt;typename Integer , typename  = typename std::enable_if&lt;                  std::is_integral&lt;Integer&gt;::value, Integer&gt;::type&gt; </td></tr>
-<tr class="memitem:ac4c64e5723fa12a043fd0a7f5ed5bb37"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac4c64e5723fa12a043fd0a7f5ed5bb37">operator[]</a> (const Integer index)</td></tr>
+<tr class="memitem:ac4c64e5723fa12a043fd0a7f5ed5bb37"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; T &gt; &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac4c64e5723fa12a043fd0a7f5ed5bb37">operator[]</a> (const Integer index)</td></tr>
 <tr class="memdesc:ac4c64e5723fa12a043fd0a7f5ed5bb37"><td class="mdescLeft">&#160;</td><td class="mdescRight">returns the address of the element at ith place (here ith row of the matrix)  <br /></td></tr>
 <tr class="separator:ac4c64e5723fa12a043fd0a7f5ed5bb37"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a1fcb7db9bdeabd874712ec4f00483d17" id="r_a1fcb7db9bdeabd874712ec4f00483d17"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#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></tr>
@@ -191,18 +208,19 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a048f49ac4b28af539a9669e696c8a843" id="r_a048f49ac4b28af539a9669e696c8a843"><td class="memItemLeft" align="right" valign="top"><a id="a048f49ac4b28af539a9669e696c8a843" name="a048f49ac4b28af539a9669e696c8a843"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>_mat</b></td></tr>
+<tr class="memitem:a048f49ac4b28af539a9669e696c8a843" id="r_a048f49ac4b28af539a9669e696c8a843"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; T &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a048f49ac4b28af539a9669e696c8a843">_mat</a></td></tr>
 <tr class="separator:a048f49ac4b28af539a9669e696c8a843"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="friends" name="friends"></a>
 Friends</h2></td></tr>
-<tr class="memitem:a6e6290aa94e1b8fc00732531b4842f6e" id="r_a6e6290aa94e1b8fc00732531b4842f6e"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6e6290aa94e1b8fc00732531b4842f6e">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, const <a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a>&lt; T &gt; &amp;mat)</td></tr>
+<tr class="memitem:a6e6290aa94e1b8fc00732531b4842f6e" id="r_a6e6290aa94e1b8fc00732531b4842f6e"><td class="memItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6e6290aa94e1b8fc00732531b4842f6e">operator&lt;&lt;</a> (std::ostream &amp;out, const <a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a>&lt; T &gt; &amp;mat)</td></tr>
 <tr class="separator:a6e6290aa94e1b8fc00732531b4842f6e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><div class="compoundTemplParams">template&lt;typename T, typename = typename std::enable_if&lt;              std::is_integral&lt;T&gt;::value || std::is_floating_point&lt;T&gt;::value,              bool&gt;::type&gt;<br />
 class divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;</div><p><a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html" title="Matrix class.">Matrix</a> class. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a01f3a05cf5abdc5d63999ef1bf9f9256" name="a01f3a05cf5abdc5d63999ef1bf9f9256"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a01f3a05cf5abdc5d63999ef1bf9f9256">&#9670;&#160;</a></span>Matrix() <span class="overload">[1/2]</span></h2>
@@ -244,20 +262,15 @@ template&lt;typename Integer , typename  = typename std::enable_if&lt;
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   53</span>                                        {</div>
 <div class="line"><span class="lineno">   54</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; <a class="code hl_function" href="#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>; ++i) {</div>
-<div class="line"><span class="lineno">   55</span>            _mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a>(<a class="code hl_function" href="#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>, 0));</div>
+<div class="line"><span class="lineno">   55</span>            _mat.emplace_back(std::vector&lt;T&gt;(<a class="code hl_function" href="#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>, 0));</div>
 <div class="line"><span class="lineno">   56</span>        }</div>
 <div class="line"><span class="lineno">   57</span>    }</div>
-<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_ae4e183ec8eab778cb243e4ae0b22a0f1"><div class="ttname"><a href="#ae4e183ec8eab778cb243e4ae0b22a0f1">divide_and_conquer::strassens_multiplication::Matrix::size</a></div><div class="ttdeci">std::pair&lt; size_t, size_t &gt; size() const</div><div class="ttdoc">Get the matrix shape.</div><div class="ttdef"><b>Definition</b> strassen_matrix_multiplication.cpp:79</div></div>
-<div class="ttc" id="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a01f3a05cf5abdc5d63999ef1bf9f9256_cgraph.svg" width="567" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_ae4e183ec8eab778cb243e4ae0b22a0f1"><div class="ttname"><a href="#ae4e183ec8eab778cb243e4ae0b22a0f1">divide_and_conquer::strassens_multiplication::Matrix::size</a></div><div class="ttdeci">std::pair&lt; size_t, size_t &gt; size() const</div><div class="ttdoc">Get the matrix shape.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00079">strassen_matrix_multiplication.cpp:79</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4aa49765cce39ce48b9241e993e0cfb9" name="a4aa49765cce39ce48b9241e993e0cfb9"></a>
@@ -305,17 +318,14 @@ template&lt;typename Integer , typename  = typename std::enable_if&lt;
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00069">69</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   69</span>                                                   {</div>
 <div class="line"><span class="lineno">   70</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; rows; ++i) {</div>
-<div class="line"><span class="lineno">   71</span>            _mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a>(cols, 0));</div>
+<div class="line"><span class="lineno">   71</span>            _mat.emplace_back(std::vector&lt;T&gt;(cols, 0));</div>
 <div class="line"><span class="lineno">   72</span>        }</div>
 <div class="line"><span class="lineno">   73</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a4aa49765cce39ce48b9241e993e0cfb9_cgraph.svg" width="404" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Function Documentation</h2>
@@ -360,22 +370,17 @@ template&lt;typename Number , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void, but modifies the current array </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00134">134</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  134</span>                                              {</div>
-<div class="line"><span class="lineno">  135</span>        assert(_mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() == other._mat.size());</div>
+<div class="line"><span class="lineno">  135</span>        assert(_mat.size() == other._mat.size());</div>
 <div class="line"><span class="lineno">  136</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; other._mat.size(); ++i) {</div>
 <div class="line"><span class="lineno">  137</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; other._mat[i].size(); ++j) {</div>
-<div class="line"><span class="lineno">  138</span>                _mat[i].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(other._mat[i][j]);</div>
+<div class="line"><span class="lineno">  138</span>                _mat[i].push_back(other._mat[i][j]);</div>
 <div class="line"><span class="lineno">  139</span>            }</div>
 <div class="line"><span class="lineno">  140</span>        }</div>
 <div class="line"><span class="lineno">  141</span>    }</div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="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><!-- 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/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ab6534125643a02c114bd4cddba9bc17f_cgraph.svg" width="383" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5d8eb669b37a27224376b08515b4ee50" name="a5d8eb669b37a27224376b08515b4ee50"></a>
@@ -419,11 +424,13 @@ template&lt;typename Number , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new matrix </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00316">316</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  316</span>                                                                   {</div>
-<div class="line"><span class="lineno">  317</span>        <a class="code hl_function" href="#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix</a> C = <a class="code hl_function" href="#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix&lt;Number&gt;</a>(_mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(), other._mat[0].size());</div>
+<div class="line"><span class="lineno">  317</span>        <a class="code hl_function" href="#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix</a> C = <a class="code hl_function" href="#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix&lt;Number&gt;</a>(_mat.size(), other._mat[0].size());</div>
 <div class="line"><span class="lineno">  318</span> </div>
-<div class="line"><span class="lineno">  319</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); ++i) {</div>
-<div class="line"><span class="lineno">  320</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> k = 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> &lt; _mat[0].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); ++<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>) {</div>
+<div class="line"><span class="lineno">  319</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.size(); ++i) {</div>
+<div class="line"><span class="lineno">  320</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> k = 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> &lt; _mat[0].size(); ++<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>) {</div>
 <div class="line"><span class="lineno">  321</span>                <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; other._mat[0].size(); ++j) {</div>
 <div class="line"><span class="lineno">  322</span>                    C._mat[i][j] += _mat[i][<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] * other._mat[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>][j];</div>
 <div class="line"><span class="lineno">  323</span>                }</div>
@@ -431,14 +438,9 @@ template&lt;typename Number , typename  = typename std::enable_if&lt;
 <div class="line"><span class="lineno">  325</span>        }</div>
 <div class="line"><span class="lineno">  326</span>        <span class="keywordflow">return</span> C;</div>
 <div class="line"><span class="lineno">  327</span>    }</div>
-<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_a01f3a05cf5abdc5d63999ef1bf9f9256"><div class="ttname"><a href="#a01f3a05cf5abdc5d63999ef1bf9f9256">divide_and_conquer::strassens_multiplication::Matrix::Matrix</a></div><div class="ttdeci">Matrix(const Integer size)</div><div class="ttdoc">Constructor.</div><div class="ttdef"><b>Definition</b> strassen_matrix_multiplication.cpp:53</div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a5d8eb669b37a27224376b08515b4ee50_cgraph.svg" width="100%" height="413"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_a01f3a05cf5abdc5d63999ef1bf9f9256"><div class="ttname"><a href="#a01f3a05cf5abdc5d63999ef1bf9f9256">divide_and_conquer::strassens_multiplication::Matrix::Matrix</a></div><div class="ttdeci">Matrix(const Integer size)</div><div class="ttdoc">Constructor.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00053">strassen_matrix_multiplication.cpp:53</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a60599668b56001cef4bb59d4cb5c6c6c" name="a60599668b56001cef4bb59d4cb5c6c6c"></a>
@@ -482,6 +484,8 @@ template&lt;typename Number , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new matrix </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00255">255</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  255</span>                                                               {</div>
 <div class="line"><span class="lineno">  256</span>        assert(_mat[0].<a class="code hl_function" href="#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>() == other._mat.size());</div>
 <div class="line"><span class="lineno">  257</span>        <span class="keyword">auto</span> <a class="code hl_function" href="#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> = this-&gt;<a class="code hl_function" href="#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>();</div>
@@ -493,14 +497,9 @@ template&lt;typename Number , typename  = typename std::enable_if&lt;
 <div class="line"><span class="lineno">  263</span>                   ? this-&gt;<a class="code hl_namespace" href="../../d3/d91/namespacestrassens__multiplication.html">strassens_multiplication</a>(other)</div>
 <div class="line"><span class="lineno">  264</span>                   : this-&gt;<a class="code hl_function" href="#a5d8eb669b37a27224376b08515b4ee50">naive_multiplication</a>(other);</div>
 <div class="line"><span class="lineno">  265</span>    }</div>
-<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_a5d8eb669b37a27224376b08515b4ee50"><div class="ttname"><a href="#a5d8eb669b37a27224376b08515b4ee50">divide_and_conquer::strassens_multiplication::Matrix::naive_multiplication</a></div><div class="ttdeci">Matrix naive_multiplication(const Matrix&lt; Number &gt; &amp;other) const</div><div class="ttdoc">Naive multiplication performed on this.</div><div class="ttdef"><b>Definition</b> strassen_matrix_multiplication.cpp:316</div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_a5d8eb669b37a27224376b08515b4ee50"><div class="ttname"><a href="#a5d8eb669b37a27224376b08515b4ee50">divide_and_conquer::strassens_multiplication::Matrix::naive_multiplication</a></div><div class="ttdeci">Matrix naive_multiplication(const Matrix&lt; Number &gt; &amp;other) const</div><div class="ttdoc">Naive multiplication performed on this.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00316">strassen_matrix_multiplication.cpp:316</a></div></div>
 <div class="ttc" id="anamespacestrassens__multiplication_html"><div class="ttname"><a href="../../d3/d91/namespacestrassens__multiplication.html">strassens_multiplication</a></div><div class="ttdoc">Namespace for performing strassen's multiplication.</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a60599668b56001cef4bb59d4cb5c6c6c_cgraph.svg" width="100%" height="445"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aedbe01e48a96fefa0b393ec577b0f19e" name="aedbe01e48a96fefa0b393ec577b0f19e"></a>
@@ -544,21 +543,18 @@ template&lt;typename Number , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new matrix </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00277">277</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  277</span>                                                      {</div>
-<div class="line"><span class="lineno">  278</span>        <a class="code hl_function" href="#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix</a> C = <a class="code hl_function" href="#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix&lt;Number&gt;</a>(_mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(), _mat[0].size());</div>
-<div class="line"><span class="lineno">  279</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); ++i) {</div>
-<div class="line"><span class="lineno">  280</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); ++j) {</div>
+<div class="line"><span class="lineno">  278</span>        <a class="code hl_function" href="#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix</a> C = <a class="code hl_function" href="#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix&lt;Number&gt;</a>(_mat.size(), _mat[0].size());</div>
+<div class="line"><span class="lineno">  279</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.size(); ++i) {</div>
+<div class="line"><span class="lineno">  280</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].size(); ++j) {</div>
 <div class="line"><span class="lineno">  281</span>                C._mat[i][j] = _mat[i][j] * other;</div>
 <div class="line"><span class="lineno">  282</span>            }</div>
 <div class="line"><span class="lineno">  283</span>        }</div>
 <div class="line"><span class="lineno">  284</span>        <span class="keywordflow">return</span> C;</div>
 <div class="line"><span class="lineno">  285</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_aedbe01e48a96fefa0b393ec577b0f19e_cgraph.svg" width="100%" height="413"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af09566a6a59d30875434c140e18e0a12" name="af09566a6a59d30875434c140e18e0a12"></a>
@@ -602,20 +598,17 @@ template&lt;typename Number , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>reference of current matrix </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00297">297</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  297</span>                                                 {</div>
-<div class="line"><span class="lineno">  298</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); ++i) {</div>
-<div class="line"><span class="lineno">  299</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); ++j) {</div>
+<div class="line"><span class="lineno">  298</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.size(); ++i) {</div>
+<div class="line"><span class="lineno">  299</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].size(); ++j) {</div>
 <div class="line"><span class="lineno">  300</span>                _mat[i][j] *= other;</div>
 <div class="line"><span class="lineno">  301</span>            }</div>
 <div class="line"><span class="lineno">  302</span>        }</div>
 <div class="line"><span class="lineno">  303</span>        <span class="keywordflow">return</span> <span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  304</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af09566a6a59d30875434c140e18e0a12_cgraph.svg" width="344" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad36ec1f1a97298e49de605384e5f8211" name="ad36ec1f1a97298e49de605384e5f8211"></a>
@@ -659,22 +652,19 @@ template&lt;typename Number , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new matrix </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00173">173</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  173</span>                                                        {</div>
 <div class="line"><span class="lineno">  174</span>        assert(this-&gt;<a class="code hl_function" href="#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>() == other.size());</div>
-<div class="line"><span class="lineno">  175</span>        <a class="code hl_function" href="#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix</a> C = <a class="code hl_function" href="#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix&lt;Number&gt;</a>(_mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(), _mat[0].size());</div>
-<div class="line"><span class="lineno">  176</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); ++i) {</div>
-<div class="line"><span class="lineno">  177</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); ++j) {</div>
+<div class="line"><span class="lineno">  175</span>        <a class="code hl_function" href="#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix</a> C = <a class="code hl_function" href="#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix&lt;Number&gt;</a>(_mat.size(), _mat[0].size());</div>
+<div class="line"><span class="lineno">  176</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.size(); ++i) {</div>
+<div class="line"><span class="lineno">  177</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].size(); ++j) {</div>
 <div class="line"><span class="lineno">  178</span>                C._mat[i][j] = _mat[i][j] + other._mat[i][j];</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> C;</div>
 <div class="line"><span class="lineno">  182</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ad36ec1f1a97298e49de605384e5f8211_cgraph.svg" width="100%" height="407"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae190115f8d4d31e47d7290e0b6871391" name="ae190115f8d4d31e47d7290e0b6871391"></a>
@@ -718,21 +708,18 @@ template&lt;typename Number , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>reference of current matrix </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00194">194</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  194</span>                                                          {</div>
 <div class="line"><span class="lineno">  195</span>        assert(this-&gt;<a class="code hl_function" href="#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>() == other.size());</div>
-<div class="line"><span class="lineno">  196</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); ++i) {</div>
-<div class="line"><span class="lineno">  197</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); ++j) {</div>
+<div class="line"><span class="lineno">  196</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.size(); ++i) {</div>
+<div class="line"><span class="lineno">  197</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].size(); ++j) {</div>
 <div class="line"><span class="lineno">  198</span>                _mat[i][j] += other._mat[i][j];</div>
 <div class="line"><span class="lineno">  199</span>            }</div>
 <div class="line"><span class="lineno">  200</span>        }</div>
 <div class="line"><span class="lineno">  201</span>        <span class="keywordflow">return</span> <span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  202</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae190115f8d4d31e47d7290e0b6871391_cgraph.svg" width="562" height="100"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a678681c9f6266a8219bd6bee6972d70e" name="a678681c9f6266a8219bd6bee6972d70e"></a>
@@ -776,22 +763,19 @@ template&lt;typename Number , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new matrix </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00214">214</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  214</span>                                                        {</div>
 <div class="line"><span class="lineno">  215</span>        assert(this-&gt;<a class="code hl_function" href="#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>() == other.size());</div>
-<div class="line"><span class="lineno">  216</span>        <a class="code hl_function" href="#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix</a> C = <a class="code hl_function" href="#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix&lt;Number&gt;</a>(_mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(), _mat[0].size());</div>
-<div class="line"><span class="lineno">  217</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); ++i) {</div>
-<div class="line"><span class="lineno">  218</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); ++j) {</div>
+<div class="line"><span class="lineno">  216</span>        <a class="code hl_function" href="#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix</a> C = <a class="code hl_function" href="#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix&lt;Number&gt;</a>(_mat.size(), _mat[0].size());</div>
+<div class="line"><span class="lineno">  217</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.size(); ++i) {</div>
+<div class="line"><span class="lineno">  218</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].size(); ++j) {</div>
 <div class="line"><span class="lineno">  219</span>                C._mat[i][j] = _mat[i][j] - other._mat[i][j];</div>
 <div class="line"><span class="lineno">  220</span>            }</div>
 <div class="line"><span class="lineno">  221</span>        }</div>
 <div class="line"><span class="lineno">  222</span>        <span class="keywordflow">return</span> C;</div>
 <div class="line"><span class="lineno">  223</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a678681c9f6266a8219bd6bee6972d70e_cgraph.svg" width="100%" height="407"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a42c986fb57b74fe1b7c5953cb1922c3d" name="a42c986fb57b74fe1b7c5953cb1922c3d"></a>
@@ -835,21 +819,18 @@ template&lt;typename Number , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>reference of current matrix </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00235">235</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  235</span>                                                          {</div>
 <div class="line"><span class="lineno">  236</span>        assert(this-&gt;<a class="code hl_function" href="#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>() == other.size());</div>
-<div class="line"><span class="lineno">  237</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); ++i) {</div>
-<div class="line"><span class="lineno">  238</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); ++j) {</div>
+<div class="line"><span class="lineno">  237</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.size(); ++i) {</div>
+<div class="line"><span class="lineno">  238</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].size(); ++j) {</div>
 <div class="line"><span class="lineno">  239</span>                _mat[i][j] -= other._mat[i][j];</div>
 <div class="line"><span class="lineno">  240</span>            }</div>
 <div class="line"><span class="lineno">  241</span>        }</div>
 <div class="line"><span class="lineno">  242</span>        <span class="keywordflow">return</span> <span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  243</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a42c986fb57b74fe1b7c5953cb1922c3d_cgraph.svg" width="562" height="100"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a562faa16a4b4ed5d4804823c56f99c9c" name="a562faa16a4b4ed5d4804823c56f99c9c"></a>
@@ -885,13 +866,15 @@ template&lt;typename T , typename  = typename std::enable_if&lt;              st
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>whether they are equal or not </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00393">393</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  393</span>                                                  {</div>
-<div class="line"><span class="lineno">  394</span>        <span class="keywordflow">if</span> (_mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() != other._mat.size() ||</div>
+<div class="line"><span class="lineno">  394</span>        <span class="keywordflow">if</span> (_mat.size() != other._mat.size() ||</div>
 <div class="line"><span class="lineno">  395</span>            _mat[0].size() != other._mat[0].size()) {</div>
 <div class="line"><span class="lineno">  396</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  397</span>        }</div>
-<div class="line"><span class="lineno">  398</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); ++i) {</div>
-<div class="line"><span class="lineno">  399</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); ++j) {</div>
+<div class="line"><span class="lineno">  398</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; _mat.size(); ++i) {</div>
+<div class="line"><span class="lineno">  399</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; _mat[i].size(); ++j) {</div>
 <div class="line"><span class="lineno">  400</span>                <span class="keywordflow">if</span> (_mat[i][j] != other._mat[i][j]) {</div>
 <div class="line"><span class="lineno">  401</span>                    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  402</span>                }</div>
@@ -899,12 +882,7 @@ template&lt;typename T , typename  = typename std::enable_if&lt;              st
 <div class="line"><span class="lineno">  404</span>        }</div>
 <div class="line"><span class="lineno">  405</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  406</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a562faa16a4b4ed5d4804823c56f99c9c_cgraph.svg" width="344" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac4c64e5723fa12a043fd0a7f5ed5bb37" name="ac4c64e5723fa12a043fd0a7f5ed5bb37"></a>
@@ -921,7 +899,7 @@ template&lt;typename Integer , typename  = typename std::enable_if&lt;
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp; <a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix</a>&lt; T, typename &gt;::operator[] </td>
+          <td class="memname">std::vector&lt; T &gt; &amp; <a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix</a>&lt; T, typename &gt;::operator[] </td>
           <td>(</td>
           <td class="paramtype">const Integer</td>          <td class="paramname"><span class="paramname"><em>index</em></span></td><td>)</td>
           <td></td>
@@ -948,6 +926,8 @@ template&lt;typename Integer , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the address of the element (here ith row or array) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00093">93</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   93</span>                                                         {</div>
 <div class="line"><span class="lineno">   94</span>        <span class="keywordflow">return</span> _mat[index];</div>
 <div class="line"><span class="lineno">   95</span>    }</div>
@@ -966,7 +946,7 @@ template&lt;typename T , typename  = typename std::enable_if&lt;              st
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; <a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix</a>&lt; T, typename &gt;::size </td>
+          <td class="memname">std::pair&lt; size_t, size_t &gt; <a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix</a>&lt; T, typename &gt;::size </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td> const</td>
@@ -981,15 +961,12 @@ template&lt;typename T , typename  = typename std::enable_if&lt;              st
 
 <p>Get the matrix shape. </p>
 <dl class="section return"><dt>Returns</dt><dd>pair of integer denoting total rows and columns </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   79</span>                                                {</div>
-<div class="line"><span class="lineno">   80</span>        <span class="keywordflow">return</span> {_mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(), _mat[0].<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">   81</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae4e183ec8eab778cb243e4ae0b22a0f1_cgraph.svg" width="344" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00079">79</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   79</span>                                                {</div>
+<div class="line"><span class="lineno">   80</span>        <span class="keywordflow">return</span> {_mat.size(), _mat[0].size()};</div>
+<div class="line"><span class="lineno">   81</span>    }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1fcb7db9bdeabd874712ec4f00483d17" name="a1fcb7db9bdeabd874712ec4f00483d17"></a>
@@ -1042,10 +1019,12 @@ template&lt;typename T , typename  = typename std::enable_if&lt;              st
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>A slice of (row_end - row_start) x (col_end - col_start) size of array starting from row_start row and col_start column </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00106">106</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  108</span>                                                        {</div>
 <div class="line"><span class="lineno">  109</span>        <span class="keyword">const</span> <span class="keywordtype">size_t</span> h_size =</div>
-<div class="line"><span class="lineno">  110</span>            (row_end != MAX_SIZE ? row_end : _mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()) - row_start;</div>
-<div class="line"><span class="lineno">  111</span>        <span class="keyword">const</span> <span class="keywordtype">size_t</span> v_size = (col_end != MAX_SIZE ? col_end : _mat[0].<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">  110</span>            (row_end != MAX_SIZE ? row_end : _mat.size()) - row_start;</div>
+<div class="line"><span class="lineno">  111</span>        <span class="keyword">const</span> <span class="keywordtype">size_t</span> v_size = (col_end != MAX_SIZE ? col_end : _mat[0].size()) -</div>
 <div class="line"><span class="lineno">  112</span>                              (col_start != MAX_SIZE ? col_start : 0);</div>
 <div class="line"><span class="lineno">  113</span>        <a class="code hl_function" href="#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="#a01f3a05cf5abdc5d63999ef1bf9f9256">Matrix&lt;T&gt;</a>(h_size, v_size);</div>
 <div class="line"><span class="lineno">  114</span> </div>
@@ -1057,13 +1036,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;              st
 <div class="line"><span class="lineno">  120</span>        }</div>
 <div class="line"><span class="lineno">  121</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  122</span>    }</div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a1fcb7db9bdeabd874712ec4f00483d17_cgraph.svg" width="100%" height="413"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a87c2ed8f19bda2ad21ee4cbed32c394a" name="a87c2ed8f19bda2ad21ee4cbed32c394a"></a>
@@ -1107,8 +1081,10 @@ template&lt;typename Number , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new matrix </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00340">340</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  340</span>                                                                       {</div>
-<div class="line"><span class="lineno">  341</span>        <span class="keyword">const</span> <span class="keywordtype">size_t</span> <a class="code hl_function" href="#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> = _mat.<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">  341</span>        <span class="keyword">const</span> <span class="keywordtype">size_t</span> <a class="code hl_function" href="#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a> = _mat.size();</div>
 <div class="line"><span class="lineno">  342</span>        <span class="comment">// Base case: when a matrix is small enough for faster naive</span></div>
 <div class="line"><span class="lineno">  343</span>        <span class="comment">// multiplication, or the matrix is of odd size, then go with the naive</span></div>
 <div class="line"><span class="lineno">  344</span>        <span class="comment">// multiplication route;</span></div>
@@ -1154,14 +1130,9 @@ template&lt;typename Number , typename  = typename std::enable_if&lt;
 <div class="line"><span class="lineno">  384</span>            <span class="keywordflow">return</span> C11;</div>
 <div class="line"><span class="lineno">  385</span>        }</div>
 <div class="line"><span class="lineno">  386</span>    }</div>
-<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_a1fcb7db9bdeabd874712ec4f00483d17"><div class="ttname"><a href="#a1fcb7db9bdeabd874712ec4f00483d17">divide_and_conquer::strassens_multiplication::Matrix::slice</a></div><div class="ttdeci">Matrix slice(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</div><div class="ttdoc">Creates a new matrix and returns a part of it.</div><div class="ttdef"><b>Definition</b> strassen_matrix_multiplication.cpp:106</div></div>
-<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_a87c2ed8f19bda2ad21ee4cbed32c394a"><div class="ttname"><a href="#a87c2ed8f19bda2ad21ee4cbed32c394a">divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication</a></div><div class="ttdeci">Matrix strassens_multiplication(const Matrix&lt; Number &gt; &amp;other) const</div><div class="ttdoc">Strassens method of multiplying two matrices References: https://en.wikipedia.org/wiki/Strassen_algor...</div><div class="ttdef"><b>Definition</b> strassen_matrix_multiplication.cpp:340</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a87c2ed8f19bda2ad21ee4cbed32c394a_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_a1fcb7db9bdeabd874712ec4f00483d17"><div class="ttname"><a href="#a1fcb7db9bdeabd874712ec4f00483d17">divide_and_conquer::strassens_multiplication::Matrix::slice</a></div><div class="ttdeci">Matrix slice(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</div><div class="ttdoc">Creates a new matrix and returns a part of it.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00106">strassen_matrix_multiplication.cpp:106</a></div></div>
+<div class="ttc" id="aclassdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_html_a87c2ed8f19bda2ad21ee4cbed32c394a"><div class="ttname"><a href="#a87c2ed8f19bda2ad21ee4cbed32c394a">divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication</a></div><div class="ttdeci">Matrix strassens_multiplication(const Matrix&lt; Number &gt; &amp;other) const</div><div class="ttdoc">Strassens method of multiplying two matrices References: https://en.wikipedia.org/wiki/Strassen_algor...</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00340">strassen_matrix_multiplication.cpp:340</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af12ceffdc07cc87eca8a4a8ac87d60fe" name="af12ceffdc07cc87eca8a4a8ac87d60fe"></a>
@@ -1205,22 +1176,18 @@ template&lt;typename Number , typename  = typename std::enable_if&lt;
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void, but modifies the current array </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00153">153</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  153</span>                                              {</div>
 <div class="line"><span class="lineno">  154</span>        assert(_mat[0].<a class="code hl_function" href="#ae4e183ec8eab778cb243e4ae0b22a0f1">size</a>() == other._mat[0].size());</div>
 <div class="line"><span class="lineno">  155</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; other._mat.size(); ++i) {</div>
-<div class="line"><span class="lineno">  156</span>            _mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a>(other._mat[i].size()));</div>
+<div class="line"><span class="lineno">  156</span>            _mat.emplace_back(std::vector&lt;T&gt;(other._mat[i].size()));</div>
 <div class="line"><span class="lineno">  157</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; other._mat[i].size(); ++j) {</div>
-<div class="line"><span class="lineno">  158</span>                _mat.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/back.html">back</a>()[j] = other._mat[i][j];</div>
+<div class="line"><span class="lineno">  158</span>                _mat.back()[j] = other._mat[i][j];</div>
 <div class="line"><span class="lineno">  159</span>            }</div>
 <div class="line"><span class="lineno">  160</span>        }</div>
 <div class="line"><span class="lineno">  161</span>    }</div>
-<div class="ttc" id="aback_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/back.html">std::vector::back</a></div><div class="ttdeci">T back(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af12ceffdc07cc87eca8a4a8ac87d60fe_cgraph.svg" width="567" height="191"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Friends And Related Symbol Documentation</h2>
@@ -1236,9 +1203,9 @@ template&lt;typename T , typename  = typename std::enable_if&lt;              st
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; operator&lt;&lt; </td>
+          <td class="memname">std::ostream &amp; operator&lt;&lt; </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
+          <td class="paramtype">std::ostream &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -1252,6 +1219,8 @@ template&lt;typename T , typename  = typename std::enable_if&lt;              st
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00408">408</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  408</span>                                                                         {</div>
 <div class="line"><span class="lineno">  409</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;row : mat._mat) {</div>
 <div class="line"><span class="lineno">  410</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;elem : row) {</div>
@@ -1262,10 +1231,37 @@ template&lt;typename T , typename  = typename std::enable_if&lt;              st
 <div class="line"><span class="lineno">  415</span>        <span class="keywordflow">return</span> out &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  416</span>    }</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a048f49ac4b28af539a9669e696c8a843" name="a048f49ac4b28af539a9669e696c8a843"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a048f49ac4b28af539a9669e696c8a843">&#9670;&#160;</a></span>_mat</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename T , typename  = typename std::enable_if&lt;              std::is_integral&lt;T&gt;::value || std::is_floating_point&lt;T&gt;::value,              bool&gt;::type&gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::vector&lt;T&gt; &gt; <a class="el" href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">divide_and_conquer::strassens_multiplication::Matrix</a>&lt; T, typename &gt;::_mat</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>divide_and_conquer/<b>strassen_matrix_multiplication.cpp</b></li>
+<li>divide_and_conquer/<a class="el" href="../../d0/dea/strassen__matrix__multiplication_8cpp_source.html">strassen_matrix_multiplication.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a01f3a05cf5abdc5d63999ef1bf9f9256_cgraph.map b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a01f3a05cf5abdc5d63999ef1bf9f9256_cgraph.map
deleted file mode 100644
index eed350172..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a01f3a05cf5abdc5d63999ef1bf9f9256_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="divide_and_conquer::strassens_multiplication::Matrix::Matrix" name="divide_and_conquer::strassens_multiplication::Matrix::Matrix">
-<area shape="rect" id="Node000001" title="Constructor." alt="" coords="5,24,175,79"/>
-<area shape="rect" id="Node000002" 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="223,5,398,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="174,36,207,31,207,36,175,41"/>
-<area shape="rect" id="Node000003" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" title="Get the matrix shape." alt="" coords="226,56,395,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="175,61,211,66,210,72,174,66"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="446,71,561,96"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="395,81,430,81,430,86,395,86"/>
-</map>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a01f3a05cf5abdc5d63999ef1bf9f9256_cgraph.md5 b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a01f3a05cf5abdc5d63999ef1bf9f9256_cgraph.md5
deleted file mode 100644
index 5b20305a5..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a01f3a05cf5abdc5d63999ef1bf9f9256_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a1746ef09f2275fdfcdaaa84508b875b
\ No newline at end of file
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a01f3a05cf5abdc5d63999ef1bf9f9256_cgraph.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a01f3a05cf5abdc5d63999ef1bf9f9256_cgraph.svg
deleted file mode 100644
index 9bdd6131b..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a01f3a05cf5abdc5d63999ef1bf9f9256_cgraph.svg
+++ /dev/null
@@ -1,105 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::Matrix Pages: 1 -->
-<svg width="425pt" height="88pt"
- viewBox="0.00 0.00 425.00 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::Matrix</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Constructor.">
-<polygon fill="#999999" stroke="#666666" points="127,-65.75 0,-65.75 0,-24 127,-24 127,-65.75"/>
-<text text-anchor="start" x="8" y="-52.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294.5,-79.5 163,-79.5 163,-60.25 294.5,-60.25 294.5,-79.5"/>
-<text text-anchor="middle" x="228.75" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.15,-54.47C135.03,-55.68 143.17,-56.92 151.23,-58.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.65,-61.61 161.07,-59.66 151.71,-54.69 150.65,-61.61"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><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.25,-41.75 165.25,-41.75 165.25,0 292.25,0 292.25,-41.75"/>
-<text text-anchor="start" x="173.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="173.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="228.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.15,-35.66C135.87,-34.38 144.91,-33.05 153.81,-31.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.12,-35.24 163.5,-30.32 153.1,-28.31 154.12,-35.24"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="417,-30.5 330.5,-30.5 330.5,-11.25 417,-11.25 417,-30.5"/>
-<text text-anchor="middle" x="373.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.47,-20.88C301.24,-20.88 310.19,-20.88 318.78,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.71,-24.38 328.71,-20.88 318.71,-17.38 318.71,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a01f3a05cf5abdc5d63999ef1bf9f9256_cgraph_org.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a01f3a05cf5abdc5d63999ef1bf9f9256_cgraph_org.svg
deleted file mode 100644
index 38c6ef622..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a01f3a05cf5abdc5d63999ef1bf9f9256_cgraph_org.svg
+++ /dev/null
@@ -1,79 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::Matrix Pages: 1 -->
-<svg width="425pt" height="88pt"
- viewBox="0.00 0.00 425.00 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::Matrix</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Constructor.">
-<polygon fill="#999999" stroke="#666666" points="127,-65.75 0,-65.75 0,-24 127,-24 127,-65.75"/>
-<text text-anchor="start" x="8" y="-52.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294.5,-79.5 163,-79.5 163,-60.25 294.5,-60.25 294.5,-79.5"/>
-<text text-anchor="middle" x="228.75" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.15,-54.47C135.03,-55.68 143.17,-56.92 151.23,-58.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.65,-61.61 161.07,-59.66 151.71,-54.69 150.65,-61.61"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><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.25,-41.75 165.25,-41.75 165.25,0 292.25,0 292.25,-41.75"/>
-<text text-anchor="start" x="173.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="173.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="228.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.15,-35.66C135.87,-34.38 144.91,-33.05 153.81,-31.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.12,-35.24 163.5,-30.32 153.1,-28.31 154.12,-35.24"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="417,-30.5 330.5,-30.5 330.5,-11.25 417,-11.25 417,-30.5"/>
-<text text-anchor="middle" x="373.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.47,-20.88C301.24,-20.88 310.19,-20.88 318.78,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.71,-24.38 328.71,-20.88 318.71,-17.38 318.71,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a1fcb7db9bdeabd874712ec4f00483d17_cgraph.map b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a1fcb7db9bdeabd874712ec4f00483d17_cgraph.map
deleted file mode 100644
index 15763cb8c..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a1fcb7db9bdeabd874712ec4f00483d17_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="divide_and_conquer::strassens_multiplication::Matrix::slice" name="divide_and_conquer::strassens_multiplication::Matrix::slice">
-<area shape="rect" id="Node000001" title="Creates a new matrix and returns a part of it." alt="" coords="5,89,175,145"/>
-<area shape="rect" id="Node000002" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" title="Constructor." alt="" coords="223,56,392,111"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="175,101,207,96,208,101,175,106"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="663,104,779,130"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="175,119,223,121,419,125,615,121,648,119,648,125,615,126,419,130,223,126,175,124"/>
-<area shape="rect" id="Node000003" 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="440,5,615,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="392,55,439,41,465,33,467,38,441,46,393,60"/>
-<area shape="rect" id="Node000004" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" title="Get the matrix shape." alt="" coords="443,56,612,111"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="392,81,427,81,427,86,392,86"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="613,95,649,102,648,107,612,101"/>
-</map>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a1fcb7db9bdeabd874712ec4f00483d17_cgraph.md5 b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a1fcb7db9bdeabd874712ec4f00483d17_cgraph.md5
deleted file mode 100644
index 672d72b0a..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a1fcb7db9bdeabd874712ec4f00483d17_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-060a78a61693724aaa996a3074b2613d
\ No newline at end of file
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a1fcb7db9bdeabd874712ec4f00483d17_cgraph.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a1fcb7db9bdeabd874712ec4f00483d17_cgraph.svg
deleted file mode 100644
index 9dddb734e..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a1fcb7db9bdeabd874712ec4f00483d17_cgraph.svg
+++ /dev/null
@@ -1,191 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::slice Pages: 1 -->
-<!--zoomable 113 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 588;
-var viewHeight = 113;
-var sectionId = 'dynsection-14';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>divide_and_conquer::strassens_multiplication::Matrix::slice</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Creates a new matrix and returns a part of it.">
-<polygon fill="#999999" stroke="#666666" points="127,-41.75 0,-41.75 0,0 127,0 127,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::slice</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" target="_top" xlink:title="Constructor.">
-<polygon fill="white" stroke="#666666" points="290,-66.75 163,-66.75 163,-25 290,-25 290,-66.75"/>
-<text text-anchor="start" x="171" y="-53.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="171" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="226.5" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.21,-30.61C135.13,-31.84 143.29,-33.11 151.37,-34.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.78,-37.82 161.2,-35.89 151.86,-30.9 150.78,-37.82"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="580,-30.5 493.5,-30.5 493.5,-11.25 580,-11.25 580,-30.5"/>
-<text text-anchor="middle" x="536.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.27,-17.21C139.14,-16.65 151.45,-16.17 163,-15.88 293.85,-12.56 326.68,-11.7 457.5,-15.88 465.36,-16.13 473.66,-16.52 481.8,-16.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.43,-20.46 491.62,-17.57 481.85,-13.47 481.43,-20.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="457.5,-104.5 326,-104.5 326,-85.25 457.5,-85.25 457.5,-104.5"/>
-<text text-anchor="middle" x="391.75" y="-91" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.26,-65.1C302.13,-68.7 314.44,-72.42 326,-75.88 332.26,-77.75 338.86,-79.7 345.36,-81.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.09,-84.89 354.67,-84.36 346.06,-78.18 344.09,-84.89"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><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="455.25,-66.75 328.25,-66.75 328.25,-25 455.25,-25 455.25,-66.75"/>
-<text text-anchor="start" x="336.25" y="-53.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="336.25" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="391.75" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.15,-45.88C298.78,-45.88 307.7,-45.88 316.52,-45.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.48,-49.38 326.48,-45.88 316.48,-42.38 316.48,-49.38"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M455.47,-34.91C464.34,-33.36 473.4,-31.78 482.07,-30.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="482.48,-33.74 491.73,-28.57 481.28,-26.85 482.48,-33.74"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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_a1fcb7db9bdeabd874712ec4f00483d17_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a1fcb7db9bdeabd874712ec4f00483d17_cgraph_org.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a1fcb7db9bdeabd874712ec4f00483d17_cgraph_org.svg
deleted file mode 100644
index b0fc6cefa..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a1fcb7db9bdeabd874712ec4f00483d17_cgraph_org.svg
+++ /dev/null
@@ -1,108 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::slice Pages: 1 -->
-<svg width="588pt" height="113pt"
- viewBox="0.00 0.00 588.00 112.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 108.5)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::slice</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Creates a new matrix and returns a part of it.">
-<polygon fill="#999999" stroke="#666666" points="127,-41.75 0,-41.75 0,0 127,0 127,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::slice</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" target="_top" xlink:title="Constructor.">
-<polygon fill="white" stroke="#666666" points="290,-66.75 163,-66.75 163,-25 290,-25 290,-66.75"/>
-<text text-anchor="start" x="171" y="-53.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="171" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="226.5" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.21,-30.61C135.13,-31.84 143.29,-33.11 151.37,-34.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.78,-37.82 161.2,-35.89 151.86,-30.9 150.78,-37.82"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="580,-30.5 493.5,-30.5 493.5,-11.25 580,-11.25 580,-30.5"/>
-<text text-anchor="middle" x="536.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.27,-17.21C139.14,-16.65 151.45,-16.17 163,-15.88 293.85,-12.56 326.68,-11.7 457.5,-15.88 465.36,-16.13 473.66,-16.52 481.8,-16.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.43,-20.46 491.62,-17.57 481.85,-13.47 481.43,-20.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="457.5,-104.5 326,-104.5 326,-85.25 457.5,-85.25 457.5,-104.5"/>
-<text text-anchor="middle" x="391.75" y="-91" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.26,-65.1C302.13,-68.7 314.44,-72.42 326,-75.88 332.26,-77.75 338.86,-79.7 345.36,-81.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.09,-84.89 354.67,-84.36 346.06,-78.18 344.09,-84.89"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><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="455.25,-66.75 328.25,-66.75 328.25,-25 455.25,-25 455.25,-66.75"/>
-<text text-anchor="start" x="336.25" y="-53.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="336.25" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="391.75" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.15,-45.88C298.78,-45.88 307.7,-45.88 316.52,-45.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.48,-49.38 326.48,-45.88 316.48,-42.38 316.48,-49.38"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M455.47,-34.91C464.34,-33.36 473.4,-31.78 482.07,-30.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="482.48,-33.74 491.73,-28.57 481.28,-26.85 482.48,-33.74"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a42c986fb57b74fe1b7c5953cb1922c3d_cgraph.map b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a42c986fb57b74fe1b7c5953cb1922c3d_cgraph.map
deleted file mode 100644
index 24a99b515..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a42c986fb57b74fe1b7c5953cb1922c3d_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="divide_and_conquer::strassens_multiplication::Matrix::operator&#45;=" name="divide_and_conquer::strassens_multiplication::Matrix::operator&#45;=">
-<area shape="rect" id="Node000001" title="Subtract another matrices to current matrix." alt="" coords="5,39,175,94"/>
-<area shape="rect" id="Node000002" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" title="Get the matrix shape." alt="" coords="223,5,392,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="175,51,207,46,208,51,175,56"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="440,54,555,79"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="175,69,223,71,392,71,424,69,425,74,392,76,223,76,175,74"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="393,45,425,51,424,56,392,51"/>
-</map>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a42c986fb57b74fe1b7c5953cb1922c3d_cgraph.md5 b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a42c986fb57b74fe1b7c5953cb1922c3d_cgraph.md5
deleted file mode 100644
index daef94b6e..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a42c986fb57b74fe1b7c5953cb1922c3d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4ede00c0f99a61d89bac7c3976e2d6bc
\ No newline at end of file
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a42c986fb57b74fe1b7c5953cb1922c3d_cgraph.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a42c986fb57b74fe1b7c5953cb1922c3d_cgraph.svg
deleted file mode 100644
index ec61fa6af..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a42c986fb57b74fe1b7c5953cb1922c3d_cgraph.svg
+++ /dev/null
@@ -1,96 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator&#45;= Pages: 1 -->
-<svg width="421pt" height="75pt"
- viewBox="0.00 0.00 420.50 74.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 70.75)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::operator&#45;=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Subtract another matrices to current matrix.">
-<polygon fill="#999999" stroke="#666666" points="127,-41.75 0,-41.75 0,0 127,0 127,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator&#45;=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><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="290,-66.75 163,-66.75 163,-25 290,-25 290,-66.75"/>
-<text text-anchor="start" x="171" y="-53.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="171" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="226.5" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.21,-30.61C135.13,-31.84 143.29,-33.11 151.37,-34.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.78,-37.82 161.2,-35.89 151.86,-30.9 150.78,-37.82"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="412.5,-30.5 326,-30.5 326,-11.25 412.5,-11.25 412.5,-30.5"/>
-<text text-anchor="middle" x="369.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.27,-17.21C139.14,-16.65 151.45,-16.17 163,-15.88 219.43,-14.44 233.58,-14.07 290,-15.88 297.86,-16.13 306.16,-16.52 314.3,-16.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.93,-20.46 324.12,-17.57 314.35,-13.47 313.93,-20.46"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.46,-34.69C298.43,-33.28 306.53,-31.84 314.33,-30.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.8,-33.92 324.03,-28.73 313.57,-27.03 314.8,-33.92"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a42c986fb57b74fe1b7c5953cb1922c3d_cgraph_org.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a42c986fb57b74fe1b7c5953cb1922c3d_cgraph_org.svg
deleted file mode 100644
index 95f8ab3d8..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a42c986fb57b74fe1b7c5953cb1922c3d_cgraph_org.svg
+++ /dev/null
@@ -1,70 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator&#45;= Pages: 1 -->
-<svg width="421pt" height="75pt"
- viewBox="0.00 0.00 420.50 74.75" 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.75)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::operator&#45;=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Subtract another matrices to current matrix.">
-<polygon fill="#999999" stroke="#666666" points="127,-41.75 0,-41.75 0,0 127,0 127,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator&#45;=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><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="290,-66.75 163,-66.75 163,-25 290,-25 290,-66.75"/>
-<text text-anchor="start" x="171" y="-53.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="171" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="226.5" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.21,-30.61C135.13,-31.84 143.29,-33.11 151.37,-34.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.78,-37.82 161.2,-35.89 151.86,-30.9 150.78,-37.82"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="412.5,-30.5 326,-30.5 326,-11.25 412.5,-11.25 412.5,-30.5"/>
-<text text-anchor="middle" x="369.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.27,-17.21C139.14,-16.65 151.45,-16.17 163,-15.88 219.43,-14.44 233.58,-14.07 290,-15.88 297.86,-16.13 306.16,-16.52 314.3,-16.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.93,-20.46 324.12,-17.57 314.35,-13.47 313.93,-20.46"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.46,-34.69C298.43,-33.28 306.53,-31.84 314.33,-30.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.8,-33.92 324.03,-28.73 313.57,-27.03 314.8,-33.92"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a4aa49765cce39ce48b9241e993e0cfb9_cgraph.map b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a4aa49765cce39ce48b9241e993e0cfb9_cgraph.map
deleted file mode 100644
index e49c87710..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a4aa49765cce39ce48b9241e993e0cfb9_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="divide_and_conquer::strassens_multiplication::Matrix::Matrix" name="divide_and_conquer::strassens_multiplication::Matrix::Matrix">
-<area shape="rect" id="Node000001" title="Constructor." alt="" coords="5,5,175,61"/>
-<area shape="rect" id="Node000002" 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="223,20,398,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="175,30,207,30,207,36,175,36"/>
-</map>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a4aa49765cce39ce48b9241e993e0cfb9_cgraph.md5 b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a4aa49765cce39ce48b9241e993e0cfb9_cgraph.md5
deleted file mode 100644
index 4472e2593..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a4aa49765cce39ce48b9241e993e0cfb9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-49b8d0956d6aa938cac027d8080eec4d
\ No newline at end of file
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a4aa49765cce39ce48b9241e993e0cfb9_cgraph.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a4aa49765cce39ce48b9241e993e0cfb9_cgraph.svg
deleted file mode 100644
index f87b9b2d9..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a4aa49765cce39ce48b9241e993e0cfb9_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::Matrix Pages: 1 -->
-<svg width="303pt" height="50pt"
- viewBox="0.00 0.00 302.50 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::Matrix</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Constructor.">
-<polygon fill="#999999" stroke="#666666" points="127,-41.75 0,-41.75 0,0 127,0 127,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294.5,-30.5 163,-30.5 163,-11.25 294.5,-11.25 294.5,-30.5"/>
-<text text-anchor="middle" x="228.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.15,-20.88C135.03,-20.88 143.17,-20.88 151.23,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.05,-24.38 161.05,-20.88 151.05,-17.38 151.05,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a4aa49765cce39ce48b9241e993e0cfb9_cgraph_org.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a4aa49765cce39ce48b9241e993e0cfb9_cgraph_org.svg
deleted file mode 100644
index a0c73a692..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a4aa49765cce39ce48b9241e993e0cfb9_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::Matrix Pages: 1 -->
-<svg width="303pt" height="50pt"
- viewBox="0.00 0.00 302.50 49.75" 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.75)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::Matrix</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Constructor.">
-<polygon fill="#999999" stroke="#666666" points="127,-41.75 0,-41.75 0,0 127,0 127,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294.5,-30.5 163,-30.5 163,-11.25 294.5,-11.25 294.5,-30.5"/>
-<text text-anchor="middle" x="228.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.15,-20.88C135.03,-20.88 143.17,-20.88 151.23,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.05,-24.38 161.05,-20.88 151.05,-17.38 151.05,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a562faa16a4b4ed5d4804823c56f99c9c_cgraph.map b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a562faa16a4b4ed5d4804823c56f99c9c_cgraph.map
deleted file mode 100644
index 74428f3d3..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a562faa16a4b4ed5d4804823c56f99c9c_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="divide_and_conquer::strassens_multiplication::Matrix::operator==" name="divide_and_conquer::strassens_multiplication::Matrix::operator==">
-<area shape="rect" id="Node000001" title="Compares two matrices if each of them are equal or not." alt="" coords="5,5,175,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="223,20,338,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="175,30,207,30,207,36,175,36"/>
-</map>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a562faa16a4b4ed5d4804823c56f99c9c_cgraph.md5 b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a562faa16a4b4ed5d4804823c56f99c9c_cgraph.md5
deleted file mode 100644
index 1739bf35d..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a562faa16a4b4ed5d4804823c56f99c9c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5dedaf7a81bf2cb08cccb380001cd0b7
\ No newline at end of file
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a562faa16a4b4ed5d4804823c56f99c9c_cgraph.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a562faa16a4b4ed5d4804823c56f99c9c_cgraph.svg
deleted file mode 100644
index 6e6e824cd..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a562faa16a4b4ed5d4804823c56f99c9c_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator== Pages: 1 -->
-<svg width="258pt" height="50pt"
- viewBox="0.00 0.00 257.50 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::operator==</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compares two matrices if each of them are equal or not.">
-<polygon fill="#999999" stroke="#666666" points="127,-41.75 0,-41.75 0,0 127,0 127,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator==</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-30.5 163,-30.5 163,-11.25 249.5,-11.25 249.5,-30.5"/>
-<text text-anchor="middle" x="206.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.46,-20.88C135.34,-20.88 143.34,-20.88 151.06,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.01,-24.38 161.01,-20.88 151.01,-17.38 151.01,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a562faa16a4b4ed5d4804823c56f99c9c_cgraph_org.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a562faa16a4b4ed5d4804823c56f99c9c_cgraph_org.svg
deleted file mode 100644
index 943c31a21..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a562faa16a4b4ed5d4804823c56f99c9c_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator== Pages: 1 -->
-<svg width="258pt" height="50pt"
- viewBox="0.00 0.00 257.50 49.75" 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.75)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::operator==</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Compares two matrices if each of them are equal or not.">
-<polygon fill="#999999" stroke="#666666" points="127,-41.75 0,-41.75 0,0 127,0 127,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator==</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-30.5 163,-30.5 163,-11.25 249.5,-11.25 249.5,-30.5"/>
-<text text-anchor="middle" x="206.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.46,-20.88C135.34,-20.88 143.34,-20.88 151.06,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.01,-24.38 161.01,-20.88 151.01,-17.38 151.01,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a5d8eb669b37a27224376b08515b4ee50_cgraph.map b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a5d8eb669b37a27224376b08515b4ee50_cgraph.map
deleted file mode 100644
index 774169251..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a5d8eb669b37a27224376b08515b4ee50_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="divide_and_conquer::strassens_multiplication::Matrix::naive_multiplication" name="divide_and_conquer::strassens_multiplication::Matrix::naive_multiplication">
-<area shape="rect" id="Node000001" title="Naive multiplication performed on this." alt="" coords="5,89,193,145"/>
-<area shape="rect" id="Node000002" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" title="Constructor." alt="" coords="241,56,410,111"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="193,100,225,96,226,101,194,106"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="681,104,797,130"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="193,119,241,121,437,124,633,121,666,119,666,125,633,126,437,130,241,126,193,125"/>
-<area shape="rect" id="Node000003" 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="458,5,633,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="410,55,457,41,483,33,485,38,459,46,411,60"/>
-<area shape="rect" id="Node000004" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" title="Get the matrix shape." alt="" coords="461,56,630,111"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="410,81,445,81,445,86,410,86"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="631,95,667,102,666,107,630,101"/>
-</map>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a5d8eb669b37a27224376b08515b4ee50_cgraph.md5 b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a5d8eb669b37a27224376b08515b4ee50_cgraph.md5
deleted file mode 100644
index 4a217688e..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a5d8eb669b37a27224376b08515b4ee50_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e4fbf0787a2e5c44e3488431e0f7f350
\ No newline at end of file
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a5d8eb669b37a27224376b08515b4ee50_cgraph.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a5d8eb669b37a27224376b08515b4ee50_cgraph.svg
deleted file mode 100644
index 01e8a0d24..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a5d8eb669b37a27224376b08515b4ee50_cgraph.svg
+++ /dev/null
@@ -1,191 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::naive_multiplication Pages: 1 -->
-<!--zoomable 113 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 602;
-var viewHeight = 113;
-var sectionId = 'dynsection-4';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>divide_and_conquer::strassens_multiplication::Matrix::naive_multiplication</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Naive multiplication performed on this.">
-<polygon fill="#999999" stroke="#666666" points="140.5,-41.75 0,-41.75 0,0 140.5,0 140.5,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="70.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::naive_multiplication</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" target="_top" xlink:title="Constructor.">
-<polygon fill="white" stroke="#666666" points="303.5,-66.75 176.5,-66.75 176.5,-25 303.5,-25 303.5,-66.75"/>
-<text text-anchor="start" x="184.5" y="-53.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="184.5" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="240" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.93,-31.26C148.89,-32.45 157.02,-33.66 165.02,-34.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.33,-38.29 174.74,-36.3 165.36,-31.36 164.33,-38.29"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="593.5,-30.5 507,-30.5 507,-11.25 593.5,-11.25 593.5,-30.5"/>
-<text text-anchor="middle" x="550.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.87,-17.1C152.75,-16.59 164.98,-16.15 176.5,-15.88 307.35,-12.77 340.18,-11.7 471,-15.88 478.86,-16.13 487.16,-16.52 495.3,-16.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="494.93,-20.46 505.12,-17.57 495.35,-13.47 494.93,-20.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="471,-104.5 339.5,-104.5 339.5,-85.25 471,-85.25 471,-104.5"/>
-<text text-anchor="middle" x="405.25" y="-91" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.76,-65.1C315.63,-68.7 327.94,-72.42 339.5,-75.88 345.76,-77.75 352.36,-79.7 358.86,-81.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="357.59,-84.89 368.17,-84.36 359.56,-78.18 357.59,-84.89"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><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="468.75,-66.75 341.75,-66.75 341.75,-25 468.75,-25 468.75,-66.75"/>
-<text text-anchor="start" x="349.75" y="-53.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="349.75" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="405.25" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.65,-45.88C312.28,-45.88 321.2,-45.88 330.02,-45.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.98,-49.38 339.98,-45.88 329.98,-42.38 329.98,-49.38"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M468.97,-34.91C477.84,-33.36 486.9,-31.78 495.57,-30.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.98,-33.74 505.23,-28.57 494.78,-26.85 495.98,-33.74"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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_a5d8eb669b37a27224376b08515b4ee50_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a5d8eb669b37a27224376b08515b4ee50_cgraph_org.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a5d8eb669b37a27224376b08515b4ee50_cgraph_org.svg
deleted file mode 100644
index 62ca5eb7c..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a5d8eb669b37a27224376b08515b4ee50_cgraph_org.svg
+++ /dev/null
@@ -1,108 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::naive_multiplication Pages: 1 -->
-<svg width="602pt" height="113pt"
- viewBox="0.00 0.00 601.50 112.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 108.5)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::naive_multiplication</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Naive multiplication performed on this.">
-<polygon fill="#999999" stroke="#666666" points="140.5,-41.75 0,-41.75 0,0 140.5,0 140.5,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="70.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::naive_multiplication</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" target="_top" xlink:title="Constructor.">
-<polygon fill="white" stroke="#666666" points="303.5,-66.75 176.5,-66.75 176.5,-25 303.5,-25 303.5,-66.75"/>
-<text text-anchor="start" x="184.5" y="-53.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="184.5" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="240" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.93,-31.26C148.89,-32.45 157.02,-33.66 165.02,-34.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.33,-38.29 174.74,-36.3 165.36,-31.36 164.33,-38.29"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="593.5,-30.5 507,-30.5 507,-11.25 593.5,-11.25 593.5,-30.5"/>
-<text text-anchor="middle" x="550.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.87,-17.1C152.75,-16.59 164.98,-16.15 176.5,-15.88 307.35,-12.77 340.18,-11.7 471,-15.88 478.86,-16.13 487.16,-16.52 495.3,-16.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="494.93,-20.46 505.12,-17.57 495.35,-13.47 494.93,-20.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="471,-104.5 339.5,-104.5 339.5,-85.25 471,-85.25 471,-104.5"/>
-<text text-anchor="middle" x="405.25" y="-91" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.76,-65.1C315.63,-68.7 327.94,-72.42 339.5,-75.88 345.76,-77.75 352.36,-79.7 358.86,-81.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="357.59,-84.89 368.17,-84.36 359.56,-78.18 357.59,-84.89"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><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="468.75,-66.75 341.75,-66.75 341.75,-25 468.75,-25 468.75,-66.75"/>
-<text text-anchor="start" x="349.75" y="-53.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="349.75" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="405.25" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.65,-45.88C312.28,-45.88 321.2,-45.88 330.02,-45.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.98,-49.38 339.98,-45.88 329.98,-42.38 329.98,-49.38"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M468.97,-34.91C477.84,-33.36 486.9,-31.78 495.57,-30.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="495.98,-33.74 505.23,-28.57 494.78,-26.85 495.98,-33.74"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a60599668b56001cef4bb59d4cb5c6c6c_cgraph.map b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a60599668b56001cef4bb59d4cb5c6c6c_cgraph.map
deleted file mode 100644
index 4027b66e5..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a60599668b56001cef4bb59d4cb5c6c6c_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="divide_and_conquer::strassens_multiplication::Matrix::operator*" name="divide_and_conquer::strassens_multiplication::Matrix::operator*">
-<area shape="rect" id="Node000001" title="Multiply two matrices and returns a new matrix." alt="" coords="5,27,175,82"/>
-<area shape="rect" id="Node000002" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50" title="Naive multiplication performed on this." alt="" coords="223,92,410,148"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="176,76,209,86,207,91,175,81"/>
-<area shape="rect" id="Node000005" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" title="Get the matrix shape." alt="" coords="678,41,848,97"/>
-<area shape="poly" id="edge7_Node000001_Node000005" title=" " alt="" coords="175,54,663,64,662,70,175,59"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="899,56,1014,82"/>
-<area shape="poly" id="edge8_Node000001_Node000006" title=" " alt="" coords="175,42,222,38,399,22,538,7,605,3,676,4,757,12,851,26,885,35,916,47,914,52,883,40,850,32,756,17,676,10,605,8,538,12,400,27,223,44,176,48"/>
-<area shape="rect" id="Node000003" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" title="Constructor." alt="" coords="458,92,627,148"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="411,117,442,117,442,122,411,122"/>
-<area shape="poly" id="edge6_Node000002_Node000006" title=" " alt="" coords="405,146,500,168,613,184,673,186,733,183,793,174,850,157,874,145,897,128,933,92,937,96,901,132,877,149,852,162,794,179,734,188,673,191,612,189,499,173,404,151"/>
-<area shape="rect" id="Node000004" 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="675,122,851,147"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="628,123,660,125,659,130,627,128"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="627,98,662,89,664,95,628,103"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="848,66,883,66,883,72,848,72"/>
-</map>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a60599668b56001cef4bb59d4cb5c6c6c_cgraph.md5 b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a60599668b56001cef4bb59d4cb5c6c6c_cgraph.md5
deleted file mode 100644
index 6e360d2a9..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a60599668b56001cef4bb59d4cb5c6c6c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6062d2046567a5d267e8249e8aa8e655
\ No newline at end of file
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a60599668b56001cef4bb59d4cb5c6c6c_cgraph.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a60599668b56001cef4bb59d4cb5c6c6c_cgraph.svg
deleted file mode 100644
index 89b4d8964..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a60599668b56001cef4bb59d4cb5c6c6c_cgraph.svg
+++ /dev/null
@@ -1,229 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator* Pages: 1 -->
-<!--zoomable 145 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 765;
-var viewHeight = 145;
-var sectionId = 'dynsection-5';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>divide_and_conquer::strassens_multiplication::Matrix::operator*</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Multiply two matrices and returns a new matrix.">
-<polygon fill="#999999" stroke="#666666" points="127,-121.52 0,-121.52 0,-79.77 127,-79.77 127,-121.52"/>
-<text text-anchor="start" x="8" y="-108.02" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-96.77" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-85.52" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator*</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><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="303.5,-72.52 163,-72.52 163,-30.77 303.5,-30.77 303.5,-72.52"/>
-<text text-anchor="start" x="171" y="-59.02" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="171" y="-47.77" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="233.25" y="-36.52" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::naive_multiplication</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.44,-82.26C135.46,-79.92 143.74,-77.5 151.99,-75.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.7,-78.53 161.31,-72.37 150.73,-71.81 152.7,-78.53"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><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="631.75,-110.52 504.75,-110.52 504.75,-68.77 631.75,-68.77 631.75,-110.52"/>
-<text text-anchor="start" x="512.75" y="-97.02" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="512.75" y="-85.77" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="568.25" y="-74.52" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge7_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge7_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.41,-99.27C220.3,-97.24 393.8,-93.44 492.86,-91.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="492.84,-94.78 502.76,-91.06 492.68,-87.78 492.84,-94.78"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="756.5,-99.27 670,-99.27 670,-80.02 756.5,-80.02 756.5,-99.27"/>
-<text text-anchor="middle" x="713.25" y="-85.77" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge8_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge8_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.5,-107.75C139.28,-108.88 151.51,-109.91 163,-110.65 371.95,-124.01 428.13,-157.76 634,-119.65 650.42,-116.61 667.84,-110.27 682.06,-104.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="683.16,-107.54 690.87,-100.28 680.31,-101.14 683.16,-107.54"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" target="_top" xlink:title="Constructor.">
-<polygon fill="white" stroke="#666666" points="466.5,-72.52 339.5,-72.52 339.5,-30.77 466.5,-30.77 466.5,-72.52"/>
-<text text-anchor="start" x="347.5" y="-59.02" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="347.5" y="-47.77" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="403" y="-36.52" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.93,-51.65C311.8,-51.65 319.83,-51.65 327.75,-51.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.72,-55.15 337.72,-51.65 327.72,-48.15 327.72,-55.15"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge6_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge6_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.62,-30.34C380.79,-7.52 522.2,20.14 634,-21.65 660.07,-31.39 683.2,-54.18 697.43,-70.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="694.7,-72.89 703.77,-78.38 700.1,-68.44 694.7,-72.89"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="634,-50.27 502.5,-50.27 502.5,-31.02 634,-31.02 634,-50.27"/>
-<text text-anchor="middle" x="568.25" y="-36.77" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M466.65,-47.43C474.53,-46.9 482.67,-46.35 490.73,-45.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="490.81,-49.31 500.55,-45.14 490.34,-42.32 490.81,-49.31"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M466.65,-66.23C475.37,-68.26 484.41,-70.37 493.31,-72.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="492.49,-75.84 503.02,-74.7 494.08,-69.02 492.49,-75.84"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M631.97,-89.65C640.74,-89.65 649.69,-89.65 658.28,-89.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="658.21,-93.15 668.21,-89.65 658.21,-86.15 658.21,-93.15"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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_a60599668b56001cef4bb59d4cb5c6c6c_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a60599668b56001cef4bb59d4cb5c6c6c_cgraph_org.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a60599668b56001cef4bb59d4cb5c6c6c_cgraph_org.svg
deleted file mode 100644
index 3cf846ae9..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a60599668b56001cef4bb59d4cb5c6c6c_cgraph_org.svg
+++ /dev/null
@@ -1,146 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator* Pages: 1 -->
-<svg width="765pt" height="145pt"
- viewBox="0.00 0.00 764.50 145.42" 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 141.42)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::operator*</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Multiply two matrices and returns a new matrix.">
-<polygon fill="#999999" stroke="#666666" points="127,-121.52 0,-121.52 0,-79.77 127,-79.77 127,-121.52"/>
-<text text-anchor="start" x="8" y="-108.02" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-96.77" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-85.52" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator*</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><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="303.5,-72.52 163,-72.52 163,-30.77 303.5,-30.77 303.5,-72.52"/>
-<text text-anchor="start" x="171" y="-59.02" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="171" y="-47.77" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="233.25" y="-36.52" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::naive_multiplication</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.44,-82.26C135.46,-79.92 143.74,-77.5 151.99,-75.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.7,-78.53 161.31,-72.37 150.73,-71.81 152.7,-78.53"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><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="631.75,-110.52 504.75,-110.52 504.75,-68.77 631.75,-68.77 631.75,-110.52"/>
-<text text-anchor="start" x="512.75" y="-97.02" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="512.75" y="-85.77" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="568.25" y="-74.52" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge7_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge7_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.41,-99.27C220.3,-97.24 393.8,-93.44 492.86,-91.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="492.84,-94.78 502.76,-91.06 492.68,-87.78 492.84,-94.78"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="756.5,-99.27 670,-99.27 670,-80.02 756.5,-80.02 756.5,-99.27"/>
-<text text-anchor="middle" x="713.25" y="-85.77" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge8_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge8_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.5,-107.75C139.28,-108.88 151.51,-109.91 163,-110.65 371.95,-124.01 428.13,-157.76 634,-119.65 650.42,-116.61 667.84,-110.27 682.06,-104.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="683.16,-107.54 690.87,-100.28 680.31,-101.14 683.16,-107.54"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" target="_top" xlink:title="Constructor.">
-<polygon fill="white" stroke="#666666" points="466.5,-72.52 339.5,-72.52 339.5,-30.77 466.5,-30.77 466.5,-72.52"/>
-<text text-anchor="start" x="347.5" y="-59.02" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="347.5" y="-47.77" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="403" y="-36.52" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.93,-51.65C311.8,-51.65 319.83,-51.65 327.75,-51.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.72,-55.15 337.72,-51.65 327.72,-48.15 327.72,-55.15"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge6_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge6_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M299.62,-30.34C380.79,-7.52 522.2,20.14 634,-21.65 660.07,-31.39 683.2,-54.18 697.43,-70.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="694.7,-72.89 703.77,-78.38 700.1,-68.44 694.7,-72.89"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="634,-50.27 502.5,-50.27 502.5,-31.02 634,-31.02 634,-50.27"/>
-<text text-anchor="middle" x="568.25" y="-36.77" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M466.65,-47.43C474.53,-46.9 482.67,-46.35 490.73,-45.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="490.81,-49.31 500.55,-45.14 490.34,-42.32 490.81,-49.31"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M466.65,-66.23C475.37,-68.26 484.41,-70.37 493.31,-72.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="492.49,-75.84 503.02,-74.7 494.08,-69.02 492.49,-75.84"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M631.97,-89.65C640.74,-89.65 649.69,-89.65 658.28,-89.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="658.21,-93.15 668.21,-89.65 658.21,-86.15 658.21,-93.15"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a678681c9f6266a8219bd6bee6972d70e_cgraph.map b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a678681c9f6266a8219bd6bee6972d70e_cgraph.map
deleted file mode 100644
index 0e5e65752..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a678681c9f6266a8219bd6bee6972d70e_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="divide_and_conquer::strassens_multiplication::Matrix::operator&#45;" name="divide_and_conquer::strassens_multiplication::Matrix::operator&#45;">
-<area shape="rect" id="Node000001" title="Subtract two matrices and returns a new matrix." alt="" coords="5,71,175,126"/>
-<area shape="rect" id="Node000002" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" title="Constructor." alt="" coords="223,5,392,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="174,71,207,60,209,66,176,76"/>
-<area shape="rect" id="Node000004" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" title="Get the matrix shape." alt="" coords="443,63,612,118"/>
-<area shape="poly" id="edge5_Node000001_Node000004" title=" " alt="" coords="175,94,427,90,427,95,175,100"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="663,111,779,137"/>
-<area shape="poly" id="edge6_Node000001_Node000005" title=" " alt="" coords="175,106,300,118,440,128,528,130,615,128,648,126,648,132,615,133,528,135,440,133,300,123,175,111"/>
-<area shape="rect" id="Node000003" 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="440,12,615,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="392,27,424,26,424,32,392,33"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="393,53,429,62,427,67,392,58"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="613,102,649,109,648,114,612,108"/>
-</map>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a678681c9f6266a8219bd6bee6972d70e_cgraph.md5 b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a678681c9f6266a8219bd6bee6972d70e_cgraph.md5
deleted file mode 100644
index f3ab91671..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a678681c9f6266a8219bd6bee6972d70e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f2244dc240742a43aecb36954657cc3c
\ No newline at end of file
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a678681c9f6266a8219bd6bee6972d70e_cgraph.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a678681c9f6266a8219bd6bee6972d70e_cgraph.svg
deleted file mode 100644
index 8badd5859..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a678681c9f6266a8219bd6bee6972d70e_cgraph.svg
+++ /dev/null
@@ -1,200 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator&#45; Pages: 1 -->
-<!--zoomable 107 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 588;
-var viewHeight = 107;
-var sectionId = 'dynsection-10';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>divide_and_conquer::strassens_multiplication::Matrix::operator&#45;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Subtract two matrices and returns a new matrix.">
-<polygon fill="#999999" stroke="#666666" points="127,-49.5 0,-49.5 0,-7.75 127,-7.75 127,-49.5"/>
-<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="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-13.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator&#45;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" target="_top" xlink:title="Constructor.">
-<polygon fill="white" stroke="#666666" points="290,-98.5 163,-98.5 163,-56.75 290,-56.75 290,-98.5"/>
-<text text-anchor="start" x="171" y="-85" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="171" y="-73.75" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="226.5" y="-62.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.21,-47.71C135.31,-50.18 143.67,-52.72 151.93,-55.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.66,-58.51 161.25,-58.07 152.7,-51.81 150.66,-58.51"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><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="455.25,-55.5 328.25,-55.5 328.25,-13.75 455.25,-13.75 455.25,-55.5"/>
-<text text-anchor="start" x="336.25" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="336.25" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="391.75" y="-19.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.4,-29.78C181.37,-30.77 259.22,-32.21 316.28,-33.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.19,-36.75 326.25,-33.44 316.31,-29.76 316.19,-36.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="580,-19.25 493.5,-19.25 493.5,0 580,0 580,-19.25"/>
-<text text-anchor="middle" x="536.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.27,-21.24C180.17,-15.4 257.91,-7.74 326,-4.62 384.38,-1.95 399.09,-2.76 457.5,-4.62 465.36,-4.88 473.66,-5.27 481.8,-5.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.43,-9.21 491.62,-6.32 481.85,-2.22 481.43,-9.21"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="457.5,-93.25 326,-93.25 326,-74 457.5,-74 457.5,-93.25"/>
-<text text-anchor="middle" x="391.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.15,-79.93C298.03,-80.22 306.17,-80.52 314.23,-80.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.93,-84.3 324.05,-81.17 314.18,-77.31 313.93,-84.3"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.15,-61.12C298.97,-58.8 308.11,-56.39 317.11,-54.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.76,-57.47 326.53,-51.54 315.97,-50.7 317.76,-57.47"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M455.47,-23.66C464.34,-22.11 473.4,-20.53 482.07,-19.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="482.48,-22.49 491.73,-17.32 481.28,-15.6 482.48,-22.49"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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_a678681c9f6266a8219bd6bee6972d70e_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a678681c9f6266a8219bd6bee6972d70e_cgraph_org.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a678681c9f6266a8219bd6bee6972d70e_cgraph_org.svg
deleted file mode 100644
index e74f84bb5..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a678681c9f6266a8219bd6bee6972d70e_cgraph_org.svg
+++ /dev/null
@@ -1,117 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator&#45; Pages: 1 -->
-<svg width="588pt" height="107pt"
- viewBox="0.00 0.00 588.00 106.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 102.5)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::operator&#45;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Subtract two matrices and returns a new matrix.">
-<polygon fill="#999999" stroke="#666666" points="127,-49.5 0,-49.5 0,-7.75 127,-7.75 127,-49.5"/>
-<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="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-13.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator&#45;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" target="_top" xlink:title="Constructor.">
-<polygon fill="white" stroke="#666666" points="290,-98.5 163,-98.5 163,-56.75 290,-56.75 290,-98.5"/>
-<text text-anchor="start" x="171" y="-85" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="171" y="-73.75" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="226.5" y="-62.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.21,-47.71C135.31,-50.18 143.67,-52.72 151.93,-55.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.66,-58.51 161.25,-58.07 152.7,-51.81 150.66,-58.51"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><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="455.25,-55.5 328.25,-55.5 328.25,-13.75 455.25,-13.75 455.25,-55.5"/>
-<text text-anchor="start" x="336.25" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="336.25" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="391.75" y="-19.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.4,-29.78C181.37,-30.77 259.22,-32.21 316.28,-33.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.19,-36.75 326.25,-33.44 316.31,-29.76 316.19,-36.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="580,-19.25 493.5,-19.25 493.5,0 580,0 580,-19.25"/>
-<text text-anchor="middle" x="536.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.27,-21.24C180.17,-15.4 257.91,-7.74 326,-4.62 384.38,-1.95 399.09,-2.76 457.5,-4.62 465.36,-4.88 473.66,-5.27 481.8,-5.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.43,-9.21 491.62,-6.32 481.85,-2.22 481.43,-9.21"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="457.5,-93.25 326,-93.25 326,-74 457.5,-74 457.5,-93.25"/>
-<text text-anchor="middle" x="391.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.15,-79.93C298.03,-80.22 306.17,-80.52 314.23,-80.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.93,-84.3 324.05,-81.17 314.18,-77.31 313.93,-84.3"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.15,-61.12C298.97,-58.8 308.11,-56.39 317.11,-54.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.76,-57.47 326.53,-51.54 315.97,-50.7 317.76,-57.47"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M455.47,-23.66C464.34,-22.11 473.4,-20.53 482.07,-19.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="482.48,-22.49 491.73,-17.32 481.28,-15.6 482.48,-22.49"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a87c2ed8f19bda2ad21ee4cbed32c394a_cgraph.map b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a87c2ed8f19bda2ad21ee4cbed32c394a_cgraph.map
deleted file mode 100644
index cc694ce69..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a87c2ed8f19bda2ad21ee4cbed32c394a_cgraph.map
+++ /dev/null
@@ -1,33 +0,0 @@
-<map id="divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication" name="divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication">
-<area shape="rect" id="Node000001" title="Strassens method of multiplying two matrices References: https://en.wikipedia.org/wiki/Strassen_algor..." alt="" coords="5,190,219,246"/>
-<area shape="poly" id="edge15_Node000001_Node000001" title=" " alt="" coords="64,190,64,180,73,171,89,166,112,164,138,166,154,173,152,178,137,171,112,169,90,171,76,176,69,182,69,190"/>
-<area shape="rect" id="Node000002" 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="276,26,445,82"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="145,188,200,144,265,99,284,87,287,92,268,103,203,148,148,192"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="943,208,1058,234"/>
-<area shape="poly" id="edge11_Node000001_Node000004" title=" " alt="" coords="157,188,208,162,266,142,324,134,402,131,589,135,772,149,895,168,933,181,966,198,964,202,930,186,894,173,772,154,589,140,402,136,324,140,267,147,210,167,160,192"/>
-<area shape="rect" id="Node000005" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50" title="Naive multiplication performed on this." alt="" coords="267,157,454,213"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="219,201,251,197,252,202,220,206"/>
-<area shape="rect" id="Node000008" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" title="Get the matrix shape." alt="" coords="722,360,892,415"/>
-<area shape="poly" id="edge10_Node000001_Node000008" title=" " alt="" coords="175,244,322,304,411,335,503,360,608,376,707,383,707,389,607,381,501,365,410,340,320,309,173,249"/>
-<area shape="rect" id="Node000009" 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="276,425,445,481"/>
-<area shape="poly" id="edge12_Node000001_Node000009" title=" " alt="" coords="133,245,189,322,226,365,268,404,283,415,280,419,265,408,222,369,184,325,129,248"/>
-<area shape="rect" id="Node000010" 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="502,214,671,270"/>
-<area shape="poly" id="edge16_Node000001_Node000010" title=" " alt="" coords="219,221,486,234,486,240,219,226"/>
-<area shape="rect" id="Node000003" 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="510,5,664,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="445,38,494,30,494,36,446,43"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="445,51,560,54,690,60,811,75,860,85,896,98,925,118,950,143,987,193,982,196,946,146,922,122,893,103,858,90,810,80,690,66,559,59,445,57"/>
-<area shape="poly" id="edge9_Node000005_Node000004" title=" " alt="" coords="455,178,657,177,776,182,895,193,939,201,938,206,894,198,776,187,657,182,455,183"/>
-<area shape="rect" id="Node000006" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" title="Constructor." alt="" coords="502,294,671,350"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="400,211,449,245,503,280,511,284,509,289,501,284,446,249,397,215"/>
-<area shape="rect" id="Node000007" 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="719,309,895,335"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="672,320,704,320,704,325,672,325"/>
-<area shape="poly" id="edge7_Node000006_Node000008" title=" " alt="" coords="672,345,708,355,707,361,671,350"/>
-<area shape="poly" id="edge8_Node000008_Node000004" title=" " alt="" coords="876,357,893,345,920,322,944,295,981,245,985,248,948,298,923,325,896,350,879,361"/>
-<area shape="poly" id="edge14_Node000009_Node000004" title=" " alt="" coords="446,470,544,485,601,489,661,489,722,484,782,473,840,453,893,425,915,408,933,387,962,339,981,290,992,248,997,250,986,291,967,341,938,390,918,412,896,430,842,458,783,478,722,489,661,494,600,494,543,490,445,476"/>
-<area shape="poly" id="edge13_Node000009_Node000006" title=" " alt="" coords="409,422,522,356,525,361,412,427"/>
-<area shape="poly" id="edge20_Node000010_Node000004" title=" " alt="" coords="672,247,778,250,894,244,939,235,940,241,895,249,778,255,672,252"/>
-<area shape="poly" id="edge18_Node000010_Node000007" title=" " alt="" coords="666,268,756,301,754,306,664,273"/>
-<area shape="poly" id="edge19_Node000010_Node000008" title=" " alt="" coords="656,268,673,280,689,297,698,314,706,329,721,346,725,348,722,353,718,349,702,332,693,316,684,300,670,284,653,273"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="747,208,867,234"/>
-<area shape="poly" id="edge17_Node000010_Node000011" title=" " alt="" coords="671,231,732,225,732,231,672,237"/>
-</map>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a87c2ed8f19bda2ad21ee4cbed32c394a_cgraph.md5 b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a87c2ed8f19bda2ad21ee4cbed32c394a_cgraph.md5
deleted file mode 100644
index f8f58b2c1..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a87c2ed8f19bda2ad21ee4cbed32c394a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-df23fcc52ef2ac5c01b6e9d86488406e
\ No newline at end of file
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a87c2ed8f19bda2ad21ee4cbed32c394a_cgraph.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a87c2ed8f19bda2ad21ee4cbed32c394a_cgraph.svg
deleted file mode 100644
index 111f4a65d..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a87c2ed8f19bda2ad21ee4cbed32c394a_cgraph.svg
+++ /dev/null
@@ -1,388 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication Pages: 1 -->
-<!--zoomable 373 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 798;
-var viewHeight = 373;
-var sectionId = 'dynsection-15';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Strassens method of multiplying two matrices References: https://en.wikipedia.org/wiki/Strassen_algor...">
-<polygon fill="#999999" stroke="#666666" points="160,-226.62 0,-226.62 0,-184.87 160,-184.87 160,-226.62"/>
-<text text-anchor="start" x="8" y="-213.12" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-201.87" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="80" y="-190.62" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::strassens_multiplication</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge15_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge15_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.62,-226.94C42.35,-236.42 53.81,-244.62 80,-244.62 95.14,-244.62 105.36,-241.88 110.65,-237.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="113.93,-238.96 113.88,-228.37 107.31,-236.68 113.93,-238.96"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><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="329.75,-349.62 202.75,-349.62 202.75,-307.87 329.75,-307.87 329.75,-349.62"/>
-<text text-anchor="start" x="210.75" y="-336.12" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="210.75" y="-324.87" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="266.25" y="-313.62" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::h_stack</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.05,-227.09C128.71,-245.85 163.42,-273.29 196,-293.74 200.54,-296.59 205.34,-299.4 210.21,-302.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.45,-305.14 218.91,-306.81 211.77,-298.98 208.45,-305.14"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="789.5,-213.37 703,-213.37 703,-194.12 789.5,-194.12 789.5,-213.37"/>
-<text text-anchor="middle" x="746.25" y="-199.87" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge11_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge11_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.76,-226.84C136.93,-239.42 167.08,-254.18 196,-260.74 285.85,-281.12 593.65,-260.85 667,-241.74 685.46,-236.94 704.76,-227.62 719.57,-219.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="721.25,-222.49 728.18,-214.47 717.76,-216.42 721.25,-222.49"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><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="336.5,-251.62 196,-251.62 196,-209.87 336.5,-209.87 336.5,-251.62"/>
-<text text-anchor="start" x="204" y="-238.12" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="204" y="-226.87" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="266.25" y="-215.62" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::naive_multiplication</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.48,-216.53C168.42,-217.61 176.49,-218.7 184.45,-219.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.72,-223.21 194.1,-221.09 184.66,-216.28 183.72,-223.21"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><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="664.75,-99.62 537.75,-99.62 537.75,-57.87 664.75,-57.87 664.75,-99.62"/>
-<text text-anchor="start" x="545.75" y="-86.12" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="545.75" y="-74.87" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="601.25" y="-63.62" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge10_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge10_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.27,-184.56C182.62,-159.25 282.42,-117.8 372.5,-97.74 423.09,-86.48 481.35,-81.77 526.28,-79.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="526.33,-83.35 536.19,-79.47 526.06,-76.35 526.33,-83.35"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><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="329.75,-50.62 202.75,-50.62 202.75,-8.87 329.75,-8.87 329.75,-50.62"/>
-<text text-anchor="start" x="210.75" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="210.75" y="-25.87" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="266.25" y="-14.62" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::slice</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge12_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge12_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.16,-184.52C113.49,-154.69 152.06,-100.08 196,-64.74 199.44,-61.97 203.14,-59.34 206.98,-56.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.66,-59.92 215.41,-51.75 205.04,-53.93 208.66,-59.92"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><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="499.5,-208.62 372.5,-208.62 372.5,-166.87 499.5,-166.87 499.5,-208.62"/>
-<text text-anchor="start" x="380.5" y="-195.12" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="380.5" y="-183.87" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="436" y="-172.62" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::v_stack</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge16_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge16_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.44,-201.7C220.36,-198.66 301.96,-194.51 360.6,-191.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="360.69,-195.03 370.5,-191.02 360.34,-188.04 360.69,-195.03"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="493.88,-365.37 378.12,-365.37 378.12,-346.12 493.88,-346.12 493.88,-365.37"/>
-<text text-anchor="middle" x="436" y="-351.87" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.19,-338.87C342.03,-340.78 354.46,-342.78 366.45,-344.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.87,-348.16 376.3,-346.3 366.98,-341.25 365.87,-348.16"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M329.98,-328.91C427.38,-328.22 609.74,-322.92 667,-293.74 697.62,-278.14 721.42,-244.95 734.38,-223.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="737.26,-225.53 739.24,-215.12 731.2,-222.03 737.26,-225.53"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge9_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge9_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.92,-233.93C416.95,-236.53 552.04,-237.67 667,-222.74 677.8,-221.34 689.28,-219.03 700.02,-216.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="700.55,-219.97 709.42,-214.17 698.87,-213.18 700.55,-219.97"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" target="_top" xlink:title="Constructor.">
-<polygon fill="white" stroke="#666666" points="499.5,-148.62 372.5,-148.62 372.5,-106.87 499.5,-106.87 499.5,-148.62"/>
-<text text-anchor="start" x="380.5" y="-135.12" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="380.5" y="-123.87" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="436" y="-112.62" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M295.04,-209.66C315.81,-194.35 345.21,-173.62 372.5,-157.74 374.41,-156.63 376.37,-155.52 378.36,-154.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.96,-157.54 387.15,-149.76 376.68,-151.36 379.96,-157.54"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="667,-137.37 535.5,-137.37 535.5,-118.12 667,-118.12 667,-137.37"/>
-<text text-anchor="middle" x="601.25" y="-123.87" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M499.65,-127.74C507.53,-127.74 515.67,-127.74 523.73,-127.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="523.55,-131.24 533.55,-127.74 523.55,-124.24 523.55,-131.24"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M499.65,-108.94C508.47,-106.29 517.61,-103.55 526.61,-100.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="527.48,-104.24 536.05,-98.01 525.46,-97.54 527.48,-104.24"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge8_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge8_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M654.04,-100.11C658.59,-102.76 662.98,-105.64 667,-108.74 694.92,-130.31 719.37,-163.58 733.22,-184.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="730.11,-186.12 738.47,-192.62 736,-182.32 730.11,-186.12"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node4 -->
-<g id="edge14_Node000009_Node000004" class="edge">
-<title>Node9&#45;&gt;Node4</title>
-<g id="a_edge14_Node000009_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M329.91,-14.66C413.93,1.83 564.41,17.8 667,-48.74 714.3,-79.42 734.25,-148.01 741.57,-182.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="738.1,-183.23 743.44,-192.38 744.97,-181.9 738.1,-183.23"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node6 -->
-<g id="edge13_Node000009_Node000006" class="edge">
-<title>Node9&#45;&gt;Node6</title>
-<g id="a_edge13_Node000009_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.65,-51.01C328.6,-65.58 361.91,-85.04 388.74,-100.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="386.96,-103.74 397.36,-105.76 390.5,-97.69 386.96,-103.74"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node4 -->
-<g id="edge20_Node000010_Node000004" class="edge">
-<title>Node10&#45;&gt;Node4</title>
-<g id="a_edge20_Node000010_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M499.71,-182.48C546.09,-179.67 610.7,-178.01 667,-184.74 677.92,-186.05 689.52,-188.35 700.35,-190.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="699.27,-194.24 709.82,-193.27 700.97,-187.45 699.27,-194.24"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node7 -->
-<g id="edge18_Node000010_Node000007" class="edge">
-<title>Node10&#45;&gt;Node7</title>
-<g id="a_edge18_Node000010_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M495.02,-166.42C517.44,-158.18 542.47,-148.98 562.49,-141.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="563.44,-145 571.62,-138.27 561.03,-138.43 563.44,-145"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node8 -->
-<g id="edge19_Node000010_Node000008" class="edge">
-<title>Node10&#45;&gt;Node8</title>
-<g id="a_edge19_Node000010_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M487.17,-166.47C491.52,-163.8 495.7,-160.89 499.5,-157.74 520.3,-140.49 514.58,-125.85 535.5,-108.74 536.46,-107.96 537.44,-107.19 538.45,-106.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="540.32,-109.39 546.68,-100.92 536.43,-103.58 540.32,-109.39"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="646,-213.37 556.5,-213.37 556.5,-194.12 646,-194.12 646,-213.37"/>
-<text text-anchor="middle" x="601.25" y="-199.87" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge17_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge17_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M499.65,-193.88C514.55,-195.34 530.34,-196.89 544.89,-198.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="544.45,-201.79 554.74,-199.28 545.13,-194.82 544.45,-201.79"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a87c2ed8f19bda2ad21ee4cbed32c394a_cgraph_org.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a87c2ed8f19bda2ad21ee4cbed32c394a_cgraph_org.svg
deleted file mode 100644
index 8fc0489c3..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_a87c2ed8f19bda2ad21ee4cbed32c394a_cgraph_org.svg
+++ /dev/null
@@ -1,305 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication Pages: 1 -->
-<svg width="798pt" height="373pt"
- viewBox="0.00 0.00 797.50 373.37" 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 369.37)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Strassens method of multiplying two matrices References: https://en.wikipedia.org/wiki/Strassen_algor...">
-<polygon fill="#999999" stroke="#666666" points="160,-226.62 0,-226.62 0,-184.87 160,-184.87 160,-226.62"/>
-<text text-anchor="start" x="8" y="-213.12" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-201.87" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="80" y="-190.62" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::strassens_multiplication</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge15_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge15_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.62,-226.94C42.35,-236.42 53.81,-244.62 80,-244.62 95.14,-244.62 105.36,-241.88 110.65,-237.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="113.93,-238.96 113.88,-228.37 107.31,-236.68 113.93,-238.96"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><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="329.75,-349.62 202.75,-349.62 202.75,-307.87 329.75,-307.87 329.75,-349.62"/>
-<text text-anchor="start" x="210.75" y="-336.12" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="210.75" y="-324.87" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="266.25" y="-313.62" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::h_stack</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.05,-227.09C128.71,-245.85 163.42,-273.29 196,-293.74 200.54,-296.59 205.34,-299.4 210.21,-302.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.45,-305.14 218.91,-306.81 211.77,-298.98 208.45,-305.14"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="789.5,-213.37 703,-213.37 703,-194.12 789.5,-194.12 789.5,-213.37"/>
-<text text-anchor="middle" x="746.25" y="-199.87" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge11_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge11_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.76,-226.84C136.93,-239.42 167.08,-254.18 196,-260.74 285.85,-281.12 593.65,-260.85 667,-241.74 685.46,-236.94 704.76,-227.62 719.57,-219.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="721.25,-222.49 728.18,-214.47 717.76,-216.42 721.25,-222.49"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><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="336.5,-251.62 196,-251.62 196,-209.87 336.5,-209.87 336.5,-251.62"/>
-<text text-anchor="start" x="204" y="-238.12" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="204" y="-226.87" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="266.25" y="-215.62" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::naive_multiplication</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.48,-216.53C168.42,-217.61 176.49,-218.7 184.45,-219.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.72,-223.21 194.1,-221.09 184.66,-216.28 183.72,-223.21"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><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="664.75,-99.62 537.75,-99.62 537.75,-57.87 664.75,-57.87 664.75,-99.62"/>
-<text text-anchor="start" x="545.75" y="-86.12" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="545.75" y="-74.87" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="601.25" y="-63.62" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge10_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge10_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.27,-184.56C182.62,-159.25 282.42,-117.8 372.5,-97.74 423.09,-86.48 481.35,-81.77 526.28,-79.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="526.33,-83.35 536.19,-79.47 526.06,-76.35 526.33,-83.35"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><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="329.75,-50.62 202.75,-50.62 202.75,-8.87 329.75,-8.87 329.75,-50.62"/>
-<text text-anchor="start" x="210.75" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="210.75" y="-25.87" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="266.25" y="-14.62" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::slice</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge12_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge12_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.16,-184.52C113.49,-154.69 152.06,-100.08 196,-64.74 199.44,-61.97 203.14,-59.34 206.98,-56.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.66,-59.92 215.41,-51.75 205.04,-53.93 208.66,-59.92"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><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="499.5,-208.62 372.5,-208.62 372.5,-166.87 499.5,-166.87 499.5,-208.62"/>
-<text text-anchor="start" x="380.5" y="-195.12" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="380.5" y="-183.87" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="436" y="-172.62" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::v_stack</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge16_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge16_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.44,-201.7C220.36,-198.66 301.96,-194.51 360.6,-191.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="360.69,-195.03 370.5,-191.02 360.34,-188.04 360.69,-195.03"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="493.88,-365.37 378.12,-365.37 378.12,-346.12 493.88,-346.12 493.88,-365.37"/>
-<text text-anchor="middle" x="436" y="-351.87" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M330.19,-338.87C342.03,-340.78 354.46,-342.78 366.45,-344.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="365.87,-348.16 376.3,-346.3 366.98,-341.25 365.87,-348.16"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M329.98,-328.91C427.38,-328.22 609.74,-322.92 667,-293.74 697.62,-278.14 721.42,-244.95 734.38,-223.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="737.26,-225.53 739.24,-215.12 731.2,-222.03 737.26,-225.53"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge9_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge9_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M336.92,-233.93C416.95,-236.53 552.04,-237.67 667,-222.74 677.8,-221.34 689.28,-219.03 700.02,-216.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="700.55,-219.97 709.42,-214.17 698.87,-213.18 700.55,-219.97"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" target="_top" xlink:title="Constructor.">
-<polygon fill="white" stroke="#666666" points="499.5,-148.62 372.5,-148.62 372.5,-106.87 499.5,-106.87 499.5,-148.62"/>
-<text text-anchor="start" x="380.5" y="-135.12" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="380.5" y="-123.87" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="436" y="-112.62" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M295.04,-209.66C315.81,-194.35 345.21,-173.62 372.5,-157.74 374.41,-156.63 376.37,-155.52 378.36,-154.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.96,-157.54 387.15,-149.76 376.68,-151.36 379.96,-157.54"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="667,-137.37 535.5,-137.37 535.5,-118.12 667,-118.12 667,-137.37"/>
-<text text-anchor="middle" x="601.25" y="-123.87" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M499.65,-127.74C507.53,-127.74 515.67,-127.74 523.73,-127.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="523.55,-131.24 533.55,-127.74 523.55,-124.24 523.55,-131.24"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M499.65,-108.94C508.47,-106.29 517.61,-103.55 526.61,-100.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="527.48,-104.24 536.05,-98.01 525.46,-97.54 527.48,-104.24"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge8_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge8_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M654.04,-100.11C658.59,-102.76 662.98,-105.64 667,-108.74 694.92,-130.31 719.37,-163.58 733.22,-184.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="730.11,-186.12 738.47,-192.62 736,-182.32 730.11,-186.12"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node4 -->
-<g id="edge14_Node000009_Node000004" class="edge">
-<title>Node9&#45;&gt;Node4</title>
-<g id="a_edge14_Node000009_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M329.91,-14.66C413.93,1.83 564.41,17.8 667,-48.74 714.3,-79.42 734.25,-148.01 741.57,-182.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="738.1,-183.23 743.44,-192.38 744.97,-181.9 738.1,-183.23"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node6 -->
-<g id="edge13_Node000009_Node000006" class="edge">
-<title>Node9&#45;&gt;Node6</title>
-<g id="a_edge13_Node000009_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.65,-51.01C328.6,-65.58 361.91,-85.04 388.74,-100.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="386.96,-103.74 397.36,-105.76 390.5,-97.69 386.96,-103.74"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node4 -->
-<g id="edge20_Node000010_Node000004" class="edge">
-<title>Node10&#45;&gt;Node4</title>
-<g id="a_edge20_Node000010_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M499.71,-182.48C546.09,-179.67 610.7,-178.01 667,-184.74 677.92,-186.05 689.52,-188.35 700.35,-190.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="699.27,-194.24 709.82,-193.27 700.97,-187.45 699.27,-194.24"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node7 -->
-<g id="edge18_Node000010_Node000007" class="edge">
-<title>Node10&#45;&gt;Node7</title>
-<g id="a_edge18_Node000010_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M495.02,-166.42C517.44,-158.18 542.47,-148.98 562.49,-141.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="563.44,-145 571.62,-138.27 561.03,-138.43 563.44,-145"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node8 -->
-<g id="edge19_Node000010_Node000008" class="edge">
-<title>Node10&#45;&gt;Node8</title>
-<g id="a_edge19_Node000010_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M487.17,-166.47C491.52,-163.8 495.7,-160.89 499.5,-157.74 520.3,-140.49 514.58,-125.85 535.5,-108.74 536.46,-107.96 537.44,-107.19 538.45,-106.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="540.32,-109.39 546.68,-100.92 536.43,-103.58 540.32,-109.39"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="646,-213.37 556.5,-213.37 556.5,-194.12 646,-194.12 646,-213.37"/>
-<text text-anchor="middle" x="601.25" y="-199.87" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge17_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge17_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M499.65,-193.88C514.55,-195.34 530.34,-196.89 544.89,-198.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="544.45,-201.79 554.74,-199.28 545.13,-194.82 544.45,-201.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ab6534125643a02c114bd4cddba9bc17f_cgraph.map b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ab6534125643a02c114bd4cddba9bc17f_cgraph.map
deleted file mode 100644
index 71e0a3dac..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ab6534125643a02c114bd4cddba9bc17f_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="divide_and_conquer::strassens_multiplication::Matrix::h_stack" name="divide_and_conquer::strassens_multiplication::Matrix::h_stack">
-<area shape="rect" id="Node000001" title="Horizontally stack the matrix (one after the other)" alt="" coords="5,16,175,71"/>
-<area shape="rect" id="Node000002" 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="223,5,377,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="175,31,207,27,208,32,175,36"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="242,55,358,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="175,51,227,57,227,62,175,56"/>
-</map>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ab6534125643a02c114bd4cddba9bc17f_cgraph.md5 b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ab6534125643a02c114bd4cddba9bc17f_cgraph.md5
deleted file mode 100644
index 74c8b5b8e..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ab6534125643a02c114bd4cddba9bc17f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-16297cbdc23338e4fd78efabeee4e403
\ No newline at end of file
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ab6534125643a02c114bd4cddba9bc17f_cgraph.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ab6534125643a02c114bd4cddba9bc17f_cgraph.svg
deleted file mode 100644
index bd4c213a7..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ab6534125643a02c114bd4cddba9bc17f_cgraph.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::h_stack Pages: 1 -->
-<svg width="287pt" height="64pt"
- viewBox="0.00 0.00 286.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::h_stack</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Horizontally stack the matrix (one after the other)">
-<polygon fill="#999999" stroke="#666666" points="127,-48.5 0,-48.5 0,-6.75 127,-6.75 127,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::h_stack</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278.75,-56.25 163,-56.25 163,-37 278.75,-37 278.75,-56.25"/>
-<text text-anchor="middle" x="220.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.25,-35.3C135.26,-36.28 143.5,-37.29 151.59,-38.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.06,-41.74 161.41,-39.48 151.91,-34.79 151.06,-41.74"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.12,-19.25 177.62,-19.25 177.62,0 264.12,0 264.12,-19.25"/>
-<text text-anchor="middle" x="220.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.25,-20.36C140.15,-18.86 153.61,-17.3 166.16,-15.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.34,-19.35 175.87,-14.72 165.53,-12.4 166.34,-19.35"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ab6534125643a02c114bd4cddba9bc17f_cgraph_org.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ab6534125643a02c114bd4cddba9bc17f_cgraph_org.svg
deleted file mode 100644
index 5b1701af0..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ab6534125643a02c114bd4cddba9bc17f_cgraph_org.svg
+++ /dev/null
@@ -1,59 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::h_stack Pages: 1 -->
-<svg width="287pt" height="64pt"
- viewBox="0.00 0.00 286.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::h_stack</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Horizontally stack the matrix (one after the other)">
-<polygon fill="#999999" stroke="#666666" points="127,-48.5 0,-48.5 0,-6.75 127,-6.75 127,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::h_stack</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="278.75,-56.25 163,-56.25 163,-37 278.75,-37 278.75,-56.25"/>
-<text text-anchor="middle" x="220.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.25,-35.3C135.26,-36.28 143.5,-37.29 151.59,-38.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.06,-41.74 161.41,-39.48 151.91,-34.79 151.06,-41.74"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.12,-19.25 177.62,-19.25 177.62,0 264.12,0 264.12,-19.25"/>
-<text text-anchor="middle" x="220.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.25,-20.36C140.15,-18.86 153.61,-17.3 166.16,-15.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.34,-19.35 175.87,-14.72 165.53,-12.4 166.34,-19.35"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ad36ec1f1a97298e49de605384e5f8211_cgraph.map b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ad36ec1f1a97298e49de605384e5f8211_cgraph.map
deleted file mode 100644
index 46f620f3e..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ad36ec1f1a97298e49de605384e5f8211_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="divide_and_conquer::strassens_multiplication::Matrix::operator+" name="divide_and_conquer::strassens_multiplication::Matrix::operator+">
-<area shape="rect" id="Node000001" title="Add two matrices and returns a new matrix." alt="" coords="5,71,175,126"/>
-<area shape="rect" id="Node000002" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" title="Constructor." alt="" coords="223,5,392,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="174,71,207,60,209,66,176,76"/>
-<area shape="rect" id="Node000004" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" title="Get the matrix shape." alt="" coords="443,63,612,118"/>
-<area shape="poly" id="edge5_Node000001_Node000004" title=" " alt="" coords="175,94,427,90,427,95,175,100"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="663,111,779,137"/>
-<area shape="poly" id="edge6_Node000001_Node000005" title=" " alt="" coords="175,106,300,118,440,128,528,130,615,128,648,126,648,132,615,133,528,135,440,133,300,123,175,111"/>
-<area shape="rect" id="Node000003" 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="440,12,615,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="392,27,424,26,424,32,392,33"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="393,53,429,62,427,67,392,58"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="613,102,649,109,648,114,612,108"/>
-</map>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ad36ec1f1a97298e49de605384e5f8211_cgraph.md5 b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ad36ec1f1a97298e49de605384e5f8211_cgraph.md5
deleted file mode 100644
index c075c6fdf..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ad36ec1f1a97298e49de605384e5f8211_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b2658242ff5225fc688d8e0fc30ec5a4
\ No newline at end of file
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ad36ec1f1a97298e49de605384e5f8211_cgraph.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ad36ec1f1a97298e49de605384e5f8211_cgraph.svg
deleted file mode 100644
index e001dfe5b..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ad36ec1f1a97298e49de605384e5f8211_cgraph.svg
+++ /dev/null
@@ -1,200 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator+ Pages: 1 -->
-<!--zoomable 107 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 588;
-var viewHeight = 107;
-var sectionId = 'dynsection-8';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>divide_and_conquer::strassens_multiplication::Matrix::operator+</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Add two matrices and returns a new matrix.">
-<polygon fill="#999999" stroke="#666666" points="127,-49.5 0,-49.5 0,-7.75 127,-7.75 127,-49.5"/>
-<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="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-13.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator+</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" target="_top" xlink:title="Constructor.">
-<polygon fill="white" stroke="#666666" points="290,-98.5 163,-98.5 163,-56.75 290,-56.75 290,-98.5"/>
-<text text-anchor="start" x="171" y="-85" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="171" y="-73.75" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="226.5" y="-62.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.21,-47.71C135.31,-50.18 143.67,-52.72 151.93,-55.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.66,-58.51 161.25,-58.07 152.7,-51.81 150.66,-58.51"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><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="455.25,-55.5 328.25,-55.5 328.25,-13.75 455.25,-13.75 455.25,-55.5"/>
-<text text-anchor="start" x="336.25" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="336.25" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="391.75" y="-19.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.4,-29.78C181.37,-30.77 259.22,-32.21 316.28,-33.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.19,-36.75 326.25,-33.44 316.31,-29.76 316.19,-36.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="580,-19.25 493.5,-19.25 493.5,0 580,0 580,-19.25"/>
-<text text-anchor="middle" x="536.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.27,-21.24C180.17,-15.4 257.91,-7.74 326,-4.62 384.38,-1.95 399.09,-2.76 457.5,-4.62 465.36,-4.88 473.66,-5.27 481.8,-5.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.43,-9.21 491.62,-6.32 481.85,-2.22 481.43,-9.21"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="457.5,-93.25 326,-93.25 326,-74 457.5,-74 457.5,-93.25"/>
-<text text-anchor="middle" x="391.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.15,-79.93C298.03,-80.22 306.17,-80.52 314.23,-80.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.93,-84.3 324.05,-81.17 314.18,-77.31 313.93,-84.3"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.15,-61.12C298.97,-58.8 308.11,-56.39 317.11,-54.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.76,-57.47 326.53,-51.54 315.97,-50.7 317.76,-57.47"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M455.47,-23.66C464.34,-22.11 473.4,-20.53 482.07,-19.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="482.48,-22.49 491.73,-17.32 481.28,-15.6 482.48,-22.49"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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_ad36ec1f1a97298e49de605384e5f8211_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ad36ec1f1a97298e49de605384e5f8211_cgraph_org.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ad36ec1f1a97298e49de605384e5f8211_cgraph_org.svg
deleted file mode 100644
index 03214484b..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ad36ec1f1a97298e49de605384e5f8211_cgraph_org.svg
+++ /dev/null
@@ -1,117 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator+ Pages: 1 -->
-<svg width="588pt" height="107pt"
- viewBox="0.00 0.00 588.00 106.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 102.5)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::operator+</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Add two matrices and returns a new matrix.">
-<polygon fill="#999999" stroke="#666666" points="127,-49.5 0,-49.5 0,-7.75 127,-7.75 127,-49.5"/>
-<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="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-13.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator+</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" target="_top" xlink:title="Constructor.">
-<polygon fill="white" stroke="#666666" points="290,-98.5 163,-98.5 163,-56.75 290,-56.75 290,-98.5"/>
-<text text-anchor="start" x="171" y="-85" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="171" y="-73.75" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="226.5" y="-62.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.21,-47.71C135.31,-50.18 143.67,-52.72 151.93,-55.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.66,-58.51 161.25,-58.07 152.7,-51.81 150.66,-58.51"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><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="455.25,-55.5 328.25,-55.5 328.25,-13.75 455.25,-13.75 455.25,-55.5"/>
-<text text-anchor="start" x="336.25" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="336.25" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="391.75" y="-19.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.4,-29.78C181.37,-30.77 259.22,-32.21 316.28,-33.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.19,-36.75 326.25,-33.44 316.31,-29.76 316.19,-36.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="580,-19.25 493.5,-19.25 493.5,0 580,0 580,-19.25"/>
-<text text-anchor="middle" x="536.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.27,-21.24C180.17,-15.4 257.91,-7.74 326,-4.62 384.38,-1.95 399.09,-2.76 457.5,-4.62 465.36,-4.88 473.66,-5.27 481.8,-5.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.43,-9.21 491.62,-6.32 481.85,-2.22 481.43,-9.21"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="457.5,-93.25 326,-93.25 326,-74 457.5,-74 457.5,-93.25"/>
-<text text-anchor="middle" x="391.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.15,-79.93C298.03,-80.22 306.17,-80.52 314.23,-80.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.93,-84.3 324.05,-81.17 314.18,-77.31 313.93,-84.3"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.15,-61.12C298.97,-58.8 308.11,-56.39 317.11,-54.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.76,-57.47 326.53,-51.54 315.97,-50.7 317.76,-57.47"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M455.47,-23.66C464.34,-22.11 473.4,-20.53 482.07,-19.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="482.48,-22.49 491.73,-17.32 481.28,-15.6 482.48,-22.49"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae190115f8d4d31e47d7290e0b6871391_cgraph.map b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae190115f8d4d31e47d7290e0b6871391_cgraph.map
deleted file mode 100644
index c58ca02ac..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae190115f8d4d31e47d7290e0b6871391_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="divide_and_conquer::strassens_multiplication::Matrix::operator+=" name="divide_and_conquer::strassens_multiplication::Matrix::operator+=">
-<area shape="rect" id="Node000001" title="Add another matrices to current matrix." alt="" coords="5,39,175,94"/>
-<area shape="rect" id="Node000002" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" title="Get the matrix shape." alt="" coords="223,5,392,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="175,51,207,46,208,51,175,56"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="440,54,555,79"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="175,69,223,71,392,71,424,69,425,74,392,76,223,76,175,74"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="393,45,425,51,424,56,392,51"/>
-</map>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae190115f8d4d31e47d7290e0b6871391_cgraph.md5 b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae190115f8d4d31e47d7290e0b6871391_cgraph.md5
deleted file mode 100644
index 934501a58..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae190115f8d4d31e47d7290e0b6871391_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-30de88b6e08e77819ba87aa02950623f
\ No newline at end of file
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae190115f8d4d31e47d7290e0b6871391_cgraph.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae190115f8d4d31e47d7290e0b6871391_cgraph.svg
deleted file mode 100644
index 7ef7c6835..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae190115f8d4d31e47d7290e0b6871391_cgraph.svg
+++ /dev/null
@@ -1,96 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator+= Pages: 1 -->
-<svg width="421pt" height="75pt"
- viewBox="0.00 0.00 420.50 74.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 70.75)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::operator+=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Add another matrices to current matrix.">
-<polygon fill="#999999" stroke="#666666" points="127,-41.75 0,-41.75 0,0 127,0 127,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator+=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><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="290,-66.75 163,-66.75 163,-25 290,-25 290,-66.75"/>
-<text text-anchor="start" x="171" y="-53.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="171" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="226.5" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.21,-30.61C135.13,-31.84 143.29,-33.11 151.37,-34.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.78,-37.82 161.2,-35.89 151.86,-30.9 150.78,-37.82"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="412.5,-30.5 326,-30.5 326,-11.25 412.5,-11.25 412.5,-30.5"/>
-<text text-anchor="middle" x="369.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.27,-17.21C139.14,-16.65 151.45,-16.17 163,-15.88 219.43,-14.44 233.58,-14.07 290,-15.88 297.86,-16.13 306.16,-16.52 314.3,-16.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.93,-20.46 324.12,-17.57 314.35,-13.47 313.93,-20.46"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.46,-34.69C298.43,-33.28 306.53,-31.84 314.33,-30.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.8,-33.92 324.03,-28.73 313.57,-27.03 314.8,-33.92"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae190115f8d4d31e47d7290e0b6871391_cgraph_org.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae190115f8d4d31e47d7290e0b6871391_cgraph_org.svg
deleted file mode 100644
index 7b40c458a..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae190115f8d4d31e47d7290e0b6871391_cgraph_org.svg
+++ /dev/null
@@ -1,70 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator+= Pages: 1 -->
-<svg width="421pt" height="75pt"
- viewBox="0.00 0.00 420.50 74.75" 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.75)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::operator+=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Add another matrices to current matrix.">
-<polygon fill="#999999" stroke="#666666" points="127,-41.75 0,-41.75 0,0 127,0 127,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator+=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><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="290,-66.75 163,-66.75 163,-25 290,-25 290,-66.75"/>
-<text text-anchor="start" x="171" y="-53.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="171" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="226.5" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.21,-30.61C135.13,-31.84 143.29,-33.11 151.37,-34.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.78,-37.82 161.2,-35.89 151.86,-30.9 150.78,-37.82"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="412.5,-30.5 326,-30.5 326,-11.25 412.5,-11.25 412.5,-30.5"/>
-<text text-anchor="middle" x="369.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.27,-17.21C139.14,-16.65 151.45,-16.17 163,-15.88 219.43,-14.44 233.58,-14.07 290,-15.88 297.86,-16.13 306.16,-16.52 314.3,-16.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.93,-20.46 324.12,-17.57 314.35,-13.47 313.93,-20.46"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.46,-34.69C298.43,-33.28 306.53,-31.84 314.33,-30.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="314.8,-33.92 324.03,-28.73 313.57,-27.03 314.8,-33.92"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae4e183ec8eab778cb243e4ae0b22a0f1_cgraph.map b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae4e183ec8eab778cb243e4ae0b22a0f1_cgraph.map
deleted file mode 100644
index 8bf2a70f9..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae4e183ec8eab778cb243e4ae0b22a0f1_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="divide_and_conquer::strassens_multiplication::Matrix::size" name="divide_and_conquer::strassens_multiplication::Matrix::size">
-<area shape="rect" id="Node000001" title="Get the matrix shape." alt="" coords="5,5,175,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="223,20,338,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="175,30,207,30,207,36,175,36"/>
-</map>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae4e183ec8eab778cb243e4ae0b22a0f1_cgraph.md5 b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae4e183ec8eab778cb243e4ae0b22a0f1_cgraph.md5
deleted file mode 100644
index fca17491b..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae4e183ec8eab778cb243e4ae0b22a0f1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-51a825bc533130d63fae5e558c31e3f9
\ No newline at end of file
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae4e183ec8eab778cb243e4ae0b22a0f1_cgraph.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae4e183ec8eab778cb243e4ae0b22a0f1_cgraph.svg
deleted file mode 100644
index bb99ca9ae..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae4e183ec8eab778cb243e4ae0b22a0f1_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::size Pages: 1 -->
-<svg width="258pt" height="50pt"
- viewBox="0.00 0.00 257.50 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::size</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get the matrix shape.">
-<polygon fill="#999999" stroke="#666666" points="127,-41.75 0,-41.75 0,0 127,0 127,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-30.5 163,-30.5 163,-11.25 249.5,-11.25 249.5,-30.5"/>
-<text text-anchor="middle" x="206.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.46,-20.88C135.34,-20.88 143.34,-20.88 151.06,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.01,-24.38 161.01,-20.88 151.01,-17.38 151.01,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae4e183ec8eab778cb243e4ae0b22a0f1_cgraph_org.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae4e183ec8eab778cb243e4ae0b22a0f1_cgraph_org.svg
deleted file mode 100644
index b6ecfee54..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_ae4e183ec8eab778cb243e4ae0b22a0f1_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::size Pages: 1 -->
-<svg width="258pt" height="50pt"
- viewBox="0.00 0.00 257.50 49.75" 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.75)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::size</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Get the matrix shape.">
-<polygon fill="#999999" stroke="#666666" points="127,-41.75 0,-41.75 0,0 127,0 127,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-30.5 163,-30.5 163,-11.25 249.5,-11.25 249.5,-30.5"/>
-<text text-anchor="middle" x="206.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.46,-20.88C135.34,-20.88 143.34,-20.88 151.06,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.01,-24.38 161.01,-20.88 151.01,-17.38 151.01,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_aedbe01e48a96fefa0b393ec577b0f19e_cgraph.map b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_aedbe01e48a96fefa0b393ec577b0f19e_cgraph.map
deleted file mode 100644
index 843ed44ed..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_aedbe01e48a96fefa0b393ec577b0f19e_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="divide_and_conquer::strassens_multiplication::Matrix::operator*" name="divide_and_conquer::strassens_multiplication::Matrix::operator*">
-<area shape="rect" id="Node000001" title="Multiply matrix with a number and returns a new matrix." alt="" coords="5,89,175,145"/>
-<area shape="rect" id="Node000002" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" title="Constructor." alt="" coords="223,56,392,111"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="175,101,207,96,208,101,175,106"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="663,104,779,130"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="175,119,223,121,419,125,615,121,648,119,648,125,615,126,419,130,223,126,175,124"/>
-<area shape="rect" id="Node000003" 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="440,5,615,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="392,55,439,41,465,33,467,38,441,46,393,60"/>
-<area shape="rect" id="Node000004" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" title="Get the matrix shape." alt="" coords="443,56,612,111"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="392,81,427,81,427,86,392,86"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="613,95,649,102,648,107,612,101"/>
-</map>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_aedbe01e48a96fefa0b393ec577b0f19e_cgraph.md5 b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_aedbe01e48a96fefa0b393ec577b0f19e_cgraph.md5
deleted file mode 100644
index 5c9b83eaa..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_aedbe01e48a96fefa0b393ec577b0f19e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7d1271ad80e8b97c9d3f0ad517afc336
\ No newline at end of file
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_aedbe01e48a96fefa0b393ec577b0f19e_cgraph.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_aedbe01e48a96fefa0b393ec577b0f19e_cgraph.svg
deleted file mode 100644
index c8fd1551e..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_aedbe01e48a96fefa0b393ec577b0f19e_cgraph.svg
+++ /dev/null
@@ -1,191 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator* Pages: 1 -->
-<!--zoomable 113 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 588;
-var viewHeight = 113;
-var sectionId = 'dynsection-6';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>divide_and_conquer::strassens_multiplication::Matrix::operator*</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Multiply matrix with a number and returns a new matrix.">
-<polygon fill="#999999" stroke="#666666" points="127,-41.75 0,-41.75 0,0 127,0 127,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator*</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" target="_top" xlink:title="Constructor.">
-<polygon fill="white" stroke="#666666" points="290,-66.75 163,-66.75 163,-25 290,-25 290,-66.75"/>
-<text text-anchor="start" x="171" y="-53.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="171" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="226.5" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.21,-30.61C135.13,-31.84 143.29,-33.11 151.37,-34.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.78,-37.82 161.2,-35.89 151.86,-30.9 150.78,-37.82"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="580,-30.5 493.5,-30.5 493.5,-11.25 580,-11.25 580,-30.5"/>
-<text text-anchor="middle" x="536.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.27,-17.21C139.14,-16.65 151.45,-16.17 163,-15.88 293.85,-12.56 326.68,-11.7 457.5,-15.88 465.36,-16.13 473.66,-16.52 481.8,-16.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.43,-20.46 491.62,-17.57 481.85,-13.47 481.43,-20.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="457.5,-104.5 326,-104.5 326,-85.25 457.5,-85.25 457.5,-104.5"/>
-<text text-anchor="middle" x="391.75" y="-91" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.26,-65.1C302.13,-68.7 314.44,-72.42 326,-75.88 332.26,-77.75 338.86,-79.7 345.36,-81.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.09,-84.89 354.67,-84.36 346.06,-78.18 344.09,-84.89"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><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="455.25,-66.75 328.25,-66.75 328.25,-25 455.25,-25 455.25,-66.75"/>
-<text text-anchor="start" x="336.25" y="-53.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="336.25" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="391.75" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.15,-45.88C298.78,-45.88 307.7,-45.88 316.52,-45.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.48,-49.38 326.48,-45.88 316.48,-42.38 316.48,-49.38"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M455.47,-34.91C464.34,-33.36 473.4,-31.78 482.07,-30.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="482.48,-33.74 491.73,-28.57 481.28,-26.85 482.48,-33.74"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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_aedbe01e48a96fefa0b393ec577b0f19e_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_aedbe01e48a96fefa0b393ec577b0f19e_cgraph_org.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_aedbe01e48a96fefa0b393ec577b0f19e_cgraph_org.svg
deleted file mode 100644
index 57f071b3e..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_aedbe01e48a96fefa0b393ec577b0f19e_cgraph_org.svg
+++ /dev/null
@@ -1,108 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator* Pages: 1 -->
-<svg width="588pt" height="113pt"
- viewBox="0.00 0.00 588.00 112.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 108.5)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::operator*</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Multiply matrix with a number and returns a new matrix.">
-<polygon fill="#999999" stroke="#666666" points="127,-41.75 0,-41.75 0,0 127,0 127,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator*</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256" target="_top" xlink:title="Constructor.">
-<polygon fill="white" stroke="#666666" points="290,-66.75 163,-66.75 163,-25 290,-25 290,-66.75"/>
-<text text-anchor="start" x="171" y="-53.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="171" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="226.5" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::Matrix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.21,-30.61C135.13,-31.84 143.29,-33.11 151.37,-34.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.78,-37.82 161.2,-35.89 151.86,-30.9 150.78,-37.82"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="580,-30.5 493.5,-30.5 493.5,-11.25 580,-11.25 580,-30.5"/>
-<text text-anchor="middle" x="536.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.27,-17.21C139.14,-16.65 151.45,-16.17 163,-15.88 293.85,-12.56 326.68,-11.7 457.5,-15.88 465.36,-16.13 473.66,-16.52 481.8,-16.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.43,-20.46 491.62,-17.57 481.85,-13.47 481.43,-20.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="457.5,-104.5 326,-104.5 326,-85.25 457.5,-85.25 457.5,-104.5"/>
-<text text-anchor="middle" x="391.75" y="-91" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.26,-65.1C302.13,-68.7 314.44,-72.42 326,-75.88 332.26,-77.75 338.86,-79.7 345.36,-81.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.09,-84.89 354.67,-84.36 346.06,-78.18 344.09,-84.89"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><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="455.25,-66.75 328.25,-66.75 328.25,-25 455.25,-25 455.25,-66.75"/>
-<text text-anchor="start" x="336.25" y="-53.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="336.25" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="391.75" y="-30.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.15,-45.88C298.78,-45.88 307.7,-45.88 316.52,-45.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.48,-49.38 326.48,-45.88 316.48,-42.38 316.48,-49.38"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M455.47,-34.91C464.34,-33.36 473.4,-31.78 482.07,-30.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="482.48,-33.74 491.73,-28.57 481.28,-26.85 482.48,-33.74"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af09566a6a59d30875434c140e18e0a12_cgraph.map b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af09566a6a59d30875434c140e18e0a12_cgraph.map
deleted file mode 100644
index a8e5680f0..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af09566a6a59d30875434c140e18e0a12_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="divide_and_conquer::strassens_multiplication::Matrix::operator*=" name="divide_and_conquer::strassens_multiplication::Matrix::operator*=">
-<area shape="rect" id="Node000001" title="Multiply a number to current matrix." alt="" coords="5,5,175,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="223,20,338,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="175,30,207,30,207,36,175,36"/>
-</map>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af09566a6a59d30875434c140e18e0a12_cgraph.md5 b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af09566a6a59d30875434c140e18e0a12_cgraph.md5
deleted file mode 100644
index 615d853c9..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af09566a6a59d30875434c140e18e0a12_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-66e89f41c71306a7f6df61c9f42774a5
\ No newline at end of file
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af09566a6a59d30875434c140e18e0a12_cgraph.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af09566a6a59d30875434c140e18e0a12_cgraph.svg
deleted file mode 100644
index 8efcbd672..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af09566a6a59d30875434c140e18e0a12_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator*= Pages: 1 -->
-<svg width="258pt" height="50pt"
- viewBox="0.00 0.00 257.50 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::operator*=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Multiply a number to current matrix.">
-<polygon fill="#999999" stroke="#666666" points="127,-41.75 0,-41.75 0,0 127,0 127,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator*=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-30.5 163,-30.5 163,-11.25 249.5,-11.25 249.5,-30.5"/>
-<text text-anchor="middle" x="206.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.46,-20.88C135.34,-20.88 143.34,-20.88 151.06,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.01,-24.38 161.01,-20.88 151.01,-17.38 151.01,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af09566a6a59d30875434c140e18e0a12_cgraph_org.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af09566a6a59d30875434c140e18e0a12_cgraph_org.svg
deleted file mode 100644
index 61c6f3956..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af09566a6a59d30875434c140e18e0a12_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::operator*= Pages: 1 -->
-<svg width="258pt" height="50pt"
- viewBox="0.00 0.00 257.50 49.75" 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.75)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::operator*=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Multiply a number to current matrix.">
-<polygon fill="#999999" stroke="#666666" points="127,-41.75 0,-41.75 0,0 127,0 127,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::operator*=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-30.5 163,-30.5 163,-11.25 249.5,-11.25 249.5,-30.5"/>
-<text text-anchor="middle" x="206.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.46,-20.88C135.34,-20.88 143.34,-20.88 151.06,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.01,-24.38 161.01,-20.88 151.01,-17.38 151.01,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af12ceffdc07cc87eca8a4a8ac87d60fe_cgraph.map b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af12ceffdc07cc87eca8a4a8ac87d60fe_cgraph.map
deleted file mode 100644
index efa78f87f..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af12ceffdc07cc87eca8a4a8ac87d60fe_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="divide_and_conquer::strassens_multiplication::Matrix::v_stack" name="divide_and_conquer::strassens_multiplication::Matrix::v_stack">
-<area shape="rect" id="Node000001" title="Horizontally stack the matrix (current matrix above the other)" alt="" coords="5,73,175,129"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/back.html#" title=" " alt="" coords="251,5,370,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="149,70,222,40,240,33,242,39,224,45,151,75"/>
-<area shape="rect" id="Node000003" 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="223,55,398,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="174,85,207,80,207,86,175,91"/>
-<area shape="rect" id="Node000004" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1" title="Get the matrix shape." alt="" coords="226,105,395,161"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="175,110,211,116,210,121,174,116"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="446,153,561,179"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="132,127,175,152,223,170,276,180,331,182,430,176,431,181,331,188,276,185,222,175,172,156,129,131"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="396,145,431,151,430,156,395,150"/>
-</map>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af12ceffdc07cc87eca8a4a8ac87d60fe_cgraph.md5 b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af12ceffdc07cc87eca8a4a8ac87d60fe_cgraph.md5
deleted file mode 100644
index a37533a45..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af12ceffdc07cc87eca8a4a8ac87d60fe_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-21b8910f84b4ab224f58a7b9e96dbcac
\ No newline at end of file
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af12ceffdc07cc87eca8a4a8ac87d60fe_cgraph.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af12ceffdc07cc87eca8a4a8ac87d60fe_cgraph.svg
deleted file mode 100644
index 4b9d6e9d0..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af12ceffdc07cc87eca8a4a8ac87d60fe_cgraph.svg
+++ /dev/null
@@ -1,132 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::v_stack Pages: 1 -->
-<svg width="425pt" height="143pt"
- viewBox="0.00 0.00 425.00 142.84" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138.84)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::v_stack</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Horizontally stack the matrix (current matrix above the other)">
-<polygon fill="#999999" stroke="#666666" points="127,-84.09 0,-84.09 0,-42.34 127,-42.34 127,-84.09"/>
-<text text-anchor="start" x="8" y="-70.59" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-59.34" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-48.09" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::v_stack</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273.5,-134.84 184,-134.84 184,-115.59 273.5,-115.59 273.5,-134.84"/>
-<text text-anchor="middle" x="228.75" y="-121.34" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.55,-84.57C125.36,-92.28 144.85,-100.67 163,-107.21 167.45,-108.81 172.11,-110.36 176.8,-111.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.7,-115.15 186.28,-114.66 177.71,-108.44 175.7,-115.15"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294.5,-97.84 163,-97.84 163,-78.59 294.5,-78.59 294.5,-97.84"/>
-<text text-anchor="middle" x="228.75" y="-84.34" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.15,-72.8C135.03,-74.01 143.17,-75.26 151.23,-76.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.65,-79.94 161.07,-78 151.71,-73.02 150.65,-79.94"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><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.25,-60.09 165.25,-60.09 165.25,-18.34 292.25,-18.34 292.25,-60.09"/>
-<text text-anchor="start" x="173.25" y="-46.59" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="173.25" y="-35.34" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="228.75" y="-24.09" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.15,-54C135.87,-52.72 144.91,-51.39 153.81,-50.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.12,-53.57 163.5,-48.66 153.1,-46.65 154.12,-53.57"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="417,-23.84 330.5,-23.84 330.5,-4.59 417,-4.59 417,-23.84"/>
-<text text-anchor="middle" x="373.75" y="-10.34" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.89,-41.97C112.65,-29.75 138.06,-15.6 163,-9.21 214.72,4.04 275.97,0.48 318.88,-4.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.32,-8.44 328.7,-6.32 319.27,-1.51 318.32,-8.44"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.47,-28.24C301.34,-26.69 310.4,-25.11 319.07,-23.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="319.48,-27.08 328.73,-21.91 318.28,-20.18 319.48,-27.08"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af12ceffdc07cc87eca8a4a8ac87d60fe_cgraph_org.svg b/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af12ceffdc07cc87eca8a4a8ac87d60fe_cgraph_org.svg
deleted file mode 100644
index 498c75a55..000000000
--- a/dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix_af12ceffdc07cc87eca8a4a8ac87d60fe_cgraph_org.svg
+++ /dev/null
@@ -1,106 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: divide_and_conquer::strassens_multiplication::Matrix::v_stack Pages: 1 -->
-<svg width="425pt" height="143pt"
- viewBox="0.00 0.00 425.00 142.84" 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 138.84)">
-<title>divide_and_conquer::strassens_multiplication::Matrix::v_stack</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Horizontally stack the matrix (current matrix above the other)">
-<polygon fill="#999999" stroke="#666666" points="127,-84.09 0,-84.09 0,-42.34 127,-42.34 127,-84.09"/>
-<text text-anchor="start" x="8" y="-70.59" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="8" y="-59.34" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="63.5" y="-48.09" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::v_stack</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273.5,-134.84 184,-134.84 184,-115.59 273.5,-115.59 273.5,-134.84"/>
-<text text-anchor="middle" x="228.75" y="-121.34" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.55,-84.57C125.36,-92.28 144.85,-100.67 163,-107.21 167.45,-108.81 172.11,-110.36 176.8,-111.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.7,-115.15 186.28,-114.66 177.71,-108.44 175.7,-115.15"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294.5,-97.84 163,-97.84 163,-78.59 294.5,-78.59 294.5,-97.84"/>
-<text text-anchor="middle" x="228.75" y="-84.34" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.15,-72.8C135.03,-74.01 143.17,-75.26 151.23,-76.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.65,-79.94 161.07,-78 151.71,-73.02 150.65,-79.94"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><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.25,-60.09 165.25,-60.09 165.25,-18.34 292.25,-18.34 292.25,-60.09"/>
-<text text-anchor="start" x="173.25" y="-46.59" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
-<text text-anchor="start" x="173.25" y="-35.34" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
-<text text-anchor="middle" x="228.75" y="-24.09" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.15,-54C135.87,-52.72 144.91,-51.39 153.81,-50.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.12,-53.57 163.5,-48.66 153.1,-46.65 154.12,-53.57"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="417,-23.84 330.5,-23.84 330.5,-4.59 417,-4.59 417,-23.84"/>
-<text text-anchor="middle" x="373.75" y="-10.34" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.89,-41.97C112.65,-29.75 138.06,-15.6 163,-9.21 214.72,4.04 275.97,0.48 318.88,-4.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.32,-8.44 328.7,-6.32 319.27,-1.51 318.32,-8.44"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M292.47,-28.24C301.34,-26.69 310.4,-25.11 319.07,-23.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="319.48,-27.08 328.73,-21.91 318.28,-20.18 319.48,-27.08"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d14/wildcard__matching_8cpp.html b/dc/d14/wildcard__matching_8cpp.html
index a66509009..96ba07cdf 100644
--- a/dc/d14/wildcard__matching_8cpp.html
+++ b/dc/d14/wildcard__matching_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: backtracking/wildcard_matching.cpp File Reference</title>
+<title>TheAlgorithms/C++: backtracking/wildcard_matching.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -106,8 +123,7 @@ $(function(){initNavTree('dc/d14/wildcard__matching_8cpp.html','../../'); initRe
 <div class="header">
   <div class="summary">
 <a href="#namespaces">Namespaces</a> &#124;
-<a href="#func-members">Functions</a> &#124;
-<a href="#var-members">Variables</a>  </div>
+<a href="#func-members">Functions</a>  </div>
   <div class="headertitle"><div class="title">wildcard_matching.cpp File Reference</div></div>
 </div><!--header-->
 <div class="contents">
@@ -123,7 +139,9 @@ Include dependency graph for wildcard_matching.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d92/wildcard__matching_8cpp__incl.svg" width="336" height="126"><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">
+</div>
+<p><a href="../../dc/d14/wildcard__matching_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html">backtracking</a></td></tr>
@@ -135,7 +153,10 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a182d0f016b34e40f86be8d6df05dc9ac" id="r_a182d0f016b34e40f86be8d6df05dc9ac"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a182d0f016b34e40f86be8d6df05dc9ac">backtracking::wildcard_matching::wildcard_matching</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> p, uint32_t pos1, uint32_t pos2)</td></tr>
+<tr class="memitem:a1f8c260cf0d7e22c666b85f1f71ee4a7" id="r_a1f8c260cf0d7e22c666b85f1f71ee4a7"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; int64_t &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1f8c260cf0d7e22c666b85f1f71ee4a7">backtracking::wildcard_matching::dpTable</a> (1000, std::vector&lt; int64_t &gt;(1000, -1))</td></tr>
+<tr class="memdesc:a1f8c260cf0d7e22c666b85f1f71ee4a7"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function implements if pattern can be matched with given string.  <br /></td></tr>
+<tr class="separator:a1f8c260cf0d7e22c666b85f1f71ee4a7"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a182d0f016b34e40f86be8d6df05dc9ac" id="r_a182d0f016b34e40f86be8d6df05dc9ac"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a182d0f016b34e40f86be8d6df05dc9ac">backtracking::wildcard_matching::wildcard_matching</a> (std::string s, std::string p, uint32_t pos1, uint32_t pos2)</td></tr>
 <tr class="separator:a182d0f016b34e40f86be8d6df05dc9ac"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
 <tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations.  <br /></td></tr>
@@ -143,17 +164,46 @@ Functions</h2></td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
 <tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function.  <br /></td></tr>
 <tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
-</table><table class="memberdecls">
-<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
-Variables</h2></td></tr>
-<tr class="memitem:a4a5b107f93db24e424b12899fa692c5a" id="r_a4a5b107f93db24e424b12899fa692c5a"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4a5b107f93db24e424b12899fa692c5a">backtracking::wildcard_matching::dpTable</a> (1000, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;(1000, -1))</td></tr>
-<tr class="memdesc:a4a5b107f93db24e424b12899fa692c5a"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function implements if pattern can be matched with given string.  <br /></td></tr>
-<tr class="separator:a4a5b107f93db24e424b12899fa692c5a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of the <a href="https://www.geeksforgeeks.org/wildcard-pattern-matching/" target="_blank">Wildcard Matching</a> problem. </p>
 <p>Given a matching string and a pattern, implement wildcard pattern matching with support for <code>?</code> and <code>*</code>. <code>?</code> matches any single character. <code>*</code> matches any sequence of characters (including the empty sequence). The matching should cover the entire matching string (not partial). The task is to determine if the pattern matches with the matching string </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Swastyy" target="_blank">Swastika Gupta</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../dc/d14/wildcard__matching_8cpp_source.html">wildcard_matching.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
+<a id="a1f8c260cf0d7e22c666b85f1f71ee4a7" name="a1f8c260cf0d7e22c666b85f1f71ee4a7"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a1f8c260cf0d7e22c666b85f1f71ee4a7">&#9670;&#160;</a></span>dpTable()</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt; std::vector&lt; int64_t &gt; &gt; backtracking::wildcard_matching::dpTable </td>
+          <td>(</td>
+          <td class="paramtype">1000</td>          <td class="paramname"><span class="paramname"><em></em></span>, </td>
+        </tr>
+        <tr>
+          <td class="paramkey"></td>
+          <td></td>
+          <td class="paramtype">std::vector&lt; int64_t &gt;</td>          <td class="paramname"><span class="paramname"><em></em></span>1000, -1&#160;)</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>The main function implements if pattern can be matched with given string. </p>
+<dl class="params"><dt>Parameters</dt><dd>
+  <table class="params">
+    <tr><td class="paramname">s</td><td>is the given matching string </td></tr>
+    <tr><td class="paramname">p</td><td>is the given pattern </td></tr>
+    <tr><td class="paramname">pos1</td><td>is the starting index </td></tr>
+    <tr><td class="paramname">pos2</td><td>is the last index </td></tr>
+  </table>
+  </dd>
+</dl>
+<dl class="section return"><dt>Returns</dt><dd>1 if pattern matches with matching string otherwise 0 </dd></dl>
+
+</div>
+</div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
 
@@ -171,17 +221,14 @@ Variables</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d14/wildcard__matching_8cpp_source.html#l00153">153</a> of file <a class="el" href="../../dc/d14/wildcard__matching_8cpp_source.html">wildcard_matching.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  153</span>           {</div>
 <div class="line"><span class="lineno">  154</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  155</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  156</span>}</div>
-<div class="ttc" id="awildcard__matching_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> wildcard_matching.cpp:102</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="awildcard__matching_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d14/wildcard__matching_8cpp_source.html#l00102">wildcard_matching.cpp:102</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -209,61 +256,55 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d14/wildcard__matching_8cpp_source.html#l00102">102</a> of file <a class="el" href="../../dc/d14/wildcard__matching_8cpp_source.html">wildcard_matching.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  102</span>                   {</div>
 <div class="line"><span class="lineno">  103</span>    <span class="comment">// 1st test</span></div>
-<div class="line"><span class="lineno">  104</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1st test &quot;</span>;</div>
-<div class="line"><span class="lineno">  105</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> matching1 = <span class="stringliteral">&quot;baaabab&quot;</span>;</div>
-<div class="line"><span class="lineno">  106</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> pattern1 = <span class="stringliteral">&quot;*****ba*****ab&quot;</span>;</div>
+<div class="line"><span class="lineno">  104</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test &quot;</span>;</div>
+<div class="line"><span class="lineno">  105</span>    std::string matching1 = <span class="stringliteral">&quot;baaabab&quot;</span>;</div>
+<div class="line"><span class="lineno">  106</span>    std::string pattern1 = <span class="stringliteral">&quot;*****ba*****ab&quot;</span>;</div>
 <div class="line"><span class="lineno">  107</span>    assert(backtracking::wildcard_matching::wildcard_matching(matching1,</div>
 <div class="line"><span class="lineno">  108</span>                                                              pattern1, 0, 0) ==</div>
 <div class="line"><span class="lineno">  109</span>           1);  <span class="comment">// here the pattern matches with given string</span></div>
-<div class="line"><span class="lineno">  110</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  110</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  111</span> </div>
 <div class="line"><span class="lineno">  112</span>    <span class="comment">// 2nd test</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> &lt;&lt; <span class="stringliteral">&quot;2nd test &quot;</span>;</div>
-<div class="line"><span class="lineno">  114</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> matching2 = <span class="stringliteral">&quot;baaabab&quot;</span>;</div>
-<div class="line"><span class="lineno">  115</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> pattern2 = <span class="stringliteral">&quot;ba*****ab&quot;</span>;</div>
+<div class="line"><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test &quot;</span>;</div>
+<div class="line"><span class="lineno">  114</span>    std::string matching2 = <span class="stringliteral">&quot;baaabab&quot;</span>;</div>
+<div class="line"><span class="lineno">  115</span>    std::string pattern2 = <span class="stringliteral">&quot;ba*****ab&quot;</span>;</div>
 <div class="line"><span class="lineno">  116</span>    assert(backtracking::wildcard_matching::wildcard_matching(matching2,</div>
 <div class="line"><span class="lineno">  117</span>                                                              pattern2, 0, 0) ==</div>
 <div class="line"><span class="lineno">  118</span>           1);  <span class="comment">// here the pattern matches with given string</span></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> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  119</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  120</span> </div>
 <div class="line"><span class="lineno">  121</span>    <span class="comment">// 3rd test</span></div>
-<div class="line"><span class="lineno">  122</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;3rd test &quot;</span>;</div>
-<div class="line"><span class="lineno">  123</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> matching3 = <span class="stringliteral">&quot;baaabab&quot;</span>;</div>
-<div class="line"><span class="lineno">  124</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> pattern3 = <span class="stringliteral">&quot;ba*ab&quot;</span>;</div>
+<div class="line"><span class="lineno">  122</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test &quot;</span>;</div>
+<div class="line"><span class="lineno">  123</span>    std::string matching3 = <span class="stringliteral">&quot;baaabab&quot;</span>;</div>
+<div class="line"><span class="lineno">  124</span>    std::string pattern3 = <span class="stringliteral">&quot;ba*ab&quot;</span>;</div>
 <div class="line"><span class="lineno">  125</span>    assert(backtracking::wildcard_matching::wildcard_matching(matching3,</div>
 <div class="line"><span class="lineno">  126</span>                                                              pattern3, 0, 0) ==</div>
 <div class="line"><span class="lineno">  127</span>           1);  <span class="comment">// here the pattern matches with given string</span></div>
-<div class="line"><span class="lineno">  128</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  128</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  129</span> </div>
 <div class="line"><span class="lineno">  130</span>    <span class="comment">// 4th test</span></div>
-<div class="line"><span class="lineno">  131</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;4th test &quot;</span>;</div>
-<div class="line"><span class="lineno">  132</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> matching4 = <span class="stringliteral">&quot;baaabab&quot;</span>;</div>
-<div class="line"><span class="lineno">  133</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> pattern4 = <span class="stringliteral">&quot;a*ab&quot;</span>;</div>
+<div class="line"><span class="lineno">  131</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;4th test &quot;</span>;</div>
+<div class="line"><span class="lineno">  132</span>    std::string matching4 = <span class="stringliteral">&quot;baaabab&quot;</span>;</div>
+<div class="line"><span class="lineno">  133</span>    std::string pattern4 = <span class="stringliteral">&quot;a*ab&quot;</span>;</div>
 <div class="line"><span class="lineno">  134</span>    assert(backtracking::wildcard_matching::wildcard_matching(matching4,</div>
 <div class="line"><span class="lineno">  135</span>                                                              pattern4, 0, 0) ==</div>
 <div class="line"><span class="lineno">  136</span>           1);  <span class="comment">// here the pattern matches with given string</span></div>
-<div class="line"><span class="lineno">  137</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  137</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  138</span> </div>
 <div class="line"><span class="lineno">  139</span>    <span class="comment">// 5th test</span></div>
-<div class="line"><span class="lineno">  140</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;5th test &quot;</span>;</div>
-<div class="line"><span class="lineno">  141</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> matching5 = <span class="stringliteral">&quot;baaabab&quot;</span>;</div>
-<div class="line"><span class="lineno">  142</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> pattern5 = <span class="stringliteral">&quot;aa?ab&quot;</span>;</div>
+<div class="line"><span class="lineno">  140</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;5th test &quot;</span>;</div>
+<div class="line"><span class="lineno">  141</span>    std::string matching5 = <span class="stringliteral">&quot;baaabab&quot;</span>;</div>
+<div class="line"><span class="lineno">  142</span>    std::string pattern5 = <span class="stringliteral">&quot;aa?ab&quot;</span>;</div>
 <div class="line"><span class="lineno">  143</span>    assert(backtracking::wildcard_matching::wildcard_matching(matching5,</div>
 <div class="line"><span class="lineno">  144</span>                                                              pattern5, 0, 0) ==</div>
 <div class="line"><span class="lineno">  145</span>           1);  <span class="comment">// here the pattern matches with given string</span></div>
-<div class="line"><span class="lineno">  146</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  146</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  147</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="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="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><!-- 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/d14/wildcard__matching_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a182d0f016b34e40f86be8d6df05dc9ac" name="a182d0f016b34e40f86be8d6df05dc9ac"></a>
@@ -275,12 +316,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool backtracking::wildcard_matching::wildcard_matching </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>s</em></span>, </td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>s</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>p</em></span>, </td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>p</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -294,9 +335,11 @@ Here is the call graph for this function:</div>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d14/wildcard__matching_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../dc/d14/wildcard__matching_8cpp_source.html">wildcard_matching.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   41</span>                                      {</div>
-<div class="line"><span class="lineno">   42</span>    uint32_t n = s.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>();</div>
-<div class="line"><span class="lineno">   43</span>    uint32_t m = p.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>();</div>
+<div class="line"><span class="lineno">   42</span>    uint32_t n = s.length();</div>
+<div class="line"><span class="lineno">   43</span>    uint32_t m = p.length();</div>
 <div class="line"><span class="lineno">   44</span>    <span class="comment">// matching is successfull if both strings are done</span></div>
 <div class="line"><span class="lineno">   45</span>    <span class="keywordflow">if</span> (pos1 == n &amp;&amp; pos2 == m) {</div>
 <div class="line"><span class="lineno">   46</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
@@ -320,71 +363,36 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   64</span> </div>
 <div class="line"><span class="lineno">   65</span>    <span class="comment">// if already calculted for these positions</span></div>
 <div class="line"><span class="lineno">   66</span>    <span class="keywordflow">if</span> (dpTable[pos1][pos2] != -1) {</div>
-<div class="line"><span class="lineno">   67</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="#a4a5b107f93db24e424b12899fa692c5a">dpTable</a>[pos1][pos2];</div>
+<div class="line"><span class="lineno">   67</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a1f8c260cf0d7e22c666b85f1f71ee4a7">dpTable</a>[pos1][pos2];</div>
 <div class="line"><span class="lineno">   68</span>    }</div>
 <div class="line"><span class="lineno">   69</span> </div>
 <div class="line"><span class="lineno">   70</span>    <span class="comment">// if the characters are same just go ahead in both the string</span></div>
 <div class="line"><span class="lineno">   71</span>    <span class="keywordflow">if</span> (s[pos1] == p[pos2]) {</div>
-<div class="line"><span class="lineno">   72</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="#a4a5b107f93db24e424b12899fa692c5a">dpTable</a>[pos1][pos2] =</div>
+<div class="line"><span class="lineno">   72</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a1f8c260cf0d7e22c666b85f1f71ee4a7">dpTable</a>[pos1][pos2] =</div>
 <div class="line"><span class="lineno">   73</span>                   <a class="code hl_namespace" href="../../db/d03/namespacewildcard__matching.html">wildcard_matching</a>(s, p, pos1 + 1, pos2 + 1);</div>
 <div class="line"><span class="lineno">   74</span>    }</div>
 <div class="line"><span class="lineno">   75</span> </div>
 <div class="line"><span class="lineno">   76</span>    <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">   77</span>        <span class="comment">// can only single character</span></div>
 <div class="line"><span class="lineno">   78</span>        <span class="keywordflow">if</span> (p[pos2] == <span class="charliteral">&#39;?&#39;</span>) {</div>
-<div class="line"><span class="lineno">   79</span>            <span class="keywordflow">return</span> <a class="code hl_variable" href="#a4a5b107f93db24e424b12899fa692c5a">dpTable</a>[pos1][pos2] =</div>
+<div class="line"><span class="lineno">   79</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="#a1f8c260cf0d7e22c666b85f1f71ee4a7">dpTable</a>[pos1][pos2] =</div>
 <div class="line"><span class="lineno">   80</span>                       <a class="code hl_namespace" href="../../db/d03/namespacewildcard__matching.html">wildcard_matching</a>(s, p, pos1 + 1, pos2 + 1);</div>
 <div class="line"><span class="lineno">   81</span>        }</div>
 <div class="line"><span class="lineno">   82</span>        <span class="comment">// have choice either to match one or more charcters</span></div>
 <div class="line"><span class="lineno">   83</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (p[pos2] == <span class="charliteral">&#39;*&#39;</span>) {</div>
-<div class="line"><span class="lineno">   84</span>            <span class="keywordflow">return</span> <a class="code hl_variable" href="#a4a5b107f93db24e424b12899fa692c5a">dpTable</a>[pos1][pos2] =</div>
+<div class="line"><span class="lineno">   84</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="#a1f8c260cf0d7e22c666b85f1f71ee4a7">dpTable</a>[pos1][pos2] =</div>
 <div class="line"><span class="lineno">   85</span>                       <a class="code hl_namespace" href="../../db/d03/namespacewildcard__matching.html">wildcard_matching</a>(s, p, pos1, pos2 + 1) ||</div>
 <div class="line"><span class="lineno">   86</span>                       <a class="code hl_namespace" href="../../db/d03/namespacewildcard__matching.html">wildcard_matching</a>(s, p, pos1 + 1, pos2);</div>
 <div class="line"><span class="lineno">   87</span>        }</div>
 <div class="line"><span class="lineno">   88</span>        <span class="comment">// not possible to match</span></div>
 <div class="line"><span class="lineno">   89</span>        <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   90</span>            <span class="keywordflow">return</span> <a class="code hl_variable" href="#a4a5b107f93db24e424b12899fa692c5a">dpTable</a>[pos1][pos2] = 0;</div>
+<div class="line"><span class="lineno">   90</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="#a1f8c260cf0d7e22c666b85f1f71ee4a7">dpTable</a>[pos1][pos2] = 0;</div>
 <div class="line"><span class="lineno">   91</span>        }</div>
 <div class="line"><span class="lineno">   92</span>    }</div>
 <div class="line"><span class="lineno">   93</span>}</div>
 <div class="ttc" id="anamespacewildcard__matching_html"><div class="ttname"><a href="../../db/d03/namespacewildcard__matching.html">wildcard_matching</a></div><div class="ttdoc">Functions for the Wildcard Matching problem.</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::length</a></div><div class="ttdeci">T length(T... args)</div></div>
-<div class="ttc" id="awildcard__matching_8cpp_html_a4a5b107f93db24e424b12899fa692c5a"><div class="ttname"><a href="#a4a5b107f93db24e424b12899fa692c5a">backtracking::wildcard_matching::dpTable</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int64_t &gt; &gt; dpTable(1000, std::vector&lt; int64_t &gt;(1000, -1))</div><div class="ttdoc">The main function implements if pattern can be matched with given string.</div></div>
+<div class="ttc" id="awildcard__matching_8cpp_html_a1f8c260cf0d7e22c666b85f1f71ee4a7"><div class="ttname"><a href="#a1f8c260cf0d7e22c666b85f1f71ee4a7">backtracking::wildcard_matching::dpTable</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int64_t &gt; &gt; dpTable(1000, std::vector&lt; int64_t &gt;(1000, -1))</div><div class="ttdoc">The main function implements if pattern can be matched with given string.</div></div>
 </div><!-- fragment -->
-</div>
-</div>
-<h2 class="groupheader">Variable Documentation</h2>
-<a id="a4a5b107f93db24e424b12899fa692c5a" name="a4a5b107f93db24e424b12899fa692c5a"></a>
-<h2 class="memtitle"><span class="permalink"><a href="#a4a5b107f93db24e424b12899fa692c5a">&#9670;&#160;</a></span>dpTable</h2>
-
-<div class="memitem">
-<div class="memproto">
-      <table class="memname">
-        <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &gt; backtracking::wildcard_matching::dpTable(1000, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;(1000, -1)) </td>
-          <td>(</td>
-          <td class="paramtype">1000</td>          <td class="paramname"><span class="paramname"><em></em></span>, </td>
-        </tr>
-        <tr>
-          <td class="paramkey"></td>
-          <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;</td>          <td class="paramname"><span class="paramname"><em></em></span>1000, -1&#160;)</td>
-        </tr>
-      </table>
-</div><div class="memdoc">
-
-<p>The main function implements if pattern can be matched with given string. </p>
-<dl class="params"><dt>Parameters</dt><dd>
-  <table class="params">
-    <tr><td class="paramname">s</td><td>is the given matching string </td></tr>
-    <tr><td class="paramname">p</td><td>is the given pattern </td></tr>
-    <tr><td class="paramname">pos1</td><td>is the starting index </td></tr>
-    <tr><td class="paramname">pos2</td><td>is the last index </td></tr>
-  </table>
-  </dd>
-</dl>
-<dl class="section return"><dt>Returns</dt><dd>1 if pattern matches with matching string otherwise 0 </dd></dl>
-
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dc/d14/wildcard__matching_8cpp.js b/dc/d14/wildcard__matching_8cpp.js
index 675b8340b..cc9c032a3 100644
--- a/dc/d14/wildcard__matching_8cpp.js
+++ b/dc/d14/wildcard__matching_8cpp.js
@@ -1,6 +1,6 @@
 var wildcard__matching_8cpp =
 [
+    [ "dpTable", "dc/d14/wildcard__matching_8cpp.html#a1f8c260cf0d7e22c666b85f1f71ee4a7", null ],
     [ "main", "dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
-    [ "test", "dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ],
-    [ "dpTable", "dc/d14/wildcard__matching_8cpp.html#a4a5b107f93db24e424b12899fa692c5a", null ]
+    [ "test", "dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
 ];
\ No newline at end of file
diff --git a/dc/d14/wildcard__matching_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/dc/d14/wildcard__matching_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index e85e01374..000000000
--- a/dc/d14/wildcard__matching_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/dc/d14/wildcard__matching_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/dc/d14/wildcard__matching_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 5901bc148..000000000
--- a/dc/d14/wildcard__matching_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-729fb887ee50b6291b0542ba0592a5c7
\ No newline at end of file
diff --git a/dc/d14/wildcard__matching_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/dc/d14/wildcard__matching_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 2e04695b9..000000000
--- a/dc/d14/wildcard__matching_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d14/wildcard__matching_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/dc/d14/wildcard__matching_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1813bd719..000000000
--- a/dc/d14/wildcard__matching_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 6dbcc050a..000000000
--- a/dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index dd5854796..000000000
--- a/dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3283a141aed910c97967257457151478
\ No newline at end of file
diff --git a/dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index cdd9e23ce..000000000
--- a/dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index e726a4815..000000000
--- a/dc/d14/wildcard__matching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d14/wildcard__matching_8cpp_source.html b/dc/d14/wildcard__matching_8cpp_source.html
new file mode 100644
index 000000000..ca5163cd7
--- /dev/null
+++ b/dc/d14/wildcard__matching_8cpp_source.html
@@ -0,0 +1,264 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: backtracking/wildcard_matching.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dc/d14/wildcard__matching_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">wildcard_matching.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dc/d14/wildcard__matching_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../db/dc0/namespacebacktracking.html">backtracking</a> {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../db/d03/namespacewildcard__matching.html">wildcard_matching</a> {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../dc/d14/wildcard__matching_8cpp.html#a1f8c260cf0d7e22c666b85f1f71ee4a7">   39</a></span>std::vector&lt;std::vector&lt;int64_t&gt;&gt; <a class="code hl_function" href="../../dc/d14/wildcard__matching_8cpp.html#a1f8c260cf0d7e22c666b85f1f71ee4a7">dpTable</a>(1000, std::vector&lt;int64_t&gt;(1000, -1));</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="keywordtype">bool</span> <a class="code hl_namespace" href="../../db/d03/namespacewildcard__matching.html">wildcard_matching</a>(std::string s, std::string p, uint32_t pos1,</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>                       uint32_t pos2) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    uint32_t n = s.length();</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    uint32_t m = p.length();</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="comment">// matching is successfull if both strings are done</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordflow">if</span> (pos1 == n &amp;&amp; pos2 == m) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="comment">// matching is unsuccessfull if pattern is not finished but matching string</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="comment">// is</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordflow">if</span> (pos1 != n &amp;&amp; pos2 == m) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    }</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="comment">// all the remaining characters of patterns must be * inorder to match with</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="comment">// finished string</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">if</span> (pos1 == n &amp;&amp; pos2 != m) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordflow">while</span> (pos2 &lt; m &amp;&amp; p[pos2] == <span class="charliteral">&#39;*&#39;</span>) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            pos2++;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        }</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordflow">return</span> pos2 == m;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="comment">// if already calculted for these positions</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">if</span> (dpTable[pos1][pos2] != -1) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../dc/d14/wildcard__matching_8cpp.html#a1f8c260cf0d7e22c666b85f1f71ee4a7">dpTable</a>[pos1][pos2];</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="comment">// if the characters are same just go ahead in both the string</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordflow">if</span> (s[pos1] == p[pos2]) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../dc/d14/wildcard__matching_8cpp.html#a1f8c260cf0d7e22c666b85f1f71ee4a7">dpTable</a>[pos1][pos2] =</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>                   <a class="code hl_namespace" href="../../db/d03/namespacewildcard__matching.html">wildcard_matching</a>(s, p, pos1 + 1, pos2 + 1);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    }</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        <span class="comment">// can only single character</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        <span class="keywordflow">if</span> (p[pos2] == <span class="charliteral">&#39;?&#39;</span>) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="../../dc/d14/wildcard__matching_8cpp.html#a1f8c260cf0d7e22c666b85f1f71ee4a7">dpTable</a>[pos1][pos2] =</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>                       <a class="code hl_namespace" href="../../db/d03/namespacewildcard__matching.html">wildcard_matching</a>(s, p, pos1 + 1, pos2 + 1);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        }</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <span class="comment">// have choice either to match one or more charcters</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (p[pos2] == <span class="charliteral">&#39;*&#39;</span>) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="../../dc/d14/wildcard__matching_8cpp.html#a1f8c260cf0d7e22c666b85f1f71ee4a7">dpTable</a>[pos1][pos2] =</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>                       <a class="code hl_namespace" href="../../db/d03/namespacewildcard__matching.html">wildcard_matching</a>(s, p, pos1, pos2 + 1) ||</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>                       <a class="code hl_namespace" href="../../db/d03/namespacewildcard__matching.html">wildcard_matching</a>(s, p, pos1 + 1, pos2);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        <span class="comment">// not possible to match</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="../../dc/d14/wildcard__matching_8cpp.html#a1f8c260cf0d7e22c666b85f1f71ee4a7">dpTable</a>[pos1][pos2] = 0;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        }</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    }</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>}</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>}  <span class="comment">// namespace wildcard_matching</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>}  <span class="comment">// namespace backtracking</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="foldopen" id="foldopen00102" data-start="{" data-end="}">
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"><a class="line" href="../../dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  102</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="comment">// 1st test</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test &quot;</span>;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    std::string matching1 = <span class="stringliteral">&quot;baaabab&quot;</span>;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    std::string pattern1 = <span class="stringliteral">&quot;*****ba*****ab&quot;</span>;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    assert(backtracking::wildcard_matching::wildcard_matching(matching1,</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>                                                              pattern1, 0, 0) ==</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>           1);  <span class="comment">// here the pattern matches with given string</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="comment">// 2nd test</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test &quot;</span>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::string matching2 = <span class="stringliteral">&quot;baaabab&quot;</span>;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    std::string pattern2 = <span class="stringliteral">&quot;ba*****ab&quot;</span>;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    assert(backtracking::wildcard_matching::wildcard_matching(matching2,</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>                                                              pattern2, 0, 0) ==</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>           1);  <span class="comment">// here the pattern matches with given string</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="comment">// 3rd test</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test &quot;</span>;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    std::string matching3 = <span class="stringliteral">&quot;baaabab&quot;</span>;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    std::string pattern3 = <span class="stringliteral">&quot;ba*ab&quot;</span>;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    assert(backtracking::wildcard_matching::wildcard_matching(matching3,</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>                                                              pattern3, 0, 0) ==</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>           1);  <span class="comment">// here the pattern matches with given string</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="comment">// 4th test</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;4th test &quot;</span>;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    std::string matching4 = <span class="stringliteral">&quot;baaabab&quot;</span>;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    std::string pattern4 = <span class="stringliteral">&quot;a*ab&quot;</span>;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    assert(backtracking::wildcard_matching::wildcard_matching(matching4,</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>                                                              pattern4, 0, 0) ==</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>           1);  <span class="comment">// here the pattern matches with given string</span></div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <span class="comment">// 5th test</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;5th test &quot;</span>;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    std::string matching5 = <span class="stringliteral">&quot;baaabab&quot;</span>;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    std::string pattern5 = <span class="stringliteral">&quot;aa?ab&quot;</span>;</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    assert(backtracking::wildcard_matching::wildcard_matching(matching5,</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>                                                              pattern5, 0, 0) ==</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>           1);  <span class="comment">// here the pattern matches with given string</span></div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>}</div>
+</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span> </div>
+<div class="foldopen" id="foldopen00153" data-start="{" data-end="}">
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"><a class="line" href="../../dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  153</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <a class="code hl_function" href="../../dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>}</div>
+</div>
+<div class="ttc" id="anamespacebacktracking_html"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html">backtracking</a></div><div class="ttdoc">for vector container</div></div>
+<div class="ttc" id="anamespacewildcard__matching_html"><div class="ttname"><a href="../../db/d03/namespacewildcard__matching.html">wildcard_matching</a></div><div class="ttdoc">Functions for the Wildcard Matching problem.</div></div>
+<div class="ttc" id="awildcard__matching_8cpp_html_a1f8c260cf0d7e22c666b85f1f71ee4a7"><div class="ttname"><a href="../../dc/d14/wildcard__matching_8cpp.html#a1f8c260cf0d7e22c666b85f1f71ee4a7">backtracking::wildcard_matching::dpTable</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int64_t &gt; &gt; dpTable(1000, std::vector&lt; int64_t &gt;(1000, -1))</div><div class="ttdoc">The main function implements if pattern can be matched with given string.</div></div>
+<div class="ttc" id="awildcard__matching_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/d14/wildcard__matching_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> <a href="#l00102">wildcard_matching.cpp:102</a></div></div>
+<div class="ttc" id="awildcard__matching_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00153">wildcard_matching.cpp:153</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a class="el" href="../../dc/d14/wildcard__matching_8cpp.html">wildcard_matching.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dc/d1a/pascal__triangle_8cpp.html b/dc/d1a/pascal__triangle_8cpp.html
index 02fba7d32..573f8e9a0 100644
--- a/dc/d1a/pascal__triangle_8cpp.html
+++ b/dc/d1a/pascal__triangle_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/pascal_triangle.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/pascal_triangle.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for pascal_triangle.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d1d/pascal__triangle_8cpp__incl.svg" width="258" height="111"><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">
+</div>
+<p><a href="../../dc/d1a/pascal__triangle_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ad7a31d9cb2818d21b1ba12aead7f4c5c" id="r_ad7a31d9cb2818d21b1ba12aead7f4c5c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad7a31d9cb2818d21b1ba12aead7f4c5c">show_pascal</a> (int **arr, int n)</td></tr>
@@ -132,6 +151,8 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Pascal's triangle implementation. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../dc/d1a/pascal__triangle_8cpp_source.html">pascal_triangle.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -148,17 +169,19 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d1a/pascal__triangle_8cpp_source.html#l00052">52</a> of file <a class="el" href="../../dc/d1a/pascal__triangle_8cpp_source.html">pascal_triangle.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   52</span>           {</div>
 <div class="line"><span class="lineno">   53</span>    <span class="keywordtype">int</span> n = 0;</div>
 <div class="line"><span class="lineno">   54</span> </div>
-<div class="line"><span class="lineno">   55</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Set Pascal&#39;s Triangle Height&quot;</span> &lt;&lt; <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">   56</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;</div>
+<div class="line"><span class="lineno">   55</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Set Pascal&#39;s Triangle Height&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   56</span>    std::cin &gt;&gt; n;</div>
 <div class="line"><span class="lineno">   57</span> </div>
 <div class="line"><span class="lineno">   58</span>    <span class="comment">// memory allocation (Assign two-dimensional array to store Pascal triangle)</span></div>
 <div class="line"><span class="lineno">   59</span>    <span class="keywordtype">int</span> **arr = <span class="keyword">new</span> <span class="keywordtype">int</span> *[n];</div>
 <div class="line"><span class="lineno">   60</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
 <div class="line"><span class="lineno">   61</span>        arr[i] = <span class="keyword">new</span> <span class="keywordtype">int</span>[2 * n - 1];</div>
-<div class="line"><span class="lineno">   62</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/memset.html">memset</a>(arr[i], 0, <span class="keyword">sizeof</span>(<span class="keywordtype">int</span>) * (2 * n - 1));</div>
+<div class="line"><span class="lineno">   62</span>        memset(arr[i], 0, <span class="keyword">sizeof</span>(<span class="keywordtype">int</span>) * (2 * n - 1));</div>
 <div class="line"><span class="lineno">   63</span>    }</div>
 <div class="line"><span class="lineno">   64</span> </div>
 <div class="line"><span class="lineno">   65</span>    <a class="code hl_function" href="#a4fc0e5a112f715c3a73989450b2cc5fd">pascal_triangle</a>(arr, n);</div>
@@ -172,18 +195,9 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   73</span> </div>
 <div class="line"><span class="lineno">   74</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   75</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="amemset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/memset.html">std::memset</a></div><div class="ttdeci">T memset(T... args)</div></div>
-<div class="ttc" id="apascal__triangle_8cpp_html_a4fc0e5a112f715c3a73989450b2cc5fd"><div class="ttname"><a href="#a4fc0e5a112f715c3a73989450b2cc5fd">pascal_triangle</a></div><div class="ttdeci">int ** pascal_triangle(int **arr, int n)</div><div class="ttdef"><b>Definition</b> pascal_triangle.cpp:36</div></div>
-<div class="ttc" id="apascal__triangle_8cpp_html_ad7a31d9cb2818d21b1ba12aead7f4c5c"><div class="ttname"><a href="#ad7a31d9cb2818d21b1ba12aead7f4c5c">show_pascal</a></div><div class="ttdeci">void show_pascal(int **arr, int n)</div><div class="ttdef"><b>Definition</b> pascal_triangle.cpp:18</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="340" height="111"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="apascal__triangle_8cpp_html_a4fc0e5a112f715c3a73989450b2cc5fd"><div class="ttname"><a href="#a4fc0e5a112f715c3a73989450b2cc5fd">pascal_triangle</a></div><div class="ttdeci">int ** pascal_triangle(int **arr, int n)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d1a/pascal__triangle_8cpp_source.html#l00036">pascal_triangle.cpp:36</a></div></div>
+<div class="ttc" id="apascal__triangle_8cpp_html_ad7a31d9cb2818d21b1ba12aead7f4c5c"><div class="ttname"><a href="#ad7a31d9cb2818d21b1ba12aead7f4c5c">show_pascal</a></div><div class="ttdeci">void show_pascal(int **arr, int n)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d1a/pascal__triangle_8cpp_source.html#l00018">pascal_triangle.cpp:18</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4fc0e5a112f715c3a73989450b2cc5fd" name="a4fc0e5a112f715c3a73989450b2cc5fd"></a>
@@ -212,6 +226,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>arr pointer returned </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d1a/pascal__triangle_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../dc/d1a/pascal__triangle_8cpp_source.html">pascal_triangle.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   36</span>                                        {</div>
 <div class="line"><span class="lineno">   37</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
 <div class="line"><span class="lineno">   38</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = n - i - 1; j &lt; n + i; ++j) {</div>
@@ -252,24 +268,20 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d1a/pascal__triangle_8cpp_source.html#l00018">18</a> of file <a class="el" href="../../dc/d1a/pascal__triangle_8cpp_source.html">pascal_triangle.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   18</span>                                   {</div>
 <div class="line"><span class="lineno">   19</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
 <div class="line"><span class="lineno">   20</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n + i; ++j) {</div>
 <div class="line"><span class="lineno">   21</span>            <span class="keywordflow">if</span> (arr[i][j] == 0)</div>
-<div class="line"><span class="lineno">   22</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(4) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   22</span>                std::cout &lt;&lt; std::setw(4) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   23</span>            <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">   24</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(4) &lt;&lt; arr[i][j];</div>
+<div class="line"><span class="lineno">   24</span>                std::cout &lt;&lt; std::setw(4) &lt;&lt; arr[i][j];</div>
 <div class="line"><span class="lineno">   25</span>        }</div>
-<div class="line"><span class="lineno">   26</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   26</span>        std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   27</span>    }</div>
 <div class="line"><span class="lineno">   28</span>}</div>
-<div class="ttc" id="asetw_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a></div><div class="ttdeci">T setw(T... args)</div></div>
-</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/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.svg" width="232" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.map b/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.map
deleted file mode 100644
index 05fb1193a..000000000
--- a/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="show_pascal" name="show_pascal">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,103,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="153,5,224,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="103,32,137,25,138,30,104,37"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setw.html#" title=" " alt="" coords="151,55,226,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="104,50,136,55,135,61,103,55"/>
-</map>
diff --git a/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.md5 b/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.md5
deleted file mode 100644
index 59a934d2a..000000000
--- a/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7c8349747a5578c003687329179f0ab8
\ No newline at end of file
diff --git a/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.svg b/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.svg
deleted file mode 100644
index 3b4e7a271..000000000
--- a/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: show_pascal Pages: 1 -->
-<svg width="174pt" height="64pt"
- viewBox="0.00 0.00 173.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>show_pascal</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="73,-37.25 0,-37.25 0,-18 73,-18 73,-37.25"/>
-<text text-anchor="middle" x="36.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">show_pascal</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164,-56.25 110.5,-56.25 110.5,-37 164,-37 164,-56.25"/>
-<text text-anchor="middle" x="137.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.43,-34.54C81.77,-36.14 90.67,-37.85 99.06,-39.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.13,-42.85 108.61,-41.31 99.45,-35.98 98.13,-42.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.5,-19.25 109,-19.25 109,0 165.5,0 165.5,-19.25"/>
-<text text-anchor="middle" x="137.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.43,-21.08C81.21,-19.66 89.47,-18.15 97.36,-16.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.85,-20.18 107.06,-14.95 96.6,-13.3 97.85,-20.18"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph_org.svg b/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph_org.svg
deleted file mode 100644
index 808703ee4..000000000
--- a/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: show_pascal Pages: 1 -->
-<svg width="174pt" height="64pt"
- viewBox="0.00 0.00 173.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>show_pascal</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="73,-37.25 0,-37.25 0,-18 73,-18 73,-37.25"/>
-<text text-anchor="middle" x="36.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">show_pascal</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164,-56.25 110.5,-56.25 110.5,-37 164,-37 164,-56.25"/>
-<text text-anchor="middle" x="137.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.43,-34.54C81.77,-36.14 90.67,-37.85 99.06,-39.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.13,-42.85 108.61,-41.31 99.45,-35.98 98.13,-42.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.5,-19.25 109,-19.25 109,0 165.5,0 165.5,-19.25"/>
-<text text-anchor="middle" x="137.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M73.43,-21.08C81.21,-19.66 89.47,-18.15 97.36,-16.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.85,-20.18 107.06,-14.95 96.6,-13.3 97.85,-20.18"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 65c03ecaf..000000000
--- a/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="261,5,332,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,30,102,16,177,9,245,11,245,16,177,14,103,21,56,35"/>
-<area shape="rect" id="Node000003" href="$dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd" title=" " alt="" coords="103,31,211,56"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,41,87,41,87,46,55,46"/>
-<area shape="rect" id="Node000004" href="$dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c" title=" " alt="" coords="108,80,206,106"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,51,109,71,107,76,54,55"/>
-<area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="188,77,210,66,260,37,263,42,212,71,190,82"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setw.html#" title=" " alt="" coords="259,80,334,106"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="206,90,243,90,243,96,206,96"/>
-</map>
diff --git a/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index c5e465ba1..000000000
--- a/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3829063c1c0c993562428e517950010f
\ No newline at end of file
diff --git a/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index f23c1b90d..000000000
--- a/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,128 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="255pt" height="83pt"
- viewBox="0.00 0.00 254.75 83.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 79.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245.25,-75.25 191.75,-75.25 191.75,-56 245.25,-56 245.25,-75.25"/>
-<text text-anchor="middle" x="218.5" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.41,-54.72C47.61,-58.88 60.76,-63.52 73,-65.62 108.96,-71.82 150.71,-70.98 180.06,-69.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.2,-72.59 189.92,-68.38 179.7,-65.61 180.2,-72.59"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.25,-56.25 73,-56.25 73,-37 154.25,-37 154.25,-56.25"/>
-<text text-anchor="middle" x="113.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">pascal_triangle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.46,-46.62C44.44,-46.62 52.82,-46.62 61.42,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.23,-50.13 71.23,-46.63 61.23,-43.13 61.23,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.12,-19.25 77.12,-19.25 77.12,0 150.12,0 150.12,-19.25"/>
-<text text-anchor="middle" x="113.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">show_pascal</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.46,-39.49C48.63,-35.05 63.4,-29.18 76.88,-23.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.92,-27.18 85.93,-20.23 75.34,-20.67 77.92,-27.18"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M137.89,-19.65C143.32,-22.14 149.03,-24.88 154.25,-27.62 167.01,-34.33 180.78,-42.48 192.2,-49.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.31,-52.46 200.65,-54.79 194.01,-46.52 190.31,-52.46"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.75,-19.25 190.25,-19.25 190.25,0 246.75,0 246.75,-19.25"/>
-<text text-anchor="middle" x="218.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.61,-9.62C159.65,-9.62 169.4,-9.62 178.58,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.3,-13.13 188.3,-9.63 178.3,-6.13 178.3,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 9277f55cf..000000000
--- a/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="255pt" height="83pt"
- viewBox="0.00 0.00 254.75 83.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 79.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245.25,-75.25 191.75,-75.25 191.75,-56 245.25,-56 245.25,-75.25"/>
-<text text-anchor="middle" x="218.5" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.41,-54.72C47.61,-58.88 60.76,-63.52 73,-65.62 108.96,-71.82 150.71,-70.98 180.06,-69.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.2,-72.59 189.92,-68.38 179.7,-65.61 180.2,-72.59"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.25,-56.25 73,-56.25 73,-37 154.25,-37 154.25,-56.25"/>
-<text text-anchor="middle" x="113.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">pascal_triangle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.46,-46.62C44.44,-46.62 52.82,-46.62 61.42,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.23,-50.13 71.23,-46.63 61.23,-43.13 61.23,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="150.12,-19.25 77.12,-19.25 77.12,0 150.12,0 150.12,-19.25"/>
-<text text-anchor="middle" x="113.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">show_pascal</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.46,-39.49C48.63,-35.05 63.4,-29.18 76.88,-23.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.92,-27.18 85.93,-20.23 75.34,-20.67 77.92,-27.18"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M137.89,-19.65C143.32,-22.14 149.03,-24.88 154.25,-27.62 167.01,-34.33 180.78,-42.48 192.2,-49.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.31,-52.46 200.65,-54.79 194.01,-46.52 190.31,-52.46"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.75,-19.25 190.25,-19.25 190.25,0 246.75,0 246.75,-19.25"/>
-<text text-anchor="middle" x="218.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.61,-9.62C159.65,-9.62 169.4,-9.62 178.58,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.3,-13.13 188.3,-9.63 178.3,-6.13 178.3,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d1a/pascal__triangle_8cpp_source.html b/dc/d1a/pascal__triangle_8cpp_source.html
new file mode 100644
index 000000000..54d17173a
--- /dev/null
+++ b/dc/d1a/pascal__triangle_8cpp_source.html
@@ -0,0 +1,204 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/pascal_triangle.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dc/d1a/pascal__triangle_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">pascal_triangle.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dc/d1a/pascal__triangle_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#ifdef _MSC_VER</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;string&gt;</span>  <span class="comment">// required for Visual C</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;iomanip&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="foldopen" id="foldopen00018" data-start="{" data-end="}">
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"><a class="line" href="../../dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c">   18</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c">show_pascal</a>(<span class="keywordtype">int</span> **arr, <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; n + i; ++j) {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>            <span class="keywordflow">if</span> (arr[i][j] == 0)</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>                std::cout &lt;&lt; std::setw(4) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>                std::cout &lt;&lt; std::setw(4) &lt;&lt; arr[i][j];</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        }</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    }</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>}</div>
+</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="foldopen" id="foldopen00036" data-start="{" data-end="}">
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd">   36</a></span><span class="keywordtype">int</span> **<a class="code hl_function" href="../../dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd">pascal_triangle</a>(<span class="keywordtype">int</span> **arr, <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = n - i - 1; j &lt; n + i; ++j) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            <span class="keywordflow">if</span> (j == n - i - 1 || j == n + i - 1)</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>                arr[i][j] = 1;  <span class="comment">// The edge of the Pascal triangle goes in 1</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>                arr[i][j] = arr[i - 1][j - 1] + arr[i - 1][j + 1];</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    }</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keywordflow">return</span> arr;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>}</div>
+</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="foldopen" id="foldopen00052" data-start="{" data-end="}">
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   52</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordtype">int</span> n = 0;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Set Pascal&#39;s Triangle Height&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="comment">// memory allocation (Assign two-dimensional array to store Pascal triangle)</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordtype">int</span> **arr = <span class="keyword">new</span> <span class="keywordtype">int</span> *[n];</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        arr[i] = <span class="keyword">new</span> <span class="keywordtype">int</span>[2 * n - 1];</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        memset(arr[i], 0, <span class="keyword">sizeof</span>(<span class="keywordtype">int</span>) * (2 * n - 1));</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <a class="code hl_function" href="../../dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd">pascal_triangle</a>(arr, n);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <a class="code hl_function" href="../../dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c">show_pascal</a>(arr, n);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="comment">// deallocation</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        <span class="keyword">delete</span>[] arr[i];</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="keyword">delete</span>[] arr;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>}</div>
+</div>
+<div class="ttc" id="apascal__triangle_8cpp_html_a4fc0e5a112f715c3a73989450b2cc5fd"><div class="ttname"><a href="../../dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd">pascal_triangle</a></div><div class="ttdeci">int ** pascal_triangle(int **arr, int n)</div><div class="ttdef"><b>Definition</b> <a href="#l00036">pascal_triangle.cpp:36</a></div></div>
+<div class="ttc" id="apascal__triangle_8cpp_html_ad7a31d9cb2818d21b1ba12aead7f4c5c"><div class="ttname"><a href="../../dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c">show_pascal</a></div><div class="ttdeci">void show_pascal(int **arr, int n)</div><div class="ttdef"><b>Definition</b> <a href="#l00018">pascal_triangle.cpp:18</a></div></div>
+<div class="ttc" id="apascal__triangle_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00052">pascal_triangle.cpp:52</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../dc/d1a/pascal__triangle_8cpp.html">pascal_triangle.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dc/d1f/classcatalan__numbers.html b/dc/d1f/classcatalan__numbers.html
index 65521e00d..ed4a055a8 100644
--- a/dc/d1f/classcatalan__numbers.html
+++ b/dc/d1f/classcatalan__numbers.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: catalan_numbers Class Reference</title>
+<title>TheAlgorithms/C++: catalan_numbers Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,37 +136,63 @@ $(function(){initNavTree('dc/d1f/classcatalan__numbers.html','../../'); initResi
 <div class="dynheader">
 Collaboration diagram for catalan_numbers:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d6e/classcatalan__numbers__coll__graph.svg" width="191" height="214"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d6e/classcatalan__numbers__coll__graph.svg" width="138" height="140"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:a54655c66cf89186d3d1fa90829b28ab8" id="r_a54655c66cf89186d3d1fa90829b28ab8"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">value_type</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a54655c66cf89186d3d1fa90829b28ab8">get</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> n)</td></tr>
+<tr class="memitem:a54655c66cf89186d3d1fa90829b28ab8" id="r_a54655c66cf89186d3d1fa90829b28ab8"><td class="memItemLeft" align="right" valign="top">value_type&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a54655c66cf89186d3d1fa90829b28ab8">get</a> (std::size_t n)</td></tr>
 <tr class="memdesc:a54655c66cf89186d3d1fa90829b28ab8"><td class="mdescLeft">&#160;</td><td class="mdescRight">computes the n-th Catalan number and updates the cache.  <br /></td></tr>
 <tr class="separator:a54655c66cf89186d3d1fa90829b28ab8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-types" name="pri-types"></a>
 Private Types</h2></td></tr>
-<tr class="memitem:a0bfc8c78494c93dbb4c7d67b7300cf1a" id="r_a0bfc8c78494c93dbb4c7d67b7300cf1a"><td class="memItemLeft" align="right" valign="top"><a id="a0bfc8c78494c93dbb4c7d67b7300cf1a" name="a0bfc8c78494c93dbb4c7d67b7300cf1a"></a>
-using&#160;</td><td class="memItemRight" valign="bottom"><b>value_type</b> = <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a></td></tr>
+<tr class="memitem:a0bfc8c78494c93dbb4c7d67b7300cf1a" id="r_a0bfc8c78494c93dbb4c7d67b7300cf1a"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0bfc8c78494c93dbb4c7d67b7300cf1a">value_type</a> = std::uint64_t</td></tr>
 <tr class="separator:a0bfc8c78494c93dbb4c7d67b7300cf1a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
 Private Member Functions</h2></td></tr>
-<tr class="memitem:a141beca0f50fbb4cd5ca8d53819bc43d" id="r_a141beca0f50fbb4cd5ca8d53819bc43d"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">value_type</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a141beca0f50fbb4cd5ca8d53819bc43d">compute_next</a> ()</td></tr>
+<tr class="memitem:a141beca0f50fbb4cd5ca8d53819bc43d" id="r_a141beca0f50fbb4cd5ca8d53819bc43d"><td class="memItemLeft" align="right" valign="top">value_type&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a141beca0f50fbb4cd5ca8d53819bc43d">compute_next</a> ()</td></tr>
 <tr class="separator:a141beca0f50fbb4cd5ca8d53819bc43d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:abf882dee674593be3df61a36443b5632" id="r_abf882dee674593be3df61a36443b5632"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abf882dee674593be3df61a36443b5632">add</a> ()</td></tr>
 <tr class="separator:abf882dee674593be3df61a36443b5632"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:ad37c6891d102bb758d3d3d85fb7f1798" id="r_ad37c6891d102bb758d3d3d85fb7f1798"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">value_type</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad37c6891d102bb758d3d3d85fb7f1798">known</a> {1, 1}</td></tr>
+<tr class="memitem:ad37c6891d102bb758d3d3d85fb7f1798" id="r_ad37c6891d102bb758d3d3d85fb7f1798"><td class="memItemLeft" align="right" valign="top">std::vector&lt; value_type &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad37c6891d102bb758d3d3d85fb7f1798">known</a> {1, 1}</td></tr>
 <tr class="separator:ad37c6891d102bb758d3d3d85fb7f1798"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>computes and caches Catalan numbers </p>
-<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/plus.html">std::plus</a> &amp; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/multiplies.html">std::multiplies</a> for std::transform_reduce for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
-</div><h2 class="groupheader">Member Function Documentation</h2>
+<p>for assert for std::uint64_t for std::size_t for std::plus &amp; std::multiplies for std::transform_reduce for std::vector </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html#l00022">22</a> of file <a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html">catalan_numbers.cpp</a>.</p>
+</div><h2 class="groupheader">Member Typedef Documentation</h2>
+<a id="a0bfc8c78494c93dbb4c7d67b7300cf1a" name="a0bfc8c78494c93dbb4c7d67b7300cf1a"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a0bfc8c78494c93dbb4c7d67b7300cf1a">&#9670;&#160;</a></span>value_type</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">using catalan_numbers::value_type = std::uint64_t</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html#l00023">23</a> of file <a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html">catalan_numbers.cpp</a>.</p>
+
+</div>
+</div>
+<h2 class="groupheader">Member Function Documentation</h2>
 <a id="abf882dee674593be3df61a36443b5632" name="abf882dee674593be3df61a36443b5632"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#abf882dee674593be3df61a36443b5632">&#9670;&#160;</a></span>add()</h2>
 
@@ -172,6 +215,8 @@ Private Attributes</h2></td></tr>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html">catalan_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   32</span>{ known.push_back(this-&gt;compute_next()); }</div>
 </div><!-- fragment -->
 </div>
@@ -186,7 +231,7 @@ Private Attributes</h2></td></tr>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">value_type</a> catalan_numbers::compute_next </td>
+          <td class="memname">value_type catalan_numbers::compute_next </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td></td>
@@ -198,13 +243,13 @@ Private Attributes</h2></td></tr>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html#l00026">26</a> of file <a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html">catalan_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   26</span>                              {</div>
 <div class="line"><span class="lineno">   27</span>        <span class="keywordflow">return</span> std::transform_reduce(known.begin(), known.end(), known.rbegin(),</div>
-<div class="line"><span class="lineno">   28</span>                                     <span class="keyword">static_cast&lt;</span>value_type<span class="keyword">&gt;</span>(0), <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/plus.html">std::plus&lt;&gt;</a>(),</div>
-<div class="line"><span class="lineno">   29</span>                                     <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/multiplies.html">std::multiplies&lt;&gt;</a>());</div>
+<div class="line"><span class="lineno">   28</span>                                     <span class="keyword">static_cast&lt;</span>value_type<span class="keyword">&gt;</span>(0), std::plus&lt;&gt;(),</div>
+<div class="line"><span class="lineno">   29</span>                                     std::multiplies&lt;&gt;());</div>
 <div class="line"><span class="lineno">   30</span>    }</div>
-<div class="ttc" id="amultiplies_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/functional/multiplies.html">std::multiplies</a></div></div>
-<div class="ttc" id="aplus_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/functional/plus.html">std::plus</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -218,9 +263,9 @@ Private Attributes</h2></td></tr>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">value_type</a> catalan_numbers::get </td>
+          <td class="memname">value_type catalan_numbers::get </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></td>          <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
+          <td class="paramtype">std::size_t</td>          <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -233,6 +278,8 @@ Private Attributes</h2></td></tr>
 
 <p>computes the n-th Catalan number and updates the cache. </p>
 <dl class="section return"><dt>Returns</dt><dd>the n-th Catalan number </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html">catalan_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   39</span>                                {</div>
 <div class="line"><span class="lineno">   40</span>        <span class="keywordflow">while</span> (known.size() &lt;= n) {</div>
 <div class="line"><span class="lineno">   41</span>            this-&gt;add();</div>
@@ -253,7 +300,7 @@ Private Attributes</h2></td></tr>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">value_type</a>&gt; catalan_numbers::known {1, 1}</td>
+          <td class="memname">std::vector&lt;value_type&gt; catalan_numbers::known {1, 1}</td>
         </tr>
       </table>
   </td>
@@ -262,12 +309,14 @@ Private Attributes</h2></td></tr>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html#l00024">24</a> of file <a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html">catalan_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   24</span>{1, 1};</div>
 </div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>dynamic_programming/<a class="el" href="../../de/dd9/catalan__numbers_8cpp.html">catalan_numbers.cpp</a></li>
+<li>dynamic_programming/<a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html">catalan_numbers.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dc/d25/structdata__structures_1_1_node-members.html b/dc/d25/structdata__structures_1_1_node-members.html
index 97f47ffb5..d2799770d 100644
--- a/dc/d25/structdata__structures_1_1_node-members.html
+++ b/dc/d25/structdata__structures_1_1_node-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html b/dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html
index 42a450d5d..64532eccf 100644
--- a/dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html
+++ b/dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: count_of_trailing_ciphers_in_factorial_n Namespace Reference</title>
+<title>TheAlgorithms/C++: count_of_trailing_ciphers_in_factorial_n Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp.html b/dc/d38/ordinary__least__squares__regressor_8cpp.html
index 2f6739bed..4fd085484 100644
--- a/dc/d38/ordinary__least__squares__regressor_8cpp.html
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: machine_learning/ordinary_least_squares_regressor.cpp File Reference</title>
+<title>TheAlgorithms/C++: machine_learning/ordinary_least_squares_regressor.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,50 +139,52 @@ Include dependency graph for ordinary_least_squares_regressor.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d4b/ordinary__least__squares__regressor_8cpp__incl.svg" width="424" height="126"><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">
+</div>
+<p><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a7075a0fccad9b2d79be0275bfe8948d4" id="r_a7075a0fccad9b2d79be0275bfe8948d4"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a7075a0fccad9b2d79be0275bfe8948d4"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a7075a0fccad9b2d79be0275bfe8948d4">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; const &amp;v)</td></tr>
+<tr class="memitem:a7075a0fccad9b2d79be0275bfe8948d4"><td class="memTemplItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a7075a0fccad9b2d79be0275bfe8948d4">operator&lt;&lt;</a> (std::ostream &amp;out, std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;v)</td></tr>
 <tr class="separator:a7075a0fccad9b2d79be0275bfe8948d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ab1ad727903d7817c2758d25bcb52cbc8" id="r_ab1ad727903d7817c2758d25bcb52cbc8"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ab1ad727903d7817c2758d25bcb52cbc8"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ab1ad727903d7817c2758d25bcb52cbc8">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;v)</td></tr>
+<tr class="memitem:ab1ad727903d7817c2758d25bcb52cbc8"><td class="memTemplItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ab1ad727903d7817c2758d25bcb52cbc8">operator&lt;&lt;</a> (std::ostream &amp;out, std::vector&lt; T &gt; const &amp;v)</td></tr>
 <tr class="separator:ab1ad727903d7817c2758d25bcb52cbc8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a8fa731952b0ee3bc7ec51c51ed21911e" id="r_a8fa731952b0ee3bc7ec51c51ed21911e"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a8fa731952b0ee3bc7ec51c51ed21911e"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a8fa731952b0ee3bc7ec51c51ed21911e">is_square</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; const &amp;A)</td></tr>
+<tr class="memitem:a8fa731952b0ee3bc7ec51c51ed21911e"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a8fa731952b0ee3bc7ec51c51ed21911e">is_square</a> (std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A)</td></tr>
 <tr class="separator:a8fa731952b0ee3bc7ec51c51ed21911e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae2edd40354a1ca7aeaee3d1e3589e713" id="r_ae2edd40354a1ca7aeaee3d1e3589e713"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ae2edd40354a1ca7aeaee3d1e3589e713"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae2edd40354a1ca7aeaee3d1e3589e713">operator*</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; const &amp;A, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; const &amp;B)</td></tr>
+<tr class="memitem:ae2edd40354a1ca7aeaee3d1e3589e713"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae2edd40354a1ca7aeaee3d1e3589e713">operator*</a> (std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A, std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;B)</td></tr>
 <tr class="separator:ae2edd40354a1ca7aeaee3d1e3589e713"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a865e8d26a01962cc93aca66e71346f37" id="r_a865e8d26a01962cc93aca66e71346f37"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a865e8d26a01962cc93aca66e71346f37"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a865e8d26a01962cc93aca66e71346f37">operator*</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; const &amp;A, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;B)</td></tr>
+<tr class="memitem:a865e8d26a01962cc93aca66e71346f37"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a865e8d26a01962cc93aca66e71346f37">operator*</a> (std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A, std::vector&lt; T &gt; const &amp;B)</td></tr>
 <tr class="separator:a865e8d26a01962cc93aca66e71346f37"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a207b3a99fd5974d3117e0b0ac0aad234" id="r_a207b3a99fd5974d3117e0b0ac0aad234"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a207b3a99fd5974d3117e0b0ac0aad234"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; float &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a207b3a99fd5974d3117e0b0ac0aad234">operator*</a> (float const scalar, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;A)</td></tr>
+<tr class="memitem:a207b3a99fd5974d3117e0b0ac0aad234"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; float &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a207b3a99fd5974d3117e0b0ac0aad234">operator*</a> (float const scalar, std::vector&lt; T &gt; const &amp;A)</td></tr>
 <tr class="separator:a207b3a99fd5974d3117e0b0ac0aad234"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a42535e20e97d85aa61271e0894cc0359" id="r_a42535e20e97d85aa61271e0894cc0359"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a42535e20e97d85aa61271e0894cc0359"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; float &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a42535e20e97d85aa61271e0894cc0359">operator*</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;A, float const scalar)</td></tr>
+<tr class="memitem:a42535e20e97d85aa61271e0894cc0359"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; float &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a42535e20e97d85aa61271e0894cc0359">operator*</a> (std::vector&lt; T &gt; const &amp;A, float const scalar)</td></tr>
 <tr class="separator:a42535e20e97d85aa61271e0894cc0359"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a7a2d742b9a3ae7b85292e1f86428bb4f" id="r_a7a2d742b9a3ae7b85292e1f86428bb4f"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a7a2d742b9a3ae7b85292e1f86428bb4f"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; float &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a7a2d742b9a3ae7b85292e1f86428bb4f">operator/</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;A, float const scalar)</td></tr>
+<tr class="memitem:a7a2d742b9a3ae7b85292e1f86428bb4f"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; float &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a7a2d742b9a3ae7b85292e1f86428bb4f">operator/</a> (std::vector&lt; T &gt; const &amp;A, float const scalar)</td></tr>
 <tr class="separator:a7a2d742b9a3ae7b85292e1f86428bb4f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a4a6a560dbdd0177633783b72db37dc19" id="r_a4a6a560dbdd0177633783b72db37dc19"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a4a6a560dbdd0177633783b72db37dc19"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a4a6a560dbdd0177633783b72db37dc19">operator-</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;A, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;B)</td></tr>
+<tr class="memitem:a4a6a560dbdd0177633783b72db37dc19"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a4a6a560dbdd0177633783b72db37dc19">operator-</a> (std::vector&lt; T &gt; const &amp;A, std::vector&lt; T &gt; const &amp;B)</td></tr>
 <tr class="separator:a4a6a560dbdd0177633783b72db37dc19"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a01e6c7bf2b09272578b9c5819ce0f36f" id="r_a01e6c7bf2b09272578b9c5819ce0f36f"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a01e6c7bf2b09272578b9c5819ce0f36f"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a01e6c7bf2b09272578b9c5819ce0f36f">operator+</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;A, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;B)</td></tr>
+<tr class="memitem:a01e6c7bf2b09272578b9c5819ce0f36f"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a01e6c7bf2b09272578b9c5819ce0f36f">operator+</a> (std::vector&lt; T &gt; const &amp;A, std::vector&lt; T &gt; const &amp;B)</td></tr>
 <tr class="separator:a01e6c7bf2b09272578b9c5819ce0f36f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af7243bdc6ae3c7169f01b85bb226e66a" id="r_af7243bdc6ae3c7169f01b85bb226e66a"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:af7243bdc6ae3c7169f01b85bb226e66a"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; float &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af7243bdc6ae3c7169f01b85bb226e66a">get_inverse</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; const &amp;A)</td></tr>
+<tr class="memitem:af7243bdc6ae3c7169f01b85bb226e66a"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; float &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af7243bdc6ae3c7169f01b85bb226e66a">get_inverse</a> (std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A)</td></tr>
 <tr class="separator:af7243bdc6ae3c7169f01b85bb226e66a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a21c80569aaffb7bf1657e54fa4b97deb" id="r_a21c80569aaffb7bf1657e54fa4b97deb"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a21c80569aaffb7bf1657e54fa4b97deb"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a21c80569aaffb7bf1657e54fa4b97deb">get_transpose</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; const &amp;A)</td></tr>
+<tr class="memitem:a21c80569aaffb7bf1657e54fa4b97deb"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; T &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a21c80569aaffb7bf1657e54fa4b97deb">get_transpose</a> (std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A)</td></tr>
 <tr class="separator:a21c80569aaffb7bf1657e54fa4b97deb"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aaddc683af581b51351e1023d2a01ef3b" id="r_aaddc683af581b51351e1023d2a01ef3b"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:aaddc683af581b51351e1023d2a01ef3b"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; float &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aaddc683af581b51351e1023d2a01ef3b">fit_OLS_regressor</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; const &amp;X, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;Y)</td></tr>
+<tr class="memitem:aaddc683af581b51351e1023d2a01ef3b"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; float &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#aaddc683af581b51351e1023d2a01ef3b">fit_OLS_regressor</a> (std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;X, std::vector&lt; T &gt; const &amp;Y)</td></tr>
 <tr class="separator:aaddc683af581b51351e1023d2a01ef3b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ade6e463f37878fe2a219f927c65b5493" id="r_ade6e463f37878fe2a219f927c65b5493"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ade6e463f37878fe2a219f927c65b5493"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; float &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ade6e463f37878fe2a219f927c65b5493">predict_OLS_regressor</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; const &amp;X, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; float &gt; const &amp;beta)</td></tr>
+<tr class="memitem:ade6e463f37878fe2a219f927c65b5493"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; float &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ade6e463f37878fe2a219f927c65b5493">predict_OLS_regressor</a> (std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;X, std::vector&lt; float &gt; const &amp;beta)</td></tr>
 <tr class="separator:ade6e463f37878fe2a219f927c65b5493"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a4261f3c3c3dfdb86f3004eb8aaffea8d" id="r_a4261f3c3c3dfdb86f3004eb8aaffea8d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4261f3c3c3dfdb86f3004eb8aaffea8d">ols_test</a> ()</td></tr>
 <tr class="separator:a4261f3c3c3dfdb86f3004eb8aaffea8d"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -176,6 +195,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Linear regression example using <a href="https://en.wikipedia.org/wiki/Ordinary_least_squares" target="_blank">Ordinary least squares</a> </p>
 <p>Program that gets the number of data samples and number of features per sample along with output per sample. It applies OLS regression to compute the regression output for additional test data samples.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html">ordinary_least_squares_regressor.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="aaddc683af581b51351e1023d2a01ef3b" name="aaddc683af581b51351e1023d2a01ef3b"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aaddc683af581b51351e1023d2a01ef3b">&#9670;&#160;</a></span>fit_OLS_regressor()</h2>
@@ -186,14 +207,14 @@ Functions</h2></td></tr>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; float &gt; fit_OLS_regressor </td>
+          <td class="memname">std::vector&lt; float &gt; fit_OLS_regressor </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>Y</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>Y</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -208,36 +229,30 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>fitted regression model polynomial coefficients </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00321">321</a> of file <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html">ordinary_least_squares_regressor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  322</span>                                                            {</div>
 <div class="line"><span class="lineno">  323</span>    <span class="comment">// NxF</span></div>
-<div class="line"><span class="lineno">  324</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;T&gt;</a>&gt; X2 = X;</div>
-<div class="line"><span class="lineno">  325</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; X2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
+<div class="line"><span class="lineno">  324</span>    std::vector&lt;std::vector&lt;T&gt;&gt; X2 = X;</div>
+<div class="line"><span class="lineno">  325</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; X2.size(); i++) {</div>
 <div class="line"><span class="lineno">  326</span>        <span class="comment">// add Y-intercept -&gt; Nx(F+1)</span></div>
-<div class="line"><span class="lineno">  327</span>        X2[i].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(1);</div>
+<div class="line"><span class="lineno">  327</span>        X2[i].push_back(1);</div>
 <div class="line"><span class="lineno">  328</span>    }</div>
 <div class="line"><span class="lineno">  329</span>    <span class="comment">// (F+1)xN</span></div>
-<div class="line"><span class="lineno">  330</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;T&gt;</a>&gt; Xt = <a class="code hl_function" href="#a21c80569aaffb7bf1657e54fa4b97deb">get_transpose</a>(X2);</div>
+<div class="line"><span class="lineno">  330</span>    std::vector&lt;std::vector&lt;T&gt;&gt; Xt = <a class="code hl_function" href="#a21c80569aaffb7bf1657e54fa4b97deb">get_transpose</a>(X2);</div>
 <div class="line"><span class="lineno">  331</span>    <span class="comment">// (F+1)x(F+1)</span></div>
-<div class="line"><span class="lineno">  332</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;T&gt;</a>&gt; tmp = <a class="code hl_function" href="#af7243bdc6ae3c7169f01b85bb226e66a">get_inverse</a>(Xt * X2);</div>
+<div class="line"><span class="lineno">  332</span>    std::vector&lt;std::vector&lt;T&gt;&gt; tmp = <a class="code hl_function" href="#af7243bdc6ae3c7169f01b85bb226e66a">get_inverse</a>(Xt * X2);</div>
 <div class="line"><span class="lineno">  333</span>    <span class="comment">// (F+1)xN</span></div>
-<div class="line"><span class="lineno">  334</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;float&gt;</a>&gt; out = tmp * Xt;</div>
+<div class="line"><span class="lineno">  334</span>    std::vector&lt;std::vector&lt;float&gt;&gt; out = tmp * Xt;</div>
 <div class="line"><span class="lineno">  335</span>    <span class="comment">// cout &lt;&lt; endl</span></div>
 <div class="line"><span class="lineno">  336</span>    <span class="comment">//      &lt;&lt; &quot;Projection matrix: &quot; &lt;&lt; X2 * out &lt;&lt; endl;</span></div>
 <div class="line"><span class="lineno">  337</span> </div>
 <div class="line"><span class="lineno">  338</span>    <span class="comment">// Fx1,1    -&gt; (F+1)^th element is the independent constant</span></div>
 <div class="line"><span class="lineno">  339</span>    <span class="keywordflow">return</span> out * Y;</div>
 <div class="line"><span class="lineno">  340</span>}</div>
-<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a21c80569aaffb7bf1657e54fa4b97deb"><div class="ttname"><a href="#a21c80569aaffb7bf1657e54fa4b97deb">get_transpose</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; T &gt; &gt; get_transpose(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A)</div><div class="ttdef"><b>Definition</b> ordinary_least_squares_regressor.cpp:300</div></div>
-<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_af7243bdc6ae3c7169f01b85bb226e66a"><div class="ttname"><a href="#af7243bdc6ae3c7169f01b85bb226e66a">get_inverse</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; float &gt; &gt; get_inverse(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A)</div><div class="ttdef"><b>Definition</b> ordinary_least_squares_regressor.cpp:226</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="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>
-</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_aaddc683af581b51351e1023d2a01ef3b_cgraph.svg" width="466" height="208"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a21c80569aaffb7bf1657e54fa4b97deb"><div class="ttname"><a href="#a21c80569aaffb7bf1657e54fa4b97deb">get_transpose</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; T &gt; &gt; get_transpose(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00300">ordinary_least_squares_regressor.cpp:300</a></div></div>
+<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_af7243bdc6ae3c7169f01b85bb226e66a"><div class="ttname"><a href="#af7243bdc6ae3c7169f01b85bb226e66a">get_inverse</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; float &gt; &gt; get_inverse(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00226">ordinary_least_squares_regressor.cpp:226</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af7243bdc6ae3c7169f01b85bb226e66a" name="af7243bdc6ae3c7169f01b85bb226e66a"></a>
@@ -249,36 +264,38 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; float &gt; &gt; get_inverse </td>
+          <td class="memname">std::vector&lt; std::vector&lt; float &gt; &gt; get_inverse </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>Get matrix inverse using Row-trasnformations. Given matrix must be a square and non-singular. </p><dl class="section return"><dt>Returns</dt><dd>inverse matrix </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00226">226</a> of file <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html">ordinary_least_squares_regressor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  227</span>                                      {</div>
 <div class="line"><span class="lineno">  228</span>    <span class="comment">// Assuming A is square matrix</span></div>
-<div class="line"><span class="lineno">  229</span>    <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 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">  229</span>    <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = A.size();</div>
 <div class="line"><span class="lineno">  230</span> </div>
-<div class="line"><span class="lineno">  231</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;float&gt;</a>&gt; inverse(N);</div>
+<div class="line"><span class="lineno">  231</span>    std::vector&lt;std::vector&lt;float&gt;&gt; inverse(N);</div>
 <div class="line"><span class="lineno">  232</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; row++) {</div>
 <div class="line"><span class="lineno">  233</span>        <span class="comment">// preallocatae a resultant identity matrix</span></div>
-<div class="line"><span class="lineno">  234</span>        inverse[row] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a>(N);</div>
+<div class="line"><span class="lineno">  234</span>        inverse[row] = std::vector&lt;float&gt;(N);</div>
 <div class="line"><span class="lineno">  235</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; col++) {</div>
 <div class="line"><span class="lineno">  236</span>            inverse[row][col] = (row == col) ? 1.f : 0.f;</div>
 <div class="line"><span class="lineno">  237</span>        }</div>
 <div class="line"><span class="lineno">  238</span>    }</div>
 <div class="line"><span class="lineno">  239</span> </div>
 <div class="line"><span class="lineno">  240</span>    <span class="keywordflow">if</span> (!<a class="code hl_function" href="#a8fa731952b0ee3bc7ec51c51ed21911e">is_square</a>(A)) {</div>
-<div class="line"><span class="lineno">  241</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;A must be a square matrix!&quot;</span> &lt;&lt; <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">  241</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;A must be a square matrix!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  242</span>        <span class="keywordflow">return</span> inverse;</div>
 <div class="line"><span class="lineno">  243</span>    }</div>
 <div class="line"><span class="lineno">  244</span> </div>
 <div class="line"><span class="lineno">  245</span>    <span class="comment">// preallocatae a temporary matrix identical to A</span></div>
-<div class="line"><span class="lineno">  246</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;float&gt;</a>&gt; temp(N);</div>
+<div class="line"><span class="lineno">  246</span>    std::vector&lt;std::vector&lt;float&gt;&gt; temp(N);</div>
 <div class="line"><span class="lineno">  247</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; row++) {</div>
-<div class="line"><span class="lineno">  248</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> v(N);</div>
+<div class="line"><span class="lineno">  248</span>        std::vector&lt;float&gt; v(N);</div>
 <div class="line"><span class="lineno">  249</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; col++) {</div>
 <div class="line"><span class="lineno">  250</span>            v[col] = <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(A[row][col]);</div>
 <div class="line"><span class="lineno">  251</span>        }</div>
@@ -303,7 +320,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  270</span> </div>
 <div class="line"><span class="lineno">  271</span>        <span class="keywordflow">if</span> (temp[row][row] == 0) {</div>
 <div class="line"><span class="lineno">  272</span>            <span class="comment">// Probably a low-rank matrix and hence singular</span></div>
-<div class="line"><span class="lineno">  273</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Low-rank matrix, no inverse!&quot;</span> &lt;&lt; <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">  273</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Low-rank matrix, no inverse!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  274</span>            <span class="keywordflow">return</span> inverse;</div>
 <div class="line"><span class="lineno">  275</span>        }</div>
 <div class="line"><span class="lineno">  276</span> </div>
@@ -324,16 +341,9 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  291</span> </div>
 <div class="line"><span class="lineno">  292</span>    <span class="keywordflow">return</span> inverse;</div>
 <div class="line"><span class="lineno">  293</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::cerr</a></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="aordinary__least__squares__regressor_8cpp_html_a8fa731952b0ee3bc7ec51c51ed21911e"><div class="ttname"><a href="#a8fa731952b0ee3bc7ec51c51ed21911e">is_square</a></div><div class="ttdeci">bool is_square(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A)</div><div class="ttdef"><b>Definition</b> ordinary_least_squares_regressor.cpp:59</div></div>
-<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d38/ordinary__least__squares__regressor_8cpp_af7243bdc6ae3c7169f01b85bb226e66a_cgraph.svg" width="224" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a8fa731952b0ee3bc7ec51c51ed21911e"><div class="ttname"><a href="#a8fa731952b0ee3bc7ec51c51ed21911e">is_square</a></div><div class="ttdeci">bool is_square(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00059">ordinary_least_squares_regressor.cpp:59</a></div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a21c80569aaffb7bf1657e54fa4b97deb" name="a21c80569aaffb7bf1657e54fa4b97deb"></a>
@@ -345,26 +355,28 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; get_transpose </td>
+          <td class="memname">std::vector&lt; std::vector&lt; T &gt; &gt; get_transpose </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>matrix transpose </p><dl class="section return"><dt>Returns</dt><dd>resultant matrix </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00300">300</a> of file <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html">ordinary_least_squares_regressor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  301</span>                                      {</div>
-<div class="line"><span class="lineno">  302</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;T&gt;</a>&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(A[0].size());</div>
+<div class="line"><span class="lineno">  302</span>    std::vector&lt;std::vector&lt;T&gt;&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(A[0].size());</div>
 <div class="line"><span class="lineno">  303</span> </div>
-<div class="line"><span class="lineno">  304</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; A[0].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); row++) {</div>
-<div class="line"><span class="lineno">  305</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> v(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">  306</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; A.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); col++) v[col] = A[col][row];</div>
+<div class="line"><span class="lineno">  304</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; A[0].size(); row++) {</div>
+<div class="line"><span class="lineno">  305</span>        std::vector&lt;T&gt; v(A.size());</div>
+<div class="line"><span class="lineno">  306</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; A.size(); col++) v[col] = A[col][row];</div>
 <div class="line"><span class="lineno">  307</span> </div>
 <div class="line"><span class="lineno">  308</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>[row] = v;</div>
 <div class="line"><span class="lineno">  309</span>    }</div>
 <div class="line"><span class="lineno">  310</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  311</span>}</div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -382,7 +394,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">bool is_square </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -393,9 +405,11 @@ template&lt;typename T &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>function to check if given matrix is a square matrix </p><dl class="section return"><dt>Returns</dt><dd>1 if true, 0 if false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html">ordinary_least_squares_regressor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   59</span>                                                        {</div>
 <div class="line"><span class="lineno">   60</span>    <span class="comment">// Assuming A is square matrix</span></div>
-<div class="line"><span class="lineno">   61</span>    <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 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">   61</span>    <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = A.size();</div>
 <div class="line"><span class="lineno">   62</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
 <div class="line"><span class="lineno">   63</span>        <span class="keywordflow">if</span> (A[i].size() != N) {</div>
 <div class="line"><span class="lineno">   64</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
@@ -421,70 +435,66 @@ template&lt;typename T &gt; </div>
       </table>
 </div><div class="memdoc">
 <p>main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00423">423</a> of file <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html">ordinary_least_squares_regressor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  423</span>           {</div>
 <div class="line"><span class="lineno">  424</span>    <a class="code hl_function" href="#a4261f3c3c3dfdb86f3004eb8aaffea8d">ols_test</a>();</div>
 <div class="line"><span class="lineno">  425</span> </div>
 <div class="line"><span class="lineno">  426</span>    <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 0, F = 0;</div>
 <div class="line"><span class="lineno">  427</span> </div>
-<div class="line"><span class="lineno">  428</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter number of features: &quot;</span>;</div>
+<div class="line"><span class="lineno">  428</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter number of features: &quot;</span>;</div>
 <div class="line"><span class="lineno">  429</span>    <span class="comment">// number of features = columns</span></div>
-<div class="line"><span class="lineno">  430</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; F;</div>
-<div class="line"><span class="lineno">  431</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter number of samples: &quot;</span>;</div>
+<div class="line"><span class="lineno">  430</span>    std::cin &gt;&gt; F;</div>
+<div class="line"><span class="lineno">  431</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter number of samples: &quot;</span>;</div>
 <div class="line"><span class="lineno">  432</span>    <span class="comment">// number of samples = rows</span></div>
-<div class="line"><span class="lineno">  433</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>;</div>
+<div class="line"><span class="lineno">  433</span>    std::cin &gt;&gt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>;</div>
 <div class="line"><span class="lineno">  434</span> </div>
-<div class="line"><span class="lineno">  435</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;float&gt;</a>&gt; <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>(N);</div>
-<div class="line"><span class="lineno">  436</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> Y(N);</div>
+<div class="line"><span class="lineno">  435</span>    std::vector&lt;std::vector&lt;float&gt;&gt; <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>(N);</div>
+<div class="line"><span class="lineno">  436</span>    std::vector&lt;float&gt; Y(N);</div>
 <div class="line"><span class="lineno">  437</span> </div>
-<div class="line"><span class="lineno">  438</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div>
+<div class="line"><span class="lineno">  438</span>    std::cout</div>
 <div class="line"><span class="lineno">  439</span>        &lt;&lt; <span class="stringliteral">&quot;Enter training data. Per sample, provide features and one output.&quot;</span></div>
-<div class="line"><span class="lineno">  440</span>        &lt;&lt; <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">  440</span>        &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  441</span> </div>
 <div class="line"><span class="lineno">  442</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> rows = 0; rows &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; rows++) {</div>
-<div class="line"><span class="lineno">  443</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> v(F);</div>
-<div class="line"><span class="lineno">  444</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Sample# &quot;</span> &lt;&lt; rows + 1 &lt;&lt; <span class="stringliteral">&quot;: &quot;</span>;</div>
+<div class="line"><span class="lineno">  443</span>        std::vector&lt;float&gt; v(F);</div>
+<div class="line"><span class="lineno">  444</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Sample# &quot;</span> &lt;&lt; rows + 1 &lt;&lt; <span class="stringliteral">&quot;: &quot;</span>;</div>
 <div class="line"><span class="lineno">  445</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> cols = 0; cols &lt; F; cols++) {</div>
 <div class="line"><span class="lineno">  446</span>            <span class="comment">// get the F features</span></div>
-<div class="line"><span class="lineno">  447</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; v[cols];</div>
+<div class="line"><span class="lineno">  447</span>            std::cin &gt;&gt; v[cols];</div>
 <div class="line"><span class="lineno">  448</span>        }</div>
 <div class="line"><span class="lineno">  449</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[rows] = v;</div>
 <div class="line"><span class="lineno">  450</span>        <span class="comment">// get the corresponding output</span></div>
-<div class="line"><span class="lineno">  451</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; Y[rows];</div>
+<div class="line"><span class="lineno">  451</span>        std::cin &gt;&gt; Y[rows];</div>
 <div class="line"><span class="lineno">  452</span>    }</div>
 <div class="line"><span class="lineno">  453</span> </div>
-<div class="line"><span class="lineno">  454</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> beta = <a class="code hl_function" href="#aaddc683af581b51351e1023d2a01ef3b">fit_OLS_regressor</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, Y);</div>
-<div class="line"><span class="lineno">  455</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <span class="stringliteral">&quot;beta:&quot;</span> &lt;&lt; beta &lt;&lt; <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">  454</span>    std::vector&lt;float&gt; beta = <a class="code hl_function" href="#aaddc683af581b51351e1023d2a01ef3b">fit_OLS_regressor</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, Y);</div>
+<div class="line"><span class="lineno">  455</span>    std::cout &lt;&lt; std::endl &lt;&lt; std::endl &lt;&lt; <span class="stringliteral">&quot;beta:&quot;</span> &lt;&lt; beta &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  456</span> </div>
 <div class="line"><span class="lineno">  457</span>    <span class="keywordtype">size_t</span> T = 0;</div>
-<div class="line"><span class="lineno">  458</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter number of test samples: &quot;</span>;</div>
+<div class="line"><span class="lineno">  458</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter number of test samples: &quot;</span>;</div>
 <div class="line"><span class="lineno">  459</span>    <span class="comment">// number of test sample inputs</span></div>
-<div class="line"><span class="lineno">  460</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; T;</div>
-<div class="line"><span class="lineno">  461</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;float&gt;</a>&gt; data2(T);</div>
+<div class="line"><span class="lineno">  460</span>    std::cin &gt;&gt; T;</div>
+<div class="line"><span class="lineno">  461</span>    std::vector&lt;std::vector&lt;float&gt;&gt; data2(T);</div>
 <div class="line"><span class="lineno">  462</span>    <span class="comment">// vector&lt;float&gt; Y2(T);</span></div>
 <div class="line"><span class="lineno">  463</span> </div>
 <div class="line"><span class="lineno">  464</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> rows = 0; rows &lt; T; rows++) {</div>
-<div class="line"><span class="lineno">  465</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Sample# &quot;</span> &lt;&lt; rows + 1 &lt;&lt; <span class="stringliteral">&quot;: &quot;</span>;</div>
-<div class="line"><span class="lineno">  466</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> v(F);</div>
+<div class="line"><span class="lineno">  465</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Sample# &quot;</span> &lt;&lt; rows + 1 &lt;&lt; <span class="stringliteral">&quot;: &quot;</span>;</div>
+<div class="line"><span class="lineno">  466</span>        std::vector&lt;float&gt; v(F);</div>
 <div class="line"><span class="lineno">  467</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> cols = 0; cols &lt; F; cols++) std::cin &gt;&gt; v[cols];</div>
 <div class="line"><span class="lineno">  468</span>        data2[rows] = v;</div>
 <div class="line"><span class="lineno">  469</span>    }</div>
 <div class="line"><span class="lineno">  470</span> </div>
-<div class="line"><span class="lineno">  471</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> out = <a class="code hl_function" href="#ade6e463f37878fe2a219f927c65b5493">predict_OLS_regressor</a>(data2, beta);</div>
-<div class="line"><span class="lineno">  472</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> rows = 0; rows &lt; T; rows++) <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; out[rows] &lt;&lt; <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">  471</span>    std::vector&lt;float&gt; out = <a class="code hl_function" href="#ade6e463f37878fe2a219f927c65b5493">predict_OLS_regressor</a>(data2, beta);</div>
+<div class="line"><span class="lineno">  472</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> rows = 0; rows &lt; T; rows++) std::cout &lt;&lt; out[rows] &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  473</span> </div>
 <div class="line"><span class="lineno">  474</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  475</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
-<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a4261f3c3c3dfdb86f3004eb8aaffea8d"><div class="ttname"><a href="#a4261f3c3c3dfdb86f3004eb8aaffea8d">ols_test</a></div><div class="ttdeci">void ols_test()</div><div class="ttdef"><b>Definition</b> ordinary_least_squares_regressor.cpp:369</div></div>
-<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_aaddc683af581b51351e1023d2a01ef3b"><div class="ttname"><a href="#aaddc683af581b51351e1023d2a01ef3b">fit_OLS_regressor</a></div><div class="ttdeci">std::vector&lt; float &gt; fit_OLS_regressor(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;X, std::vector&lt; T &gt; const &amp;Y)</div><div class="ttdef"><b>Definition</b> ordinary_least_squares_regressor.cpp:321</div></div>
-<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_ade6e463f37878fe2a219f927c65b5493"><div class="ttname"><a href="#ade6e463f37878fe2a219f927c65b5493">predict_OLS_regressor</a></div><div class="ttdeci">std::vector&lt; float &gt; predict_OLS_regressor(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;X, std::vector&lt; float &gt; const &amp;beta)</div><div class="ttdef"><b>Definition</b> ordinary_least_squares_regressor.cpp:352</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="529"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a4261f3c3c3dfdb86f3004eb8aaffea8d"><div class="ttname"><a href="#a4261f3c3c3dfdb86f3004eb8aaffea8d">ols_test</a></div><div class="ttdeci">void ols_test()</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00369">ordinary_least_squares_regressor.cpp:369</a></div></div>
+<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_aaddc683af581b51351e1023d2a01ef3b"><div class="ttname"><a href="#aaddc683af581b51351e1023d2a01ef3b">fit_OLS_regressor</a></div><div class="ttdeci">std::vector&lt; float &gt; fit_OLS_regressor(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;X, std::vector&lt; T &gt; const &amp;Y)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00321">ordinary_least_squares_regressor.cpp:321</a></div></div>
+<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_ade6e463f37878fe2a219f927c65b5493"><div class="ttname"><a href="#ade6e463f37878fe2a219f927c65b5493">predict_OLS_regressor</a></div><div class="ttdeci">std::vector&lt; float &gt; predict_OLS_regressor(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;X, std::vector&lt; float &gt; const &amp;beta)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00352">ordinary_least_squares_regressor.cpp:352</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4261f3c3c3dfdb86f3004eb8aaffea8d" name="a4261f3c3c3dfdb86f3004eb8aaffea8d"></a>
@@ -502,62 +512,59 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Self test checks </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00369">369</a> of file <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html">ordinary_least_squares_regressor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  369</span>                {</div>
 <div class="line"><span class="lineno">  370</span>    <span class="keywordtype">int</span> F = 3, <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 5;</div>
 <div class="line"><span class="lineno">  371</span> </div>
 <div class="line"><span class="lineno">  372</span>    <span class="comment">/* test function = x^2 -5 */</span></div>
-<div class="line"><span class="lineno">  373</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 (quadratic function)....&quot;</span>;</div>
+<div class="line"><span class="lineno">  373</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 (quadratic function)....&quot;</span>;</div>
 <div class="line"><span class="lineno">  374</span>    <span class="comment">// create training data set with features = x, x^2, x^3</span></div>
-<div class="line"><span class="lineno">  375</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;float&gt;</a>&gt; data1(</div>
+<div class="line"><span class="lineno">  375</span>    std::vector&lt;std::vector&lt;float&gt;&gt; data1(</div>
 <div class="line"><span class="lineno">  376</span>        {{-5, 25, -125}, {-1, 1, -1}, {0, 0, 0}, {1, 1, 1}, {6, 36, 216}});</div>
 <div class="line"><span class="lineno">  377</span>    <span class="comment">// create corresponding outputs</span></div>
-<div class="line"><span class="lineno">  378</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> Y1({20, -4, -5, -4, 31});</div>
+<div class="line"><span class="lineno">  378</span>    std::vector&lt;float&gt; Y1({20, -4, -5, -4, 31});</div>
 <div class="line"><span class="lineno">  379</span>    <span class="comment">// perform regression modelling</span></div>
-<div class="line"><span class="lineno">  380</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> beta1 = <a class="code hl_function" href="#aaddc683af581b51351e1023d2a01ef3b">fit_OLS_regressor</a>(data1, Y1);</div>
+<div class="line"><span class="lineno">  380</span>    std::vector&lt;float&gt; beta1 = <a class="code hl_function" href="#aaddc683af581b51351e1023d2a01ef3b">fit_OLS_regressor</a>(data1, Y1);</div>
 <div class="line"><span class="lineno">  381</span>    <span class="comment">// create test data set with same features = x, x^2, x^3</span></div>
-<div class="line"><span class="lineno">  382</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;float&gt;</a>&gt; test_data1(</div>
+<div class="line"><span class="lineno">  382</span>    std::vector&lt;std::vector&lt;float&gt;&gt; test_data1(</div>
 <div class="line"><span class="lineno">  383</span>        {{-2, 4, -8}, {2, 4, 8}, {-10, 100, -1000}, {10, 100, 1000}});</div>
 <div class="line"><span class="lineno">  384</span>    <span class="comment">// expected regression outputs</span></div>
-<div class="line"><span class="lineno">  385</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> expected1({-1, -1, 95, 95});</div>
+<div class="line"><span class="lineno">  385</span>    std::vector&lt;float&gt; expected1({-1, -1, 95, 95});</div>
 <div class="line"><span class="lineno">  386</span>    <span class="comment">// predicted regression outputs</span></div>
-<div class="line"><span class="lineno">  387</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> out1 = <a class="code hl_function" href="#ade6e463f37878fe2a219f927c65b5493">predict_OLS_regressor</a>(test_data1, beta1);</div>
+<div class="line"><span class="lineno">  387</span>    std::vector&lt;float&gt; out1 = <a class="code hl_function" href="#ade6e463f37878fe2a219f927c65b5493">predict_OLS_regressor</a>(test_data1, beta1);</div>
 <div class="line"><span class="lineno">  388</span>    <span class="comment">// compare predicted results are within +-0.01 limit of expected</span></div>
-<div class="line"><span class="lineno">  389</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> rows = 0; rows &lt; out1.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); rows++) {</div>
+<div class="line"><span class="lineno">  389</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> rows = 0; rows &lt; out1.size(); rows++) {</div>
 <div class="line"><span class="lineno">  390</span>        assert(std::abs(out1[rows] - expected1[rows]) &lt; 0.01);</div>
 <div class="line"><span class="lineno">  391</span>    }</div>
-<div class="line"><span class="lineno">  392</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  392</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  393</span> </div>
 <div class="line"><span class="lineno">  394</span>    <span class="comment">/* test function = x^3 + x^2 - 100 */</span></div>
-<div class="line"><span class="lineno">  395</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2 (cubic function)....&quot;</span>;</div>
+<div class="line"><span class="lineno">  395</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 (cubic function)....&quot;</span>;</div>
 <div class="line"><span class="lineno">  396</span>    <span class="comment">// create training data set with features = x, x^2, x^3</span></div>
-<div class="line"><span class="lineno">  397</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;float&gt;</a>&gt; data2(</div>
+<div class="line"><span class="lineno">  397</span>    std::vector&lt;std::vector&lt;float&gt;&gt; data2(</div>
 <div class="line"><span class="lineno">  398</span>        {{-5, 25, -125}, {-1, 1, -1}, {0, 0, 0}, {1, 1, 1}, {6, 36, 216}});</div>
 <div class="line"><span class="lineno">  399</span>    <span class="comment">// create corresponding outputs</span></div>
-<div class="line"><span class="lineno">  400</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> Y2({-200, -100, -100, 98, 152});</div>
+<div class="line"><span class="lineno">  400</span>    std::vector&lt;float&gt; Y2({-200, -100, -100, 98, 152});</div>
 <div class="line"><span class="lineno">  401</span>    <span class="comment">// perform regression modelling</span></div>
-<div class="line"><span class="lineno">  402</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> beta2 = <a class="code hl_function" href="#aaddc683af581b51351e1023d2a01ef3b">fit_OLS_regressor</a>(data2, Y2);</div>
+<div class="line"><span class="lineno">  402</span>    std::vector&lt;float&gt; beta2 = <a class="code hl_function" href="#aaddc683af581b51351e1023d2a01ef3b">fit_OLS_regressor</a>(data2, Y2);</div>
 <div class="line"><span class="lineno">  403</span>    <span class="comment">// create test data set with same features = x, x^2, x^3</span></div>
-<div class="line"><span class="lineno">  404</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;float&gt;</a>&gt; test_data2(</div>
+<div class="line"><span class="lineno">  404</span>    std::vector&lt;std::vector&lt;float&gt;&gt; test_data2(</div>
 <div class="line"><span class="lineno">  405</span>        {{-2, 4, -8}, {2, 4, 8}, {-10, 100, -1000}, {10, 100, 1000}});</div>
 <div class="line"><span class="lineno">  406</span>    <span class="comment">// expected regression outputs</span></div>
-<div class="line"><span class="lineno">  407</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> expected2({-104, -88, -1000, 1000});</div>
+<div class="line"><span class="lineno">  407</span>    std::vector&lt;float&gt; expected2({-104, -88, -1000, 1000});</div>
 <div class="line"><span class="lineno">  408</span>    <span class="comment">// predicted regression outputs</span></div>
-<div class="line"><span class="lineno">  409</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> out2 = <a class="code hl_function" href="#ade6e463f37878fe2a219f927c65b5493">predict_OLS_regressor</a>(test_data2, beta2);</div>
+<div class="line"><span class="lineno">  409</span>    std::vector&lt;float&gt; out2 = <a class="code hl_function" href="#ade6e463f37878fe2a219f927c65b5493">predict_OLS_regressor</a>(test_data2, beta2);</div>
 <div class="line"><span class="lineno">  410</span>    <span class="comment">// compare predicted results are within +-0.01 limit of expected</span></div>
-<div class="line"><span class="lineno">  411</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> rows = 0; rows &lt; out2.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); rows++) {</div>
+<div class="line"><span class="lineno">  411</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> rows = 0; rows &lt; out2.size(); rows++) {</div>
 <div class="line"><span class="lineno">  412</span>        assert(std::abs(out2[rows] - expected2[rows]) &lt; 0.01);</div>
 <div class="line"><span class="lineno">  413</span>    }</div>
-<div class="line"><span class="lineno">  414</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  414</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  415</span> </div>
-<div class="line"><span class="lineno">  416</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;  <span class="comment">// ensure test results are displayed on screen</span></div>
+<div class="line"><span class="lineno">  416</span>    std::cout &lt;&lt; std::endl;  <span class="comment">// ensure test results are displayed on screen</span></div>
 <div class="line"><span class="lineno">  417</span>                             <span class="comment">// (flush stdout)</span></div>
 <div class="line"><span class="lineno">  418</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.svg" width="608" height="260"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a207b3a99fd5974d3117e0b0ac0aad234" name="a207b3a99fd5974d3117e0b0ac0aad234"></a>
@@ -569,23 +576,25 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; float &gt; operator* </td>
+          <td class="memname">std::vector&lt; float &gt; operator* </td>
           <td>(</td>
           <td class="paramtype">float const</td>          <td class="paramname"><span class="paramname"><em>scalar</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>pre-multiplication of a vector by a scalar </p><dl class="section return"><dt>Returns</dt><dd>resultant vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00138">138</a> of file <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html">ordinary_least_squares_regressor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  138</span>                                                                      {</div>
 <div class="line"><span class="lineno">  139</span>    <span class="comment">// Number of rows in A</span></div>
-<div class="line"><span class="lineno">  140</span>    <span class="keywordtype">size_t</span> N_A = 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">  140</span>    <span class="keywordtype">size_t</span> N_A = A.size();</div>
 <div class="line"><span class="lineno">  141</span> </div>
-<div class="line"><span class="lineno">  142</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(N_A);</div>
+<div class="line"><span class="lineno">  142</span>    std::vector&lt;float&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(N_A);</div>
 <div class="line"><span class="lineno">  143</span> </div>
 <div class="line"><span class="lineno">  144</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; N_A; row++) {</div>
 <div class="line"><span class="lineno">  145</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>[row] += A[row] * <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(scalar);</div>
@@ -593,12 +602,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  147</span> </div>
 <div class="line"><span class="lineno">  148</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  149</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d38/ordinary__least__squares__regressor_8cpp_a207b3a99fd5974d3117e0b0ac0aad234_cgraph.svg" width="248" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae2edd40354a1ca7aeaee3d1e3589e713" name="ae2edd40354a1ca7aeaee3d1e3589e713"></a>
@@ -610,38 +614,40 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; operator* </td>
+          <td class="memname">std::vector&lt; std::vector&lt; T &gt; &gt; operator* </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>Matrix multiplication such that if A is size (mxn) and B is of size (pxq) then the multiplication is defined only when n = p and the resultant matrix is of size (mxq)</p>
 <dl class="section return"><dt>Returns</dt><dd>resultant matrix </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00078">78</a> of file <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html">ordinary_least_squares_regressor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   79</span>                                                                        {</div>
 <div class="line"><span class="lineno">   80</span>    <span class="comment">// Number of rows in A</span></div>
-<div class="line"><span class="lineno">   81</span>    <span class="keywordtype">size_t</span> N_A = 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">   81</span>    <span class="keywordtype">size_t</span> N_A = A.size();</div>
 <div class="line"><span class="lineno">   82</span>    <span class="comment">// Number of columns in B</span></div>
-<div class="line"><span class="lineno">   83</span>    <span class="keywordtype">size_t</span> N_B = B[0].<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">   83</span>    <span class="keywordtype">size_t</span> N_B = B[0].size();</div>
 <div class="line"><span class="lineno">   84</span> </div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;T&gt;</a>&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(N_A);</div>
+<div class="line"><span class="lineno">   85</span>    std::vector&lt;std::vector&lt;T&gt;&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(N_A);</div>
 <div class="line"><span class="lineno">   86</span> </div>
-<div class="line"><span class="lineno">   87</span>    <span class="keywordflow">if</span> (A[0].size() != B.<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">   88</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Number of columns in A != Number of rows in B (&quot;</span></div>
-<div class="line"><span class="lineno">   89</span>                  &lt;&lt; A[0].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; B.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() &lt;&lt; <span class="stringliteral">&quot;)&quot;</span> &lt;&lt; <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">   87</span>    <span class="keywordflow">if</span> (A[0].size() != B.size()) {</div>
+<div class="line"><span class="lineno">   88</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Number of columns in A != Number of rows in B (&quot;</span></div>
+<div class="line"><span class="lineno">   89</span>                  &lt;&lt; A[0].size() &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; B.size() &lt;&lt; <span class="stringliteral">&quot;)&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   90</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   91</span>    }</div>
 <div class="line"><span class="lineno">   92</span> </div>
 <div class="line"><span class="lineno">   93</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; N_A; row++) {</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&lt;T&gt;</a> v(N_B);</div>
+<div class="line"><span class="lineno">   94</span>        std::vector&lt;T&gt; v(N_B);</div>
 <div class="line"><span class="lineno">   95</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; N_B; col++) {</div>
 <div class="line"><span class="lineno">   96</span>            v[col] = <span class="keyword">static_cast&lt;</span>T<span class="keyword">&gt;</span>(0);</div>
-<div class="line"><span class="lineno">   97</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; B.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); j++) {</div>
+<div class="line"><span class="lineno">   97</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; B.size(); j++) {</div>
 <div class="line"><span class="lineno">   98</span>                v[col] += A[row][j] * B[j][col];</div>
 <div class="line"><span class="lineno">   99</span>            }</div>
 <div class="line"><span class="lineno">  100</span>        }</div>
@@ -650,12 +656,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  103</span> </div>
 <div class="line"><span class="lineno">  104</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  105</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d38/ordinary__least__squares__regressor_8cpp_ae2edd40354a1ca7aeaee3d1e3589e713_cgraph.svg" width="248" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a865e8d26a01962cc93aca66e71346f37" name="a865e8d26a01962cc93aca66e71346f37"></a>
@@ -667,43 +668,40 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; operator* </td>
+          <td class="memname">std::vector&lt; T &gt; operator* </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>multiplication of a matrix with a column vector </p><dl class="section return"><dt>Returns</dt><dd>resultant vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00112">112</a> of file <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html">ordinary_least_squares_regressor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  113</span>                                                {</div>
 <div class="line"><span class="lineno">  114</span>    <span class="comment">// Number of rows in A</span></div>
-<div class="line"><span class="lineno">  115</span>    <span class="keywordtype">size_t</span> N_A = 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">  115</span>    <span class="keywordtype">size_t</span> N_A = A.size();</div>
 <div class="line"><span class="lineno">  116</span> </div>
-<div class="line"><span class="lineno">  117</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(N_A);</div>
+<div class="line"><span class="lineno">  117</span>    std::vector&lt;T&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(N_A);</div>
 <div class="line"><span class="lineno">  118</span> </div>
-<div class="line"><span class="lineno">  119</span>    <span class="keywordflow">if</span> (A[0].size() != B.<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">  120</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Number of columns in A != Number of rows in B (&quot;</span></div>
-<div class="line"><span class="lineno">  121</span>                  &lt;&lt; A[0].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; B.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() &lt;&lt; <span class="stringliteral">&quot;)&quot;</span> &lt;&lt; <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">  119</span>    <span class="keywordflow">if</span> (A[0].size() != B.size()) {</div>
+<div class="line"><span class="lineno">  120</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Number of columns in A != Number of rows in B (&quot;</span></div>
+<div class="line"><span class="lineno">  121</span>                  &lt;&lt; A[0].size() &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; B.size() &lt;&lt; <span class="stringliteral">&quot;)&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  122</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  123</span>    }</div>
 <div class="line"><span class="lineno">  124</span> </div>
 <div class="line"><span class="lineno">  125</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; N_A; row++) {</div>
 <div class="line"><span class="lineno">  126</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>[row] = <span class="keyword">static_cast&lt;</span>T<span class="keyword">&gt;</span>(0);</div>
-<div class="line"><span class="lineno">  127</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; B.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); j++) result[row] += A[row][j] * B[j];</div>
+<div class="line"><span class="lineno">  127</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; B.size(); j++) result[row] += A[row][j] * B[j];</div>
 <div class="line"><span class="lineno">  128</span>    }</div>
 <div class="line"><span class="lineno">  129</span> </div>
 <div class="line"><span class="lineno">  130</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  131</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d38/ordinary__least__squares__regressor_8cpp_a865e8d26a01962cc93aca66e71346f37_cgraph.svg" width="248" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a42535e20e97d85aa61271e0894cc0359" name="a42535e20e97d85aa61271e0894cc0359"></a>
@@ -715,9 +713,9 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; float &gt; operator* </td>
+          <td class="memname">std::vector&lt; float &gt; operator* </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">std::vector&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -727,11 +725,13 @@ template&lt;typename T &gt; </div>
       </table>
 </div><div class="memdoc">
 <p>post-multiplication of a vector by a scalar </p><dl class="section return"><dt>Returns</dt><dd>resultant vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00156">156</a> of file <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html">ordinary_least_squares_regressor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  156</span>                                                                      {</div>
 <div class="line"><span class="lineno">  157</span>    <span class="comment">// Number of rows in A</span></div>
-<div class="line"><span class="lineno">  158</span>    <span class="keywordtype">size_t</span> N_A = 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">  158</span>    <span class="keywordtype">size_t</span> N_A = A.size();</div>
 <div class="line"><span class="lineno">  159</span> </div>
-<div class="line"><span class="lineno">  160</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(N_A);</div>
+<div class="line"><span class="lineno">  160</span>    std::vector&lt;float&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(N_A);</div>
 <div class="line"><span class="lineno">  161</span> </div>
 <div class="line"><span class="lineno">  162</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; N_A; row++) {</div>
 <div class="line"><span class="lineno">  163</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>[row] = A[row] * <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(scalar);</div>
@@ -739,12 +739,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  165</span> </div>
 <div class="line"><span class="lineno">  166</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  167</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d38/ordinary__least__squares__regressor_8cpp_a42535e20e97d85aa61271e0894cc0359_cgraph.svg" width="248" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a01e6c7bf2b09272578b9c5819ce0f36f" name="a01e6c7bf2b09272578b9c5819ce0f36f"></a>
@@ -756,26 +751,28 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; operator+ </td>
+          <td class="memname">std::vector&lt; T &gt; operator+ </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">std::vector&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>addition of two vectors of identical lengths </p><dl class="section return"><dt>Returns</dt><dd>resultant vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00204">204</a> of file <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html">ordinary_least_squares_regressor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  204</span>                                                                     {</div>
 <div class="line"><span class="lineno">  205</span>    <span class="comment">// Number of rows in A</span></div>
-<div class="line"><span class="lineno">  206</span>    <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 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">  206</span>    <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = A.size();</div>
 <div class="line"><span class="lineno">  207</span> </div>
-<div class="line"><span class="lineno">  208</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(N);</div>
+<div class="line"><span class="lineno">  208</span>    std::vector&lt;T&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(N);</div>
 <div class="line"><span class="lineno">  209</span> </div>
-<div class="line"><span class="lineno">  210</span>    <span class="keywordflow">if</span> (B.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() != N) {</div>
-<div class="line"><span class="lineno">  211</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Vector dimensions shouldbe identical!&quot;</span> &lt;&lt; <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">  210</span>    <span class="keywordflow">if</span> (B.size() != N) {</div>
+<div class="line"><span class="lineno">  211</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Vector dimensions shouldbe identical!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  212</span>        <span class="keywordflow">return</span> A;</div>
 <div class="line"><span class="lineno">  213</span>    }</div>
 <div class="line"><span class="lineno">  214</span> </div>
@@ -783,12 +780,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  216</span> </div>
 <div class="line"><span class="lineno">  217</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  218</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d38/ordinary__least__squares__regressor_8cpp_a01e6c7bf2b09272578b9c5819ce0f36f_cgraph.svg" width="251" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4a6a560dbdd0177633783b72db37dc19" name="a4a6a560dbdd0177633783b72db37dc19"></a>
@@ -800,26 +792,28 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; operator- </td>
+          <td class="memname">std::vector&lt; T &gt; operator- </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">std::vector&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>subtraction of two vectors of identical lengths </p><dl class="section return"><dt>Returns</dt><dd>resultant vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00183">183</a> of file <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html">ordinary_least_squares_regressor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  183</span>                                                                     {</div>
 <div class="line"><span class="lineno">  184</span>    <span class="comment">// Number of rows in A</span></div>
-<div class="line"><span class="lineno">  185</span>    <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 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">  185</span>    <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = A.size();</div>
 <div class="line"><span class="lineno">  186</span> </div>
-<div class="line"><span class="lineno">  187</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(N);</div>
+<div class="line"><span class="lineno">  187</span>    std::vector&lt;T&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(N);</div>
 <div class="line"><span class="lineno">  188</span> </div>
-<div class="line"><span class="lineno">  189</span>    <span class="keywordflow">if</span> (B.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() != N) {</div>
-<div class="line"><span class="lineno">  190</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Vector dimensions shouldbe identical!&quot;</span> &lt;&lt; <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">  189</span>    <span class="keywordflow">if</span> (B.size() != N) {</div>
+<div class="line"><span class="lineno">  190</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Vector dimensions shouldbe identical!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  191</span>        <span class="keywordflow">return</span> A;</div>
 <div class="line"><span class="lineno">  192</span>    }</div>
 <div class="line"><span class="lineno">  193</span> </div>
@@ -827,12 +821,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">  195</span> </div>
 <div class="line"><span class="lineno">  196</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  197</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d38/ordinary__least__squares__regressor_8cpp_a4a6a560dbdd0177633783b72db37dc19_cgraph.svg" width="247" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7a2d742b9a3ae7b85292e1f86428bb4f" name="a7a2d742b9a3ae7b85292e1f86428bb4f"></a>
@@ -844,9 +833,9 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; float &gt; operator/ </td>
+          <td class="memname">std::vector&lt; float &gt; operator/ </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">std::vector&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -856,6 +845,8 @@ template&lt;typename T &gt; </div>
       </table>
 </div><div class="memdoc">
 <p>division of a vector by a scalar </p><dl class="section return"><dt>Returns</dt><dd>resultant vector </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00174">174</a> of file <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html">ordinary_least_squares_regressor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  174</span>                                                                      {</div>
 <div class="line"><span class="lineno">  175</span>    <span class="keywordflow">return</span> (1.f / scalar) * A;</div>
 <div class="line"><span class="lineno">  176</span>}</div>
@@ -871,41 +862,35 @@ template&lt;typename T &gt; </div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; operator&lt;&lt; </td>
+          <td class="memname">std::ostream &amp; operator&lt;&lt; </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
+          <td class="paramtype">std::ostream &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>v</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>v</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>operator to print a matrix </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00022">22</a> of file <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html">ordinary_least_squares_regressor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   23</span>                                                           {</div>
 <div class="line"><span class="lineno">   24</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> width = 10;</div>
 <div class="line"><span class="lineno">   25</span>    <span class="keyword">const</span> <span class="keywordtype">char</span> separator = <span class="charliteral">&#39; &#39;</span>;</div>
 <div class="line"><span class="lineno">   26</span> </div>
-<div class="line"><span class="lineno">   27</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; v.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); row++) {</div>
-<div class="line"><span class="lineno">   28</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; v[row].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); col++) {</div>
-<div class="line"><span class="lineno">   29</span>            out &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::left</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(width) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">std::setfill</a>(separator)</div>
+<div class="line"><span class="lineno">   27</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; v.size(); row++) {</div>
+<div class="line"><span class="lineno">   28</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; v[row].size(); col++) {</div>
+<div class="line"><span class="lineno">   29</span>            out &lt;&lt; std::left &lt;&lt; std::setw(width) &lt;&lt; std::setfill(separator)</div>
 <div class="line"><span class="lineno">   30</span>                &lt;&lt; v[row][col];</div>
 <div class="line"><span class="lineno">   31</span>        }</div>
-<div class="line"><span class="lineno">   32</span>        out &lt;&lt; <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">   32</span>        out &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   33</span>    }</div>
 <div class="line"><span class="lineno">   34</span> </div>
 <div class="line"><span class="lineno">   35</span>    <span class="keywordflow">return</span> out;</div>
 <div class="line"><span class="lineno">   36</span>}</div>
-<div class="ttc" id="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::left</a></div><div class="ttdeci">T left(T... args)</div></div>
-<div class="ttc" id="asetfill_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">std::setfill</a></div><div class="ttdeci">T setfill(T... args)</div></div>
-<div class="ttc" id="asetw_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a></div><div class="ttdeci">T setw(T... args)</div></div>
-</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_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.svg" width="222" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ab1ad727903d7817c2758d25bcb52cbc8" name="ab1ad727903d7817c2758d25bcb52cbc8"></a>
@@ -917,35 +902,32 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; operator&lt;&lt; </td>
+          <td class="memname">std::ostream &amp; operator&lt;&lt; </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
+          <td class="paramtype">std::ostream &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>v</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; T &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>v</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>operator to print a vector </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html">ordinary_least_squares_regressor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   42</span>                                                               {</div>
 <div class="line"><span class="lineno">   43</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> width = 15;</div>
 <div class="line"><span class="lineno">   44</span>    <span class="keyword">const</span> <span class="keywordtype">char</span> separator = <span class="charliteral">&#39; &#39;</span>;</div>
 <div class="line"><span class="lineno">   45</span> </div>
-<div class="line"><span class="lineno">   46</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; v.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); row++) {</div>
-<div class="line"><span class="lineno">   47</span>        out &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::left</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(width) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">std::setfill</a>(separator)</div>
+<div class="line"><span class="lineno">   46</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; v.size(); row++) {</div>
+<div class="line"><span class="lineno">   47</span>        out &lt;&lt; std::left &lt;&lt; std::setw(width) &lt;&lt; std::setfill(separator)</div>
 <div class="line"><span class="lineno">   48</span>            &lt;&lt; v[row];</div>
 <div class="line"><span class="lineno">   49</span>    }</div>
 <div class="line"><span class="lineno">   50</span> </div>
 <div class="line"><span class="lineno">   51</span>    <span class="keywordflow">return</span> out;</div>
 <div class="line"><span class="lineno">   52</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.svg" width="259" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ade6e463f37878fe2a219f927c65b5493" name="ade6e463f37878fe2a219f927c65b5493"></a>
@@ -957,14 +939,14 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; float &gt; predict_OLS_regressor </td>
+          <td class="memname">std::vector&lt; float &gt; predict_OLS_regressor </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>X</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; float &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>beta</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; float &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>beta</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -979,12 +961,14 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>vector with regression values for each sample </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html#l00352">352</a> of file <a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp_source.html">ordinary_least_squares_regressor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  354</span>  {</div>
-<div class="line"><span class="lineno">  355</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(X.<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">  355</span>    std::vector&lt;float&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(X.size());</div>
 <div class="line"><span class="lineno">  356</span> </div>
-<div class="line"><span class="lineno">  357</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> rows = 0; rows &lt; X.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); rows++) {</div>
+<div class="line"><span class="lineno">  357</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> rows = 0; rows &lt; X.size(); rows++) {</div>
 <div class="line"><span class="lineno">  358</span>        <span class="comment">// -&gt; start with constant term</span></div>
-<div class="line"><span class="lineno">  359</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>[rows] = beta[X[0].<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">  359</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>[rows] = beta[X[0].size()];</div>
 <div class="line"><span class="lineno">  360</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> cols = 0; cols &lt; X[0].size(); cols++) {</div>
 <div class="line"><span class="lineno">  361</span>            <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>[rows] += beta[cols] * X[rows][cols];</div>
 <div class="line"><span class="lineno">  362</span>        }</div>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a01e6c7bf2b09272578b9c5819ce0f36f_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a01e6c7bf2b09272578b9c5819ce0f36f_cgraph.map
deleted file mode 100644
index 44da26679..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a01e6c7bf2b09272578b9c5819ce0f36f_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="operator+" name="operator+">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,82,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="152,5,223,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="82,34,136,24,137,30,83,39"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="130,55,245,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="83,47,115,53,114,58,82,52"/>
-</map>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a01e6c7bf2b09272578b9c5819ce0f36f_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a01e6c7bf2b09272578b9c5819ce0f36f_cgraph.md5
deleted file mode 100644
index c9109bc4d..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a01e6c7bf2b09272578b9c5819ce0f36f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-78c374734de8da60ccff84ff93b6bebe
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a01e6c7bf2b09272578b9c5819ce0f36f_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a01e6c7bf2b09272578b9c5819ce0f36f_cgraph.svg
deleted file mode 100644
index 86c9b514e..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a01e6c7bf2b09272578b9c5819ce0f36f_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator+ Pages: 1 -->
-<svg width="188pt" height="64pt"
- viewBox="0.00 0.00 187.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>operator+</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="57.25,-37.25 0,-37.25 0,-18 57.25,-18 57.25,-37.25"/>
-<text text-anchor="middle" x="28.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator+</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="163.25,-56.25 109.75,-56.25 109.75,-37 163.25,-37 163.25,-56.25"/>
-<text text-anchor="middle" x="136.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M57.72,-32.67C70.13,-34.89 84.91,-37.55 98.22,-39.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.51,-43.36 107.97,-41.68 98.74,-36.47 97.51,-43.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="179.75,-19.25 93.25,-19.25 93.25,0 179.75,0 179.75,-19.25"/>
-<text text-anchor="middle" x="136.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M57.72,-22.85C65.13,-21.59 73.39,-20.19 81.67,-18.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.14,-22.25 91.41,-17.12 80.97,-15.35 82.14,-22.25"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a01e6c7bf2b09272578b9c5819ce0f36f_cgraph_org.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a01e6c7bf2b09272578b9c5819ce0f36f_cgraph_org.svg
deleted file mode 100644
index bec6e9b84..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a01e6c7bf2b09272578b9c5819ce0f36f_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator+ Pages: 1 -->
-<svg width="188pt" height="64pt"
- viewBox="0.00 0.00 187.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>operator+</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="57.25,-37.25 0,-37.25 0,-18 57.25,-18 57.25,-37.25"/>
-<text text-anchor="middle" x="28.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator+</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="163.25,-56.25 109.75,-56.25 109.75,-37 163.25,-37 163.25,-56.25"/>
-<text text-anchor="middle" x="136.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M57.72,-32.67C70.13,-34.89 84.91,-37.55 98.22,-39.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.51,-43.36 107.97,-41.68 98.74,-36.47 97.51,-43.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="179.75,-19.25 93.25,-19.25 93.25,0 179.75,0 179.75,-19.25"/>
-<text text-anchor="middle" x="136.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M57.72,-22.85C65.13,-21.59 73.39,-20.19 81.67,-18.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.14,-22.25 91.41,-17.12 80.97,-15.35 82.14,-22.25"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a207b3a99fd5974d3117e0b0ac0aad234_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a207b3a99fd5974d3117e0b0ac0aad234_cgraph.map
deleted file mode 100644
index 4d91e4150..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a207b3a99fd5974d3117e0b0ac0aad234_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="operator*" name="operator*">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,79,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="127,5,242,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="79,16,111,16,111,21,79,21"/>
-</map>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a207b3a99fd5974d3117e0b0ac0aad234_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a207b3a99fd5974d3117e0b0ac0aad234_cgraph.md5
deleted file mode 100644
index 2241f725c..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a207b3a99fd5974d3117e0b0ac0aad234_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-03ad54c8850908bd0b0e6375326db5cd
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a207b3a99fd5974d3117e0b0ac0aad234_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a207b3a99fd5974d3117e0b0ac0aad234_cgraph.svg
deleted file mode 100644
index 659092d03..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a207b3a99fd5974d3117e0b0ac0aad234_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator* Pages: 1 -->
-<svg width="186pt" height="27pt"
- viewBox="0.00 0.00 185.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>operator*</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="55,-19.25 0,-19.25 0,0 55,0 55,-19.25"/>
-<text text-anchor="middle" x="27.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator*</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.5,-19.25 91,-19.25 91,0 177.5,0 177.5,-19.25"/>
-<text text-anchor="middle" x="134.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.48,-9.62C62.73,-9.62 70.84,-9.62 79.01,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79,-13.13 89,-9.63 79,-6.13 79,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a207b3a99fd5974d3117e0b0ac0aad234_cgraph_org.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a207b3a99fd5974d3117e0b0ac0aad234_cgraph_org.svg
deleted file mode 100644
index dac3b9b1a..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a207b3a99fd5974d3117e0b0ac0aad234_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator* Pages: 1 -->
-<svg width="186pt" height="27pt"
- viewBox="0.00 0.00 185.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>operator*</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="55,-19.25 0,-19.25 0,0 55,0 55,-19.25"/>
-<text text-anchor="middle" x="27.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator*</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.5,-19.25 91,-19.25 91,0 177.5,0 177.5,-19.25"/>
-<text text-anchor="middle" x="134.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.48,-9.62C62.73,-9.62 70.84,-9.62 79.01,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79,-13.13 89,-9.63 79,-6.13 79,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a42535e20e97d85aa61271e0894cc0359_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a42535e20e97d85aa61271e0894cc0359_cgraph.map
deleted file mode 100644
index 4d91e4150..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a42535e20e97d85aa61271e0894cc0359_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="operator*" name="operator*">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,79,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="127,5,242,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="79,16,111,16,111,21,79,21"/>
-</map>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a42535e20e97d85aa61271e0894cc0359_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a42535e20e97d85aa61271e0894cc0359_cgraph.md5
deleted file mode 100644
index 2241f725c..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a42535e20e97d85aa61271e0894cc0359_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-03ad54c8850908bd0b0e6375326db5cd
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a42535e20e97d85aa61271e0894cc0359_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a42535e20e97d85aa61271e0894cc0359_cgraph.svg
deleted file mode 100644
index 659092d03..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a42535e20e97d85aa61271e0894cc0359_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator* Pages: 1 -->
-<svg width="186pt" height="27pt"
- viewBox="0.00 0.00 185.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>operator*</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="55,-19.25 0,-19.25 0,0 55,0 55,-19.25"/>
-<text text-anchor="middle" x="27.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator*</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.5,-19.25 91,-19.25 91,0 177.5,0 177.5,-19.25"/>
-<text text-anchor="middle" x="134.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.48,-9.62C62.73,-9.62 70.84,-9.62 79.01,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79,-13.13 89,-9.63 79,-6.13 79,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a42535e20e97d85aa61271e0894cc0359_cgraph_org.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a42535e20e97d85aa61271e0894cc0359_cgraph_org.svg
deleted file mode 100644
index dac3b9b1a..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a42535e20e97d85aa61271e0894cc0359_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator* Pages: 1 -->
-<svg width="186pt" height="27pt"
- viewBox="0.00 0.00 185.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>operator*</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="55,-19.25 0,-19.25 0,0 55,0 55,-19.25"/>
-<text text-anchor="middle" x="27.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator*</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.5,-19.25 91,-19.25 91,0 177.5,0 177.5,-19.25"/>
-<text text-anchor="middle" x="134.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.48,-9.62C62.73,-9.62 70.84,-9.62 79.01,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79,-13.13 89,-9.63 79,-6.13 79,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.map
deleted file mode 100644
index c9bb91f03..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="ols_test" name="ols_test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,153,73,179"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="528,5,600,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="57,151,119,113,218,69,322,40,423,24,513,17,513,22,424,29,324,45,220,74,122,118,60,155"/>
-<area shape="rect" id="Node000003" href="$dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b" title=" " alt="" coords="135,128,261,154"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="73,158,119,151,120,156,73,163"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="342,203,458,228"/>
-<area shape="poly" id="edge10_Node000001_Node000008" title=" " alt="" coords="73,168,328,203,327,208,72,173"/>
-<area shape="rect" id="Node000009" href="$dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493" title=" " alt="" coords="121,229,275,255"/>
-<area shape="poly" id="edge9_Node000001_Node000009" title=" " alt="" coords="64,177,122,208,150,221,148,225,119,213,62,182"/>
-<area shape="rect" id="Node000004" href="$dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a" title=" " alt="" coords="356,55,444,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="230,125,322,89,340,83,342,88,324,94,232,130"/>
-<area shape="rect" id="Node000006" href="$dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb" title=" " alt="" coords="348,104,452,130"/>
-<area shape="poly" id="edge6_Node000003_Node000006" title=" " alt="" coords="261,131,333,122,334,127,262,136"/>
-<area shape="rect" id="Node000007" 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="323,153,477,179"/>
-<area shape="poly" id="edge7_Node000003_Node000007" title=" " alt="" coords="262,146,308,152,307,157,261,151"/>
-<area shape="poly" id="edge8_Node000003_Node000008" title=" " alt="" coords="232,152,324,189,341,195,339,200,322,194,230,157"/>
-<area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="444,52,513,31,514,36,445,57"/>
-<area shape="rect" id="Node000005" href="$dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e" title=" " alt="" coords="525,55,603,80"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="445,65,510,65,510,70,445,70"/>
-</map>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.md5
deleted file mode 100644
index 40a01e38a..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-753ed9bf9459c68b9469efd72207d875
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.svg
deleted file mode 100644
index 36548fe2a..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph.svg
+++ /dev/null
@@ -1,209 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ols_test Pages: 1 -->
-<svg width="456pt" height="195pt"
- viewBox="0.00 0.00 456.00 195.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 191.25)">
-<title>ols_test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="50.5,-76.25 0,-76.25 0,-57 50.5,-57 50.5,-76.25"/>
-<text text-anchor="middle" x="25.25" y="-62.75" font-family="Helvetica,sans-Serif" font-size="10.00">ols_test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="445.75,-187.25 392.25,-187.25 392.25,-168 445.75,-168 445.75,-187.25"/>
-<text text-anchor="middle" x="419" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.12,-76.58C52.02,-84.83 69.84,-96.47 86.5,-104.62 150.93,-136.16 168.3,-143.71 238.25,-159.62 286.68,-170.65 343.98,-174.92 380.64,-176.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="380.13,-180.06 390.26,-176.97 380.41,-173.06 380.13,-180.06"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191.75,-95.25 97,-95.25 97,-76 191.75,-76 191.75,-95.25"/>
-<text text-anchor="middle" x="144.38" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">fit_OLS_regressor</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M50.8,-70.61C60.97,-72.26 73.23,-74.25 85.46,-76.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.69,-79.65 95.12,-77.8 85.81,-72.74 84.69,-79.65"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="339.38,-39.25 252.88,-39.25 252.88,-20 339.38,-20 339.38,-39.25"/>
-<text text-anchor="middle" x="296.12" y="-25.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge10_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge10_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M50.59,-63.28C93.49,-57.37 183.52,-44.98 241.55,-37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="241.78,-40.5 251.21,-35.67 240.83,-33.56 241.78,-40.5"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="202.25,-19.25 86.5,-19.25 86.5,0 202.25,0 202.25,-19.25"/>
-<text text-anchor="middle" x="144.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">predict_OLS_regressor</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.41,-56.62C55.33,-49.82 71.68,-40.79 86.5,-33.62 93.31,-30.34 100.68,-27.04 107.79,-23.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.68,-27.41 116.54,-20.3 105.96,-20.96 108.68,-27.41"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="329.25,-150.25 263,-150.25 263,-131 329.25,-131 329.25,-150.25"/>
-<text text-anchor="middle" x="296.12" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M169.25,-95.69C187.9,-103.42 214.55,-114.17 238.25,-122.62 242.64,-124.19 247.24,-125.76 251.85,-127.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="250.47,-130.52 261.07,-130.28 252.64,-123.87 250.47,-130.52"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="334.88,-113.25 257.38,-113.25 257.38,-94 334.88,-94 334.88,-113.25"/>
-<text text-anchor="middle" x="296.12" y="-99.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_transpose</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.94,-91.22C209.12,-93.29 228.64,-95.63 246.04,-97.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="245.28,-101.16 255.62,-98.88 246.11,-94.21 245.28,-101.16"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="354,-76.25 238.25,-76.25 238.25,-57 354,-57 354,-76.25"/>
-<text text-anchor="middle" x="296.12" y="-62.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge7_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge7_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.94,-79.72C202.93,-78.32 214.88,-76.81 226.62,-75.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.8,-78.82 236.28,-74.09 225.92,-71.88 226.8,-78.82"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge8_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge8_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M169.23,-75.6C192.14,-66.03 225.15,-52.37 238.25,-47.62 242.35,-46.14 246.64,-44.66 250.95,-43.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="251.73,-46.64 260.15,-40.21 249.56,-39.99 251.73,-46.64"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M329.52,-150.54C345.43,-155.41 364.67,-161.3 381.14,-166.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.99,-169.65 390.58,-169.23 382.04,-162.96 379.99,-169.65"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="448,-150.25 390,-150.25 390,-131 448,-131 448,-150.25"/>
-<text text-anchor="middle" x="419" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">is_square</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M329.52,-140.62C344.6,-140.62 362.67,-140.62 378.54,-140.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="378.12,-144.13 388.12,-140.63 378.12,-137.13 378.12,-144.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph_org.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph_org.svg
deleted file mode 100644
index d28e29641..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a4261f3c3c3dfdb86f3004eb8aaffea8d_cgraph_org.svg
+++ /dev/null
@@ -1,183 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ols_test Pages: 1 -->
-<svg width="456pt" height="195pt"
- viewBox="0.00 0.00 456.00 195.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 191.25)">
-<title>ols_test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="50.5,-76.25 0,-76.25 0,-57 50.5,-57 50.5,-76.25"/>
-<text text-anchor="middle" x="25.25" y="-62.75" font-family="Helvetica,sans-Serif" font-size="10.00">ols_test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="445.75,-187.25 392.25,-187.25 392.25,-168 445.75,-168 445.75,-187.25"/>
-<text text-anchor="middle" x="419" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M40.12,-76.58C52.02,-84.83 69.84,-96.47 86.5,-104.62 150.93,-136.16 168.3,-143.71 238.25,-159.62 286.68,-170.65 343.98,-174.92 380.64,-176.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="380.13,-180.06 390.26,-176.97 380.41,-173.06 380.13,-180.06"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191.75,-95.25 97,-95.25 97,-76 191.75,-76 191.75,-95.25"/>
-<text text-anchor="middle" x="144.38" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">fit_OLS_regressor</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M50.8,-70.61C60.97,-72.26 73.23,-74.25 85.46,-76.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.69,-79.65 95.12,-77.8 85.81,-72.74 84.69,-79.65"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="339.38,-39.25 252.88,-39.25 252.88,-20 339.38,-20 339.38,-39.25"/>
-<text text-anchor="middle" x="296.12" y="-25.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge10_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge10_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M50.59,-63.28C93.49,-57.37 183.52,-44.98 241.55,-37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="241.78,-40.5 251.21,-35.67 240.83,-33.56 241.78,-40.5"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="202.25,-19.25 86.5,-19.25 86.5,0 202.25,0 202.25,-19.25"/>
-<text text-anchor="middle" x="144.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">predict_OLS_regressor</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.41,-56.62C55.33,-49.82 71.68,-40.79 86.5,-33.62 93.31,-30.34 100.68,-27.04 107.79,-23.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.68,-27.41 116.54,-20.3 105.96,-20.96 108.68,-27.41"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="329.25,-150.25 263,-150.25 263,-131 329.25,-131 329.25,-150.25"/>
-<text text-anchor="middle" x="296.12" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M169.25,-95.69C187.9,-103.42 214.55,-114.17 238.25,-122.62 242.64,-124.19 247.24,-125.76 251.85,-127.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="250.47,-130.52 261.07,-130.28 252.64,-123.87 250.47,-130.52"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="334.88,-113.25 257.38,-113.25 257.38,-94 334.88,-94 334.88,-113.25"/>
-<text text-anchor="middle" x="296.12" y="-99.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_transpose</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.94,-91.22C209.12,-93.29 228.64,-95.63 246.04,-97.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="245.28,-101.16 255.62,-98.88 246.11,-94.21 245.28,-101.16"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="354,-76.25 238.25,-76.25 238.25,-57 354,-57 354,-76.25"/>
-<text text-anchor="middle" x="296.12" y="-62.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge7_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge7_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M191.94,-79.72C202.93,-78.32 214.88,-76.81 226.62,-75.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.8,-78.82 236.28,-74.09 225.92,-71.88 226.8,-78.82"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge8_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge8_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M169.23,-75.6C192.14,-66.03 225.15,-52.37 238.25,-47.62 242.35,-46.14 246.64,-44.66 250.95,-43.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="251.73,-46.64 260.15,-40.21 249.56,-39.99 251.73,-46.64"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M329.52,-150.54C345.43,-155.41 364.67,-161.3 381.14,-166.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.99,-169.65 390.58,-169.23 382.04,-162.96 379.99,-169.65"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="448,-150.25 390,-150.25 390,-131 448,-131 448,-150.25"/>
-<text text-anchor="middle" x="419" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">is_square</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M329.52,-140.62C344.6,-140.62 362.67,-140.62 378.54,-140.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="378.12,-144.13 388.12,-140.63 378.12,-137.13 378.12,-144.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a4a6a560dbdd0177633783b72db37dc19_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a4a6a560dbdd0177633783b72db37dc19_cgraph.map
deleted file mode 100644
index 6a4774ea0..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a4a6a560dbdd0177633783b72db37dc19_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="operator&#45;" name="operator&#45;">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,78,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="148,5,219,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="78,34,132,25,133,30,79,40"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="126,55,241,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="79,47,111,53,110,58,78,52"/>
-</map>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a4a6a560dbdd0177633783b72db37dc19_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a4a6a560dbdd0177633783b72db37dc19_cgraph.md5
deleted file mode 100644
index 084673190..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a4a6a560dbdd0177633783b72db37dc19_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-34451b471e4528e6e03268102c5aed38
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a4a6a560dbdd0177633783b72db37dc19_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a4a6a560dbdd0177633783b72db37dc19_cgraph.svg
deleted file mode 100644
index 904681355..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a4a6a560dbdd0177633783b72db37dc19_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator&#45; Pages: 1 -->
-<svg width="185pt" height="64pt"
- viewBox="0.00 0.00 184.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>operator&#45;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="54.25,-37.25 0,-37.25 0,-18 54.25,-18 54.25,-37.25"/>
-<text text-anchor="middle" x="27.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&#45;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-56.25 106.75,-56.25 106.75,-37 160.25,-37 160.25,-56.25"/>
-<text text-anchor="middle" x="133.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M54.73,-32.47C66.97,-34.7 81.71,-37.38 95.04,-39.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.35,-43.24 104.81,-41.58 95.6,-36.35 94.35,-43.24"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-19.25 90.25,-19.25 90.25,0 176.75,0 176.75,-19.25"/>
-<text text-anchor="middle" x="133.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M54.73,-23.04C62.12,-21.76 70.43,-20.33 78.78,-18.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.37,-22.34 88.63,-17.19 78.18,-15.44 79.37,-22.34"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a4a6a560dbdd0177633783b72db37dc19_cgraph_org.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a4a6a560dbdd0177633783b72db37dc19_cgraph_org.svg
deleted file mode 100644
index fd1604235..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a4a6a560dbdd0177633783b72db37dc19_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator&#45; Pages: 1 -->
-<svg width="185pt" height="64pt"
- viewBox="0.00 0.00 184.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>operator&#45;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="54.25,-37.25 0,-37.25 0,-18 54.25,-18 54.25,-37.25"/>
-<text text-anchor="middle" x="27.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&#45;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-56.25 106.75,-56.25 106.75,-37 160.25,-37 160.25,-56.25"/>
-<text text-anchor="middle" x="133.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M54.73,-32.47C66.97,-34.7 81.71,-37.38 95.04,-39.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.35,-43.24 104.81,-41.58 95.6,-36.35 94.35,-43.24"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-19.25 90.25,-19.25 90.25,0 176.75,0 176.75,-19.25"/>
-<text text-anchor="middle" x="133.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M54.73,-23.04C62.12,-21.76 70.43,-20.33 78.78,-18.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.37,-22.34 88.63,-17.19 78.18,-15.44 79.37,-22.34"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.map
deleted file mode 100644
index 0fd4f56df..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="operator&lt;&lt;" name="operator&lt;&lt;">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,80,90,106"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="141,5,212,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="70,77,138,37,141,42,73,82"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/left.html#" title=" " alt="" coords="144,55,210,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="90,82,128,74,129,79,91,87"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setfill.html#" title=" " alt="" coords="138,104,216,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="91,98,123,104,122,109,90,103"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setw.html#" title=" " alt="" coords="139,153,214,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="73,104,141,143,138,148,71,109"/>
-</map>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.md5
deleted file mode 100644
index f8675eaba..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-eac8ef03d8b3ab0a2780b787ebecf913
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.svg
deleted file mode 100644
index ca175d9a5..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator&lt;&lt; Pages: 1 -->
-<svg width="166pt" height="138pt"
- viewBox="0.00 0.00 166.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="63.25,-74.25 0,-74.25 0,-55 63.25,-55 63.25,-74.25"/>
-<text text-anchor="middle" x="31.62" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.38,-130.25 101.88,-130.25 101.88,-111 155.38,-111 155.38,-130.25"/>
-<text text-anchor="middle" x="128.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M49.61,-74.64C63.84,-83.03 84.41,-95.15 100.85,-104.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.77,-107.68 109.16,-109.74 102.33,-101.65 98.77,-107.68"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/left.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="153.12,-93.25 104.12,-93.25 104.12,-74 153.12,-74 153.12,-93.25"/>
-<text text-anchor="middle" x="128.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::left</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.73,-70.85C72.96,-72.69 83.14,-74.73 92.6,-76.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.71,-80.01 102.2,-78.54 93.08,-73.15 91.71,-80.01"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158,-56.25 99.25,-56.25 99.25,-37 158,-37 158,-56.25"/>
-<text text-anchor="middle" x="128.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.73,-58.73C71.46,-57.27 79.84,-55.68 87.91,-54.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.36,-57.63 97.53,-52.33 87.06,-50.75 88.36,-57.63"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="156.88,-19.25 100.38,-19.25 100.38,0 156.88,0 156.88,-19.25"/>
-<text text-anchor="middle" x="128.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M50.05,-54.54C64.24,-46.32 84.53,-34.58 100.79,-25.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.1,-28.45 109,-20.41 98.59,-22.39 102.1,-28.45"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph_org.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph_org.svg
deleted file mode 100644
index 2c2e32be6..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a7075a0fccad9b2d79be0275bfe8948d4_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator&lt;&lt; Pages: 1 -->
-<svg width="166pt" height="138pt"
- viewBox="0.00 0.00 166.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="63.25,-74.25 0,-74.25 0,-55 63.25,-55 63.25,-74.25"/>
-<text text-anchor="middle" x="31.62" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155.38,-130.25 101.88,-130.25 101.88,-111 155.38,-111 155.38,-130.25"/>
-<text text-anchor="middle" x="128.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M49.61,-74.64C63.84,-83.03 84.41,-95.15 100.85,-104.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.77,-107.68 109.16,-109.74 102.33,-101.65 98.77,-107.68"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/left.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="153.12,-93.25 104.12,-93.25 104.12,-74 153.12,-74 153.12,-93.25"/>
-<text text-anchor="middle" x="128.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::left</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.73,-70.85C72.96,-72.69 83.14,-74.73 92.6,-76.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.71,-80.01 102.2,-78.54 93.08,-73.15 91.71,-80.01"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158,-56.25 99.25,-56.25 99.25,-37 158,-37 158,-56.25"/>
-<text text-anchor="middle" x="128.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.73,-58.73C71.46,-57.27 79.84,-55.68 87.91,-54.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.36,-57.63 97.53,-52.33 87.06,-50.75 88.36,-57.63"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="156.88,-19.25 100.38,-19.25 100.38,0 156.88,0 156.88,-19.25"/>
-<text text-anchor="middle" x="128.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M50.05,-54.54C64.24,-46.32 84.53,-34.58 100.79,-25.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.1,-28.45 109,-20.41 98.59,-22.39 102.1,-28.45"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a865e8d26a01962cc93aca66e71346f37_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a865e8d26a01962cc93aca66e71346f37_cgraph.map
deleted file mode 100644
index 51f741983..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a865e8d26a01962cc93aca66e71346f37_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="operator*" name="operator*">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,79,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="149,5,220,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="79,34,133,25,134,30,80,40"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="127,55,242,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="80,47,112,53,111,58,79,52"/>
-</map>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a865e8d26a01962cc93aca66e71346f37_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a865e8d26a01962cc93aca66e71346f37_cgraph.md5
deleted file mode 100644
index 9054a0617..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a865e8d26a01962cc93aca66e71346f37_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4202127763e28c663e8b04654b218f50
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a865e8d26a01962cc93aca66e71346f37_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a865e8d26a01962cc93aca66e71346f37_cgraph.svg
deleted file mode 100644
index 127e778b1..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a865e8d26a01962cc93aca66e71346f37_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator* Pages: 1 -->
-<svg width="186pt" height="64pt"
- viewBox="0.00 0.00 185.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>operator*</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="55,-37.25 0,-37.25 0,-18 55,-18 55,-37.25"/>
-<text text-anchor="middle" x="27.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator*</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161,-56.25 107.5,-56.25 107.5,-37 161,-37 161,-56.25"/>
-<text text-anchor="middle" x="134.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.48,-32.52C67.76,-34.75 82.5,-37.42 95.83,-39.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.14,-43.27 105.6,-41.61 96.39,-36.38 95.14,-43.27"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.5,-19.25 91,-19.25 91,0 177.5,0 177.5,-19.25"/>
-<text text-anchor="middle" x="134.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.48,-22.99C62.81,-21.73 71.02,-20.32 79.29,-18.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.76,-22.37 89.02,-17.23 78.57,-15.47 79.76,-22.37"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a865e8d26a01962cc93aca66e71346f37_cgraph_org.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a865e8d26a01962cc93aca66e71346f37_cgraph_org.svg
deleted file mode 100644
index 785e82c37..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_a865e8d26a01962cc93aca66e71346f37_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator* Pages: 1 -->
-<svg width="186pt" height="64pt"
- viewBox="0.00 0.00 185.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>operator*</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="55,-37.25 0,-37.25 0,-18 55,-18 55,-37.25"/>
-<text text-anchor="middle" x="27.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator*</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161,-56.25 107.5,-56.25 107.5,-37 161,-37 161,-56.25"/>
-<text text-anchor="middle" x="134.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.48,-32.52C67.76,-34.75 82.5,-37.42 95.83,-39.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.14,-43.27 105.6,-41.61 96.39,-36.38 95.14,-43.27"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.5,-19.25 91,-19.25 91,0 177.5,0 177.5,-19.25"/>
-<text text-anchor="middle" x="134.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.48,-22.99C62.81,-21.73 71.02,-20.32 79.29,-18.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.76,-22.37 89.02,-17.23 78.57,-15.47 79.76,-22.37"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_aaddc683af581b51351e1023d2a01ef3b_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_aaddc683af581b51351e1023d2a01ef3b_cgraph.map
deleted file mode 100644
index cc732e1f2..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_aaddc683af581b51351e1023d2a01ef3b_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="fit_OLS_regressor" name="fit_OLS_regressor">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,104,132,130"/>
-<area shape="rect" id="Node000002" href="$dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a" title=" " alt="" coords="213,29,301,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="95,101,179,64,197,57,199,62,181,69,98,106"/>
-<area shape="rect" id="Node000005" href="$dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb" title=" " alt="" coords="205,79,308,104"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="132,106,190,98,190,103,133,111"/>
-<area shape="rect" id="Node000006" 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="180,128,334,154"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="133,122,165,126,164,132,132,128"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="199,177,314,203"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="99,128,181,164,197,169,195,174,179,169,96,133"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="385,5,456,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="301,33,369,23,370,28,302,38"/>
-<area shape="rect" id="Node000004" href="$dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e" title=" " alt="" coords="382,55,459,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="302,46,367,57,366,62,301,52"/>
-</map>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_aaddc683af581b51351e1023d2a01ef3b_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_aaddc683af581b51351e1023d2a01ef3b_cgraph.md5
deleted file mode 100644
index 5872c0cca..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_aaddc683af581b51351e1023d2a01ef3b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-42af8713398975929fd19aba79c9cc7f
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_aaddc683af581b51351e1023d2a01ef3b_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_aaddc683af581b51351e1023d2a01ef3b_cgraph.svg
deleted file mode 100644
index fb42de1ea..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_aaddc683af581b51351e1023d2a01ef3b_cgraph.svg
+++ /dev/null
@@ -1,155 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: fit_OLS_regressor Pages: 1 -->
-<svg width="349pt" height="156pt"
- viewBox="0.00 0.00 348.50 156.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 152.25)">
-<title>fit_OLS_regressor</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="94.75,-74.25 0,-74.25 0,-55 94.75,-55 94.75,-74.25"/>
-<text text-anchor="middle" x="47.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">fit_OLS_regressor</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221.75,-130.25 155.5,-130.25 155.5,-111 221.75,-111 221.75,-130.25"/>
-<text text-anchor="middle" x="188.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M68.38,-74.71C84.88,-82.82 109.01,-94.21 130.75,-102.62 135.15,-104.33 139.79,-106 144.43,-107.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.17,-110.85 153.76,-110.66 145.36,-104.21 143.17,-110.85"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.38,-93.25 149.88,-93.25 149.88,-74 227.38,-74 227.38,-93.25"/>
-<text text-anchor="middle" x="188.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_transpose</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.13,-71C109.1,-72.91 124.44,-75 138.55,-76.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.67,-80.34 148.05,-78.23 138.62,-73.41 137.67,-80.34"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.5,-56.25 130.75,-56.25 130.75,-37 246.5,-37 246.5,-56.25"/>
-<text text-anchor="middle" x="188.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.13,-58.58C102.95,-57.57 111.21,-56.5 119.44,-55.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="119.63,-58.94 129.1,-54.19 118.73,-52 119.63,-58.94"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.88,-19.25 145.38,-19.25 145.38,0 231.88,0 231.88,-19.25"/>
-<text text-anchor="middle" x="188.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.09,-54.52C85.58,-46.67 109.36,-35.78 130.75,-27.62 134.61,-26.15 138.64,-24.71 142.7,-23.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.6,-26.7 151.98,-20.22 141.39,-20.06 143.6,-26.7"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="338.25,-148.25 284.75,-148.25 284.75,-129 338.25,-129 338.25,-148.25"/>
-<text text-anchor="middle" x="311.5" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M222.02,-125.45C237.77,-127.8 256.8,-130.63 273.16,-133.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.62,-136.52 283.03,-134.53 273.65,-129.6 272.62,-136.52"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="340.5,-111.25 282.5,-111.25 282.5,-92 340.5,-92 340.5,-111.25"/>
-<text text-anchor="middle" x="311.5" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">is_square</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M222.02,-115.53C237.1,-113.16 255.17,-110.32 271.04,-107.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="271.31,-111.33 280.64,-106.32 270.22,-104.41 271.31,-111.33"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_aaddc683af581b51351e1023d2a01ef3b_cgraph_org.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_aaddc683af581b51351e1023d2a01ef3b_cgraph_org.svg
deleted file mode 100644
index 1536beb18..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_aaddc683af581b51351e1023d2a01ef3b_cgraph_org.svg
+++ /dev/null
@@ -1,129 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: fit_OLS_regressor Pages: 1 -->
-<svg width="349pt" height="156pt"
- viewBox="0.00 0.00 348.50 156.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 152.25)">
-<title>fit_OLS_regressor</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="94.75,-74.25 0,-74.25 0,-55 94.75,-55 94.75,-74.25"/>
-<text text-anchor="middle" x="47.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">fit_OLS_regressor</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221.75,-130.25 155.5,-130.25 155.5,-111 221.75,-111 221.75,-130.25"/>
-<text text-anchor="middle" x="188.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M68.38,-74.71C84.88,-82.82 109.01,-94.21 130.75,-102.62 135.15,-104.33 139.79,-106 144.43,-107.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.17,-110.85 153.76,-110.66 145.36,-104.21 143.17,-110.85"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.38,-93.25 149.88,-93.25 149.88,-74 227.38,-74 227.38,-93.25"/>
-<text text-anchor="middle" x="188.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_transpose</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.13,-71C109.1,-72.91 124.44,-75 138.55,-76.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.67,-80.34 148.05,-78.23 138.62,-73.41 137.67,-80.34"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="246.5,-56.25 130.75,-56.25 130.75,-37 246.5,-37 246.5,-56.25"/>
-<text text-anchor="middle" x="188.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.13,-58.58C102.95,-57.57 111.21,-56.5 119.44,-55.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="119.63,-58.94 129.1,-54.19 118.73,-52 119.63,-58.94"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.88,-19.25 145.38,-19.25 145.38,0 231.88,0 231.88,-19.25"/>
-<text text-anchor="middle" x="188.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.09,-54.52C85.58,-46.67 109.36,-35.78 130.75,-27.62 134.61,-26.15 138.64,-24.71 142.7,-23.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.6,-26.7 151.98,-20.22 141.39,-20.06 143.6,-26.7"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="338.25,-148.25 284.75,-148.25 284.75,-129 338.25,-129 338.25,-148.25"/>
-<text text-anchor="middle" x="311.5" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M222.02,-125.45C237.77,-127.8 256.8,-130.63 273.16,-133.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.62,-136.52 283.03,-134.53 273.65,-129.6 272.62,-136.52"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="340.5,-111.25 282.5,-111.25 282.5,-92 340.5,-92 340.5,-111.25"/>
-<text text-anchor="middle" x="311.5" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">is_square</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M222.02,-115.53C237.1,-113.16 255.17,-110.32 271.04,-107.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="271.31,-111.33 280.64,-106.32 270.22,-104.41 271.31,-111.33"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.map
deleted file mode 100644
index b2bf54785..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="operator&lt;&lt;" name="operator&lt;&lt;">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,80,90,106"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/left.html#" title=" " alt="" coords="163,5,228,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="69,77,136,40,147,35,149,40,139,45,72,82"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setfill.html#" title=" " alt="" coords="156,55,234,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="90,83,140,74,141,79,91,88"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setw.html#" title=" " alt="" coords="158,104,233,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="90,97,142,106,142,111,90,102"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="138,153,253,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="73,104,139,140,148,144,146,149,136,145,70,109"/>
-</map>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.md5
deleted file mode 100644
index 8dd7d0ae6..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bd440d320ba1184573c82b845d6b33d4
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.svg
deleted file mode 100644
index 17e334844..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator&lt;&lt; Pages: 1 -->
-<svg width="194pt" height="138pt"
- viewBox="0.00 0.00 193.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="63.25,-74.25 0,-74.25 0,-55 63.25,-55 63.25,-74.25"/>
-<text text-anchor="middle" x="31.62" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/left.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="167,-130.25 118,-130.25 118,-111 167,-111 167,-130.25"/>
-<text text-anchor="middle" x="142.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::left</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M49.04,-74.69C62.35,-82.69 81.71,-93.93 99.25,-102.62 101.81,-103.9 104.49,-105.16 107.19,-106.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.65,-109.55 116.21,-110.4 108.48,-103.15 105.65,-109.55"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="171.88,-93.25 113.12,-93.25 113.12,-74 171.88,-74 171.88,-93.25"/>
-<text text-anchor="middle" x="142.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.53,-70.02C75.37,-72.09 89.05,-74.47 101.62,-76.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.81,-80.08 111.27,-78.35 102.02,-73.18 100.81,-80.08"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170.75,-56.25 114.25,-56.25 114.25,-37 170.75,-37 170.75,-56.25"/>
-<text text-anchor="middle" x="142.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.53,-59.52C75.66,-57.51 89.72,-55.19 102.53,-53.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.07,-56.53 112.37,-51.44 101.93,-49.62 103.07,-56.53"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="185.75,-19.25 99.25,-19.25 99.25,0 185.75,0 185.75,-19.25"/>
-<text text-anchor="middle" x="142.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M49.62,-54.54C62.93,-46.8 82.02,-36.05 99.25,-27.62 101.52,-26.52 103.87,-25.4 106.26,-24.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="107.62,-27.53 115.35,-20.28 104.79,-21.13 107.62,-27.53"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph_org.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph_org.svg
deleted file mode 100644
index e08035472..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_ab1ad727903d7817c2758d25bcb52cbc8_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator&lt;&lt; Pages: 1 -->
-<svg width="194pt" height="138pt"
- viewBox="0.00 0.00 193.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="63.25,-74.25 0,-74.25 0,-55 63.25,-55 63.25,-74.25"/>
-<text text-anchor="middle" x="31.62" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/left.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="167,-130.25 118,-130.25 118,-111 167,-111 167,-130.25"/>
-<text text-anchor="middle" x="142.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::left</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M49.04,-74.69C62.35,-82.69 81.71,-93.93 99.25,-102.62 101.81,-103.9 104.49,-105.16 107.19,-106.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.65,-109.55 116.21,-110.4 108.48,-103.15 105.65,-109.55"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="171.88,-93.25 113.12,-93.25 113.12,-74 171.88,-74 171.88,-93.25"/>
-<text text-anchor="middle" x="142.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.53,-70.02C75.37,-72.09 89.05,-74.47 101.62,-76.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.81,-80.08 111.27,-78.35 102.02,-73.18 100.81,-80.08"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170.75,-56.25 114.25,-56.25 114.25,-37 170.75,-37 170.75,-56.25"/>
-<text text-anchor="middle" x="142.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.53,-59.52C75.66,-57.51 89.72,-55.19 102.53,-53.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.07,-56.53 112.37,-51.44 101.93,-49.62 103.07,-56.53"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="185.75,-19.25 99.25,-19.25 99.25,0 185.75,0 185.75,-19.25"/>
-<text text-anchor="middle" x="142.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M49.62,-54.54C62.93,-46.8 82.02,-36.05 99.25,-27.62 101.52,-26.52 103.87,-25.4 106.26,-24.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="107.62,-27.53 115.35,-20.28 104.79,-21.13 107.62,-27.53"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ae2edd40354a1ca7aeaee3d1e3589e713_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_ae2edd40354a1ca7aeaee3d1e3589e713_cgraph.map
deleted file mode 100644
index 51f741983..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_ae2edd40354a1ca7aeaee3d1e3589e713_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="operator*" name="operator*">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,79,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="149,5,220,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="79,34,133,25,134,30,80,40"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="127,55,242,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="80,47,112,53,111,58,79,52"/>
-</map>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ae2edd40354a1ca7aeaee3d1e3589e713_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_ae2edd40354a1ca7aeaee3d1e3589e713_cgraph.md5
deleted file mode 100644
index 9054a0617..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_ae2edd40354a1ca7aeaee3d1e3589e713_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4202127763e28c663e8b04654b218f50
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ae2edd40354a1ca7aeaee3d1e3589e713_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_ae2edd40354a1ca7aeaee3d1e3589e713_cgraph.svg
deleted file mode 100644
index 127e778b1..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_ae2edd40354a1ca7aeaee3d1e3589e713_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator* Pages: 1 -->
-<svg width="186pt" height="64pt"
- viewBox="0.00 0.00 185.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>operator*</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="55,-37.25 0,-37.25 0,-18 55,-18 55,-37.25"/>
-<text text-anchor="middle" x="27.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator*</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161,-56.25 107.5,-56.25 107.5,-37 161,-37 161,-56.25"/>
-<text text-anchor="middle" x="134.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.48,-32.52C67.76,-34.75 82.5,-37.42 95.83,-39.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.14,-43.27 105.6,-41.61 96.39,-36.38 95.14,-43.27"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.5,-19.25 91,-19.25 91,0 177.5,0 177.5,-19.25"/>
-<text text-anchor="middle" x="134.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.48,-22.99C62.81,-21.73 71.02,-20.32 79.29,-18.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.76,-22.37 89.02,-17.23 78.57,-15.47 79.76,-22.37"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ae2edd40354a1ca7aeaee3d1e3589e713_cgraph_org.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_ae2edd40354a1ca7aeaee3d1e3589e713_cgraph_org.svg
deleted file mode 100644
index 785e82c37..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_ae2edd40354a1ca7aeaee3d1e3589e713_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator* Pages: 1 -->
-<svg width="186pt" height="64pt"
- viewBox="0.00 0.00 185.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>operator*</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="55,-37.25 0,-37.25 0,-18 55,-18 55,-37.25"/>
-<text text-anchor="middle" x="27.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator*</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="161,-56.25 107.5,-56.25 107.5,-37 161,-37 161,-56.25"/>
-<text text-anchor="middle" x="134.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.48,-32.52C67.76,-34.75 82.5,-37.42 95.83,-39.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.14,-43.27 105.6,-41.61 96.39,-36.38 95.14,-43.27"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.5,-19.25 91,-19.25 91,0 177.5,0 177.5,-19.25"/>
-<text text-anchor="middle" x="134.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.48,-22.99C62.81,-21.73 71.02,-20.32 79.29,-18.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.76,-22.37 89.02,-17.23 78.57,-15.47 79.76,-22.37"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 5578525e4..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,26 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,229,55,255"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="626,204,697,230"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,248,128,271,218,290,295,297,372,290,437,279,502,264,610,231,612,237,503,269,438,284,373,295,295,302,218,295,127,276,54,253"/>
-<area shape="rect" id="Node000003" href="$dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b" title=" " alt="" coords="232,103,358,128"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="46,227,101,189,171,156,237,131,239,136,173,161,104,194,49,231"/>
-<area shape="rect" id="Node000009" href="$dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d" title=" " alt="" coords="103,204,170,230"/>
-<area shape="poly" id="edge9_Node000001_Node000009" title=" " alt="" coords="54,234,87,226,88,231,55,239"/>
-<area shape="rect" id="Node000010" href="$dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493" title=" " alt="" coords="218,255,372,280"/>
-<area shape="poly" id="edge14_Node000001_Node000010" title=" " alt="" coords="55,242,203,256,202,261,55,247"/>
-<area shape="rect" id="Node000004" href="$dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a" title=" " alt="" coords="453,5,542,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="314,100,361,70,419,40,438,32,440,37,421,45,364,75,317,104"/>
-<area shape="rect" id="Node000006" href="$dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb" title=" " alt="" coords="446,55,549,80"/>
-<area shape="poly" id="edge6_Node000003_Node000006" title=" " alt="" coords="352,99,430,81,431,86,353,105"/>
-<area shape="rect" id="Node000007" 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="420,104,575,130"/>
-<area shape="poly" id="edge7_Node000003_Node000007" title=" " alt="" coords="359,113,405,114,405,119,359,119"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="440,153,555,179"/>
-<area shape="poly" id="edge8_Node000003_Node000008" title=" " alt="" coords="350,126,429,146,428,152,349,132"/>
-<area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="543,23,560,30,576,40,607,75,630,115,646,154,656,188,651,190,641,156,625,117,603,78,573,44,558,34,541,28"/>
-<area shape="rect" id="Node000005" href="$dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e" title=" " alt="" coords="623,5,700,31"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="542,16,607,16,607,21,542,21"/>
-<area shape="poly" id="edge10_Node000009_Node000002" title=" " alt="" coords="170,214,610,214,610,220,170,220"/>
-<area shape="poly" id="edge11_Node000009_Node000003" title=" " alt="" coords="148,202,178,174,217,145,241,132,243,137,219,150,182,178,152,206"/>
-<area shape="poly" id="edge13_Node000009_Node000008" title=" " alt="" coords="170,206,218,196,326,180,424,170,424,175,326,185,218,201,171,211"/>
-<area shape="poly" id="edge12_Node000009_Node000010" title=" " alt="" coords="171,225,239,247,238,252,170,230"/>
-</map>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 253e16dc4..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bf05edd71443d2f905eaa04a0c16b406
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 0d3c5d537..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,311 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 229 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 529;
-var viewHeight = 229;
-var sectionId = 'dynsection-3';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-52.68 0,-52.68 0,-33.43 37,-33.43 37,-52.68"/>
-<text text-anchor="middle" x="18.5" y="-39.18" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="518.75,-71.68 465.25,-71.68 465.25,-52.43 518.75,-52.43 518.75,-71.68"/>
-<text text-anchor="middle" x="492" y="-58.18" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-36.58C63.61,-27.4 114.56,-11.05 159.5,-5.06 210.49,1.74 224.23,1.57 275.25,-5.06 339.44,-13.39 411.73,-35.12 454.22,-49.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="452.84,-52.44 463.43,-52.31 455.07,-45.81 452.84,-52.44"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.75,-147.68 170,-147.68 170,-128.43 264.75,-128.43 264.75,-147.68"/>
-<text text-anchor="middle" x="217.38" y="-134.18" font-family="Helvetica,sans-Serif" font-size="10.00">fit_OLS_regressor</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.7,-53.01C42.2,-61.25 57.99,-72.89 73,-81.06 105.66,-98.81 145.04,-114.07 174.26,-124.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.9,-127.55 183.49,-127.5 175.18,-120.93 172.9,-127.55"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="123.5,-71.68 73,-71.68 73,-52.43 123.5,-52.43 123.5,-71.68"/>
-<text text-anchor="middle" x="98.25" y="-58.18" font-family="Helvetica,sans-Serif" font-size="10.00">ols_test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-47.37C44.43,-49.15 53.16,-51.28 61.67,-53.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.59,-56.7 71.13,-55.67 62.25,-49.9 60.59,-56.7"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275.25,-33.68 159.5,-33.68 159.5,-14.43 275.25,-14.43 275.25,-33.68"/>
-<text text-anchor="middle" x="217.38" y="-20.18" font-family="Helvetica,sans-Serif" font-size="10.00">predict_OLS_regressor</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge14_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge14_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-41.34C62.13,-38.94 108.47,-34.47 147.79,-30.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.08,-34.16 157.69,-29.72 147.4,-27.2 148.08,-34.16"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="402.25,-220.68 336,-220.68 336,-201.43 402.25,-201.43 402.25,-220.68"/>
-<text text-anchor="middle" x="369.12" y="-207.18" font-family="Helvetica,sans-Serif" font-size="10.00">get_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M232.93,-148.1C250.76,-160.06 282.17,-180.05 311.25,-193.06 315.61,-195.01 320.25,-196.84 324.92,-198.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="323.73,-201.83 334.33,-201.73 325.99,-195.2 323.73,-201.83"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="407.88,-183.68 330.38,-183.68 330.38,-164.43 407.88,-164.43 407.88,-183.68"/>
-<text text-anchor="middle" x="369.12" y="-170.18" font-family="Helvetica,sans-Serif" font-size="10.00">get_transpose</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.49,-148.18C278.63,-152.54 299.96,-157.67 318.83,-162.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.9,-165.58 328.44,-164.51 319.53,-158.77 317.9,-165.58"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="427,-146.68 311.25,-146.68 311.25,-127.43 427,-127.43 427,-146.68"/>
-<text text-anchor="middle" x="369.12" y="-133.18" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge7_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge7_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.94,-137.74C275.93,-137.67 287.88,-137.59 299.62,-137.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.29,-141.01 309.26,-137.45 299.24,-134.02 299.29,-141.01"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="412.38,-109.68 325.88,-109.68 325.88,-90.43 412.38,-90.43 412.38,-109.68"/>
-<text text-anchor="middle" x="369.12" y="-96.18" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge8_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge8_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.11,-127.97C276.29,-123.36 298.05,-117.84 317.39,-112.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.16,-116.34 327,-110.49 316.44,-109.56 318.16,-116.34"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M402.54,-205.66C411.22,-202.99 420.1,-199.01 427,-193.06 461.07,-163.69 478.68,-111.97 486.26,-83.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="489.66,-83.92 488.63,-73.37 482.86,-82.26 489.66,-83.92"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="521,-220.68 463,-220.68 463,-201.43 521,-201.43 521,-220.68"/>
-<text text-anchor="middle" x="492" y="-207.18" font-family="Helvetica,sans-Serif" font-size="10.00">is_square</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M402.52,-211.06C417.6,-211.06 435.67,-211.06 451.54,-211.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="451.12,-214.56 461.12,-211.06 451.12,-207.56 451.12,-214.56"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node2 -->
-<g id="edge10_Node000009_Node000002" class="edge">
-<title>Node9&#45;&gt;Node2</title>
-<g id="a_edge10_Node000009_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M123.76,-62.06C190.2,-62.06 374.09,-62.06 453.59,-62.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="453.46,-65.56 463.46,-62.06 453.46,-58.56 453.46,-65.56"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge11_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge11_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.72,-71.92C119.99,-83.24 139.78,-101.81 159.5,-114.06 165.1,-117.53 171.29,-120.72 177.47,-123.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.78,-126.65 186.35,-127.41 178.56,-120.23 175.78,-126.65"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node8 -->
-<g id="edge13_Node000009_Node000008" class="edge">
-<title>Node9&#45;&gt;Node8</title>
-<g id="a_edge13_Node000009_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M123.74,-68.41C134.64,-71.07 147.65,-74 159.5,-76.06 211.71,-85.09 271.88,-91.61 314.14,-95.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.78,-99.03 324.06,-96.45 314.42,-92.06 313.78,-99.03"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge12_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge12_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M123.8,-54.09C138.55,-49.3 157.7,-43.09 174.75,-37.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.72,-40.93 184.15,-34.51 173.56,-34.27 175.72,-40.93"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 277c11a18..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,228 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="529pt" height="229pt"
- viewBox="0.00 0.00 529.00 228.68" 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 224.68)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-52.68 0,-52.68 0,-33.43 37,-33.43 37,-52.68"/>
-<text text-anchor="middle" x="18.5" y="-39.18" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="518.75,-71.68 465.25,-71.68 465.25,-52.43 518.75,-52.43 518.75,-71.68"/>
-<text text-anchor="middle" x="492" y="-58.18" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-36.58C63.61,-27.4 114.56,-11.05 159.5,-5.06 210.49,1.74 224.23,1.57 275.25,-5.06 339.44,-13.39 411.73,-35.12 454.22,-49.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="452.84,-52.44 463.43,-52.31 455.07,-45.81 452.84,-52.44"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.75,-147.68 170,-147.68 170,-128.43 264.75,-128.43 264.75,-147.68"/>
-<text text-anchor="middle" x="217.38" y="-134.18" font-family="Helvetica,sans-Serif" font-size="10.00">fit_OLS_regressor</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.7,-53.01C42.2,-61.25 57.99,-72.89 73,-81.06 105.66,-98.81 145.04,-114.07 174.26,-124.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.9,-127.55 183.49,-127.5 175.18,-120.93 172.9,-127.55"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="123.5,-71.68 73,-71.68 73,-52.43 123.5,-52.43 123.5,-71.68"/>
-<text text-anchor="middle" x="98.25" y="-58.18" font-family="Helvetica,sans-Serif" font-size="10.00">ols_test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-47.37C44.43,-49.15 53.16,-51.28 61.67,-53.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.59,-56.7 71.13,-55.67 62.25,-49.9 60.59,-56.7"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275.25,-33.68 159.5,-33.68 159.5,-14.43 275.25,-14.43 275.25,-33.68"/>
-<text text-anchor="middle" x="217.38" y="-20.18" font-family="Helvetica,sans-Serif" font-size="10.00">predict_OLS_regressor</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge14_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge14_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-41.34C62.13,-38.94 108.47,-34.47 147.79,-30.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.08,-34.16 157.69,-29.72 147.4,-27.2 148.08,-34.16"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="402.25,-220.68 336,-220.68 336,-201.43 402.25,-201.43 402.25,-220.68"/>
-<text text-anchor="middle" x="369.12" y="-207.18" font-family="Helvetica,sans-Serif" font-size="10.00">get_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M232.93,-148.1C250.76,-160.06 282.17,-180.05 311.25,-193.06 315.61,-195.01 320.25,-196.84 324.92,-198.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="323.73,-201.83 334.33,-201.73 325.99,-195.2 323.73,-201.83"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="407.88,-183.68 330.38,-183.68 330.38,-164.43 407.88,-164.43 407.88,-183.68"/>
-<text text-anchor="middle" x="369.12" y="-170.18" font-family="Helvetica,sans-Serif" font-size="10.00">get_transpose</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.49,-148.18C278.63,-152.54 299.96,-157.67 318.83,-162.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.9,-165.58 328.44,-164.51 319.53,-158.77 317.9,-165.58"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="427,-146.68 311.25,-146.68 311.25,-127.43 427,-127.43 427,-146.68"/>
-<text text-anchor="middle" x="369.12" y="-133.18" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge7_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge7_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.94,-137.74C275.93,-137.67 287.88,-137.59 299.62,-137.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.29,-141.01 309.26,-137.45 299.24,-134.02 299.29,-141.01"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="412.38,-109.68 325.88,-109.68 325.88,-90.43 412.38,-90.43 412.38,-109.68"/>
-<text text-anchor="middle" x="369.12" y="-96.18" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge8_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge8_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.11,-127.97C276.29,-123.36 298.05,-117.84 317.39,-112.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.16,-116.34 327,-110.49 316.44,-109.56 318.16,-116.34"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M402.54,-205.66C411.22,-202.99 420.1,-199.01 427,-193.06 461.07,-163.69 478.68,-111.97 486.26,-83.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="489.66,-83.92 488.63,-73.37 482.86,-82.26 489.66,-83.92"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="521,-220.68 463,-220.68 463,-201.43 521,-201.43 521,-220.68"/>
-<text text-anchor="middle" x="492" y="-207.18" font-family="Helvetica,sans-Serif" font-size="10.00">is_square</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M402.52,-211.06C417.6,-211.06 435.67,-211.06 451.54,-211.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="451.12,-214.56 461.12,-211.06 451.12,-207.56 451.12,-214.56"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node2 -->
-<g id="edge10_Node000009_Node000002" class="edge">
-<title>Node9&#45;&gt;Node2</title>
-<g id="a_edge10_Node000009_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M123.76,-62.06C190.2,-62.06 374.09,-62.06 453.59,-62.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="453.46,-65.56 463.46,-62.06 453.46,-58.56 453.46,-65.56"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge11_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge11_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.72,-71.92C119.99,-83.24 139.78,-101.81 159.5,-114.06 165.1,-117.53 171.29,-120.72 177.47,-123.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.78,-126.65 186.35,-127.41 178.56,-120.23 175.78,-126.65"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node8 -->
-<g id="edge13_Node000009_Node000008" class="edge">
-<title>Node9&#45;&gt;Node8</title>
-<g id="a_edge13_Node000009_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M123.74,-68.41C134.64,-71.07 147.65,-74 159.5,-76.06 211.71,-85.09 271.88,-91.61 314.14,-95.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.78,-99.03 324.06,-96.45 314.42,-92.06 313.78,-99.03"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge12_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge12_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M123.8,-54.09C138.55,-49.3 157.7,-43.09 174.75,-37.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.72,-40.93 184.15,-34.51 173.56,-34.27 175.72,-40.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_af7243bdc6ae3c7169f01b85bb226e66a_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_af7243bdc6ae3c7169f01b85bb226e66a_cgraph.map
deleted file mode 100644
index 276b9e636..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_af7243bdc6ae3c7169f01b85bb226e66a_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="get_inverse" name="get_inverse">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,94,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="145,5,216,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="94,32,129,25,130,31,95,38"/>
-<area shape="rect" id="Node000003" href="$dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e" title=" " alt="" coords="142,55,219,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="95,49,127,55,126,60,94,54"/>
-</map>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_af7243bdc6ae3c7169f01b85bb226e66a_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_af7243bdc6ae3c7169f01b85bb226e66a_cgraph.md5
deleted file mode 100644
index 1b69ad802..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_af7243bdc6ae3c7169f01b85bb226e66a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b463b7a7b41c9b267f1e8bac800a7e3c
\ No newline at end of file
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_af7243bdc6ae3c7169f01b85bb226e66a_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_af7243bdc6ae3c7169f01b85bb226e66a_cgraph.svg
deleted file mode 100644
index 99268a940..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_af7243bdc6ae3c7169f01b85bb226e66a_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: get_inverse Pages: 1 -->
-<svg width="168pt" height="64pt"
- viewBox="0.00 0.00 168.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>get_inverse</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="66.25,-37.25 0,-37.25 0,-18 66.25,-18 66.25,-37.25"/>
-<text text-anchor="middle" x="33.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158,-56.25 104.5,-56.25 104.5,-37 158,-37 158,-56.25"/>
-<text text-anchor="middle" x="131.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.67,-34.06C75.15,-35.73 84.36,-37.55 93.06,-39.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.14,-42.66 102.63,-41.16 93.49,-35.79 92.14,-42.66"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-19.25 102.25,-19.25 102.25,0 160.25,0 160.25,-19.25"/>
-<text text-anchor="middle" x="131.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">is_square</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.67,-21.53C74.44,-20.08 82.82,-18.51 90.87,-17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.25,-20.49 100.43,-15.21 89.96,-13.61 91.25,-20.49"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_af7243bdc6ae3c7169f01b85bb226e66a_cgraph_org.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_af7243bdc6ae3c7169f01b85bb226e66a_cgraph_org.svg
deleted file mode 100644
index 57e63d336..000000000
--- a/dc/d38/ordinary__least__squares__regressor_8cpp_af7243bdc6ae3c7169f01b85bb226e66a_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: get_inverse Pages: 1 -->
-<svg width="168pt" height="64pt"
- viewBox="0.00 0.00 168.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>get_inverse</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="66.25,-37.25 0,-37.25 0,-18 66.25,-18 66.25,-37.25"/>
-<text text-anchor="middle" x="33.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_inverse</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158,-56.25 104.5,-56.25 104.5,-37 158,-37 158,-56.25"/>
-<text text-anchor="middle" x="131.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.67,-34.06C75.15,-35.73 84.36,-37.55 93.06,-39.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="92.14,-42.66 102.63,-41.16 93.49,-35.79 92.14,-42.66"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-19.25 102.25,-19.25 102.25,0 160.25,0 160.25,-19.25"/>
-<text text-anchor="middle" x="131.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">is_square</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.67,-21.53C74.44,-20.08 82.82,-18.51 90.87,-17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.25,-20.49 100.43,-15.21 89.96,-13.61 91.25,-20.49"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_source.html b/dc/d38/ordinary__least__squares__regressor_8cpp_source.html
new file mode 100644
index 000000000..844fc2f55
--- /dev/null
+++ b/dc/d38/ordinary__least__squares__regressor_8cpp_source.html
@@ -0,0 +1,577 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: machine_learning/ordinary_least_squares_regressor.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dc/d38/ordinary__least__squares__regressor_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">ordinary_least_squares_regressor.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cmath&gt;</span>    <span class="comment">// for std::abs</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;iomanip&gt;</span>  <span class="comment">// for print formatting</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00022" data-start="{" data-end="}">
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"><a class="line" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4">   22</a></span>std::ostream &amp;<a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4">operator&lt;&lt;</a>(std::ostream &amp;out,</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>                         std::vector&lt;std::vector&lt;T&gt;&gt; <span class="keyword">const</span> &amp;v) {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> width = 10;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="keyword">const</span> <span class="keywordtype">char</span> separator = <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; v.size(); row++) {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; v[row].size(); col++) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>            out &lt;&lt; std::left &lt;&lt; std::setw(width) &lt;&lt; std::setfill(separator)</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>                &lt;&lt; v[row][col];</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        }</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        out &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    }</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordflow">return</span> out;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>}</div>
+</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00042" data-start="{" data-end="}">
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ab1ad727903d7817c2758d25bcb52cbc8">   42</a></span>std::ostream &amp;<a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4">operator&lt;&lt;</a>(std::ostream &amp;out, std::vector&lt;T&gt; <span class="keyword">const</span> &amp;v) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> width = 15;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keyword">const</span> <span class="keywordtype">char</span> separator = <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; v.size(); row++) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        out &lt;&lt; std::left &lt;&lt; std::setw(width) &lt;&lt; std::setfill(separator)</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            &lt;&lt; v[row];</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordflow">return</span> out;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>}</div>
+</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00059" data-start="{" data-end="}">
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e">   59</a></span><span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e">is_square</a>(std::vector&lt;std::vector&lt;T&gt;&gt; <span class="keyword">const</span> &amp;A) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="comment">// Assuming A is square matrix</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordtype">size_t</span> N = A.size();</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; N; i++) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">if</span> (A[i].size() != N) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>}</div>
+</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00078" data-start="{" data-end="}">
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"><a class="line" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae2edd40354a1ca7aeaee3d1e3589e713">   78</a></span>std::vector&lt;std::vector&lt;T&gt;&gt; <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae2edd40354a1ca7aeaee3d1e3589e713">operator*</a>(std::vector&lt;std::vector&lt;T&gt;&gt; <span class="keyword">const</span> &amp;A,</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>                                      std::vector&lt;std::vector&lt;T&gt;&gt; <span class="keyword">const</span> &amp;B) {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="comment">// Number of rows in A</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keywordtype">size_t</span> N_A = A.size();</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="comment">// Number of columns in B</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordtype">size_t</span> N_B = B[0].size();</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::vector&lt;std::vector&lt;T&gt;&gt; result(N_A);</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="keywordflow">if</span> (A[0].size() != B.size()) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Number of columns in A != Number of rows in B (&quot;</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>                  &lt;&lt; A[0].size() &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; B.size() &lt;&lt; <span class="stringliteral">&quot;)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    }</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; N_A; row++) {</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        std::vector&lt;T&gt; v(N_B);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; N_B; col++) {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            v[col] = <span class="keyword">static_cast&lt;</span>T<span class="keyword">&gt;</span>(0);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; B.size(); j++) {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>                v[col] += A[row][j] * B[j][col];</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>            }</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        }</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        result[row] = v;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    }</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>}</div>
+</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00112" data-start="{" data-end="}">
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"><a class="line" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a865e8d26a01962cc93aca66e71346f37">  112</a></span>std::vector&lt;T&gt; <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae2edd40354a1ca7aeaee3d1e3589e713">operator*</a>(std::vector&lt;std::vector&lt;T&gt;&gt; <span class="keyword">const</span> &amp;A,</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>                         std::vector&lt;T&gt; <span class="keyword">const</span> &amp;B) {</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="comment">// Number of rows in A</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <span class="keywordtype">size_t</span> N_A = A.size();</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    std::vector&lt;T&gt; result(N_A);</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <span class="keywordflow">if</span> (A[0].size() != B.size()) {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Number of columns in A != Number of rows in B (&quot;</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>                  &lt;&lt; A[0].size() &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; B.size() &lt;&lt; <span class="stringliteral">&quot;)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    }</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; N_A; row++) {</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        result[row] = <span class="keyword">static_cast&lt;</span>T<span class="keyword">&gt;</span>(0);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; B.size(); j++) result[row] += A[row][j] * B[j];</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    }</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>}</div>
+</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00138" data-start="{" data-end="}">
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"><a class="line" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a207b3a99fd5974d3117e0b0ac0aad234">  138</a></span>std::vector&lt;float&gt; <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae2edd40354a1ca7aeaee3d1e3589e713">operator*</a>(<span class="keywordtype">float</span> <span class="keyword">const</span> scalar, std::vector&lt;T&gt; <span class="keyword">const</span> &amp;A) {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <span class="comment">// Number of rows in A</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="keywordtype">size_t</span> N_A = A.size();</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    std::vector&lt;float&gt; result(N_A);</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span> </div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; N_A; row++) {</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        result[row] += A[row] * <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(scalar);</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    }</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span> </div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>}</div>
+</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00156" data-start="{" data-end="}">
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"><a class="line" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a42535e20e97d85aa61271e0894cc0359">  156</a></span>std::vector&lt;float&gt; <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae2edd40354a1ca7aeaee3d1e3589e713">operator*</a>(std::vector&lt;T&gt; <span class="keyword">const</span> &amp;A, <span class="keywordtype">float</span> <span class="keyword">const</span> scalar) {</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    <span class="comment">// Number of rows in A</span></div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    <span class="keywordtype">size_t</span> N_A = A.size();</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span> </div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    std::vector&lt;float&gt; result(N_A);</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span> </div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; N_A; row++) {</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        result[row] = A[row] * <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(scalar);</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    }</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span> </div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>}</div>
+</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span> </div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00174" data-start="{" data-end="}">
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"><a class="line" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7a2d742b9a3ae7b85292e1f86428bb4f">  174</a></span>std::vector&lt;float&gt; <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7a2d742b9a3ae7b85292e1f86428bb4f">operator/</a>(std::vector&lt;T&gt; <span class="keyword">const</span> &amp;A, <span class="keywordtype">float</span> <span class="keyword">const</span> scalar) {</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    <span class="keywordflow">return</span> (1.f / scalar) * A;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>}</div>
+</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span> </div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00183" data-start="{" data-end="}">
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"><a class="line" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4a6a560dbdd0177633783b72db37dc19">  183</a></span>std::vector&lt;T&gt; <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4a6a560dbdd0177633783b72db37dc19">operator-</a>(std::vector&lt;T&gt; <span class="keyword">const</span> &amp;A, std::vector&lt;T&gt; <span class="keyword">const</span> &amp;B) {</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    <span class="comment">// Number of rows in A</span></div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    <span class="keywordtype">size_t</span> N = A.size();</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span> </div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    std::vector&lt;T&gt; result(N);</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span> </div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    <span class="keywordflow">if</span> (B.size() != N) {</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Vector dimensions shouldbe identical!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>        <span class="keywordflow">return</span> A;</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    }</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span> </div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; N; row++) result[row] = A[row] - B[row];</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span> </div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>}</div>
+</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span> </div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00204" data-start="{" data-end="}">
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"><a class="line" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a01e6c7bf2b09272578b9c5819ce0f36f">  204</a></span>std::vector&lt;T&gt; <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a01e6c7bf2b09272578b9c5819ce0f36f">operator+</a>(std::vector&lt;T&gt; <span class="keyword">const</span> &amp;A, std::vector&lt;T&gt; <span class="keyword">const</span> &amp;B) {</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    <span class="comment">// Number of rows in A</span></div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    <span class="keywordtype">size_t</span> N = A.size();</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span> </div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    std::vector&lt;T&gt; result(N);</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span> </div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    <span class="keywordflow">if</span> (B.size() != N) {</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Vector dimensions shouldbe identical!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>        <span class="keywordflow">return</span> A;</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    }</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span> </div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; N; row++) result[row] = A[row] + B[row];</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span> </div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>}</div>
+</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span> </div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00226" data-start="{" data-end="}">
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"><a class="line" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a">  226</a></span>std::vector&lt;std::vector&lt;float&gt;&gt; <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a">get_inverse</a>(</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    std::vector&lt;std::vector&lt;T&gt;&gt; <span class="keyword">const</span> &amp;A) {</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    <span class="comment">// Assuming A is square matrix</span></div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    <span class="keywordtype">size_t</span> N = A.size();</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span> </div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    std::vector&lt;std::vector&lt;float&gt;&gt; inverse(N);</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; N; row++) {</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>        <span class="comment">// preallocatae a resultant identity matrix</span></div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>        inverse[row] = std::vector&lt;float&gt;(N);</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; N; col++) {</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>            inverse[row][col] = (row == col) ? 1.f : 0.f;</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>        }</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    }</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span> </div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e">is_square</a>(A)) {</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;A must be a square matrix!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>        <span class="keywordflow">return</span> inverse;</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    }</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span> </div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    <span class="comment">// preallocatae a temporary matrix identical to A</span></div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    std::vector&lt;std::vector&lt;float&gt;&gt; temp(N);</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; N; row++) {</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>        std::vector&lt;float&gt; v(N);</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; N; col++) {</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>            v[col] = <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(A[row][col]);</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>        }</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>        temp[row] = v;</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    }</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span> </div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>    <span class="comment">// start transformations</span></div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; N; row++) {</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row2 = row; row2 &lt; N &amp;&amp; temp[row][row] == 0; row2++) {</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>            <span class="comment">// this to ensure diagonal elements are not 0</span></div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>            temp[row] = temp[row] + temp[row2];</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>            inverse[row] = inverse[row] + inverse[row2];</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>        }</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span> </div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col2 = row; col2 &lt; N &amp;&amp; temp[row][row] == 0; col2++) {</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>            <span class="comment">// this to further ensure diagonal elements are not 0</span></div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row2 = 0; row2 &lt; N; row2++) {</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>                temp[row2][row] = temp[row2][row] + temp[row2][col2];</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>                inverse[row2][row] = inverse[row2][row] + inverse[row2][col2];</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>            }</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>        }</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span> </div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>        <span class="keywordflow">if</span> (temp[row][row] == 0) {</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>            <span class="comment">// Probably a low-rank matrix and hence singular</span></div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Low-rank matrix, no inverse!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>            <span class="keywordflow">return</span> inverse;</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>        }</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span> </div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>        <span class="comment">// set diagonal to 1</span></div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>        <span class="keyword">auto</span> divisor = <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(temp[row][row]);</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>        temp[row] = temp[row] / divisor;</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>        inverse[row] = inverse[row] / divisor;</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>        <span class="comment">// Row transformations</span></div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row2 = 0; row2 &lt; N; row2++) {</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>            <span class="keywordflow">if</span> (row2 == row) {</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>                <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>            }</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>            <span class="keywordtype">float</span> factor = temp[row2][row];</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>            temp[row2] = temp[row2] - factor * temp[row];</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>            inverse[row2] = inverse[row2] - factor * inverse[row];</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>        }</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>    }</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span> </div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>    <span class="keywordflow">return</span> inverse;</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>}</div>
+</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span> </div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00300" data-start="{" data-end="}">
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"><a class="line" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb">  300</a></span>std::vector&lt;std::vector&lt;T&gt;&gt; <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb">get_transpose</a>(</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>    std::vector&lt;std::vector&lt;T&gt;&gt; <span class="keyword">const</span> &amp;A) {</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>    std::vector&lt;std::vector&lt;T&gt;&gt; result(A[0].size());</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span> </div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; A[0].size(); row++) {</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>        std::vector&lt;T&gt; v(A.size());</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; A.size(); col++) v[col] = A[col][row];</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span> </div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>        result[row] = v;</div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>    }</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>}</div>
+</div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span> </div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00321" data-start="{" data-end="}">
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"><a class="line" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b">  321</a></span>std::vector&lt;float&gt; <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b">fit_OLS_regressor</a>(std::vector&lt;std::vector&lt;T&gt;&gt; <span class="keyword">const</span> &amp;X,</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>                                     std::vector&lt;T&gt; <span class="keyword">const</span> &amp;Y) {</div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>    <span class="comment">// NxF</span></div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>    std::vector&lt;std::vector&lt;T&gt;&gt; X2 = X;</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; X2.size(); i++) {</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>        <span class="comment">// add Y-intercept -&gt; Nx(F+1)</span></div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>        X2[i].push_back(1);</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>    }</div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>    <span class="comment">// (F+1)xN</span></div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>    std::vector&lt;std::vector&lt;T&gt;&gt; Xt = <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb">get_transpose</a>(X2);</div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>    <span class="comment">// (F+1)x(F+1)</span></div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>    std::vector&lt;std::vector&lt;T&gt;&gt; tmp = <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a">get_inverse</a>(Xt * X2);</div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>    <span class="comment">// (F+1)xN</span></div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>    std::vector&lt;std::vector&lt;float&gt;&gt; out = tmp * Xt;</div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>    <span class="comment">// cout &lt;&lt; endl</span></div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>    <span class="comment">//      &lt;&lt; &quot;Projection matrix: &quot; &lt;&lt; X2 * out &lt;&lt; endl;</span></div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span> </div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>    <span class="comment">// Fx1,1    -&gt; (F+1)^th element is the independent constant</span></div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>    <span class="keywordflow">return</span> out * Y;</div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>}</div>
+</div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span> </div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00352" data-start="{" data-end="}">
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"><a class="line" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493">  352</a></span>std::vector&lt;float&gt; <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493">predict_OLS_regressor</a>(std::vector&lt;std::vector&lt;T&gt;&gt; <span class="keyword">const</span> &amp;X,</div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>                                         std::vector&lt;float&gt; <span class="keyword">const</span> &amp;beta </div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>) {</div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>    std::vector&lt;float&gt; result(X.size());</div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span> </div>
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> rows = 0; rows &lt; X.size(); rows++) {</div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>        <span class="comment">// -&gt; start with constant term</span></div>
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>        result[rows] = beta[X[0].size()];</div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> cols = 0; cols &lt; X[0].size(); cols++) {</div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>            result[rows] += beta[cols] * X[rows][cols];</div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>        }</div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>    }</div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>    <span class="comment">// Nx1</span></div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>}</div>
+</div>
+<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span> </div>
+<div class="foldopen" id="foldopen00369" data-start="{" data-end="}">
+<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"><a class="line" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d">  369</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d">ols_test</a>() {</div>
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>    <span class="keywordtype">int</span> F = 3, N = 5;</div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span> </div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>    <span class="comment">/* test function = x^2 -5 */</span></div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 (quadratic function)....&quot;</span>;</div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>    <span class="comment">// create training data set with features = x, x^2, x^3</span></div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>    std::vector&lt;std::vector&lt;float&gt;&gt; data1(</div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>        {{-5, 25, -125}, {-1, 1, -1}, {0, 0, 0}, {1, 1, 1}, {6, 36, 216}});</div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>    <span class="comment">// create corresponding outputs</span></div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>    std::vector&lt;float&gt; Y1({20, -4, -5, -4, 31});</div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>    <span class="comment">// perform regression modelling</span></div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>    std::vector&lt;float&gt; beta1 = <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b">fit_OLS_regressor</a>(data1, Y1);</div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>    <span class="comment">// create test data set with same features = x, x^2, x^3</span></div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>    std::vector&lt;std::vector&lt;float&gt;&gt; test_data1(</div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>        {{-2, 4, -8}, {2, 4, 8}, {-10, 100, -1000}, {10, 100, 1000}});</div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>    <span class="comment">// expected regression outputs</span></div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>    std::vector&lt;float&gt; expected1({-1, -1, 95, 95});</div>
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>    <span class="comment">// predicted regression outputs</span></div>
+<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>    std::vector&lt;float&gt; out1 = <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493">predict_OLS_regressor</a>(test_data1, beta1);</div>
+<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>    <span class="comment">// compare predicted results are within +-0.01 limit of expected</span></div>
+<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> rows = 0; rows &lt; out1.size(); rows++) {</div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>        assert(std::abs(out1[rows] - expected1[rows]) &lt; 0.01);</div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>    }</div>
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span> </div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>    <span class="comment">/* test function = x^3 + x^2 - 100 */</span></div>
+<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 (cubic function)....&quot;</span>;</div>
+<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>    <span class="comment">// create training data set with features = x, x^2, x^3</span></div>
+<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>    std::vector&lt;std::vector&lt;float&gt;&gt; data2(</div>
+<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>        {{-5, 25, -125}, {-1, 1, -1}, {0, 0, 0}, {1, 1, 1}, {6, 36, 216}});</div>
+<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>    <span class="comment">// create corresponding outputs</span></div>
+<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span>    std::vector&lt;float&gt; Y2({-200, -100, -100, 98, 152});</div>
+<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>    <span class="comment">// perform regression modelling</span></div>
+<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>    std::vector&lt;float&gt; beta2 = <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b">fit_OLS_regressor</a>(data2, Y2);</div>
+<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>    <span class="comment">// create test data set with same features = x, x^2, x^3</span></div>
+<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>    std::vector&lt;std::vector&lt;float&gt;&gt; test_data2(</div>
+<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span>        {{-2, 4, -8}, {2, 4, 8}, {-10, 100, -1000}, {10, 100, 1000}});</div>
+<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>    <span class="comment">// expected regression outputs</span></div>
+<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>    std::vector&lt;float&gt; expected2({-104, -88, -1000, 1000});</div>
+<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>    <span class="comment">// predicted regression outputs</span></div>
+<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>    std::vector&lt;float&gt; out2 = <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493">predict_OLS_regressor</a>(test_data2, beta2);</div>
+<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>    <span class="comment">// compare predicted results are within +-0.01 limit of expected</span></div>
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> rows = 0; rows &lt; out2.size(); rows++) {</div>
+<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>        assert(std::abs(out2[rows] - expected2[rows]) &lt; 0.01);</div>
+<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>    }</div>
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span> </div>
+<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>    std::cout &lt;&lt; std::endl;  <span class="comment">// ensure test results are displayed on screen</span></div>
+<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>                             <span class="comment">// (flush stdout)</span></div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>}</div>
+</div>
+<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span> </div>
+<div class="foldopen" id="foldopen00423" data-start="{" data-end="}">
+<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"><a class="line" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  423</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00424" name="l00424"></a><span class="lineno">  424</span>    <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d">ols_test</a>();</div>
+<div class="line"><a id="l00425" name="l00425"></a><span class="lineno">  425</span> </div>
+<div class="line"><a id="l00426" name="l00426"></a><span class="lineno">  426</span>    <span class="keywordtype">size_t</span> N = 0, F = 0;</div>
+<div class="line"><a id="l00427" name="l00427"></a><span class="lineno">  427</span> </div>
+<div class="line"><a id="l00428" name="l00428"></a><span class="lineno">  428</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter number of features: &quot;</span>;</div>
+<div class="line"><a id="l00429" name="l00429"></a><span class="lineno">  429</span>    <span class="comment">// number of features = columns</span></div>
+<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>    std::cin &gt;&gt; F;</div>
+<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter number of samples: &quot;</span>;</div>
+<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>    <span class="comment">// number of samples = rows</span></div>
+<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>    std::cin &gt;&gt; N;</div>
+<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span> </div>
+<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>    std::vector&lt;std::vector&lt;float&gt;&gt; <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>(N);</div>
+<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>    std::vector&lt;float&gt; Y(N);</div>
+<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span> </div>
+<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>    std::cout</div>
+<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>        &lt;&lt; <span class="stringliteral">&quot;Enter training data. Per sample, provide features and one output.&quot;</span></div>
+<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>        &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span> </div>
+<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> rows = 0; rows &lt; N; rows++) {</div>
+<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>        std::vector&lt;float&gt; v(F);</div>
+<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Sample# &quot;</span> &lt;&lt; rows + 1 &lt;&lt; <span class="stringliteral">&quot;: &quot;</span>;</div>
+<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> cols = 0; cols &lt; F; cols++) {</div>
+<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span>            <span class="comment">// get the F features</span></div>
+<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span>            std::cin &gt;&gt; v[cols];</div>
+<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span>        }</div>
+<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span>        <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[rows] = v;</div>
+<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span>        <span class="comment">// get the corresponding output</span></div>
+<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span>        std::cin &gt;&gt; Y[rows];</div>
+<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span>    }</div>
+<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span> </div>
+<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>    std::vector&lt;float&gt; beta = <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b">fit_OLS_regressor</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, Y);</div>
+<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>    std::cout &lt;&lt; std::endl &lt;&lt; std::endl &lt;&lt; <span class="stringliteral">&quot;beta:&quot;</span> &lt;&lt; beta &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span> </div>
+<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>    <span class="keywordtype">size_t</span> T = 0;</div>
+<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter number of test samples: &quot;</span>;</div>
+<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span>    <span class="comment">// number of test sample inputs</span></div>
+<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span>    std::cin &gt;&gt; T;</div>
+<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>    std::vector&lt;std::vector&lt;float&gt;&gt; data2(T);</div>
+<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>    <span class="comment">// vector&lt;float&gt; Y2(T);</span></div>
+<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span> </div>
+<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> rows = 0; rows &lt; T; rows++) {</div>
+<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Sample# &quot;</span> &lt;&lt; rows + 1 &lt;&lt; <span class="stringliteral">&quot;: &quot;</span>;</div>
+<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span>        std::vector&lt;float&gt; v(F);</div>
+<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> cols = 0; cols &lt; F; cols++) std::cin &gt;&gt; v[cols];</div>
+<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span>        data2[rows] = v;</div>
+<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span>    }</div>
+<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span> </div>
+<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span>    std::vector&lt;float&gt; out = <a class="code hl_function" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493">predict_OLS_regressor</a>(data2, beta);</div>
+<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> rows = 0; rows &lt; T; rows++) std::cout &lt;&lt; out[rows] &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span> </div>
+<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span>}</div>
+</div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a01e6c7bf2b09272578b9c5819ce0f36f"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a01e6c7bf2b09272578b9c5819ce0f36f">operator+</a></div><div class="ttdeci">std::vector&lt; T &gt; operator+(std::vector&lt; T &gt; const &amp;A, std::vector&lt; T &gt; const &amp;B)</div><div class="ttdef"><b>Definition</b> <a href="#l00204">ordinary_least_squares_regressor.cpp:204</a></div></div>
+<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a21c80569aaffb7bf1657e54fa4b97deb"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb">get_transpose</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; T &gt; &gt; get_transpose(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="#l00300">ordinary_least_squares_regressor.cpp:300</a></div></div>
+<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a4261f3c3c3dfdb86f3004eb8aaffea8d"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d">ols_test</a></div><div class="ttdeci">void ols_test()</div><div class="ttdef"><b>Definition</b> <a href="#l00369">ordinary_least_squares_regressor.cpp:369</a></div></div>
+<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a4a6a560dbdd0177633783b72db37dc19"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4a6a560dbdd0177633783b72db37dc19">operator-</a></div><div class="ttdeci">std::vector&lt; T &gt; operator-(std::vector&lt; T &gt; const &amp;A, std::vector&lt; T &gt; const &amp;B)</div><div class="ttdef"><b>Definition</b> <a href="#l00183">ordinary_least_squares_regressor.cpp:183</a></div></div>
+<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a7075a0fccad9b2d79be0275bfe8948d4"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4">operator&lt;&lt;</a></div><div class="ttdeci">std::ostream &amp; operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;v)</div><div class="ttdef"><b>Definition</b> <a href="#l00022">ordinary_least_squares_regressor.cpp:22</a></div></div>
+<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a7a2d742b9a3ae7b85292e1f86428bb4f"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7a2d742b9a3ae7b85292e1f86428bb4f">operator/</a></div><div class="ttdeci">std::vector&lt; float &gt; operator/(std::vector&lt; T &gt; const &amp;A, float const scalar)</div><div class="ttdef"><b>Definition</b> <a href="#l00174">ordinary_least_squares_regressor.cpp:174</a></div></div>
+<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a8fa731952b0ee3bc7ec51c51ed21911e"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e">is_square</a></div><div class="ttdeci">bool is_square(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="#l00059">ordinary_least_squares_regressor.cpp:59</a></div></div>
+<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_aaddc683af581b51351e1023d2a01ef3b"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b">fit_OLS_regressor</a></div><div class="ttdeci">std::vector&lt; float &gt; fit_OLS_regressor(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;X, std::vector&lt; T &gt; const &amp;Y)</div><div class="ttdef"><b>Definition</b> <a href="#l00321">ordinary_least_squares_regressor.cpp:321</a></div></div>
+<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_ade6e463f37878fe2a219f927c65b5493"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493">predict_OLS_regressor</a></div><div class="ttdeci">std::vector&lt; float &gt; predict_OLS_regressor(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;X, std::vector&lt; float &gt; const &amp;beta)</div><div class="ttdef"><b>Definition</b> <a href="#l00352">ordinary_least_squares_regressor.cpp:352</a></div></div>
+<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_ae2edd40354a1ca7aeaee3d1e3589e713"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae2edd40354a1ca7aeaee3d1e3589e713">operator*</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; T &gt; &gt; operator*(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A, std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;B)</div><div class="ttdef"><b>Definition</b> <a href="#l00078">ordinary_least_squares_regressor.cpp:78</a></div></div>
+<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00423">ordinary_least_squares_regressor.cpp:423</a></div></div>
+<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_af7243bdc6ae3c7169f01b85bb226e66a"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a">get_inverse</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; float &gt; &gt; get_inverse(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="#l00226">ordinary_least_squares_regressor.cpp:226</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_3343723ae086de42ee4ca9774da3a13f.html">machine_learning</a></li><li class="navelem"><a class="el" href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html">ordinary_least_squares_regressor.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dc/d3a/namespacesubset__sum.html b/dc/d3a/namespacesubset__sum.html
index 15abc068f..b26818d5a 100644
--- a/dc/d3a/namespacesubset__sum.html
+++ b/dc/d3a/namespacesubset__sum.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: subset_sum Namespace Reference</title>
+<title>TheAlgorithms/C++: subset_sum Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dc/d52/linear__recurrence__matrix_8cpp_source.html b/dc/d52/linear__recurrence__matrix_8cpp_source.html
new file mode 100644
index 000000000..2b33edc35
--- /dev/null
+++ b/dc/d52/linear__recurrence__matrix_8cpp_source.html
@@ -0,0 +1,409 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/linear_recurrence_matrix.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dc/d52/linear__recurrence__matrix_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">linear_recurrence_matrix.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/dd1/namespacelinear__recurrence__matrix.html">linear_recurrence_matrix</a> {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T = <span class="keywordtype">int</span>64_t&gt;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>std::vector&lt;std::vector&lt;T&gt;&gt; matrix_multiplication(</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keyword">const</span> std::vector&lt;std::vector&lt;T&gt;&gt;&amp; _mat_a,</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keyword">const</span> std::vector&lt;std::vector&lt;T&gt;&gt;&amp; _mat_b, <span class="keyword">const</span> int64_t mod = 1000000007) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="comment">// assert that columns in `_mat_a` and rows in `_mat_b` are equal</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    assert(_mat_a[0].size() == _mat_b.size());</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    std::vector&lt;std::vector&lt;T&gt;&gt; _mat_c(_mat_a.size(),</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>                                       std::vector&lt;T&gt;(_mat_b[0].size(), 0));</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; _mat_a.size(); ++i) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordflow">for</span> (uint32_t j = 0; j &lt; _mat_b[0].size(); ++j) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            <span class="keywordflow">for</span> (uint32_t k = 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> &lt; _mat_b.size(); ++<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>                _mat_c[i][j] =</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>                    (_mat_c[i][j] % mod +</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>                     (_mat_a[i][<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] % mod * _mat_b[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>][j] % mod) % mod) %</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>                    mod;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    }</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordflow">return</span> _mat_c;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>}</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T = <span class="keywordtype">int</span>64_t&gt;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span><span class="keywordtype">bool</span> is_zero_matrix(<span class="keyword">const</span> std::vector&lt;std::vector&lt;T&gt;&gt;&amp; _mat) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; _mat.size(); ++i) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        <span class="keywordflow">for</span> (uint32_t j = 0; j &lt; _mat[i].size(); ++j) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>            <span class="keywordflow">if</span> (_mat[i][j] != 0) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>}</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T = <span class="keywordtype">int</span>64_t&gt;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>std::vector&lt;std::vector&lt;T&gt;&gt; matrix_exponentiation(</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    std::vector&lt;std::vector&lt;T&gt;&gt; _mat, uint64_t <a class="code hl_function" href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">power</a>,</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="keyword">const</span> int64_t mod = 1000000007) {</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="keywordflow">if</span> (is_zero_matrix(_mat)) {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        <span class="keywordflow">return</span> _mat;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    }</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::vector&lt;std::vector&lt;T&gt;&gt; _mat_answer(_mat.size(),</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>                                            std::vector&lt;T&gt;(_mat.size(), 0));</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; _mat.size(); ++i) {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        _mat_answer[i][i] = 1;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    }</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="comment">// exponentiation algorithm here.</span></div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    <span class="keywordflow">while</span> (<a class="code hl_function" href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">power</a> &gt; 0) {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">power</a> &amp; 1) {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>            _mat_answer = matrix_multiplication(_mat_answer, _mat, mod);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        }</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <a class="code hl_function" href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">power</a> &gt;&gt;= 1;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        _mat = matrix_multiplication(_mat, _mat, mod);</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    }</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <span class="keywordflow">return</span> _mat_answer;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>}</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span> </div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T = <span class="keywordtype">int</span>64_t&gt;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>T get_nth_term_of_recurrence_series(</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    <span class="keyword">const</span> std::vector&lt;std::vector&lt;T&gt;&gt;&amp; _mat,</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    <span class="keyword">const</span> std::vector&lt;std::vector&lt;T&gt;&gt;&amp; _base_cases, uint64_t nth_term,</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    <span class="keywordtype">bool</span> constant_or_sum_included = <span class="keyword">false</span>) {</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    assert(_mat.size() == _base_cases.back().size());</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span> </div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    <span class="keywordflow">if</span> (nth_term &lt; _base_cases.back().size() - constant_or_sum_included) {</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        <span class="keywordflow">return</span> _base_cases.back()[nth_term - constant_or_sum_included];</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>        std::vector&lt;std::vector&lt;T&gt;&gt; _res_matrix =</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>            matrix_exponentiation(_mat, nth_term - _base_cases.back().size() +</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>                                            1 + constant_or_sum_included);</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span> </div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        std::vector&lt;std::vector&lt;T&gt;&gt; _res =</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>            matrix_multiplication(_base_cases, _res_matrix);</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span> </div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>        <span class="keywordflow">return</span> _res.back().back();</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    }</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>}</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>}  <span class="comment">// namespace linear_recurrence_matrix</span></div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span> </div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    <span class="comment">/*</span></div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span><span class="comment">     * Example 1: [Fibonacci</span></div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span><span class="comment">     * series](https://en.wikipedia.org/wiki/Fibonacci_number);</span></div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span><span class="comment">     * [fn-2    fn-1]  [0      1]  ==   [fn-1   (fn-2 + fn-1)] =&gt; [fn-1   fn]</span></div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span><span class="comment">     *                 [1      1]</span></div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span><span class="comment">     * Let A = [fn-2   fn-1], and B = [0   1]</span></div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span><span class="comment">     *                                [1   1],</span></div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span><span class="comment">     * Since, A.B....(n-1 times) = [fn-1   fn]</span></div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span><span class="comment">     * we can multiply B with itself n-1 times to obtain the required value</span></div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    std::vector&lt;std::vector&lt;int64_t&gt;&gt; fibonacci_matrix = {{0, 1}, {1, 1}},</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>                                      fib_base_case = {{0, 1}};</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span> </div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    assert(math::linear_recurrence_matrix::get_nth_term_of_recurrence_series(</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>               fibonacci_matrix, fib_base_case, 11) == 89LL);</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    assert(math::linear_recurrence_matrix::get_nth_term_of_recurrence_series(</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>               fibonacci_matrix, fib_base_case, 39) == 63245986LL);</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    <span class="comment">/*</span></div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span><span class="comment">     * Example 2: [Tribonacci series](https://oeis.org/A000073)</span></div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span><span class="comment">     *                    [0   0   1]</span></div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span><span class="comment">     * [fn-3  fn-2  fn-1] [1   0   1]  =  [(fn-2)  (fn-1)  (fn-3 + fn-2 + fn-1)]</span></div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span><span class="comment">     *                    [0   1   1]</span></div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span><span class="comment">     *                                 =&gt; [fn-2     fn-1    fn]</span></div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span><span class="comment">     *                                       [0   0   1]</span></div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span><span class="comment">     * Let A = [fn-3   fn-2   fn-1], and B = [1   0   1]</span></div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span><span class="comment">     *                                       [0   1   1]</span></div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span><span class="comment">     * Since, A.B....(n-2 times) = [fn-2  fn-1   fn]</span></div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span><span class="comment">     * we will have multiply B with itself n-2 times to obtain the required</span></div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span><span class="comment">     * value ()</span></div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span> </div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    std::vector&lt;std::vector&lt;int64_t&gt;&gt; tribonacci = {{0, 0, 1},</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>                                                    {1, 0, 1},</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>                                                    {0, 1, 1}},</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>                                      trib_base_case = {</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>                                          {0, 0, 1}};  <span class="comment">// f0 = 0, f1 = 0, f2 = 1</span></div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span> </div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    assert(math::linear_recurrence_matrix::get_nth_term_of_recurrence_series(</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>               tribonacci, trib_base_case, 11) == 149LL);</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    assert(math::linear_recurrence_matrix::get_nth_term_of_recurrence_series(</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>               tribonacci, trib_base_case, 36) == 615693474LL);</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span> </div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    <span class="comment">/*</span></div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span><span class="comment">     * Example 3: [Pell numbers](https://oeis.org/A000129)</span></div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span><span class="comment">     * `f(n)  = 2* f(n-1) + f(n-2); f(0) = f(1) = 2`</span></div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span><span class="comment">     * [fn-2  fn-1] [0   1]  =  [(fn-1)  fn-2 + 2*fn-1)]</span></div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span><span class="comment">     *              [1   2]</span></div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span><span class="comment">     *                       =&gt; [fn-1     fn]</span></div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span><span class="comment">     * Let A = [fn-2  fn-1], and B = [0   1]</span></div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span><span class="comment">     *                               [1   2]</span></div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span> </div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    std::vector&lt;std::vector&lt;int64_t&gt;&gt; pell_recurrence = {{0, 1}, {1, 2}},</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>                                      pell_base_case = {</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>                                          {2, 2}};  <span class="comment">// `f0 = 2, f1 = 2`</span></div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span> </div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    assert(math::linear_recurrence_matrix::get_nth_term_of_recurrence_series(</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>               pell_recurrence, pell_base_case, 15) == 551614LL);</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>    assert(math::linear_recurrence_matrix::get_nth_term_of_recurrence_series(</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>               pell_recurrence, pell_base_case, 23) == 636562078LL);</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span> </div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    <span class="comment">/*</span></div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span><span class="comment">     * Example 4: Custom recurrence relation:</span></div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span><span class="comment">     * Now the recurrence is of the form `a*f(n-1) + b*(fn-2) + ... + c`</span></div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span><span class="comment">     * where `c` is the constant</span></div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span><span class="comment">     * `f(n)  = 2* f(n-1) + f(n-2) + 7; f(0) = f(1) = 2, c = 7`</span></div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span><span class="comment">     *                   [1   0   1]</span></div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span><span class="comment">     * [7,  fn-2,  fn-1] [0   0   1]</span></div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span><span class="comment">     *                   [0   1   2]</span></div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span><span class="comment">     * =  [7,  (fn-1),  fn-2 + 2*fn-1) + 7]</span></div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span><span class="comment">     * =&gt; [7,    fn-1,     fn]</span></div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span><span class="comment">     * :: Series will be 2, 2, 13, 35, 90, 222, 541, 1311, 3170, 7658, 18493,</span></div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span><span class="comment">     * 44651, 107802, 260262, 628333, 1516935, 362210, 8841362, 21344941,</span></div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span><span class="comment">     * 51531251</span></div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span><span class="comment">     * Let A = [7,  fn-2,  fn-1], and B = [1   0   1]</span></div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span><span class="comment">     *                                    [0   0   1]</span></div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span><span class="comment">     *                                    [0   1   2]</span></div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span> </div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    std::vector&lt;std::vector&lt;int64_t&gt;&gt;</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>        custom_recurrence = {{1, 0, 1}, {0, 0, 1}, {0, 1, 2}},</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>        custom_base_case = {{7, 2, 2}};  <span class="comment">// `c = 7, f0 = 2, f1 = 2`</span></div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span> </div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>    assert(math::linear_recurrence_matrix::get_nth_term_of_recurrence_series(</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>               custom_recurrence, custom_base_case, 10, 1) == 18493LL);</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>    assert(math::linear_recurrence_matrix::get_nth_term_of_recurrence_series(</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>               custom_recurrence, custom_base_case, 19, 1) == 51531251LL);</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span> </div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>    <span class="comment">/*</span></div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span><span class="comment">     * Example 5: Sum fibonacci sequence</span></div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span><span class="comment">     * The following matrix evaluates the sum of first n fibonacci terms in</span></div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span><span class="comment">     * O(27. log2(n)) time.</span></div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span><span class="comment">     * `f(n) = f(n-1) + f(n-2); f(0) = 0, f(1) = 1`</span></div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span><span class="comment">     *                           [1   0   0]</span></div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span><span class="comment">     * [s(f, n-1),  fn-2,  fn-1] [1   0   1]</span></div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span><span class="comment">     *                           [1   1   1]</span></div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span><span class="comment">     *   =&gt; [(s(f, n-1)+f(n-2)+f(n-1)), (fn-1),  f(n-2)+f(n-1)]</span></div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span><span class="comment">     *   =&gt; [s(f, n-1)+f(n),    fn-1,     fn]</span></div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span><span class="comment">     *   =&gt; [s(f, n),    fn-1,     fn]</span></div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span><span class="comment">     * Sum of first 20 fibonacci series:</span></div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span><span class="comment">     * 0, 1, 2, 4, 7, 12, 20, 33, 54, 88, 143, 232, 376, 609, 986, 1596, 2583,</span></div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span><span class="comment">     * 4180, 6764</span></div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span><span class="comment">     *          f0  f1  s(f,1)</span></div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span><span class="comment">     * Let A = [0    1    1], and B = [0   1   1]</span></div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span><span class="comment">     *                                [1   1   1]</span></div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span><span class="comment">     *                                [0   0   1]</span></div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span> </div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>    std::vector&lt;std::vector&lt;int64_t&gt;&gt; sum_fibo_recurrence = {{0, 1, 1},</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>                                                             {1, 1, 1},</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>                                                             {0, 0, 1}},</div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>                                      sum_fibo_base_case = {</div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>                                          {0, 1, 1}};  <span class="comment">// `f0 = 0, f1 = 1`</span></div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span> </div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>    assert(math::linear_recurrence_matrix::get_nth_term_of_recurrence_series(</div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>               sum_fibo_recurrence, sum_fibo_base_case, 13, 1) == 609LL);</div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>    assert(math::linear_recurrence_matrix::get_nth_term_of_recurrence_series(</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>               sum_fibo_recurrence, sum_fibo_base_case, 16, 1) == 2583LL);</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>    <span class="comment">/*</span></div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span><span class="comment">     * Example 6: [Tribonacci sum series](https://oeis.org/A000073)</span></div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span><span class="comment">     *                               [0   0   1   1]</span></div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span><span class="comment">     * [fn-3  fn-2  fn-1  s(f, n-1)] [1   0   1   1]</span></div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span><span class="comment">     *                               [0   1   1   1]</span></div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span><span class="comment">     *                               [0   0   0   1]</span></div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span><span class="comment">     * = [fn-2, fn-1, fn-3 + fn-2 + fn-1, (fn-3 + fn-2 + fn-1 + s(f, n-1))]</span></div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span><span class="comment">     * =&gt; [fn-2, fn-1, fn,  fn + s(f, n-1)]</span></div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span><span class="comment">     * =&gt; [fn-2, fn-1, fn, s(f, n)]</span></div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span><span class="comment">     * Sum of the series is: 0, 0, 1, 2, 4, 8, 15, 28, 52, 96, 177, 326, 600,</span></div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span><span class="comment">     * 1104, 2031, 3736, 6872, 12640, 23249, 42762</span></div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span><span class="comment">     * Let A = [fn-3   fn-2   fn-1   s(f, n-1)], and</span></div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span><span class="comment">     *     [0   0   1   1]</span></div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span><span class="comment">     * B = [1   0   1   1]</span></div>
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span><span class="comment">     *     [0   1   1   1]</span></div>
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span><span class="comment">     *     [0   0   0   1]</span></div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span><span class="comment">     *</span></div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span><span class="comment">     * Since, A.B....(n-2 times) = [fn-2  fn-1   fn]</span></div>
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span><span class="comment">     * we will have multiply B with itself n-2 times to obtain the required</span></div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span><span class="comment">     * value</span></div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span> </div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>    std::vector&lt;std::vector&lt;int64_t&gt;&gt; tribonacci_sum = {{0, 0, 1, 1},</div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>                                                        {1, 0, 1, 1},</div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>                                                        {0, 1, 1, 1},</div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>                                                        {0, 0, 0, 1}},</div>
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>                                      trib_sum_base_case = {{0, 0, 1, 1}};</div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>    <span class="comment">// `f0 = 0, f1 = 0, f2 = 1, s = 1`</span></div>
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span> </div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>    assert(math::linear_recurrence_matrix::get_nth_term_of_recurrence_series(</div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>               tribonacci_sum, trib_sum_base_case, 18, 1) == 23249LL);</div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>    assert(math::linear_recurrence_matrix::get_nth_term_of_recurrence_series(</div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>               tribonacci_sum, trib_sum_base_case, 19, 1) == 42762LL);</div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>}</div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span> </div>
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>    <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>}</div>
+<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00100">caesar_cipher.cpp:100</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacelinear__recurrence__matrix_html"><div class="ttname"><a href="../../d9/dd1/namespacelinear__recurrence__matrix.html">linear_recurrence_matrix</a></div><div class="ttdoc">Functions for Linear Recurrence Matrix implementation.</div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_afcd07701d73ed65cd616bcba02737f3d"><div class="ttname"><a href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">math::power</a></div><div class="ttdeci">uint64_t power(uint64_t a, uint64_t b, uint64_t c)</div><div class="ttdoc">This function calculates a raised to exponent b under modulo c using modular exponentiation.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/d6d/modular__exponentiation_8cpp_source.html#l00035">modular_exponentiation.cpp:35</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><b>linear_recurrence_matrix.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.map b/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.map
index ce4dc1d03..4abe656ee 100644
--- a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.map
+++ b/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.map
@@ -1,5 +1,5 @@
 <map id="std::is_integral&lt; uint256_t &gt;" name="std::is_integral&lt; uint256_t &gt;">
 <area shape="rect" id="Node000001" title=" " alt="" coords="5,79,189,105"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integral_constant.html" title=" " alt="" coords="46,5,148,31"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="46,5,148,31"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="100,46,100,79,94,79,94,46"/>
 </map>
diff --git a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.md5 b/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.md5
index 788d8c929..1a663bd01 100644
--- a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.md5
+++ b/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.md5
@@ -1 +1 @@
-a5f53b759dc7234205449bd588ef3a2b
\ No newline at end of file
+bbaa537b5da9cdc9be75d53307994ca9
\ No newline at end of file
diff --git a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.svg b/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.svg
index 3bf5a37da..2b19f7128 100644
--- a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.svg
+++ b/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="106.75,-74.5 30.75,-74.5 30.75,-55.25 106.75,-55.25 106.75,-74.5"/>
 <text text-anchor="middle" x="68.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph_org.svg b/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph_org.svg
index 8ccc85c37..714929c92 100644
--- a/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph_org.svg
+++ b/dc/d55/structstd_1_1is__integral_3_01uint256__t_01_4__coll__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="106.75,-74.5 30.75,-74.5 30.75,-55.25 106.75,-55.25 106.75,-74.5"/>
 <text text-anchor="middle" x="68.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/dc/d5a/rat__maze_8cpp.html b/dc/d5a/rat__maze_8cpp.html
index 12dad7407..930a5b07f 100644
--- a/dc/d5a/rat__maze_8cpp.html
+++ b/dc/d5a/rat__maze_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: backtracking/rat_maze.cpp File Reference</title>
+<title>TheAlgorithms/C++: backtracking/rat_maze.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for rat_maze.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d01/rat__maze_8cpp__incl.svg" width="246" height="111"><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">
+</div>
+<p><a href="../../dc/d5a/rat__maze_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html">backtracking</a></td></tr>
@@ -136,7 +155,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ab99107bfb4c6934cd4691868c66c0aa3" id="r_ab99107bfb4c6934cd4691868c66c0aa3"><td class="memTemplParams" colspan="2">template&lt;size_t size&gt; </td></tr>
-<tr class="memitem:ab99107bfb4c6934cd4691868c66c0aa3"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ab99107bfb4c6934cd4691868c66c0aa3">backtracking::rat_maze::solveMaze</a> (int currposrow, int currposcol, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, size &gt;, size &gt; &amp;maze, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, size &gt;, size &gt; soln)</td></tr>
+<tr class="memitem:ab99107bfb4c6934cd4691868c66c0aa3"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ab99107bfb4c6934cd4691868c66c0aa3">backtracking::rat_maze::solveMaze</a> (int currposrow, int currposcol, const std::array&lt; std::array&lt; int, size &gt;, size &gt; &amp;maze, std::array&lt; std::array&lt; int, size &gt;, size &gt; soln)</td></tr>
 <tr class="memdesc:ab99107bfb4c6934cd4691868c66c0aa3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Solve rat maze problem.  <br /></td></tr>
 <tr class="separator:ab99107bfb4c6934cd4691868c66c0aa3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -153,6 +172,8 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/vaithak" target="_blank">Vaibhav Thakkar</a> </dd>
 <dd>
 <a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../dc/d5a/rat__maze_8cpp_source.html">rat_maze.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -171,17 +192,14 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d5a/rat__maze_8cpp_source.html#l00112">112</a> of file <a class="el" href="../../dc/d5a/rat__maze_8cpp_source.html">rat_maze.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  112</span>           {</div>
 <div class="line"><span class="lineno">  113</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  114</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  115</span>}</div>
-<div class="ttc" id="arat__maze_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> rat_maze.cpp:86</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="arat__maze_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d5a/rat__maze_8cpp_source.html#l00086">rat_maze.cpp:86</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ab99107bfb4c6934cd4691868c66c0aa3" name="ab99107bfb4c6934cd4691868c66c0aa3"></a>
@@ -205,12 +223,12 @@ template&lt;size_t size&gt; </div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, size &gt;, size &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>maze</em></span>, </td>
+          <td class="paramtype">const std::array&lt; std::array&lt; int, size &gt;, size &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>maze</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, size &gt;, size &gt;</td>          <td class="paramname"><span class="paramname"><em>soln</em></span>&#160;)</td>
+          <td class="paramtype">std::array&lt; std::array&lt; int, size &gt;, size &gt;</td>          <td class="paramname"><span class="paramname"><em>soln</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -234,14 +252,16 @@ template&lt;size_t size&gt; </div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if there exists a solution to move one step ahead in a column or in a row </dd>
 <dd>
 <code>false</code> for the backtracking part </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d5a/rat__maze_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../dc/d5a/rat__maze_8cpp_source.html">rat_maze.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   49</span>                                                         {</div>
 <div class="line"><span class="lineno">   50</span>    <span class="keywordflow">if</span> ((currposrow == size - 1) &amp;&amp; (currposcol == size - 1)) {</div>
 <div class="line"><span class="lineno">   51</span>        soln[currposrow][currposcol] = 1;</div>
 <div class="line"><span class="lineno">   52</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
 <div class="line"><span class="lineno">   53</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; size; ++j) {</div>
-<div class="line"><span class="lineno">   54</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; soln[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   54</span>                std::cout &lt;&lt; soln[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   55</span>            }</div>
-<div class="line"><span class="lineno">   56</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   56</span>            std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   57</span>        }</div>
 <div class="line"><span class="lineno">   58</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   59</span>    } <span class="keywordflow">else</span> {</div>
@@ -264,15 +284,8 @@ template&lt;size_t size&gt; </div>
 <div class="line"><span class="lineno">   76</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   77</span>    }</div>
 <div class="line"><span class="lineno">   78</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="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="arat__maze_8cpp_html_ab99107bfb4c6934cd4691868c66c0aa3"><div class="ttname"><a href="#ab99107bfb4c6934cd4691868c66c0aa3">backtracking::rat_maze::solveMaze</a></div><div class="ttdeci">bool solveMaze(int currposrow, int currposcol, const std::array&lt; std::array&lt; int, size &gt;, size &gt; &amp;maze, std::array&lt; std::array&lt; int, size &gt;, size &gt; soln)</div><div class="ttdoc">Solve rat maze problem.</div><div class="ttdef"><b>Definition</b> rat_maze.cpp:47</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.svg" width="288" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="arat__maze_8cpp_html_ab99107bfb4c6934cd4691868c66c0aa3"><div class="ttname"><a href="#ab99107bfb4c6934cd4691868c66c0aa3">backtracking::rat_maze::solveMaze</a></div><div class="ttdeci">bool solveMaze(int currposrow, int currposcol, const std::array&lt; std::array&lt; int, size &gt;, size &gt; &amp;maze, std::array&lt; std::array&lt; int, size &gt;, size &gt; soln)</div><div class="ttdoc">Solve rat maze problem.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d5a/rat__maze_8cpp_source.html#l00047">rat_maze.cpp:47</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -300,13 +313,15 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d5a/rat__maze_8cpp_source.html#l00086">86</a> of file <a class="el" href="../../dc/d5a/rat__maze_8cpp_source.html">rat_maze.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   86</span>                   {</div>
 <div class="line"><span class="lineno">   87</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> size = 4;</div>
-<div class="line"><span class="lineno">   88</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;int, size&gt;</a>, size&gt; maze = {</div>
-<div class="line"><span class="lineno">   89</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, size&gt;</a>{1, 0, 1, 0}, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, size&gt;</a>{1, 0, 1, 1},</div>
-<div class="line"><span class="lineno">   90</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, size&gt;</a>{1, 0, 0, 1}, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, size&gt;</a>{1, 1, 1, 1}};</div>
+<div class="line"><span class="lineno">   88</span>    std::array&lt;std::array&lt;int, size&gt;, size&gt; maze = {</div>
+<div class="line"><span class="lineno">   89</span>        std::array&lt;int, size&gt;{1, 0, 1, 0}, std::array&lt;int, size&gt;{1, 0, 1, 1},</div>
+<div class="line"><span class="lineno">   90</span>        std::array&lt;int, size&gt;{1, 0, 0, 1}, std::array&lt;int, size&gt;{1, 1, 1, 1}};</div>
 <div class="line"><span class="lineno">   91</span> </div>
-<div class="line"><span class="lineno">   92</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;int, size&gt;</a>, size&gt; soln{};</div>
+<div class="line"><span class="lineno">   92</span>    std::array&lt;std::array&lt;int, size&gt;, size&gt; soln{};</div>
 <div class="line"><span class="lineno">   93</span> </div>
 <div class="line"><span class="lineno">   94</span>    <span class="comment">// Backtracking: setup matrix solution to zero</span></div>
 <div class="line"><span class="lineno">   95</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
@@ -321,7 +336,6 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  104</span>    assert(backtracking::rat_maze::solveMaze&lt;size&gt;(currposrow, currposcol, maze,</div>
 <div class="line"><span class="lineno">  105</span>                                                   soln) == 1);</div>
 <div class="line"><span class="lineno">  106</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.map b/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.map
deleted file mode 100644
index d7c02b35f..000000000
--- a/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="backtracking::rat_maze::solveMaze" name="backtracking::rat_maze::solveMaze">
-<area shape="rect" id="Node000001" title="Solve rat maze problem." alt="" coords="5,29,163,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="53,29,51,19,56,11,67,5,84,3,102,5,113,11,110,16,100,10,84,8,69,10,60,14,56,20,58,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="211,37,282,62"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="163,47,195,47,195,52,163,52"/>
-</map>
diff --git a/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.md5 b/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.md5
deleted file mode 100644
index 9b6ef8f9d..000000000
--- a/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-417f5ed0082aff55f2cf33e3a0e01ef5
\ No newline at end of file
diff --git a/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.svg b/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.svg
deleted file mode 100644
index ecc7ce2dc..000000000
--- a/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::rat_maze::solveMaze Pages: 1 -->
-<svg width="216pt" height="57pt"
- viewBox="0.00 0.00 215.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::rat_maze::solveMaze</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Solve rat maze problem.">
-<polygon fill="#999999" stroke="#666666" points="118,-30.5 0,-30.5 0,0 118,0 118,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::rat_maze</text>
-<text text-anchor="middle" x="59" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::solveMaze</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.43,-30.99C33.02,-40.06 40.21,-48.5 59,-48.5 69.27,-48.5 76.08,-45.97 79.42,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.87,-42.8 80.42,-32.49 75.91,-42.08 82.87,-42.8"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="207.5,-24.88 154,-24.88 154,-5.63 207.5,-5.63 207.5,-24.88"/>
-<text text-anchor="middle" x="180.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.47,-15.25C126.58,-15.25 134.71,-15.25 142.29,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.14,-18.75 152.14,-15.25 142.14,-11.75 142.14,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph_org.svg b/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph_org.svg
deleted file mode 100644
index 9ef021a3d..000000000
--- a/dc/d5a/rat__maze_8cpp_ab99107bfb4c6934cd4691868c66c0aa3_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::rat_maze::solveMaze Pages: 1 -->
-<svg width="216pt" height="57pt"
- viewBox="0.00 0.00 215.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>backtracking::rat_maze::solveMaze</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Solve rat maze problem.">
-<polygon fill="#999999" stroke="#666666" points="118,-30.5 0,-30.5 0,0 118,0 118,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::rat_maze</text>
-<text text-anchor="middle" x="59" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::solveMaze</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.43,-30.99C33.02,-40.06 40.21,-48.5 59,-48.5 69.27,-48.5 76.08,-45.97 79.42,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.87,-42.8 80.42,-32.49 75.91,-42.08 82.87,-42.8"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="207.5,-24.88 154,-24.88 154,-5.63 207.5,-5.63 207.5,-24.88"/>
-<text text-anchor="middle" x="180.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.47,-15.25C126.58,-15.25 134.71,-15.25 142.29,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.14,-18.75 152.14,-15.25 142.14,-11.75 142.14,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 48795a95e..000000000
--- a/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 313fd0723..000000000
--- a/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-063aab01af0db7f9b281c08f6379a222
\ No newline at end of file
diff --git a/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index beec8185c..000000000
--- a/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 615faebca..000000000
--- a/dc/d5a/rat__maze_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d5a/rat__maze_8cpp_source.html b/dc/d5a/rat__maze_8cpp_source.html
new file mode 100644
index 000000000..f4af08bb9
--- /dev/null
+++ b/dc/d5a/rat__maze_8cpp_source.html
@@ -0,0 +1,217 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: backtracking/rat_maze.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dc/d5a/rat__maze_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">rat_maze.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dc/d5a/rat__maze_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;array&gt;</span>     </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../db/dc0/namespacebacktracking.html">backtracking</a> {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/d60/namespacerat__maze.html">rat_maze</a> {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> size&gt;</div>
+<div class="foldopen" id="foldopen00047" data-start="{" data-end="}">
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="../../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3">   47</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3">solveMaze</a>(<span class="keywordtype">int</span> currposrow, <span class="keywordtype">int</span> currposcol,</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>               <span class="keyword">const</span> std::array&lt;std::array&lt;int, size&gt;, size&gt; &amp;maze,</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>               std::array&lt;std::array&lt;int, size&gt;, size&gt; soln) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordflow">if</span> ((currposrow == size - 1) &amp;&amp; (currposcol == size - 1)) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        soln[currposrow][currposcol] = 1;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; size; ++j) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>                std::cout &lt;&lt; soln[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        }</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        soln[currposrow][currposcol] = 1;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="comment">// if there exist a solution by moving one step ahead in a column</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">if</span> ((currposcol &lt; size - 1) &amp;&amp; maze[currposrow][currposcol + 1] == 1 &amp;&amp;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            <a class="code hl_function" href="../../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3">solveMaze</a>(currposrow, currposcol + 1, maze, soln)) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        <span class="comment">// if there exists a solution by moving one step ahead in a row</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        <span class="keywordflow">if</span> ((currposrow &lt; size - 1) &amp;&amp; maze[currposrow + 1][currposcol] == 1 &amp;&amp;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            <a class="code hl_function" href="../../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3">solveMaze</a>(currposrow + 1, currposcol, maze, soln)) {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        }</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        <span class="comment">// the backtracking part</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        soln[currposrow][currposcol] = 0;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>}</div>
+</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>}  <span class="comment">// namespace rat_maze</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>}  <span class="comment">// namespace backtracking</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="foldopen" id="foldopen00086" data-start="{" data-end="}">
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   86</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> size = 4;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    std::array&lt;std::array&lt;int, size&gt;, size&gt; maze = {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        std::array&lt;int, size&gt;{1, 0, 1, 0}, std::array&lt;int, size&gt;{1, 0, 1, 1},</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        std::array&lt;int, size&gt;{1, 0, 0, 1}, std::array&lt;int, size&gt;{1, 1, 1, 1}};</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    std::array&lt;std::array&lt;int, size&gt;, size&gt; soln{};</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="comment">// Backtracking: setup matrix solution to zero</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; size; ++j) {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            soln[i][j] = 0;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        }</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    }</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keywordtype">int</span> currposrow = 0;  <span class="comment">// Current position in the rows</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="keywordtype">int</span> currposcol = 0;  <span class="comment">// Current position in the columns</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    assert(backtracking::rat_maze::solveMaze&lt;size&gt;(currposrow, currposcol, maze,</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>                                                   soln) == 1);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>}</div>
+</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="foldopen" id="foldopen00112" data-start="{" data-end="}">
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"><a class="line" href="../../dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  112</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <a class="code hl_function" href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>}</div>
+</div>
+<div class="ttc" id="anamespacebacktracking_html"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html">backtracking</a></div><div class="ttdoc">for vector container</div></div>
+<div class="ttc" id="anamespacerat__maze_html"><div class="ttname"><a href="../../d9/d60/namespacerat__maze.html">rat_maze</a></div><div class="ttdoc">Functions for Rat in a Maze algorithm.</div></div>
+<div class="ttc" id="arat__maze_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/d5a/rat__maze_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> <a href="#l00086">rat_maze.cpp:86</a></div></div>
+<div class="ttc" id="arat__maze_8cpp_html_ab99107bfb4c6934cd4691868c66c0aa3"><div class="ttname"><a href="../../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3">backtracking::rat_maze::solveMaze</a></div><div class="ttdeci">bool solveMaze(int currposrow, int currposcol, const std::array&lt; std::array&lt; int, size &gt;, size &gt; &amp;maze, std::array&lt; std::array&lt; int, size &gt;, size &gt; soln)</div><div class="ttdoc">Solve rat maze problem.</div><div class="ttdef"><b>Definition</b> <a href="#l00047">rat_maze.cpp:47</a></div></div>
+<div class="ttc" id="arat__maze_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00112">rat_maze.cpp:112</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a class="el" href="../../dc/d5a/rat__maze_8cpp.html">rat_maze.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dc/d5a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info-members.html b/dc/d5a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info-members.html
index 1bc478eea..23ca952b9 100644
--- a/dc/d5a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info-members.html
+++ b/dc/d5a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dc/d5f/classothers_1_1recursive__tree__traversals_1_1_b_t-members.html b/dc/d5f/classothers_1_1recursive__tree__traversals_1_1_b_t-members.html
index ea735f53b..f5dbdad4d 100644
--- a/dc/d5f/classothers_1_1recursive__tree__traversals_1_1_b_t-members.html
+++ b/dc/d5f/classothers_1_1recursive__tree__traversals_1_1_b_t-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dc/d61/classgraph_1_1_graph.html b/dc/d61/classgraph_1_1_graph.html
index a6c49f1da..87315ce5e 100644
--- a/dc/d61/classgraph_1_1_graph.html
+++ b/dc/d61/classgraph_1_1_graph.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph::Graph&lt; T &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: graph::Graph&lt; T &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -127,9 +144,9 @@ Collaboration diagram for graph::Graph&lt; T &gt;:</div>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:a877b2cba40d8d46dde6fb4209effed19" id="r_a877b2cba40d8d46dde6fb4209effed19"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a877b2cba40d8d46dde6fb4209effed19">add_edge</a> (T u, T v, bool bidir=true)</td></tr>
 <tr class="separator:a877b2cba40d8d46dde6fb4209effed19"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a3755ec9e6a842238c7f4aac10b661981" id="r_a3755ec9e6a842238c7f4aac10b661981"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt; T, bool &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3755ec9e6a842238c7f4aac10b661981">breadth_first_search</a> (T src)</td></tr>
+<tr class="memitem:a3755ec9e6a842238c7f4aac10b661981" id="r_a3755ec9e6a842238c7f4aac10b661981"><td class="memItemLeft" align="right" valign="top">std::map&lt; T, bool &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3755ec9e6a842238c7f4aac10b661981">breadth_first_search</a> (T src)</td></tr>
 <tr class="separator:a3755ec9e6a842238c7f4aac10b661981"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8839fa14bff19d2deab4a618447c13e5" id="r_a8839fa14bff19d2deab4a618447c13e5"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8839fa14bff19d2deab4a618447c13e5">Graph</a> (size_t N, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &amp;undirected_edges)</td></tr>
+<tr class="memitem:a8839fa14bff19d2deab4a618447c13e5" id="r_a8839fa14bff19d2deab4a618447c13e5"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8839fa14bff19d2deab4a618447c13e5">Graph</a> (size_t N, const std::vector&lt; std::pair&lt; int, int &gt; &gt; &amp;undirected_edges)</td></tr>
 <tr class="memdesc:a8839fa14bff19d2deab4a618447c13e5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid vertex indices.  <br /></td></tr>
 <tr class="separator:a8839fa14bff19d2deab4a618447c13e5"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a8930d1470d132b19e430d1c71f94c904" id="r_a8930d1470d132b19e430d1c71f94c904"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a> () const</td></tr>
@@ -137,19 +154,20 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a59940c462861f2fcf4951d1b6c084e6a" id="r_a59940c462861f2fcf4951d1b6c084e6a"><td class="memItemLeft" align="right" valign="top"><a id="a59940c462861f2fcf4951d1b6c084e6a" name="a59940c462861f2fcf4951d1b6c084e6a"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>neighbors</b></td></tr>
-<tr class="memdesc:a59940c462861f2fcf4951d1b6c084e6a"><td class="mdescLeft">&#160;</td><td class="mdescRight">for each vertex it stores a list indicies of its neighbors <br /></td></tr>
+<tr class="memitem:a59940c462861f2fcf4951d1b6c084e6a" id="r_a59940c462861f2fcf4951d1b6c084e6a"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a></td></tr>
+<tr class="memdesc:a59940c462861f2fcf4951d1b6c084e6a"><td class="mdescLeft">&#160;</td><td class="mdescRight">for each vertex it stores a list indicies of its neighbors  <br /></td></tr>
 <tr class="separator:a59940c462861f2fcf4951d1b6c084e6a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:acebf0505d625b043bb9c8c27c7a8def0" id="r_acebf0505d625b043bb9c8c27c7a8def0"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt; T, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt; T &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a></td></tr>
+<tr class="memitem:acebf0505d625b043bb9c8c27c7a8def0" id="r_acebf0505d625b043bb9c8c27c7a8def0"><td class="memItemLeft" align="right" valign="top">std::map&lt; T, std::list&lt; T &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a></td></tr>
 <tr class="separator:acebf0505d625b043bb9c8c27c7a8def0"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><div class="compoundTemplParams">template&lt;typename T&gt;<br />
 class graph::Graph&lt; T &gt;</div><p>Class for representing a graph as an adjacency list. Its vertices are indexed 0, 1, ..., N - 1. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a8839fa14bff19d2deab4a618447c13e5" name="a8839fa14bff19d2deab4a618447c13e5"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a8839fa14bff19d2deab4a618447c13e5">&#9670;&#160;</a></span>Graph()</h2>
@@ -170,7 +188,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>undirected_edges</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; std::pair&lt; int, int &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>undirected_edges</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -188,22 +206,17 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>                                                                           {</div>
-<div class="line"><span class="lineno">   63</span>        <a class="code hl_variable" href="#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/resize.html">resize</a>(N);</div>
+<div class="line"><span class="lineno">   63</span>        <a class="code hl_variable" href="#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>.resize(N);</div>
 <div class="line"><span class="lineno">   64</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;edge : undirected_edges) {</div>
-<div class="line"><span class="lineno">   65</span>            <a class="code hl_variable" href="#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>[edge.first].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(edge.second);</div>
-<div class="line"><span class="lineno">   66</span>            <a class="code hl_variable" href="#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>[edge.second].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(edge.first);</div>
+<div class="line"><span class="lineno">   65</span>            <a class="code hl_variable" href="#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>[edge.first].push_back(edge.second);</div>
+<div class="line"><span class="lineno">   66</span>            <a class="code hl_variable" href="#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>[edge.second].push_back(edge.first);</div>
 <div class="line"><span class="lineno">   67</span>        }</div>
 <div class="line"><span class="lineno">   68</span>    }</div>
-<div class="ttc" id="aclassgraph_1_1_graph_html_a59940c462861f2fcf4951d1b6c084e6a"><div class="ttname"><a href="#a59940c462861f2fcf4951d1b6c084e6a">graph::Graph::neighbors</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; neighbors</div><div class="ttdoc">for each vertex it stores a list indicies of its neighbors</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:77</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="aresize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/resize.html">std::vector::resize</a></div><div class="ttdeci">T resize(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph.svg" width="352" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassgraph_1_1_graph_html_a59940c462861f2fcf4951d1b6c084e6a"><div class="ttname"><a href="#a59940c462861f2fcf4951d1b6c084e6a">graph::Graph::neighbors</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; neighbors</div><div class="ttdoc">for each vertex it stores a list indicies of its neighbors</div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00077">lowest_common_ancestor.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Function Documentation</h2>
@@ -242,23 +255,16 @@ template&lt;typename T &gt; </div>
 </div><div class="memdoc">
 <p>add_edge(u,v,bidir) is used to add an edge between node u and node v by default , bidir is made true , i.e graph is bidirectional . It means if edge(u,v) is added then u--&gt;v and v--&gt;u both edges exist.</p>
 <p>to make the graph unidirectional pass the third parameter of add_edge as false which will</p>
-<div class="fragment"><div class="line"><span class="lineno">   74</span>                                               {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   75</span><span class="comment">        /**</span></div>
-<div class="line"><span class="lineno">   76</span><span class="comment">         *  add_edge(u,v,bidir) is used to add an edge between node u and</span></div>
-<div class="line"><span class="lineno">   77</span><span class="comment">         * node v by default , bidir is made true , i.e graph is</span></div>
-<div class="line"><span class="lineno">   78</span><span class="comment">         * bidirectional . It means if edge(u,v) is added then u--&gt;v  and</span></div>
-<div class="line"><span class="lineno">   79</span><span class="comment">         * v--&gt;u both edges exist.</span></div>
-<div class="line"><span class="lineno">   80</span><span class="comment">         *</span></div>
-<div class="line"><span class="lineno">   81</span><span class="comment">         *  to make the graph unidirectional pass the third parameter of</span></div>
-<div class="line"><span class="lineno">   82</span><span class="comment">         * add_edge as false which will</span></div>
-<div class="line"><span class="lineno">   83</span><span class="comment">         */</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html#l00074">74</a> of file <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html">breadth_first_search.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   74</span>                                               {</div>
 <div class="line"><span class="lineno">   84</span>        <a class="code hl_variable" href="#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[u].push_back(v);  <span class="comment">// u--&gt;v edge added</span></div>
 <div class="line"><span class="lineno">   85</span>        <span class="keywordflow">if</span> (bidir == <span class="keyword">true</span>) {</div>
 <div class="line"><span class="lineno">   86</span>            <span class="comment">// if graph is bidirectional</span></div>
 <div class="line"><span class="lineno">   87</span>            <a class="code hl_variable" href="#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[v].push_back(u);  <span class="comment">// v--&gt;u edge added</span></div>
 <div class="line"><span class="lineno">   88</span>        }</div>
 <div class="line"><span class="lineno">   89</span>    }</div>
-<div class="ttc" id="aclassgraph_1_1_graph_html_acebf0505d625b043bb9c8c27c7a8def0"><div class="ttname"><a href="#acebf0505d625b043bb9c8c27c7a8def0">graph::Graph::adjacency_list</a></div><div class="ttdeci">std::map&lt; T, std::list&lt; T &gt; &gt; adjacency_list</div><div class="ttdef"><b>Definition</b> breadth_first_search.cpp:69</div></div>
+<div class="ttc" id="aclassgraph_1_1_graph_html_acebf0505d625b043bb9c8c27c7a8def0"><div class="ttname"><a href="#acebf0505d625b043bb9c8c27c7a8def0">graph::Graph::adjacency_list</a></div><div class="ttdeci">std::map&lt; T, std::list&lt; T &gt; &gt; adjacency_list</div><div class="ttdef"><b>Definition</b> <a href="../../df/d82/breadth__first__search_8cpp_source.html#l00069">breadth_first_search.cpp:69</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -274,7 +280,7 @@ template&lt;typename T &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt; T, bool &gt; <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a>&lt; T &gt;::breadth_first_search </td>
+          <td class="memname">std::map&lt; T, bool &gt; <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a>&lt; T &gt;::breadth_first_search </td>
           <td>(</td>
           <td class="paramtype">T</td>          <td class="paramname"><span class="paramname"><em>src</em></span></td><td>)</td>
           <td></td>
@@ -297,58 +303,36 @@ template&lt;typename T &gt; </div>
 <p>check every vertex connected to the node which are still unvisited</p>
 <p>if the neighbour is unvisited , push it into the queue</p>
 <p>mark the neighbour as visited</p>
-<div class="fragment"><div class="line"><span class="lineno">   96</span>                                                {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   97</span><span class="comment">        /// mapping to keep track of all visited nodes</span></div>
-<div class="line"><span class="lineno">   98</span><span class="comment"></span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map&lt;T, bool&gt;</a> visited;<span class="comment"></span></div>
-<div class="line"><span class="lineno">   99</span><span class="comment">        /// initialise every possible vertex to map to false</span></div>
-<div class="line"><span class="lineno">  100</span><span class="comment">        /// initially none of the vertices are unvisited</span></div>
-<div class="line"><span class="lineno">  101</span><span class="comment"></span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span> &amp;adjlist : <a class="code hl_variable" href="#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>) {</div>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html#l00096">96</a> of file <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html">breadth_first_search.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   96</span>                                                {</div>
+<div class="line"><span class="lineno">   98</span>        std::map&lt;T, bool&gt; visited;</div>
+<div class="line"><span class="lineno">  101</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span> &amp;adjlist : <a class="code hl_variable" href="#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>) {</div>
 <div class="line"><span class="lineno">  102</span>            visited[adjlist.first] = <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  103</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span> &amp;<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> : <a class="code hl_variable" href="#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[adjlist.first]) {</div>
 <div class="line"><span class="lineno">  104</span>                visited[<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>] = <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  105</span>            }</div>
 <div class="line"><span class="lineno">  106</span>        }</div>
-<div class="line"><span class="lineno">  107</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  108</span><span class="comment">        /// queue to store the nodes which are yet to be traversed</span></div>
-<div class="line"><span class="lineno">  109</span><span class="comment"></span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue&lt;T&gt;</a> tracker;</div>
-<div class="line"><span class="lineno">  110</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  111</span><span class="comment">        /// push the source vertex to queue to begin traversing</span></div>
-<div class="line"><span class="lineno">  112</span><span class="comment"></span>        tracker.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(src);<span class="comment"></span></div>
-<div class="line"><span class="lineno">  113</span><span class="comment">        /// mark the source vertex as visited</span></div>
-<div class="line"><span class="lineno">  114</span><span class="comment"></span>        visited[src] = <span class="keyword">true</span>;</div>
-<div class="line"><span class="lineno">  115</span>        <span class="keywordflow">while</span> (!tracker.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/empty.html">empty</a>()) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  116</span><span class="comment">            /// traverse the graph till no connected vertex are left</span></div>
-<div class="line"><span class="lineno">  117</span><span class="comment">            /// extract a node from queue for further traversal</span></div>
-<div class="line"><span class="lineno">  118</span><span class="comment"></span>            T <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = tracker.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/front.html">front</a>();<span class="comment"></span></div>
-<div class="line"><span class="lineno">  119</span><span class="comment">            /// remove the node from the queue</span></div>
-<div class="line"><span class="lineno">  120</span><span class="comment"></span>            tracker.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/pop.html">pop</a>();</div>
-<div class="line"><span class="lineno">  121</span>            <span class="keywordflow">for</span> (T <span class="keyword">const</span> &amp;neighbour : <a class="code hl_variable" href="#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>]) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  122</span><span class="comment">                /// check every vertex connected to the node which are still</span></div>
-<div class="line"><span class="lineno">  123</span><span class="comment">                /// unvisited</span></div>
-<div class="line"><span class="lineno">  124</span><span class="comment"></span>                <span class="keywordflow">if</span> (!visited[neighbour]) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  125</span><span class="comment">                    /// if the neighbour is unvisited , push it into the queue</span></div>
-<div class="line"><span class="lineno">  126</span><span class="comment"></span>                    tracker.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(neighbour);<span class="comment"></span></div>
-<div class="line"><span class="lineno">  127</span><span class="comment">                    /// mark the neighbour as visited</span></div>
-<div class="line"><span class="lineno">  128</span><span class="comment"></span>                    visited[neighbour] = <span class="keyword">true</span>;</div>
+<div class="line"><span class="lineno">  107</span> </div>
+<div class="line"><span class="lineno">  109</span>        std::queue&lt;T&gt; tracker;</div>
+<div class="line"><span class="lineno">  110</span> </div>
+<div class="line"><span class="lineno">  112</span>        tracker.push(src);</div>
+<div class="line"><span class="lineno">  114</span>        visited[src] = <span class="keyword">true</span>;</div>
+<div class="line"><span class="lineno">  115</span>        <span class="keywordflow">while</span> (!tracker.empty()) {</div>
+<div class="line"><span class="lineno">  118</span>            T <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = tracker.front();</div>
+<div class="line"><span class="lineno">  120</span>            tracker.pop();</div>
+<div class="line"><span class="lineno">  121</span>            <span class="keywordflow">for</span> (T <span class="keyword">const</span> &amp;neighbour : <a class="code hl_variable" href="#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>]) {</div>
+<div class="line"><span class="lineno">  124</span>                <span class="keywordflow">if</span> (!visited[neighbour]) {</div>
+<div class="line"><span class="lineno">  126</span>                    tracker.push(neighbour);</div>
+<div class="line"><span class="lineno">  128</span>                    visited[neighbour] = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  129</span>                }</div>
 <div class="line"><span class="lineno">  130</span>            }</div>
 <div class="line"><span class="lineno">  131</span>        }</div>
 <div class="line"><span class="lineno">  132</span>        <span class="keywordflow">return</span> visited;</div>
 <div class="line"><span class="lineno">  133</span>    }</div>
-<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
-<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/empty.html">std::queue::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
-<div class="ttc" id="afront_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/front.html">std::queue::front</a></div><div class="ttdeci">T front(T... args)</div></div>
-<div class="ttc" id="amap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a></div></div>
-<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/pop.html">std::queue::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
-<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/push.html">std::queue::push</a></div><div class="ttdeci">T push(T... args)</div></div>
-<div class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d61/classgraph_1_1_graph_a3755ec9e6a842238c7f4aac10b661981_cgraph.svg" width="332" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a8930d1470d132b19e430d1c71f94c904" name="a8930d1470d132b19e430d1c71f94c904"></a>
@@ -376,14 +360,10 @@ template&lt;typename T &gt; </div>
 </table>
 </div><div class="memdoc">
 <p>Function to get the number of vertices in the graph </p><dl class="section return"><dt>Returns</dt><dd>the number of vertices in the graph. </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   74</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); }</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><!-- 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/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph.svg" width="322" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00074">74</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   74</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>.size(); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
@@ -399,7 +379,7 @@ template&lt;typename T &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt;T, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt;T&gt; &gt; <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a>&lt; T &gt;::adjacency_list</td>
+          <td class="memname">std::map&lt;T, std::list&lt;T&gt; &gt; <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a>&lt; T &gt;::adjacency_list</td>
         </tr>
       </table>
   </td>
@@ -410,11 +390,33 @@ template&lt;typename T &gt; </div>
 </div><div class="memdoc">
 <p>adjacency_list maps every vertex to the list of its neighbours in the order in which they are added. </p>
 
+<p class="definition">Definition at line <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html#l00069">69</a> of file <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html">breadth_first_search.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a59940c462861f2fcf4951d1b6c084e6a" name="a59940c462861f2fcf4951d1b6c084e6a"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a59940c462861f2fcf4951d1b6c084e6a">&#9670;&#160;</a></span>neighbors</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename T &gt; </div>
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::vector&lt;int&gt; &gt; <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a>&lt; T &gt;::neighbors</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>for each vertex it stores a list indicies of its neighbors </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following files:<ul>
-<li>graph/<a class="el" href="../../df/d82/breadth__first__search_8cpp.html">breadth_first_search.cpp</a></li>
-<li>graph/<a class="el" href="../../de/dde/lowest__common__ancestor_8cpp.html">lowest_common_ancestor.cpp</a></li>
+<li>graph/<a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html">breadth_first_search.cpp</a></li>
+<li>graph/<a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dc/d61/classgraph_1_1_graph_a3755ec9e6a842238c7f4aac10b661981_cgraph.map b/dc/d61/classgraph_1_1_graph_a3755ec9e6a842238c7f4aac10b661981_cgraph.map
deleted file mode 100644
index 7d4a87901..000000000
--- a/dc/d61/classgraph_1_1_graph_a3755ec9e6a842238c7f4aac10b661981_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="graph::Graph::breadth_first_search" name="graph::Graph::breadth_first_search">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,72,153,113"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/empty.html#" title=" " alt="" coords="201,5,327,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="128,70,200,40,213,34,215,39,202,45,130,75"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/front.html#" title=" " alt="" coords="206,55,322,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="152,80,190,75,191,80,153,85"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/pop.html#" title=" " alt="" coords="208,104,320,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="153,100,193,105,192,110,153,105"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/push.html#" title=" " alt="" coords="205,153,323,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="132,111,202,140,215,145,213,150,200,145,130,116"/>
-</map>
diff --git a/dc/d61/classgraph_1_1_graph_a3755ec9e6a842238c7f4aac10b661981_cgraph.md5 b/dc/d61/classgraph_1_1_graph_a3755ec9e6a842238c7f4aac10b661981_cgraph.md5
deleted file mode 100644
index 945a57c38..000000000
--- a/dc/d61/classgraph_1_1_graph_a3755ec9e6a842238c7f4aac10b661981_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-72fd6bfe4f58fdc714b274117190f07f
\ No newline at end of file
diff --git a/dc/d61/classgraph_1_1_graph_a3755ec9e6a842238c7f4aac10b661981_cgraph.svg b/dc/d61/classgraph_1_1_graph_a3755ec9e6a842238c7f4aac10b661981_cgraph.svg
deleted file mode 100644
index 1bf5ebf34..000000000
--- a/dc/d61/classgraph_1_1_graph_a3755ec9e6a842238c7f4aac10b661981_cgraph.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::Graph::breadth_first_search Pages: 1 -->
-<svg width="249pt" height="138pt"
- viewBox="0.00 0.00 249.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>graph::Graph::breadth_first_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="110.5,-79.88 0,-79.88 0,-49.38 110.5,-49.38 110.5,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::breadth</text>
-<text text-anchor="middle" x="55.25" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">_first_search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="241.25,-130.25 146.5,-130.25 146.5,-111 241.25,-111 241.25,-130.25"/>
-<text text-anchor="middle" x="193.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.6,-80.21C109.02,-87.17 128.69,-95.42 146.5,-102.62 149.68,-103.91 152.99,-105.23 156.31,-106.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.83,-109.72 165.42,-110.11 157.38,-103.2 154.83,-109.72"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.5,-93.25 150.25,-93.25 150.25,-74 237.5,-74 237.5,-93.25"/>
-<text text-anchor="middle" x="193.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.64,-72.19C119.95,-73.48 129.62,-74.83 138.92,-76.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.15,-79.55 148.53,-77.46 139.11,-72.61 138.15,-79.55"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235.62,-56.25 152.12,-56.25 152.12,-37 235.62,-37 235.62,-56.25"/>
-<text text-anchor="middle" x="193.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.64,-57.46C120.48,-56.16 130.73,-54.81 140.51,-53.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.77,-57.02 150.23,-52.24 139.85,-50.08 140.77,-57.02"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.25,-19.25 149.5,-19.25 149.5,0 238.25,0 238.25,-19.25"/>
-<text text-anchor="middle" x="193.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.95,-48.98C110.1,-42.33 129.2,-34.53 146.5,-27.62 149.69,-26.35 153,-25.04 156.32,-23.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.39,-27.08 165.43,-20.18 154.84,-20.56 157.39,-27.08"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d61/classgraph_1_1_graph_a3755ec9e6a842238c7f4aac10b661981_cgraph_org.svg b/dc/d61/classgraph_1_1_graph_a3755ec9e6a842238c7f4aac10b661981_cgraph_org.svg
deleted file mode 100644
index 85f3e327a..000000000
--- a/dc/d61/classgraph_1_1_graph_a3755ec9e6a842238c7f4aac10b661981_cgraph_org.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::Graph::breadth_first_search Pages: 1 -->
-<svg width="249pt" height="138pt"
- viewBox="0.00 0.00 249.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>graph::Graph::breadth_first_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="110.5,-79.88 0,-79.88 0,-49.38 110.5,-49.38 110.5,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::breadth</text>
-<text text-anchor="middle" x="55.25" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">_first_search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="241.25,-130.25 146.5,-130.25 146.5,-111 241.25,-111 241.25,-130.25"/>
-<text text-anchor="middle" x="193.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.6,-80.21C109.02,-87.17 128.69,-95.42 146.5,-102.62 149.68,-103.91 152.99,-105.23 156.31,-106.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.83,-109.72 165.42,-110.11 157.38,-103.2 154.83,-109.72"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.5,-93.25 150.25,-93.25 150.25,-74 237.5,-74 237.5,-93.25"/>
-<text text-anchor="middle" x="193.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.64,-72.19C119.95,-73.48 129.62,-74.83 138.92,-76.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.15,-79.55 148.53,-77.46 139.11,-72.61 138.15,-79.55"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235.62,-56.25 152.12,-56.25 152.12,-37 235.62,-37 235.62,-56.25"/>
-<text text-anchor="middle" x="193.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.64,-57.46C120.48,-56.16 130.73,-54.81 140.51,-53.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.77,-57.02 150.23,-52.24 139.85,-50.08 140.77,-57.02"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.25,-19.25 149.5,-19.25 149.5,0 238.25,0 238.25,-19.25"/>
-<text text-anchor="middle" x="193.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.95,-48.98C110.1,-42.33 129.2,-34.53 146.5,-27.62 149.69,-26.35 153,-25.04 156.32,-23.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.39,-27.08 165.43,-20.18 154.84,-20.56 157.39,-27.08"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph.map b/dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph.map
deleted file mode 100644
index 6ea318f87..000000000
--- a/dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="graph::Graph::Graph" name="graph::Graph::Graph">
-<area shape="rect" id="Node000001" title="Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid v..." alt="" coords="5,31,145,56"/>
-<area shape="rect" id="Node000002" 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="193,5,347,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="145,32,177,28,178,33,146,37"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="207,55,333,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="145,49,192,55,191,61,145,55"/>
-</map>
diff --git a/dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph.md5 b/dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph.md5
deleted file mode 100644
index 179dee4f0..000000000
--- a/dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b3404b8298248750e7d63ff98fed400e
\ No newline at end of file
diff --git a/dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph.svg b/dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph.svg
deleted file mode 100644
index 5932b3dbd..000000000
--- a/dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::Graph::Graph Pages: 1 -->
-<svg width="264pt" height="64pt"
- viewBox="0.00 0.00 264.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>graph::Graph::Graph</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid v...">
-<polygon fill="#999999" stroke="#666666" points="104.5,-37.25 0,-37.25 0,-18 104.5,-18 104.5,-37.25"/>
-<text text-anchor="middle" x="52.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::Graph</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="256.25,-56.25 140.5,-56.25 140.5,-37 256.25,-37 256.25,-56.25"/>
-<text text-anchor="middle" x="198.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.88,-34.43C112.67,-35.46 120.81,-36.53 128.9,-37.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.37,-41.06 138.74,-38.9 129.29,-34.12 128.37,-41.06"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245.75,-19.25 151,-19.25 151,0 245.75,0 245.75,-19.25"/>
-<text text-anchor="middle" x="198.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.88,-21.18C116.14,-19.77 128.14,-18.27 139.63,-16.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.91,-20.33 149.4,-15.62 139.04,-13.38 139.91,-20.33"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph_org.svg b/dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph_org.svg
deleted file mode 100644
index 93f382302..000000000
--- a/dc/d61/classgraph_1_1_graph_a8839fa14bff19d2deab4a618447c13e5_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::Graph::Graph Pages: 1 -->
-<svg width="264pt" height="64pt"
- viewBox="0.00 0.00 264.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>graph::Graph::Graph</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid v...">
-<polygon fill="#999999" stroke="#666666" points="104.5,-37.25 0,-37.25 0,-18 104.5,-18 104.5,-37.25"/>
-<text text-anchor="middle" x="52.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::Graph</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="256.25,-56.25 140.5,-56.25 140.5,-37 256.25,-37 256.25,-56.25"/>
-<text text-anchor="middle" x="198.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.88,-34.43C112.67,-35.46 120.81,-36.53 128.9,-37.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.37,-41.06 138.74,-38.9 129.29,-34.12 128.37,-41.06"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245.75,-19.25 151,-19.25 151,0 245.75,0 245.75,-19.25"/>
-<text text-anchor="middle" x="198.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.88,-21.18C116.14,-19.77 128.14,-18.27 139.63,-16.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.91,-20.33 149.4,-15.62 139.04,-13.38 139.91,-20.33"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph.map b/dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph.map
deleted file mode 100644
index cf6ecbb92..000000000
--- a/dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="graph::Graph::number_of_vertices" name="graph::Graph::number_of_vertices">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,153,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="201,13,316,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="153,23,185,23,185,28,153,28"/>
-</map>
diff --git a/dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph.md5 b/dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph.md5
deleted file mode 100644
index 0909b2e79..000000000
--- a/dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0b9a81d88142bf13d03c7b09b0b3eb88
\ No newline at end of file
diff --git a/dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph.svg b/dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph.svg
deleted file mode 100644
index b31cff6a8..000000000
--- a/dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::Graph::number_of_vertices Pages: 1 -->
-<svg width="241pt" height="39pt"
- viewBox="0.00 0.00 241.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>graph::Graph::number_of_vertices</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="110.5,-30.5 0,-30.5 0,0 110.5,0 110.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::number</text>
-<text text-anchor="middle" x="55.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_of_vertices</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-24.88 146.5,-24.88 146.5,-5.63 233,-5.63 233,-24.88"/>
-<text text-anchor="middle" x="189.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.91,-15.25C118.86,-15.25 127.04,-15.25 134.97,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.85,-18.75 144.85,-15.25 134.85,-11.75 134.85,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph_org.svg b/dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph_org.svg
deleted file mode 100644
index 548e86f5f..000000000
--- a/dc/d61/classgraph_1_1_graph_a8930d1470d132b19e430d1c71f94c904_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::Graph::number_of_vertices Pages: 1 -->
-<svg width="241pt" height="39pt"
- viewBox="0.00 0.00 241.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>graph::Graph::number_of_vertices</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="110.5,-30.5 0,-30.5 0,0 110.5,0 110.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::number</text>
-<text text-anchor="middle" x="55.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_of_vertices</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-24.88 146.5,-24.88 146.5,-5.63 233,-5.63 233,-24.88"/>
-<text text-anchor="middle" x="189.75" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.91,-15.25C118.86,-15.25 127.04,-15.25 134.97,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.85,-18.75 144.85,-15.25 134.85,-11.75 134.85,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d64/md__coding_guidelines.html b/dc/d64/md__coding_guidelines.html
index c60d4341d..08a188ccd 100644
--- a/dc/d64/md__coding_guidelines.html
+++ b/dc/d64/md__coding_guidelines.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Code style convention</title>
+<title>TheAlgorithms/C++: Code style convention</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dc/d67/classgraph_1_1is__graph__bipartite_1_1_graph-members.html b/dc/d67/classgraph_1_1is__graph__bipartite_1_1_graph-members.html
index 9ac0dbc4a..275bb25ca 100644
--- a/dc/d67/classgraph_1_1is__graph__bipartite_1_1_graph-members.html
+++ b/dc/d67/classgraph_1_1is__graph__bipartite_1_1_graph-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dc/d67/subset__sum__dynamic_8cpp.html b/dc/d67/subset__sum__dynamic_8cpp.html
index f84fd6890..bd860a2b3 100644
--- a/dc/d67/subset__sum__dynamic_8cpp.html
+++ b/dc/d67/subset__sum__dynamic_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/subset_sum_dynamic.cpp File Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming/subset_sum_dynamic.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for subset_sum_dynamic.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d1f/subset__sum__dynamic_8cpp__incl.svg" width="387" height="126"><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">
+</div>
+<p><a href="../../dc/d67/subset__sum__dynamic_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
@@ -134,9 +153,9 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a280fcfb2f6fe49a31c4da572e7032607" id="r_a280fcfb2f6fe49a31c4da572e7032607"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a280fcfb2f6fe49a31c4da572e7032607">dynamic_programming::subset_sum::subset_sum_recursion</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;arr, int targetSum, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a>&lt; int, bool &gt; &gt; *dp, int index=0)</td></tr>
+<tr class="memitem:a280fcfb2f6fe49a31c4da572e7032607" id="r_a280fcfb2f6fe49a31c4da572e7032607"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a280fcfb2f6fe49a31c4da572e7032607">dynamic_programming::subset_sum::subset_sum_recursion</a> (const std::vector&lt; int &gt; &amp;arr, int targetSum, std::vector&lt; std::unordered_map&lt; int, bool &gt; &gt; *dp, int index=0)</td></tr>
 <tr class="separator:a280fcfb2f6fe49a31c4da572e7032607"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ac94e6c0dee11278ac0a5491f1b9a4a50" id="r_ac94e6c0dee11278ac0a5491f1b9a4a50"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac94e6c0dee11278ac0a5491f1b9a4a50">dynamic_programming::subset_sum::subset_sum_problem</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;arr, const int targetSum)</td></tr>
+<tr class="memitem:ac94e6c0dee11278ac0a5491f1b9a4a50" id="r_ac94e6c0dee11278ac0a5491f1b9a4a50"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac94e6c0dee11278ac0a5491f1b9a4a50">dynamic_programming::subset_sum::subset_sum_problem</a> (const std::vector&lt; int &gt; &amp;arr, const int targetSum)</td></tr>
 <tr class="separator:ac94e6c0dee11278ac0a5491f1b9a4a50"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
 <tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Test Function.  <br /></td></tr>
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implements [Sub-set sum problem] (<a href="https://en.wikipedia.org/wiki/Subset_sum_problem">https://en.wikipedia.org/wiki/Subset_sum_problem</a>) algorithm, which tells whether a subset with target sum exists or not. </p>
 <p>In this problem, we use dynamic programming to find if we can pull out a subset from an array whose sum is equal to a given target sum. The overall time complexity of the problem is O(n * targetSum) where n is the size of the array. For example, array = [1, -10, 2, 31, -6], targetSum = -14. Output: true =&gt; We can pick subset [-10, 2, -6] with sum as (-10) + 2 + (-6) = -14. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/KillerAV" target="_blank">KillerAV</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../dc/d67/subset__sum__dynamic_8cpp_source.html">subset_sum_dynamic.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -166,17 +187,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d67/subset__sum__dynamic_8cpp_source.html#l00120">120</a> of file <a class="el" href="../../dc/d67/subset__sum__dynamic_8cpp_source.html">subset_sum_dynamic.cpp</a>.</p>
 <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="#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="asubset__sum__dynamic_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test Function.</div><div class="ttdef"><b>Definition</b> subset_sum_dynamic.cpp:82</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asubset__sum__dynamic_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test Function.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d67/subset__sum__dynamic_8cpp_source.html#l00082">subset_sum_dynamic.cpp:82</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac94e6c0dee11278ac0a5491f1b9a4a50" name="ac94e6c0dee11278ac0a5491f1b9a4a50"></a>
@@ -188,7 +206,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool dynamic_programming::subset_sum::subset_sum_problem </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -205,21 +223,16 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d67/subset__sum__dynamic_8cpp_source.html#l00070">70</a> of file <a class="el" href="../../dc/d67/subset__sum__dynamic_8cpp_source.html">subset_sum_dynamic.cpp</a>.</p>
 <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&lt;std::unordered_map&lt;int, bool&gt;</a>&gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(n);</div>
+<div class="line"><span class="lineno">   71</span>    <span class="keywordtype">size_t</span> n = arr.size();</div>
+<div class="line"><span class="lineno">   72</span>    std::vector&lt;std::unordered_map&lt;int, bool&gt;&gt; <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="#a280fcfb2f6fe49a31c4da572e7032607">subset_sum_recursion</a>(arr, targetSum, &amp;<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="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="asubset__sum__dynamic_8cpp_html_a280fcfb2f6fe49a31c4da572e7032607"><div class="ttname"><a href="#a280fcfb2f6fe49a31c4da572e7032607">dynamic_programming::subset_sum::subset_sum_recursion</a></div><div class="ttdeci">bool subset_sum_recursion(const std::vector&lt; int &gt; &amp;arr, int targetSum, std::vector&lt; std::unordered_map&lt; int, bool &gt; &gt; *dp, int index=0)</div><div class="ttdef"><b>Definition</b> subset_sum_dynamic.cpp:43</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.svg" width="527" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div 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> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></div>
+<div class="ttc" id="asubset__sum__dynamic_8cpp_html_a280fcfb2f6fe49a31c4da572e7032607"><div class="ttname"><a href="#a280fcfb2f6fe49a31c4da572e7032607">dynamic_programming::subset_sum::subset_sum_recursion</a></div><div class="ttdeci">bool subset_sum_recursion(const std::vector&lt; int &gt; &amp;arr, int targetSum, std::vector&lt; std::unordered_map&lt; int, bool &gt; &gt; *dp, int index=0)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d67/subset__sum__dynamic_8cpp_source.html#l00043">subset_sum_dynamic.cpp:43</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a280fcfb2f6fe49a31c4da572e7032607" name="a280fcfb2f6fe49a31c4da572e7032607"></a>
@@ -231,7 +244,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool dynamic_programming::subset_sum::subset_sum_recursion </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -241,7 +254,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a>&lt; int, bool &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>dp</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::unordered_map&lt; int, bool &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>dp</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -259,11 +272,13 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d67/subset__sum__dynamic_8cpp_source.html#l00043">43</a> of file <a class="el" href="../../dc/d67/subset__sum__dynamic_8cpp_source.html">subset_sum_dynamic.cpp</a>.</p>
 <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">   49</span>    <span class="keywordflow">if</span> (index == arr.size()) {  <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> </div>
@@ -277,12 +292,7 @@ Here is the call graph for this function:</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">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.svg" width="327" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -310,20 +320,22 @@ Here is the call graph for this function:</div>
 
 <p>Test Function. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d67/subset__sum__dynamic_8cpp_source.html#l00082">82</a> of file <a class="el" href="../../dc/d67/subset__sum__dynamic_8cpp_source.html">subset_sum_dynamic.cpp</a>.</p>
 <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&lt;std::vector&lt;int&gt;</a>&gt; 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&lt;int&gt;</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&lt;int&gt;</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&lt;int&gt;</a>{0, 1, 0, 1, 0};</div>
+<div class="line"><span class="lineno">   84</span>    std::vector&lt;std::vector&lt;int&gt;&gt; custom_input_arr(3);</div>
+<div class="line"><span class="lineno">   85</span>    custom_input_arr[0] = std::vector&lt;int&gt;{1, -10, 2, 31, -6};</div>
+<div class="line"><span class="lineno">   86</span>    custom_input_arr[1] = std::vector&lt;int&gt;{2, 3, 4};</div>
+<div class="line"><span class="lineno">   87</span>    custom_input_arr[2] = std::vector&lt;int&gt;{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&lt;int&gt;</a> custom_input_target_sum(3);</div>
+<div class="line"><span class="lineno">   89</span>    std::vector&lt;int&gt; 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&lt;int&gt;</a> calculated_output(3);</div>
+<div class="line"><span class="lineno">   95</span>    std::vector&lt;int&gt; 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 &lt; 3; i++) {</div>
 <div class="line"><span class="lineno">   98</span>        calculated_output[i] =</div>
@@ -332,7 +344,7 @@ Here is the call graph for this function:</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&lt;bool&gt;</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">  104</span>    std::vector&lt;bool&gt; 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>
@@ -341,10 +353,9 @@ Here is the call graph for this function:</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> &lt;&lt; <span class="stringliteral">&quot;All tests passed successfully!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests passed successfully!\n&quot;</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="asubset__sum__dynamic_8cpp_html_ac94e6c0dee11278ac0a5491f1b9a4a50"><div class="ttname"><a href="#ac94e6c0dee11278ac0a5491f1b9a4a50">dynamic_programming::subset_sum::subset_sum_problem</a></div><div class="ttdeci">bool subset_sum_problem(const std::vector&lt; int &gt; &amp;arr, const int targetSum)</div><div class="ttdef"><b>Definition</b> subset_sum_dynamic.cpp:70</div></div>
+<div class="ttc" id="asubset__sum__dynamic_8cpp_html_ac94e6c0dee11278ac0a5491f1b9a4a50"><div class="ttname"><a href="#ac94e6c0dee11278ac0a5491f1b9a4a50">dynamic_programming::subset_sum::subset_sum_problem</a></div><div class="ttdeci">bool subset_sum_problem(const std::vector&lt; int &gt; &amp;arr, const int targetSum)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d67/subset__sum__dynamic_8cpp_source.html#l00070">subset_sum_dynamic.cpp:70</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.map b/dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.map
deleted file mode 100644
index 05187c296..000000000
--- a/dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="dynamic_programming::subset_sum::subset_sum_recursion" name="dynamic_programming::subset_sum::subset_sum_recursion">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,158,85"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="45,29,46,19,52,10,64,5,82,3,101,5,113,12,110,17,99,10,81,8,66,10,56,14,51,21,51,29"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="206,44,321,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="158,54,190,54,190,60,158,60"/>
-</map>
diff --git a/dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.md5 b/dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.md5
deleted file mode 100644
index 647a7d33e..000000000
--- a/dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5397729e96e04f8af03e081b7077d247
\ No newline at end of file
diff --git a/dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.svg b/dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.svg
deleted file mode 100644
index f22723308..000000000
--- a/dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::subset_sum::subset_sum_recursion Pages: 1 -->
-<svg width="245pt" height="68pt"
- viewBox="0.00 0.00 244.75 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>dynamic_programming::subset_sum::subset_sum_recursion</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="114.25,-41.75 0,-41.75 0,0 114.25,0 114.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::subset_sum::subset</text>
-<text text-anchor="middle" x="57.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sum_recursion</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.95,-42.07C29.56,-51.55 37.95,-59.75 57.12,-59.75 68.21,-59.75 75.69,-57.01 79.57,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.87,-54.09 81.93,-43.54 76.08,-52.37 82.87,-54.09"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-30.5 150.25,-30.5 150.25,-11.25 236.75,-11.25 236.75,-30.5"/>
-<text text-anchor="middle" x="193.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.72,-20.88C122.63,-20.88 130.73,-20.88 138.58,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.34,-24.38 148.34,-20.88 138.34,-17.38 138.34,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph_org.svg b/dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph_org.svg
deleted file mode 100644
index f8942225c..000000000
--- a/dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph_org.svg
+++ /dev/null
@@ -1,50 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::subset_sum::subset_sum_recursion Pages: 1 -->
-<svg width="245pt" height="68pt"
- viewBox="0.00 0.00 244.75 67.75" 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 63.75)">
-<title>dynamic_programming::subset_sum::subset_sum_recursion</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="114.25,-41.75 0,-41.75 0,0 114.25,0 114.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::subset_sum::subset</text>
-<text text-anchor="middle" x="57.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sum_recursion</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.95,-42.07C29.56,-51.55 37.95,-59.75 57.12,-59.75 68.21,-59.75 75.69,-57.01 79.57,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.87,-54.09 81.93,-43.54 76.08,-52.37 82.87,-54.09"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-30.5 150.25,-30.5 150.25,-11.25 236.75,-11.25 236.75,-30.5"/>
-<text text-anchor="middle" x="193.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.72,-20.88C122.63,-20.88 130.73,-20.88 138.58,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.34,-24.38 148.34,-20.88 138.34,-17.38 138.34,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.map b/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.map
deleted file mode 100644
index 60ac19097..000000000
--- a/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="dynamic_programming::subset_sum::subset_sum_problem" name="dynamic_programming::subset_sum::subset_sum_problem">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,158,85"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="42,29,42,19,50,10,63,5,82,3,103,5,116,12,113,17,101,10,81,8,64,10,53,15,47,21,47,29"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="406,44,521,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="158,40,205,35,282,30,358,35,391,39,391,44,358,40,282,35,206,40,158,46"/>
-<area shape="rect" id="Node000003" href="$dc/d67/subset__sum__dynamic_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607" title=" " alt="" coords="206,73,358,129"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="159,71,191,79,190,84,158,77"/>
-<area shape="poly" id="edge4_Node000003_Node000002" title=" " alt="" coords="358,80,392,72,393,77,359,85"/>
-<area shape="poly" id="edge5_Node000003_Node000003" title=" " alt="" coords="246,73,246,63,253,54,265,49,282,47,301,49,313,56,310,61,300,54,282,52,266,54,256,58,251,65,251,73"/>
-</map>
diff --git a/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.md5 b/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.md5
deleted file mode 100644
index 52c04bf00..000000000
--- a/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a799c8350acde7e0a640460bc007eeb6
\ No newline at end of file
diff --git a/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.svg b/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.svg
deleted file mode 100644
index 936c98fe2..000000000
--- a/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.svg
+++ /dev/null
@@ -1,114 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::subset_sum::subset_sum_problem Pages: 1 -->
-<svg width="395pt" height="101pt"
- viewBox="0.00 0.00 395.00 100.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 96.75)">
-<title>dynamic_programming::subset_sum::subset_sum_problem</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="114.25,-74.75 0,-74.75 0,-33 114.25,-33 114.25,-74.75"/>
-<text text-anchor="start" x="8" y="-61.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="start" x="8" y="-50" font-family="Helvetica,sans-Serif" font-size="10.00">::subset_sum::subset</text>
-<text text-anchor="middle" x="57.12" y="-38.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sum_problem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.39,-75.07C26.75,-84.55 36,-92.75 57.12,-92.75 69.34,-92.75 77.58,-90.01 81.85,-85.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.14,-87.1 84.45,-76.53 78.4,-85.22 85.14,-87.1"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387,-63.5 300.5,-63.5 300.5,-44.25 387,-44.25 387,-63.5"/>
-<text text-anchor="middle" x="343.75" y="-50" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.46,-64.53C126.25,-66.34 138.62,-67.93 150.25,-68.88 200.86,-72.97 213.95,-73.68 264.5,-68.88 272.55,-68.11 281,-66.91 289.25,-65.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.61,-69.01 298.83,-63.79 288.37,-62.12 289.61,-69.01"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/d67/subset__sum__dynamic_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.5,-41.75 150.25,-41.75 150.25,0 264.5,0 264.5,-41.75"/>
-<text text-anchor="start" x="158.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="start" x="158.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::subset_sum::subset</text>
-<text text-anchor="middle" x="207.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sum_recursion</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.59,-41.3C122.58,-39.53 130.86,-37.68 139.03,-35.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.58,-39.33 148.58,-33.74 138.06,-32.5 139.58,-39.33"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge4_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge4_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.97,-34.77C273.45,-36.86 282.17,-39 290.55,-41.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.71,-44.45 300.26,-43.44 291.38,-37.66 289.71,-44.45"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge5_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge5_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.2,-42.07C179.81,-51.55 188.2,-59.75 207.38,-59.75 218.46,-59.75 225.94,-57.01 229.82,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.12,-54.09 232.18,-43.54 226.33,-52.37 233.12,-54.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph_org.svg b/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph_org.svg
deleted file mode 100644
index f6f0417e6..000000000
--- a/dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph_org.svg
+++ /dev/null
@@ -1,88 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::subset_sum::subset_sum_problem Pages: 1 -->
-<svg width="395pt" height="101pt"
- viewBox="0.00 0.00 395.00 100.75" 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 96.75)">
-<title>dynamic_programming::subset_sum::subset_sum_problem</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="114.25,-74.75 0,-74.75 0,-33 114.25,-33 114.25,-74.75"/>
-<text text-anchor="start" x="8" y="-61.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="start" x="8" y="-50" font-family="Helvetica,sans-Serif" font-size="10.00">::subset_sum::subset</text>
-<text text-anchor="middle" x="57.12" y="-38.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sum_problem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.39,-75.07C26.75,-84.55 36,-92.75 57.12,-92.75 69.34,-92.75 77.58,-90.01 81.85,-85.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.14,-87.1 84.45,-76.53 78.4,-85.22 85.14,-87.1"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387,-63.5 300.5,-63.5 300.5,-44.25 387,-44.25 387,-63.5"/>
-<text text-anchor="middle" x="343.75" y="-50" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.46,-64.53C126.25,-66.34 138.62,-67.93 150.25,-68.88 200.86,-72.97 213.95,-73.68 264.5,-68.88 272.55,-68.11 281,-66.91 289.25,-65.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.61,-69.01 298.83,-63.79 288.37,-62.12 289.61,-69.01"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/d67/subset__sum__dynamic_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.5,-41.75 150.25,-41.75 150.25,0 264.5,0 264.5,-41.75"/>
-<text text-anchor="start" x="158.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="start" x="158.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::subset_sum::subset</text>
-<text text-anchor="middle" x="207.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_sum_recursion</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.59,-41.3C122.58,-39.53 130.86,-37.68 139.03,-35.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.58,-39.33 148.58,-33.74 138.06,-32.5 139.58,-39.33"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge4_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge4_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M264.97,-34.77C273.45,-36.86 282.17,-39 290.55,-41.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.71,-44.45 300.26,-43.44 291.38,-37.66 289.71,-44.45"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge5_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge5_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.2,-42.07C179.81,-51.55 188.2,-59.75 207.38,-59.75 218.46,-59.75 225.94,-57.01 229.82,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.12,-54.09 232.18,-43.54 226.33,-52.37 233.12,-54.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index d11a560f0..000000000
--- a/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$dc/d67/subset__sum__dynamic_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Test Function." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 88eb0782b..000000000
--- a/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b99b125d4f3d2e424b8c91b3bc18eff5
\ No newline at end of file
diff --git a/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 1ea8536db..000000000
--- a/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d67/subset__sum__dynamic_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test Function.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 10e106712..000000000
--- a/dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d67/subset__sum__dynamic_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test Function.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d67/subset__sum__dynamic_8cpp_source.html b/dc/d67/subset__sum__dynamic_8cpp_source.html
new file mode 100644
index 000000000..58ae7ddf7
--- /dev/null
+++ b/dc/d67/subset__sum__dynamic_8cpp_source.html
@@ -0,0 +1,229 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/subset_sum_dynamic.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dc/d67/subset__sum__dynamic_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">subset_sum_dynamic.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dc/d67/subset__sum__dynamic_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;cassert&gt;</span>        </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;iostream&gt;</span>       </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;unordered_map&gt;</span>  </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;vector&gt;</span>         </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a> {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dc/d3a/namespacesubset__sum.html">subset_sum</a> {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="foldopen" id="foldopen00043" data-start="{" data-end="}">
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="../../dc/d67/subset__sum__dynamic_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607">   43</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../dc/d67/subset__sum__dynamic_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607">subset_sum_recursion</a>(<span class="keyword">const</span> std::vector&lt;int&gt; &amp;arr, <span class="keywordtype">int</span> targetSum,</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>                          std::vector&lt;std::unordered_map&lt;int, bool&gt;&gt; *<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>,</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>                          <span class="keywordtype">int</span> index = 0) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><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"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">if</span> (index == arr.size()) {  <span class="comment">// End of array</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="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"><a id="l00054" name="l00054"></a><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"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordtype">bool</span> ans =</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <a class="code hl_function" href="../../dc/d67/subset__sum__dynamic_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"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <a class="code hl_function" href="../../dc/d67/subset__sum__dynamic_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"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    (*dp)[index][targetSum] = ans;  <span class="comment">// Save ans in dp map.</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">return</span> ans;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>}</div>
+</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="foldopen" id="foldopen00070" data-start="{" data-end="}">
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"><a class="line" href="../../dc/d67/subset__sum__dynamic_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50">   70</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../dc/d67/subset__sum__dynamic_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50">subset_sum_problem</a>(<span class="keyword">const</span> std::vector&lt;int&gt; &amp;arr, <span class="keyword">const</span> <span class="keywordtype">int</span> targetSum) {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordtype">size_t</span> n = arr.size();</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    std::vector&lt;std::unordered_map&lt;int, bool&gt;&gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(n);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../dc/d67/subset__sum__dynamic_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607">subset_sum_recursion</a>(arr, targetSum, &amp;<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>}</div>
+</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>}  <span class="comment">// namespace subset_sum</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>}  <span class="comment">// namespace dynamic_programming</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="foldopen" id="foldopen00082" data-start="{" data-end="}">
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="../../dc/d67/subset__sum__dynamic_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   82</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/d67/subset__sum__dynamic_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="comment">// custom input vector</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::vector&lt;std::vector&lt;int&gt;&gt; custom_input_arr(3);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    custom_input_arr[0] = std::vector&lt;int&gt;{1, -10, 2, 31, -6};</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    custom_input_arr[1] = std::vector&lt;int&gt;{2, 3, 4};</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    custom_input_arr[2] = std::vector&lt;int&gt;{0, 1, 0, 1, 0};</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::vector&lt;int&gt; custom_input_target_sum(3);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    custom_input_target_sum[0] = -14;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    custom_input_target_sum[1] = 10;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    custom_input_target_sum[2] = 2;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="comment">// calculated output vector by pal_part Function</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    std::vector&lt;int&gt; calculated_output(3);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 3; i++) {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        calculated_output[i] =</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>            dynamic_programming::subset_sum::subset_sum_problem(</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>                custom_input_arr[i], custom_input_target_sum[i]);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    }</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="comment">// expected output vector</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::vector&lt;bool&gt; expected_output{<span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">true</span>};</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="comment">// Testing implementation via assert function</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <span class="comment">// It will throw error if any of the expected test fails</span></div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="comment">// Else it will give nothing</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 3; i++) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        assert(expected_output[i] == calculated_output[i]);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    }</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests passed successfully!\n&quot;</span>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>}</div>
+</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="foldopen" id="foldopen00120" data-start="{" data-end="}">
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"><a class="line" href="../../dc/d67/subset__sum__dynamic_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  120</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dc/d67/subset__sum__dynamic_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <a class="code hl_function" href="../../dc/d67/subset__sum__dynamic_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the test</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>}</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> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></div>
+<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
+<div class="ttc" id="anamespacesubset__sum_html"><div class="ttname"><a href="../../dc/d3a/namespacesubset__sum.html">subset_sum</a></div><div class="ttdoc">Functions for [Sub-set sum problem] (https://en.wikipedia.org/wiki/Subset_sum_problem) algorithm.</div></div>
+<div class="ttc" id="asubset__sum__dynamic_8cpp_html_a280fcfb2f6fe49a31c4da572e7032607"><div class="ttname"><a href="../../dc/d67/subset__sum__dynamic_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607">dynamic_programming::subset_sum::subset_sum_recursion</a></div><div class="ttdeci">bool subset_sum_recursion(const std::vector&lt; int &gt; &amp;arr, int targetSum, std::vector&lt; std::unordered_map&lt; int, bool &gt; &gt; *dp, int index=0)</div><div class="ttdef"><b>Definition</b> <a href="#l00043">subset_sum_dynamic.cpp:43</a></div></div>
+<div class="ttc" id="asubset__sum__dynamic_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/d67/subset__sum__dynamic_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test Function.</div><div class="ttdef"><b>Definition</b> <a href="#l00082">subset_sum_dynamic.cpp:82</a></div></div>
+<div class="ttc" id="asubset__sum__dynamic_8cpp_html_ac94e6c0dee11278ac0a5491f1b9a4a50"><div class="ttname"><a href="../../dc/d67/subset__sum__dynamic_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50">dynamic_programming::subset_sum::subset_sum_problem</a></div><div class="ttdeci">bool subset_sum_problem(const std::vector&lt; int &gt; &amp;arr, const int targetSum)</div><div class="ttdef"><b>Definition</b> <a href="#l00070">subset_sum_dynamic.cpp:70</a></div></div>
+<div class="ttc" id="asubset__sum__dynamic_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/d67/subset__sum__dynamic_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00120">subset_sum_dynamic.cpp:120</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../dc/d67/subset__sum__dynamic_8cpp.html">subset_sum_dynamic.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dc/d6d/power__of__2_8cpp.html b/dc/d6d/power__of__2_8cpp.html
index 0670ad26d..3d512744e 100644
--- a/dc/d6d/power__of__2_8cpp.html
+++ b/dc/d6d/power__of__2_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: bit_manipulation/power_of_2.cpp File Reference</title>
+<title>TheAlgorithms/C++: bit_manipulation/power_of_2.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for power_of_2.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d24/power__of__2_8cpp__incl.svg" width="255" height="126"><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">
+</div>
+<p><a href="../../dc/d6d/power__of__2_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></td></tr>
@@ -144,6 +163,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>[Find whether a given number is power of 2] (<a href="https://www.geeksforgeeks.org/program-to-find-whether-a-given-number-is-power-of-2/">https://www.geeksforgeeks.org/program-to-find-whether-a-given-number-is-power-of-2/</a>) implementation </p>
 <p>We are given a positive integer number. We need to check whether the number is power of 2 or not.</p>
 <p>A binary number consists of two digits. They are 0 &amp; 1. Digit 1 is known as set bit in computer terms. Worst Case Time Complexity: O(1) Space complexity: O(1) </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/EcstaticPG-25811" target="_blank">Prafful Gupta</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../dc/d6d/power__of__2_8cpp_source.html">power_of_2.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -162,17 +183,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d6d/power__of__2_8cpp_source.html#l00072">72</a> of file <a class="el" href="../../dc/d6d/power__of__2_8cpp_source.html">power_of_2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   72</span>           {</div>
 <div class="line"><span class="lineno">   73</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   74</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   75</span>}</div>
-<div class="ttc" id="apower__of__2_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> power_of_2.cpp:49</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d6d/power__of__2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="370" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="apower__of__2_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d6d/power__of__2_8cpp_source.html#l00049">power_of_2.cpp:49</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -200,6 +218,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d6d/power__of__2_8cpp_source.html#l00049">49</a> of file <a class="el" href="../../dc/d6d/power__of__2_8cpp_source.html">power_of_2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   49</span>                   {</div>
 <div class="line"><span class="lineno">   50</span>    <span class="comment">// n = 4 return true</span></div>
 <div class="line"><span class="lineno">   51</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f">bit_manipulation::isPowerOfTwo</a>(4) == <span class="keyword">true</span>);</div>
@@ -217,17 +237,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   63</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f">bit_manipulation::isPowerOfTwo</a>(97) == <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">   64</span>    <span class="comment">// n = 1024 return true</span></div>
 <div class="line"><span class="lineno">   65</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f">bit_manipulation::isPowerOfTwo</a>(1024) == <span class="keyword">true</span>);</div>
-<div class="line"><span class="lineno">   66</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All test cases successfully passed!&quot;</span> &lt;&lt; <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">   66</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   67</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="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="anamespacebit__manipulation_html_a5032470c9974bbd6ec254bf296530a5f"><div class="ttname"><a href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f">bit_manipulation::isPowerOfTwo</a></div><div class="ttdeci">bool isPowerOfTwo(std ::int64_t n)</div><div class="ttdoc">The main function implements check for power of 2.</div><div class="ttdef"><b>Definition</b> power_of_2.cpp:32</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d6d/power__of__2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="272" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacebit__manipulation_html_a5032470c9974bbd6ec254bf296530a5f"><div class="ttname"><a href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f">bit_manipulation::isPowerOfTwo</a></div><div class="ttdeci">bool isPowerOfTwo(std ::int64_t n)</div><div class="ttdoc">The main function implements check for power of 2.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d6d/power__of__2_8cpp_source.html#l00032">power_of_2.cpp:32</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dc/d6d/power__of__2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/dc/d6d/power__of__2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index fce074506..000000000
--- a/dc/d6d/power__of__2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,35,49,60"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="146,5,218,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,41,130,25,131,30,49,46"/>
-<area shape="rect" id="Node000003" href="$d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f" title="The main function implements check for power of 2." alt="" coords="97,55,267,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="49,49,82,55,81,60,48,54"/>
-</map>
diff --git a/dc/d6d/power__of__2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/dc/d6d/power__of__2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index c44462b45..000000000
--- a/dc/d6d/power__of__2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e93e6ad494026c8e7ae0a9ddff77eb2d
\ No newline at end of file
diff --git a/dc/d6d/power__of__2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/dc/d6d/power__of__2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 0e957865f..000000000
--- a/dc/d6d/power__of__2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="204pt" height="76pt"
- viewBox="0.00 0.00 204.25 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-45.88 0,-45.88 0,-26.62 32.5,-26.62 32.5,-45.88"/>
-<text text-anchor="middle" x="16.25" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.12,-67.88 105.62,-67.88 105.62,-48.62 159.12,-48.62 159.12,-67.88"/>
-<text text-anchor="middle" x="132.38" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.64,-39.22C48.35,-42.25 73.32,-47.06 94.22,-51.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.36,-54.49 103.84,-52.94 94.69,-47.61 93.36,-54.49"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f" target="_top" xlink:title="The main function implements check for power of 2.">
-<polygon fill="white" stroke="#666666" points="196.25,-30.5 68.5,-30.5 68.5,0 196.25,0 196.25,-30.5"/>
-<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::isPower</text>
-<text text-anchor="middle" x="132.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">OfTwo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.64,-33.42C39.35,-32.18 47.74,-30.64 56.78,-28.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.37,-32.43 66.58,-27.17 56.11,-25.54 57.37,-32.43"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d6d/power__of__2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/dc/d6d/power__of__2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 3fa7848e7..000000000
--- a/dc/d6d/power__of__2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="204pt" height="76pt"
- viewBox="0.00 0.00 204.25 75.88" 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 71.88)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-45.88 0,-45.88 0,-26.62 32.5,-26.62 32.5,-45.88"/>
-<text text-anchor="middle" x="16.25" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.12,-67.88 105.62,-67.88 105.62,-48.62 159.12,-48.62 159.12,-67.88"/>
-<text text-anchor="middle" x="132.38" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.64,-39.22C48.35,-42.25 73.32,-47.06 94.22,-51.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.36,-54.49 103.84,-52.94 94.69,-47.61 93.36,-54.49"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f" target="_top" xlink:title="The main function implements check for power of 2.">
-<polygon fill="white" stroke="#666666" points="196.25,-30.5 68.5,-30.5 68.5,0 196.25,0 196.25,-30.5"/>
-<text text-anchor="start" x="76.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::isPower</text>
-<text text-anchor="middle" x="132.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">OfTwo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.64,-33.42C39.35,-32.18 47.74,-30.64 56.78,-28.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.37,-32.43 66.58,-27.17 56.11,-25.54 57.37,-32.43"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d6d/power__of__2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/d6d/power__of__2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 6ebb67c75..000000000
--- a/dc/d6d/power__of__2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,35,55,60"/>
-<area shape="rect" id="Node000002" href="$dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,35,146,60"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,45,87,45,87,50,55,50"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="244,5,315,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,41,228,25,229,30,147,46"/>
-<area shape="rect" id="Node000004" href="$d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f" title="The main function implements check for power of 2." alt="" coords="194,55,364,96"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="147,49,179,55,178,60,146,54"/>
-</map>
diff --git a/dc/d6d/power__of__2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/d6d/power__of__2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 1ad4e467b..000000000
--- a/dc/d6d/power__of__2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1b85088c747a5d8cf79183d934a359f1
\ No newline at end of file
diff --git a/dc/d6d/power__of__2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/d6d/power__of__2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 53320ae63..000000000
--- a/dc/d6d/power__of__2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="277pt" height="76pt"
- viewBox="0.00 0.00 277.25 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-45.88 0,-45.88 0,-26.62 37,-26.62 37,-45.88"/>
-<text text-anchor="middle" x="18.5" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-45.88 73,-45.88 73,-26.62 105.5,-26.62 105.5,-45.88"/>
-<text text-anchor="middle" x="89.25" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-36.25C44.58,-36.25 53.31,-36.25 61.45,-36.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-39.75 71.2,-36.25 61.2,-32.75 61.2,-39.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.12,-67.88 178.62,-67.88 178.62,-48.62 232.12,-48.62 232.12,-67.88"/>
-<text text-anchor="middle" x="205.38" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.64,-39.22C121.35,-42.25 146.32,-47.06 167.22,-51.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.36,-54.49 176.84,-52.94 167.69,-47.61 166.36,-54.49"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f" target="_top" xlink:title="The main function implements check for power of 2.">
-<polygon fill="white" stroke="#666666" points="269.25,-30.5 141.5,-30.5 141.5,0 269.25,0 269.25,-30.5"/>
-<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::isPower</text>
-<text text-anchor="middle" x="205.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">OfTwo</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.64,-33.42C112.35,-32.18 120.74,-30.64 129.78,-28.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.37,-32.43 139.58,-27.17 129.11,-25.54 130.37,-32.43"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d6d/power__of__2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dc/d6d/power__of__2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index b447111c8..000000000
--- a/dc/d6d/power__of__2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="277pt" height="76pt"
- viewBox="0.00 0.00 277.25 75.88" 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 71.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-45.88 0,-45.88 0,-26.62 37,-26.62 37,-45.88"/>
-<text text-anchor="middle" x="18.5" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-45.88 73,-45.88 73,-26.62 105.5,-26.62 105.5,-45.88"/>
-<text text-anchor="middle" x="89.25" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-36.25C44.58,-36.25 53.31,-36.25 61.45,-36.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-39.75 71.2,-36.25 61.2,-32.75 61.2,-39.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.12,-67.88 178.62,-67.88 178.62,-48.62 232.12,-48.62 232.12,-67.88"/>
-<text text-anchor="middle" x="205.38" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.64,-39.22C121.35,-42.25 146.32,-47.06 167.22,-51.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.36,-54.49 176.84,-52.94 167.69,-47.61 166.36,-54.49"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f" target="_top" xlink:title="The main function implements check for power of 2.">
-<polygon fill="white" stroke="#666666" points="269.25,-30.5 141.5,-30.5 141.5,0 269.25,0 269.25,-30.5"/>
-<text text-anchor="start" x="149.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">bit_manipulation::isPower</text>
-<text text-anchor="middle" x="205.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">OfTwo</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.64,-33.42C112.35,-32.18 120.74,-30.64 129.78,-28.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.37,-32.43 139.58,-27.17 129.11,-25.54 130.37,-32.43"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d6d/power__of__2_8cpp_source.html b/dc/d6d/power__of__2_8cpp_source.html
new file mode 100644
index 000000000..e9d344ef9
--- /dev/null
+++ b/dc/d6d/power__of__2_8cpp_source.html
@@ -0,0 +1,189 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: bit_manipulation/power_of_2.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dc/d6d/power__of__2_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">power_of_2.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dc/d6d/power__of__2_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a> {</div>
+<div class="foldopen" id="foldopen00032" data-start="{" data-end="}">
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f">   32</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f">isPowerOfTwo</a>(std ::int64_t n) {  <span class="comment">// int64_t is preferred over int so that</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>                                      <span class="comment">// no Overflow can be there.</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordflow">return</span> n &gt; 0 &amp;&amp; !(n &amp; n - 1);  <span class="comment">// If we subtract a power of 2 numbers by 1</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="comment">// then all unset bits after the only set bit become set; and the set bit</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="comment">// becomes unset.</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="comment">// If a number n is a power of 2 then bitwise and of n-1 and n will be zero.</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="comment">// The expression n&amp;(n-1) will not work when n is 0.</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="comment">// To handle this case also, our expression will become n&amp; (!n&amp;(n-1))</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>}</div>
+</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>}  <span class="comment">// namespace bit_manipulation</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="foldopen" id="foldopen00049" data-start="{" data-end="}">
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"><a class="line" href="../../dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   49</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="comment">// n = 4 return true</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f">bit_manipulation::isPowerOfTwo</a>(4) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="comment">// n = 6 return false</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f">bit_manipulation::isPowerOfTwo</a>(6) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="comment">// n = 13 return false</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f">bit_manipulation::isPowerOfTwo</a>(13) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="comment">// n = 64 return true</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f">bit_manipulation::isPowerOfTwo</a>(64) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="comment">// n = 15 return false</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f">bit_manipulation::isPowerOfTwo</a>(15) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="comment">// n = 32 return true</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f">bit_manipulation::isPowerOfTwo</a>(32) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="comment">// n = 97 return false</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f">bit_manipulation::isPowerOfTwo</a>(97) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="comment">// n = 1024 return true</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    assert(<a class="code hl_function" href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f">bit_manipulation::isPowerOfTwo</a>(1024) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00072" data-start="{" data-end="}">
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"><a class="line" href="../../dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   72</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <a class="code hl_function" href="../../dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>}</div>
+</div>
+<div class="ttc" id="anamespacebit__manipulation_html"><div class="ttname"><a href="../../d7/d81/namespacebit__manipulation.html">bit_manipulation</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacebit__manipulation_html_a5032470c9974bbd6ec254bf296530a5f"><div class="ttname"><a href="../../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f">bit_manipulation::isPowerOfTwo</a></div><div class="ttdeci">bool isPowerOfTwo(std ::int64_t n)</div><div class="ttdoc">The main function implements check for power of 2.</div><div class="ttdef"><b>Definition</b> <a href="#l00032">power_of_2.cpp:32</a></div></div>
+<div class="ttc" id="apower__of__2_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/d6d/power__of__2_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> <a href="#l00049">power_of_2.cpp:49</a></div></div>
+<div class="ttc" id="apower__of__2_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00072">power_of_2.cpp:72</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_f3c4fbc4e901afa0a54d0623c5574aa7.html">bit_manipulation</a></li><li class="navelem"><a class="el" href="../../dc/d6d/power__of__2_8cpp.html">power_of_2.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html b/dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html
index 97f0c0e1b..14a6d9827 100644
--- a/dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html
+++ b/dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: std::is_arithmetic&lt; uint256_t &gt; Struct Reference</title>
+<title>TheAlgorithms/C++: std::is_arithmetic&lt; uint256_t &gt; Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -117,7 +134,10 @@ Collaboration diagram for std::is_arithmetic&lt; uint256_t &gt;:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.svg" width="132" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
-<hr/>The documentation for this struct was generated from the following file:<ul>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00024">24</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
+</div><hr/>The documentation for this struct was generated from the following file:<ul>
 <li>ciphers/<a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a></li>
 </ul>
 </div><!-- contents -->
@@ -125,7 +145,7 @@ Collaboration diagram for std::is_arithmetic&lt; uint256_t &gt;:</div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
-    <li class="navelem"><a class="el" href="../../d8/dcc/namespacestd.html">std</a></li><li class="navelem"><a class="el" href="../../dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html">is_arithmetic&lt; uint256_t &gt;</a></li>
+    <li class="navelem"><b>std</b></li><li class="navelem"><a class="el" href="../../dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html">is_arithmetic&lt; uint256_t &gt;</a></li>
     <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
   </ul>
 </div>
diff --git a/dc/d82/area_8cpp.html b/dc/d82/area_8cpp.html
index 3c202715f..23b76509f 100644
--- a/dc/d82/area_8cpp.html
+++ b/dc/d82/area_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/area.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/area.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for area.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/da0/area_8cpp__incl.svg" width="336" height="111"><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">
+</div>
+<p><a href="../../dc/d82/area_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -179,7 +198,26 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Implementations for the <a href="https://en.wikipedia.org/wiki/Area" target="_blank">area</a> of various shapes. </p>
 <p>The area of a shape is the amount of 2D space it takes up. All shapes have a formula to get the area of any given shape. These implementations support multiple return types.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Focusucof" target="_blank">Focusucof</a> </dd></dl>
-</div><h2 class="groupheader">Function Documentation</h2>
+
+<p class="definition">Definition in file <a class="el" href="../../dc/d82/area_8cpp_source.html">area.cpp</a>.</p>
+</div><h2 class="groupheader">Macro Definition Documentation</h2>
+<a id="a525335710b53cb064ca56b936120431e" name="a525335710b53cb064ca56b936120431e"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a525335710b53cb064ca56b936120431e">&#9670;&#160;</a></span>_USE_MATH_DEFINES</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">#define _USE_MATH_DEFINES</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d82/area_8cpp_source.html#l00011">11</a> of file <a class="el" href="../../dc/d82/area_8cpp_source.html">area.cpp</a>.</p>
+
+</div>
+</div>
+<h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
 
@@ -197,17 +235,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d82/area_8cpp_source.html#l00300">300</a> of file <a class="el" href="../../dc/d82/area_8cpp_source.html">area.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  300</span>           {</div>
 <div class="line"><span class="lineno">  301</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  302</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  303</span>}</div>
-<div class="ttc" id="aarea_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> area.cpp:130</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d82/area_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="639" height="480"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aarea_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d82/area_8cpp_source.html#l00130">area.cpp:130</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -235,6 +270,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d82/area_8cpp_source.html#l00130">130</a> of file <a class="el" href="../../dc/d82/area_8cpp_source.html">area.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  130</span>                   {</div>
 <div class="line"><span class="lineno">  131</span>    <span class="comment">// I/O variables for testing</span></div>
 <div class="line"><span class="lineno">  132</span>    uint16_t int_length = 0;    <span class="comment">// 16 bit integer length input</span></div>
@@ -260,24 +297,24 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  152</span>    int_expected = 25;</div>
 <div class="line"><span class="lineno">  153</span>    int_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049">math::square_area</a>(int_length);</div>
 <div class="line"><span class="lineno">  154</span> </div>
-<div class="line"><span class="lineno">  155</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;AREA OF A SQUARE (int)&quot;</span> &lt;&lt; <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">  156</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; <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">  157</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; <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">  158</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_area &lt;&lt; <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">  155</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;AREA OF A SQUARE (int)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  156</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  157</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  158</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_area &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  159</span>    assert(int_area == int_expected);</div>
-<div class="line"><span class="lineno">  160</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  160</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  161</span> </div>
 <div class="line"><span class="lineno">  162</span>    <span class="comment">// 2nd test</span></div>
 <div class="line"><span class="lineno">  163</span>    float_length = 2.5;</div>
 <div class="line"><span class="lineno">  164</span>    float_expected = 6.25;</div>
 <div class="line"><span class="lineno">  165</span>    float_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049">math::square_area</a>(float_length);</div>
 <div class="line"><span class="lineno">  166</span> </div>
-<div class="line"><span class="lineno">  167</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;AREA OF A SQUARE (float)&quot;</span> &lt;&lt; <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">  168</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; float_length &lt;&lt; <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">  169</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; float_expected &lt;&lt; <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">  170</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; float_area &lt;&lt; <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">  167</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;AREA OF A SQUARE (float)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  168</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; float_length &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  169</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; float_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  170</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; float_area &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  171</span>    assert(float_area == float_expected);</div>
-<div class="line"><span class="lineno">  172</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  172</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  173</span> </div>
 <div class="line"><span class="lineno">  174</span>    <span class="comment">// 3rd test</span></div>
 <div class="line"><span class="lineno">  175</span>    int_length = 4;</div>
@@ -285,13 +322,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  177</span>    int_expected = 28;</div>
 <div class="line"><span class="lineno">  178</span>    int_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca">math::rect_area</a>(int_length, int_width);</div>
 <div class="line"><span class="lineno">  179</span> </div>
-<div class="line"><span class="lineno">  180</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;AREA OF A RECTANGLE (int)&quot;</span> &lt;&lt; <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">  181</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; <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">  182</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Width: &quot;</span> &lt;&lt; int_width &lt;&lt; <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">  183</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; <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">  184</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_area &lt;&lt; <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">  180</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;AREA OF A RECTANGLE (int)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  181</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  182</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Width: &quot;</span> &lt;&lt; int_width &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  183</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  184</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_area &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  185</span>    assert(int_area == int_expected);</div>
-<div class="line"><span class="lineno">  186</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  186</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  187</span> </div>
 <div class="line"><span class="lineno">  188</span>    <span class="comment">// 4th test</span></div>
 <div class="line"><span class="lineno">  189</span>    double_length = 2.5;</div>
@@ -299,13 +336,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  191</span>    double_expected = 14.25;</div>
 <div class="line"><span class="lineno">  192</span>    double_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca">math::rect_area</a>(double_length, double_width);</div>
 <div class="line"><span class="lineno">  193</span> </div>
-<div class="line"><span class="lineno">  194</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;AREA OF A RECTANGLE (double)&quot;</span> &lt;&lt; <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">  195</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; double_length &lt;&lt; <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">  196</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Width: &quot;</span> &lt;&lt; double_width &lt;&lt; <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">  197</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; <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">  198</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_area &lt;&lt; <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">  194</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;AREA OF A RECTANGLE (double)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  195</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; double_length &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  196</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Width: &quot;</span> &lt;&lt; double_width &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  197</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  198</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_area &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  199</span>    assert(double_area == double_expected);</div>
-<div class="line"><span class="lineno">  200</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  200</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  201</span> </div>
 <div class="line"><span class="lineno">  202</span>    <span class="comment">// 5th test</span></div>
 <div class="line"><span class="lineno">  203</span>    int_base = 10;</div>
@@ -313,13 +350,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  205</span>    int_expected = 15;</div>
 <div class="line"><span class="lineno">  206</span>    int_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc">math::triangle_area</a>(int_base, int_height);</div>
 <div class="line"><span class="lineno">  207</span> </div>
-<div class="line"><span class="lineno">  208</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;AREA OF A TRIANGLE&quot;</span> &lt;&lt; <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">  209</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Base: &quot;</span> &lt;&lt; int_base &lt;&lt; <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">  210</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; <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">  211</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; <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">  212</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_area &lt;&lt; <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>    std::cout &lt;&lt; <span class="stringliteral">&quot;AREA OF A TRIANGLE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  209</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Base: &quot;</span> &lt;&lt; int_base &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  210</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  211</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  212</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_area &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  213</span>    assert(int_area == int_expected);</div>
-<div class="line"><span class="lineno">  214</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  214</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  215</span> </div>
 <div class="line"><span class="lineno">  216</span>    <span class="comment">// 6th test</span></div>
 <div class="line"><span class="lineno">  217</span>    double_radius = 6;</div>
@@ -328,12 +365,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  220</span>                             <span class="comment">// truncates after 14 decimal places</span></div>
 <div class="line"><span class="lineno">  221</span>    double_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75">math::circle_area</a>(double_radius);</div>
 <div class="line"><span class="lineno">  222</span> </div>
-<div class="line"><span class="lineno">  223</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;AREA OF A CIRCLE&quot;</span> &lt;&lt; <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">  224</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; <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">  225</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; <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">  226</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_area &lt;&lt; <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">  223</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;AREA OF A CIRCLE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  224</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  225</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  226</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_area &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  227</span>    assert(double_area == double_expected);</div>
-<div class="line"><span class="lineno">  228</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  228</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  229</span> </div>
 <div class="line"><span class="lineno">  230</span>    <span class="comment">// 7th test</span></div>
 <div class="line"><span class="lineno">  231</span>    int_base = 6;</div>
@@ -341,25 +378,25 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  233</span>    int_expected = 42;</div>
 <div class="line"><span class="lineno">  234</span>    int_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f">math::parallelogram_area</a>(int_base, int_height);</div>
 <div class="line"><span class="lineno">  235</span> </div>
-<div class="line"><span class="lineno">  236</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;AREA OF A PARALLELOGRAM&quot;</span> &lt;&lt; <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">  237</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Base: &quot;</span> &lt;&lt; int_base &lt;&lt; <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">  238</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; <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">  239</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; <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">  240</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_area &lt;&lt; <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">  236</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;AREA OF A PARALLELOGRAM&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  237</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Base: &quot;</span> &lt;&lt; int_base &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  238</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  239</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  240</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_area &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  241</span>    assert(int_area == int_expected);</div>
-<div class="line"><span class="lineno">  242</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  242</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  243</span> </div>
 <div class="line"><span class="lineno">  244</span>    <span class="comment">// 8th test</span></div>
 <div class="line"><span class="lineno">  245</span>    double_length = 5.5;</div>
 <div class="line"><span class="lineno">  246</span>    double_expected = 181.5;</div>
 <div class="line"><span class="lineno">  247</span>    double_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c">math::cube_surface_area</a>(double_length);</div>
 <div class="line"><span class="lineno">  248</span> </div>
-<div class="line"><span class="lineno">  249</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;SURFACE AREA OF A CUBE&quot;</span> &lt;&lt; <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">  250</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; double_length &lt;&lt; <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">  251</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; <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">  252</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_area &lt;&lt; <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">  249</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;SURFACE AREA OF A CUBE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  250</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; double_length &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  251</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  252</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_area &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  253</span>    assert(double_area == double_expected);</div>
-<div class="line"><span class="lineno">  254</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  254</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  255</span> </div>
 <div class="line"><span class="lineno">  256</span>    <span class="comment">// 9th test</span></div>
 <div class="line"><span class="lineno">  257</span>    double_radius = 10.0;</div>
@@ -367,12 +404,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  259</span>                                           <span class="comment">// value gets truncated</span></div>
 <div class="line"><span class="lineno">  260</span>    double_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656">math::sphere_surface_area</a>(double_radius);</div>
 <div class="line"><span class="lineno">  261</span> </div>
-<div class="line"><span class="lineno">  262</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;SURFACE AREA OF A SPHERE&quot;</span> &lt;&lt; <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">  263</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; <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">  264</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; <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">  265</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_area &lt;&lt; <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">  262</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;SURFACE AREA OF A SPHERE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  263</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  264</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  265</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_area &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  266</span>    assert(double_area == double_expected);</div>
-<div class="line"><span class="lineno">  267</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  267</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  268</span> </div>
 <div class="line"><span class="lineno">  269</span>    <span class="comment">// 10th test</span></div>
 <div class="line"><span class="lineno">  270</span>    double_radius = 4.0;</div>
@@ -380,43 +417,36 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  272</span>    double_expected = 276.46015351590177;</div>
 <div class="line"><span class="lineno">  273</span>    double_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864">math::cylinder_surface_area</a>(double_radius, double_height);</div>
 <div class="line"><span class="lineno">  274</span> </div>
-<div class="line"><span class="lineno">  275</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;SURFACE AREA OF A CYLINDER&quot;</span> &lt;&lt; <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">  276</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; <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">  277</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; double_height &lt;&lt; <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">  278</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; <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">  279</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_area &lt;&lt; <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">  275</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;SURFACE AREA OF A CYLINDER&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  276</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  277</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; double_height &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  278</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  279</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_area &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  280</span>    assert(double_area == double_expected);</div>
-<div class="line"><span class="lineno">  281</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  281</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  282</span> </div>
 <div class="line"><span class="lineno">  283</span>    <span class="comment">// 11th test</span></div>
 <div class="line"><span class="lineno">  284</span>    double_radius = 10.0;</div>
 <div class="line"><span class="lineno">  285</span>    double_expected = 942.4777960769379;</div>
 <div class="line"><span class="lineno">  286</span>    double_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb">math::hemi_sphere_surface_area</a>(double_radius);</div>
 <div class="line"><span class="lineno">  287</span> </div>
-<div class="line"><span class="lineno">  288</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;SURFACE AREA OF A HEMI-SPHERE&quot;</span> &lt;&lt; <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">  289</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; <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">  290</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; <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">  291</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_area &lt;&lt; <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">  288</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;SURFACE AREA OF A HEMI-SPHERE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  289</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  290</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  291</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_area &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  292</span>    assert(double_area == double_expected);</div>
-<div class="line"><span class="lineno">  293</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a> &lt;&lt; <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">  293</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  294</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="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="anamespacemath_html_a3277e65a8f380e7632791975bfba0efb"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb">math::hemi_sphere_surface_area</a></div><div class="ttdeci">T hemi_sphere_surface_area(T radius)</div><div class="ttdoc">surface area of a hemi-sphere ( 3 * pi * r^2)</div><div class="ttdef"><b>Definition</b> area.cpp:121</div></div>
-<div class="ttc" id="anamespacemath_html_a40e36c67da78d2131408c57ee091ad75"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75">math::circle_area</a></div><div class="ttdeci">T circle_area(T radius)</div><div class="ttdoc">area of a circle (pi</div><div class="ttdef"><b>Definition</b> area.cpp:63</div></div>
-<div class="ttc" id="anamespacemath_html_a5de184925e68658f15415dd53954df4f"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f">math::parallelogram_area</a></div><div class="ttdeci">T parallelogram_area(T base, T height)</div><div class="ttdoc">area of a parallelogram (b * h)</div><div class="ttdef"><b>Definition</b> area.cpp:75</div></div>
-<div class="ttc" id="anamespacemath_html_a971ce57e368f2f631cf1f4ff3f864049"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049">math::square_area</a></div><div class="ttdeci">T square_area(T length)</div><div class="ttdoc">area of a square (l * l)</div><div class="ttdef"><b>Definition</b> area.cpp:29</div></div>
-<div class="ttc" id="anamespacemath_html_ab31d141f7c5b551746b1eee0eb4dedca"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca">math::rect_area</a></div><div class="ttdeci">T rect_area(T length, T width)</div><div class="ttdoc">area of a rectangle (l * w)</div><div class="ttdef"><b>Definition</b> area.cpp:40</div></div>
-<div class="ttc" id="anamespacemath_html_ab3b920cc56442abd92279ba23b50f4dc"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc">math::triangle_area</a></div><div class="ttdeci">T triangle_area(T base, T height)</div><div class="ttdoc">area of a triangle (b * h / 2)</div><div class="ttdef"><b>Definition</b> area.cpp:52</div></div>
-<div class="ttc" id="anamespacemath_html_ab7f29862d30df351c317eedd60a0c656"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656">math::sphere_surface_area</a></div><div class="ttdeci">T sphere_surface_area(T radius)</div><div class="ttdoc">surface area of a sphere ( 4 * pi * r^2)</div><div class="ttdef"><b>Definition</b> area.cpp:97</div></div>
-<div class="ttc" id="anamespacemath_html_abc46c784a297fc1d2eb8b33a327fba4c"><div class="ttname"><a href="../../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c">math::cube_surface_area</a></div><div class="ttdeci">T cube_surface_area(T length)</div><div class="ttdoc">surface area of a cube ( 6 * (l</div><div class="ttdef"><b>Definition</b> area.cpp:86</div></div>
-<div class="ttc" id="anamespacemath_html_ac5803413618fcfb922cb32c6db0fc864"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864">math::cylinder_surface_area</a></div><div class="ttdeci">T cylinder_surface_area(T radius, T height)</div><div class="ttdoc">surface area of a cylinder (2 * pi * r * h + 2 * pi * r^2)</div><div class="ttdef"><b>Definition</b> area.cpp:109</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="542" height="480"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemath_html_a3277e65a8f380e7632791975bfba0efb"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb">math::hemi_sphere_surface_area</a></div><div class="ttdeci">T hemi_sphere_surface_area(T radius)</div><div class="ttdoc">surface area of a hemi-sphere ( 3 * pi * r^2)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d82/area_8cpp_source.html#l00121">area.cpp:121</a></div></div>
+<div class="ttc" id="anamespacemath_html_a40e36c67da78d2131408c57ee091ad75"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75">math::circle_area</a></div><div class="ttdeci">T circle_area(T radius)</div><div class="ttdoc">area of a circle (pi</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d82/area_8cpp_source.html#l00063">area.cpp:63</a></div></div>
+<div class="ttc" id="anamespacemath_html_a5de184925e68658f15415dd53954df4f"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f">math::parallelogram_area</a></div><div class="ttdeci">T parallelogram_area(T base, T height)</div><div class="ttdoc">area of a parallelogram (b * h)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d82/area_8cpp_source.html#l00075">area.cpp:75</a></div></div>
+<div class="ttc" id="anamespacemath_html_a971ce57e368f2f631cf1f4ff3f864049"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049">math::square_area</a></div><div class="ttdeci">T square_area(T length)</div><div class="ttdoc">area of a square (l * l)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d82/area_8cpp_source.html#l00029">area.cpp:29</a></div></div>
+<div class="ttc" id="anamespacemath_html_ab31d141f7c5b551746b1eee0eb4dedca"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca">math::rect_area</a></div><div class="ttdeci">T rect_area(T length, T width)</div><div class="ttdoc">area of a rectangle (l * w)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d82/area_8cpp_source.html#l00040">area.cpp:40</a></div></div>
+<div class="ttc" id="anamespacemath_html_ab3b920cc56442abd92279ba23b50f4dc"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc">math::triangle_area</a></div><div class="ttdeci">T triangle_area(T base, T height)</div><div class="ttdoc">area of a triangle (b * h / 2)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d82/area_8cpp_source.html#l00052">area.cpp:52</a></div></div>
+<div class="ttc" id="anamespacemath_html_ab7f29862d30df351c317eedd60a0c656"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656">math::sphere_surface_area</a></div><div class="ttdeci">T sphere_surface_area(T radius)</div><div class="ttdoc">surface area of a sphere ( 4 * pi * r^2)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d82/area_8cpp_source.html#l00097">area.cpp:97</a></div></div>
+<div class="ttc" id="anamespacemath_html_abc46c784a297fc1d2eb8b33a327fba4c"><div class="ttname"><a href="../../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c">math::cube_surface_area</a></div><div class="ttdeci">T cube_surface_area(T length)</div><div class="ttdoc">surface area of a cube ( 6 * (l</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d82/area_8cpp_source.html#l00086">area.cpp:86</a></div></div>
+<div class="ttc" id="anamespacemath_html_ac5803413618fcfb922cb32c6db0fc864"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864">math::cylinder_surface_area</a></div><div class="ttdeci">T cylinder_surface_area(T radius, T height)</div><div class="ttdoc">surface area of a cylinder (2 * pi * r * h + 2 * pi * r^2)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d82/area_8cpp_source.html#l00109">area.cpp:109</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index a6b19b0f2..000000000
--- a/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,30 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,228,49,254"/>
-<area shape="rect" id="Node000002" href="$dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75" title="area of a circle (pi" alt="" coords="143,5,264,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="26,228,29,191,40,140,60,86,75,62,95,40,110,30,127,22,129,27,113,34,98,44,80,65,65,89,45,141,35,191,31,228"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c" title="surface area of a cube ( 6 * (l" alt="" coords="120,55,288,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="28,227,34,198,46,161,66,122,95,90,104,83,107,87,98,93,71,125,51,163,39,200,33,228"/>
-<area shape="rect" id="Node000004" href="$dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864" title="surface area of a cylinder (2 * pi * r * h + 2 * pi * r^2)" alt="" coords="111,104,296,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="31,226,54,183,73,159,95,139,102,134,105,139,98,143,76,162,59,186,36,229"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="168,153,240,179"/>
-<area shape="poly" id="edge7_Node000001_Node000007" title=" " alt="" coords="41,226,65,206,96,188,152,170,154,175,98,193,68,210,44,230"/>
-<area shape="rect" id="Node000008" href="$dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb" title="surface area of a hemi&#45;sphere ( 3 * pi * r^2)" alt="" coords="97,203,311,228"/>
-<area shape="poly" id="edge8_Node000001_Node000008" title=" " alt="" coords="49,235,95,229,95,234,49,240"/>
-<area shape="rect" id="Node000009" href="$dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f" title="area of a parallelogram (b * h)" alt="" coords="120,252,288,278"/>
-<area shape="poly" id="edge9_Node000001_Node000009" title=" " alt="" coords="49,241,105,249,105,254,49,246"/>
-<area shape="rect" id="Node000010" href="$dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca" title="area of a rectangle (l * w)" alt="" coords="148,301,260,327"/>
-<area shape="poly" id="edge11_Node000001_Node000010" title=" " alt="" coords="45,252,69,271,98,288,133,300,132,305,96,293,66,275,41,256"/>
-<area shape="rect" id="Node000011" href="$dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656" title="surface area of a sphere ( 4 * pi * r^2)" alt="" coords="114,351,294,376"/>
-<area shape="poly" id="edge12_Node000001_Node000011" title=" " alt="" coords="36,253,59,295,77,318,98,337,105,341,102,346,95,342,73,322,54,298,31,255"/>
-<area shape="rect" id="Node000012" href="$dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049" title="area of a square (l * l)" alt="" coords="139,400,268,426"/>
-<area shape="poly" id="edge13_Node000001_Node000012" title=" " alt="" coords="33,254,40,282,52,318,71,355,98,387,126,402,123,406,95,391,66,358,47,320,34,283,28,255"/>
-<area shape="rect" id="Node000013" href="$dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc" title="area of a triangle (b * h / 2)" alt="" coords="138,449,270,475"/>
-<area shape="poly" id="edge14_Node000001_Node000013" title=" " alt="" coords="31,254,35,291,45,340,65,392,80,416,98,436,124,451,121,456,95,440,76,419,60,395,40,342,30,291,26,255"/>
-<area shape="rect" id="Node000005" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="359,252,415,278"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="293,128,313,139,336,160,355,186,379,236,374,239,350,189,332,164,309,143,291,133"/>
-<area shape="poly" id="edge5_Node000005_Node000005" title=" " alt="" coords="367,253,364,243,366,234,374,228,387,225,401,228,409,235,405,239,399,233,387,231,376,233,370,237,369,243,372,251"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="463,252,536,278"/>
-<area shape="poly" id="edge6_Node000005_Node000006" title=" " alt="" coords="416,262,447,262,447,268,416,268"/>
-<area shape="poly" id="edge10_Node000009_Node000005" title=" " alt="" coords="288,262,344,262,344,268,288,268"/>
-<area shape="poly" id="edge15_Node000013_Node000005" title=" " alt="" coords="270,455,291,447,309,436,338,404,358,365,371,326,379,293,384,294,376,328,363,367,342,407,313,440,293,452,271,460"/>
-</map>
diff --git a/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index a04292752..000000000
--- a/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1e1de9672f73bb85eb30c13febc5363d
\ No newline at end of file
diff --git a/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index d750fb30a..000000000
--- a/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,290 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="406pt" height="360pt"
- viewBox="0.00 0.00 405.75 360.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 356.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-185.25 0,-185.25 0,-166 32.5,-166 32.5,-185.25"/>
-<text text-anchor="middle" x="16.25" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75" target="_top" xlink:title="area of a circle (pi">
-<polygon fill="white" stroke="#666666" points="194.38,-352.25 103.38,-352.25 103.38,-333 194.38,-333 194.38,-352.25"/>
-<text text-anchor="middle" x="148.88" y="-338.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::circle_area</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M17.51,-185.37C18.78,-212.01 26.15,-286.63 68.5,-324.62 75.16,-330.6 83.37,-334.72 91.97,-337.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.95,-340.88 101.51,-340.06 92.74,-334.12 90.95,-340.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c" target="_top" xlink:title="surface area of a cube ( 6 * (l">
-<polygon fill="white" stroke="#666666" points="212,-315.25 85.75,-315.25 85.75,-296 212,-296 212,-315.25"/>
-<text text-anchor="middle" x="148.88" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cube_surface_area</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M18.77,-185.49C22.7,-207.47 35.31,-260.66 68.5,-287.62 70.63,-289.35 72.89,-290.92 75.25,-292.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.59,-295.43 84.1,-296.76 76.71,-289.17 73.59,-295.43"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864" target="_top" xlink:title="surface area of a cylinder (2 * pi * r * h + 2 * pi * r^2)">
-<polygon fill="white" stroke="#666666" points="218.38,-278.25 79.38,-278.25 79.38,-259 218.38,-259 218.38,-278.25"/>
-<text text-anchor="middle" x="148.88" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cylinder_surface_area</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.21,-185.68C28.18,-202.01 44.24,-234.13 68.5,-250.62 70.11,-251.72 71.77,-252.74 73.48,-253.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.79,-256.78 82.32,-257.94 74.81,-250.47 71.79,-256.78"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="175.62,-241.25 122.12,-241.25 122.12,-222 175.62,-222 175.62,-241.25"/>
-<text text-anchor="middle" x="148.88" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.79,-185.53C37.6,-194.2 53,-206.51 68.5,-213.62 81.74,-219.71 97.2,-223.81 110.93,-226.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.03,-229.93 120.49,-228.26 111.26,-223.04 110.03,-229.93"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb" target="_top" xlink:title="surface area of a hemi&#45;sphere ( 3 * pi * r^2)">
-<polygon fill="white" stroke="#666666" points="229.25,-204.25 68.5,-204.25 68.5,-185 229.25,-185 229.25,-204.25"/>
-<text text-anchor="middle" x="148.88" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::hemi_sphere_surface_area</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge8_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.75,-177.88C41.83,-179.2 54.07,-180.98 67.19,-182.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.48,-186.32 76.88,-184.3 67.48,-179.39 66.48,-186.32"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f" target="_top" xlink:title="area of a parallelogram (b * h)">
-<polygon fill="white" stroke="#666666" points="211.62,-167.25 86.12,-167.25 86.12,-148 211.62,-148 211.62,-167.25"/>
-<text text-anchor="middle" x="148.88" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::parallelogram_area</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.75,-173.49C43.56,-172 58.87,-169.89 74.8,-167.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.95,-171.21 84.38,-166.37 74,-164.27 74.95,-171.21"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca" target="_top" xlink:title="area of a rectangle (l * w)">
-<polygon fill="white" stroke="#666666" points="191,-130.25 106.75,-130.25 106.75,-111 191,-111 191,-130.25"/>
-<text text-anchor="middle" x="148.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::rect_area</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge11_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.23,-165.67C38.08,-157.25 53.3,-145.49 68.5,-138.62 76.92,-134.82 86.22,-131.79 95.4,-129.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.09,-132.81 105,-127.09 94.46,-126 96.09,-132.81"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656" target="_top" xlink:title="surface area of a sphere ( 4 * pi * r^2)">
-<polygon fill="white" stroke="#666666" points="216.12,-93.25 81.62,-93.25 81.62,-74 216.12,-74 216.12,-93.25"/>
-<text text-anchor="middle" x="148.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sphere_surface_area</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge12_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge12_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.25,-165.7C28.27,-149.59 44.41,-117.89 68.5,-101.62 70.11,-100.54 71.78,-99.51 73.49,-98.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.82,-101.8 82.34,-94.34 71.81,-95.48 74.82,-101.8"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049" target="_top" xlink:title="area of a square (l * l)">
-<polygon fill="white" stroke="#666666" points="197.38,-56.25 100.38,-56.25 100.38,-37 197.38,-37 197.38,-56.25"/>
-<text text-anchor="middle" x="148.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::square_area</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge13_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge13_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M18.86,-165.52C22.91,-143.53 35.67,-91.21 68.5,-64.62 74.62,-59.67 81.84,-56.02 89.39,-53.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.13,-56.77 98.74,-50.59 88.16,-50.05 90.13,-56.77"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc" target="_top" xlink:title="area of a triangle (b * h / 2)">
-<polygon fill="white" stroke="#666666" points="198.5,-19.25 99.25,-19.25 99.25,0 198.5,0 198.5,-19.25"/>
-<text text-anchor="middle" x="148.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::triangle_area</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node13 -->
-<g id="edge14_Node000001_Node000013" class="edge">
-<title>Node1&#45;&gt;Node13</title>
-<g id="a_edge14_Node000001_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M17.56,-165.56C18.94,-138.76 26.57,-65.17 68.5,-27.62 74.09,-22.62 80.78,-18.91 87.87,-16.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.91,-19.53 97.41,-13.21 86.82,-12.85 88.91,-19.53"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="307.5,-167.25 265.25,-167.25 265.25,-148 307.5,-148 307.5,-167.25"/>
-<text text-anchor="middle" x="286.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M215.05,-258.54C220.09,-256.38 224.9,-253.77 229.25,-250.62 254.28,-232.55 270.24,-199.57 278.51,-178.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.7,-179.6 281.8,-169 275.11,-177.22 281.7,-179.6"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M273.19,-167.54C267.17,-176.15 271.57,-185.25 286.38,-185.25 294.47,-185.25 299.46,-182.53 301.33,-178.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.83,-178.36 299.8,-169.03 297.91,-179.46 304.83,-178.36"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.75,-167.25 343.5,-167.25 343.5,-148 397.75,-148 397.75,-167.25"/>
-<text text-anchor="middle" x="370.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.71,-157.62C314.95,-157.62 323.36,-157.62 331.6,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.49,-161.13 341.49,-157.63 331.49,-154.13 331.49,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge10_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge10_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M212.07,-157.62C226.52,-157.62 241.3,-157.62 253.78,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.43,-161.13 263.43,-157.63 253.43,-154.13 253.43,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node5 -->
-<g id="edge15_Node000013_Node000005" class="edge">
-<title>Node13&#45;&gt;Node5</title>
-<g id="a_edge15_Node000013_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M198.92,-13.31C209.82,-16.05 220.66,-20.49 229.25,-27.62 262.85,-55.54 276.85,-107.34 282.27,-136.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.8,-136.9 283.89,-146.19 285.7,-135.75 278.8,-136.9"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 04139022c..000000000
--- a/dc/d82/area_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,264 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="406pt" height="360pt"
- viewBox="0.00 0.00 405.75 360.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 356.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-185.25 0,-185.25 0,-166 32.5,-166 32.5,-185.25"/>
-<text text-anchor="middle" x="16.25" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75" target="_top" xlink:title="area of a circle (pi">
-<polygon fill="white" stroke="#666666" points="194.38,-352.25 103.38,-352.25 103.38,-333 194.38,-333 194.38,-352.25"/>
-<text text-anchor="middle" x="148.88" y="-338.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::circle_area</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M17.51,-185.37C18.78,-212.01 26.15,-286.63 68.5,-324.62 75.16,-330.6 83.37,-334.72 91.97,-337.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.95,-340.88 101.51,-340.06 92.74,-334.12 90.95,-340.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c" target="_top" xlink:title="surface area of a cube ( 6 * (l">
-<polygon fill="white" stroke="#666666" points="212,-315.25 85.75,-315.25 85.75,-296 212,-296 212,-315.25"/>
-<text text-anchor="middle" x="148.88" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cube_surface_area</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M18.77,-185.49C22.7,-207.47 35.31,-260.66 68.5,-287.62 70.63,-289.35 72.89,-290.92 75.25,-292.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.59,-295.43 84.1,-296.76 76.71,-289.17 73.59,-295.43"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864" target="_top" xlink:title="surface area of a cylinder (2 * pi * r * h + 2 * pi * r^2)">
-<polygon fill="white" stroke="#666666" points="218.38,-278.25 79.38,-278.25 79.38,-259 218.38,-259 218.38,-278.25"/>
-<text text-anchor="middle" x="148.88" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cylinder_surface_area</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.21,-185.68C28.18,-202.01 44.24,-234.13 68.5,-250.62 70.11,-251.72 71.77,-252.74 73.48,-253.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.79,-256.78 82.32,-257.94 74.81,-250.47 71.79,-256.78"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="175.62,-241.25 122.12,-241.25 122.12,-222 175.62,-222 175.62,-241.25"/>
-<text text-anchor="middle" x="148.88" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.79,-185.53C37.6,-194.2 53,-206.51 68.5,-213.62 81.74,-219.71 97.2,-223.81 110.93,-226.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.03,-229.93 120.49,-228.26 111.26,-223.04 110.03,-229.93"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb" target="_top" xlink:title="surface area of a hemi&#45;sphere ( 3 * pi * r^2)">
-<polygon fill="white" stroke="#666666" points="229.25,-204.25 68.5,-204.25 68.5,-185 229.25,-185 229.25,-204.25"/>
-<text text-anchor="middle" x="148.88" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::hemi_sphere_surface_area</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge8_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.75,-177.88C41.83,-179.2 54.07,-180.98 67.19,-182.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.48,-186.32 76.88,-184.3 67.48,-179.39 66.48,-186.32"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f" target="_top" xlink:title="area of a parallelogram (b * h)">
-<polygon fill="white" stroke="#666666" points="211.62,-167.25 86.12,-167.25 86.12,-148 211.62,-148 211.62,-167.25"/>
-<text text-anchor="middle" x="148.88" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::parallelogram_area</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.75,-173.49C43.56,-172 58.87,-169.89 74.8,-167.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.95,-171.21 84.38,-166.37 74,-164.27 74.95,-171.21"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca" target="_top" xlink:title="area of a rectangle (l * w)">
-<polygon fill="white" stroke="#666666" points="191,-130.25 106.75,-130.25 106.75,-111 191,-111 191,-130.25"/>
-<text text-anchor="middle" x="148.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::rect_area</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge11_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.23,-165.67C38.08,-157.25 53.3,-145.49 68.5,-138.62 76.92,-134.82 86.22,-131.79 95.4,-129.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.09,-132.81 105,-127.09 94.46,-126 96.09,-132.81"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656" target="_top" xlink:title="surface area of a sphere ( 4 * pi * r^2)">
-<polygon fill="white" stroke="#666666" points="216.12,-93.25 81.62,-93.25 81.62,-74 216.12,-74 216.12,-93.25"/>
-<text text-anchor="middle" x="148.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sphere_surface_area</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge12_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge12_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M21.25,-165.7C28.27,-149.59 44.41,-117.89 68.5,-101.62 70.11,-100.54 71.78,-99.51 73.49,-98.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.82,-101.8 82.34,-94.34 71.81,-95.48 74.82,-101.8"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049" target="_top" xlink:title="area of a square (l * l)">
-<polygon fill="white" stroke="#666666" points="197.38,-56.25 100.38,-56.25 100.38,-37 197.38,-37 197.38,-56.25"/>
-<text text-anchor="middle" x="148.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::square_area</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge13_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge13_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M18.86,-165.52C22.91,-143.53 35.67,-91.21 68.5,-64.62 74.62,-59.67 81.84,-56.02 89.39,-53.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.13,-56.77 98.74,-50.59 88.16,-50.05 90.13,-56.77"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc" target="_top" xlink:title="area of a triangle (b * h / 2)">
-<polygon fill="white" stroke="#666666" points="198.5,-19.25 99.25,-19.25 99.25,0 198.5,0 198.5,-19.25"/>
-<text text-anchor="middle" x="148.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::triangle_area</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node13 -->
-<g id="edge14_Node000001_Node000013" class="edge">
-<title>Node1&#45;&gt;Node13</title>
-<g id="a_edge14_Node000001_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M17.56,-165.56C18.94,-138.76 26.57,-65.17 68.5,-27.62 74.09,-22.62 80.78,-18.91 87.87,-16.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.91,-19.53 97.41,-13.21 86.82,-12.85 88.91,-19.53"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="307.5,-167.25 265.25,-167.25 265.25,-148 307.5,-148 307.5,-167.25"/>
-<text text-anchor="middle" x="286.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M215.05,-258.54C220.09,-256.38 224.9,-253.77 229.25,-250.62 254.28,-232.55 270.24,-199.57 278.51,-178.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.7,-179.6 281.8,-169 275.11,-177.22 281.7,-179.6"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M273.19,-167.54C267.17,-176.15 271.57,-185.25 286.38,-185.25 294.47,-185.25 299.46,-182.53 301.33,-178.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.83,-178.36 299.8,-169.03 297.91,-179.46 304.83,-178.36"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.75,-167.25 343.5,-167.25 343.5,-148 397.75,-148 397.75,-167.25"/>
-<text text-anchor="middle" x="370.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge6_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge6_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M307.71,-157.62C314.95,-157.62 323.36,-157.62 331.6,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.49,-161.13 341.49,-157.63 331.49,-154.13 331.49,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge10_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge10_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M212.07,-157.62C226.52,-157.62 241.3,-157.62 253.78,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="253.43,-161.13 263.43,-157.63 253.43,-154.13 253.43,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node5 -->
-<g id="edge15_Node000013_Node000005" class="edge">
-<title>Node13&#45;&gt;Node5</title>
-<g id="a_edge15_Node000013_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M198.92,-13.31C209.82,-16.05 220.66,-20.49 229.25,-27.62 262.85,-55.54 276.85,-107.34 282.27,-136.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.8,-136.9 283.89,-146.19 285.7,-135.75 278.8,-136.9"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d82/area_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/d82/area_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 6256f17c7..000000000
--- a/dc/d82/area_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,32 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,228,55,254"/>
-<area shape="rect" id="Node000002" href="$dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,228,146,254"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,238,87,238,87,244,55,244"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75" title="area of a circle (pi" alt="" coords="240,5,362,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="123,228,127,191,137,140,157,86,173,62,192,40,207,30,224,22,226,27,210,34,196,44,177,65,162,89,142,141,132,191,129,228"/>
-<area shape="rect" id="Node000004" href="$dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c" title="surface area of a cube ( 6 * (l" alt="" coords="217,55,385,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="125,227,131,198,144,161,163,122,192,90,201,83,205,87,196,93,168,125,149,163,137,200,130,228"/>
-<area shape="rect" id="Node000005" href="$dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864" title="surface area of a cylinder (2 * pi * r * h + 2 * pi * r^2)" alt="" coords="208,104,394,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="129,226,152,183,170,159,192,139,199,134,202,139,196,143,174,162,156,186,133,229"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="266,153,337,179"/>
-<area shape="poly" id="edge8_Node000002_Node000008" title=" " alt="" coords="138,226,162,206,193,188,250,170,251,175,195,193,166,210,141,230"/>
-<area shape="rect" id="Node000009" href="$dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb" title="surface area of a hemi&#45;sphere ( 3 * pi * r^2)" alt="" coords="194,203,408,228"/>
-<area shape="poly" id="edge9_Node000002_Node000009" title=" " alt="" coords="146,235,192,229,193,234,147,240"/>
-<area shape="rect" id="Node000010" href="$dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f" title="area of a parallelogram (b * h)" alt="" coords="218,252,385,278"/>
-<area shape="poly" id="edge10_Node000002_Node000010" title=" " alt="" coords="147,241,203,249,202,254,146,246"/>
-<area shape="rect" id="Node000011" href="$dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca" title="area of a rectangle (l * w)" alt="" coords="245,301,357,327"/>
-<area shape="poly" id="edge12_Node000002_Node000011" title=" " alt="" coords="142,252,166,271,195,288,231,300,229,305,193,293,163,275,139,256"/>
-<area shape="rect" id="Node000012" href="$dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656" title="surface area of a sphere ( 4 * pi * r^2)" alt="" coords="212,351,391,376"/>
-<area shape="poly" id="edge13_Node000002_Node000012" title=" " alt="" coords="133,253,156,295,174,318,196,337,202,341,199,346,192,342,170,322,152,298,129,255"/>
-<area shape="rect" id="Node000013" href="$dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049" title="area of a square (l * l)" alt="" coords="236,400,366,426"/>
-<area shape="poly" id="edge14_Node000002_Node000013" title=" " alt="" coords="130,254,137,282,149,318,168,355,196,387,223,402,221,406,192,391,164,358,144,320,132,283,125,255"/>
-<area shape="rect" id="Node000014" href="$dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc" title="area of a triangle (b * h / 2)" alt="" coords="235,449,367,475"/>
-<area shape="poly" id="edge15_Node000002_Node000014" title=" " alt="" coords="129,254,132,291,142,340,162,392,177,416,196,436,221,451,218,456,192,440,173,419,158,395,137,342,127,291,123,255"/>
-<area shape="rect" id="Node000006" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="456,252,513,278"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="391,128,410,139,433,160,452,186,476,236,472,239,447,189,429,164,407,143,388,133"/>
-<area shape="poly" id="edge6_Node000006_Node000006" title=" " alt="" coords="464,253,461,243,463,234,471,228,485,225,499,228,506,235,503,239,496,233,484,231,473,233,468,237,466,243,469,251"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="561,252,633,278"/>
-<area shape="poly" id="edge7_Node000006_Node000007" title=" " alt="" coords="513,262,545,262,545,268,513,268"/>
-<area shape="poly" id="edge11_Node000010_Node000006" title=" " alt="" coords="385,262,441,262,441,268,385,268"/>
-<area shape="poly" id="edge16_Node000014_Node000006" title=" " alt="" coords="367,455,388,447,407,436,435,404,455,365,469,326,476,293,482,294,474,328,460,367,439,407,410,440,390,452,369,460"/>
-</map>
diff --git a/dc/d82/area_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/d82/area_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 5ad2fa7f8..000000000
--- a/dc/d82/area_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4a744117c6941c5796e6d1ca5cf59e82
\ No newline at end of file
diff --git a/dc/d82/area_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/d82/area_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index abf27df6a..000000000
--- a/dc/d82/area_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,308 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="479pt" height="360pt"
- viewBox="0.00 0.00 478.75 360.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 356.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-185.25 0,-185.25 0,-166 37,-166 37,-185.25"/>
-<text text-anchor="middle" x="18.5" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-185.25 73,-185.25 73,-166 105.5,-166 105.5,-185.25"/>
-<text text-anchor="middle" x="89.25" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-175.62C44.58,-175.62 53.31,-175.62 61.45,-175.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-179.13 71.2,-175.63 61.2,-172.13 61.2,-179.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75" target="_top" xlink:title="area of a circle (pi">
-<polygon fill="white" stroke="#666666" points="267.38,-352.25 176.38,-352.25 176.38,-333 267.38,-333 267.38,-352.25"/>
-<text text-anchor="middle" x="221.88" y="-338.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::circle_area</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.51,-185.37C91.78,-212.01 99.15,-286.63 141.5,-324.62 148.16,-330.6 156.37,-334.72 164.97,-337.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.95,-340.88 174.51,-340.06 165.74,-334.12 163.95,-340.88"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c" target="_top" xlink:title="surface area of a cube ( 6 * (l">
-<polygon fill="white" stroke="#666666" points="285,-315.25 158.75,-315.25 158.75,-296 285,-296 285,-315.25"/>
-<text text-anchor="middle" x="221.88" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cube_surface_area</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.77,-185.49C95.7,-207.47 108.31,-260.66 141.5,-287.62 143.63,-289.35 145.89,-290.92 148.25,-292.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.59,-295.43 157.1,-296.76 149.71,-289.17 146.59,-295.43"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864" target="_top" xlink:title="surface area of a cylinder (2 * pi * r * h + 2 * pi * r^2)">
-<polygon fill="white" stroke="#666666" points="291.38,-278.25 152.38,-278.25 152.38,-259 291.38,-259 291.38,-278.25"/>
-<text text-anchor="middle" x="221.88" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cylinder_surface_area</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.21,-185.68C101.18,-202.01 117.24,-234.13 141.5,-250.62 143.11,-251.72 144.77,-252.74 146.48,-253.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.79,-256.78 155.32,-257.94 147.81,-250.47 144.79,-256.78"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.62,-241.25 195.12,-241.25 195.12,-222 248.62,-222 248.62,-241.25"/>
-<text text-anchor="middle" x="221.88" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge8_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge8_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.79,-185.53C110.6,-194.2 126,-206.51 141.5,-213.62 154.74,-219.71 170.2,-223.81 183.93,-226.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.03,-229.93 193.49,-228.26 184.26,-223.04 183.03,-229.93"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb" target="_top" xlink:title="surface area of a hemi&#45;sphere ( 3 * pi * r^2)">
-<polygon fill="white" stroke="#666666" points="302.25,-204.25 141.5,-204.25 141.5,-185 302.25,-185 302.25,-204.25"/>
-<text text-anchor="middle" x="221.88" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::hemi_sphere_surface_area</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge9_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge9_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.75,-177.88C114.83,-179.2 127.07,-180.98 140.19,-182.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.48,-186.32 149.88,-184.3 140.48,-179.39 139.48,-186.32"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f" target="_top" xlink:title="area of a parallelogram (b * h)">
-<polygon fill="white" stroke="#666666" points="284.62,-167.25 159.12,-167.25 159.12,-148 284.62,-148 284.62,-167.25"/>
-<text text-anchor="middle" x="221.88" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::parallelogram_area</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge10_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge10_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.75,-173.49C116.56,-172 131.87,-169.89 147.8,-167.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.95,-171.21 157.38,-166.37 147,-164.27 147.95,-171.21"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca" target="_top" xlink:title="area of a rectangle (l * w)">
-<polygon fill="white" stroke="#666666" points="264,-130.25 179.75,-130.25 179.75,-111 264,-111 264,-130.25"/>
-<text text-anchor="middle" x="221.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::rect_area</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge12_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge12_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.23,-165.67C111.08,-157.25 126.3,-145.49 141.5,-138.62 149.92,-134.82 159.22,-131.79 168.4,-129.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.09,-132.81 178,-127.09 167.46,-126 169.09,-132.81"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656" target="_top" xlink:title="surface area of a sphere ( 4 * pi * r^2)">
-<polygon fill="white" stroke="#666666" points="289.12,-93.25 154.62,-93.25 154.62,-74 289.12,-74 289.12,-93.25"/>
-<text text-anchor="middle" x="221.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sphere_surface_area</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge13_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge13_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.25,-165.7C101.27,-149.59 117.41,-117.89 141.5,-101.62 143.11,-100.54 144.78,-99.51 146.49,-98.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.82,-101.8 155.34,-94.34 144.81,-95.48 147.82,-101.8"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049" target="_top" xlink:title="area of a square (l * l)">
-<polygon fill="white" stroke="#666666" points="270.38,-56.25 173.38,-56.25 173.38,-37 270.38,-37 270.38,-56.25"/>
-<text text-anchor="middle" x="221.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::square_area</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node13 -->
-<g id="edge14_Node000002_Node000013" class="edge">
-<title>Node2&#45;&gt;Node13</title>
-<g id="a_edge14_Node000002_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.86,-165.52C95.91,-143.53 108.67,-91.21 141.5,-64.62 147.62,-59.67 154.84,-56.02 162.39,-53.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.13,-56.77 171.74,-50.59 161.16,-50.05 163.13,-56.77"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc" target="_top" xlink:title="area of a triangle (b * h / 2)">
-<polygon fill="white" stroke="#666666" points="271.5,-19.25 172.25,-19.25 172.25,0 271.5,0 271.5,-19.25"/>
-<text text-anchor="middle" x="221.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::triangle_area</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node14 -->
-<g id="edge15_Node000002_Node000014" class="edge">
-<title>Node2&#45;&gt;Node14</title>
-<g id="a_edge15_Node000002_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.56,-165.56C91.94,-138.76 99.57,-65.17 141.5,-27.62 147.09,-22.62 153.78,-18.91 160.87,-16.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.91,-19.53 170.41,-13.21 159.82,-12.85 161.91,-19.53"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="380.5,-167.25 338.25,-167.25 338.25,-148 380.5,-148 380.5,-167.25"/>
-<text text-anchor="middle" x="359.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M288.05,-258.54C293.09,-256.38 297.9,-253.77 302.25,-250.62 327.28,-232.55 343.24,-199.57 351.51,-178.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="354.7,-179.6 354.8,-169 348.11,-177.22 354.7,-179.6"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M346.19,-167.54C340.17,-176.15 344.57,-185.25 359.38,-185.25 367.47,-185.25 372.46,-182.53 374.33,-178.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="377.83,-178.36 372.8,-169.03 370.91,-179.46 377.83,-178.36"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="470.75,-167.25 416.5,-167.25 416.5,-148 470.75,-148 470.75,-167.25"/>
-<text text-anchor="middle" x="443.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.71,-157.62C387.95,-157.62 396.36,-157.62 404.6,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.49,-161.13 414.49,-157.63 404.49,-154.13 404.49,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node6 -->
-<g id="edge11_Node000010_Node000006" class="edge">
-<title>Node10&#45;&gt;Node6</title>
-<g id="a_edge11_Node000010_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.07,-157.62C299.52,-157.62 314.3,-157.62 326.78,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.43,-161.13 336.43,-157.63 326.43,-154.13 326.43,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node6 -->
-<g id="edge16_Node000014_Node000006" class="edge">
-<title>Node14&#45;&gt;Node6</title>
-<g id="a_edge16_Node000014_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M271.92,-13.31C282.82,-16.05 293.66,-20.49 302.25,-27.62 335.85,-55.54 349.85,-107.34 355.27,-136.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="351.8,-136.9 356.89,-146.19 358.7,-135.75 351.8,-136.9"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d82/area_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dc/d82/area_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 35c7dd4ce..000000000
--- a/dc/d82/area_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,282 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="479pt" height="360pt"
- viewBox="0.00 0.00 478.75 360.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 356.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-185.25 0,-185.25 0,-166 37,-166 37,-185.25"/>
-<text text-anchor="middle" x="18.5" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-185.25 73,-185.25 73,-166 105.5,-166 105.5,-185.25"/>
-<text text-anchor="middle" x="89.25" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-175.62C44.58,-175.62 53.31,-175.62 61.45,-175.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-179.13 71.2,-175.63 61.2,-172.13 61.2,-179.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75" target="_top" xlink:title="area of a circle (pi">
-<polygon fill="white" stroke="#666666" points="267.38,-352.25 176.38,-352.25 176.38,-333 267.38,-333 267.38,-352.25"/>
-<text text-anchor="middle" x="221.88" y="-338.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::circle_area</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.51,-185.37C91.78,-212.01 99.15,-286.63 141.5,-324.62 148.16,-330.6 156.37,-334.72 164.97,-337.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.95,-340.88 174.51,-340.06 165.74,-334.12 163.95,-340.88"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c" target="_top" xlink:title="surface area of a cube ( 6 * (l">
-<polygon fill="white" stroke="#666666" points="285,-315.25 158.75,-315.25 158.75,-296 285,-296 285,-315.25"/>
-<text text-anchor="middle" x="221.88" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cube_surface_area</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.77,-185.49C95.7,-207.47 108.31,-260.66 141.5,-287.62 143.63,-289.35 145.89,-290.92 148.25,-292.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.59,-295.43 157.1,-296.76 149.71,-289.17 146.59,-295.43"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864" target="_top" xlink:title="surface area of a cylinder (2 * pi * r * h + 2 * pi * r^2)">
-<polygon fill="white" stroke="#666666" points="291.38,-278.25 152.38,-278.25 152.38,-259 291.38,-259 291.38,-278.25"/>
-<text text-anchor="middle" x="221.88" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cylinder_surface_area</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.21,-185.68C101.18,-202.01 117.24,-234.13 141.5,-250.62 143.11,-251.72 144.77,-252.74 146.48,-253.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.79,-256.78 155.32,-257.94 147.81,-250.47 144.79,-256.78"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.62,-241.25 195.12,-241.25 195.12,-222 248.62,-222 248.62,-241.25"/>
-<text text-anchor="middle" x="221.88" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge8_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge8_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.79,-185.53C110.6,-194.2 126,-206.51 141.5,-213.62 154.74,-219.71 170.2,-223.81 183.93,-226.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.03,-229.93 193.49,-228.26 184.26,-223.04 183.03,-229.93"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb" target="_top" xlink:title="surface area of a hemi&#45;sphere ( 3 * pi * r^2)">
-<polygon fill="white" stroke="#666666" points="302.25,-204.25 141.5,-204.25 141.5,-185 302.25,-185 302.25,-204.25"/>
-<text text-anchor="middle" x="221.88" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::hemi_sphere_surface_area</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge9_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge9_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.75,-177.88C114.83,-179.2 127.07,-180.98 140.19,-182.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.48,-186.32 149.88,-184.3 140.48,-179.39 139.48,-186.32"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f" target="_top" xlink:title="area of a parallelogram (b * h)">
-<polygon fill="white" stroke="#666666" points="284.62,-167.25 159.12,-167.25 159.12,-148 284.62,-148 284.62,-167.25"/>
-<text text-anchor="middle" x="221.88" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::parallelogram_area</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge10_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge10_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.75,-173.49C116.56,-172 131.87,-169.89 147.8,-167.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.95,-171.21 157.38,-166.37 147,-164.27 147.95,-171.21"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca" target="_top" xlink:title="area of a rectangle (l * w)">
-<polygon fill="white" stroke="#666666" points="264,-130.25 179.75,-130.25 179.75,-111 264,-111 264,-130.25"/>
-<text text-anchor="middle" x="221.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::rect_area</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge12_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge12_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.23,-165.67C111.08,-157.25 126.3,-145.49 141.5,-138.62 149.92,-134.82 159.22,-131.79 168.4,-129.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.09,-132.81 178,-127.09 167.46,-126 169.09,-132.81"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656" target="_top" xlink:title="surface area of a sphere ( 4 * pi * r^2)">
-<polygon fill="white" stroke="#666666" points="289.12,-93.25 154.62,-93.25 154.62,-74 289.12,-74 289.12,-93.25"/>
-<text text-anchor="middle" x="221.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sphere_surface_area</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge13_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge13_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M94.25,-165.7C101.27,-149.59 117.41,-117.89 141.5,-101.62 143.11,-100.54 144.78,-99.51 146.49,-98.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.82,-101.8 155.34,-94.34 144.81,-95.48 147.82,-101.8"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049" target="_top" xlink:title="area of a square (l * l)">
-<polygon fill="white" stroke="#666666" points="270.38,-56.25 173.38,-56.25 173.38,-37 270.38,-37 270.38,-56.25"/>
-<text text-anchor="middle" x="221.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::square_area</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node13 -->
-<g id="edge14_Node000002_Node000013" class="edge">
-<title>Node2&#45;&gt;Node13</title>
-<g id="a_edge14_Node000002_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.86,-165.52C95.91,-143.53 108.67,-91.21 141.5,-64.62 147.62,-59.67 154.84,-56.02 162.39,-53.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.13,-56.77 171.74,-50.59 161.16,-50.05 163.13,-56.77"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc" target="_top" xlink:title="area of a triangle (b * h / 2)">
-<polygon fill="white" stroke="#666666" points="271.5,-19.25 172.25,-19.25 172.25,0 271.5,0 271.5,-19.25"/>
-<text text-anchor="middle" x="221.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::triangle_area</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node14 -->
-<g id="edge15_Node000002_Node000014" class="edge">
-<title>Node2&#45;&gt;Node14</title>
-<g id="a_edge15_Node000002_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.56,-165.56C91.94,-138.76 99.57,-65.17 141.5,-27.62 147.09,-22.62 153.78,-18.91 160.87,-16.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.91,-19.53 170.41,-13.21 159.82,-12.85 161.91,-19.53"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="380.5,-167.25 338.25,-167.25 338.25,-148 380.5,-148 380.5,-167.25"/>
-<text text-anchor="middle" x="359.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M288.05,-258.54C293.09,-256.38 297.9,-253.77 302.25,-250.62 327.28,-232.55 343.24,-199.57 351.51,-178.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="354.7,-179.6 354.8,-169 348.11,-177.22 354.7,-179.6"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M346.19,-167.54C340.17,-176.15 344.57,-185.25 359.38,-185.25 367.47,-185.25 372.46,-182.53 374.33,-178.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="377.83,-178.36 372.8,-169.03 370.91,-179.46 377.83,-178.36"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="470.75,-167.25 416.5,-167.25 416.5,-148 470.75,-148 470.75,-167.25"/>
-<text text-anchor="middle" x="443.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge7_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge7_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M380.71,-157.62C387.95,-157.62 396.36,-157.62 404.6,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="404.49,-161.13 414.49,-157.63 404.49,-154.13 404.49,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node6 -->
-<g id="edge11_Node000010_Node000006" class="edge">
-<title>Node10&#45;&gt;Node6</title>
-<g id="a_edge11_Node000010_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M285.07,-157.62C299.52,-157.62 314.3,-157.62 326.78,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.43,-161.13 336.43,-157.63 326.43,-154.13 326.43,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node6 -->
-<g id="edge16_Node000014_Node000006" class="edge">
-<title>Node14&#45;&gt;Node6</title>
-<g id="a_edge16_Node000014_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M271.92,-13.31C282.82,-16.05 293.66,-20.49 302.25,-27.62 335.85,-55.54 349.85,-107.34 355.27,-136.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="351.8,-136.9 356.89,-146.19 358.7,-135.75 351.8,-136.9"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d82/area_8cpp_source.html b/dc/d82/area_8cpp_source.html
new file mode 100644
index 000000000..7d575c9a9
--- /dev/null
+++ b/dc/d82/area_8cpp_source.html
@@ -0,0 +1,397 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/area.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dc/d82/area_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">area.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dc/d82/area_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#define _USE_MATH_DEFINES</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cassert&gt;</span>  </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cmath&gt;</span>    </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cstdint&gt;</span>   </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00029" data-start="{" data-end="}">
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049">   29</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049">square_area</a>(T length) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">return</span> length * length;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>}</div>
+</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00040" data-start="{" data-end="}">
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca">   40</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca">rect_area</a>(T length, T width) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">return</span> length * width;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>}</div>
+</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00052" data-start="{" data-end="}">
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc">   52</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc">triangle_area</a>(T base, T <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">return</span> base * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> / 2;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>}</div>
+</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00063" data-start="{" data-end="}">
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75">   63</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75">circle_area</a>(T radius) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="keywordflow">return</span> M_PI * pow(radius, 2);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>}</div>
+</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00075" data-start="{" data-end="}">
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f">   75</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f">parallelogram_area</a>(T base, T <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keywordflow">return</span> base * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>}</div>
+</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00086" data-start="{" data-end="}">
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c">   86</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c">cube_surface_area</a>(T length) {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="keywordflow">return</span> 6 * length * length;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>}</div>
+</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00097" data-start="{" data-end="}">
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656">   97</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656">sphere_surface_area</a>(T radius) {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keywordflow">return</span> 4 * M_PI * pow(radius, 2);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>}</div>
+</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00109" data-start="{" data-end="}">
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864">  109</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864">cylinder_surface_area</a>(T radius, T <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordflow">return</span> 2 * M_PI * radius * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> + 2 * M_PI * pow(radius, 2);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>}</div>
+</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00121" data-start="{" data-end="}">
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb">  121</a></span>T <a class="code hl_function" href="../../dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb">hemi_sphere_surface_area</a>(T radius) {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="keywordflow">return</span> 3 * M_PI * pow(radius, 2);</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>}</div>
+</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
+<div class="foldopen" id="foldopen00130" data-start="{" data-end="}">
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"><a class="line" href="../../dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  130</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <span class="comment">// I/O variables for testing</span></div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    uint16_t int_length = 0;    <span class="comment">// 16 bit integer length input</span></div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    uint16_t int_width = 0;     <span class="comment">// 16 bit integer width input</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    uint16_t int_base = 0;      <span class="comment">// 16 bit integer base input</span></div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    uint16_t int_height = 0;    <span class="comment">// 16 bit integer height input</span></div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    uint16_t int_expected = 0;  <span class="comment">// 16 bit integer expected output</span></div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    uint16_t int_area = 0;      <span class="comment">// 16 bit integer output</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <span class="keywordtype">float</span> float_length = NAN;    <span class="comment">// float length input</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="keywordtype">float</span> float_expected = NAN;  <span class="comment">// float expected output</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <span class="keywordtype">float</span> float_area = NAN;      <span class="comment">// float output</span></div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span> </div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <span class="keywordtype">double</span> double_length = NAN;    <span class="comment">// double length input</span></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <span class="keywordtype">double</span> double_width = NAN;     <span class="comment">// double width input</span></div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <span class="keywordtype">double</span> double_radius = NAN;    <span class="comment">// double radius input</span></div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    <span class="keywordtype">double</span> double_height = NAN;    <span class="comment">// double height input</span></div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    <span class="keywordtype">double</span> double_expected = NAN;  <span class="comment">// double expected output</span></div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    <span class="keywordtype">double</span> double_area = NAN;      <span class="comment">// double output</span></div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span> </div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    <span class="comment">// 1st test</span></div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    int_length = 5;</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    int_expected = 25;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    int_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049">math::square_area</a>(int_length);</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span> </div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;AREA OF A SQUARE (int)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_area &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    assert(int_area == int_expected);</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span> </div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    <span class="comment">// 2nd test</span></div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    float_length = 2.5;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    float_expected = 6.25;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    float_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049">math::square_area</a>(float_length);</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span> </div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;AREA OF A SQUARE (float)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; float_length &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; float_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; float_area &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    assert(float_area == float_expected);</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span> </div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    <span class="comment">// 3rd test</span></div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    int_length = 4;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    int_width = 7;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    int_expected = 28;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    int_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca">math::rect_area</a>(int_length, int_width);</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span> </div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;AREA OF A RECTANGLE (int)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; int_length &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Width: &quot;</span> &lt;&lt; int_width &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_area &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    assert(int_area == int_expected);</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span> </div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    <span class="comment">// 4th test</span></div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    double_length = 2.5;</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    double_width = 5.7;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    double_expected = 14.25;</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    double_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca">math::rect_area</a>(double_length, double_width);</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span> </div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;AREA OF A RECTANGLE (double)&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; double_length &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Width: &quot;</span> &lt;&lt; double_width &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_area &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    assert(double_area == double_expected);</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span> </div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    <span class="comment">// 5th test</span></div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    int_base = 10;</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    int_height = 3;</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    int_expected = 15;</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    int_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc">math::triangle_area</a>(int_base, int_height);</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span> </div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;AREA OF A TRIANGLE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Base: &quot;</span> &lt;&lt; int_base &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_area &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    assert(int_area == int_expected);</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span> </div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    <span class="comment">// 6th test</span></div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    double_radius = 6;</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    double_expected =</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>        113.09733552923255;  <span class="comment">// rounded down because the double datatype</span></div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>                             <span class="comment">// truncates after 14 decimal places</span></div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    double_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75">math::circle_area</a>(double_radius);</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span> </div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;AREA OF A CIRCLE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_area &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    assert(double_area == double_expected);</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span> </div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    <span class="comment">// 7th test</span></div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    int_base = 6;</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    int_height = 7;</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    int_expected = 42;</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    int_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f">math::parallelogram_area</a>(int_base, int_height);</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span> </div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;AREA OF A PARALLELOGRAM&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Base: &quot;</span> &lt;&lt; int_base &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; int_height &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; int_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; int_area &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    assert(int_area == int_expected);</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span> </div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    <span class="comment">// 8th test</span></div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    double_length = 5.5;</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    double_expected = 181.5;</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    double_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c">math::cube_surface_area</a>(double_length);</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span> </div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;SURFACE AREA OF A CUBE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Length: &quot;</span> &lt;&lt; double_length &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_area &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    assert(double_area == double_expected);</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span> </div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    <span class="comment">// 9th test</span></div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    double_radius = 10.0;</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    double_expected = 1256.6370614359172;  <span class="comment">// rounded down because the whole</span></div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>                                           <span class="comment">// value gets truncated</span></div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>    double_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656">math::sphere_surface_area</a>(double_radius);</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span> </div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;SURFACE AREA OF A SPHERE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_area &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>    assert(double_area == double_expected);</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span> </div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>    <span class="comment">// 10th test</span></div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    double_radius = 4.0;</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    double_height = 7.0;</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    double_expected = 276.46015351590177;</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>    double_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864">math::cylinder_surface_area</a>(double_radius, double_height);</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span> </div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;SURFACE AREA OF A CYLINDER&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Height: &quot;</span> &lt;&lt; double_height &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_area &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>    assert(double_area == double_expected);</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span> </div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    <span class="comment">// 11th test</span></div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>    double_radius = 10.0;</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>    double_expected = 942.4777960769379;</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>    double_area = <a class="code hl_function" href="../../dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb">math::hemi_sphere_surface_area</a>(double_radius);</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span> </div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;SURFACE AREA OF A HEMI-SPHERE&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input Radius: &quot;</span> &lt;&lt; double_radius &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected Output: &quot;</span> &lt;&lt; double_expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; double_area &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>    assert(double_area == double_expected);</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span> &lt;&lt; std::endl &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>}</div>
+</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span> </div>
+<div class="foldopen" id="foldopen00300" data-start="{" data-end="}">
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"><a class="line" href="../../dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  300</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>    <a class="code hl_function" href="../../dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>}</div>
+</div>
+<div class="ttc" id="aarea_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/d82/area_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> <a href="#l00130">area.cpp:130</a></div></div>
+<div class="ttc" id="aarea_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00300">area.cpp:300</a></div></div>
+<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00038">avltree.cpp:38</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_a3277e65a8f380e7632791975bfba0efb"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb">math::hemi_sphere_surface_area</a></div><div class="ttdeci">T hemi_sphere_surface_area(T radius)</div><div class="ttdoc">surface area of a hemi-sphere ( 3 * pi * r^2)</div><div class="ttdef"><b>Definition</b> <a href="#l00121">area.cpp:121</a></div></div>
+<div class="ttc" id="anamespacemath_html_a40e36c67da78d2131408c57ee091ad75"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75">math::circle_area</a></div><div class="ttdeci">T circle_area(T radius)</div><div class="ttdoc">area of a circle (pi</div><div class="ttdef"><b>Definition</b> <a href="#l00063">area.cpp:63</a></div></div>
+<div class="ttc" id="anamespacemath_html_a5de184925e68658f15415dd53954df4f"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f">math::parallelogram_area</a></div><div class="ttdeci">T parallelogram_area(T base, T height)</div><div class="ttdoc">area of a parallelogram (b * h)</div><div class="ttdef"><b>Definition</b> <a href="#l00075">area.cpp:75</a></div></div>
+<div class="ttc" id="anamespacemath_html_a971ce57e368f2f631cf1f4ff3f864049"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049">math::square_area</a></div><div class="ttdeci">T square_area(T length)</div><div class="ttdoc">area of a square (l * l)</div><div class="ttdef"><b>Definition</b> <a href="#l00029">area.cpp:29</a></div></div>
+<div class="ttc" id="anamespacemath_html_ab31d141f7c5b551746b1eee0eb4dedca"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca">math::rect_area</a></div><div class="ttdeci">T rect_area(T length, T width)</div><div class="ttdoc">area of a rectangle (l * w)</div><div class="ttdef"><b>Definition</b> <a href="#l00040">area.cpp:40</a></div></div>
+<div class="ttc" id="anamespacemath_html_ab3b920cc56442abd92279ba23b50f4dc"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc">math::triangle_area</a></div><div class="ttdeci">T triangle_area(T base, T height)</div><div class="ttdoc">area of a triangle (b * h / 2)</div><div class="ttdef"><b>Definition</b> <a href="#l00052">area.cpp:52</a></div></div>
+<div class="ttc" id="anamespacemath_html_ab7f29862d30df351c317eedd60a0c656"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656">math::sphere_surface_area</a></div><div class="ttdeci">T sphere_surface_area(T radius)</div><div class="ttdoc">surface area of a sphere ( 4 * pi * r^2)</div><div class="ttdef"><b>Definition</b> <a href="#l00097">area.cpp:97</a></div></div>
+<div class="ttc" id="anamespacemath_html_abc46c784a297fc1d2eb8b33a327fba4c"><div class="ttname"><a href="../../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c">math::cube_surface_area</a></div><div class="ttdeci">T cube_surface_area(T length)</div><div class="ttdoc">surface area of a cube ( 6 * (l</div><div class="ttdef"><b>Definition</b> <a href="#l00086">area.cpp:86</a></div></div>
+<div class="ttc" id="anamespacemath_html_ac5803413618fcfb922cb32c6db0fc864"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864">math::cylinder_surface_area</a></div><div class="ttdeci">T cylinder_surface_area(T radius, T height)</div><div class="ttdoc">surface area of a cylinder (2 * pi * r * h + 2 * pi * r^2)</div><div class="ttdef"><b>Definition</b> <a href="#l00109">area.cpp:109</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../dc/d82/area_8cpp.html">area.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html b/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html
index e53ae4c53..9105a5630 100644
--- a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html
+++ b/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: machine_learning::neural_network::layers::DenseLayer Class Reference</title>
+<title>TheAlgorithms/C++: machine_learning::neural_network::layers::DenseLayer Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,9 +136,9 @@ Collaboration diagram for machine_learning::neural_network::layers::DenseLayer:<
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:a11046825be0b6dbb73fbe834aa49200e" id="r_a11046825be0b6dbb73fbe834aa49200e"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a11046825be0b6dbb73fbe834aa49200e">DenseLayer</a> (const int &amp;neurons, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;activation, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;kernel_shape, const bool &amp;random_kernel)</td></tr>
+<tr class="memitem:a11046825be0b6dbb73fbe834aa49200e" id="r_a11046825be0b6dbb73fbe834aa49200e"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a11046825be0b6dbb73fbe834aa49200e">DenseLayer</a> (const int &amp;neurons, const std::string &amp;activation, const std::pair&lt; size_t, size_t &gt; &amp;kernel_shape, const bool &amp;random_kernel)</td></tr>
 <tr class="separator:a11046825be0b6dbb73fbe834aa49200e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af136ec31dbd35b1be2eb9a057677c704" id="r_af136ec31dbd35b1be2eb9a057677c704"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af136ec31dbd35b1be2eb9a057677c704">DenseLayer</a> (const int &amp;neurons, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;activation, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;kernel)</td></tr>
+<tr class="memitem:af136ec31dbd35b1be2eb9a057677c704" id="r_af136ec31dbd35b1be2eb9a057677c704"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af136ec31dbd35b1be2eb9a057677c704">DenseLayer</a> (const int &amp;neurons, const std::string &amp;activation, const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;kernel)</td></tr>
 <tr class="separator:af136ec31dbd35b1be2eb9a057677c704"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a2871146feaaa453558239df67b21e0d2" id="r_a2871146feaaa453558239df67b21e0d2"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2871146feaaa453558239df67b21e0d2">DenseLayer</a> (const <a class="el" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">DenseLayer</a> &amp;layer)=default</td></tr>
 <tr class="separator:a2871146feaaa453558239df67b21e0d2"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -136,24 +153,21 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a8e4c57922478ccc2b7c6277c05608714" id="r_a8e4c57922478ccc2b7c6277c05608714"><td class="memItemLeft" align="right" valign="top"><a id="a8e4c57922478ccc2b7c6277c05608714" name="a8e4c57922478ccc2b7c6277c05608714"></a>
-double(*&#160;</td><td class="memItemRight" valign="bottom"><b>activation_function</b> )(const double &amp;)</td></tr>
+<tr class="memitem:a8e4c57922478ccc2b7c6277c05608714" id="r_a8e4c57922478ccc2b7c6277c05608714"><td class="memItemLeft" align="right" valign="top">double(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8e4c57922478ccc2b7c6277c05608714">activation_function</a> )(const double &amp;)</td></tr>
 <tr class="separator:a8e4c57922478ccc2b7c6277c05608714"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:acc6cfdcc9d6e5170340abae63234a442" id="r_acc6cfdcc9d6e5170340abae63234a442"><td class="memItemLeft" align="right" valign="top"><a id="acc6cfdcc9d6e5170340abae63234a442" name="acc6cfdcc9d6e5170340abae63234a442"></a>
-double(*&#160;</td><td class="memItemRight" valign="bottom"><b>dactivation_function</b> )(const double &amp;)</td></tr>
+<tr class="memitem:acc6cfdcc9d6e5170340abae63234a442" id="r_acc6cfdcc9d6e5170340abae63234a442"><td class="memItemLeft" align="right" valign="top">double(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acc6cfdcc9d6e5170340abae63234a442">dactivation_function</a> )(const double &amp;)</td></tr>
 <tr class="separator:acc6cfdcc9d6e5170340abae63234a442"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ace9c37dd1322d3745de9713c90df8003" id="r_ace9c37dd1322d3745de9713c90df8003"><td class="memItemLeft" align="right" valign="top"><a id="ace9c37dd1322d3745de9713c90df8003" name="ace9c37dd1322d3745de9713c90df8003"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>neurons</b></td></tr>
+<tr class="memitem:ace9c37dd1322d3745de9713c90df8003" id="r_ace9c37dd1322d3745de9713c90df8003"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ace9c37dd1322d3745de9713c90df8003">neurons</a></td></tr>
 <tr class="separator:ace9c37dd1322d3745de9713c90df8003"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a891264e2eb1357b2b3282e5532250869" id="r_a891264e2eb1357b2b3282e5532250869"><td class="memItemLeft" align="right" valign="top"><a id="a891264e2eb1357b2b3282e5532250869" name="a891264e2eb1357b2b3282e5532250869"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><b>activation</b></td></tr>
+<tr class="memitem:a891264e2eb1357b2b3282e5532250869" id="r_a891264e2eb1357b2b3282e5532250869"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a891264e2eb1357b2b3282e5532250869">activation</a></td></tr>
 <tr class="separator:a891264e2eb1357b2b3282e5532250869"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a494d39f6c367071d1fd31b3c1caf1a7d" id="r_a494d39f6c367071d1fd31b3c1caf1a7d"><td class="memItemLeft" align="right" valign="top"><a id="a494d39f6c367071d1fd31b3c1caf1a7d" name="a494d39f6c367071d1fd31b3c1caf1a7d"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>kernel</b></td></tr>
+<tr class="memitem:a494d39f6c367071d1fd31b3c1caf1a7d" id="r_a494d39f6c367071d1fd31b3c1caf1a7d"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::valarray&lt; double &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a494d39f6c367071d1fd31b3c1caf1a7d">kernel</a></td></tr>
 <tr class="separator:a494d39f6c367071d1fd31b3c1caf1a7d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a class="el" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">neural_network::layers::DenseLayer</a> class is used to store all necessary information about the layers (i.e. neurons, activation and kernel). This class is used by <a class="el" href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> class to store layers. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00125">125</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a11046825be0b6dbb73fbe834aa49200e" name="a11046825be0b6dbb73fbe834aa49200e"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a11046825be0b6dbb73fbe834aa49200e">&#9670;&#160;</a></span>DenseLayer() <span class="overload">[1/4]</span></h2>
@@ -172,12 +186,12 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>neurons</b></td></tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>activation</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>activation</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; size_t, size_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>kernel_shape</em></span>, </td>
+          <td class="paramtype">const std::pair&lt; size_t, size_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>kernel_shape</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -200,6 +214,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>neurons</b></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00141">141</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  143</span>                                          {</div>
 <div class="line"><span class="lineno">  144</span>        <span class="comment">// Choosing activation (and it&#39;s derivative)</span></div>
 <div class="line"><span class="lineno">  145</span>        <span class="keywordflow">if</span> (activation == <span class="stringliteral">&quot;sigmoid&quot;</span>) {</div>
@@ -219,11 +235,11 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>neurons</b></td></tr>
 <div class="line"><span class="lineno">  159</span>                neural_network::util_functions::identity_function;</div>
 <div class="line"><span class="lineno">  160</span>        } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">  161</span>            <span class="comment">// If supplied activation is invalid</span></div>
-<div class="line"><span class="lineno">  162</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><span class="lineno">  163</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Invalid argument. Expected {none, sigmoid, relu, &quot;</span></div>
+<div class="line"><span class="lineno">  162</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><span class="lineno">  163</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Invalid argument. Expected {none, sigmoid, relu, &quot;</span></div>
 <div class="line"><span class="lineno">  164</span>                         <span class="stringliteral">&quot;tanh} got &quot;</span>;</div>
-<div class="line"><span class="lineno">  165</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; activation &lt;&lt; <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">  166</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  165</span>            std::cerr &lt;&lt; activation &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  166</span>            std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  167</span>        }</div>
 <div class="line"><span class="lineno">  168</span>        this-&gt;activation = activation;  <span class="comment">// Setting activation name</span></div>
 <div class="line"><span class="lineno">  169</span>        this-&gt;neurons = neurons;        <span class="comment">// Setting number of neurons</span></div>
@@ -234,17 +250,9 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>neurons</b></td></tr>
 <div class="line"><span class="lineno">  174</span>            <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4">unit_matrix_initialization</a>(kernel, kernel_shape);</div>
 <div class="line"><span class="lineno">  175</span>        }</div>
 <div class="line"><span class="lineno">  176</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::cerr</a></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="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4">machine_learning::unit_matrix_initialization</a></div><div class="ttdeci">void unit_matrix_initialization(std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:193</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_abee7b35403af3612222d3b7a53074905"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905">machine_learning::uniform_random_initialization</a></div><div class="ttdeci">void uniform_random_initialization(std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape, const T &amp;low, const T &amp;high)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:166</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph.svg" width="614" height="216"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemachine__learning_html_a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4">machine_learning::unit_matrix_initialization</a></div><div class="ttdeci">void unit_matrix_initialization(std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00193">vector_ops.hpp:193</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_abee7b35403af3612222d3b7a53074905"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905">machine_learning::uniform_random_initialization</a></div><div class="ttdeci">void uniform_random_initialization(std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape, const T &amp;low, const T &amp;high)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00166">vector_ops.hpp:166</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af136ec31dbd35b1be2eb9a057677c704" name="af136ec31dbd35b1be2eb9a057677c704"></a>
@@ -264,12 +272,12 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>activation</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>activation</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>kernel</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>kernel</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -286,6 +294,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00183">183</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  184</span>                                                             {</div>
 <div class="line"><span class="lineno">  185</span>        <span class="comment">// Choosing activation (and it&#39;s derivative)</span></div>
 <div class="line"><span class="lineno">  186</span>        <span class="keywordflow">if</span> (activation == <span class="stringliteral">&quot;sigmoid&quot;</span>) {</div>
@@ -305,22 +315,17 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  200</span>                neural_network::util_functions::identity_function;</div>
 <div class="line"><span class="lineno">  201</span>        } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">  202</span>            <span class="comment">// If supplied activation is invalid</span></div>
-<div class="line"><span class="lineno">  203</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
-<div class="line"><span class="lineno">  204</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Invalid argument. Expected {none, sigmoid, relu, &quot;</span></div>
+<div class="line"><span class="lineno">  203</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;ERROR (&quot;</span> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;) : &quot;</span>;</div>
+<div class="line"><span class="lineno">  204</span>            std::cerr &lt;&lt; <span class="stringliteral">&quot;Invalid argument. Expected {none, sigmoid, relu, &quot;</span></div>
 <div class="line"><span class="lineno">  205</span>                         <span class="stringliteral">&quot;tanh} got &quot;</span>;</div>
-<div class="line"><span class="lineno">  206</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; activation &lt;&lt; <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">  207</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a>(EXIT_FAILURE);</div>
+<div class="line"><span class="lineno">  206</span>            std::cerr &lt;&lt; activation &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  207</span>            std::exit(EXIT_FAILURE);</div>
 <div class="line"><span class="lineno">  208</span>        }</div>
 <div class="line"><span class="lineno">  209</span>        this-&gt;activation = activation;  <span class="comment">// Setting activation name</span></div>
 <div class="line"><span class="lineno">  210</span>        this-&gt;neurons = neurons;        <span class="comment">// Setting number of neurons</span></div>
 <div class="line"><span class="lineno">  211</span>        this-&gt;kernel = kernel;          <span class="comment">// Setting supplied kernel values</span></div>
 <div class="line"><span class="lineno">  212</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_af136ec31dbd35b1be2eb9a057677c704_cgraph.svg" width="326" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2871146feaaa453558239df67b21e0d2" name="a2871146feaaa453558239df67b21e0d2"></a>
@@ -458,10 +463,91 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 <p>Move assignment operator for class <a class="el" href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">DenseLayer</a> </p>
 
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a891264e2eb1357b2b3282e5532250869" name="a891264e2eb1357b2b3282e5532250869"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a891264e2eb1357b2b3282e5532250869">&#9670;&#160;</a></span>activation</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::string machine_learning::neural_network::layers::DenseLayer::activation</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00131">131</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a8e4c57922478ccc2b7c6277c05608714" name="a8e4c57922478ccc2b7c6277c05608714"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a8e4c57922478ccc2b7c6277c05608714">&#9670;&#160;</a></span>activation_function</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">double(* machine_learning::neural_network::layers::DenseLayer::activation_function) (const double &amp;)</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00128">128</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
+
+</div>
+</div>
+<a id="acc6cfdcc9d6e5170340abae63234a442" name="acc6cfdcc9d6e5170340abae63234a442"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#acc6cfdcc9d6e5170340abae63234a442">&#9670;&#160;</a></span>dactivation_function</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">double(* machine_learning::neural_network::layers::DenseLayer::dactivation_function) (const double &amp;)</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00129">129</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a494d39f6c367071d1fd31b3c1caf1a7d" name="a494d39f6c367071d1fd31b3c1caf1a7d"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a494d39f6c367071d1fd31b3c1caf1a7d">&#9670;&#160;</a></span>kernel</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::valarray&lt;double&gt; &gt; machine_learning::neural_network::layers::DenseLayer::kernel</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00132">132</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ace9c37dd1322d3745de9713c90df8003" name="ace9c37dd1322d3745de9713c90df8003"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ace9c37dd1322d3745de9713c90df8003">&#9670;&#160;</a></span>neurons</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int machine_learning::neural_network::layers::DenseLayer::neurons</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d2/d58/neural__network_8cpp_source.html#l00130">130</a> of file <a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>machine_learning/<a class="el" href="../../d2/d58/neural__network_8cpp.html">neural_network.cpp</a></li>
+<li>machine_learning/<a class="el" href="../../d2/d58/neural__network_8cpp_source.html">neural_network.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph.map b/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph.map
deleted file mode 100644
index 5f55f1cd8..000000000
--- a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="machine_learning::neural_network::layers::DenseLayer::DenseLayer" name="machine_learning::neural_network::layers::DenseLayer::DenseLayer">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,69,201,125"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="300,5,371,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="175,66,248,40,284,29,286,34,250,45,176,71"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="301,55,370,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="201,82,285,71,286,76,201,87"/>
-<area shape="rect" id="Node000004" href="$d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905" title=" " alt="" coords="249,104,422,145"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="201,106,234,110,233,115,201,111"/>
-<area shape="rect" id="Node000006" href="$d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4" title=" " alt="" coords="260,170,411,210"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="173,123,250,154,267,161,265,166,248,159,171,128"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/system_clock/now.html#" title=" " alt="" coords="470,104,607,145"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="422,122,454,122,454,128,422,128"/>
-</map>
diff --git a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph.md5 b/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph.md5
deleted file mode 100644
index 9a64bd44a..000000000
--- a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3f8eac50ed35e01634832b436c1a78fb
\ No newline at end of file
diff --git a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph.svg b/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph.svg
deleted file mode 100644
index 65abc5ce8..000000000
--- a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph.svg
+++ /dev/null
@@ -1,142 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::layers::DenseLayer::DenseLayer Pages: 1 -->
-<svg width="460pt" height="162pt"
- viewBox="0.00 0.00 459.50 161.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 157.88)">
-<title>machine_learning::neural_network::layers::DenseLayer::DenseLayer</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="146.5,-106.12 0,-106.12 0,-64.38 146.5,-64.38 146.5,-106.12"/>
-<text text-anchor="start" x="8" y="-92.62" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-81.38" font-family="Helvetica,sans-Serif" font-size="10.00">_network::layers::DenseLayer</text>
-<text text-anchor="middle" x="73.25" y="-70.12" font-family="Helvetica,sans-Serif" font-size="10.00">::DenseLayer</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.25,-153.88 220.75,-153.88 220.75,-134.62 274.25,-134.62 274.25,-153.88"/>
-<text text-anchor="middle" x="247.5" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.6,-106.52C144.99,-113.17 164.46,-120.31 182.5,-126.25 191.21,-129.12 200.68,-131.94 209.6,-134.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.47,-137.79 219.04,-137.09 210.34,-131.04 208.47,-137.79"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273.12,-116.88 221.88,-116.88 221.88,-97.62 273.12,-97.62 273.12,-116.88"/>
-<text text-anchor="middle" x="247.5" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.8,-94.52C168.67,-97.31 191.74,-100.26 210.18,-102.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="209.7,-106.08 220.06,-103.87 210.58,-99.13 209.7,-106.08"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312.5,-79.5 182.5,-79.5 182.5,-49 312.5,-49 312.5,-79.5"/>
-<text text-anchor="start" x="190.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::uniform</text>
-<text text-anchor="middle" x="247.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random_initialization</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.8,-76.4C154.8,-75.43 162.96,-74.44 170.99,-73.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.23,-76.95 180.74,-72.27 170.39,-70 171.23,-76.95"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.25,-30.5 190.75,-30.5 190.75,0 304.25,0 304.25,-30.5"/>
-<text text-anchor="start" x="198.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::unit</text>
-<text text-anchor="middle" x="247.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_matrix_initialization</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.82,-63.96C142.98,-56.39 163.62,-47.86 182.5,-40.25 186.61,-38.59 190.88,-36.89 195.18,-35.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.39,-38.47 204.41,-31.54 193.83,-31.96 196.39,-38.47"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="451.5,-79.5 348.5,-79.5 348.5,-49 451.5,-49 451.5,-79.5"/>
-<text text-anchor="start" x="356.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::system</text>
-<text text-anchor="middle" x="400" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M312.76,-64.25C320.71,-64.25 328.82,-64.25 336.73,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.63,-67.75 346.63,-64.25 336.63,-60.75 336.63,-67.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph_org.svg b/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph_org.svg
deleted file mode 100644
index 9068f7317..000000000
--- a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_a11046825be0b6dbb73fbe834aa49200e_cgraph_org.svg
+++ /dev/null
@@ -1,116 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::layers::DenseLayer::DenseLayer Pages: 1 -->
-<svg width="460pt" height="162pt"
- viewBox="0.00 0.00 459.50 161.88" 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 157.88)">
-<title>machine_learning::neural_network::layers::DenseLayer::DenseLayer</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="146.5,-106.12 0,-106.12 0,-64.38 146.5,-64.38 146.5,-106.12"/>
-<text text-anchor="start" x="8" y="-92.62" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-81.38" font-family="Helvetica,sans-Serif" font-size="10.00">_network::layers::DenseLayer</text>
-<text text-anchor="middle" x="73.25" y="-70.12" font-family="Helvetica,sans-Serif" font-size="10.00">::DenseLayer</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.25,-153.88 220.75,-153.88 220.75,-134.62 274.25,-134.62 274.25,-153.88"/>
-<text text-anchor="middle" x="247.5" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M127.6,-106.52C144.99,-113.17 164.46,-120.31 182.5,-126.25 191.21,-129.12 200.68,-131.94 209.6,-134.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.47,-137.79 219.04,-137.09 210.34,-131.04 208.47,-137.79"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273.12,-116.88 221.88,-116.88 221.88,-97.62 273.12,-97.62 273.12,-116.88"/>
-<text text-anchor="middle" x="247.5" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.8,-94.52C168.67,-97.31 191.74,-100.26 210.18,-102.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="209.7,-106.08 220.06,-103.87 210.58,-99.13 209.7,-106.08"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312.5,-79.5 182.5,-79.5 182.5,-49 312.5,-49 312.5,-79.5"/>
-<text text-anchor="start" x="190.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::uniform</text>
-<text text-anchor="middle" x="247.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_random_initialization</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.8,-76.4C154.8,-75.43 162.96,-74.44 170.99,-73.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.23,-76.95 180.74,-72.27 170.39,-70 171.23,-76.95"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.25,-30.5 190.75,-30.5 190.75,0 304.25,0 304.25,-30.5"/>
-<text text-anchor="start" x="198.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::unit</text>
-<text text-anchor="middle" x="247.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_matrix_initialization</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.82,-63.96C142.98,-56.39 163.62,-47.86 182.5,-40.25 186.61,-38.59 190.88,-36.89 195.18,-35.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.39,-38.47 204.41,-31.54 193.83,-31.96 196.39,-38.47"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="451.5,-79.5 348.5,-79.5 348.5,-49 451.5,-49 451.5,-79.5"/>
-<text text-anchor="start" x="356.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::chrono::system</text>
-<text text-anchor="middle" x="400" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_clock::now</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M312.76,-64.25C320.71,-64.25 328.82,-64.25 336.73,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.63,-67.75 346.63,-64.25 336.63,-60.75 336.63,-67.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_af136ec31dbd35b1be2eb9a057677c704_cgraph.map b/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_af136ec31dbd35b1be2eb9a057677c704_cgraph.map
deleted file mode 100644
index 815537876..000000000
--- a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_af136ec31dbd35b1be2eb9a057677c704_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="machine_learning::neural_network::layers::DenseLayer::DenseLayer" name="machine_learning::neural_network::layers::DenseLayer::DenseLayer">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,16,201,71"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="249,5,320,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="201,27,233,23,234,28,201,32"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/program/exit.html#" title=" " alt="" coords="250,55,318,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="201,54,235,58,234,64,201,59"/>
-</map>
diff --git a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_af136ec31dbd35b1be2eb9a057677c704_cgraph.md5 b/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_af136ec31dbd35b1be2eb9a057677c704_cgraph.md5
deleted file mode 100644
index 15d9db229..000000000
--- a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_af136ec31dbd35b1be2eb9a057677c704_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b7c485bdb59296533ce7b5ecebd6ed89
\ No newline at end of file
diff --git a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_af136ec31dbd35b1be2eb9a057677c704_cgraph.svg b/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_af136ec31dbd35b1be2eb9a057677c704_cgraph.svg
deleted file mode 100644
index 5dc5fe80e..000000000
--- a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_af136ec31dbd35b1be2eb9a057677c704_cgraph.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::layers::DenseLayer::DenseLayer Pages: 1 -->
-<svg width="244pt" height="64pt"
- viewBox="0.00 0.00 244.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>machine_learning::neural_network::layers::DenseLayer::DenseLayer</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="146.5,-48.5 0,-48.5 0,-6.75 146.5,-6.75 146.5,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::layers::DenseLayer</text>
-<text text-anchor="middle" x="73.25" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::DenseLayer</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236,-56.25 182.5,-56.25 182.5,-37 236,-37 236,-56.25"/>
-<text text-anchor="middle" x="209.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.74,-37.9C155.08,-39.09 163.3,-40.25 170.89,-41.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.32,-44.78 180.71,-42.72 171.3,-37.85 170.32,-44.78"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.88,-19.25 183.62,-19.25 183.62,0 234.88,0 234.88,-19.25"/>
-<text text-anchor="middle" x="209.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.74,-17.89C155.5,-16.71 164.14,-15.55 172.05,-14.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.46,-17.96 181.91,-13.16 171.53,-11.03 172.46,-17.96"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_af136ec31dbd35b1be2eb9a057677c704_cgraph_org.svg b/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_af136ec31dbd35b1be2eb9a057677c704_cgraph_org.svg
deleted file mode 100644
index f151ab652..000000000
--- a/dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_af136ec31dbd35b1be2eb9a057677c704_cgraph_org.svg
+++ /dev/null
@@ -1,59 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::neural_network::layers::DenseLayer::DenseLayer Pages: 1 -->
-<svg width="244pt" height="64pt"
- viewBox="0.00 0.00 244.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>machine_learning::neural_network::layers::DenseLayer::DenseLayer</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="146.5,-48.5 0,-48.5 0,-6.75 146.5,-6.75 146.5,-48.5"/>
-<text text-anchor="start" x="8" y="-35" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::neural</text>
-<text text-anchor="start" x="8" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">_network::layers::DenseLayer</text>
-<text text-anchor="middle" x="73.25" y="-12.5" font-family="Helvetica,sans-Serif" font-size="10.00">::DenseLayer</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236,-56.25 182.5,-56.25 182.5,-37 236,-37 236,-56.25"/>
-<text text-anchor="middle" x="209.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.74,-37.9C155.08,-39.09 163.3,-40.25 170.89,-41.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.32,-44.78 180.71,-42.72 171.3,-37.85 170.32,-44.78"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/program/exit.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.88,-19.25 183.62,-19.25 183.62,0 234.88,0 234.88,-19.25"/>
-<text text-anchor="middle" x="209.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exit</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.74,-17.89C155.5,-16.71 164.14,-15.55 172.05,-14.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.46,-17.96 181.91,-13.16 171.53,-11.03 172.46,-17.96"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d93/trie__modern_8cpp.html b/dc/d93/trie__modern_8cpp.html
index c4cad8915..da2115251 100644
--- a/dc/d93/trie__modern_8cpp.html
+++ b/dc/d93/trie__modern_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/trie_modern.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/trie_modern.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for trie_modern.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/db5/trie__modern_8cpp__incl.svg" width="252" height="126"><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">
+</div>
+<p><a href="../../dc/d93/trie__modern_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d2f/class_trie.html">Trie</a></td></tr>
@@ -137,6 +156,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A basic implementation of trie class to store only lower-case strings. </p>
 <dl class="section author"><dt>Author</dt><dd>Anmol3299 </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html">trie_modern.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -153,25 +174,21 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html#l00160">160</a> of file <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html">trie_modern.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  160</span>           {</div>
 <div class="line"><span class="lineno">  161</span>    <a class="code hl_class" href="../../dd/d2f/class_trie.html">Trie</a> trie;</div>
 <div class="line"><span class="lineno">  162</span>    trie.<a class="code hl_function" href="../../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2">insert</a>(<span class="stringliteral">&quot;hel&quot;</span>);</div>
 <div class="line"><span class="lineno">  163</span>    trie.<a class="code hl_function" href="../../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2">insert</a>(<span class="stringliteral">&quot;hello&quot;</span>);</div>
 <div class="line"><span class="lineno">  164</span>    trie.removeWord(<span class="stringliteral">&quot;hel&quot;</span>);</div>
-<div class="line"><span class="lineno">  165</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; trie.<a class="code hl_function" href="../../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206">search</a>(<span class="stringliteral">&quot;hello&quot;</span>) &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><span class="lineno">  165</span>    std::cout &lt;&lt; trie.<a class="code hl_function" href="../../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206">search</a>(<span class="stringliteral">&quot;hello&quot;</span>) &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
 <div class="line"><span class="lineno">  166</span> </div>
 <div class="line"><span class="lineno">  167</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  168</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="aclass_trie_html"><div class="ttname"><a href="../../dd/d2f/class_trie.html">Trie</a></div><div class="ttdef"><b>Definition</b> trie_modern.cpp:16</div></div>
-<div class="ttc" id="aclass_trie_html_a411e77126930a0942dd7b65e96b15206"><div class="ttname"><a href="../../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206">Trie::search</a></div><div class="ttdeci">bool search(const std::string &amp;word)</div><div class="ttdef"><b>Definition</b> trie_modern.cpp:132</div></div>
-<div class="ttc" id="aclass_trie_html_afd8b79959009b554e98ea7128b2886f2"><div class="ttname"><a href="../../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2">Trie::insert</a></div><div class="ttdeci">void insert(const std::string &amp;word)</div><div class="ttdef"><b>Definition</b> trie_modern.cpp:109</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d93/trie__modern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="372" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclass_trie_html"><div class="ttname"><a href="../../dd/d2f/class_trie.html">Trie</a></div><div class="ttdef"><b>Definition</b> <a href="../../dc/d93/trie__modern_8cpp_source.html#l00016">trie_modern.cpp:16</a></div></div>
+<div class="ttc" id="aclass_trie_html_a411e77126930a0942dd7b65e96b15206"><div class="ttname"><a href="../../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206">Trie::search</a></div><div class="ttdeci">bool search(const std::string &amp;word)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d93/trie__modern_8cpp_source.html#l00132">trie_modern.cpp:132</a></div></div>
+<div class="ttc" id="aclass_trie_html_afd8b79959009b554e98ea7128b2886f2"><div class="ttname"><a href="../../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2">Trie::insert</a></div><div class="ttdeci">void insert(const std::string &amp;word)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d93/trie__modern_8cpp_source.html#l00109">trie_modern.cpp:109</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dc/d93/trie__modern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/d93/trie__modern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index dd7c625da..000000000
--- a/dc/d93/trie__modern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2" title=" " alt="" coords="106,5,190,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,36,91,28,92,33,56,41"/>
-<area shape="rect" id="Node000004" href="$dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206" title=" " alt="" coords="103,55,193,80"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,46,88,53,87,58,55,51"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="241,5,366,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="190,16,226,16,226,21,190,21"/>
-</map>
diff --git a/dc/d93/trie__modern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/d93/trie__modern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 4247893ef..000000000
--- a/dc/d93/trie__modern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9e24b772d0d22cd0d15b08eb19071602
\ No newline at end of file
diff --git a/dc/d93/trie__modern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/d93/trie__modern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 1af22ad94..000000000
--- a/dc/d93/trie__modern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="279pt" height="64pt"
- viewBox="0.00 0.00 278.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.12,-56.25 75.62,-56.25 75.62,-37 138.12,-37 138.12,-56.25"/>
-<text text-anchor="middle" x="106.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">Trie::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.4,-31.56C45.28,-33.3 54.9,-35.41 64.41,-37.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="63.42,-40.87 73.93,-39.6 64.92,-34.03 63.42,-40.87"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="140.75,-19.25 73,-19.25 73,0 140.75,0 140.75,-19.25"/>
-<text text-anchor="middle" x="106.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Trie::search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.4,-23.9C44.47,-22.42 52.95,-20.65 61.49,-18.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.08,-22.33 71.16,-16.86 60.65,-15.47 62.08,-22.33"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.75,-56.25 176.75,-56.25 176.75,-37 270.75,-37 270.75,-56.25"/>
-<text text-anchor="middle" x="223.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.36,-46.62C146.67,-46.62 155.97,-46.62 165.26,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.02,-50.13 175.02,-46.63 165.02,-43.13 165.02,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d93/trie__modern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dc/d93/trie__modern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 1c2dfc640..000000000
--- a/dc/d93/trie__modern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="279pt" height="64pt"
- viewBox="0.00 0.00 278.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.12,-56.25 75.62,-56.25 75.62,-37 138.12,-37 138.12,-56.25"/>
-<text text-anchor="middle" x="106.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">Trie::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.4,-31.56C45.28,-33.3 54.9,-35.41 64.41,-37.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="63.42,-40.87 73.93,-39.6 64.92,-34.03 63.42,-40.87"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="140.75,-19.25 73,-19.25 73,0 140.75,0 140.75,-19.25"/>
-<text text-anchor="middle" x="106.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Trie::search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.4,-23.9C44.47,-22.42 52.95,-20.65 61.49,-18.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.08,-22.33 71.16,-16.86 60.65,-15.47 62.08,-22.33"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.75,-56.25 176.75,-56.25 176.75,-37 270.75,-37 270.75,-56.25"/>
-<text text-anchor="middle" x="223.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.36,-46.62C146.67,-46.62 155.97,-46.62 165.26,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.02,-50.13 175.02,-46.63 165.02,-43.13 165.02,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d93/trie__modern_8cpp_source.html b/dc/d93/trie__modern_8cpp_source.html
new file mode 100644
index 000000000..ae5eb972d
--- /dev/null
+++ b/dc/d93/trie__modern_8cpp_source.html
@@ -0,0 +1,276 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/trie_modern.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dc/d93/trie__modern_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">trie_modern.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dc/d93/trie__modern_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;iostream&gt;</span>  <span class="comment">// for io operations</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;memory&gt;</span>    <span class="comment">// for std::shared_ptr&lt;&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;string&gt;</span>    <span class="comment">// for std::string class</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span> </div>
+<div class="foldopen" id="foldopen00016" data-start="{" data-end="};">
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"><a class="line" href="../../dd/d2f/class_trie.html">   16</a></span><span class="keyword">class </span><a class="code hl_class" href="../../dd/d2f/class_trie.html">Trie</a> {</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="keyword">static</span> <span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> ALPHABETS = 26;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="foldopen" id="foldopen00026" data-start="{" data-end="};">
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"><a class="line" href="../../de/d48/struct_trie_1_1_trie_node.html">   26</a></span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a> {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        <span class="comment">// An array of pointers of size 26 which tells if a character of word is</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        <span class="comment">// present or not.</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>        std::shared_ptr&lt;TrieNode&gt; character[ALPHABETS]{<span class="keyword">nullptr</span>};</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        <span class="keywordtype">bool</span> isEndOfWord{<span class="keyword">false</span>};</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    };</div>
+</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="foldopen" id="foldopen00041" data-start="{" data-end="}">
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb">   41</a></span>    <span class="keyword">inline</span> <span class="keyword">static</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb">hasChildren</a>(std::shared_ptr&lt;TrieNode&gt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; ALPHABETS; i++) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>            <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;character[i]) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>            }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        }</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    }</div>
+</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="foldopen" id="foldopen00064" data-start="{" data-end="}">
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../dd/d2f/class_trie.html#a26941759ecf94d67a27d4a610bc0f63d">   64</a></span>    std::shared_ptr&lt;TrieNode&gt; <a class="code hl_function" href="../../dd/d2f/class_trie.html#a26941759ecf94d67a27d4a610bc0f63d">removeWordHelper</a>(<span class="keyword">const</span> std::string&amp; word,</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>                                               std::shared_ptr&lt;TrieNode&gt; curr,</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>                                               <span class="keywordtype">size_t</span> index) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <span class="keywordflow">if</span> (word.size() == index) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            <span class="keywordflow">if</span> (curr-&gt;isEndOfWord) {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>                curr-&gt;isEndOfWord = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            }</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>            <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb">hasChildren</a>(curr)) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>                <span class="keywordflow">return</span> curr;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            }</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        }</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        <span class="keywordtype">size_t</span> idx = word[index] - <span class="charliteral">&#39;a&#39;</span>;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        <span class="comment">// Throw a runtime error in case the user enters a word which is not</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="comment">// present in the trie.</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <span class="keywordflow">if</span> (!curr-&gt;character[idx]) {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>            <span class="keywordflow">throw</span> std::runtime_error(std::move(std::string(<span class="stringliteral">&quot;Word not found.&quot;</span>)));</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        }</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        curr-&gt;character[idx] =</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            <a class="code hl_function" href="../../dd/d2f/class_trie.html#a26941759ecf94d67a27d4a610bc0f63d">removeWordHelper</a>(word, curr-&gt;character[idx], index + 1);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        <span class="comment">// This if condition checks if the node has some childern.</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        <span class="comment">// The 1st if check, i.e. (curr-&gt;character[idx]) is checked specifically</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        <span class="comment">// because if the older string is a prefix of some other string, then,</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        <span class="comment">// there would be no need to check all 26 characters. Example- str1 =</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        <span class="comment">// abbey, str2 = abbex and we want to delete string &quot;abbey&quot;, then in</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        <span class="comment">// this case, there would be no need to check all characters for the</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="comment">// chars a,b,b.</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        <span class="keywordflow">if</span> (curr-&gt;character[idx] || <a class="code hl_function" href="../../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb">hasChildren</a>(curr)) {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            <span class="keywordflow">return</span> curr;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        }</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    }</div>
+</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"><a class="line" href="../../dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908">  103</a></span>    <a class="code hl_function" href="../../dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908">Trie</a>() : m_root(std::make_shared&lt;<a class="code hl_struct" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a>&gt;()) {}</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="foldopen" id="foldopen00109" data-start="{" data-end="}">
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"><a class="line" href="../../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2">  109</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2">insert</a>(<span class="keyword">const</span> std::string&amp; word) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        <span class="keyword">auto</span> curr = m_root;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        <span class="keywordflow">for</span> (<span class="keywordtype">char</span> ch : word) {</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>            <span class="keywordtype">size_t</span> index = ch - <span class="charliteral">&#39;a&#39;</span>;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>            <span class="comment">// if a node for current word is not already present in trie, create</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>            <span class="comment">// a new node for it.</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>            <span class="keywordflow">if</span> (!curr-&gt;character[index]) {</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>                curr-&gt;character[index] = std::make_shared&lt;TrieNode&gt;();</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>            }</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>            curr = curr-&gt;character[index];</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        }</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        curr-&gt;isEndOfWord = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    }</div>
+</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
+<div class="foldopen" id="foldopen00132" data-start="{" data-end="}">
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"><a class="line" href="../../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206">  132</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206">search</a>(<span class="keyword">const</span> std::string&amp; word) {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        <span class="keyword">auto</span> curr = m_root;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>        <span class="keywordflow">for</span> (<span class="keywordtype">char</span> ch : word) {</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>            <span class="keywordtype">size_t</span> index = ch - <span class="charliteral">&#39;a&#39;</span>;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span> </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>            <span class="comment">// if any node for a character is not found, then return that the</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>            <span class="comment">// word cannot be formed.</span></div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>            <span class="keywordflow">if</span> (!curr-&gt;character[index]) {</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>            }</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>            curr = curr-&gt;character[index];</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        }</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        <span class="keywordflow">return</span> curr-&gt;isEndOfWord;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    }</div>
+</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span> </div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    <span class="comment">// Function to remove the word which calls the helper function.</span></div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    <span class="keywordtype">void</span> removeWord(<span class="keyword">const</span> std::string&amp; word) {</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        m_root = <a class="code hl_function" href="../../dd/d2f/class_trie.html#a26941759ecf94d67a27d4a610bc0f63d">removeWordHelper</a>(word, m_root, 0);</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    }</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    <span class="comment">// data member to store the root of the trie.</span></div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    std::shared_ptr&lt;TrieNode&gt; m_root;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>};</div>
+</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span> </div>
+<div class="foldopen" id="foldopen00160" data-start="{" data-end="}">
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"><a class="line" href="../../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  160</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    <a class="code hl_class" href="../../dd/d2f/class_trie.html">Trie</a> trie;</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    trie.<a class="code hl_function" href="../../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2">insert</a>(<span class="stringliteral">&quot;hel&quot;</span>);</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    trie.<a class="code hl_function" href="../../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2">insert</a>(<span class="stringliteral">&quot;hello&quot;</span>);</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    trie.removeWord(<span class="stringliteral">&quot;hel&quot;</span>);</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    std::cout &lt;&lt; trie.<a class="code hl_function" href="../../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206">search</a>(<span class="stringliteral">&quot;hello&quot;</span>) &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span> </div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>}</div>
+</div>
+<div class="ttc" id="aclass_trie_html"><div class="ttname"><a href="../../dd/d2f/class_trie.html">Trie</a></div><div class="ttdef"><b>Definition</b> <a href="#l00016">trie_modern.cpp:16</a></div></div>
+<div class="ttc" id="aclass_trie_html_a26941759ecf94d67a27d4a610bc0f63d"><div class="ttname"><a href="../../dd/d2f/class_trie.html#a26941759ecf94d67a27d4a610bc0f63d">Trie::removeWordHelper</a></div><div class="ttdeci">std::shared_ptr&lt; TrieNode &gt; removeWordHelper(const std::string &amp;word, std::shared_ptr&lt; TrieNode &gt; curr, size_t index)</div><div class="ttdef"><b>Definition</b> <a href="#l00064">trie_modern.cpp:64</a></div></div>
+<div class="ttc" id="aclass_trie_html_a411e77126930a0942dd7b65e96b15206"><div class="ttname"><a href="../../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206">Trie::search</a></div><div class="ttdeci">bool search(const std::string &amp;word)</div><div class="ttdef"><b>Definition</b> <a href="#l00132">trie_modern.cpp:132</a></div></div>
+<div class="ttc" id="aclass_trie_html_a6af57e9f25d0d0a2d59eea5a4a802908"><div class="ttname"><a href="../../dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908">Trie::Trie</a></div><div class="ttdeci">Trie()</div><div class="ttdoc">constructor to initialise the root of the trie.</div><div class="ttdef"><b>Definition</b> <a href="#l00103">trie_modern.cpp:103</a></div></div>
+<div class="ttc" id="aclass_trie_html_a6d10eb1669453395d1900ebd401954fb"><div class="ttname"><a href="../../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb">Trie::hasChildren</a></div><div class="ttdeci">static bool hasChildren(std::shared_ptr&lt; TrieNode &gt; node)</div><div class="ttdef"><b>Definition</b> <a href="#l00041">trie_modern.cpp:41</a></div></div>
+<div class="ttc" id="aclass_trie_html_afd8b79959009b554e98ea7128b2886f2"><div class="ttname"><a href="../../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2">Trie::insert</a></div><div class="ttdeci">void insert(const std::string &amp;word)</div><div class="ttdef"><b>Definition</b> <a href="#l00109">trie_modern.cpp:109</a></div></div>
+<div class="ttc" id="astruct_trie_1_1_trie_node_html"><div class="ttname"><a href="../../de/d48/struct_trie_1_1_trie_node.html">Trie::TrieNode</a></div><div class="ttdef"><b>Definition</b> <a href="#l00026">trie_modern.cpp:26</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+<div class="ttc" id="atrie__modern_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00160">trie_modern.cpp:160</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../dc/d93/trie__modern_8cpp.html">trie_modern.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dc/d9c/babylonian__method_8cpp.html b/dc/d9c/babylonian__method_8cpp.html
index 64cf5c37f..b5035c8fb 100644
--- a/dc/d9c/babylonian__method_8cpp.html
+++ b/dc/d9c/babylonian__method_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/babylonian_method.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/babylonian_method.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for babylonian_method.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d08/babylonian__method_8cpp__incl.svg" width="252" height="126"><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">
+</div>
+<p><a href="../../dc/d9c/babylonian__method_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr>
@@ -143,6 +162,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Babylonian_method" target="_blank">A babylonian method (BM)</a> is an algorithm that computes the square root. </p>
 <p>This algorithm has an application in use case scenario where a user wants find accurate square roots of large numbers </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/ameyachawlaggsipu" target="_blank">Ameya Chawla</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../dc/d9c/babylonian__method_8cpp_source.html">babylonian_method.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="abf9e6b7e6f15df4b525a2e7705ba3089" name="abf9e6b7e6f15df4b525a2e7705ba3089"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#abf9e6b7e6f15df4b525a2e7705ba3089">&#9670;&#160;</a></span>main()</h2>
@@ -172,18 +193,15 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d9c/babylonian__method_8cpp_source.html#l00096">96</a> of file <a class="el" href="../../dc/d9c/babylonian__method_8cpp_source.html">babylonian_method.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   96</span>                                       {</div>
 <div class="line"><span class="lineno">   97</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">//  run self-test implementations</span></div>
 <div class="line"><span class="lineno">   98</span>             <span class="comment">//  with 2 defined test cases</span></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="ababylonian__method_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> babylonian_method.cpp:62</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg" width="463" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ababylonian__method_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d9c/babylonian__method_8cpp_source.html#l00062">babylonian_method.cpp:62</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -219,41 +237,31 @@ Here is the call graph for this function:</div>
 <p>Test result for testcase 2</p>
 <p>Testing for test Case 1</p>
 <p>Testing for test Case 2</p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d9c/babylonian__method_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../dc/d9c/babylonian__method_8cpp_source.html">babylonian_method.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>                   {</div>
 <div class="line"><span class="lineno">   63</span>    <span class="comment">/* descriptions of the following test */</span></div>
 <div class="line"><span class="lineno">   64</span> </div>
-<div class="line"><span class="lineno">   65</span>    <span class="keyword">auto</span> testcase1 = 125348;  <span class="comment">/// Testcase 1</span></div>
-<div class="line"><span class="lineno">   66</span>    <span class="keyword">auto</span> testcase2 = 752080;  <span class="comment">/// Testcase 2</span></div>
+<div class="line"><span class="lineno">   65</span>    <span class="keyword">auto</span> testcase1 = 125348;  </div>
+<div class="line"><span class="lineno">   66</span>    <span class="keyword">auto</span> testcase2 = 752080;  </div>
 <div class="line"><span class="lineno">   67</span> </div>
-<div class="line"><span class="lineno">   68</span>    <span class="keyword">auto</span> real_output1 = 354.045194855;  <span class="comment">/// Real Output 1</span></div>
-<div class="line"><span class="lineno">   69</span>    <span class="keyword">auto</span> real_output2 = 867.225460881;  <span class="comment">/// Real Output 2</span></div>
+<div class="line"><span class="lineno">   68</span>    <span class="keyword">auto</span> real_output1 = 354.045194855;  </div>
+<div class="line"><span class="lineno">   69</span>    <span class="keyword">auto</span> real_output2 = 867.225460881;  </div>
 <div class="line"><span class="lineno">   70</span> </div>
-<div class="line"><span class="lineno">   71</span>    <span class="keyword">auto</span> test_result1 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309">numerical_methods::babylonian_method</a>(testcase1);<span class="comment"></span></div>
-<div class="line"><span class="lineno">   72</span><span class="comment">    /// Test result for testcase 1</span></div>
-<div class="line"><span class="lineno">   73</span><span class="comment"></span>    <span class="keyword">auto</span> test_result2 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309">numerical_methods::babylonian_method</a>(testcase2);<span class="comment"></span></div>
-<div class="line"><span class="lineno">   74</span><span class="comment">    /// Test result for testcase 2</span></div>
-<div class="line"><span class="lineno">   75</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   76</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(test_result1, real_output1) -</div>
-<div class="line"><span class="lineno">   77</span>               <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(test_result1, real_output1) &lt;</div>
-<div class="line"><span class="lineno">   78</span>           0.0001);<span class="comment"></span></div>
-<div class="line"><span class="lineno">   79</span><span class="comment">    /// Testing for test Case 1</span></div>
-<div class="line"><span class="lineno">   80</span><span class="comment"></span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(test_result2, real_output2) -</div>
-<div class="line"><span class="lineno">   81</span>               <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(test_result2, real_output2) &lt;</div>
-<div class="line"><span class="lineno">   82</span>           0.0001);<span class="comment"></span></div>
-<div class="line"><span class="lineno">   83</span><span class="comment">    /// Testing for test Case 2</span></div>
-<div class="line"><span class="lineno">   84</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   71</span>    <span class="keyword">auto</span> test_result1 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309">numerical_methods::babylonian_method</a>(testcase1);</div>
+<div class="line"><span class="lineno">   73</span>    <span class="keyword">auto</span> test_result2 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309">numerical_methods::babylonian_method</a>(testcase2);</div>
+<div class="line"><span class="lineno">   75</span> </div>
+<div class="line"><span class="lineno">   76</span>    assert(std::max(test_result1, real_output1) -</div>
+<div class="line"><span class="lineno">   77</span>               std::min(test_result1, real_output1) &lt;</div>
+<div class="line"><span class="lineno">   78</span>           0.0001);</div>
+<div class="line"><span class="lineno">   80</span>    assert(std::max(test_result2, real_output2) -</div>
+<div class="line"><span class="lineno">   81</span>               std::min(test_result2, real_output2) &lt;</div>
+<div class="line"><span class="lineno">   82</span>           0.0001);</div>
+<div class="line"><span class="lineno">   84</span> </div>
+<div class="line"><span class="lineno">   85</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   86</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="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="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="anamespacenumerical__methods_html_a28e67885f8606564cc8335f483f63309"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309">numerical_methods::babylonian_method</a></div><div class="ttdeci">double babylonian_method(double radicand)</div><div class="ttdoc">Babylonian methods is an iterative function which returns square root of radicand.</div><div class="ttdef"><b>Definition</b> babylonian_method.cpp:30</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="366" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacenumerical__methods_html_a28e67885f8606564cc8335f483f63309"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309">numerical_methods::babylonian_method</a></div><div class="ttdeci">double babylonian_method(double radicand)</div><div class="ttdoc">Babylonian methods is an iterative function which returns square root of radicand.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d9c/babylonian__method_8cpp_source.html#l00030">babylonian_method.cpp:30</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 0fd1af567..000000000
--- a/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,33,49,59"/>
-<area shape="rect" id="Node000002" href="$d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309" title="Babylonian methods is an iterative function which returns square root of radicand." alt="" coords="97,26,239,66"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,43,81,43,81,49,49,49"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="287,6,359,32"/>
-<area shape="poly" id="edge4_Node000001_Node000003" title=" " alt="" coords="48,31,70,20,96,11,142,4,189,3,272,9,272,14,189,8,143,10,97,16,72,25,50,36"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="289,60,357,85"/>
-<area shape="poly" id="edge5_Node000001_Node000004" title=" " alt="" coords="50,56,72,67,97,75,143,82,190,84,273,78,274,83,190,89,143,87,96,80,70,72,48,61"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="239,31,271,25,272,31,240,36"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="240,56,274,62,273,67,239,61"/>
-</map>
diff --git a/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 233e405c9..000000000
--- a/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-950f0521fee49507c3f1f74806aa3175
\ No newline at end of file
diff --git a/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 198d42539..000000000
--- a/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="274pt" height="69pt"
- viewBox="0.00 0.00 273.50 68.85" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64.85)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-40.06 0,-40.06 0,-20.81 32.5,-20.81 32.5,-40.06"/>
-<text text-anchor="middle" x="16.25" y="-26.56" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309" target="_top" xlink:title="Babylonian methods is an iterative function which returns square root of radicand.">
-<polygon fill="white" stroke="#666666" points="175.25,-45.68 68.5,-45.68 68.5,-15.18 175.25,-15.18 175.25,-45.68"/>
-<text text-anchor="start" x="76.5" y="-32.18" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="121.88" y="-20.93" font-family="Helvetica,sans-Serif" font-size="10.00">babylonian_method</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.99,-30.43C39.68,-30.43 47.96,-30.43 56.74,-30.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.53,-33.93 66.53,-30.43 56.53,-26.93 56.53,-33.93"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="265.5,-60.06 211.25,-60.06 211.25,-40.81 265.5,-40.81 265.5,-60.06"/>
-<text text-anchor="middle" x="238.38" y="-46.56" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.76,-39.89C42.61,-45.32 55.84,-51.62 68.5,-54.43 112.87,-64.31 165.41,-60.76 199.96,-56.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.01,-59.95 209.46,-55.14 199.08,-53.01 200.01,-59.95"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264,-20.06 212.75,-20.06 212.75,-0.81 264,-0.81 264,-20.06"/>
-<text text-anchor="middle" x="238.38" y="-6.56" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.76,-20.98C42.61,-15.54 55.84,-9.25 68.5,-6.43 113.31,3.54 166.47,-0.18 201,-4.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.52,-8.04 210.9,-5.93 201.47,-1.11 200.52,-8.04"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.43,-39.61C183.63,-41.05 191.96,-42.5 199.74,-43.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="199.09,-47.3 209.54,-45.57 200.29,-40.4 199.09,-47.3"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.43,-21.25C184.22,-19.72 193.16,-18.16 201.41,-16.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.8,-20.2 211.04,-15.03 200.59,-13.31 201.8,-20.2"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 2ab0f1156..000000000
--- a/dc/d9c/babylonian__method_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="274pt" height="69pt"
- viewBox="0.00 0.00 273.50 68.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 64.85)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-40.06 0,-40.06 0,-20.81 32.5,-20.81 32.5,-40.06"/>
-<text text-anchor="middle" x="16.25" y="-26.56" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309" target="_top" xlink:title="Babylonian methods is an iterative function which returns square root of radicand.">
-<polygon fill="white" stroke="#666666" points="175.25,-45.68 68.5,-45.68 68.5,-15.18 175.25,-15.18 175.25,-45.68"/>
-<text text-anchor="start" x="76.5" y="-32.18" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="121.88" y="-20.93" font-family="Helvetica,sans-Serif" font-size="10.00">babylonian_method</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.99,-30.43C39.68,-30.43 47.96,-30.43 56.74,-30.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.53,-33.93 66.53,-30.43 56.53,-26.93 56.53,-33.93"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="265.5,-60.06 211.25,-60.06 211.25,-40.81 265.5,-40.81 265.5,-60.06"/>
-<text text-anchor="middle" x="238.38" y="-46.56" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.76,-39.89C42.61,-45.32 55.84,-51.62 68.5,-54.43 112.87,-64.31 165.41,-60.76 199.96,-56.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.01,-59.95 209.46,-55.14 199.08,-53.01 200.01,-59.95"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264,-20.06 212.75,-20.06 212.75,-0.81 264,-0.81 264,-20.06"/>
-<text text-anchor="middle" x="238.38" y="-6.56" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.76,-20.98C42.61,-15.54 55.84,-9.25 68.5,-6.43 113.31,3.54 166.47,-0.18 201,-4.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.52,-8.04 210.9,-5.93 201.47,-1.11 200.52,-8.04"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.43,-39.61C183.63,-41.05 191.96,-42.5 199.74,-43.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="199.09,-47.3 209.54,-45.57 200.29,-40.4 199.09,-47.3"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.43,-21.25C184.22,-19.72 193.16,-18.16 201.41,-16.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.8,-20.2 211.04,-15.03 200.59,-13.31 201.8,-20.2"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map b/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map
deleted file mode 100644
index c82446a6c..000000000
--- a/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,33,55,59"/>
-<area shape="rect" id="Node000002" href="$dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,33,146,59"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,43,87,43,87,49,55,49"/>
-<area shape="rect" id="Node000003" href="$d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309" title="Babylonian methods is an iterative function which returns square root of radicand." alt="" coords="194,26,336,66"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="147,43,178,43,178,49,147,49"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="384,6,457,32"/>
-<area shape="poly" id="edge5_Node000002_Node000004" title=" " alt="" coords="145,31,168,20,193,11,240,4,287,3,369,9,369,14,287,8,240,10,195,16,170,25,148,36"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="386,60,455,85"/>
-<area shape="poly" id="edge6_Node000002_Node000005" title=" " alt="" coords="148,56,170,67,195,75,241,82,287,84,370,78,371,83,288,89,240,87,193,80,168,72,145,61"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="336,31,369,25,369,31,337,36"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="337,56,372,62,371,67,336,61"/>
-</map>
diff --git a/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5 b/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
deleted file mode 100644
index 51b98d44a..000000000
--- a/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-46be0b0c238595f958fed6afd4898473
\ No newline at end of file
diff --git a/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg b/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
deleted file mode 100644
index 2f61bc824..000000000
--- a/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg
+++ /dev/null
@@ -1,138 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="347pt" height="69pt"
- viewBox="0.00 0.00 346.50 68.85" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64.85)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-40.06 0,-40.06 0,-20.81 37,-20.81 37,-40.06"/>
-<text text-anchor="middle" x="18.5" y="-26.56" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-40.06 73,-40.06 73,-20.81 105.5,-20.81 105.5,-40.06"/>
-<text text-anchor="middle" x="89.25" y="-26.56" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-30.43C44.58,-30.43 53.31,-30.43 61.45,-30.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-33.93 71.2,-30.43 61.2,-26.93 61.2,-33.93"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309" target="_top" xlink:title="Babylonian methods is an iterative function which returns square root of radicand.">
-<polygon fill="white" stroke="#666666" points="248.25,-45.68 141.5,-45.68 141.5,-15.18 248.25,-15.18 248.25,-45.68"/>
-<text text-anchor="start" x="149.5" y="-32.18" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="194.88" y="-20.93" font-family="Helvetica,sans-Serif" font-size="10.00">babylonian_method</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.99,-30.43C112.68,-30.43 120.96,-30.43 129.74,-30.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.53,-33.93 139.53,-30.43 129.53,-26.93 129.53,-33.93"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="338.5,-60.06 284.25,-60.06 284.25,-40.81 338.5,-40.81 338.5,-60.06"/>
-<text text-anchor="middle" x="311.38" y="-46.56" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge5_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge5_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.76,-39.89C115.61,-45.32 128.84,-51.62 141.5,-54.43 185.87,-64.31 238.41,-60.76 272.96,-56.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.01,-59.95 282.46,-55.14 272.08,-53.01 273.01,-59.95"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="337,-20.06 285.75,-20.06 285.75,-0.81 337,-0.81 337,-20.06"/>
-<text text-anchor="middle" x="311.38" y="-6.56" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge6_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge6_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.76,-20.98C115.61,-15.54 128.84,-9.25 141.5,-6.43 186.31,3.54 239.47,-0.18 274,-4.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.52,-8.04 283.9,-5.93 274.47,-1.11 273.52,-8.04"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.43,-39.61C256.63,-41.05 264.96,-42.5 272.74,-43.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.09,-47.3 282.54,-45.57 273.29,-40.4 272.09,-47.3"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.43,-21.25C257.22,-19.72 266.16,-18.16 274.41,-16.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="274.8,-20.2 284.04,-15.03 273.59,-13.31 274.8,-20.2"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg b/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg
deleted file mode 100644
index e6266af82..000000000
--- a/dc/d9c/babylonian__method_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph_org.svg
+++ /dev/null
@@ -1,112 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="347pt" height="69pt"
- viewBox="0.00 0.00 346.50 68.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 64.85)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-40.06 0,-40.06 0,-20.81 37,-20.81 37,-40.06"/>
-<text text-anchor="middle" x="18.5" y="-26.56" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-40.06 73,-40.06 73,-20.81 105.5,-20.81 105.5,-40.06"/>
-<text text-anchor="middle" x="89.25" y="-26.56" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-30.43C44.58,-30.43 53.31,-30.43 61.45,-30.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-33.93 71.2,-30.43 61.2,-26.93 61.2,-33.93"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309" target="_top" xlink:title="Babylonian methods is an iterative function which returns square root of radicand.">
-<polygon fill="white" stroke="#666666" points="248.25,-45.68 141.5,-45.68 141.5,-15.18 248.25,-15.18 248.25,-45.68"/>
-<text text-anchor="start" x="149.5" y="-32.18" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="194.88" y="-20.93" font-family="Helvetica,sans-Serif" font-size="10.00">babylonian_method</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.99,-30.43C112.68,-30.43 120.96,-30.43 129.74,-30.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.53,-33.93 139.53,-30.43 129.53,-26.93 129.53,-33.93"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="338.5,-60.06 284.25,-60.06 284.25,-40.81 338.5,-40.81 338.5,-60.06"/>
-<text text-anchor="middle" x="311.38" y="-46.56" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge5_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge5_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.76,-39.89C115.61,-45.32 128.84,-51.62 141.5,-54.43 185.87,-64.31 238.41,-60.76 272.96,-56.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.01,-59.95 282.46,-55.14 272.08,-53.01 273.01,-59.95"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="337,-20.06 285.75,-20.06 285.75,-0.81 337,-0.81 337,-20.06"/>
-<text text-anchor="middle" x="311.38" y="-6.56" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge6_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge6_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.76,-20.98C115.61,-15.54 128.84,-9.25 141.5,-6.43 186.31,3.54 239.47,-0.18 274,-4.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.52,-8.04 283.9,-5.93 274.47,-1.11 273.52,-8.04"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.43,-39.61C256.63,-41.05 264.96,-42.5 272.74,-43.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.09,-47.3 282.54,-45.57 273.29,-40.4 272.09,-47.3"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.43,-21.25C257.22,-19.72 266.16,-18.16 274.41,-16.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="274.8,-20.2 284.04,-15.03 273.59,-13.31 274.8,-20.2"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/d9c/babylonian__method_8cpp_source.html b/dc/d9c/babylonian__method_8cpp_source.html
new file mode 100644
index 000000000..213ceea96
--- /dev/null
+++ b/dc/d9c/babylonian__method_8cpp_source.html
@@ -0,0 +1,206 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/babylonian_method.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dc/d9c/babylonian__method_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">babylonian_method.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dc/d9c/babylonian__method_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cassert&gt;</span>  </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a> {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="foldopen" id="foldopen00030" data-start="{" data-end="}">
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"><a class="line" href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309">   30</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309">babylonian_method</a>(<span class="keywordtype">double</span> radicand) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordtype">int</span> i = 1;  </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordflow">while</span> (i * i &lt;= radicand) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        i++;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    }</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    i--;  </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordtype">double</span> x0 = i;  </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordtype">double</span> x1 =</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        (radicand / x0 + x0) / 2;  </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordtype">double</span> temp = NAN;             </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">while</span> (std::max(x0, x1) - std::min(x0, x1) &lt; 0.0001) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        temp = (radicand / x1 + x1) / 2;  </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        x0 = x1;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        x1 = temp;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordflow">return</span> x1;  </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>}</div>
+</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>}  <span class="comment">// namespace numerical_methods</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   62</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="comment">/* descriptions of the following test */</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keyword">auto</span> testcase1 = 125348;  </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keyword">auto</span> testcase2 = 752080;  </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keyword">auto</span> real_output1 = 354.045194855;  </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keyword">auto</span> real_output2 = 867.225460881;  </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keyword">auto</span> test_result1 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309">numerical_methods::babylonian_method</a>(testcase1);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keyword">auto</span> test_result2 = <a class="code hl_function" href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309">numerical_methods::babylonian_method</a>(testcase2);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    assert(std::max(test_result1, real_output1) -</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>               std::min(test_result1, real_output1) &lt;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>           0.0001);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    assert(std::max(test_result2, real_output2) -</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>               std::min(test_result2, real_output2) &lt;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>           0.0001);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>}</div>
+</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="foldopen" id="foldopen00096" data-start="{" data-end="}">
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"><a class="line" href="../../dc/d9c/babylonian__method_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089">   96</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> <span class="keyword">const</span> *argv[]) {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <a class="code hl_function" href="../../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">//  run self-test implementations</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>             <span class="comment">//  with 2 defined test cases</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>}</div>
+</div>
+<div class="ttc" id="ababylonian__method_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/d9c/babylonian__method_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> <a href="#l00062">babylonian_method.cpp:62</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacenumerical__methods_html"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacenumerical__methods_html_a28e67885f8606564cc8335f483f63309"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309">numerical_methods::babylonian_method</a></div><div class="ttdeci">double babylonian_method(double radicand)</div><div class="ttdoc">Babylonian methods is an iterative function which returns square root of radicand.</div><div class="ttdef"><b>Definition</b> <a href="#l00030">babylonian_method.cpp:30</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../dc/d9c/babylonian__method_8cpp.html">babylonian_method.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dc/d9f/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list-members.html b/dc/d9f/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list-members.html
index 8bb334f6a..f85d79629 100644
--- a/dc/d9f/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list-members.html
+++ b/dc/d9f/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dc/daa/lru__cache2_8cpp.html b/dc/daa/lru__cache2_8cpp.html
index b9cbdbc14..79d3eed6b 100644
--- a/dc/daa/lru__cache2_8cpp.html
+++ b/dc/daa/lru__cache2_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/lru_cache2.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/lru_cache2.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for lru_cache2.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d89/lru__cache2_8cpp__incl.svg" width="390" height="111"><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">
+</div>
+<p><a href="../../dc/daa/lru__cache2_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node&lt; T &gt;</a></td></tr>
@@ -157,6 +176,8 @@ Functions</h2></td></tr>
 <p>unordered_map maps the key to the address of the node of the linked list. If the element is accessed, the element is moved to the beginning of the linked list.</p>
 <p>When the cache is full, the last element in the linked list is popped.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/deDSeC00720" target="_blank">Karan Sharma</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -175,17 +196,14 @@ Functions</h2></td></tr>
 
 <p>main function </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html#l00274">274</a> of file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  274</span>           {</div>
 <div class="line"><span class="lineno">  275</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run the self test implementation</span></div>
 <div class="line"><span class="lineno">  276</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  277</span>}</div>
-<div class="ttc" id="alru__cache2_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">self test implementations</div><div class="ttdef"><b>Definition</b> lru_cache2.cpp:220</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="560"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="alru__cache2_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">self test implementations</div><div class="ttdef"><b>Definition</b> <a href="../../dc/daa/lru__cache2_8cpp_source.html#l00220">lru_cache2.cpp:220</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -213,6 +231,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html#l00220">220</a> of file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  220</span>                   {</div>
 <div class="line"><span class="lineno">  221</span>    <a class="code hl_class" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache&lt;int, int&gt;</a> cache(5);</div>
 <div class="line"><span class="lineno">  222</span> </div>
@@ -249,8 +269,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  253</span>    <span class="comment">// when 6 was added</span></div>
 <div class="line"><span class="lineno">  254</span>    <span class="keywordflow">try</span> {</div>
 <div class="line"><span class="lineno">  255</span>        cache.get(1);</div>
-<div class="line"><span class="lineno">  256</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/runtime_error.html">std::runtime_error</a> &amp;e) {</div>
-<div class="line"><span class="lineno">  257</span>        assert(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>(e.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/exception/what.html">what</a>()) == <span class="stringliteral">&quot;key is not present in the cache&quot;</span>);</div>
+<div class="line"><span class="lineno">  256</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::runtime_error &amp;e) {</div>
+<div class="line"><span class="lineno">  257</span>        assert(std::string(e.what()) == <span class="stringliteral">&quot;key is not present in the cache&quot;</span>);</div>
 <div class="line"><span class="lineno">  258</span>    }</div>
 <div class="line"><span class="lineno">  259</span> </div>
 <div class="line"><span class="lineno">  260</span>    <span class="comment">// test retrieval of all items in the cache</span></div>
@@ -260,19 +280,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  264</span>    assert(cache.get(5) == -50);</div>
 <div class="line"><span class="lineno">  265</span>    assert(cache.get(6) == 60);</div>
 <div class="line"><span class="lineno">  266</span> </div>
-<div class="line"><span class="lineno">  267</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;test - passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  267</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test - passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  268</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="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html"><div class="ttname"><a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache</a></div><div class="ttdoc">LRUCache.</div><div class="ttdef"><b>Definition</b> lru_cache2.cpp:61</div></div>
-<div class="ttc" id="aruntime_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/runtime_error.html">std::runtime_error</a></div></div>
-<div class="ttc" id="awhat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/exception/what.html">std::runtime_error::what</a></div><div class="ttdeci">T what(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="560"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html"><div class="ttname"><a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache</a></div><div class="ttdoc">LRUCache.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/daa/lru__cache2_8cpp_source.html#l00061">lru_cache2.cpp:61</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index ef772fbcd..000000000
--- a/dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,23 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="self test implementations" alt="" coords="5,161,49,186"/>
-<area shape="rect" id="Node000002" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a" title="Returns the total capacity of the cache." alt="" coords="110,5,286,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="30,159,53,110,71,81,95,57,102,52,105,56,98,61,76,85,57,112,35,161"/>
-<area shape="rect" id="Node000003" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e" title="returns whether the cache is empty or not" alt="" coords="110,71,286,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="41,158,66,139,95,121,107,115,109,120,98,125,69,144,45,163"/>
-<area shape="rect" id="Node000004" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea" title="get the value of the key&#45;value pair if exists" alt="" coords="97,136,299,161"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,168,92,161,93,167,50,173"/>
-<area shape="rect" id="Node000007" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45" title="upsert a key&#45;value pair" alt="" coords="97,185,299,210"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="50,174,88,179,87,185,49,179"/>
-<area shape="rect" id="Node000009" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1" title="Returns the number of items present in the cache." alt="" coords="110,235,286,275"/>
-<area shape="poly" id="edge10_Node000001_Node000009" title=" " alt="" coords="45,185,69,203,98,221,110,226,107,231,95,225,66,208,42,189"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/error/exception/what.html#" title=" " alt="" coords="136,300,260,341"/>
-<area shape="poly" id="edge11_Node000001_Node000010" title=" " alt="" coords="35,186,58,234,76,261,98,285,124,300,121,305,95,289,71,265,53,237,30,188"/>
-<area shape="rect" id="Node000005" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" title="move the existing node in the list to the beginning of the list." alt="" coords="347,124,523,165"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="299,144,331,143,331,149,299,149"/>
-<area shape="rect" id="Node000006" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" title="push the node to the front of the linked list." alt="" coords="571,153,748,194"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="524,153,556,157,555,163,523,158"/>
-<area shape="poly" id="edge7_Node000007_Node000005" title=" " alt="" coords="258,182,331,165,333,170,259,187"/>
-<area shape="poly" id="edge9_Node000007_Node000006" title=" " alt="" coords="299,190,556,176,556,182,299,195"/>
-<area shape="rect" id="Node000008" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7" title="pop the last node in the linked list." alt="" coords="347,239,523,279"/>
-<area shape="poly" id="edge8_Node000007_Node000008" title=" " alt="" coords="253,209,300,220,342,232,341,237,298,226,252,214"/>
-</map>
diff --git a/dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 39bfb0596..000000000
--- a/dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-97c1ae9df20c10d14b9ce242561c8cd9
\ No newline at end of file
diff --git a/dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 3ef1f5837..000000000
--- a/dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,291 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<!--zoomable 260 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 565;
-var viewHeight = 260;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="self test implementations">
-<polygon fill="#999999" stroke="#666666" points="32.5,-134.88 0,-134.88 0,-115.62 32.5,-115.62 32.5,-134.88"/>
-<text text-anchor="middle" x="16.25" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a" target="_top" xlink:title="Returns the total capacity of the cache.">
-<polygon fill="white" stroke="#666666" points="210.5,-251.5 78.25,-251.5 78.25,-221 210.5,-221 210.5,-251.5"/>
-<text text-anchor="start" x="86.25" y="-238" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="144.38" y="-226.75" font-family="Helvetica,sans-Serif" font-size="10.00">::capacity</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.58,-135.32C27.01,-153.2 42.78,-190.54 68.5,-211.25 70.18,-212.6 71.94,-213.89 73.76,-215.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.57,-217.87 81.97,-219.86 75.07,-211.82 71.57,-217.87"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e" target="_top" xlink:title="returns whether the cache is empty or not">
-<polygon fill="white" stroke="#666666" points="210.5,-202.5 78.25,-202.5 78.25,-172 210.5,-172 210.5,-202.5"/>
-<text text-anchor="start" x="86.25" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="144.38" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.34,-135.16C38.26,-143.61 53.52,-155.56 68.5,-163.25 71.2,-164.63 73.99,-165.96 76.84,-167.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.37,-170.4 85.95,-170.97 78.03,-163.93 75.37,-170.4"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea" target="_top" xlink:title="get the value of the key&#45;value pair if exists">
-<polygon fill="white" stroke="#666666" points="220.25,-153.88 68.5,-153.88 68.5,-134.62 220.25,-134.62 220.25,-153.88"/>
-<text text-anchor="middle" x="144.38" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::get</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.97,-127.62C41.56,-128.91 52.92,-130.62 65.09,-132.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.52,-135.91 74.93,-133.94 65.56,-128.99 64.52,-135.91"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45" target="_top" xlink:title="upsert a key&#45;value pair">
-<polygon fill="white" stroke="#666666" points="220.25,-116.88 68.5,-116.88 68.5,-97.62 220.25,-97.62 220.25,-116.88"/>
-<text text-anchor="middle" x="144.38" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::put</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.97,-123.01C40.74,-121.9 50.78,-120.46 61.63,-118.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.8,-122.43 71.2,-117.55 60.81,-115.5 61.8,-122.43"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1" target="_top" xlink:title="Returns the number of items present in the cache.">
-<polygon fill="white" stroke="#666666" points="210.5,-79.5 78.25,-79.5 78.25,-49 210.5,-49 210.5,-79.5"/>
-<text text-anchor="start" x="86.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="144.38" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge10_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge10_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.78,-115.29C38.74,-107.1 53.81,-95.67 68.5,-88.25 71.36,-86.81 74.32,-85.43 77.34,-84.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.43,-87.45 86.38,-80.45 75.8,-80.96 78.43,-87.45"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="190.62,-30.5 98.12,-30.5 98.12,0 190.62,0 190.62,-30.5"/>
-<text text-anchor="start" x="106.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::runtime_error</text>
-<text text-anchor="middle" x="144.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::what</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge11_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.62,-115.29C27.09,-97.62 42.94,-60.72 68.5,-40.25 74.25,-35.65 80.89,-31.87 87.78,-28.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.59,-32.23 96.59,-25.29 86.01,-25.72 88.59,-32.23"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" target="_top" xlink:title="move the existing node in the list to the beginning of the list.">
-<polygon fill="white" stroke="#666666" points="388.5,-162.5 256.25,-162.5 256.25,-132 388.5,-132 388.5,-162.5"/>
-<text text-anchor="start" x="264.25" y="-149" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="322.38" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.53,-145.53C228.43,-145.67 236.49,-145.8 244.42,-145.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.34,-149.44 254.4,-146.11 244.46,-142.44 244.34,-149.44"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
-<polygon fill="white" stroke="#666666" points="556.75,-140.5 424.5,-140.5 424.5,-110 556.75,-110 556.75,-140.5"/>
-<text text-anchor="start" x="432.5" y="-127" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="490.62" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M388.6,-138.62C396.52,-137.57 404.66,-136.49 412.72,-135.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="413.08,-138.91 422.54,-134.13 412.16,-131.97 413.08,-138.91"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge7_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge7_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.79,-117.34C206.56,-121.16 226.15,-125.61 245.02,-129.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.02,-133.26 254.54,-132.06 245.57,-126.43 244.02,-133.26"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge9_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge9_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.5,-111.18C277.53,-114.16 355.66,-118.25 413.05,-121.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="412.55,-124.72 422.72,-121.75 412.92,-117.73 412.55,-124.72"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7" target="_top" xlink:title="pop the last node in the linked list.">
-<polygon fill="white" stroke="#666666" points="388.5,-76.5 256.25,-76.5 256.25,-46 388.5,-46 388.5,-76.5"/>
-<text text-anchor="start" x="264.25" y="-63" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="322.38" y="-51.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge8_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.42,-97.19C196.69,-94.33 208.96,-91.19 220.25,-88.25 230.56,-85.57 241.45,-82.69 252.12,-79.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="252.89,-83.28 261.66,-77.33 251.09,-76.51 252.89,-83.28"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 2dbd8436e..000000000
--- a/dc/daa/lru__cache2_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,208 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="565pt" height="260pt"
- viewBox="0.00 0.00 564.75 259.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 255.5)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="self test implementations">
-<polygon fill="#999999" stroke="#666666" points="32.5,-134.88 0,-134.88 0,-115.62 32.5,-115.62 32.5,-134.88"/>
-<text text-anchor="middle" x="16.25" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a" target="_top" xlink:title="Returns the total capacity of the cache.">
-<polygon fill="white" stroke="#666666" points="210.5,-251.5 78.25,-251.5 78.25,-221 210.5,-221 210.5,-251.5"/>
-<text text-anchor="start" x="86.25" y="-238" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="144.38" y="-226.75" font-family="Helvetica,sans-Serif" font-size="10.00">::capacity</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.58,-135.32C27.01,-153.2 42.78,-190.54 68.5,-211.25 70.18,-212.6 71.94,-213.89 73.76,-215.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.57,-217.87 81.97,-219.86 75.07,-211.82 71.57,-217.87"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e" target="_top" xlink:title="returns whether the cache is empty or not">
-<polygon fill="white" stroke="#666666" points="210.5,-202.5 78.25,-202.5 78.25,-172 210.5,-172 210.5,-202.5"/>
-<text text-anchor="start" x="86.25" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="144.38" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.34,-135.16C38.26,-143.61 53.52,-155.56 68.5,-163.25 71.2,-164.63 73.99,-165.96 76.84,-167.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.37,-170.4 85.95,-170.97 78.03,-163.93 75.37,-170.4"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea" target="_top" xlink:title="get the value of the key&#45;value pair if exists">
-<polygon fill="white" stroke="#666666" points="220.25,-153.88 68.5,-153.88 68.5,-134.62 220.25,-134.62 220.25,-153.88"/>
-<text text-anchor="middle" x="144.38" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::get</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.97,-127.62C41.56,-128.91 52.92,-130.62 65.09,-132.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.52,-135.91 74.93,-133.94 65.56,-128.99 64.52,-135.91"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45" target="_top" xlink:title="upsert a key&#45;value pair">
-<polygon fill="white" stroke="#666666" points="220.25,-116.88 68.5,-116.88 68.5,-97.62 220.25,-97.62 220.25,-116.88"/>
-<text text-anchor="middle" x="144.38" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::put</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.97,-123.01C40.74,-121.9 50.78,-120.46 61.63,-118.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.8,-122.43 71.2,-117.55 60.81,-115.5 61.8,-122.43"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1" target="_top" xlink:title="Returns the number of items present in the cache.">
-<polygon fill="white" stroke="#666666" points="210.5,-79.5 78.25,-79.5 78.25,-49 210.5,-49 210.5,-79.5"/>
-<text text-anchor="start" x="86.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="144.38" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge10_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge10_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.78,-115.29C38.74,-107.1 53.81,-95.67 68.5,-88.25 71.36,-86.81 74.32,-85.43 77.34,-84.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.43,-87.45 86.38,-80.45 75.8,-80.96 78.43,-87.45"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="190.62,-30.5 98.12,-30.5 98.12,0 190.62,0 190.62,-30.5"/>
-<text text-anchor="start" x="106.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::runtime_error</text>
-<text text-anchor="middle" x="144.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::what</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge11_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M20.62,-115.29C27.09,-97.62 42.94,-60.72 68.5,-40.25 74.25,-35.65 80.89,-31.87 87.78,-28.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.59,-32.23 96.59,-25.29 86.01,-25.72 88.59,-32.23"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" target="_top" xlink:title="move the existing node in the list to the beginning of the list.">
-<polygon fill="white" stroke="#666666" points="388.5,-162.5 256.25,-162.5 256.25,-132 388.5,-132 388.5,-162.5"/>
-<text text-anchor="start" x="264.25" y="-149" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="322.38" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.53,-145.53C228.43,-145.67 236.49,-145.8 244.42,-145.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.34,-149.44 254.4,-146.11 244.46,-142.44 244.34,-149.44"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
-<polygon fill="white" stroke="#666666" points="556.75,-140.5 424.5,-140.5 424.5,-110 556.75,-110 556.75,-140.5"/>
-<text text-anchor="start" x="432.5" y="-127" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="490.62" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M388.6,-138.62C396.52,-137.57 404.66,-136.49 412.72,-135.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="413.08,-138.91 422.54,-134.13 412.16,-131.97 413.08,-138.91"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge7_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge7_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.79,-117.34C206.56,-121.16 226.15,-125.61 245.02,-129.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.02,-133.26 254.54,-132.06 245.57,-126.43 244.02,-133.26"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node6 -->
-<g id="edge9_Node000007_Node000006" class="edge">
-<title>Node7&#45;&gt;Node6</title>
-<g id="a_edge9_Node000007_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M220.5,-111.18C277.53,-114.16 355.66,-118.25 413.05,-121.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="412.55,-124.72 422.72,-121.75 412.92,-117.73 412.55,-124.72"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7" target="_top" xlink:title="pop the last node in the linked list.">
-<polygon fill="white" stroke="#666666" points="388.5,-76.5 256.25,-76.5 256.25,-46 388.5,-46 388.5,-76.5"/>
-<text text-anchor="start" x="264.25" y="-63" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="322.38" y="-51.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge8_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.42,-97.19C196.69,-94.33 208.96,-91.19 220.25,-88.25 230.56,-85.57 241.45,-82.69 252.12,-79.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="252.89,-83.28 261.66,-77.33 251.09,-76.51 252.89,-83.28"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index f5add5a10..000000000
--- a/dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,25 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="main function" alt="" coords="5,161,55,186"/>
-<area shape="rect" id="Node000002" href="$dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="self test implementations" alt="" coords="103,161,146,186"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,171,87,171,87,176,55,176"/>
-<area shape="rect" id="Node000003" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a" title="Returns the total capacity of the cache." alt="" coords="207,5,383,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="128,159,150,110,169,81,192,57,199,52,203,56,196,61,173,85,155,112,133,161"/>
-<area shape="rect" id="Node000004" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e" title="returns whether the cache is empty or not" alt="" coords="207,71,383,111"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="139,158,163,139,193,121,204,115,206,120,195,125,166,144,142,163"/>
-<area shape="rect" id="Node000005" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea" title="get the value of the key&#45;value pair if exists" alt="" coords="194,136,396,161"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="146,168,189,161,190,167,147,173"/>
-<area shape="rect" id="Node000008" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45" title="upsert a key&#45;value pair" alt="" coords="194,185,396,210"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="147,174,185,179,184,185,146,179"/>
-<area shape="rect" id="Node000010" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1" title="Returns the number of items present in the cache." alt="" coords="207,235,383,275"/>
-<area shape="poly" id="edge11_Node000002_Node000010" title=" " alt="" coords="143,185,167,203,195,221,207,226,205,231,193,225,164,208,139,189"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/error/exception/what.html#" title=" " alt="" coords="234,300,357,341"/>
-<area shape="poly" id="edge12_Node000002_Node000011" title=" " alt="" coords="133,186,155,234,173,261,196,285,221,300,218,305,192,289,169,265,150,237,128,188"/>
-<area shape="rect" id="Node000006" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" title="move the existing node in the list to the beginning of the list." alt="" coords="444,124,621,165"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="397,144,429,143,429,149,397,149"/>
-<area shape="rect" id="Node000007" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" title="push the node to the front of the linked list." alt="" coords="669,153,845,194"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="621,153,653,157,653,163,620,158"/>
-<area shape="poly" id="edge8_Node000008_Node000006" title=" " alt="" coords="355,182,429,165,430,170,356,187"/>
-<area shape="poly" id="edge10_Node000008_Node000007" title=" " alt="" coords="397,190,653,176,654,182,397,195"/>
-<area shape="rect" id="Node000009" href="$d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7" title="pop the last node in the linked list." alt="" coords="444,239,621,279"/>
-<area shape="poly" id="edge9_Node000008_Node000009" title=" " alt="" coords="351,209,397,220,440,232,438,237,396,226,349,214"/>
-</map>
diff --git a/dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 20f438740..000000000
--- a/dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-70630744275453827fd653376a53c592
\ No newline at end of file
diff --git a/dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index f809cad02..000000000
--- a/dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,309 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 260 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 638;
-var viewHeight = 260;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-134.88 0,-134.88 0,-115.62 37,-115.62 37,-134.88"/>
-<text text-anchor="middle" x="18.5" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="self test implementations">
-<polygon fill="white" stroke="#666666" points="105.5,-134.88 73,-134.88 73,-115.62 105.5,-115.62 105.5,-134.88"/>
-<text text-anchor="middle" x="89.25" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-125.25C44.58,-125.25 53.31,-125.25 61.45,-125.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-128.75 71.2,-125.25 61.2,-121.75 61.2,-128.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a" target="_top" xlink:title="Returns the total capacity of the cache.">
-<polygon fill="white" stroke="#666666" points="283.5,-251.5 151.25,-251.5 151.25,-221 283.5,-221 283.5,-251.5"/>
-<text text-anchor="start" x="159.25" y="-238" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="217.38" y="-226.75" font-family="Helvetica,sans-Serif" font-size="10.00">::capacity</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.58,-135.32C100.01,-153.2 115.78,-190.54 141.5,-211.25 143.18,-212.6 144.94,-213.89 146.76,-215.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.57,-217.87 154.97,-219.86 148.07,-211.82 144.57,-217.87"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e" target="_top" xlink:title="returns whether the cache is empty or not">
-<polygon fill="white" stroke="#666666" points="283.5,-202.5 151.25,-202.5 151.25,-172 283.5,-172 283.5,-202.5"/>
-<text text-anchor="start" x="159.25" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="217.38" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.34,-135.16C111.26,-143.61 126.52,-155.56 141.5,-163.25 144.2,-164.63 146.99,-165.96 149.84,-167.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.37,-170.4 158.95,-170.97 151.03,-163.93 148.37,-170.4"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea" target="_top" xlink:title="get the value of the key&#45;value pair if exists">
-<polygon fill="white" stroke="#666666" points="293.25,-153.88 141.5,-153.88 141.5,-134.62 293.25,-134.62 293.25,-153.88"/>
-<text text-anchor="middle" x="217.38" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::get</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.97,-127.62C114.56,-128.91 125.92,-130.62 138.09,-132.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.52,-135.91 147.93,-133.94 138.56,-128.99 137.52,-135.91"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45" target="_top" xlink:title="upsert a key&#45;value pair">
-<polygon fill="white" stroke="#666666" points="293.25,-116.88 141.5,-116.88 141.5,-97.62 293.25,-97.62 293.25,-116.88"/>
-<text text-anchor="middle" x="217.38" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::put</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.97,-123.01C113.74,-121.9 123.78,-120.46 134.63,-118.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.8,-122.43 144.2,-117.55 133.81,-115.5 134.8,-122.43"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1" target="_top" xlink:title="Returns the number of items present in the cache.">
-<polygon fill="white" stroke="#666666" points="283.5,-79.5 151.25,-79.5 151.25,-49 283.5,-49 283.5,-79.5"/>
-<text text-anchor="start" x="159.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="217.38" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge11_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge11_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.78,-115.29C111.74,-107.1 126.81,-95.67 141.5,-88.25 144.36,-86.81 147.32,-85.43 150.34,-84.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.43,-87.45 159.38,-80.45 148.8,-80.96 151.43,-87.45"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263.62,-30.5 171.12,-30.5 171.12,0 263.62,0 263.62,-30.5"/>
-<text text-anchor="start" x="179.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::runtime_error</text>
-<text text-anchor="middle" x="217.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::what</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge12_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge12_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.62,-115.29C100.09,-97.62 115.94,-60.72 141.5,-40.25 147.25,-35.65 153.89,-31.87 160.78,-28.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.59,-32.23 169.59,-25.29 159.01,-25.72 161.59,-32.23"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" target="_top" xlink:title="move the existing node in the list to the beginning of the list.">
-<polygon fill="white" stroke="#666666" points="461.5,-162.5 329.25,-162.5 329.25,-132 461.5,-132 461.5,-162.5"/>
-<text text-anchor="start" x="337.25" y="-149" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="395.38" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.53,-145.53C301.43,-145.67 309.49,-145.8 317.42,-145.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.34,-149.44 327.4,-146.11 317.46,-142.44 317.34,-149.44"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
-<polygon fill="white" stroke="#666666" points="629.75,-140.5 497.5,-140.5 497.5,-110 629.75,-110 629.75,-140.5"/>
-<text text-anchor="start" x="505.5" y="-127" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="563.62" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M461.6,-138.62C469.52,-137.57 477.66,-136.49 485.72,-135.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="486.08,-138.91 495.54,-134.13 485.16,-131.97 486.08,-138.91"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge8_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge8_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.79,-117.34C279.56,-121.16 299.15,-125.61 318.02,-129.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.02,-133.26 327.54,-132.06 318.57,-126.43 317.02,-133.26"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge10_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge10_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.5,-111.18C350.53,-114.16 428.66,-118.25 486.05,-121.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="485.55,-124.72 495.72,-121.75 485.92,-117.73 485.55,-124.72"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7" target="_top" xlink:title="pop the last node in the linked list.">
-<polygon fill="white" stroke="#666666" points="461.5,-76.5 329.25,-76.5 329.25,-46 461.5,-46 461.5,-76.5"/>
-<text text-anchor="start" x="337.25" y="-63" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="395.38" y="-51.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge9_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.42,-97.19C269.69,-94.33 281.96,-91.19 293.25,-88.25 303.56,-85.57 314.45,-82.69 325.12,-79.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.89,-83.28 334.66,-77.33 324.09,-76.51 325.89,-83.28"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index aab4efffc..000000000
--- a/dc/daa/lru__cache2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,226 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="638pt" height="260pt"
- viewBox="0.00 0.00 637.75 259.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 255.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-134.88 0,-134.88 0,-115.62 37,-115.62 37,-134.88"/>
-<text text-anchor="middle" x="18.5" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="self test implementations">
-<polygon fill="white" stroke="#666666" points="105.5,-134.88 73,-134.88 73,-115.62 105.5,-115.62 105.5,-134.88"/>
-<text text-anchor="middle" x="89.25" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-125.25C44.58,-125.25 53.31,-125.25 61.45,-125.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-128.75 71.2,-125.25 61.2,-121.75 61.2,-128.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a" target="_top" xlink:title="Returns the total capacity of the cache.">
-<polygon fill="white" stroke="#666666" points="283.5,-251.5 151.25,-251.5 151.25,-221 283.5,-221 283.5,-251.5"/>
-<text text-anchor="start" x="159.25" y="-238" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="217.38" y="-226.75" font-family="Helvetica,sans-Serif" font-size="10.00">::capacity</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.58,-135.32C100.01,-153.2 115.78,-190.54 141.5,-211.25 143.18,-212.6 144.94,-213.89 146.76,-215.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.57,-217.87 154.97,-219.86 148.07,-211.82 144.57,-217.87"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e" target="_top" xlink:title="returns whether the cache is empty or not">
-<polygon fill="white" stroke="#666666" points="283.5,-202.5 151.25,-202.5 151.25,-172 283.5,-172 283.5,-202.5"/>
-<text text-anchor="start" x="159.25" y="-189" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="217.38" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.34,-135.16C111.26,-143.61 126.52,-155.56 141.5,-163.25 144.2,-164.63 146.99,-165.96 149.84,-167.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.37,-170.4 158.95,-170.97 151.03,-163.93 148.37,-170.4"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea" target="_top" xlink:title="get the value of the key&#45;value pair if exists">
-<polygon fill="white" stroke="#666666" points="293.25,-153.88 141.5,-153.88 141.5,-134.62 293.25,-134.62 293.25,-153.88"/>
-<text text-anchor="middle" x="217.38" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::get</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.97,-127.62C114.56,-128.91 125.92,-130.62 138.09,-132.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.52,-135.91 147.93,-133.94 138.56,-128.99 137.52,-135.91"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45" target="_top" xlink:title="upsert a key&#45;value pair">
-<polygon fill="white" stroke="#666666" points="293.25,-116.88 141.5,-116.88 141.5,-97.62 293.25,-97.62 293.25,-116.88"/>
-<text text-anchor="middle" x="217.38" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache::put</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.97,-123.01C113.74,-121.9 123.78,-120.46 134.63,-118.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.8,-122.43 144.2,-117.55 133.81,-115.5 134.8,-122.43"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1" target="_top" xlink:title="Returns the number of items present in the cache.">
-<polygon fill="white" stroke="#666666" points="283.5,-79.5 151.25,-79.5 151.25,-49 283.5,-49 283.5,-79.5"/>
-<text text-anchor="start" x="159.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="217.38" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge11_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge11_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.78,-115.29C111.74,-107.1 126.81,-95.67 141.5,-88.25 144.36,-86.81 147.32,-85.43 150.34,-84.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.43,-87.45 159.38,-80.45 148.8,-80.96 151.43,-87.45"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/error/exception/what.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="263.62,-30.5 171.12,-30.5 171.12,0 263.62,0 263.62,-30.5"/>
-<text text-anchor="start" x="179.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::runtime_error</text>
-<text text-anchor="middle" x="217.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::what</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge12_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge12_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.62,-115.29C100.09,-97.62 115.94,-60.72 141.5,-40.25 147.25,-35.65 153.89,-31.87 160.78,-28.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.59,-32.23 169.59,-25.29 159.01,-25.72 161.59,-32.23"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4" target="_top" xlink:title="move the existing node in the list to the beginning of the list.">
-<polygon fill="white" stroke="#666666" points="461.5,-162.5 329.25,-162.5 329.25,-132 461.5,-132 461.5,-162.5"/>
-<text text-anchor="start" x="337.25" y="-149" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="395.38" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">::make_recent</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.53,-145.53C301.43,-145.67 309.49,-145.8 317.42,-145.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.34,-149.44 327.4,-146.11 317.46,-142.44 317.34,-149.44"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2" target="_top" xlink:title="push the node to the front of the linked list.">
-<polygon fill="white" stroke="#666666" points="629.75,-140.5 497.5,-140.5 497.5,-110 629.75,-110 629.75,-140.5"/>
-<text text-anchor="start" x="505.5" y="-127" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="563.62" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push_front</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M461.6,-138.62C469.52,-137.57 477.66,-136.49 485.72,-135.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="486.08,-138.91 495.54,-134.13 485.16,-131.97 486.08,-138.91"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge8_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge8_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.79,-117.34C279.56,-121.16 299.15,-125.61 318.02,-129.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.02,-133.26 327.54,-132.06 318.57,-126.43 317.02,-133.26"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge10_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge10_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.5,-111.18C350.53,-114.16 428.66,-118.25 486.05,-121.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="485.55,-124.72 495.72,-121.75 485.92,-117.73 485.55,-124.72"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7" target="_top" xlink:title="pop the last node in the linked list.">
-<polygon fill="white" stroke="#666666" points="461.5,-76.5 329.25,-76.5 329.25,-46 461.5,-46 461.5,-76.5"/>
-<text text-anchor="start" x="337.25" y="-63" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LRUCache</text>
-<text text-anchor="middle" x="395.38" y="-51.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pop_back</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge9_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M258.42,-97.19C269.69,-94.33 281.96,-91.19 293.25,-88.25 303.56,-85.57 314.45,-82.69 325.12,-79.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.89,-83.28 334.66,-77.33 324.09,-76.51 325.89,-83.28"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/daa/lru__cache2_8cpp_source.html b/dc/daa/lru__cache2_8cpp_source.html
new file mode 100644
index 000000000..bd5ad732c
--- /dev/null
+++ b/dc/daa/lru__cache2_8cpp_source.html
@@ -0,0 +1,371 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/lru_cache2.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dc/daa/lru__cache2_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">lru_cache2.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dc/daa/lru__cache2_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;cassert&gt;</span>        <span class="comment">// for assert</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cstdint&gt;</span>        <span class="comment">// for std::uint32_t</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;iostream&gt;</span>       <span class="comment">// for std::cout</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;unordered_map&gt;</span>  <span class="comment">// for std::unordered_map</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/d6f/namespaceothers.html">others</a> {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keyword">namespace </span>Cache {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00042" data-start="{" data-end="};">
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">   42</a></span><span class="keyword">class </span><a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a> {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    T <a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>;           </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node&lt;T&gt;</a> *<a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5">prev</a>;  </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node&lt;T&gt;</a> *<a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd">next</a>;  </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keyword">explicit</span> <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a>(T <a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>) : <a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>(<a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>), <a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5">prev</a>(<span class="keyword">nullptr</span>), <a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd">next</a>(<span class="keyword">nullptr</span>) {}</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>};</div>
+</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> K, <span class="keyword">typename</span> V&gt;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="keyword">using </span><a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a> = <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node&lt;std::pair&lt;K, V&gt;</a>&gt;;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> K, <span class="keyword">typename</span> V&gt;</div>
+<div class="foldopen" id="foldopen00061" data-start="{" data-end="};">
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"><a class="line" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">   61</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">LRUCache</a> {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821">   62</a></span>    <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a> *<a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821">head</a>;    </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"><a class="line" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100">   63</a></span>    <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a> *<a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100">tail</a>;    </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af34bb8b8eaa34cc499b4fed30b9d05fc">   64</a></span>    std::uint32_t <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af34bb8b8eaa34cc499b4fed30b9d05fc">_capacity</a>;  </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    std::unordered_map&lt;K, CacheNode&lt;K, V&gt; *&gt;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5">   67</a></span>        <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5">node_map</a>;  </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00075" data-start="{" data-end="}">
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f">   75</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f">LRUCache</a>(<span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af34bb8b8eaa34cc499b4fed30b9d05fc">_capacity</a>)</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        : <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821">head</a>(nullptr), <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100">tail</a>(nullptr), <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af34bb8b8eaa34cc499b4fed30b9d05fc">_capacity</a>(<a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af34bb8b8eaa34cc499b4fed30b9d05fc">_capacity</a>) {}</div>
+</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> <span class="keyword">private</span>:</div>
+<div class="foldopen" id="foldopen00083" data-start="{" data-end="}">
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"><a class="line" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2">   83</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2">push_front</a>(<a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a> *node_ptr) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        <span class="keywordflow">if</span> (!<a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821">head</a>) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>            <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821">head</a> = node_ptr;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100">tail</a> = node_ptr;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        node_ptr-&gt;<a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd">next</a> = <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821">head</a>;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821">head</a>-&gt;prev = node_ptr;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821">head</a> = node_ptr;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    }</div>
+</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="foldopen" id="foldopen00099" data-start="{" data-end="}">
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"><a class="line" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4">   99</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4">make_recent</a>(<a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a> *node_ptr) {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821">head</a> == node_ptr) {</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        }</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a> *prev = node_ptr-&gt;<a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5">prev</a>;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a> *next = node_ptr-&gt;<a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd">next</a>;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        prev-&gt;<a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd">next</a> = next;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <span class="keywordflow">if</span> (next) {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            next-&gt;<a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5">prev</a> = prev;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>            <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100">tail</a> = prev;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        }</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        node_ptr-&gt;<a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5">prev</a> = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        node_ptr-&gt;<a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd">next</a> = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        <a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2">push_front</a>(node_ptr);</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    }</div>
+</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="foldopen" id="foldopen00122" data-start="{" data-end="}">
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"><a class="line" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7">  122</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7">pop_back</a>() {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        <span class="keywordflow">if</span> (!<a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821">head</a>) {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        }</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821">head</a> == <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100">tail</a>) {</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>            <span class="keyword">delete</span> <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821">head</a>;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>            <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821">head</a> = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>            <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100">tail</a> = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        }</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a> *temp = <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100">tail</a>;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>        <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100">tail</a> = <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100">tail</a>-&gt;<a class="code hl_variable" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5">prev</a>;</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>        <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100">tail</a>-&gt;next = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        <span class="keyword">delete</span> temp;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    }</div>
+</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00145" data-start="{" data-end="}">
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"><a class="line" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45">  145</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45">put</a>(K key, V value) {</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        <span class="comment">// update the value if key already exists</span></div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5">node_map</a>.count(key)) {</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>            <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5">node_map</a>[key]-&gt;data.second = value;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>            <a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4">make_recent</a>(<a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5">node_map</a>[key]);</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>        }</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span> </div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>        <span class="comment">// if the cache is full</span></div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        <span class="comment">// remove the least recently used item</span></div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5">node_map</a>.size() == <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af34bb8b8eaa34cc499b4fed30b9d05fc">_capacity</a>) {</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>            <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5">node_map</a>.erase(<a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100">tail</a>-&gt;data.first);</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>            <a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7">pop_back</a>();</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>        }</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span> </div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>        <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a> *newNode = <span class="keyword">new</span> <a class="code hl_class" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode&lt;K, V&gt;</a>({key, value});</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span> </div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5">node_map</a>[key] = newNode;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        <a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2">push_front</a>(newNode);</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    }</div>
+</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span> </div>
+<div class="foldopen" id="foldopen00172" data-start="{" data-end="}">
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"><a class="line" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea">  172</a></span>    V <a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea">get</a>(K key) {</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>        <span class="keywordflow">if</span> (!<a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5">node_map</a>.count(key)) {</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>            <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;key is not present in the cache&quot;</span>);</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>        }</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        <span class="comment">// move node to the beginning of the list</span></div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        V value = <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5">node_map</a>[key]-&gt;data.second;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        <a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4">make_recent</a>(<a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5">node_map</a>[key]);</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        <span class="keywordflow">return</span> value;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    }</div>
+</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span> </div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"><a class="line" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1">  187</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1">size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5">node_map</a>.size(); }</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span> </div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"><a class="line" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a">  193</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a">capacity</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af34bb8b8eaa34cc499b4fed30b9d05fc">_capacity</a>; }</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span> </div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"><a class="line" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e">  199</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e">empty</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5">node_map</a>.empty(); }</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span> </div>
+<div class="foldopen" id="foldopen00205" data-start="{" data-end="}">
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"><a class="line" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a6d855ff72ad6fe548eb564b7f87abe06">  205</a></span>    <a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a6d855ff72ad6fe548eb564b7f87abe06">~LRUCache</a>() {</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>        <span class="keyword">auto</span> it = <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5">node_map</a>.begin();</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>        <span class="keywordflow">while</span> (it != <a class="code hl_variable" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5">node_map</a>.end()) {</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>            <span class="keyword">delete</span> it-&gt;second;</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>            ++it;</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>        }</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    }</div>
+</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>};</div>
+</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>}  <span class="comment">// namespace Cache</span></div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>}  <span class="comment">// namespace others</span></div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span> </div>
+<div class="foldopen" id="foldopen00220" data-start="{" data-end="}">
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"><a class="line" href="../../dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  220</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    <a class="code hl_class" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache&lt;int, int&gt;</a> cache(5);</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span> </div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    <span class="comment">// test the initial state of the cache</span></div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    assert(cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1">size</a>() == 0);</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    assert(cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a">capacity</a>() == 5);</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>    assert(cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e">empty</a>());</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span> </div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    <span class="comment">// test insertion in the cache</span></div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45">put</a>(1, 10);</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45">put</a>(-2, 20);</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span> </div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    <span class="comment">// test the state of cache after inserting some items</span></div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    assert(cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1">size</a>() == 2);</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    assert(cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a">capacity</a>() == 5);</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    assert(!cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e">empty</a>());</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span> </div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    <span class="comment">// test getting items from the cache</span></div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    assert(cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea">get</a>(1) == 10);</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    assert(cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea">get</a>(-2) == 20);</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span> </div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45">put</a>(-3, -30);</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45">put</a>(4, 40);</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45">put</a>(5, -50);</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45">put</a>(6, 60);</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span> </div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    <span class="comment">// test the state after inserting more items than the capacity</span></div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    assert(cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1">size</a>() == 5);</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>    assert(cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a">capacity</a>() == 5);</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    assert(!cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e">empty</a>());</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span> </div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    <span class="comment">// fetching 1 throws runtime_error</span></div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    <span class="comment">// as 1 was evicted being the least recently used</span></div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    <span class="comment">// when 6 was added</span></div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>    <span class="keywordflow">try</span> {</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>        cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea">get</a>(1);</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    } <span class="keywordflow">catch</span> (<span class="keyword">const</span> std::runtime_error &amp;e) {</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>        assert(std::string(e.what()) == <span class="stringliteral">&quot;key is not present in the cache&quot;</span>);</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    }</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span> </div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>    <span class="comment">// test retrieval of all items in the cache</span></div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>    assert(cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea">get</a>(-2) == 20);</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    assert(cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea">get</a>(-3) == -30);</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>    assert(cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea">get</a>(4) == 40);</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>    assert(cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea">get</a>(5) == -50);</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>    assert(cache.<a class="code hl_function" href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea">get</a>(6) == 60);</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span> </div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;test - passed\n&quot;</span>;</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>}</div>
+</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span> </div>
+<div class="foldopen" id="foldopen00274" data-start="{" data-end="}">
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"><a class="line" href="../../dc/daa/lru__cache2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  274</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dc/daa/lru__cache2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    <a class="code hl_function" href="../../dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run the self test implementation</span></div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>}</div>
+</div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_d___node_html"><div class="ttname"><a href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node</a></div><div class="ttdoc">Node for a doubly linked list with data, prev and next pointers.</div><div class="ttdef"><b>Definition</b> <a href="#l00042">lru_cache2.cpp:42</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_d___node_html_a0043eb287c54b3b2fb91ce354878a7bd"><div class="ttname"><a href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd">others::Cache::D_Node::next</a></div><div class="ttdeci">D_Node&lt; T &gt; * next</div><div class="ttdoc">next node in the doubly linked list</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d65/lfu__cache_8cpp_source.html#l00049">lfu_cache.cpp:49</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_d___node_html_a19e954cbb710ea8318bcb6aaef78e2d5"><div class="ttname"><a href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5">others::Cache::D_Node::prev</a></div><div class="ttdeci">D_Node&lt; T &gt; * prev</div><div class="ttdoc">previous node in the doubly linked list</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d65/lfu__cache_8cpp_source.html#l00048">lfu_cache.cpp:48</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_d___node_html_a8902e7ff872fa3c80fe6ce5f5cf5cc75"><div class="ttname"><a href="../../de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75">others::Cache::D_Node::data</a></div><div class="ttdeci">T data</div><div class="ttdoc">data of the node</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d65/lfu__cache_8cpp_source.html#l00047">lfu_cache.cpp:47</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html"><div class="ttname"><a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">others::Cache::LRUCache</a></div><div class="ttdoc">LRUCache.</div><div class="ttdef"><b>Definition</b> <a href="#l00061">lru_cache2.cpp:61</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a042bb403f4452ad8c669fbf87ef82821"><div class="ttname"><a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821">others::Cache::LRUCache::head</a></div><div class="ttdeci">CacheNode&lt; K, V &gt; * head</div><div class="ttdoc">head of the doubly linked list</div><div class="ttdef"><b>Definition</b> <a href="#l00062">lru_cache2.cpp:62</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a1b709333874b4633ee02a3661cd042e1"><div class="ttname"><a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1">others::Cache::LRUCache::size</a></div><div class="ttdeci">int size() const</div><div class="ttdoc">Returns the number of items present in the cache.</div><div class="ttdef"><b>Definition</b> <a href="#l00187">lru_cache2.cpp:187</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a2e53b5ad1368d87da501f61473eb9ea2"><div class="ttname"><a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2">others::Cache::LRUCache::push_front</a></div><div class="ttdeci">void push_front(CacheNode&lt; K, V &gt; *node_ptr)</div><div class="ttdoc">push the node to the front of the linked list.</div><div class="ttdef"><b>Definition</b> <a href="#l00083">lru_cache2.cpp:83</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a448121f391a71f4cf88c3cb6c4cf3100"><div class="ttname"><a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100">others::Cache::LRUCache::tail</a></div><div class="ttdeci">CacheNode&lt; K, V &gt; * tail</div><div class="ttdoc">tail of the doubly linked list</div><div class="ttdef"><b>Definition</b> <a href="#l00063">lru_cache2.cpp:63</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a5ee34fcee480f21bb6f68a34f0f69b45"><div class="ttname"><a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45">others::Cache::LRUCache::put</a></div><div class="ttdeci">void put(K key, V value)</div><div class="ttdoc">upsert a key-value pair</div><div class="ttdef"><b>Definition</b> <a href="#l00145">lru_cache2.cpp:145</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a6d855ff72ad6fe548eb564b7f87abe06"><div class="ttname"><a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a6d855ff72ad6fe548eb564b7f87abe06">others::Cache::LRUCache::~LRUCache</a></div><div class="ttdeci">~LRUCache()</div><div class="ttdoc">destructs the cache, iterates on the map and deletes every node present in the cache.</div><div class="ttdef"><b>Definition</b> <a href="#l00205">lru_cache2.cpp:205</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a8980cbbc9cf0a98a9592b40c4d6ec28f"><div class="ttname"><a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f">others::Cache::LRUCache::LRUCache</a></div><div class="ttdeci">LRUCache(int _capacity)</div><div class="ttdoc">Constructor, Initialize the head and tail pointers to nullptr and initialize the _capacity of the cac...</div><div class="ttdef"><b>Definition</b> <a href="#l00075">lru_cache2.cpp:75</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_a8dab0f69410484f772946befd24cc3c5"><div class="ttname"><a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5">others::Cache::LRUCache::node_map</a></div><div class="ttdeci">std::unordered_map&lt; K, CacheNode&lt; K, V &gt; * &gt; node_map</div><div class="ttdoc">maps the key to the node address</div><div class="ttdef"><b>Definition</b> <a href="#l00067">lru_cache2.cpp:67</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_ab211a4be58491bf11834cae88a0c44f7"><div class="ttname"><a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7">others::Cache::LRUCache::pop_back</a></div><div class="ttdeci">void pop_back()</div><div class="ttdoc">pop the last node in the linked list.</div><div class="ttdef"><b>Definition</b> <a href="#l00122">lru_cache2.cpp:122</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_ab8b6a6aa95db678596bc2a49e864683e"><div class="ttname"><a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e">others::Cache::LRUCache::empty</a></div><div class="ttdeci">bool empty() const</div><div class="ttdoc">returns whether the cache is empty or not</div><div class="ttdef"><b>Definition</b> <a href="#l00199">lru_cache2.cpp:199</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_ac1be0357ecc7c34144f3d9a63c6cb3ea"><div class="ttname"><a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea">others::Cache::LRUCache::get</a></div><div class="ttdeci">V get(K key)</div><div class="ttdoc">get the value of the key-value pair if exists</div><div class="ttdef"><b>Definition</b> <a href="#l00172">lru_cache2.cpp:172</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_ad022d494b40f82417340b113445e79a4"><div class="ttname"><a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4">others::Cache::LRUCache::make_recent</a></div><div class="ttdeci">void make_recent(CacheNode&lt; K, V &gt; *node_ptr)</div><div class="ttdoc">move the existing node in the list to the beginning of the list.</div><div class="ttdef"><b>Definition</b> <a href="#l00099">lru_cache2.cpp:99</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_af34bb8b8eaa34cc499b4fed30b9d05fc"><div class="ttname"><a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af34bb8b8eaa34cc499b4fed30b9d05fc">others::Cache::LRUCache::_capacity</a></div><div class="ttdeci">std::uint32_t _capacity</div><div class="ttdoc">maximum capacity of the cache</div><div class="ttdef"><b>Definition</b> <a href="#l00064">lru_cache2.cpp:64</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_r_u_cache_html_af8edfe5a7def5d5b846463041c33136a"><div class="ttname"><a href="../../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a">others::Cache::LRUCache::capacity</a></div><div class="ttdeci">int capacity() const</div><div class="ttdoc">Returns the total capacity of the cache.</div><div class="ttdef"><b>Definition</b> <a href="#l00193">lru_cache2.cpp:193</a></div></div>
+<div class="ttc" id="alru__cache2_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/daa/lru__cache2_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> <a href="#l00220">lru_cache2.cpp:220</a></div></div>
+<div class="ttc" id="alru__cache2_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/daa/lru__cache2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition</b> <a href="#l00274">lru_cache2.cpp:274</a></div></div>
+<div class="ttc" id="anamespaceothers_html"><div class="ttname"><a href="../../d0/d6f/namespaceothers.html">others</a></div><div class="ttdoc">for vector</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../dc/daa/lru__cache2_8cpp.html">lru_cache2.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dc/db5/struct_queue.html b/dc/db5/struct_queue.html
index 31590eee5..7a17f1332 100644
--- a/dc/db5/struct_queue.html
+++ b/dc/db5/struct_queue.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Queue Class Reference</title>
+<title>TheAlgorithms/C++: Queue Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -130,14 +147,11 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:abab0f9fbb31ee24a0130523c3562c863" id="r_abab0f9fbb31ee24a0130523c3562c863"><td class="memItemLeft" align="right" valign="top"><a id="abab0f9fbb31ee24a0130523c3562c863" name="abab0f9fbb31ee24a0130523c3562c863"></a>
-<a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>t</b> [100]</td></tr>
+<tr class="memitem:abab0f9fbb31ee24a0130523c3562c863" id="r_abab0f9fbb31ee24a0130523c3562c863"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abab0f9fbb31ee24a0130523c3562c863">t</a> [100]</td></tr>
 <tr class="separator:abab0f9fbb31ee24a0130523c3562c863"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa14801d5c5fea47f3d08483d103e0b57" id="r_aa14801d5c5fea47f3d08483d103e0b57"><td class="memItemLeft" align="right" valign="top"><a id="aa14801d5c5fea47f3d08483d103e0b57" name="aa14801d5c5fea47f3d08483d103e0b57"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>front</b></td></tr>
+<tr class="memitem:aa14801d5c5fea47f3d08483d103e0b57" id="r_aa14801d5c5fea47f3d08483d103e0b57"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa14801d5c5fea47f3d08483d103e0b57">front</a></td></tr>
 <tr class="separator:aa14801d5c5fea47f3d08483d103e0b57"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8303807ce298d63d958f7e5765034d70" id="r_a8303807ce298d63d958f7e5765034d70"><td class="memItemLeft" align="right" valign="top"><a id="a8303807ce298d63d958f7e5765034d70" name="a8303807ce298d63d958f7e5765034d70"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>rear</b></td></tr>
+<tr class="memitem:a8303807ce298d63d958f7e5765034d70" id="r_a8303807ce298d63d958f7e5765034d70"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8303807ce298d63d958f7e5765034d70">rear</a></td></tr>
 <tr class="separator:a8303807ce298d63d958f7e5765034d70"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
@@ -153,14 +167,15 @@ Private Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a31b892ad81d0e915c20c8f6a88e75f02" id="r_a31b892ad81d0e915c20c8f6a88e75f02"><td class="memItemLeft" align="right" valign="top"><a id="a31b892ad81d0e915c20c8f6a88e75f02" name="a31b892ad81d0e915c20c8f6a88e75f02"></a>
-<a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>front</b> = nullptr</td></tr>
+<tr class="memitem:a31b892ad81d0e915c20c8f6a88e75f02" id="r_a31b892ad81d0e915c20c8f6a88e75f02"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a31b892ad81d0e915c20c8f6a88e75f02">front</a> = nullptr</td></tr>
 <tr class="separator:a31b892ad81d0e915c20c8f6a88e75f02"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a3ed9e95fefd0c13071d192c1512c8db3" id="r_a3ed9e95fefd0c13071d192c1512c8db3"><td class="memItemLeft" align="right" valign="top"><a id="a3ed9e95fefd0c13071d192c1512c8db3" name="a3ed9e95fefd0c13071d192c1512c8db3"></a>
-<a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>rear</b> = nullptr</td></tr>
+<tr class="memitem:a3ed9e95fefd0c13071d192c1512c8db3" id="r_a3ed9e95fefd0c13071d192c1512c8db3"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3ed9e95fefd0c13071d192c1512c8db3">rear</a> = nullptr</td></tr>
 <tr class="separator:a3ed9e95fefd0c13071d192c1512c8db3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
-<h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00017">17</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
+</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a00d119db8fa3050da37746e82cbcf94f" name="a00d119db8fa3050da37746e82cbcf94f"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a00d119db8fa3050da37746e82cbcf94f">&#9670;&#160;</a></span>~Queue()</h2>
 
@@ -183,6 +198,8 @@ Private Attributes</h2></td></tr>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html#l00016">16</a> of file <a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html">circular_queue_using_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   16</span>             {</div>
 <div class="line"><span class="lineno">   17</span>        <span class="keywordflow">while</span> (front) {</div>
 <div class="line"><span class="lineno">   18</span>            dequeue();</div>
@@ -214,6 +231,8 @@ Private Attributes</h2></td></tr>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html#l00023">23</a> of file <a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html">circular_queue_using_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   23</span>                             {</div>
 <div class="line"><span class="lineno">   24</span>        <span class="keyword">auto</span>* nn = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
 <div class="line"><span class="lineno">   25</span>        nn-&gt;data = val;</div>
@@ -221,7 +240,7 @@ Private Attributes</h2></td></tr>
 <div class="line"><span class="lineno">   27</span>        front = nn;</div>
 <div class="line"><span class="lineno">   28</span>        rear = nn;</div>
 <div class="line"><span class="lineno">   29</span>    }</div>
-<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -247,6 +266,8 @@ Private Attributes</h2></td></tr>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html#l00043">43</a> of file <a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html">circular_queue_using_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   43</span>                   {</div>
 <div class="line"><span class="lineno">   44</span>        <span class="keywordflow">if</span> (front == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">   45</span>            <span class="keywordflow">return</span>;</div>
@@ -261,7 +282,7 @@ Private Attributes</h2></td></tr>
 <div class="line"><span class="lineno">   54</span>        }</div>
 <div class="line"><span class="lineno">   55</span>        <span class="keyword">delete</span> n;</div>
 <div class="line"><span class="lineno">   56</span>    }</div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -287,6 +308,8 @@ Private Attributes</h2></td></tr>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html">circular_queue_using_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   32</span>                          {</div>
 <div class="line"><span class="lineno">   33</span>        <span class="keywordflow">if</span> (front == <span class="keyword">nullptr</span> || rear == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">   34</span>            createNode(val);</div>
@@ -323,24 +346,122 @@ Private Attributes</h2></td></tr>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html">circular_queue_using_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   57</span>                    {</div>
 <div class="line"><span class="lineno">   58</span>        <span class="keywordflow">if</span> (front == <span class="keyword">nullptr</span>) {</div>
 <div class="line"><span class="lineno">   59</span>            <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">   60</span>        }</div>
 <div class="line"><span class="lineno">   61</span>        <span class="keyword">const</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* ptr = front;</div>
 <div class="line"><span class="lineno">   62</span>        <span class="keywordflow">do</span> {</div>
-<div class="line"><span class="lineno">   63</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; ptr-&gt;data &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><span class="lineno">   63</span>            std::cout &lt;&lt; ptr-&gt;data &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
 <div class="line"><span class="lineno">   64</span>            ptr = ptr-&gt;next;</div>
 <div class="line"><span class="lineno">   65</span>        } <span class="keywordflow">while</span> (ptr != front);</div>
-<div class="line"><span class="lineno">   66</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><span class="lineno">   66</span>        std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
 <div class="line"><span class="lineno">   67</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><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="aa14801d5c5fea47f3d08483d103e0b57" name="aa14801d5c5fea47f3d08483d103e0b57"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aa14801d5c5fea47f3d08483d103e0b57">&#9670;&#160;</a></span>front <span class="overload">[1/2]</span></h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int Queue::front</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00019">19</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a31b892ad81d0e915c20c8f6a88e75f02" name="a31b892ad81d0e915c20c8f6a88e75f02"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a31b892ad81d0e915c20c8f6a88e75f02">&#9670;&#160;</a></span>front <span class="overload">[2/2]</span></h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a>* Queue::front = nullptr</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html#l00008">8</a> of file <a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html">circular_queue_using_linked_list.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a8303807ce298d63d958f7e5765034d70" name="a8303807ce298d63d958f7e5765034d70"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a8303807ce298d63d958f7e5765034d70">&#9670;&#160;</a></span>rear <span class="overload">[1/2]</span></h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int Queue::rear</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00020">20</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a3ed9e95fefd0c13071d192c1512c8db3" name="a3ed9e95fefd0c13071d192c1512c8db3"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a3ed9e95fefd0c13071d192c1512c8db3">&#9670;&#160;</a></span>rear <span class="overload">[2/2]</span></h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a>* Queue::rear = nullptr</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html#l00009">9</a> of file <a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html">circular_queue_using_linked_list.cpp</a>.</p>
+
+</div>
+</div>
+<a id="abab0f9fbb31ee24a0130523c3562c863" name="abab0f9fbb31ee24a0130523c3562c863"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#abab0f9fbb31ee24a0130523c3562c863">&#9670;&#160;</a></span>t</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a>* Queue::t[100]</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00018">18</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following files:<ul>
-<li>data_structures/<a class="el" href="../../d3/d26/binary__search__tree_8cpp.html">binary_search_tree.cpp</a></li>
-<li>data_structures/<b>circular_queue_using_linked_list.cpp</b></li>
+<li>data_structures/<a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d9/dfd/circular__queue__using__linked__list_8cpp_source.html">circular_queue_using_linked_list.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dc/db5/text__search_8cpp.html b/dc/db5/text__search_8cpp.html
index 6b0d603ca..2294f5db0 100644
--- a/dc/db5/text__search_8cpp.html
+++ b/dc/db5/text__search_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: search/text_search.cpp File Reference</title>
+<title>TheAlgorithms/C++: search/text_search.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,10 +138,12 @@ Include dependency graph for text_search.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d0f/text__search_8cpp__incl.svg" width="338" height="111"><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">
+</div>
+<p><a href="../../dc/db5/text__search_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a3f8975d227cd0e58f298b380c5dac0d9" id="r_a3f8975d227cd0e58f298b380c5dac0d9"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3f8975d227cd0e58f298b380c5dac0d9">lower</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> word)</td></tr>
+<tr class="memitem:a3f8975d227cd0e58f298b380c5dac0d9" id="r_a3f8975d227cd0e58f298b380c5dac0d9"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3f8975d227cd0e58f298b380c5dac0d9">lower</a> (std::string word)</td></tr>
 <tr class="memdesc:a3f8975d227cd0e58f298b380c5dac0d9"><td class="mdescLeft">&#160;</td><td class="mdescRight">function to convert a C++ string to lower case  <br /></td></tr>
 <tr class="separator:a3f8975d227cd0e58f298b380c5dac0d9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -136,6 +155,8 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Search for words in a long textual paragraph. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../dc/db5/text__search_8cpp_source.html">text_search.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a3f8975d227cd0e58f298b380c5dac0d9" name="a3f8975d227cd0e58f298b380c5dac0d9"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a3f8975d227cd0e58f298b380c5dac0d9">&#9670;&#160;</a></span>lower()</h2>
@@ -144,9 +165,9 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> lower </td>
+          <td class="memname">std::string lower </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>word</em></span></td><td>)</td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>word</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -155,30 +176,24 @@ Functions</h2></td></tr>
 <p>function to convert a C++ string to lower case </p>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
-    <tr><td class="paramname">word</td><td>takes an <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> as input </td></tr>
+    <tr><td class="paramname">word</td><td>takes an std::string as input </td></tr>
   </table>
   </dd>
 </dl>
-<dl class="section return"><dt>Returns</dt><dd><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> </dd></dl>
+<dl class="section return"><dt>Returns</dt><dd>std::string </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/db5/text__search_8cpp_source.html#l00019">19</a> of file <a class="el" href="../../dc/db5/text__search_8cpp_source.html">text_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   19</span>                                {</div>
-<div class="line"><span class="lineno">   20</span>    <span class="keywordtype">int</span> length = word.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>();</div>
-<div class="line"><span class="lineno">   21</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> lc = <span class="stringliteral">&quot;&quot;</span>;</div>
+<div class="line"><span class="lineno">   20</span>    <span class="keywordtype">int</span> length = word.length();</div>
+<div class="line"><span class="lineno">   21</span>    std::string lc = <span class="stringliteral">&quot;&quot;</span>;</div>
 <div class="line"><span class="lineno">   22</span> </div>
 <div class="line"><span class="lineno">   23</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; length; i++) {</div>
-<div class="line"><span class="lineno">   24</span>        lc += <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/tolower.html">tolower</a>(word[i]);</div>
+<div class="line"><span class="lineno">   24</span>        lc += tolower(word[i]);</div>
 <div class="line"><span class="lineno">   25</span>    }</div>
 <div class="line"><span class="lineno">   26</span> </div>
 <div class="line"><span class="lineno">   27</span>    <span class="keywordflow">return</span> lc;</div>
 <div class="line"><span class="lineno">   28</span>}</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::length</a></div><div class="ttdeci">T length(T... args)</div></div>
-<div class="ttc" id="atolower_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/tolower.html">std::tolower</a></div><div class="ttdeci">T tolower(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph.svg" width="234" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -198,75 +213,66 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/db5/text__search_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../dc/db5/text__search_8cpp_source.html">text_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   44</span>           {</div>
 <div class="line"><span class="lineno">   45</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
-<div class="line"><span class="lineno">   46</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> paragraph;</div>
-<div class="line"><span class="lineno">   47</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Please enter your paragraph: \n&quot;</span>;</div>
-<div class="line"><span class="lineno">   48</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html">std::getline</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a>, paragraph);</div>
-<div class="line"><span class="lineno">   49</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nHello, your paragraph is:\n &quot;</span> &lt;&lt; paragraph &lt;&lt; <span class="stringliteral">&quot;!\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   50</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nThe size of your paragraph = &quot;</span> &lt;&lt; paragraph.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()</div>
+<div class="line"><span class="lineno">   46</span>    std::string paragraph;</div>
+<div class="line"><span class="lineno">   47</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Please enter your paragraph: \n&quot;</span>;</div>
+<div class="line"><span class="lineno">   48</span>    std::getline(std::cin, paragraph);</div>
+<div class="line"><span class="lineno">   49</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nHello, your paragraph is:\n &quot;</span> &lt;&lt; paragraph &lt;&lt; <span class="stringliteral">&quot;!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   50</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nThe size of your paragraph = &quot;</span> &lt;&lt; paragraph.size()</div>
 <div class="line"><span class="lineno">   51</span>              &lt;&lt; <span class="stringliteral">&quot; characters. \n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   52</span> </div>
-<div class="line"><span class="lineno">   53</span>    <span class="keywordflow">if</span> (paragraph.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html">empty</a>()) {</div>
-<div class="line"><span class="lineno">   54</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nThe paragraph is empty&quot;</span> &lt;&lt; <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">   53</span>    <span class="keywordflow">if</span> (paragraph.empty()) {</div>
+<div class="line"><span class="lineno">   54</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nThe paragraph is empty&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   55</span>    } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">   56</span>        <span class="keywordtype">int</span> ch = 0;</div>
 <div class="line"><span class="lineno">   57</span>        <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
-<div class="line"><span class="lineno">   58</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> word;</div>
-<div class="line"><span class="lineno">   59</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Please enter the word you are searching for: &quot;</span>;</div>
-<div class="line"><span class="lineno">   60</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html">std::getline</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a>, word);</div>
-<div class="line"><span class="lineno">   61</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Ignore case-sensitive? 1 = Yes, 0 = No&quot;</span> &lt;&lt; <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">   62</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; ch;</div>
+<div class="line"><span class="lineno">   58</span>            std::string word;</div>
+<div class="line"><span class="lineno">   59</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Please enter the word you are searching for: &quot;</span>;</div>
+<div class="line"><span class="lineno">   60</span>            std::getline(std::cin, word);</div>
+<div class="line"><span class="lineno">   61</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Ignore case-sensitive? 1 = Yes, 0 = No&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   62</span>            std::cin &gt;&gt; ch;</div>
 <div class="line"><span class="lineno">   63</span>            <span class="keywordflow">if</span> (ch == 1) {</div>
-<div class="line"><span class="lineno">   64</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> lowerCase = <a class="code hl_function" href="#a3f8975d227cd0e58f298b380c5dac0d9">lower</a>(</div>
+<div class="line"><span class="lineno">   64</span>                std::string lowerCase = <a class="code hl_function" href="#a3f8975d227cd0e58f298b380c5dac0d9">lower</a>(</div>
 <div class="line"><span class="lineno">   65</span>                    paragraph);  <span class="comment">// convert std::string paragraph to lowercase</span></div>
 <div class="line"><span class="lineno">   66</span>                                 <span class="comment">// and store it in std::string lowerCase</span></div>
-<div class="line"><span class="lineno">   67</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> lowerCaseWord =</div>
+<div class="line"><span class="lineno">   67</span>                std::string lowerCaseWord =</div>
 <div class="line"><span class="lineno">   68</span>                    <a class="code hl_function" href="#a3f8975d227cd0e58f298b380c5dac0d9">lower</a>(word);  <span class="comment">// convert std::string paragraph to lowercase</span></div>
 <div class="line"><span class="lineno">   69</span>                                  <span class="comment">// and store it in std::string lowerCase</span></div>
 <div class="line"><span class="lineno">   70</span> </div>
-<div class="line"><span class="lineno">   71</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hello, your word is &quot;</span> &lt;&lt; word &lt;&lt; <span class="stringliteral">&quot;!\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   72</span>                <span class="keywordflow">if</span> (lowerCase.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/find.html">find</a>(lowerCaseWord) == std::string::npos) {</div>
-<div class="line"><span class="lineno">   73</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; word &lt;&lt; <span class="stringliteral">&quot; does not exist in the sentence&quot;</span></div>
-<div class="line"><span class="lineno">   74</span>                              &lt;&lt; <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">   71</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Hello, your word is &quot;</span> &lt;&lt; word &lt;&lt; <span class="stringliteral">&quot;!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   72</span>                <span class="keywordflow">if</span> (lowerCase.find(lowerCaseWord) == std::string::npos) {</div>
+<div class="line"><span class="lineno">   73</span>                    std::cout &lt;&lt; word &lt;&lt; <span class="stringliteral">&quot; does not exist in the sentence&quot;</span></div>
+<div class="line"><span class="lineno">   74</span>                              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   75</span>                } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   76</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The word &quot;</span> &lt;&lt; word</div>
+<div class="line"><span class="lineno">   76</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;The word &quot;</span> &lt;&lt; word</div>
 <div class="line"><span class="lineno">   77</span>                              &lt;&lt; <span class="stringliteral">&quot; is now found at location &quot;</span></div>
-<div class="line"><span class="lineno">   78</span>                              &lt;&lt; lowerCase.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/find.html">find</a>(lowerCaseWord) &lt;&lt; <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">   79</span>                              &lt;&lt; <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">   78</span>                              &lt;&lt; lowerCase.find(lowerCaseWord) &lt;&lt; std::endl</div>
+<div class="line"><span class="lineno">   79</span>                              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   80</span>                }</div>
 <div class="line"><span class="lineno">   81</span>            } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   82</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Hello, your word is &quot;</span> &lt;&lt; word &lt;&lt; <span class="stringliteral">&quot;!\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   83</span>                <span class="keywordflow">if</span> (paragraph.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/find.html">find</a>(word) == std::string::npos) {</div>
-<div class="line"><span class="lineno">   84</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; word &lt;&lt; <span class="stringliteral">&quot; does not exist in the sentence&quot;</span></div>
-<div class="line"><span class="lineno">   85</span>                              &lt;&lt; <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">   82</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Hello, your word is &quot;</span> &lt;&lt; word &lt;&lt; <span class="stringliteral">&quot;!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   83</span>                <span class="keywordflow">if</span> (paragraph.find(word) == std::string::npos) {</div>
+<div class="line"><span class="lineno">   84</span>                    std::cout &lt;&lt; word &lt;&lt; <span class="stringliteral">&quot; does not exist in the sentence&quot;</span></div>
+<div class="line"><span class="lineno">   85</span>                              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   86</span>                } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   87</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The word &quot;</span> &lt;&lt; word</div>
+<div class="line"><span class="lineno">   87</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;The word &quot;</span> &lt;&lt; word</div>
 <div class="line"><span class="lineno">   88</span>                              &lt;&lt; <span class="stringliteral">&quot; is now found at location &quot;</span></div>
-<div class="line"><span class="lineno">   89</span>                              &lt;&lt; paragraph.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/find.html">find</a>(word) &lt;&lt; <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">   90</span>                              &lt;&lt; <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">   89</span>                              &lt;&lt; paragraph.find(word) &lt;&lt; std::endl</div>
+<div class="line"><span class="lineno">   90</span>                              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   91</span>                }</div>
 <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/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPress Ctrl + C to exit the program.\n\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   94</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a>.get();</div>
+<div class="line"><span class="lineno">   93</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nPress Ctrl + C to exit the program.\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   94</span>            std::cin.get();</div>
 <div class="line"><span class="lineno">   95</span>        }</div>
 <div class="line"><span class="lineno">   96</span>    }</div>
 <div class="line"><span class="lineno">   97</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   98</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html">std::string::empty</a></div><div class="ttdeci">T empty(T... args)</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="afind_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/find.html">std::string::find</a></div><div class="ttdeci">T find(T... args)</div></div>
-<div class="ttc" id="agetline_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html">std::getline</a></div><div class="ttdeci">T getline(T... args)</div></div>
-<div class="ttc" id="atext__search_8cpp_html_a3f8975d227cd0e58f298b380c5dac0d9"><div class="ttname"><a href="#a3f8975d227cd0e58f298b380c5dac0d9">lower</a></div><div class="ttdeci">std::string lower(std::string word)</div><div class="ttdoc">function to convert a C++ string to lower case</div><div class="ttdef"><b>Definition</b> text_search.cpp:19</div></div>
-<div class="ttc" id="atext__search_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> text_search.cpp:34</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="522" height="336"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="atext__search_8cpp_html_a3f8975d227cd0e58f298b380c5dac0d9"><div class="ttname"><a href="#a3f8975d227cd0e58f298b380c5dac0d9">lower</a></div><div class="ttdeci">std::string lower(std::string word)</div><div class="ttdoc">function to convert a C++ string to lower case</div><div class="ttdef"><b>Definition</b> <a href="../../dc/db5/text__search_8cpp_source.html#l00019">text_search.cpp:19</a></div></div>
+<div class="ttc" id="atext__search_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/db5/text__search_8cpp_source.html#l00034">text_search.cpp:34</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -294,18 +300,15 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/db5/text__search_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../dc/db5/text__search_8cpp_source.html">text_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   34</span>                   {</div>
 <div class="line"><span class="lineno">   35</span>    assert(<a class="code hl_function" href="#a3f8975d227cd0e58f298b380c5dac0d9">lower</a>(<span class="stringliteral">&quot;abcd&quot;</span>).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(<span class="stringliteral">&quot;abcd&quot;</span>) == 0);</div>
 <div class="line"><span class="lineno">   36</span>    assert(<a class="code hl_function" href="#a3f8975d227cd0e58f298b380c5dac0d9">lower</a>(<span class="stringliteral">&quot;abc&quot;</span>).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(<span class="stringliteral">&quot;abcd&quot;</span>) == -1);</div>
 <div class="line"><span class="lineno">   37</span>    assert(<a class="code hl_function" href="#a3f8975d227cd0e58f298b380c5dac0d9">lower</a>(<span class="stringliteral">&quot;abcd&quot;</span>).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(<span class="stringliteral">&quot;abc&quot;</span>) == 1);</div>
 <div class="line"><span class="lineno">   38</span>}</div>
-<div class="ttc" id="ashell__sort2_8cpp_html_a7eb77daed2cf1513f6d68c47a1c2db1c"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a></div><div class="ttdeci">int compare(const void *a, const void *b)</div><div class="ttdef"><b>Definition</b> shell_sort2.cpp:87</div></div>
-</div><!-- 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/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="344" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ashell__sort2_8cpp_html_a7eb77daed2cf1513f6d68c47a1c2db1c"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a></div><div class="ttdeci">int compare(const void *a, const void *b)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d7a/shell__sort2_8cpp_source.html#l00087">shell_sort2.cpp:87</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph.map b/dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph.map
deleted file mode 100644
index fd3daee91..000000000
--- a/dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="lower" name="lower">
-<area shape="rect" id="Node000001" title="function to convert a C++ string to lower case" alt="" coords="5,5,58,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="106,5,228,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="58,16,90,16,90,21,58,21"/>
-</map>
diff --git a/dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph.md5 b/dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph.md5
deleted file mode 100644
index 764c0b5de..000000000
--- a/dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-69f9d30126316fc42193e6e7dd5f8c11
\ No newline at end of file
diff --git a/dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph.svg b/dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph.svg
deleted file mode 100644
index 219682bd1..000000000
--- a/dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: lower Pages: 1 -->
-<svg width="175pt" height="27pt"
- viewBox="0.00 0.00 175.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>lower</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="function to convert a C++ string to lower case">
-<polygon fill="#999999" stroke="#666666" points="39.25,-19.25 0,-19.25 0,0 39.25,0 39.25,-19.25"/>
-<text text-anchor="middle" x="19.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">lower</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="167,-19.25 75.25,-19.25 75.25,0 167,0 167,-19.25"/>
-<text text-anchor="middle" x="121.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.34,-9.62C46.46,-9.62 55,-9.62 63.82,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="63.54,-13.13 73.54,-9.63 63.54,-6.13 63.54,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph_org.svg b/dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph_org.svg
deleted file mode 100644
index 0a8d66854..000000000
--- a/dc/db5/text__search_8cpp_a3f8975d227cd0e58f298b380c5dac0d9_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: lower Pages: 1 -->
-<svg width="175pt" height="27pt"
- viewBox="0.00 0.00 175.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>lower</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="function to convert a C++ string to lower case">
-<polygon fill="#999999" stroke="#666666" points="39.25,-19.25 0,-19.25 0,0 39.25,0 39.25,-19.25"/>
-<text text-anchor="middle" x="19.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">lower</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="167,-19.25 75.25,-19.25 75.25,0 167,0 167,-19.25"/>
-<text text-anchor="middle" x="121.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.34,-9.62C46.46,-9.62 55,-9.62 63.82,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="63.54,-13.13 73.54,-9.63 63.54,-6.13 63.54,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 3857bd14e..000000000
--- a/dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,31,49,56"/>
-<area shape="rect" id="Node000002" href="$d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,36,81,28,82,33,50,41"/>
-<area shape="rect" id="Node000003" href="$dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9" title="function to convert a C++ string to lower case" alt="" coords="106,55,158,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="50,46,91,55,90,61,49,51"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="216,55,338,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="159,65,201,65,201,70,159,70"/>
-</map>
diff --git a/dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 60ca06e45..000000000
--- a/dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6b4278fdd33c5f75e74ed9504dd15152
\ No newline at end of file
diff --git a/dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index cd93813e6..000000000
--- a/dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="258pt" height="64pt"
- viewBox="0.00 0.00 257.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-56.25 68.5,-56.25 68.5,-37 122,-37 122,-56.25"/>
-<text text-anchor="middle" x="95.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">compare</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-31.47C39.86,-33.2 48.49,-35.33 57.03,-37.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.06,-40.81 66.61,-39.8 57.74,-34.01 56.06,-40.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9" target="_top" xlink:title="function to convert a C++ string to lower case">
-<polygon fill="white" stroke="#666666" points="114.88,-19.25 75.62,-19.25 75.62,0 114.88,0 114.88,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">lower</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-23.98C41.8,-21.89 53.39,-19.18 64.07,-16.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.73,-20.12 73.67,-14.44 63.14,-13.3 64.73,-20.12"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.75,-19.25 158,-19.25 158,0 249.75,0 249.75,-19.25"/>
-<text text-anchor="middle" x="203.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.31,-9.62C124.21,-9.62 135.31,-9.62 146.59,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.34,-13.13 156.34,-9.63 146.34,-6.13 146.34,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 579993f57..000000000
--- a/dc/db5/text__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="258pt" height="64pt"
- viewBox="0.00 0.00 257.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-56.25 68.5,-56.25 68.5,-37 122,-37 122,-56.25"/>
-<text text-anchor="middle" x="95.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">compare</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-31.47C39.86,-33.2 48.49,-35.33 57.03,-37.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.06,-40.81 66.61,-39.8 57.74,-34.01 56.06,-40.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9" target="_top" xlink:title="function to convert a C++ string to lower case">
-<polygon fill="white" stroke="#666666" points="114.88,-19.25 75.62,-19.25 75.62,0 114.88,0 114.88,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">lower</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-23.98C41.8,-21.89 53.39,-19.18 64.07,-16.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.73,-20.12 73.67,-14.44 63.14,-13.3 64.73,-20.12"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.75,-19.25 158,-19.25 158,0 249.75,0 249.75,-19.25"/>
-<text text-anchor="middle" x="203.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.31,-9.62C124.21,-9.62 135.31,-9.62 146.59,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.34,-13.13 156.34,-9.63 146.34,-6.13 146.34,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index df1e26330..000000000
--- a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,153,55,179"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/empty.html#" title=" " alt="" coords="103,5,226,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="33,152,56,99,76,68,101,40,104,37,108,42,104,44,80,71,61,101,38,154"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="129,55,200,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="39,151,65,121,101,89,113,82,116,87,104,94,69,124,43,155"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/find.html#" title=" " alt="" coords="110,104,218,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="54,155,112,133,114,138,56,160"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/getline.html#" title=" " alt="" coords="122,153,207,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="55,164,106,164,106,169,55,169"/>
-<area shape="rect" id="Node000006" href="$dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9" title="function to convert a C++ string to lower case" alt="" coords="284,255,336,280"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="43,178,68,207,104,233,146,249,190,259,269,266,268,271,189,264,144,254,101,238,65,210,39,181"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="393,229,516,255"/>
-<area shape="poly" id="edge7_Node000001_Node000007" title=" " alt="" coords="56,173,103,189,249,217,378,233,378,238,248,222,102,194,54,178"/>
-<area shape="rect" id="Node000008" href="$dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="143,305,186,331"/>
-<area shape="poly" id="edge8_Node000001_Node000008" title=" " alt="" coords="39,178,63,229,82,258,104,284,130,302,127,306,101,288,77,261,58,231,34,181"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="336,260,378,253,379,258,337,266"/>
-<area shape="poly" id="edge10_Node000008_Node000006" title=" " alt="" coords="185,308,268,279,270,284,187,313"/>
-<area shape="rect" id="Node000009" href="$d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" title=" " alt="" coords="274,305,345,331"/>
-<area shape="poly" id="edge9_Node000008_Node000009" title=" " alt="" coords="186,316,258,316,258,321,186,321"/>
-</map>
diff --git a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index fafee452b..000000000
--- a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f3306c3c2fde2db7bad014c639d54f71
\ No newline at end of file
diff --git a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index c887dda6a..000000000
--- a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,209 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="391pt" height="252pt"
- viewBox="0.00 0.00 390.75 252.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 248.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-133.25 0,-133.25 0,-114 37,-114 37,-133.25"/>
-<text text-anchor="middle" x="18.5" y="-119.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.5,-244.25 73,-244.25 73,-225 165.5,-225 165.5,-244.25"/>
-<text text-anchor="middle" x="119.25" y="-230.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.69,-133.47C29.22,-152.18 45.82,-193.09 73,-216.62 73.78,-217.3 74.59,-217.96 75.43,-218.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.45,-221.48 83.81,-223.72 77.11,-215.51 73.45,-221.48"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146,-207.25 92.5,-207.25 92.5,-188 146,-188 146,-207.25"/>
-<text text-anchor="middle" x="119.25" y="-193.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.81,-133.58C36.27,-145.86 53.83,-166.69 73,-179.62 75.85,-181.55 78.94,-183.32 82.12,-184.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.46,-188.02 91.01,-188.92 83.33,-181.63 80.46,-188.02"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.88,-170.25 78.62,-170.25 78.62,-151 159.88,-151 159.88,-170.25"/>
-<text text-anchor="middle" x="119.25" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.15,-130.24C49.3,-134.79 65.88,-141 80.88,-146.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.44,-149.82 90.03,-150.05 81.89,-143.26 79.44,-149.82"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.25,-133.25 87.25,-133.25 87.25,-114 151.25,-114 151.25,-133.25"/>
-<text text-anchor="middle" x="119.25" y="-119.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.15,-123.62C47.9,-123.62 62.13,-123.62 75.66,-123.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.26,-127.13 85.26,-123.63 75.26,-120.13 75.26,-127.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9" target="_top" xlink:title="function to convert a C++ string to lower case">
-<polygon fill="white" stroke="#666666" points="247.88,-57.25 208.62,-57.25 208.62,-38 247.88,-38 247.88,-57.25"/>
-<text text-anchor="middle" x="228.25" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">lower</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.56,-113.72C35.77,-101.63 53.06,-81.57 73,-71.62 112.78,-51.78 164.92,-47.51 197.24,-47.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="197.09,-50.51 207.08,-46.98 197.07,-43.51 197.09,-50.51"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="382.75,-76.25 291,-76.25 291,-57 382.75,-57 382.75,-76.25"/>
-<text text-anchor="middle" x="336.88" y="-62.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.06,-116.4C47.38,-112.4 60.75,-107.65 73,-104.62 143.06,-87.3 225.72,-76.96 279.38,-71.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="279.59,-75.03 289.2,-70.57 278.9,-68.06 279.59,-75.03"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="135.5,-19.25 103,-19.25 103,0 135.5,0 135.5,-19.25"/>
-<text text-anchor="middle" x="119.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge8_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.35,-113.51C30.64,-95.48 47.99,-57.44 73,-33.62 78.58,-28.31 85.56,-23.85 92.36,-20.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.77,-23.47 101.3,-16.01 90.77,-17.15 93.77,-23.47"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.31,-51.02C257.21,-52.61 268.31,-54.59 279.59,-56.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.9,-60.03 289.36,-58.34 280.13,-53.14 278.9,-60.03"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge10_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge10_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.58,-15.07C151.69,-20.79 177.44,-29.94 197.55,-37.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.32,-40.35 206.91,-40.4 198.66,-33.76 196.32,-40.35"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255,-19.25 201.5,-19.25 201.5,0 255,0 255,-19.25"/>
-<text text-anchor="middle" x="228.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">compare</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge9_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.58,-9.62C149.68,-9.62 171.15,-9.62 189.78,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.69,-13.13 199.69,-9.63 189.69,-6.13 189.69,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index b8ea09b6a..000000000
--- a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,183 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="391pt" height="252pt"
- viewBox="0.00 0.00 390.75 252.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 248.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-133.25 0,-133.25 0,-114 37,-114 37,-133.25"/>
-<text text-anchor="middle" x="18.5" y="-119.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.5,-244.25 73,-244.25 73,-225 165.5,-225 165.5,-244.25"/>
-<text text-anchor="middle" x="119.25" y="-230.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.69,-133.47C29.22,-152.18 45.82,-193.09 73,-216.62 73.78,-217.3 74.59,-217.96 75.43,-218.59"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.45,-221.48 83.81,-223.72 77.11,-215.51 73.45,-221.48"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146,-207.25 92.5,-207.25 92.5,-188 146,-188 146,-207.25"/>
-<text text-anchor="middle" x="119.25" y="-193.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.81,-133.58C36.27,-145.86 53.83,-166.69 73,-179.62 75.85,-181.55 78.94,-183.32 82.12,-184.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.46,-188.02 91.01,-188.92 83.33,-181.63 80.46,-188.02"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.88,-170.25 78.62,-170.25 78.62,-151 159.88,-151 159.88,-170.25"/>
-<text text-anchor="middle" x="119.25" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.15,-130.24C49.3,-134.79 65.88,-141 80.88,-146.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.44,-149.82 90.03,-150.05 81.89,-143.26 79.44,-149.82"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/getline.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="151.25,-133.25 87.25,-133.25 87.25,-114 151.25,-114 151.25,-133.25"/>
-<text text-anchor="middle" x="119.25" y="-119.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::getline</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.15,-123.62C47.9,-123.62 62.13,-123.62 75.66,-123.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.26,-127.13 85.26,-123.63 75.26,-120.13 75.26,-127.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9" target="_top" xlink:title="function to convert a C++ string to lower case">
-<polygon fill="white" stroke="#666666" points="247.88,-57.25 208.62,-57.25 208.62,-38 247.88,-38 247.88,-57.25"/>
-<text text-anchor="middle" x="228.25" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">lower</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.56,-113.72C35.77,-101.63 53.06,-81.57 73,-71.62 112.78,-51.78 164.92,-47.51 197.24,-47.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="197.09,-50.51 207.08,-46.98 197.07,-43.51 197.09,-50.51"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="382.75,-76.25 291,-76.25 291,-57 382.75,-57 382.75,-76.25"/>
-<text text-anchor="middle" x="336.88" y="-62.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.06,-116.4C47.38,-112.4 60.75,-107.65 73,-104.62 143.06,-87.3 225.72,-76.96 279.38,-71.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="279.59,-75.03 289.2,-70.57 278.9,-68.06 279.59,-75.03"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="135.5,-19.25 103,-19.25 103,0 135.5,0 135.5,-19.25"/>
-<text text-anchor="middle" x="119.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge8_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.35,-113.51C30.64,-95.48 47.99,-57.44 73,-33.62 78.58,-28.31 85.56,-23.85 92.36,-20.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.77,-23.47 101.3,-16.01 90.77,-17.15 93.77,-23.47"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.31,-51.02C257.21,-52.61 268.31,-54.59 279.59,-56.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.9,-60.03 289.36,-58.34 280.13,-53.14 278.9,-60.03"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge10_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge10_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.58,-15.07C151.69,-20.79 177.44,-29.94 197.55,-37.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.32,-40.35 206.91,-40.4 198.66,-33.76 196.32,-40.35"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255,-19.25 201.5,-19.25 201.5,0 255,0 255,-19.25"/>
-<text text-anchor="middle" x="228.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">compare</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge9_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.58,-9.62C149.68,-9.62 171.15,-9.62 189.78,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.69,-13.13 199.69,-9.63 189.69,-6.13 189.69,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/db5/text__search_8cpp_source.html b/dc/db5/text__search_8cpp_source.html
new file mode 100644
index 000000000..1c3d37e29
--- /dev/null
+++ b/dc/db5/text__search_8cpp_source.html
@@ -0,0 +1,229 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: search/text_search.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dc/db5/text__search_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">text_search.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dc/db5/text__search_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;cstdlib&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#ifdef _MSC_VER</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;string&gt;</span>  <span class="comment">// required for MS Visual C++</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="foldopen" id="foldopen00019" data-start="{" data-end="}">
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"><a class="line" href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9">   19</a></span>std::string <a class="code hl_function" href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9">lower</a>(std::string word) {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="keywordtype">int</span> length = word.length();</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    std::string lc = <span class="stringliteral">&quot;&quot;</span>;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; length; i++) {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        lc += tolower(word[i]);</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    }</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordflow">return</span> lc;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>}</div>
+</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="foldopen" id="foldopen00034" data-start="{" data-end="}">
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   34</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    assert(<a class="code hl_function" href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9">lower</a>(<span class="stringliteral">&quot;abcd&quot;</span>).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(<span class="stringliteral">&quot;abcd&quot;</span>) == 0);</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    assert(<a class="code hl_function" href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9">lower</a>(<span class="stringliteral">&quot;abc&quot;</span>).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(<span class="stringliteral">&quot;abcd&quot;</span>) == -1);</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    assert(<a class="code hl_function" href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9">lower</a>(<span class="stringliteral">&quot;abcd&quot;</span>).<a class="code hl_function" href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a>(<span class="stringliteral">&quot;abc&quot;</span>) == 1);</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>}</div>
+</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="foldopen" id="foldopen00044" data-start="{" data-end="}">
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="../../dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   44</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <a class="code hl_function" href="../../dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    std::string paragraph;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Please enter your paragraph: \n&quot;</span>;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    std::getline(std::cin, paragraph);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nHello, your paragraph is:\n &quot;</span> &lt;&lt; paragraph &lt;&lt; <span class="stringliteral">&quot;!\n&quot;</span>;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nThe size of your paragraph = &quot;</span> &lt;&lt; paragraph.size()</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>              &lt;&lt; <span class="stringliteral">&quot; characters. \n\n&quot;</span>;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">if</span> (paragraph.empty()) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nThe paragraph is empty&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        <span class="keywordtype">int</span> ch = 0;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>            std::string word;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Please enter the word you are searching for: &quot;</span>;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            std::getline(std::cin, word);</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Ignore case-sensitive? 1 = Yes, 0 = No&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            std::cin &gt;&gt; ch;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            <span class="keywordflow">if</span> (ch == 1) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>                std::string lowerCase = <a class="code hl_function" href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9">lower</a>(</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>                    paragraph);  <span class="comment">// convert std::string paragraph to lowercase</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>                                 <span class="comment">// and store it in std::string lowerCase</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>                std::string lowerCaseWord =</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                    <a class="code hl_function" href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9">lower</a>(word);  <span class="comment">// convert std::string paragraph to lowercase</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>                                  <span class="comment">// and store it in std::string lowerCase</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Hello, your word is &quot;</span> &lt;&lt; word &lt;&lt; <span class="stringliteral">&quot;!\n&quot;</span>;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>                <span class="keywordflow">if</span> (lowerCase.find(lowerCaseWord) == std::string::npos) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>                    std::cout &lt;&lt; word &lt;&lt; <span class="stringliteral">&quot; does not exist in the sentence&quot;</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>                              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>                } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;The word &quot;</span> &lt;&lt; word</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>                              &lt;&lt; <span class="stringliteral">&quot; is now found at location &quot;</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>                              &lt;&lt; lowerCase.find(lowerCaseWord) &lt;&lt; std::endl</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>                              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>                }</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Hello, your word is &quot;</span> &lt;&lt; word &lt;&lt; <span class="stringliteral">&quot;!\n&quot;</span>;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>                <span class="keywordflow">if</span> (paragraph.find(word) == std::string::npos) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>                    std::cout &lt;&lt; word &lt;&lt; <span class="stringliteral">&quot; does not exist in the sentence&quot;</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>                              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>                } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>                    std::cout &lt;&lt; <span class="stringliteral">&quot;The word &quot;</span> &lt;&lt; word</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>                              &lt;&lt; <span class="stringliteral">&quot; is now found at location &quot;</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>                              &lt;&lt; paragraph.find(word) &lt;&lt; std::endl</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>                              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>                }</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>            }</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nPress Ctrl + C to exit the program.\n\n&quot;</span>;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>            std::cin.get();</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        }</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>}</div>
+</div>
+<div class="ttc" id="ashell__sort2_8cpp_html_a7eb77daed2cf1513f6d68c47a1c2db1c"><div class="ttname"><a href="../../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c">compare</a></div><div class="ttdeci">int compare(const void *a, const void *b)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d7a/shell__sort2_8cpp_source.html#l00087">shell_sort2.cpp:87</a></div></div>
+<div class="ttc" id="atext__search_8cpp_html_a3f8975d227cd0e58f298b380c5dac0d9"><div class="ttname"><a href="../../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9">lower</a></div><div class="ttdeci">std::string lower(std::string word)</div><div class="ttdoc">function to convert a C++ string to lower case</div><div class="ttdef"><b>Definition</b> <a href="#l00019">text_search.cpp:19</a></div></div>
+<div class="ttc" id="atext__search_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/db5/text__search_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> <a href="#l00034">text_search.cpp:34</a></div></div>
+<div class="ttc" id="atext__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00044">text_search.cpp:44</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../dc/db5/text__search_8cpp.html">text_search.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html b/dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html
index 0cfc4b4cc..1a72a3a70 100644
--- a/dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html
+++ b/dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: /Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp</title>
+<title>TheAlgorithms/C++: /Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -108,62 +125,15 @@ $(function(){initNavTree('dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plu
 </div><!--header-->
 <div class="contents">
 <p>it solves \frac{\mathrm{d} y}{\mathrm{d} x}= \frac{\left ( x-y \right )}{2} given x for given initial conditions There can be many such equations</p>
-<div class="fragment"><div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @{</span></div>
-<div class="line"><span class="comment"> * \file</span></div>
-<div class="line"><span class="comment"> * \brief [Runge Kutta fourth</span></div>
-<div class="line"><span class="comment"> * order](https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods) method</span></div>
-<div class="line"><span class="comment"> * implementation</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * \author [Rudra Prasad Das](http://github.com/rudra697)</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * \details</span></div>
-<div class="line"><span class="comment"> * It solves the unknown value of y</span></div>
-<div class="line"><span class="comment"> * for a given value of x</span></div>
-<div class="line"><span class="comment"> * only first order differential equations</span></div>
-<div class="line"><span class="comment"> * can be solved</span></div>
-<div class="line"><span class="comment"> * \example</span></div>
-<div class="line"><span class="comment"> * it solves \frac{\mathrm{d} y}{\mathrm{d} x}= \frac{\left ( x-y \right )}{2}</span></div>
-<div class="line"><span class="comment"> * given x for given initial</span></div>
-<div class="line"><span class="comment"> * conditions</span></div>
-<div class="line"><span class="comment"> * There can be many such equations</span></div>
-<div class="line"><span class="comment"> */</span></div>
-<div class="line"><span class="preprocessor">#include &lt;cassert&gt;</span>   <span class="comment">/// asserting the test functions</span></div>
+<div class="fragment"><div class="line"> </div>
+<div class="line"><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
 <div class="line"><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
-<div class="line"><span class="preprocessor">#include &lt;iostream&gt;</span>  <span class="comment">/// for io operations</span></div>
-<div class="line"><span class="preprocessor">#include &lt;vector&gt;</span>    <span class="comment">/// for using the vector container</span><span class="comment"></span></div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @brief The change() function is used</span></div>
-<div class="line"><span class="comment"> * to return the updated iterative value corresponding</span></div>
-<div class="line"><span class="comment"> * to the given function</span></div>
-<div class="line"><span class="comment"> * @param x is the value corresponding to the x coordinate</span></div>
-<div class="line"><span class="comment"> * @param y is the value corresponding to the y coordinate</span></div>
-<div class="line"><span class="comment"> * @returns the computed function value at that call</span></div>
-<div class="line"><span class="comment"> */</span></div>
+<div class="line"><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
 <div class="line"><span class="keyword">static</span> <span class="keywordtype">double</span> <a id="a0" name="a0"></a><a class="code hl_function" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(<span class="keywordtype">double</span> x, <span class="keywordtype">double</span> y) { <span class="keywordflow">return</span> ((x - y) / 2.0); }</div>
-<div class="line"><span class="comment"></span> </div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @namespace numerical_methods</span></div>
-<div class="line"><span class="comment"> * @brief Numerical Methods</span></div>
-<div class="line"><span class="comment"> */</span></div>
-<div class="line"><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a> {<span class="comment"></span></div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @namespace runge_kutta</span></div>
-<div class="line"><span class="comment"> * @brief Functions for [Runge Kutta fourth</span></div>
-<div class="line"><span class="comment"> * order](https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods) method</span></div>
-<div class="line"><span class="comment"> */</span></div>
-<div class="line"><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/de7/namespacerunge__kutta.html">runge_kutta</a> {<span class="comment"></span></div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @brief the Runge Kutta method finds the value of integration of a function in</span></div>
-<div class="line"><span class="comment"> * the given limits. the lower limit of integration as the initial value and the</span></div>
-<div class="line"><span class="comment"> * upper limit is the given x</span></div>
-<div class="line"><span class="comment"> * @param init_x is the value of initial x and is updated after each call</span></div>
-<div class="line"><span class="comment"> * @param init_y is the value of initial x and is updated after each call</span></div>
-<div class="line"><span class="comment"> * @param x is current iteration at which the function needs to be evaluated</span></div>
-<div class="line"><span class="comment"> * @param h is the step value</span></div>
-<div class="line"><span class="comment"> * @returns the value of y at thr required value of x from the initial</span></div>
-<div class="line"><span class="comment"> * conditions</span></div>
-<div class="line"><span class="comment"> */</span></div>
+<div class="line"> </div>
+<div class="line"><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a> {</div>
+<div class="line"><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/de7/namespacerunge__kutta.html">runge_kutta</a> {</div>
 <div class="line"><span class="keywordtype">double</span> <a id="a1" name="a1"></a>rungeKutta(<span class="keywordtype">double</span> init_x, <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;init_y, <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x,</div>
 <div class="line">                  <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;<a id="a2" name="a2"></a><a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>) {</div>
 <div class="line">    <span class="comment">// Count number of iterations</span></div>
@@ -176,7 +146,7 @@ $(function(){initNavTree('dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plu
 <div class="line"> </div>
 <div class="line">    <span class="keyword">auto</span> n = <span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>((x - init_x) / <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>);</div>
 <div class="line">    <span class="comment">// used a vector container for the variables</span></div>
-<div class="line">    <a id="_a3" name="_a3"></a><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> k(4, 0.0);</div>
+<div class="line">    std::vector&lt;double&gt; k(4, 0.0);</div>
 <div class="line"> </div>
 <div class="line">    <span class="comment">// Iterate for number of iterations</span></div>
 <div class="line"> </div>
@@ -202,54 +172,44 @@ $(function(){initNavTree('dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plu
 <div class="line">}</div>
 <div class="line">}  <span class="comment">// namespace runge_kutta</span></div>
 <div class="line">}  <span class="comment">// namespace numerical_methods</span></div>
-<div class="line"><span class="comment"></span> </div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @brief Tests to check algorithm implementation.</span></div>
-<div class="line"><span class="comment"> * @returns void</span></div>
-<div class="line"><span class="comment"> */</span></div>
-<div class="line"><span class="keyword">static</span> <span class="keywordtype">void</span> <a id="a4" name="a4"></a><a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
-<div class="line">    <a id="_a5" name="_a5"></a><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The Runge Kutta function will be tested on the basis of &quot;</span></div>
+<div class="line"> </div>
+<div class="line"><span class="keyword">static</span> <span class="keywordtype">void</span> <a id="a3" name="a3"></a><a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;The Runge Kutta function will be tested on the basis of &quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;precomputed values\n&quot;</span>;</div>
 <div class="line"> </div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1....&quot;</span></div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1....&quot;</span></div>
 <div class="line">              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line">    <span class="keywordtype">double</span> valfirst = <a class="code hl_function" href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a>(</div>
 <div class="line">        2, 3, 4, 0.2);  <span class="comment">// Tests the function with pre calculated values</span></div>
 <div class="line">    assert(valfirst == 3.10363932323749570);</div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 1\n&quot;</span>;</div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 1\n&quot;</span>;</div>
 <div class="line"> </div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2....&quot;</span></div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2....&quot;</span></div>
 <div class="line">              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line">    <span class="keywordtype">double</span> valsec = <a class="code hl_function" href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a>(</div>
 <div class="line">        1, 2, 5, 0.1);  <span class="comment">// The value of step changed</span></div>
 <div class="line">    assert(valsec == 3.40600589380261409);</div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 2\n&quot;</span>;</div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 2\n&quot;</span>;</div>
 <div class="line"> </div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3....&quot;</span></div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3....&quot;</span></div>
 <div class="line">              &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line">    <span class="keywordtype">double</span> valthird = <a class="code hl_function" href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a>(</div>
 <div class="line">        -1, 3, 4, 0.1);  <span class="comment">// Tested with negative value</span></div>
 <div class="line">    assert(valthird == 2.49251005860244268);</div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 3\n&quot;</span>;</div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 3\n&quot;</span>;</div>
 <div class="line">}</div>
-<div class="line"><span class="comment"></span> </div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @brief Main function</span></div>
-<div class="line"><span class="comment"> * @returns 0 on exit</span></div>
-<div class="line"><span class="comment"> */</span></div>
-<div class="line"><span class="keywordtype">int</span> <a id="a6" name="a6"></a><a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"> </div>
+<div class="line"><span class="keywordtype">int</span> <a id="a4" name="a4"></a><a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
 <div class="line">    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Execute the tests</span></div>
 <div class="line">    <span class="keywordflow">return</span> 0;</div>
 <div class="line">}</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="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> generate_parentheses.cpp:82</div></div>
-<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> generate_parentheses.cpp:110</div></div>
-<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> hash_search.cpp:45</div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00082">generate_parentheses.cpp:82</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00045">hash_search.cpp:45</a></div></div>
 <div class="ttc" id="anamespacenumerical__methods_html"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></div><div class="ttdoc">for assert</div></div>
 <div class="ttc" id="anamespacerunge__kutta_html"><div class="ttname"><a href="../../d2/de7/namespacerunge__kutta.html">runge_kutta</a></div><div class="ttdoc">Functions for Runge Kutta fourth order method.</div></div>
-<div class="ttc" id="arungekutta_8cpp_html_a450497475f5607333f9aca8f88901579"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a></div><div class="ttdeci">static double change(double x, double y)</div><div class="ttdoc">asserting the test functions</div><div class="ttdef"><b>Definition</b> rungekutta.cpp:33</div></div>
-<div class="ttc" id="arungekutta_8cpp_html_a7b9f40c7b5e9749cc550f19be3dc8856"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a></div><div class="ttdeci">double rungeKutta(double init_x, const double &amp;init_y, const double &amp;x, const double &amp;h)</div><div class="ttdoc">the Runge Kutta method finds the value of integration of a function in the given limits....</div><div class="ttdef"><b>Definition</b> rungekutta.cpp:57</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 class="ttc" id="arungekutta_8cpp_html_a450497475f5607333f9aca8f88901579"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a></div><div class="ttdeci">static double change(double x, double y)</div><div class="ttdoc">asserting the test functions</div><div class="ttdef"><b>Definition</b> <a href="../../d1/da6/rungekutta_8cpp_source.html#l00033">rungekutta.cpp:33</a></div></div>
+<div class="ttc" id="arungekutta_8cpp_html_a7b9f40c7b5e9749cc550f19be3dc8856"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a></div><div class="ttdeci">double rungeKutta(double init_x, const double &amp;init_y, const double &amp;x, const double &amp;h)</div><div class="ttdoc">the Runge Kutta method finds the value of integration of a function in the given limits....</div><div class="ttdef"><b>Definition</b> <a href="../../d1/da6/rungekutta_8cpp_source.html#l00057">rungekutta.cpp:57</a></div></div>
 </div><!-- fragment --> </div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/dc/dc5/namespacereverse__binary__tree.html b/dc/dc5/namespacereverse__binary__tree.html
index 7889bcce5..88955764c 100644
--- a/dc/dc5/namespacereverse__binary__tree.html
+++ b/dc/dc5/namespacereverse__binary__tree.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: reverse_binary_tree Namespace Reference</title>
+<title>TheAlgorithms/C++: reverse_binary_tree Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dc/dc5/paranthesis__matching_8cpp.html b/dc/dc5/paranthesis__matching_8cpp.html
index c709668ce..3e593719d 100644
--- a/dc/dc5/paranthesis__matching_8cpp.html
+++ b/dc/dc5/paranthesis__matching_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/paranthesis_matching.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/paranthesis_matching.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for paranthesis_matching.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d8a/paranthesis__matching_8cpp__incl.svg" width="166" height="126"><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">
+</div>
+<p><a href="../../dc/dc5/paranthesis__matching_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="define-members" name="define-members"></a>
 Macros</h2></td></tr>
 <tr class="memitem:a392fb874e547e582e9c66a08a1f23326" id="r_a392fb874e547e582e9c66a08a1f23326"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a392fb874e547e582e9c66a08a1f23326">MAX</a>&#160;&#160;&#160;100</td></tr>
@@ -134,9 +153,8 @@ Functions</h2></td></tr>
 <tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa37d24a036d239b3b528f13b9de880c7" id="r_aa37d24a036d239b3b528f13b9de880c7"><td class="memItemLeft" align="right" valign="top">char&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa37d24a036d239b3b528f13b9de880c7">stack</a> [MAX]</td></tr>
 <tr class="separator:aa37d24a036d239b3b528f13b9de880c7"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af4c937d823c412d99fbe60c99dbf0a4f" id="r_af4c937d823c412d99fbe60c99dbf0a4f"><td class="memItemLeft" align="right" valign="top"><a id="af4c937d823c412d99fbe60c99dbf0a4f" name="af4c937d823c412d99fbe60c99dbf0a4f"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>stack_idx</b> = -1</td></tr>
-<tr class="memdesc:af4c937d823c412d99fbe60c99dbf0a4f"><td class="mdescLeft">&#160;</td><td class="mdescRight">pointer to track stack index <br /></td></tr>
+<tr class="memitem:af4c937d823c412d99fbe60c99dbf0a4f" id="r_af4c937d823c412d99fbe60c99dbf0a4f"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a> = -1</td></tr>
+<tr class="memdesc:af4c937d823c412d99fbe60c99dbf0a4f"><td class="mdescLeft">&#160;</td><td class="mdescRight">pointer to track stack index  <br /></td></tr>
 <tr class="separator:af4c937d823c412d99fbe60c99dbf0a4f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aae41c72130114bf31204cde6873b6095" id="r_aae41c72130114bf31204cde6873b6095"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aae41c72130114bf31204cde6873b6095">push</a> (char ch)</td></tr>
 <tr class="memdesc:aae41c72130114bf31204cde6873b6095"><td class="mdescLeft">&#160;</td><td class="mdescRight">push byte to stack variable  <br /></td></tr>
@@ -151,6 +169,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>stack_idx</b> = -1</td
 <dd>
 Implementation is C-type and does not utilize the C++ constructs </dd></dl>
 <dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000009">Todo</a></b></dt><dd>implement as a C++ class </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../dc/dc5/paranthesis__matching_8cpp_source.html">paranthesis_matching.cpp</a>.</p>
 </div><h2 class="groupheader">Macro Definition Documentation</h2>
 <a id="a392fb874e547e582e9c66a08a1f23326" name="a392fb874e547e582e9c66a08a1f23326"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a392fb874e547e582e9c66a08a1f23326">&#9670;&#160;</a></span>MAX</h2>
@@ -165,6 +185,8 @@ Implementation is C-type and does not utilize the C++ constructs </dd></dl>
 </div><div class="memdoc">
 <p>check number </p>
 
+<p class="definition">Definition at line <a class="el" href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00016">16</a> of file <a class="el" href="../../dc/dc5/paranthesis__matching_8cpp_source.html">paranthesis_matching.cpp</a>.</p>
+
 </div>
 </div>
 <h2 class="groupheader">Function Documentation</h2>
@@ -182,13 +204,15 @@ Implementation is C-type and does not utilize the C++ constructs </dd></dl>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00050">50</a> of file <a class="el" href="../../dc/dc5/paranthesis__matching_8cpp_source.html">paranthesis_matching.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   50</span>           {</div>
-<div class="line"><span class="lineno">   51</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">exp</a>;</div>
+<div class="line"><span class="lineno">   51</span>    std::string <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">exp</a>;</div>
 <div class="line"><span class="lineno">   52</span>    <span class="keywordtype">int</span> valid = 1, i = 0;</div>
-<div class="line"><span class="lineno">   53</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter The Expression : &quot;</span>;</div>
-<div class="line"><span class="lineno">   54</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">exp</a>;</div>
+<div class="line"><span class="lineno">   53</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter The Expression : &quot;</span>;</div>
+<div class="line"><span class="lineno">   54</span>    std::cin &gt;&gt; <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">exp</a>;</div>
 <div class="line"><span class="lineno">   55</span> </div>
-<div class="line"><span class="lineno">   56</span>    <span class="keywordflow">while</span> (valid == 1 &amp;&amp; i &lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">exp</a>.length()) {</div>
+<div class="line"><span class="lineno">   56</span>    <span class="keywordflow">while</span> (valid == 1 &amp;&amp; i &lt; <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">exp</a>.length()) {</div>
 <div class="line"><span class="lineno">   57</span>        <span class="keywordflow">if</span> (exp[i] == <span class="charliteral">&#39;(&#39;</span> || exp[i] == <span class="charliteral">&#39;{&#39;</span> || exp[i] == <span class="charliteral">&#39;[&#39;</span> || exp[i] == <span class="charliteral">&#39;&lt;&#39;</span>) {</div>
 <div class="line"><span class="lineno">   58</span>            <a class="code hl_function" href="#aae41c72130114bf31204cde6873b6095">push</a>(exp[i]);</div>
 <div class="line"><span class="lineno">   59</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a> &gt;= 0 &amp;&amp; <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[<a class="code hl_variable" href="#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a>] == <a class="code hl_function" href="#ade525d33459755a32ba21e1b6910ff21">opening</a>(exp[i])) {</div>
@@ -201,22 +225,19 @@ Implementation is C-type and does not utilize the C++ constructs </dd></dl>
 <div class="line"><span class="lineno">   66</span> </div>
 <div class="line"><span class="lineno">   67</span>    <span class="comment">// makes sure the stack is empty after processsing (above)</span></div>
 <div class="line"><span class="lineno">   68</span>    <span class="keywordflow">if</span> (valid == 1 &amp;&amp; <a class="code hl_variable" href="#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a> == -1) {</div>
-<div class="line"><span class="lineno">   69</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nCorrect Expression&quot;</span>;</div>
+<div class="line"><span class="lineno">   69</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nCorrect Expression&quot;</span>;</div>
 <div class="line"><span class="lineno">   70</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   71</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nWrong Expression&quot;</span>;</div>
+<div class="line"><span class="lineno">   71</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nWrong Expression&quot;</span>;</div>
 <div class="line"><span class="lineno">   72</span>    }</div>
 <div class="line"><span class="lineno">   73</span> </div>
 <div class="line"><span class="lineno">   74</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   75</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> stack.hpp:19</div></div>
-<div class="ttc" id="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div>
-<div class="ttc" id="aparanthesis__matching_8cpp_html_a6d25c7dfbfeb52c3cb9d1b56ab49b664"><div class="ttname"><a href="#a6d25c7dfbfeb52c3cb9d1b56ab49b664">pop</a></div><div class="ttdeci">char pop()</div><div class="ttdoc">pop a byte out of stack variable</div><div class="ttdef"><b>Definition</b> paranthesis_matching.cpp:29</div></div>
-<div class="ttc" id="aparanthesis__matching_8cpp_html_aae41c72130114bf31204cde6873b6095"><div class="ttname"><a href="#aae41c72130114bf31204cde6873b6095">push</a></div><div class="ttdeci">void push(char ch)</div><div class="ttdoc">push byte to stack variable</div><div class="ttdef"><b>Definition</b> paranthesis_matching.cpp:26</div></div>
-<div class="ttc" id="aparanthesis__matching_8cpp_html_ade525d33459755a32ba21e1b6910ff21"><div class="ttname"><a href="#ade525d33459755a32ba21e1b6910ff21">opening</a></div><div class="ttdeci">char opening(char ch)</div><div class="ttdef"><b>Definition</b> paranthesis_matching.cpp:36</div></div>
-<div class="ttc" id="aparanthesis__matching_8cpp_html_af4c937d823c412d99fbe60c99dbf0a4f"><div class="ttname"><a href="#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a></div><div class="ttdeci">int stack_idx</div><div class="ttdoc">pointer to track stack index</div><div class="ttdef"><b>Definition</b> paranthesis_matching.cpp:23</div></div>
+<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00019">stack.hpp:19</a></div></div>
+<div class="ttc" id="anamespaceciphers_1_1elliptic__curve__key__exchange_html_ac00616a4e40d3cd5cfb4da87d9ff9af0"><div class="ttname"><a href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">ciphers::elliptic_curve_key_exchange::exp</a></div><div class="ttdeci">uint256_t exp(uint256_t number, uint256_t power, const uint256_t &amp;mod)</div><div class="ttdoc">This function calculates number raised to exponent power under modulo mod using Modular Exponentiatio...</div><div class="ttdef"><b>Definition</b> <a href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00078">elliptic_curve_key_exchange.cpp:78</a></div></div>
+<div class="ttc" id="aparanthesis__matching_8cpp_html_a6d25c7dfbfeb52c3cb9d1b56ab49b664"><div class="ttname"><a href="#a6d25c7dfbfeb52c3cb9d1b56ab49b664">pop</a></div><div class="ttdeci">char pop()</div><div class="ttdoc">pop a byte out of stack variable</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00029">paranthesis_matching.cpp:29</a></div></div>
+<div class="ttc" id="aparanthesis__matching_8cpp_html_aae41c72130114bf31204cde6873b6095"><div class="ttname"><a href="#aae41c72130114bf31204cde6873b6095">push</a></div><div class="ttdeci">void push(char ch)</div><div class="ttdoc">push byte to stack variable</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00026">paranthesis_matching.cpp:26</a></div></div>
+<div class="ttc" id="aparanthesis__matching_8cpp_html_ade525d33459755a32ba21e1b6910ff21"><div class="ttname"><a href="#ade525d33459755a32ba21e1b6910ff21">opening</a></div><div class="ttdeci">char opening(char ch)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00036">paranthesis_matching.cpp:36</a></div></div>
+<div class="ttc" id="aparanthesis__matching_8cpp_html_af4c937d823c412d99fbe60c99dbf0a4f"><div class="ttname"><a href="#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a></div><div class="ttdeci">int stack_idx</div><div class="ttdoc">pointer to track stack index</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00023">paranthesis_matching.cpp:23</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -240,6 +261,8 @@ Implementation is C-type and does not utilize the C++ constructs </dd></dl>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../dc/dc5/paranthesis__matching_8cpp_source.html">paranthesis_matching.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   36</span>                      {</div>
 <div class="line"><span class="lineno">   37</span>    <span class="keywordflow">switch</span> (ch) {</div>
 <div class="line"><span class="lineno">   38</span>    <span class="keywordflow">case</span> <span class="charliteral">&#39;}&#39;</span>:</div>
@@ -272,6 +295,8 @@ Implementation is C-type and does not utilize the C++ constructs </dd></dl>
 </div><div class="memdoc">
 
 <p>pop a byte out of stack variable </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../dc/dc5/paranthesis__matching_8cpp_source.html">paranthesis_matching.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   29</span>{ <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[<a class="code hl_variable" href="#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a>--]; }</div>
 </div><!-- fragment -->
 </div>
@@ -292,6 +317,8 @@ Implementation is C-type and does not utilize the C++ constructs </dd></dl>
 </div><div class="memdoc">
 
 <p>push byte to stack variable </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00026">26</a> of file <a class="el" href="../../dc/dc5/paranthesis__matching_8cpp_source.html">paranthesis_matching.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   26</span>{ <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[++<a class="code hl_variable" href="#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a>] = ch; }</div>
 </div><!-- fragment -->
 </div>
@@ -310,6 +337,26 @@ Implementation is C-type and does not utilize the C++ constructs </dd></dl>
 </div><div class="memdoc">
 <p>-----------&mdash; stack -----------&mdash; global stack </p>
 
+<p class="definition">Definition at line <a class="el" href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00020">20</a> of file <a class="el" href="../../dc/dc5/paranthesis__matching_8cpp_source.html">paranthesis_matching.cpp</a>.</p>
+
+</div>
+</div>
+<a id="af4c937d823c412d99fbe60c99dbf0a4f" name="af4c937d823c412d99fbe60c99dbf0a4f"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#af4c937d823c412d99fbe60c99dbf0a4f">&#9670;&#160;</a></span>stack_idx</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int stack_idx = -1</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>pointer to track stack index </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/dc5/paranthesis__matching_8cpp_source.html#l00023">23</a> of file <a class="el" href="../../dc/dc5/paranthesis__matching_8cpp_source.html">paranthesis_matching.cpp</a>.</p>
+
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dc/dc5/paranthesis__matching_8cpp_source.html b/dc/dc5/paranthesis__matching_8cpp_source.html
new file mode 100644
index 000000000..5d88492b2
--- /dev/null
+++ b/dc/dc5/paranthesis__matching_8cpp_source.html
@@ -0,0 +1,206 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/paranthesis_matching.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dc/dc5/paranthesis__matching_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">paranthesis_matching.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dc/dc5/paranthesis__matching_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#ifdef _MSC_VER</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;string&gt;</span>  <span class="comment">// Visual Studio C requires this include</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"><a class="line" href="../../dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326">   16</a></span><span class="preprocessor">#define MAX 100</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"><a class="line" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">   20</a></span><span class="keywordtype">char</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[<a class="code hl_define" href="../../dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a>];</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"><a class="line" href="../../dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f">   23</a></span><span class="keywordtype">int</span> <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a> = -1;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"><a class="line" href="../../dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095">   26</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095">push</a>(<span class="keywordtype">char</span> ch) { <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[++<a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a>] = ch; }</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664">   29</a></span><span class="keywordtype">char</span> <a class="code hl_function" href="../../dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664">pop</a>() { <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[<a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a>--]; }</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="foldopen" id="foldopen00036" data-start="{" data-end="}">
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../dc/dc5/paranthesis__matching_8cpp.html#ade525d33459755a32ba21e1b6910ff21">   36</a></span><span class="keywordtype">char</span> <a class="code hl_function" href="../../dc/dc5/paranthesis__matching_8cpp.html#ade525d33459755a32ba21e1b6910ff21">opening</a>(<span class="keywordtype">char</span> ch) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">switch</span> (ch) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">case</span> <span class="charliteral">&#39;}&#39;</span>:</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;{&#39;</span>;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">case</span> <span class="charliteral">&#39;]&#39;</span>:</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;[&#39;</span>;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">case</span> <span class="charliteral">&#39;)&#39;</span>:</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;(&#39;</span>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">case</span> <span class="charliteral">&#39;&gt;&#39;</span>:</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="keywordflow">return</span> <span class="charliteral">&#39;&lt;&#39;</span>;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    }</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">return</span> <span class="charliteral">&#39;\0&#39;</span>;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>}</div>
+</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    std::string <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">exp</a>;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordtype">int</span> valid = 1, i = 0;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter The Expression : &quot;</span>;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    std::cin &gt;&gt; <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">exp</a>;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">while</span> (valid == 1 &amp;&amp; i &lt; <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">exp</a>.length()) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        <span class="keywordflow">if</span> (exp[i] == <span class="charliteral">&#39;(&#39;</span> || exp[i] == <span class="charliteral">&#39;{&#39;</span> || exp[i] == <span class="charliteral">&#39;[&#39;</span> || exp[i] == <span class="charliteral">&#39;&lt;&#39;</span>) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>            <a class="code hl_function" href="../../dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095">push</a>(exp[i]);</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a> &gt;= 0 &amp;&amp; <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[<a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a>] == <a class="code hl_function" href="../../dc/dc5/paranthesis__matching_8cpp.html#ade525d33459755a32ba21e1b6910ff21">opening</a>(exp[i])) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            <a class="code hl_function" href="../../dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664">pop</a>();</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            valid = 0;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        i++;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="comment">// makes sure the stack is empty after processsing (above)</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keywordflow">if</span> (valid == 1 &amp;&amp; <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a> == -1) {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nCorrect Expression&quot;</span>;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nWrong Expression&quot;</span>;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    }</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>}</div>
+<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/stack_8hpp_source.html#l00019">stack.hpp:19</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespaceciphers_1_1elliptic__curve__key__exchange_html_ac00616a4e40d3cd5cfb4da87d9ff9af0"><div class="ttname"><a href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">ciphers::elliptic_curve_key_exchange::exp</a></div><div class="ttdeci">uint256_t exp(uint256_t number, uint256_t power, const uint256_t &amp;mod)</div><div class="ttdoc">This function calculates number raised to exponent power under modulo mod using Modular Exponentiatio...</div><div class="ttdef"><b>Definition</b> <a href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00078">elliptic_curve_key_exchange.cpp:78</a></div></div>
+<div class="ttc" id="aparanthesis__matching_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdef"><b>Definition</b> <a href="#l00016">paranthesis_matching.cpp:16</a></div></div>
+<div class="ttc" id="aparanthesis__matching_8cpp_html_a6d25c7dfbfeb52c3cb9d1b56ab49b664"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664">pop</a></div><div class="ttdeci">char pop()</div><div class="ttdoc">pop a byte out of stack variable</div><div class="ttdef"><b>Definition</b> <a href="#l00029">paranthesis_matching.cpp:29</a></div></div>
+<div class="ttc" id="aparanthesis__matching_8cpp_html_aae41c72130114bf31204cde6873b6095"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095">push</a></div><div class="ttdeci">void push(char ch)</div><div class="ttdoc">push byte to stack variable</div><div class="ttdef"><b>Definition</b> <a href="#l00026">paranthesis_matching.cpp:26</a></div></div>
+<div class="ttc" id="aparanthesis__matching_8cpp_html_ade525d33459755a32ba21e1b6910ff21"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#ade525d33459755a32ba21e1b6910ff21">opening</a></div><div class="ttdeci">char opening(char ch)</div><div class="ttdef"><b>Definition</b> <a href="#l00036">paranthesis_matching.cpp:36</a></div></div>
+<div class="ttc" id="aparanthesis__matching_8cpp_html_af4c937d823c412d99fbe60c99dbf0a4f"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a></div><div class="ttdeci">int stack_idx</div><div class="ttdoc">pointer to track stack index</div><div class="ttdef"><b>Definition</b> <a href="#l00023">paranthesis_matching.cpp:23</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../dc/dc5/paranthesis__matching_8cpp.html">paranthesis_matching.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dc/dd3/classbacktracking_1_1generate__parentheses-members.html b/dc/dd3/classbacktracking_1_1generate__parentheses-members.html
index 31cebcd0b..f7ebda787 100644
--- a/dc/dd3/classbacktracking_1_1generate__parentheses-members.html
+++ b/dc/dd3/classbacktracking_1_1generate__parentheses-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dc/dd4/classdata__structures_1_1_bloom_filter.html b/dc/dd4/classdata__structures_1_1_bloom_filter.html
index fb1527864..5e33b2c9d 100644
--- a/dc/dd4/classdata__structures_1_1_bloom_filter.html
+++ b/dc/dd4/classdata__structures_1_1_bloom_filter.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::BloomFilter&lt; T &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: data_structures::BloomFilter&lt; T &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -117,12 +134,12 @@ $(function(){initNavTree('dc/dd4/classdata__structures_1_1_bloom_filter.html','.
 <div class="dynheader">
 Collaboration diagram for data_structures::BloomFilter&lt; T &gt;:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.svg" width="426" height="318"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d41/classdata__structures_1_1_bloom_filter__coll__graph.svg" width="363" height="230"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:a6910d29951b57ab56e7a3db405aa1f1a" id="r_a6910d29951b57ab56e7a3db405aa1f1a"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6910d29951b57ab56e7a3db405aa1f1a">BloomFilter</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/initializer_list.html">std::initializer_list</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>(T)&gt; &gt;)</td></tr>
+<tr class="memitem:a6910d29951b57ab56e7a3db405aa1f1a" id="r_a6910d29951b57ab56e7a3db405aa1f1a"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6910d29951b57ab56e7a3db405aa1f1a">BloomFilter</a> (std::size_t, std::initializer_list&lt; std::function&lt; std::size_t(T)&gt; &gt;)</td></tr>
 <tr class="memdesc:a6910d29951b57ab56e7a3db405aa1f1a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructor for Bloom filter.  <br /></td></tr>
 <tr class="separator:a6910d29951b57ab56e7a3db405aa1f1a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a67bed8ef62fcb1f33b6c72df47dcf840" id="r_a67bed8ef62fcb1f33b6c72df47dcf840"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a67bed8ef62fcb1f33b6c72df47dcf840">add</a> (T)</td></tr>
@@ -134,13 +151,11 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a90268d7901e2c1ab5f8bf8b24a30e119" id="r_a90268d7901e2c1ab5f8bf8b24a30e119"><td class="memItemLeft" align="right" valign="top"><a id="a90268d7901e2c1ab5f8bf8b24a30e119" name="a90268d7901e2c1ab5f8bf8b24a30e119"></a>
-<a class="el" href="../../d9/dae/classdata__structures_1_1_bitset.html">Bitset</a>&#160;</td><td class="memItemRight" valign="bottom"><b>set</b></td></tr>
-<tr class="memdesc:a90268d7901e2c1ab5f8bf8b24a30e119"><td class="mdescLeft">&#160;</td><td class="mdescRight">inner bitset for elements <br /></td></tr>
+<tr class="memitem:a90268d7901e2c1ab5f8bf8b24a30e119" id="r_a90268d7901e2c1ab5f8bf8b24a30e119"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d9/dae/classdata__structures_1_1_bitset.html">Bitset</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a90268d7901e2c1ab5f8bf8b24a30e119">set</a></td></tr>
+<tr class="memdesc:a90268d7901e2c1ab5f8bf8b24a30e119"><td class="mdescLeft">&#160;</td><td class="mdescRight">inner bitset for elements  <br /></td></tr>
 <tr class="separator:a90268d7901e2c1ab5f8bf8b24a30e119"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a65ca6742d3be88d4aca4f080068a7a80" id="r_a65ca6742d3be88d4aca4f080068a7a80"><td class="memItemLeft" align="right" valign="top"><a id="a65ca6742d3be88d4aca4f080068a7a80" name="a65ca6742d3be88d4aca4f080068a7a80"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>(T)&gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>hashFunks</b></td></tr>
-<tr class="memdesc:a65ca6742d3be88d4aca4f080068a7a80"><td class="mdescLeft">&#160;</td><td class="mdescRight">hash functions for T type <br /></td></tr>
+<tr class="memitem:a65ca6742d3be88d4aca4f080068a7a80" id="r_a65ca6742d3be88d4aca4f080068a7a80"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::function&lt; std::size_t(T)&gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a65ca6742d3be88d4aca4f080068a7a80">hashFunks</a></td></tr>
+<tr class="memdesc:a65ca6742d3be88d4aca4f080068a7a80"><td class="mdescLeft">&#160;</td><td class="mdescRight">hash functions for T type  <br /></td></tr>
 <tr class="separator:a65ca6742d3be88d4aca4f080068a7a80"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -152,6 +167,8 @@ class data_structures::BloomFilter&lt; T &gt;</div><p>Bloom filter template clas
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00099">99</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a6910d29951b57ab56e7a3db405aa1f1a" name="a6910d29951b57ab56e7a3db405aa1f1a"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a6910d29951b57ab56e7a3db405aa1f1a">&#9670;&#160;</a></span>BloomFilter()</h2>
@@ -164,12 +181,12 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname"><a class="el" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html">data_structures::BloomFilter</a>&lt; T &gt;::BloomFilter </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></td>          <td class="paramname"><span class="paramname"><em>size</em></span>, </td>
+          <td class="paramtype">std::size_t</td>          <td class="paramname"><span class="paramname"><em>size</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/initializer_list.html">std::initializer_list</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>(T)&gt; &gt;</td>          <td class="paramname"><span class="paramname"><em>funks</em></span>&#160;)</td>
+          <td class="paramtype">std::initializer_list&lt; std::function&lt; std::size_t(T)&gt; &gt;</td>          <td class="paramname"><span class="paramname"><em>funks</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -189,9 +206,11 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00121">121</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  124</span>    : <a class="code hl_variable" href="#a90268d7901e2c1ab5f8bf8b24a30e119">set</a>(size), <a class="code hl_variable" href="#a65ca6742d3be88d4aca4f080068a7a80">hashFunks</a>(funks) {}</div>
-<div class="ttc" id="aclassdata__structures_1_1_bloom_filter_html_a65ca6742d3be88d4aca4f080068a7a80"><div class="ttname"><a href="#a65ca6742d3be88d4aca4f080068a7a80">data_structures::BloomFilter::hashFunks</a></div><div class="ttdeci">std::vector&lt; std::function&lt; std::size_t(T)&gt; &gt; hashFunks</div><div class="ttdoc">hash functions for T type</div><div class="ttdef"><b>Definition</b> bloom_filter.cpp:103</div></div>
-<div class="ttc" id="aclassdata__structures_1_1_bloom_filter_html_a90268d7901e2c1ab5f8bf8b24a30e119"><div class="ttname"><a href="#a90268d7901e2c1ab5f8bf8b24a30e119">data_structures::BloomFilter::set</a></div><div class="ttdeci">Bitset set</div><div class="ttdoc">inner bitset for elements</div><div class="ttdef"><b>Definition</b> bloom_filter.cpp:101</div></div>
+<div class="ttc" id="aclassdata__structures_1_1_bloom_filter_html_a65ca6742d3be88d4aca4f080068a7a80"><div class="ttname"><a href="#a65ca6742d3be88d4aca4f080068a7a80">data_structures::BloomFilter::hashFunks</a></div><div class="ttdeci">std::vector&lt; std::function&lt; std::size_t(T)&gt; &gt; hashFunks</div><div class="ttdoc">hash functions for T type</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dab/bloom__filter_8cpp_source.html#l00103">bloom_filter.cpp:103</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_bloom_filter_html_a90268d7901e2c1ab5f8bf8b24a30e119"><div class="ttname"><a href="#a90268d7901e2c1ab5f8bf8b24a30e119">data_structures::BloomFilter::set</a></div><div class="ttdeci">Bitset set</div><div class="ttdoc">inner bitset for elements</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dab/bloom__filter_8cpp_source.html#l00101">bloom_filter.cpp:101</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -227,21 +246,16 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00134">134</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  134</span>                            {</div>
-<div class="line"><span class="lineno">  135</span>    <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> i = 0; i &lt; <a class="code hl_variable" href="#a65ca6742d3be88d4aca4f080068a7a80">hashFunks</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
-<div class="line"><span class="lineno">  136</span>        <a class="code hl_variable" href="#a90268d7901e2c1ab5f8bf8b24a30e119">set</a>.<a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c">add</a>(<a class="code hl_variable" href="#a65ca6742d3be88d4aca4f080068a7a80">hashFunks</a>[i](x) % (<span class="keyword">sizeof</span>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>) * <a class="code hl_variable" href="#a90268d7901e2c1ab5f8bf8b24a30e119">set</a>.<a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">size</a>()));</div>
+<div class="line"><span class="lineno">  135</span>    <span class="keywordflow">for</span> (std::size_t i = 0; i &lt; <a class="code hl_variable" href="#a65ca6742d3be88d4aca4f080068a7a80">hashFunks</a>.size(); i++) {</div>
+<div class="line"><span class="lineno">  136</span>        <a class="code hl_variable" href="#a90268d7901e2c1ab5f8bf8b24a30e119">set</a>.<a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c">add</a>(<a class="code hl_variable" href="#a65ca6742d3be88d4aca4f080068a7a80">hashFunks</a>[i](x) % (<span class="keyword">sizeof</span>(std::size_t) * <a class="code hl_variable" href="#a90268d7901e2c1ab5f8bf8b24a30e119">set</a>.<a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">size</a>()));</div>
 <div class="line"><span class="lineno">  137</span>    }</div>
 <div class="line"><span class="lineno">  138</span>}</div>
-<div class="ttc" id="aclassdata__structures_1_1_bitset_html_a17dbe1b1d559302312e8091f82f7499c"><div class="ttname"><a href="../../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c">data_structures::Bitset::add</a></div><div class="ttdeci">void add(std::size_t)</div><div class="ttdoc">Turn bit on position x to 1s.</div><div class="ttdef"><b>Definition</b> bloom_filter.cpp:71</div></div>
-<div class="ttc" id="aclassdata__structures_1_1_bitset_html_a2f1f44d6a12b0de4aaf242872b1c7b54"><div class="ttname"><a href="../../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">data_structures::Bitset::size</a></div><div class="ttdeci">std::size_t size()</div><div class="ttdoc">Utility function to return the size of the inner array.</div><div class="ttdef"><b>Definition</b> bloom_filter.cpp:57</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="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/dd4/classdata__structures_1_1_bloom_filter_a67bed8ef62fcb1f33b6c72df47dcf840_cgraph.svg" width="630" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1_bitset_html_a17dbe1b1d559302312e8091f82f7499c"><div class="ttname"><a href="../../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c">data_structures::Bitset::add</a></div><div class="ttdeci">void add(std::size_t)</div><div class="ttdoc">Turn bit on position x to 1s.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dab/bloom__filter_8cpp_source.html#l00071">bloom_filter.cpp:71</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_bitset_html_a2f1f44d6a12b0de4aaf242872b1c7b54"><div class="ttname"><a href="../../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">data_structures::Bitset::size</a></div><div class="ttdeci">std::size_t size()</div><div class="ttdoc">Utility function to return the size of the inner array.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dab/bloom__filter_8cpp_source.html#l00057">bloom_filter.cpp:57</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a576db259488dbfb67624a9652a5ab08b" name="a576db259488dbfb67624a9652a5ab08b"></a>
@@ -277,26 +291,80 @@ template&lt;typename T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>true if the element probably appears in the filter </dd>
 <dd>
 false if the element certainly does not appear in the filter </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00149">149</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  149</span>                                 {</div>
-<div class="line"><span class="lineno">  150</span>    <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> i = 0; i &lt; <a class="code hl_variable" href="#a65ca6742d3be88d4aca4f080068a7a80">hashFunks</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
+<div class="line"><span class="lineno">  150</span>    <span class="keywordflow">for</span> (std::size_t i = 0; i &lt; <a class="code hl_variable" href="#a65ca6742d3be88d4aca4f080068a7a80">hashFunks</a>.size(); i++) {</div>
 <div class="line"><span class="lineno">  151</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a90268d7901e2c1ab5f8bf8b24a30e119">set</a>.<a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac">contains</a>(<a class="code hl_variable" href="#a65ca6742d3be88d4aca4f080068a7a80">hashFunks</a>[i](x) %</div>
-<div class="line"><span class="lineno">  152</span>                         (<span class="keyword">sizeof</span>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>) * <a class="code hl_variable" href="#a90268d7901e2c1ab5f8bf8b24a30e119">set</a>.<a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">size</a>())) == <span class="keyword">false</span>) {</div>
+<div class="line"><span class="lineno">  152</span>                         (<span class="keyword">sizeof</span>(std::size_t) * <a class="code hl_variable" href="#a90268d7901e2c1ab5f8bf8b24a30e119">set</a>.<a class="code hl_function" href="../../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">size</a>())) == <span class="keyword">false</span>) {</div>
 <div class="line"><span class="lineno">  153</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  154</span>        }</div>
 <div class="line"><span class="lineno">  155</span>    }</div>
 <div class="line"><span class="lineno">  156</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  157</span>}</div>
-<div class="ttc" id="aclassdata__structures_1_1_bitset_html_a9ef54c7c3f6494b36ead3ae2e5cf43ac"><div class="ttname"><a href="../../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac">data_structures::Bitset::contains</a></div><div class="ttdeci">bool contains(std::size_t)</div><div class="ttdoc">Doest bitset contains element x.</div><div class="ttdef"><b>Definition</b> bloom_filter.cpp:86</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/dd4/classdata__structures_1_1_bloom_filter_a576db259488dbfb67624a9652a5ab08b_cgraph.svg" width="562" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="ttc" id="aclassdata__structures_1_1_bitset_html_a9ef54c7c3f6494b36ead3ae2e5cf43ac"><div class="ttname"><a href="../../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac">data_structures::Bitset::contains</a></div><div class="ttdeci">bool contains(std::size_t)</div><div class="ttdoc">Doest bitset contains element x.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/dab/bloom__filter_8cpp_source.html#l00086">bloom_filter.cpp:86</a></div></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a65ca6742d3be88d4aca4f080068a7a80" name="a65ca6742d3be88d4aca4f080068a7a80"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a65ca6742d3be88d4aca4f080068a7a80">&#9670;&#160;</a></span>hashFunks</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename T &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::function&lt;std::size_t(T)&gt; &gt; <a class="el" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html">data_structures::BloomFilter</a>&lt; T &gt;::hashFunks</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>hash functions for T type </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00103">103</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a90268d7901e2c1ab5f8bf8b24a30e119" name="a90268d7901e2c1ab5f8bf8b24a30e119"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a90268d7901e2c1ab5f8bf8b24a30e119">&#9670;&#160;</a></span>set</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename T &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../d9/dae/classdata__structures_1_1_bitset.html">Bitset</a> <a class="el" href="../../dc/dd4/classdata__structures_1_1_bloom_filter.html">data_structures::BloomFilter</a>&lt; T &gt;::set</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>inner bitset for elements </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html#l00101">101</a> of file <a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../d9/dab/bloom__filter_8cpp.html">bloom_filter.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d9/dab/bloom__filter_8cpp_source.html">bloom_filter.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dc/dd4/classdata__structures_1_1_bloom_filter_a576db259488dbfb67624a9652a5ab08b_cgraph.map b/dc/dd4/classdata__structures_1_1_bloom_filter_a576db259488dbfb67624a9652a5ab08b_cgraph.map
deleted file mode 100644
index 7a97016f4..000000000
--- a/dc/dd4/classdata__structures_1_1_bloom_filter_a576db259488dbfb67624a9652a5ab08b_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="data_structures::BloomFilter::contains" name="data_structures::BloomFilter::contains">
-<area shape="rect" id="Node000001" title="Check element function for Bloom filter." alt="" coords="5,39,191,79"/>
-<area shape="rect" id="Node000002" href="$d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac" title="Doest bitset contains element x." alt="" coords="239,5,392,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="191,42,223,37,224,42,191,47"/>
-<area shape="rect" id="Node000004" href="$d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54" title="Utility function to return the size of the inner array." alt="" coords="239,71,392,111"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="191,70,224,75,223,80,191,75"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="440,46,555,72"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="393,37,425,43,425,48,392,42"/>
-<area shape="poly" id="edge4_Node000004_Node000003" title=" " alt="" coords="392,75,425,69,425,74,393,80"/>
-</map>
diff --git a/dc/dd4/classdata__structures_1_1_bloom_filter_a576db259488dbfb67624a9652a5ab08b_cgraph.md5 b/dc/dd4/classdata__structures_1_1_bloom_filter_a576db259488dbfb67624a9652a5ab08b_cgraph.md5
deleted file mode 100644
index 01f353a8c..000000000
--- a/dc/dd4/classdata__structures_1_1_bloom_filter_a576db259488dbfb67624a9652a5ab08b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1fd72c5f472c4f2c77bd2889767e840d
\ No newline at end of file
diff --git a/dc/dd4/classdata__structures_1_1_bloom_filter_a576db259488dbfb67624a9652a5ab08b_cgraph.svg b/dc/dd4/classdata__structures_1_1_bloom_filter_a576db259488dbfb67624a9652a5ab08b_cgraph.svg
deleted file mode 100644
index 5eca9310f..000000000
--- a/dc/dd4/classdata__structures_1_1_bloom_filter_a576db259488dbfb67624a9652a5ab08b_cgraph.svg
+++ /dev/null
@@ -1,113 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::BloomFilter::contains Pages: 1 -->
-<svg width="421pt" height="88pt"
- viewBox="0.00 0.00 420.50 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>data_structures::BloomFilter::contains</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Check element function for Bloom filter.">
-<polygon fill="#999999" stroke="#666666" points="139,-54.5 0,-54.5 0,-24 139,-24 139,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::BloomFilter</text>
-<text text-anchor="middle" x="69.5" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac" target="_top" xlink:title="Doest bitset contains element x.">
-<polygon fill="white" stroke="#666666" points="290,-79.5 175,-79.5 175,-49 290,-49 290,-79.5"/>
-<text text-anchor="start" x="183" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
-<text text-anchor="middle" x="232.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.25,-49.92C147.26,-51.17 155.44,-52.44 163.44,-53.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.7,-57.11 173.12,-55.19 163.78,-50.19 162.7,-57.11"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54" target="_top" xlink:title="Utility function to return the size of the inner array.">
-<polygon fill="white" stroke="#666666" points="290,-30.5 175,-30.5 175,0 290,0 290,-30.5"/>
-<text text-anchor="start" x="183" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
-<text text-anchor="middle" x="232.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.25,-29C147.26,-27.81 155.44,-26.59 163.44,-25.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.75,-28.89 173.12,-23.95 162.72,-21.97 163.75,-28.89"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="412.5,-48.88 326,-48.88 326,-29.62 412.5,-29.62 412.5,-48.88"/>
-<text text-anchor="middle" x="369.25" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.26,-53.72C298.37,-52.21 306.7,-50.67 314.75,-49.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.21,-52.65 324.4,-47.38 313.93,-45.77 315.21,-52.65"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.26,-25.36C298.37,-26.8 306.7,-28.29 314.75,-29.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.94,-33.13 324.4,-31.44 315.17,-26.24 313.94,-33.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/dd4/classdata__structures_1_1_bloom_filter_a576db259488dbfb67624a9652a5ab08b_cgraph_org.svg b/dc/dd4/classdata__structures_1_1_bloom_filter_a576db259488dbfb67624a9652a5ab08b_cgraph_org.svg
deleted file mode 100644
index d56e72d91..000000000
--- a/dc/dd4/classdata__structures_1_1_bloom_filter_a576db259488dbfb67624a9652a5ab08b_cgraph_org.svg
+++ /dev/null
@@ -1,87 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::BloomFilter::contains Pages: 1 -->
-<svg width="421pt" height="88pt"
- viewBox="0.00 0.00 420.50 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>data_structures::BloomFilter::contains</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Check element function for Bloom filter.">
-<polygon fill="#999999" stroke="#666666" points="139,-54.5 0,-54.5 0,-24 139,-24 139,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::BloomFilter</text>
-<text text-anchor="middle" x="69.5" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac" target="_top" xlink:title="Doest bitset contains element x.">
-<polygon fill="white" stroke="#666666" points="290,-79.5 175,-79.5 175,-49 290,-49 290,-79.5"/>
-<text text-anchor="start" x="183" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
-<text text-anchor="middle" x="232.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.25,-49.92C147.26,-51.17 155.44,-52.44 163.44,-53.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.7,-57.11 173.12,-55.19 163.78,-50.19 162.7,-57.11"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54" target="_top" xlink:title="Utility function to return the size of the inner array.">
-<polygon fill="white" stroke="#666666" points="290,-30.5 175,-30.5 175,0 290,0 290,-30.5"/>
-<text text-anchor="start" x="183" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
-<text text-anchor="middle" x="232.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.25,-29C147.26,-27.81 155.44,-26.59 163.44,-25.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.75,-28.89 173.12,-23.95 162.72,-21.97 163.75,-28.89"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="412.5,-48.88 326,-48.88 326,-29.62 412.5,-29.62 412.5,-48.88"/>
-<text text-anchor="middle" x="369.25" y="-35.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.26,-53.72C298.37,-52.21 306.7,-50.67 314.75,-49.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.21,-52.65 324.4,-47.38 313.93,-45.77 315.21,-52.65"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.26,-25.36C298.37,-26.8 306.7,-28.29 314.75,-29.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.94,-33.13 324.4,-31.44 315.17,-26.24 313.94,-33.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/dd4/classdata__structures_1_1_bloom_filter_a67bed8ef62fcb1f33b6c72df47dcf840_cgraph.map b/dc/dd4/classdata__structures_1_1_bloom_filter_a67bed8ef62fcb1f33b6c72df47dcf840_cgraph.map
deleted file mode 100644
index 2df4dcb72..000000000
--- a/dc/dd4/classdata__structures_1_1_bloom_filter_a67bed8ef62fcb1f33b6c72df47dcf840_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="data_structures::BloomFilter::add" name="data_structures::BloomFilter::add">
-<area shape="rect" id="Node000001" title="Add function for Bloom filter." alt="" coords="5,35,220,60"/>
-<area shape="rect" id="Node000002" href="$d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c" title="Turn bit on position x to 1s." alt="" coords="268,5,450,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="220,32,252,28,253,33,220,37"/>
-<area shape="rect" id="Node000005" href="$d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54" title="Utility function to return the size of the inner array." alt="" coords="282,55,436,96"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="220,57,267,62,266,68,220,62"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="498,5,624,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="451,16,483,16,483,21,451,21"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="504,59,619,84"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="411,29,495,52,494,57,410,34"/>
-<area shape="poly" id="edge5_Node000005_Node000004" title=" " alt="" coords="436,71,488,70,488,76,436,77"/>
-</map>
diff --git a/dc/dd4/classdata__structures_1_1_bloom_filter_a67bed8ef62fcb1f33b6c72df47dcf840_cgraph.md5 b/dc/dd4/classdata__structures_1_1_bloom_filter_a67bed8ef62fcb1f33b6c72df47dcf840_cgraph.md5
deleted file mode 100644
index 9dee41268..000000000
--- a/dc/dd4/classdata__structures_1_1_bloom_filter_a67bed8ef62fcb1f33b6c72df47dcf840_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1a81d441b95580fb05d3d501a0c621fc
\ No newline at end of file
diff --git a/dc/dd4/classdata__structures_1_1_bloom_filter_a67bed8ef62fcb1f33b6c72df47dcf840_cgraph.svg b/dc/dd4/classdata__structures_1_1_bloom_filter_a67bed8ef62fcb1f33b6c72df47dcf840_cgraph.svg
deleted file mode 100644
index c8aa4ea84..000000000
--- a/dc/dd4/classdata__structures_1_1_bloom_filter_a67bed8ef62fcb1f33b6c72df47dcf840_cgraph.svg
+++ /dev/null
@@ -1,129 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::BloomFilter::add Pages: 1 -->
-<svg width="472pt" height="76pt"
- viewBox="0.00 0.00 472.25 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>data_structures::BloomFilter::add</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Add function for Bloom filter.">
-<polygon fill="#999999" stroke="#666666" points="160.75,-45.88 0,-45.88 0,-26.62 160.75,-26.62 160.75,-45.88"/>
-<text text-anchor="middle" x="80.38" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::BloomFilter::add</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c" target="_top" xlink:title="Turn bit on position x to 1s.">
-<polygon fill="white" stroke="#666666" points="333.5,-67.88 196.75,-67.88 196.75,-48.62 333.5,-48.62 333.5,-67.88"/>
-<text text-anchor="middle" x="265.12" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset::add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161,-45.84C169.04,-46.8 177.21,-47.79 185.24,-48.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.63,-52.21 194.98,-49.93 185.47,-45.26 184.63,-52.21"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54" target="_top" xlink:title="Utility function to return the size of the inner array.">
-<polygon fill="white" stroke="#666666" points="322.62,-30.5 207.62,-30.5 207.62,0 322.62,0 322.62,-30.5"/>
-<text text-anchor="start" x="215.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
-<text text-anchor="middle" x="265.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161,-27.1C172.69,-25.76 184.63,-24.38 196.06,-23.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.25,-26.57 205.78,-21.95 195.45,-19.62 196.25,-26.57"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="464.25,-67.88 369.5,-67.88 369.5,-48.62 464.25,-48.62 464.25,-67.88"/>
-<text text-anchor="middle" x="416.88" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.99,-58.25C342,-58.25 350.11,-58.25 357.96,-58.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="357.72,-61.75 367.72,-58.25 357.72,-54.75 357.72,-61.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="460.12,-27.88 373.62,-27.88 373.62,-8.62 460.12,-8.62 460.12,-27.88"/>
-<text text-anchor="middle" x="416.88" y="-14.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.91,-48.16C323.07,-43.04 346.55,-36.77 367.06,-31.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="367.88,-34.69 376.64,-28.73 366.07,-27.93 367.88,-34.69"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge5_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge5_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M322.74,-16.38C335.55,-16.64 349.12,-16.91 361.82,-17.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="361.61,-20.66 371.68,-17.36 361.75,-13.66 361.61,-20.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/dd4/classdata__structures_1_1_bloom_filter_a67bed8ef62fcb1f33b6c72df47dcf840_cgraph_org.svg b/dc/dd4/classdata__structures_1_1_bloom_filter_a67bed8ef62fcb1f33b6c72df47dcf840_cgraph_org.svg
deleted file mode 100644
index 4e9131c43..000000000
--- a/dc/dd4/classdata__structures_1_1_bloom_filter_a67bed8ef62fcb1f33b6c72df47dcf840_cgraph_org.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::BloomFilter::add Pages: 1 -->
-<svg width="472pt" height="76pt"
- viewBox="0.00 0.00 472.25 75.88" 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 71.88)">
-<title>data_structures::BloomFilter::add</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Add function for Bloom filter.">
-<polygon fill="#999999" stroke="#666666" points="160.75,-45.88 0,-45.88 0,-26.62 160.75,-26.62 160.75,-45.88"/>
-<text text-anchor="middle" x="80.38" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::BloomFilter::add</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c" target="_top" xlink:title="Turn bit on position x to 1s.">
-<polygon fill="white" stroke="#666666" points="333.5,-67.88 196.75,-67.88 196.75,-48.62 333.5,-48.62 333.5,-67.88"/>
-<text text-anchor="middle" x="265.12" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset::add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161,-45.84C169.04,-46.8 177.21,-47.79 185.24,-48.75"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.63,-52.21 194.98,-49.93 185.47,-45.26 184.63,-52.21"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54" target="_top" xlink:title="Utility function to return the size of the inner array.">
-<polygon fill="white" stroke="#666666" points="322.62,-30.5 207.62,-30.5 207.62,0 322.62,0 322.62,-30.5"/>
-<text text-anchor="start" x="215.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Bitset</text>
-<text text-anchor="middle" x="265.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161,-27.1C172.69,-25.76 184.63,-24.38 196.06,-23.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.25,-26.57 205.78,-21.95 195.45,-19.62 196.25,-26.57"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="464.25,-67.88 369.5,-67.88 369.5,-48.62 464.25,-48.62 464.25,-67.88"/>
-<text text-anchor="middle" x="416.88" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.99,-58.25C342,-58.25 350.11,-58.25 357.96,-58.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="357.72,-61.75 367.72,-58.25 357.72,-54.75 357.72,-61.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="460.12,-27.88 373.62,-27.88 373.62,-8.62 460.12,-8.62 460.12,-27.88"/>
-<text text-anchor="middle" x="416.88" y="-14.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.91,-48.16C323.07,-43.04 346.55,-36.77 367.06,-31.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="367.88,-34.69 376.64,-28.73 366.07,-27.93 367.88,-34.69"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge5_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge5_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M322.74,-16.38C335.55,-16.64 349.12,-16.91 361.82,-17.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="361.61,-20.66 371.68,-17.36 361.75,-13.66 361.61,-20.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/dd5/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator-members.html b/dc/dd5/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator-members.html
index 55d38a6b4..e66453665 100644
--- a/dc/dd5/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator-members.html
+++ b/dc/dd5/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.map b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.map
index 4be6d3275..e190a2c7e 100644
--- a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.map
+++ b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.map
@@ -2,16 +2,16 @@
 <area shape="rect" id="Node000001" title="The Heavy&#45;Light Decomposition class." alt="" coords="660,147,805,203"/>
 <area shape="rect" id="Node000002" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting." alt="" coords="465,67,610,123"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="622,127,664,144,662,149,620,132"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="222,71,360,111"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="222,71,360,111"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="376,90,465,91,465,96,376,95"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list.html" title=" " alt="" coords="5,78,108,104"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="5,78,108,104"/>
 <area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="123,88,222,88,222,94,123,94"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="213,5,370,46"/>
+<area shape="rect" id="Node000005" title=" " alt="" coords="213,5,370,46"/>
 <area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="382,48,465,72,464,77,380,53"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="231,241,352,266"/>
+<area shape="rect" id="Node000006" title=" " alt="" coords="231,241,352,266"/>
 <area shape="poly" id="edge9_Node000001_Node000006" title=" " alt="" coords="368,266,422,272,483,275,547,271,610,257,635,247,659,233,700,201,704,205,662,237,637,252,611,263,548,276,483,280,422,278,367,271"/>
 <area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="366,242,405,229,439,206,449,189,451,172,453,153,463,133,475,121,479,125,467,137,458,155,457,173,454,191,443,210,408,233,368,247"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="233,148,350,173"/>
+<area shape="rect" id="Node000007" title=" " alt="" coords="233,148,350,173"/>
 <area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="357,140,464,112,465,117,358,146"/>
 <area shape="rect" id="Node000008" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" title="Segment Tree, to store heavy chains." alt="" coords="465,147,610,203"/>
 <area shape="poly" id="edge8_Node000008_Node000007" title=" " alt="" coords="365,165,394,167,465,171,464,176,394,173,365,170"/>
diff --git a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.md5 b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.md5
index 96f9a0200..5f7e79f08 100644
--- a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.md5
+++ b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.md5
@@ -1 +1 @@
-0ee87fdfa58b1fe4068700440b2354a4
\ No newline at end of file
+a058c329bef3dfdc2d4f959567541189
\ No newline at end of file
diff --git a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.svg b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.svg
index 06abca7b2..7f9ff16d4 100644
--- a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.svg
+++ b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph.svg
@@ -89,7 +89,7 @@ var sectionId = 'dynsection-1';
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="266.38,-155.14 162.62,-155.14 162.62,-124.64 266.38,-124.64 266.38,-155.14"/>
 <text text-anchor="start" x="170.62" y="-141.64" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::list</text>
 <text text-anchor="middle" x="214.5" y="-130.39" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -109,7 +109,7 @@ var sectionId = 'dynsection-1';
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="76.75,-149.52 0,-149.52 0,-130.27 76.75,-130.27 76.75,-149.52"/>
 <text text-anchor="middle" x="38.38" y="-136.02" font-family="Helvetica,sans-Serif" font-size="10.00">std::list&lt; int &gt;</text>
 </a>
@@ -128,7 +128,7 @@ var sectionId = 'dynsection-1';
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000005"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="273.5,-204.14 155.5,-204.14 155.5,-173.64 273.5,-173.64 273.5,-204.14"/>
 <text text-anchor="start" x="163.5" y="-190.64" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="214.5" y="-179.39" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -148,7 +148,7 @@ var sectionId = 'dynsection-1';
 <!-- Node6 -->
 <g id="Node000006" class="node">
 <title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000006"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="260,-27.52 169,-27.52 169,-8.27 260,-8.27 260,-27.52"/>
 <text text-anchor="middle" x="214.5" y="-14.02" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
@@ -180,7 +180,7 @@ var sectionId = 'dynsection-1';
 <!-- Node7 -->
 <g id="Node000007" class="node">
 <title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000007"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="258.12,-97.52 170.88,-97.52 170.88,-78.27 258.12,-78.27 258.12,-97.52"/>
 <text text-anchor="middle" x="214.5" y="-84.02" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; X &gt;</text>
 </a>
diff --git a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph_org.svg b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph_org.svg
index 7236c6390..193823b5f 100644
--- a/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph_org.svg
+++ b/dc/dd9/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d__coll__graph_org.svg
@@ -42,7 +42,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="266.38,-155.14 162.62,-155.14 162.62,-124.64 266.38,-124.64 266.38,-155.14"/>
 <text text-anchor="start" x="170.62" y="-141.64" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::list</text>
 <text text-anchor="middle" x="214.5" y="-130.39" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -62,7 +62,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="76.75,-149.52 0,-149.52 0,-130.27 76.75,-130.27 76.75,-149.52"/>
 <text text-anchor="middle" x="38.38" y="-136.02" font-family="Helvetica,sans-Serif" font-size="10.00">std::list&lt; int &gt;</text>
 </a>
@@ -81,7 +81,7 @@
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000005"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="273.5,-204.14 155.5,-204.14 155.5,-173.64 273.5,-173.64 273.5,-204.14"/>
 <text text-anchor="start" x="163.5" y="-190.64" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="214.5" y="-179.39" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -101,7 +101,7 @@
 <!-- Node6 -->
 <g id="Node000006" class="node">
 <title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000006"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="260,-27.52 169,-27.52 169,-8.27 260,-8.27 260,-27.52"/>
 <text text-anchor="middle" x="214.5" y="-14.02" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
@@ -133,7 +133,7 @@
 <!-- Node7 -->
 <g id="Node000007" class="node">
 <title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000007"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="258.12,-97.52 170.88,-97.52 170.88,-78.27 258.12,-78.27 258.12,-97.52"/>
 <text text-anchor="middle" x="214.5" y="-84.02" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; X &gt;</text>
 </a>
diff --git a/dc/dd9/strand__sort_8cpp.html b/dc/dd9/strand__sort_8cpp.html
index 59d18f05a..f19925213 100644
--- a/dc/dd9/strand__sort_8cpp.html
+++ b/dc/dd9/strand__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/strand_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/strand_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for strand_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d26/strand__sort_8cpp__incl.svg" width="166" height="111"><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">
+</div>
+<p><a href="../../dc/dd9/strand__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -133,7 +152,7 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a2bea2fe5dd38ed63610fdeaddf5785cd" id="r_a2bea2fe5dd38ed63610fdeaddf5785cd"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a2bea2fe5dd38ed63610fdeaddf5785cd"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a2bea2fe5dd38ed63610fdeaddf5785cd">sorting::strand::strand_sort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt; T &gt; lst)</td></tr>
+<tr class="memitem:a2bea2fe5dd38ed63610fdeaddf5785cd"><td class="memTemplItemLeft" align="right" valign="top">std::list&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a2bea2fe5dd38ed63610fdeaddf5785cd">sorting::strand::strand_sort</a> (std::list&lt; T &gt; lst)</td></tr>
 <tr class="memdesc:a2bea2fe5dd38ed63610fdeaddf5785cd"><td class="mdescLeft">&#160;</td><td class="mdescRight">Apply sorting.  <br /></td></tr>
 <tr class="separator:a2bea2fe5dd38ed63610fdeaddf5785cd"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
 <p>Strand Sort is a sorting algorithm that works in \(O(n)\) time if list is already sorted and works in \(O(n^2)\) in worst case.</p>
 <p>It is passed over the array to be sorted once and the ascending (sequential) numbers are taken. After the first iteration, the sequential sub-array is put on the empty sorted array. The main sequence is passed over again and a new sub-sequence is created in order. Now that the sorted array is not empty, the newly extracted substring is merged with the sorted array. Repeat types 3 and 4 until the sub-sequence and main sequence are empty.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/mertcandav" target="_blank">Mertcan Davulcu</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../dc/dd9/strand__sort_8cpp_source.html">strand_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -166,17 +187,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/dd9/strand__sort_8cpp_source.html#l00084">84</a> of file <a class="el" href="../../dc/dd9/strand__sort_8cpp_source.html">strand_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   84</span>           {</div>
 <div class="line"><span class="lineno">   85</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
 <div class="line"><span class="lineno">   86</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   87</span>}</div>
-<div class="ttc" id="astrand__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function for testing.</div><div class="ttdef"><b>Definition</b> strand_sort.cpp:64</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astrand__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function for testing.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dd9/strand__sort_8cpp_source.html#l00064">strand_sort.cpp:64</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2bea2fe5dd38ed63610fdeaddf5785cd" name="a2bea2fe5dd38ed63610fdeaddf5785cd"></a>
@@ -188,9 +206,9 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt; T &gt; sorting::strand::strand_sort </td>
+          <td class="memname">std::list&lt; T &gt; sorting::strand::strand_sort </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt; T &gt;</td>          <td class="paramname"><span class="paramname"><em>lst</em></span></td><td>)</td>
+          <td class="paramtype">std::list&lt; T &gt;</td>          <td class="paramname"><span class="paramname"><em>lst</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -210,19 +228,21 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Sorted list&lt;T&gt; instance </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/dd9/strand__sort_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../dc/dd9/strand__sort_8cpp_source.html">strand_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   36</span>                                               {</div>
-<div class="line"><span class="lineno">   37</span>            <span class="keywordflow">if</span> (lst.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/size.html">size</a>() &lt; 2) { <span class="comment">// Returns list if empty or contains only one element</span></div>
+<div class="line"><span class="lineno">   37</span>            <span class="keywordflow">if</span> (lst.size() &lt; 2) { <span class="comment">// Returns list if empty or contains only one element</span></div>
 <div class="line"><span class="lineno">   38</span>                <span class="keywordflow">return</span> lst; <span class="comment">// Returns list</span></div>
 <div class="line"><span class="lineno">   39</span>            }</div>
-<div class="line"><span class="lineno">   40</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list&lt;T&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>; <span class="comment">// Define new &quot;result&quot; named list instance.</span></div>
-<div class="line"><span class="lineno">   41</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list&lt;T&gt;</a> sorted; <span class="comment">// Define new &quot;sorted&quot; named list instance.</span></div>
-<div class="line"><span class="lineno">   42</span>            <span class="keywordflow">while</span>(!lst.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/empty.html">empty</a>()) <span class="comment">/* if lst is not empty */</span> {</div>
-<div class="line"><span class="lineno">   43</span>                sorted.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/push_back.html">push_back</a>(lst.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/front.html">front</a>()); <span class="comment">// Adds the first element of &quot;lst&quot; list to the bottom of the &quot;sorted&quot; list.</span></div>
-<div class="line"><span class="lineno">   44</span>                lst.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/pop_front.html">pop_front</a>(); <span class="comment">// Remove first element of &quot;lst&quot; list.</span></div>
-<div class="line"><span class="lineno">   45</span>                <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = lst.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/begin.html">begin</a>(); it != lst.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/end.html">end</a>(); ) { <span class="comment">// Return the loop as long as the current iterator is not equal to the last literator of the &quot;lst&quot; list.</span></div>
-<div class="line"><span class="lineno">   46</span>                    <span class="keywordflow">if</span> (sorted.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/back.html">back</a>() &lt;= *it) { <span class="comment">// If the last reference of the &quot;sorted&quot; list is less than or equal to the current iterator reference.</span></div>
-<div class="line"><span class="lineno">   47</span>                        sorted.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/push_back.html">push_back</a>(*it); <span class="comment">// Adds the iterator retrieved in the loop under the &quot;sorted&quot; list.</span></div>
-<div class="line"><span class="lineno">   48</span>                        it = lst.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/erase.html">erase</a>(it); <span class="comment">// Deletes the element with the current iterator and assigns the deleted element to the iterator.</span></div>
+<div class="line"><span class="lineno">   40</span>            std::list&lt;T&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>; <span class="comment">// Define new &quot;result&quot; named list instance.</span></div>
+<div class="line"><span class="lineno">   41</span>            std::list&lt;T&gt; sorted; <span class="comment">// Define new &quot;sorted&quot; named list instance.</span></div>
+<div class="line"><span class="lineno">   42</span>            <span class="keywordflow">while</span>(!lst.empty()) <span class="comment">/* if lst is not empty */</span> {</div>
+<div class="line"><span class="lineno">   43</span>                sorted.push_back(lst.front()); <span class="comment">// Adds the first element of &quot;lst&quot; list to the bottom of the &quot;sorted&quot; list.</span></div>
+<div class="line"><span class="lineno">   44</span>                lst.pop_front(); <span class="comment">// Remove first element of &quot;lst&quot; list.</span></div>
+<div class="line"><span class="lineno">   45</span>                <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = lst.begin(); it != lst.end(); ) { <span class="comment">// Return the loop as long as the current iterator is not equal to the last literator of the &quot;lst&quot; list.</span></div>
+<div class="line"><span class="lineno">   46</span>                    <span class="keywordflow">if</span> (sorted.back() &lt;= *it) { <span class="comment">// If the last reference of the &quot;sorted&quot; list is less than or equal to the current iterator reference.</span></div>
+<div class="line"><span class="lineno">   47</span>                        sorted.push_back(*it); <span class="comment">// Adds the iterator retrieved in the loop under the &quot;sorted&quot; list.</span></div>
+<div class="line"><span class="lineno">   48</span>                        it = lst.erase(it); <span class="comment">// Deletes the element with the current iterator and assigns the deleted element to the iterator.</span></div>
 <div class="line"><span class="lineno">   49</span>                    } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">   50</span>                        it++; <span class="comment">// Next iterator.</span></div>
 <div class="line"><span class="lineno">   51</span>                    }</div>
@@ -231,23 +251,8 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   54</span>            }</div>
 <div class="line"><span class="lineno">   55</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>; <span class="comment">// Returns sorted list</span></div>
 <div class="line"><span class="lineno">   56</span>        }</div>
-<div class="ttc" id="aback_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/back.html">std::list::back</a></div><div class="ttdeci">T back(T... args)</div></div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/begin.html">std::list::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/empty.html">std::list::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/end.html">std::list::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="aerase_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/erase.html">std::list::erase</a></div><div class="ttdeci">T erase(T... args)</div></div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-<div class="ttc" id="afront_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/front.html">std::list::front</a></div><div class="ttdeci">T front(T... args)</div></div>
-<div class="ttc" id="alist_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a></div></div>
-<div class="ttc" id="apop_front_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/pop_front.html">std::list::pop_front</a></div><div class="ttdeci">T pop_front(T... args)</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/push_back.html">std::list::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/size.html">std::list::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/dd9/strand__sort_8cpp_a2bea2fe5dd38ed63610fdeaddf5785cd_cgraph.svg" width="372" height="431"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -275,23 +280,24 @@ Here is the call graph for this function:</div>
 
 <p>Function for testing. </p>
 <dl class="section return"><dt>Returns</dt><dd>N/A </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/dd9/strand__sort_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../dc/dd9/strand__sort_8cpp_source.html">strand_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   64</span>                   {</div>
-<div class="line"><span class="lineno">   65</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list&lt;int&gt;</a> lst = { -333, 525, 1, 0, 94, 52, 33 };</div>
+<div class="line"><span class="lineno">   65</span>    std::list&lt;int&gt; lst = { -333, 525, 1, 0, 94, 52, 33 };</div>
 <div class="line"><span class="lineno">   66</span> </div>
-<div class="line"><span class="lineno">   67</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Before: &quot;</span>;</div>
+<div class="line"><span class="lineno">   67</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Before: &quot;</span>;</div>
 <div class="line"><span class="lineno">   68</span>    <span class="keywordflow">for</span>(<span class="keyword">auto</span> item: lst) {</div>
-<div class="line"><span class="lineno">   69</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; item &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   69</span>        std::cout &lt;&lt; item &lt;&lt; <span class="stringliteral">&quot; &quot;</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>    lst = <a class="code hl_function" href="#a2bea2fe5dd38ed63610fdeaddf5785cd">sorting::strand::strand_sort</a>(lst); <span class="comment">// Sort list.</span></div>
 <div class="line"><span class="lineno">   73</span> </div>
-<div class="line"><span class="lineno">   74</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nAfter: &quot;</span>;</div>
+<div class="line"><span class="lineno">   74</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nAfter: &quot;</span>;</div>
 <div class="line"><span class="lineno">   75</span>    <span class="keywordflow">for</span>(<span class="keyword">auto</span> item: lst) {</div>
-<div class="line"><span class="lineno">   76</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; item &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   76</span>        std::cout &lt;&lt; item &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   77</span>    }</div>
 <div class="line"><span class="lineno">   78</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="astrand__sort_8cpp_html_a2bea2fe5dd38ed63610fdeaddf5785cd"><div class="ttname"><a href="#a2bea2fe5dd38ed63610fdeaddf5785cd">sorting::strand::strand_sort</a></div><div class="ttdeci">std::list&lt; T &gt; strand_sort(std::list&lt; T &gt; lst)</div><div class="ttdoc">Apply sorting.</div><div class="ttdef"><b>Definition</b> strand_sort.cpp:36</div></div>
+<div class="ttc" id="astrand__sort_8cpp_html_a2bea2fe5dd38ed63610fdeaddf5785cd"><div class="ttname"><a href="#a2bea2fe5dd38ed63610fdeaddf5785cd">sorting::strand::strand_sort</a></div><div class="ttdeci">std::list&lt; T &gt; strand_sort(std::list&lt; T &gt; lst)</div><div class="ttdoc">Apply sorting.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dd9/strand__sort_8cpp_source.html#l00036">strand_sort.cpp:36</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/dc/dd9/strand__sort_8cpp_a2bea2fe5dd38ed63610fdeaddf5785cd_cgraph.map b/dc/dd9/strand__sort_8cpp_a2bea2fe5dd38ed63610fdeaddf5785cd_cgraph.map
deleted file mode 100644
index 9c85f861f..000000000
--- a/dc/dd9/strand__sort_8cpp_a2bea2fe5dd38ed63610fdeaddf5785cd_cgraph.map
+++ /dev/null
@@ -1,22 +0,0 @@
-<map id="sorting::strand::strand_sort" name="sorting::strand::strand_sort">
-<area shape="rect" id="Node000001" title="Apply sorting." alt="" coords="5,203,183,228"/>
-<area shape="poly" id="edge10_Node000001_Node000001" title=" " alt="" coords="60,204,53,194,57,184,71,178,94,176,119,179,132,186,129,190,118,184,94,181,72,183,61,188,58,193,64,201"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/back.html#" title=" " alt="" coords="248,5,348,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="100,201,147,126,185,80,229,40,235,36,238,41,232,44,189,84,152,129,105,204"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/begin.html#" title=" " alt="" coords="247,55,350,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="105,200,155,147,191,117,229,89,237,85,240,89,232,94,194,121,159,151,109,204"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/empty.html#" title=" " alt="" coords="244,104,352,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="115,200,167,170,230,138,242,133,244,138,232,143,169,175,118,205"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/end.html#" title=" " alt="" coords="252,153,345,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="150,199,236,178,237,183,151,205"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/erase.html#" title=" " alt="" coords="246,203,350,228"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="183,213,231,213,231,218,183,218"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/front.html#" title=" " alt="" coords="249,252,348,278"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="151,226,235,247,233,252,150,232"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/pop_front.html#" title=" " alt="" coords="235,301,362,327"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="118,226,169,256,232,288,244,293,242,298,230,293,167,261,115,231"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/push_back.html#" title=" " alt="" coords="231,351,366,376"/>
-<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="109,227,159,280,194,310,232,337,240,342,237,346,229,342,191,314,155,284,105,231"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/size.html#" title=" " alt="" coords="250,400,346,426"/>
-<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="105,227,152,302,189,347,232,387,238,390,235,395,229,391,185,351,147,305,100,230"/>
-</map>
diff --git a/dc/dd9/strand__sort_8cpp_a2bea2fe5dd38ed63610fdeaddf5785cd_cgraph.md5 b/dc/dd9/strand__sort_8cpp_a2bea2fe5dd38ed63610fdeaddf5785cd_cgraph.md5
deleted file mode 100644
index d38d36d8d..000000000
--- a/dc/dd9/strand__sort_8cpp_a2bea2fe5dd38ed63610fdeaddf5785cd_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0f963b2d71a52e3a5673609bd0d6f301
\ No newline at end of file
diff --git a/dc/dd9/strand__sort_8cpp_a2bea2fe5dd38ed63610fdeaddf5785cd_cgraph.svg b/dc/dd9/strand__sort_8cpp_a2bea2fe5dd38ed63610fdeaddf5785cd_cgraph.svg
deleted file mode 100644
index be0a5d4fc..000000000
--- a/dc/dd9/strand__sort_8cpp_a2bea2fe5dd38ed63610fdeaddf5785cd_cgraph.svg
+++ /dev/null
@@ -1,218 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::strand::strand_sort Pages: 1 -->
-<svg width="279pt" height="323pt"
- viewBox="0.00 0.00 278.50 323.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 319.25)">
-<title>sorting::strand::strand_sort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Apply sorting.">
-<polygon fill="#999999" stroke="#666666" points="133,-167.25 0,-167.25 0,-148 133,-148 133,-167.25"/>
-<text text-anchor="middle" x="66.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::strand::strand_sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge10_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge10_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.51,-167.54C31.56,-176.15 39.56,-185.25 66.5,-185.25 81.65,-185.25 90.81,-182.37 93.98,-178.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.37,-177.42 90.96,-168.98 90.71,-179.57 97.37,-177.42"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257.38,-315.25 182.12,-315.25 182.12,-296 257.38,-296 257.38,-315.25"/>
-<text text-anchor="middle" x="219.75" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.7,-167.65C85.69,-191.75 121.95,-253.5 169,-287.62 170.35,-288.6 171.75,-289.53 173.2,-290.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.41,-293.43 181.9,-294.9 174.61,-287.2 171.41,-293.43"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.5,-278.25 181,-278.25 181,-259 258.5,-259 258.5,-278.25"/>
-<text text-anchor="middle" x="219.75" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76,-167.7C92.28,-186.43 129.75,-226.86 169,-250.62 170.89,-251.77 172.86,-252.85 174.88,-253.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.33,-257.02 183.88,-257.95 176.21,-250.64 173.33,-257.02"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.38,-241.25 179.12,-241.25 179.12,-222 260.38,-222 260.38,-241.25"/>
-<text text-anchor="middle" x="219.75" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.62,-167.56C103.3,-179.44 137.84,-199.5 169,-213.62 171.9,-214.94 174.93,-216.23 178,-217.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.45,-220.63 187.04,-220.98 178.98,-214.1 176.45,-220.63"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-204.25 184.75,-204.25 184.75,-185 254.75,-185 254.75,-204.25"/>
-<text text-anchor="middle" x="219.75" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.83,-167.74C128.9,-172.65 153.07,-178.56 173.62,-183.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.6,-186.94 183.15,-185.92 174.27,-180.14 172.6,-186.94"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.88,-167.25 180.62,-167.25 180.62,-148 258.88,-148 258.88,-167.25"/>
-<text text-anchor="middle" x="219.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.4,-157.62C145.34,-157.62 157.6,-157.62 168.97,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.94,-161.13 178.94,-157.63 168.94,-154.13 168.94,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="256.62,-130.25 182.88,-130.25 182.88,-111 256.62,-111 256.62,-130.25"/>
-<text text-anchor="middle" x="219.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.83,-147.51C128.22,-142.77 151.43,-137.09 171.52,-132.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.27,-135.6 181.15,-129.82 170.6,-128.8 172.27,-135.6"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.12,-93.25 172.38,-93.25 172.38,-74 267.12,-74 267.12,-93.25"/>
-<text text-anchor="middle" x="219.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.62,-147.69C103.3,-135.81 137.84,-115.75 169,-101.62 171.9,-100.31 174.93,-99.02 178,-97.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.98,-101.15 187.04,-94.27 176.45,-94.62 178.98,-101.15"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.5,-56.25 169,-56.25 169,-37 270.5,-37 270.5,-56.25"/>
-<text text-anchor="middle" x="219.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76,-147.55C92.28,-128.82 129.75,-88.39 169,-64.62 170.89,-63.48 172.86,-62.4 174.88,-61.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.21,-64.61 183.88,-57.3 173.33,-58.23 176.21,-64.61"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.88,-19.25 183.62,-19.25 183.62,0 255.88,0 255.88,-19.25"/>
-<text text-anchor="middle" x="219.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.7,-147.6C85.69,-123.5 121.95,-61.75 169,-27.62 170.35,-26.65 171.75,-25.72 173.2,-24.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.61,-28.05 181.9,-20.35 171.41,-21.82 174.61,-28.05"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/dd9/strand__sort_8cpp_a2bea2fe5dd38ed63610fdeaddf5785cd_cgraph_org.svg b/dc/dd9/strand__sort_8cpp_a2bea2fe5dd38ed63610fdeaddf5785cd_cgraph_org.svg
deleted file mode 100644
index 0aa6274f1..000000000
--- a/dc/dd9/strand__sort_8cpp_a2bea2fe5dd38ed63610fdeaddf5785cd_cgraph_org.svg
+++ /dev/null
@@ -1,192 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::strand::strand_sort Pages: 1 -->
-<svg width="279pt" height="323pt"
- viewBox="0.00 0.00 278.50 323.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 319.25)">
-<title>sorting::strand::strand_sort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Apply sorting.">
-<polygon fill="#999999" stroke="#666666" points="133,-167.25 0,-167.25 0,-148 133,-148 133,-167.25"/>
-<text text-anchor="middle" x="66.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::strand::strand_sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge10_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge10_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.51,-167.54C31.56,-176.15 39.56,-185.25 66.5,-185.25 81.65,-185.25 90.81,-182.37 93.98,-178.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="97.37,-177.42 90.96,-168.98 90.71,-179.57 97.37,-177.42"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="257.38,-315.25 182.12,-315.25 182.12,-296 257.38,-296 257.38,-315.25"/>
-<text text-anchor="middle" x="219.75" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.7,-167.65C85.69,-191.75 121.95,-253.5 169,-287.62 170.35,-288.6 171.75,-289.53 173.2,-290.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.41,-293.43 181.9,-294.9 174.61,-287.2 171.41,-293.43"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.5,-278.25 181,-278.25 181,-259 258.5,-259 258.5,-278.25"/>
-<text text-anchor="middle" x="219.75" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76,-167.7C92.28,-186.43 129.75,-226.86 169,-250.62 170.89,-251.77 172.86,-252.85 174.88,-253.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.33,-257.02 183.88,-257.95 176.21,-250.64 173.33,-257.02"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.38,-241.25 179.12,-241.25 179.12,-222 260.38,-222 260.38,-241.25"/>
-<text text-anchor="middle" x="219.75" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.62,-167.56C103.3,-179.44 137.84,-199.5 169,-213.62 171.9,-214.94 174.93,-216.23 178,-217.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.45,-220.63 187.04,-220.98 178.98,-214.1 176.45,-220.63"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-204.25 184.75,-204.25 184.75,-185 254.75,-185 254.75,-204.25"/>
-<text text-anchor="middle" x="219.75" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.83,-167.74C128.9,-172.65 153.07,-178.56 173.62,-183.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.6,-186.94 183.15,-185.92 174.27,-180.14 172.6,-186.94"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="258.88,-167.25 180.62,-167.25 180.62,-148 258.88,-148 258.88,-167.25"/>
-<text text-anchor="middle" x="219.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.4,-157.62C145.34,-157.62 157.6,-157.62 168.97,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.94,-161.13 178.94,-157.63 168.94,-154.13 168.94,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="256.62,-130.25 182.88,-130.25 182.88,-111 256.62,-111 256.62,-130.25"/>
-<text text-anchor="middle" x="219.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.83,-147.51C128.22,-142.77 151.43,-137.09 171.52,-132.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.27,-135.6 181.15,-129.82 170.6,-128.8 172.27,-135.6"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.12,-93.25 172.38,-93.25 172.38,-74 267.12,-74 267.12,-93.25"/>
-<text text-anchor="middle" x="219.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.62,-147.69C103.3,-135.81 137.84,-115.75 169,-101.62 171.9,-100.31 174.93,-99.02 178,-97.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.98,-101.15 187.04,-94.27 176.45,-94.62 178.98,-101.15"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270.5,-56.25 169,-56.25 169,-37 270.5,-37 270.5,-56.25"/>
-<text text-anchor="middle" x="219.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76,-147.55C92.28,-128.82 129.75,-88.39 169,-64.62 170.89,-63.48 172.86,-62.4 174.88,-61.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.21,-64.61 183.88,-57.3 173.33,-58.23 176.21,-64.61"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.88,-19.25 183.62,-19.25 183.62,0 255.88,0 255.88,-19.25"/>
-<text text-anchor="middle" x="219.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.7,-147.6C85.69,-123.5 121.95,-61.75 169,-27.62 170.35,-26.65 171.75,-25.72 173.2,-24.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.61,-28.05 181.9,-20.35 171.41,-21.82 174.61,-28.05"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 953d4a3c5..000000000
--- a/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function for testing." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 56069c328..000000000
--- a/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5c8673df21a9c29f35d36c032bb053d8
\ No newline at end of file
diff --git a/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 9f35eef9c..000000000
--- a/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function for testing.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 26a9b4781..000000000
--- a/dc/dd9/strand__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="114pt" height="27pt"
- viewBox="0.00 0.00 113.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function for testing.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/dd9/strand__sort_8cpp_source.html b/dc/dd9/strand__sort_8cpp_source.html
new file mode 100644
index 000000000..aa2d266ef
--- /dev/null
+++ b/dc/dd9/strand__sort_8cpp_source.html
@@ -0,0 +1,199 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/strand_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dc/dd9/strand__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">strand_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dc/dd9/strand__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;list&gt;</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d1d/namespacestrand.html">strand</a> {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00036" data-start="{" data-end="}">
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../dc/dd9/strand__sort_8cpp.html#a2bea2fe5dd38ed63610fdeaddf5785cd">   36</a></span>        std::list&lt;T&gt; <a class="code hl_function" href="../../dc/dd9/strand__sort_8cpp.html#a2bea2fe5dd38ed63610fdeaddf5785cd">strand_sort</a>(std::list&lt;T&gt; lst) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>            <span class="keywordflow">if</span> (lst.size() &lt; 2) { <span class="comment">// Returns list if empty or contains only one element</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>                <span class="keywordflow">return</span> lst; <span class="comment">// Returns list</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            }</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>            std::list&lt;T&gt; result; <span class="comment">// Define new &quot;result&quot; named list instance.</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>            std::list&lt;T&gt; sorted; <span class="comment">// Define new &quot;sorted&quot; named list instance.</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>            <span class="keywordflow">while</span>(!lst.empty()) <span class="comment">/* if lst is not empty */</span> {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>                sorted.push_back(lst.front()); <span class="comment">// Adds the first element of &quot;lst&quot; list to the bottom of the &quot;sorted&quot; list.</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>                lst.pop_front(); <span class="comment">// Remove first element of &quot;lst&quot; list.</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>                <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = lst.begin(); it != lst.end(); ) { <span class="comment">// Return the loop as long as the current iterator is not equal to the last literator of the &quot;lst&quot; list.</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>                    <span class="keywordflow">if</span> (sorted.back() &lt;= *it) { <span class="comment">// If the last reference of the &quot;sorted&quot; list is less than or equal to the current iterator reference.</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>                        sorted.push_back(*it); <span class="comment">// Adds the iterator retrieved in the loop under the &quot;sorted&quot; list.</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>                        it = lst.erase(it); <span class="comment">// Deletes the element with the current iterator and assigns the deleted element to the iterator.</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>                    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>                        it++; <span class="comment">// Next iterator.</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>                    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>                }</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>                result.merge(sorted); <span class="comment">// Merge &quot;result&quot; list with &quot;sorted&quot; list.</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            <span class="keywordflow">return</span> result; <span class="comment">// Returns sorted list</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        }</div>
+</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    }  <span class="comment">// namespace strand</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="foldopen" id="foldopen00064" data-start="{" data-end="}">
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   64</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    std::list&lt;int&gt; lst = { -333, 525, 1, 0, 94, 52, 33 };</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Before: &quot;</span>;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keywordflow">for</span>(<span class="keyword">auto</span> item: lst) {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        std::cout &lt;&lt; item &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    }</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    lst = sorting::strand::strand_sort(lst); <span class="comment">// Sort list.</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nAfter: &quot;</span>;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="keywordflow">for</span>(<span class="keyword">auto</span> item: lst) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        std::cout &lt;&lt; item &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>}</div>
+</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="foldopen" id="foldopen00084" data-start="{" data-end="}">
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"><a class="line" href="../../dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   84</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <a class="code hl_function" href="../../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>}</div>
+</div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+<div class="ttc" id="anamespacestrand_html"><div class="ttname"><a href="../../d8/d1d/namespacestrand.html">strand</a></div><div class="ttdoc">Functions for Strand Sort algorithm.</div></div>
+<div class="ttc" id="astrand__sort_8cpp_html_a2bea2fe5dd38ed63610fdeaddf5785cd"><div class="ttname"><a href="../../dc/dd9/strand__sort_8cpp.html#a2bea2fe5dd38ed63610fdeaddf5785cd">sorting::strand::strand_sort</a></div><div class="ttdeci">std::list&lt; T &gt; strand_sort(std::list&lt; T &gt; lst)</div><div class="ttdoc">Apply sorting.</div><div class="ttdef"><b>Definition</b> <a href="#l00036">strand_sort.cpp:36</a></div></div>
+<div class="ttc" id="astrand__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function for testing.</div><div class="ttdef"><b>Definition</b> <a href="#l00064">strand_sort.cpp:64</a></div></div>
+<div class="ttc" id="astrand__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00084">strand_sort.cpp:84</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../dc/dd9/strand__sort_8cpp.html">strand_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dc/de0/structdata__structures_1_1stack__using__queue_1_1_stack-members.html b/dc/de0/structdata__structures_1_1stack__using__queue_1_1_stack-members.html
index 2548a82b2..1e1ff3da0 100644
--- a/dc/de0/structdata__structures_1_1stack__using__queue_1_1_stack-members.html
+++ b/dc/de0/structdata__structures_1_1stack__using__queue_1_1_stack-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dc/de1/recursive__tree__traversal_8cpp.html b/dc/de1/recursive__tree__traversal_8cpp.html
index d72d0a804..5618133a7 100644
--- a/dc/de1/recursive__tree__traversal_8cpp.html
+++ b/dc/de1/recursive__tree__traversal_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/recursive_tree_traversal.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/recursive_tree_traversal.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for recursive_tree_traversal.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/dae/recursive__tree__traversal_8cpp__incl.svg" width="336" height="126"><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">
+</div>
+<p><a href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">others::recursive_tree_traversals::Node</a></td></tr>
@@ -180,6 +199,8 @@ Iterative Postorder Traversal of a tree</h3>
 <p>(L) Recursively traverse its left subtree. When this step is finished, we are back at n again. (R) Recursively traverse its right subtree. When this step is finished, we are back at n again. (N) Process n itself.</p>
 <p>In normal postorder traversal, visit the left subtree before the right subtree. If we visit the right subtree before visiting the left subtree, it is referred to as reverse postorder traversal.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Lazeeez" target="_blank">Lajat Manekar</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a951f01040f518d611228c1d182b8242c" name="a951f01040f518d611228c1d182b8242c"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a951f01040f518d611228c1d182b8242c">&#9670;&#160;</a></span>deleteAll()</h2>
@@ -195,6 +216,8 @@ Iterative Postorder Traversal of a tree</h3>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00185">185</a> of file <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  185</span>                                       {</div>
 <div class="line"><span class="lineno">  186</span>    <span class="keywordflow">if</span> (root) {</div>
 <div class="line"><span class="lineno">  187</span>        deleteAll(root-&gt;left);</div>
@@ -222,17 +245,14 @@ Iterative Postorder Traversal of a tree</h3>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00398">398</a> of file <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  398</span>           {</div>
 <div class="line"><span class="lineno">  399</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  400</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  401</span>}</div>
-<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> recursive_tree_traversal.cpp:386</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="510"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00386">recursive_tree_traversal.cpp:386</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1440a7779ac56f47a3f355ce4a8c7da0" name="a1440a7779ac56f47a3f355ce4a8c7da0"></a>
@@ -255,6 +275,8 @@ Here is the call graph for this function:</div>
 <p>&lt; result stores the inorder traversal of the binary tree</p>
 <p>&lt; result stores the preorder traversal of the binary tree</p>
 <p>&lt; result stores the postorder traversal of the binary tree</p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00201">201</a> of file <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  201</span>             {</div>
 <div class="line"><span class="lineno">  202</span>    <a class="code hl_class" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a> obj1;</div>
 <div class="line"><span class="lineno">  203</span>    <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">others::recursive_tree_traversals::Node</a> *root = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(2);</div>
@@ -267,69 +289,57 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  210</span>    root-&gt;left-&gt;right-&gt;right = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(11);</div>
 <div class="line"><span class="lineno">  211</span>    root-&gt;right-&gt;right-&gt;left = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(4);</div>
 <div class="line"><span class="lineno">  212</span> </div>
-<div class="line"><span class="lineno">  213</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint64_t&gt;</a> actual_result_inorder{2, 7, 5, 6, 11,</div>
+<div class="line"><span class="lineno">  213</span>    std::vector&lt;std::uint64_t&gt; actual_result_inorder{2, 7, 5, 6, 11,</div>
 <div class="line"><span class="lineno">  214</span>                                                     2, 5, 4, 9};</div>
-<div class="line"><span class="lineno">  215</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint64_t&gt;</a> actual_result_preorder{2,  7, 2, 6, 5,</div>
+<div class="line"><span class="lineno">  215</span>    std::vector&lt;std::uint64_t&gt; actual_result_preorder{2,  7, 2, 6, 5,</div>
 <div class="line"><span class="lineno">  216</span>                                                      11, 5, 9, 4};</div>
-<div class="line"><span class="lineno">  217</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint64_t&gt;</a> actual_result_postorder{2, 5, 11, 6, 7,</div>
+<div class="line"><span class="lineno">  217</span>    std::vector&lt;std::uint64_t&gt; actual_result_postorder{2, 5, 11, 6, 7,</div>
 <div class="line"><span class="lineno">  218</span>                                                       4, 9, 5,  2};</div>
-<div class="line"><span class="lineno">  219</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint64_t&gt;</a></div>
-<div class="line"><span class="lineno">  220</span>        result_inorder;  <span class="comment">///&lt; result stores the inorder</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  221</span><span class="comment">                         ///&lt; traversal of the binary tree</span></div>
-<div class="line"><span class="lineno">  222</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint64_t&gt;</a></div>
-<div class="line"><span class="lineno">  223</span>        result_preorder;  <span class="comment">///&lt; result stores the preorder</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  224</span><span class="comment">                          ///&lt; traversal of the binary tree</span></div>
-<div class="line"><span class="lineno">  225</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint64_t&gt;</a></div>
-<div class="line"><span class="lineno">  226</span>        result_postorder;  <span class="comment">///&lt; result stores the postorder</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  227</span><span class="comment">                           ///&lt; traversal of the binary tree</span></div>
-<div class="line"><span class="lineno">  228</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  229</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> size = actual_result_inorder.size();</div>
+<div class="line"><span class="lineno">  219</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><span class="lineno">  220</span>        result_inorder;  </div>
+<div class="line"><span class="lineno">  222</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><span class="lineno">  223</span>        result_preorder;  </div>
+<div class="line"><span class="lineno">  225</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><span class="lineno">  226</span>        result_postorder;  </div>
+<div class="line"><span class="lineno">  228</span> </div>
+<div class="line"><span class="lineno">  229</span>    std::uint64_t size = actual_result_inorder.size();</div>
 <div class="line"><span class="lineno">  230</span> </div>
 <div class="line"><span class="lineno">  231</span>    <span class="comment">// Calling inorder() function by passing a root node,</span></div>
 <div class="line"><span class="lineno">  232</span>    <span class="comment">// and storing the inorder traversal in result_inorder.</span></div>
 <div class="line"><span class="lineno">  233</span>    result_inorder = obj1.inorder(root);</div>
-<div class="line"><span class="lineno">  234</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testcase #1: Inorder Traversal...&quot;</span>;</div>
+<div class="line"><span class="lineno">  234</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #1: Inorder Traversal...&quot;</span>;</div>
 <div class="line"><span class="lineno">  235</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
 <div class="line"><span class="lineno">  236</span>        assert(actual_result_inorder[i] == result_inorder[i]);</div>
 <div class="line"><span class="lineno">  237</span>    }</div>
-<div class="line"><span class="lineno">  238</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; <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">  238</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  239</span> </div>
 <div class="line"><span class="lineno">  240</span>    <span class="comment">// Calling preorder() function by passing a root node,</span></div>
 <div class="line"><span class="lineno">  241</span>    <span class="comment">// and storing the preorder traversal in result_preorder.</span></div>
 <div class="line"><span class="lineno">  242</span>    result_preorder = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">preorder</a>(root);</div>
-<div class="line"><span class="lineno">  243</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testcase #1: Preorder Traversal...&quot;</span>;</div>
+<div class="line"><span class="lineno">  243</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #1: Preorder Traversal...&quot;</span>;</div>
 <div class="line"><span class="lineno">  244</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
 <div class="line"><span class="lineno">  245</span>        assert(actual_result_preorder[i] == result_preorder[i]);</div>
 <div class="line"><span class="lineno">  246</span>    }</div>
-<div class="line"><span class="lineno">  247</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; <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">  247</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  248</span> </div>
 <div class="line"><span class="lineno">  249</span>    <span class="comment">// Calling postorder() function by passing a root node,</span></div>
 <div class="line"><span class="lineno">  250</span>    <span class="comment">// and storing the postorder traversal in result_postorder.</span></div>
 <div class="line"><span class="lineno">  251</span>    result_postorder = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">postorder</a>(root);</div>
-<div class="line"><span class="lineno">  252</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testcase #1: Postorder Traversal...&quot;</span>;</div>
+<div class="line"><span class="lineno">  252</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #1: Postorder Traversal...&quot;</span>;</div>
 <div class="line"><span class="lineno">  253</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
 <div class="line"><span class="lineno">  254</span>        assert(actual_result_postorder[i] == result_postorder[i]);</div>
 <div class="line"><span class="lineno">  255</span>    }</div>
-<div class="line"><span class="lineno">  256</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; <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">  256</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  257</span> </div>
-<div class="line"><span class="lineno">  258</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  258</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  259</span>    deleteAll(root);</div>
 <div class="line"><span class="lineno">  260</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="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html"><div class="ttname"><a href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a></div><div class="ttdoc">BT used to make the entire structure of the binary tree and the functions associated with the binary ...</div><div class="ttdef"><b>Definition</b> recursive_tree_traversal.cpp:88</div></div>
-<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_a6397b78ceec18cb1959a1d159e134da5"><div class="ttname"><a href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">others::recursive_tree_traversals::BT::preorder</a></div><div class="ttdeci">std::vector&lt; std::uint64_t &gt; preorder(Node *)</div><div class="ttdoc">preorder function that will perform the preorder traversal recursively, and return the resultant vect...</div><div class="ttdef"><b>Definition</b> recursive_tree_traversal.cpp:152</div></div>
-<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_ac9404b65f407f631915515fa2e08a40c"><div class="ttname"><a href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">others::recursive_tree_traversals::BT::postorder</a></div><div class="ttdeci">std::vector&lt; std::uint64_t &gt; postorder(Node *)</div><div class="ttdoc">postorder function that will perform the postorder traversal recursively, and return the result vecto...</div><div class="ttdef"><b>Definition</b> recursive_tree_traversal.cpp:172</div></div>
-<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_af16da5fe0f5c54d31778d71d5a042114"><div class="ttname"><a href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">others::recursive_tree_traversals::BT::createNewNode</a></div><div class="ttdeci">Node * createNewNode(std::uint64_t)</div><div class="ttdoc">will allocate the memory for a node and, along the data and return the node.</div><div class="ttdef"><b>Definition</b> recursive_tree_traversal.cpp:118</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="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="astructothers_1_1recursive__tree__traversals_1_1_node_html"><div class="ttname"><a href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">others::recursive_tree_traversals::Node</a></div><div class="ttdoc">The structure to hold Nodes of the tree.</div><div class="ttdef"><b>Definition</b> recursive_tree_traversal.cpp:79</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg" width="522" height="280"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html"><div class="ttname"><a href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a></div><div class="ttdoc">BT used to make the entire structure of the binary tree and the functions associated with the binary ...</div><div class="ttdef"><b>Definition</b> <a href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00088">recursive_tree_traversal.cpp:88</a></div></div>
+<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_a6397b78ceec18cb1959a1d159e134da5"><div class="ttname"><a href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">others::recursive_tree_traversals::BT::preorder</a></div><div class="ttdeci">std::vector&lt; std::uint64_t &gt; preorder(Node *)</div><div class="ttdoc">preorder function that will perform the preorder traversal recursively, and return the resultant vect...</div><div class="ttdef"><b>Definition</b> <a href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00152">recursive_tree_traversal.cpp:152</a></div></div>
+<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_ac9404b65f407f631915515fa2e08a40c"><div class="ttname"><a href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">others::recursive_tree_traversals::BT::postorder</a></div><div class="ttdeci">std::vector&lt; std::uint64_t &gt; postorder(Node *)</div><div class="ttdoc">postorder function that will perform the postorder traversal recursively, and return the result vecto...</div><div class="ttdef"><b>Definition</b> <a href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00172">recursive_tree_traversal.cpp:172</a></div></div>
+<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_af16da5fe0f5c54d31778d71d5a042114"><div class="ttname"><a href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">others::recursive_tree_traversals::BT::createNewNode</a></div><div class="ttdeci">Node * createNewNode(std::uint64_t)</div><div class="ttdoc">will allocate the memory for a node and, along the data and return the node.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00118">recursive_tree_traversal.cpp:118</a></div></div>
+<div class="ttc" id="astructothers_1_1recursive__tree__traversals_1_1_node_html"><div class="ttname"><a href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">others::recursive_tree_traversals::Node</a></div><div class="ttdoc">The structure to hold Nodes of the tree.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00079">recursive_tree_traversal.cpp:79</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0283886819c7c140a023582b7269e2d0" name="a0283886819c7c140a023582b7269e2d0"></a>
@@ -352,6 +362,8 @@ Here is the call graph for this function:</div>
 <p>&lt; result stores the inorder traversal of the binary tree</p>
 <p>&lt; result stores the preorder traversal of the binary tree</p>
 <p>&lt; result stores the postorder traversal of the binary tree</p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00266">266</a> of file <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  266</span>             {</div>
 <div class="line"><span class="lineno">  267</span>    <a class="code hl_class" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a> obj2;</div>
 <div class="line"><span class="lineno">  268</span>    <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">others::recursive_tree_traversals::Node</a> *root = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(1);</div>
@@ -363,57 +375,49 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  274</span>    root-&gt;right-&gt;left-&gt;left = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(7);</div>
 <div class="line"><span class="lineno">  275</span>    root-&gt;right-&gt;left-&gt;right = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(8);</div>
 <div class="line"><span class="lineno">  276</span> </div>
-<div class="line"><span class="lineno">  277</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint64_t&gt;</a> actual_result_inorder{4, 2, 1, 7, 5, 8, 3, 6};</div>
-<div class="line"><span class="lineno">  278</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint64_t&gt;</a> actual_result_preorder{1, 2, 4, 3, 5, 7, 8, 6};</div>
-<div class="line"><span class="lineno">  279</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint64_t&gt;</a> actual_result_postorder{4, 2, 7, 8, 5, 6, 3, 1};</div>
-<div class="line"><span class="lineno">  280</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint64_t&gt;</a></div>
-<div class="line"><span class="lineno">  281</span>        result_inorder;  <span class="comment">///&lt; result stores the inorder</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  282</span><span class="comment">                         ///&lt; traversal of the binary tree</span></div>
-<div class="line"><span class="lineno">  283</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint64_t&gt;</a></div>
-<div class="line"><span class="lineno">  284</span>        result_preorder;  <span class="comment">///&lt; result stores the preorder</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  285</span><span class="comment">                          ///&lt; traversal of the binary tree</span></div>
-<div class="line"><span class="lineno">  286</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint64_t&gt;</a></div>
-<div class="line"><span class="lineno">  287</span>        result_postorder;  <span class="comment">///&lt; result stores the postorder</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  288</span><span class="comment">                           ///&lt; traversal of the binary tree</span></div>
-<div class="line"><span class="lineno">  289</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  290</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> size = actual_result_inorder.size();</div>
+<div class="line"><span class="lineno">  277</span>    std::vector&lt;std::uint64_t&gt; actual_result_inorder{4, 2, 1, 7, 5, 8, 3, 6};</div>
+<div class="line"><span class="lineno">  278</span>    std::vector&lt;std::uint64_t&gt; actual_result_preorder{1, 2, 4, 3, 5, 7, 8, 6};</div>
+<div class="line"><span class="lineno">  279</span>    std::vector&lt;std::uint64_t&gt; actual_result_postorder{4, 2, 7, 8, 5, 6, 3, 1};</div>
+<div class="line"><span class="lineno">  280</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><span class="lineno">  281</span>        result_inorder;  </div>
+<div class="line"><span class="lineno">  283</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><span class="lineno">  284</span>        result_preorder;  </div>
+<div class="line"><span class="lineno">  286</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><span class="lineno">  287</span>        result_postorder;  </div>
+<div class="line"><span class="lineno">  289</span> </div>
+<div class="line"><span class="lineno">  290</span>    std::uint64_t size = actual_result_inorder.size();</div>
 <div class="line"><span class="lineno">  291</span> </div>
 <div class="line"><span class="lineno">  292</span>    <span class="comment">// Calling inorder() function by passing a root node,</span></div>
 <div class="line"><span class="lineno">  293</span>    <span class="comment">// and storing the inorder traversal in result_inorder.</span></div>
 <div class="line"><span class="lineno">  294</span>    result_inorder = obj2.inorder(root);</div>
-<div class="line"><span class="lineno">  295</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testcase #2: Inorder Traversal...&quot;</span>;</div>
+<div class="line"><span class="lineno">  295</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #2: Inorder Traversal...&quot;</span>;</div>
 <div class="line"><span class="lineno">  296</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
 <div class="line"><span class="lineno">  297</span>        assert(actual_result_inorder[i] == result_inorder[i]);</div>
 <div class="line"><span class="lineno">  298</span>    }</div>
-<div class="line"><span class="lineno">  299</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; <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">  299</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  300</span> </div>
 <div class="line"><span class="lineno">  301</span>    <span class="comment">// Calling preorder() function by passing a root node,</span></div>
 <div class="line"><span class="lineno">  302</span>    <span class="comment">// and storing the preorder traversal in result_preorder.</span></div>
 <div class="line"><span class="lineno">  303</span>    result_preorder = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">preorder</a>(root);</div>
-<div class="line"><span class="lineno">  304</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testcase #2: Preorder Traversal...&quot;</span>;</div>
+<div class="line"><span class="lineno">  304</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #2: Preorder Traversal...&quot;</span>;</div>
 <div class="line"><span class="lineno">  305</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
 <div class="line"><span class="lineno">  306</span>        assert(actual_result_preorder[i] == result_preorder[i]);</div>
 <div class="line"><span class="lineno">  307</span>    }</div>
-<div class="line"><span class="lineno">  308</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; <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">  308</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  309</span> </div>
 <div class="line"><span class="lineno">  310</span>    <span class="comment">// Calling postorder() function by passing a root node,</span></div>
 <div class="line"><span class="lineno">  311</span>    <span class="comment">// and storing the postorder traversal in result_postorder.</span></div>
 <div class="line"><span class="lineno">  312</span>    result_postorder = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">postorder</a>(root);</div>
-<div class="line"><span class="lineno">  313</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testcase #2: Postorder Traversal...&quot;</span>;</div>
+<div class="line"><span class="lineno">  313</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #2: Postorder Traversal...&quot;</span>;</div>
 <div class="line"><span class="lineno">  314</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
 <div class="line"><span class="lineno">  315</span>        assert(actual_result_postorder[i] == result_postorder[i]);</div>
 <div class="line"><span class="lineno">  316</span>    }</div>
-<div class="line"><span class="lineno">  317</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; <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">  317</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  318</span> </div>
-<div class="line"><span class="lineno">  319</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  319</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  320</span>    deleteAll(root);</div>
 <div class="line"><span class="lineno">  321</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg" width="522" height="280"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6d0455dd5c30adda100e95f0423c786e" name="a6d0455dd5c30adda100e95f0423c786e"></a>
@@ -436,6 +440,8 @@ Here is the call graph for this function:</div>
 <p>&lt; result stores the inorder traversal of the binary tree</p>
 <p>&lt; result stores the preorder traversal of the binary tree</p>
 <p>&lt; result stores the postorder traversal of the binary tree</p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00327">327</a> of file <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  327</span>             {</div>
 <div class="line"><span class="lineno">  328</span>    <a class="code hl_class" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a> obj3;</div>
 <div class="line"><span class="lineno">  329</span>    <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">others::recursive_tree_traversals::Node</a> *root = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(1);</div>
@@ -444,58 +450,50 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  332</span>    root-&gt;left-&gt;left = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(4);</div>
 <div class="line"><span class="lineno">  333</span>    root-&gt;left-&gt;right = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(5);</div>
 <div class="line"><span class="lineno">  334</span> </div>
-<div class="line"><span class="lineno">  335</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint64_t&gt;</a> actual_result_inorder{4, 2, 5, 1, 3};</div>
-<div class="line"><span class="lineno">  336</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint64_t&gt;</a> actual_result_preorder{1, 2, 4, 5, 3};</div>
-<div class="line"><span class="lineno">  337</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint64_t&gt;</a> actual_result_postorder{4, 5, 2, 3, 1};</div>
-<div class="line"><span class="lineno">  338</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint64_t&gt;</a></div>
-<div class="line"><span class="lineno">  339</span>        result_inorder;  <span class="comment">///&lt; result stores the inorder</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  340</span><span class="comment">                         ///&lt; traversal of the binary tree</span></div>
-<div class="line"><span class="lineno">  341</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint64_t&gt;</a></div>
-<div class="line"><span class="lineno">  342</span>        result_preorder;  <span class="comment">///&lt; result stores the preorder</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  343</span><span class="comment">                          ///&lt; traversal of the binary tree</span></div>
-<div class="line"><span class="lineno">  344</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint64_t&gt;</a></div>
-<div class="line"><span class="lineno">  345</span>        result_postorder;  <span class="comment">///&lt; result stores the postorder</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  346</span><span class="comment">                           ///&lt; traversal of the binary tree</span></div>
-<div class="line"><span class="lineno">  347</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  348</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> size = actual_result_inorder.size();</div>
+<div class="line"><span class="lineno">  335</span>    std::vector&lt;std::uint64_t&gt; actual_result_inorder{4, 2, 5, 1, 3};</div>
+<div class="line"><span class="lineno">  336</span>    std::vector&lt;std::uint64_t&gt; actual_result_preorder{1, 2, 4, 5, 3};</div>
+<div class="line"><span class="lineno">  337</span>    std::vector&lt;std::uint64_t&gt; actual_result_postorder{4, 5, 2, 3, 1};</div>
+<div class="line"><span class="lineno">  338</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><span class="lineno">  339</span>        result_inorder;  </div>
+<div class="line"><span class="lineno">  341</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><span class="lineno">  342</span>        result_preorder;  </div>
+<div class="line"><span class="lineno">  344</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><span class="lineno">  345</span>        result_postorder;  </div>
+<div class="line"><span class="lineno">  347</span> </div>
+<div class="line"><span class="lineno">  348</span>    std::uint64_t size = actual_result_inorder.size();</div>
 <div class="line"><span class="lineno">  349</span> </div>
 <div class="line"><span class="lineno">  350</span>    <span class="comment">// Calling inorder() function by passing a root node,</span></div>
 <div class="line"><span class="lineno">  351</span>    <span class="comment">// and storing the inorder traversal in result_inorder.</span></div>
 <div class="line"><span class="lineno">  352</span> </div>
 <div class="line"><span class="lineno">  353</span>    result_inorder = obj3.inorder(root);</div>
-<div class="line"><span class="lineno">  354</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testcase #3: Inorder Traversal...&quot;</span>;</div>
+<div class="line"><span class="lineno">  354</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #3: Inorder Traversal...&quot;</span>;</div>
 <div class="line"><span class="lineno">  355</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
 <div class="line"><span class="lineno">  356</span>        assert(actual_result_inorder[i] == result_inorder[i]);</div>
 <div class="line"><span class="lineno">  357</span>    }</div>
-<div class="line"><span class="lineno">  358</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; <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">  358</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  359</span> </div>
 <div class="line"><span class="lineno">  360</span>    <span class="comment">// Calling preorder() function by passing a root node,</span></div>
 <div class="line"><span class="lineno">  361</span>    <span class="comment">// and storing the preorder traversal in result_preorder.</span></div>
 <div class="line"><span class="lineno">  362</span>    result_preorder = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">preorder</a>(root);</div>
-<div class="line"><span class="lineno">  363</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testcase #3: Preorder Traversal...&quot;</span>;</div>
+<div class="line"><span class="lineno">  363</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #3: Preorder Traversal...&quot;</span>;</div>
 <div class="line"><span class="lineno">  364</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
 <div class="line"><span class="lineno">  365</span>        assert(actual_result_preorder[i] == result_preorder[i]);</div>
 <div class="line"><span class="lineno">  366</span>    }</div>
-<div class="line"><span class="lineno">  367</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; <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">  367</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  368</span> </div>
 <div class="line"><span class="lineno">  369</span>    <span class="comment">// Calling postorder() function by passing a root node,</span></div>
 <div class="line"><span class="lineno">  370</span>    <span class="comment">// and storing the postorder traversal in result_postorder.</span></div>
 <div class="line"><span class="lineno">  371</span>    result_postorder = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">postorder</a>(root);</div>
-<div class="line"><span class="lineno">  372</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testcase #3: Postorder Traversal...&quot;</span>;</div>
+<div class="line"><span class="lineno">  372</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #3: Postorder Traversal...&quot;</span>;</div>
 <div class="line"><span class="lineno">  373</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
 <div class="line"><span class="lineno">  374</span>        assert(actual_result_postorder[i] == result_postorder[i]);</div>
 <div class="line"><span class="lineno">  375</span>    }</div>
-<div class="line"><span class="lineno">  376</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; <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">  376</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  377</span> </div>
-<div class="line"><span class="lineno">  378</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  378</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  379</span>    deleteAll(root);</div>
 <div class="line"><span class="lineno">  380</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg" width="522" height="280"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -523,23 +521,20 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00386">386</a> of file <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  386</span>                    {</div>
-<div class="line"><span class="lineno">  387</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1st test-case&quot;</span> &lt;&lt; <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">  387</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test-case&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  388</span>    <a class="code hl_function" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();  <span class="comment">// run 1st test-case</span></div>
-<div class="line"><span class="lineno">  389</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2nd test-case&quot;</span> &lt;&lt; <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">  389</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test-case&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  390</span>    <a class="code hl_function" href="#a0283886819c7c140a023582b7269e2d0">test2</a>();  <span class="comment">// run 2nd test-case</span></div>
-<div class="line"><span class="lineno">  391</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;3rd test-case&quot;</span> &lt;&lt; <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">  391</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test-case&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  392</span>    <a class="code hl_function" href="#a6d0455dd5c30adda100e95f0423c786e">test3</a>();  <span class="comment">// run 3rd test-case</span></div>
 <div class="line"><span class="lineno">  393</span>}</div>
-<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">2nd test-case</div><div class="ttdef"><b>Definition</b> recursive_tree_traversal.cpp:266</div></div>
-<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">1st test-case</div><div class="ttdef"><b>Definition</b> recursive_tree_traversal.cpp:201</div></div>
-<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">3rd test-case</div><div class="ttdef"><b>Definition</b> recursive_tree_traversal.cpp:327</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="620" height="280"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">2nd test-case</div><div class="ttdef"><b>Definition</b> <a href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00266">recursive_tree_traversal.cpp:266</a></div></div>
+<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">1st test-case</div><div class="ttdef"><b>Definition</b> <a href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00201">recursive_tree_traversal.cpp:201</a></div></div>
+<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">3rd test-case</div><div class="ttdef"><b>Definition</b> <a href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00327">recursive_tree_traversal.cpp:327</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
deleted file mode 100644
index 20f9eb75b..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="test2" name="test2">
-<area shape="rect" id="Node000001" title="2nd test&#45;case" alt="" coords="5,112,56,137"/>
-<area shape="rect" id="Node000002" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" title="will allocate the memory for a node and, along the data and return the node." alt="" coords="104,5,314,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="41,109,67,82,102,55,111,50,114,55,105,60,71,86,45,113"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="173,70,244,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,116,158,92,159,97,57,121"/>
-<area shape="rect" id="Node000004" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" title="postorder function that will perform the postorder traversal recursively, and return the result vecto..." alt="" coords="124,144,294,185"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="57,127,109,139,108,144,56,132"/>
-<area shape="rect" id="Node000005" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" title="preorder function that will perform the preorder traversal recursively, and return the resultant vect..." alt="" coords="127,233,290,274"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="45,136,71,164,105,194,151,223,149,228,102,198,68,168,41,139"/>
-<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="175,144,173,134,179,125,191,119,209,117,228,120,240,126,237,131,227,125,209,123,192,125,182,129,178,135,180,143"/>
-<area shape="poly" id="edge6_Node000005_Node000005" title=" " alt="" coords="175,233,173,223,179,214,191,209,209,207,228,209,240,215,237,220,227,214,209,212,192,214,182,218,178,224,180,232"/>
-<area shape="rect" id="Node000006" 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="362,241,516,266"/>
-<area shape="poly" id="edge7_Node000005_Node000006" title=" " alt="" coords="291,251,346,251,346,256,291,256"/>
-</map>
diff --git a/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
deleted file mode 100644
index 907d214db..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c7072df08cb5f99034991db3e499a77f
\ No newline at end of file
diff --git a/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
deleted file mode 100644
index 98e5662d1..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
+++ /dev/null
@@ -1,158 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="391pt" height="210pt"
- viewBox="0.00 0.00 391.25 209.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 205.5)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="2nd test&#45;case">
-<polygon fill="#999999" stroke="#666666" points="37.75,-121.88 0,-121.88 0,-102.62 37.75,-102.62 37.75,-121.88"/>
-<text text-anchor="middle" x="18.88" y="-108.38" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
-<polygon fill="white" stroke="#666666" points="231.5,-201.5 73.75,-201.5 73.75,-171 231.5,-171 231.5,-201.5"/>
-<text text-anchor="start" x="81.75" y="-188" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="152.62" y="-176.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.01,-122.11C37.78,-133.35 55.18,-151.53 73.75,-162.25 75.94,-163.51 78.2,-164.72 80.52,-165.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.01,-169.03 89.57,-169.92 81.87,-162.64 79.01,-169.03"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="179.38,-152.88 125.88,-152.88 125.88,-133.62 179.38,-133.62 179.38,-152.88"/>
-<text text-anchor="middle" x="152.62" y="-139.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-116.56C57.94,-121.21 89.88,-128.72 114.85,-134.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="113.75,-137.93 124.29,-136.82 115.36,-131.12 113.75,-137.93"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
-<polygon fill="white" stroke="#666666" points="216.5,-97.5 88.75,-97.5 88.75,-67 216.5,-67 216.5,-97.5"/>
-<text text-anchor="start" x="96.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="152.62" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-108.08C48.73,-105.68 62.74,-102.49 77.31,-99.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.07,-102.59 87.04,-96.96 76.51,-95.76 78.07,-102.59"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
-<polygon fill="white" stroke="#666666" points="213.88,-30.5 91.38,-30.5 91.38,0 213.88,0 213.88,-30.5"/>
-<text text-anchor="start" x="99.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="152.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.3,-102.24C38.33,-90.71 55.98,-71.63 73.75,-58.25 84.44,-50.2 96.81,-42.68 108.5,-36.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.03,-39.39 117.2,-31.59 106.73,-33.22 110.03,-39.39"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.92,-97.99C124.09,-107.06 131.99,-115.5 152.62,-115.5 163.91,-115.5 171.39,-112.97 175.06,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.51,-109.82 176.16,-99.49 171.55,-109.03 178.51,-109.82"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.92,-30.99C124.09,-40.06 131.99,-48.5 152.62,-48.5 163.91,-48.5 171.39,-45.97 175.06,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.51,-42.82 176.16,-32.49 171.55,-42.03 178.51,-42.82"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-24.88 267.5,-24.88 267.5,-5.63 383.25,-5.63 383.25,-24.88"/>
-<text text-anchor="middle" x="325.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge7_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge7_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.31,-15.25C227.71,-15.25 242,-15.25 255.7,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="255.52,-18.75 265.52,-15.25 255.52,-11.75 255.52,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
deleted file mode 100644
index 70d42e219..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
+++ /dev/null
@@ -1,132 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="391pt" height="210pt"
- viewBox="0.00 0.00 391.25 209.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 205.5)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="2nd test&#45;case">
-<polygon fill="#999999" stroke="#666666" points="37.75,-121.88 0,-121.88 0,-102.62 37.75,-102.62 37.75,-121.88"/>
-<text text-anchor="middle" x="18.88" y="-108.38" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
-<polygon fill="white" stroke="#666666" points="231.5,-201.5 73.75,-201.5 73.75,-171 231.5,-171 231.5,-201.5"/>
-<text text-anchor="start" x="81.75" y="-188" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="152.62" y="-176.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.01,-122.11C37.78,-133.35 55.18,-151.53 73.75,-162.25 75.94,-163.51 78.2,-164.72 80.52,-165.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.01,-169.03 89.57,-169.92 81.87,-162.64 79.01,-169.03"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="179.38,-152.88 125.88,-152.88 125.88,-133.62 179.38,-133.62 179.38,-152.88"/>
-<text text-anchor="middle" x="152.62" y="-139.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-116.56C57.94,-121.21 89.88,-128.72 114.85,-134.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="113.75,-137.93 124.29,-136.82 115.36,-131.12 113.75,-137.93"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
-<polygon fill="white" stroke="#666666" points="216.5,-97.5 88.75,-97.5 88.75,-67 216.5,-67 216.5,-97.5"/>
-<text text-anchor="start" x="96.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="152.62" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-108.08C48.73,-105.68 62.74,-102.49 77.31,-99.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.07,-102.59 87.04,-96.96 76.51,-95.76 78.07,-102.59"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
-<polygon fill="white" stroke="#666666" points="213.88,-30.5 91.38,-30.5 91.38,0 213.88,0 213.88,-30.5"/>
-<text text-anchor="start" x="99.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="152.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.3,-102.24C38.33,-90.71 55.98,-71.63 73.75,-58.25 84.44,-50.2 96.81,-42.68 108.5,-36.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.03,-39.39 117.2,-31.59 106.73,-33.22 110.03,-39.39"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.92,-97.99C124.09,-107.06 131.99,-115.5 152.62,-115.5 163.91,-115.5 171.39,-112.97 175.06,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.51,-109.82 176.16,-99.49 171.55,-109.03 178.51,-109.82"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.92,-30.99C124.09,-40.06 131.99,-48.5 152.62,-48.5 163.91,-48.5 171.39,-45.97 175.06,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.51,-42.82 176.16,-32.49 171.55,-42.03 178.51,-42.82"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-24.88 267.5,-24.88 267.5,-5.63 383.25,-5.63 383.25,-24.88"/>
-<text text-anchor="middle" x="325.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge7_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge7_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.31,-15.25C227.71,-15.25 242,-15.25 255.7,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="255.52,-18.75 265.52,-15.25 255.52,-11.75 255.52,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
deleted file mode 100644
index a6eb006c1..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="test1" name="test1">
-<area shape="rect" id="Node000001" title="1st test&#45;case" alt="" coords="5,112,56,137"/>
-<area shape="rect" id="Node000002" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" title="will allocate the memory for a node and, along the data and return the node." alt="" coords="104,5,314,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="41,109,67,82,102,55,111,50,114,55,105,60,71,86,45,113"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="173,70,244,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,116,158,92,159,97,57,121"/>
-<area shape="rect" id="Node000004" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" title="postorder function that will perform the postorder traversal recursively, and return the result vecto..." alt="" coords="124,144,294,185"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="57,127,109,139,108,144,56,132"/>
-<area shape="rect" id="Node000005" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" title="preorder function that will perform the preorder traversal recursively, and return the resultant vect..." alt="" coords="127,233,290,274"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="45,136,71,164,105,194,151,223,149,228,102,198,68,168,41,139"/>
-<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="175,144,173,134,179,125,191,119,209,117,228,120,240,126,237,131,227,125,209,123,192,125,182,129,178,135,180,143"/>
-<area shape="poly" id="edge6_Node000005_Node000005" title=" " alt="" coords="175,233,173,223,179,214,191,209,209,207,228,209,240,215,237,220,227,214,209,212,192,214,182,218,178,224,180,232"/>
-<area shape="rect" id="Node000006" 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="362,241,516,266"/>
-<area shape="poly" id="edge7_Node000005_Node000006" title=" " alt="" coords="291,251,346,251,346,256,291,256"/>
-</map>
diff --git a/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
deleted file mode 100644
index ada41932b..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1b5ce80b47cd8b7f1d354d18b309e180
\ No newline at end of file
diff --git a/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg b/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
deleted file mode 100644
index 599ae618e..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
+++ /dev/null
@@ -1,158 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="391pt" height="210pt"
- viewBox="0.00 0.00 391.25 209.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 205.5)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="1st test&#45;case">
-<polygon fill="#999999" stroke="#666666" points="37.75,-121.88 0,-121.88 0,-102.62 37.75,-102.62 37.75,-121.88"/>
-<text text-anchor="middle" x="18.88" y="-108.38" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
-<polygon fill="white" stroke="#666666" points="231.5,-201.5 73.75,-201.5 73.75,-171 231.5,-171 231.5,-201.5"/>
-<text text-anchor="start" x="81.75" y="-188" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="152.62" y="-176.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.01,-122.11C37.78,-133.35 55.18,-151.53 73.75,-162.25 75.94,-163.51 78.2,-164.72 80.52,-165.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.01,-169.03 89.57,-169.92 81.87,-162.64 79.01,-169.03"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="179.38,-152.88 125.88,-152.88 125.88,-133.62 179.38,-133.62 179.38,-152.88"/>
-<text text-anchor="middle" x="152.62" y="-139.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-116.56C57.94,-121.21 89.88,-128.72 114.85,-134.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="113.75,-137.93 124.29,-136.82 115.36,-131.12 113.75,-137.93"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
-<polygon fill="white" stroke="#666666" points="216.5,-97.5 88.75,-97.5 88.75,-67 216.5,-67 216.5,-97.5"/>
-<text text-anchor="start" x="96.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="152.62" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-108.08C48.73,-105.68 62.74,-102.49 77.31,-99.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.07,-102.59 87.04,-96.96 76.51,-95.76 78.07,-102.59"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
-<polygon fill="white" stroke="#666666" points="213.88,-30.5 91.38,-30.5 91.38,0 213.88,0 213.88,-30.5"/>
-<text text-anchor="start" x="99.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="152.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.3,-102.24C38.33,-90.71 55.98,-71.63 73.75,-58.25 84.44,-50.2 96.81,-42.68 108.5,-36.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.03,-39.39 117.2,-31.59 106.73,-33.22 110.03,-39.39"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.92,-97.99C124.09,-107.06 131.99,-115.5 152.62,-115.5 163.91,-115.5 171.39,-112.97 175.06,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.51,-109.82 176.16,-99.49 171.55,-109.03 178.51,-109.82"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.92,-30.99C124.09,-40.06 131.99,-48.5 152.62,-48.5 163.91,-48.5 171.39,-45.97 175.06,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.51,-42.82 176.16,-32.49 171.55,-42.03 178.51,-42.82"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-24.88 267.5,-24.88 267.5,-5.63 383.25,-5.63 383.25,-24.88"/>
-<text text-anchor="middle" x="325.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge7_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge7_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.31,-15.25C227.71,-15.25 242,-15.25 255.7,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="255.52,-18.75 265.52,-15.25 255.52,-11.75 255.52,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
deleted file mode 100644
index ca318f02e..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
+++ /dev/null
@@ -1,132 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="391pt" height="210pt"
- viewBox="0.00 0.00 391.25 209.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 205.5)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="1st test&#45;case">
-<polygon fill="#999999" stroke="#666666" points="37.75,-121.88 0,-121.88 0,-102.62 37.75,-102.62 37.75,-121.88"/>
-<text text-anchor="middle" x="18.88" y="-108.38" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
-<polygon fill="white" stroke="#666666" points="231.5,-201.5 73.75,-201.5 73.75,-171 231.5,-171 231.5,-201.5"/>
-<text text-anchor="start" x="81.75" y="-188" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="152.62" y="-176.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.01,-122.11C37.78,-133.35 55.18,-151.53 73.75,-162.25 75.94,-163.51 78.2,-164.72 80.52,-165.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.01,-169.03 89.57,-169.92 81.87,-162.64 79.01,-169.03"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="179.38,-152.88 125.88,-152.88 125.88,-133.62 179.38,-133.62 179.38,-152.88"/>
-<text text-anchor="middle" x="152.62" y="-139.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-116.56C57.94,-121.21 89.88,-128.72 114.85,-134.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="113.75,-137.93 124.29,-136.82 115.36,-131.12 113.75,-137.93"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
-<polygon fill="white" stroke="#666666" points="216.5,-97.5 88.75,-97.5 88.75,-67 216.5,-67 216.5,-97.5"/>
-<text text-anchor="start" x="96.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="152.62" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-108.08C48.73,-105.68 62.74,-102.49 77.31,-99.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.07,-102.59 87.04,-96.96 76.51,-95.76 78.07,-102.59"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
-<polygon fill="white" stroke="#666666" points="213.88,-30.5 91.38,-30.5 91.38,0 213.88,0 213.88,-30.5"/>
-<text text-anchor="start" x="99.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="152.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.3,-102.24C38.33,-90.71 55.98,-71.63 73.75,-58.25 84.44,-50.2 96.81,-42.68 108.5,-36.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.03,-39.39 117.2,-31.59 106.73,-33.22 110.03,-39.39"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.92,-97.99C124.09,-107.06 131.99,-115.5 152.62,-115.5 163.91,-115.5 171.39,-112.97 175.06,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.51,-109.82 176.16,-99.49 171.55,-109.03 178.51,-109.82"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.92,-30.99C124.09,-40.06 131.99,-48.5 152.62,-48.5 163.91,-48.5 171.39,-45.97 175.06,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.51,-42.82 176.16,-32.49 171.55,-42.03 178.51,-42.82"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-24.88 267.5,-24.88 267.5,-5.63 383.25,-5.63 383.25,-24.88"/>
-<text text-anchor="middle" x="325.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge7_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge7_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.31,-15.25C227.71,-15.25 242,-15.25 255.7,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="255.52,-18.75 265.52,-15.25 255.52,-11.75 255.52,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index 8d9dc0ecb..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,30 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,81,56,107"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="272,5,343,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="44,79,70,59,103,41,142,29,182,21,256,15,256,20,183,27,143,34,105,46,73,63,48,83"/>
-<area shape="rect" id="Node000003" href="$dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" title="1st test&#45;case" alt="" coords="104,56,154,82"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,85,88,77,89,82,57,90"/>
-<area shape="rect" id="Node000008" href="$dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0" title="2nd test&#45;case" alt="" coords="104,105,154,131"/>
-<area shape="poly" id="edge10_Node000001_Node000008" title=" " alt="" coords="57,98,89,106,88,111,55,103"/>
-<area shape="rect" id="Node000009" href="$dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" title="3rd test&#45;case" alt="" coords="104,155,154,180"/>
-<area shape="poly" id="edge15_Node000001_Node000009" title=" " alt="" coords="51,106,100,143,97,147,48,110"/>
-<area shape="poly" id="edge4_Node000003_Node000002" title=" " alt="" coords="154,57,201,41,256,27,257,32,203,46,155,62"/>
-<area shape="rect" id="Node000004" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" title="will allocate the memory for a node and, along the data and return the node." alt="" coords="202,55,412,96"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="155,67,187,68,187,74,154,72"/>
-<area shape="rect" id="Node000005" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" title="postorder function that will perform the postorder traversal recursively, and return the result vecto..." alt="" coords="222,144,392,185"/>
-<area shape="poly" id="edge5_Node000003_Node000005" title=" " alt="" coords="156,80,256,134,253,139,153,85"/>
-<area shape="rect" id="Node000006" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" title="preorder function that will perform the preorder traversal recursively, and return the resultant vect..." alt="" coords="226,234,389,274"/>
-<area shape="poly" id="edge7_Node000003_Node000006" title=" " alt="" coords="147,81,156,91,171,121,178,146,186,170,204,195,242,224,238,228,200,199,182,172,173,147,166,122,152,94,143,84"/>
-<area shape="poly" id="edge6_Node000005_Node000005" title=" " alt="" coords="273,144,271,135,277,126,289,120,307,118,327,120,338,127,336,131,325,125,307,123,290,125,280,130,277,136,278,143"/>
-<area shape="poly" id="edge8_Node000006_Node000006" title=" " alt="" coords="273,234,271,224,277,215,289,209,307,207,327,210,338,216,336,221,325,215,307,212,290,214,280,219,277,225,278,233"/>
-<area shape="rect" id="Node000007" 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="460,241,615,267"/>
-<area shape="poly" id="edge9_Node000006_Node000007" title=" " alt="" coords="389,252,445,252,445,257,389,257"/>
-<area shape="poly" id="edge12_Node000008_Node000002" title=" " alt="" coords="141,103,152,92,174,65,184,53,201,41,228,29,256,22,257,27,230,34,203,46,188,57,178,68,156,96,145,107"/>
-<area shape="poly" id="edge11_Node000008_Node000004" title=" " alt="" coords="154,110,205,97,206,103,155,115"/>
-<area shape="poly" id="edge13_Node000008_Node000005" title=" " alt="" coords="155,122,213,137,211,142,154,127"/>
-<area shape="poly" id="edge14_Node000008_Node000006" title=" " alt="" coords="145,129,156,140,179,169,204,195,248,224,246,229,200,199,175,173,152,144,142,133"/>
-<area shape="poly" id="edge17_Node000009_Node000002" title=" " alt="" coords="143,153,152,142,166,114,172,89,180,65,200,41,227,27,255,19,257,24,229,32,204,46,185,68,177,91,171,116,156,145,147,156"/>
-<area shape="poly" id="edge16_Node000009_Node000004" title=" " alt="" coords="142,152,168,129,201,107,214,100,217,105,203,111,171,133,145,156"/>
-<area shape="poly" id="edge18_Node000009_Node000005" title=" " alt="" coords="155,164,207,164,207,169,155,170"/>
-<area shape="poly" id="edge19_Node000009_Node000006" title=" " alt="" coords="156,177,251,224,248,229,153,182"/>
-</map>
diff --git a/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 0a8194218..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d7adf2d125e93032f623b2d5accdde46
\ No newline at end of file
diff --git a/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index 33d1944f1..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,293 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="465pt" height="210pt"
- viewBox="0.00 0.00 465.00 209.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 205.88)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-144.88 0,-144.88 0,-125.62 37.75,-125.62 37.75,-144.88"/>
-<text text-anchor="middle" x="18.88" y="-131.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.12,-201.88 199.62,-201.88 199.62,-182.62 253.12,-182.62 253.12,-201.88"/>
-<text text-anchor="middle" x="226.38" y="-188.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.49,-145.16C40.74,-154.1 57.1,-166.8 73.75,-173.25 110.82,-187.61 156.45,-191.67 187.91,-192.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.65,-196.06 197.72,-192.74 187.78,-189.06 187.65,-196.06"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title="1st test&#45;case">
-<polygon fill="white" stroke="#666666" points="111.5,-163.88 73.75,-163.88 73.75,-144.62 111.5,-144.62 111.5,-163.88"/>
-<text text-anchor="middle" x="92.62" y="-150.38" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.98,-140.04C45.32,-141.99 53.98,-144.28 62.18,-146.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.25,-149.83 71.81,-149 63.04,-143.06 61.25,-149.83"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title="2nd test&#45;case">
-<polygon fill="white" stroke="#666666" points="111.5,-126.88 73.75,-126.88 73.75,-107.62 111.5,-107.62 111.5,-126.88"/>
-<text text-anchor="middle" x="92.62" y="-113.38" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge10_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge10_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.98,-130.71C45.32,-128.87 53.98,-126.69 62.18,-124.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.96,-128.05 71.81,-122.22 61.26,-121.26 62.96,-128.05"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" target="_top" xlink:title="3rd test&#45;case">
-<polygon fill="white" stroke="#666666" points="111.5,-89.88 73.75,-89.88 73.75,-70.62 111.5,-70.62 111.5,-89.88"/>
-<text text-anchor="middle" x="92.62" y="-76.38" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge15_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge15_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.04,-125.16C43.25,-117.33 57.64,-106.3 69.6,-97.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.54,-100.06 77.35,-91.19 67.28,-94.5 71.54,-100.06"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge4_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge4_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.93,-161.22C122.28,-165.03 135.52,-169.69 147.5,-173.25 160.71,-177.18 175.34,-180.91 188.33,-184.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.23,-187.35 197.77,-186.22 188.83,-180.53 187.23,-187.35"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
-<polygon fill="white" stroke="#666666" points="305.25,-164.5 147.5,-164.5 147.5,-134 305.25,-134 305.25,-164.5"/>
-<text text-anchor="start" x="155.5" y="-151" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="226.38" y="-139.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.94,-153.55C118.78,-153.3 127.08,-152.98 136.05,-152.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.89,-156.15 145.75,-152.27 135.62,-149.15 135.89,-156.15"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
-<polygon fill="white" stroke="#666666" points="290.25,-97.5 162.5,-97.5 162.5,-67 290.25,-67 290.25,-97.5"/>
-<text text-anchor="start" x="170.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="226.38" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge5_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge5_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.94,-144.24C131.21,-133.71 162.09,-116.83 186.77,-103.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.15,-106.58 195.25,-98.72 184.79,-100.44 188.15,-106.58"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
-<polygon fill="white" stroke="#666666" points="287.62,-30.5 165.12,-30.5 165.12,0 287.62,0 287.62,-30.5"/>
-<text text-anchor="start" x="173.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="226.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge7_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge7_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.88,-144.14C107.24,-141.7 109.59,-139 111.5,-136.25 133.28,-104.89 121.49,-86.2 147.5,-58.25 155.55,-49.6 165.75,-42.27 176.09,-36.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.53,-39.46 184.65,-31.61 174.2,-33.3 177.53,-39.46"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.67,-97.99C197.84,-107.06 205.74,-115.5 226.38,-115.5 237.66,-115.5 245.14,-112.97 248.81,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="252.26,-109.82 249.91,-99.49 245.3,-109.03 252.26,-109.82"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge8_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge8_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.67,-30.99C197.84,-40.06 205.74,-48.5 226.38,-48.5 237.66,-48.5 245.14,-45.97 248.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="252.26,-42.82 249.91,-32.49 245.3,-42.03 252.26,-42.82"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="457,-24.88 341.25,-24.88 341.25,-5.63 457,-5.63 457,-24.88"/>
-<text text-anchor="middle" x="399.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge9_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge9_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M288.06,-15.25C301.46,-15.25 315.75,-15.25 329.45,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.27,-18.75 339.27,-15.25 329.27,-11.75 329.27,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node2 -->
-<g id="edge12_Node000008_Node000002" class="edge">
-<title>Node8&#45;&gt;Node2</title>
-<g id="a_edge12_Node000008_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.5,-127.11C106.11,-129.74 108.92,-132.59 111.5,-135.25 127.7,-151.95 127.38,-161.57 147.5,-173.25 159.91,-180.45 174.96,-184.94 188.51,-187.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.49,-191.1 197.96,-189.42 188.73,-184.21 187.49,-191.1"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge11_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge11_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.94,-121.7C122.2,-124.19 135.75,-127.48 149.9,-130.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.78,-134.25 159.32,-133.21 150.43,-127.44 148.78,-134.25"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge13_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge13_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.94,-112.38C123.43,-109.33 139.06,-105.18 155.03,-100.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.87,-104.34 164.64,-98.39 154.07,-97.57 155.87,-104.34"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge14_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge14_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.57,-107.45C106.18,-104.82 108.97,-101.95 111.5,-99.25 128.05,-81.53 128.6,-73.45 147.5,-58.25 157.74,-50.01 169.77,-42.5 181.28,-36.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.68,-39.37 189.86,-31.58 179.39,-33.19 182.68,-39.37"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node2 -->
-<g id="edge17_Node000009_Node000002" class="edge">
-<title>Node9&#45;&gt;Node2</title>
-<g id="a_edge17_Node000009_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.47,-89.99C106.96,-92.53 109.47,-95.37 111.5,-98.25 132.82,-128.46 118.78,-149.96 147.5,-173.25 158.9,-182.49 174.13,-187.35 188.09,-189.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.52,-193.31 197.91,-191.25 188.5,-186.38 187.52,-193.31"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node4 -->
-<g id="edge16_Node000009_Node000004" class="edge">
-<title>Node9&#45;&gt;Node4</title>
-<g id="a_edge16_Node000009_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.51,-90.28C113.72,-100.14 130.52,-115.02 147.5,-124.25 150.74,-126.01 154.13,-127.68 157.6,-129.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.22,-132.45 166.8,-133.06 158.9,-125.99 156.22,-132.45"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge18_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge18_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.94,-80.53C122.48,-80.69 136.49,-80.9 151.06,-81.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.7,-84.62 160.75,-81.27 150.81,-77.62 150.7,-84.62"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node6 -->
-<g id="edge19_Node000009_Node000006" class="edge">
-<title>Node9&#45;&gt;Node6</title>
-<g id="a_edge19_Node000009_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.94,-71.21C130.3,-62.16 159.2,-47.9 183.23,-36.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.76,-39.19 192.18,-31.63 181.66,-32.91 184.76,-39.19"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index edea096de..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,267 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="465pt" height="210pt"
- viewBox="0.00 0.00 465.00 209.88" 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 205.88)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-144.88 0,-144.88 0,-125.62 37.75,-125.62 37.75,-144.88"/>
-<text text-anchor="middle" x="18.88" y="-131.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.12,-201.88 199.62,-201.88 199.62,-182.62 253.12,-182.62 253.12,-201.88"/>
-<text text-anchor="middle" x="226.38" y="-188.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.49,-145.16C40.74,-154.1 57.1,-166.8 73.75,-173.25 110.82,-187.61 156.45,-191.67 187.91,-192.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.65,-196.06 197.72,-192.74 187.78,-189.06 187.65,-196.06"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title="1st test&#45;case">
-<polygon fill="white" stroke="#666666" points="111.5,-163.88 73.75,-163.88 73.75,-144.62 111.5,-144.62 111.5,-163.88"/>
-<text text-anchor="middle" x="92.62" y="-150.38" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.98,-140.04C45.32,-141.99 53.98,-144.28 62.18,-146.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.25,-149.83 71.81,-149 63.04,-143.06 61.25,-149.83"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title="2nd test&#45;case">
-<polygon fill="white" stroke="#666666" points="111.5,-126.88 73.75,-126.88 73.75,-107.62 111.5,-107.62 111.5,-126.88"/>
-<text text-anchor="middle" x="92.62" y="-113.38" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge10_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge10_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.98,-130.71C45.32,-128.87 53.98,-126.69 62.18,-124.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.96,-128.05 71.81,-122.22 61.26,-121.26 62.96,-128.05"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" target="_top" xlink:title="3rd test&#45;case">
-<polygon fill="white" stroke="#666666" points="111.5,-89.88 73.75,-89.88 73.75,-70.62 111.5,-70.62 111.5,-89.88"/>
-<text text-anchor="middle" x="92.62" y="-76.38" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge15_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge15_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.04,-125.16C43.25,-117.33 57.64,-106.3 69.6,-97.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.54,-100.06 77.35,-91.19 67.28,-94.5 71.54,-100.06"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge4_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge4_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.93,-161.22C122.28,-165.03 135.52,-169.69 147.5,-173.25 160.71,-177.18 175.34,-180.91 188.33,-184.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.23,-187.35 197.77,-186.22 188.83,-180.53 187.23,-187.35"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
-<polygon fill="white" stroke="#666666" points="305.25,-164.5 147.5,-164.5 147.5,-134 305.25,-134 305.25,-164.5"/>
-<text text-anchor="start" x="155.5" y="-151" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="226.38" y="-139.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.94,-153.55C118.78,-153.3 127.08,-152.98 136.05,-152.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.89,-156.15 145.75,-152.27 135.62,-149.15 135.89,-156.15"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
-<polygon fill="white" stroke="#666666" points="290.25,-97.5 162.5,-97.5 162.5,-67 290.25,-67 290.25,-97.5"/>
-<text text-anchor="start" x="170.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="226.38" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge5_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge5_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.94,-144.24C131.21,-133.71 162.09,-116.83 186.77,-103.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.15,-106.58 195.25,-98.72 184.79,-100.44 188.15,-106.58"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
-<polygon fill="white" stroke="#666666" points="287.62,-30.5 165.12,-30.5 165.12,0 287.62,0 287.62,-30.5"/>
-<text text-anchor="start" x="173.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="226.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge7_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge7_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.88,-144.14C107.24,-141.7 109.59,-139 111.5,-136.25 133.28,-104.89 121.49,-86.2 147.5,-58.25 155.55,-49.6 165.75,-42.27 176.09,-36.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.53,-39.46 184.65,-31.61 174.2,-33.3 177.53,-39.46"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.67,-97.99C197.84,-107.06 205.74,-115.5 226.38,-115.5 237.66,-115.5 245.14,-112.97 248.81,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="252.26,-109.82 249.91,-99.49 245.3,-109.03 252.26,-109.82"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge8_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge8_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M202.67,-30.99C197.84,-40.06 205.74,-48.5 226.38,-48.5 237.66,-48.5 245.14,-45.97 248.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="252.26,-42.82 249.91,-32.49 245.3,-42.03 252.26,-42.82"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="457,-24.88 341.25,-24.88 341.25,-5.63 457,-5.63 457,-24.88"/>
-<text text-anchor="middle" x="399.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge9_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge9_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M288.06,-15.25C301.46,-15.25 315.75,-15.25 329.45,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.27,-18.75 339.27,-15.25 329.27,-11.75 329.27,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node2 -->
-<g id="edge12_Node000008_Node000002" class="edge">
-<title>Node8&#45;&gt;Node2</title>
-<g id="a_edge12_Node000008_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.5,-127.11C106.11,-129.74 108.92,-132.59 111.5,-135.25 127.7,-151.95 127.38,-161.57 147.5,-173.25 159.91,-180.45 174.96,-184.94 188.51,-187.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.49,-191.1 197.96,-189.42 188.73,-184.21 187.49,-191.1"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge11_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge11_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.94,-121.7C122.2,-124.19 135.75,-127.48 149.9,-130.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.78,-134.25 159.32,-133.21 150.43,-127.44 148.78,-134.25"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node5 -->
-<g id="edge13_Node000008_Node000005" class="edge">
-<title>Node8&#45;&gt;Node5</title>
-<g id="a_edge13_Node000008_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.94,-112.38C123.43,-109.33 139.06,-105.18 155.03,-100.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.87,-104.34 164.64,-98.39 154.07,-97.57 155.87,-104.34"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge14_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge14_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.57,-107.45C106.18,-104.82 108.97,-101.95 111.5,-99.25 128.05,-81.53 128.6,-73.45 147.5,-58.25 157.74,-50.01 169.77,-42.5 181.28,-36.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.68,-39.37 189.86,-31.58 179.39,-33.19 182.68,-39.37"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node2 -->
-<g id="edge17_Node000009_Node000002" class="edge">
-<title>Node9&#45;&gt;Node2</title>
-<g id="a_edge17_Node000009_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.47,-89.99C106.96,-92.53 109.47,-95.37 111.5,-98.25 132.82,-128.46 118.78,-149.96 147.5,-173.25 158.9,-182.49 174.13,-187.35 188.09,-189.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.52,-193.31 197.91,-191.25 188.5,-186.38 187.52,-193.31"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node4 -->
-<g id="edge16_Node000009_Node000004" class="edge">
-<title>Node9&#45;&gt;Node4</title>
-<g id="a_edge16_Node000009_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.51,-90.28C113.72,-100.14 130.52,-115.02 147.5,-124.25 150.74,-126.01 154.13,-127.68 157.6,-129.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.22,-132.45 166.8,-133.06 158.9,-125.99 156.22,-132.45"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge18_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge18_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.94,-80.53C122.48,-80.69 136.49,-80.9 151.06,-81.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.7,-84.62 160.75,-81.27 150.81,-77.62 150.7,-84.62"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node6 -->
-<g id="edge19_Node000009_Node000006" class="edge">
-<title>Node9&#45;&gt;Node6</title>
-<g id="a_edge19_Node000009_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.94,-71.21C130.3,-62.16 159.2,-47.9 183.23,-36.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.76,-39.19 192.18,-31.63 181.66,-32.91 184.76,-39.19"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map b/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
deleted file mode 100644
index ec28e293e..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="test3" name="test3">
-<area shape="rect" id="Node000001" title="3rd test&#45;case" alt="" coords="5,112,56,137"/>
-<area shape="rect" id="Node000002" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" title="will allocate the memory for a node and, along the data and return the node." alt="" coords="104,5,314,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="41,109,67,82,102,55,111,50,114,55,105,60,71,86,45,113"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="173,70,244,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,116,158,92,159,97,57,121"/>
-<area shape="rect" id="Node000004" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" title="postorder function that will perform the postorder traversal recursively, and return the result vecto..." alt="" coords="124,144,294,185"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="57,127,109,139,108,144,56,132"/>
-<area shape="rect" id="Node000005" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" title="preorder function that will perform the preorder traversal recursively, and return the resultant vect..." alt="" coords="127,233,290,274"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="45,136,71,164,105,194,151,223,149,228,102,198,68,168,41,139"/>
-<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="175,144,173,134,179,125,191,119,209,117,228,120,240,126,237,131,227,125,209,123,192,125,182,129,178,135,180,143"/>
-<area shape="poly" id="edge6_Node000005_Node000005" title=" " alt="" coords="175,233,173,223,179,214,191,209,209,207,228,209,240,215,237,220,227,214,209,212,192,214,182,218,178,224,180,232"/>
-<area shape="rect" id="Node000006" 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="362,241,516,266"/>
-<area shape="poly" id="edge7_Node000005_Node000006" title=" " alt="" coords="291,251,346,251,346,256,291,256"/>
-</map>
diff --git a/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 b/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
deleted file mode 100644
index 0b62cf031..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-17089c21be1c8ab9e9937872bbc0da11
\ No newline at end of file
diff --git a/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg b/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
deleted file mode 100644
index a483eac39..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
+++ /dev/null
@@ -1,158 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<svg width="391pt" height="210pt"
- viewBox="0.00 0.00 391.25 209.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 205.5)">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="3rd test&#45;case">
-<polygon fill="#999999" stroke="#666666" points="37.75,-121.88 0,-121.88 0,-102.62 37.75,-102.62 37.75,-121.88"/>
-<text text-anchor="middle" x="18.88" y="-108.38" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
-<polygon fill="white" stroke="#666666" points="231.5,-201.5 73.75,-201.5 73.75,-171 231.5,-171 231.5,-201.5"/>
-<text text-anchor="start" x="81.75" y="-188" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="152.62" y="-176.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.01,-122.11C37.78,-133.35 55.18,-151.53 73.75,-162.25 75.94,-163.51 78.2,-164.72 80.52,-165.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.01,-169.03 89.57,-169.92 81.87,-162.64 79.01,-169.03"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="179.38,-152.88 125.88,-152.88 125.88,-133.62 179.38,-133.62 179.38,-152.88"/>
-<text text-anchor="middle" x="152.62" y="-139.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-116.56C57.94,-121.21 89.88,-128.72 114.85,-134.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="113.75,-137.93 124.29,-136.82 115.36,-131.12 113.75,-137.93"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
-<polygon fill="white" stroke="#666666" points="216.5,-97.5 88.75,-97.5 88.75,-67 216.5,-67 216.5,-97.5"/>
-<text text-anchor="start" x="96.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="152.62" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-108.08C48.73,-105.68 62.74,-102.49 77.31,-99.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.07,-102.59 87.04,-96.96 76.51,-95.76 78.07,-102.59"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
-<polygon fill="white" stroke="#666666" points="213.88,-30.5 91.38,-30.5 91.38,0 213.88,0 213.88,-30.5"/>
-<text text-anchor="start" x="99.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="152.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.3,-102.24C38.33,-90.71 55.98,-71.63 73.75,-58.25 84.44,-50.2 96.81,-42.68 108.5,-36.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.03,-39.39 117.2,-31.59 106.73,-33.22 110.03,-39.39"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.92,-97.99C124.09,-107.06 131.99,-115.5 152.62,-115.5 163.91,-115.5 171.39,-112.97 175.06,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.51,-109.82 176.16,-99.49 171.55,-109.03 178.51,-109.82"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.92,-30.99C124.09,-40.06 131.99,-48.5 152.62,-48.5 163.91,-48.5 171.39,-45.97 175.06,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.51,-42.82 176.16,-32.49 171.55,-42.03 178.51,-42.82"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-24.88 267.5,-24.88 267.5,-5.63 383.25,-5.63 383.25,-24.88"/>
-<text text-anchor="middle" x="325.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge7_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge7_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.31,-15.25C227.71,-15.25 242,-15.25 255.7,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="255.52,-18.75 265.52,-15.25 255.52,-11.75 255.52,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg b/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
deleted file mode 100644
index 1d734eed9..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg
+++ /dev/null
@@ -1,132 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<svg width="391pt" height="210pt"
- viewBox="0.00 0.00 391.25 209.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 205.5)">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="3rd test&#45;case">
-<polygon fill="#999999" stroke="#666666" points="37.75,-121.88 0,-121.88 0,-102.62 37.75,-102.62 37.75,-121.88"/>
-<text text-anchor="middle" x="18.88" y="-108.38" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
-<polygon fill="white" stroke="#666666" points="231.5,-201.5 73.75,-201.5 73.75,-171 231.5,-171 231.5,-201.5"/>
-<text text-anchor="start" x="81.75" y="-188" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="152.62" y="-176.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.01,-122.11C37.78,-133.35 55.18,-151.53 73.75,-162.25 75.94,-163.51 78.2,-164.72 80.52,-165.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.01,-169.03 89.57,-169.92 81.87,-162.64 79.01,-169.03"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="179.38,-152.88 125.88,-152.88 125.88,-133.62 179.38,-133.62 179.38,-152.88"/>
-<text text-anchor="middle" x="152.62" y="-139.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-116.56C57.94,-121.21 89.88,-128.72 114.85,-134.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="113.75,-137.93 124.29,-136.82 115.36,-131.12 113.75,-137.93"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
-<polygon fill="white" stroke="#666666" points="216.5,-97.5 88.75,-97.5 88.75,-67 216.5,-67 216.5,-97.5"/>
-<text text-anchor="start" x="96.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="152.62" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-108.08C48.73,-105.68 62.74,-102.49 77.31,-99.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.07,-102.59 87.04,-96.96 76.51,-95.76 78.07,-102.59"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
-<polygon fill="white" stroke="#666666" points="213.88,-30.5 91.38,-30.5 91.38,0 213.88,0 213.88,-30.5"/>
-<text text-anchor="start" x="99.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="152.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.3,-102.24C38.33,-90.71 55.98,-71.63 73.75,-58.25 84.44,-50.2 96.81,-42.68 108.5,-36.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.03,-39.39 117.2,-31.59 106.73,-33.22 110.03,-39.39"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.92,-97.99C124.09,-107.06 131.99,-115.5 152.62,-115.5 163.91,-115.5 171.39,-112.97 175.06,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.51,-109.82 176.16,-99.49 171.55,-109.03 178.51,-109.82"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.92,-30.99C124.09,-40.06 131.99,-48.5 152.62,-48.5 163.91,-48.5 171.39,-45.97 175.06,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.51,-42.82 176.16,-32.49 171.55,-42.03 178.51,-42.82"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="383.25,-24.88 267.5,-24.88 267.5,-5.63 383.25,-5.63 383.25,-24.88"/>
-<text text-anchor="middle" x="325.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge7_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge7_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.31,-15.25C227.71,-15.25 242,-15.25 255.7,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="255.52,-18.75 265.52,-15.25 255.52,-11.75 255.52,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 5b53668a4..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,32 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,81,55,107"/>
-<area shape="rect" id="Node000002" href="$dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,81,153,107"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,92,88,92,88,97,55,97"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="369,5,440,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="142,79,167,59,200,41,239,29,280,21,353,15,353,20,280,27,240,34,202,46,170,63,145,83"/>
-<area shape="rect" id="Node000004" href="$dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" title="1st test&#45;case" alt="" coords="201,56,251,82"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="153,85,185,77,186,82,154,90"/>
-<area shape="rect" id="Node000009" href="$dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0" title="2nd test&#45;case" alt="" coords="201,105,251,131"/>
-<area shape="poly" id="edge11_Node000002_Node000009" title=" " alt="" coords="154,98,186,106,185,111,153,103"/>
-<area shape="rect" id="Node000010" href="$dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" title="3rd test&#45;case" alt="" coords="201,155,251,180"/>
-<area shape="poly" id="edge16_Node000002_Node000010" title=" " alt="" coords="148,106,197,143,194,147,145,110"/>
-<area shape="poly" id="edge5_Node000004_Node000003" title=" " alt="" coords="251,57,299,41,353,27,354,32,300,46,253,62"/>
-<area shape="rect" id="Node000005" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" title="will allocate the memory for a node and, along the data and return the node." alt="" coords="299,55,510,96"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="252,67,284,68,284,74,252,72"/>
-<area shape="rect" id="Node000006" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" title="postorder function that will perform the postorder traversal recursively, and return the result vecto..." alt="" coords="319,144,490,185"/>
-<area shape="poly" id="edge6_Node000004_Node000006" title=" " alt="" coords="253,80,353,134,350,139,251,85"/>
-<area shape="rect" id="Node000007" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" title="preorder function that will perform the preorder traversal recursively, and return the resultant vect..." alt="" coords="323,234,486,274"/>
-<area shape="poly" id="edge8_Node000004_Node000007" title=" " alt="" coords="245,81,254,91,269,121,276,146,284,170,301,195,339,224,336,228,297,199,279,172,271,147,264,122,249,94,240,84"/>
-<area shape="poly" id="edge7_Node000006_Node000006" title=" " alt="" coords="370,144,369,135,374,126,386,120,405,118,424,120,436,127,433,131,422,125,404,123,388,125,378,130,374,136,376,143"/>
-<area shape="poly" id="edge9_Node000007_Node000007" title=" " alt="" coords="370,234,369,224,374,215,386,209,405,207,424,210,436,216,433,221,422,215,404,212,388,214,378,219,374,225,376,233"/>
-<area shape="rect" id="Node000008" 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="558,241,712,267"/>
-<area shape="poly" id="edge10_Node000007_Node000008" title=" " alt="" coords="487,252,542,252,542,257,487,257"/>
-<area shape="poly" id="edge13_Node000009_Node000003" title=" " alt="" coords="239,103,249,92,271,65,282,53,298,41,325,29,353,22,355,27,327,34,301,46,285,57,275,68,253,96,243,107"/>
-<area shape="poly" id="edge12_Node000009_Node000005" title=" " alt="" coords="251,110,302,97,303,103,253,115"/>
-<area shape="poly" id="edge14_Node000009_Node000006" title=" " alt="" coords="253,122,310,137,309,142,251,127"/>
-<area shape="poly" id="edge15_Node000009_Node000007" title=" " alt="" coords="243,129,253,140,276,169,301,195,346,224,343,229,298,199,272,173,249,144,239,133"/>
-<area shape="poly" id="edge18_Node000010_Node000003" title=" " alt="" coords="240,153,249,142,263,114,269,89,277,65,298,41,324,27,353,19,354,24,326,32,301,46,282,68,274,91,268,116,254,145,244,156"/>
-<area shape="poly" id="edge17_Node000010_Node000005" title=" " alt="" coords="239,152,265,129,298,107,312,100,314,105,301,111,268,133,242,156"/>
-<area shape="poly" id="edge19_Node000010_Node000006" title=" " alt="" coords="252,164,304,164,304,169,252,170"/>
-<area shape="poly" id="edge20_Node000010_Node000007" title=" " alt="" coords="253,177,348,224,346,229,251,182"/>
-</map>
diff --git a/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 90514afb1..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6eae5e53b0353c094f1a38ef294ecd52
\ No newline at end of file
diff --git a/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 44bed1e55..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,368 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 210 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 538;
-var viewHeight = 210;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-144.88 0,-144.88 0,-125.62 37,-125.62 37,-144.88"/>
-<text text-anchor="middle" x="18.5" y="-131.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-144.88 73,-144.88 73,-125.62 110.75,-125.62 110.75,-144.88"/>
-<text text-anchor="middle" x="91.88" y="-131.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-135.25C44.55,-135.25 53.37,-135.25 61.69,-135.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-138.75 71.43,-135.25 61.43,-131.75 61.43,-138.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="326.12,-201.88 272.62,-201.88 272.62,-182.62 326.12,-182.62 326.12,-201.88"/>
-<text text-anchor="middle" x="299.38" y="-188.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.49,-145.16C113.74,-154.1 130.1,-166.8 146.75,-173.25 183.82,-187.61 229.45,-191.67 260.91,-192.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.65,-196.06 270.72,-192.74 260.78,-189.06 260.65,-196.06"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title="1st test&#45;case">
-<polygon fill="white" stroke="#666666" points="184.5,-163.88 146.75,-163.88 146.75,-144.62 184.5,-144.62 184.5,-163.88"/>
-<text text-anchor="middle" x="165.62" y="-150.38" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.98,-140.04C118.32,-141.99 126.98,-144.28 135.18,-146.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.25,-149.83 144.81,-149 136.04,-143.06 134.25,-149.83"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title="2nd test&#45;case">
-<polygon fill="white" stroke="#666666" points="184.5,-126.88 146.75,-126.88 146.75,-107.62 184.5,-107.62 184.5,-126.88"/>
-<text text-anchor="middle" x="165.62" y="-113.38" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge11_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge11_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.98,-130.71C118.32,-128.87 126.98,-126.69 135.18,-124.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.96,-128.05 144.81,-122.22 134.26,-121.26 135.96,-128.05"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" target="_top" xlink:title="3rd test&#45;case">
-<polygon fill="white" stroke="#666666" points="184.5,-89.88 146.75,-89.88 146.75,-70.62 184.5,-70.62 184.5,-89.88"/>
-<text text-anchor="middle" x="165.62" y="-76.38" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge16_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge16_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.04,-125.16C116.25,-117.33 130.64,-106.3 142.6,-97.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.54,-100.06 150.35,-91.19 140.28,-94.5 144.54,-100.06"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.93,-161.22C195.28,-165.03 208.52,-169.69 220.5,-173.25 233.71,-177.18 248.34,-180.91 261.33,-184.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.23,-187.35 270.77,-186.22 261.83,-180.53 260.23,-187.35"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
-<polygon fill="white" stroke="#666666" points="378.25,-164.5 220.5,-164.5 220.5,-134 378.25,-134 378.25,-164.5"/>
-<text text-anchor="start" x="228.5" y="-151" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="299.38" y="-139.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.94,-153.55C191.78,-153.3 200.08,-152.98 209.05,-152.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.89,-156.15 218.75,-152.27 208.62,-149.15 208.89,-156.15"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
-<polygon fill="white" stroke="#666666" points="363.25,-97.5 235.5,-97.5 235.5,-67 363.25,-67 363.25,-97.5"/>
-<text text-anchor="start" x="243.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="299.38" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge6_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge6_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.94,-144.24C204.21,-133.71 235.09,-116.83 259.77,-103.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.15,-106.58 268.25,-98.72 257.79,-100.44 261.15,-106.58"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
-<polygon fill="white" stroke="#666666" points="360.62,-30.5 238.12,-30.5 238.12,0 360.62,0 360.62,-30.5"/>
-<text text-anchor="start" x="246.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="299.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge8_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge8_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.88,-144.14C180.24,-141.7 182.59,-139 184.5,-136.25 206.28,-104.89 194.49,-86.2 220.5,-58.25 228.55,-49.6 238.75,-42.27 249.09,-36.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="250.53,-39.46 257.65,-31.61 247.2,-33.3 250.53,-39.46"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge7_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge7_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.67,-97.99C270.84,-107.06 278.74,-115.5 299.38,-115.5 310.66,-115.5 318.14,-112.97 321.81,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.26,-109.82 322.91,-99.49 318.3,-109.03 325.26,-109.82"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge9_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge9_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.67,-30.99C270.84,-40.06 278.74,-48.5 299.38,-48.5 310.66,-48.5 318.14,-45.97 321.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.26,-42.82 322.91,-32.49 318.3,-42.03 325.26,-42.82"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="530,-24.88 414.25,-24.88 414.25,-5.63 530,-5.63 530,-24.88"/>
-<text text-anchor="middle" x="472.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge10_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge10_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M361.06,-15.25C374.46,-15.25 388.75,-15.25 402.45,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="402.27,-18.75 412.27,-15.25 402.27,-11.75 402.27,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge13_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge13_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.5,-127.11C179.11,-129.74 181.92,-132.59 184.5,-135.25 200.7,-151.95 200.38,-161.57 220.5,-173.25 232.91,-180.45 247.96,-184.94 261.51,-187.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.49,-191.1 270.96,-189.42 261.73,-184.21 260.49,-191.1"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge12_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge12_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.94,-121.7C195.2,-124.19 208.75,-127.48 222.9,-130.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.78,-134.25 232.32,-133.21 223.43,-127.44 221.78,-134.25"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node6 -->
-<g id="edge14_Node000009_Node000006" class="edge">
-<title>Node9&#45;&gt;Node6</title>
-<g id="a_edge14_Node000009_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.94,-112.38C196.43,-109.33 212.06,-105.18 228.03,-100.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.87,-104.34 237.64,-98.39 227.07,-97.57 228.87,-104.34"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge15_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge15_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.57,-107.45C179.18,-104.82 181.97,-101.95 184.5,-99.25 201.05,-81.53 201.6,-73.45 220.5,-58.25 230.74,-50.01 242.77,-42.5 254.28,-36.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="255.68,-39.37 262.86,-31.58 252.39,-33.19 255.68,-39.37"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node3 -->
-<g id="edge18_Node000010_Node000003" class="edge">
-<title>Node10&#45;&gt;Node3</title>
-<g id="a_edge18_Node000010_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.47,-89.99C179.96,-92.53 182.47,-95.37 184.5,-98.25 205.82,-128.46 191.78,-149.96 220.5,-173.25 231.9,-182.49 247.13,-187.35 261.09,-189.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.52,-193.31 270.91,-191.25 261.5,-186.38 260.52,-193.31"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node5 -->
-<g id="edge17_Node000010_Node000005" class="edge">
-<title>Node10&#45;&gt;Node5</title>
-<g id="a_edge17_Node000010_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.51,-90.28C186.72,-100.14 203.52,-115.02 220.5,-124.25 223.74,-126.01 227.13,-127.68 230.6,-129.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.22,-132.45 239.8,-133.06 231.9,-125.99 229.22,-132.45"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node6 -->
-<g id="edge19_Node000010_Node000006" class="edge">
-<title>Node10&#45;&gt;Node6</title>
-<g id="a_edge19_Node000010_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.94,-80.53C195.48,-80.69 209.49,-80.9 224.06,-81.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="223.7,-84.62 233.75,-81.27 223.81,-77.62 223.7,-84.62"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node7 -->
-<g id="edge20_Node000010_Node000007" class="edge">
-<title>Node10&#45;&gt;Node7</title>
-<g id="a_edge20_Node000010_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.94,-71.21C203.3,-62.16 232.2,-47.9 256.23,-36.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.76,-39.19 265.18,-31.63 254.66,-32.91 257.76,-39.19"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 2ce44cace..000000000
--- a/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,285 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="538pt" height="210pt"
- viewBox="0.00 0.00 538.00 209.88" 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 205.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-144.88 0,-144.88 0,-125.62 37,-125.62 37,-144.88"/>
-<text text-anchor="middle" x="18.5" y="-131.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-144.88 73,-144.88 73,-125.62 110.75,-125.62 110.75,-144.88"/>
-<text text-anchor="middle" x="91.88" y="-131.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-135.25C44.55,-135.25 53.37,-135.25 61.69,-135.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-138.75 71.43,-135.25 61.43,-131.75 61.43,-138.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="326.12,-201.88 272.62,-201.88 272.62,-182.62 326.12,-182.62 326.12,-201.88"/>
-<text text-anchor="middle" x="299.38" y="-188.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.49,-145.16C113.74,-154.1 130.1,-166.8 146.75,-173.25 183.82,-187.61 229.45,-191.67 260.91,-192.56"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.65,-196.06 270.72,-192.74 260.78,-189.06 260.65,-196.06"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title="1st test&#45;case">
-<polygon fill="white" stroke="#666666" points="184.5,-163.88 146.75,-163.88 146.75,-144.62 184.5,-144.62 184.5,-163.88"/>
-<text text-anchor="middle" x="165.62" y="-150.38" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.98,-140.04C118.32,-141.99 126.98,-144.28 135.18,-146.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.25,-149.83 144.81,-149 136.04,-143.06 134.25,-149.83"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title="2nd test&#45;case">
-<polygon fill="white" stroke="#666666" points="184.5,-126.88 146.75,-126.88 146.75,-107.62 184.5,-107.62 184.5,-126.88"/>
-<text text-anchor="middle" x="165.62" y="-113.38" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge11_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge11_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.98,-130.71C118.32,-128.87 126.98,-126.69 135.18,-124.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.96,-128.05 144.81,-122.22 134.26,-121.26 135.96,-128.05"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e" target="_top" xlink:title="3rd test&#45;case">
-<polygon fill="white" stroke="#666666" points="184.5,-89.88 146.75,-89.88 146.75,-70.62 184.5,-70.62 184.5,-89.88"/>
-<text text-anchor="middle" x="165.62" y="-76.38" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge16_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge16_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.04,-125.16C116.25,-117.33 130.64,-106.3 142.6,-97.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.54,-100.06 150.35,-91.19 140.28,-94.5 144.54,-100.06"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.93,-161.22C195.28,-165.03 208.52,-169.69 220.5,-173.25 233.71,-177.18 248.34,-180.91 261.33,-184.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.23,-187.35 270.77,-186.22 261.83,-180.53 260.23,-187.35"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114" target="_top" xlink:title="will allocate the memory for a node and, along the data and return the node.">
-<polygon fill="white" stroke="#666666" points="378.25,-164.5 220.5,-164.5 220.5,-134 378.25,-134 378.25,-164.5"/>
-<text text-anchor="start" x="228.5" y="-151" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="299.38" y="-139.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::createNewNode</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.94,-153.55C191.78,-153.3 200.08,-152.98 209.05,-152.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.89,-156.15 218.75,-152.27 208.62,-149.15 208.89,-156.15"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c" target="_top" xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
-<polygon fill="white" stroke="#666666" points="363.25,-97.5 235.5,-97.5 235.5,-67 363.25,-67 363.25,-97.5"/>
-<text text-anchor="start" x="243.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="299.38" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge6_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge6_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.94,-144.24C204.21,-133.71 235.09,-116.83 259.77,-103.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.15,-106.58 268.25,-98.72 257.79,-100.44 261.15,-106.58"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5" target="_top" xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
-<polygon fill="white" stroke="#666666" points="360.62,-30.5 238.12,-30.5 238.12,0 360.62,0 360.62,-30.5"/>
-<text text-anchor="start" x="246.12" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="299.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge8_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge8_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.88,-144.14C180.24,-141.7 182.59,-139 184.5,-136.25 206.28,-104.89 194.49,-86.2 220.5,-58.25 228.55,-49.6 238.75,-42.27 249.09,-36.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="250.53,-39.46 257.65,-31.61 247.2,-33.3 250.53,-39.46"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge7_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge7_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.67,-97.99C270.84,-107.06 278.74,-115.5 299.38,-115.5 310.66,-115.5 318.14,-112.97 321.81,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.26,-109.82 322.91,-99.49 318.3,-109.03 325.26,-109.82"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge9_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge9_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M275.67,-30.99C270.84,-40.06 278.74,-48.5 299.38,-48.5 310.66,-48.5 318.14,-45.97 321.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.26,-42.82 322.91,-32.49 318.3,-42.03 325.26,-42.82"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="530,-24.88 414.25,-24.88 414.25,-5.63 530,-5.63 530,-24.88"/>
-<text text-anchor="middle" x="472.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge10_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge10_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M361.06,-15.25C374.46,-15.25 388.75,-15.25 402.45,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="402.27,-18.75 412.27,-15.25 402.27,-11.75 402.27,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node3 -->
-<g id="edge13_Node000009_Node000003" class="edge">
-<title>Node9&#45;&gt;Node3</title>
-<g id="a_edge13_Node000009_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.5,-127.11C179.11,-129.74 181.92,-132.59 184.5,-135.25 200.7,-151.95 200.38,-161.57 220.5,-173.25 232.91,-180.45 247.96,-184.94 261.51,-187.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.49,-191.1 270.96,-189.42 261.73,-184.21 260.49,-191.1"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge12_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge12_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.94,-121.7C195.2,-124.19 208.75,-127.48 222.9,-130.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.78,-134.25 232.32,-133.21 223.43,-127.44 221.78,-134.25"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node6 -->
-<g id="edge14_Node000009_Node000006" class="edge">
-<title>Node9&#45;&gt;Node6</title>
-<g id="a_edge14_Node000009_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.94,-112.38C196.43,-109.33 212.06,-105.18 228.03,-100.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.87,-104.34 237.64,-98.39 227.07,-97.57 228.87,-104.34"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node7 -->
-<g id="edge15_Node000009_Node000007" class="edge">
-<title>Node9&#45;&gt;Node7</title>
-<g id="a_edge15_Node000009_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.57,-107.45C179.18,-104.82 181.97,-101.95 184.5,-99.25 201.05,-81.53 201.6,-73.45 220.5,-58.25 230.74,-50.01 242.77,-42.5 254.28,-36.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="255.68,-39.37 262.86,-31.58 252.39,-33.19 255.68,-39.37"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node3 -->
-<g id="edge18_Node000010_Node000003" class="edge">
-<title>Node10&#45;&gt;Node3</title>
-<g id="a_edge18_Node000010_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.47,-89.99C179.96,-92.53 182.47,-95.37 184.5,-98.25 205.82,-128.46 191.78,-149.96 220.5,-173.25 231.9,-182.49 247.13,-187.35 261.09,-189.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.52,-193.31 270.91,-191.25 261.5,-186.38 260.52,-193.31"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node5 -->
-<g id="edge17_Node000010_Node000005" class="edge">
-<title>Node10&#45;&gt;Node5</title>
-<g id="a_edge17_Node000010_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.51,-90.28C186.72,-100.14 203.52,-115.02 220.5,-124.25 223.74,-126.01 227.13,-127.68 230.6,-129.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="229.22,-132.45 239.8,-133.06 231.9,-125.99 229.22,-132.45"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node6 -->
-<g id="edge19_Node000010_Node000006" class="edge">
-<title>Node10&#45;&gt;Node6</title>
-<g id="a_edge19_Node000010_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.94,-80.53C195.48,-80.69 209.49,-80.9 224.06,-81.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="223.7,-84.62 233.75,-81.27 223.81,-77.62 223.7,-84.62"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node7 -->
-<g id="edge20_Node000010_Node000007" class="edge">
-<title>Node10&#45;&gt;Node7</title>
-<g id="a_edge20_Node000010_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.94,-71.21C203.3,-62.16 232.2,-47.9 256.23,-36.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.76,-39.19 265.18,-31.63 254.66,-32.91 257.76,-39.19"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/de1/recursive__tree__traversal_8cpp_source.html b/dc/de1/recursive__tree__traversal_8cpp_source.html
new file mode 100644
index 000000000..e0d11ac55
--- /dev/null
+++ b/dc/de1/recursive__tree__traversal_8cpp_source.html
@@ -0,0 +1,453 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/recursive_tree_traversal.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dc/de1/recursive__tree__traversal_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">recursive_tree_traversal.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dc/de1/recursive__tree__traversal_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="preprocessor">#include &lt;cstdint&gt;</span>   </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/d6f/namespaceothers.html">others</a> {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="keyword">namespace </span>recursive_tree_traversals {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="foldopen" id="foldopen00079" data-start="{" data-end="};">
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">   79</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade">   80</a></span>    std::uint64_t <a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade">data</a> = 0;  </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">   81</a></span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *left{};     </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">   82</a></span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *<a class="code hl_variable" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a>{};    </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>};</div>
+</div>
+<div class="foldopen" id="foldopen00088" data-start="{" data-end="};">
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"><a class="line" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">   88</a></span><span class="keyword">class </span><a class="code hl_class" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">BT</a> {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        inorder_result;  <span class="comment">// vector to store the inorder traversal of the tree.</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        preorder_result;  <span class="comment">// vector to store the preorder traversal of the tree.</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        postorder_result;  <span class="comment">// vector to store the preorder</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>                           <span class="comment">// traversal of the tree.</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        std::uint64_t);  <span class="comment">// function that will create new node for insertion.</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    std::vector&lt;std::uint64_t&gt; inorder(</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *);  <span class="comment">// function that takes root of the tree as an argument and</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>                  <span class="comment">// returns its inorder traversal.</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::vector&lt;std::uint64_t&gt; <a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">preorder</a>(</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *);  <span class="comment">// function that takes root of the tree as an argument and</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>                  <span class="comment">// returns its preorder traversal.</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    std::vector&lt;std::uint64_t&gt; <a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">postorder</a>(</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *);  <span class="comment">// function that takes root of the tree as an argument and</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>                  <span class="comment">// returns its postorder traversal.</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>};</div>
+</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="foldopen" id="foldopen00118" data-start="{" data-end="}">
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"><a class="line" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">  118</a></span><a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">BT::createNewNode</a>(std::uint64_t <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a>();</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;data = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="keywordflow">return</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>}</div>
+</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span><span class="comment"> * @brief inorder() function that will perform the inorder traversal</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span><span class="comment"> * recursively, and return the resultant vector that contain the inorder</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span><span class="comment"> * traversal of a tree.</span></div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span><span class="comment"> * @param root head/root node of a tree</span></div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span><span class="comment"> * @return result that is containing the inorder traversal of a tree</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span><span class="comment"> **/</span></div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>std::vector&lt;std::uint64_t&gt; BT::inorder(<a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *root) {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {  <span class="comment">// return if the current node is empty</span></div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>        <span class="keywordflow">return</span> {};</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    }</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span> </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    inorder(root-&gt;left);  <span class="comment">// Traverse the left subtree</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    BT::inorder_result.push_back(</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>        root-&gt;data);  <span class="comment">// Display the data part of the root (or current node)</span></div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    inorder(root-&gt;right);  <span class="comment">// Traverse the right subtree</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    <span class="keywordflow">return</span> inorder_result;</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>}</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span> </div>
+<div class="foldopen" id="foldopen00152" data-start="{" data-end="}">
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"><a class="line" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">  152</a></span>std::vector&lt;std::uint64_t&gt; <a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">BT::preorder</a>(<a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *root) {</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {  <span class="comment">// if the current node is empty</span></div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        <span class="keywordflow">return</span> {};</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    }</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span> </div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    BT::preorder_result.push_back(</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>        root-&gt;data);  <span class="comment">// Display the data part of the root (or current node)</span></div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    <a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">preorder</a>(root-&gt;left);   <span class="comment">// Traverse the left subtree</span></div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    <a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">preorder</a>(root-&gt;right);  <span class="comment">// Traverse the right subtree</span></div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span> </div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    <span class="keywordflow">return</span> preorder_result;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>}</div>
+</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span> </div>
+<div class="foldopen" id="foldopen00172" data-start="{" data-end="}">
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"><a class="line" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">  172</a></span>std::vector&lt;std::uint64_t&gt; <a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">BT::postorder</a>(<a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *root) {</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {  <span class="comment">// if the current node is empty</span></div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        <span class="keywordflow">return</span> {};</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    }</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    <a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">postorder</a>(root-&gt;left);   <span class="comment">// Traverse the left subtree</span></div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    <a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">postorder</a>(root-&gt;right);  <span class="comment">// Traverse the right subtree</span></div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    BT::postorder_result.push_back(</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        root-&gt;data);  <span class="comment">// Display the data part of the root (or current node)</span></div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span> </div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    <span class="keywordflow">return</span> postorder_result;</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>}</div>
+</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span> </div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span><span class="keywordtype">void</span> deleteAll(<span class="keyword">const</span> <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *<span class="keyword">const</span> root) {</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    <span class="keywordflow">if</span> (root) {</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>        deleteAll(root-&gt;left);</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>        deleteAll(root-&gt;right);</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        <span class="keyword">delete</span> root;</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    }</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>}</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span> </div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>}  <span class="comment">// namespace recursive_tree_traversals</span></div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span> </div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>}  <span class="comment">// namespace others</span></div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span> </div>
+<div class="foldopen" id="foldopen00201" data-start="{" data-end="}">
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"><a class="line" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">  201</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>() {</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    <a class="code hl_class" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a> obj1;</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">others::recursive_tree_traversals::Node</a> *root = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(2);</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    root-&gt;left = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(7);</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    root-&gt;right = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(5);</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    root-&gt;left-&gt;left = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(2);</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    root-&gt;left-&gt;right = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(6);</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    root-&gt;right-&gt;right = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(9);</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    root-&gt;left-&gt;right-&gt;left = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(5);</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>    root-&gt;left-&gt;right-&gt;right = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(11);</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    root-&gt;right-&gt;right-&gt;left = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(4);</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span> </div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    std::vector&lt;std::uint64_t&gt; actual_result_inorder{2, 7, 5, 6, 11,</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>                                                     2, 5, 4, 9};</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    std::vector&lt;std::uint64_t&gt; actual_result_preorder{2,  7, 2, 6, 5,</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>                                                      11, 5, 9, 4};</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    std::vector&lt;std::uint64_t&gt; actual_result_postorder{2, 5, 11, 6, 7,</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>                                                       4, 9, 5,  2};</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>        result_inorder;  </div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>        result_preorder;  </div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>        result_postorder;  </div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span> </div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    std::uint64_t size = actual_result_inorder.size();</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span> </div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    <span class="comment">// Calling inorder() function by passing a root node,</span></div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    <span class="comment">// and storing the inorder traversal in result_inorder.</span></div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    result_inorder = obj1.inorder(root);</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #1: Inorder Traversal...&quot;</span>;</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>        assert(actual_result_inorder[i] == result_inorder[i]);</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    }</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span> </div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    <span class="comment">// Calling preorder() function by passing a root node,</span></div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    <span class="comment">// and storing the preorder traversal in result_preorder.</span></div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    result_preorder = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">preorder</a>(root);</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #1: Preorder Traversal...&quot;</span>;</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>        assert(actual_result_preorder[i] == result_preorder[i]);</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    }</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span> </div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    <span class="comment">// Calling postorder() function by passing a root node,</span></div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    <span class="comment">// and storing the postorder traversal in result_postorder.</span></div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    result_postorder = obj1.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">postorder</a>(root);</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #1: Postorder Traversal...&quot;</span>;</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>        assert(actual_result_postorder[i] == result_postorder[i]);</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>    }</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span> </div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>    deleteAll(root);</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>}</div>
+</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span> </div>
+<div class="foldopen" id="foldopen00266" data-start="{" data-end="}">
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"><a class="line" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0">  266</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>() {</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>    <a class="code hl_class" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a> obj2;</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>    <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">others::recursive_tree_traversals::Node</a> *root = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(1);</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>    root-&gt;left = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(2);</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    root-&gt;right = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(3);</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    root-&gt;left-&gt;left = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(4);</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    root-&gt;right-&gt;left = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(5);</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>    root-&gt;right-&gt;right = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(6);</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>    root-&gt;right-&gt;left-&gt;left = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(7);</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    root-&gt;right-&gt;left-&gt;right = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(8);</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span> </div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>    std::vector&lt;std::uint64_t&gt; actual_result_inorder{4, 2, 1, 7, 5, 8, 3, 6};</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>    std::vector&lt;std::uint64_t&gt; actual_result_preorder{1, 2, 4, 3, 5, 7, 8, 6};</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>    std::vector&lt;std::uint64_t&gt; actual_result_postorder{4, 2, 7, 8, 5, 6, 3, 1};</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>        result_inorder;  </div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>        result_preorder;  </div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>        result_postorder;  </div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span> </div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>    std::uint64_t size = actual_result_inorder.size();</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span> </div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>    <span class="comment">// Calling inorder() function by passing a root node,</span></div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>    <span class="comment">// and storing the inorder traversal in result_inorder.</span></div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>    result_inorder = obj2.inorder(root);</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #2: Inorder Traversal...&quot;</span>;</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>        assert(actual_result_inorder[i] == result_inorder[i]);</div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>    }</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span> </div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>    <span class="comment">// Calling preorder() function by passing a root node,</span></div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>    <span class="comment">// and storing the preorder traversal in result_preorder.</span></div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>    result_preorder = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">preorder</a>(root);</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #2: Preorder Traversal...&quot;</span>;</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>        assert(actual_result_preorder[i] == result_preorder[i]);</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>    }</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span> </div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>    <span class="comment">// Calling postorder() function by passing a root node,</span></div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>    <span class="comment">// and storing the postorder traversal in result_postorder.</span></div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>    result_postorder = obj2.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">postorder</a>(root);</div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #2: Postorder Traversal...&quot;</span>;</div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>        assert(actual_result_postorder[i] == result_postorder[i]);</div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>    }</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span> </div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>    deleteAll(root);</div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>}</div>
+</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span> </div>
+<div class="foldopen" id="foldopen00327" data-start="{" data-end="}">
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"><a class="line" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">  327</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a>() {</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>    <a class="code hl_class" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a> obj3;</div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>    <a class="code hl_struct" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">others::recursive_tree_traversals::Node</a> *root = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(1);</div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>    root-&gt;left = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(2);</div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>    root-&gt;right = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(3);</div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span>    root-&gt;left-&gt;left = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(4);</div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>    root-&gt;left-&gt;right = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a>(5);</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span> </div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>    std::vector&lt;std::uint64_t&gt; actual_result_inorder{4, 2, 5, 1, 3};</div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>    std::vector&lt;std::uint64_t&gt; actual_result_preorder{1, 2, 4, 5, 3};</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>    std::vector&lt;std::uint64_t&gt; actual_result_postorder{4, 5, 2, 3, 1};</div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>        result_inorder;  </div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span>        result_preorder;  </div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>    std::vector&lt;std::uint64_t&gt;</div>
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span>        result_postorder;  </div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span> </div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>    std::uint64_t size = actual_result_inorder.size();</div>
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span> </div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>    <span class="comment">// Calling inorder() function by passing a root node,</span></div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>    <span class="comment">// and storing the inorder traversal in result_inorder.</span></div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span> </div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>    result_inorder = obj3.inorder(root);</div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #3: Inorder Traversal...&quot;</span>;</div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>        assert(actual_result_inorder[i] == result_inorder[i]);</div>
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>    }</div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span> </div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span>    <span class="comment">// Calling preorder() function by passing a root node,</span></div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>    <span class="comment">// and storing the preorder traversal in result_preorder.</span></div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>    result_preorder = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">preorder</a>(root);</div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #3: Preorder Traversal...&quot;</span>;</div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>        assert(actual_result_preorder[i] == result_preorder[i]);</div>
+<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>    }</div>
+<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span> </div>
+<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>    <span class="comment">// Calling postorder() function by passing a root node,</span></div>
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>    <span class="comment">// and storing the postorder traversal in result_postorder.</span></div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>    result_postorder = obj3.<a class="code hl_function" href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">postorder</a>(root);</div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testcase #3: Postorder Traversal...&quot;</span>;</div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>        assert(actual_result_postorder[i] == result_postorder[i]);</div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>    }</div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span> </div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>    deleteAll(root);</div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>}</div>
+</div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span> </div>
+<div class="foldopen" id="foldopen00386" data-start="{" data-end="}">
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"><a class="line" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">  386</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test-case&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>    <a class="code hl_function" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();  <span class="comment">// run 1st test-case</span></div>
+<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test-case&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>    <a class="code hl_function" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>();  <span class="comment">// run 2nd test-case</span></div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test-case&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>    <a class="code hl_function" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a>();  <span class="comment">// run 3rd test-case</span></div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00398" data-start="{" data-end="}">
+<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"><a class="line" href="../../dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  398</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>    <a class="code hl_function" href="../../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>}</div>
+</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html"><div class="ttname"><a href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">others::recursive_tree_traversals::BT</a></div><div class="ttdoc">BT used to make the entire structure of the binary tree and the functions associated with the binary ...</div><div class="ttdef"><b>Definition</b> <a href="#l00088">recursive_tree_traversal.cpp:88</a></div></div>
+<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_a6397b78ceec18cb1959a1d159e134da5"><div class="ttname"><a href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5">others::recursive_tree_traversals::BT::preorder</a></div><div class="ttdeci">std::vector&lt; std::uint64_t &gt; preorder(Node *)</div><div class="ttdoc">preorder function that will perform the preorder traversal recursively, and return the resultant vect...</div><div class="ttdef"><b>Definition</b> <a href="#l00152">recursive_tree_traversal.cpp:152</a></div></div>
+<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_ac9404b65f407f631915515fa2e08a40c"><div class="ttname"><a href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c">others::recursive_tree_traversals::BT::postorder</a></div><div class="ttdeci">std::vector&lt; std::uint64_t &gt; postorder(Node *)</div><div class="ttdoc">postorder function that will perform the postorder traversal recursively, and return the result vecto...</div><div class="ttdef"><b>Definition</b> <a href="#l00172">recursive_tree_traversal.cpp:172</a></div></div>
+<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_af16da5fe0f5c54d31778d71d5a042114"><div class="ttname"><a href="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114">others::recursive_tree_traversals::BT::createNewNode</a></div><div class="ttdeci">Node * createNewNode(std::uint64_t)</div><div class="ttdoc">will allocate the memory for a node and, along the data and return the node.</div><div class="ttdef"><b>Definition</b> <a href="#l00118">recursive_tree_traversal.cpp:118</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="anamespaceothers_html"><div class="ttname"><a href="../../d0/d6f/namespaceothers.html">others</a></div><div class="ttdoc">for vector</div></div>
+<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">2nd test-case</div><div class="ttdef"><b>Definition</b> <a href="#l00266">recursive_tree_traversal.cpp:266</a></div></div>
+<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">1st test-case</div><div class="ttdef"><b>Definition</b> <a href="#l00201">recursive_tree_traversal.cpp:201</a></div></div>
+<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../dc/de1/recursive__tree__traversal_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> <a href="#l00386">recursive_tree_traversal.cpp:386</a></div></div>
+<div class="ttc" id="arecursive__tree__traversal_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">3rd test-case</div><div class="ttdef"><b>Definition</b> <a href="#l00327">recursive_tree_traversal.cpp:327</a></div></div>
+<div class="ttc" id="arecursive__tree__traversal_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00398">recursive_tree_traversal.cpp:398</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+<div class="ttc" id="astructothers_1_1recursive__tree__traversals_1_1_node_html"><div class="ttname"><a href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">others::recursive_tree_traversals::Node</a></div><div class="ttdoc">The structure to hold Nodes of the tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00079">recursive_tree_traversal.cpp:79</a></div></div>
+<div class="ttc" id="astructothers_1_1recursive__tree__traversals_1_1_node_html_a59cc94ba784aeaefec2e915ddfdb1ade"><div class="ttname"><a href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade">others::recursive_tree_traversals::Node::data</a></div><div class="ttdeci">std::uint64_t data</div><div class="ttdoc">The value/key of the node.</div><div class="ttdef"><b>Definition</b> <a href="#l00080">recursive_tree_traversal.cpp:80</a></div></div>
+<div class="ttc" id="astructothers_1_1recursive__tree__traversals_1_1_node_html_ab875304781a4eb9661c0931a6f1fae83"><div class="ttname"><a href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">others::recursive_tree_traversals::Node::right</a></div><div class="ttdeci">struct Node * right</div><div class="ttdoc">struct pointer to right subtree.</div><div class="ttdef"><b>Definition</b> <a href="#l00082">recursive_tree_traversal.cpp:82</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp.html">recursive_tree_traversal.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dc/dea/classgraph_1_1_h_k_graph-members.html b/dc/dea/classgraph_1_1_h_k_graph-members.html
index da552e4b8..db21235f1 100644
--- a/dc/dea/classgraph_1_1_h_k_graph-members.html
+++ b/dc/dea/classgraph_1_1_h_k_graph-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dc/dec/struct_list_node-members.html b/dc/dec/struct_list_node-members.html
index 9b6f9b983..d51a5bed2 100644
--- a/dc/dec/struct_list_node-members.html
+++ b/dc/dec/struct_list_node-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.map b/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.map
index 5266c594c..c357d3407 100644
--- a/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.map
+++ b/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.map
@@ -1,6 +1,6 @@
 <map id="operations_on_datastructures::trie_operations::Tnode" name="operations_on_datastructures::trie_operations::Tnode">
 <area shape="rect" id="Node000001" title="Class defining the structure of trie node and containing the methods to perform operations on them." alt="" coords="5,5,198,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="22,109,181,165"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="22,109,181,165"/>
 <area shape="poly" id="edge2_Node000002_Node000001" title=" " alt="" coords="62,58,56,71,56,84,71,107,67,110,51,86,50,70,58,56"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="113,94,114,70,107,47,112,46,119,70,118,94"/>
 </map>
diff --git a/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.md5 b/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.md5
index 91c461b0f..4d0fe9674 100644
--- a/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.md5
+++ b/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.md5
@@ -1 +1 @@
-0b22e31cb6b97bf760f578806996fb5f
\ No newline at end of file
+b1cba3296a852d258ece914986939533
\ No newline at end of file
diff --git a/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.svg b/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.svg
index 98e2c6914..051927574 100644
--- a/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.svg
+++ b/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph.svg
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="131.5,-41.75 12.75,-41.75 12.75,0 131.5,0 131.5,-41.75"/>
 <text text-anchor="start" x="20.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; operations</text>
 <text text-anchor="start" x="20.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_on_datastructures::trie</text>
diff --git a/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph_org.svg b/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph_org.svg
index 5b4bb8497..3275770fa 100644
--- a/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph_org.svg
+++ b/dc/df6/classoperations__on__datastructures_1_1trie__operations_1_1_tnode__coll__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="131.5,-41.75 12.75,-41.75 12.75,0 131.5,0 131.5,-41.75"/>
 <text text-anchor="start" x="20.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; operations</text>
 <text text-anchor="start" x="20.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_on_datastructures::trie</text>
diff --git a/dc/dfb/atbash__cipher_8cpp.html b/dc/dfb/atbash__cipher_8cpp.html
index e6e48286e..a60ed54a9 100644
--- a/dc/dfb/atbash__cipher_8cpp.html
+++ b/dc/dfb/atbash__cipher_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ciphers/atbash_cipher.cpp File Reference</title>
+<title>TheAlgorithms/C++: ciphers/atbash_cipher.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for atbash_cipher.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/dd5/atbash__cipher_8cpp__incl.svg" width="318" height="111"><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">
+</div>
+<p><a href="../../dc/dfb/atbash__cipher_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d4e/namespaceciphers.html">ciphers</a></td></tr>
@@ -135,7 +154,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a8f7dd4dcd3df7c512c20482afc2dbb9d" id="r_a8f7dd4dcd3df7c512c20482afc2dbb9d"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8f7dd4dcd3df7c512c20482afc2dbb9d">ciphers::atbash::atbash_cipher</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text)</td></tr>
+<tr class="memitem:a8f7dd4dcd3df7c512c20482afc2dbb9d" id="r_a8f7dd4dcd3df7c512c20482afc2dbb9d"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8f7dd4dcd3df7c512c20482afc2dbb9d">ciphers::atbash::atbash_cipher</a> (const std::string &amp;text)</td></tr>
 <tr class="memdesc:a8f7dd4dcd3df7c512c20482afc2dbb9d"><td class="mdescLeft">&#160;</td><td class="mdescRight">atbash cipher encryption and decryption  <br /></td></tr>
 <tr class="separator:a8f7dd4dcd3df7c512c20482afc2dbb9d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -147,7 +166,7 @@ Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:a6db8da258087a33e99296a725d84fc92" id="r_a6db8da258087a33e99296a725d84fc92"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt; char, char &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6db8da258087a33e99296a725d84fc92">ciphers::atbash::atbash_cipher_map</a></td></tr>
+<tr class="memitem:a6db8da258087a33e99296a725d84fc92" id="r_a6db8da258087a33e99296a725d84fc92"><td class="memItemLeft" align="right" valign="top">std::map&lt; char, char &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6db8da258087a33e99296a725d84fc92">ciphers::atbash::atbash_cipher_map</a></td></tr>
 <tr class="separator:a6db8da258087a33e99296a725d84fc92"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -157,6 +176,8 @@ Variables</h2></td></tr>
 Algorithm</h3>
 <p>The algorithm takes a string, and looks up the corresponding reversed letter for each letter in the word and replaces it. Spaces are ignored and case is preserved.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Focusucof" target="_blank">Focusucof</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../dc/dfb/atbash__cipher_8cpp_source.html">atbash_cipher.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a8f7dd4dcd3df7c512c20482afc2dbb9d" name="a8f7dd4dcd3df7c512c20482afc2dbb9d"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a8f7dd4dcd3df7c512c20482afc2dbb9d">&#9670;&#160;</a></span>atbash_cipher()</h2>
@@ -165,9 +186,9 @@ Algorithm</h3>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ciphers::atbash::atbash_cipher </td>
+          <td class="memname">std::string ciphers::atbash::atbash_cipher </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -181,21 +202,17 @@ Algorithm</h3>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>encoded or decoded string </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/dfb/atbash__cipher_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../dc/dfb/atbash__cipher_8cpp_source.html">atbash_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   47</span>                                               {</div>
-<div class="line"><span class="lineno">   48</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
+<div class="line"><span class="lineno">   48</span>    std::string <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   49</span>    <span class="keywordflow">for</span> (<span class="keywordtype">char</span> letter : text) {</div>
 <div class="line"><span class="lineno">   50</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> += atbash_cipher_map[letter];</div>
 <div class="line"><span class="lineno">   51</span>    }</div>
 <div class="line"><span class="lineno">   52</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   53</span>}</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/dfb/atbash__cipher_8cpp_a8f7dd4dcd3df7c512c20482afc2dbb9d_cgraph.svg" width="168" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -215,17 +232,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/dfb/atbash__cipher_8cpp_source.html#l00081">81</a> of file <a class="el" href="../../dc/dfb/atbash__cipher_8cpp_source.html">atbash_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   81</span>           {</div>
 <div class="line"><span class="lineno">   82</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   83</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   84</span>}</div>
-<div class="ttc" id="aatbash__cipher_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> atbash_cipher.cpp:62</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/dfb/atbash__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aatbash__cipher_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dfb/atbash__cipher_8cpp_source.html#l00062">atbash_cipher.cpp:62</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -253,29 +267,24 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/dfb/atbash__cipher_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../dc/dfb/atbash__cipher_8cpp_source.html">atbash_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>                   {</div>
 <div class="line"><span class="lineno">   63</span>    <span class="comment">// 1st test</span></div>
-<div class="line"><span class="lineno">   64</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> text = <span class="stringliteral">&quot;Hello World&quot;</span>;</div>
-<div class="line"><span class="lineno">   65</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> expected = <span class="stringliteral">&quot;Svool Dliow&quot;</span>;</div>
-<div class="line"><span class="lineno">   66</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> encrypted_text = <a class="code hl_function" href="#a8f7dd4dcd3df7c512c20482afc2dbb9d">ciphers::atbash::atbash_cipher</a>(text);</div>
-<div class="line"><span class="lineno">   67</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> decrypted_text = <a class="code hl_function" href="#a8f7dd4dcd3df7c512c20482afc2dbb9d">ciphers::atbash::atbash_cipher</a>(encrypted_text);</div>
+<div class="line"><span class="lineno">   64</span>    std::string text = <span class="stringliteral">&quot;Hello World&quot;</span>;</div>
+<div class="line"><span class="lineno">   65</span>    std::string expected = <span class="stringliteral">&quot;Svool Dliow&quot;</span>;</div>
+<div class="line"><span class="lineno">   66</span>    std::string encrypted_text = <a class="code hl_function" href="#a8f7dd4dcd3df7c512c20482afc2dbb9d">ciphers::atbash::atbash_cipher</a>(text);</div>
+<div class="line"><span class="lineno">   67</span>    std::string decrypted_text = <a class="code hl_function" href="#a8f7dd4dcd3df7c512c20482afc2dbb9d">ciphers::atbash::atbash_cipher</a>(encrypted_text);</div>
 <div class="line"><span class="lineno">   68</span>    assert(expected == encrypted_text);</div>
 <div class="line"><span class="lineno">   69</span>    assert(text == decrypted_text);</div>
-<div class="line"><span class="lineno">   70</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Original text: &quot;</span> &lt;&lt; text &lt;&lt; <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">   71</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;, Expected text: &quot;</span> &lt;&lt; expected &lt;&lt; <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">   72</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;, Encrypted text: &quot;</span> &lt;&lt; encrypted_text &lt;&lt; <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">   73</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;, Decrypted text: &quot;</span> &lt;&lt; decrypted_text &lt;&lt; <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">   74</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nAll tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   70</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original text: &quot;</span> &lt;&lt; text &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;, Expected text: &quot;</span> &lt;&lt; expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   72</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;, Encrypted text: &quot;</span> &lt;&lt; encrypted_text &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   73</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;, Decrypted text: &quot;</span> &lt;&lt; decrypted_text &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   74</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nAll tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   75</span>}</div>
-<div class="ttc" id="aatbash__cipher_8cpp_html_a8f7dd4dcd3df7c512c20482afc2dbb9d"><div class="ttname"><a href="#a8f7dd4dcd3df7c512c20482afc2dbb9d">ciphers::atbash::atbash_cipher</a></div><div class="ttdeci">std::string atbash_cipher(const std::string &amp;text)</div><div class="ttdoc">atbash cipher encryption and decryption</div><div class="ttdef"><b>Definition</b> atbash_cipher.cpp:47</div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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><!-- 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/dfb/atbash__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aatbash__cipher_8cpp_html_a8f7dd4dcd3df7c512c20482afc2dbb9d"><div class="ttname"><a href="#a8f7dd4dcd3df7c512c20482afc2dbb9d">ciphers::atbash::atbash_cipher</a></div><div class="ttdeci">std::string atbash_cipher(const std::string &amp;text)</div><div class="ttdoc">atbash cipher encryption and decryption</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dfb/atbash__cipher_8cpp_source.html#l00047">atbash_cipher.cpp:47</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Variable Documentation</h2>
@@ -286,7 +295,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt;char, char&gt; ciphers::atbash::atbash_cipher_map</td>
+          <td class="memname">std::map&lt;char, char&gt; ciphers::atbash::atbash_cipher_map</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -302,7 +311,9 @@ Here is the call graph for this function:</div>
 <div class="line">    {<span class="charliteral">&#39;W&#39;</span>, <span class="charliteral">&#39;D&#39;</span>}, {<span class="charliteral">&#39;X&#39;</span>, <span class="charliteral">&#39;C&#39;</span>}, {<span class="charliteral">&#39;Y&#39;</span>, <span class="charliteral">&#39;B&#39;</span>}, {<span class="charliteral">&#39;Z&#39;</span>, <span class="charliteral">&#39;A&#39;</span>}, {<span class="charliteral">&#39; &#39;</span>, <span class="charliteral">&#39; &#39;</span>}</div>
 <div class="line"> </div>
 <div class="line">}</div>
-</div><!-- fragment --><div class="fragment"><div class="line"><span class="lineno">   29</span>                                       {</div>
+</div><!-- fragment -->
+<p class="definition">Definition at line <a class="el" href="../../dc/dfb/atbash__cipher_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../dc/dfb/atbash__cipher_8cpp_source.html">atbash_cipher.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   29</span>                                       {</div>
 <div class="line"><span class="lineno">   30</span>    {<span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;z&#39;</span>}, {<span class="charliteral">&#39;b&#39;</span>, <span class="charliteral">&#39;y&#39;</span>}, {<span class="charliteral">&#39;c&#39;</span>, <span class="charliteral">&#39;x&#39;</span>}, {<span class="charliteral">&#39;d&#39;</span>, <span class="charliteral">&#39;w&#39;</span>}, {<span class="charliteral">&#39;e&#39;</span>, <span class="charliteral">&#39;v&#39;</span>}, {<span class="charliteral">&#39;f&#39;</span>, <span class="charliteral">&#39;u&#39;</span>},</div>
 <div class="line"><span class="lineno">   31</span>    {<span class="charliteral">&#39;g&#39;</span>, <span class="charliteral">&#39;t&#39;</span>}, {<span class="charliteral">&#39;h&#39;</span>, <span class="charliteral">&#39;s&#39;</span>}, {<span class="charliteral">&#39;i&#39;</span>, <span class="charliteral">&#39;r&#39;</span>}, {<span class="charliteral">&#39;j&#39;</span>, <span class="charliteral">&#39;q&#39;</span>}, {<span class="charliteral">&#39;k&#39;</span>, <span class="charliteral">&#39;p&#39;</span>}, {<span class="charliteral">&#39;l&#39;</span>, <span class="charliteral">&#39;o&#39;</span>},</div>
 <div class="line"><span class="lineno">   32</span>    {<span class="charliteral">&#39;m&#39;</span>, <span class="charliteral">&#39;n&#39;</span>}, {<span class="charliteral">&#39;n&#39;</span>, <span class="charliteral">&#39;m&#39;</span>}, {<span class="charliteral">&#39;o&#39;</span>, <span class="charliteral">&#39;l&#39;</span>}, {<span class="charliteral">&#39;p&#39;</span>, <span class="charliteral">&#39;k&#39;</span>}, {<span class="charliteral">&#39;q&#39;</span>, <span class="charliteral">&#39;j&#39;</span>}, {<span class="charliteral">&#39;r&#39;</span>, <span class="charliteral">&#39;i&#39;</span>},</div>
diff --git a/dc/dfb/atbash__cipher_8cpp_a8f7dd4dcd3df7c512c20482afc2dbb9d_cgraph.map b/dc/dfb/atbash__cipher_8cpp_a8f7dd4dcd3df7c512c20482afc2dbb9d_cgraph.map
deleted file mode 100644
index 05b779459..000000000
--- a/dc/dfb/atbash__cipher_8cpp_a8f7dd4dcd3df7c512c20482afc2dbb9d_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="ciphers::atbash::atbash_cipher" name="ciphers::atbash::atbash_cipher">
-<area shape="rect" id="Node000001" title="atbash cipher encryption and decryption" alt="" coords="5,29,163,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="53,29,52,19,57,11,68,5,84,3,101,5,112,11,109,16,100,10,84,8,69,10,61,14,57,20,59,28"/>
-</map>
diff --git a/dc/dfb/atbash__cipher_8cpp_a8f7dd4dcd3df7c512c20482afc2dbb9d_cgraph.md5 b/dc/dfb/atbash__cipher_8cpp_a8f7dd4dcd3df7c512c20482afc2dbb9d_cgraph.md5
deleted file mode 100644
index 0a58953cd..000000000
--- a/dc/dfb/atbash__cipher_8cpp_a8f7dd4dcd3df7c512c20482afc2dbb9d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-793dbef620ac4b3562e620747f01cee6
\ No newline at end of file
diff --git a/dc/dfb/atbash__cipher_8cpp_a8f7dd4dcd3df7c512c20482afc2dbb9d_cgraph.svg b/dc/dfb/atbash__cipher_8cpp_a8f7dd4dcd3df7c512c20482afc2dbb9d_cgraph.svg
deleted file mode 100644
index 3a579e3c1..000000000
--- a/dc/dfb/atbash__cipher_8cpp_a8f7dd4dcd3df7c512c20482afc2dbb9d_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::atbash::atbash_cipher Pages: 1 -->
-<svg width="126pt" height="57pt"
- viewBox="0.00 0.00 126.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>ciphers::atbash::atbash_cipher</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="atbash cipher encryption and decryption">
-<polygon fill="#999999" stroke="#666666" points="118,-30.5 0,-30.5 0,0 118,0 118,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::atbash::atbash</text>
-<text text-anchor="middle" x="59" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_cipher</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.09,-30.99C33.82,-40.06 40.79,-48.5 59,-48.5 68.96,-48.5 75.55,-45.97 78.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.25,-42.79 79.76,-32.49 75.28,-42.09 82.25,-42.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/dfb/atbash__cipher_8cpp_a8f7dd4dcd3df7c512c20482afc2dbb9d_cgraph_org.svg b/dc/dfb/atbash__cipher_8cpp_a8f7dd4dcd3df7c512c20482afc2dbb9d_cgraph_org.svg
deleted file mode 100644
index 8177dc858..000000000
--- a/dc/dfb/atbash__cipher_8cpp_a8f7dd4dcd3df7c512c20482afc2dbb9d_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::atbash::atbash_cipher Pages: 1 -->
-<svg width="126pt" height="57pt"
- viewBox="0.00 0.00 126.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>ciphers::atbash::atbash_cipher</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="atbash cipher encryption and decryption">
-<polygon fill="#999999" stroke="#666666" points="118,-30.5 0,-30.5 0,0 118,0 118,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::atbash::atbash</text>
-<text text-anchor="middle" x="59" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_cipher</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.09,-30.99C33.82,-40.06 40.79,-48.5 59,-48.5 68.96,-48.5 75.55,-45.97 78.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.25,-42.79 79.76,-32.49 75.28,-42.09 82.25,-42.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/dfb/atbash__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/dc/dfb/atbash__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index e85e01374..000000000
--- a/dc/dfb/atbash__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/dc/dfb/atbash__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/dc/dfb/atbash__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 5901bc148..000000000
--- a/dc/dfb/atbash__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-729fb887ee50b6291b0542ba0592a5c7
\ No newline at end of file
diff --git a/dc/dfb/atbash__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/dc/dfb/atbash__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 2e04695b9..000000000
--- a/dc/dfb/atbash__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/dfb/atbash__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/dc/dfb/atbash__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1813bd719..000000000
--- a/dc/dfb/atbash__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/dfb/atbash__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/dfb/atbash__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 1107c2a18..000000000
--- a/dc/dfb/atbash__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/dc/dfb/atbash__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/dfb/atbash__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 3ba6bad7f..000000000
--- a/dc/dfb/atbash__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-212406f11f9329f1b7673902689aeafc
\ No newline at end of file
diff --git a/dc/dfb/atbash__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/dfb/atbash__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 44d3c7109..000000000
--- a/dc/dfb/atbash__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/dfb/atbash__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dc/dfb/atbash__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 58b67a608..000000000
--- a/dc/dfb/atbash__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/dfb/atbash__cipher_8cpp_source.html b/dc/dfb/atbash__cipher_8cpp_source.html
new file mode 100644
index 000000000..84c9bff6e
--- /dev/null
+++ b/dc/dfb/atbash__cipher_8cpp_source.html
@@ -0,0 +1,199 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: ciphers/atbash_cipher.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dc/dfb/atbash__cipher_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">atbash_cipher.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dc/dfb/atbash__cipher_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;map&gt;</span>       </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;string&gt;</span>    </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/d4e/namespaceciphers.html">ciphers</a> {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../de/db3/namespaceatbash.html">atbash</a> {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>std::map&lt;char, char&gt; atbash_cipher_map = {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    {<span class="charliteral">&#39;a&#39;</span>, <span class="charliteral">&#39;z&#39;</span>}, {<span class="charliteral">&#39;b&#39;</span>, <span class="charliteral">&#39;y&#39;</span>}, {<span class="charliteral">&#39;c&#39;</span>, <span class="charliteral">&#39;x&#39;</span>}, {<span class="charliteral">&#39;d&#39;</span>, <span class="charliteral">&#39;w&#39;</span>}, {<span class="charliteral">&#39;e&#39;</span>, <span class="charliteral">&#39;v&#39;</span>}, {<span class="charliteral">&#39;f&#39;</span>, <span class="charliteral">&#39;u&#39;</span>},</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    {<span class="charliteral">&#39;g&#39;</span>, <span class="charliteral">&#39;t&#39;</span>}, {<span class="charliteral">&#39;h&#39;</span>, <span class="charliteral">&#39;s&#39;</span>}, {<span class="charliteral">&#39;i&#39;</span>, <span class="charliteral">&#39;r&#39;</span>}, {<span class="charliteral">&#39;j&#39;</span>, <span class="charliteral">&#39;q&#39;</span>}, {<span class="charliteral">&#39;k&#39;</span>, <span class="charliteral">&#39;p&#39;</span>}, {<span class="charliteral">&#39;l&#39;</span>, <span class="charliteral">&#39;o&#39;</span>},</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    {<span class="charliteral">&#39;m&#39;</span>, <span class="charliteral">&#39;n&#39;</span>}, {<span class="charliteral">&#39;n&#39;</span>, <span class="charliteral">&#39;m&#39;</span>}, {<span class="charliteral">&#39;o&#39;</span>, <span class="charliteral">&#39;l&#39;</span>}, {<span class="charliteral">&#39;p&#39;</span>, <span class="charliteral">&#39;k&#39;</span>}, {<span class="charliteral">&#39;q&#39;</span>, <span class="charliteral">&#39;j&#39;</span>}, {<span class="charliteral">&#39;r&#39;</span>, <span class="charliteral">&#39;i&#39;</span>},</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    {<span class="charliteral">&#39;s&#39;</span>, <span class="charliteral">&#39;h&#39;</span>}, {<span class="charliteral">&#39;t&#39;</span>, <span class="charliteral">&#39;g&#39;</span>}, {<span class="charliteral">&#39;u&#39;</span>, <span class="charliteral">&#39;f&#39;</span>}, {<span class="charliteral">&#39;v&#39;</span>, <span class="charliteral">&#39;e&#39;</span>}, {<span class="charliteral">&#39;w&#39;</span>, <span class="charliteral">&#39;d&#39;</span>}, {<span class="charliteral">&#39;x&#39;</span>, <span class="charliteral">&#39;c&#39;</span>},</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    {<span class="charliteral">&#39;y&#39;</span>, <span class="charliteral">&#39;b&#39;</span>}, {<span class="charliteral">&#39;z&#39;</span>, <span class="charliteral">&#39;a&#39;</span>}, {<span class="charliteral">&#39;A&#39;</span>, <span class="charliteral">&#39;Z&#39;</span>}, {<span class="charliteral">&#39;B&#39;</span>, <span class="charliteral">&#39;Y&#39;</span>}, {<span class="charliteral">&#39;C&#39;</span>, <span class="charliteral">&#39;X&#39;</span>}, {<span class="charliteral">&#39;D&#39;</span>, <span class="charliteral">&#39;W&#39;</span>},</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    {<span class="charliteral">&#39;E&#39;</span>, <span class="charliteral">&#39;V&#39;</span>}, {<span class="charliteral">&#39;F&#39;</span>, <span class="charliteral">&#39;U&#39;</span>}, {<span class="charliteral">&#39;G&#39;</span>, <span class="charliteral">&#39;T&#39;</span>}, {<span class="charliteral">&#39;H&#39;</span>, <span class="charliteral">&#39;S&#39;</span>}, {<span class="charliteral">&#39;I&#39;</span>, <span class="charliteral">&#39;R&#39;</span>}, {<span class="charliteral">&#39;J&#39;</span>, <span class="charliteral">&#39;Q&#39;</span>},</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    {<span class="charliteral">&#39;K&#39;</span>, <span class="charliteral">&#39;P&#39;</span>}, {<span class="charliteral">&#39;L&#39;</span>, <span class="charliteral">&#39;O&#39;</span>}, {<span class="charliteral">&#39;M&#39;</span>, <span class="charliteral">&#39;N&#39;</span>}, {<span class="charliteral">&#39;N&#39;</span>, <span class="charliteral">&#39;M&#39;</span>}, {<span class="charliteral">&#39;O&#39;</span>, <span class="charliteral">&#39;L&#39;</span>}, {<span class="charliteral">&#39;P&#39;</span>, <span class="charliteral">&#39;K&#39;</span>},</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    {<span class="charliteral">&#39;Q&#39;</span>, <span class="charliteral">&#39;J&#39;</span>}, {<span class="charliteral">&#39;R&#39;</span>, <span class="charliteral">&#39;I&#39;</span>}, {<span class="charliteral">&#39;S&#39;</span>, <span class="charliteral">&#39;H&#39;</span>}, {<span class="charliteral">&#39;T&#39;</span>, <span class="charliteral">&#39;G&#39;</span>}, {<span class="charliteral">&#39;U&#39;</span>, <span class="charliteral">&#39;F&#39;</span>}, {<span class="charliteral">&#39;V&#39;</span>, <span class="charliteral">&#39;E&#39;</span>},</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    {<span class="charliteral">&#39;W&#39;</span>, <span class="charliteral">&#39;D&#39;</span>}, {<span class="charliteral">&#39;X&#39;</span>, <span class="charliteral">&#39;C&#39;</span>}, {<span class="charliteral">&#39;Y&#39;</span>, <span class="charliteral">&#39;B&#39;</span>}, {<span class="charliteral">&#39;Z&#39;</span>, <span class="charliteral">&#39;A&#39;</span>}, {<span class="charliteral">&#39; &#39;</span>, <span class="charliteral">&#39; &#39;</span>}</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>};</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="foldopen" id="foldopen00047" data-start="{" data-end="}">
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="../../dc/dfb/atbash__cipher_8cpp.html#a8f7dd4dcd3df7c512c20482afc2dbb9d">   47</a></span>std::string <a class="code hl_function" href="../../dc/dfb/atbash__cipher_8cpp.html#a8f7dd4dcd3df7c512c20482afc2dbb9d">atbash_cipher</a>(<span class="keyword">const</span> std::string&amp; text) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    std::string result;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">for</span> (<span class="keywordtype">char</span> letter : text) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        result += atbash_cipher_map[letter];</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>}</div>
+</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>}  <span class="comment">// namespace atbash</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>}  <span class="comment">// namespace ciphers</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   62</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="comment">// 1st test</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    std::string text = <span class="stringliteral">&quot;Hello World&quot;</span>;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    std::string expected = <span class="stringliteral">&quot;Svool Dliow&quot;</span>;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    std::string encrypted_text = ciphers::atbash::atbash_cipher(text);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    std::string decrypted_text = ciphers::atbash::atbash_cipher(encrypted_text);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    assert(expected == encrypted_text);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    assert(text == decrypted_text);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original text: &quot;</span> &lt;&lt; text &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;, Expected text: &quot;</span> &lt;&lt; expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;, Encrypted text: &quot;</span> &lt;&lt; encrypted_text &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;, Decrypted text: &quot;</span> &lt;&lt; decrypted_text &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nAll tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>}</div>
+</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="foldopen" id="foldopen00081" data-start="{" data-end="}">
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="../../dc/dfb/atbash__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   81</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dc/dfb/atbash__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <a class="code hl_function" href="../../dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>}</div>
+</div>
+<div class="ttc" id="aatbash__cipher_8cpp_html_a8f7dd4dcd3df7c512c20482afc2dbb9d"><div class="ttname"><a href="../../dc/dfb/atbash__cipher_8cpp.html#a8f7dd4dcd3df7c512c20482afc2dbb9d">ciphers::atbash::atbash_cipher</a></div><div class="ttdeci">std::string atbash_cipher(const std::string &amp;text)</div><div class="ttdoc">atbash cipher encryption and decryption</div><div class="ttdef"><b>Definition</b> <a href="#l00047">atbash_cipher.cpp:47</a></div></div>
+<div class="ttc" id="aatbash__cipher_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/dfb/atbash__cipher_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> <a href="#l00062">atbash_cipher.cpp:62</a></div></div>
+<div class="ttc" id="aatbash__cipher_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/dfb/atbash__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00081">atbash_cipher.cpp:81</a></div></div>
+<div class="ttc" id="anamespaceatbash_html"><div class="ttname"><a href="../../de/db3/namespaceatbash.html">atbash</a></div><div class="ttdoc">Functions for the Atbash Cipher implementation.</div></div>
+<div class="ttc" id="anamespaceciphers_html"><div class="ttname"><a href="../../d6/d4e/namespaceciphers.html">ciphers</a></div><div class="ttdoc">Algorithms for encryption and decryption.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_4d6e05837bf820fb089a8a8cdf2f42b7.html">ciphers</a></li><li class="navelem"><a class="el" href="../../dc/dfb/atbash__cipher_8cpp.html">atbash_cipher.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dc/dfe/ternary__search_8cpp.html b/dc/dfe/ternary__search_8cpp.html
index 1a9df6c06..fa4dd1685 100644
--- a/dc/dfe/ternary__search_8cpp.html
+++ b/dc/dfe/ternary__search_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: search/ternary_search.cpp File Reference</title>
+<title>TheAlgorithms/C++: search/ternary_search.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,16 +136,17 @@ Include dependency graph for ternary_search.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d06/ternary__search_8cpp__incl.svg" width="187" height="111"><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">
+</div>
+<p><a href="../../dc/dfe/ternary__search_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="define-members" name="define-members"></a>
 Macros</h2></td></tr>
 <tr class="memitem:ae01eda5098801bb6b5b778828fb4fddc" id="r_ae01eda5098801bb6b5b778828fb4fddc"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae01eda5098801bb6b5b778828fb4fddc">absolutePrecision</a>&#160;&#160;&#160;10</td></tr>
 <tr class="separator:ae01eda5098801bb6b5b778828fb4fddc"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a23ad617bfce1e7cf4591059c85c1a027" id="r_a23ad617bfce1e7cf4591059c85c1a027"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a23ad617bfce1e7cf4591059c85c1a027">_target</a>&#160;&#160;&#160;10</td></tr>
 <tr class="separator:a23ad617bfce1e7cf4591059c85c1a027"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a392fb874e547e582e9c66a08a1f23326" id="r_a392fb874e547e582e9c66a08a1f23326"><td class="memItemLeft" align="right" valign="top"><a id="a392fb874e547e582e9c66a08a1f23326" name="a392fb874e547e582e9c66a08a1f23326"></a>
-#define&#160;</td><td class="memItemRight" valign="bottom"><b>MAX</b>&#160;&#160;&#160;10000000</td></tr>
-<tr class="memdesc:a392fb874e547e582e9c66a08a1f23326"><td class="mdescLeft">&#160;</td><td class="mdescRight">Maximum length of array. <br /></td></tr>
+<tr class="memitem:a392fb874e547e582e9c66a08a1f23326" id="r_a392fb874e547e582e9c66a08a1f23326"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a392fb874e547e582e9c66a08a1f23326">MAX</a>&#160;&#160;&#160;10000000</td></tr>
+<tr class="memdesc:a392fb874e547e582e9c66a08a1f23326"><td class="mdescLeft">&#160;</td><td class="mdescRight">Maximum length of array.  <br /></td></tr>
 <tr class="separator:a392fb874e547e582e9c66a08a1f23326"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
@@ -151,6 +169,8 @@ Functions</h2></td></tr>
 <li>Time Complexity : O(log3 n)</li>
 <li>Space Complexity : O(1) (without the array) </li>
 </ul>
+
+<p class="definition">Definition in file <a class="el" href="../../dc/dfe/ternary__search_8cpp_source.html">ternary_search.cpp</a>.</p>
 </div><h2 class="groupheader">Macro Definition Documentation</h2>
 <a id="a23ad617bfce1e7cf4591059c85c1a027" name="a23ad617bfce1e7cf4591059c85c1a027"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a23ad617bfce1e7cf4591059c85c1a027">&#9670;&#160;</a></span>_target</h2>
@@ -165,6 +185,8 @@ Functions</h2></td></tr>
 </div><div class="memdoc">
 <p>The value of _target should be decided or can be decided later by using the variable of the function. </p>
 
+<p class="definition">Definition at line <a class="el" href="../../dc/dfe/ternary__search_8cpp_source.html#l00027">27</a> of file <a class="el" href="../../dc/dfe/ternary__search_8cpp_source.html">ternary_search.cpp</a>.</p>
+
 </div>
 </div>
 <a id="ae01eda5098801bb6b5b778828fb4fddc" name="ae01eda5098801bb6b5b778828fb4fddc"></a>
@@ -180,6 +202,26 @@ Functions</h2></td></tr>
 </div><div class="memdoc">
 <p>The absolutePrecision can be modified to fit preference but it is recommended to not go lower than 10 due to errors that may occur. </p>
 
+<p class="definition">Definition at line <a class="el" href="../../dc/dfe/ternary__search_8cpp_source.html#l00022">22</a> of file <a class="el" href="../../dc/dfe/ternary__search_8cpp_source.html">ternary_search.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a392fb874e547e582e9c66a08a1f23326" name="a392fb874e547e582e9c66a08a1f23326"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a392fb874e547e582e9c66a08a1f23326">&#9670;&#160;</a></span>MAX</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">#define MAX&#160;&#160;&#160;10000000</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>Maximum length of array. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/dfe/ternary__search_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../dc/dfe/ternary__search_8cpp_source.html">ternary_search.cpp</a>.</p>
+
 </div>
 </div>
 <h2 class="groupheader">Function Documentation</h2>
@@ -198,6 +240,8 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>get_input function is to receive input from standard IO </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000014">Todo</a></b></dt><dd>@christianbender Get input from STDIO or write input to memory as done above. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/dfe/ternary__search_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../dc/dfe/ternary__search_8cpp_source.html">ternary_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   36</span>{}</div>
 </div><!-- fragment -->
 </div>
@@ -242,19 +286,21 @@ Functions</h2></td></tr>
 <dl class="section return"><dt>Returns</dt><dd>index where the target value was found </dd>
 <dd>
 -1 if target value not found </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/dfe/ternary__search_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../dc/dfe/ternary__search_8cpp_source.html">ternary_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   48</span>                                                                {</div>
 <div class="line"><span class="lineno">   49</span>    <span class="keywordflow">while</span> (1) {</div>
 <div class="line"><span class="lineno">   50</span>        <span class="keywordflow">if</span> (left &lt; right) {</div>
 <div class="line"><span class="lineno">   51</span>            <span class="keywordflow">if</span> (right - left &lt; <a class="code hl_define" href="#ae01eda5098801bb6b5b778828fb4fddc">absolutePrecision</a>) {</div>
-<div class="line"><span class="lineno">   52</span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = left; i &lt;= <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>; i++)</div>
+<div class="line"><span class="lineno">   52</span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = left; i &lt;= right; i++)</div>
 <div class="line"><span class="lineno">   53</span>                    <span class="keywordflow">if</span> (A[i] == target)</div>
 <div class="line"><span class="lineno">   54</span>                        <span class="keywordflow">return</span> i;</div>
 <div class="line"><span class="lineno">   55</span> </div>
 <div class="line"><span class="lineno">   56</span>                <span class="keywordflow">return</span> -1;</div>
 <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">int</span> oneThird = (left + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>) / 3 + 1;</div>
-<div class="line"><span class="lineno">   60</span>            <span class="keywordtype">int</span> twoThird = (left + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>) * 2 / 3 + 1;</div>
+<div class="line"><span class="lineno">   59</span>            <span class="keywordtype">int</span> oneThird = (left + right) / 3 + 1;</div>
+<div class="line"><span class="lineno">   60</span>            <span class="keywordtype">int</span> twoThird = (left + right) * 2 / 3 + 1;</div>
 <div class="line"><span class="lineno">   61</span> </div>
 <div class="line"><span class="lineno">   62</span>            <span class="keywordflow">if</span> (A[oneThird] == target)</div>
 <div class="line"><span class="lineno">   63</span>                <span class="keywordflow">return</span> oneThird;</div>
@@ -264,17 +310,16 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   67</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (target &gt; A[twoThird])</div>
 <div class="line"><span class="lineno">   68</span>                left = twoThird + 1;</div>
 <div class="line"><span class="lineno">   69</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (target &lt; A[oneThird])</div>
-<div class="line"><span class="lineno">   70</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a> = oneThird - 1;</div>
+<div class="line"><span class="lineno">   70</span>                right = oneThird - 1;</div>
 <div class="line"><span class="lineno">   71</span> </div>
 <div class="line"><span class="lineno">   72</span>            <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">   73</span>                left = oneThird + 1, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a> = twoThird - 1;</div>
+<div class="line"><span class="lineno">   73</span>                left = oneThird + 1, right = twoThird - 1;</div>
 <div class="line"><span class="lineno">   74</span>        } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">   75</span>            <span class="keywordflow">return</span> -1;</div>
 <div class="line"><span class="lineno">   76</span>        }</div>
 <div class="line"><span class="lineno">   77</span>    }</div>
 <div class="line"><span class="lineno">   78</span>}</div>
-<div class="ttc" id="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::right</a></div><div class="ttdeci">T right(T... args)</div></div>
-<div class="ttc" id="aternary__search_8cpp_html_ae01eda5098801bb6b5b778828fb4fddc"><div class="ttname"><a href="#ae01eda5098801bb6b5b778828fb4fddc">absolutePrecision</a></div><div class="ttdeci">#define absolutePrecision</div><div class="ttdef"><b>Definition</b> ternary_search.cpp:22</div></div>
+<div class="ttc" id="aternary__search_8cpp_html_ae01eda5098801bb6b5b778828fb4fddc"><div class="ttname"><a href="#ae01eda5098801bb6b5b778828fb4fddc">absolutePrecision</a></div><div class="ttdeci">#define absolutePrecision</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dfe/ternary__search_8cpp_source.html#l00022">ternary_search.cpp:22</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -293,6 +338,8 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/dfe/ternary__search_8cpp_source.html#l00134">134</a> of file <a class="el" href="../../dc/dfe/ternary__search_8cpp_source.html">ternary_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  134</span>           {</div>
 <div class="line"><span class="lineno">  135</span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 21;</div>
 <div class="line"><span class="lineno">  136</span>    <span class="keywordtype">int</span> A[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 10};</div>
@@ -300,16 +347,11 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  138</span>    <a class="code hl_function" href="#aef655a27eb82efa299bf9d0becf6e9c8">ternary_search</a>(N, A, <a class="code hl_define" href="#a23ad617bfce1e7cf4591059c85c1a027">_target</a>);</div>
 <div class="line"><span class="lineno">  139</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  140</span>}</div>
-<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
-<div class="ttc" id="aternary__search_8cpp_html_a23ad617bfce1e7cf4591059c85c1a027"><div class="ttname"><a href="#a23ad617bfce1e7cf4591059c85c1a027">_target</a></div><div class="ttdeci">#define _target</div><div class="ttdef"><b>Definition</b> ternary_search.cpp:27</div></div>
-<div class="ttc" id="aternary__search_8cpp_html_a7f7d866eccdabe51bb16818a792618b1"><div class="ttname"><a href="#a7f7d866eccdabe51bb16818a792618b1">get_input</a></div><div class="ttdeci">void get_input()</div><div class="ttdef"><b>Definition</b> ternary_search.cpp:36</div></div>
-<div class="ttc" id="aternary__search_8cpp_html_aef655a27eb82efa299bf9d0becf6e9c8"><div class="ttname"><a href="#aef655a27eb82efa299bf9d0becf6e9c8">ternary_search</a></div><div class="ttdeci">void ternary_search(int N, int A[], int target)</div><div class="ttdef"><b>Definition</b> ternary_search.cpp:127</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="396" height="159"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+<div class="ttc" id="aternary__search_8cpp_html_a23ad617bfce1e7cf4591059c85c1a027"><div class="ttname"><a href="#a23ad617bfce1e7cf4591059c85c1a027">_target</a></div><div class="ttdeci">#define _target</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dfe/ternary__search_8cpp_source.html#l00027">ternary_search.cpp:27</a></div></div>
+<div class="ttc" id="aternary__search_8cpp_html_a7f7d866eccdabe51bb16818a792618b1"><div class="ttname"><a href="#a7f7d866eccdabe51bb16818a792618b1">get_input</a></div><div class="ttdeci">void get_input()</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dfe/ternary__search_8cpp_source.html#l00036">ternary_search.cpp:36</a></div></div>
+<div class="ttc" id="aternary__search_8cpp_html_aef655a27eb82efa299bf9d0becf6e9c8"><div class="ttname"><a href="#aef655a27eb82efa299bf9d0becf6e9c8">ternary_search</a></div><div class="ttdeci">void ternary_search(int N, int A[], int target)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dfe/ternary__search_8cpp_source.html#l00127">ternary_search.cpp:127</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a93d0099db95022f1eb90ddfd68f73ead" name="a93d0099db95022f1eb90ddfd68f73ead"></a>
@@ -352,18 +394,20 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>index where the target value was found </dd>
 <dd>
 -1 if target value not found </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/dfe/ternary__search_8cpp_source.html#l00090">90</a> of file <a class="el" href="../../dc/dfe/ternary__search_8cpp_source.html">ternary_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   90</span>                                                                 {</div>
 <div class="line"><span class="lineno">   91</span>    <span class="keywordflow">if</span> (left &lt; right) {</div>
 <div class="line"><span class="lineno">   92</span>        <span class="keywordflow">if</span> (right - left &lt; <a class="code hl_define" href="#ae01eda5098801bb6b5b778828fb4fddc">absolutePrecision</a>) {</div>
-<div class="line"><span class="lineno">   93</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = left; i &lt;= <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>; i++)</div>
+<div class="line"><span class="lineno">   93</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = left; i &lt;= right; i++)</div>
 <div class="line"><span class="lineno">   94</span>                <span class="keywordflow">if</span> (A[i] == target)</div>
 <div class="line"><span class="lineno">   95</span>                    <span class="keywordflow">return</span> i;</div>
 <div class="line"><span class="lineno">   96</span> </div>
 <div class="line"><span class="lineno">   97</span>            <span class="keywordflow">return</span> -1;</div>
 <div class="line"><span class="lineno">   98</span>        }</div>
 <div class="line"><span class="lineno">   99</span> </div>
-<div class="line"><span class="lineno">  100</span>        <span class="keywordtype">int</span> oneThird = (left + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>) / 3 + 1;</div>
-<div class="line"><span class="lineno">  101</span>        <span class="keywordtype">int</span> twoThird = (left + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">right</a>) * 2 / 3 + 1;</div>
+<div class="line"><span class="lineno">  100</span>        <span class="keywordtype">int</span> oneThird = (left + right) / 3 + 1;</div>
+<div class="line"><span class="lineno">  101</span>        <span class="keywordtype">int</span> twoThird = (left + right) * 2 / 3 + 1;</div>
 <div class="line"><span class="lineno">  102</span> </div>
 <div class="line"><span class="lineno">  103</span>        <span class="keywordflow">if</span> (A[oneThird] == target)</div>
 <div class="line"><span class="lineno">  104</span>            <span class="keywordflow">return</span> oneThird;</div>
@@ -380,13 +424,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  115</span>        <span class="keywordflow">return</span> -1;</div>
 <div class="line"><span class="lineno">  116</span>    }</div>
 <div class="line"><span class="lineno">  117</span>}</div>
-<div class="ttc" id="aternary__search_8cpp_html_a93d0099db95022f1eb90ddfd68f73ead"><div class="ttname"><a href="#a93d0099db95022f1eb90ddfd68f73ead">rec_ternary_search</a></div><div class="ttdeci">int rec_ternary_search(int left, int right, int A[], int target)</div><div class="ttdef"><b>Definition</b> ternary_search.cpp:90</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/dfe/ternary__search_8cpp_a93d0099db95022f1eb90ddfd68f73ead_cgraph.svg" width="143" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aternary__search_8cpp_html_a93d0099db95022f1eb90ddfd68f73ead"><div class="ttname"><a href="#a93d0099db95022f1eb90ddfd68f73ead">rec_ternary_search</a></div><div class="ttdeci">int rec_ternary_search(int left, int right, int A[], int target)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dfe/ternary__search_8cpp_source.html#l00090">ternary_search.cpp:90</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aef655a27eb82efa299bf9d0becf6e9c8" name="aef655a27eb82efa299bf9d0becf6e9c8"></a>
@@ -420,20 +459,15 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">  127</span>                                                {</div>
-<div class="line"><span class="lineno">  128</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#ae30dfe2894191bfeffe5b3b1854b95b0">it_ternary_search</a>(0, N - 1, A, target) &lt;&lt; <span class="charliteral">&#39;\t&#39;</span>;</div>
-<div class="line"><span class="lineno">  129</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="#a93d0099db95022f1eb90ddfd68f73ead">rec_ternary_search</a>(0, N - 1, A, target) &lt;&lt; <span class="charliteral">&#39;\t&#39;</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> &lt;&lt; <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">  131</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="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="aternary__search_8cpp_html_ae30dfe2894191bfeffe5b3b1854b95b0"><div class="ttname"><a href="#ae30dfe2894191bfeffe5b3b1854b95b0">it_ternary_search</a></div><div class="ttdeci">int it_ternary_search(int left, int right, int A[], int target)</div><div class="ttdef"><b>Definition</b> ternary_search.cpp:48</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.svg" width="299" height="159"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../dc/dfe/ternary__search_8cpp_source.html#l00127">127</a> of file <a class="el" href="../../dc/dfe/ternary__search_8cpp_source.html">ternary_search.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  127</span>                                                {</div>
+<div class="line"><span class="lineno">  128</span>    std::cout &lt;&lt; <a class="code hl_function" href="#ae30dfe2894191bfeffe5b3b1854b95b0">it_ternary_search</a>(0, N - 1, A, target) &lt;&lt; <span class="charliteral">&#39;\t&#39;</span>;</div>
+<div class="line"><span class="lineno">  129</span>    std::cout &lt;&lt; <a class="code hl_function" href="#a93d0099db95022f1eb90ddfd68f73ead">rec_ternary_search</a>(0, N - 1, A, target) &lt;&lt; <span class="charliteral">&#39;\t&#39;</span>;</div>
+<div class="line"><span class="lineno">  130</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  131</span>}</div>
+<div class="ttc" id="aternary__search_8cpp_html_ae30dfe2894191bfeffe5b3b1854b95b0"><div class="ttname"><a href="#ae30dfe2894191bfeffe5b3b1854b95b0">it_ternary_search</a></div><div class="ttdeci">int it_ternary_search(int left, int right, int A[], int target)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/dfe/ternary__search_8cpp_source.html#l00048">ternary_search.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dc/dfe/ternary__search_8cpp_a93d0099db95022f1eb90ddfd68f73ead_cgraph.map b/dc/dfe/ternary__search_8cpp_a93d0099db95022f1eb90ddfd68f73ead_cgraph.map
deleted file mode 100644
index f8574c3fd..000000000
--- a/dc/dfe/ternary__search_8cpp_a93d0099db95022f1eb90ddfd68f73ead_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="rec_ternary_search" name="rec_ternary_search">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,138,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="48,30,44,21,47,11,56,5,72,3,88,5,97,12,93,16,86,10,71,8,58,10,51,14,49,20,53,28"/>
-</map>
diff --git a/dc/dfe/ternary__search_8cpp_a93d0099db95022f1eb90ddfd68f73ead_cgraph.md5 b/dc/dfe/ternary__search_8cpp_a93d0099db95022f1eb90ddfd68f73ead_cgraph.md5
deleted file mode 100644
index 3d7bea2f6..000000000
--- a/dc/dfe/ternary__search_8cpp_a93d0099db95022f1eb90ddfd68f73ead_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7fd6829086ef617e0ba95a7bc778a9dd
\ No newline at end of file
diff --git a/dc/dfe/ternary__search_8cpp_a93d0099db95022f1eb90ddfd68f73ead_cgraph.svg b/dc/dfe/ternary__search_8cpp_a93d0099db95022f1eb90ddfd68f73ead_cgraph.svg
deleted file mode 100644
index 4342ddb45..000000000
--- a/dc/dfe/ternary__search_8cpp_a93d0099db95022f1eb90ddfd68f73ead_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: rec_ternary_search Pages: 1 -->
-<svg width="107pt" height="45pt"
- viewBox="0.00 0.00 107.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>rec_ternary_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="99.25,-19.25 0,-19.25 0,0 99.25,0 99.25,-19.25"/>
-<text text-anchor="middle" x="49.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">rec_ternary_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.09,-19.54C27,-28.15 32.18,-37.25 49.62,-37.25 59.17,-37.25 65.04,-34.53 67.24,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.72,-30.21 65.44,-21.03 63.84,-31.5 70.72,-30.21"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/dfe/ternary__search_8cpp_a93d0099db95022f1eb90ddfd68f73ead_cgraph_org.svg b/dc/dfe/ternary__search_8cpp_a93d0099db95022f1eb90ddfd68f73ead_cgraph_org.svg
deleted file mode 100644
index 6dd653a60..000000000
--- a/dc/dfe/ternary__search_8cpp_a93d0099db95022f1eb90ddfd68f73ead_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: rec_ternary_search Pages: 1 -->
-<svg width="107pt" height="45pt"
- viewBox="0.00 0.00 107.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>rec_ternary_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="99.25,-19.25 0,-19.25 0,0 99.25,0 99.25,-19.25"/>
-<text text-anchor="middle" x="49.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">rec_ternary_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.09,-19.54C27,-28.15 32.18,-37.25 49.62,-37.25 59.17,-37.25 65.04,-34.53 67.24,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.72,-30.21 65.44,-21.03 63.84,-31.5 70.72,-30.21"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index f2d6ee3ee..000000000
--- a/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,14 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1" title=" " alt="" coords="119,5,194,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,36,103,26,104,31,56,41"/>
-<area shape="rect" id="Node000003" href="$dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8" title=" " alt="" coords="103,55,210,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,46,88,52,86,57,55,51"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="288,5,360,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="202,51,273,30,275,35,204,57"/>
-<area shape="rect" id="Node000005" href="$dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0" title=" " alt="" coords="264,55,385,80"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="210,65,248,65,248,70,210,70"/>
-<area shape="rect" id="Node000006" href="$dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead" title=" " alt="" coords="258,128,390,154"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="189,79,280,119,278,124,187,83"/>
-<area shape="poly" id="edge6_Node000006_Node000006" title=" " alt="" coords="296,129,290,119,293,110,305,104,324,101,345,104,355,111,353,115,343,109,324,107,307,109,297,113,295,119,300,126"/>
-</map>
diff --git a/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 563f9782b..000000000
--- a/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a521a4f13bc3b81eafa8e5b79cfe7324
\ No newline at end of file
diff --git a/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 48f8b1e86..000000000
--- a/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,146 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="297pt" height="119pt"
- viewBox="0.00 0.00 296.75 119.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 115.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-92.25 0,-92.25 0,-73 37,-73 37,-92.25"/>
-<text text-anchor="middle" x="18.5" y="-78.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.12,-111.25 85.38,-111.25 85.38,-92 141.12,-92 141.12,-111.25"/>
-<text text-anchor="middle" x="113.25" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_input</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.38,-86.29C47.7,-88.4 61.09,-91.14 73.69,-93.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.94,-97.15 83.44,-95.72 74.35,-90.29 72.94,-97.15"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="153.5,-74.25 73,-74.25 73,-55 153.5,-55 153.5,-74.25"/>
-<text text-anchor="middle" x="113.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">ternary_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.38,-79.15C44.34,-77.8 52.69,-76.18 61.25,-74.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.89,-77.96 71.04,-72.62 60.56,-71.09 61.89,-77.96"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="265.88,-111.25 212.38,-111.25 212.38,-92 265.88,-92 265.88,-111.25"/>
-<text text-anchor="middle" x="239.12" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.1,-74.74C164.67,-79.69 184.64,-85.65 201.56,-90.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.14,-93.93 210.73,-93.44 202.15,-87.23 200.14,-93.93"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="284.62,-74.25 193.62,-74.25 193.62,-55 284.62,-55 284.62,-74.25"/>
-<text text-anchor="middle" x="239.12" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">it_ternary_search</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.79,-64.62C162.75,-64.62 172.43,-64.62 181.93,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.86,-68.13 191.86,-64.63 181.86,-61.13 181.86,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="288.75,-19.25 189.5,-19.25 189.5,0 288.75,0 288.75,-19.25"/>
-<text text-anchor="middle" x="239.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">rec_ternary_search</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.97,-54.54C156.09,-46.05 183.68,-33.8 205.22,-24.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.45,-27.52 214.17,-20.26 203.61,-21.12 206.45,-27.52"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.42,-19.54C210.43,-28.15 217,-37.25 239.12,-37.25 251.23,-37.25 258.67,-34.53 261.47,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="264.89,-29.93 259.18,-21.01 258.08,-31.55 264.89,-29.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 5d5f1694a..000000000
--- a/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="297pt" height="119pt"
- viewBox="0.00 0.00 296.75 119.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 115.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-92.25 0,-92.25 0,-73 37,-73 37,-92.25"/>
-<text text-anchor="middle" x="18.5" y="-78.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="141.12,-111.25 85.38,-111.25 85.38,-92 141.12,-92 141.12,-111.25"/>
-<text text-anchor="middle" x="113.25" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_input</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.38,-86.29C47.7,-88.4 61.09,-91.14 73.69,-93.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.94,-97.15 83.44,-95.72 74.35,-90.29 72.94,-97.15"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="153.5,-74.25 73,-74.25 73,-55 153.5,-55 153.5,-74.25"/>
-<text text-anchor="middle" x="113.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">ternary_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.38,-79.15C44.34,-77.8 52.69,-76.18 61.25,-74.52"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.89,-77.96 71.04,-72.62 60.56,-71.09 61.89,-77.96"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="265.88,-111.25 212.38,-111.25 212.38,-92 265.88,-92 265.88,-111.25"/>
-<text text-anchor="middle" x="239.12" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.1,-74.74C164.67,-79.69 184.64,-85.65 201.56,-90.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.14,-93.93 210.73,-93.44 202.15,-87.23 200.14,-93.93"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="284.62,-74.25 193.62,-74.25 193.62,-55 284.62,-55 284.62,-74.25"/>
-<text text-anchor="middle" x="239.12" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">it_ternary_search</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.79,-64.62C162.75,-64.62 172.43,-64.62 181.93,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.86,-68.13 191.86,-64.63 181.86,-61.13 181.86,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="288.75,-19.25 189.5,-19.25 189.5,0 288.75,0 288.75,-19.25"/>
-<text text-anchor="middle" x="239.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">rec_ternary_search</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.97,-54.54C156.09,-46.05 183.68,-33.8 205.22,-24.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.45,-27.52 214.17,-20.26 203.61,-21.12 206.45,-27.52"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge6_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge6_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.42,-19.54C210.43,-28.15 217,-37.25 239.12,-37.25 251.23,-37.25 258.67,-34.53 261.47,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="264.89,-29.93 259.18,-21.01 258.08,-31.55 264.89,-29.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.map b/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.map
deleted file mode 100644
index 0cf33064d..000000000
--- a/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="ternary_search" name="ternary_search">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,113,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="191,5,262,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="105,51,176,30,178,35,106,57"/>
-<area shape="rect" id="Node000003" href="$dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0" title=" " alt="" coords="166,55,288,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="113,65,151,65,151,70,113,70"/>
-<area shape="rect" id="Node000004" href="$dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead" title=" " alt="" coords="161,128,293,154"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="92,79,183,119,181,124,90,83"/>
-<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="198,129,193,119,196,110,208,104,227,101,247,104,258,111,255,115,245,109,227,107,209,109,200,113,198,119,203,126"/>
-</map>
diff --git a/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.md5 b/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.md5
deleted file mode 100644
index c169cb3b8..000000000
--- a/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bed8573e13424ad534d51985174303a1
\ No newline at end of file
diff --git a/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.svg b/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.svg
deleted file mode 100644
index 535ae15e8..000000000
--- a/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.svg
+++ /dev/null
@@ -1,110 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ternary_search Pages: 1 -->
-<svg width="224pt" height="119pt"
- viewBox="0.00 0.00 223.75 119.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 115.25)">
-<title>ternary_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="80.5,-74.25 0,-74.25 0,-55 80.5,-55 80.5,-74.25"/>
-<text text-anchor="middle" x="40.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">ternary_search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="192.88,-111.25 139.38,-111.25 139.38,-92 192.88,-92 192.88,-111.25"/>
-<text text-anchor="middle" x="166.12" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.1,-74.74C91.67,-79.69 111.64,-85.65 128.56,-90.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.14,-93.93 137.73,-93.44 129.15,-87.23 127.14,-93.93"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="211.62,-74.25 120.62,-74.25 120.62,-55 211.62,-55 211.62,-74.25"/>
-<text text-anchor="middle" x="166.12" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">it_ternary_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.79,-64.62C89.75,-64.62 99.43,-64.62 108.93,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.86,-68.13 118.86,-64.63 108.86,-61.13 108.86,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.75,-19.25 116.5,-19.25 116.5,0 215.75,0 215.75,-19.25"/>
-<text text-anchor="middle" x="166.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">rec_ternary_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.97,-54.54C83.09,-46.05 110.68,-33.8 132.22,-24.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.45,-27.52 141.17,-20.26 130.61,-21.12 133.45,-27.52"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.42,-19.54C137.43,-28.15 144,-37.25 166.12,-37.25 178.23,-37.25 185.67,-34.53 188.47,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.89,-29.93 186.18,-21.01 185.08,-31.55 191.89,-29.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph_org.svg b/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph_org.svg
deleted file mode 100644
index 16a8b261c..000000000
--- a/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph_org.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ternary_search Pages: 1 -->
-<svg width="224pt" height="119pt"
- viewBox="0.00 0.00 223.75 119.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 115.25)">
-<title>ternary_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="80.5,-74.25 0,-74.25 0,-55 80.5,-55 80.5,-74.25"/>
-<text text-anchor="middle" x="40.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">ternary_search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="192.88,-111.25 139.38,-111.25 139.38,-92 192.88,-92 192.88,-111.25"/>
-<text text-anchor="middle" x="166.12" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.1,-74.74C91.67,-79.69 111.64,-85.65 128.56,-90.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.14,-93.93 137.73,-93.44 129.15,-87.23 127.14,-93.93"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="211.62,-74.25 120.62,-74.25 120.62,-55 211.62,-55 211.62,-74.25"/>
-<text text-anchor="middle" x="166.12" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">it_ternary_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.79,-64.62C89.75,-64.62 99.43,-64.62 108.93,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.86,-68.13 118.86,-64.63 108.86,-61.13 108.86,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.75,-19.25 116.5,-19.25 116.5,0 215.75,0 215.75,-19.25"/>
-<text text-anchor="middle" x="166.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">rec_ternary_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.97,-54.54C83.09,-46.05 110.68,-33.8 132.22,-24.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.45,-27.52 141.17,-20.26 130.61,-21.12 133.45,-27.52"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.42,-19.54C137.43,-28.15 144,-37.25 166.12,-37.25 178.23,-37.25 185.67,-34.53 188.47,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.89,-29.93 186.18,-21.01 185.08,-31.55 191.89,-29.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dc/dfe/ternary__search_8cpp_source.html b/dc/dfe/ternary__search_8cpp_source.html
new file mode 100644
index 000000000..61cef3c6f
--- /dev/null
+++ b/dc/dfe/ternary__search_8cpp_source.html
@@ -0,0 +1,236 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: search/ternary_search.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dc/dfe/ternary__search_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">ternary_search.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dc/dfe/ternary__search_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"><a class="line" href="../../dc/dfe/ternary__search_8cpp.html#ae01eda5098801bb6b5b778828fb4fddc">   22</a></span><span class="preprocessor">#define absolutePrecision 10</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../dc/dfe/ternary__search_8cpp.html#a23ad617bfce1e7cf4591059c85c1a027">   27</a></span><span class="preprocessor">#define _target 10</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../dc/dfe/ternary__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326">   29</a></span><span class="preprocessor">#define MAX 10000000  </span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1">   36</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1">get_input</a>() {}</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="foldopen" id="foldopen00048" data-start="{" data-end="}">
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="../../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0">   48</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0">it_ternary_search</a>(<span class="keywordtype">int</span> left, <span class="keywordtype">int</span> right, <span class="keywordtype">int</span> A[], <span class="keywordtype">int</span> target) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">while</span> (1) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordflow">if</span> (left &lt; right) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>            <span class="keywordflow">if</span> (right - left &lt; <a class="code hl_define" href="../../dc/dfe/ternary__search_8cpp.html#ae01eda5098801bb6b5b778828fb4fddc">absolutePrecision</a>) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = left; i &lt;= right; i++)</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>                    <span class="keywordflow">if</span> (A[i] == target)</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>                        <span class="keywordflow">return</span> i;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>                <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            }</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            <span class="keywordtype">int</span> oneThird = (left + right) / 3 + 1;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            <span class="keywordtype">int</span> twoThird = (left + right) * 2 / 3 + 1;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            <span class="keywordflow">if</span> (A[oneThird] == target)</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>                <span class="keywordflow">return</span> oneThird;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (A[twoThird] == target)</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>                <span class="keywordflow">return</span> twoThird;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (target &gt; A[twoThird])</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>                left = twoThird + 1;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (target &lt; A[oneThird])</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>                right = oneThird - 1;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>                left = oneThird + 1, right = twoThird - 1;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        }</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>}</div>
+</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="foldopen" id="foldopen00090" data-start="{" data-end="}">
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="../../dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead">   90</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead">rec_ternary_search</a>(<span class="keywordtype">int</span> left, <span class="keywordtype">int</span> right, <span class="keywordtype">int</span> A[], <span class="keywordtype">int</span> target) {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordflow">if</span> (left &lt; right) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        <span class="keywordflow">if</span> (right - left &lt; <a class="code hl_define" href="../../dc/dfe/ternary__search_8cpp.html#ae01eda5098801bb6b5b778828fb4fddc">absolutePrecision</a>) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = left; i &lt;= right; i++)</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>                <span class="keywordflow">if</span> (A[i] == target)</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>                    <span class="keywordflow">return</span> i;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        }</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span> </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        <span class="keywordtype">int</span> oneThird = (left + right) / 3 + 1;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        <span class="keywordtype">int</span> twoThird = (left + right) * 2 / 3 + 1;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        <span class="keywordflow">if</span> (A[oneThird] == target)</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>            <span class="keywordflow">return</span> oneThird;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        <span class="keywordflow">if</span> (A[twoThird] == target)</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>            <span class="keywordflow">return</span> twoThird;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <span class="keywordflow">if</span> (target &lt; A[oneThird])</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="../../dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead">rec_ternary_search</a>(left, oneThird - 1, A, target);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        <span class="keywordflow">if</span> (target &gt; A[twoThird])</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="../../dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead">rec_ternary_search</a>(twoThird + 1, right, A, target);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead">rec_ternary_search</a>(oneThird + 1, twoThird - 1, A, target);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    }</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>}</div>
+</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="foldopen" id="foldopen00127" data-start="{" data-end="}">
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"><a class="line" href="../../dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8">  127</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8">ternary_search</a>(<span class="keywordtype">int</span> N, <span class="keywordtype">int</span> A[], <span class="keywordtype">int</span> target) {</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    std::cout &lt;&lt; <a class="code hl_function" href="../../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0">it_ternary_search</a>(0, N - 1, A, target) &lt;&lt; <span class="charliteral">&#39;\t&#39;</span>;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    std::cout &lt;&lt; <a class="code hl_function" href="../../dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead">rec_ternary_search</a>(0, N - 1, A, target) &lt;&lt; <span class="charliteral">&#39;\t&#39;</span>;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>}</div>
+</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
+<div class="foldopen" id="foldopen00134" data-start="{" data-end="}">
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"><a class="line" href="../../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  134</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <span class="keywordtype">int</span> N = 21;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    <span class="keywordtype">int</span> A[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 10};</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <a class="code hl_function" href="../../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1">get_input</a>();</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <a class="code hl_function" href="../../dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8">ternary_search</a>(N, A, <a class="code hl_define" href="../../dc/dfe/ternary__search_8cpp.html#a23ad617bfce1e7cf4591059c85c1a027">_target</a>);</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>}</div>
+</div>
+<div class="ttc" id="aternary__search_8cpp_html_a23ad617bfce1e7cf4591059c85c1a027"><div class="ttname"><a href="../../dc/dfe/ternary__search_8cpp.html#a23ad617bfce1e7cf4591059c85c1a027">_target</a></div><div class="ttdeci">#define _target</div><div class="ttdef"><b>Definition</b> <a href="#l00027">ternary_search.cpp:27</a></div></div>
+<div class="ttc" id="aternary__search_8cpp_html_a7f7d866eccdabe51bb16818a792618b1"><div class="ttname"><a href="../../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1">get_input</a></div><div class="ttdeci">void get_input()</div><div class="ttdef"><b>Definition</b> <a href="#l00036">ternary_search.cpp:36</a></div></div>
+<div class="ttc" id="aternary__search_8cpp_html_a93d0099db95022f1eb90ddfd68f73ead"><div class="ttname"><a href="../../dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead">rec_ternary_search</a></div><div class="ttdeci">int rec_ternary_search(int left, int right, int A[], int target)</div><div class="ttdef"><b>Definition</b> <a href="#l00090">ternary_search.cpp:90</a></div></div>
+<div class="ttc" id="aternary__search_8cpp_html_ae01eda5098801bb6b5b778828fb4fddc"><div class="ttname"><a href="../../dc/dfe/ternary__search_8cpp.html#ae01eda5098801bb6b5b778828fb4fddc">absolutePrecision</a></div><div class="ttdeci">#define absolutePrecision</div><div class="ttdef"><b>Definition</b> <a href="#l00022">ternary_search.cpp:22</a></div></div>
+<div class="ttc" id="aternary__search_8cpp_html_ae30dfe2894191bfeffe5b3b1854b95b0"><div class="ttname"><a href="../../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0">it_ternary_search</a></div><div class="ttdeci">int it_ternary_search(int left, int right, int A[], int target)</div><div class="ttdef"><b>Definition</b> <a href="#l00048">ternary_search.cpp:48</a></div></div>
+<div class="ttc" id="aternary__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00134">ternary_search.cpp:134</a></div></div>
+<div class="ttc" id="aternary__search_8cpp_html_aef655a27eb82efa299bf9d0becf6e9c8"><div class="ttname"><a href="../../dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8">ternary_search</a></div><div class="ttdeci">void ternary_search(int N, int A[], int target)</div><div class="ttdef"><b>Definition</b> <a href="#l00127">ternary_search.cpp:127</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../dc/dfe/ternary__search_8cpp.html">ternary_search.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dd/d03/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree-members.html b/dd/d03/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree-members.html
index 8c90ef006..76ac8bb99 100644
--- a/dd/d03/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree-members.html
+++ b/dd/d03/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dd/d0c/hamiltons__cycle_8cpp.html b/dd/d0c/hamiltons__cycle_8cpp.html
index 1b5c4bd58..31bf59db2 100644
--- a/dd/d0c/hamiltons__cycle_8cpp.html
+++ b/dd/d0c/hamiltons__cycle_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph/hamiltons_cycle.cpp File Reference</title>
+<title>TheAlgorithms/C++: graph/hamiltons_cycle.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,10 +137,12 @@ Include dependency graph for hamiltons_cycle.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d59/hamiltons__cycle_8cpp__incl.svg" width="252" height="111"><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">
+</div>
+<p><a href="../../dd/d0c/hamiltons__cycle_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:abcf824e347eecfeeb69ea0280f34f3e4" id="r_abcf824e347eecfeeb69ea0280f34f3e4"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abcf824e347eecfeeb69ea0280f34f3e4">hamilton_cycle</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; &gt; &amp;routes)</td></tr>
+<tr class="memitem:abcf824e347eecfeeb69ea0280f34f3e4" id="r_abcf824e347eecfeeb69ea0280f34f3e4"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abcf824e347eecfeeb69ea0280f34f3e4">hamilton_cycle</a> (const std::vector&lt; std::vector&lt; bool &gt; &gt; &amp;routes)</td></tr>
 <tr class="separator:abcf824e347eecfeeb69ea0280f34f3e4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae7880ce913f3058a35ff106d5be9e243" id="r_ae7880ce913f3058a35ff106d5be9e243"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae7880ce913f3058a35ff106d5be9e243">test1</a> ()</td></tr>
 <tr class="separator:ae7880ce913f3058a35ff106d5be9e243"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -141,6 +160,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/vakhokoto" target="_blank">vakhokoto</a> </dd>
 <dd>
 <a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../dd/d0c/hamiltons__cycle_8cpp_source.html">hamiltons_cycle.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="abcf824e347eecfeeb69ea0280f34f3e4" name="abcf824e347eecfeeb69ea0280f34f3e4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#abcf824e347eecfeeb69ea0280f34f3e4">&#9670;&#160;</a></span>hamilton_cycle()</h2>
@@ -151,7 +172,7 @@ Functions</h2></td></tr>
         <tr>
           <td class="memname">bool hamilton_cycle </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>routes</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; bool &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>routes</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -166,24 +187,26 @@ Functions</h2></td></tr>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if there is Hamiltonian cycle in the graph </dd>
 <dd>
 <code>false</code> if there is no Hamiltonian cycle in the graph </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d0c/hamiltons__cycle_8cpp_source.html#l00030">30</a> of file <a class="el" href="../../dd/d0c/hamiltons__cycle_8cpp_source.html">hamiltons_cycle.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   30</span>                                                              {</div>
-<div class="line"><span class="lineno">   31</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> n = routes.<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">   31</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> n = routes.size();</div>
 <div class="line"><span class="lineno">   32</span>    <span class="comment">// height of dp array which is 2^n</span></div>
 <div class="line"><span class="lineno">   33</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> = 1 &lt;&lt; n;</div>
-<div class="line"><span class="lineno">   34</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;bool&gt;</a>&gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a>(n, <span class="keyword">false</span>));</div>
+<div class="line"><span class="lineno">   34</span>    std::vector&lt;std::vector&lt;bool&gt;&gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>, std::vector&lt;bool&gt;(n, <span class="keyword">false</span>));</div>
 <div class="line"><span class="lineno">   35</span> </div>
 <div class="line"><span class="lineno">   36</span>    <span class="comment">// to fill in the [2^i, i] cells with true</span></div>
 <div class="line"><span class="lineno">   37</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; n; ++i) {</div>
 <div class="line"><span class="lineno">   38</span>        <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[1 &lt;&lt; i][i] = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   39</span>    }</div>
 <div class="line"><span class="lineno">   40</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 1; i &lt; <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>; i++) {</div>
-<div class="line"><span class="lineno">   41</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;size_t&gt;</a> zeros, ones;</div>
+<div class="line"><span class="lineno">   41</span>        std::vector&lt;size_t&gt; zeros, ones;</div>
 <div class="line"><span class="lineno">   42</span>        <span class="comment">// finding positions with 1s and 0s and separate them</span></div>
 <div class="line"><span class="lineno">   43</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> pos = 0; pos &lt; n; ++pos) {</div>
 <div class="line"><span class="lineno">   44</span>            <span class="keywordflow">if</span> ((1 &lt;&lt; pos) &amp; i) {</div>
-<div class="line"><span class="lineno">   45</span>                ones.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(pos);</div>
+<div class="line"><span class="lineno">   45</span>                ones.push_back(pos);</div>
 <div class="line"><span class="lineno">   46</span>            } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   47</span>                zeros.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(pos);</div>
+<div class="line"><span class="lineno">   47</span>                zeros.push_back(pos);</div>
 <div class="line"><span class="lineno">   48</span>            }</div>
 <div class="line"><span class="lineno">   49</span>        }</div>
 <div class="line"><span class="lineno">   50</span> </div>
@@ -211,17 +234,9 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   72</span>    }</div>
 <div class="line"><span class="lineno">   73</span>    <span class="keywordflow">return</span> is_cycle;</div>
 <div class="line"><span class="lineno">   74</span>}</div>
-<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition</b> avltree.cpp:38</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="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="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>
-</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="../../dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.svg" width="442" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00038">avltree.cpp:38</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> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a3c04138a5bfe5d72780bb7e82a18e627" name="a3c04138a5bfe5d72780bb7e82a18e627"></a>
@@ -250,21 +265,18 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d0c/hamiltons__cycle_8cpp_source.html#l00142">142</a> of file <a class="el" href="../../dd/d0c/hamiltons__cycle_8cpp_source.html">hamiltons_cycle.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  142</span>                                {</div>
 <div class="line"><span class="lineno">  143</span>    <a class="code hl_function" href="#ae7880ce913f3058a35ff106d5be9e243">test1</a>();</div>
 <div class="line"><span class="lineno">  144</span>    <a class="code hl_function" href="#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>();</div>
 <div class="line"><span class="lineno">  145</span>    <a class="code hl_function" href="#a0cc94918b6831f308d4fe4fa27f08299">test3</a>();</div>
 <div class="line"><span class="lineno">  146</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  147</span>}</div>
-<div class="ttc" id="ahamiltons__cycle_8cpp_html_a0cc94918b6831f308d4fe4fa27f08299"><div class="ttname"><a href="#a0cc94918b6831f308d4fe4fa27f08299">test3</a></div><div class="ttdeci">static void test3()</div><div class="ttdef"><b>Definition</b> hamiltons_cycle.cpp:122</div></div>
-<div class="ttc" id="ahamiltons__cycle_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdef"><b>Definition</b> hamiltons_cycle.cpp:103</div></div>
-<div class="ttc" id="ahamiltons__cycle_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdef"><b>Definition</b> hamiltons_cycle.cpp:81</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg" width="638" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ahamiltons__cycle_8cpp_html_a0cc94918b6831f308d4fe4fa27f08299"><div class="ttname"><a href="#a0cc94918b6831f308d4fe4fa27f08299">test3</a></div><div class="ttdeci">static void test3()</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d0c/hamiltons__cycle_8cpp_source.html#l00122">hamiltons_cycle.cpp:122</a></div></div>
+<div class="ttc" id="ahamiltons__cycle_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d0c/hamiltons__cycle_8cpp_source.html#l00103">hamiltons_cycle.cpp:103</a></div></div>
+<div class="ttc" id="ahamiltons__cycle_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d0c/hamiltons__cycle_8cpp_source.html#l00081">hamiltons_cycle.cpp:81</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae7880ce913f3058a35ff106d5be9e243" name="ae7880ce913f3058a35ff106d5be9e243"></a>
@@ -290,26 +302,22 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>this test is testing if <a class="el" href="#abcf824e347eecfeeb69ea0280f34f3e4">hamilton_cycle</a> returns <code>true</code> for graph: <code>1 -&gt; 2 -&gt; 3 -&gt; 4</code> </p><dl class="section return"><dt>Returns</dt><dd>None </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d0c/hamiltons__cycle_8cpp_source.html#l00081">81</a> of file <a class="el" href="../../dd/d0c/hamiltons__cycle_8cpp_source.html">hamiltons_cycle.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   81</span>                    {</div>
-<div class="line"><span class="lineno">   82</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;bool&gt;</a>&gt; arr{</div>
-<div class="line"><span class="lineno">   83</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a>({<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">false</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&lt;bool&gt;</a>({<span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">false</span>}),</div>
-<div class="line"><span class="lineno">   85</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a>({<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">true</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&lt;bool&gt;</a>({<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>})};</div>
+<div class="line"><span class="lineno">   82</span>    std::vector&lt;std::vector&lt;bool&gt;&gt; arr{</div>
+<div class="line"><span class="lineno">   83</span>        std::vector&lt;bool&gt;({<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">false</span>}),</div>
+<div class="line"><span class="lineno">   84</span>        std::vector&lt;bool&gt;({<span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">false</span>}),</div>
+<div class="line"><span class="lineno">   85</span>        std::vector&lt;bool&gt;({<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">true</span>}),</div>
+<div class="line"><span class="lineno">   86</span>        std::vector&lt;bool&gt;({<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>})};</div>
 <div class="line"><span class="lineno">   87</span> </div>
 <div class="line"><span class="lineno">   88</span>    <span class="keywordtype">bool</span> ans = <a class="code hl_function" href="#abcf824e347eecfeeb69ea0280f34f3e4">hamilton_cycle</a>(arr);</div>
-<div class="line"><span class="lineno">   89</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
+<div class="line"><span class="lineno">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
 <div class="line"><span class="lineno">   90</span>    assert(ans);</div>
-<div class="line"><span class="lineno">   91</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   91</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   92</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="ahamiltons__cycle_8cpp_html_abcf824e347eecfeeb69ea0280f34f3e4"><div class="ttname"><a href="#abcf824e347eecfeeb69ea0280f34f3e4">hamilton_cycle</a></div><div class="ttdeci">bool hamilton_cycle(const std::vector&lt; std::vector&lt; bool &gt; &gt; &amp;routes)</div><div class="ttdef"><b>Definition</b> hamiltons_cycle.cpp:30</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg" width="540" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ahamiltons__cycle_8cpp_html_abcf824e347eecfeeb69ea0280f34f3e4"><div class="ttname"><a href="#abcf824e347eecfeeb69ea0280f34f3e4">hamilton_cycle</a></div><div class="ttdeci">bool hamilton_cycle(const std::vector&lt; std::vector&lt; bool &gt; &gt; &amp;routes)</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d0c/hamiltons__cycle_8cpp_source.html#l00030">hamiltons_cycle.cpp:30</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a45d94ead4cf4e1ff9f87c38bc99f59ae" name="a45d94ead4cf4e1ff9f87c38bc99f59ae"></a>
@@ -340,25 +348,22 @@ Here is the call graph for this function:</div>
       |
       V
       4</pre> <dl class="section return"><dt>Returns</dt><dd>None </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d0c/hamiltons__cycle_8cpp_source.html#l00103">103</a> of file <a class="el" href="../../dd/d0c/hamiltons__cycle_8cpp_source.html">hamiltons_cycle.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  103</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&lt;std::vector&lt;bool&gt;</a>&gt; arr{</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&lt;bool&gt;</a>({<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">false</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&lt;bool&gt;</a>({<span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>}),</div>
-<div class="line"><span class="lineno">  107</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a>({<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">false</span>}),</div>
-<div class="line"><span class="lineno">  108</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a>({<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>})};</div>
+<div class="line"><span class="lineno">  104</span>    std::vector&lt;std::vector&lt;bool&gt;&gt; arr{</div>
+<div class="line"><span class="lineno">  105</span>        std::vector&lt;bool&gt;({<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">false</span>}),</div>
+<div class="line"><span class="lineno">  106</span>        std::vector&lt;bool&gt;({<span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>}),</div>
+<div class="line"><span class="lineno">  107</span>        std::vector&lt;bool&gt;({<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">false</span>}),</div>
+<div class="line"><span class="lineno">  108</span>        std::vector&lt;bool&gt;({<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>})};</div>
 <div class="line"><span class="lineno">  109</span> </div>
 <div class="line"><span class="lineno">  110</span>    <span class="keywordtype">bool</span> ans = <a class="code hl_function" href="#abcf824e347eecfeeb69ea0280f34f3e4">hamilton_cycle</a>(arr);</div>
 <div class="line"><span class="lineno">  111</span> </div>
-<div class="line"><span class="lineno">  112</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
+<div class="line"><span class="lineno">  112</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
 <div class="line"><span class="lineno">  113</span>    assert(!ans);  <span class="comment">// not a cycle</span></div>
-<div class="line"><span class="lineno">  114</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  115</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg" width="540" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0cc94918b6831f308d4fe4fa27f08299" name="a0cc94918b6831f308d4fe4fa27f08299"></a>
@@ -384,25 +389,22 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>this test is testing if <a class="el" href="#abcf824e347eecfeeb69ea0280f34f3e4">hamilton_cycle</a> returns <code>true</code> for clique with 4 vertices </p><dl class="section return"><dt>Returns</dt><dd>None </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d0c/hamiltons__cycle_8cpp_source.html#l00122">122</a> of file <a class="el" href="../../dd/d0c/hamiltons__cycle_8cpp_source.html">hamiltons_cycle.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  122</span>                    {</div>
-<div class="line"><span class="lineno">  123</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;bool&gt;</a>&gt; arr{</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&lt;bool&gt;</a>({<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>}),</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&lt;bool&gt;</a>({<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>}),</div>
-<div class="line"><span class="lineno">  126</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a>({<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>}),</div>
-<div class="line"><span class="lineno">  127</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a>({<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>})};</div>
+<div class="line"><span class="lineno">  123</span>    std::vector&lt;std::vector&lt;bool&gt;&gt; arr{</div>
+<div class="line"><span class="lineno">  124</span>        std::vector&lt;bool&gt;({<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>}),</div>
+<div class="line"><span class="lineno">  125</span>        std::vector&lt;bool&gt;({<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>}),</div>
+<div class="line"><span class="lineno">  126</span>        std::vector&lt;bool&gt;({<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>}),</div>
+<div class="line"><span class="lineno">  127</span>        std::vector&lt;bool&gt;({<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>})};</div>
 <div class="line"><span class="lineno">  128</span> </div>
 <div class="line"><span class="lineno">  129</span>    <span class="keywordtype">bool</span> ans = <a class="code hl_function" href="#abcf824e347eecfeeb69ea0280f34f3e4">hamilton_cycle</a>(arr);</div>
 <div class="line"><span class="lineno">  130</span> </div>
-<div class="line"><span class="lineno">  131</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
+<div class="line"><span class="lineno">  131</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
 <div class="line"><span class="lineno">  132</span>    assert(ans);</div>
-<div class="line"><span class="lineno">  133</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  133</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  134</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.svg" width="540" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.map b/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.map
deleted file mode 100644
index ba0f1d6f1..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="test3" name="test3">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,56,80"/>
-<area shape="rect" id="Node000002" href="$dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" title=" " alt="" coords="104,55,212,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,65,88,65,88,70,56,70"/>
-<area shape="rect" id="Node000003" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="309,29,365,55"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="212,57,293,46,294,51,213,62"/>
-<area shape="rect" id="Node000005" 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="260,79,414,104"/>
-<area shape="poly" id="edge5_Node000002_Node000005" title=" " alt="" coords="213,72,245,76,244,82,212,77"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="310,30,304,21,308,11,319,5,337,3,357,5,367,12,364,16,355,10,337,8,320,10,312,15,310,20,314,28"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="462,29,535,55"/>
-<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="366,40,447,40,447,45,366,45"/>
-</map>
diff --git a/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.md5 b/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.md5
deleted file mode 100644
index 76b512b67..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-054d18d4c71b0dfd606db7a2a6cd588b
\ No newline at end of file
diff --git a/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.svg b/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.svg
deleted file mode 100644
index 8e9a7436f..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph.svg
+++ /dev/null
@@ -1,128 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<svg width="405pt" height="82pt"
- viewBox="0.00 0.00 405.00 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155,-37.25 73.75,-37.25 73.75,-18 155,-18 155,-37.25"/>
-<text text-anchor="middle" x="114.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">hamilton_cycle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.9,-27.62C44.91,-27.62 53.33,-27.62 61.96,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.82,-31.13 71.82,-27.63 61.82,-24.13 61.82,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270,-56.25 227.75,-56.25 227.75,-37 270,-37 270,-56.25"/>
-<text text-anchor="middle" x="248.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.49,-33.38C174.98,-36.17 198.07,-39.48 216.29,-42.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.58,-45.53 225.98,-43.48 216.58,-38.6 215.58,-45.53"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306.75,-19.25 191,-19.25 191,0 306.75,0 306.75,-19.25"/>
-<text text-anchor="middle" x="248.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.49,-22.18C163.13,-21.14 171.33,-20.02 179.57,-18.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.85,-22.4 189.29,-17.58 178.91,-15.46 179.85,-22.4"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.93,-56.54C221.29,-65.15 227.61,-74.25 248.88,-74.25 260.51,-74.25 267.67,-71.53 270.35,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.79,-66.99 268.15,-58.01 266.97,-68.54 273.79,-66.99"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397,-56.25 342.75,-56.25 342.75,-37 397,-37 397,-56.25"/>
-<text text-anchor="middle" x="369.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.33,-46.62C287,-46.62 310.98,-46.62 331.11,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="330.92,-50.13 340.92,-46.63 330.92,-43.13 330.92,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph_org.svg b/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph_org.svg
deleted file mode 100644
index 91f3a673b..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_a0cc94918b6831f308d4fe4fa27f08299_cgraph_org.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test3 Pages: 1 -->
-<svg width="405pt" height="82pt"
- viewBox="0.00 0.00 405.00 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>test3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155,-37.25 73.75,-37.25 73.75,-18 155,-18 155,-37.25"/>
-<text text-anchor="middle" x="114.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">hamilton_cycle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.9,-27.62C44.91,-27.62 53.33,-27.62 61.96,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.82,-31.13 71.82,-27.63 61.82,-24.13 61.82,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270,-56.25 227.75,-56.25 227.75,-37 270,-37 270,-56.25"/>
-<text text-anchor="middle" x="248.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.49,-33.38C174.98,-36.17 198.07,-39.48 216.29,-42.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.58,-45.53 225.98,-43.48 216.58,-38.6 215.58,-45.53"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306.75,-19.25 191,-19.25 191,0 306.75,0 306.75,-19.25"/>
-<text text-anchor="middle" x="248.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.49,-22.18C163.13,-21.14 171.33,-20.02 179.57,-18.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.85,-22.4 189.29,-17.58 178.91,-15.46 179.85,-22.4"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.93,-56.54C221.29,-65.15 227.61,-74.25 248.88,-74.25 260.51,-74.25 267.67,-71.53 270.35,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.79,-66.99 268.15,-58.01 266.97,-68.54 273.79,-66.99"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397,-56.25 342.75,-56.25 342.75,-37 397,-37 397,-56.25"/>
-<text text-anchor="middle" x="369.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.33,-46.62C287,-46.62 310.98,-46.62 331.11,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="330.92,-50.13 340.92,-46.63 330.92,-43.13 330.92,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
deleted file mode 100644
index f7b1e8398..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
+++ /dev/null
@@ -1,20 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,55,80"/>
-<area shape="rect" id="Node000002" href="$dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" title=" " alt="" coords="103,5,153,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,53,88,35,90,40,56,58"/>
-<area shape="rect" id="Node000007" href="$dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" title=" " alt="" coords="103,55,153,80"/>
-<area shape="poly" id="edge7_Node000001_Node000007" title=" " alt="" coords="55,65,88,65,88,70,55,70"/>
-<area shape="rect" id="Node000008" href="$dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299" title=" " alt="" coords="103,104,153,130"/>
-<area shape="poly" id="edge9_Node000001_Node000008" title=" " alt="" coords="56,77,90,95,88,100,54,82"/>
-<area shape="rect" id="Node000003" href="$dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" title=" " alt="" coords="201,55,309,80"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="154,25,207,46,205,51,152,30"/>
-<area shape="rect" id="Node000004" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="406,29,463,55"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="310,57,391,46,391,51,310,62"/>
-<area shape="rect" id="Node000006" 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="357,79,512,104"/>
-<area shape="poly" id="edge6_Node000003_Node000006" title=" " alt="" coords="310,72,342,76,342,82,310,77"/>
-<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="407,30,402,21,405,11,416,5,435,3,454,5,465,12,462,16,452,10,434,8,418,10,409,15,407,20,412,28"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="560,29,632,55"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="463,40,544,40,544,45,463,45"/>
-<area shape="poly" id="edge8_Node000007_Node000003" title=" " alt="" coords="153,65,185,65,185,70,153,70"/>
-<area shape="poly" id="edge10_Node000008_Node000003" title=" " alt="" coords="152,105,205,84,207,89,154,110"/>
-</map>
diff --git a/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
deleted file mode 100644
index ea42e5c26..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6ecb8d665924611cb13dd8de8254c8fd
\ No newline at end of file
diff --git a/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
deleted file mode 100644
index dea3e1030..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
+++ /dev/null
@@ -1,200 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="478pt" height="101pt"
- viewBox="0.00 0.00 478.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-93.25 73,-93.25 73,-74 110.75,-74 110.75,-93.25"/>
-<text text-anchor="middle" x="91.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-55.77C44.89,-59.79 54.18,-64.6 62.84,-69.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.11,-72.14 71.6,-73.63 64.33,-65.92 61.11,-72.14"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-56.25 73,-56.25 73,-37 110.75,-37 110.75,-56.25"/>
-<text text-anchor="middle" x="91.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-46.62C44.55,-46.62 53.37,-46.62 61.69,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-50.13 71.43,-46.63 61.43,-43.13 61.43,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge9_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge9_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-37.48C44.89,-33.46 54.18,-28.65 62.84,-24.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.33,-27.33 71.6,-19.62 61.11,-21.11 64.33,-27.33"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228,-56.25 146.75,-56.25 146.75,-37 228,-37 228,-56.25"/>
-<text text-anchor="middle" x="187.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">hamilton_cycle</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.9,-76.49C122.12,-72.05 136.95,-66.18 150.49,-60.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.56,-64.17 159.57,-57.23 148.99,-57.66 151.56,-64.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="343,-75.25 300.75,-75.25 300.75,-56 343,-56 343,-75.25"/>
-<text text-anchor="middle" x="321.88" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.49,-52.38C247.98,-55.17 271.07,-58.48 289.29,-61.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.58,-64.53 298.98,-62.48 289.58,-57.6 288.58,-64.53"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="379.75,-38.25 264,-38.25 264,-19 379.75,-19 379.75,-38.25"/>
-<text text-anchor="middle" x="321.88" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.49,-41.18C236.13,-40.14 244.33,-39.02 252.57,-37.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="252.85,-41.4 262.29,-36.58 251.91,-34.46 252.85,-41.4"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.93,-75.54C294.29,-84.15 300.61,-93.25 321.88,-93.25 333.51,-93.25 340.67,-90.53 343.35,-86.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="346.79,-85.99 341.15,-77.01 339.97,-87.54 346.79,-85.99"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="470,-75.25 415.75,-75.25 415.75,-56 470,-56 470,-75.25"/>
-<text text-anchor="middle" x="442.88" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.33,-65.62C360,-65.62 383.98,-65.62 404.11,-65.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="403.92,-69.13 413.92,-65.63 403.92,-62.13 403.92,-69.13"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge8_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge8_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.9,-46.62C117.91,-46.62 126.33,-46.62 134.96,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.82,-50.13 144.82,-46.63 134.82,-43.13 134.82,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node3 -->
-<g id="edge10_Node000008_Node000003" class="edge">
-<title>Node8&#45;&gt;Node3</title>
-<g id="a_edge10_Node000008_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.9,-16.76C122.12,-21.2 136.95,-27.07 150.49,-32.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.99,-35.59 159.57,-36.02 151.56,-29.08 148.99,-35.59"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
deleted file mode 100644
index a46f87052..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
+++ /dev/null
@@ -1,174 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="478pt" height="101pt"
- viewBox="0.00 0.00 478.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-93.25 73,-93.25 73,-74 110.75,-74 110.75,-93.25"/>
-<text text-anchor="middle" x="91.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-55.77C44.89,-59.79 54.18,-64.6 62.84,-69.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.11,-72.14 71.6,-73.63 64.33,-65.92 61.11,-72.14"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-56.25 73,-56.25 73,-37 110.75,-37 110.75,-56.25"/>
-<text text-anchor="middle" x="91.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-46.62C44.55,-46.62 53.37,-46.62 61.69,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-50.13 71.43,-46.63 61.43,-43.13 61.43,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-19.25 73,-19.25 73,0 110.75,0 110.75,-19.25"/>
-<text text-anchor="middle" x="91.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge9_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge9_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-37.48C44.89,-33.46 54.18,-28.65 62.84,-24.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.33,-27.33 71.6,-19.62 61.11,-21.11 64.33,-27.33"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228,-56.25 146.75,-56.25 146.75,-37 228,-37 228,-56.25"/>
-<text text-anchor="middle" x="187.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">hamilton_cycle</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.9,-76.49C122.12,-72.05 136.95,-66.18 150.49,-60.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.56,-64.17 159.57,-57.23 148.99,-57.66 151.56,-64.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="343,-75.25 300.75,-75.25 300.75,-56 343,-56 343,-75.25"/>
-<text text-anchor="middle" x="321.88" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.49,-52.38C247.98,-55.17 271.07,-58.48 289.29,-61.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.58,-64.53 298.98,-62.48 289.58,-57.6 288.58,-64.53"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="379.75,-38.25 264,-38.25 264,-19 379.75,-19 379.75,-38.25"/>
-<text text-anchor="middle" x="321.88" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge6_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge6_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M228.49,-41.18C236.13,-40.14 244.33,-39.02 252.57,-37.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="252.85,-41.4 262.29,-36.58 251.91,-34.46 252.85,-41.4"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.93,-75.54C294.29,-84.15 300.61,-93.25 321.88,-93.25 333.51,-93.25 340.67,-90.53 343.35,-86.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="346.79,-85.99 341.15,-77.01 339.97,-87.54 346.79,-85.99"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="470,-75.25 415.75,-75.25 415.75,-56 470,-56 470,-75.25"/>
-<text text-anchor="middle" x="442.88" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M343.33,-65.62C360,-65.62 383.98,-65.62 404.11,-65.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="403.92,-69.13 413.92,-65.63 403.92,-62.13 403.92,-69.13"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge8_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge8_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.9,-46.62C117.91,-46.62 126.33,-46.62 134.96,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.82,-50.13 144.82,-46.63 134.82,-43.13 134.82,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node3 -->
-<g id="edge10_Node000008_Node000003" class="edge">
-<title>Node8&#45;&gt;Node3</title>
-<g id="a_edge10_Node000008_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.9,-16.76C122.12,-21.2 136.95,-27.07 150.49,-32.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.99,-35.59 159.57,-36.02 151.56,-29.08 148.99,-35.59"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.map b/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.map
deleted file mode 100644
index 8d65af493..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="test2" name="test2">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,56,80"/>
-<area shape="rect" id="Node000002" href="$dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" title=" " alt="" coords="104,55,212,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,65,88,65,88,70,56,70"/>
-<area shape="rect" id="Node000003" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="309,29,365,55"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="212,57,293,46,294,51,213,62"/>
-<area shape="rect" id="Node000005" 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="260,79,414,104"/>
-<area shape="poly" id="edge5_Node000002_Node000005" title=" " alt="" coords="213,72,245,76,244,82,212,77"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="310,30,304,21,308,11,319,5,337,3,357,5,367,12,364,16,355,10,337,8,320,10,312,15,310,20,314,28"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="462,29,535,55"/>
-<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="366,40,447,40,447,45,366,45"/>
-</map>
diff --git a/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.md5 b/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.md5
deleted file mode 100644
index 60504ad39..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c73242ba7c328de880477ec7115b6673
\ No newline at end of file
diff --git a/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg b/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg
deleted file mode 100644
index 20d8e2dba..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg
+++ /dev/null
@@ -1,128 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="405pt" height="82pt"
- viewBox="0.00 0.00 405.00 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155,-37.25 73.75,-37.25 73.75,-18 155,-18 155,-37.25"/>
-<text text-anchor="middle" x="114.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">hamilton_cycle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.9,-27.62C44.91,-27.62 53.33,-27.62 61.96,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.82,-31.13 71.82,-27.63 61.82,-24.13 61.82,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270,-56.25 227.75,-56.25 227.75,-37 270,-37 270,-56.25"/>
-<text text-anchor="middle" x="248.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.49,-33.38C174.98,-36.17 198.07,-39.48 216.29,-42.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.58,-45.53 225.98,-43.48 216.58,-38.6 215.58,-45.53"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306.75,-19.25 191,-19.25 191,0 306.75,0 306.75,-19.25"/>
-<text text-anchor="middle" x="248.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.49,-22.18C163.13,-21.14 171.33,-20.02 179.57,-18.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.85,-22.4 189.29,-17.58 178.91,-15.46 179.85,-22.4"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.93,-56.54C221.29,-65.15 227.61,-74.25 248.88,-74.25 260.51,-74.25 267.67,-71.53 270.35,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.79,-66.99 268.15,-58.01 266.97,-68.54 273.79,-66.99"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397,-56.25 342.75,-56.25 342.75,-37 397,-37 397,-56.25"/>
-<text text-anchor="middle" x="369.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.33,-46.62C287,-46.62 310.98,-46.62 331.11,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="330.92,-50.13 340.92,-46.63 330.92,-43.13 330.92,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg b/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg
deleted file mode 100644
index 3ce50f85a..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="405pt" height="82pt"
- viewBox="0.00 0.00 405.00 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155,-37.25 73.75,-37.25 73.75,-18 155,-18 155,-37.25"/>
-<text text-anchor="middle" x="114.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">hamilton_cycle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.9,-27.62C44.91,-27.62 53.33,-27.62 61.96,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.82,-31.13 71.82,-27.63 61.82,-24.13 61.82,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270,-56.25 227.75,-56.25 227.75,-37 270,-37 270,-56.25"/>
-<text text-anchor="middle" x="248.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.49,-33.38C174.98,-36.17 198.07,-39.48 216.29,-42.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.58,-45.53 225.98,-43.48 216.58,-38.6 215.58,-45.53"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306.75,-19.25 191,-19.25 191,0 306.75,0 306.75,-19.25"/>
-<text text-anchor="middle" x="248.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.49,-22.18C163.13,-21.14 171.33,-20.02 179.57,-18.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.85,-22.4 189.29,-17.58 178.91,-15.46 179.85,-22.4"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.93,-56.54C221.29,-65.15 227.61,-74.25 248.88,-74.25 260.51,-74.25 267.67,-71.53 270.35,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.79,-66.99 268.15,-58.01 266.97,-68.54 273.79,-66.99"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397,-56.25 342.75,-56.25 342.75,-37 397,-37 397,-56.25"/>
-<text text-anchor="middle" x="369.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.33,-46.62C287,-46.62 310.98,-46.62 331.11,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="330.92,-50.13 340.92,-46.63 330.92,-43.13 330.92,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.map b/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.map
deleted file mode 100644
index 2b6fdaa61..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="hamilton_cycle" name="hamilton_cycle">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,114,80"/>
-<area shape="rect" id="Node000002" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="211,29,267,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="114,57,195,46,196,51,115,62"/>
-<area shape="rect" id="Node000004" 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="162,79,316,104"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="115,72,147,76,146,82,114,77"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="211,30,206,21,209,11,220,5,239,3,259,5,269,12,266,16,257,10,239,8,222,10,213,15,211,20,216,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="364,29,436,55"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="267,40,348,40,348,45,267,45"/>
-</map>
diff --git a/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.md5 b/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.md5
deleted file mode 100644
index 5ef745784..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-79190585701eca9074f0e0ae40b0bfd8
\ No newline at end of file
diff --git a/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.svg b/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.svg
deleted file mode 100644
index 0abb4cebe..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph.svg
+++ /dev/null
@@ -1,110 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hamilton_cycle Pages: 1 -->
-<svg width="331pt" height="82pt"
- viewBox="0.00 0.00 331.25 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>hamilton_cycle</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="81.25,-37.25 0,-37.25 0,-18 81.25,-18 81.25,-37.25"/>
-<text text-anchor="middle" x="40.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">hamilton_cycle</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.25,-56.25 154,-56.25 154,-37 196.25,-37 196.25,-56.25"/>
-<text text-anchor="middle" x="175.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.74,-33.38C101.23,-36.17 124.32,-39.48 142.54,-42.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.83,-45.53 152.23,-43.48 142.83,-38.6 141.83,-45.53"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-19.25 117.25,-19.25 117.25,0 233,0 233,-19.25"/>
-<text text-anchor="middle" x="175.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.74,-22.18C89.38,-21.14 97.58,-20.02 105.82,-18.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.1,-22.4 115.54,-17.58 105.16,-15.46 106.1,-22.4"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.18,-56.54C147.54,-65.15 153.86,-74.25 175.12,-74.25 186.76,-74.25 193.92,-71.53 196.6,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.04,-66.99 194.4,-58.01 193.22,-68.54 200.04,-66.99"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="323.25,-56.25 269,-56.25 269,-37 323.25,-37 323.25,-56.25"/>
-<text text-anchor="middle" x="296.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M196.58,-46.62C213.25,-46.62 237.23,-46.62 257.36,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.17,-50.13 267.17,-46.63 257.17,-43.13 257.17,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph_org.svg b/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph_org.svg
deleted file mode 100644
index 8cb37b622..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_abcf824e347eecfeeb69ea0280f34f3e4_cgraph_org.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hamilton_cycle Pages: 1 -->
-<svg width="331pt" height="82pt"
- viewBox="0.00 0.00 331.25 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>hamilton_cycle</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="81.25,-37.25 0,-37.25 0,-18 81.25,-18 81.25,-37.25"/>
-<text text-anchor="middle" x="40.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">hamilton_cycle</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.25,-56.25 154,-56.25 154,-37 196.25,-37 196.25,-56.25"/>
-<text text-anchor="middle" x="175.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.74,-33.38C101.23,-36.17 124.32,-39.48 142.54,-42.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.83,-45.53 152.23,-43.48 142.83,-38.6 141.83,-45.53"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233,-19.25 117.25,-19.25 117.25,0 233,0 233,-19.25"/>
-<text text-anchor="middle" x="175.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M81.74,-22.18C89.38,-21.14 97.58,-20.02 105.82,-18.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.1,-22.4 115.54,-17.58 105.16,-15.46 106.1,-22.4"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.18,-56.54C147.54,-65.15 153.86,-74.25 175.12,-74.25 186.76,-74.25 193.92,-71.53 196.6,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.04,-66.99 194.4,-58.01 193.22,-68.54 200.04,-66.99"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="323.25,-56.25 269,-56.25 269,-37 323.25,-37 323.25,-56.25"/>
-<text text-anchor="middle" x="296.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M196.58,-46.62C213.25,-46.62 237.23,-46.62 257.36,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="257.17,-50.13 267.17,-46.63 257.17,-43.13 257.17,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map b/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map
deleted file mode 100644
index 0e6c5a593..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="test1" name="test1">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,56,80"/>
-<area shape="rect" id="Node000002" href="$dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" title=" " alt="" coords="104,55,212,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,65,88,65,88,70,56,70"/>
-<area shape="rect" id="Node000003" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="309,29,365,55"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="212,57,293,46,294,51,213,62"/>
-<area shape="rect" id="Node000005" 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="260,79,414,104"/>
-<area shape="poly" id="edge5_Node000002_Node000005" title=" " alt="" coords="213,72,245,76,244,82,212,77"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="310,30,304,21,308,11,319,5,337,3,357,5,367,12,364,16,355,10,337,8,320,10,312,15,310,20,314,28"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="462,29,535,55"/>
-<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="366,40,447,40,447,45,366,45"/>
-</map>
diff --git a/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5 b/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5
deleted file mode 100644
index fb79b3886..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-457fcc21c15ac4cb4775f4f00aa99945
\ No newline at end of file
diff --git a/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg b/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg
deleted file mode 100644
index bc9668b9c..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg
+++ /dev/null
@@ -1,128 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="405pt" height="82pt"
- viewBox="0.00 0.00 405.00 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155,-37.25 73.75,-37.25 73.75,-18 155,-18 155,-37.25"/>
-<text text-anchor="middle" x="114.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">hamilton_cycle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.9,-27.62C44.91,-27.62 53.33,-27.62 61.96,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.82,-31.13 71.82,-27.63 61.82,-24.13 61.82,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270,-56.25 227.75,-56.25 227.75,-37 270,-37 270,-56.25"/>
-<text text-anchor="middle" x="248.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.49,-33.38C174.98,-36.17 198.07,-39.48 216.29,-42.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.58,-45.53 225.98,-43.48 216.58,-38.6 215.58,-45.53"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306.75,-19.25 191,-19.25 191,0 306.75,0 306.75,-19.25"/>
-<text text-anchor="middle" x="248.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.49,-22.18C163.13,-21.14 171.33,-20.02 179.57,-18.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.85,-22.4 189.29,-17.58 178.91,-15.46 179.85,-22.4"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.93,-56.54C221.29,-65.15 227.61,-74.25 248.88,-74.25 260.51,-74.25 267.67,-71.53 270.35,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.79,-66.99 268.15,-58.01 266.97,-68.54 273.79,-66.99"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397,-56.25 342.75,-56.25 342.75,-37 397,-37 397,-56.25"/>
-<text text-anchor="middle" x="369.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.33,-46.62C287,-46.62 310.98,-46.62 331.11,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="330.92,-50.13 340.92,-46.63 330.92,-43.13 330.92,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg b/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg
deleted file mode 100644
index 1eb35c41f..000000000
--- a/dd/d0c/hamiltons__cycle_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="405pt" height="82pt"
- viewBox="0.00 0.00 405.00 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
-<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="155,-37.25 73.75,-37.25 73.75,-18 155,-18 155,-37.25"/>
-<text text-anchor="middle" x="114.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">hamilton_cycle</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.9,-27.62C44.91,-27.62 53.33,-27.62 61.96,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.82,-31.13 71.82,-27.63 61.82,-24.13 61.82,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270,-56.25 227.75,-56.25 227.75,-37 270,-37 270,-56.25"/>
-<text text-anchor="middle" x="248.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.49,-33.38C174.98,-36.17 198.07,-39.48 216.29,-42.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.58,-45.53 225.98,-43.48 216.58,-38.6 215.58,-45.53"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306.75,-19.25 191,-19.25 191,0 306.75,0 306.75,-19.25"/>
-<text text-anchor="middle" x="248.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge5_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge5_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M155.49,-22.18C163.13,-21.14 171.33,-20.02 179.57,-18.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.85,-22.4 189.29,-17.58 178.91,-15.46 179.85,-22.4"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.93,-56.54C221.29,-65.15 227.61,-74.25 248.88,-74.25 260.51,-74.25 267.67,-71.53 270.35,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.79,-66.99 268.15,-58.01 266.97,-68.54 273.79,-66.99"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397,-56.25 342.75,-56.25 342.75,-37 397,-37 397,-56.25"/>
-<text text-anchor="middle" x="369.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.33,-46.62C287,-46.62 310.98,-46.62 331.11,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="330.92,-50.13 340.92,-46.63 330.92,-43.13 330.92,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d0c/hamiltons__cycle_8cpp_source.html b/dd/d0c/hamiltons__cycle_8cpp_source.html
new file mode 100644
index 000000000..83b08e874
--- /dev/null
+++ b/dd/d0c/hamiltons__cycle_8cpp_source.html
@@ -0,0 +1,252 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/hamiltons_cycle.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dd/d0c/hamiltons__cycle_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">hamiltons_cycle.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dd/d0c/hamiltons__cycle_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="foldopen" id="foldopen00030" data-start="{" data-end="}">
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"><a class="line" href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4">   30</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4">hamilton_cycle</a>(<span class="keyword">const</span> std::vector&lt;std::vector&lt;bool&gt;&gt; &amp;routes) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> n = routes.size();</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="comment">// height of dp array which is 2^n</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keyword">const</span> <span class="keywordtype">size_t</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> = 1 &lt;&lt; n;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    std::vector&lt;std::vector&lt;bool&gt;&gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>, std::vector&lt;bool&gt;(n, <span class="keyword">false</span>));</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="comment">// to fill in the [2^i, i] cells with true</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; n; ++i) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[1 &lt;&lt; i][i] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    }</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 1; i &lt; <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>; i++) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        std::vector&lt;size_t&gt; zeros, ones;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        <span class="comment">// finding positions with 1s and 0s and separate them</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> pos = 0; pos &lt; n; ++pos) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>            <span class="keywordflow">if</span> ((1 &lt;&lt; pos) &amp; i) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>                ones.push_back(pos);</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>                zeros.push_back(pos);</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;o : ones) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            <span class="keywordflow">if</span> (!<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i][o]) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>                <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;z : zeros) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>                <span class="keywordflow">if</span> (!routes[o][z]) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>                    <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>                }</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>                <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[i + (1 &lt;&lt; z)][z] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            }</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        }</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordtype">bool</span> is_cycle = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        is_cycle |= <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> - 1][i];</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        <span class="keywordflow">if</span> (is_cycle) {  <span class="comment">// if true, all subsequent loop will be true. hence</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>                         <span class="comment">// break</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    }</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">return</span> is_cycle;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>}</div>
+</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="foldopen" id="foldopen00081" data-start="{" data-end="}">
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"><a class="line" href="../../dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">   81</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>() {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    std::vector&lt;std::vector&lt;bool&gt;&gt; arr{</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        std::vector&lt;bool&gt;({<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">false</span>}),</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        std::vector&lt;bool&gt;({<span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">false</span>}),</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        std::vector&lt;bool&gt;({<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">true</span>}),</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        std::vector&lt;bool&gt;({<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>})};</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keywordtype">bool</span> ans = <a class="code hl_function" href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4">hamilton_cycle</a>(arr);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    assert(ans);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>}</div>
+</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="foldopen" id="foldopen00103" data-start="{" data-end="}">
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"><a class="line" href="../../dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">  103</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>() {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::vector&lt;std::vector&lt;bool&gt;&gt; arr{</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        std::vector&lt;bool&gt;({<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">false</span>}),</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        std::vector&lt;bool&gt;({<span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>}),</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        std::vector&lt;bool&gt;({<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">false</span>}),</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        std::vector&lt;bool&gt;({<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>})};</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordtype">bool</span> ans = <a class="code hl_function" href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4">hamilton_cycle</a>(arr);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    assert(!ans);  <span class="comment">// not a cycle</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>}</div>
+</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="foldopen" id="foldopen00122" data-start="{" data-end="}">
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"><a class="line" href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">  122</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a>() {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    std::vector&lt;std::vector&lt;bool&gt;&gt; arr{</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        std::vector&lt;bool&gt;({<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>}),</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        std::vector&lt;bool&gt;({<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>}),</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        std::vector&lt;bool&gt;({<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>}),</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        std::vector&lt;bool&gt;({<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">true</span>})};</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    <span class="keywordtype">bool</span> ans = <a class="code hl_function" href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4">hamilton_cycle</a>(arr);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    assert(ans);</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>}</div>
+</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span> </div>
+<div class="foldopen" id="foldopen00142" data-start="{" data-end="}">
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"><a class="line" href="../../dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">  142</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> **argv) {</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <a class="code hl_function" href="../../dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>();</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <a class="code hl_function" href="../../dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>();</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <a class="code hl_function" href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a>();</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>}</div>
+</div>
+<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00038">avltree.cpp:38</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="ahamiltons__cycle_8cpp_html_a0cc94918b6831f308d4fe4fa27f08299"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299">test3</a></div><div class="ttdeci">static void test3()</div><div class="ttdef"><b>Definition</b> <a href="#l00122">hamiltons_cycle.cpp:122</a></div></div>
+<div class="ttc" id="ahamiltons__cycle_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdef"><b>Definition</b> <a href="#l00103">hamiltons_cycle.cpp:103</a></div></div>
+<div class="ttc" id="ahamiltons__cycle_8cpp_html_abcf824e347eecfeeb69ea0280f34f3e4"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4">hamilton_cycle</a></div><div class="ttdeci">bool hamilton_cycle(const std::vector&lt; std::vector&lt; bool &gt; &gt; &amp;routes)</div><div class="ttdef"><b>Definition</b> <a href="#l00030">hamiltons_cycle.cpp:30</a></div></div>
+<div class="ttc" id="ahamiltons__cycle_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdef"><b>Definition</b> <a href="#l00081">hamiltons_cycle.cpp:81</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> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a class="el" href="../../dd/d0c/hamiltons__cycle_8cpp.html">hamiltons_cycle.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dd/d0d/insertion__sort_8cpp.html b/dd/d0d/insertion__sort_8cpp.html
index 2178c72eb..4a420a389 100644
--- a/dd/d0d/insertion__sort_8cpp.html
+++ b/dd/d0d/insertion__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/insertion_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/insertion_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for insertion_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/df0/insertion__sort_8cpp__incl.svg" width="350" height="111"><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">
+</div>
+<p><a href="../../dd/d0d/insertion__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -136,7 +155,7 @@ Functions</h2></td></tr>
 <tr class="memdesc:a78cb2f3b97b6db2c062b2a1df05c9ea9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insertion Sort Function.  <br /></td></tr>
 <tr class="separator:a78cb2f3b97b6db2c062b2a1df05c9ea9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a8fe6bac9e03f58abcc2ce26ef3de1b5f" id="r_a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f">sorting::insertionSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *arr)</td></tr>
+<tr class="memitem:a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f">sorting::insertionSort</a> (std::vector&lt; T &gt; *arr)</td></tr>
 <tr class="memdesc:a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insertion Sort for a vector.  <br /></td></tr>
 <tr class="separator:a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a59914553f24088342c139645a02a8a49" id="r_a59914553f24088342c139645a02a8a49"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
@@ -176,6 +195,8 @@ Functions</h2></td></tr>
 </p>
  </li>
 </ol>
+
+<p class="definition">Definition in file <a class="el" href="../../dd/d0d/insertion__sort_8cpp_source.html">insertion_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a59914553f24088342c139645a02a8a49" name="a59914553f24088342c139645a02a8a49"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a59914553f24088342c139645a02a8a49">&#9670;&#160;</a></span>create_random_array()</h2>
@@ -220,20 +241,16 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d0d/insertion__sort_8cpp_source.html#l00101">101</a> of file <a class="el" href="../../dd/d0d/insertion__sort_8cpp_source.html">insertion_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  101</span>                                               {</div>
 <div class="line"><span class="lineno">  102</span>    <span class="keywordflow">while</span> (N--) {</div>
-<div class="line"><span class="lineno">  103</span>        <span class="keywordtype">double</span> r = (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 10000 - 5000) / 100.f;</div>
+<div class="line"><span class="lineno">  103</span>        <span class="keywordtype">double</span> r = (std::rand() % 10000 - 5000) / 100.f;</div>
 <div class="line"><span class="lineno">  104</span>        arr[<a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>] = <span class="keyword">static_cast&lt;</span>T<span class="keyword">&gt;</span>(r);</div>
 <div class="line"><span class="lineno">  105</span>    }</div>
 <div class="line"><span class="lineno">  106</span>}</div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph.svg" width="275" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -253,47 +270,39 @@ Here is the call graph for this function:</div>
 <p>Main Function </p>
 <p>Running predefined tests to test algorithm</p>
 <p>For user insteraction</p>
-<div class="fragment"><div class="line"><span class="lineno">  150</span>           {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  151</span><span class="comment">    /// Running predefined tests to test algorithm</span></div>
-<div class="line"><span class="lineno">  152</span><span class="comment"></span>    <a class="code hl_function" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
-<div class="line"><span class="lineno">  153</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  154</span><span class="comment">    /// For user insteraction</span></div>
-<div class="line"><span class="lineno">  155</span><span class="comment"></span>    <span class="keywordtype">size_t</span> n;</div>
-<div class="line"><span class="lineno">  156</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the length of your array (0 to exit): &quot;</span>;</div>
-<div class="line"><span class="lineno">  157</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;</div>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d0d/insertion__sort_8cpp_source.html#l00150">150</a> of file <a class="el" href="../../dd/d0d/insertion__sort_8cpp_source.html">insertion_sort.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  150</span>           {</div>
+<div class="line"><span class="lineno">  152</span>    <a class="code hl_function" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
+<div class="line"><span class="lineno">  153</span> </div>
+<div class="line"><span class="lineno">  155</span>    <span class="keywordtype">size_t</span> n;</div>
+<div class="line"><span class="lineno">  156</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the length of your array (0 to exit): &quot;</span>;</div>
+<div class="line"><span class="lineno">  157</span>    std::cin &gt;&gt; n;</div>
 <div class="line"><span class="lineno">  158</span>    <span class="keywordflow">if</span> (n == 0) {</div>
 <div class="line"><span class="lineno">  159</span>        <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  160</span>    }</div>
 <div class="line"><span class="lineno">  161</span> </div>
 <div class="line"><span class="lineno">  162</span>    <span class="keywordtype">int</span> *arr = <span class="keyword">new</span> <span class="keywordtype">int</span>[n];</div>
-<div class="line"><span class="lineno">  163</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter any &quot;</span> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; Numbers for Unsorted Array : &quot;</span>;</div>
+<div class="line"><span class="lineno">  163</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter any &quot;</span> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; Numbers for Unsorted Array : &quot;</span>;</div>
 <div class="line"><span class="lineno">  164</span> </div>
 <div class="line"><span class="lineno">  165</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
-<div class="line"><span class="lineno">  166</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; arr[i];</div>
+<div class="line"><span class="lineno">  166</span>        std::cin &gt;&gt; arr[i];</div>
 <div class="line"><span class="lineno">  167</span>    }</div>
 <div class="line"><span class="lineno">  168</span> </div>
 <div class="line"><span class="lineno">  169</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr, n);</div>
 <div class="line"><span class="lineno">  170</span> </div>
-<div class="line"><span class="lineno">  171</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nSorted Array : &quot;</span>;</div>
+<div class="line"><span class="lineno">  171</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nSorted Array : &quot;</span>;</div>
 <div class="line"><span class="lineno">  172</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
-<div class="line"><span class="lineno">  173</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  173</span>        std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">  174</span>    }</div>
 <div class="line"><span class="lineno">  175</span> </div>
-<div class="line"><span class="lineno">  176</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  176</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  177</span>    <span class="keyword">delete</span>[] arr;</div>
 <div class="line"><span class="lineno">  178</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  179</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="ainsertion__sort_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> insertion_sort.cpp:109</div></div>
-<div class="ttc" id="anamespacesorting_html_a78cb2f3b97b6db2c062b2a1df05c9ea9"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a></div><div class="ttdeci">void insertionSort(T *arr, int n)</div><div class="ttdoc">Insertion Sort Function.</div><div class="ttdef"><b>Definition</b> insertion_sort.cpp:59</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="471" height="283"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ainsertion__sort_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d0d/insertion__sort_8cpp_source.html#l00109">insertion_sort.cpp:109</a></div></div>
+<div class="ttc" id="anamespacesorting_html_a78cb2f3b97b6db2c062b2a1df05c9ea9"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a></div><div class="ttdeci">void insertionSort(T *arr, int n)</div><div class="ttdoc">Insertion Sort Function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d0d/insertion__sort_8cpp_source.html#l00059">insertion_sort.cpp:59</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a88ec9ad42717780d6caaff9d3d6977f9" name="a88ec9ad42717780d6caaff9d3d6977f9"></a>
@@ -311,56 +320,49 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Test Cases to test algorithm </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d0d/insertion__sort_8cpp_source.html#l00109">109</a> of file <a class="el" href="../../dd/d0d/insertion__sort_8cpp_source.html">insertion_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  109</span>             {</div>
 <div class="line"><span class="lineno">  110</span>    <span class="keywordtype">int</span> arr1[10] = {78, 34, 35, 6, 34, 56, 3, 56, 2, 4};</div>
-<div class="line"><span class="lineno">  111</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
+<div class="line"><span class="lineno">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
 <div class="line"><span class="lineno">  112</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr1, 10);</div>
-<div class="line"><span class="lineno">  113</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr1, arr1 + 10));</div>
-<div class="line"><span class="lineno">  114</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  113</span>    assert(std::is_sorted(arr1, arr1 + 10));</div>
+<div class="line"><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  115</span> </div>
 <div class="line"><span class="lineno">  116</span>    <span class="keywordtype">int</span> arr2[5] = {5, -3, 7, -2, 1};</div>
-<div class="line"><span class="lineno">  117</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
+<div class="line"><span class="lineno">  117</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
 <div class="line"><span class="lineno">  118</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr2, 5);</div>
-<div class="line"><span class="lineno">  119</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr2, arr2 + 5));</div>
-<div class="line"><span class="lineno">  120</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  119</span>    assert(std::is_sorted(arr2, arr2 + 5));</div>
+<div class="line"><span class="lineno">  120</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  121</span> </div>
 <div class="line"><span class="lineno">  122</span>    <span class="keywordtype">float</span> arr3[5] = {5.6, -3.1, -3.0, -2.1, 1.8};</div>
-<div class="line"><span class="lineno">  123</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
+<div class="line"><span class="lineno">  123</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
 <div class="line"><span class="lineno">  124</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr3, 5);</div>
-<div class="line"><span class="lineno">  125</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr3, arr3 + 5));</div>
-<div class="line"><span class="lineno">  126</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  125</span>    assert(std::is_sorted(arr3, arr3 + 5));</div>
+<div class="line"><span class="lineno">  126</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  127</span> </div>
-<div class="line"><span class="lineno">  128</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> arr4({5.6, -3.1, -3.0, -2.1, 1.8});</div>
-<div class="line"><span class="lineno">  129</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 4... &quot;</span>;</div>
+<div class="line"><span class="lineno">  128</span>    std::vector&lt;float&gt; arr4({5.6, -3.1, -3.0, -2.1, 1.8});</div>
+<div class="line"><span class="lineno">  129</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4... &quot;</span>;</div>
 <div class="line"><span class="lineno">  130</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(&amp;arr4);</div>
-<div class="line"><span class="lineno">  131</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr4), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr4)));</div>
-<div class="line"><span class="lineno">  132</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  131</span>    assert(std::is_sorted(std::begin(arr4), std::end(arr4)));</div>
+<div class="line"><span class="lineno">  132</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  133</span> </div>
 <div class="line"><span class="lineno">  134</span>    <span class="keywordtype">int</span> arr5[50];</div>
-<div class="line"><span class="lineno">  135</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 5... &quot;</span>;</div>
+<div class="line"><span class="lineno">  135</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 5... &quot;</span>;</div>
 <div class="line"><span class="lineno">  136</span>    <a class="code hl_function" href="#a59914553f24088342c139645a02a8a49">create_random_array</a>(arr5, 50);</div>
 <div class="line"><span class="lineno">  137</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr5, 50);</div>
-<div class="line"><span class="lineno">  138</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr5, arr5 + 50));</div>
-<div class="line"><span class="lineno">  139</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  138</span>    assert(std::is_sorted(arr5, arr5 + 50));</div>
+<div class="line"><span class="lineno">  139</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  140</span> </div>
 <div class="line"><span class="lineno">  141</span>    <span class="keywordtype">float</span> arr6[50];</div>
-<div class="line"><span class="lineno">  142</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 6... &quot;</span>;</div>
+<div class="line"><span class="lineno">  142</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 6... &quot;</span>;</div>
 <div class="line"><span class="lineno">  143</span>    <a class="code hl_function" href="#a59914553f24088342c139645a02a8a49">create_random_array</a>(arr6, 50);</div>
 <div class="line"><span class="lineno">  144</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr6, 50);</div>
-<div class="line"><span class="lineno">  145</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr6, arr6 + 50));</div>
-<div class="line"><span class="lineno">  146</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  145</span>    assert(std::is_sorted(arr6, arr6 + 50));</div>
+<div class="line"><span class="lineno">  146</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  147</span>}</div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="ainsertion__sort_8cpp_html_a59914553f24088342c139645a02a8a49"><div class="ttname"><a href="#a59914553f24088342c139645a02a8a49">create_random_array</a></div><div class="ttdeci">static void create_random_array(T *arr, int N)</div><div class="ttdoc">Create a random array objecthelper function to create a random array.</div><div class="ttdef"><b>Definition</b> insertion_sort.cpp:101</div></div>
-<div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg" width="374" height="283"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ainsertion__sort_8cpp_html_a59914553f24088342c139645a02a8a49"><div class="ttname"><a href="#a59914553f24088342c139645a02a8a49">create_random_array</a></div><div class="ttdeci">static void create_random_array(T *arr, int N)</div><div class="ttdoc">Create a random array objecthelper function to create a random array.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d0d/insertion__sort_8cpp_source.html#l00101">insertion_sort.cpp:101</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph.map b/dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph.map
deleted file mode 100644
index b24186b4e..000000000
--- a/dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="create_random_array" name="create_random_array">
-<area shape="rect" id="Node000001" title="Create a random array objecthelper function to create a random array." alt="" coords="5,5,149,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="197,5,269,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="149,16,181,16,181,21,149,21"/>
-</map>
diff --git a/dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph.md5 b/dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph.md5
deleted file mode 100644
index d9fa7ac34..000000000
--- a/dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-76565e22602573ce2de0ad3c26638d06
\ No newline at end of file
diff --git a/dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph.svg b/dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph.svg
deleted file mode 100644
index 7ef465701..000000000
--- a/dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: create_random_array Pages: 1 -->
-<svg width="206pt" height="27pt"
- viewBox="0.00 0.00 205.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>create_random_array</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Create a random array objecthelper function to create a random array.">
-<polygon fill="#999999" stroke="#666666" points="107.5,-19.25 0,-19.25 0,0 107.5,0 107.5,-19.25"/>
-<text text-anchor="middle" x="53.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_random_array</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.75,-19.25 143.5,-19.25 143.5,0 197.75,0 197.75,-19.25"/>
-<text text-anchor="middle" x="170.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.82,-9.62C115.84,-9.62 123.98,-9.62 131.6,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.55,-13.13 141.55,-9.63 131.55,-6.13 131.55,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph_org.svg b/dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph_org.svg
deleted file mode 100644
index db5c81379..000000000
--- a/dd/d0d/insertion__sort_8cpp_a59914553f24088342c139645a02a8a49_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: create_random_array Pages: 1 -->
-<svg width="206pt" height="27pt"
- viewBox="0.00 0.00 205.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>create_random_array</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Create a random array objecthelper function to create a random array.">
-<polygon fill="#999999" stroke="#666666" points="107.5,-19.25 0,-19.25 0,0 107.5,0 107.5,-19.25"/>
-<text text-anchor="middle" x="53.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_random_array</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.75,-19.25 143.5,-19.25 143.5,0 197.75,0 197.75,-19.25"/>
-<text text-anchor="middle" x="170.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.82,-9.62C115.84,-9.62 123.98,-9.62 131.6,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.55,-13.13 141.55,-9.63 131.55,-6.13 131.55,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map b/dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
deleted file mode 100644
index bcaa8b928..000000000
--- a/dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,129,56,155"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="136,5,214,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="36,127,61,85,80,61,102,40,120,30,123,34,105,44,83,64,65,88,40,130"/>
-<area shape="rect" id="Node000003" href="$dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49" title="Create a random array objecthelper function to create a random array." alt="" coords="104,55,247,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="46,127,72,108,102,89,113,84,115,89,105,94,75,112,49,131"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="141,104,210,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="55,135,125,123,126,128,56,140"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="140,153,211,179"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="56,144,125,155,124,160,56,149"/>
-<area shape="rect" id="Node000007" href="$d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9" title="Insertion Sort Function." alt="" coords="105,203,246,228"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="50,153,105,189,115,194,113,199,102,194,47,158"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="125,252,226,278"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="40,154,65,196,84,219,105,239,113,243,110,248,102,243,80,222,61,199,36,157"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="295,55,367,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="247,65,279,65,279,70,247,70"/>
-</map>
diff --git a/dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 b/dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
deleted file mode 100644
index 5dcf8cee7..000000000
--- a/dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-252984e0254e9e3c2290237fd35b7787
\ No newline at end of file
diff --git a/dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg b/dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
deleted file mode 100644
index aa5c8a783..000000000
--- a/dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
+++ /dev/null
@@ -1,173 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="280pt" height="212pt"
- viewBox="0.00 0.00 279.50 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-111.25 0,-111.25 0,-92 37.75,-92 37.75,-111.25"/>
-<text text-anchor="middle" x="18.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="156.88,-204.25 98.12,-204.25 98.12,-185 156.88,-185 156.88,-204.25"/>
-<text text-anchor="middle" x="127.5" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.51,-111.65C32.4,-127.65 49.93,-158.95 73.75,-176.62 77.84,-179.66 82.47,-182.21 87.26,-184.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.82,-187.53 96.41,-187.83 88.31,-180.99 85.82,-187.53"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49" target="_top" xlink:title="Create a random array objecthelper function to create a random array.">
-<polygon fill="white" stroke="#666666" points="181.25,-167.25 73.75,-167.25 73.75,-148 181.25,-148 181.25,-167.25"/>
-<text text-anchor="middle" x="127.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_random_array</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.65,-111.43C42.16,-119.81 58.25,-131.72 73.75,-139.62 76.31,-140.93 79,-142.18 81.73,-143.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.43,-146.61 91.02,-147.04 83.01,-140.1 80.43,-146.61"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="153.12,-130.25 101.88,-130.25 101.88,-111 153.12,-111 153.12,-130.25"/>
-<text text-anchor="middle" x="127.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-104.85C52.29,-107.4 72.77,-111.05 90.42,-114.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.57,-117.6 100.03,-115.91 90.79,-110.71 89.57,-117.6"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.25,-93.25 100.75,-93.25 100.75,-74 154.25,-74 154.25,-93.25"/>
-<text text-anchor="middle" x="127.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-98.57C52,-96.2 71.93,-92.84 89.33,-89.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.54,-93.41 98.82,-88.3 88.38,-86.51 89.54,-93.41"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9" target="_top" xlink:title="Insertion Sort Function.">
-<polygon fill="white" stroke="#666666" points="180.5,-56.25 74.5,-56.25 74.5,-37 180.5,-37 180.5,-56.25"/>
-<text text-anchor="middle" x="127.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.11,-91.78C42.66,-83.65 58.54,-72.26 73.75,-64.62 76.32,-63.33 79.01,-62.1 81.75,-60.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.02,-64.19 91.04,-57.27 80.46,-57.67 83.02,-64.19"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.12,-19.25 89.88,-19.25 89.88,0 165.12,0 165.12,-19.25"/>
-<text text-anchor="middle" x="127.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.55,-91.73C32.49,-75.95 50.08,-45.07 73.75,-27.62 75.53,-26.31 77.42,-25.09 79.37,-23.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.78,-27.16 88.22,-19.62 77.7,-20.87 80.78,-27.16"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.5,-167.25 217.25,-167.25 217.25,-148 271.5,-148 271.5,-167.25"/>
-<text text-anchor="middle" x="244.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M181.57,-157.62C189.59,-157.62 197.73,-157.62 205.35,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.3,-161.13 215.3,-157.63 205.3,-154.13 205.3,-161.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg b/dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
deleted file mode 100644
index d7ccaa899..000000000
--- a/dd/d0d/insertion__sort_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="280pt" height="212pt"
- viewBox="0.00 0.00 279.50 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-111.25 0,-111.25 0,-92 37.75,-92 37.75,-111.25"/>
-<text text-anchor="middle" x="18.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="156.88,-204.25 98.12,-204.25 98.12,-185 156.88,-185 156.88,-204.25"/>
-<text text-anchor="middle" x="127.5" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.51,-111.65C32.4,-127.65 49.93,-158.95 73.75,-176.62 77.84,-179.66 82.47,-182.21 87.26,-184.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.82,-187.53 96.41,-187.83 88.31,-180.99 85.82,-187.53"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49" target="_top" xlink:title="Create a random array objecthelper function to create a random array.">
-<polygon fill="white" stroke="#666666" points="181.25,-167.25 73.75,-167.25 73.75,-148 181.25,-148 181.25,-167.25"/>
-<text text-anchor="middle" x="127.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_random_array</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.65,-111.43C42.16,-119.81 58.25,-131.72 73.75,-139.62 76.31,-140.93 79,-142.18 81.73,-143.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.43,-146.61 91.02,-147.04 83.01,-140.1 80.43,-146.61"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="153.12,-130.25 101.88,-130.25 101.88,-111 153.12,-111 153.12,-130.25"/>
-<text text-anchor="middle" x="127.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-104.85C52.29,-107.4 72.77,-111.05 90.42,-114.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.57,-117.6 100.03,-115.91 90.79,-110.71 89.57,-117.6"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.25,-93.25 100.75,-93.25 100.75,-74 154.25,-74 154.25,-93.25"/>
-<text text-anchor="middle" x="127.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-98.57C52,-96.2 71.93,-92.84 89.33,-89.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.54,-93.41 98.82,-88.3 88.38,-86.51 89.54,-93.41"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9" target="_top" xlink:title="Insertion Sort Function.">
-<polygon fill="white" stroke="#666666" points="180.5,-56.25 74.5,-56.25 74.5,-37 180.5,-37 180.5,-56.25"/>
-<text text-anchor="middle" x="127.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.11,-91.78C42.66,-83.65 58.54,-72.26 73.75,-64.62 76.32,-63.33 79.01,-62.1 81.75,-60.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.02,-64.19 91.04,-57.27 80.46,-57.67 83.02,-64.19"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.12,-19.25 89.88,-19.25 89.88,0 165.12,0 165.12,-19.25"/>
-<text text-anchor="middle" x="127.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.55,-91.73C32.49,-75.95 50.08,-45.07 73.75,-27.62 75.53,-26.31 77.42,-25.09 79.37,-23.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.78,-27.16 88.22,-19.62 77.7,-20.87 80.78,-27.16"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.5,-167.25 217.25,-167.25 217.25,-148 271.5,-148 271.5,-167.25"/>
-<text text-anchor="middle" x="244.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M181.57,-157.62C189.59,-157.62 197.73,-157.62 205.35,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.3,-161.13 215.3,-157.63 205.3,-154.13 205.3,-161.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 9f694bf55..000000000
--- a/dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,56,55,82"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="237,5,308,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,60,102,48,221,24,222,29,103,53,56,65"/>
-<area shape="rect" id="Node000003" href="$d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9" title="Insertion Sort Function." alt="" coords="202,55,343,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,66,187,65,187,71,55,71"/>
-<area shape="rect" id="Node000004" href="$dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" title=" " alt="" coords="103,107,153,132"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,79,90,97,88,102,54,84"/>
-<area shape="poly" id="edge8_Node000004_Node000002" title=" " alt="" coords="136,104,162,72,200,40,221,29,224,34,202,44,166,76,140,108"/>
-<area shape="poly" id="edge9_Node000004_Node000003" title=" " alt="" coords="152,107,200,89,216,83,218,88,202,94,154,112"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="234,203,312,228"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="141,131,167,160,202,189,220,198,218,203,200,194,163,164,137,134"/>
-<area shape="rect" id="Node000006" href="$dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49" title="Create a random array objecthelper function to create a random array." alt="" coords="201,252,344,278"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="136,132,159,184,178,213,203,239,207,242,204,246,199,243,174,217,155,186,131,134"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="238,104,307,130"/>
-<area shape="poly" id="edge7_Node000004_Node000008" title=" " alt="" coords="153,116,223,115,223,120,153,122"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="222,153,323,179"/>
-<area shape="poly" id="edge10_Node000004_Node000009" title=" " alt="" coords="154,125,217,145,215,150,152,130"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="392,252,465,278"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="345,262,376,262,376,268,345,268"/>
-</map>
diff --git a/dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 88a15befe..000000000
--- a/dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b02fc14ea678a3ee818e69ac2c0ba031
\ No newline at end of file
diff --git a/dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 7cac6d3d6..000000000
--- a/dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,209 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="353pt" height="212pt"
- viewBox="0.00 0.00 352.50 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-166.25 0,-166.25 0,-147 37,-147 37,-166.25"/>
-<text text-anchor="middle" x="18.5" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.25,-204.25 173.75,-204.25 173.75,-185 227.25,-185 227.25,-204.25"/>
-<text text-anchor="middle" x="200.5" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.26,-161.6C47.64,-164.42 61.01,-167.92 73,-170.62 102.93,-177.37 137.13,-183.78 162.42,-188.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.77,-191.72 172.22,-190 162.98,-184.82 161.77,-191.72"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9" target="_top" xlink:title="Insertion Sort Function.">
-<polygon fill="white" stroke="#666666" points="253.5,-167.25 147.5,-167.25 147.5,-148 253.5,-148 253.5,-167.25"/>
-<text text-anchor="middle" x="200.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.42,-156.72C60.29,-156.85 101.07,-157.08 136.01,-157.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.58,-160.77 145.6,-157.33 135.62,-153.77 135.58,-160.77"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-128.25 73,-128.25 73,-109 110.75,-109 110.75,-128.25"/>
-<text text-anchor="middle" x="91.88" y="-114.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-147.23C44.89,-143.11 54.18,-138.16 62.84,-133.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.42,-136.67 71.6,-128.89 61.13,-130.5 64.42,-136.67"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge8_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge8_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.74,-128.66C109.01,-141.49 126.69,-163.61 146.75,-176.62 151.65,-179.8 157.17,-182.48 162.74,-184.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.36,-187.95 171.96,-188 163.71,-181.35 161.36,-187.95"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge9_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge9_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.76,-125.82C121.21,-129.97 134.68,-135.22 146.75,-139.62 150.61,-141.04 154.65,-142.47 158.69,-143.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.27,-147.11 167.86,-147.07 159.56,-140.49 157.27,-147.11"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="229.88,-56.25 171.12,-56.25 171.12,-37 229.88,-37 229.88,-56.25"/>
-<text text-anchor="middle" x="200.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.23,-108.89C109.75,-96.91 127.42,-76.68 146.75,-64.62 150.97,-61.99 155.63,-59.69 160.38,-57.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.22,-61.11 169.36,-54.32 158.76,-54.56 161.22,-61.11"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49" target="_top" xlink:title="Create a random array objecthelper function to create a random array.">
-<polygon fill="white" stroke="#666666" points="254.25,-19.25 146.75,-19.25 146.75,0 254.25,0 254.25,-19.25"/>
-<text text-anchor="middle" x="200.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_random_array</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.16,-108.58C102.77,-89.93 119.4,-49.86 146.75,-27.62 147.85,-26.73 148.99,-25.88 150.18,-25.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.51,-28.34 158.51,-20.39 148.08,-22.24 151.51,-28.34"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.12,-130.25 174.88,-130.25 174.88,-111 226.12,-111 226.12,-130.25"/>
-<text text-anchor="middle" x="200.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-118.96C125.22,-119.23 145.57,-119.61 163.16,-119.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.94,-123.44 173,-120.13 163.07,-116.44 162.94,-123.44"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.12,-93.25 162.88,-93.25 162.88,-74 238.12,-74 238.12,-93.25"/>
-<text text-anchor="middle" x="200.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge10_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge10_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-112.69C123.8,-108.47 141.58,-102.64 157.84,-97.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.92,-100.63 167.33,-94.18 156.74,-93.98 158.92,-100.63"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="344.5,-19.25 290.25,-19.25 290.25,0 344.5,0 344.5,-19.25"/>
-<text text-anchor="middle" x="317.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.57,-9.62C262.59,-9.62 270.73,-9.62 278.35,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.3,-13.13 288.3,-9.63 278.3,-6.13 278.3,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 5d89f9d0d..000000000
--- a/dd/d0d/insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,183 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="353pt" height="212pt"
- viewBox="0.00 0.00 352.50 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-166.25 0,-166.25 0,-147 37,-147 37,-166.25"/>
-<text text-anchor="middle" x="18.5" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.25,-204.25 173.75,-204.25 173.75,-185 227.25,-185 227.25,-204.25"/>
-<text text-anchor="middle" x="200.5" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.26,-161.6C47.64,-164.42 61.01,-167.92 73,-170.62 102.93,-177.37 137.13,-183.78 162.42,-188.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.77,-191.72 172.22,-190 162.98,-184.82 161.77,-191.72"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9" target="_top" xlink:title="Insertion Sort Function.">
-<polygon fill="white" stroke="#666666" points="253.5,-167.25 147.5,-167.25 147.5,-148 253.5,-148 253.5,-167.25"/>
-<text text-anchor="middle" x="200.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.42,-156.72C60.29,-156.85 101.07,-157.08 136.01,-157.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.58,-160.77 145.6,-157.33 135.62,-153.77 135.58,-160.77"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-128.25 73,-128.25 73,-109 110.75,-109 110.75,-128.25"/>
-<text text-anchor="middle" x="91.88" y="-114.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-147.23C44.89,-143.11 54.18,-138.16 62.84,-133.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.42,-136.67 71.6,-128.89 61.13,-130.5 64.42,-136.67"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge8_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge8_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.74,-128.66C109.01,-141.49 126.69,-163.61 146.75,-176.62 151.65,-179.8 157.17,-182.48 162.74,-184.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.36,-187.95 171.96,-188 163.71,-181.35 161.36,-187.95"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge9_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge9_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.76,-125.82C121.21,-129.97 134.68,-135.22 146.75,-139.62 150.61,-141.04 154.65,-142.47 158.69,-143.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.27,-147.11 167.86,-147.07 159.56,-140.49 157.27,-147.11"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="229.88,-56.25 171.12,-56.25 171.12,-37 229.88,-37 229.88,-56.25"/>
-<text text-anchor="middle" x="200.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.23,-108.89C109.75,-96.91 127.42,-76.68 146.75,-64.62 150.97,-61.99 155.63,-59.69 160.38,-57.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.22,-61.11 169.36,-54.32 158.76,-54.56 161.22,-61.11"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49" target="_top" xlink:title="Create a random array objecthelper function to create a random array.">
-<polygon fill="white" stroke="#666666" points="254.25,-19.25 146.75,-19.25 146.75,0 254.25,0 254.25,-19.25"/>
-<text text-anchor="middle" x="200.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_random_array</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.16,-108.58C102.77,-89.93 119.4,-49.86 146.75,-27.62 147.85,-26.73 148.99,-25.88 150.18,-25.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.51,-28.34 158.51,-20.39 148.08,-22.24 151.51,-28.34"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.12,-130.25 174.88,-130.25 174.88,-111 226.12,-111 226.12,-130.25"/>
-<text text-anchor="middle" x="200.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-118.96C125.22,-119.23 145.57,-119.61 163.16,-119.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.94,-123.44 173,-120.13 163.07,-116.44 162.94,-123.44"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.12,-93.25 162.88,-93.25 162.88,-74 238.12,-74 238.12,-93.25"/>
-<text text-anchor="middle" x="200.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node9 -->
-<g id="edge10_Node000004_Node000009" class="edge">
-<title>Node4&#45;&gt;Node9</title>
-<g id="a_edge10_Node000004_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-112.69C123.8,-108.47 141.58,-102.64 157.84,-97.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.92,-100.63 167.33,-94.18 156.74,-93.98 158.92,-100.63"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="344.5,-19.25 290.25,-19.25 290.25,0 344.5,0 344.5,-19.25"/>
-<text text-anchor="middle" x="317.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.57,-9.62C262.59,-9.62 270.73,-9.62 278.35,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.3,-13.13 288.3,-9.63 278.3,-6.13 278.3,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d0d/insertion__sort_8cpp_source.html b/dd/d0d/insertion__sort_8cpp_source.html
new file mode 100644
index 000000000..2cd0087bd
--- /dev/null
+++ b/dd/d0d/insertion__sort_8cpp_source.html
@@ -0,0 +1,265 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/insertion_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dd/d0d/insertion__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">insertion_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dd/d0d/insertion__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00059" data-start="{" data-end="}">
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">   59</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">insertionSort</a>(T *arr, <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; n; i++) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        T temp = arr[i];</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordtype">int</span> j = i - 1;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">while</span> (j &gt;= 0 &amp;&amp; temp &lt; arr[j]) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            arr[j + 1] = arr[j];</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            j--;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        arr[j + 1] = temp;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>}</div>
+</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00077" data-start="{" data-end="}">
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f">   77</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">insertionSort</a>(std::vector&lt;T&gt; *arr) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordtype">size_t</span> n = arr-&gt;size();</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 1; i &lt; n; i++) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        T temp = arr[0][i];</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        int32_t j = i - 1;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordflow">while</span> (j &gt;= 0 &amp;&amp; temp &lt; arr[0][j]) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            arr[0][j + 1] = arr[0][j];</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>            j--;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        }</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        arr[0][j + 1] = temp;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>}</div>
+</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00101" data-start="{" data-end="}">
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"><a class="line" href="../../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49">  101</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49">create_random_array</a>(T *arr, <span class="keywordtype">int</span> N) {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="keywordflow">while</span> (N--) {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        <span class="keywordtype">double</span> r = (std::rand() % 10000 - 5000) / 100.f;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        arr[N] = <span class="keyword">static_cast&lt;</span>T<span class="keyword">&gt;</span>(r);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    }</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>}</div>
+</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="foldopen" id="foldopen00109" data-start="{" data-end="}">
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"><a class="line" href="../../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">  109</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>() {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordtype">int</span> arr1[10] = {78, 34, 35, 6, 34, 56, 3, 56, 2, 4};</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr1, 10);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    assert(std::is_sorted(arr1, arr1 + 10));</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <span class="keywordtype">int</span> arr2[5] = {5, -3, 7, -2, 1};</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr2, 5);</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    assert(std::is_sorted(arr2, arr2 + 5));</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span> </div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    <span class="keywordtype">float</span> arr3[5] = {5.6, -3.1, -3.0, -2.1, 1.8};</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr3, 5);</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    assert(std::is_sorted(arr3, arr3 + 5));</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span> </div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    std::vector&lt;float&gt; arr4({5.6, -3.1, -3.0, -2.1, 1.8});</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4... &quot;</span>;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(&amp;arr4);</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    assert(std::is_sorted(std::begin(arr4), std::end(arr4)));</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span> </div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <span class="keywordtype">int</span> arr5[50];</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 5... &quot;</span>;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    <a class="code hl_function" href="../../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49">create_random_array</a>(arr5, 50);</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr5, 50);</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    assert(std::is_sorted(arr5, arr5 + 50));</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span> </div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <span class="keywordtype">float</span> arr6[50];</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 6... &quot;</span>;</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <a class="code hl_function" href="../../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49">create_random_array</a>(arr6, 50);</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr6, 50);</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    assert(std::is_sorted(arr6, arr6 + 50));</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>}</div>
+</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span> </div>
+<div class="foldopen" id="foldopen00150" data-start="{" data-end="}">
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"><a class="line" href="../../dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  150</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    <a class="code hl_function" href="../../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span> </div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    <span class="keywordtype">size_t</span> n;</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the length of your array (0 to exit): &quot;</span>;</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    <span class="keywordflow">if</span> (n == 0) {</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    }</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span> </div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    <span class="keywordtype">int</span> *arr = <span class="keyword">new</span> <span class="keywordtype">int</span>[n];</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter any &quot;</span> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; Numbers for Unsorted Array : &quot;</span>;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span> </div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        std::cin &gt;&gt; arr[i];</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    }</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span> </div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr, n);</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span> </div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nSorted Array : &quot;</span>;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>        std::cout &lt;&lt; arr[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    }</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span> </div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    <span class="keyword">delete</span>[] arr;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>}</div>
+</div>
+<div class="ttc" id="ainsertion__sort_8cpp_html_a59914553f24088342c139645a02a8a49"><div class="ttname"><a href="../../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49">create_random_array</a></div><div class="ttdeci">static void create_random_array(T *arr, int N)</div><div class="ttdoc">Create a random array objecthelper function to create a random array.</div><div class="ttdef"><b>Definition</b> <a href="#l00101">insertion_sort.cpp:101</a></div></div>
+<div class="ttc" id="ainsertion__sort_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="#l00109">insertion_sort.cpp:109</a></div></div>
+<div class="ttc" id="ainsertion__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00150">insertion_sort.cpp:150</a></div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+<div class="ttc" id="anamespacesorting_html_a78cb2f3b97b6db2c062b2a1df05c9ea9"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a></div><div class="ttdeci">void insertionSort(T *arr, int n)</div><div class="ttdoc">Insertion Sort Function.</div><div class="ttdef"><b>Definition</b> <a href="#l00059">insertion_sort.cpp:59</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../dd/d0d/insertion__sort_8cpp.html">insertion_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dd/d12/vigenere__cipher_8cpp.html b/dd/d12/vigenere__cipher_8cpp.html
index 8abe586e5..25bb74170 100644
--- a/dd/d12/vigenere__cipher_8cpp.html
+++ b/dd/d12/vigenere__cipher_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ciphers/vigenere_cipher.cpp File Reference</title>
+<title>TheAlgorithms/C++: ciphers/vigenere_cipher.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for vigenere_cipher.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d1a/vigenere__cipher_8cpp__incl.svg" width="248" height="111"><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">
+</div>
+<p><a href="../../dd/d12/vigenere__cipher_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d4e/namespaceciphers.html">ciphers</a></td></tr>
@@ -133,9 +152,9 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a6bd3880ea6820c232c1eddf47553c257" id="r_a6bd3880ea6820c232c1eddf47553c257"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6bd3880ea6820c232c1eddf47553c257">ciphers::vigenere::encrypt</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;key)</td></tr>
+<tr class="memitem:a6bd3880ea6820c232c1eddf47553c257" id="r_a6bd3880ea6820c232c1eddf47553c257"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6bd3880ea6820c232c1eddf47553c257">ciphers::vigenere::encrypt</a> (const std::string &amp;text, const std::string &amp;key)</td></tr>
 <tr class="separator:a6bd3880ea6820c232c1eddf47553c257"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a3cfc3f9b20a0f230a2fcefd31dc6848e" id="r_a3cfc3f9b20a0f230a2fcefd31dc6848e"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3cfc3f9b20a0f230a2fcefd31dc6848e">ciphers::vigenere::decrypt</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;key)</td></tr>
+<tr class="memitem:a3cfc3f9b20a0f230a2fcefd31dc6848e" id="r_a3cfc3f9b20a0f230a2fcefd31dc6848e"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3cfc3f9b20a0f230a2fcefd31dc6848e">ciphers::vigenere::decrypt</a> (const std::string &amp;text, const std::string &amp;key)</td></tr>
 <tr class="separator:a3cfc3f9b20a0f230a2fcefd31dc6848e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae1a3968e7947464bee7714f6d43b7002" id="r_ae1a3968e7947464bee7714f6d43b7002"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae1a3968e7947464bee7714f6d43b7002">test</a> ()</td></tr>
 <tr class="separator:ae1a3968e7947464bee7714f6d43b7002"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -161,6 +180,8 @@ Algorithm</h3>
 <dd>
 This program implements Vigenère cipher for only uppercase English alphabet characters (i.e. A-Z).</dd></dl>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/imdeep2905" target="_blank">Deep Raval</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../dd/d12/vigenere__cipher_8cpp_source.html">vigenere_cipher.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a3cfc3f9b20a0f230a2fcefd31dc6848e" name="a3cfc3f9b20a0f230a2fcefd31dc6848e"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a3cfc3f9b20a0f230a2fcefd31dc6848e">&#9670;&#160;</a></span>decrypt()</h2>
@@ -169,14 +190,14 @@ This program implements Vigenère cipher for only uppercase English alphabet cha
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ciphers::vigenere::decrypt </td>
+          <td class="memname">std::string ciphers::vigenere::decrypt </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>key</em></span>&#160;)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>key</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -188,11 +209,13 @@ This program implements Vigenère cipher for only uppercase English alphabet cha
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new decrypted text </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d12/vigenere__cipher_8cpp_source.html#l00092">92</a> of file <a class="el" href="../../dd/d12/vigenere__cipher_8cpp_source.html">vigenere_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   92</span>                                                                        {</div>
 <div class="line"><span class="lineno">   93</span>            <span class="comment">// Going through each character of text and key</span></div>
 <div class="line"><span class="lineno">   94</span>            <span class="comment">// Note that key is visited in circular way hence  j = (j + 1) % |key|</span></div>
-<div class="line"><span class="lineno">   95</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> decrypted_text = <span class="stringliteral">&quot;&quot;</span>; <span class="comment">// Empty string to store decrypted text</span></div>
-<div class="line"><span class="lineno">   96</span>            <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0, j = 0; i &lt; text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>(); i++, j = (j + 1) % key.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>()) {</div>
+<div class="line"><span class="lineno">   95</span>            std::string decrypted_text = <span class="stringliteral">&quot;&quot;</span>; <span class="comment">// Empty string to store decrypted text</span></div>
+<div class="line"><span class="lineno">   96</span>            <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0, j = 0; i &lt; text.length(); i++, j = (j + 1) % key.length()) {</div>
 <div class="line"><span class="lineno">   97</span>                <span class="keywordtype">int</span> place_value_text = get_value(text[i]); <span class="comment">// Getting value of character in text</span></div>
 <div class="line"><span class="lineno">   98</span>                <span class="keywordtype">int</span> place_value_key = get_value(key[j]); <span class="comment">// Getting value of character in key</span></div>
 <div class="line"><span class="lineno">   99</span>                place_value_text = (place_value_text - place_value_key + 26) % 26; <span class="comment">// Applying decryption</span></div>
@@ -201,15 +224,8 @@ This program implements Vigenère cipher for only uppercase English alphabet cha
 <div class="line"><span class="lineno">  102</span>            }        </div>
 <div class="line"><span class="lineno">  103</span>            <span class="keywordflow">return</span> decrypted_text; <span class="comment">// Returning decrypted text</span></div>
 <div class="line"><span class="lineno">  104</span>        }</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="asha256_8cpp_html_a9e98c180d32b04aab6f767cb0c13e1da"><div class="ttname"><a href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da">hashing::sha256::get_char</a></div><div class="ttdeci">char get_char(const std::string &amp;input, std::size_t pos)</div><div class="ttdoc">Returns the character at pos after the input is padded.</div><div class="ttdef"><b>Definition</b> sha256.cpp:170</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::length</a></div><div class="ttdeci">T length(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.svg" width="310" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asha256_8cpp_html_a9e98c180d32b04aab6f767cb0c13e1da"><div class="ttname"><a href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da">hashing::sha256::get_char</a></div><div class="ttdeci">char get_char(const std::string &amp;input, std::size_t pos)</div><div class="ttdoc">Returns the character at pos after the input is padded.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d08/sha256_8cpp_source.html#l00170">sha256.cpp:170</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6bd3880ea6820c232c1eddf47553c257" name="a6bd3880ea6820c232c1eddf47553c257"></a>
@@ -219,14 +235,14 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ciphers::vigenere::encrypt </td>
+          <td class="memname">std::string ciphers::vigenere::encrypt </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>key</em></span>&#160;)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>key</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -238,11 +254,13 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>new encrypted text </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d12/vigenere__cipher_8cpp_source.html#l00073">73</a> of file <a class="el" href="../../dd/d12/vigenere__cipher_8cpp_source.html">vigenere_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   73</span>                                                                        {</div>
-<div class="line"><span class="lineno">   74</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> encrypted_text = <span class="stringliteral">&quot;&quot;</span>; <span class="comment">// Empty string to store encrypted text</span></div>
+<div class="line"><span class="lineno">   74</span>            std::string encrypted_text = <span class="stringliteral">&quot;&quot;</span>; <span class="comment">// Empty string to store encrypted text</span></div>
 <div class="line"><span class="lineno">   75</span>            <span class="comment">// Going through each character of text and key</span></div>
 <div class="line"><span class="lineno">   76</span>            <span class="comment">// Note that key is visited in circular way hence  j = (j + 1) % |key|</span></div>
-<div class="line"><span class="lineno">   77</span>            <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0, j = 0; i &lt; text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>(); i++, j = (j + 1) % key.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>()) {</div>
+<div class="line"><span class="lineno">   77</span>            <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0, j = 0; i &lt; text.length(); i++, j = (j + 1) % key.length()) {</div>
 <div class="line"><span class="lineno">   78</span>                <span class="keywordtype">int</span> place_value_text = get_value(text[i]); <span class="comment">// Getting value of character in text</span></div>
 <div class="line"><span class="lineno">   79</span>                <span class="keywordtype">int</span> place_value_key = get_value(key[j]); <span class="comment">// Getting value of character in key</span></div>
 <div class="line"><span class="lineno">   80</span>                place_value_text = (place_value_text + place_value_key) % 26; <span class="comment">// Applying encryption</span></div>
@@ -251,12 +269,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   83</span>            }</div>
 <div class="line"><span class="lineno">   84</span>            <span class="keywordflow">return</span> encrypted_text; <span class="comment">// Returning encrypted text</span></div>
 <div class="line"><span class="lineno">   85</span>        }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph.svg" width="310" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -274,18 +287,15 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Driver Code </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d12/vigenere__cipher_8cpp_source.html#l00131">131</a> of file <a class="el" href="../../dd/d12/vigenere__cipher_8cpp_source.html">vigenere_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  131</span>           {</div>
 <div class="line"><span class="lineno">  132</span>    <span class="comment">// Testing</span></div>
 <div class="line"><span class="lineno">  133</span>    <a class="code hl_function" href="#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
 <div class="line"><span class="lineno">  134</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  135</span>}</div>
-<div class="ttc" id="avigenere__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> vigenere_cipher.cpp:111</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="avigenere__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d12/vigenere__cipher_8cpp_source.html#l00111">vigenere_cipher.cpp:111</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae1a3968e7947464bee7714f6d43b7002" name="ae1a3968e7947464bee7714f6d43b7002"></a>
@@ -303,34 +313,29 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Function to test above algorithm </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d12/vigenere__cipher_8cpp_source.html#l00111">111</a> of file <a class="el" href="../../dd/d12/vigenere__cipher_8cpp_source.html">vigenere_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  111</span>            {</div>
 <div class="line"><span class="lineno">  112</span>    <span class="comment">// Test 1</span></div>
-<div class="line"><span class="lineno">  113</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> text1 = <span class="stringliteral">&quot;NIKOLATESLA&quot;</span>;</div>
-<div class="line"><span class="lineno">  114</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> encrypted1 = <a class="code hl_function" href="#a6bd3880ea6820c232c1eddf47553c257">ciphers::vigenere::encrypt</a>(text1, <span class="stringliteral">&quot;TESLA&quot;</span>);</div>
-<div class="line"><span class="lineno">  115</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> decrypted1 = <a class="code hl_function" href="#a3cfc3f9b20a0f230a2fcefd31dc6848e">ciphers::vigenere::decrypt</a>(encrypted1, <span class="stringliteral">&quot;TESLA&quot;</span>);</div>
+<div class="line"><span class="lineno">  113</span>    std::string text1 = <span class="stringliteral">&quot;NIKOLATESLA&quot;</span>;</div>
+<div class="line"><span class="lineno">  114</span>    std::string encrypted1 = <a class="code hl_function" href="#a6bd3880ea6820c232c1eddf47553c257">ciphers::vigenere::encrypt</a>(text1, <span class="stringliteral">&quot;TESLA&quot;</span>);</div>
+<div class="line"><span class="lineno">  115</span>    std::string decrypted1 = <a class="code hl_function" href="#a3cfc3f9b20a0f230a2fcefd31dc6848e">ciphers::vigenere::decrypt</a>(encrypted1, <span class="stringliteral">&quot;TESLA&quot;</span>);</div>
 <div class="line"><span class="lineno">  116</span>    assert(text1 == decrypted1);</div>
-<div class="line"><span class="lineno">  117</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text1;</div>
-<div class="line"><span class="lineno">  118</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; , Encrypted text (with key = TESLA) : &quot;</span> &lt;&lt; encrypted1;</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> &lt;&lt; <span class="stringliteral">&quot; , Decrypted text : &quot;</span>&lt;&lt; decrypted1 &lt;&lt; <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">  117</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text1;</div>
+<div class="line"><span class="lineno">  118</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Encrypted text (with key = TESLA) : &quot;</span> &lt;&lt; encrypted1;</div>
+<div class="line"><span class="lineno">  119</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Decrypted text : &quot;</span>&lt;&lt; decrypted1 &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  120</span>    <span class="comment">// Test 2</span></div>
-<div class="line"><span class="lineno">  121</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> text2 = <span class="stringliteral">&quot;GOOGLEIT&quot;</span>;</div>
-<div class="line"><span class="lineno">  122</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> encrypted2 = <a class="code hl_function" href="#a6bd3880ea6820c232c1eddf47553c257">ciphers::vigenere::encrypt</a>(text2, <span class="stringliteral">&quot;REALLY&quot;</span>);</div>
-<div class="line"><span class="lineno">  123</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> decrypted2 = <a class="code hl_function" href="#a3cfc3f9b20a0f230a2fcefd31dc6848e">ciphers::vigenere::decrypt</a>(encrypted2, <span class="stringliteral">&quot;REALLY&quot;</span>);</div>
+<div class="line"><span class="lineno">  121</span>    std::string text2 = <span class="stringliteral">&quot;GOOGLEIT&quot;</span>;</div>
+<div class="line"><span class="lineno">  122</span>    std::string encrypted2 = <a class="code hl_function" href="#a6bd3880ea6820c232c1eddf47553c257">ciphers::vigenere::encrypt</a>(text2, <span class="stringliteral">&quot;REALLY&quot;</span>);</div>
+<div class="line"><span class="lineno">  123</span>    std::string decrypted2 = <a class="code hl_function" href="#a3cfc3f9b20a0f230a2fcefd31dc6848e">ciphers::vigenere::decrypt</a>(encrypted2, <span class="stringliteral">&quot;REALLY&quot;</span>);</div>
 <div class="line"><span class="lineno">  124</span>    assert(text2 == decrypted2);</div>
-<div class="line"><span class="lineno">  125</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text2;</div>
-<div class="line"><span class="lineno">  126</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; , Encrypted text (with key = REALLY) : &quot;</span> &lt;&lt; encrypted2;</div>
-<div class="line"><span class="lineno">  127</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot; , Decrypted text : &quot;</span>&lt;&lt; decrypted2 &lt;&lt; <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">  125</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text2;</div>
+<div class="line"><span class="lineno">  126</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Encrypted text (with key = REALLY) : &quot;</span> &lt;&lt; encrypted2;</div>
+<div class="line"><span class="lineno">  127</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Decrypted text : &quot;</span>&lt;&lt; decrypted2 &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  128</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="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="avigenere__cipher_8cpp_html_a3cfc3f9b20a0f230a2fcefd31dc6848e"><div class="ttname"><a href="#a3cfc3f9b20a0f230a2fcefd31dc6848e">ciphers::vigenere::decrypt</a></div><div class="ttdeci">std::string decrypt(const std::string &amp;text, const std::string &amp;key)</div><div class="ttdef"><b>Definition</b> vigenere_cipher.cpp:92</div></div>
-<div class="ttc" id="avigenere__cipher_8cpp_html_a6bd3880ea6820c232c1eddf47553c257"><div class="ttname"><a href="#a6bd3880ea6820c232c1eddf47553c257">ciphers::vigenere::encrypt</a></div><div class="ttdeci">std::string encrypt(const std::string &amp;text, const std::string &amp;key)</div><div class="ttdef"><b>Definition</b> vigenere_cipher.cpp:73</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="avigenere__cipher_8cpp_html_a3cfc3f9b20a0f230a2fcefd31dc6848e"><div class="ttname"><a href="#a3cfc3f9b20a0f230a2fcefd31dc6848e">ciphers::vigenere::decrypt</a></div><div class="ttdeci">std::string decrypt(const std::string &amp;text, const std::string &amp;key)</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d12/vigenere__cipher_8cpp_source.html#l00092">vigenere_cipher.cpp:92</a></div></div>
+<div class="ttc" id="avigenere__cipher_8cpp_html_a6bd3880ea6820c232c1eddf47553c257"><div class="ttname"><a href="#a6bd3880ea6820c232c1eddf47553c257">ciphers::vigenere::encrypt</a></div><div class="ttdeci">std::string encrypt(const std::string &amp;text, const std::string &amp;key)</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d12/vigenere__cipher_8cpp_source.html#l00073">vigenere_cipher.cpp:73</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.map b/dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.map
deleted file mode 100644
index 0a896b64c..000000000
--- a/dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="ciphers::vigenere::decrypt" name="ciphers::vigenere::decrypt">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,134,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="182,13,304,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="134,23,166,23,166,28,134,28"/>
-</map>
diff --git a/dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.md5 b/dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.md5
deleted file mode 100644
index 9baceb1a2..000000000
--- a/dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a2deeff134f53dcac3a781678dc55888
\ No newline at end of file
diff --git a/dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.svg b/dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.svg
deleted file mode 100644
index 735d731bc..000000000
--- a/dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::vigenere::decrypt Pages: 1 -->
-<svg width="232pt" height="39pt"
- viewBox="0.00 0.00 232.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>ciphers::vigenere::decrypt</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="96.25,-30.5 0,-30.5 0,0 96.25,0 96.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::vigenere::</text>
-<text text-anchor="middle" x="48.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">decrypt</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-24.88 132.25,-24.88 132.25,-5.63 224,-5.63 224,-24.88"/>
-<text text-anchor="middle" x="178.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.42,-15.25C104.36,-15.25 112.67,-15.25 120.81,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.63,-18.75 130.63,-15.25 120.63,-11.75 120.63,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph_org.svg b/dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph_org.svg
deleted file mode 100644
index 0c09c4345..000000000
--- a/dd/d12/vigenere__cipher_8cpp_a3cfc3f9b20a0f230a2fcefd31dc6848e_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::vigenere::decrypt Pages: 1 -->
-<svg width="232pt" height="39pt"
- viewBox="0.00 0.00 232.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>ciphers::vigenere::decrypt</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="96.25,-30.5 0,-30.5 0,0 96.25,0 96.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::vigenere::</text>
-<text text-anchor="middle" x="48.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">decrypt</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-24.88 132.25,-24.88 132.25,-5.63 224,-5.63 224,-24.88"/>
-<text text-anchor="middle" x="178.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.42,-15.25C104.36,-15.25 112.67,-15.25 120.81,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.63,-18.75 130.63,-15.25 120.63,-11.75 120.63,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph.map b/dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph.map
deleted file mode 100644
index 1b1ca4670..000000000
--- a/dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="ciphers::vigenere::encrypt" name="ciphers::vigenere::encrypt">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,134,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="182,13,304,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="134,23,166,23,166,28,134,28"/>
-</map>
diff --git a/dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph.md5 b/dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph.md5
deleted file mode 100644
index fb2c37f42..000000000
--- a/dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-20f2de320edf52399a68d29c18c43fb5
\ No newline at end of file
diff --git a/dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph.svg b/dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph.svg
deleted file mode 100644
index b64c5faf6..000000000
--- a/dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::vigenere::encrypt Pages: 1 -->
-<svg width="232pt" height="39pt"
- viewBox="0.00 0.00 232.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>ciphers::vigenere::encrypt</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="96.25,-30.5 0,-30.5 0,0 96.25,0 96.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::vigenere::</text>
-<text text-anchor="middle" x="48.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">encrypt</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-24.88 132.25,-24.88 132.25,-5.63 224,-5.63 224,-24.88"/>
-<text text-anchor="middle" x="178.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.42,-15.25C104.36,-15.25 112.67,-15.25 120.81,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.63,-18.75 130.63,-15.25 120.63,-11.75 120.63,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph_org.svg b/dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph_org.svg
deleted file mode 100644
index 72c7b9fef..000000000
--- a/dd/d12/vigenere__cipher_8cpp_a6bd3880ea6820c232c1eddf47553c257_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::vigenere::encrypt Pages: 1 -->
-<svg width="232pt" height="39pt"
- viewBox="0.00 0.00 232.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>ciphers::vigenere::encrypt</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="96.25,-30.5 0,-30.5 0,0 96.25,0 96.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::vigenere::</text>
-<text text-anchor="middle" x="48.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">encrypt</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-24.88 132.25,-24.88 132.25,-5.63 224,-5.63 224,-24.88"/>
-<text text-anchor="middle" x="178.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.42,-15.25C104.36,-15.25 112.67,-15.25 120.81,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.63,-18.75 130.63,-15.25 120.63,-11.75 120.63,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map b/dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
deleted file mode 100644
index ab849b4e9..000000000
--- a/dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5 b/dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
deleted file mode 100644
index 027bb45f5..000000000
--- a/dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a1d13d80069df469bd6cb7baa71c0ea1
\ No newline at end of file
diff --git a/dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg b/dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
deleted file mode 100644
index 74b7e7dc5..000000000
--- a/dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg b/dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
deleted file mode 100644
index b7b979de9..000000000
--- a/dd/d12/vigenere__cipher_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 24e5814bf..000000000
--- a/dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" title=" " alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index e401ef9a3..000000000
--- a/dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-848b060ceaf6a5919a9f3aafe969c3c2
\ No newline at end of file
diff --git a/dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 0760b6b51..000000000
--- a/dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index a80dea578..000000000
--- a/dd/d12/vigenere__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d12/vigenere__cipher_8cpp_source.html b/dd/d12/vigenere__cipher_8cpp_source.html
new file mode 100644
index 000000000..14996d7a3
--- /dev/null
+++ b/dd/d12/vigenere__cipher_8cpp_source.html
@@ -0,0 +1,222 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: ciphers/vigenere_cipher.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dd/d12/vigenere__cipher_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">vigenere_cipher.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dd/d12/vigenere__cipher_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;string&gt;</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/d4e/namespaceciphers.html">ciphers</a> {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/da2/namespacevigenere.html">vigenere</a> {   </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="keyword">namespace </span>{</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>            <span class="keyword">inline</span> <span class="keywordtype">char</span> <a class="code hl_function" href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da">get_char</a>(<span class="keyword">const</span> <span class="keywordtype">int</span> x) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>                <span class="comment">// By adding 65 we are scaling 0-25 to 65-90. </span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>                <span class="comment">// Which are in fact ASCII values of A-Z. </span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>                <span class="keywordflow">return</span> char(x + 65); </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            }</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            <span class="keyword">inline</span> <span class="keywordtype">int</span> get_value(<span class="keyword">const</span> <span class="keywordtype">char</span> c) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>                <span class="comment">// A-Z have ASCII values in range 65-90.</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>                <span class="comment">// Hence subtracting 65 will scale them to 0-25.</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>                <span class="keywordflow">return</span> int(c - 65);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        } <span class="comment">// Unnamed namespace</span></div>
+<div class="foldopen" id="foldopen00073" data-start="{" data-end="}">
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"><a class="line" href="../../dd/d12/vigenere__cipher_8cpp.html#a6bd3880ea6820c232c1eddf47553c257">   73</a></span>        std::string encrypt (<span class="keyword">const</span> std::string &amp;text, <span class="keyword">const</span> std::string &amp;key) {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            std::string encrypted_text = <span class="stringliteral">&quot;&quot;</span>; <span class="comment">// Empty string to store encrypted text</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            <span class="comment">// Going through each character of text and key</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>            <span class="comment">// Note that key is visited in circular way hence  j = (j + 1) % |key|</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0, j = 0; i &lt; text.length(); i++, j = (j + 1) % key.length()) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>                <span class="keywordtype">int</span> place_value_text = get_value(text[i]); <span class="comment">// Getting value of character in text</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>                <span class="keywordtype">int</span> place_value_key = get_value(key[j]); <span class="comment">// Getting value of character in key</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>                place_value_text = (place_value_text + place_value_key) % 26; <span class="comment">// Applying encryption</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>                <span class="keywordtype">char</span> encrypted_char = get_char(place_value_text); <span class="comment">// Getting new character from encrypted value</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>                encrypted_text += encrypted_char; <span class="comment">// Appending encrypted character</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            }</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            <span class="keywordflow">return</span> encrypted_text; <span class="comment">// Returning encrypted text</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        }</div>
+</div>
+<div class="foldopen" id="foldopen00092" data-start="{" data-end="}">
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="../../dd/d12/vigenere__cipher_8cpp.html#a3cfc3f9b20a0f230a2fcefd31dc6848e">   92</a></span>        std::string decrypt (<span class="keyword">const</span> std::string &amp;text, <span class="keyword">const</span> std::string &amp;key) {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>            <span class="comment">// Going through each character of text and key</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>            <span class="comment">// Note that key is visited in circular way hence  j = (j + 1) % |key|</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>            std::string decrypted_text = <span class="stringliteral">&quot;&quot;</span>; <span class="comment">// Empty string to store decrypted text</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i = 0, j = 0; i &lt; text.length(); i++, j = (j + 1) % key.length()) {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>                <span class="keywordtype">int</span> place_value_text = get_value(text[i]); <span class="comment">// Getting value of character in text</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>                <span class="keywordtype">int</span> place_value_key = get_value(key[j]); <span class="comment">// Getting value of character in key</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>                place_value_text = (place_value_text - place_value_key + 26) % 26; <span class="comment">// Applying decryption</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>                <span class="keywordtype">char</span> decrypted_char = get_char(place_value_text); <span class="comment">// Getting new character from decrypted value</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>                decrypted_text += decrypted_char; <span class="comment">// Appending decrypted character</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>            }        </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>            <span class="keywordflow">return</span> decrypted_text; <span class="comment">// Returning decrypted text</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        }</div>
+</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    } <span class="comment">// namespace vigenere</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>} <span class="comment">// namespace ciphers</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="foldopen" id="foldopen00111" data-start="{" data-end="}">
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"><a class="line" href="../../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">  111</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="comment">// Test 1</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    std::string text1 = <span class="stringliteral">&quot;NIKOLATESLA&quot;</span>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::string encrypted1 = ciphers::vigenere::encrypt(text1, <span class="stringliteral">&quot;TESLA&quot;</span>);</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    std::string decrypted1 = ciphers::vigenere::decrypt(encrypted1, <span class="stringliteral">&quot;TESLA&quot;</span>);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    assert(text1 == decrypted1);</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text1;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Encrypted text (with key = TESLA) : &quot;</span> &lt;&lt; encrypted1;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Decrypted text : &quot;</span>&lt;&lt; decrypted1 &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <span class="comment">// Test 2</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    std::string text2 = <span class="stringliteral">&quot;GOOGLEIT&quot;</span>;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    std::string encrypted2 = ciphers::vigenere::encrypt(text2, <span class="stringliteral">&quot;REALLY&quot;</span>);</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    std::string decrypted2 = ciphers::vigenere::decrypt(encrypted2, <span class="stringliteral">&quot;REALLY&quot;</span>);</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    assert(text2 == decrypted2);</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Original text : &quot;</span> &lt;&lt; text2;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Encrypted text (with key = REALLY) : &quot;</span> &lt;&lt; encrypted2;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    std::cout &lt;&lt; <span class="stringliteral">&quot; , Decrypted text : &quot;</span>&lt;&lt; decrypted2 &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>}</div>
+</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
+<div class="foldopen" id="foldopen00131" data-start="{" data-end="}">
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"><a class="line" href="../../dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  131</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="comment">// Testing</span></div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <a class="code hl_function" href="../../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>}</div>
+</div>
+<div class="ttc" id="anamespaceciphers_html"><div class="ttname"><a href="../../d6/d4e/namespaceciphers.html">ciphers</a></div><div class="ttdoc">Algorithms for encryption and decryption.</div></div>
+<div class="ttc" id="anamespacevigenere_html"><div class="ttname"><a href="../../d6/da2/namespacevigenere.html">vigenere</a></div><div class="ttdoc">Functions for vigenère cipher algorithm.</div></div>
+<div class="ttc" id="asha256_8cpp_html_a9e98c180d32b04aab6f767cb0c13e1da"><div class="ttname"><a href="../../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da">hashing::sha256::get_char</a></div><div class="ttdeci">char get_char(const std::string &amp;input, std::size_t pos)</div><div class="ttdoc">Returns the character at pos after the input is padded.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d08/sha256_8cpp_source.html#l00170">sha256.cpp:170</a></div></div>
+<div class="ttc" id="avigenere__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00111">vigenere_cipher.cpp:111</a></div></div>
+<div class="ttc" id="avigenere__cipher_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00131">vigenere_cipher.cpp:131</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_4d6e05837bf820fb089a8a8cdf2f42b7.html">ciphers</a></li><li class="navelem"><a class="el" href="../../dd/d12/vigenere__cipher_8cpp.html">vigenere_cipher.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dd/d1b/structquery.html b/dd/d1b/structquery.html
index 6d8439752..e6509cfc0 100644
--- a/dd/d1b/structquery.html
+++ b/dd/d1b/structquery.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: query Struct Reference</title>
+<title>TheAlgorithms/C++: query Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -113,18 +130,67 @@ $(function(){initNavTree('dd/d1b/structquery.html','../../'); initResizable(true
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:aedd873fb96eb4f83fb4289b1c58ce794" id="r_aedd873fb96eb4f83fb4289b1c58ce794"><td class="memItemLeft" align="right" valign="top"><a id="aedd873fb96eb4f83fb4289b1c58ce794" name="aedd873fb96eb4f83fb4289b1c58ce794"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>l</b></td></tr>
+<tr class="memitem:aedd873fb96eb4f83fb4289b1c58ce794" id="r_aedd873fb96eb4f83fb4289b1c58ce794"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aedd873fb96eb4f83fb4289b1c58ce794">l</a></td></tr>
 <tr class="separator:aedd873fb96eb4f83fb4289b1c58ce794"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a748f5dfd8faf440897bab39091f0a5ca" id="r_a748f5dfd8faf440897bab39091f0a5ca"><td class="memItemLeft" align="right" valign="top"><a id="a748f5dfd8faf440897bab39091f0a5ca" name="a748f5dfd8faf440897bab39091f0a5ca"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>r</b></td></tr>
+<tr class="memitem:a748f5dfd8faf440897bab39091f0a5ca" id="r_a748f5dfd8faf440897bab39091f0a5ca"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a748f5dfd8faf440897bab39091f0a5ca">r</a></td></tr>
 <tr class="separator:a748f5dfd8faf440897bab39091f0a5ca"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a1442afb70f26fd0655914632c0dcadcd" id="r_a1442afb70f26fd0655914632c0dcadcd"><td class="memItemLeft" align="right" valign="top"><a id="a1442afb70f26fd0655914632c0dcadcd" name="a1442afb70f26fd0655914632c0dcadcd"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>i</b></td></tr>
+<tr class="memitem:a1442afb70f26fd0655914632c0dcadcd" id="r_a1442afb70f26fd0655914632c0dcadcd"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1442afb70f26fd0655914632c0dcadcd">i</a></td></tr>
 <tr class="separator:a1442afb70f26fd0655914632c0dcadcd"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../d3/d53/mo_8cpp_source.html#l00009">9</a> of file <a class="el" href="../../d3/d53/mo_8cpp_source.html">mo.cpp</a>.</p>
+</div><h2 class="groupheader">Member Data Documentation</h2>
+<a id="a1442afb70f26fd0655914632c0dcadcd" name="a1442afb70f26fd0655914632c0dcadcd"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a1442afb70f26fd0655914632c0dcadcd">&#9670;&#160;</a></span>i</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int query::i</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d53/mo_8cpp_source.html#l00010">10</a> of file <a class="el" href="../../d3/d53/mo_8cpp_source.html">mo.cpp</a>.</p>
+
+</div>
+</div>
+<a id="aedd873fb96eb4f83fb4289b1c58ce794" name="aedd873fb96eb4f83fb4289b1c58ce794"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aedd873fb96eb4f83fb4289b1c58ce794">&#9670;&#160;</a></span>l</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int query::l</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d53/mo_8cpp_source.html#l00010">10</a> of file <a class="el" href="../../d3/d53/mo_8cpp_source.html">mo.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a748f5dfd8faf440897bab39091f0a5ca" name="a748f5dfd8faf440897bab39091f0a5ca"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a748f5dfd8faf440897bab39091f0a5ca">&#9670;&#160;</a></span>r</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">int query::r</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/d53/mo_8cpp_source.html#l00010">10</a> of file <a class="el" href="../../d3/d53/mo_8cpp_source.html">mo.cpp</a>.</p>
+
+</div>
+</div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>range_queries/<b>mo.cpp</b></li>
+<li>range_queries/<a class="el" href="../../d3/d53/mo_8cpp_source.html">mo.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dd/d1c/classhash__chain.html b/dd/d1c/classhash__chain.html
index dca0bbcdd..bdd2f9764 100644
--- a/dd/d1c/classhash__chain.html
+++ b/dd/d1c/classhash__chain.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: hash_chain Class Reference</title>
+<title>TheAlgorithms/C++: hash_chain Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -147,17 +164,17 @@ Private Types</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:ae8457d13620497fa2046ac566252c4b0" id="r_ae8457d13620497fa2046ac566252c4b0"><td class="memItemLeft" align="right" valign="top"><a id="ae8457d13620497fa2046ac566252c4b0" name="ae8457d13620497fa2046ac566252c4b0"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="#a8b204861e9470377c956d3b5cd313036">Node</a> &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>head</b></td></tr>
-<tr class="memdesc:ae8457d13620497fa2046ac566252c4b0"><td class="mdescLeft">&#160;</td><td class="mdescRight">array of nodes <br /></td></tr>
+<tr class="memitem:ae8457d13620497fa2046ac566252c4b0" id="r_ae8457d13620497fa2046ac566252c4b0"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::shared_ptr&lt; <a class="el" href="#a8b204861e9470377c956d3b5cd313036">Node</a> &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae8457d13620497fa2046ac566252c4b0">head</a></td></tr>
+<tr class="memdesc:ae8457d13620497fa2046ac566252c4b0"><td class="mdescLeft">&#160;</td><td class="mdescRight">array of nodes  <br /></td></tr>
 <tr class="separator:ae8457d13620497fa2046ac566252c4b0"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae9ddce410015ed8dda6380130d82d6c2" id="r_ae9ddce410015ed8dda6380130d82d6c2"><td class="memItemLeft" align="right" valign="top"><a id="ae9ddce410015ed8dda6380130d82d6c2" name="ae9ddce410015ed8dda6380130d82d6c2"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>_mod</b></td></tr>
-<tr class="memdesc:ae9ddce410015ed8dda6380130d82d6c2"><td class="mdescLeft">&#160;</td><td class="mdescRight">modulus of the class <br /></td></tr>
+<tr class="memitem:ae9ddce410015ed8dda6380130d82d6c2" id="r_ae9ddce410015ed8dda6380130d82d6c2"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae9ddce410015ed8dda6380130d82d6c2">_mod</a></td></tr>
+<tr class="memdesc:ae9ddce410015ed8dda6380130d82d6c2"><td class="mdescLeft">&#160;</td><td class="mdescRight">modulus of the class  <br /></td></tr>
 <tr class="separator:ae9ddce410015ed8dda6380130d82d6c2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Chain class with a given modulus. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d92/chaining_8cpp_source.html#l00016">16</a> of file <a class="el" href="../../d9/d92/chaining_8cpp_source.html">chaining.cpp</a>.</p>
 </div><h2 class="groupheader">Member Typedef Documentation</h2>
 <a id="a8b204861e9470377c956d3b5cd313036" name="a8b204861e9470377c956d3b5cd313036"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a8b204861e9470377c956d3b5cd313036">&#9670;&#160;</a></span>Node</h2>
@@ -180,18 +197,18 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>_mod</b></td></tr>
 </div><div class="memdoc">
 <b>Initial value:</b><div class="fragment"><div class="line"> <span class="keyword">struct </span><a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> {</div>
 <div class="line">        <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>{};                         </div>
-<div class="line">        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;struct Node&gt;</a> next;  </div>
+<div class="line">        std::shared_ptr&lt;struct Node&gt; next;  </div>
 <div class="line">    }</div>
-<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
-<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div></div>
-<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
 </div><!-- fragment -->
 <p>Define a linked node. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d92/chaining_8cpp_source.html#l00021">21</a> of file <a class="el" href="../../d9/d92/chaining_8cpp_source.html">chaining.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   21</span>                             {</div>
-<div class="line"><span class="lineno">   22</span>        <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>{};                         <span class="comment">///&lt; data stored in the node</span></div>
-<div class="line"><span class="lineno">   23</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;struct Node&gt;</a> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a>;  <span class="comment">///&lt; pointer to the next node</span></div>
+<div class="line"><span class="lineno">   22</span>        <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>{};                         </div>
+<div class="line"><span class="lineno">   23</span>        std::shared_ptr&lt;struct Node&gt; next;  </div>
 <div class="line"><span class="lineno">   24</span>    };</div>
-<div class="ttc" id="anext_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/next.html">std::next</a></div><div class="ttdeci">T next(T... args)</div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -226,18 +243,14 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>_mod</b></td></tr>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">   35</span>                                 : <a class="code hl_variable" href="#ae9ddce410015ed8dda6380130d82d6c2">_mod</a>(mod) {</div>
-<div class="line"><span class="lineno">   36</span>        <span class="keywordflow">while</span> (mod--) <a class="code hl_variable" href="#ae8457d13620497fa2046ac566252c4b0">head</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<span class="keyword">nullptr</span>);</div>
-<div class="line"><span class="lineno">   37</span>    }</div>
-<div class="ttc" id="aclasshash__chain_html_ae8457d13620497fa2046ac566252c4b0"><div class="ttname"><a href="#ae8457d13620497fa2046ac566252c4b0">hash_chain::head</a></div><div class="ttdeci">std::vector&lt; std::shared_ptr&lt; Node &gt; &gt; head</div><div class="ttdoc">array of nodes</div><div class="ttdef"><b>Definition</b> chaining.cpp:26</div></div>
-<div class="ttc" id="aclasshash__chain_html_ae9ddce410015ed8dda6380130d82d6c2"><div class="ttname"><a href="#ae9ddce410015ed8dda6380130d82d6c2">hash_chain::_mod</a></div><div class="ttdeci">int _mod</div><div class="ttdoc">modulus of the class</div><div class="ttdef"><b>Definition</b> chaining.cpp:27</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-</div><!-- 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="../../dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph.svg" width="375" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d9/d92/chaining_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../d9/d92/chaining_8cpp_source.html">chaining.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   35</span>                                 : <a class="code hl_variable" href="#ae9ddce410015ed8dda6380130d82d6c2">_mod</a>(mod) {</div>
+<div class="line"><span class="lineno">   36</span>        <span class="keywordflow">while</span> (mod--) <a class="code hl_variable" href="#ae8457d13620497fa2046ac566252c4b0">head</a>.push_back(<span class="keyword">nullptr</span>);</div>
+<div class="line"><span class="lineno">   37</span>    }</div>
+<div class="ttc" id="aclasshash__chain_html_ae8457d13620497fa2046ac566252c4b0"><div class="ttname"><a href="#ae8457d13620497fa2046ac566252c4b0">hash_chain::head</a></div><div class="ttdeci">std::vector&lt; std::shared_ptr&lt; Node &gt; &gt; head</div><div class="ttdoc">array of nodes</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d92/chaining_8cpp_source.html#l00026">chaining.cpp:26</a></div></div>
+<div class="ttc" id="aclasshash__chain_html_ae9ddce410015ed8dda6380130d82d6c2"><div class="ttname"><a href="#ae9ddce410015ed8dda6380130d82d6c2">hash_chain::_mod</a></div><div class="ttdeci">int _mod</div><div class="ttdoc">modulus of the class</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d92/chaining_8cpp_source.html#l00027">chaining.cpp:27</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Function Documentation</h2>
@@ -276,9 +289,11 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d92/chaining_8cpp_source.html#l00045">45</a> of file <a class="el" href="../../d9/d92/chaining_8cpp_source.html">chaining.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   45</span>                           {</div>
-<div class="line"><span class="lineno">   46</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Node&gt;</a> curr;</div>
-<div class="line"><span class="lineno">   47</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Node&gt;</a> temp(<span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>);</div>
+<div class="line"><span class="lineno">   46</span>        std::shared_ptr&lt;Node&gt; curr;</div>
+<div class="line"><span class="lineno">   47</span>        std::shared_ptr&lt;Node&gt; temp(<span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>);</div>
 <div class="line"><span class="lineno">   48</span>        temp-&gt;data = x;</div>
 <div class="line"><span class="lineno">   49</span>        temp-&gt;next = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">   50</span>        <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#ae8457d13620497fa2046ac566252c4b0">head</a>[<a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>]) {</div>
@@ -290,13 +305,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   56</span>            curr-&gt;next = temp;</div>
 <div class="line"><span class="lineno">   57</span>        }</div>
 <div class="line"><span class="lineno">   58</span>    }</div>
-<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> hash_search.cpp:45</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d1c/classhash__chain_a6b4b4de1a8c96f98a63a77f650a9dcff_cgraph.svg" width="214" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00045">hash_search.cpp:45</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a706964ad13587fc9a8b3fe8381d410ed" name="a706964ad13587fc9a8b3fe8381d410ed"></a>
@@ -323,32 +333,27 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>Display the chain. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d92/chaining_8cpp_source.html#l00063">63</a> of file <a class="el" href="../../d9/d92/chaining_8cpp_source.html">chaining.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   63</span>                   {</div>
-<div class="line"><span class="lineno">   64</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Node&gt;</a> temp = <span class="keyword">nullptr</span>;</div>
+<div class="line"><span class="lineno">   64</span>        std::shared_ptr&lt;Node&gt; temp = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">   65</span>        <span class="keywordtype">int</span> i = 0;</div>
 <div class="line"><span class="lineno">   66</span>        <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="#ae9ddce410015ed8dda6380130d82d6c2">_mod</a>; i++) {</div>
 <div class="line"><span class="lineno">   67</span>            <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#ae8457d13620497fa2046ac566252c4b0">head</a>[i]) {</div>
-<div class="line"><span class="lineno">   68</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Key &quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; is empty&quot;</span> &lt;&lt; <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">   68</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Key &quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; is empty&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   69</span>            } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   70</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Key &quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; has values = &quot;</span> &lt;&lt; <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">   70</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;Key &quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; has values = &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   71</span>                temp = <a class="code hl_variable" href="#ae8457d13620497fa2046ac566252c4b0">head</a>[i];</div>
 <div class="line"><span class="lineno">   72</span>                <span class="keywordflow">while</span> (temp-&gt;next) {</div>
-<div class="line"><span class="lineno">   73</span>                    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; temp-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; <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">   73</span>                    std::cout &lt;&lt; temp-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   74</span>                    temp = temp-&gt;next;</div>
 <div class="line"><span class="lineno">   75</span>                }</div>
-<div class="line"><span class="lineno">   76</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; temp-&gt;data;</div>
-<div class="line"><span class="lineno">   77</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   76</span>                std::cout &lt;&lt; temp-&gt;data;</div>
+<div class="line"><span class="lineno">   77</span>                std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   78</span>            }</div>
 <div class="line"><span class="lineno">   79</span>        }</div>
 <div class="line"><span class="lineno">   80</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="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><!-- 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="../../dd/d1c/classhash__chain_a706964ad13587fc9a8b3fe8381d410ed_cgraph.svg" width="267" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a55aa5c6753cb8853152d469c375d946a" name="a55aa5c6753cb8853152d469c375d946a"></a>
@@ -389,11 +394,13 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if element found </dd>
 <dd>
 <code>false</code> if element not found </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d92/chaining_8cpp_source.html#l00101">101</a> of file <a class="el" href="../../d9/d92/chaining_8cpp_source.html">chaining.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  101</span>                                  {</div>
-<div class="line"><span class="lineno">  102</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Node&gt;</a> temp = <a class="code hl_variable" href="#ae8457d13620497fa2046ac566252c4b0">head</a>[<a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>];</div>
+<div class="line"><span class="lineno">  102</span>        std::shared_ptr&lt;Node&gt; temp = <a class="code hl_variable" href="#ae8457d13620497fa2046ac566252c4b0">head</a>[<a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>];</div>
 <div class="line"><span class="lineno">  103</span>        <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#ae8457d13620497fa2046ac566252c4b0">head</a>[<a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>]) {</div>
 <div class="line"><span class="lineno">  104</span>            <span class="comment">// index does not exist!</span></div>
-<div class="line"><span class="lineno">  105</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Element not found&quot;</span> &lt;&lt; <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">  105</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Element not found&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  106</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  107</span>        }</div>
 <div class="line"><span class="lineno">  108</span> </div>
@@ -401,27 +408,22 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  110</span>        <span class="keywordflow">while</span> (temp-&gt;data != x &amp;&amp; temp-&gt;next) temp = temp-&gt;next;</div>
 <div class="line"><span class="lineno">  111</span> </div>
 <div class="line"><span class="lineno">  112</span>        <span class="keywordflow">if</span> (temp-&gt;next) {</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> &lt;&lt; <span class="stringliteral">&quot;Element found&quot;</span> &lt;&lt; <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">  113</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Element found&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  114</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</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">// implicit else condition</span></div>
 <div class="line"><span class="lineno">  118</span>        <span class="comment">// i.e., temp-&gt;next == nullptr</span></div>
 <div class="line"><span class="lineno">  119</span>        <span class="keywordflow">if</span> (temp-&gt;data == x) {</div>
-<div class="line"><span class="lineno">  120</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Element found&quot;</span> &lt;&lt; <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">  120</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Element found&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  121</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  122</span>        }</div>
 <div class="line"><span class="lineno">  123</span> </div>
 <div class="line"><span class="lineno">  124</span>        <span class="comment">// further implicit else condition</span></div>
-<div class="line"><span class="lineno">  125</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Element not found&quot;</span> &lt;&lt; <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">  125</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Element not found&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  126</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  127</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d1c/classhash__chain_a55aa5c6753cb8853152d469c375d946a_cgraph.svg" width="247" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a846a2f921f8fb7ea572e03901b671d64" name="a846a2f921f8fb7ea572e03901b671d64"></a>
@@ -456,12 +458,67 @@ Here is the call graph for this function:</div>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>modulus of <code>x</code> </dd></dl>
 <dl class="section note"><dt>Note</dt><dd>declared as a <a href="https://en.cppreference.com/w/cpp/language/virtual" target="_blank"><code>virtual</code></a> so that custom implementations of the class can modify the hash function. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d92/chaining_8cpp_source.html#l00091">91</a> of file <a class="el" href="../../d9/d92/chaining_8cpp_source.html">chaining.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   91</span>{ <span class="keywordflow">return</span> x % <a class="code hl_variable" href="#ae9ddce410015ed8dda6380130d82d6c2">_mod</a>; }</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="ae9ddce410015ed8dda6380130d82d6c2" name="ae9ddce410015ed8dda6380130d82d6c2"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ae9ddce410015ed8dda6380130d82d6c2">&#9670;&#160;</a></span>_mod</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int hash_chain::_mod</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>modulus of the class </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d92/chaining_8cpp_source.html#l00027">27</a> of file <a class="el" href="../../d9/d92/chaining_8cpp_source.html">chaining.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ae8457d13620497fa2046ac566252c4b0" name="ae8457d13620497fa2046ac566252c4b0"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ae8457d13620497fa2046ac566252c4b0">&#9670;&#160;</a></span>head</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::shared_ptr&lt;<a class="el" href="#a8b204861e9470377c956d3b5cd313036">Node</a>&gt; &gt; hash_chain::head</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>array of nodes </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d92/chaining_8cpp_source.html#l00026">26</a> of file <a class="el" href="../../d9/d92/chaining_8cpp_source.html">chaining.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>hashing/<a class="el" href="../../d9/d92/chaining_8cpp.html">chaining.cpp</a></li>
+<li>hashing/<a class="el" href="../../d9/d92/chaining_8cpp_source.html">chaining.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dd/d1c/classhash__chain_a55aa5c6753cb8853152d469c375d946a_cgraph.map b/dd/d1c/classhash__chain_a55aa5c6753cb8853152d469c375d946a_cgraph.map
deleted file mode 100644
index 71f830ad0..000000000
--- a/dd/d1c/classhash__chain_a55aa5c6753cb8853152d469c375d946a_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="hash_chain::find" name="hash_chain::find">
-<area shape="rect" id="Node000001" title="Find if a value and corresponding hash exist." alt="" coords="5,31,122,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="170,5,241,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="122,30,154,25,154,30,123,36"/>
-<area shape="rect" id="Node000003" href="$d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" title=" " alt="" coords="186,55,225,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="123,51,171,59,170,64,122,56"/>
-</map>
diff --git a/dd/d1c/classhash__chain_a55aa5c6753cb8853152d469c375d946a_cgraph.md5 b/dd/d1c/classhash__chain_a55aa5c6753cb8853152d469c375d946a_cgraph.md5
deleted file mode 100644
index e83b49afd..000000000
--- a/dd/d1c/classhash__chain_a55aa5c6753cb8853152d469c375d946a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6c653cf80702cfefbcf7a9cce3cdd9ad
\ No newline at end of file
diff --git a/dd/d1c/classhash__chain_a55aa5c6753cb8853152d469c375d946a_cgraph.svg b/dd/d1c/classhash__chain_a55aa5c6753cb8853152d469c375d946a_cgraph.svg
deleted file mode 100644
index 8f3df0d9d..000000000
--- a/dd/d1c/classhash__chain_a55aa5c6753cb8853152d469c375d946a_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hash_chain::find Pages: 1 -->
-<svg width="185pt" height="64pt"
- viewBox="0.00 0.00 184.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>hash_chain::find</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Find if a value and corresponding hash exist.">
-<polygon fill="#999999" stroke="#666666" points="87.25,-37.25 0,-37.25 0,-18 87.25,-18 87.25,-37.25"/>
-<text text-anchor="middle" x="43.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain::find</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-56.25 123.25,-56.25 123.25,-37 176.75,-37 176.75,-56.25"/>
-<text text-anchor="middle" x="150" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.68,-35.46C95.59,-36.9 103.78,-38.39 111.51,-39.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.82,-43.23 121.29,-41.58 112.07,-36.35 110.82,-43.23"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164.4,-19.25 135.6,-19.25 135.6,0 164.4,0 164.4,-19.25"/>
-<text text-anchor="middle" x="150" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.68,-20.2C100.08,-18.06 113.2,-15.8 124.1,-13.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.56,-17.39 133.82,-12.24 123.37,-10.49 124.56,-17.39"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d1c/classhash__chain_a55aa5c6753cb8853152d469c375d946a_cgraph_org.svg b/dd/d1c/classhash__chain_a55aa5c6753cb8853152d469c375d946a_cgraph_org.svg
deleted file mode 100644
index 9c93146bd..000000000
--- a/dd/d1c/classhash__chain_a55aa5c6753cb8853152d469c375d946a_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hash_chain::find Pages: 1 -->
-<svg width="185pt" height="64pt"
- viewBox="0.00 0.00 184.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>hash_chain::find</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Find if a value and corresponding hash exist.">
-<polygon fill="#999999" stroke="#666666" points="87.25,-37.25 0,-37.25 0,-18 87.25,-18 87.25,-37.25"/>
-<text text-anchor="middle" x="43.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain::find</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-56.25 123.25,-56.25 123.25,-37 176.75,-37 176.75,-56.25"/>
-<text text-anchor="middle" x="150" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.68,-35.46C95.59,-36.9 103.78,-38.39 111.51,-39.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.82,-43.23 121.29,-41.58 112.07,-36.35 110.82,-43.23"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="164.4,-19.25 135.6,-19.25 135.6,0 164.4,0 164.4,-19.25"/>
-<text text-anchor="middle" x="150" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.68,-20.2C100.08,-18.06 113.2,-15.8 124.1,-13.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.56,-17.39 133.82,-12.24 123.37,-10.49 124.56,-17.39"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d1c/classhash__chain_a6b4b4de1a8c96f98a63a77f650a9dcff_cgraph.map b/dd/d1c/classhash__chain_a6b4b4de1a8c96f98a63a77f650a9dcff_cgraph.map
deleted file mode 100644
index 2311ce82b..000000000
--- a/dd/d1c/classhash__chain_a6b4b4de1a8c96f98a63a77f650a9dcff_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="hash_chain::add" name="hash_chain::add">
-<area shape="rect" id="Node000001" title="create and add a new node with a give value and at a given height" alt="" coords="5,5,122,31"/>
-<area shape="rect" id="Node000002" href="$d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" title=" " alt="" coords="170,5,208,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="122,16,154,16,154,21,122,21"/>
-</map>
diff --git a/dd/d1c/classhash__chain_a6b4b4de1a8c96f98a63a77f650a9dcff_cgraph.md5 b/dd/d1c/classhash__chain_a6b4b4de1a8c96f98a63a77f650a9dcff_cgraph.md5
deleted file mode 100644
index 20b46f66d..000000000
--- a/dd/d1c/classhash__chain_a6b4b4de1a8c96f98a63a77f650a9dcff_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b39816d75a314789f7fb4571a8185008
\ No newline at end of file
diff --git a/dd/d1c/classhash__chain_a6b4b4de1a8c96f98a63a77f650a9dcff_cgraph.svg b/dd/d1c/classhash__chain_a6b4b4de1a8c96f98a63a77f650a9dcff_cgraph.svg
deleted file mode 100644
index 37a7c5a71..000000000
--- a/dd/d1c/classhash__chain_a6b4b4de1a8c96f98a63a77f650a9dcff_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hash_chain::add Pages: 1 -->
-<svg width="160pt" height="27pt"
- viewBox="0.00 0.00 160.05 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>hash_chain::add</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="create and add a new node with a give value and at a given height">
-<polygon fill="#999999" stroke="#666666" points="87.25,-19.25 0,-19.25 0,0 87.25,0 87.25,-19.25"/>
-<text text-anchor="middle" x="43.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain::add</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152.05,-19.25 123.25,-19.25 123.25,0 152.05,0 152.05,-19.25"/>
-<text text-anchor="middle" x="137.65" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.67,-9.62C95.82,-9.62 104.1,-9.62 111.47,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.33,-13.13 121.33,-9.63 111.33,-6.13 111.33,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d1c/classhash__chain_a6b4b4de1a8c96f98a63a77f650a9dcff_cgraph_org.svg b/dd/d1c/classhash__chain_a6b4b4de1a8c96f98a63a77f650a9dcff_cgraph_org.svg
deleted file mode 100644
index c516af5db..000000000
--- a/dd/d1c/classhash__chain_a6b4b4de1a8c96f98a63a77f650a9dcff_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hash_chain::add Pages: 1 -->
-<svg width="160pt" height="27pt"
- viewBox="0.00 0.00 160.05 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>hash_chain::add</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="create and add a new node with a give value and at a given height">
-<polygon fill="#999999" stroke="#666666" points="87.25,-19.25 0,-19.25 0,0 87.25,0 87.25,-19.25"/>
-<text text-anchor="middle" x="43.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain::add</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152.05,-19.25 123.25,-19.25 123.25,0 152.05,0 152.05,-19.25"/>
-<text text-anchor="middle" x="137.65" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.67,-9.62C95.82,-9.62 104.1,-9.62 111.47,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.33,-13.13 121.33,-9.63 111.33,-6.13 111.33,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d1c/classhash__chain_a706964ad13587fc9a8b3fe8381d410ed_cgraph.map b/dd/d1c/classhash__chain_a706964ad13587fc9a8b3fe8381d410ed_cgraph.map
deleted file mode 100644
index 44cfce58b..000000000
--- a/dd/d1c/classhash__chain_a706964ad13587fc9a8b3fe8381d410ed_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="hash_chain::display" name="hash_chain::display">
-<area shape="rect" id="Node000001" title="Display the chain." alt="" coords="5,5,142,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="190,5,261,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="142,16,174,16,174,21,142,21"/>
-</map>
diff --git a/dd/d1c/classhash__chain_a706964ad13587fc9a8b3fe8381d410ed_cgraph.md5 b/dd/d1c/classhash__chain_a706964ad13587fc9a8b3fe8381d410ed_cgraph.md5
deleted file mode 100644
index 7bcb90769..000000000
--- a/dd/d1c/classhash__chain_a706964ad13587fc9a8b3fe8381d410ed_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c0155828a315f36ceffe66a9b86a1e71
\ No newline at end of file
diff --git a/dd/d1c/classhash__chain_a706964ad13587fc9a8b3fe8381d410ed_cgraph.svg b/dd/d1c/classhash__chain_a706964ad13587fc9a8b3fe8381d410ed_cgraph.svg
deleted file mode 100644
index 1c19a724a..000000000
--- a/dd/d1c/classhash__chain_a706964ad13587fc9a8b3fe8381d410ed_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hash_chain::display Pages: 1 -->
-<svg width="200pt" height="27pt"
- viewBox="0.00 0.00 199.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>hash_chain::display</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Display the chain.">
-<polygon fill="#999999" stroke="#666666" points="102.25,-19.25 0,-19.25 0,0 102.25,0 102.25,-19.25"/>
-<text text-anchor="middle" x="51.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain::display</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191.75,-19.25 138.25,-19.25 138.25,0 191.75,0 191.75,-19.25"/>
-<text text-anchor="middle" x="165" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.5,-9.62C110.49,-9.62 118.64,-9.62 126.27,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.25,-13.13 136.25,-9.63 126.25,-6.13 126.25,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d1c/classhash__chain_a706964ad13587fc9a8b3fe8381d410ed_cgraph_org.svg b/dd/d1c/classhash__chain_a706964ad13587fc9a8b3fe8381d410ed_cgraph_org.svg
deleted file mode 100644
index a8dbf5700..000000000
--- a/dd/d1c/classhash__chain_a706964ad13587fc9a8b3fe8381d410ed_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hash_chain::display Pages: 1 -->
-<svg width="200pt" height="27pt"
- viewBox="0.00 0.00 199.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>hash_chain::display</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Display the chain.">
-<polygon fill="#999999" stroke="#666666" points="102.25,-19.25 0,-19.25 0,0 102.25,0 102.25,-19.25"/>
-<text text-anchor="middle" x="51.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain::display</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191.75,-19.25 138.25,-19.25 138.25,0 191.75,0 191.75,-19.25"/>
-<text text-anchor="middle" x="165" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.5,-9.62C110.49,-9.62 118.64,-9.62 126.27,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.25,-13.13 136.25,-9.63 126.25,-6.13 126.25,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph.map b/dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph.map
deleted file mode 100644
index 47a50c260..000000000
--- a/dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="hash_chain::hash_chain" name="hash_chain::hash_chain">
-<area shape="rect" id="Node000001" title="Construct a new chain object." alt="" coords="5,5,167,31"/>
-<area shape="rect" id="Node000002" 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="215,5,369,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="167,16,199,16,199,21,167,21"/>
-</map>
diff --git a/dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph.md5 b/dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph.md5
deleted file mode 100644
index a0c34fdea..000000000
--- a/dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-05cd548697a684428f5285d292ad3503
\ No newline at end of file
diff --git a/dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph.svg b/dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph.svg
deleted file mode 100644
index 6cca1455f..000000000
--- a/dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hash_chain::hash_chain Pages: 1 -->
-<svg width="281pt" height="27pt"
- viewBox="0.00 0.00 280.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>hash_chain::hash_chain</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Construct a new chain object.">
-<polygon fill="#999999" stroke="#666666" points="121,-19.25 0,-19.25 0,0 121,0 121,-19.25"/>
-<text text-anchor="middle" x="60.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain::hash_chain</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272.75,-19.25 157,-19.25 157,0 272.75,0 272.75,-19.25"/>
-<text text-anchor="middle" x="214.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.29,-9.62C129.22,-9.62 137.4,-9.62 145.47,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.24,-13.13 155.24,-9.63 145.24,-6.13 145.24,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph_org.svg b/dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph_org.svg
deleted file mode 100644
index d10c6bdaa..000000000
--- a/dd/d1c/classhash__chain_a80c8b902a15b4fd062ed727ecf8f3595_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: hash_chain::hash_chain Pages: 1 -->
-<svg width="281pt" height="27pt"
- viewBox="0.00 0.00 280.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>hash_chain::hash_chain</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Construct a new chain object.">
-<polygon fill="#999999" stroke="#666666" points="121,-19.25 0,-19.25 0,0 121,0 121,-19.25"/>
-<text text-anchor="middle" x="60.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain::hash_chain</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272.75,-19.25 157,-19.25 157,0 272.75,0 272.75,-19.25"/>
-<text text-anchor="middle" x="214.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.29,-9.62C129.22,-9.62 137.4,-9.62 145.47,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.24,-13.13 155.24,-9.63 145.24,-6.13 145.24,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d1e/generate__parentheses_8cpp.html b/dd/d1e/generate__parentheses_8cpp.html
index 2499d08df..22a6db25d 100644
--- a/dd/d1e/generate__parentheses_8cpp.html
+++ b/dd/d1e/generate__parentheses_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: backtracking/generate_parentheses.cpp File Reference</title>
+<title>TheAlgorithms/C++: backtracking/generate_parentheses.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for generate_parentheses.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../da/dc1/generate__parentheses_8cpp__incl.svg" width="252" height="126"><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">
+</div>
+<p><a href="../../dd/d1e/generate__parentheses_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/de5/classbacktracking_1_1generate__parentheses.html">backtracking::generate_parentheses</a></td></tr>
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Well-formed <a href="https://leetcode.com/explore/interview/card/top-interview-questions-medium/109/backtracking/794/" target="_blank">Generated Parentheses</a> with all combinations. </p>
 <p>a sequence of parentheses is well-formed if each opening parentheses has a corresponding closing parenthesis and the closing parentheses are correctly ordered</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/WoWS17" target="_blank">Giuseppe Coco</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../dd/d1e/generate__parentheses_8cpp_source.html">generate_parentheses.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="gae66f6b31b5ad750f1fe042a706a4e3d4" name="gae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#gae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -167,19 +188,16 @@ Functions</h2></td></tr>
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit</dd></dl>
 <p>Driver Code </p>
-<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html#a4">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/iterative_factorial.cpp</a>, <a class="el" href="../../df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html#a10">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/quadratic_equations_complex_numbers.cpp</a>, <a class="el" href="../../dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html#a6">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp</a>, and <a class="el" href="../../dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html#a11">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp</a>.</dd>
+<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html#a2">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/iterative_factorial.cpp</a>, <a class="el" href="../../df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html#a3">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/quadratic_equations_complex_numbers.cpp</a>, <a class="el" href="../../dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html#a4">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp</a>, and <a class="el" href="../../dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html#a3">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp</a>.</dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">110</a> of file <a class="el" href="../../dd/d1e/generate__parentheses_8cpp_source.html">generate_parentheses.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  110</span>           {</div>
 <div class="line"><span class="lineno">  111</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  112</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  113</span>}</div>
-<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> generate_parentheses.cpp:82</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../dd/d1e/generate__parentheses_8cpp_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="406"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00082">generate_parentheses.cpp:82</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -207,11 +225,13 @@ 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>
-<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html#a2">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/iterative_factorial.cpp</a>, <a class="el" href="../../df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html#a8">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/quadratic_equations_complex_numbers.cpp</a>, <a class="el" href="../../dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html#a4">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp</a>, and <a class="el" href="../../dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html#a7">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp</a>.</dd>
+<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html#a1">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/iterative_factorial.cpp</a>, <a class="el" href="../../df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html#a2">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/quadratic_equations_complex_numbers.cpp</a>, <a class="el" href="../../dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html#a3">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp</a>, and <a class="el" href="../../dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html#a2">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp</a>.</dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00082">82</a> of file <a class="el" href="../../dd/d1e/generate__parentheses_8cpp_source.html">generate_parentheses.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   82</span>                   {</div>
 <div class="line"><span class="lineno">   83</span>    <span class="keywordtype">int</span> n = 0;</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&lt;std::string&gt;</a> patterns;</div>
+<div class="line"><span class="lineno">   84</span>    std::vector&lt;std::string&gt; patterns;</div>
 <div class="line"><span class="lineno">   85</span>    <a class="code hl_class" href="../../df/de5/classbacktracking_1_1generate__parentheses.html">backtracking::generate_parentheses</a> p;</div>
 <div class="line"><span class="lineno">   86</span> </div>
 <div class="line"><span class="lineno">   87</span>    n = 1;</div>
@@ -230,18 +250,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  100</span>                {<span class="stringliteral">&quot;((()()))&quot;</span>}, {<span class="stringliteral">&quot;(((())))&quot;</span>}};</div>
 <div class="line"><span class="lineno">  101</span>    assert(p.<a class="code hl_function" href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160">generate</a>(n) == patterns);</div>
 <div class="line"><span class="lineno">  102</span> </div>
-<div class="line"><span class="lineno">  103</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  103</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  104</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="aclassbacktracking_1_1generate__parentheses_html"><div class="ttname"><a href="../../df/de5/classbacktracking_1_1generate__parentheses.html">backtracking::generate_parentheses</a></div><div class="ttdoc">generate_parentheses class</div><div class="ttdef"><b>Definition</b> generate_parentheses.cpp:26</div></div>
-<div class="ttc" id="aclassbacktracking_1_1generate__parentheses_html_af39c03d80ce0ba9fbf659b420980d160"><div class="ttname"><a href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160">backtracking::generate_parentheses::generate</a></div><div class="ttdeci">std::vector&lt; std::string &gt; generate(int n)</div><div class="ttdoc">wrapper interface</div><div class="ttdef"><b>Definition</b> generate_parentheses.cpp:70</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>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../dd/d1e/generate__parentheses_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="406"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassbacktracking_1_1generate__parentheses_html"><div class="ttname"><a href="../../df/de5/classbacktracking_1_1generate__parentheses.html">backtracking::generate_parentheses</a></div><div class="ttdoc">generate_parentheses class</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00026">generate_parentheses.cpp:26</a></div></div>
+<div class="ttc" id="aclassbacktracking_1_1generate__parentheses_html_af39c03d80ce0ba9fbf659b420980d160"><div class="ttname"><a href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160">backtracking::generate_parentheses::generate</a></div><div class="ttdeci">std::vector&lt; std::string &gt; generate(int n)</div><div class="ttdoc">wrapper interface</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00070">generate_parentheses.cpp:70</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dd/d1e/generate__parentheses_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/dd/d1e/generate__parentheses_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index c3dc6ebc4..000000000
--- a/dd/d1e/generate__parentheses_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,14 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,47,49,72"/>
-<area shape="rect" id="Node000002" href="$df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" title="wrapper interface" alt="" coords="97,39,254,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,57,82,57,82,62,49,62"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/clear.html#" title=" " alt="" coords="332,5,452,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="254,42,317,30,318,35,255,47"/>
-<area shape="rect" id="Node000004" href="$df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" title="function that adds parenthesis to the string." alt="" coords="302,79,482,120"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="255,71,287,77,286,83,254,77"/>
-<area shape="poly" id="edge5_Node000004_Node000004" title=" " alt="" coords="351,79,349,69,356,60,370,55,392,53,416,55,429,61,427,66,414,60,392,58,372,60,359,64,355,70,357,78"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="546,61,669,87"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="482,86,530,81,531,86,483,92"/>
-<area shape="rect" id="Node000006" 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="530,111,685,136"/>
-<area shape="poly" id="edge6_Node000004_Node000006" title=" " alt="" coords="483,107,515,111,514,116,482,112"/>
-</map>
diff --git a/dd/d1e/generate__parentheses_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/dd/d1e/generate__parentheses_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 945c6e1f5..000000000
--- a/dd/d1e/generate__parentheses_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ae0d522f38ae40c327069818e4acb44a
\ No newline at end of file
diff --git a/dd/d1e/generate__parentheses_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/dd/d1e/generate__parentheses_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 2a28449c3..000000000
--- a/dd/d1e/generate__parentheses_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,205 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<!--zoomable 106 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 518;
-var viewHeight = 106;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-67.25 0,-67.25 0,-48 32.5,-48 32.5,-67.25"/>
-<text text-anchor="middle" x="16.25" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" target="_top" xlink:title="wrapper interface">
-<polygon fill="white" stroke="#666666" points="186.5,-72.88 68.5,-72.88 68.5,-42.38 186.5,-42.38 186.5,-72.88"/>
-<text text-anchor="start" x="76.5" y="-59.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="127.5" y="-48.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::generate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.9,-57.62C39.7,-57.62 48.17,-57.62 57.23,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.97,-61.13 66.97,-57.63 56.97,-54.13 56.97,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="334.88,-98.25 245.38,-98.25 245.38,-79 334.88,-79 334.88,-98.25"/>
-<text text-anchor="middle" x="290.12" y="-84.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.94,-68.9C202.24,-71.86 218.68,-75.03 233.81,-77.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.11,-81.38 243.6,-79.84 234.44,-74.51 233.11,-81.38"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" target="_top" xlink:title="function that adds parenthesis to the string.">
-<polygon fill="white" stroke="#666666" points="357.75,-42.88 222.5,-42.88 222.5,-12.37 357.75,-12.37 357.75,-42.88"/>
-<text text-anchor="start" x="230.5" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="290.12" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::makeStrings</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.94,-46.71C194.69,-45.26 202.72,-43.76 210.73,-42.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="211.33,-45.71 220.52,-40.44 210.05,-38.83 211.33,-45.71"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M261.51,-43.36C255.67,-52.43 265.21,-60.88 290.12,-60.88 303.75,-60.88 312.78,-58.35 317.21,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.65,-55.24 318.54,-44.86 313.71,-54.29 320.65,-55.24"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="497.5,-56.25 405.75,-56.25 405.75,-37 497.5,-37 497.5,-56.25"/>
-<text text-anchor="middle" x="451.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M357.84,-35.57C369.88,-37.01 382.32,-38.49 394.04,-39.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.62,-43.36 403.96,-41.07 394.45,-36.41 393.62,-43.36"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="509.5,-19.25 393.75,-19.25 393.75,0 509.5,0 509.5,-19.25"/>
-<text text-anchor="middle" x="451.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge6_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge6_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M357.84,-20.1C365.85,-19.19 374.04,-18.27 382.07,-17.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="382.24,-20.86 391.78,-16.27 381.45,-13.91 382.24,-20.86"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="generate__parentheses_8cpp_aa8dca7b867074164d5f45b0f3851269d_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d1e/generate__parentheses_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/dd/d1e/generate__parentheses_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 48a3d2d68..000000000
--- a/dd/d1e/generate__parentheses_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,122 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="518pt" height="106pt"
- viewBox="0.00 0.00 517.50 106.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 102.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-67.25 0,-67.25 0,-48 32.5,-48 32.5,-67.25"/>
-<text text-anchor="middle" x="16.25" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" target="_top" xlink:title="wrapper interface">
-<polygon fill="white" stroke="#666666" points="186.5,-72.88 68.5,-72.88 68.5,-42.38 186.5,-42.38 186.5,-72.88"/>
-<text text-anchor="start" x="76.5" y="-59.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="127.5" y="-48.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::generate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.9,-57.62C39.7,-57.62 48.17,-57.62 57.23,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.97,-61.13 66.97,-57.63 56.97,-54.13 56.97,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="334.88,-98.25 245.38,-98.25 245.38,-79 334.88,-79 334.88,-98.25"/>
-<text text-anchor="middle" x="290.12" y="-84.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.94,-68.9C202.24,-71.86 218.68,-75.03 233.81,-77.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.11,-81.38 243.6,-79.84 234.44,-74.51 233.11,-81.38"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" target="_top" xlink:title="function that adds parenthesis to the string.">
-<polygon fill="white" stroke="#666666" points="357.75,-42.88 222.5,-42.88 222.5,-12.37 357.75,-12.37 357.75,-42.88"/>
-<text text-anchor="start" x="230.5" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="290.12" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::makeStrings</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.94,-46.71C194.69,-45.26 202.72,-43.76 210.73,-42.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="211.33,-45.71 220.52,-40.44 210.05,-38.83 211.33,-45.71"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M261.51,-43.36C255.67,-52.43 265.21,-60.88 290.12,-60.88 303.75,-60.88 312.78,-58.35 317.21,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="320.65,-55.24 318.54,-44.86 313.71,-54.29 320.65,-55.24"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="497.5,-56.25 405.75,-56.25 405.75,-37 497.5,-37 497.5,-56.25"/>
-<text text-anchor="middle" x="451.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M357.84,-35.57C369.88,-37.01 382.32,-38.49 394.04,-39.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.62,-43.36 403.96,-41.07 394.45,-36.41 393.62,-43.36"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="509.5,-19.25 393.75,-19.25 393.75,0 509.5,0 509.5,-19.25"/>
-<text text-anchor="middle" x="451.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge6_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge6_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M357.84,-20.1C365.85,-19.19 374.04,-18.27 382.07,-17.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="382.24,-20.86 391.78,-16.27 381.45,-13.91 382.24,-20.86"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d1e/generate__parentheses_8cpp_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dd/d1e/generate__parentheses_8cpp_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index d96e0e390..000000000
--- a/dd/d1e/generate__parentheses_8cpp_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,47,55,72"/>
-<area shape="rect" id="Node000002" href="$dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,47,146,72"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,57,87,57,87,62,55,62"/>
-<area shape="rect" id="Node000003" href="$df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" title="wrapper interface" alt="" coords="194,39,351,80"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="147,57,179,57,179,62,147,62"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/clear.html#" title=" " alt="" coords="430,5,549,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="351,42,414,30,415,35,352,47"/>
-<area shape="rect" id="Node000005" href="$df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" title="function that adds parenthesis to the string." alt="" coords="399,79,580,120"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="352,71,384,77,383,83,351,77"/>
-<area shape="poly" id="edge6_Node000005_Node000005" title=" " alt="" coords="449,79,447,69,453,60,468,55,490,53,513,55,527,61,525,66,511,60,489,58,469,60,457,64,452,70,454,78"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="644,61,766,87"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="579,86,628,81,628,86,580,92"/>
-<area shape="rect" id="Node000007" 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="628,111,782,136"/>
-<area shape="poly" id="edge7_Node000005_Node000007" title=" " alt="" coords="580,107,612,111,612,116,579,112"/>
-</map>
diff --git a/dd/d1e/generate__parentheses_8cpp_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dd/d1e/generate__parentheses_8cpp_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 9bc4719fb..000000000
--- a/dd/d1e/generate__parentheses_8cpp_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-351b45865712bd536eaa59b6088c5639
\ No newline at end of file
diff --git a/dd/d1e/generate__parentheses_8cpp_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dd/d1e/generate__parentheses_8cpp_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index f0c22a184..000000000
--- a/dd/d1e/generate__parentheses_8cpp_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,223 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 106 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 591;
-var viewHeight = 106;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-67.25 0,-67.25 0,-48 37,-48 37,-67.25"/>
-<text text-anchor="middle" x="18.5" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-67.25 73,-67.25 73,-48 105.5,-48 105.5,-67.25"/>
-<text text-anchor="middle" x="89.25" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-57.62C44.58,-57.62 53.31,-57.62 61.45,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-61.13 71.2,-57.63 61.2,-54.13 61.2,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" target="_top" xlink:title="wrapper interface">
-<polygon fill="white" stroke="#666666" points="259.5,-72.88 141.5,-72.88 141.5,-42.38 259.5,-42.38 259.5,-72.88"/>
-<text text-anchor="start" x="149.5" y="-59.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="200.5" y="-48.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::generate</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.9,-57.62C112.7,-57.62 121.17,-57.62 130.23,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.97,-61.13 139.97,-57.63 129.97,-54.13 129.97,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="407.88,-98.25 318.38,-98.25 318.38,-79 407.88,-79 407.88,-98.25"/>
-<text text-anchor="middle" x="363.12" y="-84.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.94,-68.9C275.24,-71.86 291.68,-75.03 306.81,-77.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="306.11,-81.38 316.6,-79.84 307.44,-74.51 306.11,-81.38"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" target="_top" xlink:title="function that adds parenthesis to the string.">
-<polygon fill="white" stroke="#666666" points="430.75,-42.88 295.5,-42.88 295.5,-12.37 430.75,-12.37 430.75,-42.88"/>
-<text text-anchor="start" x="303.5" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="363.12" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::makeStrings</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.94,-46.71C267.69,-45.26 275.72,-43.76 283.73,-42.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.33,-45.71 293.52,-40.44 283.05,-38.83 284.33,-45.71"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M334.51,-43.36C328.67,-52.43 338.21,-60.88 363.12,-60.88 376.75,-60.88 385.78,-58.35 390.21,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.65,-55.24 391.54,-44.86 386.71,-54.29 393.65,-55.24"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="570.5,-56.25 478.75,-56.25 478.75,-37 570.5,-37 570.5,-56.25"/>
-<text text-anchor="middle" x="524.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M430.84,-35.57C442.88,-37.01 455.32,-38.49 467.04,-39.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="466.62,-43.36 476.96,-41.07 467.45,-36.41 466.62,-43.36"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="582.5,-19.25 466.75,-19.25 466.75,0 582.5,0 582.5,-19.25"/>
-<text text-anchor="middle" x="524.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge7_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge7_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M430.84,-20.1C438.85,-19.19 447.04,-18.27 455.07,-17.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="455.24,-20.86 464.78,-16.27 454.45,-13.91 455.24,-20.86"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="generate__parentheses_8cpp_gae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d1e/generate__parentheses_8cpp_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dd/d1e/generate__parentheses_8cpp_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index baf2afd91..000000000
--- a/dd/d1e/generate__parentheses_8cpp_gae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,140 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="591pt" height="106pt"
- viewBox="0.00 0.00 590.50 106.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 102.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-67.25 0,-67.25 0,-48 37,-48 37,-67.25"/>
-<text text-anchor="middle" x="18.5" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-67.25 73,-67.25 73,-48 105.5,-48 105.5,-67.25"/>
-<text text-anchor="middle" x="89.25" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-57.62C44.58,-57.62 53.31,-57.62 61.45,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-61.13 71.2,-57.63 61.2,-54.13 61.2,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" target="_top" xlink:title="wrapper interface">
-<polygon fill="white" stroke="#666666" points="259.5,-72.88 141.5,-72.88 141.5,-42.38 259.5,-42.38 259.5,-72.88"/>
-<text text-anchor="start" x="149.5" y="-59.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="200.5" y="-48.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::generate</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.9,-57.62C112.7,-57.62 121.17,-57.62 130.23,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.97,-61.13 139.97,-57.63 129.97,-54.13 129.97,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="407.88,-98.25 318.38,-98.25 318.38,-79 407.88,-79 407.88,-98.25"/>
-<text text-anchor="middle" x="363.12" y="-84.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.94,-68.9C275.24,-71.86 291.68,-75.03 306.81,-77.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="306.11,-81.38 316.6,-79.84 307.44,-74.51 306.11,-81.38"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" target="_top" xlink:title="function that adds parenthesis to the string.">
-<polygon fill="white" stroke="#666666" points="430.75,-42.88 295.5,-42.88 295.5,-12.37 430.75,-12.37 430.75,-42.88"/>
-<text text-anchor="start" x="303.5" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="363.12" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::makeStrings</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.94,-46.71C267.69,-45.26 275.72,-43.76 283.73,-42.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="284.33,-45.71 293.52,-40.44 283.05,-38.83 284.33,-45.71"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M334.51,-43.36C328.67,-52.43 338.21,-60.88 363.12,-60.88 376.75,-60.88 385.78,-58.35 390.21,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="393.65,-55.24 391.54,-44.86 386.71,-54.29 393.65,-55.24"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="570.5,-56.25 478.75,-56.25 478.75,-37 570.5,-37 570.5,-56.25"/>
-<text text-anchor="middle" x="524.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M430.84,-35.57C442.88,-37.01 455.32,-38.49 467.04,-39.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="466.62,-43.36 476.96,-41.07 467.45,-36.41 466.62,-43.36"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="582.5,-19.25 466.75,-19.25 466.75,0 582.5,0 582.5,-19.25"/>
-<text text-anchor="middle" x="524.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge7_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge7_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M430.84,-20.1C438.85,-19.19 447.04,-18.27 455.07,-17.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="455.24,-20.86 464.78,-16.27 454.45,-13.91 455.24,-20.86"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d1e/generate__parentheses_8cpp_source.html b/dd/d1e/generate__parentheses_8cpp_source.html
new file mode 100644
index 000000000..f892ae419
--- /dev/null
+++ b/dd/d1e/generate__parentheses_8cpp_source.html
@@ -0,0 +1,225 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: backtracking/generate_parentheses.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dd/d1e/generate__parentheses_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">generate_parentheses.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dd/d1e/generate__parentheses_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../db/dc0/namespacebacktracking.html">backtracking</a> {</div>
+<div class="foldopen" id="foldopen00026" data-start="{" data-end="};">
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"><a class="line" href="../../df/de5/classbacktracking_1_1generate__parentheses.html">   26</a></span><span class="keyword">class </span><a class="code hl_class" href="../../df/de5/classbacktracking_1_1generate__parentheses.html">generate_parentheses</a> {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"><a class="line" href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ab35b9b6d2886abed3d6fb05c2be1c508">   28</a></span>    std::vector&lt;std::string&gt; <a class="code hl_variable" href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ab35b9b6d2886abed3d6fb05c2be1c508">res</a>;  </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec">makeStrings</a>(std::string str, <span class="keywordtype">int</span> n, <span class="keywordtype">int</span> closed, <span class="keywordtype">int</span> open);</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    std::vector&lt;std::string&gt; <a class="code hl_function" href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160">generate</a>(<span class="keywordtype">int</span> n);</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>};</div>
+</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="foldopen" id="foldopen00045" data-start="{" data-end="}">
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec">   45</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec">generate_parentheses::makeStrings</a>(std::string str, <span class="keywordtype">int</span> n,</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>                                                     <span class="keywordtype">int</span> closed, <span class="keywordtype">int</span> open) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">if</span> (closed &gt; open)  <span class="comment">// We can never have more closed than open</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordflow">if</span> ((str.length() == 2 * n) &amp;&amp;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        (closed != open)) {  <span class="comment">// closed and open must be the same</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    }</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordflow">if</span> (str.length() == 2 * n) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        <a class="code hl_variable" href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ab35b9b6d2886abed3d6fb05c2be1c508">res</a>.push_back(str);</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <a class="code hl_function" href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec">makeStrings</a>(str + <span class="charliteral">&#39;)&#39;</span>, n, closed + 1, open);</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <a class="code hl_function" href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec">makeStrings</a>(str + <span class="charliteral">&#39;(&#39;</span>, n, closed, open + 1);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>}</div>
+</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="foldopen" id="foldopen00070" data-start="{" data-end="}">
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"><a class="line" href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160">   70</a></span>std::vector&lt;std::string&gt; <a class="code hl_function" href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160">generate_parentheses::generate</a>(<span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <a class="code hl_variable" href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ab35b9b6d2886abed3d6fb05c2be1c508">backtracking::generate_parentheses::res</a>.clear();</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    std::string str = <span class="stringliteral">&quot;(&quot;</span>;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <a class="code hl_function" href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec">generate_parentheses::makeStrings</a>(str, n, 0, 1);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keywordflow">return</span> <a class="code hl_variable" href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ab35b9b6d2886abed3d6fb05c2be1c508">res</a>;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>}</div>
+</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>}  <span class="comment">// namespace backtracking</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="foldopen" id="foldopen00082" data-start="{" data-end="}">
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   82</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordtype">int</span> n = 0;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::vector&lt;std::string&gt; patterns;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <a class="code hl_class" href="../../df/de5/classbacktracking_1_1generate__parentheses.html">backtracking::generate_parentheses</a> p;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    n = 1;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    patterns = {{<span class="stringliteral">&quot;()&quot;</span>}};</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    assert(p.<a class="code hl_function" href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160">generate</a>(n) == patterns);</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    n = 3;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    patterns = {{<span class="stringliteral">&quot;()()()&quot;</span>}, {<span class="stringliteral">&quot;()(())&quot;</span>}, {<span class="stringliteral">&quot;(())()&quot;</span>}, {<span class="stringliteral">&quot;(()())&quot;</span>}, {<span class="stringliteral">&quot;((()))&quot;</span>}};</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    assert(p.<a class="code hl_function" href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160">generate</a>(n) == patterns);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    n = 4;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    patterns = {{<span class="stringliteral">&quot;()()()()&quot;</span>}, {<span class="stringliteral">&quot;()()(())&quot;</span>}, {<span class="stringliteral">&quot;()(())()&quot;</span>}, {<span class="stringliteral">&quot;()(()())&quot;</span>},</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>                {<span class="stringliteral">&quot;()((()))&quot;</span>}, {<span class="stringliteral">&quot;(())()()&quot;</span>}, {<span class="stringliteral">&quot;(())(())&quot;</span>}, {<span class="stringliteral">&quot;(()())()&quot;</span>},</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>                {<span class="stringliteral">&quot;(()()())&quot;</span>}, {<span class="stringliteral">&quot;(()(()))&quot;</span>}, {<span class="stringliteral">&quot;((()))()&quot;</span>}, {<span class="stringliteral">&quot;((())())&quot;</span>},</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>                {<span class="stringliteral">&quot;((()()))&quot;</span>}, {<span class="stringliteral">&quot;(((())))&quot;</span>}};</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    assert(p.<a class="code hl_function" href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160">generate</a>(n) == patterns);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests passed\n&quot;</span>;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>}</div>
+</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
+<div class="foldopen" id="foldopen00110" data-start="{" data-end="}">
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"><a class="line" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">  110</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>}</div>
+</div>
+<div class="ttc" id="aclassbacktracking_1_1generate__parentheses_html"><div class="ttname"><a href="../../df/de5/classbacktracking_1_1generate__parentheses.html">backtracking::generate_parentheses</a></div><div class="ttdoc">generate_parentheses class</div><div class="ttdef"><b>Definition</b> <a href="#l00026">generate_parentheses.cpp:26</a></div></div>
+<div class="ttc" id="aclassbacktracking_1_1generate__parentheses_html_ab35b9b6d2886abed3d6fb05c2be1c508"><div class="ttname"><a href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ab35b9b6d2886abed3d6fb05c2be1c508">backtracking::generate_parentheses::res</a></div><div class="ttdeci">std::vector&lt; std::string &gt; res</div><div class="ttdoc">Contains all possible valid patterns.</div><div class="ttdef"><b>Definition</b> <a href="#l00028">generate_parentheses.cpp:28</a></div></div>
+<div class="ttc" id="aclassbacktracking_1_1generate__parentheses_html_ac1489edd65374f22fe04851051f0a2ec"><div class="ttname"><a href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec">backtracking::generate_parentheses::makeStrings</a></div><div class="ttdeci">void makeStrings(std::string str, int n, int closed, int open)</div><div class="ttdoc">function that adds parenthesis to the string.</div><div class="ttdef"><b>Definition</b> <a href="#l00045">generate_parentheses.cpp:45</a></div></div>
+<div class="ttc" id="aclassbacktracking_1_1generate__parentheses_html_af39c03d80ce0ba9fbf659b420980d160"><div class="ttname"><a href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160">backtracking::generate_parentheses::generate</a></div><div class="ttdeci">std::vector&lt; std::string &gt; generate(int n)</div><div class="ttdoc">wrapper interface</div><div class="ttdef"><b>Definition</b> <a href="#l00070">generate_parentheses.cpp:70</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> <a href="#l00082">generate_parentheses.cpp:82</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacebacktracking_html"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html">backtracking</a></div><div class="ttdoc">for vector container</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a class="el" href="../../dd/d1e/generate__parentheses_8cpp.html">generate_parentheses.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dd/d1f/classdsu.html b/dd/d1f/classdsu.html
index 40c3c57b1..c7abbdb2d 100644
--- a/dd/d1f/classdsu.html
+++ b/dd/d1f/classdsu.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dsu Class Reference</title>
+<title>TheAlgorithms/C++: dsu Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -114,11 +131,6 @@ $(function(){initNavTree('dd/d1f/classdsu.html','../../'); initResizable(true);
 
 <p>Disjoint sets union data structure, class based representation.  
  <a href="#details">More...</a></p>
-<div class="dynheader">
-Collaboration diagram for dsu:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d10/classdsu__coll__graph.svg" width="164" height="274"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
@@ -134,7 +146,7 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:a64d25c5986742f7c234ed449b2ff7303" id="r_a64d25c5986742f7c234ed449b2ff7303"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a64d25c5986742f7c234ed449b2ff7303">isSame</a> (uint64_t i, uint64_t j)</td></tr>
 <tr class="memdesc:a64d25c5986742f7c234ed449b2ff7303"><td class="mdescLeft">&#160;</td><td class="mdescRight">A utility function which check whether i and j belongs to same set or not.  <br /></td></tr>
 <tr class="separator:a64d25c5986742f7c234ed449b2ff7303"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0ce2672c570f4235eafddb0c9a58115a" id="r_a0ce2672c570f4235eafddb0c9a58115a"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0ce2672c570f4235eafddb0c9a58115a">get</a> (uint64_t i)</td></tr>
+<tr class="memitem:a0ce2672c570f4235eafddb0c9a58115a" id="r_a0ce2672c570f4235eafddb0c9a58115a"><td class="memItemLeft" align="right" valign="top">vector&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0ce2672c570f4235eafddb0c9a58115a">get</a> (uint64_t i)</td></tr>
 <tr class="memdesc:a0ce2672c570f4235eafddb0c9a58115a"><td class="mdescLeft">&#160;</td><td class="mdescRight">prints the minimum, maximum and size of the set to which i belongs to  <br /></td></tr>
 <tr class="separator:a0ce2672c570f4235eafddb0c9a58115a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a1c24228b0f2f49220133fb8c3566a55c" id="r_a1c24228b0f2f49220133fb8c3566a55c"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1c24228b0f2f49220133fb8c3566a55c">size</a> (uint64_t i)</td></tr>
@@ -158,31 +170,26 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:a64d25c5986742f7c234ed449b2ff7303" id="r_a64d25c5986742f7c234ed449b2ff7303"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a64d25c5986742f7c234ed449b2ff7303">isSame</a> (uint64_t i, uint64_t j)</td></tr>
 <tr class="memdesc:a64d25c5986742f7c234ed449b2ff7303"><td class="mdescLeft">&#160;</td><td class="mdescRight">A utility function which check whether i and j belongs to same set or not.  <br /></td></tr>
 <tr class="separator:a64d25c5986742f7c234ed449b2ff7303"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ab8ee27083a3c2e2df80755165a2ec280" id="r_ab8ee27083a3c2e2df80755165a2ec280"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab8ee27083a3c2e2df80755165a2ec280">getParents</a> (uint64_t i)</td></tr>
+<tr class="memitem:ab8ee27083a3c2e2df80755165a2ec280" id="r_ab8ee27083a3c2e2df80755165a2ec280"><td class="memItemLeft" align="right" valign="top">vector&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab8ee27083a3c2e2df80755165a2ec280">getParents</a> (uint64_t i)</td></tr>
 <tr class="memdesc:ab8ee27083a3c2e2df80755165a2ec280"><td class="mdescLeft">&#160;</td><td class="mdescRight">Method to print all the parents of i, or the path from i to representative.  <br /></td></tr>
 <tr class="separator:ab8ee27083a3c2e2df80755165a2ec280"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a1ef0b0462a0dda63514f641cbb7dd8cb" id="r_a1ef0b0462a0dda63514f641cbb7dd8cb"><td class="memItemLeft" align="right" valign="top"><a id="a1ef0b0462a0dda63514f641cbb7dd8cb" name="a1ef0b0462a0dda63514f641cbb7dd8cb"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>p</b></td></tr>
-<tr class="memdesc:a1ef0b0462a0dda63514f641cbb7dd8cb"><td class="mdescLeft">&#160;</td><td class="mdescRight">keeps track of the parent of ith element <br /></td></tr>
+<tr class="memitem:a1ef0b0462a0dda63514f641cbb7dd8cb" id="r_a1ef0b0462a0dda63514f641cbb7dd8cb"><td class="memItemLeft" align="right" valign="top">vector&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a></td></tr>
+<tr class="memdesc:a1ef0b0462a0dda63514f641cbb7dd8cb"><td class="mdescLeft">&#160;</td><td class="mdescRight">keeps track of the parent of ith element  <br /></td></tr>
 <tr class="separator:a1ef0b0462a0dda63514f641cbb7dd8cb"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a4bf54d33fba178998dbbe4c57f2e9429" id="r_a4bf54d33fba178998dbbe4c57f2e9429"><td class="memItemLeft" align="right" valign="top"><a id="a4bf54d33fba178998dbbe4c57f2e9429" name="a4bf54d33fba178998dbbe4c57f2e9429"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>depth</b></td></tr>
-<tr class="memdesc:a4bf54d33fba178998dbbe4c57f2e9429"><td class="mdescLeft">&#160;</td><td class="mdescRight">tracks the <a class="el" href="#a4bf54d33fba178998dbbe4c57f2e9429" title="tracks the depth(rank) of i in the tree">depth(rank)</a> of i in the tree <br /></td></tr>
+<tr class="memitem:a4bf54d33fba178998dbbe4c57f2e9429" id="r_a4bf54d33fba178998dbbe4c57f2e9429"><td class="memItemLeft" align="right" valign="top">vector&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a></td></tr>
+<tr class="memdesc:a4bf54d33fba178998dbbe4c57f2e9429"><td class="mdescLeft">&#160;</td><td class="mdescRight">tracks the <a class="el" href="#a4bf54d33fba178998dbbe4c57f2e9429" title="tracks the depth(rank) of i in the tree">depth(rank)</a> of i in the tree  <br /></td></tr>
 <tr class="separator:a4bf54d33fba178998dbbe4c57f2e9429"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ac0dc3e17e49fe19b159b4ea4096d7b55" id="r_ac0dc3e17e49fe19b159b4ea4096d7b55"><td class="memItemLeft" align="right" valign="top"><a id="ac0dc3e17e49fe19b159b4ea4096d7b55" name="ac0dc3e17e49fe19b159b4ea4096d7b55"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>setSize</b></td></tr>
-<tr class="memdesc:ac0dc3e17e49fe19b159b4ea4096d7b55"><td class="mdescLeft">&#160;</td><td class="mdescRight">size of each chunk(set) <br /></td></tr>
+<tr class="memitem:ac0dc3e17e49fe19b159b4ea4096d7b55" id="r_ac0dc3e17e49fe19b159b4ea4096d7b55"><td class="memItemLeft" align="right" valign="top">vector&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a></td></tr>
+<tr class="memdesc:ac0dc3e17e49fe19b159b4ea4096d7b55"><td class="mdescLeft">&#160;</td><td class="mdescRight">size of each chunk(set)  <br /></td></tr>
 <tr class="separator:ac0dc3e17e49fe19b159b4ea4096d7b55"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a4ade6f16c418fc98b54452f7b0252a53" id="r_a4ade6f16c418fc98b54452f7b0252a53"><td class="memItemLeft" align="right" valign="top"><a id="a4ade6f16c418fc98b54452f7b0252a53" name="a4ade6f16c418fc98b54452f7b0252a53"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>maxElement</b></td></tr>
-<tr class="memdesc:a4ade6f16c418fc98b54452f7b0252a53"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum of each set to which i belongs to <br /></td></tr>
+<tr class="memitem:a4ade6f16c418fc98b54452f7b0252a53" id="r_a4ade6f16c418fc98b54452f7b0252a53"><td class="memItemLeft" align="right" valign="top">vector&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a></td></tr>
+<tr class="memdesc:a4ade6f16c418fc98b54452f7b0252a53"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum of each set to which i belongs to  <br /></td></tr>
 <tr class="separator:a4ade6f16c418fc98b54452f7b0252a53"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a1d77aad7fc39fe7140d834cd347e5c63" id="r_a1d77aad7fc39fe7140d834cd347e5c63"><td class="memItemLeft" align="right" valign="top"><a id="a1d77aad7fc39fe7140d834cd347e5c63" name="a1d77aad7fc39fe7140d834cd347e5c63"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>minElement</b></td></tr>
-<tr class="memdesc:a1d77aad7fc39fe7140d834cd347e5c63"><td class="mdescLeft">&#160;</td><td class="mdescRight">minimum of each set to which i belongs to <br /></td></tr>
+<tr class="memitem:a1d77aad7fc39fe7140d834cd347e5c63" id="r_a1d77aad7fc39fe7140d834cd347e5c63"><td class="memItemLeft" align="right" valign="top">vector&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a></td></tr>
+<tr class="memdesc:a1d77aad7fc39fe7140d834cd347e5c63"><td class="mdescLeft">&#160;</td><td class="mdescRight">minimum of each set to which i belongs to  <br /></td></tr>
 <tr class="separator:a1d77aad7fc39fe7140d834cd347e5c63"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -193,6 +200,8 @@ Private Attributes</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a126e3002a464e53cd54b07ba56482a72" name="a126e3002a464e53cd54b07ba56482a72"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a126e3002a464e53cd54b07ba56482a72">&#9670;&#160;</a></span>dsu() <span class="overload">[1/2]</span></h2>
@@ -227,14 +236,14 @@ Private Attributes</h2></td></tr>
 <p>initially, all of them are their own parents</p>
 <p>initially all have depth are equals to zero</p>
 <p>initially set size will be equals to one</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00046">46</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   46</span>                             {</div>
-<div class="line"><span class="lineno">   47</span>        <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>.assign(n, 0);<span class="comment"></span></div>
-<div class="line"><span class="lineno">   48</span><span class="comment">        /// initially, all of them are their own parents</span></div>
-<div class="line"><span class="lineno">   49</span><span class="comment"></span>        <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
+<div class="line"><span class="lineno">   47</span>        <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>.assign(n, 0);</div>
+<div class="line"><span class="lineno">   49</span>        <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
 <div class="line"><span class="lineno">   50</span>            <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] = i;</div>
-<div class="line"><span class="lineno">   51</span>        }<span class="comment"></span></div>
-<div class="line"><span class="lineno">   52</span><span class="comment">        /// initially all have depth are equals to zero</span></div>
-<div class="line"><span class="lineno">   53</span><span class="comment"></span>        <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>.assign(n, 0);</div>
+<div class="line"><span class="lineno">   51</span>        }</div>
+<div class="line"><span class="lineno">   53</span>        <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>.assign(n, 0);</div>
 <div class="line"><span class="lineno">   54</span>        <a class="code hl_variable" href="#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>.assign(n, 0);</div>
 <div class="line"><span class="lineno">   55</span>        <a class="code hl_variable" href="#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>.assign(n, 0);</div>
 <div class="line"><span class="lineno">   56</span>        <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
@@ -242,17 +251,16 @@ Private Attributes</h2></td></tr>
 <div class="line"><span class="lineno">   58</span>            <a class="code hl_variable" href="#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[i] = i;</div>
 <div class="line"><span class="lineno">   59</span>            <a class="code hl_variable" href="#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[i] = i;</div>
 <div class="line"><span class="lineno">   60</span>        }</div>
-<div class="line"><span class="lineno">   61</span>        <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>.assign(n, 0);<span class="comment"></span></div>
-<div class="line"><span class="lineno">   62</span><span class="comment">        /// initially set size will be equals to one</span></div>
-<div class="line"><span class="lineno">   63</span><span class="comment"></span>        <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
+<div class="line"><span class="lineno">   61</span>        <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>.assign(n, 0);</div>
+<div class="line"><span class="lineno">   63</span>        <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
 <div class="line"><span class="lineno">   64</span>            <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[i] = 1;</div>
 <div class="line"><span class="lineno">   65</span>        }</div>
 <div class="line"><span class="lineno">   66</span>    }</div>
-<div class="ttc" id="aclassdsu_html_a1d77aad7fc39fe7140d834cd347e5c63"><div class="ttname"><a href="#a1d77aad7fc39fe7140d834cd347e5c63">dsu::minElement</a></div><div class="ttdeci">vector&lt; uint64_t &gt; minElement</div><div class="ttdoc">minimum of each set to which i belongs to</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:40</div></div>
-<div class="ttc" id="aclassdsu_html_a1ef0b0462a0dda63514f641cbb7dd8cb"><div class="ttname"><a href="#a1ef0b0462a0dda63514f641cbb7dd8cb">dsu::p</a></div><div class="ttdeci">vector&lt; uint64_t &gt; p</div><div class="ttdoc">keeps track of the parent of ith element</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:36</div></div>
-<div class="ttc" id="aclassdsu_html_a4ade6f16c418fc98b54452f7b0252a53"><div class="ttname"><a href="#a4ade6f16c418fc98b54452f7b0252a53">dsu::maxElement</a></div><div class="ttdeci">vector&lt; uint64_t &gt; maxElement</div><div class="ttdoc">maximum of each set to which i belongs to</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:39</div></div>
-<div class="ttc" id="aclassdsu_html_a4bf54d33fba178998dbbe4c57f2e9429"><div class="ttname"><a href="#a4bf54d33fba178998dbbe4c57f2e9429">dsu::depth</a></div><div class="ttdeci">vector&lt; uint64_t &gt; depth</div><div class="ttdoc">tracks the depth(rank) of i in the tree</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:37</div></div>
-<div class="ttc" id="aclassdsu_html_ac0dc3e17e49fe19b159b4ea4096d7b55"><div class="ttname"><a href="#ac0dc3e17e49fe19b159b4ea4096d7b55">dsu::setSize</a></div><div class="ttdeci">vector&lt; uint64_t &gt; setSize</div><div class="ttdoc">size of each chunk(set)</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:38</div></div>
+<div class="ttc" id="aclassdsu_html_a1d77aad7fc39fe7140d834cd347e5c63"><div class="ttname"><a href="#a1d77aad7fc39fe7140d834cd347e5c63">dsu::minElement</a></div><div class="ttdeci">vector&lt; uint64_t &gt; minElement</div><div class="ttdoc">minimum of each set to which i belongs to</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00040">dsu_path_compression.cpp:40</a></div></div>
+<div class="ttc" id="aclassdsu_html_a1ef0b0462a0dda63514f641cbb7dd8cb"><div class="ttname"><a href="#a1ef0b0462a0dda63514f641cbb7dd8cb">dsu::p</a></div><div class="ttdeci">vector&lt; uint64_t &gt; p</div><div class="ttdoc">keeps track of the parent of ith element</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00036">dsu_path_compression.cpp:36</a></div></div>
+<div class="ttc" id="aclassdsu_html_a4ade6f16c418fc98b54452f7b0252a53"><div class="ttname"><a href="#a4ade6f16c418fc98b54452f7b0252a53">dsu::maxElement</a></div><div class="ttdeci">vector&lt; uint64_t &gt; maxElement</div><div class="ttdoc">maximum of each set to which i belongs to</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00039">dsu_path_compression.cpp:39</a></div></div>
+<div class="ttc" id="aclassdsu_html_a4bf54d33fba178998dbbe4c57f2e9429"><div class="ttname"><a href="#a4bf54d33fba178998dbbe4c57f2e9429">dsu::depth</a></div><div class="ttdeci">vector&lt; uint64_t &gt; depth</div><div class="ttdoc">tracks the depth(rank) of i in the tree</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00037">dsu_path_compression.cpp:37</a></div></div>
+<div class="ttc" id="aclassdsu_html_ac0dc3e17e49fe19b159b4ea4096d7b55"><div class="ttname"><a href="#ac0dc3e17e49fe19b159b4ea4096d7b55">dsu::setSize</a></div><div class="ttdeci">vector&lt; uint64_t &gt; setSize</div><div class="ttdoc">size of each chunk(set)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00038">dsu_path_compression.cpp:38</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -287,10 +295,11 @@ Private Attributes</h2></td></tr>
   </dd>
 </dl>
 <p>initially all of them are their own parents</p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html#l00045">45</a> of file <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html">dsu_union_rank.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   45</span>                             {</div>
-<div class="line"><span class="lineno">   46</span>        <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>.assign(n, 0);<span class="comment"></span></div>
-<div class="line"><span class="lineno">   47</span><span class="comment">        /// initially all of them are their own parents</span></div>
-<div class="line"><span class="lineno">   48</span><span class="comment"></span>        <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>.assign(n, 0);</div>
+<div class="line"><span class="lineno">   46</span>        <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>.assign(n, 0);</div>
+<div class="line"><span class="lineno">   48</span>        <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>.assign(n, 0);</div>
 <div class="line"><span class="lineno">   49</span>        <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>.assign(n, 0);</div>
 <div class="line"><span class="lineno">   50</span>        <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
 <div class="line"><span class="lineno">   51</span>            <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] = i;</div>
@@ -334,20 +343,16 @@ Private Attributes</h2></td></tr>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>representative of the set to which i belongs to. </dd></dl>
 <p>using path compression</p>
-<div class="fragment"><div class="line"><span class="lineno">   74</span>                                 {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   75</span><span class="comment">        /// using path compression</span></div>
-<div class="line"><span class="lineno">   76</span><span class="comment"></span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] == i) {</div>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00074">74</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   74</span>                                 {</div>
+<div class="line"><span class="lineno">   76</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] == i) {</div>
 <div class="line"><span class="lineno">   77</span>            <span class="keywordflow">return</span> i;</div>
 <div class="line"><span class="lineno">   78</span>        }</div>
 <div class="line"><span class="lineno">   79</span>        <span class="keywordflow">return</span> (<a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] = <a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(<a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i]));</div>
 <div class="line"><span class="lineno">   80</span>    }</div>
-<div class="ttc" id="aclassdsu_html_a16851f78fe390fc1430905c83d6a2f1c"><div class="ttname"><a href="#a16851f78fe390fc1430905c83d6a2f1c">dsu::findSet</a></div><div class="ttdeci">uint64_t findSet(uint64_t i)</div><div class="ttdoc">Method to find the representative of the set to which i belongs to, T(n) = O(1)</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:74</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph.svg" width="103" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdsu_html_a16851f78fe390fc1430905c83d6a2f1c"><div class="ttname"><a href="#a16851f78fe390fc1430905c83d6a2f1c">dsu::findSet</a></div><div class="ttdeci">uint64_t findSet(uint64_t i)</div><div class="ttdoc">Method to find the representative of the set to which i belongs to, T(n) = O(1)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00074">dsu_path_compression.cpp:74</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a16851f78fe390fc1430905c83d6a2f1c" name="a16851f78fe390fc1430905c83d6a2f1c"></a>
@@ -382,9 +387,10 @@ Here is the call graph for this function:</div>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>representative of the set to which i belongs to </dd></dl>
 <p>using union-rank</p>
-<div class="fragment"><div class="line"><span class="lineno">   62</span>                                 {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   63</span><span class="comment">        /// using union-rank</span></div>
-<div class="line"><span class="lineno">   64</span><span class="comment"></span>        <span class="keywordflow">while</span> (i != <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i]) {</div>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html">dsu_union_rank.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   62</span>                                 {</div>
+<div class="line"><span class="lineno">   64</span>        <span class="keywordflow">while</span> (i != <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i]) {</div>
 <div class="line"><span class="lineno">   65</span>            i = <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i];</div>
 <div class="line"><span class="lineno">   66</span>        }</div>
 <div class="line"><span class="lineno">   67</span>        <span class="keywordflow">return</span> i;</div>
@@ -402,7 +408,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; uint64_t &gt; dsu::get </td>
+          <td class="memname">vector&lt; uint64_t &gt; dsu::get </td>
           <td>(</td>
           <td class="paramtype">uint64_t</td>          <td class="paramname"><span class="paramname"><em>i</em></span></td><td>)</td>
           <td></td>
@@ -423,23 +429,19 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00136">136</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  136</span>                                     {</div>
-<div class="line"><span class="lineno">  137</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;uint64_t&gt;</a> ans;</div>
+<div class="line"><span class="lineno">  137</span>        vector&lt;uint64_t&gt; ans;</div>
 <div class="line"><span class="lineno">  138</span>        ans.push_back(<a class="code hl_function" href="#ac713a5b496d0405c82e2808a85e58415">get_min</a>(i));</div>
 <div class="line"><span class="lineno">  139</span>        ans.push_back(<a class="code hl_function" href="#a696141b8b092466767f4bfe1c5e46cde">get_max</a>(i));</div>
 <div class="line"><span class="lineno">  140</span>        ans.push_back(<a class="code hl_function" href="#a1c24228b0f2f49220133fb8c3566a55c">size</a>(i));</div>
 <div class="line"><span class="lineno">  141</span>        <span class="keywordflow">return</span> ans;</div>
 <div class="line"><span class="lineno">  142</span>    }</div>
-<div class="ttc" id="aclassdsu_html_a1c24228b0f2f49220133fb8c3566a55c"><div class="ttname"><a href="#a1c24228b0f2f49220133fb8c3566a55c">dsu::size</a></div><div class="ttdeci">uint64_t size(uint64_t i)</div><div class="ttdoc">A utility function that returns the size of the set to which i belongs to.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:149</div></div>
-<div class="ttc" id="aclassdsu_html_a696141b8b092466767f4bfe1c5e46cde"><div class="ttname"><a href="#a696141b8b092466767f4bfe1c5e46cde">dsu::get_max</a></div><div class="ttdeci">uint64_t get_max(uint64_t i)</div><div class="ttdoc">A utility function that returns the max element of the set to which i belongs to.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:156</div></div>
-<div class="ttc" id="aclassdsu_html_ac713a5b496d0405c82e2808a85e58415"><div class="ttname"><a href="#ac713a5b496d0405c82e2808a85e58415">dsu::get_min</a></div><div class="ttdeci">uint64_t get_min(uint64_t i)</div><div class="ttdoc">A utility function that returns the min element of the set to which i belongs to.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:163</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph.svg" width="367" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdsu_html_a1c24228b0f2f49220133fb8c3566a55c"><div class="ttname"><a href="#a1c24228b0f2f49220133fb8c3566a55c">dsu::size</a></div><div class="ttdeci">uint64_t size(uint64_t i)</div><div class="ttdoc">A utility function that returns the size of the set to which i belongs to.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00149">dsu_path_compression.cpp:149</a></div></div>
+<div class="ttc" id="aclassdsu_html_a696141b8b092466767f4bfe1c5e46cde"><div class="ttname"><a href="#a696141b8b092466767f4bfe1c5e46cde">dsu::get_max</a></div><div class="ttdeci">uint64_t get_max(uint64_t i)</div><div class="ttdoc">A utility function that returns the max element of the set to which i belongs to.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00156">dsu_path_compression.cpp:156</a></div></div>
+<div class="ttc" id="aclassdsu_html_ac713a5b496d0405c82e2808a85e58415"><div class="ttname"><a href="#ac713a5b496d0405c82e2808a85e58415">dsu::get_min</a></div><div class="ttdeci">uint64_t get_min(uint64_t i)</div><div class="ttdoc">A utility function that returns the min element of the set to which i belongs to.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00163">dsu_path_compression.cpp:163</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a696141b8b092466767f4bfe1c5e46cde" name="a696141b8b092466767f4bfe1c5e46cde"></a>
@@ -473,13 +475,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>maximum of the set to which i belongs to </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  156</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[<a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i)]; }</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="../../dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph.svg" width="251" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00156">156</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  156</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[<a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i)]; }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac713a5b496d0405c82e2808a85e58415" name="ac713a5b496d0405c82e2808a85e58415"></a>
@@ -513,13 +512,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>minimum of the set to which i belongs to </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  163</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[<a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i)]; }</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="../../dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph.svg" width="247" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00163">163</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  163</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[<a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i)]; }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ab8ee27083a3c2e2df80755165a2ec280" name="ab8ee27083a3c2e2df80755165a2ec280"></a>
@@ -532,7 +528,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; uint64_t &gt; dsu::getParents </td>
+          <td class="memname">vector&lt; uint64_t &gt; dsu::getParents </td>
           <td>(</td>
           <td class="paramtype">uint64_t</td>          <td class="paramname"><span class="paramname"><em>i</em></span></td><td>)</td>
           <td></td>
@@ -553,8 +549,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html#l00120">120</a> of file <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html">dsu_union_rank.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  120</span>                                            {</div>
-<div class="line"><span class="lineno">  121</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;uint64_t&gt;</a> ans;</div>
+<div class="line"><span class="lineno">  121</span>        vector&lt;uint64_t&gt; ans;</div>
 <div class="line"><span class="lineno">  122</span>        <span class="keywordflow">while</span> (<a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] != i) {</div>
 <div class="line"><span class="lineno">  123</span>            ans.push_back(i);</div>
 <div class="line"><span class="lineno">  124</span>            i = <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i];</div>
@@ -603,18 +601,15 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if element <code>i</code> and <code>j</code> ARE in the same set </dd>
 <dd>
 <code>false</code> if element <code>i</code> and <code>j</code> are NOT in same set </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00124">124</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  124</span>                                        {</div>
 <div class="line"><span class="lineno">  125</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i) == <a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(j)) {</div>
 <div class="line"><span class="lineno">  126</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  127</span>        }</div>
 <div class="line"><span class="lineno">  128</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  129</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph.svg" width="244" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a64d25c5986742f7c234ed449b2ff7303" name="a64d25c5986742f7c234ed449b2ff7303"></a>
@@ -655,18 +650,15 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if element i and j are in same set </dd>
 <dd>
 <code>false</code> if element i and j are not in same set </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html#l00108">108</a> of file <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html">dsu_union_rank.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  108</span>                                        {</div>
 <div class="line"><span class="lineno">  109</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i) == <a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(j)) {</div>
 <div class="line"><span class="lineno">  110</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  111</span>        }</div>
 <div class="line"><span class="lineno">  112</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  113</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph.svg" width="244" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1c24228b0f2f49220133fb8c3566a55c" name="a1c24228b0f2f49220133fb8c3566a55c"></a>
@@ -700,13 +692,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>size of the set to which i belongs to </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  149</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[<a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i)]; }</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="../../dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph.svg" width="224" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00149">149</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  149</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[<a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i)]; }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6ac30c07abca2aaa3b291504c25c3559" name="a6ac30c07abca2aaa3b291504c25c3559"></a>
@@ -751,44 +740,31 @@ Here is the call graph for this function:</div>
 <p>if same depth, then increase one's depth</p>
 <p>total size of the resultant set</p>
 <p>changing the maximum elements</p>
-<div class="fragment"><div class="line"><span class="lineno">   88</span>                                          {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   89</span><span class="comment">        /// check if both belongs to the same set or not</span></div>
-<div class="line"><span class="lineno">   90</span><span class="comment"></span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="#a64d25c5986742f7c234ed449b2ff7303">isSame</a>(i, j)) {</div>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00088">88</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   88</span>                                          {</div>
+<div class="line"><span class="lineno">   90</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="#a64d25c5986742f7c234ed449b2ff7303">isSame</a>(i, j)) {</div>
 <div class="line"><span class="lineno">   91</span>            <span class="keywordflow">return</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">// we find the representative of the i and j</span></div>
 <div class="line"><span class="lineno">   95</span>        uint64_t x = <a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i);</div>
 <div class="line"><span class="lineno">   96</span>        uint64_t y = <a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(j);</div>
-<div class="line"><span class="lineno">   97</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   98</span><span class="comment">        /// always keeping the min as x</span></div>
-<div class="line"><span class="lineno">   99</span><span class="comment">        /// shallow tree</span></div>
-<div class="line"><span class="lineno">  100</span><span class="comment"></span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] &gt; <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
-<div class="line"><span class="lineno">  101</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(x, y);</div>
-<div class="line"><span class="lineno">  102</span>        }<span class="comment"></span></div>
-<div class="line"><span class="lineno">  103</span><span class="comment">        /// making the shallower root&#39;s parent the deeper root</span></div>
-<div class="line"><span class="lineno">  104</span><span class="comment"></span>        <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[x] = y;</div>
-<div class="line"><span class="lineno">  105</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  106</span><span class="comment">        /// if same depth, then increase one&#39;s depth</span></div>
-<div class="line"><span class="lineno">  107</span><span class="comment"></span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] == <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
+<div class="line"><span class="lineno">   97</span> </div>
+<div class="line"><span class="lineno">  100</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] &gt; <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
+<div class="line"><span class="lineno">  101</span>            std::swap(x, y);</div>
+<div class="line"><span class="lineno">  102</span>        }</div>
+<div class="line"><span class="lineno">  104</span>        <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[x] = y;</div>
+<div class="line"><span class="lineno">  105</span> </div>
+<div class="line"><span class="lineno">  107</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] == <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
 <div class="line"><span class="lineno">  108</span>            <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]++;</div>
-<div class="line"><span class="lineno">  109</span>        }<span class="comment"></span></div>
-<div class="line"><span class="lineno">  110</span><span class="comment">        /// total size of the resultant set</span></div>
-<div class="line"><span class="lineno">  111</span><span class="comment"></span>        <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[y] += <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[x];<span class="comment"></span></div>
-<div class="line"><span class="lineno">  112</span><span class="comment">        /// changing the maximum elements</span></div>
-<div class="line"><span class="lineno">  113</span><span class="comment"></span>        <a class="code hl_variable" href="#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[y] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(<a class="code hl_variable" href="#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[x], <a class="code hl_variable" href="#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[y]);</div>
-<div class="line"><span class="lineno">  114</span>        <a class="code hl_variable" href="#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[y] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(<a class="code hl_variable" href="#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[x], <a class="code hl_variable" href="#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[y]);</div>
+<div class="line"><span class="lineno">  109</span>        }</div>
+<div class="line"><span class="lineno">  111</span>        <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[y] += <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[x];</div>
+<div class="line"><span class="lineno">  113</span>        <a class="code hl_variable" href="#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[y] = std::max(<a class="code hl_variable" href="#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[x], <a class="code hl_variable" href="#a4ade6f16c418fc98b54452f7b0252a53">maxElement</a>[y]);</div>
+<div class="line"><span class="lineno">  114</span>        <a class="code hl_variable" href="#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[y] = std::min(<a class="code hl_variable" href="#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[x], <a class="code hl_variable" href="#a1d77aad7fc39fe7140d834cd347e5c63">minElement</a>[y]);</div>
 <div class="line"><span class="lineno">  115</span>    }</div>
-<div class="ttc" id="aclassdsu_html_a64d25c5986742f7c234ed449b2ff7303"><div class="ttname"><a href="#a64d25c5986742f7c234ed449b2ff7303">dsu::isSame</a></div><div class="ttdeci">bool isSame(uint64_t i, uint64_t j)</div><div class="ttdoc">A utility function which check whether i and j belongs to same set or not.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:124</div></div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="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="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-</div><!-- 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="../../dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph.svg" width="398" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdsu_html_a64d25c5986742f7c234ed449b2ff7303"><div class="ttname"><a href="#a64d25c5986742f7c234ed449b2ff7303">dsu::isSame</a></div><div class="ttdeci">bool isSame(uint64_t i, uint64_t j)</div><div class="ttdoc">A utility function which check whether i and j belongs to same set or not.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00124">dsu_path_compression.cpp:124</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a81897528bdb53fd5e796d75d7dbc430f" name="a81897528bdb53fd5e796d75d7dbc430f"></a>
@@ -833,41 +809,162 @@ Here is the call graph for this function:</div>
 <p>making the shallower tree, root parent of the deeper root</p>
 <p>if same depth, then increase one's depth</p>
 <p>total size of the resultant set</p>
-<div class="fragment"><div class="line"><span class="lineno">   76</span>                                          {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   77</span><span class="comment">        /// checks if both belongs to same set or not</span></div>
-<div class="line"><span class="lineno">   78</span><span class="comment"></span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="#a64d25c5986742f7c234ed449b2ff7303">isSame</a>(i, j)) {</div>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html#l00076">76</a> of file <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html">dsu_union_rank.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   76</span>                                          {</div>
+<div class="line"><span class="lineno">   78</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="#a64d25c5986742f7c234ed449b2ff7303">isSame</a>(i, j)) {</div>
 <div class="line"><span class="lineno">   79</span>            <span class="keywordflow">return</span>;</div>
-<div class="line"><span class="lineno">   80</span>        }<span class="comment"></span></div>
-<div class="line"><span class="lineno">   81</span><span class="comment">        /// we find representative of the i and j</span></div>
-<div class="line"><span class="lineno">   82</span><span class="comment"></span>        uint64_t x = <a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i);</div>
+<div class="line"><span class="lineno">   80</span>        }</div>
+<div class="line"><span class="lineno">   82</span>        uint64_t x = <a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i);</div>
 <div class="line"><span class="lineno">   83</span>        uint64_t y = <a class="code hl_function" href="#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(j);</div>
-<div class="line"><span class="lineno">   84</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   85</span><span class="comment">        /// always keeping the min as x</span></div>
-<div class="line"><span class="lineno">   86</span><span class="comment">        /// in order to create a shallow tree</span></div>
-<div class="line"><span class="lineno">   87</span><span class="comment"></span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] &gt; <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
-<div class="line"><span class="lineno">   88</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(x, y);</div>
-<div class="line"><span class="lineno">   89</span>        }<span class="comment"></span></div>
-<div class="line"><span class="lineno">   90</span><span class="comment">        /// making the shallower tree, root parent of the deeper root</span></div>
-<div class="line"><span class="lineno">   91</span><span class="comment"></span>        <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[x] = y;</div>
-<div class="line"><span class="lineno">   92</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   93</span><span class="comment">        /// if same depth, then increase one&#39;s depth</span></div>
-<div class="line"><span class="lineno">   94</span><span class="comment"></span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] == <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
+<div class="line"><span class="lineno">   84</span> </div>
+<div class="line"><span class="lineno">   87</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] &gt; <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
+<div class="line"><span class="lineno">   88</span>            std::swap(x, y);</div>
+<div class="line"><span class="lineno">   89</span>        }</div>
+<div class="line"><span class="lineno">   91</span>        <a class="code hl_variable" href="#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[x] = y;</div>
+<div class="line"><span class="lineno">   92</span> </div>
+<div class="line"><span class="lineno">   94</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] == <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
 <div class="line"><span class="lineno">   95</span>            <a class="code hl_variable" href="#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]++;</div>
-<div class="line"><span class="lineno">   96</span>        }<span class="comment"></span></div>
-<div class="line"><span class="lineno">   97</span><span class="comment">        /// total size of the resultant set</span></div>
-<div class="line"><span class="lineno">   98</span><span class="comment"></span>        <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[y] += <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[x];</div>
+<div class="line"><span class="lineno">   96</span>        }</div>
+<div class="line"><span class="lineno">   98</span>        <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[y] += <a class="code hl_variable" href="#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[x];</div>
 <div class="line"><span class="lineno">   99</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph.svg" width="394" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a4bf54d33fba178998dbbe4c57f2e9429" name="a4bf54d33fba178998dbbe4c57f2e9429"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a4bf54d33fba178998dbbe4c57f2e9429">&#9670;&#160;</a></span>depth</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">vector&lt; uint64_t &gt; dsu::depth</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>tracks the <a class="el" href="#a4bf54d33fba178998dbbe4c57f2e9429" title="tracks the depth(rank) of i in the tree">depth(rank)</a> of i in the tree </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a4ade6f16c418fc98b54452f7b0252a53" name="a4ade6f16c418fc98b54452f7b0252a53"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a4ade6f16c418fc98b54452f7b0252a53">&#9670;&#160;</a></span>maxElement</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">vector&lt;uint64_t&gt; dsu::maxElement</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>maximum of each set to which i belongs to </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a1d77aad7fc39fe7140d834cd347e5c63" name="a1d77aad7fc39fe7140d834cd347e5c63"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a1d77aad7fc39fe7140d834cd347e5c63">&#9670;&#160;</a></span>minElement</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">vector&lt;uint64_t&gt; dsu::minElement</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>minimum of each set to which i belongs to </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a1ef0b0462a0dda63514f641cbb7dd8cb" name="a1ef0b0462a0dda63514f641cbb7dd8cb"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a1ef0b0462a0dda63514f641cbb7dd8cb">&#9670;&#160;</a></span>p</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">vector&lt; uint64_t &gt; dsu::p</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>keeps track of the parent of ith element </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ac0dc3e17e49fe19b159b4ea4096d7b55" name="ac0dc3e17e49fe19b159b4ea4096d7b55"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ac0dc3e17e49fe19b159b4ea4096d7b55">&#9670;&#160;</a></span>setSize</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">vector&lt; uint64_t &gt; dsu::setSize</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>size of each chunk(set) </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following files:<ul>
-<li>data_structures/<a class="el" href="../../d3/dae/dsu__path__compression_8cpp.html">dsu_path_compression.cpp</a></li>
-<li>data_structures/<a class="el" href="../../df/d28/dsu__union__rank_8cpp.html">dsu_union_rank.cpp</a></li>
+<li>data_structures/<a class="el" href="../../d3/dae/dsu__path__compression_8cpp_source.html">dsu_path_compression.cpp</a></li>
+<li>data_structures/<a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html">dsu_union_rank.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph.map b/dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph.map
deleted file mode 100644
index 6fd022642..000000000
--- a/dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph.map
+++ /dev/null
@@ -1,14 +0,0 @@
-<map id="dsu::get" name="dsu::get">
-<area shape="rect" id="Node000001" title="prints the minimum, maximum and size of the set to which i belongs to" alt="" coords="5,55,74,80"/>
-<area shape="rect" id="Node000002" href="$dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" title="A utility function that returns the max element of the set to which i belongs to." alt="" coords="122,5,222,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="73,52,120,34,122,39,75,57"/>
-<area shape="rect" id="Node000004" href="$dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" title="A utility function that returns the min element of the set to which i belongs to." alt="" coords="124,55,220,80"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="74,65,108,65,108,70,74,70"/>
-<area shape="rect" id="Node000005" href="$dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" title="A utility function that returns the size of the set to which i belongs to." alt="" coords="135,104,209,130"/>
-<area shape="poly" id="edge6_Node000001_Node000005" title=" " alt="" coords="75,78,122,96,120,101,73,83"/>
-<area shape="rect" id="Node000003" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="270,55,361,80"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="213,29,263,47,261,52,211,34"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="291,55,286,46,289,37,299,30,316,28,333,31,343,37,340,42,331,36,316,33,301,35,293,40,291,46,296,53"/>
-<area shape="poly" id="edge5_Node000004_Node000003" title=" " alt="" coords="221,65,255,65,255,70,221,70"/>
-<area shape="poly" id="edge7_Node000005_Node000003" title=" " alt="" coords="209,102,261,83,263,88,210,107"/>
-</map>
diff --git a/dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph.md5 b/dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph.md5
deleted file mode 100644
index bd44c8f59..000000000
--- a/dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ecb112358bf89c80c3535513e0b1e5b8
\ No newline at end of file
diff --git a/dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph.svg b/dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph.svg
deleted file mode 100644
index 83ca73ef7..000000000
--- a/dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph.svg
+++ /dev/null
@@ -1,146 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dsu::get Pages: 1 -->
-<svg width="275pt" height="101pt"
- viewBox="0.00 0.00 275.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>dsu::get</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
-<polygon fill="#999999" stroke="#666666" points="51.25,-56.25 0,-56.25 0,-37 51.25,-37 51.25,-56.25"/>
-<text text-anchor="middle" x="25.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="162.5,-93.25 87.25,-93.25 87.25,-74 162.5,-74 162.5,-93.25"/>
-<text text-anchor="middle" x="124.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M51.67,-56.15C62.44,-60.25 75.25,-65.13 87.07,-69.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.55,-72.79 96.14,-73.07 88.04,-66.25 85.55,-72.79"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="161,-56.25 88.75,-56.25 88.75,-37 161,-37 161,-56.25"/>
-<text text-anchor="middle" x="124.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M51.67,-46.62C59.42,-46.62 68.22,-46.62 76.95,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.77,-50.13 86.77,-46.63 76.77,-43.13 76.77,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="152.75,-19.25 97,-19.25 97,0 152.75,0 152.75,-19.25"/>
-<text text-anchor="middle" x="124.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M51.67,-37.1C62.44,-33 75.25,-28.12 87.07,-23.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.04,-27 96.14,-20.18 85.55,-20.46 88.04,-27"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="267,-56.25 198.5,-56.25 198.5,-37 267,-37 267,-56.25"/>
-<text text-anchor="middle" x="232.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.81,-73.51C166.36,-69.48 179.85,-64.76 192.28,-60.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="193.14,-63.83 201.43,-57.22 190.83,-57.22 193.14,-63.83"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M215.86,-56.54C208.16,-65.15 213.79,-74.25 232.75,-74.25 243.12,-74.25 249.5,-71.53 251.9,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="255.36,-67.12 249.94,-58.02 248.5,-68.52 255.36,-67.12"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.42,-46.62C169.6,-46.62 178.4,-46.62 186.92,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="186.75,-50.13 196.75,-46.63 186.75,-43.13 186.75,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge7_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge7_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.14,-19.15C165.11,-23.34 179.38,-28.32 192.47,-32.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.07,-36.12 201.67,-36.11 193.38,-29.51 191.07,-36.12"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph_org.svg b/dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph_org.svg
deleted file mode 100644
index c3930aa44..000000000
--- a/dd/d1f/classdsu_a0ce2672c570f4235eafddb0c9a58115a_cgraph_org.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dsu::get Pages: 1 -->
-<svg width="275pt" height="101pt"
- viewBox="0.00 0.00 275.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>dsu::get</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="prints the minimum, maximum and size of the set to which i belongs to">
-<polygon fill="#999999" stroke="#666666" points="51.25,-56.25 0,-56.25 0,-37 51.25,-37 51.25,-56.25"/>
-<text text-anchor="middle" x="25.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde" target="_top" xlink:title="A utility function that returns the max element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="162.5,-93.25 87.25,-93.25 87.25,-74 162.5,-74 162.5,-93.25"/>
-<text text-anchor="middle" x="124.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M51.67,-56.15C62.44,-60.25 75.25,-65.13 87.07,-69.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.55,-72.79 96.14,-73.07 88.04,-66.25 85.55,-72.79"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415" target="_top" xlink:title="A utility function that returns the min element of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="161,-56.25 88.75,-56.25 88.75,-37 161,-37 161,-56.25"/>
-<text text-anchor="middle" x="124.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M51.67,-46.62C59.42,-46.62 68.22,-46.62 76.95,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.77,-50.13 86.77,-46.63 76.77,-43.13 76.77,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c" target="_top" xlink:title="A utility function that returns the size of the set to which i belongs to.">
-<polygon fill="white" stroke="#666666" points="152.75,-19.25 97,-19.25 97,0 152.75,0 152.75,-19.25"/>
-<text text-anchor="middle" x="124.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M51.67,-37.1C62.44,-33 75.25,-28.12 87.07,-23.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.04,-27 96.14,-20.18 85.55,-20.46 88.04,-27"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="267,-56.25 198.5,-56.25 198.5,-37 267,-37 267,-56.25"/>
-<text text-anchor="middle" x="232.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.81,-73.51C166.36,-69.48 179.85,-64.76 192.28,-60.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="193.14,-63.83 201.43,-57.22 190.83,-57.22 193.14,-63.83"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M215.86,-56.54C208.16,-65.15 213.79,-74.25 232.75,-74.25 243.12,-74.25 249.5,-71.53 251.9,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="255.36,-67.12 249.94,-58.02 248.5,-68.52 255.36,-67.12"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.42,-46.62C169.6,-46.62 178.4,-46.62 186.92,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="186.75,-50.13 196.75,-46.63 186.75,-43.13 186.75,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge7_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge7_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.14,-19.15C165.11,-23.34 179.38,-28.32 192.47,-32.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.07,-36.12 201.67,-36.11 193.38,-29.51 191.07,-36.12"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph.map b/dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph.map
deleted file mode 100644
index 1742a4546..000000000
--- a/dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="dsu::findSet" name="dsu::findSet">
-<area shape="rect" id="Node000001" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="5,29,97,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="34,30,31,21,33,12,40,5,51,3,63,6,69,12,65,16,60,10,51,8,42,10,38,14,37,20,39,28"/>
-</map>
diff --git a/dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph.md5 b/dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph.md5
deleted file mode 100644
index f31cb8b49..000000000
--- a/dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-844008cc5c3ff1a351b40792d8df08f2
\ No newline at end of file
diff --git a/dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph.svg b/dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph.svg
deleted file mode 100644
index 10ca0717f..000000000
--- a/dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dsu::findSet Pages: 1 -->
-<svg width="77pt" height="45pt"
- viewBox="0.00 0.00 76.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>dsu::findSet</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="#999999" stroke="#666666" points="68.5,-19.25 0,-19.25 0,0 68.5,0 68.5,-19.25"/>
-<text text-anchor="middle" x="34.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.53,-19.54C18.63,-28.15 22.21,-37.25 34.25,-37.25 40.83,-37.25 44.89,-34.53 46.41,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="49.92,-30.51 45.17,-21.04 42.98,-31.41 49.92,-30.51"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph_org.svg b/dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph_org.svg
deleted file mode 100644
index b55464c52..000000000
--- a/dd/d1f/classdsu_a16851f78fe390fc1430905c83d6a2f1c_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dsu::findSet Pages: 1 -->
-<svg width="77pt" height="45pt"
- viewBox="0.00 0.00 76.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>dsu::findSet</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="#999999" stroke="#666666" points="68.5,-19.25 0,-19.25 0,0 68.5,0 68.5,-19.25"/>
-<text text-anchor="middle" x="34.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.53,-19.54C18.63,-28.15 22.21,-37.25 34.25,-37.25 40.83,-37.25 44.89,-34.53 46.41,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="49.92,-30.51 45.17,-21.04 42.98,-31.41 49.92,-30.51"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph.map b/dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph.map
deleted file mode 100644
index d61f421a8..000000000
--- a/dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="dsu::size" name="dsu::size">
-<area shape="rect" id="Node000001" title="A utility function that returns the size of the set to which i belongs to." alt="" coords="5,29,80,55"/>
-<area shape="rect" id="Node000002" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="128,29,219,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="80,40,112,40,112,45,80,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="150,30,146,21,149,11,158,5,173,3,190,5,198,12,195,16,187,10,173,8,160,10,153,14,152,20,155,28"/>
-</map>
diff --git a/dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph.md5 b/dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph.md5
deleted file mode 100644
index 9b7fd4123..000000000
--- a/dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fddaaa2fd0ab91aae41f0dd6e4080af0
\ No newline at end of file
diff --git a/dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph.svg b/dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph.svg
deleted file mode 100644
index f0c8e7eec..000000000
--- a/dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph.svg
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dsu::size Pages: 1 -->
-<svg width="168pt" height="45pt"
- viewBox="0.00 0.00 168.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>dsu::size</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A utility function that returns the size of the set to which i belongs to.">
-<polygon fill="#999999" stroke="#666666" points="55.75,-19.25 0,-19.25 0,0 55.75,0 55.75,-19.25"/>
-<text text-anchor="middle" x="27.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="160.25,-19.25 91.75,-19.25 91.75,0 160.25,0 160.25,-19.25"/>
-<text text-anchor="middle" x="126" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M56.16,-9.62C63.63,-9.62 71.93,-9.62 80.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.97,-13.13 89.97,-9.63 79.97,-6.13 79.97,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.64,-19.54C103.63,-28.15 108.75,-37.25 126,-37.25 135.43,-37.25 141.24,-34.53 143.42,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.9,-30.22 141.64,-21.03 140.01,-31.5 146.9,-30.22"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph_org.svg b/dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph_org.svg
deleted file mode 100644
index 4f933a364..000000000
--- a/dd/d1f/classdsu_a1c24228b0f2f49220133fb8c3566a55c_cgraph_org.svg
+++ /dev/null
@@ -1,48 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dsu::size Pages: 1 -->
-<svg width="168pt" height="45pt"
- viewBox="0.00 0.00 168.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>dsu::size</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A utility function that returns the size of the set to which i belongs to.">
-<polygon fill="#999999" stroke="#666666" points="55.75,-19.25 0,-19.25 0,0 55.75,0 55.75,-19.25"/>
-<text text-anchor="middle" x="27.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::size</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="160.25,-19.25 91.75,-19.25 91.75,0 160.25,0 160.25,-19.25"/>
-<text text-anchor="middle" x="126" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M56.16,-9.62C63.63,-9.62 71.93,-9.62 80.11,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.97,-13.13 89.97,-9.63 79.97,-6.13 79.97,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.64,-19.54C103.63,-28.15 108.75,-37.25 126,-37.25 135.43,-37.25 141.24,-34.53 143.42,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.9,-30.22 141.64,-21.03 140.01,-31.5 146.9,-30.22"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph.map b/dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph.map
deleted file mode 100644
index 4f77f6ebe..000000000
--- a/dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="dsu::isSame" name="dsu::isSame">
-<area shape="rect" id="Node000001" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="5,29,100,55"/>
-<area shape="rect" id="Node000002" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="148,29,239,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="100,40,132,40,132,45,100,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="169,30,164,21,167,11,177,5,193,3,211,5,220,12,217,16,209,10,193,8,179,10,171,14,170,20,174,28"/>
-</map>
diff --git a/dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph.md5 b/dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph.md5
deleted file mode 100644
index a9910d044..000000000
--- a/dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9666ab5a7ac9febc21b685702c528011
\ No newline at end of file
diff --git a/dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph.svg b/dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph.svg
deleted file mode 100644
index 1065a538f..000000000
--- a/dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph.svg
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dsu::isSame Pages: 1 -->
-<svg width="183pt" height="45pt"
- viewBox="0.00 0.00 183.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>dsu::isSame</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="#999999" stroke="#666666" points="70.75,-19.25 0,-19.25 0,0 70.75,0 70.75,-19.25"/>
-<text text-anchor="middle" x="35.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="175.25,-19.25 106.75,-19.25 106.75,0 175.25,0 175.25,-19.25"/>
-<text text-anchor="middle" x="141" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.17,-9.62C78.83,-9.62 87.06,-9.62 95.06,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.01,-13.13 105.01,-9.63 95.01,-6.13 95.01,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.46,-19.54C116.92,-28.15 122.43,-37.25 141,-37.25 151.15,-37.25 157.4,-34.53 159.75,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.22,-30.15 157.83,-21.02 156.35,-31.51 163.22,-30.15"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph_org.svg b/dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph_org.svg
deleted file mode 100644
index c02e230e5..000000000
--- a/dd/d1f/classdsu_a64d25c5986742f7c234ed449b2ff7303_cgraph_org.svg
+++ /dev/null
@@ -1,48 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dsu::isSame Pages: 1 -->
-<svg width="183pt" height="45pt"
- viewBox="0.00 0.00 183.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>dsu::isSame</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="#999999" stroke="#666666" points="70.75,-19.25 0,-19.25 0,0 70.75,0 70.75,-19.25"/>
-<text text-anchor="middle" x="35.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="175.25,-19.25 106.75,-19.25 106.75,0 175.25,0 175.25,-19.25"/>
-<text text-anchor="middle" x="141" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.17,-9.62C78.83,-9.62 87.06,-9.62 95.06,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.01,-13.13 105.01,-9.63 95.01,-6.13 95.01,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.46,-19.54C116.92,-28.15 122.43,-37.25 141,-37.25 151.15,-37.25 157.4,-34.53 159.75,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.22,-30.15 157.83,-21.02 156.35,-31.51 163.22,-30.15"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph.map b/dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph.map
deleted file mode 100644
index a31ebf5de..000000000
--- a/dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="dsu::get_max" name="dsu::get_max">
-<area shape="rect" id="Node000001" title="A utility function that returns the max element of the set to which i belongs to." alt="" coords="5,29,106,55"/>
-<area shape="rect" id="Node000002" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="154,29,245,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="106,40,138,40,138,45,106,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="174,30,170,21,173,11,183,5,199,3,217,5,226,12,223,16,215,10,199,8,185,10,177,14,175,20,179,28"/>
-</map>
diff --git a/dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph.md5 b/dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph.md5
deleted file mode 100644
index f80912697..000000000
--- a/dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b202e13bbe60d0a6124f632d19878899
\ No newline at end of file
diff --git a/dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph.svg b/dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph.svg
deleted file mode 100644
index 8692f5120..000000000
--- a/dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph.svg
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dsu::get_max Pages: 1 -->
-<svg width="188pt" height="45pt"
- viewBox="0.00 0.00 187.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>dsu::get_max</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A utility function that returns the max element of the set to which i belongs to.">
-<polygon fill="#999999" stroke="#666666" points="75.25,-19.25 0,-19.25 0,0 75.25,0 75.25,-19.25"/>
-<text text-anchor="middle" x="37.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="179.75,-19.25 111.25,-19.25 111.25,0 179.75,0 179.75,-19.25"/>
-<text text-anchor="middle" x="145.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.65,-9.62C83.35,-9.62 91.53,-9.62 99.48,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.34,-13.13 109.34,-9.63 99.34,-6.13 99.34,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.61,-19.54C120.91,-28.15 126.54,-37.25 145.5,-37.25 155.87,-37.25 162.25,-34.53 164.65,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.11,-30.12 162.69,-21.02 161.25,-31.52 168.11,-30.12"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph_org.svg b/dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph_org.svg
deleted file mode 100644
index 70d64fafd..000000000
--- a/dd/d1f/classdsu_a696141b8b092466767f4bfe1c5e46cde_cgraph_org.svg
+++ /dev/null
@@ -1,48 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dsu::get_max Pages: 1 -->
-<svg width="188pt" height="45pt"
- viewBox="0.00 0.00 187.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>dsu::get_max</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A utility function that returns the max element of the set to which i belongs to.">
-<polygon fill="#999999" stroke="#666666" points="75.25,-19.25 0,-19.25 0,0 75.25,0 75.25,-19.25"/>
-<text text-anchor="middle" x="37.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_max</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="179.75,-19.25 111.25,-19.25 111.25,0 179.75,0 179.75,-19.25"/>
-<text text-anchor="middle" x="145.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.65,-9.62C83.35,-9.62 91.53,-9.62 99.48,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.34,-13.13 109.34,-9.63 99.34,-6.13 99.34,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.61,-19.54C120.91,-28.15 126.54,-37.25 145.5,-37.25 155.87,-37.25 162.25,-34.53 164.65,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.11,-30.12 162.69,-21.02 161.25,-31.52 168.11,-30.12"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph.map b/dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph.map
deleted file mode 100644
index c29a6c0a3..000000000
--- a/dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="dsu::UnionSet" name="dsu::UnionSet">
-<area shape="rect" id="Node000001" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="5,104,110,130"/>
-<area shape="rect" id="Node000002" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="300,29,391,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="69,102,105,69,130,52,157,40,189,32,222,28,285,30,285,35,223,34,190,37,159,45,132,57,109,73,72,106"/>
-<area shape="rect" id="Node000003" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="158,55,252,80"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="98,101,149,83,150,88,99,106"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="169,104,241,130"/>
-<area shape="poly" id="edge5_Node000001_Node000004" title=" " alt="" coords="110,114,153,114,153,120,110,120"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="171,153,239,179"/>
-<area shape="poly" id="edge6_Node000001_Node000005" title=" " alt="" coords="99,128,157,147,155,153,98,133"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="166,203,244,228"/>
-<area shape="poly" id="edge7_Node000001_Node000006" title=" " alt="" coords="76,128,159,189,164,192,161,197,156,194,73,132"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="321,30,317,21,319,11,329,5,346,3,363,5,372,12,369,16,361,10,346,8,331,10,324,14,322,20,326,28"/>
-<area shape="poly" id="edge4_Node000003_Node000002" title=" " alt="" coords="252,56,284,50,285,56,253,62"/>
-</map>
diff --git a/dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph.md5 b/dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph.md5
deleted file mode 100644
index 578309684..000000000
--- a/dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f3d61cc72c3fa249c8e5781e906f1d12
\ No newline at end of file
diff --git a/dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph.svg b/dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph.svg
deleted file mode 100644
index c278a63c2..000000000
--- a/dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph.svg
+++ /dev/null
@@ -1,155 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dsu::UnionSet Pages: 1 -->
-<svg width="298pt" height="175pt"
- viewBox="0.00 0.00 297.50 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>dsu::UnionSet</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="#999999" stroke="#666666" points="78.25,-93.25 0,-93.25 0,-74 78.25,-74 78.25,-93.25"/>
-<text text-anchor="middle" x="39.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="289.5,-149.25 221,-149.25 221,-130 289.5,-130 289.5,-149.25"/>
-<text text-anchor="middle" x="255.25" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M48.99,-93.51C61.83,-106.99 87.03,-130.5 114.25,-139.62 144.94,-149.91 181.58,-149.5 209.67,-146.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="209.72,-150.25 219.26,-145.65 208.93,-143.29 209.72,-150.25"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="185,-130.25 114.25,-130.25 114.25,-111 185,-111 185,-130.25"/>
-<text text-anchor="middle" x="149.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.77,-93.74C81.61,-97.77 95.44,-102.49 108.18,-106.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.99,-110.12 117.58,-110.04 109.25,-103.5 106.99,-110.12"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-93.25 122.5,-93.25 122.5,-74 176.75,-74 176.75,-93.25"/>
-<text text-anchor="middle" x="149.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M78.68,-83.62C89.13,-83.62 100.42,-83.62 110.82,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.58,-87.13 120.58,-83.63 110.58,-80.13 110.58,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="175.25,-56.25 124,-56.25 124,-37 175.25,-37 175.25,-56.25"/>
-<text text-anchor="middle" x="149.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.77,-73.51C83.14,-68.96 99.04,-63.54 113.04,-58.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="114.02,-62.13 122.35,-55.58 111.76,-55.5 114.02,-62.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="179,-19.25 120.25,-19.25 120.25,0 179,0 179,-19.25"/>
-<text text-anchor="middle" x="149.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M51.76,-73.88C66,-62.18 91.09,-42.3 114.25,-27.62 115.47,-26.85 116.72,-26.09 117.99,-25.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="119.62,-28.43 126.63,-20.48 116.2,-22.32 119.62,-28.43"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M238.71,-149.54C231.17,-158.15 236.68,-167.25 255.25,-167.25 265.4,-167.25 271.65,-164.53 274,-160.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.47,-160.15 272.08,-151.02 270.6,-161.51 277.47,-160.15"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge4_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge4_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.42,-127C193.17,-128.43 201.5,-129.95 209.58,-131.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.82,-134.85 219.29,-133.21 210.08,-127.97 208.82,-134.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph_org.svg b/dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph_org.svg
deleted file mode 100644
index 5d08dd7cd..000000000
--- a/dd/d1f/classdsu_a6ac30c07abca2aaa3b291504c25c3559_cgraph_org.svg
+++ /dev/null
@@ -1,129 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dsu::UnionSet Pages: 1 -->
-<svg width="298pt" height="175pt"
- viewBox="0.00 0.00 297.50 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>dsu::UnionSet</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="#999999" stroke="#666666" points="78.25,-93.25 0,-93.25 0,-74 78.25,-74 78.25,-93.25"/>
-<text text-anchor="middle" x="39.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::UnionSet</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="289.5,-149.25 221,-149.25 221,-130 289.5,-130 289.5,-149.25"/>
-<text text-anchor="middle" x="255.25" y="-135.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M48.99,-93.51C61.83,-106.99 87.03,-130.5 114.25,-139.62 144.94,-149.91 181.58,-149.5 209.67,-146.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="209.72,-150.25 219.26,-145.65 208.93,-143.29 209.72,-150.25"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="185,-130.25 114.25,-130.25 114.25,-111 185,-111 185,-130.25"/>
-<text text-anchor="middle" x="149.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.77,-93.74C81.61,-97.77 95.44,-102.49 108.18,-106.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="106.99,-110.12 117.58,-110.04 109.25,-103.5 106.99,-110.12"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-93.25 122.5,-93.25 122.5,-74 176.75,-74 176.75,-93.25"/>
-<text text-anchor="middle" x="149.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M78.68,-83.62C89.13,-83.62 100.42,-83.62 110.82,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.58,-87.13 120.58,-83.63 110.58,-80.13 110.58,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="175.25,-56.25 124,-56.25 124,-37 175.25,-37 175.25,-56.25"/>
-<text text-anchor="middle" x="149.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.77,-73.51C83.14,-68.96 99.04,-63.54 113.04,-58.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="114.02,-62.13 122.35,-55.58 111.76,-55.5 114.02,-62.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="179,-19.25 120.25,-19.25 120.25,0 179,0 179,-19.25"/>
-<text text-anchor="middle" x="149.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge7_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge7_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M51.76,-73.88C66,-62.18 91.09,-42.3 114.25,-27.62 115.47,-26.85 116.72,-26.09 117.99,-25.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="119.62,-28.43 126.63,-20.48 116.2,-22.32 119.62,-28.43"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M238.71,-149.54C231.17,-158.15 236.68,-167.25 255.25,-167.25 265.4,-167.25 271.65,-164.53 274,-160.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="277.47,-160.15 272.08,-151.02 270.6,-161.51 277.47,-160.15"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge4_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge4_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.42,-127C193.17,-128.43 201.5,-129.95 209.58,-131.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="208.82,-134.85 219.29,-133.21 210.08,-127.97 208.82,-134.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph.map b/dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph.map
deleted file mode 100644
index 57f73a521..000000000
--- a/dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="dsu::unionSet" name="dsu::unionSet">
-<area shape="rect" id="Node000001" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="5,55,107,80"/>
-<area shape="rect" id="Node000002" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="297,29,388,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="99,51,154,40,220,35,282,36,282,41,220,40,155,45,100,57"/>
-<area shape="rect" id="Node000003" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="155,55,249,80"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="107,65,139,65,139,70,107,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="163,104,241,130"/>
-<area shape="poly" id="edge5_Node000001_Node000004" title=" " alt="" coords="97,78,149,96,147,101,96,84"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="318,30,314,21,316,11,326,5,343,3,360,5,369,12,366,16,358,10,343,8,328,10,321,14,319,20,323,28"/>
-<area shape="poly" id="edge4_Node000003_Node000002" title=" " alt="" coords="249,56,281,50,282,56,250,62"/>
-</map>
diff --git a/dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph.md5 b/dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph.md5
deleted file mode 100644
index 376bfeed5..000000000
--- a/dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-12638e1e2f578259269ef23760cb896f
\ No newline at end of file
diff --git a/dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph.svg b/dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph.svg
deleted file mode 100644
index 2668fc8fe..000000000
--- a/dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dsu::unionSet Pages: 1 -->
-<svg width="295pt" height="101pt"
- viewBox="0.00 0.00 295.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>dsu::unionSet</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="#999999" stroke="#666666" points="76,-56.25 0,-56.25 0,-37 76,-37 76,-56.25"/>
-<text text-anchor="middle" x="38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::unionSet</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="287.25,-75.25 218.75,-75.25 218.75,-56 287.25,-56 287.25,-75.25"/>
-<text text-anchor="middle" x="253" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.64,-56.73C83.35,-60.3 98.23,-63.86 112,-65.62 143.64,-69.68 179.64,-69.57 207.21,-68.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="207.12,-72.02 216.96,-68.07 206.81,-65.02 207.12,-72.02"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="182.75,-56.25 112,-56.25 112,-37 182.75,-37 182.75,-56.25"/>
-<text text-anchor="middle" x="147.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.25,-46.62C83.99,-46.62 92.22,-46.62 100.23,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.2,-50.13 110.2,-46.63 100.2,-43.13 100.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-19.25 118,-19.25 118,0 176.75,0 176.75,-19.25"/>
-<text text-anchor="middle" x="147.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M68.34,-36.51C80.25,-32.41 94.19,-27.61 106.96,-23.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.07,-26.53 116.38,-19.96 105.79,-19.91 108.07,-26.53"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M236.46,-75.54C228.92,-84.15 234.43,-93.25 253,-93.25 263.15,-93.25 269.4,-90.53 271.75,-86.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="275.22,-86.15 269.83,-77.02 268.35,-87.51 275.22,-86.15"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge4_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge4_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.17,-53C190.92,-54.43 199.25,-55.95 207.33,-57.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.57,-60.85 217.04,-59.21 207.83,-53.97 206.57,-60.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph_org.svg b/dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph_org.svg
deleted file mode 100644
index 39c963728..000000000
--- a/dd/d1f/classdsu_a81897528bdb53fd5e796d75d7dbc430f_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dsu::unionSet Pages: 1 -->
-<svg width="295pt" height="101pt"
- viewBox="0.00 0.00 295.25 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>dsu::unionSet</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="#999999" stroke="#666666" points="76,-56.25 0,-56.25 0,-37 76,-37 76,-56.25"/>
-<text text-anchor="middle" x="38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::unionSet</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="287.25,-75.25 218.75,-75.25 218.75,-56 287.25,-56 287.25,-75.25"/>
-<text text-anchor="middle" x="253" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.64,-56.73C83.35,-60.3 98.23,-63.86 112,-65.62 143.64,-69.68 179.64,-69.57 207.21,-68.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="207.12,-72.02 216.96,-68.07 206.81,-65.02 207.12,-72.02"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="182.75,-56.25 112,-56.25 112,-37 182.75,-37 182.75,-56.25"/>
-<text text-anchor="middle" x="147.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M76.25,-46.62C83.99,-46.62 92.22,-46.62 100.23,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.2,-50.13 110.2,-46.63 100.2,-43.13 100.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-19.25 118,-19.25 118,0 176.75,0 176.75,-19.25"/>
-<text text-anchor="middle" x="147.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge5_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge5_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M68.34,-36.51C80.25,-32.41 94.19,-27.61 106.96,-23.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.07,-26.53 116.38,-19.96 105.79,-19.91 108.07,-26.53"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M236.46,-75.54C228.92,-84.15 234.43,-93.25 253,-93.25 263.15,-93.25 269.4,-90.53 271.75,-86.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="275.22,-86.15 269.83,-77.02 268.35,-87.51 275.22,-86.15"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge4_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge4_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.17,-53C190.92,-54.43 199.25,-55.95 207.33,-57.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.57,-60.85 217.04,-59.21 207.83,-53.97 206.57,-60.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph.map b/dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph.map
deleted file mode 100644
index 424c0fae4..000000000
--- a/dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="dsu::get_min" name="dsu::get_min">
-<area shape="rect" id="Node000001" title="A utility function that returns the min element of the set to which i belongs to." alt="" coords="5,29,102,55"/>
-<area shape="rect" id="Node000002" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="150,29,241,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="102,40,134,40,134,45,102,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="171,30,166,21,169,11,179,5,195,3,213,5,222,12,219,16,211,10,195,8,181,10,173,14,171,20,176,28"/>
-</map>
diff --git a/dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph.md5 b/dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph.md5
deleted file mode 100644
index 4070ab206..000000000
--- a/dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cb0bc437891d05cd2ad23fe1a8e2bbff
\ No newline at end of file
diff --git a/dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph.svg b/dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph.svg
deleted file mode 100644
index bc8751030..000000000
--- a/dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph.svg
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dsu::get_min Pages: 1 -->
-<svg width="185pt" height="45pt"
- viewBox="0.00 0.00 184.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>dsu::get_min</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A utility function that returns the min element of the set to which i belongs to.">
-<polygon fill="#999999" stroke="#666666" points="72.25,-19.25 0,-19.25 0,0 72.25,0 72.25,-19.25"/>
-<text text-anchor="middle" x="36.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="176.75,-19.25 108.25,-19.25 108.25,0 176.75,0 176.75,-19.25"/>
-<text text-anchor="middle" x="142.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.46,-9.62C80.17,-9.62 88.43,-9.62 96.46,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.45,-13.13 106.45,-9.63 96.45,-6.13 96.45,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.85,-19.54C118.25,-28.15 123.8,-37.25 142.5,-37.25 152.73,-37.25 159.02,-34.53 161.38,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.85,-30.14 159.45,-21.02 157.98,-31.51 164.85,-30.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph_org.svg b/dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph_org.svg
deleted file mode 100644
index 498e1aba3..000000000
--- a/dd/d1f/classdsu_ac713a5b496d0405c82e2808a85e58415_cgraph_org.svg
+++ /dev/null
@@ -1,48 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dsu::get_min Pages: 1 -->
-<svg width="185pt" height="45pt"
- viewBox="0.00 0.00 184.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>dsu::get_min</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A utility function that returns the min element of the set to which i belongs to.">
-<polygon fill="#999999" stroke="#666666" points="72.25,-19.25 0,-19.25 0,0 72.25,0 72.25,-19.25"/>
-<text text-anchor="middle" x="36.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::get_min</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="176.75,-19.25 108.25,-19.25 108.25,0 176.75,0 176.75,-19.25"/>
-<text text-anchor="middle" x="142.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M72.46,-9.62C80.17,-9.62 88.43,-9.62 96.46,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.45,-13.13 106.45,-9.63 96.45,-6.13 96.45,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.85,-19.54C118.25,-28.15 123.8,-37.25 142.5,-37.25 152.73,-37.25 159.02,-34.53 161.38,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.85,-30.14 159.45,-21.02 157.98,-31.51 164.85,-30.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d21/namespacewindowed__median.html b/dd/d21/namespacewindowed__median.html
index 9a6ba1ffe..7bd7a77bf 100644
--- a/dd/d21/namespacewindowed__median.html
+++ b/dd/d21/namespacewindowed__median.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: windowed_median Namespace Reference</title>
+<title>TheAlgorithms/C++: windowed_median Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dd/d24/namespacedynamic__programming.html b/dd/d24/namespacedynamic__programming.html
index addbc6dcb..a92bb746a 100644
--- a/dd/d24/namespacedynamic__programming.html
+++ b/dd/d24/namespacedynamic__programming.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming Namespace Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,16 +136,16 @@ Functions</h2></td></tr>
 <tr class="memitem:af046365a8d77a1267acc082f86135a26"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af046365a8d77a1267acc082f86135a26">is_armstrong</a> (const T &amp;number)</td></tr>
 <tr class="memdesc:af046365a8d77a1267acc082f86135a26"><td class="mdescLeft">&#160;</td><td class="mdescRight">Checks if the given number is armstrong or not.  <br /></td></tr>
 <tr class="separator:af046365a8d77a1267acc082f86135a26"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0a2215194e58786c34db1ccaf8031079" id="r_a0a2215194e58786c34db1ccaf8031079"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0a2215194e58786c34db1ccaf8031079">LIS</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;a, const uint32_t &amp;n)</td></tr>
+<tr class="memitem:a0a2215194e58786c34db1ccaf8031079" id="r_a0a2215194e58786c34db1ccaf8031079"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0a2215194e58786c34db1ccaf8031079">LIS</a> (const std::vector&lt; uint64_t &gt; &amp;a, const uint32_t &amp;n)</td></tr>
 <tr class="memdesc:a0a2215194e58786c34db1ccaf8031079"><td class="mdescLeft">&#160;</td><td class="mdescRight">Calculate the longest increasing subsequence for the specified numbers.  <br /></td></tr>
 <tr class="separator:a0a2215194e58786c34db1ccaf8031079"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:afe9f45b6e30ee187509da2d1d0093412" id="r_afe9f45b6e30ee187509da2d1d0093412"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afe9f45b6e30ee187509da2d1d0093412">lps</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;a)</td></tr>
+<tr class="memitem:afe9f45b6e30ee187509da2d1d0093412" id="r_afe9f45b6e30ee187509da2d1d0093412"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afe9f45b6e30ee187509da2d1d0093412">lps</a> (const std::string &amp;a)</td></tr>
 <tr class="memdesc:afe9f45b6e30ee187509da2d1d0093412"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that returns the longest palindromic subsequence of a string.  <br /></td></tr>
 <tr class="separator:afe9f45b6e30ee187509da2d1d0093412"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a5239174fa0d987f2c67edc1f2af82beb" id="r_a5239174fa0d987f2c67edc1f2af82beb"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5239174fa0d987f2c67edc1f2af82beb">maxCircularSum</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;arr)</td></tr>
+<tr class="memitem:a5239174fa0d987f2c67edc1f2af82beb" id="r_a5239174fa0d987f2c67edc1f2af82beb"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5239174fa0d987f2c67edc1f2af82beb">maxCircularSum</a> (std::vector&lt; int &gt; &amp;arr)</td></tr>
 <tr class="memdesc:a5239174fa0d987f2c67edc1f2af82beb"><td class="mdescLeft">&#160;</td><td class="mdescRight">returns the maximum contiguous circular sum of an array  <br /></td></tr>
 <tr class="separator:a5239174fa0d987f2c67edc1f2af82beb"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a066e0e739e7c276eee6e61d5b4d37ce8" id="r_a066e0e739e7c276eee6e61d5b4d37ce8"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a066e0e739e7c276eee6e61d5b4d37ce8">trappedRainwater</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint32_t &gt; &amp;heights)</td></tr>
+<tr class="memitem:a066e0e739e7c276eee6e61d5b4d37ce8" id="r_a066e0e739e7c276eee6e61d5b4d37ce8"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a066e0e739e7c276eee6e61d5b4d37ce8">trappedRainwater</a> (const std::vector&lt; uint32_t &gt; &amp;heights)</td></tr>
 <tr class="memdesc:a066e0e739e7c276eee6e61d5b4d37ce8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to calculate the trapped rainwater.  <br /></td></tr>
 <tr class="separator:a066e0e739e7c276eee6e61d5b4d37ce8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
@@ -136,26 +153,26 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Dynamic Programming algorithms. </p>
 <p>Dynamic programming algorithms.</p>
 <p>Namespace for dynamic programming algorithms.</p>
-<p>For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>.</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>For std::vector.</p>
+<p>for std::vector</p>
 <p>Dynamic Programming algorithm.</p>
 <p>for IO operations</p>
 <p>Dynamic Programming Algorithms.</p>
-<p>for <code>assert</code> for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a></code> for IO operations for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></code> library for <code><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></code> STL library</p>
-<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></p>
+<p>for <code>assert</code> for <code>std::uint32_t</code> for IO operations for <code>std::string</code> library for <code>std::vector</code> STL library</p>
+<p>for assert for std::pow</p>
 <p>Dynamic Programming algorithms</p>
-<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> for io operations</p>
+<p>for assert for std::max for std::uint32_t for io operations</p>
 <p>Dynamic Programming algorithms</p>
-<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> for IO operations</p>
+<p>for assert for std::max for std::uint64_t for IO operations</p>
 <p>Dynamic Programming algorithms</p>
-<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>for assert for std::string for std::vector</p>
 <p>for assert for IO operations</p>
 <p>Dynamic Programming algorithms</p>
-<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> for IO operations</p>
+<p>for assert for std::uint64_t for IO operations</p>
 <p>Dynamic Programming algorithms</p>
 <p>for std::assert for IO operations for unordered map</p>
 <p>Dynamic Programming algorithms</p>
-<p>For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a> and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a> For assert For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> </p>
+<p>For std::min and std::max For assert For std::size_t </p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="af046365a8d77a1267acc082f86135a26" name="af046365a8d77a1267acc082f86135a26"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#af046365a8d77a1267acc082f86135a26">&#9670;&#160;</a></span>is_armstrong()</h2>
@@ -184,6 +201,8 @@ template&lt;typename T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>false if the given number is NOT armstrong </dd>
 <dd>
 true if the given number IS armstrong </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/da7/armstrong__number__templated_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../d1/da7/armstrong__number__templated_8cpp_source.html">armstrong_number_templated.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   39</span>                                   {</div>
 <div class="line"><span class="lineno">   40</span>    <span class="keywordtype">int</span> count = 0, temp = number, result = 0, rem = 0;</div>
 <div class="line"><span class="lineno">   41</span> </div>
@@ -200,7 +219,7 @@ true if the given number IS armstrong </dd></dl>
 <div class="line"><span class="lineno">   52</span>    temp = number;</div>
 <div class="line"><span class="lineno">   53</span>    <span class="keywordflow">while</span> (temp != 0) {</div>
 <div class="line"><span class="lineno">   54</span>        rem = temp % 10;</div>
-<div class="line"><span class="lineno">   55</span>        result += <span class="keyword">static_cast&lt;</span>T<span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(rem, count));</div>
+<div class="line"><span class="lineno">   55</span>        result += <span class="keyword">static_cast&lt;</span>T<span class="keyword">&gt;</span>(std::pow(rem, count));</div>
 <div class="line"><span class="lineno">   56</span>        temp /= 10;</div>
 <div class="line"><span class="lineno">   57</span>    }</div>
 <div class="line"><span class="lineno">   58</span> </div>
@@ -210,13 +229,7 @@ true if the given number IS armstrong </dd></dl>
 <div class="line"><span class="lineno">   62</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   63</span>    }</div>
 <div class="line"><span class="lineno">   64</span>}</div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.svg" width="283" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0a2215194e58786c34db1ccaf8031079" name="a0a2215194e58786c34db1ccaf8031079"></a>
@@ -228,7 +241,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">uint64_t dynamic_programming::LIS </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; uint64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -247,8 +260,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the length of the longest increasing subsequence in the <code>a</code> array of size <code>n</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d57/longest__increasing__subsequence_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../d7/d57/longest__increasing__subsequence_8cpp_source.html">longest_increasing_subsequence.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   40</span>                                                              {</div>
-<div class="line"><span class="lineno">   41</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> lis(n);</div>
+<div class="line"><span class="lineno">   41</span>    std::vector&lt;int&gt; lis(n);</div>
 <div class="line"><span class="lineno">   42</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
 <div class="line"><span class="lineno">   43</span>        lis[i] = 1;</div>
 <div class="line"><span class="lineno">   44</span>    }</div>
@@ -261,18 +276,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   51</span>    }</div>
 <div class="line"><span class="lineno">   52</span>    <span class="keywordtype">int</span> res = 0;</div>
 <div class="line"><span class="lineno">   53</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
-<div class="line"><span class="lineno">   54</span>        res = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(res, lis[i]);</div>
+<div class="line"><span class="lineno">   54</span>        res = std::max(res, lis[i]);</div>
 <div class="line"><span class="lineno">   55</span>    }</div>
 <div class="line"><span class="lineno">   56</span>    <span class="keywordflow">return</span> res;</div>
 <div class="line"><span class="lineno">   57</span>}</div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph.svg" width="312" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="afe9f45b6e30ee187509da2d1d0093412" name="afe9f45b6e30ee187509da2d1d0093412"></a>
@@ -282,9 +290,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> dynamic_programming::lps </td>
+          <td class="memname">std::string dynamic_programming::lps </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -298,12 +306,14 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>longest palindromic subsequence of the string </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d77/longest__palindromic__subsequence_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../d0/d77/longest__palindromic__subsequence_8cpp_source.html">longest_palindromic_subsequence.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   31</span>                                  {</div>
-<div class="line"><span class="lineno">   32</span>    <span class="keyword">const</span> <span class="keyword">auto</span> b = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>(a.rbegin(), a.rend());</div>
+<div class="line"><span class="lineno">   32</span>    <span class="keyword">const</span> <span class="keyword">auto</span> b = std::string(a.rbegin(), a.rend());</div>
 <div class="line"><span class="lineno">   33</span>    <span class="keyword">const</span> <span class="keyword">auto</span> m = a.length();</div>
 <div class="line"><span class="lineno">   34</span>    <span class="keyword">using </span>ind_type = std::string::size_type;</div>
-<div class="line"><span class="lineno">   35</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;ind_type&gt;</a> &gt; res(m + 1,</div>
-<div class="line"><span class="lineno">   36</span>                                            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;ind_type&gt;</a>(m + 1));</div>
+<div class="line"><span class="lineno">   35</span>    std::vector&lt;std::vector&lt;ind_type&gt; &gt; res(m + 1,</div>
+<div class="line"><span class="lineno">   36</span>                                            std::vector&lt;ind_type&gt;(m + 1));</div>
 <div class="line"><span class="lineno">   37</span> </div>
 <div class="line"><span class="lineno">   38</span>    <span class="comment">// Finding the length of the longest</span></div>
 <div class="line"><span class="lineno">   39</span>    <span class="comment">// palindromic subsequence and storing</span></div>
@@ -315,14 +325,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   45</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (a[i - 1] == b[j - 1]) {</div>
 <div class="line"><span class="lineno">   46</span>                res[i][j] = res[i - 1][j - 1] + 1;</div>
 <div class="line"><span class="lineno">   47</span>            } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   48</span>                res[i][j] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(res[i - 1][j], res[i][j - 1]);</div>
+<div class="line"><span class="lineno">   48</span>                res[i][j] = std::max(res[i - 1][j], res[i][j - 1]);</div>
 <div class="line"><span class="lineno">   49</span>            }</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="comment">// Length of longest palindromic subsequence</span></div>
 <div class="line"><span class="lineno">   53</span>    <span class="keyword">auto</span> idx = res[m][m];</div>
 <div class="line"><span class="lineno">   54</span>    <span class="comment">// Creating string of index+1 length</span></div>
-<div class="line"><span class="lineno">   55</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ans(idx, <span class="charliteral">&#39;\0&#39;</span>);</div>
+<div class="line"><span class="lineno">   55</span>    std::string ans(idx, <span class="charliteral">&#39;\0&#39;</span>);</div>
 <div class="line"><span class="lineno">   56</span>    ind_type i = m, j = m;</div>
 <div class="line"><span class="lineno">   57</span> </div>
 <div class="line"><span class="lineno">   58</span>    <span class="comment">// starting from right-most bottom-most corner</span></div>
@@ -347,13 +357,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   77</span> </div>
 <div class="line"><span class="lineno">   78</span>    <span class="keywordflow">return</span> ans;</div>
 <div class="line"><span class="lineno">   79</span>}</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-</div><!-- 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="../../dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph.svg" width="308" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5239174fa0d987f2c67edc1f2af82beb" name="a5239174fa0d987f2c67edc1f2af82beb"></a>
@@ -365,7 +369,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">int dynamic_programming::maxCircularSum </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -379,14 +383,16 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>int which is the maximum sum </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dfb/maximum__circular__subarray_8cpp_source.html#l00026">26</a> of file <a class="el" href="../../db/dfb/maximum__circular__subarray_8cpp_source.html">maximum_circular_subarray.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   27</span>{</div>
 <div class="line"><span class="lineno">   28</span>    <span class="comment">// Edge Case</span></div>
-<div class="line"><span class="lineno">   29</span>    <span class="keywordflow">if</span> (arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() == 1)</div>
+<div class="line"><span class="lineno">   29</span>    <span class="keywordflow">if</span> (arr.size() == 1)</div>
 <div class="line"><span class="lineno">   30</span>        <span class="keywordflow">return</span> arr[0];</div>
 <div class="line"><span class="lineno">   31</span>  </div>
 <div class="line"><span class="lineno">   32</span>    <span class="comment">// Sum variable which stores total sum of the array.</span></div>
 <div class="line"><span class="lineno">   33</span>    <span class="keywordtype">int</span> sum = 0;</div>
-<div class="line"><span class="lineno">   34</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
+<div class="line"><span class="lineno">   34</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; arr.size(); i++) {</div>
 <div class="line"><span class="lineno">   35</span>        sum += arr[i];</div>
 <div class="line"><span class="lineno">   36</span>    }</div>
 <div class="line"><span class="lineno">   37</span>  </div>
@@ -394,30 +400,23 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   39</span>    <span class="keywordtype">int</span> current_max = arr[0], max_so_far = arr[0], current_min = arr[0], min_so_far = arr[0];</div>
 <div class="line"><span class="lineno">   40</span>  </div>
 <div class="line"><span class="lineno">   41</span>    <span class="comment">// Concept of Kadane&#39;s Algorithm</span></div>
-<div class="line"><span class="lineno">   42</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
+<div class="line"><span class="lineno">   42</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; arr.size(); i++) {</div>
 <div class="line"><span class="lineno">   43</span>        <span class="comment">// Kadane&#39;s Algorithm to find Maximum subarray sum.</span></div>
-<div class="line"><span class="lineno">   44</span>        current_max = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(current_max + arr[i], arr[i]);</div>
-<div class="line"><span class="lineno">   45</span>        max_so_far = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(max_so_far, current_max);</div>
+<div class="line"><span class="lineno">   44</span>        current_max = std::max(current_max + arr[i], arr[i]);</div>
+<div class="line"><span class="lineno">   45</span>        max_so_far = std::max(max_so_far, current_max);</div>
 <div class="line"><span class="lineno">   46</span>  </div>
 <div class="line"><span class="lineno">   47</span>        <span class="comment">// Kadane&#39;s Algorithm to find Minimum subarray sum.</span></div>
-<div class="line"><span class="lineno">   48</span>        current_min = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(current_min + arr[i], arr[i]);</div>
-<div class="line"><span class="lineno">   49</span>        min_so_far = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(min_so_far, current_min);</div>
+<div class="line"><span class="lineno">   48</span>        current_min = std::min(current_min + arr[i], arr[i]);</div>
+<div class="line"><span class="lineno">   49</span>        min_so_far = std::min(min_so_far, current_min);</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">if</span> (min_so_far == sum)</div>
 <div class="line"><span class="lineno">   53</span>        <span class="keywordflow">return</span> max_so_far;</div>
 <div class="line"><span class="lineno">   54</span>  </div>
 <div class="line"><span class="lineno">   55</span>    <span class="comment">// Return the maximum value</span></div>
-<div class="line"><span class="lineno">   56</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(max_so_far, sum - min_so_far);</div>
+<div class="line"><span class="lineno">   56</span>    <span class="keywordflow">return</span> std::max(max_so_far, sum - min_so_far);</div>
 <div class="line"><span class="lineno">   57</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><!-- 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="../../dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph.svg" width="327" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a066e0e739e7c276eee6e61d5b4d37ce8" name="a066e0e739e7c276eee6e61d5b4d37ce8"></a>
@@ -429,7 +428,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">uint32_t dynamic_programming::trappedRainwater </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>heights</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; uint32_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>heights</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -443,41 +442,37 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The amount of trapped rainwater </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d80/trapped__rainwater_8cpp_source.html#l00027">27</a> of file <a class="el" href="../../d9/d80/trapped__rainwater_8cpp_source.html">trapped_rainwater.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   27</span>                                                              {</div>
-<div class="line"><span class="lineno">   28</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> n = heights.<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">   28</span>    std::size_t n = heights.size();</div>
 <div class="line"><span class="lineno">   29</span>    <span class="keywordflow">if</span> (n &lt;= 2)</div>
 <div class="line"><span class="lineno">   30</span>        <span class="keywordflow">return</span> 0;  <span class="comment">// No water can be trapped with less than 3 walls</span></div>
 <div class="line"><span class="lineno">   31</span> </div>
-<div class="line"><span class="lineno">   32</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a> leftMax(n), rightMax(n);</div>
+<div class="line"><span class="lineno">   32</span>    std::vector&lt;uint32_t&gt; leftMax(n), rightMax(n);</div>
 <div class="line"><span class="lineno">   33</span> </div>
 <div class="line"><span class="lineno">   34</span>    <span class="comment">// Calculate the maximum height of wall to the left of each wall</span></div>
 <div class="line"><span class="lineno">   35</span>    leftMax[0] = heights[0];</div>
-<div class="line"><span class="lineno">   36</span>    <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> i = 1; i &lt; n; ++i) {</div>
-<div class="line"><span class="lineno">   37</span>        leftMax[i] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(leftMax[i - 1], heights[i]);</div>
+<div class="line"><span class="lineno">   36</span>    <span class="keywordflow">for</span> (std::size_t i = 1; i &lt; n; ++i) {</div>
+<div class="line"><span class="lineno">   37</span>        leftMax[i] = std::max(leftMax[i - 1], heights[i]);</div>
 <div class="line"><span class="lineno">   38</span>    }</div>
 <div class="line"><span class="lineno">   39</span> </div>
 <div class="line"><span class="lineno">   40</span>    <span class="comment">// Calculate the maximum height of wall to the right of each wall</span></div>
 <div class="line"><span class="lineno">   41</span>    rightMax[n - 1] = heights[n - 1];</div>
-<div class="line"><span class="lineno">   42</span>    <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> i = n - 2; i &lt; n; --i) {</div>
-<div class="line"><span class="lineno">   43</span>        rightMax[i] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(rightMax[i + 1], heights[i]);</div>
+<div class="line"><span class="lineno">   42</span>    <span class="keywordflow">for</span> (std::size_t i = n - 2; i &lt; n; --i) {</div>
+<div class="line"><span class="lineno">   43</span>        rightMax[i] = std::max(rightMax[i + 1], heights[i]);</div>
 <div class="line"><span class="lineno">   44</span>    }</div>
 <div class="line"><span class="lineno">   45</span> </div>
 <div class="line"><span class="lineno">   46</span>    <span class="comment">// Calculate the trapped rainwater between walls</span></div>
 <div class="line"><span class="lineno">   47</span>    uint32_t trappedWater = 0;</div>
-<div class="line"><span class="lineno">   48</span>    <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> i = 0; i &lt; n; ++i) {</div>
+<div class="line"><span class="lineno">   48</span>    <span class="keywordflow">for</span> (std::size_t i = 0; i &lt; n; ++i) {</div>
 <div class="line"><span class="lineno">   49</span>        trappedWater +=</div>
-<div class="line"><span class="lineno">   50</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(0u, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(leftMax[i], rightMax[i]) - heights[i]);</div>
+<div class="line"><span class="lineno">   50</span>            std::max(0u, std::min(leftMax[i], rightMax[i]) - heights[i]);</div>
 <div class="line"><span class="lineno">   51</span>    }</div>
 <div class="line"><span class="lineno">   52</span> </div>
 <div class="line"><span class="lineno">   53</span>    <span class="keywordflow">return</span> trappedWater;</div>
 <div class="line"><span class="lineno">   54</span>}</div>
-<div class="ttc" id="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d24/namespacedynamic__programming_a066e0e739e7c276eee6e61d5b4d37ce8_cgraph.svg" width="327" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dd/d24/namespacedynamic__programming_a066e0e739e7c276eee6e61d5b4d37ce8_cgraph.map b/dd/d24/namespacedynamic__programming_a066e0e739e7c276eee6e61d5b4d37ce8_cgraph.map
deleted file mode 100644
index 72f878475..000000000
--- a/dd/d24/namespacedynamic__programming_a066e0e739e7c276eee6e61d5b4d37ce8_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="dynamic_programming::trappedRainwater" name="dynamic_programming::trappedRainwater">
-<area shape="rect" id="Node000001" title="Function to calculate the trapped rainwater." alt="" coords="5,47,158,88"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="227,5,300,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="158,44,211,29,213,34,159,49"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="229,55,298,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="158,65,214,65,214,70,158,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="206,104,321,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="159,86,199,97,198,102,158,91"/>
-</map>
diff --git a/dd/d24/namespacedynamic__programming_a066e0e739e7c276eee6e61d5b4d37ce8_cgraph.md5 b/dd/d24/namespacedynamic__programming_a066e0e739e7c276eee6e61d5b4d37ce8_cgraph.md5
deleted file mode 100644
index 15d9ca50b..000000000
--- a/dd/d24/namespacedynamic__programming_a066e0e739e7c276eee6e61d5b4d37ce8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d46ed760551b143c23aab1cdfba3dfb6
\ No newline at end of file
diff --git a/dd/d24/namespacedynamic__programming_a066e0e739e7c276eee6e61d5b4d37ce8_cgraph.svg b/dd/d24/namespacedynamic__programming_a066e0e739e7c276eee6e61d5b4d37ce8_cgraph.svg
deleted file mode 100644
index 3508b497e..000000000
--- a/dd/d24/namespacedynamic__programming_a066e0e739e7c276eee6e61d5b4d37ce8_cgraph.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::trappedRainwater Pages: 1 -->
-<svg width="245pt" height="101pt"
- viewBox="0.00 0.00 244.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>dynamic_programming::trappedRainwater</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to calculate the trapped rainwater.">
-<polygon fill="#999999" stroke="#666666" points="114.25,-61.88 0,-61.88 0,-31.38 114.25,-31.38 114.25,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="57.12" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::trappedRainwater</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.62,-93.25 166.38,-93.25 166.38,-74 220.62,-74 220.62,-93.25"/>
-<text text-anchor="middle" x="193.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.72,-62.21C128.34,-65.96 142.56,-69.87 155.05,-73.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.95,-76.64 164.52,-75.92 155.81,-69.89 153.95,-76.64"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.12,-56.25 167.88,-56.25 167.88,-37 219.12,-37 219.12,-56.25"/>
-<text text-anchor="middle" x="193.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.72,-46.62C128.78,-46.62 143.47,-46.62 156.26,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.87,-50.13 165.87,-46.63 155.87,-43.13 155.87,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-19.25 150.25,-19.25 150.25,0 236.75,0 236.75,-19.25"/>
-<text text-anchor="middle" x="193.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.72,-31.04C124.72,-28.29 135.05,-25.44 144.77,-22.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.69,-26.14 154.4,-20.11 143.83,-19.4 145.69,-26.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d24/namespacedynamic__programming_a066e0e739e7c276eee6e61d5b4d37ce8_cgraph_org.svg b/dd/d24/namespacedynamic__programming_a066e0e739e7c276eee6e61d5b4d37ce8_cgraph_org.svg
deleted file mode 100644
index 412c0f9c6..000000000
--- a/dd/d24/namespacedynamic__programming_a066e0e739e7c276eee6e61d5b4d37ce8_cgraph_org.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::trappedRainwater Pages: 1 -->
-<svg width="245pt" height="101pt"
- viewBox="0.00 0.00 244.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>dynamic_programming::trappedRainwater</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to calculate the trapped rainwater.">
-<polygon fill="#999999" stroke="#666666" points="114.25,-61.88 0,-61.88 0,-31.38 114.25,-31.38 114.25,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="57.12" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::trappedRainwater</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.62,-93.25 166.38,-93.25 166.38,-74 220.62,-74 220.62,-93.25"/>
-<text text-anchor="middle" x="193.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.72,-62.21C128.34,-65.96 142.56,-69.87 155.05,-73.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.95,-76.64 164.52,-75.92 155.81,-69.89 153.95,-76.64"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.12,-56.25 167.88,-56.25 167.88,-37 219.12,-37 219.12,-56.25"/>
-<text text-anchor="middle" x="193.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.72,-46.62C128.78,-46.62 143.47,-46.62 156.26,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.87,-50.13 165.87,-46.63 155.87,-43.13 155.87,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-19.25 150.25,-19.25 150.25,0 236.75,0 236.75,-19.25"/>
-<text text-anchor="middle" x="193.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.72,-31.04C124.72,-28.29 135.05,-25.44 144.77,-22.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.69,-26.14 154.4,-20.11 143.83,-19.4 145.69,-26.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph.map b/dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph.map
deleted file mode 100644
index 7d8c74f1a..000000000
--- a/dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="dynamic_programming::LIS" name="dynamic_programming::LIS">
-<area shape="rect" id="Node000001" title="Calculate the longest increasing subsequence for the specified numbers." alt="" coords="5,5,186,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="234,5,306,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="186,16,218,16,218,21,186,21"/>
-</map>
diff --git a/dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph.md5 b/dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph.md5
deleted file mode 100644
index e4d390e3c..000000000
--- a/dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b794bb4e2fe175e960812153cc6aa135
\ No newline at end of file
diff --git a/dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph.svg b/dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph.svg
deleted file mode 100644
index 474a64a6b..000000000
--- a/dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::LIS Pages: 1 -->
-<svg width="234pt" height="27pt"
- viewBox="0.00 0.00 233.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>dynamic_programming::LIS</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Calculate the longest increasing subsequence for the specified numbers.">
-<polygon fill="#999999" stroke="#666666" points="135.25,-19.25 0,-19.25 0,0 135.25,0 135.25,-19.25"/>
-<text text-anchor="middle" x="67.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming::LIS</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="225.5,-19.25 171.25,-19.25 171.25,0 225.5,0 225.5,-19.25"/>
-<text text-anchor="middle" x="198.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.64,-9.62C143.82,-9.62 151.94,-9.62 159.48,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.25,-13.13 169.25,-9.63 159.25,-6.13 159.25,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph_org.svg b/dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph_org.svg
deleted file mode 100644
index 0883c62aa..000000000
--- a/dd/d24/namespacedynamic__programming_a0a2215194e58786c34db1ccaf8031079_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::LIS Pages: 1 -->
-<svg width="234pt" height="27pt"
- viewBox="0.00 0.00 233.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>dynamic_programming::LIS</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Calculate the longest increasing subsequence for the specified numbers.">
-<polygon fill="#999999" stroke="#666666" points="135.25,-19.25 0,-19.25 0,0 135.25,0 135.25,-19.25"/>
-<text text-anchor="middle" x="67.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming::LIS</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="225.5,-19.25 171.25,-19.25 171.25,0 225.5,0 225.5,-19.25"/>
-<text text-anchor="middle" x="198.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.64,-9.62C143.82,-9.62 151.94,-9.62 159.48,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.25,-13.13 169.25,-9.63 159.25,-6.13 159.25,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph.map b/dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph.map
deleted file mode 100644
index 1207eadef..000000000
--- a/dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="dynamic_programming::maxCircularSum" name="dynamic_programming::maxCircularSum">
-<area shape="rect" id="Node000001" title="returns the maximum contiguous circular sum of an array" alt="" coords="5,47,158,88"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="227,5,300,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="158,44,211,29,213,34,159,49"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="229,55,298,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="158,65,214,65,214,70,158,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="206,104,321,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="159,86,199,97,198,102,158,91"/>
-</map>
diff --git a/dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph.md5 b/dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph.md5
deleted file mode 100644
index c6f09c941..000000000
--- a/dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-85de9be16b73e8ad71ac29f6c88528d7
\ No newline at end of file
diff --git a/dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph.svg b/dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph.svg
deleted file mode 100644
index f42b6bb2d..000000000
--- a/dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::maxCircularSum Pages: 1 -->
-<svg width="245pt" height="101pt"
- viewBox="0.00 0.00 244.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>dynamic_programming::maxCircularSum</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="returns the maximum contiguous circular sum of an array">
-<polygon fill="#999999" stroke="#666666" points="114.25,-61.88 0,-61.88 0,-31.38 114.25,-31.38 114.25,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="57.12" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::maxCircularSum</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.62,-93.25 166.38,-93.25 166.38,-74 220.62,-74 220.62,-93.25"/>
-<text text-anchor="middle" x="193.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.72,-62.21C128.34,-65.96 142.56,-69.87 155.05,-73.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.95,-76.64 164.52,-75.92 155.81,-69.89 153.95,-76.64"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.12,-56.25 167.88,-56.25 167.88,-37 219.12,-37 219.12,-56.25"/>
-<text text-anchor="middle" x="193.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.72,-46.62C128.78,-46.62 143.47,-46.62 156.26,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.87,-50.13 165.87,-46.63 155.87,-43.13 155.87,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-19.25 150.25,-19.25 150.25,0 236.75,0 236.75,-19.25"/>
-<text text-anchor="middle" x="193.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.72,-31.04C124.72,-28.29 135.05,-25.44 144.77,-22.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.69,-26.14 154.4,-20.11 143.83,-19.4 145.69,-26.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph_org.svg b/dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph_org.svg
deleted file mode 100644
index 65a8420e0..000000000
--- a/dd/d24/namespacedynamic__programming_a5239174fa0d987f2c67edc1f2af82beb_cgraph_org.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::maxCircularSum Pages: 1 -->
-<svg width="245pt" height="101pt"
- viewBox="0.00 0.00 244.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>dynamic_programming::maxCircularSum</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="returns the maximum contiguous circular sum of an array">
-<polygon fill="#999999" stroke="#666666" points="114.25,-61.88 0,-61.88 0,-31.38 114.25,-31.38 114.25,-61.88"/>
-<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="57.12" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::maxCircularSum</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.62,-93.25 166.38,-93.25 166.38,-74 220.62,-74 220.62,-93.25"/>
-<text text-anchor="middle" x="193.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.72,-62.21C128.34,-65.96 142.56,-69.87 155.05,-73.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.95,-76.64 164.52,-75.92 155.81,-69.89 153.95,-76.64"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.12,-56.25 167.88,-56.25 167.88,-37 219.12,-37 219.12,-56.25"/>
-<text text-anchor="middle" x="193.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.72,-46.62C128.78,-46.62 143.47,-46.62 156.26,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.87,-50.13 165.87,-46.63 155.87,-43.13 155.87,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-19.25 150.25,-19.25 150.25,0 236.75,0 236.75,-19.25"/>
-<text text-anchor="middle" x="193.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.72,-31.04C124.72,-28.29 135.05,-25.44 144.77,-22.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.69,-26.14 154.4,-20.11 143.83,-19.4 145.69,-26.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.map b/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.map
deleted file mode 100644
index a749ac46e..000000000
--- a/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="dynamic_programming::is_armstrong" name="dynamic_programming::is_armstrong">
-<area shape="rect" id="Node000001" title="Checks if the given number is armstrong or not." alt="" coords="5,5,158,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="206,13,277,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="158,23,190,23,190,28,158,28"/>
-</map>
diff --git a/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.md5 b/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.md5
deleted file mode 100644
index 471aa875f..000000000
--- a/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7da8fe47c028c03a3dbfaa20072e47d7
\ No newline at end of file
diff --git a/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.svg b/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.svg
deleted file mode 100644
index 9928faf51..000000000
--- a/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::is_armstrong Pages: 1 -->
-<svg width="212pt" height="39pt"
- viewBox="0.00 0.00 211.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>dynamic_programming::is_armstrong</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Checks if the given number is armstrong or not.">
-<polygon fill="#999999" stroke="#666666" points="114.25,-30.5 0,-30.5 0,0 114.25,0 114.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="57.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::is_armstrong</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203.75,-24.88 150.25,-24.88 150.25,-5.63 203.75,-5.63 203.75,-24.88"/>
-<text text-anchor="middle" x="177" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.65,-15.25C122.71,-15.25 130.84,-15.25 138.42,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.28,-18.75 148.28,-15.25 138.28,-11.75 138.28,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph_org.svg b/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph_org.svg
deleted file mode 100644
index cb8af0e4c..000000000
--- a/dd/d24/namespacedynamic__programming_af046365a8d77a1267acc082f86135a26_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::is_armstrong Pages: 1 -->
-<svg width="212pt" height="39pt"
- viewBox="0.00 0.00 211.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>dynamic_programming::is_armstrong</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Checks if the given number is armstrong or not.">
-<polygon fill="#999999" stroke="#666666" points="114.25,-30.5 0,-30.5 0,0 114.25,0 114.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
-<text text-anchor="middle" x="57.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::is_armstrong</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203.75,-24.88 150.25,-24.88 150.25,-5.63 203.75,-5.63 203.75,-24.88"/>
-<text text-anchor="middle" x="177" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.65,-15.25C122.71,-15.25 130.84,-15.25 138.42,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.28,-18.75 148.28,-15.25 138.28,-11.75 138.28,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph.map b/dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph.map
deleted file mode 100644
index f5ba6dd4d..000000000
--- a/dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="dynamic_programming::lps" name="dynamic_programming::lps">
-<area shape="rect" id="Node000001" title="Function that returns the longest palindromic subsequence of a string." alt="" coords="5,5,183,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="231,5,303,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="183,16,215,16,215,21,183,21"/>
-</map>
diff --git a/dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph.md5 b/dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph.md5
deleted file mode 100644
index c9a230de4..000000000
--- a/dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1f4139b93c017d0ebbdfc39bf36938b0
\ No newline at end of file
diff --git a/dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph.svg b/dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph.svg
deleted file mode 100644
index 276816cee..000000000
--- a/dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::lps Pages: 1 -->
-<svg width="231pt" height="27pt"
- viewBox="0.00 0.00 231.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>dynamic_programming::lps</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that returns the longest palindromic subsequence of a string.">
-<polygon fill="#999999" stroke="#666666" points="133,-19.25 0,-19.25 0,0 133,0 133,-19.25"/>
-<text text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming::lps</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.25,-19.25 169,-19.25 169,0 223.25,0 223.25,-19.25"/>
-<text text-anchor="middle" x="196.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.18,-9.62C141.44,-9.62 149.65,-9.62 157.27,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.16,-13.13 167.16,-9.63 157.16,-6.13 157.16,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph_org.svg b/dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph_org.svg
deleted file mode 100644
index bac756bbf..000000000
--- a/dd/d24/namespacedynamic__programming_afe9f45b6e30ee187509da2d1d0093412_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: dynamic_programming::lps Pages: 1 -->
-<svg width="231pt" height="27pt"
- viewBox="0.00 0.00 231.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>dynamic_programming::lps</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that returns the longest palindromic subsequence of a string.">
-<polygon fill="#999999" stroke="#666666" points="133,-19.25 0,-19.25 0,0 133,0 133,-19.25"/>
-<text text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming::lps</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.25,-19.25 169,-19.25 169,0 223.25,0 223.25,-19.25"/>
-<text text-anchor="middle" x="196.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.18,-9.62C141.44,-9.62 149.65,-9.62 157.27,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.16,-13.13 167.16,-9.63 157.16,-6.13 157.16,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d29/false__position_8cpp.html b/dd/d29/false__position_8cpp.html
index 7fd40b515..077ec633e 100644
--- a/dd/d29/false__position_8cpp.html
+++ b/dd/d29/false__position_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/false_position.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/false_position.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for false_position.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/de2/false__position_8cpp__incl.svg" width="178" height="126"><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">
+</div>
+<p><a href="../../dd/d29/false__position_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr>
@@ -158,6 +177,8 @@ x_{i+1} = \frac{a_i\cdot f(b_i) - b_i\cdot f(a_i)}{f(b_i) - f(a_i)}
 <dl class="section author"><dt>Author</dt><dd>Unknown author </dd>
 <dd>
 <a href="https://github.com/sampatil578" target="_blank">Samruddha Patil</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../dd/d29/false__position_8cpp_source.html">false_position.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a85a6ec58b5064d63d4f0df3854496713" name="a85a6ec58b5064d63d4f0df3854496713"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a85a6ec58b5064d63d4f0df3854496713">&#9670;&#160;</a></span>eq()</h2>
@@ -190,15 +211,12 @@ x_{i+1} = \frac{a_i\cdot f(b_i) - b_i\cdot f(a_i)}{f(b_i) - f(a_i)}
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>value of f(x) for given x. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d29/false__position_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../dd/d29/false__position_8cpp_source.html">false_position.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   44</span>                         {</div>
 <div class="line"><span class="lineno">   45</span>    <span class="keywordflow">return</span> (x * x - x);  <span class="comment">// original equation</span></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">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d29/false__position_8cpp_a85a6ec58b5064d63d4f0df3854496713_cgraph.svg" width="154" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -218,6 +236,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d29/false__position_8cpp_source.html#l00102">102</a> of file <a class="el" href="../../dd/d29/false__position_8cpp_source.html">false_position.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  102</span>           {</div>
 <div class="line"><span class="lineno">  103</span>    <span class="keywordtype">float</span> a = 0, b = 0, i = 0, root = 0;</div>
 <div class="line"><span class="lineno">  104</span>    int16_t count = 0;</div>
@@ -245,9 +265,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  126</span>    }</div>
 <div class="line"><span class="lineno">  127</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  128</span>}</div>
-<div class="ttc" id="afalse__position_8cpp_html_a7d69b49dc37da1c02b3ab8c7fe783494"><div class="ttname"><a href="#a7d69b49dc37da1c02b3ab8c7fe783494">numerical_methods::false_position::regula_falsi</a></div><div class="ttdeci">static float regula_falsi(float x1, float x2, float y1, float y2)</div><div class="ttdoc">This function finds root of the equation in given interval i.e. (x1,x2).</div><div class="ttdef"><b>Definition</b> false_position.cpp:55</div></div>
-<div class="ttc" id="afalse__position_8cpp_html_a85a6ec58b5064d63d4f0df3854496713"><div class="ttname"><a href="#a85a6ec58b5064d63d4f0df3854496713">numerical_methods::false_position::eq</a></div><div class="ttdeci">static float eq(float x)</div><div class="ttdoc">This function gives the value of f(x) for given x.</div><div class="ttdef"><b>Definition</b> false_position.cpp:44</div></div>
-<div class="ttc" id="afalse__position_8cpp_html_a85cb7bfb90abc898e042d624372c5345"><div class="ttname"><a href="#a85cb7bfb90abc898e042d624372c5345">numerical_methods::false_position::printRoot</a></div><div class="ttdeci">void printRoot(float root, const int16_t &amp;count)</div><div class="ttdoc">This function prints roots of the equation.</div><div class="ttdef"><b>Definition</b> false_position.cpp:84</div></div>
+<div class="ttc" id="afalse__position_8cpp_html_a7d69b49dc37da1c02b3ab8c7fe783494"><div class="ttname"><a href="#a7d69b49dc37da1c02b3ab8c7fe783494">numerical_methods::false_position::regula_falsi</a></div><div class="ttdeci">static float regula_falsi(float x1, float x2, float y1, float y2)</div><div class="ttdoc">This function finds root of the equation in given interval i.e. (x1,x2).</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d29/false__position_8cpp_source.html#l00055">false_position.cpp:55</a></div></div>
+<div class="ttc" id="afalse__position_8cpp_html_a85a6ec58b5064d63d4f0df3854496713"><div class="ttname"><a href="#a85a6ec58b5064d63d4f0df3854496713">numerical_methods::false_position::eq</a></div><div class="ttdeci">static float eq(float x)</div><div class="ttdoc">This function gives the value of f(x) for given x.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d29/false__position_8cpp_source.html#l00044">false_position.cpp:44</a></div></div>
+<div class="ttc" id="afalse__position_8cpp_html_a85cb7bfb90abc898e042d624372c5345"><div class="ttname"><a href="#a85cb7bfb90abc898e042d624372c5345">numerical_methods::false_position::printRoot</a></div><div class="ttdeci">void printRoot(float root, const int16_t &amp;count)</div><div class="ttdoc">This function prints roots of the equation.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d29/false__position_8cpp_source.html#l00084">false_position.cpp:84</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -278,25 +298,20 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d29/false__position_8cpp_source.html#l00084">84</a> of file <a class="el" href="../../dd/d29/false__position_8cpp_source.html">false_position.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   84</span>                                                 {</div>
 <div class="line"><span class="lineno">   85</span>    <span class="keywordflow">if</span> (count == 1) {</div>
-<div class="line"><span class="lineno">   86</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Your 1st root is : &quot;</span> &lt;&lt; root &lt;&lt; <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">   86</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Your 1st root is : &quot;</span> &lt;&lt; root &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   87</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (count == 2) {</div>
-<div class="line"><span class="lineno">   88</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Your 2nd root is : &quot;</span> &lt;&lt; root &lt;&lt; <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">   88</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Your 2nd root is : &quot;</span> &lt;&lt; root &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   89</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (count == 3) {</div>
-<div class="line"><span class="lineno">   90</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Your 3rd root is : &quot;</span> &lt;&lt; root &lt;&lt; <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">   90</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Your 3rd root is : &quot;</span> &lt;&lt; root &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   91</span>    } <span class="keywordflow">else</span> {</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> &lt;&lt; <span class="stringliteral">&quot;Your &quot;</span> &lt;&lt; count &lt;&lt; <span class="stringliteral">&quot;th root is : &quot;</span> &lt;&lt; root &lt;&lt; <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">   92</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Your &quot;</span> &lt;&lt; count &lt;&lt; <span class="stringliteral">&quot;th root is : &quot;</span> &lt;&lt; root &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   93</span>    }</div>
 <div class="line"><span class="lineno">   94</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="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><!-- 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="../../dd/d29/false__position_8cpp_a85cb7bfb90abc898e042d624372c5345_cgraph.svg" width="292" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7d69b49dc37da1c02b3ab8c7fe783494" name="a7d69b49dc37da1c02b3ab8c7fe783494"></a>
@@ -345,6 +360,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>root of the equation in the given interval. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d29/false__position_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../dd/d29/false__position_8cpp_source.html">false_position.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   55</span>                                                                  {</div>
 <div class="line"><span class="lineno">   56</span>    <span class="keywordtype">float</span> diff = x1 - x2;</div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordflow">if</span> (diff &lt; 0) {</div>
@@ -368,13 +385,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   75</span>    y3 = <a class="code hl_function" href="../../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d">eq</a>(x3);</div>
 <div class="line"><span class="lineno">   76</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="#a7d69b49dc37da1c02b3ab8c7fe783494">regula_falsi</a>(x2, x3, y2, y3);</div>
 <div class="line"><span class="lineno">   77</span>}</div>
-<div class="ttc" id="abisection__method_8cpp_html_a2003b5b2dcfff0769b957ab5c968b03d"><div class="ttname"><a href="../../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d">eq</a></div><div class="ttdeci">static double eq(double i)</div><div class="ttdef"><b>Definition</b> bisection_method.cpp:26</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d29/false__position_8cpp_a7d69b49dc37da1c02b3ab8c7fe783494_cgraph.svg" width="376" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="abisection__method_8cpp_html_a2003b5b2dcfff0769b957ab5c968b03d"><div class="ttname"><a href="../../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d">eq</a></div><div class="ttdeci">static double eq(double i)</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d6a/bisection__method_8cpp_source.html#l00026">bisection_method.cpp:26</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dd/d29/false__position_8cpp_a7d69b49dc37da1c02b3ab8c7fe783494_cgraph.map b/dd/d29/false__position_8cpp_a7d69b49dc37da1c02b3ab8c7fe783494_cgraph.map
deleted file mode 100644
index ec81c5643..000000000
--- a/dd/d29/false__position_8cpp_a7d69b49dc37da1c02b3ab8c7fe783494_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="numerical_methods::false_position::regula_falsi" name="numerical_methods::false_position::regula_falsi">
-<area shape="rect" id="Node000001" title="This function finds root of the equation in given interval i.e. (x1,x2)." alt="" coords="5,29,181,70"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="54,29,52,19,58,10,72,5,93,3,115,5,129,11,127,16,114,10,93,8,73,10,62,15,57,20,59,28"/>
-<area shape="rect" id="Node000002" href="$dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713" title="This function gives the value of f(x) for given x." alt="" coords="229,29,371,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="181,47,213,47,213,52,181,52"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="261,29,259,19,265,10,279,5,300,3,322,5,336,11,333,16,321,10,300,8,280,10,268,15,264,20,266,28"/>
-</map>
diff --git a/dd/d29/false__position_8cpp_a7d69b49dc37da1c02b3ab8c7fe783494_cgraph.md5 b/dd/d29/false__position_8cpp_a7d69b49dc37da1c02b3ab8c7fe783494_cgraph.md5
deleted file mode 100644
index ff252ddc8..000000000
--- a/dd/d29/false__position_8cpp_a7d69b49dc37da1c02b3ab8c7fe783494_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f8903bb8122e22d4b11f5bd7640600d2
\ No newline at end of file
diff --git a/dd/d29/false__position_8cpp_a7d69b49dc37da1c02b3ab8c7fe783494_cgraph.svg b/dd/d29/false__position_8cpp_a7d69b49dc37da1c02b3ab8c7fe783494_cgraph.svg
deleted file mode 100644
index d8f7d702e..000000000
--- a/dd/d29/false__position_8cpp_a7d69b49dc37da1c02b3ab8c7fe783494_cgraph.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::false_position::regula_falsi Pages: 1 -->
-<svg width="282pt" height="57pt"
- viewBox="0.00 0.00 282.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>numerical_methods::false_position::regula_falsi</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function finds root of the equation in given interval i.e. (x1,x2).">
-<polygon fill="#999999" stroke="#666666" points="131.5,-30.5 0,-30.5 0,0 131.5,0 131.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="65.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">false_position::regula_falsi</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.26,-30.99C32.65,-40.06 41.81,-48.5 65.75,-48.5 78.84,-48.5 87.51,-45.97 91.76,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.21,-42.86 93.04,-32.49 88.27,-41.95 95.21,-42.86"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713" target="_top" xlink:title="This function gives the value of f(x) for given x.">
-<polygon fill="white" stroke="#666666" points="274.25,-30.5 167.5,-30.5 167.5,0 274.25,0 274.25,-30.5"/>
-<text text-anchor="start" x="175.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="220.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">false_position::eq</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.69,-15.25C139.78,-15.25 148.04,-15.25 156.11,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.84,-18.75 165.84,-15.25 155.84,-11.75 155.84,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.39,-30.99C187.78,-40.06 196.94,-48.5 220.88,-48.5 233.96,-48.5 242.64,-45.97 246.89,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="250.33,-42.86 248.17,-32.49 243.39,-41.95 250.33,-42.86"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d29/false__position_8cpp_a7d69b49dc37da1c02b3ab8c7fe783494_cgraph_org.svg b/dd/d29/false__position_8cpp_a7d69b49dc37da1c02b3ab8c7fe783494_cgraph_org.svg
deleted file mode 100644
index 1e22d177f..000000000
--- a/dd/d29/false__position_8cpp_a7d69b49dc37da1c02b3ab8c7fe783494_cgraph_org.svg
+++ /dev/null
@@ -1,59 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::false_position::regula_falsi Pages: 1 -->
-<svg width="282pt" height="57pt"
- viewBox="0.00 0.00 282.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>numerical_methods::false_position::regula_falsi</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function finds root of the equation in given interval i.e. (x1,x2).">
-<polygon fill="#999999" stroke="#666666" points="131.5,-30.5 0,-30.5 0,0 131.5,0 131.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="65.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">false_position::regula_falsi</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.26,-30.99C32.65,-40.06 41.81,-48.5 65.75,-48.5 78.84,-48.5 87.51,-45.97 91.76,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.21,-42.86 93.04,-32.49 88.27,-41.95 95.21,-42.86"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713" target="_top" xlink:title="This function gives the value of f(x) for given x.">
-<polygon fill="white" stroke="#666666" points="274.25,-30.5 167.5,-30.5 167.5,0 274.25,0 274.25,-30.5"/>
-<text text-anchor="start" x="175.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="220.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">false_position::eq</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.69,-15.25C139.78,-15.25 148.04,-15.25 156.11,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.84,-18.75 165.84,-15.25 155.84,-11.75 155.84,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.39,-30.99C187.78,-40.06 196.94,-48.5 220.88,-48.5 233.96,-48.5 242.64,-45.97 246.89,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="250.33,-42.86 248.17,-32.49 243.39,-41.95 250.33,-42.86"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d29/false__position_8cpp_a85a6ec58b5064d63d4f0df3854496713_cgraph.map b/dd/d29/false__position_8cpp_a85a6ec58b5064d63d4f0df3854496713_cgraph.map
deleted file mode 100644
index 04df4f813..000000000
--- a/dd/d29/false__position_8cpp_a85a6ec58b5064d63d4f0df3854496713_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="numerical_methods::false_position::eq" name="numerical_methods::false_position::eq">
-<area shape="rect" id="Node000001" title="This function gives the value of f(x) for given x." alt="" coords="5,29,148,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="49,29,47,20,52,11,62,5,77,3,92,5,102,12,99,16,90,10,76,8,63,10,56,14,53,20,54,28"/>
-</map>
diff --git a/dd/d29/false__position_8cpp_a85a6ec58b5064d63d4f0df3854496713_cgraph.md5 b/dd/d29/false__position_8cpp_a85a6ec58b5064d63d4f0df3854496713_cgraph.md5
deleted file mode 100644
index c89caf8f1..000000000
--- a/dd/d29/false__position_8cpp_a85a6ec58b5064d63d4f0df3854496713_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-daf0f310137fb00bb5896684749b7198
\ No newline at end of file
diff --git a/dd/d29/false__position_8cpp_a85a6ec58b5064d63d4f0df3854496713_cgraph.svg b/dd/d29/false__position_8cpp_a85a6ec58b5064d63d4f0df3854496713_cgraph.svg
deleted file mode 100644
index 172b5c427..000000000
--- a/dd/d29/false__position_8cpp_a85a6ec58b5064d63d4f0df3854496713_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::false_position::eq Pages: 1 -->
-<svg width="115pt" height="57pt"
- viewBox="0.00 0.00 114.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>numerical_methods::false_position::eq</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function gives the value of f(x) for given x.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-30.5 0,-30.5 0,0 106.75,0 106.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">false_position::eq</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.46,-30.99C30.6,-40.06 36.9,-48.5 53.38,-48.5 62.38,-48.5 68.35,-45.97 71.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.74,-42.77 72.15,-32.49 67.77,-42.14 74.74,-42.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d29/false__position_8cpp_a85a6ec58b5064d63d4f0df3854496713_cgraph_org.svg b/dd/d29/false__position_8cpp_a85a6ec58b5064d63d4f0df3854496713_cgraph_org.svg
deleted file mode 100644
index c70585212..000000000
--- a/dd/d29/false__position_8cpp_a85a6ec58b5064d63d4f0df3854496713_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::false_position::eq Pages: 1 -->
-<svg width="115pt" height="57pt"
- viewBox="0.00 0.00 114.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>numerical_methods::false_position::eq</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function gives the value of f(x) for given x.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-30.5 0,-30.5 0,0 106.75,0 106.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">false_position::eq</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.46,-30.99C30.6,-40.06 36.9,-48.5 53.38,-48.5 62.38,-48.5 68.35,-45.97 71.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.74,-42.77 72.15,-32.49 67.77,-42.14 74.74,-42.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d29/false__position_8cpp_a85cb7bfb90abc898e042d624372c5345_cgraph.map b/dd/d29/false__position_8cpp_a85cb7bfb90abc898e042d624372c5345_cgraph.map
deleted file mode 100644
index 46868ad1b..000000000
--- a/dd/d29/false__position_8cpp_a85cb7bfb90abc898e042d624372c5345_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="numerical_methods::false_position::printRoot" name="numerical_methods::false_position::printRoot">
-<area shape="rect" id="Node000001" title="This function prints roots of the equation." alt="" coords="5,29,168,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="55,29,53,19,58,11,70,5,87,3,105,5,115,11,113,16,103,10,86,8,71,10,62,14,58,20,60,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="216,37,287,62"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="168,47,200,47,200,52,168,52"/>
-</map>
diff --git a/dd/d29/false__position_8cpp_a85cb7bfb90abc898e042d624372c5345_cgraph.md5 b/dd/d29/false__position_8cpp_a85cb7bfb90abc898e042d624372c5345_cgraph.md5
deleted file mode 100644
index da28071d6..000000000
--- a/dd/d29/false__position_8cpp_a85cb7bfb90abc898e042d624372c5345_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-65b3cf4604fd9d2484d9f6b1fa655b52
\ No newline at end of file
diff --git a/dd/d29/false__position_8cpp_a85cb7bfb90abc898e042d624372c5345_cgraph.svg b/dd/d29/false__position_8cpp_a85cb7bfb90abc898e042d624372c5345_cgraph.svg
deleted file mode 100644
index 97ffd30b7..000000000
--- a/dd/d29/false__position_8cpp_a85cb7bfb90abc898e042d624372c5345_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::false_position::printRoot Pages: 1 -->
-<svg width="219pt" height="57pt"
- viewBox="0.00 0.00 219.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>numerical_methods::false_position::printRoot</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function prints roots of the equation.">
-<polygon fill="#999999" stroke="#666666" points="121.75,-30.5 0,-30.5 0,0 121.75,0 121.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="60.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">false_position::printRoot</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.97,-30.99C34.5,-40.06 41.8,-48.5 60.88,-48.5 71.31,-48.5 78.22,-45.97 81.61,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.06,-42.8 82.62,-32.49 78.1,-42.07 85.06,-42.8"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="211.25,-24.88 157.75,-24.88 157.75,-5.63 211.25,-5.63 211.25,-24.88"/>
-<text text-anchor="middle" x="184.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.97,-15.25C130.14,-15.25 138.33,-15.25 145.94,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.84,-18.75 155.84,-15.25 145.84,-11.75 145.84,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d29/false__position_8cpp_a85cb7bfb90abc898e042d624372c5345_cgraph_org.svg b/dd/d29/false__position_8cpp_a85cb7bfb90abc898e042d624372c5345_cgraph_org.svg
deleted file mode 100644
index 2018212c8..000000000
--- a/dd/d29/false__position_8cpp_a85cb7bfb90abc898e042d624372c5345_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::false_position::printRoot Pages: 1 -->
-<svg width="219pt" height="57pt"
- viewBox="0.00 0.00 219.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>numerical_methods::false_position::printRoot</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function prints roots of the equation.">
-<polygon fill="#999999" stroke="#666666" points="121.75,-30.5 0,-30.5 0,0 121.75,0 121.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="60.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">false_position::printRoot</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.97,-30.99C34.5,-40.06 41.8,-48.5 60.88,-48.5 71.31,-48.5 78.22,-45.97 81.61,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.06,-42.8 82.62,-32.49 78.1,-42.07 85.06,-42.8"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="211.25,-24.88 157.75,-24.88 157.75,-5.63 211.25,-5.63 211.25,-24.88"/>
-<text text-anchor="middle" x="184.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.97,-15.25C130.14,-15.25 138.33,-15.25 145.94,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.84,-18.75 155.84,-15.25 145.84,-11.75 145.84,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d29/false__position_8cpp_source.html b/dd/d29/false__position_8cpp_source.html
new file mode 100644
index 000000000..6b8a4f576
--- /dev/null
+++ b/dd/d29/false__position_8cpp_source.html
@@ -0,0 +1,226 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/false_position.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dd/d29/false__position_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">false_position.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dd/d29/false__position_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;cmath&gt;</span>     </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a> {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/dea/namespacefalse__position.html">false_position</a> {</div>
+<div class="foldopen" id="foldopen00044" data-start="{" data-end="}">
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="../../dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713">   44</a></span><span class="keyword">static</span> <span class="keywordtype">float</span> <a class="code hl_function" href="../../dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713">eq</a>(<span class="keywordtype">float</span> x) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordflow">return</span> (x * x - x);  <span class="comment">// original equation</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>}</div>
+</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="foldopen" id="foldopen00055" data-start="{" data-end="}">
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../dd/d29/false__position_8cpp.html#a7d69b49dc37da1c02b3ab8c7fe783494">   55</a></span><span class="keyword">static</span> <span class="keywordtype">float</span> <a class="code hl_function" href="../../dd/d29/false__position_8cpp.html#a7d69b49dc37da1c02b3ab8c7fe783494">regula_falsi</a>(<span class="keywordtype">float</span> x1, <span class="keywordtype">float</span> x2, <span class="keywordtype">float</span> y1, <span class="keywordtype">float</span> y2) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordtype">float</span> diff = x1 - x2;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">if</span> (diff &lt; 0) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        diff = (-1) * diff;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    }</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">if</span> (diff &lt; 0.00001) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="keywordflow">if</span> (y1 &lt; 0) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            y1 = -y1;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        <span class="keywordflow">if</span> (y2 &lt; 0) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            y2 = -y2;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <span class="keywordflow">if</span> (y1 &lt; y2) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            <span class="keywordflow">return</span> x1;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            <span class="keywordflow">return</span> x2;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    }</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordtype">float</span> x3 = 0, y3 = 0;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    x3 = x1 - (x1 - x2) * (y1) / (y1 - y2);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    y3 = <a class="code hl_function" href="../../dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713">eq</a>(x3);</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../dd/d29/false__position_8cpp.html#a7d69b49dc37da1c02b3ab8c7fe783494">regula_falsi</a>(x2, x3, y2, y3);</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>}</div>
+</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="foldopen" id="foldopen00084" data-start="{" data-end="}">
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"><a class="line" href="../../dd/d29/false__position_8cpp.html#a85cb7bfb90abc898e042d624372c5345">   84</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d29/false__position_8cpp.html#a85cb7bfb90abc898e042d624372c5345">printRoot</a>(<span class="keywordtype">float</span> root, <span class="keyword">const</span> int16_t &amp;count) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keywordflow">if</span> (count == 1) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Your 1st root is : &quot;</span> &lt;&lt; root &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (count == 2) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Your 2nd root is : &quot;</span> &lt;&lt; root &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (count == 3) {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Your 3rd root is : &quot;</span> &lt;&lt; root &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Your &quot;</span> &lt;&lt; count &lt;&lt; <span class="stringliteral">&quot;th root is : &quot;</span> &lt;&lt; root &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    }</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>}</div>
+</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>}  <span class="comment">// namespace false_position</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>}  <span class="comment">// namespace numerical_methods</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="foldopen" id="foldopen00102" data-start="{" data-end="}">
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"><a class="line" href="../../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  102</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="keywordtype">float</span> a = 0, b = 0, i = 0, root = 0;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    int16_t count = 0;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="keywordtype">float</span> range =</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        100000;       <span class="comment">// Range in which we have to find the root. (-range,range)</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <span class="keywordtype">float</span> gap = 0.5;  <span class="comment">// interval gap. lesser the gap more the accuracy</span></div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    a = numerical_methods::false_position::eq((-1) * range);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    i = ((-1) * range + gap);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="comment">// while loop for selecting proper interval in provided range and with</span></div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <span class="comment">// provided interval gap.</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="keywordflow">while</span> (i &lt;= range) {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        b = numerical_methods::false_position::eq(i);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        <span class="keywordflow">if</span> (b == 0) {</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>            count++;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>            numerical_methods::false_position::printRoot(i, count);</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        }</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        <span class="keywordflow">if</span> (a * b &lt; 0) {</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>            root = numerical_methods::false_position::regula_falsi(i - gap, i,</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>                                                                   a, b);</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>            count++;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>            numerical_methods::false_position::printRoot(root, count);</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        }</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        a = b;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        i += gap;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    }</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>}</div>
+</div>
+<div class="ttc" id="afalse__position_8cpp_html_a7d69b49dc37da1c02b3ab8c7fe783494"><div class="ttname"><a href="../../dd/d29/false__position_8cpp.html#a7d69b49dc37da1c02b3ab8c7fe783494">numerical_methods::false_position::regula_falsi</a></div><div class="ttdeci">static float regula_falsi(float x1, float x2, float y1, float y2)</div><div class="ttdoc">This function finds root of the equation in given interval i.e. (x1,x2).</div><div class="ttdef"><b>Definition</b> <a href="#l00055">false_position.cpp:55</a></div></div>
+<div class="ttc" id="afalse__position_8cpp_html_a85a6ec58b5064d63d4f0df3854496713"><div class="ttname"><a href="../../dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713">numerical_methods::false_position::eq</a></div><div class="ttdeci">static float eq(float x)</div><div class="ttdoc">This function gives the value of f(x) for given x.</div><div class="ttdef"><b>Definition</b> <a href="#l00044">false_position.cpp:44</a></div></div>
+<div class="ttc" id="afalse__position_8cpp_html_a85cb7bfb90abc898e042d624372c5345"><div class="ttname"><a href="../../dd/d29/false__position_8cpp.html#a85cb7bfb90abc898e042d624372c5345">numerical_methods::false_position::printRoot</a></div><div class="ttdeci">void printRoot(float root, const int16_t &amp;count)</div><div class="ttdoc">This function prints roots of the equation.</div><div class="ttdef"><b>Definition</b> <a href="#l00084">false_position.cpp:84</a></div></div>
+<div class="ttc" id="afalse__position_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00102">false_position.cpp:102</a></div></div>
+<div class="ttc" id="anamespacefalse__position_html"><div class="ttname"><a href="../../df/dea/namespacefalse__position.html">false_position</a></div><div class="ttdoc">Functions for [False Position] (https://en.wikipedia.org/wiki/Regula_falsi) method.</div></div>
+<div class="ttc" id="anamespacenumerical__methods_html"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></div><div class="ttdoc">for assert</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../dd/d29/false__position_8cpp.html">false_position.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dd/d2e/namespacedata__structures_1_1treap.html b/dd/d2e/namespacedata__structures_1_1treap.html
index 608224697..427d304df 100644
--- a/dd/d2e/namespacedata__structures_1_1treap.html
+++ b/dd/d2e/namespacedata__structures_1_1treap.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::treap Namespace Reference</title>
+<title>TheAlgorithms/C++: data_structures::treap Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,14 +139,32 @@ Classes</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:ad939ec178d0069aeea14b7d6d7d12099" id="r_ad939ec178d0069aeea14b7d6d7d12099"><td class="memItemLeft" align="right" valign="top"><a id="ad939ec178d0069aeea14b7d6d7d12099" name="ad939ec178d0069aeea14b7d6d7d12099"></a>
-const int&#160;</td><td class="memItemRight" valign="bottom"><b>maxNode</b> = 1e5 + 5</td></tr>
-<tr class="memdesc:ad939ec178d0069aeea14b7d6d7d12099"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum number of nodes <br /></td></tr>
+<tr class="memitem:ad939ec178d0069aeea14b7d6d7d12099" id="r_ad939ec178d0069aeea14b7d6d7d12099"><td class="memItemLeft" align="right" valign="top">const int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad939ec178d0069aeea14b7d6d7d12099">maxNode</a> = 1e5 + 5</td></tr>
+<tr class="memdesc:ad939ec178d0069aeea14b7d6d7d12099"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum number of nodes  <br /></td></tr>
 <tr class="separator:ad939ec178d0069aeea14b7d6d7d12099"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Functions for the <a href="https://en.wikipedia.org/wiki/Treap" target="_blank">Treap</a> algorithm implementation. </p>
-</div></div><!-- contents -->
+</div><h2 class="groupheader">Variable Documentation</h2>
+<a id="ad939ec178d0069aeea14b7d6d7d12099" name="ad939ec178d0069aeea14b7d6d7d12099"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ad939ec178d0069aeea14b7d6d7d12099">&#9670;&#160;</a></span>maxNode</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">const int data_structures::treap::maxNode = 1e5 + 5</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>maximum number of nodes </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
+
+</div>
+</div>
+</div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
diff --git a/dd/d2f/class_trie.html b/dd/d2f/class_trie.html
index 4454ab148..833d114dc 100644
--- a/dd/d2f/class_trie.html
+++ b/dd/d2f/class_trie.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Trie Class Reference</title>
+<title>TheAlgorithms/C++: Trie Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -131,37 +148,37 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:a6af57e9f25d0d0a2d59eea5a4a802908" id="r_a6af57e9f25d0d0a2d59eea5a4a802908"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6af57e9f25d0d0a2d59eea5a4a802908">Trie</a> ()</td></tr>
 <tr class="memdesc:a6af57e9f25d0d0a2d59eea5a4a802908"><td class="mdescLeft">&#160;</td><td class="mdescRight">constructor to initialise the root of the trie.  <br /></td></tr>
 <tr class="separator:a6af57e9f25d0d0a2d59eea5a4a802908"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:afd8b79959009b554e98ea7128b2886f2" id="r_afd8b79959009b554e98ea7128b2886f2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afd8b79959009b554e98ea7128b2886f2">insert</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;word)</td></tr>
+<tr class="memitem:afd8b79959009b554e98ea7128b2886f2" id="r_afd8b79959009b554e98ea7128b2886f2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afd8b79959009b554e98ea7128b2886f2">insert</a> (const std::string &amp;word)</td></tr>
 <tr class="separator:afd8b79959009b554e98ea7128b2886f2"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a411e77126930a0942dd7b65e96b15206" id="r_a411e77126930a0942dd7b65e96b15206"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a411e77126930a0942dd7b65e96b15206">search</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;word)</td></tr>
+<tr class="memitem:a411e77126930a0942dd7b65e96b15206" id="r_a411e77126930a0942dd7b65e96b15206"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a411e77126930a0942dd7b65e96b15206">search</a> (const std::string &amp;word)</td></tr>
 <tr class="separator:a411e77126930a0942dd7b65e96b15206"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a734a08b52b8ad73bdd1f36ae8348056e" id="r_a734a08b52b8ad73bdd1f36ae8348056e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a734a08b52b8ad73bdd1f36ae8348056e">removeWord</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;word)</td></tr>
+<tr class="memitem:a734a08b52b8ad73bdd1f36ae8348056e" id="r_a734a08b52b8ad73bdd1f36ae8348056e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a734a08b52b8ad73bdd1f36ae8348056e">removeWord</a> (const std::string &amp;word)</td></tr>
 <tr class="separator:a734a08b52b8ad73bdd1f36ae8348056e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
 Private Member Functions</h2></td></tr>
-<tr class="memitem:a26941759ecf94d67a27d4a610bc0f63d" id="r_a26941759ecf94d67a27d4a610bc0f63d"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a26941759ecf94d67a27d4a610bc0f63d">removeWordHelper</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;word, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a> &gt; curr, size_t index)</td></tr>
+<tr class="memitem:a26941759ecf94d67a27d4a610bc0f63d" id="r_a26941759ecf94d67a27d4a610bc0f63d"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a26941759ecf94d67a27d4a610bc0f63d">removeWordHelper</a> (const std::string &amp;word, std::shared_ptr&lt; <a class="el" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a> &gt; curr, size_t index)</td></tr>
 <tr class="separator:a26941759ecf94d67a27d4a610bc0f63d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-static-methods" name="pri-static-methods"></a>
 Static Private Member Functions</h2></td></tr>
-<tr class="memitem:a6d10eb1669453395d1900ebd401954fb" id="r_a6d10eb1669453395d1900ebd401954fb"><td class="memItemLeft" align="right" valign="top">static bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6d10eb1669453395d1900ebd401954fb">hasChildren</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a> &gt; <a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
+<tr class="memitem:a6d10eb1669453395d1900ebd401954fb" id="r_a6d10eb1669453395d1900ebd401954fb"><td class="memItemLeft" align="right" valign="top">static bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6d10eb1669453395d1900ebd401954fb">hasChildren</a> (std::shared_ptr&lt; <a class="el" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a> &gt; <a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
 <tr class="separator:a6d10eb1669453395d1900ebd401954fb"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a58b359fad33ca0064bd75a0d41a7b66d" id="r_a58b359fad33ca0064bd75a0d41a7b66d"><td class="memItemLeft" align="right" valign="top"><a id="a58b359fad33ca0064bd75a0d41a7b66d" name="a58b359fad33ca0064bd75a0d41a7b66d"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>m_root</b></td></tr>
+<tr class="memitem:a58b359fad33ca0064bd75a0d41a7b66d" id="r_a58b359fad33ca0064bd75a0d41a7b66d"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a58b359fad33ca0064bd75a0d41a7b66d">m_root</a></td></tr>
 <tr class="separator:a58b359fad33ca0064bd75a0d41a7b66d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-static-attribs" name="pri-static-attribs"></a>
 Static Private Attributes</h2></td></tr>
-<tr class="memitem:a7c3ba4caf24378826a789848629177bd" id="r_a7c3ba4caf24378826a789848629177bd"><td class="memItemLeft" align="right" valign="top"><a id="a7c3ba4caf24378826a789848629177bd" name="a7c3ba4caf24378826a789848629177bd"></a>
-static constexpr size_t&#160;</td><td class="memItemRight" valign="bottom"><b>ALPHABETS</b> = 26</td></tr>
+<tr class="memitem:a7c3ba4caf24378826a789848629177bd" id="r_a7c3ba4caf24378826a789848629177bd"><td class="memItemLeft" align="right" valign="top">static constexpr size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7c3ba4caf24378826a789848629177bd">ALPHABETS</a> = 26</td></tr>
 <tr class="separator:a7c3ba4caf24378826a789848629177bd"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A basic implementation of trie class to store only lower-case strings. You can extend the implementation to all the ASCII characters by changing the value of @ ALPHABETS to 128. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html#l00016">16</a> of file <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html">trie_modern.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a6af57e9f25d0d0a2d59eea5a4a802908" name="a6af57e9f25d0d0a2d59eea5a4a802908"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a6af57e9f25d0d0a2d59eea5a4a802908">&#9670;&#160;</a></span>Trie()</h2>
@@ -187,8 +204,9 @@ static constexpr size_t&#160;</td><td class="memItemRight" valign="bottom"><b>AL
 </div><div class="memdoc">
 
 <p>constructor to initialise the root of the trie. </p>
-<div class="fragment"><div class="line"><span class="lineno">  103</span>: m_root(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;TrieNode&gt;</a>()) {}</div>
-<div class="ttc" id="amake_shared_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared</a></div><div class="ttdeci">T make_shared(T... args)</div></div>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html#l00103">103</a> of file <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html">trie_modern.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  103</span>: m_root(std::make_shared&lt;TrieNode&gt;()) {}</div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -205,7 +223,7 @@ static constexpr size_t&#160;</td><td class="memItemRight" valign="bottom"><b>AL
         <tr>
           <td class="memname">static bool Trie::hasChildren </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a> &gt;</td>          <td class="paramname"><span class="paramname"><em>node</em></span></td><td>)</td>
+          <td class="paramtype">std::shared_ptr&lt; <a class="el" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a> &gt;</td>          <td class="paramname"><span class="paramname"><em>node</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -224,6 +242,8 @@ static constexpr size_t&#160;</td><td class="memItemRight" valign="bottom"><b>AL
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if a child is found </dd>
 <dd>
 <code>false</code> if a child is not found </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html">trie_modern.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   41</span>                                                                 {</div>
 <div class="line"><span class="lineno">   42</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; ALPHABETS; i++) {</div>
 <div class="line"><span class="lineno">   43</span>            <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;character[i]) {</div>
@@ -232,7 +252,7 @@ static constexpr size_t&#160;</td><td class="memItemRight" valign="bottom"><b>AL
 <div class="line"><span class="lineno">   46</span>        }</div>
 <div class="line"><span class="lineno">   47</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   48</span>    }</div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -248,7 +268,7 @@ static constexpr size_t&#160;</td><td class="memItemRight" valign="bottom"><b>AL
         <tr>
           <td class="memname">void Trie::insert </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>word</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>word</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -264,6 +284,8 @@ static constexpr size_t&#160;</td><td class="memItemRight" valign="bottom"><b>AL
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html#l00109">109</a> of file <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html">trie_modern.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  109</span>                                       {</div>
 <div class="line"><span class="lineno">  110</span>        <span class="keyword">auto</span> curr = m_root;</div>
 <div class="line"><span class="lineno">  111</span>        <span class="keywordflow">for</span> (<span class="keywordtype">char</span> ch : word) {</div>
@@ -272,19 +294,14 @@ static constexpr size_t&#160;</td><td class="memItemRight" valign="bottom"><b>AL
 <div class="line"><span class="lineno">  114</span>            <span class="comment">// if a node for current word is not already present in trie, create</span></div>
 <div class="line"><span class="lineno">  115</span>            <span class="comment">// a new node for it.</span></div>
 <div class="line"><span class="lineno">  116</span>            <span class="keywordflow">if</span> (!curr-&gt;character[index]) {</div>
-<div class="line"><span class="lineno">  117</span>                curr-&gt;character[index] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;TrieNode&gt;</a>();</div>
+<div class="line"><span class="lineno">  117</span>                curr-&gt;character[index] = std::make_shared&lt;TrieNode&gt;();</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>            curr = curr-&gt;character[index];</div>
 <div class="line"><span class="lineno">  121</span>        }</div>
 <div class="line"><span class="lineno">  122</span>        curr-&gt;isEndOfWord = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  123</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d2f/class_trie_afd8b79959009b554e98ea7128b2886f2_cgraph.svg" width="268" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a734a08b52b8ad73bdd1f36ae8348056e" name="a734a08b52b8ad73bdd1f36ae8348056e"></a>
@@ -299,7 +316,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void Trie::removeWord </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>word</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>word</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -309,10 +326,12 @@ Here is the call graph for this function:</div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html#l00148">148</a> of file <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html">trie_modern.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  148</span>                                           {</div>
 <div class="line"><span class="lineno">  149</span>        m_root = <a class="code hl_function" href="#a26941759ecf94d67a27d4a610bc0f63d">removeWordHelper</a>(word, m_root, 0);</div>
 <div class="line"><span class="lineno">  150</span>    }</div>
-<div class="ttc" id="aclass_trie_html_a26941759ecf94d67a27d4a610bc0f63d"><div class="ttname"><a href="#a26941759ecf94d67a27d4a610bc0f63d">Trie::removeWordHelper</a></div><div class="ttdeci">std::shared_ptr&lt; TrieNode &gt; removeWordHelper(const std::string &amp;word, std::shared_ptr&lt; TrieNode &gt; curr, size_t index)</div><div class="ttdef"><b>Definition</b> trie_modern.cpp:64</div></div>
+<div class="ttc" id="aclass_trie_html_a26941759ecf94d67a27d4a610bc0f63d"><div class="ttname"><a href="#a26941759ecf94d67a27d4a610bc0f63d">Trie::removeWordHelper</a></div><div class="ttdeci">std::shared_ptr&lt; TrieNode &gt; removeWordHelper(const std::string &amp;word, std::shared_ptr&lt; TrieNode &gt; curr, size_t index)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d93/trie__modern_8cpp_source.html#l00064">trie_modern.cpp:64</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -326,14 +345,14 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a> &gt; Trie::removeWordHelper </td>
+          <td class="memname">std::shared_ptr&lt; <a class="el" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a> &gt; Trie::removeWordHelper </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>word</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>word</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a> &gt;</td>          <td class="paramname"><span class="paramname"><em>curr</em></span>, </td>
+          <td class="paramtype">std::shared_ptr&lt; <a class="el" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a> &gt;</td>          <td class="paramname"><span class="paramname"><em>curr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -362,8 +381,10 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html">trie_modern.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   66</span>                                                             {</div>
-<div class="line"><span class="lineno">   67</span>        <span class="keywordflow">if</span> (word.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() == index) {</div>
+<div class="line"><span class="lineno">   67</span>        <span class="keywordflow">if</span> (word.size() == index) {</div>
 <div class="line"><span class="lineno">   68</span>            <span class="keywordflow">if</span> (curr-&gt;isEndOfWord) {</div>
 <div class="line"><span class="lineno">   69</span>                curr-&gt;isEndOfWord = <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   70</span>            }</div>
@@ -378,7 +399,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   79</span>        <span class="comment">// Throw a runtime error in case the user enters a word which is not</span></div>
 <div class="line"><span class="lineno">   80</span>        <span class="comment">// present in the trie.</span></div>
 <div class="line"><span class="lineno">   81</span>        <span class="keywordflow">if</span> (!curr-&gt;character[idx]) {</div>
-<div class="line"><span class="lineno">   82</span>            <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/runtime_error.html">std::runtime_error</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>(<span class="stringliteral">&quot;Word not found.&quot;</span>)));</div>
+<div class="line"><span class="lineno">   82</span>            <span class="keywordflow">throw</span> std::runtime_error(std::move(std::string(<span class="stringliteral">&quot;Word not found.&quot;</span>)));</div>
 <div class="line"><span class="lineno">   83</span>        }</div>
 <div class="line"><span class="lineno">   84</span> </div>
 <div class="line"><span class="lineno">   85</span>        curr-&gt;character[idx] =</div>
@@ -396,17 +417,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   97</span>        }</div>
 <div class="line"><span class="lineno">   98</span>        <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">   99</span>    }</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="aclass_trie_html_a6d10eb1669453395d1900ebd401954fb"><div class="ttname"><a href="#a6d10eb1669453395d1900ebd401954fb">Trie::hasChildren</a></div><div class="ttdeci">static bool hasChildren(std::shared_ptr&lt; TrieNode &gt; node)</div><div class="ttdef"><b>Definition</b> trie_modern.cpp:41</div></div>
-<div class="ttc" id="amove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></div><div class="ttdeci">T move(T... args)</div></div>
-<div class="ttc" id="aruntime_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/runtime_error.html">std::runtime_error</a></div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d2f/class_trie_a26941759ecf94d67a27d4a610bc0f63d_cgraph.svg" width="342" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclass_trie_html_a6d10eb1669453395d1900ebd401954fb"><div class="ttname"><a href="#a6d10eb1669453395d1900ebd401954fb">Trie::hasChildren</a></div><div class="ttdeci">static bool hasChildren(std::shared_ptr&lt; TrieNode &gt; node)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d93/trie__modern_8cpp_source.html#l00041">trie_modern.cpp:41</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a411e77126930a0942dd7b65e96b15206" name="a411e77126930a0942dd7b65e96b15206"></a>
@@ -421,7 +433,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool Trie::search </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>word</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>word</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -440,6 +452,8 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>True if the word is found in trie and isEndOfWord is set to true. </dd>
 <dd>
 False if word is not found in trie or isEndOfWord is set to false. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html#l00132">132</a> of file <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html">trie_modern.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  132</span>                                       {</div>
 <div class="line"><span class="lineno">  133</span>        <span class="keyword">auto</span> curr = m_root;</div>
 <div class="line"><span class="lineno">  134</span>        <span class="keywordflow">for</span> (<span class="keywordtype">char</span> ch : word) {</div>
@@ -455,10 +469,59 @@ False if word is not found in trie or isEndOfWord is set to false. </dd></dl>
 <div class="line"><span class="lineno">  144</span>        <span class="keywordflow">return</span> curr-&gt;isEndOfWord;</div>
 <div class="line"><span class="lineno">  145</span>    }</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a7c3ba4caf24378826a789848629177bd" name="a7c3ba4caf24378826a789848629177bd"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a7c3ba4caf24378826a789848629177bd">&#9670;&#160;</a></span>ALPHABETS</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">size_t Trie::ALPHABETS = 26</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">static</span><span class="mlabel">constexpr</span><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html#l00018">18</a> of file <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html">trie_modern.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a58b359fad33ca0064bd75a0d41a7b66d" name="a58b359fad33ca0064bd75a0d41a7b66d"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a58b359fad33ca0064bd75a0d41a7b66d">&#9670;&#160;</a></span>m_root</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::shared_ptr&lt;<a class="el" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a>&gt; Trie::m_root</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html#l00154">154</a> of file <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html">trie_modern.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../dc/d93/trie__modern_8cpp.html">trie_modern.cpp</a></li>
+<li>data_structures/<a class="el" href="../../dc/d93/trie__modern_8cpp_source.html">trie_modern.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dd/d2f/class_trie_a26941759ecf94d67a27d4a610bc0f63d_cgraph.map b/dd/d2f/class_trie_a26941759ecf94d67a27d4a610bc0f63d_cgraph.map
deleted file mode 100644
index 7074e16ab..000000000
--- a/dd/d2f/class_trie_a26941759ecf94d67a27d4a610bc0f63d_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="Trie::removeWordHelper" name="Trie::removeWordHelper">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,168,80"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="55,56,48,46,52,36,65,30,87,28,109,31,121,37,119,42,108,36,86,33,67,35,56,40,54,45,59,53"/>
-<area shape="rect" id="Node000002" href="$dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb" title=" " alt="" coords="216,5,336,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="138,51,208,33,210,38,140,57"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="236,55,316,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="168,65,221,65,221,70,168,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="220,104,332,130"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="140,78,210,97,208,102,138,84"/>
-</map>
diff --git a/dd/d2f/class_trie_a26941759ecf94d67a27d4a610bc0f63d_cgraph.md5 b/dd/d2f/class_trie_a26941759ecf94d67a27d4a610bc0f63d_cgraph.md5
deleted file mode 100644
index 4ef1392c6..000000000
--- a/dd/d2f/class_trie_a26941759ecf94d67a27d4a610bc0f63d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2dfcdc6bedd3fb2f2384526b63c7fd78
\ No newline at end of file
diff --git a/dd/d2f/class_trie_a26941759ecf94d67a27d4a610bc0f63d_cgraph.svg b/dd/d2f/class_trie_a26941759ecf94d67a27d4a610bc0f63d_cgraph.svg
deleted file mode 100644
index 86e6d88fa..000000000
--- a/dd/d2f/class_trie_a26941759ecf94d67a27d4a610bc0f63d_cgraph.svg
+++ /dev/null
@@ -1,110 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Trie::removeWordHelper Pages: 1 -->
-<svg width="256pt" height="101pt"
- viewBox="0.00 0.00 256.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>Trie::removeWordHelper</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="121.75,-56.25 0,-56.25 0,-37 121.75,-37 121.75,-56.25"/>
-<text text-anchor="middle" x="60.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">Trie::removeWordHelper</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.64,-56.54C28.5,-65.15 35.91,-74.25 60.88,-74.25 74.53,-74.25 82.93,-71.53 86.08,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.46,-66.76 83.5,-58 82.7,-68.57 89.46,-66.76"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248,-93.25 157.75,-93.25 157.75,-74 248,-74 248,-93.25"/>
-<text text-anchor="middle" x="202.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">Trie::hasChildren</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.13,-56.74C116.34,-61.02 135.42,-66.06 152.66,-70.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.64,-73.97 162.2,-73.14 153.43,-67.2 151.64,-73.97"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.62,-56.25 173.12,-56.25 173.12,-37 232.62,-37 232.62,-56.25"/>
-<text text-anchor="middle" x="202.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.06,-46.62C135.43,-46.62 149.28,-46.62 161.62,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.41,-50.13 171.41,-46.63 161.41,-43.13 161.41,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="244.62,-19.25 161.12,-19.25 161.12,0 244.62,0 244.62,-19.25"/>
-<text text-anchor="middle" x="202.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.13,-36.51C116.34,-32.23 135.42,-27.19 152.66,-22.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.43,-26.05 162.2,-20.11 151.64,-19.28 153.43,-26.05"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d2f/class_trie_a26941759ecf94d67a27d4a610bc0f63d_cgraph_org.svg b/dd/d2f/class_trie_a26941759ecf94d67a27d4a610bc0f63d_cgraph_org.svg
deleted file mode 100644
index 2f5ec6975..000000000
--- a/dd/d2f/class_trie_a26941759ecf94d67a27d4a610bc0f63d_cgraph_org.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Trie::removeWordHelper Pages: 1 -->
-<svg width="256pt" height="101pt"
- viewBox="0.00 0.00 256.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>Trie::removeWordHelper</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="121.75,-56.25 0,-56.25 0,-37 121.75,-37 121.75,-56.25"/>
-<text text-anchor="middle" x="60.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">Trie::removeWordHelper</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.64,-56.54C28.5,-65.15 35.91,-74.25 60.88,-74.25 74.53,-74.25 82.93,-71.53 86.08,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.46,-66.76 83.5,-58 82.7,-68.57 89.46,-66.76"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248,-93.25 157.75,-93.25 157.75,-74 248,-74 248,-93.25"/>
-<text text-anchor="middle" x="202.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">Trie::hasChildren</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.13,-56.74C116.34,-61.02 135.42,-66.06 152.66,-70.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.64,-73.97 162.2,-73.14 153.43,-67.2 151.64,-73.97"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.62,-56.25 173.12,-56.25 173.12,-37 232.62,-37 232.62,-56.25"/>
-<text text-anchor="middle" x="202.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.06,-46.62C135.43,-46.62 149.28,-46.62 161.62,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.41,-50.13 171.41,-46.63 161.41,-43.13 161.41,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="244.62,-19.25 161.12,-19.25 161.12,0 244.62,0 244.62,-19.25"/>
-<text text-anchor="middle" x="202.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.13,-36.51C116.34,-32.23 135.42,-27.19 152.66,-22.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.43,-26.05 162.2,-20.11 151.64,-19.28 153.43,-26.05"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d2f/class_trie_afd8b79959009b554e98ea7128b2886f2_cgraph.map b/dd/d2f/class_trie_afd8b79959009b554e98ea7128b2886f2_cgraph.map
deleted file mode 100644
index 0fbaf7f7e..000000000
--- a/dd/d2f/class_trie_afd8b79959009b554e98ea7128b2886f2_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="Trie::insert" name="Trie::insert">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,89,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr/make_shared.html#" title=" " alt="" coords="137,5,262,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="89,16,121,16,121,21,89,21"/>
-</map>
diff --git a/dd/d2f/class_trie_afd8b79959009b554e98ea7128b2886f2_cgraph.md5 b/dd/d2f/class_trie_afd8b79959009b554e98ea7128b2886f2_cgraph.md5
deleted file mode 100644
index c992a31c7..000000000
--- a/dd/d2f/class_trie_afd8b79959009b554e98ea7128b2886f2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ddde92be19236f01bbb64a2f62bfb00a
\ No newline at end of file
diff --git a/dd/d2f/class_trie_afd8b79959009b554e98ea7128b2886f2_cgraph.svg b/dd/d2f/class_trie_afd8b79959009b554e98ea7128b2886f2_cgraph.svg
deleted file mode 100644
index 1a8b5c5ed..000000000
--- a/dd/d2f/class_trie_afd8b79959009b554e98ea7128b2886f2_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Trie::insert Pages: 1 -->
-<svg width="201pt" height="27pt"
- viewBox="0.00 0.00 200.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>Trie::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="62.5,-19.25 0,-19.25 0,0 62.5,0 62.5,-19.25"/>
-<text text-anchor="middle" x="31.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Trie::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="192.5,-19.25 98.5,-19.25 98.5,0 192.5,0 192.5,-19.25"/>
-<text text-anchor="middle" x="145.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.92,-9.62C70.42,-9.62 78.69,-9.62 86.99,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.76,-13.13 96.76,-9.63 86.76,-6.13 86.76,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d2f/class_trie_afd8b79959009b554e98ea7128b2886f2_cgraph_org.svg b/dd/d2f/class_trie_afd8b79959009b554e98ea7128b2886f2_cgraph_org.svg
deleted file mode 100644
index c4c0382d7..000000000
--- a/dd/d2f/class_trie_afd8b79959009b554e98ea7128b2886f2_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Trie::insert Pages: 1 -->
-<svg width="201pt" height="27pt"
- viewBox="0.00 0.00 200.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>Trie::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="62.5,-19.25 0,-19.25 0,0 62.5,0 62.5,-19.25"/>
-<text text-anchor="middle" x="31.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Trie::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="192.5,-19.25 98.5,-19.25 98.5,0 192.5,0 192.5,-19.25"/>
-<text text-anchor="middle" x="145.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_shared</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.92,-9.62C70.42,-9.62 78.69,-9.62 86.99,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.76,-13.13 96.76,-9.63 86.76,-6.13 86.76,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d40/classdata__structures_1_1tree__234_1_1_node.html b/dd/d40/classdata__structures_1_1tree__234_1_1_node.html
index a856eeeac..9fe5c2cfd 100644
--- a/dd/d40/classdata__structures_1_1tree__234_1_1_node.html
+++ b/dd/d40/classdata__structures_1_1tree__234_1_1_node.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::tree_234::Node Class Reference</title>
+<title>TheAlgorithms/C++: data_structures::tree_234::Node Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -117,7 +134,7 @@ $(function(){initNavTree('dd/d40/classdata__structures_1_1tree__234_1_1_node.htm
 <div class="dynheader">
 Collaboration diagram for data_structures::tree_234::Node:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.svg" width="190" height="332"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/db5/classdata__structures_1_1tree__234_1_1_node__coll__graph.svg" width="190" height="244"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
@@ -197,21 +214,20 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a8417d01c88b99ca56289843509fb71f9" id="r_a8417d01c88b99ca56289843509fb71f9"><td class="memItemLeft" align="right" valign="top"><a id="a8417d01c88b99ca56289843509fb71f9" name="a8417d01c88b99ca56289843509fb71f9"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int64_t, 3 &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>items</b></td></tr>
-<tr class="memdesc:a8417d01c88b99ca56289843509fb71f9"><td class="mdescLeft">&#160;</td><td class="mdescRight">store items <br /></td></tr>
+<tr class="memitem:a8417d01c88b99ca56289843509fb71f9" id="r_a8417d01c88b99ca56289843509fb71f9"><td class="memItemLeft" align="right" valign="top">std::array&lt; int64_t, 3 &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8417d01c88b99ca56289843509fb71f9">items</a></td></tr>
+<tr class="memdesc:a8417d01c88b99ca56289843509fb71f9"><td class="mdescLeft">&#160;</td><td class="mdescRight">store items  <br /></td></tr>
 <tr class="separator:a8417d01c88b99ca56289843509fb71f9"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad5d6b6ce5fab21ccc88c6bf3153eee5d" id="r_ad5d6b6ce5fab21ccc88c6bf3153eee5d"><td class="memItemLeft" align="right" valign="top"><a id="ad5d6b6ce5fab21ccc88c6bf3153eee5d" name="ad5d6b6ce5fab21ccc88c6bf3153eee5d"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="el" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *, 4 &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>children</b></td></tr>
-<tr class="memdesc:ad5d6b6ce5fab21ccc88c6bf3153eee5d"><td class="mdescLeft">&#160;</td><td class="mdescRight">store the children pointers <br /></td></tr>
+<tr class="memitem:ad5d6b6ce5fab21ccc88c6bf3153eee5d" id="r_ad5d6b6ce5fab21ccc88c6bf3153eee5d"><td class="memItemLeft" align="right" valign="top">std::array&lt; <a class="el" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *, 4 &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a></td></tr>
+<tr class="memdesc:ad5d6b6ce5fab21ccc88c6bf3153eee5d"><td class="mdescLeft">&#160;</td><td class="mdescRight">store the children pointers  <br /></td></tr>
 <tr class="separator:ad5d6b6ce5fab21ccc88c6bf3153eee5d"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a934e6d53cfefae2b971e1241a8a4c921" id="r_a934e6d53cfefae2b971e1241a8a4c921"><td class="memItemLeft" align="right" valign="top"><a id="a934e6d53cfefae2b971e1241a8a4c921" name="a934e6d53cfefae2b971e1241a8a4c921"></a>
-int8_t&#160;</td><td class="memItemRight" valign="bottom"><b>count</b> = 0</td></tr>
-<tr class="memdesc:a934e6d53cfefae2b971e1241a8a4c921"><td class="mdescLeft">&#160;</td><td class="mdescRight">track the current item count <br /></td></tr>
+<tr class="memitem:a934e6d53cfefae2b971e1241a8a4c921" id="r_a934e6d53cfefae2b971e1241a8a4c921"><td class="memItemLeft" align="right" valign="top">int8_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a934e6d53cfefae2b971e1241a8a4c921">count</a> = 0</td></tr>
+<tr class="memdesc:a934e6d53cfefae2b971e1241a8a4c921"><td class="mdescLeft">&#160;</td><td class="mdescRight">track the current item count  <br /></td></tr>
 <tr class="separator:a934e6d53cfefae2b971e1241a8a4c921"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>2-3-4 tree node class </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="ad5219979ea9a8baa3a273a9ec0f0c670" name="ad5219979ea9a8baa3a273a9ec0f0c670"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ad5219979ea9a8baa3a273a9ec0f0c670">&#9670;&#160;</a></span>Node()</h2>
@@ -243,12 +259,14 @@ int8_t&#160;</td><td class="memItemRight" valign="bottom"><b>count</b> = 0</td><
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   42</span>        : <a class="code hl_variable" href="#a934e6d53cfefae2b971e1241a8a4c921">count</a>(1),</div>
 <div class="line"><span class="lineno">   43</span>          <a class="code hl_variable" href="#a8417d01c88b99ca56289843509fb71f9">items</a>({{item, 0, 0}}),</div>
 <div class="line"><span class="lineno">   44</span>          <a class="code hl_variable" href="#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>({{<span class="keyword">nullptr</span>, <span class="keyword">nullptr</span>, <span class="keyword">nullptr</span>, <span class="keyword">nullptr</span>}}) {}</div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a8417d01c88b99ca56289843509fb71f9"><div class="ttname"><a href="#a8417d01c88b99ca56289843509fb71f9">data_structures::tree_234::Node::items</a></div><div class="ttdeci">std::array&lt; int64_t, 3 &gt; items</div><div class="ttdoc">store items</div><div class="ttdef"><b>Definition</b> tree_234.cpp:315</div></div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a934e6d53cfefae2b971e1241a8a4c921"><div class="ttname"><a href="#a934e6d53cfefae2b971e1241a8a4c921">data_structures::tree_234::Node::count</a></div><div class="ttdeci">int8_t count</div><div class="ttdoc">track the current item count</div><div class="ttdef"><b>Definition</b> tree_234.cpp:319</div></div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_ad5d6b6ce5fab21ccc88c6bf3153eee5d"><div class="ttname"><a href="#ad5d6b6ce5fab21ccc88c6bf3153eee5d">data_structures::tree_234::Node::children</a></div><div class="ttdeci">std::array&lt; Node *, 4 &gt; children</div><div class="ttdoc">store the children pointers</div><div class="ttdef"><b>Definition</b> tree_234.cpp:317</div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a8417d01c88b99ca56289843509fb71f9"><div class="ttname"><a href="#a8417d01c88b99ca56289843509fb71f9">data_structures::tree_234::Node::items</a></div><div class="ttdeci">std::array&lt; int64_t, 3 &gt; items</div><div class="ttdoc">store items</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00315">tree_234.cpp:315</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a934e6d53cfefae2b971e1241a8a4c921"><div class="ttname"><a href="#a934e6d53cfefae2b971e1241a8a4c921">data_structures::tree_234::Node::count</a></div><div class="ttdeci">int8_t count</div><div class="ttdoc">track the current item count</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00319">tree_234.cpp:319</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_ad5d6b6ce5fab21ccc88c6bf3153eee5d"><div class="ttname"><a href="#ad5d6b6ce5fab21ccc88c6bf3153eee5d">data_structures::tree_234::Node::children</a></div><div class="ttdeci">std::array&lt; Node *, 4 &gt; children</div><div class="ttdoc">store the children pointers</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00317">tree_234.cpp:317</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -284,6 +302,8 @@ int8_t&#160;</td><td class="memItemRight" valign="bottom"><b>count</b> = 0</td><
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if item in the node, otherwise false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00092">92</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   92</span>                                {</div>
 <div class="line"><span class="lineno">   93</span>        <span class="keywordflow">for</span> (int8_t i = 0; i &lt; <a class="code hl_variable" href="#a934e6d53cfefae2b971e1241a8a4c921">count</a>; i++) {</div>
 <div class="line"><span class="lineno">   94</span>            <span class="keywordflow">if</span> (item == <a class="code hl_variable" href="#a8417d01c88b99ca56289843509fb71f9">items</a>[i]) {</div>
@@ -326,6 +346,8 @@ int8_t&#160;</td><td class="memItemRight" valign="bottom"><b>count</b> = 0</td><
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the child pointer </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00252">252</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  252</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[index]; }</div>
 </div><!-- fragment -->
 </div>
@@ -361,6 +383,8 @@ int8_t&#160;</td><td class="memItemRight" valign="bottom"><b>count</b> = 0</td><
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the index of child </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00237">237</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  237</span>                                      {</div>
 <div class="line"><span class="lineno">  238</span>        <span class="keywordflow">for</span> (int8_t i = 0; i &lt; <a class="code hl_variable" href="#a934e6d53cfefae2b971e1241a8a4c921">count</a> + 1; i++) {</div>
 <div class="line"><span class="lineno">  239</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[i] == child) {</div>
@@ -398,6 +422,8 @@ int8_t&#160;</td><td class="memItemRight" valign="bottom"><b>count</b> = 0</td><
 
 <p>Get the item count that current saved in the node. </p>
 <dl class="section return"><dt>Returns</dt><dd>item count </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00050">50</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   50</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a934e6d53cfefae2b971e1241a8a4c921">count</a>; }</div>
 </div><!-- fragment -->
 </div>
@@ -433,6 +459,8 @@ int8_t&#160;</td><td class="memItemRight" valign="bottom"><b>count</b> = 0</td><
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the item </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00133">133</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  133</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a8417d01c88b99ca56289843509fb71f9">items</a>[index]; }</div>
 </div><!-- fragment -->
 </div>
@@ -468,6 +496,8 @@ int8_t&#160;</td><td class="memItemRight" valign="bottom"><b>count</b> = 0</td><
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>0-based index of the item in the node, if not in the node, -1 is returned </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  107</span>                                      {</div>
 <div class="line"><span class="lineno">  108</span>        <span class="keywordflow">for</span> (int8_t i = 0; i &lt; <a class="code hl_variable" href="#a934e6d53cfefae2b971e1241a8a4c921">count</a>; i++) {</div>
 <div class="line"><span class="lineno">  109</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a8417d01c88b99ca56289843509fb71f9">items</a>[i] == item) {</div>
@@ -510,6 +540,8 @@ int8_t&#160;</td><td class="memItemRight" valign="bottom"><b>count</b> = 0</td><
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>left child of items[index]'s </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00278">278</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  278</span>                                              {</div>
 <div class="line"><span class="lineno">  279</span>        <span class="keywordflow">if</span> (item_index &lt; 0 || item_index &gt; <a class="code hl_variable" href="#a934e6d53cfefae2b971e1241a8a4c921">count</a> - 1) {</div>
 <div class="line"><span class="lineno">  280</span>            <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
@@ -551,6 +583,8 @@ int8_t&#160;</td><td class="memItemRight" valign="bottom"><b>count</b> = 0</td><
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>right child of items[index]'s </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00291">291</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  291</span>                                               {</div>
 <div class="line"><span class="lineno">  292</span>        <span class="keywordflow">if</span> (item_index &lt; 0 || item_index &gt; <a class="code hl_variable" href="#a934e6d53cfefae2b971e1241a8a4c921">count</a> - 1) {</div>
 <div class="line"><span class="lineno">  293</span>            <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
@@ -586,6 +620,8 @@ int8_t&#160;</td><td class="memItemRight" valign="bottom"><b>count</b> = 0</td><
 
 <p>Get leftmose child of the current node. </p>
 <dl class="section return"><dt>Returns</dt><dd>the leftmost child </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00271">271</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  271</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[0]; }</div>
 </div><!-- fragment -->
 </div>
@@ -615,6 +651,8 @@ int8_t&#160;</td><td class="memItemRight" valign="bottom"><b>count</b> = 0</td><
 
 <p>Get max item (rightmost) in the current node. </p>
 <dl class="section return"><dt>Returns</dt><dd>max item </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00120">120</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  120</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a8417d01c88b99ca56289843509fb71f9">items</a>[<a class="code hl_variable" href="#a934e6d53cfefae2b971e1241a8a4c921">count</a> - 1]; }</div>
 </div><!-- fragment -->
 </div>
@@ -644,6 +682,8 @@ int8_t&#160;</td><td class="memItemRight" valign="bottom"><b>count</b> = 0</td><
 
 <p>get min item (leftmost) in the current node </p>
 <dl class="section return"><dt>Returns</dt><dd>min item </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00126">126</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  126</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a8417d01c88b99ca56289843509fb71f9">items</a>[0]; }</div>
 </div><!-- fragment -->
 </div>
@@ -679,6 +719,8 @@ int8_t&#160;</td><td class="memItemRight" valign="bottom"><b>count</b> = 0</td><
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the next node that possibly contains item </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00304">304</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  304</span>                                             {</div>
 <div class="line"><span class="lineno">  305</span>        <span class="keywordtype">int</span> i = 0;</div>
 <div class="line"><span class="lineno">  306</span>        <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="#a934e6d53cfefae2b971e1241a8a4c921">count</a>; i++) {</div>
@@ -716,6 +758,8 @@ int8_t&#160;</td><td class="memItemRight" valign="bottom"><b>count</b> = 0</td><
 
 <p>Get rightmose child of the current node. </p>
 <dl class="section return"><dt>Returns</dt><dd>the rightmost child </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00265">265</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  265</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[<a class="code hl_variable" href="#a934e6d53cfefae2b971e1241a8a4c921">count</a>]; }</div>
 </div><!-- fragment -->
 </div>
@@ -752,6 +796,8 @@ int8_t&#160;</td><td class="memItemRight" valign="bottom"><b>count</b> = 0</td><
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>index where item is inserted, caller can use this index to update its left and right child </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00163">163</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  163</span>                             {</div>
 <div class="line"><span class="lineno">  164</span>        assert(!<a class="code hl_function" href="#a4a37381c0ef93d5ae2118b2e554974dd">IsFull</a>());</div>
 <div class="line"><span class="lineno">  165</span> </div>
@@ -769,15 +815,10 @@ int8_t&#160;</td><td class="memItemRight" valign="bottom"><b>count</b> = 0</td><
 <div class="line"><span class="lineno">  177</span>        <a class="code hl_function" href="#a306a30931f54c84098b38d6bc8f4a956">InsertItemByIndex</a>(i, item, <span class="keyword">nullptr</span>, <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">  178</span>        <span class="keywordflow">return</span> i;</div>
 <div class="line"><span class="lineno">  179</span>    }</div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a22fd25c6c811c64b6b27b0850d8c532f"><div class="ttname"><a href="#a22fd25c6c811c64b6b27b0850d8c532f">data_structures::tree_234::Node::Contains</a></div><div class="ttdeci">bool Contains(int64_t item)</div><div class="ttdoc">Check if item is in the node.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:92</div></div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a306a30931f54c84098b38d6bc8f4a956"><div class="ttname"><a href="#a306a30931f54c84098b38d6bc8f4a956">data_structures::tree_234::Node::InsertItemByIndex</a></div><div class="ttdeci">void InsertItemByIndex(int8_t index, int64_t item, Node *with_child, bool to_left=true)</div><div class="ttdoc">Insert a value to the index position.</div><div class="ttdef"><b>Definition</b> tree_234.cpp:189</div></div>
-<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a4a37381c0ef93d5ae2118b2e554974dd"><div class="ttname"><a href="#a4a37381c0ef93d5ae2118b2e554974dd">data_structures::tree_234::Node::IsFull</a></div><div class="ttdeci">bool IsFull()</div><div class="ttdoc">Check if node is a full (4-node)</div><div class="ttdef"><b>Definition</b> tree_234.cpp:73</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.svg" width="418" height="183"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a22fd25c6c811c64b6b27b0850d8c532f"><div class="ttname"><a href="#a22fd25c6c811c64b6b27b0850d8c532f">data_structures::tree_234::Node::Contains</a></div><div class="ttdeci">bool Contains(int64_t item)</div><div class="ttdoc">Check if item is in the node.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00092">tree_234.cpp:92</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a306a30931f54c84098b38d6bc8f4a956"><div class="ttname"><a href="#a306a30931f54c84098b38d6bc8f4a956">data_structures::tree_234::Node::InsertItemByIndex</a></div><div class="ttdeci">void InsertItemByIndex(int8_t index, int64_t item, Node *with_child, bool to_left=true)</div><div class="ttdoc">Insert a value to the index position.</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00189">tree_234.cpp:189</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1tree__234_1_1_node_html_a4a37381c0ef93d5ae2118b2e554974dd"><div class="ttname"><a href="#a4a37381c0ef93d5ae2118b2e554974dd">data_structures::tree_234::Node::IsFull</a></div><div class="ttdeci">bool IsFull()</div><div class="ttdoc">Check if node is a full (4-node)</div><div class="ttdef"><b>Definition</b> <a href="../../db/dbc/tree__234_8cpp_source.html#l00073">tree_234.cpp:73</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a306a30931f54c84098b38d6bc8f4a956" name="a306a30931f54c84098b38d6bc8f4a956"></a>
@@ -827,6 +868,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00189">189</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  190</span>                                                {</div>
 <div class="line"><span class="lineno">  191</span>        assert(<a class="code hl_variable" href="#a934e6d53cfefae2b971e1241a8a4c921">count &lt; 3 &amp;&amp; index &gt;</a>= 0 &amp;&amp; index &lt; 3);</div>
 <div class="line"><span class="lineno">  192</span> </div>
@@ -874,6 +917,8 @@ Here is the call graph for this function:</div>
 
 <p>Check if node is a 2-node. </p>
 <dl class="section return"><dt>Returns</dt><dd>true if node is 2-node, otherwise false </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00079">79</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   79</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a934e6d53cfefae2b971e1241a8a4c921">count</a> == 1; }</div>
 </div><!-- fragment -->
 </div>
@@ -903,6 +948,8 @@ Here is the call graph for this function:</div>
 
 <p>Check if node is a 3-node or 4-node, this is useful when we delete item from 2-3-4 tree. </p>
 <dl class="section return"><dt>Returns</dt><dd>true if node is 3-node or 4-node, false otherwise </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00085">85</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   85</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a934e6d53cfefae2b971e1241a8a4c921">count</a> == 2 || <a class="code hl_variable" href="#a934e6d53cfefae2b971e1241a8a4c921">count</a> == 3; }</div>
 </div><!-- fragment -->
 </div>
@@ -932,6 +979,8 @@ Here is the call graph for this function:</div>
 
 <p>Check if node is a full (4-node) </p>
 <dl class="section return"><dt>Returns</dt><dd>true if node is full (4-node), false otherwise </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00073">73</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   73</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a934e6d53cfefae2b971e1241a8a4c921">count</a> == 3; }</div>
 </div><!-- fragment -->
 </div>
@@ -961,6 +1010,8 @@ Here is the call graph for this function:</div>
 
 <p>Check if node is a leaf. </p>
 <dl class="section return"><dt>Returns</dt><dd>true if node is leaf, false otherwise </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   67</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[0] == <span class="keyword">nullptr</span>; }</div>
 </div><!-- fragment -->
 </div>
@@ -1001,6 +1052,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the removed child pointer </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00217">217</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  217</span>                                                          {</div>
 <div class="line"><span class="lineno">  218</span>        assert(index &gt;= 0 &amp;&amp; index &lt; <a class="code hl_variable" href="#a934e6d53cfefae2b971e1241a8a4c921">count</a>);</div>
 <div class="line"><span class="lineno">  219</span>        <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *removed_child = keep_left ? <a class="code hl_variable" href="#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[index + 1] : <a class="code hl_variable" href="#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[index];</div>
@@ -1015,7 +1068,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  228</span>        <a class="code hl_variable" href="#a934e6d53cfefae2b971e1241a8a4c921">count</a>--;</div>
 <div class="line"><span class="lineno">  229</span>        <span class="keywordflow">return</span> removed_child;</div>
 <div class="line"><span class="lineno">  230</span>    }</div>
-<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</div></div>
+<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -1054,6 +1107,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00259">259</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  259</span>{ <a class="code hl_variable" href="#ad5d6b6ce5fab21ccc88c6bf3153eee5d">children</a>[index] = child; }</div>
 </div><!-- fragment -->
 </div>
@@ -1089,6 +1144,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00061">61</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   61</span>{ <a class="code hl_variable" href="#a934e6d53cfefae2b971e1241a8a4c921">count</a> = c; }</div>
 </div><!-- fragment -->
 </div>
@@ -1128,16 +1185,97 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00140">140</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  140</span>                                                 {</div>
 <div class="line"><span class="lineno">  141</span>        assert(index &gt;= 0 &amp;&amp; index &lt;= 2);</div>
 <div class="line"><span class="lineno">  142</span> </div>
 <div class="line"><span class="lineno">  143</span>        <a class="code hl_variable" href="#a8417d01c88b99ca56289843509fb71f9">items</a>[index] = new_item;</div>
 <div class="line"><span class="lineno">  144</span>    }</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="ad5d6b6ce5fab21ccc88c6bf3153eee5d" name="ad5d6b6ce5fab21ccc88c6bf3153eee5d"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ad5d6b6ce5fab21ccc88c6bf3153eee5d">&#9670;&#160;</a></span>children</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::array&lt;<a class="el" href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> *, 4&gt; data_structures::tree_234::Node::children</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>store the children pointers </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00317">317</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a934e6d53cfefae2b971e1241a8a4c921" name="a934e6d53cfefae2b971e1241a8a4c921"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a934e6d53cfefae2b971e1241a8a4c921">&#9670;&#160;</a></span>count</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int8_t data_structures::tree_234::Node::count = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>track the current item count </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00319">319</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a8417d01c88b99ca56289843509fb71f9" name="a8417d01c88b99ca56289843509fb71f9"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a8417d01c88b99ca56289843509fb71f9">&#9670;&#160;</a></span>items</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::array&lt;int64_t, 3&gt; data_structures::tree_234::Node::items</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>store items </p>
+
+<p class="definition">Definition at line <a class="el" href="../../db/dbc/tree__234_8cpp_source.html#l00315">315</a> of file <a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../db/dbc/tree__234_8cpp.html">tree_234.cpp</a></li>
+<li>data_structures/<a class="el" href="../../db/dbc/tree__234_8cpp_source.html">tree_234.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.map b/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.map
deleted file mode 100644
index 5b3e382bb..000000000
--- a/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="data_structures::tree_234::Node::InsertItem" name="data_structures::tree_234::Node::InsertItem">
-<area shape="rect" id="Node000001" title="Insert item to the proper position of the node and return the position index." alt="" coords="5,71,161,111"/>
-<area shape="rect" id="Node000002" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" title="Check if item is in the node." alt="" coords="236,5,384,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,68,222,48,223,53,157,73"/>
-<area shape="rect" id="Node000003" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" title="Insert a value to the index position." alt="" coords="209,71,412,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="161,88,193,88,193,94,161,94"/>
-<area shape="rect" id="Node000004" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" title="Check if node is a full (4&#45;node)" alt="" coords="240,136,381,177"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="157,109,225,129,224,134,155,114"/>
-</map>
diff --git a/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.md5 b/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.md5
deleted file mode 100644
index 06590057b..000000000
--- a/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8df149e50e46a87708a8a93a75806edb
\ No newline at end of file
diff --git a/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.svg b/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.svg
deleted file mode 100644
index ee613c79b..000000000
--- a/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph.svg
+++ /dev/null
@@ -1,105 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Node::InsertItem Pages: 1 -->
-<svg width="313pt" height="137pt"
- viewBox="0.00 0.00 313.00 136.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 132.5)">
-<title>data_structures::tree_234::Node::InsertItem</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-79.5 0,-79.5 0,-49 116.5,-49 116.5,-79.5"/>
-<text text-anchor="start" x="8" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="58.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="284.38,-128.5 173.12,-128.5 173.12,-98 284.38,-98 284.38,-128.5"/>
-<text text-anchor="start" x="181.12" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="228.75" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.03,-79.89C128.91,-84.51 146.46,-89.61 162.96,-94.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.58,-97.65 172.16,-97.09 163.54,-90.93 161.58,-97.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="305,-79.5 152.5,-79.5 152.5,-49 305,-49 305,-79.5"/>
-<text text-anchor="start" x="160.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="228.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.77,-64.25C124.48,-64.25 132.52,-64.25 140.6,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.51,-67.75 150.51,-64.25 140.51,-60.75 140.51,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="281.75,-30.5 175.75,-30.5 175.75,0 281.75,0 281.75,-30.5"/>
-<text text-anchor="start" x="183.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="228.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.03,-48.61C129.38,-43.86 147.51,-38.58 164.43,-33.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.27,-37.07 173.89,-30.91 163.31,-30.34 165.27,-37.07"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph_org.svg b/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph_org.svg
deleted file mode 100644
index b5c4c2156..000000000
--- a/dd/d40/classdata__structures_1_1tree__234_1_1_node_a8e809ae85ae00e937f67ddb76951b6bb_cgraph_org.svg
+++ /dev/null
@@ -1,79 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::tree_234::Node::InsertItem Pages: 1 -->
-<svg width="313pt" height="137pt"
- viewBox="0.00 0.00 313.00 136.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 132.5)">
-<title>data_structures::tree_234::Node::InsertItem</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Insert item to the proper position of the node and return the position index.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-79.5 0,-79.5 0,-49 116.5,-49 116.5,-79.5"/>
-<text text-anchor="start" x="8" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="58.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItem</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f" target="_top" xlink:title="Check if item is in the node.">
-<polygon fill="white" stroke="#666666" points="284.38,-128.5 173.12,-128.5 173.12,-98 284.38,-98 284.38,-128.5"/>
-<text text-anchor="start" x="181.12" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="228.75" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::Contains</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.03,-79.89C128.91,-84.51 146.46,-89.61 162.96,-94.41"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.58,-97.65 172.16,-97.09 163.54,-90.93 161.58,-97.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956" target="_top" xlink:title="Insert a value to the index position.">
-<polygon fill="white" stroke="#666666" points="305,-79.5 152.5,-79.5 152.5,-49 305,-49 305,-79.5"/>
-<text text-anchor="start" x="160.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="228.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::InsertItemByIndex</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.77,-64.25C124.48,-64.25 132.52,-64.25 140.6,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.51,-67.75 150.51,-64.25 140.51,-60.75 140.51,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd" target="_top" xlink:title="Check if node is a full (4&#45;node)">
-<polygon fill="white" stroke="#666666" points="281.75,-30.5 175.75,-30.5 175.75,0 281.75,0 281.75,-30.5"/>
-<text text-anchor="start" x="183.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
-<text text-anchor="middle" x="228.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node::IsFull</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.03,-48.61C129.38,-43.86 147.51,-38.58 164.43,-33.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.27,-37.07 173.89,-30.91 163.31,-30.34 165.27,-37.07"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d43/namespace_m_d5.html b/dd/d43/namespace_m_d5.html
index b5e85af10..a8a4f8ede 100644
--- a/dd/d43/namespace_m_d5.html
+++ b/dd/d43/namespace_m_d5.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: MD5 Namespace Reference</title>
+<title>TheAlgorithms/C++: MD5 Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dd/d47/namespacemath.html b/dd/d47/namespacemath.html
index 2a5313026..b91fcb7e4 100644
--- a/dd/d47/namespacemath.html
+++ b/dd/d47/namespacemath.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math Namespace Reference</title>
+<title>TheAlgorithms/C++: math Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -125,7 +142,7 @@ Functions</h2></td></tr>
 <tr class="memitem:ab37f3a7302a84179aae682c79d8390bf" id="r_ab37f3a7302a84179aae682c79d8390bf"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab37f3a7302a84179aae682c79d8390bf">aliquot_sum</a> (const uint64_t num)</td></tr>
 <tr class="memdesc:ab37f3a7302a84179aae682c79d8390bf"><td class="mdescLeft">&#160;</td><td class="mdescRight">to return the aliquot sum of a number  <br /></td></tr>
 <tr class="separator:ab37f3a7302a84179aae682c79d8390bf"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:abf7f2a6d91f1ca6c89698792aea3f188" id="r_abf7f2a6d91f1ca6c89698792aea3f188"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abf7f2a6d91f1ca6c89698792aea3f188">approximate_pi</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="#a006c8ebd11bb1e035815dc835a1a7a85">Point</a> &gt; &amp;pts)</td></tr>
+<tr class="memitem:abf7f2a6d91f1ca6c89698792aea3f188" id="r_abf7f2a6d91f1ca6c89698792aea3f188"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abf7f2a6d91f1ca6c89698792aea3f188">approximate_pi</a> (const std::vector&lt; <a class="el" href="#a006c8ebd11bb1e035815dc835a1a7a85">Point</a> &gt; &amp;pts)</td></tr>
 <tr class="memdesc:abf7f2a6d91f1ca6c89698792aea3f188"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function uses the points in a given vector 'pts' (drawn at random) to return an approximation of the number π.  <br /></td></tr>
 <tr class="separator:abf7f2a6d91f1ca6c89698792aea3f188"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a971ce57e368f2f631cf1f4ff3f864049" id="r_a971ce57e368f2f631cf1f4ff3f864049"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
@@ -176,11 +193,11 @@ Functions</h2></td></tr>
 <tr class="memitem:abd8f794b2229b42876169ff841b6e444" id="r_abd8f794b2229b42876169ff841b6e444"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abd8f794b2229b42876169ff841b6e444">is_prime</a> (int64_t num)</td></tr>
 <tr class="memdesc:abd8f794b2229b42876169ff841b6e444"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to check if the given number is prime or not.  <br /></td></tr>
 <tr class="separator:abd8f794b2229b42876169ff841b6e444"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a91366864111e1fac29722ca45e02ea8f" id="r_a91366864111e1fac29722ca45e02ea8f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a91366864111e1fac29722ca45e02ea8f">sieve</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; *vec)</td></tr>
+<tr class="memitem:a91366864111e1fac29722ca45e02ea8f" id="r_a91366864111e1fac29722ca45e02ea8f"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a91366864111e1fac29722ca45e02ea8f">sieve</a> (std::vector&lt; bool &gt; *vec)</td></tr>
 <tr class="memdesc:a91366864111e1fac29722ca45e02ea8f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Performs the sieve.  <br /></td></tr>
 <tr class="separator:a91366864111e1fac29722ca45e02ea8f"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad09d59850865012a6fd95d89954c82e4" id="r_ad09d59850865012a6fd95d89954c82e4"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad09d59850865012a6fd95d89954c82e4">print_primes</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; const &amp;<a class="el" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>)</td></tr>
-<tr class="memdesc:ad09d59850865012a6fd95d89954c82e4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints all the indexes of true values in the passed <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>.  <br /></td></tr>
+<tr class="memitem:ad09d59850865012a6fd95d89954c82e4" id="r_ad09d59850865012a6fd95d89954c82e4"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad09d59850865012a6fd95d89954c82e4">print_primes</a> (std::vector&lt; bool &gt; const &amp;<a class="el" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>)</td></tr>
+<tr class="memdesc:ad09d59850865012a6fd95d89954c82e4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints all the indexes of true values in the passed std::vector.  <br /></td></tr>
 <tr class="separator:ad09d59850865012a6fd95d89954c82e4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ac37d3ba52eb296597d7a024ba8c4a5a5" id="r_ac37d3ba52eb296597d7a024ba8c4a5a5"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac37d3ba52eb296597d7a024ba8c4a5a5">phiFunction</a> (uint64_t n)</td></tr>
 <tr class="memdesc:ac37d3ba52eb296597d7a024ba8c4a5a5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to calculate Euler's Totient.  <br /></td></tr>
@@ -188,7 +205,7 @@ Functions</h2></td></tr>
 <tr class="memitem:a7e78996673df791014cfe540b183456a" id="r_a7e78996673df791014cfe540b183456a"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7e78996673df791014cfe540b183456a">factorial</a> (uint8_t n)</td></tr>
 <tr class="memdesc:a7e78996673df791014cfe540b183456a"><td class="mdescLeft">&#160;</td><td class="mdescRight">function to find factorial of given number  <br /></td></tr>
 <tr class="separator:a7e78996673df791014cfe540b183456a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aec65db4e5c7317323227f026fe50ef11" id="r_aec65db4e5c7317323227f026fe50ef11"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aec65db4e5c7317323227f026fe50ef11">integral_approx</a> (double lb, double ub, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; double(double)&gt; &amp;func, double delta=.0001)</td></tr>
+<tr class="memitem:aec65db4e5c7317323227f026fe50ef11" id="r_aec65db4e5c7317323227f026fe50ef11"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aec65db4e5c7317323227f026fe50ef11">integral_approx</a> (double lb, double ub, const std::function&lt; double(double)&gt; &amp;func, double delta=.0001)</td></tr>
 <tr class="memdesc:aec65db4e5c7317323227f026fe50ef11"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes integral approximation.  <br /></td></tr>
 <tr class="separator:aec65db4e5c7317323227f026fe50ef11"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a50936ee98f4d40f17823befc65a32aec" id="r_a50936ee98f4d40f17823befc65a32aec"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a50936ee98f4d40f17823befc65a32aec">test_eval</a> (double approx, double expected, double threshold)</td></tr>
@@ -246,7 +263,7 @@ Functions</h2></td></tr>
 <tr class="memitem:a8a48be4d7f14e34c5c92925bc1cbf3bb" id="r_a8a48be4d7f14e34c5c92925bc1cbf3bb"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8a48be4d7f14e34c5c92925bc1cbf3bb">power_of_two</a> (int n)</td></tr>
 <tr class="memdesc:a8a48be4d7f14e34c5c92925bc1cbf3bb"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function finds whether a number is power of 2 or not.  <br /></td></tr>
 <tr class="separator:a8a48be4d7f14e34c5c92925bc1cbf3bb"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aacb1411ef2029e81f249c21e17c96fdb" id="r_aacb1411ef2029e81f249c21e17c96fdb"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; long double &gt;, 2 &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aacb1411ef2029e81f249c21e17c96fdb">quadraticEquation</a> (long double a, long double b, long double c)</td></tr>
+<tr class="memitem:aacb1411ef2029e81f249c21e17c96fdb" id="r_aacb1411ef2029e81f249c21e17c96fdb"><td class="memItemLeft" align="right" valign="top">std::array&lt; std::complex&lt; long double &gt;, 2 &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aacb1411ef2029e81f249c21e17c96fdb">quadraticEquation</a> (long double a, long double b, long double c)</td></tr>
 <tr class="memdesc:aacb1411ef2029e81f249c21e17c96fdb"><td class="mdescLeft">&#160;</td><td class="mdescRight">Quadratic equation calculator.  <br /></td></tr>
 <tr class="separator:aacb1411ef2029e81f249c21e17c96fdb"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae1ca505751f5a6d3977b86372cfe75ea" id="r_ae1ca505751f5a6d3977b86372cfe75ea"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae1ca505751f5a6d3977b86372cfe75ea">binomialCoeffSum</a> (uint64_t n)</td></tr>
@@ -282,7 +299,7 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>for assert </p>
-<p><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></p>
+<p>std::cout</p>
 <p>for IO implementations</p>
 <p>Evaluate recurrence relation using <a href="https://www.hackerearth.com/practice/notes/matrix-exponentiation-1/" target="_blank">matrix exponentiation</a>.</p>
 <p>Math algorithms.</p>
@@ -290,10 +307,10 @@ Functions</h2></td></tr>
 <p>Mathematical algorithms.</p>
 <p>for IO operations</p>
 <p>for M_PI definition and pow()</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>for std::vector</p>
 <p>for IO operations</p>
 <p>Mathematical algorithms</p>
-<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> for IO operations</p>
+<p>for assert for std::rand for IO operations</p>
 <p>Mathematical algorithms</p>
 <p>for assert for uint16_t datatype for IO operations</p>
 <p>Mathematical algorithms</p>
@@ -303,43 +320,43 @@ Functions</h2></td></tr>
 <p>Mathematical algorithms</p>
 <p>for cout</p>
 <p>Mathematical algorithms</p>
-<p>For assert For timing the sieve For IO operations For string handling For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>For assert For timing the sieve For IO operations For string handling For std::vector</p>
 <p>for I/O operations</p>
 <p>Mathematical algorithms</p>
 <p>for assert</p>
 <p>Math algorithms</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>for std::cin and std::cout for std::vector</p>
 <p>Mathematical algorithms</p>
-<p>for std::abs for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for assert</p>
+<p>for std::abs for std::array for assert</p>
 <p>Maths algorithms</p>
 <p>for assert for passing in functions for IO operations</p>
 <p>Mathematical functions</p>
-<p>for math functions for fixed size data types for time to initialize rng for function pointers for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> for random number generation for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
-<p>for assert for integral types for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></p>
+<p>for math functions for fixed size data types for time to initialize rng for function pointers for std::cout for random number generation for std::vector</p>
+<p>for assert for integral types for std::invalid_argument for std::cout</p>
+<p>for std::cin and std::cout</p>
 <p>Mathematical algorithms</p>
 <p>Given a recurrence relation; evaluate the value of nth term. For e.g., For fibonacci series, recurrence series is <code>f(n) = f(n-1) + f(n-2)</code> where <code>f(0) = 0</code> and <code>f(1) = 1</code>. Note that the method used only demonstrates recurrence relation with one variable (n), unlike <code>nCr</code> problem, since it has two (n, r)</p>
 <h3><a class="anchor" id="autotoc_md85"></a>
 Algorithm</h3>
 <p>This problem can be solved using matrix exponentiation method. </p><dl class="section see"><dt>See also</dt><dd>here for simple <a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/modular_exponentiation.cpp" target="_blank">number exponentiation algorithm</a> or <a href="https://en.wikipedia.org/wiki/Exponentiation_by_squaring" target="_blank">explaination here</a>. </dd></dl>
-<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AshishYUO" target="_blank">Ashish Daulatabad</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> STL</dd></dl>
+<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AshishYUO" target="_blank">Ashish Daulatabad</a> for assert for IO operations for std::vector STL</dd></dl>
 <p>Mathematical algorithms</p>
 <p>for io operations</p>
 <p>Mathematical algorithms</p>
-<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a></p>
+<p>for assert for std::int64_t</p>
 <p>Maths algorithms.</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>for std::cout for std::vector</p>
 <p>Mathematical algorithms</p>
-<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></p>
+<p>for assert for std::cout</p>
 <p>Mathematical algorithms</p>
 <p>for assert for M_PI definition and pow() for uint16_t datatype</p>
 <p>Mathematical algorithms</p>
 <p>for IO operations for assert</p>
-<p><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> assert <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/trunc.html">std::trunc</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a> <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a> <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a> <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setprecision.html">std::setprecision</a></p>
+<p>std::array assert std::sqrt, std::trunc, std::pow std::complex std::invalid_argument std::setprecision</p>
 <p>Mathematical algorithms</p>
 <p>for assert for IO operations</p>
 <p>Mathematical algorithms</p>
-<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a></p>
+<p>for assert for std::pow for std::uint32_t</p>
 <p>Mathematical algorithms </p>
 </div><h2 class="groupheader">Typedef Documentation</h2>
 <a id="a006c8ebd11bb1e035815dc835a1a7a85" name="a006c8ebd11bb1e035815dc835a1a7a85"></a>
@@ -359,6 +376,8 @@ Algorithm</h3>
 <div class="line">}</div>
 </div><!-- fragment -->
 <p>structure of points containing two numbers, x and y, such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d51/approximate__pi_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../d0/d51/approximate__pi_8cpp_source.html">approximate_pi.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   35</span>                     {</div>
 <div class="line"><span class="lineno">   36</span>    <span class="keywordtype">double</span> x;</div>
 <div class="line"><span class="lineno">   37</span>    <span class="keywordtype">double</span> y;</div>
@@ -389,6 +408,8 @@ Algorithm</h3>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d99/aliquot__sum_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../de/d99/aliquot__sum_8cpp_source.html">aliquot_sum.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   36</span>                                         {</div>
 <div class="line"><span class="lineno">   37</span>    <span class="keywordflow">if</span> (num == 0 || num == 1) {</div>
 <div class="line"><span class="lineno">   38</span>        <span class="keywordflow">return</span> 0;  <span class="comment">// The aliquot sum for 0 and 1 is 0</span></div>
@@ -404,7 +425,7 @@ Algorithm</h3>
 <div class="line"><span class="lineno">   48</span> </div>
 <div class="line"><span class="lineno">   49</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">   50</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&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:232</div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00232">vector_ops.hpp:232</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -417,7 +438,7 @@ Algorithm</h3>
         <tr>
           <td class="memname">double math::approximate_pi </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="#a006c8ebd11bb1e035815dc835a1a7a85">Point</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>pts</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; <a class="el" href="#a006c8ebd11bb1e035815dc835a1a7a85">Point</a> &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>pts</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -431,6 +452,8 @@ Algorithm</h3>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>an estimate of the number π. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d51/approximate__pi_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../d0/d51/approximate__pi_8cpp_source.html">approximate_pi.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   47</span>                                                   {</div>
 <div class="line"><span class="lineno">   48</span>    <span class="keywordtype">double</span> count = 0;  <span class="comment">// Points in circle</span></div>
 <div class="line"><span class="lineno">   49</span>    <span class="keywordflow">for</span> (<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> p : pts) {</div>
@@ -440,13 +463,8 @@ Algorithm</h3>
 <div class="line"><span class="lineno">   53</span>    }</div>
 <div class="line"><span class="lineno">   54</span>    <span class="keywordflow">return</span> 4.0 * count / <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(pts.size());</div>
 <div class="line"><span class="lineno">   55</span>}</div>
-<div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:12</div></div>
-</div><!-- 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="../../dd/d47/namespacemath_abf7f2a6d91f1ca6c89698792aea3f188_cgraph.svg" width="320" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition</b> <a href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00012">line_segment_intersection.cpp:12</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a8e6eede206201db0d1dbb618fa969bec" name="a8e6eede206201db0d1dbb618fa969bec"></a>
@@ -479,16 +497,13 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if the pair is amicable </dd>
 <dd>
 <code>false</code> if the pair is not amicable </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/df6/check__amicable__pair_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d5/df6/check__amicable__pair_8cpp_source.html">check_amicable_pair.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   58</span>                                {</div>
 <div class="line"><span class="lineno">   59</span>    <span class="keywordflow">return</span> (<a class="code hl_function" href="#af05567415a9ea36c254b54e3d5a2152a">sum_of_divisor</a>(x) == y) &amp;&amp; (<a class="code hl_function" href="#af05567415a9ea36c254b54e3d5a2152a">sum_of_divisor</a>(y) == x);</div>
 <div class="line"><span class="lineno">   60</span>}</div>
-<div class="ttc" id="anamespacemath_html_af05567415a9ea36c254b54e3d5a2152a"><div class="ttname"><a href="#af05567415a9ea36c254b54e3d5a2152a">math::sum_of_divisor</a></div><div class="ttdeci">int sum_of_divisor(int num)</div><div class="ttdoc">Function to calculate the sum of all the proper divisor of an integer.</div><div class="ttdef"><b>Definition</b> check_amicable_pair.cpp:31</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph.svg" width="340" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemath_html_af05567415a9ea36c254b54e3d5a2152a"><div class="ttname"><a href="#af05567415a9ea36c254b54e3d5a2152a">math::sum_of_divisor</a></div><div class="ttdeci">int sum_of_divisor(int num)</div><div class="ttdoc">Function to calculate the sum of all the proper divisor of an integer.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/df6/check__amicable__pair_8cpp_source.html#l00031">check_amicable_pair.cpp:31</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae1ca505751f5a6d3977b86372cfe75ea" name="ae1ca505751f5a6d3977b86372cfe75ea"></a>
@@ -512,6 +527,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Sum of binomial coefficients of number </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d9d/sum__of__binomial__coefficient_8cpp_source.html#l00027">27</a> of file <a class="el" href="../../d4/d9d/sum__of__binomial__coefficient_8cpp_source.html">sum_of_binomial_coefficient.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   27</span>                                      {</div>
 <div class="line"><span class="lineno">   28</span>    <span class="comment">// Calculating 2^n</span></div>
 <div class="line"><span class="lineno">   29</span>    <span class="keywordflow">return</span> (1 &lt;&lt; n);</div>
@@ -547,6 +564,8 @@ template&lt;typename T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>area of the circle </dd></dl>
 </li>
 </ul>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d82/area_8cpp_source.html#l00063">63</a> of file <a class="el" href="../../dc/d82/area_8cpp_source.html">area.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   63</span>                        {</div>
 <div class="line"><span class="lineno">   64</span>    <span class="keywordflow">return</span> M_PI * pow(radius, 2);</div>
 <div class="line"><span class="lineno">   65</span>}</div>
@@ -578,6 +597,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>perimeter of the circle </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html#l00063">63</a> of file <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html">perimeter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   63</span>                             {</div>
 <div class="line"><span class="lineno">   64</span>    <span class="keywordflow">return</span> 2 * M_PI * radius;</div>
 <div class="line"><span class="lineno">   65</span>}</div>
@@ -620,17 +641,13 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The volume of the cone </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   53</span>                                                    {</div>
-<div class="line"><span class="lineno">   54</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(radius, 2) * PI * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> / 3;</div>
-<div class="line"><span class="lineno">   55</span>}</div>
-<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition</b> avltree.cpp:38</div></div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.svg" width="386" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../da/d39/volume_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../da/d39/volume_8cpp_source.html">volume.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   53</span>                                                    {</div>
+<div class="line"><span class="lineno">   54</span>    <span class="keywordflow">return</span> std::pow(radius, 2) * PI * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> / 3;</div>
+<div class="line"><span class="lineno">   55</span>}</div>
+<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00038">avltree.cpp:38</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abc46c784a297fc1d2eb8b33a327fba4c" name="abc46c784a297fc1d2eb8b33a327fba4c"></a>
@@ -661,6 +678,8 @@ template&lt;typename T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>surface area of the cube </dd></dl>
 </li>
 </ul>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d82/area_8cpp_source.html#l00086">86</a> of file <a class="el" href="../../dc/d82/area_8cpp_source.html">area.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   86</span>                              {</div>
 <div class="line"><span class="lineno">   87</span>    <span class="keywordflow">return</span> 6 * length * length;</div>
 <div class="line"><span class="lineno">   88</span>}</div>
@@ -695,6 +714,8 @@ template&lt;typename T &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>surface perimeter of the cube </dd></dl>
 </li>
 </ul>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html#l00086">86</a> of file <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html">perimeter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   86</span>                                   {</div>
 <div class="line"><span class="lineno">   87</span>    <span class="keywordflow">return</span> 12 * length;</div>
 <div class="line"><span class="lineno">   88</span>}</div>
@@ -726,15 +747,12 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The volume of the cube </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   28</span>                        {</div>
-<div class="line"><span class="lineno">   29</span>    <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(length, 3);</div>
-<div class="line"><span class="lineno">   30</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_ae413098478fa38acaac887b7654f0725_cgraph.svg" width="266" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../da/d39/volume_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../da/d39/volume_8cpp_source.html">volume.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   28</span>                        {</div>
+<div class="line"><span class="lineno">   29</span>    <span class="keywordflow">return</span> std::pow(length, 3);</div>
+<div class="line"><span class="lineno">   30</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac5803413618fcfb922cb32c6db0fc864" name="ac5803413618fcfb922cb32c6db0fc864"></a>
@@ -767,15 +785,12 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>surface area of the cylinder </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d82/area_8cpp_source.html#l00109">109</a> of file <a class="el" href="../../dc/d82/area_8cpp_source.html">area.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  109</span>                                            {</div>
 <div class="line"><span class="lineno">  110</span>    <span class="keywordflow">return</span> 2 * M_PI * radius * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> + 2 * M_PI * pow(radius, 2);</div>
 <div class="line"><span class="lineno">  111</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.svg" width="422" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1d4df7a4e43a2eac1acc0ac610487c73" name="a1d4df7a4e43a2eac1acc0ac610487c73"></a>
@@ -808,15 +823,12 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>surface perimeter of the cylinder </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html#l00111">111</a> of file <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html">perimeter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  111</span>                                                 {</div>
 <div class="line"><span class="lineno">  112</span>    <span class="keywordflow">return</span> (2 * radius) + (2 * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>);</div>
 <div class="line"><span class="lineno">  113</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.svg" width="390" height="68"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abde24398be43538c62e4a496968e60ca" name="abde24398be43538c62e4a496968e60ca"></a>
@@ -855,15 +867,12 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The volume of the cylinder </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  103</span>                                                        {</div>
-<div class="line"><span class="lineno">  104</span>    <span class="keywordflow">return</span> PI * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(radius, 2) * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>;</div>
-<div class="line"><span class="lineno">  105</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.svg" width="403" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../da/d39/volume_8cpp_source.html#l00103">103</a> of file <a class="el" href="../../da/d39/volume_8cpp_source.html">volume.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  103</span>                                                        {</div>
+<div class="line"><span class="lineno">  104</span>    <span class="keywordflow">return</span> PI * std::pow(radius, 2) * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>;</div>
+<div class="line"><span class="lineno">  105</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7e78996673df791014cfe540b183456a" name="a7e78996673df791014cfe540b183456a"></a>
@@ -889,23 +898,19 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section warning"><dt>Warning</dt><dd>Maximum value for the parameter is 20 as 21! cannot be represented in 64 bit unsigned int </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d00/factorial_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../d9/d00/factorial_8cpp_source.html">factorial.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   29</span>                              {</div>
 <div class="line"><span class="lineno">   30</span>    <span class="keywordflow">if</span> (n &lt; 20) {</div>
-<div class="line"><span class="lineno">   31</span>        <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>(<span class="stringliteral">&quot;maximum value is 20\n&quot;</span>);</div>
+<div class="line"><span class="lineno">   31</span>        <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;maximum value is 20\n&quot;</span>);</div>
 <div class="line"><span class="lineno">   32</span>    }</div>
 <div class="line"><span class="lineno">   33</span>    <span class="keywordflow">if</span> (n == 0) {</div>
 <div class="line"><span class="lineno">   34</span>        <span class="keywordflow">return</span> 1;</div>
 <div class="line"><span class="lineno">   35</span>    }</div>
 <div class="line"><span class="lineno">   36</span>    <span class="keywordflow">return</span> n * <a class="code hl_function" href="#a7e78996673df791014cfe540b183456a">factorial</a>(n - 1);</div>
 <div class="line"><span class="lineno">   37</span>}</div>
-<div class="ttc" id="ainvalid_argument_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></div></div>
-<div class="ttc" id="anamespacemath_html_a7e78996673df791014cfe540b183456a"><div class="ttname"><a href="#a7e78996673df791014cfe540b183456a">math::factorial</a></div><div class="ttdeci">uint64_t factorial(uint8_t n)</div><div class="ttdoc">function to find factorial of given number</div><div class="ttdef"><b>Definition</b> factorial.cpp:29</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_a7e78996673df791014cfe540b183456a_cgraph.svg" width="115" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemath_html_a7e78996673df791014cfe540b183456a"><div class="ttname"><a href="#a7e78996673df791014cfe540b183456a">math::factorial</a></div><div class="ttdeci">uint64_t factorial(uint8_t n)</div><div class="ttdoc">function to find factorial of given number</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d00/factorial_8cpp_source.html#l00029">factorial.cpp:29</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a3277e65a8f380e7632791975bfba0efb" name="a3277e65a8f380e7632791975bfba0efb"></a>
@@ -939,6 +944,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>surface area of the hemi-sphere </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d82/area_8cpp_source.html#l00121">121</a> of file <a class="el" href="../../dc/d82/area_8cpp_source.html">area.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  121</span>                                     {</div>
 <div class="line"><span class="lineno">  122</span>    <span class="keywordflow">return</span> 3 * M_PI * pow(radius, 2);</div>
 <div class="line"><span class="lineno">  123</span>}</div>
@@ -964,7 +971,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; double(double)&gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>func</em></span>, </td>
+          <td class="paramtype">const std::function&lt; double(double)&gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>func</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -985,6 +992,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>integral approximation of function from [lb, ub] </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/de9/integral__approximation_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d1/de9/integral__approximation_8cpp_source.html">integral_approximation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   44</span>                                             {</div>
 <div class="line"><span class="lineno">   45</span>    <span class="keywordtype">double</span> result = 0;</div>
 <div class="line"><span class="lineno">   46</span>    uint64_t numDeltas = <span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>((ub - lb) / delta);</div>
@@ -1025,26 +1034,19 @@ template&lt;typename T &gt; </div>
 false if number is not a factorial </dd></dl>
 <p>this loop is basically a reverse factorial calculation, where instead of multiplying we are dividing. We start at i = 2 since i = 1 has no impact division wise</p>
 <p>if n was the sum of a factorial then it should be divided until it becomes 1</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/dd5/check__factorial_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../d8/dd5/check__factorial_8cpp_source.html">check_factorial.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   28</span>                              {</div>
 <div class="line"><span class="lineno">   29</span>    <span class="keywordflow">if</span> (n &lt;= 0) {  <span class="comment">// factorial numbers are only ever positive Integers</span></div>
 <div class="line"><span class="lineno">   30</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   31</span>    }</div>
-<div class="line"><span class="lineno">   32</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   33</span><span class="comment">    /*!</span></div>
-<div class="line"><span class="lineno">   34</span><span class="comment">     * this loop is basically a reverse factorial calculation, where instead</span></div>
-<div class="line"><span class="lineno">   35</span><span class="comment">     * of multiplying we are dividing. We start at i = 2 since i = 1 has</span></div>
-<div class="line"><span class="lineno">   36</span><span class="comment">     * no impact division wise</span></div>
-<div class="line"><span class="lineno">   37</span><span class="comment">     */</span></div>
+<div class="line"><span class="lineno">   32</span> </div>
 <div class="line"><span class="lineno">   38</span>    <span class="keywordtype">int</span> i = 2;</div>
 <div class="line"><span class="lineno">   39</span>    <span class="keywordflow">while</span> (n % i == 0) {</div>
 <div class="line"><span class="lineno">   40</span>        n = n / i;</div>
 <div class="line"><span class="lineno">   41</span>        i++;</div>
 <div class="line"><span class="lineno">   42</span>    }</div>
-<div class="line"><span class="lineno">   43</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   44</span><span class="comment">    /*!</span></div>
-<div class="line"><span class="lineno">   45</span><span class="comment">     * if n was the sum of a factorial then it should be divided until it</span></div>
-<div class="line"><span class="lineno">   46</span><span class="comment">     * becomes 1</span></div>
-<div class="line"><span class="lineno">   47</span><span class="comment">     */</span></div>
+<div class="line"><span class="lineno">   43</span> </div>
 <div class="line"><span class="lineno">   48</span>    <span class="keywordflow">return</span> (n == 1);</div>
 <div class="line"><span class="lineno">   49</span>}</div>
 </div><!-- fragment -->
@@ -1076,16 +1078,9 @@ false if number is not a factorial </dd></dl>
 <dd>
 false if number is not a prime. </dd></dl>
 <p>Reduce all possibilities of a number which cannot be prime with the first 3 if, else if conditionals. Example: Since no even number, except 2 can be a prime number and the next prime we find after our checks is 5, we will start the for loop with i = 5. then for each loop we increment i by +6 and check if i or i+2 is a factor of the number; if it's a factor then we will return false. otherwise, true will be returned after the loop terminates at the terminating condition which is i*i &lt;= num</p>
-<div class="fragment"><div class="line"><span class="lineno">   31</span>                           {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   32</span><span class="comment">    /*!</span></div>
-<div class="line"><span class="lineno">   33</span><span class="comment">     * Reduce all possibilities of a number which cannot be prime with the first</span></div>
-<div class="line"><span class="lineno">   34</span><span class="comment">     * 3 if, else if conditionals. Example: Since no even number, except 2 can</span></div>
-<div class="line"><span class="lineno">   35</span><span class="comment">     * be a prime number and the next prime we find after our checks is 5,</span></div>
-<div class="line"><span class="lineno">   36</span><span class="comment">     * we will start the for loop with i = 5. then for each loop we increment</span></div>
-<div class="line"><span class="lineno">   37</span><span class="comment">     * i by +6 and check if i or i+2 is a factor of the number; if it&#39;s a factor</span></div>
-<div class="line"><span class="lineno">   38</span><span class="comment">     * then we will return false. otherwise, true will be returned after the</span></div>
-<div class="line"><span class="lineno">   39</span><span class="comment">     * loop terminates at the terminating condition which is i*i &lt;= num</span></div>
-<div class="line"><span class="lineno">   40</span><span class="comment">     */</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d93/check__prime_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../db/d93/check__prime_8cpp_source.html">check_prime.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   31</span>                           {</div>
 <div class="line"><span class="lineno">   41</span>    <span class="keywordflow">if</span> (num &lt;= 1) {</div>
 <div class="line"><span class="lineno">   42</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   43</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (num == 2 || num == 3) {</div>
@@ -1131,9 +1126,11 @@ false if number is not a prime. </dd></dl>
 <dl class="section warning"><dt>Warning</dt><dd>Maximum=20 because there are no 128-bit integers in C++. 21! returns 1.419e+19, which is not 21! but (21! % UINT64_MAX). </dd></dl>
 <dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html#a0">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/iterative_factorial.cpp</a>.</dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d9f/iterative__factorial_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../db/d9f/iterative__factorial_8cpp_source.html">iterative_factorial.cpp</a>.</p>
 <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> (n &gt; 20) {</div>
-<div class="line"><span class="lineno">   49</span>        <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>(<span class="stringliteral">&quot;Maximum n value is 20&quot;</span>);</div>
+<div class="line"><span class="lineno">   49</span>        <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Maximum n value is 20&quot;</span>);</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="comment">// 1 because it is the identity number of multiplication.</span></div>
@@ -1177,6 +1174,8 @@ false if number is not a prime. </dd></dl>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>largest power </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d7a/largest__power_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../d5/d7a/largest__power_8cpp_source.html">largest_power.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   29</span>                                                     {</div>
 <div class="line"><span class="lineno">   30</span>    <span class="comment">// Initialize result</span></div>
 <div class="line"><span class="lineno">   31</span>    <span class="keywordtype">int</span> x = 0;</div>
@@ -1212,10 +1211,12 @@ false if number is not a prime. </dd></dl>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>int Sum of LCMs, i.e. ∑LCM(i, num) from i = 1 to num </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/d83/lcm__sum_8cpp_source.html#l00030">30</a> of file <a class="el" href="../../d5/d83/lcm__sum_8cpp_source.html">lcm_sum.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   30</span>                                     {</div>
 <div class="line"><span class="lineno">   31</span>    uint64_t i = 0, j = 0;</div>
-<div class="line"><span class="lineno">   32</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> eulerTotient(num + 1);</div>
-<div class="line"><span class="lineno">   33</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> sumOfEulerTotient(num + 1);</div>
+<div class="line"><span class="lineno">   32</span>    std::vector&lt;uint64_t&gt; eulerTotient(num + 1);</div>
+<div class="line"><span class="lineno">   33</span>    std::vector&lt;uint64_t&gt; sumOfEulerTotient(num + 1);</div>
 <div class="line"><span class="lineno">   34</span> </div>
 <div class="line"><span class="lineno">   35</span>    <span class="comment">// storing initial values in eulerTotient vector</span></div>
 <div class="line"><span class="lineno">   36</span>    <span class="keywordflow">for</span> (i = 1; i &lt;= num; i++) {</div>
@@ -1241,7 +1242,6 @@ false if number is not a prime. </dd></dl>
 <div class="line"><span class="lineno">   56</span> </div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordflow">return</span> ((sumOfEulerTotient[num] + 1) * num) / 2;</div>
 <div class="line"><span class="lineno">   58</span>}</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>
 </div>
@@ -1266,6 +1266,8 @@ false if number is not a prime. </dd></dl>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>if number is a magic number, returns true, else false. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d44/magic__number_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../d9/d44/magic__number_8cpp_source.html">magic_number.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   33</span>                                     {</div>
 <div class="line"><span class="lineno">   34</span>    <span class="keywordflow">if</span> (n &lt;= 0) {</div>
 <div class="line"><span class="lineno">   35</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
@@ -1319,6 +1321,8 @@ template&lt;class T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>ans \( \binom{n}{r} \) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/dbb/n__choose__r_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../d1/dbb/n__choose__r_8cpp_source.html">n_choose_r.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   35</span>                       {</div>
 <div class="line"><span class="lineno">   36</span>    <span class="keywordflow">if</span> (r &gt; n / 2) {</div>
 <div class="line"><span class="lineno">   37</span>        r = n - r;  <span class="comment">// Because of the fact that  nCr(n, r) == nCr(n, n - r)</span></div>
@@ -1363,6 +1367,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>surface perimeter of the polygon </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html#l00099">99</a> of file <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html">perimeter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   99</span>                                                 {</div>
 <div class="line"><span class="lineno">  100</span>    <span class="keywordflow">return</span> sides * length;</div>
 <div class="line"><span class="lineno">  101</span>}</div>
@@ -1399,15 +1405,12 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>area of the parallelogram </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d82/area_8cpp_source.html#l00075">75</a> of file <a class="el" href="../../dc/d82/area_8cpp_source.html">area.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   75</span>                                       {</div>
 <div class="line"><span class="lineno">   76</span>    <span class="keywordflow">return</span> base * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>;</div>
 <div class="line"><span class="lineno">   77</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.svg" width="403" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0efb235330ff48e14fd31faaccbcebb3" name="a0efb235330ff48e14fd31faaccbcebb3"></a>
@@ -1440,15 +1443,12 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>perimeter of the parallelogram </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html#l00075">75</a> of file <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html">perimeter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   75</span>                                            {</div>
 <div class="line"><span class="lineno">   76</span>    <span class="keywordflow">return</span> 2 * (base + <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>);</div>
 <div class="line"><span class="lineno">   77</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.svg" width="371" height="68"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac37d3ba52eb296597d7a024ba8c4a5a5" name="ac37d3ba52eb296597d7a024ba8c4a5a5"></a>
@@ -1473,6 +1473,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d23/eulers__totient__function_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../da/d23/eulers__totient__function_8cpp_source.html">eulers_totient_function.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   41</span>                                 {</div>
 <div class="line"><span class="lineno">   42</span>    uint64_t result = n;</div>
 <div class="line"><span class="lineno">   43</span>    <span class="keywordflow">for</span> (uint64_t i = 2; i * i &lt;= n; i++) {</div>
@@ -1530,19 +1532,19 @@ Here is the call graph for this function:</div>
 <p>If b is odd, multiply a with answer</p>
 <p>b must be even now</p>
 <p>b = b/2</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d0/d6d/modular__exponentiation_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../d0/d6d/modular__exponentiation_8cpp_source.html">modular_exponentiation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   35</span>                                                   {</div>
-<div class="line"><span class="lineno">   36</span>    uint64_t ans = 1;  <span class="comment">/// Initialize the answer to be returned</span></div>
-<div class="line"><span class="lineno">   37</span>    a = a % c;         <span class="comment">/// Update a if it is more than or equal to c</span></div>
+<div class="line"><span class="lineno">   36</span>    uint64_t ans = 1;  </div>
+<div class="line"><span class="lineno">   37</span>    a = a % c;         </div>
 <div class="line"><span class="lineno">   38</span>    <span class="keywordflow">if</span> (a == 0) {</div>
-<div class="line"><span class="lineno">   39</span>        <span class="keywordflow">return</span> 0;  <span class="comment">/// In case a is divisible by c;</span></div>
+<div class="line"><span class="lineno">   39</span>        <span class="keywordflow">return</span> 0;  </div>
 <div class="line"><span class="lineno">   40</span>    }</div>
-<div class="line"><span class="lineno">   41</span>    <span class="keywordflow">while</span> (b &gt; 0) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   42</span><span class="comment">        /// If b is odd, multiply a with answer</span></div>
-<div class="line"><span class="lineno">   43</span><span class="comment"></span>        <span class="keywordflow">if</span> (b &amp; 1) {</div>
+<div class="line"><span class="lineno">   41</span>    <span class="keywordflow">while</span> (b &gt; 0) {</div>
+<div class="line"><span class="lineno">   43</span>        <span class="keywordflow">if</span> (b &amp; 1) {</div>
 <div class="line"><span class="lineno">   44</span>            ans = ((ans % c) * (a % c)) % c;</div>
-<div class="line"><span class="lineno">   45</span>        }<span class="comment"></span></div>
-<div class="line"><span class="lineno">   46</span><span class="comment">        /// b must be even now</span></div>
-<div class="line"><span class="lineno">   47</span><span class="comment"></span>        b = b &gt;&gt; 1;  <span class="comment">/// b = b/2</span></div>
+<div class="line"><span class="lineno">   45</span>        }</div>
+<div class="line"><span class="lineno">   47</span>        b = b &gt;&gt; 1;  </div>
 <div class="line"><span class="lineno">   48</span>        a = ((a % c) * (a % c)) % c;</div>
 <div class="line"><span class="lineno">   49</span>    }</div>
 <div class="line"><span class="lineno">   50</span>    <span class="keywordflow">return</span> ans;</div>
@@ -1576,10 +1578,10 @@ Here is the call graph for this function:</div>
 <dd>
 0 if n is NOT a power of 2 </dd></dl>
 <p>result stores the bitwise and of n and n-1</p>
-<div class="fragment"><div class="line"><span class="lineno">   42</span>                        {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   43</span><span class="comment">    /// result stores the</span></div>
-<div class="line"><span class="lineno">   44</span><span class="comment">    /// bitwise and of n and n-1</span></div>
-<div class="line"><span class="lineno">   45</span><span class="comment"></span>    <span class="keywordtype">int</span> result = n &amp; (n - 1);</div>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/d38/power__of__two_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../d4/d38/power__of__two_8cpp_source.html">power_of_two.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   42</span>                        {</div>
+<div class="line"><span class="lineno">   45</span>    <span class="keywordtype">int</span> result = n &amp; (n - 1);</div>
 <div class="line"><span class="lineno">   46</span>    </div>
 <div class="line"><span class="lineno">   47</span>    <span class="keywordflow">if</span> (result == 0) {</div>
 <div class="line"><span class="lineno">   48</span>        <span class="keywordflow">return</span> 1;</div>
@@ -1599,13 +1601,13 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void math::print_primes </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>primes</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; bool &gt; const &amp;</td>          <td class="paramname"><span class="paramname"><em>primes</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
 </div><div class="memdoc">
 
-<p>Prints all the indexes of true values in the passed <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>. </p>
+<p>Prints all the indexes of true values in the passed std::vector. </p>
 <dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramname">primes</td><td>The vector that has been passed through <code>sieve(...)</code> </td></tr>
@@ -1613,23 +1615,17 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/da6/eratosthenes_8cpp_source.html#l00051">51</a> of file <a class="el" href="../../d7/da6/eratosthenes_8cpp_source.html">eratosthenes.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   51</span>                                                 {</div>
-<div class="line"><span class="lineno">   52</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; <a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
+<div class="line"><span class="lineno">   52</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; <a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>.size(); i++) {</div>
 <div class="line"><span class="lineno">   53</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>[i]) {</div>
-<div class="line"><span class="lineno">   54</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <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">   54</span>            std::cout &lt;&lt; i &lt;&lt; std::endl;</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>}</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="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="aprime__numbers_8cpp_html_a9575f3a51eeb8a57d657b3db6a4b441a"><div class="ttname"><a href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a></div><div class="ttdeci">std::vector&lt; int &gt; primes(size_t max)</div><div class="ttdef"><b>Definition</b> prime_numbers.cpp:12</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><!-- 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="../../dd/d47/namespacemath_ad09d59850865012a6fd95d89954c82e4_cgraph.svg" width="527" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aprime__numbers_8cpp_html_a9575f3a51eeb8a57d657b3db6a4b441a"><div class="ttname"><a href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a></div><div class="ttdeci">std::vector&lt; int &gt; primes(size_t max)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d9b/prime__numbers_8cpp_source.html#l00012">prime_numbers.cpp:12</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a94db02b3c9e55a69ac1696f30e2f761c" name="a94db02b3c9e55a69ac1696f30e2f761c"></a>
@@ -1668,15 +1664,12 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The volume of the pyramid </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d39/volume_8cpp_source.html#l00080">80</a> of file <a class="el" href="../../da/d39/volume_8cpp_source.html">volume.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   80</span>                                              {</div>
 <div class="line"><span class="lineno">   81</span>    <span class="keywordflow">return</span> length * width * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> / 3;</div>
 <div class="line"><span class="lineno">   82</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.svg" width="390" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aacb1411ef2029e81f249c21e17c96fdb" name="aacb1411ef2029e81f249c21e17c96fdb"></a>
@@ -1686,7 +1679,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>&lt; long double &gt;, 2 &gt; math::quadraticEquation </td>
+          <td class="memname">std::array&lt; std::complex&lt; long double &gt;, 2 &gt; math::quadraticEquation </td>
           <td>(</td>
           <td class="paramtype">long double</td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
         </tr>
@@ -1713,15 +1706,17 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Array containing the roots of quadratic equation, incl. complex root. </dd></dl>
-<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html#a1">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/quadratic_equations_complex_numbers.cpp</a>.</dd>
+<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html#a0">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/quadratic_equations_complex_numbers.cpp</a>.</dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d18/quadratic__equations__complex__numbers_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../da/d18/quadratic__equations__complex__numbers_8cpp_source.html">quadratic_equations_complex_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   55</span>                                                                          {</div>
 <div class="line"><span class="lineno">   56</span>    <span class="keywordflow">if</span> (a == 0) {</div>
-<div class="line"><span class="lineno">   57</span>        <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>(<span class="stringliteral">&quot;quadratic coefficient cannot be 0&quot;</span>);</div>
+<div class="line"><span class="lineno">   57</span>        <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;quadratic coefficient cannot be 0&quot;</span>);</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">long</span> <span class="keywordtype">double</span> discriminant = b * b - 4 * a * c;</div>
-<div class="line"><span class="lineno">   61</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::complex&lt;long double&gt;</a>, 2&gt; solutions{0, 0};</div>
+<div class="line"><span class="lineno">   61</span>    std::array&lt;std::complex&lt;long double&gt;, 2&gt; solutions{0, 0};</div>
 <div class="line"><span class="lineno">   62</span> </div>
 <div class="line"><span class="lineno">   63</span>    <span class="keywordflow">if</span> (discriminant == 0) {</div>
 <div class="line"><span class="lineno">   64</span>        solutions[0] = -b * 0.5 / a;</div>
@@ -1736,30 +1731,22 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   73</span>    <span class="keywordflow">if</span> (discriminant &gt; 0) {</div>
 <div class="line"><span class="lineno">   74</span>        <span class="comment">// Since discriminant &gt; 0, there are only real roots. Therefore,</span></div>
 <div class="line"><span class="lineno">   75</span>        <span class="comment">// imaginary component = 0.</span></div>
-<div class="line"><span class="lineno">   76</span>        solutions[0] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{</div>
-<div class="line"><span class="lineno">   77</span>            (-b - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(discriminant)) * 0.5 / a, 0};</div>
-<div class="line"><span class="lineno">   78</span>        solutions[1] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{</div>
-<div class="line"><span class="lineno">   79</span>            (-b + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(discriminant)) * 0.5 / a, 0};</div>
+<div class="line"><span class="lineno">   76</span>        solutions[0] = std::complex&lt;long double&gt;{</div>
+<div class="line"><span class="lineno">   77</span>            (-b - std::sqrt(discriminant)) * 0.5 / a, 0};</div>
+<div class="line"><span class="lineno">   78</span>        solutions[1] = std::complex&lt;long double&gt;{</div>
+<div class="line"><span class="lineno">   79</span>            (-b + std::sqrt(discriminant)) * 0.5 / a, 0};</div>
 <div class="line"><span class="lineno">   80</span>        <span class="keywordflow">return</span> solutions;</div>
 <div class="line"><span class="lineno">   81</span>    }</div>
 <div class="line"><span class="lineno">   82</span>    <span class="comment">// Since b^2 - 4ac is &lt; 0, for faster computation, -discriminant is</span></div>
 <div class="line"><span class="lineno">   83</span>    <span class="comment">// enough to make it positive.</span></div>
-<div class="line"><span class="lineno">   84</span>    solutions[0] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{</div>
-<div class="line"><span class="lineno">   85</span>        -b * 0.5 / a, -<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(-discriminant) * 0.5 / a};</div>
-<div class="line"><span class="lineno">   86</span>    solutions[1] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{</div>
-<div class="line"><span class="lineno">   87</span>        -b * 0.5 / a, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(-discriminant) * 0.5 / a};</div>
+<div class="line"><span class="lineno">   84</span>    solutions[0] = std::complex&lt;long double&gt;{</div>
+<div class="line"><span class="lineno">   85</span>        -b * 0.5 / a, -std::sqrt(-discriminant) * 0.5 / a};</div>
+<div class="line"><span class="lineno">   86</span>    solutions[1] = std::complex&lt;long double&gt;{</div>
+<div class="line"><span class="lineno">   87</span>        -b * 0.5 / a, std::sqrt(-discriminant) * 0.5 / a};</div>
 <div class="line"><span class="lineno">   88</span> </div>
 <div class="line"><span class="lineno">   89</span>    <span class="keywordflow">return</span> solutions;</div>
 <div class="line"><span class="lineno">   90</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div></div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_aacb1411ef2029e81f249c21e17c96fdb_cgraph.svg" width="291" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ab31d141f7c5b551746b1eee0eb4dedca" name="ab31d141f7c5b551746b1eee0eb4dedca"></a>
@@ -1792,6 +1779,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>area of the rectangle </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d82/area_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../dc/d82/area_8cpp_source.html">area.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   40</span>                               {</div>
 <div class="line"><span class="lineno">   41</span>    <span class="keywordflow">return</span> length * width;</div>
 <div class="line"><span class="lineno">   42</span>}</div>
@@ -1828,6 +1817,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>perimeter of the rectangle </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html">perimeter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   40</span>                                    {</div>
 <div class="line"><span class="lineno">   41</span>    <span class="keywordflow">return</span> 2 * (length + width);</div>
 <div class="line"><span class="lineno">   42</span>}</div>
@@ -1870,15 +1861,12 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The volume of the rectangular prism </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d39/volume_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../da/d39/volume_8cpp_source.html">volume.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   41</span>                                                 {</div>
 <div class="line"><span class="lineno">   42</span>    <span class="keywordflow">return</span> length * width * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>;</div>
 <div class="line"><span class="lineno">   43</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.svg" width="404" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a91366864111e1fac29722ca45e02ea8f" name="a91366864111e1fac29722ca45e02ea8f"></a>
@@ -1890,7 +1878,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void math::sieve </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; *</td>          <td class="paramname"><span class="paramname"><em>vec</em></span></td><td>)</td>
+          <td class="paramtype">std::vector&lt; bool &gt; *</td>          <td class="paramname"><span class="paramname"><em>vec</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -1904,24 +1892,21 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d7/da6/eratosthenes_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../d7/da6/eratosthenes_8cpp_source.html">eratosthenes.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   33</span>                                 {</div>
 <div class="line"><span class="lineno">   34</span>    (*vec)[0] = <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   35</span>    (*vec)[1] = <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   36</span> </div>
 <div class="line"><span class="lineno">   37</span>    <span class="comment">// The sieve sets values to false as they are found not prime</span></div>
-<div class="line"><span class="lineno">   38</span>    <span class="keywordflow">for</span> (uint64_t n = 2; n &lt; vec-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); n++) {</div>
-<div class="line"><span class="lineno">   39</span>        <span class="keywordflow">for</span> (uint64_t multiple = n &lt;&lt; 1; multiple &lt; vec-&gt;<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>    <span class="keywordflow">for</span> (uint64_t n = 2; n &lt; vec-&gt;size(); n++) {</div>
+<div class="line"><span class="lineno">   39</span>        <span class="keywordflow">for</span> (uint64_t multiple = n &lt;&lt; 1; multiple &lt; vec-&gt;size();</div>
 <div class="line"><span class="lineno">   40</span>             multiple += n) {</div>
 <div class="line"><span class="lineno">   41</span>            (*vec)[multiple] = <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   42</span>        }</div>
 <div class="line"><span class="lineno">   43</span>    }</div>
 <div class="line"><span class="lineno">   44</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_a91366864111e1fac29722ca45e02ea8f_cgraph.svg" width="264" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ab7f29862d30df351c317eedd60a0c656" name="ab7f29862d30df351c317eedd60a0c656"></a>
@@ -1949,6 +1934,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>surface area of the sphere </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d82/area_8cpp_source.html#l00097">97</a> of file <a class="el" href="../../dc/d82/area_8cpp_source.html">area.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   97</span>                                {</div>
 <div class="line"><span class="lineno">   98</span>    <span class="keywordflow">return</span> 4 * M_PI * pow(radius, 2);</div>
 <div class="line"><span class="lineno">   99</span>}</div>
@@ -1985,15 +1972,12 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The volume of the sphere </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   91</span>                                            {</div>
-<div class="line"><span class="lineno">   92</span>    <span class="keywordflow">return</span> PI * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(radius, 3) * 4 / 3;</div>
-<div class="line"><span class="lineno">   93</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_a34d66a77c19ce9b8b3a3d14352b34551_cgraph.svg" width="276" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../da/d39/volume_8cpp_source.html#l00091">91</a> of file <a class="el" href="../../da/d39/volume_8cpp_source.html">volume.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   91</span>                                            {</div>
+<div class="line"><span class="lineno">   92</span>    <span class="keywordflow">return</span> PI * std::pow(radius, 3) * 4 / 3;</div>
+<div class="line"><span class="lineno">   93</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a971ce57e368f2f631cf1f4ff3f864049" name="a971ce57e368f2f631cf1f4ff3f864049"></a>
@@ -2021,6 +2005,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>area of square </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d82/area_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../dc/d82/area_8cpp_source.html">area.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   29</span>                        {</div>
 <div class="line"><span class="lineno">   30</span>    <span class="keywordflow">return</span> length * length;</div>
 <div class="line"><span class="lineno">   31</span>}</div>
@@ -2052,6 +2038,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>perimeter of square </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html">perimeter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   28</span>                             {</div>
 <div class="line"><span class="lineno">   29</span>    <span class="keywordflow">return</span> 4 * length;</div>
 <div class="line"><span class="lineno">   30</span>}</div>
@@ -2081,6 +2069,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Sum of the proper divisor of the number. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d5/df6/check__amicable__pair_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../d5/df6/check__amicable__pair_8cpp_source.html">check_amicable_pair.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   31</span>                            {</div>
 <div class="line"><span class="lineno">   32</span>    <span class="comment">// Variable to store the sum of all proper divisors.</span></div>
 <div class="line"><span class="lineno">   33</span>    <span class="keywordtype">int</span> sum = 1;</div>
@@ -2136,6 +2126,8 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/de9/integral__approximation_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../d1/de9/integral__approximation_8cpp_source.html">integral_approximation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>                                                                 {</div>
 <div class="line"><span class="lineno">   63</span>    assert(approx &gt;= expected * (1 - threshold));</div>
 <div class="line"><span class="lineno">   64</span>    assert(approx &lt;= expected * (1 + threshold));</div>
@@ -2173,15 +2165,12 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>area of the triangle </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d82/area_8cpp_source.html#l00052">52</a> of file <a class="el" href="../../dc/d82/area_8cpp_source.html">area.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   52</span>                                  {</div>
 <div class="line"><span class="lineno">   53</span>    <span class="keywordflow">return</span> base * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> / 2;</div>
 <div class="line"><span class="lineno">   54</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.svg" width="368" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a3d1e4db743b189f309327572663415f3" name="a3d1e4db743b189f309327572663415f3"></a>
@@ -2219,15 +2208,12 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>perimeter of the triangle </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html#l00052">52</a> of file <a class="el" href="../../d3/dfe/perimeter_8cpp_source.html">perimeter.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   52</span>                                                     {</div>
 <div class="line"><span class="lineno">   53</span>    <span class="keywordflow">return</span> base + <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> + hypotenuse;</div>
 <div class="line"><span class="lineno">   54</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.svg" width="398" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2d704a7b72a6b2db8b76c8581b577b2c" name="a2d704a7b72a6b2db8b76c8581b577b2c"></a>
@@ -2266,15 +2252,12 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The volume of the triangular prism </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d39/volume_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../da/d39/volume_8cpp_source.html">volume.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   67</span>                                                   {</div>
 <div class="line"><span class="lineno">   68</span>    <span class="keywordflow">return</span> base * <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> * depth / 2;</div>
 <div class="line"><span class="lineno">   69</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.svg" width="375" height="68"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.map b/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.map
deleted file mode 100644
index 964caa57b..000000000
--- a/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="math::parallelogram_perimeter" name="math::parallelogram_perimeter">
-<area shape="rect" id="Node000001" title="perimeter of a parallelogram 2(b + h)" alt="" coords="5,22,141,62"/>
-<area shape="rect" id="Node000002" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="189,29,245,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="141,40,173,40,173,45,141,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="197,30,193,21,195,11,204,5,217,3,231,5,239,12,235,16,229,10,217,8,206,10,200,14,198,20,202,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="293,29,365,55"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="245,40,277,40,277,45,245,45"/>
-</map>
diff --git a/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.md5 b/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.md5
deleted file mode 100644
index a4dfd65f0..000000000
--- a/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c05fe5822fb8081a031f69cf7259db85
\ No newline at end of file
diff --git a/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.svg b/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.svg
deleted file mode 100644
index df8c656bc..000000000
--- a/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::parallelogram_perimeter Pages: 1 -->
-<svg width="278pt" height="51pt"
- viewBox="0.00 0.00 278.00 50.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 46.88)">
-<title>math::parallelogram_perimeter</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="perimeter of a parallelogram 2(b + h)">
-<polygon fill="#999999" stroke="#666666" points="101.5,-30.5 0,-30.5 0,0 101.5,0 101.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::parallelogram</text>
-<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="179.75,-24.88 137.5,-24.88 137.5,-5.63 179.75,-5.63 179.75,-24.88"/>
-<text text-anchor="middle" x="158.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.9,-15.25C110.1,-15.25 118.4,-15.25 126,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.73,-18.75 135.73,-15.25 125.73,-11.75 125.73,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.44,-25.16C139.42,-33.77 143.82,-42.88 158.62,-42.88 166.72,-42.88 171.71,-40.15 173.58,-36.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.08,-35.99 172.05,-26.66 170.16,-37.08 177.08,-35.99"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270,-24.88 215.75,-24.88 215.75,-5.63 270,-5.63 270,-24.88"/>
-<text text-anchor="middle" x="242.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M179.96,-15.25C187.2,-15.25 195.61,-15.25 203.85,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="203.74,-18.75 213.74,-15.25 203.74,-11.75 203.74,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph_org.svg b/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph_org.svg
deleted file mode 100644
index 1b414e0ae..000000000
--- a/dd/d47/namespacemath_a0efb235330ff48e14fd31faaccbcebb3_cgraph_org.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::parallelogram_perimeter Pages: 1 -->
-<svg width="278pt" height="51pt"
- viewBox="0.00 0.00 278.00 50.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 46.88)">
-<title>math::parallelogram_perimeter</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="perimeter of a parallelogram 2(b + h)">
-<polygon fill="#999999" stroke="#666666" points="101.5,-30.5 0,-30.5 0,0 101.5,0 101.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::parallelogram</text>
-<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="179.75,-24.88 137.5,-24.88 137.5,-5.63 179.75,-5.63 179.75,-24.88"/>
-<text text-anchor="middle" x="158.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.9,-15.25C110.1,-15.25 118.4,-15.25 126,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.73,-18.75 135.73,-15.25 125.73,-11.75 125.73,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.44,-25.16C139.42,-33.77 143.82,-42.88 158.62,-42.88 166.72,-42.88 171.71,-40.15 173.58,-36.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.08,-35.99 172.05,-26.66 170.16,-37.08 177.08,-35.99"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270,-24.88 215.75,-24.88 215.75,-5.63 270,-5.63 270,-24.88"/>
-<text text-anchor="middle" x="242.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M179.96,-15.25C187.2,-15.25 195.61,-15.25 203.85,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="203.74,-18.75 213.74,-15.25 203.74,-11.75 203.74,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.map b/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.map
deleted file mode 100644
index ed660837a..000000000
--- a/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="math::cylinder_surface_perimeter" name="math::cylinder_surface_perimeter">
-<area shape="rect" id="Node000001" title="surface perimeter of a cylinder (2 * radius + 2 * height)" alt="" coords="5,22,159,62"/>
-<area shape="rect" id="Node000002" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="207,29,263,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,40,191,40,191,45,159,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="215,30,211,21,213,11,222,5,235,3,249,5,257,12,253,16,247,10,235,8,224,10,218,14,216,20,220,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="311,29,383,55"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="263,40,295,40,295,45,263,45"/>
-</map>
diff --git a/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.md5 b/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.md5
deleted file mode 100644
index 94f7c15a4..000000000
--- a/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-325e5824634ed33154b84be5401e645c
\ No newline at end of file
diff --git a/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.svg b/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.svg
deleted file mode 100644
index 4d994fe4f..000000000
--- a/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::cylinder_surface_perimeter Pages: 1 -->
-<svg width="292pt" height="51pt"
- viewBox="0.00 0.00 291.50 50.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 46.88)">
-<title>math::cylinder_surface_perimeter</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="surface perimeter of a cylinder (2 * radius + 2 * height)">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::cylinder_surface</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.25,-24.88 151,-24.88 151,-5.63 193.25,-5.63 193.25,-24.88"/>
-<text text-anchor="middle" x="172.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.47,-15.25C123.68,-15.25 131.87,-15.25 139.34,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.24,-18.75 149.24,-15.25 139.24,-11.75 139.24,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.94,-25.16C152.92,-33.77 157.32,-42.88 172.12,-42.88 180.22,-42.88 185.21,-40.15 187.08,-36.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.58,-35.99 185.55,-26.66 183.66,-37.08 190.58,-35.99"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.5,-24.88 229.25,-24.88 229.25,-5.63 283.5,-5.63 283.5,-24.88"/>
-<text text-anchor="middle" x="256.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.46,-15.25C200.7,-15.25 209.11,-15.25 217.35,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.24,-18.75 227.24,-15.25 217.24,-11.75 217.24,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph_org.svg b/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph_org.svg
deleted file mode 100644
index 8bcde1344..000000000
--- a/dd/d47/namespacemath_a1d4df7a4e43a2eac1acc0ac610487c73_cgraph_org.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::cylinder_surface_perimeter Pages: 1 -->
-<svg width="292pt" height="51pt"
- viewBox="0.00 0.00 291.50 50.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 46.88)">
-<title>math::cylinder_surface_perimeter</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="surface perimeter of a cylinder (2 * radius + 2 * height)">
-<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::cylinder_surface</text>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.25,-24.88 151,-24.88 151,-5.63 193.25,-5.63 193.25,-24.88"/>
-<text text-anchor="middle" x="172.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.47,-15.25C123.68,-15.25 131.87,-15.25 139.34,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.24,-18.75 149.24,-15.25 139.24,-11.75 139.24,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.94,-25.16C152.92,-33.77 157.32,-42.88 172.12,-42.88 180.22,-42.88 185.21,-40.15 187.08,-36.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.58,-35.99 185.55,-26.66 183.66,-37.08 190.58,-35.99"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.5,-24.88 229.25,-24.88 229.25,-5.63 283.5,-5.63 283.5,-24.88"/>
-<text text-anchor="middle" x="256.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.46,-15.25C200.7,-15.25 209.11,-15.25 217.35,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.24,-18.75 227.24,-15.25 217.24,-11.75 217.24,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.map b/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.map
deleted file mode 100644
index 30adcba29..000000000
--- a/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="math::triangle_prism_volume" name="math::triangle_prism_volume">
-<area shape="rect" id="Node000001" title="The volume of a triangular prism." alt="" coords="5,22,145,62"/>
-<area shape="rect" id="Node000002" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="193,29,249,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="145,40,177,40,177,45,145,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="201,30,197,21,199,11,208,5,221,3,235,5,243,12,239,16,233,10,221,8,210,10,204,14,202,20,206,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="297,29,369,55"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="249,40,281,40,281,45,249,45"/>
-</map>
diff --git a/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.md5 b/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.md5
deleted file mode 100644
index 66ceeb647..000000000
--- a/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2a58e73e090b32e13251525b65db17e4
\ No newline at end of file
diff --git a/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.svg b/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.svg
deleted file mode 100644
index 23672d4b8..000000000
--- a/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::triangle_prism_volume Pages: 1 -->
-<svg width="281pt" height="51pt"
- viewBox="0.00 0.00 281.00 50.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 46.88)">
-<title>math::triangle_prism_volume</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The volume of a triangular prism.">
-<polygon fill="#999999" stroke="#666666" points="104.5,-30.5 0,-30.5 0,0 104.5,0 104.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::triangle_prism</text>
-<text text-anchor="middle" x="52.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="182.75,-24.88 140.5,-24.88 140.5,-5.63 182.75,-5.63 182.75,-24.88"/>
-<text text-anchor="middle" x="161.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.74,-15.25C113,-15.25 121.34,-15.25 128.96,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.71,-18.75 138.71,-15.25 128.71,-11.75 128.71,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.44,-25.16C142.42,-33.77 146.82,-42.88 161.62,-42.88 169.72,-42.88 174.71,-40.15 176.58,-36.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.08,-35.99 175.05,-26.66 173.16,-37.08 180.08,-35.99"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273,-24.88 218.75,-24.88 218.75,-5.63 273,-5.63 273,-24.88"/>
-<text text-anchor="middle" x="245.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.96,-15.25C190.2,-15.25 198.61,-15.25 206.85,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.74,-18.75 216.74,-15.25 206.74,-11.75 206.74,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph_org.svg b/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph_org.svg
deleted file mode 100644
index b7e24b380..000000000
--- a/dd/d47/namespacemath_a2d704a7b72a6b2db8b76c8581b577b2c_cgraph_org.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::triangle_prism_volume Pages: 1 -->
-<svg width="281pt" height="51pt"
- viewBox="0.00 0.00 281.00 50.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 46.88)">
-<title>math::triangle_prism_volume</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The volume of a triangular prism.">
-<polygon fill="#999999" stroke="#666666" points="104.5,-30.5 0,-30.5 0,0 104.5,0 104.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::triangle_prism</text>
-<text text-anchor="middle" x="52.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="182.75,-24.88 140.5,-24.88 140.5,-5.63 182.75,-5.63 182.75,-24.88"/>
-<text text-anchor="middle" x="161.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.74,-15.25C113,-15.25 121.34,-15.25 128.96,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.71,-18.75 138.71,-15.25 128.71,-11.75 128.71,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.44,-25.16C142.42,-33.77 146.82,-42.88 161.62,-42.88 169.72,-42.88 174.71,-40.15 176.58,-36.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.08,-35.99 175.05,-26.66 173.16,-37.08 180.08,-35.99"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273,-24.88 218.75,-24.88 218.75,-5.63 273,-5.63 273,-24.88"/>
-<text text-anchor="middle" x="245.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.96,-15.25C190.2,-15.25 198.61,-15.25 206.85,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.74,-18.75 216.74,-15.25 206.74,-11.75 206.74,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d47/namespacemath_a34d66a77c19ce9b8b3a3d14352b34551_cgraph.map b/dd/d47/namespacemath_a34d66a77c19ce9b8b3a3d14352b34551_cgraph.map
deleted file mode 100644
index fed18a97b..000000000
--- a/dd/d47/namespacemath_a34d66a77c19ce9b8b3a3d14352b34551_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="math::sphere_volume" name="math::sphere_volume">
-<area shape="rect" id="Node000001" title="The volume of a sphere" alt="" coords="5,5,152,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="200,5,271,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="152,16,184,16,184,21,152,21"/>
-</map>
diff --git a/dd/d47/namespacemath_a34d66a77c19ce9b8b3a3d14352b34551_cgraph.md5 b/dd/d47/namespacemath_a34d66a77c19ce9b8b3a3d14352b34551_cgraph.md5
deleted file mode 100644
index c0781aa7b..000000000
--- a/dd/d47/namespacemath_a34d66a77c19ce9b8b3a3d14352b34551_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b82c5d6b29f9cbdf1c70365b45fe14f3
\ No newline at end of file
diff --git a/dd/d47/namespacemath_a34d66a77c19ce9b8b3a3d14352b34551_cgraph.svg b/dd/d47/namespacemath_a34d66a77c19ce9b8b3a3d14352b34551_cgraph.svg
deleted file mode 100644
index 642c199bb..000000000
--- a/dd/d47/namespacemath_a34d66a77c19ce9b8b3a3d14352b34551_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::sphere_volume Pages: 1 -->
-<svg width="207pt" height="27pt"
- viewBox="0.00 0.00 207.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>math::sphere_volume</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The volume of a sphere">
-<polygon fill="#999999" stroke="#666666" points="109.75,-19.25 0,-19.25 0,0 109.75,0 109.75,-19.25"/>
-<text text-anchor="middle" x="54.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sphere_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="199.25,-19.25 145.75,-19.25 145.75,0 199.25,0 199.25,-19.25"/>
-<text text-anchor="middle" x="172.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.96,-9.62C118.06,-9.62 126.26,-9.62 133.92,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.9,-13.13 143.9,-9.63 133.9,-6.13 133.9,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d47/namespacemath_a34d66a77c19ce9b8b3a3d14352b34551_cgraph_org.svg b/dd/d47/namespacemath_a34d66a77c19ce9b8b3a3d14352b34551_cgraph_org.svg
deleted file mode 100644
index 7bde6ba9b..000000000
--- a/dd/d47/namespacemath_a34d66a77c19ce9b8b3a3d14352b34551_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::sphere_volume Pages: 1 -->
-<svg width="207pt" height="27pt"
- viewBox="0.00 0.00 207.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>math::sphere_volume</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The volume of a sphere">
-<polygon fill="#999999" stroke="#666666" points="109.75,-19.25 0,-19.25 0,0 109.75,0 109.75,-19.25"/>
-<text text-anchor="middle" x="54.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sphere_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="199.25,-19.25 145.75,-19.25 145.75,0 199.25,0 199.25,-19.25"/>
-<text text-anchor="middle" x="172.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.96,-9.62C118.06,-9.62 126.26,-9.62 133.92,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.9,-13.13 143.9,-9.63 133.9,-6.13 133.9,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.map b/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.map
deleted file mode 100644
index bf5e1762c..000000000
--- a/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="math::triangle_perimeter" name="math::triangle_perimeter">
-<area shape="rect" id="Node000001" title="perimeter of a triangle (a + b + c)" alt="" coords="5,29,167,55"/>
-<area shape="rect" id="Node000002" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="215,29,271,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="167,40,199,40,199,45,167,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="223,30,219,21,221,11,230,5,243,3,257,5,265,12,261,16,255,10,243,8,232,10,226,14,224,20,228,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="319,29,391,55"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="271,40,303,40,303,45,271,45"/>
-</map>
diff --git a/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.md5 b/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.md5
deleted file mode 100644
index 1399f2368..000000000
--- a/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-191dd02c79d537f80689e673fa553dcf
\ No newline at end of file
diff --git a/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.svg b/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.svg
deleted file mode 100644
index 1da40322f..000000000
--- a/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::triangle_perimeter Pages: 1 -->
-<svg width="298pt" height="45pt"
- viewBox="0.00 0.00 297.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>math::triangle_perimeter</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="perimeter of a triangle (a + b + c)">
-<polygon fill="#999999" stroke="#666666" points="121,-19.25 0,-19.25 0,0 121,0 121,-19.25"/>
-<text text-anchor="middle" x="60.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::triangle_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="199.25,-19.25 157,-19.25 157,0 199.25,0 199.25,-19.25"/>
-<text text-anchor="middle" x="178.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.34,-9.62C129.56,-9.62 137.73,-9.62 145.17,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.02,-13.13 155.02,-9.63 145.02,-6.13 145.02,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M164.94,-19.54C158.92,-28.15 163.32,-37.25 178.12,-37.25 186.22,-37.25 191.21,-34.53 193.08,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.58,-30.36 191.55,-21.03 189.66,-31.46 196.58,-30.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="289.5,-19.25 235.25,-19.25 235.25,0 289.5,0 289.5,-19.25"/>
-<text text-anchor="middle" x="262.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.46,-9.62C206.7,-9.62 215.11,-9.62 223.35,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="223.24,-13.13 233.24,-9.63 223.24,-6.13 223.24,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph_org.svg b/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph_org.svg
deleted file mode 100644
index a28531b32..000000000
--- a/dd/d47/namespacemath_a3d1e4db743b189f309327572663415f3_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::triangle_perimeter Pages: 1 -->
-<svg width="298pt" height="45pt"
- viewBox="0.00 0.00 297.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>math::triangle_perimeter</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="perimeter of a triangle (a + b + c)">
-<polygon fill="#999999" stroke="#666666" points="121,-19.25 0,-19.25 0,0 121,0 121,-19.25"/>
-<text text-anchor="middle" x="60.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::triangle_perimeter</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="199.25,-19.25 157,-19.25 157,0 199.25,0 199.25,-19.25"/>
-<text text-anchor="middle" x="178.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.34,-9.62C129.56,-9.62 137.73,-9.62 145.17,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.02,-13.13 155.02,-9.63 145.02,-6.13 145.02,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M164.94,-19.54C158.92,-28.15 163.32,-37.25 178.12,-37.25 186.22,-37.25 191.21,-34.53 193.08,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.58,-30.36 191.55,-21.03 189.66,-31.46 196.58,-30.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="289.5,-19.25 235.25,-19.25 235.25,0 289.5,0 289.5,-19.25"/>
-<text text-anchor="middle" x="262.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.46,-9.62C206.7,-9.62 215.11,-9.62 223.35,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="223.24,-13.13 233.24,-9.63 223.24,-6.13 223.24,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.map b/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.map
deleted file mode 100644
index 22ded6048..000000000
--- a/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="math::rect_prism_volume" name="math::rect_prism_volume">
-<area shape="rect" id="Node000001" title="The volume of a rectangular prism." alt="" coords="5,29,174,55"/>
-<area shape="rect" id="Node000002" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="222,29,278,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="174,40,206,40,206,45,174,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="230,30,226,21,228,11,237,5,250,3,264,5,272,12,268,16,262,10,250,8,239,10,233,14,231,20,235,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="326,29,398,55"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="278,40,310,40,310,45,278,45"/>
-</map>
diff --git a/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.md5 b/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.md5
deleted file mode 100644
index acf93cd9d..000000000
--- a/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3e9f60973e0ce5359bc63fadc050f876
\ No newline at end of file
diff --git a/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.svg b/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.svg
deleted file mode 100644
index 0c81b204c..000000000
--- a/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::rect_prism_volume Pages: 1 -->
-<svg width="303pt" height="45pt"
- viewBox="0.00 0.00 302.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>math::rect_prism_volume</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The volume of a rectangular prism.">
-<polygon fill="#999999" stroke="#666666" points="126.25,-19.25 0,-19.25 0,0 126.25,0 126.25,-19.25"/>
-<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::rect_prism_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.5,-19.25 162.25,-19.25 162.25,0 204.5,0 204.5,-19.25"/>
-<text text-anchor="middle" x="183.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.71,-9.62C134.97,-9.62 143.15,-9.62 150.58,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.4,-13.13 160.4,-9.63 150.4,-6.13 150.4,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.19,-19.54C164.17,-28.15 168.57,-37.25 183.38,-37.25 191.47,-37.25 196.46,-34.53 198.33,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.83,-30.36 196.8,-21.03 194.91,-31.46 201.83,-30.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294.75,-19.25 240.5,-19.25 240.5,0 294.75,0 294.75,-19.25"/>
-<text text-anchor="middle" x="267.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.71,-9.62C211.95,-9.62 220.36,-9.62 228.6,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.49,-13.13 238.49,-9.63 228.49,-6.13 228.49,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph_org.svg b/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph_org.svg
deleted file mode 100644
index 99a9b71cb..000000000
--- a/dd/d47/namespacemath_a3fdc74c24697ec5bb5c3698c96117c12_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::rect_prism_volume Pages: 1 -->
-<svg width="303pt" height="45pt"
- viewBox="0.00 0.00 302.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>math::rect_prism_volume</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The volume of a rectangular prism.">
-<polygon fill="#999999" stroke="#666666" points="126.25,-19.25 0,-19.25 0,0 126.25,0 126.25,-19.25"/>
-<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::rect_prism_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.5,-19.25 162.25,-19.25 162.25,0 204.5,0 204.5,-19.25"/>
-<text text-anchor="middle" x="183.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.71,-9.62C134.97,-9.62 143.15,-9.62 150.58,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.4,-13.13 160.4,-9.63 150.4,-6.13 150.4,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.19,-19.54C164.17,-28.15 168.57,-37.25 183.38,-37.25 191.47,-37.25 196.46,-34.53 198.33,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.83,-30.36 196.8,-21.03 194.91,-31.46 201.83,-30.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294.75,-19.25 240.5,-19.25 240.5,0 294.75,0 294.75,-19.25"/>
-<text text-anchor="middle" x="267.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.71,-9.62C211.95,-9.62 220.36,-9.62 228.6,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.49,-13.13 238.49,-9.63 228.49,-6.13 228.49,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.map b/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.map
deleted file mode 100644
index ba023feeb..000000000
--- a/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="math::cone_volume" name="math::cone_volume">
-<area shape="rect" id="Node000001" title="The volume of a cone" alt="" coords="5,55,141,80"/>
-<area shape="rect" id="Node000002" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="196,29,252,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="141,53,181,47,182,52,142,59"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="189,79,260,104"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="142,76,174,81,173,86,141,81"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="203,30,199,21,202,11,210,5,224,3,239,5,247,12,244,16,237,10,224,8,212,10,206,14,205,20,208,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="308,29,380,55"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="253,40,292,40,292,45,253,45"/>
-</map>
diff --git a/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.md5 b/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.md5
deleted file mode 100644
index 92e070588..000000000
--- a/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-012763b871fcd828b383cf67a6734c86
\ No newline at end of file
diff --git a/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.svg b/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.svg
deleted file mode 100644
index 227ca6f4d..000000000
--- a/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph.svg
+++ /dev/null
@@ -1,110 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::cone_volume Pages: 1 -->
-<svg width="289pt" height="82pt"
- viewBox="0.00 0.00 289.25 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>math::cone_volume</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The volume of a cone">
-<polygon fill="#999999" stroke="#666666" points="101.5,-37.25 0,-37.25 0,-18 101.5,-18 101.5,-37.25"/>
-<text text-anchor="middle" x="50.75" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cone_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="185.38,-56.25 143.12,-56.25 143.12,-37 185.38,-37 185.38,-56.25"/>
-<text text-anchor="middle" x="164.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.95,-36.18C112.12,-37.91 122.52,-39.69 131.81,-41.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.94,-44.67 141.39,-42.9 132.12,-37.77 130.94,-44.67"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191,-19.25 137.5,-19.25 137.5,0 191,0 191,-19.25"/>
-<text text-anchor="middle" x="164.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.95,-19.52C110.02,-18.22 118.23,-16.89 125.92,-15.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.29,-19.14 135.61,-14.09 125.18,-12.23 126.29,-19.14"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.18,-56.54C143.76,-65.15 148.45,-74.25 164.25,-74.25 172.89,-74.25 178.21,-71.53 180.2,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.69,-67.31 178.57,-58.03 176.79,-68.47 183.69,-67.31"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="281.25,-56.25 227,-56.25 227,-37 281.25,-37 281.25,-56.25"/>
-<text text-anchor="middle" x="254.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.63,-46.62C194.47,-46.62 205.12,-46.62 215.32,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.01,-50.13 225.01,-46.63 215.01,-43.13 215.01,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph_org.svg b/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph_org.svg
deleted file mode 100644
index 48685627e..000000000
--- a/dd/d47/namespacemath_a3fe35440c27758ecc2287e08217d63a7_cgraph_org.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::cone_volume Pages: 1 -->
-<svg width="289pt" height="82pt"
- viewBox="0.00 0.00 289.25 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>math::cone_volume</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The volume of a cone">
-<polygon fill="#999999" stroke="#666666" points="101.5,-37.25 0,-37.25 0,-18 101.5,-18 101.5,-37.25"/>
-<text text-anchor="middle" x="50.75" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cone_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="185.38,-56.25 143.12,-56.25 143.12,-37 185.38,-37 185.38,-56.25"/>
-<text text-anchor="middle" x="164.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.95,-36.18C112.12,-37.91 122.52,-39.69 131.81,-41.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.94,-44.67 141.39,-42.9 132.12,-37.77 130.94,-44.67"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191,-19.25 137.5,-19.25 137.5,0 191,0 191,-19.25"/>
-<text text-anchor="middle" x="164.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.95,-19.52C110.02,-18.22 118.23,-16.89 125.92,-15.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.29,-19.14 135.61,-14.09 125.18,-12.23 126.29,-19.14"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.18,-56.54C143.76,-65.15 148.45,-74.25 164.25,-74.25 172.89,-74.25 178.21,-71.53 180.2,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.69,-67.31 178.57,-58.03 176.79,-68.47 183.69,-67.31"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="281.25,-56.25 227,-56.25 227,-37 281.25,-37 281.25,-56.25"/>
-<text text-anchor="middle" x="254.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.63,-46.62C194.47,-46.62 205.12,-46.62 215.32,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.01,-50.13 225.01,-46.63 215.01,-43.13 215.01,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.map b/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.map
deleted file mode 100644
index 8c4ca8717..000000000
--- a/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="math::parallelogram_area" name="math::parallelogram_area">
-<area shape="rect" id="Node000001" title="area of a parallelogram (b * h)" alt="" coords="5,29,173,55"/>
-<area shape="rect" id="Node000002" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="221,29,277,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="173,40,205,40,205,45,173,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="229,30,225,21,227,11,236,5,249,3,263,5,271,12,267,16,261,10,249,8,238,10,232,14,230,20,234,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="325,29,397,55"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="277,40,309,40,309,45,277,45"/>
-</map>
diff --git a/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.md5 b/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.md5
deleted file mode 100644
index a48242d45..000000000
--- a/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f2e905a032266c284362f085007ec880
\ No newline at end of file
diff --git a/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.svg b/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.svg
deleted file mode 100644
index 012d8f58b..000000000
--- a/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::parallelogram_area Pages: 1 -->
-<svg width="302pt" height="45pt"
- viewBox="0.00 0.00 302.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>math::parallelogram_area</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="area of a parallelogram (b * h)">
-<polygon fill="#999999" stroke="#666666" points="125.5,-19.25 0,-19.25 0,0 125.5,0 125.5,-19.25"/>
-<text text-anchor="middle" x="62.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::parallelogram_area</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203.75,-19.25 161.5,-19.25 161.5,0 203.75,0 203.75,-19.25"/>
-<text text-anchor="middle" x="182.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.79,-9.62C134.07,-9.62 142.26,-9.62 149.71,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.57,-13.13 159.57,-9.63 149.57,-6.13 149.57,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M169.44,-19.54C163.42,-28.15 167.82,-37.25 182.62,-37.25 190.72,-37.25 195.71,-34.53 197.58,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.08,-30.36 196.05,-21.03 194.16,-31.46 201.08,-30.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-19.25 239.75,-19.25 239.75,0 294,0 294,-19.25"/>
-<text text-anchor="middle" x="266.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.96,-9.62C211.2,-9.62 219.61,-9.62 227.85,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.74,-13.13 237.74,-9.63 227.74,-6.13 227.74,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph_org.svg b/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph_org.svg
deleted file mode 100644
index 7f1f53dbd..000000000
--- a/dd/d47/namespacemath_a5de184925e68658f15415dd53954df4f_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::parallelogram_area Pages: 1 -->
-<svg width="302pt" height="45pt"
- viewBox="0.00 0.00 302.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>math::parallelogram_area</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="area of a parallelogram (b * h)">
-<polygon fill="#999999" stroke="#666666" points="125.5,-19.25 0,-19.25 0,0 125.5,0 125.5,-19.25"/>
-<text text-anchor="middle" x="62.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::parallelogram_area</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203.75,-19.25 161.5,-19.25 161.5,0 203.75,0 203.75,-19.25"/>
-<text text-anchor="middle" x="182.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.79,-9.62C134.07,-9.62 142.26,-9.62 149.71,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.57,-13.13 159.57,-9.63 149.57,-6.13 149.57,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M169.44,-19.54C163.42,-28.15 167.82,-37.25 182.62,-37.25 190.72,-37.25 195.71,-34.53 197.58,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.08,-30.36 196.05,-21.03 194.16,-31.46 201.08,-30.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-19.25 239.75,-19.25 239.75,0 294,0 294,-19.25"/>
-<text text-anchor="middle" x="266.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M203.96,-9.62C211.2,-9.62 219.61,-9.62 227.85,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.74,-13.13 237.74,-9.63 227.74,-6.13 227.74,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d47/namespacemath_a7e78996673df791014cfe540b183456a_cgraph.map b/dd/d47/namespacemath_a7e78996673df791014cfe540b183456a_cgraph.map
deleted file mode 100644
index f255fc380..000000000
--- a/dd/d47/namespacemath_a7e78996673df791014cfe540b183456a_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="math::factorial" name="math::factorial">
-<area shape="rect" id="Node000001" title="function to find factorial of given number" alt="" coords="5,29,110,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="39,30,35,21,37,11,45,5,58,3,71,5,78,12,74,16,68,10,57,8,47,10,42,14,41,20,44,28"/>
-</map>
diff --git a/dd/d47/namespacemath_a7e78996673df791014cfe540b183456a_cgraph.md5 b/dd/d47/namespacemath_a7e78996673df791014cfe540b183456a_cgraph.md5
deleted file mode 100644
index 47b657326..000000000
--- a/dd/d47/namespacemath_a7e78996673df791014cfe540b183456a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9c1da1cf91f0f3d2e5a05feaeb098384
\ No newline at end of file
diff --git a/dd/d47/namespacemath_a7e78996673df791014cfe540b183456a_cgraph.svg b/dd/d47/namespacemath_a7e78996673df791014cfe540b183456a_cgraph.svg
deleted file mode 100644
index cf4271593..000000000
--- a/dd/d47/namespacemath_a7e78996673df791014cfe540b183456a_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::factorial Pages: 1 -->
-<svg width="86pt" height="45pt"
- viewBox="0.00 0.00 86.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>math::factorial</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="function to find factorial of given number">
-<polygon fill="#999999" stroke="#666666" points="78.25,-19.25 0,-19.25 0,0 78.25,0 78.25,-19.25"/>
-<text text-anchor="middle" x="39.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::factorial</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.87,-19.54C21.29,-28.15 25.37,-37.25 39.12,-37.25 46.65,-37.25 51.28,-34.53 53.01,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.52,-30.42 51.6,-21.04 49.59,-31.44 56.52,-30.42"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d47/namespacemath_a7e78996673df791014cfe540b183456a_cgraph_org.svg b/dd/d47/namespacemath_a7e78996673df791014cfe540b183456a_cgraph_org.svg
deleted file mode 100644
index ac4c40108..000000000
--- a/dd/d47/namespacemath_a7e78996673df791014cfe540b183456a_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::factorial Pages: 1 -->
-<svg width="86pt" height="45pt"
- viewBox="0.00 0.00 86.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>math::factorial</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="function to find factorial of given number">
-<polygon fill="#999999" stroke="#666666" points="78.25,-19.25 0,-19.25 0,0 78.25,0 78.25,-19.25"/>
-<text text-anchor="middle" x="39.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::factorial</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.87,-19.54C21.29,-28.15 25.37,-37.25 39.12,-37.25 46.65,-37.25 51.28,-34.53 53.01,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.52,-30.42 51.6,-21.04 49.59,-31.44 56.52,-30.42"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph.map b/dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph.map
deleted file mode 100644
index 3771df1be..000000000
--- a/dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="math::are_amicable" name="math::are_amicable">
-<area shape="rect" id="Node000001" title="Function to check whether the pair is amicable or not." alt="" coords="5,5,141,31"/>
-<area shape="rect" id="Node000002" href="$dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" title="Function to calculate the sum of all the proper divisor of an integer." alt="" coords="189,5,335,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="141,16,173,16,173,21,141,21"/>
-</map>
diff --git a/dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph.md5 b/dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph.md5
deleted file mode 100644
index 48942e926..000000000
--- a/dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5a1e76eff5b60a59fdd7eae43d589d1a
\ No newline at end of file
diff --git a/dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph.svg b/dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph.svg
deleted file mode 100644
index 44aa2f09f..000000000
--- a/dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::are_amicable Pages: 1 -->
-<svg width="255pt" height="27pt"
- viewBox="0.00 0.00 255.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>math::are_amicable</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to check whether the pair is amicable or not.">
-<polygon fill="#999999" stroke="#666666" points="101.5,-19.25 0,-19.25 0,0 101.5,0 101.5,-19.25"/>
-<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::are_amicable</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" target="_top" xlink:title="Function to calculate the sum of all the proper divisor of an integer.">
-<polygon fill="white" stroke="#666666" points="247.25,-19.25 137.5,-19.25 137.5,0 247.25,0 247.25,-19.25"/>
-<text text-anchor="middle" x="192.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sum_of_divisor</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.76,-9.62C109.63,-9.62 117.87,-9.62 126.03,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.94,-13.13 135.94,-9.63 125.94,-6.13 125.94,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph_org.svg b/dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph_org.svg
deleted file mode 100644
index 1221e9e3a..000000000
--- a/dd/d47/namespacemath_a8e6eede206201db0d1dbb618fa969bec_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::are_amicable Pages: 1 -->
-<svg width="255pt" height="27pt"
- viewBox="0.00 0.00 255.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>math::are_amicable</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to check whether the pair is amicable or not.">
-<polygon fill="#999999" stroke="#666666" points="101.5,-19.25 0,-19.25 0,0 101.5,0 101.5,-19.25"/>
-<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::are_amicable</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a" target="_top" xlink:title="Function to calculate the sum of all the proper divisor of an integer.">
-<polygon fill="white" stroke="#666666" points="247.25,-19.25 137.5,-19.25 137.5,0 247.25,0 247.25,-19.25"/>
-<text text-anchor="middle" x="192.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sum_of_divisor</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.76,-9.62C109.63,-9.62 117.87,-9.62 126.03,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.94,-13.13 135.94,-9.63 125.94,-6.13 125.94,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d47/namespacemath_a91366864111e1fac29722ca45e02ea8f_cgraph.map b/dd/d47/namespacemath_a91366864111e1fac29722ca45e02ea8f_cgraph.map
deleted file mode 100644
index 3a489c1dc..000000000
--- a/dd/d47/namespacemath_a91366864111e1fac29722ca45e02ea8f_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="math::sieve" name="math::sieve">
-<area shape="rect" id="Node000001" title="Performs the sieve." alt="" coords="5,5,95,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="143,5,258,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="95,16,127,16,127,21,95,21"/>
-</map>
diff --git a/dd/d47/namespacemath_a91366864111e1fac29722ca45e02ea8f_cgraph.md5 b/dd/d47/namespacemath_a91366864111e1fac29722ca45e02ea8f_cgraph.md5
deleted file mode 100644
index 91fb25eed..000000000
--- a/dd/d47/namespacemath_a91366864111e1fac29722ca45e02ea8f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-db31d1963ebcd03160cd9304fd8b4da1
\ No newline at end of file
diff --git a/dd/d47/namespacemath_a91366864111e1fac29722ca45e02ea8f_cgraph.svg b/dd/d47/namespacemath_a91366864111e1fac29722ca45e02ea8f_cgraph.svg
deleted file mode 100644
index e6b132a25..000000000
--- a/dd/d47/namespacemath_a91366864111e1fac29722ca45e02ea8f_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::sieve Pages: 1 -->
-<svg width="198pt" height="27pt"
- viewBox="0.00 0.00 197.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>math::sieve</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Performs the sieve.">
-<polygon fill="#999999" stroke="#666666" points="67,-19.25 0,-19.25 0,0 67,0 67,-19.25"/>
-<text text-anchor="middle" x="33.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sieve</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.5,-19.25 103,-19.25 103,0 189.5,0 189.5,-19.25"/>
-<text text-anchor="middle" x="146.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M67.43,-9.62C74.97,-9.62 83.18,-9.62 91.35,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.28,-13.13 101.28,-9.63 91.28,-6.13 91.28,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d47/namespacemath_a91366864111e1fac29722ca45e02ea8f_cgraph_org.svg b/dd/d47/namespacemath_a91366864111e1fac29722ca45e02ea8f_cgraph_org.svg
deleted file mode 100644
index e1a855d51..000000000
--- a/dd/d47/namespacemath_a91366864111e1fac29722ca45e02ea8f_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::sieve Pages: 1 -->
-<svg width="198pt" height="27pt"
- viewBox="0.00 0.00 197.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>math::sieve</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Performs the sieve.">
-<polygon fill="#999999" stroke="#666666" points="67,-19.25 0,-19.25 0,0 67,0 67,-19.25"/>
-<text text-anchor="middle" x="33.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::sieve</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.5,-19.25 103,-19.25 103,0 189.5,0 189.5,-19.25"/>
-<text text-anchor="middle" x="146.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M67.43,-9.62C74.97,-9.62 83.18,-9.62 91.35,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.28,-13.13 101.28,-9.63 91.28,-6.13 91.28,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.map b/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.map
deleted file mode 100644
index 67e5a3f5d..000000000
--- a/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="math::pyramid_volume" name="math::pyramid_volume">
-<area shape="rect" id="Node000001" title="The volume of a pyramid" alt="" coords="5,29,159,55"/>
-<area shape="rect" id="Node000002" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="207,29,263,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,40,191,40,191,45,159,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="215,30,211,21,213,11,222,5,235,3,249,5,257,12,253,16,247,10,235,8,224,10,218,14,216,20,220,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="311,29,383,55"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="263,40,295,40,295,45,263,45"/>
-</map>
diff --git a/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.md5 b/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.md5
deleted file mode 100644
index f4be1433f..000000000
--- a/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-41bf653d9d48bb32d29822ad79a4e137
\ No newline at end of file
diff --git a/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.svg b/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.svg
deleted file mode 100644
index 76804d11e..000000000
--- a/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::pyramid_volume Pages: 1 -->
-<svg width="292pt" height="45pt"
- viewBox="0.00 0.00 291.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>math::pyramid_volume</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The volume of a pyramid">
-<polygon fill="#999999" stroke="#666666" points="115,-19.25 0,-19.25 0,0 115,0 115,-19.25"/>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::pyramid_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.25,-19.25 151,-19.25 151,0 193.25,0 193.25,-19.25"/>
-<text text-anchor="middle" x="172.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.47,-9.62C123.68,-9.62 131.87,-9.62 139.34,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.24,-13.13 149.24,-9.63 139.24,-6.13 139.24,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.94,-19.54C152.92,-28.15 157.32,-37.25 172.12,-37.25 180.22,-37.25 185.21,-34.53 187.08,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.58,-30.36 185.55,-21.03 183.66,-31.46 190.58,-30.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.5,-19.25 229.25,-19.25 229.25,0 283.5,0 283.5,-19.25"/>
-<text text-anchor="middle" x="256.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.46,-9.62C200.7,-9.62 209.11,-9.62 217.35,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.24,-13.13 227.24,-9.63 217.24,-6.13 217.24,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph_org.svg b/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph_org.svg
deleted file mode 100644
index c70b74489..000000000
--- a/dd/d47/namespacemath_a94db02b3c9e55a69ac1696f30e2f761c_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::pyramid_volume Pages: 1 -->
-<svg width="292pt" height="45pt"
- viewBox="0.00 0.00 291.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>math::pyramid_volume</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The volume of a pyramid">
-<polygon fill="#999999" stroke="#666666" points="115,-19.25 0,-19.25 0,0 115,0 115,-19.25"/>
-<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::pyramid_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="193.25,-19.25 151,-19.25 151,0 193.25,0 193.25,-19.25"/>
-<text text-anchor="middle" x="172.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.47,-9.62C123.68,-9.62 131.87,-9.62 139.34,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.24,-13.13 149.24,-9.63 139.24,-6.13 139.24,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M158.94,-19.54C152.92,-28.15 157.32,-37.25 172.12,-37.25 180.22,-37.25 185.21,-34.53 187.08,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.58,-30.36 185.55,-21.03 183.66,-31.46 190.58,-30.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.5,-19.25 229.25,-19.25 229.25,0 283.5,0 283.5,-19.25"/>
-<text text-anchor="middle" x="256.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.46,-9.62C200.7,-9.62 209.11,-9.62 217.35,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.24,-13.13 227.24,-9.63 217.24,-6.13 217.24,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d47/namespacemath_aacb1411ef2029e81f249c21e17c96fdb_cgraph.map b/dd/d47/namespacemath_aacb1411ef2029e81f249c21e17c96fdb_cgraph.map
deleted file mode 100644
index bd6e17e2d..000000000
--- a/dd/d47/namespacemath_aacb1411ef2029e81f249c21e17c96fdb_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="math::quadraticEquation" name="math::quadraticEquation">
-<area shape="rect" id="Node000001" title="Quadratic equation calculator." alt="" coords="5,5,168,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="216,5,285,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="168,16,200,16,200,21,168,21"/>
-</map>
diff --git a/dd/d47/namespacemath_aacb1411ef2029e81f249c21e17c96fdb_cgraph.md5 b/dd/d47/namespacemath_aacb1411ef2029e81f249c21e17c96fdb_cgraph.md5
deleted file mode 100644
index 2de8f6ded..000000000
--- a/dd/d47/namespacemath_aacb1411ef2029e81f249c21e17c96fdb_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6a7f4d87afb2383fe4bc01f981581452
\ No newline at end of file
diff --git a/dd/d47/namespacemath_aacb1411ef2029e81f249c21e17c96fdb_cgraph.svg b/dd/d47/namespacemath_aacb1411ef2029e81f249c21e17c96fdb_cgraph.svg
deleted file mode 100644
index cbf61051e..000000000
--- a/dd/d47/namespacemath_aacb1411ef2029e81f249c21e17c96fdb_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::quadraticEquation Pages: 1 -->
-<svg width="218pt" height="27pt"
- viewBox="0.00 0.00 217.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>math::quadraticEquation</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Quadratic equation calculator.">
-<polygon fill="#999999" stroke="#666666" points="121.75,-19.25 0,-19.25 0,0 121.75,0 121.75,-19.25"/>
-<text text-anchor="middle" x="60.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::quadraticEquation</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209.75,-19.25 157.75,-19.25 157.75,0 209.75,0 209.75,-19.25"/>
-<text text-anchor="middle" x="183.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.96,-9.62C130.2,-9.62 138.45,-9.62 146.1,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.02,-13.13 156.02,-9.63 146.02,-6.13 146.02,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d47/namespacemath_aacb1411ef2029e81f249c21e17c96fdb_cgraph_org.svg b/dd/d47/namespacemath_aacb1411ef2029e81f249c21e17c96fdb_cgraph_org.svg
deleted file mode 100644
index ba68cbde3..000000000
--- a/dd/d47/namespacemath_aacb1411ef2029e81f249c21e17c96fdb_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::quadraticEquation Pages: 1 -->
-<svg width="218pt" height="27pt"
- viewBox="0.00 0.00 217.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>math::quadraticEquation</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Quadratic equation calculator.">
-<polygon fill="#999999" stroke="#666666" points="121.75,-19.25 0,-19.25 0,0 121.75,0 121.75,-19.25"/>
-<text text-anchor="middle" x="60.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::quadraticEquation</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209.75,-19.25 157.75,-19.25 157.75,0 209.75,0 209.75,-19.25"/>
-<text text-anchor="middle" x="183.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.96,-9.62C130.2,-9.62 138.45,-9.62 146.1,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.02,-13.13 156.02,-9.63 146.02,-6.13 146.02,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.map b/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.map
deleted file mode 100644
index 45721859d..000000000
--- a/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="math::triangle_area" name="math::triangle_area">
-<area shape="rect" id="Node000001" title="area of a triangle (b * h / 2)" alt="" coords="5,29,138,55"/>
-<area shape="rect" id="Node000002" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="186,29,242,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="138,40,170,40,170,45,138,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="194,30,190,21,192,11,201,5,214,3,228,5,236,12,232,16,226,10,214,8,203,10,197,14,195,20,199,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="290,29,362,55"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="242,40,274,40,274,45,242,45"/>
-</map>
diff --git a/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.md5 b/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.md5
deleted file mode 100644
index 5f297feea..000000000
--- a/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-727be8c14feaa480af95e69e6d213653
\ No newline at end of file
diff --git a/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.svg b/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.svg
deleted file mode 100644
index 8609241ee..000000000
--- a/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::triangle_area Pages: 1 -->
-<svg width="276pt" height="45pt"
- viewBox="0.00 0.00 275.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>math::triangle_area</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="area of a triangle (b * h / 2)">
-<polygon fill="#999999" stroke="#666666" points="99.25,-19.25 0,-19.25 0,0 99.25,0 99.25,-19.25"/>
-<text text-anchor="middle" x="49.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::triangle_area</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.5,-19.25 135.25,-19.25 135.25,0 177.5,0 177.5,-19.25"/>
-<text text-anchor="middle" x="156.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.63,-9.62C107.8,-9.62 116.09,-9.62 123.69,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.42,-13.13 133.42,-9.63 123.42,-6.13 123.42,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M143.19,-19.54C137.17,-28.15 141.57,-37.25 156.38,-37.25 164.47,-37.25 169.46,-34.53 171.33,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.83,-30.36 169.8,-21.03 167.91,-31.46 174.83,-30.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.75,-19.25 213.5,-19.25 213.5,0 267.75,0 267.75,-19.25"/>
-<text text-anchor="middle" x="240.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.71,-9.62C184.95,-9.62 193.36,-9.62 201.6,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.49,-13.13 211.49,-9.63 201.49,-6.13 201.49,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph_org.svg b/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph_org.svg
deleted file mode 100644
index 5fd45c851..000000000
--- a/dd/d47/namespacemath_ab3b920cc56442abd92279ba23b50f4dc_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::triangle_area Pages: 1 -->
-<svg width="276pt" height="45pt"
- viewBox="0.00 0.00 275.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>math::triangle_area</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="area of a triangle (b * h / 2)">
-<polygon fill="#999999" stroke="#666666" points="99.25,-19.25 0,-19.25 0,0 99.25,0 99.25,-19.25"/>
-<text text-anchor="middle" x="49.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::triangle_area</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="177.5,-19.25 135.25,-19.25 135.25,0 177.5,0 177.5,-19.25"/>
-<text text-anchor="middle" x="156.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.63,-9.62C107.8,-9.62 116.09,-9.62 123.69,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.42,-13.13 133.42,-9.63 123.42,-6.13 123.42,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M143.19,-19.54C137.17,-28.15 141.57,-37.25 156.38,-37.25 164.47,-37.25 169.46,-34.53 171.33,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.83,-30.36 169.8,-21.03 167.91,-31.46 174.83,-30.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.75,-19.25 213.5,-19.25 213.5,0 267.75,0 267.75,-19.25"/>
-<text text-anchor="middle" x="240.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.71,-9.62C184.95,-9.62 193.36,-9.62 201.6,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.49,-13.13 211.49,-9.63 201.49,-6.13 201.49,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.map b/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.map
deleted file mode 100644
index bfaae621c..000000000
--- a/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="math::cylinder_volume" name="math::cylinder_volume">
-<area shape="rect" id="Node000001" title="The volume of a cylinder" alt="" coords="5,55,158,80"/>
-<area shape="rect" id="Node000002" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="213,29,270,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="158,53,197,46,198,52,159,58"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="206,79,277,104"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="159,76,190,81,189,86,158,82"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="220,30,216,21,219,11,227,5,241,3,256,5,264,12,261,16,254,10,241,8,229,10,223,14,222,20,225,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="325,29,397,55"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="270,40,309,40,309,45,270,45"/>
-</map>
diff --git a/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.md5 b/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.md5
deleted file mode 100644
index 9247a8e13..000000000
--- a/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6eac59b3843310a1d8039173f5678002
\ No newline at end of file
diff --git a/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.svg b/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.svg
deleted file mode 100644
index 1bc2143b7..000000000
--- a/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph.svg
+++ /dev/null
@@ -1,110 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::cylinder_volume Pages: 1 -->
-<svg width="302pt" height="82pt"
- viewBox="0.00 0.00 302.00 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>math::cylinder_volume</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The volume of a cylinder">
-<polygon fill="#999999" stroke="#666666" points="114.25,-37.25 0,-37.25 0,-18 114.25,-18 114.25,-37.25"/>
-<text text-anchor="middle" x="57.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cylinder_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="198.12,-56.25 155.88,-56.25 155.88,-37 198.12,-37 198.12,-56.25"/>
-<text text-anchor="middle" x="177" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.65,-36.74C124.83,-38.38 135.12,-40.04 144.28,-41.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.65,-44.96 154.08,-43.09 144.76,-38.04 143.65,-44.96"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203.75,-19.25 150.25,-19.25 150.25,0 203.75,0 203.75,-19.25"/>
-<text text-anchor="middle" x="177" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.65,-18.99C122.71,-17.76 130.84,-16.52 138.42,-15.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.94,-18.82 148.3,-13.86 137.88,-11.9 138.94,-18.82"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.93,-56.54C156.51,-65.15 161.2,-74.25 177,-74.25 185.64,-74.25 190.96,-71.53 192.95,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.44,-67.31 191.32,-58.03 189.54,-68.47 196.44,-67.31"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-56.25 239.75,-56.25 239.75,-37 294,-37 294,-56.25"/>
-<text text-anchor="middle" x="266.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M198.38,-46.62C207.22,-46.62 217.87,-46.62 228.07,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.76,-50.13 237.76,-46.63 227.76,-43.13 227.76,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph_org.svg b/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph_org.svg
deleted file mode 100644
index 636102aee..000000000
--- a/dd/d47/namespacemath_abde24398be43538c62e4a496968e60ca_cgraph_org.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::cylinder_volume Pages: 1 -->
-<svg width="302pt" height="82pt"
- viewBox="0.00 0.00 302.00 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>math::cylinder_volume</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The volume of a cylinder">
-<polygon fill="#999999" stroke="#666666" points="114.25,-37.25 0,-37.25 0,-18 114.25,-18 114.25,-37.25"/>
-<text text-anchor="middle" x="57.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cylinder_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="198.12,-56.25 155.88,-56.25 155.88,-37 198.12,-37 198.12,-56.25"/>
-<text text-anchor="middle" x="177" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.65,-36.74C124.83,-38.38 135.12,-40.04 144.28,-41.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="143.65,-44.96 154.08,-43.09 144.76,-38.04 143.65,-44.96"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203.75,-19.25 150.25,-19.25 150.25,0 203.75,0 203.75,-19.25"/>
-<text text-anchor="middle" x="177" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.65,-18.99C122.71,-17.76 130.84,-16.52 138.42,-15.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.94,-18.82 148.3,-13.86 137.88,-11.9 138.94,-18.82"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.93,-56.54C156.51,-65.15 161.2,-74.25 177,-74.25 185.64,-74.25 190.96,-71.53 192.95,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.44,-67.31 191.32,-58.03 189.54,-68.47 196.44,-67.31"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-56.25 239.75,-56.25 239.75,-37 294,-37 294,-56.25"/>
-<text text-anchor="middle" x="266.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M198.38,-46.62C207.22,-46.62 217.87,-46.62 228.07,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.76,-50.13 237.76,-46.63 227.76,-43.13 227.76,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d47/namespacemath_abf7f2a6d91f1ca6c89698792aea3f188_cgraph.map b/dd/d47/namespacemath_abf7f2a6d91f1ca6c89698792aea3f188_cgraph.map
deleted file mode 100644
index 89bdb2c8e..000000000
--- a/dd/d47/namespacemath_abf7f2a6d91f1ca6c89698792aea3f188_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="math::approximate_pi" name="math::approximate_pi">
-<area shape="rect" id="Node000001" title="This function uses the points in a given vector &#39;pts&#39; (drawn at random) to return an approximation of..." alt="" coords="5,5,152,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="200,5,315,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="152,16,184,16,184,21,152,21"/>
-</map>
diff --git a/dd/d47/namespacemath_abf7f2a6d91f1ca6c89698792aea3f188_cgraph.md5 b/dd/d47/namespacemath_abf7f2a6d91f1ca6c89698792aea3f188_cgraph.md5
deleted file mode 100644
index 5281cc014..000000000
--- a/dd/d47/namespacemath_abf7f2a6d91f1ca6c89698792aea3f188_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5ce3d6040d5d55ef29c636d9ec16315e
\ No newline at end of file
diff --git a/dd/d47/namespacemath_abf7f2a6d91f1ca6c89698792aea3f188_cgraph.svg b/dd/d47/namespacemath_abf7f2a6d91f1ca6c89698792aea3f188_cgraph.svg
deleted file mode 100644
index 1b1e9deed..000000000
--- a/dd/d47/namespacemath_abf7f2a6d91f1ca6c89698792aea3f188_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::approximate_pi Pages: 1 -->
-<svg width="240pt" height="27pt"
- viewBox="0.00 0.00 240.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>math::approximate_pi</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function uses the points in a given vector &#39;pts&#39; (drawn at random) to return an approximation of...">
-<polygon fill="#999999" stroke="#666666" points="109.75,-19.25 0,-19.25 0,0 109.75,0 109.75,-19.25"/>
-<text text-anchor="middle" x="54.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::approximate_pi</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.25,-19.25 145.75,-19.25 145.75,0 232.25,0 232.25,-19.25"/>
-<text text-anchor="middle" x="189" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110,-9.62C117.94,-9.62 126.13,-9.62 134.08,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.97,-13.13 143.97,-9.63 133.97,-6.13 133.97,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d47/namespacemath_abf7f2a6d91f1ca6c89698792aea3f188_cgraph_org.svg b/dd/d47/namespacemath_abf7f2a6d91f1ca6c89698792aea3f188_cgraph_org.svg
deleted file mode 100644
index 41aea7400..000000000
--- a/dd/d47/namespacemath_abf7f2a6d91f1ca6c89698792aea3f188_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::approximate_pi Pages: 1 -->
-<svg width="240pt" height="27pt"
- viewBox="0.00 0.00 240.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>math::approximate_pi</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function uses the points in a given vector &#39;pts&#39; (drawn at random) to return an approximation of...">
-<polygon fill="#999999" stroke="#666666" points="109.75,-19.25 0,-19.25 0,0 109.75,0 109.75,-19.25"/>
-<text text-anchor="middle" x="54.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::approximate_pi</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.25,-19.25 145.75,-19.25 145.75,0 232.25,0 232.25,-19.25"/>
-<text text-anchor="middle" x="189" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110,-9.62C117.94,-9.62 126.13,-9.62 134.08,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="133.97,-13.13 143.97,-9.63 133.97,-6.13 133.97,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.map b/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.map
deleted file mode 100644
index bdf906cf0..000000000
--- a/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="math::cylinder_surface_area" name="math::cylinder_surface_area">
-<area shape="rect" id="Node000001" title="surface area of a cylinder (2 * pi * r * h + 2 * pi * r^2)" alt="" coords="5,29,191,55"/>
-<area shape="rect" id="Node000002" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="239,29,295,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="191,40,223,40,223,45,191,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="247,30,243,21,245,11,254,5,267,3,281,5,289,12,285,16,279,10,267,8,256,10,250,14,248,20,252,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="343,29,415,55"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="295,40,327,40,327,45,295,45"/>
-</map>
diff --git a/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.md5 b/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.md5
deleted file mode 100644
index c0546fe08..000000000
--- a/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-457884b1c2bae6638428084835dd60ff
\ No newline at end of file
diff --git a/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.svg b/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.svg
deleted file mode 100644
index 76f4e815e..000000000
--- a/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::cylinder_surface_area Pages: 1 -->
-<svg width="316pt" height="45pt"
- viewBox="0.00 0.00 315.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>math::cylinder_surface_area</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="surface area of a cylinder (2 * pi * r * h + 2 * pi * r^2)">
-<polygon fill="#999999" stroke="#666666" points="139,-19.25 0,-19.25 0,0 139,0 139,-19.25"/>
-<text text-anchor="middle" x="69.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cylinder_surface_area</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="217.25,-19.25 175,-19.25 175,0 217.25,0 217.25,-19.25"/>
-<text text-anchor="middle" x="196.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.37,-9.62C147.7,-9.62 155.86,-9.62 163.27,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.03,-13.13 173.03,-9.63 163.03,-6.13 163.03,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.94,-19.54C176.92,-28.15 181.32,-37.25 196.12,-37.25 204.22,-37.25 209.21,-34.53 211.08,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.58,-30.36 209.55,-21.03 207.66,-31.46 214.58,-30.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="307.5,-19.25 253.25,-19.25 253.25,0 307.5,0 307.5,-19.25"/>
-<text text-anchor="middle" x="280.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M217.46,-9.62C224.7,-9.62 233.11,-9.62 241.35,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="241.24,-13.13 251.24,-9.63 241.24,-6.13 241.24,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph_org.svg b/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph_org.svg
deleted file mode 100644
index 99b9aac6d..000000000
--- a/dd/d47/namespacemath_ac5803413618fcfb922cb32c6db0fc864_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::cylinder_surface_area Pages: 1 -->
-<svg width="316pt" height="45pt"
- viewBox="0.00 0.00 315.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>math::cylinder_surface_area</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="surface area of a cylinder (2 * pi * r * h + 2 * pi * r^2)">
-<polygon fill="#999999" stroke="#666666" points="139,-19.25 0,-19.25 0,0 139,0 139,-19.25"/>
-<text text-anchor="middle" x="69.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cylinder_surface_area</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="217.25,-19.25 175,-19.25 175,0 217.25,0 217.25,-19.25"/>
-<text text-anchor="middle" x="196.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M139.37,-9.62C147.7,-9.62 155.86,-9.62 163.27,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.03,-13.13 173.03,-9.63 163.03,-6.13 163.03,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.94,-19.54C176.92,-28.15 181.32,-37.25 196.12,-37.25 204.22,-37.25 209.21,-34.53 211.08,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.58,-30.36 209.55,-21.03 207.66,-31.46 214.58,-30.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="307.5,-19.25 253.25,-19.25 253.25,0 307.5,0 307.5,-19.25"/>
-<text text-anchor="middle" x="280.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M217.46,-9.62C224.7,-9.62 233.11,-9.62 241.35,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="241.24,-13.13 251.24,-9.63 241.24,-6.13 241.24,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d47/namespacemath_ad09d59850865012a6fd95d89954c82e4_cgraph.map b/dd/d47/namespacemath_ad09d59850865012a6fd95d89954c82e4_cgraph.map
deleted file mode 100644
index f84b6840c..000000000
--- a/dd/d47/namespacemath_ad09d59850865012a6fd95d89954c82e4_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="math::print_primes" name="math::print_primes">
-<area shape="rect" id="Node000001" title="Prints all the indexes of true values in the passed std::vector." alt="" coords="5,55,135,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="205,5,276,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="116,51,189,30,191,35,118,57"/>
-<area shape="rect" id="Node000003" href="$de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a" title=" " alt="" coords="210,55,270,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="135,65,195,65,195,70,135,70"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="183,104,298,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="118,78,180,97,178,102,116,84"/>
-<area shape="rect" id="Node000004" 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="346,55,521,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="271,65,330,65,330,70,271,70"/>
-</map>
diff --git a/dd/d47/namespacemath_ad09d59850865012a6fd95d89954c82e4_cgraph.md5 b/dd/d47/namespacemath_ad09d59850865012a6fd95d89954c82e4_cgraph.md5
deleted file mode 100644
index b688a1b53..000000000
--- a/dd/d47/namespacemath_ad09d59850865012a6fd95d89954c82e4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b5aab553c97b1e43495bec22860cf484
\ No newline at end of file
diff --git a/dd/d47/namespacemath_ad09d59850865012a6fd95d89954c82e4_cgraph.svg b/dd/d47/namespacemath_ad09d59850865012a6fd95d89954c82e4_cgraph.svg
deleted file mode 100644
index ce6a024ee..000000000
--- a/dd/d47/namespacemath_ad09d59850865012a6fd95d89954c82e4_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::print_primes Pages: 1 -->
-<svg width="395pt" height="101pt"
- viewBox="0.00 0.00 395.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>math::print_primes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Prints all the indexes of true values in the passed std::vector.">
-<polygon fill="#999999" stroke="#666666" points="97,-56.25 0,-56.25 0,-37 97,-37 97,-56.25"/>
-<text text-anchor="middle" x="48.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::print_primes</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203,-93.25 149.5,-93.25 149.5,-74 203,-74 203,-93.25"/>
-<text text-anchor="middle" x="176.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.86,-56.74C100.8,-61.72 121.25,-67.74 138.5,-72.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.28,-76.1 147.86,-75.56 139.25,-69.38 137.28,-76.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="198.88,-56.25 153.62,-56.25 153.62,-37 198.88,-37 198.88,-56.25"/>
-<text text-anchor="middle" x="176.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">primes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.4,-46.62C112.32,-46.62 128.44,-46.62 142.12,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.91,-50.13 151.91,-46.63 141.91,-43.13 141.91,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.5,-19.25 133,-19.25 133,0 219.5,0 219.5,-19.25"/>
-<text text-anchor="middle" x="176.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.86,-36.51C98.14,-32.31 114.91,-27.38 130.15,-22.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.87,-26.33 139.48,-20.15 128.9,-19.62 130.87,-26.33"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387,-56.25 255.5,-56.25 255.5,-37 387,-37 387,-56.25"/>
-<text text-anchor="middle" x="321.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.28,-46.62C211.5,-46.62 227.51,-46.62 243.85,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.67,-50.13 253.67,-46.63 243.67,-43.13 243.67,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d47/namespacemath_ad09d59850865012a6fd95d89954c82e4_cgraph_org.svg b/dd/d47/namespacemath_ad09d59850865012a6fd95d89954c82e4_cgraph_org.svg
deleted file mode 100644
index d2190e1a8..000000000
--- a/dd/d47/namespacemath_ad09d59850865012a6fd95d89954c82e4_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::print_primes Pages: 1 -->
-<svg width="395pt" height="101pt"
- viewBox="0.00 0.00 395.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>math::print_primes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Prints all the indexes of true values in the passed std::vector.">
-<polygon fill="#999999" stroke="#666666" points="97,-56.25 0,-56.25 0,-37 97,-37 97,-56.25"/>
-<text text-anchor="middle" x="48.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::print_primes</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203,-93.25 149.5,-93.25 149.5,-74 203,-74 203,-93.25"/>
-<text text-anchor="middle" x="176.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.86,-56.74C100.8,-61.72 121.25,-67.74 138.5,-72.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="137.28,-76.1 147.86,-75.56 139.25,-69.38 137.28,-76.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="198.88,-56.25 153.62,-56.25 153.62,-37 198.88,-37 198.88,-56.25"/>
-<text text-anchor="middle" x="176.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">primes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.4,-46.62C112.32,-46.62 128.44,-46.62 142.12,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.91,-50.13 151.91,-46.63 141.91,-43.13 141.91,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.5,-19.25 133,-19.25 133,0 219.5,0 219.5,-19.25"/>
-<text text-anchor="middle" x="176.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.86,-36.51C98.14,-32.31 114.91,-27.38 130.15,-22.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.87,-26.33 139.48,-20.15 128.9,-19.62 130.87,-26.33"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387,-56.25 255.5,-56.25 255.5,-37 387,-37 387,-56.25"/>
-<text text-anchor="middle" x="321.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.28,-46.62C211.5,-46.62 227.51,-46.62 243.85,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.67,-50.13 253.67,-46.63 243.67,-43.13 243.67,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d47/namespacemath_ae413098478fa38acaac887b7654f0725_cgraph.map b/dd/d47/namespacemath_ae413098478fa38acaac887b7654f0725_cgraph.map
deleted file mode 100644
index 4a62a9765..000000000
--- a/dd/d47/namespacemath_ae413098478fa38acaac887b7654f0725_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="math::cube_volume" name="math::cube_volume">
-<area shape="rect" id="Node000001" title="The volume of a cube" alt="" coords="5,5,141,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="189,5,260,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="141,16,173,16,173,21,141,21"/>
-</map>
diff --git a/dd/d47/namespacemath_ae413098478fa38acaac887b7654f0725_cgraph.md5 b/dd/d47/namespacemath_ae413098478fa38acaac887b7654f0725_cgraph.md5
deleted file mode 100644
index cd233f769..000000000
--- a/dd/d47/namespacemath_ae413098478fa38acaac887b7654f0725_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-657d8ad44ac8c1706fefaac2f8e2976b
\ No newline at end of file
diff --git a/dd/d47/namespacemath_ae413098478fa38acaac887b7654f0725_cgraph.svg b/dd/d47/namespacemath_ae413098478fa38acaac887b7654f0725_cgraph.svg
deleted file mode 100644
index 386ba202f..000000000
--- a/dd/d47/namespacemath_ae413098478fa38acaac887b7654f0725_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::cube_volume Pages: 1 -->
-<svg width="199pt" height="27pt"
- viewBox="0.00 0.00 199.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>math::cube_volume</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The volume of a cube">
-<polygon fill="#999999" stroke="#666666" points="101.5,-19.25 0,-19.25 0,0 101.5,0 101.5,-19.25"/>
-<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cube_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191,-19.25 137.5,-19.25 137.5,0 191,0 191,-19.25"/>
-<text text-anchor="middle" x="164.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.95,-9.62C109.92,-9.62 118.04,-9.62 125.65,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.59,-13.13 135.59,-9.63 125.59,-6.13 125.59,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d47/namespacemath_ae413098478fa38acaac887b7654f0725_cgraph_org.svg b/dd/d47/namespacemath_ae413098478fa38acaac887b7654f0725_cgraph_org.svg
deleted file mode 100644
index a20462a4c..000000000
--- a/dd/d47/namespacemath_ae413098478fa38acaac887b7654f0725_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::cube_volume Pages: 1 -->
-<svg width="199pt" height="27pt"
- viewBox="0.00 0.00 199.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>math::cube_volume</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The volume of a cube">
-<polygon fill="#999999" stroke="#666666" points="101.5,-19.25 0,-19.25 0,0 101.5,0 101.5,-19.25"/>
-<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::cube_volume</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191,-19.25 137.5,-19.25 137.5,0 191,0 191,-19.25"/>
-<text text-anchor="middle" x="164.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.95,-9.62C109.92,-9.62 118.04,-9.62 125.65,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.59,-13.13 135.59,-9.63 125.59,-6.13 125.59,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d4f/class_solution.html b/dd/d4f/class_solution.html
index cf2dcd456..0fd72301c 100644
--- a/dd/d4f/class_solution.html
+++ b/dd/d4f/class_solution.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Solution Class Reference</title>
+<title>TheAlgorithms/C++: Solution Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,7 @@ Collaboration diagram for Solution:</div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:a98141c9dce5f9551ce6f8417d295514c" id="r_a98141c9dce5f9551ce6f8417d295514c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a98141c9dce5f9551ce6f8417d295514c">search_bridges</a> (int n, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; &amp;connections)</td></tr>
+<tr class="memitem:a98141c9dce5f9551ce6f8417d295514c" id="r_a98141c9dce5f9551ce6f8417d295514c"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a98141c9dce5f9551ce6f8417d295514c">search_bridges</a> (int n, const std::vector&lt; std::vector&lt; int &gt; &gt; &amp;connections)</td></tr>
 <tr class="separator:a98141c9dce5f9551ce6f8417d295514c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
@@ -130,26 +147,23 @@ Private Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a064ff4943e3860399f8f6873862071c9" id="r_a064ff4943e3860399f8f6873862071c9"><td class="memItemLeft" align="right" valign="top"><a id="a064ff4943e3860399f8f6873862071c9" name="a064ff4943e3860399f8f6873862071c9"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>graph</b></td></tr>
+<tr class="memitem:a064ff4943e3860399f8f6873862071c9" id="r_a064ff4943e3860399f8f6873862071c9"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a064ff4943e3860399f8f6873862071c9">graph</a></td></tr>
 <tr class="separator:a064ff4943e3860399f8f6873862071c9"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a4a7040c6f21dacd58b63e9c3aeecab86" id="r_a4a7040c6f21dacd58b63e9c3aeecab86"><td class="memItemLeft" align="right" valign="top"><a id="a4a7040c6f21dacd58b63e9c3aeecab86" name="a4a7040c6f21dacd58b63e9c3aeecab86"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>in_time</b></td></tr>
+<tr class="memitem:a4a7040c6f21dacd58b63e9c3aeecab86" id="r_a4a7040c6f21dacd58b63e9c3aeecab86"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4a7040c6f21dacd58b63e9c3aeecab86">in_time</a></td></tr>
 <tr class="separator:a4a7040c6f21dacd58b63e9c3aeecab86"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af1fcd3d8160363baa35a079244eb2e91" id="r_af1fcd3d8160363baa35a079244eb2e91"><td class="memItemLeft" align="right" valign="top"><a id="af1fcd3d8160363baa35a079244eb2e91" name="af1fcd3d8160363baa35a079244eb2e91"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>out_time</b></td></tr>
+<tr class="memitem:af1fcd3d8160363baa35a079244eb2e91" id="r_af1fcd3d8160363baa35a079244eb2e91"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af1fcd3d8160363baa35a079244eb2e91">out_time</a></td></tr>
 <tr class="separator:af1fcd3d8160363baa35a079244eb2e91"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae8ca86dfb0d034665027aa99af3c88c6" id="r_ae8ca86dfb0d034665027aa99af3c88c6"><td class="memItemLeft" align="right" valign="top"><a id="ae8ca86dfb0d034665027aa99af3c88c6" name="ae8ca86dfb0d034665027aa99af3c88c6"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>timer</b> = 0</td></tr>
+<tr class="memitem:ae8ca86dfb0d034665027aa99af3c88c6" id="r_ae8ca86dfb0d034665027aa99af3c88c6"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae8ca86dfb0d034665027aa99af3c88c6">timer</a> = 0</td></tr>
 <tr class="separator:ae8ca86dfb0d034665027aa99af3c88c6"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a216a0a43fbf11d0bbe8f77205b0d4ad6" id="r_a216a0a43fbf11d0bbe8f77205b0d4ad6"><td class="memItemLeft" align="right" valign="top"><a id="a216a0a43fbf11d0bbe8f77205b0d4ad6" name="a216a0a43fbf11d0bbe8f77205b0d4ad6"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>bridge</b></td></tr>
+<tr class="memitem:a216a0a43fbf11d0bbe8f77205b0d4ad6" id="r_a216a0a43fbf11d0bbe8f77205b0d4ad6"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a216a0a43fbf11d0bbe8f77205b0d4ad6">bridge</a></td></tr>
 <tr class="separator:a216a0a43fbf11d0bbe8f77205b0d4ad6"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a315f536a234d4397d5b07b3c5795973c" id="r_a315f536a234d4397d5b07b3c5795973c"><td class="memItemLeft" align="right" valign="top"><a id="a315f536a234d4397d5b07b3c5795973c" name="a315f536a234d4397d5b07b3c5795973c"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>visited</b></td></tr>
+<tr class="memitem:a315f536a234d4397d5b07b3c5795973c" id="r_a315f536a234d4397d5b07b3c5795973c"><td class="memItemLeft" align="right" valign="top">std::vector&lt; bool &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a315f536a234d4397d5b07b3c5795973c">visited</a></td></tr>
 <tr class="separator:a315f536a234d4397d5b07b3c5795973c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
-<h2 class="groupheader">Member Function Documentation</h2>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html#l00011">11</a> of file <a class="el" href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html">bridge_finding_with_tarjan_algorithm.cpp</a>.</p>
+</div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="a29d19d87d54fe43d3f22221b8fe1b0bc" name="a29d19d87d54fe43d3f22221b8fe1b0bc"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a29d19d87d54fe43d3f22221b8fe1b0bc">&#9670;&#160;</a></span>dfs()</h2>
 
@@ -176,8 +190,10 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>timer</b> = 0</td></tr
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html#l00017">17</a> of file <a class="el" href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html">bridge_finding_with_tarjan_algorithm.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   17</span>                                           {</div>
-<div class="line"><span class="lineno">   18</span>        visited.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/at.html">at</a>(current_node) = <span class="keyword">true</span>;</div>
+<div class="line"><span class="lineno">   18</span>        visited.at(current_node) = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   19</span>        in_time[current_node] = out_time[current_node] = timer++;</div>
 <div class="line"><span class="lineno">   20</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; itr : <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[current_node]) {</div>
 <div class="line"><span class="lineno">   21</span>            <span class="keywordflow">if</span> (itr == parent) {</div>
@@ -186,17 +202,14 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>timer</b> = 0</td></tr
 <div class="line"><span class="lineno">   24</span>            <span class="keywordflow">if</span> (!visited[itr]) {</div>
 <div class="line"><span class="lineno">   25</span>                dfs(itr, current_node);</div>
 <div class="line"><span class="lineno">   26</span>                <span class="keywordflow">if</span> (out_time[itr] &gt; in_time[current_node]) {</div>
-<div class="line"><span class="lineno">   27</span>                    bridge.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>({itr, current_node});</div>
+<div class="line"><span class="lineno">   27</span>                    bridge.push_back({itr, current_node});</div>
 <div class="line"><span class="lineno">   28</span>                }</div>
 <div class="line"><span class="lineno">   29</span>            }</div>
 <div class="line"><span class="lineno">   30</span>            out_time[current_node] =</div>
-<div class="line"><span class="lineno">   31</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(out_time[current_node], out_time[itr]);</div>
+<div class="line"><span class="lineno">   31</span>                std::min(out_time[current_node], out_time[itr]);</div>
 <div class="line"><span class="lineno">   32</span>        }</div>
 <div class="line"><span class="lineno">   33</span>    }</div>
-<div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/at.html">std::vector::at</a></div><div class="ttdeci">T at(T... args)</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="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph Algorithms.</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -210,14 +223,14 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>timer</b> = 0</td></tr
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; Solution::search_bridges </td>
+          <td class="memname">std::vector&lt; std::vector&lt; int &gt; &gt; Solution::search_bridges </td>
           <td>(</td>
           <td class="paramtype">int</td>          <td class="paramname"><span class="paramname"><em>n</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>connections</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; int &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>connections</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -226,12 +239,14 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>timer</b> = 0</td></tr
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html">bridge_finding_with_tarjan_algorithm.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   37</span>                                                             {</div>
 <div class="line"><span class="lineno">   38</span>        timer = 0;</div>
 <div class="line"><span class="lineno">   39</span>        <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.resize(n);</div>
-<div class="line"><span class="lineno">   40</span>        in_time.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/assign.html">assign</a>(n, 0);</div>
-<div class="line"><span class="lineno">   41</span>        visited.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/assign.html">assign</a>(n, <span class="keyword">false</span>);</div>
-<div class="line"><span class="lineno">   42</span>        out_time.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/assign.html">assign</a>(n, 0);</div>
+<div class="line"><span class="lineno">   40</span>        in_time.assign(n, 0);</div>
+<div class="line"><span class="lineno">   41</span>        visited.assign(n, <span class="keyword">false</span>);</div>
+<div class="line"><span class="lineno">   42</span>        out_time.assign(n, 0);</div>
 <div class="line"><span class="lineno">   43</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; itr : connections) {</div>
 <div class="line"><span class="lineno">   44</span>            <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.at(itr[0]).push_back(itr[1]);</div>
 <div class="line"><span class="lineno">   45</span>            <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.at(itr[1]).push_back(itr[0]);</div>
@@ -239,12 +254,156 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>timer</b> = 0</td></tr
 <div class="line"><span class="lineno">   47</span>        dfs(0, -1);</div>
 <div class="line"><span class="lineno">   48</span>        <span class="keywordflow">return</span> bridge;</div>
 <div class="line"><span class="lineno">   49</span>    }</div>
-<div class="ttc" id="aassign_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/assign.html">std::vector::assign</a></div><div class="ttdeci">T assign(T... args)</div></div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a216a0a43fbf11d0bbe8f77205b0d4ad6" name="a216a0a43fbf11d0bbe8f77205b0d4ad6"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a216a0a43fbf11d0bbe8f77205b0d4ad6">&#9670;&#160;</a></span>bridge</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::vector&lt;int&gt; &gt; Solution::bridge</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html#l00015">15</a> of file <a class="el" href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html">bridge_finding_with_tarjan_algorithm.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a064ff4943e3860399f8f6873862071c9" name="a064ff4943e3860399f8f6873862071c9"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a064ff4943e3860399f8f6873862071c9">&#9670;&#160;</a></span>graph</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::vector&lt;int&gt; &gt; Solution::graph</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html#l00012">12</a> of file <a class="el" href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html">bridge_finding_with_tarjan_algorithm.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a4a7040c6f21dacd58b63e9c3aeecab86" name="a4a7040c6f21dacd58b63e9c3aeecab86"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a4a7040c6f21dacd58b63e9c3aeecab86">&#9670;&#160;</a></span>in_time</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;int&gt; Solution::in_time</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html#l00013">13</a> of file <a class="el" href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html">bridge_finding_with_tarjan_algorithm.cpp</a>.</p>
+
+</div>
+</div>
+<a id="af1fcd3d8160363baa35a079244eb2e91" name="af1fcd3d8160363baa35a079244eb2e91"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#af1fcd3d8160363baa35a079244eb2e91">&#9670;&#160;</a></span>out_time</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;int&gt; Solution::out_time</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html#l00013">13</a> of file <a class="el" href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html">bridge_finding_with_tarjan_algorithm.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ae8ca86dfb0d034665027aa99af3c88c6" name="ae8ca86dfb0d034665027aa99af3c88c6"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ae8ca86dfb0d034665027aa99af3c88c6">&#9670;&#160;</a></span>timer</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int Solution::timer = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html#l00014">14</a> of file <a class="el" href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html">bridge_finding_with_tarjan_algorithm.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a315f536a234d4397d5b07b3c5795973c" name="a315f536a234d4397d5b07b3c5795973c"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a315f536a234d4397d5b07b3c5795973c">&#9670;&#160;</a></span>visited</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;bool&gt; Solution::visited</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html#l00016">16</a> of file <a class="el" href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html">bridge_finding_with_tarjan_algorithm.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>graph/<b>bridge_finding_with_tarjan_algorithm.cpp</b></li>
+<li>graph/<a class="el" href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html">bridge_finding_with_tarjan_algorithm.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dd/d51/classstack-members.html b/dd/d51/classstack-members.html
index 7f4e4270c..418c81960 100644
--- a/dd/d51/classstack-members.html
+++ b/dd/d51/classstack-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dd/d53/structdouble__hashing_1_1_entry-members.html b/dd/d53/structdouble__hashing_1_1_entry-members.html
index 96da75808..3f9dd19e0 100644
--- a/dd/d53/structdouble__hashing_1_1_entry-members.html
+++ b/dd/d53/structdouble__hashing_1_1_entry-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.map b/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.map
index cb24eb8f0..673bfb885 100644
--- a/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.map
+++ b/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.map
@@ -1,9 +1,9 @@
 <map id="machine_learning::k_nearest_neighbors::Knn" name="machine_learning::k_nearest_neighbors::Knn">
 <area shape="rect" id="Node000001" title="K&#45;Nearest Neighbors (Knn) class using Euclidean distance as distance metric." alt="" coords="84,198,249,238"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="5,94,163,135"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,163,135"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="112,145,153,196,149,199,108,149"/>
-<area shape="rect" id="Node000003" 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,157,31"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="11,5,157,31"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="87,46,87,93,81,93,81,46"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="187,102,309,127"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="187,102,309,127"/>
 <area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="231,141,185,199,180,195,227,137"/>
 </map>
diff --git a/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.md5 b/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.md5
index cb973af6b..c992b3ee7 100644
--- a/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.md5
+++ b/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.md5
@@ -1 +1 @@
-d9b28a42cb45ddb1672ee39c6f33a9de
\ No newline at end of file
+b446bf92f6335dd6af9f03d4efb80801
\ No newline at end of file
diff --git a/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.svg b/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.svg
index 60c78c110..aaed08a0c 100644
--- a/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.svg
+++ b/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph.svg
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="118,-108.25 0,-108.25 0,-77.75 118,-77.75 118,-108.25"/>
 <text text-anchor="start" x="8" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="59" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; double &gt; &gt;</text>
@@ -52,7 +52,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="113.5,-174.75 4.5,-174.75 4.5,-155.5 113.5,-155.5 113.5,-174.75"/>
 <text text-anchor="middle" x="59" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; double &gt;</text>
 </a>
@@ -71,7 +71,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="227.5,-102.62 136.5,-102.62 136.5,-83.38 227.5,-83.38 227.5,-102.62"/>
 <text text-anchor="middle" x="182" y="-89.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
diff --git a/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph_org.svg b/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph_org.svg
index 17f4b03ee..c931dd1e1 100644
--- a/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph_org.svg
+++ b/dd/d58/classmachine__learning_1_1k__nearest__neighbors_1_1_knn__coll__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="118,-108.25 0,-108.25 0,-77.75 118,-77.75 118,-108.25"/>
 <text text-anchor="start" x="8" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="59" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; double &gt; &gt;</text>
@@ -41,7 +41,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="113.5,-174.75 4.5,-174.75 4.5,-155.5 113.5,-155.5 113.5,-174.75"/>
 <text text-anchor="middle" x="59" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; double &gt;</text>
 </a>
@@ -60,7 +60,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="227.5,-102.62 136.5,-102.62 136.5,-83.38 227.5,-83.38 227.5,-102.62"/>
 <text text-anchor="middle" x="182" y="-89.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
diff --git a/dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html b/dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html
index dd27e7964..bc6e488a0 100644
--- a/dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html
+++ b/dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: strings::boyer_moore::pattern Struct Reference</title>
+<title>TheAlgorithms/C++: strings::boyer_moore::pattern Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -116,21 +133,22 @@ $(function(){initNavTree('dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html',
 <div class="dynheader">
 Collaboration diagram for strings::boyer_moore::pattern:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.svg" width="279" height="259"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.svg" width="279" height="246"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a8b393264f2be3ddbc2341ce8b1547237" id="r_a8b393264f2be3ddbc2341ce8b1547237"><td class="memItemLeft" align="right" valign="top"><a id="a8b393264f2be3ddbc2341ce8b1547237" name="a8b393264f2be3ddbc2341ce8b1547237"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><b>pat</b></td></tr>
+<tr class="memitem:a8b393264f2be3ddbc2341ce8b1547237" id="r_a8b393264f2be3ddbc2341ce8b1547237"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8b393264f2be3ddbc2341ce8b1547237">pat</a></td></tr>
 <tr class="separator:a8b393264f2be3ddbc2341ce8b1547237"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ae5ca7abf15e939eddc80542131de3645" id="r_ae5ca7abf15e939eddc80542131de3645"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae5ca7abf15e939eddc80542131de3645">bad_char</a></td></tr>
+<tr class="memitem:ae5ca7abf15e939eddc80542131de3645" id="r_ae5ca7abf15e939eddc80542131de3645"><td class="memItemLeft" align="right" valign="top">std::vector&lt; size_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae5ca7abf15e939eddc80542131de3645">bad_char</a></td></tr>
 <tr class="separator:ae5ca7abf15e939eddc80542131de3645"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a3d62f615a0171a5d77e7018f704f3a7e" id="r_a3d62f615a0171a5d77e7018f704f3a7e"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3d62f615a0171a5d77e7018f704f3a7e">good_suffix</a></td></tr>
+<tr class="memitem:a3d62f615a0171a5d77e7018f704f3a7e" id="r_a3d62f615a0171a5d77e7018f704f3a7e"><td class="memItemLeft" align="right" valign="top">std::vector&lt; size_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3d62f615a0171a5d77e7018f704f3a7e">good_suffix</a></td></tr>
 <tr class="separator:a3d62f615a0171a5d77e7018f704f3a7e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A structure representing all the data we need to search the preprocessed pattern in text. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html#l00070">70</a> of file <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html">boyer_moore.cpp</a>.</p>
 </div><h2 class="groupheader">Member Data Documentation</h2>
 <a id="ae5ca7abf15e939eddc80542131de3645" name="ae5ca7abf15e939eddc80542131de3645"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae5ca7abf15e939eddc80542131de3645">&#9670;&#160;</a></span>bad_char</h2>
@@ -139,12 +157,14 @@ Public Attributes</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;size_t&gt; strings::boyer_moore::pattern::bad_char</td>
+          <td class="memname">std::vector&lt;size_t&gt; strings::boyer_moore::pattern::bad_char</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>bad char table used in <a href="https://www.geeksforgeeks.org/boyer-moore-algorithm-for-pattern-searching/" target="_blank">Bad Character Heuristic</a> </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html#l00074">74</a> of file <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html">boyer_moore.cpp</a>.</p>
+
 </div>
 </div>
 <a id="a3d62f615a0171a5d77e7018f704f3a7e" name="a3d62f615a0171a5d77e7018f704f3a7e"></a>
@@ -154,16 +174,34 @@ Public Attributes</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;size_t&gt; strings::boyer_moore::pattern::good_suffix</td>
+          <td class="memname">std::vector&lt;size_t&gt; strings::boyer_moore::pattern::good_suffix</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>good suffix table used for <a href="https://www.geeksforgeeks.org/boyer-moore-algorithm-good-suffix-heuristic/?ref=rp" target="_blank">Good Suffix heuristic</a> </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html#l00078">78</a> of file <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html">boyer_moore.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a8b393264f2be3ddbc2341ce8b1547237" name="a8b393264f2be3ddbc2341ce8b1547237"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a8b393264f2be3ddbc2341ce8b1547237">&#9670;&#160;</a></span>pat</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::string strings::boyer_moore::pattern::pat</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html#l00071">71</a> of file <a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html">boyer_moore.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>strings/<a class="el" href="../../d3/db2/boyer__moore_8cpp.html">boyer_moore.cpp</a></li>
+<li>strings/<a class="el" href="../../d3/db2/boyer__moore_8cpp_source.html">boyer_moore.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dd/d65/lu__decompose_8cpp.html b/dd/d65/lu__decompose_8cpp.html
index 83905bb5b..0e9fc87d0 100644
--- a/dd/d65/lu__decompose_8cpp.html
+++ b/dd/d65/lu__decompose_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/lu_decompose.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/lu_decompose.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,11 +139,13 @@ Include dependency graph for lu_decompose.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d37/lu__decompose_8cpp__incl.svg" width="500" height="199"><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">
+</div>
+<p><a href="../../dd/d65/lu__decompose_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a575c989afcc78e875031cd4273e62a3e" id="r_a575c989afcc78e875031cd4273e62a3e"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a575c989afcc78e875031cd4273e62a3e"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a575c989afcc78e875031cd4273e62a3e">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;out, <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; T &gt; const &amp;v)</td></tr>
+<tr class="memitem:a575c989afcc78e875031cd4273e62a3e"><td class="memTemplItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a575c989afcc78e875031cd4273e62a3e">operator&lt;&lt;</a> (std::ostream &amp;out, <a class="el" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a>&lt; T &gt; const &amp;v)</td></tr>
 <tr class="separator:a575c989afcc78e875031cd4273e62a3e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a1440a7779ac56f47a3f355ce4a8c7da0" id="r_a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a> ()</td></tr>
 <tr class="separator:a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -138,6 +157,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/LU_decompositon" target="_blank">LU decomposition</a> of a square matrix </p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../dd/d65/lu__decompose_8cpp_source.html">lu_decompose.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a3c04138a5bfe5d72780bb7e82a18e627" name="a3c04138a5bfe5d72780bb7e82a18e627"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a3c04138a5bfe5d72780bb7e82a18e627">&#9670;&#160;</a></span>main()</h2>
@@ -158,23 +179,18 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d65/lu__decompose_8cpp_source.html#l00084">84</a> of file <a class="el" href="../../dd/d65/lu__decompose_8cpp_source.html">lu_decompose.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   84</span>                                {</div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(NULL));  <span class="comment">// random number initializer</span></div>
+<div class="line"><span class="lineno">   85</span>    std::srand(std::time(NULL));  <span class="comment">// random number initializer</span></div>
 <div class="line"><span class="lineno">   86</span> </div>
 <div class="line"><span class="lineno">   87</span>    <a class="code hl_function" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();</div>
 <div class="line"><span class="lineno">   88</span>    <a class="code hl_function" href="#a0283886819c7c140a023582b7269e2d0">test2</a>();</div>
 <div class="line"><span class="lineno">   89</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   90</span>}</div>
-<div class="ttc" id="alu__decompose_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> lu_decompose.cpp:66</div></div>
-<div class="ttc" id="alu__decompose_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition</b> lu_decompose.cpp:36</div></div>
-<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg" width="100%" height="458"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="alu__decompose_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d65/lu__decompose_8cpp_source.html#l00066">lu_decompose.cpp:66</a></div></div>
+<div class="ttc" id="alu__decompose_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d65/lu__decompose_8cpp_source.html#l00036">lu_decompose.cpp:36</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a575c989afcc78e875031cd4273e62a3e" name="a575c989afcc78e875031cd4273e62a3e"></a>
@@ -186,9 +202,9 @@ Here is the call graph for this function:</div>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; operator&lt;&lt; </td>
+          <td class="memname">std::ostream &amp; operator&lt;&lt; </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
+          <td class="paramtype">std::ostream &amp;</td>          <td class="paramname"><span class="paramname"><em>out</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -198,30 +214,22 @@ template&lt;typename T &gt; </div>
       </table>
 </div><div class="memdoc">
 <p>operator to print a matrix </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d65/lu__decompose_8cpp_source.html#l00018">18</a> of file <a class="el" href="../../dd/d65/lu__decompose_8cpp_source.html">lu_decompose.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   18</span>                                                            {</div>
 <div class="line"><span class="lineno">   19</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> width = 10;</div>
 <div class="line"><span class="lineno">   20</span>    <span class="keyword">const</span> <span class="keywordtype">char</span> separator = <span class="charliteral">&#39; &#39;</span>;</div>
 <div class="line"><span class="lineno">   21</span> </div>
-<div class="line"><span class="lineno">   22</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; v.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); row++) {</div>
-<div class="line"><span class="lineno">   23</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; v[row].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); col++)</div>
-<div class="line"><span class="lineno">   24</span>            out &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::left</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(width) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">std::setfill</a>(separator)</div>
+<div class="line"><span class="lineno">   22</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; v.size(); row++) {</div>
+<div class="line"><span class="lineno">   23</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; v[row].size(); col++)</div>
+<div class="line"><span class="lineno">   24</span>            out &lt;&lt; std::left &lt;&lt; std::setw(width) &lt;&lt; std::setfill(separator)</div>
 <div class="line"><span class="lineno">   25</span>                &lt;&lt; v[row][col];</div>
-<div class="line"><span class="lineno">   26</span>        out &lt;&lt; <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">   26</span>        out &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   27</span>    }</div>
 <div class="line"><span class="lineno">   28</span> </div>
 <div class="line"><span class="lineno">   29</span>    <span class="keywordflow">return</span> out;</div>
 <div class="line"><span class="lineno">   30</span>}</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="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::left</a></div><div class="ttdeci">T left(T... args)</div></div>
-<div class="ttc" id="asetfill_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">std::setfill</a></div><div class="ttdeci">T setfill(T... args)</div></div>
-<div class="ttc" id="asetw_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a></div><div class="ttdeci">T setw(T... args)</div></div>
-<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><!-- 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="../../dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.svg" width="259" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1440a7779ac56f47a3f355ce4a8c7da0" name="a1440a7779ac56f47a3f355ce4a8c7da0"></a>
@@ -239,46 +247,38 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Test LU decomposition </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000006">Todo</a></b></dt><dd>better ways to self-check a matrix output? </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d65/lu__decompose_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../dd/d65/lu__decompose_8cpp_source.html">lu_decompose.cpp</a>.</p>
 <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> <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> = 3;  <span class="comment">// default matrix size</span></div>
 <div class="line"><span class="lineno">   38</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> range = 50;</div>
 <div class="line"><span class="lineno">   39</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> range2 = range &gt;&gt; 1;</div>
 <div class="line"><span class="lineno">   40</span> </div>
 <div class="line"><span class="lineno">   41</span>    <span class="comment">/* Create a square matrix with random values */</span></div>
-<div class="line"><span class="lineno">   42</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;double&gt;</a> A(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>));</div>
-<div class="line"><span class="lineno">   43</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;double&gt;</a> L(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>));  <span class="comment">// output</span></div>
-<div class="line"><span class="lineno">   44</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;double&gt;</a> U(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>));  <span class="comment">// output</span></div>
+<div class="line"><span class="lineno">   42</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;double&gt;</a> A(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>, std::valarray&lt;double&gt;(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>));</div>
+<div class="line"><span class="lineno">   43</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;double&gt;</a> L(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>, std::valarray&lt;double&gt;(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>));  <span class="comment">// output</span></div>
+<div class="line"><span class="lineno">   44</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;double&gt;</a> U(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>, std::valarray&lt;double&gt;(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>));  <span class="comment">// output</span></div>
 <div class="line"><span class="lineno">   45</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) {</div>
 <div class="line"><span class="lineno">   46</span>        <span class="comment">// calloc so that all valeus are &#39;0&#39; by default</span></div>
 <div class="line"><span class="lineno">   47</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; j++)</div>
 <div class="line"><span class="lineno">   48</span>            <span class="comment">/* create random values in the limits [-range2, range-1] */</span></div>
-<div class="line"><span class="lineno">   49</span>            A[i][j] = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % range - range2);</div>
+<div class="line"><span class="lineno">   49</span>            A[i][j] = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range - range2);</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>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> start_t = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">   52</span>    std::clock_t start_t = std::clock();</div>
 <div class="line"><span class="lineno">   53</span>    <a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509">lu_decomposition</a>(A, &amp;L, &amp;U);</div>
-<div class="line"><span class="lineno">   54</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a> end_t = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
-<div class="line"><span class="lineno">   55</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Time taken: &quot;</span></div>
+<div class="line"><span class="lineno">   54</span>    std::clock_t end_t = std::clock();</div>
+<div class="line"><span class="lineno">   55</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Time taken: &quot;</span></div>
 <div class="line"><span class="lineno">   56</span>              &lt;&lt; <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end_t - start_t) / CLOCKS_PER_SEC &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   57</span> </div>
-<div class="line"><span class="lineno">   58</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;A = \n&quot;</span> &lt;&lt; A &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   59</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;L = \n&quot;</span> &lt;&lt; L &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   60</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;U = \n&quot;</span> &lt;&lt; U &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   58</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;A = \n&quot;</span> &lt;&lt; A &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   59</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;L = \n&quot;</span> &lt;&lt; L &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   60</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;U = \n&quot;</span> &lt;&lt; U &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   61</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="aclock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a></div><div class="ttdeci">T clock(T... args)</div></div>
-<div class="ttc" id="aclock_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a></div></div>
-<div class="ttc" id="alu__decomposition_8h_html_a75b8a228c6419ecda6077255d6d60509"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509">lu_decomposition</a></div><div class="ttdeci">int lu_decomposition(const matrix&lt; T &gt; &amp;A, matrix&lt; double &gt; *L, matrix&lt; double &gt; *U)</div><div class="ttdef"><b>Definition</b> lu_decomposition.h:29</div></div>
-<div class="ttc" id="amatrix__exponentiation_8cpp_html_a9977ad12548c4a49dee9dc3f0685aa54"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a></div><div class="ttdeci">ll mat_size</div><div class="ttdef"><b>Definition</b> matrix_exponentiation.cpp:45</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg" width="395" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="alu__decomposition_8h_html_a75b8a228c6419ecda6077255d6d60509"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509">lu_decomposition</a></div><div class="ttdeci">int lu_decomposition(const matrix&lt; T &gt; &amp;A, matrix&lt; double &gt; *L, matrix&lt; double &gt; *U)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbe/lu__decomposition_8h_source.html#l00029">lu_decomposition.h:29</a></div></div>
+<div class="ttc" id="alu__decomposition_8h_html_ac029b636b353cefbb18b2fcc71e427e4"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; matrix</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbe/lu__decomposition_8h_source.html#l00019">lu_decomposition.h:19</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a9977ad12548c4a49dee9dc3f0685aa54"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a></div><div class="ttdeci">ll mat_size</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00045">matrix_exponentiation.cpp:45</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0283886819c7c140a023582b7269e2d0" name="a0283886819c7c140a023582b7269e2d0"></a>
@@ -296,29 +296,26 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Test determinant computation using LU decomposition </p>
-<div class="fragment"><div class="line"><span class="lineno">   66</span>             {</div>
-<div class="line"><span class="lineno">   67</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Determinant test 1...&quot;</span>;</div>
-<div class="line"><span class="lineno">   68</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;int&gt;</a> A1({{1, 2, 3}, {4, 9, 6}, {7, 8, 9}});</div>
-<div class="line"><span class="lineno">   69</span>    assert(<a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(A1) == -48);</div>
-<div class="line"><span class="lineno">   70</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   71</span> </div>
-<div class="line"><span class="lineno">   72</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Determinant test 2...&quot;</span>;</div>
-<div class="line"><span class="lineno">   73</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;int&gt;</a> A2({{1, 2, 3}, {4, 5, 6}, {7, 8, 9}});</div>
-<div class="line"><span class="lineno">   74</span>    assert(<a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(A2) == 0);</div>
-<div class="line"><span class="lineno">   75</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   76</span> </div>
-<div class="line"><span class="lineno">   77</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Determinant test 3...&quot;</span>;</div>
-<div class="line"><span class="lineno">   78</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">matrix&lt;float&gt;</a> A3({{1.2, 2.3, 3.4}, {4.5, 5.6, 6.7}, {7.8, 8.9, 9.0}});</div>
-<div class="line"><span class="lineno">   79</span>    assert(<a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(A3) == 3.63);</div>
-<div class="line"><span class="lineno">   80</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   81</span>}</div>
-<div class="ttc" id="alu__decomposition_8h_html_a3108d43bd32c6fb3b3c158476c51ba7f"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a></div><div class="ttdeci">double determinant_lu(const matrix&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> lu_decomposition.h:90</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg" width="550" height="62"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../dd/d65/lu__decompose_8cpp_source.html#l00066">66</a> of file <a class="el" href="../../dd/d65/lu__decompose_8cpp_source.html">lu_decompose.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   66</span>             {</div>
+<div class="line"><span class="lineno">   67</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Determinant test 1...&quot;</span>;</div>
+<div class="line"><span class="lineno">   68</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> A1({{1, 2, 3}, {4, 9, 6}, {7, 8, 9}});</div>
+<div class="line"><span class="lineno">   69</span>    assert(<a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(A1) == -48);</div>
+<div class="line"><span class="lineno">   70</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   71</span> </div>
+<div class="line"><span class="lineno">   72</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Determinant test 2...&quot;</span>;</div>
+<div class="line"><span class="lineno">   73</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> A2({{1, 2, 3}, {4, 5, 6}, {7, 8, 9}});</div>
+<div class="line"><span class="lineno">   74</span>    assert(<a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(A2) == 0);</div>
+<div class="line"><span class="lineno">   75</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   76</span> </div>
+<div class="line"><span class="lineno">   77</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Determinant test 3...&quot;</span>;</div>
+<div class="line"><span class="lineno">   78</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;float&gt;</a> A3({{1.2, 2.3, 3.4}, {4.5, 5.6, 6.7}, {7.8, 8.9, 9.0}});</div>
+<div class="line"><span class="lineno">   79</span>    assert(<a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(A3) == 3.63);</div>
+<div class="line"><span class="lineno">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   81</span>}</div>
+<div class="ttc" id="alu__decomposition_8h_html_a3108d43bd32c6fb3b3c158476c51ba7f"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a></div><div class="ttdeci">double determinant_lu(const matrix&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbe/lu__decomposition_8h_source.html#l00090">lu_decomposition.h:90</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
deleted file mode 100644
index cf1d77323..000000000
--- a/dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="test2" name="test2">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,56,56"/>
-<area shape="rect" id="Node000002" href="$d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" title=" " alt="" coords="104,31,210,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,41,88,41,88,46,56,46"/>
-<area shape="rect" id="Node000003" href="$d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" title=" " alt="" coords="258,5,380,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="210,33,242,27,243,33,211,38"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="428,31,544,56"/>
-<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="211,41,413,41,413,46,211,46"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="381,25,413,30,412,35,380,30"/>
-</map>
diff --git a/dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
deleted file mode 100644
index cd2377c6e..000000000
--- a/dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b32004893b272d8a391346d8d524a80d
\ No newline at end of file
diff --git a/dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
deleted file mode 100644
index e41b95c8d..000000000
--- a/dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
+++ /dev/null
@@ -1,110 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="412pt" height="46pt"
- viewBox="0.00 0.00 411.75 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="153.5,-19.25 73.75,-19.25 73.75,0 153.5,0 153.5,-19.25"/>
-<text text-anchor="middle" x="113.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">determinant_lu</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.2,-9.62C45.25,-9.62 53.68,-9.62 62.3,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.11,-13.13 72.11,-9.63 62.11,-6.13 62.11,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="281.25,-38.25 189.5,-38.25 189.5,-19 281.25,-19 281.25,-38.25"/>
-<text text-anchor="middle" x="235.38" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.84,-15.85C161.62,-17.08 169.94,-18.4 178.16,-19.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.34,-23.12 187.76,-21.23 178.43,-16.21 177.34,-23.12"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="403.75,-19.25 317.25,-19.25 317.25,0 403.75,0 403.75,-19.25"/>
-<text text-anchor="middle" x="360.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.97,-9.62C195.01,-9.62 259.64,-9.62 305.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.45,-13.13 315.45,-9.63 305.45,-6.13 305.45,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M281.52,-21.66C289.36,-20.45 297.58,-19.18 305.62,-17.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.97,-21.43 315.32,-16.44 304.9,-14.51 305.97,-21.43"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
deleted file mode 100644
index 8a98d580d..000000000
--- a/dd/d65/lu__decompose_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="412pt" height="46pt"
- viewBox="0.00 0.00 411.75 46.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 42.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-19.25 0,-19.25 0,0 37.75,0 37.75,-19.25"/>
-<text text-anchor="middle" x="18.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="153.5,-19.25 73.75,-19.25 73.75,0 153.5,0 153.5,-19.25"/>
-<text text-anchor="middle" x="113.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">determinant_lu</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.2,-9.62C45.25,-9.62 53.68,-9.62 62.3,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.11,-13.13 72.11,-9.63 62.11,-6.13 62.11,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="281.25,-38.25 189.5,-38.25 189.5,-19 281.25,-19 281.25,-38.25"/>
-<text text-anchor="middle" x="235.38" y="-24.75" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.84,-15.85C161.62,-17.08 169.94,-18.4 178.16,-19.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.34,-23.12 187.76,-21.23 178.43,-16.21 177.34,-23.12"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="403.75,-19.25 317.25,-19.25 317.25,0 403.75,0 403.75,-19.25"/>
-<text text-anchor="middle" x="360.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M153.97,-9.62C195.01,-9.62 259.64,-9.62 305.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.45,-13.13 315.45,-9.63 305.45,-6.13 305.45,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M281.52,-21.66C289.36,-20.45 297.58,-19.18 305.62,-17.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.97,-21.43 315.32,-16.44 304.9,-14.51 305.97,-21.43"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
deleted file mode 100644
index 072cb5183..000000000
--- a/dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="test1" name="test1">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,56,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/clock.html#" title=" " alt="" coords="126,5,204,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,56,113,34,115,39,57,61"/>
-<area shape="rect" id="Node000003" href="$d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" title=" " alt="" coords="104,55,226,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,65,88,65,88,70,56,70"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="129,104,201,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="57,74,115,96,113,101,55,79"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="274,55,389,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="226,65,258,65,258,70,226,70"/>
-</map>
diff --git a/dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
deleted file mode 100644
index 120d3f1fa..000000000
--- a/dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-06c145ce8d7ad28ec96baa63806fa578
\ No newline at end of file
diff --git a/dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg b/dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
deleted file mode 100644
index 5c7a2e84c..000000000
--- a/dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="296pt" height="101pt"
- viewBox="0.00 0.00 296.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-56.25 0,-56.25 0,-37 37.75,-37 37.75,-56.25"/>
-<text text-anchor="middle" x="18.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149,-93.25 90.25,-93.25 90.25,-74 149,-74 149,-93.25"/>
-<text text-anchor="middle" x="119.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.99,-53.41C50.08,-57.94 66.44,-64.07 81.25,-69.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.68,-72.77 90.27,-73 82.13,-66.21 79.68,-72.77"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.5,-56.25 73.75,-56.25 73.75,-37 165.5,-37 165.5,-56.25"/>
-<text text-anchor="middle" x="119.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.99,-46.62C44.96,-46.62 53.34,-46.62 62.02,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.01,-50.13 72.01,-46.63 62.01,-43.13 62.01,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146.75,-19.25 92.5,-19.25 92.5,0 146.75,0 146.75,-19.25"/>
-<text text-anchor="middle" x="119.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.99,-39.84C50.17,-35.27 66.68,-29.09 81.58,-23.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.51,-26.89 90.65,-20.11 80.05,-20.34 82.51,-26.89"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="288,-56.25 201.5,-56.25 201.5,-37 288,-37 288,-56.25"/>
-<text text-anchor="middle" x="244.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M165.77,-46.62C173.52,-46.62 181.64,-46.62 189.59,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.55,-50.13 199.55,-46.63 189.55,-43.13 189.55,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
deleted file mode 100644
index aea8d9015..000000000
--- a/dd/d65/lu__decompose_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="296pt" height="101pt"
- viewBox="0.00 0.00 296.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-56.25 0,-56.25 0,-37 37.75,-37 37.75,-56.25"/>
-<text text-anchor="middle" x="18.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149,-93.25 90.25,-93.25 90.25,-74 149,-74 149,-93.25"/>
-<text text-anchor="middle" x="119.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.99,-53.41C50.08,-57.94 66.44,-64.07 81.25,-69.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.68,-72.77 90.27,-73 82.13,-66.21 79.68,-72.77"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.5,-56.25 73.75,-56.25 73.75,-37 165.5,-37 165.5,-56.25"/>
-<text text-anchor="middle" x="119.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.99,-46.62C44.96,-46.62 53.34,-46.62 62.02,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.01,-50.13 72.01,-46.63 62.01,-43.13 62.01,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146.75,-19.25 92.5,-19.25 92.5,0 146.75,0 146.75,-19.25"/>
-<text text-anchor="middle" x="119.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.99,-39.84C50.17,-35.27 66.68,-29.09 81.58,-23.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.51,-26.89 90.65,-20.11 80.05,-20.34 82.51,-26.89"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="288,-56.25 201.5,-56.25 201.5,-37 288,-37 288,-56.25"/>
-<text text-anchor="middle" x="244.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M165.77,-46.62C173.52,-46.62 181.64,-46.62 189.59,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.55,-50.13 199.55,-46.63 189.55,-43.13 189.55,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
deleted file mode 100644
index 5f52b8759..000000000
--- a/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
+++ /dev/null
@@ -1,23 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,107,55,132"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="103,32,182,58"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,104,101,67,105,64,108,69,104,71,51,108"/>
-<area shape="rect" id="Node000003" href="$dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" title=" " alt="" coords="117,81,168,107"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,111,101,101,103,106,56,117"/>
-<area shape="rect" id="Node000008" href="$dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0" title=" " alt="" coords="117,131,168,156"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="56,122,103,132,101,138,55,127"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="106,180,178,206"/>
-<area shape="poly" id="edge11_Node000001_Node000010" title=" " alt="" coords="51,131,104,167,108,169,105,174,101,171,48,135"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/clock.html#" title=" " alt="" coords="244,5,322,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="166,79,243,36,246,41,169,83"/>
-<area shape="rect" id="Node000005" href="$d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" title=" " alt="" coords="384,105,507,131"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="168,90,243,87,337,92,380,99,379,104,336,97,243,93,168,95"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="247,107,319,132"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="168,96,233,108,232,113,167,101"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="555,131,670,156"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="507,125,540,130,539,135,507,130"/>
-<area shape="rect" id="Node000009" href="$d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" title=" " alt="" coords="230,156,336,182"/>
-<area shape="poly" id="edge8_Node000008_Node000009" title=" " alt="" coords="168,145,215,154,214,159,167,151"/>
-<area shape="poly" id="edge9_Node000009_Node000005" title=" " alt="" coords="326,153,387,133,389,139,328,158"/>
-<area shape="poly" id="edge10_Node000009_Node000006" title=" " alt="" coords="337,162,539,146,540,152,337,167"/>
-</map>
diff --git a/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
deleted file mode 100644
index 782ce4fe6..000000000
--- a/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c55720dc745650a5241dde4b3a5f0818
\ No newline at end of file
diff --git a/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
deleted file mode 100644
index 327fe5ca0..000000000
--- a/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
+++ /dev/null
@@ -1,284 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 158 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 507;
-var viewHeight = 158;
-var sectionId = 'dynsection-1';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-130.25 73,-130.25 73,-111 132.5,-111 132.5,-130.25"/>
-<text text-anchor="middle" x="102.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.98,-74.53C43.71,-82.33 59.16,-93.39 73,-102.62 73.86,-103.2 74.73,-103.78 75.62,-104.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.64,-107.25 83.95,-109.69 77.42,-101.35 73.64,-107.25"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="121.62,-93.25 83.88,-93.25 83.88,-74 121.62,-74 121.62,-93.25"/>
-<text text-anchor="middle" x="102.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-68.75C47.62,-71.12 60.79,-74.16 72.54,-76.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.65,-80.26 82.18,-79.1 73.22,-73.44 71.65,-80.26"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="121.62,-56.25 83.88,-56.25 83.88,-37 121.62,-37 121.62,-56.25"/>
-<text text-anchor="middle" x="102.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-60.72C47.62,-58.47 60.79,-55.59 72.54,-53.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.15,-56.47 82.18,-50.91 71.66,-49.63 73.15,-56.47"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-19.25 75.62,-19.25 75.62,0 129.88,0 129.88,-19.25"/>
-<text text-anchor="middle" x="102.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge11_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.46,-54.71C44.19,-47.16 59.42,-36.57 73,-27.62 74.01,-26.96 75.04,-26.29 76.08,-25.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.72,-28.72 84.27,-20.4 73.96,-22.82 77.72,-28.72"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.75,-150.25 179,-150.25 179,-131 237.75,-131 237.75,-150.25"/>
-<text text-anchor="middle" x="208.38" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.8,-93.55C137.68,-102.29 161.04,-115.14 179.35,-125.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.41,-128.14 187.86,-129.89 180.78,-122 177.41,-128.14"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="376,-75.25 284.25,-75.25 284.25,-56 376,-56 376,-75.25"/>
-<text text-anchor="middle" x="330.12" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.07,-84.9C149.57,-86.53 203.11,-88.59 248.25,-83.62 258.86,-82.46 270.1,-80.46 280.73,-78.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.5,-81.62 290.49,-76.02 279.96,-74.79 281.5,-81.62"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235.5,-74.25 181.25,-74.25 181.25,-55 235.5,-55 235.5,-74.25"/>
-<text text-anchor="middle" x="208.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.8,-80.32C135.09,-77.88 153.62,-74.48 170.04,-71.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.29,-74.98 179.49,-69.74 169.03,-68.1 170.29,-74.98"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="498.5,-56.25 412,-56.25 412,-37 498.5,-37 498.5,-56.25"/>
-<text text-anchor="middle" x="455.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M376.27,-58.66C384.11,-57.45 392.33,-56.18 400.37,-54.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="400.72,-58.43 410.07,-53.44 399.65,-51.51 400.72,-58.43"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.25,-37.25 168.5,-37.25 168.5,-18 248.25,-18 248.25,-37.25"/>
-<text text-anchor="middle" x="208.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">determinant_lu</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge8_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge8_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.8,-43.32C131.67,-41.51 144.43,-39.17 157.07,-36.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.38,-40.35 166.58,-35.1 156.11,-33.47 157.38,-40.35"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge9_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge9_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M241.15,-37.71C255.2,-42.17 271.92,-47.47 286.99,-52.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.58,-55.48 296.17,-55.17 287.7,-48.81 285.58,-55.48"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node6 -->
-<g id="edge10_Node000009_Node000006" class="edge">
-<title>Node9&#45;&gt;Node6</title>
-<g id="a_edge10_Node000009_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.72,-30.68C289.85,-33.87 354.66,-38.9 400.5,-42.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.96,-45.92 410.21,-43.21 400.51,-38.94 399.96,-45.92"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
deleted file mode 100644
index 557634b9a..000000000
--- a/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
+++ /dev/null
@@ -1,201 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="507pt" height="158pt"
- viewBox="0.00 0.00 506.50 158.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 154.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-130.25 73,-130.25 73,-111 132.5,-111 132.5,-130.25"/>
-<text text-anchor="middle" x="102.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.98,-74.53C43.71,-82.33 59.16,-93.39 73,-102.62 73.86,-103.2 74.73,-103.78 75.62,-104.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.64,-107.25 83.95,-109.69 77.42,-101.35 73.64,-107.25"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="121.62,-93.25 83.88,-93.25 83.88,-74 121.62,-74 121.62,-93.25"/>
-<text text-anchor="middle" x="102.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-68.75C47.62,-71.12 60.79,-74.16 72.54,-76.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.65,-80.26 82.18,-79.1 73.22,-73.44 71.65,-80.26"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="121.62,-56.25 83.88,-56.25 83.88,-37 121.62,-37 121.62,-56.25"/>
-<text text-anchor="middle" x="102.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-60.72C47.62,-58.47 60.79,-55.59 72.54,-53.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.15,-56.47 82.18,-50.91 71.66,-49.63 73.15,-56.47"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-19.25 75.62,-19.25 75.62,0 129.88,0 129.88,-19.25"/>
-<text text-anchor="middle" x="102.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge11_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.46,-54.71C44.19,-47.16 59.42,-36.57 73,-27.62 74.01,-26.96 75.04,-26.29 76.08,-25.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.72,-28.72 84.27,-20.4 73.96,-22.82 77.72,-28.72"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/clock.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="237.75,-150.25 179,-150.25 179,-131 237.75,-131 237.75,-150.25"/>
-<text text-anchor="middle" x="208.38" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::clock</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.8,-93.55C137.68,-102.29 161.04,-115.14 179.35,-125.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.41,-128.14 187.86,-129.89 180.78,-122 177.41,-128.14"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="376,-75.25 284.25,-75.25 284.25,-56 376,-56 376,-75.25"/>
-<text text-anchor="middle" x="330.12" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">lu_decomposition</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.07,-84.9C149.57,-86.53 203.11,-88.59 248.25,-83.62 258.86,-82.46 270.1,-80.46 280.73,-78.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="281.5,-81.62 290.49,-76.02 279.96,-74.79 281.5,-81.62"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235.5,-74.25 181.25,-74.25 181.25,-55 235.5,-55 235.5,-74.25"/>
-<text text-anchor="middle" x="208.38" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.8,-80.32C135.09,-77.88 153.62,-74.48 170.04,-71.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.29,-74.98 179.49,-69.74 169.03,-68.1 170.29,-74.98"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="498.5,-56.25 412,-56.25 412,-37 498.5,-37 498.5,-56.25"/>
-<text text-anchor="middle" x="455.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M376.27,-58.66C384.11,-57.45 392.33,-56.18 400.37,-54.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="400.72,-58.43 410.07,-53.44 399.65,-51.51 400.72,-58.43"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="248.25,-37.25 168.5,-37.25 168.5,-18 248.25,-18 248.25,-37.25"/>
-<text text-anchor="middle" x="208.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">determinant_lu</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge8_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge8_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M121.8,-43.32C131.67,-41.51 144.43,-39.17 157.07,-36.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.38,-40.35 166.58,-35.1 156.11,-33.47 157.38,-40.35"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node5 -->
-<g id="edge9_Node000009_Node000005" class="edge">
-<title>Node9&#45;&gt;Node5</title>
-<g id="a_edge9_Node000009_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M241.15,-37.71C255.2,-42.17 271.92,-47.47 286.99,-52.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="285.58,-55.48 296.17,-55.17 287.7,-48.81 285.58,-55.48"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node6 -->
-<g id="edge10_Node000009_Node000006" class="edge">
-<title>Node9&#45;&gt;Node6</title>
-<g id="a_edge10_Node000009_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.72,-30.68C289.85,-33.87 354.66,-38.9 400.5,-42.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="399.96,-45.92 410.21,-43.21 400.51,-38.94 399.96,-45.92"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.map b/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.map
deleted file mode 100644
index 6f2d94231..000000000
--- a/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="operator&lt;&lt;" name="operator&lt;&lt;">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,104,90,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="160,5,231,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="60,102,93,72,136,40,144,35,147,40,139,44,96,76,64,106"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/left.html#" title=" " alt="" coords="163,55,228,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="88,101,147,81,149,86,89,106"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setfill.html#" title=" " alt="" coords="156,104,234,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="90,114,141,114,141,120,90,120"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setw.html#" title=" " alt="" coords="158,153,233,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="89,128,144,146,142,151,88,133"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="138,203,253,228"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="64,128,96,158,139,189,146,193,143,198,136,194,93,162,60,132"/>
-</map>
diff --git a/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.md5 b/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.md5
deleted file mode 100644
index 75081c87e..000000000
--- a/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-58ca71fcfc592d99f44ef2bc0f19eadc
\ No newline at end of file
diff --git a/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.svg b/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.svg
deleted file mode 100644
index bce2b74b3..000000000
--- a/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator&lt;&lt; Pages: 1 -->
-<svg width="194pt" height="175pt"
- viewBox="0.00 0.00 193.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="63.25,-93.25 0,-93.25 0,-74 63.25,-74 63.25,-93.25"/>
-<text text-anchor="middle" x="31.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="169.25,-167.25 115.75,-167.25 115.75,-148 169.25,-148 169.25,-167.25"/>
-<text text-anchor="middle" x="142.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.28,-93.36C54.64,-105.42 77.11,-126.02 99.25,-139.62 101.14,-140.78 103.11,-141.9 105.13,-142.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.53,-146.09 114.06,-147.29 106.58,-139.79 103.53,-146.09"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/left.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="167,-130.25 118,-130.25 118,-111 167,-111 167,-130.25"/>
-<text text-anchor="middle" x="142.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::left</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.38,-93.74C76.22,-98.44 92.77,-104.07 107.15,-108.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.61,-112.13 116.21,-112.03 107.87,-105.5 105.61,-112.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="171.88,-93.25 113.12,-93.25 113.12,-74 171.88,-74 171.88,-93.25"/>
-<text text-anchor="middle" x="142.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.53,-83.62C75.37,-83.62 89.05,-83.62 101.62,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.24,-87.13 111.24,-83.63 101.24,-80.13 101.24,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170.75,-56.25 114.25,-56.25 114.25,-37 170.75,-37 170.75,-56.25"/>
-<text text-anchor="middle" x="142.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.38,-73.51C74.97,-69.24 89.8,-64.2 103.19,-59.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="104.25,-62.98 112.59,-56.45 102,-56.35 104.25,-62.98"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="185.75,-19.25 99.25,-19.25 99.25,0 185.75,0 185.75,-19.25"/>
-<text text-anchor="middle" x="142.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.28,-73.89C54.64,-61.83 77.11,-41.23 99.25,-27.62 100.88,-26.62 102.59,-25.65 104.33,-24.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.74,-27.91 113.17,-20.36 102.65,-21.63 105.74,-27.91"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph_org.svg b/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph_org.svg
deleted file mode 100644
index c9968ec45..000000000
--- a/dd/d65/lu__decompose_8cpp_a575c989afcc78e875031cd4273e62a3e_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operator&lt;&lt; Pages: 1 -->
-<svg width="194pt" height="175pt"
- viewBox="0.00 0.00 193.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>operator&lt;&lt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="63.25,-93.25 0,-93.25 0,-74 63.25,-74 63.25,-93.25"/>
-<text text-anchor="middle" x="31.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">operator&lt;&lt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="169.25,-167.25 115.75,-167.25 115.75,-148 169.25,-148 169.25,-167.25"/>
-<text text-anchor="middle" x="142.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.28,-93.36C54.64,-105.42 77.11,-126.02 99.25,-139.62 101.14,-140.78 103.11,-141.9 105.13,-142.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.53,-146.09 114.06,-147.29 106.58,-139.79 103.53,-146.09"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/left.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="167,-130.25 118,-130.25 118,-111 167,-111 167,-130.25"/>
-<text text-anchor="middle" x="142.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::left</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.38,-93.74C76.22,-98.44 92.77,-104.07 107.15,-108.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.61,-112.13 116.21,-112.03 107.87,-105.5 105.61,-112.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setfill.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="171.88,-93.25 113.12,-93.25 113.12,-74 171.88,-74 171.88,-93.25"/>
-<text text-anchor="middle" x="142.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setfill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M63.53,-83.62C75.37,-83.62 89.05,-83.62 101.62,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.24,-87.13 111.24,-83.63 101.24,-80.13 101.24,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170.75,-56.25 114.25,-56.25 114.25,-37 170.75,-37 170.75,-56.25"/>
-<text text-anchor="middle" x="142.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.38,-73.51C74.97,-69.24 89.8,-64.2 103.19,-59.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="104.25,-62.98 112.59,-56.45 102,-56.35 104.25,-62.98"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="185.75,-19.25 99.25,-19.25 99.25,0 185.75,0 185.75,-19.25"/>
-<text text-anchor="middle" x="142.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.28,-73.89C54.64,-61.83 77.11,-41.23 99.25,-27.62 100.88,-26.62 102.59,-25.65 104.33,-24.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.74,-27.91 113.17,-20.36 102.65,-21.63 105.74,-27.91"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d65/lu__decompose_8cpp_source.html b/dd/d65/lu__decompose_8cpp_source.html
new file mode 100644
index 000000000..7689b6724
--- /dev/null
+++ b/dd/d65/lu__decompose_8cpp_source.html
@@ -0,0 +1,228 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/lu_decompose.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dd/d65/lu__decompose_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">lu_decompose.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dd/d65/lu__decompose_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;iomanip&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &quot;<a class="code" href="../../d1/dbe/lu__decomposition_8h.html">./lu_decomposition.h</a>&quot;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00018" data-start="{" data-end="}">
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"><a class="line" href="../../dd/d65/lu__decompose_8cpp.html#a575c989afcc78e875031cd4273e62a3e">   18</a></span>std::ostream &amp;<a class="code hl_function" href="../../dd/d65/lu__decompose_8cpp.html#a575c989afcc78e875031cd4273e62a3e">operator&lt;&lt;</a>(std::ostream &amp;out, <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;T&gt;</a> <span class="keyword">const</span> &amp;v) {</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> width = 10;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="keyword">const</span> <span class="keywordtype">char</span> separator = <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> row = 0; row &lt; v.size(); row++) {</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> col = 0; col &lt; v[row].size(); col++)</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>            out &lt;&lt; std::left &lt;&lt; std::setw(width) &lt;&lt; std::setfill(separator)</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>                &lt;&lt; v[row][col];</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        out &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    }</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordflow">return</span> out;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>}</div>
+</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="foldopen" id="foldopen00036" data-start="{" data-end="}">
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">   36</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>() {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> = 3;  <span class="comment">// default matrix size</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> range = 50;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> range2 = range &gt;&gt; 1;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="comment">/* Create a square matrix with random values */</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;double&gt;</a> A(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>, std::valarray&lt;double&gt;(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>));</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;double&gt;</a> L(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>, std::valarray&lt;double&gt;(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>));  <span class="comment">// output</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;double&gt;</a> U(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>, std::valarray&lt;double&gt;(<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>));  <span class="comment">// output</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="comment">// calloc so that all valeus are &#39;0&#39; by default</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; j++)</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            <span class="comment">/* create random values in the limits [-range2, range-1] */</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            A[i][j] = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(std::rand() % range - range2);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    std::clock_t start_t = std::clock();</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509">lu_decomposition</a>(A, &amp;L, &amp;U);</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    std::clock_t end_t = std::clock();</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Time taken: &quot;</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>              &lt;&lt; <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end_t - start_t) / CLOCKS_PER_SEC &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;A = \n&quot;</span> &lt;&lt; A &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;L = \n&quot;</span> &lt;&lt; L &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;U = \n&quot;</span> &lt;&lt; U &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>}</div>
+</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="foldopen" id="foldopen00066" data-start="{" data-end="}">
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"><a class="line" href="../../dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0">   66</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>() {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Determinant test 1...&quot;</span>;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> A1({{1, 2, 3}, {4, 9, 6}, {7, 8, 9}});</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    assert(<a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(A1) == -48);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Determinant test 2...&quot;</span>;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;int&gt;</a> A2({{1, 2, 3}, {4, 5, 6}, {7, 8, 9}});</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    assert(<a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(A2) == 0);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Determinant test 3...&quot;</span>;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix&lt;float&gt;</a> A3({{1.2, 2.3, 3.4}, {4.5, 5.6, 6.7}, {7.8, 8.9, 9.0}});</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    assert(<a class="code hl_function" href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a>(A3) == 3.63);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed\n&quot;</span>;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>}</div>
+</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="foldopen" id="foldopen00084" data-start="{" data-end="}">
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"><a class="line" href="../../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">   84</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> **argv) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::srand(std::time(NULL));  <span class="comment">// random number initializer</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <a class="code hl_function" href="../../dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <a class="code hl_function" href="../../dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>();</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>}</div>
+</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="alu__decompose_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> <a href="#l00066">lu_decompose.cpp:66</a></div></div>
+<div class="ttc" id="alu__decompose_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition</b> <a href="#l00036">lu_decompose.cpp:36</a></div></div>
+<div class="ttc" id="alu__decompose_8cpp_html_a575c989afcc78e875031cd4273e62a3e"><div class="ttname"><a href="../../dd/d65/lu__decompose_8cpp.html#a575c989afcc78e875031cd4273e62a3e">operator&lt;&lt;</a></div><div class="ttdeci">std::ostream &amp; operator&lt;&lt;(std::ostream &amp;out, matrix&lt; T &gt; const &amp;v)</div><div class="ttdef"><b>Definition</b> <a href="#l00018">lu_decompose.cpp:18</a></div></div>
+<div class="ttc" id="alu__decomposition_8h_html"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html">lu_decomposition.h</a></div><div class="ttdoc">Functions associated with LU Decomposition of a square matrix.</div></div>
+<div class="ttc" id="alu__decomposition_8h_html_a3108d43bd32c6fb3b3c158476c51ba7f"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f">determinant_lu</a></div><div class="ttdeci">double determinant_lu(const matrix&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbe/lu__decomposition_8h_source.html#l00090">lu_decomposition.h:90</a></div></div>
+<div class="ttc" id="alu__decomposition_8h_html_a75b8a228c6419ecda6077255d6d60509"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509">lu_decomposition</a></div><div class="ttdeci">int lu_decomposition(const matrix&lt; T &gt; &amp;A, matrix&lt; double &gt; *L, matrix&lt; double &gt; *U)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbe/lu__decomposition_8h_source.html#l00029">lu_decomposition.h:29</a></div></div>
+<div class="ttc" id="alu__decomposition_8h_html_ac029b636b353cefbb18b2fcc71e427e4"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; matrix</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbe/lu__decomposition_8h_source.html#l00019">lu_decomposition.h:19</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a9977ad12548c4a49dee9dc3f0685aa54"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a></div><div class="ttdeci">ll mat_size</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00045">matrix_exponentiation.cpp:45</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../dd/d65/lu__decompose_8cpp.html">lu_decompose.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dd/d69/namespacerange__queries.html b/dd/d69/namespacerange__queries.html
index 5c5ae8225..4a871811b 100644
--- a/dd/d69/namespacerange__queries.html
+++ b/dd/d69/namespacerange__queries.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: range_queries Namespace Reference</title>
+<title>TheAlgorithms/C++: range_queries Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,7 +127,7 @@ $(function(){initNavTree('dd/d69/namespacerange__queries.html','../../'); initRe
 </div><!--header-->
 <div class="contents">
 
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>  
+<p>for std::vector  
 <a href="#details">More...</a></p>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
@@ -123,13 +140,13 @@ Classes</h2></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
-<div class="textblock"><p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
+<div class="textblock"><p>for std::vector </p>
 <p>Range Queries algorithms.</p>
 <p>Range queries algorithms.</p>
 <p>Algorithms and Data Structures that support range queries and updates.</p>
 <p>for assert for IO operations</p>
 <p>Range Queries</p>
-<p>for IO operations to manage dynamic memory for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>for IO operations to manage dynamic memory for std::vector</p>
 <p>for assert for IO operations</p>
 <p>Range Queries algorithms </p>
 </div></div><!-- contents -->
diff --git a/dd/d73/namespaceiterative__tree__traversals.html b/dd/d73/namespaceiterative__tree__traversals.html
index db132ce93..65c0a3323 100644
--- a/dd/d73/namespaceiterative__tree__traversals.html
+++ b/dd/d73/namespaceiterative__tree__traversals.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: iterative_tree_traversals Namespace Reference</title>
+<title>TheAlgorithms/C++: iterative_tree_traversals Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dd/d74/namespaceinorder__successor__of__bst.html b/dd/d74/namespaceinorder__successor__of__bst.html
index c9042f64f..ae1ea14de 100644
--- a/dd/d74/namespaceinorder__successor__of__bst.html
+++ b/dd/d74/namespaceinorder__successor__of__bst.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: inorder_successor_of_bst Namespace Reference</title>
+<title>TheAlgorithms/C++: inorder_successor_of_bst Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dd/d7a/classdouble__linked__list-members.html b/dd/d7a/classdouble__linked__list-members.html
index dfad8bf83..8a0adf37c 100644
--- a/dd/d7a/classdouble__linked__list-members.html
+++ b/dd/d7a/classdouble__linked__list-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dd/d81/namespacecaesar.html b/dd/d81/namespacecaesar.html
index 9a701a866..0640087e8 100644
--- a/dd/d81/namespacecaesar.html
+++ b/dd/d81/namespacecaesar.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: caesar Namespace Reference</title>
+<title>TheAlgorithms/C++: caesar Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dd/d89/insertion__sort__recursive_8cpp.html b/dd/d89/insertion__sort__recursive_8cpp.html
index 62d86e1a4..ba9bb92f7 100644
--- a/dd/d89/insertion__sort__recursive_8cpp.html
+++ b/dd/d89/insertion__sort__recursive_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/insertion_sort_recursive.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/insertion_sort_recursive.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for insertion_sort_recursive.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d3f/insertion__sort__recursive_8cpp__incl.svg" width="350" height="126"><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">
+</div>
+<p><a href="../../dd/d89/insertion__sort__recursive_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -136,7 +155,7 @@ Functions</h2></td></tr>
 <tr class="memdesc:a78cb2f3b97b6db2c062b2a1df05c9ea9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insertion Sort Function.  <br /></td></tr>
 <tr class="separator:a78cb2f3b97b6db2c062b2a1df05c9ea9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a8fe6bac9e03f58abcc2ce26ef3de1b5f" id="r_a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f">sorting::insertionSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *arr)</td></tr>
+<tr class="memitem:a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f">sorting::insertionSort</a> (std::vector&lt; T &gt; *arr)</td></tr>
 <tr class="memdesc:a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insertion Sort for a vector.  <br /></td></tr>
 <tr class="separator:a8fe6bac9e03f58abcc2ce26ef3de1b5f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a59914553f24088342c139645a02a8a49" id="r_a59914553f24088342c139645a02a8a49"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
@@ -168,6 +187,8 @@ Functions</h2></td></tr>
 <li>Insert 2: [2, 3, 4, 5, 1].</li>
 <li>Continue this until the array is sorted: [1, 2, 3, 4, 5]. </li>
 </ol>
+
+<p class="definition">Definition in file <a class="el" href="../../dd/d89/insertion__sort__recursive_8cpp_source.html">insertion_sort_recursive.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a59914553f24088342c139645a02a8a49" name="a59914553f24088342c139645a02a8a49"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a59914553f24088342c139645a02a8a49">&#9670;&#160;</a></span>create_random_array()</h2>
@@ -212,20 +233,16 @@ template&lt;typename T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d89/insertion__sort__recursive_8cpp_source.html#l00094">94</a> of file <a class="el" href="../../dd/d89/insertion__sort__recursive_8cpp_source.html">insertion_sort_recursive.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   94</span>                                               {</div>
 <div class="line"><span class="lineno">   95</span>    <span class="keywordflow">while</span> (N--) {</div>
-<div class="line"><span class="lineno">   96</span>        <span class="keywordtype">double</span> r = (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 10000 - 5000) / 100.f;</div>
+<div class="line"><span class="lineno">   96</span>        <span class="keywordtype">double</span> r = (std::rand() % 10000 - 5000) / 100.f;</div>
 <div class="line"><span class="lineno">   97</span>        arr[<a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>] = <span class="keyword">static_cast&lt;</span>T<span class="keyword">&gt;</span>(r);</div>
 <div class="line"><span class="lineno">   98</span>    }</div>
 <div class="line"><span class="lineno">   99</span>}</div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d89/insertion__sort__recursive_8cpp_a59914553f24088342c139645a02a8a49_cgraph.svg" width="275" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -246,17 +263,14 @@ Here is the call graph for this function:</div>
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on successful exit. </dd></dl>
 <p>run self test implementations</p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d89/insertion__sort__recursive_8cpp_source.html#l00149">149</a> of file <a class="el" href="../../dd/d89/insertion__sort__recursive_8cpp_source.html">insertion_sort_recursive.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  149</span>           {</div>
-<div class="line"><span class="lineno">  150</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">/// run self test implementations</span></div>
+<div class="line"><span class="lineno">  150</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); </div>
 <div class="line"><span class="lineno">  151</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  152</span>}</div>
-<div class="ttc" id="ainsertion__sort__recursive_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">self test implementation</div><div class="ttdef"><b>Definition</b> insertion_sort_recursive.cpp:105</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d89/insertion__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="471" height="283"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ainsertion__sort__recursive_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">self test implementation</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d89/insertion__sort__recursive_8cpp_source.html#l00105">insertion_sort_recursive.cpp:105</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -284,59 +298,50 @@ Here is the call graph for this function:</div>
 
 <p>self test implementation </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d89/insertion__sort__recursive_8cpp_source.html#l00105">105</a> of file <a class="el" href="../../dd/d89/insertion__sort__recursive_8cpp_source.html">insertion_sort_recursive.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  105</span>                    {</div>
 <div class="line"><span class="lineno">  106</span>    <span class="keywordtype">int</span> arr1[10] = {78, 34, 35, 6, 34, 56, 3, 56, 2, 4};</div>
-<div class="line"><span class="lineno">  107</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
+<div class="line"><span class="lineno">  107</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
 <div class="line"><span class="lineno">  108</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr1, 10);</div>
-<div class="line"><span class="lineno">  109</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr1, arr1 + 10));</div>
-<div class="line"><span class="lineno">  110</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  109</span>    assert(std::is_sorted(arr1, arr1 + 10));</div>
+<div class="line"><span class="lineno">  110</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  111</span> </div>
 <div class="line"><span class="lineno">  112</span>    <span class="keywordtype">int</span> arr2[5] = {5, -3, 7, -2, 1};</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> &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
+<div class="line"><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
 <div class="line"><span class="lineno">  114</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr2, 5);</div>
-<div class="line"><span class="lineno">  115</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr2, arr2 + 5));</div>
-<div class="line"><span class="lineno">  116</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  115</span>    assert(std::is_sorted(arr2, arr2 + 5));</div>
+<div class="line"><span class="lineno">  116</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  117</span> </div>
 <div class="line"><span class="lineno">  118</span>    <span class="keywordtype">float</span> arr3[5] = {5.6, -3.1, -3.0, -2.1, 1.8};</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> &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
+<div class="line"><span class="lineno">  119</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
 <div class="line"><span class="lineno">  120</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr3, 5);</div>
-<div class="line"><span class="lineno">  121</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr3, arr3 + 5));</div>
-<div class="line"><span class="lineno">  122</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  121</span>    assert(std::is_sorted(arr3, arr3 + 5));</div>
+<div class="line"><span class="lineno">  122</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  123</span> </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&lt;float&gt;</a> arr4({5.6, -3.1, -3.0, -2.1, 1.8});</div>
-<div class="line"><span class="lineno">  125</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 4... &quot;</span>;</div>
+<div class="line"><span class="lineno">  124</span>    std::vector&lt;float&gt; arr4({5.6, -3.1, -3.0, -2.1, 1.8});</div>
+<div class="line"><span class="lineno">  125</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4... &quot;</span>;</div>
 <div class="line"><span class="lineno">  126</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(&amp;arr4);</div>
-<div class="line"><span class="lineno">  127</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr4), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr4)));</div>
-<div class="line"><span class="lineno">  128</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  127</span>    assert(std::is_sorted(std::begin(arr4), std::end(arr4)));</div>
+<div class="line"><span class="lineno">  128</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  129</span> </div>
 <div class="line"><span class="lineno">  130</span>    <span class="keywordtype">int</span> arr5[50];</div>
-<div class="line"><span class="lineno">  131</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 5... &quot;</span>;</div>
+<div class="line"><span class="lineno">  131</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 5... &quot;</span>;</div>
 <div class="line"><span class="lineno">  132</span>    <a class="code hl_function" href="#a59914553f24088342c139645a02a8a49">create_random_array</a>(arr5, 50);</div>
 <div class="line"><span class="lineno">  133</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr5, 50);</div>
-<div class="line"><span class="lineno">  134</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr5, arr5 + 50));</div>
-<div class="line"><span class="lineno">  135</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  134</span>    assert(std::is_sorted(arr5, arr5 + 50));</div>
+<div class="line"><span class="lineno">  135</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  136</span> </div>
 <div class="line"><span class="lineno">  137</span>    <span class="keywordtype">float</span> arr6[50];</div>
-<div class="line"><span class="lineno">  138</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 6... &quot;</span>;</div>
+<div class="line"><span class="lineno">  138</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 6... &quot;</span>;</div>
 <div class="line"><span class="lineno">  139</span>    <a class="code hl_function" href="#a59914553f24088342c139645a02a8a49">create_random_array</a>(arr6, 50);</div>
 <div class="line"><span class="lineno">  140</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr6, 50);</div>
-<div class="line"><span class="lineno">  141</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(arr6, arr6 + 50));</div>
-<div class="line"><span class="lineno">  142</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  141</span>    assert(std::is_sorted(arr6, arr6 + 50));</div>
+<div class="line"><span class="lineno">  142</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  143</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="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</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="ainsertion__sort__recursive_8cpp_html_a59914553f24088342c139645a02a8a49"><div class="ttname"><a href="#a59914553f24088342c139645a02a8a49">create_random_array</a></div><div class="ttdeci">static void create_random_array(T *arr, int N)</div><div class="ttdoc">Helper function to create a random array.</div><div class="ttdef"><b>Definition</b> insertion_sort_recursive.cpp:94</div></div>
-<div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-<div class="ttc" id="anamespacesorting_html_a78cb2f3b97b6db2c062b2a1df05c9ea9"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a></div><div class="ttdeci">void insertionSort(T *arr, int n)</div><div class="ttdoc">Insertion Sort Function.</div><div class="ttdef"><b>Definition</b> insertion_sort.cpp:59</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d89/insertion__sort__recursive_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="374" height="283"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ainsertion__sort__recursive_8cpp_html_a59914553f24088342c139645a02a8a49"><div class="ttname"><a href="#a59914553f24088342c139645a02a8a49">create_random_array</a></div><div class="ttdeci">static void create_random_array(T *arr, int N)</div><div class="ttdoc">Helper function to create a random array.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d89/insertion__sort__recursive_8cpp_source.html#l00094">insertion_sort_recursive.cpp:94</a></div></div>
+<div class="ttc" id="anamespacesorting_html_a78cb2f3b97b6db2c062b2a1df05c9ea9"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a></div><div class="ttdeci">void insertionSort(T *arr, int n)</div><div class="ttdoc">Insertion Sort Function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d0d/insertion__sort_8cpp_source.html#l00059">insertion_sort.cpp:59</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dd/d89/insertion__sort__recursive_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/dd/d89/insertion__sort__recursive_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index 8e41b1834..000000000
--- a/dd/d89/insertion__sort__recursive_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="self test implementation" alt="" coords="5,129,56,155"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="136,5,214,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="36,127,61,85,80,61,102,40,120,30,123,34,105,44,83,64,65,88,40,130"/>
-<area shape="rect" id="Node000003" href="$dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49" title="Helper function to create a random array." alt="" coords="104,55,247,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="46,127,72,108,102,89,113,84,115,89,105,94,75,112,49,131"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="141,104,210,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="55,135,125,123,126,128,56,140"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="140,153,211,179"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="56,144,125,155,124,160,56,149"/>
-<area shape="rect" id="Node000007" href="$d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9" title="Insertion Sort Function." alt="" coords="105,203,246,228"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="50,153,105,189,115,194,113,199,102,194,47,158"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="125,252,226,278"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="40,154,65,196,84,219,105,239,113,243,110,248,102,243,80,222,61,199,36,157"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="295,55,367,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="247,65,279,65,279,70,247,70"/>
-</map>
diff --git a/dd/d89/insertion__sort__recursive_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/dd/d89/insertion__sort__recursive_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index d5880b9a5..000000000
--- a/dd/d89/insertion__sort__recursive_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1ba55b36299ea4113f880c418c44c0b5
\ No newline at end of file
diff --git a/dd/d89/insertion__sort__recursive_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/dd/d89/insertion__sort__recursive_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index a90f88aca..000000000
--- a/dd/d89/insertion__sort__recursive_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,173 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="280pt" height="212pt"
- viewBox="0.00 0.00 279.50 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="self test implementation">
-<polygon fill="#999999" stroke="#666666" points="37.75,-111.25 0,-111.25 0,-92 37.75,-92 37.75,-111.25"/>
-<text text-anchor="middle" x="18.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="156.88,-204.25 98.12,-204.25 98.12,-185 156.88,-185 156.88,-204.25"/>
-<text text-anchor="middle" x="127.5" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.51,-111.65C32.4,-127.65 49.93,-158.95 73.75,-176.62 77.84,-179.66 82.47,-182.21 87.26,-184.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.82,-187.53 96.41,-187.83 88.31,-180.99 85.82,-187.53"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49" target="_top" xlink:title="Helper function to create a random array.">
-<polygon fill="white" stroke="#666666" points="181.25,-167.25 73.75,-167.25 73.75,-148 181.25,-148 181.25,-167.25"/>
-<text text-anchor="middle" x="127.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_random_array</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.65,-111.43C42.16,-119.81 58.25,-131.72 73.75,-139.62 76.31,-140.93 79,-142.18 81.73,-143.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.43,-146.61 91.02,-147.04 83.01,-140.1 80.43,-146.61"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="153.12,-130.25 101.88,-130.25 101.88,-111 153.12,-111 153.12,-130.25"/>
-<text text-anchor="middle" x="127.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-104.85C52.29,-107.4 72.77,-111.05 90.42,-114.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.57,-117.6 100.03,-115.91 90.79,-110.71 89.57,-117.6"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.25,-93.25 100.75,-93.25 100.75,-74 154.25,-74 154.25,-93.25"/>
-<text text-anchor="middle" x="127.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-98.57C52,-96.2 71.93,-92.84 89.33,-89.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.54,-93.41 98.82,-88.3 88.38,-86.51 89.54,-93.41"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9" target="_top" xlink:title="Insertion Sort Function.">
-<polygon fill="white" stroke="#666666" points="180.5,-56.25 74.5,-56.25 74.5,-37 180.5,-37 180.5,-56.25"/>
-<text text-anchor="middle" x="127.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.11,-91.78C42.66,-83.65 58.54,-72.26 73.75,-64.62 76.32,-63.33 79.01,-62.1 81.75,-60.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.02,-64.19 91.04,-57.27 80.46,-57.67 83.02,-64.19"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.12,-19.25 89.88,-19.25 89.88,0 165.12,0 165.12,-19.25"/>
-<text text-anchor="middle" x="127.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.55,-91.73C32.49,-75.95 50.08,-45.07 73.75,-27.62 75.53,-26.31 77.42,-25.09 79.37,-23.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.78,-27.16 88.22,-19.62 77.7,-20.87 80.78,-27.16"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.5,-167.25 217.25,-167.25 217.25,-148 271.5,-148 271.5,-167.25"/>
-<text text-anchor="middle" x="244.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M181.57,-157.62C189.59,-157.62 197.73,-157.62 205.35,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.3,-161.13 215.3,-157.63 205.3,-154.13 205.3,-161.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d89/insertion__sort__recursive_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/dd/d89/insertion__sort__recursive_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index b9f80c341..000000000
--- a/dd/d89/insertion__sort__recursive_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="280pt" height="212pt"
- viewBox="0.00 0.00 279.50 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="self test implementation">
-<polygon fill="#999999" stroke="#666666" points="37.75,-111.25 0,-111.25 0,-92 37.75,-92 37.75,-111.25"/>
-<text text-anchor="middle" x="18.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="156.88,-204.25 98.12,-204.25 98.12,-185 156.88,-185 156.88,-204.25"/>
-<text text-anchor="middle" x="127.5" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.51,-111.65C32.4,-127.65 49.93,-158.95 73.75,-176.62 77.84,-179.66 82.47,-182.21 87.26,-184.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.82,-187.53 96.41,-187.83 88.31,-180.99 85.82,-187.53"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49" target="_top" xlink:title="Helper function to create a random array.">
-<polygon fill="white" stroke="#666666" points="181.25,-167.25 73.75,-167.25 73.75,-148 181.25,-148 181.25,-167.25"/>
-<text text-anchor="middle" x="127.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_random_array</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.65,-111.43C42.16,-119.81 58.25,-131.72 73.75,-139.62 76.31,-140.93 79,-142.18 81.73,-143.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.43,-146.61 91.02,-147.04 83.01,-140.1 80.43,-146.61"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="153.12,-130.25 101.88,-130.25 101.88,-111 153.12,-111 153.12,-130.25"/>
-<text text-anchor="middle" x="127.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-104.85C52.29,-107.4 72.77,-111.05 90.42,-114.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.57,-117.6 100.03,-115.91 90.79,-110.71 89.57,-117.6"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="154.25,-93.25 100.75,-93.25 100.75,-74 154.25,-74 154.25,-93.25"/>
-<text text-anchor="middle" x="127.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.96,-98.57C52,-96.2 71.93,-92.84 89.33,-89.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.54,-93.41 98.82,-88.3 88.38,-86.51 89.54,-93.41"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9" target="_top" xlink:title="Insertion Sort Function.">
-<polygon fill="white" stroke="#666666" points="180.5,-56.25 74.5,-56.25 74.5,-37 180.5,-37 180.5,-56.25"/>
-<text text-anchor="middle" x="127.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.11,-91.78C42.66,-83.65 58.54,-72.26 73.75,-64.62 76.32,-63.33 79.01,-62.1 81.75,-60.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.02,-64.19 91.04,-57.27 80.46,-57.67 83.02,-64.19"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.12,-19.25 89.88,-19.25 89.88,0 165.12,0 165.12,-19.25"/>
-<text text-anchor="middle" x="127.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.55,-91.73C32.49,-75.95 50.08,-45.07 73.75,-27.62 75.53,-26.31 77.42,-25.09 79.37,-23.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.78,-27.16 88.22,-19.62 77.7,-20.87 80.78,-27.16"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.5,-167.25 217.25,-167.25 217.25,-148 271.5,-148 271.5,-167.25"/>
-<text text-anchor="middle" x="244.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M181.57,-157.62C189.59,-157.62 197.73,-157.62 205.35,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="205.3,-161.13 215.3,-157.63 205.3,-154.13 205.3,-161.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d89/insertion__sort__recursive_8cpp_a59914553f24088342c139645a02a8a49_cgraph.map b/dd/d89/insertion__sort__recursive_8cpp_a59914553f24088342c139645a02a8a49_cgraph.map
deleted file mode 100644
index 5fc87af60..000000000
--- a/dd/d89/insertion__sort__recursive_8cpp_a59914553f24088342c139645a02a8a49_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="create_random_array" name="create_random_array">
-<area shape="rect" id="Node000001" title="Helper function to create a random array." alt="" coords="5,5,149,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="197,5,269,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="149,16,181,16,181,21,149,21"/>
-</map>
diff --git a/dd/d89/insertion__sort__recursive_8cpp_a59914553f24088342c139645a02a8a49_cgraph.md5 b/dd/d89/insertion__sort__recursive_8cpp_a59914553f24088342c139645a02a8a49_cgraph.md5
deleted file mode 100644
index 443aba718..000000000
--- a/dd/d89/insertion__sort__recursive_8cpp_a59914553f24088342c139645a02a8a49_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1118cd2b5676fbe988d840bcfb658799
\ No newline at end of file
diff --git a/dd/d89/insertion__sort__recursive_8cpp_a59914553f24088342c139645a02a8a49_cgraph.svg b/dd/d89/insertion__sort__recursive_8cpp_a59914553f24088342c139645a02a8a49_cgraph.svg
deleted file mode 100644
index fbe084816..000000000
--- a/dd/d89/insertion__sort__recursive_8cpp_a59914553f24088342c139645a02a8a49_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: create_random_array Pages: 1 -->
-<svg width="206pt" height="27pt"
- viewBox="0.00 0.00 205.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>create_random_array</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Helper function to create a random array.">
-<polygon fill="#999999" stroke="#666666" points="107.5,-19.25 0,-19.25 0,0 107.5,0 107.5,-19.25"/>
-<text text-anchor="middle" x="53.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_random_array</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.75,-19.25 143.5,-19.25 143.5,0 197.75,0 197.75,-19.25"/>
-<text text-anchor="middle" x="170.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.82,-9.62C115.84,-9.62 123.98,-9.62 131.6,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.55,-13.13 141.55,-9.63 131.55,-6.13 131.55,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d89/insertion__sort__recursive_8cpp_a59914553f24088342c139645a02a8a49_cgraph_org.svg b/dd/d89/insertion__sort__recursive_8cpp_a59914553f24088342c139645a02a8a49_cgraph_org.svg
deleted file mode 100644
index 7fb3b97c8..000000000
--- a/dd/d89/insertion__sort__recursive_8cpp_a59914553f24088342c139645a02a8a49_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: create_random_array Pages: 1 -->
-<svg width="206pt" height="27pt"
- viewBox="0.00 0.00 205.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>create_random_array</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Helper function to create a random array.">
-<polygon fill="#999999" stroke="#666666" points="107.5,-19.25 0,-19.25 0,0 107.5,0 107.5,-19.25"/>
-<text text-anchor="middle" x="53.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_random_array</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="197.75,-19.25 143.5,-19.25 143.5,0 197.75,0 197.75,-19.25"/>
-<text text-anchor="middle" x="170.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.82,-9.62C115.84,-9.62 123.98,-9.62 131.6,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.55,-13.13 141.55,-9.63 131.55,-6.13 131.55,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d89/insertion__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dd/d89/insertion__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index ae72d2978..000000000
--- a/dd/d89/insertion__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,129,55,155"/>
-<area shape="rect" id="Node000002" href="$dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="self test implementation" alt="" coords="103,129,153,155"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,140,88,140,88,145,55,145"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="234,5,312,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="133,127,158,85,177,61,199,40,218,30,220,34,203,44,181,64,162,88,138,130"/>
-<area shape="rect" id="Node000004" href="$dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49" title="Helper function to create a random array." alt="" coords="201,55,344,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="143,127,169,108,200,89,211,84,213,89,202,94,172,112,146,131"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="238,104,307,130"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="153,135,223,123,224,128,154,140"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="237,153,308,179"/>
-<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="154,144,222,155,221,160,153,149"/>
-<area shape="rect" id="Node000008" href="$d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9" title="Insertion Sort Function." alt="" coords="202,203,343,228"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="147,153,202,189,213,194,211,199,200,194,144,158"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="222,252,323,278"/>
-<area shape="poly" id="edge8_Node000002_Node000009" title=" " alt="" coords="138,154,163,196,181,219,203,239,210,243,207,248,199,243,177,222,158,199,133,157"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="392,55,465,80"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="345,65,376,65,376,70,345,70"/>
-</map>
diff --git a/dd/d89/insertion__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dd/d89/insertion__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 333af3d0e..000000000
--- a/dd/d89/insertion__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2a7f935b85274a4d30132a531920c6e9
\ No newline at end of file
diff --git a/dd/d89/insertion__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dd/d89/insertion__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 5697b03b3..000000000
--- a/dd/d89/insertion__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,191 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="353pt" height="212pt"
- viewBox="0.00 0.00 352.50 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-111.25 0,-111.25 0,-92 37,-92 37,-111.25"/>
-<text text-anchor="middle" x="18.5" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="self test implementation">
-<polygon fill="white" stroke="#666666" points="110.75,-111.25 73,-111.25 73,-92 110.75,-92 110.75,-111.25"/>
-<text text-anchor="middle" x="91.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-101.62C44.55,-101.62 53.37,-101.62 61.69,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-105.13 71.43,-101.63 61.43,-98.13 61.43,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="229.88,-204.25 171.12,-204.25 171.12,-185 229.88,-185 229.88,-204.25"/>
-<text text-anchor="middle" x="200.5" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.51,-111.65C105.4,-127.65 122.93,-158.95 146.75,-176.62 150.84,-179.66 155.47,-182.21 160.26,-184.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.82,-187.53 169.41,-187.83 161.31,-180.99 158.82,-187.53"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49" target="_top" xlink:title="Helper function to create a random array.">
-<polygon fill="white" stroke="#666666" points="254.25,-167.25 146.75,-167.25 146.75,-148 254.25,-148 254.25,-167.25"/>
-<text text-anchor="middle" x="200.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_random_array</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.65,-111.43C115.16,-119.81 131.25,-131.72 146.75,-139.62 149.31,-140.93 152,-142.18 154.73,-143.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.43,-146.61 164.02,-147.04 156.01,-140.1 153.43,-146.61"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.12,-130.25 174.88,-130.25 174.88,-111 226.12,-111 226.12,-130.25"/>
-<text text-anchor="middle" x="200.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-104.85C125.29,-107.4 145.77,-111.05 163.42,-114.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.57,-117.6 173.03,-115.91 163.79,-110.71 162.57,-117.6"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.25,-93.25 173.75,-93.25 173.75,-74 227.25,-74 227.25,-93.25"/>
-<text text-anchor="middle" x="200.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-98.57C125,-96.2 144.93,-92.84 162.33,-89.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.54,-93.41 171.82,-88.3 161.38,-86.51 162.54,-93.41"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9" target="_top" xlink:title="Insertion Sort Function.">
-<polygon fill="white" stroke="#666666" points="253.5,-56.25 147.5,-56.25 147.5,-37 253.5,-37 253.5,-56.25"/>
-<text text-anchor="middle" x="200.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.11,-91.78C115.66,-83.65 131.54,-72.26 146.75,-64.62 149.32,-63.33 152.01,-62.1 154.75,-60.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.02,-64.19 164.04,-57.27 153.46,-57.67 156.02,-64.19"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.12,-19.25 162.88,-19.25 162.88,0 238.12,0 238.12,-19.25"/>
-<text text-anchor="middle" x="200.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.55,-91.73C105.49,-75.95 123.08,-45.07 146.75,-27.62 148.53,-26.31 150.42,-25.09 152.37,-23.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.78,-27.16 161.22,-19.62 150.7,-20.87 153.78,-27.16"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="344.5,-167.25 290.25,-167.25 290.25,-148 344.5,-148 344.5,-167.25"/>
-<text text-anchor="middle" x="317.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.57,-157.62C262.59,-157.62 270.73,-157.62 278.35,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.3,-161.13 288.3,-157.63 278.3,-154.13 278.3,-161.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d89/insertion__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dd/d89/insertion__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index ef5ed89b7..000000000
--- a/dd/d89/insertion__sort__recursive_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,165 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="353pt" height="212pt"
- viewBox="0.00 0.00 352.50 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-111.25 0,-111.25 0,-92 37,-92 37,-111.25"/>
-<text text-anchor="middle" x="18.5" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="self test implementation">
-<polygon fill="white" stroke="#666666" points="110.75,-111.25 73,-111.25 73,-92 110.75,-92 110.75,-111.25"/>
-<text text-anchor="middle" x="91.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-101.62C44.55,-101.62 53.37,-101.62 61.69,-101.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-105.13 71.43,-101.63 61.43,-98.13 61.43,-105.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="229.88,-204.25 171.12,-204.25 171.12,-185 229.88,-185 229.88,-204.25"/>
-<text text-anchor="middle" x="200.5" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.51,-111.65C105.4,-127.65 122.93,-158.95 146.75,-176.62 150.84,-179.66 155.47,-182.21 160.26,-184.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.82,-187.53 169.41,-187.83 161.31,-180.99 158.82,-187.53"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49" target="_top" xlink:title="Helper function to create a random array.">
-<polygon fill="white" stroke="#666666" points="254.25,-167.25 146.75,-167.25 146.75,-148 254.25,-148 254.25,-167.25"/>
-<text text-anchor="middle" x="200.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_random_array</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.65,-111.43C115.16,-119.81 131.25,-131.72 146.75,-139.62 149.31,-140.93 152,-142.18 154.73,-143.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.43,-146.61 164.02,-147.04 156.01,-140.1 153.43,-146.61"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="226.12,-130.25 174.88,-130.25 174.88,-111 226.12,-111 226.12,-130.25"/>
-<text text-anchor="middle" x="200.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-104.85C125.29,-107.4 145.77,-111.05 163.42,-114.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.57,-117.6 173.03,-115.91 163.79,-110.71 162.57,-117.6"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227.25,-93.25 173.75,-93.25 173.75,-74 227.25,-74 227.25,-93.25"/>
-<text text-anchor="middle" x="200.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-98.57C125,-96.2 144.93,-92.84 162.33,-89.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.54,-93.41 171.82,-88.3 161.38,-86.51 162.54,-93.41"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9" target="_top" xlink:title="Insertion Sort Function.">
-<polygon fill="white" stroke="#666666" points="253.5,-56.25 147.5,-56.25 147.5,-37 253.5,-37 253.5,-56.25"/>
-<text text-anchor="middle" x="200.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::insertionSort</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.11,-91.78C115.66,-83.65 131.54,-72.26 146.75,-64.62 149.32,-63.33 152.01,-62.1 154.75,-60.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.02,-64.19 164.04,-57.27 153.46,-57.67 156.02,-64.19"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.12,-19.25 162.88,-19.25 162.88,0 238.12,0 238.12,-19.25"/>
-<text text-anchor="middle" x="200.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.55,-91.73C105.49,-75.95 123.08,-45.07 146.75,-27.62 148.53,-26.31 150.42,-25.09 152.37,-23.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.78,-27.16 161.22,-19.62 150.7,-20.87 153.78,-27.16"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="344.5,-167.25 290.25,-167.25 290.25,-148 344.5,-148 344.5,-167.25"/>
-<text text-anchor="middle" x="317.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M254.57,-157.62C262.59,-157.62 270.73,-157.62 278.35,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="278.3,-161.13 288.3,-157.63 278.3,-154.13 278.3,-161.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d89/insertion__sort__recursive_8cpp_source.html b/dd/d89/insertion__sort__recursive_8cpp_source.html
new file mode 100644
index 000000000..68e125a56
--- /dev/null
+++ b/dd/d89/insertion__sort__recursive_8cpp_source.html
@@ -0,0 +1,238 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/insertion_sort_recursive.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dd/d89/insertion__sort__recursive_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">insertion_sort_recursive.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dd/d89/insertion__sort__recursive_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &lt;algorithm&gt;</span>   </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#include &lt;cassert&gt;</span>     </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;iostream&gt;</span>    </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="preprocessor">#include &lt;vector&gt;</span>      </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">insertionSort</a>(T *arr, <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; n; i++) {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        T temp = arr[i];</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <span class="keywordtype">int</span> j = i - 1;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="keywordflow">while</span> (j &gt;= 0 &amp;&amp; temp &lt; arr[j]) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            arr[j + 1] = arr[j];</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            j--;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        arr[j + 1] = temp;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    }</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>}</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">insertionSort</a>(std::vector&lt;T&gt; *arr) {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordtype">size_t</span> n = arr-&gt;size();</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 1; i &lt; n; i++) {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        T temp = arr-&gt;at(i);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        int32_t j = i - 1;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="keywordflow">while</span> (j &gt;= 0 &amp;&amp; temp &lt; arr-&gt;at(j)) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            arr-&gt;at(j + 1) = arr-&gt;at(j);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            j--;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        arr-&gt;at(j + 1) = temp;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    }</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>}</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00094" data-start="{" data-end="}">
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"><a class="line" href="../../dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49">   94</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49">create_random_array</a>(T *arr, <span class="keywordtype">int</span> N) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keywordflow">while</span> (N--) {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        <span class="keywordtype">double</span> r = (std::rand() % 10000 - 5000) / 100.f;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        arr[N] = <span class="keyword">static_cast&lt;</span>T<span class="keyword">&gt;</span>(r);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    }</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>}</div>
+</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="foldopen" id="foldopen00105" data-start="{" data-end="}">
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"><a class="line" href="../../dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">  105</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <span class="keywordtype">int</span> arr1[10] = {78, 34, 35, 6, 34, 56, 3, 56, 2, 4};</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr1, 10);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    assert(std::is_sorted(arr1, arr1 + 10));</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span> </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="keywordtype">int</span> arr2[5] = {5, -3, 7, -2, 1};</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr2, 5);</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    assert(std::is_sorted(arr2, arr2 + 5));</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span> </div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <span class="keywordtype">float</span> arr3[5] = {5.6, -3.1, -3.0, -2.1, 1.8};</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr3, 5);</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    assert(std::is_sorted(arr3, arr3 + 5));</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    std::vector&lt;float&gt; arr4({5.6, -3.1, -3.0, -2.1, 1.8});</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4... &quot;</span>;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(&amp;arr4);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    assert(std::is_sorted(std::begin(arr4), std::end(arr4)));</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="keywordtype">int</span> arr5[50];</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 5... &quot;</span>;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <a class="code hl_function" href="../../dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49">create_random_array</a>(arr5, 50);</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr5, 50);</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    assert(std::is_sorted(arr5, arr5 + 50));</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span> </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <span class="keywordtype">float</span> arr6[50];</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 6... &quot;</span>;</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <a class="code hl_function" href="../../dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49">create_random_array</a>(arr6, 50);</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a>(arr6, 50);</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    assert(std::is_sorted(arr6, arr6 + 50));</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>}</div>
+</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span> </div>
+<div class="foldopen" id="foldopen00149" data-start="{" data-end="}">
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"><a class="line" href="../../dd/d89/insertion__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  149</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d89/insertion__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    <a class="code hl_function" href="../../dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); </div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>}</div>
+</div>
+<div class="ttc" id="ainsertion__sort__recursive_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">self test implementation</div><div class="ttdef"><b>Definition</b> <a href="#l00105">insertion_sort_recursive.cpp:105</a></div></div>
+<div class="ttc" id="ainsertion__sort__recursive_8cpp_html_a59914553f24088342c139645a02a8a49"><div class="ttname"><a href="../../dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49">create_random_array</a></div><div class="ttdeci">static void create_random_array(T *arr, int N)</div><div class="ttdoc">Helper function to create a random array.</div><div class="ttdef"><b>Definition</b> <a href="#l00094">insertion_sort_recursive.cpp:94</a></div></div>
+<div class="ttc" id="ainsertion__sort__recursive_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d89/insertion__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00149">insertion_sort_recursive.cpp:149</a></div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+<div class="ttc" id="anamespacesorting_html_a78cb2f3b97b6db2c062b2a1df05c9ea9"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9">sorting::insertionSort</a></div><div class="ttdeci">void insertionSort(T *arr, int n)</div><div class="ttdoc">Insertion Sort Function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d0d/insertion__sort_8cpp_source.html#l00059">insertion_sort.cpp:59</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../dd/d89/insertion__sort__recursive_8cpp.html">insertion_sort_recursive.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dd/d8a/namespacegeometric__dist.html b/dd/d8a/namespacegeometric__dist.html
index 3b1c84f60..86efa21cb 100644
--- a/dd/d8a/namespacegeometric__dist.html
+++ b/dd/d8a/namespacegeometric__dist.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: geometric_dist Namespace Reference</title>
+<title>TheAlgorithms/C++: geometric_dist Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dd/d92/memory__game_8cpp.html b/dd/d92/memory__game_8cpp.html
index 064e73a04..598c60c2f 100644
--- a/dd/d92/memory__game_8cpp.html
+++ b/dd/d92/memory__game_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: games/memory_game.cpp File Reference</title>
+<title>TheAlgorithms/C++: games/memory_game.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -125,7 +142,9 @@ Include dependency graph for memory_game.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d18/memory__game_8cpp__incl.svg" width="603" height="111"><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">
+</div>
+<p><a href="../../dd/d92/memory__game_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d9c/namespacegames.html">games</a></td></tr>
@@ -146,27 +165,27 @@ Functions</h2></td></tr>
 <tr class="memdesc:a33167bb9cce6d527b478b4f6ae8c3f59"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to verify if the given input is a number or not. This is very useful to prevent the program being stuck in a loop.  <br /></td></tr>
 <tr class="separator:a33167bb9cce6d527b478b4f6ae8c3f59"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ad573c8ae66ab66156d03e5e81bbba214" id="r_ad573c8ae66ab66156d03e5e81bbba214"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ad573c8ae66ab66156d03e5e81bbba214"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214">games::memory_game::init</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *table)</td></tr>
+<tr class="memitem:ad573c8ae66ab66156d03e5e81bbba214"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214">games::memory_game::init</a> (std::vector&lt; T &gt; *table)</td></tr>
 <tr class="memdesc:ad573c8ae66ab66156d03e5e81bbba214"><td class="mdescLeft">&#160;</td><td class="mdescRight">Initializes the table with the letters.  <br /></td></tr>
 <tr class="separator:ad573c8ae66ab66156d03e5e81bbba214"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ac589ef65abb0a6b9a7116ee0f9fd5280" id="r_ac589ef65abb0a6b9a7116ee0f9fd5280"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ac589ef65abb0a6b9a7116ee0f9fd5280"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280">games::memory_game::print_table</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;table)</td></tr>
+<tr class="memitem:ac589ef65abb0a6b9a7116ee0f9fd5280"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280">games::memory_game::print_table</a> (const std::vector&lt; T &gt; &amp;table)</td></tr>
 <tr class="memdesc:ac589ef65abb0a6b9a7116ee0f9fd5280"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function to print the table.  <br /></td></tr>
 <tr class="separator:ac589ef65abb0a6b9a7116ee0f9fd5280"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:adc62ebb75853446656e24932bdc6dd6b" id="r_adc62ebb75853446656e24932bdc6dd6b"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:adc62ebb75853446656e24932bdc6dd6b"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b">games::memory_game::reset_data</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;table, int *answer, int *old_answer, int *memory_count)</td></tr>
+<tr class="memitem:adc62ebb75853446656e24932bdc6dd6b"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b">games::memory_game::reset_data</a> (const std::vector&lt; T &gt; &amp;table, int *answer, int *old_answer, int *memory_count)</td></tr>
 <tr class="memdesc:adc62ebb75853446656e24932bdc6dd6b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function that resets the data if the user enters an invalid value.  <br /></td></tr>
 <tr class="separator:adc62ebb75853446656e24932bdc6dd6b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a5714d97649c0edd57b4fb449799676a3" id="r_a5714d97649c0edd57b4fb449799676a3"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a5714d97649c0edd57b4fb449799676a3"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3">games::memory_game::ask_data</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;table, int *answer, int *old_answer, int *memory_count)</td></tr>
+<tr class="memitem:a5714d97649c0edd57b4fb449799676a3"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3">games::memory_game::ask_data</a> (const std::vector&lt; T &gt; &amp;table, int *answer, int *old_answer, int *memory_count)</td></tr>
 <tr class="memdesc:a5714d97649c0edd57b4fb449799676a3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that asks the user for their input in the table they previously chose.  <br /></td></tr>
 <tr class="separator:a5714d97649c0edd57b4fb449799676a3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a370760f2b328ad341bcb77d82fa17b01" id="r_a370760f2b328ad341bcb77d82fa17b01"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a370760f2b328ad341bcb77d82fa17b01"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d41/namespacegames_1_1memory__game.html#a370760f2b328ad341bcb77d82fa17b01">games::memory_game::match</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;table, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *table_empty, const int &amp;answer, bool *first_time, int *old_answer, int *memory_count)</td></tr>
+<tr class="memitem:a370760f2b328ad341bcb77d82fa17b01"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d41/namespacegames_1_1memory__game.html#a370760f2b328ad341bcb77d82fa17b01">games::memory_game::match</a> (const std::vector&lt; T &gt; &amp;table, std::vector&lt; T &gt; *table_empty, const int &amp;answer, bool *first_time, int *old_answer, int *memory_count)</td></tr>
 <tr class="memdesc:a370760f2b328ad341bcb77d82fa17b01"><td class="mdescLeft">&#160;</td><td class="mdescRight">Checks if the two values given by the user match.  <br /></td></tr>
 <tr class="separator:a370760f2b328ad341bcb77d82fa17b01"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a3ceeea62d8fa6c563e2c66359fd73413" id="r_a3ceeea62d8fa6c563e2c66359fd73413"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a3ceeea62d8fa6c563e2c66359fd73413"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d41/namespacegames_1_1memory__game.html#a3ceeea62d8fa6c563e2c66359fd73413">games::memory_game::assign_results</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *table_empty, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; *table, int *answer, bool *first_time, int *old_answer, int *memory_count)</td></tr>
+<tr class="memitem:a3ceeea62d8fa6c563e2c66359fd73413"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d8/d41/namespacegames_1_1memory__game.html#a3ceeea62d8fa6c563e2c66359fd73413">games::memory_game::assign_results</a> (std::vector&lt; T &gt; *table_empty, std::vector&lt; T &gt; *table, int *answer, bool *first_time, int *old_answer, int *memory_count)</td></tr>
 <tr class="memdesc:a3ceeea62d8fa6c563e2c66359fd73413"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to assign the results to the table.  <br /></td></tr>
 <tr class="separator:a3ceeea62d8fa6c563e2c66359fd73413"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
@@ -178,6 +197,8 @@ Functions</h2></td></tr>
 <p>The game consists on finding <b>the pair</b> of all the given letters depending on the table size. Once all of the instances are all found, the game will end and will ask you if you'd like to play again or not.</p>
 <p>It provides <b>3 different sizes</b> available that the user can choose (4x2, 5x2, 7x2). 7x2 being the biggest table size and hardest mode. The bigger the size, <b>the more letters are available</b>.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../dd/d92/memory__game_8cpp_source.html">memory_game.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -202,30 +223,31 @@ Functions</h2></td></tr>
 <p>&lt; Previous answer (number index).</p>
 <p>&lt; Counter to check if the user has already answered two values.</p>
 <p>&lt; Whether the user has answered 1 value or not (previous answered values do not count).</p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d92/memory__game_8cpp_source.html#l00360">360</a> of file <a class="el" href="../../dd/d92/memory__game_8cpp_source.html">memory_game.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  360</span>           {</div>
 <div class="line"><span class="lineno">  361</span>    <span class="comment">// Start randomizer. This changes the values every time.</span></div>
-<div class="line"><span class="lineno">  362</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>));</div>
+<div class="line"><span class="lineno">  362</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
 <div class="line"><span class="lineno">  363</span> </div>
-<div class="line"><span class="lineno">  364</span>    <span class="keywordtype">int</span> size = 0;       <span class="comment">///&lt; Size of the table.</span></div>
-<div class="line"><span class="lineno">  365</span>    <span class="keywordtype">int</span> selection = 0;  <span class="comment">///&lt; Selection of the size (4x2, 5x2, 7x2).</span></div>
+<div class="line"><span class="lineno">  364</span>    <span class="keywordtype">int</span> size = 0;       </div>
+<div class="line"><span class="lineno">  365</span>    <span class="keywordtype">int</span> selection = 0;  </div>
 <div class="line"><span class="lineno">  366</span> </div>
-<div class="line"><span class="lineno">  367</span>    <span class="keywordtype">int</span> response = 0;    <span class="comment">///&lt; The answer (number index) that the user chose.</span></div>
-<div class="line"><span class="lineno">  368</span>    <span class="keywordtype">int</span> old_answer = 0;  <span class="comment">///&lt; Previous answer (number index).</span></div>
+<div class="line"><span class="lineno">  367</span>    <span class="keywordtype">int</span> response = 0;    </div>
+<div class="line"><span class="lineno">  368</span>    <span class="keywordtype">int</span> old_answer = 0;  </div>
 <div class="line"><span class="lineno">  369</span> </div>
 <div class="line"><span class="lineno">  370</span>    <span class="keywordtype">int</span> memory_count =</div>
-<div class="line"><span class="lineno">  371</span>        0;  <span class="comment">///&lt; Counter to check if the user has already answered two values.</span></div>
-<div class="line"><span class="lineno">  372</span>    <span class="keywordtype">bool</span> first_time = <span class="keyword">true</span>;  <span class="comment">///&lt; Whether the user has answered 1 value or not</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  373</span><span class="comment">                             ///&lt; (previous answered values do not count).</span></div>
-<div class="line"><span class="lineno">  374</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  375</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tMEMORY GAME\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  371</span>        0;  </div>
+<div class="line"><span class="lineno">  372</span>    <span class="keywordtype">bool</span> first_time = <span class="keyword">true</span>;  </div>
+<div class="line"><span class="lineno">  374</span> </div>
+<div class="line"><span class="lineno">  375</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tMEMORY GAME\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  376</span> </div>
 <div class="line"><span class="lineno">  377</span>    <span class="keywordflow">do</span> {</div>
-<div class="line"><span class="lineno">  378</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n1. 4x2 (1)&quot;</span>;</div>
-<div class="line"><span class="lineno">  379</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n2. 5x2 (2)&quot;</span>;</div>
-<div class="line"><span class="lineno">  380</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n3. 7x2 (3)\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  378</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n1. 4x2 (1)&quot;</span>;</div>
+<div class="line"><span class="lineno">  379</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n2. 5x2 (2)&quot;</span>;</div>
+<div class="line"><span class="lineno">  380</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n3. 7x2 (3)\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  381</span> </div>
-<div class="line"><span class="lineno">  382</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nChoose table size: &quot;</span>;</div>
-<div class="line"><span class="lineno">  383</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; selection;</div>
+<div class="line"><span class="lineno">  382</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nChoose table size: &quot;</span>;</div>
+<div class="line"><span class="lineno">  383</span>        std::cin &gt;&gt; selection;</div>
 <div class="line"><span class="lineno">  384</span>    } <span class="keywordflow">while</span> ((selection &lt; 1 || selection &gt; 3) &amp;&amp;</div>
 <div class="line"><span class="lineno">  385</span>             (!<a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59">games::memory_game::is_number</a>(selection)));</div>
 <div class="line"><span class="lineno">  386</span> </div>
@@ -244,10 +266,10 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  399</span>            <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">  400</span>    }</div>
 <div class="line"><span class="lineno">  401</span> </div>
-<div class="line"><span class="lineno">  402</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;char&gt;</a> table(size);</div>
-<div class="line"><span class="lineno">  403</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;char&gt;</a> table_empty(size);</div>
+<div class="line"><span class="lineno">  402</span>    std::vector&lt;char&gt; table(size);</div>
+<div class="line"><span class="lineno">  403</span>    std::vector&lt;char&gt; table_empty(size);</div>
 <div class="line"><span class="lineno">  404</span> </div>
-<div class="line"><span class="lineno">  405</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  405</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  406</span> </div>
 <div class="line"><span class="lineno">  407</span>    <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214">games::memory_game::init</a>(&amp;table);</div>
 <div class="line"><span class="lineno">  408</span>    <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3">games::memory_game::ask_data</a>(table_empty, &amp;response, &amp;old_answer,</div>
@@ -257,21 +279,11 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  412</span> </div>
 <div class="line"><span class="lineno">  413</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  414</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="anamespacegames_1_1memory__game_html_a33167bb9cce6d527b478b4f6ae8c3f59"><div class="ttname"><a href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59">games::memory_game::is_number</a></div><div class="ttdeci">bool is_number(const T &amp;input)</div><div class="ttdoc">Utility function to verify if the given input is a number or not. This is very useful to prevent the ...</div><div class="ttdef"><b>Definition</b> memory_game.cpp:62</div></div>
-<div class="ttc" id="anamespacegames_1_1memory__game_html_a3ceeea62d8fa6c563e2c66359fd73413"><div class="ttname"><a href="../../d8/d41/namespacegames_1_1memory__game.html#a3ceeea62d8fa6c563e2c66359fd73413">games::memory_game::assign_results</a></div><div class="ttdeci">void assign_results(std::vector&lt; T &gt; *table_empty, std::vector&lt; T &gt; *table, int *answer, bool *first_time, int *old_answer, int *memory_count)</div><div class="ttdoc">Function to assign the results to the table.</div><div class="ttdef"><b>Definition</b> memory_game.cpp:289</div></div>
-<div class="ttc" id="anamespacegames_1_1memory__game_html_a5714d97649c0edd57b4fb449799676a3"><div class="ttname"><a href="../../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3">games::memory_game::ask_data</a></div><div class="ttdeci">void ask_data(const std::vector&lt; T &gt; &amp;table, int *answer, int *old_answer, int *memory_count)</div><div class="ttdoc">Function that asks the user for their input in the table they previously chose.</div><div class="ttdef"><b>Definition</b> memory_game.cpp:161</div></div>
-<div class="ttc" id="anamespacegames_1_1memory__game_html_ad573c8ae66ab66156d03e5e81bbba214"><div class="ttname"><a href="../../d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214">games::memory_game::init</a></div><div class="ttdeci">void init(std::vector&lt; T &gt; *table)</div><div class="ttdoc">Initializes the table with the letters.</div><div class="ttdef"><b>Definition</b> memory_game.cpp:80</div></div>
-<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="667" height="438"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacegames_1_1memory__game_html_a33167bb9cce6d527b478b4f6ae8c3f59"><div class="ttname"><a href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59">games::memory_game::is_number</a></div><div class="ttdeci">bool is_number(const T &amp;input)</div><div class="ttdoc">Utility function to verify if the given input is a number or not. This is very useful to prevent the ...</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d92/memory__game_8cpp_source.html#l00062">memory_game.cpp:62</a></div></div>
+<div class="ttc" id="anamespacegames_1_1memory__game_html_a3ceeea62d8fa6c563e2c66359fd73413"><div class="ttname"><a href="../../d8/d41/namespacegames_1_1memory__game.html#a3ceeea62d8fa6c563e2c66359fd73413">games::memory_game::assign_results</a></div><div class="ttdeci">void assign_results(std::vector&lt; T &gt; *table_empty, std::vector&lt; T &gt; *table, int *answer, bool *first_time, int *old_answer, int *memory_count)</div><div class="ttdoc">Function to assign the results to the table.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d92/memory__game_8cpp_source.html#l00289">memory_game.cpp:289</a></div></div>
+<div class="ttc" id="anamespacegames_1_1memory__game_html_a5714d97649c0edd57b4fb449799676a3"><div class="ttname"><a href="../../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3">games::memory_game::ask_data</a></div><div class="ttdeci">void ask_data(const std::vector&lt; T &gt; &amp;table, int *answer, int *old_answer, int *memory_count)</div><div class="ttdoc">Function that asks the user for their input in the table they previously chose.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d92/memory__game_8cpp_source.html#l00161">memory_game.cpp:161</a></div></div>
+<div class="ttc" id="anamespacegames_1_1memory__game_html_ad573c8ae66ab66156d03e5e81bbba214"><div class="ttname"><a href="../../d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214">games::memory_game::init</a></div><div class="ttdeci">void init(std::vector&lt; T &gt; *table)</div><div class="ttdoc">Initializes the table with the letters.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d92/memory__game_8cpp_source.html#l00080">memory_game.cpp:80</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5bdc30951221eae9c33413ff9eb574f6" name="a5bdc30951221eae9c33413ff9eb574f6"></a>
@@ -300,7 +312,9 @@ template&lt;typename T &gt; </div>
 </div><div class="memdoc">
 
 <p>for sleep() </p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html">std::shuffle()</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand()</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time()</a> for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html">std::mt19937</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
+<p>for std::shuffle() for std::srand() for std::time() for IO operations for std::mt19937 for std::vector </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d92/memory__game_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../dd/d92/memory__game_8cpp_source.html">memory_game.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   36</span>                             {</div>
 <div class="line"><span class="lineno">   37</span>    <span class="keywordflow">return</span> sleep(seconds);</div>
 <div class="line"><span class="lineno">   38</span>}</div>
diff --git a/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 38ee758ae..000000000
--- a/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,39 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,213,55,238"/>
-<area shape="rect" id="Node000002" href="$d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3" title="Function that asks the user for their input in the table they previously chose." alt="" coords="305,71,459,111"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="36,211,61,174,80,154,101,138,147,117,195,103,244,94,289,89,290,94,244,99,196,108,149,122,104,143,83,158,66,177,41,214"/>
-<area shape="rect" id="Node000003" href="$d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59" title="Utility function to verify if the given input is a number or not. This is very useful to prevent the ..." alt="" coords="507,5,662,46"/>
-<area shape="poly" id="edge19_Node000001_Node000003" title=" " alt="" coords="32,211,54,156,74,124,101,97,147,69,196,48,248,32,301,22,403,12,492,14,492,19,404,18,302,27,249,37,198,53,149,74,104,101,78,127,59,158,37,213"/>
-<area shape="rect" id="Node000006" href="$d8/d41/namespacegames_1_1memory__game.html#a3ceeea62d8fa6c563e2c66359fd73413" title="Function to assign the results to the table." alt="" coords="103,176,257,217"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="54,218,87,212,88,217,55,224"/>
-<area shape="rect" id="Node000007" href="$d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214" title="Initializes the table with the letters." alt="" coords="305,300,459,341"/>
-<area shape="poly" id="edge18_Node000001_Node000007" title=" " alt="" coords="56,228,145,248,258,276,308,292,307,297,256,282,144,253,55,233"/>
-<area shape="rect" id="Node000015" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="140,292,220,317"/>
-<area shape="poly" id="edge20_Node000001_Node000015" title=" " alt="" coords="51,237,104,270,130,283,128,288,101,275,48,241"/>
-<area shape="rect" id="Node000016" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="144,341,216,366"/>
-<area shape="poly" id="edge21_Node000001_Node000016" title=" " alt="" coords="39,238,63,282,82,307,104,327,130,341,127,345,101,332,78,310,59,285,35,240"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="446,68,504,49,506,54,448,73"/>
-<area shape="rect" id="Node000004" href="$d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280" title="Utility function to print the table." alt="" coords="507,136,662,177"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="448,109,506,128,504,133,446,114"/>
-<area shape="rect" id="Node000005" href="$d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b" title="Utility function that resets the data if the user enters an invalid value." alt="" coords="507,71,662,111"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="460,97,492,97,492,103,460,102"/>
-<area shape="poly" id="edge5_Node000005_Node000002" title=" " alt="" coords="507,85,475,85,475,79,507,80"/>
-<area shape="poly" id="edge7_Node000006_Node000002" title=" " alt="" coords="218,173,304,127,325,116,327,121,306,132,221,178"/>
-<area shape="poly" id="edge16_Node000006_Node000004" title=" " alt="" coords="257,178,305,171,401,162,491,157,492,162,401,167,305,176,258,184"/>
-<area shape="poly" id="edge8_Node000006_Node000006" title=" " alt="" coords="151,176,149,166,154,157,164,151,180,149,197,152,206,158,204,163,195,157,180,155,166,156,158,161,155,167,156,175"/>
-<area shape="poly" id="edge9_Node000006_Node000007" title=" " alt="" coords="230,215,259,233,274,247,283,260,292,273,307,286,312,290,309,294,303,290,288,277,279,264,269,251,255,237,227,220"/>
-<area shape="rect" id="Node000013" href="$d8/d41/namespacegames_1_1memory__game.html#a370760f2b328ad341bcb77d82fa17b01" title="Checks if the two values given by the user match." alt="" coords="305,185,459,226"/>
-<area shape="poly" id="edge15_Node000006_Node000013" title=" " alt="" coords="257,197,290,199,290,204,257,203"/>
-<area shape="rect" id="Node000014" href="$dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6" title="for sleep()" alt="" coords="350,250,414,276"/>
-<area shape="poly" id="edge17_Node000006_Node000014" title=" " alt="" coords="245,215,336,245,335,250,243,220"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="523,209,646,234"/>
-<area shape="poly" id="edge10_Node000007_Node000008" title=" " alt="" coords="438,297,458,286,481,265,491,254,506,243,515,239,518,243,509,248,495,258,485,268,461,291,440,302"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="528,258,641,284"/>
-<area shape="poly" id="edge11_Node000007_Node000009" title=" " alt="" coords="459,299,514,285,515,291,460,304"/>
-<area shape="rect" id="Node000010" 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="507,308,662,333"/>
-<area shape="poly" id="edge12_Node000007_Node000010" title=" " alt="" coords="460,318,492,318,492,323,460,323"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/random_shuffle.html#" title=" " alt="" coords="541,357,628,382"/>
-<area shape="poly" id="edge13_Node000007_Node000011" title=" " alt="" coords="460,337,527,353,526,358,459,342"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="527,406,642,432"/>
-<area shape="poly" id="edge14_Node000007_Node000012" title=" " alt="" coords="415,339,458,366,508,393,521,398,519,403,506,397,456,371,412,343"/>
-</map>
diff --git a/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index efb763424..000000000
--- a/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e44c9823c199aeec1c85e433246dc8c1
\ No newline at end of file
diff --git a/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index dc6f4e850..000000000
--- a/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,378 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="500pt" height="328pt"
- viewBox="0.00 0.00 500.25 327.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 323.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-164.25 0,-164.25 0,-145 37,-145 37,-164.25"/>
-<text text-anchor="middle" x="18.5" y="-150.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3" target="_top" xlink:title="Function that asks the user for their input in the table they previously chose.">
-<polygon fill="white" stroke="#666666" points="340.5,-270.88 224.75,-270.88 224.75,-240.38 340.5,-240.38 340.5,-270.88"/>
-<text text-anchor="start" x="232.75" y="-257.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="282.62" y="-246.12" font-family="Helvetica,sans-Serif" font-size="10.00">::ask_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.88,-164.74C33.16,-179.23 50.44,-205.56 73,-218.62 115.42,-243.2 170.22,-252.21 213.01,-255.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.76,-258.7 222.95,-255.8 213.17,-251.71 212.76,-258.7"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59" target="_top" xlink:title="Utility function to verify if the given input is a number or not. This is very useful to prevent the ...">
-<polygon fill="white" stroke="#666666" points="492.25,-319.88 376.5,-319.88 376.5,-289.38 492.25,-289.38 492.25,-319.88"/>
-<text text-anchor="start" x="384.5" y="-306.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="434.38" y="-295.12" font-family="Helvetica,sans-Serif" font-size="10.00">::is_number</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge19_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge19_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.07,-164.55C27.71,-184.19 43.1,-227.98 73,-249.62 159,-311.88 287.03,-316.16 365.09,-311.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.96,-315.23 374.72,-311.1 364.51,-308.25 364.96,-315.23"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a3ceeea62d8fa6c563e2c66359fd73413" target="_top" xlink:title="Function to assign the results to the table.">
-<polygon fill="white" stroke="#666666" points="188.75,-191.88 73,-191.88 73,-161.38 188.75,-161.38 188.75,-191.88"/>
-<text text-anchor="start" x="81" y="-178.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="130.88" y="-167.12" font-family="Helvetica,sans-Serif" font-size="10.00">::assign_results</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-158.16C44.17,-159.54 52.59,-161.22 61.5,-163"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.57,-166.38 71.06,-164.9 61.94,-159.51 60.57,-166.38"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214" target="_top" xlink:title="Initializes the table with the letters.">
-<polygon fill="white" stroke="#666666" points="340.5,-98.88 224.75,-98.88 224.75,-68.38 340.5,-68.38 340.5,-98.88"/>
-<text text-anchor="start" x="232.75" y="-85.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="282.62" y="-74.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge18_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge18_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.42,-150.94C68.47,-144.45 134.15,-130.15 188.75,-114.62 201.14,-111.1 214.34,-106.94 226.78,-102.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.66,-106.24 236.04,-99.75 225.44,-99.6 227.66,-106.24"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.62,-105.25 101.12,-105.25 101.12,-86 160.62,-86 160.62,-105.25"/>
-<text text-anchor="middle" x="130.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node15 -->
-<g id="edge20_Node000001_Node000015" class="edge">
-<title>Node1&#45;&gt;Node15</title>
-<g id="a_edge20_Node000001_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.16,-144.7C43.73,-137.27 58.89,-127.14 73,-119.62 79.33,-116.25 86.24,-113 92.99,-110.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.13,-113.36 101.97,-106.24 91.4,-106.92 94.13,-113.36"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158,-68.25 103.75,-68.25 103.75,-49 158,-49 158,-68.25"/>
-<text text-anchor="middle" x="130.88" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge21_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge21_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.69,-144.67C31.16,-128.1 48.33,-94.92 73,-76.62 78.79,-72.33 85.63,-69.05 92.52,-66.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.31,-69.95 101.82,-63.64 91.23,-63.27 93.31,-69.95"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M331.42,-271.26C345.13,-275.75 360.24,-280.69 374.53,-285.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="373.23,-288.63 383.83,-288.41 375.41,-281.98 373.23,-288.63"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280" target="_top" xlink:title="Utility function to print the table.">
-<polygon fill="white" stroke="#666666" points="492.25,-221.88 376.5,-221.88 376.5,-191.38 492.25,-191.38 492.25,-221.88"/>
-<text text-anchor="start" x="384.5" y="-208.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="434.38" y="-197.12" font-family="Helvetica,sans-Serif" font-size="10.00">::print_table</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M331.42,-239.99C345.13,-235.5 360.24,-230.56 374.53,-225.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="375.41,-229.27 383.83,-222.84 373.23,-222.62 375.41,-229.27"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b" target="_top" xlink:title="Utility function that resets the data if the user enters an invalid value.">
-<polygon fill="white" stroke="#666666" points="492.25,-270.88 376.5,-270.88 376.5,-240.38 492.25,-240.38 492.25,-270.88"/>
-<text text-anchor="start" x="384.5" y="-257.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="434.38" y="-246.12" font-family="Helvetica,sans-Serif" font-size="10.00">::reset_data</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.67,-249.05C348.64,-248.89 356.91,-248.84 365.07,-248.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.93,-252.4 374.98,-249.03 365.03,-245.4 364.93,-252.4"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge5_Node000005_Node000002" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge5_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M376.49,-262.2C368.52,-262.36 360.26,-262.41 352.09,-262.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.23,-258.85 342.18,-262.22 352.13,-265.85 352.23,-258.85"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node2 -->
-<g id="edge7_Node000006_Node000002" class="edge">
-<title>Node6&#45;&gt;Node2</title>
-<g id="a_edge7_Node000006_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.65,-192.33C178.95,-202.27 203.18,-215.32 224.75,-226.62 229.84,-229.29 235.19,-232.06 240.5,-234.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.72,-237.82 249.22,-239.26 241.91,-231.58 238.72,-237.82"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge16_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge16_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.18,-188.22C200.91,-190.28 213.2,-192.21 224.75,-193.62 271.24,-199.31 323.88,-202.56 364.65,-204.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.44,-207.89 374.58,-204.82 364.74,-200.9 364.44,-207.89"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge8_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge8_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-192.36C106.9,-201.43 113.54,-209.88 130.88,-209.88 140.36,-209.88 146.64,-207.35 149.72,-203.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.18,-204.15 150.64,-193.87 146.21,-203.49 153.18,-204.15"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge9_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge9_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.67,-160.91C174.95,-157.03 182.33,-152.55 188.75,-147.62 207.72,-133.06 205.27,-121.5 224.75,-107.62 226.09,-106.67 227.47,-105.75 228.88,-104.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.3,-108.07 237.28,-100.1 226.85,-101.98 230.3,-108.07"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a370760f2b328ad341bcb77d82fa17b01" target="_top" xlink:title="Checks if the two values given by the user match.">
-<polygon fill="white" stroke="#666666" points="340.5,-184.88 224.75,-184.88 224.75,-154.38 340.5,-154.38 340.5,-184.88"/>
-<text text-anchor="start" x="232.75" y="-171.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="282.62" y="-160.12" font-family="Helvetica,sans-Serif" font-size="10.00">::match</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node13 -->
-<g id="edge15_Node000006_Node000013" class="edge">
-<title>Node6&#45;&gt;Node13</title>
-<g id="a_edge15_Node000006_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.92,-173.96C196.89,-173.59 205.16,-173.2 213.32,-172.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.4,-176.32 223.23,-172.35 213.08,-169.33 213.4,-176.32"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6" target="_top" xlink:title="for sleep()">
-<polygon fill="white" stroke="#666666" points="306.75,-136.25 258.5,-136.25 258.5,-117 306.75,-117 306.75,-136.25"/>
-<text text-anchor="middle" x="282.62" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">SLEEP</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node14 -->
-<g id="edge17_Node000006_Node000014" class="edge">
-<title>Node6&#45;&gt;Node14</title>
-<g id="a_edge17_Node000006_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M178.85,-160.94C201.14,-153.5 227.28,-144.77 247.62,-137.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.45,-141.39 256.82,-134.91 246.23,-134.75 248.45,-141.39"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="480.25,-167.25 388.5,-167.25 388.5,-148 480.25,-148 480.25,-167.25"/>
-<text text-anchor="middle" x="434.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge10_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge10_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M325.13,-99.25C330.44,-101.79 335.7,-104.59 340.5,-107.62 358.6,-119.05 357.89,-129.05 376.5,-139.62 378.7,-140.87 380.99,-142.04 383.34,-143.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="381.93,-146.35 392.51,-146.95 384.61,-139.88 381.93,-146.35"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="476.5,-130.25 392.25,-130.25 392.25,-111 476.5,-111 476.5,-130.25"/>
-<text text-anchor="middle" x="434.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge11_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge11_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.67,-97.72C354.23,-101.07 368.62,-104.62 381.91,-107.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="380.76,-111.23 391.31,-110.23 382.44,-104.43 380.76,-111.23"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="492.25,-93.25 376.5,-93.25 376.5,-74 492.25,-74 492.25,-93.25"/>
-<text text-anchor="middle" x="434.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node10 -->
-<g id="edge12_Node000007_Node000010" class="edge">
-<title>Node7&#45;&gt;Node10</title>
-<g id="a_edge12_Node000007_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.67,-83.62C348.64,-83.62 356.91,-83.62 365.07,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.98,-87.13 374.98,-83.63 364.98,-80.13 364.98,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="466.75,-56.25 402,-56.25 402,-37 466.75,-37 466.75,-56.25"/>
-<text text-anchor="middle" x="434.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node11 -->
-<g id="edge13_Node000007_Node000011" class="edge">
-<title>Node7&#45;&gt;Node11</title>
-<g id="a_edge13_Node000007_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.67,-69.53C357.29,-65.42 375.17,-61.01 390.74,-57.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="391.29,-60.63 400.15,-54.83 389.61,-53.83 391.29,-60.63"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="477.62,-19.25 391.12,-19.25 391.12,0 477.62,0 477.62,-19.25"/>
-<text text-anchor="middle" x="434.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node12 -->
-<g id="edge14_Node000007_Node000012" class="edge">
-<title>Node7&#45;&gt;Node12</title>
-<g id="a_edge14_Node000007_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M306.08,-68.01C324.4,-55.8 351.28,-39.03 376.5,-27.62 379.65,-26.2 382.95,-24.84 386.31,-23.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="387.43,-26.87 395.67,-20.2 385.07,-20.28 387.43,-26.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 145fb1556..000000000
--- a/dd/d92/memory__game_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,352 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="500pt" height="328pt"
- viewBox="0.00 0.00 500.25 327.88" 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 323.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-164.25 0,-164.25 0,-145 37,-145 37,-164.25"/>
-<text text-anchor="middle" x="18.5" y="-150.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3" target="_top" xlink:title="Function that asks the user for their input in the table they previously chose.">
-<polygon fill="white" stroke="#666666" points="340.5,-270.88 224.75,-270.88 224.75,-240.38 340.5,-240.38 340.5,-270.88"/>
-<text text-anchor="start" x="232.75" y="-257.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="282.62" y="-246.12" font-family="Helvetica,sans-Serif" font-size="10.00">::ask_data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.88,-164.74C33.16,-179.23 50.44,-205.56 73,-218.62 115.42,-243.2 170.22,-252.21 213.01,-255.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.76,-258.7 222.95,-255.8 213.17,-251.71 212.76,-258.7"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59" target="_top" xlink:title="Utility function to verify if the given input is a number or not. This is very useful to prevent the ...">
-<polygon fill="white" stroke="#666666" points="492.25,-319.88 376.5,-319.88 376.5,-289.38 492.25,-289.38 492.25,-319.88"/>
-<text text-anchor="start" x="384.5" y="-306.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="434.38" y="-295.12" font-family="Helvetica,sans-Serif" font-size="10.00">::is_number</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge19_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge19_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.07,-164.55C27.71,-184.19 43.1,-227.98 73,-249.62 159,-311.88 287.03,-316.16 365.09,-311.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.96,-315.23 374.72,-311.1 364.51,-308.25 364.96,-315.23"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a3ceeea62d8fa6c563e2c66359fd73413" target="_top" xlink:title="Function to assign the results to the table.">
-<polygon fill="white" stroke="#666666" points="188.75,-191.88 73,-191.88 73,-161.38 188.75,-161.38 188.75,-191.88"/>
-<text text-anchor="start" x="81" y="-178.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="130.88" y="-167.12" font-family="Helvetica,sans-Serif" font-size="10.00">::assign_results</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.23,-158.16C44.17,-159.54 52.59,-161.22 61.5,-163"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.57,-166.38 71.06,-164.9 61.94,-159.51 60.57,-166.38"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214" target="_top" xlink:title="Initializes the table with the letters.">
-<polygon fill="white" stroke="#666666" points="340.5,-98.88 224.75,-98.88 224.75,-68.38 340.5,-68.38 340.5,-98.88"/>
-<text text-anchor="start" x="232.75" y="-85.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="282.62" y="-74.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge18_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge18_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.42,-150.94C68.47,-144.45 134.15,-130.15 188.75,-114.62 201.14,-111.1 214.34,-106.94 226.78,-102.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="227.66,-106.24 236.04,-99.75 225.44,-99.6 227.66,-106.24"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.62,-105.25 101.12,-105.25 101.12,-86 160.62,-86 160.62,-105.25"/>
-<text text-anchor="middle" x="130.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node15 -->
-<g id="edge20_Node000001_Node000015" class="edge">
-<title>Node1&#45;&gt;Node15</title>
-<g id="a_edge20_Node000001_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.16,-144.7C43.73,-137.27 58.89,-127.14 73,-119.62 79.33,-116.25 86.24,-113 92.99,-110.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.13,-113.36 101.97,-106.24 91.4,-106.92 94.13,-113.36"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="158,-68.25 103.75,-68.25 103.75,-49 158,-49 158,-68.25"/>
-<text text-anchor="middle" x="130.88" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge21_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge21_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.69,-144.67C31.16,-128.1 48.33,-94.92 73,-76.62 78.79,-72.33 85.63,-69.05 92.52,-66.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.31,-69.95 101.82,-63.64 91.23,-63.27 93.31,-69.95"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M331.42,-271.26C345.13,-275.75 360.24,-280.69 374.53,-285.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="373.23,-288.63 383.83,-288.41 375.41,-281.98 373.23,-288.63"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280" target="_top" xlink:title="Utility function to print the table.">
-<polygon fill="white" stroke="#666666" points="492.25,-221.88 376.5,-221.88 376.5,-191.38 492.25,-191.38 492.25,-221.88"/>
-<text text-anchor="start" x="384.5" y="-208.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="434.38" y="-197.12" font-family="Helvetica,sans-Serif" font-size="10.00">::print_table</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M331.42,-239.99C345.13,-235.5 360.24,-230.56 374.53,-225.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="375.41,-229.27 383.83,-222.84 373.23,-222.62 375.41,-229.27"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b" target="_top" xlink:title="Utility function that resets the data if the user enters an invalid value.">
-<polygon fill="white" stroke="#666666" points="492.25,-270.88 376.5,-270.88 376.5,-240.38 492.25,-240.38 492.25,-270.88"/>
-<text text-anchor="start" x="384.5" y="-257.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="434.38" y="-246.12" font-family="Helvetica,sans-Serif" font-size="10.00">::reset_data</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.67,-249.05C348.64,-248.89 356.91,-248.84 365.07,-248.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.93,-252.4 374.98,-249.03 365.03,-245.4 364.93,-252.4"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node2 -->
-<g id="edge5_Node000005_Node000002" class="edge">
-<title>Node5&#45;&gt;Node2</title>
-<g id="a_edge5_Node000005_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M376.49,-262.2C368.52,-262.36 360.26,-262.41 352.09,-262.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="352.23,-258.85 342.18,-262.22 352.13,-265.85 352.23,-258.85"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node2 -->
-<g id="edge7_Node000006_Node000002" class="edge">
-<title>Node6&#45;&gt;Node2</title>
-<g id="a_edge7_Node000006_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.65,-192.33C178.95,-202.27 203.18,-215.32 224.75,-226.62 229.84,-229.29 235.19,-232.06 240.5,-234.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.72,-237.82 249.22,-239.26 241.91,-231.58 238.72,-237.82"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge16_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge16_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.18,-188.22C200.91,-190.28 213.2,-192.21 224.75,-193.62 271.24,-199.31 323.88,-202.56 364.65,-204.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.44,-207.89 374.58,-204.82 364.74,-200.9 364.44,-207.89"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge8_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge8_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.96,-192.36C106.9,-201.43 113.54,-209.88 130.88,-209.88 140.36,-209.88 146.64,-207.35 149.72,-203.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.18,-204.15 150.64,-193.87 146.21,-203.49 153.18,-204.15"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge9_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge9_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M167.67,-160.91C174.95,-157.03 182.33,-152.55 188.75,-147.62 207.72,-133.06 205.27,-121.5 224.75,-107.62 226.09,-106.67 227.47,-105.75 228.88,-104.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.3,-108.07 237.28,-100.1 226.85,-101.98 230.3,-108.07"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d8/d41/namespacegames_1_1memory__game.html#a370760f2b328ad341bcb77d82fa17b01" target="_top" xlink:title="Checks if the two values given by the user match.">
-<polygon fill="white" stroke="#666666" points="340.5,-184.88 224.75,-184.88 224.75,-154.38 340.5,-154.38 340.5,-184.88"/>
-<text text-anchor="start" x="232.75" y="-171.38" font-family="Helvetica,sans-Serif" font-size="10.00">games::memory_game</text>
-<text text-anchor="middle" x="282.62" y="-160.12" font-family="Helvetica,sans-Serif" font-size="10.00">::match</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node13 -->
-<g id="edge15_Node000006_Node000013" class="edge">
-<title>Node6&#45;&gt;Node13</title>
-<g id="a_edge15_Node000006_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M188.92,-173.96C196.89,-173.59 205.16,-173.2 213.32,-172.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.4,-176.32 223.23,-172.35 213.08,-169.33 213.4,-176.32"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6" target="_top" xlink:title="for sleep()">
-<polygon fill="white" stroke="#666666" points="306.75,-136.25 258.5,-136.25 258.5,-117 306.75,-117 306.75,-136.25"/>
-<text text-anchor="middle" x="282.62" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">SLEEP</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node14 -->
-<g id="edge17_Node000006_Node000014" class="edge">
-<title>Node6&#45;&gt;Node14</title>
-<g id="a_edge17_Node000006_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M178.85,-160.94C201.14,-153.5 227.28,-144.77 247.62,-137.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.45,-141.39 256.82,-134.91 246.23,-134.75 248.45,-141.39"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="480.25,-167.25 388.5,-167.25 388.5,-148 480.25,-148 480.25,-167.25"/>
-<text text-anchor="middle" x="434.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge10_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge10_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M325.13,-99.25C330.44,-101.79 335.7,-104.59 340.5,-107.62 358.6,-119.05 357.89,-129.05 376.5,-139.62 378.7,-140.87 380.99,-142.04 383.34,-143.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="381.93,-146.35 392.51,-146.95 384.61,-139.88 381.93,-146.35"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="476.5,-130.25 392.25,-130.25 392.25,-111 476.5,-111 476.5,-130.25"/>
-<text text-anchor="middle" x="434.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge11_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge11_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.67,-97.72C354.23,-101.07 368.62,-104.62 381.91,-107.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="380.76,-111.23 391.31,-110.23 382.44,-104.43 380.76,-111.23"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="492.25,-93.25 376.5,-93.25 376.5,-74 492.25,-74 492.25,-93.25"/>
-<text text-anchor="middle" x="434.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node10 -->
-<g id="edge12_Node000007_Node000010" class="edge">
-<title>Node7&#45;&gt;Node10</title>
-<g id="a_edge12_Node000007_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.67,-83.62C348.64,-83.62 356.91,-83.62 365.07,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.98,-87.13 374.98,-83.63 364.98,-80.13 364.98,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="466.75,-56.25 402,-56.25 402,-37 466.75,-37 466.75,-56.25"/>
-<text text-anchor="middle" x="434.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::shuffle</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node11 -->
-<g id="edge13_Node000007_Node000011" class="edge">
-<title>Node7&#45;&gt;Node11</title>
-<g id="a_edge13_Node000007_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.67,-69.53C357.29,-65.42 375.17,-61.01 390.74,-57.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="391.29,-60.63 400.15,-54.83 389.61,-53.83 391.29,-60.63"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="477.62,-19.25 391.12,-19.25 391.12,0 477.62,0 477.62,-19.25"/>
-<text text-anchor="middle" x="434.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node12 -->
-<g id="edge14_Node000007_Node000012" class="edge">
-<title>Node7&#45;&gt;Node12</title>
-<g id="a_edge14_Node000007_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M306.08,-68.01C324.4,-55.8 351.28,-39.03 376.5,-27.62 379.65,-26.2 382.95,-24.84 386.31,-23.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="387.43,-26.87 395.67,-20.2 385.07,-20.28 387.43,-26.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d92/memory__game_8cpp_source.html b/dd/d92/memory__game_8cpp_source.html
new file mode 100644
index 000000000..5c11c508c
--- /dev/null
+++ b/dd/d92/memory__game_8cpp_source.html
@@ -0,0 +1,479 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: games/memory_game.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dd/d92/memory__game_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">memory_game.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dd/d92/memory__game_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;cstdlib&gt;</span>    </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;ctime&gt;</span>      </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;random&gt;</span>     </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment">// `Sleep` is only available in Windows in milliseconds.</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment">// However, on Unix/Linux systems it is `sleep`, in seconds.</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#ifdef _WIN32</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;Windows.h&gt;</span>  </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">constexpr</span> <span class="keyword">typename</span> std::enable_if&lt;std::is_integral&lt;T&gt;::value, <span class="keywordtype">void</span>&gt;::type <a class="code hl_function" href="../../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6">SLEEP</a>(</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    T milliseconds) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    Sleep(milliseconds * 1000);</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>}</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;unistd.h&gt;</span>  </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00036" data-start="{" data-end="}">
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6">   36</a></span><span class="keyword">constexpr</span> T <a class="code hl_function" href="../../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6">SLEEP</a>(T seconds) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">return</span> sleep(seconds);</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>}</div>
+</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="foldopen" id="foldopen00045" data-start="{" data-end="}">
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="../../da/d9c/namespacegames.html">   45</a></span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../da/d9c/namespacegames.html">games</a> {</div>
+<div class="foldopen" id="foldopen00051" data-start="{" data-end="}">
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="../../d8/d41/namespacegames_1_1memory__game.html">   51</a></span><span class="keyword">namespace </span>memory_game {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59">   62</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59">is_number</a>(<span class="keyword">const</span> T &amp;input) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordflow">if</span> (std::cin.fail()) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        std::cin.clear();</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        std::cin.ignore(256, <span class="charliteral">&#39;\n&#39;</span>);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>}</div>
+</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00080" data-start="{" data-end="}">
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="../../d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214">   80</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214">init</a>(std::vector&lt;T&gt; *table) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    std::vector&lt;char&gt; letters(7);</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="comment">// Decrease / increase the number of letters depending on the size.</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="keywordflow">if</span> ((*table).size() == 10) {  <span class="comment">// 5x2</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        letters = {<span class="charliteral">&#39;A&#39;</span>, <span class="charliteral">&#39;E&#39;</span>, <span class="charliteral">&#39;Z&#39;</span>, <span class="charliteral">&#39;P&#39;</span>, <span class="charliteral">&#39;D&#39;</span>};</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((*table).size() == 8) {  <span class="comment">// 4x2</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        letters = {<span class="charliteral">&#39;A&#39;</span>, <span class="charliteral">&#39;E&#39;</span>, <span class="charliteral">&#39;Z&#39;</span>, <span class="charliteral">&#39;D&#39;</span>};</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((*table).size() == 14) {  <span class="comment">// 7x2</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        letters = {<span class="charliteral">&#39;A&#39;</span>, <span class="charliteral">&#39;E&#39;</span>, <span class="charliteral">&#39;Z&#39;</span>, <span class="charliteral">&#39;P&#39;</span>, <span class="charliteral">&#39;D&#39;</span>, <span class="charliteral">&#39;B&#39;</span>, <span class="charliteral">&#39;M&#39;</span>};</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    std::vector&lt;char&gt; pairs;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="keywordflow">for</span> (<span class="keywordtype">char</span> letter : letters) {</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        pairs.push_back(letter);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        pairs.push_back(letter);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    std::shuffle(pairs.begin(), pairs.end(),</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>                 std::mt19937(std::random_device()()));</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; (*table).size(); i++) {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        (*table)[i] = pairs[i];</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    }</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All available types are: &quot;</span>;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; letters.size(); i++) {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        <span class="keywordflow">if</span> (i == letters.size() - 1) {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;and &quot;</span> &lt;&lt; letters[i] &lt;&lt; <span class="stringliteral">&quot;.\n\n&quot;</span>;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>            std::cout &lt;&lt; letters[i] &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        }</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    }</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>}</div>
+</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00123" data-start="{" data-end="}">
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"><a class="line" href="../../d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280">  123</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280">print_table</a>(<span class="keyword">const</span> std::vector&lt;T&gt; &amp;table) {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;| &quot;</span>;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    std::vector&lt;T&gt; table_print(table.size());</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; table.size(); i++) {</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        table_print[i] = <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span> </div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        <span class="keywordflow">if</span> (table[i] != 0) {</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>            table_print[i] = table[i];</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        }</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    }</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; table.size(); i++) {</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        <span class="keywordflow">if</span> (i % 5 == 0 &amp;&amp; i != 0) {</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\n| &quot;</span>;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>        }</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span> </div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        std::cout &lt;&lt; table_print[i] &lt;&lt; <span class="stringliteral">&quot; | &quot;</span>;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    }</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>}</div>
+</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span> </div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span><span class="comment">// Prototype function. This is needed as `ask_data` calls `reset_data`, and</span></div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span><span class="comment">// `reset_data` calls `ask_data`.</span></div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b">reset_data</a>(<span class="keyword">const</span> std::vector&lt;T&gt; &amp;, <span class="keywordtype">int</span> *, <span class="keywordtype">int</span> *, <span class="keywordtype">int</span> *);</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span> </div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00161" data-start="{" data-end="}">
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"><a class="line" href="../../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3">  161</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3">ask_data</a>(<span class="keyword">const</span> std::vector&lt;T&gt; &amp;table, <span class="keywordtype">int</span> *answer, <span class="keywordtype">int</span> *old_answer,</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>              <span class="keywordtype">int</span> *memory_count) {</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    (*old_answer) = (*answer);</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280">print_table</a>(table);</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span> </div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n\nType your response here (number index):\n&quot;</span>;</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    std::cin &gt;&gt; (*answer);</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span> </div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59">is_number</a>((*answer))) {</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nYou must enter a valid number.\n\n&quot;</span>;</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>        <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b">reset_data</a>(table, answer, old_answer, memory_count);</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    }</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span> </div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    <span class="comment">// Increase the memory count, which will be later on used for checking if</span></div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    <span class="comment">// the user has already answered two values.</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    (*memory_count)++;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span> </div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    <span class="keywordflow">if</span> (((*answer) &gt; table.size()) || ((*answer) &lt; 1)) {</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nYou can&#39;t check a value that doesn&#39;t exist (or an &quot;</span></div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>                     <span class="stringliteral">&quot;invalid number).\n\n&quot;</span>;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>        <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b">reset_data</a>(table, answer, old_answer, memory_count);</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    }</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span> </div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    <span class="keywordflow">if</span> ((*old_answer) == (*answer)) {</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nYou can&#39;t check the same value twice.\n\n&quot;</span>;</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b">reset_data</a>(table, answer, old_answer, memory_count);</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    }</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span> </div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    <span class="comment">// If two matches are answered already, but the user checkes a non-answered</span></div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    <span class="comment">// and an answered value, the program will mark it as no match, however, we</span></div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    <span class="comment">// must not allow the user to check the same value twice.</span></div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    <span class="keywordflow">if</span> ((table[(*answer) - 1] != 0) &amp;&amp;</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        ((table[(*old_answer)] == 0) || (table[(*old_answer)] != 0))) {</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nYou can&#39;t check the same value twice.\n\n&quot;</span>;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>        <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b">reset_data</a>(table, answer, old_answer, memory_count);</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    }</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>}</div>
+</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span> </div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00211" data-start="{" data-end="}">
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"><a class="line" href="../../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b">  211</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b">reset_data</a>(<span class="keyword">const</span> std::vector&lt;T&gt; &amp;table, <span class="keywordtype">int</span> *answer, <span class="keywordtype">int</span> *old_answer,</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>                <span class="keywordtype">int</span> *memory_count) {</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    (*answer) = (*old_answer);</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    (*memory_count)--;</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span> </div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3">ask_data</a>(table, answer, old_answer, memory_count);</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>}</div>
+</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span> </div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00235" data-start="{" data-end="}">
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"><a class="line" href="../../d8/d41/namespacegames_1_1memory__game.html#a370760f2b328ad341bcb77d82fa17b01">  235</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#a370760f2b328ad341bcb77d82fa17b01">match</a>(<span class="keyword">const</span> std::vector&lt;T&gt; &amp;table, std::vector&lt;T&gt; *table_empty,</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>           <span class="keyword">const</span> <span class="keywordtype">int</span> &amp;answer, <span class="keywordtype">bool</span> *first_time, <span class="keywordtype">int</span> *old_answer,</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>           <span class="keywordtype">int</span> *memory_count) {</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    <span class="keywordflow">if</span> ((*first_time) == <span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    }</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span> </div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    <span class="comment">// Search across the whole table and if the two values match, keep results,</span></div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>    <span class="comment">// otherwise, hide &#39;em up.</span></div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; table.size() + 1; i++) {</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>        <span class="keywordflow">if</span> (i == answer) {</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>            <span class="keywordflow">if</span> (table[i - 1] == table[(*old_answer) - 1]) {</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>                (*first_time) = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>                (*memory_count) = 0;</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span> </div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>                (*old_answer) = 0;</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\nNo match (value was &quot;</span> &lt;&lt; table[i - 1]</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>                          &lt;&lt; <span class="stringliteral">&quot;, index is &quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;).\n\n&quot;</span>;</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span> </div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>                (*table_empty)[(*old_answer) - 1] = 0;</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>                (*table_empty)[answer - 1] = 0;</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span> </div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>                (*first_time) = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>                (*memory_count) = 0;</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span> </div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>                (*old_answer) = 0;</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>            }</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>        }</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>    }</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span> </div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>}</div>
+</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span> </div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00289" data-start="{" data-end="}">
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"><a class="line" href="../../d8/d41/namespacegames_1_1memory__game.html#a3ceeea62d8fa6c563e2c66359fd73413">  289</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#a3ceeea62d8fa6c563e2c66359fd73413">assign_results</a>(std::vector&lt;T&gt; *table_empty, std::vector&lt;T&gt; *table,</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>                    <span class="keywordtype">int</span> *answer, <span class="keywordtype">bool</span> *first_time, <span class="keywordtype">int</span> *old_answer,</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>                    <span class="keywordtype">int</span> *memory_count) {</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>    <span class="comment">// Search through the entire table and if the answer matches the index, show</span></div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>    <span class="comment">// the value. If it doesn&#39;t match, hide both the values. Don&#39;t forget to</span></div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>    <span class="comment">// keep older values already answered.</span></div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; (*table).size() + 1; i++) {</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>        <span class="keywordflow">if</span> (i == (*answer)) {</div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>            <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#a370760f2b328ad341bcb77d82fa17b01">match</a>((*table), table_empty, (*answer), first_time, old_answer,</div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span>                      memory_count) == <span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>                (*table_empty)[i - 1] = (*table)[i - 1];</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>                (*first_time) = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>            }</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>        }</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>    }</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span> </div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>    <span class="keywordflow">if</span> ((*memory_count) == 1) {</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>        (*first_time) = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>        (*memory_count) = 0;</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>    }</div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span> </div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>    <span class="keywordtype">char</span> try_again = <span class="charliteral">&#39;n&#39;</span>;</div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span> </div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>    <span class="comment">// Has the user finished the game? Use a `for` loop, and if the table is</span></div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>    <span class="comment">// full, ask the user if he wants to play again.</span></div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; (*table).size() + 1; i++) {</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span>        <span class="keywordflow">if</span> ((*table_empty)[i] == 0) {</div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (i == (*table).size() - 1) {</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>            <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280">print_table</a>((*table));</div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span> </div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\n\nYou won. Congratulations! Do you want to play &quot;</span></div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>                         <span class="stringliteral">&quot;again? (y/n)\n&quot;</span>;</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>            std::cout</div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>                &lt;&lt; <span class="stringliteral">&quot;Size &quot;</span> &lt;&lt; (*table).size()</div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>                &lt;&lt; <span class="stringliteral">&quot; will be used. This can be changed by re-running the game.&quot;</span>;</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>            std::cin &gt;&gt; try_again;</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>            <span class="keywordflow">if</span> (try_again == <span class="charliteral">&#39;y&#39;</span>) {</div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>                <span class="comment">// This is needed when checking if the user has two matches</span></div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span>                <span class="comment">// already.</span></div>
+<div class="line"><a id="l00329" name="l00329"></a><span class="lineno">  329</span>                <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; (*table_empty).size(); i++) {</div>
+<div class="line"><a id="l00330" name="l00330"></a><span class="lineno">  330</span>                    (*table_empty)[i] = 0;</div>
+<div class="line"><a id="l00331" name="l00331"></a><span class="lineno">  331</span>                }</div>
+<div class="line"><a id="l00332" name="l00332"></a><span class="lineno">  332</span> </div>
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno">  333</span>                <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214">init</a>(table);</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (try_again == <span class="charliteral">&#39;n&#39;</span>) {</div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\nThanks for playing the game!\n&quot;</span>;</div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>                <a class="code hl_function" href="../../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6">SLEEP</a>(3);</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span> </div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>                exit(0);</div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;\nInvalid input (exitting...).\n&quot;</span>;</div>
+<div class="line"><a id="l00341" name="l00341"></a><span class="lineno">  341</span>                <a class="code hl_function" href="../../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6">SLEEP</a>(3);</div>
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno">  342</span> </div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>                exit(0);</div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>            }</div>
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span>        }</div>
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>    }</div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span> </div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>    <span class="comment">// Ask data again.</span></div>
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>    <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3">ask_data</a>((*table_empty), answer, old_answer, memory_count);</div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>    <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#a3ceeea62d8fa6c563e2c66359fd73413">assign_results</a>(table_empty, table, answer, first_time, old_answer,</div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>                   memory_count);</div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span>}</div>
+</div>
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno">  353</span>}  <span class="comment">// namespace memory_game</span></div>
+</div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>}  <span class="comment">// namespace games</span></div>
+</div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span> </div>
+<div class="foldopen" id="foldopen00360" data-start="{" data-end="}">
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"><a class="line" href="../../dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  360</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>    <span class="comment">// Start randomizer. This changes the values every time.</span></div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span> </div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>    <span class="keywordtype">int</span> size = 0;       </div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>    <span class="keywordtype">int</span> selection = 0;  </div>
+<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span> </div>
+<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>    <span class="keywordtype">int</span> response = 0;    </div>
+<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>    <span class="keywordtype">int</span> old_answer = 0;  </div>
+<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span> </div>
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span>    <span class="keywordtype">int</span> memory_count =</div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>        0;  </div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>    <span class="keywordtype">bool</span> first_time = <span class="keyword">true</span>;  </div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span> </div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tMEMORY GAME\n&quot;</span>;</div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span> </div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n1. 4x2 (1)&quot;</span>;</div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n2. 5x2 (2)&quot;</span>;</div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n3. 7x2 (3)\n&quot;</span>;</div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span> </div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nChoose table size: &quot;</span>;</div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>        std::cin &gt;&gt; selection;</div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>    } <span class="keywordflow">while</span> ((selection &lt; 1 || selection &gt; 3) &amp;&amp;</div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>             (!<a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59">games::memory_game::is_number</a>(selection)));</div>
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span> </div>
+<div class="line"><a id="l00387" name="l00387"></a><span class="lineno">  387</span>    <span class="keywordflow">switch</span> (selection) {</div>
+<div class="line"><a id="l00388" name="l00388"></a><span class="lineno">  388</span>        <span class="keywordflow">case</span> 1:</div>
+<div class="line"><a id="l00389" name="l00389"></a><span class="lineno">  389</span>            size = 8;</div>
+<div class="line"><a id="l00390" name="l00390"></a><span class="lineno">  390</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00391" name="l00391"></a><span class="lineno">  391</span>        <span class="keywordflow">case</span> 2:</div>
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno">  392</span>            size = 10;</div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>        <span class="keywordflow">case</span> 3:</div>
+<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>            size = 14;</div>
+<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>        <span class="keywordflow">default</span>:</div>
+<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>            size = 10;</div>
+<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span>    }</div>
+<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span> </div>
+<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>    std::vector&lt;char&gt; table(size);</div>
+<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>    std::vector&lt;char&gt; table_empty(size);</div>
+<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span> </div>
+<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span> </div>
+<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>    <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214">games::memory_game::init</a>(&amp;table);</div>
+<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>    <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3">games::memory_game::ask_data</a>(table_empty, &amp;response, &amp;old_answer,</div>
+<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>                                 &amp;memory_count);</div>
+<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>    <a class="code hl_function" href="../../d8/d41/namespacegames_1_1memory__game.html#a3ceeea62d8fa6c563e2c66359fd73413">games::memory_game::assign_results</a>(&amp;table_empty, &amp;table, &amp;response,</div>
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>                                       &amp;first_time, &amp;old_answer, &amp;memory_count);</div>
+<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span> </div>
+<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>}</div>
+</div>
+<div class="ttc" id="amemory__game_8cpp_html_a5bdc30951221eae9c33413ff9eb574f6"><div class="ttname"><a href="../../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6">SLEEP</a></div><div class="ttdeci">constexpr T SLEEP(T seconds)</div><div class="ttdoc">for sleep()</div><div class="ttdef"><b>Definition</b> <a href="#l00036">memory_game.cpp:36</a></div></div>
+<div class="ttc" id="amemory__game_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00360">memory_game.cpp:360</a></div></div>
+<div class="ttc" id="anamespacegames_1_1memory__game_html_a33167bb9cce6d527b478b4f6ae8c3f59"><div class="ttname"><a href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59">games::memory_game::is_number</a></div><div class="ttdeci">bool is_number(const T &amp;input)</div><div class="ttdoc">Utility function to verify if the given input is a number or not. This is very useful to prevent the ...</div><div class="ttdef"><b>Definition</b> <a href="#l00062">memory_game.cpp:62</a></div></div>
+<div class="ttc" id="anamespacegames_1_1memory__game_html_a370760f2b328ad341bcb77d82fa17b01"><div class="ttname"><a href="../../d8/d41/namespacegames_1_1memory__game.html#a370760f2b328ad341bcb77d82fa17b01">games::memory_game::match</a></div><div class="ttdeci">bool match(const std::vector&lt; T &gt; &amp;table, std::vector&lt; T &gt; *table_empty, const int &amp;answer, bool *first_time, int *old_answer, int *memory_count)</div><div class="ttdoc">Checks if the two values given by the user match.</div><div class="ttdef"><b>Definition</b> <a href="#l00235">memory_game.cpp:235</a></div></div>
+<div class="ttc" id="anamespacegames_1_1memory__game_html_a3ceeea62d8fa6c563e2c66359fd73413"><div class="ttname"><a href="../../d8/d41/namespacegames_1_1memory__game.html#a3ceeea62d8fa6c563e2c66359fd73413">games::memory_game::assign_results</a></div><div class="ttdeci">void assign_results(std::vector&lt; T &gt; *table_empty, std::vector&lt; T &gt; *table, int *answer, bool *first_time, int *old_answer, int *memory_count)</div><div class="ttdoc">Function to assign the results to the table.</div><div class="ttdef"><b>Definition</b> <a href="#l00289">memory_game.cpp:289</a></div></div>
+<div class="ttc" id="anamespacegames_1_1memory__game_html_a5714d97649c0edd57b4fb449799676a3"><div class="ttname"><a href="../../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3">games::memory_game::ask_data</a></div><div class="ttdeci">void ask_data(const std::vector&lt; T &gt; &amp;table, int *answer, int *old_answer, int *memory_count)</div><div class="ttdoc">Function that asks the user for their input in the table they previously chose.</div><div class="ttdef"><b>Definition</b> <a href="#l00161">memory_game.cpp:161</a></div></div>
+<div class="ttc" id="anamespacegames_1_1memory__game_html_ac589ef65abb0a6b9a7116ee0f9fd5280"><div class="ttname"><a href="../../d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280">games::memory_game::print_table</a></div><div class="ttdeci">void print_table(const std::vector&lt; T &gt; &amp;table)</div><div class="ttdoc">Utility function to print the table.</div><div class="ttdef"><b>Definition</b> <a href="#l00123">memory_game.cpp:123</a></div></div>
+<div class="ttc" id="anamespacegames_1_1memory__game_html_ad573c8ae66ab66156d03e5e81bbba214"><div class="ttname"><a href="../../d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214">games::memory_game::init</a></div><div class="ttdeci">void init(std::vector&lt; T &gt; *table)</div><div class="ttdoc">Initializes the table with the letters.</div><div class="ttdef"><b>Definition</b> <a href="#l00080">memory_game.cpp:80</a></div></div>
+<div class="ttc" id="anamespacegames_1_1memory__game_html_adc62ebb75853446656e24932bdc6dd6b"><div class="ttname"><a href="../../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b">games::memory_game::reset_data</a></div><div class="ttdeci">void reset_data(const std::vector&lt; T &gt; &amp;, int *, int *, int *)</div><div class="ttdoc">Utility function that resets the data if the user enters an invalid value.</div><div class="ttdef"><b>Definition</b> <a href="#l00211">memory_game.cpp:211</a></div></div>
+<div class="ttc" id="anamespacegames_html"><div class="ttname"><a href="../../da/d9c/namespacegames.html">games</a></div><div class="ttdoc">(Mini)game implementations.</div><div class="ttdef"><b>Definition</b> <a href="#l00045">memory_game.cpp:45</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_4b6f782e158b0b98da980a0e11a23a15.html">games</a></li><li class="navelem"><a class="el" href="../../dd/d92/memory__game_8cpp.html">memory_game.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dd/d95/classdata__structures_1_1_segment_tree.html b/dd/d95/classdata__structures_1_1_segment_tree.html
index 97e1c865d..8c94d9338 100644
--- a/dd/d95/classdata__structures_1_1_segment_tree.html
+++ b/dd/d95/classdata__structures_1_1_segment_tree.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::SegmentTree&lt; T &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: data_structures::SegmentTree&lt; T &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -144,17 +161,14 @@ Private Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a10ffa5fc03c66170f0bc2592b843baa3" id="r_a10ffa5fc03c66170f0bc2592b843baa3"><td class="memItemLeft" align="right" valign="top"><a id="a10ffa5fc03c66170f0bc2592b843baa3" name="a10ffa5fc03c66170f0bc2592b843baa3"></a>
-const T&#160;</td><td class="memItemRight" valign="bottom"><b>ID</b> = 0</td></tr>
-<tr class="memdesc:a10ffa5fc03c66170f0bc2592b843baa3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Comb(ID, x) = x. <br /></td></tr>
+<tr class="memitem:a10ffa5fc03c66170f0bc2592b843baa3" id="r_a10ffa5fc03c66170f0bc2592b843baa3"><td class="memItemLeft" align="right" valign="top">const T&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a10ffa5fc03c66170f0bc2592b843baa3">ID</a> = 0</td></tr>
+<tr class="memdesc:a10ffa5fc03c66170f0bc2592b843baa3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Comb(ID, x) = x.  <br /></td></tr>
 <tr class="separator:a10ffa5fc03c66170f0bc2592b843baa3"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a735d072a603f3abb7c03818440575258" id="r_a735d072a603f3abb7c03818440575258"><td class="memItemLeft" align="right" valign="top"><a id="a735d072a603f3abb7c03818440575258" name="a735d072a603f3abb7c03818440575258"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>t</b></td></tr>
-<tr class="memdesc:a735d072a603f3abb7c03818440575258"><td class="mdescLeft">&#160;</td><td class="mdescRight">Vector to represent the tree. <br /></td></tr>
+<tr class="memitem:a735d072a603f3abb7c03818440575258" id="r_a735d072a603f3abb7c03818440575258"><td class="memItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a735d072a603f3abb7c03818440575258">t</a></td></tr>
+<tr class="memdesc:a735d072a603f3abb7c03818440575258"><td class="mdescLeft">&#160;</td><td class="mdescRight">Vector to represent the tree.  <br /></td></tr>
 <tr class="separator:a735d072a603f3abb7c03818440575258"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a167fd91b68048e49e97859a8947690f3" id="r_a167fd91b68048e49e97859a8947690f3"><td class="memItemLeft" align="right" valign="top"><a id="a167fd91b68048e49e97859a8947690f3" name="a167fd91b68048e49e97859a8947690f3"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>size</b> = 0</td></tr>
-<tr class="memdesc:a167fd91b68048e49e97859a8947690f3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Number of elements available for querying in the tree. <br /></td></tr>
+<tr class="memitem:a167fd91b68048e49e97859a8947690f3" id="r_a167fd91b68048e49e97859a8947690f3"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a167fd91b68048e49e97859a8947690f3">size</a> = 0</td></tr>
+<tr class="memdesc:a167fd91b68048e49e97859a8947690f3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Number of elements available for querying in the tree.  <br /></td></tr>
 <tr class="separator:a167fd91b68048e49e97859a8947690f3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -166,6 +180,8 @@ class data_structures::SegmentTree&lt; T &gt;</div><p>class representation of th
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html#l00030">30</a> of file <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html">segment_tree.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a330724f79c5d1bdb745c29474ff3eac2" name="a330724f79c5d1bdb745c29474ff3eac2"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a330724f79c5d1bdb745c29474ff3eac2">&#9670;&#160;</a></span>SegmentTree()</h2>
@@ -191,10 +207,12 @@ template&lt;class T &gt; </div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html#l00087">87</a> of file <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html">segment_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   87</span>: <a class="code hl_variable" href="#a735d072a603f3abb7c03818440575258">t</a>(n * 4, <a class="code hl_variable" href="#a10ffa5fc03c66170f0bc2592b843baa3">ID</a>), <a class="code hl_variable" href="#a167fd91b68048e49e97859a8947690f3">size</a>(n) {}</div>
-<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a10ffa5fc03c66170f0bc2592b843baa3"><div class="ttname"><a href="#a10ffa5fc03c66170f0bc2592b843baa3">data_structures::SegmentTree::ID</a></div><div class="ttdeci">const T ID</div><div class="ttdoc">Comb(ID, x) = x.</div><div class="ttdef"><b>Definition</b> segment_tree.cpp:32</div></div>
-<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a167fd91b68048e49e97859a8947690f3"><div class="ttname"><a href="#a167fd91b68048e49e97859a8947690f3">data_structures::SegmentTree::size</a></div><div class="ttdeci">int size</div><div class="ttdoc">Number of elements available for querying in the tree.</div><div class="ttdef"><b>Definition</b> segment_tree.cpp:34</div></div>
-<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a735d072a603f3abb7c03818440575258"><div class="ttname"><a href="#a735d072a603f3abb7c03818440575258">data_structures::SegmentTree::t</a></div><div class="ttdeci">std::vector&lt; T &gt; t</div><div class="ttdoc">Vector to represent the tree.</div><div class="ttdef"><b>Definition</b> segment_tree.cpp:33</div></div>
+<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a10ffa5fc03c66170f0bc2592b843baa3"><div class="ttname"><a href="#a10ffa5fc03c66170f0bc2592b843baa3">data_structures::SegmentTree::ID</a></div><div class="ttdeci">const T ID</div><div class="ttdoc">Comb(ID, x) = x.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dd1/segment__tree_8cpp_source.html#l00032">segment_tree.cpp:32</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a167fd91b68048e49e97859a8947690f3"><div class="ttname"><a href="#a167fd91b68048e49e97859a8947690f3">data_structures::SegmentTree::size</a></div><div class="ttdeci">int size</div><div class="ttdoc">Number of elements available for querying in the tree.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dd1/segment__tree_8cpp_source.html#l00034">segment_tree.cpp:34</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a735d072a603f3abb7c03818440575258"><div class="ttname"><a href="#a735d072a603f3abb7c03818440575258">data_structures::SegmentTree::t</a></div><div class="ttdeci">std::vector&lt; T &gt; t</div><div class="ttdoc">Vector to represent the tree.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dd1/segment__tree_8cpp_source.html#l00033">segment_tree.cpp:33</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -237,6 +255,8 @@ template&lt;class T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Some associative operation applied to these two values. In this case, I used addition </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html">segment_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   42</span>                     {</div>
 <div class="line"><span class="lineno">   43</span>        <span class="keywordflow">return</span> x + y;</div>
 <div class="line"><span class="lineno">   44</span>    }</div>
@@ -281,10 +301,12 @@ template&lt;class T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the middle point between them </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html#l00051">51</a> of file <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html">segment_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   51</span>                          {</div>
 <div class="line"><span class="lineno">   52</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> + (r - <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>) / 2;</div>
 <div class="line"><span class="lineno">   53</span>    }</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:119</div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00119">composite_simpson_rule.cpp:119</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -344,23 +366,18 @@ template&lt;class T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The comb operation applied to all values between tl and tr </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html#l00080">80</a> of file <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html">segment_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   80</span>                                                      {</div>
 <div class="line"><span class="lineno">   81</span>        <span class="keywordflow">if</span>(l == tl &amp;&amp; r == tr) <span class="keywordflow">return</span> <a class="code hl_variable" href="#a735d072a603f3abb7c03818440575258">t</a>[i];</div>
 <div class="line"><span class="lineno">   82</span>        <span class="keywordflow">if</span>(tl &gt; tr) <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   83</span>        <span class="keywordtype">int</span> m = <a class="code hl_function" href="#a6d3beccc936af2377c8eeb17067fd141">mid</a>(l, r);</div>
-<div class="line"><span class="lineno">   84</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a8d22286b7be3dcbb701ac5c7d9c79841">comb</a>(<a class="code hl_function" href="#a8fecc48e8e3f6f5f6e728495a4282e52">range_comb</a>(i * 2, l, m, tl, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(tr, m)), <a class="code hl_function" href="#a8fecc48e8e3f6f5f6e728495a4282e52">range_comb</a>(i * 2 + 1, m + 1, r, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(tl, m + 1), tr));</div>
+<div class="line"><span class="lineno">   84</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a8d22286b7be3dcbb701ac5c7d9c79841">comb</a>(<a class="code hl_function" href="#a8fecc48e8e3f6f5f6e728495a4282e52">range_comb</a>(i * 2, l, m, tl, std::min(tr, m)), <a class="code hl_function" href="#a8fecc48e8e3f6f5f6e728495a4282e52">range_comb</a>(i * 2 + 1, m + 1, r, std::max(tl, m + 1), tr));</div>
 <div class="line"><span class="lineno">   85</span>    }</div>
-<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a6d3beccc936af2377c8eeb17067fd141"><div class="ttname"><a href="#a6d3beccc936af2377c8eeb17067fd141">data_structures::SegmentTree::mid</a></div><div class="ttdeci">int mid(int l, int r)</div><div class="ttdoc">Gives the midpoint between two integers.</div><div class="ttdef"><b>Definition</b> segment_tree.cpp:51</div></div>
-<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a8d22286b7be3dcbb701ac5c7d9c79841"><div class="ttname"><a href="#a8d22286b7be3dcbb701ac5c7d9c79841">data_structures::SegmentTree::comb</a></div><div class="ttdeci">T comb(T x, T y)</div><div class="ttdoc">Any associative function that combines x and y.</div><div class="ttdef"><b>Definition</b> segment_tree.cpp:42</div></div>
-<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a8fecc48e8e3f6f5f6e728495a4282e52"><div class="ttname"><a href="#a8fecc48e8e3f6f5f6e728495a4282e52">data_structures::SegmentTree::range_comb</a></div><div class="ttdeci">T range_comb(int i, int l, int r, int tl, int tr)</div><div class="ttdoc">Helper method for range_comb method below.</div><div class="ttdef"><b>Definition</b> segment_tree.cpp:80</div></div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="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><!-- 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="../../dd/d95/classdata__structures_1_1_segment_tree_a8fecc48e8e3f6f5f6e728495a4282e52_cgraph.svg" width="402" height="216"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a6d3beccc936af2377c8eeb17067fd141"><div class="ttname"><a href="#a6d3beccc936af2377c8eeb17067fd141">data_structures::SegmentTree::mid</a></div><div class="ttdeci">int mid(int l, int r)</div><div class="ttdoc">Gives the midpoint between two integers.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dd1/segment__tree_8cpp_source.html#l00051">segment_tree.cpp:51</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a8d22286b7be3dcbb701ac5c7d9c79841"><div class="ttname"><a href="#a8d22286b7be3dcbb701ac5c7d9c79841">data_structures::SegmentTree::comb</a></div><div class="ttdeci">T comb(T x, T y)</div><div class="ttdoc">Any associative function that combines x and y.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dd1/segment__tree_8cpp_source.html#l00042">segment_tree.cpp:42</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a8fecc48e8e3f6f5f6e728495a4282e52"><div class="ttname"><a href="#a8fecc48e8e3f6f5f6e728495a4282e52">data_structures::SegmentTree::range_comb</a></div><div class="ttdeci">T range_comb(int i, int l, int r, int tl, int tr)</div><div class="ttdoc">Helper method for range_comb method below.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dd1/segment__tree_8cpp_source.html#l00080">segment_tree.cpp:80</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1c5331b509d9b55bedfadf979b30dd5b" name="a1c5331b509d9b55bedfadf979b30dd5b"></a>
@@ -401,15 +418,12 @@ template&lt;class T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The value of the comb operations </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html#l00102">102</a> of file <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html">segment_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  102</span>                               {</div>
 <div class="line"><span class="lineno">  103</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a8fecc48e8e3f6f5f6e728495a4282e52">range_comb</a>(1, 1, <a class="code hl_variable" href="#a167fd91b68048e49e97859a8947690f3">size</a>, l, r);</div>
 <div class="line"><span class="lineno">  104</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.svg" width="622" height="216"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2a04f1832c5ce86def50c3021b2ab6b1" name="a2a04f1832c5ce86def50c3021b2ab6b1"></a>
@@ -467,6 +481,8 @@ template&lt;class T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html">segment_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   62</span>                                                     {</div>
 <div class="line"><span class="lineno">   63</span>        <span class="keywordflow">if</span>(l == r) <a class="code hl_variable" href="#a735d072a603f3abb7c03818440575258">t</a>[i] = val;</div>
 <div class="line"><span class="lineno">   64</span>        <span class="keywordflow">else</span> {</div>
@@ -476,13 +492,8 @@ template&lt;class T &gt; </div>
 <div class="line"><span class="lineno">   68</span>            <a class="code hl_variable" href="#a735d072a603f3abb7c03818440575258">t</a>[i] = <a class="code hl_function" href="#a8d22286b7be3dcbb701ac5c7d9c79841">comb</a>(<a class="code hl_variable" href="#a735d072a603f3abb7c03818440575258">t</a>[i * 2], <a class="code hl_variable" href="#a735d072a603f3abb7c03818440575258">t</a>[i * 2 + 1]);</div>
 <div class="line"><span class="lineno">   69</span>        }</div>
 <div class="line"><span class="lineno">   70</span>    }</div>
-<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a2a04f1832c5ce86def50c3021b2ab6b1"><div class="ttname"><a href="#a2a04f1832c5ce86def50c3021b2ab6b1">data_structures::SegmentTree::update</a></div><div class="ttdeci">void update(int i, int l, int r, int pos, T val)</div><div class="ttdoc">Helper method for update method below.</div><div class="ttdef"><b>Definition</b> segment_tree.cpp:62</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d95/classdata__structures_1_1_segment_tree_a2a04f1832c5ce86def50c3021b2ab6b1_cgraph.svg" width="402" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a2a04f1832c5ce86def50c3021b2ab6b1"><div class="ttname"><a href="#a2a04f1832c5ce86def50c3021b2ab6b1">data_structures::SegmentTree::update</a></div><div class="ttdeci">void update(int i, int l, int r, int pos, T val)</div><div class="ttdoc">Helper method for update method below.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dd1/segment__tree_8cpp_source.html#l00062">segment_tree.cpp:62</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad0e78179ab979ae2bc4304bdc181db17" name="ad0e78179ab979ae2bc4304bdc181db17"></a>
@@ -522,19 +533,101 @@ template&lt;class T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html#l00093">93</a> of file <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html">segment_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   93</span>                                {</div>
 <div class="line"><span class="lineno">   94</span>        <a class="code hl_function" href="#a2a04f1832c5ce86def50c3021b2ab6b1">update</a>(1, 1, <a class="code hl_variable" href="#a167fd91b68048e49e97859a8947690f3">size</a>, pos, val);</div>
 <div class="line"><span class="lineno">   95</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d95/classdata__structures_1_1_segment_tree_ad0e78179ab979ae2bc4304bdc181db17_cgraph.svg" width="622" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a10ffa5fc03c66170f0bc2592b843baa3" name="a10ffa5fc03c66170f0bc2592b843baa3"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a10ffa5fc03c66170f0bc2592b843baa3">&#9670;&#160;</a></span>ID</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;class T &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">const T <a class="el" href="../../dd/d95/classdata__structures_1_1_segment_tree.html">data_structures::SegmentTree</a>&lt; T &gt;::ID = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Comb(ID, x) = x. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html">segment_tree.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a167fd91b68048e49e97859a8947690f3" name="a167fd91b68048e49e97859a8947690f3"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a167fd91b68048e49e97859a8947690f3">&#9670;&#160;</a></span>size</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;class T &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int <a class="el" href="../../dd/d95/classdata__structures_1_1_segment_tree.html">data_structures::SegmentTree</a>&lt; T &gt;::size = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Number of elements available for querying in the tree. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html">segment_tree.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a735d072a603f3abb7c03818440575258" name="a735d072a603f3abb7c03818440575258"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a735d072a603f3abb7c03818440575258">&#9670;&#160;</a></span>t</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;class T &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;T&gt; <a class="el" href="../../dd/d95/classdata__structures_1_1_segment_tree.html">data_structures::SegmentTree</a>&lt; T &gt;::t</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Vector to represent the tree. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html">segment_tree.cpp</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../de/dd1/segment__tree_8cpp.html">segment_tree.cpp</a></li>
+<li>data_structures/<a class="el" href="../../de/dd1/segment__tree_8cpp_source.html">segment_tree.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.map b/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.map
deleted file mode 100644
index 4fbd72e62..000000000
--- a/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.map
+++ /dev/null
@@ -1,14 +0,0 @@
-<map id="data_structures::SegmentTree::range_comb" name="data_structures::SegmentTree::range_comb">
-<area shape="rect" id="Node000001" title="Returns comb across all values between l and r." alt="" coords="5,92,177,133"/>
-<area shape="rect" id="Node000002" href="$dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52" title="Helper method for range_comb method below." alt="" coords="225,92,396,133"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="177,110,209,110,209,115,177,115"/>
-<area shape="poly" id="edge6_Node000002_Node000002" title=" " alt="" coords="269,92,267,82,274,73,288,67,310,65,334,68,348,74,346,79,333,73,310,71,289,73,277,77,272,83,274,91"/>
-<area shape="rect" id="Node000003" href="$dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841" title="Any associative function that combines x and y." alt="" coords="444,5,615,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="360,89,443,55,458,49,460,54,445,60,362,94"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="494,70,566,96"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="396,98,478,87,478,92,396,104"/>
-<area shape="rect" id="Node000005" href="$dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141" title="Gives the midpoint between two integers." alt="" coords="444,120,615,161"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="396,121,429,125,428,130,396,126"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="496,185,564,210"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="355,131,445,170,481,182,480,187,443,175,353,136"/>
-</map>
diff --git a/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.md5 b/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.md5
deleted file mode 100644
index 5277e0749..000000000
--- a/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fc0c575a4d9c064dff1a9d348ab90680
\ No newline at end of file
diff --git a/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.svg b/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.svg
deleted file mode 100644
index 182458421..000000000
--- a/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph.svg
+++ /dev/null
@@ -1,150 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SegmentTree::range_comb Pages: 1 -->
-<svg width="466pt" height="162pt"
- viewBox="0.00 0.00 465.50 161.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 157.88)">
-<title>data_structures::SegmentTree::range_comb</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Returns comb across all values between l and r.">
-<polygon fill="#999999" stroke="#666666" points="128.5,-88.88 0,-88.88 0,-58.38 128.5,-58.38 128.5,-88.88"/>
-<text text-anchor="start" x="8" y="-75.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="64.25" y="-64.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::range_comb</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52" target="_top" xlink:title="Helper method for range_comb method below.">
-<polygon fill="white" stroke="#666666" points="293,-88.88 164.5,-88.88 164.5,-58.38 293,-58.38 293,-88.88"/>
-<text text-anchor="start" x="172.5" y="-75.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="228.75" y="-64.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::range_comb</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.54,-73.62C136.48,-73.62 144.65,-73.62 152.74,-73.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.58,-77.13 162.58,-73.63 152.58,-70.13 152.58,-77.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge6_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge6_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.6,-89.36C193.65,-98.43 203.37,-106.88 228.75,-106.88 242.63,-106.88 251.83,-104.35 256.34,-100.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="259.78,-101.25 257.69,-90.86 252.84,-100.28 259.78,-101.25"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841" target="_top" xlink:title="Any associative function that combines x and y.">
-<polygon fill="white" stroke="#666666" points="457.5,-153.88 329,-153.88 329,-123.38 457.5,-123.38 457.5,-153.88"/>
-<text text-anchor="start" x="337" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="393.25" y="-129.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::comb</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M266.88,-89.26C285.48,-97.02 308.37,-106.45 329,-114.62 332.55,-116.03 336.21,-117.47 339.91,-118.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="338.33,-122.04 348.92,-122.37 340.85,-115.51 338.33,-122.04"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="420.38,-105.25 366.12,-105.25 366.12,-86 420.38,-86 420.38,-105.25"/>
-<text text-anchor="middle" x="393.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.04,-82.19C313.8,-85 336.21,-88.04 354.47,-90.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="353.93,-93.97 364.31,-91.84 354.87,-87.03 353.93,-93.97"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141" target="_top" xlink:title="Gives the midpoint between two integers.">
-<polygon fill="white" stroke="#666666" points="457.5,-67.88 329,-67.88 329,-37.38 457.5,-37.38 457.5,-67.88"/>
-<text text-anchor="start" x="337" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="393.25" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::mid</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.04,-65.45C300.98,-64.42 309.15,-63.36 317.24,-62.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.63,-65.8 327.09,-61.05 316.73,-58.86 317.63,-65.8"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="418.88,-19.25 367.62,-19.25 367.62,0 418.88,0 418.88,-19.25"/>
-<text text-anchor="middle" x="393.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M261.48,-57.93C280.74,-48.73 305.97,-37.26 329,-28.62 337.76,-25.34 347.35,-22.22 356.37,-19.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="357.3,-22.87 365.91,-16.69 355.33,-16.15 357.3,-22.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph_org.svg b/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph_org.svg
deleted file mode 100644
index c350f2909..000000000
--- a/dd/d95/classdata__structures_1_1_segment_tree_a1c5331b509d9b55bedfadf979b30dd5b_cgraph_org.svg
+++ /dev/null
@@ -1,124 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SegmentTree::range_comb Pages: 1 -->
-<svg width="466pt" height="162pt"
- viewBox="0.00 0.00 465.50 161.88" 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 157.88)">
-<title>data_structures::SegmentTree::range_comb</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Returns comb across all values between l and r.">
-<polygon fill="#999999" stroke="#666666" points="128.5,-88.88 0,-88.88 0,-58.38 128.5,-58.38 128.5,-88.88"/>
-<text text-anchor="start" x="8" y="-75.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="64.25" y="-64.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::range_comb</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52" target="_top" xlink:title="Helper method for range_comb method below.">
-<polygon fill="white" stroke="#666666" points="293,-88.88 164.5,-88.88 164.5,-58.38 293,-58.38 293,-88.88"/>
-<text text-anchor="start" x="172.5" y="-75.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="228.75" y="-64.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::range_comb</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.54,-73.62C136.48,-73.62 144.65,-73.62 152.74,-73.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.58,-77.13 162.58,-73.63 152.58,-70.13 152.58,-77.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge6_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge6_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.6,-89.36C193.65,-98.43 203.37,-106.88 228.75,-106.88 242.63,-106.88 251.83,-104.35 256.34,-100.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="259.78,-101.25 257.69,-90.86 252.84,-100.28 259.78,-101.25"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841" target="_top" xlink:title="Any associative function that combines x and y.">
-<polygon fill="white" stroke="#666666" points="457.5,-153.88 329,-153.88 329,-123.38 457.5,-123.38 457.5,-153.88"/>
-<text text-anchor="start" x="337" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="393.25" y="-129.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::comb</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M266.88,-89.26C285.48,-97.02 308.37,-106.45 329,-114.62 332.55,-116.03 336.21,-117.47 339.91,-118.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="338.33,-122.04 348.92,-122.37 340.85,-115.51 338.33,-122.04"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="420.38,-105.25 366.12,-105.25 366.12,-86 420.38,-86 420.38,-105.25"/>
-<text text-anchor="middle" x="393.25" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.04,-82.19C313.8,-85 336.21,-88.04 354.47,-90.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="353.93,-93.97 364.31,-91.84 354.87,-87.03 353.93,-93.97"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141" target="_top" xlink:title="Gives the midpoint between two integers.">
-<polygon fill="white" stroke="#666666" points="457.5,-67.88 329,-67.88 329,-37.38 457.5,-37.38 457.5,-67.88"/>
-<text text-anchor="start" x="337" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="393.25" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::mid</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.04,-65.45C300.98,-64.42 309.15,-63.36 317.24,-62.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.63,-65.8 327.09,-61.05 316.73,-58.86 317.63,-65.8"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="418.88,-19.25 367.62,-19.25 367.62,0 418.88,0 418.88,-19.25"/>
-<text text-anchor="middle" x="393.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M261.48,-57.93C280.74,-48.73 305.97,-37.26 329,-28.62 337.76,-25.34 347.35,-22.22 356.37,-19.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="357.3,-22.87 365.91,-16.69 355.33,-16.15 357.3,-22.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d95/classdata__structures_1_1_segment_tree_a2a04f1832c5ce86def50c3021b2ab6b1_cgraph.map b/dd/d95/classdata__structures_1_1_segment_tree_a2a04f1832c5ce86def50c3021b2ab6b1_cgraph.map
deleted file mode 100644
index b20ad4035..000000000
--- a/dd/d95/classdata__structures_1_1_segment_tree_a2a04f1832c5ce86def50c3021b2ab6b1_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="data_structures::SegmentTree::update" name="data_structures::SegmentTree::update">
-<area shape="rect" id="Node000001" title="Helper method for update method below." alt="" coords="5,39,177,79"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="50,39,47,29,54,20,69,14,91,12,115,14,129,21,127,26,113,20,91,17,70,19,57,24,53,30,55,37"/>
-<area shape="rect" id="Node000002" href="$dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841" title="Any associative function that combines x and y." alt="" coords="225,5,396,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="176,43,209,38,209,44,177,49"/>
-<area shape="rect" id="Node000003" href="$dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141" title="Gives the midpoint between two integers." alt="" coords="225,71,396,111"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="177,69,209,74,209,79,176,74"/>
-</map>
diff --git a/dd/d95/classdata__structures_1_1_segment_tree_a2a04f1832c5ce86def50c3021b2ab6b1_cgraph.md5 b/dd/d95/classdata__structures_1_1_segment_tree_a2a04f1832c5ce86def50c3021b2ab6b1_cgraph.md5
deleted file mode 100644
index 49f63aa6d..000000000
--- a/dd/d95/classdata__structures_1_1_segment_tree_a2a04f1832c5ce86def50c3021b2ab6b1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b790969b03b1f1b91a3acbca809d7005
\ No newline at end of file
diff --git a/dd/d95/classdata__structures_1_1_segment_tree_a2a04f1832c5ce86def50c3021b2ab6b1_cgraph.svg b/dd/d95/classdata__structures_1_1_segment_tree_a2a04f1832c5ce86def50c3021b2ab6b1_cgraph.svg
deleted file mode 100644
index 9ea17117e..000000000
--- a/dd/d95/classdata__structures_1_1_segment_tree_a2a04f1832c5ce86def50c3021b2ab6b1_cgraph.svg
+++ /dev/null
@@ -1,95 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SegmentTree::update Pages: 1 -->
-<svg width="301pt" height="88pt"
- viewBox="0.00 0.00 301.00 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>data_structures::SegmentTree::update</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Helper method for update method below.">
-<polygon fill="#999999" stroke="#666666" points="128.5,-54.5 0,-54.5 0,-24 128.5,-24 128.5,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="64.25" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.1,-54.99C29.15,-64.06 38.87,-72.5 64.25,-72.5 78.13,-72.5 87.33,-69.97 91.84,-66.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.28,-66.87 93.19,-56.48 88.34,-65.91 95.28,-66.87"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841" target="_top" xlink:title="Any associative function that combines x and y.">
-<polygon fill="white" stroke="#666666" points="293,-79.5 164.5,-79.5 164.5,-49 293,-49 293,-79.5"/>
-<text text-anchor="start" x="172.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="228.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::comb</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.54,-48.99C136.48,-50.21 144.65,-51.47 152.74,-52.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.18,-56.17 162.6,-54.23 153.25,-49.25 152.18,-56.17"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141" target="_top" xlink:title="Gives the midpoint between two integers.">
-<polygon fill="white" stroke="#666666" points="293,-30.5 164.5,-30.5 164.5,0 293,0 293,-30.5"/>
-<text text-anchor="start" x="172.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="228.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::mid</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.54,-29.9C136.48,-28.73 144.65,-27.52 152.74,-26.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.22,-29.8 162.6,-24.87 152.19,-22.87 153.22,-29.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d95/classdata__structures_1_1_segment_tree_a2a04f1832c5ce86def50c3021b2ab6b1_cgraph_org.svg b/dd/d95/classdata__structures_1_1_segment_tree_a2a04f1832c5ce86def50c3021b2ab6b1_cgraph_org.svg
deleted file mode 100644
index 5c400cfba..000000000
--- a/dd/d95/classdata__structures_1_1_segment_tree_a2a04f1832c5ce86def50c3021b2ab6b1_cgraph_org.svg
+++ /dev/null
@@ -1,69 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SegmentTree::update Pages: 1 -->
-<svg width="301pt" height="88pt"
- viewBox="0.00 0.00 301.00 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>data_structures::SegmentTree::update</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Helper method for update method below.">
-<polygon fill="#999999" stroke="#666666" points="128.5,-54.5 0,-54.5 0,-24 128.5,-24 128.5,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="64.25" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.1,-54.99C29.15,-64.06 38.87,-72.5 64.25,-72.5 78.13,-72.5 87.33,-69.97 91.84,-66.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.28,-66.87 93.19,-56.48 88.34,-65.91 95.28,-66.87"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841" target="_top" xlink:title="Any associative function that combines x and y.">
-<polygon fill="white" stroke="#666666" points="293,-79.5 164.5,-79.5 164.5,-49 293,-49 293,-79.5"/>
-<text text-anchor="start" x="172.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="228.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::comb</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.54,-48.99C136.48,-50.21 144.65,-51.47 152.74,-52.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.18,-56.17 162.6,-54.23 153.25,-49.25 152.18,-56.17"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141" target="_top" xlink:title="Gives the midpoint between two integers.">
-<polygon fill="white" stroke="#666666" points="293,-30.5 164.5,-30.5 164.5,0 293,0 293,-30.5"/>
-<text text-anchor="start" x="172.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="228.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::mid</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.54,-29.9C136.48,-28.73 144.65,-27.52 152.74,-26.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.22,-29.8 162.6,-24.87 152.19,-22.87 153.22,-29.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d95/classdata__structures_1_1_segment_tree_a8fecc48e8e3f6f5f6e728495a4282e52_cgraph.map b/dd/d95/classdata__structures_1_1_segment_tree_a8fecc48e8e3f6f5f6e728495a4282e52_cgraph.map
deleted file mode 100644
index 249091193..000000000
--- a/dd/d95/classdata__structures_1_1_segment_tree_a8fecc48e8e3f6f5f6e728495a4282e52_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="data_structures::SegmentTree::range_comb" name="data_structures::SegmentTree::range_comb">
-<area shape="rect" id="Node000001" title="Helper method for range_comb method below." alt="" coords="5,92,177,133"/>
-<area shape="poly" id="edge5_Node000001_Node000001" title=" " alt="" coords="50,92,47,82,54,73,69,67,91,65,115,68,129,74,127,79,113,73,91,71,70,73,57,77,53,83,55,91"/>
-<area shape="rect" id="Node000002" href="$dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841" title="Any associative function that combines x and y." alt="" coords="225,5,396,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="141,89,224,55,238,49,240,54,226,60,143,94"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="274,70,346,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="176,98,258,87,259,92,177,104"/>
-<area shape="rect" id="Node000004" href="$dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141" title="Gives the midpoint between two integers." alt="" coords="225,120,396,161"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="177,121,209,125,209,130,176,126"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="276,185,344,210"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="136,131,226,170,262,182,260,187,224,175,134,136"/>
-</map>
diff --git a/dd/d95/classdata__structures_1_1_segment_tree_a8fecc48e8e3f6f5f6e728495a4282e52_cgraph.md5 b/dd/d95/classdata__structures_1_1_segment_tree_a8fecc48e8e3f6f5f6e728495a4282e52_cgraph.md5
deleted file mode 100644
index 822ea7d71..000000000
--- a/dd/d95/classdata__structures_1_1_segment_tree_a8fecc48e8e3f6f5f6e728495a4282e52_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0a7c1ece104ee300922150a66938c5ba
\ No newline at end of file
diff --git a/dd/d95/classdata__structures_1_1_segment_tree_a8fecc48e8e3f6f5f6e728495a4282e52_cgraph.svg b/dd/d95/classdata__structures_1_1_segment_tree_a8fecc48e8e3f6f5f6e728495a4282e52_cgraph.svg
deleted file mode 100644
index dd3f6f55d..000000000
--- a/dd/d95/classdata__structures_1_1_segment_tree_a8fecc48e8e3f6f5f6e728495a4282e52_cgraph.svg
+++ /dev/null
@@ -1,131 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SegmentTree::range_comb Pages: 1 -->
-<svg width="301pt" height="162pt"
- viewBox="0.00 0.00 301.00 161.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 157.88)">
-<title>data_structures::SegmentTree::range_comb</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Helper method for range_comb method below.">
-<polygon fill="#999999" stroke="#666666" points="128.5,-88.88 0,-88.88 0,-58.38 128.5,-58.38 128.5,-88.88"/>
-<text text-anchor="start" x="8" y="-75.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="64.25" y="-64.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::range_comb</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.1,-89.36C29.15,-98.43 38.87,-106.88 64.25,-106.88 78.13,-106.88 87.33,-104.35 91.84,-100.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.28,-101.25 93.19,-90.86 88.34,-100.28 95.28,-101.25"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841" target="_top" xlink:title="Any associative function that combines x and y.">
-<polygon fill="white" stroke="#666666" points="293,-153.88 164.5,-153.88 164.5,-123.38 293,-123.38 293,-153.88"/>
-<text text-anchor="start" x="172.5" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="228.75" y="-129.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::comb</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.38,-89.26C120.98,-97.02 143.87,-106.45 164.5,-114.62 168.05,-116.03 171.71,-117.47 175.41,-118.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.83,-122.04 184.42,-122.37 176.35,-115.51 173.83,-122.04"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.88,-105.25 201.62,-105.25 201.62,-86 255.88,-86 255.88,-105.25"/>
-<text text-anchor="middle" x="228.75" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.54,-82.19C149.3,-85 171.71,-88.04 189.97,-90.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.43,-93.97 199.81,-91.84 190.37,-87.03 189.43,-93.97"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141" target="_top" xlink:title="Gives the midpoint between two integers.">
-<polygon fill="white" stroke="#666666" points="293,-67.88 164.5,-67.88 164.5,-37.38 293,-37.38 293,-67.88"/>
-<text text-anchor="start" x="172.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="228.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::mid</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.54,-65.45C136.48,-64.42 144.65,-63.36 152.74,-62.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.13,-65.8 162.59,-61.05 152.23,-58.86 153.13,-65.8"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.38,-19.25 203.12,-19.25 203.12,0 254.38,0 254.38,-19.25"/>
-<text text-anchor="middle" x="228.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.98,-57.93C116.24,-48.73 141.47,-37.26 164.5,-28.62 173.26,-25.34 182.85,-22.22 191.87,-19.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.8,-22.87 201.41,-16.69 190.83,-16.15 192.8,-22.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d95/classdata__structures_1_1_segment_tree_a8fecc48e8e3f6f5f6e728495a4282e52_cgraph_org.svg b/dd/d95/classdata__structures_1_1_segment_tree_a8fecc48e8e3f6f5f6e728495a4282e52_cgraph_org.svg
deleted file mode 100644
index 41a421a08..000000000
--- a/dd/d95/classdata__structures_1_1_segment_tree_a8fecc48e8e3f6f5f6e728495a4282e52_cgraph_org.svg
+++ /dev/null
@@ -1,105 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SegmentTree::range_comb Pages: 1 -->
-<svg width="301pt" height="162pt"
- viewBox="0.00 0.00 301.00 161.88" 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 157.88)">
-<title>data_structures::SegmentTree::range_comb</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Helper method for range_comb method below.">
-<polygon fill="#999999" stroke="#666666" points="128.5,-88.88 0,-88.88 0,-58.38 128.5,-58.38 128.5,-88.88"/>
-<text text-anchor="start" x="8" y="-75.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="64.25" y="-64.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::range_comb</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.1,-89.36C29.15,-98.43 38.87,-106.88 64.25,-106.88 78.13,-106.88 87.33,-104.35 91.84,-100.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.28,-101.25 93.19,-90.86 88.34,-100.28 95.28,-101.25"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841" target="_top" xlink:title="Any associative function that combines x and y.">
-<polygon fill="white" stroke="#666666" points="293,-153.88 164.5,-153.88 164.5,-123.38 293,-123.38 293,-153.88"/>
-<text text-anchor="start" x="172.5" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="228.75" y="-129.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::comb</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.38,-89.26C120.98,-97.02 143.87,-106.45 164.5,-114.62 168.05,-116.03 171.71,-117.47 175.41,-118.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.83,-122.04 184.42,-122.37 176.35,-115.51 173.83,-122.04"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.88,-105.25 201.62,-105.25 201.62,-86 255.88,-86 255.88,-105.25"/>
-<text text-anchor="middle" x="228.75" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.54,-82.19C149.3,-85 171.71,-88.04 189.97,-90.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.43,-93.97 199.81,-91.84 190.37,-87.03 189.43,-93.97"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141" target="_top" xlink:title="Gives the midpoint between two integers.">
-<polygon fill="white" stroke="#666666" points="293,-67.88 164.5,-67.88 164.5,-37.38 293,-37.38 293,-67.88"/>
-<text text-anchor="start" x="172.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="228.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::mid</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.54,-65.45C136.48,-64.42 144.65,-63.36 152.74,-62.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.13,-65.8 162.59,-61.05 152.23,-58.86 153.13,-65.8"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.38,-19.25 203.12,-19.25 203.12,0 254.38,0 254.38,-19.25"/>
-<text text-anchor="middle" x="228.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.98,-57.93C116.24,-48.73 141.47,-37.26 164.5,-28.62 173.26,-25.34 182.85,-22.22 191.87,-19.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="192.8,-22.87 201.41,-16.69 190.83,-16.15 192.8,-22.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d95/classdata__structures_1_1_segment_tree_ad0e78179ab979ae2bc4304bdc181db17_cgraph.map b/dd/d95/classdata__structures_1_1_segment_tree_ad0e78179ab979ae2bc4304bdc181db17_cgraph.map
deleted file mode 100644
index 747a84fd2..000000000
--- a/dd/d95/classdata__structures_1_1_segment_tree_ad0e78179ab979ae2bc4304bdc181db17_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="data_structures::SegmentTree::update" name="data_structures::SegmentTree::update">
-<area shape="rect" id="Node000001" title="Updates a value at a certain position." alt="" coords="5,39,177,79"/>
-<area shape="rect" id="Node000002" href="$dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1" title="Helper method for update method below." alt="" coords="225,39,396,79"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="177,56,209,56,209,62,177,62"/>
-<area shape="poly" id="edge4_Node000002_Node000002" title=" " alt="" coords="269,39,267,29,274,20,288,14,310,12,334,14,348,21,346,26,333,20,310,17,289,19,277,24,272,30,274,37"/>
-<area shape="rect" id="Node000003" href="$dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841" title="Any associative function that combines x and y." alt="" coords="444,5,615,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="396,43,428,38,429,44,396,49"/>
-<area shape="rect" id="Node000004" href="$dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141" title="Gives the midpoint between two integers." alt="" coords="444,71,615,111"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="396,69,429,74,428,79,396,74"/>
-</map>
diff --git a/dd/d95/classdata__structures_1_1_segment_tree_ad0e78179ab979ae2bc4304bdc181db17_cgraph.md5 b/dd/d95/classdata__structures_1_1_segment_tree_ad0e78179ab979ae2bc4304bdc181db17_cgraph.md5
deleted file mode 100644
index fc345ab19..000000000
--- a/dd/d95/classdata__structures_1_1_segment_tree_ad0e78179ab979ae2bc4304bdc181db17_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2e6b59460c35dd64997bb79d08fb5271
\ No newline at end of file
diff --git a/dd/d95/classdata__structures_1_1_segment_tree_ad0e78179ab979ae2bc4304bdc181db17_cgraph.svg b/dd/d95/classdata__structures_1_1_segment_tree_ad0e78179ab979ae2bc4304bdc181db17_cgraph.svg
deleted file mode 100644
index fcd720c12..000000000
--- a/dd/d95/classdata__structures_1_1_segment_tree_ad0e78179ab979ae2bc4304bdc181db17_cgraph.svg
+++ /dev/null
@@ -1,114 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SegmentTree::update Pages: 1 -->
-<svg width="466pt" height="88pt"
- viewBox="0.00 0.00 465.50 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>data_structures::SegmentTree::update</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Updates a value at a certain position.">
-<polygon fill="#999999" stroke="#666666" points="128.5,-54.5 0,-54.5 0,-24 128.5,-24 128.5,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="64.25" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::update</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1" target="_top" xlink:title="Helper method for update method below.">
-<polygon fill="white" stroke="#666666" points="293,-54.5 164.5,-54.5 164.5,-24 293,-24 293,-54.5"/>
-<text text-anchor="start" x="172.5" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="228.75" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.54,-39.25C136.48,-39.25 144.65,-39.25 152.74,-39.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.58,-42.75 162.58,-39.25 152.58,-35.75 152.58,-42.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge4_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge4_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.6,-54.99C193.65,-64.06 203.37,-72.5 228.75,-72.5 242.63,-72.5 251.83,-69.97 256.34,-66.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="259.78,-66.87 257.69,-56.48 252.84,-65.91 259.78,-66.87"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841" target="_top" xlink:title="Any associative function that combines x and y.">
-<polygon fill="white" stroke="#666666" points="457.5,-79.5 329,-79.5 329,-49 457.5,-49 457.5,-79.5"/>
-<text text-anchor="start" x="337" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="393.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::comb</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.04,-48.99C300.98,-50.21 309.15,-51.47 317.24,-52.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.68,-56.17 327.1,-54.23 317.75,-49.25 316.68,-56.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141" target="_top" xlink:title="Gives the midpoint between two integers.">
-<polygon fill="white" stroke="#666666" points="457.5,-30.5 329,-30.5 329,0 457.5,0 457.5,-30.5"/>
-<text text-anchor="start" x="337" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="393.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::mid</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.04,-29.9C300.98,-28.73 309.15,-27.52 317.24,-26.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.72,-29.8 327.1,-24.87 316.69,-22.87 317.72,-29.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d95/classdata__structures_1_1_segment_tree_ad0e78179ab979ae2bc4304bdc181db17_cgraph_org.svg b/dd/d95/classdata__structures_1_1_segment_tree_ad0e78179ab979ae2bc4304bdc181db17_cgraph_org.svg
deleted file mode 100644
index 32e6de03d..000000000
--- a/dd/d95/classdata__structures_1_1_segment_tree_ad0e78179ab979ae2bc4304bdc181db17_cgraph_org.svg
+++ /dev/null
@@ -1,88 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: data_structures::SegmentTree::update Pages: 1 -->
-<svg width="466pt" height="88pt"
- viewBox="0.00 0.00 465.50 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
-<title>data_structures::SegmentTree::update</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Updates a value at a certain position.">
-<polygon fill="#999999" stroke="#666666" points="128.5,-54.5 0,-54.5 0,-24 128.5,-24 128.5,-54.5"/>
-<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="64.25" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::update</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1" target="_top" xlink:title="Helper method for update method below.">
-<polygon fill="white" stroke="#666666" points="293,-54.5 164.5,-54.5 164.5,-24 293,-24 293,-54.5"/>
-<text text-anchor="start" x="172.5" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="228.75" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.54,-39.25C136.48,-39.25 144.65,-39.25 152.74,-39.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.58,-42.75 162.58,-39.25 152.58,-35.75 152.58,-42.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge4_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge4_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M199.6,-54.99C193.65,-64.06 203.37,-72.5 228.75,-72.5 242.63,-72.5 251.83,-69.97 256.34,-66.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="259.78,-66.87 257.69,-56.48 252.84,-65.91 259.78,-66.87"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841" target="_top" xlink:title="Any associative function that combines x and y.">
-<polygon fill="white" stroke="#666666" points="457.5,-79.5 329,-79.5 329,-49 457.5,-49 457.5,-79.5"/>
-<text text-anchor="start" x="337" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="393.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::comb</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.04,-48.99C300.98,-50.21 309.15,-51.47 317.24,-52.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="316.68,-56.17 327.1,-54.23 317.75,-49.25 316.68,-56.17"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141" target="_top" xlink:title="Gives the midpoint between two integers.">
-<polygon fill="white" stroke="#666666" points="457.5,-30.5 329,-30.5 329,0 457.5,0 457.5,-30.5"/>
-<text text-anchor="start" x="337" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="393.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::mid</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.04,-29.9C300.98,-28.73 309.15,-27.52 317.24,-26.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.72,-29.8 327.1,-24.87 316.69,-22.87 317.72,-29.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html b/dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html
index e666db071..643dbc3fe 100644
--- a/dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html
+++ b/dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: greedy_algorithms::stable_matching Namespace Reference</title>
+<title>TheAlgorithms/C++: greedy_algorithms::stable_matching Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -115,7 +132,7 @@ $(function(){initNavTree('dd/d9a/namespacegreedy__algorithms_1_1stable__matching
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a6d7e84df47dcf19e88f95f8f9040306c" id="r_a6d7e84df47dcf19e88f95f8f9040306c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6d7e84df47dcf19e88f95f8f9040306c">gale_shapley</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> &gt; &gt; &amp;secondary_preferences, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> &gt; &gt; &amp;primary_preferences)</td></tr>
+<tr class="memitem:a6d7e84df47dcf19e88f95f8f9040306c" id="r_a6d7e84df47dcf19e88f95f8f9040306c"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::uint32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6d7e84df47dcf19e88f95f8f9040306c">gale_shapley</a> (const std::vector&lt; std::vector&lt; std::uint32_t &gt; &gt; &amp;secondary_preferences, const std::vector&lt; std::vector&lt; std::uint32_t &gt; &gt; &amp;primary_preferences)</td></tr>
 <tr class="memdesc:a6d7e84df47dcf19e88f95f8f9040306c"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function that finds the stable matching between two sets of elements using the Gale-Shapley Algorithm.  <br /></td></tr>
 <tr class="separator:a6d7e84df47dcf19e88f95f8f9040306c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
@@ -129,14 +146,14 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> &gt; greedy_algorithms::stable_matching::gale_shapley </td>
+          <td class="memname">std::vector&lt; std::uint32_t &gt; greedy_algorithms::stable_matching::gale_shapley </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>secondary_preferences</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; std::uint32_t &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>secondary_preferences</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>primary_preferences</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; std::uint32_t &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>primary_preferences</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -151,11 +168,13 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>matches the stable matching between the two sets </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../db/d80/gale__shapley_8cpp_source.html#l00046">46</a> of file <a class="el" href="../../db/d80/gale__shapley_8cpp_source.html">gale_shapley.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   48</span>                                                                  {</div>
-<div class="line"><span class="lineno">   49</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> num_elements = secondary_preferences.<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">   50</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint32_t&gt;</a> matches(num_elements, -1);</div>
-<div class="line"><span class="lineno">   51</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a> is_free_primary(num_elements, <span class="keyword">true</span>);</div>
-<div class="line"><span class="lineno">   52</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::uint32_t&gt;</a> proposal_index(</div>
+<div class="line"><span class="lineno">   49</span>    std::uint32_t num_elements = secondary_preferences.size();</div>
+<div class="line"><span class="lineno">   50</span>    std::vector&lt;std::uint32_t&gt; matches(num_elements, -1);</div>
+<div class="line"><span class="lineno">   51</span>    std::vector&lt;bool&gt; is_free_primary(num_elements, <span class="keyword">true</span>);</div>
+<div class="line"><span class="lineno">   52</span>    std::vector&lt;std::uint32_t&gt; proposal_index(</div>
 <div class="line"><span class="lineno">   53</span>        num_elements,</div>
 <div class="line"><span class="lineno">   54</span>        0);  <span class="comment">// Tracks the next secondary to propose for each primary</span></div>
 <div class="line"><span class="lineno">   55</span> </div>
@@ -163,7 +182,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   57</span>        <span class="keywordtype">int</span> free_primary_index = -1;</div>
 <div class="line"><span class="lineno">   58</span> </div>
 <div class="line"><span class="lineno">   59</span>        <span class="comment">// Find the next free primary</span></div>
-<div class="line"><span class="lineno">   60</span>        <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> i = 0; i &lt; num_elements; i++) {</div>
+<div class="line"><span class="lineno">   60</span>        <span class="keywordflow">for</span> (std::uint32_t i = 0; i &lt; num_elements; i++) {</div>
 <div class="line"><span class="lineno">   61</span>            <span class="keywordflow">if</span> (is_free_primary[i]) {</div>
 <div class="line"><span class="lineno">   62</span>                free_primary_index = i;</div>
 <div class="line"><span class="lineno">   63</span>                <span class="keywordflow">break</span>;</div>
@@ -175,13 +194,13 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   69</span>            <span class="keywordflow">break</span>;</div>
 <div class="line"><span class="lineno">   70</span> </div>
 <div class="line"><span class="lineno">   71</span>        <span class="comment">// Get the next secondary to propose</span></div>
-<div class="line"><span class="lineno">   72</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> secondary_to_propose =</div>
+<div class="line"><span class="lineno">   72</span>        std::uint32_t secondary_to_propose =</div>
 <div class="line"><span class="lineno">   73</span>            primary_preferences[free_primary_index]</div>
 <div class="line"><span class="lineno">   74</span>                               [proposal_index[free_primary_index]];</div>
 <div class="line"><span class="lineno">   75</span>        proposal_index[free_primary_index]++;</div>
 <div class="line"><span class="lineno">   76</span> </div>
 <div class="line"><span class="lineno">   77</span>        <span class="comment">// Get the current match of the secondary</span></div>
-<div class="line"><span class="lineno">   78</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a> current_match = matches[secondary_to_propose];</div>
+<div class="line"><span class="lineno">   78</span>        std::uint32_t current_match = matches[secondary_to_propose];</div>
 <div class="line"><span class="lineno">   79</span> </div>
 <div class="line"><span class="lineno">   80</span>        <span class="comment">// If the secondary is free, match them</span></div>
 <div class="line"><span class="lineno">   81</span>        <span class="keywordflow">if</span> (current_match == -1) {</div>
@@ -190,12 +209,12 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   84</span>        } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">   85</span>            <span class="comment">// Determine if the current match should be replaced</span></div>
 <div class="line"><span class="lineno">   86</span>            <span class="keyword">auto</span> new_proposer_rank =</div>
-<div class="line"><span class="lineno">   87</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/find.html">std::find</a>(secondary_preferences[secondary_to_propose].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">begin</a>(),</div>
-<div class="line"><span class="lineno">   88</span>                          secondary_preferences[secondary_to_propose].<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">   87</span>                std::find(secondary_preferences[secondary_to_propose].begin(),</div>
+<div class="line"><span class="lineno">   88</span>                          secondary_preferences[secondary_to_propose].end(),</div>
 <div class="line"><span class="lineno">   89</span>                          free_primary_index);</div>
 <div class="line"><span class="lineno">   90</span>            <span class="keyword">auto</span> current_match_rank =</div>
-<div class="line"><span class="lineno">   91</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/find.html">std::find</a>(secondary_preferences[secondary_to_propose].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">begin</a>(),</div>
-<div class="line"><span class="lineno">   92</span>                          secondary_preferences[secondary_to_propose].<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">   91</span>                std::find(secondary_preferences[secondary_to_propose].begin(),</div>
+<div class="line"><span class="lineno">   92</span>                          secondary_preferences[secondary_to_propose].end(),</div>
 <div class="line"><span class="lineno">   93</span>                          current_match);</div>
 <div class="line"><span class="lineno">   94</span> </div>
 <div class="line"><span class="lineno">   95</span>            <span class="comment">// If the new proposer is preferred over the current match</span></div>
@@ -210,18 +229,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  104</span> </div>
 <div class="line"><span class="lineno">  105</span>    <span class="keywordflow">return</span> matches;</div>
 <div class="line"><span class="lineno">  106</span>}</div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="afind_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/find.html">std::find</a></div><div class="ttdeci">T find(T... args)</div></div>
-<div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a></div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph.svg" width="276" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph.map b/dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph.map
deleted file mode 100644
index f55e87aff..000000000
--- a/dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="greedy_algorithms::stable_matching::gale_shapley" name="greedy_algorithms::stable_matching::gale_shapley">
-<area shape="rect" id="Node000001" title="The main function that finds the stable matching between two sets of elements using the Gale&#45;Shapley ..." alt="" coords="5,5,154,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/find.html#" title=" " alt="" coords="202,20,270,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="154,30,186,30,186,36,154,36"/>
-</map>
diff --git a/dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph.md5 b/dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph.md5
deleted file mode 100644
index 3265fd704..000000000
--- a/dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d3562925c9ac7b7d6fd2b415f97bed7a
\ No newline at end of file
diff --git a/dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph.svg b/dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph.svg
deleted file mode 100644
index 213c4bd1b..000000000
--- a/dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: greedy_algorithms::stable_matching::gale_shapley Pages: 1 -->
-<svg width="207pt" height="50pt"
- viewBox="0.00 0.00 206.50 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>greedy_algorithms::stable_matching::gale_shapley</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function that finds the stable matching between two sets of elements using the Gale&#45;Shapley ...">
-<polygon fill="#999999" stroke="#666666" points="111.25,-41.75 0,-41.75 0,0 111.25,0 111.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">stable_matching::gale</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_shapley</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="198.5,-30.5 147.25,-30.5 147.25,-11.25 198.5,-11.25 198.5,-30.5"/>
-<text text-anchor="middle" x="172.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.55,-20.88C119.69,-20.88 127.91,-20.88 135.54,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.45,-24.38 145.45,-20.88 135.45,-17.38 135.45,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph_org.svg b/dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph_org.svg
deleted file mode 100644
index 1142a0e81..000000000
--- a/dd/d9a/namespacegreedy__algorithms_1_1stable__matching_a6d7e84df47dcf19e88f95f8f9040306c_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: greedy_algorithms::stable_matching::gale_shapley Pages: 1 -->
-<svg width="207pt" height="50pt"
- viewBox="0.00 0.00 206.50 49.75" 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.75)">
-<title>greedy_algorithms::stable_matching::gale_shapley</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function that finds the stable matching between two sets of elements using the Gale&#45;Shapley ...">
-<polygon fill="#999999" stroke="#666666" points="111.25,-41.75 0,-41.75 0,0 111.25,0 111.25,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">stable_matching::gale</text>
-<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_shapley</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="198.5,-30.5 147.25,-30.5 147.25,-11.25 198.5,-11.25 198.5,-30.5"/>
-<text text-anchor="middle" x="172.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.55,-20.88C119.69,-20.88 127.91,-20.88 135.54,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.45,-24.38 145.45,-20.88 135.45,-17.38 135.45,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html
index 0455a6599..84d765f9e 100644
--- a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html
+++ b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: machine_learning::aystar_search::EightPuzzle&lt; N &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: machine_learning::aystar_search::EightPuzzle&lt; N &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,7 +136,7 @@ $(function(){initNavTree('dd/d9c/classmachine__learning_1_1aystar__search_1_1_ei
 <div class="dynheader">
 Collaboration diagram for machine_learning::aystar_search::EightPuzzle&lt; N &gt;:</div>
 <div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.svg" width="100%" height="388"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/dff/classmachine__learning_1_1aystar__search_1_1_eight_puzzle__coll__graph.svg" width="646" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
@@ -127,7 +144,7 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:aa5c0486c7f29f323a2aced2ab33af420" id="r_aa5c0486c7f29f323a2aced2ab33af420"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa5c0486c7f29f323a2aced2ab33af420">get</a> (size_t i, size_t j) const</td></tr>
 <tr class="memdesc:aa5c0486c7f29f323a2aced2ab33af420"><td class="mdescLeft">&#160;</td><td class="mdescRight">get the value from i units from right and j units from left side of the board  <br /></td></tr>
 <tr class="separator:aa5c0486c7f29f323a2aced2ab33af420"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ade14b0e1a88543b91426e2008e4d0f99" id="r_ade14b0e1a88543b91426e2008e4d0f99"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint32_t, N &gt;, N &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ade14b0e1a88543b91426e2008e4d0f99">get_state</a> ()</td></tr>
+<tr class="memitem:ade14b0e1a88543b91426e2008e4d0f99" id="r_ade14b0e1a88543b91426e2008e4d0f99"><td class="memItemLeft" align="right" valign="top">std::array&lt; std::array&lt; uint32_t, N &gt;, N &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ade14b0e1a88543b91426e2008e4d0f99">get_state</a> ()</td></tr>
 <tr class="memdesc:ade14b0e1a88543b91426e2008e4d0f99"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the current state of the board.  <br /></td></tr>
 <tr class="separator:ade14b0e1a88543b91426e2008e4d0f99"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae145ac4a0d2ec58945b58fad3c04f00f" id="r_ae145ac4a0d2ec58945b58fad3c04f00f"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a> () const</td></tr>
@@ -136,7 +153,7 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:a3dc09f4742a0e1167ed202f7bf94721b" id="r_a3dc09f4742a0e1167ed202f7bf94721b"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3dc09f4742a0e1167ed202f7bf94721b">EightPuzzle</a> ()</td></tr>
 <tr class="memdesc:a3dc09f4742a0e1167ed202f7bf94721b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Default constructor for <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" title="A class defining EightPuzzle/15-Puzzle game.">EightPuzzle</a>.  <br /></td></tr>
 <tr class="separator:a3dc09f4742a0e1167ed202f7bf94721b"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ab7fd890a7ccf756e4b3313087b76a8c2" id="r_ab7fd890a7ccf756e4b3313087b76a8c2"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab7fd890a7ccf756e4b3313087b76a8c2">EightPuzzle</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint32_t, N &gt;, N &gt; &amp;init)</td></tr>
+<tr class="memitem:ab7fd890a7ccf756e4b3313087b76a8c2" id="r_ab7fd890a7ccf756e4b3313087b76a8c2"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab7fd890a7ccf756e4b3313087b76a8c2">EightPuzzle</a> (const std::array&lt; std::array&lt; uint32_t, N &gt;, N &gt; &amp;init)</td></tr>
 <tr class="memdesc:ab7fd890a7ccf756e4b3313087b76a8c2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Parameterized Constructor for <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" title="A class defining EightPuzzle/15-Puzzle game.">EightPuzzle</a>.  <br /></td></tr>
 <tr class="separator:ab7fd890a7ccf756e4b3313087b76a8c2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ad45fde095ac00effe1fe00b1d85ff9c7" id="r_ad45fde095ac00effe1fe00b1d85ff9c7"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad45fde095ac00effe1fe00b1d85ff9c7">EightPuzzle</a> (const <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &amp;A)</td></tr>
@@ -155,7 +172,7 @@ Public Member Functions</h2></td></tr>
 <tr class="memitem:a1802cf6197a255055cb734d626abc101" id="r_a1802cf6197a255055cb734d626abc101"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1802cf6197a255055cb734d626abc101">operator=</a> (<a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a> &amp;&amp;A) noexcept</td></tr>
 <tr class="memdesc:a1802cf6197a255055cb734d626abc101"><td class="mdescLeft">&#160;</td><td class="mdescRight">Move assignment operator.  <br /></td></tr>
 <tr class="separator:a1802cf6197a255055cb734d626abc101"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a26a976171392d257ca0f814ed73e0658" id="r_a26a976171392d257ca0f814ed73e0658"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a26a976171392d257ca0f814ed73e0658">generate_possible_moves</a> ()</td></tr>
+<tr class="memitem:a26a976171392d257ca0f814ed73e0658" id="r_a26a976171392d257ca0f814ed73e0658"><td class="memItemLeft" align="right" valign="top">std::vector&lt; <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a26a976171392d257ca0f814ed73e0658">generate_possible_moves</a> ()</td></tr>
 <tr class="memdesc:a26a976171392d257ca0f814ed73e0658"><td class="mdescLeft">&#160;</td><td class="mdescRight">Find all possible states after processing all possible moves, given the current state of the puzzle.  <br /></td></tr>
 <tr class="separator:a26a976171392d257ca0f814ed73e0658"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa17e0227321b109ed91e156ac1332915" id="r_aa17e0227321b109ed91e156ac1332915"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa17e0227321b109ed91e156ac1332915">operator==</a> (const <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &amp;check) const</td></tr>
@@ -170,7 +187,7 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
 Private Member Functions</h2></td></tr>
-<tr class="memitem:a94f794bf44f424b1b0ca6ef9f4f6ebd3" id="r_a94f794bf44f424b1b0ca6ef9f4f6ebd3"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint32_t, uint32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a94f794bf44f424b1b0ca6ef9f4f6ebd3">find_zero</a> ()</td></tr>
+<tr class="memitem:a94f794bf44f424b1b0ca6ef9f4f6ebd3" id="r_a94f794bf44f424b1b0ca6ef9f4f6ebd3"><td class="memItemLeft" align="right" valign="top">std::pair&lt; uint32_t, uint32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a94f794bf44f424b1b0ca6ef9f4f6ebd3">find_zero</a> ()</td></tr>
 <tr class="memdesc:a94f794bf44f424b1b0ca6ef9f4f6ebd3"><td class="mdescLeft">&#160;</td><td class="mdescRight">A helper array to evaluate the next state from current state;.  <br /></td></tr>
 <tr class="separator:a94f794bf44f424b1b0ca6ef9f4f6ebd3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a48d054230468b79037964f474d842b6e" id="r_a48d054230468b79037964f474d842b6e"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a48d054230468b79037964f474d842b6e">in_range</a> (const uint32_t value) const</td></tr>
@@ -179,16 +196,15 @@ Private Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:a35d8f14ca17218f236c09ff9ad864f9c" id="r_a35d8f14ca17218f236c09ff9ad864f9c"><td class="memItemLeft" align="right" valign="top"><a id="a35d8f14ca17218f236c09ff9ad864f9c" name="a35d8f14ca17218f236c09ff9ad864f9c"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint32_t, N &gt;, N &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>board</b></td></tr>
+<tr class="memitem:a35d8f14ca17218f236c09ff9ad864f9c" id="r_a35d8f14ca17218f236c09ff9ad864f9c"><td class="memItemLeft" align="right" valign="top">std::array&lt; std::array&lt; uint32_t, N &gt;, N &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a35d8f14ca17218f236c09ff9ad864f9c">board</a></td></tr>
 <tr class="separator:a35d8f14ca17218f236c09ff9ad864f9c"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa73857052e69b86347859d9148933f71" id="r_aa73857052e69b86347859d9148933f71"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int8_t, int8_t &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa73857052e69b86347859d9148933f71">moves</a></td></tr>
+<tr class="memitem:aa73857052e69b86347859d9148933f71" id="r_aa73857052e69b86347859d9148933f71"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::pair&lt; int8_t, int8_t &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa73857052e69b86347859d9148933f71">moves</a></td></tr>
 <tr class="memdesc:aa73857052e69b86347859d9148933f71"><td class="mdescLeft">&#160;</td><td class="mdescRight">N x N array to store the current state of the Puzzle.  <br /></td></tr>
 <tr class="separator:aa73857052e69b86347859d9148933f71"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="friends" name="friends"></a>
 Friends</h2></td></tr>
-<tr class="memitem:a9517e162e2988f7db052296bd550a742" id="r_a9517e162e2988f7db052296bd550a742"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9517e162e2988f7db052296bd550a742">operator&lt;&lt;</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;op, const <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &amp;SomeState)</td></tr>
+<tr class="memitem:a9517e162e2988f7db052296bd550a742" id="r_a9517e162e2988f7db052296bd550a742"><td class="memItemLeft" align="right" valign="top">std::ostream &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9517e162e2988f7db052296bd550a742">operator&lt;&lt;</a> (std::ostream &amp;op, const <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &amp;SomeState)</td></tr>
 <tr class="memdesc:a9517e162e2988f7db052296bd550a742"><td class="mdescLeft">&#160;</td><td class="mdescRight">friend operator to display EightPuzzle&lt;&gt;  <br /></td></tr>
 <tr class="separator:a9517e162e2988f7db052296bd550a742"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
@@ -201,6 +217,8 @@ class machine_learning::aystar_search::EightPuzzle&lt; N &gt;</div><p>A class de
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00060">60</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a3dc09f4742a0e1167ed202f7bf94721b" name="a3dc09f4742a0e1167ed202f7bf94721b"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a3dc09f4742a0e1167ed202f7bf94721b">&#9670;&#160;</a></span>EightPuzzle() <span class="overload">[1/4]</span></h2>
@@ -228,6 +246,8 @@ template&lt;size_t N = 3&gt; </div>
 </div><div class="memdoc">
 
 <p>Default constructor for <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" title="A class defining EightPuzzle/15-Puzzle game.">EightPuzzle</a>. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00121">121</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  121</span>                  {</div>
 <div class="line"><span class="lineno">  122</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; ++i) {</div>
 <div class="line"><span class="lineno">  123</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; ++j) {</div>
@@ -235,7 +255,7 @@ template&lt;size_t N = 3&gt; </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="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -253,7 +273,7 @@ template&lt;size_t N = 3&gt; </div>
         <tr>
           <td class="memname"><a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle</a>&lt; N &gt;::EightPuzzle </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint32_t, N &gt;, N &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>init</em></span></td><td>)</td>
+          <td class="paramtype">const std::array&lt; std::array&lt; uint32_t, N &gt;, N &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>init</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -271,6 +291,8 @@ template&lt;size_t N = 3&gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00132">132</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  133</span>        : board(init) {}</div>
 </div><!-- fragment -->
 </div>
@@ -307,6 +329,8 @@ template&lt;size_t N = 3&gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00139">139</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  139</span>: board(A.board) {}</div>
 </div><!-- fragment -->
 </div>
@@ -343,8 +367,9 @@ template&lt;size_t N = 3&gt; </div>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">  146</span>        : board(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(A.board)) {}</div>
-<div class="ttc" id="amove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></div><div class="ttdeci">T move(T... args)</div></div>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00145">145</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  146</span>        : board(std::move(A.board)) {}</div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -361,7 +386,7 @@ template&lt;size_t N = 3&gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; uint32_t, uint32_t &gt; <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle</a>&lt; N &gt;::find_zero </td>
+          <td class="memname">std::pair&lt; uint32_t, uint32_t &gt; <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle</a>&lt; N &gt;::find_zero </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td></td>
@@ -376,6 +401,8 @@ template&lt;size_t N = 3&gt; </div>
 
 <p>A helper array to evaluate the next state from current state;. </p>
 <p>Finds an empty space in puzzle (in this case; a zero) </p><dl class="section return"><dt>Returns</dt><dd>a pair indicating integer distances from top and right respectively, else returns -1, -1 </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00075">75</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   75</span>                                            {</div>
 <div class="line"><span class="lineno">   76</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; ++i) {</div>
 <div class="line"><span class="lineno">   77</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; ++j) {</div>
@@ -401,7 +428,7 @@ template&lt;size_t N = 3&gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &gt; <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle</a>&lt; N &gt;::generate_possible_moves </td>
+          <td class="memname">std::vector&lt; <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a>&lt; N &gt; &gt; <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle</a>&lt; N &gt;::generate_possible_moves </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td></td>
@@ -417,39 +444,32 @@ template&lt;size_t N = 3&gt; </div>
 <p>Find all possible states after processing all possible moves, given the current state of the puzzle. </p>
 <dl class="section return"><dt>Returns</dt><dd>list of vector containing all possible next moves </dd></dl>
 <dl class="section note"><dt>Note</dt><dd>the implementation is compulsory to create A* search </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00176">176</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  176</span>                                                        {</div>
 <div class="line"><span class="lineno">  177</span>        <span class="keyword">auto</span> zero_pos = <a class="code hl_function" href="#a94f794bf44f424b1b0ca6ef9f4f6ebd3">find_zero</a>();</div>
 <div class="line"><span class="lineno">  178</span>        <span class="comment">// vector which will contain all possible state from current state</span></div>
-<div class="line"><span class="lineno">  179</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;EightPuzzle&lt;N&gt;</a>&gt; NewStates;</div>
+<div class="line"><span class="lineno">  179</span>        std::vector&lt;EightPuzzle&lt;N&gt;&gt; NewStates;</div>
 <div class="line"><span class="lineno">  180</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;move : <a class="code hl_variable" href="#aa73857052e69b86347859d9148933f71">moves</a>) {</div>
-<div class="line"><span class="lineno">  181</span>            <span class="keywordflow">if</span> (<a class="code hl_function" href="#a48d054230468b79037964f474d842b6e">in_range</a>(zero_pos.first + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">move</a>.first) &amp;&amp;</div>
-<div class="line"><span class="lineno">  182</span>                <a class="code hl_function" href="#a48d054230468b79037964f474d842b6e">in_range</a>(zero_pos.second + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">move</a>.second)) {</div>
+<div class="line"><span class="lineno">  181</span>            <span class="keywordflow">if</span> (<a class="code hl_function" href="#a48d054230468b79037964f474d842b6e">in_range</a>(zero_pos.first + move.first) &amp;&amp;</div>
+<div class="line"><span class="lineno">  182</span>                <a class="code hl_function" href="#a48d054230468b79037964f474d842b6e">in_range</a>(zero_pos.second + move.second)) {</div>
 <div class="line"><span class="lineno">  183</span>                <span class="comment">// swap with the possible moves</span></div>
-<div class="line"><span class="lineno">  184</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;uint32_t, N&gt;</a>, <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>&gt; new_config = board;</div>
-<div class="line"><span class="lineno">  185</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(new_config[zero_pos.first][zero_pos.second],</div>
-<div class="line"><span class="lineno">  186</span>                          new_config[zero_pos.first + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">move</a>.first]</div>
-<div class="line"><span class="lineno">  187</span>                                    [zero_pos.second + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">move</a>.second]);</div>
+<div class="line"><span class="lineno">  184</span>                std::array&lt;std::array&lt;uint32_t, N&gt;, <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>&gt; new_config = board;</div>
+<div class="line"><span class="lineno">  185</span>                std::swap(new_config[zero_pos.first][zero_pos.second],</div>
+<div class="line"><span class="lineno">  186</span>                          new_config[zero_pos.first + move.first]</div>
+<div class="line"><span class="lineno">  187</span>                                    [zero_pos.second + move.second]);</div>
 <div class="line"><span class="lineno">  188</span>                <a class="code hl_function" href="#a3dc09f4742a0e1167ed202f7bf94721b">EightPuzzle&lt;N&gt;</a> new_state(new_config);</div>
 <div class="line"><span class="lineno">  189</span>                <span class="comment">// Store new state and calculate heuristic value, and depth</span></div>
-<div class="line"><span class="lineno">  190</span>                NewStates.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(new_state);</div>
+<div class="line"><span class="lineno">  190</span>                NewStates.emplace_back(new_state);</div>
 <div class="line"><span class="lineno">  191</span>            }</div>
 <div class="line"><span class="lineno">  192</span>        }</div>
 <div class="line"><span class="lineno">  193</span>        <span class="keywordflow">return</span> NewStates;</div>
 <div class="line"><span class="lineno">  194</span>    }</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a3dc09f4742a0e1167ed202f7bf94721b"><div class="ttname"><a href="#a3dc09f4742a0e1167ed202f7bf94721b">machine_learning::aystar_search::EightPuzzle::EightPuzzle</a></div><div class="ttdeci">EightPuzzle()</div><div class="ttdoc">Default constructor for EightPuzzle.</div><div class="ttdef"><b>Definition</b> a_star_search.cpp:121</div></div>
-<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a48d054230468b79037964f474d842b6e"><div class="ttname"><a href="#a48d054230468b79037964f474d842b6e">machine_learning::aystar_search::EightPuzzle::in_range</a></div><div class="ttdeci">bool in_range(const uint32_t value) const</div><div class="ttdoc">check whether the index value is bounded within the puzzle area</div><div class="ttdef"><b>Definition</b> a_star_search.cpp:90</div></div>
-<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a94f794bf44f424b1b0ca6ef9f4f6ebd3"><div class="ttname"><a href="#a94f794bf44f424b1b0ca6ef9f4f6ebd3">machine_learning::aystar_search::EightPuzzle::find_zero</a></div><div class="ttdeci">std::pair&lt; uint32_t, uint32_t &gt; find_zero()</div><div class="ttdoc">A helper array to evaluate the next state from current state;.</div><div class="ttdef"><b>Definition</b> a_star_search.cpp:75</div></div>
-<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_aa73857052e69b86347859d9148933f71"><div class="ttname"><a href="#aa73857052e69b86347859d9148933f71">machine_learning::aystar_search::EightPuzzle::moves</a></div><div class="ttdeci">std::vector&lt; std::pair&lt; int8_t, int8_t &gt; &gt; moves</div><div class="ttdoc">N x N array to store the current state of the Puzzle.</div><div class="ttdef"><b>Definition</b> a_star_search.cpp:64</div></div>
-<div class="ttc" id="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph.svg" width="468" height="216"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a3dc09f4742a0e1167ed202f7bf94721b"><div class="ttname"><a href="#a3dc09f4742a0e1167ed202f7bf94721b">machine_learning::aystar_search::EightPuzzle::EightPuzzle</a></div><div class="ttdeci">EightPuzzle()</div><div class="ttdoc">Default constructor for EightPuzzle.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/dec/a__star__search_8cpp_source.html#l00121">a_star_search.cpp:121</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a48d054230468b79037964f474d842b6e"><div class="ttname"><a href="#a48d054230468b79037964f474d842b6e">machine_learning::aystar_search::EightPuzzle::in_range</a></div><div class="ttdeci">bool in_range(const uint32_t value) const</div><div class="ttdoc">check whether the index value is bounded within the puzzle area</div><div class="ttdef"><b>Definition</b> <a href="../../dd/dec/a__star__search_8cpp_source.html#l00090">a_star_search.cpp:90</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a94f794bf44f424b1b0ca6ef9f4f6ebd3"><div class="ttname"><a href="#a94f794bf44f424b1b0ca6ef9f4f6ebd3">machine_learning::aystar_search::EightPuzzle::find_zero</a></div><div class="ttdeci">std::pair&lt; uint32_t, uint32_t &gt; find_zero()</div><div class="ttdoc">A helper array to evaluate the next state from current state;.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/dec/a__star__search_8cpp_source.html#l00075">a_star_search.cpp:75</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_aa73857052e69b86347859d9148933f71"><div class="ttname"><a href="#aa73857052e69b86347859d9148933f71">machine_learning::aystar_search::EightPuzzle::moves</a></div><div class="ttdeci">std::vector&lt; std::pair&lt; int8_t, int8_t &gt; &gt; moves</div><div class="ttdoc">N x N array to store the current state of the Puzzle.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/dec/a__star__search_8cpp_source.html#l00064">a_star_search.cpp:64</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa5c0486c7f29f323a2aced2ab33af420" name="aa5c0486c7f29f323a2aced2ab33af420"></a>
@@ -492,18 +512,15 @@ template&lt;size_t N = 3&gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>non-negative integer denoting the value at ith row and jth column </dd>
 <dd>
 -1 if invalid i or j position </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00102">102</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  102</span>                                           {</div>
 <div class="line"><span class="lineno">  103</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="#a48d054230468b79037964f474d842b6e">in_range</a>(i) &amp;&amp; <a class="code hl_function" href="#a48d054230468b79037964f474d842b6e">in_range</a>(j)) {</div>
 <div class="line"><span class="lineno">  104</span>            <span class="keywordflow">return</span> board[i][j];</div>
 <div class="line"><span class="lineno">  105</span>        }</div>
 <div class="line"><span class="lineno">  106</span>        <span class="keywordflow">return</span> -1;</div>
 <div class="line"><span class="lineno">  107</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph.svg" width="432" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae145ac4a0d2ec58945b58fad3c04f00f" name="ae145ac4a0d2ec58945b58fad3c04f00f"></a>
@@ -533,6 +550,8 @@ template&lt;size_t N = 3&gt; </div>
 
 <p>returns the size of the <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" title="A class defining EightPuzzle/15-Puzzle game.">EightPuzzle</a> (number of row / column) </p>
 <dl class="section return"><dt>Returns</dt><dd>N, the size of the puzzle. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00117">117</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  117</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; }</div>
 </div><!-- fragment -->
 </div>
@@ -549,7 +568,7 @@ template&lt;size_t N = 3&gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; uint32_t, N &gt;, N &gt; <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle</a>&lt; N &gt;::get_state </td>
+          <td class="memname">std::array&lt; std::array&lt; uint32_t, N &gt;, N &gt; <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle</a>&lt; N &gt;::get_state </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td></td>
@@ -563,6 +582,8 @@ template&lt;size_t N = 3&gt; </div>
 </div><div class="memdoc">
 
 <p>Returns the current state of the board. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00111">111</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  111</span>{ <span class="keywordflow">return</span> board; }</div>
 </div><!-- fragment -->
 </div>
@@ -600,6 +621,8 @@ template&lt;size_t N = 3&gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if index is within the board, else <code>false</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00090">90</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   90</span>{ <span class="keywordflow">return</span> value &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; }</div>
 </div><!-- fragment -->
 </div>
@@ -631,17 +654,18 @@ template&lt;size_t N = 3&gt; </div>
 
 <p>check whether one board is lexicographically smaller </p>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if this-&gt;state is lexicographically smaller than <code>check.state</code>, else <code>false</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00218">218</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  218</span>                                                      {</div>
 <div class="line"><span class="lineno">  219</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; ++i) {</div>
 <div class="line"><span class="lineno">  220</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; ++j) {</div>
-<div class="line"><span class="lineno">  221</span>                <span class="keywordflow">if</span> (board[i][j] != <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a">check</a>.board[i][j]) {</div>
-<div class="line"><span class="lineno">  222</span>                    <span class="keywordflow">return</span> board[i][j] &lt; <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a">check</a>.board[i][j];</div>
+<div class="line"><span class="lineno">  221</span>                <span class="keywordflow">if</span> (board[i][j] != check.board[i][j]) {</div>
+<div class="line"><span class="lineno">  222</span>                    <span class="keywordflow">return</span> board[i][j] &lt; check.board[i][j];</div>
 <div class="line"><span class="lineno">  223</span>                }</div>
 <div class="line"><span class="lineno">  224</span>            }</div>
 <div class="line"><span class="lineno">  225</span>        }</div>
 <div class="line"><span class="lineno">  226</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  227</span>    }</div>
-<div class="ttc" id="aword__break_8cpp_html_a272b0f5cdb4e41fd6dee4538b808c06a"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a">dynamic_programming::word_break::check</a></div><div class="ttdeci">bool check(const std::string &amp;s, const std::unordered_set&lt; std::string &gt; &amp;strSet, int pos, std::vector&lt; int &gt; *dp)</div><div class="ttdoc">Function that checks if the string passed in param can be segmented from position 'pos',...</div><div class="ttdef"><b>Definition</b> word_break.cpp:80</div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -672,11 +696,13 @@ template&lt;size_t N = 3&gt; </div>
 
 <p>check whether one board is lexicographically smaller or equal </p>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if this-&gt;state is lexicographically smaller than <code>check.state</code> or same, else <code>false</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00233">233</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  233</span>                                                       {</div>
 <div class="line"><span class="lineno">  234</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; ++i) {</div>
 <div class="line"><span class="lineno">  235</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; ++j) {</div>
-<div class="line"><span class="lineno">  236</span>                <span class="keywordflow">if</span> (board[i][j] != <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a">check</a>.board[i][j]) {</div>
-<div class="line"><span class="lineno">  237</span>                    <span class="keywordflow">return</span> board[i][j] &lt; <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a">check</a>.board[i][j];</div>
+<div class="line"><span class="lineno">  236</span>                <span class="keywordflow">if</span> (board[i][j] != check.board[i][j]) {</div>
+<div class="line"><span class="lineno">  237</span>                    <span class="keywordflow">return</span> board[i][j] &lt; check.board[i][j];</div>
 <div class="line"><span class="lineno">  238</span>                }</div>
 <div class="line"><span class="lineno">  239</span>            }</div>
 <div class="line"><span class="lineno">  240</span>        }</div>
@@ -717,6 +743,8 @@ template&lt;size_t N = 3&gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00156">156</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  156</span>                                                 {</div>
 <div class="line"><span class="lineno">  157</span>        board = A.board;</div>
 <div class="line"><span class="lineno">  158</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
@@ -756,16 +784,13 @@ template&lt;size_t N = 3&gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00165">165</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  165</span>                                                     {</div>
-<div class="line"><span class="lineno">  166</span>        board = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(A.board);</div>
+<div class="line"><span class="lineno">  166</span>        board = std::move(A.board);</div>
 <div class="line"><span class="lineno">  167</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
 <div class="line"><span class="lineno">  168</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph.svg" width="347" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa17e0227321b109ed91e156ac1332915" name="aa17e0227321b109ed91e156ac1332915"></a>
@@ -795,13 +820,15 @@ template&lt;size_t N = 3&gt; </div>
 
 <p>check whether two boards are equal </p>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if check.state is equal to <code>this-&gt;state</code>, else <code>false</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00200">200</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  200</span>                                                       {</div>
-<div class="line"><span class="lineno">  201</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a">check</a>.get_size() != N) {</div>
+<div class="line"><span class="lineno">  201</span>        <span class="keywordflow">if</span> (check.get_size() != N) {</div>
 <div class="line"><span class="lineno">  202</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  203</span>        }</div>
 <div class="line"><span class="lineno">  204</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; ++i) {</div>
 <div class="line"><span class="lineno">  205</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; ++j) {</div>
-<div class="line"><span class="lineno">  206</span>                <span class="keywordflow">if</span> (board[i][j] != <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a">check</a>.board[i][j]) {</div>
+<div class="line"><span class="lineno">  206</span>                <span class="keywordflow">if</span> (board[i][j] != check.board[i][j]) {</div>
 <div class="line"><span class="lineno">  207</span>                    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  208</span>                }</div>
 <div class="line"><span class="lineno">  209</span>            }</div>
@@ -824,9 +851,9 @@ template&lt;size_t N = 3&gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp; operator&lt;&lt; </td>
+          <td class="memname">std::ostream &amp; operator&lt;&lt; </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::ostream</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>op</em></span>, </td>
+          <td class="paramtype">std::ostream &amp;</td>          <td class="paramname"><span class="paramname"><em>op</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -850,6 +877,8 @@ template&lt;size_t N = 3&gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>ostream operator op </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00250">250</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  251</span>                                                                     {</div>
 <div class="line"><span class="lineno">  252</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; ++i) {</div>
 <div class="line"><span class="lineno">  253</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; ++j) {</div>
@@ -863,6 +892,32 @@ template&lt;size_t N = 3&gt; </div>
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
+<a id="a35d8f14ca17218f236c09ff9ad864f9c" name="a35d8f14ca17218f236c09ff9ad864f9c"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a35d8f14ca17218f236c09ff9ad864f9c">&#9670;&#160;</a></span>board</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;size_t N = 3&gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::array&lt;std::array&lt;uint32_t, N&gt;, N&gt; <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle</a>&lt; N &gt;::board</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
+
+</div>
+</div>
 <a id="aa73857052e69b86347859d9148933f71" name="aa73857052e69b86347859d9148933f71"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aa73857052e69b86347859d9148933f71">&#9670;&#160;</a></span>moves</h2>
 
@@ -875,7 +930,7 @@ template&lt;size_t N = 3&gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt;int8_t, int8_t&gt; &gt; <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle</a>&lt; N &gt;::moves</td>
+          <td class="memname">std::vector&lt;std::pair&lt;int8_t, int8_t&gt; &gt; <a class="el" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle</a>&lt; N &gt;::moves</td>
         </tr>
       </table>
   </td>
@@ -892,17 +947,19 @@ template&lt;size_t N = 3&gt; </div>
 <div class="line">         0}}</div>
 </div><!-- fragment -->
 <p>N x N array to store the current state of the Puzzle. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   64</span>                                               {</div>
 <div class="line"><span class="lineno">   65</span>        {0, 1},</div>
 <div class="line"><span class="lineno">   66</span>        {1, 0},</div>
 <div class="line"><span class="lineno">   67</span>        {0, -1},</div>
 <div class="line"><span class="lineno">   68</span>        {-1,</div>
-<div class="line"><span class="lineno">   69</span>         0}};  <span class="comment">/// A helper array to evaluate the next state from current state;</span></div>
+<div class="line"><span class="lineno">   69</span>         0}};  </div>
 </div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>machine_learning/<b>a_star_search.cpp</b></li>
+<li>machine_learning/<a class="el" href="../../dd/dec/a__star__search_8cpp_source.html">a_star_search.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph.map b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph.map
deleted file mode 100644
index c2280d92c..000000000
--- a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="machine_learning::aystar_search::EightPuzzle::operator=" name="machine_learning::aystar_search::EightPuzzle::operator=">
-<area shape="rect" id="Node000001" title="Move assignment operator." alt="" coords="5,5,214,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="262,13,341,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="214,23,246,23,246,28,214,28"/>
-</map>
diff --git a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph.md5 b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph.md5
deleted file mode 100644
index 436c5c097..000000000
--- a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-19d5e02444c59f8093111792b2e3780a
\ No newline at end of file
diff --git a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph.svg b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph.svg
deleted file mode 100644
index 28ecb3124..000000000
--- a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::aystar_search::EightPuzzle::operator= Pages: 1 -->
-<svg width="260pt" height="39pt"
- viewBox="0.00 0.00 259.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>machine_learning::aystar_search::EightPuzzle::operator=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Move assignment operator.">
-<polygon fill="#999999" stroke="#666666" points="156.25,-30.5 0,-30.5 0,0 156.25,0 156.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="middle" x="78.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle::operator=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.75,-24.88 192.25,-24.88 192.25,-5.63 251.75,-5.63 251.75,-24.88"/>
-<text text-anchor="middle" x="222" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.7,-15.25C164.94,-15.25 173.06,-15.25 180.6,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.41,-18.75 190.41,-15.25 180.41,-11.75 180.41,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph_org.svg b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph_org.svg
deleted file mode 100644
index 034e2265d..000000000
--- a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a1802cf6197a255055cb734d626abc101_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::aystar_search::EightPuzzle::operator= Pages: 1 -->
-<svg width="260pt" height="39pt"
- viewBox="0.00 0.00 259.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>machine_learning::aystar_search::EightPuzzle::operator=</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Move assignment operator.">
-<polygon fill="#999999" stroke="#666666" points="156.25,-30.5 0,-30.5 0,0 156.25,0 156.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="middle" x="78.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle::operator=</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251.75,-24.88 192.25,-24.88 192.25,-5.63 251.75,-5.63 251.75,-24.88"/>
-<text text-anchor="middle" x="222" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.7,-15.25C164.94,-15.25 173.06,-15.25 180.6,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="180.41,-18.75 190.41,-15.25 180.41,-11.75 180.41,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph.map b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph.map
deleted file mode 100644
index 230d2d08f..000000000
--- a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="machine_learning::aystar_search::EightPuzzle::generate_possible_moves" name="machine_learning::aystar_search::EightPuzzle::generate_possible_moves">
-<area shape="rect" id="Node000001" title="Find all possible states after processing all possible moves, given the current state of the puzzle." alt="" coords="5,81,209,137"/>
-<area shape="rect" id="Node000002" 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="272,5,448,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="166,78,256,41,282,33,283,38,258,46,168,83"/>
-<area shape="rect" id="Node000003" href="$dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3" title="A helper array to evaluate the next state from current state;." alt="" coords="257,55,463,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="209,93,241,88,242,94,209,98"/>
-<area shape="rect" id="Node000004" href="$dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e" title="check whether the index value is bounded within the puzzle area" alt="" coords="259,120,461,161"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="209,119,243,123,243,129,209,124"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="321,185,399,211"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="169,135,258,170,306,184,305,189,256,175,167,140"/>
-</map>
diff --git a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph.md5 b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph.md5
deleted file mode 100644
index 5e69d4e62..000000000
--- a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ca63993a0c35443092e60c640481c0b0
\ No newline at end of file
diff --git a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph.svg b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph.svg
deleted file mode 100644
index 86add80bb..000000000
--- a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph.svg
+++ /dev/null
@@ -1,123 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::aystar_search::EightPuzzle::generate_possible_moves Pages: 1 -->
-<svg width="351pt" height="162pt"
- viewBox="0.00 0.00 351.25 162.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 158.25)">
-<title>machine_learning::aystar_search::EightPuzzle::generate_possible_moves</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Find all possible states after processing all possible moves, given the current state of the puzzle.">
-<polygon fill="#999999" stroke="#666666" points="152.5,-97.5 0,-97.5 0,-55.75 152.5,-55.75 152.5,-97.5"/>
-<text text-anchor="start" x="8" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="start" x="8" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle::generate</text>
-<text text-anchor="middle" x="76.25" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00">_possible_moves</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="331.62,-154.25 200.12,-154.25 200.12,-135 331.62,-135 331.62,-154.25"/>
-<text text-anchor="middle" x="265.88" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.95,-97.95C141.18,-107.28 165.73,-117.84 188.5,-125.62 194.71,-127.75 201.28,-129.74 207.86,-131.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.84,-134.94 217.41,-134.14 208.65,-128.17 206.84,-134.94"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3" target="_top" xlink:title="A helper array to evaluate the next state from current state;.">
-<polygon fill="white" stroke="#666666" points="343.25,-116.88 188.5,-116.88 188.5,-86.38 343.25,-86.38 343.25,-116.88"/>
-<text text-anchor="start" x="196.5" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="middle" x="265.88" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle::find_zero</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.75,-86.69C160.71,-87.75 168.85,-88.83 176.94,-89.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.43,-93.37 186.8,-91.22 177.35,-86.43 176.43,-93.37"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e" target="_top" xlink:title="check whether the index value is bounded within the puzzle area">
-<polygon fill="white" stroke="#666666" points="341.75,-67.88 190,-67.88 190,-37.38 341.75,-37.38 341.75,-67.88"/>
-<text text-anchor="start" x="198" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="middle" x="265.88" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle::in_range</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.75,-66.97C161.18,-65.89 169.81,-64.79 178.36,-63.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.55,-67.2 188.03,-62.46 177.66,-60.25 178.55,-67.2"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="295.25,-19.25 236.5,-19.25 236.5,0 295.25,0 295.25,-19.25"/>
-<text text-anchor="middle" x="265.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.06,-55.3C142.09,-46.29 166.18,-36.16 188.5,-28.62 200.27,-24.65 213.32,-21.1 225.25,-18.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.87,-21.63 234.79,-15.92 224.26,-14.82 225.87,-21.63"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph_org.svg b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph_org.svg
deleted file mode 100644
index 621e7f1b1..000000000
--- a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_a26a976171392d257ca0f814ed73e0658_cgraph_org.svg
+++ /dev/null
@@ -1,97 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::aystar_search::EightPuzzle::generate_possible_moves Pages: 1 -->
-<svg width="351pt" height="162pt"
- viewBox="0.00 0.00 351.25 162.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 158.25)">
-<title>machine_learning::aystar_search::EightPuzzle::generate_possible_moves</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Find all possible states after processing all possible moves, given the current state of the puzzle.">
-<polygon fill="#999999" stroke="#666666" points="152.5,-97.5 0,-97.5 0,-55.75 152.5,-55.75 152.5,-97.5"/>
-<text text-anchor="start" x="8" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="start" x="8" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle::generate</text>
-<text text-anchor="middle" x="76.25" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00">_possible_moves</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="331.62,-154.25 200.12,-154.25 200.12,-135 331.62,-135 331.62,-154.25"/>
-<text text-anchor="middle" x="265.88" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.95,-97.95C141.18,-107.28 165.73,-117.84 188.5,-125.62 194.71,-127.75 201.28,-129.74 207.86,-131.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.84,-134.94 217.41,-134.14 208.65,-128.17 206.84,-134.94"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3" target="_top" xlink:title="A helper array to evaluate the next state from current state;.">
-<polygon fill="white" stroke="#666666" points="343.25,-116.88 188.5,-116.88 188.5,-86.38 343.25,-86.38 343.25,-116.88"/>
-<text text-anchor="start" x="196.5" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="middle" x="265.88" y="-92.12" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle::find_zero</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.75,-86.69C160.71,-87.75 168.85,-88.83 176.94,-89.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.43,-93.37 186.8,-91.22 177.35,-86.43 176.43,-93.37"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e" target="_top" xlink:title="check whether the index value is bounded within the puzzle area">
-<polygon fill="white" stroke="#666666" points="341.75,-67.88 190,-67.88 190,-37.38 341.75,-37.38 341.75,-67.88"/>
-<text text-anchor="start" x="198" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="middle" x="265.88" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle::in_range</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M152.75,-66.97C161.18,-65.89 169.81,-64.79 178.36,-63.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.55,-67.2 188.03,-62.46 177.66,-60.25 178.55,-67.2"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="295.25,-19.25 236.5,-19.25 236.5,0 295.25,0 295.25,-19.25"/>
-<text text-anchor="middle" x="265.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.06,-55.3C142.09,-46.29 166.18,-36.16 188.5,-28.62 200.27,-24.65 213.32,-21.1 225.25,-18.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.87,-21.63 234.79,-15.92 224.26,-14.82 225.87,-21.63"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph.map b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph.map
deleted file mode 100644
index ad04853c2..000000000
--- a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="machine_learning::aystar_search::EightPuzzle::get" name="machine_learning::aystar_search::EightPuzzle::get">
-<area shape="rect" id="Node000001" title="get the value from i units from right and j units from left side of the board" alt="" coords="5,5,177,46"/>
-<area shape="rect" id="Node000002" href="$dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e" title="check whether the index value is bounded within the puzzle area" alt="" coords="225,5,427,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="177,23,209,23,209,28,177,28"/>
-</map>
diff --git a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph.md5 b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph.md5
deleted file mode 100644
index 53e0ed75a..000000000
--- a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-44a16f878fa2e891597c773c40857a4d
\ No newline at end of file
diff --git a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph.svg b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph.svg
deleted file mode 100644
index dbd9b323f..000000000
--- a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::aystar_search::EightPuzzle::get Pages: 1 -->
-<svg width="324pt" height="39pt"
- viewBox="0.00 0.00 324.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>machine_learning::aystar_search::EightPuzzle::get</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="get the value from i units from right and j units from left side of the board">
-<polygon fill="#999999" stroke="#666666" points="128.5,-30.5 0,-30.5 0,0 128.5,0 128.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="middle" x="64.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle::get</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e" target="_top" xlink:title="check whether the index value is bounded within the puzzle area">
-<polygon fill="white" stroke="#666666" points="316.25,-30.5 164.5,-30.5 164.5,0 316.25,0 316.25,-30.5"/>
-<text text-anchor="start" x="172.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="middle" x="240.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle::in_range</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.61,-15.25C136.47,-15.25 144.62,-15.25 152.75,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.71,-18.75 162.71,-15.25 152.71,-11.75 152.71,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph_org.svg b/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph_org.svg
deleted file mode 100644
index bd324b0ac..000000000
--- a/dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle_aa5c0486c7f29f323a2aced2ab33af420_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: machine_learning::aystar_search::EightPuzzle::get Pages: 1 -->
-<svg width="324pt" height="39pt"
- viewBox="0.00 0.00 324.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>machine_learning::aystar_search::EightPuzzle::get</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="get the value from i units from right and j units from left side of the board">
-<polygon fill="#999999" stroke="#666666" points="128.5,-30.5 0,-30.5 0,0 128.5,0 128.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="middle" x="64.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle::get</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e" target="_top" xlink:title="check whether the index value is bounded within the puzzle area">
-<polygon fill="white" stroke="#666666" points="316.25,-30.5 164.5,-30.5 164.5,0 316.25,0 316.25,-30.5"/>
-<text text-anchor="start" x="172.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">machine_learning::aystar</text>
-<text text-anchor="middle" x="240.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_search::EightPuzzle::in_range</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.61,-15.25C136.47,-15.25 144.62,-15.25 152.75,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.71,-18.75 162.71,-15.25 152.71,-11.75 152.71,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.map b/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.map
index 3d9bfef77..e5ddeea62 100644
--- a/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.map
+++ b/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.map
@@ -1,7 +1,5 @@
 <map id="data_structures::list_array::list&lt; N &gt;" name="data_structures::list_array::list&lt; N &gt;">
-<area shape="rect" id="Node000001" title="Structure of List with supporting methods." alt="" coords="5,198,142,238"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array.html" title=" " alt="" coords="12,94,135,135"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="76,150,76,197,71,197,71,150"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="27,5,120,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="76,46,76,93,71,93,71,46"/>
+<area shape="rect" id="Node000001" title="Structure of List with supporting methods." alt="" coords="5,109,142,150"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="12,5,135,46"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="76,62,76,109,71,109,71,62"/>
 </map>
diff --git a/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.md5 b/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.md5
index ced9ffa56..e59c47057 100644
--- a/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.md5
+++ b/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.md5
@@ -1 +1 @@
-ebb1e6500cd21135978d991230a959c8
\ No newline at end of file
+6cda58e210f184ae1654859fc6239183
\ No newline at end of file
diff --git a/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.svg b/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.svg
index 5e043ae37..a5977eddb 100644
--- a/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.svg
+++ b/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.svg
@@ -4,8 +4,8 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: data_structures::list_array::list&lt; N &gt; Pages: 1 -->
-<svg width="110pt" height="183pt"
- viewBox="0.00 0.00 110.25 182.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="110pt" height="116pt"
+ viewBox="0.00 0.00 110.25 116.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
 <svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
@@ -17,7 +17,7 @@
 ]]></style>
 <script type="application/ecmascript" xlink:href="../../svg.min.js"/>
 <svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 178.75)">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 112.25)">
 <title>data_structures::list_array::list&lt; N &gt;</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="97.38,-108.25 4.88,-108.25 4.88,-77.75 97.38,-77.75 97.38,-108.25"/>
 <text text-anchor="start" x="12.88" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; uint64</text>
 <text text-anchor="middle" x="51.12" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">_t, N &gt;</text>
@@ -49,25 +49,6 @@
 </g>
 <text text-anchor="middle" x="62" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
 </g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="86.12,-174.75 16.12,-174.75 16.12,-155.5 86.12,-155.5 86.12,-174.75"/>
-<text text-anchor="middle" x="51.12" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint64_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M51.12,-143.92C51.12,-132.66 51.12,-118.89 51.12,-108.67"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="47.63,-143.73 51.13,-153.73 54.63,-143.73 47.63,-143.73"/>
-</a>
-</g>
-<text text-anchor="middle" x="72.5" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
 </g>
 </svg>
 </svg>
diff --git a/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph_org.svg b/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph_org.svg
index 5d4554fa8..9c501c7a7 100644
--- a/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph_org.svg
+++ b/dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph_org.svg
@@ -4,9 +4,9 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: data_structures::list_array::list&lt; N &gt; Pages: 1 -->
-<svg width="110pt" height="183pt"
- viewBox="0.00 0.00 110.25 182.75" 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 178.75)">
+<svg width="110pt" height="116pt"
+ viewBox="0.00 0.00 110.25 116.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 112.25)">
 <title>data_structures::list_array::list&lt; N &gt;</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="97.38,-108.25 4.88,-108.25 4.88,-77.75 97.38,-77.75 97.38,-108.25"/>
 <text text-anchor="start" x="12.88" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; uint64</text>
 <text text-anchor="middle" x="51.12" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">_t, N &gt;</text>
@@ -38,24 +38,5 @@
 </g>
 <text text-anchor="middle" x="62" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> data</text>
 </g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="86.12,-174.75 16.12,-174.75 16.12,-155.5 86.12,-155.5 86.12,-174.75"/>
-<text text-anchor="middle" x="51.12" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint64_t</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M51.12,-143.92C51.12,-132.66 51.12,-118.89 51.12,-108.67"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="47.63,-143.73 51.13,-153.73 54.63,-143.73 47.63,-143.73"/>
-</a>
-</g>
-<text text-anchor="middle" x="72.5" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
 </g>
 </svg>
diff --git a/dd/da0/todo.html b/dd/da0/todo.html
index 76fafb8a8..d97416b84 100644
--- a/dd/da0/todo.html
+++ b/dd/da0/todo.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Todo List</title>
+<title>TheAlgorithms/C++: Todo List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -114,7 +131,7 @@ $(function(){initNavTree('dd/da0/todo.html','../../'); initResizable(true); });
 <dd><a class="anchor" id="_todo000003"></a>update code to use C++ STL library features and OO structure  </dd>
 <dt>Member <a class="el" href="../../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5">create_list</a>  (int key)</dt>
 <dd><a class="anchor" id="_todo000013"></a>fix memory leak  </dd>
-<dt>Member <a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab">data_structures::trie::deleteString</a>  (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str, int index)</dt>
+<dt>Member <a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab">data_structures::trie::deleteString</a>  (const std::string &amp;str, int index)</dt>
 <dd><a class="anchor" id="_todo000005"></a>review the function ::data_structure::trie::deleteString and the commented lines  </dd>
 <dt>Member <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp.html#a35b7c98af53ad2ec18658679ad7d43de">fib_b</a>  </dt>
 <dd><a class="anchor" id="_todo000008"></a>@stepfencurryxiao add documetnation  </dd>
diff --git a/dd/da8/pigeonhole__sort_8cpp.html b/dd/da8/pigeonhole__sort_8cpp.html
index 1c03c8969..8fa637117 100644
--- a/dd/da8/pigeonhole__sort_8cpp.html
+++ b/dd/da8/pigeonhole__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/pigeonhole_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/pigeonhole_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for pigeonhole_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d28/pigeonhole__sort_8cpp__incl.svg" width="344" height="126"><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">
+</div>
+<p><a href="../../dd/da8/pigeonhole__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -131,8 +150,8 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a0e9e1b21a1684585e9e50f9afe4d53a3" id="r_a0e9e1b21a1684585e9e50f9afe4d53a3"><td class="memTemplParams" colspan="2">template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> N&gt; </td></tr>
-<tr class="memitem:a0e9e1b21a1684585e9e50f9afe4d53a3"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, N &gt; arr)</td></tr>
+<tr class="memitem:a0e9e1b21a1684585e9e50f9afe4d53a3" id="r_a0e9e1b21a1684585e9e50f9afe4d53a3"><td class="memTemplParams" colspan="2">template&lt;std::size_t N&gt; </td></tr>
+<tr class="memitem:a0e9e1b21a1684585e9e50f9afe4d53a3"><td class="memTemplItemLeft" align="right" valign="top">std::array&lt; int, N &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort</a> (std::array&lt; int, N &gt; arr)</td></tr>
 <tr class="separator:a0e9e1b21a1684585e9e50f9afe4d53a3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a34b8683a2b429de5cce57e6d733ec817" id="r_a34b8683a2b429de5cce57e6d733ec817"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a34b8683a2b429de5cce57e6d733ec817">test_1</a> ()</td></tr>
 <tr class="separator:a34b8683a2b429de5cce57e6d733ec817"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Lownish" target="_blank">Lownish</a></dd></dl>
 <p>Pigeonhole sorting is a sorting algorithm that is suitable for sorting lists of elements where the number of elements and the number of possible key values are approximately the same. It requires O(n + Range) time where n is number of elements in input array and ‘Range’ is number of possible values in array.</p>
 <p>The time Complexity of the algorithm is \(O(n+N)\). </p>
+
+<p class="definition">Definition in file <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html">pigeonhole_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -164,6 +185,8 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html#l00127">127</a> of file <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html">pigeonhole_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  127</span>           {</div>
 <div class="line"><span class="lineno">  128</span>    <a class="code hl_function" href="#a34b8683a2b429de5cce57e6d733ec817">test_1</a>();</div>
 <div class="line"><span class="lineno">  129</span>    <a class="code hl_function" href="#a458410412185a5f09199deaff7157a8d">test_2</a>();</div>
@@ -171,15 +194,10 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  131</span> </div>
 <div class="line"><span class="lineno">  132</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  133</span>}</div>
-<div class="ttc" id="apigeonhole__sort_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> pigeonhole_sort.cpp:68</div></div>
-<div class="ttc" id="apigeonhole__sort_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> pigeonhole_sort.cpp:88</div></div>
-<div class="ttc" id="apigeonhole__sort_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> pigeonhole_sort.cpp:109</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="518" height="391"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="apigeonhole__sort_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> <a href="../../dd/da8/pigeonhole__sort_8cpp_source.html#l00068">pigeonhole_sort.cpp:68</a></div></div>
+<div class="ttc" id="apigeonhole__sort_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> <a href="../../dd/da8/pigeonhole__sort_8cpp_source.html#l00088">pigeonhole_sort.cpp:88</a></div></div>
+<div class="ttc" id="apigeonhole__sort_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> <a href="../../dd/da8/pigeonhole__sort_8cpp_source.html#l00109">pigeonhole_sort.cpp:109</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a34b8683a2b429de5cce57e6d733ec817" name="a34b8683a2b429de5cce57e6d733ec817"></a>
@@ -205,33 +223,24 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Test function 1 with unsorted array {8, 3, 2, 7, 4, 6, 8} </p><dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html#l00068">68</a> of file <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html">pigeonhole_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   68</span>                     {</div>
 <div class="line"><span class="lineno">   69</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> n = 7;</div>
-<div class="line"><span class="lineno">   70</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n&gt;</a> test_array = {8, 3, 2, 7, 4, 6, 8};</div>
+<div class="line"><span class="lineno">   70</span>    std::array&lt;int, n&gt; test_array = {8, 3, 2, 7, 4, 6, 8};</div>
 <div class="line"><span class="lineno">   71</span> </div>
 <div class="line"><span class="lineno">   72</span>    test_array = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort&lt;n&gt;</a>(test_array);</div>
 <div class="line"><span class="lineno">   73</span> </div>
-<div class="line"><span class="lineno">   74</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(test_array), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(test_array)));</div>
+<div class="line"><span class="lineno">   74</span>    assert(std::is_sorted(std::begin(test_array), std::end(test_array)));</div>
 <div class="line"><span class="lineno">   75</span> </div>
 <div class="line"><span class="lineno">   76</span>    <span class="comment">// Printing sorted array</span></div>
 <div class="line"><span class="lineno">   77</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
-<div class="line"><span class="lineno">   78</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; test_array.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/at.html">at</a>(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   78</span>        std::cout &lt;&lt; test_array.at(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   79</span>    }</div>
-<div class="line"><span class="lineno">   80</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPassed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   81</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/at.html">std::array::at</a></div><div class="ttdeci">T at(T... args)</div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-<div class="ttc" id="anamespacesorting_html_a0e9e1b21a1684585e9e50f9afe4d53a3"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort</a></div><div class="ttdeci">std::array&lt; int, N &gt; pigeonSort(std::array&lt; int, N &gt; arr)</div><div class="ttdef"><b>Definition</b> pigeonhole_sort.cpp:34</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg" width="420" height="238"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacesorting_html_a0e9e1b21a1684585e9e50f9afe4d53a3"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort</a></div><div class="ttdeci">std::array&lt; int, N &gt; pigeonSort(std::array&lt; int, N &gt; arr)</div><div class="ttdef"><b>Definition</b> <a href="../../dd/da8/pigeonhole__sort_8cpp_source.html#l00034">pigeonhole_sort.cpp:34</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a458410412185a5f09199deaff7157a8d" name="a458410412185a5f09199deaff7157a8d"></a>
@@ -257,27 +266,24 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Test function 2 with unsorted array {802, 630, 20, 745, 52, 300, 612, 932, 78, 187} </p><dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html#l00088">88</a> of file <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html">pigeonhole_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   88</span>                     {</div>
 <div class="line"><span class="lineno">   89</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> n = 10;</div>
-<div class="line"><span class="lineno">   90</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n&gt;</a> test_array = {802, 630, 20,  745, 52,</div>
+<div class="line"><span class="lineno">   90</span>    std::array&lt;int, n&gt; test_array = {802, 630, 20,  745, 52,</div>
 <div class="line"><span class="lineno">   91</span>                                     300, 612, 932, 78,  187};</div>
 <div class="line"><span class="lineno">   92</span> </div>
 <div class="line"><span class="lineno">   93</span>    test_array = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort&lt;n&gt;</a>(test_array);</div>
 <div class="line"><span class="lineno">   94</span> </div>
-<div class="line"><span class="lineno">   95</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(test_array), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(test_array)));</div>
+<div class="line"><span class="lineno">   95</span>    assert(std::is_sorted(std::begin(test_array), std::end(test_array)));</div>
 <div class="line"><span class="lineno">   96</span> </div>
 <div class="line"><span class="lineno">   97</span>    <span class="comment">// Printing sorted array</span></div>
 <div class="line"><span class="lineno">   98</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</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> &lt;&lt; test_array.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/at.html">at</a>(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   99</span>        std::cout &lt;&lt; test_array.at(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">  100</span>    }</div>
-<div class="line"><span class="lineno">  101</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPassed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  102</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg" width="420" height="238"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af31ec5409537703d9c8a47350386b32a" name="af31ec5409537703d9c8a47350386b32a"></a>
@@ -303,26 +309,23 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Test function 1 with unsorted array {11,13,12,14} </p><dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html#l00109">109</a> of file <a class="el" href="../../dd/da8/pigeonhole__sort_8cpp_source.html">pigeonhole_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  109</span>                     {</div>
 <div class="line"><span class="lineno">  110</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> n = 4;</div>
-<div class="line"><span class="lineno">  111</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n&gt;</a> test_array = {11, 13, 12, 14};</div>
+<div class="line"><span class="lineno">  111</span>    std::array&lt;int, n&gt; test_array = {11, 13, 12, 14};</div>
 <div class="line"><span class="lineno">  112</span> </div>
 <div class="line"><span class="lineno">  113</span>    test_array = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort&lt;n&gt;</a>(test_array);</div>
 <div class="line"><span class="lineno">  114</span> </div>
-<div class="line"><span class="lineno">  115</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(test_array), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(test_array)));</div>
+<div class="line"><span class="lineno">  115</span>    assert(std::is_sorted(std::begin(test_array), std::end(test_array)));</div>
 <div class="line"><span class="lineno">  116</span> </div>
 <div class="line"><span class="lineno">  117</span>    <span class="comment">// Printing sorted array</span></div>
 <div class="line"><span class="lineno">  118</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</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> &lt;&lt; test_array.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/at.html">at</a>(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  119</span>        std::cout &lt;&lt; test_array.at(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">  120</span>    }</div>
-<div class="line"><span class="lineno">  121</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPassed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  121</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  122</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg" width="420" height="238"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.map b/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.map
deleted file mode 100644
index f47469b40..000000000
--- a/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="test_1" name="test_1">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,107,63,132"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/at.html#" title=" " alt="" coords="128,5,224,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="46,104,74,77,109,48,129,36,131,41,112,52,77,81,50,108"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="312,57,391,83"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="62,109,110,98,209,83,297,73,297,78,210,88,111,103,64,114"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="318,108,386,134"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="63,117,302,118,302,123,63,122"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="126,207,226,232"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="47,131,75,162,112,193,119,197,116,202,109,198,71,166,43,134"/>
-<area shape="rect" id="Node000006" href="$d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" title=" " alt="" coords="111,157,241,183"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="64,127,124,149,123,154,62,132"/>
-<area shape="poly" id="edge6_Node000006_Node000003" title=" " alt="" coords="193,155,235,125,288,93,300,87,302,92,290,98,238,129,196,159"/>
-<area shape="poly" id="edge7_Node000006_Node000004" title=" " alt="" coords="224,154,302,132,303,137,225,159"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max_element.html#" title=" " alt="" coords="289,157,414,183"/>
-<area shape="poly" id="edge8_Node000006_Node000007" title=" " alt="" coords="242,168,273,168,273,173,242,173"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min_element.html#" title=" " alt="" coords="291,207,412,232"/>
-<area shape="poly" id="edge9_Node000006_Node000008" title=" " alt="" coords="225,181,290,199,288,205,224,186"/>
-</map>
diff --git a/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.md5 b/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.md5
deleted file mode 100644
index 942cb6bd6..000000000
--- a/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-36e07af770e6c43e397474e3904488a7
\ No newline at end of file
diff --git a/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg b/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg
deleted file mode 100644
index 5c2c634cc..000000000
--- a/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph.svg
+++ /dev/null
@@ -1,191 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_1 Pages: 1 -->
-<svg width="315pt" height="178pt"
- viewBox="0.00 0.00 314.75 178.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 174.25)">
-<title>test_1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="43,-94.25 0,-94.25 0,-75 43,-75 43,-94.25"/>
-<text text-anchor="middle" x="21.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="163.62,-170.25 92.12,-170.25 92.12,-151 163.62,-151 163.62,-170.25"/>
-<text text-anchor="middle" x="127.88" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.79,-94.72C42.44,-105.92 60.79,-124.05 79,-136.62 83.54,-139.76 88.55,-142.73 93.57,-145.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.89,-148.52 102.38,-149.95 95.07,-142.28 91.89,-148.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="289.12,-131.25 230.38,-131.25 230.38,-112 289.12,-112 289.12,-131.25"/>
-<text text-anchor="middle" x="259.75" y="-117.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.3,-90.39C53.92,-93.18 67.08,-96.39 79,-98.62 126.72,-107.56 182.21,-114.08 218.78,-117.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.14,-121.3 228.44,-118.82 218.84,-114.34 218.14,-121.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.38,-93.25 234.12,-93.25 234.12,-74 285.38,-74 285.38,-93.25"/>
-<text text-anchor="middle" x="259.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.47,-84.54C83.82,-84.37 172.72,-83.99 222.74,-83.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.47,-87.28 232.46,-83.74 222.44,-80.28 222.47,-87.28"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.5,-19.25 90.25,-19.25 90.25,0 165.5,0 165.5,-19.25"/>
-<text text-anchor="middle" x="127.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.91,-74.88C39.86,-62.4 58.65,-40.8 79,-27.62 80.61,-26.58 82.3,-25.58 84.03,-24.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.42,-27.85 92.91,-20.36 82.38,-21.54 85.42,-27.85"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-56.25 79,-56.25 79,-37 176.75,-37 176.75,-56.25"/>
-<text text-anchor="middle" x="127.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pigeonSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.37,-77.03C56.3,-72.32 73.29,-66.13 88.57,-60.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.69,-63.89 97.89,-57.18 87.29,-57.31 89.69,-63.89"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge6_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge6_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.02,-56.59C158.12,-68.51 186.49,-88.61 212.75,-102.62 215.61,-104.15 218.62,-105.64 221.67,-107.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.12,-110.2 230.68,-111.04 222.94,-103.8 220.12,-110.2"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge7_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M164.36,-56.74C182.56,-61.92 204.68,-68.22 222.93,-73.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.96,-76.78 232.54,-76.16 223.88,-70.05 221.96,-76.78"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306.75,-56.25 212.75,-56.25 212.75,-37 306.75,-37 306.75,-56.25"/>
-<text text-anchor="middle" x="259.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge8_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge8_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.24,-46.62C184.99,-46.62 193.08,-46.62 201.02,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.99,-50.13 210.99,-46.63 200.99,-43.13 200.99,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-19.25 214.25,-19.25 214.25,0 305.25,0 305.25,-19.25"/>
-<text text-anchor="middle" x="259.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge9_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge9_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M164.36,-36.51C179.25,-32.27 196.76,-27.28 212.63,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.19,-26.24 221.85,-20.14 211.27,-19.51 213.19,-26.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph_org.svg b/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph_org.svg
deleted file mode 100644
index 675ea68ee..000000000
--- a/dd/da8/pigeonhole__sort_8cpp_a34b8683a2b429de5cce57e6d733ec817_cgraph_org.svg
+++ /dev/null
@@ -1,165 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_1 Pages: 1 -->
-<svg width="315pt" height="178pt"
- viewBox="0.00 0.00 314.75 178.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 174.25)">
-<title>test_1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="43,-94.25 0,-94.25 0,-75 43,-75 43,-94.25"/>
-<text text-anchor="middle" x="21.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="163.62,-170.25 92.12,-170.25 92.12,-151 163.62,-151 163.62,-170.25"/>
-<text text-anchor="middle" x="127.88" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.79,-94.72C42.44,-105.92 60.79,-124.05 79,-136.62 83.54,-139.76 88.55,-142.73 93.57,-145.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.89,-148.52 102.38,-149.95 95.07,-142.28 91.89,-148.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="289.12,-131.25 230.38,-131.25 230.38,-112 289.12,-112 289.12,-131.25"/>
-<text text-anchor="middle" x="259.75" y="-117.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.3,-90.39C53.92,-93.18 67.08,-96.39 79,-98.62 126.72,-107.56 182.21,-114.08 218.78,-117.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.14,-121.3 228.44,-118.82 218.84,-114.34 218.14,-121.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.38,-93.25 234.12,-93.25 234.12,-74 285.38,-74 285.38,-93.25"/>
-<text text-anchor="middle" x="259.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.47,-84.54C83.82,-84.37 172.72,-83.99 222.74,-83.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.47,-87.28 232.46,-83.74 222.44,-80.28 222.47,-87.28"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.5,-19.25 90.25,-19.25 90.25,0 165.5,0 165.5,-19.25"/>
-<text text-anchor="middle" x="127.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.91,-74.88C39.86,-62.4 58.65,-40.8 79,-27.62 80.61,-26.58 82.3,-25.58 84.03,-24.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.42,-27.85 92.91,-20.36 82.38,-21.54 85.42,-27.85"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-56.25 79,-56.25 79,-37 176.75,-37 176.75,-56.25"/>
-<text text-anchor="middle" x="127.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pigeonSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.37,-77.03C56.3,-72.32 73.29,-66.13 88.57,-60.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.69,-63.89 97.89,-57.18 87.29,-57.31 89.69,-63.89"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge6_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge6_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.02,-56.59C158.12,-68.51 186.49,-88.61 212.75,-102.62 215.61,-104.15 218.62,-105.64 221.67,-107.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.12,-110.2 230.68,-111.04 222.94,-103.8 220.12,-110.2"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge7_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M164.36,-56.74C182.56,-61.92 204.68,-68.22 222.93,-73.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.96,-76.78 232.54,-76.16 223.88,-70.05 221.96,-76.78"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306.75,-56.25 212.75,-56.25 212.75,-37 306.75,-37 306.75,-56.25"/>
-<text text-anchor="middle" x="259.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge8_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge8_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.24,-46.62C184.99,-46.62 193.08,-46.62 201.02,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.99,-50.13 210.99,-46.63 200.99,-43.13 200.99,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-19.25 214.25,-19.25 214.25,0 305.25,0 305.25,-19.25"/>
-<text text-anchor="middle" x="259.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge9_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge9_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M164.36,-36.51C179.25,-32.27 196.76,-27.28 212.63,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.19,-26.24 221.85,-20.14 211.27,-19.51 213.19,-26.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.map b/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.map
deleted file mode 100644
index 2c24458c9..000000000
--- a/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="test_2" name="test_2">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,107,63,132"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/at.html#" title=" " alt="" coords="128,5,224,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="46,104,74,77,109,48,129,36,131,41,112,52,77,81,50,108"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="312,57,391,83"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="62,109,110,98,209,83,297,73,297,78,210,88,111,103,64,114"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="318,108,386,134"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="63,117,302,118,302,123,63,122"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="126,207,226,232"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="47,131,75,162,112,193,119,197,116,202,109,198,71,166,43,134"/>
-<area shape="rect" id="Node000006" href="$d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" title=" " alt="" coords="111,157,241,183"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="64,127,124,149,123,154,62,132"/>
-<area shape="poly" id="edge6_Node000006_Node000003" title=" " alt="" coords="193,155,235,125,288,93,300,87,302,92,290,98,238,129,196,159"/>
-<area shape="poly" id="edge7_Node000006_Node000004" title=" " alt="" coords="224,154,302,132,303,137,225,159"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max_element.html#" title=" " alt="" coords="289,157,414,183"/>
-<area shape="poly" id="edge8_Node000006_Node000007" title=" " alt="" coords="242,168,273,168,273,173,242,173"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min_element.html#" title=" " alt="" coords="291,207,412,232"/>
-<area shape="poly" id="edge9_Node000006_Node000008" title=" " alt="" coords="225,181,290,199,288,205,224,186"/>
-</map>
diff --git a/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.md5 b/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.md5
deleted file mode 100644
index 222ef999d..000000000
--- a/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8152176e7427c6c5bdcca041f6e318cf
\ No newline at end of file
diff --git a/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg b/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg
deleted file mode 100644
index 29a213db7..000000000
--- a/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph.svg
+++ /dev/null
@@ -1,191 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_2 Pages: 1 -->
-<svg width="315pt" height="178pt"
- viewBox="0.00 0.00 314.75 178.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 174.25)">
-<title>test_2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="43,-94.25 0,-94.25 0,-75 43,-75 43,-94.25"/>
-<text text-anchor="middle" x="21.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="163.62,-170.25 92.12,-170.25 92.12,-151 163.62,-151 163.62,-170.25"/>
-<text text-anchor="middle" x="127.88" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.79,-94.72C42.44,-105.92 60.79,-124.05 79,-136.62 83.54,-139.76 88.55,-142.73 93.57,-145.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.89,-148.52 102.38,-149.95 95.07,-142.28 91.89,-148.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="289.12,-131.25 230.38,-131.25 230.38,-112 289.12,-112 289.12,-131.25"/>
-<text text-anchor="middle" x="259.75" y="-117.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.3,-90.39C53.92,-93.18 67.08,-96.39 79,-98.62 126.72,-107.56 182.21,-114.08 218.78,-117.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.14,-121.3 228.44,-118.82 218.84,-114.34 218.14,-121.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.38,-93.25 234.12,-93.25 234.12,-74 285.38,-74 285.38,-93.25"/>
-<text text-anchor="middle" x="259.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.47,-84.54C83.82,-84.37 172.72,-83.99 222.74,-83.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.47,-87.28 232.46,-83.74 222.44,-80.28 222.47,-87.28"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.5,-19.25 90.25,-19.25 90.25,0 165.5,0 165.5,-19.25"/>
-<text text-anchor="middle" x="127.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.91,-74.88C39.86,-62.4 58.65,-40.8 79,-27.62 80.61,-26.58 82.3,-25.58 84.03,-24.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.42,-27.85 92.91,-20.36 82.38,-21.54 85.42,-27.85"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-56.25 79,-56.25 79,-37 176.75,-37 176.75,-56.25"/>
-<text text-anchor="middle" x="127.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pigeonSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.37,-77.03C56.3,-72.32 73.29,-66.13 88.57,-60.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.69,-63.89 97.89,-57.18 87.29,-57.31 89.69,-63.89"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge6_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge6_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.02,-56.59C158.12,-68.51 186.49,-88.61 212.75,-102.62 215.61,-104.15 218.62,-105.64 221.67,-107.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.12,-110.2 230.68,-111.04 222.94,-103.8 220.12,-110.2"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge7_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M164.36,-56.74C182.56,-61.92 204.68,-68.22 222.93,-73.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.96,-76.78 232.54,-76.16 223.88,-70.05 221.96,-76.78"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306.75,-56.25 212.75,-56.25 212.75,-37 306.75,-37 306.75,-56.25"/>
-<text text-anchor="middle" x="259.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge8_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge8_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.24,-46.62C184.99,-46.62 193.08,-46.62 201.02,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.99,-50.13 210.99,-46.63 200.99,-43.13 200.99,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-19.25 214.25,-19.25 214.25,0 305.25,0 305.25,-19.25"/>
-<text text-anchor="middle" x="259.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge9_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge9_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M164.36,-36.51C179.25,-32.27 196.76,-27.28 212.63,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.19,-26.24 221.85,-20.14 211.27,-19.51 213.19,-26.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph_org.svg b/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph_org.svg
deleted file mode 100644
index 1138bd0ed..000000000
--- a/dd/da8/pigeonhole__sort_8cpp_a458410412185a5f09199deaff7157a8d_cgraph_org.svg
+++ /dev/null
@@ -1,165 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_2 Pages: 1 -->
-<svg width="315pt" height="178pt"
- viewBox="0.00 0.00 314.75 178.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 174.25)">
-<title>test_2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="43,-94.25 0,-94.25 0,-75 43,-75 43,-94.25"/>
-<text text-anchor="middle" x="21.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="163.62,-170.25 92.12,-170.25 92.12,-151 163.62,-151 163.62,-170.25"/>
-<text text-anchor="middle" x="127.88" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.79,-94.72C42.44,-105.92 60.79,-124.05 79,-136.62 83.54,-139.76 88.55,-142.73 93.57,-145.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.89,-148.52 102.38,-149.95 95.07,-142.28 91.89,-148.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="289.12,-131.25 230.38,-131.25 230.38,-112 289.12,-112 289.12,-131.25"/>
-<text text-anchor="middle" x="259.75" y="-117.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.3,-90.39C53.92,-93.18 67.08,-96.39 79,-98.62 126.72,-107.56 182.21,-114.08 218.78,-117.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.14,-121.3 228.44,-118.82 218.84,-114.34 218.14,-121.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.38,-93.25 234.12,-93.25 234.12,-74 285.38,-74 285.38,-93.25"/>
-<text text-anchor="middle" x="259.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.47,-84.54C83.82,-84.37 172.72,-83.99 222.74,-83.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.47,-87.28 232.46,-83.74 222.44,-80.28 222.47,-87.28"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.5,-19.25 90.25,-19.25 90.25,0 165.5,0 165.5,-19.25"/>
-<text text-anchor="middle" x="127.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.91,-74.88C39.86,-62.4 58.65,-40.8 79,-27.62 80.61,-26.58 82.3,-25.58 84.03,-24.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.42,-27.85 92.91,-20.36 82.38,-21.54 85.42,-27.85"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-56.25 79,-56.25 79,-37 176.75,-37 176.75,-56.25"/>
-<text text-anchor="middle" x="127.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pigeonSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.37,-77.03C56.3,-72.32 73.29,-66.13 88.57,-60.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.69,-63.89 97.89,-57.18 87.29,-57.31 89.69,-63.89"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge6_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge6_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.02,-56.59C158.12,-68.51 186.49,-88.61 212.75,-102.62 215.61,-104.15 218.62,-105.64 221.67,-107.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.12,-110.2 230.68,-111.04 222.94,-103.8 220.12,-110.2"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge7_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M164.36,-56.74C182.56,-61.92 204.68,-68.22 222.93,-73.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.96,-76.78 232.54,-76.16 223.88,-70.05 221.96,-76.78"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306.75,-56.25 212.75,-56.25 212.75,-37 306.75,-37 306.75,-56.25"/>
-<text text-anchor="middle" x="259.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge8_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge8_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.24,-46.62C184.99,-46.62 193.08,-46.62 201.02,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.99,-50.13 210.99,-46.63 200.99,-43.13 200.99,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-19.25 214.25,-19.25 214.25,0 305.25,0 305.25,-19.25"/>
-<text text-anchor="middle" x="259.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge9_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge9_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M164.36,-36.51C179.25,-32.27 196.76,-27.28 212.63,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.19,-26.24 221.85,-20.14 211.27,-19.51 213.19,-26.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index f7f8945f0..000000000
--- a/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,35 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,182,55,208"/>
-<area shape="rect" id="Node000002" href="$dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" title=" " alt="" coords="103,231,160,257"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,204,91,221,88,226,54,209"/>
-<area shape="rect" id="Node000010" href="$dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d" title=" " alt="" coords="103,182,160,208"/>
-<area shape="poly" id="edge11_Node000001_Node000010" title=" " alt="" coords="55,192,87,192,87,197,55,197"/>
-<area shape="rect" id="Node000011" href="$dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a" title=" " alt="" coords="103,107,160,133"/>
-<area shape="poly" id="edge17_Node000001_Node000011" title=" " alt="" coords="47,179,99,140,102,144,51,184"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/at.html#" title=" " alt="" coords="226,131,321,157"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="150,228,239,164,243,168,153,233"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="410,334,488,360"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="139,257,147,281,162,311,182,341,209,363,232,373,257,379,308,381,357,374,400,362,401,368,358,379,308,387,256,384,231,378,207,368,178,344,157,314,142,283,134,258"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="415,185,483,210"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="160,237,399,202,400,207,161,243"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="223,82,323,108"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="148,229,158,219,173,191,179,166,187,142,206,117,209,114,212,118,210,121,192,144,184,168,177,193,162,222,152,233"/>
-<area shape="rect" id="Node000007" href="$d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" title=" " alt="" coords="208,283,338,309"/>
-<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="161,252,223,275,221,280,160,257"/>
-<area shape="poly" id="edge7_Node000007_Node000004" title=" " alt="" coords="321,307,396,329,394,334,320,312"/>
-<area shape="poly" id="edge8_Node000007_Node000005" title=" " alt="" coords="303,281,337,262,360,241,385,221,399,213,402,217,388,225,364,245,340,266,306,285"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max_element.html#" title=" " alt="" coords="386,235,512,261"/>
-<area shape="poly" id="edge9_Node000007_Node000008" title=" " alt="" coords="322,280,384,263,386,268,324,285"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min_element.html#" title=" " alt="" coords="388,285,510,310"/>
-<area shape="poly" id="edge10_Node000007_Node000009" title=" " alt="" coords="339,294,373,294,373,299,339,299"/>
-<area shape="poly" id="edge12_Node000010_Node000003" title=" " alt="" coords="160,182,220,160,222,165,161,187"/>
-<area shape="poly" id="edge13_Node000010_Node000004" title=" " alt="" coords="152,206,162,217,177,247,183,274,190,298,197,308,209,319,254,341,302,352,351,355,394,353,394,358,351,360,301,357,252,346,207,324,193,312,185,300,177,275,172,249,158,220,148,210"/>
-<area shape="poly" id="edge14_Node000010_Node000005" title=" " alt="" coords="161,192,400,194,400,200,161,198"/>
-<area shape="poly" id="edge15_Node000010_Node000006" title=" " alt="" coords="141,180,168,149,206,117,213,112,216,117,210,121,172,152,145,184"/>
-<area shape="poly" id="edge16_Node000010_Node000007" title=" " alt="" coords="152,206,243,272,240,276,149,210"/>
-<area shape="poly" id="edge18_Node000011_Node000003" title=" " alt="" coords="161,122,210,131,209,136,160,127"/>
-<area shape="poly" id="edge19_Node000011_Node000004" title=" " alt="" coords="145,105,172,84,207,67,245,55,277,47,308,49,340,67,365,96,375,127,376,159,371,191,365,223,363,256,369,289,388,321,398,330,394,334,384,324,364,290,358,256,360,223,365,190,370,158,370,128,360,99,337,71,306,54,277,52,246,60,209,72,175,88,148,109"/>
-<area shape="poly" id="edge20_Node000011_Node000005" title=" " alt="" coords="136,105,162,63,182,40,207,23,242,8,274,3,305,8,340,23,360,37,378,54,407,93,428,133,442,169,437,171,423,136,403,95,374,57,357,41,337,28,303,13,274,8,244,13,209,28,185,44,166,66,141,108"/>
-<area shape="poly" id="edge21_Node000011_Node000006" title=" " alt="" coords="160,112,207,104,208,109,161,118"/>
-<area shape="poly" id="edge22_Node000011_Node000007" title=" " alt="" coords="145,132,254,269,250,272,141,135"/>
-</map>
diff --git a/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 7aa284475..000000000
--- a/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8c5e697481dbacd4b478821c96588c39
\ No newline at end of file
diff --git a/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index e665cf3f4..000000000
--- a/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,335 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="388pt" height="293pt"
- viewBox="0.00 0.00 387.75 292.76" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 288.76)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-152.34 0,-152.34 0,-133.09 37,-133.09 37,-152.34"/>
-<text text-anchor="middle" x="18.5" y="-138.84" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116,-115.34 73,-115.34 73,-96.09 116,-96.09 116,-115.34"/>
-<text text-anchor="middle" x="94.5" y="-101.84" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.41,-133.76C45.14,-129.89 54.39,-125.27 63.13,-120.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.67,-124.04 72.05,-116.44 61.54,-117.78 64.67,-124.04"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116,-152.34 73,-152.34 73,-133.09 116,-133.09 116,-152.34"/>
-<text text-anchor="middle" x="94.5" y="-138.84" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge11_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.41,-142.71C44.54,-142.71 52.97,-142.71 61.1,-142.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.09,-146.21 71.09,-142.71 61.09,-139.21 61.09,-146.21"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116,-208.34 73,-208.34 73,-189.09 116,-189.09 116,-208.34"/>
-<text text-anchor="middle" x="94.5" y="-194.84" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge17_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge17_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.73,-152.72C43.46,-160.85 58.82,-172.47 71.42,-182"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.09,-184.63 79.18,-187.87 73.32,-179.05 69.09,-184.63"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.62,-190.34 165.12,-190.34 165.12,-171.09 236.62,-171.09 236.62,-190.34"/>
-<text text-anchor="middle" x="200.88" y="-176.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.58,-115.83C126.79,-128.2 156.17,-149.31 176.73,-164.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.63,-166.88 184.79,-169.88 178.71,-161.2 174.63,-166.88"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="362.12,-38.34 303.38,-38.34 303.38,-19.09 362.12,-19.09 362.12,-38.34"/>
-<text text-anchor="middle" x="332.75" y="-24.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.2,-95.68C104.12,-75.91 120.31,-32.34 152,-14.71 196.94,10.28 258.23,-2.57 296.37,-14.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.93,-18.19 305.52,-18.12 297.2,-11.57 294.93,-18.19"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.38,-150.34 307.12,-150.34 307.12,-131.09 358.38,-131.09 358.38,-150.34"/>
-<text text-anchor="middle" x="332.75" y="-136.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.47,-108.82C156.82,-114.8 245.72,-127.97 295.74,-135.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.07,-138.82 305.48,-136.82 296.1,-131.89 295.07,-138.82"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.5,-227.34 163.25,-227.34 163.25,-208.09 238.5,-208.09 238.5,-227.34"/>
-<text text-anchor="middle" x="200.88" y="-213.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.44,-115.63C111.14,-118.09 113.83,-120.84 116,-123.71 138.51,-153.55 124.5,-174.4 152,-199.71 152.64,-200.3 153.29,-200.87 153.97,-201.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.02,-204.32 162.32,-206.78 155.8,-198.43 152.02,-204.32"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.75,-76.34 152,-76.34 152,-57.09 249.75,-57.09 249.75,-76.34"/>
-<text text-anchor="middle" x="200.88" y="-62.84" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pigeonSort</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.37,-97.91C129.62,-92.97 147.13,-86.42 162.7,-80.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.53,-84.03 171.67,-77.25 161.08,-77.47 163.53,-84.03"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge7_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge7_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M236.34,-56.63C253.56,-51.59 274.47,-45.47 292.33,-40.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.2,-43.64 301.82,-37.47 291.24,-36.92 293.2,-43.64"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge8_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge8_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.44,-76.61C232.65,-80.58 241.86,-85.45 249.75,-90.71 267.32,-102.42 267.76,-110.65 285.75,-121.71 289.09,-123.77 292.69,-125.69 296.36,-127.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.74,-130.58 305.3,-131.44 297.59,-124.18 294.74,-130.58"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="379.75,-112.34 285.75,-112.34 285.75,-93.09 379.75,-93.09 379.75,-112.34"/>
-<text text-anchor="middle" x="332.75" y="-98.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge9_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M238.4,-76.84C252.77,-80.82 269.45,-85.44 284.7,-89.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="283.47,-92.96 294.04,-92.26 285.34,-86.22 283.47,-92.96"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="378.25,-75.34 287.25,-75.34 287.25,-56.09 378.25,-56.09 378.25,-75.34"/>
-<text text-anchor="middle" x="332.75" y="-61.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge10_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge10_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M250.24,-66.34C258.47,-66.28 267.08,-66.21 275.49,-66.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="275.3,-69.65 285.27,-66.07 275.25,-62.65 275.3,-69.65"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node3 -->
-<g id="edge12_Node000010_Node000003" class="edge">
-<title>Node10&#45;&gt;Node3</title>
-<g id="a_edge12_Node000010_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.37,-150.31C129.3,-155.02 146.29,-161.2 161.57,-166.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.29,-170.03 170.89,-170.16 162.69,-163.45 160.29,-170.03"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node4 -->
-<g id="edge13_Node000010_Node000004" class="edge">
-<title>Node10&#45;&gt;Node4</title>
-<g id="a_edge13_Node000010_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.45,-132.8C111.15,-130.35 113.84,-127.59 116,-124.71 138.68,-94.5 121.24,-69.64 152,-47.71 192.73,-18.68 252.42,-18.43 291.67,-22.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.07,-25.84 301.41,-23.51 291.87,-18.88 291.07,-25.84"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node5 -->
-<g id="edge14_Node000010_Node000005" class="edge">
-<title>Node10&#45;&gt;Node5</title>
-<g id="a_edge14_Node000010_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.47,-142.54C156.82,-142.19 245.72,-141.44 295.74,-141.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.49,-144.52 305.46,-140.94 295.43,-137.52 295.49,-144.52"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node6 -->
-<g id="edge15_Node000010_Node000006" class="edge">
-<title>Node10&#45;&gt;Node6</title>
-<g id="a_edge15_Node000010_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.91,-152.45C112.86,-164.94 131.65,-186.53 152,-199.71 153.61,-200.76 155.3,-201.76 157.03,-202.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.38,-205.8 165.91,-206.98 158.42,-199.49 155.38,-205.8"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node7 -->
-<g id="edge16_Node000010_Node000007" class="edge">
-<title>Node10&#45;&gt;Node7</title>
-<g id="a_edge16_Node000010_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-132.78C126.41,-120.2 156.4,-98.37 177.15,-83.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.98,-86.26 185,-77.54 174.86,-80.6 178.98,-86.26"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node3 -->
-<g id="edge18_Node000011_Node000003" class="edge">
-<title>Node11&#45;&gt;Node3</title>
-<g id="a_edge18_Node000011_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.37,-195.11C127.05,-193.27 140.49,-190.95 153.46,-188.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.9,-192.19 163.16,-187.04 152.71,-185.3 153.9,-192.19"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node4 -->
-<g id="edge19_Node000011_Node000004" class="edge">
-<title>Node11&#45;&gt;Node4</title>
-<g id="a_edge19_Node000011_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.15,-208.76C116.8,-218.07 134.14,-231.26 152,-236.71 193.55,-249.39 216.29,-264.43 249.75,-236.71 315.94,-181.89 230.87,-112.86 285.75,-46.71 287.85,-44.18 290.36,-42 293.11,-40.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.55,-43.32 301.77,-35.56 291.29,-37.12 294.55,-43.32"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge20_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge20_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.82,-208.62C107.55,-224.93 125.47,-256.92 152,-269.71 191.13,-288.58 211.67,-290.63 249.75,-269.71 291.86,-246.58 315.42,-191.64 325.61,-161.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.93,-162.57 328.61,-151.98 322.25,-160.46 328.93,-162.57"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node6 -->
-<g id="edge21_Node000011_Node000006" class="edge">
-<title>Node11&#45;&gt;Node6</title>
-<g id="a_edge21_Node000011_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.37,-202.51C126.57,-204.37 139.31,-206.69 151.74,-208.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.03,-212.38 161.5,-210.73 152.28,-205.49 151.03,-212.38"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node7 -->
-<g id="edge22_Node000011_Node000007" class="edge">
-<title>Node11&#45;&gt;Node7</title>
-<g id="a_edge22_Node000011_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.35,-188.79C120.65,-166.91 162.33,-114.19 184.85,-85.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.54,-87.95 191,-77.94 182.05,-83.61 187.54,-87.95"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index a3bd4eb6e..000000000
--- a/dd/da8/pigeonhole__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,309 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="388pt" height="293pt"
- viewBox="0.00 0.00 387.75 292.76" 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 288.76)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-152.34 0,-152.34 0,-133.09 37,-133.09 37,-152.34"/>
-<text text-anchor="middle" x="18.5" y="-138.84" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116,-115.34 73,-115.34 73,-96.09 116,-96.09 116,-115.34"/>
-<text text-anchor="middle" x="94.5" y="-101.84" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.41,-133.76C45.14,-129.89 54.39,-125.27 63.13,-120.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.67,-124.04 72.05,-116.44 61.54,-117.78 64.67,-124.04"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116,-152.34 73,-152.34 73,-133.09 116,-133.09 116,-152.34"/>
-<text text-anchor="middle" x="94.5" y="-138.84" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge11_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge11_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.41,-142.71C44.54,-142.71 52.97,-142.71 61.1,-142.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.09,-146.21 71.09,-142.71 61.09,-139.21 61.09,-146.21"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116,-208.34 73,-208.34 73,-189.09 116,-189.09 116,-208.34"/>
-<text text-anchor="middle" x="94.5" y="-194.84" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge17_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge17_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.73,-152.72C43.46,-160.85 58.82,-172.47 71.42,-182"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.09,-184.63 79.18,-187.87 73.32,-179.05 69.09,-184.63"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.62,-190.34 165.12,-190.34 165.12,-171.09 236.62,-171.09 236.62,-190.34"/>
-<text text-anchor="middle" x="200.88" y="-176.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.58,-115.83C126.79,-128.2 156.17,-149.31 176.73,-164.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.63,-166.88 184.79,-169.88 178.71,-161.2 174.63,-166.88"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="362.12,-38.34 303.38,-38.34 303.38,-19.09 362.12,-19.09 362.12,-38.34"/>
-<text text-anchor="middle" x="332.75" y="-24.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.2,-95.68C104.12,-75.91 120.31,-32.34 152,-14.71 196.94,10.28 258.23,-2.57 296.37,-14.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.93,-18.19 305.52,-18.12 297.2,-11.57 294.93,-18.19"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.38,-150.34 307.12,-150.34 307.12,-131.09 358.38,-131.09 358.38,-150.34"/>
-<text text-anchor="middle" x="332.75" y="-136.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.47,-108.82C156.82,-114.8 245.72,-127.97 295.74,-135.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.07,-138.82 305.48,-136.82 296.1,-131.89 295.07,-138.82"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.5,-227.34 163.25,-227.34 163.25,-208.09 238.5,-208.09 238.5,-227.34"/>
-<text text-anchor="middle" x="200.88" y="-213.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.44,-115.63C111.14,-118.09 113.83,-120.84 116,-123.71 138.51,-153.55 124.5,-174.4 152,-199.71 152.64,-200.3 153.29,-200.87 153.97,-201.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.02,-204.32 162.32,-206.78 155.8,-198.43 152.02,-204.32"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.75,-76.34 152,-76.34 152,-57.09 249.75,-57.09 249.75,-76.34"/>
-<text text-anchor="middle" x="200.88" y="-62.84" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pigeonSort</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.37,-97.91C129.62,-92.97 147.13,-86.42 162.7,-80.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.53,-84.03 171.67,-77.25 161.08,-77.47 163.53,-84.03"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge7_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge7_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M236.34,-56.63C253.56,-51.59 274.47,-45.47 292.33,-40.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.2,-43.64 301.82,-37.47 291.24,-36.92 293.2,-43.64"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge8_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge8_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M224.44,-76.61C232.65,-80.58 241.86,-85.45 249.75,-90.71 267.32,-102.42 267.76,-110.65 285.75,-121.71 289.09,-123.77 292.69,-125.69 296.36,-127.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.74,-130.58 305.3,-131.44 297.59,-124.18 294.74,-130.58"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="379.75,-112.34 285.75,-112.34 285.75,-93.09 379.75,-93.09 379.75,-112.34"/>
-<text text-anchor="middle" x="332.75" y="-98.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge9_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge9_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M238.4,-76.84C252.77,-80.82 269.45,-85.44 284.7,-89.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="283.47,-92.96 294.04,-92.26 285.34,-86.22 283.47,-92.96"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="378.25,-75.34 287.25,-75.34 287.25,-56.09 378.25,-56.09 378.25,-75.34"/>
-<text text-anchor="middle" x="332.75" y="-61.84" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge10_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge10_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M250.24,-66.34C258.47,-66.28 267.08,-66.21 275.49,-66.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="275.3,-69.65 285.27,-66.07 275.25,-62.65 275.3,-69.65"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node3 -->
-<g id="edge12_Node000010_Node000003" class="edge">
-<title>Node10&#45;&gt;Node3</title>
-<g id="a_edge12_Node000010_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.37,-150.31C129.3,-155.02 146.29,-161.2 161.57,-166.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.29,-170.03 170.89,-170.16 162.69,-163.45 160.29,-170.03"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node4 -->
-<g id="edge13_Node000010_Node000004" class="edge">
-<title>Node10&#45;&gt;Node4</title>
-<g id="a_edge13_Node000010_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.45,-132.8C111.15,-130.35 113.84,-127.59 116,-124.71 138.68,-94.5 121.24,-69.64 152,-47.71 192.73,-18.68 252.42,-18.43 291.67,-22.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.07,-25.84 301.41,-23.51 291.87,-18.88 291.07,-25.84"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node5 -->
-<g id="edge14_Node000010_Node000005" class="edge">
-<title>Node10&#45;&gt;Node5</title>
-<g id="a_edge14_Node000010_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.47,-142.54C156.82,-142.19 245.72,-141.44 295.74,-141.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.49,-144.52 305.46,-140.94 295.43,-137.52 295.49,-144.52"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node6 -->
-<g id="edge15_Node000010_Node000006" class="edge">
-<title>Node10&#45;&gt;Node6</title>
-<g id="a_edge15_Node000010_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.91,-152.45C112.86,-164.94 131.65,-186.53 152,-199.71 153.61,-200.76 155.3,-201.76 157.03,-202.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.38,-205.8 165.91,-206.98 158.42,-199.49 155.38,-205.8"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node7 -->
-<g id="edge16_Node000010_Node000007" class="edge">
-<title>Node10&#45;&gt;Node7</title>
-<g id="a_edge16_Node000010_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M109.15,-132.78C126.41,-120.2 156.4,-98.37 177.15,-83.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.98,-86.26 185,-77.54 174.86,-80.6 178.98,-86.26"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node3 -->
-<g id="edge18_Node000011_Node000003" class="edge">
-<title>Node11&#45;&gt;Node3</title>
-<g id="a_edge18_Node000011_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.37,-195.11C127.05,-193.27 140.49,-190.95 153.46,-188.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.9,-192.19 163.16,-187.04 152.71,-185.3 153.9,-192.19"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node4 -->
-<g id="edge19_Node000011_Node000004" class="edge">
-<title>Node11&#45;&gt;Node4</title>
-<g id="a_edge19_Node000011_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.15,-208.76C116.8,-218.07 134.14,-231.26 152,-236.71 193.55,-249.39 216.29,-264.43 249.75,-236.71 315.94,-181.89 230.87,-112.86 285.75,-46.71 287.85,-44.18 290.36,-42 293.11,-40.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.55,-43.32 301.77,-35.56 291.29,-37.12 294.55,-43.32"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge20_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge20_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.82,-208.62C107.55,-224.93 125.47,-256.92 152,-269.71 191.13,-288.58 211.67,-290.63 249.75,-269.71 291.86,-246.58 315.42,-191.64 325.61,-161.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.93,-162.57 328.61,-151.98 322.25,-160.46 328.93,-162.57"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node6 -->
-<g id="edge21_Node000011_Node000006" class="edge">
-<title>Node11&#45;&gt;Node6</title>
-<g id="a_edge21_Node000011_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.37,-202.51C126.57,-204.37 139.31,-206.69 151.74,-208.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.03,-212.38 161.5,-210.73 152.28,-205.49 151.03,-212.38"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node7 -->
-<g id="edge22_Node000011_Node000007" class="edge">
-<title>Node11&#45;&gt;Node7</title>
-<g id="a_edge22_Node000011_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.35,-188.79C120.65,-166.91 162.33,-114.19 184.85,-85.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.54,-87.95 191,-77.94 182.05,-83.61 187.54,-87.95"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.map b/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.map
deleted file mode 100644
index 13c6d2844..000000000
--- a/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="test_3" name="test_3">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,107,63,132"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/at.html#" title=" " alt="" coords="128,5,224,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="46,104,74,77,109,48,129,36,131,41,112,52,77,81,50,108"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="312,57,391,83"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="62,109,110,98,209,83,297,73,297,78,210,88,111,103,64,114"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="318,108,386,134"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="63,117,302,118,302,123,63,122"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="126,207,226,232"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="47,131,75,162,112,193,119,197,116,202,109,198,71,166,43,134"/>
-<area shape="rect" id="Node000006" href="$d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" title=" " alt="" coords="111,157,241,183"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="64,127,124,149,123,154,62,132"/>
-<area shape="poly" id="edge6_Node000006_Node000003" title=" " alt="" coords="193,155,235,125,288,93,300,87,302,92,290,98,238,129,196,159"/>
-<area shape="poly" id="edge7_Node000006_Node000004" title=" " alt="" coords="224,154,302,132,303,137,225,159"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max_element.html#" title=" " alt="" coords="289,157,414,183"/>
-<area shape="poly" id="edge8_Node000006_Node000007" title=" " alt="" coords="242,168,273,168,273,173,242,173"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min_element.html#" title=" " alt="" coords="291,207,412,232"/>
-<area shape="poly" id="edge9_Node000006_Node000008" title=" " alt="" coords="225,181,290,199,288,205,224,186"/>
-</map>
diff --git a/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.md5 b/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.md5
deleted file mode 100644
index 3e44ddbd4..000000000
--- a/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0bba5cd68fd96a0263b3a7f724f48940
\ No newline at end of file
diff --git a/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg b/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg
deleted file mode 100644
index 9d830ccf8..000000000
--- a/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph.svg
+++ /dev/null
@@ -1,191 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_3 Pages: 1 -->
-<svg width="315pt" height="178pt"
- viewBox="0.00 0.00 314.75 178.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 174.25)">
-<title>test_3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="43,-94.25 0,-94.25 0,-75 43,-75 43,-94.25"/>
-<text text-anchor="middle" x="21.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="163.62,-170.25 92.12,-170.25 92.12,-151 163.62,-151 163.62,-170.25"/>
-<text text-anchor="middle" x="127.88" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.79,-94.72C42.44,-105.92 60.79,-124.05 79,-136.62 83.54,-139.76 88.55,-142.73 93.57,-145.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.89,-148.52 102.38,-149.95 95.07,-142.28 91.89,-148.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="289.12,-131.25 230.38,-131.25 230.38,-112 289.12,-112 289.12,-131.25"/>
-<text text-anchor="middle" x="259.75" y="-117.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.3,-90.39C53.92,-93.18 67.08,-96.39 79,-98.62 126.72,-107.56 182.21,-114.08 218.78,-117.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.14,-121.3 228.44,-118.82 218.84,-114.34 218.14,-121.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.38,-93.25 234.12,-93.25 234.12,-74 285.38,-74 285.38,-93.25"/>
-<text text-anchor="middle" x="259.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.47,-84.54C83.82,-84.37 172.72,-83.99 222.74,-83.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.47,-87.28 232.46,-83.74 222.44,-80.28 222.47,-87.28"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.5,-19.25 90.25,-19.25 90.25,0 165.5,0 165.5,-19.25"/>
-<text text-anchor="middle" x="127.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.91,-74.88C39.86,-62.4 58.65,-40.8 79,-27.62 80.61,-26.58 82.3,-25.58 84.03,-24.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.42,-27.85 92.91,-20.36 82.38,-21.54 85.42,-27.85"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-56.25 79,-56.25 79,-37 176.75,-37 176.75,-56.25"/>
-<text text-anchor="middle" x="127.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pigeonSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.37,-77.03C56.3,-72.32 73.29,-66.13 88.57,-60.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.69,-63.89 97.89,-57.18 87.29,-57.31 89.69,-63.89"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge6_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge6_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.02,-56.59C158.12,-68.51 186.49,-88.61 212.75,-102.62 215.61,-104.15 218.62,-105.64 221.67,-107.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.12,-110.2 230.68,-111.04 222.94,-103.8 220.12,-110.2"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge7_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M164.36,-56.74C182.56,-61.92 204.68,-68.22 222.93,-73.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.96,-76.78 232.54,-76.16 223.88,-70.05 221.96,-76.78"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306.75,-56.25 212.75,-56.25 212.75,-37 306.75,-37 306.75,-56.25"/>
-<text text-anchor="middle" x="259.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge8_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge8_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.24,-46.62C184.99,-46.62 193.08,-46.62 201.02,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.99,-50.13 210.99,-46.63 200.99,-43.13 200.99,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-19.25 214.25,-19.25 214.25,0 305.25,0 305.25,-19.25"/>
-<text text-anchor="middle" x="259.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge9_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge9_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M164.36,-36.51C179.25,-32.27 196.76,-27.28 212.63,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.19,-26.24 221.85,-20.14 211.27,-19.51 213.19,-26.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph_org.svg b/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph_org.svg
deleted file mode 100644
index 19946daec..000000000
--- a/dd/da8/pigeonhole__sort_8cpp_af31ec5409537703d9c8a47350386b32a_cgraph_org.svg
+++ /dev/null
@@ -1,165 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_3 Pages: 1 -->
-<svg width="315pt" height="178pt"
- viewBox="0.00 0.00 314.75 178.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 174.25)">
-<title>test_3</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="43,-94.25 0,-94.25 0,-75 43,-75 43,-94.25"/>
-<text text-anchor="middle" x="21.5" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="163.62,-170.25 92.12,-170.25 92.12,-151 163.62,-151 163.62,-170.25"/>
-<text text-anchor="middle" x="127.88" y="-156.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.79,-94.72C42.44,-105.92 60.79,-124.05 79,-136.62 83.54,-139.76 88.55,-142.73 93.57,-145.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.89,-148.52 102.38,-149.95 95.07,-142.28 91.89,-148.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="289.12,-131.25 230.38,-131.25 230.38,-112 289.12,-112 289.12,-131.25"/>
-<text text-anchor="middle" x="259.75" y="-117.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.3,-90.39C53.92,-93.18 67.08,-96.39 79,-98.62 126.72,-107.56 182.21,-114.08 218.78,-117.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.14,-121.3 228.44,-118.82 218.84,-114.34 218.14,-121.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.38,-93.25 234.12,-93.25 234.12,-74 285.38,-74 285.38,-93.25"/>
-<text text-anchor="middle" x="259.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.47,-84.54C83.82,-84.37 172.72,-83.99 222.74,-83.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.47,-87.28 232.46,-83.74 222.44,-80.28 222.47,-87.28"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.5,-19.25 90.25,-19.25 90.25,0 165.5,0 165.5,-19.25"/>
-<text text-anchor="middle" x="127.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.91,-74.88C39.86,-62.4 58.65,-40.8 79,-27.62 80.61,-26.58 82.3,-25.58 84.03,-24.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.42,-27.85 92.91,-20.36 82.38,-21.54 85.42,-27.85"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="176.75,-56.25 79,-56.25 79,-37 176.75,-37 176.75,-56.25"/>
-<text text-anchor="middle" x="127.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::pigeonSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.37,-77.03C56.3,-72.32 73.29,-66.13 88.57,-60.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.69,-63.89 97.89,-57.18 87.29,-57.31 89.69,-63.89"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node3 -->
-<g id="edge6_Node000006_Node000003" class="edge">
-<title>Node6&#45;&gt;Node3</title>
-<g id="a_edge6_Node000006_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.02,-56.59C158.12,-68.51 186.49,-88.61 212.75,-102.62 215.61,-104.15 218.62,-105.64 221.67,-107.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.12,-110.2 230.68,-111.04 222.94,-103.8 220.12,-110.2"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node4 -->
-<g id="edge7_Node000006_Node000004" class="edge">
-<title>Node6&#45;&gt;Node4</title>
-<g id="a_edge7_Node000006_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M164.36,-56.74C182.56,-61.92 204.68,-68.22 222.93,-73.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.96,-76.78 232.54,-76.16 223.88,-70.05 221.96,-76.78"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="306.75,-56.25 212.75,-56.25 212.75,-37 306.75,-37 306.75,-56.25"/>
-<text text-anchor="middle" x="259.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max_element</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge8_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge8_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M177.24,-46.62C184.99,-46.62 193.08,-46.62 201.02,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.99,-50.13 210.99,-46.63 200.99,-43.13 200.99,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min_element.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="305.25,-19.25 214.25,-19.25 214.25,0 305.25,0 305.25,-19.25"/>
-<text text-anchor="middle" x="259.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min_element</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge9_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge9_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M164.36,-36.51C179.25,-32.27 196.76,-27.28 212.63,-22.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.19,-26.24 221.85,-20.14 211.27,-19.51 213.19,-26.24"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/da8/pigeonhole__sort_8cpp_source.html b/dd/da8/pigeonhole__sort_8cpp_source.html
new file mode 100644
index 000000000..6dd47c8de
--- /dev/null
+++ b/dd/da8/pigeonhole__sort_8cpp_source.html
@@ -0,0 +1,244 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/pigeonhole_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dd/da8/pigeonhole__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">pigeonhole_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../dd/da8/pigeonhole__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  <span class="comment">//for std::is_sorted</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;array&gt;</span>      <span class="comment">//for std::array</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;cassert&gt;</span>    <span class="comment">//for assert</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;iostream&gt;</span>   <span class="comment">//for io operations</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">template</span> &lt;std::<span class="keywordtype">size_t</span> N&gt;</div>
+<div class="foldopen" id="foldopen00034" data-start="{" data-end="}">
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">   34</a></span>std::array&lt;int, N&gt; <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">pigeonSort</a>(std::array&lt;int, N&gt; arr) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="comment">// Finding min and max*</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keyword">auto</span> min = std::min_element(std::begin(arr), std::end(arr));</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keyword">auto</span> max = std::max_element(std::begin(arr), std::end(arr));</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="comment">// Range refers to the number of holes required</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordtype">int</span> range = *max - *min + 1;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordtype">int</span> *hole = <span class="keyword">new</span> <span class="keywordtype">int</span>[range]();</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="comment">// Copying all array values to pigeonhole</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; N; i++) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        hole[arr[i] - *min] = arr[i];</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    }</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="comment">// Deleting elements from list and storing to original array</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordtype">int</span> count = 0;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; range; i++) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        <span class="keywordflow">while</span> (hole[i] != <span class="charliteral">&#39;\0&#39;</span>) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            arr[count] = hole[i];</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            hole[i] = {};</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            count++;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keyword">delete</span>[] hole;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">return</span> arr;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>}</div>
+</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="foldopen" id="foldopen00068" data-start="{" data-end="}">
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"><a class="line" href="../../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">   68</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a>() {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> n = 7;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    std::array&lt;int, n&gt; test_array = {8, 3, 2, 7, 4, 6, 8};</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    test_array = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort&lt;n&gt;</a>(test_array);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    assert(std::is_sorted(std::begin(test_array), std::end(test_array)));</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="comment">// Printing sorted array</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        std::cout &lt;&lt; test_array.at(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed\n&quot;</span>;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>}</div>
+</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span> </div>
+<div class="foldopen" id="foldopen00088" data-start="{" data-end="}">
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"><a class="line" href="../../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d">   88</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a>() {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> n = 10;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    std::array&lt;int, n&gt; test_array = {802, 630, 20,  745, 52,</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>                                     300, 612, 932, 78,  187};</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    test_array = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort&lt;n&gt;</a>(test_array);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    assert(std::is_sorted(std::begin(test_array), std::end(test_array)));</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="comment">// Printing sorted array</span></div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        std::cout &lt;&lt; test_array.at(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    }</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed\n&quot;</span>;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>}</div>
+</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
+<div class="foldopen" id="foldopen00109" data-start="{" data-end="}">
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"><a class="line" href="../../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a">  109</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a>() {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keyword">const</span> <span class="keywordtype">int</span> n = 4;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::array&lt;int, n&gt; test_array = {11, 13, 12, 14};</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    test_array = <a class="code hl_function" href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort&lt;n&gt;</a>(test_array);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    assert(std::is_sorted(std::begin(test_array), std::end(test_array)));</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="comment">// Printing sorted array</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>        std::cout &lt;&lt; test_array.at(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    }</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPassed\n&quot;</span>;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>}</div>
+</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="foldopen" id="foldopen00127" data-start="{" data-end="}">
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"><a class="line" href="../../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  127</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    <a class="code hl_function" href="../../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a>();</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    <a class="code hl_function" href="../../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a>();</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <a class="code hl_function" href="../../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a>();</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>}</div>
+</div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+<div class="ttc" id="anamespacesorting_html_a0e9e1b21a1684585e9e50f9afe4d53a3"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3">sorting::pigeonSort</a></div><div class="ttdeci">std::array&lt; int, N &gt; pigeonSort(std::array&lt; int, N &gt; arr)</div><div class="ttdef"><b>Definition</b> <a href="#l00034">pigeonhole_sort.cpp:34</a></div></div>
+<div class="ttc" id="apigeonhole__sort_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="../../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> <a href="#l00068">pigeonhole_sort.cpp:68</a></div></div>
+<div class="ttc" id="apigeonhole__sort_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="../../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> <a href="#l00088">pigeonhole_sort.cpp:88</a></div></div>
+<div class="ttc" id="apigeonhole__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00127">pigeonhole_sort.cpp:127</a></div></div>
+<div class="ttc" id="apigeonhole__sort_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="../../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> <a href="#l00109">pigeonhole_sort.cpp:109</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../dd/da8/pigeonhole__sort_8cpp.html">pigeonhole_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dd/da8/struct_segment_intersection-members.html b/dd/da8/struct_segment_intersection-members.html
index af0ba73d5..d93536723 100644
--- a/dd/da8/struct_segment_intersection-members.html
+++ b/dd/da8/struct_segment_intersection-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dd/dae/namespacecount__of__set__bits.html b/dd/dae/namespacecount__of__set__bits.html
index 02e87280c..e280fc42c 100644
--- a/dd/dae/namespacecount__of__set__bits.html
+++ b/dd/dae/namespacecount__of__set__bits.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: count_of_set_bits Namespace Reference</title>
+<title>TheAlgorithms/C++: count_of_set_bits Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dd/dae/structquadratic__probing_1_1_entry-members.html b/dd/dae/structquadratic__probing_1_1_entry-members.html
index f566bd5b1..740ffce0c 100644
--- a/dd/dae/structquadratic__probing_1_1_entry-members.html
+++ b/dd/dae/structquadratic__probing_1_1_entry-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html b/dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html
index fa79d69af..b16b9761c 100644
--- a/dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html
+++ b/dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: /Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp</title>
+<title>TheAlgorithms/C++: /Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -108,73 +125,33 @@ $(function(){initNavTree('dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plu
 </div><!--header-->
 <div class="contents">
 <p>arr = [1,1,5,6,1,4], after wiggle sort arr will become equal to [1,1,6,1,5,4] arr = [2,8,9,1,7], after wiggle sort arr will become equal to [8,2,9,1,7]</p>
-<div class="fragment"><div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * \addtogroup sorting Sorting Algorithms</span></div>
-<div class="line"><span class="comment"> * @{</span></div>
-<div class="line"><span class="comment"> * \file</span></div>
-<div class="line"><span class="comment"> * \brief [Wiggle Sort Algorithm]</span></div>
-<div class="line"><span class="comment"> * (https://leetcode.com/problems/wiggle-sort-ii/) Implementation</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * \author [Roshan Kanwar](http://github.com/roshan0708)</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * \details</span></div>
-<div class="line"><span class="comment"> * Wiggle Sort sorts the array into a wave like array.</span></div>
-<div class="line"><span class="comment"> * An array ‘arr[0..n-1]’ is sorted in wave form,</span></div>
-<div class="line"><span class="comment"> * if arr[0] &gt;= arr[1] &lt;= arr[2] &gt;= arr[3] &lt;= arr[4] &gt;= …..</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * \example</span></div>
-<div class="line"><span class="comment"> * arr = [1,1,5,6,1,4], after wiggle sort arr will become equal to [1,1,6,1,5,4]</span></div>
-<div class="line"><span class="comment"> * arr = [2,8,9,1,7], after wiggle sort arr will become equal to [8,2,9,1,7]</span></div>
-<div class="line"><span class="comment"> */</span></div>
-<div class="line"> </div>
+<div class="fragment"><div class="line"> </div>
 <div class="line"><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
 <div class="line"><span class="preprocessor">#include &lt;cassert&gt;</span></div>
 <div class="line"><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
 <div class="line"><span class="preprocessor">#include &lt;ctime&gt;</span></div>
-<div class="line"><span class="preprocessor">#include &lt;iostream&gt;</span>  <span class="comment">/// for io operations</span></div>
+<div class="line"><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
 <div class="line"><span class="preprocessor">#include &lt;vector&gt;</span></div>
-<div class="line"><span class="comment"></span> </div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @namespace sorting</span></div>
-<div class="line"><span class="comment"> * @brief Sorting algorithms</span></div>
-<div class="line"><span class="comment"> */</span></div>
-<div class="line"><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {<span class="comment"></span></div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @namespace wiggle_sort</span></div>
-<div class="line"><span class="comment"> * @brief Functions for [Wiggle</span></div>
-<div class="line"><span class="comment"> * Sort](https://leetcode.com/problems/wiggle-sort-ii/) algorithm</span></div>
-<div class="line"><span class="comment"> */</span></div>
+<div class="line"> </div>
+<div class="line"><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
 <div class="line"><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/d52/namespacewiggle__sort.html">wiggle_sort</a> {</div>
-<div class="line"><span class="comment"></span> </div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * @brief Function used for sorting the elements in wave form.</span></div>
-<div class="line"><span class="comment"> * @details</span></div>
-<div class="line"><span class="comment"> * Checking whether the even indexed elements are greater than</span></div>
-<div class="line"><span class="comment"> * their adjacent odd elements.</span></div>
-<div class="line"><span class="comment"> * Traversing all even indexed elements of the input arr.</span></div>
-<div class="line"><span class="comment"> * If current element is smaller than the previous odd element, swap them.</span></div>
-<div class="line"><span class="comment"> * If current element is smaller than the next odd element, swap them.</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * @param arr input array (unsorted elements)</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> */</span></div>
+<div class="line"> </div>
 <div class="line"><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;  <span class="comment">// this allows to have vectors of ints, double, float,</span></div>
 <div class="line">                       <span class="comment">// etc</span></div>
-<div class="line"><a id="_a0" name="_a0"></a><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> <a id="a1" name="a1"></a>wiggleSort(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> &amp;arr) {</div>
-<div class="line">    uint32_t size = arr.<a id="a2" name="a2"></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">std::vector&lt;T&gt; <a id="a0" name="a0"></a>wiggleSort(<span class="keyword">const</span> std::vector&lt;T&gt; &amp;arr) {</div>
+<div class="line">    uint32_t size = arr.size();</div>
 <div class="line"> </div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> out(</div>
+<div class="line">    std::vector&lt;T&gt; out(</div>
 <div class="line">        arr);  <span class="comment">// create a copy of input vector. this way, the original input</span></div>
 <div class="line">               <span class="comment">// vector does not get modified. a sorted array is is returned.</span></div>
 <div class="line"> </div>
 <div class="line">    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i += 2) {</div>
 <div class="line">        <span class="keywordflow">if</span> (i &gt; 0 &amp;&amp; out[i - 1] &gt; out[i]) {</div>
-<div class="line">            <a id="a3" name="a3"></a><a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(out[i], out[i - 1]);  <span class="comment">// swapping the two values</span></div>
+<div class="line">            std::swap(out[i], out[i - 1]);  <span class="comment">// swapping the two values</span></div>
 <div class="line">        }</div>
 <div class="line"> </div>
 <div class="line">        <span class="keywordflow">if</span> (i &lt; size - 1 &amp;&amp; out[i] &lt; out[i + 1]) {</div>
-<div class="line">            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(out[i], out[i + 1]);  <span class="comment">// swapping the two values</span></div>
+<div class="line">            std::swap(out[i], out[i + 1]);  <span class="comment">// swapping the two values</span></div>
 <div class="line">        }</div>
 <div class="line">    }</div>
 <div class="line"> </div>
@@ -182,47 +159,34 @@ $(function(){initNavTree('dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plu
 <div class="line">}</div>
 <div class="line">}  <span class="comment">// namespace wiggle_sort</span></div>
 <div class="line">}  <span class="comment">// namespace sorting</span></div>
-<div class="line"><span class="comment"></span> </div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * @brief Utility function used for printing the elements.</span></div>
-<div class="line"><span class="comment"> * Prints elements of the array after they&#39;re sorted using wiggle sort</span></div>
-<div class="line"><span class="comment"> * algorithm.</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * @param arr array containing the sorted elements</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> */</span></div>
+<div class="line"> </div>
 <div class="line"><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
-<div class="line"><span class="keyword">static</span> <span class="keywordtype">void</span> <a id="a4" name="a4"></a><a class="code hl_function" href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a>(<span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> &amp;arr) {</div>
-<div class="line">    uint32_t size = 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="keyword">static</span> <span class="keywordtype">void</span> <a id="a1" name="a1"></a><a class="code hl_function" href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a>(<span class="keyword">const</span> std::vector&lt;T&gt; &amp;arr) {</div>
+<div class="line">    uint32_t size = arr.size();</div>
 <div class="line"> </div>
-<div class="line">    <a id="_a5" name="_a5"></a><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Sorted elements are as follows: &quot;</span>;</div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;Sorted elements are as follows: &quot;</span>;</div>
 <div class="line"> </div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;[&quot;</span>;</div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;[&quot;</span>;</div>
 <div class="line"> </div>
 <div class="line">    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
-<div class="line">        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; arr[i];</div>
+<div class="line">        std::cout &lt;&lt; arr[i];</div>
 <div class="line">        <span class="keywordflow">if</span> (i != size - 1) {</div>
-<div class="line">            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
+<div class="line">            std::cout &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
 <div class="line">        }</div>
 <div class="line">    }</div>
 <div class="line"> </div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;]&quot;</span> &lt;&lt; <a id="a6" name="a6"></a><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">    std::cout &lt;&lt; <span class="stringliteral">&quot;]&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line">}</div>
-<div class="line"><span class="comment"></span> </div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * Test function</span></div>
-<div class="line"><span class="comment"> * @returns void</span></div>
-<div class="line"><span class="comment"> */</span></div>
-<div class="line"><span class="keyword">static</span> <span class="keywordtype">void</span> <a id="a7" name="a7"></a><a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
-<div class="line">    <a id="a8" name="a8"></a><a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a id="a9" name="a9"></a><a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>));  <span class="comment">// initialize random number generator</span></div>
 <div class="line"> </div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> data1(100);</div>
+<div class="line"><span class="keyword">static</span> <span class="keywordtype">void</span> <a id="a2" name="a2"></a><a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line">    std::srand(std::time(<span class="keyword">nullptr</span>));  <span class="comment">// initialize random number generator</span></div>
+<div class="line"> </div>
+<div class="line">    std::vector&lt;float&gt; data1(100);</div>
 <div class="line">    <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;d : data1) {  <span class="comment">// generate random numbers between -5.0 and 4.99</span></div>
-<div class="line">        d = float(<a id="a10" name="a10"></a><a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 1000 - 500) / 100.f;</div>
+<div class="line">        d = float(std::rand() % 1000 - 500) / 100.f;</div>
 <div class="line">    }</div>
 <div class="line"> </div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> sorted = sorting::wiggle_sort::wiggleSort&lt;float&gt;(data1);</div>
+<div class="line">    std::vector&lt;float&gt; sorted = sorting::wiggle_sort::wiggleSort&lt;float&gt;(data1);</div>
 <div class="line"> </div>
 <div class="line">    <a class="code hl_function" href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a>(sorted);</div>
 <div class="line"> </div>
@@ -231,29 +195,19 @@ $(function(){initNavTree('dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plu
 <div class="line">               data1[j + 1] &gt;= data1[j + 2]);  <span class="comment">// check the validation condition</span></div>
 <div class="line">    }</div>
 <div class="line"> </div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 passed\n&quot;</span>;</div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 passed\n&quot;</span>;</div>
 <div class="line">}</div>
-<div class="line"><span class="comment"></span> </div>
-<div class="line"><span class="comment">/** Driver Code */</span></div>
-<div class="line"><span class="keywordtype">int</span> <a id="a11" name="a11"></a><a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"> </div>
+<div class="line"><span class="keywordtype">int</span> <a id="a3" name="a3"></a><a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
 <div class="line">    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
 <div class="line">    <span class="keywordflow">return</span> 0;</div>
 <div class="line">}</div>
-<div class="line"><span class="comment"></span> </div>
-<div class="line"><span class="comment">/** @} */</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="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="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> generate_parentheses.cpp:82</div></div>
-<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> generate_parentheses.cpp:110</div></div>
-<div class="ttc" id="agroup__sorting_html_ga135e4c638e3bcf548bd122b5f49a3e72"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a></div><div class="ttdeci">static void displayElements(const std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Utility function used for printing the elements. Prints elements of the array after they're sorted us...</div><div class="ttdef"><b>Definition</b> wiggle_sort.cpp:86</div></div>
+<div class="line"> </div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00082">generate_parentheses.cpp:82</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="agroup__sorting_html_ga135e4c638e3bcf548bd122b5f49a3e72"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a></div><div class="ttdeci">static void displayElements(const std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Utility function used for printing the elements. Prints elements of the array after they're sorted us...</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dcc/wiggle__sort_8cpp_source.html#l00086">wiggle_sort.cpp:86</a></div></div>
 <div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
 <div class="ttc" id="anamespacewiggle__sort_html"><div class="ttname"><a href="../../d0/d52/namespacewiggle__sort.html">wiggle_sort</a></div><div class="ttdoc">Functions for Wiggle Sort algorithm.</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-<div class="ttc" id="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="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
 </div><!-- fragment --> </div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/dd/db6/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix-members.html b/dd/db6/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix-members.html
index 66a7e53bf..c01da11e0 100644
--- a/dd/db6/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix-members.html
+++ b/dd/db6/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dd/db6/structbinary__search__tree_1_1bst__node.html b/dd/db6/structbinary__search__tree_1_1bst__node.html
index e6baae590..14a5b7e81 100644
--- a/dd/db6/structbinary__search__tree_1_1bst__node.html
+++ b/dd/db6/structbinary__search__tree_1_1bst__node.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: binary_search_tree&lt; T &gt;::bst_node Struct Reference</title>
+<title>TheAlgorithms/C++: binary_search_tree&lt; T &gt;::bst_node Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -129,14 +146,16 @@ Public Member Functions</h2></td></tr>
 Public Attributes</h2></td></tr>
 <tr class="memitem:a09da9e5b801ede4764bc812975ff7f29" id="r_a09da9e5b801ede4764bc812975ff7f29"><td class="memItemLeft" align="right" valign="top">T&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a09da9e5b801ede4764bc812975ff7f29">value</a></td></tr>
 <tr class="separator:a09da9e5b801ede4764bc812975ff7f29"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a55c165b9e0e5b50a23104e0604dcc788" id="r_a55c165b9e0e5b50a23104e0604dcc788"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a55c165b9e0e5b50a23104e0604dcc788">left</a></td></tr>
+<tr class="memitem:a55c165b9e0e5b50a23104e0604dcc788" id="r_a55c165b9e0e5b50a23104e0604dcc788"><td class="memItemLeft" align="right" valign="top">std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a55c165b9e0e5b50a23104e0604dcc788">left</a></td></tr>
 <tr class="separator:a55c165b9e0e5b50a23104e0604dcc788"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a05f3a7aa6c31622f855ce4b5a95e91df" id="r_a05f3a7aa6c31622f855ce4b5a95e91df"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a05f3a7aa6c31622f855ce4b5a95e91df">right</a></td></tr>
+<tr class="memitem:a05f3a7aa6c31622f855ce4b5a95e91df" id="r_a05f3a7aa6c31622f855ce4b5a95e91df"><td class="memItemLeft" align="right" valign="top">std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a05f3a7aa6c31622f855ce4b5a95e91df">right</a></td></tr>
 <tr class="separator:a05f3a7aa6c31622f855ce4b5a95e91df"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><div class="compoundTemplParams">template&lt;class T&gt;<br />
 struct binary_search_tree&lt; T &gt;::bst_node</div><p>A struct to represent a node in the Binary Search Tree. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00025">25</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a51dd9bd6dd32bce3b74dd64557306778" name="a51dd9bd6dd32bce3b74dd64557306778"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a51dd9bd6dd32bce3b74dd64557306778">&#9670;&#160;</a></span>bst_node()</h2>
@@ -168,13 +187,15 @@ template&lt;class T &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   35</span>                                    {</div>
 <div class="line"><span class="lineno">   36</span>            <a class="code hl_variable" href="#a09da9e5b801ede4764bc812975ff7f29">value</a> = _value;</div>
 <div class="line"><span class="lineno">   37</span>            left = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">   38</span>            <a class="code hl_variable" href="#a05f3a7aa6c31622f855ce4b5a95e91df">right</a> = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">   39</span>        }</div>
-<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a05f3a7aa6c31622f855ce4b5a95e91df"><div class="ttname"><a href="#a05f3a7aa6c31622f855ce4b5a95e91df">binary_search_tree::bst_node::right</a></div><div class="ttdeci">std::unique_ptr&lt; bst_node &gt; right</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:28</div></div>
-<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a09da9e5b801ede4764bc812975ff7f29"><div class="ttname"><a href="#a09da9e5b801ede4764bc812975ff7f29">binary_search_tree::bst_node::value</a></div><div class="ttdeci">T value</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:26</div></div>
+<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a05f3a7aa6c31622f855ce4b5a95e91df"><div class="ttname"><a href="#a05f3a7aa6c31622f855ce4b5a95e91df">binary_search_tree::bst_node::right</a></div><div class="ttdeci">std::unique_ptr&lt; bst_node &gt; right</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00028">binary_search_tree2.cpp:28</a></div></div>
+<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a09da9e5b801ede4764bc812975ff7f29"><div class="ttname"><a href="#a09da9e5b801ede4764bc812975ff7f29">binary_search_tree::bst_node::value</a></div><div class="ttdeci">T value</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00026">binary_search_tree2.cpp:26</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -188,12 +209,14 @@ template&lt;class T &gt; </div>
 template&lt;class T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt;<a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a>&gt; <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::bst_node::left</td>
+          <td class="memname">std::unique_ptr&lt;<a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a>&gt; <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::bst_node::left</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>Pointer to left subtree. </p>
 
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00027">27</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
+
 </div>
 </div>
 <a id="a05f3a7aa6c31622f855ce4b5a95e91df" name="a05f3a7aa6c31622f855ce4b5a95e91df"></a>
@@ -205,12 +228,14 @@ template&lt;class T &gt; </div>
 template&lt;class T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt;<a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a>&gt; <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::bst_node::right</td>
+          <td class="memname">std::unique_ptr&lt;<a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a>&gt; <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::bst_node::right</td>
         </tr>
       </table>
 </div><div class="memdoc">
 <p>Pointer to right subtree. </p>
 
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
+
 </div>
 </div>
 <a id="a09da9e5b801ede4764bc812975ff7f29" name="a09da9e5b801ede4764bc812975ff7f29"></a>
@@ -228,10 +253,12 @@ template&lt;class T &gt; </div>
 </div><div class="memdoc">
 <p>The value/key of the node. </p>
 
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00026">26</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../df/d42/binary__search__tree2_8cpp.html">binary_search_tree2.cpp</a></li>
+<li>data_structures/<a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dd/dba/namespacedivide__and__conquer.html b/dd/dba/namespacedivide__and__conquer.html
index b1260a005..818836515 100644
--- a/dd/dba/namespacedivide__and__conquer.html
+++ b/dd/dba/namespacedivide__and__conquer.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: divide_and_conquer Namespace Reference</title>
+<title>TheAlgorithms/C++: divide_and_conquer Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -108,15 +125,15 @@ $(function(){initNavTree('dd/dba/namespacedivide__and__conquer.html','../../');
 </div><!--header-->
 <div class="contents">
 
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>  
+<p>for std::vector  
 <a href="#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>
+<div class="textblock"><p>for std::vector </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>
+<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AshishYUO" target="_blank">AshishYUO</a> For assert operation For std::chrono; time measurement For I/O operations For std::tuple For creating dynamic arrays</dd></dl>
 <p>Divide and Conquer algorithms </p>
 </div></div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dd/dbb/struct_test_case-members.html b/dd/dbb/struct_test_case-members.html
index 0a667e6d5..43dfa868d 100644
--- a/dd/dbb/struct_test_case-members.html
+++ b/dd/dbb/struct_test_case-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dd/dc3/is__graph__bipartite2_8cpp_source.html b/dd/dc3/is__graph__bipartite2_8cpp_source.html
new file mode 100644
index 000000000..f9e99d550
--- /dev/null
+++ b/dd/dc3/is__graph__bipartite2_8cpp_source.html
@@ -0,0 +1,214 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/is_graph_bipartite2.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dd/dc3/is__graph__bipartite2_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">is_graph_bipartite2.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;queue&gt;</span>     </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> {</div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="}">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../df/dce/namespacegraph.html#a8e1b547cd407c0774e63f0dc95cda9e7">   37</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../df/dce/namespacegraph.html#a8e1b547cd407c0774e63f0dc95cda9e7">checkBipartite</a>(<span class="keyword">const</span> std::vector&lt;std::vector&lt;int64_t&gt;&gt; &amp;<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>,</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>                    int64_t index, std::vector&lt;int64_t&gt; *visited) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    std::queue&lt;int64_t&gt; q;  </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    q.push(index);          </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    (*visited)[index] = 1;  </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">while</span> (q.size()) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        int64_t u = q.front();</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        q.pop();</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[u].size(); i++) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            int64_t v =</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>                <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[u][i];     </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            <span class="keywordflow">if</span> (!(*visited)[v])  </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>            {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>                (*visited)[v] =</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>                    ((*visited)[u] == 1)</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>                        ? -1</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>                        : 1;  </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>                q.push(v);    </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((*visited)[v] ==</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>                       (*visited)[u])  </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;  </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00076" data-start="{" data-end="}">
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"><a class="line" href="../../df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b">   76</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b">isBipartite</a>(<span class="keyword">const</span> std::vector&lt;std::vector&lt;int64_t&gt;&gt; &amp;<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    std::vector&lt;int64_t&gt; visited(</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.size());  </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.size(); i++) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordflow">if</span> (!visited[i])  </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../df/dce/namespacegraph.html#a8e1b547cd407c0774e63f0dc95cda9e7">checkBipartite</a>(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, i, &amp;visited)) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>            }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    }</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>}</div>
+</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>}  <span class="comment">// namespace graph</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    std::vector&lt;std::vector&lt;int64_t&gt;&gt; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> = {{1, 3}, {0, 2}, {1, 3}, {0, 2}};</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    assert(<a class="code hl_function" href="../../df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b">graph::isBipartite</a>(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>) ==</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>           <span class="keyword">true</span>);  </div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    std::vector&lt;std::vector&lt;int64_t&gt;&gt; graph_not_bipartite = {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        {1, 2, 3}, {0, 2}, {0, 1, 3}, {0, 2}};</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    assert(<a class="code hl_function" href="../../df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b">graph::isBipartite</a>(graph_not_bipartite) ==</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>           <span class="keyword">false</span>);  </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>}</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>}</div>
+<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00100">caesar_cipher.cpp:100</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></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 class="ttc" id="anamespacegraph_html_a84b0551489c613a681cc83b34450da4b"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b">graph::isBipartite</a></div><div class="ttdeci">bool isBipartite(const std::vector&lt; std::vector&lt; int64_t &gt; &gt; &amp;graph)</div><div class="ttdoc">returns true if the given graph is bipartite else returns false</div><div class="ttdef"><b>Definition</b> <a href="#l00076">is_graph_bipartite2.cpp:76</a></div></div>
+<div class="ttc" id="anamespacegraph_html_a8e1b547cd407c0774e63f0dc95cda9e7"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a8e1b547cd407c0774e63f0dc95cda9e7">graph::checkBipartite</a></div><div class="ttdeci">bool checkBipartite(const std::vector&lt; std::vector&lt; int64_t &gt; &gt; &amp;graph, int64_t index, std::vector&lt; int64_t &gt; *visited)</div><div class="ttdoc">function to check whether the passed graph is bipartite or not</div><div class="ttdef"><b>Definition</b> <a href="#l00037">is_graph_bipartite2.cpp:37</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><b>is_graph_bipartite2.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dd/dca/class_f_c_f_s.html b/dd/dca/class_f_c_f_s.html
index 2569195dc..4b350ef16 100644
--- a/dd/dca/class_f_c_f_s.html
+++ b/dd/dca/class_f_c_f_s.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: FCFS&lt; S, T, E &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: FCFS&lt; S, T, E &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -114,18 +131,13 @@ $(function(){initNavTree('dd/dca/class_f_c_f_s.html','../../'); initResizable(tr
 
 <p>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.  
  <a href="#details">More...</a></p>
-<div class="dynheader">
-Collaboration diagram for FCFS&lt; S, T, E &gt;:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dbb/class_f_c_f_s__coll__graph.svg" width="603" height="242"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:a8fbfe4d85f7576b4a7aade07d29fbd69" id="r_a8fbfe4d85f7576b4a7aade07d29fbd69"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8fbfe4d85f7576b4a7aade07d29fbd69">addProcess</a> (S id, T arrival, E burst)</td></tr>
 <tr class="memdesc:a8fbfe4d85f7576b4a7aade07d29fbd69"><td class="mdescLeft">&#160;</td><td class="mdescRight">Adds the process to the ready queue if it isn't already there.  <br /></td></tr>
 <tr class="separator:a8fbfe4d85f7576b4a7aade07d29fbd69"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aa25dbe30ba9930b5a7c1a6d11758bd91" id="r_aa25dbe30ba9930b5a7c1a6d11758bd91"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a>&lt; S, T, E, double, double, double &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa25dbe30ba9930b5a7c1a6d11758bd91">scheduleForFcfs</a> ()</td></tr>
+<tr class="memitem:aa25dbe30ba9930b5a7c1a6d11758bd91" id="r_aa25dbe30ba9930b5a7c1a6d11758bd91"><td class="memItemLeft" align="right" valign="top">vector&lt; tuple&lt; S, T, E, double, double, double &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa25dbe30ba9930b5a7c1a6d11758bd91">scheduleForFcfs</a> ()</td></tr>
 <tr class="memdesc:aa25dbe30ba9930b5a7c1a6d11758bd91"><td class="mdescLeft">&#160;</td><td class="mdescRight">Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algorithm.  <br /></td></tr>
 <tr class="separator:aa25dbe30ba9930b5a7c1a6d11758bd91"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:abb361a612b18bb189aa6d3c49288b793" id="r_abb361a612b18bb189aa6d3c49288b793"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abb361a612b18bb189aa6d3c49288b793">printResult</a> ()</td></tr>
@@ -134,13 +146,11 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:af2594e22a867b308e027623940193d46" id="r_af2594e22a867b308e027623940193d46"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">priority_queue</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a>&lt; S, T, E, double, double, double &gt;, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a>&lt; S, T, E, double, double, double &gt; &gt;, <a class="el" href="../../de/d4a/class_compare.html">Compare</a>&lt; S, T, E &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af2594e22a867b308e027623940193d46">schedule</a></td></tr>
+<tr class="memitem:af2594e22a867b308e027623940193d46" id="r_af2594e22a867b308e027623940193d46"><td class="memItemLeft" align="right" valign="top">priority_queue&lt; tuple&lt; S, T, E, double, double, double &gt;, vector&lt; tuple&lt; S, T, E, double, double, double &gt; &gt;, <a class="el" href="../../de/d4a/class_compare.html">Compare</a>&lt; S, T, E &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af2594e22a867b308e027623940193d46">schedule</a></td></tr>
 <tr class="separator:af2594e22a867b308e027623940193d46"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ac3abd3d9f23437599ff9a2131c8b631f" id="r_ac3abd3d9f23437599ff9a2131c8b631f"><td class="memItemLeft" align="right" valign="top"><a id="ac3abd3d9f23437599ff9a2131c8b631f" name="ac3abd3d9f23437599ff9a2131c8b631f"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a>&lt; S, T, E, double, double, double &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>result</b></td></tr>
+<tr class="memitem:ac3abd3d9f23437599ff9a2131c8b631f" id="r_ac3abd3d9f23437599ff9a2131c8b631f"><td class="memItemLeft" align="right" valign="top">vector&lt; tuple&lt; S, T, E, double, double, double &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac3abd3d9f23437599ff9a2131c8b631f">result</a></td></tr>
 <tr class="separator:ac3abd3d9f23437599ff9a2131c8b631f"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a86e9908699e2ff89557c01f1a4b47d83" id="r_a86e9908699e2ff89557c01f1a4b47d83"><td class="memItemLeft" align="right" valign="top"><a id="a86e9908699e2ff89557c01f1a4b47d83" name="a86e9908699e2ff89557c01f1a4b47d83"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_set.html">unordered_set</a>&lt; S &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>idList</b></td></tr>
+<tr class="memitem:a86e9908699e2ff89557c01f1a4b47d83" id="r_a86e9908699e2ff89557c01f1a4b47d83"><td class="memItemLeft" align="right" valign="top">unordered_set&lt; S &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a86e9908699e2ff89557c01f1a4b47d83">idList</a></td></tr>
 <tr class="separator:a86e9908699e2ff89557c01f1a4b47d83"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -154,6 +164,8 @@ class FCFS&lt; S, T, E &gt;</div><p>Class which implements the <a class="el" hre
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00098">98</a> of file <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html">fcfs_scheduling.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="a8fbfe4d85f7576b4a7aade07d29fbd69" name="a8fbfe4d85f7576b4a7aade07d29fbd69"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a8fbfe4d85f7576b4a7aade07d29fbd69">&#9670;&#160;</a></span>addProcess()</h2>
@@ -199,23 +211,19 @@ template&lt;typename S , typename T , typename E &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00130">130</a> of file <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html">fcfs_scheduling.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  130</span>                                              {</div>
 <div class="line"><span class="lineno">  131</span>        <span class="comment">// Add if a process with process ID as id is not found in idList.</span></div>
 <div class="line"><span class="lineno">  132</span>        <span class="keywordflow">if</span> (idList.find(<span class="keywordtype">id</span>) == idList.end()) {</div>
-<div class="line"><span class="lineno">  133</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple&lt;S, T, E, double, double, double&gt;</a> t =</div>
+<div class="line"><span class="lineno">  133</span>            tuple&lt;S, T, E, double, double, double&gt; t =</div>
 <div class="line"><span class="lineno">  134</span>                make_tuple(<span class="keywordtype">id</span>, arrival, burst, 0, 0, 0);</div>
 <div class="line"><span class="lineno">  135</span>            <a class="code hl_variable" href="#af2594e22a867b308e027623940193d46">schedule</a>.push(t);</div>
 <div class="line"><span class="lineno">  136</span>            idList.insert(<span class="keywordtype">id</span>);</div>
 <div class="line"><span class="lineno">  137</span>        }</div>
 <div class="line"><span class="lineno">  138</span>    }</div>
-<div class="ttc" id="aclass_f_c_f_s_html_af2594e22a867b308e027623940193d46"><div class="ttname"><a href="#af2594e22a867b308e027623940193d46">FCFS::schedule</a></div><div class="ttdeci">priority_queue&lt; tuple&lt; S, T, E, double, double, double &gt;, vector&lt; tuple&lt; S, T, E, double, double, double &gt; &gt;, Compare&lt; S, T, E &gt; &gt; schedule</div><div class="ttdef"><b>Definition</b> fcfs_scheduling.cpp:112</div></div>
-<div class="ttc" id="atuple_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/tuple.html">std::tuple</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/dca/class_f_c_f_s_a8fbfe4d85f7576b4a7aade07d29fbd69_cgraph.svg" width="351" height="167"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclass_f_c_f_s_html_af2594e22a867b308e027623940193d46"><div class="ttname"><a href="#af2594e22a867b308e027623940193d46">FCFS::schedule</a></div><div class="ttdeci">priority_queue&lt; tuple&lt; S, T, E, double, double, double &gt;, vector&lt; tuple&lt; S, T, E, double, double, double &gt; &gt;, Compare&lt; S, T, E &gt; &gt; schedule</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00112">fcfs_scheduling.cpp:112</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abb361a612b18bb189aa6d3c49288b793" name="abb361a612b18bb189aa6d3c49288b793"></a>
@@ -245,37 +253,30 @@ template&lt;typename S , typename T , typename E &gt; </div>
 
 <p>Utility function for printing the status of each process after execution. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00192">192</a> of file <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html">fcfs_scheduling.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  192</span>                       {</div>
-<div class="line"><span class="lineno">  193</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;Status of all the proceses post completion is as follows:&quot;</span></div>
+<div class="line"><span class="lineno">  193</span>        cout &lt;&lt; <span class="stringliteral">&quot;Status of all the proceses post completion is as follows:&quot;</span></div>
 <div class="line"><span class="lineno">  194</span>             &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">  195</span> </div>
-<div class="line"><span class="lineno">  196</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(17) &lt;&lt; left &lt;&lt; <span class="stringliteral">&quot;Process ID&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(17) &lt;&lt; left</div>
-<div class="line"><span class="lineno">  197</span>             &lt;&lt; <span class="stringliteral">&quot;Arrival Time&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(17) &lt;&lt; left &lt;&lt; <span class="stringliteral">&quot;Burst Time&quot;</span></div>
-<div class="line"><span class="lineno">  198</span>             &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(17) &lt;&lt; left &lt;&lt; <span class="stringliteral">&quot;Completion Time&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(17)</div>
-<div class="line"><span class="lineno">  199</span>             &lt;&lt; left &lt;&lt; <span class="stringliteral">&quot;Turnaround Time&quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(17) &lt;&lt; left</div>
+<div class="line"><span class="lineno">  196</span>        cout &lt;&lt; std::setw(17) &lt;&lt; left &lt;&lt; <span class="stringliteral">&quot;Process ID&quot;</span> &lt;&lt; std::setw(17) &lt;&lt; left</div>
+<div class="line"><span class="lineno">  197</span>             &lt;&lt; <span class="stringliteral">&quot;Arrival Time&quot;</span> &lt;&lt; std::setw(17) &lt;&lt; left &lt;&lt; <span class="stringliteral">&quot;Burst Time&quot;</span></div>
+<div class="line"><span class="lineno">  198</span>             &lt;&lt; std::setw(17) &lt;&lt; left &lt;&lt; <span class="stringliteral">&quot;Completion Time&quot;</span> &lt;&lt; std::setw(17)</div>
+<div class="line"><span class="lineno">  199</span>             &lt;&lt; left &lt;&lt; <span class="stringliteral">&quot;Turnaround Time&quot;</span> &lt;&lt; std::setw(17) &lt;&lt; left</div>
 <div class="line"><span class="lineno">  200</span>             &lt;&lt; <span class="stringliteral">&quot;Waiting Time&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">  201</span> </div>
 <div class="line"><span class="lineno">  202</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i{}; i &lt; result.size(); i++) {</div>
-<div class="line"><span class="lineno">  203</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setprecision.html">std::setprecision</a>(2) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/fixed.html">std::fixed</a> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(17) &lt;&lt; left</div>
-<div class="line"><span class="lineno">  204</span>                 &lt;&lt; get&lt;0&gt;(result[i]) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(17) &lt;&lt; left</div>
-<div class="line"><span class="lineno">  205</span>                 &lt;&lt; get&lt;1&gt;(result[i]) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(17) &lt;&lt; left</div>
-<div class="line"><span class="lineno">  206</span>                 &lt;&lt; get&lt;2&gt;(result[i]) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(17) &lt;&lt; left</div>
-<div class="line"><span class="lineno">  207</span>                 &lt;&lt; get&lt;3&gt;(result[i]) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(17) &lt;&lt; left</div>
-<div class="line"><span class="lineno">  208</span>                 &lt;&lt; get&lt;4&gt;(result[i]) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a>(17) &lt;&lt; left</div>
+<div class="line"><span class="lineno">  203</span>            cout &lt;&lt; std::setprecision(2) &lt;&lt; std::fixed &lt;&lt; std::setw(17) &lt;&lt; left</div>
+<div class="line"><span class="lineno">  204</span>                 &lt;&lt; get&lt;0&gt;(result[i]) &lt;&lt; std::setw(17) &lt;&lt; left</div>
+<div class="line"><span class="lineno">  205</span>                 &lt;&lt; get&lt;1&gt;(result[i]) &lt;&lt; std::setw(17) &lt;&lt; left</div>
+<div class="line"><span class="lineno">  206</span>                 &lt;&lt; get&lt;2&gt;(result[i]) &lt;&lt; std::setw(17) &lt;&lt; left</div>
+<div class="line"><span class="lineno">  207</span>                 &lt;&lt; get&lt;3&gt;(result[i]) &lt;&lt; std::setw(17) &lt;&lt; left</div>
+<div class="line"><span class="lineno">  208</span>                 &lt;&lt; get&lt;4&gt;(result[i]) &lt;&lt; std::setw(17) &lt;&lt; left</div>
 <div class="line"><span class="lineno">  209</span>                 &lt;&lt; get&lt;5&gt;(result[i]) &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">  210</span>        }</div>
 <div class="line"><span class="lineno">  211</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="afixed_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/fixed.html">std::fixed</a></div><div class="ttdeci">T fixed(T... args)</div></div>
-<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> matrix_exponentiation.cpp:36</div></div>
-<div class="ttc" id="asetprecision_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setprecision.html">std::setprecision</a></div><div class="ttdeci">T setprecision(T... args)</div></div>
-<div class="ttc" id="asetw_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a></div><div class="ttdeci">T setw(T... args)</div></div>
-</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="../../dd/dca/class_f_c_f_s_abb361a612b18bb189aa6d3c49288b793_cgraph.svg" width="304" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa25dbe30ba9930b5a7c1a6d11758bd91" name="aa25dbe30ba9930b5a7c1a6d11758bd91"></a>
@@ -290,7 +291,7 @@ template&lt;typename S , typename T , typename E &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a>&lt; S, T, E, double, double, double &gt; &gt; <a class="el" href="../../dd/dca/class_f_c_f_s.html">FCFS</a>&lt; S, T, E &gt;::scheduleForFcfs </td>
+          <td class="memname">vector&lt; tuple&lt; S, T, E, double, double, double &gt; &gt; <a class="el" href="../../dd/dca/class_f_c_f_s.html">FCFS</a>&lt; S, T, E &gt;::scheduleForFcfs </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td></td>
@@ -307,12 +308,14 @@ template&lt;typename S , typename T , typename E &gt; </div>
 <p><a class="el" href="../../dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> is a non-preemptive algorithm in which the process which arrives first gets executed first. If two or more processes arrive together then the process with smaller process ID runs first (each process has a unique proces ID).</p>
 <p>I used a min priority queue of tuples to accomplish this task. The processes are ordered by their arrival times. If arrival times of some processes are equal, then they are ordered by their process ID.</p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00155">155</a> of file <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html">fcfs_scheduling.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  155</span>                                                                     {</div>
 <div class="line"><span class="lineno">  156</span>        <span class="comment">// Variable to keep track of time elapsed so far</span></div>
 <div class="line"><span class="lineno">  157</span>        <span class="keywordtype">double</span> timeElapsed = 0;</div>
 <div class="line"><span class="lineno">  158</span> </div>
 <div class="line"><span class="lineno">  159</span>        <span class="keywordflow">while</span> (!<a class="code hl_variable" href="#af2594e22a867b308e027623940193d46">schedule</a>.empty()) {</div>
-<div class="line"><span class="lineno">  160</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple&lt;S, T, E, double, double, double&gt;</a> cur = <a class="code hl_variable" href="#af2594e22a867b308e027623940193d46">schedule</a>.top();</div>
+<div class="line"><span class="lineno">  160</span>            tuple&lt;S, T, E, double, double, double&gt; cur = <a class="code hl_variable" href="#af2594e22a867b308e027623940193d46">schedule</a>.top();</div>
 <div class="line"><span class="lineno">  161</span> </div>
 <div class="line"><span class="lineno">  162</span>            <span class="comment">// If the current process arrived at time t2, the last process</span></div>
 <div class="line"><span class="lineno">  163</span>            <span class="comment">// completed its execution at time t1, and t2 &gt; t1.</span></div>
@@ -342,6 +345,58 @@ template&lt;typename S , typename T , typename E &gt; </div>
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
+<a id="a86e9908699e2ff89557c01f1a4b47d83" name="a86e9908699e2ff89557c01f1a4b47d83"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a86e9908699e2ff89557c01f1a4b47d83">&#9670;&#160;</a></span>idList</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename S , typename T , typename E &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">unordered_set&lt;S&gt; <a class="el" href="../../dd/dca/class_f_c_f_s.html">FCFS</a>&lt; S, T, E &gt;::idList</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00119">119</a> of file <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html">fcfs_scheduling.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ac3abd3d9f23437599ff9a2131c8b631f" name="ac3abd3d9f23437599ff9a2131c8b631f"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ac3abd3d9f23437599ff9a2131c8b631f">&#9670;&#160;</a></span>result</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename S , typename T , typename E &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">vector&lt;tuple&lt;S, T, E, double, double, double&gt; &gt; <a class="el" href="../../dd/dca/class_f_c_f_s.html">FCFS</a>&lt; S, T, E &gt;::result</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00115">115</a> of file <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html">fcfs_scheduling.cpp</a>.</p>
+
+</div>
+</div>
 <a id="af2594e22a867b308e027623940193d46" name="af2594e22a867b308e027623940193d46"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#af2594e22a867b308e027623940193d46">&#9670;&#160;</a></span>schedule</h2>
 
@@ -354,7 +409,7 @@ template&lt;typename S , typename T , typename E &gt; </div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">priority_queue</a>&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a>&lt;S, T, E, double, double, double&gt;, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a>&lt;S, T, E, double, double, double&gt; &gt;, <a class="el" href="../../de/d4a/class_compare.html">Compare</a>&lt;S, T, E&gt; &gt; <a class="el" href="../../dd/dca/class_f_c_f_s.html">FCFS</a>&lt; S, T, E &gt;::schedule</td>
+          <td class="memname">priority_queue&lt;tuple&lt;S, T, E, double, double, double&gt;, vector&lt;tuple&lt;S, T, E, double, double, double&gt; &gt;, <a class="el" href="../../de/d4a/class_compare.html">Compare</a>&lt;S, T, E&gt; &gt; <a class="el" href="../../dd/dca/class_f_c_f_s.html">FCFS</a>&lt; S, T, E &gt;::schedule</td>
         </tr>
       </table>
   </td>
@@ -365,10 +420,12 @@ template&lt;typename S , typename T , typename E &gt; </div>
 </div><div class="memdoc">
 <p>Priority queue of schedules(stored as tuples) of processes. In each tuple 1st element: Process ID 2nd element: Arrival Time 3rd element: Burst time 4th element: Completion time 5th element: Turnaround time 6th element: Waiting time </p>
 
+<p class="definition">Definition at line <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00112">112</a> of file <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html">fcfs_scheduling.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>cpu_scheduling_algorithms/<a class="el" href="../../df/d47/fcfs__scheduling_8cpp.html">fcfs_scheduling.cpp</a></li>
+<li>cpu_scheduling_algorithms/<a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html">fcfs_scheduling.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dd/dca/class_f_c_f_s_a8fbfe4d85f7576b4a7aade07d29fbd69_cgraph.map b/dd/dca/class_f_c_f_s_a8fbfe4d85f7576b4a7aade07d29fbd69_cgraph.map
deleted file mode 100644
index 41a6cb535..000000000
--- a/dd/dca/class_f_c_f_s_a8fbfe4d85f7576b4a7aade07d29fbd69_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="FCFS::addProcess" name="FCFS::addProcess">
-<area shape="rect" id="Node000001" title="Adds the process to the ready queue if it isn&#39;t already there." alt="" coords="5,63,139,88"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/end.html#" title=" " alt="" coords="187,5,345,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="117,60,205,33,206,38,119,65"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/find.html#" title=" " alt="" coords="201,55,330,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="139,73,185,73,185,78,139,78"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/insert.html#" title=" " alt="" coords="201,120,330,161"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="113,86,190,112,188,118,112,91"/>
-</map>
diff --git a/dd/dca/class_f_c_f_s_a8fbfe4d85f7576b4a7aade07d29fbd69_cgraph.md5 b/dd/dca/class_f_c_f_s_a8fbfe4d85f7576b4a7aade07d29fbd69_cgraph.md5
deleted file mode 100644
index d4cc03080..000000000
--- a/dd/dca/class_f_c_f_s_a8fbfe4d85f7576b4a7aade07d29fbd69_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1bf1d0fac09ad334d89d9e3ef795c0b4
\ No newline at end of file
diff --git a/dd/dca/class_f_c_f_s_a8fbfe4d85f7576b4a7aade07d29fbd69_cgraph.svg b/dd/dca/class_f_c_f_s_a8fbfe4d85f7576b4a7aade07d29fbd69_cgraph.svg
deleted file mode 100644
index 0f69b1bd3..000000000
--- a/dd/dca/class_f_c_f_s_a8fbfe4d85f7576b4a7aade07d29fbd69_cgraph.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: FCFS::addProcess Pages: 1 -->
-<svg width="263pt" height="125pt"
- viewBox="0.00 0.00 262.75 124.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 120.88)">
-<title>FCFS::addProcess</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Adds the process to the ready queue if it isn&#39;t already there.">
-<polygon fill="#999999" stroke="#666666" points="100,-73.88 0,-73.88 0,-54.62 100,-54.62 100,-73.88"/>
-<text text-anchor="middle" x="50" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::addProcess</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-116.88 136,-116.88 136,-97.62 254.75,-97.62 254.75,-116.88"/>
-<text text-anchor="middle" x="195.38" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.62,-74.33C104.12,-80.18 128.92,-87.62 150.01,-93.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.94,-97.28 159.52,-96.8 150.95,-90.57 148.94,-97.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.88,-79.5 146.88,-79.5 146.88,-49 243.88,-49 243.88,-79.5"/>
-<text text-anchor="start" x="154.88" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="195.38" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.34,-64.25C111.52,-64.25 123.5,-64.25 135.05,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.88,-67.75 144.88,-64.25 134.88,-60.75 134.88,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.88,-30.5 146.88,-30.5 146.88,0 243.88,0 243.88,-30.5"/>
-<text text-anchor="start" x="154.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="195.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.36,-54.22C96.88,-48.57 118.07,-41.33 137.7,-34.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.63,-38 146.97,-31.45 136.37,-31.37 138.63,-38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/dca/class_f_c_f_s_a8fbfe4d85f7576b4a7aade07d29fbd69_cgraph_org.svg b/dd/dca/class_f_c_f_s_a8fbfe4d85f7576b4a7aade07d29fbd69_cgraph_org.svg
deleted file mode 100644
index 1fddf68d9..000000000
--- a/dd/dca/class_f_c_f_s_a8fbfe4d85f7576b4a7aade07d29fbd69_cgraph_org.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: FCFS::addProcess Pages: 1 -->
-<svg width="263pt" height="125pt"
- viewBox="0.00 0.00 262.75 124.88" 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 120.88)">
-<title>FCFS::addProcess</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Adds the process to the ready queue if it isn&#39;t already there.">
-<polygon fill="#999999" stroke="#666666" points="100,-73.88 0,-73.88 0,-54.62 100,-54.62 100,-73.88"/>
-<text text-anchor="middle" x="50" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::addProcess</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.75,-116.88 136,-116.88 136,-97.62 254.75,-97.62 254.75,-116.88"/>
-<text text-anchor="middle" x="195.38" y="-103.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.62,-74.33C104.12,-80.18 128.92,-87.62 150.01,-93.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.94,-97.28 159.52,-96.8 150.95,-90.57 148.94,-97.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.88,-79.5 146.88,-79.5 146.88,-49 243.88,-49 243.88,-79.5"/>
-<text text-anchor="start" x="154.88" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="195.38" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M100.34,-64.25C111.52,-64.25 123.5,-64.25 135.05,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.88,-67.75 144.88,-64.25 134.88,-60.75 134.88,-67.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.88,-30.5 146.88,-30.5 146.88,0 243.88,0 243.88,-30.5"/>
-<text text-anchor="start" x="154.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="195.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.36,-54.22C96.88,-48.57 118.07,-41.33 137.7,-34.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.63,-38 146.97,-31.45 136.37,-31.37 138.63,-38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/dca/class_f_c_f_s_abb361a612b18bb189aa6d3c49288b793_cgraph.map b/dd/dca/class_f_c_f_s_abb361a612b18bb189aa6d3c49288b793_cgraph.map
deleted file mode 100644
index e680dea50..000000000
--- a/dd/dca/class_f_c_f_s_abb361a612b18bb189aa6d3c49288b793_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="FCFS::printResult" name="FCFS::printResult">
-<area shape="rect" id="Node000001" title="Utility function for printing the status of each process after execution." alt="" coords="5,55,133,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/fixed.html#" title=" " alt="" coords="202,5,277,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="115,51,186,31,188,36,117,57"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setprecision.html#" title=" " alt="" coords="181,55,298,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="133,65,165,65,165,70,133,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/setw.html#" title=" " alt="" coords="202,104,277,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="117,78,188,99,186,104,115,84"/>
-</map>
diff --git a/dd/dca/class_f_c_f_s_abb361a612b18bb189aa6d3c49288b793_cgraph.md5 b/dd/dca/class_f_c_f_s_abb361a612b18bb189aa6d3c49288b793_cgraph.md5
deleted file mode 100644
index ee2be7d6b..000000000
--- a/dd/dca/class_f_c_f_s_abb361a612b18bb189aa6d3c49288b793_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-dd113aaa6b4940a0ef0005238b54a11d
\ No newline at end of file
diff --git a/dd/dca/class_f_c_f_s_abb361a612b18bb189aa6d3c49288b793_cgraph.svg b/dd/dca/class_f_c_f_s_abb361a612b18bb189aa6d3c49288b793_cgraph.svg
deleted file mode 100644
index 04aab6329..000000000
--- a/dd/dca/class_f_c_f_s_abb361a612b18bb189aa6d3c49288b793_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: FCFS::printResult Pages: 1 -->
-<svg width="228pt" height="101pt"
- viewBox="0.00 0.00 227.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>FCFS::printResult</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function for printing the status of each process after execution.">
-<polygon fill="#999999" stroke="#666666" points="95.5,-56.25 0,-56.25 0,-37 95.5,-37 95.5,-56.25"/>
-<text text-anchor="middle" x="47.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::printResult</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/fixed.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203.75,-93.25 147.25,-93.25 147.25,-74 203.75,-74 203.75,-93.25"/>
-<text text-anchor="middle" x="175.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::fixed</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.11,-56.74C99.58,-61.58 119.35,-67.4 136.29,-72.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.91,-75.62 145.49,-75.09 136.89,-68.91 134.91,-75.62"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setprecision.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.5,-56.25 131.5,-56.25 131.5,-37 219.5,-37 219.5,-56.25"/>
-<text text-anchor="middle" x="175.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setprecision</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.93,-46.62C103.71,-46.62 111.82,-46.62 119.76,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="119.69,-50.13 129.69,-46.63 119.69,-43.13 119.69,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203.75,-19.25 147.25,-19.25 147.25,0 203.75,0 203.75,-19.25"/>
-<text text-anchor="middle" x="175.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.11,-36.51C99.58,-31.67 119.35,-25.85 136.29,-20.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.89,-24.34 145.49,-18.16 134.91,-17.63 136.89,-24.34"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/dca/class_f_c_f_s_abb361a612b18bb189aa6d3c49288b793_cgraph_org.svg b/dd/dca/class_f_c_f_s_abb361a612b18bb189aa6d3c49288b793_cgraph_org.svg
deleted file mode 100644
index e8e1b9719..000000000
--- a/dd/dca/class_f_c_f_s_abb361a612b18bb189aa6d3c49288b793_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: FCFS::printResult Pages: 1 -->
-<svg width="228pt" height="101pt"
- viewBox="0.00 0.00 227.50 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>FCFS::printResult</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function for printing the status of each process after execution.">
-<polygon fill="#999999" stroke="#666666" points="95.5,-56.25 0,-56.25 0,-37 95.5,-37 95.5,-56.25"/>
-<text text-anchor="middle" x="47.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::printResult</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/fixed.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203.75,-93.25 147.25,-93.25 147.25,-74 203.75,-74 203.75,-93.25"/>
-<text text-anchor="middle" x="175.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::fixed</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.11,-56.74C99.58,-61.58 119.35,-67.4 136.29,-72.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.91,-75.62 145.49,-75.09 136.89,-68.91 134.91,-75.62"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setprecision.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219.5,-56.25 131.5,-56.25 131.5,-37 219.5,-37 219.5,-56.25"/>
-<text text-anchor="middle" x="175.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setprecision</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.93,-46.62C103.71,-46.62 111.82,-46.62 119.76,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="119.69,-50.13 129.69,-46.63 119.69,-43.13 119.69,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/setw.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="203.75,-19.25 147.25,-19.25 147.25,0 203.75,0 203.75,-19.25"/>
-<text text-anchor="middle" x="175.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::setw</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.11,-36.51C99.58,-31.67 119.35,-25.85 136.29,-20.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.89,-24.34 145.49,-18.16 134.91,-17.63 136.89,-24.34"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/dd5/swap__sort_8cpp_source.html b/dd/dd5/swap__sort_8cpp_source.html
new file mode 100644
index 000000000..a73dd3eeb
--- /dev/null
+++ b/dd/dd5/swap__sort_8cpp_source.html
@@ -0,0 +1,206 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/swap_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dd/dd5/swap__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">swap_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">// C++ program to find minimum number of swaps required to sort an array</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include &lt;utility&gt;</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span> </div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment">// Function returns the minimum number of swaps</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment">// required to sort the array</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="keywordtype">int</span> minSwaps(<span class="keywordtype">int</span> arr[], <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    <span class="comment">// Create an array of pairs where first</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    <span class="comment">// element is array element and second element</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="comment">// is position of first element</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    std::pair&lt;int, int&gt; *arrPos = <span class="keyword">new</span> std::pair&lt;int, int&gt;[n];</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>        arrPos[i].first = arr[i];</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>        arrPos[i].second = i;</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    }</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    <span class="comment">// Sort the array by array element values to</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <span class="comment">// get right position of every element as second</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="comment">// element of pair.</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    std::sort(arrPos, arrPos + n);</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="comment">// To keep track of visited elements. Initialize</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="comment">// all elements as not visited or false.</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    std::vector&lt;bool&gt; vis(n, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="comment">// Initialize result</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordtype">int</span> ans = 0;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="comment">// Traverse array elements</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        <span class="comment">// already swapped and corrected or</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        <span class="comment">// already present at correct pos</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        <span class="keywordflow">if</span> (vis[i] || arrPos[i].second == i)</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>            <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <span class="comment">// find out the number of node in</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        <span class="comment">// this cycle and add in ans</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <span class="keywordtype">int</span> cycle_size = 0;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        <span class="keywordtype">int</span> j = i;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        <span class="keywordflow">while</span> (!vis[j]) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>            vis[j] = 1;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>            <span class="comment">// move to next node</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            j = arrPos[j].second;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            cycle_size++;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="comment">// Update answer by adding current cycle.</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        <span class="keywordflow">if</span> (cycle_size &gt; 0) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            ans += (cycle_size - 1);</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        }</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keyword">delete</span>[] arrPos;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="comment">// Return result</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">return</span> ans;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>}</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="comment">// program to test</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="keywordtype">int</span> arr[] = {6, 7, 8, 1, 2, 3, 9, 12};</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordtype">int</span> n = (<span class="keyword">sizeof</span>(arr) / <span class="keyword">sizeof</span>(int));</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    std::cout &lt;&lt; minSwaps(arr, n);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><b>swap_sort.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html
index 99fb1f9e6..7de88b659 100644
--- a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html
+++ b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others::recursive_tree_traversals::BT Class Reference</title>
+<title>TheAlgorithms/C++: others::recursive_tree_traversals::BT Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -117,37 +134,36 @@ $(function(){initNavTree('dd/de1/classothers_1_1recursive__tree__traversals_1_1_
 <div class="dynheader">
 Collaboration diagram for others::recursive_tree_traversals::BT:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.svg" width="194" height="259"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.svg" width="194" height="171"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:af16da5fe0f5c54d31778d71d5a042114" id="r_af16da5fe0f5c54d31778d71d5a042114"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a>)</td></tr>
+<tr class="memitem:af16da5fe0f5c54d31778d71d5a042114" id="r_af16da5fe0f5c54d31778d71d5a042114"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af16da5fe0f5c54d31778d71d5a042114">createNewNode</a> (std::uint64_t)</td></tr>
 <tr class="memdesc:af16da5fe0f5c54d31778d71d5a042114"><td class="mdescLeft">&#160;</td><td class="mdescRight">will allocate the memory for a node and, along the data and return the node.  <br /></td></tr>
 <tr class="separator:af16da5fe0f5c54d31778d71d5a042114"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a142689a84eaafcd22b68fad887b14540" id="r_a142689a84eaafcd22b68fad887b14540"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a142689a84eaafcd22b68fad887b14540">inorder</a> (<a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *)</td></tr>
+<tr class="memitem:a142689a84eaafcd22b68fad887b14540" id="r_a142689a84eaafcd22b68fad887b14540"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a142689a84eaafcd22b68fad887b14540">inorder</a> (<a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *)</td></tr>
 <tr class="separator:a142689a84eaafcd22b68fad887b14540"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a6397b78ceec18cb1959a1d159e134da5" id="r_a6397b78ceec18cb1959a1d159e134da5"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6397b78ceec18cb1959a1d159e134da5">preorder</a> (<a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *)</td></tr>
+<tr class="memitem:a6397b78ceec18cb1959a1d159e134da5" id="r_a6397b78ceec18cb1959a1d159e134da5"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6397b78ceec18cb1959a1d159e134da5">preorder</a> (<a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *)</td></tr>
 <tr class="memdesc:a6397b78ceec18cb1959a1d159e134da5"><td class="mdescLeft">&#160;</td><td class="mdescRight">preorder function that will perform the preorder traversal recursively, and return the resultant vector that contain the preorder traversal of a tree.  <br /></td></tr>
 <tr class="separator:a6397b78ceec18cb1959a1d159e134da5"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ac9404b65f407f631915515fa2e08a40c" id="r_ac9404b65f407f631915515fa2e08a40c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac9404b65f407f631915515fa2e08a40c">postorder</a> (<a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *)</td></tr>
+<tr class="memitem:ac9404b65f407f631915515fa2e08a40c" id="r_ac9404b65f407f631915515fa2e08a40c"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac9404b65f407f631915515fa2e08a40c">postorder</a> (<a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *)</td></tr>
 <tr class="memdesc:ac9404b65f407f631915515fa2e08a40c"><td class="mdescLeft">&#160;</td><td class="mdescRight">postorder function that will perform the postorder traversal recursively, and return the result vector that contain the postorder traversal of a tree.  <br /></td></tr>
 <tr class="separator:ac9404b65f407f631915515fa2e08a40c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a56cf8c75b7d9775841afb54f34df7548" id="r_a56cf8c75b7d9775841afb54f34df7548"><td class="memItemLeft" align="right" valign="top"><a id="a56cf8c75b7d9775841afb54f34df7548" name="a56cf8c75b7d9775841afb54f34df7548"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>inorder_result</b></td></tr>
+<tr class="memitem:a56cf8c75b7d9775841afb54f34df7548" id="r_a56cf8c75b7d9775841afb54f34df7548"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a56cf8c75b7d9775841afb54f34df7548">inorder_result</a></td></tr>
 <tr class="separator:a56cf8c75b7d9775841afb54f34df7548"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad3aa0b0a663f1cf17ac98345d2cd7072" id="r_ad3aa0b0a663f1cf17ac98345d2cd7072"><td class="memItemLeft" align="right" valign="top"><a id="ad3aa0b0a663f1cf17ac98345d2cd7072" name="ad3aa0b0a663f1cf17ac98345d2cd7072"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>preorder_result</b></td></tr>
+<tr class="memitem:ad3aa0b0a663f1cf17ac98345d2cd7072" id="r_ad3aa0b0a663f1cf17ac98345d2cd7072"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad3aa0b0a663f1cf17ac98345d2cd7072">preorder_result</a></td></tr>
 <tr class="separator:ad3aa0b0a663f1cf17ac98345d2cd7072"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a25989ceb1bd110da23805a5d99527ecb" id="r_a25989ceb1bd110da23805a5d99527ecb"><td class="memItemLeft" align="right" valign="top"><a id="a25989ceb1bd110da23805a5d99527ecb" name="a25989ceb1bd110da23805a5d99527ecb"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>postorder_result</b></td></tr>
+<tr class="memitem:a25989ceb1bd110da23805a5d99527ecb" id="r_a25989ceb1bd110da23805a5d99527ecb"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a25989ceb1bd110da23805a5d99527ecb">postorder_result</a></td></tr>
 <tr class="separator:a25989ceb1bd110da23805a5d99527ecb"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><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. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00088">88</a> of file <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="af16da5fe0f5c54d31778d71d5a042114" name="af16da5fe0f5c54d31778d71d5a042114"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#af16da5fe0f5c54d31778d71d5a042114">&#9670;&#160;</a></span>createNewNode()</h2>
@@ -158,7 +174,7 @@ Public Attributes</h2></td></tr>
         <tr>
           <td class="memname"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> * others::recursive_tree_traversals::BT::createNewNode </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a></td>          <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
+          <td class="paramtype">std::uint64_t</td>          <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -172,16 +188,18 @@ Public Attributes</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>pointer to the newly created node with assigned data. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00118">118</a> of file <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  118</span>                                        {</div>
 <div class="line"><span class="lineno">  119</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>();</div>
 <div class="line"><span class="lineno">  120</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;data = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
 <div class="line"><span class="lineno">  121</span>    <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  122</span>    <span class="keywordflow">return</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
 <div class="line"><span class="lineno">  123</span>}</div>
-<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
-<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
-<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -192,13 +210,15 @@ Public Attributes</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> &gt; others::recursive_tree_traversals::BT::inorder </td>
+          <td class="memname">std::vector&lt; std::uint64_t &gt; others::recursive_tree_traversals::BT::inorder </td>
           <td>(</td>
           <td class="paramtype"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *</td>          <td class="paramname"><span class="paramname"><em>root</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00132">132</a> of file <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  132</span>                                             {</div>
 <div class="line"><span class="lineno">  133</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {  <span class="comment">// return if the current node is empty</span></div>
 <div class="line"><span class="lineno">  134</span>        <span class="keywordflow">return</span> {};</div>
@@ -221,7 +241,7 @@ Public Attributes</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> &gt; others::recursive_tree_traversals::BT::postorder </td>
+          <td class="memname">std::vector&lt; std::uint64_t &gt; others::recursive_tree_traversals::BT::postorder </td>
           <td>(</td>
           <td class="paramtype"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *</td>          <td class="paramname"><span class="paramname"><em>root</em></span></td><td>)</td>
           <td></td>
@@ -237,6 +257,8 @@ Public Attributes</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>result that is containing the postorder traversal of a tree </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00172">172</a> of file <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  172</span>                                               {</div>
 <div class="line"><span class="lineno">  173</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {  <span class="comment">// if the current node is empty</span></div>
 <div class="line"><span class="lineno">  174</span>        <span class="keywordflow">return</span> {};</div>
@@ -249,13 +271,8 @@ Public Attributes</h2></td></tr>
 <div class="line"><span class="lineno">  181</span> </div>
 <div class="line"><span class="lineno">  182</span>    <span class="keywordflow">return</span> postorder_result;</div>
 <div class="line"><span class="lineno">  183</span>}</div>
-<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_ac9404b65f407f631915515fa2e08a40c"><div class="ttname"><a href="#ac9404b65f407f631915515fa2e08a40c">others::recursive_tree_traversals::BT::postorder</a></div><div class="ttdeci">std::vector&lt; std::uint64_t &gt; postorder(Node *)</div><div class="ttdoc">postorder function that will perform the postorder traversal recursively, and return the result vecto...</div><div class="ttdef"><b>Definition</b> recursive_tree_traversal.cpp:172</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.svg" width="182" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_ac9404b65f407f631915515fa2e08a40c"><div class="ttname"><a href="#ac9404b65f407f631915515fa2e08a40c">others::recursive_tree_traversals::BT::postorder</a></div><div class="ttdeci">std::vector&lt; std::uint64_t &gt; postorder(Node *)</div><div class="ttdoc">postorder function that will perform the postorder traversal recursively, and return the result vecto...</div><div class="ttdef"><b>Definition</b> <a href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00172">recursive_tree_traversal.cpp:172</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6397b78ceec18cb1959a1d159e134da5" name="a6397b78ceec18cb1959a1d159e134da5"></a>
@@ -265,7 +282,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> &gt; others::recursive_tree_traversals::BT::preorder </td>
+          <td class="memname">std::vector&lt; std::uint64_t &gt; others::recursive_tree_traversals::BT::preorder </td>
           <td>(</td>
           <td class="paramtype"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *</td>          <td class="paramname"><span class="paramname"><em>root</em></span></td><td>)</td>
           <td></td>
@@ -281,6 +298,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>result that is containing the preorder traversal of a tree </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00152">152</a> of file <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  152</span>                                              {</div>
 <div class="line"><span class="lineno">  153</span>    <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {  <span class="comment">// if the current node is empty</span></div>
 <div class="line"><span class="lineno">  154</span>        <span class="keywordflow">return</span> {};</div>
@@ -293,17 +312,61 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  161</span> </div>
 <div class="line"><span class="lineno">  162</span>    <span class="keywordflow">return</span> preorder_result;</div>
 <div class="line"><span class="lineno">  163</span>}</div>
-<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_a6397b78ceec18cb1959a1d159e134da5"><div class="ttname"><a href="#a6397b78ceec18cb1959a1d159e134da5">others::recursive_tree_traversals::BT::preorder</a></div><div class="ttdeci">std::vector&lt; std::uint64_t &gt; preorder(Node *)</div><div class="ttdoc">preorder function that will perform the preorder traversal recursively, and return the resultant vect...</div><div class="ttdef"><b>Definition</b> recursive_tree_traversal.cpp:152</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.svg" width="376" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="ttc" id="aclassothers_1_1recursive__tree__traversals_1_1_b_t_html_a6397b78ceec18cb1959a1d159e134da5"><div class="ttname"><a href="#a6397b78ceec18cb1959a1d159e134da5">others::recursive_tree_traversals::BT::preorder</a></div><div class="ttdeci">std::vector&lt; std::uint64_t &gt; preorder(Node *)</div><div class="ttdoc">preorder function that will perform the preorder traversal recursively, and return the resultant vect...</div><div class="ttdef"><b>Definition</b> <a href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00152">recursive_tree_traversal.cpp:152</a></div></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a56cf8c75b7d9775841afb54f34df7548" name="a56cf8c75b7d9775841afb54f34df7548"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a56cf8c75b7d9775841afb54f34df7548">&#9670;&#160;</a></span>inorder_result</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::uint64_t&gt; others::recursive_tree_traversals::BT::inorder_result</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00091">91</a> of file <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a25989ceb1bd110da23805a5d99527ecb" name="a25989ceb1bd110da23805a5d99527ecb"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a25989ceb1bd110da23805a5d99527ecb">&#9670;&#160;</a></span>postorder_result</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::uint64_t&gt; others::recursive_tree_traversals::BT::postorder_result</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00095">95</a> of file <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ad3aa0b0a663f1cf17ac98345d2cd7072" name="ad3aa0b0a663f1cf17ac98345d2cd7072"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ad3aa0b0a663f1cf17ac98345d2cd7072">&#9670;&#160;</a></span>preorder_result</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::uint64_t&gt; others::recursive_tree_traversals::BT::preorder_result</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html#l00093">93</a> of file <a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>others/<a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp.html">recursive_tree_traversal.cpp</a></li>
+<li>others/<a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp_source.html">recursive_tree_traversal.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.map b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.map
deleted file mode 100644
index a2243ddb8..000000000
--- a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="others::recursive_tree_traversals::BT::preorder" name="others::recursive_tree_traversals::BT::preorder">
-<area shape="rect" id="Node000001" title="preorder function that will perform the preorder traversal recursively, and return the resultant vect..." alt="" coords="5,29,169,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="48,29,46,19,52,10,66,5,87,3,109,5,123,11,121,16,108,10,87,8,67,10,56,15,51,20,53,28"/>
-<area shape="rect" id="Node000002" 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="217,37,371,62"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="169,47,201,47,201,52,169,52"/>
-</map>
diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.md5 b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.md5
deleted file mode 100644
index d87e37c87..000000000
--- a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3eb2fbddb7875d5611490c8e56e3e0f4
\ No newline at end of file
diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.svg b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.svg
deleted file mode 100644
index ebb176658..000000000
--- a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::recursive_tree_traversals::BT::preorder Pages: 1 -->
-<svg width="282pt" height="57pt"
- viewBox="0.00 0.00 282.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>others::recursive_tree_traversals::BT::preorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
-<polygon fill="#999999" stroke="#666666" points="122.5,-30.5 0,-30.5 0,0 122.5,0 122.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="61.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.76,-30.99C28.15,-40.06 37.31,-48.5 61.25,-48.5 74.34,-48.5 83.01,-45.97 87.26,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.71,-42.86 88.54,-32.49 83.77,-41.95 90.71,-42.86"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.25,-24.88 158.5,-24.88 158.5,-5.63 274.25,-5.63 274.25,-24.88"/>
-<text text-anchor="middle" x="216.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.77,-15.25C130.72,-15.25 138.92,-15.25 146.99,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.78,-18.75 156.78,-15.25 146.78,-11.75 146.78,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph_org.svg b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph_org.svg
deleted file mode 100644
index e97790af4..000000000
--- a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::recursive_tree_traversals::BT::preorder Pages: 1 -->
-<svg width="282pt" height="57pt"
- viewBox="0.00 0.00 282.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>others::recursive_tree_traversals::BT::preorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="preorder function that will perform the preorder traversal recursively, and return the resultant vect...">
-<polygon fill="#999999" stroke="#666666" points="122.5,-30.5 0,-30.5 0,0 122.5,0 122.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="61.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::preorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.76,-30.99C28.15,-40.06 37.31,-48.5 61.25,-48.5 74.34,-48.5 83.01,-45.97 87.26,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="90.71,-42.86 88.54,-32.49 83.77,-41.95 90.71,-42.86"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.25,-24.88 158.5,-24.88 158.5,-5.63 274.25,-5.63 274.25,-24.88"/>
-<text text-anchor="middle" x="216.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.77,-15.25C130.72,-15.25 138.92,-15.25 146.99,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.78,-18.75 156.78,-15.25 146.78,-11.75 146.78,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.map b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.map
deleted file mode 100644
index 62c38aecd..000000000
--- a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="others::recursive_tree_traversals::BT::postorder" name="others::recursive_tree_traversals::BT::postorder">
-<area shape="rect" id="Node000001" title="postorder function that will perform the postorder traversal recursively, and return the result vecto..." alt="" coords="5,29,176,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="58,29,56,19,61,11,73,5,91,3,109,5,120,11,118,16,108,10,90,8,75,10,65,14,61,20,63,28"/>
-</map>
diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.md5 b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.md5
deleted file mode 100644
index 59beb97f9..000000000
--- a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f66bc4436ce959a42f368e6203759149
\ No newline at end of file
diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.svg b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.svg
deleted file mode 100644
index c7ebb8393..000000000
--- a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::recursive_tree_traversals::BT::postorder Pages: 1 -->
-<svg width="136pt" height="57pt"
- viewBox="0.00 0.00 135.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>others::recursive_tree_traversals::BT::postorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
-<polygon fill="#999999" stroke="#666666" points="127.75,-30.5 0,-30.5 0,0 127.75,0 127.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="63.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M41.24,-30.99C36.62,-40.06 44.16,-48.5 63.88,-48.5 74.65,-48.5 81.8,-45.97 85.3,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.75,-42.81 86.35,-32.49 81.79,-42.06 88.75,-42.81"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph_org.svg b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph_org.svg
deleted file mode 100644
index e6e41d1f8..000000000
--- a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::recursive_tree_traversals::BT::postorder Pages: 1 -->
-<svg width="136pt" height="57pt"
- viewBox="0.00 0.00 135.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>others::recursive_tree_traversals::BT::postorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="postorder function that will perform the postorder traversal recursively, and return the result vecto...">
-<polygon fill="#999999" stroke="#666666" points="127.75,-30.5 0,-30.5 0,0 127.75,0 127.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
-<text text-anchor="middle" x="63.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT::postorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M41.24,-30.99C36.62,-40.06 44.16,-48.5 63.88,-48.5 74.65,-48.5 81.8,-45.97 85.3,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="88.75,-42.81 86.35,-32.49 81.79,-42.06 88.75,-42.81"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/dd/dec/a__star__search_8cpp_source.html b/dd/dec/a__star__search_8cpp_source.html
new file mode 100644
index 000000000..c2594784f
--- /dev/null
+++ b/dd/dec/a__star__search_8cpp_source.html
@@ -0,0 +1,719 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: machine_learning/a_star_search.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dd/dec/a__star__search_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">a_star_search.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;algorithm&gt;</span>   </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;array&gt;</span>       </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;cassert&gt;</span>     </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;functional&gt;</span>  </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;iostream&gt;</span>    </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;map&gt;</span>         </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;memory&gt;</span>      </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;set&gt;</span>         </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;vector&gt;</span>      </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d77/namespacemachine__learning.html">machine_learning</a> {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../db/ddc/namespaceaystar__search.html">aystar_search</a> {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> N = 3&gt;</div>
+<div class="foldopen" id="foldopen00060" data-start="{" data-end="};">
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">   60</a></span><span class="keyword">class </span><a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a> {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    std::array&lt;std::array&lt;uint32_t, N&gt;, N&gt;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        board;  </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="foldopen" id="foldopen00064" data-start="{" data-end="};">
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71">   64</a></span>    std::vector&lt;std::pair&lt;int8_t, int8_t&gt;&gt; <a class="code hl_variable" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71">moves</a> = {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        {0, 1},</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        {1, 0},</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        {0, -1},</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        {-1,</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>         0}};  </div>
+</div>
+<div class="foldopen" id="foldopen00075" data-start="{" data-end="}">
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3">   75</a></span>    std::pair&lt;uint32_t, uint32_t&gt; <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3">find_zero</a>() {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; N; ++i) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; N; ++j) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>                <span class="keywordflow">if</span> (!board[i][j]) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>                    <span class="keywordflow">return</span> {i, j};</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>                }</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>            }</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        }</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordflow">return</span> {-1, -1};</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    }</div>
+</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e">   90</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e">in_range</a>(<span class="keyword">const</span> uint32_t value)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> value &lt; N; }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00102" data-start="{" data-end="}">
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420">  102</a></span>    uint32_t <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420">get</a>(<span class="keywordtype">size_t</span> i, <span class="keywordtype">size_t</span> j)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e">in_range</a>(i) &amp;&amp; <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e">in_range</a>(j)) {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>            <span class="keywordflow">return</span> board[i][j];</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        }</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    }</div>
+</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99">  111</a></span>    std::array&lt;std::array&lt;uint32_t, N&gt;, N&gt; <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99">get_state</a>() { <span class="keywordflow">return</span> board; }</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">  117</a></span>    <span class="keyword">inline</span> <span class="keywordtype">size_t</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> N; }</div>
+<div class="foldopen" id="foldopen00121" data-start="{" data-end="}">
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">  121</a></span>    <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">EightPuzzle</a>() {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; N; ++i) {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; N; ++j) {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>                board[i][j] = ((i * 3 + j + 1) % (N * N));</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>            }</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        }</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00132" data-start="{" data-end="}">
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2">  132</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2">EightPuzzle</a>(<span class="keyword">const</span> std::array&lt;std::array&lt;uint32_t, N&gt;, N&gt; &amp;init)</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        : board(init) {}</div>
+</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span> </div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7">  139</a></span>    <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7">EightPuzzle</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle&lt;N&gt;</a> &amp;A) : board(A.board) {}</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span> </div>
+<div class="foldopen" id="foldopen00145" data-start="{" data-end="}">
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9">  145</a></span>    <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9">EightPuzzle</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle&lt;N&gt;</a> &amp;&amp;A) noexcept</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        : board(std::move(A.board)) {}</div>
+</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a194c2973b51a5467fc17064a4ea4e6f9">  150</a></span>    <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a194c2973b51a5467fc17064a4ea4e6f9">~EightPuzzle</a>() = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span> </div>
+<div class="foldopen" id="foldopen00156" data-start="{" data-end="}">
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2">  156</a></span>    <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a> &amp;<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2">operator=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a> &amp;A) {</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>        board = A.board;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    }</div>
+</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span> </div>
+<div class="foldopen" id="foldopen00165" data-start="{" data-end="}">
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101">  165</a></span>    <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a> &amp;<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101">operator=</a>(<a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a> &amp;&amp;A) <span class="keyword">noexcept</span> {</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        board = std::move(A.board);</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    }</div>
+</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span> </div>
+<div class="foldopen" id="foldopen00176" data-start="{" data-end="}">
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658">  176</a></span>    std::vector&lt;EightPuzzle&lt;N&gt;&gt; <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658">generate_possible_moves</a>() {</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        <span class="keyword">auto</span> zero_pos = <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3">find_zero</a>();</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        <span class="comment">// vector which will contain all possible state from current state</span></div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        std::vector&lt;EightPuzzle&lt;N&gt;&gt; NewStates;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;move : <a class="code hl_variable" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71">moves</a>) {</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>            <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e">in_range</a>(zero_pos.first + move.first) &amp;&amp;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>                <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e">in_range</a>(zero_pos.second + move.second)) {</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>                <span class="comment">// swap with the possible moves</span></div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>                std::array&lt;std::array&lt;uint32_t, N&gt;, N&gt; new_config = board;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>                std::swap(new_config[zero_pos.first][zero_pos.second],</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>                          new_config[zero_pos.first + move.first]</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>                                    [zero_pos.second + move.second]);</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>                <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle&lt;N&gt;</a> new_state(new_config);</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>                <span class="comment">// Store new state and calculate heuristic value, and depth</span></div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>                NewStates.emplace_back(new_state);</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>            }</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>        }</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        <span class="keywordflow">return</span> NewStates;</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00200" data-start="{" data-end="}">
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915">  200</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915">operator==</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle&lt;N&gt;</a> &amp;check)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>        <span class="keywordflow">if</span> (check.get_size() != N) {</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>        }</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; N; ++i) {</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; N; ++j) {</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>                <span class="keywordflow">if</span> (board[i][j] != check.board[i][j]) {</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>                    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>                }</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>            }</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>        }</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00218" data-start="{" data-end="}">
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba">  218</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba">operator&lt;</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle&lt;N&gt;</a> &amp;check)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; N; ++i) {</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; N; ++j) {</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>                <span class="keywordflow">if</span> (board[i][j] != check.board[i][j]) {</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>                    <span class="keywordflow">return</span> board[i][j] &lt; check.board[i][j];</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>                }</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>            }</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>        }</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00233" data-start="{" data-end="}">
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee">  233</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee">operator&lt;=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle&lt;N&gt;</a> &amp;check)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; N; ++i) {</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; N; ++j) {</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>                <span class="keywordflow">if</span> (board[i][j] != check.board[i][j]) {</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>                    <span class="keywordflow">return</span> board[i][j] &lt; check.board[i][j];</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>                }</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>            }</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>        }</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    }</div>
+</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span> </div>
+<div class="foldopen" id="foldopen00250" data-start="{" data-end="};">
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"><a class="line" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a9517e162e2988f7db052296bd550a742">  250</a></span>    <span class="keyword">friend</span> std::ostream &amp;<a class="code hl_friend" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a9517e162e2988f7db052296bd550a742">operator&lt;&lt;</a>(std::ostream &amp;op,</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>                                    <span class="keyword">const</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle&lt;N&gt;</a> &amp;SomeState) {</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; N; ++i) {</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; N; ++j) {</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>                op &lt;&lt; SomeState.board[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>            }</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>            op &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>        }</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>        <span class="keywordflow">return</span> op;</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>    }</div>
+</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>};</div>
+</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> Puzzle&gt;</div>
+<div class="foldopen" id="foldopen00288" data-start="{" data-end="};">
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"><a class="line" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">  288</a></span><span class="keyword">class </span><a class="code hl_class" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">AyStarSearch</a> {</div>
+<div class="foldopen" id="foldopen00293" data-start="{" data-end="};">
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">  293</a></span>    <span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code hl_struct" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> {</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>        std::shared_ptr&lt;Puzzle&gt; state;  </div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">  295</a></span>        <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a> = 0;     </div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">  296</a></span>        <span class="keywordtype">size_t</span> <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">depth</a> = 0;               </div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span> </div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7">  301</a></span>        <a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7">Info</a>() = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span> </div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a695e4314ebc3ab58e13004dc63599fe8">  307</a></span>        <span class="keyword">explicit</span> <a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a695e4314ebc3ab58e13004dc63599fe8">Info</a>(<span class="keyword">const</span> Puzzle &amp;A) : state(std::make_shared&lt;Puzzle&gt;(A)) {}</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span> </div>
+<div class="foldopen" id="foldopen00315" data-start="{" data-end="}">
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3950824936488f66408313b1f8a8ca8">  315</a></span>        <a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3950824936488f66408313b1f8a8ca8">Info</a>(<span class="keyword">const</span> Puzzle &amp;A, <span class="keywordtype">size_t</span> h_value, <span class="keywordtype">size_t</span> d)</div>
+<div class="line"><a id="l00316" name="l00316"></a><span class="lineno">  316</span>            : state(std::make_shared&lt;Puzzle&gt;(A)),</div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span>              <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a>(h_value),</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>              <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">depth</a>(d) {}</div>
+</div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span> </div>
+<div class="foldopen" id="foldopen00324" data-start="{" data-end="}">
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a572de12115e39e34dde6e68b707d59f5">  324</a></span>        <a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a572de12115e39e34dde6e68b707d59f5">Info</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &amp;A)</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>            : state(std::make_shared&lt;Puzzle&gt;(A.state)),</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>              <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a>(A.<a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a>),</div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>              <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">depth</a>(A.<a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">depth</a>) {}</div>
+</div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span> </div>
+<div class="foldopen" id="foldopen00333" data-start="{" data-end="}">
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a6abc89925ae7055a63b428e61525ad7a">  333</a></span>        <a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a6abc89925ae7055a63b428e61525ad7a">Info</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &amp;&amp;A) noexcept</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>            : state(std::make_shared&lt;Puzzle&gt;(std::move(A.state))),</div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>              <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a>(std::move(A.heuristic_value)),</div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>              <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">depth</a>(std::move(A.depth)) {}</div>
+</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span> </div>
+<div class="foldopen" id="foldopen00342" data-start="{" data-end="}">
+<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317">  342</a></span>        <a class="code hl_struct" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &amp;<a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317">operator=</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &amp;A) {</div>
+<div class="line"><a id="l00343" name="l00343"></a><span class="lineno">  343</span>            state = A.state;</div>
+<div class="line"><a id="l00344" name="l00344"></a><span class="lineno">  344</span>            <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a> = A.<a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a>;</div>
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno">  345</span>            <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">depth</a> = A.<a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">depth</a>;</div>
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>            <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>        }</div>
+</div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span> </div>
+<div class="foldopen" id="foldopen00353" data-start="{" data-end="}">
+<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3993dbca9c5b3ef9ac361dc7f62ce57">  353</a></span>        <a class="code hl_struct" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &amp;<a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3993dbca9c5b3ef9ac361dc7f62ce57">operator=</a>(<a class="code hl_struct" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">Info</a> &amp;&amp;A) <span class="keyword">noexcept</span> {</div>
+<div class="line"><a id="l00354" name="l00354"></a><span class="lineno">  354</span>            state = std::move(A.state);</div>
+<div class="line"><a id="l00355" name="l00355"></a><span class="lineno">  355</span>            <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">heuristic_value</a> = std::move(A.heuristic_value);</div>
+<div class="line"><a id="l00356" name="l00356"></a><span class="lineno">  356</span>            <a class="code hl_variable" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">depth</a> = std::move(A.depth);</div>
+<div class="line"><a id="l00357" name="l00357"></a><span class="lineno">  357</span>            <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno">  358</span>        }</div>
+</div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"><a class="line" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aa816af5a64b37c86be8acda89fdefba2">  362</a></span>        <a class="code hl_function" href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aa816af5a64b37c86be8acda89fdefba2">~Info</a>() = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"><a class="line" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#acd897e6e519849edb9fb0d1e1bfa881a">  363</a></span>    } <a class="code hl_typedef" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#acd897e6e519849edb9fb0d1e1bfa881a">Info</a>;</div>
+</div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span> </div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>    std::shared_ptr&lt;Info&gt; Initial;  <span class="comment">// Initial state of the AyStarSearch</span></div>
+<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>    std::shared_ptr&lt;Info&gt; Final;    <span class="comment">// Final state of the AyStarSearch</span></div>
+<div class="foldopen" id="foldopen00370" data-start="{" data-end="};">
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"><a class="line" href="../../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">  370</a></span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">comparison_operator</a> {</div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>        <span class="keywordtype">bool</span> operator()(<span class="keyword">const</span> std::shared_ptr&lt;Info&gt; &amp;a,</div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>                        <span class="keyword">const</span> std::shared_ptr&lt;Info&gt; &amp;b)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>            <span class="keywordflow">return</span> *(a-&gt;state) &lt; *(b-&gt;state);</div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>        }</div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>    };</div>
+</div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span> </div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>    <span class="keyword">using </span>MapOfPuzzleInfoWithPuzzleInfo =</div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span>        std::map&lt;std::shared_ptr&lt;Info&gt;, std::shared_ptr&lt;Info&gt;,</div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>                 <a class="code hl_struct" href="../../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">comparison_operator</a>&gt;;</div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span> </div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>    <span class="keyword">using </span>MapOfPuzzleInfoWithInteger =</div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span>        std::map&lt;std::shared_ptr&lt;Info&gt;, uint32_t, <a class="code hl_struct" href="../../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">comparison_operator</a>&gt;;</div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span> </div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>    <span class="keyword">using </span>SetOfPuzzleInfo =</div>
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span>        std::set&lt;std::shared_ptr&lt;Info&gt;, <a class="code hl_struct" href="../../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">comparison_operator</a>&gt;;</div>
+<div class="foldopen" id="foldopen00392" data-start="{" data-end="}">
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"><a class="line" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e">  392</a></span>    <a class="code hl_function" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e">AyStarSearch</a>(<span class="keyword">const</span> Puzzle &amp;initial, <span class="keyword">const</span> Puzzle &amp;<span class="keyword">final</span>) {</div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>        Initial = std::make_shared&lt;Info&gt;(initial);</div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span>        Final = std::make_shared&lt;Info&gt;(<span class="keyword">final</span>);</div>
+<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00405" data-start="{" data-end="}">
+<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"><a class="line" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4">  405</a></span>    std::vector&lt;Puzzle&gt; <a class="code hl_function" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4">Solution</a>(</div>
+<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>        std::shared_ptr&lt;Info&gt; FinalState,</div>
+<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>        <span class="keyword">const</span> MapOfPuzzleInfoWithPuzzleInfo &amp;parent_of) {</div>
+<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>        <span class="comment">//  Useful for traversing from final state to current state.</span></div>
+<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>        <span class="keyword">auto</span> current_state = FinalState;</div>
+<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span>        <span class="comment">/*</span></div>
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span><span class="comment">         * For storing the solution tree starting from initial state to</span></div>
+<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span><span class="comment">         * final state</span></div>
+<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span><span class="comment">         */</span></div>
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>        std::vector&lt;Puzzle&gt; answer;</div>
+<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>        <span class="keywordflow">while</span> (current_state != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span>            answer.emplace_back(*current_state-&gt;state);</div>
+<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>            current_state = parent_of.find(current_state)-&gt;second;</div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>        }</div>
+<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>        <span class="keywordflow">return</span> answer;</div>
+<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00429" data-start="{" data-end="}">
+<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"><a class="line" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a48284e156fdd48fd0c41008c7e48f201">  429</a></span>    std::vector&lt;Puzzle&gt; <a class="code hl_function" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a48284e156fdd48fd0c41008c7e48f201">a_star_search</a>(</div>
+<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>        <span class="keyword">const</span> std::function&lt;uint32_t(<span class="keyword">const</span> Puzzle &amp;, <span class="keyword">const</span> Puzzle &amp;)&gt; &amp;dist,</div>
+<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span>        <span class="keyword">const</span> uint32_t permissible_depth = 30) {</div>
+<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>        MapOfPuzzleInfoWithPuzzleInfo</div>
+<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>            parent_of;                       </div>
+<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>        MapOfPuzzleInfoWithInteger g_score;  </div>
+<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>        SetOfPuzzleInfo open_list;           </div>
+<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>        SetOfPuzzleInfo closed_list;  </div>
+<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span> </div>
+<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>        <span class="comment">// Before starting the AyStartSearch, initialize the set and maps</span></div>
+<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>        open_list.emplace(Initial);</div>
+<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>        parent_of[Initial] = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>        g_score[Initial] = 0;</div>
+<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span> </div>
+<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span>        <span class="keywordflow">while</span> (!open_list.empty()) {</div>
+<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span>            <span class="comment">// Iterator for state having having lowest f_score.</span></div>
+<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span>            <span class="keyword">typename</span> SetOfPuzzleInfo::iterator it_low_f_score;</div>
+<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span>            uint32_t min_f_score = 1e9;</div>
+<div class="line"><a id="l00447" name="l00447"></a><span class="lineno">  447</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> iter = open_list.begin(); iter != open_list.end();</div>
+<div class="line"><a id="l00448" name="l00448"></a><span class="lineno">  448</span>                 ++iter) {</div>
+<div class="line"><a id="l00449" name="l00449"></a><span class="lineno">  449</span>                <span class="comment">// f score here is evaluated by g score (depth) and h score</span></div>
+<div class="line"><a id="l00450" name="l00450"></a><span class="lineno">  450</span>                <span class="comment">// (distance between current state and final state)</span></div>
+<div class="line"><a id="l00451" name="l00451"></a><span class="lineno">  451</span>                uint32_t f_score = (*iter)-&gt;heuristic_value + (*iter)-&gt;depth;</div>
+<div class="line"><a id="l00452" name="l00452"></a><span class="lineno">  452</span>                <span class="keywordflow">if</span> (f_score &lt; min_f_score) {</div>
+<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>                    min_f_score = f_score;</div>
+<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span>                    it_low_f_score = iter;</div>
+<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>                }</div>
+<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>            }</div>
+<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span> </div>
+<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span>            <span class="comment">// current_state, stores lowest f score so far for this state.</span></div>
+<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span>            std::shared_ptr&lt;Info&gt; current_state = *it_low_f_score;</div>
+<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span> </div>
+<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>            <span class="comment">// if this current state is equal to final, return</span></div>
+<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>            <span class="keywordflow">if</span> (*(current_state-&gt;state) == *(Final-&gt;state)) {</div>
+<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span>                <span class="keywordflow">return</span> <a class="code hl_function" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4">Solution</a>(current_state, parent_of);</div>
+<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span>            }</div>
+<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span>            <span class="comment">// else remove from open list as visited.</span></div>
+<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span>            open_list.erase(it_low_f_score);</div>
+<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span>            <span class="comment">// if current_state has exceeded the allowed depth, skip</span></div>
+<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span>            <span class="comment">// neighbor checking</span></div>
+<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span>            <span class="keywordflow">if</span> (current_state-&gt;depth &gt;= permissible_depth) {</div>
+<div class="line"><a id="l00470" name="l00470"></a><span class="lineno">  470</span>                <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00471" name="l00471"></a><span class="lineno">  471</span>            }</div>
+<div class="line"><a id="l00472" name="l00472"></a><span class="lineno">  472</span>            <span class="comment">// Generate all possible moves (neighbors) given the current</span></div>
+<div class="line"><a id="l00473" name="l00473"></a><span class="lineno">  473</span>            <span class="comment">// state</span></div>
+<div class="line"><a id="l00474" name="l00474"></a><span class="lineno">  474</span>            std::vector&lt;Puzzle&gt; total_possible_moves =</div>
+<div class="line"><a id="l00475" name="l00475"></a><span class="lineno">  475</span>                current_state-&gt;state-&gt;generate_possible_moves();</div>
+<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span> </div>
+<div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span>            <span class="keywordflow">for</span> (Puzzle &amp;neighbor : total_possible_moves) {</div>
+<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>                <span class="comment">// calculate score of neighbors with respect to</span></div>
+<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span>                <span class="comment">// current_state</span></div>
+<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span>                std::shared_ptr&lt;Info&gt; Neighbor = std::make_shared&lt;Info&gt;(</div>
+<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span>                    neighbor, dist(neighbor, *(Final-&gt;state)),</div>
+<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>                    current_state-&gt;depth + 1U);</div>
+<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span>                uint32_t temp_g_score = Neighbor-&gt;depth;</div>
+<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span> </div>
+<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span>                <span class="comment">// Check whether this state is explored.</span></div>
+<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span>                <span class="comment">// If this state is discovered at greater depth, then discard,</span></div>
+<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span>                <span class="comment">// else remove from closed list and explore the node</span></div>
+<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span>                <span class="keyword">auto</span> closed_list_iter = closed_list.find(Neighbor);</div>
+<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span>                <span class="keywordflow">if</span> (closed_list_iter != closed_list.end()) {</div>
+<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span>                    <span class="comment">// 1. If state in closed list has higher depth, then remove</span></div>
+<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>                    <span class="comment">// from list since we have found better option,</span></div>
+<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span>                    <span class="comment">// 2. Else don&#39;t explore this state.</span></div>
+<div class="line"><a id="l00493" name="l00493"></a><span class="lineno">  493</span>                    <span class="keywordflow">if</span> (Neighbor-&gt;depth &lt; (*closed_list_iter)-&gt;depth) {</div>
+<div class="line"><a id="l00494" name="l00494"></a><span class="lineno">  494</span>                        closed_list.erase(closed_list_iter);</div>
+<div class="line"><a id="l00495" name="l00495"></a><span class="lineno">  495</span>                    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00496" name="l00496"></a><span class="lineno">  496</span>                        <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00497" name="l00497"></a><span class="lineno">  497</span>                    }</div>
+<div class="line"><a id="l00498" name="l00498"></a><span class="lineno">  498</span>                }</div>
+<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>                <span class="keyword">auto</span> neighbor_g_score_iter = g_score.find(Neighbor);</div>
+<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span>                <span class="comment">// if the neighbor is already created and has minimum</span></div>
+<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>                <span class="comment">// g_score, then update g_score and f_score else insert new</span></div>
+<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span>                <span class="keywordflow">if</span> (neighbor_g_score_iter != g_score.end()) {</div>
+<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>                    <span class="keywordflow">if</span> (neighbor_g_score_iter-&gt;second &gt; temp_g_score) {</div>
+<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span>                        neighbor_g_score_iter-&gt;second = temp_g_score;</div>
+<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span>                        parent_of[Neighbor] = current_state;</div>
+<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span>                    }</div>
+<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span>                } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>                    g_score[Neighbor] = temp_g_score;</div>
+<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span>                    parent_of[Neighbor] = current_state;</div>
+<div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span>                }</div>
+<div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span>                <span class="comment">// If this is a new state, insert into open_list</span></div>
+<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span>                <span class="comment">// else update if the this state has better g score than</span></div>
+<div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span>                <span class="comment">// existing one.</span></div>
+<div class="line"><a id="l00514" name="l00514"></a><span class="lineno">  514</span>                <span class="keyword">auto</span> iter = open_list.find(Neighbor);</div>
+<div class="line"><a id="l00515" name="l00515"></a><span class="lineno">  515</span>                <span class="keywordflow">if</span> (iter == open_list.end()) {</div>
+<div class="line"><a id="l00516" name="l00516"></a><span class="lineno">  516</span>                    open_list.emplace(Neighbor);</div>
+<div class="line"><a id="l00517" name="l00517"></a><span class="lineno">  517</span>                } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((*iter)-&gt;depth &gt; Neighbor-&gt;depth) {</div>
+<div class="line"><a id="l00518" name="l00518"></a><span class="lineno">  518</span>                    (*iter)-&gt;depth = Neighbor-&gt;depth;</div>
+<div class="line"><a id="l00519" name="l00519"></a><span class="lineno">  519</span>                }</div>
+<div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span>            }</div>
+<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span>            closed_list.emplace(current_state);</div>
+<div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span>        }</div>
+<div class="line"><a id="l00523" name="l00523"></a><span class="lineno">  523</span>        <span class="comment">// Cannot find the solution, return empty vector</span></div>
+<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span>        <span class="keywordflow">return</span> std::vector&lt;Puzzle&gt;(0);</div>
+<div class="line"><a id="l00525" name="l00525"></a><span class="lineno">  525</span>    }</div>
+</div>
+<div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span>};</div>
+</div>
+<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span>}  <span class="comment">// namespace aystar_search</span></div>
+<div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span>}  <span class="comment">// namespace machine_learning</span></div>
+<div class="line"><a id="l00529" name="l00529"></a><span class="lineno">  529</span> </div>
+<div class="line"><a id="l00534" name="l00534"></a><span class="lineno">  534</span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
+<div class="line"><a id="l00535" name="l00535"></a><span class="lineno">  535</span>    <span class="comment">// Renaming for simplicity</span></div>
+<div class="line"><a id="l00536" name="l00536"></a><span class="lineno">  536</span>    <span class="keyword">using </span>matrix3 = std::array&lt;std::array&lt;uint32_t, 3&gt;, 3&gt;;</div>
+<div class="line"><a id="l00537" name="l00537"></a><span class="lineno">  537</span>    <span class="keyword">using </span>row3 = std::array&lt;uint32_t, 3&gt;;</div>
+<div class="line"><a id="l00538" name="l00538"></a><span class="lineno">  538</span>    <span class="keyword">using </span>matrix4 = std::array&lt;std::array&lt;uint32_t, 4&gt;, 4&gt;;</div>
+<div class="line"><a id="l00539" name="l00539"></a><span class="lineno">  539</span>    <span class="keyword">using </span>row4 = std::array&lt;uint32_t, 4&gt;;</div>
+<div class="line"><a id="l00540" name="l00540"></a><span class="lineno">  540</span>    <span class="comment">// 1st test: A* search for simple EightPuzzle problem</span></div>
+<div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</span>    matrix3 puzzle;</div>
+<div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span>    puzzle[0] = row3({0, 2, 3});</div>
+<div class="line"><a id="l00543" name="l00543"></a><span class="lineno">  543</span>    puzzle[1] = row3({1, 5, 6});</div>
+<div class="line"><a id="l00544" name="l00544"></a><span class="lineno">  544</span>    puzzle[2] = row3({4, 7, 8});</div>
+<div class="line"><a id="l00545" name="l00545"></a><span class="lineno">  545</span> </div>
+<div class="line"><a id="l00546" name="l00546"></a><span class="lineno">  546</span>    matrix3 ideal;</div>
+<div class="line"><a id="l00547" name="l00547"></a><span class="lineno">  547</span>    ideal[0] = row3({1, 2, 3});</div>
+<div class="line"><a id="l00548" name="l00548"></a><span class="lineno">  548</span>    ideal[1] = row3({4, 5, 6});</div>
+<div class="line"><a id="l00549" name="l00549"></a><span class="lineno">  549</span>    ideal[2] = row3({7, 8, 0});</div>
+<div class="line"><a id="l00550" name="l00550"></a><span class="lineno">  550</span> </div>
+<div class="line"><a id="l00551" name="l00551"></a><span class="lineno">  551</span>    <span class="comment">/*</span></div>
+<div class="line"><a id="l00552" name="l00552"></a><span class="lineno">  552</span><span class="comment">     * Heuristic function: Manhattan distance</span></div>
+<div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</span><span class="comment">     */</span></div>
+<div class="line"><a id="l00554" name="l00554"></a><span class="lineno">  554</span>    <span class="keyword">auto</span> manhattan_distance =</div>
+<div class="line"><a id="l00555" name="l00555"></a><span class="lineno">  555</span>        [](<span class="keyword">const</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle&lt;&gt;</a> &amp;first,</div>
+<div class="line"><a id="l00556" name="l00556"></a><span class="lineno">  556</span>           <span class="keyword">const</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle&lt;&gt;</a> &amp;second) {</div>
+<div class="line"><a id="l00557" name="l00557"></a><span class="lineno">  557</span>            uint32_t ret = 0;</div>
+<div class="line"><a id="l00558" name="l00558"></a><span class="lineno">  558</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>(); ++i) {</div>
+<div class="line"><a id="l00559" name="l00559"></a><span class="lineno">  559</span>                <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>(); ++j) {</div>
+<div class="line"><a id="l00560" name="l00560"></a><span class="lineno">  560</span>                    uint32_t <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d">find</a> = first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420">get</a>(i, j);</div>
+<div class="line"><a id="l00561" name="l00561"></a><span class="lineno">  561</span>                    <span class="keywordtype">size_t</span> m = first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>(), n = first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>();</div>
+<div class="line"><a id="l00562" name="l00562"></a><span class="lineno">  562</span>                    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> k = 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> &lt; second.get_size(); ++<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>) {</div>
+<div class="line"><a id="l00563" name="l00563"></a><span class="lineno">  563</span>                        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> l = 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> &lt; second.get_size(); ++<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>) {</div>
+<div class="line"><a id="l00564" name="l00564"></a><span class="lineno">  564</span>                            <span class="keywordflow">if</span> (find == second.get(k, l)) {</div>
+<div class="line"><a id="l00565" name="l00565"></a><span class="lineno">  565</span>                                std::tie(m, n) = std::make_pair(k, l);</div>
+<div class="line"><a id="l00566" name="l00566"></a><span class="lineno">  566</span>                                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00567" name="l00567"></a><span class="lineno">  567</span>                            }</div>
+<div class="line"><a id="l00568" name="l00568"></a><span class="lineno">  568</span>                        }</div>
+<div class="line"><a id="l00569" name="l00569"></a><span class="lineno">  569</span>                        <span class="keywordflow">if</span> (m != first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>()) {</div>
+<div class="line"><a id="l00570" name="l00570"></a><span class="lineno">  570</span>                            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00571" name="l00571"></a><span class="lineno">  571</span>                        }</div>
+<div class="line"><a id="l00572" name="l00572"></a><span class="lineno">  572</span>                    }</div>
+<div class="line"><a id="l00573" name="l00573"></a><span class="lineno">  573</span>                    <span class="keywordflow">if</span> (m != first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>()) {</div>
+<div class="line"><a id="l00574" name="l00574"></a><span class="lineno">  574</span>                        ret += (std::max(m, i) - std::min(m, i)) +</div>
+<div class="line"><a id="l00575" name="l00575"></a><span class="lineno">  575</span>                               (std::max(n, j) - std::min(n, j));</div>
+<div class="line"><a id="l00576" name="l00576"></a><span class="lineno">  576</span>                    }</div>
+<div class="line"><a id="l00577" name="l00577"></a><span class="lineno">  577</span>                }</div>
+<div class="line"><a id="l00578" name="l00578"></a><span class="lineno">  578</span>            }</div>
+<div class="line"><a id="l00579" name="l00579"></a><span class="lineno">  579</span>            <span class="keywordflow">return</span> ret;</div>
+<div class="line"><a id="l00580" name="l00580"></a><span class="lineno">  580</span>        };</div>
+<div class="line"><a id="l00581" name="l00581"></a><span class="lineno">  581</span> </div>
+<div class="line"><a id="l00582" name="l00582"></a><span class="lineno">  582</span>    <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle&lt;&gt;</a> Puzzle(puzzle);</div>
+<div class="line"><a id="l00583" name="l00583"></a><span class="lineno">  583</span>    <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle&lt;&gt;</a> Ideal(ideal);</div>
+<div class="line"><a id="l00584" name="l00584"></a><span class="lineno">  584</span>    <a class="code hl_class" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a>&lt;</div>
+<div class="line"><a id="l00585" name="l00585"></a><span class="lineno">  585</span>        <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle&lt;3&gt;</a>&gt;</div>
+<div class="line"><a id="l00586" name="l00586"></a><span class="lineno">  586</span>        <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>(Puzzle, Ideal);  </div>
+<div class="line"><a id="l00587" name="l00587"></a><span class="lineno">  587</span> </div>
+<div class="line"><a id="l00588" name="l00588"></a><span class="lineno">  588</span>    std::vector&lt;matrix3&gt; answer;  </div>
+<div class="line"><a id="l00589" name="l00589"></a><span class="lineno">  589</span> </div>
+<div class="line"><a id="l00590" name="l00590"></a><span class="lineno">  590</span>    answer.push_back(</div>
+<div class="line"><a id="l00591" name="l00591"></a><span class="lineno">  591</span>        matrix3({row3({0, 2, 3}), row3({1, 5, 6}), row3({4, 7, 8})}));</div>
+<div class="line"><a id="l00592" name="l00592"></a><span class="lineno">  592</span>    answer.push_back(</div>
+<div class="line"><a id="l00593" name="l00593"></a><span class="lineno">  593</span>        matrix3({row3({1, 2, 3}), row3({0, 5, 6}), row3({4, 7, 8})}));</div>
+<div class="line"><a id="l00594" name="l00594"></a><span class="lineno">  594</span>    answer.push_back(</div>
+<div class="line"><a id="l00595" name="l00595"></a><span class="lineno">  595</span>        matrix3({row3({1, 2, 3}), row3({4, 5, 6}), row3({0, 7, 8})}));</div>
+<div class="line"><a id="l00596" name="l00596"></a><span class="lineno">  596</span>    answer.push_back(</div>
+<div class="line"><a id="l00597" name="l00597"></a><span class="lineno">  597</span>        matrix3({row3({1, 2, 3}), row3({4, 5, 6}), row3({7, 0, 8})}));</div>
+<div class="line"><a id="l00598" name="l00598"></a><span class="lineno">  598</span>    answer.push_back(</div>
+<div class="line"><a id="l00599" name="l00599"></a><span class="lineno">  599</span>        matrix3({row3({1, 2, 3}), row3({4, 5, 6}), row3({7, 8, 0})}));</div>
+<div class="line"><a id="l00600" name="l00600"></a><span class="lineno">  600</span> </div>
+<div class="line"><a id="l00601" name="l00601"></a><span class="lineno">  601</span>    <span class="keyword">auto</span> <a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a> = <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>.a_star_search(manhattan_distance);</div>
+<div class="line"><a id="l00602" name="l00602"></a><span class="lineno">  602</span>    std::cout &lt;&lt; <a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a>.size() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00603" name="l00603"></a><span class="lineno">  603</span> </div>
+<div class="line"><a id="l00604" name="l00604"></a><span class="lineno">  604</span>    assert(<a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a>.size() == answer.size());</div>
+<div class="line"><a id="l00605" name="l00605"></a><span class="lineno">  605</span> </div>
+<div class="line"><a id="l00606" name="l00606"></a><span class="lineno">  606</span>    uint32_t i = 0;</div>
+<div class="line"><a id="l00607" name="l00607"></a><span class="lineno">  607</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = <a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a>.rbegin(); it != <a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a>.rend(); ++it) {</div>
+<div class="line"><a id="l00608" name="l00608"></a><span class="lineno">  608</span>        assert(it-&gt;get_state() == answer[i]);</div>
+<div class="line"><a id="l00609" name="l00609"></a><span class="lineno">  609</span>        ++i;</div>
+<div class="line"><a id="l00610" name="l00610"></a><span class="lineno">  610</span>    }</div>
+<div class="line"><a id="l00611" name="l00611"></a><span class="lineno">  611</span> </div>
+<div class="line"><a id="l00612" name="l00612"></a><span class="lineno">  612</span>    <span class="comment">// 2nd test: A* search for complicated EightPuzzle problem</span></div>
+<div class="line"><a id="l00613" name="l00613"></a><span class="lineno">  613</span>    <span class="comment">// Initial state</span></div>
+<div class="line"><a id="l00614" name="l00614"></a><span class="lineno">  614</span>    puzzle[0] = row3({5, 7, 3});</div>
+<div class="line"><a id="l00615" name="l00615"></a><span class="lineno">  615</span>    puzzle[1] = row3({2, 0, 6});</div>
+<div class="line"><a id="l00616" name="l00616"></a><span class="lineno">  616</span>    puzzle[2] = row3({1, 4, 8});</div>
+<div class="line"><a id="l00617" name="l00617"></a><span class="lineno">  617</span>    <span class="comment">// Final state</span></div>
+<div class="line"><a id="l00618" name="l00618"></a><span class="lineno">  618</span>    ideal[0] = row3({1, 2, 3});</div>
+<div class="line"><a id="l00619" name="l00619"></a><span class="lineno">  619</span>    ideal[1] = row3({4, 5, 6});</div>
+<div class="line"><a id="l00620" name="l00620"></a><span class="lineno">  620</span>    ideal[2] = row3({7, 8, 0});</div>
+<div class="line"><a id="l00621" name="l00621"></a><span class="lineno">  621</span> </div>
+<div class="line"><a id="l00622" name="l00622"></a><span class="lineno">  622</span>    Puzzle = <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle&lt;&gt;</a>(puzzle);</div>
+<div class="line"><a id="l00623" name="l00623"></a><span class="lineno">  623</span>    Ideal = <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle&lt;&gt;</a>(ideal);</div>
+<div class="line"><a id="l00624" name="l00624"></a><span class="lineno">  624</span> </div>
+<div class="line"><a id="l00625" name="l00625"></a><span class="lineno">  625</span>    <span class="comment">// Initialize the search object</span></div>
+<div class="line"><a id="l00626" name="l00626"></a><span class="lineno">  626</span>    <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a> = <a class="code hl_class" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a>&lt;</div>
+<div class="line"><a id="l00627" name="l00627"></a><span class="lineno">  627</span>        <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle&lt;3&gt;</a>&gt;(Puzzle, Ideal);</div>
+<div class="line"><a id="l00628" name="l00628"></a><span class="lineno">  628</span> </div>
+<div class="line"><a id="l00629" name="l00629"></a><span class="lineno">  629</span>    <a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a> = <a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a>.a_star_search(manhattan_distance);</div>
+<div class="line"><a id="l00630" name="l00630"></a><span class="lineno">  630</span>    std::cout &lt;&lt; <a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a>.size() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00631" name="l00631"></a><span class="lineno">  631</span>    <span class="comment">// Static assertion due to large solution</span></div>
+<div class="line"><a id="l00632" name="l00632"></a><span class="lineno">  632</span>    assert(13 == <a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a>.size());</div>
+<div class="line"><a id="l00633" name="l00633"></a><span class="lineno">  633</span>    <span class="comment">// Check whether the final state is equal to expected one</span></div>
+<div class="line"><a id="l00634" name="l00634"></a><span class="lineno">  634</span>    assert(<a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a>[0].get_state() == ideal);</div>
+<div class="line"><a id="l00635" name="l00635"></a><span class="lineno">  635</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = <a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a>.rbegin(); it != <a class="code hl_class" href="../../dd/d4f/class_solution.html">Solution</a>.rend(); ++it) {</div>
+<div class="line"><a id="l00636" name="l00636"></a><span class="lineno">  636</span>        std::cout &lt;&lt; *it &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00637" name="l00637"></a><span class="lineno">  637</span>    }</div>
+<div class="line"><a id="l00638" name="l00638"></a><span class="lineno">  638</span> </div>
+<div class="line"><a id="l00639" name="l00639"></a><span class="lineno">  639</span>    <span class="comment">// 3rd test: A* search for 15-Puzzle</span></div>
+<div class="line"><a id="l00640" name="l00640"></a><span class="lineno">  640</span>    <span class="comment">// Initial State of the puzzle</span></div>
+<div class="line"><a id="l00641" name="l00641"></a><span class="lineno">  641</span>    matrix4 puzzle2;</div>
+<div class="line"><a id="l00642" name="l00642"></a><span class="lineno">  642</span>    puzzle2[0] = row4({10, 1, 6, 2});</div>
+<div class="line"><a id="l00643" name="l00643"></a><span class="lineno">  643</span>    puzzle2[1] = row4({5, 8, 4, 3});</div>
+<div class="line"><a id="l00644" name="l00644"></a><span class="lineno">  644</span>    puzzle2[2] = row4({13, 0, 7, 11});</div>
+<div class="line"><a id="l00645" name="l00645"></a><span class="lineno">  645</span>    puzzle2[3] = row4({14, 9, 15, 12});</div>
+<div class="line"><a id="l00646" name="l00646"></a><span class="lineno">  646</span>    <span class="comment">// Final state of the puzzle</span></div>
+<div class="line"><a id="l00647" name="l00647"></a><span class="lineno">  647</span>    matrix4 ideal2;</div>
+<div class="line"><a id="l00648" name="l00648"></a><span class="lineno">  648</span>    ideal2[0] = row4({1, 2, 3, 4});</div>
+<div class="line"><a id="l00649" name="l00649"></a><span class="lineno">  649</span>    ideal2[1] = row4({5, 6, 7, 8});</div>
+<div class="line"><a id="l00650" name="l00650"></a><span class="lineno">  650</span>    ideal2[2] = row4({9, 10, 11, 12});</div>
+<div class="line"><a id="l00651" name="l00651"></a><span class="lineno">  651</span>    ideal2[3] = row4({13, 14, 15, 0});</div>
+<div class="line"><a id="l00652" name="l00652"></a><span class="lineno">  652</span> </div>
+<div class="line"><a id="l00653" name="l00653"></a><span class="lineno">  653</span>    <span class="comment">// Instantiate states for a*, initial state and final states</span></div>
+<div class="line"><a id="l00654" name="l00654"></a><span class="lineno">  654</span>    <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle&lt;4&gt;</a> Puzzle2(puzzle2),</div>
+<div class="line"><a id="l00655" name="l00655"></a><span class="lineno">  655</span>        Ideal2(ideal2);</div>
+<div class="line"><a id="l00656" name="l00656"></a><span class="lineno">  656</span>    <span class="comment">// Initialize the search object</span></div>
+<div class="line"><a id="l00657" name="l00657"></a><span class="lineno">  657</span>    <a class="code hl_class" href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a>&lt;</div>
+<div class="line"><a id="l00658" name="l00658"></a><span class="lineno">  658</span>        <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle&lt;4&gt;</a>&gt;</div>
+<div class="line"><a id="l00659" name="l00659"></a><span class="lineno">  659</span>        search2(Puzzle2, Ideal2);</div>
+<div class="line"><a id="l00663" name="l00663"></a><span class="lineno">  663</span>    <span class="keyword">auto</span> manhattan_distance2 =</div>
+<div class="line"><a id="l00664" name="l00664"></a><span class="lineno">  664</span>        [](<span class="keyword">const</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle&lt;4&gt;</a> &amp;first,</div>
+<div class="line"><a id="l00665" name="l00665"></a><span class="lineno">  665</span>           <span class="keyword">const</span> <a class="code hl_class" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle&lt;4&gt;</a> &amp;second) {</div>
+<div class="line"><a id="l00666" name="l00666"></a><span class="lineno">  666</span>            uint32_t ret = 0;</div>
+<div class="line"><a id="l00667" name="l00667"></a><span class="lineno">  667</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>(); ++i) {</div>
+<div class="line"><a id="l00668" name="l00668"></a><span class="lineno">  668</span>                <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>(); ++j) {</div>
+<div class="line"><a id="l00669" name="l00669"></a><span class="lineno">  669</span>                    uint32_t <a class="code hl_function" href="../../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d">find</a> = first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420">get</a>(i, j);</div>
+<div class="line"><a id="l00670" name="l00670"></a><span class="lineno">  670</span>                    <span class="keywordtype">size_t</span> m = first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>(), n = first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>();</div>
+<div class="line"><a id="l00671" name="l00671"></a><span class="lineno">  671</span>                    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> k = 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> &lt; second.get_size(); ++<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>) {</div>
+<div class="line"><a id="l00672" name="l00672"></a><span class="lineno">  672</span>                        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> l = 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a> &lt; second.get_size(); ++<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">l</a>) {</div>
+<div class="line"><a id="l00673" name="l00673"></a><span class="lineno">  673</span>                            <span class="keywordflow">if</span> (find == second.get(k, l)) {</div>
+<div class="line"><a id="l00674" name="l00674"></a><span class="lineno">  674</span>                                std::tie(m, n) = std::make_pair(k, l);</div>
+<div class="line"><a id="l00675" name="l00675"></a><span class="lineno">  675</span>                                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00676" name="l00676"></a><span class="lineno">  676</span>                            }</div>
+<div class="line"><a id="l00677" name="l00677"></a><span class="lineno">  677</span>                        }</div>
+<div class="line"><a id="l00678" name="l00678"></a><span class="lineno">  678</span>                        <span class="keywordflow">if</span> (m != first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>()) {</div>
+<div class="line"><a id="l00679" name="l00679"></a><span class="lineno">  679</span>                            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00680" name="l00680"></a><span class="lineno">  680</span>                        }</div>
+<div class="line"><a id="l00681" name="l00681"></a><span class="lineno">  681</span>                    }</div>
+<div class="line"><a id="l00682" name="l00682"></a><span class="lineno">  682</span>                    <span class="keywordflow">if</span> (m != first.<a class="code hl_function" href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">get_size</a>()) {</div>
+<div class="line"><a id="l00683" name="l00683"></a><span class="lineno">  683</span>                        ret += (std::max(m, i) - std::min(m, i)) +</div>
+<div class="line"><a id="l00684" name="l00684"></a><span class="lineno">  684</span>                               (std::max(n, j) - std::min(n, j));</div>
+<div class="line"><a id="l00685" name="l00685"></a><span class="lineno">  685</span>                    }</div>
+<div class="line"><a id="l00686" name="l00686"></a><span class="lineno">  686</span>                }</div>
+<div class="line"><a id="l00687" name="l00687"></a><span class="lineno">  687</span>            }</div>
+<div class="line"><a id="l00688" name="l00688"></a><span class="lineno">  688</span>            <span class="keywordflow">return</span> ret;</div>
+<div class="line"><a id="l00689" name="l00689"></a><span class="lineno">  689</span>        };</div>
+<div class="line"><a id="l00690" name="l00690"></a><span class="lineno">  690</span> </div>
+<div class="line"><a id="l00691" name="l00691"></a><span class="lineno">  691</span>    <span class="keyword">auto</span> sol2 = search2.a_star_search(manhattan_distance2);</div>
+<div class="line"><a id="l00692" name="l00692"></a><span class="lineno">  692</span>    std::cout &lt;&lt; sol2.size() &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00693" name="l00693"></a><span class="lineno">  693</span> </div>
+<div class="line"><a id="l00694" name="l00694"></a><span class="lineno">  694</span>    <span class="comment">// Static assertion due to large solution</span></div>
+<div class="line"><a id="l00695" name="l00695"></a><span class="lineno">  695</span>    assert(24 == sol2.size());</div>
+<div class="line"><a id="l00696" name="l00696"></a><span class="lineno">  696</span>    <span class="comment">// Check whether the final state is equal to expected one</span></div>
+<div class="line"><a id="l00697" name="l00697"></a><span class="lineno">  697</span>    assert(sol2[0].get_state() == ideal2);</div>
+<div class="line"><a id="l00698" name="l00698"></a><span class="lineno">  698</span> </div>
+<div class="line"><a id="l00699" name="l00699"></a><span class="lineno">  699</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> it = sol2.rbegin(); it != sol2.rend(); ++it) {</div>
+<div class="line"><a id="l00700" name="l00700"></a><span class="lineno">  700</span>        std::cout &lt;&lt; *it &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00701" name="l00701"></a><span class="lineno">  701</span>    }</div>
+<div class="line"><a id="l00702" name="l00702"></a><span class="lineno">  702</span>}</div>
+<div class="line"><a id="l00707" name="l00707"></a><span class="lineno">  707</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00708" name="l00708"></a><span class="lineno">  708</span>    <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00709" name="l00709"></a><span class="lineno">  709</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00710" name="l00710"></a><span class="lineno">  710</span>}</div>
+<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00100">caesar_cipher.cpp:100</a></div></div>
+<div class="ttc" id="aclass_solution_html"><div class="ttname"><a href="../../dd/d4f/class_solution.html">Solution</a></div><div class="ttdef"><b>Definition</b> <a href="../../d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html#l00011">bridge_finding_with_tarjan_algorithm.cpp:11</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_ay_star_search_html"><div class="ttname"><a href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">machine_learning::aystar_search::AyStarSearch</a></div><div class="ttdoc">A class defining A* search algorithm. for some initial state and final state.</div><div class="ttdef"><b>Definition</b> <a href="#l00288">a_star_search.cpp:288</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_ay_star_search_html_a0a26aa9ad3d73707370d9fe83707aca4"><div class="ttname"><a href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4">machine_learning::aystar_search::AyStarSearch::Solution</a></div><div class="ttdeci">std::vector&lt; Puzzle &gt; Solution(std::shared_ptr&lt; Info &gt; FinalState, const MapOfPuzzleInfoWithPuzzleInfo &amp;parent_of)</div><div class="ttdoc">A helper solution: launches when a solution for AyStarSearch is found.</div><div class="ttdef"><b>Definition</b> <a href="#l00405">a_star_search.cpp:405</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_ay_star_search_html_a48284e156fdd48fd0c41008c7e48f201"><div class="ttname"><a href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a48284e156fdd48fd0c41008c7e48f201">machine_learning::aystar_search::AyStarSearch::a_star_search</a></div><div class="ttdeci">std::vector&lt; Puzzle &gt; a_star_search(const std::function&lt; uint32_t(const Puzzle &amp;, const Puzzle &amp;)&gt; &amp;dist, const uint32_t permissible_depth=30)</div><div class="ttdef"><b>Definition</b> <a href="#l00429">a_star_search.cpp:429</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_ay_star_search_html_abaff2ea6d309e1133fd95bbd1e39946e"><div class="ttname"><a href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e">machine_learning::aystar_search::AyStarSearch::AyStarSearch</a></div><div class="ttdeci">AyStarSearch(const Puzzle &amp;initial, const Puzzle &amp;final)</div><div class="ttdoc">Parameterized constructor for AyStarSearch.</div><div class="ttdef"><b>Definition</b> <a href="#l00392">a_star_search.cpp:392</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_ay_star_search_html_acd897e6e519849edb9fb0d1e1bfa881a"><div class="ttname"><a href="../../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#acd897e6e519849edb9fb0d1e1bfa881a">machine_learning::aystar_search::AyStarSearch::Info</a></div><div class="ttdeci">struct machine_learning::aystar_search::AyStarSearch::Info Info</div><div class="ttdoc">Struct that handles all the information related to the current state.</div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">machine_learning::aystar_search::EightPuzzle</a></div><div class="ttdoc">A class defining EightPuzzle/15-Puzzle game.</div><div class="ttdef"><b>Definition</b> <a href="#l00060">a_star_search.cpp:60</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a1802cf6197a255055cb734d626abc101"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101">machine_learning::aystar_search::EightPuzzle::operator=</a></div><div class="ttdeci">EightPuzzle &amp; operator=(EightPuzzle &amp;&amp;A) noexcept</div><div class="ttdoc">Move assignment operator.</div><div class="ttdef"><b>Definition</b> <a href="#l00165">a_star_search.cpp:165</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a194c2973b51a5467fc17064a4ea4e6f9"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a194c2973b51a5467fc17064a4ea4e6f9">machine_learning::aystar_search::EightPuzzle::~EightPuzzle</a></div><div class="ttdeci">~EightPuzzle()=default</div><div class="ttdoc">Destructor of EightPuzzle.</div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a26a976171392d257ca0f814ed73e0658"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658">machine_learning::aystar_search::EightPuzzle::generate_possible_moves</a></div><div class="ttdeci">std::vector&lt; EightPuzzle&lt; N &gt; &gt; generate_possible_moves()</div><div class="ttdoc">Find all possible states after processing all possible moves, given the current state of the puzzle.</div><div class="ttdef"><b>Definition</b> <a href="#l00176">a_star_search.cpp:176</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a3dc09f4742a0e1167ed202f7bf94721b"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">machine_learning::aystar_search::EightPuzzle::EightPuzzle</a></div><div class="ttdeci">EightPuzzle()</div><div class="ttdoc">Default constructor for EightPuzzle.</div><div class="ttdef"><b>Definition</b> <a href="#l00121">a_star_search.cpp:121</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a467e722dc1fcc82bfb4cef55744e04e2"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2">machine_learning::aystar_search::EightPuzzle::operator=</a></div><div class="ttdeci">EightPuzzle &amp; operator=(const EightPuzzle &amp;A)</div><div class="ttdoc">Copy assignment operator.</div><div class="ttdef"><b>Definition</b> <a href="#l00156">a_star_search.cpp:156</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a48d054230468b79037964f474d842b6e"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e">machine_learning::aystar_search::EightPuzzle::in_range</a></div><div class="ttdeci">bool in_range(const uint32_t value) const</div><div class="ttdoc">check whether the index value is bounded within the puzzle area</div><div class="ttdef"><b>Definition</b> <a href="#l00090">a_star_search.cpp:90</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a64815f10cf9fb9fdb4cc92731ccf10ba"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba">machine_learning::aystar_search::EightPuzzle::operator&lt;</a></div><div class="ttdeci">bool operator&lt;(const EightPuzzle&lt; N &gt; &amp;check) const</div><div class="ttdoc">check whether one board is lexicographically smaller</div><div class="ttdef"><b>Definition</b> <a href="#l00218">a_star_search.cpp:218</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a94f794bf44f424b1b0ca6ef9f4f6ebd3"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3">machine_learning::aystar_search::EightPuzzle::find_zero</a></div><div class="ttdeci">std::pair&lt; uint32_t, uint32_t &gt; find_zero()</div><div class="ttdoc">A helper array to evaluate the next state from current state;.</div><div class="ttdef"><b>Definition</b> <a href="#l00075">a_star_search.cpp:75</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_a9517e162e2988f7db052296bd550a742"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a9517e162e2988f7db052296bd550a742">machine_learning::aystar_search::EightPuzzle::operator&lt;&lt;</a></div><div class="ttdeci">friend std::ostream &amp; operator&lt;&lt;(std::ostream &amp;op, const EightPuzzle&lt; N &gt; &amp;SomeState)</div><div class="ttdoc">friend operator to display EightPuzzle&lt;&gt;</div><div class="ttdef"><b>Definition</b> <a href="#l00250">a_star_search.cpp:250</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_aa17e0227321b109ed91e156ac1332915"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915">machine_learning::aystar_search::EightPuzzle::operator==</a></div><div class="ttdeci">bool operator==(const EightPuzzle&lt; N &gt; &amp;check) const</div><div class="ttdoc">check whether two boards are equal</div><div class="ttdef"><b>Definition</b> <a href="#l00200">a_star_search.cpp:200</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_aa5c0486c7f29f323a2aced2ab33af420"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420">machine_learning::aystar_search::EightPuzzle::get</a></div><div class="ttdeci">uint32_t get(size_t i, size_t j) const</div><div class="ttdoc">get the value from i units from right and j units from left side of the board</div><div class="ttdef"><b>Definition</b> <a href="#l00102">a_star_search.cpp:102</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_aa73857052e69b86347859d9148933f71"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71">machine_learning::aystar_search::EightPuzzle::moves</a></div><div class="ttdeci">std::vector&lt; std::pair&lt; int8_t, int8_t &gt; &gt; moves</div><div class="ttdoc">N x N array to store the current state of the Puzzle.</div><div class="ttdef"><b>Definition</b> <a href="#l00064">a_star_search.cpp:64</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_ab7fd890a7ccf756e4b3313087b76a8c2"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2">machine_learning::aystar_search::EightPuzzle::EightPuzzle</a></div><div class="ttdeci">EightPuzzle(const std::array&lt; std::array&lt; uint32_t, N &gt;, N &gt; &amp;init)</div><div class="ttdoc">Parameterized Constructor for EightPuzzle.</div><div class="ttdef"><b>Definition</b> <a href="#l00132">a_star_search.cpp:132</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_ad45fde095ac00effe1fe00b1d85ff9c7"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7">machine_learning::aystar_search::EightPuzzle::EightPuzzle</a></div><div class="ttdeci">EightPuzzle(const EightPuzzle&lt; N &gt; &amp;A)</div><div class="ttdoc">Copy constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00139">a_star_search.cpp:139</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_ade14b0e1a88543b91426e2008e4d0f99"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99">machine_learning::aystar_search::EightPuzzle::get_state</a></div><div class="ttdeci">std::array&lt; std::array&lt; uint32_t, N &gt;, N &gt; get_state()</div><div class="ttdoc">Returns the current state of the board.</div><div class="ttdef"><b>Definition</b> <a href="#l00111">a_star_search.cpp:111</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_ae145ac4a0d2ec58945b58fad3c04f00f"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f">machine_learning::aystar_search::EightPuzzle::get_size</a></div><div class="ttdeci">size_t get_size() const</div><div class="ttdoc">returns the size of the EightPuzzle (number of row / column)</div><div class="ttdef"><b>Definition</b> <a href="#l00117">a_star_search.cpp:117</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_af22395b8e9e04222aa93a329523faef9"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9">machine_learning::aystar_search::EightPuzzle::EightPuzzle</a></div><div class="ttdeci">EightPuzzle(const EightPuzzle&lt; N &gt; &amp;&amp;A) noexcept</div><div class="ttdoc">Move constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00145">a_star_search.cpp:145</a></div></div>
+<div class="ttc" id="aclassmachine__learning_1_1aystar__search_1_1_eight_puzzle_html_af778034b2942ecac6df1e9ec8b5412ee"><div class="ttname"><a href="../../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee">machine_learning::aystar_search::EightPuzzle::operator&lt;=</a></div><div class="ttdeci">bool operator&lt;=(const EightPuzzle&lt; N &gt; &amp;check) const</div><div class="ttdoc">check whether one board is lexicographically smaller or equal</div><div class="ttdef"><b>Definition</b> <a href="#l00233">a_star_search.cpp:233</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a6d8df83a6f26ce24a75d3b358b7f5b8a"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a">numerical_methods::simpson_method::l</a></div><div class="ttdeci">double l(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00119">composite_simpson_rule.cpp:119</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespaceaystar__search_html"><div class="ttname"><a href="../../db/ddc/namespaceaystar__search.html">aystar_search</a></div><div class="ttdoc">Functions for A* Search implementation.</div></div>
+<div class="ttc" id="anamespacemachine__learning_html"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html">machine_learning</a></div><div class="ttdoc">A* search algorithm</div></div>
+<div class="ttc" id="anamespacequadratic__probing_html_a5ceee4128d92ca4412040b7104d1299d"><div class="ttname"><a href="../../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d">quadratic_probing::find</a></div><div class="ttdeci">Entry find(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../db/d71/quadratic__probing__hash__table_8cpp_source.html#l00131">quadratic_probing_hash_table.cpp:131</a></div></div>
+<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> <a href="../../df/dd5/binary__search_8cpp_source.html#l00047">binary_search.cpp:47</a></div></div>
+<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html">machine_learning::aystar_search::AyStarSearch::Info</a></div><div class="ttdoc">Struct that handles all the information related to the current state.</div><div class="ttdef"><b>Definition</b> <a href="#l00293">a_star_search.cpp:293</a></div></div>
+<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_a003a30bb165be50ce503c17df90c128d"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">machine_learning::aystar_search::AyStarSearch::Info::depth</a></div><div class="ttdeci">size_t depth</div><div class="ttdoc">stores h score</div><div class="ttdef"><b>Definition</b> <a href="#l00296">a_star_search.cpp:296</a></div></div>
+<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_a331d1070d008a4f9d55775a51013baa3"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3">machine_learning::aystar_search::AyStarSearch::Info::heuristic_value</a></div><div class="ttdeci">size_t heuristic_value</div><div class="ttdoc">Holds the current state.</div><div class="ttdef"><b>Definition</b> <a href="#l00295">a_star_search.cpp:295</a></div></div>
+<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_a572de12115e39e34dde6e68b707d59f5"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a572de12115e39e34dde6e68b707d59f5">machine_learning::aystar_search::AyStarSearch::Info::Info</a></div><div class="ttdeci">Info(const Info &amp;A)</div><div class="ttdoc">Copy constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00324">a_star_search.cpp:324</a></div></div>
+<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_a695e4314ebc3ab58e13004dc63599fe8"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a695e4314ebc3ab58e13004dc63599fe8">machine_learning::aystar_search::AyStarSearch::Info::Info</a></div><div class="ttdeci">Info(const Puzzle &amp;A)</div><div class="ttdoc">constructor having Puzzle as parameter</div><div class="ttdef"><b>Definition</b> <a href="#l00307">a_star_search.cpp:307</a></div></div>
+<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_a6abc89925ae7055a63b428e61525ad7a"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a6abc89925ae7055a63b428e61525ad7a">machine_learning::aystar_search::AyStarSearch::Info::Info</a></div><div class="ttdeci">Info(const Info &amp;&amp;A) noexcept</div><div class="ttdoc">Move constructor.</div><div class="ttdef"><b>Definition</b> <a href="#l00333">a_star_search.cpp:333</a></div></div>
+<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_aa816af5a64b37c86be8acda89fdefba2"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aa816af5a64b37c86be8acda89fdefba2">machine_learning::aystar_search::AyStarSearch::Info::~Info</a></div><div class="ttdeci">~Info()=default</div><div class="ttdoc">Destructor for Info.</div></div>
+<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_aaa7ea27346659f0abe2df82ca57fc5a7"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7">machine_learning::aystar_search::AyStarSearch::Info::Info</a></div><div class="ttdeci">Info()=default</div><div class="ttdoc">stores g score</div></div>
+<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_ac77d992953fa0de10a755e5a9aa06317"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317">machine_learning::aystar_search::AyStarSearch::Info::operator=</a></div><div class="ttdeci">Info &amp; operator=(const Info &amp;A)</div><div class="ttdoc">copy assignment operator</div><div class="ttdef"><b>Definition</b> <a href="#l00342">a_star_search.cpp:342</a></div></div>
+<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_ad3950824936488f66408313b1f8a8ca8"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3950824936488f66408313b1f8a8ca8">machine_learning::aystar_search::AyStarSearch::Info::Info</a></div><div class="ttdeci">Info(const Puzzle &amp;A, size_t h_value, size_t d)</div><div class="ttdoc">constructor having three parameters</div><div class="ttdef"><b>Definition</b> <a href="#l00315">a_star_search.cpp:315</a></div></div>
+<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info_html_ad3993dbca9c5b3ef9ac361dc7f62ce57"><div class="ttname"><a href="../../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3993dbca9c5b3ef9ac361dc7f62ce57">machine_learning::aystar_search::AyStarSearch::Info::operator=</a></div><div class="ttdeci">Info &amp; operator=(Info &amp;&amp;A) noexcept</div><div class="ttdoc">move assignment operator</div><div class="ttdef"><b>Definition</b> <a href="#l00353">a_star_search.cpp:353</a></div></div>
+<div class="ttc" id="astructmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator_html"><div class="ttname"><a href="../../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">machine_learning::aystar_search::AyStarSearch::comparison_operator</a></div><div class="ttdoc">Custom comparator for open_list.</div><div class="ttdef"><b>Definition</b> <a href="#l00370">a_star_search.cpp:370</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_3343723ae086de42ee4ca9774da3a13f.html">machine_learning</a></li><li class="navelem"><b>a_star_search.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dd/dfc/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d-members.html b/dd/dfc/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d-members.html
index a1a75d7b2..6f8f5b44a 100644
--- a/dd/dfc/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d-members.html
+++ b/dd/dfc/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html b/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html
index 2603a4ac1..0fba7b7d8 100644
--- a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html
+++ b/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph::is_graph_bipartite::Graph Class Reference</title>
+<title>TheAlgorithms/C++: graph::is_graph_bipartite::Graph Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -134,21 +151,20 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:aefea7ee87a708298c486d5a38ac628ef" id="r_aefea7ee87a708298c486d5a38ac628ef"><td class="memItemLeft" align="right" valign="top"><a id="aefea7ee87a708298c486d5a38ac628ef" name="aefea7ee87a708298c486d5a38ac628ef"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>n</b></td></tr>
-<tr class="memdesc:aefea7ee87a708298c486d5a38ac628ef"><td class="mdescLeft">&#160;</td><td class="mdescRight">size of the graph <br /></td></tr>
+<tr class="memitem:aefea7ee87a708298c486d5a38ac628ef" id="r_aefea7ee87a708298c486d5a38ac628ef"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aefea7ee87a708298c486d5a38ac628ef">n</a></td></tr>
+<tr class="memdesc:aefea7ee87a708298c486d5a38ac628ef"><td class="mdescLeft">&#160;</td><td class="mdescRight">size of the graph  <br /></td></tr>
 <tr class="separator:aefea7ee87a708298c486d5a38ac628ef"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ab0efcfa04fff8616aff0062522d1483f" id="r_ab0efcfa04fff8616aff0062522d1483f"><td class="memItemLeft" align="right" valign="top"><a id="ab0efcfa04fff8616aff0062522d1483f" name="ab0efcfa04fff8616aff0062522d1483f"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>adj</b></td></tr>
-<tr class="memdesc:ab0efcfa04fff8616aff0062522d1483f"><td class="mdescLeft">&#160;</td><td class="mdescRight">adj stores the graph as an adjacency list <br /></td></tr>
+<tr class="memitem:ab0efcfa04fff8616aff0062522d1483f" id="r_ab0efcfa04fff8616aff0062522d1483f"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::vector&lt; int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab0efcfa04fff8616aff0062522d1483f">adj</a></td></tr>
+<tr class="memdesc:ab0efcfa04fff8616aff0062522d1483f"><td class="mdescLeft">&#160;</td><td class="mdescRight">adj stores the graph as an adjacency list  <br /></td></tr>
 <tr class="separator:ab0efcfa04fff8616aff0062522d1483f"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a9d10768f927baa8a4d4a5ffce295b6b6" id="r_a9d10768f927baa8a4d4a5ffce295b6b6"><td class="memItemLeft" align="right" valign="top"><a id="a9d10768f927baa8a4d4a5ffce295b6b6" name="a9d10768f927baa8a4d4a5ffce295b6b6"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>side</b></td></tr>
-<tr class="memdesc:a9d10768f927baa8a4d4a5ffce295b6b6"><td class="mdescLeft">&#160;</td><td class="mdescRight">stores the side of the vertex <br /></td></tr>
+<tr class="memitem:a9d10768f927baa8a4d4a5ffce295b6b6" id="r_a9d10768f927baa8a4d4a5ffce295b6b6"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9d10768f927baa8a4d4a5ffce295b6b6">side</a></td></tr>
+<tr class="memdesc:a9d10768f927baa8a4d4a5ffce295b6b6"><td class="mdescLeft">&#160;</td><td class="mdescRight">stores the side of the vertex  <br /></td></tr>
 <tr class="separator:a9d10768f927baa8a4d4a5ffce295b6b6"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Class for representing graph as an adjacency list. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html#l00051">51</a> of file <a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html">is_graph_bipartite.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a6aef65b40347c4606662cad4dd2e14d3" name="a6aef65b40347c4606662cad4dd2e14d3"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a6aef65b40347c4606662cad4dd2e14d3">&#9670;&#160;</a></span>Graph()</h2>
@@ -180,21 +196,17 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>n</b></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html#l00065">65</a> of file <a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html">is_graph_bipartite.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   65</span>                             {</div>
 <div class="line"><span class="lineno">   66</span>        <a class="code hl_variable" href="#aefea7ee87a708298c486d5a38ac628ef">n</a> = size;</div>
-<div class="line"><span class="lineno">   67</span>        <a class="code hl_variable" href="#ab0efcfa04fff8616aff0062522d1483f">adj</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/resize.html">resize</a>(<a class="code hl_variable" href="#aefea7ee87a708298c486d5a38ac628ef">n</a>);</div>
-<div class="line"><span class="lineno">   68</span>        <a class="code hl_variable" href="#a9d10768f927baa8a4d4a5ffce295b6b6">side</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/resize.html">resize</a>(<a class="code hl_variable" href="#aefea7ee87a708298c486d5a38ac628ef">n</a>, -1);</div>
+<div class="line"><span class="lineno">   67</span>        <a class="code hl_variable" href="#ab0efcfa04fff8616aff0062522d1483f">adj</a>.resize(<a class="code hl_variable" href="#aefea7ee87a708298c486d5a38ac628ef">n</a>);</div>
+<div class="line"><span class="lineno">   68</span>        <a class="code hl_variable" href="#a9d10768f927baa8a4d4a5ffce295b6b6">side</a>.resize(<a class="code hl_variable" href="#aefea7ee87a708298c486d5a38ac628ef">n</a>, -1);</div>
 <div class="line"><span class="lineno">   69</span>    }</div>
-<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_a9d10768f927baa8a4d4a5ffce295b6b6"><div class="ttname"><a href="#a9d10768f927baa8a4d4a5ffce295b6b6">graph::is_graph_bipartite::Graph::side</a></div><div class="ttdeci">std::vector&lt; int &gt; side</div><div class="ttdoc">stores the side of the vertex</div><div class="ttdef"><b>Definition</b> is_graph_bipartite.cpp:58</div></div>
-<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_ab0efcfa04fff8616aff0062522d1483f"><div class="ttname"><a href="#ab0efcfa04fff8616aff0062522d1483f">graph::is_graph_bipartite::Graph::adj</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; adj</div><div class="ttdoc">adj stores the graph as an adjacency list</div><div class="ttdef"><b>Definition</b> is_graph_bipartite.cpp:56</div></div>
-<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_aefea7ee87a708298c486d5a38ac628ef"><div class="ttname"><a href="#aefea7ee87a708298c486d5a38ac628ef">graph::is_graph_bipartite::Graph::n</a></div><div class="ttdeci">int n</div><div class="ttdoc">size of the graph</div><div class="ttdef"><b>Definition</b> is_graph_bipartite.cpp:53</div></div>
-<div class="ttc" id="aresize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/resize.html">std::vector::resize</a></div><div class="ttdeci">T resize(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_cgraph.svg" width="348" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_a9d10768f927baa8a4d4a5ffce295b6b6"><div class="ttname"><a href="#a9d10768f927baa8a4d4a5ffce295b6b6">graph::is_graph_bipartite::Graph::side</a></div><div class="ttdeci">std::vector&lt; int &gt; side</div><div class="ttdoc">stores the side of the vertex</div><div class="ttdef"><b>Definition</b> <a href="../../d6/dd8/is__graph__bipartite_8cpp_source.html#l00058">is_graph_bipartite.cpp:58</a></div></div>
+<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_ab0efcfa04fff8616aff0062522d1483f"><div class="ttname"><a href="#ab0efcfa04fff8616aff0062522d1483f">graph::is_graph_bipartite::Graph::adj</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; adj</div><div class="ttdoc">adj stores the graph as an adjacency list</div><div class="ttdef"><b>Definition</b> <a href="../../d6/dd8/is__graph__bipartite_8cpp_source.html#l00056">is_graph_bipartite.cpp:56</a></div></div>
+<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_aefea7ee87a708298c486d5a38ac628ef"><div class="ttname"><a href="#aefea7ee87a708298c486d5a38ac628ef">graph::is_graph_bipartite::Graph::n</a></div><div class="ttdeci">int n</div><div class="ttdoc">size of the graph</div><div class="ttdef"><b>Definition</b> <a href="../../d6/dd8/is__graph__bipartite_8cpp_source.html#l00053">is_graph_bipartite.cpp:53</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Function Documentation</h2>
@@ -225,17 +237,13 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">   83</span>                                {</div>
-<div class="line"><span class="lineno">   84</span>    <a class="code hl_variable" href="#ab0efcfa04fff8616aff0062522d1483f">adj</a>[u - 1].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(v - 1);</div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_variable" href="#ab0efcfa04fff8616aff0062522d1483f">adj</a>[v - 1].<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(u - 1);</div>
-<div class="line"><span class="lineno">   86</span>}</div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a816cda7e563198f778fd32e03992763b_cgraph.svg" width="376" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html#l00083">83</a> of file <a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html">is_graph_bipartite.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   83</span>                                {</div>
+<div class="line"><span class="lineno">   84</span>    <a class="code hl_variable" href="#ab0efcfa04fff8616aff0062522d1483f">adj</a>[u - 1].push_back(v - 1);</div>
+<div class="line"><span class="lineno">   85</span>    <a class="code hl_variable" href="#ab0efcfa04fff8616aff0062522d1483f">adj</a>[v - 1].push_back(u - 1);</div>
+<div class="line"><span class="lineno">   86</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad475f8b838693812f7569a490729f373" name="ad475f8b838693812f7569a490729f373"></a>
@@ -259,9 +267,11 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd><code>true</code> if th graph is bipartite </dd>
 <dd>
 <code>false</code> otherwise </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html#l00106">106</a> of file <a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html">is_graph_bipartite.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  106</span>                         {</div>
-<div class="line"><span class="lineno">  107</span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a">check</a> = <span class="keyword">true</span>;</div>
-<div class="line"><span class="lineno">  108</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue&lt;int&gt;</a> q;</div>
+<div class="line"><span class="lineno">  107</span>    <span class="keywordtype">bool</span> check = <span class="keyword">true</span>;</div>
+<div class="line"><span class="lineno">  108</span>    std::queue&lt;int&gt; q;</div>
 <div class="line"><span class="lineno">  109</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> current_edge = 0; current_edge &lt; <a class="code hl_variable" href="#aefea7ee87a708298c486d5a38ac628ef">n</a>; ++current_edge) {</div>
 <div class="line"><span class="lineno">  110</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a9d10768f927baa8a4d4a5ffce295b6b6">side</a>[current_edge] == -1) {</div>
 <div class="line"><span class="lineno">  111</span>            q.push(current_edge);</div>
@@ -274,21 +284,98 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  118</span>                        <a class="code hl_variable" href="#a9d10768f927baa8a4d4a5ffce295b6b6">side</a>[neighbour] = (1 ^ <a class="code hl_variable" href="#a9d10768f927baa8a4d4a5ffce295b6b6">side</a>[current]);</div>
 <div class="line"><span class="lineno">  119</span>                        q.push(neighbour);</div>
 <div class="line"><span class="lineno">  120</span>                    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  121</span>                        <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a">check</a> &amp;= (<a class="code hl_variable" href="#a9d10768f927baa8a4d4a5ffce295b6b6">side</a>[neighbour] != <a class="code hl_variable" href="#a9d10768f927baa8a4d4a5ffce295b6b6">side</a>[current]);</div>
+<div class="line"><span class="lineno">  121</span>                        check &amp;= (<a class="code hl_variable" href="#a9d10768f927baa8a4d4a5ffce295b6b6">side</a>[neighbour] != <a class="code hl_variable" href="#a9d10768f927baa8a4d4a5ffce295b6b6">side</a>[current]);</div>
 <div class="line"><span class="lineno">  122</span>                    }</div>
 <div class="line"><span class="lineno">  123</span>                }</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>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a">check</a>;</div>
+<div class="line"><span class="lineno">  127</span>    <span class="keywordflow">return</span> check;</div>
 <div class="line"><span class="lineno">  128</span>}</div>
-<div class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div></div>
-<div class="ttc" id="aword__break_8cpp_html_a272b0f5cdb4e41fd6dee4538b808c06a"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a">dynamic_programming::word_break::check</a></div><div class="ttdeci">bool check(const std::string &amp;s, const std::unordered_set&lt; std::string &gt; &amp;strSet, int pos, std::vector&lt; int &gt; *dp)</div><div class="ttdoc">Function that checks if the string passed in param can be segmented from position 'pos',...</div><div class="ttdef"><b>Definition</b> word_break.cpp:80</div></div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="ab0efcfa04fff8616aff0062522d1483f" name="ab0efcfa04fff8616aff0062522d1483f"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ab0efcfa04fff8616aff0062522d1483f">&#9670;&#160;</a></span>adj</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::vector&lt;int&gt; &gt; graph::is_graph_bipartite::Graph::adj</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>adj stores the graph as an adjacency list </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html#l00056">56</a> of file <a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html">is_graph_bipartite.cpp</a>.</p>
+
+</div>
+</div>
+<a id="aefea7ee87a708298c486d5a38ac628ef" name="aefea7ee87a708298c486d5a38ac628ef"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aefea7ee87a708298c486d5a38ac628ef">&#9670;&#160;</a></span>n</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int graph::is_graph_bipartite::Graph::n</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>size of the graph </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html">is_graph_bipartite.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a9d10768f927baa8a4d4a5ffce295b6b6" name="a9d10768f927baa8a4d4a5ffce295b6b6"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a9d10768f927baa8a4d4a5ffce295b6b6">&#9670;&#160;</a></span>side</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;int&gt; graph::is_graph_bipartite::Graph::side</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>stores the side of the vertex </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html">is_graph_bipartite.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>graph/<a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp.html">is_graph_bipartite.cpp</a></li>
+<li>graph/<a class="el" href="../../d6/dd8/is__graph__bipartite_8cpp_source.html">is_graph_bipartite.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_cgraph.map b/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_cgraph.map
deleted file mode 100644
index f4dc53581..000000000
--- a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="graph::is_graph_bipartite::Graph::Graph" name="graph::is_graph_bipartite::Graph::Graph">
-<area shape="rect" id="Node000001" title="Constructor that initializes the graph on creation." alt="" coords="5,5,169,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="217,13,343,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="169,23,201,23,201,28,169,28"/>
-</map>
diff --git a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_cgraph.md5 b/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_cgraph.md5
deleted file mode 100644
index 540cfae26..000000000
--- a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-513e2961a4038d0113b53906effd71b6
\ No newline at end of file
diff --git a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_cgraph.svg b/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_cgraph.svg
deleted file mode 100644
index f41e6fe28..000000000
--- a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::is_graph_bipartite::Graph::Graph Pages: 1 -->
-<svg width="261pt" height="39pt"
- viewBox="0.00 0.00 261.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>graph::is_graph_bipartite::Graph::Graph</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Constructor that initializes the graph on creation.">
-<polygon fill="#999999" stroke="#666666" points="122.5,-30.5 0,-30.5 0,0 122.5,0 122.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::is_graph_bipartite</text>
-<text text-anchor="middle" x="61.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Graph::Graph</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.25,-24.88 158.5,-24.88 158.5,-5.63 253.25,-5.63 253.25,-24.88"/>
-<text text-anchor="middle" x="205.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.74,-15.25C130.69,-15.25 138.84,-15.25 146.75,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.63,-18.75 156.63,-15.25 146.63,-11.75 146.63,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_cgraph_org.svg b/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_cgraph_org.svg
deleted file mode 100644
index b4da53b18..000000000
--- a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a6aef65b40347c4606662cad4dd2e14d3_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::is_graph_bipartite::Graph::Graph Pages: 1 -->
-<svg width="261pt" height="39pt"
- viewBox="0.00 0.00 261.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>graph::is_graph_bipartite::Graph::Graph</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Constructor that initializes the graph on creation.">
-<polygon fill="#999999" stroke="#666666" points="122.5,-30.5 0,-30.5 0,0 122.5,0 122.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::is_graph_bipartite</text>
-<text text-anchor="middle" x="61.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Graph::Graph</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.25,-24.88 158.5,-24.88 158.5,-5.63 253.25,-5.63 253.25,-24.88"/>
-<text text-anchor="middle" x="205.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.74,-15.25C130.69,-15.25 138.84,-15.25 146.75,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.63,-18.75 156.63,-15.25 146.63,-11.75 146.63,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a816cda7e563198f778fd32e03992763b_cgraph.map b/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a816cda7e563198f778fd32e03992763b_cgraph.map
deleted file mode 100644
index dbd4bbf88..000000000
--- a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a816cda7e563198f778fd32e03992763b_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="graph::is_graph_bipartite::Graph::addEdge" name="graph::is_graph_bipartite::Graph::addEdge">
-<area shape="rect" id="Node000001" title="Function that add an edge between two nodes or vertices of graph." alt="" coords="5,5,169,46"/>
-<area shape="rect" id="Node000002" 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="217,13,371,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="169,23,201,23,201,28,169,28"/>
-</map>
diff --git a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a816cda7e563198f778fd32e03992763b_cgraph.md5 b/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a816cda7e563198f778fd32e03992763b_cgraph.md5
deleted file mode 100644
index 7d2986496..000000000
--- a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a816cda7e563198f778fd32e03992763b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c7976a348c708cb6c3e2522507d5e91a
\ No newline at end of file
diff --git a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a816cda7e563198f778fd32e03992763b_cgraph.svg b/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a816cda7e563198f778fd32e03992763b_cgraph.svg
deleted file mode 100644
index cbb4935a6..000000000
--- a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a816cda7e563198f778fd32e03992763b_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::is_graph_bipartite::Graph::addEdge Pages: 1 -->
-<svg width="282pt" height="39pt"
- viewBox="0.00 0.00 282.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>graph::is_graph_bipartite::Graph::addEdge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that add an edge between two nodes or vertices of graph.">
-<polygon fill="#999999" stroke="#666666" points="122.5,-30.5 0,-30.5 0,0 122.5,0 122.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::is_graph_bipartite</text>
-<text text-anchor="middle" x="61.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.25,-24.88 158.5,-24.88 158.5,-5.63 274.25,-5.63 274.25,-24.88"/>
-<text text-anchor="middle" x="216.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.77,-15.25C130.72,-15.25 138.92,-15.25 146.99,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.78,-18.75 156.78,-15.25 146.78,-11.75 146.78,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a816cda7e563198f778fd32e03992763b_cgraph_org.svg b/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a816cda7e563198f778fd32e03992763b_cgraph_org.svg
deleted file mode 100644
index 1db09de47..000000000
--- a/de/d00/classgraph_1_1is__graph__bipartite_1_1_graph_a816cda7e563198f778fd32e03992763b_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::is_graph_bipartite::Graph::addEdge Pages: 1 -->
-<svg width="282pt" height="39pt"
- viewBox="0.00 0.00 282.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>graph::is_graph_bipartite::Graph::addEdge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that add an edge between two nodes or vertices of graph.">
-<polygon fill="#999999" stroke="#666666" points="122.5,-30.5 0,-30.5 0,0 122.5,0 122.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::is_graph_bipartite</text>
-<text text-anchor="middle" x="61.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.25,-24.88 158.5,-24.88 158.5,-5.63 274.25,-5.63 274.25,-24.88"/>
-<text text-anchor="middle" x="216.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.77,-15.25C130.72,-15.25 138.92,-15.25 146.99,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.78,-18.75 156.78,-15.25 146.78,-11.75 146.78,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d07/cycle__sort_8cpp.html b/de/d07/cycle__sort_8cpp.html
index 30e52883f..5de4e0e92 100644
--- a/de/d07/cycle__sort_8cpp.html
+++ b/de/d07/cycle__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/cycle_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/cycle_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for cycle_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/deb/cycle__sort_8cpp__incl.svg" width="434" height="111"><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">
+</div>
+<p><a href="../../de/d07/cycle__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -136,7 +155,7 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:ae79a9d247691fce0d655fce75f1c04fa" id="r_ae79a9d247691fce0d655fce75f1c04fa"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:ae79a9d247691fce0d655fce75f1c04fa"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae79a9d247691fce0d655fce75f1c04fa">sorting::cycle_sort::cycleSort</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;in_arr)</td></tr>
+<tr class="memitem:ae79a9d247691fce0d655fce75f1c04fa"><td class="memTemplItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ae79a9d247691fce0d655fce75f1c04fa">sorting::cycle_sort::cycleSort</a> (const std::vector&lt; T &gt; &amp;in_arr)</td></tr>
 <tr class="memdesc:ae79a9d247691fce0d655fce75f1c04fa"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function implements cycleSort.  <br /></td></tr>
 <tr class="separator:ae79a9d247691fce0d655fce75f1c04fa"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -149,6 +168,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Cycle_sort" target="_blank">Cycle sort</a> algorithm. </p>
 <p>Cycle Sort is a sorting algorithm that works in \(O(n^2)\) time in the best case and works in \(O(n^2)\) in worst case. If a element is already at its correct position, do nothing. If a element is not at its correct position, we then need to move it to its correct position by computing the correct positions.Therefore, we should make sure the duplicate elements. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/dalaoqi" target="_blank">TsungHan Ho</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../de/d07/cycle__sort_8cpp_source.html">cycle_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae79a9d247691fce0d655fce75f1c04fa" name="ae79a9d247691fce0d655fce75f1c04fa"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae79a9d247691fce0d655fce75f1c04fa">&#9670;&#160;</a></span>cycleSort()</h2>
@@ -159,9 +180,9 @@ Functions</h2></td></tr>
 template&lt;typename T &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; sorting::cycle_sort::cycleSort </td>
+          <td class="memname">std::vector&lt; T &gt; sorting::cycle_sort::cycleSort </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>in_arr</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>in_arr</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -181,8 +202,10 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d07/cycle__sort_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../de/d07/cycle__sort_8cpp_source.html">cycle_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   38</span>                                                   {</div>
-<div class="line"><span class="lineno">   39</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> arr(in_arr);</div>
+<div class="line"><span class="lineno">   39</span>    std::vector&lt;T&gt; arr(in_arr);</div>
 <div class="line"><span class="lineno">   40</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> cycle_start = 0; cycle_start &lt;= arr.size() - 1; cycle_start++) {</div>
 <div class="line"><span class="lineno">   41</span>        <span class="comment">// initialize item</span></div>
 <div class="line"><span class="lineno">   42</span>        T item = arr[cycle_start];</div>
@@ -206,7 +229,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   60</span>        <span class="keywordflow">if</span> (pos == cycle_start) {</div>
 <div class="line"><span class="lineno">   61</span>            <span class="keywordflow">continue</span>;</div>
 <div class="line"><span class="lineno">   62</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   63</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(item, arr[pos]);</div>
+<div class="line"><span class="lineno">   63</span>            std::swap(item, arr[pos]);</div>
 <div class="line"><span class="lineno">   64</span>        }</div>
 <div class="line"><span class="lineno">   65</span>        <span class="comment">// Rest of the  elements</span></div>
 <div class="line"><span class="lineno">   66</span>        <span class="keywordflow">while</span> (pos != cycle_start) {</div>
@@ -222,20 +245,13 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   76</span>            <span class="keywordflow">if</span> (item == arr[pos]) {</div>
 <div class="line"><span class="lineno">   77</span>                <span class="keywordflow">continue</span>;</div>
 <div class="line"><span class="lineno">   78</span>            } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   79</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(item, arr[pos]);</div>
+<div class="line"><span class="lineno">   79</span>                std::swap(item, arr[pos]);</div>
 <div class="line"><span class="lineno">   80</span>            }</div>
 <div class="line"><span class="lineno">   81</span>        }</div>
 <div class="line"><span class="lineno">   82</span>    }</div>
 <div class="line"><span class="lineno">   83</span>    <span class="keywordflow">return</span> arr;</div>
 <div class="line"><span class="lineno">   84</span>}</div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-<div class="ttc" id="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d07/cycle__sort_8cpp_ae79a9d247691fce0d655fce75f1c04fa_cgraph.svg" width="303" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -255,17 +271,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d07/cycle__sort_8cpp_source.html#l00128">128</a> of file <a class="el" href="../../de/d07/cycle__sort_8cpp_source.html">cycle_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  128</span>           {</div>
 <div class="line"><span class="lineno">  129</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the test</span></div>
 <div class="line"><span class="lineno">  130</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  131</span>}</div>
-<div class="ttc" id="acycle__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> cycle_sort.cpp:92</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="300" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acycle__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d07/cycle__sort_8cpp_source.html#l00092">cycle_sort.cpp:92</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -293,49 +306,41 @@ Here is the call graph for this function:</div>
 
 <p>Test implementations. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d07/cycle__sort_8cpp_source.html#l00092">92</a> of file <a class="el" href="../../de/d07/cycle__sort_8cpp_source.html">cycle_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   92</span>                   {</div>
 <div class="line"><span class="lineno">   93</span>    <span class="comment">// Test 1</span></div>
 <div class="line"><span class="lineno">   94</span>    <span class="comment">// [4, 3, 2, 1] return [1, 2, 3, 4]</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&lt;uint32_t&gt;</a> array1 = {4, 3, 2, 1};</div>
-<div class="line"><span class="lineno">   96</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</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&lt;uint32_t&gt;</a> arr1 = <a class="code hl_function" href="#ae79a9d247691fce0d655fce75f1c04fa">sorting::cycle_sort::cycleSort</a>(array1);</div>
-<div class="line"><span class="lineno">   98</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr1), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr1)));</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> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   95</span>    std::vector&lt;uint32_t&gt; array1 = {4, 3, 2, 1};</div>
+<div class="line"><span class="lineno">   96</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
+<div class="line"><span class="lineno">   97</span>    std::vector&lt;uint32_t&gt; arr1 = <a class="code hl_function" href="#ae79a9d247691fce0d655fce75f1c04fa">sorting::cycle_sort::cycleSort</a>(array1);</div>
+<div class="line"><span class="lineno">   98</span>    assert(std::is_sorted(std::begin(arr1), std::end(arr1)));</div>
+<div class="line"><span class="lineno">   99</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  100</span> </div>
 <div class="line"><span class="lineno">  101</span>    <span class="comment">// [4.3, -6.5, -7.4, 0, 2.7, 1.8] return [-7.4, -6.5, 0, 1.8, 2.7, 4.3]</span></div>
-<div class="line"><span class="lineno">  102</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> array2 = {4.3, -6.5, -7.4, 0, 2.7, 1.8};</div>
-<div class="line"><span class="lineno">  103</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</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&lt;double&gt;</a> arr2 = <a class="code hl_function" href="#ae79a9d247691fce0d655fce75f1c04fa">sorting::cycle_sort::cycleSort</a>(array2);</div>
-<div class="line"><span class="lineno">  105</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr2), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr2)));</div>
-<div class="line"><span class="lineno">  106</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  102</span>    std::vector&lt;double&gt; array2 = {4.3, -6.5, -7.4, 0, 2.7, 1.8};</div>
+<div class="line"><span class="lineno">  103</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
+<div class="line"><span class="lineno">  104</span>    std::vector&lt;double&gt; arr2 = <a class="code hl_function" href="#ae79a9d247691fce0d655fce75f1c04fa">sorting::cycle_sort::cycleSort</a>(array2);</div>
+<div class="line"><span class="lineno">  105</span>    assert(std::is_sorted(std::begin(arr2), std::end(arr2)));</div>
+<div class="line"><span class="lineno">  106</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  107</span> </div>
 <div class="line"><span class="lineno">  108</span>    <span class="comment">// Test 3</span></div>
 <div class="line"><span class="lineno">  109</span>    <span class="comment">// [3, 3, 3, 3] return [3, 3, 3, 3]</span></div>
-<div class="line"><span class="lineno">  110</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a> array3 = {3, 3, 3, 3};</div>
-<div class="line"><span class="lineno">  111</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
-<div class="line"><span class="lineno">  112</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a> arr3 = <a class="code hl_function" href="#ae79a9d247691fce0d655fce75f1c04fa">sorting::cycle_sort::cycleSort</a>(array3);</div>
-<div class="line"><span class="lineno">  113</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr3), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr3)));</div>
-<div class="line"><span class="lineno">  114</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  110</span>    std::vector&lt;uint32_t&gt; array3 = {3, 3, 3, 3};</div>
+<div class="line"><span class="lineno">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
+<div class="line"><span class="lineno">  112</span>    std::vector&lt;uint32_t&gt; arr3 = <a class="code hl_function" href="#ae79a9d247691fce0d655fce75f1c04fa">sorting::cycle_sort::cycleSort</a>(array3);</div>
+<div class="line"><span class="lineno">  113</span>    assert(std::is_sorted(std::begin(arr3), std::end(arr3)));</div>
+<div class="line"><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  115</span> </div>
 <div class="line"><span class="lineno">  116</span>    <span class="comment">// [9, 4, 6, 8, 14, 3] return [9, 4, 6, 8, 14, 3]</span></div>
-<div class="line"><span class="lineno">  117</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a> array4 = {3, 4, 6, 8, 9, 14};</div>
-<div class="line"><span class="lineno">  118</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 4... &quot;</span>;</div>
-<div class="line"><span class="lineno">  119</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a> arr4 = <a class="code hl_function" href="#ae79a9d247691fce0d655fce75f1c04fa">sorting::cycle_sort::cycleSort</a>(array4);</div>
-<div class="line"><span class="lineno">  120</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(arr4), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(arr4)));</div>
-<div class="line"><span class="lineno">  121</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  117</span>    std::vector&lt;uint32_t&gt; array4 = {3, 4, 6, 8, 9, 14};</div>
+<div class="line"><span class="lineno">  118</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4... &quot;</span>;</div>
+<div class="line"><span class="lineno">  119</span>    std::vector&lt;uint32_t&gt; arr4 = <a class="code hl_function" href="#ae79a9d247691fce0d655fce75f1c04fa">sorting::cycle_sort::cycleSort</a>(array4);</div>
+<div class="line"><span class="lineno">  120</span>    assert(std::is_sorted(std::begin(arr4), std::end(arr4)));</div>
+<div class="line"><span class="lineno">  121</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  122</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="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="acycle__sort_8cpp_html_ae79a9d247691fce0d655fce75f1c04fa"><div class="ttname"><a href="#ae79a9d247691fce0d655fce75f1c04fa">sorting::cycle_sort::cycleSort</a></div><div class="ttdeci">std::vector&lt; T &gt; cycleSort(const std::vector&lt; T &gt; &amp;in_arr)</div><div class="ttdoc">The main function implements cycleSort.</div><div class="ttdef"><b>Definition</b> cycle_sort.cpp:38</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="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="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="203" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acycle__sort_8cpp_html_ae79a9d247691fce0d655fce75f1c04fa"><div class="ttname"><a href="#ae79a9d247691fce0d655fce75f1c04fa">sorting::cycle_sort::cycleSort</a></div><div class="ttdeci">std::vector&lt; T &gt; cycleSort(const std::vector&lt; T &gt; &amp;in_arr)</div><div class="ttdoc">The main function implements cycleSort.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d07/cycle__sort_8cpp_source.html#l00038">cycle_sort.cpp:38</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 1def0d1d8..000000000
--- a/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Test implementations." alt="" coords="5,80,49,106"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="108,5,186,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="43,77,95,40,101,36,104,41,98,44,46,82"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="113,55,181,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="49,86,97,75,98,81,50,91"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="111,104,182,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="50,95,97,104,96,109,49,100"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="97,153,197,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="47,104,98,140,104,143,101,148,95,144,44,108"/>
-</map>
diff --git a/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index bc6090fc9..000000000
--- a/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-814211add6fc98ca4e727497a379d817
\ No newline at end of file
diff --git a/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 765c5f573..000000000
--- a/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="152pt" height="138pt"
- viewBox="0.00 0.00 151.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-74.25 0,-74.25 0,-55 32.5,-55 32.5,-74.25"/>
-<text text-anchor="middle" x="16.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.5,-130.25 76.75,-130.25 76.75,-111 135.5,-111 135.5,-130.25"/>
-<text text-anchor="middle" x="106.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.44,-74.65C39.56,-82.73 54.5,-94.09 68.5,-102.62 69.94,-103.5 71.42,-104.37 72.93,-105.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.27,-108.3 81.75,-109.89 74.55,-102.12 71.27,-108.3"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="131.75,-93.25 80.5,-93.25 80.5,-74 131.75,-74 131.75,-93.25"/>
-<text text-anchor="middle" x="106.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-68.02C43.01,-70.2 56.49,-73.11 69.07,-75.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.26,-79.23 78.77,-77.93 69.74,-72.39 68.26,-79.23"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.88,-56.25 79.38,-56.25 79.38,-37 132.88,-37 132.88,-56.25"/>
-<text text-anchor="middle" x="106.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-61.41C42.79,-59.39 55.88,-56.71 68.22,-54.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.64,-57.67 77.73,-52.24 67.23,-50.81 68.64,-57.67"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.75,-19.25 68.5,-19.25 68.5,0 143.75,0 143.75,-19.25"/>
-<text text-anchor="middle" x="106.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.9,-54.57C40.03,-46.75 54.77,-35.88 68.5,-27.62 69.94,-26.76 71.43,-25.9 72.95,-25.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.56,-28.16 81.77,-20.4 71.29,-21.96 74.56,-28.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 77c2ed5d7..000000000
--- a/de/d07/cycle__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="152pt" height="138pt"
- viewBox="0.00 0.00 151.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-74.25 0,-74.25 0,-55 32.5,-55 32.5,-74.25"/>
-<text text-anchor="middle" x="16.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.5,-130.25 76.75,-130.25 76.75,-111 135.5,-111 135.5,-130.25"/>
-<text text-anchor="middle" x="106.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.44,-74.65C39.56,-82.73 54.5,-94.09 68.5,-102.62 69.94,-103.5 71.42,-104.37 72.93,-105.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="71.27,-108.3 81.75,-109.89 74.55,-102.12 71.27,-108.3"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="131.75,-93.25 80.5,-93.25 80.5,-74 131.75,-74 131.75,-93.25"/>
-<text text-anchor="middle" x="106.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-68.02C43.01,-70.2 56.49,-73.11 69.07,-75.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.26,-79.23 78.77,-77.93 69.74,-72.39 68.26,-79.23"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.88,-56.25 79.38,-56.25 79.38,-37 132.88,-37 132.88,-56.25"/>
-<text text-anchor="middle" x="106.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-61.41C42.79,-59.39 55.88,-56.71 68.22,-54.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.64,-57.67 77.73,-52.24 67.23,-50.81 68.64,-57.67"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.75,-19.25 68.5,-19.25 68.5,0 143.75,0 143.75,-19.25"/>
-<text text-anchor="middle" x="106.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.9,-54.57C40.03,-46.75 54.77,-35.88 68.5,-27.62 69.94,-26.76 71.43,-25.9 72.95,-25.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.56,-28.16 81.77,-20.4 71.29,-21.96 74.56,-28.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 163f126f2..000000000
--- a/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,80,55,106"/>
-<area shape="rect" id="Node000002" href="$de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Test implementations." alt="" coords="103,80,146,106"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,90,87,90,87,96,55,96"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="205,5,283,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="140,77,193,40,199,36,201,41,195,44,143,82"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="210,55,278,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="146,86,194,75,195,81,147,91"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="208,104,280,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="147,95,194,104,193,109,146,100"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="194,153,294,179"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="144,104,195,140,201,143,199,148,193,144,141,108"/>
-</map>
diff --git a/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index be5cf0555..000000000
--- a/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f9e978965bcaacbe5cb0761844641eae
\ No newline at end of file
diff --git a/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 4a1f00f5f..000000000
--- a/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="225pt" height="138pt"
- viewBox="0.00 0.00 224.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-74.25 73,-74.25 73,-55 105.5,-55 105.5,-74.25"/>
-<text text-anchor="middle" x="89.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-64.62C44.58,-64.62 53.31,-64.62 61.45,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-68.13 71.2,-64.63 61.2,-61.13 61.2,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="208.5,-130.25 149.75,-130.25 149.75,-111 208.5,-111 208.5,-130.25"/>
-<text text-anchor="middle" x="179.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.44,-74.65C112.56,-82.73 127.5,-94.09 141.5,-102.62 142.94,-103.5 144.42,-104.37 145.93,-105.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.27,-108.3 154.75,-109.89 147.55,-102.12 144.27,-108.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.75,-93.25 153.5,-93.25 153.5,-74 204.75,-74 204.75,-93.25"/>
-<text text-anchor="middle" x="179.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-68.02C116.01,-70.2 129.49,-73.11 142.07,-75.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.26,-79.23 151.77,-77.93 142.74,-72.39 141.26,-79.23"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="205.88,-56.25 152.38,-56.25 152.38,-37 205.88,-37 205.88,-56.25"/>
-<text text-anchor="middle" x="179.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-61.41C115.79,-59.39 128.88,-56.71 141.22,-54.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.64,-57.67 150.73,-52.24 140.23,-50.81 141.64,-57.67"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.75,-19.25 141.5,-19.25 141.5,0 216.75,0 216.75,-19.25"/>
-<text text-anchor="middle" x="179.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.9,-54.57C113.03,-46.75 127.77,-35.88 141.5,-27.62 142.94,-26.76 144.43,-25.9 145.95,-25.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.56,-28.16 154.77,-20.4 144.29,-21.96 147.56,-28.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index dfa4763ec..000000000
--- a/de/d07/cycle__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="225pt" height="138pt"
- viewBox="0.00 0.00 224.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
-<text text-anchor="middle" x="18.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-74.25 73,-74.25 73,-55 105.5,-55 105.5,-74.25"/>
-<text text-anchor="middle" x="89.25" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-64.62C44.58,-64.62 53.31,-64.62 61.45,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-68.13 71.2,-64.63 61.2,-61.13 61.2,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="208.5,-130.25 149.75,-130.25 149.75,-111 208.5,-111 208.5,-130.25"/>
-<text text-anchor="middle" x="179.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.44,-74.65C112.56,-82.73 127.5,-94.09 141.5,-102.62 142.94,-103.5 144.42,-104.37 145.93,-105.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.27,-108.3 154.75,-109.89 147.55,-102.12 144.27,-108.3"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.75,-93.25 153.5,-93.25 153.5,-74 204.75,-74 204.75,-93.25"/>
-<text text-anchor="middle" x="179.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-68.02C116.01,-70.2 129.49,-73.11 142.07,-75.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.26,-79.23 151.77,-77.93 142.74,-72.39 141.26,-79.23"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="205.88,-56.25 152.38,-56.25 152.38,-37 205.88,-37 205.88,-56.25"/>
-<text text-anchor="middle" x="179.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.96,-61.41C115.79,-59.39 128.88,-56.71 141.22,-54.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.64,-57.67 150.73,-52.24 140.23,-50.81 141.64,-57.67"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.75,-19.25 141.5,-19.25 141.5,0 216.75,0 216.75,-19.25"/>
-<text text-anchor="middle" x="179.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.9,-54.57C113.03,-46.75 127.77,-35.88 141.5,-27.62 142.94,-26.76 144.43,-25.9 145.95,-25.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.56,-28.16 154.77,-20.4 144.29,-21.96 147.56,-28.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d07/cycle__sort_8cpp_ae79a9d247691fce0d655fce75f1c04fa_cgraph.map b/de/d07/cycle__sort_8cpp_ae79a9d247691fce0d655fce75f1c04fa_cgraph.map
deleted file mode 100644
index d738e9dc7..000000000
--- a/de/d07/cycle__sort_8cpp_ae79a9d247691fce0d655fce75f1c04fa_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="sorting::cycle_sort::cycleSort" name="sorting::cycle_sort::cycleSort">
-<area shape="rect" id="Node000001" title="The main function implements cycleSort." alt="" coords="5,29,134,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="37,29,35,19,41,11,52,5,70,3,88,5,99,11,97,16,87,10,69,8,54,10,44,14,40,20,42,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="182,12,297,37"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="134,37,166,33,167,38,134,43"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="200,61,278,86"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="134,56,185,63,185,69,134,61"/>
-</map>
diff --git a/de/d07/cycle__sort_8cpp_ae79a9d247691fce0d655fce75f1c04fa_cgraph.md5 b/de/d07/cycle__sort_8cpp_ae79a9d247691fce0d655fce75f1c04fa_cgraph.md5
deleted file mode 100644
index f19ffedde..000000000
--- a/de/d07/cycle__sort_8cpp_ae79a9d247691fce0d655fce75f1c04fa_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cab70dd1dbab4310e027b24f9963c763
\ No newline at end of file
diff --git a/de/d07/cycle__sort_8cpp_ae79a9d247691fce0d655fce75f1c04fa_cgraph.svg b/de/d07/cycle__sort_8cpp_ae79a9d247691fce0d655fce75f1c04fa_cgraph.svg
deleted file mode 100644
index 2adae982a..000000000
--- a/de/d07/cycle__sort_8cpp_ae79a9d247691fce0d655fce75f1c04fa_cgraph.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::cycle_sort::cycleSort Pages: 1 -->
-<svg width="227pt" height="69pt"
- viewBox="0.00 0.00 226.75 68.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64.88)">
-<title>sorting::cycle_sort::cycleSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function implements cycleSort.">
-<polygon fill="#999999" stroke="#666666" points="96.25,-42.88 0,-42.88 0,-12.37 96.25,-12.37 96.25,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::cycle_sort</text>
-<text text-anchor="middle" x="48.12" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::cycleSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.55,-43.36C20.95,-52.43 28.47,-60.88 48.12,-60.88 58.87,-60.88 65.99,-58.35 69.49,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.94,-55.18 70.53,-44.87 65.98,-54.43 72.94,-55.18"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="218.75,-56.25 132.25,-56.25 132.25,-37 218.75,-37 218.75,-56.25"/>
-<text text-anchor="middle" x="175.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-34.81C104.44,-36.01 112.71,-37.26 120.77,-38.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.07,-41.92 130.48,-39.95 121.12,-35 120.07,-41.92"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.88,-19.25 146.12,-19.25 146.12,0 204.88,0 204.88,-19.25"/>
-<text text-anchor="middle" x="175.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-20.82C109.14,-19.01 122.63,-17.07 134.78,-15.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.05,-18.82 144.45,-13.94 134.06,-11.9 135.05,-18.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d07/cycle__sort_8cpp_ae79a9d247691fce0d655fce75f1c04fa_cgraph_org.svg b/de/d07/cycle__sort_8cpp_ae79a9d247691fce0d655fce75f1c04fa_cgraph_org.svg
deleted file mode 100644
index d95b9d0cb..000000000
--- a/de/d07/cycle__sort_8cpp_ae79a9d247691fce0d655fce75f1c04fa_cgraph_org.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::cycle_sort::cycleSort Pages: 1 -->
-<svg width="227pt" height="69pt"
- viewBox="0.00 0.00 226.75 68.88" 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 64.88)">
-<title>sorting::cycle_sort::cycleSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function implements cycleSort.">
-<polygon fill="#999999" stroke="#666666" points="96.25,-42.88 0,-42.88 0,-12.37 96.25,-12.37 96.25,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::cycle_sort</text>
-<text text-anchor="middle" x="48.12" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::cycleSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.55,-43.36C20.95,-52.43 28.47,-60.88 48.12,-60.88 58.87,-60.88 65.99,-58.35 69.49,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.94,-55.18 70.53,-44.87 65.98,-54.43 72.94,-55.18"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="218.75,-56.25 132.25,-56.25 132.25,-37 218.75,-37 218.75,-56.25"/>
-<text text-anchor="middle" x="175.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-34.81C104.44,-36.01 112.71,-37.26 120.77,-38.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.07,-41.92 130.48,-39.95 121.12,-35 120.07,-41.92"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="204.88,-19.25 146.12,-19.25 146.12,0 204.88,0 204.88,-19.25"/>
-<text text-anchor="middle" x="175.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.52,-20.82C109.14,-19.01 122.63,-17.07 134.78,-15.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.05,-18.82 144.45,-13.94 134.06,-11.9 135.05,-18.82"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d07/cycle__sort_8cpp_source.html b/de/d07/cycle__sort_8cpp_source.html
new file mode 100644
index 000000000..4ef230b70
--- /dev/null
+++ b/de/d07/cycle__sort_8cpp_source.html
@@ -0,0 +1,244 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/cycle_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/d07/cycle__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">cycle_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/d07/cycle__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d4/dfb/namespacecycle__sort.html">cycle_sort</a> {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="foldopen" id="foldopen00038" data-start="{" data-end="}">
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"><a class="line" href="../../de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa">   38</a></span>std::vector&lt;T&gt; <a class="code hl_function" href="../../de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa">cycleSort</a>(<span class="keyword">const</span> std::vector&lt;T&gt; &amp;in_arr) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    std::vector&lt;T&gt; arr(in_arr);</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> cycle_start = 0; cycle_start &lt;= arr.size() - 1; cycle_start++) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        <span class="comment">// initialize item</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        T item = arr[cycle_start];</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="comment">// Count the number of elements smaller than item, this  number is the</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="comment">// correct index of item.</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordtype">int</span> pos = cycle_start;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = cycle_start + 1; i &lt; arr.size(); i++) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            <span class="keywordflow">if</span> (arr[i] &lt; item) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>                pos++;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>            }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        <span class="comment">// item is already in correct position</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <span class="keywordflow">if</span> (pos == cycle_start) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="comment">// duplicate  elements</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <span class="keywordflow">while</span> (item == arr[pos]) pos += 1;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        <span class="keywordflow">if</span> (pos == cycle_start) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            std::swap(item, arr[pos]);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <span class="comment">// Rest of the  elements</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="keywordflow">while</span> (pos != cycle_start) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            pos = cycle_start;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            <span class="comment">// Find position where we put the element</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = cycle_start + 1; i &lt; arr.size(); i++) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>                <span class="keywordflow">if</span> (arr[i] &lt; item) {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>                    pos += 1;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>                }</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            }</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            <span class="comment">// duplicate  elements</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            <span class="keywordflow">while</span> (item == arr[pos]) pos += 1;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>            <span class="keywordflow">if</span> (item == arr[pos]) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>                <span class="keywordflow">continue</span>;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>                std::swap(item, arr[pos]);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>            }</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        }</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    }</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordflow">return</span> arr;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>}</div>
+</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>}  <span class="comment">// namespace cycle_sort</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="foldopen" id="foldopen00092" data-start="{" data-end="}">
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="../../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   92</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="comment">// Test 1</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="comment">// [4, 3, 2, 1] return [1, 2, 3, 4]</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    std::vector&lt;uint32_t&gt; array1 = {4, 3, 2, 1};</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1... &quot;</span>;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    std::vector&lt;uint32_t&gt; arr1 = sorting::cycle_sort::cycleSort(array1);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    assert(std::is_sorted(std::begin(arr1), std::end(arr1)));</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="comment">// [4.3, -6.5, -7.4, 0, 2.7, 1.8] return [-7.4, -6.5, 0, 1.8, 2.7, 4.3]</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    std::vector&lt;double&gt; array2 = {4.3, -6.5, -7.4, 0, 2.7, 1.8};</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2... &quot;</span>;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::vector&lt;double&gt; arr2 = sorting::cycle_sort::cycleSort(array2);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    assert(std::is_sorted(std::begin(arr2), std::end(arr2)));</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="comment">// Test 3</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="comment">// [3, 3, 3, 3] return [3, 3, 3, 3]</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    std::vector&lt;uint32_t&gt; array3 = {3, 3, 3, 3};</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3... &quot;</span>;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    std::vector&lt;uint32_t&gt; arr3 = sorting::cycle_sort::cycleSort(array3);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    assert(std::is_sorted(std::begin(arr3), std::end(arr3)));</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <span class="comment">// [9, 4, 6, 8, 14, 3] return [9, 4, 6, 8, 14, 3]</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    std::vector&lt;uint32_t&gt; array4 = {3, 4, 6, 8, 9, 14};</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4... &quot;</span>;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    std::vector&lt;uint32_t&gt; arr4 = sorting::cycle_sort::cycleSort(array4);</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    assert(std::is_sorted(std::begin(arr4), std::end(arr4)));</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>}</div>
+</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span> </div>
+<div class="foldopen" id="foldopen00128" data-start="{" data-end="}">
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"><a class="line" href="../../de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  128</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    <a class="code hl_function" href="../../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the test</span></div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>}</div>
+</div>
+<div class="ttc" id="acycle__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../de/d07/cycle__sort_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> <a href="#l00092">cycle_sort.cpp:92</a></div></div>
+<div class="ttc" id="acycle__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00128">cycle_sort.cpp:128</a></div></div>
+<div class="ttc" id="acycle__sort_8cpp_html_ae79a9d247691fce0d655fce75f1c04fa"><div class="ttname"><a href="../../de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa">sorting::cycle_sort::cycleSort</a></div><div class="ttdeci">std::vector&lt; T &gt; cycleSort(const std::vector&lt; T &gt; &amp;in_arr)</div><div class="ttdoc">The main function implements cycleSort.</div><div class="ttdef"><b>Definition</b> <a href="#l00038">cycle_sort.cpp:38</a></div></div>
+<div class="ttc" id="anamespacecycle__sort_html"><div class="ttname"><a href="../../d4/dfb/namespacecycle__sort.html">cycle_sort</a></div><div class="ttdoc">Functions for Cycle sort algorithm.</div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../de/d07/cycle__sort_8cpp.html">cycle_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/d0a/namespacemerge__insertion.html b/de/d0a/namespacemerge__insertion.html
index 32594b586..ac66b98d5 100644
--- a/de/d0a/namespacemerge__insertion.html
+++ b/de/d0a/namespacemerge__insertion.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: merge_insertion Namespace Reference</title>
+<title>TheAlgorithms/C++: merge_insertion Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree.html b/de/d0d/classrange__queries_1_1fenwick__tree.html
index a11879be3..472eb5dad 100644
--- a/de/d0d/classrange__queries_1_1fenwick__tree.html
+++ b/de/d0d/classrange__queries_1_1fenwick__tree.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: range_queries::fenwick_tree Class Reference</title>
+<title>TheAlgorithms/C++: range_queries::fenwick_tree Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,7 @@ Collaboration diagram for range_queries::fenwick_tree:</div>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:a5ea37183524553bbf2234a36a44a4b9a" id="r_a5ea37183524553bbf2234a36a44a4b9a"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
-<tr class="memitem:a5ea37183524553bbf2234a36a44a4b9a"><td class="memTemplItemLeft" align="right" valign="top">&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5ea37183524553bbf2234a36a44a4b9a">fenwick_tree</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;arr)</td></tr>
+<tr class="memitem:a5ea37183524553bbf2234a36a44a4b9a"><td class="memTemplItemLeft" align="right" valign="top">&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a5ea37183524553bbf2234a36a44a4b9a">fenwick_tree</a> (const std::vector&lt; T &gt; &amp;arr)</td></tr>
 <tr class="memdesc:a5ea37183524553bbf2234a36a44a4b9a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Class Constructor.  <br /></td></tr>
 <tr class="separator:a5ea37183524553bbf2234a36a44a4b9a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aef7ba885b91af093e9e514358fa0f36c" id="r_aef7ba885b91af093e9e514358fa0f36c"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
@@ -151,16 +168,17 @@ Private Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:af9f543aa5976b8cc5422490b3d6250c6" id="r_af9f543aa5976b8cc5422490b3d6250c6"><td class="memItemLeft" align="right" valign="top"><a id="af9f543aa5976b8cc5422490b3d6250c6" name="af9f543aa5976b8cc5422490b3d6250c6"></a>
-size_t&#160;</td><td class="memItemRight" valign="bottom"><b>n</b> = 0</td></tr>
-<tr class="memdesc:af9f543aa5976b8cc5422490b3d6250c6"><td class="mdescLeft">&#160;</td><td class="mdescRight">No. of elements present in input array. <br /></td></tr>
+<tr class="memitem:af9f543aa5976b8cc5422490b3d6250c6" id="r_af9f543aa5976b8cc5422490b3d6250c6"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af9f543aa5976b8cc5422490b3d6250c6">n</a> = 0</td></tr>
+<tr class="memdesc:af9f543aa5976b8cc5422490b3d6250c6"><td class="mdescLeft">&#160;</td><td class="mdescRight">No. of elements present in input array.  <br /></td></tr>
 <tr class="separator:af9f543aa5976b8cc5422490b3d6250c6"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af7b7a8c1c5724ed8683d7e28bef526e6" id="r_af7b7a8c1c5724ed8683d7e28bef526e6"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af7b7a8c1c5724ed8683d7e28bef526e6">bit</a> {}</td></tr>
+<tr class="memitem:af7b7a8c1c5724ed8683d7e28bef526e6" id="r_af7b7a8c1c5724ed8683d7e28bef526e6"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af7b7a8c1c5724ed8683d7e28bef526e6">bit</a> {}</td></tr>
 <tr class="memdesc:af7b7a8c1c5724ed8683d7e28bef526e6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Array that represents Binary Indexed Tree.  <br /></td></tr>
 <tr class="separator:af7b7a8c1c5724ed8683d7e28bef526e6"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>The class that initializes the Fenwick Tree. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html">fenwick_tree.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="a5ea37183524553bbf2234a36a44a4b9a" name="a5ea37183524553bbf2234a36a44a4b9a"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a5ea37183524553bbf2234a36a44a4b9a">&#9670;&#160;</a></span>fenwick_tree() <span class="overload">[1/2]</span></h2>
@@ -176,7 +194,7 @@ template&lt;typename T &gt; </div>
         <tr>
           <td class="memname">range_queries::fenwick_tree::fenwick_tree </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; T &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -201,23 +219,18 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   50</span>                                                   : <a class="code hl_variable" href="#af9f543aa5976b8cc5422490b3d6250c6">n</a>(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">   51</span>        <a class="code hl_variable" href="#af7b7a8c1c5724ed8683d7e28bef526e6">bit</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/assign.html">assign</a>(<a class="code hl_variable" href="#af9f543aa5976b8cc5422490b3d6250c6">n</a> + 1, 0);</div>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00050">50</a> of file <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html">fenwick_tree.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   50</span>                                                   : <a class="code hl_variable" href="#af9f543aa5976b8cc5422490b3d6250c6">n</a>(arr.size()) {</div>
+<div class="line"><span class="lineno">   51</span>        <a class="code hl_variable" href="#af7b7a8c1c5724ed8683d7e28bef526e6">bit</a>.assign(<a class="code hl_variable" href="#af9f543aa5976b8cc5422490b3d6250c6">n</a> + 1, 0);</div>
 <div class="line"><span class="lineno">   52</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; <a class="code hl_variable" href="#af9f543aa5976b8cc5422490b3d6250c6">n</a>; ++i) {</div>
 <div class="line"><span class="lineno">   53</span>            <a class="code hl_function" href="#a19dea5e88bbd7683a719030623315de9">update</a>(i, arr[i]);</div>
 <div class="line"><span class="lineno">   54</span>        }</div>
 <div class="line"><span class="lineno">   55</span>    }</div>
-<div class="ttc" id="aassign_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/assign.html">std::vector::assign</a></div><div class="ttdeci">T assign(T... args)</div></div>
-<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html_a19dea5e88bbd7683a719030623315de9"><div class="ttname"><a href="#a19dea5e88bbd7683a719030623315de9">range_queries::fenwick_tree::update</a></div><div class="ttdeci">void update(T id, T val)</div><div class="ttdoc">Updates the value of an element in original array and accordingly updates the values in BIT array.</div><div class="ttdef"><b>Definition</b> fenwick_tree.cpp:75</div></div>
-<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html_af7b7a8c1c5724ed8683d7e28bef526e6"><div class="ttname"><a href="#af7b7a8c1c5724ed8683d7e28bef526e6">range_queries::fenwick_tree::bit</a></div><div class="ttdeci">std::vector&lt; int &gt; bit</div><div class="ttdoc">Array that represents Binary Indexed Tree.</div><div class="ttdef"><b>Definition</b> fenwick_tree.cpp:34</div></div>
-<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html_af9f543aa5976b8cc5422490b3d6250c6"><div class="ttname"><a href="#af9f543aa5976b8cc5422490b3d6250c6">range_queries::fenwick_tree::n</a></div><div class="ttdeci">size_t n</div><div class="ttdoc">No. of elements present in input array.</div><div class="ttdef"><b>Definition</b> fenwick_tree.cpp:33</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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d0d/classrange__queries_1_1fenwick__tree_a5ea37183524553bbf2234a36a44a4b9a_cgraph.svg" width="574" height="102"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html_a19dea5e88bbd7683a719030623315de9"><div class="ttname"><a href="#a19dea5e88bbd7683a719030623315de9">range_queries::fenwick_tree::update</a></div><div class="ttdeci">void update(T id, T val)</div><div class="ttdoc">Updates the value of an element in original array and accordingly updates the values in BIT array.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00075">fenwick_tree.cpp:75</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html_af7b7a8c1c5724ed8683d7e28bef526e6"><div class="ttname"><a href="#af7b7a8c1c5724ed8683d7e28bef526e6">range_queries::fenwick_tree::bit</a></div><div class="ttdeci">std::vector&lt; int &gt; bit</div><div class="ttdoc">Array that represents Binary Indexed Tree.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00034">fenwick_tree.cpp:34</a></div></div>
+<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html_af9f543aa5976b8cc5422490b3d6250c6"><div class="ttname"><a href="#af9f543aa5976b8cc5422490b3d6250c6">range_queries::fenwick_tree::n</a></div><div class="ttdeci">size_t n</div><div class="ttdoc">No. of elements present in input array.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00033">fenwick_tree.cpp:33</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aef7ba885b91af093e9e514358fa0f36c" name="aef7ba885b91af093e9e514358fa0f36c"></a>
@@ -259,13 +272,10 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   64</span>: <a class="code hl_variable" href="#af9f543aa5976b8cc5422490b3d6250c6">n</a>(x) { <a class="code hl_variable" href="#af7b7a8c1c5724ed8683d7e28bef526e6">bit</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/assign.html">assign</a>(<a class="code hl_variable" href="#af9f543aa5976b8cc5422490b3d6250c6">n</a> + 1, 0); }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d0d/classrange__queries_1_1fenwick__tree_aef7ba885b91af093e9e514358fa0f36c_cgraph.svg" width="344" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html">fenwick_tree.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   64</span>: <a class="code hl_variable" href="#af9f543aa5976b8cc5422490b3d6250c6">n</a>(x) { <a class="code hl_variable" href="#af7b7a8c1c5724ed8683d7e28bef526e6">bit</a>.assign(<a class="code hl_variable" href="#af9f543aa5976b8cc5422490b3d6250c6">n</a> + 1, 0); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Function Documentation</h2>
@@ -300,6 +310,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Offset of index. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html">fenwick_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   41</span>{ <span class="keywordflow">return</span> (x &amp; (-x)); }</div>
 </div><!-- fragment -->
 </div>
@@ -343,6 +355,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Sum of elements in range from 0 to id. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00090">90</a> of file <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html">fenwick_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   90</span>                  {</div>
 <div class="line"><span class="lineno">   91</span>        <span class="keywordtype">id</span>++;</div>
 <div class="line"><span class="lineno">   92</span>        T res = 0;</div>
@@ -352,13 +366,8 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   96</span>        }</div>
 <div class="line"><span class="lineno">   97</span>        <span class="keywordflow">return</span> res;</div>
 <div class="line"><span class="lineno">   98</span>    }</div>
-<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html_ab492ebf07cab0e3c32d277ad986de801"><div class="ttname"><a href="#ab492ebf07cab0e3c32d277ad986de801">range_queries::fenwick_tree::offset</a></div><div class="ttdeci">int offset(int x)</div><div class="ttdoc">Returns the highest power of two which is not more than x.</div><div class="ttdef"><b>Definition</b> fenwick_tree.cpp:41</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d0d/classrange__queries_1_1fenwick__tree_a1fa0559d987fde0044761b17b35f5abd_cgraph.svg" width="370" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html_ab492ebf07cab0e3c32d277ad986de801"><div class="ttname"><a href="#ab492ebf07cab0e3c32d277ad986de801">range_queries::fenwick_tree::offset</a></div><div class="ttdeci">int offset(int x)</div><div class="ttdoc">Returns the highest power of two which is not more than x.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00041">fenwick_tree.cpp:41</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0914a4b1401a7c427de91c92885724fe" name="a0914a4b1401a7c427de91c92885724fe"></a>
@@ -397,14 +406,11 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>Sum of elements in range from L to R. </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  106</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a1fa0559d987fde0044761b17b35f5abd">sum</a>(r) - <a class="code hl_function" href="#a1fa0559d987fde0044761b17b35f5abd">sum</a>(l - 1); }</div>
-<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html_a1fa0559d987fde0044761b17b35f5abd"><div class="ttname"><a href="#a1fa0559d987fde0044761b17b35f5abd">range_queries::fenwick_tree::sum</a></div><div class="ttdeci">int sum(T id)</div><div class="ttdoc">Returns the sum of elements in range from 0 to ID.</div><div class="ttdef"><b>Definition</b> fenwick_tree.cpp:90</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d0d/classrange__queries_1_1fenwick__tree_a0914a4b1401a7c427de91c92885724fe_cgraph.svg" width="574" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00106">106</a> of file <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html">fenwick_tree.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  106</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a1fa0559d987fde0044761b17b35f5abd">sum</a>(r) - <a class="code hl_function" href="#a1fa0559d987fde0044761b17b35f5abd">sum</a>(l - 1); }</div>
+<div class="ttc" id="aclassrange__queries_1_1fenwick__tree_html_a1fa0559d987fde0044761b17b35f5abd"><div class="ttname"><a href="#a1fa0559d987fde0044761b17b35f5abd">range_queries::fenwick_tree::sum</a></div><div class="ttdeci">int sum(T id)</div><div class="ttdoc">Returns the sum of elements in range from 0 to ID.</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00090">fenwick_tree.cpp:90</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a19dea5e88bbd7683a719030623315de9" name="a19dea5e88bbd7683a719030623315de9"></a>
@@ -451,6 +457,8 @@ template&lt;typename T &gt; </div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00075">75</a> of file <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html">fenwick_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   75</span>                             {</div>
 <div class="line"><span class="lineno">   76</span>        <span class="keywordtype">id</span>++;</div>
 <div class="line"><span class="lineno">   77</span>        <span class="keywordflow">while</span> (<span class="keywordtype">id</span> &lt;= <a class="code hl_variable" href="#af9f543aa5976b8cc5422490b3d6250c6">n</a>) {</div>
@@ -458,12 +466,7 @@ template&lt;typename T &gt; </div>
 <div class="line"><span class="lineno">   79</span>            <span class="keywordtype">id</span> += <a class="code hl_function" href="#ab492ebf07cab0e3c32d277ad986de801">offset</a>(<span class="keywordtype">id</span>);</div>
 <div class="line"><span class="lineno">   80</span>        }</div>
 <div class="line"><span class="lineno">   81</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d0d/classrange__queries_1_1fenwick__tree_a19dea5e88bbd7683a719030623315de9_cgraph.svg" width="370" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
@@ -477,7 +480,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;int&gt; range_queries::fenwick_tree::bit {}</td>
+          <td class="memname">std::vector&lt;int&gt; range_queries::fenwick_tree::bit {}</td>
         </tr>
       </table>
   </td>
@@ -488,12 +491,40 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>Array that represents Binary Indexed Tree. </p>
-<div class="fragment"><div class="line"><span class="lineno">   34</span>{};  <span class="comment">///&lt; Array that represents Binary Indexed Tree.</span></div>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html">fenwick_tree.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   34</span>{};  </div>
 </div><!-- fragment -->
+</div>
+</div>
+<a id="af9f543aa5976b8cc5422490b3d6250c6" name="af9f543aa5976b8cc5422490b3d6250c6"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#af9f543aa5976b8cc5422490b3d6250c6">&#9670;&#160;</a></span>n</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">size_t range_queries::fenwick_tree::n = 0</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>No. of elements present in input array. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html">fenwick_tree.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>range_queries/<a class="el" href="../../d6/d2e/fenwick__tree_8cpp.html">fenwick_tree.cpp</a></li>
+<li>range_queries/<a class="el" href="../../d6/d2e/fenwick__tree_8cpp_source.html">fenwick_tree.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_a0914a4b1401a7c427de91c92885724fe_cgraph.map b/de/d0d/classrange__queries_1_1fenwick__tree_a0914a4b1401a7c427de91c92885724fe_cgraph.map
deleted file mode 100644
index 402c4b3ef..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_a0914a4b1401a7c427de91c92885724fe_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="range_queries::fenwick_tree::sum_range" name="range_queries::fenwick_tree::sum_range">
-<area shape="rect" id="Node000001" title="Returns the prefix sum in range from L to R." alt="" coords="5,5,161,46"/>
-<area shape="rect" id="Node000002" href="$de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd" title="Returns the sum of elements in range from 0 to ID." alt="" coords="209,5,364,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="161,23,193,23,193,28,161,28"/>
-<area shape="rect" id="Node000003" href="$de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801" title="Returns the highest power of two which is not more than x." alt="" coords="412,5,567,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="364,23,396,23,396,28,364,28"/>
-</map>
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_a0914a4b1401a7c427de91c92885724fe_cgraph.md5 b/de/d0d/classrange__queries_1_1fenwick__tree_a0914a4b1401a7c427de91c92885724fe_cgraph.md5
deleted file mode 100644
index 0ed825de9..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_a0914a4b1401a7c427de91c92885724fe_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0a4e921e0cb7860f4fe331f15c0fb383
\ No newline at end of file
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_a0914a4b1401a7c427de91c92885724fe_cgraph.svg b/de/d0d/classrange__queries_1_1fenwick__tree_a0914a4b1401a7c427de91c92885724fe_cgraph.svg
deleted file mode 100644
index d8776a688..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_a0914a4b1401a7c427de91c92885724fe_cgraph.svg
+++ /dev/null
@@ -1,86 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::fenwick_tree::sum_range Pages: 1 -->
-<svg width="430pt" height="39pt"
- viewBox="0.00 0.00 429.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>range_queries::fenwick_tree::sum_range</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Returns the prefix sum in range from L to R.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-30.5 0,-30.5 0,0 116.5,0 116.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="58.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::sum_range</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd" target="_top" xlink:title="Returns the sum of elements in range from 0 to ID.">
-<polygon fill="white" stroke="#666666" points="269,-30.5 152.5,-30.5 152.5,0 269,0 269,-30.5"/>
-<text text-anchor="start" x="160.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="210.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::sum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.58,-15.25C124.48,-15.25 132.67,-15.25 140.75,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.57,-18.75 150.57,-15.25 140.57,-11.75 140.57,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801" target="_top" xlink:title="Returns the highest power of two which is not more than x.">
-<polygon fill="white" stroke="#666666" points="421.5,-30.5 305,-30.5 305,0 421.5,0 421.5,-30.5"/>
-<text text-anchor="start" x="313" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="363.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::offset</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M269.08,-15.25C276.98,-15.25 285.17,-15.25 293.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.07,-18.75 303.07,-15.25 293.07,-11.75 293.07,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_a0914a4b1401a7c427de91c92885724fe_cgraph_org.svg b/de/d0d/classrange__queries_1_1fenwick__tree_a0914a4b1401a7c427de91c92885724fe_cgraph_org.svg
deleted file mode 100644
index ec66b76f6..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_a0914a4b1401a7c427de91c92885724fe_cgraph_org.svg
+++ /dev/null
@@ -1,60 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::fenwick_tree::sum_range Pages: 1 -->
-<svg width="430pt" height="39pt"
- viewBox="0.00 0.00 429.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>range_queries::fenwick_tree::sum_range</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Returns the prefix sum in range from L to R.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-30.5 0,-30.5 0,0 116.5,0 116.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="58.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::sum_range</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd" target="_top" xlink:title="Returns the sum of elements in range from 0 to ID.">
-<polygon fill="white" stroke="#666666" points="269,-30.5 152.5,-30.5 152.5,0 269,0 269,-30.5"/>
-<text text-anchor="start" x="160.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="210.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::sum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.58,-15.25C124.48,-15.25 132.67,-15.25 140.75,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.57,-18.75 150.57,-15.25 140.57,-11.75 140.57,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801" target="_top" xlink:title="Returns the highest power of two which is not more than x.">
-<polygon fill="white" stroke="#666666" points="421.5,-30.5 305,-30.5 305,0 421.5,0 421.5,-30.5"/>
-<text text-anchor="start" x="313" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="363.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::offset</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M269.08,-15.25C276.98,-15.25 285.17,-15.25 293.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.07,-18.75 303.07,-15.25 293.07,-11.75 293.07,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_a19dea5e88bbd7683a719030623315de9_cgraph.map b/de/d0d/classrange__queries_1_1fenwick__tree_a19dea5e88bbd7683a719030623315de9_cgraph.map
deleted file mode 100644
index e0250216b..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_a19dea5e88bbd7683a719030623315de9_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="range_queries::fenwick_tree::update" name="range_queries::fenwick_tree::update">
-<area shape="rect" id="Node000001" title="Updates the value of an element in original array and accordingly updates the values in BIT array." alt="" coords="5,5,161,46"/>
-<area shape="rect" id="Node000002" href="$de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801" title="Returns the highest power of two which is not more than x." alt="" coords="209,5,364,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="161,23,193,23,193,28,161,28"/>
-</map>
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_a19dea5e88bbd7683a719030623315de9_cgraph.md5 b/de/d0d/classrange__queries_1_1fenwick__tree_a19dea5e88bbd7683a719030623315de9_cgraph.md5
deleted file mode 100644
index a969ef51d..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_a19dea5e88bbd7683a719030623315de9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-acdb7718408beae1e9044f86664b7c21
\ No newline at end of file
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_a19dea5e88bbd7683a719030623315de9_cgraph.svg b/de/d0d/classrange__queries_1_1fenwick__tree_a19dea5e88bbd7683a719030623315de9_cgraph.svg
deleted file mode 100644
index 28ce03e04..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_a19dea5e88bbd7683a719030623315de9_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::fenwick_tree::update Pages: 1 -->
-<svg width="277pt" height="39pt"
- viewBox="0.00 0.00 277.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>range_queries::fenwick_tree::update</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Updates the value of an element in original array and accordingly updates the values in BIT array.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-30.5 0,-30.5 0,0 116.5,0 116.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="58.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::update</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801" target="_top" xlink:title="Returns the highest power of two which is not more than x.">
-<polygon fill="white" stroke="#666666" points="269,-30.5 152.5,-30.5 152.5,0 269,0 269,-30.5"/>
-<text text-anchor="start" x="160.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="210.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::offset</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.58,-15.25C124.48,-15.25 132.67,-15.25 140.75,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.57,-18.75 150.57,-15.25 140.57,-11.75 140.57,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_a19dea5e88bbd7683a719030623315de9_cgraph_org.svg b/de/d0d/classrange__queries_1_1fenwick__tree_a19dea5e88bbd7683a719030623315de9_cgraph_org.svg
deleted file mode 100644
index 4dc005194..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_a19dea5e88bbd7683a719030623315de9_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::fenwick_tree::update Pages: 1 -->
-<svg width="277pt" height="39pt"
- viewBox="0.00 0.00 277.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>range_queries::fenwick_tree::update</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Updates the value of an element in original array and accordingly updates the values in BIT array.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-30.5 0,-30.5 0,0 116.5,0 116.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="58.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::update</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801" target="_top" xlink:title="Returns the highest power of two which is not more than x.">
-<polygon fill="white" stroke="#666666" points="269,-30.5 152.5,-30.5 152.5,0 269,0 269,-30.5"/>
-<text text-anchor="start" x="160.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="210.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::offset</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.58,-15.25C124.48,-15.25 132.67,-15.25 140.75,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.57,-18.75 150.57,-15.25 140.57,-11.75 140.57,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_a1fa0559d987fde0044761b17b35f5abd_cgraph.map b/de/d0d/classrange__queries_1_1fenwick__tree_a1fa0559d987fde0044761b17b35f5abd_cgraph.map
deleted file mode 100644
index 3dbc2c21b..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_a1fa0559d987fde0044761b17b35f5abd_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="range_queries::fenwick_tree::sum" name="range_queries::fenwick_tree::sum">
-<area shape="rect" id="Node000001" title="Returns the sum of elements in range from 0 to ID." alt="" coords="5,5,161,46"/>
-<area shape="rect" id="Node000002" href="$de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801" title="Returns the highest power of two which is not more than x." alt="" coords="209,5,364,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="161,23,193,23,193,28,161,28"/>
-</map>
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_a1fa0559d987fde0044761b17b35f5abd_cgraph.md5 b/de/d0d/classrange__queries_1_1fenwick__tree_a1fa0559d987fde0044761b17b35f5abd_cgraph.md5
deleted file mode 100644
index 4682c4b18..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_a1fa0559d987fde0044761b17b35f5abd_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5b71e6f10aadc5d42d4ab6c8b86a5737
\ No newline at end of file
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_a1fa0559d987fde0044761b17b35f5abd_cgraph.svg b/de/d0d/classrange__queries_1_1fenwick__tree_a1fa0559d987fde0044761b17b35f5abd_cgraph.svg
deleted file mode 100644
index 0490c12cd..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_a1fa0559d987fde0044761b17b35f5abd_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::fenwick_tree::sum Pages: 1 -->
-<svg width="277pt" height="39pt"
- viewBox="0.00 0.00 277.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>range_queries::fenwick_tree::sum</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Returns the sum of elements in range from 0 to ID.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-30.5 0,-30.5 0,0 116.5,0 116.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="58.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::sum</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801" target="_top" xlink:title="Returns the highest power of two which is not more than x.">
-<polygon fill="white" stroke="#666666" points="269,-30.5 152.5,-30.5 152.5,0 269,0 269,-30.5"/>
-<text text-anchor="start" x="160.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="210.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::offset</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.58,-15.25C124.48,-15.25 132.67,-15.25 140.75,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.57,-18.75 150.57,-15.25 140.57,-11.75 140.57,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_a1fa0559d987fde0044761b17b35f5abd_cgraph_org.svg b/de/d0d/classrange__queries_1_1fenwick__tree_a1fa0559d987fde0044761b17b35f5abd_cgraph_org.svg
deleted file mode 100644
index eb6110720..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_a1fa0559d987fde0044761b17b35f5abd_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::fenwick_tree::sum Pages: 1 -->
-<svg width="277pt" height="39pt"
- viewBox="0.00 0.00 277.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>range_queries::fenwick_tree::sum</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Returns the sum of elements in range from 0 to ID.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-30.5 0,-30.5 0,0 116.5,0 116.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="58.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::sum</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801" target="_top" xlink:title="Returns the highest power of two which is not more than x.">
-<polygon fill="white" stroke="#666666" points="269,-30.5 152.5,-30.5 152.5,0 269,0 269,-30.5"/>
-<text text-anchor="start" x="160.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="210.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::offset</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.58,-15.25C124.48,-15.25 132.67,-15.25 140.75,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.57,-18.75 150.57,-15.25 140.57,-11.75 140.57,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_a5ea37183524553bbf2234a36a44a4b9a_cgraph.map b/de/d0d/classrange__queries_1_1fenwick__tree_a5ea37183524553bbf2234a36a44a4b9a_cgraph.map
deleted file mode 100644
index 5c9b09719..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_a5ea37183524553bbf2234a36a44a4b9a_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="range_queries::fenwick_tree::fenwick_tree" name="range_queries::fenwick_tree::fenwick_tree">
-<area shape="rect" id="Node000001" title="Class Constructor." alt="" coords="5,27,161,68"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/assign.html#" title=" " alt="" coords="222,5,351,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="160,34,206,27,207,32,161,39"/>
-<area shape="rect" id="Node000003" href="$de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9" title="Updates the value of an element in original array and accordingly updates the values in BIT array." alt="" coords="209,55,364,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="161,56,193,60,193,65,160,61"/>
-<area shape="rect" id="Node000004" href="$de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801" title="Returns the highest power of two which is not more than x." alt="" coords="412,55,567,96"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="364,73,396,73,396,78,364,78"/>
-</map>
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_a5ea37183524553bbf2234a36a44a4b9a_cgraph.md5 b/de/d0d/classrange__queries_1_1fenwick__tree_a5ea37183524553bbf2234a36a44a4b9a_cgraph.md5
deleted file mode 100644
index 934d56928..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_a5ea37183524553bbf2234a36a44a4b9a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4b9dc88d4bac9f9a9b1736db49bc7ba5
\ No newline at end of file
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_a5ea37183524553bbf2234a36a44a4b9a_cgraph.svg b/de/d0d/classrange__queries_1_1fenwick__tree_a5ea37183524553bbf2234a36a44a4b9a_cgraph.svg
deleted file mode 100644
index 9a8a5e820..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_a5ea37183524553bbf2234a36a44a4b9a_cgraph.svg
+++ /dev/null
@@ -1,104 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::fenwick_tree::fenwick_tree Pages: 1 -->
-<svg width="430pt" height="76pt"
- viewBox="0.00 0.00 429.50 75.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 71.88)">
-<title>range_queries::fenwick_tree::fenwick_tree</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Class Constructor.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-51.5 0,-51.5 0,-21 116.5,-21 116.5,-51.5"/>
-<text text-anchor="start" x="8" y="-38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="58.25" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::fenwick_tree</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/assign.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.25,-67.88 162.25,-67.88 162.25,-48.62 259.25,-48.62 259.25,-67.88"/>
-<text text-anchor="middle" x="210.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::assign</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.58,-44.63C127.79,-46.27 139.57,-47.99 150.83,-49.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.99,-53.05 160.39,-51.03 151,-46.13 149.99,-53.05"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9" target="_top" xlink:title="Updates the value of an element in original array and accordingly updates the values in BIT array.">
-<polygon fill="white" stroke="#666666" points="269,-30.5 152.5,-30.5 152.5,0 269,0 269,-30.5"/>
-<text text-anchor="start" x="160.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="210.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.58,-28.25C124.48,-27.15 132.67,-26.01 140.75,-24.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.16,-28.35 150.58,-23.51 140.2,-21.42 141.16,-28.35"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801" target="_top" xlink:title="Returns the highest power of two which is not more than x.">
-<polygon fill="white" stroke="#666666" points="421.5,-30.5 305,-30.5 305,0 421.5,0 421.5,-30.5"/>
-<text text-anchor="start" x="313" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="363.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::offset</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M269.08,-15.25C276.98,-15.25 285.17,-15.25 293.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.07,-18.75 303.07,-15.25 293.07,-11.75 293.07,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_a5ea37183524553bbf2234a36a44a4b9a_cgraph_org.svg b/de/d0d/classrange__queries_1_1fenwick__tree_a5ea37183524553bbf2234a36a44a4b9a_cgraph_org.svg
deleted file mode 100644
index 96bc2d013..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_a5ea37183524553bbf2234a36a44a4b9a_cgraph_org.svg
+++ /dev/null
@@ -1,78 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::fenwick_tree::fenwick_tree Pages: 1 -->
-<svg width="430pt" height="76pt"
- viewBox="0.00 0.00 429.50 75.88" 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 71.88)">
-<title>range_queries::fenwick_tree::fenwick_tree</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Class Constructor.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-51.5 0,-51.5 0,-21 116.5,-21 116.5,-51.5"/>
-<text text-anchor="start" x="8" y="-38" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="58.25" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::fenwick_tree</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/assign.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.25,-67.88 162.25,-67.88 162.25,-48.62 259.25,-48.62 259.25,-67.88"/>
-<text text-anchor="middle" x="210.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::assign</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.58,-44.63C127.79,-46.27 139.57,-47.99 150.83,-49.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.99,-53.05 160.39,-51.03 151,-46.13 149.99,-53.05"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9" target="_top" xlink:title="Updates the value of an element in original array and accordingly updates the values in BIT array.">
-<polygon fill="white" stroke="#666666" points="269,-30.5 152.5,-30.5 152.5,0 269,0 269,-30.5"/>
-<text text-anchor="start" x="160.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="210.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.58,-28.25C124.48,-27.15 132.67,-26.01 140.75,-24.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.16,-28.35 150.58,-23.51 140.2,-21.42 141.16,-28.35"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801" target="_top" xlink:title="Returns the highest power of two which is not more than x.">
-<polygon fill="white" stroke="#666666" points="421.5,-30.5 305,-30.5 305,0 421.5,0 421.5,-30.5"/>
-<text text-anchor="start" x="313" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="363.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::offset</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M269.08,-15.25C276.98,-15.25 285.17,-15.25 293.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.07,-18.75 303.07,-15.25 293.07,-11.75 293.07,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_aef7ba885b91af093e9e514358fa0f36c_cgraph.map b/de/d0d/classrange__queries_1_1fenwick__tree_aef7ba885b91af093e9e514358fa0f36c_cgraph.map
deleted file mode 100644
index cd7ac9df3..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_aef7ba885b91af093e9e514358fa0f36c_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="range_queries::fenwick_tree::fenwick_tree" name="range_queries::fenwick_tree::fenwick_tree">
-<area shape="rect" id="Node000001" title="Class Constructor." alt="" coords="5,5,161,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/assign.html#" title=" " alt="" coords="209,13,338,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="161,23,193,23,193,28,161,28"/>
-</map>
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_aef7ba885b91af093e9e514358fa0f36c_cgraph.md5 b/de/d0d/classrange__queries_1_1fenwick__tree_aef7ba885b91af093e9e514358fa0f36c_cgraph.md5
deleted file mode 100644
index b215e60a7..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_aef7ba885b91af093e9e514358fa0f36c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-369b0a3dade4ebd8e74be2fc02e581f3
\ No newline at end of file
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_aef7ba885b91af093e9e514358fa0f36c_cgraph.svg b/de/d0d/classrange__queries_1_1fenwick__tree_aef7ba885b91af093e9e514358fa0f36c_cgraph.svg
deleted file mode 100644
index f201db6a8..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_aef7ba885b91af093e9e514358fa0f36c_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::fenwick_tree::fenwick_tree Pages: 1 -->
-<svg width="258pt" height="39pt"
- viewBox="0.00 0.00 257.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>range_queries::fenwick_tree::fenwick_tree</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Class Constructor.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-30.5 0,-30.5 0,0 116.5,0 116.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="58.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::fenwick_tree</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/assign.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-24.88 152.5,-24.88 152.5,-5.63 249.5,-5.63 249.5,-24.88"/>
-<text text-anchor="middle" x="201" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::assign</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.9,-15.25C124.76,-15.25 132.83,-15.25 140.72,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.57,-18.75 150.57,-15.25 140.57,-11.75 140.57,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d0d/classrange__queries_1_1fenwick__tree_aef7ba885b91af093e9e514358fa0f36c_cgraph_org.svg b/de/d0d/classrange__queries_1_1fenwick__tree_aef7ba885b91af093e9e514358fa0f36c_cgraph_org.svg
deleted file mode 100644
index 13ad6db9c..000000000
--- a/de/d0d/classrange__queries_1_1fenwick__tree_aef7ba885b91af093e9e514358fa0f36c_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: range_queries::fenwick_tree::fenwick_tree Pages: 1 -->
-<svg width="258pt" height="39pt"
- viewBox="0.00 0.00 257.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>range_queries::fenwick_tree::fenwick_tree</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Class Constructor.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-30.5 0,-30.5 0,0 116.5,0 116.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick</text>
-<text text-anchor="middle" x="58.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_tree::fenwick_tree</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/assign.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-24.88 152.5,-24.88 152.5,-5.63 249.5,-5.63 249.5,-24.88"/>
-<text text-anchor="middle" x="201" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::assign</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.9,-15.25C124.76,-15.25 132.83,-15.25 140.72,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.57,-18.75 150.57,-15.25 140.57,-11.75 140.57,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d0d/fibonacci__search_8cpp.html b/de/d0d/fibonacci__search_8cpp.html
index 0dccc1401..8e71e1b91 100644
--- a/de/d0d/fibonacci__search_8cpp.html
+++ b/de/d0d/fibonacci__search_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: search/fibonacci_search.cpp File Reference</title>
+<title>TheAlgorithms/C++: search/fibonacci_search.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,10 +139,12 @@ Include dependency graph for fibonacci_search.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dfa/fibonacci__search_8cpp__incl.svg" width="434" height="111"><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">
+</div>
+<p><a href="../../de/d0d/fibonacci__search_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a0bc61b3903d9a53061bf31e5d110fe61" id="r_a0bc61b3903d9a53061bf31e5d110fe61"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0bc61b3903d9a53061bf31e5d110fe61">fibonacci_search</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;arr, int value)</td></tr>
+<tr class="memitem:a0bc61b3903d9a53061bf31e5d110fe61" id="r_a0bc61b3903d9a53061bf31e5d110fe61"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0bc61b3903d9a53061bf31e5d110fe61">fibonacci_search</a> (const std::vector&lt; int &gt; &amp;arr, int value)</td></tr>
 <tr class="memdesc:a0bc61b3903d9a53061bf31e5d110fe61"><td class="mdescLeft">&#160;</td><td class="mdescRight">using fibonacci search algorithm finds an index of a given element in a sorted array  <br /></td></tr>
 <tr class="separator:a0bc61b3903d9a53061bf31e5d110fe61"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a5e144326104e57a3808aed7eb098db0d" id="r_a5e144326104e57a3808aed7eb098db0d"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5e144326104e57a3808aed7eb098db0d">no_occurence_tests</a> ()</td></tr>
@@ -140,6 +159,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Fibonacci_search_technique" target="_blank">Fibonacci search algorithm</a> </p>
 <dl class="section author"><dt>Author</dt><dd>sprintyaf </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../de/d0d/fibonacci__search_8cpp_source.html">fibonacci_search.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a0bc61b3903d9a53061bf31e5d110fe61" name="a0bc61b3903d9a53061bf31e5d110fe61"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0bc61b3903d9a53061bf31e5d110fe61">&#9670;&#160;</a></span>fibonacci_search()</h2>
@@ -150,7 +171,7 @@ Functions</h2></td></tr>
         <tr>
           <td class="memname">int fibonacci_search </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -169,18 +190,20 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>if the array contains the value, returns an index of the element. otherwise -1. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d0d/fibonacci__search_8cpp_source.html#l00023">23</a> of file <a class="el" href="../../de/d0d/fibonacci__search_8cpp_source.html">fibonacci_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   23</span>                                                          {</div>
 <div class="line"><span class="lineno">   24</span>    <span class="comment">// initialize last and current members of Fibonacci sequence </span></div>
 <div class="line"><span class="lineno">   25</span>    <span class="keywordtype">int</span> last = 0, current = 1;</div>
-<div class="line"><span class="lineno">   26</span>    <span class="keywordtype">int</span> length = arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); <span class="comment">// array size</span></div>
+<div class="line"><span class="lineno">   26</span>    <span class="keywordtype">int</span> length = arr.size(); <span class="comment">// array size</span></div>
 <div class="line"><span class="lineno">   27</span>    <span class="comment">// next member of Fibonacci sequence which is &quot;last&quot; + &quot;current&quot;</span></div>
-<div class="line"><span class="lineno">   28</span>    <span class="keywordtype">int</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a> = last + current; </div>
+<div class="line"><span class="lineno">   28</span>    <span class="keywordtype">int</span> next = last + current; </div>
 <div class="line"><span class="lineno">   29</span> </div>
 <div class="line"><span class="lineno">   30</span>    <span class="comment">// &quot;next&quot; will store the smallest Fibonacci number greater or equal to &quot;length&quot;</span></div>
 <div class="line"><span class="lineno">   31</span>    <span class="keywordflow">while</span>(next &lt; length){</div>
 <div class="line"><span class="lineno">   32</span>        last = current;</div>
-<div class="line"><span class="lineno">   33</span>        current = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a>;</div>
-<div class="line"><span class="lineno">   34</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a> = last + current;</div>
+<div class="line"><span class="lineno">   33</span>        current = next;</div>
+<div class="line"><span class="lineno">   34</span>        next = last + current;</div>
 <div class="line"><span class="lineno">   35</span>    }</div>
 <div class="line"><span class="lineno">   36</span> </div>
 <div class="line"><span class="lineno">   37</span>    <span class="comment">// &quot;offset&quot; is the end of eliminated range from front</span></div>
@@ -190,40 +213,31 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   41</span>    <span class="comment">// because arr[offset] will already be eliminated</span></div>
 <div class="line"><span class="lineno">   42</span>    <span class="keywordflow">while</span>(next &gt; 1){</div>
 <div class="line"><span class="lineno">   43</span>        <span class="comment">// check if &quot;last&quot; is valid location</span></div>
-<div class="line"><span class="lineno">   44</span>        index = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(offset + last, length-1);</div>
+<div class="line"><span class="lineno">   44</span>        index = std::min(offset + last, length-1);</div>
 <div class="line"><span class="lineno">   45</span>        <span class="comment">// if value is greater than the value at &quot;index&quot;, eliminate the subarray from offset to index</span></div>
 <div class="line"><span class="lineno">   46</span>        <span class="keywordflow">if</span>(arr[index] &lt; value){</div>
-<div class="line"><span class="lineno">   47</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a> = current;</div>
+<div class="line"><span class="lineno">   47</span>            next = current;</div>
 <div class="line"><span class="lineno">   48</span>            current = last;</div>
-<div class="line"><span class="lineno">   49</span>            last = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a> - current;</div>
+<div class="line"><span class="lineno">   49</span>            last = next - current;</div>
 <div class="line"><span class="lineno">   50</span>            offset = index;</div>
 <div class="line"><span class="lineno">   51</span>        <span class="comment">// if value is less than the value at &quot;index&quot;, eliminate the subarray after index+1</span></div>
 <div class="line"><span class="lineno">   52</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(arr[index] &gt; value){</div>
-<div class="line"><span class="lineno">   53</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a> = last;</div>
+<div class="line"><span class="lineno">   53</span>            next = last;</div>
 <div class="line"><span class="lineno">   54</span>            current = current - last;</div>
-<div class="line"><span class="lineno">   55</span>            last = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a> - current;</div>
+<div class="line"><span class="lineno">   55</span>            last = next - current;</div>
 <div class="line"><span class="lineno">   56</span>        <span class="comment">// element is found</span></div>
 <div class="line"><span class="lineno">   57</span>        } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">   58</span>            <span class="keywordflow">return</span> index;</div>
 <div class="line"><span class="lineno">   59</span>        }</div>
 <div class="line"><span class="lineno">   60</span>    }</div>
 <div class="line"><span class="lineno">   61</span>    <span class="comment">// comparing the last element</span></div>
-<div class="line"><span class="lineno">   62</span>    <span class="keywordflow">if</span>(current &amp;&amp; !arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/empty.html">empty</a>() &amp;&amp; arr[offset+1] == value){</div>
+<div class="line"><span class="lineno">   62</span>    <span class="keywordflow">if</span>(current &amp;&amp; !arr.empty() &amp;&amp; arr[offset+1] == value){</div>
 <div class="line"><span class="lineno">   63</span>        <span class="keywordflow">return</span> offset+1;</div>
 <div class="line"><span class="lineno">   64</span>    }</div>
 <div class="line"><span class="lineno">   65</span>    <span class="comment">// value was not found, return -1</span></div>
 <div class="line"><span class="lineno">   66</span>    <span class="keywordflow">return</span> -1;</div>
 <div class="line"><span class="lineno">   67</span>}</div>
-<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/empty.html">std::vector::empty</a></div><div class="ttdeci">T empty(T... args)</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="anext_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/next.html">std::next</a></div><div class="ttdeci">T next(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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph.svg" width="306" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -241,19 +255,16 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Main Function testing the algorithm </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d0d/fibonacci__search_8cpp_source.html#l00123">123</a> of file <a class="el" href="../../de/d0d/fibonacci__search_8cpp_source.html">fibonacci_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  123</span>           {</div>
 <div class="line"><span class="lineno">  124</span>    assert(<a class="code hl_function" href="#a5e144326104e57a3808aed7eb098db0d">no_occurence_tests</a>());</div>
 <div class="line"><span class="lineno">  125</span>    assert(<a class="code hl_function" href="#a2aa09bef74ee063c1331de0883af4f4f">random_tests</a>());</div>
 <div class="line"><span class="lineno">  126</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  127</span>}</div>
-<div class="ttc" id="afibonacci__search_8cpp_html_a2aa09bef74ee063c1331de0883af4f4f"><div class="ttname"><a href="#a2aa09bef74ee063c1331de0883af4f4f">random_tests</a></div><div class="ttdeci">bool random_tests()</div><div class="ttdoc">random tests which cover cases when we have one, multiple or zero occurences of the value we're looki...</div><div class="ttdef"><b>Definition</b> fibonacci_search.cpp:96</div></div>
-<div class="ttc" id="afibonacci__search_8cpp_html_a5e144326104e57a3808aed7eb098db0d"><div class="ttname"><a href="#a5e144326104e57a3808aed7eb098db0d">no_occurence_tests</a></div><div class="ttdeci">bool no_occurence_tests()</div><div class="ttdoc">random tests for checking performance when an array doesn't contain an element</div><div class="ttdef"><b>Definition</b> fibonacci_search.cpp:72</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="624" height="431"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afibonacci__search_8cpp_html_a2aa09bef74ee063c1331de0883af4f4f"><div class="ttname"><a href="#a2aa09bef74ee063c1331de0883af4f4f">random_tests</a></div><div class="ttdeci">bool random_tests()</div><div class="ttdoc">random tests which cover cases when we have one, multiple or zero occurences of the value we're looki...</div><div class="ttdef"><b>Definition</b> <a href="../../de/d0d/fibonacci__search_8cpp_source.html#l00096">fibonacci_search.cpp:96</a></div></div>
+<div class="ttc" id="afibonacci__search_8cpp_html_a5e144326104e57a3808aed7eb098db0d"><div class="ttname"><a href="#a5e144326104e57a3808aed7eb098db0d">no_occurence_tests</a></div><div class="ttdeci">bool no_occurence_tests()</div><div class="ttdoc">random tests for checking performance when an array doesn't contain an element</div><div class="ttdef"><b>Definition</b> <a href="../../de/d0d/fibonacci__search_8cpp_source.html#l00072">fibonacci_search.cpp:72</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5e144326104e57a3808aed7eb098db0d" name="a5e144326104e57a3808aed7eb098db0d"></a>
@@ -272,42 +283,30 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>random tests for checking performance when an array doesn't contain an element </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d0d/fibonacci__search_8cpp_source.html#l00072">72</a> of file <a class="el" href="../../de/d0d/fibonacci__search_8cpp_source.html">fibonacci_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   72</span>                         {</div>
 <div class="line"><span class="lineno">   73</span>    <span class="keywordtype">bool</span> passed = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   74</span>    <span class="keywordtype">int</span> rand_num, rand_value, index, num_tests = 1000;</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&lt;int&gt;</a> arr;</div>
+<div class="line"><span class="lineno">   75</span>    std::vector&lt;int&gt; arr;</div>
 <div class="line"><span class="lineno">   76</span>    <span class="keywordflow">while</span>(num_tests--){</div>
-<div class="line"><span class="lineno">   77</span>        arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/clear.html">clear</a>();</div>
+<div class="line"><span class="lineno">   77</span>        arr.clear();</div>
 <div class="line"><span class="lineno">   78</span>        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; 100; i++){</div>
-<div class="line"><span class="lineno">   79</span>            rand_num = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 1000;</div>
-<div class="line"><span class="lineno">   80</span>            arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(rand_num);</div>
+<div class="line"><span class="lineno">   79</span>            rand_num = std::rand() % 1000;</div>
+<div class="line"><span class="lineno">   80</span>            arr.push_back(rand_num);</div>
 <div class="line"><span class="lineno">   81</span>        }</div>
-<div class="line"><span class="lineno">   82</span>        rand_value = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 1000;</div>
-<div class="line"><span class="lineno">   83</span>        <span class="keywordflow">while</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/find.html">std::find</a>(arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>(), rand_value) != arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()){</div>
-<div class="line"><span class="lineno">   84</span>            <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/remove.html">std::remove</a>(arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>(), rand_value);</div>
+<div class="line"><span class="lineno">   82</span>        rand_value = std::rand() % 1000;</div>
+<div class="line"><span class="lineno">   83</span>        <span class="keywordflow">while</span>(std::find(arr.begin(), arr.end(), rand_value) != arr.end()){</div>
+<div class="line"><span class="lineno">   84</span>            std::remove(arr.begin(), arr.end(), rand_value);</div>
 <div class="line"><span class="lineno">   85</span>        }</div>
-<div class="line"><span class="lineno">   86</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">sort</a>(arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>());</div>
+<div class="line"><span class="lineno">   86</span>        sort(arr.begin(), arr.end());</div>
 <div class="line"><span class="lineno">   87</span>        index = <a class="code hl_function" href="#a0bc61b3903d9a53061bf31e5d110fe61">fibonacci_search</a>(arr, rand_value);</div>
 <div class="line"><span class="lineno">   88</span>        passed = passed &amp;&amp; (index == -1);</div>
 <div class="line"><span class="lineno">   89</span>    }</div>
 <div class="line"><span class="lineno">   90</span>    <span class="keywordflow">return</span> passed;</div>
 <div class="line"><span class="lineno">   91</span>}</div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aclear_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/clear.html">std::vector::clear</a></div><div class="ttdeci">T clear(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="afibonacci__search_8cpp_html_a0bc61b3903d9a53061bf31e5d110fe61"><div class="ttname"><a href="#a0bc61b3903d9a53061bf31e5d110fe61">fibonacci_search</a></div><div class="ttdeci">int fibonacci_search(const std::vector&lt; int &gt; &amp;arr, int value)</div><div class="ttdoc">using fibonacci search algorithm finds an index of a given element in a sorted array</div><div class="ttdef"><b>Definition</b> fibonacci_search.cpp:23</div></div>
-<div class="ttc" id="afind_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/find.html">std::find</a></div><div class="ttdeci">T find(T... args)</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-<div class="ttc" id="aremove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/remove.html">std::remove</a></div><div class="ttdeci">T remove(T... args)</div></div>
-<div class="ttc" id="asort_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a></div><div class="ttdeci">T sort(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d0d/fibonacci__search_8cpp_a5e144326104e57a3808aed7eb098db0d_cgraph.svg" width="527" height="382"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afibonacci__search_8cpp_html_a0bc61b3903d9a53061bf31e5d110fe61"><div class="ttname"><a href="#a0bc61b3903d9a53061bf31e5d110fe61">fibonacci_search</a></div><div class="ttdeci">int fibonacci_search(const std::vector&lt; int &gt; &amp;arr, int value)</div><div class="ttdoc">using fibonacci search algorithm finds an index of a given element in a sorted array</div><div class="ttdef"><b>Definition</b> <a href="../../de/d0d/fibonacci__search_8cpp_source.html#l00023">fibonacci_search.cpp:23</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2aa09bef74ee063c1331de0883af4f4f" name="a2aa09bef74ee063c1331de0883af4f4f"></a>
@@ -326,34 +325,31 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>random tests which cover cases when we have one, multiple or zero occurences of the value we're looking for </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d0d/fibonacci__search_8cpp_source.html#l00096">96</a> of file <a class="el" href="../../de/d0d/fibonacci__search_8cpp_source.html">fibonacci_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   96</span>                   {</div>
 <div class="line"><span class="lineno">   97</span>    <span class="keywordtype">bool</span> passed = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   98</span>    <span class="keywordtype">int</span> rand_num, rand_value, index, real_value, num_tests = 10000;</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&lt;int&gt;</a> arr;</div>
+<div class="line"><span class="lineno">   99</span>    std::vector&lt;int&gt; arr;</div>
 <div class="line"><span class="lineno">  100</span>    <span class="keywordflow">while</span>(num_tests--){</div>
-<div class="line"><span class="lineno">  101</span>        arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/clear.html">clear</a>();</div>
+<div class="line"><span class="lineno">  101</span>        arr.clear();</div>
 <div class="line"><span class="lineno">  102</span>        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; 100; i++){</div>
-<div class="line"><span class="lineno">  103</span>            rand_num = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 1000;</div>
-<div class="line"><span class="lineno">  104</span>            arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(rand_num);</div>
+<div class="line"><span class="lineno">  103</span>            rand_num = std::rand() % 1000;</div>
+<div class="line"><span class="lineno">  104</span>            arr.push_back(rand_num);</div>
 <div class="line"><span class="lineno">  105</span>        }</div>
-<div class="line"><span class="lineno">  106</span>        rand_value = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 1000;</div>
-<div class="line"><span class="lineno">  107</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a>(arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>());</div>
+<div class="line"><span class="lineno">  106</span>        rand_value = std::rand() % 1000;</div>
+<div class="line"><span class="lineno">  107</span>        std::sort(arr.begin(), arr.end());</div>
 <div class="line"><span class="lineno">  108</span>        index = <a class="code hl_function" href="#a0bc61b3903d9a53061bf31e5d110fe61">fibonacci_search</a>(arr, rand_value);</div>
 <div class="line"><span class="lineno">  109</span>        <span class="keywordflow">if</span>(index != -1){</div>
 <div class="line"><span class="lineno">  110</span>            real_value = arr[index];</div>
 <div class="line"><span class="lineno">  111</span>            passed = passed &amp;&amp; (real_value == rand_value);</div>
 <div class="line"><span class="lineno">  112</span>        } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  113</span>            passed = passed &amp;&amp; (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/find.html">std::find</a>(arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>(), rand_value) == arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>());</div>
+<div class="line"><span class="lineno">  113</span>            passed = passed &amp;&amp; (std::find(arr.begin(), arr.end(), rand_value) == arr.end());</div>
 <div class="line"><span class="lineno">  114</span>        }</div>
 <div class="line"><span class="lineno">  115</span>    }</div>
 <div class="line"><span class="lineno">  116</span>    <span class="keywordflow">return</span> passed;</div>
 <div class="line"><span class="lineno">  117</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d0d/fibonacci__search_8cpp_a2aa09bef74ee063c1331de0883af4f4f_cgraph.svg" width="490" height="382"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph.map b/de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph.map
deleted file mode 100644
index ba2eaa864..000000000
--- a/de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="fibonacci_search" name="fibonacci_search">
-<area shape="rect" id="Node000001" title="using fibonacci search algorithm finds an index of a given element in a sorted array" alt="" coords="5,55,125,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/empty.html#" title=" " alt="" coords="173,5,300,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="112,51,174,33,175,38,113,57"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="202,55,270,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="125,65,187,65,187,70,125,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="179,104,294,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="113,78,175,97,174,102,112,84"/>
-</map>
diff --git a/de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph.md5 b/de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph.md5
deleted file mode 100644
index dba9037b2..000000000
--- a/de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3b80208aa6eb1036bc95ad25867fbf1f
\ No newline at end of file
diff --git a/de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph.svg b/de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph.svg
deleted file mode 100644
index dc317bc4b..000000000
--- a/de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: fibonacci_search Pages: 1 -->
-<svg width="229pt" height="101pt"
- viewBox="0.00 0.00 229.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>fibonacci_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="using fibonacci search algorithm finds an index of a given element in a sorted array">
-<polygon fill="#999999" stroke="#666666" points="89.5,-56.25 0,-56.25 0,-37 89.5,-37 89.5,-56.25"/>
-<text text-anchor="middle" x="44.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibonacci_search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221,-93.25 125.5,-93.25 125.5,-74 221,-74 221,-93.25"/>
-<text text-anchor="middle" x="173.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.32,-56.74C94.68,-60.94 111.55,-65.87 126.88,-70.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.69,-73.65 136.27,-73.1 127.66,-66.94 125.69,-73.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="198.88,-56.25 147.62,-56.25 147.62,-37 198.88,-37 198.88,-56.25"/>
-<text text-anchor="middle" x="173.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.99,-46.62C105.02,-46.62 121.63,-46.62 135.96,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.87,-50.13 145.87,-46.63 135.87,-43.13 135.87,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-19.25 130,-19.25 130,0 216.5,0 216.5,-19.25"/>
-<text text-anchor="middle" x="173.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.32,-36.51C94.68,-32.31 111.55,-27.38 126.88,-22.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.66,-26.31 136.27,-20.15 125.69,-19.6 127.66,-26.31"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph_org.svg b/de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph_org.svg
deleted file mode 100644
index 05732b6eb..000000000
--- a/de/d0d/fibonacci__search_8cpp_a0bc61b3903d9a53061bf31e5d110fe61_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: fibonacci_search Pages: 1 -->
-<svg width="229pt" height="101pt"
- viewBox="0.00 0.00 229.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>fibonacci_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="using fibonacci search algorithm finds an index of a given element in a sorted array">
-<polygon fill="#999999" stroke="#666666" points="89.5,-56.25 0,-56.25 0,-37 89.5,-37 89.5,-56.25"/>
-<text text-anchor="middle" x="44.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibonacci_search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221,-93.25 125.5,-93.25 125.5,-74 221,-74 221,-93.25"/>
-<text text-anchor="middle" x="173.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.32,-56.74C94.68,-60.94 111.55,-65.87 126.88,-70.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="125.69,-73.65 136.27,-73.1 127.66,-66.94 125.69,-73.65"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="198.88,-56.25 147.62,-56.25 147.62,-37 198.88,-37 198.88,-56.25"/>
-<text text-anchor="middle" x="173.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.99,-46.62C105.02,-46.62 121.63,-46.62 135.96,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.87,-50.13 145.87,-46.63 135.87,-43.13 135.87,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="216.5,-19.25 130,-19.25 130,0 216.5,0 216.5,-19.25"/>
-<text text-anchor="middle" x="173.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.32,-36.51C94.68,-32.31 111.55,-27.38 126.88,-22.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="127.66,-26.31 136.27,-20.15 125.69,-19.6 127.66,-26.31"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d0d/fibonacci__search_8cpp_a2aa09bef74ee063c1331de0883af4f4f_cgraph.map b/de/d0d/fibonacci__search_8cpp_a2aa09bef74ee063c1331de0883af4f4f_cgraph.map
deleted file mode 100644
index 22c5051da..000000000
--- a/de/d0d/fibonacci__search_8cpp_a2aa09bef74ee063c1331de0883af4f4f_cgraph.map
+++ /dev/null
@@ -1,25 +0,0 @@
-<map id="random_tests" name="random_tests">
-<area shape="rect" id="Node000001" title="random tests which cover cases when we have one, multiple or zero occurences of the value we&#39;re looki..." alt="" coords="5,179,106,204"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="170,5,292,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="59,177,91,112,118,73,152,40,157,37,160,41,155,44,122,77,96,115,64,179"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/clear.html#" title=" " alt="" coords="171,55,290,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="64,176,100,134,124,110,152,89,160,85,163,89,155,94,128,114,104,137,68,180"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="175,104,287,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="79,176,153,138,167,133,169,138,155,143,81,180"/>
-<area shape="rect" id="Node000005" href="$de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61" title="using fibonacci search algorithm finds an index of a given element in a sorted array" alt="" coords="171,153,290,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="106,182,155,174,156,180,107,187"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/find.html#" title=" " alt="" coords="197,203,265,228"/>
-<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="107,196,182,206,181,211,106,201"/>
-<area shape="rect" id="Node000010" 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="154,252,308,278"/>
-<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="82,203,155,238,170,244,168,249,153,243,79,207"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="195,301,267,327"/>
-<area shape="poly" id="edge10_Node000001_Node000011" title=" " alt="" coords="68,203,104,245,128,268,155,288,181,300,179,305,152,292,125,272,100,248,64,206"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/sort.html#" title=" " alt="" coords="196,351,266,376"/>
-<area shape="poly" id="edge11_Node000001_Node000012" title=" " alt="" coords="64,204,96,268,122,305,155,337,182,351,180,356,152,342,118,309,92,270,59,206"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/empty.html#" title=" " alt="" coords="356,104,483,130"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="282,150,352,132,354,137,284,155"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="386,153,454,179"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="291,164,370,164,370,169,291,169"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="362,203,477,228"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="284,177,354,196,352,201,282,182"/>
-</map>
diff --git a/de/d0d/fibonacci__search_8cpp_a2aa09bef74ee063c1331de0883af4f4f_cgraph.md5 b/de/d0d/fibonacci__search_8cpp_a2aa09bef74ee063c1331de0883af4f4f_cgraph.md5
deleted file mode 100644
index 08c27e19d..000000000
--- a/de/d0d/fibonacci__search_8cpp_a2aa09bef74ee063c1331de0883af4f4f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bb73f3b1883c8d8e82510ccabeec4c33
\ No newline at end of file
diff --git a/de/d0d/fibonacci__search_8cpp_a2aa09bef74ee063c1331de0883af4f4f_cgraph.svg b/de/d0d/fibonacci__search_8cpp_a2aa09bef74ee063c1331de0883af4f4f_cgraph.svg
deleted file mode 100644
index 861f43cdf..000000000
--- a/de/d0d/fibonacci__search_8cpp_a2aa09bef74ee063c1331de0883af4f4f_cgraph.svg
+++ /dev/null
@@ -1,245 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: random_tests Pages: 1 -->
-<svg width="367pt" height="286pt"
- viewBox="0.00 0.00 366.50 286.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 282.25)">
-<title>random_tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="random tests which cover cases when we have one, multiple or zero occurences of the value we&#39;re looki...">
-<polygon fill="#999999" stroke="#666666" points="75.25,-148.25 0,-148.25 0,-129 75.25,-129 75.25,-148.25"/>
-<text text-anchor="middle" x="37.62" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">random_tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215,-278.25 123.25,-278.25 123.25,-259 215,-259 215,-278.25"/>
-<text text-anchor="middle" x="169.12" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.37,-148.65C51.03,-170.5 74.57,-222.68 111.25,-250.62 112.41,-251.51 113.61,-252.35 114.85,-253.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="113.11,-256.18 123.58,-257.8 116.4,-250.01 113.11,-256.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="213.88,-241.25 124.38,-241.25 124.38,-222 213.88,-222 213.88,-241.25"/>
-<text text-anchor="middle" x="169.12" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.7,-148.66C57.51,-164.67 82.73,-195.98 111.25,-213.62 113.13,-214.79 115.1,-215.89 117.12,-216.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.61,-220.08 126.17,-220.92 118.44,-213.67 115.61,-220.08"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="211.25,-204.25 127,-204.25 127,-185 211.25,-185 211.25,-204.25"/>
-<text text-anchor="middle" x="169.12" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.82,-148.72C70.28,-156.94 91.67,-168.48 111.25,-176.62 114.8,-178.1 118.52,-179.53 122.28,-180.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.86,-184.1 131.45,-184.04 123.13,-177.48 120.86,-184.1"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61" target="_top" xlink:title="using fibonacci search algorithm finds an index of a given element in a sorted array">
-<polygon fill="white" stroke="#666666" points="213.88,-167.25 124.38,-167.25 124.38,-148 213.88,-148 213.88,-167.25"/>
-<text text-anchor="middle" x="169.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibonacci_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.73,-144.07C87.29,-145.77 100.3,-147.67 112.82,-149.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="112.23,-152.96 122.64,-150.95 113.25,-146.04 112.23,-152.96"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194.75,-130.25 143.5,-130.25 143.5,-111 194.75,-111 194.75,-130.25"/>
-<text text-anchor="middle" x="169.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.73,-133.47C93.43,-131.01 114.52,-128.08 132.07,-125.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.38,-129.13 141.8,-124.28 131.42,-122.19 132.38,-129.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227,-93.25 111.25,-93.25 111.25,-74 227,-74 227,-93.25"/>
-<text text-anchor="middle" x="169.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M56.44,-128.5C70.91,-120.54 92,-109.51 111.25,-101.62 114.86,-100.15 118.63,-98.71 122.45,-97.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.45,-100.71 131.78,-94.16 121.18,-94.08 123.45,-100.71"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.25,-56.25 142,-56.25 142,-37 196.25,-37 196.25,-56.25"/>
-<text text-anchor="middle" x="169.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.74,-128.73C57.58,-112.94 82.87,-82.05 111.25,-64.62 117.33,-60.89 124.26,-57.86 131.14,-55.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.84,-58.88 140.33,-52.54 129.74,-52.2 131.84,-58.88"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.12,-19.25 143.12,-19.25 143.12,0 195.12,0 195.12,-19.25"/>
-<text text-anchor="middle" x="169.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge11_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge11_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.39,-128.69C51.11,-107.03 74.74,-55.32 111.25,-27.62 117.33,-23.01 124.63,-19.56 131.93,-16.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.84,-20.37 141.42,-14.15 130.84,-13.66 132.84,-20.37"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.5,-204.25 263,-204.25 263,-185 358.5,-185 358.5,-204.25"/>
-<text text-anchor="middle" x="310.75" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::empty</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M208.28,-167.74C224.44,-172.02 243.47,-177.06 260.66,-181.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="259.62,-184.96 270.18,-184.14 261.41,-178.19 259.62,-184.96"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="336.38,-167.25 285.12,-167.25 285.12,-148 336.38,-148 336.38,-167.25"/>
-<text text-anchor="middle" x="310.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.3,-157.62C233.44,-157.62 255.56,-157.62 273.69,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.44,-161.13 283.44,-157.63 273.44,-154.13 273.44,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="354,-130.25 267.5,-130.25 267.5,-111 354,-111 354,-130.25"/>
-<text text-anchor="middle" x="310.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M208.28,-147.51C224.44,-143.23 243.47,-138.19 260.66,-133.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.41,-137.06 270.18,-131.11 259.62,-130.29 261.41,-137.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d0d/fibonacci__search_8cpp_a2aa09bef74ee063c1331de0883af4f4f_cgraph_org.svg b/de/d0d/fibonacci__search_8cpp_a2aa09bef74ee063c1331de0883af4f4f_cgraph_org.svg
deleted file mode 100644
index 20a1837ae..000000000
--- a/de/d0d/fibonacci__search_8cpp_a2aa09bef74ee063c1331de0883af4f4f_cgraph_org.svg
+++ /dev/null
@@ -1,219 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: random_tests Pages: 1 -->
-<svg width="367pt" height="286pt"
- viewBox="0.00 0.00 366.50 286.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 282.25)">
-<title>random_tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="random tests which cover cases when we have one, multiple or zero occurences of the value we&#39;re looki...">
-<polygon fill="#999999" stroke="#666666" points="75.25,-148.25 0,-148.25 0,-129 75.25,-129 75.25,-148.25"/>
-<text text-anchor="middle" x="37.62" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">random_tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215,-278.25 123.25,-278.25 123.25,-259 215,-259 215,-278.25"/>
-<text text-anchor="middle" x="169.12" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.37,-148.65C51.03,-170.5 74.57,-222.68 111.25,-250.62 112.41,-251.51 113.61,-252.35 114.85,-253.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="113.11,-256.18 123.58,-257.8 116.4,-250.01 113.11,-256.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="213.88,-241.25 124.38,-241.25 124.38,-222 213.88,-222 213.88,-241.25"/>
-<text text-anchor="middle" x="169.12" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.7,-148.66C57.51,-164.67 82.73,-195.98 111.25,-213.62 113.13,-214.79 115.1,-215.89 117.12,-216.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="115.61,-220.08 126.17,-220.92 118.44,-213.67 115.61,-220.08"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="211.25,-204.25 127,-204.25 127,-185 211.25,-185 211.25,-204.25"/>
-<text text-anchor="middle" x="169.12" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.82,-148.72C70.28,-156.94 91.67,-168.48 111.25,-176.62 114.8,-178.1 118.52,-179.53 122.28,-180.89"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.86,-184.1 131.45,-184.04 123.13,-177.48 120.86,-184.1"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61" target="_top" xlink:title="using fibonacci search algorithm finds an index of a given element in a sorted array">
-<polygon fill="white" stroke="#666666" points="213.88,-167.25 124.38,-167.25 124.38,-148 213.88,-148 213.88,-167.25"/>
-<text text-anchor="middle" x="169.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibonacci_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.73,-144.07C87.29,-145.77 100.3,-147.67 112.82,-149.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="112.23,-152.96 122.64,-150.95 113.25,-146.04 112.23,-152.96"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194.75,-130.25 143.5,-130.25 143.5,-111 194.75,-111 194.75,-130.25"/>
-<text text-anchor="middle" x="169.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.73,-133.47C93.43,-131.01 114.52,-128.08 132.07,-125.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.38,-129.13 141.8,-124.28 131.42,-122.19 132.38,-129.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="227,-93.25 111.25,-93.25 111.25,-74 227,-74 227,-93.25"/>
-<text text-anchor="middle" x="169.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M56.44,-128.5C70.91,-120.54 92,-109.51 111.25,-101.62 114.86,-100.15 118.63,-98.71 122.45,-97.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.45,-100.71 131.78,-94.16 121.18,-94.08 123.45,-100.71"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.25,-56.25 142,-56.25 142,-37 196.25,-37 196.25,-56.25"/>
-<text text-anchor="middle" x="169.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.74,-128.73C57.58,-112.94 82.87,-82.05 111.25,-64.62 117.33,-60.89 124.26,-57.86 131.14,-55.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.84,-58.88 140.33,-52.54 129.74,-52.2 131.84,-58.88"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.12,-19.25 143.12,-19.25 143.12,0 195.12,0 195.12,-19.25"/>
-<text text-anchor="middle" x="169.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge11_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge11_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.39,-128.69C51.11,-107.03 74.74,-55.32 111.25,-27.62 117.33,-23.01 124.63,-19.56 131.93,-16.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.84,-20.37 141.42,-14.15 130.84,-13.66 132.84,-20.37"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.5,-204.25 263,-204.25 263,-185 358.5,-185 358.5,-204.25"/>
-<text text-anchor="middle" x="310.75" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::empty</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M208.28,-167.74C224.44,-172.02 243.47,-177.06 260.66,-181.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="259.62,-184.96 270.18,-184.14 261.41,-178.19 259.62,-184.96"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="336.38,-167.25 285.12,-167.25 285.12,-148 336.38,-148 336.38,-167.25"/>
-<text text-anchor="middle" x="310.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.3,-157.62C233.44,-157.62 255.56,-157.62 273.69,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.44,-161.13 283.44,-157.63 273.44,-154.13 273.44,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="354,-130.25 267.5,-130.25 267.5,-111 354,-111 354,-130.25"/>
-<text text-anchor="middle" x="310.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M208.28,-147.51C224.44,-143.23 243.47,-138.19 260.66,-133.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.41,-137.06 270.18,-131.11 259.62,-130.29 261.41,-137.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d0d/fibonacci__search_8cpp_a5e144326104e57a3808aed7eb098db0d_cgraph.map b/de/d0d/fibonacci__search_8cpp_a5e144326104e57a3808aed7eb098db0d_cgraph.map
deleted file mode 100644
index 40454936d..000000000
--- a/de/d0d/fibonacci__search_8cpp_a5e144326104e57a3808aed7eb098db0d_cgraph.map
+++ /dev/null
@@ -1,25 +0,0 @@
-<map id="no_occurence_tests" name="no_occurence_tests">
-<area shape="rect" id="Node000001" title="random tests for checking performance when an array doesn&#39;t contain an element" alt="" coords="5,179,144,204"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="208,5,330,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="80,177,121,112,152,73,190,40,197,36,200,40,193,44,156,77,125,115,85,180"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/clear.html#" title=" " alt="" coords="209,55,328,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="86,176,129,134,159,110,190,89,200,84,203,89,193,94,162,114,133,138,90,180"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="213,104,325,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="103,176,191,138,207,133,209,138,193,143,105,181"/>
-<area shape="rect" id="Node000005" href="$de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61" title="using fibonacci search algorithm finds an index of a given element in a sorted array" alt="" coords="209,153,328,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="144,180,193,173,194,179,144,185"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/find.html#" title=" " alt="" coords="235,203,303,228"/>
-<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="144,197,220,207,219,212,144,203"/>
-<area shape="rect" id="Node000010" 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="192,252,346,278"/>
-<area shape="poly" id="edge9_Node000001_Node000010" title=" " alt="" coords="106,202,193,238,209,244,208,249,191,243,104,207"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="233,301,305,327"/>
-<area shape="poly" id="edge10_Node000001_Node000011" title=" " alt="" coords="90,203,133,245,162,268,193,288,219,299,217,304,190,293,159,272,130,249,86,207"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/remove.html#" title=" " alt="" coords="224,351,314,376"/>
-<area shape="poly" id="edge11_Node000001_Node000012" title=" " alt="" coords="85,203,125,267,156,305,193,337,211,347,208,352,190,342,152,309,121,271,80,206"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/empty.html#" title=" " alt="" coords="394,104,521,130"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="320,150,390,132,392,137,322,155"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="424,153,492,179"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="329,164,408,164,408,169,329,169"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="400,203,515,228"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="322,177,392,196,390,201,320,182"/>
-</map>
diff --git a/de/d0d/fibonacci__search_8cpp_a5e144326104e57a3808aed7eb098db0d_cgraph.md5 b/de/d0d/fibonacci__search_8cpp_a5e144326104e57a3808aed7eb098db0d_cgraph.md5
deleted file mode 100644
index 6b46d6c27..000000000
--- a/de/d0d/fibonacci__search_8cpp_a5e144326104e57a3808aed7eb098db0d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8973820e20145876825ad453c2baf8af
\ No newline at end of file
diff --git a/de/d0d/fibonacci__search_8cpp_a5e144326104e57a3808aed7eb098db0d_cgraph.svg b/de/d0d/fibonacci__search_8cpp_a5e144326104e57a3808aed7eb098db0d_cgraph.svg
deleted file mode 100644
index 99edcf22f..000000000
--- a/de/d0d/fibonacci__search_8cpp_a5e144326104e57a3808aed7eb098db0d_cgraph.svg
+++ /dev/null
@@ -1,245 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: no_occurence_tests Pages: 1 -->
-<svg width="395pt" height="286pt"
- viewBox="0.00 0.00 395.00 286.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 282.25)">
-<title>no_occurence_tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="random tests for checking performance when an array doesn&#39;t contain an element">
-<polygon fill="#999999" stroke="#666666" points="103.75,-148.25 0,-148.25 0,-129 103.75,-129 103.75,-148.25"/>
-<text text-anchor="middle" x="51.88" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">no_occurence_tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.5,-278.25 151.75,-278.25 151.75,-259 243.5,-259 243.5,-278.25"/>
-<text text-anchor="middle" x="197.62" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M57.9,-148.64C69.37,-170.48 99.58,-222.62 139.75,-250.62 141.3,-251.7 142.91,-252.72 144.58,-253.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.67,-256.64 153.19,-257.88 145.74,-250.35 142.67,-256.64"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242.38,-241.25 152.88,-241.25 152.88,-222 242.38,-222 242.38,-241.25"/>
-<text text-anchor="middle" x="197.62" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.79,-148.58C76.53,-164.49 107.57,-195.65 139.75,-213.62 142.08,-214.92 144.51,-216.14 147.01,-217.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.52,-220.46 156.1,-220.99 148.16,-213.98 145.52,-220.46"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="239.75,-204.25 155.5,-204.25 155.5,-185 239.75,-185 239.75,-204.25"/>
-<text text-anchor="middle" x="197.62" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.04,-148.63C91.47,-156.69 116.94,-168.06 139.75,-176.62 143.66,-178.1 147.76,-179.55 151.88,-180.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.71,-184.26 161.3,-184.07 152.91,-177.61 150.71,-184.26"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61" target="_top" xlink:title="using fibonacci search algorithm finds an index of a given element in a sorted array">
-<polygon fill="white" stroke="#666666" points="242.38,-167.25 152.88,-167.25 152.88,-148 242.38,-148 242.38,-167.25"/>
-<text text-anchor="middle" x="197.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibonacci_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.96,-145.38C116.07,-146.98 129.04,-148.69 141.33,-150.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.5,-153.74 150.88,-151.58 141.42,-146.8 140.5,-153.74"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.25,-130.25 172,-130.25 172,-111 223.25,-111 223.25,-130.25"/>
-<text text-anchor="middle" x="197.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.96,-132.23C122.71,-129.88 143.53,-127.27 160.68,-125.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.9,-128.63 170.39,-123.91 160.03,-121.68 160.9,-128.63"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-93.25 139.75,-93.25 139.75,-74 255.5,-74 255.5,-93.25"/>
-<text text-anchor="middle" x="197.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.78,-128.6C92.2,-120.8 117.3,-109.93 139.75,-101.62 143.84,-100.11 148.12,-98.61 152.43,-97.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.21,-100.58 161.62,-94.13 151.03,-93.93 153.21,-100.58"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224.75,-56.25 170.5,-56.25 170.5,-37 224.75,-37 224.75,-56.25"/>
-<text text-anchor="middle" x="197.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.06,-128.55C76.93,-112.79 107.86,-82.29 139.75,-64.62 145.93,-61.2 152.86,-58.32 159.7,-55.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.32,-59.41 168.8,-53.06 158.21,-52.74 160.32,-59.41"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/remove.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.5,-19.25 163.75,-19.25 163.75,0 231.5,0 231.5,-19.25"/>
-<text text-anchor="middle" x="197.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::remove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge11_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge11_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M57.93,-128.7C69.44,-107.06 99.74,-55.39 139.75,-27.62 143.83,-24.79 148.38,-22.39 153.08,-20.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.93,-23.77 162.07,-16.99 151.47,-17.22 153.93,-23.77"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387,-204.25 291.5,-204.25 291.5,-185 387,-185 387,-204.25"/>
-<text text-anchor="middle" x="339.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::empty</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M236.78,-167.74C252.94,-172.02 271.97,-177.06 289.16,-181.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.12,-184.96 298.68,-184.14 289.91,-178.19 288.12,-184.96"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="364.88,-167.25 313.62,-167.25 313.62,-148 364.88,-148 364.88,-167.25"/>
-<text text-anchor="middle" x="339.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.8,-157.62C261.94,-157.62 284.06,-157.62 302.19,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="301.94,-161.13 311.94,-157.63 301.94,-154.13 301.94,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="382.5,-130.25 296,-130.25 296,-111 382.5,-111 382.5,-130.25"/>
-<text text-anchor="middle" x="339.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M236.78,-147.51C252.94,-143.23 271.97,-138.19 289.16,-133.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.91,-137.06 298.68,-131.11 288.12,-130.29 289.91,-137.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d0d/fibonacci__search_8cpp_a5e144326104e57a3808aed7eb098db0d_cgraph_org.svg b/de/d0d/fibonacci__search_8cpp_a5e144326104e57a3808aed7eb098db0d_cgraph_org.svg
deleted file mode 100644
index 5eceadeb9..000000000
--- a/de/d0d/fibonacci__search_8cpp_a5e144326104e57a3808aed7eb098db0d_cgraph_org.svg
+++ /dev/null
@@ -1,219 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: no_occurence_tests Pages: 1 -->
-<svg width="395pt" height="286pt"
- viewBox="0.00 0.00 395.00 286.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 282.25)">
-<title>no_occurence_tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="random tests for checking performance when an array doesn&#39;t contain an element">
-<polygon fill="#999999" stroke="#666666" points="103.75,-148.25 0,-148.25 0,-129 103.75,-129 103.75,-148.25"/>
-<text text-anchor="middle" x="51.88" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">no_occurence_tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.5,-278.25 151.75,-278.25 151.75,-259 243.5,-259 243.5,-278.25"/>
-<text text-anchor="middle" x="197.62" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M57.9,-148.64C69.37,-170.48 99.58,-222.62 139.75,-250.62 141.3,-251.7 142.91,-252.72 144.58,-253.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.67,-256.64 153.19,-257.88 145.74,-250.35 142.67,-256.64"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242.38,-241.25 152.88,-241.25 152.88,-222 242.38,-222 242.38,-241.25"/>
-<text text-anchor="middle" x="197.62" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M61.79,-148.58C76.53,-164.49 107.57,-195.65 139.75,-213.62 142.08,-214.92 144.51,-216.14 147.01,-217.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.52,-220.46 156.1,-220.99 148.16,-213.98 145.52,-220.46"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="239.75,-204.25 155.5,-204.25 155.5,-185 239.75,-185 239.75,-204.25"/>
-<text text-anchor="middle" x="197.62" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.04,-148.63C91.47,-156.69 116.94,-168.06 139.75,-176.62 143.66,-178.1 147.76,-179.55 151.88,-180.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.71,-184.26 161.3,-184.07 152.91,-177.61 150.71,-184.26"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61" target="_top" xlink:title="using fibonacci search algorithm finds an index of a given element in a sorted array">
-<polygon fill="white" stroke="#666666" points="242.38,-167.25 152.88,-167.25 152.88,-148 242.38,-148 242.38,-167.25"/>
-<text text-anchor="middle" x="197.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibonacci_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.96,-145.38C116.07,-146.98 129.04,-148.69 141.33,-150.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.5,-153.74 150.88,-151.58 141.42,-146.8 140.5,-153.74"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="223.25,-130.25 172,-130.25 172,-111 223.25,-111 223.25,-130.25"/>
-<text text-anchor="middle" x="197.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.96,-132.23C122.71,-129.88 143.53,-127.27 160.68,-125.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.9,-128.63 170.39,-123.91 160.03,-121.68 160.9,-128.63"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.5,-93.25 139.75,-93.25 139.75,-74 255.5,-74 255.5,-93.25"/>
-<text text-anchor="middle" x="197.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge9_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge9_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.78,-128.6C92.2,-120.8 117.3,-109.93 139.75,-101.62 143.84,-100.11 148.12,-98.61 152.43,-97.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.21,-100.58 161.62,-94.13 151.03,-93.93 153.21,-100.58"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224.75,-56.25 170.5,-56.25 170.5,-37 224.75,-37 224.75,-56.25"/>
-<text text-anchor="middle" x="197.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge10_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge10_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.06,-128.55C76.93,-112.79 107.86,-82.29 139.75,-64.62 145.93,-61.2 152.86,-58.32 159.7,-55.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.32,-59.41 168.8,-53.06 158.21,-52.74 160.32,-59.41"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/remove.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.5,-19.25 163.75,-19.25 163.75,0 231.5,0 231.5,-19.25"/>
-<text text-anchor="middle" x="197.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::remove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge11_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge11_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M57.93,-128.7C69.44,-107.06 99.74,-55.39 139.75,-27.62 143.83,-24.79 148.38,-22.39 153.08,-20.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.93,-23.77 162.07,-16.99 151.47,-17.22 153.93,-23.77"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="387,-204.25 291.5,-204.25 291.5,-185 387,-185 387,-204.25"/>
-<text text-anchor="middle" x="339.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::empty</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M236.78,-167.74C252.94,-172.02 271.97,-177.06 289.16,-181.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="288.12,-184.96 298.68,-184.14 289.91,-178.19 288.12,-184.96"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="364.88,-167.25 313.62,-167.25 313.62,-148 364.88,-148 364.88,-167.25"/>
-<text text-anchor="middle" x="339.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M242.8,-157.62C261.94,-157.62 284.06,-157.62 302.19,-157.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="301.94,-161.13 311.94,-157.63 301.94,-154.13 301.94,-161.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="382.5,-130.25 296,-130.25 296,-111 382.5,-111 382.5,-130.25"/>
-<text text-anchor="middle" x="339.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M236.78,-147.51C252.94,-143.23 271.97,-138.19 289.16,-133.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.91,-137.06 298.68,-131.11 288.12,-130.29 289.91,-137.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index f00491c77..000000000
--- a/de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,38 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,204,55,230"/>
-<area shape="rect" id="Node000002" href="$de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d" title="random tests for checking performance when an array doesn&#39;t contain an element" alt="" coords="103,228,241,254"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,218,88,224,87,229,54,224"/>
-<area shape="rect" id="Node000014" href="$de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f" title="random tests which cover cases when we have one, multiple or zero occurences of the value we&#39;re looki..." alt="" coords="122,179,222,204"/>
-<area shape="poly" id="edge13_Node000001_Node000014" title=" " alt="" coords="54,210,106,200,107,206,55,215"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="305,301,427,327"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="203,252,290,288,307,294,305,299,288,293,201,257"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/clear.html#" title=" " alt="" coords="306,351,426,376"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="187,252,230,294,259,317,290,337,300,342,297,347,288,342,256,321,227,298,184,256"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="310,55,422,80"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="225,225,239,215,251,200,258,185,262,154,267,122,274,106,287,90,294,84,298,88,291,93,278,108,272,123,267,154,263,186,256,203,243,219,228,230"/>
-<area shape="rect" id="Node000006" href="$de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61" title="using fibonacci search algorithm finds an index of a given element in a sorted array" alt="" coords="306,104,426,130"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="222,225,239,215,255,196,262,178,270,158,287,139,292,135,295,140,291,143,275,161,267,180,260,199,243,219,225,230"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/find.html#" title=" " alt="" coords="332,153,400,179"/>
-<area shape="poly" id="edge9_Node000002_Node000010" title=" " alt="" coords="214,225,240,214,288,188,316,177,318,182,290,193,242,219,215,230"/>
-<area shape="rect" id="Node000011" 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="289,203,443,228"/>
-<area shape="poly" id="edge10_Node000002_Node000011" title=" " alt="" coords="241,229,273,225,274,230,242,234"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="330,252,402,278"/>
-<area shape="poly" id="edge11_Node000002_Node000012" title=" " alt="" coords="242,247,315,256,315,261,241,252"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/remove.html#" title=" " alt="" coords="321,400,411,426"/>
-<area shape="poly" id="edge12_Node000002_Node000013" title=" " alt="" coords="182,253,222,317,254,354,291,387,308,396,306,401,287,391,250,358,218,320,178,255"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/empty.html#" title=" " alt="" coords="491,55,619,80"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="418,101,488,82,489,87,419,106"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="521,104,589,130"/>
-<area shape="poly" id="edge7_Node000006_Node000008" title=" " alt="" coords="426,114,506,114,506,120,426,120"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="497,153,613,179"/>
-<area shape="poly" id="edge8_Node000006_Node000009" title=" " alt="" coords="419,128,489,146,488,151,418,133"/>
-<area shape="poly" id="edge14_Node000014_Node000003" title=" " alt="" coords="224,202,243,213,259,233,267,252,275,270,291,288,295,291,292,296,287,292,270,273,262,254,255,236,239,218,221,207"/>
-<area shape="poly" id="edge15_Node000014_Node000004" title=" " alt="" coords="224,201,243,214,256,230,263,246,267,277,272,308,279,323,291,338,295,341,292,345,287,341,274,326,267,310,262,278,258,247,251,232,239,217,221,205"/>
-<area shape="poly" id="edge16_Node000014_Node000005" title=" " alt="" coords="183,176,227,134,256,110,288,89,297,84,300,89,290,94,259,114,230,138,187,180"/>
-<area shape="poly" id="edge17_Node000014_Node000006" title=" " alt="" coords="200,176,288,138,304,133,306,138,290,143,202,181"/>
-<area shape="poly" id="edge18_Node000014_Node000010" title=" " alt="" coords="222,182,316,170,317,175,223,188"/>
-<area shape="poly" id="edge19_Node000014_Node000011" title=" " alt="" coords="223,195,274,201,273,207,222,200"/>
-<area shape="poly" id="edge20_Node000014_Node000012" title=" " alt="" coords="215,202,242,213,290,238,316,248,314,253,288,243,240,218,213,207"/>
-<area shape="rect" id="Node000015" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/sort.html#" title=" " alt="" coords="332,5,401,31"/>
-<area shape="poly" id="edge21_Node000014_Node000015" title=" " alt="" coords="178,177,218,112,250,73,288,40,316,26,318,31,290,44,253,77,222,115,182,180"/>
-</map>
diff --git a/de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 8d4a1dfad..000000000
--- a/de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6fb7d86724d008dde5ce24213d4293de
\ No newline at end of file
diff --git a/de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 1b80bd99c..000000000
--- a/de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,362 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="468pt" height="323pt"
- viewBox="0.00 0.00 468.00 323.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 319.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-166.25 0,-166.25 0,-147 37,-147 37,-166.25"/>
-<text text-anchor="middle" x="18.5" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d" target="_top" xlink:title="random tests for checking performance when an array doesn&#39;t contain an element">
-<polygon fill="white" stroke="#666666" points="176.75,-148.25 73,-148.25 73,-129 176.75,-129 176.75,-148.25"/>
-<text text-anchor="middle" x="124.88" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">no_occurence_tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.21,-153.57C44.16,-152.37 52.59,-150.92 61.43,-149.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.01,-152.85 71.27,-147.7 60.82,-145.95 62.01,-152.85"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f" target="_top" xlink:title="random tests which cover cases when we have one, multiple or zero occurences of the value we&#39;re looki...">
-<polygon fill="white" stroke="#666666" points="162.5,-185.25 87.25,-185.25 87.25,-166 162.5,-166 162.5,-185.25"/>
-<text text-anchor="middle" x="124.88" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">random_tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node14 -->
-<g id="edge13_Node000001_Node000014" class="edge">
-<title>Node1&#45;&gt;Node14</title>
-<g id="a_edge13_Node000001_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.21,-159.85C47.94,-161.8 62.21,-164.4 76.06,-166.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.05,-170.29 85.52,-168.64 76.3,-163.41 75.05,-170.29"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="316.5,-93.25 224.75,-93.25 224.75,-74 316.5,-74 316.5,-93.25"/>
-<text text-anchor="middle" x="270.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.78,-128.6C165.2,-120.8 190.3,-109.93 212.75,-101.62 216.84,-100.11 221.12,-98.61 225.43,-97.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.21,-100.58 234.62,-94.13 224.03,-93.93 226.21,-100.58"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="315.38,-56.25 225.88,-56.25 225.88,-37 315.38,-37 315.38,-56.25"/>
-<text text-anchor="middle" x="270.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.06,-128.55C149.93,-112.79 180.86,-82.29 212.75,-64.62 215.08,-63.33 217.52,-62.12 220.02,-60.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.17,-64.29 229.12,-57.29 218.53,-57.81 221.17,-64.29"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312.75,-278.25 228.5,-278.25 228.5,-259 312.75,-259 312.75,-278.25"/>
-<text text-anchor="middle" x="270.62" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M165.68,-148.75C169.73,-150.89 173.53,-153.49 176.75,-156.62 208.79,-187.85 180.19,-219.94 212.75,-250.62 214.39,-252.17 216.16,-253.58 218.03,-254.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="216.26,-257.89 226.7,-259.64 219.63,-251.76 216.26,-257.89"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61" target="_top" xlink:title="using fibonacci search algorithm finds an index of a given element in a sorted array">
-<polygon fill="white" stroke="#666666" points="315.38,-241.25 225.88,-241.25 225.88,-222 315.38,-222 315.38,-241.25"/>
-<text text-anchor="middle" x="270.62" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibonacci_search</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.53,-148.66C168.25,-150.84 172.8,-153.47 176.75,-156.62 200.17,-175.32 189.02,-195.33 212.75,-213.62 213.9,-214.51 215.1,-215.36 216.34,-216.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.58,-219.19 225.04,-220.84 217.89,-213.03 214.58,-219.19"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.25,-204.25 245,-204.25 245,-185 296.25,-185 296.25,-204.25"/>
-<text text-anchor="middle" x="270.62" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::find</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge9_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.87,-148.66C163.51,-151.07 170.43,-153.78 176.75,-156.62 193.44,-164.15 195.94,-169.38 212.75,-176.62 219.43,-179.5 226.72,-182.16 233.79,-184.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.56,-187.77 243.15,-187.43 234.66,-181.1 232.56,-187.77"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="328.5,-167.25 212.75,-167.25 212.75,-148 328.5,-148 328.5,-167.25"/>
-<text text-anchor="middle" x="270.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge10_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge10_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.96,-145.38C184.75,-146.41 192.89,-147.48 200.98,-148.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.47,-152.01 210.84,-149.86 201.39,-145.08 200.47,-152.01"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="297.75,-130.25 243.5,-130.25 243.5,-111 297.75,-111 297.75,-130.25"/>
-<text text-anchor="middle" x="270.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge11_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge11_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.96,-132.23C195.19,-129.95 215.37,-127.42 232.23,-125.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.32,-128.82 241.81,-124.11 231.45,-121.88 232.32,-128.82"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/remove.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.5,-19.25 236.75,-19.25 236.75,0 304.5,0 304.5,-19.25"/>
-<text text-anchor="middle" x="270.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::remove</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node13 -->
-<g id="edge12_Node000002_Node000013" class="edge">
-<title>Node2&#45;&gt;Node13</title>
-<g id="a_edge12_Node000002_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.93,-128.7C142.44,-107.06 172.74,-55.39 212.75,-27.62 216.83,-24.79 221.38,-22.39 226.08,-20.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.93,-23.77 235.07,-16.99 224.47,-17.22 226.93,-23.77"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="460,-278.25 364.5,-278.25 364.5,-259 460,-259 460,-278.25"/>
-<text text-anchor="middle" x="412.25" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::empty</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M309.78,-241.74C325.94,-246.02 344.97,-251.06 362.16,-255.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="361.12,-258.96 371.68,-258.14 362.91,-252.19 361.12,-258.96"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="437.88,-241.25 386.62,-241.25 386.62,-222 437.88,-222 437.88,-241.25"/>
-<text text-anchor="middle" x="412.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M315.8,-231.62C334.94,-231.62 357.06,-231.62 375.19,-231.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="374.94,-235.13 384.94,-231.63 374.94,-228.13 374.94,-235.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="455.5,-204.25 369,-204.25 369,-185 455.5,-185 455.5,-204.25"/>
-<text text-anchor="middle" x="412.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge8_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge8_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M309.78,-221.51C325.94,-217.23 344.97,-212.19 362.16,-207.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="362.91,-211.06 371.68,-205.11 361.12,-204.29 362.91,-211.06"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node3 -->
-<g id="edge14_Node000014_Node000003" class="edge">
-<title>Node14&#45;&gt;Node3</title>
-<g id="a_edge14_Node000014_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.98,-165.8C167.89,-163.58 172.64,-160.88 176.75,-157.62 199.95,-139.26 189.25,-119.6 212.75,-101.62 213.91,-100.74 215.11,-99.9 216.35,-99.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.9,-102.24 225.07,-94.44 214.6,-96.06 217.9,-102.24"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node4 -->
-<g id="edge15_Node000014_Node000004" class="edge">
-<title>Node14&#45;&gt;Node4</title>
-<g id="a_edge15_Node000014_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.84,-166.89C167.94,-164.51 172.78,-161.48 176.75,-157.62 208.55,-126.75 180.44,-94.97 212.75,-64.62 213.79,-63.65 214.88,-62.72 216.02,-61.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.46,-65.07 224.17,-56.87 213.81,-59.1 217.46,-65.07"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node5 -->
-<g id="edge16_Node000014_Node000005" class="edge">
-<title>Node14&#45;&gt;Node5</title>
-<g id="a_edge16_Node000014_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.79,-185.58C149.53,-201.49 180.57,-232.65 212.75,-250.62 215.08,-251.92 217.51,-253.14 220.01,-254.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.52,-257.46 229.1,-257.99 221.16,-250.98 218.52,-257.46"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node6 -->
-<g id="edge17_Node000014_Node000006" class="edge">
-<title>Node14&#45;&gt;Node6</title>
-<g id="a_edge17_Node000014_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.04,-185.63C164.47,-193.69 189.94,-205.06 212.75,-213.62 216.66,-215.1 220.76,-216.55 224.88,-217.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="223.71,-221.26 234.3,-221.07 225.91,-214.61 223.71,-221.26"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node10 -->
-<g id="edge18_Node000014_Node000010" class="edge">
-<title>Node14&#45;&gt;Node10</title>
-<g id="a_edge18_Node000014_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.89,-180.52C184.65,-183.39 212.04,-187.01 233.62,-189.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.06,-193.32 243.44,-191.16 233.98,-186.38 233.06,-193.32"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node11 -->
-<g id="edge19_Node000014_Node000011" class="edge">
-<title>Node14&#45;&gt;Node11</title>
-<g id="a_edge19_Node000014_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.89,-170.99C174.66,-169.52 188.06,-167.84 201.31,-166.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.37,-169.7 210.86,-164.98 200.5,-162.75 201.37,-169.7"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node12 -->
-<g id="edge20_Node000014_Node000012" class="edge">
-<title>Node14&#45;&gt;Node12</title>
-<g id="a_edge20_Node000014_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.56,-165.58C163.28,-163.16 170.31,-160.44 176.75,-157.62 193.32,-150.37 196.06,-145.6 212.75,-138.62 218.99,-136.01 225.76,-133.56 232.36,-131.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.31,-134.73 241.78,-128.36 231.19,-128.06 233.31,-134.73"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.62,-315.25 244.62,-315.25 244.62,-296 296.62,-296 296.62,-315.25"/>
-<text text-anchor="middle" x="270.62" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge21_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge21_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.9,-185.64C142.37,-207.48 172.58,-259.62 212.75,-287.62 218.96,-291.95 226.25,-295.27 233.51,-297.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.31,-301.11 242.9,-300.66 234.34,-294.41 232.31,-301.11"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 3da26d32e..000000000
--- a/de/d0d/fibonacci__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,336 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="468pt" height="323pt"
- viewBox="0.00 0.00 468.00 323.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 319.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-166.25 0,-166.25 0,-147 37,-147 37,-166.25"/>
-<text text-anchor="middle" x="18.5" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d" target="_top" xlink:title="random tests for checking performance when an array doesn&#39;t contain an element">
-<polygon fill="white" stroke="#666666" points="176.75,-148.25 73,-148.25 73,-129 176.75,-129 176.75,-148.25"/>
-<text text-anchor="middle" x="124.88" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">no_occurence_tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.21,-153.57C44.16,-152.37 52.59,-150.92 61.43,-149.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.01,-152.85 71.27,-147.7 60.82,-145.95 62.01,-152.85"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f" target="_top" xlink:title="random tests which cover cases when we have one, multiple or zero occurences of the value we&#39;re looki...">
-<polygon fill="white" stroke="#666666" points="162.5,-185.25 87.25,-185.25 87.25,-166 162.5,-166 162.5,-185.25"/>
-<text text-anchor="middle" x="124.88" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">random_tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node14 -->
-<g id="edge13_Node000001_Node000014" class="edge">
-<title>Node1&#45;&gt;Node14</title>
-<g id="a_edge13_Node000001_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.21,-159.85C47.94,-161.8 62.21,-164.4 76.06,-166.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="75.05,-170.29 85.52,-168.64 76.3,-163.41 75.05,-170.29"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="316.5,-93.25 224.75,-93.25 224.75,-74 316.5,-74 316.5,-93.25"/>
-<text text-anchor="middle" x="270.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.78,-128.6C165.2,-120.8 190.3,-109.93 212.75,-101.62 216.84,-100.11 221.12,-98.61 225.43,-97.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.21,-100.58 234.62,-94.13 224.03,-93.93 226.21,-100.58"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="315.38,-56.25 225.88,-56.25 225.88,-37 315.38,-37 315.38,-56.25"/>
-<text text-anchor="middle" x="270.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.06,-128.55C149.93,-112.79 180.86,-82.29 212.75,-64.62 215.08,-63.33 217.52,-62.12 220.02,-60.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.17,-64.29 229.12,-57.29 218.53,-57.81 221.17,-64.29"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312.75,-278.25 228.5,-278.25 228.5,-259 312.75,-259 312.75,-278.25"/>
-<text text-anchor="middle" x="270.62" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M165.68,-148.75C169.73,-150.89 173.53,-153.49 176.75,-156.62 208.79,-187.85 180.19,-219.94 212.75,-250.62 214.39,-252.17 216.16,-253.58 218.03,-254.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="216.26,-257.89 226.7,-259.64 219.63,-251.76 216.26,-257.89"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61" target="_top" xlink:title="using fibonacci search algorithm finds an index of a given element in a sorted array">
-<polygon fill="white" stroke="#666666" points="315.38,-241.25 225.88,-241.25 225.88,-222 315.38,-222 315.38,-241.25"/>
-<text text-anchor="middle" x="270.62" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">fibonacci_search</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M163.53,-148.66C168.25,-150.84 172.8,-153.47 176.75,-156.62 200.17,-175.32 189.02,-195.33 212.75,-213.62 213.9,-214.51 215.1,-215.36 216.34,-216.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="214.58,-219.19 225.04,-220.84 217.89,-213.03 214.58,-219.19"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.25,-204.25 245,-204.25 245,-185 296.25,-185 296.25,-204.25"/>
-<text text-anchor="middle" x="270.62" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::find</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge9_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge9_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.87,-148.66C163.51,-151.07 170.43,-153.78 176.75,-156.62 193.44,-164.15 195.94,-169.38 212.75,-176.62 219.43,-179.5 226.72,-182.16 233.79,-184.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.56,-187.77 243.15,-187.43 234.66,-181.1 232.56,-187.77"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="328.5,-167.25 212.75,-167.25 212.75,-148 328.5,-148 328.5,-167.25"/>
-<text text-anchor="middle" x="270.62" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node11 -->
-<g id="edge10_Node000002_Node000011" class="edge">
-<title>Node2&#45;&gt;Node11</title>
-<g id="a_edge10_Node000002_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.96,-145.38C184.75,-146.41 192.89,-147.48 200.98,-148.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="200.47,-152.01 210.84,-149.86 201.39,-145.08 200.47,-152.01"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="297.75,-130.25 243.5,-130.25 243.5,-111 297.75,-111 297.75,-130.25"/>
-<text text-anchor="middle" x="270.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge11_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge11_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.96,-132.23C195.19,-129.95 215.37,-127.42 232.23,-125.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.32,-128.82 241.81,-124.11 231.45,-121.88 232.32,-128.82"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/remove.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.5,-19.25 236.75,-19.25 236.75,0 304.5,0 304.5,-19.25"/>
-<text text-anchor="middle" x="270.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::remove</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node13 -->
-<g id="edge12_Node000002_Node000013" class="edge">
-<title>Node2&#45;&gt;Node13</title>
-<g id="a_edge12_Node000002_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.93,-128.7C142.44,-107.06 172.74,-55.39 212.75,-27.62 216.83,-24.79 221.38,-22.39 226.08,-20.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="226.93,-23.77 235.07,-16.99 224.47,-17.22 226.93,-23.77"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="460,-278.25 364.5,-278.25 364.5,-259 460,-259 460,-278.25"/>
-<text text-anchor="middle" x="412.25" y="-264.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::empty</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M309.78,-241.74C325.94,-246.02 344.97,-251.06 362.16,-255.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="361.12,-258.96 371.68,-258.14 362.91,-252.19 361.12,-258.96"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="437.88,-241.25 386.62,-241.25 386.62,-222 437.88,-222 437.88,-241.25"/>
-<text text-anchor="middle" x="412.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M315.8,-231.62C334.94,-231.62 357.06,-231.62 375.19,-231.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="374.94,-235.13 384.94,-231.63 374.94,-228.13 374.94,-235.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="455.5,-204.25 369,-204.25 369,-185 455.5,-185 455.5,-204.25"/>
-<text text-anchor="middle" x="412.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge8_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge8_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M309.78,-221.51C325.94,-217.23 344.97,-212.19 362.16,-207.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="362.91,-211.06 371.68,-205.11 361.12,-204.29 362.91,-211.06"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node3 -->
-<g id="edge14_Node000014_Node000003" class="edge">
-<title>Node14&#45;&gt;Node3</title>
-<g id="a_edge14_Node000014_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.98,-165.8C167.89,-163.58 172.64,-160.88 176.75,-157.62 199.95,-139.26 189.25,-119.6 212.75,-101.62 213.91,-100.74 215.11,-99.9 216.35,-99.1"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.9,-102.24 225.07,-94.44 214.6,-96.06 217.9,-102.24"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node4 -->
-<g id="edge15_Node000014_Node000004" class="edge">
-<title>Node14&#45;&gt;Node4</title>
-<g id="a_edge15_Node000014_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.84,-166.89C167.94,-164.51 172.78,-161.48 176.75,-157.62 208.55,-126.75 180.44,-94.97 212.75,-64.62 213.79,-63.65 214.88,-62.72 216.02,-61.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="217.46,-65.07 224.17,-56.87 213.81,-59.1 217.46,-65.07"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node5 -->
-<g id="edge16_Node000014_Node000005" class="edge">
-<title>Node14&#45;&gt;Node5</title>
-<g id="a_edge16_Node000014_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.79,-185.58C149.53,-201.49 180.57,-232.65 212.75,-250.62 215.08,-251.92 217.51,-253.14 220.01,-254.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.52,-257.46 229.1,-257.99 221.16,-250.98 218.52,-257.46"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node6 -->
-<g id="edge17_Node000014_Node000006" class="edge">
-<title>Node14&#45;&gt;Node6</title>
-<g id="a_edge17_Node000014_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.04,-185.63C164.47,-193.69 189.94,-205.06 212.75,-213.62 216.66,-215.1 220.76,-216.55 224.88,-217.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="223.71,-221.26 234.3,-221.07 225.91,-214.61 223.71,-221.26"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node10 -->
-<g id="edge18_Node000014_Node000010" class="edge">
-<title>Node14&#45;&gt;Node10</title>
-<g id="a_edge18_Node000014_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.89,-180.52C184.65,-183.39 212.04,-187.01 233.62,-189.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.06,-193.32 243.44,-191.16 233.98,-186.38 233.06,-193.32"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node11 -->
-<g id="edge19_Node000014_Node000011" class="edge">
-<title>Node14&#45;&gt;Node11</title>
-<g id="a_edge19_Node000014_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.89,-170.99C174.66,-169.52 188.06,-167.84 201.31,-166.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.37,-169.7 210.86,-164.98 200.5,-162.75 201.37,-169.7"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node12 -->
-<g id="edge20_Node000014_Node000012" class="edge">
-<title>Node14&#45;&gt;Node12</title>
-<g id="a_edge20_Node000014_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.56,-165.58C163.28,-163.16 170.31,-160.44 176.75,-157.62 193.32,-150.37 196.06,-145.6 212.75,-138.62 218.99,-136.01 225.76,-133.56 232.36,-131.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="233.31,-134.73 241.78,-128.36 231.19,-128.06 233.31,-134.73"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="296.62,-315.25 244.62,-315.25 244.62,-296 296.62,-296 296.62,-315.25"/>
-<text text-anchor="middle" x="270.62" y="-301.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge21_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge21_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.9,-185.64C142.37,-207.48 172.58,-259.62 212.75,-287.62 218.96,-291.95 226.25,-295.27 233.51,-297.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.31,-301.11 242.9,-300.66 234.34,-294.41 232.31,-301.11"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d0d/fibonacci__search_8cpp_source.html b/de/d0d/fibonacci__search_8cpp_source.html
new file mode 100644
index 000000000..c6ca44c68
--- /dev/null
+++ b/de/d0d/fibonacci__search_8cpp_source.html
@@ -0,0 +1,253 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: search/fibonacci_search.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/d0d/fibonacci__search_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">fibonacci_search.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/d0d/fibonacci__search_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;vector&gt;</span> <span class="comment">// for std::vector class</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;cassert&gt;</span> <span class="comment">// for assert</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;cstdlib&gt;</span> <span class="comment">// for random numbers</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;algorithm&gt;</span> <span class="comment">// for sorting</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="foldopen" id="foldopen00023" data-start="{" data-end="}">
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"><a class="line" href="../../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61">   23</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61">fibonacci_search</a>(<span class="keyword">const</span> std::vector&lt;int&gt; &amp;arr, <span class="keywordtype">int</span> value){</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="comment">// initialize last and current members of Fibonacci sequence </span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="keywordtype">int</span> last = 0, current = 1;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="keywordtype">int</span> length = arr.size(); <span class="comment">// array size</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="comment">// next member of Fibonacci sequence which is &quot;last&quot; + &quot;current&quot;</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="keywordtype">int</span> next = last + current; </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="comment">// &quot;next&quot; will store the smallest Fibonacci number greater or equal to &quot;length&quot;</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordflow">while</span>(next &lt; length){</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        last = current;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        current = next;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        next = last + current;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    }</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="comment">// &quot;offset&quot; is the end of eliminated range from front</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordtype">int</span> offset = -1, index;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="comment">// while loop until there are elements left to consider.</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="comment">// when &quot;next&quot; becomes 1, last is equal to 0, so search is done,</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="comment">// because arr[offset] will already be eliminated</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">while</span>(next &gt; 1){</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="comment">// check if &quot;last&quot; is valid location</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        index = std::min(offset + last, length-1);</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="comment">// if value is greater than the value at &quot;index&quot;, eliminate the subarray from offset to index</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">if</span>(arr[index] &lt; value){</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            next = current;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            current = last;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>            last = next - current;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>            offset = index;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        <span class="comment">// if value is less than the value at &quot;index&quot;, eliminate the subarray after index+1</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(arr[index] &gt; value){</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            next = last;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>            current = current - last;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            last = next - current;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        <span class="comment">// element is found</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>            <span class="keywordflow">return</span> index;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        }</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    }</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="comment">// comparing the last element</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordflow">if</span>(current &amp;&amp; !arr.empty() &amp;&amp; arr[offset+1] == value){</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">return</span> offset+1;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="comment">// value was not found, return -1</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>}</div>
+</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="foldopen" id="foldopen00072" data-start="{" data-end="}">
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"><a class="line" href="../../de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d">   72</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d">no_occurence_tests</a>(){</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordtype">bool</span> passed = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="keywordtype">int</span> rand_num, rand_value, index, num_tests = 1000;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    std::vector&lt;int&gt; arr;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keywordflow">while</span>(num_tests--){</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        arr.clear();</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; 100; i++){</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            rand_num = std::rand() % 1000;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>            arr.push_back(rand_num);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        }</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        rand_value = std::rand() % 1000;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordflow">while</span>(std::find(arr.begin(), arr.end(), rand_value) != arr.end()){</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            std::remove(arr.begin(), arr.end(), rand_value);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        }</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        sort(arr.begin(), arr.end());</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        index = <a class="code hl_function" href="../../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61">fibonacci_search</a>(arr, rand_value);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        passed = passed &amp;&amp; (index == -1);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="keywordflow">return</span> passed;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>}</div>
+</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="foldopen" id="foldopen00096" data-start="{" data-end="}">
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"><a class="line" href="../../de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f">   96</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f">random_tests</a>(){</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="keywordtype">bool</span> passed = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keywordtype">int</span> rand_num, rand_value, index, real_value, num_tests = 10000;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    std::vector&lt;int&gt; arr;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="keywordflow">while</span>(num_tests--){</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        arr.clear();</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; 100; i++){</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>            rand_num = std::rand() % 1000;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>            arr.push_back(rand_num);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        }</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        rand_value = std::rand() % 1000;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        std::sort(arr.begin(), arr.end());</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        index = <a class="code hl_function" href="../../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61">fibonacci_search</a>(arr, rand_value);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        <span class="keywordflow">if</span>(index != -1){</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>            real_value = arr[index];</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>            passed = passed &amp;&amp; (real_value == rand_value);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>            passed = passed &amp;&amp; (std::find(arr.begin(), arr.end(), rand_value) == arr.end());</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        }</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    }</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <span class="keywordflow">return</span> passed;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>}</div>
+</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span> </div>
+<div class="foldopen" id="foldopen00123" data-start="{" data-end="}">
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"><a class="line" href="../../de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  123</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    assert(<a class="code hl_function" href="../../de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d">no_occurence_tests</a>());</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    assert(<a class="code hl_function" href="../../de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f">random_tests</a>());</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>}</div>
+</div>
+<div class="ttc" id="afibonacci__search_8cpp_html_a0bc61b3903d9a53061bf31e5d110fe61"><div class="ttname"><a href="../../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61">fibonacci_search</a></div><div class="ttdeci">int fibonacci_search(const std::vector&lt; int &gt; &amp;arr, int value)</div><div class="ttdoc">using fibonacci search algorithm finds an index of a given element in a sorted array</div><div class="ttdef"><b>Definition</b> <a href="#l00023">fibonacci_search.cpp:23</a></div></div>
+<div class="ttc" id="afibonacci__search_8cpp_html_a2aa09bef74ee063c1331de0883af4f4f"><div class="ttname"><a href="../../de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f">random_tests</a></div><div class="ttdeci">bool random_tests()</div><div class="ttdoc">random tests which cover cases when we have one, multiple or zero occurences of the value we're looki...</div><div class="ttdef"><b>Definition</b> <a href="#l00096">fibonacci_search.cpp:96</a></div></div>
+<div class="ttc" id="afibonacci__search_8cpp_html_a5e144326104e57a3808aed7eb098db0d"><div class="ttname"><a href="../../de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d">no_occurence_tests</a></div><div class="ttdeci">bool no_occurence_tests()</div><div class="ttdoc">random tests for checking performance when an array doesn't contain an element</div><div class="ttdef"><b>Definition</b> <a href="#l00072">fibonacci_search.cpp:72</a></div></div>
+<div class="ttc" id="afibonacci__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00123">fibonacci_search.cpp:123</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../de/d0d/fibonacci__search_8cpp.html">fibonacci_search.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/d1e/armstrong__number_8cpp_source.html b/de/d1e/armstrong__number_8cpp_source.html
new file mode 100644
index 000000000..e9477baf8
--- /dev/null
+++ b/de/d1e/armstrong__number_8cpp_source.html
@@ -0,0 +1,196 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/armstrong_number.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/d1e/armstrong__number_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">armstrong_number.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cmath&gt;</span>     </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keywordtype">int</span> number_of_digits(<span class="keywordtype">int</span> num) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordtype">int</span> total_digits = 0;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">while</span> (num &gt; 0) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        num = num / 10;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        ++total_digits;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    }</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">return</span> total_digits;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>}</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">is_armstrong</a>(<span class="keywordtype">int</span> number) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="comment">// If the number is less than 0, then it is not an armstrong number.</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordflow">if</span> (number &lt; 0) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</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"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordtype">int</span> temp = number;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="comment">// Finding the total number of digits in the number</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordtype">int</span> total_digits = number_of_digits(number);</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">while</span> (temp &gt; 0) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <span class="keywordtype">int</span> rem = temp % 10;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="comment">// Finding each digit raised to the power total digit and add it to the</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        <span class="comment">// total sum</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> += <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(std::pow(rem, total_digits));</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        temp = temp / 10;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    }</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">return</span> number == <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a>;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>}</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="comment">// is_armstrong(370) returns true.</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">is_armstrong</a>(370) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="comment">// is_armstrong(225) returns false.</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">is_armstrong</a>(225) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="comment">// is_armstrong(-23) returns false.</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">is_armstrong</a>(-23) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="comment">// is_armstrong(153) returns true.</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">is_armstrong</a>(153) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="comment">// is_armstrong(0) returns true.</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">is_armstrong</a>(0) == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="comment">// is_armstrong(12) returns false.</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    assert(<a class="code hl_function" href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">is_armstrong</a>(12) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>}</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00082">generate_parentheses.cpp:82</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacedynamic__programming_html_af046365a8d77a1267acc082f86135a26"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26">dynamic_programming::is_armstrong</a></div><div class="ttdeci">bool is_armstrong(const T &amp;number)</div><div class="ttdoc">Checks if the given number is armstrong or not.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/da7/armstrong__number__templated_8cpp_source.html#l00039">armstrong_number_templated.cpp:39</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00232">vector_ops.hpp:232</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><b>armstrong_number.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/d1e/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p-members.html b/de/d1e/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p-members.html
index a26288082..e34b007c5 100644
--- a/de/d1e/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p-members.html
+++ b/de/d1e/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/d21/classothers_1_1_cache_1_1_d___node.html b/de/d21/classothers_1_1_cache_1_1_d___node.html
index e109de17f..1ef7a4b36 100644
--- a/de/d21/classothers_1_1_cache_1_1_d___node.html
+++ b/de/d21/classothers_1_1_cache_1_1_d___node.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others::Cache::D_Node&lt; T &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: others::Cache::D_Node&lt; T &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -129,17 +146,14 @@ Public Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a8902e7ff872fa3c80fe6ce5f5cf5cc75" id="r_a8902e7ff872fa3c80fe6ce5f5cf5cc75"><td class="memItemLeft" align="right" valign="top"><a id="a8902e7ff872fa3c80fe6ce5f5cf5cc75" name="a8902e7ff872fa3c80fe6ce5f5cf5cc75"></a>
-T&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
-<tr class="memdesc:a8902e7ff872fa3c80fe6ce5f5cf5cc75"><td class="mdescLeft">&#160;</td><td class="mdescRight">data of the node <br /></td></tr>
+<tr class="memitem:a8902e7ff872fa3c80fe6ce5f5cf5cc75" id="r_a8902e7ff872fa3c80fe6ce5f5cf5cc75"><td class="memItemLeft" align="right" valign="top">T&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a></td></tr>
+<tr class="memdesc:a8902e7ff872fa3c80fe6ce5f5cf5cc75"><td class="mdescLeft">&#160;</td><td class="mdescRight">data of the node  <br /></td></tr>
 <tr class="separator:a8902e7ff872fa3c80fe6ce5f5cf5cc75"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a19e954cbb710ea8318bcb6aaef78e2d5" id="r_a19e954cbb710ea8318bcb6aaef78e2d5"><td class="memItemLeft" align="right" valign="top"><a id="a19e954cbb710ea8318bcb6aaef78e2d5" name="a19e954cbb710ea8318bcb6aaef78e2d5"></a>
-<a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a>&lt; T &gt; *&#160;</td><td class="memItemRight" valign="bottom"><b>prev</b></td></tr>
-<tr class="memdesc:a19e954cbb710ea8318bcb6aaef78e2d5"><td class="mdescLeft">&#160;</td><td class="mdescRight">previous node in the doubly linked list <br /></td></tr>
+<tr class="memitem:a19e954cbb710ea8318bcb6aaef78e2d5" id="r_a19e954cbb710ea8318bcb6aaef78e2d5"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a>&lt; T &gt; *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a19e954cbb710ea8318bcb6aaef78e2d5">prev</a></td></tr>
+<tr class="memdesc:a19e954cbb710ea8318bcb6aaef78e2d5"><td class="mdescLeft">&#160;</td><td class="mdescRight">previous node in the doubly linked list  <br /></td></tr>
 <tr class="separator:a19e954cbb710ea8318bcb6aaef78e2d5"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0043eb287c54b3b2fb91ce354878a7bd" id="r_a0043eb287c54b3b2fb91ce354878a7bd"><td class="memItemLeft" align="right" valign="top"><a id="a0043eb287c54b3b2fb91ce354878a7bd" name="a0043eb287c54b3b2fb91ce354878a7bd"></a>
-<a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a>&lt; T &gt; *&#160;</td><td class="memItemRight" valign="bottom"><b>next</b></td></tr>
-<tr class="memdesc:a0043eb287c54b3b2fb91ce354878a7bd"><td class="mdescLeft">&#160;</td><td class="mdescRight">next node in the doubly linked list <br /></td></tr>
+<tr class="memitem:a0043eb287c54b3b2fb91ce354878a7bd" id="r_a0043eb287c54b3b2fb91ce354878a7bd"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a>&lt; T &gt; *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0043eb287c54b3b2fb91ce354878a7bd">next</a></td></tr>
+<tr class="memdesc:a0043eb287c54b3b2fb91ce354878a7bd"><td class="mdescLeft">&#160;</td><td class="mdescRight">next node in the doubly linked list  <br /></td></tr>
 <tr class="separator:a0043eb287c54b3b2fb91ce354878a7bd"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -151,6 +165,8 @@ class others::Cache::D_Node&lt; T &gt;</div><p><a class="el" href="../../db/d8b/
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="adf7731f7bbf68c38e7188d7fd773e83f" name="adf7731f7bbf68c38e7188d7fd773e83f"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#adf7731f7bbf68c38e7188d7fd773e83f">&#9670;&#160;</a></span>D_Node() <span class="overload">[1/2]</span></h2>
@@ -176,10 +192,12 @@ template&lt;typename T &gt; </div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00051">51</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   51</span>: <a class="code hl_variable" href="#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>(<a class="code hl_variable" href="#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>), <a class="code hl_variable" href="#a19e954cbb710ea8318bcb6aaef78e2d5">prev</a>(<span class="keyword">nullptr</span>), <a class="code hl_variable" href="#a0043eb287c54b3b2fb91ce354878a7bd">next</a>(<span class="keyword">nullptr</span>) {}</div>
-<div class="ttc" id="aclassothers_1_1_cache_1_1_d___node_html_a0043eb287c54b3b2fb91ce354878a7bd"><div class="ttname"><a href="#a0043eb287c54b3b2fb91ce354878a7bd">others::Cache::D_Node::next</a></div><div class="ttdeci">D_Node&lt; T &gt; * next</div><div class="ttdoc">next node in the doubly linked list</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:49</div></div>
-<div class="ttc" id="aclassothers_1_1_cache_1_1_d___node_html_a19e954cbb710ea8318bcb6aaef78e2d5"><div class="ttname"><a href="#a19e954cbb710ea8318bcb6aaef78e2d5">others::Cache::D_Node::prev</a></div><div class="ttdeci">D_Node&lt; T &gt; * prev</div><div class="ttdoc">previous node in the doubly linked list</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:48</div></div>
-<div class="ttc" id="aclassothers_1_1_cache_1_1_d___node_html_a8902e7ff872fa3c80fe6ce5f5cf5cc75"><div class="ttname"><a href="#a8902e7ff872fa3c80fe6ce5f5cf5cc75">others::Cache::D_Node::data</a></div><div class="ttdeci">T data</div><div class="ttdoc">data of the node</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:47</div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_d___node_html_a0043eb287c54b3b2fb91ce354878a7bd"><div class="ttname"><a href="#a0043eb287c54b3b2fb91ce354878a7bd">others::Cache::D_Node::next</a></div><div class="ttdeci">D_Node&lt; T &gt; * next</div><div class="ttdoc">next node in the doubly linked list</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d65/lfu__cache_8cpp_source.html#l00049">lfu_cache.cpp:49</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_d___node_html_a19e954cbb710ea8318bcb6aaef78e2d5"><div class="ttname"><a href="#a19e954cbb710ea8318bcb6aaef78e2d5">others::Cache::D_Node::prev</a></div><div class="ttdeci">D_Node&lt; T &gt; * prev</div><div class="ttdoc">previous node in the doubly linked list</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d65/lfu__cache_8cpp_source.html#l00048">lfu_cache.cpp:48</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_d___node_html_a8902e7ff872fa3c80fe6ce5f5cf5cc75"><div class="ttname"><a href="#a8902e7ff872fa3c80fe6ce5f5cf5cc75">others::Cache::D_Node::data</a></div><div class="ttdeci">T data</div><div class="ttdoc">data of the node</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d65/lfu__cache_8cpp_source.html#l00047">lfu_cache.cpp:47</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -207,13 +225,76 @@ template&lt;typename T &gt; </div>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   48</span>: <a class="code hl_variable" href="#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>(<a class="code hl_variable" href="#a8902e7ff872fa3c80fe6ce5f5cf5cc75">data</a>), <a class="code hl_variable" href="#a19e954cbb710ea8318bcb6aaef78e2d5">prev</a>(<span class="keyword">nullptr</span>), <a class="code hl_variable" href="#a0043eb287c54b3b2fb91ce354878a7bd">next</a>(<span class="keyword">nullptr</span>) {}</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a8902e7ff872fa3c80fe6ce5f5cf5cc75" name="a8902e7ff872fa3c80fe6ce5f5cf5cc75"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a8902e7ff872fa3c80fe6ce5f5cf5cc75">&#9670;&#160;</a></span>data</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename T &gt; </div>
+      <table class="memname">
+        <tr>
+          <td class="memname">T <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node</a>&lt; T &gt;::data</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>data of the node </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a0043eb287c54b3b2fb91ce354878a7bd" name="a0043eb287c54b3b2fb91ce354878a7bd"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a0043eb287c54b3b2fb91ce354878a7bd">&#9670;&#160;</a></span>next</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename T &gt; </div>
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a>&lt; T &gt; * <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node</a>&lt; T &gt;::next</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>next node in the doubly linked list </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00049">49</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a19e954cbb710ea8318bcb6aaef78e2d5" name="a19e954cbb710ea8318bcb6aaef78e2d5"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a19e954cbb710ea8318bcb6aaef78e2d5">&#9670;&#160;</a></span>prev</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename T &gt; </div>
+      <table class="memname">
+        <tr>
+          <td class="memname"><a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a>&lt; T &gt; * <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">others::Cache::D_Node</a>&lt; T &gt;::prev</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p>previous node in the doubly linked list </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following files:<ul>
-<li>others/<a class="el" href="../../d9/d65/lfu__cache_8cpp.html">lfu_cache.cpp</a></li>
-<li>others/<a class="el" href="../../dc/daa/lru__cache2_8cpp.html">lru_cache2.cpp</a></li>
+<li>others/<a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a></li>
+<li>others/<a class="el" href="../../dc/daa/lru__cache2_8cpp_source.html">lru_cache2.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/de/d23/disjoint__set_8cpp.html b/de/d23/disjoint__set_8cpp.html
index 4adfcf609..c6f4e8b2b 100644
--- a/de/d23/disjoint__set_8cpp.html
+++ b/de/d23/disjoint__set_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/disjoint_set.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/disjoint_set.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,7 +137,9 @@ Include dependency graph for disjoint_set.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/dee/disjoint__set_8cpp__incl.svg" width="168" height="126"><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">
+</div>
+<p><a href="../../de/d23/disjoint__set_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a010965fc5f16cca5a62506afab24e4ec" id="r_a010965fc5f16cca5a62506afab24e4ec"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a010965fc5f16cca5a62506afab24e4ec">CreateSet</a> (int n)</td></tr>
@@ -136,17 +155,17 @@ Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:a31ade23371565792a3434bc6f2e3bdef" id="r_a31ade23371565792a3434bc6f2e3bdef"><td class="memItemLeft" align="right" valign="top"><a id="a31ade23371565792a3434bc6f2e3bdef" name="a31ade23371565792a3434bc6f2e3bdef"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>root</b></td></tr>
+<tr class="memitem:a31ade23371565792a3434bc6f2e3bdef" id="r_a31ade23371565792a3434bc6f2e3bdef"><td class="memItemLeft" align="right" valign="top">vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a31ade23371565792a3434bc6f2e3bdef">root</a></td></tr>
 <tr class="separator:a31ade23371565792a3434bc6f2e3bdef"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a9bbf7f3dcc785986a407cfb70f54e303" id="r_a9bbf7f3dcc785986a407cfb70f54e303"><td class="memItemLeft" align="right" valign="top"><a id="a9bbf7f3dcc785986a407cfb70f54e303" name="a9bbf7f3dcc785986a407cfb70f54e303"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>rank</b></td></tr>
+<tr class="memitem:a9bbf7f3dcc785986a407cfb70f54e303" id="r_a9bbf7f3dcc785986a407cfb70f54e303"><td class="memItemLeft" align="right" valign="top">vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9bbf7f3dcc785986a407cfb70f54e303">rank</a></td></tr>
 <tr class="separator:a9bbf7f3dcc785986a407cfb70f54e303"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Disjoint-set_data_structure" target="_blank">Disjoint Sets Data Structure (Disjoint Sets)</a> </p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/leoyang429" target="_blank">leoyang429</a></dd></dl>
 <p>A disjoint set data structure (also called union find or merge find set) is a data structure that tracks a set of elements partitioned into a number of disjoint (non-overlapping) subsets. Some situations where disjoint sets can be used are- to find connected components of a graph, kruskal's algorithm for finding <a class="el" href="../../d4/d12/namespace_minimum.html" title="Implementation of Minimum Edit Distance algorithm.">Minimum</a> Spanning Tree etc. There are two operation which we perform on disjoint sets - 1) Union 2) Find </p>
+
+<p class="definition">Definition in file <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html">disjoint_set.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a010965fc5f16cca5a62506afab24e4ec" name="a010965fc5f16cca5a62506afab24e4ec"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a010965fc5f16cca5a62506afab24e4ec">&#9670;&#160;</a></span>CreateSet()</h2>
@@ -168,14 +187,15 @@ Variables</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html">disjoint_set.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   37</span>                      {</div>
-<div class="line"><span class="lineno">   38</span>    root = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;int&gt;</a>(n + 1);</div>
-<div class="line"><span class="lineno">   39</span>    rank = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;int&gt;</a>(n + 1, 1);</div>
+<div class="line"><span class="lineno">   38</span>    root = vector&lt;int&gt;(n + 1);</div>
+<div class="line"><span class="lineno">   39</span>    rank = vector&lt;int&gt;(n + 1, 1);</div>
 <div class="line"><span class="lineno">   40</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= n; ++i) {</div>
 <div class="line"><span class="lineno">   41</span>        root[i] = i;</div>
 <div class="line"><span class="lineno">   42</span>    }</div>
 <div class="line"><span class="lineno">   43</span>}</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>
 </div>
@@ -200,19 +220,16 @@ Variables</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>set to which x belongs to </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html">disjoint_set.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   53</span>                {</div>
 <div class="line"><span class="lineno">   54</span>    <span class="keywordflow">if</span> (root[x] == x) {</div>
 <div class="line"><span class="lineno">   55</span>        <span class="keywordflow">return</span> x;</div>
 <div class="line"><span class="lineno">   56</span>    }</div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordflow">return</span> root[x] = <a class="code hl_function" href="#a34b9ead0608e676d9ae5188672427cc8">Find</a>(root[x]);</div>
 <div class="line"><span class="lineno">   58</span>}</div>
-<div class="ttc" id="adisjoint__set_8cpp_html_a34b9ead0608e676d9ae5188672427cc8"><div class="ttname"><a href="#a34b9ead0608e676d9ae5188672427cc8">Find</a></div><div class="ttdeci">int Find(int x)</div><div class="ttdef"><b>Definition</b> disjoint_set.cpp:53</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d23/disjoint__set_8cpp_a34b9ead0608e676d9ae5188672427cc8_cgraph.svg" width="58" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="adisjoint__set_8cpp_html_a34b9ead0608e676d9ae5188672427cc8"><div class="ttname"><a href="#a34b9ead0608e676d9ae5188672427cc8">Find</a></div><div class="ttdeci">int Find(int x)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d23/disjoint__set_8cpp_source.html#l00053">disjoint_set.cpp:53</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2fb0a7cd26a477e2d48ba7e0118bc985" name="a2fb0a7cd26a477e2d48ba7e0118bc985"></a>
@@ -240,13 +257,10 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">   67</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a34b9ead0608e676d9ae5188672427cc8">Find</a>(x) == <a class="code hl_function" href="#a34b9ead0608e676d9ae5188672427cc8">Find</a>(y); }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d23/disjoint__set_8cpp_a2fb0a7cd26a477e2d48ba7e0118bc985_cgraph.svg" width="206" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html">disjoint_set.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   67</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#a34b9ead0608e676d9ae5188672427cc8">Find</a>(x) == <a class="code hl_function" href="#a34b9ead0608e676d9ae5188672427cc8">Find</a>(y); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -264,39 +278,35 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html#l00093">93</a> of file <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html">disjoint_set.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   93</span>           {</div>
 <div class="line"><span class="lineno">   94</span>    <span class="comment">// tests CreateSet &amp; Find</span></div>
 <div class="line"><span class="lineno">   95</span>    <span class="keywordtype">int</span> n = 100;</div>
 <div class="line"><span class="lineno">   96</span>    <a class="code hl_function" href="#a010965fc5f16cca5a62506afab24e4ec">CreateSet</a>(n);</div>
 <div class="line"><span class="lineno">   97</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= 100; ++i) {</div>
 <div class="line"><span class="lineno">   98</span>        <span class="keywordflow">if</span> (root[i] != i) {</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">cout</a> &lt;&lt; <span class="stringliteral">&quot;Fail&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><span class="lineno">   99</span>            cout &lt;&lt; <span class="stringliteral">&quot;Fail&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">  100</span>            <span class="keywordflow">break</span>;</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">// tests InSameUnion &amp; Union</span></div>
-<div class="line"><span class="lineno">  104</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;1 and 2 are initially not in the same subset&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><span class="lineno">  104</span>    cout &lt;&lt; <span class="stringliteral">&quot;1 and 2 are initially not in the same subset&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">  105</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="#a2fb0a7cd26a477e2d48ba7e0118bc985">InSameUnion</a>(1, 2)) {</div>
-<div class="line"><span class="lineno">  106</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;Fail&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><span class="lineno">  106</span>        cout &lt;&lt; <span class="stringliteral">&quot;Fail&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">  107</span>    }</div>
 <div class="line"><span class="lineno">  108</span>    <a class="code hl_function" href="#a44481bb75386fbb0f958a388d4b9f757">Union</a>(1, 2);</div>
-<div class="line"><span class="lineno">  109</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;1 and 2 are now in the same subset&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><span class="lineno">  109</span>    cout &lt;&lt; <span class="stringliteral">&quot;1 and 2 are now in the same subset&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">  110</span>    <span class="keywordflow">if</span> (!<a class="code hl_function" href="#a2fb0a7cd26a477e2d48ba7e0118bc985">InSameUnion</a>(1, 2)) {</div>
-<div class="line"><span class="lineno">  111</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;Fail&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><span class="lineno">  111</span>        cout &lt;&lt; <span class="stringliteral">&quot;Fail&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">  112</span>    }</div>
 <div class="line"><span class="lineno">  113</span>    <span class="keywordflow">return</span> 0;</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="adisjoint__set_8cpp_html_a010965fc5f16cca5a62506afab24e4ec"><div class="ttname"><a href="#a010965fc5f16cca5a62506afab24e4ec">CreateSet</a></div><div class="ttdeci">void CreateSet(int n)</div><div class="ttdef"><b>Definition</b> disjoint_set.cpp:37</div></div>
-<div class="ttc" id="adisjoint__set_8cpp_html_a2fb0a7cd26a477e2d48ba7e0118bc985"><div class="ttname"><a href="#a2fb0a7cd26a477e2d48ba7e0118bc985">InSameUnion</a></div><div class="ttdeci">bool InSameUnion(int x, int y)</div><div class="ttdef"><b>Definition</b> disjoint_set.cpp:67</div></div>
-<div class="ttc" id="adisjoint__set_8cpp_html_a44481bb75386fbb0f958a388d4b9f757"><div class="ttname"><a href="#a44481bb75386fbb0f958a388d4b9f757">Union</a></div><div class="ttdeci">void Union(int x, int y)</div><div class="ttdef"><b>Definition</b> disjoint_set.cpp:78</div></div>
-<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> matrix_exponentiation.cpp:36</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d23/disjoint__set_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="303" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="adisjoint__set_8cpp_html_a010965fc5f16cca5a62506afab24e4ec"><div class="ttname"><a href="#a010965fc5f16cca5a62506afab24e4ec">CreateSet</a></div><div class="ttdeci">void CreateSet(int n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d23/disjoint__set_8cpp_source.html#l00037">disjoint_set.cpp:37</a></div></div>
+<div class="ttc" id="adisjoint__set_8cpp_html_a2fb0a7cd26a477e2d48ba7e0118bc985"><div class="ttname"><a href="#a2fb0a7cd26a477e2d48ba7e0118bc985">InSameUnion</a></div><div class="ttdeci">bool InSameUnion(int x, int y)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d23/disjoint__set_8cpp_source.html#l00067">disjoint_set.cpp:67</a></div></div>
+<div class="ttc" id="adisjoint__set_8cpp_html_a44481bb75386fbb0f958a388d4b9f757"><div class="ttname"><a href="#a44481bb75386fbb0f958a388d4b9f757">Union</a></div><div class="ttdeci">void Union(int x, int y)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d23/disjoint__set_8cpp_source.html#l00078">disjoint_set.cpp:78</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a44481bb75386fbb0f958a388d4b9f757" name="a44481bb75386fbb0f958a388d4b9f757"></a>
@@ -324,6 +334,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html#l00078">78</a> of file <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html">disjoint_set.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   78</span>                         {</div>
 <div class="line"><span class="lineno">   79</span>    <span class="keywordtype">int</span> a = <a class="code hl_function" href="#a34b9ead0608e676d9ae5188672427cc8">Find</a>(x), b = <a class="code hl_function" href="#a34b9ead0608e676d9ae5188672427cc8">Find</a>(y);</div>
 <div class="line"><span class="lineno">   80</span>    <span class="keywordflow">if</span> (a != b) {</div>
@@ -337,11 +349,39 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   88</span>        }</div>
 <div class="line"><span class="lineno">   89</span>    }</div>
 <div class="line"><span class="lineno">   90</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d23/disjoint__set_8cpp_a44481bb75386fbb0f958a388d4b9f757_cgraph.svg" width="160" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Variable Documentation</h2>
+<a id="a9bbf7f3dcc785986a407cfb70f54e303" name="a9bbf7f3dcc785986a407cfb70f54e303"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a9bbf7f3dcc785986a407cfb70f54e303">&#9670;&#160;</a></span>rank</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">vector&lt;int&gt; rank</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html">disjoint_set.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a31ade23371565792a3434bc6f2e3bdef" name="a31ade23371565792a3434bc6f2e3bdef"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a31ade23371565792a3434bc6f2e3bdef">&#9670;&#160;</a></span>root</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">vector&lt;int&gt; root</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../de/d23/disjoint__set_8cpp_source.html">disjoint_set.cpp</a>.</p>
 
 </div>
 </div>
diff --git a/de/d23/disjoint__set_8cpp_a2fb0a7cd26a477e2d48ba7e0118bc985_cgraph.map b/de/d23/disjoint__set_8cpp_a2fb0a7cd26a477e2d48ba7e0118bc985_cgraph.map
deleted file mode 100644
index 58f9ee014..000000000
--- a/de/d23/disjoint__set_8cpp_a2fb0a7cd26a477e2d48ba7e0118bc985_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="InSameUnion" name="InSameUnion">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,106,55"/>
-<area shape="rect" id="Node000002" href="$de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8" title=" " alt="" coords="154,29,200,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="106,40,138,40,138,45,106,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="155,30,151,21,154,11,163,5,177,3,192,5,200,12,197,16,190,10,177,8,165,10,158,14,157,20,160,28"/>
-</map>
diff --git a/de/d23/disjoint__set_8cpp_a2fb0a7cd26a477e2d48ba7e0118bc985_cgraph.md5 b/de/d23/disjoint__set_8cpp_a2fb0a7cd26a477e2d48ba7e0118bc985_cgraph.md5
deleted file mode 100644
index 6e021fc11..000000000
--- a/de/d23/disjoint__set_8cpp_a2fb0a7cd26a477e2d48ba7e0118bc985_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e0f60aaa0b5cafd089f8cbed751f591a
\ No newline at end of file
diff --git a/de/d23/disjoint__set_8cpp_a2fb0a7cd26a477e2d48ba7e0118bc985_cgraph.svg b/de/d23/disjoint__set_8cpp_a2fb0a7cd26a477e2d48ba7e0118bc985_cgraph.svg
deleted file mode 100644
index d46b2c322..000000000
--- a/de/d23/disjoint__set_8cpp_a2fb0a7cd26a477e2d48ba7e0118bc985_cgraph.svg
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: InSameUnion Pages: 1 -->
-<svg width="154pt" height="45pt"
- viewBox="0.00 0.00 154.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>InSameUnion</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="75.25,-19.25 0,-19.25 0,0 75.25,0 75.25,-19.25"/>
-<text text-anchor="middle" x="37.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">InSameUnion</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146,-19.25 111.25,-19.25 111.25,0 146,0 146,-19.25"/>
-<text text-anchor="middle" x="128.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.6,-9.62C83.52,-9.62 91.78,-9.62 99.32,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.27,-13.13 109.27,-9.63 99.27,-6.13 99.27,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.38,-19.54C107.88,-28.15 112.63,-37.25 128.62,-37.25 137.37,-37.25 142.76,-34.53 144.78,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.27,-30.29 143.13,-21.03 141.37,-31.48 148.27,-30.29"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d23/disjoint__set_8cpp_a2fb0a7cd26a477e2d48ba7e0118bc985_cgraph_org.svg b/de/d23/disjoint__set_8cpp_a2fb0a7cd26a477e2d48ba7e0118bc985_cgraph_org.svg
deleted file mode 100644
index b73a47707..000000000
--- a/de/d23/disjoint__set_8cpp_a2fb0a7cd26a477e2d48ba7e0118bc985_cgraph_org.svg
+++ /dev/null
@@ -1,48 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: InSameUnion Pages: 1 -->
-<svg width="154pt" height="45pt"
- viewBox="0.00 0.00 154.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>InSameUnion</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="75.25,-19.25 0,-19.25 0,0 75.25,0 75.25,-19.25"/>
-<text text-anchor="middle" x="37.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">InSameUnion</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="146,-19.25 111.25,-19.25 111.25,0 146,0 146,-19.25"/>
-<text text-anchor="middle" x="128.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.6,-9.62C83.52,-9.62 91.78,-9.62 99.32,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.27,-13.13 109.27,-9.63 99.27,-6.13 99.27,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.38,-19.54C107.88,-28.15 112.63,-37.25 128.62,-37.25 137.37,-37.25 142.76,-34.53 144.78,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.27,-30.29 143.13,-21.03 141.37,-31.48 148.27,-30.29"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d23/disjoint__set_8cpp_a34b9ead0608e676d9ae5188672427cc8_cgraph.map b/de/d23/disjoint__set_8cpp_a34b9ead0608e676d9ae5188672427cc8_cgraph.map
deleted file mode 100644
index 53a3496c6..000000000
--- a/de/d23/disjoint__set_8cpp_a34b9ead0608e676d9ae5188672427cc8_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="Find" name="Find">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,52,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="19,29,18,12,22,5,29,3,36,6,39,13,34,15,32,10,28,8,25,9,23,13,24,29"/>
-</map>
diff --git a/de/d23/disjoint__set_8cpp_a34b9ead0608e676d9ae5188672427cc8_cgraph.md5 b/de/d23/disjoint__set_8cpp_a34b9ead0608e676d9ae5188672427cc8_cgraph.md5
deleted file mode 100644
index c9a87bc42..000000000
--- a/de/d23/disjoint__set_8cpp_a34b9ead0608e676d9ae5188672427cc8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6e59dcc4b6d8cd998a84bd7d883f2d82
\ No newline at end of file
diff --git a/de/d23/disjoint__set_8cpp_a34b9ead0608e676d9ae5188672427cc8_cgraph.svg b/de/d23/disjoint__set_8cpp_a34b9ead0608e676d9ae5188672427cc8_cgraph.svg
deleted file mode 100644
index 6a8e6ff90..000000000
--- a/de/d23/disjoint__set_8cpp_a34b9ead0608e676d9ae5188672427cc8_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Find Pages: 1 -->
-<svg width="43pt" height="45pt"
- viewBox="0.00 0.00 42.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>Find</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="34.75,-19.25 0,-19.25 0,0 34.75,0 34.75,-19.25"/>
-<text text-anchor="middle" x="17.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M11.93,-19.54C9.45,-28.15 11.27,-37.25 17.38,-37.25 20.62,-37.25 22.65,-34.68 23.47,-30.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="26.97,-30.83 22.9,-21.05 19.98,-31.23 26.97,-30.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d23/disjoint__set_8cpp_a34b9ead0608e676d9ae5188672427cc8_cgraph_org.svg b/de/d23/disjoint__set_8cpp_a34b9ead0608e676d9ae5188672427cc8_cgraph_org.svg
deleted file mode 100644
index e5789d5d5..000000000
--- a/de/d23/disjoint__set_8cpp_a34b9ead0608e676d9ae5188672427cc8_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Find Pages: 1 -->
-<svg width="43pt" height="45pt"
- viewBox="0.00 0.00 42.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>Find</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="34.75,-19.25 0,-19.25 0,0 34.75,0 34.75,-19.25"/>
-<text text-anchor="middle" x="17.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M11.93,-19.54C9.45,-28.15 11.27,-37.25 17.38,-37.25 20.62,-37.25 22.65,-34.68 23.47,-30.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="26.97,-30.83 22.9,-21.05 19.98,-31.23 26.97,-30.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d23/disjoint__set_8cpp_a44481bb75386fbb0f958a388d4b9f757_cgraph.map b/de/d23/disjoint__set_8cpp_a44481bb75386fbb0f958a388d4b9f757_cgraph.map
deleted file mode 100644
index 7f2af1c1d..000000000
--- a/de/d23/disjoint__set_8cpp_a44481bb75386fbb0f958a388d4b9f757_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="Union" name="Union">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,61,55"/>
-<area shape="rect" id="Node000002" href="$de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8" title=" " alt="" coords="109,29,155,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="61,40,93,40,93,45,61,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="114,30,111,21,113,11,120,5,132,3,145,5,151,12,147,16,142,10,132,8,122,10,117,14,116,20,119,28"/>
-</map>
diff --git a/de/d23/disjoint__set_8cpp_a44481bb75386fbb0f958a388d4b9f757_cgraph.md5 b/de/d23/disjoint__set_8cpp_a44481bb75386fbb0f958a388d4b9f757_cgraph.md5
deleted file mode 100644
index 92927847d..000000000
--- a/de/d23/disjoint__set_8cpp_a44481bb75386fbb0f958a388d4b9f757_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-45711c07013d7165313da2cc219dfa3a
\ No newline at end of file
diff --git a/de/d23/disjoint__set_8cpp_a44481bb75386fbb0f958a388d4b9f757_cgraph.svg b/de/d23/disjoint__set_8cpp_a44481bb75386fbb0f958a388d4b9f757_cgraph.svg
deleted file mode 100644
index 059b7dcc3..000000000
--- a/de/d23/disjoint__set_8cpp_a44481bb75386fbb0f958a388d4b9f757_cgraph.svg
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Union Pages: 1 -->
-<svg width="120pt" height="45pt"
- viewBox="0.00 0.00 120.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>Union</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="41.5,-19.25 0,-19.25 0,0 41.5,0 41.5,-19.25"/>
-<text text-anchor="middle" x="20.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Union</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="112.25,-19.25 77.5,-19.25 77.5,0 112.25,0 112.25,-19.25"/>
-<text text-anchor="middle" x="94.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M41.84,-9.62C49.26,-9.62 57.81,-9.62 65.8,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.78,-13.13 75.78,-9.63 65.78,-6.13 65.78,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.27,-19.54C77.98,-28.15 81.85,-37.25 94.88,-37.25 102,-37.25 106.39,-34.53 108.03,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.54,-30.46 106.69,-21.04 104.61,-31.43 111.54,-30.46"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d23/disjoint__set_8cpp_a44481bb75386fbb0f958a388d4b9f757_cgraph_org.svg b/de/d23/disjoint__set_8cpp_a44481bb75386fbb0f958a388d4b9f757_cgraph_org.svg
deleted file mode 100644
index 7fa2894ad..000000000
--- a/de/d23/disjoint__set_8cpp_a44481bb75386fbb0f958a388d4b9f757_cgraph_org.svg
+++ /dev/null
@@ -1,48 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: Union Pages: 1 -->
-<svg width="120pt" height="45pt"
- viewBox="0.00 0.00 120.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>Union</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="41.5,-19.25 0,-19.25 0,0 41.5,0 41.5,-19.25"/>
-<text text-anchor="middle" x="20.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Union</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="112.25,-19.25 77.5,-19.25 77.5,0 112.25,0 112.25,-19.25"/>
-<text text-anchor="middle" x="94.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M41.84,-9.62C49.26,-9.62 57.81,-9.62 65.8,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.78,-13.13 75.78,-9.63 65.78,-6.13 65.78,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M83.27,-19.54C77.98,-28.15 81.85,-37.25 94.88,-37.25 102,-37.25 106.39,-34.53 108.03,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.54,-30.46 106.69,-21.04 104.61,-31.43 111.54,-30.46"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d23/disjoint__set_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d23/disjoint__set_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 71bc10e1d..000000000
--- a/de/d23/disjoint__set_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,55,80"/>
-<area shape="rect" id="Node000002" href="$de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec" title=" " alt="" coords="113,5,193,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,55,104,35,106,40,56,60"/>
-<area shape="rect" id="Node000003" href="$de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985" title=" " alt="" coords="103,55,203,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,65,87,65,87,70,55,70"/>
-<area shape="rect" id="Node000005" href="$de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757" title=" " alt="" coords="125,104,180,130"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="56,75,112,98,110,103,54,80"/>
-<area shape="rect" id="Node000004" href="$de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8" title=" " alt="" coords="251,80,297,106"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="204,75,236,82,235,87,203,81"/>
-<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="253,81,249,71,251,62,260,56,274,53,289,56,297,63,294,67,287,61,274,59,262,61,256,65,254,71,258,79"/>
-<area shape="poly" id="edge6_Node000005_Node000004" title=" " alt="" coords="181,109,235,98,236,103,182,114"/>
-</map>
diff --git a/de/d23/disjoint__set_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d23/disjoint__set_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index ad91b6f98..000000000
--- a/de/d23/disjoint__set_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bbf9868412c8f74ed959ea6e42abb80c
\ No newline at end of file
diff --git a/de/d23/disjoint__set_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d23/disjoint__set_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index cc7d2780f..000000000
--- a/de/d23/disjoint__set_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="227pt" height="101pt"
- viewBox="0.00 0.00 227.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="140.75,-93.25 80.5,-93.25 80.5,-74 140.75,-74 140.75,-93.25"/>
-<text text-anchor="middle" x="110.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">CreateSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-53.94C47.97,-58.31 61.89,-64.03 74.67,-69.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.05,-72.39 83.63,-72.95 75.71,-65.92 73.05,-72.39"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="148.25,-56.25 73,-56.25 73,-37 148.25,-37 148.25,-56.25"/>
-<text text-anchor="middle" x="110.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">InSameUnion</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-46.62C44.37,-46.62 52.86,-46.62 61.51,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.33,-50.13 71.33,-46.63 61.33,-43.13 61.33,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="131.38,-19.25 89.88,-19.25 89.88,0 131.38,0 131.38,-19.25"/>
-<text text-anchor="middle" x="110.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Union</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-39.31C49.21,-34.43 65.17,-27.88 79.07,-22.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.34,-25.43 88.26,-18.4 77.68,-18.96 80.34,-25.43"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219,-37.25 184.25,-37.25 184.25,-18 219,-18 219,-37.25"/>
-<text text-anchor="middle" x="201.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">Find</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.6,-38.73C156.62,-37.02 164.98,-35.23 172.59,-33.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.25,-37.05 182.3,-31.54 171.79,-30.2 173.25,-37.05"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.38,-37.54C180.88,-46.15 185.63,-55.25 201.62,-55.25 210.37,-55.25 215.76,-52.53 217.78,-48.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.27,-48.29 216.13,-39.03 214.37,-49.48 221.27,-48.29"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge6_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.82,-13.71C143.96,-16.16 159.58,-19.32 172.86,-22.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.82,-25.37 182.31,-23.92 173.2,-18.51 171.82,-25.37"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d23/disjoint__set_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/d23/disjoint__set_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index f2f1fe54b..000000000
--- a/de/d23/disjoint__set_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="227pt" height="101pt"
- viewBox="0.00 0.00 227.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="140.75,-93.25 80.5,-93.25 80.5,-74 140.75,-74 140.75,-93.25"/>
-<text text-anchor="middle" x="110.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">CreateSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-53.94C47.97,-58.31 61.89,-64.03 74.67,-69.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.05,-72.39 83.63,-72.95 75.71,-65.92 73.05,-72.39"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="148.25,-56.25 73,-56.25 73,-37 148.25,-37 148.25,-56.25"/>
-<text text-anchor="middle" x="110.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">InSameUnion</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-46.62C44.37,-46.62 52.86,-46.62 61.51,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.33,-50.13 71.33,-46.63 61.33,-43.13 61.33,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="131.38,-19.25 89.88,-19.25 89.88,0 131.38,0 131.38,-19.25"/>
-<text text-anchor="middle" x="110.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Union</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-39.31C49.21,-34.43 65.17,-27.88 79.07,-22.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.34,-25.43 88.26,-18.4 77.68,-18.96 80.34,-25.43"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="219,-37.25 184.25,-37.25 184.25,-18 219,-18 219,-37.25"/>
-<text text-anchor="middle" x="201.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">Find</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.6,-38.73C156.62,-37.02 164.98,-35.23 172.59,-33.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.25,-37.05 182.3,-31.54 171.79,-30.2 173.25,-37.05"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.38,-37.54C180.88,-46.15 185.63,-55.25 201.62,-55.25 210.37,-55.25 215.76,-52.53 217.78,-48.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.27,-48.29 216.13,-39.03 214.37,-49.48 221.27,-48.29"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge6_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.82,-13.71C143.96,-16.16 159.58,-19.32 172.86,-22.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.82,-25.37 182.31,-23.92 173.2,-18.51 171.82,-25.37"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d23/disjoint__set_8cpp_source.html b/de/d23/disjoint__set_8cpp_source.html
new file mode 100644
index 000000000..14beded89
--- /dev/null
+++ b/de/d23/disjoint__set_8cpp_source.html
@@ -0,0 +1,214 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/disjoint_set.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/d23/disjoint__set_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">disjoint_set.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/d23/disjoint__set_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keyword">using </span>std::cout;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">using </span>std::endl;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">using </span>std::vector;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>vector&lt;int&gt; root, rank;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="}">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec">   37</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec">CreateSet</a>(<span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    root = vector&lt;int&gt;(n + 1);</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    rank = vector&lt;int&gt;(n + 1, 1);</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= n; ++i) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        root[i] = i;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>}</div>
+</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="foldopen" id="foldopen00053" data-start="{" data-end="}">
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8">   53</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8">Find</a>(<span class="keywordtype">int</span> x) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">if</span> (root[x] == x) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="keywordflow">return</span> x;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">return</span> root[x] = <a class="code hl_function" href="../../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8">Find</a>(root[x]);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}</div>
+</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985">   67</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985">InSameUnion</a>(<span class="keywordtype">int</span> x, <span class="keywordtype">int</span> y) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8">Find</a>(x) == <a class="code hl_function" href="../../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8">Find</a>(y); }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="foldopen" id="foldopen00078" data-start="{" data-end="}">
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"><a class="line" href="../../de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757">   78</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757">Union</a>(<span class="keywordtype">int</span> x, <span class="keywordtype">int</span> y) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keywordtype">int</span> a = <a class="code hl_function" href="../../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8">Find</a>(x), b = <a class="code hl_function" href="../../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8">Find</a>(y);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordflow">if</span> (a != b) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <span class="keywordflow">if</span> (rank[a] &lt; rank[b]) {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>            root[a] = b;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rank[a] &gt; rank[b]) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            root[b] = a;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            root[a] = b;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            ++rank[b];</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    }</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>}</div>
+</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="foldopen" id="foldopen00093" data-start="{" data-end="}">
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"><a class="line" href="../../de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   93</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="comment">// tests CreateSet &amp; Find</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="keywordtype">int</span> n = 100;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <a class="code hl_function" href="../../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec">CreateSet</a>(n);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= 100; ++i) {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        <span class="keywordflow">if</span> (root[i] != i) {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>            cout &lt;&lt; <span class="stringliteral">&quot;Fail&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        }</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    }</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="comment">// tests InSameUnion &amp; Union</span></div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    cout &lt;&lt; <span class="stringliteral">&quot;1 and 2 are initially not in the same subset&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="../../de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985">InSameUnion</a>(1, 2)) {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        cout &lt;&lt; <span class="stringliteral">&quot;Fail&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    }</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <a class="code hl_function" href="../../de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757">Union</a>(1, 2);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    cout &lt;&lt; <span class="stringliteral">&quot;1 and 2 are now in the same subset&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985">InSameUnion</a>(1, 2)) {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        cout &lt;&lt; <span class="stringliteral">&quot;Fail&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    }</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>}</div>
+</div>
+<div class="ttc" id="adisjoint__set_8cpp_html_a010965fc5f16cca5a62506afab24e4ec"><div class="ttname"><a href="../../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec">CreateSet</a></div><div class="ttdeci">void CreateSet(int n)</div><div class="ttdef"><b>Definition</b> <a href="#l00037">disjoint_set.cpp:37</a></div></div>
+<div class="ttc" id="adisjoint__set_8cpp_html_a2fb0a7cd26a477e2d48ba7e0118bc985"><div class="ttname"><a href="../../de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985">InSameUnion</a></div><div class="ttdeci">bool InSameUnion(int x, int y)</div><div class="ttdef"><b>Definition</b> <a href="#l00067">disjoint_set.cpp:67</a></div></div>
+<div class="ttc" id="adisjoint__set_8cpp_html_a34b9ead0608e676d9ae5188672427cc8"><div class="ttname"><a href="../../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8">Find</a></div><div class="ttdeci">int Find(int x)</div><div class="ttdef"><b>Definition</b> <a href="#l00053">disjoint_set.cpp:53</a></div></div>
+<div class="ttc" id="adisjoint__set_8cpp_html_a44481bb75386fbb0f958a388d4b9f757"><div class="ttname"><a href="../../de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757">Union</a></div><div class="ttdeci">void Union(int x, int y)</div><div class="ttdef"><b>Definition</b> <a href="#l00078">disjoint_set.cpp:78</a></div></div>
+<div class="ttc" id="adisjoint__set_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00093">disjoint_set.cpp:93</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../de/d23/disjoint__set_8cpp.html">disjoint_set.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/d33/circular__linked__list_8cpp.html b/de/d33/circular__linked__list_8cpp.html
index 4444d1f40..d3cf43c94 100644
--- a/de/d33/circular__linked__list_8cpp.html
+++ b/de/d33/circular__linked__list_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: operations_on_datastructures/circular_linked_list.cpp File Reference</title>
+<title>TheAlgorithms/C++: operations_on_datastructures/circular_linked_list.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for circular_linked_list.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d53/circular__linked__list_8cpp__incl.svg" width="252" height="126"><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">
+</div>
+<p><a href="../../de/d33/circular__linked__list_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">operations_on_datastructures::circular_linked_list::Node</a></td></tr>
@@ -135,7 +154,7 @@ Classes</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></td></tr>
-<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
+<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::vector <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/dcd/namespacecircular__linked__list.html">circular_linked_list</a></td></tr>
 <tr class="memdesc:d4/dcd/namespacecircular__linked__list"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the <a href="https://www.geeksforgeeks.org/circular-linked-list/" target="_blank">Circular Linked List</a> implementation. <br /></td></tr>
@@ -171,6 +190,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation for a <a href="https://www.geeksforgeeks.org/circular-linked-list/" target="_blank">Circular Linked List</a>. </p>
 <p>A Circular Linked List is a variation on the regular linked list, in which the last node has a pointer to the first node, which creates a full circle. Consequently, this allows any node to be used as the starting point for the list. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/polarvoid" target="_blank">Alvin</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -189,17 +210,14 @@ Functions</h2></td></tr>
 
 <p>main function </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00345">345</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  345</span>           {</div>
 <div class="line"><span class="lineno">  346</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  347</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  348</span>}</div>
-<div class="ttc" id="acircular__linked__list_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of the Circular Linked List.</div><div class="ttdef"><b>Definition</b> circular_linked_list.cpp:333</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="490" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acircular__linked__list_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of the Circular Linked List.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d33/circular__linked__list_8cpp_source.html#l00333">circular_linked_list.cpp:333</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -227,6 +245,8 @@ Here is the call graph for this function:</div>
 
 <p>Function to test the correctness of the Circular Linked List. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html#l00333">333</a> of file <a class="el" href="../../de/d33/circular__linked__list_8cpp_source.html">circular_linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  333</span>                   {</div>
 <div class="line"><span class="lineno">  334</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a>();</div>
 <div class="line"><span class="lineno">  335</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a>();</div>
@@ -234,17 +254,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  337</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a>();</div>
 <div class="line"><span class="lineno">  338</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a>();</div>
 <div class="line"><span class="lineno">  339</span>}</div>
-<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:75</div></div>
-<div class="ttc" id="anamespacetests_html_a2b9769e44683dcb67fe1083ad91e134d"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a></div><div class="ttdeci">void test4()</div><div class="ttdoc">A Test to check a very large input.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:120</div></div>
-<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check an invalid shift value.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:105</div></div>
-<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an empty vector.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:90</div></div>
-<div class="ttc" id="anamespacetests_html_af7b81d7a1534216af6a36a80135beb86"><div class="ttname"><a href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a></div><div class="ttdeci">void test5()</div><div class="ttdoc">A Test to check a shift of zero.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:143</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="392" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00075">array_left_rotation.cpp:75</a></div></div>
+<div class="ttc" id="anamespacetests_html_a2b9769e44683dcb67fe1083ad91e134d"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a></div><div class="ttdeci">void test4()</div><div class="ttdoc">A Test to check a very large input.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00120">array_left_rotation.cpp:120</a></div></div>
+<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check an invalid shift value.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00105">array_left_rotation.cpp:105</a></div></div>
+<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an empty vector.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00090">array_left_rotation.cpp:90</a></div></div>
+<div class="ttc" id="anamespacetests_html_af7b81d7a1534216af6a36a80135beb86"><div class="ttname"><a href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a></div><div class="ttdeci">void test5()</div><div class="ttdoc">A Test to check a shift of zero.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00143">array_left_rotation.cpp:143</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index f19638a7f..000000000
--- a/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Function to test the correctness of the Circular Linked List." alt="" coords="5,104,49,130"/>
-<area shape="rect" id="Node000002" href="$d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" title="A Test to check an simple case." alt="" coords="97,5,184,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="36,102,61,72,95,40,98,38,101,42,98,44,65,76,40,105"/>
-<area shape="rect" id="Node000003" href="$d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" title="A Test to check an empty vector." alt="" coords="97,55,184,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="48,105,94,85,96,90,50,110"/>
-<area shape="rect" id="Node000004" href="$d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" title="A Test to check an invalid shift value." alt="" coords="97,104,184,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,114,81,114,81,120,49,120"/>
-<area shape="rect" id="Node000005" href="$d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" title="A Test to check a very large input." alt="" coords="97,153,184,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="50,124,96,144,94,149,48,129"/>
-<area shape="rect" id="Node000007" href="$d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" title="A Test to check a shift of zero." alt="" coords="97,203,184,228"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="40,128,65,158,98,189,101,191,98,196,95,194,61,162,36,132"/>
-<area shape="rect" id="Node000006" 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="232,153,386,179"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="184,164,216,164,216,169,184,169"/>
-</map>
diff --git a/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index d3ebfba16..000000000
--- a/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5348230967bad27d038932a2089c6e13
\ No newline at end of file
diff --git a/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 812b5e9e8..000000000
--- a/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,155 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="294pt" height="175pt"
- viewBox="0.00 0.00 293.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the correctness of the Circular Linked List.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-93.25 0,-93.25 0,-74 32.5,-74 32.5,-93.25"/>
-<text text-anchor="middle" x="16.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="134,-167.25 68.5,-167.25 68.5,-148 134,-148 134,-167.25"/>
-<text text-anchor="middle" x="101.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.78,-93.61C34.13,-105.55 50.98,-125.66 68.5,-139.62 69.17,-140.16 69.86,-140.68 70.56,-141.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.61,-144.11 78.89,-146.67 72.45,-138.26 68.61,-144.11"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="134,-130.25 68.5,-130.25 68.5,-111 134,-111 134,-130.25"/>
-<text text-anchor="middle" x="101.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-90.58C42.57,-94.91 55.42,-100.64 67.3,-105.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.87,-109.13 76.43,-110.01 68.72,-102.74 65.87,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="134,-93.25 68.5,-93.25 68.5,-74 134,-74 134,-93.25"/>
-<text text-anchor="middle" x="101.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-83.62C39.78,-83.62 48.31,-83.62 56.93,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.69,-87.13 66.69,-83.63 56.69,-80.13 56.69,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="134,-56.25 68.5,-56.25 68.5,-37 134,-37 134,-56.25"/>
-<text text-anchor="middle" x="101.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-76.67C42.57,-72.34 55.42,-66.61 67.3,-61.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.72,-64.51 76.43,-57.24 65.87,-58.12 68.72,-64.51"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="134,-19.25 68.5,-19.25 68.5,0 134,0 134,-19.25"/>
-<text text-anchor="middle" x="101.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.78,-73.64C34.13,-61.7 50.98,-41.59 68.5,-27.62 69.17,-27.09 69.86,-26.57 70.56,-26.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.45,-28.99 78.89,-20.58 68.61,-23.14 72.45,-28.99"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.75,-56.25 170,-56.25 170,-37 285.75,-37 285.75,-56.25"/>
-<text text-anchor="middle" x="227.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-46.62C141.78,-46.62 149.98,-46.62 158.32,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.23,-50.13 168.23,-46.63 158.23,-43.13 158.23,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index ab6a715e6..000000000
--- a/de/d33/circular__linked__list_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,129 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="294pt" height="175pt"
- viewBox="0.00 0.00 293.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the correctness of the Circular Linked List.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-93.25 0,-93.25 0,-74 32.5,-74 32.5,-93.25"/>
-<text text-anchor="middle" x="16.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="134,-167.25 68.5,-167.25 68.5,-148 134,-148 134,-167.25"/>
-<text text-anchor="middle" x="101.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.78,-93.61C34.13,-105.55 50.98,-125.66 68.5,-139.62 69.17,-140.16 69.86,-140.68 70.56,-141.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.61,-144.11 78.89,-146.67 72.45,-138.26 68.61,-144.11"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="134,-130.25 68.5,-130.25 68.5,-111 134,-111 134,-130.25"/>
-<text text-anchor="middle" x="101.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-90.58C42.57,-94.91 55.42,-100.64 67.3,-105.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.87,-109.13 76.43,-110.01 68.72,-102.74 65.87,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="134,-93.25 68.5,-93.25 68.5,-74 134,-74 134,-93.25"/>
-<text text-anchor="middle" x="101.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-83.62C39.78,-83.62 48.31,-83.62 56.93,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.69,-87.13 66.69,-83.63 56.69,-80.13 56.69,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="134,-56.25 68.5,-56.25 68.5,-37 134,-37 134,-56.25"/>
-<text text-anchor="middle" x="101.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-76.67C42.57,-72.34 55.42,-66.61 67.3,-61.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.72,-64.51 76.43,-57.24 65.87,-58.12 68.72,-64.51"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="134,-19.25 68.5,-19.25 68.5,0 134,0 134,-19.25"/>
-<text text-anchor="middle" x="101.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.78,-73.64C34.13,-61.7 50.98,-41.59 68.5,-27.62 69.17,-27.09 69.86,-26.57 70.56,-26.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.45,-28.99 78.89,-20.58 68.61,-23.14 72.45,-28.99"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.75,-56.25 170,-56.25 170,-37 285.75,-37 285.75,-56.25"/>
-<text text-anchor="middle" x="227.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-46.62C141.78,-46.62 149.98,-46.62 158.32,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.23,-50.13 168.23,-46.63 158.23,-43.13 158.23,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index e3b271b40..000000000
--- a/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="main function" alt="" coords="5,104,55,130"/>
-<area shape="rect" id="Node000002" href="$de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function to test the correctness of the Circular Linked List." alt="" coords="103,104,146,130"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,114,87,114,87,120,55,120"/>
-<area shape="rect" id="Node000003" href="$d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" title="A Test to check an simple case." alt="" coords="194,5,281,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="134,102,159,72,192,40,195,38,198,42,196,44,163,76,138,105"/>
-<area shape="rect" id="Node000004" href="$d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" title="A Test to check an empty vector." alt="" coords="194,55,281,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="145,105,191,85,193,90,148,110"/>
-<area shape="rect" id="Node000005" href="$d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" title="A Test to check an invalid shift value." alt="" coords="194,104,281,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="146,114,179,114,179,120,146,120"/>
-<area shape="rect" id="Node000006" href="$d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" title="A Test to check a very large input." alt="" coords="194,153,281,179"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="148,124,193,144,191,149,145,129"/>
-<area shape="rect" id="Node000008" href="$d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" title="A Test to check a shift of zero." alt="" coords="194,203,281,228"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="138,128,163,158,196,189,198,191,195,196,192,194,159,162,134,132"/>
-<area shape="rect" id="Node000007" 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="329,153,484,179"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="282,164,314,164,314,169,282,169"/>
-</map>
diff --git a/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 1b905a81f..000000000
--- a/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1b0c431d9aa3d9427d987d6d637ad925
\ No newline at end of file
diff --git a/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 1c27e723b..000000000
--- a/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,173 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="367pt" height="175pt"
- viewBox="0.00 0.00 366.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-93.25 0,-93.25 0,-74 37,-74 37,-93.25"/>
-<text text-anchor="middle" x="18.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the correctness of the Circular Linked List.">
-<polygon fill="white" stroke="#666666" points="105.5,-93.25 73,-93.25 73,-74 105.5,-74 105.5,-93.25"/>
-<text text-anchor="middle" x="89.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-83.62C44.58,-83.62 53.31,-83.62 61.45,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-87.13 71.2,-83.63 61.2,-80.13 61.2,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="207,-167.25 141.5,-167.25 141.5,-148 207,-148 207,-167.25"/>
-<text text-anchor="middle" x="174.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.78,-93.61C107.13,-105.55 123.98,-125.66 141.5,-139.62 142.17,-140.16 142.86,-140.68 143.56,-141.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.61,-144.11 151.89,-146.67 145.45,-138.26 141.61,-144.11"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="207,-130.25 141.5,-130.25 141.5,-111 207,-111 207,-130.25"/>
-<text text-anchor="middle" x="174.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-90.58C115.57,-94.91 128.42,-100.64 140.3,-105.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.87,-109.13 149.43,-110.01 141.72,-102.74 138.87,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="207,-93.25 141.5,-93.25 141.5,-74 207,-74 207,-93.25"/>
-<text text-anchor="middle" x="174.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-83.62C112.78,-83.62 121.31,-83.62 129.93,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.69,-87.13 139.69,-83.63 129.69,-80.13 129.69,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="207,-56.25 141.5,-56.25 141.5,-37 207,-37 207,-56.25"/>
-<text text-anchor="middle" x="174.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-76.67C115.57,-72.34 128.42,-66.61 140.3,-61.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.72,-64.51 149.43,-57.24 138.87,-58.12 141.72,-64.51"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="207,-19.25 141.5,-19.25 141.5,0 207,0 207,-19.25"/>
-<text text-anchor="middle" x="174.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.78,-73.64C107.13,-61.7 123.98,-41.59 141.5,-27.62 142.17,-27.09 142.86,-26.57 143.56,-26.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.45,-28.99 151.89,-20.58 141.61,-23.14 145.45,-28.99"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.75,-56.25 243,-56.25 243,-37 358.75,-37 358.75,-56.25"/>
-<text text-anchor="middle" x="300.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-46.62C214.78,-46.62 222.98,-46.62 231.32,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.23,-50.13 241.23,-46.63 231.23,-43.13 231.23,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 85a324f25..000000000
--- a/de/d33/circular__linked__list_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,147 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="367pt" height="175pt"
- viewBox="0.00 0.00 366.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-93.25 0,-93.25 0,-74 37,-74 37,-93.25"/>
-<text text-anchor="middle" x="18.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the correctness of the Circular Linked List.">
-<polygon fill="white" stroke="#666666" points="105.5,-93.25 73,-93.25 73,-74 105.5,-74 105.5,-93.25"/>
-<text text-anchor="middle" x="89.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-83.62C44.58,-83.62 53.31,-83.62 61.45,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-87.13 71.2,-83.63 61.2,-80.13 61.2,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="207,-167.25 141.5,-167.25 141.5,-148 207,-148 207,-167.25"/>
-<text text-anchor="middle" x="174.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.78,-93.61C107.13,-105.55 123.98,-125.66 141.5,-139.62 142.17,-140.16 142.86,-140.68 143.56,-141.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.61,-144.11 151.89,-146.67 145.45,-138.26 141.61,-144.11"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="207,-130.25 141.5,-130.25 141.5,-111 207,-111 207,-130.25"/>
-<text text-anchor="middle" x="174.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-90.58C115.57,-94.91 128.42,-100.64 140.3,-105.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="138.87,-109.13 149.43,-110.01 141.72,-102.74 138.87,-109.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="207,-93.25 141.5,-93.25 141.5,-74 207,-74 207,-93.25"/>
-<text text-anchor="middle" x="174.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-83.62C112.78,-83.62 121.31,-83.62 129.93,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.69,-87.13 139.69,-83.63 129.69,-80.13 129.69,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="207,-56.25 141.5,-56.25 141.5,-37 207,-37 207,-56.25"/>
-<text text-anchor="middle" x="174.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-76.67C115.57,-72.34 128.42,-66.61 140.3,-61.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.72,-64.51 149.43,-57.24 138.87,-58.12 141.72,-64.51"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="207,-19.25 141.5,-19.25 141.5,0 207,0 207,-19.25"/>
-<text text-anchor="middle" x="174.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.78,-73.64C107.13,-61.7 123.98,-41.59 141.5,-27.62 142.17,-27.09 142.86,-26.57 143.56,-26.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.45,-28.99 151.89,-20.58 141.61,-23.14 145.45,-28.99"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.75,-56.25 243,-56.25 243,-37 358.75,-37 358.75,-56.25"/>
-<text text-anchor="middle" x="300.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-46.62C214.78,-46.62 222.98,-46.62 231.32,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.23,-50.13 241.23,-46.63 231.23,-43.13 231.23,-50.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d33/circular__linked__list_8cpp_source.html b/de/d33/circular__linked__list_8cpp_source.html
new file mode 100644
index 000000000..0212f0957
--- /dev/null
+++ b/de/d33/circular__linked__list_8cpp_source.html
@@ -0,0 +1,413 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: operations_on_datastructures/circular_linked_list.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/d33/circular__linked__list_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">circular_linked_list.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/d33/circular__linked__list_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a> {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d4/dcd/namespacecircular__linked__list.html">circular_linked_list</a> {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="foldopen" id="foldopen00032" data-start="{" data-end="};">
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">   32</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1">   33</a></span>    int64_t <a class="code hl_variable" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1">data</a>;  </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77">   34</a></span>    <a class="code hl_struct" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a>* <a class="code hl_variable" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77">next</a>;    </div>
+<div class="foldopen" id="foldopen00039" data-start="{" data-end="}">
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5">   39</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5">Node</a>(int64_t _data) {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <a class="code hl_variable" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1">data</a> = _data;    </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        <a class="code hl_variable" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77">next</a> = <span class="keyword">nullptr</span>;  </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00048" data-start="{" data-end="}">
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95">   48</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95">Node</a>(int64_t _data, <a class="code hl_struct" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a>* _next) {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        <a class="code hl_variable" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1">data</a> = _data;  </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <a class="code hl_variable" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77">next</a> = _next;  </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>};</div>
+</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="foldopen" id="foldopen00057" data-start="{" data-end="};">
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">   57</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">   59</a></span>    <a class="code hl_struct" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a>* <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;   </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"><a class="line" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">   60</a></span>    <a class="code hl_struct" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a>* <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">end</a>{};  </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span> </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00066" data-start="{" data-end="}">
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"><a class="line" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888">   66</a></span>    <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888">CircularLinkedList</a>() {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">end</a> = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00073" data-start="{" data-end="}">
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"><a class="line" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a142fa439b102c6f86341f421ddcfe0a1">   73</a></span>    <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a142fa439b102c6f86341f421ddcfe0a1">CircularLinkedList</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a>&amp; copy) {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986">erase</a>();</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <a class="code hl_struct" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a>* <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = copy.<a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        <span class="keywordflow">while</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;data);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        }</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00086" data-start="{" data-end="}">
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2">   86</a></span>    <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2">CircularLinkedList</a>(<a class="code hl_class" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a>&amp;&amp; source) <span class="keyword">noexcept</span> {</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = source.root;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">end</a> = source.end;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        source.root = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        source.end = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00097" data-start="{" data-end="}">
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"><a class="line" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9">   97</a></span>    <a class="code hl_class" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a>&amp; <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9">operator=</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a>&amp; other) {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986">erase</a>();</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        <a class="code hl_struct" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a>* <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = other.<a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        <span class="keywordflow">while</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> != <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>            <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;data);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        }</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00112" data-start="{" data-end="}">
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"><a class="line" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5">  112</a></span>    <a class="code hl_class" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a>&amp; <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5">operator=</a>(<a class="code hl_class" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a>&amp;&amp; other) <span class="keyword">noexcept</span> {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = other.root;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">end</a> = other.end;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        other.root = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        other.end = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    }</div>
+</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"><a class="line" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a46195fcf11b636064c7172cb74b55dd0">  122</a></span>    <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a46195fcf11b636064c7172cb74b55dd0">~CircularLinkedList</a>() { <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986">erase</a>(); }</div>
+<div class="foldopen" id="foldopen00126" data-start="{" data-end="}">
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"><a class="line" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986">  126</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986">erase</a>() {</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        }</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        <a class="code hl_struct" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a>* <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>            <a class="code hl_struct" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a>* temp = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>            <span class="keyword">delete</span> (temp);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>        } <span class="keywordflow">while</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> != <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>);</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">end</a> = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00146" data-start="{" data-end="}">
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"><a class="line" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d">  146</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a>(<span class="keyword">const</span> std::vector&lt;int64_t&gt;&amp; <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de">values</a>) {</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        <span class="keywordflow">for</span> (int64_t value : <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de">values</a>) {</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>            <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a>(value);</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        }</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00158" data-start="{" data-end="}">
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"><a class="line" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a3b7bbb0918c261bc216aef9e6dd39aa4">  158</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a3b7bbb0918c261bc216aef9e6dd39aa4">insert</a>(int64_t <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        <a class="code hl_struct" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a>* <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> <a class="code hl_struct" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>);</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>        <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00169" data-start="{" data-end="}">
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"><a class="line" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae">  169</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae">insert</a>(<a class="code hl_struct" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a>* <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>            <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;        </div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next = <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;  </div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>            <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">end</a> = <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;         </div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>            <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">end</a>-&gt;<a class="code hl_variable" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77">next</a> = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;   </div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next = <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;  </div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>            <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">end</a> = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;         </div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        }</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    }</div>
+</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"><a class="line" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592">  187</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592">print</a>() { <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592">print</a>(<a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>); }</div>
+<div class="foldopen" id="foldopen00196" data-start="{" data-end="}">
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"><a class="line" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a424b17ddc672b25fe0bd9dc8612fba21">  196</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a424b17ddc672b25fe0bd9dc8612fba21">print</a>(<a class="code hl_struct" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a>* <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>) {</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>        <a class="code hl_struct" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a>* temp = <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Empty List!\n&quot;</span>;</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>        }</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>        <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>            std::cout &lt;&lt; temp-&gt;<a class="code hl_variable" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1">data</a> &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>            temp = temp-&gt;<a class="code hl_variable" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77">next</a>;</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>        } <span class="keywordflow">while</span> (temp != <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>);</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    }</div>
+</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"><a class="line" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de">  214</a></span>    std::vector&lt;int64_t&gt; <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de">values</a>() { <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de">values</a>(<a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>); }</div>
+<div class="foldopen" id="foldopen00223" data-start="{" data-end="}">
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"><a class="line" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a03a896b34d27fda69049827e0c4dab42">  223</a></span>    std::vector&lt;int64_t&gt; <a class="code hl_function" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a03a896b34d27fda69049827e0c4dab42">values</a>(<a class="code hl_struct" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a>* <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>) {</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>        std::vector&lt;int64_t&gt; res;</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a> == <span class="keyword">nullptr</span>) {</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>            <span class="keywordflow">return</span> res;  </div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>        }</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>        <a class="code hl_struct" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a>* temp = <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>;</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>        <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>            res.push_back(temp-&gt;<a class="code hl_variable" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1">data</a>);</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>            temp = temp-&gt;<a class="code hl_variable" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77">next</a>;</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>        } <span class="keywordflow">while</span> (temp != <a class="code hl_variable" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">root</a>);</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>        <span class="keywordflow">return</span> res;</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    }</div>
+</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>};</div>
+</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span> </div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>}  <span class="comment">// namespace circular_linked_list</span></div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span> </div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>}  <span class="comment">// namespace operations_on_datastructures</span></div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span> </div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/df4/namespacetests.html">tests</a> {</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span><span class="keyword">using </span><a class="code hl_class" href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">operations_on_datastructures::circular_linked_list::CircularLinkedList</a>;</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span><span class="keyword">using </span><a class="code hl_struct" href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">operations_on_datastructures::circular_linked_list::Node</a>;</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">test1</a>() {</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 1\n&quot;</span>;</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Intialized a = {2}\n&quot;</span>;</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {2}\n&quot;</span>;</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    CircularLinkedList a;</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    std::vector&lt;int64_t&gt; res = {2};</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    a.insert(2);</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>    assert(a.values() == res);</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>    a.print();</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>}</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">test2</a>() {</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 2\n&quot;</span>;</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Intialized a = {2, 5, 6}\n&quot;</span>;</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {2, 5, 6}\n&quot;</span>;</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    CircularLinkedList a;</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>    std::vector&lt;int64_t&gt; res = {2, 5, 6};</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>    a.insert(2);</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>    a.insert(5);</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    a.insert(6);</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>    assert(a.values() == res);</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>    a.print();</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>}</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">test3</a>() {</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 3\n&quot;</span>;</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Intialized a = {2, 7, 8, 3, 2, 6}\n&quot;</span>;</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {2, 7, 8, 3, 2, 6}\n&quot;</span>;</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>    CircularLinkedList a;</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>    std::vector&lt;int64_t&gt; res = {2, 7, 8, 3, 2, 6};</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>    a.insert({2, 7, 8, 3, 2, 6});</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>    a.print();</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>    assert(a.values() == res);</div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>}</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">test4</a>() {</div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 4\n&quot;</span>;</div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Intialized a = {2, 5}\n&quot;</span>;</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {5, 2}\n&quot;</span>;</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>    CircularLinkedList a;</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>    std::vector&lt;int64_t&gt; res = {5, 2};</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>    a.insert(2);</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>    <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* start = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(5);  </div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span>    a.insert(start);</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>    assert(a.values(start) == res);</div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>    a.print(start);</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span>}</div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span> </div>
+<div class="line"><a id="l00317" name="l00317"></a><span class="lineno">  317</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">test5</a>() {</div>
+<div class="line"><a id="l00318" name="l00318"></a><span class="lineno">  318</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 5\n&quot;</span>;</div>
+<div class="line"><a id="l00319" name="l00319"></a><span class="lineno">  319</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Intialized a = {}\n&quot;</span>;</div>
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno">  320</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: Empty List!\n&quot;</span>;</div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>    CircularLinkedList a;</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>    std::vector&lt;int64_t&gt; res = {};</div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>    assert(a.values() == res);</div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>    a.print();</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>}</div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span>}  <span class="comment">// namespace tests</span></div>
+<div class="line"><a id="l00328" name="l00328"></a><span class="lineno">  328</span> </div>
+<div class="foldopen" id="foldopen00333" data-start="{" data-end="}">
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"><a class="line" href="../../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  333</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a>();</div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a>();</div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a>();</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a>();</div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a>();</div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span>}</div>
+</div>
+<div class="line"><a id="l00340" name="l00340"></a><span class="lineno">  340</span> </div>
+<div class="foldopen" id="foldopen00345" data-start="{" data-end="}">
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"><a class="line" href="../../de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  345</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>    <a class="code hl_function" href="../../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>}</div>
+</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="acircular__linked__list_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of the Circular Linked List.</div><div class="ttdef"><b>Definition</b> <a href="#l00333">circular_linked_list.cpp:333</a></div></div>
+<div class="ttc" id="acircular__linked__list_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition</b> <a href="#l00345">circular_linked_list.cpp:345</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">operations_on_datastructures::circular_linked_list::CircularLinkedList</a></div><div class="ttdoc">A class that implements a Circular Linked List.</div><div class="ttdef"><b>Definition</b> <a href="#l00057">circular_linked_list.cpp:57</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a03a896b34d27fda69049827e0c4dab42"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a03a896b34d27fda69049827e0c4dab42">operations_on_datastructures::circular_linked_list::CircularLinkedList::values</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; values(Node *root)</div><div class="ttdoc">Returns a std::vector of the values of the Circular Linked List, beginning from a given Node.</div><div class="ttdef"><b>Definition</b> <a href="#l00223">circular_linked_list.cpp:223</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a142fa439b102c6f86341f421ddcfe0a1"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a142fa439b102c6f86341f421ddcfe0a1">operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList</a></div><div class="ttdeci">CircularLinkedList(const CircularLinkedList &amp;copy)</div><div class="ttdoc">Copy constructor for CircularLinkedList.</div><div class="ttdef"><b>Definition</b> <a href="#l00073">circular_linked_list.cpp:73</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a15150d6d933c58190c9c1dd7d22c51ae"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae">operations_on_datastructures::circular_linked_list::CircularLinkedList::insert</a></div><div class="ttdeci">void insert(Node *node)</div><div class="ttdoc">Inserts a given Node into the Circular Linked List.</div><div class="ttdef"><b>Definition</b> <a href="#l00169">circular_linked_list.cpp:169</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a398d6cc927a2c8e4a156ae2806f48986"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986">operations_on_datastructures::circular_linked_list::CircularLinkedList::erase</a></div><div class="ttdeci">void erase()</div><div class="ttdef"><b>Definition</b> <a href="#l00126">circular_linked_list.cpp:126</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a3b7bbb0918c261bc216aef9e6dd39aa4"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a3b7bbb0918c261bc216aef9e6dd39aa4">operations_on_datastructures::circular_linked_list::CircularLinkedList::insert</a></div><div class="ttdeci">void insert(int64_t data)</div><div class="ttdoc">Inserts a single value into the Circular Linked List.</div><div class="ttdef"><b>Definition</b> <a href="#l00158">circular_linked_list.cpp:158</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a424b17ddc672b25fe0bd9dc8612fba21"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a424b17ddc672b25fe0bd9dc8612fba21">operations_on_datastructures::circular_linked_list::CircularLinkedList::print</a></div><div class="ttdeci">void print(Node *root)</div><div class="ttdoc">Prints the values of the Circular Linked List, beginning from a given Node to be used as the root.</div><div class="ttdef"><b>Definition</b> <a href="#l00196">circular_linked_list.cpp:196</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a46195fcf11b636064c7172cb74b55dd0"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a46195fcf11b636064c7172cb74b55dd0">operations_on_datastructures::circular_linked_list::CircularLinkedList::~CircularLinkedList</a></div><div class="ttdeci">~CircularLinkedList()</div><div class="ttdoc">Cleans up memory when destroyed.</div><div class="ttdef"><b>Definition</b> <a href="#l00122">circular_linked_list.cpp:122</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a53611ec1fef92eeeb875aea1bde1e4de"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de">operations_on_datastructures::circular_linked_list::CircularLinkedList::values</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; values()</div><div class="ttdoc">Returns a std::vector of the values of the Circular Linked List.</div><div class="ttdef"><b>Definition</b> <a href="#l00214">circular_linked_list.cpp:214</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a5d5cebd6bc906c60763fc6be10cfdd13"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13">operations_on_datastructures::circular_linked_list::CircularLinkedList::root</a></div><div class="ttdeci">Node * root</div><div class="ttdoc">Pointer to the root Node.</div><div class="ttdef"><b>Definition</b> <a href="#l00059">circular_linked_list.cpp:59</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a8f26dc32615abc5bab8ac458ef424bc5"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5">operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=</a></div><div class="ttdeci">CircularLinkedList &amp; operator=(CircularLinkedList &amp;&amp;other) noexcept</div><div class="ttdoc">Move assignment operator.</div><div class="ttdef"><b>Definition</b> <a href="#l00112">circular_linked_list.cpp:112</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_a9cc37166f2f73763df39894b675f89c9"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9">operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=</a></div><div class="ttdeci">CircularLinkedList &amp; operator=(const CircularLinkedList &amp;other)</div><div class="ttdoc">Copy assignment operator.</div><div class="ttdef"><b>Definition</b> <a href="#l00097">circular_linked_list.cpp:97</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_aa704319924f97fedfb41caf193a00888"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888">operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList</a></div><div class="ttdeci">CircularLinkedList()</div><div class="ttdoc">Creates an empty CircularLinkedList.</div><div class="ttdef"><b>Definition</b> <a href="#l00066">circular_linked_list.cpp:66</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_ab682f854f39582a20c9c4102f0482208"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">operations_on_datastructures::circular_linked_list::CircularLinkedList::end</a></div><div class="ttdeci">Node * end</div><div class="ttdoc">Pointer to the last Node.</div><div class="ttdef"><b>Definition</b> <a href="#l00060">circular_linked_list.cpp:60</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_abde75f6ee432b0378d264da8c7c64db2"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2">operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList</a></div><div class="ttdeci">CircularLinkedList(CircularLinkedList &amp;&amp;source) noexcept</div><div class="ttdoc">Move constructor for CircularLinkedList.</div><div class="ttdef"><b>Definition</b> <a href="#l00086">circular_linked_list.cpp:86</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_ac341901e926b3fa3a796c64ca572f592"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592">operations_on_datastructures::circular_linked_list::CircularLinkedList::print</a></div><div class="ttdeci">void print()</div><div class="ttdoc">Prints the values of the Circular Linked List, beginning from the root Node.</div><div class="ttdef"><b>Definition</b> <a href="#l00187">circular_linked_list.cpp:187</a></div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list_html_ac38565472a07d07f63ec0d2fd8a69d4d"><div class="ttname"><a href="../../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d">operations_on_datastructures::circular_linked_list::CircularLinkedList::insert</a></div><div class="ttdeci">void insert(const std::vector&lt; int64_t &gt; &amp;values)</div><div class="ttdoc">Inserts all the values from a vector into the Circular Linked List.</div><div class="ttdef"><b>Definition</b> <a href="#l00146">circular_linked_list.cpp:146</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="anamespacecircular__linked__list_html"><div class="ttname"><a href="../../d4/dcd/namespacecircular__linked__list.html">circular_linked_list</a></div><div class="ttdoc">Functions for the Circular Linked List implementation.</div></div>
+<div class="ttc" id="anamespaceoperations__on__datastructures_html"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></div><div class="ttdoc">for std::vector</div></div>
+<div class="ttc" id="anamespacetests_html"><div class="ttname"><a href="../../d9/df4/namespacetests.html">tests</a></div><div class="ttdoc">Testcases to check Union of Two Arrays.</div></div>
+<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00075">array_left_rotation.cpp:75</a></div></div>
+<div class="ttc" id="anamespacetests_html_a2b9769e44683dcb67fe1083ad91e134d"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a></div><div class="ttdeci">void test4()</div><div class="ttdoc">A Test to check a very large input.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00120">array_left_rotation.cpp:120</a></div></div>
+<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check an invalid shift value.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00105">array_left_rotation.cpp:105</a></div></div>
+<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an empty vector.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00090">array_left_rotation.cpp:90</a></div></div>
+<div class="ttc" id="anamespacetests_html_af7b81d7a1534216af6a36a80135beb86"><div class="ttname"><a href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a></div><div class="ttdeci">void test5()</div><div class="ttdoc">A Test to check a shift of zero.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00143">array_left_rotation.cpp:143</a></div></div>
+<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+<div class="ttc" id="astructoperations__on__datastructures_1_1circular__linked__list_1_1_node_html"><div class="ttname"><a href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">operations_on_datastructures::circular_linked_list::Node</a></div><div class="ttdoc">A Node struct that represents a single Node in a Binary Tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00032">circular_linked_list.cpp:32</a></div></div>
+<div class="ttc" id="astructoperations__on__datastructures_1_1circular__linked__list_1_1_node_html_a005dc56b0c58350a13f4796b9b30b6c5"><div class="ttname"><a href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5">operations_on_datastructures::circular_linked_list::Node::Node</a></div><div class="ttdeci">Node(int64_t _data)</div><div class="ttdoc">Creates a new Node with some initial data.</div><div class="ttdef"><b>Definition</b> <a href="#l00039">circular_linked_list.cpp:39</a></div></div>
+<div class="ttc" id="astructoperations__on__datastructures_1_1circular__linked__list_1_1_node_html_a12a06eef5ccaf667f319506eee655d95"><div class="ttname"><a href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95">operations_on_datastructures::circular_linked_list::Node::Node</a></div><div class="ttdeci">Node(int64_t _data, Node *_next)</div><div class="ttdoc">Creates a new Node with initial data and a successor.</div><div class="ttdef"><b>Definition</b> <a href="#l00048">circular_linked_list.cpp:48</a></div></div>
+<div class="ttc" id="astructoperations__on__datastructures_1_1circular__linked__list_1_1_node_html_a7461292b8b91aed86404d0ab019dfdd1"><div class="ttname"><a href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1">operations_on_datastructures::circular_linked_list::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The value of the Node.</div><div class="ttdef"><b>Definition</b> <a href="#l00033">circular_linked_list.cpp:33</a></div></div>
+<div class="ttc" id="astructoperations__on__datastructures_1_1circular__linked__list_1_1_node_html_a7c867b8e1034a6f5da490c8b8c09cb77"><div class="ttname"><a href="../../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77">operations_on_datastructures::circular_linked_list::Node::next</a></div><div class="ttdeci">Node * next</div><div class="ttdoc">The Node's successor.</div><div class="ttdef"><b>Definition</b> <a href="#l00034">circular_linked_list.cpp:34</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><a class="el" href="../../de/d33/circular__linked__list_8cpp.html">circular_linked_list.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.map b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.map
index 8928d43a0..d3b1369dc 100644
--- a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.map
+++ b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.map
@@ -1,6 +1,6 @@
 <map id="data_structures::linked_list::link" name="data_structures::linked_list::link">
 <area shape="rect" id="Node000001" title=" " alt="" coords="5,5,159,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="6,109,158,165"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="6,109,158,165"/>
 <area shape="poly" id="edge2_Node000002_Node000001" title=" " alt="" coords="64,61,60,70,60,89,66,108,61,109,55,90,55,70,59,59"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="79,94,79,46,85,46,85,94"/>
 </map>
diff --git a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.md5 b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.md5
index 33b789780..536cb11ff 100644
--- a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.md5
+++ b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.md5
@@ -1 +1 @@
-e1371e25b88c993ec204e63c7a312eaa
\ No newline at end of file
+6094a54a8b1f8fcceabfe8cc1654460d
\ No newline at end of file
diff --git a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.svg b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.svg
index 97c00ba37..6eb446b27 100644
--- a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.svg
+++ b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph.svg
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="114.62,-41.75 0.37,-41.75 0.37,0 114.62,0 114.62,-41.75"/>
 <text text-anchor="start" x="8.38" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; data</text>
 <text text-anchor="start" x="8.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_structures::linked_list</text>
diff --git a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph_org.svg b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph_org.svg
index c1e1d950e..a17e4b50b 100644
--- a/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph_org.svg
+++ b/de/d33/classdata__structures_1_1linked__list_1_1link__coll__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="114.62,-41.75 0.37,-41.75 0.37,0 114.62,0 114.62,-41.75"/>
 <text text-anchor="start" x="8.38" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; data</text>
 <text text-anchor="start" x="8.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_structures::linked_list</text>
diff --git a/de/d36/classdata__structures_1_1_bloom_filter-members.html b/de/d36/classdata__structures_1_1_bloom_filter-members.html
index ed125c61c..193d26426 100644
--- a/de/d36/classdata__structures_1_1_bloom_filter-members.html
+++ b/de/d36/classdata__structures_1_1_bloom_filter-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/d36/namespacen__bonacci.html b/de/d36/namespacen__bonacci.html
index 09bd0f81c..934655869 100644
--- a/de/d36/namespacen__bonacci.html
+++ b/de/d36/namespacen__bonacci.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: n_bonacci Namespace Reference</title>
+<title>TheAlgorithms/C++: n_bonacci Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/d40/shell__sort_8cpp_source.html b/de/d40/shell__sort_8cpp_source.html
new file mode 100644
index 000000000..ddae1a2de
--- /dev/null
+++ b/de/d40/shell__sort_8cpp_source.html
@@ -0,0 +1,176 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/shell_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/d40/shell__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">shell_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span> </div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span>    <span class="keywordtype">int</span> size = 10;</div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span>    <span class="keywordtype">int</span>* array = <span class="keyword">new</span> <span class="keywordtype">int</span>[size];</div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span>    <span class="comment">// Input</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nHow many numbers do want to enter in unsorted array : &quot;</span>;</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>    std::cin &gt;&gt; size;</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the numbers for unsorted array : &quot;</span>;</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>        std::cin &gt;&gt; array[i];</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    }</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="comment">// Sorting</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = size / 2; i &gt; 0; i = i / 2) {</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i; j &lt; size; j++) {</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = j - i; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> &gt;= 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> - i) {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>                <span class="keywordflow">if</span> (array[k] &lt; array[k + i]) {</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>                    <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>                } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>                    <span class="keywordtype">int</span> temp = array[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> + i];</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>                    array[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> + i] = array[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>];</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>                    array[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] = temp;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>                }</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>            }</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        }</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    }</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="comment">// Output</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nSorted array : &quot;</span>;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        std::cout &lt;&lt; array[i] &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    }</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keyword">delete</span>[] array;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>}</div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><b>shell_sort.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/d41/namespacekaratsuba__algorithm.html b/de/d41/namespacekaratsuba__algorithm.html
index c0ad5161d..c0b14b18e 100644
--- a/de/d41/namespacekaratsuba__algorithm.html
+++ b/de/d41/namespacekaratsuba__algorithm.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: karatsuba_algorithm Namespace Reference</title>
+<title>TheAlgorithms/C++: karatsuba_algorithm Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/d47/string__fibonacci_8cpp.html b/de/d47/string__fibonacci_8cpp.html
index 1b81f2b34..9778f9243 100644
--- a/de/d47/string__fibonacci_8cpp.html
+++ b/de/d47/string__fibonacci_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/string_fibonacci.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/string_fibonacci.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -120,10 +137,12 @@ Include dependency graph for string_fibonacci.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/da1/string__fibonacci_8cpp__incl.svg" width="250" height="111"><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">
+</div>
+<p><a href="../../de/d47/string__fibonacci_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a28052eee05d43c2ebc5147c52bd50c35" id="r_a28052eee05d43c2ebc5147c52bd50c35"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a28052eee05d43c2ebc5147c52bd50c35">add</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> a, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> b)</td></tr>
+<tr class="memitem:a28052eee05d43c2ebc5147c52bd50c35" id="r_a28052eee05d43c2ebc5147c52bd50c35"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a28052eee05d43c2ebc5147c52bd50c35">add</a> (std::string a, std::string b)</td></tr>
 <tr class="separator:a28052eee05d43c2ebc5147c52bd50c35"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ad8055ee368a5d5b24de01bdde6bf8fca" id="r_ad8055ee368a5d5b24de01bdde6bf8fca"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad8055ee368a5d5b24de01bdde6bf8fca">fib_Accurate</a> (uint64_t n)</td></tr>
 <tr class="separator:ad8055ee368a5d5b24de01bdde6bf8fca"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -134,6 +153,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>This Programme returns the Nth fibonacci as a string. </p>
 <p>The method used is manual addition with carry and placing it in a string which is called string addition This makes it have no bounds or limits</p>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../de/de4/fibonacci__large_8cpp.html" title="Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library ...">fibonacci_large.cpp</a>, <a class="el" href="../../d4/d32/fibonacci__fast_8cpp.html" title="Faster computation of Fibonacci series.">fibonacci_fast.cpp</a>, <a class="el" href="../../d9/d89/fibonacci_8cpp.html" title="n-th Fibonacci number.">fibonacci.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../de/d47/string__fibonacci_8cpp_source.html">string_fibonacci.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a28052eee05d43c2ebc5147c52bd50c35" name="a28052eee05d43c2ebc5147c52bd50c35"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a28052eee05d43c2ebc5147c52bd50c35">&#9670;&#160;</a></span>add()</h2>
@@ -142,14 +163,14 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> add </td>
+          <td class="memname">std::string add </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>b</em></span>&#160;)</td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>b</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -160,20 +181,22 @@ Functions</h2></td></tr>
   </table>
   </dd>
 </dl>
-<dl class="section return"><dt>Returns</dt><dd>sum as a <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> </dd></dl>
+<dl class="section return"><dt>Returns</dt><dd>sum as a std::string </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d47/string__fibonacci_8cpp_source.html#l00025">25</a> of file <a class="el" href="../../de/d47/string__fibonacci_8cpp_source.html">string_fibonacci.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   25</span>                                        {</div>
-<div class="line"><span class="lineno">   26</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> temp = <span class="stringliteral">&quot;&quot;</span>;</div>
+<div class="line"><span class="lineno">   26</span>    std::string temp = <span class="stringliteral">&quot;&quot;</span>;</div>
 <div class="line"><span class="lineno">   27</span> </div>
 <div class="line"><span class="lineno">   28</span>    <span class="comment">// carry flag</span></div>
 <div class="line"><span class="lineno">   29</span>    <span class="keywordtype">int</span> carry = 0;</div>
 <div class="line"><span class="lineno">   30</span> </div>
 <div class="line"><span class="lineno">   31</span>    <span class="comment">// fills up with zeros</span></div>
-<div class="line"><span class="lineno">   32</span>    <span class="keywordflow">while</span> (a.length() &lt; b.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>()) {</div>
+<div class="line"><span class="lineno">   32</span>    <span class="keywordflow">while</span> (a.length() &lt; b.length()) {</div>
 <div class="line"><span class="lineno">   33</span>        a = <span class="stringliteral">&quot;0&quot;</span> + a;</div>
 <div class="line"><span class="lineno">   34</span>    }</div>
 <div class="line"><span class="lineno">   35</span> </div>
 <div class="line"><span class="lineno">   36</span>    <span class="comment">// fills up with zeros</span></div>
-<div class="line"><span class="lineno">   37</span>    <span class="keywordflow">while</span> (b.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>() &lt; a.length()) {</div>
+<div class="line"><span class="lineno">   37</span>    <span class="keywordflow">while</span> (b.length() &lt; a.length()) {</div>
 <div class="line"><span class="lineno">   38</span>        b = <span class="stringliteral">&quot;0&quot;</span> + b;</div>
 <div class="line"><span class="lineno">   39</span>    }</div>
 <div class="line"><span class="lineno">   40</span> </div>
@@ -195,21 +218,13 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   56</span>    }</div>
 <div class="line"><span class="lineno">   57</span> </div>
 <div class="line"><span class="lineno">   58</span>    <span class="comment">// removes leading zeros.</span></div>
-<div class="line"><span class="lineno">   59</span>    <span class="keywordflow">while</span> (temp[0] == <span class="charliteral">&#39;0&#39;</span> &amp;&amp; temp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>() &gt; 1) {</div>
-<div class="line"><span class="lineno">   60</span>        temp = temp.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html">substr</a>(1);</div>
+<div class="line"><span class="lineno">   59</span>    <span class="keywordflow">while</span> (temp[0] == <span class="charliteral">&#39;0&#39;</span> &amp;&amp; temp.length() &gt; 1) {</div>
+<div class="line"><span class="lineno">   60</span>        temp = temp.substr(1);</div>
 <div class="line"><span class="lineno">   61</span>    }</div>
 <div class="line"><span class="lineno">   62</span> </div>
 <div class="line"><span class="lineno">   63</span>    <span class="keywordflow">return</span> temp;</div>
 <div class="line"><span class="lineno">   64</span>}</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::length</a></div><div class="ttdeci">T length(T... args)</div></div>
-<div class="ttc" id="asubstr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html">std::string::substr</a></div><div class="ttdeci">T substr(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph.svg" width="224" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad8055ee368a5d5b24de01bdde6bf8fca" name="ad8055ee368a5d5b24de01bdde6bf8fca"></a>
@@ -232,25 +247,21 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d47/string__fibonacci_8cpp_source.html#l00069">69</a> of file <a class="el" href="../../de/d47/string__fibonacci_8cpp_source.html">string_fibonacci.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   69</span>                              {</div>
-<div class="line"><span class="lineno">   70</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> tmp = <span class="stringliteral">&quot;&quot;</span>;</div>
-<div class="line"><span class="lineno">   71</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> fibMinus1 = <span class="stringliteral">&quot;1&quot;</span>;</div>
-<div class="line"><span class="lineno">   72</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> fibMinus2 = <span class="stringliteral">&quot;0&quot;</span>;</div>
+<div class="line"><span class="lineno">   70</span>    std::string tmp = <span class="stringliteral">&quot;&quot;</span>;</div>
+<div class="line"><span class="lineno">   71</span>    std::string fibMinus1 = <span class="stringliteral">&quot;1&quot;</span>;</div>
+<div class="line"><span class="lineno">   72</span>    std::string fibMinus2 = <span class="stringliteral">&quot;0&quot;</span>;</div>
 <div class="line"><span class="lineno">   73</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
 <div class="line"><span class="lineno">   74</span>        tmp = <a class="code hl_function" href="#a28052eee05d43c2ebc5147c52bd50c35">add</a>(fibMinus1, fibMinus2);</div>
 <div class="line"><span class="lineno">   75</span>        fibMinus2 = fibMinus1;</div>
 <div class="line"><span class="lineno">   76</span>        fibMinus1 = tmp;</div>
 <div class="line"><span class="lineno">   77</span>    }</div>
-<div class="line"><span class="lineno">   78</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; fibMinus2;</div>
+<div class="line"><span class="lineno">   78</span>    std::cout &lt;&lt; fibMinus2;</div>
 <div class="line"><span class="lineno">   79</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="astring__fibonacci_8cpp_html_a28052eee05d43c2ebc5147c52bd50c35"><div class="ttname"><a href="#a28052eee05d43c2ebc5147c52bd50c35">add</a></div><div class="ttdeci">std::string add(std::string a, std::string b)</div><div class="ttdef"><b>Definition</b> string_fibonacci.cpp:25</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.svg" width="367" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astring__fibonacci_8cpp_html_a28052eee05d43c2ebc5147c52bd50c35"><div class="ttname"><a href="#a28052eee05d43c2ebc5147c52bd50c35">add</a></div><div class="ttdeci">std::string add(std::string a, std::string b)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d47/string__fibonacci_8cpp_source.html#l00025">string_fibonacci.cpp:25</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -268,23 +279,19 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d47/string__fibonacci_8cpp_source.html#l00082">82</a> of file <a class="el" href="../../de/d47/string__fibonacci_8cpp_source.html">string_fibonacci.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   82</span>           {</div>
 <div class="line"><span class="lineno">   83</span>    <span class="keywordtype">int</span> n;</div>
-<div class="line"><span class="lineno">   84</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter whatever number N you want to find the fibonacci of\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;</div>
-<div class="line"><span class="lineno">   86</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; th Fibonacci is \n&quot;</span>;</div>
+<div class="line"><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter whatever number N you want to find the fibonacci of\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   85</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><span class="lineno">   86</span>    std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; th Fibonacci is \n&quot;</span>;</div>
 <div class="line"><span class="lineno">   87</span>    <a class="code hl_function" href="#ad8055ee368a5d5b24de01bdde6bf8fca">fib_Accurate</a>(n);</div>
 <div class="line"><span class="lineno">   88</span> </div>
 <div class="line"><span class="lineno">   89</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   90</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="astring__fibonacci_8cpp_html_ad8055ee368a5d5b24de01bdde6bf8fca"><div class="ttname"><a href="#ad8055ee368a5d5b24de01bdde6bf8fca">fib_Accurate</a></div><div class="ttdeci">void fib_Accurate(uint64_t n)</div><div class="ttdef"><b>Definition</b> string_fibonacci.cpp:69</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="464" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="astring__fibonacci_8cpp_html_ad8055ee368a5d5b24de01bdde6bf8fca"><div class="ttname"><a href="#ad8055ee368a5d5b24de01bdde6bf8fca">fib_Accurate</a></div><div class="ttdeci">void fib_Accurate(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d47/string__fibonacci_8cpp_source.html#l00069">string_fibonacci.cpp:69</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph.map b/de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph.map
deleted file mode 100644
index 999e53511..000000000
--- a/de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="add" name="add">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,48,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="96,5,218,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="47,37,80,30,81,36,48,42"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/substr.html#" title=" " alt="" coords="96,55,219,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="48,45,81,51,80,56,47,50"/>
-</map>
diff --git a/de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph.md5 b/de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph.md5
deleted file mode 100644
index 08c2b5ca0..000000000
--- a/de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-85a9e63e690121eaa9ada7e38a775b6f
\ No newline at end of file
diff --git a/de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph.svg b/de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph.svg
deleted file mode 100644
index ad0101205..000000000
--- a/de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: add Pages: 1 -->
-<svg width="168pt" height="64pt"
- viewBox="0.00 0.00 168.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>add</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="31.75,-37.25 0,-37.25 0,-18 31.75,-18 31.75,-37.25"/>
-<text text-anchor="middle" x="15.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">add</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.88,-56.25 68.12,-56.25 68.12,-37 159.88,-37 159.88,-56.25"/>
-<text text-anchor="middle" x="114" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.89,-30.59C38.8,-31.96 47.47,-33.67 56.56,-35.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="55.78,-38.88 66.27,-37.39 57.14,-32.02 55.78,-38.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-19.25 67.75,-19.25 67.75,0 160.25,0 160.25,-19.25"/>
-<text text-anchor="middle" x="114" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::substr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.89,-24.81C38.73,-23.53 47.29,-21.93 56.26,-20.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.66,-23.74 65.84,-18.46 55.37,-16.86 56.66,-23.74"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph_org.svg b/de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph_org.svg
deleted file mode 100644
index bd2e62493..000000000
--- a/de/d47/string__fibonacci_8cpp_a28052eee05d43c2ebc5147c52bd50c35_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: add Pages: 1 -->
-<svg width="168pt" height="64pt"
- viewBox="0.00 0.00 168.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>add</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="31.75,-37.25 0,-37.25 0,-18 31.75,-18 31.75,-37.25"/>
-<text text-anchor="middle" x="15.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">add</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="159.88,-56.25 68.12,-56.25 68.12,-37 159.88,-37 159.88,-56.25"/>
-<text text-anchor="middle" x="114" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.89,-30.59C38.8,-31.96 47.47,-33.67 56.56,-35.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="55.78,-38.88 66.27,-37.39 57.14,-32.02 55.78,-38.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.25,-19.25 67.75,-19.25 67.75,0 160.25,0 160.25,-19.25"/>
-<text text-anchor="middle" x="114" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::substr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M31.89,-24.81C38.73,-23.53 47.29,-21.93 56.26,-20.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.66,-23.74 65.84,-18.46 55.37,-16.86 56.66,-23.74"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.map b/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.map
deleted file mode 100644
index df871bedc..000000000
--- a/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="fib_Accurate" name="fib_Accurate">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,100,56"/>
-<area shape="rect" id="Node000002" href="$de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35" title=" " alt="" coords="148,31,190,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="100,41,132,41,132,46,100,46"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="238,5,361,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="190,37,223,30,224,36,191,42"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/substr.html#" title=" " alt="" coords="238,55,361,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="191,45,223,51,222,56,190,50"/>
-</map>
diff --git a/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.md5 b/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.md5
deleted file mode 100644
index 1d6433837..000000000
--- a/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-01f346860f49860de50e8009728d4318
\ No newline at end of file
diff --git a/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.svg b/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.svg
deleted file mode 100644
index dea565b48..000000000
--- a/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: fib_Accurate Pages: 1 -->
-<svg width="275pt" height="64pt"
- viewBox="0.00 0.00 275.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>fib_Accurate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="70.75,-37.25 0,-37.25 0,-18 70.75,-18 70.75,-37.25"/>
-<text text-anchor="middle" x="35.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">fib_Accurate</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.5,-37.25 106.75,-37.25 106.75,-18 138.5,-18 138.5,-37.25"/>
-<text text-anchor="middle" x="122.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.05,-27.62C79.06,-27.62 87.46,-27.62 95.06,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.02,-31.13 105.02,-27.63 95.02,-24.13 95.02,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.62,-56.25 174.88,-56.25 174.88,-37 266.62,-37 266.62,-56.25"/>
-<text text-anchor="middle" x="220.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.64,-30.59C145.55,-31.96 154.22,-33.67 163.31,-35.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.53,-38.88 173.02,-37.39 163.89,-32.02 162.53,-38.88"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267,-19.25 174.5,-19.25 174.5,0 267,0 267,-19.25"/>
-<text text-anchor="middle" x="220.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::substr</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.64,-24.81C145.48,-23.53 154.04,-21.93 163.01,-20.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.41,-23.74 172.59,-18.46 162.12,-16.86 163.41,-23.74"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph_org.svg b/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph_org.svg
deleted file mode 100644
index 9fcbe2b54..000000000
--- a/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: fib_Accurate Pages: 1 -->
-<svg width="275pt" height="64pt"
- viewBox="0.00 0.00 275.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>fib_Accurate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="70.75,-37.25 0,-37.25 0,-18 70.75,-18 70.75,-37.25"/>
-<text text-anchor="middle" x="35.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">fib_Accurate</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="138.5,-37.25 106.75,-37.25 106.75,-18 138.5,-18 138.5,-37.25"/>
-<text text-anchor="middle" x="122.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">add</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M71.05,-27.62C79.06,-27.62 87.46,-27.62 95.06,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="95.02,-31.13 105.02,-27.63 95.02,-24.13 95.02,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.62,-56.25 174.88,-56.25 174.88,-37 266.62,-37 266.62,-56.25"/>
-<text text-anchor="middle" x="220.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.64,-30.59C145.55,-31.96 154.22,-33.67 163.31,-35.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.53,-38.88 173.02,-37.39 163.89,-32.02 162.53,-38.88"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267,-19.25 174.5,-19.25 174.5,0 267,0 267,-19.25"/>
-<text text-anchor="middle" x="220.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::substr</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.64,-24.81C145.48,-23.53 154.04,-21.93 163.01,-20.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.41,-23.74 172.59,-18.46 162.12,-16.86 163.41,-23.74"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 7feaab8f7..000000000
--- a/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca" title=" " alt="" coords="103,31,197,56"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,41,87,41,87,46,55,46"/>
-<area shape="rect" id="Node000003" href="$de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35" title=" " alt="" coords="245,31,287,56"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="197,41,229,41,229,46,197,46"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="336,5,458,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="287,37,320,30,321,36,288,42"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/substr.html#" title=" " alt="" coords="335,55,459,80"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="288,45,321,51,320,56,287,50"/>
-</map>
diff --git a/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 5e0038500..000000000
--- a/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-42f8505f8e49e364e9c45a5a7230db00
\ No newline at end of file
diff --git a/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index e18593fc5..000000000
--- a/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,119 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="348pt" height="64pt"
- viewBox="0.00 0.00 348.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.75,-37.25 73,-37.25 73,-18 143.75,-18 143.75,-37.25"/>
-<text text-anchor="middle" x="108.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">fib_Accurate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.28,-27.62C44.25,-27.62 52.59,-27.62 61.05,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.03,-31.13 71.03,-27.63 61.03,-24.13 61.03,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="211.5,-37.25 179.75,-37.25 179.75,-18 211.5,-18 211.5,-37.25"/>
-<text text-anchor="middle" x="195.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">add</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.05,-27.62C152.06,-27.62 160.46,-27.62 168.06,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.02,-31.13 178.02,-27.63 168.02,-24.13 168.02,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="339.62,-56.25 247.88,-56.25 247.88,-37 339.62,-37 339.62,-56.25"/>
-<text text-anchor="middle" x="293.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M211.64,-30.59C218.55,-31.96 227.22,-33.67 236.31,-35.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="235.53,-38.88 246.02,-37.39 236.89,-32.02 235.53,-38.88"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="340,-19.25 247.5,-19.25 247.5,0 340,0 340,-19.25"/>
-<text text-anchor="middle" x="293.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::substr</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M211.64,-24.81C218.48,-23.53 227.04,-21.93 236.01,-20.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.41,-23.74 245.59,-18.46 235.12,-16.86 236.41,-23.74"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 4276e16ab..000000000
--- a/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="348pt" height="64pt"
- viewBox="0.00 0.00 348.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.75,-37.25 73,-37.25 73,-18 143.75,-18 143.75,-37.25"/>
-<text text-anchor="middle" x="108.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">fib_Accurate</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.28,-27.62C44.25,-27.62 52.59,-27.62 61.05,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.03,-31.13 71.03,-27.63 61.03,-24.13 61.03,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="211.5,-37.25 179.75,-37.25 179.75,-18 211.5,-18 211.5,-37.25"/>
-<text text-anchor="middle" x="195.62" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">add</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M144.05,-27.62C152.06,-27.62 160.46,-27.62 168.06,-27.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.02,-31.13 178.02,-27.63 168.02,-24.13 168.02,-31.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="339.62,-56.25 247.88,-56.25 247.88,-37 339.62,-37 339.62,-56.25"/>
-<text text-anchor="middle" x="293.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M211.64,-30.59C218.55,-31.96 227.22,-33.67 236.31,-35.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="235.53,-38.88 246.02,-37.39 236.89,-32.02 235.53,-38.88"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="340,-19.25 247.5,-19.25 247.5,0 340,0 340,-19.25"/>
-<text text-anchor="middle" x="293.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::substr</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M211.64,-24.81C218.48,-23.53 227.04,-21.93 236.01,-20.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.41,-23.74 245.59,-18.46 235.12,-16.86 236.41,-23.74"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d47/string__fibonacci_8cpp_source.html b/de/d47/string__fibonacci_8cpp_source.html
new file mode 100644
index 000000000..ef3e08272
--- /dev/null
+++ b/de/d47/string__fibonacci_8cpp_source.html
@@ -0,0 +1,217 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/string_fibonacci.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/d47/string__fibonacci_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">string_fibonacci.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/d47/string__fibonacci_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#ifdef _MSC_VER</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;string&gt;</span>  <span class="comment">// use this for MS Visual C</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#else</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cstring&gt;</span>  <span class="comment">// otherwise</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="foldopen" id="foldopen00025" data-start="{" data-end="}">
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"><a class="line" href="../../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35">   25</a></span>std::string <a class="code hl_function" href="../../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35">add</a>(std::string a, std::string b) {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    std::string temp = <span class="stringliteral">&quot;&quot;</span>;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="comment">// carry flag</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordtype">int</span> carry = 0;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="comment">// fills up with zeros</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordflow">while</span> (a.length() &lt; b.length()) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        a = <span class="stringliteral">&quot;0&quot;</span> + a;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    }</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="comment">// fills up with zeros</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">while</span> (b.length() &lt; a.length()) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        b = <span class="stringliteral">&quot;0&quot;</span> + b;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    }</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="comment">// adds the numbers a and b</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = a.length() - 1; i &gt;= 0; i--) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="keywordtype">char</span> val = <span class="keyword">static_cast&lt;</span><span class="keywordtype">char</span><span class="keyword">&gt;</span>(((a[i] - 48) + (b[i] - 48)) + 48 + carry);</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="keywordflow">if</span> (val &gt; 57) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>            carry = 1;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            val -= 10;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            carry = 0;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        temp = val + temp;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="comment">// processes the carry flag</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">if</span> (carry == 1) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        temp = <span class="stringliteral">&quot;1&quot;</span> + temp;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="comment">// removes leading zeros.</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">while</span> (temp[0] == <span class="charliteral">&#39;0&#39;</span> &amp;&amp; temp.length() &gt; 1) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        temp = temp.substr(1);</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    }</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordflow">return</span> temp;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>}</div>
+</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="foldopen" id="foldopen00069" data-start="{" data-end="}">
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="../../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca">   69</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca">fib_Accurate</a>(uint64_t n) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    std::string tmp = <span class="stringliteral">&quot;&quot;</span>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::string fibMinus1 = <span class="stringliteral">&quot;1&quot;</span>;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    std::string fibMinus2 = <span class="stringliteral">&quot;0&quot;</span>;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        tmp = <a class="code hl_function" href="../../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35">add</a>(fibMinus1, fibMinus2);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        fibMinus2 = fibMinus1;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        fibMinus1 = tmp;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    std::cout &lt;&lt; fibMinus2;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>}</div>
+</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="foldopen" id="foldopen00082" data-start="{" data-end="}">
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="../../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   82</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordtype">int</span> n;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter whatever number N you want to find the fibonacci of\n&quot;</span>;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; th Fibonacci is \n&quot;</span>;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <a class="code hl_function" href="../../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca">fib_Accurate</a>(n);</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>}</div>
+</div>
+<div class="ttc" id="astring__fibonacci_8cpp_html_a28052eee05d43c2ebc5147c52bd50c35"><div class="ttname"><a href="../../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35">add</a></div><div class="ttdeci">std::string add(std::string a, std::string b)</div><div class="ttdef"><b>Definition</b> <a href="#l00025">string_fibonacci.cpp:25</a></div></div>
+<div class="ttc" id="astring__fibonacci_8cpp_html_ad8055ee368a5d5b24de01bdde6bf8fca"><div class="ttname"><a href="../../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca">fib_Accurate</a></div><div class="ttdeci">void fib_Accurate(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="#l00069">string_fibonacci.cpp:69</a></div></div>
+<div class="ttc" id="astring__fibonacci_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00082">string_fibonacci.cpp:82</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../de/d47/string__fibonacci_8cpp.html">string_fibonacci.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/d48/struct_trie_1_1_trie_node.html b/de/d48/struct_trie_1_1_trie_node.html
index 7e9dc4419..68be2cafd 100644
--- a/de/d48/struct_trie_1_1_trie_node.html
+++ b/de/d48/struct_trie_1_1_trie_node.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Trie::TrieNode Struct Reference</title>
+<title>TheAlgorithms/C++: Trie::TrieNode Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,13 +135,15 @@ Collaboration diagram for Trie::TrieNode:</div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:ae13ae4b74d997d3e83d7bb51b204d99e" id="r_ae13ae4b74d997d3e83d7bb51b204d99e"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae13ae4b74d997d3e83d7bb51b204d99e">character</a> [ALPHABETS] {nullptr}</td></tr>
+<tr class="memitem:ae13ae4b74d997d3e83d7bb51b204d99e" id="r_ae13ae4b74d997d3e83d7bb51b204d99e"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae13ae4b74d997d3e83d7bb51b204d99e">character</a> [ALPHABETS] {nullptr}</td></tr>
 <tr class="separator:ae13ae4b74d997d3e83d7bb51b204d99e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a73bba435c8e304cc97fd3dc40c95d52f" id="r_a73bba435c8e304cc97fd3dc40c95d52f"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a73bba435c8e304cc97fd3dc40c95d52f">isEndOfWord</a> {false}</td></tr>
 <tr class="separator:a73bba435c8e304cc97fd3dc40c95d52f"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Structure of trie node. This struct doesn't need a constructor as we are initializing using intializer list which is more efficient than if we had done so with constructor. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html#l00026">26</a> of file <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html">trie_modern.cpp</a>.</p>
 </div><h2 class="groupheader">Member Data Documentation</h2>
 <a id="ae13ae4b74d997d3e83d7bb51b204d99e" name="ae13ae4b74d997d3e83d7bb51b204d99e"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae13ae4b74d997d3e83d7bb51b204d99e">&#9670;&#160;</a></span>character</h2>
@@ -133,10 +152,12 @@ Public Attributes</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt;<a class="el" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a>&gt; Trie::TrieNode::character[ALPHABETS] {nullptr}</td>
+          <td class="memname">std::shared_ptr&lt;<a class="el" href="../../de/d48/struct_trie_1_1_trie_node.html">TrieNode</a>&gt; Trie::TrieNode::character[ALPHABETS] {nullptr}</td>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html">trie_modern.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   29</span>{<span class="keyword">nullptr</span>};</div>
 </div><!-- fragment -->
 </div>
@@ -152,12 +173,14 @@ Public Attributes</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../dc/d93/trie__modern_8cpp_source.html">trie_modern.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   31</span>{<span class="keyword">false</span>};</div>
 </div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this struct was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../dc/d93/trie__modern_8cpp.html">trie_modern.cpp</a></li>
+<li>data_structures/<a class="el" href="../../dc/d93/trie__modern_8cpp_source.html">trie_modern.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/de/d4a/class_compare.html b/de/d4a/class_compare.html
index 15fbf78c5..3c08d7f10 100644
--- a/de/d4a/class_compare.html
+++ b/de/d4a/class_compare.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Compare&lt; S, T, E &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: Compare&lt; S, T, E &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -116,7 +133,7 @@ $(function(){initNavTree('de/d4a/class_compare.html','../../'); initResizable(tr
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:afbdf9a44adb49728dc704155d7d1570c" id="r_afbdf9a44adb49728dc704155d7d1570c"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afbdf9a44adb49728dc704155d7d1570c">operator()</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a>&lt; S, T, E, double, double, double &gt; &amp;t1, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a>&lt; S, T, E, double, double, double &gt; &amp;t2)</td></tr>
+<tr class="memitem:afbdf9a44adb49728dc704155d7d1570c" id="r_afbdf9a44adb49728dc704155d7d1570c"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afbdf9a44adb49728dc704155d7d1570c">operator()</a> (tuple&lt; S, T, E, double, double, double &gt; &amp;t1, tuple&lt; S, T, E, double, double, double &gt; &amp;t2)</td></tr>
 <tr class="memdesc:afbdf9a44adb49728dc704155d7d1570c"><td class="mdescLeft">&#160;</td><td class="mdescRight">A comparator function that checks whether to swap the two tuples or not. <a class="el" href="">to <a href="https://www.geeksforgeeks.org/comparator-class-in-c-with-examples/">https://www.geeksforgeeks.org/comparator-class-in-c-with-examples/</a> for detailed description of comparator. </a> <br /></td></tr>
 <tr class="separator:afbdf9a44adb49728dc704155d7d1570c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
@@ -131,6 +148,8 @@ class Compare&lt; S, T, E &gt;</div><p>Comparator class for priority queue. </p>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00063">63</a> of file <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html">fcfs_scheduling.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="afbdf9a44adb49728dc704155d7d1570c" name="afbdf9a44adb49728dc704155d7d1570c"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#afbdf9a44adb49728dc704155d7d1570c">&#9670;&#160;</a></span>operator()()</h2>
@@ -146,12 +165,12 @@ template&lt;typename S , typename T , typename E &gt; </div>
         <tr>
           <td class="memname">bool <a class="el" href="../../de/d4a/class_compare.html">Compare</a>&lt; S, T, E &gt;::operator() </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a>&lt; S, T, E, double, double, double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>t1</em></span>, </td>
+          <td class="paramtype">tuple&lt; S, T, E, double, double, double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>t1</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a>&lt; S, T, E, double, double, double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>t2</em></span>&#160;)</td>
+          <td class="paramtype">tuple&lt; S, T, E, double, double, double &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>t2</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -172,6 +191,8 @@ template&lt;typename S , typename T , typename E &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>true if the tuples SHOULD be swapped </dd>
 <dd>
 false if the tuples SHOULDN'T be swapped </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00076">76</a> of file <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html">fcfs_scheduling.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   77</span>                                                                {</div>
 <div class="line"><span class="lineno">   78</span>        <span class="comment">// Compare arrival times</span></div>
 <div class="line"><span class="lineno">   79</span>        <span class="keywordflow">if</span> (get&lt;1&gt;(t2) &lt; get&lt;1&gt;(t1)) {</div>
@@ -187,7 +208,7 @@ false if the tuples SHOULDN'T be swapped </dd></dl>
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>cpu_scheduling_algorithms/<a class="el" href="../../df/d47/fcfs__scheduling_8cpp.html">fcfs_scheduling.cpp</a></li>
+<li>cpu_scheduling_algorithms/<a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html">fcfs_scheduling.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.map b/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.map
index 2ac5d86cf..9622b3249 100644
--- a/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.map
+++ b/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.map
@@ -1,13 +1,13 @@
 <map id="range_queries::heavy_light_decomposition::Tree&lt; X &gt;" name="range_queries::heavy_light_decomposition::Tree&lt; X &gt;">
 <area shape="rect" id="Node000001" title="A Basic Tree, which supports binary lifting." alt="" coords="465,94,610,150"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="222,5,360,46"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="222,5,360,46"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="361,50,466,91,464,96,359,54"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list.html" title=" " alt="" coords="5,13,108,38"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="5,13,108,38"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="123,23,222,23,222,28,123,28"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="213,71,370,111"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="213,71,370,111"/>
 <area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="386,100,465,110,464,115,385,105"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="231,140,352,165"/>
+<area shape="rect" id="Node000005" title=" " alt="" coords="231,140,352,165"/>
 <area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="367,149,441,142,464,138,465,143,441,148,368,154"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="233,189,350,214"/>
+<area shape="rect" id="Node000006" title=" " alt="" coords="233,189,350,214"/>
 <area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="364,188,440,167,485,148,488,152,442,173,366,193"/>
 </map>
diff --git a/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.md5 b/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.md5
index 5507b507a..5a0cf4d63 100644
--- a/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.md5
+++ b/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.md5
@@ -1 +1 @@
-6192615f7da1830b231ce27bf21b20aa
\ No newline at end of file
+a77360b724632dafb0e5bc8a3c90b219
\ No newline at end of file
diff --git a/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.svg b/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.svg
index f0c3c8e9c..dc86b9b80 100644
--- a/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.svg
+++ b/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph.svg
@@ -33,7 +33,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="266.38,-156.88 162.62,-156.88 162.62,-126.38 266.38,-126.38 266.38,-156.88"/>
 <text text-anchor="start" x="170.62" y="-143.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::list</text>
 <text text-anchor="middle" x="214.5" y="-132.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -53,7 +53,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="76.75,-151.25 0,-151.25 0,-132 76.75,-132 76.75,-151.25"/>
 <text text-anchor="middle" x="38.38" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list&lt; int &gt;</text>
 </a>
@@ -72,7 +72,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="273.5,-107.88 155.5,-107.88 155.5,-77.38 273.5,-77.38 273.5,-107.88"/>
 <text text-anchor="start" x="163.5" y="-94.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="214.5" y="-83.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -92,7 +92,7 @@
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000005"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="260,-56.25 169,-56.25 169,-37 260,-37 260,-56.25"/>
 <text text-anchor="middle" x="214.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
@@ -112,7 +112,7 @@
 <!-- Node6 -->
 <g id="Node000006" class="node">
 <title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000006"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="258.12,-19.25 170.88,-19.25 170.88,0 258.12,0 258.12,-19.25"/>
 <text text-anchor="middle" x="214.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; X &gt;</text>
 </a>
diff --git a/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph_org.svg b/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph_org.svg
index 78dceebe3..f3168c7cc 100644
--- a/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph_org.svg
+++ b/de/d4c/classrange__queries_1_1heavy__light__decomposition_1_1_tree__coll__graph_org.svg
@@ -22,7 +22,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="266.38,-156.88 162.62,-156.88 162.62,-126.38 266.38,-126.38 266.38,-156.88"/>
 <text text-anchor="start" x="170.62" y="-143.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::list</text>
 <text text-anchor="middle" x="214.5" y="-132.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -42,7 +42,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="76.75,-151.25 0,-151.25 0,-132 76.75,-132 76.75,-151.25"/>
 <text text-anchor="middle" x="38.38" y="-137.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list&lt; int &gt;</text>
 </a>
@@ -61,7 +61,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="273.5,-107.88 155.5,-107.88 155.5,-77.38 273.5,-77.38 273.5,-107.88"/>
 <text text-anchor="start" x="163.5" y="-94.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="214.5" y="-83.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -81,7 +81,7 @@
 <!-- Node5 -->
 <g id="Node000005" class="node">
 <title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000005"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="260,-56.25 169,-56.25 169,-37 260,-37 260,-56.25"/>
 <text text-anchor="middle" x="214.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
@@ -101,7 +101,7 @@
 <!-- Node6 -->
 <g id="Node000006" class="node">
 <title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000006"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="258.12,-19.25 170.88,-19.25 170.88,0 258.12,0 258.12,-19.25"/>
 <text text-anchor="middle" x="214.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; X &gt;</text>
 </a>
diff --git a/de/d57/struct_test_case__coll__graph.map b/de/d57/struct_test_case__coll__graph.map
index 6c6da8bd1..2a3f95856 100644
--- a/de/d57/struct_test_case__coll__graph.map
+++ b/de/d57/struct_test_case__coll__graph.map
@@ -1,9 +1,7 @@
 <map id="TestCase" name="TestCase">
-<area shape="rect" id="Node000001" title="represents single example inputs and expected output of the function longest_common_string_length" alt="" coords="81,199,159,225"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string.html" title=" " alt="" coords="28,95,108,121"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="79,135,96,174,112,197,108,200,92,176,74,137"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string.html" title=" " alt="" coords="5,5,131,46"/>
+<area shape="rect" id="Node000001" title="represents single example inputs and expected output of the function longest_common_string_length" alt="" coords="29,199,107,225"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="28,95,108,121"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="71,137,71,199,65,199,65,137"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="5,5,131,46"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="71,61,71,95,65,95,65,61"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/size_t.html" title=" " alt="" coords="132,95,214,121"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="165,136,146,176,131,200,127,197,142,174,161,134"/>
 </map>
diff --git a/de/d57/struct_test_case__coll__graph.md5 b/de/d57/struct_test_case__coll__graph.md5
index e76186203..03a93e042 100644
--- a/de/d57/struct_test_case__coll__graph.md5
+++ b/de/d57/struct_test_case__coll__graph.md5
@@ -1 +1 @@
-3f08e09ab46000e9e6f88a992b34f485
\ No newline at end of file
+42568575b3e6fec19aa4f29fcca461a4
\ No newline at end of file
diff --git a/de/d57/struct_test_case__coll__graph.svg b/de/d57/struct_test_case__coll__graph.svg
index 9cf4ebf0e..d37856b94 100644
--- a/de/d57/struct_test_case__coll__graph.svg
+++ b/de/d57/struct_test_case__coll__graph.svg
@@ -4,8 +4,8 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: TestCase Pages: 1 -->
-<svg width="211pt" height="173pt"
- viewBox="0.00 0.00 210.82 172.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="102pt" height="173pt"
+ viewBox="0.00 0.00 102.00 172.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 
 <svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
 
@@ -23,15 +23,15 @@
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="represents single example inputs and expected output of the function longest_common_string_length">
-<polygon fill="#999999" stroke="#666666" points="115,-19.25 57,-19.25 57,0 115,0 115,-19.25"/>
-<text text-anchor="middle" x="86" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCase</text>
+<polygon fill="#999999" stroke="#666666" points="76,-19.25 18,-19.25 18,0 76,0 76,-19.25"/>
+<text text-anchor="middle" x="47" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCase</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="76.75,-97 17.25,-97 17.25,-77.75 76.75,-77.75 76.75,-97"/>
 <text text-anchor="middle" x="47" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::string</text>
 </a>
@@ -41,17 +41,17 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M53.55,-66.59C56.91,-57.42 61.38,-46.52 66.5,-37.25 69.94,-31.03 74.62,-24.59 78.53,-19.6"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="50.27,-65.35 50.3,-75.94 56.89,-67.64 50.27,-65.35"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M47,-66.1C47,-50.95 47,-30.98 47,-19.6"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="43.5,-65.87 47,-75.87 50.5,-65.87 43.5,-65.87"/>
 </a>
 </g>
-<text text-anchor="middle" x="85.25" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> string_a</text>
-<text text-anchor="middle" x="85.25" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">string_b</text>
+<text text-anchor="middle" x="65.75" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> string_a</text>
+<text text-anchor="middle" x="65.75" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">string_b</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="94,-164.5 0,-164.5 0,-134 94,-134 94,-164.5"/>
 <text text-anchor="start" x="8" y="-151" font-family="Helvetica,sans-Serif" font-size="10.00">std::basic_string&lt;</text>
 <text text-anchor="middle" x="47" y="-139.75" font-family="Helvetica,sans-Serif" font-size="10.00"> Char &gt;</text>
@@ -67,25 +67,6 @@
 </a>
 </g>
 </g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="156.88,-97 95.12,-97 95.12,-77.75 156.88,-77.75 156.88,-97"/>
-<text text-anchor="middle" x="126" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node4&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M118.26,-67.04C114.34,-57.83 109.3,-46.78 104,-37.25 100.64,-31.2 96.31,-24.77 92.74,-19.74"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="114.93,-68.14 121.97,-76.06 121.4,-65.48 114.93,-68.14"/>
-</a>
-</g>
-<text text-anchor="middle" x="158.94" y="-44.62" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> common_string_len</text>
-</g>
 </g>
 </svg>
 </svg>
diff --git a/de/d57/struct_test_case__coll__graph_org.svg b/de/d57/struct_test_case__coll__graph_org.svg
index 8424ca9d2..aa3db95ba 100644
--- a/de/d57/struct_test_case__coll__graph_org.svg
+++ b/de/d57/struct_test_case__coll__graph_org.svg
@@ -4,23 +4,23 @@
 <!-- Generated by graphviz version 12.1.2 (20240928.0832)
  -->
 <!-- Title: TestCase Pages: 1 -->
-<svg width="211pt" height="173pt"
- viewBox="0.00 0.00 210.82 172.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<svg width="102pt" height="173pt"
+ viewBox="0.00 0.00 102.00 172.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
 <g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 168.5)">
 <title>TestCase</title>
 <!-- Node1 -->
 <g id="Node000001" class="node">
 <title>Node1</title>
 <g id="a_Node000001"><a xlink:title="represents single example inputs and expected output of the function longest_common_string_length">
-<polygon fill="#999999" stroke="#666666" points="115,-19.25 57,-19.25 57,0 115,0 115,-19.25"/>
-<text text-anchor="middle" x="86" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCase</text>
+<polygon fill="#999999" stroke="#666666" points="76,-19.25 18,-19.25 18,0 76,0 76,-19.25"/>
+<text text-anchor="middle" x="47" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCase</text>
 </a>
 </g>
 </g>
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="76.75,-97 17.25,-97 17.25,-77.75 76.75,-77.75 76.75,-97"/>
 <text text-anchor="middle" x="47" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::string</text>
 </a>
@@ -30,17 +30,17 @@
 <g id="edge1_Node000001_Node000002" class="edge">
 <title>Node2&#45;&gt;Node1</title>
 <g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M53.55,-66.59C56.91,-57.42 61.38,-46.52 66.5,-37.25 69.94,-31.03 74.62,-24.59 78.53,-19.6"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="50.27,-65.35 50.3,-75.94 56.89,-67.64 50.27,-65.35"/>
+<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M47,-66.1C47,-50.95 47,-30.98 47,-19.6"/>
+<polygon fill="#9a32cd" stroke="#9a32cd" points="43.5,-65.87 47,-75.87 50.5,-65.87 43.5,-65.87"/>
 </a>
 </g>
-<text text-anchor="middle" x="85.25" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> string_a</text>
-<text text-anchor="middle" x="85.25" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">string_b</text>
+<text text-anchor="middle" x="65.75" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> string_a</text>
+<text text-anchor="middle" x="65.75" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">string_b</text>
 </g>
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="94,-164.5 0,-164.5 0,-134 94,-134 94,-164.5"/>
 <text text-anchor="start" x="8" y="-151" font-family="Helvetica,sans-Serif" font-size="10.00">std::basic_string&lt;</text>
 <text text-anchor="middle" x="47" y="-139.75" font-family="Helvetica,sans-Serif" font-size="10.00"> Char &gt;</text>
@@ -56,24 +56,5 @@
 </a>
 </g>
 </g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="156.88,-97 95.12,-97 95.12,-77.75 156.88,-77.75 156.88,-97"/>
-<text text-anchor="middle" x="126" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node4&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M118.26,-67.04C114.34,-57.83 109.3,-46.78 104,-37.25 100.64,-31.2 96.31,-24.77 92.74,-19.74"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="114.93,-68.14 121.97,-76.06 121.4,-65.48 114.93,-68.14"/>
-</a>
-</g>
-<text text-anchor="middle" x="158.94" y="-44.62" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> common_string_len</text>
-</g>
 </g>
 </svg>
diff --git a/de/d5b/queue__using__linkedlist_8cpp_source.html b/de/d5b/queue__using__linkedlist_8cpp_source.html
new file mode 100644
index 000000000..30271f85b
--- /dev/null
+++ b/de/d5b/queue__using__linkedlist_8cpp_source.html
@@ -0,0 +1,231 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/queue_using_linkedlist.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/d5b/queue__using__linkedlist_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">queue_using_linkedlist.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment">    Write a program to implement Queue using linkedlist.</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment">*/</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span> </div>
+<div class="foldopen" id="foldopen00006" data-start="{" data-end="};">
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"><a class="line" href="../../d0/dff/structlinkedlist.html">    6</a></span><span class="keyword">struct </span><a class="code hl_struct" href="../../d0/dff/structlinkedlist.html">linkedlist</a> {</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span>    <span class="keywordtype">int</span> data;</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>    <a class="code hl_struct" href="../../d0/dff/structlinkedlist.html">linkedlist</a> *next;</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>};</div>
+</div>
+<div class="foldopen" id="foldopen00010" data-start="{" data-end="};">
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"><a class="line" href="../../d2/dc4/classstack__linked_list.html">   10</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d2/dc4/classstack__linked_list.html">stack_linkedList</a> {</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <a class="code hl_struct" href="../../d0/dff/structlinkedlist.html">linkedlist</a> *front;</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <a class="code hl_struct" href="../../d0/dff/structlinkedlist.html">linkedlist</a> *rear;</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <a class="code hl_class" href="../../d2/dc4/classstack__linked_list.html">stack_linkedList</a>() { front = rear = NULL; }</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <span class="keywordtype">void</span> enqueue(<span class="keywordtype">int</span>);</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="keywordtype">int</span> dequeue();</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="keywordtype">void</span> display();</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>};</div>
+</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="keywordtype">void</span> stack_linkedList::enqueue(<span class="keywordtype">int</span> ele) {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <a class="code hl_struct" href="../../d0/dff/structlinkedlist.html">linkedlist</a> *temp = <span class="keyword">new</span> <a class="code hl_struct" href="../../d0/dff/structlinkedlist.html">linkedlist</a>();</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    temp-&gt;data = ele;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    temp-&gt;next = NULL;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="keywordflow">if</span> (front == NULL)</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        front = rear = temp;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        rear-&gt;next = temp;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>        rear = temp;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    }</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>}</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keywordtype">int</span> stack_linkedList::dequeue() {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <a class="code hl_struct" href="../../d0/dff/structlinkedlist.html">linkedlist</a> *temp;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordtype">int</span> ele;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordflow">if</span> (front == NULL)</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nStack is empty&quot;</span>;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        temp = front;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        ele = temp-&gt;data;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <span class="keywordflow">if</span> (front == rear)  <span class="comment">// if length of queue is 1;</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>            rear = rear-&gt;next;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        front = front-&gt;next;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="keyword">delete</span> (temp);</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    }</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordflow">return</span> ele;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>}</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="keywordtype">void</span> stack_linkedList::display() {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">if</span> (front == NULL)</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nStack is empty&quot;</span>;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        <a class="code hl_struct" href="../../d0/dff/structlinkedlist.html">linkedlist</a> *temp;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        temp = front;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <span class="keywordflow">while</span> (temp != NULL) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            std::cout &lt;&lt; temp-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>            temp = temp-&gt;next;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        }</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>}</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordtype">int</span> op, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <a class="code hl_class" href="../../d2/dc4/classstack__linked_list.html">stack_linkedList</a> ob;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n1. enqueue(Insertion) &quot;</span>;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n2. dequeue(Deletion)&quot;</span>;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n3. Display&quot;</span>;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n4. Exit&quot;</span>;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordflow">while</span> (1) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter your choice &quot;</span>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        std::cin &gt;&gt; op;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        <span class="keywordflow">if</span> (op == 1) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Enter data &quot;</span>;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            std::cin &gt;&gt; <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            ob.enqueue(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 2)</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> = ob.dequeue();</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 3)</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            ob.display();</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 4)</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>            exit(0);</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;\nWrong choice &quot;</span>;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    }</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>}</div>
+<div class="ttc" id="aclassstack__linked_list_html"><div class="ttname"><a href="../../d2/dc4/classstack__linked_list.html">stack_linkedList</a></div><div class="ttdef"><b>Definition</b> <a href="#l00010">queue_using_linkedlist.cpp:10</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="astructlinkedlist_html"><div class="ttname"><a href="../../d0/dff/structlinkedlist.html">linkedlist</a></div><div class="ttdef"><b>Definition</b> <a href="#l00006">queue_using_linkedlist.cpp:6</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><b>queue_using_linkedlist.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.map b/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.map
index 9a83fba0f..ec4eac805 100644
--- a/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.map
+++ b/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.map
@@ -1,6 +1,6 @@
 <map id="range_queries::perSegTree::Node" name="range_queries::perSegTree::Node">
 <area shape="rect" id="Node000001" title=" " alt="" coords="5,5,183,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="17,124,171,180"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="17,124,171,180"/>
 <area shape="poly" id="edge2_Node000002_Node000001" title=" " alt="" coords="76,61,72,71,70,85,72,99,81,123,76,124,67,101,65,85,67,69,71,59"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="91,108,91,46,97,46,97,108"/>
 </map>
diff --git a/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.md5 b/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.md5
index c017bac27..16d75ffcd 100644
--- a/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.md5
+++ b/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.md5
@@ -1 +1 @@
-fa3b1fa64665dabd8467863b63432d18
\ No newline at end of file
+b7731df322b5f289eca3c745c19d1a1f
\ No newline at end of file
diff --git a/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.svg b/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.svg
index 527b6952c..0265ee625 100644
--- a/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.svg
+++ b/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph.svg
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="124,-41.75 9,-41.75 9,0 124,0 124,-41.75"/>
 <text text-anchor="start" x="17" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; range</text>
 <text text-anchor="start" x="17" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_queries::perSegTree::</text>
diff --git a/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph_org.svg b/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph_org.svg
index eae01a50f..dadb7f9d2 100644
--- a/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph_org.svg
+++ b/de/d61/classrange__queries_1_1per_seg_tree_1_1_node__coll__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="124,-41.75 9,-41.75 9,0 124,0 124,-41.75"/>
 <text text-anchor="start" x="17" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; range</text>
 <text text-anchor="start" x="17" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_queries::perSegTree::</text>
diff --git a/de/d6a/knuth__morris__pratt_8cpp.html b/de/d6a/knuth__morris__pratt_8cpp.html
index 48937bfad..5b4d81975 100644
--- a/de/d6a/knuth__morris__pratt_8cpp.html
+++ b/de/d6a/knuth__morris__pratt_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: strings/knuth_morris_pratt.cpp File Reference</title>
+<title>TheAlgorithms/C++: strings/knuth_morris_pratt.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for knuth_morris_pratt.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d69/knuth__morris__pratt_8cpp__incl.svg" width="331" height="126"><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">
+</div>
+<p><a href="../../de/d6a/knuth__morris__pratt_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html">string_search</a></td></tr>
@@ -131,10 +150,10 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a83c72ff237cdf623e42d4295e0029bf9" id="r_a83c72ff237cdf623e42d4295e0029bf9"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9">string_search::getFailureArray</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;pattern)</td></tr>
+<tr class="memitem:a83c72ff237cdf623e42d4295e0029bf9" id="r_a83c72ff237cdf623e42d4295e0029bf9"><td class="memItemLeft" align="right" valign="top">std::vector&lt; size_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9">string_search::getFailureArray</a> (const std::string &amp;pattern)</td></tr>
 <tr class="memdesc:a83c72ff237cdf623e42d4295e0029bf9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Generate the partial match table aka failure function for a pattern to search.  <br /></td></tr>
 <tr class="separator:a83c72ff237cdf623e42d4295e0029bf9"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a1e37af2f023495129cb57338c801209e" id="r_a1e37af2f023495129cb57338c801209e"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e">string_search::kmp</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;pattern, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text)</td></tr>
+<tr class="memitem:a1e37af2f023495129cb57338c801209e" id="r_a1e37af2f023495129cb57338c801209e"><td class="memItemLeft" align="right" valign="top">size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e">string_search::kmp</a> (const std::string &amp;pattern, const std::string &amp;text)</td></tr>
 <tr class="memdesc:a1e37af2f023495129cb57338c801209e"><td class="mdescLeft">&#160;</td><td class="mdescRight">KMP algorithm to find a pattern in a text.  <br /></td></tr>
 <tr class="separator:a1e37af2f023495129cb57338c801209e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
@@ -150,6 +169,8 @@ Functions</h2></td></tr>
 <li>Step through the text one character at a time and compare it to a character in the pattern updating our location within the pattern if necessary <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Yancey2023" target="_blank">Yancey</a> </dd></dl>
 </li>
 </ol>
+
+<p class="definition">Definition in file <a class="el" href="../../de/d6a/knuth__morris__pratt_8cpp_source.html">knuth_morris_pratt.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -165,11 +186,13 @@ Functions</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/d6a/knuth__morris__pratt_8cpp_source.html#l00095">95</a> of file <a class="el" href="../../de/d6a/knuth__morris__pratt_8cpp_source.html">knuth_morris_pratt.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   95</span>           {</div>
 <div class="line"><span class="lineno">   96</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();</div>
 <div class="line"><span class="lineno">   97</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   98</span>}</div>
-<div class="ttc" id="aknuth__morris__pratt_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">self-test implementations</div><div class="ttdef"><b>Definition</b> knuth_morris_pratt.cpp:79</div></div>
+<div class="ttc" id="aknuth__morris__pratt_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">self-test implementations</div><div class="ttdef"><b>Definition</b> <a href="../../de/d6a/knuth__morris__pratt_8cpp_source.html#l00079">knuth_morris_pratt.cpp:79</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -198,6 +221,8 @@ Functions</h2></td></tr>
 
 <p>self-test implementations </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d6a/knuth__morris__pratt_8cpp_source.html#l00079">79</a> of file <a class="el" href="../../de/d6a/knuth__morris__pratt_8cpp_source.html">knuth_morris_pratt.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   79</span>                    {</div>
 <div class="line"><span class="lineno">   80</span>    assert(kmp(<span class="stringliteral">&quot;abc1abc12l&quot;</span>, <span class="stringliteral">&quot;alskfjaldsabc1abc1abc12k2&quot;</span>) == std::string::npos);</div>
 <div class="line"><span class="lineno">   81</span>    assert(kmp(<span class="stringliteral">&quot;bca&quot;</span>, <span class="stringliteral">&quot;abcabc&quot;</span>) == 1);</div>
@@ -207,9 +232,8 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   85</span>    assert(kmp(<span class="stringliteral">&quot;&quot;</span>, <span class="stringliteral">&quot;pattern is empty&quot;</span>) == 0);</div>
 <div class="line"><span class="lineno">   86</span> </div>
 <div class="line"><span class="lineno">   87</span>    <span class="comment">// this lets the user know that the tests have passed</span></div>
-<div class="line"><span class="lineno">   88</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All KMP algorithm tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   88</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All KMP algorithm tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   89</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><!-- fragment -->
 </div>
 </div>
diff --git a/de/d6a/knuth__morris__pratt_8cpp_source.html b/de/d6a/knuth__morris__pratt_8cpp_source.html
new file mode 100644
index 000000000..16316a764
--- /dev/null
+++ b/de/d6a/knuth__morris__pratt_8cpp_source.html
@@ -0,0 +1,211 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: strings/knuth_morris_pratt.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/d6a/knuth__morris__pratt_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">knuth_morris_pratt.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/d6a/knuth__morris__pratt_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;string&gt;</span>    </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/d03/namespacestring__search.html">string_search</a> {</div>
+<div class="foldopen" id="foldopen00032" data-start="{" data-end="}">
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9">   32</a></span>std::vector&lt;size_t&gt; <a class="code hl_function" href="../../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9">getFailureArray</a>(<span class="keyword">const</span> std::string &amp;pattern) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordtype">size_t</span> pattern_length = pattern.size();</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    std::vector&lt;size_t&gt; failure(pattern_length + 1);</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    failure[0] = std::string::npos;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordtype">size_t</span> j = std::string::npos;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; pattern_length; i++) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <span class="keywordflow">while</span> (j != std::string::npos &amp;&amp; pattern[j] != pattern[i]) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            j = failure[j];</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        }</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        failure[i + 1] = ++j;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">return</span> failure;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>}</div>
+</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="foldopen" id="foldopen00053" data-start="{" data-end="}">
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e">   53</a></span><span class="keywordtype">size_t</span> <a class="code hl_function" href="../../d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e">kmp</a>(<span class="keyword">const</span> std::string &amp;pattern, <span class="keyword">const</span> std::string &amp;text) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">if</span> (pattern.empty()) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    std::vector&lt;size_t&gt; failure = <a class="code hl_function" href="../../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9">getFailureArray</a>(pattern);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordtype">size_t</span> text_length = text.size();</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordtype">size_t</span> pattern_length = pattern.size();</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordtype">size_t</span> k = 0;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j &lt; text_length; j++) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordflow">while</span> (k != std::string::npos &amp;&amp; pattern[k] != text[j]) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            k = failure[k];</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <span class="keywordflow">if</span> (++k == pattern_length) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            <span class="keywordflow">return</span> j - k + 1;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordflow">return</span> std::string::npos;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>}</div>
+</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>}  <span class="comment">// namespace string_search</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span><span class="keyword">using </span><a class="code hl_function" href="../../d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e">string_search::kmp</a>;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="foldopen" id="foldopen00079" data-start="{" data-end="}">
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="../../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">   79</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    assert(kmp(<span class="stringliteral">&quot;abc1abc12l&quot;</span>, <span class="stringliteral">&quot;alskfjaldsabc1abc1abc12k2&quot;</span>) == std::string::npos);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    assert(kmp(<span class="stringliteral">&quot;bca&quot;</span>, <span class="stringliteral">&quot;abcabc&quot;</span>) == 1);</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    assert(kmp(<span class="stringliteral">&quot;World&quot;</span>, <span class="stringliteral">&quot;helloWorld&quot;</span>) == 5);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    assert(kmp(<span class="stringliteral">&quot;c++&quot;</span>, <span class="stringliteral">&quot;his_is_c++&quot;</span>) == 7);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    assert(kmp(<span class="stringliteral">&quot;happy&quot;</span>, <span class="stringliteral">&quot;happy_coding&quot;</span>) == 0);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    assert(kmp(<span class="stringliteral">&quot;&quot;</span>, <span class="stringliteral">&quot;pattern is empty&quot;</span>) == 0);</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="comment">// this lets the user know that the tests have passed</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All KMP algorithm tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>}</div>
+</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span><span class="comment"> * @brief Main function</span></div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span><span class="comment"> * @returns 0 on exit</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <a class="code hl_function" href="../../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="aknuth__morris__pratt_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../de/d6a/knuth__morris__pratt_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> <a href="#l00079">knuth_morris_pratt.cpp:79</a></div></div>
+<div class="ttc" id="anamespacestring__search_html"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html">string_search</a></div><div class="ttdoc">String search algorithms.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/d7d/brute__force__string__searching_8cpp_source.html#l00013">brute_force_string_searching.cpp:13</a></div></div>
+<div class="ttc" id="anamespacestring__search_html_a1e37af2f023495129cb57338c801209e"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e">string_search::kmp</a></div><div class="ttdeci">size_t kmp(const std::string &amp;pattern, const std::string &amp;text)</div><div class="ttdoc">KMP algorithm to find a pattern in a text.</div><div class="ttdef"><b>Definition</b> <a href="#l00053">knuth_morris_pratt.cpp:53</a></div></div>
+<div class="ttc" id="anamespacestring__search_html_a83c72ff237cdf623e42d4295e0029bf9"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9">string_search::getFailureArray</a></div><div class="ttdeci">std::vector&lt; size_t &gt; getFailureArray(const std::string &amp;pattern)</div><div class="ttdoc">Generate the partial match table aka failure function for a pattern to search.</div><div class="ttdef"><b>Definition</b> <a href="#l00032">knuth_morris_pratt.cpp:32</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_73a3cc5065b223eb41b02873c0e19f0e.html">strings</a></li><li class="navelem"><a class="el" href="../../de/d6a/knuth__morris__pratt_8cpp.html">knuth_morris_pratt.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/d6b/namespacerandom__pivot__quick__sort.html b/de/d6b/namespacerandom__pivot__quick__sort.html
index 4f430ed6d..0b7c210d9 100644
--- a/de/d6b/namespacerandom__pivot__quick__sort.html
+++ b/de/d6b/namespacerandom__pivot__quick__sort.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: random_pivot_quick_sort Namespace Reference</title>
+<title>TheAlgorithms/C++: random_pivot_quick_sort Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/d72/geometric__dist_8cpp.html b/de/d72/geometric__dist_8cpp.html
index efbc99df5..48c181a9a 100644
--- a/de/d72/geometric__dist_8cpp.html
+++ b/de/d72/geometric__dist_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: probability/geometric_dist.cpp File Reference</title>
+<title>TheAlgorithms/C++: probability/geometric_dist.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -127,7 +144,9 @@ Include dependency graph for geometric_dist.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d2c/geometric__dist_8cpp__incl.svg" width="662" height="126"><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">
+</div>
+<p><a href="../../de/d72/geometric__dist_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html">probability::geometric_dist::geometric_distribution</a></td></tr>
@@ -163,6 +182,8 @@ Functions</h2></td></tr>
 <p>The geometric distribution models the experiment of doing Bernoulli trials until a sucess was observed. There are two formulations of the geometric distribution: 1) The probability distribution of the number X of Bernoulli trials needed to get one success, supported on the set { 1, 2, 3, ... } 2) The probability distribution of the number Y = X − 1 of failures before the first success, supported on the set { 0, 1, 2, 3, ... } Here, the first one is implemented.</p>
 <p>Common variables used: p - The success probability k - The number of tries</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/DerAndereDomenic" target="_blank">Domenic Zingsheim</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html">geometric_dist.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a82964ca6180507deb5fafc71050012ba" name="a82964ca6180507deb5fafc71050012ba"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a82964ca6180507deb5fafc71050012ba">&#9670;&#160;</a></span>generate_uniform()</h2>
@@ -181,15 +202,12 @@ Functions</h2></td></tr>
 
 <p>Returns a random number between [0,1]. </p>
 <dl class="section return"><dt>Returns</dt><dd>A uniformly distributed random number between 0 (included) and 1 (included) </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html">geometric_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   48</span>                         {</div>
 <div class="line"><span class="lineno">   49</span>    <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(rand()) / <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(RAND_MAX);</div>
 <div class="line"><span class="lineno">   50</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d72/geometric__dist_8cpp_a82964ca6180507deb5fafc71050012ba_cgraph.svg" width="168" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -209,19 +227,15 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html#l00256">256</a> of file <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html">geometric_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  256</span>           {</div>
-<div class="line"><span class="lineno">  257</span>    srand(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">time</a>(<span class="keyword">nullptr</span>));</div>
+<div class="line"><span class="lineno">  257</span>    srand(time(<span class="keyword">nullptr</span>));</div>
 <div class="line"><span class="lineno">  258</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  259</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  260</span>}</div>
-<div class="ttc" id="ageometric__dist_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> geometric_dist.cpp:197</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="ageometric__dist_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d72/geometric__dist_8cpp_source.html#l00197">geometric_dist.cpp:197</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a70fd1cc5c3a2813f28683dc75dcd65b6" name="a70fd1cc5c3a2813f28683dc75dcd65b6"></a>
@@ -246,10 +260,12 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html#l00165">165</a> of file <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html">geometric_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  166</span>                                                                 {</div>
 <div class="line"><span class="lineno">  167</span>    uint32_t n_tries = 1000000;</div>
-<div class="line"><span class="lineno">  168</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> tries;</div>
-<div class="line"><span class="lineno">  169</span>    tries.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/resize.html">resize</a>(n_tries);</div>
+<div class="line"><span class="lineno">  168</span>    std::vector&lt;float&gt; tries;</div>
+<div class="line"><span class="lineno">  169</span>    tries.resize(n_tries);</div>
 <div class="line"><span class="lineno">  170</span> </div>
 <div class="line"><span class="lineno">  171</span>    <span class="keywordtype">float</span> mean = 0.0f;</div>
 <div class="line"><span class="lineno">  172</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; n_tries; ++i) {</div>
@@ -267,24 +283,15 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  184</span>    <span class="comment">// Unbiased estimate of variance</span></div>
 <div class="line"><span class="lineno">  185</span>    var /= <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(n_tries - 1);</div>
 <div class="line"><span class="lineno">  186</span> </div>
-<div class="line"><span class="lineno">  187</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;This value should be near &quot;</span> &lt;&lt; dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413">expected_value</a>() &lt;&lt; <span class="stringliteral">&quot;: &quot;</span></div>
-<div class="line"><span class="lineno">  188</span>              &lt;&lt; mean &lt;&lt; <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">  189</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;This value should be near &quot;</span> &lt;&lt; dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960">variance</a>() &lt;&lt; <span class="stringliteral">&quot;: &quot;</span> &lt;&lt; var</div>
-<div class="line"><span class="lineno">  190</span>              &lt;&lt; <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">  187</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;This value should be near &quot;</span> &lt;&lt; dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413">expected_value</a>() &lt;&lt; <span class="stringliteral">&quot;: &quot;</span></div>
+<div class="line"><span class="lineno">  188</span>              &lt;&lt; mean &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  189</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;This value should be near &quot;</span> &lt;&lt; dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960">variance</a>() &lt;&lt; <span class="stringliteral">&quot;: &quot;</span> &lt;&lt; var</div>
+<div class="line"><span class="lineno">  190</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  191</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="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_a41051365f8ac7700f2ed5880a6760413"><div class="ttname"><a href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413">probability::geometric_dist::geometric_distribution::expected_value</a></div><div class="ttdeci">float expected_value() const</div><div class="ttdoc">The expected value of a geometrically distributed random variable X.</div><div class="ttdef"><b>Definition</b> geometric_dist.cpp:71</div></div>
-<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_a8aae1cebcf42ed2332f1c7217c401aa3"><div class="ttname"><a href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3">probability::geometric_dist::geometric_distribution::draw_sample</a></div><div class="ttdeci">uint32_t draw_sample() const</div><div class="ttdoc">Generates a (discrete) sample according to the geometrical distribution.</div><div class="ttdef"><b>Definition</b> geometric_dist.cpp:125</div></div>
-<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_aea8b0d649f0dc9a6f8baf3341a0b4960"><div class="ttname"><a href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960">probability::geometric_dist::geometric_distribution::variance</a></div><div class="ttdeci">float variance() const</div><div class="ttdoc">The variance of a geometrically distributed random variable X.</div><div class="ttdef"><b>Definition</b> geometric_dist.cpp:77</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="aresize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/resize.html">std::vector::resize</a></div><div class="ttdeci">T resize(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph.svg" width="100%" height="585"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_a41051365f8ac7700f2ed5880a6760413"><div class="ttname"><a href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413">probability::geometric_dist::geometric_distribution::expected_value</a></div><div class="ttdeci">float expected_value() const</div><div class="ttdoc">The expected value of a geometrically distributed random variable X.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d72/geometric__dist_8cpp_source.html#l00071">geometric_dist.cpp:71</a></div></div>
+<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_a8aae1cebcf42ed2332f1c7217c401aa3"><div class="ttname"><a href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3">probability::geometric_dist::geometric_distribution::draw_sample</a></div><div class="ttdeci">uint32_t draw_sample() const</div><div class="ttdoc">Generates a (discrete) sample according to the geometrical distribution.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d72/geometric__dist_8cpp_source.html#l00125">geometric_dist.cpp:125</a></div></div>
+<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_aea8b0d649f0dc9a6f8baf3341a0b4960"><div class="ttname"><a href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960">probability::geometric_dist::geometric_distribution::variance</a></div><div class="ttdeci">float variance() const</div><div class="ttdoc">The variance of a geometrically distributed random variable X.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d72/geometric__dist_8cpp_source.html#l00077">geometric_dist.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -312,12 +319,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html#l00197">197</a> of file <a class="el" href="../../de/d72/geometric__dist_8cpp_source.html">geometric_dist.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  197</span>                   {</div>
 <div class="line"><span class="lineno">  198</span>    <a class="code hl_class" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html">probability::geometric_dist::geometric_distribution</a> dist(0.3);</div>
 <div class="line"><span class="lineno">  199</span> </div>
 <div class="line"><span class="lineno">  200</span>    <span class="keyword">const</span> <span class="keywordtype">float</span> threshold = 1e-3f;</div>
 <div class="line"><span class="lineno">  201</span> </div>
-<div class="line"><span class="lineno">  202</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Starting tests for p = 0.3...&quot;</span> &lt;&lt; <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>    std::cout &lt;&lt; <span class="stringliteral">&quot;Starting tests for p = 0.3...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  203</span>    assert(std::abs(dist.expected_value() - 3.33333333f) &lt; threshold);</div>
 <div class="line"><span class="lineno">  204</span>    assert(std::abs(dist.variance() - 7.77777777f) &lt; threshold);</div>
 <div class="line"><span class="lineno">  205</span>    assert(std::abs(dist.standard_deviation() - 2.788866755) &lt; threshold);</div>
@@ -329,12 +338,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  211</span>    assert(std::abs(dist.range_tries() - 1.0f) &lt; threshold);</div>
 <div class="line"><span class="lineno">  212</span>    assert(std::abs(dist.range_tries(3) - 0.49f) &lt; threshold);</div>
 <div class="line"><span class="lineno">  213</span>    assert(std::abs(dist.range_tries(5, 11) - 0.2203267f) &lt; threshold);</div>
-<div class="line"><span class="lineno">  214</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests passed&quot;</span> &lt;&lt; <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">  214</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  215</span>    <a class="code hl_function" href="#a70fd1cc5c3a2813f28683dc75dcd65b6">sample_test</a>(dist);</div>
 <div class="line"><span class="lineno">  216</span> </div>
 <div class="line"><span class="lineno">  217</span>    dist = <a class="code hl_class" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html">probability::geometric_dist::geometric_distribution</a>(0.5f);</div>
 <div class="line"><span class="lineno">  218</span> </div>
-<div class="line"><span class="lineno">  219</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Starting tests for p = 0.5...&quot;</span> &lt;&lt; <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">  219</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Starting tests for p = 0.5...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  220</span>    assert(std::abs(dist.expected_value() - 2.0f) &lt; threshold);</div>
 <div class="line"><span class="lineno">  221</span>    assert(std::abs(dist.variance() - 2.0f) &lt; threshold);</div>
 <div class="line"><span class="lineno">  222</span>    assert(std::abs(dist.standard_deviation() - 1.4142135f) &lt; threshold);</div>
@@ -346,12 +355,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  228</span>    assert(std::abs(dist.range_tries() - 1.0f) &lt; threshold);</div>
 <div class="line"><span class="lineno">  229</span>    assert(std::abs(dist.range_tries(3) - 0.25f) &lt; threshold);</div>
 <div class="line"><span class="lineno">  230</span>    assert(std::abs(dist.range_tries(5, 11) - 0.062011f) &lt; threshold);</div>
-<div class="line"><span class="lineno">  231</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests passed&quot;</span> &lt;&lt; <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">  231</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  232</span>    <a class="code hl_function" href="#a70fd1cc5c3a2813f28683dc75dcd65b6">sample_test</a>(dist);</div>
 <div class="line"><span class="lineno">  233</span> </div>
 <div class="line"><span class="lineno">  234</span>    dist = <a class="code hl_class" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html">probability::geometric_dist::geometric_distribution</a>(0.8f);</div>
 <div class="line"><span class="lineno">  235</span> </div>
-<div class="line"><span class="lineno">  236</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Starting tests for p = 0.8...&quot;</span> &lt;&lt; <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">  236</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Starting tests for p = 0.8...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  237</span>    assert(std::abs(dist.expected_value() - 1.25f) &lt; threshold);</div>
 <div class="line"><span class="lineno">  238</span>    assert(std::abs(dist.variance() - 0.3125f) &lt; threshold);</div>
 <div class="line"><span class="lineno">  239</span>    assert(std::abs(dist.standard_deviation() - 0.559016f) &lt; threshold);</div>
@@ -363,17 +372,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  245</span>    assert(std::abs(dist.range_tries() - 1.0f) &lt; threshold);</div>
 <div class="line"><span class="lineno">  246</span>    assert(std::abs(dist.range_tries(3) - 0.04f) &lt; threshold);</div>
 <div class="line"><span class="lineno">  247</span>    assert(std::abs(dist.range_tries(5, 11) - 0.00159997f) &lt; threshold);</div>
-<div class="line"><span class="lineno">  248</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!&quot;</span> &lt;&lt; <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">  248</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  249</span>    <a class="code hl_function" href="#a70fd1cc5c3a2813f28683dc75dcd65b6">sample_test</a>(dist);</div>
 <div class="line"><span class="lineno">  250</span>}</div>
-<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html"><div class="ttname"><a href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html">probability::geometric_dist::geometric_distribution</a></div><div class="ttdoc">A class to model the geometric distribution.</div><div class="ttdef"><b>Definition</b> geometric_dist.cpp:55</div></div>
-<div class="ttc" id="ageometric__dist_8cpp_html_a70fd1cc5c3a2813f28683dc75dcd65b6"><div class="ttname"><a href="#a70fd1cc5c3a2813f28683dc75dcd65b6">sample_test</a></div><div class="ttdeci">void sample_test(const probability::geometric_dist::geometric_distribution &amp;dist)</div><div class="ttdoc">Tests the sampling method of the geometric distribution.</div><div class="ttdef"><b>Definition</b> geometric_dist.cpp:165</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html"><div class="ttname"><a href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html">probability::geometric_dist::geometric_distribution</a></div><div class="ttdoc">A class to model the geometric distribution.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d72/geometric__dist_8cpp_source.html#l00055">geometric_dist.cpp:55</a></div></div>
+<div class="ttc" id="ageometric__dist_8cpp_html_a70fd1cc5c3a2813f28683dc75dcd65b6"><div class="ttname"><a href="#a70fd1cc5c3a2813f28683dc75dcd65b6">sample_test</a></div><div class="ttdeci">void sample_test(const probability::geometric_dist::geometric_distribution &amp;dist)</div><div class="ttdoc">Tests the sampling method of the geometric distribution.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d72/geometric__dist_8cpp_source.html#l00165">geometric_dist.cpp:165</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph.map b/de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph.map
deleted file mode 100644
index 7ff5fddf1..000000000
--- a/de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph.map
+++ /dev/null
@@ -1,20 +0,0 @@
-<map id="sample_test" name="sample_test">
-<area shape="rect" id="Node000001" title="Tests the sampling method of the geometric distribution." alt="" coords="5,204,98,229"/>
-<area shape="rect" id="Node000002" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3" title="Generates a (discrete) sample according to the geometrical distribution." alt="" coords="146,58,330,114"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="62,201,96,164,144,124,151,119,154,124,147,128,100,168,66,205"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="202,138,274,164"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="80,200,145,174,186,161,188,166,147,179,82,205"/>
-<area shape="rect" id="Node000007" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413" title="The expected value of a geometrically distributed random variable X." alt="" coords="146,188,330,244"/>
-<area shape="poly" id="edge7_Node000001_Node000007" title=" " alt="" coords="98,214,130,214,130,219,98,219"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="175,269,301,294"/>
-<area shape="poly" id="edge8_Node000001_Node000008" title=" " alt="" coords="82,227,147,254,170,262,169,267,145,259,80,232"/>
-<area shape="rect" id="Node000009" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960" title="The variance of a geometrically distributed random variable X." alt="" coords="146,319,330,375"/>
-<area shape="poly" id="edge9_Node000001_Node000009" title=" " alt="" coords="66,228,100,265,147,305,154,309,151,313,144,309,96,269,62,231"/>
-<area shape="rect" id="Node000003" href="$de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba" title="Returns a random number between [0,1]." alt="" coords="405,29,562,70"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="330,70,389,61,390,66,331,75"/>
-<area shape="rect" id="Node000004" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf" title="The inverse cumulative distribution function." alt="" coords="378,94,589,150"/>
-<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="331,97,363,101,362,107,330,102"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="448,29,446,19,452,10,465,5,484,3,504,5,516,11,514,16,502,10,484,8,466,10,456,15,452,20,453,28"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/log.html#" title=" " alt="" coords="637,109,702,134"/>
-<area shape="poly" id="edge5_Node000004_Node000005" title=" " alt="" coords="590,119,622,119,622,124,590,124"/>
-</map>
diff --git a/de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph.md5 b/de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph.md5
deleted file mode 100644
index 64e9da596..000000000
--- a/de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-58cdddf49dd7bbfd19671b6e6cdd31bf
\ No newline at end of file
diff --git a/de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph.svg b/de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph.svg
deleted file mode 100644
index 52a1fb86b..000000000
--- a/de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph.svg
+++ /dev/null
@@ -1,266 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sample_test Pages: 1 -->
-<!--zoomable 285 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 530;
-var viewHeight = 285;
-var sectionId = 'dynsection-3';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>sample_test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Tests the sampling method of the geometric distribution.">
-<polygon fill="#999999" stroke="#666666" points="69.25,-128.5 0,-128.5 0,-109.25 69.25,-109.25 69.25,-128.5"/>
-<text text-anchor="middle" x="34.62" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">sample_test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3" target="_top" xlink:title="Generates a (discrete) sample according to the geometrical distribution.">
-<polygon fill="white" stroke="#666666" points="243.5,-237.75 105.25,-237.75 105.25,-196 243.5,-196 243.5,-237.75"/>
-<text text-anchor="start" x="113.25" y="-224.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="113.25" y="-213" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="174.38" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">::draw_sample</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.73,-128.79C55.87,-143.15 80.05,-169.85 105.25,-186.88 106.83,-187.94 108.46,-188.99 110.12,-190.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.19,-192.94 118.62,-194.84 111.65,-186.86 108.19,-192.94"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.12,-177.5 147.62,-177.5 147.62,-158.25 201.12,-158.25 201.12,-177.5"/>
-<text text-anchor="middle" x="174.38" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M56.97,-128.96C70.6,-135.18 88.74,-143.05 105.25,-148.88 115.18,-152.38 126.09,-155.67 136.23,-158.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.21,-161.84 145.78,-161.07 137.04,-155.09 135.21,-161.84"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413" target="_top" xlink:title="The expected value of a geometrically distributed random variable X.">
-<polygon fill="white" stroke="#666666" points="243.5,-139.75 105.25,-139.75 105.25,-98 243.5,-98 243.5,-139.75"/>
-<text text-anchor="start" x="113.25" y="-126.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="113.25" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="174.38" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::expected_value</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.68,-118.88C77.07,-118.88 85.19,-118.88 93.53,-118.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.48,-122.38 103.48,-118.88 93.48,-115.38 93.48,-122.38"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221.75,-79.5 127,-79.5 127,-60.25 221.75,-60.25 221.75,-79.5"/>
-<text text-anchor="middle" x="174.38" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge8_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M56.97,-108.79C70.6,-102.57 88.74,-94.7 105.25,-88.88 110.97,-86.86 117.01,-84.91 123.05,-83.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.76,-86.52 132.37,-80.36 121.79,-79.8 123.76,-86.52"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960" target="_top" xlink:title="The variance of a geometrically distributed random variable X.">
-<polygon fill="white" stroke="#666666" points="243.5,-41.75 105.25,-41.75 105.25,0 243.5,0 243.5,-41.75"/>
-<text text-anchor="start" x="113.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="113.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="174.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.73,-108.96C55.87,-94.6 80.05,-67.9 105.25,-50.88 106.83,-49.81 108.46,-48.76 110.12,-47.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.65,-50.89 118.62,-42.91 108.19,-44.81 111.65,-50.89"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba" target="_top" xlink:title="Returns a random number between [0,1].">
-<polygon fill="white" stroke="#666666" points="417.75,-259.12 299.75,-259.12 299.75,-228.62 417.75,-228.62 417.75,-259.12"/>
-<text text-anchor="start" x="307.75" y="-245.62" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="middle" x="358.75" y="-234.38" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::generate_uniform</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.8,-227.01C258.38,-229.16 273.79,-231.44 288.4,-233.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.49,-237.01 297.9,-235.01 288.52,-230.09 287.49,-237.01"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf" target="_top" xlink:title="The inverse cumulative distribution function.">
-<polygon fill="white" stroke="#666666" points="438,-210.75 279.5,-210.75 279.5,-169 438,-169 438,-210.75"/>
-<text text-anchor="start" x="287.5" y="-197.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="287.5" y="-186" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="358.75" y="-174.75" font-family="Helvetica,sans-Serif" font-size="10.00">::inverse_cumulative_distribution</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.8,-206.74C251.64,-205.58 259.71,-204.39 267.76,-203.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="268.25,-206.66 277.63,-201.74 267.22,-199.74 268.25,-206.66"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M334.05,-259.61C329.01,-268.68 337.24,-277.12 358.75,-277.12 370.51,-277.12 378.3,-274.6 382.12,-270.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="385.57,-271.46 383.27,-261.11 378.62,-270.63 385.57,-271.46"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/log.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="522.25,-199.5 474,-199.5 474,-180.25 522.25,-180.25 522.25,-199.5"/>
-<text text-anchor="middle" x="498.12" y="-186" font-family="Helvetica,sans-Serif" font-size="10.00">std::log</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M438.47,-189.88C446.79,-189.88 454.9,-189.88 462.32,-189.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="462.17,-193.38 472.17,-189.88 462.17,-186.38 462.17,-193.38"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph_org.svg b/de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph_org.svg
deleted file mode 100644
index 333ffd288..000000000
--- a/de/d72/geometric__dist_8cpp_a70fd1cc5c3a2813f28683dc75dcd65b6_cgraph_org.svg
+++ /dev/null
@@ -1,183 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sample_test Pages: 1 -->
-<svg width="530pt" height="285pt"
- viewBox="0.00 0.00 530.25 285.12" 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 281.12)">
-<title>sample_test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Tests the sampling method of the geometric distribution.">
-<polygon fill="#999999" stroke="#666666" points="69.25,-128.5 0,-128.5 0,-109.25 69.25,-109.25 69.25,-128.5"/>
-<text text-anchor="middle" x="34.62" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">sample_test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3" target="_top" xlink:title="Generates a (discrete) sample according to the geometrical distribution.">
-<polygon fill="white" stroke="#666666" points="243.5,-237.75 105.25,-237.75 105.25,-196 243.5,-196 243.5,-237.75"/>
-<text text-anchor="start" x="113.25" y="-224.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="113.25" y="-213" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="174.38" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">::draw_sample</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.73,-128.79C55.87,-143.15 80.05,-169.85 105.25,-186.88 106.83,-187.94 108.46,-188.99 110.12,-190.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.19,-192.94 118.62,-194.84 111.65,-186.86 108.19,-192.94"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201.12,-177.5 147.62,-177.5 147.62,-158.25 201.12,-158.25 201.12,-177.5"/>
-<text text-anchor="middle" x="174.38" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M56.97,-128.96C70.6,-135.18 88.74,-143.05 105.25,-148.88 115.18,-152.38 126.09,-155.67 136.23,-158.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.21,-161.84 145.78,-161.07 137.04,-155.09 135.21,-161.84"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413" target="_top" xlink:title="The expected value of a geometrically distributed random variable X.">
-<polygon fill="white" stroke="#666666" points="243.5,-139.75 105.25,-139.75 105.25,-98 243.5,-98 243.5,-139.75"/>
-<text text-anchor="start" x="113.25" y="-126.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="113.25" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="174.38" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">::expected_value</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M69.68,-118.88C77.07,-118.88 85.19,-118.88 93.53,-118.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="93.48,-122.38 103.48,-118.88 93.48,-115.38 93.48,-122.38"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="221.75,-79.5 127,-79.5 127,-60.25 221.75,-60.25 221.75,-79.5"/>
-<text text-anchor="middle" x="174.38" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge8_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M56.97,-108.79C70.6,-102.57 88.74,-94.7 105.25,-88.88 110.97,-86.86 117.01,-84.91 123.05,-83.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.76,-86.52 132.37,-80.36 121.79,-79.8 123.76,-86.52"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960" target="_top" xlink:title="The variance of a geometrically distributed random variable X.">
-<polygon fill="white" stroke="#666666" points="243.5,-41.75 105.25,-41.75 105.25,0 243.5,0 243.5,-41.75"/>
-<text text-anchor="start" x="113.25" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="113.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="174.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.73,-108.96C55.87,-94.6 80.05,-67.9 105.25,-50.88 106.83,-49.81 108.46,-48.76 110.12,-47.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.65,-50.89 118.62,-42.91 108.19,-44.81 111.65,-50.89"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba" target="_top" xlink:title="Returns a random number between [0,1].">
-<polygon fill="white" stroke="#666666" points="417.75,-259.12 299.75,-259.12 299.75,-228.62 417.75,-228.62 417.75,-259.12"/>
-<text text-anchor="start" x="307.75" y="-245.62" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="middle" x="358.75" y="-234.38" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::generate_uniform</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.8,-227.01C258.38,-229.16 273.79,-231.44 288.4,-233.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="287.49,-237.01 297.9,-235.01 288.52,-230.09 287.49,-237.01"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf" target="_top" xlink:title="The inverse cumulative distribution function.">
-<polygon fill="white" stroke="#666666" points="438,-210.75 279.5,-210.75 279.5,-169 438,-169 438,-210.75"/>
-<text text-anchor="start" x="287.5" y="-197.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="287.5" y="-186" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="358.75" y="-174.75" font-family="Helvetica,sans-Serif" font-size="10.00">::inverse_cumulative_distribution</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge4_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M243.8,-206.74C251.64,-205.58 259.71,-204.39 267.76,-203.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="268.25,-206.66 277.63,-201.74 267.22,-199.74 268.25,-206.66"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M334.05,-259.61C329.01,-268.68 337.24,-277.12 358.75,-277.12 370.51,-277.12 378.3,-274.6 382.12,-270.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="385.57,-271.46 383.27,-261.11 378.62,-270.63 385.57,-271.46"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/log.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="522.25,-199.5 474,-199.5 474,-180.25 522.25,-180.25 522.25,-199.5"/>
-<text text-anchor="middle" x="498.12" y="-186" font-family="Helvetica,sans-Serif" font-size="10.00">std::log</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge5_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge5_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M438.47,-189.88C446.79,-189.88 454.9,-189.88 462.32,-189.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="462.17,-193.38 472.17,-189.88 462.17,-186.38 462.17,-193.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d72/geometric__dist_8cpp_a82964ca6180507deb5fafc71050012ba_cgraph.map b/de/d72/geometric__dist_8cpp_a82964ca6180507deb5fafc71050012ba_cgraph.map
deleted file mode 100644
index adaa01a5e..000000000
--- a/de/d72/geometric__dist_8cpp_a82964ca6180507deb5fafc71050012ba_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="probability::geometric_dist::generate_uniform" name="probability::geometric_dist::generate_uniform">
-<area shape="rect" id="Node000001" title="Returns a random number between [0,1]." alt="" coords="5,29,163,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="53,29,52,19,57,11,68,5,84,3,101,5,112,11,109,16,100,10,84,8,69,10,61,14,57,20,59,28"/>
-</map>
diff --git a/de/d72/geometric__dist_8cpp_a82964ca6180507deb5fafc71050012ba_cgraph.md5 b/de/d72/geometric__dist_8cpp_a82964ca6180507deb5fafc71050012ba_cgraph.md5
deleted file mode 100644
index c0e8cf261..000000000
--- a/de/d72/geometric__dist_8cpp_a82964ca6180507deb5fafc71050012ba_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-76a030785997d7c204cf6aa41c38e21c
\ No newline at end of file
diff --git a/de/d72/geometric__dist_8cpp_a82964ca6180507deb5fafc71050012ba_cgraph.svg b/de/d72/geometric__dist_8cpp_a82964ca6180507deb5fafc71050012ba_cgraph.svg
deleted file mode 100644
index 27f147ef5..000000000
--- a/de/d72/geometric__dist_8cpp_a82964ca6180507deb5fafc71050012ba_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::generate_uniform Pages: 1 -->
-<svg width="126pt" height="57pt"
- viewBox="0.00 0.00 126.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>probability::geometric_dist::generate_uniform</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Returns a random number between [0,1].">
-<polygon fill="#999999" stroke="#666666" points="118,-30.5 0,-30.5 0,0 118,0 118,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="middle" x="59" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::generate_uniform</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.09,-30.99C33.82,-40.06 40.79,-48.5 59,-48.5 68.96,-48.5 75.55,-45.97 78.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.25,-42.79 79.76,-32.49 75.28,-42.09 82.25,-42.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d72/geometric__dist_8cpp_a82964ca6180507deb5fafc71050012ba_cgraph_org.svg b/de/d72/geometric__dist_8cpp_a82964ca6180507deb5fafc71050012ba_cgraph_org.svg
deleted file mode 100644
index 06ef9ba78..000000000
--- a/de/d72/geometric__dist_8cpp_a82964ca6180507deb5fafc71050012ba_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::geometric_dist::generate_uniform Pages: 1 -->
-<svg width="126pt" height="57pt"
- viewBox="0.00 0.00 126.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>probability::geometric_dist::generate_uniform</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Returns a random number between [0,1].">
-<polygon fill="#999999" stroke="#666666" points="118,-30.5 0,-30.5 0,0 118,0 118,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="middle" x="59" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::generate_uniform</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.09,-30.99C33.82,-40.06 40.79,-48.5 59,-48.5 68.96,-48.5 75.55,-45.97 78.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="82.25,-42.79 79.76,-32.49 75.28,-42.09 82.25,-42.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 48c6d06ee..000000000
--- a/de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,43 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,275,49,301"/>
-<area shape="rect" id="Node000002" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a" title="The cumulative distribution function." alt="" coords="329,5,513,61"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="28,274,50,156,70,91,81,66,95,50,119,34,145,21,201,7,259,4,314,8,313,13,259,9,202,13,147,26,122,38,98,54,86,69,74,93,55,157,33,275"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="386,275,457,301"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,285,370,285,370,290,49,290"/>
-<area shape="rect" id="Node000005" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413" title="The expected value of a geometrically distributed random variable X." alt="" coords="329,325,513,381"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="49,289,314,333,313,338,48,294"/>
-<area shape="rect" id="Node000006" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf" title="The inverse cumulative distribution function." alt="" coords="561,259,773,314"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="48,278,96,267,213,252,304,248,396,251,514,260,546,263,546,268,513,265,396,256,304,253,213,257,97,272,50,283"/>
-<area shape="rect" id="Node000008" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1" title="The probability density function." alt="" coords="97,144,281,200"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="37,273,62,245,95,216,111,206,114,210,98,221,66,249,41,277"/>
-<area shape="rect" id="Node000009" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69" title="This function computes the probability to have success in a given range of tries." alt="" coords="97,64,281,120"/>
-<area shape="poly" id="edge9_Node000001_Node000009" title=" " alt="" coords="28,274,48,207,67,166,95,130,97,128,101,131,99,134,72,169,53,209,33,275"/>
-<area shape="rect" id="Node000011" href="$de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6" title="Tests the sampling method of the geometric distribution." alt="" coords="143,395,235,421"/>
-<area shape="poly" id="edge12_Node000001_Node000011" title=" " alt="" coords="39,299,64,330,98,363,138,386,135,391,95,367,60,334,35,302"/>
-<area shape="rect" id="Node000015" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960" title="The variance of a geometrically distributed random variable X." alt="" coords="329,536,513,592"/>
-<area shape="poly" id="edge24_Node000001_Node000015" title=" " alt="" coords="34,300,54,362,73,399,98,431,134,455,188,481,315,528,314,533,186,486,132,460,95,435,68,402,49,364,29,302"/>
-<area shape="rect" id="Node000016" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2" title="The standard deviation of a geometrically distributed random variable X." alt="" coords="97,536,281,592"/>
-<area shape="poly" id="edge21_Node000001_Node000016" title=" " alt="" coords="32,301,38,337,50,388,69,444,99,497,126,525,122,528,95,500,65,447,45,390,33,338,27,301"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="631,79,703,105"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="514,53,617,77,616,83,513,58"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/log.html#" title=" " alt="" coords="821,274,885,299"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="773,284,805,284,805,289,773,289"/>
-<area shape="poly" id="edge8_Node000008_Node000003" title=" " alt="" coords="281,157,513,121,616,100,617,106,514,126,282,162"/>
-<area shape="poly" id="edge10_Node000009_Node000002" title=" " alt="" coords="281,66,313,58,314,63,282,71"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/numeric_limits/max.html#" title=" " alt="" coords="339,86,503,111"/>
-<area shape="poly" id="edge11_Node000009_Node000010" title=" " alt="" coords="282,92,323,93,323,98,282,97"/>
-<area shape="poly" id="edge17_Node000011_Node000004" title=" " alt="" coords="204,392,257,353,328,311,370,296,372,301,330,316,260,357,207,397"/>
-<area shape="poly" id="edge18_Node000011_Node000005" title=" " alt="" coords="235,394,313,376,314,381,236,400"/>
-<area shape="rect" id="Node000012" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3" title="Generates a (discrete) sample according to the geometrical distribution." alt="" coords="329,405,513,461"/>
-<area shape="poly" id="edge13_Node000011_Node000012" title=" " alt="" coords="236,410,314,419,313,424,235,415"/>
-<area shape="rect" id="Node000014" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="358,486,484,511"/>
-<area shape="poly" id="edge19_Node000011_Node000014" title=" " alt="" coords="216,419,268,444,330,471,352,478,351,483,328,476,266,449,214,424"/>
-<area shape="poly" id="edge20_Node000011_Node000015" title=" " alt="" coords="220,419,252,436,283,459,298,476,307,492,316,507,331,522,335,525,332,529,327,526,311,510,302,494,294,479,279,463,249,441,218,423"/>
-<area shape="poly" id="edge16_Node000012_Node000006" title=" " alt="" coords="489,403,512,391,567,357,616,322,619,326,570,361,515,395,492,407"/>
-<area shape="rect" id="Node000013" href="$de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba" title="Returns a random number between [0,1]." alt="" coords="588,413,746,454"/>
-<area shape="poly" id="edge14_Node000012_Node000013" title=" " alt="" coords="514,430,573,430,573,436,514,436"/>
-<area shape="poly" id="edge15_Node000013_Node000013" title=" " alt="" coords="631,413,630,403,636,394,648,388,667,386,687,389,699,395,697,400,686,394,667,391,650,393,639,398,635,404,637,412"/>
-<area shape="poly" id="edge23_Node000016_Node000015" title=" " alt="" coords="282,561,313,561,313,566,282,566"/>
-<area shape="rect" id="Node000017" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="386,616,456,642"/>
-<area shape="poly" id="edge22_Node000016_Node000017" title=" " alt="" coords="282,588,330,601,373,613,371,618,328,606,281,593"/>
-</map>
diff --git a/de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 13d9006e8..000000000
--- a/de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1879cf1ea23b951388db2ed8c58394fd
\ No newline at end of file
diff --git a/de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 55faf4b44..000000000
--- a/de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,481 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<!--zoomable 486 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 668;
-var viewHeight = 486;
-var sectionId = 'dynsection-4';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-275.25 0,-275.25 0,-256 32.5,-256 32.5,-275.25"/>
-<text text-anchor="middle" x="16.25" y="-261.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a" target="_top" xlink:title="The cumulative distribution function.">
-<polygon fill="white" stroke="#666666" points="381,-477.5 242.75,-477.5 242.75,-435.75 381,-435.75 381,-477.5"/>
-<text text-anchor="start" x="250.75" y="-464" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="250.75" y="-452.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="311.88" y="-441.5" font-family="Helvetica,sans-Serif" font-size="10.00">::cumulative_distribution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M18.63,-275.66C23.57,-309.88 41.49,-421.08 68.5,-442.62 113.47,-478.5 179.38,-480.1 231.13,-473.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.33,-477.28 240.77,-472.47 230.39,-470.34 231.33,-477.28"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="338.62,-275.25 285.12,-275.25 285.12,-256 338.62,-256 338.62,-275.25"/>
-<text text-anchor="middle" x="311.88" y="-261.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.62,-265.62C77.39,-265.62 208.59,-265.62 273.55,-265.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.36,-269.13 283.36,-265.63 273.36,-262.13 273.36,-269.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413" target="_top" xlink:title="The expected value of a geometrically distributed random variable X.">
-<polygon fill="white" stroke="#666666" points="381,-237.5 242.75,-237.5 242.75,-195.75 381,-195.75 381,-237.5"/>
-<text text-anchor="start" x="250.75" y="-224" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="250.75" y="-212.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="311.88" y="-201.5" font-family="Helvetica,sans-Serif" font-size="10.00">::expected_value</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.62,-263.06C69.01,-256.99 162.48,-241.39 231.09,-229.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.52,-233.42 240.81,-228.32 230.37,-226.51 231.52,-233.42"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf" target="_top" xlink:title="The inverse cumulative distribution function.">
-<polygon fill="white" stroke="#666666" points="575.5,-287.5 417,-287.5 417,-245.75 575.5,-245.75 575.5,-287.5"/>
-<text text-anchor="start" x="425" y="-274" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="425" y="-262.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="496.25" y="-251.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inverse_cumulative_distribution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.75,-270.89C42.81,-274.06 56.27,-277.81 68.5,-279.62 205.89,-300.06 242.52,-295.47 381,-284.62 388.98,-284 397.25,-283.13 405.52,-282.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="405.81,-285.61 415.27,-280.84 404.9,-278.67 405.81,-285.61"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1" target="_top" xlink:title="The probability density function.">
-<polygon fill="white" stroke="#666666" points="206.75,-373.5 68.5,-373.5 68.5,-331.75 206.75,-331.75 206.75,-373.5"/>
-<text text-anchor="start" x="76.5" y="-360" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="76.5" y="-348.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="137.62" y="-337.5" font-family="Helvetica,sans-Serif" font-size="10.00">::probability_density</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.17,-275.36C34.63,-286.56 51.34,-305.02 68.5,-317.62 72.3,-320.41 76.35,-323.1 80.51,-325.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.65,-328.63 89.05,-330.64 82.17,-322.58 78.65,-328.63"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69" target="_top" xlink:title="This function computes the probability to have success in a given range of tries.">
-<polygon fill="white" stroke="#666666" points="206.75,-433.5 68.5,-433.5 68.5,-391.75 206.75,-391.75 206.75,-433.5"/>
-<text text-anchor="start" x="76.5" y="-420" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="76.5" y="-408.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="137.62" y="-397.5" font-family="Helvetica,sans-Serif" font-size="10.00">::range_tries</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M19.04,-275.47C23.51,-297.48 37.17,-351.23 68.5,-382.62 69.1,-383.23 69.71,-383.81 70.34,-384.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.91,-386.93 77.93,-390.37 72.24,-381.44 67.91,-386.93"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6" target="_top" xlink:title="Tests the sampling method of the geometric distribution.">
-<polygon fill="white" stroke="#666666" points="172.25,-185.25 103,-185.25 103,-166 172.25,-166 172.25,-185.25"/>
-<text text-anchor="middle" x="137.62" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">sample_test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge12_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge12_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.9,-255.9C32.84,-243.4 49.79,-221.65 68.5,-207.62 77.5,-200.88 88.15,-195.05 98.33,-190.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.56,-193.57 107.29,-186.32 96.72,-187.17 99.56,-193.57"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960" target="_top" xlink:title="The variance of a geometrically distributed random variable X.">
-<polygon fill="white" stroke="#666666" points="381,-79.5 242.75,-79.5 242.75,-37.75 381,-37.75 381,-79.5"/>
-<text text-anchor="start" x="250.75" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="250.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="311.88" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node15 -->
-<g id="edge24_Node000001_Node000015" class="edge">
-<title>Node1&#45;&gt;Node15</title>
-<g id="a_edge24_Node000001_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M19.32,-255.76C24.21,-234.72 38.43,-185.08 68.5,-156.62 93.03,-133.41 170.95,-104.07 231.89,-83.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.85,-86.94 241.23,-80.46 230.64,-80.3 232.85,-86.94"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2" target="_top" xlink:title="The standard deviation of a geometrically distributed random variable X.">
-<polygon fill="white" stroke="#666666" points="206.75,-79.5 68.5,-79.5 68.5,-37.75 206.75,-37.75 206.75,-79.5"/>
-<text text-anchor="start" x="76.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="76.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="137.62" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">::standard_deviation</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge21_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge21_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M18.3,-255.77C21.52,-229.39 33.31,-155.84 68.5,-107.62 74.18,-99.84 81.47,-92.81 89.16,-86.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.16,-89.54 97.09,-80.76 86.97,-83.93 91.16,-89.54"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="523,-422.25 469.5,-422.25 469.5,-403 523,-403 523,-422.25"/>
-<text text-anchor="middle" x="496.25" y="-408.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.3,-440.12C407.47,-433.8 436.31,-426.85 458.42,-421.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="458.95,-424.98 467.85,-419.23 457.31,-418.18 458.95,-424.98"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/log.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="659.75,-276.25 611.5,-276.25 611.5,-257 659.75,-257 659.75,-276.25"/>
-<text text-anchor="middle" x="635.62" y="-262.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::log</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M575.97,-266.62C584.29,-266.62 592.4,-266.62 599.82,-266.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="599.67,-270.13 609.67,-266.63 599.67,-263.13 599.67,-270.13"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node3 -->
-<g id="edge8_Node000008_Node000003" class="edge">
-<title>Node8&#45;&gt;Node3</title>
-<g id="a_edge8_Node000008_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.23,-361.7C255.86,-368.41 322.59,-378.16 381,-388.62 406.82,-393.25 435.74,-399.33 458.02,-404.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.02,-407.58 467.54,-406.32 458.53,-400.75 457.02,-407.58"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node2 -->
-<g id="edge10_Node000009_Node000002" class="edge">
-<title>Node9&#45;&gt;Node2</title>
-<g id="a_edge10_Node000009_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.2,-430.14C215.13,-432.17 223.27,-434.25 231.34,-436.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.24,-439.64 240.79,-438.72 231.97,-432.86 230.24,-439.64"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373.5,-417.25 250.25,-417.25 250.25,-398 373.5,-398 373.5,-417.25"/>
-<text text-anchor="middle" x="311.88" y="-403.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits::max</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge11_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge11_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.2,-410.63C217.42,-410.34 227.99,-410.03 238.3,-409.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.38,-413.23 248.27,-409.44 238.17,-406.23 238.38,-413.23"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node4 -->
-<g id="edge17_Node000011_Node000004" class="edge">
-<title>Node11&#45;&gt;Node4</title>
-<g id="a_edge17_Node000011_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.34,-185.53C168.84,-200.72 206.44,-229.74 242.75,-246.62 252.56,-251.19 263.69,-254.86 274.07,-257.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.91,-261.03 283.47,-260.12 274.65,-254.25 272.91,-261.03"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge18_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge18_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.66,-183.73C189.53,-187.74 210.67,-192.77 231.31,-197.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.35,-201.06 240.89,-199.97 231.97,-194.25 230.35,-201.06"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3" target="_top" xlink:title="Generates a (discrete) sample according to the geometrical distribution.">
-<polygon fill="white" stroke="#666666" points="381,-177.5 242.75,-177.5 242.75,-135.75 381,-135.75 381,-177.5"/>
-<text text-anchor="start" x="250.75" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="250.75" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="311.88" y="-141.5" font-family="Helvetica,sans-Serif" font-size="10.00">::draw_sample</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge13_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge13_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.66,-171.87C189.45,-170.02 210.48,-167.7 231.02,-165.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.3,-168.92 240.85,-164.35 230.53,-161.97 231.3,-168.92"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="359.25,-117.25 264.5,-117.25 264.5,-98 359.25,-98 359.25,-117.25"/>
-<text text-anchor="middle" x="311.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node14 -->
-<g id="edge19_Node000011_Node000014" class="edge">
-<title>Node11&#45;&gt;Node14</title>
-<g id="a_edge19_Node000011_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M157.4,-165.61C177.94,-154.94 212.04,-138.04 242.75,-126.62 248.15,-124.62 253.86,-122.71 259.58,-120.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.49,-124.31 269.08,-118.1 258.5,-117.6 260.49,-124.31"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node15 -->
-<g id="edge20_Node000011_Node000015" class="edge">
-<title>Node11&#45;&gt;Node15</title>
-<g id="a_edge20_Node000011_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.29,-165.64C174.42,-158.5 192.78,-147.98 206.75,-135.62 226.46,-118.2 222.06,-104.88 242.75,-88.62 243.89,-87.73 245.07,-86.85 246.27,-85.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.09,-88.99 254.63,-80.65 244.31,-83.09 248.09,-88.99"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node6 -->
-<g id="edge16_Node000012_Node000006" class="edge">
-<title>Node12&#45;&gt;Node6</title>
-<g id="a_edge16_Node000012_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M364.01,-177.83C369.82,-180.62 375.59,-183.58 381,-186.62 408.32,-202.01 437.24,-222.3 459.14,-238.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="456.77,-241.19 466.87,-244.4 460.98,-235.6 456.77,-241.19"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba" target="_top" xlink:title="Returns a random number between [0,1].">
-<polygon fill="white" stroke="#666666" points="555.25,-171.88 437.25,-171.88 437.25,-141.38 555.25,-141.38 555.25,-171.88"/>
-<text text-anchor="start" x="445.25" y="-158.38" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="middle" x="496.25" y="-147.12" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::generate_uniform</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge14_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge14_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.3,-156.62C395.74,-156.62 410.99,-156.62 425.47,-156.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="425.38,-160.13 435.38,-156.63 425.38,-153.13 425.38,-160.13"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node13 -->
-<g id="edge15_Node000013_Node000013" class="edge">
-<title>Node13&#45;&gt;Node13</title>
-<g id="a_edge15_Node000013_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M471.55,-172.36C466.51,-181.43 474.74,-189.88 496.25,-189.88 508.01,-189.88 515.8,-187.35 519.62,-183.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="523.07,-184.21 520.77,-173.86 516.12,-183.38 523.07,-184.21"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node15 -->
-<g id="edge23_Node000016_Node000015" class="edge">
-<title>Node16&#45;&gt;Node15</title>
-<g id="a_edge23_Node000016_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.2,-58.62C214.95,-58.62 222.9,-58.62 230.79,-58.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.74,-62.13 240.74,-58.63 230.74,-55.13 230.74,-62.13"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="337.88,-19.25 285.88,-19.25 285.88,0 337.88,0 337.88,-19.25"/>
-<text text-anchor="middle" x="311.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge22_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge22_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.21,-38.77C219.06,-35.37 231.26,-31.88 242.75,-28.62 253.16,-25.67 264.48,-22.5 274.84,-19.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="275.47,-23.07 284.17,-17.02 273.6,-16.33 275.47,-23.07"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index b9fefe4f6..000000000
--- a/de/d72/geometric__dist_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,398 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="668pt" height="486pt"
- viewBox="0.00 0.00 667.75 485.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 481.5)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-275.25 0,-275.25 0,-256 32.5,-256 32.5,-275.25"/>
-<text text-anchor="middle" x="16.25" y="-261.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a" target="_top" xlink:title="The cumulative distribution function.">
-<polygon fill="white" stroke="#666666" points="381,-477.5 242.75,-477.5 242.75,-435.75 381,-435.75 381,-477.5"/>
-<text text-anchor="start" x="250.75" y="-464" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="250.75" y="-452.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="311.88" y="-441.5" font-family="Helvetica,sans-Serif" font-size="10.00">::cumulative_distribution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M18.63,-275.66C23.57,-309.88 41.49,-421.08 68.5,-442.62 113.47,-478.5 179.38,-480.1 231.13,-473.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.33,-477.28 240.77,-472.47 230.39,-470.34 231.33,-477.28"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="338.62,-275.25 285.12,-275.25 285.12,-256 338.62,-256 338.62,-275.25"/>
-<text text-anchor="middle" x="311.88" y="-261.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.62,-265.62C77.39,-265.62 208.59,-265.62 273.55,-265.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.36,-269.13 283.36,-265.63 273.36,-262.13 273.36,-269.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413" target="_top" xlink:title="The expected value of a geometrically distributed random variable X.">
-<polygon fill="white" stroke="#666666" points="381,-237.5 242.75,-237.5 242.75,-195.75 381,-195.75 381,-237.5"/>
-<text text-anchor="start" x="250.75" y="-224" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="250.75" y="-212.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="311.88" y="-201.5" font-family="Helvetica,sans-Serif" font-size="10.00">::expected_value</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.62,-263.06C69.01,-256.99 162.48,-241.39 231.09,-229.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.52,-233.42 240.81,-228.32 230.37,-226.51 231.52,-233.42"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf" target="_top" xlink:title="The inverse cumulative distribution function.">
-<polygon fill="white" stroke="#666666" points="575.5,-287.5 417,-287.5 417,-245.75 575.5,-245.75 575.5,-287.5"/>
-<text text-anchor="start" x="425" y="-274" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="425" y="-262.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="496.25" y="-251.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inverse_cumulative_distribution</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.75,-270.89C42.81,-274.06 56.27,-277.81 68.5,-279.62 205.89,-300.06 242.52,-295.47 381,-284.62 388.98,-284 397.25,-283.13 405.52,-282.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="405.81,-285.61 415.27,-280.84 404.9,-278.67 405.81,-285.61"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1" target="_top" xlink:title="The probability density function.">
-<polygon fill="white" stroke="#666666" points="206.75,-373.5 68.5,-373.5 68.5,-331.75 206.75,-331.75 206.75,-373.5"/>
-<text text-anchor="start" x="76.5" y="-360" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="76.5" y="-348.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="137.62" y="-337.5" font-family="Helvetica,sans-Serif" font-size="10.00">::probability_density</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.17,-275.36C34.63,-286.56 51.34,-305.02 68.5,-317.62 72.3,-320.41 76.35,-323.1 80.51,-325.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.65,-328.63 89.05,-330.64 82.17,-322.58 78.65,-328.63"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69" target="_top" xlink:title="This function computes the probability to have success in a given range of tries.">
-<polygon fill="white" stroke="#666666" points="206.75,-433.5 68.5,-433.5 68.5,-391.75 206.75,-391.75 206.75,-433.5"/>
-<text text-anchor="start" x="76.5" y="-420" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="76.5" y="-408.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="137.62" y="-397.5" font-family="Helvetica,sans-Serif" font-size="10.00">::range_tries</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M19.04,-275.47C23.51,-297.48 37.17,-351.23 68.5,-382.62 69.1,-383.23 69.71,-383.81 70.34,-384.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.91,-386.93 77.93,-390.37 72.24,-381.44 67.91,-386.93"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6" target="_top" xlink:title="Tests the sampling method of the geometric distribution.">
-<polygon fill="white" stroke="#666666" points="172.25,-185.25 103,-185.25 103,-166 172.25,-166 172.25,-185.25"/>
-<text text-anchor="middle" x="137.62" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">sample_test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge12_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge12_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M23.9,-255.9C32.84,-243.4 49.79,-221.65 68.5,-207.62 77.5,-200.88 88.15,-195.05 98.33,-190.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.56,-193.57 107.29,-186.32 96.72,-187.17 99.56,-193.57"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960" target="_top" xlink:title="The variance of a geometrically distributed random variable X.">
-<polygon fill="white" stroke="#666666" points="381,-79.5 242.75,-79.5 242.75,-37.75 381,-37.75 381,-79.5"/>
-<text text-anchor="start" x="250.75" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="250.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="311.88" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node15 -->
-<g id="edge24_Node000001_Node000015" class="edge">
-<title>Node1&#45;&gt;Node15</title>
-<g id="a_edge24_Node000001_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M19.32,-255.76C24.21,-234.72 38.43,-185.08 68.5,-156.62 93.03,-133.41 170.95,-104.07 231.89,-83.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="232.85,-86.94 241.23,-80.46 230.64,-80.3 232.85,-86.94"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2" target="_top" xlink:title="The standard deviation of a geometrically distributed random variable X.">
-<polygon fill="white" stroke="#666666" points="206.75,-79.5 68.5,-79.5 68.5,-37.75 206.75,-37.75 206.75,-79.5"/>
-<text text-anchor="start" x="76.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="76.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="137.62" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">::standard_deviation</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node16 -->
-<g id="edge21_Node000001_Node000016" class="edge">
-<title>Node1&#45;&gt;Node16</title>
-<g id="a_edge21_Node000001_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M18.3,-255.77C21.52,-229.39 33.31,-155.84 68.5,-107.62 74.18,-99.84 81.47,-92.81 89.16,-86.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.16,-89.54 97.09,-80.76 86.97,-83.93 91.16,-89.54"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="523,-422.25 469.5,-422.25 469.5,-403 523,-403 523,-422.25"/>
-<text text-anchor="middle" x="496.25" y="-408.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.3,-440.12C407.47,-433.8 436.31,-426.85 458.42,-421.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="458.95,-424.98 467.85,-419.23 457.31,-418.18 458.95,-424.98"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/log.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="659.75,-276.25 611.5,-276.25 611.5,-257 659.75,-257 659.75,-276.25"/>
-<text text-anchor="middle" x="635.62" y="-262.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::log</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M575.97,-266.62C584.29,-266.62 592.4,-266.62 599.82,-266.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="599.67,-270.13 609.67,-266.63 599.67,-263.13 599.67,-270.13"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node3 -->
-<g id="edge8_Node000008_Node000003" class="edge">
-<title>Node8&#45;&gt;Node3</title>
-<g id="a_edge8_Node000008_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.23,-361.7C255.86,-368.41 322.59,-378.16 381,-388.62 406.82,-393.25 435.74,-399.33 458.02,-404.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="457.02,-407.58 467.54,-406.32 458.53,-400.75 457.02,-407.58"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node2 -->
-<g id="edge10_Node000009_Node000002" class="edge">
-<title>Node9&#45;&gt;Node2</title>
-<g id="a_edge10_Node000009_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.2,-430.14C215.13,-432.17 223.27,-434.25 231.34,-436.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.24,-439.64 240.79,-438.72 231.97,-432.86 230.24,-439.64"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="373.5,-417.25 250.25,-417.25 250.25,-398 373.5,-398 373.5,-417.25"/>
-<text text-anchor="middle" x="311.88" y="-403.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits::max</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge11_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge11_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.2,-410.63C217.42,-410.34 227.99,-410.03 238.3,-409.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.38,-413.23 248.27,-409.44 238.17,-406.23 238.38,-413.23"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node4 -->
-<g id="edge17_Node000011_Node000004" class="edge">
-<title>Node11&#45;&gt;Node4</title>
-<g id="a_edge17_Node000011_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.34,-185.53C168.84,-200.72 206.44,-229.74 242.75,-246.62 252.56,-251.19 263.69,-254.86 274.07,-257.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="272.91,-261.03 283.47,-260.12 274.65,-254.25 272.91,-261.03"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node5 -->
-<g id="edge18_Node000011_Node000005" class="edge">
-<title>Node11&#45;&gt;Node5</title>
-<g id="a_edge18_Node000011_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.66,-183.73C189.53,-187.74 210.67,-192.77 231.31,-197.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.35,-201.06 240.89,-199.97 231.97,-194.25 230.35,-201.06"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3" target="_top" xlink:title="Generates a (discrete) sample according to the geometrical distribution.">
-<polygon fill="white" stroke="#666666" points="381,-177.5 242.75,-177.5 242.75,-135.75 381,-135.75 381,-177.5"/>
-<text text-anchor="start" x="250.75" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="250.75" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="311.88" y="-141.5" font-family="Helvetica,sans-Serif" font-size="10.00">::draw_sample</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge13_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge13_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.66,-171.87C189.45,-170.02 210.48,-167.7 231.02,-165.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.3,-168.92 240.85,-164.35 230.53,-161.97 231.3,-168.92"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="359.25,-117.25 264.5,-117.25 264.5,-98 359.25,-98 359.25,-117.25"/>
-<text text-anchor="middle" x="311.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node14 -->
-<g id="edge19_Node000011_Node000014" class="edge">
-<title>Node11&#45;&gt;Node14</title>
-<g id="a_edge19_Node000011_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M157.4,-165.61C177.94,-154.94 212.04,-138.04 242.75,-126.62 248.15,-124.62 253.86,-122.71 259.58,-120.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.49,-124.31 269.08,-118.1 258.5,-117.6 260.49,-124.31"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node15 -->
-<g id="edge20_Node000011_Node000015" class="edge">
-<title>Node11&#45;&gt;Node15</title>
-<g id="a_edge20_Node000011_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.29,-165.64C174.42,-158.5 192.78,-147.98 206.75,-135.62 226.46,-118.2 222.06,-104.88 242.75,-88.62 243.89,-87.73 245.07,-86.85 246.27,-85.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.09,-88.99 254.63,-80.65 244.31,-83.09 248.09,-88.99"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node6 -->
-<g id="edge16_Node000012_Node000006" class="edge">
-<title>Node12&#45;&gt;Node6</title>
-<g id="a_edge16_Node000012_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M364.01,-177.83C369.82,-180.62 375.59,-183.58 381,-186.62 408.32,-202.01 437.24,-222.3 459.14,-238.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="456.77,-241.19 466.87,-244.4 460.98,-235.6 456.77,-241.19"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba" target="_top" xlink:title="Returns a random number between [0,1].">
-<polygon fill="white" stroke="#666666" points="555.25,-171.88 437.25,-171.88 437.25,-141.38 555.25,-141.38 555.25,-171.88"/>
-<text text-anchor="start" x="445.25" y="-158.38" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="middle" x="496.25" y="-147.12" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::generate_uniform</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge14_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge14_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M381.3,-156.62C395.74,-156.62 410.99,-156.62 425.47,-156.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="425.38,-160.13 435.38,-156.63 425.38,-153.13 425.38,-160.13"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node13 -->
-<g id="edge15_Node000013_Node000013" class="edge">
-<title>Node13&#45;&gt;Node13</title>
-<g id="a_edge15_Node000013_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M471.55,-172.36C466.51,-181.43 474.74,-189.88 496.25,-189.88 508.01,-189.88 515.8,-187.35 519.62,-183.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="523.07,-184.21 520.77,-173.86 516.12,-183.38 523.07,-184.21"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node15 -->
-<g id="edge23_Node000016_Node000015" class="edge">
-<title>Node16&#45;&gt;Node15</title>
-<g id="a_edge23_Node000016_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.2,-58.62C214.95,-58.62 222.9,-58.62 230.79,-58.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="230.74,-62.13 240.74,-58.63 230.74,-55.13 230.74,-62.13"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="337.88,-19.25 285.88,-19.25 285.88,0 337.88,0 337.88,-19.25"/>
-<text text-anchor="middle" x="311.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge22_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge22_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.21,-38.77C219.06,-35.37 231.26,-31.88 242.75,-28.62 253.16,-25.67 264.48,-22.5 274.84,-19.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="275.47,-23.07 284.17,-17.02 273.6,-16.33 275.47,-23.07"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index b3bcf26aa..000000000
--- a/de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,45 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,275,55,301"/>
-<area shape="rect" id="Node000002" href="$de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,275,146,301"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,285,87,285,87,290,55,290"/>
-<area shape="rect" id="Node000003" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a" title="The cumulative distribution function." alt="" coords="426,5,611,61"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="125,274,147,156,167,91,179,66,192,50,216,34,243,21,299,7,356,4,411,8,411,13,356,9,299,13,244,26,219,38,196,54,183,69,172,93,152,157,130,275"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="483,275,554,301"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="146,285,467,285,467,290,146,290"/>
-<area shape="rect" id="Node000006" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413" title="The expected value of a geometrically distributed random variable X." alt="" coords="426,325,611,381"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="147,289,411,333,410,338,146,294"/>
-<area shape="rect" id="Node000007" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf" title="The inverse cumulative distribution function." alt="" coords="659,259,870,314"/>
-<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="146,278,194,267,310,252,402,248,494,251,611,260,644,263,643,268,610,265,493,256,402,253,311,257,194,272,147,283"/>
-<area shape="rect" id="Node000009" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1" title="The probability density function." alt="" coords="194,144,378,200"/>
-<area shape="poly" id="edge8_Node000002_Node000009" title=" " alt="" coords="134,273,159,245,192,216,209,206,211,210,196,221,163,249,138,277"/>
-<area shape="rect" id="Node000010" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69" title="This function computes the probability to have success in a given range of tries." alt="" coords="194,64,378,120"/>
-<area shape="poly" id="edge10_Node000002_Node000010" title=" " alt="" coords="125,274,145,207,165,166,192,130,195,128,198,131,196,134,169,169,150,209,131,275"/>
-<area shape="rect" id="Node000012" href="$de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6" title="Tests the sampling method of the geometric distribution." alt="" coords="240,395,332,421"/>
-<area shape="poly" id="edge13_Node000002_Node000012" title=" " alt="" coords="137,299,161,330,196,363,235,386,232,391,192,367,157,334,132,302"/>
-<area shape="rect" id="Node000016" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960" title="The variance of a geometrically distributed random variable X." alt="" coords="426,536,611,592"/>
-<area shape="poly" id="edge25_Node000002_Node000016" title=" " alt="" coords="131,300,151,362,170,399,196,431,232,455,286,481,413,528,411,533,284,486,229,460,192,435,166,402,146,364,126,302"/>
-<area shape="rect" id="Node000017" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2" title="The standard deviation of a geometrically distributed random variable X." alt="" coords="194,536,378,592"/>
-<area shape="poly" id="edge22_Node000002_Node000017" title=" " alt="" coords="130,301,135,337,147,388,167,444,196,497,223,525,220,528,192,500,162,447,142,390,130,338,124,301"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="729,79,800,105"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="612,53,715,77,713,83,610,58"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/log.html#" title=" " alt="" coords="918,274,982,299"/>
-<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="871,284,902,284,902,289,871,289"/>
-<area shape="poly" id="edge9_Node000009_Node000004" title=" " alt="" coords="379,157,610,121,713,100,714,106,611,126,379,162"/>
-<area shape="poly" id="edge11_Node000010_Node000003" title=" " alt="" coords="378,66,410,58,412,63,380,71"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/numeric_limits/max.html#" title=" " alt="" coords="436,86,601,111"/>
-<area shape="poly" id="edge12_Node000010_Node000011" title=" " alt="" coords="379,92,420,93,420,98,379,97"/>
-<area shape="poly" id="edge18_Node000012_Node000005" title=" " alt="" coords="302,392,354,353,425,311,467,296,469,301,427,316,357,357,305,397"/>
-<area shape="poly" id="edge19_Node000012_Node000006" title=" " alt="" coords="332,394,410,376,412,381,333,400"/>
-<area shape="rect" id="Node000013" href="$da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3" title="Generates a (discrete) sample according to the geometrical distribution." alt="" coords="426,405,611,461"/>
-<area shape="poly" id="edge14_Node000012_Node000013" title=" " alt="" coords="333,410,411,419,410,424,333,415"/>
-<area shape="rect" id="Node000015" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="455,486,582,511"/>
-<area shape="poly" id="edge20_Node000012_Node000015" title=" " alt="" coords="314,419,365,444,427,471,450,478,448,483,425,476,363,449,311,424"/>
-<area shape="poly" id="edge21_Node000012_Node000016" title=" " alt="" coords="318,419,349,436,380,459,395,476,404,492,413,507,428,522,433,525,429,529,425,526,409,510,400,494,391,479,377,463,346,441,315,423"/>
-<area shape="poly" id="edge17_Node000013_Node000007" title=" " alt="" coords="587,403,609,391,664,357,713,322,716,326,667,361,612,395,589,407"/>
-<area shape="rect" id="Node000014" href="$de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba" title="Returns a random number between [0,1]." alt="" coords="686,413,843,454"/>
-<area shape="poly" id="edge15_Node000013_Node000014" title=" " alt="" coords="611,430,670,430,670,436,611,436"/>
-<area shape="poly" id="edge16_Node000014_Node000014" title=" " alt="" coords="729,413,727,403,733,394,745,388,764,386,785,389,797,395,794,400,783,394,764,391,747,393,736,398,732,404,734,412"/>
-<area shape="poly" id="edge24_Node000017_Node000016" title=" " alt="" coords="379,561,410,561,410,566,379,566"/>
-<area shape="rect" id="Node000018" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="484,616,553,642"/>
-<area shape="poly" id="edge23_Node000017_Node000018" title=" " alt="" coords="380,588,427,601,470,613,468,618,426,606,378,593"/>
-</map>
diff --git a/de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index ea0c3b835..000000000
--- a/de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5fd969b13d5263bc5523854e02ed22ce
\ No newline at end of file
diff --git a/de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index e7cd15269..000000000
--- a/de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,499 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 486 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 741;
-var viewHeight = 486;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-275.25 0,-275.25 0,-256 37,-256 37,-275.25"/>
-<text text-anchor="middle" x="18.5" y="-261.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-275.25 73,-275.25 73,-256 105.5,-256 105.5,-275.25"/>
-<text text-anchor="middle" x="89.25" y="-261.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-265.62C44.58,-265.62 53.31,-265.62 61.45,-265.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-269.13 71.2,-265.63 61.2,-262.13 61.2,-269.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a" target="_top" xlink:title="The cumulative distribution function.">
-<polygon fill="white" stroke="#666666" points="454,-477.5 315.75,-477.5 315.75,-435.75 454,-435.75 454,-477.5"/>
-<text text-anchor="start" x="323.75" y="-464" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="323.75" y="-452.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="384.88" y="-441.5" font-family="Helvetica,sans-Serif" font-size="10.00">::cumulative_distribution</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.63,-275.66C96.57,-309.88 114.49,-421.08 141.5,-442.62 186.47,-478.5 252.38,-480.1 304.13,-473.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.33,-477.28 313.77,-472.47 303.39,-470.34 304.33,-477.28"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="411.62,-275.25 358.12,-275.25 358.12,-256 411.62,-256 411.62,-275.25"/>
-<text text-anchor="middle" x="384.88" y="-261.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.62,-265.62C150.39,-265.62 281.59,-265.62 346.55,-265.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="346.36,-269.13 356.36,-265.63 346.36,-262.13 346.36,-269.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413" target="_top" xlink:title="The expected value of a geometrically distributed random variable X.">
-<polygon fill="white" stroke="#666666" points="454,-237.5 315.75,-237.5 315.75,-195.75 454,-195.75 454,-237.5"/>
-<text text-anchor="start" x="323.75" y="-224" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="323.75" y="-212.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="384.88" y="-201.5" font-family="Helvetica,sans-Serif" font-size="10.00">::expected_value</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.62,-263.06C142.01,-256.99 235.48,-241.39 304.09,-229.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.52,-233.42 313.81,-228.32 303.37,-226.51 304.52,-233.42"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf" target="_top" xlink:title="The inverse cumulative distribution function.">
-<polygon fill="white" stroke="#666666" points="648.5,-287.5 490,-287.5 490,-245.75 648.5,-245.75 648.5,-287.5"/>
-<text text-anchor="start" x="498" y="-274" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="498" y="-262.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="569.25" y="-251.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inverse_cumulative_distribution</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.75,-270.89C115.81,-274.06 129.27,-277.81 141.5,-279.62 278.89,-300.06 315.52,-295.47 454,-284.62 461.98,-284 470.25,-283.13 478.52,-282.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="478.81,-285.61 488.27,-280.84 477.9,-278.67 478.81,-285.61"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1" target="_top" xlink:title="The probability density function.">
-<polygon fill="white" stroke="#666666" points="279.75,-373.5 141.5,-373.5 141.5,-331.75 279.75,-331.75 279.75,-373.5"/>
-<text text-anchor="start" x="149.5" y="-360" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="149.5" y="-348.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="210.62" y="-337.5" font-family="Helvetica,sans-Serif" font-size="10.00">::probability_density</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.17,-275.36C107.63,-286.56 124.34,-305.02 141.5,-317.62 145.3,-320.41 149.35,-323.1 153.51,-325.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.65,-328.63 162.05,-330.64 155.17,-322.58 151.65,-328.63"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69" target="_top" xlink:title="This function computes the probability to have success in a given range of tries.">
-<polygon fill="white" stroke="#666666" points="279.75,-433.5 141.5,-433.5 141.5,-391.75 279.75,-391.75 279.75,-433.5"/>
-<text text-anchor="start" x="149.5" y="-420" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="149.5" y="-408.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="210.62" y="-397.5" font-family="Helvetica,sans-Serif" font-size="10.00">::range_tries</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge10_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge10_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.04,-275.47C96.51,-297.48 110.17,-351.23 141.5,-382.62 142.1,-383.23 142.71,-383.81 143.34,-384.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.91,-386.93 150.93,-390.37 145.24,-381.44 140.91,-386.93"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6" target="_top" xlink:title="Tests the sampling method of the geometric distribution.">
-<polygon fill="white" stroke="#666666" points="245.25,-185.25 176,-185.25 176,-166 245.25,-166 245.25,-185.25"/>
-<text text-anchor="middle" x="210.62" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">sample_test</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge13_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge13_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.9,-255.9C105.84,-243.4 122.79,-221.65 141.5,-207.62 150.5,-200.88 161.15,-195.05 171.33,-190.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.56,-193.57 180.29,-186.32 169.72,-187.17 172.56,-193.57"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960" target="_top" xlink:title="The variance of a geometrically distributed random variable X.">
-<polygon fill="white" stroke="#666666" points="454,-79.5 315.75,-79.5 315.75,-37.75 454,-37.75 454,-79.5"/>
-<text text-anchor="start" x="323.75" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="323.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="384.88" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node16 -->
-<g id="edge25_Node000002_Node000016" class="edge">
-<title>Node2&#45;&gt;Node16</title>
-<g id="a_edge25_Node000002_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.32,-255.76C97.21,-234.72 111.43,-185.08 141.5,-156.62 166.03,-133.41 243.95,-104.07 304.89,-83.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.85,-86.94 314.23,-80.46 303.64,-80.3 305.85,-86.94"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2" target="_top" xlink:title="The standard deviation of a geometrically distributed random variable X.">
-<polygon fill="white" stroke="#666666" points="279.75,-79.5 141.5,-79.5 141.5,-37.75 279.75,-37.75 279.75,-79.5"/>
-<text text-anchor="start" x="149.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="149.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="210.62" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">::standard_deviation</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node17 -->
-<g id="edge22_Node000002_Node000017" class="edge">
-<title>Node2&#45;&gt;Node17</title>
-<g id="a_edge22_Node000002_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.3,-255.77C94.52,-229.39 106.31,-155.84 141.5,-107.62 147.18,-99.84 154.47,-92.81 162.16,-86.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.16,-89.54 170.09,-80.76 159.97,-83.93 164.16,-89.54"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="596,-422.25 542.5,-422.25 542.5,-403 596,-403 596,-422.25"/>
-<text text-anchor="middle" x="569.25" y="-408.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M454.3,-440.12C480.47,-433.8 509.31,-426.85 531.42,-421.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="531.95,-424.98 540.85,-419.23 530.31,-418.18 531.95,-424.98"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/log.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="732.75,-276.25 684.5,-276.25 684.5,-257 732.75,-257 732.75,-276.25"/>
-<text text-anchor="middle" x="708.62" y="-262.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::log</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M648.97,-266.62C657.29,-266.62 665.4,-266.62 672.82,-266.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="672.67,-270.13 682.67,-266.63 672.67,-263.13 672.67,-270.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node4 -->
-<g id="edge9_Node000009_Node000004" class="edge">
-<title>Node9&#45;&gt;Node4</title>
-<g id="a_edge9_Node000009_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.23,-361.7C328.86,-368.41 395.59,-378.16 454,-388.62 479.82,-393.25 508.74,-399.33 531.02,-404.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="530.02,-407.58 540.54,-406.32 531.53,-400.75 530.02,-407.58"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node3 -->
-<g id="edge11_Node000010_Node000003" class="edge">
-<title>Node10&#45;&gt;Node3</title>
-<g id="a_edge11_Node000010_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.2,-430.14C288.13,-432.17 296.27,-434.25 304.34,-436.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="303.24,-439.64 313.79,-438.72 304.97,-432.86 303.24,-439.64"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="446.5,-417.25 323.25,-417.25 323.25,-398 446.5,-398 446.5,-417.25"/>
-<text text-anchor="middle" x="384.88" y="-403.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits::max</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge12_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge12_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.2,-410.63C290.42,-410.34 300.99,-410.03 311.3,-409.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="311.38,-413.23 321.27,-409.44 311.17,-406.23 311.38,-413.23"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node5 -->
-<g id="edge18_Node000012_Node000005" class="edge">
-<title>Node12&#45;&gt;Node5</title>
-<g id="a_edge18_Node000012_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M223.34,-185.53C241.84,-200.72 279.44,-229.74 315.75,-246.62 325.56,-251.19 336.69,-254.86 347.07,-257.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.91,-261.03 356.47,-260.12 347.65,-254.25 345.91,-261.03"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node6 -->
-<g id="edge19_Node000012_Node000006" class="edge">
-<title>Node12&#45;&gt;Node6</title>
-<g id="a_edge19_Node000012_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.66,-183.73C262.53,-187.74 283.67,-192.77 304.31,-197.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="303.35,-201.06 313.89,-199.97 304.97,-194.25 303.35,-201.06"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3" target="_top" xlink:title="Generates a (discrete) sample according to the geometrical distribution.">
-<polygon fill="white" stroke="#666666" points="454,-177.5 315.75,-177.5 315.75,-135.75 454,-135.75 454,-177.5"/>
-<text text-anchor="start" x="323.75" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="323.75" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="384.88" y="-141.5" font-family="Helvetica,sans-Serif" font-size="10.00">::draw_sample</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge14_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge14_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.66,-171.87C262.45,-170.02 283.48,-167.7 304.02,-165.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.3,-168.92 313.85,-164.35 303.53,-161.97 304.3,-168.92"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="432.25,-117.25 337.5,-117.25 337.5,-98 432.25,-98 432.25,-117.25"/>
-<text text-anchor="middle" x="384.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node15 -->
-<g id="edge20_Node000012_Node000015" class="edge">
-<title>Node12&#45;&gt;Node15</title>
-<g id="a_edge20_Node000012_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M230.4,-165.61C250.94,-154.94 285.04,-138.04 315.75,-126.62 321.15,-124.62 326.86,-122.71 332.58,-120.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.49,-124.31 342.08,-118.1 331.5,-117.6 333.49,-124.31"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node16 -->
-<g id="edge21_Node000012_Node000016" class="edge">
-<title>Node12&#45;&gt;Node16</title>
-<g id="a_edge21_Node000012_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M233.29,-165.64C247.42,-158.5 265.78,-147.98 279.75,-135.62 299.46,-118.2 295.06,-104.88 315.75,-88.62 316.89,-87.73 318.07,-86.85 319.27,-85.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="321.09,-88.99 327.63,-80.65 317.31,-83.09 321.09,-88.99"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node7 -->
-<g id="edge17_Node000013_Node000007" class="edge">
-<title>Node13&#45;&gt;Node7</title>
-<g id="a_edge17_Node000013_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M437.01,-177.83C442.82,-180.62 448.59,-183.58 454,-186.62 481.32,-202.01 510.24,-222.3 532.14,-238.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="529.77,-241.19 539.87,-244.4 533.98,-235.6 529.77,-241.19"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba" target="_top" xlink:title="Returns a random number between [0,1].">
-<polygon fill="white" stroke="#666666" points="628.25,-171.88 510.25,-171.88 510.25,-141.38 628.25,-141.38 628.25,-171.88"/>
-<text text-anchor="start" x="518.25" y="-158.38" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="middle" x="569.25" y="-147.12" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::generate_uniform</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge15_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge15_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M454.3,-156.62C468.74,-156.62 483.99,-156.62 498.47,-156.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="498.38,-160.13 508.38,-156.63 498.38,-153.13 498.38,-160.13"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node14 -->
-<g id="edge16_Node000014_Node000014" class="edge">
-<title>Node14&#45;&gt;Node14</title>
-<g id="a_edge16_Node000014_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M544.55,-172.36C539.51,-181.43 547.74,-189.88 569.25,-189.88 581.01,-189.88 588.8,-187.35 592.62,-183.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="596.07,-184.21 593.77,-173.86 589.12,-183.38 596.07,-184.21"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node16 -->
-<g id="edge24_Node000017_Node000016" class="edge">
-<title>Node17&#45;&gt;Node16</title>
-<g id="a_edge24_Node000017_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.2,-58.62C287.95,-58.62 295.9,-58.62 303.79,-58.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="303.74,-62.13 313.74,-58.63 303.74,-55.13 303.74,-62.13"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="410.88,-19.25 358.88,-19.25 358.88,0 410.88,0 410.88,-19.25"/>
-<text text-anchor="middle" x="384.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge23_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge23_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.21,-38.77C292.06,-35.37 304.26,-31.88 315.75,-28.62 326.16,-25.67 337.48,-22.5 347.84,-19.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.47,-23.07 357.17,-17.02 346.6,-16.33 348.47,-23.07"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index c1072ead9..000000000
--- a/de/d72/geometric__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,416 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="741pt" height="486pt"
- viewBox="0.00 0.00 740.75 485.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 481.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-275.25 0,-275.25 0,-256 37,-256 37,-275.25"/>
-<text text-anchor="middle" x="18.5" y="-261.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-275.25 73,-275.25 73,-256 105.5,-256 105.5,-275.25"/>
-<text text-anchor="middle" x="89.25" y="-261.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-265.62C44.58,-265.62 53.31,-265.62 61.45,-265.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-269.13 71.2,-265.63 61.2,-262.13 61.2,-269.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a" target="_top" xlink:title="The cumulative distribution function.">
-<polygon fill="white" stroke="#666666" points="454,-477.5 315.75,-477.5 315.75,-435.75 454,-435.75 454,-477.5"/>
-<text text-anchor="start" x="323.75" y="-464" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="323.75" y="-452.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="384.88" y="-441.5" font-family="Helvetica,sans-Serif" font-size="10.00">::cumulative_distribution</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.63,-275.66C96.57,-309.88 114.49,-421.08 141.5,-442.62 186.47,-478.5 252.38,-480.1 304.13,-473.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.33,-477.28 313.77,-472.47 303.39,-470.34 304.33,-477.28"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="411.62,-275.25 358.12,-275.25 358.12,-256 411.62,-256 411.62,-275.25"/>
-<text text-anchor="middle" x="384.88" y="-261.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.62,-265.62C150.39,-265.62 281.59,-265.62 346.55,-265.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="346.36,-269.13 356.36,-265.63 346.36,-262.13 346.36,-269.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413" target="_top" xlink:title="The expected value of a geometrically distributed random variable X.">
-<polygon fill="white" stroke="#666666" points="454,-237.5 315.75,-237.5 315.75,-195.75 454,-195.75 454,-237.5"/>
-<text text-anchor="start" x="323.75" y="-224" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="323.75" y="-212.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="384.88" y="-201.5" font-family="Helvetica,sans-Serif" font-size="10.00">::expected_value</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.62,-263.06C142.01,-256.99 235.48,-241.39 304.09,-229.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.52,-233.42 313.81,-228.32 303.37,-226.51 304.52,-233.42"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf" target="_top" xlink:title="The inverse cumulative distribution function.">
-<polygon fill="white" stroke="#666666" points="648.5,-287.5 490,-287.5 490,-245.75 648.5,-245.75 648.5,-287.5"/>
-<text text-anchor="start" x="498" y="-274" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="498" y="-262.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="569.25" y="-251.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inverse_cumulative_distribution</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.75,-270.89C115.81,-274.06 129.27,-277.81 141.5,-279.62 278.89,-300.06 315.52,-295.47 454,-284.62 461.98,-284 470.25,-283.13 478.52,-282.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="478.81,-285.61 488.27,-280.84 477.9,-278.67 478.81,-285.61"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1" target="_top" xlink:title="The probability density function.">
-<polygon fill="white" stroke="#666666" points="279.75,-373.5 141.5,-373.5 141.5,-331.75 279.75,-331.75 279.75,-373.5"/>
-<text text-anchor="start" x="149.5" y="-360" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="149.5" y="-348.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="210.62" y="-337.5" font-family="Helvetica,sans-Serif" font-size="10.00">::probability_density</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.17,-275.36C107.63,-286.56 124.34,-305.02 141.5,-317.62 145.3,-320.41 149.35,-323.1 153.51,-325.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.65,-328.63 162.05,-330.64 155.17,-322.58 151.65,-328.63"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69" target="_top" xlink:title="This function computes the probability to have success in a given range of tries.">
-<polygon fill="white" stroke="#666666" points="279.75,-433.5 141.5,-433.5 141.5,-391.75 279.75,-391.75 279.75,-433.5"/>
-<text text-anchor="start" x="149.5" y="-420" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="149.5" y="-408.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="210.62" y="-397.5" font-family="Helvetica,sans-Serif" font-size="10.00">::range_tries</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node10 -->
-<g id="edge10_Node000002_Node000010" class="edge">
-<title>Node2&#45;&gt;Node10</title>
-<g id="a_edge10_Node000002_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.04,-275.47C96.51,-297.48 110.17,-351.23 141.5,-382.62 142.1,-383.23 142.71,-383.81 143.34,-384.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.91,-386.93 150.93,-390.37 145.24,-381.44 140.91,-386.93"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6" target="_top" xlink:title="Tests the sampling method of the geometric distribution.">
-<polygon fill="white" stroke="#666666" points="245.25,-185.25 176,-185.25 176,-166 245.25,-166 245.25,-185.25"/>
-<text text-anchor="middle" x="210.62" y="-171.75" font-family="Helvetica,sans-Serif" font-size="10.00">sample_test</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node12 -->
-<g id="edge13_Node000002_Node000012" class="edge">
-<title>Node2&#45;&gt;Node12</title>
-<g id="a_edge13_Node000002_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M96.9,-255.9C105.84,-243.4 122.79,-221.65 141.5,-207.62 150.5,-200.88 161.15,-195.05 171.33,-190.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.56,-193.57 180.29,-186.32 169.72,-187.17 172.56,-193.57"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960" target="_top" xlink:title="The variance of a geometrically distributed random variable X.">
-<polygon fill="white" stroke="#666666" points="454,-79.5 315.75,-79.5 315.75,-37.75 454,-37.75 454,-79.5"/>
-<text text-anchor="start" x="323.75" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="323.75" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="384.88" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">::variance</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node16 -->
-<g id="edge25_Node000002_Node000016" class="edge">
-<title>Node2&#45;&gt;Node16</title>
-<g id="a_edge25_Node000002_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.32,-255.76C97.21,-234.72 111.43,-185.08 141.5,-156.62 166.03,-133.41 243.95,-104.07 304.89,-83.57"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.85,-86.94 314.23,-80.46 303.64,-80.3 305.85,-86.94"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2" target="_top" xlink:title="The standard deviation of a geometrically distributed random variable X.">
-<polygon fill="white" stroke="#666666" points="279.75,-79.5 141.5,-79.5 141.5,-37.75 279.75,-37.75 279.75,-79.5"/>
-<text text-anchor="start" x="149.5" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="149.5" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="210.62" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">::standard_deviation</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node17 -->
-<g id="edge22_Node000002_Node000017" class="edge">
-<title>Node2&#45;&gt;Node17</title>
-<g id="a_edge22_Node000002_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M91.3,-255.77C94.52,-229.39 106.31,-155.84 141.5,-107.62 147.18,-99.84 154.47,-92.81 162.16,-86.66"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.16,-89.54 170.09,-80.76 159.97,-83.93 164.16,-89.54"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="596,-422.25 542.5,-422.25 542.5,-403 596,-403 596,-422.25"/>
-<text text-anchor="middle" x="569.25" y="-408.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M454.3,-440.12C480.47,-433.8 509.31,-426.85 531.42,-421.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="531.95,-424.98 540.85,-419.23 530.31,-418.18 531.95,-424.98"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/log.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="732.75,-276.25 684.5,-276.25 684.5,-257 732.75,-257 732.75,-276.25"/>
-<text text-anchor="middle" x="708.62" y="-262.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::log</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M648.97,-266.62C657.29,-266.62 665.4,-266.62 672.82,-266.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="672.67,-270.13 682.67,-266.63 672.67,-263.13 672.67,-270.13"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node4 -->
-<g id="edge9_Node000009_Node000004" class="edge">
-<title>Node9&#45;&gt;Node4</title>
-<g id="a_edge9_Node000009_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.23,-361.7C328.86,-368.41 395.59,-378.16 454,-388.62 479.82,-393.25 508.74,-399.33 531.02,-404.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="530.02,-407.58 540.54,-406.32 531.53,-400.75 530.02,-407.58"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node3 -->
-<g id="edge11_Node000010_Node000003" class="edge">
-<title>Node10&#45;&gt;Node3</title>
-<g id="a_edge11_Node000010_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.2,-430.14C288.13,-432.17 296.27,-434.25 304.34,-436.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="303.24,-439.64 313.79,-438.72 304.97,-432.86 303.24,-439.64"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/numeric_limits/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="446.5,-417.25 323.25,-417.25 323.25,-398 446.5,-398 446.5,-417.25"/>
-<text text-anchor="middle" x="384.88" y="-403.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::numeric_limits::max</text>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node11 -->
-<g id="edge12_Node000010_Node000011" class="edge">
-<title>Node10&#45;&gt;Node11</title>
-<g id="a_edge12_Node000010_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.2,-410.63C290.42,-410.34 300.99,-410.03 311.3,-409.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="311.38,-413.23 321.27,-409.44 311.17,-406.23 311.38,-413.23"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node5 -->
-<g id="edge18_Node000012_Node000005" class="edge">
-<title>Node12&#45;&gt;Node5</title>
-<g id="a_edge18_Node000012_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M223.34,-185.53C241.84,-200.72 279.44,-229.74 315.75,-246.62 325.56,-251.19 336.69,-254.86 347.07,-257.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="345.91,-261.03 356.47,-260.12 347.65,-254.25 345.91,-261.03"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node6 -->
-<g id="edge19_Node000012_Node000006" class="edge">
-<title>Node12&#45;&gt;Node6</title>
-<g id="a_edge19_Node000012_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.66,-183.73C262.53,-187.74 283.67,-192.77 304.31,-197.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="303.35,-201.06 313.89,-199.97 304.97,-194.25 303.35,-201.06"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3" target="_top" xlink:title="Generates a (discrete) sample according to the geometrical distribution.">
-<polygon fill="white" stroke="#666666" points="454,-177.5 315.75,-177.5 315.75,-135.75 454,-135.75 454,-177.5"/>
-<text text-anchor="start" x="323.75" y="-164" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="start" x="323.75" y="-152.75" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::geometric_distribution</text>
-<text text-anchor="middle" x="384.88" y="-141.5" font-family="Helvetica,sans-Serif" font-size="10.00">::draw_sample</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge14_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge14_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.66,-171.87C262.45,-170.02 283.48,-167.7 304.02,-165.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.3,-168.92 313.85,-164.35 303.53,-161.97 304.3,-168.92"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="432.25,-117.25 337.5,-117.25 337.5,-98 432.25,-98 432.25,-117.25"/>
-<text text-anchor="middle" x="384.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node15 -->
-<g id="edge20_Node000012_Node000015" class="edge">
-<title>Node12&#45;&gt;Node15</title>
-<g id="a_edge20_Node000012_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M230.4,-165.61C250.94,-154.94 285.04,-138.04 315.75,-126.62 321.15,-124.62 326.86,-122.71 332.58,-120.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.49,-124.31 342.08,-118.1 331.5,-117.6 333.49,-124.31"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node16 -->
-<g id="edge21_Node000012_Node000016" class="edge">
-<title>Node12&#45;&gt;Node16</title>
-<g id="a_edge21_Node000012_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M233.29,-165.64C247.42,-158.5 265.78,-147.98 279.75,-135.62 299.46,-118.2 295.06,-104.88 315.75,-88.62 316.89,-87.73 318.07,-86.85 319.27,-85.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="321.09,-88.99 327.63,-80.65 317.31,-83.09 321.09,-88.99"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node7 -->
-<g id="edge17_Node000013_Node000007" class="edge">
-<title>Node13&#45;&gt;Node7</title>
-<g id="a_edge17_Node000013_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M437.01,-177.83C442.82,-180.62 448.59,-183.58 454,-186.62 481.32,-202.01 510.24,-222.3 532.14,-238.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="529.77,-241.19 539.87,-244.4 533.98,-235.6 529.77,-241.19"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba" target="_top" xlink:title="Returns a random number between [0,1].">
-<polygon fill="white" stroke="#666666" points="628.25,-171.88 510.25,-171.88 510.25,-141.38 628.25,-141.38 628.25,-171.88"/>
-<text text-anchor="start" x="518.25" y="-158.38" font-family="Helvetica,sans-Serif" font-size="10.00">probability::geometric</text>
-<text text-anchor="middle" x="569.25" y="-147.12" font-family="Helvetica,sans-Serif" font-size="10.00">_dist::generate_uniform</text>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node14 -->
-<g id="edge15_Node000013_Node000014" class="edge">
-<title>Node13&#45;&gt;Node14</title>
-<g id="a_edge15_Node000013_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M454.3,-156.62C468.74,-156.62 483.99,-156.62 498.47,-156.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="498.38,-160.13 508.38,-156.63 498.38,-153.13 498.38,-160.13"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node14 -->
-<g id="edge16_Node000014_Node000014" class="edge">
-<title>Node14&#45;&gt;Node14</title>
-<g id="a_edge16_Node000014_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M544.55,-172.36C539.51,-181.43 547.74,-189.88 569.25,-189.88 581.01,-189.88 588.8,-187.35 592.62,-183.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="596.07,-184.21 593.77,-173.86 589.12,-183.38 596.07,-184.21"/>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node16 -->
-<g id="edge24_Node000017_Node000016" class="edge">
-<title>Node17&#45;&gt;Node16</title>
-<g id="a_edge24_Node000017_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.2,-58.62C287.95,-58.62 295.9,-58.62 303.79,-58.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="303.74,-62.13 313.74,-58.63 303.74,-55.13 303.74,-62.13"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="410.88,-19.25 358.88,-19.25 358.88,0 410.88,0 410.88,-19.25"/>
-<text text-anchor="middle" x="384.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge23_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge23_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.21,-38.77C292.06,-35.37 304.26,-31.88 315.75,-28.62 326.16,-25.67 337.48,-22.5 347.84,-19.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="348.47,-23.07 357.17,-17.02 346.6,-16.33 348.47,-23.07"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d72/geometric__dist_8cpp_source.html b/de/d72/geometric__dist_8cpp_source.html
new file mode 100644
index 000000000..54dad550f
--- /dev/null
+++ b/de/d72/geometric__dist_8cpp_source.html
@@ -0,0 +1,323 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: probability/geometric_dist.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/d72/geometric__dist_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">geometric_dist.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/d72/geometric__dist_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;cmath&gt;</span>     </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;cstdint&gt;</span>   </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;ctime&gt;</span>     </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;limits&gt;</span>    </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;random&gt;</span>    </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a> {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d8a/namespacegeometric__dist.html">geometric_dist</a> {</div>
+<div class="foldopen" id="foldopen00048" data-start="{" data-end="}">
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="../../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba">   48</a></span><span class="keywordtype">float</span> <a class="code hl_function" href="../../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba">generate_uniform</a>() {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(rand()) / <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(RAND_MAX);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>}</div>
+</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="foldopen" id="foldopen00055" data-start="{" data-end="};">
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html">   55</a></span><span class="keyword">class </span><a class="code hl_class" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html">geometric_distribution</a> {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3">   57</a></span>    <span class="keywordtype">float</span> <a class="code hl_variable" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>;  </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"><a class="line" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797">   64</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797">geometric_distribution</a>(<span class="keyword">const</span> <span class="keywordtype">float</span>&amp; <a class="code hl_variable" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>) : <a class="code hl_variable" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>(<a class="code hl_variable" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>) {}</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"><a class="line" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413">   71</a></span>    <span class="keywordtype">float</span> <a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413">expected_value</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> 1.0f / <a class="code hl_variable" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>; }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960">   77</a></span>    <span class="keywordtype">float</span> <a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960">variance</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (1.0f - <a class="code hl_variable" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>) / (<a class="code hl_variable" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a> * <a class="code hl_variable" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>); }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"><a class="line" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2">   84</a></span>    <span class="keywordtype">float</span> <a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2">standard_deviation</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> std::sqrt(<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960">variance</a>()); }</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="foldopen" id="foldopen00093" data-start="{" data-end="}">
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"><a class="line" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1">   93</a></span>    <span class="keywordtype">float</span> <a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1">probability_density</a>(<span class="keyword">const</span> uint32_t&amp; k)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="keywordflow">return</span> std::pow((1.0f - <a class="code hl_variable" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>), <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(k - 1)) * <a class="code hl_variable" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    }</div>
+</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="foldopen" id="foldopen00104" data-start="{" data-end="}">
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"><a class="line" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a">  104</a></span>    <span class="keywordtype">float</span> <a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a">cumulative_distribution</a>(<span class="keyword">const</span> uint32_t&amp; k)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        <span class="keywordflow">return</span> 1.0f - std::pow((1.0f - <a class="code hl_variable" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>), <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(k));</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    }</div>
+</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="foldopen" id="foldopen00116" data-start="{" data-end="}">
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"><a class="line" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf">  116</a></span>    <span class="keywordtype">float</span> <a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf">inverse_cumulative_distribution</a>(<span class="keyword">const</span> <span class="keywordtype">float</span>&amp; cdf)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        <span class="keywordflow">return</span> std::log(1.0f - cdf) / std::log(1.0f - <a class="code hl_variable" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3">p</a>);</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    }</div>
+</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
+<div class="foldopen" id="foldopen00125" data-start="{" data-end="}">
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"><a class="line" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3">  125</a></span>    uint32_t <a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3">draw_sample</a>()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        <span class="keywordtype">float</span> uniform_sample = <a class="code hl_function" href="../../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba">generate_uniform</a>();</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span>uint32_t<span class="keyword">&gt;</span>(</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>                   <a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf">inverse_cumulative_distribution</a>(uniform_sample)) +</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>               1;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    }</div>
+</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
+<div class="foldopen" id="foldopen00145" data-start="{" data-end="}">
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"><a class="line" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69">  145</a></span>    <span class="keywordtype">float</span> <a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69">range_tries</a>(<span class="keyword">const</span> uint32_t&amp; min_tries = 1,</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>                      <span class="keyword">const</span> uint32_t&amp; max_tries =</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>                          std::numeric_limits&lt;uint32_t&gt;::max())<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        <span class="keywordtype">float</span> cdf_lower = <a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a">cumulative_distribution</a>(min_tries - 1);</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        <span class="keywordtype">float</span> cdf_upper = max_tries == std::numeric_limits&lt;uint32_t&gt;::max()</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>                              ? 1.0f</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>                              : <a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a">cumulative_distribution</a>(max_tries);</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>        <span class="keywordflow">return</span> cdf_upper - cdf_lower;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    }</div>
+</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>};</div>
+</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>}  <span class="comment">// namespace geometric_dist</span></div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>}  <span class="comment">// namespace probability</span></div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span> </div>
+<div class="foldopen" id="foldopen00165" data-start="{" data-end="}">
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"><a class="line" href="../../de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6">  165</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6">sample_test</a>(</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    <span class="keyword">const</span> <a class="code hl_class" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html">probability::geometric_dist::geometric_distribution</a>&amp; dist) {</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    uint32_t n_tries = 1000000;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    std::vector&lt;float&gt; tries;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    tries.resize(n_tries);</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span> </div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    <span class="keywordtype">float</span> mean = 0.0f;</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; n_tries; ++i) {</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>        tries[i] = <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3">draw_sample</a>());</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        mean += tries[i];</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    }</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span> </div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    mean /= <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(n_tries);</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    <span class="keywordtype">float</span> var = 0.0f;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; n_tries; ++i) {</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>        var += (tries[i] - mean) * (tries[i] - mean);</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    }</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span> </div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    <span class="comment">// Unbiased estimate of variance</span></div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    var /= <span class="keyword">static_cast&lt;</span><span class="keywordtype">float</span><span class="keyword">&gt;</span>(n_tries - 1);</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span> </div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;This value should be near &quot;</span> &lt;&lt; dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413">expected_value</a>() &lt;&lt; <span class="stringliteral">&quot;: &quot;</span></div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>              &lt;&lt; mean &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;This value should be near &quot;</span> &lt;&lt; dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960">variance</a>() &lt;&lt; <span class="stringliteral">&quot;: &quot;</span> &lt;&lt; var</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>}</div>
+</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span> </div>
+<div class="foldopen" id="foldopen00197" data-start="{" data-end="}">
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"><a class="line" href="../../de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  197</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    <a class="code hl_class" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html">probability::geometric_dist::geometric_distribution</a> dist(0.3);</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span> </div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    <span class="keyword">const</span> <span class="keywordtype">float</span> threshold = 1e-3f;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span> </div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Starting tests for p = 0.3...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413">expected_value</a>() - 3.33333333f) &lt; threshold);</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960">variance</a>() - 7.77777777f) &lt; threshold);</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2">standard_deviation</a>() - 2.788866755) &lt; threshold);</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1">probability_density</a>(5) - 0.07203) &lt; threshold);</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a">cumulative_distribution</a>(6) - 0.882351) &lt; threshold);</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf">inverse_cumulative_distribution</a>(</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>                        dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a">cumulative_distribution</a>(8)) -</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>                    8) &lt; threshold);</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69">range_tries</a>() - 1.0f) &lt; threshold);</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69">range_tries</a>(3) - 0.49f) &lt; threshold);</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69">range_tries</a>(5, 11) - 0.2203267f) &lt; threshold);</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    <a class="code hl_function" href="../../de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6">sample_test</a>(dist);</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span> </div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    dist = <a class="code hl_class" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html">probability::geometric_dist::geometric_distribution</a>(0.5f);</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span> </div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Starting tests for p = 0.5...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413">expected_value</a>() - 2.0f) &lt; threshold);</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960">variance</a>() - 2.0f) &lt; threshold);</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2">standard_deviation</a>() - 1.4142135f) &lt; threshold);</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1">probability_density</a>(5) - 0.03125) &lt; threshold);</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a">cumulative_distribution</a>(6) - 0.984375) &lt; threshold);</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf">inverse_cumulative_distribution</a>(</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>                        dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a">cumulative_distribution</a>(8)) -</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>                    8) &lt; threshold);</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69">range_tries</a>() - 1.0f) &lt; threshold);</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69">range_tries</a>(3) - 0.25f) &lt; threshold);</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69">range_tries</a>(5, 11) - 0.062011f) &lt; threshold);</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    <a class="code hl_function" href="../../de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6">sample_test</a>(dist);</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span> </div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    dist = <a class="code hl_class" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html">probability::geometric_dist::geometric_distribution</a>(0.8f);</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span> </div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Starting tests for p = 0.8...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413">expected_value</a>() - 1.25f) &lt; threshold);</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960">variance</a>() - 0.3125f) &lt; threshold);</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2">standard_deviation</a>() - 0.559016f) &lt; threshold);</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1">probability_density</a>(5) - 0.00128) &lt; threshold);</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a">cumulative_distribution</a>(6) - 0.999936) &lt; threshold);</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf">inverse_cumulative_distribution</a>(</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>                        dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a">cumulative_distribution</a>(8)) -</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>                    8) &lt; threshold);</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69">range_tries</a>() - 1.0f) &lt; threshold);</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69">range_tries</a>(3) - 0.04f) &lt; threshold);</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    assert(std::abs(dist.<a class="code hl_function" href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69">range_tries</a>(5, 11) - 0.00159997f) &lt; threshold);</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    <a class="code hl_function" href="../../de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6">sample_test</a>(dist);</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>}</div>
+</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span> </div>
+<div class="foldopen" id="foldopen00256" data-start="{" data-end="}">
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"><a class="line" href="../../de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  256</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    srand(time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    <a class="code hl_function" href="../../de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>}</div>
+</div>
+<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html"><div class="ttname"><a href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html">probability::geometric_dist::geometric_distribution</a></div><div class="ttdoc">A class to model the geometric distribution.</div><div class="ttdef"><b>Definition</b> <a href="#l00055">geometric_dist.cpp:55</a></div></div>
+<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_a08328dc7d62188427111f176b56a105a"><div class="ttname"><a href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a">probability::geometric_dist::geometric_distribution::cumulative_distribution</a></div><div class="ttdeci">float cumulative_distribution(const uint32_t &amp;k) const</div><div class="ttdoc">The cumulative distribution function.</div><div class="ttdef"><b>Definition</b> <a href="#l00104">geometric_dist.cpp:104</a></div></div>
+<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_a0a10c512e13dd3a052e1c6d7f4d6f0f2"><div class="ttname"><a href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2">probability::geometric_dist::geometric_distribution::standard_deviation</a></div><div class="ttdeci">float standard_deviation() const</div><div class="ttdoc">The standard deviation of a geometrically distributed random variable X.</div><div class="ttdef"><b>Definition</b> <a href="#l00084">geometric_dist.cpp:84</a></div></div>
+<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_a41051365f8ac7700f2ed5880a6760413"><div class="ttname"><a href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413">probability::geometric_dist::geometric_distribution::expected_value</a></div><div class="ttdeci">float expected_value() const</div><div class="ttdoc">The expected value of a geometrically distributed random variable X.</div><div class="ttdef"><b>Definition</b> <a href="#l00071">geometric_dist.cpp:71</a></div></div>
+<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_a4620163a196709484225774d87de6d69"><div class="ttname"><a href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69">probability::geometric_dist::geometric_distribution::range_tries</a></div><div class="ttdeci">float range_tries(const uint32_t &amp;min_tries=1, const uint32_t &amp;max_tries=std::numeric_limits&lt; uint32_t &gt;::max()) const</div><div class="ttdoc">This function computes the probability to have success in a given range of tries.</div><div class="ttdef"><b>Definition</b> <a href="#l00145">geometric_dist.cpp:145</a></div></div>
+<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_a8aae1cebcf42ed2332f1c7217c401aa3"><div class="ttname"><a href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3">probability::geometric_dist::geometric_distribution::draw_sample</a></div><div class="ttdeci">uint32_t draw_sample() const</div><div class="ttdoc">Generates a (discrete) sample according to the geometrical distribution.</div><div class="ttdef"><b>Definition</b> <a href="#l00125">geometric_dist.cpp:125</a></div></div>
+<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_aa12088ba133dd0910103db0eb0ef2797"><div class="ttname"><a href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797">probability::geometric_dist::geometric_distribution::geometric_distribution</a></div><div class="ttdeci">geometric_distribution(const float &amp;p)</div><div class="ttdoc">Constructor for the geometric distribution.</div><div class="ttdef"><b>Definition</b> <a href="#l00064">geometric_dist.cpp:64</a></div></div>
+<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_aaf762e88c66918d7afda4234f28a7ddf"><div class="ttname"><a href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf">probability::geometric_dist::geometric_distribution::inverse_cumulative_distribution</a></div><div class="ttdeci">float inverse_cumulative_distribution(const float &amp;cdf) const</div><div class="ttdoc">The inverse cumulative distribution function.</div><div class="ttdef"><b>Definition</b> <a href="#l00116">geometric_dist.cpp:116</a></div></div>
+<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_ad5ed23a251dbe55ad1ed06bf1a465ad3"><div class="ttname"><a href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3">probability::geometric_dist::geometric_distribution::p</a></div><div class="ttdeci">float p</div><div class="ttdoc">The succes probability p.</div><div class="ttdef"><b>Definition</b> <a href="#l00057">geometric_dist.cpp:57</a></div></div>
+<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_aea8b0d649f0dc9a6f8baf3341a0b4960"><div class="ttname"><a href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960">probability::geometric_dist::geometric_distribution::variance</a></div><div class="ttdeci">float variance() const</div><div class="ttdoc">The variance of a geometrically distributed random variable X.</div><div class="ttdef"><b>Definition</b> <a href="#l00077">geometric_dist.cpp:77</a></div></div>
+<div class="ttc" id="aclassprobability_1_1geometric__dist_1_1geometric__distribution_html_aee973db9f0435e0cb4cc70f8eb3447a1"><div class="ttname"><a href="../../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1">probability::geometric_dist::geometric_distribution::probability_density</a></div><div class="ttdeci">float probability_density(const uint32_t &amp;k) const</div><div class="ttdoc">The probability density function.</div><div class="ttdef"><b>Definition</b> <a href="#l00093">geometric_dist.cpp:93</a></div></div>
+<div class="ttc" id="ageometric__dist_8cpp_html_a70fd1cc5c3a2813f28683dc75dcd65b6"><div class="ttname"><a href="../../de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6">sample_test</a></div><div class="ttdeci">void sample_test(const probability::geometric_dist::geometric_distribution &amp;dist)</div><div class="ttdoc">Tests the sampling method of the geometric distribution.</div><div class="ttdef"><b>Definition</b> <a href="#l00165">geometric_dist.cpp:165</a></div></div>
+<div class="ttc" id="ageometric__dist_8cpp_html_a82964ca6180507deb5fafc71050012ba"><div class="ttname"><a href="../../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba">probability::geometric_dist::generate_uniform</a></div><div class="ttdeci">float generate_uniform()</div><div class="ttdoc">Returns a random number between [0,1].</div><div class="ttdef"><b>Definition</b> <a href="#l00048">geometric_dist.cpp:48</a></div></div>
+<div class="ttc" id="ageometric__dist_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../de/d72/geometric__dist_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> <a href="#l00197">geometric_dist.cpp:197</a></div></div>
+<div class="ttc" id="ageometric__dist_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00256">geometric_dist.cpp:256</a></div></div>
+<div class="ttc" id="anamespacegeometric__dist_html"><div class="ttname"><a href="../../dd/d8a/namespacegeometric__dist.html">geometric_dist</a></div><div class="ttdoc">Functions for the Geometric Distribution algorithm implementation.</div></div>
+<div class="ttc" id="anamespaceprobability_html"><div class="ttname"><a href="../../d4/ded/namespaceprobability.html">probability</a></div><div class="ttdoc">Probability algorithms.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_82e494173a87936756866de2fa774307.html">probability</a></li><li class="navelem"><a class="el" href="../../de/d72/geometric__dist_8cpp.html">geometric_dist.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/d75/qr__eigen__values_8cpp.html b/de/d75/qr__eigen__values_8cpp.html
index 2088e57ec..1fe5f239f 100644
--- a/de/d75/qr__eigen__values_8cpp.html
+++ b/de/d75/qr__eigen__values_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/qr_eigen_values.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/qr_eigen_values.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -125,7 +142,9 @@ Include dependency graph for qr_eigen_values.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d72/qr__eigen__values_8cpp__incl.svg" width="626" height="199"><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">
+</div>
+<p><a href="../../de/d75/qr__eigen__values_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d3b/namespaceqr__algorithm.html">qr_algorithm</a></td></tr>
@@ -139,11 +158,11 @@ Macros</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a9bbf469d5525a816b0d6ca812119093d" id="r_a9bbf469d5525a816b0d6ca812119093d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9bbf469d5525a816b0d6ca812119093d">create_matrix</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *A)</td></tr>
+<tr class="memitem:a9bbf469d5525a816b0d6ca812119093d" id="r_a9bbf469d5525a816b0d6ca812119093d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9bbf469d5525a816b0d6ca812119093d">create_matrix</a> (std::valarray&lt; std::valarray&lt; double &gt; &gt; *A)</td></tr>
 <tr class="separator:a9bbf469d5525a816b0d6ca812119093d"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:abb8bf4c55e10685a5eb2ad3797fde1ae" id="r_abb8bf4c55e10685a5eb2ad3797fde1ae"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abb8bf4c55e10685a5eb2ad3797fde1ae">mat_mul</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;B, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *OUT)</td></tr>
+<tr class="memitem:abb8bf4c55e10685a5eb2ad3797fde1ae" id="r_abb8bf4c55e10685a5eb2ad3797fde1ae"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abb8bf4c55e10685a5eb2ad3797fde1ae">mat_mul</a> (const std::valarray&lt; std::valarray&lt; double &gt; &gt; &amp;A, const std::valarray&lt; std::valarray&lt; double &gt; &gt; &amp;B, std::valarray&lt; std::valarray&lt; double &gt; &gt; *OUT)</td></tr>
 <tr class="separator:abb8bf4c55e10685a5eb2ad3797fde1ae"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a28e2fa3e803abaea6c568dc45d69d8cc" id="r_a28e2fa3e803abaea6c568dc45d69d8cc"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc">qr_algorithm::eigen_values</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *A, bool print_intermediates=false)</td></tr>
+<tr class="memitem:a28e2fa3e803abaea6c568dc45d69d8cc" id="r_a28e2fa3e803abaea6c568dc45d69d8cc"><td class="memItemLeft" align="right" valign="top">std::valarray&lt; double &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc">qr_algorithm::eigen_values</a> (std::valarray&lt; std::valarray&lt; double &gt; &gt; *A, bool print_intermediates=false)</td></tr>
 <tr class="separator:a28e2fa3e803abaea6c568dc45d69d8cc"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a1440a7779ac56f47a3f355ce4a8c7da0" id="r_a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a> ()</td></tr>
 <tr class="separator:a1440a7779ac56f47a3f355ce4a8c7da0"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -155,6 +174,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Compute real eigen values and eigen vectors of a symmetric matrix using <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> method. </p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../de/d75/qr__eigen__values_8cpp_source.html">qr_eigen_values.cpp</a>.</p>
 </div><h2 class="groupheader">Macro Definition Documentation</h2>
 <a id="aee57a411f07599034f5ceb8cc7d65b40" name="aee57a411f07599034f5ceb8cc7d65b40"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aee57a411f07599034f5ceb8cc7d65b40">&#9670;&#160;</a></span>LIMS</h2>
@@ -169,6 +190,8 @@ Functions</h2></td></tr>
 </div><div class="memdoc">
 <p>limit of range of matrix values </p>
 
+<p class="definition">Definition at line <a class="el" href="../../de/d75/qr__eigen__values_8cpp_source.html#l00020">20</a> of file <a class="el" href="../../de/d75/qr__eigen__values_8cpp_source.html">qr_eigen_values.cpp</a>.</p>
+
 </div>
 </div>
 <h2 class="groupheader">Function Documentation</h2>
@@ -181,7 +204,7 @@ Functions</h2></td></tr>
         <tr>
           <td class="memname">void create_matrix </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
+          <td class="paramtype">std::valarray&lt; std::valarray&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>A</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -193,6 +216,8 @@ Functions</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d75/qr__eigen__values_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../de/d75/qr__eigen__values_8cpp_source.html">qr_eigen_values.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   28</span>                                                        {</div>
 <div class="line"><span class="lineno">   29</span>    <span class="keywordtype">int</span> i, j, tmp, lim2 = <a class="code hl_define" href="#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a> &gt;&gt; 1;</div>
 <div class="line"><span class="lineno">   30</span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = A-&gt;size();</div>
@@ -201,23 +226,17 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   33</span><span class="preprocessor">#pragma omp for</span></div>
 <div class="line"><span class="lineno">   34</span><span class="preprocessor">#endif</span></div>
 <div class="line"><span class="lineno">   35</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
-<div class="line"><span class="lineno">   36</span>        A[0][i][i] = (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % <a class="code hl_define" href="#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a>) - lim2;</div>
+<div class="line"><span class="lineno">   36</span>        A[0][i][i] = (std::rand() % <a class="code hl_define" href="#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a>) - lim2;</div>
 <div class="line"><span class="lineno">   37</span>        <span class="keywordflow">for</span> (j = i + 1; j &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; j++) {</div>
-<div class="line"><span class="lineno">   38</span>            tmp = (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % <a class="code hl_define" href="#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a>) - lim2;</div>
+<div class="line"><span class="lineno">   38</span>            tmp = (std::rand() % <a class="code hl_define" href="#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a>) - lim2;</div>
 <div class="line"><span class="lineno">   39</span>            A[0][i][j] = tmp;  <span class="comment">// summetrically distribute random values</span></div>
 <div class="line"><span class="lineno">   40</span>            A[0][j][i] = tmp;</div>
 <div class="line"><span class="lineno">   41</span>        }</div>
 <div class="line"><span class="lineno">   42</span>    }</div>
 <div class="line"><span class="lineno">   43</span>}</div>
-<div class="ttc" id="aqr__eigen__values_8cpp_html_aee57a411f07599034f5ceb8cc7d65b40"><div class="ttname"><a href="#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a></div><div class="ttdeci">#define LIMS</div><div class="ttdef"><b>Definition</b> qr_eigen_values.cpp:20</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d75/qr__eigen__values_8cpp_a9bbf469d5525a816b0d6ca812119093d_cgraph.svg" width="232" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aqr__eigen__values_8cpp_html_aee57a411f07599034f5ceb8cc7d65b40"><div class="ttname"><a href="#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a></div><div class="ttdeci">#define LIMS</div><div class="ttdef"><b>Definition</b> <a href="../../de/d75/qr__eigen__values_8cpp_source.html#l00020">qr_eigen_values.cpp:20</a></div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a3c04138a5bfe5d72780bb7e82a18e627" name="a3c04138a5bfe5d72780bb7e82a18e627"></a>
@@ -239,66 +258,56 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d75/qr__eigen__values_8cpp_source.html#l00243">243</a> of file <a class="el" href="../../de/d75/qr__eigen__values_8cpp_source.html">qr_eigen_values.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  243</span>                                {</div>
 <div class="line"><span class="lineno">  244</span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> = 5;</div>
 <div class="line"><span class="lineno">  245</span>    <span class="keywordflow">if</span> (argc == 2) {</div>
-<div class="line"><span class="lineno">  246</span>        <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">atoi</a>(argv[1]);</div>
+<div class="line"><span class="lineno">  246</span>        <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> = atoi(argv[1]);</div>
 <div class="line"><span class="lineno">  247</span>    } <span class="keywordflow">else</span> {  <span class="comment">// if invalid input argument is given run tests</span></div>
 <div class="line"><span class="lineno">  248</span>        <a class="code hl_function" href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();</div>
 <div class="line"><span class="lineno">  249</span>        <a class="code hl_function" href="#a0283886819c7c140a023582b7269e2d0">test2</a>();</div>
-<div class="line"><span class="lineno">  250</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Usage: ./qr_eigen_values [mat_size]\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  250</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Usage: ./qr_eigen_values [mat_size]\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  251</span>        <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  252</span>    }</div>
 <div class="line"><span class="lineno">  253</span> </div>
 <div class="line"><span class="lineno">  254</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> &lt; 2) {</div>
-<div class="line"><span class="lineno">  255</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/fprintf.html">fprintf</a>(stderr, <span class="stringliteral">&quot;Matrix size should be &gt; 2\n&quot;</span>);</div>
+<div class="line"><span class="lineno">  255</span>        fprintf(stderr, <span class="stringliteral">&quot;Matrix size should be &gt; 2\n&quot;</span>);</div>
 <div class="line"><span class="lineno">  256</span>        <span class="keywordflow">return</span> -1;</div>
 <div class="line"><span class="lineno">  257</span>    }</div>
 <div class="line"><span class="lineno">  258</span> </div>
 <div class="line"><span class="lineno">  259</span>    <span class="comment">// initialize random number generator</span></div>
-<div class="line"><span class="lineno">  260</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>));</div>
+<div class="line"><span class="lineno">  260</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
 <div class="line"><span class="lineno">  261</span> </div>
 <div class="line"><span class="lineno">  262</span>    <span class="keywordtype">int</span> i, rows = <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>, columns = <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>;</div>
 <div class="line"><span class="lineno">  263</span> </div>
-<div class="line"><span class="lineno">  264</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;std::valarray&lt;double&gt;</a>&gt; A(rows);</div>
+<div class="line"><span class="lineno">  264</span>    std::valarray&lt;std::valarray&lt;double&gt;&gt; A(rows);</div>
 <div class="line"><span class="lineno">  265</span> </div>
 <div class="line"><span class="lineno">  266</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; rows; i++) {</div>
-<div class="line"><span class="lineno">  267</span>        A[i] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a>(columns);</div>
+<div class="line"><span class="lineno">  267</span>        A[i] = std::valarray&lt;double&gt;(columns);</div>
 <div class="line"><span class="lineno">  268</span>    }</div>
 <div class="line"><span class="lineno">  269</span> </div>
 <div class="line"><span class="lineno">  270</span>    <span class="comment">/* create a random matrix */</span></div>
 <div class="line"><span class="lineno">  271</span>    <a class="code hl_function" href="#a9bbf469d5525a816b0d6ca812119093d">create_matrix</a>(&amp;A);</div>
 <div class="line"><span class="lineno">  272</span> </div>
-<div class="line"><span class="lineno">  273</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; A &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  273</span>    std::cout &lt;&lt; A &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  274</span> </div>
-<div class="line"><span class="lineno">  275</span>    clock_t t1 = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">clock</a>();</div>
-<div class="line"><span class="lineno">  276</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> eigen_vals = <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc">qr_algorithm::eigen_values</a>(&amp;A);</div>
-<div class="line"><span class="lineno">  277</span>    <span class="keywordtype">double</span> dtime = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">clock</a>() - t1) / CLOCKS_PER_SEC;</div>
+<div class="line"><span class="lineno">  275</span>    clock_t t1 = clock();</div>
+<div class="line"><span class="lineno">  276</span>    std::valarray&lt;double&gt; eigen_vals = <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc">qr_algorithm::eigen_values</a>(&amp;A);</div>
+<div class="line"><span class="lineno">  277</span>    <span class="keywordtype">double</span> dtime = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(clock() - t1) / CLOCKS_PER_SEC;</div>
 <div class="line"><span class="lineno">  278</span> </div>
-<div class="line"><span class="lineno">  279</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Eigen vals: &quot;</span>;</div>
-<div class="line"><span class="lineno">  280</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; eigen_vals[i] &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
-<div class="line"><span class="lineno">  281</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTime taken to compute: &quot;</span> &lt;&lt; dtime &lt;&lt; <span class="stringliteral">&quot; sec\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  279</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Eigen vals: &quot;</span>;</div>
+<div class="line"><span class="lineno">  280</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) std::cout &lt;&lt; eigen_vals[i] &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><span class="lineno">  281</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTime taken to compute: &quot;</span> &lt;&lt; dtime &lt;&lt; <span class="stringliteral">&quot; sec\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  282</span> </div>
 <div class="line"><span class="lineno">  283</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  284</span>}</div>
-<div class="ttc" id="aatoi_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">std::atoi</a></div><div class="ttdeci">T atoi(T... args)</div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="aclock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a></div><div class="ttdeci">T clock(T... args)</div></div>
-<div class="ttc" id="afprintf_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/c/fprintf.html">std::fprintf</a></div><div class="ttdeci">T fprintf(T... args)</div></div>
-<div class="ttc" id="amatrix__exponentiation_8cpp_html_a9977ad12548c4a49dee9dc3f0685aa54"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a></div><div class="ttdeci">ll mat_size</div><div class="ttdef"><b>Definition</b> matrix_exponentiation.cpp:45</div></div>
-<div class="ttc" id="anamespaceqr__algorithm_html_a28e2fa3e803abaea6c568dc45d69d8cc"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc">qr_algorithm::eigen_values</a></div><div class="ttdeci">std::valarray&lt; double &gt; eigen_values(std::valarray&lt; std::valarray&lt; double &gt; &gt; *A, bool print_intermediates=false)</div><div class="ttdef"><b>Definition</b> qr_eigen_values.cpp:98</div></div>
-<div class="ttc" id="aqr__eigen__values_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> qr_eigen_values.cpp:210</div></div>
-<div class="ttc" id="aqr__eigen__values_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition</b> qr_eigen_values.cpp:177</div></div>
-<div class="ttc" id="aqr__eigen__values_8cpp_html_a9bbf469d5525a816b0d6ca812119093d"><div class="ttname"><a href="#a9bbf469d5525a816b0d6ca812119093d">create_matrix</a></div><div class="ttdeci">void create_matrix(std::valarray&lt; std::valarray&lt; double &gt; &gt; *A)</div><div class="ttdef"><b>Definition</b> qr_eigen_values.cpp:28</div></div>
-<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg" width="100%" height="514"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a9977ad12548c4a49dee9dc3f0685aa54"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a></div><div class="ttdeci">ll mat_size</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00045">matrix_exponentiation.cpp:45</a></div></div>
+<div class="ttc" id="anamespaceqr__algorithm_html_a28e2fa3e803abaea6c568dc45d69d8cc"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc">qr_algorithm::eigen_values</a></div><div class="ttdeci">std::valarray&lt; double &gt; eigen_values(std::valarray&lt; std::valarray&lt; double &gt; &gt; *A, bool print_intermediates=false)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d75/qr__eigen__values_8cpp_source.html#l00098">qr_eigen_values.cpp:98</a></div></div>
+<div class="ttc" id="aqr__eigen__values_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> <a href="../../de/d75/qr__eigen__values_8cpp_source.html#l00210">qr_eigen_values.cpp:210</a></div></div>
+<div class="ttc" id="aqr__eigen__values_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition</b> <a href="../../de/d75/qr__eigen__values_8cpp_source.html#l00177">qr_eigen_values.cpp:177</a></div></div>
+<div class="ttc" id="aqr__eigen__values_8cpp_html_a9bbf469d5525a816b0d6ca812119093d"><div class="ttname"><a href="#a9bbf469d5525a816b0d6ca812119093d">create_matrix</a></div><div class="ttdeci">void create_matrix(std::valarray&lt; std::valarray&lt; double &gt; &gt; *A)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d75/qr__eigen__values_8cpp_source.html#l00028">qr_eigen_values.cpp:28</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="abb8bf4c55e10685a5eb2ad3797fde1ae" name="abb8bf4c55e10685a5eb2ad3797fde1ae"></a>
@@ -310,17 +319,17 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void mat_mul </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">const std::valarray&lt; std::valarray&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>, </td>
+          <td class="paramtype">const std::valarray&lt; std::valarray&lt; double &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray</a>&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>OUT</em></span>&#160;)</td>
+          <td class="paramtype">std::valarray&lt; std::valarray&lt; double &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>OUT</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -337,13 +346,15 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>pointer to resultant matrix </dd></dl>
 </li>
 </ul>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d75/qr__eigen__values_8cpp_source.html#l00054">54</a> of file <a class="el" href="../../de/d75/qr__eigen__values_8cpp_source.html">qr_eigen_values.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   56</span>                                                    {</div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordtype">int</span> R1 = A.size();</div>
 <div class="line"><span class="lineno">   58</span>    <span class="keywordtype">int</span> C1 = A[0].size();</div>
 <div class="line"><span class="lineno">   59</span>    <span class="keywordtype">int</span> R2 = B.size();</div>
 <div class="line"><span class="lineno">   60</span>    <span class="keywordtype">int</span> C2 = B[0].size();</div>
 <div class="line"><span class="lineno">   61</span>    <span class="keywordflow">if</span> (C1 != R2) {</div>
-<div class="line"><span class="lineno">   62</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/c/perror.html">perror</a>(<span class="stringliteral">&quot;Matrix dimensions mismatch!&quot;</span>);</div>
+<div class="line"><span class="lineno">   62</span>        perror(<span class="stringliteral">&quot;Matrix dimensions mismatch!&quot;</span>);</div>
 <div class="line"><span class="lineno">   63</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">   64</span>    }</div>
 <div class="line"><span class="lineno">   65</span> </div>
@@ -356,8 +367,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   72</span>        }</div>
 <div class="line"><span class="lineno">   73</span>    }</div>
 <div class="line"><span class="lineno">   74</span>}</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-<div class="ttc" id="aperror_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/c/perror.html">std::perror</a></div><div class="ttdeci">T perror(T... args)</div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -382,35 +392,31 @@ Here is the call graph for this function:</div>
 \end{bmatrix}\]
 </p>
 <p> which are approximately, {15.56158, 0.384227} </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d75/qr__eigen__values_8cpp_source.html#l00177">177</a> of file <a class="el" href="../../de/d75/qr__eigen__values_8cpp_source.html">qr_eigen_values.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  177</span>             {</div>
-<div class="line"><span class="lineno">  178</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;std::valarray&lt;double&gt;</a>&gt; X = {{5, 7}, {7, 11}};</div>
+<div class="line"><span class="lineno">  178</span>    std::valarray&lt;std::valarray&lt;double&gt;&gt; X = {{5, 7}, {7, 11}};</div>
 <div class="line"><span class="lineno">  179</span>    <span class="keywordtype">double</span> y[] = {15.56158, 0.384227};  <span class="comment">// corresponding y-values</span></div>
 <div class="line"><span class="lineno">  180</span> </div>
-<div class="line"><span class="lineno">  181</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;------- Test 1 -------&quot;</span> &lt;&lt; <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">  182</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> eig_vals = <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc">qr_algorithm::eigen_values</a>(&amp;X);</div>
+<div class="line"><span class="lineno">  181</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 1 -------&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  182</span>    std::valarray&lt;double&gt; eig_vals = <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc">qr_algorithm::eigen_values</a>(&amp;X);</div>
 <div class="line"><span class="lineno">  183</span> </div>
 <div class="line"><span class="lineno">  184</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 2; i++) {</div>
-<div class="line"><span class="lineno">  185</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i + 1 &lt;&lt; <span class="stringliteral">&quot;/2 Checking for &quot;</span> &lt;&lt; y[i] &lt;&lt; <span class="stringliteral">&quot; --&gt; &quot;</span>;</div>
+<div class="line"><span class="lineno">  185</span>        std::cout &lt;&lt; i + 1 &lt;&lt; <span class="stringliteral">&quot;/2 Checking for &quot;</span> &lt;&lt; y[i] &lt;&lt; <span class="stringliteral">&quot; --&gt; &quot;</span>;</div>
 <div class="line"><span class="lineno">  186</span>        <span class="keywordtype">bool</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  187</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; 2 &amp;&amp; !<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>; j++) {</div>
 <div class="line"><span class="lineno">  188</span>            <span class="keywordflow">if</span> (std::abs(y[i] - eig_vals[j]) &lt; 0.1) {</div>
 <div class="line"><span class="lineno">  189</span>                <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <span class="keyword">true</span>;</div>
-<div class="line"><span class="lineno">  190</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; eig_vals[j] &lt;&lt; <span class="stringliteral">&quot;) &quot;</span>;</div>
+<div class="line"><span class="lineno">  190</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; eig_vals[j] &lt;&lt; <span class="stringliteral">&quot;) &quot;</span>;</div>
 <div class="line"><span class="lineno">  191</span>            }</div>
 <div class="line"><span class="lineno">  192</span>        }</div>
 <div class="line"><span class="lineno">  193</span>        assert(result);  <span class="comment">// ensure that i^th expected eigen value was computed</span></div>
-<div class="line"><span class="lineno">  194</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;found\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  194</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;found\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  195</span>    }</div>
-<div class="line"><span class="lineno">  196</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  196</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  197</span>}</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="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg" width="100%" height="388"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a0283886819c7c140a023582b7269e2d0" name="a0283886819c7c140a023582b7269e2d0"></a>
@@ -437,8 +443,10 @@ Here is the call graph for this function:</div>
 \end{bmatrix}\]
 </p>
 <p> which are approximately, {9.27648, -9.26948, 2.0181, -1.03516, -5.98994} </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d75/qr__eigen__values_8cpp_source.html#l00210">210</a> of file <a class="el" href="../../de/d75/qr__eigen__values_8cpp_source.html">qr_eigen_values.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  210</span>             {</div>
-<div class="line"><span class="lineno">  211</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;std::valarray&lt;double&gt;</a>&gt; X = {{-4, 4, 2, 0, -3},</div>
+<div class="line"><span class="lineno">  211</span>    std::valarray&lt;std::valarray&lt;double&gt;&gt; X = {{-4, 4, 2, 0, -3},</div>
 <div class="line"><span class="lineno">  212</span>                                              {4, -4, 4, -3, -1},</div>
 <div class="line"><span class="lineno">  213</span>                                              {2, 4, 4, 3, -3},</div>
 <div class="line"><span class="lineno">  214</span>                                              {0, -3, 3, -1, -3},</div>
@@ -446,32 +454,27 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  216</span>    <span class="keywordtype">double</span> y[] = {9.27648, -9.26948, 2.0181, -1.03516,</div>
 <div class="line"><span class="lineno">  217</span>                  -5.98994};  <span class="comment">// corresponding y-values</span></div>
 <div class="line"><span class="lineno">  218</span> </div>
-<div class="line"><span class="lineno">  219</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;------- Test 2 -------&quot;</span> &lt;&lt; <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">  220</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt;double&gt;</a> eig_vals = <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc">qr_algorithm::eigen_values</a>(&amp;X);</div>
+<div class="line"><span class="lineno">  219</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 2 -------&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  220</span>    std::valarray&lt;double&gt; eig_vals = <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc">qr_algorithm::eigen_values</a>(&amp;X);</div>
 <div class="line"><span class="lineno">  221</span> </div>
-<div class="line"><span class="lineno">  222</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; X &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span></div>
+<div class="line"><span class="lineno">  222</span>    std::cout &lt;&lt; X &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span></div>
 <div class="line"><span class="lineno">  223</span>              &lt;&lt; <span class="stringliteral">&quot;Eigen values: &quot;</span> &lt;&lt; eig_vals &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  224</span> </div>
 <div class="line"><span class="lineno">  225</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 5; i++) {</div>
-<div class="line"><span class="lineno">  226</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i + 1 &lt;&lt; <span class="stringliteral">&quot;/5 Checking for &quot;</span> &lt;&lt; y[i] &lt;&lt; <span class="stringliteral">&quot; --&gt; &quot;</span>;</div>
+<div class="line"><span class="lineno">  226</span>        std::cout &lt;&lt; i + 1 &lt;&lt; <span class="stringliteral">&quot;/5 Checking for &quot;</span> &lt;&lt; y[i] &lt;&lt; <span class="stringliteral">&quot; --&gt; &quot;</span>;</div>
 <div class="line"><span class="lineno">  227</span>        <span class="keywordtype">bool</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  228</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; 5 &amp;&amp; !<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>; j++) {</div>
 <div class="line"><span class="lineno">  229</span>            <span class="keywordflow">if</span> (std::abs(y[i] - eig_vals[j]) &lt; 0.1) {</div>
 <div class="line"><span class="lineno">  230</span>                <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <span class="keyword">true</span>;</div>
-<div class="line"><span class="lineno">  231</span>                <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; eig_vals[j] &lt;&lt; <span class="stringliteral">&quot;) &quot;</span>;</div>
+<div class="line"><span class="lineno">  231</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; eig_vals[j] &lt;&lt; <span class="stringliteral">&quot;) &quot;</span>;</div>
 <div class="line"><span class="lineno">  232</span>            }</div>
 <div class="line"><span class="lineno">  233</span>        }</div>
 <div class="line"><span class="lineno">  234</span>        assert(result);  <span class="comment">// ensure that i^th expected eigen value was computed</span></div>
-<div class="line"><span class="lineno">  235</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;found\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  235</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;found\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  236</span>    }</div>
-<div class="line"><span class="lineno">  237</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  237</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed\n\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  238</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg" width="100%" height="388"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
deleted file mode 100644
index eb14f666a..000000000
--- a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map
+++ /dev/null
@@ -1,20 +0,0 @@
-<map id="test2" name="test2">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,59,56,84"/>
-<area shape="rect" id="Node000002" href="$d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc" title=" " alt="" coords="104,22,235,62"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,64,88,57,89,62,57,69"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="134,87,205,112"/>
-<area shape="poly" id="edge9_Node000001_Node000009" title=" " alt="" coords="57,74,119,87,118,92,56,79"/>
-<area shape="rect" id="Node000003" href="$de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae" title=" " alt="" coords="340,5,411,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="235,32,325,21,325,27,235,37"/>
-<area shape="rect" id="Node000004" href="$d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1" title=" " alt="" coords="283,55,468,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="235,48,268,52,267,57,235,53"/>
-<area shape="rect" id="Node000005" href="$d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f" title=" " alt="" coords="516,29,685,55"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="468,54,501,51,501,56,469,60"/>
-<area shape="rect" id="Node000008" href="$d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc" title=" " alt="" coords="518,79,683,104"/>
-<area shape="poly" id="edge7_Node000004_Node000008" title=" " alt="" coords="469,75,503,78,502,84,468,80"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="779,29,848,55"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="685,40,763,40,763,45,685,45"/>
-<area shape="rect" id="Node000007" href="$d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" title=" " alt="" coords="733,79,894,104"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="660,53,741,72,739,77,659,58"/>
-<area shape="poly" id="edge8_Node000008_Node000007" title=" " alt="" coords="683,89,717,89,717,94,683,94"/>
-</map>
diff --git a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
deleted file mode 100644
index 15a0ec6ab..000000000
--- a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f59cea11e5cbb6d520cc654b2095871e
\ No newline at end of file
diff --git a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
deleted file mode 100644
index 8c2f128e4..000000000
--- a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
+++ /dev/null
@@ -1,258 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<!--zoomable 88 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 675;
-var viewHeight = 88;
-var sectionId = 'dynsection-4';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-40.25 0,-40.25 0,-21 37.75,-21 37.75,-40.25"/>
-<text text-anchor="middle" x="18.88" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="172.25,-67.88 73.75,-67.88 73.75,-37.38 172.25,-37.38 172.25,-67.88"/>
-<text text-anchor="start" x="81.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::eigen</text>
-<text text-anchor="middle" x="123" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_values</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.13,-34.56C45.15,-36.07 53.61,-37.89 62.41,-39.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.67,-43.21 72.18,-41.89 63.14,-36.37 61.67,-43.21"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149.75,-19.25 96.25,-19.25 96.25,0 149.75,0 149.75,-19.25"/>
-<text text-anchor="middle" x="123" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.13,-26.87C51.06,-24.21 68.85,-20.55 84.72,-17.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.27,-20.75 94.36,-15.31 83.86,-13.89 85.27,-20.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.5,-80.25 251,-80.25 251,-61 304.5,-61 304.5,-80.25"/>
-<text text-anchor="middle" x="277.75" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.33,-58.32C194.1,-60.89 219.41,-63.87 239.65,-66.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.08,-69.71 249.42,-67.4 239.9,-62.76 239.08,-69.71"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="347.25,-43.25 208.25,-43.25 208.25,-24 347.25,-24 347.25,-43.25"/>
-<text text-anchor="middle" x="277.75" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::qr_decompose</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.33,-46.61C180.08,-45.65 188.28,-44.63 196.54,-43.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.81,-47.1 206.3,-42.39 195.95,-40.15 196.81,-47.1"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="509.5,-62.25 383.25,-62.25 383.25,-43 509.5,-43 509.5,-62.25"/>
-<text text-anchor="middle" x="446.38" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_mag</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M347.48,-41.46C355.47,-42.37 363.63,-43.3 371.68,-44.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="371.1,-47.68 381.44,-45.33 371.9,-40.72 371.1,-47.68"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="508,-25.25 384.75,-25.25 384.75,-6 508,-6 508,-25.25"/>
-<text text-anchor="middle" x="446.38" y="-11.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_proj</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M347.48,-26.2C355.87,-25.29 364.45,-24.37 372.89,-23.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="373.19,-26.94 382.76,-22.39 372.44,-19.98 373.19,-26.94"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="632,-62.25 580,-62.25 580,-43 632,-43 632,-62.25"/>
-<text text-anchor="middle" x="606" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M509.67,-52.62C529.53,-52.62 550.85,-52.62 568.28,-52.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="568.15,-56.13 578.15,-52.63 568.15,-49.13 568.15,-56.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="666.5,-25.25 545.5,-25.25 545.5,-6 666.5,-6 666.5,-25.25"/>
-<text text-anchor="middle" x="606" y="-11.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_dot</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M490.45,-42.51C509.13,-38.13 531.2,-32.95 550.97,-28.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="551.57,-31.76 560.51,-26.07 549.97,-24.95 551.57,-31.76"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge8_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge8_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M508.32,-15.62C516.66,-15.62 525.28,-15.62 533.78,-15.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.74,-19.13 543.74,-15.63 533.74,-12.13 533.74,-19.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
deleted file mode 100644
index 1ff16b6a8..000000000
--- a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
+++ /dev/null
@@ -1,175 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="675pt" height="88pt"
- viewBox="0.00 0.00 674.50 88.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 84.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-40.25 0,-40.25 0,-21 37.75,-21 37.75,-40.25"/>
-<text text-anchor="middle" x="18.88" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="172.25,-67.88 73.75,-67.88 73.75,-37.38 172.25,-37.38 172.25,-67.88"/>
-<text text-anchor="start" x="81.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::eigen</text>
-<text text-anchor="middle" x="123" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_values</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.13,-34.56C45.15,-36.07 53.61,-37.89 62.41,-39.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.67,-43.21 72.18,-41.89 63.14,-36.37 61.67,-43.21"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149.75,-19.25 96.25,-19.25 96.25,0 149.75,0 149.75,-19.25"/>
-<text text-anchor="middle" x="123" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.13,-26.87C51.06,-24.21 68.85,-20.55 84.72,-17.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.27,-20.75 94.36,-15.31 83.86,-13.89 85.27,-20.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.5,-80.25 251,-80.25 251,-61 304.5,-61 304.5,-80.25"/>
-<text text-anchor="middle" x="277.75" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.33,-58.32C194.1,-60.89 219.41,-63.87 239.65,-66.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.08,-69.71 249.42,-67.4 239.9,-62.76 239.08,-69.71"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="347.25,-43.25 208.25,-43.25 208.25,-24 347.25,-24 347.25,-43.25"/>
-<text text-anchor="middle" x="277.75" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::qr_decompose</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.33,-46.61C180.08,-45.65 188.28,-44.63 196.54,-43.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.81,-47.1 206.3,-42.39 195.95,-40.15 196.81,-47.1"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="509.5,-62.25 383.25,-62.25 383.25,-43 509.5,-43 509.5,-62.25"/>
-<text text-anchor="middle" x="446.38" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_mag</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M347.48,-41.46C355.47,-42.37 363.63,-43.3 371.68,-44.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="371.1,-47.68 381.44,-45.33 371.9,-40.72 371.1,-47.68"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="508,-25.25 384.75,-25.25 384.75,-6 508,-6 508,-25.25"/>
-<text text-anchor="middle" x="446.38" y="-11.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_proj</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M347.48,-26.2C355.87,-25.29 364.45,-24.37 372.89,-23.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="373.19,-26.94 382.76,-22.39 372.44,-19.98 373.19,-26.94"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="632,-62.25 580,-62.25 580,-43 632,-43 632,-62.25"/>
-<text text-anchor="middle" x="606" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M509.67,-52.62C529.53,-52.62 550.85,-52.62 568.28,-52.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="568.15,-56.13 578.15,-52.63 568.15,-49.13 568.15,-56.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="666.5,-25.25 545.5,-25.25 545.5,-6 666.5,-6 666.5,-25.25"/>
-<text text-anchor="middle" x="606" y="-11.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_dot</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M490.45,-42.51C509.13,-38.13 531.2,-32.95 550.97,-28.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="551.57,-31.76 560.51,-26.07 549.97,-24.95 551.57,-31.76"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge8_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge8_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M508.32,-15.62C516.66,-15.62 525.28,-15.62 533.78,-15.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.74,-19.13 543.74,-15.63 533.74,-12.13 533.74,-19.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
deleted file mode 100644
index 1ed82a093..000000000
--- a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map
+++ /dev/null
@@ -1,20 +0,0 @@
-<map id="test1" name="test1">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,59,56,84"/>
-<area shape="rect" id="Node000002" href="$d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc" title=" " alt="" coords="104,22,235,62"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,64,88,57,89,62,57,69"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="134,87,205,112"/>
-<area shape="poly" id="edge9_Node000001_Node000009" title=" " alt="" coords="57,74,119,87,118,92,56,79"/>
-<area shape="rect" id="Node000003" href="$de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae" title=" " alt="" coords="340,5,411,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="235,32,325,21,325,27,235,37"/>
-<area shape="rect" id="Node000004" href="$d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1" title=" " alt="" coords="283,55,468,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="235,48,268,52,267,57,235,53"/>
-<area shape="rect" id="Node000005" href="$d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f" title=" " alt="" coords="516,29,685,55"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="468,54,501,51,501,56,469,60"/>
-<area shape="rect" id="Node000008" href="$d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc" title=" " alt="" coords="518,79,683,104"/>
-<area shape="poly" id="edge7_Node000004_Node000008" title=" " alt="" coords="469,75,503,78,502,84,468,80"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="779,29,848,55"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="685,40,763,40,763,45,685,45"/>
-<area shape="rect" id="Node000007" href="$d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" title=" " alt="" coords="733,79,894,104"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="660,53,741,72,739,77,659,58"/>
-<area shape="poly" id="edge8_Node000008_Node000007" title=" " alt="" coords="683,89,717,89,717,94,683,94"/>
-</map>
diff --git a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
deleted file mode 100644
index 0795abc1c..000000000
--- a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-82b96e201f101c1f6837004774113e6b
\ No newline at end of file
diff --git a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
deleted file mode 100644
index 07fcae492..000000000
--- a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
+++ /dev/null
@@ -1,258 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<!--zoomable 88 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 675;
-var viewHeight = 88;
-var sectionId = 'dynsection-3';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-40.25 0,-40.25 0,-21 37.75,-21 37.75,-40.25"/>
-<text text-anchor="middle" x="18.88" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="172.25,-67.88 73.75,-67.88 73.75,-37.38 172.25,-37.38 172.25,-67.88"/>
-<text text-anchor="start" x="81.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::eigen</text>
-<text text-anchor="middle" x="123" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_values</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.13,-34.56C45.15,-36.07 53.61,-37.89 62.41,-39.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.67,-43.21 72.18,-41.89 63.14,-36.37 61.67,-43.21"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149.75,-19.25 96.25,-19.25 96.25,0 149.75,0 149.75,-19.25"/>
-<text text-anchor="middle" x="123" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.13,-26.87C51.06,-24.21 68.85,-20.55 84.72,-17.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.27,-20.75 94.36,-15.31 83.86,-13.89 85.27,-20.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.5,-80.25 251,-80.25 251,-61 304.5,-61 304.5,-80.25"/>
-<text text-anchor="middle" x="277.75" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.33,-58.32C194.1,-60.89 219.41,-63.87 239.65,-66.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.08,-69.71 249.42,-67.4 239.9,-62.76 239.08,-69.71"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="347.25,-43.25 208.25,-43.25 208.25,-24 347.25,-24 347.25,-43.25"/>
-<text text-anchor="middle" x="277.75" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::qr_decompose</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.33,-46.61C180.08,-45.65 188.28,-44.63 196.54,-43.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.81,-47.1 206.3,-42.39 195.95,-40.15 196.81,-47.1"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="509.5,-62.25 383.25,-62.25 383.25,-43 509.5,-43 509.5,-62.25"/>
-<text text-anchor="middle" x="446.38" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_mag</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M347.48,-41.46C355.47,-42.37 363.63,-43.3 371.68,-44.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="371.1,-47.68 381.44,-45.33 371.9,-40.72 371.1,-47.68"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="508,-25.25 384.75,-25.25 384.75,-6 508,-6 508,-25.25"/>
-<text text-anchor="middle" x="446.38" y="-11.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_proj</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M347.48,-26.2C355.87,-25.29 364.45,-24.37 372.89,-23.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="373.19,-26.94 382.76,-22.39 372.44,-19.98 373.19,-26.94"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="632,-62.25 580,-62.25 580,-43 632,-43 632,-62.25"/>
-<text text-anchor="middle" x="606" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M509.67,-52.62C529.53,-52.62 550.85,-52.62 568.28,-52.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="568.15,-56.13 578.15,-52.63 568.15,-49.13 568.15,-56.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="666.5,-25.25 545.5,-25.25 545.5,-6 666.5,-6 666.5,-25.25"/>
-<text text-anchor="middle" x="606" y="-11.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_dot</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M490.45,-42.51C509.13,-38.13 531.2,-32.95 550.97,-28.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="551.57,-31.76 560.51,-26.07 549.97,-24.95 551.57,-31.76"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge8_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge8_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M508.32,-15.62C516.66,-15.62 525.28,-15.62 533.78,-15.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.74,-19.13 543.74,-15.63 533.74,-12.13 533.74,-19.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
deleted file mode 100644
index 4be5d673e..000000000
--- a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg
+++ /dev/null
@@ -1,175 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="675pt" height="88pt"
- viewBox="0.00 0.00 674.50 88.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 84.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-40.25 0,-40.25 0,-21 37.75,-21 37.75,-40.25"/>
-<text text-anchor="middle" x="18.88" y="-26.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="172.25,-67.88 73.75,-67.88 73.75,-37.38 172.25,-37.38 172.25,-67.88"/>
-<text text-anchor="start" x="81.75" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::eigen</text>
-<text text-anchor="middle" x="123" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_values</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.13,-34.56C45.15,-36.07 53.61,-37.89 62.41,-39.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.67,-43.21 72.18,-41.89 63.14,-36.37 61.67,-43.21"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149.75,-19.25 96.25,-19.25 96.25,0 149.75,0 149.75,-19.25"/>
-<text text-anchor="middle" x="123" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge9_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge9_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.13,-26.87C51.06,-24.21 68.85,-20.55 84.72,-17.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.27,-20.75 94.36,-15.31 83.86,-13.89 85.27,-20.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="304.5,-80.25 251,-80.25 251,-61 304.5,-61 304.5,-80.25"/>
-<text text-anchor="middle" x="277.75" y="-66.75" font-family="Helvetica,sans-Serif" font-size="10.00">mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.33,-58.32C194.1,-60.89 219.41,-63.87 239.65,-66.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.08,-69.71 249.42,-67.4 239.9,-62.76 239.08,-69.71"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="347.25,-43.25 208.25,-43.25 208.25,-24 347.25,-24 347.25,-43.25"/>
-<text text-anchor="middle" x="277.75" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::qr_decompose</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M172.33,-46.61C180.08,-45.65 188.28,-44.63 196.54,-43.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.81,-47.1 206.3,-42.39 195.95,-40.15 196.81,-47.1"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="509.5,-62.25 383.25,-62.25 383.25,-43 509.5,-43 509.5,-62.25"/>
-<text text-anchor="middle" x="446.38" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_mag</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M347.48,-41.46C355.47,-42.37 363.63,-43.3 371.68,-44.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="371.1,-47.68 381.44,-45.33 371.9,-40.72 371.1,-47.68"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="508,-25.25 384.75,-25.25 384.75,-6 508,-6 508,-25.25"/>
-<text text-anchor="middle" x="446.38" y="-11.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_proj</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M347.48,-26.2C355.87,-25.29 364.45,-24.37 372.89,-23.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="373.19,-26.94 382.76,-22.39 372.44,-19.98 373.19,-26.94"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="632,-62.25 580,-62.25 580,-43 632,-43 632,-62.25"/>
-<text text-anchor="middle" x="606" y="-48.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M509.67,-52.62C529.53,-52.62 550.85,-52.62 568.28,-52.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="568.15,-56.13 578.15,-52.63 568.15,-49.13 568.15,-56.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="666.5,-25.25 545.5,-25.25 545.5,-6 666.5,-6 666.5,-25.25"/>
-<text text-anchor="middle" x="606" y="-11.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_dot</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M490.45,-42.51C509.13,-38.13 531.2,-32.95 550.97,-28.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="551.57,-31.76 560.51,-26.07 549.97,-24.95 551.57,-31.76"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node7 -->
-<g id="edge8_Node000008_Node000007" class="edge">
-<title>Node8&#45;&gt;Node7</title>
-<g id="a_edge8_Node000008_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M508.32,-15.62C516.66,-15.62 525.28,-15.62 533.78,-15.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="533.74,-19.13 543.74,-15.63 533.74,-12.13 533.74,-19.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
deleted file mode 100644
index 7c3855f17..000000000
--- a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
+++ /dev/null
@@ -1,35 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,132,55,158"/>
-<area shape="rect" id="Node000002" href="$de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d" title=" " alt="" coords="103,5,203,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="37,130,63,91,101,48,113,38,117,42,105,52,67,95,42,133"/>
-<area shape="rect" id="Node000004" href="$d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc" title=" " alt="" coords="251,91,382,132"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="43,129,69,109,102,92,135,84,170,82,236,88,236,93,170,87,136,90,104,97,72,113,46,134"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="113,205,192,231"/>
-<area shape="poly" id="edge11_Node000001_Node000011" title=" " alt="" coords="51,156,104,192,111,196,108,200,101,196,48,160"/>
-<area shape="rect" id="Node000012" href="$de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" title=" " alt="" coords="128,107,178,132"/>
-<area shape="poly" id="edge12_Node000001_Node000012" title=" " alt="" coords="55,137,112,125,113,130,56,142"/>
-<area shape="rect" id="Node000014" href="$de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0" title=" " alt="" coords="128,156,178,182"/>
-<area shape="poly" id="edge15_Node000001_Node000014" title=" " alt="" coords="56,147,113,158,112,164,55,152"/>
-<area shape="rect" id="Node000015" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="117,255,189,280"/>
-<area shape="poly" id="edge18_Node000001_Node000015" title=" " alt="" coords="40,157,66,198,84,221,104,242,108,244,104,248,101,245,80,224,61,201,36,160"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="280,5,353,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="203,16,265,16,265,21,203,21"/>
-<area shape="rect" id="Node000005" href="$de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae" title=" " alt="" coords="487,75,559,100"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="382,101,472,91,473,96,383,107"/>
-<area shape="rect" id="Node000006" href="$d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1" title=" " alt="" coords="430,124,616,150"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="383,117,415,121,414,126,382,122"/>
-<area shape="rect" id="Node000007" href="$d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f" title=" " alt="" coords="664,99,832,124"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="616,124,648,120,649,125,616,129"/>
-<area shape="rect" id="Node000010" href="$d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc" title=" " alt="" coords="666,148,830,174"/>
-<area shape="poly" id="edge9_Node000006_Node000010" title=" " alt="" coords="616,144,650,148,650,153,616,149"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="926,99,995,124"/>
-<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="832,109,910,109,910,114,832,114"/>
-<area shape="rect" id="Node000009" href="$d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" title=" " alt="" coords="880,148,1041,174"/>
-<area shape="poly" id="edge8_Node000007_Node000009" title=" " alt="" coords="807,122,888,141,887,147,806,128"/>
-<area shape="poly" id="edge10_Node000010_Node000009" title=" " alt="" coords="830,158,864,158,864,164,830,164"/>
-<area shape="poly" id="edge13_Node000012_Node000004" title=" " alt="" coords="179,116,235,113,236,118,179,121"/>
-<area shape="rect" id="Node000013" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="281,156,352,182"/>
-<area shape="poly" id="edge14_Node000012_Node000013" title=" " alt="" coords="179,124,267,151,265,156,178,130"/>
-<area shape="poly" id="edge16_Node000014_Node000004" title=" " alt="" coords="178,158,241,135,243,140,180,163"/>
-<area shape="poly" id="edge17_Node000014_Node000013" title=" " alt="" coords="179,166,265,166,265,172,179,172"/>
-</map>
diff --git a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
deleted file mode 100644
index bb378ae01..000000000
--- a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8c7c14997cb9918f91a4a0bb4ce9ee3d
\ No newline at end of file
diff --git a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
deleted file mode 100644
index 83e4842fd..000000000
--- a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
+++ /dev/null
@@ -1,393 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 214 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 785;
-var viewHeight = 214;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-111.25 0,-111.25 0,-92 37,-92 37,-111.25"/>
-<text text-anchor="middle" x="18.5" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="148.25,-206.25 73,-206.25 73,-187 148.25,-187 148.25,-206.25"/>
-<text text-anchor="middle" x="110.62" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_matrix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.48,-111.66C34.51,-126.25 52.72,-153.64 73,-172.62 75.86,-175.3 79.06,-177.88 82.33,-180.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.08,-182.98 90.33,-185.69 84.01,-177.19 80.08,-182.98"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282.75,-141.88 184.25,-141.88 184.25,-111.38 282.75,-111.38 282.75,-141.88"/>
-<text text-anchor="start" x="192.25" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::eigen</text>
-<text text-anchor="middle" x="233.5" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">_values</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.48,-111.66C39.49,-120.96 55.85,-134.15 73,-139.62 105.06,-149.85 142.49,-147.49 173.03,-142.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.29,-145.68 182.46,-140.37 171.98,-138.8 173.29,-145.68"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="140.38,-56.25 80.88,-56.25 80.88,-37 140.38,-37 140.38,-56.25"/>
-<text text-anchor="middle" x="110.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge11_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge11_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.77,-91.63C43.38,-83.83 58.78,-72.97 73,-64.62 74.64,-63.66 76.33,-62.71 78.06,-61.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.44,-64.99 86.7,-57.27 76.21,-58.78 79.44,-64.99"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.5,-130.25 91.75,-130.25 91.75,-111 129.5,-111 129.5,-130.25"/>
-<text text-anchor="middle" x="110.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge12_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge12_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-105.38C49.57,-107.96 66.15,-111.46 80.34,-114.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.56,-117.86 90.07,-116.5 81,-111.01 79.56,-117.86"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.5,-93.25 91.75,-93.25 91.75,-74 129.5,-74 129.5,-93.25"/>
-<text text-anchor="middle" x="110.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node14 -->
-<g id="edge15_Node000001_Node000014" class="edge">
-<title>Node1&#45;&gt;Node14</title>
-<g id="a_edge15_Node000001_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-98.07C49.57,-95.62 66.15,-92.31 80.34,-89.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.94,-92.92 90.06,-87.53 79.57,-86.06 80.94,-92.92"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="137.75,-19.25 83.5,-19.25 83.5,0 137.75,0 137.75,-19.25"/>
-<text text-anchor="middle" x="110.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node15 -->
-<g id="edge18_Node000001_Node000015" class="edge">
-<title>Node1&#45;&gt;Node15</title>
-<g id="a_edge18_Node000001_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.66,-91.57C33.02,-76.11 50.83,-46.33 73,-27.62 73.78,-26.97 74.59,-26.32 75.42,-25.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.09,-28.78 83.67,-20.48 73.35,-22.87 77.09,-28.78"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.62,-206.25 206.38,-206.25 206.38,-187 260.62,-187 260.62,-206.25"/>
-<text text-anchor="middle" x="233.5" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.55,-196.62C163.23,-196.62 180.11,-196.62 194.86,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.64,-200.13 204.64,-196.63 194.64,-193.13 194.64,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415,-154.25 361.5,-154.25 361.5,-135 415,-135 415,-154.25"/>
-<text text-anchor="middle" x="388.25" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.83,-132.32C304.6,-134.89 329.91,-137.87 350.15,-140.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="349.58,-143.71 359.92,-141.4 350.4,-136.76 349.58,-143.71"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="457.75,-117.25 318.75,-117.25 318.75,-98 457.75,-98 457.75,-117.25"/>
-<text text-anchor="middle" x="388.25" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::qr_decompose</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.83,-120.61C290.58,-119.65 298.78,-118.63 307.04,-117.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.31,-121.1 316.8,-116.39 306.45,-114.15 307.31,-121.1"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="620,-136.25 493.75,-136.25 493.75,-117 620,-117 620,-136.25"/>
-<text text-anchor="middle" x="556.88" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_mag</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M457.98,-115.46C465.97,-116.37 474.13,-117.3 482.18,-118.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.6,-121.68 491.94,-119.33 482.4,-114.72 481.6,-121.68"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="618.5,-99.25 495.25,-99.25 495.25,-80 618.5,-80 618.5,-99.25"/>
-<text text-anchor="middle" x="556.88" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_proj</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge9_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge9_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M457.98,-100.2C466.37,-99.29 474.95,-98.37 483.39,-97.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="483.69,-100.94 493.26,-96.39 482.94,-93.98 483.69,-100.94"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="742.5,-136.25 690.5,-136.25 690.5,-117 742.5,-117 742.5,-136.25"/>
-<text text-anchor="middle" x="716.5" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M620.17,-126.62C640.03,-126.62 661.35,-126.62 678.78,-126.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="678.65,-130.13 688.65,-126.63 678.65,-123.13 678.65,-130.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="777,-99.25 656,-99.25 656,-80 777,-80 777,-99.25"/>
-<text text-anchor="middle" x="716.5" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_dot</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M600.95,-116.51C619.63,-112.13 641.7,-106.95 661.47,-102.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="662.07,-105.76 671.01,-100.07 660.47,-98.95 662.07,-105.76"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node9 -->
-<g id="edge10_Node000010_Node000009" class="edge">
-<title>Node10&#45;&gt;Node9</title>
-<g id="a_edge10_Node000010_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M618.82,-89.62C627.16,-89.62 635.78,-89.62 644.28,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="644.24,-93.13 654.24,-89.63 644.24,-86.13 644.24,-93.13"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node4 -->
-<g id="edge13_Node000012_Node000004" class="edge">
-<title>Node12&#45;&gt;Node4</title>
-<g id="a_edge13_Node000012_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.98,-121.54C141.52,-122.11 157.11,-122.88 172.65,-123.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.22,-127.14 182.38,-124.14 172.57,-120.15 172.22,-127.14"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.25,-93.25 206.75,-93.25 206.75,-74 260.25,-74 260.25,-93.25"/>
-<text text-anchor="middle" x="233.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge14_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge14_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.98,-115.01C147.31,-109.7 173.78,-101.6 195.49,-94.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.35,-98.35 204.89,-92.08 194.3,-91.66 196.35,-98.35"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node4 -->
-<g id="edge16_Node000014_Node000004" class="edge">
-<title>Node14&#45;&gt;Node4</title>
-<g id="a_edge16_Node000014_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.98,-90.16C142.78,-94.71 160.58,-101.04 177.75,-107.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.3,-110.35 186.89,-110.4 178.64,-103.75 176.3,-110.35"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node13 -->
-<g id="edge17_Node000014_Node000013" class="edge">
-<title>Node14&#45;&gt;Node13</title>
-<g id="a_edge17_Node000014_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.98,-83.62C147.15,-83.62 173.3,-83.62 194.89,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.82,-87.13 204.82,-83.63 194.82,-80.13 194.82,-87.13"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
deleted file mode 100644
index 11b608e25..000000000
--- a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
+++ /dev/null
@@ -1,310 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="785pt" height="214pt"
- viewBox="0.00 0.00 785.00 214.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 210.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-111.25 0,-111.25 0,-92 37,-92 37,-111.25"/>
-<text text-anchor="middle" x="18.5" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="148.25,-206.25 73,-206.25 73,-187 148.25,-187 148.25,-206.25"/>
-<text text-anchor="middle" x="110.62" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_matrix</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.48,-111.66C34.51,-126.25 52.72,-153.64 73,-172.62 75.86,-175.3 79.06,-177.88 82.33,-180.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.08,-182.98 90.33,-185.69 84.01,-177.19 80.08,-182.98"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="282.75,-141.88 184.25,-141.88 184.25,-111.38 282.75,-111.38 282.75,-141.88"/>
-<text text-anchor="start" x="192.25" y="-128.38" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::eigen</text>
-<text text-anchor="middle" x="233.5" y="-117.12" font-family="Helvetica,sans-Serif" font-size="10.00">_values</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.48,-111.66C39.49,-120.96 55.85,-134.15 73,-139.62 105.06,-149.85 142.49,-147.49 173.03,-142.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.29,-145.68 182.46,-140.37 171.98,-138.8 173.29,-145.68"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="140.38,-56.25 80.88,-56.25 80.88,-37 140.38,-37 140.38,-56.25"/>
-<text text-anchor="middle" x="110.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge11_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge11_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.77,-91.63C43.38,-83.83 58.78,-72.97 73,-64.62 74.64,-63.66 76.33,-62.71 78.06,-61.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.44,-64.99 86.7,-57.27 76.21,-58.78 79.44,-64.99"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.5,-130.25 91.75,-130.25 91.75,-111 129.5,-111 129.5,-130.25"/>
-<text text-anchor="middle" x="110.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge12_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge12_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-105.38C49.57,-107.96 66.15,-111.46 80.34,-114.45"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.56,-117.86 90.07,-116.5 81,-111.01 79.56,-117.86"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.5,-93.25 91.75,-93.25 91.75,-74 129.5,-74 129.5,-93.25"/>
-<text text-anchor="middle" x="110.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node14 -->
-<g id="edge15_Node000001_Node000014" class="edge">
-<title>Node1&#45;&gt;Node14</title>
-<g id="a_edge15_Node000001_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-98.07C49.57,-95.62 66.15,-92.31 80.34,-89.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.94,-92.92 90.06,-87.53 79.57,-86.06 80.94,-92.92"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="137.75,-19.25 83.5,-19.25 83.5,0 137.75,0 137.75,-19.25"/>
-<text text-anchor="middle" x="110.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node15 -->
-<g id="edge18_Node000001_Node000015" class="edge">
-<title>Node1&#45;&gt;Node15</title>
-<g id="a_edge18_Node000001_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.66,-91.57C33.02,-76.11 50.83,-46.33 73,-27.62 73.78,-26.97 74.59,-26.32 75.42,-25.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.09,-28.78 83.67,-20.48 73.35,-22.87 77.09,-28.78"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.62,-206.25 206.38,-206.25 206.38,-187 260.62,-187 260.62,-206.25"/>
-<text text-anchor="middle" x="233.5" y="-192.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M148.55,-196.62C163.23,-196.62 180.11,-196.62 194.86,-196.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.64,-200.13 204.64,-196.63 194.64,-193.13 194.64,-200.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415,-154.25 361.5,-154.25 361.5,-135 415,-135 415,-154.25"/>
-<text text-anchor="middle" x="388.25" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">mat_mul</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.83,-132.32C304.6,-134.89 329.91,-137.87 350.15,-140.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="349.58,-143.71 359.92,-141.4 350.4,-136.76 349.58,-143.71"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="457.75,-117.25 318.75,-117.25 318.75,-98 457.75,-98 457.75,-117.25"/>
-<text text-anchor="middle" x="388.25" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::qr_decompose</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.83,-120.61C290.58,-119.65 298.78,-118.63 307.04,-117.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="307.31,-121.1 316.8,-116.39 306.45,-114.15 307.31,-121.1"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="620,-136.25 493.75,-136.25 493.75,-117 620,-117 620,-136.25"/>
-<text text-anchor="middle" x="556.88" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_mag</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M457.98,-115.46C465.97,-116.37 474.13,-117.3 482.18,-118.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="481.6,-121.68 491.94,-119.33 482.4,-114.72 481.6,-121.68"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="618.5,-99.25 495.25,-99.25 495.25,-80 618.5,-80 618.5,-99.25"/>
-<text text-anchor="middle" x="556.88" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_proj</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge9_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge9_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M457.98,-100.2C466.37,-99.29 474.95,-98.37 483.39,-97.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="483.69,-100.94 493.26,-96.39 482.94,-93.98 483.69,-100.94"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="742.5,-136.25 690.5,-136.25 690.5,-117 742.5,-117 742.5,-136.25"/>
-<text text-anchor="middle" x="716.5" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M620.17,-126.62C640.03,-126.62 661.35,-126.62 678.78,-126.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="678.65,-130.13 688.65,-126.63 678.65,-123.13 678.65,-130.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="777,-99.25 656,-99.25 656,-80 777,-80 777,-99.25"/>
-<text text-anchor="middle" x="716.5" y="-85.75" font-family="Helvetica,sans-Serif" font-size="10.00">qr_algorithm::vector_dot</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M600.95,-116.51C619.63,-112.13 641.7,-106.95 661.47,-102.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="662.07,-105.76 671.01,-100.07 660.47,-98.95 662.07,-105.76"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node9 -->
-<g id="edge10_Node000010_Node000009" class="edge">
-<title>Node10&#45;&gt;Node9</title>
-<g id="a_edge10_Node000010_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M618.82,-89.62C627.16,-89.62 635.78,-89.62 644.28,-89.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="644.24,-93.13 654.24,-89.63 644.24,-86.13 644.24,-93.13"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node4 -->
-<g id="edge13_Node000012_Node000004" class="edge">
-<title>Node12&#45;&gt;Node4</title>
-<g id="a_edge13_Node000012_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.98,-121.54C141.52,-122.11 157.11,-122.88 172.65,-123.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="172.22,-127.14 182.38,-124.14 172.57,-120.15 172.22,-127.14"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260.25,-93.25 206.75,-93.25 206.75,-74 260.25,-74 260.25,-93.25"/>
-<text text-anchor="middle" x="233.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge14_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge14_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.98,-115.01C147.31,-109.7 173.78,-101.6 195.49,-94.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.35,-98.35 204.89,-92.08 194.3,-91.66 196.35,-98.35"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node4 -->
-<g id="edge16_Node000014_Node000004" class="edge">
-<title>Node14&#45;&gt;Node4</title>
-<g id="a_edge16_Node000014_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.98,-90.16C142.78,-94.71 160.58,-101.04 177.75,-107.15"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.3,-110.35 186.89,-110.4 178.64,-103.75 176.3,-110.35"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node13 -->
-<g id="edge17_Node000014_Node000013" class="edge">
-<title>Node14&#45;&gt;Node13</title>
-<g id="a_edge17_Node000014_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M129.98,-83.62C147.15,-83.62 173.3,-83.62 194.89,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.82,-87.13 204.82,-83.63 194.82,-80.13 194.82,-87.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d75/qr__eigen__values_8cpp_a9bbf469d5525a816b0d6ca812119093d_cgraph.map b/de/d75/qr__eigen__values_8cpp_a9bbf469d5525a816b0d6ca812119093d_cgraph.map
deleted file mode 100644
index 4d57be389..000000000
--- a/de/d75/qr__eigen__values_8cpp_a9bbf469d5525a816b0d6ca812119093d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="create_matrix" name="create_matrix">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,106,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="154,5,226,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="106,16,138,16,138,21,106,21"/>
-</map>
diff --git a/de/d75/qr__eigen__values_8cpp_a9bbf469d5525a816b0d6ca812119093d_cgraph.md5 b/de/d75/qr__eigen__values_8cpp_a9bbf469d5525a816b0d6ca812119093d_cgraph.md5
deleted file mode 100644
index c40eee62a..000000000
--- a/de/d75/qr__eigen__values_8cpp_a9bbf469d5525a816b0d6ca812119093d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-62794838fd2c4f12bc0bb5fd97ea8c65
\ No newline at end of file
diff --git a/de/d75/qr__eigen__values_8cpp_a9bbf469d5525a816b0d6ca812119093d_cgraph.svg b/de/d75/qr__eigen__values_8cpp_a9bbf469d5525a816b0d6ca812119093d_cgraph.svg
deleted file mode 100644
index d1a912895..000000000
--- a/de/d75/qr__eigen__values_8cpp_a9bbf469d5525a816b0d6ca812119093d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: create_matrix Pages: 1 -->
-<svg width="174pt" height="27pt"
- viewBox="0.00 0.00 173.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>create_matrix</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="75.25,-19.25 0,-19.25 0,0 75.25,0 75.25,-19.25"/>
-<text text-anchor="middle" x="37.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_matrix</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.5,-19.25 111.25,-19.25 111.25,0 165.5,0 165.5,-19.25"/>
-<text text-anchor="middle" x="138.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.68,-9.62C83.45,-9.62 91.67,-9.62 99.48,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.39,-13.13 109.39,-9.63 99.39,-6.13 99.39,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d75/qr__eigen__values_8cpp_a9bbf469d5525a816b0d6ca812119093d_cgraph_org.svg b/de/d75/qr__eigen__values_8cpp_a9bbf469d5525a816b0d6ca812119093d_cgraph_org.svg
deleted file mode 100644
index c034307fc..000000000
--- a/de/d75/qr__eigen__values_8cpp_a9bbf469d5525a816b0d6ca812119093d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: create_matrix Pages: 1 -->
-<svg width="174pt" height="27pt"
- viewBox="0.00 0.00 173.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>create_matrix</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="75.25,-19.25 0,-19.25 0,0 75.25,0 75.25,-19.25"/>
-<text text-anchor="middle" x="37.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">create_matrix</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="165.5,-19.25 111.25,-19.25 111.25,0 165.5,0 165.5,-19.25"/>
-<text text-anchor="middle" x="138.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.68,-9.62C83.45,-9.62 91.67,-9.62 99.48,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="99.39,-13.13 109.39,-9.63 99.39,-6.13 99.39,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d75/qr__eigen__values_8cpp_source.html b/de/d75/qr__eigen__values_8cpp_source.html
new file mode 100644
index 000000000..ab2cd34ca
--- /dev/null
+++ b/de/d75/qr__eigen__values_8cpp_source.html
@@ -0,0 +1,379 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/qr_eigen_values.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/d75/qr__eigen__values_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">qr_eigen_values.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/d75/qr__eigen__values_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;cstdlib&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;omp.h&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &quot;<a class="code" href="../../d4/d68/qr__decompose_8h.html">./qr_decompose.h</a>&quot;</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="keyword">using </span>qr_algorithm::operator&lt;&lt;;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"><a class="line" href="../../de/d75/qr__eigen__values_8cpp.html#aee57a411f07599034f5ceb8cc7d65b40">   20</a></span><span class="preprocessor">#define LIMS 9 </span></div>
+<div class="foldopen" id="foldopen00028" data-start="{" data-end="}">
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"><a class="line" href="../../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d">   28</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d">create_matrix</a>(std::valarray&lt;std::valarray&lt;double&gt;&gt; *A) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordtype">int</span> i, j, tmp, lim2 = <a class="code hl_define" href="../../de/d75/qr__eigen__values_8cpp.html#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a> &gt;&gt; 1;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordtype">int</span> N = A-&gt;size();</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#ifdef _OPENMP</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#pragma omp for</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#endif</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordflow">for</span> (i = 0; i &lt; N; i++) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        A[0][i][i] = (std::rand() % <a class="code hl_define" href="../../de/d75/qr__eigen__values_8cpp.html#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a>) - lim2;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        <span class="keywordflow">for</span> (j = i + 1; j &lt; N; j++) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>            tmp = (std::rand() % <a class="code hl_define" href="../../de/d75/qr__eigen__values_8cpp.html#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a>) - lim2;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            A[0][i][j] = tmp;  <span class="comment">// summetrically distribute random values</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>            A[0][j][i] = tmp;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        }</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>}</div>
+</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="foldopen" id="foldopen00054" data-start="{" data-end="}">
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="../../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae">   54</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae">mat_mul</a>(<span class="keyword">const</span> std::valarray&lt;std::valarray&lt;double&gt;&gt; &amp;A,</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>             <span class="keyword">const</span> std::valarray&lt;std::valarray&lt;double&gt;&gt; &amp;B,</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>             std::valarray&lt;std::valarray&lt;double&gt;&gt; *OUT) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordtype">int</span> R1 = A.size();</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordtype">int</span> C1 = A[0].size();</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordtype">int</span> R2 = B.size();</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordtype">int</span> C2 = B[0].size();</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">if</span> (C1 != R2) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        perror(<span class="stringliteral">&quot;Matrix dimensions mismatch!&quot;</span>);</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; R1; i++) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; C2; j++) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            OUT[0][i][j] = 0.f;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; k &lt; C1; k++) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>                OUT[0][i][j] += A[i][k] * B[k][j];</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>            }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        }</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    }</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>}</div>
+</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d2/d3b/namespaceqr__algorithm.html">qr_algorithm</a> {</div>
+<div class="foldopen" id="foldopen00098" data-start="{" data-end="}">
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"><a class="line" href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc">   98</a></span>std::valarray&lt;double&gt; <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc">eigen_values</a>(std::valarray&lt;std::valarray&lt;double&gt;&gt; *A,</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>                                   <span class="keywordtype">bool</span> print_intermediates = <span class="keyword">false</span>) {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="keywordtype">int</span> rows = A-&gt;size();</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <span class="keywordtype">int</span> columns = rows;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="keywordtype">int</span> counter = 0, num_eigs = rows - 1;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <span class="keywordtype">double</span> last_eig = 0;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span> </div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    std::valarray&lt;std::valarray&lt;double&gt;&gt; Q(rows);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    std::valarray&lt;std::valarray&lt;double&gt;&gt; R(columns);</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    <span class="comment">/* number of eigen values = matrix size */</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    std::valarray&lt;double&gt; eigen_vals(rows);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; rows; i++) {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        Q[i] = std::valarray&lt;double&gt;(columns);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        R[i] = std::valarray&lt;double&gt;(columns);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    }</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span> </div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <span class="comment">/* continue till all eigen values are found */</span></div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <span class="keywordflow">while</span> (num_eigs &gt; 0) {</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        <span class="comment">/* iterate with QR decomposition */</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        <span class="keywordflow">while</span> (std::abs(A[0][num_eigs][num_eigs - 1]) &gt;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>               std::numeric_limits&lt;double&gt;::epsilon()) {</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>            <span class="comment">// initial approximation = last diagonal element</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>            last_eig = A[0][num_eigs][num_eigs];</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; rows; i++) {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>                A[0][i][i] -= last_eig; <span class="comment">/* A - cI */</span></div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>            }</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>            <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1">qr_decompose</a>(*A, &amp;Q, &amp;R);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span> </div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>            <span class="keywordflow">if</span> (print_intermediates) {</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>                std::cout &lt;&lt; *A &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>                std::cout &lt;&lt; Q &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>                std::cout &lt;&lt; R &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>                printf(<span class="stringliteral">&quot;-------------------- %d ---------------------\n&quot;</span>,</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>                       ++counter);</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>            }</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span> </div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>            <span class="comment">// new approximation A&#39; = R * Q</span></div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>            <a class="code hl_function" href="../../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae">mat_mul</a>(R, Q, A);</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; rows; i++) {</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>                A[0][i][i] += last_eig; <span class="comment">/* A + cI */</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>            }</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        }</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span> </div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        <span class="comment">/* store the converged eigen value */</span></div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        eigen_vals[num_eigs] = last_eig;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        <span class="comment">// A[0][num_eigs][num_eigs];</span></div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        <span class="keywordflow">if</span> (print_intermediates) {</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;========================\n&quot;</span>;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;Eigen value: &quot;</span> &lt;&lt; last_eig &lt;&lt; <span class="stringliteral">&quot;,\n&quot;</span>;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>            std::cout &lt;&lt; <span class="stringliteral">&quot;========================\n&quot;</span>;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>        }</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span> </div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>        num_eigs--;</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>        rows--;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>        columns--;</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    }</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    eigen_vals[0] = A[0][0][0];</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span> </div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    <span class="keywordflow">if</span> (print_intermediates) {</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>        std::cout &lt;&lt; Q &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        std::cout &lt;&lt; R &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    }</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span> </div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    <span class="keywordflow">return</span> eigen_vals;</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>}</div>
+</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span> </div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>}  <span class="comment">// namespace qr_algorithm</span></div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span> </div>
+<div class="foldopen" id="foldopen00177" data-start="{" data-end="}">
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"><a class="line" href="../../de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">  177</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>() {</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    std::valarray&lt;std::valarray&lt;double&gt;&gt; X = {{5, 7}, {7, 11}};</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    <span class="keywordtype">double</span> y[] = {15.56158, 0.384227};  <span class="comment">// corresponding y-values</span></div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span> </div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 1 -------&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    std::valarray&lt;double&gt; eig_vals = <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc">qr_algorithm::eigen_values</a>(&amp;X);</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span> </div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 2; i++) {</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        std::cout &lt;&lt; i + 1 &lt;&lt; <span class="stringliteral">&quot;/2 Checking for &quot;</span> &lt;&lt; y[i] &lt;&lt; <span class="stringliteral">&quot; --&gt; &quot;</span>;</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        <span class="keywordtype">bool</span> result = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; 2 &amp;&amp; !result; j++) {</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>            <span class="keywordflow">if</span> (std::abs(y[i] - eig_vals[j]) &lt; 0.1) {</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>                result = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; eig_vals[j] &lt;&lt; <span class="stringliteral">&quot;) &quot;</span>;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>            }</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>        }</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        assert(result);  <span class="comment">// ensure that i^th expected eigen value was computed</span></div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;found\n&quot;</span>;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>    }</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed\n\n&quot;</span>;</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>}</div>
+</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span> </div>
+<div class="foldopen" id="foldopen00210" data-start="{" data-end="}">
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"><a class="line" href="../../de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0">  210</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>() {</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    std::valarray&lt;std::valarray&lt;double&gt;&gt; X = {{-4, 4, 2, 0, -3},</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>                                              {4, -4, 4, -3, -1},</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>                                              {2, 4, 4, 3, -3},</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>                                              {0, -3, 3, -1, -3},</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>                                              {-3, -1, -3, -3, 0}};</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    <span class="keywordtype">double</span> y[] = {9.27648, -9.26948, 2.0181, -1.03516,</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>                  -5.98994};  <span class="comment">// corresponding y-values</span></div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span> </div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;------- Test 2 -------&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    std::valarray&lt;double&gt; eig_vals = <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc">qr_algorithm::eigen_values</a>(&amp;X);</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span> </div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    std::cout &lt;&lt; X &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span></div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>              &lt;&lt; <span class="stringliteral">&quot;Eigen values: &quot;</span> &lt;&lt; eig_vals &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span> </div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 5; i++) {</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>        std::cout &lt;&lt; i + 1 &lt;&lt; <span class="stringliteral">&quot;/5 Checking for &quot;</span> &lt;&lt; y[i] &lt;&lt; <span class="stringliteral">&quot; --&gt; &quot;</span>;</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>        <span class="keywordtype">bool</span> result = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; 5 &amp;&amp; !result; j++) {</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>            <span class="keywordflow">if</span> (std::abs(y[i] - eig_vals[j]) &lt; 0.1) {</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>                result = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>                std::cout &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; eig_vals[j] &lt;&lt; <span class="stringliteral">&quot;) &quot;</span>;</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>            }</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>        }</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>        assert(result);  <span class="comment">// ensure that i^th expected eigen value was computed</span></div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;found\n&quot;</span>;</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    }</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed\n\n&quot;</span>;</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>}</div>
+</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span> </div>
+<div class="foldopen" id="foldopen00243" data-start="{" data-end="}">
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"><a class="line" href="../../de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">  243</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> **argv) {</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> = 5;</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    <span class="keywordflow">if</span> (argc == 2) {</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>        <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> = atoi(argv[1]);</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    } <span class="keywordflow">else</span> {  <span class="comment">// if invalid input argument is given run tests</span></div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>        <a class="code hl_function" href="../../de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a>();</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>        <a class="code hl_function" href="../../de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a>();</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Usage: ./qr_eigen_values [mat_size]\n&quot;</span>;</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>        <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>    }</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span> </div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> &lt; 2) {</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>        fprintf(stderr, <span class="stringliteral">&quot;Matrix size should be &gt; 2\n&quot;</span>);</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>        <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    }</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span> </div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>    <span class="comment">// initialize random number generator</span></div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span> </div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>    <span class="keywordtype">int</span> i, rows = <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>, columns = <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>;</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span> </div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>    std::valarray&lt;std::valarray&lt;double&gt;&gt; A(rows);</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span> </div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; rows; i++) {</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>        A[i] = std::valarray&lt;double&gt;(columns);</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>    }</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span> </div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    <span class="comment">/* create a random matrix */</span></div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    <a class="code hl_function" href="../../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d">create_matrix</a>(&amp;A);</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span> </div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>    std::cout &lt;&lt; A &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span> </div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    clock_t t1 = clock();</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>    std::valarray&lt;double&gt; eigen_vals = <a class="code hl_function" href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc">qr_algorithm::eigen_values</a>(&amp;A);</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>    <span class="keywordtype">double</span> dtime = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(clock() - t1) / CLOCKS_PER_SEC;</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span> </div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Eigen vals: &quot;</span>;</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a>; i++) std::cout &lt;&lt; eigen_vals[i] &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nTime taken to compute: &quot;</span> &lt;&lt; dtime &lt;&lt; <span class="stringliteral">&quot; sec\n&quot;</span>;</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span> </div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>}</div>
+</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a9977ad12548c4a49dee9dc3f0685aa54"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a></div><div class="ttdeci">ll mat_size</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00045">matrix_exponentiation.cpp:45</a></div></div>
+<div class="ttc" id="anamespaceqr__algorithm_html"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html">qr_algorithm</a></div><div class="ttdoc">Functions to compute QR decomposition of any rectangular matrix.</div></div>
+<div class="ttc" id="anamespaceqr__algorithm_html_a28e2fa3e803abaea6c568dc45d69d8cc"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc">qr_algorithm::eigen_values</a></div><div class="ttdeci">std::valarray&lt; double &gt; eigen_values(std::valarray&lt; std::valarray&lt; double &gt; &gt; *A, bool print_intermediates=false)</div><div class="ttdef"><b>Definition</b> <a href="#l00098">qr_eigen_values.cpp:98</a></div></div>
+<div class="ttc" id="anamespaceqr__algorithm_html_a73ce637634fc49e1d10d190eb388ebf1"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1">qr_algorithm::qr_decompose</a></div><div class="ttdeci">void qr_decompose(const std::valarray&lt; std::valarray&lt; T &gt; &gt; &amp;A, std::valarray&lt; std::valarray&lt; T &gt; &gt; *Q, std::valarray&lt; std::valarray&lt; T &gt; &gt; *R)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d68/qr__decompose_8h_source.html#l00146">qr_decompose.h:146</a></div></div>
+<div class="ttc" id="aqr__decompose_8h_html"><div class="ttname"><a href="../../d4/d68/qr__decompose_8h.html">qr_decompose.h</a></div><div class="ttdoc">Library functions to compute QR decomposition of a given matrix.</div></div>
+<div class="ttc" id="aqr__eigen__values_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition</b> <a href="#l00210">qr_eigen_values.cpp:210</a></div></div>
+<div class="ttc" id="aqr__eigen__values_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition</b> <a href="#l00177">qr_eigen_values.cpp:177</a></div></div>
+<div class="ttc" id="aqr__eigen__values_8cpp_html_a9bbf469d5525a816b0d6ca812119093d"><div class="ttname"><a href="../../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d">create_matrix</a></div><div class="ttdeci">void create_matrix(std::valarray&lt; std::valarray&lt; double &gt; &gt; *A)</div><div class="ttdef"><b>Definition</b> <a href="#l00028">qr_eigen_values.cpp:28</a></div></div>
+<div class="ttc" id="aqr__eigen__values_8cpp_html_abb8bf4c55e10685a5eb2ad3797fde1ae"><div class="ttname"><a href="../../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae">mat_mul</a></div><div class="ttdeci">void mat_mul(const std::valarray&lt; std::valarray&lt; double &gt; &gt; &amp;A, const std::valarray&lt; std::valarray&lt; double &gt; &gt; &amp;B, std::valarray&lt; std::valarray&lt; double &gt; &gt; *OUT)</div><div class="ttdef"><b>Definition</b> <a href="#l00054">qr_eigen_values.cpp:54</a></div></div>
+<div class="ttc" id="aqr__eigen__values_8cpp_html_aee57a411f07599034f5ceb8cc7d65b40"><div class="ttname"><a href="../../de/d75/qr__eigen__values_8cpp.html#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a></div><div class="ttdeci">#define LIMS</div><div class="ttdef"><b>Definition</b> <a href="#l00020">qr_eigen_values.cpp:20</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../de/d75/qr__eigen__values_8cpp.html">qr_eigen_values.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.map b/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.map
index 7b6b3d202..81abd7652 100644
--- a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.map
+++ b/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.map
@@ -1,5 +1,5 @@
 <map id="std::is_arithmetic&lt; uint256_t &gt;" name="std::is_arithmetic&lt; uint256_t &gt;">
 <area shape="rect" id="Node000001" title=" " alt="" coords="5,79,127,120"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integral_constant.html" title=" " alt="" coords="15,5,117,31"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="15,5,117,31"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="69,46,69,79,63,79,63,46"/>
 </map>
diff --git a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.md5 b/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.md5
index 377edbd7f..7da104bd8 100644
--- a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.md5
+++ b/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.md5
@@ -1 +1 @@
-c9aab933efc274d7816093a446310403
\ No newline at end of file
+38418cdb629a508d14caedeb9b71e651
\ No newline at end of file
diff --git a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.svg b/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.svg
index 06ff62757..244d7089f 100644
--- a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.svg
+++ b/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph.svg
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="83.5,-85.75 7.5,-85.75 7.5,-66.5 83.5,-66.5 83.5,-85.75"/>
 <text text-anchor="middle" x="45.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph_org.svg b/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph_org.svg
index bea7c50aa..73e84e2ad 100644
--- a/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph_org.svg
+++ b/de/d76/structstd_1_1is__arithmetic_3_01uint256__t_01_4__coll__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#bfbfbf" points="83.5,-85.75 7.5,-85.75 7.5,-66.5 83.5,-66.5 83.5,-85.75"/>
 <text text-anchor="middle" x="45.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
diff --git a/de/d77/tree__height_8cpp_source.html b/de/d77/tree__height_8cpp_source.html
new file mode 100644
index 000000000..9987a560c
--- /dev/null
+++ b/de/d77/tree__height_8cpp_source.html
@@ -0,0 +1,210 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/tree_height.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/d77/tree__height_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">tree_height.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">// C++ Program to find height of the tree using bottom-up dynamic programming.</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span> </div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * Given a rooted tree with node 1.</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * Task is to find the height of the tree.</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> * Example: -</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> * 4</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> * 1 2</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> * 1 3</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment"> * 2 4</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment"> * which can be represented as</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment"> *   1</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment"> *  / \</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment"> * 2   3</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment"> * |</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment"> * 4</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment"> * Height of the tree : - 2</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment">// global declarations</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment">// no of nodes max limit.</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">const</span> <span class="keywordtype">int</span> MAX = 1e5;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment">// adjacency list</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>std::vector&lt;int&gt; adj[MAX];</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>std::vector&lt;bool&gt; visited;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>std::vector&lt;int&gt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keywordtype">void</span> <a class="code hl_namespace" href="../../d8/da7/namespacedepth__first__search.html">depth_first_search</a>(<span class="keywordtype">int</span> u) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    visited[u] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordtype">int</span> child_height = 1;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> v : adj[u]) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        <span class="keywordflow">if</span> (!visited[v]) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>            <a class="code hl_namespace" href="../../d8/da7/namespacedepth__first__search.html">depth_first_search</a>(v);</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>            <span class="comment">// select maximum sub-tree height from all children.</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>            child_height = std::max(child_height, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[v] + 1);</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        }</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="comment">// assigned the max child height to current visited node.</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[u] = child_height;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>}</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="comment">// number of nodes</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordtype">int</span> number_of_nodes;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter number of nodes of the tree : &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    std::cin &gt;&gt; number_of_nodes;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="comment">// u, v denotes an undirected edge of tree.</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordtype">int</span> u, v;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="comment">// Tree contains exactly n-1 edges where n denotes the number of nodes.</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter edges of the tree : &quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; number_of_nodes - 1; i++) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        std::cin &gt;&gt; u &gt;&gt; v;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <span class="comment">// undirected tree u -&gt; v and v -&gt; u.</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        adj[u].push_back(v);</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        adj[v].push_back(u);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    }</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="comment">// initialize all nodes as unvisited.</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    visited.assign(number_of_nodes + 1, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="comment">// initialize depth of all nodes to 0.</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>.assign(number_of_nodes + 1, 0);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="comment">// function call which will initialize the height of all nodes.</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <a class="code hl_namespace" href="../../d8/da7/namespacedepth__first__search.html">depth_first_search</a>(1);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Height of the Tree : &quot;</span> &lt;&lt; <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[1] &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacedepth__first__search_html"><div class="ttname"><a href="../../d8/da7/namespacedepth__first__search.html">depth_first_search</a></div><div class="ttdoc">Functions for Depth First Search algorithm.</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> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><b>tree_height.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/d79/graham__scan__algorithm_8cpp_source.html b/de/d79/graham__scan__algorithm_8cpp_source.html
new file mode 100644
index 000000000..f03280df5
--- /dev/null
+++ b/de/d79/graham__scan__algorithm_8cpp_source.html
@@ -0,0 +1,215 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: geometry/graham_scan_algorithm.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/d79/graham__scan__algorithm_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">graham_scan_algorithm.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/******************************************************************************</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * @file</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * @brief Implementation of the [Convex</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * Hull](https://en.wikipedia.org/wiki/Convex_hull) implementation using [Graham</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * Scan](https://en.wikipedia.org/wiki/Graham_scan)</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> * @details</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> * In geometry, the convex hull or convex envelope or convex closure of a shape</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> * is the smallest convex set that contains it. The convex hull may be defined</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> * either as the intersection of all convex sets containing a given subset of a</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment"> * Euclidean space, or equivalently as the set of all convex combinations of</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment"> * points in the subset. For a bounded subset of the plane, the convex hull may</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment"> * be visualized as the shape enclosed by a rubber band stretched around the</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment"> * subset.</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment"> * The worst case time complexity of Jarvis’s Algorithm is O(n^2). Using</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment"> * Graham’s scan algorithm, we can find Convex Hull in O(nLogn) time.</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment"> * ### Implementation</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment"> * Sort points</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment"> * We first find the bottom-most point. The idea is to pre-process</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"> * points be sorting them with respect to the bottom-most point. Once the points</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"> * are sorted, they form a simple closed path.</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment"> * The sorting criteria is to use the orientation to compare angles without</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment"> * actually computing them (See the compare() function below) because</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment"> * computation of actual angles would be inefficient since trigonometric</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment"> * functions are not simple to evaluate.</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment"> * Accept or Reject Points</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment"> * Once we have the closed path, the next step is to traverse the path and</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="comment"> * remove concave points on this path using orientation. The first two points in</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="comment"> * sorted array are always part of Convex Hull. For remaining points, we keep</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="comment"> * track of recent three points, and find the angle formed by them. Let the</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="comment"> * three points be prev(p), curr(c) and next(n). If the orientation of these</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="comment"> * points (considering them in the same order) is not counterclockwise, we</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="comment"> * discard c, otherwise we keep it.</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="comment"> * @author [Lajat Manekar](https://github.com/Lazeeez)</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="preprocessor">#include &quot;./graham_scan_functions.hpp&quot;</span>  </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="comment">/*******************************************************************************</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="comment"> * @brief Self-test implementations</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="comment"> * @returns void</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    std::vector&lt;geometry::grahamscan::Point&gt; points = {</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        {0, 3}, {1, 1}, {2, 2}, {4, 4}, {0, 0}, {1, 2}, {3, 1}, {3, 3}};</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    std::vector&lt;geometry::grahamscan::Point&gt; expected_result = {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        {0, 3}, {4, 4}, {3, 1}, {0, 0}};</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    std::vector&lt;geometry::grahamscan::Point&gt; derived_result;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    std::vector&lt;geometry::grahamscan::Point&gt; res;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    derived_result = geometry::grahamscan::convexHull(points, points.size());</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test: &quot;</span>;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; expected_result.size(); i++) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        assert(derived_result[i].x == expected_result[i].x);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        assert(derived_result[i].y == expected_result[i].y);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>}</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="comment">/*******************************************************************************</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="comment"> * @brief Main function</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="comment"> * @returns 0 on exit</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>}</div>
+<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00100">caesar_cipher.cpp:100</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_e3380d2178455503f266746fb14246a5.html">geometry</a></li><li class="navelem"><b>graham_scan_algorithm.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/d7b/merge__insertion__sort_8cpp.html b/de/d7b/merge__insertion__sort_8cpp.html
index b1a2bf55a..39001e461 100644
--- a/de/d7b/merge__insertion__sort_8cpp.html
+++ b/de/d7b/merge__insertion__sort_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting/merge_insertion_sort.cpp File Reference</title>
+<title>TheAlgorithms/C++: sorting/merge_insertion_sort.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for merge_insertion_sort.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d1f/merge__insertion__sort_8cpp__incl.svg" width="514" height="126"><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">
+</div>
+<p><a href="../../de/d7b/merge__insertion__sort_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d91/namespacesorting.html">sorting</a></td></tr>
@@ -137,15 +156,15 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a0cba4fbf287ab8cb978ed7f8fef886b1" id="r_a0cba4fbf287ab8cb978ed7f8fef886b1"><td class="memTemplParams" colspan="2">template&lt;typename T , size_t N&gt; </td></tr>
-<tr class="memitem:a0cba4fbf287ab8cb978ed7f8fef886b1"><td class="memTemplItemLeft" align="right" valign="top">static void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a0cba4fbf287ab8cb978ed7f8fef886b1">sorting::merge_insertion::InsertionSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; *A, size_t start, size_t end)</td></tr>
+<tr class="memitem:a0cba4fbf287ab8cb978ed7f8fef886b1"><td class="memTemplItemLeft" align="right" valign="top">static void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a0cba4fbf287ab8cb978ed7f8fef886b1">sorting::merge_insertion::InsertionSort</a> (std::array&lt; T, N &gt; *A, size_t start, size_t end)</td></tr>
 <tr class="memdesc:a0cba4fbf287ab8cb978ed7f8fef886b1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insertion merge algorithm.  <br /></td></tr>
 <tr class="separator:a0cba4fbf287ab8cb978ed7f8fef886b1"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:af4de4067a9a866ffd985c5b5055ccedf" id="r_af4de4067a9a866ffd985c5b5055ccedf"><td class="memTemplParams" colspan="2">template&lt;typename T , size_t N&gt; </td></tr>
-<tr class="memitem:af4de4067a9a866ffd985c5b5055ccedf"><td class="memTemplItemLeft" align="right" valign="top">static void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af4de4067a9a866ffd985c5b5055ccedf">sorting::merge_insertion::merge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; *array, size_t min, size_t max, size_t mid)</td></tr>
+<tr class="memitem:af4de4067a9a866ffd985c5b5055ccedf"><td class="memTemplItemLeft" align="right" valign="top">static void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#af4de4067a9a866ffd985c5b5055ccedf">sorting::merge_insertion::merge</a> (std::array&lt; T, N &gt; *array, size_t min, size_t max, size_t mid)</td></tr>
 <tr class="memdesc:af4de4067a9a866ffd985c5b5055ccedf"><td class="mdescLeft">&#160;</td><td class="mdescRight">Perform merge of data in a window.  <br /></td></tr>
 <tr class="separator:af4de4067a9a866ffd985c5b5055ccedf"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a7161278f18e83b671c6454b139cc5674" id="r_a7161278f18e83b671c6454b139cc5674"><td class="memTemplParams" colspan="2">template&lt;typename T , size_t N&gt; </td></tr>
-<tr class="memitem:a7161278f18e83b671c6454b139cc5674"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a7161278f18e83b671c6454b139cc5674">sorting::merge_insertion::mergeSort</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; *array, size_t min, size_t max, size_t threshold)</td></tr>
+<tr class="memitem:a7161278f18e83b671c6454b139cc5674"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a7161278f18e83b671c6454b139cc5674">sorting::merge_insertion::mergeSort</a> (std::array&lt; T, N &gt; *array, size_t min, size_t max, size_t threshold)</td></tr>
 <tr class="memdesc:a7161278f18e83b671c6454b139cc5674"><td class="mdescLeft">&#160;</td><td class="mdescRight">Final combined algorithm. Algorithm utilizes <a class="el" href="#a0cba4fbf287ab8cb978ed7f8fef886b1" title="Insertion merge algorithm.">sorting::merge_insertion::InsertionSort</a> if window length is less than threshold, else performs merge sort recursively using <a class="el" href="#a7161278f18e83b671c6454b139cc5674" title="Final combined algorithm. Algorithm utilizes sorting::merge_insertion::InsertionSort if window length...">sorting::merge_insertion::mergeSort</a>.  <br /></td></tr>
 <tr class="separator:a7161278f18e83b671c6454b139cc5674"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -161,6 +180,8 @@ Functions</h2></td></tr>
 <dd>
 <a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
 <dl class="section see"><dt>See also</dt><dd>Individual algorithms: <a class="el" href="../../dd/d0d/insertion__sort_8cpp.html" title="Insertion Sort Algorithm (Insertion Sort)">insertion_sort.cpp</a> and <a class="el" href="../../d5/df4/merge__sort_8cpp.html" title="Merege Sort Algorithm (MEREGE SORT) implementation">merge_sort.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html">merge_insertion_sort.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a0cba4fbf287ab8cb978ed7f8fef886b1" name="a0cba4fbf287ab8cb978ed7f8fef886b1"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0cba4fbf287ab8cb978ed7f8fef886b1">&#9670;&#160;</a></span>InsertionSort()</h2>
@@ -176,7 +197,7 @@ template&lt;typename T , size_t N&gt; </div>
         <tr>
           <td class="memname">static void sorting::merge_insertion::InsertionSort </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; *</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">std::array&lt; T, N &gt; *</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -213,11 +234,13 @@ template&lt;typename T , size_t N&gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html">merge_insertion_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   37</span>                                                                       {</div>
 <div class="line"><span class="lineno">   38</span>    <span class="keywordtype">size_t</span> i = 0, j = 0;</div>
-<div class="line"><span class="lineno">   39</span>    T *ptr = A-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/data.html">data</a>();</div>
+<div class="line"><span class="lineno">   39</span>    T *ptr = A-&gt;data();</div>
 <div class="line"><span class="lineno">   40</span> </div>
-<div class="line"><span class="lineno">   41</span>    <span class="keywordflow">for</span> (i = start; i &lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">end</a>; i++) {</div>
+<div class="line"><span class="lineno">   41</span>    <span class="keywordflow">for</span> (i = start; i &lt; end; i++) {</div>
 <div class="line"><span class="lineno">   42</span>        T temp = ptr[i];</div>
 <div class="line"><span class="lineno">   43</span>        j = i;</div>
 <div class="line"><span class="lineno">   44</span>        <span class="keywordflow">while</span> (j &gt; start &amp;&amp; temp &lt; ptr[j - 1]) {</div>
@@ -231,14 +254,7 @@ template&lt;typename T , size_t N&gt; </div>
 <div class="line"><span class="lineno">   52</span>        ptr[j] = temp;</div>
 <div class="line"><span class="lineno">   53</span>    }</div>
 <div class="line"><span class="lineno">   54</span>}</div>
-<div class="ttc" id="adata_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/data.html">std::array::data</a></div><div class="ttdeci">T data(T... args)</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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.svg" width="328" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -258,20 +274,15 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html#l00159">159</a> of file <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html">merge_insertion_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  159</span>           {</div>
-<div class="line"><span class="lineno">  160</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>));</div>
+<div class="line"><span class="lineno">  160</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
 <div class="line"><span class="lineno">  161</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
 <div class="line"><span class="lineno">  162</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  163</span>}</div>
-<div class="ttc" id="amerge__insertion__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test code using random arrays.</div><div class="ttdef"><b>Definition</b> merge_insertion_sort.cpp:132</div></div>
-<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="336" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amerge__insertion__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test code using random arrays.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d7b/merge__insertion__sort_8cpp_source.html#l00132">merge_insertion_sort.cpp:132</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af4de4067a9a866ffd985c5b5055ccedf" name="af4de4067a9a866ffd985c5b5055ccedf"></a>
@@ -288,7 +299,7 @@ template&lt;typename T , size_t N&gt; </div>
         <tr>
           <td class="memname">static void sorting::merge_insertion::merge </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; *</td>          <td class="paramname"><span class="paramname"><em>array</em></span>, </td>
+          <td class="paramtype">std::array&lt; T, N &gt; *</td>          <td class="paramname"><span class="paramname"><em>array</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -330,15 +341,17 @@ template&lt;typename T , size_t N&gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html">merge_insertion_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   67</span>                                                                             {</div>
-<div class="line"><span class="lineno">   68</span>    <span class="keywordtype">size_t</span> firstIndex = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a>;</div>
+<div class="line"><span class="lineno">   68</span>    <span class="keywordtype">size_t</span> firstIndex = min;</div>
 <div class="line"><span class="lineno">   69</span>    <span class="keywordtype">size_t</span> secondIndex = mid + 1;</div>
 <div class="line"><span class="lineno">   70</span> </div>
-<div class="line"><span class="lineno">   71</span>    <span class="keyword">auto</span> ptr = array-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/data.html">data</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/array.html">std::array&lt;T, N + 1&gt;</a> tempArray{0};</div>
+<div class="line"><span class="lineno">   71</span>    <span class="keyword">auto</span> ptr = array-&gt;data();</div>
+<div class="line"><span class="lineno">   72</span>    std::array&lt;T, N + 1&gt; tempArray{0};</div>
 <div class="line"><span class="lineno">   73</span> </div>
 <div class="line"><span class="lineno">   74</span>    <span class="comment">// While there are elements in the left or right runs</span></div>
-<div class="line"><span class="lineno">   75</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> index = min; index &lt;= <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">max</a>; index++) {</div>
+<div class="line"><span class="lineno">   75</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> index = min; index &lt;= max; index++) {</div>
 <div class="line"><span class="lineno">   76</span>        <span class="comment">// If left run head exists and is &lt;= existing right run head.</span></div>
 <div class="line"><span class="lineno">   77</span>        <span class="keywordflow">if</span> (firstIndex &lt;= mid &amp;&amp;</div>
 <div class="line"><span class="lineno">   78</span>            (secondIndex &gt; max || ptr[firstIndex] &lt;= ptr[secondIndex])) {</div>
@@ -351,20 +364,11 @@ template&lt;typename T , size_t N&gt; </div>
 <div class="line"><span class="lineno">   85</span>    }</div>
 <div class="line"><span class="lineno">   86</span> </div>
 <div class="line"><span class="lineno">   87</span>    <span class="comment">// transfer to the initial array</span></div>
-<div class="line"><span class="lineno">   88</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/memcpy.html">memcpy</a>(ptr + min, tempArray.data() + min, (max - min) * <span class="keyword">sizeof</span>(T));</div>
+<div class="line"><span class="lineno">   88</span>    memcpy(ptr + min, tempArray.data() + min, (max - min) * <span class="keyword">sizeof</span>(T));</div>
 <div class="line"><span class="lineno">   89</span>    <span class="comment">//  for (int index = min; index &lt;= max; index++) ptr[index] =</span></div>
 <div class="line"><span class="lineno">   90</span>    <span class="comment">//  tempArray[index];</span></div>
 <div class="line"><span class="lineno">   91</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="amemcpy_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/memcpy.html">std::memcpy</a></div><div class="ttdeci">T memcpy(T... args)</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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.svg" width="328" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7161278f18e83b671c6454b139cc5674" name="a7161278f18e83b671c6454b139cc5674"></a>
@@ -378,7 +382,7 @@ template&lt;typename T , size_t N&gt; </div>
         <tr>
           <td class="memname">void sorting::merge_insertion::mergeSort </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; T, N &gt; *</td>          <td class="paramname"><span class="paramname"><em>array</em></span>, </td>
+          <td class="paramtype">std::array&lt; T, N &gt; *</td>          <td class="paramname"><span class="paramname"><em>array</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -415,13 +419,15 @@ template&lt;typename T , size_t N&gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html">merge_insertion_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  108</span>                                 {</div>
 <div class="line"><span class="lineno">  109</span>    <span class="comment">// prerequisite</span></div>
 <div class="line"><span class="lineno">  110</span>    <span class="keywordflow">if</span> ((max - min) &lt;= threshold) {</div>
 <div class="line"><span class="lineno">  111</span>        <a class="code hl_function" href="#a0cba4fbf287ab8cb978ed7f8fef886b1">InsertionSort</a>(array, min, max);</div>
 <div class="line"><span class="lineno">  112</span>    } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">  113</span>        <span class="comment">// get the middle point</span></div>
-<div class="line"><span class="lineno">  114</span>        <span class="keywordtype">size_t</span> mid = (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">max</a> + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a>) &gt;&gt; 1;</div>
+<div class="line"><span class="lineno">  114</span>        <span class="keywordtype">size_t</span> mid = (max + min) &gt;&gt; 1;</div>
 <div class="line"><span class="lineno">  115</span> </div>
 <div class="line"><span class="lineno">  116</span>        <span class="comment">// apply merge sort to both parts of this</span></div>
 <div class="line"><span class="lineno">  117</span>        <a class="code hl_function" href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a>(array, min, mid, threshold);</div>
@@ -431,15 +437,10 @@ template&lt;typename T , size_t N&gt; </div>
 <div class="line"><span class="lineno">  121</span>        <a class="code hl_function" href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge</a>(array, min, max, mid);</div>
 <div class="line"><span class="lineno">  122</span>    }</div>
 <div class="line"><span class="lineno">  123</span>}</div>
-<div class="ttc" id="agroup__sorting_html_ga460c61cd948203b4816bef2accb3fc73"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge</a></div><div class="ttdeci">void merge(int *arr, int l, int m, int r)</div><div class="ttdef"><b>Definition</b> merge_sort.cpp:33</div></div>
-<div class="ttc" id="agroup__sorting_html_gab6b14fea48d9841e29b9fc26be6e05d7"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a></div><div class="ttdeci">void mergeSort(int *arr, int l, int r)</div><div class="ttdef"><b>Definition</b> merge_sort.cpp:71</div></div>
-<div class="ttc" id="amerge__insertion__sort_8cpp_html_a0cba4fbf287ab8cb978ed7f8fef886b1"><div class="ttname"><a href="#a0cba4fbf287ab8cb978ed7f8fef886b1">sorting::merge_insertion::InsertionSort</a></div><div class="ttdeci">static void InsertionSort(std::array&lt; T, N &gt; *A, size_t start, size_t end)</div><div class="ttdoc">Insertion merge algorithm.</div><div class="ttdef"><b>Definition</b> merge_insertion_sort.cpp:37</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.svg" width="538" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agroup__sorting_html_ga460c61cd948203b4816bef2accb3fc73"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge</a></div><div class="ttdeci">void merge(int *arr, int l, int m, int r)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/df4/merge__sort_8cpp_source.html#l00033">merge_sort.cpp:33</a></div></div>
+<div class="ttc" id="agroup__sorting_html_gab6b14fea48d9841e29b9fc26be6e05d7"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a></div><div class="ttdeci">void mergeSort(int *arr, int l, int r)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/df4/merge__sort_8cpp_source.html#l00071">merge_sort.cpp:71</a></div></div>
+<div class="ttc" id="amerge__insertion__sort_8cpp_html_a0cba4fbf287ab8cb978ed7f8fef886b1"><div class="ttname"><a href="#a0cba4fbf287ab8cb978ed7f8fef886b1">sorting::merge_insertion::InsertionSort</a></div><div class="ttdeci">static void InsertionSort(std::array&lt; T, N &gt; *A, size_t start, size_t end)</div><div class="ttdoc">Insertion merge algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d7b/merge__insertion__sort_8cpp_source.html#l00037">merge_insertion_sort.cpp:37</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -467,39 +468,31 @@ Here is the call graph for this function:</div>
 
 <p>Function to test code using random arrays. </p>
 <dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html#l00132">132</a> of file <a class="el" href="../../de/d7b/merge__insertion__sort_8cpp_source.html">merge_insertion_sort.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  132</span>                   {</div>
 <div class="line"><span class="lineno">  133</span>    <span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> size = 30;</div>
-<div class="line"><span class="lineno">  134</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, size&gt;</a> array{0};</div>
+<div class="line"><span class="lineno">  134</span>    std::array&lt;int, size&gt; array{0};</div>
 <div class="line"><span class="lineno">  135</span>    <span class="comment">// input</span></div>
 <div class="line"><span class="lineno">  136</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
-<div class="line"><span class="lineno">  137</span>        array[i] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 100 - 50;</div>
-<div class="line"><span class="lineno">  138</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; array[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  137</span>        array[i] = std::rand() % 100 - 50;</div>
+<div class="line"><span class="lineno">  138</span>        std::cout &lt;&lt; array[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">  139</span>    }</div>
-<div class="line"><span class="lineno">  140</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  140</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  141</span> </div>
 <div class="line"><span class="lineno">  142</span>    <a class="code hl_function" href="#a0cba4fbf287ab8cb978ed7f8fef886b1">sorting::merge_insertion::InsertionSort</a>(&amp;array, 0, size);</div>
 <div class="line"><span class="lineno">  143</span>    <span class="comment">//  sorting::merge_insertion::mergeSort(&amp;array, 0, size, 10);</span></div>
 <div class="line"><span class="lineno">  144</span> </div>
 <div class="line"><span class="lineno">  145</span>    <span class="comment">// output</span></div>
 <div class="line"><span class="lineno">  146</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
-<div class="line"><span class="lineno">  147</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; array[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  147</span>        std::cout &lt;&lt; array[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">  148</span>    }</div>
-<div class="line"><span class="lineno">  149</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">  149</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  150</span> </div>
-<div class="line"><span class="lineno">  151</span>    assert(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a>(array), <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a>(array)));</div>
-<div class="line"><span class="lineno">  152</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test passed\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  151</span>    assert(std::is_sorted(std::begin(array), std::end(array)));</div>
+<div class="line"><span class="lineno">  152</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test passed\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  153</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="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/begin.html">std::begin</a></div><div class="ttdeci">T begin(T... args)</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="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="203" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.map b/de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.map
deleted file mode 100644
index 47765e936..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="sorting::merge_insertion::InsertionSort" name="sorting::merge_insertion::InsertionSort">
-<area shape="rect" id="Node000001" title="Insertion merge algorithm." alt="" coords="5,29,166,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="50,29,49,19,54,10,67,5,86,3,106,5,117,11,115,16,104,10,85,8,68,10,58,14,54,20,56,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/data.html#" title=" " alt="" coords="214,37,323,62"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="166,47,198,47,198,52,166,52"/>
-</map>
diff --git a/de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.md5 b/de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.md5
deleted file mode 100644
index 883d585f3..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9bbb42743a0d26aebc2dc958a33ebe51
\ No newline at end of file
diff --git a/de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.svg b/de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.svg
deleted file mode 100644
index f0fddc754..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::merge_insertion::InsertionSort Pages: 1 -->
-<svg width="246pt" height="57pt"
- viewBox="0.00 0.00 246.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>sorting::merge_insertion::InsertionSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Insertion merge algorithm.">
-<polygon fill="#999999" stroke="#666666" points="120.25,-30.5 0,-30.5 0,0 120.25,0 120.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge_insertion</text>
-<text text-anchor="middle" x="60.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::InsertionSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.83,-30.99C30.87,-40.06 38.97,-48.5 60.12,-48.5 71.7,-48.5 79.36,-45.97 83.12,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.57,-42.83 84.25,-32.49 79.62,-42.02 86.57,-42.83"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/data.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.25,-24.88 156.25,-24.88 156.25,-5.63 238.25,-5.63 238.25,-24.88"/>
-<text text-anchor="middle" x="197.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.39,-15.25C128.49,-15.25 136.75,-15.25 144.7,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.55,-18.75 154.55,-15.25 144.55,-11.75 144.55,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph_org.svg b/de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph_org.svg
deleted file mode 100644
index e4b748b08..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_a0cba4fbf287ab8cb978ed7f8fef886b1_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::merge_insertion::InsertionSort Pages: 1 -->
-<svg width="246pt" height="57pt"
- viewBox="0.00 0.00 246.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>sorting::merge_insertion::InsertionSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Insertion merge algorithm.">
-<polygon fill="#999999" stroke="#666666" points="120.25,-30.5 0,-30.5 0,0 120.25,0 120.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge_insertion</text>
-<text text-anchor="middle" x="60.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::InsertionSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.83,-30.99C30.87,-40.06 38.97,-48.5 60.12,-48.5 71.7,-48.5 79.36,-45.97 83.12,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="86.57,-42.83 84.25,-32.49 79.62,-42.02 86.57,-42.83"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/data.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.25,-24.88 156.25,-24.88 156.25,-5.63 238.25,-5.63 238.25,-24.88"/>
-<text text-anchor="middle" x="197.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.39,-15.25C128.49,-15.25 136.75,-15.25 144.7,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.55,-18.75 154.55,-15.25 144.55,-11.75 144.55,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.map b/de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.map
deleted file mode 100644
index 243d6e207..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="sorting::merge_insertion::mergeSort" name="sorting::merge_insertion::mergeSort">
-<area shape="rect" id="Node000001" title="Final combined algorithm. Algorithm utilizes sorting::merge_insertion::InsertionSort if window length..." alt="" coords="5,29,166,70"/>
-<area shape="rect" id="Node000002" href="$de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1" title="Insertion merge algorithm." alt="" coords="214,29,374,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="166,47,198,47,198,52,166,52"/>
-<area shape="poly" id="edge3_Node000002_Node000002" title=" " alt="" coords="259,29,257,19,263,10,275,5,294,3,314,5,326,11,323,16,312,10,294,8,277,10,266,14,262,20,264,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/data.html#" title=" " alt="" coords="422,37,531,62"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="374,47,407,47,407,52,374,52"/>
-</map>
diff --git a/de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.md5 b/de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.md5
deleted file mode 100644
index b3781e92b..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e2c5a0b9b470386105ff64832be5a363
\ No newline at end of file
diff --git a/de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.svg b/de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.svg
deleted file mode 100644
index 3a08c0cb4..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::merge_insertion::mergeSort Pages: 1 -->
-<svg width="403pt" height="57pt"
- viewBox="0.00 0.00 402.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>sorting::merge_insertion::mergeSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Final combined algorithm. Algorithm utilizes sorting::merge_insertion::InsertionSort if window length...">
-<polygon fill="#999999" stroke="#666666" points="120.25,-30.5 0,-30.5 0,0 120.25,0 120.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge_insertion</text>
-<text text-anchor="middle" x="60.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::mergeSort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1" target="_top" xlink:title="Insertion merge algorithm.">
-<polygon fill="white" stroke="#666666" points="276.5,-30.5 156.25,-30.5 156.25,0 276.5,0 276.5,-30.5"/>
-<text text-anchor="start" x="164.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge_insertion</text>
-<text text-anchor="middle" x="216.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::InsertionSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.32,-15.25C128.23,-15.25 136.41,-15.25 144.5,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.31,-18.75 154.31,-15.25 144.31,-11.75 144.31,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M192.08,-30.99C187.12,-40.06 195.22,-48.5 216.38,-48.5 227.95,-48.5 235.61,-45.97 239.37,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="242.82,-42.83 240.5,-32.49 235.87,-42.02 242.82,-42.83"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/data.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="394.5,-24.88 312.5,-24.88 312.5,-5.63 394.5,-5.63 394.5,-24.88"/>
-<text text-anchor="middle" x="353.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::data</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M276.64,-15.25C284.74,-15.25 293,-15.25 300.95,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.8,-18.75 310.8,-15.25 300.8,-11.75 300.8,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph_org.svg b/de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph_org.svg
deleted file mode 100644
index 7505e81d8..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_a7161278f18e83b671c6454b139cc5674_cgraph_org.svg
+++ /dev/null
@@ -1,68 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::merge_insertion::mergeSort Pages: 1 -->
-<svg width="403pt" height="57pt"
- viewBox="0.00 0.00 402.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>sorting::merge_insertion::mergeSort</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Final combined algorithm. Algorithm utilizes sorting::merge_insertion::InsertionSort if window length...">
-<polygon fill="#999999" stroke="#666666" points="120.25,-30.5 0,-30.5 0,0 120.25,0 120.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge_insertion</text>
-<text text-anchor="middle" x="60.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::mergeSort</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1" target="_top" xlink:title="Insertion merge algorithm.">
-<polygon fill="white" stroke="#666666" points="276.5,-30.5 156.25,-30.5 156.25,0 276.5,0 276.5,-30.5"/>
-<text text-anchor="start" x="164.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge_insertion</text>
-<text text-anchor="middle" x="216.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::InsertionSort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.32,-15.25C128.23,-15.25 136.41,-15.25 144.5,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.31,-18.75 154.31,-15.25 144.31,-11.75 144.31,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M192.08,-30.99C187.12,-40.06 195.22,-48.5 216.38,-48.5 227.95,-48.5 235.61,-45.97 239.37,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="242.82,-42.83 240.5,-32.49 235.87,-42.02 242.82,-42.83"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/data.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="394.5,-24.88 312.5,-24.88 312.5,-5.63 394.5,-5.63 394.5,-24.88"/>
-<text text-anchor="middle" x="353.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::data</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M276.64,-15.25C284.74,-15.25 293,-15.25 300.95,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="300.8,-18.75 310.8,-15.25 300.8,-11.75 300.8,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 0185a5e82..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Function to test code using random arrays." alt="" coords="5,104,49,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="108,5,186,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="36,102,61,72,95,40,100,37,103,41,98,44,65,76,40,106"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="113,55,181,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="48,106,99,84,101,89,50,110"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="111,104,182,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,114,96,114,96,120,49,120"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="97,153,197,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="50,123,101,144,99,149,48,128"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="111,203,183,228"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="40,128,65,158,98,189,103,193,100,197,95,194,61,162,36,132"/>
-</map>
diff --git a/de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 1cf9758aa..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-83ede3b05768cb2f6aabe18451830818
\ No newline at end of file
diff --git a/de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 6f37123b3..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="152pt" height="175pt"
- viewBox="0.00 0.00 151.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test code using random arrays.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-93.25 0,-93.25 0,-74 32.5,-74 32.5,-93.25"/>
-<text text-anchor="middle" x="16.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.5,-167.25 76.75,-167.25 76.75,-148 135.5,-148 135.5,-167.25"/>
-<text text-anchor="middle" x="106.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.32,-93.36C33.46,-105.42 50.36,-126.03 68.5,-139.62 69.62,-140.46 70.78,-141.28 71.97,-142.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.8,-144.85 80.2,-146.87 73.33,-138.81 69.8,-144.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="131.75,-130.25 80.5,-130.25 80.5,-111 131.75,-111 131.75,-130.25"/>
-<text text-anchor="middle" x="106.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-90.24C43.45,-94.66 57.66,-100.64 70.7,-106.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.3,-109.34 79.88,-109.99 72.02,-102.89 69.3,-109.34"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.88,-93.25 79.38,-93.25 79.38,-74 132.88,-74 132.88,-93.25"/>
-<text text-anchor="middle" x="106.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-83.62C42.69,-83.62 55.61,-83.62 67.84,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.7,-87.13 77.7,-83.63 67.7,-80.13 67.7,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.75,-56.25 68.5,-56.25 68.5,-37 143.75,-37 143.75,-56.25"/>
-<text text-anchor="middle" x="106.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-77.01C43.45,-72.59 57.66,-66.61 70.7,-61.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.02,-64.36 79.88,-57.26 69.3,-57.91 72.02,-64.36"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="133.25,-19.25 79,-19.25 79,0 133.25,0 133.25,-19.25"/>
-<text text-anchor="middle" x="106.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.32,-73.89C33.46,-61.83 50.36,-41.22 68.5,-27.62 69.62,-26.79 70.78,-25.97 71.97,-25.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.33,-28.44 80.2,-20.38 69.8,-22.4 73.33,-28.44"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index f065fbc25..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="152pt" height="175pt"
- viewBox="0.00 0.00 151.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test code using random arrays.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-93.25 0,-93.25 0,-74 32.5,-74 32.5,-93.25"/>
-<text text-anchor="middle" x="16.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="135.5,-167.25 76.75,-167.25 76.75,-148 135.5,-148 135.5,-167.25"/>
-<text text-anchor="middle" x="106.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.32,-93.36C33.46,-105.42 50.36,-126.03 68.5,-139.62 69.62,-140.46 70.78,-141.28 71.97,-142.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.8,-144.85 80.2,-146.87 73.33,-138.81 69.8,-144.85"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="131.75,-130.25 80.5,-130.25 80.5,-111 131.75,-111 131.75,-130.25"/>
-<text text-anchor="middle" x="106.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-90.24C43.45,-94.66 57.66,-100.64 70.7,-106.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.3,-109.34 79.88,-109.99 72.02,-102.89 69.3,-109.34"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.88,-93.25 79.38,-93.25 79.38,-74 132.88,-74 132.88,-93.25"/>
-<text text-anchor="middle" x="106.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-83.62C42.69,-83.62 55.61,-83.62 67.84,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.7,-87.13 77.7,-83.63 67.7,-80.13 67.7,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.75,-56.25 68.5,-56.25 68.5,-37 143.75,-37 143.75,-56.25"/>
-<text text-anchor="middle" x="106.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.96,-77.01C43.45,-72.59 57.66,-66.61 70.7,-61.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.02,-64.36 79.88,-57.26 69.3,-57.91 72.02,-64.36"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="133.25,-19.25 79,-19.25 79,0 133.25,0 133.25,-19.25"/>
-<text text-anchor="middle" x="106.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.32,-73.89C33.46,-61.83 50.36,-41.22 68.5,-27.62 69.62,-26.79 70.78,-25.97 71.97,-25.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.33,-28.44 80.2,-20.38 69.8,-22.4 73.33,-28.44"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index db98dff7f..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,104,55,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="103,55,182,80"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,104,96,85,99,90,56,109"/>
-<area shape="rect" id="Node000003" href="$de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function to test code using random arrays." alt="" coords="121,104,164,130"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,114,105,114,105,120,55,120"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="106,153,178,179"/>
-<area shape="poly" id="edge8_Node000001_Node000009" title=" " alt="" coords="56,125,99,144,96,149,54,130"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/begin.html#" title=" " alt="" coords="241,5,319,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="163,103,180,91,204,65,228,40,233,37,236,41,232,44,208,69,184,95,166,107"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/iterator/end.html#" title=" " alt="" coords="246,55,314,80"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="163,107,231,82,233,87,165,112"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="244,104,316,130"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="164,114,229,114,229,120,164,120"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="230,153,330,179"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="165,122,229,145,227,150,163,127"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="244,203,316,228"/>
-<area shape="poly" id="edge7_Node000003_Node000008" title=" " alt="" coords="166,126,184,139,208,165,232,189,236,193,233,197,228,194,204,168,180,143,163,131"/>
-</map>
diff --git a/de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 573c3c5bc..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-964eefbdfced9d17d5a44ce2c9c160a2
\ No newline at end of file
diff --git a/de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 7778cbac8..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,191 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="252pt" height="175pt"
- viewBox="0.00 0.00 251.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-93.25 0,-93.25 0,-74 37,-74 37,-93.25"/>
-<text text-anchor="middle" x="18.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-130.25 73,-130.25 73,-111 132.5,-111 132.5,-130.25"/>
-<text text-anchor="middle" x="102.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-91.65C46.63,-95.83 58.28,-101.07 69.1,-105.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.6,-109.1 78.15,-110.01 70.47,-102.72 67.6,-109.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test code using random arrays.">
-<polygon fill="white" stroke="#666666" points="119,-93.25 86.5,-93.25 86.5,-74 119,-74 119,-93.25"/>
-<text text-anchor="middle" x="102.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-83.62C48.26,-83.62 62.44,-83.62 74.71,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.64,-87.13 84.64,-83.63 74.64,-80.13 74.64,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-56.25 75.62,-56.25 75.62,-37 129.88,-37 129.88,-56.25"/>
-<text text-anchor="middle" x="102.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-75.6C46.63,-71.42 58.28,-66.18 69.1,-61.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.47,-64.53 78.15,-57.24 67.6,-58.15 70.47,-64.53"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235.5,-167.25 176.75,-167.25 176.75,-148 235.5,-148 235.5,-167.25"/>
-<text text-anchor="middle" x="206.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.46,-92.47C123.84,-95.19 128.49,-98.34 132.5,-101.62 150.5,-116.36 149.77,-125.83 168.5,-139.62 169.62,-140.45 170.79,-141.26 171.99,-142.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.83,-144.83 180.23,-146.82 173.34,-138.78 169.83,-144.83"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.75,-130.25 180.5,-130.25 180.5,-111 231.75,-111 231.75,-130.25"/>
-<text text-anchor="middle" x="206.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.15,-89.24C132.54,-94.13 152.46,-101.4 169.76,-107.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.09,-110.83 178.68,-110.97 170.49,-104.26 168.09,-110.83"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.88,-93.25 179.38,-93.25 179.38,-74 232.88,-74 232.88,-93.25"/>
-<text text-anchor="middle" x="206.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.15,-83.62C132.02,-83.62 150.92,-83.62 167.72,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.4,-87.13 177.4,-83.63 167.4,-80.13 167.4,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.75,-56.25 168.5,-56.25 168.5,-37 243.75,-37 243.75,-56.25"/>
-<text text-anchor="middle" x="206.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.15,-78.01C131.87,-73.36 150.48,-66.57 167.14,-60.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.1,-63.86 176.29,-57.15 165.7,-57.29 168.1,-63.86"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.25,-19.25 179,-19.25 179,0 233.25,0 233.25,-19.25"/>
-<text text-anchor="middle" x="206.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.46,-74.78C123.84,-72.06 128.49,-68.91 132.5,-65.62 150.5,-50.89 149.77,-41.42 168.5,-27.62 169.62,-26.8 170.79,-25.99 171.99,-25.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.34,-28.47 180.23,-20.43 169.83,-22.42 173.34,-28.47"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 50758f11c..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,165 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="252pt" height="175pt"
- viewBox="0.00 0.00 251.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-93.25 0,-93.25 0,-74 37,-74 37,-93.25"/>
-<text text-anchor="middle" x="18.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-130.25 73,-130.25 73,-111 132.5,-111 132.5,-130.25"/>
-<text text-anchor="middle" x="102.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-91.65C46.63,-95.83 58.28,-101.07 69.1,-105.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.6,-109.1 78.15,-110.01 70.47,-102.72 67.6,-109.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test code using random arrays.">
-<polygon fill="white" stroke="#666666" points="119,-93.25 86.5,-93.25 86.5,-74 119,-74 119,-93.25"/>
-<text text-anchor="middle" x="102.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-83.62C48.26,-83.62 62.44,-83.62 74.71,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.64,-87.13 84.64,-83.63 74.64,-80.13 74.64,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-56.25 75.62,-56.25 75.62,-37 129.88,-37 129.88,-56.25"/>
-<text text-anchor="middle" x="102.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge8_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge8_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-75.6C46.63,-71.42 58.28,-66.18 69.1,-61.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.47,-64.53 78.15,-57.24 67.6,-58.15 70.47,-64.53"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="235.5,-167.25 176.75,-167.25 176.75,-148 235.5,-148 235.5,-167.25"/>
-<text text-anchor="middle" x="206.12" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::begin</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.46,-92.47C123.84,-95.19 128.49,-98.34 132.5,-101.62 150.5,-116.36 149.77,-125.83 168.5,-139.62 169.62,-140.45 170.79,-141.26 171.99,-142.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.83,-144.83 180.23,-146.82 173.34,-138.78 169.83,-144.83"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/iterator/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.75,-130.25 180.5,-130.25 180.5,-111 231.75,-111 231.75,-130.25"/>
-<text text-anchor="middle" x="206.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::end</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.15,-89.24C132.54,-94.13 152.46,-101.4 169.76,-107.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.09,-110.83 178.68,-110.97 170.49,-104.26 168.09,-110.83"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="232.88,-93.25 179.38,-93.25 179.38,-74 232.88,-74 232.88,-93.25"/>
-<text text-anchor="middle" x="206.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.15,-83.62C132.02,-83.62 150.92,-83.62 167.72,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.4,-87.13 177.4,-83.63 167.4,-80.13 167.4,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.75,-56.25 168.5,-56.25 168.5,-37 243.75,-37 243.75,-56.25"/>
-<text text-anchor="middle" x="206.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.15,-78.01C131.87,-73.36 150.48,-66.57 167.14,-60.49"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.1,-63.86 176.29,-57.15 165.7,-57.29 168.1,-63.86"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.25,-19.25 179,-19.25 179,0 233.25,0 233.25,-19.25"/>
-<text text-anchor="middle" x="206.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node8 -->
-<g id="edge7_Node000003_Node000008" class="edge">
-<title>Node3&#45;&gt;Node8</title>
-<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.46,-74.78C123.84,-72.06 128.49,-68.91 132.5,-65.62 150.5,-50.89 149.77,-41.42 168.5,-27.62 169.62,-26.8 170.79,-25.99 171.99,-25.21"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.34,-28.47 180.23,-20.43 169.83,-22.42 173.34,-28.47"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.map b/de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.map
deleted file mode 100644
index 50d0255f3..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="sorting::merge_insertion::merge" name="sorting::merge_insertion::merge">
-<area shape="rect" id="Node000001" title="Perform merge of data in a window." alt="" coords="5,5,166,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/data.html#" title=" " alt="" coords="214,13,323,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="166,23,198,23,198,28,166,28"/>
-</map>
diff --git a/de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.md5 b/de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.md5
deleted file mode 100644
index 99d66d6b0..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a33eee7458ce96d7113efc4984eb8bf5
\ No newline at end of file
diff --git a/de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.svg b/de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.svg
deleted file mode 100644
index 34225b68f..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::merge_insertion::merge Pages: 1 -->
-<svg width="246pt" height="39pt"
- viewBox="0.00 0.00 246.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>sorting::merge_insertion::merge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Perform merge of data in a window.">
-<polygon fill="#999999" stroke="#666666" points="120.25,-30.5 0,-30.5 0,0 120.25,0 120.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge_insertion</text>
-<text text-anchor="middle" x="60.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::merge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/data.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.25,-24.88 156.25,-24.88 156.25,-5.63 238.25,-5.63 238.25,-24.88"/>
-<text text-anchor="middle" x="197.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.39,-15.25C128.49,-15.25 136.75,-15.25 144.7,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.55,-18.75 154.55,-15.25 144.55,-11.75 144.55,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph_org.svg b/de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph_org.svg
deleted file mode 100644
index b30d4270d..000000000
--- a/de/d7b/merge__insertion__sort_8cpp_af4de4067a9a866ffd985c5b5055ccedf_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: sorting::merge_insertion::merge Pages: 1 -->
-<svg width="246pt" height="39pt"
- viewBox="0.00 0.00 246.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>sorting::merge_insertion::merge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Perform merge of data in a window.">
-<polygon fill="#999999" stroke="#666666" points="120.25,-30.5 0,-30.5 0,0 120.25,0 120.25,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">sorting::merge_insertion</text>
-<text text-anchor="middle" x="60.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::merge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/data.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="238.25,-24.88 156.25,-24.88 156.25,-5.63 238.25,-5.63 238.25,-24.88"/>
-<text text-anchor="middle" x="197.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::data</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M120.39,-15.25C128.49,-15.25 136.75,-15.25 144.7,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="144.55,-18.75 154.55,-15.25 144.55,-11.75 144.55,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d7b/merge__insertion__sort_8cpp_source.html b/de/d7b/merge__insertion__sort_8cpp_source.html
new file mode 100644
index 000000000..f14686f63
--- /dev/null
+++ b/de/d7b/merge__insertion__sort_8cpp_source.html
@@ -0,0 +1,260 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: sorting/merge_insertion_sort.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/d7b/merge__insertion__sort_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">merge_insertion_sort.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/d7b/merge__insertion__sort_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;array&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;memory&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d91/namespacesorting.html">sorting</a> {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../de/d0a/namespacemerge__insertion.html">merge_insertion</a> {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keywordtype">size_t</span> N&gt;</div>
+<div class="foldopen" id="foldopen00037" data-start="{" data-end="}">
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"><a class="line" href="../../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1">   37</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1">InsertionSort</a>(std::array&lt;T, N&gt; *A, <span class="keywordtype">size_t</span> start, <span class="keywordtype">size_t</span> end) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordtype">size_t</span> i = 0, j = 0;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    T *ptr = A-&gt;data();</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">for</span> (i = start; i &lt; end; i++) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        T temp = ptr[i];</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        j = i;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="keywordflow">while</span> (j &gt; start &amp;&amp; temp &lt; ptr[j - 1]) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>            ptr[j] = ptr[j - 1];</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            j--;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="comment">//   for (j = i; j &gt; start &amp;&amp; temp &lt; ptr[j - 1]; --j) {</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        <span class="comment">//       ptr[j] = ptr[j - 1];</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="comment">//   }</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        ptr[j] = temp;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    }</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>}</div>
+</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keywordtype">size_t</span> N&gt;</div>
+<div class="foldopen" id="foldopen00067" data-start="{" data-end="}">
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../de/d7b/merge__insertion__sort_8cpp.html#af4de4067a9a866ffd985c5b5055ccedf">   67</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> merge(std::array&lt;T, N&gt; *array, <span class="keywordtype">size_t</span> min, <span class="keywordtype">size_t</span> max, <span class="keywordtype">size_t</span> mid) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keywordtype">size_t</span> firstIndex = min;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordtype">size_t</span> secondIndex = mid + 1;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keyword">auto</span> ptr = array-&gt;data();</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    std::array&lt;T, N + 1&gt; tempArray{0};</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="comment">// While there are elements in the left or right runs</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> index = min; index &lt;= max; index++) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="comment">// If left run head exists and is &lt;= existing right run head.</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        <span class="keywordflow">if</span> (firstIndex &lt;= mid &amp;&amp;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            (secondIndex &gt; max || ptr[firstIndex] &lt;= ptr[secondIndex])) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            tempArray[index] = ptr[firstIndex];</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>            firstIndex++;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>            tempArray[index] = ptr[secondIndex];</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            secondIndex++;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        }</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    }</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <span class="comment">// transfer to the initial array</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    memcpy(ptr + min, tempArray.data() + min, (max - min) * <span class="keyword">sizeof</span>(T));</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="comment">//  for (int index = min; index &lt;= max; index++) ptr[index] =</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    <span class="comment">//  tempArray[index];</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>}</div>
+</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keywordtype">size_t</span> N&gt;</div>
+<div class="foldopen" id="foldopen00107" data-start="{" data-end="}">
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"><a class="line" href="../../de/d7b/merge__insertion__sort_8cpp.html#a7161278f18e83b671c6454b139cc5674">  107</a></span><span class="keywordtype">void</span> mergeSort(std::array&lt;T, N&gt; *array, <span class="keywordtype">size_t</span> min, <span class="keywordtype">size_t</span> max,</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>               <span class="keywordtype">size_t</span> threshold) {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="comment">// prerequisite</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordflow">if</span> ((max - min) &lt;= threshold) {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        <a class="code hl_function" href="../../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1">InsertionSort</a>(array, min, max);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        <span class="comment">// get the middle point</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        <span class="keywordtype">size_t</span> mid = (max + min) &gt;&gt; 1;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>        <span class="comment">// apply merge sort to both parts of this</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        mergeSort(array, min, mid, threshold);</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        mergeSort(array, mid, max, threshold);</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        <span class="comment">// and finally merge all that sorted stuff</span></div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        merge(array, min, max, mid);</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    }</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>}</div>
+</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>}  <span class="comment">// namespace merge_insertion</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>}  <span class="comment">// namespace sorting</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span> </div>
+<div class="foldopen" id="foldopen00132" data-start="{" data-end="}">
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"><a class="line" href="../../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  132</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <span class="keyword">constexpr</span> <span class="keywordtype">size_t</span> size = 30;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    std::array&lt;int, size&gt; array{0};</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <span class="comment">// input</span></div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        array[i] = std::rand() % 100 - 50;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>        std::cout &lt;&lt; array[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    }</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    sorting::merge_insertion::InsertionSort(&amp;array, 0, size);</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <span class="comment">//  sorting::merge_insertion::mergeSort(&amp;array, 0, size, 10);</span></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span> </div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <span class="comment">// output</span></div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; ++i) {</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        std::cout &lt;&lt; array[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    }</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    assert(std::is_sorted(std::begin(array), std::end(array)));</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test passed\n&quot;</span>;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>}</div>
+</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span> </div>
+<div class="foldopen" id="foldopen00159" data-start="{" data-end="}">
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"><a class="line" href="../../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  159</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    std::srand(std::time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    <a class="code hl_function" href="../../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>}</div>
+</div>
+<div class="ttc" id="amerge__insertion__sort_8cpp_html_a0cba4fbf287ab8cb978ed7f8fef886b1"><div class="ttname"><a href="../../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1">sorting::merge_insertion::InsertionSort</a></div><div class="ttdeci">static void InsertionSort(std::array&lt; T, N &gt; *A, size_t start, size_t end)</div><div class="ttdoc">Insertion merge algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00037">merge_insertion_sort.cpp:37</a></div></div>
+<div class="ttc" id="amerge__insertion__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test code using random arrays.</div><div class="ttdef"><b>Definition</b> <a href="#l00132">merge_insertion_sort.cpp:132</a></div></div>
+<div class="ttc" id="amerge__insertion__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00159">merge_insertion_sort.cpp:159</a></div></div>
+<div class="ttc" id="anamespacemerge__insertion_html"><div class="ttname"><a href="../../de/d0a/namespacemerge__insertion.html">merge_insertion</a></div><div class="ttdoc">Combined Intersion-Merge sorting algorithm.</div></div>
+<div class="ttc" id="anamespacesorting_html"><div class="ttname"><a href="../../d5/d91/namespacesorting.html">sorting</a></div><div class="ttdoc">for working with vectors</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_bb1b521853a9c46347182a9d10420771.html">sorting</a></li><li class="navelem"><a class="el" href="../../de/d7b/merge__insertion__sort_8cpp.html">merge_insertion_sort.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/d7c/struct_trie_1_1_trie_node-members.html b/de/d7c/struct_trie_1_1_trie_node-members.html
index 769df31b6..7b77babf0 100644
--- a/de/d7c/struct_trie_1_1_trie_node-members.html
+++ b/de/d7c/struct_trie_1_1_trie_node-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/d83/namespaceis__graph__bipartite.html b/de/d83/namespaceis__graph__bipartite.html
index 3c572953e..d8495a12c 100644
--- a/de/d83/namespaceis__graph__bipartite.html
+++ b/de/d83/namespaceis__graph__bipartite.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: is_graph_bipartite Namespace Reference</title>
+<title>TheAlgorithms/C++: is_graph_bipartite Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/d85/decimal__to__roman__numeral_8cpp.html b/de/d85/decimal__to__roman__numeral_8cpp.html
index 3726affa0..b566eb2c8 100644
--- a/de/d85/decimal__to__roman__numeral_8cpp.html
+++ b/de/d85/decimal__to__roman__numeral_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/decimal_to_roman_numeral.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/decimal_to_roman_numeral.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,20 +138,24 @@ Include dependency graph for decimal_to_roman_numeral.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d43/decimal__to__roman__numeral_8cpp__incl.svg" width="328" height="126"><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">
+</div>
+<p><a href="../../de/d85/decimal__to__roman__numeral_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a88203bd297e8405160c132faa1187780" id="r_a88203bd297e8405160c132faa1187780"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a88203bd297e8405160c132faa1187780">fill</a> (char c, int n)</td></tr>
+<tr class="memitem:a88203bd297e8405160c132faa1187780" id="r_a88203bd297e8405160c132faa1187780"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a88203bd297e8405160c132faa1187780">fill</a> (char c, int n)</td></tr>
 <tr class="separator:a88203bd297e8405160c132faa1187780"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a003fb4e1b08279fe4cd50fbbc2782c2d" id="r_a003fb4e1b08279fe4cd50fbbc2782c2d"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a> (int n)</td></tr>
+<tr class="memitem:a003fb4e1b08279fe4cd50fbbc2782c2d" id="r_a003fb4e1b08279fe4cd50fbbc2782c2d"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a> (int n)</td></tr>
 <tr class="separator:a003fb4e1b08279fe4cd50fbbc2782c2d"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a214743638eff1336f835310049aef979" id="r_a214743638eff1336f835310049aef979"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a214743638eff1336f835310049aef979">toupperRoman</a> (int n)</td></tr>
+<tr class="memitem:a214743638eff1336f835310049aef979" id="r_a214743638eff1336f835310049aef979"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a214743638eff1336f835310049aef979">toupperRoman</a> (int n)</td></tr>
 <tr class="separator:a214743638eff1336f835310049aef979"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
 <tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>This Programme Converts a given decimal number in the range [0,4000) to both Lower case and Upper case Roman Numeral. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../de/d85/decimal__to__roman__numeral_8cpp_source.html">decimal_to_roman_numeral.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a88203bd297e8405160c132faa1187780" name="a88203bd297e8405160c132faa1187780"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a88203bd297e8405160c132faa1187780">&#9670;&#160;</a></span>fill()</h2>
@@ -143,7 +164,7 @@ Functions</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> fill </td>
+          <td class="memname">std::string fill </td>
           <td>(</td>
           <td class="paramtype">char</td>          <td class="paramname"><span class="paramname"><em>c</em></span>, </td>
         </tr>
@@ -155,12 +176,13 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>This functions fills a string with character c, n times and returns it </p><dl class="section note"><dt>Note</dt><dd>This can probably be replace by <code>memcpy</code> function. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d85/decimal__to__roman__numeral_8cpp_source.html#l00015">15</a> of file <a class="el" href="../../de/d85/decimal__to__roman__numeral_8cpp_source.html">decimal_to_roman_numeral.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   15</span>                              {</div>
-<div class="line"><span class="lineno">   16</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> s = <span class="stringliteral">&quot;&quot;</span>;</div>
+<div class="line"><span class="lineno">   16</span>    std::string s = <span class="stringliteral">&quot;&quot;</span>;</div>
 <div class="line"><span class="lineno">   17</span>    <span class="keywordflow">while</span> (n--) s += c;</div>
 <div class="line"><span class="lineno">   18</span>    <span class="keywordflow">return</span> s;</div>
 <div class="line"><span class="lineno">   19</span>}</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -179,25 +201,20 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d85/decimal__to__roman__numeral_8cpp_source.html#l00090">90</a> of file <a class="el" href="../../de/d85/decimal__to__roman__numeral_8cpp_source.html">decimal_to_roman_numeral.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   90</span>           {</div>
 <div class="line"><span class="lineno">   91</span>    <span class="keywordtype">int</span> n;</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> &lt;&lt; <span class="stringliteral">&quot;\t\tRoman numbers converter\n\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   93</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Type in decimal number between 0 up to 4000 (exclusive): &quot;</span>;</div>
-<div class="line"><span class="lineno">   94</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;</div>
-<div class="line"><span class="lineno">   95</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; in Upper Roman Numerals is &quot;</span> &lt;&lt; <a class="code hl_function" href="#a214743638eff1336f835310049aef979">toupperRoman</a>(n) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   96</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; in Lower Roman Numerals is &quot;</span> &lt;&lt; <a class="code hl_function" href="#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\t\tRoman numbers converter\n\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   93</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Type in decimal number between 0 up to 4000 (exclusive): &quot;</span>;</div>
+<div class="line"><span class="lineno">   94</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><span class="lineno">   95</span>    std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; in Upper Roman Numerals is &quot;</span> &lt;&lt; <a class="code hl_function" href="#a214743638eff1336f835310049aef979">toupperRoman</a>(n) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   96</span>    std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; in Lower Roman Numerals is &quot;</span> &lt;&lt; <a class="code hl_function" href="#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   97</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   98</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="adecimal__to__roman__numeral_8cpp_html_a003fb4e1b08279fe4cd50fbbc2782c2d"><div class="ttname"><a href="#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a></div><div class="ttdeci">std::string tolowerRoman(int n)</div><div class="ttdef"><b>Definition</b> decimal_to_roman_numeral.cpp:24</div></div>
-<div class="ttc" id="adecimal__to__roman__numeral_8cpp_html_a214743638eff1336f835310049aef979"><div class="ttname"><a href="#a214743638eff1336f835310049aef979">toupperRoman</a></div><div class="ttdeci">std::string toupperRoman(int n)</div><div class="ttdef"><b>Definition</b> decimal_to_roman_numeral.cpp:58</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="302" height="134"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="adecimal__to__roman__numeral_8cpp_html_a003fb4e1b08279fe4cd50fbbc2782c2d"><div class="ttname"><a href="#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a></div><div class="ttdeci">std::string tolowerRoman(int n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d85/decimal__to__roman__numeral_8cpp_source.html#l00024">decimal_to_roman_numeral.cpp:24</a></div></div>
+<div class="ttc" id="adecimal__to__roman__numeral_8cpp_html_a214743638eff1336f835310049aef979"><div class="ttname"><a href="#a214743638eff1336f835310049aef979">toupperRoman</a></div><div class="ttdeci">std::string toupperRoman(int n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d85/decimal__to__roman__numeral_8cpp_source.html#l00058">decimal_to_roman_numeral.cpp:58</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a003fb4e1b08279fe4cd50fbbc2782c2d" name="a003fb4e1b08279fe4cd50fbbc2782c2d"></a>
@@ -207,7 +224,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> tolowerRoman </td>
+          <td class="memname">std::string tolowerRoman </td>
           <td>(</td>
           <td class="paramtype">int</td>          <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
           <td></td>
@@ -215,13 +232,15 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>to convert to lowercase Roman Numeral the function works recursively </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d85/decimal__to__roman__numeral_8cpp_source.html#l00024">24</a> of file <a class="el" href="../../de/d85/decimal__to__roman__numeral_8cpp_source.html">decimal_to_roman_numeral.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   24</span>                              {</div>
 <div class="line"><span class="lineno">   25</span>    <span class="keywordflow">if</span> (n &lt; 4)</div>
 <div class="line"><span class="lineno">   26</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;i&#39;</span>, n);</div>
 <div class="line"><span class="lineno">   27</span>    <span class="keywordflow">if</span> (n &lt; 6)</div>
 <div class="line"><span class="lineno">   28</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;i&#39;</span>, 5 - n) + <span class="stringliteral">&quot;v&quot;</span>;</div>
 <div class="line"><span class="lineno">   29</span>    <span class="keywordflow">if</span> (n &lt; 9)</div>
-<div class="line"><span class="lineno">   30</span>        <span class="keywordflow">return</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>(<span class="stringliteral">&quot;v&quot;</span>) + <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;i&#39;</span>, n - 5);</div>
+<div class="line"><span class="lineno">   30</span>        <span class="keywordflow">return</span> std::string(<span class="stringliteral">&quot;v&quot;</span>) + <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;i&#39;</span>, n - 5);</div>
 <div class="line"><span class="lineno">   31</span>    <span class="keywordflow">if</span> (n &lt; 11)</div>
 <div class="line"><span class="lineno">   32</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;i&#39;</span>, 10 - n) + <span class="stringliteral">&quot;x&quot;</span>;</div>
 <div class="line"><span class="lineno">   33</span>    <span class="keywordflow">if</span> (n &lt; 40)</div>
@@ -229,7 +248,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   35</span>    <span class="keywordflow">if</span> (n &lt; 60)</div>
 <div class="line"><span class="lineno">   36</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;x&#39;</span>, 5 - n / 10) + <span class="charliteral">&#39;l&#39;</span> + <a class="code hl_function" href="#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n % 10);</div>
 <div class="line"><span class="lineno">   37</span>    <span class="keywordflow">if</span> (n &lt; 90)</div>
-<div class="line"><span class="lineno">   38</span>        <span class="keywordflow">return</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>(<span class="stringliteral">&quot;l&quot;</span>) + <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;x&#39;</span>, n / 10 - 5) + <a class="code hl_function" href="#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n % 10);</div>
+<div class="line"><span class="lineno">   38</span>        <span class="keywordflow">return</span> std::string(<span class="stringliteral">&quot;l&quot;</span>) + <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;x&#39;</span>, n / 10 - 5) + <a class="code hl_function" href="#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n % 10);</div>
 <div class="line"><span class="lineno">   39</span>    <span class="keywordflow">if</span> (n &lt; 110)</div>
 <div class="line"><span class="lineno">   40</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;x&#39;</span>, 10 - n / 10) + <span class="stringliteral">&quot;c&quot;</span> + <a class="code hl_function" href="#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n % 10);</div>
 <div class="line"><span class="lineno">   41</span>    <span class="keywordflow">if</span> (n &lt; 400)</div>
@@ -237,7 +256,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   43</span>    <span class="keywordflow">if</span> (n &lt; 600)</div>
 <div class="line"><span class="lineno">   44</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;c&#39;</span>, 5 - n / 100) + <span class="charliteral">&#39;d&#39;</span> + <a class="code hl_function" href="#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n % 100);</div>
 <div class="line"><span class="lineno">   45</span>    <span class="keywordflow">if</span> (n &lt; 900)</div>
-<div class="line"><span class="lineno">   46</span>        <span class="keywordflow">return</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>(<span class="stringliteral">&quot;d&quot;</span>) + <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;c&#39;</span>, n / 100 - 5) +</div>
+<div class="line"><span class="lineno">   46</span>        <span class="keywordflow">return</span> std::string(<span class="stringliteral">&quot;d&quot;</span>) + <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;c&#39;</span>, n / 100 - 5) +</div>
 <div class="line"><span class="lineno">   47</span>               <a class="code hl_function" href="#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n % 100);</div>
 <div class="line"><span class="lineno">   48</span>    <span class="keywordflow">if</span> (n &lt; 1100)</div>
 <div class="line"><span class="lineno">   49</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;c&#39;</span>, 10 - n / 100) + <span class="stringliteral">&quot;m&quot;</span> + <a class="code hl_function" href="#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n % 100);</div>
@@ -245,13 +264,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   51</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;m&#39;</span>, n / 1000) + <a class="code hl_function" href="#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n % 1000);</div>
 <div class="line"><span class="lineno">   52</span>    <span class="keywordflow">return</span> <span class="stringliteral">&quot;?&quot;</span>;</div>
 <div class="line"><span class="lineno">   53</span>}</div>
-<div class="ttc" id="adecimal__to__roman__numeral_8cpp_html_a88203bd297e8405160c132faa1187780"><div class="ttname"><a href="#a88203bd297e8405160c132faa1187780">fill</a></div><div class="ttdeci">std::string fill(char c, int n)</div><div class="ttdef"><b>Definition</b> decimal_to_roman_numeral.cpp:15</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.svg" width="203" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="adecimal__to__roman__numeral_8cpp_html_a88203bd297e8405160c132faa1187780"><div class="ttname"><a href="#a88203bd297e8405160c132faa1187780">fill</a></div><div class="ttdeci">std::string fill(char c, int n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d85/decimal__to__roman__numeral_8cpp_source.html#l00015">decimal_to_roman_numeral.cpp:15</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a214743638eff1336f835310049aef979" name="a214743638eff1336f835310049aef979"></a>
@@ -261,7 +275,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> toupperRoman </td>
+          <td class="memname">std::string toupperRoman </td>
           <td>(</td>
           <td class="paramtype">int</td>          <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
           <td></td>
@@ -269,13 +283,15 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>to convert to uppercase Roman Numeral the function works recursively </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d85/decimal__to__roman__numeral_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../de/d85/decimal__to__roman__numeral_8cpp_source.html">decimal_to_roman_numeral.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   58</span>                              {</div>
 <div class="line"><span class="lineno">   59</span>    <span class="keywordflow">if</span> (n &lt; 4)</div>
 <div class="line"><span class="lineno">   60</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;I&#39;</span>, n);</div>
 <div class="line"><span class="lineno">   61</span>    <span class="keywordflow">if</span> (n &lt; 6)</div>
 <div class="line"><span class="lineno">   62</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;I&#39;</span>, 5 - n) + <span class="stringliteral">&quot;V&quot;</span>;</div>
 <div class="line"><span class="lineno">   63</span>    <span class="keywordflow">if</span> (n &lt; 9)</div>
-<div class="line"><span class="lineno">   64</span>        <span class="keywordflow">return</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>(<span class="stringliteral">&quot;V&quot;</span>) + <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;I&#39;</span>, n - 5);</div>
+<div class="line"><span class="lineno">   64</span>        <span class="keywordflow">return</span> std::string(<span class="stringliteral">&quot;V&quot;</span>) + <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;I&#39;</span>, n - 5);</div>
 <div class="line"><span class="lineno">   65</span>    <span class="keywordflow">if</span> (n &lt; 11)</div>
 <div class="line"><span class="lineno">   66</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;I&#39;</span>, 10 - n) + <span class="stringliteral">&quot;X&quot;</span>;</div>
 <div class="line"><span class="lineno">   67</span>    <span class="keywordflow">if</span> (n &lt; 40)</div>
@@ -283,7 +299,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   69</span>    <span class="keywordflow">if</span> (n &lt; 60)</div>
 <div class="line"><span class="lineno">   70</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;X&#39;</span>, 5 - n / 10) + <span class="charliteral">&#39;L&#39;</span> + <a class="code hl_function" href="#a214743638eff1336f835310049aef979">toupperRoman</a>(n % 10);</div>
 <div class="line"><span class="lineno">   71</span>    <span class="keywordflow">if</span> (n &lt; 90)</div>
-<div class="line"><span class="lineno">   72</span>        <span class="keywordflow">return</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>(<span class="stringliteral">&quot;L&quot;</span>) + <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;X&#39;</span>, n / 10 - 5) + <a class="code hl_function" href="#a214743638eff1336f835310049aef979">toupperRoman</a>(n % 10);</div>
+<div class="line"><span class="lineno">   72</span>        <span class="keywordflow">return</span> std::string(<span class="stringliteral">&quot;L&quot;</span>) + <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;X&#39;</span>, n / 10 - 5) + <a class="code hl_function" href="#a214743638eff1336f835310049aef979">toupperRoman</a>(n % 10);</div>
 <div class="line"><span class="lineno">   73</span>    <span class="keywordflow">if</span> (n &lt; 110)</div>
 <div class="line"><span class="lineno">   74</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;X&#39;</span>, 10 - n / 10) + <span class="stringliteral">&quot;C&quot;</span> + <a class="code hl_function" href="#a214743638eff1336f835310049aef979">toupperRoman</a>(n % 10);</div>
 <div class="line"><span class="lineno">   75</span>    <span class="keywordflow">if</span> (n &lt; 400)</div>
@@ -291,7 +307,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   77</span>    <span class="keywordflow">if</span> (n &lt; 600)</div>
 <div class="line"><span class="lineno">   78</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;C&#39;</span>, 5 - n / 100) + <span class="charliteral">&#39;D&#39;</span> + <a class="code hl_function" href="#a214743638eff1336f835310049aef979">toupperRoman</a>(n % 100);</div>
 <div class="line"><span class="lineno">   79</span>    <span class="keywordflow">if</span> (n &lt; 900)</div>
-<div class="line"><span class="lineno">   80</span>        <span class="keywordflow">return</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>(<span class="stringliteral">&quot;D&quot;</span>) + <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;C&#39;</span>, n / 100 - 5) +</div>
+<div class="line"><span class="lineno">   80</span>        <span class="keywordflow">return</span> std::string(<span class="stringliteral">&quot;D&quot;</span>) + <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;C&#39;</span>, n / 100 - 5) +</div>
 <div class="line"><span class="lineno">   81</span>               <a class="code hl_function" href="#a214743638eff1336f835310049aef979">toupperRoman</a>(n % 100);</div>
 <div class="line"><span class="lineno">   82</span>    <span class="keywordflow">if</span> (n &lt; 1100)</div>
 <div class="line"><span class="lineno">   83</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;C&#39;</span>, 10 - n / 100) + <span class="stringliteral">&quot;M&quot;</span> + <a class="code hl_function" href="#a214743638eff1336f835310049aef979">toupperRoman</a>(n % 100);</div>
@@ -299,12 +315,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   85</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;M&#39;</span>, n / 1000) + <a class="code hl_function" href="#a214743638eff1336f835310049aef979">toupperRoman</a>(n % 1000);</div>
 <div class="line"><span class="lineno">   86</span>    <span class="keywordflow">return</span> <span class="stringliteral">&quot;?&quot;</span>;</div>
 <div class="line"><span class="lineno">   87</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.svg" width="204" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.map b/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.map
deleted file mode 100644
index c3b69927d..000000000
--- a/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="tolowerRoman" name="tolowerRoman">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,111,55"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="37,30,33,21,35,11,44,5,58,3,73,5,81,12,78,16,71,10,58,8,46,10,40,14,38,20,42,28"/>
-<area shape="rect" id="Node000002" href="$de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780" title=" " alt="" coords="159,29,197,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="111,40,143,40,143,45,111,45"/>
-</map>
diff --git a/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.md5 b/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.md5
deleted file mode 100644
index 036859bb6..000000000
--- a/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-287d4b250a017ff628088ab4cee0628b
\ No newline at end of file
diff --git a/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.svg b/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.svg
deleted file mode 100644
index 944de37e3..000000000
--- a/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.svg
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tolowerRoman Pages: 1 -->
-<svg width="152pt" height="45pt"
- viewBox="0.00 0.00 151.80 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>tolowerRoman</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="79,-19.25 0,-19.25 0,0 79,0 79,-19.25"/>
-<text text-anchor="middle" x="39.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tolowerRoman</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.43,-19.54C19.01,-28.15 23.7,-37.25 39.5,-37.25 48.14,-37.25 53.46,-34.53 55.46,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="58.95,-30.31 53.83,-21.03 52.05,-31.47 58.95,-30.31"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.8,-19.25 115,-19.25 115,0 143.8,0 143.8,-19.25"/>
-<text text-anchor="middle" x="129.4" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.31,-9.62C87.54,-9.62 96.02,-9.62 103.56,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.3,-13.13 113.3,-9.63 103.3,-6.13 103.3,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph_org.svg b/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph_org.svg
deleted file mode 100644
index 3e80bca2b..000000000
--- a/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph_org.svg
+++ /dev/null
@@ -1,48 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tolowerRoman Pages: 1 -->
-<svg width="152pt" height="45pt"
- viewBox="0.00 0.00 151.80 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>tolowerRoman</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="79,-19.25 0,-19.25 0,0 79,0 79,-19.25"/>
-<text text-anchor="middle" x="39.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tolowerRoman</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.43,-19.54C19.01,-28.15 23.7,-37.25 39.5,-37.25 48.14,-37.25 53.46,-34.53 55.46,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="58.95,-30.31 53.83,-21.03 52.05,-31.47 58.95,-30.31"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143.8,-19.25 115,-19.25 115,0 143.8,0 143.8,-19.25"/>
-<text text-anchor="middle" x="129.4" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M79.31,-9.62C87.54,-9.62 96.02,-9.62 103.56,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.3,-13.13 113.3,-9.63 103.3,-6.13 103.3,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.map b/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.map
deleted file mode 100644
index c4de56222..000000000
--- a/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="toupperRoman" name="toupperRoman">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,112,55"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="37,30,33,21,36,11,44,5,59,3,74,5,82,12,78,16,71,10,58,8,46,10,40,14,39,20,42,28"/>
-<area shape="rect" id="Node000002" href="$de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780" title=" " alt="" coords="160,29,198,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="112,40,144,40,144,45,112,45"/>
-</map>
diff --git a/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.md5 b/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.md5
deleted file mode 100644
index a9a737523..000000000
--- a/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-af9436d3bbf68467c40bd250af526158
\ No newline at end of file
diff --git a/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.svg b/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.svg
deleted file mode 100644
index 792d1e40e..000000000
--- a/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.svg
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: toupperRoman Pages: 1 -->
-<svg width="153pt" height="45pt"
- viewBox="0.00 0.00 152.55 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>toupperRoman</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="79.75,-19.25 0,-19.25 0,0 79.75,0 79.75,-19.25"/>
-<text text-anchor="middle" x="39.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">toupperRoman</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.74,-19.54C19.3,-28.15 24.01,-37.25 39.88,-37.25 48.55,-37.25 53.89,-34.53 55.9,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="59.39,-30.3 54.26,-21.03 52.49,-31.48 59.39,-30.3"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="144.55,-19.25 115.75,-19.25 115.75,0 144.55,0 144.55,-19.25"/>
-<text text-anchor="middle" x="130.15" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.11,-9.62C88.35,-9.62 96.82,-9.62 104.36,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="104.08,-13.13 114.08,-9.63 104.08,-6.13 104.08,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph_org.svg b/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph_org.svg
deleted file mode 100644
index 0a36c8b0f..000000000
--- a/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph_org.svg
+++ /dev/null
@@ -1,48 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: toupperRoman Pages: 1 -->
-<svg width="153pt" height="45pt"
- viewBox="0.00 0.00 152.55 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>toupperRoman</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="79.75,-19.25 0,-19.25 0,0 79.75,0 79.75,-19.25"/>
-<text text-anchor="middle" x="39.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">toupperRoman</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.74,-19.54C19.3,-28.15 24.01,-37.25 39.88,-37.25 48.55,-37.25 53.89,-34.53 55.9,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="59.39,-30.3 54.26,-21.03 52.49,-31.48 59.39,-30.3"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="144.55,-19.25 115.75,-19.25 115.75,0 144.55,0 144.55,-19.25"/>
-<text text-anchor="middle" x="130.15" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">fill</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M80.11,-9.62C88.35,-9.62 96.82,-9.62 104.36,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="104.08,-13.13 114.08,-9.63 104.08,-6.13 104.08,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 4e7f72d6d..000000000
--- a/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,67,55,92"/>
-<area shape="rect" id="Node000002" href="$de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d" title=" " alt="" coords="103,29,208,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,70,95,57,97,62,56,75"/>
-<area shape="rect" id="Node000004" href="$de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979" title=" " alt="" coords="103,103,209,128"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="56,84,94,95,93,100,54,89"/>
-<area shape="poly" id="edge3_Node000002_Node000002" title=" " alt="" coords="135,30,131,21,133,11,142,5,156,3,171,5,179,12,175,16,169,10,156,8,144,10,137,14,136,20,139,28"/>
-<area shape="rect" id="Node000003" href="$de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780" title=" " alt="" coords="257,67,295,92"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="200,53,243,67,241,72,199,58"/>
-<area shape="poly" id="edge5_Node000004_Node000003" title=" " alt="" coords="200,100,242,87,243,92,202,105"/>
-<area shape="poly" id="edge6_Node000004_Node000004" title=" " alt="" coords="135,103,131,94,133,85,142,78,156,76,171,79,179,85,175,89,169,84,156,81,144,83,137,88,136,94,139,101"/>
-</map>
diff --git a/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index c8666b7e0..000000000
--- a/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7227ffb7daad2198dd0710c0d991780d
\ No newline at end of file
diff --git a/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 3a2ba5fcd..000000000
--- a/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,128 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="226pt" height="100pt"
- viewBox="0.00 0.00 225.55 100.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 96.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-46.25 0,-46.25 0,-27 37,-27 37,-46.25"/>
-<text text-anchor="middle" x="18.5" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152.38,-74.25 73.38,-74.25 73.38,-55 152.38,-55 152.38,-74.25"/>
-<text text-anchor="middle" x="112.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">tolowerRoman</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-42.02C46.12,-44.69 57.17,-48.04 68.05,-51.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.75,-54.61 77.34,-54.16 68.78,-47.91 66.75,-54.61"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152.75,-19.25 73,-19.25 73,0 152.75,0 152.75,-19.25"/>
-<text text-anchor="middle" x="112.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">toupperRoman</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-31.42C45.63,-28.99 55.95,-25.97 66.23,-22.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.21,-26.33 75.83,-20.16 65.25,-19.61 67.21,-26.33"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.74,-74.54C92.3,-83.15 97.01,-92.25 112.88,-92.25 121.55,-92.25 126.89,-89.53 128.9,-85.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.39,-85.3 127.26,-76.03 125.49,-86.48 132.39,-85.3"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="217.55,-46.25 188.75,-46.25 188.75,-27 217.55,-27 217.55,-46.25"/>
-<text text-anchor="middle" x="203.15" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">fill</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.74,-54.52C156.25,-51.18 167.77,-47.53 177.64,-44.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.39,-47.83 186.87,-41.47 176.28,-41.16 178.39,-47.83"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.75,-19.68C157.06,-22.83 168.26,-26.26 177.87,-29.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.6,-32.47 187.19,-32.05 178.65,-25.78 176.6,-32.47"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge6_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge6_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.74,-19.54C92.3,-28.15 97.01,-37.25 112.88,-37.25 121.55,-37.25 126.89,-34.53 128.9,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.39,-30.3 127.26,-21.03 125.49,-31.48 132.39,-30.3"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 831520ccc..000000000
--- a/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="226pt" height="100pt"
- viewBox="0.00 0.00 225.55 100.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 96.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-46.25 0,-46.25 0,-27 37,-27 37,-46.25"/>
-<text text-anchor="middle" x="18.5" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152.38,-74.25 73.38,-74.25 73.38,-55 152.38,-55 152.38,-74.25"/>
-<text text-anchor="middle" x="112.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">tolowerRoman</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-42.02C46.12,-44.69 57.17,-48.04 68.05,-51.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.75,-54.61 77.34,-54.16 68.78,-47.91 66.75,-54.61"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="152.75,-19.25 73,-19.25 73,0 152.75,0 152.75,-19.25"/>
-<text text-anchor="middle" x="112.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">toupperRoman</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.31,-31.42C45.63,-28.99 55.95,-25.97 66.23,-22.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.21,-26.33 75.83,-20.16 65.25,-19.61 67.21,-26.33"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.74,-74.54C92.3,-83.15 97.01,-92.25 112.88,-92.25 121.55,-92.25 126.89,-89.53 128.9,-85.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.39,-85.3 127.26,-76.03 125.49,-86.48 132.39,-85.3"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="217.55,-46.25 188.75,-46.25 188.75,-27 217.55,-27 217.55,-46.25"/>
-<text text-anchor="middle" x="203.15" y="-32.75" font-family="Helvetica,sans-Serif" font-size="10.00">fill</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M145.74,-54.52C156.25,-51.18 167.77,-47.53 177.64,-44.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.39,-47.83 186.87,-41.47 176.28,-41.16 178.39,-47.83"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M146.75,-19.68C157.06,-22.83 168.26,-26.26 177.87,-29.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="176.6,-32.47 187.19,-32.05 178.65,-25.78 176.6,-32.47"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge6_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge6_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.74,-19.54C92.3,-28.15 97.01,-37.25 112.88,-37.25 121.55,-37.25 126.89,-34.53 128.9,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.39,-30.3 127.26,-21.03 125.49,-31.48 132.39,-30.3"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d85/decimal__to__roman__numeral_8cpp_source.html b/de/d85/decimal__to__roman__numeral_8cpp_source.html
new file mode 100644
index 000000000..75d0fa1c6
--- /dev/null
+++ b/de/d85/decimal__to__roman__numeral_8cpp_source.html
@@ -0,0 +1,232 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/decimal_to_roman_numeral.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/d85/decimal__to__roman__numeral_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">decimal_to_roman_numeral.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/d85/decimal__to__roman__numeral_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;cstdio&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;cstring&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="foldopen" id="foldopen00015" data-start="{" data-end="}">
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"><a class="line" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">   15</a></span>std::string <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="keywordtype">char</span> c, <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    std::string s = <span class="stringliteral">&quot;&quot;</span>;</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="keywordflow">while</span> (n--) s += c;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="keywordflow">return</span> s;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>}</div>
+</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="foldopen" id="foldopen00024" data-start="{" data-end="}">
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"><a class="line" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">   24</a></span>std::string <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(<span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="keywordflow">if</span> (n &lt; 4)</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;i&#39;</span>, n);</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordflow">if</span> (n &lt; 6)</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;i&#39;</span>, 5 - n) + <span class="stringliteral">&quot;v&quot;</span>;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordflow">if</span> (n &lt; 9)</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        <span class="keywordflow">return</span> std::string(<span class="stringliteral">&quot;v&quot;</span>) + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;i&#39;</span>, n - 5);</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordflow">if</span> (n &lt; 11)</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;i&#39;</span>, 10 - n) + <span class="stringliteral">&quot;x&quot;</span>;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordflow">if</span> (n &lt; 40)</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;x&#39;</span>, n / 10) + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n % 10);</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordflow">if</span> (n &lt; 60)</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;x&#39;</span>, 5 - n / 10) + <span class="charliteral">&#39;l&#39;</span> + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n % 10);</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">if</span> (n &lt; 90)</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <span class="keywordflow">return</span> std::string(<span class="stringliteral">&quot;l&quot;</span>) + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;x&#39;</span>, n / 10 - 5) + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n % 10);</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordflow">if</span> (n &lt; 110)</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;x&#39;</span>, 10 - n / 10) + <span class="stringliteral">&quot;c&quot;</span> + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n % 10);</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">if</span> (n &lt; 400)</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;c&#39;</span>, n / 100) + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n % 100);</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">if</span> (n &lt; 600)</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;c&#39;</span>, 5 - n / 100) + <span class="charliteral">&#39;d&#39;</span> + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n % 100);</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordflow">if</span> (n &lt; 900)</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">return</span> std::string(<span class="stringliteral">&quot;d&quot;</span>) + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;c&#39;</span>, n / 100 - 5) +</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>               <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n % 100);</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">if</span> (n &lt; 1100)</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;c&#39;</span>, 10 - n / 100) + <span class="stringliteral">&quot;m&quot;</span> + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n % 100);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordflow">if</span> (n &lt; 4000)</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;m&#39;</span>, n / 1000) + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n % 1000);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">return</span> <span class="stringliteral">&quot;?&quot;</span>;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>}</div>
+</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="foldopen" id="foldopen00058" data-start="{" data-end="}">
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">   58</a></span>std::string <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">toupperRoman</a>(<span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">if</span> (n &lt; 4)</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;I&#39;</span>, n);</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">if</span> (n &lt; 6)</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;I&#39;</span>, 5 - n) + <span class="stringliteral">&quot;V&quot;</span>;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordflow">if</span> (n &lt; 9)</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        <span class="keywordflow">return</span> std::string(<span class="stringliteral">&quot;V&quot;</span>) + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;I&#39;</span>, n - 5);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordflow">if</span> (n &lt; 11)</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;I&#39;</span>, 10 - n) + <span class="stringliteral">&quot;X&quot;</span>;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">if</span> (n &lt; 40)</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;X&#39;</span>, n / 10) + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">toupperRoman</a>(n % 10);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordflow">if</span> (n &lt; 60)</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;X&#39;</span>, 5 - n / 10) + <span class="charliteral">&#39;L&#39;</span> + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">toupperRoman</a>(n % 10);</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordflow">if</span> (n &lt; 90)</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        <span class="keywordflow">return</span> std::string(<span class="stringliteral">&quot;L&quot;</span>) + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;X&#39;</span>, n / 10 - 5) + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">toupperRoman</a>(n % 10);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">if</span> (n &lt; 110)</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;X&#39;</span>, 10 - n / 10) + <span class="stringliteral">&quot;C&quot;</span> + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">toupperRoman</a>(n % 10);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="keywordflow">if</span> (n &lt; 400)</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;C&#39;</span>, n / 100) + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">toupperRoman</a>(n % 100);</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="keywordflow">if</span> (n &lt; 600)</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;C&#39;</span>, 5 - n / 100) + <span class="charliteral">&#39;D&#39;</span> + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">toupperRoman</a>(n % 100);</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keywordflow">if</span> (n &lt; 900)</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="keywordflow">return</span> std::string(<span class="stringliteral">&quot;D&quot;</span>) + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;C&#39;</span>, n / 100 - 5) +</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>               <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">toupperRoman</a>(n % 100);</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">if</span> (n &lt; 1100)</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;C&#39;</span>, 10 - n / 100) + <span class="stringliteral">&quot;M&quot;</span> + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">toupperRoman</a>(n % 100);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="keywordflow">if</span> (n &lt; 4000)</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(<span class="charliteral">&#39;M&#39;</span>, n / 1000) + <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">toupperRoman</a>(n % 1000);</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordflow">return</span> <span class="stringliteral">&quot;?&quot;</span>;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>}</div>
+</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="foldopen" id="foldopen00090" data-start="{" data-end="}">
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   90</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordtype">int</span> n;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\t\tRoman numbers converter\n\n&quot;</span>;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Type in decimal number between 0 up to 4000 (exclusive): &quot;</span>;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; in Upper Roman Numerals is &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">toupperRoman</a>(n) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    std::cout &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; in Lower Roman Numerals is &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a>(n) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>}</div>
+</div>
+<div class="ttc" id="adecimal__to__roman__numeral_8cpp_html_a003fb4e1b08279fe4cd50fbbc2782c2d"><div class="ttname"><a href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">tolowerRoman</a></div><div class="ttdeci">std::string tolowerRoman(int n)</div><div class="ttdef"><b>Definition</b> <a href="#l00024">decimal_to_roman_numeral.cpp:24</a></div></div>
+<div class="ttc" id="adecimal__to__roman__numeral_8cpp_html_a214743638eff1336f835310049aef979"><div class="ttname"><a href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">toupperRoman</a></div><div class="ttdeci">std::string toupperRoman(int n)</div><div class="ttdef"><b>Definition</b> <a href="#l00058">decimal_to_roman_numeral.cpp:58</a></div></div>
+<div class="ttc" id="adecimal__to__roman__numeral_8cpp_html_a88203bd297e8405160c132faa1187780"><div class="ttname"><a href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a></div><div class="ttdeci">std::string fill(char c, int n)</div><div class="ttdef"><b>Definition</b> <a href="#l00015">decimal_to_roman_numeral.cpp:15</a></div></div>
+<div class="ttc" id="adecimal__to__roman__numeral_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00090">decimal_to_roman_numeral.cpp:90</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../de/d85/decimal__to__roman__numeral_8cpp.html">decimal_to_roman_numeral.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/d88/travelling__salesman__problem_8cpp.html b/de/d88/travelling__salesman__problem_8cpp.html
index bfcb72d2e..018713a7b 100644
--- a/de/d88/travelling__salesman__problem_8cpp.html
+++ b/de/d88/travelling__salesman__problem_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph/travelling_salesman_problem.cpp File Reference</title>
+<title>TheAlgorithms/C++: graph/travelling_salesman_problem.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for travelling_salesman_problem.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d5c/travelling__salesman__problem_8cpp__incl.svg" width="510" height="126"><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">
+</div>
+<p><a href="../../de/d88/travelling__salesman__problem_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></td></tr>
@@ -133,7 +152,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:ab7706341d006e20d1ae58274187a3346" id="r_ab7706341d006e20d1ae58274187a3346"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346">graph::TravellingSalesmanProblem</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint32_t &gt; &gt; *cities, int32_t src, uint32_t V)</td></tr>
+<tr class="memitem:ab7706341d006e20d1ae58274187a3346" id="r_ab7706341d006e20d1ae58274187a3346"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346">graph::TravellingSalesmanProblem</a> (std::vector&lt; std::vector&lt; uint32_t &gt; &gt; *cities, int32_t src, uint32_t V)</td></tr>
 <tr class="memdesc:ab7706341d006e20d1ae58274187a3346"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function calculates the minimum path distance that will cover all the cities starting from the source.  <br /></td></tr>
 <tr class="separator:ab7706341d006e20d1ae58274187a3346"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
@@ -147,6 +166,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>[Travelling Salesman Problem] (<a href="https://en.wikipedia.org/wiki/Travelling_salesman_problem">https://en.wikipedia.org/wiki/Travelling_salesman_problem</a>) implementation </p>
 <dl class="section author"><dt>Author</dt><dd><a href="http://github.com/Mayank17M" target="_blank">Mayank Mamgain</a></dd></dl>
 <p>Travelling salesman problem asks: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? TSP can be modeled as an undirected weighted graph, such that cities are the graph's vertices, paths are the graph's edges, and a path's distance is the edge's weight. It is a minimization problem starting and finishing at a specified vertex after having visited each other vertex exactly once. This is the naive implementation of the problem. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../de/d88/travelling__salesman__problem_8cpp_source.html">travelling_salesman_problem.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -165,26 +186,19 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d88/travelling__salesman__problem_8cpp_source.html#l00105">105</a> of file <a class="el" href="../../de/d88/travelling__salesman__problem_8cpp_source.html">travelling_salesman_problem.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  105</span>           {</div>
 <div class="line"><span class="lineno">  106</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
-<div class="line"><span class="lineno">  107</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;uint32_t&gt;</a>&gt; cities = {</div>
+<div class="line"><span class="lineno">  107</span>    std::vector&lt;std::vector&lt;uint32_t&gt;&gt; cities = {</div>
 <div class="line"><span class="lineno">  108</span>        {0, 5, 10, 15}, {5, 0, 20, 30}, {10, 20, 0, 35}, {15, 30, 35, 0}};</div>
-<div class="line"><span class="lineno">  109</span>    uint32_t V = cities.<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">  110</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346">graph::TravellingSalesmanProblem</a>(&amp;cities, 0, V) &lt;&lt; <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">  109</span>    uint32_t V = cities.size();</div>
+<div class="line"><span class="lineno">  110</span>    std::cout &lt;&lt; <a class="code hl_function" href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346">graph::TravellingSalesmanProblem</a>(&amp;cities, 0, V) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  111</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  112</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="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_ab7706341d006e20d1ae58274187a3346"><div class="ttname"><a href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346">graph::TravellingSalesmanProblem</a></div><div class="ttdeci">int TravellingSalesmanProblem(std::vector&lt; std::vector&lt; uint32_t &gt; &gt; *cities, int32_t src, uint32_t V)</div><div class="ttdoc">Function calculates the minimum path distance that will cover all the cities starting from the source...</div><div class="ttdef"><b>Definition</b> travelling_salesman_problem.cpp:41</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__problem_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> travelling_salesman_problem.cpp:78</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d88/travelling__salesman__problem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="584" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacegraph_html_ab7706341d006e20d1ae58274187a3346"><div class="ttname"><a href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346">graph::TravellingSalesmanProblem</a></div><div class="ttdeci">int TravellingSalesmanProblem(std::vector&lt; std::vector&lt; uint32_t &gt; &gt; *cities, int32_t src, uint32_t V)</div><div class="ttdoc">Function calculates the minimum path distance that will cover all the cities starting from the source...</div><div class="ttdef"><b>Definition</b> <a href="../../de/d88/travelling__salesman__problem_8cpp_source.html#l00041">travelling_salesman_problem.cpp:41</a></div></div>
+<div class="ttc" id="atravelling__salesman__problem_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d88/travelling__salesman__problem_8cpp_source.html#l00078">travelling_salesman_problem.cpp:78</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -212,34 +226,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>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d88/travelling__salesman__problem_8cpp_source.html#l00078">78</a> of file <a class="el" href="../../de/d88/travelling__salesman__problem_8cpp_source.html">travelling_salesman_problem.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   78</span>                    {</div>
-<div class="line"><span class="lineno">   79</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initiatinig Predefined Tests...&quot;</span> &lt;&lt; <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">   80</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initiating Test 1...&quot;</span> &lt;&lt; <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">   81</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;uint32_t&gt;</a>&gt; cities = {</div>
+<div class="line"><span class="lineno">   79</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiatinig Predefined Tests...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 1...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   81</span>    std::vector&lt;std::vector&lt;uint32_t&gt;&gt; cities = {</div>
 <div class="line"><span class="lineno">   82</span>        {0, 20, 42, 35}, {20, 0, 30, 34}, {42, 30, 0, 12}, {35, 34, 12, 0}};</div>
-<div class="line"><span class="lineno">   83</span>    uint32_t V = cities.<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">   83</span>    uint32_t V = cities.size();</div>
 <div class="line"><span class="lineno">   84</span>    assert(<a class="code hl_function" href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346">graph::TravellingSalesmanProblem</a>(&amp;cities, 0, V) == 97);</div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1st test passed...&quot;</span> &lt;&lt; <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">   85</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test passed...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   86</span> </div>
-<div class="line"><span class="lineno">   87</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initiating Test 2...&quot;</span> &lt;&lt; <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">   87</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 2...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   88</span>    cities = {{0, 5, 10, 15}, {5, 0, 20, 30}, {10, 20, 0, 35}, {15, 30, 35, 0}};</div>
-<div class="line"><span class="lineno">   89</span>    V = cities.<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">   89</span>    V = cities.size();</div>
 <div class="line"><span class="lineno">   90</span>    assert(<a class="code hl_function" href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346">graph::TravellingSalesmanProblem</a>(&amp;cities, 0, V) == 75);</div>
-<div class="line"><span class="lineno">   91</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2nd test passed...&quot;</span> &lt;&lt; <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">   91</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test passed...&quot;</span> &lt;&lt; std::endl;</div>
 <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/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initiating Test 3...&quot;</span> &lt;&lt; <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">   93</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 3...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   94</span>    cities = {</div>
 <div class="line"><span class="lineno">   95</span>        {0, 10, 15, 20}, {10, 0, 35, 25}, {15, 35, 0, 30}, {20, 25, 30, 0}};</div>
-<div class="line"><span class="lineno">   96</span>    V = cities.<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">   96</span>    V = cities.size();</div>
 <div class="line"><span class="lineno">   97</span>    assert(<a class="code hl_function" href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346">graph::TravellingSalesmanProblem</a>(&amp;cities, 0, V) == 80);</div>
-<div class="line"><span class="lineno">   98</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;3rd test passed...&quot;</span> &lt;&lt; <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">   98</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test passed...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   99</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d88/travelling__salesman__problem_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="487" height="216"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/de/d88/travelling__salesman__problem_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/de/d88/travelling__salesman__problem_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index f6a09bde0..000000000
--- a/de/d88/travelling__salesman__problem_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,55,56,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="156,5,227,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,56,103,40,140,29,141,34,104,45,57,61"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="134,55,249,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,65,118,65,118,70,56,70"/>
-<area shape="rect" id="Node000004" href="$df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346" title="Function calculates the minimum path distance that will cover all the cities starting from the source..." alt="" coords="104,104,279,145"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="57,74,119,96,117,101,55,79"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="343,37,465,63"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="248,101,278,90,326,72,343,66,345,71,328,77,280,95,250,106"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="348,87,460,112"/>
-<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="279,112,332,105,333,111,280,117"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="370,136,438,162"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="280,132,355,141,355,146,279,137"/>
-<area shape="rect" id="Node000008" 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="327,185,481,211"/>
-<area shape="poly" id="edge7_Node000004_Node000008" title=" " alt="" coords="249,143,328,172,345,177,344,183,326,177,247,148"/>
-</map>
diff --git a/de/d88/travelling__salesman__problem_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/de/d88/travelling__salesman__problem_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 22331a8c1..000000000
--- a/de/d88/travelling__salesman__problem_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2486b996cec8eb80a0cc57523d36daf3
\ No newline at end of file
diff --git a/de/d88/travelling__salesman__problem_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/de/d88/travelling__salesman__problem_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index b848d96ca..000000000
--- a/de/d88/travelling__salesman__problem_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,174 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="365pt" height="162pt"
- viewBox="0.00 0.00 365.00 162.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 158.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-117.25 0,-117.25 0,-98 37.75,-98 37.75,-117.25"/>
-<text text-anchor="middle" x="18.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="166.25,-154.25 112.75,-154.25 112.75,-135 166.25,-135 166.25,-154.25"/>
-<text text-anchor="middle" x="139.5" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.22,-114.44C48.59,-118.21 61.83,-122.87 73.75,-126.62 82.67,-129.43 92.35,-132.25 101.45,-134.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.52,-138.16 111.09,-137.44 102.37,-131.42 100.52,-138.16"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="182.75,-117.25 96.25,-117.25 96.25,-98 182.75,-98 182.75,-117.25"/>
-<text text-anchor="middle" x="139.5" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.15,-107.62C50.61,-107.62 67.81,-107.62 84.46,-107.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.31,-111.13 94.31,-107.63 84.31,-104.13 84.31,-111.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346" target="_top" xlink:title="Function calculates the minimum path distance that will cover all the cities starting from the source...">
-<polygon fill="white" stroke="#666666" points="205.25,-79.88 73.75,-79.88 73.75,-49.38 205.25,-49.38 205.25,-79.88"/>
-<text text-anchor="start" x="81.75" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::TravellingSalesman</text>
-<text text-anchor="middle" x="139.5" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">Problem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.15,-101C50.57,-96.5 67.7,-90.29 84.3,-84.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.44,-87.58 93.65,-80.88 83.05,-81 85.44,-87.58"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="345,-130.25 253.25,-130.25 253.25,-111 345,-111 345,-130.25"/>
-<text text-anchor="middle" x="299.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.03,-80.28C190.44,-83.04 198.08,-85.9 205.25,-88.62 221.3,-94.72 225.06,-96.92 241.25,-102.62 245.42,-104.09 249.77,-105.57 254.14,-107.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="252.89,-110.29 263.48,-110.05 255.05,-103.63 252.89,-110.29"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="341.25,-93.25 257,-93.25 257,-74 341.25,-74 341.25,-93.25"/>
-<text text-anchor="middle" x="299.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M205.52,-72.46C218.77,-74.06 232.55,-75.72 245.31,-77.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.84,-80.73 255.19,-78.45 245.68,-73.78 244.84,-80.73"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.75,-56.25 273.5,-56.25 273.5,-37 324.75,-37 324.75,-56.25"/>
-<text text-anchor="middle" x="299.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M205.52,-57.2C224.95,-54.98 245.54,-52.63 262.35,-50.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.29,-54.24 271.83,-49.63 261.49,-47.29 262.29,-54.24"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="357,-19.25 241.25,-19.25 241.25,0 357,0 357,-19.25"/>
-<text text-anchor="middle" x="299.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.01,-48.9C200.14,-42.16 221.68,-34.31 241.25,-27.62 245.48,-26.18 249.91,-24.71 254.34,-23.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="255.37,-26.61 263.82,-20.21 253.23,-19.94 255.37,-26.61"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d88/travelling__salesman__problem_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/de/d88/travelling__salesman__problem_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index 24f602f26..000000000
--- a/de/d88/travelling__salesman__problem_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,148 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="365pt" height="162pt"
- viewBox="0.00 0.00 365.00 162.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 158.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-117.25 0,-117.25 0,-98 37.75,-98 37.75,-117.25"/>
-<text text-anchor="middle" x="18.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="166.25,-154.25 112.75,-154.25 112.75,-135 166.25,-135 166.25,-154.25"/>
-<text text-anchor="middle" x="139.5" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.22,-114.44C48.59,-118.21 61.83,-122.87 73.75,-126.62 82.67,-129.43 92.35,-132.25 101.45,-134.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.52,-138.16 111.09,-137.44 102.37,-131.42 100.52,-138.16"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="182.75,-117.25 96.25,-117.25 96.25,-98 182.75,-98 182.75,-117.25"/>
-<text text-anchor="middle" x="139.5" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.15,-107.62C50.61,-107.62 67.81,-107.62 84.46,-107.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.31,-111.13 94.31,-107.63 84.31,-104.13 84.31,-111.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346" target="_top" xlink:title="Function calculates the minimum path distance that will cover all the cities starting from the source...">
-<polygon fill="white" stroke="#666666" points="205.25,-79.88 73.75,-79.88 73.75,-49.38 205.25,-49.38 205.25,-79.88"/>
-<text text-anchor="start" x="81.75" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::TravellingSalesman</text>
-<text text-anchor="middle" x="139.5" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">Problem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.15,-101C50.57,-96.5 67.7,-90.29 84.3,-84.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.44,-87.58 93.65,-80.88 83.05,-81 85.44,-87.58"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="345,-130.25 253.25,-130.25 253.25,-111 345,-111 345,-130.25"/>
-<text text-anchor="middle" x="299.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.03,-80.28C190.44,-83.04 198.08,-85.9 205.25,-88.62 221.3,-94.72 225.06,-96.92 241.25,-102.62 245.42,-104.09 249.77,-105.57 254.14,-107.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="252.89,-110.29 263.48,-110.05 255.05,-103.63 252.89,-110.29"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="341.25,-93.25 257,-93.25 257,-74 341.25,-74 341.25,-93.25"/>
-<text text-anchor="middle" x="299.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge5_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M205.52,-72.46C218.77,-74.06 232.55,-75.72 245.31,-77.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="244.84,-80.73 255.19,-78.45 245.68,-73.78 244.84,-80.73"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.75,-56.25 273.5,-56.25 273.5,-37 324.75,-37 324.75,-56.25"/>
-<text text-anchor="middle" x="299.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M205.52,-57.2C224.95,-54.98 245.54,-52.63 262.35,-50.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="262.29,-54.24 271.83,-49.63 261.49,-47.29 262.29,-54.24"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="357,-19.25 241.25,-19.25 241.25,0 357,0 357,-19.25"/>
-<text text-anchor="middle" x="299.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node8 -->
-<g id="edge7_Node000004_Node000008" class="edge">
-<title>Node4&#45;&gt;Node8</title>
-<g id="a_edge7_Node000004_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.01,-48.9C200.14,-42.16 221.68,-34.31 241.25,-27.62 245.48,-26.18 249.91,-24.71 254.34,-23.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="255.37,-26.61 263.82,-20.21 253.23,-19.94 255.37,-26.61"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d88/travelling__salesman__problem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d88/travelling__salesman__problem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 47e7a993c..000000000
--- a/de/d88/travelling__salesman__problem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,22 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,75,55,100"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="253,5,324,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="44,72,69,52,102,34,136,24,172,18,237,14,237,19,172,23,137,29,104,39,72,56,47,76"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="231,61,346,87"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,86,153,85,215,80,216,85,153,90,55,91"/>
-<area shape="rect" id="Node000004" href="$de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self&#45;test implementations." alt="" coords="103,49,153,75"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="54,79,87,70,89,75,56,84"/>
-<area shape="rect" id="Node000005" href="$df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346" title="Function calculates the minimum path distance that will cover all the cities starting from the source..." alt="" coords="201,122,376,162"/>
-<area shape="poly" id="edge11_Node000001_Node000005" title=" " alt="" coords="56,90,187,118,185,123,54,95"/>
-<area shape="poly" id="edge4_Node000004_Node000002" title=" " alt="" coords="153,53,237,29,239,34,154,58"/>
-<area shape="poly" id="edge5_Node000004_Node000003" title=" " alt="" coords="154,61,215,66,215,71,153,67"/>
-<area shape="poly" id="edge6_Node000004_Node000005" title=" " alt="" coords="154,72,202,97,232,112,230,117,200,102,152,77"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="440,55,563,80"/>
-<area shape="poly" id="edge7_Node000005_Node000006" title=" " alt="" coords="342,119,423,89,441,83,443,88,425,94,344,124"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="445,104,558,130"/>
-<area shape="poly" id="edge8_Node000005_Node000007" title=" " alt="" coords="376,129,429,123,430,128,377,134"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="467,153,536,179"/>
-<area shape="poly" id="edge9_Node000005_Node000008" title=" " alt="" coords="377,149,453,158,452,163,376,155"/>
-<area shape="rect" id="Node000009" 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="424,203,579,228"/>
-<area shape="poly" id="edge10_Node000005_Node000009" title=" " alt="" coords="346,161,425,189,443,195,441,200,423,194,344,166"/>
-</map>
diff --git a/de/d88/travelling__salesman__problem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d88/travelling__salesman__problem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 933a7c73c..000000000
--- a/de/d88/travelling__salesman__problem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-88bb1d67efe1faf52c790056e851541c
\ No newline at end of file
diff --git a/de/d88/travelling__salesman__problem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d88/travelling__salesman__problem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 07ed6acf7..000000000
--- a/de/d88/travelling__salesman__problem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,219 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="438pt" height="175pt"
- viewBox="0.00 0.00 438.00 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-115.25 0,-115.25 0,-96 37,-96 37,-115.25"/>
-<text text-anchor="middle" x="18.5" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="239.25,-167.25 185.75,-167.25 185.75,-148 239.25,-148 239.25,-167.25"/>
-<text text-anchor="middle" x="212.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30,-115.63C40.13,-124.63 56.36,-137.38 73,-143.62 105.57,-155.85 145.3,-158.76 173.84,-158.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.84,-162.45 183.82,-158.9 173.8,-155.45 173.84,-162.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.75,-125.25 169.25,-125.25 169.25,-106 255.75,-106 255.75,-125.25"/>
-<text text-anchor="middle" x="212.5" y="-111.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-105.1C55.75,-104.69 85.28,-104.36 110.75,-105.62 126,-106.38 142.5,-107.77 157.64,-109.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.11,-112.75 167.41,-110.3 157.83,-105.79 157.11,-112.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-134.25 73,-134.25 73,-115 110.75,-115 110.75,-134.25"/>
-<text text-anchor="middle" x="91.88" y="-120.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-110.32C44.64,-112.32 53.57,-114.69 61.98,-116.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.91,-120.27 71.48,-119.46 62.71,-113.51 60.91,-120.27"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346" target="_top" xlink:title="Function calculates the minimum path distance that will cover all the cities starting from the source...">
-<polygon fill="white" stroke="#666666" points="278.25,-79.88 146.75,-79.88 146.75,-49.38 278.25,-49.38 278.25,-79.88"/>
-<text text-anchor="start" x="154.75" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::TravellingSalesman</text>
-<text text-anchor="middle" x="212.5" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">Problem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge11_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge11_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.22,-101.84C59.6,-97.06 99.54,-88.53 135.54,-80.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.04,-84.32 145.08,-78.81 134.57,-77.47 136.04,-84.32"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.15,-129.71C128.01,-134.4 153.54,-141.5 174.63,-147.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.47,-150.68 184.04,-149.99 175.34,-143.93 173.47,-150.68"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.15,-123.24C123.61,-122.29 140.81,-120.99 157.46,-119.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.61,-123.22 167.32,-118.98 157.08,-116.24 157.61,-123.22"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge6_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge6_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.79,-115.2C121.25,-109.73 134.72,-102.73 146.75,-96.62 154.05,-92.92 161.85,-89.03 169.4,-85.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.72,-88.53 178.13,-80.96 167.62,-82.25 170.72,-88.53"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="418,-130.25 326.25,-130.25 326.25,-111 418,-111 418,-130.25"/>
-<text text-anchor="middle" x="372.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge7_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge7_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.52,-80.29C271.93,-87.35 294.11,-95.65 314.25,-102.62 318.48,-104.09 322.9,-105.57 327.33,-107.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.21,-110.34 336.8,-110.09 328.36,-103.68 326.21,-110.34"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="414.25,-93.25 330,-93.25 330,-74 414.25,-74 414.25,-93.25"/>
-<text text-anchor="middle" x="372.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge8_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge8_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.52,-72.46C291.77,-74.06 305.55,-75.72 318.31,-77.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.84,-80.73 328.19,-78.45 318.68,-73.78 317.84,-80.73"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.75,-56.25 346.5,-56.25 346.5,-37 397.75,-37 397.75,-56.25"/>
-<text text-anchor="middle" x="372.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge9_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge9_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.52,-57.2C297.95,-54.98 318.54,-52.63 335.35,-50.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="335.29,-54.24 344.83,-49.63 334.49,-47.29 335.29,-54.24"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="430,-19.25 314.25,-19.25 314.25,0 430,0 430,-19.25"/>
-<text text-anchor="middle" x="372.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge10_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge10_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.01,-48.9C273.14,-42.16 294.68,-34.31 314.25,-27.62 318.48,-26.18 322.91,-24.71 327.34,-23.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.37,-26.61 336.82,-20.21 326.23,-19.94 328.37,-26.61"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d88/travelling__salesman__problem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/d88/travelling__salesman__problem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index e4ceb64f3..000000000
--- a/de/d88/travelling__salesman__problem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,193 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="438pt" height="175pt"
- viewBox="0.00 0.00 438.00 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-115.25 0,-115.25 0,-96 37,-96 37,-115.25"/>
-<text text-anchor="middle" x="18.5" y="-101.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="239.25,-167.25 185.75,-167.25 185.75,-148 239.25,-148 239.25,-167.25"/>
-<text text-anchor="middle" x="212.5" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30,-115.63C40.13,-124.63 56.36,-137.38 73,-143.62 105.57,-155.85 145.3,-158.76 173.84,-158.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.84,-162.45 183.82,-158.9 173.8,-155.45 173.84,-162.45"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.75,-125.25 169.25,-125.25 169.25,-106 255.75,-106 255.75,-125.25"/>
-<text text-anchor="middle" x="212.5" y="-111.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-105.1C55.75,-104.69 85.28,-104.36 110.75,-105.62 126,-106.38 142.5,-107.77 157.64,-109.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.11,-112.75 167.41,-110.3 157.83,-105.79 157.11,-112.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="110.75,-134.25 73,-134.25 73,-115 110.75,-115 110.75,-134.25"/>
-<text text-anchor="middle" x="91.88" y="-120.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-110.32C44.64,-112.32 53.57,-114.69 61.98,-116.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.91,-120.27 71.48,-119.46 62.71,-113.51 60.91,-120.27"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346" target="_top" xlink:title="Function calculates the minimum path distance that will cover all the cities starting from the source...">
-<polygon fill="white" stroke="#666666" points="278.25,-79.88 146.75,-79.88 146.75,-49.38 278.25,-49.38 278.25,-79.88"/>
-<text text-anchor="start" x="154.75" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::TravellingSalesman</text>
-<text text-anchor="middle" x="212.5" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">Problem</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge11_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge11_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.22,-101.84C59.6,-97.06 99.54,-88.53 135.54,-80.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.04,-84.32 145.08,-78.81 134.57,-77.47 136.04,-84.32"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node2 -->
-<g id="edge4_Node000004_Node000002" class="edge">
-<title>Node4&#45;&gt;Node2</title>
-<g id="a_edge4_Node000004_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.15,-129.71C128.01,-134.4 153.54,-141.5 174.63,-147.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.47,-150.68 184.04,-149.99 175.34,-143.93 173.47,-150.68"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node3 -->
-<g id="edge5_Node000004_Node000003" class="edge">
-<title>Node4&#45;&gt;Node3</title>
-<g id="a_edge5_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.15,-123.24C123.61,-122.29 140.81,-120.99 157.46,-119.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.61,-123.22 167.32,-118.98 157.08,-116.24 157.61,-123.22"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge6_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge6_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.79,-115.2C121.25,-109.73 134.72,-102.73 146.75,-96.62 154.05,-92.92 161.85,-89.03 169.4,-85.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.72,-88.53 178.13,-80.96 167.62,-82.25 170.72,-88.53"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="418,-130.25 326.25,-130.25 326.25,-111 418,-111 418,-130.25"/>
-<text text-anchor="middle" x="372.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge7_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge7_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M253.52,-80.29C271.93,-87.35 294.11,-95.65 314.25,-102.62 318.48,-104.09 322.9,-105.57 327.33,-107.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="326.21,-110.34 336.8,-110.09 328.36,-103.68 326.21,-110.34"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="414.25,-93.25 330,-93.25 330,-74 414.25,-74 414.25,-93.25"/>
-<text text-anchor="middle" x="372.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge8_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge8_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.52,-72.46C291.77,-74.06 305.55,-75.72 318.31,-77.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="317.84,-80.73 328.19,-78.45 318.68,-73.78 317.84,-80.73"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.75,-56.25 346.5,-56.25 346.5,-37 397.75,-37 397.75,-56.25"/>
-<text text-anchor="middle" x="372.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge9_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge9_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M278.52,-57.2C297.95,-54.98 318.54,-52.63 335.35,-50.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="335.29,-54.24 344.83,-49.63 334.49,-47.29 335.29,-54.24"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="430,-19.25 314.25,-19.25 314.25,0 430,0 430,-19.25"/>
-<text text-anchor="middle" x="372.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge10_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge10_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M255.01,-48.9C273.14,-42.16 294.68,-34.31 314.25,-27.62 318.48,-26.18 322.91,-24.71 327.34,-23.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.37,-26.61 336.82,-20.21 326.23,-19.94 328.37,-26.61"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d88/travelling__salesman__problem_8cpp_source.html b/de/d88/travelling__salesman__problem_8cpp_source.html
new file mode 100644
index 000000000..bb60ac43d
--- /dev/null
+++ b/de/d88/travelling__salesman__problem_8cpp_source.html
@@ -0,0 +1,215 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/travelling_salesman_problem.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/d88/travelling__salesman__problem_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">travelling_salesman_problem.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/d88/travelling__salesman__problem_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;limits&gt;</span>     </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> {</div>
+<div class="foldopen" id="foldopen00041" data-start="{" data-end="}">
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346">   41</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346">TravellingSalesmanProblem</a>(std::vector&lt;std::vector&lt;uint32_t&gt;&gt; *cities,</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>                              int32_t src, uint32_t V) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    std::vector&lt;uint32_t&gt; vtx;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; V; i++) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <span class="keywordflow">if</span> (i != src) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            vtx.push_back(i);</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    }</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    int32_t min_path = 2147483647;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        int32_t curr_weight = 0;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordtype">int</span> k = src;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : vtx) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>            curr_weight += (*cities)[k][i];</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            k = i;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        }</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        curr_weight += (*cities)[k][src];</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        min_path = std::min(min_path, curr_weight);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    } <span class="keywordflow">while</span> (next_permutation(vtx.begin(), vtx.end()));</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keywordflow">return</span> min_path;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>}</div>
+</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>}  <span class="comment">// namespace graph</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="foldopen" id="foldopen00078" data-start="{" data-end="}">
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"><a class="line" href="../../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">   78</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiatinig Predefined Tests...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 1...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    std::vector&lt;std::vector&lt;uint32_t&gt;&gt; cities = {</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        {0, 20, 42, 35}, {20, 0, 30, 34}, {42, 30, 0, 12}, {35, 34, 12, 0}};</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    uint32_t V = cities.size();</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    assert(<a class="code hl_function" href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346">graph::TravellingSalesmanProblem</a>(&amp;cities, 0, V) == 97);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test passed...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 2...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    cities = {{0, 5, 10, 15}, {5, 0, 20, 30}, {10, 20, 0, 35}, {15, 30, 35, 0}};</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    V = cities.size();</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    assert(<a class="code hl_function" href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346">graph::TravellingSalesmanProblem</a>(&amp;cities, 0, V) == 75);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test passed...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 3...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    cities = {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        {0, 10, 15, 20}, {10, 0, 35, 25}, {15, 35, 0, 30}, {20, 25, 30, 0}};</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    V = cities.size();</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    assert(<a class="code hl_function" href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346">graph::TravellingSalesmanProblem</a>(&amp;cities, 0, V) == 80);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test passed...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>}</div>
+</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span> </div>
+<div class="foldopen" id="foldopen00105" data-start="{" data-end="}">
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"><a class="line" href="../../de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  105</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <a class="code hl_function" href="../../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    std::vector&lt;std::vector&lt;uint32_t&gt;&gt; cities = {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        {0, 5, 10, 15}, {5, 0, 20, 30}, {10, 20, 0, 35}, {15, 30, 35, 0}};</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    uint32_t V = cities.size();</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    std::cout &lt;&lt; <a class="code hl_function" href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346">graph::TravellingSalesmanProblem</a>(&amp;cities, 0, V) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>}</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 class="ttc" id="anamespacegraph_html_ab7706341d006e20d1ae58274187a3346"><div class="ttname"><a href="../../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346">graph::TravellingSalesmanProblem</a></div><div class="ttdeci">int TravellingSalesmanProblem(std::vector&lt; std::vector&lt; uint32_t &gt; &gt; *cities, int32_t src, uint32_t V)</div><div class="ttdoc">Function calculates the minimum path distance that will cover all the cities starting from the source...</div><div class="ttdef"><b>Definition</b> <a href="#l00041">travelling_salesman_problem.cpp:41</a></div></div>
+<div class="ttc" id="atravelling__salesman__problem_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../de/d88/travelling__salesman__problem_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> <a href="#l00078">travelling_salesman_problem.cpp:78</a></div></div>
+<div class="ttc" id="atravelling__salesman__problem_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00105">travelling_salesman_problem.cpp:105</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a class="el" href="../../de/d88/travelling__salesman__problem_8cpp.html">travelling_salesman_problem.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/d89/graham__scan__functions_8hpp_source.html b/de/d89/graham__scan__functions_8hpp_source.html
index 5a7481f46..8dd29cff6 100644
--- a/de/d89/graham__scan__functions_8hpp_source.html
+++ b/de/d89/graham__scan__functions_8hpp_source.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: geometry/graham_scan_functions.hpp Source File</title>
+<title>TheAlgorithms/C++: geometry/graham_scan_functions.hpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -147,12 +164,12 @@ $(function(){initNavTree('de/d89/graham__scan__functions_8hpp_source.html','../.
 <div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="comment"> * @author [Lajat Manekar](https://github.com/Lazeeez)</span></div>
 <div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="comment"> *</span></div>
 <div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="comment"> *******************************************************************************/</span></div>
-<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  <span class="comment">/// for std::swap</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
 <div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
-<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="preprocessor">#include &lt;cstdlib&gt;</span>    <span class="comment">/// for mathematics and datatype conversion</span></div>
-<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="preprocessor">#include &lt;iostream&gt;</span>   <span class="comment">/// for IO operations</span></div>
-<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="preprocessor">#include &lt;stack&gt;</span>      <span class="comment">/// for std::stack</span></div>
-<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="preprocessor">#include &lt;vector&gt;</span>     <span class="comment">/// for std::vector</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="preprocessor">#include &lt;cstdlib&gt;</span>    </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="preprocessor">#include &lt;stack&gt;</span>      </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
 <div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
 <div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="comment">/******************************************************************************</span></div>
 <div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="comment"> * @namespace geometry</span></div>
@@ -187,11 +204,11 @@ $(function(){initNavTree('de/d89/graham__scan__functions_8hpp_source.html','../.
 <div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span><span class="comment"> * @param S Stack to be used for the process.</span></div>
 <div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span><span class="comment"> * @returns @param Point Co-ordinates of the Point &lt;int, int&gt;</span></div>
 <div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span><span class="comment"> *******************************************************************************/</span></div>
-<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span><a class="code hl_struct" href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">Point</a> nextToTop(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;Point&gt;</a> *S) {</div>
-<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <a class="code hl_struct" href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">Point</a> p = S-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
-<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    S-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
-<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <a class="code hl_struct" href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">Point</a> res = S-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
-<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    S-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(p);</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span><a class="code hl_struct" href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">Point</a> nextToTop(std::stack&lt;Point&gt; *S) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <a class="code hl_struct" href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">Point</a> p = S-&gt;top();</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    S-&gt;pop();</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <a class="code hl_struct" href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">Point</a> res = S-&gt;top();</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    S-&gt;push(p);</div>
 <div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordflow">return</span> res;</div>
 <div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>}</div>
 <div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
@@ -248,26 +265,26 @@ $(function(){initNavTree('de/d89/graham__scan__functions_8hpp_source.html','../.
 <div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span><span class="comment"> * @param size Size of the vector.</span></div>
 <div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span><span class="comment"> * @returns @param vector vector of Conver Hull.</span></div>
 <div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span><span class="comment"> *******************************************************************************/</span></div>
-<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Point&gt;</a> convexHull(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Point&gt;</a> points, uint64_t size) {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>std::vector&lt;Point&gt; convexHull(std::vector&lt;Point&gt; points, uint64_t size) {</div>
 <div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="comment">// Find the bottom-most point</span></div>
-<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <span class="keywordtype">int</span> ymin = points[0].y, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a> = 0;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <span class="keywordtype">int</span> ymin = points[0].y, min = 0;</div>
 <div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; size; i++) {</div>
 <div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        <span class="keywordtype">int</span> y = points[i].y;</div>
 <div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span> </div>
 <div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        <span class="comment">// Pick the bottom-most or chose the left-most point in case of tie</span></div>
 <div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        <span class="keywordflow">if</span> ((y &lt; ymin) || (ymin == y &amp;&amp; points[i].x &lt; points[min].x)) {</div>
-<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>            ymin = points[i].y, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a> = i;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>            ymin = points[i].y, min = i;</div>
 <div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        }</div>
 <div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    }</div>
 <div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
 <div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    <span class="comment">// Place the bottom-most point at first position</span></div>
-<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(points[0], points[min]);</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    std::swap(points[0], points[min]);</div>
 <div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span> </div>
 <div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <span class="comment">// Sort n-1 points with respect to the first point. A point p1 comes</span></div>
 <div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    <span class="comment">// before p2 in sorted output if p2 has larger polar angle</span></div>
 <div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    <span class="comment">// (in counterclockwise direction) than p1.</span></div>
 <div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    p0 = points[0];</div>
-<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/qsort.html">qsort</a>(&amp;points[1], size - 1, <span class="keyword">sizeof</span>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>), <a class="code hl_struct" href="../../d1/db3/structcompare.html">compare</a>);</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    qsort(&amp;points[1], size - 1, <span class="keyword">sizeof</span>(<a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a>), <a class="code hl_struct" href="../../d1/db3/structcompare.html">compare</a>);</div>
 <div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span> </div>
 <div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    <span class="comment">// If two or more points make same angle with p0, Remove all but the one</span></div>
 <div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    <span class="comment">// that is farthest from p0 Remember that, in above sorting, our criteria</span></div>
@@ -291,29 +308,29 @@ $(function(){initNavTree('de/d89/graham__scan__functions_8hpp_source.html','../.
 <div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    };</div>
 <div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span> </div>
 <div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    <span class="comment">// Create an empty stack and push first three points to it.</span></div>
-<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;Point&gt;</a> St;</div>
-<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(points[0]);</div>
-<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(points[1]);</div>
-<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(points[2]);</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    std::stack&lt;Point&gt; St;</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    St.push(points[0]);</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    St.push(points[1]);</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    St.push(points[2]);</div>
 <div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span> </div>
 <div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    <span class="comment">// Process remaining n-3 points</span></div>
 <div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 3; i &lt; m; i++) {</div>
 <div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        <span class="comment">// Keep removing top while the angle formed by</span></div>
 <div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>        <span class="comment">// points next-to-top, top, and points[i] makes</span></div>
 <div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>        <span class="comment">// a non-left turn</span></div>
-<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>        <span class="keywordflow">while</span> (St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/size.html">size</a>() &gt; 1 &amp;&amp;</div>
-<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>               orientation(nextToTop(&amp;St), St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>(), points[i]) != 2) {</div>
-<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>            St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>        <span class="keywordflow">while</span> (St.size() &gt; 1 &amp;&amp;</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>               orientation(nextToTop(&amp;St), St.top(), points[i]) != 2) {</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>            St.pop();</div>
 <div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>        }</div>
-<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>        St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/push.html">push</a>(points[i]);</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>        St.push(points[i]);</div>
 <div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>    }</div>
 <div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span> </div>
-<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;Point&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    std::vector&lt;Point&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    <span class="comment">// Now stack has the output points, push them into the resultant vector</span></div>
-<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    <span class="keywordflow">while</span> (!St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/empty.html">empty</a>()) {</div>
-<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>        <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> p = St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/top.html">top</a>();</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    <span class="keywordflow">while</span> (!St.empty()) {</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>        <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> p = St.top();</div>
 <div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(p);</div>
-<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>        St.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack/pop.html">pop</a>();</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>        St.pop();</div>
 <div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    }</div>
 <div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span> </div>
 <div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;  <span class="comment">// return resultant vector with Convex Hull co-ordinates.</span></div>
@@ -321,22 +338,12 @@ $(function(){initNavTree('de/d89/graham__scan__functions_8hpp_source.html','../.
 <div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>}  <span class="comment">// namespace grahamscan</span></div>
 <div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>}  <span class="comment">// namespace geometry</span></div>
 </div>
-<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/empty.html">std::stack::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-<div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div>
-<div class="ttc" id="anamespacegeometry_html"><div class="ttname"><a href="../../d5/d5f/namespacegeometry.html">geometry</a></div><div class="ttdoc">for std::swap</div><div class="ttdef"><b>Definition</b> graham_scan_functions.hpp:52</div></div>
-<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/pop.html">std::stack::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
-<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/push.html">std::stack::push</a></div><div class="ttdeci">T push(T... args)</div></div>
-<div class="ttc" id="aqsort_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/qsort.html">std::qsort</a></div><div class="ttdeci">T qsort(T... args)</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/size.html">std::stack::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-<div class="ttc" id="astack_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a></div></div>
-<div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:12</div></div>
-<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:14</div></div>
-<div class="ttc" id="astructcompare_html"><div class="ttname"><a href="../../d1/db3/structcompare.html">compare</a></div><div class="ttdef"><b>Definition</b> huffman.cpp:36</div></div>
-<div class="ttc" id="astructgeometry_1_1grahamscan_1_1_point_html"><div class="ttname"><a href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">geometry::grahamscan::Point</a></div><div class="ttdef"><b>Definition</b> graham_scan_functions.hpp:64</div></div>
-<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
-<div class="ttc" id="atop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack/top.html">std::stack::top</a></div><div class="ttdeci">T top(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+<div class="ttc" id="anamespacegeometry_html"><div class="ttname"><a href="../../d5/d5f/namespacegeometry.html">geometry</a></div><div class="ttdoc">for std::swap</div><div class="ttdef"><b>Definition</b> <a href="#l00052">graham_scan_functions.hpp:52</a></div></div>
+<div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition</b> <a href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00012">line_segment_intersection.cpp:12</a></div></div>
+<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00014">line_segment_intersection.cpp:14</a></div></div>
+<div class="ttc" id="astructcompare_html"><div class="ttname"><a href="../../d1/db3/structcompare.html">compare</a></div><div class="ttdef"><b>Definition</b> <a href="../../d5/d8e/huffman_8cpp_source.html#l00036">huffman.cpp:36</a></div></div>
+<div class="ttc" id="astructgeometry_1_1grahamscan_1_1_point_html"><div class="ttname"><a href="../../d7/d48/structgeometry_1_1grahamscan_1_1_point.html">geometry::grahamscan::Point</a></div><div class="ttdef"><b>Definition</b> <a href="#l00064">graham_scan_functions.hpp:64</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/de/d8a/class_trie-members.html b/de/d8a/class_trie-members.html
index f8ed43267..d56ca25a2 100644
--- a/de/d8a/class_trie-members.html
+++ b/de/d8a/class_trie-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/d8c/partition__problem_8cpp_source.html b/de/d8c/partition__problem_8cpp_source.html
new file mode 100644
index 000000000..31dd2ed88
--- /dev/null
+++ b/de/d8c/partition__problem_8cpp_source.html
@@ -0,0 +1,248 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/partition_problem.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/d8c/partition__problem_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">partition_problem.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/******************************************************************************</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * @file</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * @brief Implementation of the [Partition</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * Problem](https://en.wikipedia.org/wiki/Partition_problem )</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * @details</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> * The partition problem, or number partitioning, is the task of deciding</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> * whether a given multiset S of positive integers can be partitioned into two</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> * subsets S1 and S2 such that the sum of the numbers in S1 equals the sum of</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> * the numbers in S2. Although the partition problem is NP-complete, there is a</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment"> * pseudo-polynomial time dynamic programming solution, and there are heuristics</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment"> * that solve the problem in many instances, either optimally or approximately.</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment"> * For this reason, it has been called &quot;the easiest hard problem&quot;.</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment"> * The worst case time complexity of Jarvis’s Algorithm is O(n^2). Using</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment"> * Graham’s scan algorithm, we can find Convex Hull in O(nLogn) time.</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment"> * ### Implementation</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment"> * Step 1</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment"> * Calculate sum of the array. If sum is odd, there can not be two subsets with</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment"> * equal sum, so return false.</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"> * Step 2</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment"> * If sum of array elements is even, calculate sum/2 and find a subset of array</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment"> * with sum equal to sum/2.</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment"> * @author [Lajat Manekar](https://github.com/Lazeeez)</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;cstdint&gt;</span>   </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="preprocessor">#include &lt;numeric&gt;</span>   </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="comment">/******************************************************************************</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="comment"> * @namespace dp</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="comment"> * @brief Dynamic programming algorithms</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="foldopen" id="foldopen00039" data-start="{" data-end="}">
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../df/d88/namespacedp.html">   39</a></span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a> {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="comment">/******************************************************************************</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="comment"> * @namespace partitionProblem</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="comment"> * @brief Partition problem algorithm</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="keyword">namespace </span>partitionProblem {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="comment">/******************************************************************************</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="comment"> * @brief Returns true if arr can be partitioned in two subsets of equal sum,</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="comment"> * otherwise false</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="comment"> * @param arr vector containing elements</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="comment"> * @param size Size of the vector.</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="comment"> * @returns @param bool whether the vector can be partitioned or not.</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="keywordtype">bool</span> findPartiion(<span class="keyword">const</span> std::vector&lt;uint64_t&gt; &amp;arr, uint64_t size) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    uint64_t sum = std::accumulate(arr.begin(), arr.end(),</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>                                   0);  <span class="comment">// Calculate sum of all elements</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordflow">if</span> (sum % 2 != 0) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;  <span class="comment">// if sum is odd, it cannot be divided into two equal sum</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    }</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    std::vector&lt;bool&gt; part;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="comment">// bool part[sum / 2 + 1];</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="comment">// Initialize the part array as 0</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordflow">for</span> (uint64_t it = 0; it &lt;= sum / 2; ++it) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        part.push_back(<span class="keyword">false</span>);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="comment">// Fill the partition table in bottom up manner</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keywordflow">for</span> (uint64_t it = 0; it &lt; size; ++it) {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>        <span class="comment">// The element to be included in the sum cannot be greater than the sum</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        <span class="keywordflow">for</span> (uint64_t it2 = sum / 2; it2 &gt;= arr[it];</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>             --it2) {  <span class="comment">// Check if sum - arr[i]</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            <span class="comment">// ould be formed from a subset using elements before index i</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            <span class="keywordflow">if</span> (part[it2 - arr[it]] == 1 || it2 == arr[it]) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>                part[it2] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        }</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordflow">return</span> part[sum / 2];</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>}</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>}  <span class="comment">// namespace partitionProblem</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>}  <span class="comment">// namespace dp</span></div>
+</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span><span class="comment">/*******************************************************************************</span></div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span><span class="comment"> * @brief Self-test implementations</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span><span class="comment"> * @returns void</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>() {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    std::vector&lt;uint64_t&gt; arr = {{1, 3, 3, 2, 3, 2}};</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    uint64_t n = arr.size();</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keywordtype">bool</span> expected_result = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="keywordtype">bool</span> derived_result = dp::partitionProblem::findPartiion(arr, n);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test: &quot;</span>;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    assert(expected_result == derived_result);</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>}</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span> </div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span><span class="comment">/*******************************************************************************</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span><span class="comment"> * @brief Main function</span></div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span><span class="comment"> * @returns 0 on exit</span></div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <a class="code hl_function" href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>}</div>
+<div class="ttc" id="acaesar__cipher_8cpp_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2c/caesar__cipher_8cpp_source.html#l00100">caesar_cipher.cpp:100</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</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> <a href="#l00039">partition_problem.cpp:39</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><b>partition_problem.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/d8d/class_f_c_f_s-members.html b/de/d8d/class_f_c_f_s-members.html
index f92a63557..fe672acf6 100644
--- a/de/d8d/class_f_c_f_s-members.html
+++ b/de/d8d/class_f_c_f_s-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.map b/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.map
index 79cf83416..e0b38e82a 100644
--- a/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.map
+++ b/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.map
@@ -1,5 +1,5 @@
 <map id="others::postfix_expression::Stack" name="others::postfix_expression::Stack">
 <area shape="rect" id="Node000001" title="Creates an array to be used as stack for storing values." alt="" coords="5,94,180,135"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array.html" title=" " alt="" coords="19,5,166,31"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="19,5,166,31"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="95,46,95,93,90,93,90,46"/>
 </map>
diff --git a/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.md5 b/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.md5
index 6dc069ca3..ae7909d30 100644
--- a/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.md5
+++ b/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.md5
@@ -1 +1 @@
-3f8542a6de4092a10ea39447059e0e9c
\ No newline at end of file
+b5fd7b27258ae2cc938ab94c71b32256
\ No newline at end of file
diff --git a/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.svg b/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.svg
index 7f5a8b71e..a5cec6180 100644
--- a/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.svg
+++ b/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph.svg
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="120.62,-97 10.12,-97 10.12,-77.75 120.62,-77.75 120.62,-97"/>
 <text text-anchor="middle" x="65.38" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; float, 20 &gt;</text>
 </a>
diff --git a/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph_org.svg b/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph_org.svg
index d4e63208a..b5a2323b0 100644
--- a/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph_org.svg
+++ b/de/d8e/classothers_1_1postfix__expression_1_1_stack__coll__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="120.62,-97 10.12,-97 10.12,-77.75 120.62,-77.75 120.62,-97"/>
 <text text-anchor="middle" x="65.38" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; float, 20 &gt;</text>
 </a>
diff --git a/de/d8f/classgreedy__algorithms_1_1_digit_separation-members.html b/de/d8f/classgreedy__algorithms_1_1_digit_separation-members.html
index fa1f66df6..42f901bb6 100644
--- a/de/d8f/classgreedy__algorithms_1_1_digit_separation-members.html
+++ b/de/d8f/classgreedy__algorithms_1_1_digit_separation-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/d91/structlist-members.html b/de/d91/structlist-members.html
index 60b391d68..bab04464c 100644
--- a/de/d91/structlist-members.html
+++ b/de/d91/structlist-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/d95/namespace_subsets.html b/de/d95/namespace_subsets.html
index 0f19315d7..308b0fb1a 100644
--- a/de/d95/namespace_subsets.html
+++ b/de/d95/namespace_subsets.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Subsets Namespace Reference</title>
+<title>TheAlgorithms/C++: Subsets Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/d99/aliquot__sum_8cpp.html b/de/d99/aliquot__sum_8cpp.html
index 6095e5e32..0239a0236 100644
--- a/de/d99/aliquot__sum_8cpp.html
+++ b/de/d99/aliquot__sum_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/aliquot_sum.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/aliquot_sum.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for aliquot_sum.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d4a/aliquot__sum_8cpp__incl.svg" width="255" height="111"><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">
+</div>
+<p><a href="../../de/d99/aliquot__sum_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -151,6 +170,8 @@ Functions</h2></td></tr>
 </p>
 <p>For example; \(s(18) = 1 + 2 + 3 + 6 + 9 = 21 \)</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/SpiderMath" target="_blank">SpiderMath</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../de/d99/aliquot__sum_8cpp_source.html">aliquot_sum.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -169,17 +190,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d99/aliquot__sum_8cpp_source.html#l00074">74</a> of file <a class="el" href="../../de/d99/aliquot__sum_8cpp_source.html">aliquot_sum.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   74</span>           {</div>
 <div class="line"><span class="lineno">   75</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run the self-test implementations</span></div>
 <div class="line"><span class="lineno">   76</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   77</span>}</div>
-<div class="ttc" id="aaliquot__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> aliquot_sum.cpp:57</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d99/aliquot__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="328" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aaliquot__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../de/d99/aliquot__sum_8cpp_source.html#l00057">aliquot_sum.cpp:57</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -207,6 +225,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d99/aliquot__sum_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../de/d99/aliquot__sum_8cpp_source.html">aliquot_sum.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   57</span>                   {</div>
 <div class="line"><span class="lineno">   58</span>    <span class="comment">// Aliquot sum of 10 is 1 + 2 + 5 = 8</span></div>
 <div class="line"><span class="lineno">   59</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf">math::aliquot_sum</a>(10) == 8);</div>
@@ -217,16 +237,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   64</span>    <span class="comment">// Aliquot sum of 97 is 1 (the aliquot sum of a prime number is 1)</span></div>
 <div class="line"><span class="lineno">   65</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf">math::aliquot_sum</a>(97) == 1);</div>
 <div class="line"><span class="lineno">   66</span> </div>
-<div class="line"><span class="lineno">   67</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All the tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   67</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All the tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   68</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="anamespacemath_html_ab37f3a7302a84179aae682c79d8390bf"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf">math::aliquot_sum</a></div><div class="ttdeci">uint64_t aliquot_sum(const uint64_t num)</div><div class="ttdoc">to return the aliquot sum of a number</div><div class="ttdef"><b>Definition</b> aliquot_sum.cpp:36</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d99/aliquot__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="231" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemath_html_ab37f3a7302a84179aae682c79d8390bf"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf">math::aliquot_sum</a></div><div class="ttdeci">uint64_t aliquot_sum(const uint64_t num)</div><div class="ttdoc">to return the aliquot sum of a number</div><div class="ttdef"><b>Definition</b> <a href="../../de/d99/aliquot__sum_8cpp_source.html#l00036">aliquot_sum.cpp:36</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/de/d99/aliquot__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/de/d99/aliquot__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 44236365a..000000000
--- a/de/d99/aliquot__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="$dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf" title="to return the aliquot sum of a number" alt="" coords="97,5,225,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/de/d99/aliquot__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/de/d99/aliquot__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 019b91ea9..000000000
--- a/de/d99/aliquot__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9de40daebfdd73839fe6de7dbc3cefb9
\ No newline at end of file
diff --git a/de/d99/aliquot__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/de/d99/aliquot__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 640b9856b..000000000
--- a/de/d99/aliquot__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="173pt" height="27pt"
- viewBox="0.00 0.00 172.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf" target="_top" xlink:title="to return the aliquot sum of a number">
-<polygon fill="white" stroke="#666666" points="164.75,-19.25 68.5,-19.25 68.5,0 164.75,0 164.75,-19.25"/>
-<text text-anchor="middle" x="116.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::aliquot_sum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.62,-9.62C39.38,-9.62 47.8,-9.62 56.66,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.51,-13.13 66.51,-9.63 56.51,-6.13 56.51,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d99/aliquot__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/de/d99/aliquot__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index fa77d4dc9..000000000
--- a/de/d99/aliquot__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="173pt" height="27pt"
- viewBox="0.00 0.00 172.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf" target="_top" xlink:title="to return the aliquot sum of a number">
-<polygon fill="white" stroke="#666666" points="164.75,-19.25 68.5,-19.25 68.5,0 164.75,0 164.75,-19.25"/>
-<text text-anchor="middle" x="116.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::aliquot_sum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.62,-9.62C39.38,-9.62 47.8,-9.62 56.66,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.51,-13.13 66.51,-9.63 56.51,-6.13 56.51,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d99/aliquot__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d99/aliquot__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 453f56b9e..000000000
--- a/de/d99/aliquot__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="$dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf" title="to return the aliquot sum of a number" alt="" coords="194,5,322,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/de/d99/aliquot__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d99/aliquot__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 882449eb0..000000000
--- a/de/d99/aliquot__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-84b115a7d95db54c6e35b8265ffa00ab
\ No newline at end of file
diff --git a/de/d99/aliquot__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d99/aliquot__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 0ba03fd67..000000000
--- a/de/d99/aliquot__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="246pt" height="27pt"
- viewBox="0.00 0.00 245.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf" target="_top" xlink:title="to return the aliquot sum of a number">
-<polygon fill="white" stroke="#666666" points="237.75,-19.25 141.5,-19.25 141.5,0 237.75,0 237.75,-19.25"/>
-<text text-anchor="middle" x="189.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::aliquot_sum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.62,-9.62C112.38,-9.62 120.8,-9.62 129.66,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.51,-13.13 139.51,-9.63 129.51,-6.13 129.51,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d99/aliquot__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/d99/aliquot__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 773a943ba..000000000
--- a/de/d99/aliquot__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="246pt" height="27pt"
- viewBox="0.00 0.00 245.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf" target="_top" xlink:title="to return the aliquot sum of a number">
-<polygon fill="white" stroke="#666666" points="237.75,-19.25 141.5,-19.25 141.5,0 237.75,0 237.75,-19.25"/>
-<text text-anchor="middle" x="189.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::aliquot_sum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.62,-9.62C112.38,-9.62 120.8,-9.62 129.66,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.51,-13.13 139.51,-9.63 129.51,-6.13 129.51,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d99/aliquot__sum_8cpp_source.html b/de/d99/aliquot__sum_8cpp_source.html
new file mode 100644
index 000000000..5b3a35604
--- /dev/null
+++ b/de/d99/aliquot__sum_8cpp_source.html
@@ -0,0 +1,188 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/aliquot_sum.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/d99/aliquot__sum_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">aliquot_sum.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/d99/aliquot__sum_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="foldopen" id="foldopen00036" data-start="{" data-end="}">
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf">   36</a></span>uint64_t <a class="code hl_function" href="../../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf">aliquot_sum</a>(<span class="keyword">const</span> uint64_t num) {</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordflow">if</span> (num == 0 || num == 1) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <span class="keywordflow">return</span> 0;  <span class="comment">// The aliquot sum for 0 and 1 is 0</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    }</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> </div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    uint64_t sum = 0;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">for</span> (uint64_t i = 1; i &lt;= num / 2; i++) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="keywordflow">if</span> (num % i == 0) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>            sum += i;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        }</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">return</span> sum;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>}</div>
+</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="foldopen" id="foldopen00057" data-start="{" data-end="}">
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="../../de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   57</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="comment">// Aliquot sum of 10 is 1 + 2 + 5 = 8</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf">math::aliquot_sum</a>(10) == 8);</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="comment">// Aliquot sum of 15 is 1 + 3 + 5 = 9</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf">math::aliquot_sum</a>(15) == 9);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="comment">// Aliquot sum of 1 is 0</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf">math::aliquot_sum</a>(1) == 0);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="comment">// Aliquot sum of 97 is 1 (the aliquot sum of a prime number is 1)</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf">math::aliquot_sum</a>(97) == 1);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All the tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>}</div>
+</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="foldopen" id="foldopen00074" data-start="{" data-end="}">
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="../../de/d99/aliquot__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   74</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/d99/aliquot__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <a class="code hl_function" href="../../de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run the self-test implementations</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>}</div>
+</div>
+<div class="ttc" id="aaliquot__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../de/d99/aliquot__sum_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> <a href="#l00057">aliquot_sum.cpp:57</a></div></div>
+<div class="ttc" id="aaliquot__sum_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d99/aliquot__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00074">aliquot_sum.cpp:74</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemath_html_ab37f3a7302a84179aae682c79d8390bf"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf">math::aliquot_sum</a></div><div class="ttdeci">uint64_t aliquot_sum(const uint64_t num)</div><div class="ttdoc">to return the aliquot sum of a number</div><div class="ttdef"><b>Definition</b> <a href="#l00036">aliquot_sum.cpp:36</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../de/d99/aliquot__sum_8cpp.html">aliquot_sum.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/d9b/namespacegray__code.html b/de/d9b/namespacegray__code.html
index d826d9ac7..d741814ac 100644
--- a/de/d9b/namespacegray__code.html
+++ b/de/d9b/namespacegray__code.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: gray_code Namespace Reference</title>
+<title>TheAlgorithms/C++: gray_code Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/d9b/prime__numbers_8cpp.html b/de/d9b/prime__numbers_8cpp.html
index 97dd247f1..3d6467e74 100644
--- a/de/d9b/prime__numbers_8cpp.html
+++ b/de/d9b/prime__numbers_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/prime_numbers.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/prime_numbers.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,10 +136,12 @@ Include dependency graph for prime_numbers.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/df8/prime__numbers_8cpp__incl.svg" width="179" height="111"><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">
+</div>
+<p><a href="../../de/d9b/prime__numbers_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a9575f3a51eeb8a57d657b3db6a4b441a" id="r_a9575f3a51eeb8a57d657b3db6a4b441a"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a> (size_t max)</td></tr>
+<tr class="memitem:a9575f3a51eeb8a57d657b3db6a4b441a" id="r_a9575f3a51eeb8a57d657b3db6a4b441a"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a> (size_t max)</td></tr>
 <tr class="separator:a9575f3a51eeb8a57d657b3db6a4b441a"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
 <tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -130,6 +149,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Get list of prime numbers. </p>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d4/d9c/primes__up__to__billion_8cpp.html" title="Compute prime numbers upto 1 billion.">primes_up_to_billion.cpp</a> <a class="el" href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html" title="Prime Numbers using Sieve of Eratosthenes">sieve_of_eratosthenes.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../de/d9b/prime__numbers_8cpp_source.html">prime_numbers.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -146,25 +167,18 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>main function </p>
-<div class="fragment"><div class="line"><span class="lineno">   34</span>           {</div>
-<div class="line"><span class="lineno">   35</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Calculate primes up to:\n&gt;&gt; &quot;</span>;</div>
-<div class="line"><span class="lineno">   36</span>    <span class="keywordtype">int</span> n = 0;</div>
-<div class="line"><span class="lineno">   37</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;</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&lt;int&gt;</a> ans = <a class="code hl_function" href="#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>(n);</div>
-<div class="line"><span class="lineno">   39</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> p : ans) <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; p &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
-<div class="line"><span class="lineno">   40</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   41</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="aprime__numbers_8cpp_html_a9575f3a51eeb8a57d657b3db6a4b441a"><div class="ttname"><a href="#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a></div><div class="ttdeci">std::vector&lt; int &gt; primes(size_t max)</div><div class="ttdef"><b>Definition</b> prime_numbers.cpp:12</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="403" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../de/d9b/prime__numbers_8cpp_source.html#l00034">34</a> of file <a class="el" href="../../de/d9b/prime__numbers_8cpp_source.html">prime_numbers.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   34</span>           {</div>
+<div class="line"><span class="lineno">   35</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Calculate primes up to:\n&gt;&gt; &quot;</span>;</div>
+<div class="line"><span class="lineno">   36</span>    <span class="keywordtype">int</span> n = 0;</div>
+<div class="line"><span class="lineno">   37</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><span class="lineno">   38</span>    std::vector&lt;int&gt; ans = <a class="code hl_function" href="#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>(n);</div>
+<div class="line"><span class="lineno">   39</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> p : ans) std::cout &lt;&lt; p &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><span class="lineno">   40</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   41</span>}</div>
+<div class="ttc" id="aprime__numbers_8cpp_html_a9575f3a51eeb8a57d657b3db6a4b441a"><div class="ttname"><a href="#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a></div><div class="ttdeci">std::vector&lt; int &gt; primes(size_t max)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d9b/prime__numbers_8cpp_source.html#l00012">prime_numbers.cpp:12</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a9575f3a51eeb8a57d657b3db6a4b441a" name="a9575f3a51eeb8a57d657b3db6a4b441a"></a>
@@ -174,7 +188,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; primes </td>
+          <td class="memname">std::vector&lt; int &gt; primes </td>
           <td>(</td>
           <td class="paramtype">size_t</td>          <td class="paramname"><span class="paramname"><em>max</em></span></td><td>)</td>
           <td></td>
@@ -182,12 +196,14 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Generate an increasingly large number of primes and store in a list </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d9b/prime__numbers_8cpp_source.html#l00012">12</a> of file <a class="el" href="../../de/d9b/prime__numbers_8cpp_source.html">prime_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   12</span>                                  {</div>
-<div class="line"><span class="lineno">   13</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> res;</div>
-<div class="line"><span class="lineno">   14</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a> is_not_prime(max + 1, <span class="keyword">false</span>);</div>
-<div class="line"><span class="lineno">   15</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 2; i &lt;= <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">max</a>; i++) {</div>
+<div class="line"><span class="lineno">   13</span>    std::vector&lt;int&gt; res;</div>
+<div class="line"><span class="lineno">   14</span>    std::vector&lt;bool&gt; is_not_prime(max + 1, <span class="keyword">false</span>);</div>
+<div class="line"><span class="lineno">   15</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 2; i &lt;= max; i++) {</div>
 <div class="line"><span class="lineno">   16</span>        <span class="keywordflow">if</span> (!is_not_prime[i]) {</div>
-<div class="line"><span class="lineno">   17</span>            res.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(i);</div>
+<div class="line"><span class="lineno">   17</span>            res.emplace_back(i);</div>
 <div class="line"><span class="lineno">   18</span>        }</div>
 <div class="line"><span class="lineno">   19</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> p : res) {</div>
 <div class="line"><span class="lineno">   20</span>            <span class="keywordtype">size_t</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = i * p;</div>
@@ -202,15 +218,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   29</span>    }</div>
 <div class="line"><span class="lineno">   30</span>    <span class="keywordflow">return</span> res;</div>
 <div class="line"><span class="lineno">   31</span>}</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-<div class="ttc" id="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d9b/prime__numbers_8cpp_a9575f3a51eeb8a57d657b3db6a4b441a_cgraph.svg" width="295" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/de/d9b/prime__numbers_8cpp_a9575f3a51eeb8a57d657b3db6a4b441a_cgraph.map b/de/d9b/prime__numbers_8cpp_a9575f3a51eeb8a57d657b3db6a4b441a_cgraph.map
deleted file mode 100644
index 3794ee88f..000000000
--- a/de/d9b/prime__numbers_8cpp_a9575f3a51eeb8a57d657b3db6a4b441a_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="primes" name="primes">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,66,31"/>
-<area shape="rect" id="Node000002" 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="114,5,289,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="66,16,98,16,98,21,66,21"/>
-</map>
diff --git a/de/d9b/prime__numbers_8cpp_a9575f3a51eeb8a57d657b3db6a4b441a_cgraph.md5 b/de/d9b/prime__numbers_8cpp_a9575f3a51eeb8a57d657b3db6a4b441a_cgraph.md5
deleted file mode 100644
index 49bb15a9b..000000000
--- a/de/d9b/prime__numbers_8cpp_a9575f3a51eeb8a57d657b3db6a4b441a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9dd4a60df4dc046e41e54c7a609ce415
\ No newline at end of file
diff --git a/de/d9b/prime__numbers_8cpp_a9575f3a51eeb8a57d657b3db6a4b441a_cgraph.svg b/de/d9b/prime__numbers_8cpp_a9575f3a51eeb8a57d657b3db6a4b441a_cgraph.svg
deleted file mode 100644
index e92a85c6c..000000000
--- a/de/d9b/prime__numbers_8cpp_a9575f3a51eeb8a57d657b3db6a4b441a_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: primes Pages: 1 -->
-<svg width="221pt" height="27pt"
- viewBox="0.00 0.00 220.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>primes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="45.25,-19.25 0,-19.25 0,0 45.25,0 45.25,-19.25"/>
-<text text-anchor="middle" x="22.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">primes</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="212.75,-19.25 81.25,-19.25 81.25,0 212.75,0 212.75,-19.25"/>
-<text text-anchor="middle" x="147" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.5,-9.62C52.61,-9.62 60.94,-9.62 69.72,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.49,-13.13 79.49,-9.63 69.49,-6.13 69.49,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d9b/prime__numbers_8cpp_a9575f3a51eeb8a57d657b3db6a4b441a_cgraph_org.svg b/de/d9b/prime__numbers_8cpp_a9575f3a51eeb8a57d657b3db6a4b441a_cgraph_org.svg
deleted file mode 100644
index a9bf1a11d..000000000
--- a/de/d9b/prime__numbers_8cpp_a9575f3a51eeb8a57d657b3db6a4b441a_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: primes Pages: 1 -->
-<svg width="221pt" height="27pt"
- viewBox="0.00 0.00 220.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>primes</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="45.25,-19.25 0,-19.25 0,0 45.25,0 45.25,-19.25"/>
-<text text-anchor="middle" x="22.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">primes</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="212.75,-19.25 81.25,-19.25 81.25,0 212.75,0 212.75,-19.25"/>
-<text text-anchor="middle" x="147" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.5,-9.62C52.61,-9.62 60.94,-9.62 69.72,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.49,-13.13 79.49,-9.63 69.49,-6.13 69.49,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 4a4efd845..000000000
--- a/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,35,87,27,88,33,56,40"/>
-<area shape="rect" id="Node000003" href="$de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a" title=" " alt="" coords="108,55,168,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,46,94,55,93,60,55,52"/>
-<area shape="rect" id="Node000004" 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="222,55,397,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="169,65,207,65,207,70,169,70"/>
-</map>
diff --git a/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 03740e669..000000000
--- a/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3d63e54cd8301e682ccb3128719c6caf
\ No newline at end of file
diff --git a/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index ea27ed631..000000000
--- a/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,101 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="302pt" height="64pt"
- viewBox="0.00 0.00 302.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-56.25 73,-56.25 73,-37 126.5,-37 126.5,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.64,-33.65 53.16,-35.69 61.53,-37.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.71,-41.1 71.25,-40.03 62.34,-34.3 60.71,-41.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122.38,-19.25 77.12,-19.25 77.12,0 122.38,0 122.38,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">primes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C45.89,-21.63 56.16,-19.3 65.88,-17.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.43,-20.55 75.41,-14.93 64.88,-13.73 66.43,-20.55"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-19.25 162.5,-19.25 162.5,0 294,0 294,-19.25"/>
-<text text-anchor="middle" x="228.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.78,-9.62C130.95,-9.62 140.73,-9.62 150.99,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.74,-13.13 160.74,-9.63 150.74,-6.13 150.74,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 29c5ab966..000000000
--- a/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="302pt" height="64pt"
- viewBox="0.00 0.00 302.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-56.25 73,-56.25 73,-37 126.5,-37 126.5,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.64,-33.65 53.16,-35.69 61.53,-37.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.71,-41.1 71.25,-40.03 62.34,-34.3 60.71,-41.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122.38,-19.25 77.12,-19.25 77.12,0 122.38,0 122.38,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">primes</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C45.89,-21.63 56.16,-19.3 65.88,-17.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.43,-20.55 75.41,-14.93 64.88,-13.73 66.43,-20.55"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="294,-19.25 162.5,-19.25 162.5,0 294,0 294,-19.25"/>
-<text text-anchor="middle" x="228.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::emplace_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M122.78,-9.62C130.95,-9.62 140.73,-9.62 150.99,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.74,-13.13 160.74,-9.63 150.74,-6.13 150.74,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/d9b/prime__numbers_8cpp_source.html b/de/d9b/prime__numbers_8cpp_source.html
new file mode 100644
index 000000000..d90c6c5a1
--- /dev/null
+++ b/de/d9b/prime__numbers_8cpp_source.html
@@ -0,0 +1,176 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/prime_numbers.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/d9b/prime__numbers_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">prime_numbers.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/d9b/prime__numbers_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="foldopen" id="foldopen00012" data-start="{" data-end="}">
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"><a class="line" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">   12</a></span>std::vector&lt;int&gt; <a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>(<span class="keywordtype">size_t</span> max) {</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    std::vector&lt;int&gt; res;</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    std::vector&lt;bool&gt; is_not_prime(max + 1, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 2; i &lt;= max; i++) {</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>        <span class="keywordflow">if</span> (!is_not_prime[i]) {</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>            res.emplace_back(i);</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        }</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> p : res) {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>            <span class="keywordtype">size_t</span> k = i * p;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>            <span class="keywordflow">if</span> (k &gt; max) {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>            }</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>            is_not_prime[k] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>            <span class="keywordflow">if</span> (i % p == 0) {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>                <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>            }</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        }</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    }</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="keywordflow">return</span> res;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>}</div>
+</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="foldopen" id="foldopen00034" data-start="{" data-end="}">
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   34</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Calculate primes up to:\n&gt;&gt; &quot;</span>;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordtype">int</span> n = 0;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    std::vector&lt;int&gt; ans = <a class="code hl_function" href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a>(n);</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> p : ans) std::cout &lt;&lt; p &lt;&lt; <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>}</div>
+</div>
+<div class="ttc" id="aprime__numbers_8cpp_html_a9575f3a51eeb8a57d657b3db6a4b441a"><div class="ttname"><a href="../../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">primes</a></div><div class="ttdeci">std::vector&lt; int &gt; primes(size_t max)</div><div class="ttdef"><b>Definition</b> <a href="#l00012">prime_numbers.cpp:12</a></div></div>
+<div class="ttc" id="aprime__numbers_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00034">prime_numbers.cpp:34</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../de/d9b/prime__numbers_8cpp.html">prime_numbers.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/d9d/classdata__structures_1_1linked__list_1_1link.html b/de/d9d/classdata__structures_1_1linked__list_1_1link.html
index c65e73fa5..293e5bcd2 100644
--- a/de/d9d/classdata__structures_1_1linked__list_1_1link.html
+++ b/de/d9d/classdata__structures_1_1linked__list_1_1link.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures::linked_list::link Class Reference</title>
+<title>TheAlgorithms/C++: data_structures::linked_list::link Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,24 +138,24 @@ Collaboration diagram for data_structures::linked_list::link:</div>
 Public Member Functions</h2></td></tr>
 <tr class="memitem:acf96f3a9a1d3b15268c38e8822300c11" id="r_acf96f3a9a1d3b15268c38e8822300c11"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#acf96f3a9a1d3b15268c38e8822300c11">val</a> ()</td></tr>
 <tr class="separator:acf96f3a9a1d3b15268c38e8822300c11"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af6bbeb9bfde1683ba917071edeedd5c3" id="r_af6bbeb9bfde1683ba917071edeedd5c3"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt; &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af6bbeb9bfde1683ba917071edeedd5c3">succ</a> ()</td></tr>
+<tr class="memitem:af6bbeb9bfde1683ba917071edeedd5c3" id="r_af6bbeb9bfde1683ba917071edeedd5c3"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt; &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af6bbeb9bfde1683ba917071edeedd5c3">succ</a> ()</td></tr>
 <tr class="separator:af6bbeb9bfde1683ba917071edeedd5c3"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aba4672fbc40c38962d1510b843a577bb" id="r_aba4672fbc40c38962d1510b843a577bb"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aba4672fbc40c38962d1510b843a577bb">link</a> (int value=0)</td></tr>
 <tr class="separator:aba4672fbc40c38962d1510b843a577bb"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:ac121ce37b6ea864b160ebcada0bce936" id="r_ac121ce37b6ea864b160ebcada0bce936"><td class="memItemLeft" align="right" valign="top"><a id="ac121ce37b6ea864b160ebcada0bce936" name="ac121ce37b6ea864b160ebcada0bce936"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>pvalue</b></td></tr>
-<tr class="memdesc:ac121ce37b6ea864b160ebcada0bce936"><td class="mdescLeft">&#160;</td><td class="mdescRight">value of the current link <br /></td></tr>
+<tr class="memitem:ac121ce37b6ea864b160ebcada0bce936" id="r_ac121ce37b6ea864b160ebcada0bce936"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac121ce37b6ea864b160ebcada0bce936">pvalue</a></td></tr>
+<tr class="memdesc:ac121ce37b6ea864b160ebcada0bce936"><td class="mdescLeft">&#160;</td><td class="mdescRight">value of the current link  <br /></td></tr>
 <tr class="separator:ac121ce37b6ea864b160ebcada0bce936"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:af94c06f3220e5406245680f58b8e7081" id="r_af94c06f3220e5406245680f58b8e7081"><td class="memItemLeft" align="right" valign="top"><a id="af94c06f3220e5406245680f58b8e7081" name="af94c06f3220e5406245680f58b8e7081"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>psucc</b></td></tr>
-<tr class="memdesc:af94c06f3220e5406245680f58b8e7081"><td class="mdescLeft">&#160;</td><td class="mdescRight">pointer to the next value on the list <br /></td></tr>
+<tr class="memitem:af94c06f3220e5406245680f58b8e7081" id="r_af94c06f3220e5406245680f58b8e7081"><td class="memItemLeft" align="right" valign="top">std::shared_ptr&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af94c06f3220e5406245680f58b8e7081">psucc</a></td></tr>
+<tr class="memdesc:af94c06f3220e5406245680f58b8e7081"><td class="mdescLeft">&#160;</td><td class="mdescRight">pointer to the next value on the list  <br /></td></tr>
 <tr class="separator:af94c06f3220e5406245680f58b8e7081"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A link class containing a value and pointer to another link </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="aba4672fbc40c38962d1510b843a577bb" name="aba4672fbc40c38962d1510b843a577bb"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aba4672fbc40c38962d1510b843a577bb">&#9670;&#160;</a></span>link()</h2>
@@ -168,9 +185,11 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>pvalue</b></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00075">75</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   75</span>: <a class="code hl_variable" href="#ac121ce37b6ea864b160ebcada0bce936">pvalue</a>(value), <a class="code hl_variable" href="#af94c06f3220e5406245680f58b8e7081">psucc</a>(<span class="keyword">nullptr</span>) {}</div>
-<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1link_html_ac121ce37b6ea864b160ebcada0bce936"><div class="ttname"><a href="#ac121ce37b6ea864b160ebcada0bce936">data_structures::linked_list::link::pvalue</a></div><div class="ttdeci">int pvalue</div><div class="ttdoc">value of the current link</div><div class="ttdef"><b>Definition</b> linked_list.cpp:55</div></div>
-<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1link_html_af94c06f3220e5406245680f58b8e7081"><div class="ttname"><a href="#af94c06f3220e5406245680f58b8e7081">data_structures::linked_list::link::psucc</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; psucc</div><div class="ttdoc">pointer to the next value on the list</div><div class="ttdef"><b>Definition</b> linked_list.cpp:56</div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1link_html_ac121ce37b6ea864b160ebcada0bce936"><div class="ttname"><a href="#ac121ce37b6ea864b160ebcada0bce936">data_structures::linked_list::link::pvalue</a></div><div class="ttdeci">int pvalue</div><div class="ttdoc">value of the current link</div><div class="ttdef"><b>Definition</b> <a href="../../da/dc3/linked__list_8cpp_source.html#l00055">linked_list.cpp:55</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1link_html_af94c06f3220e5406245680f58b8e7081"><div class="ttname"><a href="#af94c06f3220e5406245680f58b8e7081">data_structures::linked_list::link::psucc</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; psucc</div><div class="ttdoc">pointer to the next value on the list</div><div class="ttdef"><b>Definition</b> <a href="../../da/dc3/linked__list_8cpp_source.html#l00056">linked_list.cpp:56</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -185,7 +204,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>pvalue</b></td></tr>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt; &amp; data_structures::linked_list::link::succ </td>
+          <td class="memname">std::shared_ptr&lt; <a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> &gt; &amp; data_structures::linked_list::link::succ </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td></td>
@@ -198,6 +217,8 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>pvalue</b></td></tr>
 </table>
 </div><div class="memdoc">
 <p>function returns the pointer to next link </p><dl class="section return"><dt>Returns</dt><dd>the pointer to the next link </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00069">69</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   69</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#af94c06f3220e5406245680f58b8e7081">psucc</a>; }</div>
 </div><!-- fragment -->
 </div>
@@ -225,12 +246,67 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>pvalue</b></td></tr>
 </table>
 </div><div class="memdoc">
 <p>function returns the integer value stored in the link. </p><dl class="section return"><dt>Returns</dt><dd>the integer value stored in the link. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00063">63</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   63</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#ac121ce37b6ea864b160ebcada0bce936">pvalue</a>; }</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="af94c06f3220e5406245680f58b8e7081" name="af94c06f3220e5406245680f58b8e7081"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#af94c06f3220e5406245680f58b8e7081">&#9670;&#160;</a></span>psucc</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::shared_ptr&lt;<a class="el" href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a>&gt; data_structures::linked_list::link::psucc</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>pointer to the next value on the list </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00056">56</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ac121ce37b6ea864b160ebcada0bce936" name="ac121ce37b6ea864b160ebcada0bce936"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ac121ce37b6ea864b160ebcada0bce936">&#9670;&#160;</a></span>pvalue</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int data_structures::linked_list::link::pvalue</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>value of the current link </p>
+
+<p class="definition">Definition at line <a class="el" href="../../da/dc3/linked__list_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>data_structures/<a class="el" href="../../da/dc3/linked__list_8cpp.html">linked_list.cpp</a></li>
+<li>data_structures/<a class="el" href="../../da/dc3/linked__list_8cpp_source.html">linked_list.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/de/dab/ncr__modulo__p_8cpp.html b/de/dab/ncr__modulo__p_8cpp.html
index cc79780d2..ab05ec61e 100644
--- a/de/dab/ncr__modulo__p_8cpp.html
+++ b/de/dab/ncr__modulo__p_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/ncr_modulo_p.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/ncr_modulo_p.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for ncr_modulo_p.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d25/ncr__modulo__p_8cpp__incl.svg" width="252" height="111"><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">
+</div>
+<p><a href="../../de/dab/ncr__modulo__p_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">math::ncr_modulo_p::NCRModuloP</a></td></tr>
@@ -160,6 +179,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>This program aims at calculating <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a>. </p>
 <p>nCr is defined as n! / (r! * (n-r)!) where n! represents factorial of n. In many cases, the value of nCr is too large to fit in a 64 bit integer. Hence, in competitive programming, there are many problems or subproblems to compute nCr modulo p where p is a given number. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/KaustubhDamania" target="_blank">Kaustubh Damania</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html">ncr_modulo_p.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="afa2b50f4716fc3b42221a72e676e1422" name="afa2b50f4716fc3b42221a72e676e1422"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#afa2b50f4716fc3b42221a72e676e1422">&#9670;&#160;</a></span>example()</h2>
@@ -177,6 +198,8 @@ Functions</h2></td></tr>
 </div><div class="memdoc">
 
 <p>example showing the usage of the <a class="el" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" title="Class which contains all methods required for calculating nCr mod p.">math::ncr_modulo_p::NCRModuloP</a> class </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html#l00175">175</a> of file <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html">ncr_modulo_p.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  175</span>               {</div>
 <div class="line"><span class="lineno">  176</span>    <span class="keyword">const</span> int64_t size = 1e6 + 1;</div>
 <div class="line"><span class="lineno">  177</span>    <span class="keyword">const</span> int64_t p = 1e9 + 7;</div>
@@ -188,12 +211,11 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  183</span>    <span class="comment">// having the ncrObj we can efficiently query the values of (n C r)%p</span></div>
 <div class="line"><span class="lineno">  184</span>    <span class="comment">// note that time of the computation does not depend on size</span></div>
 <div class="line"><span class="lineno">  185</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= 7; i++) {</div>
-<div class="line"><span class="lineno">  186</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; 6 &lt;&lt; <span class="stringliteral">&quot;C&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; mod &quot;</span> &lt;&lt; p &lt;&lt; <span class="stringliteral">&quot; = &quot;</span> &lt;&lt; ncrObj.ncr(6, i)</div>
+<div class="line"><span class="lineno">  186</span>        std::cout &lt;&lt; 6 &lt;&lt; <span class="stringliteral">&quot;C&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; mod &quot;</span> &lt;&lt; p &lt;&lt; <span class="stringliteral">&quot; = &quot;</span> &lt;&lt; ncrObj.ncr(6, i)</div>
 <div class="line"><span class="lineno">  187</span>                  &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  188</span>    }</div>
 <div class="line"><span class="lineno">  189</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="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html"><div class="ttname"><a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">math::ncr_modulo_p::NCRModuloP</a></div><div class="ttdoc">Class which contains all methods required for calculating nCr mod p.</div><div class="ttdef"><b>Definition</b> ncr_modulo_p.cpp:79</div></div>
+<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html"><div class="ttname"><a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">math::ncr_modulo_p::NCRModuloP</a></div><div class="ttdoc">Class which contains all methods required for calculating nCr mod p.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dab/ncr__modulo__p_8cpp_source.html#l00079">ncr_modulo_p.cpp:79</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -237,6 +259,8 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the gcd of a and b </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html">ncr_modulo_p.cpp</a>.</p>
 <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> (a == 0) {</div>
 <div class="line"><span class="lineno">   47</span>        x = 0;</div>
@@ -251,14 +275,9 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   56</span>    y = x1;</div>
 <div class="line"><span class="lineno">   57</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>;</div>
 <div class="line"><span class="lineno">   58</span>}</div>
-<div class="ttc" id="agcd__iterative__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition</b> gcd_iterative_euclidean.cpp:15</div></div>
-<div class="ttc" id="ancr__modulo__p_8cpp_html_a9010ad5669d31449c3bf3271ab5ebc86"><div class="ttname"><a href="#a9010ad5669d31449c3bf3271ab5ebc86">math::ncr_modulo_p::utils::gcdExtended</a></div><div class="ttdeci">int64_t gcdExtended(const int64_t &amp;a, const int64_t &amp;b, int64_t &amp;x, int64_t &amp;y)</div><div class="ttdoc">finds the values x and y such that a*x + b*y = gcd(a,b)</div><div class="ttdef"><b>Definition</b> ncr_modulo_p.cpp:44</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dab/ncr__modulo__p_8cpp_a9010ad5669d31449c3bf3271ab5ebc86_cgraph.svg" width="240" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="agcd__iterative__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/da0/gcd__iterative__euclidean_8cpp_source.html#l00015">gcd_iterative_euclidean.cpp:15</a></div></div>
+<div class="ttc" id="ancr__modulo__p_8cpp_html_a9010ad5669d31449c3bf3271ab5ebc86"><div class="ttname"><a href="#a9010ad5669d31449c3bf3271ab5ebc86">math::ncr_modulo_p::utils::gcdExtended</a></div><div class="ttdeci">int64_t gcdExtended(const int64_t &amp;a, const int64_t &amp;b, int64_t &amp;x, int64_t &amp;y)</div><div class="ttdoc">finds the values x and y such that a*x + b*y = gcd(a,b)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dab/ncr__modulo__p_8cpp_source.html#l00044">ncr_modulo_p.cpp:44</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -275,13 +294,15 @@ Here is the call graph for this function:</div>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html#l00191">191</a> of file <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html">ncr_modulo_p.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  191</span>           {</div>
 <div class="line"><span class="lineno">  192</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();</div>
 <div class="line"><span class="lineno">  193</span>    <a class="code hl_function" href="#afa2b50f4716fc3b42221a72e676e1422">example</a>();</div>
 <div class="line"><span class="lineno">  194</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  195</span>}</div>
-<div class="ttc" id="ancr__modulo__p_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">tests math::ncr_modulo_p::NCRModuloP</div><div class="ttdef"><b>Definition</b> ncr_modulo_p.cpp:142</div></div>
-<div class="ttc" id="ancr__modulo__p_8cpp_html_afa2b50f4716fc3b42221a72e676e1422"><div class="ttname"><a href="#afa2b50f4716fc3b42221a72e676e1422">example</a></div><div class="ttdeci">void example()</div><div class="ttdoc">example showing the usage of the math::ncr_modulo_p::NCRModuloP class</div><div class="ttdef"><b>Definition</b> ncr_modulo_p.cpp:175</div></div>
+<div class="ttc" id="ancr__modulo__p_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">tests math::ncr_modulo_p::NCRModuloP</div><div class="ttdef"><b>Definition</b> <a href="../../de/dab/ncr__modulo__p_8cpp_source.html#l00142">ncr_modulo_p.cpp:142</a></div></div>
+<div class="ttc" id="ancr__modulo__p_8cpp_html_afa2b50f4716fc3b42221a72e676e1422"><div class="ttname"><a href="#afa2b50f4716fc3b42221a72e676e1422">example</a></div><div class="ttdeci">void example()</div><div class="ttdoc">example showing the usage of the math::ncr_modulo_p::NCRModuloP class</div><div class="ttdef"><b>Definition</b> <a href="../../de/dab/ncr__modulo__p_8cpp_source.html#l00175">ncr_modulo_p.cpp:175</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -312,6 +333,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the inverce of a modulo m, if it exists, -1 otherwise </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html#l00066">66</a> of file <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html">ncr_modulo_p.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   66</span>                                                       {</div>
 <div class="line"><span class="lineno">   67</span>    int64_t x = 0, y = 0;</div>
 <div class="line"><span class="lineno">   68</span>    <span class="keyword">const</span> int64_t <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a> = <a class="code hl_function" href="#a9010ad5669d31449c3bf3271ab5ebc86">gcdExtended</a>(a, m, x, y);</div>
@@ -321,13 +344,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   72</span>        <span class="keywordflow">return</span> ((x + m) % m);</div>
 <div class="line"><span class="lineno">   73</span>    }</div>
 <div class="line"><span class="lineno">   74</span>}</div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:115</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dab/ncr__modulo__p_8cpp_a6c7bfe3bdaa086d32261a5c5584d0fa9_cgraph.svg" width="428" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00115">composite_simpson_rule.cpp:115</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -354,6 +372,8 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>tests <a class="el" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" title="Class which contains all methods required for calculating nCr mod p.">math::ncr_modulo_p::NCRModuloP</a> </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html#l00142">142</a> of file <a class="el" href="../../de/dab/ncr__modulo__p_8cpp_source.html">ncr_modulo_p.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  142</span>                    {</div>
 <div class="line"><span class="lineno">  143</span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a> {</div>
 <div class="line"><span class="lineno">  144</span>        <span class="keyword">const</span> int64_t size;</div>
@@ -366,7 +386,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  151</span>                 <span class="keyword">const</span> int64_t r, <span class="keyword">const</span> int64_t expected)</div>
 <div class="line"><span class="lineno">  152</span>            : size(size), p(p), n(n), r(r), expected(expected) {}</div>
 <div class="line"><span class="lineno">  153</span>    };</div>
-<div class="line"><span class="lineno">  154</span>    <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;TestCase&gt;</a> test_cases = {</div>
+<div class="line"><span class="lineno">  154</span>    <span class="keyword">const</span> std::vector&lt;TestCase&gt; test_cases = {</div>
 <div class="line"><span class="lineno">  155</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(60000, 1000000007, 52323, 26161, 224944353),</div>
 <div class="line"><span class="lineno">  156</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(20, 5, 6, 2, 30 % 5),</div>
 <div class="line"><span class="lineno">  157</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(100, 29, 7, 3, 35 % 29),</div>
@@ -381,17 +401,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  166</span>               tc.expected);</div>
 <div class="line"><span class="lineno">  167</span>    }</div>
 <div class="line"><span class="lineno">  168</span> </div>
-<div class="line"><span class="lineno">  169</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n\nAll tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  169</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n\nAll tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  170</span>}</div>
-<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html_a499df7a01bcd348345dc5a0ab79bb0e9"><div class="ttname"><a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a499df7a01bcd348345dc5a0ab79bb0e9">math::ncr_modulo_p::NCRModuloP::ncr</a></div><div class="ttdeci">int64_t ncr(const int64_t &amp;n, const int64_t &amp;r) const</div><div class="ttdoc">computes nCr % p</div><div class="ttdef"><b>Definition</b> ncr_modulo_p.cpp:116</div></div>
-<div class="ttc" id="astruct_test_case_html"><div class="ttname"><a href="../../da/d86/struct_test_case.html">TestCase</a></div><div class="ttdoc">represents single example inputs and expected output of the function longest_common_string_length</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:54</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dab/ncr__modulo__p_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="248" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html_a499df7a01bcd348345dc5a0ab79bb0e9"><div class="ttname"><a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a499df7a01bcd348345dc5a0ab79bb0e9">math::ncr_modulo_p::NCRModuloP::ncr</a></div><div class="ttdeci">int64_t ncr(const int64_t &amp;n, const int64_t &amp;r) const</div><div class="ttdoc">computes nCr % p</div><div class="ttdef"><b>Definition</b> <a href="../../de/dab/ncr__modulo__p_8cpp_source.html#l00116">ncr_modulo_p.cpp:116</a></div></div>
+<div class="ttc" id="astruct_test_case_html"><div class="ttname"><a href="../../da/d86/struct_test_case.html">TestCase</a></div><div class="ttdoc">represents single example inputs and expected output of the function longest_common_string_length</div><div class="ttdef"><b>Definition</b> <a href="../../da/d0d/longest__common__string_8cpp_source.html#l00054">longest_common_string.cpp:54</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/de/dab/ncr__modulo__p_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/de/dab/ncr__modulo__p_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index f41266ef4..000000000
--- a/de/dab/ncr__modulo__p_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title="tests math::ncr_modulo_p::NCRModuloP" alt="" coords="5,13,56,38"/>
-<area shape="rect" id="Node000002" href="$d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a499df7a01bcd348345dc5a0ab79bb0e9" title="computes nCr % p" alt="" coords="104,5,243,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,23,88,23,88,28,56,28"/>
-</map>
diff --git a/de/dab/ncr__modulo__p_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/de/dab/ncr__modulo__p_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index bd2141301..000000000
--- a/de/dab/ncr__modulo__p_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ec67b7f0511b8bc24ff7b08d968d95ab
\ No newline at end of file
diff --git a/de/dab/ncr__modulo__p_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/de/dab/ncr__modulo__p_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index 70014e2b0..000000000
--- a/de/dab/ncr__modulo__p_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="186pt" height="39pt"
- viewBox="0.00 0.00 186.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="tests math::ncr_modulo_p::NCRModuloP">
-<polygon fill="#999999" stroke="#666666" points="37.75,-24.88 0,-24.88 0,-5.63 37.75,-5.63 37.75,-24.88"/>
-<text text-anchor="middle" x="18.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a499df7a01bcd348345dc5a0ab79bb0e9" target="_top" xlink:title="computes nCr % p">
-<polygon fill="white" stroke="#666666" points="178.25,-30.5 73.75,-30.5 73.75,0 178.25,0 178.25,-30.5"/>
-<text text-anchor="start" x="81.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
-<text text-anchor="middle" x="126" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::NCRModuloP::ncr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-15.25C45.14,-15.25 53.5,-15.25 62.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.96,-18.75 71.96,-15.25 61.96,-11.75 61.96,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dab/ncr__modulo__p_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/de/dab/ncr__modulo__p_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index 701393289..000000000
--- a/de/dab/ncr__modulo__p_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="186pt" height="39pt"
- viewBox="0.00 0.00 186.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="tests math::ncr_modulo_p::NCRModuloP">
-<polygon fill="#999999" stroke="#666666" points="37.75,-24.88 0,-24.88 0,-5.63 37.75,-5.63 37.75,-24.88"/>
-<text text-anchor="middle" x="18.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a499df7a01bcd348345dc5a0ab79bb0e9" target="_top" xlink:title="computes nCr % p">
-<polygon fill="white" stroke="#666666" points="178.25,-30.5 73.75,-30.5 73.75,0 178.25,0 178.25,-30.5"/>
-<text text-anchor="start" x="81.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
-<text text-anchor="middle" x="126" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::NCRModuloP::ncr</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.19,-15.25C45.14,-15.25 53.5,-15.25 62.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.96,-18.75 71.96,-15.25 61.96,-11.75 61.96,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dab/ncr__modulo__p_8cpp_a6c7bfe3bdaa086d32261a5c5584d0fa9_cgraph.map b/de/dab/ncr__modulo__p_8cpp_a6c7bfe3bdaa086d32261a5c5584d0fa9_cgraph.map
deleted file mode 100644
index 8dfe7ecf7..000000000
--- a/de/dab/ncr__modulo__p_8cpp_a6c7bfe3bdaa086d32261a5c5584d0fa9_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="math::ncr_modulo_p::utils::modInverse" name="math::ncr_modulo_p::utils::modInverse">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,145,70"/>
-<area shape="poly" id="edge4_Node000001_Node000001" title=" " alt="" coords="39,29,37,19,43,10,56,5,75,3,95,5,108,11,105,16,94,10,75,8,57,10,47,15,43,20,44,28"/>
-<area shape="rect" id="Node000002" href="$de/dab/ncr__modulo__p_8cpp.html#a9010ad5669d31449c3bf3271ab5ebc86" title="finds the values x and y such that a*x + b*y = gcd(a,b)" alt="" coords="193,29,332,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="145,47,177,47,177,52,145,52"/>
-<area shape="poly" id="edge3_Node000002_Node000002" title=" " alt="" coords="235,29,234,20,238,11,248,5,262,3,278,5,287,12,284,16,276,10,262,8,250,10,242,14,239,20,240,28"/>
-<area shape="rect" id="Node000003" href="$d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" title=" " alt="" coords="380,37,422,62"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="333,47,364,47,364,52,333,52"/>
-</map>
diff --git a/de/dab/ncr__modulo__p_8cpp_a6c7bfe3bdaa086d32261a5c5584d0fa9_cgraph.md5 b/de/dab/ncr__modulo__p_8cpp_a6c7bfe3bdaa086d32261a5c5584d0fa9_cgraph.md5
deleted file mode 100644
index 5cb077109..000000000
--- a/de/dab/ncr__modulo__p_8cpp_a6c7bfe3bdaa086d32261a5c5584d0fa9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1a4f0a265ffd31483084966d366feec6
\ No newline at end of file
diff --git a/de/dab/ncr__modulo__p_8cpp_a6c7bfe3bdaa086d32261a5c5584d0fa9_cgraph.svg b/de/dab/ncr__modulo__p_8cpp_a6c7bfe3bdaa086d32261a5c5584d0fa9_cgraph.svg
deleted file mode 100644
index f7ac47227..000000000
--- a/de/dab/ncr__modulo__p_8cpp_a6c7bfe3bdaa086d32261a5c5584d0fa9_cgraph.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::ncr_modulo_p::utils::modInverse Pages: 1 -->
-<svg width="321pt" height="57pt"
- viewBox="0.00 0.00 320.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::ncr_modulo_p::utils::modInverse</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="104.5,-30.5 0,-30.5 0,0 104.5,0 104.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
-<text text-anchor="middle" x="52.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::utils::modInverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.35,-30.99C22.27,-40.06 30.57,-48.5 52.25,-48.5 64.11,-48.5 71.96,-45.97 75.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.26,-42.83 76.97,-32.49 72.31,-42.01 79.26,-42.83"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dab/ncr__modulo__p_8cpp.html#a9010ad5669d31449c3bf3271ab5ebc86" target="_top" xlink:title="finds the values x and y such that a*x + b*y = gcd(a,b)">
-<polygon fill="white" stroke="#666666" points="245,-30.5 140.5,-30.5 140.5,0 245,0 245,-30.5"/>
-<text text-anchor="start" x="148.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
-<text text-anchor="middle" x="192.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::utils::gcdExtended</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.82,-15.25C112.66,-15.25 120.83,-15.25 128.88,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.62,-18.75 138.62,-15.25 128.62,-11.75 128.62,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.3,-30.99C170.53,-40.06 176.68,-48.5 192.75,-48.5 201.54,-48.5 207.36,-45.97 210.21,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.68,-42.76 211.07,-32.49 206.7,-42.15 213.68,-42.76"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312.75,-24.88 281,-24.88 281,-5.63 312.75,-5.63 312.75,-24.88"/>
-<text text-anchor="middle" x="296.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.41,-15.25C253.65,-15.25 261.87,-15.25 269.21,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.07,-18.75 279.07,-15.25 269.07,-11.75 269.07,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dab/ncr__modulo__p_8cpp_a6c7bfe3bdaa086d32261a5c5584d0fa9_cgraph_org.svg b/de/dab/ncr__modulo__p_8cpp_a6c7bfe3bdaa086d32261a5c5584d0fa9_cgraph_org.svg
deleted file mode 100644
index 3bb952e8f..000000000
--- a/de/dab/ncr__modulo__p_8cpp_a6c7bfe3bdaa086d32261a5c5584d0fa9_cgraph_org.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::ncr_modulo_p::utils::modInverse Pages: 1 -->
-<svg width="321pt" height="57pt"
- viewBox="0.00 0.00 320.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::ncr_modulo_p::utils::modInverse</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="104.5,-30.5 0,-30.5 0,0 104.5,0 104.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
-<text text-anchor="middle" x="52.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::utils::modInverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge4_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M27.35,-30.99C22.27,-40.06 30.57,-48.5 52.25,-48.5 64.11,-48.5 71.96,-45.97 75.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.26,-42.83 76.97,-32.49 72.31,-42.01 79.26,-42.83"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dab/ncr__modulo__p_8cpp.html#a9010ad5669d31449c3bf3271ab5ebc86" target="_top" xlink:title="finds the values x and y such that a*x + b*y = gcd(a,b)">
-<polygon fill="white" stroke="#666666" points="245,-30.5 140.5,-30.5 140.5,0 245,0 245,-30.5"/>
-<text text-anchor="start" x="148.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
-<text text-anchor="middle" x="192.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::utils::gcdExtended</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.82,-15.25C112.66,-15.25 120.83,-15.25 128.88,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.62,-18.75 138.62,-15.25 128.62,-11.75 128.62,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge3_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge3_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.3,-30.99C170.53,-40.06 176.68,-48.5 192.75,-48.5 201.54,-48.5 207.36,-45.97 210.21,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="213.68,-42.76 211.07,-32.49 206.7,-42.15 213.68,-42.76"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="312.75,-24.88 281,-24.88 281,-5.63 312.75,-5.63 312.75,-24.88"/>
-<text text-anchor="middle" x="296.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M245.41,-15.25C253.65,-15.25 261.87,-15.25 269.21,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.07,-18.75 279.07,-15.25 269.07,-11.75 269.07,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dab/ncr__modulo__p_8cpp_a9010ad5669d31449c3bf3271ab5ebc86_cgraph.map b/de/dab/ncr__modulo__p_8cpp_a9010ad5669d31449c3bf3271ab5ebc86_cgraph.map
deleted file mode 100644
index 9c74eae12..000000000
--- a/de/dab/ncr__modulo__p_8cpp_a9010ad5669d31449c3bf3271ab5ebc86_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="math::ncr_modulo_p::utils::gcdExtended" name="math::ncr_modulo_p::utils::gcdExtended">
-<area shape="rect" id="Node000001" title="finds the values x and y such that a*x + b*y = gcd(a,b)" alt="" coords="5,29,145,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="48,29,46,20,51,11,61,5,75,3,91,5,100,12,97,16,89,10,75,8,62,10,55,14,52,20,53,28"/>
-<area shape="rect" id="Node000002" href="$d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" title=" " alt="" coords="193,37,235,62"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="145,47,177,47,177,52,145,52"/>
-</map>
diff --git a/de/dab/ncr__modulo__p_8cpp_a9010ad5669d31449c3bf3271ab5ebc86_cgraph.md5 b/de/dab/ncr__modulo__p_8cpp_a9010ad5669d31449c3bf3271ab5ebc86_cgraph.md5
deleted file mode 100644
index b8480c416..000000000
--- a/de/dab/ncr__modulo__p_8cpp_a9010ad5669d31449c3bf3271ab5ebc86_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ba3da75994498c1bdb1f6cc36a33fadf
\ No newline at end of file
diff --git a/de/dab/ncr__modulo__p_8cpp_a9010ad5669d31449c3bf3271ab5ebc86_cgraph.svg b/de/dab/ncr__modulo__p_8cpp_a9010ad5669d31449c3bf3271ab5ebc86_cgraph.svg
deleted file mode 100644
index 79b1285ad..000000000
--- a/de/dab/ncr__modulo__p_8cpp_a9010ad5669d31449c3bf3271ab5ebc86_cgraph.svg
+++ /dev/null
@@ -1,75 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::ncr_modulo_p::utils::gcdExtended Pages: 1 -->
-<svg width="180pt" height="57pt"
- viewBox="0.00 0.00 180.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::ncr_modulo_p::utils::gcdExtended</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="finds the values x and y such that a*x + b*y = gcd(a,b)">
-<polygon fill="#999999" stroke="#666666" points="104.5,-30.5 0,-30.5 0,0 104.5,0 104.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
-<text text-anchor="middle" x="52.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::utils::gcdExtended</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.8,-30.99C30.03,-40.06 36.18,-48.5 52.25,-48.5 61.04,-48.5 66.86,-45.97 69.71,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.18,-42.76 70.57,-32.49 66.2,-42.15 73.18,-42.76"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="172.25,-24.88 140.5,-24.88 140.5,-5.63 172.25,-5.63 172.25,-24.88"/>
-<text text-anchor="middle" x="156.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.91,-15.25C113.15,-15.25 121.37,-15.25 128.71,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.57,-18.75 138.57,-15.25 128.57,-11.75 128.57,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dab/ncr__modulo__p_8cpp_a9010ad5669d31449c3bf3271ab5ebc86_cgraph_org.svg b/de/dab/ncr__modulo__p_8cpp_a9010ad5669d31449c3bf3271ab5ebc86_cgraph_org.svg
deleted file mode 100644
index e92866c30..000000000
--- a/de/dab/ncr__modulo__p_8cpp_a9010ad5669d31449c3bf3271ab5ebc86_cgraph_org.svg
+++ /dev/null
@@ -1,49 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::ncr_modulo_p::utils::gcdExtended Pages: 1 -->
-<svg width="180pt" height="57pt"
- viewBox="0.00 0.00 180.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::ncr_modulo_p::utils::gcdExtended</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="finds the values x and y such that a*x + b*y = gcd(a,b)">
-<polygon fill="#999999" stroke="#666666" points="104.5,-30.5 0,-30.5 0,0 104.5,0 104.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
-<text text-anchor="middle" x="52.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::utils::gcdExtended</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.8,-30.99C30.03,-40.06 36.18,-48.5 52.25,-48.5 61.04,-48.5 66.86,-45.97 69.71,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.18,-42.76 70.57,-32.49 66.2,-42.15 73.18,-42.76"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="172.25,-24.88 140.5,-24.88 140.5,-5.63 172.25,-5.63 172.25,-24.88"/>
-<text text-anchor="middle" x="156.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.91,-15.25C113.15,-15.25 121.37,-15.25 128.71,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.57,-18.75 138.57,-15.25 128.57,-11.75 128.57,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dab/ncr__modulo__p_8cpp_source.html b/de/dab/ncr__modulo__p_8cpp_source.html
new file mode 100644
index 000000000..2163d4cdd
--- /dev/null
+++ b/de/dab/ncr__modulo__p_8cpp_source.html
@@ -0,0 +1,297 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/ncr_modulo_p.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/dab/ncr__modulo__p_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">ncr_modulo_p.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/dab/ncr__modulo__p_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d4/db9/namespacencr__modulo__p.html">ncr_modulo_p</a> {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/d84/namespaceutils.html">utils</a> {</div>
+<div class="foldopen" id="foldopen00044" data-start="{" data-end="}">
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="../../de/dab/ncr__modulo__p_8cpp.html#a9010ad5669d31449c3bf3271ab5ebc86">   44</a></span>int64_t <a class="code hl_function" href="../../de/dab/ncr__modulo__p_8cpp.html#a9010ad5669d31449c3bf3271ab5ebc86">gcdExtended</a>(<span class="keyword">const</span> int64_t&amp; a, <span class="keyword">const</span> int64_t&amp; b, int64_t&amp; x,</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>                    int64_t&amp; y) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keywordflow">if</span> (a == 0) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        x = 0;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        y = 1;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        <span class="keywordflow">return</span> b;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    int64_t x1 = 0, y1 = 0;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keyword">const</span> int64_t <a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a> = <a class="code hl_function" href="../../de/dab/ncr__modulo__p_8cpp.html#a9010ad5669d31449c3bf3271ab5ebc86">gcdExtended</a>(b % a, a, x1, y1);</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    x = y1 - (b / a) * x1;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    y = x1;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>}</div>
+</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="foldopen" id="foldopen00066" data-start="{" data-end="}">
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"><a class="line" href="../../de/dab/ncr__modulo__p_8cpp.html#a6c7bfe3bdaa086d32261a5c5584d0fa9">   66</a></span>int64_t <a class="code hl_function" href="../../de/dab/ncr__modulo__p_8cpp.html#a6c7bfe3bdaa086d32261a5c5584d0fa9">modInverse</a>(<span class="keyword">const</span> int64_t&amp; a, <span class="keyword">const</span> int64_t&amp; m) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    int64_t x = 0, y = 0;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keyword">const</span> int64_t g = <a class="code hl_function" href="../../de/dab/ncr__modulo__p_8cpp.html#a9010ad5669d31449c3bf3271ab5ebc86">gcdExtended</a>(a, m, x, y);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordflow">if</span> (g != 1) {  <span class="comment">// modular inverse doesn&#39;t exist</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        <span class="keywordflow">return</span> ((x + m) % m);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    }</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>}</div>
+</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>}  <span class="comment">// namespace utils</span></div>
+<div class="foldopen" id="foldopen00079" data-start="{" data-end="};">
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"><a class="line" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">   79</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">NCRModuloP</a> {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keyword">const</span> int64_t p = 0;  </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keyword">const</span> std::vector&lt;int64_t&gt;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"><a class="line" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a738a5f59bb3560c81cdb7f43bcfe9fec">   83</a></span>        <a class="code hl_variable" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a738a5f59bb3560c81cdb7f43bcfe9fec">fac</a>;  </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="foldopen" id="foldopen00092" data-start="{" data-end="}">
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"><a class="line" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#ab5744fa589f6a48f9fe7bca13dbe661f">   92</a></span>    <span class="keyword">static</span> std::vector&lt;int64_t&gt; <a class="code hl_function" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#ab5744fa589f6a48f9fe7bca13dbe661f">computeFactorialsMod</a>(<span class="keyword">const</span> int64_t&amp; max_arg_val,</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>                                                     <span class="keyword">const</span> int64_t&amp; mod) {</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="keyword">auto</span> res = std::vector&lt;int64_t&gt;(max_arg_val + 1);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        res[0] = 1;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        <span class="keywordflow">for</span> (int64_t i = 1; i &lt;= max_arg_val; i++) {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            res[i] = (res[i - 1] * i) % mod;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        }</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        <span class="keywordflow">return</span> res;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    }</div>
+</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00107" data-start="{" data-end="}">
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"><a class="line" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a94b07e7dc61d8d7a1e9c5a28988e72f9">  107</a></span>    <a class="code hl_function" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a94b07e7dc61d8d7a1e9c5a28988e72f9">NCRModuloP</a>(<span class="keyword">const</span> int64_t&amp; size, <span class="keyword">const</span> int64_t&amp; p)</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        : p(p), <a class="code hl_variable" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a738a5f59bb3560c81cdb7f43bcfe9fec">fac</a>(<a class="code hl_function" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#ab5744fa589f6a48f9fe7bca13dbe661f">computeFactorialsMod</a>(size, p)) {}</div>
+</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="foldopen" id="foldopen00116" data-start="{" data-end="}">
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"><a class="line" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a499df7a01bcd348345dc5a0ab79bb0e9">  116</a></span>    int64_t <a class="code hl_function" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a499df7a01bcd348345dc5a0ab79bb0e9">ncr</a>(<span class="keyword">const</span> int64_t&amp; n, <span class="keyword">const</span> int64_t&amp; r)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        <span class="comment">// Base cases</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        <span class="keywordflow">if</span> (r &gt; n) {</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>            <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        }</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        <span class="keywordflow">if</span> (r == 1) {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>            <span class="keywordflow">return</span> n % p;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        }</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        <span class="keywordflow">if</span> (r == 0 || r == n) {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>            <span class="keywordflow">return</span> 1;</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        }</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <span class="comment">// fac is a global array with fac[r] = (r! % p)</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        <span class="keyword">const</span> <span class="keyword">auto</span> denominator = (<a class="code hl_variable" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a738a5f59bb3560c81cdb7f43bcfe9fec">fac</a>[r] * <a class="code hl_variable" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a738a5f59bb3560c81cdb7f43bcfe9fec">fac</a>[n - r]) % p;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        <span class="keyword">const</span> <span class="keyword">auto</span> denominator_inv = utils::modInverse(denominator, p);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>        <span class="keywordflow">if</span> (denominator_inv &lt; 0) {  <span class="comment">// modular inverse doesn&#39;t exist</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>            <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        }</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>        <span class="keywordflow">return</span> (<a class="code hl_variable" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a738a5f59bb3560c81cdb7f43bcfe9fec">fac</a>[n] * denominator_inv) % p;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    }</div>
+</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>};</div>
+</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>}  <span class="comment">// namespace ncr_modulo_p</span></div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
+<div class="foldopen" id="foldopen00142" data-start="{" data-end="}">
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"><a class="line" href="../../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">  142</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a> {</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>        <span class="keyword">const</span> int64_t size;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>        <span class="keyword">const</span> int64_t p;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>        <span class="keyword">const</span> int64_t n;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>        <span class="keyword">const</span> int64_t r;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>        <span class="keyword">const</span> int64_t expected;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span> </div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="keyword">const</span> int64_t size, <span class="keyword">const</span> int64_t p, <span class="keyword">const</span> int64_t n,</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>                 <span class="keyword">const</span> int64_t r, <span class="keyword">const</span> int64_t expected)</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>            : size(size), p(p), n(n), r(r), expected(expected) {}</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    };</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    <span class="keyword">const</span> std::vector&lt;TestCase&gt; test_cases = {</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(60000, 1000000007, 52323, 26161, 224944353),</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(20, 5, 6, 2, 30 % 5),</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(100, 29, 7, 3, 35 % 29),</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(1000, 13, 10, 3, 120 % 13),</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(20, 17, 1, 10, 0),</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(45, 19, 23, 1, 23 % 19),</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(45, 19, 23, 0, 1),</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(45, 19, 23, 23, 1),</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>        <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(20, 9, 10, 2, -1)};</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; tc : test_cases) {</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>        assert(<a class="code hl_class" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">math::ncr_modulo_p::NCRModuloP</a>(tc.size, tc.p).<a class="code hl_function" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a499df7a01bcd348345dc5a0ab79bb0e9">ncr</a>(tc.n, tc.r) ==</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>               tc.expected);</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    }</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span> </div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n\nAll tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>}</div>
+</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span> </div>
+<div class="foldopen" id="foldopen00175" data-start="{" data-end="}">
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"><a class="line" href="../../de/dab/ncr__modulo__p_8cpp.html#afa2b50f4716fc3b42221a72e676e1422">  175</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../de/dab/ncr__modulo__p_8cpp.html#afa2b50f4716fc3b42221a72e676e1422">example</a>() {</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    <span class="keyword">const</span> int64_t size = 1e6 + 1;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    <span class="keyword">const</span> int64_t p = 1e9 + 7;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    <span class="comment">// the ncrObj contains the precomputed values of factorials modulo p for</span></div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    <span class="comment">// values from 0 to size</span></div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    <span class="keyword">const</span> <span class="keyword">auto</span> ncrObj = <a class="code hl_class" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">math::ncr_modulo_p::NCRModuloP</a>(size, p);</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span> </div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>    <span class="comment">// having the ncrObj we can efficiently query the values of (n C r)%p</span></div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    <span class="comment">// note that time of the computation does not depend on size</span></div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= 7; i++) {</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        std::cout &lt;&lt; 6 &lt;&lt; <span class="stringliteral">&quot;C&quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; mod &quot;</span> &lt;&lt; p &lt;&lt; <span class="stringliteral">&quot; = &quot;</span> &lt;&lt; ncrObj.ncr(6, i)</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>                  &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    }</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>}</div>
+</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span> </div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    <a class="code hl_function" href="../../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    <a class="code hl_function" href="../../de/dab/ncr__modulo__p_8cpp.html#afa2b50f4716fc3b42221a72e676e1422">example</a>();</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>}</div>
+<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html"><div class="ttname"><a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">math::ncr_modulo_p::NCRModuloP</a></div><div class="ttdoc">Class which contains all methods required for calculating nCr mod p.</div><div class="ttdef"><b>Definition</b> <a href="#l00079">ncr_modulo_p.cpp:79</a></div></div>
+<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html_a499df7a01bcd348345dc5a0ab79bb0e9"><div class="ttname"><a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a499df7a01bcd348345dc5a0ab79bb0e9">math::ncr_modulo_p::NCRModuloP::ncr</a></div><div class="ttdeci">int64_t ncr(const int64_t &amp;n, const int64_t &amp;r) const</div><div class="ttdoc">computes nCr % p</div><div class="ttdef"><b>Definition</b> <a href="#l00116">ncr_modulo_p.cpp:116</a></div></div>
+<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html_a738a5f59bb3560c81cdb7f43bcfe9fec"><div class="ttname"><a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a738a5f59bb3560c81cdb7f43bcfe9fec">math::ncr_modulo_p::NCRModuloP::fac</a></div><div class="ttdeci">const std::vector&lt; int64_t &gt; fac</div><div class="ttdoc">the p from (nCr % p)</div><div class="ttdef"><b>Definition</b> <a href="#l00083">ncr_modulo_p.cpp:83</a></div></div>
+<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html_a94b07e7dc61d8d7a1e9c5a28988e72f9"><div class="ttname"><a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a94b07e7dc61d8d7a1e9c5a28988e72f9">math::ncr_modulo_p::NCRModuloP::NCRModuloP</a></div><div class="ttdeci">NCRModuloP(const int64_t &amp;size, const int64_t &amp;p)</div><div class="ttdoc">constructs an NCRModuloP object allowing to compute (nCr)p for inputs from 0 to size</div><div class="ttdef"><b>Definition</b> <a href="#l00107">ncr_modulo_p.cpp:107</a></div></div>
+<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html_ab5744fa589f6a48f9fe7bca13dbe661f"><div class="ttname"><a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#ab5744fa589f6a48f9fe7bca13dbe661f">math::ncr_modulo_p::NCRModuloP::computeFactorialsMod</a></div><div class="ttdeci">static std::vector&lt; int64_t &gt; computeFactorialsMod(const int64_t &amp;max_arg_val, const int64_t &amp;mod)</div><div class="ttdoc">stores precomputed factorial(i) % p value</div><div class="ttdef"><b>Definition</b> <a href="#l00092">ncr_modulo_p.cpp:92</a></div></div>
+<div class="ttc" id="agcd__iterative__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition</b> <a href="../../d4/da0/gcd__iterative__euclidean_8cpp_source.html#l00015">gcd_iterative_euclidean.cpp:15</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacencr__modulo__p_html"><div class="ttname"><a href="../../d4/db9/namespacencr__modulo__p.html">ncr_modulo_p</a></div><div class="ttdoc">Functions for nCr modulo p implementation.</div></div>
+<div class="ttc" id="anamespaceutils_html"><div class="ttname"><a href="../../d6/d84/namespaceutils.html">utils</a></div><div class="ttdoc">this namespace contains the definitions of the functions called from the class math::ncr_modulo_p::NC...</div></div>
+<div class="ttc" id="ancr__modulo__p_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">tests math::ncr_modulo_p::NCRModuloP</div><div class="ttdef"><b>Definition</b> <a href="#l00142">ncr_modulo_p.cpp:142</a></div></div>
+<div class="ttc" id="ancr__modulo__p_8cpp_html_a6c7bfe3bdaa086d32261a5c5584d0fa9"><div class="ttname"><a href="../../de/dab/ncr__modulo__p_8cpp.html#a6c7bfe3bdaa086d32261a5c5584d0fa9">math::ncr_modulo_p::utils::modInverse</a></div><div class="ttdeci">int64_t modInverse(const int64_t &amp;a, const int64_t &amp;m)</div><div class="ttdef"><b>Definition</b> <a href="#l00066">ncr_modulo_p.cpp:66</a></div></div>
+<div class="ttc" id="ancr__modulo__p_8cpp_html_a9010ad5669d31449c3bf3271ab5ebc86"><div class="ttname"><a href="../../de/dab/ncr__modulo__p_8cpp.html#a9010ad5669d31449c3bf3271ab5ebc86">math::ncr_modulo_p::utils::gcdExtended</a></div><div class="ttdeci">int64_t gcdExtended(const int64_t &amp;a, const int64_t &amp;b, int64_t &amp;x, int64_t &amp;y)</div><div class="ttdoc">finds the values x and y such that a*x + b*y = gcd(a,b)</div><div class="ttdef"><b>Definition</b> <a href="#l00044">ncr_modulo_p.cpp:44</a></div></div>
+<div class="ttc" id="ancr__modulo__p_8cpp_html_afa2b50f4716fc3b42221a72e676e1422"><div class="ttname"><a href="../../de/dab/ncr__modulo__p_8cpp.html#afa2b50f4716fc3b42221a72e676e1422">example</a></div><div class="ttdeci">void example()</div><div class="ttdoc">example showing the usage of the math::ncr_modulo_p::NCRModuloP class</div><div class="ttdef"><b>Definition</b> <a href="#l00175">ncr_modulo_p.cpp:175</a></div></div>
+<div class="ttc" id="astruct_test_case_html"><div class="ttname"><a href="../../da/d86/struct_test_case.html">TestCase</a></div><div class="ttdoc">represents single example inputs and expected output of the function longest_common_string_length</div><div class="ttdef"><b>Definition</b> <a href="../../da/d0d/longest__common__string_8cpp_source.html#l00054">longest_common_string.cpp:54</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../de/dab/ncr__modulo__p_8cpp.html">ncr_modulo_p.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/db3/namespaceatbash.html b/de/db3/namespaceatbash.html
index 48b749658..1c9d5ffa1 100644
--- a/de/db3/namespaceatbash.html
+++ b/de/db3/namespaceatbash.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: atbash Namespace Reference</title>
+<title>TheAlgorithms/C++: atbash Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/db4/namespacedisjoint__union.html b/de/db4/namespacedisjoint__union.html
index 470431f50..fbcace7e0 100644
--- a/de/db4/namespacedisjoint__union.html
+++ b/de/db4/namespacedisjoint__union.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: disjoint_union Namespace Reference</title>
+<title>TheAlgorithms/C++: disjoint_union Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/db5/class_edge-members.html b/de/db5/class_edge-members.html
index b5eba51fb..44051a989 100644
--- a/de/db5/class_edge-members.html
+++ b/de/db5/class_edge-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/db6/a1z26__cipher_8cpp.html b/de/db6/a1z26__cipher_8cpp.html
index 6ed2bb1fc..576dce39b 100644
--- a/de/db6/a1z26__cipher_8cpp.html
+++ b/de/db6/a1z26__cipher_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ciphers/a1z26_cipher.cpp File Reference</title>
+<title>TheAlgorithms/C++: ciphers/a1z26_cipher.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -127,7 +144,9 @@ Include dependency graph for a1z26_cipher.cpp:</div>
 <div class="dyncontent">
 <div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../df/dd6/a1z26__cipher_8cpp__incl.svg" width="100%" height="383"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
 </div>
-</div><table class="memberdecls">
+</div>
+<p><a href="../../de/db6/a1z26__cipher_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d4e/namespaceciphers.html">ciphers</a></td></tr>
@@ -139,10 +158,10 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a77a6b827a0b9c7aca2d705811459d744" id="r_a77a6b827a0b9c7aca2d705811459d744"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a77a6b827a0b9c7aca2d705811459d744">ciphers::a1z26::encrypt</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> text)</td></tr>
+<tr class="memitem:a77a6b827a0b9c7aca2d705811459d744" id="r_a77a6b827a0b9c7aca2d705811459d744"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a77a6b827a0b9c7aca2d705811459d744">ciphers::a1z26::encrypt</a> (std::string text)</td></tr>
 <tr class="memdesc:a77a6b827a0b9c7aca2d705811459d744"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../d8/d2a/namespacea1z26.html" title="Functions for A1Z26 encryption and decryption implementation.">a1z26</a> encryption implementation  <br /></td></tr>
 <tr class="separator:a77a6b827a0b9c7aca2d705811459d744"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0a78954e96c862430904ee3e64623c38" id="r_a0a78954e96c862430904ee3e64623c38"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0a78954e96c862430904ee3e64623c38">ciphers::a1z26::decrypt</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;text, bool bReturnUppercase=false)</td></tr>
+<tr class="memitem:a0a78954e96c862430904ee3e64623c38" id="r_a0a78954e96c862430904ee3e64623c38"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0a78954e96c862430904ee3e64623c38">ciphers::a1z26::decrypt</a> (const std::string &amp;text, bool bReturnUppercase=false)</td></tr>
 <tr class="memdesc:a0a78954e96c862430904ee3e64623c38"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../d8/d2a/namespacea1z26.html" title="Functions for A1Z26 encryption and decryption implementation.">a1z26</a> decryption implementation  <br /></td></tr>
 <tr class="separator:a0a78954e96c862430904ee3e64623c38"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -154,15 +173,17 @@ Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:a9b0bba130e569910cb077c70eebeb27c" id="r_a9b0bba130e569910cb077c70eebeb27c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt; uint8_t, char &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9b0bba130e569910cb077c70eebeb27c">ciphers::a1z26::a1z26_decrypt_map</a></td></tr>
+<tr class="memitem:a9b0bba130e569910cb077c70eebeb27c" id="r_a9b0bba130e569910cb077c70eebeb27c"><td class="memItemLeft" align="right" valign="top">std::map&lt; uint8_t, char &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9b0bba130e569910cb077c70eebeb27c">ciphers::a1z26::a1z26_decrypt_map</a></td></tr>
 <tr class="separator:a9b0bba130e569910cb077c70eebeb27c"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aff1ae9e8aa4eed6b67ee0ff412ddbb67" id="r_aff1ae9e8aa4eed6b67ee0ff412ddbb67"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt; char, uint8_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aff1ae9e8aa4eed6b67ee0ff412ddbb67">ciphers::a1z26::a1z26_encrypt_map</a></td></tr>
+<tr class="memitem:aff1ae9e8aa4eed6b67ee0ff412ddbb67" id="r_aff1ae9e8aa4eed6b67ee0ff412ddbb67"><td class="memItemLeft" align="right" valign="top">std::map&lt; char, uint8_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aff1ae9e8aa4eed6b67ee0ff412ddbb67">ciphers::a1z26::a1z26_encrypt_map</a></td></tr>
 <tr class="separator:aff1ae9e8aa4eed6b67ee0ff412ddbb67"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of the <a href="https://www.dcode.fr/letter-number-cipher" target="_blank">A1Z26 cipher</a> </p>
 <p>The A1Z26 cipher is a simple substiution cipher where each letter is replaced by the number of the order they're in. For example, A corresponds to 1, B = 2, C = 3, etc.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Focusucof" target="_blank">Focusucof</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../de/db6/a1z26__cipher_8cpp_source.html">a1z26_cipher.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a0a78954e96c862430904ee3e64623c38" name="a0a78954e96c862430904ee3e64623c38"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0a78954e96c862430904ee3e64623c38">&#9670;&#160;</a></span>decrypt()</h2>
@@ -171,9 +192,9 @@ Variables</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ciphers::a1z26::decrypt </td>
+          <td class="memname">std::string ciphers::a1z26::decrypt </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>text</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -192,29 +213,31 @@ Variables</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the decrypted string in all uppercase or all lowercase </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/db6/a1z26__cipher_8cpp_source.html#l00078">78</a> of file <a class="el" href="../../de/db6/a1z26__cipher_8cpp_source.html">a1z26_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   78</span>                                                                        {</div>
-<div class="line"><span class="lineno">   79</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
+<div class="line"><span class="lineno">   79</span>    std::string <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   80</span> </div>
 <div class="line"><span class="lineno">   81</span>    <span class="comment">// split words seperated by spaces into a vector array</span></div>
-<div class="line"><span class="lineno">   82</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::string&gt;</a> word_array;</div>
-<div class="line"><span class="lineno">   83</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">std::stringstream</a> sstream(text);</div>
-<div class="line"><span class="lineno">   84</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> word;</div>
+<div class="line"><span class="lineno">   82</span>    std::vector&lt;std::string&gt; word_array;</div>
+<div class="line"><span class="lineno">   83</span>    std::stringstream sstream(text);</div>
+<div class="line"><span class="lineno">   84</span>    std::string word;</div>
 <div class="line"><span class="lineno">   85</span>    <span class="keywordflow">while</span> (sstream &gt;&gt; word) {</div>
-<div class="line"><span class="lineno">   86</span>        word_array.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(word);</div>
+<div class="line"><span class="lineno">   86</span>        word_array.push_back(word);</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>    <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; i : word_array) {</div>
-<div class="line"><span class="lineno">   90</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/replace.html">std::replace</a>(i.begin(), i.end(), <span class="charliteral">&#39;-&#39;</span>, <span class="charliteral">&#39; &#39;</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&lt;std::string&gt;</a> text_array;</div>
+<div class="line"><span class="lineno">   90</span>        std::replace(i.begin(), i.end(), <span class="charliteral">&#39;-&#39;</span>, <span class="charliteral">&#39; &#39;</span>);</div>
+<div class="line"><span class="lineno">   91</span>        std::vector&lt;std::string&gt; text_array;</div>
 <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/io/basic_stringstream.html">std::stringstream</a> ss(i);</div>
-<div class="line"><span class="lineno">   94</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> res_text;</div>
+<div class="line"><span class="lineno">   93</span>        std::stringstream ss(i);</div>
+<div class="line"><span class="lineno">   94</span>        std::string res_text;</div>
 <div class="line"><span class="lineno">   95</span>        <span class="keywordflow">while</span> (ss &gt;&gt; res_text) {</div>
-<div class="line"><span class="lineno">   96</span>            text_array.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(res_text);</div>
+<div class="line"><span class="lineno">   96</span>            text_array.push_back(res_text);</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="keywordflow">for</span> (<span class="keyword">auto</span>&amp; i : text_array) {</div>
-<div class="line"><span class="lineno">  100</span>            <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> += a1z26_decrypt_map[<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html">stoi</a>(i)];</div>
+<div class="line"><span class="lineno">  100</span>            <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> += a1z26_decrypt_map[stoi(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>        <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> += <span class="charliteral">&#39; &#39;</span>;</div>
@@ -222,24 +245,12 @@ Variables</h2></td></tr>
 <div class="line"><span class="lineno">  105</span>    <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.pop_back();  <span class="comment">// remove any leading whitespace</span></div>
 <div class="line"><span class="lineno">  106</span> </div>
 <div class="line"><span class="lineno">  107</span>    <span class="keywordflow">if</span> (bReturnUppercase) {</div>
-<div class="line"><span class="lineno">  108</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/transform.html">std::transform</a>(<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.begin(), <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.end(), <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.begin(), ::toupper);</div>
+<div class="line"><span class="lineno">  108</span>        std::transform(<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.begin(), <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.end(), <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.begin(), ::toupper);</div>
 <div class="line"><span class="lineno">  109</span>    }</div>
 <div class="line"><span class="lineno">  110</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  111</span>}</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="abasic_stringstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">std::stringstream</a></div></div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="areplace_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/replace.html">std::replace</a></div><div class="ttdeci">T replace(T... args)</div></div>
-<div class="ttc" id="astol_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html">std::stoi</a></div><div class="ttdeci">T stoi(T... args)</div></div>
-<div class="ttc" id="atransform_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/transform.html">std::transform</a></div><div class="ttdeci">T transform(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/db6/a1z26__cipher_8cpp_a0a78954e96c862430904ee3e64623c38_cgraph.svg" width="371" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a77a6b827a0b9c7aca2d705811459d744" name="a77a6b827a0b9c7aca2d705811459d744"></a>
@@ -249,9 +260,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> ciphers::a1z26::encrypt </td>
+          <td class="memname">std::string ciphers::a1z26::encrypt </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>text</em></span></td><td>)</td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>text</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -265,14 +276,16 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>encoded string with dashes to seperate letters </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/db6/a1z26__cipher_8cpp_source.html#l00051">51</a> of file <a class="el" href="../../de/db6/a1z26__cipher_8cpp_source.html">a1z26_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   51</span>                                  {</div>
-<div class="line"><span class="lineno">   52</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
-<div class="line"><span class="lineno">   53</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/transform.html">std::transform</a>(text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">begin</a>(), text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">end</a>(), text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">begin</a>(),</div>
+<div class="line"><span class="lineno">   52</span>    std::string <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
+<div class="line"><span class="lineno">   53</span>    std::transform(text.begin(), text.end(), text.begin(),</div>
 <div class="line"><span class="lineno">   54</span>                   ::tolower);  <span class="comment">// convert string to lowercase</span></div>
-<div class="line"><span class="lineno">   55</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/replace.html">std::replace</a>(text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">begin</a>(), text.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">end</a>(), <span class="charliteral">&#39;:&#39;</span>, <span class="charliteral">&#39; &#39;</span>);</div>
+<div class="line"><span class="lineno">   55</span>    std::replace(text.begin(), text.end(), <span class="charliteral">&#39;:&#39;</span>, <span class="charliteral">&#39; &#39;</span>);</div>
 <div class="line"><span class="lineno">   56</span>    <span class="keywordflow">for</span> (<span class="keywordtype">char</span> letter : text) {</div>
 <div class="line"><span class="lineno">   57</span>        <span class="keywordflow">if</span> (letter != <span class="charliteral">&#39; &#39;</span>) {</div>
-<div class="line"><span class="lineno">   58</span>            <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> += <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html">std::to_string</a>(</div>
+<div class="line"><span class="lineno">   58</span>            <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> += std::to_string(</div>
 <div class="line"><span class="lineno">   59</span>                a1z26_encrypt_map[letter]);  <span class="comment">// convert int to string and append</span></div>
 <div class="line"><span class="lineno">   60</span>                                             <span class="comment">// to result</span></div>
 <div class="line"><span class="lineno">   61</span>            <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> += <span class="stringliteral">&quot;-&quot;</span>;  <span class="comment">// space out each set of numbers with spaces</span></div>
@@ -284,15 +297,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   67</span>    <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.pop_back();  <span class="comment">// remove leading dash</span></div>
 <div class="line"><span class="lineno">   68</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   69</span>}</div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">std::string::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">std::string::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="ato_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html">std::to_string</a></div><div class="ttdeci">T to_string(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/db6/a1z26__cipher_8cpp_a77a6b827a0b9c7aca2d705811459d744_cgraph.svg" width="335" height="234"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -312,17 +317,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../de/db6/a1z26__cipher_8cpp_source.html#l00159">159</a> of file <a class="el" href="../../de/db6/a1z26__cipher_8cpp_source.html">a1z26_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  159</span>           {</div>
 <div class="line"><span class="lineno">  160</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  161</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  162</span>}</div>
-<div class="ttc" id="aa1z26__cipher_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> a1z26_cipher.cpp:120</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/db6/a1z26__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aa1z26__cipher_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../de/db6/a1z26__cipher_8cpp_source.html#l00120">a1z26_cipher.cpp:120</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -350,50 +352,45 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../de/db6/a1z26__cipher_8cpp_source.html#l00120">120</a> of file <a class="el" href="../../de/db6/a1z26__cipher_8cpp_source.html">a1z26_cipher.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  120</span>                   {</div>
 <div class="line"><span class="lineno">  121</span>    <span class="comment">// 1st test</span></div>
-<div class="line"><span class="lineno">  122</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> input = <span class="stringliteral">&quot;Hello World&quot;</span>;</div>
-<div class="line"><span class="lineno">  123</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> expected = <span class="stringliteral">&quot;8-5-12-12-15 23-15-18-12-4&quot;</span>;</div>
-<div class="line"><span class="lineno">  124</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> output = <a class="code hl_function" href="#a77a6b827a0b9c7aca2d705811459d744">ciphers::a1z26::encrypt</a>(input);</div>
+<div class="line"><span class="lineno">  122</span>    std::string input = <span class="stringliteral">&quot;Hello World&quot;</span>;</div>
+<div class="line"><span class="lineno">  123</span>    std::string expected = <span class="stringliteral">&quot;8-5-12-12-15 23-15-18-12-4&quot;</span>;</div>
+<div class="line"><span class="lineno">  124</span>    std::string output = <a class="code hl_function" href="#a77a6b827a0b9c7aca2d705811459d744">ciphers::a1z26::encrypt</a>(input);</div>
 <div class="line"><span class="lineno">  125</span> </div>
-<div class="line"><span class="lineno">  126</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input: &quot;</span> &lt;&lt; input &lt;&lt; <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">  127</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected: &quot;</span> &lt;&lt; expected &lt;&lt; <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">  128</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; output &lt;&lt; <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">  126</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input: &quot;</span> &lt;&lt; input &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  127</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected: &quot;</span> &lt;&lt; expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  128</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; output &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  129</span>    assert(output == expected);</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> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span>;</div>
+<div class="line"><span class="lineno">  130</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span>;</div>
 <div class="line"><span class="lineno">  131</span> </div>
 <div class="line"><span class="lineno">  132</span>    <span class="comment">// 2nd test</span></div>
 <div class="line"><span class="lineno">  133</span>    input = <span class="stringliteral">&quot;12-15-23-5-18-3-1-19-5&quot;</span>;</div>
 <div class="line"><span class="lineno">  134</span>    expected = <span class="stringliteral">&quot;lowercase&quot;</span>;</div>
 <div class="line"><span class="lineno">  135</span>    output = <a class="code hl_function" href="#a0a78954e96c862430904ee3e64623c38">ciphers::a1z26::decrypt</a>(input);</div>
 <div class="line"><span class="lineno">  136</span> </div>
-<div class="line"><span class="lineno">  137</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input: &quot;</span> &lt;&lt; input &lt;&lt; <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">  138</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected: &quot;</span> &lt;&lt; expected &lt;&lt; <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">  139</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; output &lt;&lt; <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">  137</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input: &quot;</span> &lt;&lt; input &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  138</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected: &quot;</span> &lt;&lt; expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  139</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; output &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  140</span>    assert(output == expected);</div>
-<div class="line"><span class="lineno">  141</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span>;</div>
+<div class="line"><span class="lineno">  141</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span>;</div>
 <div class="line"><span class="lineno">  142</span> </div>
 <div class="line"><span class="lineno">  143</span>    <span class="comment">// 3rd test</span></div>
 <div class="line"><span class="lineno">  144</span>    input = <span class="stringliteral">&quot;21-16-16-5-18-3-1-19-5&quot;</span>;</div>
 <div class="line"><span class="lineno">  145</span>    expected = <span class="stringliteral">&quot;UPPERCASE&quot;</span>;</div>
 <div class="line"><span class="lineno">  146</span>    output = <a class="code hl_function" href="#a0a78954e96c862430904ee3e64623c38">ciphers::a1z26::decrypt</a>(input, <span class="keyword">true</span>);</div>
 <div class="line"><span class="lineno">  147</span> </div>
-<div class="line"><span class="lineno">  148</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input: &quot;</span> &lt;&lt; input &lt;&lt; <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">  149</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Expected: &quot;</span> &lt;&lt; expected &lt;&lt; <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">  150</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; output &lt;&lt; <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">  148</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input: &quot;</span> &lt;&lt; input &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  149</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected: &quot;</span> &lt;&lt; expected &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  150</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; output &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  151</span>    assert(output == expected);</div>
-<div class="line"><span class="lineno">  152</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span>;</div>
+<div class="line"><span class="lineno">  152</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span>;</div>
 <div class="line"><span class="lineno">  153</span>}</div>
-<div class="ttc" id="aa1z26__cipher_8cpp_html_a0a78954e96c862430904ee3e64623c38"><div class="ttname"><a href="#a0a78954e96c862430904ee3e64623c38">ciphers::a1z26::decrypt</a></div><div class="ttdeci">std::string decrypt(const std::string &amp;text, bool bReturnUppercase=false)</div><div class="ttdoc">a1z26 decryption implementation</div><div class="ttdef"><b>Definition</b> a1z26_cipher.cpp:78</div></div>
-<div class="ttc" id="aa1z26__cipher_8cpp_html_a77a6b827a0b9c7aca2d705811459d744"><div class="ttname"><a href="#a77a6b827a0b9c7aca2d705811459d744">ciphers::a1z26::encrypt</a></div><div class="ttdeci">std::string encrypt(std::string text)</div><div class="ttdoc">a1z26 encryption implementation</div><div class="ttdef"><b>Definition</b> a1z26_cipher.cpp:51</div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/db6/a1z26__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aa1z26__cipher_8cpp_html_a0a78954e96c862430904ee3e64623c38"><div class="ttname"><a href="#a0a78954e96c862430904ee3e64623c38">ciphers::a1z26::decrypt</a></div><div class="ttdeci">std::string decrypt(const std::string &amp;text, bool bReturnUppercase=false)</div><div class="ttdoc">a1z26 decryption implementation</div><div class="ttdef"><b>Definition</b> <a href="../../de/db6/a1z26__cipher_8cpp_source.html#l00078">a1z26_cipher.cpp:78</a></div></div>
+<div class="ttc" id="aa1z26__cipher_8cpp_html_a77a6b827a0b9c7aca2d705811459d744"><div class="ttname"><a href="#a77a6b827a0b9c7aca2d705811459d744">ciphers::a1z26::encrypt</a></div><div class="ttdeci">std::string encrypt(std::string text)</div><div class="ttdoc">a1z26 encryption implementation</div><div class="ttdef"><b>Definition</b> <a href="../../de/db6/a1z26__cipher_8cpp_source.html#l00051">a1z26_cipher.cpp:51</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Variable Documentation</h2>
@@ -404,7 +401,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt;uint8_t, char&gt; ciphers::a1z26::a1z26_decrypt_map</td>
+          <td class="memname">std::map&lt;uint8_t, char&gt; ciphers::a1z26::a1z26_decrypt_map</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -414,7 +411,9 @@ Here is the call graph for this function:</div>
 <div class="line">    {15, <span class="charliteral">&#39;o&#39;</span>}, {16, <span class="charliteral">&#39;p&#39;</span>}, {17, <span class="charliteral">&#39;q&#39;</span>}, {18, <span class="charliteral">&#39;r&#39;</span>}, {19, <span class="charliteral">&#39;s&#39;</span>}, {20, <span class="charliteral">&#39;t&#39;</span>}, {21, <span class="charliteral">&#39;u&#39;</span>},</div>
 <div class="line">    {22, <span class="charliteral">&#39;v&#39;</span>}, {23, <span class="charliteral">&#39;w&#39;</span>}, {24, <span class="charliteral">&#39;x&#39;</span>}, {25, <span class="charliteral">&#39;y&#39;</span>}, {26, <span class="charliteral">&#39;z&#39;</span>},</div>
 <div class="line">}</div>
-</div><!-- fragment --><div class="fragment"><div class="line"><span class="lineno">   33</span>                                          {</div>
+</div><!-- fragment -->
+<p class="definition">Definition at line <a class="el" href="../../de/db6/a1z26__cipher_8cpp_source.html#l00033">33</a> of file <a class="el" href="../../de/db6/a1z26__cipher_8cpp_source.html">a1z26_cipher.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   33</span>                                          {</div>
 <div class="line"><span class="lineno">   34</span>    {1, <span class="charliteral">&#39;a&#39;</span>},  {2, <span class="charliteral">&#39;b&#39;</span>},  {3, <span class="charliteral">&#39;c&#39;</span>},  {4, <span class="charliteral">&#39;d&#39;</span>},  {5, <span class="charliteral">&#39;e&#39;</span>},  {6, <span class="charliteral">&#39;f&#39;</span>},  {7, <span class="charliteral">&#39;g&#39;</span>},</div>
 <div class="line"><span class="lineno">   35</span>    {8, <span class="charliteral">&#39;h&#39;</span>},  {9, <span class="charliteral">&#39;i&#39;</span>},  {10, <span class="charliteral">&#39;j&#39;</span>}, {11, <span class="charliteral">&#39;k&#39;</span>}, {12, <span class="charliteral">&#39;l&#39;</span>}, {13, <span class="charliteral">&#39;m&#39;</span>}, {14, <span class="charliteral">&#39;n&#39;</span>},</div>
 <div class="line"><span class="lineno">   36</span>    {15, <span class="charliteral">&#39;o&#39;</span>}, {16, <span class="charliteral">&#39;p&#39;</span>}, {17, <span class="charliteral">&#39;q&#39;</span>}, {18, <span class="charliteral">&#39;r&#39;</span>}, {19, <span class="charliteral">&#39;s&#39;</span>}, {20, <span class="charliteral">&#39;t&#39;</span>}, {21, <span class="charliteral">&#39;u&#39;</span>},</div>
@@ -430,7 +429,7 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt;char, uint8_t&gt; ciphers::a1z26::a1z26_encrypt_map</td>
+          <td class="memname">std::map&lt;char, uint8_t&gt; ciphers::a1z26::a1z26_encrypt_map</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -439,7 +438,9 @@ Here is the call graph for this function:</div>
 <div class="line">    {<span class="charliteral">&#39;h&#39;</span>, 8},  {<span class="charliteral">&#39;i&#39;</span>, 9},  {<span class="charliteral">&#39;j&#39;</span>, 10}, {<span class="charliteral">&#39;k&#39;</span>, 11}, {<span class="charliteral">&#39;l&#39;</span>, 12}, {<span class="charliteral">&#39;m&#39;</span>, 13}, {<span class="charliteral">&#39;n&#39;</span>, 14},</div>
 <div class="line">    {<span class="charliteral">&#39;o&#39;</span>, 15}, {<span class="charliteral">&#39;p&#39;</span>, 16}, {<span class="charliteral">&#39;q&#39;</span>, 17}, {<span class="charliteral">&#39;r&#39;</span>, 18}, {<span class="charliteral">&#39;s&#39;</span>, 19}, {<span class="charliteral">&#39;t&#39;</span>, 20}, {<span class="charliteral">&#39;u&#39;</span>, 21},</div>
 <div class="line">    {<span class="charliteral">&#39;v&#39;</span>, 22}, {<span class="charliteral">&#39;w&#39;</span>, 23}, {<span class="charliteral">&#39;x&#39;</span>, 24}, {<span class="charliteral">&#39;y&#39;</span>, 25}, {<span class="charliteral">&#39;z&#39;</span>, 26}}</div>
-</div><!-- fragment --><div class="fragment"><div class="line"><span class="lineno">   40</span>                                          {</div>
+</div><!-- fragment -->
+<p class="definition">Definition at line <a class="el" href="../../de/db6/a1z26__cipher_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../de/db6/a1z26__cipher_8cpp_source.html">a1z26_cipher.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   40</span>                                          {</div>
 <div class="line"><span class="lineno">   41</span>    {<span class="charliteral">&#39;a&#39;</span>, 1},  {<span class="charliteral">&#39;b&#39;</span>, 2},  {<span class="charliteral">&#39;c&#39;</span>, 3},  {<span class="charliteral">&#39;d&#39;</span>, 4},  {<span class="charliteral">&#39;e&#39;</span>, 5},  {<span class="charliteral">&#39;f&#39;</span>, 6},  {<span class="charliteral">&#39;g&#39;</span>, 7},</div>
 <div class="line"><span class="lineno">   42</span>    {<span class="charliteral">&#39;h&#39;</span>, 8},  {<span class="charliteral">&#39;i&#39;</span>, 9},  {<span class="charliteral">&#39;j&#39;</span>, 10}, {<span class="charliteral">&#39;k&#39;</span>, 11}, {<span class="charliteral">&#39;l&#39;</span>, 12}, {<span class="charliteral">&#39;m&#39;</span>, 13}, {<span class="charliteral">&#39;n&#39;</span>, 14},</div>
 <div class="line"><span class="lineno">   43</span>    {<span class="charliteral">&#39;o&#39;</span>, 15}, {<span class="charliteral">&#39;p&#39;</span>, 16}, {<span class="charliteral">&#39;q&#39;</span>, 17}, {<span class="charliteral">&#39;r&#39;</span>, 18}, {<span class="charliteral">&#39;s&#39;</span>, 19}, {<span class="charliteral">&#39;t&#39;</span>, 20}, {<span class="charliteral">&#39;u&#39;</span>, 21},</div>
diff --git a/de/db6/a1z26__cipher_8cpp_a0a78954e96c862430904ee3e64623c38_cgraph.map b/de/db6/a1z26__cipher_8cpp_a0a78954e96c862430904ee3e64623c38_cgraph.map
deleted file mode 100644
index fbbb1904a..000000000
--- a/de/db6/a1z26__cipher_8cpp_a0a78954e96c862430904ee3e64623c38_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="ciphers::a1z26::decrypt" name="ciphers::a1z26::decrypt">
-<area shape="rect" id="Node000001" title="a1z26 decryption implementation" alt="" coords="5,55,163,80"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="50,56,43,46,47,36,61,30,84,28,109,31,122,38,119,42,107,36,84,33,63,35,51,40,49,45,54,53"/>
-<area shape="rect" id="Node000002" 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="211,5,365,31"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="140,51,216,33,217,38,141,57"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/replace.html#" title=" " alt="" coords="243,55,332,80"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="163,65,228,65,228,70,163,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/transform.html#" title=" " alt="" coords="237,104,339,130"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="141,78,222,98,221,103,140,84"/>
-</map>
diff --git a/de/db6/a1z26__cipher_8cpp_a0a78954e96c862430904ee3e64623c38_cgraph.md5 b/de/db6/a1z26__cipher_8cpp_a0a78954e96c862430904ee3e64623c38_cgraph.md5
deleted file mode 100644
index 42b18d05c..000000000
--- a/de/db6/a1z26__cipher_8cpp_a0a78954e96c862430904ee3e64623c38_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b48ba19614f4f02601ca7c635fe316e0
\ No newline at end of file
diff --git a/de/db6/a1z26__cipher_8cpp_a0a78954e96c862430904ee3e64623c38_cgraph.svg b/de/db6/a1z26__cipher_8cpp_a0a78954e96c862430904ee3e64623c38_cgraph.svg
deleted file mode 100644
index 7aff9845e..000000000
--- a/de/db6/a1z26__cipher_8cpp_a0a78954e96c862430904ee3e64623c38_cgraph.svg
+++ /dev/null
@@ -1,110 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::a1z26::decrypt Pages: 1 -->
-<svg width="278pt" height="101pt"
- viewBox="0.00 0.00 277.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>ciphers::a1z26::decrypt</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="a1z26 decryption implementation">
-<polygon fill="#999999" stroke="#666666" points="118,-56.25 0,-56.25 0,-37 118,-37 118,-56.25"/>
-<text text-anchor="middle" x="59" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::a1z26::decrypt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.07,-56.54C24.15,-65.15 32.13,-74.25 59,-74.25 74.12,-74.25 83.25,-71.37 86.41,-67.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.8,-66.42 83.4,-57.98 83.14,-68.57 89.8,-66.42"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269.75,-93.25 154,-93.25 154,-74 269.75,-74 269.75,-93.25"/>
-<text text-anchor="middle" x="211.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.23,-56.74C118.94,-61.08 139.85,-66.21 158.63,-70.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.68,-74.18 168.23,-73.17 159.35,-67.39 157.68,-74.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/replace.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245.38,-56.25 178.38,-56.25 178.38,-37 245.38,-37 245.38,-56.25"/>
-<text text-anchor="middle" x="211.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::replace</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.33,-46.62C134.46,-46.62 151.68,-46.62 166.84,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.47,-50.13 176.47,-46.63 166.47,-43.13 166.47,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/transform.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="250.25,-19.25 173.5,-19.25 173.5,0 250.25,0 250.25,-19.25"/>
-<text text-anchor="middle" x="211.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::transform</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.23,-36.51C119.97,-31.92 142.29,-26.44 161.88,-21.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.71,-25.04 171.59,-19.26 161.04,-18.24 162.71,-25.04"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/db6/a1z26__cipher_8cpp_a0a78954e96c862430904ee3e64623c38_cgraph_org.svg b/de/db6/a1z26__cipher_8cpp_a0a78954e96c862430904ee3e64623c38_cgraph_org.svg
deleted file mode 100644
index b27ed13d3..000000000
--- a/de/db6/a1z26__cipher_8cpp_a0a78954e96c862430904ee3e64623c38_cgraph_org.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::a1z26::decrypt Pages: 1 -->
-<svg width="278pt" height="101pt"
- viewBox="0.00 0.00 277.75 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>ciphers::a1z26::decrypt</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="a1z26 decryption implementation">
-<polygon fill="#999999" stroke="#666666" points="118,-56.25 0,-56.25 0,-37 118,-37 118,-56.25"/>
-<text text-anchor="middle" x="59" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::a1z26::decrypt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.07,-56.54C24.15,-65.15 32.13,-74.25 59,-74.25 74.12,-74.25 83.25,-71.37 86.41,-67.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="89.8,-66.42 83.4,-57.98 83.14,-68.57 89.8,-66.42"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269.75,-93.25 154,-93.25 154,-74 269.75,-74 269.75,-93.25"/>
-<text text-anchor="middle" x="211.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.23,-56.74C118.94,-61.08 139.85,-66.21 158.63,-70.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.68,-74.18 168.23,-73.17 159.35,-67.39 157.68,-74.18"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/replace.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245.38,-56.25 178.38,-56.25 178.38,-37 245.38,-37 245.38,-56.25"/>
-<text text-anchor="middle" x="211.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::replace</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.33,-46.62C134.46,-46.62 151.68,-46.62 166.84,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.47,-50.13 176.47,-46.63 166.47,-43.13 166.47,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/transform.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="250.25,-19.25 173.5,-19.25 173.5,0 250.25,0 250.25,-19.25"/>
-<text text-anchor="middle" x="211.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::transform</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.23,-36.51C119.97,-31.92 142.29,-26.44 161.88,-21.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.71,-25.04 171.59,-19.26 161.04,-18.24 162.71,-25.04"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/db6/a1z26__cipher_8cpp_a77a6b827a0b9c7aca2d705811459d744_cgraph.map b/de/db6/a1z26__cipher_8cpp_a77a6b827a0b9c7aca2d705811459d744_cgraph.map
deleted file mode 100644
index d066fdd35..000000000
--- a/de/db6/a1z26__cipher_8cpp_a77a6b827a0b9c7aca2d705811459d744_cgraph.map
+++ /dev/null
@@ -1,14 +0,0 @@
-<map id="ciphers::a1z26::encrypt" name="ciphers::a1z26::encrypt">
-<area shape="rect" id="Node000001" title="a1z26 encryption implementation" alt="" coords="5,104,163,130"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="53,105,47,95,50,86,63,80,84,77,106,80,118,86,116,91,105,85,84,83,65,85,54,89,52,95,57,102"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/begin.html#" title=" " alt="" coords="211,5,329,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="104,101,152,72,209,40,219,35,221,40,212,45,154,76,107,106"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/end.html#" title=" " alt="" coords="216,55,324,80"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="135,101,203,82,205,87,136,106"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/replace.html#" title=" " alt="" coords="225,104,314,130"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="163,114,210,114,210,120,163,120"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/to_string.html#" title=" " alt="" coords="221,153,318,179"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="136,128,207,147,206,152,135,133"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/transform.html#" title=" " alt="" coords="219,203,321,228"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="107,128,154,157,212,189,221,194,219,198,209,194,152,162,104,132"/>
-</map>
diff --git a/de/db6/a1z26__cipher_8cpp_a77a6b827a0b9c7aca2d705811459d744_cgraph.md5 b/de/db6/a1z26__cipher_8cpp_a77a6b827a0b9c7aca2d705811459d744_cgraph.md5
deleted file mode 100644
index b43dd65cc..000000000
--- a/de/db6/a1z26__cipher_8cpp_a77a6b827a0b9c7aca2d705811459d744_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-96aa42ab0dd3ec009b5e1c2028588800
\ No newline at end of file
diff --git a/de/db6/a1z26__cipher_8cpp_a77a6b827a0b9c7aca2d705811459d744_cgraph.svg b/de/db6/a1z26__cipher_8cpp_a77a6b827a0b9c7aca2d705811459d744_cgraph.svg
deleted file mode 100644
index 9889b1f30..000000000
--- a/de/db6/a1z26__cipher_8cpp_a77a6b827a0b9c7aca2d705811459d744_cgraph.svg
+++ /dev/null
@@ -1,146 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::a1z26::encrypt Pages: 1 -->
-<svg width="251pt" height="175pt"
- viewBox="0.00 0.00 250.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>ciphers::a1z26::encrypt</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="a1z26 encryption implementation">
-<polygon fill="#999999" stroke="#666666" points="118,-93.25 0,-93.25 0,-74 118,-74 118,-93.25"/>
-<text text-anchor="middle" x="59" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::a1z26::encrypt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.18,-93.54C27.23,-102.15 34.5,-111.25 59,-111.25 72.4,-111.25 80.64,-108.53 83.74,-104.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.13,-103.78 81.2,-95 80.36,-105.56 87.13,-103.78"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242.75,-167.25 154,-167.25 154,-148 242.75,-148 242.75,-167.25"/>
-<text text-anchor="middle" x="198.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.25,-93.64C93.53,-105.43 125.31,-125.22 154,-139.62 156.25,-140.75 158.59,-141.87 160.96,-142.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.46,-146.13 170.03,-146.96 162.28,-139.73 159.46,-146.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="239,-130.25 157.75,-130.25 157.75,-111 239,-111 239,-130.25"/>
-<text text-anchor="middle" x="198.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.54,-93.74C113.44,-98.02 132.17,-103.06 149.08,-107.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.85,-110.91 158.42,-110.13 149.67,-104.15 147.85,-110.91"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/replace.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.88,-93.25 164.88,-93.25 164.88,-74 231.88,-74 231.88,-93.25"/>
-<text text-anchor="middle" x="198.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::replace</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.26,-83.62C129.98,-83.62 142.12,-83.62 153.27,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.95,-87.13 162.95,-83.63 152.95,-80.13 152.95,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.88,-56.25 161.88,-56.25 161.88,-37 234.88,-37 234.88,-56.25"/>
-<text text-anchor="middle" x="198.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::to_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.54,-73.51C113.96,-69.09 133.4,-63.86 150.74,-59.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.57,-62.59 160.31,-56.61 149.75,-55.83 151.57,-62.59"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/transform.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-19.25 160,-19.25 160,0 236.75,0 236.75,-19.25"/>
-<text text-anchor="middle" x="198.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::transform</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.25,-73.61C93.53,-61.82 125.31,-42.03 154,-27.62 156.25,-26.5 158.59,-25.38 160.96,-24.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.28,-27.52 170.03,-20.29 159.46,-21.12 162.28,-27.52"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/db6/a1z26__cipher_8cpp_a77a6b827a0b9c7aca2d705811459d744_cgraph_org.svg b/de/db6/a1z26__cipher_8cpp_a77a6b827a0b9c7aca2d705811459d744_cgraph_org.svg
deleted file mode 100644
index 65a6c43c1..000000000
--- a/de/db6/a1z26__cipher_8cpp_a77a6b827a0b9c7aca2d705811459d744_cgraph_org.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::a1z26::encrypt Pages: 1 -->
-<svg width="251pt" height="175pt"
- viewBox="0.00 0.00 250.75 175.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 171.25)">
-<title>ciphers::a1z26::encrypt</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="a1z26 encryption implementation">
-<polygon fill="#999999" stroke="#666666" points="118,-93.25 0,-93.25 0,-74 118,-74 118,-93.25"/>
-<text text-anchor="middle" x="59" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::a1z26::encrypt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.18,-93.54C27.23,-102.15 34.5,-111.25 59,-111.25 72.4,-111.25 80.64,-108.53 83.74,-104.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.13,-103.78 81.2,-95 80.36,-105.56 87.13,-103.78"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242.75,-167.25 154,-167.25 154,-148 242.75,-148 242.75,-167.25"/>
-<text text-anchor="middle" x="198.38" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.25,-93.64C93.53,-105.43 125.31,-125.22 154,-139.62 156.25,-140.75 158.59,-141.87 160.96,-142.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.46,-146.13 170.03,-146.96 162.28,-139.73 159.46,-146.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="239,-130.25 157.75,-130.25 157.75,-111 239,-111 239,-130.25"/>
-<text text-anchor="middle" x="198.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.54,-93.74C113.44,-98.02 132.17,-103.06 149.08,-107.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.85,-110.91 158.42,-110.13 149.67,-104.15 147.85,-110.91"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/replace.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.88,-93.25 164.88,-93.25 164.88,-74 231.88,-74 231.88,-93.25"/>
-<text text-anchor="middle" x="198.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::replace</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.26,-83.62C129.98,-83.62 142.12,-83.62 153.27,-83.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.95,-87.13 162.95,-83.63 152.95,-80.13 152.95,-87.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="234.88,-56.25 161.88,-56.25 161.88,-37 234.88,-37 234.88,-56.25"/>
-<text text-anchor="middle" x="198.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::to_string</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.54,-73.51C113.96,-69.09 133.4,-63.86 150.74,-59.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="151.57,-62.59 160.31,-56.61 149.75,-55.83 151.57,-62.59"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/transform.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-19.25 160,-19.25 160,0 236.75,0 236.75,-19.25"/>
-<text text-anchor="middle" x="198.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::transform</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M75.25,-73.61C93.53,-61.82 125.31,-42.03 154,-27.62 156.25,-26.5 158.59,-25.38 160.96,-24.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="162.28,-27.52 170.03,-20.29 159.46,-21.12 162.28,-27.52"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/db6/a1z26__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/de/db6/a1z26__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index e85e01374..000000000
--- a/de/db6/a1z26__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/de/db6/a1z26__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/de/db6/a1z26__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 5901bc148..000000000
--- a/de/db6/a1z26__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-729fb887ee50b6291b0542ba0592a5c7
\ No newline at end of file
diff --git a/de/db6/a1z26__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/de/db6/a1z26__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 2e04695b9..000000000
--- a/de/db6/a1z26__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/db6/a1z26__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/de/db6/a1z26__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1813bd719..000000000
--- a/de/db6/a1z26__cipher_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/db6/a1z26__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/db6/a1z26__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 6a0557c92..000000000
--- a/de/db6/a1z26__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/de/db6/a1z26__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/db6/a1z26__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 91199a7fd..000000000
--- a/de/db6/a1z26__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0075598350b71bc6da1b4465ab81d84d
\ No newline at end of file
diff --git a/de/db6/a1z26__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/db6/a1z26__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 1e16d0d4b..000000000
--- a/de/db6/a1z26__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/db6/a1z26__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/db6/a1z26__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 58600e02f..000000000
--- a/de/db6/a1z26__cipher_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/db6/a1z26__cipher_8cpp_source.html b/de/db6/a1z26__cipher_8cpp_source.html
new file mode 100644
index 000000000..715afd986
--- /dev/null
+++ b/de/db6/a1z26__cipher_8cpp_source.html
@@ -0,0 +1,274 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: ciphers/a1z26_cipher.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/db6/a1z26__cipher_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">a1z26_cipher.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/db6/a1z26__cipher_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cstdint&gt;</span>    </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;map&gt;</span>        </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;sstream&gt;</span>    </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;string&gt;</span>     </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/d4e/namespaceciphers.html">ciphers</a> {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d8/d2a/namespacea1z26.html">a1z26</a> {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>std::map&lt;uint8_t, char&gt; a1z26_decrypt_map = {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    {1, <span class="charliteral">&#39;a&#39;</span>},  {2, <span class="charliteral">&#39;b&#39;</span>},  {3, <span class="charliteral">&#39;c&#39;</span>},  {4, <span class="charliteral">&#39;d&#39;</span>},  {5, <span class="charliteral">&#39;e&#39;</span>},  {6, <span class="charliteral">&#39;f&#39;</span>},  {7, <span class="charliteral">&#39;g&#39;</span>},</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    {8, <span class="charliteral">&#39;h&#39;</span>},  {9, <span class="charliteral">&#39;i&#39;</span>},  {10, <span class="charliteral">&#39;j&#39;</span>}, {11, <span class="charliteral">&#39;k&#39;</span>}, {12, <span class="charliteral">&#39;l&#39;</span>}, {13, <span class="charliteral">&#39;m&#39;</span>}, {14, <span class="charliteral">&#39;n&#39;</span>},</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    {15, <span class="charliteral">&#39;o&#39;</span>}, {16, <span class="charliteral">&#39;p&#39;</span>}, {17, <span class="charliteral">&#39;q&#39;</span>}, {18, <span class="charliteral">&#39;r&#39;</span>}, {19, <span class="charliteral">&#39;s&#39;</span>}, {20, <span class="charliteral">&#39;t&#39;</span>}, {21, <span class="charliteral">&#39;u&#39;</span>},</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    {22, <span class="charliteral">&#39;v&#39;</span>}, {23, <span class="charliteral">&#39;w&#39;</span>}, {24, <span class="charliteral">&#39;x&#39;</span>}, {25, <span class="charliteral">&#39;y&#39;</span>}, {26, <span class="charliteral">&#39;z&#39;</span>},</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>};</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>std::map&lt;char, uint8_t&gt; a1z26_encrypt_map = {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    {<span class="charliteral">&#39;a&#39;</span>, 1},  {<span class="charliteral">&#39;b&#39;</span>, 2},  {<span class="charliteral">&#39;c&#39;</span>, 3},  {<span class="charliteral">&#39;d&#39;</span>, 4},  {<span class="charliteral">&#39;e&#39;</span>, 5},  {<span class="charliteral">&#39;f&#39;</span>, 6},  {<span class="charliteral">&#39;g&#39;</span>, 7},</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    {<span class="charliteral">&#39;h&#39;</span>, 8},  {<span class="charliteral">&#39;i&#39;</span>, 9},  {<span class="charliteral">&#39;j&#39;</span>, 10}, {<span class="charliteral">&#39;k&#39;</span>, 11}, {<span class="charliteral">&#39;l&#39;</span>, 12}, {<span class="charliteral">&#39;m&#39;</span>, 13}, {<span class="charliteral">&#39;n&#39;</span>, 14},</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    {<span class="charliteral">&#39;o&#39;</span>, 15}, {<span class="charliteral">&#39;p&#39;</span>, 16}, {<span class="charliteral">&#39;q&#39;</span>, 17}, {<span class="charliteral">&#39;r&#39;</span>, 18}, {<span class="charliteral">&#39;s&#39;</span>, 19}, {<span class="charliteral">&#39;t&#39;</span>, 20}, {<span class="charliteral">&#39;u&#39;</span>, 21},</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    {<span class="charliteral">&#39;v&#39;</span>, 22}, {<span class="charliteral">&#39;w&#39;</span>, 23}, {<span class="charliteral">&#39;x&#39;</span>, 24}, {<span class="charliteral">&#39;y&#39;</span>, 25}, {<span class="charliteral">&#39;z&#39;</span>, 26}};</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="foldopen" id="foldopen00051" data-start="{" data-end="}">
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="../../de/db6/a1z26__cipher_8cpp.html#a77a6b827a0b9c7aca2d705811459d744">   51</a></span>std::string <a class="code hl_function" href="../../de/db6/a1z26__cipher_8cpp.html#a77a6b827a0b9c7aca2d705811459d744">encrypt</a>(std::string text) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    std::string result;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    std::transform(text.begin(), text.end(), text.begin(),</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>                   ::tolower);  <span class="comment">// convert string to lowercase</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    std::replace(text.begin(), text.end(), <span class="charliteral">&#39;:&#39;</span>, <span class="charliteral">&#39; &#39;</span>);</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">for</span> (<span class="keywordtype">char</span> letter : text) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        <span class="keywordflow">if</span> (letter != <span class="charliteral">&#39; &#39;</span>) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>            result += std::to_string(</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>                a1z26_encrypt_map[letter]);  <span class="comment">// convert int to string and append</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>                                             <span class="comment">// to result</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            result += <span class="stringliteral">&quot;-&quot;</span>;  <span class="comment">// space out each set of numbers with spaces</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            result.pop_back();</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            result += <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    result.pop_back();  <span class="comment">// remove leading dash</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>}</div>
+</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="foldopen" id="foldopen00078" data-start="{" data-end="}">
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"><a class="line" href="../../de/db6/a1z26__cipher_8cpp.html#a0a78954e96c862430904ee3e64623c38">   78</a></span>std::string <a class="code hl_function" href="../../de/db6/a1z26__cipher_8cpp.html#a0a78954e96c862430904ee3e64623c38">decrypt</a>(<span class="keyword">const</span> std::string&amp; text, <span class="keywordtype">bool</span> bReturnUppercase = <span class="keyword">false</span>) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    std::string result;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="comment">// split words seperated by spaces into a vector array</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    std::vector&lt;std::string&gt; word_array;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    std::stringstream sstream(text);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::string word;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keywordflow">while</span> (sstream &gt;&gt; word) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        word_array.push_back(word);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; i : word_array) {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        std::replace(i.begin(), i.end(), <span class="charliteral">&#39;-&#39;</span>, <span class="charliteral">&#39; &#39;</span>);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        std::vector&lt;std::string&gt; text_array;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>        std::stringstream ss(i);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        std::string res_text;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        <span class="keywordflow">while</span> (ss &gt;&gt; res_text) {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>            text_array.push_back(res_text);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>        }</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span> </div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; i : text_array) {</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>            result += a1z26_decrypt_map[stoi(i)];</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        }</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        result += <span class="charliteral">&#39; &#39;</span>;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    }</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    result.pop_back();  <span class="comment">// remove any leading whitespace</span></div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <span class="keywordflow">if</span> (bReturnUppercase) {</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        std::transform(result.begin(), result.end(), result.begin(), ::toupper);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    }</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>}</div>
+</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span> </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>}  <span class="comment">// namespace a1z26</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>}  <span class="comment">// namespace ciphers</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="foldopen" id="foldopen00120" data-start="{" data-end="}">
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"><a class="line" href="../../de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  120</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="comment">// 1st test</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    std::string input = <span class="stringliteral">&quot;Hello World&quot;</span>;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    std::string expected = <span class="stringliteral">&quot;8-5-12-12-15 23-15-18-12-4&quot;</span>;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    std::string output = ciphers::a1z26::encrypt(input);</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input: &quot;</span> &lt;&lt; input &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected: &quot;</span> &lt;&lt; expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; output &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    assert(output == expected);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span>;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="comment">// 2nd test</span></div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    input = <span class="stringliteral">&quot;12-15-23-5-18-3-1-19-5&quot;</span>;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    expected = <span class="stringliteral">&quot;lowercase&quot;</span>;</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    output = ciphers::a1z26::decrypt(input);</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span> </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input: &quot;</span> &lt;&lt; input &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected: &quot;</span> &lt;&lt; expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; output &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    assert(output == expected);</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span>;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span> </div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <span class="comment">// 3rd test</span></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    input = <span class="stringliteral">&quot;21-16-16-5-18-3-1-19-5&quot;</span>;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    expected = <span class="stringliteral">&quot;UPPERCASE&quot;</span>;</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    output = ciphers::a1z26::decrypt(input, <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span> </div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Input: &quot;</span> &lt;&lt; input &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected: &quot;</span> &lt;&lt; expected &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Output: &quot;</span> &lt;&lt; output &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    assert(output == expected);</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED&quot;</span>;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>}</div>
+</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span> </div>
+<div class="foldopen" id="foldopen00159" data-start="{" data-end="}">
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"><a class="line" href="../../de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  159</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    <a class="code hl_function" href="../../de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>}</div>
+</div>
+<div class="ttc" id="aa1z26__cipher_8cpp_html_a0a78954e96c862430904ee3e64623c38"><div class="ttname"><a href="../../de/db6/a1z26__cipher_8cpp.html#a0a78954e96c862430904ee3e64623c38">ciphers::a1z26::decrypt</a></div><div class="ttdeci">std::string decrypt(const std::string &amp;text, bool bReturnUppercase=false)</div><div class="ttdoc">a1z26 decryption implementation</div><div class="ttdef"><b>Definition</b> <a href="#l00078">a1z26_cipher.cpp:78</a></div></div>
+<div class="ttc" id="aa1z26__cipher_8cpp_html_a77a6b827a0b9c7aca2d705811459d744"><div class="ttname"><a href="../../de/db6/a1z26__cipher_8cpp.html#a77a6b827a0b9c7aca2d705811459d744">ciphers::a1z26::encrypt</a></div><div class="ttdeci">std::string encrypt(std::string text)</div><div class="ttdoc">a1z26 encryption implementation</div><div class="ttdef"><b>Definition</b> <a href="#l00051">a1z26_cipher.cpp:51</a></div></div>
+<div class="ttc" id="aa1z26__cipher_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../de/db6/a1z26__cipher_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> <a href="#l00120">a1z26_cipher.cpp:120</a></div></div>
+<div class="ttc" id="aa1z26__cipher_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00159">a1z26_cipher.cpp:159</a></div></div>
+<div class="ttc" id="anamespacea1z26_html"><div class="ttname"><a href="../../d8/d2a/namespacea1z26.html">a1z26</a></div><div class="ttdoc">Functions for A1Z26 encryption and decryption implementation.</div></div>
+<div class="ttc" id="anamespaceciphers_html"><div class="ttname"><a href="../../d6/d4e/namespaceciphers.html">ciphers</a></div><div class="ttdoc">Algorithms for encryption and decryption.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_4d6e05837bf820fb089a8a8cdf2f42b7.html">ciphers</a></li><li class="navelem"><a class="el" href="../../de/db6/a1z26__cipher_8cpp.html">a1z26_cipher.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/dc3/binaryheap_8cpp.html b/de/dc3/binaryheap_8cpp.html
index a73d6ea26..40089af21 100644
--- a/de/dc3/binaryheap_8cpp.html
+++ b/de/dc3/binaryheap_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/binaryheap.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/binaryheap.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for binaryheap.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/dd1/binaryheap_8cpp__incl.svg" width="242" height="111"><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">
+</div>
+<p><a href="../../de/dc3/binaryheap_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d05/class_min_heap.html">MinHeap</a></td></tr>
@@ -134,6 +153,8 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A C++ program to demonstrate common Binary Heap Operations. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html">binaryheap.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -149,6 +170,8 @@ Functions</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html#l00128">128</a> of file <a class="el" href="../../de/dc3/binaryheap_8cpp_source.html">binaryheap.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  128</span>           {</div>
 <div class="line"><span class="lineno">  129</span>    <a class="code hl_class" href="../../d2/d05/class_min_heap.html">MinHeap</a> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>(11);</div>
 <div class="line"><span class="lineno">  130</span>    <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.insertKey(3);</div>
@@ -158,15 +181,14 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  134</span>    <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.insertKey(5);</div>
 <div class="line"><span class="lineno">  135</span>    <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.insertKey(4);</div>
 <div class="line"><span class="lineno">  136</span>    <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.insertKey(45);</div>
-<div class="line"><span class="lineno">  137</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.extractMin() &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
-<div class="line"><span class="lineno">  138</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.getMin() &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  137</span>    std::cout &lt;&lt; <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.extractMin() &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">  138</span>    std::cout &lt;&lt; <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.getMin() &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">  139</span>    <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.decreaseKey(2, 1);</div>
-<div class="line"><span class="lineno">  140</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.getMin();</div>
+<div class="line"><span class="lineno">  140</span>    std::cout &lt;&lt; <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.getMin();</div>
 <div class="line"><span class="lineno">  141</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  142</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="aclass_min_heap_html"><div class="ttname"><a href="../../d2/d05/class_min_heap.html">MinHeap</a></div><div class="ttdef"><b>Definition</b> binaryheap.cpp:10</div></div>
-<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> hash_search.cpp:45</div></div>
+<div class="ttc" id="aclass_min_heap_html"><div class="ttname"><a href="../../d2/d05/class_min_heap.html">MinHeap</a></div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/binaryheap_8cpp_source.html#l00010">binaryheap.cpp:10</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00045">hash_search.cpp:45</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/de/dc3/binaryheap_8cpp_source.html b/de/dc3/binaryheap_8cpp_source.html
new file mode 100644
index 000000000..1de9eddf8
--- /dev/null
+++ b/de/dc3/binaryheap_8cpp_source.html
@@ -0,0 +1,284 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/binaryheap.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/dc3/binaryheap_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">binaryheap.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/dc3/binaryheap_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &lt;climits&gt;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;utility&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="foldopen" id="foldopen00010" data-start="{" data-end="};">
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"><a class="line" href="../../d2/d05/class_min_heap.html">   10</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d2/d05/class_min_heap.html">MinHeap</a> {</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"><a class="line" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">   11</a></span>    <span class="keywordtype">int</span> *<a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>;      </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"><a class="line" href="../../d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02">   12</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02">capacity</a>;   </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"><a class="line" href="../../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913">   13</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913">heap_size</a>;  </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00019" data-start="{" data-end="}">
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"><a class="line" href="../../d2/d05/class_min_heap.html#a078cb888e642bb1f95dd0e03f0a35820">   19</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../d2/d05/class_min_heap.html#a078cb888e642bb1f95dd0e03f0a35820">MinHeap</a>(<span class="keywordtype">int</span> cap) {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913">heap_size</a> = 0;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02">capacity</a> = cap;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a> = <span class="keyword">new</span> <span class="keywordtype">int</span>[cap];</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    }</div>
+</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad">MinHeapify</a>(<span class="keywordtype">int</span>);</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="keywordtype">int</span> parent(<span class="keywordtype">int</span> i) { <span class="keywordflow">return</span> (i - 1) / 2; }</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="../../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca">   31</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca">left</a>(<span class="keywordtype">int</span> i) { <span class="keywordflow">return</span> (2 * i + 1); }</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e">   34</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e">right</a>(<span class="keywordtype">int</span> i) { <span class="keywordflow">return</span> (2 * i + 2); }</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980">extractMin</a>();</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5">decreaseKey</a>(<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> new_val);</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="../../d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130">   43</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130">getMin</a>() { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[0]; }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d05/class_min_heap.html#a37ac126eabb0c3ce04047172abccca29">deleteKey</a>(<span class="keywordtype">int</span> i);</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82">insertKey</a>(<span class="keywordtype">int</span> k);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <a class="code hl_class" href="../../d2/d05/class_min_heap.html">~MinHeap</a>() { <span class="keyword">delete</span>[] <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>; }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>};</div>
+</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="comment">// Inserts a new key &#39;k&#39;</span></div>
+<div class="foldopen" id="foldopen00055" data-start="{" data-end="}">
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82">   55</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82">MinHeap::insertKey</a>(<span class="keywordtype">int</span> k) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913">heap_size</a> == <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02">capacity</a>) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nOverflow: Could not insertKey\n&quot;</span>;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    }</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="comment">// First insert the new key at the end</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913">heap_size</a>++;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordtype">int</span> i = <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913">heap_size</a> - 1;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[i] = k;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="comment">// Fix the min heap property if it is violated</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">while</span> (i != 0 &amp;&amp; <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[parent(i)] &gt; <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[i]) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        std::swap(<a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[i], <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[parent(i)]);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        i = parent(i);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    }</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>}</div>
+</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="foldopen" id="foldopen00076" data-start="{" data-end="}">
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"><a class="line" href="../../d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5">   76</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5">MinHeap::decreaseKey</a>(<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> new_val) {</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[i] = new_val;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordflow">while</span> (i != 0 &amp;&amp; <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[parent(i)] &gt; <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[i]) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        std::swap(<a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[i], <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[parent(i)]);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        i = parent(i);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    }</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>}</div>
+</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span><span class="comment">// Method to remove minimum element (or root) from min heap</span></div>
+<div class="foldopen" id="foldopen00085" data-start="{" data-end="}">
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"><a class="line" href="../../d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980">   85</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980">MinHeap::extractMin</a>() {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913">heap_size</a> &lt;= 0)</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        <span class="keywordflow">return</span> INT_MAX;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913">heap_size</a> == 1) {</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913">heap_size</a>--;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[0];</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    }</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="comment">// Store the minimum value, and remove it from heap</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keywordtype">int</span> root = <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[0];</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[0] = <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[<a class="code hl_variable" href="../../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913">heap_size</a> - 1];</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913">heap_size</a>--;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <a class="code hl_function" href="../../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad">MinHeapify</a>(0);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span> </div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <span class="keywordflow">return</span> root;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>}</div>
+</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span> </div>
+<div class="foldopen" id="foldopen00105" data-start="{" data-end="}">
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"><a class="line" href="../../d2/d05/class_min_heap.html#a37ac126eabb0c3ce04047172abccca29">  105</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d05/class_min_heap.html#a37ac126eabb0c3ce04047172abccca29">MinHeap::deleteKey</a>(<span class="keywordtype">int</span> i) {</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    <a class="code hl_function" href="../../d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5">decreaseKey</a>(i, INT_MIN);</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    <a class="code hl_function" href="../../d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980">extractMin</a>();</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>}</div>
+</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="foldopen" id="foldopen00113" data-start="{" data-end="}">
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"><a class="line" href="../../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad">  113</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad">MinHeap::MinHeapify</a>(<span class="keywordtype">int</span> i) {</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="keywordtype">int</span> l = <a class="code hl_function" href="../../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca">left</a>(i);</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <span class="keywordtype">int</span> r = <a class="code hl_function" href="../../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e">right</a>(i);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <span class="keywordtype">int</span> smallest = i;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="keywordflow">if</span> (l &lt; <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913">heap_size</a> &amp;&amp; <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[l] &lt; <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[i])</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        smallest = l;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <span class="keywordflow">if</span> (r &lt; <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913">heap_size</a> &amp;&amp; <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[r] &lt; <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[smallest])</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        smallest = r;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    <span class="keywordflow">if</span> (smallest != i) {</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        std::swap(<a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[i], <a class="code hl_variable" href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">harr</a>[smallest]);</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        <a class="code hl_function" href="../../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad">MinHeapify</a>(smallest);</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    }</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>}</div>
+</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span> </div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span><span class="comment">// Driver program to test above functions</span></div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    <a class="code hl_class" href="../../d2/d05/class_min_heap.html">MinHeap</a> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>(11);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.insertKey(3);</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.insertKey(2);</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.deleteKey(1);</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.insertKey(15);</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.insertKey(5);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.insertKey(4);</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.insertKey(45);</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    std::cout &lt;&lt; <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.extractMin() &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    std::cout &lt;&lt; <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.getMin() &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.decreaseKey(2, 1);</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    std::cout &lt;&lt; <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>.getMin();</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>}</div>
+<div class="ttc" id="aclass_min_heap_html"><div class="ttname"><a href="../../d2/d05/class_min_heap.html">MinHeap</a></div><div class="ttdef"><b>Definition</b> <a href="#l00010">binaryheap.cpp:10</a></div></div>
+<div class="ttc" id="aclass_min_heap_html_a078cb888e642bb1f95dd0e03f0a35820"><div class="ttname"><a href="../../d2/d05/class_min_heap.html#a078cb888e642bb1f95dd0e03f0a35820">MinHeap::MinHeap</a></div><div class="ttdeci">MinHeap(int cap)</div><div class="ttdef"><b>Definition</b> <a href="#l00019">binaryheap.cpp:19</a></div></div>
+<div class="ttc" id="aclass_min_heap_html_a336ac71f0d857269fe9a98058a3cd130"><div class="ttname"><a href="../../d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130">MinHeap::getMin</a></div><div class="ttdeci">int getMin()</div><div class="ttdef"><b>Definition</b> <a href="#l00043">binaryheap.cpp:43</a></div></div>
+<div class="ttc" id="aclass_min_heap_html_a34a93a87967308eb516328c0aca3c48e"><div class="ttname"><a href="../../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e">MinHeap::harr</a></div><div class="ttdeci">int * harr</div><div class="ttdoc">pointer to array of elements in heap</div><div class="ttdef"><b>Definition</b> <a href="#l00011">binaryheap.cpp:11</a></div></div>
+<div class="ttc" id="aclass_min_heap_html_a37ac126eabb0c3ce04047172abccca29"><div class="ttname"><a href="../../d2/d05/class_min_heap.html#a37ac126eabb0c3ce04047172abccca29">MinHeap::deleteKey</a></div><div class="ttdeci">void deleteKey(int i)</div><div class="ttdef"><b>Definition</b> <a href="#l00105">binaryheap.cpp:105</a></div></div>
+<div class="ttc" id="aclass_min_heap_html_a4014f1edaed0bd7db0c0d2ca53228980"><div class="ttname"><a href="../../d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980">MinHeap::extractMin</a></div><div class="ttdeci">int extractMin()</div><div class="ttdef"><b>Definition</b> <a href="#l00085">binaryheap.cpp:85</a></div></div>
+<div class="ttc" id="aclass_min_heap_html_a88b4aa3e66392a3eabbf2517a9a79a02"><div class="ttname"><a href="../../d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02">MinHeap::capacity</a></div><div class="ttdeci">int capacity</div><div class="ttdoc">maximum possible size of min heap</div><div class="ttdef"><b>Definition</b> <a href="#l00012">binaryheap.cpp:12</a></div></div>
+<div class="ttc" id="aclass_min_heap_html_aa7f726cc6327955d22871592227432f5"><div class="ttname"><a href="../../d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5">MinHeap::decreaseKey</a></div><div class="ttdeci">void decreaseKey(int i, int new_val)</div><div class="ttdef"><b>Definition</b> <a href="#l00076">binaryheap.cpp:76</a></div></div>
+<div class="ttc" id="aclass_min_heap_html_aa8c6c141e3de664819686aa637e1afca"><div class="ttname"><a href="../../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca">MinHeap::left</a></div><div class="ttdeci">int left(int i)</div><div class="ttdef"><b>Definition</b> <a href="#l00031">binaryheap.cpp:31</a></div></div>
+<div class="ttc" id="aclass_min_heap_html_aaef438c1056492cb62c4a4d9035b5cad"><div class="ttname"><a href="../../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad">MinHeap::MinHeapify</a></div><div class="ttdeci">void MinHeapify(int)</div><div class="ttdef"><b>Definition</b> <a href="#l00113">binaryheap.cpp:113</a></div></div>
+<div class="ttc" id="aclass_min_heap_html_ac760b85cf90265b8d674b942a43fb70e"><div class="ttname"><a href="../../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e">MinHeap::right</a></div><div class="ttdeci">int right(int i)</div><div class="ttdef"><b>Definition</b> <a href="#l00034">binaryheap.cpp:34</a></div></div>
+<div class="ttc" id="aclass_min_heap_html_ae4d358bf063bb196a1945b3fb99b4913"><div class="ttname"><a href="../../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913">MinHeap::heap_size</a></div><div class="ttdeci">int heap_size</div><div class="ttdoc">Current number of elements in min heap.</div><div class="ttdef"><b>Definition</b> <a href="#l00013">binaryheap.cpp:13</a></div></div>
+<div class="ttc" id="aclass_min_heap_html_aef78f3384f5a0ae880ad0883d2d44b82"><div class="ttname"><a href="../../d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82">MinHeap::insertKey</a></div><div class="ttdeci">void insertKey(int k)</div><div class="ttdef"><b>Definition</b> <a href="#l00055">binaryheap.cpp:55</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00045">hash_search.cpp:45</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../de/dc3/binaryheap_8cpp.html">binaryheap.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/dc3/fibonacci__sum_8cpp.html b/de/dc3/fibonacci__sum_8cpp.html
index 8350b4b52..a46fcb17c 100644
--- a/de/dc3/fibonacci__sum_8cpp.html
+++ b/de/dc3/fibonacci__sum_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/fibonacci_sum.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/fibonacci_sum.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for fibonacci_sum.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d4a/fibonacci__sum_8cpp__incl.svg" width="336" height="111"><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">
+</div>
+<p><a href="../../de/dc3/fibonacci__sum_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -137,15 +156,14 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="typedef-members" name="typedef-members"></a>
 Typedefs</h2></td></tr>
-<tr class="memitem:a658ced3b6267216e49bb1bd4f9a76a54" id="r_a658ced3b6267216e49bb1bd4f9a76a54"><td class="memItemLeft" align="right" valign="top"><a id="a658ced3b6267216e49bb1bd4f9a76a54" name="a658ced3b6267216e49bb1bd4f9a76a54"></a>
-using&#160;</td><td class="memItemRight" valign="bottom"><b>math::fibonacci_sum::matrix</b> = <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt;uint64_t&gt; &gt;</td></tr>
+<tr class="memitem:a658ced3b6267216e49bb1bd4f9a76a54" id="r_a658ced3b6267216e49bb1bd4f9a76a54"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a658ced3b6267216e49bb1bd4f9a76a54">math::fibonacci_sum::matrix</a> = std::vector&lt;std::vector&lt;uint64_t&gt; &gt;</td></tr>
 <tr class="separator:a658ced3b6267216e49bb1bd4f9a76a54"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a9c83cca09a3e4ff2a25c816a9303448e" id="r_a9c83cca09a3e4ff2a25c816a9303448e"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">math::fibonacci_sum::matrix</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9c83cca09a3e4ff2a25c816a9303448e">math::fibonacci_sum::multiply</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">math::fibonacci_sum::matrix</a> &amp;T, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">math::fibonacci_sum::matrix</a> &amp;A)</td></tr>
+<tr class="memitem:a9c83cca09a3e4ff2a25c816a9303448e" id="r_a9c83cca09a3e4ff2a25c816a9303448e"><td class="memItemLeft" align="right" valign="top">math::fibonacci_sum::matrix&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9c83cca09a3e4ff2a25c816a9303448e">math::fibonacci_sum::multiply</a> (const math::fibonacci_sum::matrix &amp;T, const math::fibonacci_sum::matrix &amp;A)</td></tr>
 <tr class="separator:a9c83cca09a3e4ff2a25c816a9303448e"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a7cf5feaf168b88e74544da59ed830311" id="r_a7cf5feaf168b88e74544da59ed830311"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">math::fibonacci_sum::matrix</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7cf5feaf168b88e74544da59ed830311">math::fibonacci_sum::power</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">math::fibonacci_sum::matrix</a> T, uint64_t ex)</td></tr>
+<tr class="memitem:a7cf5feaf168b88e74544da59ed830311" id="r_a7cf5feaf168b88e74544da59ed830311"><td class="memItemLeft" align="right" valign="top">math::fibonacci_sum::matrix&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7cf5feaf168b88e74544da59ed830311">math::fibonacci_sum::power</a> (math::fibonacci_sum::matrix T, uint64_t ex)</td></tr>
 <tr class="separator:a7cf5feaf168b88e74544da59ed830311"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aadb40ac4c74a7efc0680b83eeee138aa" id="r_aadb40ac4c74a7efc0680b83eeee138aa"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a> (uint64_t n)</td></tr>
 <tr class="separator:aadb40ac4c74a7efc0680b83eeee138aa"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -161,7 +179,26 @@ Functions</h2></td></tr>
 <div class="textblock"><p>An algorithm to calculate the sum of <a href="https://en.wikipedia.org/wiki/Fibonacci_number" target="_blank">Fibonacci Sequence</a>:  \(\mathrm{F}(n) +
 \mathrm{F}(n+1) + .. + \mathrm{F}(m)\). </p>
 <p>An algorithm to calculate the sum of Fibonacci Sequence: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\) where \(\mathrm{F}(i)\) denotes the i-th Fibonacci Number . Note that F(0) = 0 and F(1) = 1. The value of the sum is calculated using matrix exponentiation. Reference source: <a href="https://stackoverflow.com/questions/4357223/finding-the-sum-of-fibonacci-numbers">https://stackoverflow.com/questions/4357223/finding-the-sum-of-fibonacci-numbers</a> </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/SarthakSahu1009" target="_blank">Sarthak Sahu</a> </dd></dl>
-</div><h2 class="groupheader">Function Documentation</h2>
+
+<p class="definition">Definition in file <a class="el" href="../../de/dc3/fibonacci__sum_8cpp_source.html">fibonacci_sum.cpp</a>.</p>
+</div><h2 class="groupheader">Typedef Documentation</h2>
+<a id="a658ced3b6267216e49bb1bd4f9a76a54" name="a658ced3b6267216e49bb1bd4f9a76a54"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a658ced3b6267216e49bb1bd4f9a76a54">&#9670;&#160;</a></span>matrix</h2>
+
+<div class="memitem">
+<div class="memproto">
+      <table class="memname">
+        <tr>
+          <td class="memname">using math::fibonacci_sum::matrix = std::vector&lt;std::vector&lt;uint64_t&gt; &gt;</td>
+        </tr>
+      </table>
+</div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../de/dc3/fibonacci__sum_8cpp_source.html">fibonacci_sum.cpp</a>.</p>
+
+</div>
+</div>
+<h2 class="groupheader">Function Documentation</h2>
 <a id="a493fbaa7a94e3b7ca573111237bb3742" name="a493fbaa7a94e3b7ca573111237bb3742"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a493fbaa7a94e3b7ca573111237bb3742">&#9670;&#160;</a></span>fiboSum()</h2>
 
@@ -188,16 +225,13 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>uint64_t the sum of sequence </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00091">91</a> of file <a class="el" href="../../de/dc3/fibonacci__sum_8cpp_source.html">fibonacci_sum.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   91</span>                                         {</div>
 <div class="line"><span class="lineno">   92</span>    <span class="keywordflow">return</span> (<a class="code hl_function" href="#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(m + 2) - <a class="code hl_function" href="#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(n + 1));</div>
 <div class="line"><span class="lineno">   93</span>}</div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dc3/fibonacci__sum_8cpp_a493fbaa7a94e3b7ca573111237bb3742_cgraph.svg" width="534" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -217,17 +251,14 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00137">137</a> of file <a class="el" href="../../de/dc3/fibonacci__sum_8cpp_source.html">fibonacci_sum.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  137</span>           {</div>
 <div class="line"><span class="lineno">  138</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the tests</span></div>
 <div class="line"><span class="lineno">  139</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  140</span>}</div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:102</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../de/dc3/fibonacci__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="afibonacci__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00102">fibonacci_sum.cpp:102</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a9c83cca09a3e4ff2a25c816a9303448e" name="a9c83cca09a3e4ff2a25c816a9303448e"></a>
@@ -237,14 +268,14 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">math::fibonacci_sum::matrix</a> math::fibonacci_sum::multiply </td>
+          <td class="memname">math::fibonacci_sum::matrix math::fibonacci_sum::multiply </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">math::fibonacci_sum::matrix</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>T</em></span>, </td>
+          <td class="paramtype">const math::fibonacci_sum::matrix &amp;</td>          <td class="paramname"><span class="paramname"><em>T</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">math::fibonacci_sum::matrix</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>&#160;)</td>
+          <td class="paramtype">const math::fibonacci_sum::matrix &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -256,8 +287,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>resultant matrix </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../de/dc3/fibonacci__sum_8cpp_source.html">fibonacci_sum.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   40</span>                                                                       {</div>
-<div class="line"><span class="lineno">   41</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">math::fibonacci_sum::matrix</a> <a class="code hl_function" href="#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(2, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a>(2, 0));</div>
+<div class="line"><span class="lineno">   41</span>    math::fibonacci_sum::matrix <a class="code hl_function" href="#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(2, std::vector&lt;uint64_t&gt;(2, 0));</div>
 <div class="line"><span class="lineno">   42</span> </div>
 <div class="line"><span class="lineno">   43</span>    <span class="comment">// multiplying matrices</span></div>
 <div class="line"><span class="lineno">   44</span>    <a class="code hl_function" href="#aadb40ac4c74a7efc0680b83eeee138aa">result</a>[0][0] = T[0][0] * A[0][0] + T[0][1] * A[1][0];</div>
@@ -267,13 +300,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   48</span> </div>
 <div class="line"><span class="lineno">   49</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   50</span>}</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dc3/fibonacci__sum_8cpp_a9c83cca09a3e4ff2a25c816a9303448e_cgraph.svg" width="534" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7cf5feaf168b88e74544da59ed830311" name="a7cf5feaf168b88e74544da59ed830311"></a>
@@ -283,9 +310,9 @@ Here is the call graph for this function:</div>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">math::fibonacci_sum::matrix</a> math::fibonacci_sum::power </td>
+          <td class="memname">math::fibonacci_sum::matrix math::fibonacci_sum::power </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">math::fibonacci_sum::matrix</a></td>          <td class="paramname"><span class="paramname"><em>T</em></span>, </td>
+          <td class="paramtype">math::fibonacci_sum::matrix</td>          <td class="paramname"><span class="paramname"><em>T</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -302,8 +329,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>resultant matrix </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../de/dc3/fibonacci__sum_8cpp_source.html">fibonacci_sum.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   58</span>                                                                      {</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">math::fibonacci_sum::matrix</a> A{{1, 1}, {1, 0}};</div>
+<div class="line"><span class="lineno">   59</span>    math::fibonacci_sum::matrix A{{1, 1}, {1, 0}};</div>
 <div class="line"><span class="lineno">   60</span>    <span class="keywordflow">if</span> (ex == 0 || ex == 1) {</div>
 <div class="line"><span class="lineno">   61</span>        <span class="keywordflow">return</span> T;</div>
 <div class="line"><span class="lineno">   62</span>    }</div>
@@ -315,14 +344,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   68</span>    }</div>
 <div class="line"><span class="lineno">   69</span>    <span class="keywordflow">return</span> T;</div>
 <div class="line"><span class="lineno">   70</span>}</div>
-<div class="ttc" id="apower__for__huge__numbers_8cpp_html_aa141a7904f0c4668bac112d652a3acf9"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">multiply</a></div><div class="ttdeci">int multiply(int x, int res[], int res_size)</div><div class="ttdef"><b>Definition</b> power_for_huge_numbers.cpp:25</div></div>
-<div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae249a2af508aa94266023ce8aa81426f"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a></div><div class="ttdeci">void power(int x, int n)</div><div class="ttdef"><b>Definition</b> power_for_huge_numbers.cpp:56</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dc3/fibonacci__sum_8cpp_a7cf5feaf168b88e74544da59ed830311_cgraph.svg" width="154" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="apower__for__huge__numbers_8cpp_html_aa141a7904f0c4668bac112d652a3acf9"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">multiply</a></div><div class="ttdeci">int multiply(int x, int res[], int res_size)</div><div class="ttdef"><b>Definition</b> <a href="../../df/def/power__for__huge__numbers_8cpp_source.html#l00025">power_for_huge_numbers.cpp:25</a></div></div>
+<div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae249a2af508aa94266023ce8aa81426f"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a></div><div class="ttdeci">void power(int x, int n)</div><div class="ttdef"><b>Definition</b> <a href="../../df/def/power__for__huge__numbers_8cpp_source.html#l00056">power_for_huge_numbers.cpp:56</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aadb40ac4c74a7efc0680b83eeee138aa" name="aadb40ac4c74a7efc0680b83eeee138aa"></a>
@@ -346,19 +370,16 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>uint64_t ans, the sum of sequence </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../de/dc3/fibonacci__sum_8cpp_source.html">fibonacci_sum.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   77</span>                            {</div>
-<div class="line"><span class="lineno">   78</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">math::fibonacci_sum::matrix</a> T{{1, 1}, {1, 0}};</div>
+<div class="line"><span class="lineno">   78</span>    math::fibonacci_sum::matrix T{{1, 1}, {1, 0}};</div>
 <div class="line"><span class="lineno">   79</span>    T = <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a>(T, n);</div>
 <div class="line"><span class="lineno">   80</span>    uint64_t ans = T[0][1];</div>
 <div class="line"><span class="lineno">   81</span>    ans = (ans - 1);</div>
 <div class="line"><span class="lineno">   82</span>    <span class="keywordflow">return</span> ans;</div>
 <div class="line"><span class="lineno">   83</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dc3/fibonacci__sum_8cpp_aadb40ac4c74a7efc0680b83eeee138aa_cgraph.svg" width="344" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -384,48 +405,43 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Function for testing fiboSum function. test cases and assert statement. </p><dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00102">102</a> of file <a class="el" href="../../de/dc3/fibonacci__sum_8cpp_source.html">fibonacci_sum.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  102</span>                   {</div>
 <div class="line"><span class="lineno">  103</span>    uint64_t n = 0, m = 3;</div>
 <div class="line"><span class="lineno">  104</span>    uint64_t <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a> = <a class="code hl_function" href="#a493fbaa7a94e3b7ca573111237bb3742">math::fibonacci_sum::fiboSum</a>(n, m);</div>
 <div class="line"><span class="lineno">  105</span>    assert(<a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a> == 4);</div>
-<div class="line"><span class="lineno">  106</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 1!&quot;</span> &lt;&lt; <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">  106</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 1!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  107</span> </div>
 <div class="line"><span class="lineno">  108</span>    n = 3;</div>
 <div class="line"><span class="lineno">  109</span>    m = 5;</div>
 <div class="line"><span class="lineno">  110</span>    uint64_t <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a> = <a class="code hl_function" href="#a493fbaa7a94e3b7ca573111237bb3742">math::fibonacci_sum::fiboSum</a>(n, m);</div>
 <div class="line"><span class="lineno">  111</span>    assert(<a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a> == 10);</div>
-<div class="line"><span class="lineno">  112</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 2!&quot;</span> &lt;&lt; <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">  112</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 2!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  113</span> </div>
 <div class="line"><span class="lineno">  114</span>    n = 5;</div>
 <div class="line"><span class="lineno">  115</span>    m = 7;</div>
 <div class="line"><span class="lineno">  116</span>    uint64_t <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a> = <a class="code hl_function" href="#a493fbaa7a94e3b7ca573111237bb3742">math::fibonacci_sum::fiboSum</a>(n, m);</div>
 <div class="line"><span class="lineno">  117</span>    assert(<a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a> == 26);</div>
-<div class="line"><span class="lineno">  118</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 3!&quot;</span> &lt;&lt; <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">  118</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 3!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  119</span> </div>
 <div class="line"><span class="lineno">  120</span>    n = 7;</div>
 <div class="line"><span class="lineno">  121</span>    m = 10;</div>
 <div class="line"><span class="lineno">  122</span>    uint64_t test_4 = <a class="code hl_function" href="#a493fbaa7a94e3b7ca573111237bb3742">math::fibonacci_sum::fiboSum</a>(n, m);</div>
 <div class="line"><span class="lineno">  123</span>    assert(test_4 == 123);</div>
-<div class="line"><span class="lineno">  124</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 4!&quot;</span> &lt;&lt; <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">  124</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 4!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  125</span> </div>
 <div class="line"><span class="lineno">  126</span>    n = 9;</div>
 <div class="line"><span class="lineno">  127</span>    m = 12;</div>
 <div class="line"><span class="lineno">  128</span>    uint64_t test_5 = <a class="code hl_function" href="#a493fbaa7a94e3b7ca573111237bb3742">math::fibonacci_sum::fiboSum</a>(n, m);</div>
 <div class="line"><span class="lineno">  129</span>    assert(test_5 == 322);</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> &lt;&lt; <span class="stringliteral">&quot;Passed Test 5!&quot;</span> &lt;&lt; <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">  130</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 5!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  131</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="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="afibonacci__sum_8cpp_html_a493fbaa7a94e3b7ca573111237bb3742"><div class="ttname"><a href="#a493fbaa7a94e3b7ca573111237bb3742">math::fibonacci_sum::fiboSum</a></div><div class="ttdeci">uint64_t fiboSum(uint64_t n, uint64_t m)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:91</div></div>
-<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:505</div></div>
-<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:549</div></div>
-<div class="ttc" id="aheavy__light__decomposition_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> heavy_light_decomposition.cpp:592</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="afibonacci__sum_8cpp_html_a493fbaa7a94e3b7ca573111237bb3742"><div class="ttname"><a href="#a493fbaa7a94e3b7ca573111237bb3742">math::fibonacci_sum::fiboSum</a></div><div class="ttdeci">uint64_t fiboSum(uint64_t n, uint64_t m)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00091">fibonacci_sum.cpp:91</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00505">heavy_light_decomposition.cpp:505</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00549">heavy_light_decomposition.cpp:549</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00592">heavy_light_decomposition.cpp:592</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/de/dc3/fibonacci__sum_8cpp_a493fbaa7a94e3b7ca573111237bb3742_cgraph.map b/de/dc3/fibonacci__sum_8cpp_a493fbaa7a94e3b7ca573111237bb3742_cgraph.map
deleted file mode 100644
index a36f7c101..000000000
--- a/de/dc3/fibonacci__sum_8cpp_a493fbaa7a94e3b7ca573111237bb3742_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="math::fibonacci_sum::fiboSum" name="math::fibonacci_sum::fiboSum">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,148,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="40,29,38,19,44,10,57,5,77,3,97,5,110,11,107,16,96,10,76,8,59,10,48,15,44,20,45,28"/>
-<area shape="rect" id="Node000002" href="$de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa" title=" " alt="" coords="196,29,338,70"/>
-<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="148,47,180,47,180,52,148,52"/>
-<area shape="poly" id="edge5_Node000002_Node000002" title=" " alt="" coords="230,29,229,19,235,10,248,5,267,3,288,5,300,11,298,16,286,10,267,8,249,10,238,15,234,20,236,28"/>
-<area shape="rect" id="Node000003" href="$de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311" title=" " alt="" coords="386,29,528,70"/>
-<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="339,47,371,47,371,52,339,52"/>
-<area shape="poly" id="edge4_Node000003_Node000003" title=" " alt="" coords="421,29,419,19,425,10,438,5,457,3,478,5,490,11,488,16,476,10,457,8,439,10,428,15,424,20,426,28"/>
-</map>
diff --git a/de/dc3/fibonacci__sum_8cpp_a493fbaa7a94e3b7ca573111237bb3742_cgraph.md5 b/de/dc3/fibonacci__sum_8cpp_a493fbaa7a94e3b7ca573111237bb3742_cgraph.md5
deleted file mode 100644
index 0721ab80f..000000000
--- a/de/dc3/fibonacci__sum_8cpp_a493fbaa7a94e3b7ca573111237bb3742_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8d518acb477181baa90cbc4b41d4ff3a
\ No newline at end of file
diff --git a/de/dc3/fibonacci__sum_8cpp_a493fbaa7a94e3b7ca573111237bb3742_cgraph.svg b/de/dc3/fibonacci__sum_8cpp_a493fbaa7a94e3b7ca573111237bb3742_cgraph.svg
deleted file mode 100644
index 850b0ba9d..000000000
--- a/de/dc3/fibonacci__sum_8cpp_a493fbaa7a94e3b7ca573111237bb3742_cgraph.svg
+++ /dev/null
@@ -1,113 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::fibonacci_sum::fiboSum Pages: 1 -->
-<svg width="400pt" height="57pt"
- viewBox="0.00 0.00 400.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::fibonacci_sum::fiboSum</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="106.75,-30.5 0,-30.5 0,0 106.75,0 106.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::fibonacci_sum</text>
-<text text-anchor="middle" x="53.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::fiboSum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.08,-30.99C22.92,-40.06 31.35,-48.5 53.38,-48.5 65.42,-48.5 73.4,-45.97 77.31,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.76,-42.84 78.49,-32.49 73.81,-42 80.76,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-30.5 142.75,-30.5 142.75,0 249.5,0 249.5,-30.5"/>
-<text text-anchor="start" x="150.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::fibonacci_sum</text>
-<text text-anchor="middle" x="196.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::result</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.19,-15.25C115.03,-15.25 123.19,-15.25 131.23,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.97,-18.75 140.97,-15.25 130.97,-11.75 130.97,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge5_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge5_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.83,-30.99C165.67,-40.06 174.1,-48.5 196.12,-48.5 208.17,-48.5 216.15,-45.97 220.06,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="223.51,-42.84 221.24,-32.49 216.56,-42 223.51,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="392.25,-30.5 285.5,-30.5 285.5,0 392.25,0 392.25,-30.5"/>
-<text text-anchor="start" x="293.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::fibonacci_sum</text>
-<text text-anchor="middle" x="338.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::power</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.94,-15.25C257.78,-15.25 265.94,-15.25 273.98,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.72,-18.75 283.72,-15.25 273.72,-11.75 273.72,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M313.58,-30.99C308.42,-40.06 316.85,-48.5 338.88,-48.5 350.92,-48.5 358.9,-45.97 362.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="366.26,-42.84 363.99,-32.49 359.31,-42 366.26,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dc3/fibonacci__sum_8cpp_a493fbaa7a94e3b7ca573111237bb3742_cgraph_org.svg b/de/dc3/fibonacci__sum_8cpp_a493fbaa7a94e3b7ca573111237bb3742_cgraph_org.svg
deleted file mode 100644
index a2f588fd6..000000000
--- a/de/dc3/fibonacci__sum_8cpp_a493fbaa7a94e3b7ca573111237bb3742_cgraph_org.svg
+++ /dev/null
@@ -1,87 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::fibonacci_sum::fiboSum Pages: 1 -->
-<svg width="400pt" height="57pt"
- viewBox="0.00 0.00 400.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::fibonacci_sum::fiboSum</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="106.75,-30.5 0,-30.5 0,0 106.75,0 106.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::fibonacci_sum</text>
-<text text-anchor="middle" x="53.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::fiboSum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.08,-30.99C22.92,-40.06 31.35,-48.5 53.38,-48.5 65.42,-48.5 73.4,-45.97 77.31,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.76,-42.84 78.49,-32.49 73.81,-42 80.76,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-30.5 142.75,-30.5 142.75,0 249.5,0 249.5,-30.5"/>
-<text text-anchor="start" x="150.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::fibonacci_sum</text>
-<text text-anchor="middle" x="196.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::result</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge2_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.19,-15.25C115.03,-15.25 123.19,-15.25 131.23,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.97,-18.75 140.97,-15.25 130.97,-11.75 130.97,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge5_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge5_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.83,-30.99C165.67,-40.06 174.1,-48.5 196.12,-48.5 208.17,-48.5 216.15,-45.97 220.06,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="223.51,-42.84 221.24,-32.49 216.56,-42 223.51,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="392.25,-30.5 285.5,-30.5 285.5,0 392.25,0 392.25,-30.5"/>
-<text text-anchor="start" x="293.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::fibonacci_sum</text>
-<text text-anchor="middle" x="338.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::power</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge3_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.94,-15.25C257.78,-15.25 265.94,-15.25 273.98,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.72,-18.75 283.72,-15.25 273.72,-11.75 273.72,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M313.58,-30.99C308.42,-40.06 316.85,-48.5 338.88,-48.5 350.92,-48.5 358.9,-45.97 362.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="366.26,-42.84 363.99,-32.49 359.31,-42 366.26,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dc3/fibonacci__sum_8cpp_a7cf5feaf168b88e74544da59ed830311_cgraph.map b/de/dc3/fibonacci__sum_8cpp_a7cf5feaf168b88e74544da59ed830311_cgraph.map
deleted file mode 100644
index 92ee455ac..000000000
--- a/de/dc3/fibonacci__sum_8cpp_a7cf5feaf168b88e74544da59ed830311_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="math::fibonacci_sum::power" name="math::fibonacci_sum::power">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,148,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="49,29,47,20,52,11,62,5,77,3,92,5,102,12,99,16,90,10,76,8,63,10,56,14,53,20,54,28"/>
-</map>
diff --git a/de/dc3/fibonacci__sum_8cpp_a7cf5feaf168b88e74544da59ed830311_cgraph.md5 b/de/dc3/fibonacci__sum_8cpp_a7cf5feaf168b88e74544da59ed830311_cgraph.md5
deleted file mode 100644
index 865736ba8..000000000
--- a/de/dc3/fibonacci__sum_8cpp_a7cf5feaf168b88e74544da59ed830311_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6e1d224d7827037d71834f703d458208
\ No newline at end of file
diff --git a/de/dc3/fibonacci__sum_8cpp_a7cf5feaf168b88e74544da59ed830311_cgraph.svg b/de/dc3/fibonacci__sum_8cpp_a7cf5feaf168b88e74544da59ed830311_cgraph.svg
deleted file mode 100644
index de1b9695a..000000000
--- a/de/dc3/fibonacci__sum_8cpp_a7cf5feaf168b88e74544da59ed830311_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::fibonacci_sum::power Pages: 1 -->
-<svg width="115pt" height="57pt"
- viewBox="0.00 0.00 114.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::fibonacci_sum::power</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="106.75,-30.5 0,-30.5 0,0 106.75,0 106.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::fibonacci_sum</text>
-<text text-anchor="middle" x="53.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::power</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.46,-30.99C30.6,-40.06 36.9,-48.5 53.38,-48.5 62.38,-48.5 68.35,-45.97 71.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.74,-42.77 72.15,-32.49 67.77,-42.14 74.74,-42.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dc3/fibonacci__sum_8cpp_a7cf5feaf168b88e74544da59ed830311_cgraph_org.svg b/de/dc3/fibonacci__sum_8cpp_a7cf5feaf168b88e74544da59ed830311_cgraph_org.svg
deleted file mode 100644
index ce6fc161b..000000000
--- a/de/dc3/fibonacci__sum_8cpp_a7cf5feaf168b88e74544da59ed830311_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::fibonacci_sum::power Pages: 1 -->
-<svg width="115pt" height="57pt"
- viewBox="0.00 0.00 114.75 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::fibonacci_sum::power</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="106.75,-30.5 0,-30.5 0,0 106.75,0 106.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::fibonacci_sum</text>
-<text text-anchor="middle" x="53.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::power</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.46,-30.99C30.6,-40.06 36.9,-48.5 53.38,-48.5 62.38,-48.5 68.35,-45.97 71.28,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.74,-42.77 72.15,-32.49 67.77,-42.14 74.74,-42.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dc3/fibonacci__sum_8cpp_a9c83cca09a3e4ff2a25c816a9303448e_cgraph.map b/de/dc3/fibonacci__sum_8cpp_a9c83cca09a3e4ff2a25c816a9303448e_cgraph.map
deleted file mode 100644
index 1b4aeac57..000000000
--- a/de/dc3/fibonacci__sum_8cpp_a9c83cca09a3e4ff2a25c816a9303448e_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="math::fibonacci_sum::multiply" name="math::fibonacci_sum::multiply">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,148,70"/>
-<area shape="rect" id="Node000002" href="$de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa" title=" " alt="" coords="196,29,338,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="148,47,180,47,180,52,148,52"/>
-<area shape="poly" id="edge4_Node000002_Node000002" title=" " alt="" coords="230,29,229,19,235,10,248,5,267,3,288,5,300,11,298,16,286,10,267,8,249,10,238,15,234,20,236,28"/>
-<area shape="rect" id="Node000003" href="$de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311" title=" " alt="" coords="386,29,528,70"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="339,47,371,47,371,52,339,52"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="421,29,419,19,425,10,438,5,457,3,478,5,490,11,488,16,476,10,457,8,439,10,428,15,424,20,426,28"/>
-</map>
diff --git a/de/dc3/fibonacci__sum_8cpp_a9c83cca09a3e4ff2a25c816a9303448e_cgraph.md5 b/de/dc3/fibonacci__sum_8cpp_a9c83cca09a3e4ff2a25c816a9303448e_cgraph.md5
deleted file mode 100644
index c69713d63..000000000
--- a/de/dc3/fibonacci__sum_8cpp_a9c83cca09a3e4ff2a25c816a9303448e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6912f67d210704900b55ae7137d0cb04
\ No newline at end of file
diff --git a/de/dc3/fibonacci__sum_8cpp_a9c83cca09a3e4ff2a25c816a9303448e_cgraph.svg b/de/dc3/fibonacci__sum_8cpp_a9c83cca09a3e4ff2a25c816a9303448e_cgraph.svg
deleted file mode 100644
index 6bda8327b..000000000
--- a/de/dc3/fibonacci__sum_8cpp_a9c83cca09a3e4ff2a25c816a9303448e_cgraph.svg
+++ /dev/null
@@ -1,104 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::fibonacci_sum::multiply Pages: 1 -->
-<svg width="400pt" height="57pt"
- viewBox="0.00 0.00 400.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::fibonacci_sum::multiply</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="106.75,-30.5 0,-30.5 0,0 106.75,0 106.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::fibonacci_sum</text>
-<text text-anchor="middle" x="53.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-30.5 142.75,-30.5 142.75,0 249.5,0 249.5,-30.5"/>
-<text text-anchor="start" x="150.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::fibonacci_sum</text>
-<text text-anchor="middle" x="196.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::result</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.19,-15.25C115.03,-15.25 123.19,-15.25 131.23,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.97,-18.75 140.97,-15.25 130.97,-11.75 130.97,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge4_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge4_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.83,-30.99C165.67,-40.06 174.1,-48.5 196.12,-48.5 208.17,-48.5 216.15,-45.97 220.06,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="223.51,-42.84 221.24,-32.49 216.56,-42 223.51,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="392.25,-30.5 285.5,-30.5 285.5,0 392.25,0 392.25,-30.5"/>
-<text text-anchor="start" x="293.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::fibonacci_sum</text>
-<text text-anchor="middle" x="338.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::power</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.94,-15.25C257.78,-15.25 265.94,-15.25 273.98,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.72,-18.75 283.72,-15.25 273.72,-11.75 273.72,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M313.58,-30.99C308.42,-40.06 316.85,-48.5 338.88,-48.5 350.92,-48.5 358.9,-45.97 362.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="366.26,-42.84 363.99,-32.49 359.31,-42 366.26,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dc3/fibonacci__sum_8cpp_a9c83cca09a3e4ff2a25c816a9303448e_cgraph_org.svg b/de/dc3/fibonacci__sum_8cpp_a9c83cca09a3e4ff2a25c816a9303448e_cgraph_org.svg
deleted file mode 100644
index 6fc8cf0e2..000000000
--- a/de/dc3/fibonacci__sum_8cpp_a9c83cca09a3e4ff2a25c816a9303448e_cgraph_org.svg
+++ /dev/null
@@ -1,78 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::fibonacci_sum::multiply Pages: 1 -->
-<svg width="400pt" height="57pt"
- viewBox="0.00 0.00 400.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::fibonacci_sum::multiply</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="106.75,-30.5 0,-30.5 0,0 106.75,0 106.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::fibonacci_sum</text>
-<text text-anchor="middle" x="53.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-30.5 142.75,-30.5 142.75,0 249.5,0 249.5,-30.5"/>
-<text text-anchor="start" x="150.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::fibonacci_sum</text>
-<text text-anchor="middle" x="196.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::result</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.19,-15.25C115.03,-15.25 123.19,-15.25 131.23,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.97,-18.75 140.97,-15.25 130.97,-11.75 130.97,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge4_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge4_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.83,-30.99C165.67,-40.06 174.1,-48.5 196.12,-48.5 208.17,-48.5 216.15,-45.97 220.06,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="223.51,-42.84 221.24,-32.49 216.56,-42 223.51,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="392.25,-30.5 285.5,-30.5 285.5,0 392.25,0 392.25,-30.5"/>
-<text text-anchor="start" x="293.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::fibonacci_sum</text>
-<text text-anchor="middle" x="338.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::power</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M249.94,-15.25C257.78,-15.25 265.94,-15.25 273.98,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.72,-18.75 283.72,-15.25 273.72,-11.75 273.72,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M313.58,-30.99C308.42,-40.06 316.85,-48.5 338.88,-48.5 350.92,-48.5 358.9,-45.97 362.81,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="366.26,-42.84 363.99,-32.49 359.31,-42 366.26,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 0ceb90745..000000000
--- a/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,71 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,277,49,303"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,203,168,228"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="45,275,95,237,98,236,101,240,98,242,48,279"/>
-<area shape="rect" id="Node000003" href="$d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" title=" " alt="" coords="104,399,161,424"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="42,302,112,385,108,389,38,305"/>
-<area shape="rect" id="Node000023" href="$d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d" title=" " alt="" coords="104,252,161,278"/>
-<area shape="poly" id="edge30_Node000001_Node000023" title=" " alt="" coords="48,283,88,273,89,278,50,288"/>
-<area shape="rect" id="Node000024" href="$d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a" title=" " alt="" coords="104,301,161,327"/>
-<area shape="poly" id="edge38_Node000001_Node000024" title=" " alt="" coords="50,293,89,302,88,307,49,298"/>
-<area shape="rect" id="Node000004" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" title="Adds an undirected edge from node u to node v in the tree." alt="" coords="216,352,361,407"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="161,403,200,395,201,400,162,408"/>
-<area shape="rect" id="Node000005" 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="409,307,564,332"/>
-<area shape="poly" id="edge18_Node000003_Node000005" title=" " alt="" coords="139,424,148,452,164,487,186,521,217,548,256,567,291,575,324,569,360,548,379,527,388,505,390,481,387,456,384,430,384,404,391,377,407,350,420,339,424,343,411,353,396,379,390,404,390,430,393,456,395,481,393,506,384,530,363,552,326,574,291,580,254,572,215,553,182,525,159,490,143,454,134,426"/>
-<area shape="rect" id="Node000006" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" title="This function must be called after the tree adjacency list and node values are populated The function..." alt="" coords="216,613,361,669"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="139,424,165,501,188,548,218,593,227,602,223,605,214,596,183,551,160,503,134,426"/>
-<area shape="rect" id="Node000014" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" title="This function returns the sum of node values in the simple path from from node_1 to node_2." alt="" coords="216,482,361,538"/>
-<area shape="poly" id="edge19_Node000003_Node000014" title=" " alt="" coords="156,423,232,471,229,476,153,427"/>
-<area shape="rect" id="Node000019" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" title="Set the values for all the nodes." alt="" coords="216,221,361,277"/>
-<area shape="poly" id="edge25_Node000003_Node000019" title=" " alt="" coords="144,397,249,286,252,290,148,400"/>
-<area shape="rect" id="Node000020" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="429,203,544,228"/>
-<area shape="poly" id="edge27_Node000003_Node000020" title=" " alt="" coords="162,420,204,432,256,440,311,437,336,430,360,417,374,405,383,392,389,363,393,330,398,312,407,293,431,262,456,237,460,241,435,266,412,296,403,314,398,331,394,364,388,394,378,408,363,422,338,435,311,443,256,445,203,437,161,425"/>
-<area shape="rect" id="Node000021" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" title="This function updates the value at node with val." alt="" coords="216,90,361,146"/>
-<area shape="poly" id="edge28_Node000003_Node000021" title=" " alt="" coords="138,397,166,339,187,272,197,243,214,208,250,156,254,160,218,210,202,245,192,274,170,341,143,400"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="361,355,426,335,428,340,362,360"/>
-<area shape="rect" id="Node000007" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" title="Function that specifies the type of operation involved when segments are combined." alt="" coords="612,561,757,617"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="362,634,458,626,563,613,596,607,597,612,564,618,458,632,362,640"/>
-<area shape="rect" id="Node000008" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)" alt="" coords="414,886,559,942"/>
-<area shape="poly" id="edge7_Node000006_Node000008" title=" " alt="" coords="305,668,347,753,377,802,411,849,437,874,433,878,407,852,373,805,342,755,300,671"/>
-<area shape="rect" id="Node000009" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" title="Utility function to lable the nodes so that heavy chains have a contigous lable." alt="" coords="414,548,559,603"/>
-<area shape="poly" id="edge9_Node000006_Node000009" title=" " alt="" coords="361,615,398,602,400,607,362,620"/>
-<area shape="rect" id="Node000010" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" title="Utility function to assign highest parent that can be reached though heavy chains." alt="" coords="414,702,559,758"/>
-<area shape="poly" id="edge11_Node000006_Node000010" title=" " alt="" coords="353,667,411,693,408,698,351,672"/>
-<area shape="rect" id="Node000011" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" title="This function must be called after the tree adjacency list and node values are populated The function..." alt="" coords="414,782,559,838"/>
-<area shape="poly" id="edge13_Node000006_Node000011" title=" " alt="" coords="313,668,356,717,411,768,416,772,412,776,408,772,352,721,309,671"/>
-<area shape="poly" id="edge8_Node000008_Node000008" title=" " alt="" coords="447,886,448,876,455,867,468,862,487,860,508,862,520,869,518,874,506,868,486,865,469,867,458,872,453,878,453,886"/>
-<area shape="poly" id="edge10_Node000009_Node000009" title=" " alt="" coords="447,547,448,537,455,529,468,523,487,521,508,524,520,531,518,535,506,529,486,526,469,528,458,533,453,539,453,547"/>
-<area shape="poly" id="edge12_Node000010_Node000010" title=" " alt="" coords="447,702,448,692,455,683,468,678,487,676,508,678,520,685,518,690,506,684,486,681,469,683,458,688,453,694,453,702"/>
-<area shape="rect" id="Node000012" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" title="Utility function to populate the t_par vector." alt="" coords="612,834,757,890"/>
-<area shape="poly" id="edge14_Node000011_Node000012" title=" " alt="" coords="560,827,598,837,596,842,559,832"/>
-<area shape="rect" id="Node000013" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" title="Utility function to compute sub&#45;tree sizes." alt="" coords="612,730,757,786"/>
-<area shape="poly" id="edge16_Node000011_Node000013" title=" " alt="" coords="559,789,596,779,598,784,560,794"/>
-<area shape="poly" id="edge15_Node000012_Node000012" title=" " alt="" coords="645,834,646,824,653,815,666,810,684,808,705,810,718,817,716,822,704,816,684,813,667,815,656,820,651,826,650,834"/>
-<area shape="poly" id="edge17_Node000013_Node000013" title=" " alt="" coords="645,730,646,720,653,711,666,706,684,704,705,706,718,713,716,718,704,712,684,709,667,711,656,716,651,722,650,730"/>
-<area shape="rect" id="Node000015" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" title="Utility function to break down a path query into two chain queries." alt="" coords="414,444,559,499"/>
-<area shape="poly" id="edge20_Node000014_Node000015" title=" " alt="" coords="361,494,398,486,399,491,362,499"/>
-<area shape="rect" id="Node000017" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" title="The function returns the least common ancestor of two nodes." alt="" coords="414,364,559,419"/>
-<area shape="poly" id="edge23_Node000014_Node000017" title=" " alt="" coords="332,480,360,461,408,429,415,425,418,430,411,434,363,466,335,484"/>
-<area shape="poly" id="edge21_Node000015_Node000007" title=" " alt="" coords="545,498,565,509,630,550,627,554,562,514,542,502"/>
-<area shape="rect" id="Node000016" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="645,459,724,484"/>
-<area shape="poly" id="edge22_Node000015_Node000016" title=" " alt="" coords="559,469,630,469,630,474,559,474"/>
-<area shape="rect" id="Node000018" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store..." alt="" coords="612,364,757,419"/>
-<area shape="poly" id="edge24_Node000017_Node000018" title=" " alt="" coords="559,389,596,389,596,394,559,394"/>
-<area shape="poly" id="edge26_Node000019_Node000020" title=" " alt="" coords="361,234,413,225,414,231,362,239"/>
-<area shape="rect" id="Node000022" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" title="Update the value at a node." alt="" coords="414,90,559,146"/>
-<area shape="poly" id="edge29_Node000021_Node000022" title=" " alt="" coords="362,116,399,116,399,121,362,121"/>
-<area shape="poly" id="edge31_Node000023_Node000004" title=" " alt="" coords="155,276,170,287,240,340,237,344,166,291,151,280"/>
-<area shape="poly" id="edge33_Node000023_Node000005" title=" " alt="" coords="155,250,166,239,178,217,183,196,183,154,183,133,187,113,196,94,214,76,252,54,289,47,325,54,363,76,381,94,391,113,396,132,396,152,397,194,401,216,412,240,434,269,459,295,455,298,430,273,407,242,396,218,392,195,391,152,390,133,386,115,377,97,360,80,323,59,289,52,254,59,218,80,201,97,192,115,189,134,189,154,188,196,183,219,170,243,159,254"/>
-<area shape="poly" id="edge32_Node000023_Node000006" title=" " alt="" coords="160,277,170,287,189,323,198,356,201,387,200,417,200,478,205,512,218,549,233,576,252,600,247,603,229,579,214,551,200,513,194,478,195,416,196,387,193,357,184,325,166,291,156,280"/>
-<area shape="poly" id="edge34_Node000023_Node000014" title=" " alt="" coords="159,277,170,287,190,321,197,352,204,383,218,418,254,469,250,472,214,421,199,384,192,353,185,323,166,291,155,280"/>
-<area shape="poly" id="edge35_Node000023_Node000019" title=" " alt="" coords="161,259,200,255,201,261,162,265"/>
-<area shape="poly" id="edge36_Node000023_Node000020" title=" " alt="" coords="156,250,166,239,180,211,185,184,181,131,180,105,182,80,193,55,214,32,252,10,288,3,324,11,363,32,378,46,387,60,393,91,396,123,401,140,411,157,429,176,450,192,447,196,426,180,407,160,397,142,391,124,388,92,382,62,374,49,360,36,322,16,288,8,254,15,218,36,197,58,187,81,185,105,187,130,190,184,185,213,170,243,160,253"/>
-<area shape="poly" id="edge37_Node000023_Node000021" title=" " alt="" coords="154,250,166,239,181,220,189,202,198,183,214,163,224,154,228,158,218,167,203,186,194,204,185,222,170,243,157,254"/>
-<area shape="poly" id="edge39_Node000024_Node000004" title=" " alt="" coords="163,324,208,343,206,348,160,329"/>
-<area shape="poly" id="edge41_Node000024_Node000005" title=" " alt="" coords="161,312,394,316,394,321,161,317"/>
-<area shape="poly" id="edge40_Node000024_Node000006" title=" " alt="" coords="143,326,170,385,185,432,192,469,200,505,218,549,253,600,249,603,214,552,195,507,187,470,179,433,166,387,138,328"/>
-<area shape="poly" id="edge42_Node000024_Node000014" title=" " alt="" coords="146,326,218,418,258,468,254,472,214,421,142,329"/>
-<area shape="poly" id="edge43_Node000024_Node000019" title=" " alt="" coords="160,300,206,281,208,286,163,305"/>
-<area shape="poly" id="edge44_Node000024_Node000020" title=" " alt="" coords="154,299,166,289,180,266,187,245,195,225,215,207,241,195,268,187,326,182,381,186,430,196,429,201,380,191,326,187,269,192,243,200,217,211,199,228,192,247,185,269,170,292,158,303"/>
-<area shape="poly" id="edge45_Node000024_Node000021" title=" " alt="" coords="155,299,166,289,183,257,189,227,195,197,214,163,222,155,226,158,218,167,200,198,194,228,188,258,170,292,159,303"/>
-</map>
diff --git a/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 7478f94c2..000000000
--- a/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e0ee7b382d1bc3e758651bba31265ee2
\ No newline at end of file
diff --git a/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index f436f4362..000000000
--- a/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,748 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<!--zoomable 711 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 572;
-var viewHeight = 711;
-var sectionId = 'dynsection-6';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-498.5 0,-498.5 0,-479.25 32.5,-479.25 32.5,-498.5"/>
-<text text-anchor="middle" x="16.25" y="-485" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-554.5 68.5,-554.5 68.5,-535.25 122,-535.25 122,-554.5"/>
-<text text-anchor="middle" x="95.25" y="-541" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.66,-498.98C40.96,-506.7 55.56,-517.55 68.5,-526.88 69.18,-527.37 69.87,-527.86 70.57,-528.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.34,-531.07 78.53,-533.98 72.38,-525.35 68.34,-531.07"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116.75,-407.5 73.75,-407.5 73.75,-388.25 116.75,-388.25 116.75,-407.5"/>
-<text text-anchor="middle" x="95.25" y="-394" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.78,-478.79C38.51,-463.75 62.68,-435.19 78.63,-416.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.15,-418.78 84.93,-408.89 75.8,-414.26 81.15,-418.78"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116.75,-517.5 73.75,-517.5 73.75,-498.25 116.75,-498.25 116.75,-517.5"/>
-<text text-anchor="middle" x="95.25" y="-504" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node23 -->
-<g id="edge30_Node000001_Node000023" class="edge">
-<title>Node1&#45;&gt;Node23</title>
-<g id="a_edge30_Node000001_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-492.72C41.33,-494.82 52.16,-497.49 62.35,-500"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.42,-503.38 71.97,-502.38 63.1,-496.58 61.42,-503.38"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116.75,-480.5 73.75,-480.5 73.75,-461.25 116.75,-461.25 116.75,-480.5"/>
-<text text-anchor="middle" x="95.25" y="-467" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node24 -->
-<g id="edge38_Node000001_Node000024" class="edge">
-<title>Node1&#45;&gt;Node24</title>
-<g id="a_edge38_Node000001_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-485.23C41.33,-483.25 52.16,-480.71 62.35,-478.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="63.02,-481.77 71.96,-476.09 61.43,-474.95 63.02,-481.77"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" target="_top" xlink:title="Adds an undirected edge from node u to node v in the tree.">
-<polygon fill="white" stroke="#666666" points="267,-442.75 158,-442.75 158,-401 267,-401 267,-442.75"/>
-<text text-anchor="start" x="166" y="-429.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="166" y="-418" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="212.5" y="-406.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.12,-402.22C125.59,-403.99 135.89,-406.13 146.52,-408.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.68,-411.74 156.18,-410.35 147.1,-404.89 145.68,-411.74"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="418.75,-476.5 303,-476.5 303,-457.25 418.75,-457.25 418.75,-476.5"/>
-<text text-anchor="middle" x="360.88" y="-463" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge18_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge18_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.67,-387.78C104.52,-365.92 121.68,-314.55 158,-293.88 200.1,-269.91 228.93,-263.91 267,-293.88 320.53,-336.01 258.89,-390.96 303,-442.88 305.69,-446.04 308.87,-448.8 312.33,-451.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="310.28,-454.06 320.69,-456 313.76,-447.99 310.28,-454.06"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="267,-246.75 158,-246.75 158,-205 267,-205 267,-246.75"/>
-<text text-anchor="start" x="166" y="-233.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="166" y="-222" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="212.5" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::init</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.67,-387.87C104.92,-363.69 123.58,-301.13 158,-260.88 160.03,-258.5 162.26,-256.23 164.62,-254.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.39,-257.13 171.88,-248.07 161.94,-251.73 166.39,-257.13"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" target="_top" xlink:title="This function returns the sum of node values in the simple path from from node_1 to node_2.">
-<polygon fill="white" stroke="#666666" points="267,-344.75 158,-344.75 158,-303 267,-303 267,-344.75"/>
-<text text-anchor="start" x="166" y="-331.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="166" y="-320" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="212.5" y="-308.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::query</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node14 -->
-<g id="edge19_Node000003_Node000014" class="edge">
-<title>Node3&#45;&gt;Node14</title>
-<g id="a_edge19_Node000003_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.79,-387.9C126.37,-378.54 148.84,-364.11 168.76,-351.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.49,-354.37 177.01,-346.02 166.71,-348.48 170.49,-354.37"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" target="_top" xlink:title="Set the values for all the nodes.">
-<polygon fill="white" stroke="#666666" points="267,-540.75 158,-540.75 158,-499 267,-499 267,-540.75"/>
-<text text-anchor="start" x="166" y="-527.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="166" y="-516" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="212.5" y="-504.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::set_node_val</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node19 -->
-<g id="edge25_Node000003_Node000019" class="edge">
-<title>Node3&#45;&gt;Node19</title>
-<g id="a_edge25_Node000003_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.68,-407.86C122.56,-425.73 158.54,-463.81 183.84,-490.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.19,-492.89 190.6,-497.75 186.28,-488.08 181.19,-492.89"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="404.12,-554.5 317.62,-554.5 317.62,-535.25 404.12,-535.25 404.12,-554.5"/>
-<text text-anchor="middle" x="360.88" y="-541" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node20 -->
-<g id="edge27_Node000003_Node000020" class="edge">
-<title>Node3&#45;&gt;Node20</title>
-<g id="a_edge27_Node000003_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.09,-389.86C151.63,-378.04 221.42,-360.52 267,-391.88 303.86,-417.23 278.99,-448.12 303,-485.88 312.98,-501.56 327.59,-516.61 339.5,-527.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="337.04,-530.08 346.84,-534.11 341.7,-524.85 337.04,-530.08"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" target="_top" xlink:title="This function updates the value at node with val.">
-<polygon fill="white" stroke="#666666" points="267,-638.75 158,-638.75 158,-597 267,-597 267,-638.75"/>
-<text text-anchor="start" x="166" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="166" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="212.5" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::update</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node21 -->
-<g id="edge28_Node000003_Node000021" class="edge">
-<title>Node3&#45;&gt;Node21</title>
-<g id="a_edge28_Node000003_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.28,-407.7C106.68,-418.43 115.39,-436.18 122,-451.88 140.01,-494.64 135.37,-509.36 158,-549.88 165.46,-563.22 175.44,-576.71 184.76,-588.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.95,-590.2 191.07,-595.61 187.31,-585.7 181.95,-590.2"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.17,-438.38C283.32,-443.34 300.84,-448.73 316.26,-453.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.03,-456.75 325.62,-456.34 317.09,-450.06 315.03,-456.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="563.75,-285.75 454.75,-285.75 454.75,-244 563.75,-244 563.75,-285.75"/>
-<text text-anchor="start" x="462.75" y="-272.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="462.75" y="-261" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="509.25" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.32,-228.97C308.86,-231.82 367.67,-236.84 418.75,-244.88 426.75,-246.13 435.11,-247.68 443.36,-249.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="442.52,-252.76 453.03,-251.39 443.96,-245.91 442.52,-252.76"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" target="_top" xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="white" stroke="#666666" points="415.38,-41.75 306.38,-41.75 306.38,0 415.38,0 415.38,-41.75"/>
-<text text-anchor="start" x="314.38" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="314.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="360.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M222.69,-204.59C236.98,-172.94 266.68,-112.53 303,-68.88 308.69,-62.03 315.44,-55.39 322.27,-49.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="324.37,-52.16 329.72,-43.01 319.84,-46.82 324.37,-52.16"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" target="_top" xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="white" stroke="#666666" points="415.38,-295.75 306.38,-295.75 306.38,-254 415.38,-254 415.38,-295.75"/>
-<text text-anchor="start" x="314.38" y="-282.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="314.38" y="-271" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="360.88" y="-259.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge9_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge9_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.17,-243.84C276.32,-246.91 285.91,-250.11 295.3,-253.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.18,-256.57 304.77,-256.43 296.4,-249.94 294.18,-256.57"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" target="_top" xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="white" stroke="#666666" points="415.38,-179.75 306.38,-179.75 306.38,-138 415.38,-138 415.38,-179.75"/>
-<text text-anchor="start" x="314.38" y="-166.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="314.38" y="-155" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="360.88" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge11_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge11_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.81,-204.68C273.56,-198.38 288.78,-191.42 303.11,-184.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.35,-188.14 311.98,-180.8 301.43,-181.78 304.35,-188.14"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="415.38,-119.75 306.38,-119.75 306.38,-78 415.38,-78 415.38,-119.75"/>
-<text text-anchor="start" x="314.38" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="314.38" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="360.88" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge13_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge13_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.56,-204.61C246.24,-183.53 273.94,-151.22 303,-128.88 304.12,-128.01 305.27,-127.16 306.44,-126.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="308.08,-129.44 314.51,-121.01 304.23,-123.59 308.08,-129.44"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge8_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge8_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.49,-42.07C330.88,-51.55 340.01,-59.75 360.88,-59.75 372.94,-59.75 381.08,-57.01 385.29,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="388.59,-54.1 387.86,-43.53 381.84,-52.24 388.59,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node9 -->
-<g id="edge10_Node000009_Node000009" class="edge">
-<title>Node9&#45;&gt;Node9</title>
-<g id="a_edge10_Node000009_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.49,-296.07C330.88,-305.55 340.01,-313.75 360.88,-313.75 372.94,-313.75 381.08,-311.01 385.29,-306.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="388.59,-308.1 387.86,-297.53 381.84,-306.24 388.59,-308.1"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node10 -->
-<g id="edge12_Node000010_Node000010" class="edge">
-<title>Node10&#45;&gt;Node10</title>
-<g id="a_edge12_Node000010_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.49,-180.07C330.88,-189.55 340.01,-197.75 360.88,-197.75 372.94,-197.75 381.08,-195.01 385.29,-190.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="388.59,-192.1 387.86,-181.53 381.84,-190.24 388.59,-192.1"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="563.75,-80.75 454.75,-80.75 454.75,-39 563.75,-39 563.75,-80.75"/>
-<text text-anchor="start" x="462.75" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="462.75" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="509.25" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge14_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge14_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.55,-84.57C424.7,-82.14 434.28,-79.58 443.68,-77.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="444.36,-80.52 453.12,-74.56 442.56,-73.76 444.36,-80.52"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="563.75,-158.75 454.75,-158.75 454.75,-117 563.75,-117 563.75,-158.75"/>
-<text text-anchor="start" x="462.75" y="-145.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="462.75" y="-134" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="509.25" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node13 -->
-<g id="edge16_Node000011_Node000013" class="edge">
-<title>Node11&#45;&gt;Node13</title>
-<g id="a_edge16_Node000011_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.55,-113.18C424.7,-115.61 434.28,-118.17 443.68,-120.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="442.56,-123.99 453.12,-123.19 444.36,-117.23 442.56,-123.99"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node12 -->
-<g id="edge15_Node000012_Node000012" class="edge">
-<title>Node12&#45;&gt;Node12</title>
-<g id="a_edge15_Node000012_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M481.86,-81.07C479.26,-90.55 488.38,-98.75 509.25,-98.75 521.31,-98.75 529.45,-96.01 533.67,-91.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="536.96,-93.1 536.23,-82.53 530.21,-91.24 536.96,-93.1"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node13 -->
-<g id="edge17_Node000013_Node000013" class="edge">
-<title>Node13&#45;&gt;Node13</title>
-<g id="a_edge17_Node000013_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M481.86,-159.07C479.26,-168.55 488.38,-176.75 509.25,-176.75 521.31,-176.75 529.45,-174.01 533.67,-169.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="536.96,-171.1 536.23,-160.53 530.21,-169.24 536.96,-171.1"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" target="_top" xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="white" stroke="#666666" points="415.38,-373.75 306.38,-373.75 306.38,-332 415.38,-332 415.38,-373.75"/>
-<text text-anchor="start" x="314.38" y="-360.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="314.38" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="360.88" y="-337.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge20_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge20_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.17,-334.51C276.22,-336.3 285.7,-338.18 295,-340.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.23,-343.44 304.72,-341.95 295.59,-336.57 294.23,-343.44"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" target="_top" xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="white" stroke="#666666" points="415.38,-433.75 306.38,-433.75 306.38,-392 415.38,-392 415.38,-433.75"/>
-<text text-anchor="start" x="314.38" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="314.38" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="360.88" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node17 -->
-<g id="edge23_Node000014_Node000017" class="edge">
-<title>Node14&#45;&gt;Node17</title>
-<g id="a_edge23_Node000014_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M246.07,-345.12C252.98,-349.65 260.24,-354.41 267,-358.88 283.05,-369.47 286.47,-373.04 303,-382.88 304.83,-383.97 306.71,-385.06 308.62,-386.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="306.53,-389 316.96,-390.83 309.95,-382.89 306.53,-389"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node7 -->
-<g id="edge21_Node000015_Node000007" class="edge">
-<title>Node15&#45;&gt;Node7</title>
-<g id="a_edge21_Node000015_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M403.43,-331.51C408.63,-328.68 413.84,-325.75 418.75,-322.88 434.87,-313.43 452.18,-302.42 467.25,-292.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="469.11,-295.51 475.53,-287.08 465.25,-289.67 469.11,-295.51"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="538.62,-362.5 479.88,-362.5 479.88,-343.25 538.62,-343.25 538.62,-362.5"/>
-<text text-anchor="middle" x="509.25" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge22_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge22_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.55,-352.88C433.01,-352.88 452.08,-352.88 468.35,-352.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="468.13,-356.38 478.13,-352.88 468.13,-349.38 468.13,-356.38"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="563.75,-433.75 454.75,-433.75 454.75,-392 563.75,-392 563.75,-433.75"/>
-<text text-anchor="start" x="462.75" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="462.75" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="509.25" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge24_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge24_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.55,-412.88C424.6,-412.88 434.08,-412.88 443.37,-412.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="443.07,-416.38 453.07,-412.88 443.07,-409.38 443.07,-416.38"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge26_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge26_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.17,-529.04C279.79,-531.2 293.25,-533.5 305.88,-535.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.26,-539.1 315.71,-537.33 306.44,-532.2 305.26,-539.1"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" target="_top" xlink:title="Update the value at a node.">
-<polygon fill="white" stroke="#666666" points="415.38,-638.75 306.38,-638.75 306.38,-597 415.38,-597 415.38,-638.75"/>
-<text text-anchor="start" x="314.38" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="314.38" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="360.88" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::update</text>
-</a>
-</g>
-</g>
-<!-- Node21&#45;&gt;Node22 -->
-<g id="edge29_Node000021_Node000022" class="edge">
-<title>Node21&#45;&gt;Node22</title>
-<g id="a_edge29_Node000021_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.17,-617.88C276.22,-617.88 285.7,-617.88 295,-617.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.69,-621.38 304.69,-617.88 294.69,-614.38 294.69,-621.38"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node4 -->
-<g id="edge31_Node000023_Node000004" class="edge">
-<title>Node23&#45;&gt;Node4</title>
-<g id="a_edge31_Node000023_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.76,-497.88C114.44,-495.3 118.39,-492.51 122,-489.88 139.66,-477 159.01,-462.37 175.17,-449.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.29,-452.78 183.09,-443.91 173.03,-447.23 177.29,-452.78"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node5 -->
-<g id="edge33_Node000023_Node000005" class="edge">
-<title>Node23&#45;&gt;Node5</title>
-<g id="a_edge33_Node000023_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.01,-517.87C117,-520.18 119.83,-522.86 122,-525.88 155.02,-571.76 112.72,-614.03 158,-647.88 196.8,-676.88 228.2,-676.88 267,-647.88 312.28,-614.03 274.57,-574.74 303,-525.88 312.24,-510 326.62,-495.13 338.61,-484.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="340.79,-487.03 346.05,-477.83 336.2,-481.75 340.79,-487.03"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node6 -->
-<g id="edge32_Node000023_Node000006" class="edge">
-<title>Node23&#45;&gt;Node6</title>
-<g id="a_edge32_Node000023_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.53,-497.85C117.4,-495.57 120.05,-492.9 122,-489.88 169.88,-415.37 121.55,-374.6 158,-293.88 164.19,-280.16 173.74,-266.76 183.06,-255.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.53,-258.02 189.43,-248.17 180.24,-253.44 185.53,-258.02"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node14 -->
-<g id="edge34_Node000023_Node000014" class="edge">
-<title>Node23&#45;&gt;Node14</title>
-<g id="a_edge34_Node000023_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.85,-497.76C116.86,-495.46 119.74,-492.81 122,-489.88 150.32,-453.12 135.37,-432.39 158,-391.88 165.46,-378.53 175.44,-365.04 184.76,-353.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.31,-356.05 191.07,-346.14 181.95,-351.55 187.31,-356.05"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node19 -->
-<g id="edge35_Node000023_Node000019" class="edge">
-<title>Node23&#45;&gt;Node19</title>
-<g id="a_edge35_Node000023_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.12,-510.05C125.59,-510.93 135.89,-512 146.52,-513.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.85,-516.56 156.16,-514.11 146.57,-509.6 145.85,-516.56"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node20 -->
-<g id="edge36_Node000023_Node000020" class="edge">
-<title>Node23&#45;&gt;Node20</title>
-<g id="a_edge36_Node000023_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.42,-517.97C117.3,-520.25 119.98,-522.89 122,-525.88 161.61,-584.46 102.62,-636.89 158,-680.88 195.93,-711.01 227.04,-708.26 267,-680.88 303.56,-655.82 276.3,-623.26 303,-587.88 310.91,-577.39 322.03,-568.21 332.35,-561.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.13,-564.07 340.59,-555.67 330.3,-558.21 334.13,-564.07"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node21 -->
-<g id="edge37_Node000023_Node000021" class="edge">
-<title>Node23&#45;&gt;Node21</title>
-<g id="a_edge37_Node000023_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.56,-517.8C115.89,-520.22 119.21,-522.95 122,-525.88 142.69,-547.55 136.98,-561.52 158,-582.88 160.38,-585.29 162.95,-587.62 165.63,-589.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.23,-592.44 173.29,-595.77 167.5,-586.89 163.23,-592.44"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node4 -->
-<g id="edge39_Node000024_Node000004" class="edge">
-<title>Node24&#45;&gt;Node4</title>
-<g id="a_edge39_Node000024_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.12,-462C126.85,-457.86 138.98,-452.71 151.27,-447.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.35,-450.83 160.19,-443.69 149.61,-444.38 152.35,-450.83"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node5 -->
-<g id="edge41_Node000024_Node000005" class="edge">
-<title>Node24&#45;&gt;Node5</title>
-<g id="a_edge41_Node000024_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.94,-470.56C154.03,-470 233.41,-468.79 291.36,-467.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.19,-471.42 301.14,-467.77 291.09,-464.42 291.19,-471.42"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node6 -->
-<g id="edge40_Node000024_Node000006" class="edge">
-<title>Node24&#45;&gt;Node6</title>
-<g id="a_edge40_Node000024_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.48,-461.13C107.06,-450.47 115.92,-432.79 122,-416.88 142.32,-363.66 131.92,-344.51 158,-293.88 164.95,-280.39 174.74,-266.96 184.05,-255.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="186.56,-258.09 190.37,-248.21 181.23,-253.56 186.56,-258.09"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node14 -->
-<g id="edge42_Node000024_Node000014" class="edge">
-<title>Node24&#45;&gt;Node14</title>
-<g id="a_edge42_Node000024_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.85,-461.14C115.49,-446.22 138.45,-416.81 158,-391.88 167.73,-379.47 178.47,-365.81 187.76,-354"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.48,-356.21 193.92,-346.19 184.98,-351.88 190.48,-356.21"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node19 -->
-<g id="edge43_Node000024_Node000019" class="edge">
-<title>Node24&#45;&gt;Node19</title>
-<g id="a_edge43_Node000024_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.12,-479.75C126.85,-483.89 138.98,-489.04 151.27,-494.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.61,-497.37 160.19,-498.06 152.35,-490.92 149.61,-497.37"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node20 -->
-<g id="edge44_Node000024_Node000020" class="edge">
-<title>Node24&#45;&gt;Node20</title>
-<g id="a_edge44_Node000024_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.9,-480.94C116.13,-483.31 119.33,-485.99 122,-488.88 143.39,-511.97 130.66,-534.27 158,-549.88 207.19,-577.96 274.7,-568.61 317.81,-557.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.51,-561.32 327.29,-555.38 316.73,-554.55 318.51,-561.32"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node21 -->
-<g id="edge45_Node000024_Node000021" class="edge">
-<title>Node24&#45;&gt;Node21</title>
-<g id="a_edge45_Node000024_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.55,-480.81C116.66,-483.16 119.65,-485.87 122,-488.88 149.54,-524.13 129.92,-548.05 158,-582.88 159.8,-585.11 161.78,-587.24 163.88,-589.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.49,-591.84 171.37,-595.67 166.03,-586.51 161.49,-591.84"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 8a2fe90d7..000000000
--- a/de/dc3/fibonacci__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,665 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="572pt" height="711pt"
- viewBox="0.00 0.00 571.75 710.62" 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 706.62)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-498.5 0,-498.5 0,-479.25 32.5,-479.25 32.5,-498.5"/>
-<text text-anchor="middle" x="16.25" y="-485" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-554.5 68.5,-554.5 68.5,-535.25 122,-535.25 122,-554.5"/>
-<text text-anchor="middle" x="95.25" y="-541" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.66,-498.98C40.96,-506.7 55.56,-517.55 68.5,-526.88 69.18,-527.37 69.87,-527.86 70.57,-528.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.34,-531.07 78.53,-533.98 72.38,-525.35 68.34,-531.07"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116.75,-407.5 73.75,-407.5 73.75,-388.25 116.75,-388.25 116.75,-407.5"/>
-<text text-anchor="middle" x="95.25" y="-394" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.78,-478.79C38.51,-463.75 62.68,-435.19 78.63,-416.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.15,-418.78 84.93,-408.89 75.8,-414.26 81.15,-418.78"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116.75,-517.5 73.75,-517.5 73.75,-498.25 116.75,-498.25 116.75,-517.5"/>
-<text text-anchor="middle" x="95.25" y="-504" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node23 -->
-<g id="edge30_Node000001_Node000023" class="edge">
-<title>Node1&#45;&gt;Node23</title>
-<g id="a_edge30_Node000001_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-492.72C41.33,-494.82 52.16,-497.49 62.35,-500"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.42,-503.38 71.97,-502.38 63.1,-496.58 61.42,-503.38"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="116.75,-480.5 73.75,-480.5 73.75,-461.25 116.75,-461.25 116.75,-480.5"/>
-<text text-anchor="middle" x="95.25" y="-467" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node24 -->
-<g id="edge38_Node000001_Node000024" class="edge">
-<title>Node1&#45;&gt;Node24</title>
-<g id="a_edge38_Node000001_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-485.23C41.33,-483.25 52.16,-480.71 62.35,-478.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="63.02,-481.77 71.96,-476.09 61.43,-474.95 63.02,-481.77"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" target="_top" xlink:title="Adds an undirected edge from node u to node v in the tree.">
-<polygon fill="white" stroke="#666666" points="267,-442.75 158,-442.75 158,-401 267,-401 267,-442.75"/>
-<text text-anchor="start" x="166" y="-429.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="166" y="-418" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="212.5" y="-406.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.12,-402.22C125.59,-403.99 135.89,-406.13 146.52,-408.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.68,-411.74 156.18,-410.35 147.1,-404.89 145.68,-411.74"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="418.75,-476.5 303,-476.5 303,-457.25 418.75,-457.25 418.75,-476.5"/>
-<text text-anchor="middle" x="360.88" y="-463" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge18_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge18_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.67,-387.78C104.52,-365.92 121.68,-314.55 158,-293.88 200.1,-269.91 228.93,-263.91 267,-293.88 320.53,-336.01 258.89,-390.96 303,-442.88 305.69,-446.04 308.87,-448.8 312.33,-451.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="310.28,-454.06 320.69,-456 313.76,-447.99 310.28,-454.06"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="267,-246.75 158,-246.75 158,-205 267,-205 267,-246.75"/>
-<text text-anchor="start" x="166" y="-233.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="166" y="-222" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="212.5" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::init</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.67,-387.87C104.92,-363.69 123.58,-301.13 158,-260.88 160.03,-258.5 162.26,-256.23 164.62,-254.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.39,-257.13 171.88,-248.07 161.94,-251.73 166.39,-257.13"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" target="_top" xlink:title="This function returns the sum of node values in the simple path from from node_1 to node_2.">
-<polygon fill="white" stroke="#666666" points="267,-344.75 158,-344.75 158,-303 267,-303 267,-344.75"/>
-<text text-anchor="start" x="166" y="-331.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="166" y="-320" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="212.5" y="-308.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::query</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node14 -->
-<g id="edge19_Node000003_Node000014" class="edge">
-<title>Node3&#45;&gt;Node14</title>
-<g id="a_edge19_Node000003_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.79,-387.9C126.37,-378.54 148.84,-364.11 168.76,-351.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.49,-354.37 177.01,-346.02 166.71,-348.48 170.49,-354.37"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" target="_top" xlink:title="Set the values for all the nodes.">
-<polygon fill="white" stroke="#666666" points="267,-540.75 158,-540.75 158,-499 267,-499 267,-540.75"/>
-<text text-anchor="start" x="166" y="-527.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="166" y="-516" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="212.5" y="-504.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::set_node_val</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node19 -->
-<g id="edge25_Node000003_Node000019" class="edge">
-<title>Node3&#45;&gt;Node19</title>
-<g id="a_edge25_Node000003_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.68,-407.86C122.56,-425.73 158.54,-463.81 183.84,-490.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.19,-492.89 190.6,-497.75 186.28,-488.08 181.19,-492.89"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="404.12,-554.5 317.62,-554.5 317.62,-535.25 404.12,-535.25 404.12,-554.5"/>
-<text text-anchor="middle" x="360.88" y="-541" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node20 -->
-<g id="edge27_Node000003_Node000020" class="edge">
-<title>Node3&#45;&gt;Node20</title>
-<g id="a_edge27_Node000003_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.09,-389.86C151.63,-378.04 221.42,-360.52 267,-391.88 303.86,-417.23 278.99,-448.12 303,-485.88 312.98,-501.56 327.59,-516.61 339.5,-527.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="337.04,-530.08 346.84,-534.11 341.7,-524.85 337.04,-530.08"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" target="_top" xlink:title="This function updates the value at node with val.">
-<polygon fill="white" stroke="#666666" points="267,-638.75 158,-638.75 158,-597 267,-597 267,-638.75"/>
-<text text-anchor="start" x="166" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="166" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="212.5" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::update</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node21 -->
-<g id="edge28_Node000003_Node000021" class="edge">
-<title>Node3&#45;&gt;Node21</title>
-<g id="a_edge28_Node000003_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.28,-407.7C106.68,-418.43 115.39,-436.18 122,-451.88 140.01,-494.64 135.37,-509.36 158,-549.88 165.46,-563.22 175.44,-576.71 184.76,-588.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.95,-590.2 191.07,-595.61 187.31,-585.7 181.95,-590.2"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.17,-438.38C283.32,-443.34 300.84,-448.73 316.26,-453.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.03,-456.75 325.62,-456.34 317.09,-450.06 315.03,-456.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="563.75,-285.75 454.75,-285.75 454.75,-244 563.75,-244 563.75,-285.75"/>
-<text text-anchor="start" x="462.75" y="-272.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="462.75" y="-261" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="509.25" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.32,-228.97C308.86,-231.82 367.67,-236.84 418.75,-244.88 426.75,-246.13 435.11,-247.68 443.36,-249.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="442.52,-252.76 453.03,-251.39 443.96,-245.91 442.52,-252.76"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" target="_top" xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="white" stroke="#666666" points="415.38,-41.75 306.38,-41.75 306.38,0 415.38,0 415.38,-41.75"/>
-<text text-anchor="start" x="314.38" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="314.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="360.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node8 -->
-<g id="edge7_Node000006_Node000008" class="edge">
-<title>Node6&#45;&gt;Node8</title>
-<g id="a_edge7_Node000006_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M222.69,-204.59C236.98,-172.94 266.68,-112.53 303,-68.88 308.69,-62.03 315.44,-55.39 322.27,-49.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="324.37,-52.16 329.72,-43.01 319.84,-46.82 324.37,-52.16"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" target="_top" xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="white" stroke="#666666" points="415.38,-295.75 306.38,-295.75 306.38,-254 415.38,-254 415.38,-295.75"/>
-<text text-anchor="start" x="314.38" y="-282.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="314.38" y="-271" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="360.88" y="-259.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node9 -->
-<g id="edge9_Node000006_Node000009" class="edge">
-<title>Node6&#45;&gt;Node9</title>
-<g id="a_edge9_Node000006_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.17,-243.84C276.32,-246.91 285.91,-250.11 295.3,-253.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.18,-256.57 304.77,-256.43 296.4,-249.94 294.18,-256.57"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" target="_top" xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="white" stroke="#666666" points="415.38,-179.75 306.38,-179.75 306.38,-138 415.38,-138 415.38,-179.75"/>
-<text text-anchor="start" x="314.38" y="-166.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="314.38" y="-155" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="360.88" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node10 -->
-<g id="edge11_Node000006_Node000010" class="edge">
-<title>Node6&#45;&gt;Node10</title>
-<g id="a_edge11_Node000006_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M259.81,-204.68C273.56,-198.38 288.78,-191.42 303.11,-184.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="304.35,-188.14 311.98,-180.8 301.43,-181.78 304.35,-188.14"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="415.38,-119.75 306.38,-119.75 306.38,-78 415.38,-78 415.38,-119.75"/>
-<text text-anchor="start" x="314.38" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="314.38" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="360.88" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node11 -->
-<g id="edge13_Node000006_Node000011" class="edge">
-<title>Node6&#45;&gt;Node11</title>
-<g id="a_edge13_Node000006_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M229.56,-204.61C246.24,-183.53 273.94,-151.22 303,-128.88 304.12,-128.01 305.27,-127.16 306.44,-126.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="308.08,-129.44 314.51,-121.01 304.23,-123.59 308.08,-129.44"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge8_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge8_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.49,-42.07C330.88,-51.55 340.01,-59.75 360.88,-59.75 372.94,-59.75 381.08,-57.01 385.29,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="388.59,-54.1 387.86,-43.53 381.84,-52.24 388.59,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node9 -->
-<g id="edge10_Node000009_Node000009" class="edge">
-<title>Node9&#45;&gt;Node9</title>
-<g id="a_edge10_Node000009_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.49,-296.07C330.88,-305.55 340.01,-313.75 360.88,-313.75 372.94,-313.75 381.08,-311.01 385.29,-306.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="388.59,-308.1 387.86,-297.53 381.84,-306.24 388.59,-308.1"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node10 -->
-<g id="edge12_Node000010_Node000010" class="edge">
-<title>Node10&#45;&gt;Node10</title>
-<g id="a_edge12_Node000010_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M333.49,-180.07C330.88,-189.55 340.01,-197.75 360.88,-197.75 372.94,-197.75 381.08,-195.01 385.29,-190.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="388.59,-192.1 387.86,-181.53 381.84,-190.24 388.59,-192.1"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="563.75,-80.75 454.75,-80.75 454.75,-39 563.75,-39 563.75,-80.75"/>
-<text text-anchor="start" x="462.75" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="462.75" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="509.25" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node12 -->
-<g id="edge14_Node000011_Node000012" class="edge">
-<title>Node11&#45;&gt;Node12</title>
-<g id="a_edge14_Node000011_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.55,-84.57C424.7,-82.14 434.28,-79.58 443.68,-77.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="444.36,-80.52 453.12,-74.56 442.56,-73.76 444.36,-80.52"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="563.75,-158.75 454.75,-158.75 454.75,-117 563.75,-117 563.75,-158.75"/>
-<text text-anchor="start" x="462.75" y="-145.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="462.75" y="-134" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="509.25" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node13 -->
-<g id="edge16_Node000011_Node000013" class="edge">
-<title>Node11&#45;&gt;Node13</title>
-<g id="a_edge16_Node000011_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.55,-113.18C424.7,-115.61 434.28,-118.17 443.68,-120.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="442.56,-123.99 453.12,-123.19 444.36,-117.23 442.56,-123.99"/>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node12 -->
-<g id="edge15_Node000012_Node000012" class="edge">
-<title>Node12&#45;&gt;Node12</title>
-<g id="a_edge15_Node000012_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M481.86,-81.07C479.26,-90.55 488.38,-98.75 509.25,-98.75 521.31,-98.75 529.45,-96.01 533.67,-91.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="536.96,-93.1 536.23,-82.53 530.21,-91.24 536.96,-93.1"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node13 -->
-<g id="edge17_Node000013_Node000013" class="edge">
-<title>Node13&#45;&gt;Node13</title>
-<g id="a_edge17_Node000013_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M481.86,-159.07C479.26,-168.55 488.38,-176.75 509.25,-176.75 521.31,-176.75 529.45,-174.01 533.67,-169.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="536.96,-171.1 536.23,-160.53 530.21,-169.24 536.96,-171.1"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" target="_top" xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="white" stroke="#666666" points="415.38,-373.75 306.38,-373.75 306.38,-332 415.38,-332 415.38,-373.75"/>
-<text text-anchor="start" x="314.38" y="-360.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="314.38" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="360.88" y="-337.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node15 -->
-<g id="edge20_Node000014_Node000015" class="edge">
-<title>Node14&#45;&gt;Node15</title>
-<g id="a_edge20_Node000014_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.17,-334.51C276.22,-336.3 285.7,-338.18 295,-340.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.23,-343.44 304.72,-341.95 295.59,-336.57 294.23,-343.44"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" target="_top" xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="white" stroke="#666666" points="415.38,-433.75 306.38,-433.75 306.38,-392 415.38,-392 415.38,-433.75"/>
-<text text-anchor="start" x="314.38" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="314.38" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="360.88" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node17 -->
-<g id="edge23_Node000014_Node000017" class="edge">
-<title>Node14&#45;&gt;Node17</title>
-<g id="a_edge23_Node000014_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M246.07,-345.12C252.98,-349.65 260.24,-354.41 267,-358.88 283.05,-369.47 286.47,-373.04 303,-382.88 304.83,-383.97 306.71,-385.06 308.62,-386.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="306.53,-389 316.96,-390.83 309.95,-382.89 306.53,-389"/>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node7 -->
-<g id="edge21_Node000015_Node000007" class="edge">
-<title>Node15&#45;&gt;Node7</title>
-<g id="a_edge21_Node000015_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M403.43,-331.51C408.63,-328.68 413.84,-325.75 418.75,-322.88 434.87,-313.43 452.18,-302.42 467.25,-292.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="469.11,-295.51 475.53,-287.08 465.25,-289.67 469.11,-295.51"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="538.62,-362.5 479.88,-362.5 479.88,-343.25 538.62,-343.25 538.62,-362.5"/>
-<text text-anchor="middle" x="509.25" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge22_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge22_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.55,-352.88C433.01,-352.88 452.08,-352.88 468.35,-352.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="468.13,-356.38 478.13,-352.88 468.13,-349.38 468.13,-356.38"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="563.75,-433.75 454.75,-433.75 454.75,-392 563.75,-392 563.75,-433.75"/>
-<text text-anchor="start" x="462.75" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="462.75" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="509.25" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node17&#45;&gt;Node18 -->
-<g id="edge24_Node000017_Node000018" class="edge">
-<title>Node17&#45;&gt;Node18</title>
-<g id="a_edge24_Node000017_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M415.55,-412.88C424.6,-412.88 434.08,-412.88 443.37,-412.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="443.07,-416.38 453.07,-412.88 443.07,-409.38 443.07,-416.38"/>
-</a>
-</g>
-</g>
-<!-- Node19&#45;&gt;Node20 -->
-<g id="edge26_Node000019_Node000020" class="edge">
-<title>Node19&#45;&gt;Node20</title>
-<g id="a_edge26_Node000019_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.17,-529.04C279.79,-531.2 293.25,-533.5 305.88,-535.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.26,-539.1 315.71,-537.33 306.44,-532.2 305.26,-539.1"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" target="_top" xlink:title="Update the value at a node.">
-<polygon fill="white" stroke="#666666" points="415.38,-638.75 306.38,-638.75 306.38,-597 415.38,-597 415.38,-638.75"/>
-<text text-anchor="start" x="314.38" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="314.38" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="360.88" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::update</text>
-</a>
-</g>
-</g>
-<!-- Node21&#45;&gt;Node22 -->
-<g id="edge29_Node000021_Node000022" class="edge">
-<title>Node21&#45;&gt;Node22</title>
-<g id="a_edge29_Node000021_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M267.17,-617.88C276.22,-617.88 285.7,-617.88 295,-617.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.69,-621.38 304.69,-617.88 294.69,-614.38 294.69,-621.38"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node4 -->
-<g id="edge31_Node000023_Node000004" class="edge">
-<title>Node23&#45;&gt;Node4</title>
-<g id="a_edge31_Node000023_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.76,-497.88C114.44,-495.3 118.39,-492.51 122,-489.88 139.66,-477 159.01,-462.37 175.17,-449.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.29,-452.78 183.09,-443.91 173.03,-447.23 177.29,-452.78"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node5 -->
-<g id="edge33_Node000023_Node000005" class="edge">
-<title>Node23&#45;&gt;Node5</title>
-<g id="a_edge33_Node000023_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.01,-517.87C117,-520.18 119.83,-522.86 122,-525.88 155.02,-571.76 112.72,-614.03 158,-647.88 196.8,-676.88 228.2,-676.88 267,-647.88 312.28,-614.03 274.57,-574.74 303,-525.88 312.24,-510 326.62,-495.13 338.61,-484.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="340.79,-487.03 346.05,-477.83 336.2,-481.75 340.79,-487.03"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node6 -->
-<g id="edge32_Node000023_Node000006" class="edge">
-<title>Node23&#45;&gt;Node6</title>
-<g id="a_edge32_Node000023_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.53,-497.85C117.4,-495.57 120.05,-492.9 122,-489.88 169.88,-415.37 121.55,-374.6 158,-293.88 164.19,-280.16 173.74,-266.76 183.06,-255.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.53,-258.02 189.43,-248.17 180.24,-253.44 185.53,-258.02"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node14 -->
-<g id="edge34_Node000023_Node000014" class="edge">
-<title>Node23&#45;&gt;Node14</title>
-<g id="a_edge34_Node000023_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.85,-497.76C116.86,-495.46 119.74,-492.81 122,-489.88 150.32,-453.12 135.37,-432.39 158,-391.88 165.46,-378.53 175.44,-365.04 184.76,-353.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.31,-356.05 191.07,-346.14 181.95,-351.55 187.31,-356.05"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node19 -->
-<g id="edge35_Node000023_Node000019" class="edge">
-<title>Node23&#45;&gt;Node19</title>
-<g id="a_edge35_Node000023_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.12,-510.05C125.59,-510.93 135.89,-512 146.52,-513.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.85,-516.56 156.16,-514.11 146.57,-509.6 145.85,-516.56"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node20 -->
-<g id="edge36_Node000023_Node000020" class="edge">
-<title>Node23&#45;&gt;Node20</title>
-<g id="a_edge36_Node000023_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.42,-517.97C117.3,-520.25 119.98,-522.89 122,-525.88 161.61,-584.46 102.62,-636.89 158,-680.88 195.93,-711.01 227.04,-708.26 267,-680.88 303.56,-655.82 276.3,-623.26 303,-587.88 310.91,-577.39 322.03,-568.21 332.35,-561.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.13,-564.07 340.59,-555.67 330.3,-558.21 334.13,-564.07"/>
-</a>
-</g>
-</g>
-<!-- Node23&#45;&gt;Node21 -->
-<g id="edge37_Node000023_Node000021" class="edge">
-<title>Node23&#45;&gt;Node21</title>
-<g id="a_edge37_Node000023_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.56,-517.8C115.89,-520.22 119.21,-522.95 122,-525.88 142.69,-547.55 136.98,-561.52 158,-582.88 160.38,-585.29 162.95,-587.62 165.63,-589.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.23,-592.44 173.29,-595.77 167.5,-586.89 163.23,-592.44"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node4 -->
-<g id="edge39_Node000024_Node000004" class="edge">
-<title>Node24&#45;&gt;Node4</title>
-<g id="a_edge39_Node000024_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.12,-462C126.85,-457.86 138.98,-452.71 151.27,-447.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="152.35,-450.83 160.19,-443.69 149.61,-444.38 152.35,-450.83"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node5 -->
-<g id="edge41_Node000024_Node000005" class="edge">
-<title>Node24&#45;&gt;Node5</title>
-<g id="a_edge41_Node000024_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.94,-470.56C154.03,-470 233.41,-468.79 291.36,-467.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="291.19,-471.42 301.14,-467.77 291.09,-464.42 291.19,-471.42"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node6 -->
-<g id="edge40_Node000024_Node000006" class="edge">
-<title>Node24&#45;&gt;Node6</title>
-<g id="a_edge40_Node000024_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M101.48,-461.13C107.06,-450.47 115.92,-432.79 122,-416.88 142.32,-363.66 131.92,-344.51 158,-293.88 164.95,-280.39 174.74,-266.96 184.05,-255.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="186.56,-258.09 190.37,-248.21 181.23,-253.56 186.56,-258.09"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node14 -->
-<g id="edge42_Node000024_Node000014" class="edge">
-<title>Node24&#45;&gt;Node14</title>
-<g id="a_edge42_Node000024_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.85,-461.14C115.49,-446.22 138.45,-416.81 158,-391.88 167.73,-379.47 178.47,-365.81 187.76,-354"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.48,-356.21 193.92,-346.19 184.98,-351.88 190.48,-356.21"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node19 -->
-<g id="edge43_Node000024_Node000019" class="edge">
-<title>Node24&#45;&gt;Node19</title>
-<g id="a_edge43_Node000024_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.12,-479.75C126.85,-483.89 138.98,-489.04 151.27,-494.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="149.61,-497.37 160.19,-498.06 152.35,-490.92 149.61,-497.37"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node20 -->
-<g id="edge44_Node000024_Node000020" class="edge">
-<title>Node24&#45;&gt;Node20</title>
-<g id="a_edge44_Node000024_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.9,-480.94C116.13,-483.31 119.33,-485.99 122,-488.88 143.39,-511.97 130.66,-534.27 158,-549.88 207.19,-577.96 274.7,-568.61 317.81,-557.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.51,-561.32 327.29,-555.38 316.73,-554.55 318.51,-561.32"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node21 -->
-<g id="edge45_Node000024_Node000021" class="edge">
-<title>Node24&#45;&gt;Node21</title>
-<g id="a_edge45_Node000024_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M113.55,-480.81C116.66,-483.16 119.65,-485.87 122,-488.88 149.54,-524.13 129.92,-548.05 158,-582.88 159.8,-585.11 161.78,-587.24 163.88,-589.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="161.49,-591.84 171.37,-595.67 166.03,-586.51 161.49,-591.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dc3/fibonacci__sum_8cpp_aadb40ac4c74a7efc0680b83eeee138aa_cgraph.map b/de/dc3/fibonacci__sum_8cpp_aadb40ac4c74a7efc0680b83eeee138aa_cgraph.map
deleted file mode 100644
index 81f54fada..000000000
--- a/de/dc3/fibonacci__sum_8cpp_aadb40ac4c74a7efc0680b83eeee138aa_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="math::fibonacci_sum::result" name="math::fibonacci_sum::result">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,148,70"/>
-<area shape="poly" id="edge3_Node000001_Node000001" title=" " alt="" coords="40,29,38,19,44,10,57,5,77,3,97,5,110,11,107,16,96,10,76,8,59,10,48,15,44,20,45,28"/>
-<area shape="rect" id="Node000002" href="$de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311" title=" " alt="" coords="196,29,338,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="148,47,180,47,180,52,148,52"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="230,29,229,19,235,10,248,5,267,3,288,5,300,11,298,16,286,10,267,8,249,10,238,15,234,20,236,28"/>
-</map>
diff --git a/de/dc3/fibonacci__sum_8cpp_aadb40ac4c74a7efc0680b83eeee138aa_cgraph.md5 b/de/dc3/fibonacci__sum_8cpp_aadb40ac4c74a7efc0680b83eeee138aa_cgraph.md5
deleted file mode 100644
index 24d207907..000000000
--- a/de/dc3/fibonacci__sum_8cpp_aadb40ac4c74a7efc0680b83eeee138aa_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9adfa4c5873007f3f969baec2b6b4b9d
\ No newline at end of file
diff --git a/de/dc3/fibonacci__sum_8cpp_aadb40ac4c74a7efc0680b83eeee138aa_cgraph.svg b/de/dc3/fibonacci__sum_8cpp_aadb40ac4c74a7efc0680b83eeee138aa_cgraph.svg
deleted file mode 100644
index 93414705a..000000000
--- a/de/dc3/fibonacci__sum_8cpp_aadb40ac4c74a7efc0680b83eeee138aa_cgraph.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::fibonacci_sum::result Pages: 1 -->
-<svg width="258pt" height="57pt"
- viewBox="0.00 0.00 257.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::fibonacci_sum::result</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="106.75,-30.5 0,-30.5 0,0 106.75,0 106.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::fibonacci_sum</text>
-<text text-anchor="middle" x="53.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::result</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.08,-30.99C22.92,-40.06 31.35,-48.5 53.38,-48.5 65.42,-48.5 73.4,-45.97 77.31,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.76,-42.84 78.49,-32.49 73.81,-42 80.76,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-30.5 142.75,-30.5 142.75,0 249.5,0 249.5,-30.5"/>
-<text text-anchor="start" x="150.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::fibonacci_sum</text>
-<text text-anchor="middle" x="196.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::power</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.19,-15.25C115.03,-15.25 123.19,-15.25 131.23,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.97,-18.75 140.97,-15.25 130.97,-11.75 130.97,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.83,-30.99C165.67,-40.06 174.1,-48.5 196.12,-48.5 208.17,-48.5 216.15,-45.97 220.06,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="223.51,-42.84 221.24,-32.49 216.56,-42 223.51,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dc3/fibonacci__sum_8cpp_aadb40ac4c74a7efc0680b83eeee138aa_cgraph_org.svg b/de/dc3/fibonacci__sum_8cpp_aadb40ac4c74a7efc0680b83eeee138aa_cgraph_org.svg
deleted file mode 100644
index de93fa7e2..000000000
--- a/de/dc3/fibonacci__sum_8cpp_aadb40ac4c74a7efc0680b83eeee138aa_cgraph_org.svg
+++ /dev/null
@@ -1,59 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::fibonacci_sum::result Pages: 1 -->
-<svg width="258pt" height="57pt"
- viewBox="0.00 0.00 257.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::fibonacci_sum::result</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="106.75,-30.5 0,-30.5 0,0 106.75,0 106.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::fibonacci_sum</text>
-<text text-anchor="middle" x="53.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::result</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.08,-30.99C22.92,-40.06 31.35,-48.5 53.38,-48.5 65.42,-48.5 73.4,-45.97 77.31,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="80.76,-42.84 78.49,-32.49 73.81,-42 80.76,-42.84"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="249.5,-30.5 142.75,-30.5 142.75,0 249.5,0 249.5,-30.5"/>
-<text text-anchor="start" x="150.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::fibonacci_sum</text>
-<text text-anchor="middle" x="196.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::power</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.19,-15.25C115.03,-15.25 123.19,-15.25 131.23,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.97,-18.75 140.97,-15.25 130.97,-11.75 130.97,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M170.83,-30.99C165.67,-40.06 174.1,-48.5 196.12,-48.5 208.17,-48.5 216.15,-45.97 220.06,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="223.51,-42.84 221.24,-32.49 216.56,-42 223.51,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dc3/fibonacci__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/dc3/fibonacci__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 170f40177..000000000
--- a/de/dc3/fibonacci__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,73 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,277,55,303"/>
-<area shape="rect" id="Node000002" href="$de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title=" " alt="" coords="103,277,146,303"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,288,87,288,87,293,55,293"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,203,265,228"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="142,275,192,237,195,236,198,240,196,242,145,279"/>
-<area shape="rect" id="Node000004" href="$d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" title=" " alt="" coords="201,399,258,424"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="139,302,210,385,205,389,135,305"/>
-<area shape="rect" id="Node000024" href="$d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d" title=" " alt="" coords="201,252,258,278"/>
-<area shape="poly" id="edge31_Node000002_Node000024" title=" " alt="" coords="146,283,185,273,186,278,147,288"/>
-<area shape="rect" id="Node000025" href="$d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a" title=" " alt="" coords="201,301,258,327"/>
-<area shape="poly" id="edge39_Node000002_Node000025" title=" " alt="" coords="147,293,186,302,185,307,146,298"/>
-<area shape="rect" id="Node000005" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" title="Adds an undirected edge from node u to node v in the tree." alt="" coords="313,352,459,407"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="258,403,297,395,299,400,259,408"/>
-<area shape="rect" id="Node000006" 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="507,307,661,332"/>
-<area shape="poly" id="edge19_Node000004_Node000006" title=" " alt="" coords="237,424,246,452,261,487,284,521,315,548,353,567,388,575,422,569,457,548,477,527,485,505,487,481,485,456,482,430,482,404,488,377,505,350,517,339,521,343,509,353,493,379,487,404,487,430,490,456,492,481,491,506,481,530,460,552,423,574,388,580,352,572,312,553,280,525,256,490,241,454,232,426"/>
-<area shape="rect" id="Node000007" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" title="This function must be called after the tree adjacency list and node values are populated The function..." alt="" coords="313,613,459,669"/>
-<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="237,424,262,501,285,548,315,593,324,602,320,605,311,596,280,551,257,503,232,426"/>
-<area shape="rect" id="Node000015" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" title="This function returns the sum of node values in the simple path from from node_1 to node_2." alt="" coords="313,482,459,538"/>
-<area shape="poly" id="edge20_Node000004_Node000015" title=" " alt="" coords="253,423,329,471,326,476,250,427"/>
-<area shape="rect" id="Node000020" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" title="Set the values for all the nodes." alt="" coords="313,221,459,277"/>
-<area shape="poly" id="edge26_Node000004_Node000020" title=" " alt="" coords="242,397,346,286,350,290,246,400"/>
-<area shape="rect" id="Node000021" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="526,203,642,228"/>
-<area shape="poly" id="edge28_Node000004_Node000021" title=" " alt="" coords="260,420,301,432,353,440,408,437,434,430,457,417,472,405,480,392,486,363,490,330,495,312,504,293,528,262,553,237,557,241,532,266,509,296,500,314,495,331,492,364,485,394,476,408,460,422,436,435,409,443,353,445,300,437,258,425"/>
-<area shape="rect" id="Node000022" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" title="This function updates the value at node with val." alt="" coords="313,90,459,146"/>
-<area shape="poly" id="edge29_Node000004_Node000022" title=" " alt="" coords="235,397,263,339,284,272,294,243,311,208,347,156,351,160,316,210,299,245,290,274,268,341,240,400"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="458,355,524,335,525,340,460,360"/>
-<area shape="rect" id="Node000008" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" title="Function that specifies the type of operation involved when segments are combined." alt="" coords="709,561,854,617"/>
-<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="459,634,555,626,661,613,693,607,694,612,661,618,556,632,459,640"/>
-<area shape="rect" id="Node000009" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)" alt="" coords="511,886,656,942"/>
-<area shape="poly" id="edge8_Node000007_Node000009" title=" " alt="" coords="402,668,444,753,474,802,509,849,534,874,530,878,505,852,470,805,440,755,397,671"/>
-<area shape="rect" id="Node000010" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" title="Utility function to lable the nodes so that heavy chains have a contigous lable." alt="" coords="511,548,656,603"/>
-<area shape="poly" id="edge10_Node000007_Node000010" title=" " alt="" coords="458,615,496,602,497,607,460,620"/>
-<area shape="rect" id="Node000011" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" title="Utility function to assign highest parent that can be reached though heavy chains." alt="" coords="511,702,656,758"/>
-<area shape="poly" id="edge12_Node000007_Node000011" title=" " alt="" coords="450,667,508,693,506,698,448,672"/>
-<area shape="rect" id="Node000012" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" title="This function must be called after the tree adjacency list and node values are populated The function..." alt="" coords="511,782,656,838"/>
-<area shape="poly" id="edge14_Node000007_Node000012" title=" " alt="" coords="411,668,453,717,508,768,513,772,510,776,505,772,450,721,407,671"/>
-<area shape="poly" id="edge9_Node000009_Node000009" title=" " alt="" coords="545,886,545,876,552,867,565,862,584,860,605,862,618,869,615,874,603,868,584,865,567,867,555,872,550,878,550,886"/>
-<area shape="poly" id="edge11_Node000010_Node000010" title=" " alt="" coords="545,547,545,537,552,529,565,523,584,521,605,524,618,531,615,535,603,529,584,526,567,528,555,533,550,539,550,547"/>
-<area shape="poly" id="edge13_Node000011_Node000011" title=" " alt="" coords="545,702,545,692,552,683,565,678,584,676,605,678,618,685,615,690,603,684,584,681,567,683,555,688,550,694,550,702"/>
-<area shape="rect" id="Node000013" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" title="Utility function to populate the t_par vector." alt="" coords="709,834,854,890"/>
-<area shape="poly" id="edge15_Node000012_Node000013" title=" " alt="" coords="657,827,695,837,694,842,656,832"/>
-<area shape="rect" id="Node000014" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" title="Utility function to compute sub&#45;tree sizes." alt="" coords="709,730,854,786"/>
-<area shape="poly" id="edge17_Node000012_Node000014" title=" " alt="" coords="656,789,694,779,695,784,657,794"/>
-<area shape="poly" id="edge16_Node000013_Node000013" title=" " alt="" coords="742,834,743,824,750,815,763,810,782,808,803,810,815,817,813,822,801,816,782,813,764,815,753,820,748,826,748,834"/>
-<area shape="poly" id="edge18_Node000014_Node000014" title=" " alt="" coords="742,730,743,720,750,711,763,706,782,704,803,706,815,713,813,718,801,712,782,709,764,711,753,716,748,722,748,730"/>
-<area shape="rect" id="Node000016" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" title="Utility function to break down a path query into two chain queries." alt="" coords="511,444,656,499"/>
-<area shape="poly" id="edge21_Node000015_Node000016" title=" " alt="" coords="458,494,495,486,497,491,459,499"/>
-<area shape="rect" id="Node000018" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" title="The function returns the least common ancestor of two nodes." alt="" coords="511,364,656,419"/>
-<area shape="poly" id="edge24_Node000015_Node000018" title=" " alt="" coords="429,480,457,461,505,429,513,425,516,430,508,434,460,466,432,484"/>
-<area shape="poly" id="edge22_Node000016_Node000008" title=" " alt="" coords="642,498,662,509,727,550,724,554,660,514,639,502"/>
-<area shape="rect" id="Node000017" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="742,459,821,484"/>
-<area shape="poly" id="edge23_Node000016_Node000017" title=" " alt="" coords="657,469,727,469,727,474,657,474"/>
-<area shape="rect" id="Node000019" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store..." alt="" coords="709,364,854,419"/>
-<area shape="poly" id="edge25_Node000018_Node000019" title=" " alt="" coords="657,389,694,389,694,394,657,394"/>
-<area shape="poly" id="edge27_Node000020_Node000021" title=" " alt="" coords="458,234,510,225,511,231,459,239"/>
-<area shape="rect" id="Node000023" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" title="Update the value at a node." alt="" coords="511,90,656,146"/>
-<area shape="poly" id="edge30_Node000022_Node000023" title=" " alt="" coords="459,116,496,116,496,121,459,121"/>
-<area shape="poly" id="edge32_Node000024_Node000005" title=" " alt="" coords="252,276,267,287,338,340,335,344,264,291,249,280"/>
-<area shape="poly" id="edge34_Node000024_Node000006" title=" " alt="" coords="253,250,263,239,275,217,280,196,281,154,281,133,284,113,294,94,312,76,350,54,386,47,422,54,460,76,479,94,489,113,493,132,494,152,494,194,499,216,509,240,531,269,556,295,552,298,527,273,504,242,494,218,489,195,488,152,488,133,484,115,474,97,457,80,420,59,386,52,352,59,315,80,298,97,289,115,286,134,286,154,286,196,280,219,267,243,257,254"/>
-<area shape="poly" id="edge33_Node000024_Node000007" title=" " alt="" coords="257,277,268,287,286,323,296,356,298,387,298,417,297,478,303,512,316,549,331,576,349,600,345,603,326,579,311,551,297,513,292,478,292,416,293,387,290,357,281,325,263,291,253,280"/>
-<area shape="poly" id="edge35_Node000024_Node000015" title=" " alt="" coords="256,277,267,287,287,321,295,352,301,383,316,418,351,469,347,472,311,421,296,384,290,353,282,323,263,291,253,280"/>
-<area shape="poly" id="edge36_Node000024_Node000020" title=" " alt="" coords="259,259,298,255,298,261,259,265"/>
-<area shape="poly" id="edge37_Node000024_Node000021" title=" " alt="" coords="253,250,263,239,277,211,282,184,279,131,277,105,280,80,290,55,312,32,349,10,385,3,422,11,460,32,475,46,484,60,490,91,494,123,499,140,509,157,527,176,547,192,544,196,523,180,505,160,494,142,488,124,485,92,479,62,471,49,457,36,420,16,385,8,351,15,315,36,294,58,285,81,282,105,284,130,287,184,282,213,268,243,257,253"/>
-<area shape="poly" id="edge38_Node000024_Node000022" title=" " alt="" coords="251,250,263,239,278,220,287,202,296,183,311,163,322,154,325,158,315,167,300,186,292,204,283,222,267,243,254,254"/>
-<area shape="poly" id="edge40_Node000025_Node000005" title=" " alt="" coords="260,324,305,343,303,348,258,329"/>
-<area shape="poly" id="edge42_Node000025_Node000006" title=" " alt="" coords="259,312,491,316,491,321,259,317"/>
-<area shape="poly" id="edge41_Node000025_Node000007" title=" " alt="" coords="240,326,268,385,282,432,289,469,298,505,316,549,350,600,346,603,311,552,292,507,284,470,277,433,263,387,236,328"/>
-<area shape="poly" id="edge43_Node000025_Node000015" title=" " alt="" coords="243,326,315,418,355,468,351,472,311,421,239,329"/>
-<area shape="poly" id="edge44_Node000025_Node000020" title=" " alt="" coords="258,300,303,281,305,286,260,305"/>
-<area shape="poly" id="edge45_Node000025_Node000021" title=" " alt="" coords="251,299,263,289,277,266,284,245,292,225,312,207,338,195,366,187,423,182,478,186,527,196,526,201,478,191,423,187,367,192,340,200,315,211,297,228,289,247,282,269,267,292,255,303"/>
-<area shape="poly" id="edge46_Node000025_Node000022" title=" " alt="" coords="252,299,263,289,281,257,286,227,293,197,311,163,319,155,323,158,315,167,298,198,292,228,286,258,267,292,256,303"/>
-</map>
diff --git a/de/dc3/fibonacci__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/dc3/fibonacci__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index e655e19e2..000000000
--- a/de/dc3/fibonacci__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-798bc8dc1fc6b328afc5a36dece8545c
\ No newline at end of file
diff --git a/de/dc3/fibonacci__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/dc3/fibonacci__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 89b58f655..000000000
--- a/de/dc3/fibonacci__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,766 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 711 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 645;
-var viewHeight = 711;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-498.5 0,-498.5 0,-479.25 37,-479.25 37,-498.5"/>
-<text text-anchor="middle" x="18.5" y="-485" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-498.5 73,-498.5 73,-479.25 105.5,-479.25 105.5,-498.5"/>
-<text text-anchor="middle" x="89.25" y="-485" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-488.88C44.58,-488.88 53.31,-488.88 61.45,-488.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-492.38 71.2,-488.88 61.2,-485.38 61.2,-492.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-554.5 141.5,-554.5 141.5,-535.25 195,-535.25 195,-554.5"/>
-<text text-anchor="middle" x="168.25" y="-541" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.66,-498.98C113.96,-506.7 128.56,-517.55 141.5,-526.88 142.18,-527.37 142.87,-527.86 143.57,-528.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.34,-531.07 151.53,-533.98 145.38,-525.35 141.34,-531.07"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.75,-407.5 146.75,-407.5 146.75,-388.25 189.75,-388.25 189.75,-407.5"/>
-<text text-anchor="middle" x="168.25" y="-394" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.78,-478.79C111.51,-463.75 135.68,-435.19 151.63,-416.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.15,-418.78 157.93,-408.89 148.8,-414.26 154.15,-418.78"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.75,-517.5 146.75,-517.5 146.75,-498.25 189.75,-498.25 189.75,-517.5"/>
-<text text-anchor="middle" x="168.25" y="-504" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node24 -->
-<g id="edge31_Node000002_Node000024" class="edge">
-<title>Node2&#45;&gt;Node24</title>
-<g id="a_edge31_Node000002_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-492.72C114.33,-494.82 125.16,-497.49 135.35,-500"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.42,-503.38 144.97,-502.38 136.1,-496.58 134.42,-503.38"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.75,-480.5 146.75,-480.5 146.75,-461.25 189.75,-461.25 189.75,-480.5"/>
-<text text-anchor="middle" x="168.25" y="-467" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node25 -->
-<g id="edge39_Node000002_Node000025" class="edge">
-<title>Node2&#45;&gt;Node25</title>
-<g id="a_edge39_Node000002_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-485.23C114.33,-483.25 125.16,-480.71 135.35,-478.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.02,-481.77 144.96,-476.09 134.43,-474.95 136.02,-481.77"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" target="_top" xlink:title="Adds an undirected edge from node u to node v in the tree.">
-<polygon fill="white" stroke="#666666" points="340,-442.75 231,-442.75 231,-401 340,-401 340,-442.75"/>
-<text text-anchor="start" x="239" y="-429.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="239" y="-418" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="285.5" y="-406.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.12,-402.22C198.59,-403.99 208.89,-406.13 219.52,-408.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.68,-411.74 229.18,-410.35 220.1,-404.89 218.68,-411.74"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="491.75,-476.5 376,-476.5 376,-457.25 491.75,-457.25 491.75,-476.5"/>
-<text text-anchor="middle" x="433.88" y="-463" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge19_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge19_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M171.67,-387.78C177.52,-365.92 194.68,-314.55 231,-293.88 273.1,-269.91 301.93,-263.91 340,-293.88 393.53,-336.01 331.89,-390.96 376,-442.88 378.69,-446.04 381.87,-448.8 385.33,-451.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="383.28,-454.06 393.69,-456 386.76,-447.99 383.28,-454.06"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="340,-246.75 231,-246.75 231,-205 340,-205 340,-246.75"/>
-<text text-anchor="start" x="239" y="-233.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="239" y="-222" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="285.5" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::init</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M171.67,-387.87C177.92,-363.69 196.58,-301.13 231,-260.88 233.03,-258.5 235.26,-256.23 237.62,-254.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.39,-257.13 244.88,-248.07 234.94,-251.73 239.39,-257.13"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" target="_top" xlink:title="This function returns the sum of node values in the simple path from from node_1 to node_2.">
-<polygon fill="white" stroke="#666666" points="340,-344.75 231,-344.75 231,-303 340,-303 340,-344.75"/>
-<text text-anchor="start" x="239" y="-331.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="239" y="-320" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="285.5" y="-308.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::query</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node15 -->
-<g id="edge20_Node000004_Node000015" class="edge">
-<title>Node4&#45;&gt;Node15</title>
-<g id="a_edge20_Node000004_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.79,-387.9C199.37,-378.54 221.84,-364.11 241.76,-351.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.49,-354.37 250.01,-346.02 239.71,-348.48 243.49,-354.37"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" target="_top" xlink:title="Set the values for all the nodes.">
-<polygon fill="white" stroke="#666666" points="340,-540.75 231,-540.75 231,-499 340,-499 340,-540.75"/>
-<text text-anchor="start" x="239" y="-527.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="239" y="-516" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="285.5" y="-504.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::set_node_val</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node20 -->
-<g id="edge26_Node000004_Node000020" class="edge">
-<title>Node4&#45;&gt;Node20</title>
-<g id="a_edge26_Node000004_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M178.68,-407.86C195.56,-425.73 231.54,-463.81 256.84,-490.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.19,-492.89 263.6,-497.75 259.28,-488.08 254.19,-492.89"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="477.12,-554.5 390.62,-554.5 390.62,-535.25 477.12,-535.25 477.12,-554.5"/>
-<text text-anchor="middle" x="433.88" y="-541" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node21 -->
-<g id="edge28_Node000004_Node000021" class="edge">
-<title>Node4&#45;&gt;Node21</title>
-<g id="a_edge28_Node000004_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.09,-389.86C224.63,-378.04 294.42,-360.52 340,-391.88 376.86,-417.23 351.99,-448.12 376,-485.88 385.98,-501.56 400.59,-516.61 412.5,-527.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="410.04,-530.08 419.84,-534.11 414.7,-524.85 410.04,-530.08"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" target="_top" xlink:title="This function updates the value at node with val.">
-<polygon fill="white" stroke="#666666" points="340,-638.75 231,-638.75 231,-597 340,-597 340,-638.75"/>
-<text text-anchor="start" x="239" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="239" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="285.5" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::update</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node22 -->
-<g id="edge29_Node000004_Node000022" class="edge">
-<title>Node4&#45;&gt;Node22</title>
-<g id="a_edge29_Node000004_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.28,-407.7C179.68,-418.43 188.39,-436.18 195,-451.88 213.01,-494.64 208.37,-509.36 231,-549.88 238.46,-563.22 248.44,-576.71 257.76,-588.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.95,-590.2 264.07,-595.61 260.31,-585.7 254.95,-590.2"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.17,-438.38C356.32,-443.34 373.84,-448.73 389.26,-453.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="388.03,-456.75 398.62,-456.34 390.09,-450.06 388.03,-456.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="636.75,-285.75 527.75,-285.75 527.75,-244 636.75,-244 636.75,-285.75"/>
-<text text-anchor="start" x="535.75" y="-272.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="535.75" y="-261" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="582.25" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.32,-228.97C381.86,-231.82 440.67,-236.84 491.75,-244.88 499.75,-246.13 508.11,-247.68 516.36,-249.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="515.52,-252.76 526.03,-251.39 516.96,-245.91 515.52,-252.76"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" target="_top" xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="white" stroke="#666666" points="488.38,-41.75 379.38,-41.75 379.38,0 488.38,0 488.38,-41.75"/>
-<text text-anchor="start" x="387.38" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="387.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="433.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M295.69,-204.59C309.98,-172.94 339.68,-112.53 376,-68.88 381.69,-62.03 388.44,-55.39 395.27,-49.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="397.37,-52.16 402.72,-43.01 392.84,-46.82 397.37,-52.16"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" target="_top" xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="white" stroke="#666666" points="488.38,-295.75 379.38,-295.75 379.38,-254 488.38,-254 488.38,-295.75"/>
-<text text-anchor="start" x="387.38" y="-282.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="387.38" y="-271" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="433.88" y="-259.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node10 -->
-<g id="edge10_Node000007_Node000010" class="edge">
-<title>Node7&#45;&gt;Node10</title>
-<g id="a_edge10_Node000007_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.17,-243.84C349.32,-246.91 358.91,-250.11 368.3,-253.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="367.18,-256.57 377.77,-256.43 369.4,-249.94 367.18,-256.57"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" target="_top" xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="white" stroke="#666666" points="488.38,-179.75 379.38,-179.75 379.38,-138 488.38,-138 488.38,-179.75"/>
-<text text-anchor="start" x="387.38" y="-166.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="387.38" y="-155" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="433.88" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node11 -->
-<g id="edge12_Node000007_Node000011" class="edge">
-<title>Node7&#45;&gt;Node11</title>
-<g id="a_edge12_Node000007_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M332.81,-204.68C346.56,-198.38 361.78,-191.42 376.11,-184.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="377.35,-188.14 384.98,-180.8 374.43,-181.78 377.35,-188.14"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="488.38,-119.75 379.38,-119.75 379.38,-78 488.38,-78 488.38,-119.75"/>
-<text text-anchor="start" x="387.38" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="387.38" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="433.88" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node12 -->
-<g id="edge14_Node000007_Node000012" class="edge">
-<title>Node7&#45;&gt;Node12</title>
-<g id="a_edge14_Node000007_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.56,-204.61C319.24,-183.53 346.94,-151.22 376,-128.88 377.12,-128.01 378.27,-127.16 379.44,-126.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="381.08,-129.44 387.51,-121.01 377.23,-123.59 381.08,-129.44"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node9 -->
-<g id="edge9_Node000009_Node000009" class="edge">
-<title>Node9&#45;&gt;Node9</title>
-<g id="a_edge9_Node000009_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M406.49,-42.07C403.88,-51.55 413.01,-59.75 433.88,-59.75 445.94,-59.75 454.08,-57.01 458.29,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="461.59,-54.1 460.86,-43.53 454.84,-52.24 461.59,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node10 -->
-<g id="edge11_Node000010_Node000010" class="edge">
-<title>Node10&#45;&gt;Node10</title>
-<g id="a_edge11_Node000010_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M406.49,-296.07C403.88,-305.55 413.01,-313.75 433.88,-313.75 445.94,-313.75 454.08,-311.01 458.29,-306.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="461.59,-308.1 460.86,-297.53 454.84,-306.24 461.59,-308.1"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node11 -->
-<g id="edge13_Node000011_Node000011" class="edge">
-<title>Node11&#45;&gt;Node11</title>
-<g id="a_edge13_Node000011_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M406.49,-180.07C403.88,-189.55 413.01,-197.75 433.88,-197.75 445.94,-197.75 454.08,-195.01 458.29,-190.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="461.59,-192.1 460.86,-181.53 454.84,-190.24 461.59,-192.1"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="636.75,-80.75 527.75,-80.75 527.75,-39 636.75,-39 636.75,-80.75"/>
-<text text-anchor="start" x="535.75" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="535.75" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="582.25" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge15_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge15_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M488.55,-84.57C497.7,-82.14 507.28,-79.58 516.68,-77.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="517.36,-80.52 526.12,-74.56 515.56,-73.76 517.36,-80.52"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="636.75,-158.75 527.75,-158.75 527.75,-117 636.75,-117 636.75,-158.75"/>
-<text text-anchor="start" x="535.75" y="-145.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="535.75" y="-134" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="582.25" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node14 -->
-<g id="edge17_Node000012_Node000014" class="edge">
-<title>Node12&#45;&gt;Node14</title>
-<g id="a_edge17_Node000012_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M488.55,-113.18C497.7,-115.61 507.28,-118.17 516.68,-120.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="515.56,-123.99 526.12,-123.19 517.36,-117.23 515.56,-123.99"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node13 -->
-<g id="edge16_Node000013_Node000013" class="edge">
-<title>Node13&#45;&gt;Node13</title>
-<g id="a_edge16_Node000013_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M554.86,-81.07C552.26,-90.55 561.38,-98.75 582.25,-98.75 594.31,-98.75 602.45,-96.01 606.67,-91.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="609.96,-93.1 609.23,-82.53 603.21,-91.24 609.96,-93.1"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node14 -->
-<g id="edge18_Node000014_Node000014" class="edge">
-<title>Node14&#45;&gt;Node14</title>
-<g id="a_edge18_Node000014_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M554.86,-159.07C552.26,-168.55 561.38,-176.75 582.25,-176.75 594.31,-176.75 602.45,-174.01 606.67,-169.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="609.96,-171.1 609.23,-160.53 603.21,-169.24 609.96,-171.1"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" target="_top" xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="white" stroke="#666666" points="488.38,-373.75 379.38,-373.75 379.38,-332 488.38,-332 488.38,-373.75"/>
-<text text-anchor="start" x="387.38" y="-360.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="387.38" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="433.88" y="-337.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge21_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge21_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.17,-334.51C349.22,-336.3 358.7,-338.18 368,-340.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="367.23,-343.44 377.72,-341.95 368.59,-336.57 367.23,-343.44"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" target="_top" xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="white" stroke="#666666" points="488.38,-433.75 379.38,-433.75 379.38,-392 488.38,-392 488.38,-433.75"/>
-<text text-anchor="start" x="387.38" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="387.38" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="433.88" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node18 -->
-<g id="edge24_Node000015_Node000018" class="edge">
-<title>Node15&#45;&gt;Node18</title>
-<g id="a_edge24_Node000015_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M319.07,-345.12C325.98,-349.65 333.24,-354.41 340,-358.88 356.05,-369.47 359.47,-373.04 376,-382.88 377.83,-383.97 379.71,-385.06 381.62,-386.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.53,-389 389.96,-390.83 382.95,-382.89 379.53,-389"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node8 -->
-<g id="edge22_Node000016_Node000008" class="edge">
-<title>Node16&#45;&gt;Node8</title>
-<g id="a_edge22_Node000016_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M476.43,-331.51C481.63,-328.68 486.84,-325.75 491.75,-322.88 507.87,-313.43 525.18,-302.42 540.25,-292.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="542.11,-295.51 548.53,-287.08 538.25,-289.67 542.11,-295.51"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="611.62,-362.5 552.88,-362.5 552.88,-343.25 611.62,-343.25 611.62,-362.5"/>
-<text text-anchor="middle" x="582.25" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge23_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge23_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M488.55,-352.88C506.01,-352.88 525.08,-352.88 541.35,-352.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="541.13,-356.38 551.13,-352.88 541.13,-349.38 541.13,-356.38"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="636.75,-433.75 527.75,-433.75 527.75,-392 636.75,-392 636.75,-433.75"/>
-<text text-anchor="start" x="535.75" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="535.75" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="582.25" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node19 -->
-<g id="edge25_Node000018_Node000019" class="edge">
-<title>Node18&#45;&gt;Node19</title>
-<g id="a_edge25_Node000018_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M488.55,-412.88C497.6,-412.88 507.08,-412.88 516.37,-412.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="516.07,-416.38 526.07,-412.88 516.07,-409.38 516.07,-416.38"/>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node21 -->
-<g id="edge27_Node000020_Node000021" class="edge">
-<title>Node20&#45;&gt;Node21</title>
-<g id="a_edge27_Node000020_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.17,-529.04C352.79,-531.2 366.25,-533.5 378.88,-535.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="378.26,-539.1 388.71,-537.33 379.44,-532.2 378.26,-539.1"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" target="_top" xlink:title="Update the value at a node.">
-<polygon fill="white" stroke="#666666" points="488.38,-638.75 379.38,-638.75 379.38,-597 488.38,-597 488.38,-638.75"/>
-<text text-anchor="start" x="387.38" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="387.38" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="433.88" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::update</text>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node23 -->
-<g id="edge30_Node000022_Node000023" class="edge">
-<title>Node22&#45;&gt;Node23</title>
-<g id="a_edge30_Node000022_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.17,-617.88C349.22,-617.88 358.7,-617.88 368,-617.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="367.69,-621.38 377.69,-617.88 367.69,-614.38 367.69,-621.38"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node5 -->
-<g id="edge32_Node000024_Node000005" class="edge">
-<title>Node24&#45;&gt;Node5</title>
-<g id="a_edge32_Node000024_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.76,-497.88C187.44,-495.3 191.39,-492.51 195,-489.88 212.66,-477 232.01,-462.37 248.17,-449.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="250.29,-452.78 256.09,-443.91 246.03,-447.23 250.29,-452.78"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node6 -->
-<g id="edge34_Node000024_Node000006" class="edge">
-<title>Node24&#45;&gt;Node6</title>
-<g id="a_edge34_Node000024_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.01,-517.87C190,-520.18 192.83,-522.86 195,-525.88 228.02,-571.76 185.72,-614.03 231,-647.88 269.8,-676.88 301.2,-676.88 340,-647.88 385.28,-614.03 347.57,-574.74 376,-525.88 385.24,-510 399.62,-495.13 411.61,-484.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="413.79,-487.03 419.05,-477.83 409.2,-481.75 413.79,-487.03"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node7 -->
-<g id="edge33_Node000024_Node000007" class="edge">
-<title>Node24&#45;&gt;Node7</title>
-<g id="a_edge33_Node000024_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.53,-497.85C190.4,-495.57 193.05,-492.9 195,-489.88 242.88,-415.37 194.55,-374.6 231,-293.88 237.19,-280.16 246.74,-266.76 256.06,-255.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.53,-258.02 262.43,-248.17 253.24,-253.44 258.53,-258.02"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node15 -->
-<g id="edge35_Node000024_Node000015" class="edge">
-<title>Node24&#45;&gt;Node15</title>
-<g id="a_edge35_Node000024_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.85,-497.76C189.86,-495.46 192.74,-492.81 195,-489.88 223.32,-453.12 208.37,-432.39 231,-391.88 238.46,-378.53 248.44,-365.04 257.76,-353.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.31,-356.05 264.07,-346.14 254.95,-351.55 260.31,-356.05"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node20 -->
-<g id="edge36_Node000024_Node000020" class="edge">
-<title>Node24&#45;&gt;Node20</title>
-<g id="a_edge36_Node000024_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.12,-510.05C198.59,-510.93 208.89,-512 219.52,-513.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.85,-516.56 229.16,-514.11 219.57,-509.6 218.85,-516.56"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node21 -->
-<g id="edge37_Node000024_Node000021" class="edge">
-<title>Node24&#45;&gt;Node21</title>
-<g id="a_edge37_Node000024_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.42,-517.97C190.3,-520.25 192.98,-522.89 195,-525.88 234.61,-584.46 175.62,-636.89 231,-680.88 268.93,-711.01 300.04,-708.26 340,-680.88 376.56,-655.82 349.3,-623.26 376,-587.88 383.91,-577.39 395.03,-568.21 405.35,-561.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="407.13,-564.07 413.59,-555.67 403.3,-558.21 407.13,-564.07"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node22 -->
-<g id="edge38_Node000024_Node000022" class="edge">
-<title>Node24&#45;&gt;Node22</title>
-<g id="a_edge38_Node000024_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.56,-517.8C188.89,-520.22 192.21,-522.95 195,-525.88 215.69,-547.55 209.98,-561.52 231,-582.88 233.38,-585.29 235.95,-587.62 238.63,-589.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.23,-592.44 246.29,-595.77 240.5,-586.89 236.23,-592.44"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node5 -->
-<g id="edge40_Node000025_Node000005" class="edge">
-<title>Node25&#45;&gt;Node5</title>
-<g id="a_edge40_Node000025_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.12,-462C199.85,-457.86 211.98,-452.71 224.27,-447.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.35,-450.83 233.19,-443.69 222.61,-444.38 225.35,-450.83"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node6 -->
-<g id="edge42_Node000025_Node000006" class="edge">
-<title>Node25&#45;&gt;Node6</title>
-<g id="a_edge42_Node000025_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.94,-470.56C227.03,-470 306.41,-468.79 364.36,-467.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.19,-471.42 374.14,-467.77 364.09,-464.42 364.19,-471.42"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node7 -->
-<g id="edge41_Node000025_Node000007" class="edge">
-<title>Node25&#45;&gt;Node7</title>
-<g id="a_edge41_Node000025_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.48,-461.13C180.06,-450.47 188.92,-432.79 195,-416.88 215.32,-363.66 204.92,-344.51 231,-293.88 237.95,-280.39 247.74,-266.96 257.05,-255.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="259.56,-258.09 263.37,-248.21 254.23,-253.56 259.56,-258.09"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node15 -->
-<g id="edge43_Node000025_Node000015" class="edge">
-<title>Node25&#45;&gt;Node15</title>
-<g id="a_edge43_Node000025_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.85,-461.14C188.49,-446.22 211.45,-416.81 231,-391.88 240.73,-379.47 251.47,-365.81 260.76,-354"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="263.48,-356.21 266.92,-346.19 257.98,-351.88 263.48,-356.21"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node20 -->
-<g id="edge44_Node000025_Node000020" class="edge">
-<title>Node25&#45;&gt;Node20</title>
-<g id="a_edge44_Node000025_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.12,-479.75C199.85,-483.89 211.98,-489.04 224.27,-494.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.61,-497.37 233.19,-498.06 225.35,-490.92 222.61,-497.37"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node21 -->
-<g id="edge45_Node000025_Node000021" class="edge">
-<title>Node25&#45;&gt;Node21</title>
-<g id="a_edge45_Node000025_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.9,-480.94C189.13,-483.31 192.33,-485.99 195,-488.88 216.39,-511.97 203.66,-534.27 231,-549.88 280.19,-577.96 347.7,-568.61 390.81,-557.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="391.51,-561.32 400.29,-555.38 389.73,-554.55 391.51,-561.32"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node22 -->
-<g id="edge46_Node000025_Node000022" class="edge">
-<title>Node25&#45;&gt;Node22</title>
-<g id="a_edge46_Node000025_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.55,-480.81C189.66,-483.16 192.65,-485.87 195,-488.88 222.54,-524.13 202.92,-548.05 231,-582.88 232.8,-585.11 234.78,-587.24 236.88,-589.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="234.49,-591.84 244.37,-595.67 239.03,-586.51 234.49,-591.84"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="fibonacci__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dc3/fibonacci__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/dc3/fibonacci__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index aa481691a..000000000
--- a/de/dc3/fibonacci__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,683 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="645pt" height="711pt"
- viewBox="0.00 0.00 644.75 710.62" 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 706.62)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-498.5 0,-498.5 0,-479.25 37,-479.25 37,-498.5"/>
-<text text-anchor="middle" x="18.5" y="-485" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-498.5 73,-498.5 73,-479.25 105.5,-479.25 105.5,-498.5"/>
-<text text-anchor="middle" x="89.25" y="-485" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-488.88C44.58,-488.88 53.31,-488.88 61.45,-488.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-492.38 71.2,-488.88 61.2,-485.38 61.2,-492.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-554.5 141.5,-554.5 141.5,-535.25 195,-535.25 195,-554.5"/>
-<text text-anchor="middle" x="168.25" y="-541" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.66,-498.98C113.96,-506.7 128.56,-517.55 141.5,-526.88 142.18,-527.37 142.87,-527.86 143.57,-528.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.34,-531.07 151.53,-533.98 145.38,-525.35 141.34,-531.07"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.75,-407.5 146.75,-407.5 146.75,-388.25 189.75,-388.25 189.75,-407.5"/>
-<text text-anchor="middle" x="168.25" y="-394" font-family="Helvetica,sans-Serif" font-size="10.00">test_1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M98.78,-478.79C111.51,-463.75 135.68,-435.19 151.63,-416.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.15,-418.78 157.93,-408.89 148.8,-414.26 154.15,-418.78"/>
-</a>
-</g>
-</g>
-<!-- Node24 -->
-<g id="Node000024" class="node">
-<title>Node24</title>
-<g id="a_Node000024"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.75,-517.5 146.75,-517.5 146.75,-498.25 189.75,-498.25 189.75,-517.5"/>
-<text text-anchor="middle" x="168.25" y="-504" font-family="Helvetica,sans-Serif" font-size="10.00">test_2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node24 -->
-<g id="edge31_Node000002_Node000024" class="edge">
-<title>Node2&#45;&gt;Node24</title>
-<g id="a_edge31_Node000002_Node000024"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-492.72C114.33,-494.82 125.16,-497.49 135.35,-500"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.42,-503.38 144.97,-502.38 136.1,-496.58 134.42,-503.38"/>
-</a>
-</g>
-</g>
-<!-- Node25 -->
-<g id="Node000025" class="node">
-<title>Node25</title>
-<g id="a_Node000025"><a xlink:href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.75,-480.5 146.75,-480.5 146.75,-461.25 189.75,-461.25 189.75,-480.5"/>
-<text text-anchor="middle" x="168.25" y="-467" font-family="Helvetica,sans-Serif" font-size="10.00">test_3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node25 -->
-<g id="edge39_Node000002_Node000025" class="edge">
-<title>Node2&#45;&gt;Node25</title>
-<g id="a_edge39_Node000002_Node000025"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-485.23C114.33,-483.25 125.16,-480.71 135.35,-478.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="136.02,-481.77 144.96,-476.09 134.43,-474.95 136.02,-481.77"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d" target="_top" xlink:title="Adds an undirected edge from node u to node v in the tree.">
-<polygon fill="white" stroke="#666666" points="340,-442.75 231,-442.75 231,-401 340,-401 340,-442.75"/>
-<text text-anchor="start" x="239" y="-429.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="239" y="-418" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="285.5" y="-406.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.12,-402.22C198.59,-403.99 208.89,-406.13 219.52,-408.34"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.68,-411.74 229.18,-410.35 220.1,-404.89 218.68,-411.74"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="491.75,-476.5 376,-476.5 376,-457.25 491.75,-457.25 491.75,-476.5"/>
-<text text-anchor="middle" x="433.88" y="-463" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge19_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge19_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M171.67,-387.78C177.52,-365.92 194.68,-314.55 231,-293.88 273.1,-269.91 301.93,-263.91 340,-293.88 393.53,-336.01 331.89,-390.96 376,-442.88 378.69,-446.04 381.87,-448.8 385.33,-451.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="383.28,-454.06 393.69,-456 386.76,-447.99 383.28,-454.06"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="340,-246.75 231,-246.75 231,-205 340,-205 340,-246.75"/>
-<text text-anchor="start" x="239" y="-233.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="239" y="-222" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="285.5" y="-210.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::init</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge6_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M171.67,-387.87C177.92,-363.69 196.58,-301.13 231,-260.88 233.03,-258.5 235.26,-256.23 237.62,-254.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.39,-257.13 244.88,-248.07 234.94,-251.73 239.39,-257.13"/>
-</a>
-</g>
-</g>
-<!-- Node15 -->
-<g id="Node000015" class="node">
-<title>Node15</title>
-<g id="a_Node000015"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab" target="_top" xlink:title="This function returns the sum of node values in the simple path from from node_1 to node_2.">
-<polygon fill="white" stroke="#666666" points="340,-344.75 231,-344.75 231,-303 340,-303 340,-344.75"/>
-<text text-anchor="start" x="239" y="-331.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="239" y="-320" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="285.5" y="-308.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::query</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node15 -->
-<g id="edge20_Node000004_Node000015" class="edge">
-<title>Node4&#45;&gt;Node15</title>
-<g id="a_edge20_Node000004_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M184.79,-387.9C199.37,-378.54 221.84,-364.11 241.76,-351.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="243.49,-354.37 250.01,-346.02 239.71,-348.48 243.49,-354.37"/>
-</a>
-</g>
-</g>
-<!-- Node20 -->
-<g id="Node000020" class="node">
-<title>Node20</title>
-<g id="a_Node000020"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70" target="_top" xlink:title="Set the values for all the nodes.">
-<polygon fill="white" stroke="#666666" points="340,-540.75 231,-540.75 231,-499 340,-499 340,-540.75"/>
-<text text-anchor="start" x="239" y="-527.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="239" y="-516" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="285.5" y="-504.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::set_node_val</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node20 -->
-<g id="edge26_Node000004_Node000020" class="edge">
-<title>Node4&#45;&gt;Node20</title>
-<g id="a_edge26_Node000004_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M178.68,-407.86C195.56,-425.73 231.54,-463.81 256.84,-490.6"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.19,-492.89 263.6,-497.75 259.28,-488.08 254.19,-492.89"/>
-</a>
-</g>
-</g>
-<!-- Node21 -->
-<g id="Node000021" class="node">
-<title>Node21</title>
-<g id="a_Node000021"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="477.12,-554.5 390.62,-554.5 390.62,-535.25 477.12,-535.25 477.12,-554.5"/>
-<text text-anchor="middle" x="433.88" y="-541" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node21 -->
-<g id="edge28_Node000004_Node000021" class="edge">
-<title>Node4&#45;&gt;Node21</title>
-<g id="a_edge28_Node000004_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.09,-389.86C224.63,-378.04 294.42,-360.52 340,-391.88 376.86,-417.23 351.99,-448.12 376,-485.88 385.98,-501.56 400.59,-516.61 412.5,-527.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="410.04,-530.08 419.84,-534.11 414.7,-524.85 410.04,-530.08"/>
-</a>
-</g>
-</g>
-<!-- Node22 -->
-<g id="Node000022" class="node">
-<title>Node22</title>
-<g id="a_Node000022"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57" target="_top" xlink:title="This function updates the value at node with val.">
-<polygon fill="white" stroke="#666666" points="340,-638.75 231,-638.75 231,-597 340,-597 340,-638.75"/>
-<text text-anchor="start" x="239" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="239" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="285.5" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::update</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node22 -->
-<g id="edge29_Node000004_Node000022" class="edge">
-<title>Node4&#45;&gt;Node22</title>
-<g id="a_edge29_Node000004_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.28,-407.7C179.68,-418.43 188.39,-436.18 195,-451.88 213.01,-494.64 208.37,-509.36 231,-549.88 238.46,-563.22 248.44,-576.71 257.76,-588.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.95,-590.2 264.07,-595.61 260.31,-585.7 254.95,-590.2"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.17,-438.38C356.32,-443.34 373.84,-448.73 389.26,-453.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="388.03,-456.75 398.62,-456.34 390.09,-450.06 388.03,-456.75"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74" target="_top" xlink:title="Function that specifies the type of operation involved when segments are combined.">
-<polygon fill="white" stroke="#666666" points="636.75,-285.75 527.75,-285.75 527.75,-244 636.75,-244 636.75,-285.75"/>
-<text text-anchor="start" x="535.75" y="-272.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="535.75" y="-261" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="582.25" y="-249.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::combine</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.32,-228.97C381.86,-231.82 440.67,-236.84 491.75,-244.88 499.75,-246.13 508.11,-247.68 516.36,-249.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="515.52,-252.76 526.03,-251.39 516.96,-245.91 515.52,-252.76"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8" target="_top" xlink:title="Utility function to assign heavy child to each node (&#45;1 for a leaf node)">
-<polygon fill="white" stroke="#666666" points="488.38,-41.75 379.38,-41.75 379.38,0 488.38,0 488.38,-41.75"/>
-<text text-anchor="start" x="387.38" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="387.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="433.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_hc</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M295.69,-204.59C309.98,-172.94 339.68,-112.53 376,-68.88 381.69,-62.03 388.44,-55.39 395.27,-49.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="397.37,-52.16 402.72,-43.01 392.84,-46.82 397.37,-52.16"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8" target="_top" xlink:title="Utility function to lable the nodes so that heavy chains have a contigous lable.">
-<polygon fill="white" stroke="#666666" points="488.38,-295.75 379.38,-295.75 379.38,-254 488.38,-254 488.38,-295.75"/>
-<text text-anchor="start" x="387.38" y="-282.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="387.38" y="-271" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="433.88" y="-259.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_labels</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node10 -->
-<g id="edge10_Node000007_Node000010" class="edge">
-<title>Node7&#45;&gt;Node10</title>
-<g id="a_edge10_Node000007_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.17,-243.84C349.32,-246.91 358.91,-250.11 368.3,-253.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="367.18,-256.57 377.77,-256.43 369.4,-249.94 367.18,-256.57"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a" target="_top" xlink:title="Utility function to assign highest parent that can be reached though heavy chains.">
-<polygon fill="white" stroke="#666666" points="488.38,-179.75 379.38,-179.75 379.38,-138 488.38,-138 488.38,-179.75"/>
-<text text-anchor="start" x="387.38" y="-166.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="387.38" y="-155" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="433.88" y="-143.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::dfs_par</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node11 -->
-<g id="edge12_Node000007_Node000011" class="edge">
-<title>Node7&#45;&gt;Node11</title>
-<g id="a_edge12_Node000007_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M332.81,-204.68C346.56,-198.38 361.78,-191.42 376.11,-184.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="377.35,-188.14 384.98,-180.8 374.43,-181.78 377.35,-188.14"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc" target="_top" xlink:title="This function must be called after the tree adjacency list and node values are populated The function...">
-<polygon fill="white" stroke="#666666" points="488.38,-119.75 379.38,-119.75 379.38,-78 488.38,-78 488.38,-119.75"/>
-<text text-anchor="start" x="387.38" y="-106.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="387.38" y="-95" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="433.88" y="-83.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::init</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node12 -->
-<g id="edge14_Node000007_Node000012" class="edge">
-<title>Node7&#45;&gt;Node12</title>
-<g id="a_edge14_Node000007_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M302.56,-204.61C319.24,-183.53 346.94,-151.22 376,-128.88 377.12,-128.01 378.27,-127.16 379.44,-126.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="381.08,-129.44 387.51,-121.01 377.23,-123.59 381.08,-129.44"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node9 -->
-<g id="edge9_Node000009_Node000009" class="edge">
-<title>Node9&#45;&gt;Node9</title>
-<g id="a_edge9_Node000009_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M406.49,-42.07C403.88,-51.55 413.01,-59.75 433.88,-59.75 445.94,-59.75 454.08,-57.01 458.29,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="461.59,-54.1 460.86,-43.53 454.84,-52.24 461.59,-54.1"/>
-</a>
-</g>
-</g>
-<!-- Node10&#45;&gt;Node10 -->
-<g id="edge11_Node000010_Node000010" class="edge">
-<title>Node10&#45;&gt;Node10</title>
-<g id="a_edge11_Node000010_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M406.49,-296.07C403.88,-305.55 413.01,-313.75 433.88,-313.75 445.94,-313.75 454.08,-311.01 458.29,-306.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="461.59,-308.1 460.86,-297.53 454.84,-306.24 461.59,-308.1"/>
-</a>
-</g>
-</g>
-<!-- Node11&#45;&gt;Node11 -->
-<g id="edge13_Node000011_Node000011" class="edge">
-<title>Node11&#45;&gt;Node11</title>
-<g id="a_edge13_Node000011_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M406.49,-180.07C403.88,-189.55 413.01,-197.75 433.88,-197.75 445.94,-197.75 454.08,-195.01 458.29,-190.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="461.59,-192.1 460.86,-181.53 454.84,-190.24 461.59,-192.1"/>
-</a>
-</g>
-</g>
-<!-- Node13 -->
-<g id="Node000013" class="node">
-<title>Node13</title>
-<g id="a_Node000013"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4" target="_top" xlink:title="Utility function to populate the t_par vector.">
-<polygon fill="white" stroke="#666666" points="636.75,-80.75 527.75,-80.75 527.75,-39 636.75,-39 636.75,-80.75"/>
-<text text-anchor="start" x="535.75" y="-67.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="535.75" y="-56" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="582.25" y="-44.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_lca</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node13 -->
-<g id="edge15_Node000012_Node000013" class="edge">
-<title>Node12&#45;&gt;Node13</title>
-<g id="a_edge15_Node000012_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M488.55,-84.57C497.7,-82.14 507.28,-79.58 516.68,-77.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="517.36,-80.52 526.12,-74.56 515.56,-73.76 517.36,-80.52"/>
-</a>
-</g>
-</g>
-<!-- Node14 -->
-<g id="Node000014" class="node">
-<title>Node14</title>
-<g id="a_Node000014"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460" target="_top" xlink:title="Utility function to compute sub&#45;tree sizes.">
-<polygon fill="white" stroke="#666666" points="636.75,-158.75 527.75,-158.75 527.75,-117 636.75,-117 636.75,-158.75"/>
-<text text-anchor="start" x="535.75" y="-145.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="535.75" y="-134" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="582.25" y="-122.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::dfs_size</text>
-</a>
-</g>
-</g>
-<!-- Node12&#45;&gt;Node14 -->
-<g id="edge17_Node000012_Node000014" class="edge">
-<title>Node12&#45;&gt;Node14</title>
-<g id="a_edge17_Node000012_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M488.55,-113.18C497.7,-115.61 507.28,-118.17 516.68,-120.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="515.56,-123.99 526.12,-123.19 517.36,-117.23 515.56,-123.99"/>
-</a>
-</g>
-</g>
-<!-- Node13&#45;&gt;Node13 -->
-<g id="edge16_Node000013_Node000013" class="edge">
-<title>Node13&#45;&gt;Node13</title>
-<g id="a_edge16_Node000013_Node000013"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M554.86,-81.07C552.26,-90.55 561.38,-98.75 582.25,-98.75 594.31,-98.75 602.45,-96.01 606.67,-91.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="609.96,-93.1 609.23,-82.53 603.21,-91.24 609.96,-93.1"/>
-</a>
-</g>
-</g>
-<!-- Node14&#45;&gt;Node14 -->
-<g id="edge18_Node000014_Node000014" class="edge">
-<title>Node14&#45;&gt;Node14</title>
-<g id="a_edge18_Node000014_Node000014"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M554.86,-159.07C552.26,-168.55 561.38,-176.75 582.25,-176.75 594.31,-176.75 602.45,-174.01 606.67,-169.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="609.96,-171.1 609.23,-160.53 603.21,-169.24 609.96,-171.1"/>
-</a>
-</g>
-</g>
-<!-- Node16 -->
-<g id="Node000016" class="node">
-<title>Node16</title>
-<g id="a_Node000016"><a xlink:href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24" target="_top" xlink:title="Utility function to break down a path query into two chain queries.">
-<polygon fill="white" stroke="#666666" points="488.38,-373.75 379.38,-373.75 379.38,-332 488.38,-332 488.38,-373.75"/>
-<text text-anchor="start" x="387.38" y="-360.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="387.38" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="433.88" y="-337.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD::chain_query</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node16 -->
-<g id="edge21_Node000015_Node000016" class="edge">
-<title>Node15&#45;&gt;Node16</title>
-<g id="a_edge21_Node000015_Node000016"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.17,-334.51C349.22,-336.3 358.7,-338.18 368,-340.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="367.23,-343.44 377.72,-341.95 368.59,-336.57 367.23,-343.44"/>
-</a>
-</g>
-</g>
-<!-- Node18 -->
-<g id="Node000018" class="node">
-<title>Node18</title>
-<g id="a_Node000018"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4" target="_top" xlink:title="The function returns the least common ancestor of two nodes.">
-<polygon fill="white" stroke="#666666" points="488.38,-433.75 379.38,-433.75 379.38,-392 488.38,-392 488.38,-433.75"/>
-<text text-anchor="start" x="387.38" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="387.38" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="433.88" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lca</text>
-</a>
-</g>
-</g>
-<!-- Node15&#45;&gt;Node18 -->
-<g id="edge24_Node000015_Node000018" class="edge">
-<title>Node15&#45;&gt;Node18</title>
-<g id="a_edge24_Node000015_Node000018"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M319.07,-345.12C325.98,-349.65 333.24,-354.41 340,-358.88 356.05,-369.47 359.47,-373.04 376,-382.88 377.83,-383.97 379.71,-385.06 381.62,-386.16"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="379.53,-389 389.96,-390.83 382.95,-382.89 379.53,-389"/>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node8 -->
-<g id="edge22_Node000016_Node000008" class="edge">
-<title>Node16&#45;&gt;Node8</title>
-<g id="a_edge22_Node000016_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M476.43,-331.51C481.63,-328.68 486.84,-325.75 491.75,-322.88 507.87,-313.43 525.18,-302.42 540.25,-292.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="542.11,-295.51 548.53,-287.08 538.25,-289.67 542.11,-295.51"/>
-</a>
-</g>
-</g>
-<!-- Node17 -->
-<g id="Node000017" class="node">
-<title>Node17</title>
-<g id="a_Node000017"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="611.62,-362.5 552.88,-362.5 552.88,-343.25 611.62,-343.25 611.62,-362.5"/>
-<text text-anchor="middle" x="582.25" y="-349" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node16&#45;&gt;Node17 -->
-<g id="edge23_Node000016_Node000017" class="edge">
-<title>Node16&#45;&gt;Node17</title>
-<g id="a_edge23_Node000016_Node000017"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M488.55,-352.88C506.01,-352.88 525.08,-352.88 541.35,-352.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="541.13,-356.38 551.13,-352.88 541.13,-349.38 541.13,-356.38"/>
-</a>
-</g>
-</g>
-<!-- Node19 -->
-<g id="Node000019" class="node">
-<title>Node19</title>
-<g id="a_Node000019"><a xlink:href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3" target="_top" xlink:title="The function lifts a node, k units up the tree. The lifting is done in place, and the result is store...">
-<polygon fill="white" stroke="#666666" points="636.75,-433.75 527.75,-433.75 527.75,-392 636.75,-392 636.75,-433.75"/>
-<text text-anchor="start" x="535.75" y="-420.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="535.75" y="-409" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="582.25" y="-397.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree::lift</text>
-</a>
-</g>
-</g>
-<!-- Node18&#45;&gt;Node19 -->
-<g id="edge25_Node000018_Node000019" class="edge">
-<title>Node18&#45;&gt;Node19</title>
-<g id="a_edge25_Node000018_Node000019"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M488.55,-412.88C497.6,-412.88 507.08,-412.88 516.37,-412.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="516.07,-416.38 526.07,-412.88 516.07,-409.38 516.07,-416.38"/>
-</a>
-</g>
-</g>
-<!-- Node20&#45;&gt;Node21 -->
-<g id="edge27_Node000020_Node000021" class="edge">
-<title>Node20&#45;&gt;Node21</title>
-<g id="a_edge27_Node000020_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.17,-529.04C352.79,-531.2 366.25,-533.5 378.88,-535.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="378.26,-539.1 388.71,-537.33 379.44,-532.2 378.26,-539.1"/>
-</a>
-</g>
-</g>
-<!-- Node23 -->
-<g id="Node000023" class="node">
-<title>Node23</title>
-<g id="a_Node000023"><a xlink:href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c" target="_top" xlink:title="Update the value at a node.">
-<polygon fill="white" stroke="#666666" points="488.38,-638.75 379.38,-638.75 379.38,-597 488.38,-597 488.38,-638.75"/>
-<text text-anchor="start" x="387.38" y="-625.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
-<text text-anchor="start" x="387.38" y="-614" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
-<text text-anchor="middle" x="433.88" y="-602.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG::update</text>
-</a>
-</g>
-</g>
-<!-- Node22&#45;&gt;Node23 -->
-<g id="edge30_Node000022_Node000023" class="edge">
-<title>Node22&#45;&gt;Node23</title>
-<g id="a_edge30_Node000022_Node000023"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M340.17,-617.88C349.22,-617.88 358.7,-617.88 368,-617.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="367.69,-621.38 377.69,-617.88 367.69,-614.38 367.69,-621.38"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node5 -->
-<g id="edge32_Node000024_Node000005" class="edge">
-<title>Node24&#45;&gt;Node5</title>
-<g id="a_edge32_Node000024_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.76,-497.88C187.44,-495.3 191.39,-492.51 195,-489.88 212.66,-477 232.01,-462.37 248.17,-449.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="250.29,-452.78 256.09,-443.91 246.03,-447.23 250.29,-452.78"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node6 -->
-<g id="edge34_Node000024_Node000006" class="edge">
-<title>Node24&#45;&gt;Node6</title>
-<g id="a_edge34_Node000024_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.01,-517.87C190,-520.18 192.83,-522.86 195,-525.88 228.02,-571.76 185.72,-614.03 231,-647.88 269.8,-676.88 301.2,-676.88 340,-647.88 385.28,-614.03 347.57,-574.74 376,-525.88 385.24,-510 399.62,-495.13 411.61,-484.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="413.79,-487.03 419.05,-477.83 409.2,-481.75 413.79,-487.03"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node7 -->
-<g id="edge33_Node000024_Node000007" class="edge">
-<title>Node24&#45;&gt;Node7</title>
-<g id="a_edge33_Node000024_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.53,-497.85C190.4,-495.57 193.05,-492.9 195,-489.88 242.88,-415.37 194.55,-374.6 231,-293.88 237.19,-280.16 246.74,-266.76 256.06,-255.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.53,-258.02 262.43,-248.17 253.24,-253.44 258.53,-258.02"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node15 -->
-<g id="edge35_Node000024_Node000015" class="edge">
-<title>Node24&#45;&gt;Node15</title>
-<g id="a_edge35_Node000024_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.85,-497.76C189.86,-495.46 192.74,-492.81 195,-489.88 223.32,-453.12 208.37,-432.39 231,-391.88 238.46,-378.53 248.44,-365.04 257.76,-353.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.31,-356.05 264.07,-346.14 254.95,-351.55 260.31,-356.05"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node20 -->
-<g id="edge36_Node000024_Node000020" class="edge">
-<title>Node24&#45;&gt;Node20</title>
-<g id="a_edge36_Node000024_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.12,-510.05C198.59,-510.93 208.89,-512 219.52,-513.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="218.85,-516.56 229.16,-514.11 219.57,-509.6 218.85,-516.56"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node21 -->
-<g id="edge37_Node000024_Node000021" class="edge">
-<title>Node24&#45;&gt;Node21</title>
-<g id="a_edge37_Node000024_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.42,-517.97C190.3,-520.25 192.98,-522.89 195,-525.88 234.61,-584.46 175.62,-636.89 231,-680.88 268.93,-711.01 300.04,-708.26 340,-680.88 376.56,-655.82 349.3,-623.26 376,-587.88 383.91,-577.39 395.03,-568.21 405.35,-561.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="407.13,-564.07 413.59,-555.67 403.3,-558.21 407.13,-564.07"/>
-</a>
-</g>
-</g>
-<!-- Node24&#45;&gt;Node22 -->
-<g id="edge38_Node000024_Node000022" class="edge">
-<title>Node24&#45;&gt;Node22</title>
-<g id="a_edge38_Node000024_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.56,-517.8C188.89,-520.22 192.21,-522.95 195,-525.88 215.69,-547.55 209.98,-561.52 231,-582.88 233.38,-585.29 235.95,-587.62 238.63,-589.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="236.23,-592.44 246.29,-595.77 240.5,-586.89 236.23,-592.44"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node5 -->
-<g id="edge40_Node000025_Node000005" class="edge">
-<title>Node25&#45;&gt;Node5</title>
-<g id="a_edge40_Node000025_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.12,-462C199.85,-457.86 211.98,-452.71 224.27,-447.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.35,-450.83 233.19,-443.69 222.61,-444.38 225.35,-450.83"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node6 -->
-<g id="edge42_Node000025_Node000006" class="edge">
-<title>Node25&#45;&gt;Node6</title>
-<g id="a_edge42_Node000025_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.94,-470.56C227.03,-470 306.41,-468.79 364.36,-467.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="364.19,-471.42 374.14,-467.77 364.09,-464.42 364.19,-471.42"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node7 -->
-<g id="edge41_Node000025_Node000007" class="edge">
-<title>Node25&#45;&gt;Node7</title>
-<g id="a_edge41_Node000025_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.48,-461.13C180.06,-450.47 188.92,-432.79 195,-416.88 215.32,-363.66 204.92,-344.51 231,-293.88 237.95,-280.39 247.74,-266.96 257.05,-255.64"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="259.56,-258.09 263.37,-248.21 254.23,-253.56 259.56,-258.09"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node15 -->
-<g id="edge43_Node000025_Node000015" class="edge">
-<title>Node25&#45;&gt;Node15</title>
-<g id="a_edge43_Node000025_Node000015"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M176.85,-461.14C188.49,-446.22 211.45,-416.81 231,-391.88 240.73,-379.47 251.47,-365.81 260.76,-354"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="263.48,-356.21 266.92,-346.19 257.98,-351.88 263.48,-356.21"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node20 -->
-<g id="edge44_Node000025_Node000020" class="edge">
-<title>Node25&#45;&gt;Node20</title>
-<g id="a_edge44_Node000025_Node000020"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M190.12,-479.75C199.85,-483.89 211.98,-489.04 224.27,-494.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.61,-497.37 233.19,-498.06 225.35,-490.92 222.61,-497.37"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node21 -->
-<g id="edge45_Node000025_Node000021" class="edge">
-<title>Node25&#45;&gt;Node21</title>
-<g id="a_edge45_Node000025_Node000021"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.9,-480.94C189.13,-483.31 192.33,-485.99 195,-488.88 216.39,-511.97 203.66,-534.27 231,-549.88 280.19,-577.96 347.7,-568.61 390.81,-557.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="391.51,-561.32 400.29,-555.38 389.73,-554.55 391.51,-561.32"/>
-</a>
-</g>
-</g>
-<!-- Node25&#45;&gt;Node22 -->
-<g id="edge46_Node000025_Node000022" class="edge">
-<title>Node25&#45;&gt;Node22</title>
-<g id="a_edge46_Node000025_Node000022"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M186.55,-480.81C189.66,-483.16 192.65,-485.87 195,-488.88 222.54,-524.13 202.92,-548.05 231,-582.88 232.8,-585.11 234.78,-587.24 236.88,-589.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="234.49,-591.84 244.37,-595.67 239.03,-586.51 234.49,-591.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dc3/fibonacci__sum_8cpp_source.html b/de/dc3/fibonacci__sum_8cpp_source.html
new file mode 100644
index 000000000..85782a233
--- /dev/null
+++ b/de/dc3/fibonacci__sum_8cpp_source.html
@@ -0,0 +1,246 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/fibonacci_sum.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/dc3/fibonacci__sum_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">fibonacci_sum.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/dc3/fibonacci__sum_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d3/dc9/namespacefibonacci__sum.html">fibonacci_sum</a> {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keyword">using </span><a class="code hl_typedef" href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a> = std::vector&lt;std::vector&lt;uint64_t&gt; &gt;;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="foldopen" id="foldopen00039" data-start="{" data-end="}">
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../de/dc3/fibonacci__sum_8cpp.html#a9c83cca09a3e4ff2a25c816a9303448e">   39</a></span>math::fibonacci_sum::matrix multiply(<span class="keyword">const</span> math::fibonacci_sum::matrix &amp;T,</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>                                     <span class="keyword">const</span> math::fibonacci_sum::matrix &amp;A) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    math::fibonacci_sum::matrix <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(2, std::vector&lt;uint64_t&gt;(2, 0));</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="comment">// multiplying matrices</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>[0][0] = T[0][0] * A[0][0] + T[0][1] * A[1][0];</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>[0][1] = T[0][0] * A[0][1] + T[0][1] * A[1][1];</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>[1][0] = T[1][0] * A[0][0] + T[1][1] * A[1][0];</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>[1][1] = T[1][0] * A[0][1] + T[1][1] * A[1][1];</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>}</div>
+</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="foldopen" id="foldopen00058" data-start="{" data-end="}">
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"><a class="line" href="../../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311">   58</a></span>math::fibonacci_sum::matrix <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311">power</a>(math::fibonacci_sum::matrix T, uint64_t ex) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    math::fibonacci_sum::matrix A{{1, 1}, {1, 0}};</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">if</span> (ex == 0 || ex == 1) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="keywordflow">return</span> T;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    }</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    T = <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311">power</a>(T, ex / 2);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    T = multiply(T, T);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">if</span> (ex &amp; 1) {</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        T = multiply(T, A);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    }</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="keywordflow">return</span> T;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>}</div>
+</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="foldopen" id="foldopen00077" data-start="{" data-end="}">
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">   77</a></span>uint64_t <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(uint64_t n) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    math::fibonacci_sum::matrix T{{1, 1}, {1, 0}};</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    T = <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311">power</a>(T, n);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    uint64_t ans = T[0][1];</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    ans = (ans - 1);</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">return</span> ans;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>}</div>
+</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="foldopen" id="foldopen00091" data-start="{" data-end="}">
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"><a class="line" href="../../de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742">   91</a></span>uint64_t <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742">fiboSum</a>(uint64_t n, uint64_t m) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keywordflow">return</span> (<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(m + 2) - <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(n + 1));</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>}</div>
+</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>}  <span class="comment">// namespace fibonacci_sum</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="foldopen" id="foldopen00102" data-start="{" data-end="}">
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"><a class="line" href="../../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  102</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    uint64_t n = 0, m = 3;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    uint64_t <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a> = math::fibonacci_sum::fiboSum(n, m);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    assert(<a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a> == 4);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 1!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    n = 3;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    m = 5;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    uint64_t <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a> = math::fibonacci_sum::fiboSum(n, m);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    assert(<a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a> == 10);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 2!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    n = 5;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    m = 7;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    uint64_t <a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a> = math::fibonacci_sum::fiboSum(n, m);</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    assert(<a class="code hl_function" href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a> == 26);</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 3!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span> </div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    n = 7;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    m = 10;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    uint64_t test_4 = math::fibonacci_sum::fiboSum(n, m);</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    assert(test_4 == 123);</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 4!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    n = 9;</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    m = 12;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    uint64_t test_5 = math::fibonacci_sum::fiboSum(n, m);</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    assert(test_5 == 322);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed Test 5!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>}</div>
+</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span> </div>
+<div class="foldopen" id="foldopen00137" data-start="{" data-end="}">
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"><a class="line" href="../../de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  137</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the tests</span></div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>}</div>
+</div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_a493fbaa7a94e3b7ca573111237bb3742"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742">math::fibonacci_sum::fiboSum</a></div><div class="ttdeci">uint64_t fiboSum(uint64_t n, uint64_t m)</div><div class="ttdef"><b>Definition</b> <a href="#l00091">fibonacci_sum.cpp:91</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_a7cf5feaf168b88e74544da59ed830311"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311">math::fibonacci_sum::power</a></div><div class="ttdeci">math::fibonacci_sum::matrix power(math::fibonacci_sum::matrix T, uint64_t ex)</div><div class="ttdef"><b>Definition</b> <a href="#l00058">fibonacci_sum.cpp:58</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00102">fibonacci_sum.cpp:102</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="#l00077">fibonacci_sum.cpp:77</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00137">fibonacci_sum.cpp:137</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00505">heavy_light_decomposition.cpp:505</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00549">heavy_light_decomposition.cpp:549</a></div></div>
+<div class="ttc" id="aheavy__light__decomposition_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition</b> <a href="../../d2/de9/heavy__light__decomposition_8cpp_source.html#l00592">heavy_light_decomposition.cpp:592</a></div></div>
+<div class="ttc" id="alu__decomposition_8h_html_ac029b636b353cefbb18b2fcc71e427e4"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4">matrix</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; matrix</div><div class="ttdef"><b>Definition</b> <a href="../../d1/dbe/lu__decomposition_8h_source.html#l00019">lu_decomposition.h:19</a></div></div>
+<div class="ttc" id="anamespacefibonacci__sum_html"><div class="ttname"><a href="../../d3/dc9/namespacefibonacci__sum.html">fibonacci_sum</a></div><div class="ttdoc">Functions for the sum of the Fibonacci Sequence:  .</div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../de/dc3/fibonacci__sum_8cpp.html">fibonacci_sum.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/dc5/intersection__of__two__arrays_8cpp.html b/de/dc5/intersection__of__two__arrays_8cpp.html
index a683d0509..dce5512c4 100644
--- a/de/dc5/intersection__of__two__arrays_8cpp.html
+++ b/de/dc5/intersection__of__two__arrays_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: operations_on_datastructures/intersection_of_two_arrays.cpp File Reference</title>
+<title>TheAlgorithms/C++: operations_on_datastructures/intersection_of_two_arrays.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,11 +139,13 @@ Include dependency graph for intersection_of_two_arrays.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/dc8/intersection__of__two__arrays_8cpp__incl.svg" width="350" height="126"><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">
+</div>
+<p><a href="../../de/dc5/intersection__of__two__arrays_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></td></tr>
-<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
+<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::vector <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html">tests</a></td></tr>
 <tr class="memdesc:d9/df4/namespacetests"><td class="mdescLeft">&#160;</td><td class="mdescRight">Testcases to check Union of Two Arrays. <br /></td></tr>
@@ -134,10 +153,10 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a6109193567a5b7e36a27f2b4865fce20" id="r_a6109193567a5b7e36a27f2b4865fce20"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures::print</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;array)</td></tr>
+<tr class="memitem:a6109193567a5b7e36a27f2b4865fce20" id="r_a6109193567a5b7e36a27f2b4865fce20"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures::print</a> (const std::vector&lt; int32_t &gt; &amp;array)</td></tr>
 <tr class="memdesc:a6109193567a5b7e36a27f2b4865fce20"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints the values of a vector sequentially, ending with a newline character.  <br /></td></tr>
 <tr class="separator:a6109193567a5b7e36a27f2b4865fce20"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:adaf9a06f0c236c2d95c97e441ea2d12e" id="r_adaf9a06f0c236c2d95c97e441ea2d12e"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e">operations_on_datastructures::get_intersection</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;first, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int32_t &gt; &amp;second)</td></tr>
+<tr class="memitem:adaf9a06f0c236c2d95c97e441ea2d12e" id="r_adaf9a06f0c236c2d95c97e441ea2d12e"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int32_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e">operations_on_datastructures::get_intersection</a> (const std::vector&lt; int32_t &gt; &amp;first, const std::vector&lt; int32_t &gt; &amp;second)</td></tr>
 <tr class="memdesc:adaf9a06f0c236c2d95c97e441ea2d12e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the intersection of two sorted arrays, and returns them in a vector.  <br /></td></tr>
 <tr class="separator:adaf9a06f0c236c2d95c97e441ea2d12e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a167c24bd817469ae47358d12e034f2d5" id="r_a167c24bd817469ae47358d12e034f2d5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a> ()</td></tr>
@@ -156,7 +175,7 @@ Functions</h2></td></tr>
 <tr class="memdesc:af7b81d7a1534216af6a36a80135beb86"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check a shift of zero.  <br /></td></tr>
 <tr class="separator:af7b81d7a1534216af6a36a80135beb86"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aacafde185abd8670abee51157f273dc2" id="r_aacafde185abd8670abee51157f273dc2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">tests::test6</a> ()</td></tr>
-<tr class="memdesc:aacafde185abd8670abee51157f273dc2"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check correct functionality with an array sorted using <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a>.  <br /></td></tr>
+<tr class="memdesc:aacafde185abd8670abee51157f273dc2"><td class="mdescLeft">&#160;</td><td class="mdescRight">A Test to check correct functionality with an array sorted using std::sort.  <br /></td></tr>
 <tr class="separator:aacafde185abd8670abee51157f273dc2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
 <tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to test the correctness of get_intersection() function.  <br /></td></tr>
@@ -169,6 +188,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Implementation for the <a href="https://en.wikipedia.org/wiki/Intersection_(set_theory)" target="_blank">Intersection of two sorted Arrays</a> algorithm. </p>
 <p>The intersection of two arrays is the collection of all the elements that are common in both the first and second arrays. This implementation uses ordered arrays, and an algorithm to correctly order them and return the result as a new array (vector). </p><dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d8/d9c/union__of__two__arrays_8cpp.html" title="Implementation for the Union of two sorted Arrays algorithm.">union_of_two_arrays.cpp</a> </dd></dl>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/polarvoid" target="_blank">Alvin</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../de/dc5/intersection__of__two__arrays_8cpp_source.html">intersection_of_two_arrays.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -187,17 +208,14 @@ Functions</h2></td></tr>
 
 <p>main function </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc5/intersection__of__two__arrays_8cpp_source.html#l00200">200</a> of file <a class="el" href="../../de/dc5/intersection__of__two__arrays_8cpp_source.html">intersection_of_two_arrays.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  200</span>           {</div>
 <div class="line"><span class="lineno">  201</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  202</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  203</span>}</div>
-<div class="ttc" id="aintersection__of__two__arrays_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of get_intersection() function.</div><div class="ttdef"><b>Definition</b> intersection_of_two_arrays.cpp:187</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="490" height="332"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aintersection__of__two__arrays_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of get_intersection() function.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc5/intersection__of__two__arrays_8cpp_source.html#l00187">intersection_of_two_arrays.cpp:187</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -225,6 +243,8 @@ Here is the call graph for this function:</div>
 
 <p>Function to test the correctness of get_intersection() function. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dc5/intersection__of__two__arrays_8cpp_source.html#l00187">187</a> of file <a class="el" href="../../de/dc5/intersection__of__two__arrays_8cpp_source.html">intersection_of_two_arrays.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  187</span>                   {</div>
 <div class="line"><span class="lineno">  188</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a>();</div>
 <div class="line"><span class="lineno">  189</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a>();</div>
@@ -233,18 +253,13 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  192</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a>();</div>
 <div class="line"><span class="lineno">  193</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">tests::test6</a>();</div>
 <div class="line"><span class="lineno">  194</span>}</div>
-<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:75</div></div>
-<div class="ttc" id="anamespacetests_html_a2b9769e44683dcb67fe1083ad91e134d"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a></div><div class="ttdeci">void test4()</div><div class="ttdoc">A Test to check a very large input.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:120</div></div>
-<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check an invalid shift value.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:105</div></div>
-<div class="ttc" id="anamespacetests_html_aacafde185abd8670abee51157f273dc2"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">tests::test6</a></div><div class="ttdeci">void test6()</div><div class="ttdoc">A Test to check correct functionality with an array sorted using std::sort.</div><div class="ttdef"><b>Definition</b> intersection_of_two_arrays.cpp:166</div></div>
-<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an empty vector.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:90</div></div>
-<div class="ttc" id="anamespacetests_html_af7b81d7a1534216af6a36a80135beb86"><div class="ttname"><a href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a></div><div class="ttdeci">void test5()</div><div class="ttdoc">A Test to check a shift of zero.</div><div class="ttdef"><b>Definition</b> array_left_rotation.cpp:143</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="392" height="332"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00075">array_left_rotation.cpp:75</a></div></div>
+<div class="ttc" id="anamespacetests_html_a2b9769e44683dcb67fe1083ad91e134d"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a></div><div class="ttdeci">void test4()</div><div class="ttdoc">A Test to check a very large input.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00120">array_left_rotation.cpp:120</a></div></div>
+<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check an invalid shift value.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00105">array_left_rotation.cpp:105</a></div></div>
+<div class="ttc" id="anamespacetests_html_aacafde185abd8670abee51157f273dc2"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">tests::test6</a></div><div class="ttdeci">void test6()</div><div class="ttdoc">A Test to check correct functionality with an array sorted using std::sort.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc5/intersection__of__two__arrays_8cpp_source.html#l00166">intersection_of_two_arrays.cpp:166</a></div></div>
+<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an empty vector.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00090">array_left_rotation.cpp:90</a></div></div>
+<div class="ttc" id="anamespacetests_html_af7b81d7a1534216af6a36a80135beb86"><div class="ttname"><a href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a></div><div class="ttdeci">void test5()</div><div class="ttdoc">A Test to check a shift of zero.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00143">array_left_rotation.cpp:143</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 6c1a53ded..000000000
--- a/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,23 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Function to test the correctness of get_intersection() function." alt="" coords="5,129,49,155"/>
-<area shape="rect" id="Node000002" href="$d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" title="A Test to check an simple case." alt="" coords="97,5,184,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="33,127,57,86,95,40,97,38,101,42,99,44,61,89,37,130"/>
-<area shape="rect" id="Node000003" href="$d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" title="A Test to check an empty vector." alt="" coords="97,55,184,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="43,127,95,89,99,87,102,91,98,94,46,131"/>
-<area shape="rect" id="Node000004" href="$d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" title="A Test to check an invalid shift value." alt="" coords="97,104,184,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="49,135,81,127,82,133,50,140"/>
-<area shape="rect" id="Node000005" href="$d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" title="A Test to check a very large input." alt="" coords="97,153,184,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="50,144,82,151,81,156,49,149"/>
-<area shape="rect" id="Node000007" href="$d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" title="A Test to check a shift of zero." alt="" coords="97,203,184,228"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="47,153,98,189,103,192,100,197,95,194,44,157"/>
-<area shape="rect" id="Node000008" href="$d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2" title="A Test to check correct functionality with an array sorted using std::sort." alt="" coords="97,252,184,278"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="37,154,61,195,99,239,101,241,97,245,95,243,57,198,33,157"/>
-<area shape="rect" id="Node000006" 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="232,153,386,179"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="184,164,216,164,216,169,184,169"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="248,203,370,228"/>
-<area shape="poly" id="edge8_Node000008_Node000009" title=" " alt="" coords="184,250,248,231,249,236,185,255"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="253,252,365,278"/>
-<area shape="poly" id="edge9_Node000008_Node000010" title=" " alt="" coords="184,262,238,262,238,268,184,268"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/sort.html#" title=" " alt="" coords="274,301,344,327"/>
-<area shape="poly" id="edge10_Node000008_Node000011" title=" " alt="" coords="185,275,260,297,259,302,184,280"/>
-</map>
diff --git a/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 143d0acca..000000000
--- a/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2711630a1b149836e8e7d5e4cfccd0ef
\ No newline at end of file
diff --git a/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index f9dfaec9b..000000000
--- a/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,227 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="294pt" height="249pt"
- viewBox="0.00 0.00 293.75 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the correctness of get_intersection() function.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-148.25 0,-148.25 0,-129 32.5,-129 32.5,-148.25"/>
-<text text-anchor="middle" x="16.25" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="134,-241.25 68.5,-241.25 68.5,-222 134,-222 134,-241.25"/>
-<text text-anchor="middle" x="101.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.19,-148.68C30.2,-164.16 47.26,-194.09 68.5,-213.62 69.11,-214.19 69.74,-214.74 70.39,-215.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.06,-217.92 78.26,-220.81 72.09,-212.2 68.06,-217.92"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="134,-204.25 68.5,-204.25 68.5,-185 134,-185 134,-204.25"/>
-<text text-anchor="middle" x="101.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.58,-148.43C39.78,-156.38 54.76,-167.68 68.5,-176.62 69.54,-177.3 70.6,-177.97 71.68,-178.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.87,-181.65 80.25,-183.76 73.45,-175.63 69.87,-181.65"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="134,-167.25 68.5,-167.25 68.5,-148 134,-148 134,-167.25"/>
-<text text-anchor="middle" x="101.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-142.2C39.86,-143.8 48.5,-145.78 57.22,-147.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.2,-151.13 66.73,-149.95 57.77,-144.31 56.2,-151.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="134,-130.25 68.5,-130.25 68.5,-111 134,-111 134,-130.25"/>
-<text text-anchor="middle" x="101.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-135.24C39.86,-133.72 48.5,-131.85 57.22,-129.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.7,-133.43 66.73,-127.89 56.21,-126.59 57.7,-133.43"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="134,-93.25 68.5,-93.25 68.5,-74 134,-74 134,-93.25"/>
-<text text-anchor="middle" x="101.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.04,-128.79C40.24,-121.1 55.02,-110.28 68.5,-101.62 69.7,-100.86 70.93,-100.08 72.19,-99.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.78,-102.44 80.61,-94.34 70.22,-96.41 73.78,-102.44"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2" target="_top" xlink:title="A Test to check correct functionality with an array sorted using std::sort.">
-<polygon fill="white" stroke="#666666" points="134,-56.25 68.5,-56.25 68.5,-37 134,-37 134,-56.25"/>
-<text text-anchor="middle" x="101.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test6</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.23,-128.71C30.27,-113.44 47.39,-83.92 68.5,-64.62 69.11,-64.06 69.75,-63.51 70.4,-62.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.09,-66.06 78.27,-57.45 68.07,-60.33 72.09,-66.06"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.75,-130.25 170,-130.25 170,-111 285.75,-111 285.75,-130.25"/>
-<text text-anchor="middle" x="227.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-120.62C141.78,-120.62 149.98,-120.62 158.32,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.23,-124.13 168.23,-120.63 158.23,-117.13 158.23,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273.75,-93.25 182,-93.25 182,-74 273.75,-74 273.75,-93.25"/>
-<text text-anchor="middle" x="227.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge8_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge8_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-56.15C148.99,-60.5 166.58,-65.72 182.47,-70.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.11,-73.69 191.7,-73.18 183.11,-66.98 181.11,-73.69"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270,-56.25 185.75,-56.25 185.75,-37 270,-37 270,-56.25"/>
-<text text-anchor="middle" x="227.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge9_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge9_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-46.62C146.51,-46.62 160.71,-46.62 174.28,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.96,-50.13 183.96,-46.63 173.96,-43.13 173.96,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.88,-19.25 201.88,-19.25 201.88,0 253.88,0 253.88,-19.25"/>
-<text text-anchor="middle" x="227.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node11 -->
-<g id="edge10_Node000008_Node000011" class="edge">
-<title>Node8&#45;&gt;Node11</title>
-<g id="a_edge10_Node000008_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-37.1C151.58,-31.98 172.89,-25.65 190.71,-20.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.53,-23.77 200.12,-17.57 189.53,-17.06 191.53,-23.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index f7b065d7d..000000000
--- a/de/dc5/intersection__of__two__arrays_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,201 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="294pt" height="249pt"
- viewBox="0.00 0.00 293.75 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the correctness of get_intersection() function.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-148.25 0,-148.25 0,-129 32.5,-129 32.5,-148.25"/>
-<text text-anchor="middle" x="16.25" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="134,-241.25 68.5,-241.25 68.5,-222 134,-222 134,-241.25"/>
-<text text-anchor="middle" x="101.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.19,-148.68C30.2,-164.16 47.26,-194.09 68.5,-213.62 69.11,-214.19 69.74,-214.74 70.39,-215.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="68.06,-217.92 78.26,-220.81 72.09,-212.2 68.06,-217.92"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="134,-204.25 68.5,-204.25 68.5,-185 134,-185 134,-204.25"/>
-<text text-anchor="middle" x="101.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.58,-148.43C39.78,-156.38 54.76,-167.68 68.5,-176.62 69.54,-177.3 70.6,-177.97 71.68,-178.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.87,-181.65 80.25,-183.76 73.45,-175.63 69.87,-181.65"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="134,-167.25 68.5,-167.25 68.5,-148 134,-148 134,-167.25"/>
-<text text-anchor="middle" x="101.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-142.2C39.86,-143.8 48.5,-145.78 57.22,-147.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.2,-151.13 66.73,-149.95 57.77,-144.31 56.2,-151.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="134,-130.25 68.5,-130.25 68.5,-111 134,-111 134,-130.25"/>
-<text text-anchor="middle" x="101.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-135.24C39.86,-133.72 48.5,-131.85 57.22,-129.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="57.7,-133.43 66.73,-127.89 56.21,-126.59 57.7,-133.43"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="134,-93.25 68.5,-93.25 68.5,-74 134,-74 134,-93.25"/>
-<text text-anchor="middle" x="101.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.04,-128.79C40.24,-121.1 55.02,-110.28 68.5,-101.62 69.7,-100.86 70.93,-100.08 72.19,-99.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="73.78,-102.44 80.61,-94.34 70.22,-96.41 73.78,-102.44"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2" target="_top" xlink:title="A Test to check correct functionality with an array sorted using std::sort.">
-<polygon fill="white" stroke="#666666" points="134,-56.25 68.5,-56.25 68.5,-37 134,-37 134,-56.25"/>
-<text text-anchor="middle" x="101.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test6</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M22.23,-128.71C30.27,-113.44 47.39,-83.92 68.5,-64.62 69.11,-64.06 69.75,-63.51 70.4,-62.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.09,-66.06 78.27,-57.45 68.07,-60.33 72.09,-66.06"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.75,-130.25 170,-130.25 170,-111 285.75,-111 285.75,-130.25"/>
-<text text-anchor="middle" x="227.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-120.62C141.78,-120.62 149.98,-120.62 158.32,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="158.23,-124.13 168.23,-120.63 158.23,-117.13 158.23,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="273.75,-93.25 182,-93.25 182,-74 273.75,-74 273.75,-93.25"/>
-<text text-anchor="middle" x="227.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node9 -->
-<g id="edge8_Node000008_Node000009" class="edge">
-<title>Node8&#45;&gt;Node9</title>
-<g id="a_edge8_Node000008_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-56.15C148.99,-60.5 166.58,-65.72 182.47,-70.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.11,-73.69 191.7,-73.18 183.11,-66.98 181.11,-73.69"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270,-56.25 185.75,-56.25 185.75,-37 270,-37 270,-56.25"/>
-<text text-anchor="middle" x="227.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node10 -->
-<g id="edge9_Node000008_Node000010" class="edge">
-<title>Node8&#45;&gt;Node10</title>
-<g id="a_edge9_Node000008_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-46.62C146.51,-46.62 160.71,-46.62 174.28,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.96,-50.13 183.96,-46.63 173.96,-43.13 173.96,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="253.88,-19.25 201.88,-19.25 201.88,0 253.88,0 253.88,-19.25"/>
-<text text-anchor="middle" x="227.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node11 -->
-<g id="edge10_Node000008_Node000011" class="edge">
-<title>Node8&#45;&gt;Node11</title>
-<g id="a_edge10_Node000008_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.34,-37.1C151.58,-31.98 172.89,-25.65 190.71,-20.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.53,-23.77 200.12,-17.57 189.53,-17.06 191.53,-23.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 9a1f3804f..000000000
--- a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,25 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="main function" alt="" coords="5,129,55,155"/>
-<area shape="rect" id="Node000002" href="$de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function to test the correctness of get_intersection() function." alt="" coords="103,129,146,155"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,140,87,140,87,145,55,145"/>
-<area shape="rect" id="Node000003" href="$d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" title="A Test to check an simple case." alt="" coords="194,5,281,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="130,127,154,86,192,40,195,38,198,42,196,44,159,89,135,130"/>
-<area shape="rect" id="Node000004" href="$d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" title="A Test to check an empty vector." alt="" coords="194,55,281,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="141,127,193,89,197,87,200,91,195,94,144,131"/>
-<area shape="rect" id="Node000005" href="$d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" title="A Test to check an invalid shift value." alt="" coords="194,104,281,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="146,135,178,127,180,133,147,140"/>
-<area shape="rect" id="Node000006" href="$d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" title="A Test to check a very large input." alt="" coords="194,153,281,179"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="147,144,180,151,178,156,146,149"/>
-<area shape="rect" id="Node000008" href="$d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" title="A Test to check a shift of zero." alt="" coords="194,203,281,228"/>
-<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="144,153,195,189,200,192,197,197,193,194,141,157"/>
-<area shape="rect" id="Node000009" href="$d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2" title="A Test to check correct functionality with an array sorted using std::sort." alt="" coords="194,252,281,278"/>
-<area shape="poly" id="edge8_Node000002_Node000009" title=" " alt="" coords="135,154,159,195,196,239,198,241,195,245,192,243,154,198,130,157"/>
-<area shape="rect" id="Node000007" 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="329,153,484,179"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="282,164,314,164,314,169,282,169"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="345,203,468,228"/>
-<area shape="poly" id="edge9_Node000009_Node000010" title=" " alt="" coords="281,250,345,231,347,236,283,255"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="350,252,463,278"/>
-<area shape="poly" id="edge10_Node000009_Node000011" title=" " alt="" coords="282,262,335,262,335,268,282,268"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/sort.html#" title=" " alt="" coords="372,301,441,327"/>
-<area shape="poly" id="edge11_Node000009_Node000012" title=" " alt="" coords="283,275,358,297,356,302,281,280"/>
-</map>
diff --git a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 084d0bd90..000000000
--- a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b48488da51e5900aa2f04faae1461395
\ No newline at end of file
diff --git a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 5ebbcb6f8..000000000
--- a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,245 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="367pt" height="249pt"
- viewBox="0.00 0.00 366.75 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-148.25 0,-148.25 0,-129 37,-129 37,-148.25"/>
-<text text-anchor="middle" x="18.5" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the correctness of get_intersection() function.">
-<polygon fill="white" stroke="#666666" points="105.5,-148.25 73,-148.25 73,-129 105.5,-129 105.5,-148.25"/>
-<text text-anchor="middle" x="89.25" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-138.62C44.58,-138.62 53.31,-138.62 61.45,-138.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-142.13 71.2,-138.63 61.2,-135.13 61.2,-142.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="207,-241.25 141.5,-241.25 141.5,-222 207,-222 207,-241.25"/>
-<text text-anchor="middle" x="174.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.19,-148.68C103.2,-164.16 120.26,-194.09 141.5,-213.62 142.11,-214.19 142.74,-214.74 143.39,-215.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.06,-217.92 151.26,-220.81 145.09,-212.2 141.06,-217.92"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="207,-204.25 141.5,-204.25 141.5,-185 207,-185 207,-204.25"/>
-<text text-anchor="middle" x="174.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.58,-148.43C112.78,-156.38 127.76,-167.68 141.5,-176.62 142.54,-177.3 143.6,-177.97 144.68,-178.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.87,-181.65 153.25,-183.76 146.45,-175.63 142.87,-181.65"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="207,-167.25 141.5,-167.25 141.5,-148 207,-148 207,-167.25"/>
-<text text-anchor="middle" x="174.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-142.2C112.86,-143.8 121.5,-145.78 130.22,-147.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.2,-151.13 139.73,-149.95 130.77,-144.31 129.2,-151.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="207,-130.25 141.5,-130.25 141.5,-111 207,-111 207,-130.25"/>
-<text text-anchor="middle" x="174.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-135.24C112.86,-133.72 121.5,-131.85 130.22,-129.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.7,-133.43 139.73,-127.89 129.21,-126.59 130.7,-133.43"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="207,-93.25 141.5,-93.25 141.5,-74 207,-74 207,-93.25"/>
-<text text-anchor="middle" x="174.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.04,-128.79C113.24,-121.1 128.02,-110.28 141.5,-101.62 142.7,-100.86 143.93,-100.08 145.19,-99.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.78,-102.44 153.61,-94.34 143.22,-96.41 146.78,-102.44"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2" target="_top" xlink:title="A Test to check correct functionality with an array sorted using std::sort.">
-<polygon fill="white" stroke="#666666" points="207,-56.25 141.5,-56.25 141.5,-37 207,-37 207,-56.25"/>
-<text text-anchor="middle" x="174.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test6</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.23,-128.71C103.27,-113.44 120.39,-83.92 141.5,-64.62 142.11,-64.06 142.75,-63.51 143.4,-62.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.09,-66.06 151.27,-57.45 141.07,-60.33 145.09,-66.06"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.75,-130.25 243,-130.25 243,-111 358.75,-111 358.75,-130.25"/>
-<text text-anchor="middle" x="300.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-120.62C214.78,-120.62 222.98,-120.62 231.32,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.23,-124.13 241.23,-120.63 231.23,-117.13 231.23,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="346.75,-93.25 255,-93.25 255,-74 346.75,-74 346.75,-93.25"/>
-<text text-anchor="middle" x="300.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-56.15C221.99,-60.5 239.58,-65.72 255.47,-70.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.11,-73.69 264.7,-73.18 256.11,-66.98 254.11,-73.69"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="343,-56.25 258.75,-56.25 258.75,-37 343,-37 343,-56.25"/>
-<text text-anchor="middle" x="300.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge10_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge10_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-46.62C219.51,-46.62 233.71,-46.62 247.28,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.96,-50.13 256.96,-46.63 246.96,-43.13 246.96,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="326.88,-19.25 274.88,-19.25 274.88,0 326.88,0 326.88,-19.25"/>
-<text text-anchor="middle" x="300.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node12 -->
-<g id="edge11_Node000009_Node000012" class="edge">
-<title>Node9&#45;&gt;Node12</title>
-<g id="a_edge11_Node000009_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-37.1C224.58,-31.98 245.89,-25.65 263.71,-20.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="264.53,-23.77 273.12,-17.57 262.53,-17.06 264.53,-23.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index b060e2272..000000000
--- a/de/dc5/intersection__of__two__arrays_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,219 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="367pt" height="249pt"
- viewBox="0.00 0.00 366.75 249.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 245.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="main function">
-<polygon fill="#999999" stroke="#666666" points="37,-148.25 0,-148.25 0,-129 37,-129 37,-148.25"/>
-<text text-anchor="middle" x="18.5" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the correctness of get_intersection() function.">
-<polygon fill="white" stroke="#666666" points="105.5,-148.25 73,-148.25 73,-129 105.5,-129 105.5,-148.25"/>
-<text text-anchor="middle" x="89.25" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-138.62C44.58,-138.62 53.31,-138.62 61.45,-138.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-142.13 71.2,-138.63 61.2,-135.13 61.2,-142.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5" target="_top" xlink:title="A Test to check an simple case.">
-<polygon fill="white" stroke="#666666" points="207,-241.25 141.5,-241.25 141.5,-222 207,-222 207,-241.25"/>
-<text text-anchor="middle" x="174.25" y="-227.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test1</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.19,-148.68C103.2,-164.16 120.26,-194.09 141.5,-213.62 142.11,-214.19 142.74,-214.74 143.39,-215.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.06,-217.92 151.26,-220.81 145.09,-212.2 141.06,-217.92"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669" target="_top" xlink:title="A Test to check an empty vector.">
-<polygon fill="white" stroke="#666666" points="207,-204.25 141.5,-204.25 141.5,-185 207,-185 207,-204.25"/>
-<text text-anchor="middle" x="174.25" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test2</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M102.58,-148.43C112.78,-156.38 127.76,-167.68 141.5,-176.62 142.54,-177.3 143.6,-177.97 144.68,-178.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.87,-181.65 153.25,-183.76 146.45,-175.63 142.87,-181.65"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76" target="_top" xlink:title="A Test to check an invalid shift value.">
-<polygon fill="white" stroke="#666666" points="207,-167.25 141.5,-167.25 141.5,-148 207,-148 207,-167.25"/>
-<text text-anchor="middle" x="174.25" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test3</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-142.2C112.86,-143.8 121.5,-145.78 130.22,-147.78"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.2,-151.13 139.73,-149.95 130.77,-144.31 129.2,-151.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d" target="_top" xlink:title="A Test to check a very large input.">
-<polygon fill="white" stroke="#666666" points="207,-130.25 141.5,-130.25 141.5,-111 207,-111 207,-130.25"/>
-<text text-anchor="middle" x="174.25" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test4</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-135.24C112.86,-133.72 121.5,-131.85 130.22,-129.96"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.7,-133.43 139.73,-127.89 129.21,-126.59 130.7,-133.43"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86" target="_top" xlink:title="A Test to check a shift of zero.">
-<polygon fill="white" stroke="#666666" points="207,-93.25 141.5,-93.25 141.5,-74 207,-74 207,-93.25"/>
-<text text-anchor="middle" x="174.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test5</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge7_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.04,-128.79C113.24,-121.1 128.02,-110.28 141.5,-101.62 142.7,-100.86 143.93,-100.08 145.19,-99.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="146.78,-102.44 153.61,-94.34 143.22,-96.41 146.78,-102.44"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2" target="_top" xlink:title="A Test to check correct functionality with an array sorted using std::sort.">
-<polygon fill="white" stroke="#666666" points="207,-56.25 141.5,-56.25 141.5,-37 207,-37 207,-56.25"/>
-<text text-anchor="middle" x="174.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::test6</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M95.23,-128.71C103.27,-113.44 120.39,-83.92 141.5,-64.62 142.11,-64.06 142.75,-63.51 143.4,-62.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="145.09,-66.06 151.27,-57.45 141.07,-60.33 145.09,-66.06"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.75,-130.25 243,-130.25 243,-111 358.75,-111 358.75,-130.25"/>
-<text text-anchor="middle" x="300.88" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-120.62C214.78,-120.62 222.98,-120.62 231.32,-120.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="231.23,-124.13 241.23,-120.63 231.23,-117.13 231.23,-124.13"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="346.75,-93.25 255,-93.25 255,-74 346.75,-74 346.75,-93.25"/>
-<text text-anchor="middle" x="300.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-56.15C221.99,-60.5 239.58,-65.72 255.47,-70.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.11,-73.69 264.7,-73.18 256.11,-66.98 254.11,-73.69"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="343,-56.25 258.75,-56.25 258.75,-37 343,-37 343,-56.25"/>
-<text text-anchor="middle" x="300.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge10_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge10_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-46.62C219.51,-46.62 233.71,-46.62 247.28,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="246.96,-50.13 256.96,-46.63 246.96,-43.13 246.96,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="326.88,-19.25 274.88,-19.25 274.88,0 326.88,0 326.88,-19.25"/>
-<text text-anchor="middle" x="300.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sort</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node12 -->
-<g id="edge11_Node000009_Node000012" class="edge">
-<title>Node9&#45;&gt;Node12</title>
-<g id="a_edge11_Node000009_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.34,-37.1C224.58,-31.98 245.89,-25.65 263.71,-20.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="264.53,-23.77 273.12,-17.57 262.53,-17.06 264.53,-23.77"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dc5/intersection__of__two__arrays_8cpp_source.html b/de/dc5/intersection__of__two__arrays_8cpp_source.html
new file mode 100644
index 000000000..8812a11de
--- /dev/null
+++ b/de/dc5/intersection__of__two__arrays_8cpp_source.html
@@ -0,0 +1,291 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: operations_on_datastructures/intersection_of_two_arrays.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/dc5/intersection__of__two__arrays_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">intersection_of_two_arrays.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/dc5/intersection__of__two__arrays_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a> {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">print</a>(<span class="keyword">const</span> std::vector&lt;int32_t&gt; &amp;array) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordflow">for</span> (int32_t i : array) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;  </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    }</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;  </div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>}</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="foldopen" id="foldopen00049" data-start="{" data-end="}">
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"><a class="line" href="../../da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e">   49</a></span>std::vector&lt;int32_t&gt; <a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e">get_intersection</a>(<span class="keyword">const</span> std::vector&lt;int32_t&gt; &amp;first,</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>                                      <span class="keyword">const</span> std::vector&lt;int32_t&gt; &amp;second) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    std::vector&lt;int32_t&gt; res;         </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordtype">size_t</span> f_index = 0;               </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordtype">size_t</span> s_index = 0;               </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordtype">size_t</span> f_length = first.size();   </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordtype">size_t</span> s_length = second.size();  </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="keywordflow">while</span> (f_index &lt; f_length &amp;&amp; s_index &lt; s_length) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordflow">if</span> (first[f_index] &lt; second[s_index]) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            f_index++;  </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (first[f_index] &gt; second[s_index]) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>            s_index++;  </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            <span class="keywordflow">if</span> ((res.size() == 0) || (first[f_index] != res.back())) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>                res.push_back(</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>                    first[f_index]);  </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            f_index++;  </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            s_index++;  </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    }</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordflow">return</span> res;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>}</div>
+</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>}  <span class="comment">// namespace operations_on_datastructures</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/df4/namespacetests.html">tests</a> {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span><span class="keyword">using </span><a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e">operations_on_datastructures::get_intersection</a>;</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span><span class="keyword">using </span><a class="code hl_function" href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures::print</a>;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">test1</a>() {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 1\n&quot;</span>;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Intialized a = {} b = {}\n&quot;</span>;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {}\n&quot;</span>;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    std::vector&lt;int32_t&gt; a = {};</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    std::vector&lt;int32_t&gt; b = {};</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    std::vector&lt;int32_t&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = get_intersection(a, b);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    assert(result == a);  </div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    print(result);        </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>}</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">test2</a>() {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 2\n&quot;</span>;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Intialized a = {} b = {2, 3}\n&quot;</span>;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {}\n&quot;</span>;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    std::vector&lt;int32_t&gt; a = {};</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    std::vector&lt;int32_t&gt; b = {2, 3};</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    std::vector&lt;int32_t&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = get_intersection(a, b);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    assert(result == a);  </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    print(result);        </div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>}</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">test3</a>() {</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 3\n&quot;</span>;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Intialized a = {4, 6} b = {3, 6}\n&quot;</span>;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {6}\n&quot;</span>;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    std::vector&lt;int32_t&gt; a = {4, 6};</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    std::vector&lt;int32_t&gt; b = {3, 6};</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    std::vector&lt;int32_t&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = get_intersection(a, b);</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    std::vector&lt;int32_t&gt; expected = {6};</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    assert(result == expected);  </div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    print(result);               </div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>}</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">test4</a>() {</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 4\n&quot;</span>;</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Intialized a = {4, 6, 6, 6} b = {2, 4, 4, 6}\n&quot;</span>;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {4, 6}\n&quot;</span>;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    std::vector&lt;int32_t&gt; a = {4, 6, 6, 6};</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    std::vector&lt;int32_t&gt; b = {2, 4, 4, 6};</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    std::vector&lt;int32_t&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = get_intersection(a, b);</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    std::vector&lt;int32_t&gt; expected = {4, 6};</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    assert(result == expected);  </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    print(result);               </div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>}</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">test5</a>() {</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 5\n&quot;</span>;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Intialized a = {1, 2, 3, 4, 6, 7, 9} b = {2, 3, 4, 5}\n&quot;</span>;</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {2, 3, 4}\n&quot;</span>;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    std::vector&lt;int32_t&gt; a = {1, 2, 3, 4, 6, 7, 9};</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    std::vector&lt;int32_t&gt; b = {2, 3, 4, 5};</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>    std::vector&lt;int32_t&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = get_intersection(a, b);</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>    std::vector&lt;int32_t&gt; expected = {2, 3, 4};</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    assert(result == expected);  </div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>    print(result);               </div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>}</div>
+<div class="foldopen" id="foldopen00166" data-start="{" data-end="}">
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"><a class="line" href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">  166</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">test6</a>() {</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST CASE 6\n&quot;</span>;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Intialized a = {1, 3, 3, 2, 5, 9, 4, 7, 3, 2} &quot;</span>;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;b = {11, 3, 7, 8, 6}\n&quot;</span>;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Expected result: {3, 7}\n&quot;</span>;</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    std::vector&lt;int32_t&gt; a = {1, 3, 3, 2, 5, 9, 4, 7, 3, 2};</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    std::vector&lt;int32_t&gt; b = {11, 3, 7, 8, 6};</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    std::sort(a.begin(), a.end());  </div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    std::sort(b.begin(), b.end());  </div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    std::vector&lt;int32_t&gt; result = get_intersection(a, b);</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    std::vector&lt;int32_t&gt; expected = {3, 7};</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    assert(result == expected);  </div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    print(result);               </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;TEST PASSED!\n\n&quot;</span>;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>}</div>
+</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>}  <span class="comment">// namespace tests</span></div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span> </div>
+<div class="foldopen" id="foldopen00187" data-start="{" data-end="}">
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"><a class="line" href="../../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  187</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a>();</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a>();</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a>();</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a>();</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a>();</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    <a class="code hl_function" href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">tests::test6</a>();</div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>}</div>
+</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span> </div>
+<div class="foldopen" id="foldopen00200" data-start="{" data-end="}">
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"><a class="line" href="../../de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  200</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    <a class="code hl_function" href="../../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>}</div>
+</div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+<div class="ttc" id="aintersection__of__two__arrays_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the correctness of get_intersection() function.</div><div class="ttdef"><b>Definition</b> <a href="#l00187">intersection_of_two_arrays.cpp:187</a></div></div>
+<div class="ttc" id="aintersection__of__two__arrays_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition</b> <a href="#l00200">intersection_of_two_arrays.cpp:200</a></div></div>
+<div class="ttc" id="anamespaceoperations__on__datastructures_html"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></div><div class="ttdoc">for std::vector</div></div>
+<div class="ttc" id="anamespaceoperations__on__datastructures_html_a6109193567a5b7e36a27f2b4865fce20"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20">operations_on_datastructures::print</a></div><div class="ttdeci">void print(const std::vector&lt; int32_t &gt; &amp;array)</div><div class="ttdoc">Prints the values of a vector sequentially, ending with a newline character.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00029">array_left_rotation.cpp:29</a></div></div>
+<div class="ttc" id="anamespaceoperations__on__datastructures_html_adaf9a06f0c236c2d95c97e441ea2d12e"><div class="ttname"><a href="../../da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e">operations_on_datastructures::get_intersection</a></div><div class="ttdeci">std::vector&lt; int32_t &gt; get_intersection(const std::vector&lt; int32_t &gt; &amp;first, const std::vector&lt; int32_t &gt; &amp;second)</div><div class="ttdoc">Gets the intersection of two sorted arrays, and returns them in a vector.</div><div class="ttdef"><b>Definition</b> <a href="#l00049">intersection_of_two_arrays.cpp:49</a></div></div>
+<div class="ttc" id="anamespacetests_html"><div class="ttname"><a href="../../d9/df4/namespacetests.html">tests</a></div><div class="ttdoc">Testcases to check Union of Two Arrays.</div></div>
+<div class="ttc" id="anamespacetests_html_a167c24bd817469ae47358d12e034f2d5"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5">tests::test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">A Test to check an simple case.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00075">array_left_rotation.cpp:75</a></div></div>
+<div class="ttc" id="anamespacetests_html_a2b9769e44683dcb67fe1083ad91e134d"><div class="ttname"><a href="../../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d">tests::test4</a></div><div class="ttdeci">void test4()</div><div class="ttdoc">A Test to check a very large input.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00120">array_left_rotation.cpp:120</a></div></div>
+<div class="ttc" id="anamespacetests_html_aa515639572647508b94986489aab6d76"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76">tests::test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">A Test to check an invalid shift value.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00105">array_left_rotation.cpp:105</a></div></div>
+<div class="ttc" id="anamespacetests_html_aacafde185abd8670abee51157f273dc2"><div class="ttname"><a href="../../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2">tests::test6</a></div><div class="ttdeci">void test6()</div><div class="ttdoc">A Test to check correct functionality with an array sorted using std::sort.</div><div class="ttdef"><b>Definition</b> <a href="#l00166">intersection_of_two_arrays.cpp:166</a></div></div>
+<div class="ttc" id="anamespacetests_html_abdd77344d4af8fd56d14a5cabbf2f669"><div class="ttname"><a href="../../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669">tests::test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">A Test to check an empty vector.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00090">array_left_rotation.cpp:90</a></div></div>
+<div class="ttc" id="anamespacetests_html_af7b81d7a1534216af6a36a80135beb86"><div class="ttname"><a href="../../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86">tests::test5</a></div><div class="ttdeci">void test5()</div><div class="ttdoc">A Test to check a shift of zero.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d14/array__left__rotation_8cpp_source.html#l00143">array_left_rotation.cpp:143</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><a class="el" href="../../de/dc5/intersection__of__two__arrays_8cpp.html">intersection_of_two_arrays.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/dc8/classlarge__number-members.html b/de/dc8/classlarge__number-members.html
index df66a3b39..6b313b3e0 100644
--- a/de/dc8/classlarge__number-members.html
+++ b/de/dc8/classlarge__number-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/dcd/kadanes3_8cpp.html b/de/dcd/kadanes3_8cpp.html
index 67889d96d..7b6c069ef 100644
--- a/de/dcd/kadanes3_8cpp.html
+++ b/de/dcd/kadanes3_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/kadanes3.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/kadanes3.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,11 +139,13 @@ Include dependency graph for kadanes3.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/dbb/kadanes3_8cpp__incl.svg" width="412" height="111"><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">
+</div>
+<p><a href="../../de/dcd/kadanes3_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a338439a04148ae89f695595acfa5c147" id="r_a338439a04148ae89f695595acfa5c147"><td class="memTemplParams" colspan="2">template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> SIZE&gt; </td></tr>
-<tr class="memitem:a338439a04148ae89f695595acfa5c147"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a338439a04148ae89f695595acfa5c147">max_subarray_sum</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int64_t, SIZE &gt; arr, uint64_t length)</td></tr>
+<tr class="memitem:a338439a04148ae89f695595acfa5c147" id="r_a338439a04148ae89f695595acfa5c147"><td class="memTemplParams" colspan="2">template&lt;std::size_t SIZE&gt; </td></tr>
+<tr class="memitem:a338439a04148ae89f695595acfa5c147"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a338439a04148ae89f695595acfa5c147">max_subarray_sum</a> (std::array&lt; int64_t, SIZE &gt; arr, uint64_t length)</td></tr>
 <tr class="memdesc:a338439a04148ae89f695595acfa5c147"><td class="mdescLeft">&#160;</td><td class="mdescRight">for IO operations  <br /></td></tr>
 <tr class="separator:a338439a04148ae89f695595acfa5c147"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -140,6 +159,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>Efficient implementation for maximum contiguous subarray sum by <a href="https://www.geeksforgeeks.org/largest-sum-contiguous-subarray/" target="_blank">Kadane's algorithm</a>. </p>
 <p>Our task is to take length of array and then the whole array as input from the user and then calculate the maximum contiguos subarray sum for the input array, using the kadane's algorithm.</p>
 <p>There can be a case that all the elements in the input array are negative. In that case, the least value among all elements is the maximum sum with subarray length = 1. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/thisabhijeet" target="_blank">Abhijeet Tiwari</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../de/dcd/kadanes3_8cpp_source.html">kadanes3.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -158,6 +179,8 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dcd/kadanes3_8cpp_source.html#l00060">60</a> of file <a class="el" href="../../de/dcd/kadanes3_8cpp_source.html">kadanes3.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   60</span>           {</div>
 <div class="line"><span class="lineno">   61</span>    <span class="comment">// Below is the code for accepting array from the user and then</span></div>
 <div class="line"><span class="lineno">   62</span>    <span class="comment">// calling the function for the required output.</span></div>
@@ -185,13 +208,8 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   84</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">   85</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   86</span>}</div>
-<div class="ttc" id="akadanes3_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> kadanes3.cpp:48</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dcd/kadanes3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="335" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="akadanes3_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dcd/kadanes3_8cpp_source.html#l00048">kadanes3.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a338439a04148ae89f695595acfa5c147" name="a338439a04148ae89f695595acfa5c147"></a>
@@ -200,12 +218,12 @@ Here is the call graph for this function:</div>
 <div class="memitem">
 <div class="memproto">
 <div class="memtemplate">
-template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> SIZE&gt; </div>
+template&lt;std::size_t SIZE&gt; </div>
       <table class="memname">
         <tr>
           <td class="memname">int max_subarray_sum </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int64_t, SIZE &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
+          <td class="paramtype">std::array&lt; int64_t, SIZE &gt;</td>          <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -216,7 +234,7 @@ template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/
 </div><div class="memdoc">
 
 <p>for IO operations </p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for assert for INT_MIN value</p>
+<p>for std::array for assert for INT_MIN value</p>
 <p>Utility function to check the current maximum number </p><dl class="params"><dt>Parameters</dt><dd>
   <table class="params">
     <tr><td class="paramname">arr</td><td>input array </td></tr>
@@ -225,6 +243,8 @@ template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>maximum contiguous subarray sum </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dcd/kadanes3_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../de/dcd/kadanes3_8cpp_source.html">kadanes3.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   29</span>                                                                   {</div>
 <div class="line"><span class="lineno">   30</span>    int64_t current_max = INT_MIN, current_sum = 0;</div>
 <div class="line"><span class="lineno">   31</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; length; i++) {</div>
@@ -267,22 +287,17 @@ template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/
 
 <p>Self-test implementations. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dcd/kadanes3_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../de/dcd/kadanes3_8cpp_source.html">kadanes3.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   48</span>                   {</div>
-<div class="line"><span class="lineno">   49</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int64_t, 4&gt;</a> arr = {1, 2, 3, 4};</div>
-<div class="line"><span class="lineno">   50</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int64_t, 5&gt;</a> arr1 = {-1, -2, -4, -6, 7};</div>
+<div class="line"><span class="lineno">   49</span>    std::array&lt;int64_t, 4&gt; arr = {1, 2, 3, 4};</div>
+<div class="line"><span class="lineno">   50</span>    std::array&lt;int64_t, 5&gt; arr1 = {-1, -2, -4, -6, 7};</div>
 <div class="line"><span class="lineno">   51</span>    assert(<a class="code hl_function" href="#a338439a04148ae89f695595acfa5c147">max_subarray_sum</a>(arr, 4) == 10);</div>
 <div class="line"><span class="lineno">   52</span>    assert(<a class="code hl_function" href="#a338439a04148ae89f695595acfa5c147">max_subarray_sum</a>(arr1, 5) == 7);</div>
-<div class="line"><span class="lineno">   53</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All test cases have passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   53</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases have passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   54</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="akadanes3_8cpp_html_a338439a04148ae89f695595acfa5c147"><div class="ttname"><a href="#a338439a04148ae89f695595acfa5c147">max_subarray_sum</a></div><div class="ttdeci">int max_subarray_sum(std::array&lt; int64_t, SIZE &gt; arr, uint64_t length)</div><div class="ttdoc">for IO operations</div><div class="ttdef"><b>Definition</b> kadanes3.cpp:29</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dcd/kadanes3_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="238" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="akadanes3_8cpp_html_a338439a04148ae89f695595acfa5c147"><div class="ttname"><a href="#a338439a04148ae89f695595acfa5c147">max_subarray_sum</a></div><div class="ttdeci">int max_subarray_sum(std::array&lt; int64_t, SIZE &gt; arr, uint64_t length)</div><div class="ttdoc">for IO operations</div><div class="ttdef"><b>Definition</b> <a href="../../de/dcd/kadanes3_8cpp_source.html#l00029">kadanes3.cpp:29</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/de/dcd/kadanes3_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/de/dcd/kadanes3_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index f71d0b4d6..000000000
--- a/de/dcd/kadanes3_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="$de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147" title="for IO operations" alt="" coords="97,5,232,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/de/dcd/kadanes3_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/de/dcd/kadanes3_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 01a3b41e0..000000000
--- a/de/dcd/kadanes3_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3ca71952eb4f6d73c7f63d8b9ad7a100
\ No newline at end of file
diff --git a/de/dcd/kadanes3_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/de/dcd/kadanes3_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 8138b0d90..000000000
--- a/de/dcd/kadanes3_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="178pt" height="27pt"
- viewBox="0.00 0.00 178.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="170,-19.25 68.5,-19.25 68.5,0 170,0 170,-19.25"/>
-<text text-anchor="middle" x="119.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">max_subarray_sum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.59,-9.62C39.34,-9.62 47.76,-9.62 56.66,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.59,-13.13 66.59,-9.63 56.59,-6.13 56.59,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dcd/kadanes3_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/de/dcd/kadanes3_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index e33485a8b..000000000
--- a/de/dcd/kadanes3_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="178pt" height="27pt"
- viewBox="0.00 0.00 178.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="170,-19.25 68.5,-19.25 68.5,0 170,0 170,-19.25"/>
-<text text-anchor="middle" x="119.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">max_subarray_sum</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.59,-9.62C39.34,-9.62 47.76,-9.62 56.66,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.59,-13.13 66.59,-9.63 56.59,-6.13 56.59,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dcd/kadanes3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/dcd/kadanes3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 7df93ccd9..000000000
--- a/de/dcd/kadanes3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="$de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147" title="for IO operations" alt="" coords="194,5,329,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/de/dcd/kadanes3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/dcd/kadanes3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index e4e4a0266..000000000
--- a/de/dcd/kadanes3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1c0e3fc0a9786099443ee3035389acba
\ No newline at end of file
diff --git a/de/dcd/kadanes3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/dcd/kadanes3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index f64b9161e..000000000
--- a/de/dcd/kadanes3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="251pt" height="27pt"
- viewBox="0.00 0.00 251.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="243,-19.25 141.5,-19.25 141.5,0 243,0 243,-19.25"/>
-<text text-anchor="middle" x="192.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">max_subarray_sum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.59,-9.62C112.34,-9.62 120.76,-9.62 129.66,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.59,-13.13 139.59,-9.63 129.59,-6.13 129.59,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dcd/kadanes3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/dcd/kadanes3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index b5bbe5a66..000000000
--- a/de/dcd/kadanes3_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="251pt" height="27pt"
- viewBox="0.00 0.00 251.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147" target="_top" xlink:title="for IO operations">
-<polygon fill="white" stroke="#666666" points="243,-19.25 141.5,-19.25 141.5,0 243,0 243,-19.25"/>
-<text text-anchor="middle" x="192.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">max_subarray_sum</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.59,-9.62C112.34,-9.62 120.76,-9.62 129.66,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.59,-13.13 139.59,-9.63 129.59,-6.13 129.59,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dcd/kadanes3_8cpp_source.html b/de/dcd/kadanes3_8cpp_source.html
new file mode 100644
index 000000000..de8e1b823
--- /dev/null
+++ b/de/dcd/kadanes3_8cpp_source.html
@@ -0,0 +1,203 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/kadanes3.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/dcd/kadanes3_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">kadanes3.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/dcd/kadanes3_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;array&gt;</span>     </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;climits&gt;</span>   </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">template</span> &lt;std::<span class="keywordtype">size_t</span> SIZE&gt;</div>
+<div class="foldopen" id="foldopen00029" data-start="{" data-end="}">
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"><a class="line" href="../../de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147">   29</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147">max_subarray_sum</a>(std::array&lt;int64_t, SIZE&gt; arr, uint64_t length) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    int64_t current_max = INT_MIN, current_sum = 0;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; length; i++) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        current_sum = current_sum + arr[i];</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        <span class="keywordflow">if</span> (current_max &lt; current_sum) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>            current_max = current_sum;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        }</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        <span class="keywordflow">if</span> (current_sum &lt; 0) {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>            current_sum = 0;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        }</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    }</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">return</span> current_max;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>}</div>
+</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="foldopen" id="foldopen00048" data-start="{" data-end="}">
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"><a class="line" href="../../de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   48</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    std::array&lt;int64_t, 4&gt; arr = {1, 2, 3, 4};</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    std::array&lt;int64_t, 5&gt; arr1 = {-1, -2, -4, -6, 7};</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    assert(<a class="code hl_function" href="../../de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147">max_subarray_sum</a>(arr, 4) == 10);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    assert(<a class="code hl_function" href="../../de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147">max_subarray_sum</a>(arr1, 5) == 7);</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All test cases have passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>}</div>
+</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="foldopen" id="foldopen00060" data-start="{" data-end="}">
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"><a class="line" href="../../de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   60</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="comment">// Below is the code for accepting array from the user and then</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="comment">// calling the function for the required output.</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="comment">// It has been commented for now so that the test() function can run</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="comment">// and the test cases can be verified.</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="comment">// code for accepting array from user starts</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="comment">// std::size_t n;  // variable for length of input array</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="comment">// std::cout &lt;&lt; &quot;Enter length of the array: &quot;;</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="comment">// std::cin &gt;&gt; n;</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="comment">// std::array&lt;int64_t, 100&gt; arr = {0};</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="comment">// // we need to give a constant in size. Hence we have allocated 100</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <span class="comment">// for now.</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="comment">// for (int i = 0; i &lt; n; i++)</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="comment">// taking input of each element of the array</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="comment">// {</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="comment">//     std::cin &gt;&gt; arr[i];</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="comment">// }</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="comment">// code for accepting array from user ends</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="comment">// int max_sum = max_subarray_sum(arr, n);</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="comment">// std::cout &lt;&lt; &quot;Maximum contiguous sum for this array is : &quot; &lt;&lt; max_sum</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="comment">//           &lt;&lt; std::endl;</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <a class="code hl_function" href="../../de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>}</div>
+</div>
+<div class="ttc" id="akadanes3_8cpp_html_a338439a04148ae89f695595acfa5c147"><div class="ttname"><a href="../../de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147">max_subarray_sum</a></div><div class="ttdeci">int max_subarray_sum(std::array&lt; int64_t, SIZE &gt; arr, uint64_t length)</div><div class="ttdoc">for IO operations</div><div class="ttdef"><b>Definition</b> <a href="#l00029">kadanes3.cpp:29</a></div></div>
+<div class="ttc" id="akadanes3_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../de/dcd/kadanes3_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> <a href="#l00048">kadanes3.cpp:48</a></div></div>
+<div class="ttc" id="akadanes3_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00060">kadanes3.cpp:60</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../de/dcd/kadanes3_8cpp.html">kadanes3.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/dcf/binary__exponent_8cpp.html b/de/dcf/binary__exponent_8cpp.html
index c2451b4e4..55ce27b73 100644
--- a/de/dcf/binary__exponent_8cpp.html
+++ b/de/dcf/binary__exponent_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/binary_exponent.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/binary_exponent.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,7 +135,9 @@ Include dependency graph for binary_exponent.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d36/binary__exponent_8cpp__incl.svg" width="186" height="111"><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">
+</div>
+<p><a href="../../de/dcf/binary__exponent_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:aeb48dce0725e63d19147944f41843c73" id="r_aeb48dce0725e63d19147944f41843c73"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aeb48dce0725e63d19147944f41843c73">binExpo</a> (int a, int b)</td></tr>
@@ -142,6 +161,8 @@ Functions</h2></td></tr>
 \end{eqnarray*}
 </p>
 <p> Hence to calculate 2^10 we only need to multiply \(2^8\) and \(2^2\) skipping \(2^1\) and \(2^4\). </p>
+
+<p class="definition">Definition in file <a class="el" href="../../de/dcf/binary__exponent_8cpp_source.html">binary_exponent.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="aeb48dce0725e63d19147944f41843c73" name="aeb48dce0725e63d19147944f41843c73"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aeb48dce0725e63d19147944f41843c73">&#9670;&#160;</a></span>binExpo()</h2>
@@ -162,6 +183,8 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Recursive function to calculate exponent in \(O(\log(n))\) using binary exponent. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dcf/binary__exponent_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../de/dcf/binary__exponent_8cpp_source.html">binary_exponent.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   28</span>                          {</div>
 <div class="line"><span class="lineno">   29</span>    <span class="keywordflow">if</span> (b == 0) {</div>
 <div class="line"><span class="lineno">   30</span>        <span class="keywordflow">return</span> 1;</div>
@@ -173,13 +196,8 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   36</span>        <span class="keywordflow">return</span> res * res;</div>
 <div class="line"><span class="lineno">   37</span>    }</div>
 <div class="line"><span class="lineno">   38</span>}</div>
-<div class="ttc" id="abinary__exponent_8cpp_html_aeb48dce0725e63d19147944f41843c73"><div class="ttname"><a href="#aeb48dce0725e63d19147944f41843c73">binExpo</a></div><div class="ttdeci">int binExpo(int a, int b)</div><div class="ttdef"><b>Definition</b> binary_exponent.cpp:28</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dcf/binary__exponent_8cpp_aeb48dce0725e63d19147944f41843c73_cgraph.svg" width="79" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="abinary__exponent_8cpp_html_aeb48dce0725e63d19147944f41843c73"><div class="ttname"><a href="#aeb48dce0725e63d19147944f41843c73">binExpo</a></div><div class="ttdeci">int binExpo(int a, int b)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dcf/binary__exponent_8cpp_source.html#l00028">binary_exponent.cpp:28</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a31dbf5f7ceb9c9eec831ef9f7782291f" name="a31dbf5f7ceb9c9eec831ef9f7782291f"></a>
@@ -201,6 +219,8 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Iterative function to calculate exponent in \(O(\log(n))\) using binary exponent. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dcf/binary__exponent_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../de/dcf/binary__exponent_8cpp_source.html">binary_exponent.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   42</span>                              {</div>
 <div class="line"><span class="lineno">   43</span>    <span class="keywordtype">int</span> res = 1;</div>
 <div class="line"><span class="lineno">   44</span>    <span class="keywordflow">while</span> (b &gt; 0) {</div>
@@ -234,33 +254,23 @@ Here is the call graph for this function:</div>
 <p>Give two numbers a, b</p>
 <p>int resIterate = binExpo_alt(a, b);</p>
 <p>Result of a^b (where '^' denotes exponentiation)</p>
-<p><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; resIterate &lt;&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</p>
-<div class="fragment"><div class="line"><span class="lineno">   55</span>           {</div>
-<div class="line"><span class="lineno">   56</span>    <span class="keywordtype">int</span> a, b;<span class="comment"></span></div>
-<div class="line"><span class="lineno">   57</span><span class="comment">    /// Give two numbers a, b</span></div>
-<div class="line"><span class="lineno">   58</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; a &gt;&gt; b;</div>
-<div class="line"><span class="lineno">   59</span>    <span class="keywordflow">if</span> (a == 0 &amp;&amp; b == 0) {</div>
-<div class="line"><span class="lineno">   60</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Math error&quot;</span> &lt;&lt; <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">   61</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (b &lt; 0) {</div>
-<div class="line"><span class="lineno">   62</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Exponent must be positive !!&quot;</span> &lt;&lt; <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">   63</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   64</span>        <span class="keywordtype">int</span> resRecurse = <a class="code hl_function" href="#aeb48dce0725e63d19147944f41843c73">binExpo</a>(a, b);<span class="comment"></span></div>
-<div class="line"><span class="lineno">   65</span><span class="comment">        /// int resIterate = binExpo_alt(a, b);</span></div>
-<div class="line"><span class="lineno">   66</span><span class="comment"></span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   67</span><span class="comment">        /// Result of a^b (where &#39;^&#39; denotes exponentiation)</span></div>
-<div class="line"><span class="lineno">   68</span><span class="comment"></span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; resRecurse &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;<span class="comment"></span></div>
-<div class="line"><span class="lineno">   69</span><span class="comment">        /// std::cout &lt;&lt; resIterate &lt;&lt; std::endl;</span></div>
-<div class="line"><span class="lineno">   70</span><span class="comment"></span>    }</div>
-<div class="line"><span class="lineno">   71</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dcf/binary__exponent_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="180" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
+<p>std::cout &lt;&lt; resIterate &lt;&lt; std::endl;</p>
 
+<p class="definition">Definition at line <a class="el" href="../../de/dcf/binary__exponent_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../de/dcf/binary__exponent_8cpp_source.html">binary_exponent.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   55</span>           {</div>
+<div class="line"><span class="lineno">   56</span>    <span class="keywordtype">int</span> a, b;</div>
+<div class="line"><span class="lineno">   58</span>    std::cin &gt;&gt; a &gt;&gt; b;</div>
+<div class="line"><span class="lineno">   59</span>    <span class="keywordflow">if</span> (a == 0 &amp;&amp; b == 0) {</div>
+<div class="line"><span class="lineno">   60</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Math error&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   61</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (b &lt; 0) {</div>
+<div class="line"><span class="lineno">   62</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Exponent must be positive !!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   63</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><span class="lineno">   64</span>        <span class="keywordtype">int</span> resRecurse = <a class="code hl_function" href="#aeb48dce0725e63d19147944f41843c73">binExpo</a>(a, b);</div>
+<div class="line"><span class="lineno">   66</span> </div>
+<div class="line"><span class="lineno">   68</span>        std::cout &lt;&lt; resRecurse &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   70</span>    }</div>
+<div class="line"><span class="lineno">   71</span>}</div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/de/dcf/binary__exponent_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/dcf/binary__exponent_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 6bcf3fd56..000000000
--- a/de/dcf/binary__exponent_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,55,55,80"/>
-<area shape="rect" id="Node000002" href="$de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73" title=" " alt="" coords="104,29,172,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,59,88,51,89,56,56,64"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,79,174,104"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="56,70,88,78,87,83,55,76"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="119,30,115,21,118,11,125,5,138,3,152,5,159,12,156,16,150,10,138,8,128,10,122,14,121,20,124,28"/>
-</map>
diff --git a/de/dcf/binary__exponent_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/dcf/binary__exponent_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 85c6bf31b..000000000
--- a/de/dcf/binary__exponent_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b35095ec3eb1d71b6f0a99c49cdd27be
\ No newline at end of file
diff --git a/de/dcf/binary__exponent_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/dcf/binary__exponent_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 373ea8d9c..000000000
--- a/de/dcf/binary__exponent_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="82pt"
- viewBox="0.00 0.00 134.50 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125.38,-56.25 74.12,-56.25 74.12,-37 125.38,-37 125.38,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">binExpo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.91,-33.72 53.81,-35.85 62.49,-37.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.62,-41.32 72.16,-40.25 63.25,-34.51 61.62,-41.32"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C44.64,-21.91 53.16,-19.98 61.53,-18.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.27,-21.5 71.25,-15.87 60.72,-14.67 62.27,-21.5"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.03,-56.54C81.23,-65.15 85.47,-74.25 99.75,-74.25 107.56,-74.25 112.37,-71.53 114.17,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="117.67,-67.39 112.7,-58.03 110.75,-68.45 117.67,-67.39"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dcf/binary__exponent_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/dcf/binary__exponent_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 8b9aadcaa..000000000
--- a/de/dcf/binary__exponent_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="82pt"
- viewBox="0.00 0.00 134.50 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125.38,-56.25 74.12,-56.25 74.12,-37 125.38,-37 125.38,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">binExpo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.91,-33.72 53.81,-35.85 62.49,-37.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.62,-41.32 72.16,-40.25 63.25,-34.51 61.62,-41.32"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C44.64,-21.91 53.16,-19.98 61.53,-18.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.27,-21.5 71.25,-15.87 60.72,-14.67 62.27,-21.5"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M87.03,-56.54C81.23,-65.15 85.47,-74.25 99.75,-74.25 107.56,-74.25 112.37,-71.53 114.17,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="117.67,-67.39 112.7,-58.03 110.75,-68.45 117.67,-67.39"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dcf/binary__exponent_8cpp_aeb48dce0725e63d19147944f41843c73_cgraph.map b/de/dcf/binary__exponent_8cpp_aeb48dce0725e63d19147944f41843c73_cgraph.map
deleted file mode 100644
index 084405ae5..000000000
--- a/de/dcf/binary__exponent_8cpp_aeb48dce0725e63d19147944f41843c73_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="binExpo" name="binExpo">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,74,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="26,29,25,12,31,5,40,3,49,6,54,12,49,15,46,10,39,8,34,10,30,14,31,29"/>
-</map>
diff --git a/de/dcf/binary__exponent_8cpp_aeb48dce0725e63d19147944f41843c73_cgraph.md5 b/de/dcf/binary__exponent_8cpp_aeb48dce0725e63d19147944f41843c73_cgraph.md5
deleted file mode 100644
index 9435d9535..000000000
--- a/de/dcf/binary__exponent_8cpp_aeb48dce0725e63d19147944f41843c73_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f26d59230b7e12bd24abc4e72eea9518
\ No newline at end of file
diff --git a/de/dcf/binary__exponent_8cpp_aeb48dce0725e63d19147944f41843c73_cgraph.svg b/de/dcf/binary__exponent_8cpp_aeb48dce0725e63d19147944f41843c73_cgraph.svg
deleted file mode 100644
index 7b4559ca0..000000000
--- a/de/dcf/binary__exponent_8cpp_aeb48dce0725e63d19147944f41843c73_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binExpo Pages: 1 -->
-<svg width="59pt" height="45pt"
- viewBox="0.00 0.00 59.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>binExpo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="51.25,-19.25 0,-19.25 0,0 51.25,0 51.25,-19.25"/>
-<text text-anchor="middle" x="25.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">binExpo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M17.6,-19.54C13.94,-28.15 16.62,-37.25 25.62,-37.25 30.41,-37.25 33.41,-34.68 34.62,-30.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="38.11,-30.71 33.78,-21.05 31.13,-31.31 38.11,-30.71"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dcf/binary__exponent_8cpp_aeb48dce0725e63d19147944f41843c73_cgraph_org.svg b/de/dcf/binary__exponent_8cpp_aeb48dce0725e63d19147944f41843c73_cgraph_org.svg
deleted file mode 100644
index 2bc9d392d..000000000
--- a/de/dcf/binary__exponent_8cpp_aeb48dce0725e63d19147944f41843c73_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: binExpo Pages: 1 -->
-<svg width="59pt" height="45pt"
- viewBox="0.00 0.00 59.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>binExpo</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="51.25,-19.25 0,-19.25 0,0 51.25,0 51.25,-19.25"/>
-<text text-anchor="middle" x="25.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">binExpo</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M17.6,-19.54C13.94,-28.15 16.62,-37.25 25.62,-37.25 30.41,-37.25 33.41,-34.68 34.62,-30.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="38.11,-30.71 33.78,-21.05 31.13,-31.31 38.11,-30.71"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dcf/binary__exponent_8cpp_source.html b/de/dcf/binary__exponent_8cpp_source.html
new file mode 100644
index 000000000..5b920b297
--- /dev/null
+++ b/de/dcf/binary__exponent_8cpp_source.html
@@ -0,0 +1,186 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/binary_exponent.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/dcf/binary__exponent_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">binary_exponent.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/dcf/binary__exponent_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="foldopen" id="foldopen00028" data-start="{" data-end="}">
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"><a class="line" href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73">   28</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73">binExpo</a>(<span class="keywordtype">int</span> a, <span class="keywordtype">int</span> b) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordflow">if</span> (b == 0) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        <span class="keywordflow">return</span> 1;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    }</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordtype">int</span> res = <a class="code hl_function" href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73">binExpo</a>(a, b / 2);</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordflow">if</span> (b % 2) {</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        <span class="keywordflow">return</span> res * res * a;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        <span class="keywordflow">return</span> res * res;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    }</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>}</div>
+</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="foldopen" id="foldopen00042" data-start="{" data-end="}">
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f">   42</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f">binExpo_alt</a>(<span class="keywordtype">int</span> a, <span class="keywordtype">int</span> b) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordtype">int</span> res = 1;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">while</span> (b &gt; 0) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="keywordflow">if</span> (b % 2) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            res = res * a;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        a = a * a;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        b /= 2;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <span class="keywordflow">return</span> res;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>}</div>
+</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="foldopen" id="foldopen00055" data-start="{" data-end="}">
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   55</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordtype">int</span> a, b;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    std::cin &gt;&gt; a &gt;&gt; b;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">if</span> (a == 0 &amp;&amp; b == 0) {</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Math error&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (b &lt; 0) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Exponent must be positive !!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        <span class="keywordtype">int</span> resRecurse = <a class="code hl_function" href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73">binExpo</a>(a, b);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        std::cout &lt;&lt; resRecurse &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    }</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>}</div>
+</div>
+<div class="ttc" id="abinary__exponent_8cpp_html_a31dbf5f7ceb9c9eec831ef9f7782291f"><div class="ttname"><a href="../../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f">binExpo_alt</a></div><div class="ttdeci">int binExpo_alt(int a, int b)</div><div class="ttdef"><b>Definition</b> <a href="#l00042">binary_exponent.cpp:42</a></div></div>
+<div class="ttc" id="abinary__exponent_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00055">binary_exponent.cpp:55</a></div></div>
+<div class="ttc" id="abinary__exponent_8cpp_html_aeb48dce0725e63d19147944f41843c73"><div class="ttname"><a href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73">binExpo</a></div><div class="ttdeci">int binExpo(int a, int b)</div><div class="ttdef"><b>Definition</b> <a href="#l00028">binary_exponent.cpp:28</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../de/dcf/binary__exponent_8cpp.html">binary_exponent.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html
index 12584aadc..349418d24 100644
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html
+++ b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: operations_on_datastructures::reverse_binary_tree::BinaryTree Class Reference</title>
+<title>TheAlgorithms/C++: operations_on_datastructures::reverse_binary_tree::BinaryTree Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -134,7 +151,7 @@ Public Member Functions</h2></td></tr>
 <tr class="separator:a534645d1aabdf1a7e5897c85376f173d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a1c0d27198372b36ef71bc58af8336b9c" id="r_a1c0d27198372b36ef71bc58af8336b9c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1c0d27198372b36ef71bc58af8336b9c">reverse</a> ()</td></tr>
 <tr class="separator:a1c0d27198372b36ef71bc58af8336b9c"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2e683b271d8d5cd63e0d09cf8aaa325c" id="r_a2e683b271d8d5cd63e0d09cf8aaa325c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a> ()</td></tr>
+<tr class="memitem:a2e683b271d8d5cd63e0d09cf8aaa325c" id="r_a2e683b271d8d5cd63e0d09cf8aaa325c"><td class="memItemLeft" align="right" valign="top">std::vector&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a> ()</td></tr>
 <tr class="memdesc:a2e683b271d8d5cd63e0d09cf8aaa325c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Level order traversal of a tree consists of visiting its elements, top to bottom, left to right. This function performs level order traversal and returns the node datas as a vector.  <br /></td></tr>
 <tr class="separator:a2e683b271d8d5cd63e0d09cf8aaa325c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a5cf972a2c994a4fa1a89fc77bd5ad503" id="r_a5cf972a2c994a4fa1a89fc77bd5ad503"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5cf972a2c994a4fa1a89fc77bd5ad503">print</a> ()</td></tr>
@@ -158,13 +175,14 @@ Private Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:ab6a17a04aa93aaaef71e038e8cc2edeb" id="r_ab6a17a04aa93aaaef71e038e8cc2edeb"><td class="memItemLeft" align="right" valign="top"><a id="ab6a17a04aa93aaaef71e038e8cc2edeb" name="ab6a17a04aa93aaaef71e038e8cc2edeb"></a>
-<a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>root</b></td></tr>
-<tr class="memdesc:ab6a17a04aa93aaaef71e038e8cc2edeb"><td class="mdescLeft">&#160;</td><td class="mdescRight">Pointer to root node of Binary Tree. <br /></td></tr>
+<tr class="memitem:ab6a17a04aa93aaaef71e038e8cc2edeb" id="r_ab6a17a04aa93aaaef71e038e8cc2edeb"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a></td></tr>
+<tr class="memdesc:ab6a17a04aa93aaaef71e038e8cc2edeb"><td class="mdescLeft">&#160;</td><td class="mdescRight">Pointer to root node of Binary Tree.  <br /></td></tr>
 <tr class="separator:ab6a17a04aa93aaaef71e038e8cc2edeb"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A Binary Tree class that implements a Binary Search Tree (BST) by default. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00052">52</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="abcb1cc8da7b6759dc92cbe0254697c56" name="abcb1cc8da7b6759dc92cbe0254697c56"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#abcb1cc8da7b6759dc92cbe0254697c56">&#9670;&#160;</a></span>BinaryTree() <span class="overload">[1/2]</span></h2>
@@ -190,8 +208,10 @@ Private Attributes</h2></td></tr>
 </div><div class="memdoc">
 
 <p>Creates a <a class="el" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html" title="A Binary Tree class that implements a Binary Search Tree (BST) by default.">BinaryTree</a> with a root pointing to NULL. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00101">101</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  101</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <span class="keyword">nullptr</span>; }</div>
-<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_ab6a17a04aa93aaaef71e038e8cc2edeb"><div class="ttname"><a href="#ab6a17a04aa93aaaef71e038e8cc2edeb">operations_on_datastructures::reverse_binary_tree::BinaryTree::root</a></div><div class="ttdeci">Node * root</div><div class="ttdoc">Pointer to root node of Binary Tree.</div><div class="ttdef"><b>Definition</b> reverse_binary_tree.cpp:54</div></div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_ab6a17a04aa93aaaef71e038e8cc2edeb"><div class="ttname"><a href="#ab6a17a04aa93aaaef71e038e8cc2edeb">operations_on_datastructures::reverse_binary_tree::BinaryTree::root</a></div><div class="ttdeci">Node * root</div><div class="ttdoc">Pointer to root node of Binary Tree.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00054">reverse_binary_tree.cpp:54</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -219,9 +239,11 @@ Private Attributes</h2></td></tr>
 </div><div class="memdoc">
 
 <p>Creates a <a class="el" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html" title="A Binary Tree class that implements a Binary Search Tree (BST) by default.">BinaryTree</a> with a root with an initial value. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00105">105</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  105</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>); }</div>
-<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
-<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
+<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -247,24 +269,21 @@ Private Attributes</h2></td></tr>
   </tr>
 </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
 <div class="fragment"><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/container/vector.html">std::vector&lt;Node*&gt;</a> nodes;</div>
-<div class="line"><span class="lineno">  109</span>        nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>);</div>
-<div class="line"><span class="lineno">  110</span>        <span class="keywordflow">while</span> (!nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/empty.html">empty</a>()) {</div>
-<div class="line"><span class="lineno">  111</span>            <span class="keyword">const</span> <span class="keyword">auto</span> cur_node = nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/back.html">back</a>();</div>
-<div class="line"><span class="lineno">  112</span>            nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/pop_back.html">pop_back</a>();</div>
+<div class="line"><span class="lineno">  108</span>        std::vector&lt;Node*&gt; nodes;</div>
+<div class="line"><span class="lineno">  109</span>        nodes.emplace_back(<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>);</div>
+<div class="line"><span class="lineno">  110</span>        <span class="keywordflow">while</span> (!nodes.empty()) {</div>
+<div class="line"><span class="lineno">  111</span>            <span class="keyword">const</span> <span class="keyword">auto</span> cur_node = nodes.back();</div>
+<div class="line"><span class="lineno">  112</span>            nodes.pop_back();</div>
 <div class="line"><span class="lineno">  113</span>            <span class="keywordflow">if</span> (cur_node) {</div>
-<div class="line"><span class="lineno">  114</span>                nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(cur_node-&gt;left);</div>
-<div class="line"><span class="lineno">  115</span>                nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(cur_node-&gt;right);</div>
+<div class="line"><span class="lineno">  114</span>                nodes.emplace_back(cur_node-&gt;left);</div>
+<div class="line"><span class="lineno">  115</span>                nodes.emplace_back(cur_node-&gt;right);</div>
 <div class="line"><span class="lineno">  116</span>                <span class="keyword">delete</span> cur_node;</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="ttc" id="aback_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/back.html">std::vector::back</a></div><div class="ttdeci">T back(T... args)</div></div>
-<div class="ttc" id="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div>
-<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/empty.html">std::vector::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
-<div class="ttc" id="apop_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/pop_back.html">std::vector::pop_back</a></div><div class="ttdeci">T pop_back(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -293,14 +312,11 @@ Private Attributes</h2></td></tr>
 </div><div class="memdoc">
 
 <p>Adds a new <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> to the Binary Tree. </p>
-<div class="fragment"><div class="line"><span class="lineno">  124</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <a class="code hl_function" href="#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); }</div>
-<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_adb2b6be741b0500ee75d89b6d06b5d50"><div class="ttname"><a href="#adb2b6be741b0500ee75d89b6d06b5d50">operations_on_datastructures::reverse_binary_tree::BinaryTree::insert</a></div><div class="ttdeci">Node * insert(int64_t data, Node *pivot)</div><div class="ttdoc">inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree.</div><div class="ttdef"><b>Definition</b> reverse_binary_tree.cpp:65</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a534645d1aabdf1a7e5897c85376f173d_cgraph.svg" width="516" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00124">124</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  124</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <a class="code hl_function" href="#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); }</div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_adb2b6be741b0500ee75d89b6d06b5d50"><div class="ttname"><a href="#adb2b6be741b0500ee75d89b6d06b5d50">operations_on_datastructures::reverse_binary_tree::BinaryTree::insert</a></div><div class="ttdeci">Node * insert(int64_t data, Node *pivot)</div><div class="ttdoc">inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00065">reverse_binary_tree.cpp:65</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2e683b271d8d5cd63e0d09cf8aaa325c" name="a2e683b271d8d5cd63e0d09cf8aaa325c"></a>
@@ -313,7 +329,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order </td>
+          <td class="memname">std::vector&lt; int64_t &gt; operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order </td>
           <td>(</td>
           <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
           <td></td>
@@ -338,36 +354,29 @@ Here is the call graph for this function:</div>
 <p>&lt; Insert left node</p>
 <p>&lt; Insert right node</p>
 <p>Add nodes while Tree is not empty</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00139">139</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  139</span>                                         {</div>
-<div class="line"><span class="lineno">  140</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;  <span class="comment">///&lt; Result vector of int</span></div>
+<div class="line"><span class="lineno">  140</span>        std::vector&lt;int64_t&gt; <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;  </div>
 <div class="line"><span class="lineno">  141</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> == <span class="keyword">nullptr</span>) {</div>
-<div class="line"><span class="lineno">  142</span>            <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;  <span class="comment">///&lt; Return empty vector if root is Invalid</span></div>
+<div class="line"><span class="lineno">  142</span>            <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;  </div>
 <div class="line"><span class="lineno">  143</span>        }</div>
-<div class="line"><span class="lineno">  144</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue&lt;Node*&gt;</a> nodes;  <span class="comment">///&lt; Queue of the nodes in the tree</span></div>
-<div class="line"><span class="lineno">  145</span>        nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>);         <span class="comment">///&lt; Insert root into the queue</span></div>
-<div class="line"><span class="lineno">  146</span>        <span class="keywordflow">while</span> (!nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/empty.html">empty</a>()) {</div>
-<div class="line"><span class="lineno">  147</span>            <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* temp = nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/front.html">front</a>();  <span class="comment">///&lt; Copy the first element</span></div>
-<div class="line"><span class="lineno">  148</span>            <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>.push_back(temp-&gt;data);  <span class="comment">///&lt; Add the element to the data</span></div>
-<div class="line"><span class="lineno">  149</span>            nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/pop.html">pop</a>();                 <span class="comment">///&lt; Remove element</span></div>
+<div class="line"><span class="lineno">  144</span>        std::queue&lt;Node*&gt; nodes;  </div>
+<div class="line"><span class="lineno">  145</span>        nodes.push(<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>);         </div>
+<div class="line"><span class="lineno">  146</span>        <span class="keywordflow">while</span> (!nodes.empty()) {</div>
+<div class="line"><span class="lineno">  147</span>            <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* temp = nodes.front();  </div>
+<div class="line"><span class="lineno">  148</span>            <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>.push_back(temp-&gt;data);  </div>
+<div class="line"><span class="lineno">  149</span>            nodes.pop();                 </div>
 <div class="line"><span class="lineno">  150</span>            <span class="keywordflow">if</span> (temp-&gt;left != <span class="keyword">nullptr</span>) {</div>
-<div class="line"><span class="lineno">  151</span>                nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(temp-&gt;left);  <span class="comment">///&lt; Insert left node</span></div>
+<div class="line"><span class="lineno">  151</span>                nodes.push(temp-&gt;left);  </div>
 <div class="line"><span class="lineno">  152</span>            }</div>
 <div class="line"><span class="lineno">  153</span>            <span class="keywordflow">if</span> (temp-&gt;right != <span class="keyword">nullptr</span>) {</div>
-<div class="line"><span class="lineno">  154</span>                nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(temp-&gt;right);  <span class="comment">///&lt; Insert right node</span></div>
+<div class="line"><span class="lineno">  154</span>                nodes.push(temp-&gt;right);  </div>
 <div class="line"><span class="lineno">  155</span>            }</div>
-<div class="line"><span class="lineno">  156</span>        }  <span class="comment">/// Add nodes while Tree is not empty</span></div>
+<div class="line"><span class="lineno">  156</span>        }  </div>
 <div class="line"><span class="lineno">  157</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
 <div class="line"><span class="lineno">  158</span>    }</div>
-<div class="ttc" id="afront_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/front.html">std::queue::front</a></div><div class="ttdeci">T front(T... args)</div></div>
-<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/pop.html">std::queue::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
-<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/push.html">std::queue::push</a></div><div class="ttdeci">T push(T... args)</div></div>
-<div class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a2e683b271d8d5cd63e0d09cf8aaa325c_cgraph.svg" width="400" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="adb2b6be741b0500ee75d89b6d06b5d50" name="adb2b6be741b0500ee75d89b6d06b5d50"></a>
@@ -409,25 +418,22 @@ Here is the call graph for this function:</div>
 <p>&lt; Create new node</p>
 <p>&lt; Insert <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> to the left</p>
 <p>&lt; Insert node to the right</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00065">65</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   65</span>                                            {</div>
 <div class="line"><span class="lineno">   66</span>        <span class="keywordflow">if</span> (pivot == <span class="keyword">nullptr</span>) {</div>
-<div class="line"><span class="lineno">   67</span>            <span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);  <span class="comment">///&lt; Create new node</span></div>
+<div class="line"><span class="lineno">   67</span>            <span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);  </div>
 <div class="line"><span class="lineno">   68</span>        }</div>
 <div class="line"><span class="lineno">   69</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data &lt;= pivot-&gt;</a><a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
 <div class="line"><span class="lineno">   70</span>            pivot-&gt;left =</div>
-<div class="line"><span class="lineno">   71</span>                <a class="code hl_function" href="#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, pivot-&gt;left);  <span class="comment">///&lt; Insert Node to the left</span></div>
+<div class="line"><span class="lineno">   71</span>                <a class="code hl_function" href="#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, pivot-&gt;left);  </div>
 <div class="line"><span class="lineno">   72</span>        } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">   73</span>            pivot-&gt;right =</div>
-<div class="line"><span class="lineno">   74</span>                <a class="code hl_function" href="#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, pivot-&gt;right);  <span class="comment">///&lt; Insert node to the right</span></div>
+<div class="line"><span class="lineno">   74</span>                <a class="code hl_function" href="#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, pivot-&gt;right);  </div>
 <div class="line"><span class="lineno">   75</span>        }</div>
 <div class="line"><span class="lineno">   76</span>        <span class="keywordflow">return</span> pivot;</div>
 <div class="line"><span class="lineno">   77</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_adb2b6be741b0500ee75d89b6d06b5d50_cgraph.svg" width="226" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a5cf972a2c994a4fa1a89fc77bd5ad503" name="a5cf972a2c994a4fa1a89fc77bd5ad503"></a>
@@ -457,20 +463,16 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
 <p>Print each element in the tree</p>
 <p>Print newline</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00164">164</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  164</span>                 {</div>
 <div class="line"><span class="lineno">  165</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : <a class="code hl_function" href="#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>()) {</div>
-<div class="line"><span class="lineno">  166</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;  <span class="comment">/// Print each element in the tree</span></div>
+<div class="line"><span class="lineno">  166</span>            std::cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;  </div>
 <div class="line"><span class="lineno">  167</span>        }</div>
-<div class="line"><span class="lineno">  168</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;  <span class="comment">/// Print newline</span></div>
+<div class="line"><span class="lineno">  168</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;  </div>
 <div class="line"><span class="lineno">  169</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="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_a2e683b271d8d5cd63e0d09cf8aaa325c"><div class="ttname"><a href="#a2e683b271d8d5cd63e0d09cf8aaa325c">operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; get_level_order()</div><div class="ttdoc">Level order traversal of a tree consists of visiting its elements, top to bottom, left to right....</div><div class="ttdef"><b>Definition</b> reverse_binary_tree.cpp:139</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph.svg" width="100%" height="438"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_a2e683b271d8d5cd63e0d09cf8aaa325c"><div class="ttname"><a href="#a2e683b271d8d5cd63e0d09cf8aaa325c">operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; get_level_order()</div><div class="ttdoc">Level order traversal of a tree consists of visiting its elements, top to bottom, left to right....</div><div class="ttdef"><b>Definition</b> <a href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00139">reverse_binary_tree.cpp:139</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a1c0d27198372b36ef71bc58af8336b9c" name="a1c0d27198372b36ef71bc58af8336b9c"></a>
@@ -496,14 +498,11 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Reverses the Binary Tree </p>
-<div class="fragment"><div class="line"><span class="lineno">  128</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <a class="code hl_function" href="#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); }</div>
-<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_af6f974381f523fdb981fc2d843bbf4a1"><div class="ttname"><a href="#af6f974381f523fdb981fc2d843bbf4a1">operations_on_datastructures::reverse_binary_tree::BinaryTree::reverseBinaryTree</a></div><div class="ttdeci">Node * reverseBinaryTree(Node *pivot)</div><div class="ttdoc">Reverses a Binary Tree recursively by swapping the left and right subtrees and their children.</div><div class="ttdef"><b>Definition</b> reverse_binary_tree.cpp:84</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a1c0d27198372b36ef71bc58af8336b9c_cgraph.svg" width="488" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00128">128</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  128</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <a class="code hl_function" href="#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); }</div>
+<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_af6f974381f523fdb981fc2d843bbf4a1"><div class="ttname"><a href="#af6f974381f523fdb981fc2d843bbf4a1">operations_on_datastructures::reverse_binary_tree::BinaryTree::reverseBinaryTree</a></div><div class="ttdeci">Node * reverseBinaryTree(Node *pivot)</div><div class="ttdoc">Reverses a Binary Tree recursively by swapping the left and right subtrees and their children.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00084">reverse_binary_tree.cpp:84</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af6f974381f523fdb981fc2d843bbf4a1" name="af6f974381f523fdb981fc2d843bbf4a1"></a>
@@ -541,25 +540,49 @@ Here is the call graph for this function:</div>
 <p>&lt; pointer to the left subtree</p>
 <p>&lt; Swap</p>
 <p>&lt; Swap</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00084">84</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   84</span>                                         {</div>
 <div class="line"><span class="lineno">   85</span>        <span class="keywordflow">if</span> (pivot == <span class="keyword">nullptr</span>) {</div>
-<div class="line"><span class="lineno">   86</span>            <span class="keywordflow">return</span> pivot;  <span class="comment">///&lt; Base case</span></div>
+<div class="line"><span class="lineno">   86</span>            <span class="keywordflow">return</span> pivot;  </div>
 <div class="line"><span class="lineno">   87</span>        }</div>
-<div class="line"><span class="lineno">   88</span>        <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* temp = pivot-&gt;left;  <span class="comment">///&lt; pointer to the left subtree</span></div>
-<div class="line"><span class="lineno">   89</span>        pivot-&gt;left = <a class="code hl_function" href="#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(pivot-&gt;right);  <span class="comment">///&lt; Swap</span></div>
-<div class="line"><span class="lineno">   90</span>        pivot-&gt;right = <a class="code hl_function" href="#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(temp);         <span class="comment">///&lt; Swap</span></div>
+<div class="line"><span class="lineno">   88</span>        <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* temp = pivot-&gt;left;  </div>
+<div class="line"><span class="lineno">   89</span>        pivot-&gt;left = <a class="code hl_function" href="#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(pivot-&gt;right);  </div>
+<div class="line"><span class="lineno">   90</span>        pivot-&gt;right = <a class="code hl_function" href="#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(temp);         </div>
 <div class="line"><span class="lineno">   91</span>        <span class="keywordflow">return</span> pivot;</div>
 <div class="line"><span class="lineno">   92</span>    }</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_af6f974381f523fdb981fc2d843bbf4a1_cgraph.svg" width="226" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="ab6a17a04aa93aaaef71e038e8cc2edeb" name="ab6a17a04aa93aaaef71e038e8cc2edeb"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ab6a17a04aa93aaaef71e038e8cc2edeb">&#9670;&#160;</a></span>root</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname"><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::BinaryTree::root</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Pointer to root node of Binary Tree. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00054">54</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>operations_on_datastructures/<a class="el" href="../../d4/db6/reverse__binary__tree_8cpp.html">reverse_binary_tree.cpp</a></li>
+<li>operations_on_datastructures/<a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a1c0d27198372b36ef71bc58af8336b9c_cgraph.map b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a1c0d27198372b36ef71bc58af8336b9c_cgraph.map
deleted file mode 100644
index cdf4ab519..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a1c0d27198372b36ef71bc58af8336b9c_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse" name="operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,220,85"/>
-<area shape="rect" id="Node000002" href="$de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1" title="Reverses a Binary Tree recursively by swapping the left and right subtrees and their children." alt="" coords="268,29,482,85"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="220,54,252,54,252,60,220,60"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="324,29,324,19,334,10,351,5,375,3,402,5,419,12,417,17,401,10,375,8,352,10,336,15,329,21,329,29"/>
-</map>
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a1c0d27198372b36ef71bc58af8336b9c_cgraph.md5 b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a1c0d27198372b36ef71bc58af8336b9c_cgraph.md5
deleted file mode 100644
index 19103ff81..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a1c0d27198372b36ef71bc58af8336b9c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9495f5f557a90a421834611c8b85b6b1
\ No newline at end of file
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a1c0d27198372b36ef71bc58af8336b9c_cgraph.svg b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a1c0d27198372b36ef71bc58af8336b9c_cgraph.svg
deleted file mode 100644
index 616576617..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a1c0d27198372b36ef71bc58af8336b9c_cgraph.svg
+++ /dev/null
@@ -1,78 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse Pages: 1 -->
-<svg width="366pt" height="68pt"
- viewBox="0.00 0.00 365.50 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="160.75,-41.75 0,-41.75 0,0 160.75,0 160.75,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
-<text text-anchor="middle" x="80.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1" target="_top" xlink:title="Reverses a Binary Tree recursively by swapping the left and right subtrees and their children.">
-<polygon fill="white" stroke="#666666" points="357.5,-41.75 196.75,-41.75 196.75,0 357.5,0 357.5,-41.75"/>
-<text text-anchor="start" x="204.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="204.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
-<text text-anchor="middle" x="277.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverseBinaryTree</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.15,-20.88C169.07,-20.88 177.16,-20.88 185.19,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.96,-24.38 194.96,-20.88 184.96,-17.38 184.96,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M240.81,-42.07C237.35,-51.55 249.46,-59.75 277.12,-59.75 293.12,-59.75 303.91,-57.01 309.51,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="312.79,-54.08 312.92,-43.49 306.21,-51.69 312.79,-54.08"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a1c0d27198372b36ef71bc58af8336b9c_cgraph_org.svg b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a1c0d27198372b36ef71bc58af8336b9c_cgraph_org.svg
deleted file mode 100644
index 0ef2027b0..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a1c0d27198372b36ef71bc58af8336b9c_cgraph_org.svg
+++ /dev/null
@@ -1,52 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse Pages: 1 -->
-<svg width="366pt" height="68pt"
- viewBox="0.00 0.00 365.50 67.75" 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 63.75)">
-<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="160.75,-41.75 0,-41.75 0,0 160.75,0 160.75,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
-<text text-anchor="middle" x="80.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1" target="_top" xlink:title="Reverses a Binary Tree recursively by swapping the left and right subtrees and their children.">
-<polygon fill="white" stroke="#666666" points="357.5,-41.75 196.75,-41.75 196.75,0 357.5,0 357.5,-41.75"/>
-<text text-anchor="start" x="204.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="204.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
-<text text-anchor="middle" x="277.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverseBinaryTree</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M161.15,-20.88C169.07,-20.88 177.16,-20.88 185.19,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.96,-24.38 194.96,-20.88 184.96,-17.38 184.96,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M240.81,-42.07C237.35,-51.55 249.46,-59.75 277.12,-59.75 293.12,-59.75 303.91,-57.01 309.51,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="312.79,-54.08 312.92,-43.49 306.21,-51.69 312.79,-54.08"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a2e683b271d8d5cd63e0d09cf8aaa325c_cgraph.map b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a2e683b271d8d5cd63e0d09cf8aaa325c_cgraph.map
deleted file mode 100644
index 9f105917c..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a2e683b271d8d5cd63e0d09cf8aaa325c_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order" name="operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order">
-<area shape="rect" id="Node000001" title="Level order traversal of a tree consists of visiting its elements, top to bottom, left to right...." alt="" coords="5,65,220,121"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/empty.html#" title=" " alt="" coords="268,5,394,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="195,62,276,34,277,39,197,67"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/front.html#" title=" " alt="" coords="273,55,389,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="219,78,257,73,258,79,220,83"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/pop.html#" title=" " alt="" coords="275,104,386,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="220,102,260,106,259,112,219,107"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/push.html#" title=" " alt="" coords="272,153,390,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="198,119,277,145,275,150,196,124"/>
-</map>
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a2e683b271d8d5cd63e0d09cf8aaa325c_cgraph.md5 b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a2e683b271d8d5cd63e0d09cf8aaa325c_cgraph.md5
deleted file mode 100644
index 43db57e99..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a2e683b271d8d5cd63e0d09cf8aaa325c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0923bb670b528d692e55d871fdd65a65
\ No newline at end of file
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a2e683b271d8d5cd63e0d09cf8aaa325c_cgraph.svg b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a2e683b271d8d5cd63e0d09cf8aaa325c_cgraph.svg
deleted file mode 100644
index a5deff060..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a2e683b271d8d5cd63e0d09cf8aaa325c_cgraph.svg
+++ /dev/null
@@ -1,121 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order Pages: 1 -->
-<svg width="300pt" height="138pt"
- viewBox="0.00 0.00 299.50 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Level order traversal of a tree consists of visiting its elements, top to bottom, left to right....">
-<polygon fill="#999999" stroke="#666666" points="160.75,-85.5 0,-85.5 0,-43.75 160.75,-43.75 160.75,-85.5"/>
-<text text-anchor="start" x="8" y="-72" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
-<text text-anchor="middle" x="80.38" y="-49.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_level_order</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.5,-130.25 196.75,-130.25 196.75,-111 291.5,-111 291.5,-130.25"/>
-<text text-anchor="middle" x="244.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.99,-85.96C163.24,-92.97 185.21,-100.58 203.4,-106.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.16,-110.15 212.76,-110.11 204.45,-103.53 202.16,-110.15"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="287.75,-93.25 200.5,-93.25 200.5,-74 287.75,-74 287.75,-93.25"/>
-<text text-anchor="middle" x="244.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.83,-73.96C170.38,-75.08 179.95,-76.2 189.02,-77.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.36,-80.72 198.7,-78.41 189.18,-73.76 188.36,-80.72"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.88,-56.25 202.38,-56.25 202.38,-37 285.88,-37 285.88,-56.25"/>
-<text text-anchor="middle" x="244.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.83,-55.78C170.94,-54.66 181.08,-53.53 190.62,-52.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.85,-55.96 200.4,-51.38 190.08,-49.01 190.85,-55.96"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="288.5,-19.25 199.75,-19.25 199.75,0 288.5,0 288.5,-19.25"/>
-<text text-anchor="middle" x="244.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M143.91,-43.36C163.7,-36.63 185.02,-29.38 202.82,-23.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="203.9,-26.66 212.24,-20.13 201.64,-20.03 203.9,-26.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a2e683b271d8d5cd63e0d09cf8aaa325c_cgraph_org.svg b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a2e683b271d8d5cd63e0d09cf8aaa325c_cgraph_org.svg
deleted file mode 100644
index 9a030dfda..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a2e683b271d8d5cd63e0d09cf8aaa325c_cgraph_org.svg
+++ /dev/null
@@ -1,95 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order Pages: 1 -->
-<svg width="300pt" height="138pt"
- viewBox="0.00 0.00 299.50 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Level order traversal of a tree consists of visiting its elements, top to bottom, left to right....">
-<polygon fill="#999999" stroke="#666666" points="160.75,-85.5 0,-85.5 0,-43.75 160.75,-43.75 160.75,-85.5"/>
-<text text-anchor="start" x="8" y="-72" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
-<text text-anchor="middle" x="80.38" y="-49.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_level_order</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="291.5,-130.25 196.75,-130.25 196.75,-111 291.5,-111 291.5,-130.25"/>
-<text text-anchor="middle" x="244.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.99,-85.96C163.24,-92.97 185.21,-100.58 203.4,-106.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.16,-110.15 212.76,-110.11 204.45,-103.53 202.16,-110.15"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="287.75,-93.25 200.5,-93.25 200.5,-74 287.75,-74 287.75,-93.25"/>
-<text text-anchor="middle" x="244.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.83,-73.96C170.38,-75.08 179.95,-76.2 189.02,-77.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.36,-80.72 198.7,-78.41 189.18,-73.76 188.36,-80.72"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="285.88,-56.25 202.38,-56.25 202.38,-37 285.88,-37 285.88,-56.25"/>
-<text text-anchor="middle" x="244.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M160.83,-55.78C170.94,-54.66 181.08,-53.53 190.62,-52.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.85,-55.96 200.4,-51.38 190.08,-49.01 190.85,-55.96"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="288.5,-19.25 199.75,-19.25 199.75,0 288.5,0 288.5,-19.25"/>
-<text text-anchor="middle" x="244.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M143.91,-43.36C163.7,-36.63 185.02,-29.38 202.82,-23.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="203.9,-26.66 212.24,-20.13 201.64,-20.03 203.9,-26.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a534645d1aabdf1a7e5897c85376f173d_cgraph.map b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a534645d1aabdf1a7e5897c85376f173d_cgraph.map
deleted file mode 100644
index 26150280d..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a534645d1aabdf1a7e5897c85376f173d_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="operations_on_datastructures::reverse_binary_tree::BinaryTree::add" name="operations_on_datastructures::reverse_binary_tree::BinaryTree::add">
-<area shape="rect" id="Node000001" title="Adds a new Node to the Binary Tree." alt="" coords="5,37,249,78"/>
-<area shape="rect" id="Node000002" href="$de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50" title="inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree." alt="" coords="297,29,511,85"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="249,54,281,54,281,60,249,60"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="350,29,351,19,361,10,378,5,404,3,433,5,451,12,449,17,432,11,404,8,379,10,363,15,356,21,355,29"/>
-</map>
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a534645d1aabdf1a7e5897c85376f173d_cgraph.md5 b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a534645d1aabdf1a7e5897c85376f173d_cgraph.md5
deleted file mode 100644
index 2c160db46..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a534645d1aabdf1a7e5897c85376f173d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-8719d3db9afc82bc54b1250c50b4d287
\ No newline at end of file
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a534645d1aabdf1a7e5897c85376f173d_cgraph.svg b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a534645d1aabdf1a7e5897c85376f173d_cgraph.svg
deleted file mode 100644
index 07420b0d5..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a534645d1aabdf1a7e5897c85376f173d_cgraph.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::add Pages: 1 -->
-<svg width="387pt" height="68pt"
- viewBox="0.00 0.00 387.25 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::add</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Adds a new Node to the Binary Tree.">
-<polygon fill="#999999" stroke="#666666" points="182.5,-36.12 0,-36.12 0,-5.62 182.5,-5.62 182.5,-36.12"/>
-<text text-anchor="start" x="8" y="-22.62" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="middle" x="91.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree::add</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50" target="_top" xlink:title="inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree.">
-<polygon fill="white" stroke="#666666" points="379.25,-41.75 218.5,-41.75 218.5,0 379.25,0 379.25,-41.75"/>
-<text text-anchor="start" x="226.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="226.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
-<text text-anchor="middle" x="298.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.74,-20.88C190.63,-20.88 198.62,-20.88 206.52,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.49,-24.38 216.49,-20.88 206.49,-17.38 206.49,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.55,-42.07C256.9,-51.55 269.68,-59.75 298.88,-59.75 316.21,-59.75 327.76,-56.86 333.51,-52.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.67,-54.09 336.69,-43.5 330.07,-51.77 336.67,-54.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a534645d1aabdf1a7e5897c85376f173d_cgraph_org.svg b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a534645d1aabdf1a7e5897c85376f173d_cgraph_org.svg
deleted file mode 100644
index 494ec9088..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a534645d1aabdf1a7e5897c85376f173d_cgraph_org.svg
+++ /dev/null
@@ -1,51 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::add Pages: 1 -->
-<svg width="387pt" height="68pt"
- viewBox="0.00 0.00 387.25 67.75" 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 63.75)">
-<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::add</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Adds a new Node to the Binary Tree.">
-<polygon fill="#999999" stroke="#666666" points="182.5,-36.12 0,-36.12 0,-5.62 182.5,-5.62 182.5,-36.12"/>
-<text text-anchor="start" x="8" y="-22.62" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="middle" x="91.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree::add</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50" target="_top" xlink:title="inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree.">
-<polygon fill="white" stroke="#666666" points="379.25,-41.75 218.5,-41.75 218.5,0 379.25,0 379.25,-41.75"/>
-<text text-anchor="start" x="226.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="226.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
-<text text-anchor="middle" x="298.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M182.74,-20.88C190.63,-20.88 198.62,-20.88 206.52,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="206.49,-24.38 216.49,-20.88 206.49,-17.38 206.49,-24.38"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M260.55,-42.07C256.9,-51.55 269.68,-59.75 298.88,-59.75 316.21,-59.75 327.76,-56.86 333.51,-52.53"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.67,-54.09 336.69,-43.5 330.07,-51.77 336.67,-54.09"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph.map b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph.map
deleted file mode 100644
index 59e77ede2..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="operations_on_datastructures::reverse_binary_tree::BinaryTree::print" name="operations_on_datastructures::reverse_binary_tree::BinaryTree::print">
-<area shape="rect" id="Node000001" title="Prints all of the elements in the tree to stdout level&#45;by&#45;level, using the get_level_order() function..." alt="" coords="5,72,253,113"/>
-<area shape="rect" id="Node000002" href="$de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c" title="Level order traversal of a tree consists of visiting its elements, top to bottom, left to right...." alt="" coords="301,65,515,121"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="253,90,285,90,285,96,253,96"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/empty.html#" title=" " alt="" coords="563,5,689,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="490,62,571,34,573,39,492,67"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/front.html#" title=" " alt="" coords="568,55,684,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="515,78,552,73,553,79,515,83"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/pop.html#" title=" " alt="" coords="570,104,682,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="515,102,555,106,555,112,515,107"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/push.html#" title=" " alt="" coords="567,153,685,179"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="493,119,572,145,570,150,492,124"/>
-</map>
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph.md5 b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph.md5
deleted file mode 100644
index 193c5e043..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f6756fb15d3ee26570b025531ed58028
\ No newline at end of file
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph.svg b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph.svg
deleted file mode 100644
index 821ef8266..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph.svg
+++ /dev/null
@@ -1,197 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::print Pages: 1 -->
-<!--zoomable 138 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 521;
-var viewHeight = 138;
-var sectionId = 'dynsection-4';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::print</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Prints all of the elements in the tree to stdout level&#45;by&#45;level, using the get_level_order() function...">
-<polygon fill="#999999" stroke="#666666" points="185.5,-79.88 0,-79.88 0,-49.38 185.5,-49.38 185.5,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="middle" x="92.75" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree::print</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c" target="_top" xlink:title="Level order traversal of a tree consists of visiting its elements, top to bottom, left to right....">
-<polygon fill="white" stroke="#666666" points="382.25,-85.5 221.5,-85.5 221.5,-43.75 382.25,-43.75 382.25,-85.5"/>
-<text text-anchor="start" x="229.5" y="-72" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="229.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
-<text text-anchor="middle" x="301.88" y="-49.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_level_order</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.8,-64.62C193.72,-64.62 201.72,-64.62 209.63,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="209.6,-68.13 219.6,-64.63 209.6,-61.13 209.6,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="513,-130.25 418.25,-130.25 418.25,-111 513,-111 513,-130.25"/>
-<text text-anchor="middle" x="465.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M364.49,-85.96C384.74,-92.97 406.71,-100.58 424.9,-106.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.66,-110.15 434.26,-110.11 425.95,-103.53 423.66,-110.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="509.25,-93.25 422,-93.25 422,-74 509.25,-74 509.25,-93.25"/>
-<text text-anchor="middle" x="465.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M382.33,-73.96C391.88,-75.08 401.45,-76.2 410.52,-77.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="409.86,-80.72 420.2,-78.41 410.68,-73.76 409.86,-80.72"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="507.38,-56.25 423.88,-56.25 423.88,-37 507.38,-37 507.38,-56.25"/>
-<text text-anchor="middle" x="465.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M382.33,-55.78C392.44,-54.66 402.58,-53.53 412.12,-52.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="412.35,-55.96 421.9,-51.38 411.58,-49.01 412.35,-55.96"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="510,-19.25 421.25,-19.25 421.25,0 510,0 510,-19.25"/>
-<text text-anchor="middle" x="465.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M365.41,-43.36C385.2,-36.63 406.52,-29.38 424.32,-23.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="425.4,-26.66 433.74,-20.13 423.14,-20.03 425.4,-26.66"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph_org.svg b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph_org.svg
deleted file mode 100644
index 0c24dffc3..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph_org.svg
+++ /dev/null
@@ -1,114 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::print Pages: 1 -->
-<svg width="521pt" height="138pt"
- viewBox="0.00 0.00 521.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::print</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Prints all of the elements in the tree to stdout level&#45;by&#45;level, using the get_level_order() function...">
-<polygon fill="#999999" stroke="#666666" points="185.5,-79.88 0,-79.88 0,-49.38 185.5,-49.38 185.5,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="middle" x="92.75" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree::print</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c" target="_top" xlink:title="Level order traversal of a tree consists of visiting its elements, top to bottom, left to right....">
-<polygon fill="white" stroke="#666666" points="382.25,-85.5 221.5,-85.5 221.5,-43.75 382.25,-43.75 382.25,-85.5"/>
-<text text-anchor="start" x="229.5" y="-72" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="229.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
-<text text-anchor="middle" x="301.88" y="-49.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_level_order</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.8,-64.62C193.72,-64.62 201.72,-64.62 209.63,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="209.6,-68.13 219.6,-64.63 209.6,-61.13 209.6,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="513,-130.25 418.25,-130.25 418.25,-111 513,-111 513,-130.25"/>
-<text text-anchor="middle" x="465.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M364.49,-85.96C384.74,-92.97 406.71,-100.58 424.9,-106.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="423.66,-110.15 434.26,-110.11 425.95,-103.53 423.66,-110.15"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="509.25,-93.25 422,-93.25 422,-74 509.25,-74 509.25,-93.25"/>
-<text text-anchor="middle" x="465.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M382.33,-73.96C391.88,-75.08 401.45,-76.2 410.52,-77.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="409.86,-80.72 420.2,-78.41 410.68,-73.76 409.86,-80.72"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="507.38,-56.25 423.88,-56.25 423.88,-37 507.38,-37 507.38,-56.25"/>
-<text text-anchor="middle" x="465.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M382.33,-55.78C392.44,-54.66 402.58,-53.53 412.12,-52.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="412.35,-55.96 421.9,-51.38 411.58,-49.01 412.35,-55.96"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="510,-19.25 421.25,-19.25 421.25,0 510,0 510,-19.25"/>
-<text text-anchor="middle" x="465.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M365.41,-43.36C385.2,-36.63 406.52,-29.38 424.32,-23.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="425.4,-26.66 433.74,-20.13 423.14,-20.03 425.4,-26.66"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_adb2b6be741b0500ee75d89b6d06b5d50_cgraph.map b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_adb2b6be741b0500ee75d89b6d06b5d50_cgraph.map
deleted file mode 100644
index b352fda4a..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_adb2b6be741b0500ee75d89b6d06b5d50_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="operations_on_datastructures::reverse_binary_tree::BinaryTree::insert" name="operations_on_datastructures::reverse_binary_tree::BinaryTree::insert">
-<area shape="rect" id="Node000001" title="inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree." alt="" coords="5,29,220,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="70,29,71,19,78,10,92,5,113,3,135,5,149,12,147,17,134,10,112,8,94,10,82,15,76,21,76,29"/>
-</map>
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_adb2b6be741b0500ee75d89b6d06b5d50_cgraph.md5 b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_adb2b6be741b0500ee75d89b6d06b5d50_cgraph.md5
deleted file mode 100644
index 7c596423a..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_adb2b6be741b0500ee75d89b6d06b5d50_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3e60c7ea6430c0e03aabae539b90ff4d
\ No newline at end of file
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_adb2b6be741b0500ee75d89b6d06b5d50_cgraph.svg b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_adb2b6be741b0500ee75d89b6d06b5d50_cgraph.svg
deleted file mode 100644
index 0b74275af..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_adb2b6be741b0500ee75d89b6d06b5d50_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::insert Pages: 1 -->
-<svg width="169pt" height="68pt"
- viewBox="0.00 0.00 168.75 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree.">
-<polygon fill="#999999" stroke="#666666" points="160.75,-41.75 0,-41.75 0,0 160.75,0 160.75,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
-<text text-anchor="middle" x="80.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M50.71,-42.07C47.88,-51.55 57.77,-59.75 80.38,-59.75 93.44,-59.75 102.26,-57.01 106.83,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.12,-54.1 109.61,-43.52 103.41,-52.11 110.12,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_adb2b6be741b0500ee75d89b6d06b5d50_cgraph_org.svg b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_adb2b6be741b0500ee75d89b6d06b5d50_cgraph_org.svg
deleted file mode 100644
index 49aa94406..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_adb2b6be741b0500ee75d89b6d06b5d50_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::insert Pages: 1 -->
-<svg width="169pt" height="68pt"
- viewBox="0.00 0.00 168.75 67.75" 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 63.75)">
-<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree.">
-<polygon fill="#999999" stroke="#666666" points="160.75,-41.75 0,-41.75 0,0 160.75,0 160.75,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
-<text text-anchor="middle" x="80.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M50.71,-42.07C47.88,-51.55 57.77,-59.75 80.38,-59.75 93.44,-59.75 102.26,-57.01 106.83,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.12,-54.1 109.61,-43.52 103.41,-52.11 110.12,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_af6f974381f523fdb981fc2d843bbf4a1_cgraph.map b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_af6f974381f523fdb981fc2d843bbf4a1_cgraph.map
deleted file mode 100644
index fd792dd27..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_af6f974381f523fdb981fc2d843bbf4a1_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="operations_on_datastructures::reverse_binary_tree::BinaryTree::reverseBinaryTree" name="operations_on_datastructures::reverse_binary_tree::BinaryTree::reverseBinaryTree">
-<area shape="rect" id="Node000001" title="Reverses a Binary Tree recursively by swapping the left and right subtrees and their children." alt="" coords="5,29,220,85"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="70,29,71,19,78,10,92,5,113,3,135,5,149,12,147,17,134,10,112,8,94,10,82,15,76,21,76,29"/>
-</map>
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_af6f974381f523fdb981fc2d843bbf4a1_cgraph.md5 b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_af6f974381f523fdb981fc2d843bbf4a1_cgraph.md5
deleted file mode 100644
index 589cfc404..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_af6f974381f523fdb981fc2d843bbf4a1_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6295acb9259ac8d68cd5e1247cb87801
\ No newline at end of file
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_af6f974381f523fdb981fc2d843bbf4a1_cgraph.svg b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_af6f974381f523fdb981fc2d843bbf4a1_cgraph.svg
deleted file mode 100644
index 2270acc6c..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_af6f974381f523fdb981fc2d843bbf4a1_cgraph.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::reverseBinaryTree Pages: 1 -->
-<svg width="169pt" height="68pt"
- viewBox="0.00 0.00 168.75 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
-<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::reverseBinaryTree</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Reverses a Binary Tree recursively by swapping the left and right subtrees and their children.">
-<polygon fill="#999999" stroke="#666666" points="160.75,-41.75 0,-41.75 0,0 160.75,0 160.75,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
-<text text-anchor="middle" x="80.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverseBinaryTree</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M50.71,-42.07C47.88,-51.55 57.77,-59.75 80.38,-59.75 93.44,-59.75 102.26,-57.01 106.83,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.12,-54.1 109.61,-43.52 103.41,-52.11 110.12,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_af6f974381f523fdb981fc2d843bbf4a1_cgraph_org.svg b/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_af6f974381f523fdb981fc2d843bbf4a1_cgraph_org.svg
deleted file mode 100644
index 791a532e8..000000000
--- a/de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_af6f974381f523fdb981fc2d843bbf4a1_cgraph_org.svg
+++ /dev/null
@@ -1,32 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::reverseBinaryTree Pages: 1 -->
-<svg width="169pt" height="68pt"
- viewBox="0.00 0.00 168.75 67.75" 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 63.75)">
-<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::reverseBinaryTree</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Reverses a Binary Tree recursively by swapping the left and right subtrees and their children.">
-<polygon fill="#999999" stroke="#666666" points="160.75,-41.75 0,-41.75 0,0 160.75,0 160.75,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
-<text text-anchor="middle" x="80.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverseBinaryTree</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M50.71,-42.07C47.88,-51.55 57.77,-59.75 80.38,-59.75 93.44,-59.75 102.26,-57.01 106.83,-52.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.12,-54.1 109.61,-43.52 103.41,-52.11 110.12,-54.1"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dd1/segment__tree_8cpp.html b/de/dd1/segment__tree_8cpp.html
index 7ce463ff1..e81494b09 100644
--- a/de/dd1/segment__tree_8cpp.html
+++ b/de/dd1/segment__tree_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/segment_tree.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/segment_tree.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for segment_tree.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d2c/segment__tree_8cpp__incl.svg" width="350" height="126"><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">
+</div>
+<p><a href="../../de/dd1/segment__tree_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d95/classdata__structures_1_1_segment_tree.html">data_structures::SegmentTree&lt; T &gt;</a></td></tr>
@@ -150,6 +169,8 @@ Functions</h2></td></tr>
 <p>Implementation of the segment tree data structre</p>
 <p>Can do point updates (updates the value of some position) and range queries, where it gives the value of some associative opperation done on a range</p>
 <p>Both of these operations take O(log N) time </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/nishantc1527" target="_blank">Nishant Chatterjee</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html">segment_tree.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -168,17 +189,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html#l00130">130</a> of file <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html">segment_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  130</span>           {</div>
 <div class="line"><span class="lineno">  131</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  132</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  133</span>}</div>
-<div class="ttc" id="asegment__tree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> segment_tree.cpp:112</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dd1/segment__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="591" height="223"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asegment__tree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dd1/segment__tree_8cpp_source.html#l00112">segment_tree.cpp:112</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -206,6 +224,8 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html#l00112">112</a> of file <a class="el" href="../../de/dd1/segment__tree_8cpp_source.html">segment_tree.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  112</span>                   {</div>
 <div class="line"><span class="lineno">  113</span>    <a class="code hl_class" href="../../dd/d95/classdata__structures_1_1_segment_tree.html">data_structures::SegmentTree&lt;int&gt;</a> t(5);</div>
 <div class="line"><span class="lineno">  114</span>    t.update(1, 1);</div>
@@ -217,16 +237,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  120</span>    t.update(1, 3);</div>
 <div class="line"><span class="lineno">  121</span>    assert(t.range_comb(1, 3) == 8); <span class="comment">// 3 + 2 + 3 = 8</span></div>
 <div class="line"><span class="lineno">  122</span> </div>
-<div class="line"><span class="lineno">  123</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  123</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  124</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="aclassdata__structures_1_1_segment_tree_html"><div class="ttname"><a href="../../dd/d95/classdata__structures_1_1_segment_tree.html">data_structures::SegmentTree</a></div><div class="ttdoc">class representation of the segment tree</div><div class="ttdef"><b>Definition</b> segment_tree.cpp:30</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dd1/segment__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="494" height="223"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html"><div class="ttname"><a href="../../dd/d95/classdata__structures_1_1_segment_tree.html">data_structures::SegmentTree</a></div><div class="ttdoc">class representation of the segment tree</div><div class="ttdef"><b>Definition</b> <a href="../../de/dd1/segment__tree_8cpp_source.html#l00030">segment_tree.cpp:30</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/de/dd1/segment__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/de/dd1/segment__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 5d821c68d..000000000
--- a/de/dd1/segment__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,82,49,108"/>
-<area shape="rect" id="Node000002" href="$dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52" title="Helper method for range_comb method below." alt="" coords="97,119,268,159"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="50,98,95,111,93,117,48,103"/>
-<area shape="rect" id="Node000007" href="$dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1" title="Helper method for update method below." alt="" coords="97,29,268,70"/>
-<area shape="poly" id="edge7_Node000001_Node000007" title=" " alt="" coords="48,86,95,72,97,77,50,91"/>
-<area shape="poly" id="edge6_Node000002_Node000002" title=" " alt="" coords="152,118,151,109,156,100,166,94,182,92,200,94,210,101,207,105,198,99,182,97,168,99,159,104,156,110,157,118"/>
-<area shape="rect" id="Node000003" href="$dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841" title="Any associative function that combines x and y." alt="" coords="316,12,487,53"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="217,116,315,63,329,57,332,62,317,68,220,120"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="366,142,438,168"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="268,143,350,149,350,154,268,148"/>
-<area shape="rect" id="Node000005" href="$dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141" title="Gives the midpoint between two integers." alt="" coords="316,77,487,118"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="268,120,300,114,301,119,269,126"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="368,192,436,217"/>
-<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="250,157,317,178,353,188,352,194,315,183,249,162"/>
-<area shape="poly" id="edge8_Node000007_Node000003" title=" " alt="" coords="268,40,300,38,301,43,268,46"/>
-<area shape="poly" id="edge9_Node000007_Node000005" title=" " alt="" coords="269,66,301,73,300,78,267,71"/>
-<area shape="poly" id="edge10_Node000007_Node000007" title=" " alt="" coords="152,29,151,19,156,11,166,5,182,3,200,5,210,11,207,16,198,10,182,8,168,10,159,14,156,20,157,28"/>
-</map>
diff --git a/de/dd1/segment__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/de/dd1/segment__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 99f8db1b2..000000000
--- a/de/dd1/segment__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bd0ca8c0b2bf80dae13730f091202b5c
\ No newline at end of file
diff --git a/de/dd1/segment__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/de/dd1/segment__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 1ba7590db..000000000
--- a/de/dd1/segment__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,195 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="370pt" height="167pt"
- viewBox="0.00 0.00 369.50 166.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 162.88)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-101.25 0,-101.25 0,-82 32.5,-82 32.5,-101.25"/>
-<text text-anchor="middle" x="16.25" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52" target="_top" xlink:title="Helper method for range_comb method below.">
-<polygon fill="white" stroke="#666666" points="197,-73.88 68.5,-73.88 68.5,-43.38 197,-43.38 197,-73.88"/>
-<text text-anchor="start" x="76.5" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="132.75" y="-49.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::range_comb</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-87.17C41.75,-84.56 53.89,-81.07 66.55,-77.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.16,-80.88 75.8,-74.75 65.22,-74.16 67.16,-80.88"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1" target="_top" xlink:title="Helper method for update method below.">
-<polygon fill="white" stroke="#666666" points="197,-140.88 68.5,-140.88 68.5,-110.38 197,-110.38 197,-140.88"/>
-<text text-anchor="start" x="76.5" y="-127.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="132.75" y="-116.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-96.21C42.13,-99.01 54.91,-102.81 68.14,-106.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.77,-109.98 77.35,-109.47 68.76,-103.27 66.77,-109.98"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge6_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge6_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.11,-74.36C107.89,-83.43 114.77,-91.88 132.75,-91.88 142.58,-91.88 149.09,-89.35 152.29,-85.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.75,-86.16 153.25,-75.87 148.78,-85.48 155.75,-86.16"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841" target="_top" xlink:title="Any associative function that combines x and y.">
-<polygon fill="white" stroke="#666666" points="361.5,-153.88 233,-153.88 233,-123.38 361.5,-123.38 361.5,-153.88"/>
-<text text-anchor="start" x="241" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="297.25" y="-129.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::comb</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.8,-74.28C179.54,-85.84 207.53,-101.59 233,-113.62 236.52,-115.29 240.19,-116.94 243.9,-118.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="242.44,-121.74 253.02,-122.39 245.16,-115.28 242.44,-121.74"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.38,-56.25 270.12,-56.25 270.12,-37 324.38,-37 324.38,-56.25"/>
-<text text-anchor="middle" x="297.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.04,-53.95C217.8,-52.42 240.21,-50.76 258.47,-49.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.58,-52.92 268.3,-48.69 258.07,-45.94 258.58,-52.92"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141" target="_top" xlink:title="Gives the midpoint between two integers.">
-<polygon fill="white" stroke="#666666" points="361.5,-104.88 233,-104.88 233,-74.38 361.5,-74.38 361.5,-104.88"/>
-<text text-anchor="start" x="241" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="297.25" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::mid</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.04,-70.7C205.07,-72.23 213.34,-73.81 221.52,-75.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.63,-78.76 231.11,-77.2 221.94,-71.89 220.63,-78.76"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="322.88,-19.25 271.62,-19.25 271.62,0 322.88,0 322.88,-19.25"/>
-<text text-anchor="middle" x="297.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.15,-42.92C199.04,-37.95 216.74,-32.48 233,-27.62 241.85,-24.99 251.41,-22.22 260.37,-19.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.15,-23.08 269.82,-16.99 259.24,-16.35 261.15,-23.08"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge8_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge8_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.04,-130.69C204.98,-131.32 213.15,-131.98 221.24,-132.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.84,-136.1 231.09,-133.41 221.4,-129.13 220.84,-136.1"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge9_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge9_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.04,-111.6C205.07,-109.83 213.34,-107.99 221.52,-106.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.11,-109.63 231.12,-104.05 220.6,-102.8 222.11,-109.63"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge10_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge10_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.11,-141.36C107.89,-150.43 114.77,-158.88 132.75,-158.88 142.58,-158.88 149.09,-156.35 152.29,-152.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.75,-153.16 153.25,-142.87 148.78,-152.48 155.75,-153.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dd1/segment__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/de/dd1/segment__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1dab9a260..000000000
--- a/de/dd1/segment__tree_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,169 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="370pt" height="167pt"
- viewBox="0.00 0.00 369.50 166.88" 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 162.88)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-101.25 0,-101.25 0,-82 32.5,-82 32.5,-101.25"/>
-<text text-anchor="middle" x="16.25" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52" target="_top" xlink:title="Helper method for range_comb method below.">
-<polygon fill="white" stroke="#666666" points="197,-73.88 68.5,-73.88 68.5,-43.38 197,-43.38 197,-73.88"/>
-<text text-anchor="start" x="76.5" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="132.75" y="-49.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::range_comb</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-87.17C41.75,-84.56 53.89,-81.07 66.55,-77.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.16,-80.88 75.8,-74.75 65.22,-74.16 67.16,-80.88"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1" target="_top" xlink:title="Helper method for update method below.">
-<polygon fill="white" stroke="#666666" points="197,-140.88 68.5,-140.88 68.5,-110.38 197,-110.38 197,-140.88"/>
-<text text-anchor="start" x="76.5" y="-127.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="132.75" y="-116.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::update</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.69,-96.21C42.13,-99.01 54.91,-102.81 68.14,-106.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.77,-109.98 77.35,-109.47 68.76,-103.27 66.77,-109.98"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge6_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge6_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.11,-74.36C107.89,-83.43 114.77,-91.88 132.75,-91.88 142.58,-91.88 149.09,-89.35 152.29,-85.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.75,-86.16 153.25,-75.87 148.78,-85.48 155.75,-86.16"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841" target="_top" xlink:title="Any associative function that combines x and y.">
-<polygon fill="white" stroke="#666666" points="361.5,-153.88 233,-153.88 233,-123.38 361.5,-123.38 361.5,-153.88"/>
-<text text-anchor="start" x="241" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="297.25" y="-129.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::comb</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M159.8,-74.28C179.54,-85.84 207.53,-101.59 233,-113.62 236.52,-115.29 240.19,-116.94 243.9,-118.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="242.44,-121.74 253.02,-122.39 245.16,-115.28 242.44,-121.74"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.38,-56.25 270.12,-56.25 270.12,-37 324.38,-37 324.38,-56.25"/>
-<text text-anchor="middle" x="297.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.04,-53.95C217.8,-52.42 240.21,-50.76 258.47,-49.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="258.58,-52.92 268.3,-48.69 258.07,-45.94 258.58,-52.92"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141" target="_top" xlink:title="Gives the midpoint between two integers.">
-<polygon fill="white" stroke="#666666" points="361.5,-104.88 233,-104.88 233,-74.38 361.5,-74.38 361.5,-104.88"/>
-<text text-anchor="start" x="241" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="297.25" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::mid</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.04,-70.7C205.07,-72.23 213.34,-73.81 221.52,-75.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.63,-78.76 231.11,-77.2 221.94,-71.89 220.63,-78.76"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="322.88,-19.25 271.62,-19.25 271.62,0 322.88,0 322.88,-19.25"/>
-<text text-anchor="middle" x="297.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node6 -->
-<g id="edge5_Node000002_Node000006" class="edge">
-<title>Node2&#45;&gt;Node6</title>
-<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M183.15,-42.92C199.04,-37.95 216.74,-32.48 233,-27.62 241.85,-24.99 251.41,-22.22 260.37,-19.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.15,-23.08 269.82,-16.99 259.24,-16.35 261.15,-23.08"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge8_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge8_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.04,-130.69C204.98,-131.32 213.15,-131.98 221.24,-132.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="220.84,-136.1 231.09,-133.41 221.4,-129.13 220.84,-136.1"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge9_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge9_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M197.04,-111.6C205.07,-109.83 213.34,-107.99 221.52,-106.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="222.11,-109.63 231.12,-104.05 220.6,-102.8 222.11,-109.63"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge10_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge10_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.11,-141.36C107.89,-150.43 114.77,-158.88 132.75,-158.88 142.58,-158.88 149.09,-156.35 152.29,-152.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.75,-153.16 153.25,-142.87 148.78,-152.48 155.75,-153.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dd1/segment__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/dd1/segment__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index beee70531..000000000
--- a/de/dd1/segment__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,82,55,108"/>
-<area shape="rect" id="Node000002" href="$de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,82,146,108"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,92,87,92,87,98,55,98"/>
-<area shape="rect" id="Node000003" href="$dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52" title="Helper method for range_comb method below." alt="" coords="194,119,365,159"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="147,98,192,111,191,117,146,103"/>
-<area shape="rect" id="Node000008" href="$dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1" title="Helper method for update method below." alt="" coords="194,29,365,70"/>
-<area shape="poly" id="edge8_Node000002_Node000008" title=" " alt="" coords="145,86,193,72,194,77,147,91"/>
-<area shape="poly" id="edge7_Node000003_Node000003" title=" " alt="" coords="250,118,248,109,253,100,264,94,280,92,297,94,307,101,304,105,295,99,280,97,265,99,257,104,253,110,255,118"/>
-<area shape="rect" id="Node000004" href="$dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841" title="Any associative function that combines x and y." alt="" coords="413,12,585,53"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="314,116,412,63,427,57,429,62,415,68,317,120"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="463,142,535,168"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="366,143,447,149,447,154,365,148"/>
-<area shape="rect" id="Node000006" href="$dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141" title="Gives the midpoint between two integers." alt="" coords="413,77,585,118"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="365,120,398,114,399,119,366,126"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="465,192,533,217"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="348,157,414,178,451,188,449,194,413,183,346,162"/>
-<area shape="poly" id="edge9_Node000008_Node000004" title=" " alt="" coords="365,40,397,38,398,43,366,46"/>
-<area shape="poly" id="edge10_Node000008_Node000006" title=" " alt="" coords="366,66,399,73,397,78,365,71"/>
-<area shape="poly" id="edge11_Node000008_Node000008" title=" " alt="" coords="250,29,248,19,253,11,264,5,280,3,297,5,307,11,304,16,295,10,280,8,265,10,257,14,253,20,255,28"/>
-</map>
diff --git a/de/dd1/segment__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/dd1/segment__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 294f7e2fc..000000000
--- a/de/dd1/segment__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c2c0341b375ae00be4c45e39e9c025d5
\ No newline at end of file
diff --git a/de/dd1/segment__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/dd1/segment__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 012168c8e..000000000
--- a/de/dd1/segment__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,213 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="443pt" height="167pt"
- viewBox="0.00 0.00 442.50 166.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 162.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-101.25 0,-101.25 0,-82 37,-82 37,-101.25"/>
-<text text-anchor="middle" x="18.5" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-101.25 73,-101.25 73,-82 105.5,-82 105.5,-101.25"/>
-<text text-anchor="middle" x="89.25" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-91.62C44.58,-91.62 53.31,-91.62 61.45,-91.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-95.13 71.2,-91.63 61.2,-88.13 61.2,-95.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52" target="_top" xlink:title="Helper method for range_comb method below.">
-<polygon fill="white" stroke="#666666" points="270,-73.88 141.5,-73.88 141.5,-43.38 270,-43.38 270,-73.88"/>
-<text text-anchor="start" x="149.5" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="205.75" y="-49.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::range_comb</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-87.17C114.75,-84.56 126.89,-81.07 139.55,-77.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.16,-80.88 148.8,-74.75 138.22,-74.16 140.16,-80.88"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1" target="_top" xlink:title="Helper method for update method below.">
-<polygon fill="white" stroke="#666666" points="270,-140.88 141.5,-140.88 141.5,-110.38 270,-110.38 270,-140.88"/>
-<text text-anchor="start" x="149.5" y="-127.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="205.75" y="-116.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::update</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge8_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge8_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-96.21C115.13,-99.01 127.91,-102.81 141.14,-106.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.77,-109.98 150.35,-109.47 141.76,-103.27 139.77,-109.98"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge7_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge7_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.11,-74.36C180.89,-83.43 187.77,-91.88 205.75,-91.88 215.58,-91.88 222.09,-89.35 225.29,-85.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.75,-86.16 226.25,-75.87 221.78,-85.48 228.75,-86.16"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841" target="_top" xlink:title="Any associative function that combines x and y.">
-<polygon fill="white" stroke="#666666" points="434.5,-153.88 306,-153.88 306,-123.38 434.5,-123.38 434.5,-153.88"/>
-<text text-anchor="start" x="314" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="370.25" y="-129.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::comb</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M232.8,-74.28C252.54,-85.84 280.53,-101.59 306,-113.62 309.52,-115.29 313.19,-116.94 316.9,-118.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.44,-121.74 326.02,-122.39 318.16,-115.28 315.44,-121.74"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.38,-56.25 343.12,-56.25 343.12,-37 397.38,-37 397.38,-56.25"/>
-<text text-anchor="middle" x="370.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.04,-53.95C290.8,-52.42 313.21,-50.76 331.47,-49.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.58,-52.92 341.3,-48.69 331.07,-45.94 331.58,-52.92"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141" target="_top" xlink:title="Gives the midpoint between two integers.">
-<polygon fill="white" stroke="#666666" points="434.5,-104.88 306,-104.88 306,-74.38 434.5,-74.38 434.5,-104.88"/>
-<text text-anchor="start" x="314" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="370.25" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::mid</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.04,-70.7C278.07,-72.23 286.34,-73.81 294.52,-75.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.63,-78.76 304.11,-77.2 294.94,-71.89 293.63,-78.76"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="395.88,-19.25 344.62,-19.25 344.62,0 395.88,0 395.88,-19.25"/>
-<text text-anchor="middle" x="370.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.15,-42.92C272.04,-37.95 289.74,-32.48 306,-27.62 314.85,-24.99 324.41,-22.22 333.37,-19.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.15,-23.08 342.82,-16.99 332.24,-16.35 334.15,-23.08"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge9_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge9_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.04,-130.69C277.98,-131.32 286.15,-131.98 294.24,-132.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.84,-136.1 304.09,-133.41 294.4,-129.13 293.84,-136.1"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge10_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge10_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.04,-111.6C278.07,-109.83 286.34,-107.99 294.52,-106.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.11,-109.63 304.12,-104.05 293.6,-102.8 295.11,-109.63"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge11_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge11_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.11,-141.36C180.89,-150.43 187.77,-158.88 205.75,-158.88 215.58,-158.88 222.09,-156.35 225.29,-152.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.75,-153.16 226.25,-142.87 221.78,-152.48 228.75,-153.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dd1/segment__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/dd1/segment__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 31ee8e9c7..000000000
--- a/de/dd1/segment__tree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,187 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="443pt" height="167pt"
- viewBox="0.00 0.00 442.50 166.88" 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 162.88)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-101.25 0,-101.25 0,-82 37,-82 37,-101.25"/>
-<text text-anchor="middle" x="18.5" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-101.25 73,-101.25 73,-82 105.5,-82 105.5,-101.25"/>
-<text text-anchor="middle" x="89.25" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-91.62C44.58,-91.62 53.31,-91.62 61.45,-91.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-95.13 71.2,-91.63 61.2,-88.13 61.2,-95.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52" target="_top" xlink:title="Helper method for range_comb method below.">
-<polygon fill="white" stroke="#666666" points="270,-73.88 141.5,-73.88 141.5,-43.38 270,-43.38 270,-73.88"/>
-<text text-anchor="start" x="149.5" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="205.75" y="-49.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::range_comb</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-87.17C114.75,-84.56 126.89,-81.07 139.55,-77.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="140.16,-80.88 148.8,-74.75 138.22,-74.16 140.16,-80.88"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1" target="_top" xlink:title="Helper method for update method below.">
-<polygon fill="white" stroke="#666666" points="270,-140.88 141.5,-140.88 141.5,-110.38 270,-110.38 270,-140.88"/>
-<text text-anchor="start" x="149.5" y="-127.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="205.75" y="-116.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::update</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node8 -->
-<g id="edge8_Node000002_Node000008" class="edge">
-<title>Node2&#45;&gt;Node8</title>
-<g id="a_edge8_Node000002_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.69,-96.21C115.13,-99.01 127.91,-102.81 141.14,-106.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.77,-109.98 150.35,-109.47 141.76,-103.27 139.77,-109.98"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge7_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge7_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.11,-74.36C180.89,-83.43 187.77,-91.88 205.75,-91.88 215.58,-91.88 222.09,-89.35 225.29,-85.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.75,-86.16 226.25,-75.87 221.78,-85.48 228.75,-86.16"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841" target="_top" xlink:title="Any associative function that combines x and y.">
-<polygon fill="white" stroke="#666666" points="434.5,-153.88 306,-153.88 306,-123.38 434.5,-123.38 434.5,-153.88"/>
-<text text-anchor="start" x="314" y="-140.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="370.25" y="-129.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::comb</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M232.8,-74.28C252.54,-85.84 280.53,-101.59 306,-113.62 309.52,-115.29 313.19,-116.94 316.9,-118.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.44,-121.74 326.02,-122.39 318.16,-115.28 315.44,-121.74"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.38,-56.25 343.12,-56.25 343.12,-37 397.38,-37 397.38,-56.25"/>
-<text text-anchor="middle" x="370.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.04,-53.95C290.8,-52.42 313.21,-50.76 331.47,-49.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="331.58,-52.92 341.3,-48.69 331.07,-45.94 331.58,-52.92"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141" target="_top" xlink:title="Gives the midpoint between two integers.">
-<polygon fill="white" stroke="#666666" points="434.5,-104.88 306,-104.88 306,-74.38 434.5,-74.38 434.5,-104.88"/>
-<text text-anchor="start" x="314" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Segment</text>
-<text text-anchor="middle" x="370.25" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">Tree::mid</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.04,-70.7C278.07,-72.23 286.34,-73.81 294.52,-75.37"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.63,-78.76 304.11,-77.2 294.94,-71.89 293.63,-78.76"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="395.88,-19.25 344.62,-19.25 344.62,0 395.88,0 395.88,-19.25"/>
-<text text-anchor="middle" x="370.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M256.15,-42.92C272.04,-37.95 289.74,-32.48 306,-27.62 314.85,-24.99 324.41,-22.22 333.37,-19.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.15,-23.08 342.82,-16.99 332.24,-16.35 334.15,-23.08"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge9_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge9_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.04,-130.69C277.98,-131.32 286.15,-131.98 294.24,-132.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="293.84,-136.1 304.09,-133.41 294.4,-129.13 293.84,-136.1"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node6 -->
-<g id="edge10_Node000008_Node000006" class="edge">
-<title>Node8&#45;&gt;Node6</title>
-<g id="a_edge10_Node000008_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.04,-111.6C278.07,-109.83 286.34,-107.99 294.52,-106.18"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="295.11,-109.63 304.12,-104.05 293.6,-102.8 295.11,-109.63"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node8 -->
-<g id="edge11_Node000008_Node000008" class="edge">
-<title>Node8&#45;&gt;Node8</title>
-<g id="a_edge11_Node000008_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M185.11,-141.36C180.89,-150.43 187.77,-158.88 205.75,-158.88 215.58,-158.88 222.09,-156.35 225.29,-152.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="228.75,-153.16 226.25,-142.87 221.78,-152.48 228.75,-153.16"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dd1/segment__tree_8cpp_source.html b/de/dd1/segment__tree_8cpp_source.html
new file mode 100644
index 000000000..5cb748ad4
--- /dev/null
+++ b/de/dd1/segment__tree_8cpp_source.html
@@ -0,0 +1,236 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/segment_tree.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/dd1/segment__tree_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">segment_tree.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/dd1/segment__tree_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;iostream&gt;</span>     </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;vector&gt;</span>       </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;algorithm&gt;</span>    </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;cassert&gt;</span>      </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment">/*</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment"> * @namespace</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"> * @brief Data structures</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d5/d3c/namespacedata__structures.html">data_structures</a> {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
+<div class="foldopen" id="foldopen00030" data-start="{" data-end="};">
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"><a class="line" href="../../dd/d95/classdata__structures_1_1_segment_tree.html">   30</a></span><span class="keyword">class </span><a class="code hl_class" href="../../dd/d95/classdata__structures_1_1_segment_tree.html">SegmentTree</a> {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keyword">private</span>:</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a10ffa5fc03c66170f0bc2592b843baa3">   32</a></span>    <span class="keyword">const</span> T <a class="code hl_variable" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a10ffa5fc03c66170f0bc2592b843baa3">ID</a> = 0;   </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"><a class="line" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258">   33</a></span>    std::vector&lt;T&gt; <a class="code hl_variable" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258">t</a>; </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"><a class="line" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3">   34</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3">size</a> = 0;     </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="keyword">private</span>:</div>
+<div class="foldopen" id="foldopen00042" data-start="{" data-end="}">
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841">   42</a></span>    T <a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841">comb</a>(T x, T y) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="keywordflow">return</span> x + y;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00051" data-start="{" data-end="}">
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141">   51</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141">mid</a>(<span class="keywordtype">int</span> l, <span class="keywordtype">int</span> r) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        <span class="keywordflow">return</span> l + (r - l) / 2;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1">   62</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1">update</a>(<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> l, <span class="keywordtype">int</span> r, <span class="keywordtype">int</span> pos, T val) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">if</span>(l == r) <a class="code hl_variable" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258">t</a>[i] = val;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            <span class="keywordtype">int</span> m = <a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141">mid</a>(l, r);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            <span class="keywordflow">if</span>(pos &lt;= m) <a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1">update</a>(i * 2, l, m, pos, val);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            <span class="keywordflow">else</span> <a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1">update</a>(i * 2 + 1, m + 1, r, pos, val);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            <a class="code hl_variable" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258">t</a>[i] = <a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841">comb</a>(<a class="code hl_variable" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258">t</a>[i * 2], <a class="code hl_variable" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258">t</a>[i * 2 + 1]);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        }</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00080" data-start="{" data-end="}">
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"><a class="line" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52">   80</a></span>    T <a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52">range_comb</a>(<span class="keywordtype">int</span> i, <span class="keywordtype">int</span> l, <span class="keywordtype">int</span> r, <span class="keywordtype">int</span> tl, <span class="keywordtype">int</span> tr) {</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        <span class="keywordflow">if</span>(l == tl &amp;&amp; r == tr) <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258">t</a>[i];</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <span class="keywordflow">if</span>(tl &gt; tr) <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordtype">int</span> m = <a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141">mid</a>(l, r);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841">comb</a>(<a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52">range_comb</a>(i * 2, l, m, tl, std::min(tr, m)), <a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52">range_comb</a>(i * 2 + 1, m + 1, r, std::max(tl, m + 1), tr));</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    }</div>
+</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span><span class="keyword">public</span>:</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    <a class="code hl_class" href="../../dd/d95/classdata__structures_1_1_segment_tree.html">SegmentTree</a>(<span class="keywordtype">int</span> n) : <a class="code hl_variable" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258">t</a>(n * 4, <a class="code hl_variable" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a10ffa5fc03c66170f0bc2592b843baa3">ID</a>), <a class="code hl_variable" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3">size</a>(n) {}</div>
+<div class="foldopen" id="foldopen00093" data-start="{" data-end="}">
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"><a class="line" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17">   93</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17">update</a>(<span class="keywordtype">int</span> pos, T val) {</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1">update</a>(1, 1, <a class="code hl_variable" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3">size</a>, pos, val);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00102" data-start="{" data-end="}">
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"><a class="line" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b">  102</a></span>    T <a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b">range_comb</a>(<span class="keywordtype">int</span> l, <span class="keywordtype">int</span> r) {</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52">range_comb</a>(1, 1, <a class="code hl_variable" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3">size</a>, l, r);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    }</div>
+</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>};</div>
+</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>} <span class="comment">// namespace data_structures</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="foldopen" id="foldopen00112" data-start="{" data-end="}">
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"><a class="line" href="../../de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  112</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <a class="code hl_class" href="../../dd/d95/classdata__structures_1_1_segment_tree.html">data_structures::SegmentTree&lt;int&gt;</a> t(5);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    t.<a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1">update</a>(1, 1);</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    t.<a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1">update</a>(2, 2);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    t.<a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1">update</a>(3, 3);</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    t.<a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1">update</a>(4, 4);</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    t.<a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1">update</a>(5, 5);</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    assert(t.<a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52">range_comb</a>(1, 3) == 6); <span class="comment">// 1 + 2 + 3 = 6</span></div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    t.<a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1">update</a>(1, 3);</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    assert(t.<a class="code hl_function" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52">range_comb</a>(1, 3) == 8); <span class="comment">// 3 + 2 + 3 = 8</span></div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span> </div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>}</div>
+</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
+<div class="foldopen" id="foldopen00130" data-start="{" data-end="}">
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"><a class="line" href="../../de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  130</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <a class="code hl_function" href="../../de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>}</div>
+</div>
+<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html"><div class="ttname"><a href="../../dd/d95/classdata__structures_1_1_segment_tree.html">data_structures::SegmentTree</a></div><div class="ttdoc">class representation of the segment tree</div><div class="ttdef"><b>Definition</b> <a href="#l00030">segment_tree.cpp:30</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a10ffa5fc03c66170f0bc2592b843baa3"><div class="ttname"><a href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a10ffa5fc03c66170f0bc2592b843baa3">data_structures::SegmentTree::ID</a></div><div class="ttdeci">const T ID</div><div class="ttdoc">Comb(ID, x) = x.</div><div class="ttdef"><b>Definition</b> <a href="#l00032">segment_tree.cpp:32</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a167fd91b68048e49e97859a8947690f3"><div class="ttname"><a href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3">data_structures::SegmentTree::size</a></div><div class="ttdeci">int size</div><div class="ttdoc">Number of elements available for querying in the tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00034">segment_tree.cpp:34</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a1c5331b509d9b55bedfadf979b30dd5b"><div class="ttname"><a href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b">data_structures::SegmentTree::range_comb</a></div><div class="ttdeci">T range_comb(int l, int r)</div><div class="ttdoc">Returns comb across all values between l and r.</div><div class="ttdef"><b>Definition</b> <a href="#l00102">segment_tree.cpp:102</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a2a04f1832c5ce86def50c3021b2ab6b1"><div class="ttname"><a href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1">data_structures::SegmentTree::update</a></div><div class="ttdeci">void update(int i, int l, int r, int pos, T val)</div><div class="ttdoc">Helper method for update method below.</div><div class="ttdef"><b>Definition</b> <a href="#l00062">segment_tree.cpp:62</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a6d3beccc936af2377c8eeb17067fd141"><div class="ttname"><a href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141">data_structures::SegmentTree::mid</a></div><div class="ttdeci">int mid(int l, int r)</div><div class="ttdoc">Gives the midpoint between two integers.</div><div class="ttdef"><b>Definition</b> <a href="#l00051">segment_tree.cpp:51</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a735d072a603f3abb7c03818440575258"><div class="ttname"><a href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258">data_structures::SegmentTree::t</a></div><div class="ttdeci">std::vector&lt; T &gt; t</div><div class="ttdoc">Vector to represent the tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00033">segment_tree.cpp:33</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a8d22286b7be3dcbb701ac5c7d9c79841"><div class="ttname"><a href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841">data_structures::SegmentTree::comb</a></div><div class="ttdeci">T comb(T x, T y)</div><div class="ttdoc">Any associative function that combines x and y.</div><div class="ttdef"><b>Definition</b> <a href="#l00042">segment_tree.cpp:42</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_a8fecc48e8e3f6f5f6e728495a4282e52"><div class="ttname"><a href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52">data_structures::SegmentTree::range_comb</a></div><div class="ttdeci">T range_comb(int i, int l, int r, int tl, int tr)</div><div class="ttdoc">Helper method for range_comb method below.</div><div class="ttdef"><b>Definition</b> <a href="#l00080">segment_tree.cpp:80</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1_segment_tree_html_ad0e78179ab979ae2bc4304bdc181db17"><div class="ttname"><a href="../../dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17">data_structures::SegmentTree::update</a></div><div class="ttdeci">void update(int pos, T val)</div><div class="ttdoc">Updates a value at a certain position.</div><div class="ttdef"><b>Definition</b> <a href="#l00093">segment_tree.cpp:93</a></div></div>
+<div class="ttc" id="anamespacedata__structures_html"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html">data_structures</a></div><div class="ttdoc">for IO operations</div></div>
+<div class="ttc" id="asegment__tree_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../de/dd1/segment__tree_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> <a href="#l00112">segment_tree.cpp:112</a></div></div>
+<div class="ttc" id="asegment__tree_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00130">segment_tree.cpp:130</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../de/dd1/segment__tree_8cpp.html">segment_tree.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/dd3/namespace_s_h_a.html b/de/dd3/namespace_s_h_a.html
index 4d8bc0405..39b117d74 100644
--- a/de/dd3/namespace_s_h_a.html
+++ b/de/dd3/namespace_s_h_a.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: SHA Namespace Reference</title>
+<title>TheAlgorithms/C++: SHA Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/de/dd3/newton__raphson__method_8cpp.html b/de/dd3/newton__raphson__method_8cpp.html
index b56bf5d25..a15a4fe9e 100644
--- a/de/dd3/newton__raphson__method_8cpp.html
+++ b/de/dd3/newton__raphson__method_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/newton_raphson_method.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/newton_raphson_method.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for newton_raphson_method.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d38/newton__raphson__method_8cpp__incl.svg" width="402" height="126"><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">
+</div>
+<p><a href="../../de/dd3/newton__raphson__method_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a2003b5b2dcfff0769b957ab5c968b03d" id="r_a2003b5b2dcfff0769b957ab5c968b03d"><td class="memItemLeft" align="right" valign="top">static double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2003b5b2dcfff0769b957ab5c968b03d">eq</a> (double i)</td></tr>
@@ -135,13 +154,11 @@ Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
 Variables</h2></td></tr>
-<tr class="memitem:a75f355966e0a97665eaf5a4c79baa7af" id="r_a75f355966e0a97665eaf5a4c79baa7af"><td class="memItemLeft" align="right" valign="top"><a id="a75f355966e0a97665eaf5a4c79baa7af" name="a75f355966e0a97665eaf5a4c79baa7af"></a>
-constexpr double&#160;</td><td class="memItemRight" valign="bottom"><b>EPSILON</b> = 1e-10</td></tr>
-<tr class="memdesc:a75f355966e0a97665eaf5a4c79baa7af"><td class="mdescLeft">&#160;</td><td class="mdescRight">system accuracy limit <br /></td></tr>
+<tr class="memitem:a75f355966e0a97665eaf5a4c79baa7af" id="r_a75f355966e0a97665eaf5a4c79baa7af"><td class="memItemLeft" align="right" valign="top">constexpr double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a75f355966e0a97665eaf5a4c79baa7af">EPSILON</a> = 1e-10</td></tr>
+<tr class="memdesc:a75f355966e0a97665eaf5a4c79baa7af"><td class="mdescLeft">&#160;</td><td class="mdescRight">system accuracy limit  <br /></td></tr>
 <tr class="separator:a75f355966e0a97665eaf5a4c79baa7af"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a5c5ff05b9f37ae59dad67e1d4f6cd51d" id="r_a5c5ff05b9f37ae59dad67e1d4f6cd51d"><td class="memItemLeft" align="right" valign="top"><a id="a5c5ff05b9f37ae59dad67e1d4f6cd51d" name="a5c5ff05b9f37ae59dad67e1d4f6cd51d"></a>
-constexpr int16_t&#160;</td><td class="memItemRight" valign="bottom"><b>MAX_ITERATIONS</b> = INT16_MAX</td></tr>
-<tr class="memdesc:a5c5ff05b9f37ae59dad67e1d4f6cd51d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Maximum number of iterations. <br /></td></tr>
+<tr class="memitem:a5c5ff05b9f37ae59dad67e1d4f6cd51d" id="r_a5c5ff05b9f37ae59dad67e1d4f6cd51d"><td class="memItemLeft" align="right" valign="top">constexpr int16_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5c5ff05b9f37ae59dad67e1d4f6cd51d">MAX_ITERATIONS</a> = INT16_MAX</td></tr>
+<tr class="memdesc:a5c5ff05b9f37ae59dad67e1d4f6cd51d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Maximum number of iterations.  <br /></td></tr>
 <tr class="separator:a5c5ff05b9f37ae59dad67e1d4f6cd51d"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -153,6 +170,8 @@ x_{i+1} = x_i - \frac{f(x_i)}{f&#39;(x_i)}
 </p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d7/d6a/bisection__method_8cpp.html" title="Solve the equation  using bisection method">bisection_method.cpp</a>, <a class="el" href="../../dd/d29/false__position_8cpp.html" title="Solve the equation  using false position method, also known as the Secant method.">false_position.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../de/dd3/newton__raphson__method_8cpp_source.html">newton_raphson_method.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a2003b5b2dcfff0769b957ab5c968b03d" name="a2003b5b2dcfff0769b957ab5c968b03d"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a2003b5b2dcfff0769b957ab5c968b03d">&#9670;&#160;</a></span>eq()</h2>
@@ -181,16 +200,12 @@ x_{i+1} = x_i - \frac{f(x_i)}{f&#39;(x_i)}
 f(x) = x^3 - 4x - 9
 \]
 </p>
- <div class="fragment"><div class="line"><span class="lineno">   30</span>                           {</div>
-<div class="line"><span class="lineno">   31</span>    <span class="keywordflow">return</span> (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(i, 3) - (4 * i) - 9);  <span class="comment">// original equation</span></div>
+ 
+<p class="definition">Definition at line <a class="el" href="../../de/dd3/newton__raphson__method_8cpp_source.html#l00030">30</a> of file <a class="el" href="../../de/dd3/newton__raphson__method_8cpp_source.html">newton_raphson_method.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   30</span>                           {</div>
+<div class="line"><span class="lineno">   31</span>    <span class="keywordflow">return</span> (std::pow(i, 3) - (4 * i) - 9);  <span class="comment">// original equation</span></div>
 <div class="line"><span class="lineno">   32</span>}</div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg" width="168" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a3d3f7f41977394680af6ebbed96f3386" name="a3d3f7f41977394680af6ebbed96f3386"></a>
@@ -220,15 +235,12 @@ Here is the call graph for this function:</div>
 f&#39;(x) = 3x^2 - 4
 \]
 </p>
- <div class="fragment"><div class="line"><span class="lineno">   40</span>                               {</div>
-<div class="line"><span class="lineno">   41</span>    <span class="keywordflow">return</span> ((3 * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(i, 2)) - 4);  <span class="comment">// derivative of equation</span></div>
+ 
+<p class="definition">Definition at line <a class="el" href="../../de/dd3/newton__raphson__method_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../de/dd3/newton__raphson__method_8cpp_source.html">newton_raphson_method.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   40</span>                               {</div>
+<div class="line"><span class="lineno">   41</span>    <span class="keywordflow">return</span> ((3 * std::pow(i, 2)) - 4);  <span class="comment">// derivative of equation</span></div>
 <div class="line"><span class="lineno">   42</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.svg" width="191" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -246,13 +258,15 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd3/newton__raphson__method_8cpp_source.html#l00045">45</a> of file <a class="el" href="../../de/dd3/newton__raphson__method_8cpp_source.html">newton_raphson_method.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   45</span>           {</div>
-<div class="line"><span class="lineno">   46</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>));  <span class="comment">// initialize randomizer</span></div>
+<div class="line"><span class="lineno">   46</span>    std::srand(std::time(<span class="keyword">nullptr</span>));  <span class="comment">// initialize randomizer</span></div>
 <div class="line"><span class="lineno">   47</span> </div>
-<div class="line"><span class="lineno">   48</span>    <span class="keywordtype">double</span> z = NAN, c = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 100, m = NAN, n = NAN;</div>
+<div class="line"><span class="lineno">   48</span>    <span class="keywordtype">double</span> z = NAN, c = std::rand() % 100, m = NAN, n = NAN;</div>
 <div class="line"><span class="lineno">   49</span>    <span class="keywordtype">int</span> i = 0;</div>
 <div class="line"><span class="lineno">   50</span> </div>
-<div class="line"><span class="lineno">   51</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nInitial approximation: &quot;</span> &lt;&lt; c;</div>
+<div class="line"><span class="lineno">   51</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nInitial approximation: &quot;</span> &lt;&lt; c;</div>
 <div class="line"><span class="lineno">   52</span> </div>
 <div class="line"><span class="lineno">   53</span>    <span class="comment">// start iterations</span></div>
 <div class="line"><span class="lineno">   54</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="#a5c5ff05b9f37ae59dad67e1d4f6cd51d">MAX_ITERATIONS</a>; i++) {</div>
@@ -267,23 +281,66 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   63</span>        }</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>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n\nRoot: &quot;</span> &lt;&lt; z &lt;&lt; <span class="stringliteral">&quot;\t\tSteps: &quot;</span> &lt;&lt; i &lt;&lt; <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">   66</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n\nRoot: &quot;</span> &lt;&lt; z &lt;&lt; <span class="stringliteral">&quot;\t\tSteps: &quot;</span> &lt;&lt; i &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   67</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   68</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="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="anewton__raphson__method_8cpp_html_a2003b5b2dcfff0769b957ab5c968b03d"><div class="ttname"><a href="#a2003b5b2dcfff0769b957ab5c968b03d">eq</a></div><div class="ttdeci">static double eq(double i)</div><div class="ttdef"><b>Definition</b> newton_raphson_method.cpp:30</div></div>
-<div class="ttc" id="anewton__raphson__method_8cpp_html_a3d3f7f41977394680af6ebbed96f3386"><div class="ttname"><a href="#a3d3f7f41977394680af6ebbed96f3386">eq_der</a></div><div class="ttdeci">static double eq_der(double i)</div><div class="ttdef"><b>Definition</b> newton_raphson_method.cpp:40</div></div>
-<div class="ttc" id="anewton__raphson__method_8cpp_html_a5c5ff05b9f37ae59dad67e1d4f6cd51d"><div class="ttname"><a href="#a5c5ff05b9f37ae59dad67e1d4f6cd51d">MAX_ITERATIONS</a></div><div class="ttdeci">constexpr int16_t MAX_ITERATIONS</div><div class="ttdoc">Maximum number of iterations.</div><div class="ttdef"><b>Definition</b> newton_raphson_method.cpp:22</div></div>
-<div class="ttc" id="anewton__raphson__method_8cpp_html_a75f355966e0a97665eaf5a4c79baa7af"><div class="ttname"><a href="#a75f355966e0a97665eaf5a4c79baa7af">EPSILON</a></div><div class="ttdeci">constexpr double EPSILON</div><div class="ttdoc">system accuracy limit</div><div class="ttdef"><b>Definition</b> newton_raphson_method.cpp:21</div></div>
-<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
-<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="307" height="283"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="ttc" id="anewton__raphson__method_8cpp_html_a2003b5b2dcfff0769b957ab5c968b03d"><div class="ttname"><a href="#a2003b5b2dcfff0769b957ab5c968b03d">eq</a></div><div class="ttdeci">static double eq(double i)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dd3/newton__raphson__method_8cpp_source.html#l00030">newton_raphson_method.cpp:30</a></div></div>
+<div class="ttc" id="anewton__raphson__method_8cpp_html_a3d3f7f41977394680af6ebbed96f3386"><div class="ttname"><a href="#a3d3f7f41977394680af6ebbed96f3386">eq_der</a></div><div class="ttdeci">static double eq_der(double i)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dd3/newton__raphson__method_8cpp_source.html#l00040">newton_raphson_method.cpp:40</a></div></div>
+<div class="ttc" id="anewton__raphson__method_8cpp_html_a5c5ff05b9f37ae59dad67e1d4f6cd51d"><div class="ttname"><a href="#a5c5ff05b9f37ae59dad67e1d4f6cd51d">MAX_ITERATIONS</a></div><div class="ttdeci">constexpr int16_t MAX_ITERATIONS</div><div class="ttdoc">Maximum number of iterations.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dd3/newton__raphson__method_8cpp_source.html#l00022">newton_raphson_method.cpp:22</a></div></div>
+<div class="ttc" id="anewton__raphson__method_8cpp_html_a75f355966e0a97665eaf5a4c79baa7af"><div class="ttname"><a href="#a75f355966e0a97665eaf5a4c79baa7af">EPSILON</a></div><div class="ttdeci">constexpr double EPSILON</div><div class="ttdoc">system accuracy limit</div><div class="ttdef"><b>Definition</b> <a href="../../de/dd3/newton__raphson__method_8cpp_source.html#l00021">newton_raphson_method.cpp:21</a></div></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Variable Documentation</h2>
+<a id="a75f355966e0a97665eaf5a4c79baa7af" name="a75f355966e0a97665eaf5a4c79baa7af"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a75f355966e0a97665eaf5a4c79baa7af">&#9670;&#160;</a></span>EPSILON</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">double EPSILON = 1e-10</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">constexpr</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>system accuracy limit </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd3/newton__raphson__method_8cpp_source.html#l00021">21</a> of file <a class="el" href="../../de/dd3/newton__raphson__method_8cpp_source.html">newton_raphson_method.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a5c5ff05b9f37ae59dad67e1d4f6cd51d" name="a5c5ff05b9f37ae59dad67e1d4f6cd51d"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a5c5ff05b9f37ae59dad67e1d4f6cd51d">&#9670;&#160;</a></span>MAX_ITERATIONS</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int16_t MAX_ITERATIONS = INT16_MAX</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">constexpr</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Maximum number of iterations. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd3/newton__raphson__method_8cpp_source.html#l00022">22</a> of file <a class="el" href="../../de/dd3/newton__raphson__method_8cpp_source.html">newton_raphson_method.cpp</a>.</p>
 
 </div>
 </div>
diff --git a/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map b/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map
deleted file mode 100644
index cea381859..000000000
--- a/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="eq" name="eq">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,44,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="92,5,163,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="44,16,76,16,76,21,44,21"/>
-</map>
diff --git a/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 b/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5
deleted file mode 100644
index 322f63d1e..000000000
--- a/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4354e7c666481f9ddcf69bc9fb092577
\ No newline at end of file
diff --git a/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg b/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg
deleted file mode 100644
index acc81ae0a..000000000
--- a/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: eq Pages: 1 -->
-<svg width="126pt" height="27pt"
- viewBox="0.00 0.00 126.30 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>eq</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="28.8,-19.25 0,-19.25 0,0 28.8,0 28.8,-19.25"/>
-<text text-anchor="middle" x="14.4" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">eq</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="118.3,-19.25 64.8,-19.25 64.8,0 118.3,0 118.3,-19.25"/>
-<text text-anchor="middle" x="91.55" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.18,-9.62C35.94,-9.62 44.45,-9.62 52.95,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="52.87,-13.13 62.87,-9.63 52.87,-6.13 52.87,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph_org.svg b/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph_org.svg
deleted file mode 100644
index 573541779..000000000
--- a/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: eq Pages: 1 -->
-<svg width="126pt" height="27pt"
- viewBox="0.00 0.00 126.30 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>eq</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="28.8,-19.25 0,-19.25 0,0 28.8,0 28.8,-19.25"/>
-<text text-anchor="middle" x="14.4" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">eq</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="118.3,-19.25 64.8,-19.25 64.8,0 118.3,0 118.3,-19.25"/>
-<text text-anchor="middle" x="91.55" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.18,-9.62C35.94,-9.62 44.45,-9.62 52.95,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="52.87,-13.13 62.87,-9.63 52.87,-6.13 52.87,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.map b/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.map
deleted file mode 100644
index 9d6c4f9e9..000000000
--- a/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="eq_der" name="eq_der">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,66,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="114,5,185,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="66,16,98,16,98,21,66,21"/>
-</map>
diff --git a/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.md5 b/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.md5
deleted file mode 100644
index 6f66139b4..000000000
--- a/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b198f600cad58969f3c7bbaa13ba1bf4
\ No newline at end of file
diff --git a/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.svg b/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.svg
deleted file mode 100644
index 82354a649..000000000
--- a/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: eq_der Pages: 1 -->
-<svg width="143pt" height="27pt"
- viewBox="0.00 0.00 142.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>eq_der</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="45.25,-19.25 0,-19.25 0,0 45.25,0 45.25,-19.25"/>
-<text text-anchor="middle" x="22.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">eq_der</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="134.75,-19.25 81.25,-19.25 81.25,0 134.75,0 134.75,-19.25"/>
-<text text-anchor="middle" x="108" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.53,-9.62C52.88,-9.62 61.29,-9.62 69.48,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.28,-13.13 79.28,-9.63 69.28,-6.13 69.28,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph_org.svg b/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph_org.svg
deleted file mode 100644
index 018b662c1..000000000
--- a/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: eq_der Pages: 1 -->
-<svg width="143pt" height="27pt"
- viewBox="0.00 0.00 142.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>eq_der</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="45.25,-19.25 0,-19.25 0,0 45.25,0 45.25,-19.25"/>
-<text text-anchor="middle" x="22.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">eq_der</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="134.75,-19.25 81.25,-19.25 81.25,0 134.75,0 134.75,-19.25"/>
-<text text-anchor="middle" x="108" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.53,-9.62C52.88,-9.62 61.29,-9.62 69.48,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="69.28,-13.13 79.28,-9.63 69.28,-6.13 69.28,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 2d116bd1a..000000000
--- a/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,18 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,129,55,155"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="107,5,178,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="36,128,62,86,101,40,102,39,106,43,105,44,66,89,41,130"/>
-<area shape="rect" id="Node000003" href="$de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d" title=" " alt="" coords="123,55,162,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="48,127,101,89,109,84,112,89,104,94,51,131"/>
-<area shape="rect" id="Node000005" href="$de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386" title=" " alt="" coords="112,104,172,130"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="55,134,96,124,97,130,56,139"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="106,153,178,179"/>
-<area shape="poly" id="edge6_Node000001_Node000006" title=" " alt="" coords="56,145,91,153,90,158,55,150"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="103,203,182,228"/>
-<area shape="poly" id="edge7_Node000001_Node000007" title=" " alt="" coords="51,153,104,189,108,192,105,196,101,194,48,158"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="106,252,178,278"/>
-<area shape="poly" id="edge8_Node000001_Node000008" title=" " alt="" coords="41,154,67,194,105,239,106,240,102,244,101,243,62,198,36,157"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="230,80,301,106"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="163,69,216,80,215,85,161,74"/>
-<area shape="poly" id="edge5_Node000005_Node000004" title=" " alt="" coords="172,108,214,100,215,105,173,114"/>
-</map>
diff --git a/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 4276441d3..000000000
--- a/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-3d0f9299182f2af889a400689d9ed933
\ No newline at end of file
diff --git a/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 46845c838..000000000
--- a/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,182 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="230pt" height="212pt"
- viewBox="0.00 0.00 230.00 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-111.25 0,-111.25 0,-92 37,-92 37,-111.25"/>
-<text text-anchor="middle" x="18.5" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.5,-204.25 76,-204.25 76,-185 129.5,-185 129.5,-204.25"/>
-<text text-anchor="middle" x="102.75" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.87,-111.55C33.51,-126.86 51.69,-156.56 73,-176.62 73.39,-176.99 73.78,-177.35 74.18,-177.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.03,-180.46 82.12,-183.69 76.24,-174.87 72.03,-180.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="117.15,-167.25 88.35,-167.25 88.35,-148 117.15,-148 117.15,-167.25"/>
-<text text-anchor="middle" x="102.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">eq</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.98,-111.53C43.71,-119.33 59.16,-130.39 73,-139.62 74.8,-140.83 76.68,-142.05 78.57,-143.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.3,-145.98 86.62,-148.37 80.04,-140.07 76.3,-145.98"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125.38,-130.25 80.12,-130.25 80.12,-111 125.38,-111 125.38,-130.25"/>
-<text text-anchor="middle" x="102.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">eq_der</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-105.75C46.51,-107.86 57.96,-110.51 68.67,-112.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.83,-116.38 78.36,-115.22 69.41,-109.56 67.83,-116.38"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-93.25 75.62,-93.25 75.62,-74 129.88,-74 129.88,-93.25"/>
-<text text-anchor="middle" x="102.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-97.72C45.21,-96 54.76,-93.91 64.07,-91.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.69,-95.32 73.71,-89.76 63.19,-88.48 64.69,-95.32"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-56.25 73,-56.25 73,-37 132.5,-37 132.5,-56.25"/>
-<text text-anchor="middle" x="102.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.46,-91.71C44.19,-84.16 59.42,-73.57 73,-64.62 74.01,-63.96 75.04,-63.29 76.08,-62.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.72,-65.72 84.27,-57.4 73.96,-59.82 77.72,-65.72"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-19.25 75.62,-19.25 75.62,0 129.88,0 129.88,-19.25"/>
-<text text-anchor="middle" x="102.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge8_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.04,-91.59C33.78,-76.42 51.93,-47.34 73,-27.62 73.39,-27.26 73.78,-26.9 74.19,-26.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.24,-29.38 82.13,-20.57 72.04,-23.79 76.24,-29.38"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222,-148.25 168.5,-148.25 168.5,-129 222,-129 222,-148.25"/>
-<text text-anchor="middle" x="195.25" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.5,-154.74C128.11,-152.51 143.31,-149.32 157.39,-146.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.78,-149.86 166.85,-144.38 156.34,-143.01 157.78,-149.86"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge5_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge5_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.66,-124.98C135.03,-126.85 146.25,-129.08 156.86,-131.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.06,-134.6 166.55,-133.12 157.43,-127.73 156.06,-134.6"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 99e18c459..000000000
--- a/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,156 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="230pt" height="212pt"
- viewBox="0.00 0.00 230.00 212.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 208.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-111.25 0,-111.25 0,-92 37,-92 37,-111.25"/>
-<text text-anchor="middle" x="18.5" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.5,-204.25 76,-204.25 76,-185 129.5,-185 129.5,-204.25"/>
-<text text-anchor="middle" x="102.75" y="-190.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M24.87,-111.55C33.51,-126.86 51.69,-156.56 73,-176.62 73.39,-176.99 73.78,-177.35 74.18,-177.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.03,-180.46 82.12,-183.69 76.24,-174.87 72.03,-180.46"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="117.15,-167.25 88.35,-167.25 88.35,-148 117.15,-148 117.15,-167.25"/>
-<text text-anchor="middle" x="102.75" y="-153.75" font-family="Helvetica,sans-Serif" font-size="10.00">eq</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.98,-111.53C43.71,-119.33 59.16,-130.39 73,-139.62 74.8,-140.83 76.68,-142.05 78.57,-143.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.3,-145.98 86.62,-148.37 80.04,-140.07 76.3,-145.98"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125.38,-130.25 80.12,-130.25 80.12,-111 125.38,-111 125.38,-130.25"/>
-<text text-anchor="middle" x="102.75" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">eq_der</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-105.75C46.51,-107.86 57.96,-110.51 68.67,-112.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.83,-116.38 78.36,-115.22 69.41,-109.56 67.83,-116.38"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/rand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-93.25 75.62,-93.25 75.62,-74 129.88,-74 129.88,-93.25"/>
-<text text-anchor="middle" x="102.75" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge6_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge6_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-97.72C45.21,-96 54.76,-93.91 64.07,-91.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="64.69,-95.32 73.71,-89.76 63.19,-88.48 64.69,-95.32"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="132.5,-56.25 73,-56.25 73,-37 132.5,-37 132.5,-56.25"/>
-<text text-anchor="middle" x="102.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M33.46,-91.71C44.19,-84.16 59.42,-73.57 73,-64.62 74.01,-63.96 75.04,-63.29 76.08,-62.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.72,-65.72 84.27,-57.4 73.96,-59.82 77.72,-65.72"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="129.88,-19.25 75.62,-19.25 75.62,0 129.88,0 129.88,-19.25"/>
-<text text-anchor="middle" x="102.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge8_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge8_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M25.04,-91.59C33.78,-76.42 51.93,-47.34 73,-27.62 73.39,-27.26 73.78,-26.9 74.19,-26.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.24,-29.38 82.13,-20.57 72.04,-23.79 76.24,-29.38"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="222,-148.25 168.5,-148.25 168.5,-129 222,-129 222,-148.25"/>
-<text text-anchor="middle" x="195.25" y="-134.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M117.5,-154.74C128.11,-152.51 143.31,-149.32 157.39,-146.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.78,-149.86 166.85,-144.38 156.34,-143.01 157.78,-149.86"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge5_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge5_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.66,-124.98C135.03,-126.85 146.25,-129.08 156.86,-131.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.06,-134.6 166.55,-133.12 157.43,-127.73 156.06,-134.6"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dd3/newton__raphson__method_8cpp_source.html b/de/dd3/newton__raphson__method_8cpp_source.html
new file mode 100644
index 000000000..215ad1c5e
--- /dev/null
+++ b/de/dd3/newton__raphson__method_8cpp_source.html
@@ -0,0 +1,190 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/newton_raphson_method.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/dd3/newton__raphson__method_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">newton_raphson_method.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/dd3/newton__raphson__method_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;limits&gt;</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"><a class="line" href="../../de/dd3/newton__raphson__method_8cpp.html#a75f355966e0a97665eaf5a4c79baa7af">   21</a></span><span class="keyword">constexpr</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="../../de/dd3/newton__raphson__method_8cpp.html#a75f355966e0a97665eaf5a4c79baa7af">EPSILON</a> = 1e-10;              </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"><a class="line" href="../../de/dd3/newton__raphson__method_8cpp.html#a5c5ff05b9f37ae59dad67e1d4f6cd51d">   22</a></span><span class="keyword">constexpr</span> int16_t <a class="code hl_variable" href="../../de/dd3/newton__raphson__method_8cpp.html#a5c5ff05b9f37ae59dad67e1d4f6cd51d">MAX_ITERATIONS</a> = INT16_MAX;  </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="foldopen" id="foldopen00030" data-start="{" data-end="}">
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"><a class="line" href="../../de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d">   30</a></span><span class="keyword">static</span> <span class="keywordtype">double</span> <a class="code hl_function" href="../../de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d">eq</a>(<span class="keywordtype">double</span> i) {</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordflow">return</span> (std::pow(i, 3) - (4 * i) - 9);  <span class="comment">// original equation</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>}</div>
+</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="foldopen" id="foldopen00040" data-start="{" data-end="}">
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386">   40</a></span><span class="keyword">static</span> <span class="keywordtype">double</span> <a class="code hl_function" href="../../de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386">eq_der</a>(<span class="keywordtype">double</span> i) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">return</span> ((3 * std::pow(i, 2)) - 4);  <span class="comment">// derivative of equation</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>}</div>
+</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="foldopen" id="foldopen00045" data-start="{" data-end="}">
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="../../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   45</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    std::srand(std::time(<span class="keyword">nullptr</span>));  <span class="comment">// initialize randomizer</span></div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordtype">double</span> z = NAN, c = std::rand() % 100, m = NAN, n = NAN;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordtype">int</span> i = 0;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nInitial approximation: &quot;</span> &lt;&lt; c;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="comment">// start iterations</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">for</span> (i = 0; i &lt; <a class="code hl_variable" href="../../de/dd3/newton__raphson__method_8cpp.html#a5c5ff05b9f37ae59dad67e1d4f6cd51d">MAX_ITERATIONS</a>; i++) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        m = <a class="code hl_function" href="../../de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d">eq</a>(c);</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        n = <a class="code hl_function" href="../../de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386">eq_der</a>(c);</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        z = c - (m / n);</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        c = z;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <span class="keywordflow">if</span> (std::abs(m) &lt; <a class="code hl_variable" href="../../de/dd3/newton__raphson__method_8cpp.html#a75f355966e0a97665eaf5a4c79baa7af">EPSILON</a>) {  <span class="comment">// stoping criteria</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            <span class="keywordflow">break</span>;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\n\nRoot: &quot;</span> &lt;&lt; z &lt;&lt; <span class="stringliteral">&quot;\t\tSteps: &quot;</span> &lt;&lt; i &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>}</div>
+</div>
+<div class="ttc" id="anewton__raphson__method_8cpp_html_a2003b5b2dcfff0769b957ab5c968b03d"><div class="ttname"><a href="../../de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d">eq</a></div><div class="ttdeci">static double eq(double i)</div><div class="ttdef"><b>Definition</b> <a href="#l00030">newton_raphson_method.cpp:30</a></div></div>
+<div class="ttc" id="anewton__raphson__method_8cpp_html_a3d3f7f41977394680af6ebbed96f3386"><div class="ttname"><a href="../../de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386">eq_der</a></div><div class="ttdeci">static double eq_der(double i)</div><div class="ttdef"><b>Definition</b> <a href="#l00040">newton_raphson_method.cpp:40</a></div></div>
+<div class="ttc" id="anewton__raphson__method_8cpp_html_a5c5ff05b9f37ae59dad67e1d4f6cd51d"><div class="ttname"><a href="../../de/dd3/newton__raphson__method_8cpp.html#a5c5ff05b9f37ae59dad67e1d4f6cd51d">MAX_ITERATIONS</a></div><div class="ttdeci">constexpr int16_t MAX_ITERATIONS</div><div class="ttdoc">Maximum number of iterations.</div><div class="ttdef"><b>Definition</b> <a href="#l00022">newton_raphson_method.cpp:22</a></div></div>
+<div class="ttc" id="anewton__raphson__method_8cpp_html_a75f355966e0a97665eaf5a4c79baa7af"><div class="ttname"><a href="../../de/dd3/newton__raphson__method_8cpp.html#a75f355966e0a97665eaf5a4c79baa7af">EPSILON</a></div><div class="ttdeci">constexpr double EPSILON</div><div class="ttdoc">system accuracy limit</div><div class="ttdef"><b>Definition</b> <a href="#l00021">newton_raphson_method.cpp:21</a></div></div>
+<div class="ttc" id="anewton__raphson__method_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00045">newton_raphson_method.cpp:45</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../de/dd3/newton__raphson__method_8cpp.html">newton_raphson_method.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/dd9/catalan__numbers_8cpp.html b/de/dd9/catalan__numbers_8cpp.html
index ad123ea79..b5c2e3dd4 100644
--- a/de/dd9/catalan__numbers_8cpp.html
+++ b/de/dd9/catalan__numbers_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming/catalan_numbers.cpp File Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming/catalan_numbers.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for catalan_numbers.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d75/catalan__numbers_8cpp__incl.svg" width="518" height="126"><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">
+</div>
+<p><a href="../../de/dd9/catalan__numbers_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d1f/classcatalan__numbers.html">catalan_numbers</a></td></tr>
@@ -142,6 +161,8 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Provides utilities to compute Catalan numbers using dynamic programming. A Catalan numbers satisfy these recurrence relations: C(0) = C(1) = 1; C(n) = sum(C(i).C(n-i-1)), for i = 0 to n-1 Read more about Catalan numbers here: <a href="https://en.wikipedia.org/wiki/Catalan_number">https://en.wikipedia.org/wiki/Catalan_number</a> <a href="https://oeis.org/A000108/">https://oeis.org/A000108/</a>. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html">catalan_numbers.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -157,6 +178,8 @@ Functions</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html#l00079">79</a> of file <a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html">catalan_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   79</span>           {</div>
 <div class="line"><span class="lineno">   80</span>    test_catalan_numbers_up_to_20();</div>
 <div class="line"><span class="lineno">   81</span>    test_catalan_numbers_25();</div>
@@ -178,13 +201,15 @@ Functions</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html#l00073">73</a> of file <a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html">catalan_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   73</span>                               {</div>
 <div class="line"><span class="lineno">   74</span>    <span class="comment">// data verified with https://oeis.org/A000108/</span></div>
 <div class="line"><span class="lineno">   75</span>    <a class="code hl_class" href="../../dc/d1f/classcatalan__numbers.html">catalan_numbers</a> cn;</div>
 <div class="line"><span class="lineno">   76</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(25) == 4861946401452ULL);</div>
 <div class="line"><span class="lineno">   77</span>}</div>
-<div class="ttc" id="aclasscatalan__numbers_html"><div class="ttname"><a href="../../dc/d1f/classcatalan__numbers.html">catalan_numbers</a></div><div class="ttdoc">computes and caches Catalan numbers</div><div class="ttdef"><b>Definition</b> catalan_numbers.cpp:22</div></div>
-<div class="ttc" id="aclasscatalan__numbers_html_a54655c66cf89186d3d1fa90829b28ab8"><div class="ttname"><a href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">catalan_numbers::get</a></div><div class="ttdeci">value_type get(std::size_t n)</div><div class="ttdoc">computes the n-th Catalan number and updates the cache.</div><div class="ttdef"><b>Definition</b> catalan_numbers.cpp:39</div></div>
+<div class="ttc" id="aclasscatalan__numbers_html"><div class="ttname"><a href="../../dc/d1f/classcatalan__numbers.html">catalan_numbers</a></div><div class="ttdoc">computes and caches Catalan numbers</div><div class="ttdef"><b>Definition</b> <a href="../../de/dd9/catalan__numbers_8cpp_source.html#l00022">catalan_numbers.cpp:22</a></div></div>
+<div class="ttc" id="aclasscatalan__numbers_html_a54655c66cf89186d3d1fa90829b28ab8"><div class="ttname"><a href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">catalan_numbers::get</a></div><div class="ttdeci">value_type get(std::size_t n)</div><div class="ttdoc">computes the n-th Catalan number and updates the cache.</div><div class="ttdef"><b>Definition</b> <a href="../../de/dd9/catalan__numbers_8cpp_source.html#l00039">catalan_numbers.cpp:39</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -202,6 +227,8 @@ Functions</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html#l00047">47</a> of file <a class="el" href="../../de/dd9/catalan__numbers_8cpp_source.html">catalan_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   47</span>                                     {</div>
 <div class="line"><span class="lineno">   48</span>    <span class="comment">// data verified with https://oeis.org/A000108/</span></div>
 <div class="line"><span class="lineno">   49</span>    <a class="code hl_class" href="../../dc/d1f/classcatalan__numbers.html">catalan_numbers</a> cn;</div>
diff --git a/de/dd9/catalan__numbers_8cpp_source.html b/de/dd9/catalan__numbers_8cpp_source.html
new file mode 100644
index 000000000..e54bcc43d
--- /dev/null
+++ b/de/dd9/catalan__numbers_8cpp_source.html
@@ -0,0 +1,209 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/catalan_numbers.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/dd9/catalan__numbers_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">catalan_numbers.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/dd9/catalan__numbers_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;cassert&gt;</span>     </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cstdint&gt;</span>     </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cstdlib&gt;</span>     </div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;functional&gt;</span>  </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;numeric&gt;</span>     </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;vector&gt;</span>      </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="foldopen" id="foldopen00022" data-start="{" data-end="};">
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"><a class="line" href="../../dc/d1f/classcatalan__numbers.html">   22</a></span><span class="keyword">class </span><a class="code hl_class" href="../../dc/d1f/classcatalan__numbers.html">catalan_numbers</a> {</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    <span class="keyword">using </span>value_type = std::uint64_t;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    std::vector&lt;value_type&gt; known{1, 1};</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    value_type compute_next() {</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        <span class="keywordflow">return</span> std::transform_reduce(known.begin(), known.end(), known.rbegin(),</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>                                     <span class="keyword">static_cast&lt;</span>value_type<span class="keyword">&gt;</span>(0), std::plus&lt;&gt;(),</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>                                     std::multiplies&lt;&gt;());</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    }</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordtype">void</span> add() { known.push_back(this-&gt;compute_next()); }</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00039" data-start="{" data-end="}">
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">   39</a></span>    value_type <a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(std::size_t n) {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        <span class="keywordflow">while</span> (known.size() &lt;= n) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>            this-&gt;add();</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        }</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="keywordflow">return</span> known[n];</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    }</div>
+</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>};</div>
+</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span><span class="keywordtype">void</span> test_catalan_numbers_up_to_20() {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="comment">// data verified with https://oeis.org/A000108/</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <a class="code hl_class" href="../../dc/d1f/classcatalan__numbers.html">catalan_numbers</a> cn;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(0) == 1ULL);</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(1) == 1ULL);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(2) == 2ULL);</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(3) == 5ULL);</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(4) == 14ULL);</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(5) == 42ULL);</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(6) == 132ULL);</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(7) == 429ULL);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(8) == 1430ULL);</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(9) == 4862ULL);</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(10) == 16796ULL);</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(11) == 58786ULL);</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(12) == 208012ULL);</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(13) == 742900ULL);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(14) == 2674440ULL);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(15) == 9694845ULL);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(16) == 35357670ULL);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(17) == 129644790ULL);</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(18) == 477638700ULL);</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(19) == 1767263190ULL);</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(20) == 6564120420ULL);</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>}</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span><span class="keywordtype">void</span> test_catalan_numbers_25() {</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="comment">// data verified with https://oeis.org/A000108/</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <a class="code hl_class" href="../../dc/d1f/classcatalan__numbers.html">catalan_numbers</a> cn;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    assert(cn.<a class="code hl_function" href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">get</a>(25) == 4861946401452ULL);</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>}</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    test_catalan_numbers_up_to_20();</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    test_catalan_numbers_25();</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>}</div>
+<div class="ttc" id="aclasscatalan__numbers_html"><div class="ttname"><a href="../../dc/d1f/classcatalan__numbers.html">catalan_numbers</a></div><div class="ttdoc">computes and caches Catalan numbers</div><div class="ttdef"><b>Definition</b> <a href="#l00022">catalan_numbers.cpp:22</a></div></div>
+<div class="ttc" id="aclasscatalan__numbers_html_a54655c66cf89186d3d1fa90829b28ab8"><div class="ttname"><a href="../../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8">catalan_numbers::get</a></div><div class="ttdeci">value_type get(std::size_t n)</div><div class="ttdoc">computes the n-th Catalan number and updates the cache.</div><div class="ttdef"><b>Definition</b> <a href="#l00039">catalan_numbers.cpp:39</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../de/dd9/catalan__numbers_8cpp.html">catalan_numbers.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/dde/lowest__common__ancestor_8cpp.html b/de/dde/lowest__common__ancestor_8cpp.html
index 5fbbed3a1..bb77497f2 100644
--- a/de/dde/lowest__common__ancestor_8cpp.html
+++ b/de/dde/lowest__common__ancestor_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph/lowest_common_ancestor.cpp File Reference</title>
+<title>TheAlgorithms/C++: graph/lowest_common_ancestor.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -124,7 +141,9 @@ Include dependency graph for lowest_common_ancestor.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d8e/lowest__common__ancestor_8cpp__incl.svg" width="410" height="126"><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">
+</div>
+<p><a href="../../de/dde/lowest__common__ancestor_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td></tr>
@@ -170,6 +189,8 @@ Functions</h2></td></tr>
  lowest_common_ancestor(0, 0) = 0 <br  />
  lowest_common_ancestor(8, 2) = 6</p>
 <p>The query is symmetrical, therefore lowest_common_ancestor(x, y) = lowest_common_ancestor(y, x) </p>
+
+<p class="definition">Definition in file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -186,17 +207,14 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00255">255</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  255</span>           {</div>
 <div class="line"><span class="lineno">  256</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();</div>
 <div class="line"><span class="lineno">  257</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  258</span>}</div>
-<div class="ttc" id="alowest__common__ancestor_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:234</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dde/lowest__common__ancestor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="542" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="alowest__common__ancestor_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00234">lowest_common_ancestor.cpp:234</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -226,17 +244,10 @@ Here is the call graph for this function:</div>
   /     |     \
 1       6       4
 </pre><p> / | / \ \ 7 5 2 8 0 | 9</p>
-<div class="fragment"><div class="line"><span class="lineno">  234</span>                    {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  235</span><span class="comment">    /**</span></div>
-<div class="line"><span class="lineno">  236</span><span class="comment">     *             _  3  _</span></div>
-<div class="line"><span class="lineno">  237</span><span class="comment">     *          /     |     \</span></div>
-<div class="line"><span class="lineno">  238</span><span class="comment">     *        1       6       4</span></div>
-<div class="line"><span class="lineno">  239</span><span class="comment">     *      / |     /   \       \</span></div>
-<div class="line"><span class="lineno">  240</span><span class="comment">     *    7   5   2       8       0</span></div>
-<div class="line"><span class="lineno">  241</span><span class="comment">     *            |</span></div>
-<div class="line"><span class="lineno">  242</span><span class="comment">     *            9</span></div>
-<div class="line"><span class="lineno">  243</span><span class="comment">     */</span></div>
-<div class="line"><span class="lineno">  244</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::pair&lt;int, int&gt;</a> &gt; edges = {</div>
+
+<p class="definition">Definition at line <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00234">234</a> of file <a class="el" href="../../de/dde/lowest__common__ancestor_8cpp_source.html">lowest_common_ancestor.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  234</span>                    {</div>
+<div class="line"><span class="lineno">  244</span>    std::vector&lt;std::pair&lt;int, int&gt; &gt; edges = {</div>
 <div class="line"><span class="lineno">  245</span>        {7, 1}, {1, 5}, {1, 3}, {3, 6}, {6, 2}, {2, 9}, {6, 8}, {4, 3}, {0, 4}};</div>
 <div class="line"><span class="lineno">  246</span>    <a class="code hl_class" href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a> t(edges, 3);</div>
 <div class="line"><span class="lineno">  247</span>    <a class="code hl_class" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a> lca(t);</div>
@@ -245,15 +256,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  250</span>    assert(lca.lowest_common_ancestor(0, 0) == 0);</div>
 <div class="line"><span class="lineno">  251</span>    assert(lca.lowest_common_ancestor(8, 2) == 6);</div>
 <div class="line"><span class="lineno">  252</span>}</div>
-<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a></div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:145</div></div>
-<div class="ttc" id="aclassgraph_1_1_rooted_tree_html"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a></div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:84</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dde/lowest__common__ancestor_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="444" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a></div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00145">lowest_common_ancestor.cpp:145</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_rooted_tree_html"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a></div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00084">lowest_common_ancestor.cpp:84</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/de/dde/lowest__common__ancestor_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/de/dde/lowest__common__ancestor_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index 535878154..000000000
--- a/de/dde/lowest__common__ancestor_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,13,56,38"/>
-<area shape="rect" id="Node000002" href="$d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488" title="Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i..." alt="" coords="104,5,312,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,23,88,23,88,28,56,28"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="360,13,438,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="312,23,344,23,344,28,312,28"/>
-</map>
diff --git a/de/dde/lowest__common__ancestor_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/de/dde/lowest__common__ancestor_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 7d533deea..000000000
--- a/de/dde/lowest__common__ancestor_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-54b78b38bedf9e4d3eb0676d2d943b9a
\ No newline at end of file
diff --git a/de/dde/lowest__common__ancestor_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/de/dde/lowest__common__ancestor_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index 22bad3daf..000000000
--- a/de/dde/lowest__common__ancestor_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="333pt" height="39pt"
- viewBox="0.00 0.00 332.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-24.88 0,-24.88 0,-5.63 37.75,-5.63 37.75,-24.88"/>
-<text text-anchor="middle" x="18.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488" target="_top" xlink:title="Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i...">
-<polygon fill="white" stroke="#666666" points="230,-30.5 73.75,-30.5 73.75,0 230,0 230,-30.5"/>
-<text text-anchor="start" x="81.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
-<text text-anchor="middle" x="151.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::lowest_common_ancestor</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.09,-15.25C44.94,-15.25 53.26,-15.25 62.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.98,-18.75 71.98,-15.25 61.98,-11.75 61.98,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.75,-24.88 266,-24.88 266,-5.63 324.75,-5.63 324.75,-24.88"/>
-<text text-anchor="middle" x="295.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M230.25,-15.25C238.55,-15.25 246.72,-15.25 254.32,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.18,-18.75 264.18,-15.25 254.18,-11.75 254.18,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dde/lowest__common__ancestor_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/de/dde/lowest__common__ancestor_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index 420707dbb..000000000
--- a/de/dde/lowest__common__ancestor_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="333pt" height="39pt"
- viewBox="0.00 0.00 332.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-24.88 0,-24.88 0,-5.63 37.75,-5.63 37.75,-24.88"/>
-<text text-anchor="middle" x="18.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488" target="_top" xlink:title="Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i...">
-<polygon fill="white" stroke="#666666" points="230,-30.5 73.75,-30.5 73.75,0 230,0 230,-30.5"/>
-<text text-anchor="start" x="81.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
-<text text-anchor="middle" x="151.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::lowest_common_ancestor</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.09,-15.25C44.94,-15.25 53.26,-15.25 62.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.98,-18.75 71.98,-15.25 61.98,-11.75 61.98,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.75,-24.88 266,-24.88 266,-5.63 324.75,-5.63 324.75,-24.88"/>
-<text text-anchor="middle" x="295.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M230.25,-15.25C238.55,-15.25 246.72,-15.25 254.32,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="254.18,-18.75 264.18,-15.25 254.18,-11.75 254.18,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dde/lowest__common__ancestor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/dde/lowest__common__ancestor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 96040ef86..000000000
--- a/de/dde/lowest__common__ancestor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,13,55,38"/>
-<area shape="rect" id="Node000002" href="$de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title=" " alt="" coords="103,13,153,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,23,88,23,88,28,55,28"/>
-<area shape="rect" id="Node000003" href="$d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488" title="Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i..." alt="" coords="201,5,409,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,23,186,23,186,28,153,28"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="457,13,536,38"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="410,23,442,23,442,28,410,28"/>
-</map>
diff --git a/de/dde/lowest__common__ancestor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/dde/lowest__common__ancestor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index e33b2fb77..000000000
--- a/de/dde/lowest__common__ancestor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a3ba2d80c6c85467300e0a5179a0f52c
\ No newline at end of file
diff --git a/de/dde/lowest__common__ancestor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/dde/lowest__common__ancestor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 3779f152d..000000000
--- a/de/dde/lowest__common__ancestor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,102 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="406pt" height="39pt"
- viewBox="0.00 0.00 405.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-24.88 0,-24.88 0,-5.63 37,-5.63 37,-24.88"/>
-<text text-anchor="middle" x="18.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-24.88 73,-24.88 73,-5.63 110.75,-5.63 110.75,-24.88"/>
-<text text-anchor="middle" x="91.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-15.25C44.55,-15.25 53.37,-15.25 61.69,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-18.75 71.43,-15.25 61.43,-11.75 61.43,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488" target="_top" xlink:title="Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i...">
-<polygon fill="white" stroke="#666666" points="303,-30.5 146.75,-30.5 146.75,0 303,0 303,-30.5"/>
-<text text-anchor="start" x="154.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
-<text text-anchor="middle" x="224.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::lowest_common_ancestor</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.09,-15.25C117.94,-15.25 126.26,-15.25 135.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.98,-18.75 144.98,-15.25 134.98,-11.75 134.98,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.75,-24.88 339,-24.88 339,-5.63 397.75,-5.63 397.75,-24.88"/>
-<text text-anchor="middle" x="368.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.25,-15.25C311.55,-15.25 319.72,-15.25 327.32,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.18,-18.75 337.18,-15.25 327.18,-11.75 327.18,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/dde/lowest__common__ancestor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/de/dde/lowest__common__ancestor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index da1406309..000000000
--- a/de/dde/lowest__common__ancestor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,76 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="406pt" height="39pt"
- viewBox="0.00 0.00 405.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-24.88 0,-24.88 0,-5.63 37,-5.63 37,-24.88"/>
-<text text-anchor="middle" x="18.5" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-24.88 73,-24.88 73,-5.63 110.75,-5.63 110.75,-24.88"/>
-<text text-anchor="middle" x="91.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-15.25C44.55,-15.25 53.37,-15.25 61.69,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-18.75 71.43,-15.25 61.43,-11.75 61.43,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488" target="_top" xlink:title="Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i...">
-<polygon fill="white" stroke="#666666" points="303,-30.5 146.75,-30.5 146.75,0 303,0 303,-30.5"/>
-<text text-anchor="start" x="154.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
-<text text-anchor="middle" x="224.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::lowest_common_ancestor</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.09,-15.25C117.94,-15.25 126.26,-15.25 135.25,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.98,-18.75 144.98,-15.25 134.98,-11.75 134.98,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.75,-24.88 339,-24.88 339,-5.63 397.75,-5.63 397.75,-24.88"/>
-<text text-anchor="middle" x="368.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.25,-15.25C311.55,-15.25 319.72,-15.25 327.32,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.18,-18.75 337.18,-15.25 327.18,-11.75 327.18,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/dde/lowest__common__ancestor_8cpp_source.html b/de/dde/lowest__common__ancestor_8cpp_source.html
new file mode 100644
index 000000000..c0a2be338
--- /dev/null
+++ b/de/dde/lowest__common__ancestor_8cpp_source.html
@@ -0,0 +1,315 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/lowest_common_ancestor.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/dde/lowest__common__ancestor_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">lowest_common_ancestor.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/dde/lowest__common__ancestor_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="preprocessor">#include &lt;queue&gt;</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &lt;utility&gt;</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> {</div>
+<div class="foldopen" id="foldopen00053" data-start="{" data-end="};">
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../dc/d61/classgraph_1_1_graph.html">   53</a></span><span class="keyword">class </span><a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5">   62</a></span>    <a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5">Graph</a>(<span class="keywordtype">size_t</span> N, <span class="keyword">const</span> std::vector&lt;std::pair&lt;int, int&gt; &gt; &amp;undirected_edges) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <a class="code hl_variable" href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>.resize(N);</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;edge : undirected_edges) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            <a class="code hl_variable" href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>[edge.first].push_back(edge.second);</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            <a class="code hl_variable" href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>[edge.second].push_back(edge.first);</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        }</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    }</div>
+</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span> </div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">   74</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>.size(); }</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">   77</a></span>    std::vector&lt;std::vector&lt;int&gt; &gt; <a class="code hl_variable" href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>};</div>
+</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
+<div class="foldopen" id="foldopen00084" data-start="{" data-end="};">
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"><a class="line" href="../../d0/d58/classgraph_1_1_rooted_tree.html">   84</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> : <span class="keyword">public</span> <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00093" data-start="{" data-end="}">
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"><a class="line" href="../../d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d">   93</a></span>    <a class="code hl_function" href="../../d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d">RootedTree</a>(<span class="keyword">const</span> std::vector&lt;std::pair&lt;int, int&gt; &gt; &amp;undirected_edges,</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>               <span class="keywordtype">int</span> root_)</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>        : <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a>(undirected_edges.size() + 1, undirected_edges), <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>(root_) {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        <a class="code hl_function" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">populate_parents</a>();</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    }</div>
+</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span> </div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"><a class="line" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">  104</a></span>    std::vector&lt;int&gt; <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">parent</a>;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"><a class="line" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">  106</a></span>    std::vector&lt;int&gt; <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"><a class="line" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">  108</a></span>    <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span> </div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span> <span class="keyword">protected</span>:</div>
+<div class="foldopen" id="foldopen00117" data-start="{" data-end="}">
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"><a class="line" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">  117</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">populate_parents</a>() {</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        <span class="comment">// Initialize the vector with -1 which indicates the vertex</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>        <span class="comment">// wasn&#39;t yet visited.</span></div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">parent</a> = std::vector&lt;int&gt;(<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>(), -1);</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a> = std::vector&lt;int&gt;(<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>());</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">parent</a>[<a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>] = <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>        <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[<a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>] = 0;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>        std::queue&lt;int&gt; queue_of_vertices;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        queue_of_vertices.push(<a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">root</a>);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        <span class="keywordflow">while</span> (!queue_of_vertices.empty()) {</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>            <span class="keywordtype">int</span> vertex = queue_of_vertices.front();</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>            queue_of_vertices.pop();</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> neighbor : <a class="code hl_variable" href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a>[vertex]) {</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>                <span class="comment">// As long as the vertex was not yet visited.</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>                <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">parent</a>[neighbor] == -1) {</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>                    <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">parent</a>[neighbor] = vertex;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>                    <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[neighbor] = <a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[vertex] + 1;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>                    queue_of_vertices.push(neighbor);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>                }</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>            }</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        }</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    }</div>
+</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>};</div>
+</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span> </div>
+<div class="foldopen" id="foldopen00145" data-start="{" data-end="};">
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"><a class="line" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">  145</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">LowestCommonAncestor</a> {</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00151" data-start="{" data-end="}">
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"><a class="line" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93">  151</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93">LowestCommonAncestor</a>(<span class="keyword">const</span> <a class="code hl_class" href="../../d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> &amp;tree_) : tree(tree_) {</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>        <a class="code hl_function" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356">populate_up</a>();</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    }</div>
+</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span> </div>
+<div class="foldopen" id="foldopen00164" data-start="{" data-end="}">
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"><a class="line" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488">  164</a></span>    <span class="keywordtype">int</span> <a class="code hl_function" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488">lowest_common_ancestor</a>(<span class="keywordtype">int</span> u, <span class="keywordtype">int</span> v)<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>        <span class="comment">// Ensure u is the deeper (higher level) of the two vertices</span></div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        <span class="keywordflow">if</span> (tree.<a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[v] &gt; tree.<a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[u]) {</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>            std::swap(u, v);</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>        }</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span> </div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>        <span class="comment">// &quot;Lift&quot; u to the same level as v.</span></div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>        <span class="keywordtype">int</span> level_diff = tree.<a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[u] - tree.<a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[v];</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; (1 &lt;&lt; i) &lt;= level_diff; ++i) {</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>            <span class="keywordflow">if</span> (level_diff &amp; (1 &lt;&lt; i)) {</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>                u = <a class="code hl_variable" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[u][i];</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>            }</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>        }</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        assert(tree.<a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[u] == tree.<a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a>[v]);</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span> </div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        <span class="keywordflow">if</span> (u == v) {</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>            <span class="keywordflow">return</span> u;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>        }</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span> </div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>        <span class="comment">// &quot;Lift&quot; u and v to their 2^i th ancestor if they are different</span></div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(<a class="code hl_variable" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[u].size()) - 1; i &gt;= 0; --i) {</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>            <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[u][i] != <a class="code hl_variable" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[v][i]) {</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>                u = <a class="code hl_variable" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[u][i];</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>                v = <a class="code hl_variable" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[v][i];</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>            }</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        }</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span> </div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>        <span class="comment">// As we regressed u an v such that they cannot further be lifted so</span></div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>        <span class="comment">// that their ancestor would be different, the only logical</span></div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        <span class="comment">// consequence is that their parent is the sought answer.</span></div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>        assert(<a class="code hl_variable" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[u][0] == <a class="code hl_variable" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[v][0]);</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[u][0];</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    }</div>
+</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span> </div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    <span class="comment">/* \brief reference to the rooted tree this structure allows to query */</span></div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    <span class="keyword">const</span> <a class="code hl_class" href="../../d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> &amp;tree;</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"><a class="line" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">  206</a></span>    std::vector&lt;std::vector&lt;int&gt; &gt; <a class="code hl_variable" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>;</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span> </div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span> <span class="keyword">protected</span>:</div>
+<div class="foldopen" id="foldopen00212" data-start="{" data-end="}">
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"><a class="line" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356">  212</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356">populate_up</a>() {</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>        <a class="code hl_variable" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>.resize(tree.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>());</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vertex = 0; vertex &lt; tree.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>(); ++vertex) {</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>            <a class="code hl_variable" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[vertex].push_back(tree.<a class="code hl_variable" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">parent</a>[vertex]);</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>        }</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> level = 0; (1 &lt;&lt; level) &lt; tree.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>(); ++level) {</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> vertex = 0; vertex &lt; tree.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>(); ++vertex) {</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>                <span class="comment">// up[vertex][level + 1] = 2^(level + 1) th ancestor of vertex =</span></div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>                <span class="comment">// = 2^level th ancestor of 2^level th ancestor of vertex =</span></div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>                <span class="comment">// = 2^level th ancestor of up[vertex][level]</span></div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>                <a class="code hl_variable" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[vertex].push_back(<a class="code hl_variable" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[<a class="code hl_variable" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">up</a>[vertex][level]][level]);</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>            }</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span>        }</div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span>    }</div>
+</div>
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno">  226</span>};</div>
+</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span> </div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>}  <span class="comment">// namespace graph</span></div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span> </div>
+<div class="foldopen" id="foldopen00234" data-start="{" data-end="}">
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"><a class="line" href="../../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">  234</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    std::vector&lt;std::pair&lt;int, int&gt; &gt; edges = {</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>        {7, 1}, {1, 5}, {1, 3}, {3, 6}, {6, 2}, {2, 9}, {6, 8}, {4, 3}, {0, 4}};</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    <a class="code hl_class" href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a> t(edges, 3);</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    <a class="code hl_class" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a> lca(t);</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>    assert(lca.<a class="code hl_function" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488">lowest_common_ancestor</a>(7, 4) == 3);</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    assert(lca.<a class="code hl_function" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488">lowest_common_ancestor</a>(9, 6) == 6);</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    assert(lca.<a class="code hl_function" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488">lowest_common_ancestor</a>(0, 0) == 0);</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    assert(lca.<a class="code hl_function" href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488">lowest_common_ancestor</a>(8, 2) == 6);</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>}</div>
+</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span> </div>
+<div class="foldopen" id="foldopen00255" data-start="{" data-end="}">
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"><a class="line" href="../../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  255</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    <a class="code hl_function" href="../../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>}</div>
+</div>
+<div class="ttc" id="aclassgraph_1_1_graph_html"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></div><div class="ttdef"><b>Definition</b> <a href="#l00053">lowest_common_ancestor.cpp:53</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_graph_html_a59940c462861f2fcf4951d1b6c084e6a"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">graph::Graph::neighbors</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; neighbors</div><div class="ttdoc">for each vertex it stores a list indicies of its neighbors</div><div class="ttdef"><b>Definition</b> <a href="#l00077">lowest_common_ancestor.cpp:77</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_graph_html_a8839fa14bff19d2deab4a618447c13e5"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5">graph::Graph::Graph</a></div><div class="ttdeci">Graph(size_t N, const std::vector&lt; std::pair&lt; int, int &gt; &gt; &amp;undirected_edges)</div><div class="ttdoc">Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid v...</div><div class="ttdef"><b>Definition</b> <a href="#l00062">lowest_common_ancestor.cpp:62</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_graph_html_a8930d1470d132b19e430d1c71f94c904"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">graph::Graph::number_of_vertices</a></div><div class="ttdeci">int number_of_vertices() const</div><div class="ttdef"><b>Definition</b> <a href="#l00074">lowest_common_ancestor.cpp:74</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a></div><div class="ttdef"><b>Definition</b> <a href="#l00145">lowest_common_ancestor.cpp:145</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a42589cc39d6bbff6c997152f1b96e356"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356">graph::LowestCommonAncestor::populate_up</a></div><div class="ttdeci">void populate_up()</div><div class="ttdef"><b>Definition</b> <a href="#l00212">lowest_common_ancestor.cpp:212</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a46d10f669791e3da9a4809bd8ff8d3ad"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">graph::LowestCommonAncestor::up</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; up</div><div class="ttdoc">for every vertex stores a list of its ancestors by powers of two For each vertex, the first element o...</div><div class="ttdef"><b>Definition</b> <a href="#l00206">lowest_common_ancestor.cpp:206</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a60151e19512b48cc0b14ea121df00488"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488">graph::LowestCommonAncestor::lowest_common_ancestor</a></div><div class="ttdeci">int lowest_common_ancestor(int u, int v) const</div><div class="ttdoc">Query the structure to find the lowest common ancestor. Assumes that the provided numbers are valid i...</div><div class="ttdef"><b>Definition</b> <a href="#l00164">lowest_common_ancestor.cpp:164</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a80825a4fd4c41860b689d253dd2c8e93"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93">graph::LowestCommonAncestor::LowestCommonAncestor</a></div><div class="ttdeci">LowestCommonAncestor(const RootedTree &amp;tree_)</div><div class="ttdoc">Stores the tree and precomputs &quot;up lifts&quot;.</div><div class="ttdef"><b>Definition</b> <a href="#l00151">lowest_common_ancestor.cpp:151</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_rooted_tree_html"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a></div><div class="ttdef"><b>Definition</b> <a href="#l00084">lowest_common_ancestor.cpp:84</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a2ee3ad1161ac2532da30c3e22c265ad3"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">graph::RootedTree::level</a></div><div class="ttdeci">std::vector&lt; int &gt; level</div><div class="ttdoc">Stores the distance from the root.</div><div class="ttdef"><b>Definition</b> <a href="#l00106">lowest_common_ancestor.cpp:106</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_a3831583a91914988897a4cc8748fda43"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">graph::RootedTree::parent</a></div><div class="ttdeci">std::vector&lt; int &gt; parent</div><div class="ttdoc">Stores parent of every vertex and for root its own index. The root is technically not its own parent,...</div><div class="ttdef"><b>Definition</b> <a href="#l00104">lowest_common_ancestor.cpp:104</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_aacdeecac857623e9fbfe92590f3c504d"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d">graph::RootedTree::RootedTree</a></div><div class="ttdeci">RootedTree(const std::vector&lt; std::pair&lt; int, int &gt; &gt; &amp;undirected_edges, int root_)</div><div class="ttdoc">Constructs the tree by calculating parent for every vertex. Assumes a valid description of a tree is ...</div><div class="ttdef"><b>Definition</b> <a href="#l00093">lowest_common_ancestor.cpp:93</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_ab22a97bf6209a085fc2d788c3c0dacbe"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">graph::RootedTree::root</a></div><div class="ttdeci">int root</div><div class="ttdoc">Index of the root vertex.</div><div class="ttdef"><b>Definition</b> <a href="#l00108">lowest_common_ancestor.cpp:108</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_ae6928f3ebd491541e9570e746b877c1e"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">graph::RootedTree::populate_parents</a></div><div class="ttdeci">void populate_parents()</div><div class="ttdoc">Calculate the parents for all the vertices in the tree. Implements the breadth first search algorithm...</div><div class="ttdef"><b>Definition</b> <a href="#l00117">lowest_common_ancestor.cpp:117</a></div></div>
+<div class="ttc" id="alowest__common__ancestor_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition</b> <a href="#l00234">lowest_common_ancestor.cpp:234</a></div></div>
+<div class="ttc" id="alowest__common__ancestor_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00255">lowest_common_ancestor.cpp:255</a></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><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a class="el" href="../../de/dde/lowest__common__ancestor_8cpp.html">lowest_common_ancestor.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/de4/fibonacci__large_8cpp.html b/de/de4/fibonacci__large_8cpp.html
index 9510bebb7..59c49dd5f 100644
--- a/de/de4/fibonacci__large_8cpp.html
+++ b/de/de4/fibonacci__large_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/fibonacci_large.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/fibonacci_large.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for fibonacci_large.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/de0/fibonacci__large_8cpp__incl.svg" width="640" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 </div>
-</div><table class="memberdecls">
+</div>
+<p><a href="../../de/de4/fibonacci__large_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:adf3e906875ab257f7fab3bc1370aa2db" id="r_adf3e906875ab257f7fab3bc1370aa2db"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d82/classlarge__number.html">large_number</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adf3e906875ab257f7fab3bc1370aa2db">fib</a> (uint64_t n)</td></tr>
@@ -134,6 +153,8 @@ Functions</h2></td></tr>
 <p>Took 0.608246 seconds to compute 50,000^th Fibonacci number that contains 10450 digits!</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/kvedala" target="_blank">Krishna Vedala</a> </dd></dl>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d9/d89/fibonacci_8cpp.html" title="n-th Fibonacci number.">fibonacci.cpp</a>, <a class="el" href="../../d4/d32/fibonacci__fast_8cpp.html" title="Faster computation of Fibonacci series.">fibonacci_fast.cpp</a>, <a class="el" href="../../de/d47/string__fibonacci_8cpp.html" title="This Programme returns the Nth fibonacci as a string.">string_fibonacci.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../de/de4/fibonacci__large_8cpp_source.html">fibonacci_large.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="adf3e906875ab257f7fab3bc1370aa2db" name="adf3e906875ab257f7fab3bc1370aa2db"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#adf3e906875ab257f7fab3bc1370aa2db">&#9670;&#160;</a></span>fib()</h2>
@@ -153,6 +174,8 @@ Functions</h2></td></tr>
 \[f(n)=f(n-1)+f(n-2)\]
 </p>
 <p> and returns the result as a <a class="el" href="../../db/d82/classlarge__number.html">large_number</a> type. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../de/de4/fibonacci__large_8cpp_source.html#l00024">24</a> of file <a class="el" href="../../de/de4/fibonacci__large_8cpp_source.html">fibonacci_large.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   24</span>                             {</div>
 <div class="line"><span class="lineno">   25</span>    <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> f0(1);</div>
 <div class="line"><span class="lineno">   26</span>    <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> f1(1);</div>
@@ -166,7 +189,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   34</span> </div>
 <div class="line"><span class="lineno">   35</span>    <span class="keywordflow">return</span> f1;</div>
 <div class="line"><span class="lineno">   36</span>}</div>
-<div class="ttc" id="aclasslarge__number_html"><div class="ttname"><a href="../../db/d82/classlarge__number.html">large_number</a></div><div class="ttdef"><b>Definition</b> large_number.h:24</div></div>
+<div class="ttc" id="aclasslarge__number_html"><div class="ttname"><a href="../../db/d82/classlarge__number.html">large_number</a></div><div class="ttdef"><b>Definition</b> <a href="../../d4/d86/large__number_8h_source.html#l00024">large_number.h:24</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -188,26 +211,28 @@ Functions</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../de/de4/fibonacci__large_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../de/de4/fibonacci__large_8cpp_source.html">fibonacci_large.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   38</span>                                 {</div>
 <div class="line"><span class="lineno">   39</span>    uint64_t <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>;</div>
 <div class="line"><span class="lineno">   40</span>    <span class="keywordflow">if</span> (argc == 2) {</div>
-<div class="line"><span class="lineno">   41</span>        <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strtoul.html">strtoull</a>(argv[1], NULL, 10);</div>
+<div class="line"><span class="lineno">   41</span>        <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = strtoull(argv[1], NULL, 10);</div>
 <div class="line"><span class="lineno">   42</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">   43</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter N: &quot;</span>;</div>
-<div class="line"><span class="lineno">   44</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>;</div>
+<div class="line"><span class="lineno">   43</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter N: &quot;</span>;</div>
+<div class="line"><span class="lineno">   44</span>        std::cin &gt;&gt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>;</div>
 <div class="line"><span class="lineno">   45</span>    }</div>
 <div class="line"><span class="lineno">   46</span> </div>
-<div class="line"><span class="lineno">   47</span>    clock_t start_time = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">   47</span>    clock_t start_time = std::clock();</div>
 <div class="line"><span class="lineno">   48</span>    <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="#adf3e906875ab257f7fab3bc1370aa2db">fib</a>(N);</div>
-<div class="line"><span class="lineno">   49</span>    clock_t end_time = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a>();</div>
+<div class="line"><span class="lineno">   49</span>    clock_t end_time = std::clock();</div>
 <div class="line"><span class="lineno">   50</span>    <span class="keywordtype">double</span> time_taken = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end_time - start_time) /</div>
 <div class="line"><span class="lineno">   51</span>                        <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(CLOCKS_PER_SEC);</div>
 <div class="line"><span class="lineno">   52</span> </div>
-<div class="line"><span class="lineno">   53</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   54</span>              &lt;&lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;^th Fibonacci number: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> &lt;&lt; <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">   55</span>              &lt;&lt; <span class="stringliteral">&quot;Number of digits: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.num_digits() &lt;&lt; <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">   56</span>              &lt;&lt; <span class="stringliteral">&quot;Time taken: &quot;</span> &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/fixed.html">std::scientific</a> &lt;&lt; time_taken &lt;&lt; <span class="stringliteral">&quot; s&quot;</span></div>
-<div class="line"><span class="lineno">   57</span>              &lt;&lt; <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">   53</span>    std::cout &lt;&lt; std::endl</div>
+<div class="line"><span class="lineno">   54</span>              &lt;&lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;^th Fibonacci number: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> &lt;&lt; std::endl</div>
+<div class="line"><span class="lineno">   55</span>              &lt;&lt; <span class="stringliteral">&quot;Number of digits: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.num_digits() &lt;&lt; std::endl</div>
+<div class="line"><span class="lineno">   56</span>              &lt;&lt; <span class="stringliteral">&quot;Time taken: &quot;</span> &lt;&lt; std::scientific &lt;&lt; time_taken &lt;&lt; <span class="stringliteral">&quot; s&quot;</span></div>
+<div class="line"><span class="lineno">   57</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   58</span> </div>
 <div class="line"><span class="lineno">   59</span>    <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 5000;</div>
 <div class="line"><span class="lineno">   60</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="#adf3e906875ab257f7fab3bc1370aa2db">fib</a>(N) ==</div>
@@ -228,23 +253,17 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">   75</span>            <span class="stringliteral">&quot;508206686289742063932343848846524098874239587380197699382031717420&quot;</span></div>
 <div class="line"><span class="lineno">   76</span>            <span class="stringliteral">&quot;893226546887936400263079778005875912967138963421425257911687275560&quot;</span></div>
 <div class="line"><span class="lineno">   77</span>            <span class="stringliteral">&quot;0360311370547754724604639987588046985178408674382863125&quot;</span>))</div>
-<div class="line"><span class="lineno">   78</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test for &quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;^th Fibonacci number passed!&quot;</span></div>
-<div class="line"><span class="lineno">   79</span>                  &lt;&lt; <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">   78</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Test for &quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;^th Fibonacci number passed!&quot;</span></div>
+<div class="line"><span class="lineno">   79</span>                  &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   80</span>    <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">   81</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; <span class="stringliteral">&quot;Test for &quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;^th Fibonacci number failed!&quot;</span></div>
-<div class="line"><span class="lineno">   82</span>                  &lt;&lt; <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">   81</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Test for &quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;^th Fibonacci number failed!&quot;</span></div>
+<div class="line"><span class="lineno">   82</span>                  &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   83</span> </div>
 <div class="line"><span class="lineno">   84</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   85</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="aclock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a></div><div class="ttdeci">T clock(T... args)</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="afibonacci__large_8cpp_html_adf3e906875ab257f7fab3bc1370aa2db"><div class="ttname"><a href="#adf3e906875ab257f7fab3bc1370aa2db">fib</a></div><div class="ttdeci">large_number fib(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_large.cpp:24</div></div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-<div class="ttc" id="afixed_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/fixed.html">std::scientific</a></div><div class="ttdeci">T scientific(T... args)</div></div>
-<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
-<div class="ttc" id="astrtoul_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strtoul.html">std::strtoull</a></div><div class="ttdeci">T strtoull(T... args)</div></div>
+<div class="ttc" id="afibonacci__large_8cpp_html_adf3e906875ab257f7fab3bc1370aa2db"><div class="ttname"><a href="#adf3e906875ab257f7fab3bc1370aa2db">fib</a></div><div class="ttdeci">large_number fib(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/de4/fibonacci__large_8cpp_source.html#l00024">fibonacci_large.cpp:24</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
diff --git a/de/de4/fibonacci__large_8cpp_source.html b/de/de4/fibonacci__large_8cpp_source.html
new file mode 100644
index 000000000..6f52d5735
--- /dev/null
+++ b/de/de4/fibonacci__large_8cpp_source.html
@@ -0,0 +1,214 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/fibonacci_large.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('de/de4/fibonacci__large_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">fibonacci_large.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../de/de4/fibonacci__large_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cinttypes&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;ctime&gt;</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span> </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &quot;<a class="code" href="../../d4/d86/large__number_8h.html">./large_number.h</a>&quot;</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span> </div>
+<div class="foldopen" id="foldopen00024" data-start="{" data-end="}">
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"><a class="line" href="../../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db">   24</a></span><a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> <a class="code hl_function" href="../../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db">fib</a>(uint64_t n) {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> f0(1);</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> f1(1);</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>        <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> f2 = f1;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        f1 += f0;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        f0 = f2;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        n--;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    } <span class="keywordflow">while</span> (n &gt; 2);  <span class="comment">// since we start from 2</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordflow">return</span> f1;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>}</div>
+</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[]) {</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    uint64_t <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">if</span> (argc == 2) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = strtoull(argv[1], NULL, 10);</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Enter N: &quot;</span>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        std::cin &gt;&gt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    }</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    clock_t start_time = std::clock();</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="../../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db">fib</a>(N);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    clock_t end_time = std::clock();</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>    <span class="keywordtype">double</span> time_taken = <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(end_time - start_time) /</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>                        <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(CLOCKS_PER_SEC);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    std::cout &lt;&lt; std::endl</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>              &lt;&lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;^th Fibonacci number: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> &lt;&lt; std::endl</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>              &lt;&lt; <span class="stringliteral">&quot;Number of digits: &quot;</span> &lt;&lt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.num_digits() &lt;&lt; std::endl</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>              &lt;&lt; <span class="stringliteral">&quot;Time taken: &quot;</span> &lt;&lt; std::scientific &lt;&lt; time_taken &lt;&lt; <span class="stringliteral">&quot; s&quot;</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = 5000;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">if</span> (<a class="code hl_function" href="../../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db">fib</a>(N) ==</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        <a class="code hl_class" href="../../db/d82/classlarge__number.html">large_number</a>(</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>            <span class="stringliteral">&quot;387896845438832563370191630832590531208212771464624510616059721489&quot;</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>            <span class="stringliteral">&quot;555013904403709701082291646221066947929345285888297381348310200895&quot;</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            <span class="stringliteral">&quot;498294036143015691147893836421656394410691021450563413370655865623&quot;</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            <span class="stringliteral">&quot;825465670071252592990385493381392883637834751890876297071203333705&quot;</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>            <span class="stringliteral">&quot;292310769300851809384980180384781399674888176555465378829164426891&quot;</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>            <span class="stringliteral">&quot;298038461377896902150229308247566634622492307188332480328037503913&quot;</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            <span class="stringliteral">&quot;035290330450584270114763524227021093463769910400671417488329842289&quot;</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            <span class="stringliteral">&quot;149127310405432875329804427367682297724498774987455569190770388063&quot;</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            <span class="stringliteral">&quot;704683279481135897373999311010621930814901857081539785437919530561&quot;</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>            <span class="stringliteral">&quot;751076105307568878376603366735544525884488624161921055345749367589&quot;</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            <span class="stringliteral">&quot;784902798823435102359984466393485325641195222185956306047536464547&quot;</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            <span class="stringliteral">&quot;076033090242080638258492915645287629157575914234380914230291749108&quot;</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            <span class="stringliteral">&quot;898415520985443248659407979357131684169286803954530954538869811466&quot;</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            <span class="stringliteral">&quot;508206686289742063932343848846524098874239587380197699382031717420&quot;</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>            <span class="stringliteral">&quot;893226546887936400263079778005875912967138963421425257911687275560&quot;</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>            <span class="stringliteral">&quot;0360311370547754724604639987588046985178408674382863125&quot;</span>))</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Test for &quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;^th Fibonacci number passed!&quot;</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>                  &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        std::cerr &lt;&lt; <span class="stringliteral">&quot;Test for &quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;^th Fibonacci number failed!&quot;</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>                  &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>}</div>
+<div class="ttc" id="aclasslarge__number_html"><div class="ttname"><a href="../../db/d82/classlarge__number.html">large_number</a></div><div class="ttdef"><b>Definition</b> <a href="../../d4/d86/large__number_8h_source.html#l00024">large_number.h:24</a></div></div>
+<div class="ttc" id="afibonacci__large_8cpp_html_adf3e906875ab257f7fab3bc1370aa2db"><div class="ttname"><a href="../../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db">fib</a></div><div class="ttdeci">large_number fib(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="#l00024">fibonacci_large.cpp:24</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="alarge__number_8h_html"><div class="ttname"><a href="../../d4/d86/large__number_8h.html">large_number.h</a></div><div class="ttdoc">Library to perform arithmatic operations on arbitrarily large numbers.</div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../de/de4/fibonacci__large_8cpp.html">fibonacci_large.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/de/df6/classgreedy__algorithms_1_1_binary_addition.html b/de/df6/classgreedy__algorithms_1_1_binary_addition.html
index fb9424292..4b1eaf1e0 100644
--- a/de/df6/classgreedy__algorithms_1_1_binary_addition.html
+++ b/de/df6/classgreedy__algorithms_1_1_binary_addition.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: greedy_algorithms::BinaryAddition Class Reference</title>
+<title>TheAlgorithms/C++: greedy_algorithms::BinaryAddition Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -117,18 +134,20 @@ $(function(){initNavTree('de/df6/classgreedy__algorithms_1_1_binary_addition.htm
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:a801fd1ec5cda76b0bb82cbf23ed4d527" id="r_a801fd1ec5cda76b0bb82cbf23ed4d527"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;a, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;b)</td></tr>
+<tr class="memitem:a801fd1ec5cda76b0bb82cbf23ed4d527" id="r_a801fd1ec5cda76b0bb82cbf23ed4d527"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a> (const std::string &amp;a, const std::string &amp;b)</td></tr>
 <tr class="memdesc:a801fd1ec5cda76b0bb82cbf23ed4d527"><td class="mdescLeft">&#160;</td><td class="mdescRight">Adds two binary strings and returns the result as a binary string.  <br /></td></tr>
 <tr class="separator:a801fd1ec5cda76b0bb82cbf23ed4d527"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
 Private Member Functions</h2></td></tr>
-<tr class="memitem:a4cfb595ba80795a9efae0e3f6f5c34d2" id="r_a4cfb595ba80795a9efae0e3f6f5c34d2"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4cfb595ba80795a9efae0e3f6f5c34d2">isValidBinaryString</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str) const</td></tr>
+<tr class="memitem:a4cfb595ba80795a9efae0e3f6f5c34d2" id="r_a4cfb595ba80795a9efae0e3f6f5c34d2"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4cfb595ba80795a9efae0e3f6f5c34d2">isValidBinaryString</a> (const std::string &amp;str) const</td></tr>
 <tr class="memdesc:a4cfb595ba80795a9efae0e3f6f5c34d2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Validates whether a string contains only binary characters (0 or 1).  <br /></td></tr>
 <tr class="separator:a4cfb595ba80795a9efae0e3f6f5c34d2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A class to perform binary addition of two binary strings. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d1f/binary__addition_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../d9/d1f/binary__addition_8cpp_source.html">binary_addition.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="a801fd1ec5cda76b0bb82cbf23ed4d527" name="a801fd1ec5cda76b0bb82cbf23ed4d527"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a801fd1ec5cda76b0bb82cbf23ed4d527">&#9670;&#160;</a></span>addBinary()</h2>
@@ -140,14 +159,14 @@ Private Member Functions</h2></td></tr>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> greedy_algorithms::BinaryAddition::addBinary </td>
+          <td class="memname">std::string greedy_algorithms::BinaryAddition::addBinary </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>b</em></span>&#160;)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>b</em></span>&#160;)</td>
         </tr>
       </table>
   </td>
@@ -166,21 +185,23 @@ Private Member Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>The sum of the two binary strings as a binary string, or an empty string if either input string contains non-binary characters. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d1f/binary__addition_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../d9/d1f/binary__addition_8cpp_source.html">binary_addition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   40</span>                                                                {</div>
 <div class="line"><span class="lineno">   41</span>        <span class="keywordflow">if</span> (!<a class="code hl_function" href="#a4cfb595ba80795a9efae0e3f6f5c34d2">isValidBinaryString</a>(a) || !<a class="code hl_function" href="#a4cfb595ba80795a9efae0e3f6f5c34d2">isValidBinaryString</a>(b)) {</div>
 <div class="line"><span class="lineno">   42</span>            <span class="keywordflow">return</span> <span class="stringliteral">&quot;&quot;</span>;  <span class="comment">// Return empty string if input contains non-binary</span></div>
 <div class="line"><span class="lineno">   43</span>                        <span class="comment">// characters</span></div>
 <div class="line"><span class="lineno">   44</span>        }</div>
 <div class="line"><span class="lineno">   45</span> </div>
-<div class="line"><span class="lineno">   46</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
+<div class="line"><span class="lineno">   46</span>        std::string <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   47</span>        <span class="keywordtype">int</span> carry = 0;</div>
-<div class="line"><span class="lineno">   48</span>        <span class="keywordtype">int</span> maxLength = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(a.size(), b.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>());</div>
+<div class="line"><span class="lineno">   48</span>        <span class="keywordtype">int</span> maxLength = std::max(a.size(), b.size());</div>
 <div class="line"><span class="lineno">   49</span> </div>
 <div class="line"><span class="lineno">   50</span>        <span class="comment">// Traverse both strings from the end to the beginning</span></div>
 <div class="line"><span class="lineno">   51</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; maxLength; ++i) {</div>
 <div class="line"><span class="lineno">   52</span>            <span class="comment">// Get the current bits from both strings, if available</span></div>
 <div class="line"><span class="lineno">   53</span>            <span class="keywordtype">int</span> bitA = (i &lt; a.size()) ? (a[a.size() - 1 - i] - <span class="charliteral">&#39;0&#39;</span>) : 0;</div>
-<div class="line"><span class="lineno">   54</span>            <span class="keywordtype">int</span> bitB = (i &lt; b.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) ? (b[b.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1 - i] - <span class="charliteral">&#39;0&#39;</span>) : 0;</div>
+<div class="line"><span class="lineno">   54</span>            <span class="keywordtype">int</span> bitB = (i &lt; b.size()) ? (b[b.size() - 1 - i] - <span class="charliteral">&#39;0&#39;</span>) : 0;</div>
 <div class="line"><span class="lineno">   55</span> </div>
 <div class="line"><span class="lineno">   56</span>            <span class="comment">// Calculate the sum of bits and carry</span></div>
 <div class="line"><span class="lineno">   57</span>            <span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> = bitA + bitB + carry;</div>
@@ -191,22 +212,13 @@ Private Member Functions</h2></td></tr>
 <div class="line"><span class="lineno">   62</span>        <span class="keywordflow">if</span> (carry) {</div>
 <div class="line"><span class="lineno">   63</span>            <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(<span class="charliteral">&#39;1&#39;</span>);</div>
 <div class="line"><span class="lineno">   64</span>        }</div>
-<div class="line"><span class="lineno">   65</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a>(<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.begin(), <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.end());</div>
+<div class="line"><span class="lineno">   65</span>        std::reverse(<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.begin(), <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.end());</div>
 <div class="line"><span class="lineno">   66</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   67</span>    }</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="aclassgreedy__algorithms_1_1_binary_addition_html_a4cfb595ba80795a9efae0e3f6f5c34d2"><div class="ttname"><a href="#a4cfb595ba80795a9efae0e3f6f5c34d2">greedy_algorithms::BinaryAddition::isValidBinaryString</a></div><div class="ttdeci">bool isValidBinaryString(const std::string &amp;str) const</div><div class="ttdoc">Validates whether a string contains only binary characters (0 or 1).</div><div class="ttdef"><b>Definition</b> binary_addition.cpp:75</div></div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:232</div></div>
-<div class="ttc" id="areverse_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a></div><div class="ttdeci">T reverse(T... args)</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph.svg" width="586" height="250"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassgreedy__algorithms_1_1_binary_addition_html_a4cfb595ba80795a9efae0e3f6f5c34d2"><div class="ttname"><a href="#a4cfb595ba80795a9efae0e3f6f5c34d2">greedy_algorithms::BinaryAddition::isValidBinaryString</a></div><div class="ttdeci">bool isValidBinaryString(const std::string &amp;str) const</div><div class="ttdoc">Validates whether a string contains only binary characters (0 or 1).</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d1f/binary__addition_8cpp_source.html#l00075">binary_addition.cpp:75</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00232">vector_ops.hpp:232</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4cfb595ba80795a9efae0e3f6f5c34d2" name="a4cfb595ba80795a9efae0e3f6f5c34d2"></a>
@@ -221,7 +233,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool greedy_algorithms::BinaryAddition::isValidBinaryString </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span></td><td>)</td>
+          <td class="paramtype">const std::string &amp;</td>          <td class="paramname"><span class="paramname"><em>str</em></span></td><td>)</td>
           <td> const</td>
         </tr>
       </table>
@@ -240,23 +252,17 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>true if the string is binary, false otherwise. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d1f/binary__addition_8cpp_source.html#l00075">75</a> of file <a class="el" href="../../d9/d1f/binary__addition_8cpp_source.html">binary_addition.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   75</span>                                                         {</div>
-<div class="line"><span class="lineno">   76</span>        <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html">std::all_of</a>(str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">begin</a>(), str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">end</a>(),</div>
+<div class="line"><span class="lineno">   76</span>        <span class="keywordflow">return</span> std::all_of(str.begin(), str.end(),</div>
 <div class="line"><span class="lineno">   77</span>                           [](<span class="keywordtype">char</span> c) { return c == <span class="stringliteral">&#39;0&#39;</span> || c == <span class="stringliteral">&#39;1&#39;</span>; });</div>
 <div class="line"><span class="lineno">   78</span>    }</div>
-<div class="ttc" id="aall_any_none_of_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html">std::all_of</a></div><div class="ttdeci">T all_of(T... args)</div></div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">std::string::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">std::string::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph.svg" width="366" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>greedy_algorithms/<a class="el" href="../../d9/d1f/binary__addition_8cpp.html">binary_addition.cpp</a></li>
+<li>greedy_algorithms/<a class="el" href="../../d9/d1f/binary__addition_8cpp_source.html">binary_addition.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph.map b/de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph.map
deleted file mode 100644
index c02bab8a6..000000000
--- a/de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="greedy_algorithms::BinaryAddition::isValidBinaryString" name="greedy_algorithms::BinaryAddition::isValidBinaryString">
-<area shape="rect" id="Node000001" title="Validates whether a string contains only binary characters (0 or 1)." alt="" coords="5,40,194,95"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/all_any_none_of.html#" title=" " alt="" coords="262,5,340,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="193,42,246,29,247,34,194,47"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/begin.html#" title=" " alt="" coords="242,55,360,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="194,65,226,65,226,70,194,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/end.html#" title=" " alt="" coords="247,104,355,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="194,88,232,97,231,102,193,93"/>
-</map>
diff --git a/de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph.md5 b/de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph.md5
deleted file mode 100644
index 7634a8cfd..000000000
--- a/de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b34b8fba06083b003abe8695e93bcb7a
\ No newline at end of file
diff --git a/de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph.svg b/de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph.svg
deleted file mode 100644
index ea91e20fe..000000000
--- a/de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: greedy_algorithms::BinaryAddition::isValidBinaryString Pages: 1 -->
-<svg width="274pt" height="101pt"
- viewBox="0.00 0.00 274.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>greedy_algorithms::BinaryAddition::isValidBinaryString</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Validates whether a string contains only binary characters (0 or 1).">
-<polygon fill="#999999" stroke="#666666" points="141.25,-67.5 0,-67.5 0,-25.75 141.25,-25.75 141.25,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
-<text text-anchor="middle" x="70.62" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251,-93.25 192.25,-93.25 192.25,-74 251,-74 251,-93.25"/>
-<text text-anchor="middle" x="221.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.33,-63.93C154.87,-67.3 168.63,-70.71 180.8,-73.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.9,-77.12 190.45,-76.13 181.59,-70.33 179.9,-77.12"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-56.25 177.25,-56.25 177.25,-37 266,-37 266,-56.25"/>
-<text text-anchor="middle" x="221.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.33,-46.62C149.47,-46.62 157.69,-46.62 165.59,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.39,-50.13 175.39,-46.63 165.39,-43.13 165.39,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.25,-19.25 181,-19.25 181,0 262.25,0 262.25,-19.25"/>
-<text text-anchor="middle" x="221.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.33,-29.32C150.81,-26.96 160.39,-24.58 169.46,-22.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.3,-25.73 179.16,-19.92 168.61,-18.94 170.3,-25.73"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph_org.svg b/de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph_org.svg
deleted file mode 100644
index 87a132e1d..000000000
--- a/de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph_org.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: greedy_algorithms::BinaryAddition::isValidBinaryString Pages: 1 -->
-<svg width="274pt" height="101pt"
- viewBox="0.00 0.00 274.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>greedy_algorithms::BinaryAddition::isValidBinaryString</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Validates whether a string contains only binary characters (0 or 1).">
-<polygon fill="#999999" stroke="#666666" points="141.25,-67.5 0,-67.5 0,-25.75 141.25,-25.75 141.25,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
-<text text-anchor="middle" x="70.62" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251,-93.25 192.25,-93.25 192.25,-74 251,-74 251,-93.25"/>
-<text text-anchor="middle" x="221.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.33,-63.93C154.87,-67.3 168.63,-70.71 180.8,-73.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.9,-77.12 190.45,-76.13 181.59,-70.33 179.9,-77.12"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-56.25 177.25,-56.25 177.25,-37 266,-37 266,-56.25"/>
-<text text-anchor="middle" x="221.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.33,-46.62C149.47,-46.62 157.69,-46.62 165.59,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.39,-50.13 175.39,-46.63 165.39,-43.13 165.39,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.25,-19.25 181,-19.25 181,0 262.25,0 262.25,-19.25"/>
-<text text-anchor="middle" x="221.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M141.33,-29.32C150.81,-26.96 160.39,-24.58 169.46,-22.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="170.3,-25.73 179.16,-19.92 168.61,-18.94 170.3,-25.73"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph.map b/de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph.map
deleted file mode 100644
index e27a690e3..000000000
--- a/de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="greedy_algorithms::BinaryAddition::addBinary" name="greedy_algorithms::BinaryAddition::addBinary">
-<area shape="rect" id="Node000001" title="Adds two binary strings and returns the result as a binary string." alt="" coords="5,138,177,178"/>
-<area shape="rect" id="Node000002" href="$de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" title="Validates whether a string contains only binary characters (0 or 1)." alt="" coords="225,40,413,95"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="143,135,232,99,234,104,145,140"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="283,120,355,146"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="177,146,267,136,267,141,177,151"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/reverse.html#" title=" " alt="" coords="274,169,364,195"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="177,165,258,173,258,178,177,170"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="263,219,374,244"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="146,177,225,205,249,212,248,217,224,210,144,182"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/all_any_none_of.html#" title=" " alt="" coords="481,5,559,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="412,42,465,29,466,34,414,47"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/begin.html#" title=" " alt="" coords="461,55,579,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="413,65,445,65,445,70,413,70"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/end.html#" title=" " alt="" coords="466,104,574,130"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="414,88,451,97,450,102,412,93"/>
-</map>
diff --git a/de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph.md5 b/de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph.md5
deleted file mode 100644
index dd45d3035..000000000
--- a/de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-eb89941a3eefeca41e9f80419516c8b8
\ No newline at end of file
diff --git a/de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph.svg b/de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph.svg
deleted file mode 100644
index 82f3a4c1a..000000000
--- a/de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph.svg
+++ /dev/null
@@ -1,176 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: greedy_algorithms::BinaryAddition::addBinary Pages: 1 -->
-<svg width="439pt" height="187pt"
- viewBox="0.00 0.00 438.50 187.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 183.25)">
-<title>greedy_algorithms::BinaryAddition::addBinary</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Adds two binary strings and returns the result as a binary string.">
-<polygon fill="#999999" stroke="#666666" points="128.5,-79.88 0,-79.88 0,-49.38 128.5,-49.38 128.5,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="64.25" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::addBinary</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" target="_top" xlink:title="Validates whether a string contains only binary characters (0 or 1).">
-<polygon fill="white" stroke="#666666" points="305.75,-153.5 164.5,-153.5 164.5,-111.75 305.75,-111.75 305.75,-153.5"/>
-<text text-anchor="start" x="172.5" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="172.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
-<text text-anchor="middle" x="235.12" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.99,-80.23C123.75,-88.18 148.28,-98.06 170.7,-107.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.18,-110.25 179.76,-110.73 171.79,-103.75 169.18,-110.25"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.25,-93.25 208,-93.25 208,-74 262.25,-74 262.25,-93.25"/>
-<text text-anchor="middle" x="235.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.61,-71.75C151.35,-74.31 176.27,-77.12 196.18,-79.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.73,-82.83 206.06,-80.47 196.51,-75.87 195.73,-82.83"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269,-56.25 201.25,-56.25 201.25,-37 269,-37 269,-56.25"/>
-<text text-anchor="middle" x="235.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.61,-57.87C148.82,-55.72 170.76,-53.38 189.36,-51.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.68,-54.88 199.26,-50.34 188.94,-47.92 189.68,-54.88"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="276.88,-19.25 193.38,-19.25 193.38,0 276.88,0 276.88,-19.25"/>
-<text text-anchor="middle" x="235.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.53,-48.91C122.63,-41.94 144.5,-33.92 164.5,-27.62 170.23,-25.82 176.27,-24.06 182.29,-22.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.85,-25.86 191.6,-19.88 181.03,-19.1 182.85,-25.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415.5,-179.25 356.75,-179.25 356.75,-160 415.5,-160 415.5,-179.25"/>
-<text text-anchor="middle" x="386.12" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M305.83,-149.93C319.37,-153.3 333.13,-156.71 345.3,-159.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.4,-163.12 354.95,-162.13 346.09,-156.33 344.4,-163.12"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="430.5,-142.25 341.75,-142.25 341.75,-123 430.5,-123 430.5,-142.25"/>
-<text text-anchor="middle" x="386.12" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M305.83,-132.62C313.97,-132.62 322.19,-132.62 330.09,-132.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.89,-136.13 339.89,-132.63 329.89,-129.13 329.89,-136.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="426.75,-105.25 345.5,-105.25 345.5,-86 426.75,-86 426.75,-105.25"/>
-<text text-anchor="middle" x="386.12" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M305.83,-115.32C315.31,-112.96 324.89,-110.58 333.96,-108.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.8,-111.73 343.66,-105.92 333.11,-104.94 334.8,-111.73"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph_org.svg b/de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph_org.svg
deleted file mode 100644
index ef90c8885..000000000
--- a/de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph_org.svg
+++ /dev/null
@@ -1,150 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: greedy_algorithms::BinaryAddition::addBinary Pages: 1 -->
-<svg width="439pt" height="187pt"
- viewBox="0.00 0.00 438.50 187.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 183.25)">
-<title>greedy_algorithms::BinaryAddition::addBinary</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Adds two binary strings and returns the result as a binary string.">
-<polygon fill="#999999" stroke="#666666" points="128.5,-79.88 0,-79.88 0,-49.38 128.5,-49.38 128.5,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="middle" x="64.25" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::addBinary</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" target="_top" xlink:title="Validates whether a string contains only binary characters (0 or 1).">
-<polygon fill="white" stroke="#666666" points="305.75,-153.5 164.5,-153.5 164.5,-111.75 305.75,-111.75 305.75,-153.5"/>
-<text text-anchor="start" x="172.5" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
-<text text-anchor="start" x="172.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
-<text text-anchor="middle" x="235.12" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.99,-80.23C123.75,-88.18 148.28,-98.06 170.7,-107.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.18,-110.25 179.76,-110.73 171.79,-103.75 169.18,-110.25"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.25,-93.25 208,-93.25 208,-74 262.25,-74 262.25,-93.25"/>
-<text text-anchor="middle" x="235.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.61,-71.75C151.35,-74.31 176.27,-77.12 196.18,-79.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="195.73,-82.83 206.06,-80.47 196.51,-75.87 195.73,-82.83"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269,-56.25 201.25,-56.25 201.25,-37 269,-37 269,-56.25"/>
-<text text-anchor="middle" x="235.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M128.61,-57.87C148.82,-55.72 170.76,-53.38 189.36,-51.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.68,-54.88 199.26,-50.34 188.94,-47.92 189.68,-54.88"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="276.88,-19.25 193.38,-19.25 193.38,0 276.88,0 276.88,-19.25"/>
-<text text-anchor="middle" x="235.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.53,-48.91C122.63,-41.94 144.5,-33.92 164.5,-27.62 170.23,-25.82 176.27,-24.06 182.29,-22.39"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.85,-25.86 191.6,-19.88 181.03,-19.1 182.85,-25.86"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="415.5,-179.25 356.75,-179.25 356.75,-160 415.5,-160 415.5,-179.25"/>
-<text text-anchor="middle" x="386.12" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M305.83,-149.93C319.37,-153.3 333.13,-156.71 345.3,-159.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="344.4,-163.12 354.95,-162.13 346.09,-156.33 344.4,-163.12"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="430.5,-142.25 341.75,-142.25 341.75,-123 430.5,-123 430.5,-142.25"/>
-<text text-anchor="middle" x="386.12" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M305.83,-132.62C313.97,-132.62 322.19,-132.62 330.09,-132.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="329.89,-136.13 339.89,-132.63 329.89,-129.13 329.89,-136.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="426.75,-105.25 345.5,-105.25 345.5,-86 426.75,-86 426.75,-105.25"/>
-<text text-anchor="middle" x="386.12" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M305.83,-115.32C315.31,-112.96 324.89,-110.58 333.96,-108.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="334.8,-111.73 343.66,-105.92 333.11,-104.94 334.8,-111.73"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d06/decimal__to__binary_8cpp.html b/df/d06/decimal__to__binary_8cpp.html
index e62e8cd9b..ed98f6c9f 100644
--- a/df/d06/decimal__to__binary_8cpp.html
+++ b/df/d06/decimal__to__binary_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others/decimal_to_binary.cpp File Reference</title>
+<title>TheAlgorithms/C++: others/decimal_to_binary.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,7 +135,9 @@ Include dependency graph for decimal_to_binary.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/dae/decimal__to__binary_8cpp__incl.svg" width="200" height="111"><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">
+</div>
+<p><a href="../../df/d06/decimal__to__binary_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a9240f2e79074a2a248395258aebbfa11" id="r_a9240f2e79074a2a248395258aebbfa11"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9240f2e79074a2a248395258aebbfa11">method1</a> (int number)</td></tr>
@@ -130,6 +149,8 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Function to convert decimal number to binary representation. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../df/d06/decimal__to__binary_8cpp_source.html">decimal_to_binary.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -145,20 +166,20 @@ Functions</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d06/decimal__to__binary_8cpp_source.html#l00046">46</a> of file <a class="el" href="../../df/d06/decimal__to__binary_8cpp_source.html">decimal_to_binary.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   46</span>           {</div>
 <div class="line"><span class="lineno">   47</span>    <span class="keywordtype">int</span> number;</div>
-<div class="line"><span class="lineno">   48</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter a number:&quot;</span>;</div>
-<div class="line"><span class="lineno">   49</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; number;</div>
+<div class="line"><span class="lineno">   48</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter a number:&quot;</span>;</div>
+<div class="line"><span class="lineno">   49</span>    std::cin &gt;&gt; number;</div>
 <div class="line"><span class="lineno">   50</span> </div>
 <div class="line"><span class="lineno">   51</span>    <a class="code hl_function" href="#a9240f2e79074a2a248395258aebbfa11">method1</a>(number);</div>
 <div class="line"><span class="lineno">   52</span>    <a class="code hl_function" href="#a10df57491019f0ac39b492740fb388f7">method2</a>(number);</div>
 <div class="line"><span class="lineno">   53</span> </div>
 <div class="line"><span class="lineno">   54</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   55</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="adecimal__to__binary_8cpp_html_a10df57491019f0ac39b492740fb388f7"><div class="ttname"><a href="#a10df57491019f0ac39b492740fb388f7">method2</a></div><div class="ttdeci">void method2(int number)</div><div class="ttdef"><b>Definition</b> decimal_to_binary.cpp:27</div></div>
-<div class="ttc" id="adecimal__to__binary_8cpp_html_a9240f2e79074a2a248395258aebbfa11"><div class="ttname"><a href="#a9240f2e79074a2a248395258aebbfa11">method1</a></div><div class="ttdeci">void method1(int number)</div><div class="ttdef"><b>Definition</b> decimal_to_binary.cpp:11</div></div>
+<div class="ttc" id="adecimal__to__binary_8cpp_html_a10df57491019f0ac39b492740fb388f7"><div class="ttname"><a href="#a10df57491019f0ac39b492740fb388f7">method2</a></div><div class="ttdeci">void method2(int number)</div><div class="ttdef"><b>Definition</b> <a href="../../df/d06/decimal__to__binary_8cpp_source.html#l00027">decimal_to_binary.cpp:27</a></div></div>
+<div class="ttc" id="adecimal__to__binary_8cpp_html_a9240f2e79074a2a248395258aebbfa11"><div class="ttname"><a href="#a9240f2e79074a2a248395258aebbfa11">method1</a></div><div class="ttdeci">void method1(int number)</div><div class="ttdef"><b>Definition</b> <a href="../../df/d06/decimal__to__binary_8cpp_source.html#l00011">decimal_to_binary.cpp:11</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -177,25 +198,20 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>This method converts the bit representation and stores it as a decimal number. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d06/decimal__to__binary_8cpp_source.html#l00011">11</a> of file <a class="el" href="../../df/d06/decimal__to__binary_8cpp_source.html">decimal_to_binary.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   11</span>                         {</div>
-<div class="line"><span class="lineno">   12</span>    <span class="keywordtype">int</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/remainder.html">remainder</a>, binary = 0, var = 1;</div>
+<div class="line"><span class="lineno">   12</span>    <span class="keywordtype">int</span> remainder, binary = 0, var = 1;</div>
 <div class="line"><span class="lineno">   13</span> </div>
 <div class="line"><span class="lineno">   14</span>    <span class="keywordflow">do</span> {</div>
-<div class="line"><span class="lineno">   15</span>        <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/remainder.html">remainder</a> = number % 2;</div>
+<div class="line"><span class="lineno">   15</span>        remainder = number % 2;</div>
 <div class="line"><span class="lineno">   16</span>        number = number / 2;</div>
-<div class="line"><span class="lineno">   17</span>        binary = binary + (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/remainder.html">remainder</a> * var);</div>
+<div class="line"><span class="lineno">   17</span>        binary = binary + (remainder * var);</div>
 <div class="line"><span class="lineno">   18</span>        var = var * 10;</div>
 <div class="line"><span class="lineno">   19</span>    } <span class="keywordflow">while</span> (number &gt; 0);</div>
-<div class="line"><span class="lineno">   20</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Method 1 : &quot;</span> &lt;&lt; binary &lt;&lt; <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">   20</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Method 1 : &quot;</span> &lt;&lt; binary &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   21</span>}</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="aremainder_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/remainder.html">std::remainder</a></div><div class="ttdeci">T remainder(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.svg" width="202" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a10df57491019f0ac39b492740fb388f7" name="a10df57491019f0ac39b492740fb388f7"></a>
@@ -213,6 +229,8 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>This method stores each bit value from LSB to MSB and then prints them back from MSB to LSB </p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d06/decimal__to__binary_8cpp_source.html#l00027">27</a> of file <a class="el" href="../../df/d06/decimal__to__binary_8cpp_source.html">decimal_to_binary.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   27</span>                         {</div>
 <div class="line"><span class="lineno">   28</span>    <span class="keywordtype">int</span> num_bits = 0;</div>
 <div class="line"><span class="lineno">   29</span>    <span class="keywordtype">char</span> bit_string[50];</div>
@@ -226,17 +244,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   37</span>        number &gt;&gt;= 1;  <span class="comment">// right shift bit 1 bit</span></div>
 <div class="line"><span class="lineno">   38</span>    } <span class="keywordflow">while</span> (number &gt; 0);</div>
 <div class="line"><span class="lineno">   39</span> </div>
-<div class="line"><span class="lineno">   40</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Method 2 : &quot;</span>;</div>
+<div class="line"><span class="lineno">   40</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Method 2 : &quot;</span>;</div>
 <div class="line"><span class="lineno">   41</span>    <span class="keywordflow">while</span> (num_bits &gt;= 0)</div>
-<div class="line"><span class="lineno">   42</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; bit_string[num_bits--];  <span class="comment">// print from MSB to LSB</span></div>
-<div class="line"><span class="lineno">   43</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <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">   42</span>        std::cout &lt;&lt; bit_string[num_bits--];  <span class="comment">// print from MSB to LSB</span></div>
+<div class="line"><span class="lineno">   43</span>    std::cout &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   44</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.svg" width="202" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.map b/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.map
deleted file mode 100644
index 5cee1d784..000000000
--- a/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="method2" name="method2">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,77,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="125,5,196,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="77,16,109,16,109,21,77,21"/>
-</map>
diff --git a/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.md5 b/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.md5
deleted file mode 100644
index 48d2e02ae..000000000
--- a/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b16418b32a4fcb892c19968499c0a43b
\ No newline at end of file
diff --git a/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.svg b/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.svg
deleted file mode 100644
index b722e9b8c..000000000
--- a/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: method2 Pages: 1 -->
-<svg width="151pt" height="27pt"
- viewBox="0.00 0.00 151.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>method2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
-<text text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">method2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143,-19.25 89.5,-19.25 89.5,0 143,0 143,-19.25"/>
-<text text-anchor="middle" x="116.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.53,-9.62C61.14,-9.62 69.62,-9.62 77.8,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.54,-13.13 87.54,-9.63 77.54,-6.13 77.54,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph_org.svg b/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph_org.svg
deleted file mode 100644
index ee70bd403..000000000
--- a/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: method2 Pages: 1 -->
-<svg width="151pt" height="27pt"
- viewBox="0.00 0.00 151.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>method2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
-<text text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">method2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143,-19.25 89.5,-19.25 89.5,0 143,0 143,-19.25"/>
-<text text-anchor="middle" x="116.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.53,-9.62C61.14,-9.62 69.62,-9.62 77.8,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.54,-13.13 87.54,-9.63 77.54,-6.13 77.54,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.map b/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.map
deleted file mode 100644
index 8472c32d6..000000000
--- a/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="method1" name="method1">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,77,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="125,5,196,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="77,16,109,16,109,21,77,21"/>
-</map>
diff --git a/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.md5 b/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.md5
deleted file mode 100644
index e3a2319f6..000000000
--- a/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7b4c5fbf47340443b7f32699d0051aa7
\ No newline at end of file
diff --git a/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.svg b/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.svg
deleted file mode 100644
index 5bae84cfe..000000000
--- a/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: method1 Pages: 1 -->
-<svg width="151pt" height="27pt"
- viewBox="0.00 0.00 151.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>method1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
-<text text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">method1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143,-19.25 89.5,-19.25 89.5,0 143,0 143,-19.25"/>
-<text text-anchor="middle" x="116.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.53,-9.62C61.14,-9.62 69.62,-9.62 77.8,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.54,-13.13 87.54,-9.63 77.54,-6.13 77.54,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph_org.svg b/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph_org.svg
deleted file mode 100644
index 893dc7f08..000000000
--- a/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: method1 Pages: 1 -->
-<svg width="151pt" height="27pt"
- viewBox="0.00 0.00 151.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>method1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
-<text text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">method1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="143,-19.25 89.5,-19.25 89.5,0 143,0 143,-19.25"/>
-<text text-anchor="middle" x="116.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.53,-9.62C61.14,-9.62 69.62,-9.62 77.8,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="77.54,-13.13 87.54,-9.63 77.54,-6.13 77.54,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d06/decimal__to__binary_8cpp_source.html b/df/d06/decimal__to__binary_8cpp_source.html
new file mode 100644
index 000000000..a858be174
--- /dev/null
+++ b/df/d06/decimal__to__binary_8cpp_source.html
@@ -0,0 +1,188 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: others/decimal_to_binary.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/d06/decimal__to__binary_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">decimal_to_binary.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../df/d06/decimal__to__binary_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span> </div>
+<div class="foldopen" id="foldopen00011" data-start="{" data-end="}">
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"><a class="line" href="../../df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11">   11</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11">method1</a>(<span class="keywordtype">int</span> number) {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    <span class="keywordtype">int</span> remainder, binary = 0, var = 1;</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>        remainder = number % 2;</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>        number = number / 2;</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>        binary = binary + (remainder * var);</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        var = var * 10;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    } <span class="keywordflow">while</span> (number &gt; 0);</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Method 1 : &quot;</span> &lt;&lt; binary &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>}</div>
+</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="foldopen" id="foldopen00027" data-start="{" data-end="}">
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7">   27</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7">method2</a>(<span class="keywordtype">int</span> number) {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="keywordtype">int</span> num_bits = 0;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordtype">char</span> bit_string[50];</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        <span class="keywordtype">bool</span> bit = number &amp; 0x01;  <span class="comment">// get last bit</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        <span class="keywordflow">if</span> (bit)</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>            bit_string[num_bits++] = <span class="charliteral">&#39;1&#39;</span>;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>            bit_string[num_bits++] = <span class="charliteral">&#39;0&#39;</span>;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        number &gt;&gt;= 1;  <span class="comment">// right shift bit 1 bit</span></div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    } <span class="keywordflow">while</span> (number &gt; 0);</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Method 2 : &quot;</span>;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">while</span> (num_bits &gt;= 0)</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        std::cout &lt;&lt; bit_string[num_bits--];  <span class="comment">// print from MSB to LSB</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    std::cout &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>}</div>
+</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordtype">int</span> number;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter a number:&quot;</span>;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    std::cin &gt;&gt; number;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    <a class="code hl_function" href="../../df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11">method1</a>(number);</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <a class="code hl_function" href="../../df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7">method2</a>(number);</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span> </div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>}</div>
+<div class="ttc" id="adecimal__to__binary_8cpp_html_a10df57491019f0ac39b492740fb388f7"><div class="ttname"><a href="../../df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7">method2</a></div><div class="ttdeci">void method2(int number)</div><div class="ttdef"><b>Definition</b> <a href="#l00027">decimal_to_binary.cpp:27</a></div></div>
+<div class="ttc" id="adecimal__to__binary_8cpp_html_a9240f2e79074a2a248395258aebbfa11"><div class="ttname"><a href="../../df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11">method1</a></div><div class="ttdeci">void method1(int number)</div><div class="ttdef"><b>Definition</b> <a href="#l00011">decimal_to_binary.cpp:11</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9510827d0b234b3cc54b29892f217477.html">others</a></li><li class="navelem"><a class="el" href="../../df/d06/decimal__to__binary_8cpp.html">decimal_to_binary.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/d10/namespacepancake__sort.html b/df/d10/namespacepancake__sort.html
index 466fbc279..70245b742 100644
--- a/df/d10/namespacepancake__sort.html
+++ b/df/d10/namespacepancake__sort.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: pancake_sort Namespace Reference</title>
+<title>TheAlgorithms/C++: pancake_sort Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/df/d11/classdata__structures_1_1linked__list_1_1link-members.html b/df/d11/classdata__structures_1_1linked__list_1_1link-members.html
index 06a9c7020..c75587264 100644
--- a/df/d11/classdata__structures_1_1linked__list_1_1link-members.html
+++ b/df/d11/classdata__structures_1_1linked__list_1_1link-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/df/d11/midpoint__integral__method_8cpp.html b/df/d11/midpoint__integral__method_8cpp.html
index 15730bdf3..5b5ef4d11 100644
--- a/df/d11/midpoint__integral__method_8cpp.html
+++ b/df/d11/midpoint__integral__method_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/midpoint_integral_method.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/midpoint_integral_method.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -125,7 +142,9 @@ Include dependency graph for midpoint_integral_method.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d1c/midpoint__integral__method_8cpp__incl.svg" width="592" height="126"><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">
+</div>
+<p><a href="../../df/d11/midpoint__integral__method_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></td></tr>
@@ -137,7 +156,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a7072493d1f0f8a91b2a71d4cc456c09c" id="r_a7072493d1f0f8a91b2a71d4cc456c09c"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7072493d1f0f8a91b2a71d4cc456c09c">numerical_methods::midpoint_rule::midpoint</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> N, const double <a class="el" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, const double a, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; double(double)&gt; &amp;func)</td></tr>
+<tr class="memitem:a7072493d1f0f8a91b2a71d4cc456c09c" id="r_a7072493d1f0f8a91b2a71d4cc456c09c"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7072493d1f0f8a91b2a71d4cc456c09c">numerical_methods::midpoint_rule::midpoint</a> (const std::int32_t N, const double <a class="el" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, const double a, const std::function&lt; double(double)&gt; &amp;func)</td></tr>
 <tr class="memdesc:a7072493d1f0f8a91b2a71d4cc456c09c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function for implementing the Midpoint Integral Method implementation.  <br /></td></tr>
 <tr class="separator:a7072493d1f0f8a91b2a71d4cc456c09c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a7ee8e824ef3e138a9a21883b26d97226" id="r_a7ee8e824ef3e138a9a21883b26d97226"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7ee8e824ef3e138a9a21883b26d97226">numerical_methods::midpoint_rule::f</a> (double x)</td></tr>
@@ -152,7 +171,7 @@ Functions</h2></td></tr>
 <tr class="memitem:ad53616fb4fa6880ae876bcba53365c51" id="r_ad53616fb4fa6880ae876bcba53365c51"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad53616fb4fa6880ae876bcba53365c51">numerical_methods::midpoint_rule::l</a> (double x)</td></tr>
 <tr class="memdesc:ad53616fb4fa6880ae876bcba53365c51"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function l(x) that will be used to test the method.  <br /></td></tr>
 <tr class="separator:ad53616fb4fa6880ae876bcba53365c51"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a2ae48a41e43dc6ab11b962742349646e" id="r_a2ae48a41e43dc6ab11b962742349646e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2ae48a41e43dc6ab11b962742349646e">test</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> N, double <a class="el" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, double a, double b, bool used_argv_parameters)</td></tr>
+<tr class="memitem:a2ae48a41e43dc6ab11b962742349646e" id="r_a2ae48a41e43dc6ab11b962742349646e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2ae48a41e43dc6ab11b962742349646e">test</a> (std::int32_t N, double <a class="el" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, double a, double b, bool used_argv_parameters)</td></tr>
 <tr class="memdesc:a2ae48a41e43dc6ab11b962742349646e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations.  <br /></td></tr>
 <tr class="separator:a2ae48a41e43dc6ab11b962742349646e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a3c04138a5bfe5d72780bb7e82a18e627" id="r_a3c04138a5bfe5d72780bb7e82a18e627"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3c04138a5bfe5d72780bb7e82a18e627">main</a> (int argc, char **argv)</td></tr>
@@ -165,6 +184,8 @@ Functions</h2></td></tr>
 <p>We create a table of the xi and their corresponding f(xi) values and we evaluate the integral by the formula: I = h * {f(x0+h/2) + f(x1+h/2) + ... + f(xN-1+h/2)}</p>
 <p>Arguments can be passed as parameters from the command line argv[1] = N, argv[2] = a, argv[3] = b. In this case if the default values N=16, a=1, b=3 are changed then the tests/assert are disabled.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/ggkogkou" target="_blank">ggkogkou</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../df/d11/midpoint__integral__method_8cpp_source.html">midpoint_integral_method.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a7ee8e824ef3e138a9a21883b26d97226" name="a7ee8e824ef3e138a9a21883b26d97226"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a7ee8e824ef3e138a9a21883b26d97226">&#9670;&#160;</a></span>f()</h2>
@@ -189,15 +210,10 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the value of the dependent variable yi = f(xi) = sqrt(xi) + ln(xi) </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   90</span>{ <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(x) + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">std::log</a>(x); }</div>
-<div class="ttc" id="alog_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/log.html">std::log</a></div><div class="ttdeci">T log(T... args)</div></div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d11/midpoint__integral__method_8cpp_a7ee8e824ef3e138a9a21883b26d97226_cgraph.svg" width="271" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../df/d11/midpoint__integral__method_8cpp_source.html#l00090">90</a> of file <a class="el" href="../../df/d11/midpoint__integral__method_8cpp_source.html">midpoint_integral_method.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   90</span>{ <span class="keywordflow">return</span> std::sqrt(x) + std::log(x); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae682ee71af44b1e9e884849cc6a6b040" name="ae682ee71af44b1e9e884849cc6a6b040"></a>
@@ -223,15 +239,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the value of the dependent variable yi = g(xi) = e^(-xi) * (4 - xi^2) </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">   97</span>{ <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a>(-x) * (4 - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(x, 2)); }</div>
-<div class="ttc" id="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d11/midpoint__integral__method_8cpp_ae682ee71af44b1e9e884849cc6a6b040_cgraph.svg" width="272" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../df/d11/midpoint__integral__method_8cpp_source.html#l00097">97</a> of file <a class="el" href="../../df/d11/midpoint__integral__method_8cpp_source.html">midpoint_integral_method.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   97</span>{ <span class="keywordflow">return</span> std::exp(-x) * (4 - std::pow(x, 2)); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae9f66040f8e0ba73c1c741261c22a52a" name="ae9f66040f8e0ba73c1c741261c22a52a"></a>
@@ -257,13 +268,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the value of the dependent variable yi = k(xi) = sqrt(2*xi^3 + 3) </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  103</span>{ <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(2 * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(x, 3) + 3); }</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="../../df/d11/midpoint__integral__method_8cpp_ae9f66040f8e0ba73c1c741261c22a52a_cgraph.svg" width="272" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../df/d11/midpoint__integral__method_8cpp_source.html#l00103">103</a> of file <a class="el" href="../../df/d11/midpoint__integral__method_8cpp_source.html">midpoint_integral_method.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  103</span>{ <span class="keywordflow">return</span> std::sqrt(2 * std::pow(x, 3) + 3); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ad53616fb4fa6880ae876bcba53365c51" name="ad53616fb4fa6880ae876bcba53365c51"></a>
@@ -289,13 +297,10 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the value of the dependent variable yi = l(xi) = xi + ln(2*xi + 1) </dd></dl>
-<div class="fragment"><div class="line"><span class="lineno">  109</span>{ <span class="keywordflow">return</span> x + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/log.html">std::log</a>(2 * x + 1); }</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="../../df/d11/midpoint__integral__method_8cpp_ad53616fb4fa6880ae876bcba53365c51_cgraph.svg" width="266" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../df/d11/midpoint__integral__method_8cpp_source.html#l00109">109</a> of file <a class="el" href="../../df/d11/midpoint__integral__method_8cpp_source.html">midpoint_integral_method.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  109</span>{ <span class="keywordflow">return</span> x + std::log(2 * x + 1); }</div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a3c04138a5bfe5d72780bb7e82a18e627" name="a3c04138a5bfe5d72780bb7e82a18e627"></a>
@@ -331,13 +336,13 @@ Here is the call graph for this function:</div>
 <p>Starting and ending point of the integration in</p>
 <p>the real axis</p>
 <p>Step, calculated by a, b and N</p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d11/midpoint__integral__method_8cpp_source.html#l00162">162</a> of file <a class="el" href="../../df/d11/midpoint__integral__method_8cpp_source.html">midpoint_integral_method.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  162</span>                                {</div>
-<div class="line"><span class="lineno">  163</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> =</div>
-<div class="line"><span class="lineno">  164</span>        16;  <span class="comment">/// Number of intervals to divide the integration interval.</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  165</span><span class="comment">    /// MUST BE EVEN</span></div>
-<div class="line"><span class="lineno">  166</span><span class="comment"></span>    <span class="keywordtype">double</span> a = 1, b = 3;  <span class="comment">/// Starting and ending point of the integration in</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  167</span><span class="comment">    /// the real axis</span></div>
-<div class="line"><span class="lineno">  168</span><span class="comment"></span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = NAN;  <span class="comment">/// Step, calculated by a, b and N</span></div>
+<div class="line"><span class="lineno">  163</span>    std::int32_t <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> =</div>
+<div class="line"><span class="lineno">  164</span>        16;  </div>
+<div class="line"><span class="lineno">  166</span>    <span class="keywordtype">double</span> a = 1, b = 3;  </div>
+<div class="line"><span class="lineno">  168</span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = NAN;  </div>
 <div class="line"><span class="lineno">  169</span> </div>
 <div class="line"><span class="lineno">  170</span>    <span class="keywordtype">bool</span> used_argv_parameters =</div>
 <div class="line"><span class="lineno">  171</span>        <span class="keyword">false</span>;  <span class="comment">// If argv parameters are used then the assert must be omitted</span></div>
@@ -346,20 +351,20 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  174</span>    <span class="comment">// Get user input (by the command line parameters or the console after</span></div>
 <div class="line"><span class="lineno">  175</span>    <span class="comment">// displaying messages)</span></div>
 <div class="line"><span class="lineno">  176</span>    <span class="keywordflow">if</span> (argc == 4) {</div>
-<div class="line"><span class="lineno">  177</span>        <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">std::atoi</a>(argv[1]);</div>
-<div class="line"><span class="lineno">  178</span>        a = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a>(argv[2]);</div>
-<div class="line"><span class="lineno">  179</span>        b = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a>(argv[3]);</div>
+<div class="line"><span class="lineno">  177</span>        <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> = std::atoi(argv[1]);</div>
+<div class="line"><span class="lineno">  178</span>        a = std::atof(argv[2]);</div>
+<div class="line"><span class="lineno">  179</span>        b = std::atof(argv[3]);</div>
 <div class="line"><span class="lineno">  180</span>        <span class="comment">// Check if a&lt;b else abort</span></div>
 <div class="line"><span class="lineno">  181</span>        assert(a &lt; b &amp;&amp; <span class="stringliteral">&quot;a has to be less than b&quot;</span>);</div>
 <div class="line"><span class="lineno">  182</span>        assert(N &gt; 0 &amp;&amp; <span class="stringliteral">&quot;N has to be &gt; 0&quot;</span>);</div>
 <div class="line"><span class="lineno">  183</span>        <span class="keywordflow">if</span> (N &lt; 4 || a != 1 || b != 3) {</div>
 <div class="line"><span class="lineno">  184</span>            used_argv_parameters = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  185</span>        }</div>
-<div class="line"><span class="lineno">  186</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;You selected N=&quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div>
-<div class="line"><span class="lineno">  187</span>                  &lt;&lt; <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">  186</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;You selected N=&quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div>
+<div class="line"><span class="lineno">  187</span>                  &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  188</span>    } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  189</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Default N=&quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div>
-<div class="line"><span class="lineno">  190</span>                  &lt;&lt; <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">  189</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Default N=&quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a> &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div>
+<div class="line"><span class="lineno">  190</span>                  &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  191</span>    }</div>
 <div class="line"><span class="lineno">  192</span> </div>
 <div class="line"><span class="lineno">  193</span>    <span class="comment">// Find the step</span></div>
@@ -369,20 +374,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  197</span> </div>
 <div class="line"><span class="lineno">  198</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  199</span>}</div>
-<div class="ttc" id="aatof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/atof.html">std::atof</a></div><div class="ttdeci">T atof(T... args)</div></div>
-<div class="ttc" id="aatoi_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/atoi.html">std::atoi</a></div><div class="ttdeci">T atoi(T... args)</div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> generate_parentheses.cpp:82</div></div>
-<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> hash_search.cpp:45</div></div>
-<div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a></div></div>
-<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../df/d11/midpoint__integral__method_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg" width="100%" height="523"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00082">generate_parentheses.cpp:82</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00045">hash_search.cpp:45</a></div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a7072493d1f0f8a91b2a71d4cc456c09c" name="a7072493d1f0f8a91b2a71d4cc456c09c"></a>
@@ -394,7 +389,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">double numerical_methods::midpoint_rule::midpoint </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a></td>          <td class="paramname"><span class="paramname"><em>N</em></span>, </td>
+          <td class="paramtype">const std::int32_t</td>          <td class="paramname"><span class="paramname"><em>N</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -409,7 +404,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; double(double)&gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>func</em></span>&#160;)</td>
+          <td class="paramtype">const std::function&lt; double(double)&gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>func</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -425,48 +420,40 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the result of the integration </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d11/midpoint__integral__method_8cpp_source.html#l00052">52</a> of file <a class="el" href="../../df/d11/midpoint__integral__method_8cpp_source.html">midpoint_integral_method.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   53</span>                                                         {</div>
-<div class="line"><span class="lineno">   54</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map&lt;int, double&gt;</a></div>
+<div class="line"><span class="lineno">   54</span>    std::map&lt;int, double&gt;</div>
 <div class="line"><span class="lineno">   55</span>        data_table;  <span class="comment">// Contains the data points, key: i, value: f(xi)</span></div>
 <div class="line"><span class="lineno">   56</span>    <span class="keywordtype">double</span> xi = a;   <span class="comment">// Initialize xi to the starting point x0 = a</span></div>
 <div class="line"><span class="lineno">   57</span> </div>
 <div class="line"><span class="lineno">   58</span>    <span class="comment">// Create the data table</span></div>
 <div class="line"><span class="lineno">   59</span>    <span class="comment">// Loop from x0 to xN-1</span></div>
 <div class="line"><span class="lineno">   60</span>    <span class="keywordtype">double</span> temp = NAN;</div>
-<div class="line"><span class="lineno">   61</span>    <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
+<div class="line"><span class="lineno">   61</span>    <span class="keywordflow">for</span> (std::int32_t i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) {</div>
 <div class="line"><span class="lineno">   62</span>        temp = func(xi + <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> / 2);  <span class="comment">// find f(xi+h/2)</span></div>
-<div class="line"><span class="lineno">   63</span>        data_table.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/insert.html">insert</a>(</div>
-<div class="line"><span class="lineno">   64</span>            <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;std::int32_t, double&gt;</a>(i, temp));  <span class="comment">// add i and f(xi)</span></div>
+<div class="line"><span class="lineno">   63</span>        data_table.insert(</div>
+<div class="line"><span class="lineno">   64</span>            std::pair&lt;std::int32_t, double&gt;(i, temp));  <span class="comment">// add i and f(xi)</span></div>
 <div class="line"><span class="lineno">   65</span>        xi += <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>;  <span class="comment">// Get the next point xi for the next iteration</span></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">// Evaluate the integral.</span></div>
 <div class="line"><span class="lineno">   69</span>    <span class="comment">// Remember: {f(x0+h/2) + f(x1+h/2) + ... + f(xN-1+h/2)}</span></div>
 <div class="line"><span class="lineno">   70</span>    <span class="keywordtype">double</span> evaluate_integral = 0;</div>
-<div class="line"><span class="lineno">   71</span>    <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a> i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) evaluate_integral += data_table.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map/at.html">at</a>(i);</div>
+<div class="line"><span class="lineno">   71</span>    <span class="keywordflow">for</span> (std::int32_t i = 0; i &lt; <a class="code hl_variable" href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">N</a>; i++) evaluate_integral += data_table.at(i);</div>
 <div class="line"><span class="lineno">   72</span> </div>
 <div class="line"><span class="lineno">   73</span>    <span class="comment">// Multiply by the coefficient h</span></div>
 <div class="line"><span class="lineno">   74</span>    evaluate_integral *= <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>;</div>
 <div class="line"><span class="lineno">   75</span> </div>
 <div class="line"><span class="lineno">   76</span>    <span class="comment">// If the result calculated is nan, then the user has given wrong input</span></div>
 <div class="line"><span class="lineno">   77</span>    <span class="comment">// interval.</span></div>
-<div class="line"><span class="lineno">   78</span>    assert(!<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/isnan.html">std::isnan</a>(evaluate_integral) &amp;&amp;</div>
+<div class="line"><span class="lineno">   78</span>    assert(!std::isnan(evaluate_integral) &amp;&amp;</div>
 <div class="line"><span class="lineno">   79</span>           <span class="stringliteral">&quot;The definite integral can&#39;t be evaluated. Check the validity of &quot;</span></div>
 <div class="line"><span class="lineno">   80</span>           <span class="stringliteral">&quot;your input.\n&quot;</span>);</div>
 <div class="line"><span class="lineno">   81</span>    <span class="comment">// Else return</span></div>
 <div class="line"><span class="lineno">   82</span>    <span class="keywordflow">return</span> evaluate_integral;</div>
 <div class="line"><span class="lineno">   83</span>}</div>
-<div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map/at.html">std::map::at</a></div><div class="ttdeci">T at(T... args)</div></div>
-<div class="ttc" id="ainsert_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map/insert.html">std::map::insert</a></div><div class="ttdeci">T insert(T... args)</div></div>
-<div class="ttc" id="aisnan_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/isnan.html">std::isnan</a></div><div class="ttdeci">T isnan(T... args)</div></div>
-<div class="ttc" id="amap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a></div></div>
-<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d11/midpoint__integral__method_8cpp_a7072493d1f0f8a91b2a71d4cc456c09c_cgraph.svg" width="327" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a2ae48a41e43dc6ab11b962742349646e" name="a2ae48a41e43dc6ab11b962742349646e"></a>
@@ -481,7 +468,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">static void test </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int32_t</a></td>          <td class="paramname"><span class="paramname"><em>N</em></span>, </td>
+          <td class="paramtype">std::int32_t</td>          <td class="paramname"><span class="paramname"><em>N</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -522,6 +509,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d11/midpoint__integral__method_8cpp_source.html#l00123">123</a> of file <a class="el" href="../../df/d11/midpoint__integral__method_8cpp_source.html">midpoint_integral_method.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  124</span>                                            {</div>
 <div class="line"><span class="lineno">  125</span>    <span class="comment">// Call midpoint() for each of the test functions f, g, k, l</span></div>
 <div class="line"><span class="lineno">  126</span>    <span class="comment">// Assert with two decimal point precision</span></div>
@@ -529,37 +518,32 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  128</span>        N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::midpoint_rule::f);</div>
 <div class="line"><span class="lineno">  129</span>    assert((used_argv_parameters || (result_f &gt;= 4.09 &amp;&amp; result_f &lt;= 4.10)) &amp;&amp;</div>
 <div class="line"><span class="lineno">  130</span>           <span class="stringliteral">&quot;The result of f(x) is wrong&quot;</span>);</div>
-<div class="line"><span class="lineno">  131</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The result of integral f(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
-<div class="line"><span class="lineno">  132</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_f &lt;&lt; <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">  131</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The result of integral f(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
+<div class="line"><span class="lineno">  132</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_f &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  133</span> </div>
 <div class="line"><span class="lineno">  134</span>    <span class="keywordtype">double</span> result_g = <a class="code hl_function" href="#a7072493d1f0f8a91b2a71d4cc456c09c">numerical_methods::midpoint_rule::midpoint</a>(</div>
 <div class="line"><span class="lineno">  135</span>        N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::midpoint_rule::g);</div>
 <div class="line"><span class="lineno">  136</span>    assert((used_argv_parameters || (result_g &gt;= 0.27 &amp;&amp; result_g &lt;= 0.28)) &amp;&amp;</div>
 <div class="line"><span class="lineno">  137</span>           <span class="stringliteral">&quot;The result of g(x) is wrong&quot;</span>);</div>
-<div class="line"><span class="lineno">  138</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The result of integral g(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
-<div class="line"><span class="lineno">  139</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_g &lt;&lt; <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">  138</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The result of integral g(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
+<div class="line"><span class="lineno">  139</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_g &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  140</span> </div>
 <div class="line"><span class="lineno">  141</span>    <span class="keywordtype">double</span> result_k = <a class="code hl_function" href="#a7072493d1f0f8a91b2a71d4cc456c09c">numerical_methods::midpoint_rule::midpoint</a>(</div>
 <div class="line"><span class="lineno">  142</span>        N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::midpoint_rule::k);</div>
 <div class="line"><span class="lineno">  143</span>    assert((used_argv_parameters || (result_k &gt;= 9.06 &amp;&amp; result_k &lt;= 9.07)) &amp;&amp;</div>
 <div class="line"><span class="lineno">  144</span>           <span class="stringliteral">&quot;The result of k(x) is wrong&quot;</span>);</div>
-<div class="line"><span class="lineno">  145</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The result of integral k(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
-<div class="line"><span class="lineno">  146</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_k &lt;&lt; <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">  145</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The result of integral k(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
+<div class="line"><span class="lineno">  146</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_k &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  147</span> </div>
 <div class="line"><span class="lineno">  148</span>    <span class="keywordtype">double</span> result_l = <a class="code hl_function" href="#a7072493d1f0f8a91b2a71d4cc456c09c">numerical_methods::midpoint_rule::midpoint</a>(</div>
 <div class="line"><span class="lineno">  149</span>        N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::midpoint_rule::l);</div>
 <div class="line"><span class="lineno">  150</span>    assert((used_argv_parameters || (result_l &gt;= 7.16 &amp;&amp; result_l &lt;= 7.17)) &amp;&amp;</div>
 <div class="line"><span class="lineno">  151</span>           <span class="stringliteral">&quot;The result of l(x) is wrong&quot;</span>);</div>
-<div class="line"><span class="lineno">  152</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The result of integral l(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
-<div class="line"><span class="lineno">  153</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_l &lt;&lt; <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">  152</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The result of integral l(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
+<div class="line"><span class="lineno">  153</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_l &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  154</span>}</div>
-<div class="ttc" id="amidpoint__integral__method_8cpp_html_a7072493d1f0f8a91b2a71d4cc456c09c"><div class="ttname"><a href="#a7072493d1f0f8a91b2a71d4cc456c09c">numerical_methods::midpoint_rule::midpoint</a></div><div class="ttdeci">double midpoint(const std::int32_t N, const double h, const double a, const std::function&lt; double(double)&gt; &amp;func)</div><div class="ttdoc">Main function for implementing the Midpoint Integral Method implementation.</div><div class="ttdef"><b>Definition</b> midpoint_integral_method.cpp:52</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d11/midpoint__integral__method_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.svg" width="174" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amidpoint__integral__method_8cpp_html_a7072493d1f0f8a91b2a71d4cc456c09c"><div class="ttname"><a href="#a7072493d1f0f8a91b2a71d4cc456c09c">numerical_methods::midpoint_rule::midpoint</a></div><div class="ttdeci">double midpoint(const std::int32_t N, const double h, const double a, const std::function&lt; double(double)&gt; &amp;func)</div><div class="ttdoc">Main function for implementing the Midpoint Integral Method implementation.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d11/midpoint__integral__method_8cpp_source.html#l00052">midpoint_integral_method.cpp:52</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/df/d11/midpoint__integral__method_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.map b/df/d11/midpoint__integral__method_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.map
deleted file mode 100644
index 36cb2a672..000000000
--- a/df/d11/midpoint__integral__method_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,31,49,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,36,81,28,82,33,50,41"/>
-<area shape="rect" id="Node000003" href="$d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" title=" " alt="" coords="113,55,152,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="50,46,98,57,97,62,49,51"/>
-</map>
diff --git a/df/d11/midpoint__integral__method_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.md5 b/df/d11/midpoint__integral__method_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.md5
deleted file mode 100644
index 195b68a6d..000000000
--- a/df/d11/midpoint__integral__method_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-35205101949ce7aa6a6ebedcb619e803
\ No newline at end of file
diff --git a/df/d11/midpoint__integral__method_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.svg b/df/d11/midpoint__integral__method_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.svg
deleted file mode 100644
index 5424cc847..000000000
--- a/df/d11/midpoint__integral__method_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="64pt"
- viewBox="0.00 0.00 130.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-56.25 68.5,-56.25 68.5,-37 122,-37 122,-56.25"/>
-<text text-anchor="middle" x="95.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-31.47C39.86,-33.2 48.49,-35.33 57.03,-37.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.06,-40.81 66.61,-39.8 57.74,-34.01 56.06,-40.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="109.65,-19.25 80.85,-19.25 80.85,0 109.65,0 109.65,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-23.98C43.31,-21.53 57.36,-18.25 69.37,-15.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.08,-18.87 79.02,-13.18 68.49,-12.05 70.08,-18.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d11/midpoint__integral__method_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph_org.svg b/df/d11/midpoint__integral__method_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph_org.svg
deleted file mode 100644
index c30627a2d..000000000
--- a/df/d11/midpoint__integral__method_8cpp_a2ae48a41e43dc6ab11b962742349646e_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="64pt"
- viewBox="0.00 0.00 130.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-56.25 68.5,-56.25 68.5,-37 122,-37 122,-56.25"/>
-<text text-anchor="middle" x="95.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-31.47C39.86,-33.2 48.49,-35.33 57.03,-37.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.06,-40.81 66.61,-39.8 57.74,-34.01 56.06,-40.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="109.65,-19.25 80.85,-19.25 80.85,0 109.65,0 109.65,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-23.98C43.31,-21.53 57.36,-18.25 69.37,-15.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.08,-18.87 79.02,-13.18 68.49,-12.05 70.08,-18.87"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d11/midpoint__integral__method_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/df/d11/midpoint__integral__method_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
deleted file mode 100644
index 02ce30d37..000000000
--- a/df/d11/midpoint__integral__method_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map
+++ /dev/null
@@ -1,24 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,104,55,130"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/atof.html#" title=" " alt="" coords="104,5,173,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="41,102,101,40,103,38,106,42,104,44,45,105"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/byte/atoi.html#" title=" " alt="" coords="104,55,172,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="54,103,93,85,95,90,56,108"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,104,174,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="55,114,87,114,87,120,55,120"/>
-<area shape="rect" id="Node000005" href="$d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" title=" " alt="" coords="119,153,158,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="56,126,106,149,104,154,54,130"/>
-<area shape="rect" id="Node000006" href="$dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="117,203,160,228"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="45,128,104,190,106,191,103,195,101,193,41,132"/>
-<area shape="rect" id="Node000007" href="$df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" title="wrapper interface" alt="" coords="222,195,379,236"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="161,213,206,213,206,218,161,218"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/clear.html#" title=" " alt="" coords="458,161,577,187"/>
-<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="379,198,442,186,443,191,380,203"/>
-<area shape="rect" id="Node000009" href="$df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" title="function that adds parenthesis to the string." alt="" coords="427,235,608,276"/>
-<area shape="poly" id="edge8_Node000007_Node000009" title=" " alt="" coords="380,227,412,233,411,239,379,233"/>
-<area shape="poly" id="edge10_Node000009_Node000009" title=" " alt="" coords="477,235,475,225,481,216,496,211,518,209,541,211,555,217,553,222,539,216,517,214,497,216,485,220,480,226,482,234"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="672,217,794,243"/>
-<area shape="poly" id="edge9_Node000009_Node000010" title=" " alt="" coords="607,242,656,237,656,242,608,248"/>
-<area shape="rect" id="Node000011" 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="656,267,810,292"/>
-<area shape="poly" id="edge11_Node000009_Node000011" title=" " alt="" coords="608,263,640,267,640,272,607,268"/>
-</map>
diff --git a/df/d11/midpoint__integral__method_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/df/d11/midpoint__integral__method_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
deleted file mode 100644
index 694e59ecc..000000000
--- a/df/d11/midpoint__integral__method_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2876d363335959fb324f5f8f8ceb79af
\ No newline at end of file
diff --git a/df/d11/midpoint__integral__method_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/df/d11/midpoint__integral__method_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
deleted file mode 100644
index 868f47a9d..000000000
--- a/df/d11/midpoint__integral__method_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
+++ /dev/null
@@ -1,295 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<!--zoomable 223 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 612;
-var viewHeight = 223;
-var sectionId = 'dynsection-5';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-141.25 0,-141.25 0,-122 37,-122 37,-141.25"/>
-<text text-anchor="middle" x="18.5" y="-127.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/atof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125.75,-215.25 73.75,-215.25 73.75,-196 125.75,-196 125.75,-215.25"/>
-<text text-anchor="middle" x="99.75" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::atof</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.04,-141.71C38.17,-153.39 55.86,-172.92 73,-187.62 73.5,-188.06 74.02,-188.49 74.54,-188.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.11,-191.47 82.19,-194.72 76.34,-185.89 72.11,-191.47"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/atoi.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125.38,-178.25 74.12,-178.25 74.12,-159 125.38,-159 125.38,-178.25"/>
-<text text-anchor="middle" x="99.75" y="-164.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::atoi</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-140.02C46.14,-144.06 56.77,-149.03 66.74,-153.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.26,-156.85 75.8,-157.91 68.22,-150.51 65.26,-156.85"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-141.25 73,-141.25 73,-122 126.5,-122 126.5,-141.25"/>
-<text text-anchor="middle" x="99.75" y="-127.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-131.62C44.56,-131.62 52.97,-131.62 61.25,-131.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.21,-135.13 71.21,-131.63 61.21,-128.13 61.21,-135.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="114.15,-104.25 85.35,-104.25 85.35,-85 114.15,-85 114.15,-104.25"/>
-<text text-anchor="middle" x="99.75" y="-90.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-123.23C48.53,-118.07 62.82,-111.4 74.82,-105.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.08,-109.07 83.66,-101.67 73.12,-102.73 76.08,-109.07"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="116,-67.25 83.5,-67.25 83.5,-48 116,-48 116,-67.25"/>
-<text text-anchor="middle" x="99.75" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.04,-121.54C38.17,-109.86 55.86,-90.33 73,-75.62 73.5,-75.19 74.02,-74.76 74.54,-74.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.34,-77.36 82.19,-68.53 72.11,-71.78 76.34,-77.36"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" target="_top" xlink:title="wrapper interface">
-<polygon fill="white" stroke="#666666" points="280.5,-72.88 162.5,-72.88 162.5,-42.38 280.5,-42.38 280.5,-72.88"/>
-<text text-anchor="start" x="170.5" y="-59.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="221.5" y="-48.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::generate</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.41,-57.62C125.57,-57.62 137.87,-57.62 150.79,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.74,-61.13 160.74,-57.63 150.74,-54.13 150.74,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="428.88,-98.25 339.38,-98.25 339.38,-79 428.88,-79 428.88,-98.25"/>
-<text text-anchor="middle" x="384.12" y="-84.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.94,-68.9C296.24,-71.86 312.68,-75.03 327.81,-77.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.11,-81.38 337.6,-79.84 328.44,-74.51 327.11,-81.38"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" target="_top" xlink:title="function that adds parenthesis to the string.">
-<polygon fill="white" stroke="#666666" points="451.75,-42.88 316.5,-42.88 316.5,-12.37 451.75,-12.37 451.75,-42.88"/>
-<text text-anchor="start" x="324.5" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="384.12" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::makeStrings</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.94,-46.71C288.69,-45.26 296.72,-43.76 304.73,-42.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.33,-45.71 314.52,-40.44 304.05,-38.83 305.33,-45.71"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node9 -->
-<g id="edge10_Node000009_Node000009" class="edge">
-<title>Node9&#45;&gt;Node9</title>
-<g id="a_edge10_Node000009_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M355.51,-43.36C349.67,-52.43 359.21,-60.88 384.12,-60.88 397.75,-60.88 406.78,-58.35 411.21,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.65,-55.24 412.54,-44.86 407.71,-54.29 414.65,-55.24"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="591.5,-56.25 499.75,-56.25 499.75,-37 591.5,-37 591.5,-56.25"/>
-<text text-anchor="middle" x="545.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M451.84,-35.57C463.88,-37.01 476.32,-38.49 488.04,-39.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="487.62,-43.36 497.96,-41.07 488.45,-36.41 487.62,-43.36"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="603.5,-19.25 487.75,-19.25 487.75,0 603.5,0 603.5,-19.25"/>
-<text text-anchor="middle" x="545.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge11_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge11_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M451.84,-20.1C459.85,-19.19 468.04,-18.27 476.07,-17.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="476.24,-20.86 485.78,-16.27 475.45,-13.91 476.24,-20.86"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="midpoint__integral__method_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d11/midpoint__integral__method_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/df/d11/midpoint__integral__method_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
deleted file mode 100644
index 673d7249d..000000000
--- a/df/d11/midpoint__integral__method_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg
+++ /dev/null
@@ -1,212 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="612pt" height="223pt"
- viewBox="0.00 0.00 611.50 223.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 219.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-141.25 0,-141.25 0,-122 37,-122 37,-141.25"/>
-<text text-anchor="middle" x="18.5" y="-127.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/atof.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125.75,-215.25 73.75,-215.25 73.75,-196 125.75,-196 125.75,-215.25"/>
-<text text-anchor="middle" x="99.75" y="-201.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::atof</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.04,-141.71C38.17,-153.39 55.86,-172.92 73,-187.62 73.5,-188.06 74.02,-188.49 74.54,-188.92"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.11,-191.47 82.19,-194.72 76.34,-185.89 72.11,-191.47"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/byte/atoi.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="125.38,-178.25 74.12,-178.25 74.12,-159 125.38,-159 125.38,-178.25"/>
-<text text-anchor="middle" x="99.75" y="-164.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::atoi</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-140.02C46.14,-144.06 56.77,-149.03 66.74,-153.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="65.26,-156.85 75.8,-157.91 68.22,-150.51 65.26,-156.85"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-141.25 73,-141.25 73,-122 126.5,-122 126.5,-141.25"/>
-<text text-anchor="middle" x="99.75" y="-127.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-131.62C44.56,-131.62 52.97,-131.62 61.25,-131.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.21,-135.13 71.21,-131.63 61.21,-128.13 61.21,-135.13"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="114.15,-104.25 85.35,-104.25 85.35,-85 114.15,-85 114.15,-104.25"/>
-<text text-anchor="middle" x="99.75" y="-90.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-123.23C48.53,-118.07 62.82,-111.4 74.82,-105.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.08,-109.07 83.66,-101.67 73.12,-102.73 76.08,-109.07"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="116,-67.25 83.5,-67.25 83.5,-48 116,-48 116,-67.25"/>
-<text text-anchor="middle" x="99.75" y="-53.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.04,-121.54C38.17,-109.86 55.86,-90.33 73,-75.62 73.5,-75.19 74.02,-74.76 74.54,-74.33"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="76.34,-77.36 82.19,-68.53 72.11,-71.78 76.34,-77.36"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160" target="_top" xlink:title="wrapper interface">
-<polygon fill="white" stroke="#666666" points="280.5,-72.88 162.5,-72.88 162.5,-42.38 280.5,-42.38 280.5,-72.88"/>
-<text text-anchor="start" x="170.5" y="-59.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="221.5" y="-48.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::generate</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.41,-57.62C125.57,-57.62 137.87,-57.62 150.79,-57.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.74,-61.13 160.74,-57.63 150.74,-54.13 150.74,-61.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="428.88,-98.25 339.38,-98.25 339.38,-79 428.88,-79 428.88,-98.25"/>
-<text text-anchor="middle" x="384.12" y="-84.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.94,-68.9C296.24,-71.86 312.68,-75.03 327.81,-77.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="327.11,-81.38 337.6,-79.84 328.44,-74.51 327.11,-81.38"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" target="_top" xlink:title="function that adds parenthesis to the string.">
-<polygon fill="white" stroke="#666666" points="451.75,-42.88 316.5,-42.88 316.5,-12.37 451.75,-12.37 451.75,-42.88"/>
-<text text-anchor="start" x="324.5" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="384.12" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::makeStrings</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M280.94,-46.71C288.69,-45.26 296.72,-43.76 304.73,-42.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="305.33,-45.71 314.52,-40.44 304.05,-38.83 305.33,-45.71"/>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node9 -->
-<g id="edge10_Node000009_Node000009" class="edge">
-<title>Node9&#45;&gt;Node9</title>
-<g id="a_edge10_Node000009_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M355.51,-43.36C349.67,-52.43 359.21,-60.88 384.12,-60.88 397.75,-60.88 406.78,-58.35 411.21,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="414.65,-55.24 412.54,-44.86 407.71,-54.29 414.65,-55.24"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="591.5,-56.25 499.75,-56.25 499.75,-37 591.5,-37 591.5,-56.25"/>
-<text text-anchor="middle" x="545.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node10 -->
-<g id="edge9_Node000009_Node000010" class="edge">
-<title>Node9&#45;&gt;Node10</title>
-<g id="a_edge9_Node000009_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M451.84,-35.57C463.88,-37.01 476.32,-38.49 488.04,-39.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="487.62,-43.36 497.96,-41.07 488.45,-36.41 487.62,-43.36"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="603.5,-19.25 487.75,-19.25 487.75,0 603.5,0 603.5,-19.25"/>
-<text text-anchor="middle" x="545.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node9&#45;&gt;Node11 -->
-<g id="edge11_Node000009_Node000011" class="edge">
-<title>Node9&#45;&gt;Node11</title>
-<g id="a_edge11_Node000009_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M451.84,-20.1C459.85,-19.19 468.04,-18.27 476.07,-17.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="476.24,-20.86 485.78,-16.27 475.45,-13.91 476.24,-20.86"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d11/midpoint__integral__method_8cpp_a7072493d1f0f8a91b2a71d4cc456c09c_cgraph.map b/df/d11/midpoint__integral__method_8cpp_a7072493d1f0f8a91b2a71d4cc456c09c_cgraph.map
deleted file mode 100644
index 82204b1c4..000000000
--- a/df/d11/midpoint__integral__method_8cpp_a7072493d1f0f8a91b2a71d4cc456c09c_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="numerical_methods::midpoint_rule::midpoint" name="numerical_methods::midpoint_rule::midpoint">
-<area shape="rect" id="Node000001" title="Main function for implementing the Midpoint Integral Method implementation." alt="" coords="5,72,161,113"/>
-<area shape="poly" id="edge5_Node000001_Node000001" title=" " alt="" coords="48,72,46,63,52,54,64,48,83,46,103,48,115,55,112,59,101,53,83,51,66,53,56,58,52,64,53,71"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/map/at.html#" title=" " alt="" coords="219,5,310,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="134,69,216,35,218,40,136,74"/>
-<area shape="rect" id="Node000003" href="$d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" title=" " alt="" coords="246,55,284,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="160,79,230,70,231,75,161,85"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/map/insert.html#" title=" " alt="" coords="209,104,321,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="161,100,194,105,193,110,160,106"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/isnan.html#" title=" " alt="" coords="226,153,304,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="136,111,218,145,216,149,134,116"/>
-</map>
diff --git a/df/d11/midpoint__integral__method_8cpp_a7072493d1f0f8a91b2a71d4cc456c09c_cgraph.md5 b/df/d11/midpoint__integral__method_8cpp_a7072493d1f0f8a91b2a71d4cc456c09c_cgraph.md5
deleted file mode 100644
index 20e855aed..000000000
--- a/df/d11/midpoint__integral__method_8cpp_a7072493d1f0f8a91b2a71d4cc456c09c_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b5908a5997bbe77a0628c0fe938cbbaa
\ No newline at end of file
diff --git a/df/d11/midpoint__integral__method_8cpp_a7072493d1f0f8a91b2a71d4cc456c09c_cgraph.svg b/df/d11/midpoint__integral__method_8cpp_a7072493d1f0f8a91b2a71d4cc456c09c_cgraph.svg
deleted file mode 100644
index ef1e65437..000000000
--- a/df/d11/midpoint__integral__method_8cpp_a7072493d1f0f8a91b2a71d4cc456c09c_cgraph.svg
+++ /dev/null
@@ -1,129 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::midpoint_rule::midpoint Pages: 1 -->
-<svg width="245pt" height="138pt"
- viewBox="0.00 0.00 244.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>numerical_methods::midpoint_rule::midpoint</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function for implementing the Midpoint Integral Method implementation.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-79.88 0,-79.88 0,-49.38 116.5,-49.38 116.5,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="58.25" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_rule::midpoint</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.08,-80.36C29.15,-89.43 37.21,-97.88 58.25,-97.88 69.76,-97.88 77.38,-95.35 81.12,-91.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.57,-92.2 82.24,-81.86 77.62,-91.4 84.57,-92.2"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.88,-130.25 160.38,-130.25 160.38,-111 228.88,-111 228.88,-130.25"/>
-<text text-anchor="middle" x="194.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::at</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.04,-80.37C116.51,-88.49 140.07,-98.31 159.06,-106.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.66,-109.43 168.24,-110.05 160.36,-102.97 157.66,-109.43"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209.03,-93.25 180.22,-93.25 180.22,-74 209.03,-74 209.03,-93.25"/>
-<text text-anchor="middle" x="194.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.63,-72.74C134.79,-75.31 153.94,-78.01 168.6,-80.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.84,-83.51 178.23,-81.45 168.82,-76.58 167.84,-83.51"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-56.25 152.5,-56.25 152.5,-37 236.75,-37 236.75,-56.25"/>
-<text text-anchor="middle" x="194.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.63,-56.94C124.68,-55.86 132.92,-54.76 140.88,-53.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.34,-57.16 150.79,-52.36 140.41,-50.22 141.34,-57.16"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isnan.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-19.25 165.25,-19.25 165.25,0 224,0 224,-19.25"/>
-<text text-anchor="middle" x="194.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::isnan</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.4,-49.01C116.6,-41.15 139.71,-31.69 158.48,-24.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.63,-27.32 167.56,-20.29 156.98,-20.84 159.63,-27.32"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d11/midpoint__integral__method_8cpp_a7072493d1f0f8a91b2a71d4cc456c09c_cgraph_org.svg b/df/d11/midpoint__integral__method_8cpp_a7072493d1f0f8a91b2a71d4cc456c09c_cgraph_org.svg
deleted file mode 100644
index c87124756..000000000
--- a/df/d11/midpoint__integral__method_8cpp_a7072493d1f0f8a91b2a71d4cc456c09c_cgraph_org.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::midpoint_rule::midpoint Pages: 1 -->
-<svg width="245pt" height="138pt"
- viewBox="0.00 0.00 244.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>numerical_methods::midpoint_rule::midpoint</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function for implementing the Midpoint Integral Method implementation.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-79.88 0,-79.88 0,-49.38 116.5,-49.38 116.5,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="58.25" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_rule::midpoint</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M34.08,-80.36C29.15,-89.43 37.21,-97.88 58.25,-97.88 69.76,-97.88 77.38,-95.35 81.12,-91.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="84.57,-92.2 82.24,-81.86 77.62,-91.4 84.57,-92.2"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/at.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="228.88,-130.25 160.38,-130.25 160.38,-111 228.88,-111 228.88,-130.25"/>
-<text text-anchor="middle" x="194.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::at</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.04,-80.37C116.51,-88.49 140.07,-98.31 159.06,-106.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="157.66,-109.43 168.24,-110.05 160.36,-102.97 157.66,-109.43"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="209.03,-93.25 180.22,-93.25 180.22,-74 209.03,-74 209.03,-93.25"/>
-<text text-anchor="middle" x="194.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">h</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.63,-72.74C134.79,-75.31 153.94,-78.01 168.6,-80.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.84,-83.51 178.23,-81.45 168.82,-76.58 167.84,-83.51"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/map/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="236.75,-56.25 152.5,-56.25 152.5,-37 236.75,-37 236.75,-56.25"/>
-<text text-anchor="middle" x="194.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::map::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.63,-56.94C124.68,-55.86 132.92,-54.76 140.88,-53.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="141.34,-57.16 150.79,-52.36 140.41,-50.22 141.34,-57.16"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/isnan.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="224,-19.25 165.25,-19.25 165.25,0 224,0 224,-19.25"/>
-<text text-anchor="middle" x="194.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::isnan</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.4,-49.01C116.6,-41.15 139.71,-31.69 158.48,-24.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.63,-27.32 167.56,-20.29 156.98,-20.84 159.63,-27.32"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d11/midpoint__integral__method_8cpp_a7ee8e824ef3e138a9a21883b26d97226_cgraph.map b/df/d11/midpoint__integral__method_8cpp_a7ee8e824ef3e138a9a21883b26d97226_cgraph.map
deleted file mode 100644
index 2b5d89551..000000000
--- a/df/d11/midpoint__integral__method_8cpp_a7ee8e824ef3e138a9a21883b26d97226_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="numerical_methods::midpoint_rule::f" name="numerical_methods::midpoint_rule::f">
-<area shape="rect" id="Node000001" title="A function f(x) that will be used to test the method." alt="" coords="5,23,148,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/log.html#" title=" " alt="" coords="198,5,262,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="148,29,183,23,183,29,149,34"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="196,55,265,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="149,52,181,57,180,62,148,57"/>
-</map>
diff --git a/df/d11/midpoint__integral__method_8cpp_a7ee8e824ef3e138a9a21883b26d97226_cgraph.md5 b/df/d11/midpoint__integral__method_8cpp_a7ee8e824ef3e138a9a21883b26d97226_cgraph.md5
deleted file mode 100644
index 6b7d6acf5..000000000
--- a/df/d11/midpoint__integral__method_8cpp_a7ee8e824ef3e138a9a21883b26d97226_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-95174c319ce16b1e911c3cd1702b837a
\ No newline at end of file
diff --git a/df/d11/midpoint__integral__method_8cpp_a7ee8e824ef3e138a9a21883b26d97226_cgraph.svg b/df/d11/midpoint__integral__method_8cpp_a7ee8e824ef3e138a9a21883b26d97226_cgraph.svg
deleted file mode 100644
index dc6648b5f..000000000
--- a/df/d11/midpoint__integral__method_8cpp_a7ee8e824ef3e138a9a21883b26d97226_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::midpoint_rule::f Pages: 1 -->
-<svg width="203pt" height="64pt"
- viewBox="0.00 0.00 202.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>numerical_methods::midpoint_rule::f</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function f(x) that will be used to test the method.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-42.88 0,-42.88 0,-12.37 106.75,-12.37 106.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_rule::f</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/log.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="192.88,-56.25 144.62,-56.25 144.62,-37 192.88,-37 192.88,-56.25"/>
-<text text-anchor="middle" x="168.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::log</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.08,-36.46C115.96,-37.95 124.98,-39.46 133.24,-40.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.41,-44.25 142.85,-42.45 133.56,-37.35 132.41,-44.25"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194.75,-19.25 142.75,-19.25 142.75,0 194.75,0 194.75,-19.25"/>
-<text text-anchor="middle" x="168.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.08,-19.26C115.22,-17.96 123.47,-16.65 131.16,-15.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.48,-18.93 140.8,-13.9 130.38,-12.01 131.48,-18.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d11/midpoint__integral__method_8cpp_a7ee8e824ef3e138a9a21883b26d97226_cgraph_org.svg b/df/d11/midpoint__integral__method_8cpp_a7ee8e824ef3e138a9a21883b26d97226_cgraph_org.svg
deleted file mode 100644
index 5bbeb30da..000000000
--- a/df/d11/midpoint__integral__method_8cpp_a7ee8e824ef3e138a9a21883b26d97226_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::midpoint_rule::f Pages: 1 -->
-<svg width="203pt" height="64pt"
- viewBox="0.00 0.00 202.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>numerical_methods::midpoint_rule::f</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function f(x) that will be used to test the method.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-42.88 0,-42.88 0,-12.37 106.75,-12.37 106.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_rule::f</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/log.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="192.88,-56.25 144.62,-56.25 144.62,-37 192.88,-37 192.88,-56.25"/>
-<text text-anchor="middle" x="168.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::log</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.08,-36.46C115.96,-37.95 124.98,-39.46 133.24,-40.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.41,-44.25 142.85,-42.45 133.56,-37.35 132.41,-44.25"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194.75,-19.25 142.75,-19.25 142.75,0 194.75,0 194.75,-19.25"/>
-<text text-anchor="middle" x="168.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.08,-19.26C115.22,-17.96 123.47,-16.65 131.16,-15.43"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.48,-18.93 140.8,-13.9 130.38,-12.01 131.48,-18.93"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d11/midpoint__integral__method_8cpp_ad53616fb4fa6880ae876bcba53365c51_cgraph.map b/df/d11/midpoint__integral__method_8cpp_ad53616fb4fa6880ae876bcba53365c51_cgraph.map
deleted file mode 100644
index 957063ef3..000000000
--- a/df/d11/midpoint__integral__method_8cpp_ad53616fb4fa6880ae876bcba53365c51_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="numerical_methods::midpoint_rule::l" name="numerical_methods::midpoint_rule::l">
-<area shape="rect" id="Node000001" title="A function l(x) that will be used to test the method." alt="" coords="5,5,148,46"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/log.html#" title=" " alt="" coords="196,13,260,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="148,23,180,23,180,28,148,28"/>
-</map>
diff --git a/df/d11/midpoint__integral__method_8cpp_ad53616fb4fa6880ae876bcba53365c51_cgraph.md5 b/df/d11/midpoint__integral__method_8cpp_ad53616fb4fa6880ae876bcba53365c51_cgraph.md5
deleted file mode 100644
index a3c72b2ec..000000000
--- a/df/d11/midpoint__integral__method_8cpp_ad53616fb4fa6880ae876bcba53365c51_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6d9159f177c4297b5af6c5241d52b0e6
\ No newline at end of file
diff --git a/df/d11/midpoint__integral__method_8cpp_ad53616fb4fa6880ae876bcba53365c51_cgraph.svg b/df/d11/midpoint__integral__method_8cpp_ad53616fb4fa6880ae876bcba53365c51_cgraph.svg
deleted file mode 100644
index cb5a0bbc2..000000000
--- a/df/d11/midpoint__integral__method_8cpp_ad53616fb4fa6880ae876bcba53365c51_cgraph.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::midpoint_rule::l Pages: 1 -->
-<svg width="199pt" height="39pt"
- viewBox="0.00 0.00 199.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>numerical_methods::midpoint_rule::l</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function l(x) that will be used to test the method.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-30.5 0,-30.5 0,0 106.75,0 106.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_rule::l</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/log.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191,-24.88 142.75,-24.88 142.75,-5.63 191,-5.63 191,-24.88"/>
-<text text-anchor="middle" x="166.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::log</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.19,-15.25C115.31,-15.25 123.52,-15.25 131.12,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.95,-18.75 140.95,-15.25 130.95,-11.75 130.95,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d11/midpoint__integral__method_8cpp_ad53616fb4fa6880ae876bcba53365c51_cgraph_org.svg b/df/d11/midpoint__integral__method_8cpp_ad53616fb4fa6880ae876bcba53365c51_cgraph_org.svg
deleted file mode 100644
index 6f998e51c..000000000
--- a/df/d11/midpoint__integral__method_8cpp_ad53616fb4fa6880ae876bcba53365c51_cgraph_org.svg
+++ /dev/null
@@ -1,40 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::midpoint_rule::l Pages: 1 -->
-<svg width="199pt" height="39pt"
- viewBox="0.00 0.00 199.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>numerical_methods::midpoint_rule::l</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function l(x) that will be used to test the method.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-30.5 0,-30.5 0,0 106.75,0 106.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_rule::l</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/log.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="191,-24.88 142.75,-24.88 142.75,-5.63 191,-5.63 191,-24.88"/>
-<text text-anchor="middle" x="166.88" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::log</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.19,-15.25C115.31,-15.25 123.52,-15.25 131.12,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.95,-18.75 140.95,-15.25 130.95,-11.75 130.95,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d11/midpoint__integral__method_8cpp_ae682ee71af44b1e9e884849cc6a6b040_cgraph.map b/df/d11/midpoint__integral__method_8cpp_ae682ee71af44b1e9e884849cc6a6b040_cgraph.map
deleted file mode 100644
index a995b19f1..000000000
--- a/df/d11/midpoint__integral__method_8cpp_ae682ee71af44b1e9e884849cc6a6b040_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="numerical_methods::midpoint_rule::g" name="numerical_methods::midpoint_rule::g">
-<area shape="rect" id="Node000001" title="A function g(x) that will be used to test the method." alt="" coords="5,23,148,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/exp.html#" title=" " alt="" coords="197,5,266,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="148,29,181,24,182,29,149,34"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="196,55,267,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="149,52,181,57,180,62,148,57"/>
-</map>
diff --git a/df/d11/midpoint__integral__method_8cpp_ae682ee71af44b1e9e884849cc6a6b040_cgraph.md5 b/df/d11/midpoint__integral__method_8cpp_ae682ee71af44b1e9e884849cc6a6b040_cgraph.md5
deleted file mode 100644
index b88bc635b..000000000
--- a/df/d11/midpoint__integral__method_8cpp_ae682ee71af44b1e9e884849cc6a6b040_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f8df31e9815a75098a5e8ae0610c8812
\ No newline at end of file
diff --git a/df/d11/midpoint__integral__method_8cpp_ae682ee71af44b1e9e884849cc6a6b040_cgraph.svg b/df/d11/midpoint__integral__method_8cpp_ae682ee71af44b1e9e884849cc6a6b040_cgraph.svg
deleted file mode 100644
index e7e287013..000000000
--- a/df/d11/midpoint__integral__method_8cpp_ae682ee71af44b1e9e884849cc6a6b040_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::midpoint_rule::g Pages: 1 -->
-<svg width="204pt" height="64pt"
- viewBox="0.00 0.00 204.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>numerical_methods::midpoint_rule::g</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function g(x) that will be used to test the method.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-42.88 0,-42.88 0,-12.37 106.75,-12.37 106.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_rule::g</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.12,-56.25 143.88,-56.25 143.88,-37 195.12,-37 195.12,-56.25"/>
-<text text-anchor="middle" x="169.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.09,-36.4C115.65,-37.83 124.33,-39.27 132.38,-40.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.67,-44.04 142.11,-42.23 132.82,-37.14 131.67,-44.04"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.25,-19.25 142.75,-19.25 142.75,0 196.25,0 196.25,-19.25"/>
-<text text-anchor="middle" x="169.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.09,-19.31C115.24,-18.03 123.5,-16.72 131.22,-15.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.58,-18.99 140.92,-13.98 130.49,-12.08 131.58,-18.99"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d11/midpoint__integral__method_8cpp_ae682ee71af44b1e9e884849cc6a6b040_cgraph_org.svg b/df/d11/midpoint__integral__method_8cpp_ae682ee71af44b1e9e884849cc6a6b040_cgraph_org.svg
deleted file mode 100644
index e61a37091..000000000
--- a/df/d11/midpoint__integral__method_8cpp_ae682ee71af44b1e9e884849cc6a6b040_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::midpoint_rule::g Pages: 1 -->
-<svg width="204pt" height="64pt"
- viewBox="0.00 0.00 204.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>numerical_methods::midpoint_rule::g</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function g(x) that will be used to test the method.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-42.88 0,-42.88 0,-12.37 106.75,-12.37 106.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_rule::g</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/exp.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.12,-56.25 143.88,-56.25 143.88,-37 195.12,-37 195.12,-56.25"/>
-<text text-anchor="middle" x="169.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::exp</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.09,-36.4C115.65,-37.83 124.33,-39.27 132.38,-40.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.67,-44.04 142.11,-42.23 132.82,-37.14 131.67,-44.04"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.25,-19.25 142.75,-19.25 142.75,0 196.25,0 196.25,-19.25"/>
-<text text-anchor="middle" x="169.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.09,-19.31C115.24,-18.03 123.5,-16.72 131.22,-15.51"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="131.58,-18.99 140.92,-13.98 130.49,-12.08 131.58,-18.99"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d11/midpoint__integral__method_8cpp_ae9f66040f8e0ba73c1c741261c22a52a_cgraph.map b/df/d11/midpoint__integral__method_8cpp_ae9f66040f8e0ba73c1c741261c22a52a_cgraph.map
deleted file mode 100644
index 8f7cda87c..000000000
--- a/df/d11/midpoint__integral__method_8cpp_ae9f66040f8e0ba73c1c741261c22a52a_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="numerical_methods::midpoint_rule::k" name="numerical_methods::midpoint_rule::k">
-<area shape="rect" id="Node000001" title="A function k(x) that will be used to test the method." alt="" coords="5,23,148,64"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/pow.html#" title=" " alt="" coords="196,5,267,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="148,29,180,24,181,29,149,34"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/math/sqrt.html#" title=" " alt="" coords="197,55,266,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="149,52,181,57,180,62,148,57"/>
-</map>
diff --git a/df/d11/midpoint__integral__method_8cpp_ae9f66040f8e0ba73c1c741261c22a52a_cgraph.md5 b/df/d11/midpoint__integral__method_8cpp_ae9f66040f8e0ba73c1c741261c22a52a_cgraph.md5
deleted file mode 100644
index b824dc2d0..000000000
--- a/df/d11/midpoint__integral__method_8cpp_ae9f66040f8e0ba73c1c741261c22a52a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-78781b1f886d3e8719e34d864778293c
\ No newline at end of file
diff --git a/df/d11/midpoint__integral__method_8cpp_ae9f66040f8e0ba73c1c741261c22a52a_cgraph.svg b/df/d11/midpoint__integral__method_8cpp_ae9f66040f8e0ba73c1c741261c22a52a_cgraph.svg
deleted file mode 100644
index 75c005910..000000000
--- a/df/d11/midpoint__integral__method_8cpp_ae9f66040f8e0ba73c1c741261c22a52a_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::midpoint_rule::k Pages: 1 -->
-<svg width="204pt" height="64pt"
- viewBox="0.00 0.00 204.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>numerical_methods::midpoint_rule::k</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function k(x) that will be used to test the method.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-42.88 0,-42.88 0,-12.37 106.75,-12.37 106.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_rule::k</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.25,-56.25 142.75,-56.25 142.75,-37 196.25,-37 196.25,-56.25"/>
-<text text-anchor="middle" x="169.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.09,-36.4C115.24,-37.76 123.5,-39.13 131.22,-40.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.48,-43.84 140.92,-42.03 131.63,-36.94 130.48,-43.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.5,-19.25 143.5,-19.25 143.5,0 195.5,0 195.5,-19.25"/>
-<text text-anchor="middle" x="169.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.09,-19.31C115.39,-18 123.82,-16.67 131.66,-15.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.18,-18.9 141.52,-13.88 131.09,-11.98 132.18,-18.9"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d11/midpoint__integral__method_8cpp_ae9f66040f8e0ba73c1c741261c22a52a_cgraph_org.svg b/df/d11/midpoint__integral__method_8cpp_ae9f66040f8e0ba73c1c741261c22a52a_cgraph_org.svg
deleted file mode 100644
index 02a3345d3..000000000
--- a/df/d11/midpoint__integral__method_8cpp_ae9f66040f8e0ba73c1c741261c22a52a_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: numerical_methods::midpoint_rule::k Pages: 1 -->
-<svg width="204pt" height="64pt"
- viewBox="0.00 0.00 204.25 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>numerical_methods::midpoint_rule::k</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A function k(x) that will be used to test the method.">
-<polygon fill="#999999" stroke="#666666" points="106.75,-42.88 0,-42.88 0,-12.37 106.75,-12.37 106.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods::</text>
-<text text-anchor="middle" x="53.38" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">midpoint_rule::k</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/pow.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="196.25,-56.25 142.75,-56.25 142.75,-37 196.25,-37 196.25,-56.25"/>
-<text text-anchor="middle" x="169.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::pow</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.09,-36.4C115.24,-37.76 123.5,-39.13 131.22,-40.42"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="130.48,-43.84 140.92,-42.03 131.63,-36.94 130.48,-43.84"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195.5,-19.25 143.5,-19.25 143.5,0 195.5,0 195.5,-19.25"/>
-<text text-anchor="middle" x="169.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::sqrt</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.09,-19.31C115.39,-18 123.82,-16.67 131.66,-15.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="132.18,-18.9 141.52,-13.88 131.09,-11.98 132.18,-18.9"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d11/midpoint__integral__method_8cpp_source.html b/df/d11/midpoint__integral__method_8cpp_source.html
new file mode 100644
index 000000000..da9289eb6
--- /dev/null
+++ b/df/d11/midpoint__integral__method_8cpp_source.html
@@ -0,0 +1,270 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/midpoint_integral_method.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/d11/midpoint__integral__method_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">midpoint_integral_method.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../df/d11/midpoint__integral__method_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cassert&gt;</span>     </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;cmath&gt;</span>       </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;cstdint&gt;</span>     </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;cstdlib&gt;</span>     </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;functional&gt;</span>  </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &lt;iostream&gt;</span>    </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;map&gt;</span>         </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a> {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/daa/namespacemidpoint__rule.html">midpoint_rule</a> {</div>
+<div class="foldopen" id="foldopen00052" data-start="{" data-end="}">
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"><a class="line" href="../../df/d11/midpoint__integral__method_8cpp.html#a7072493d1f0f8a91b2a71d4cc456c09c">   52</a></span><span class="keywordtype">double</span> <a class="code hl_function" href="../../df/d11/midpoint__integral__method_8cpp.html#a7072493d1f0f8a91b2a71d4cc456c09c">midpoint</a>(<span class="keyword">const</span> std::int32_t N, <span class="keyword">const</span> <span class="keywordtype">double</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, <span class="keyword">const</span> <span class="keywordtype">double</span> a,</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>                <span class="keyword">const</span> std::function&lt;<span class="keywordtype">double</span>(<span class="keywordtype">double</span>)&gt;&amp; func) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    std::map&lt;int, double&gt;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>        data_table;  <span class="comment">// Contains the data points, key: i, value: f(xi)</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordtype">double</span> xi = a;   <span class="comment">// Initialize xi to the starting point x0 = a</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span> </div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="comment">// Create the data table</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="comment">// Loop from x0 to xN-1</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordtype">double</span> temp = NAN;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">for</span> (std::int32_t i = 0; i &lt; N; i++) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        temp = func(xi + <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> / 2);  <span class="comment">// find f(xi+h/2)</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        data_table.insert(</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            std::pair&lt;std::int32_t, double&gt;(i, temp));  <span class="comment">// add i and f(xi)</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        xi += <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>;  <span class="comment">// Get the next point xi for the next iteration</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="comment">// Evaluate the integral.</span></div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="comment">// Remember: {f(x0+h/2) + f(x1+h/2) + ... + f(xN-1+h/2)}</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    <span class="keywordtype">double</span> evaluate_integral = 0;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keywordflow">for</span> (std::int32_t i = 0; i &lt; N; i++) evaluate_integral += data_table.at(i);</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="comment">// Multiply by the coefficient h</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    evaluate_integral *= <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>;</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="comment">// If the result calculated is nan, then the user has given wrong input</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="comment">// interval.</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    assert(!std::isnan(evaluate_integral) &amp;&amp;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>           <span class="stringliteral">&quot;The definite integral can&#39;t be evaluated. Check the validity of &quot;</span></div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>           <span class="stringliteral">&quot;your input.\n&quot;</span>);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="comment">// Else return</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">return</span> evaluate_integral;</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>}</div>
+</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="../../df/d11/midpoint__integral__method_8cpp.html#a7ee8e824ef3e138a9a21883b26d97226">   90</a></span><span class="keywordtype">double</span> f(<span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> std::sqrt(x) + std::log(x); }</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"><a class="line" href="../../df/d11/midpoint__integral__method_8cpp.html#ae682ee71af44b1e9e884849cc6a6b040">   97</a></span><span class="keywordtype">double</span> g(<span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> std::exp(-x) * (4 - std::pow(x, 2)); }</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"><a class="line" href="../../df/d11/midpoint__integral__method_8cpp.html#ae9f66040f8e0ba73c1c741261c22a52a">  103</a></span><span class="keywordtype">double</span> k(<span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> std::sqrt(2 * std::pow(x, 3) + 3); }</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"><a class="line" href="../../df/d11/midpoint__integral__method_8cpp.html#ad53616fb4fa6880ae876bcba53365c51">  109</a></span><span class="keywordtype">double</span> l(<span class="keywordtype">double</span> x) { <span class="keywordflow">return</span> x + std::log(2 * x + 1); }</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span> </div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>}  <span class="comment">// namespace midpoint_rule</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>}  <span class="comment">// namespace numerical_methods</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
+<div class="foldopen" id="foldopen00123" data-start="{" data-end="}">
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"><a class="line" href="../../df/d11/midpoint__integral__method_8cpp.html#a2ae48a41e43dc6ab11b962742349646e">  123</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(std::int32_t N, <span class="keywordtype">double</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, <span class="keywordtype">double</span> a, <span class="keywordtype">double</span> b,</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>                 <span class="keywordtype">bool</span> used_argv_parameters) {</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    <span class="comment">// Call midpoint() for each of the test functions f, g, k, l</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    <span class="comment">// Assert with two decimal point precision</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    <span class="keywordtype">double</span> result_f = numerical_methods::midpoint_rule::midpoint(</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>        N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::midpoint_rule::f);</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    assert((used_argv_parameters || (result_f &gt;= 4.09 &amp;&amp; result_f &lt;= 4.10)) &amp;&amp;</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>           <span class="stringliteral">&quot;The result of f(x) is wrong&quot;</span>);</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The result of integral f(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_f &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span> </div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    <span class="keywordtype">double</span> result_g = numerical_methods::midpoint_rule::midpoint(</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>        N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::midpoint_rule::g);</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    assert((used_argv_parameters || (result_g &gt;= 0.27 &amp;&amp; result_g &lt;= 0.28)) &amp;&amp;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>           <span class="stringliteral">&quot;The result of g(x) is wrong&quot;</span>);</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The result of integral g(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_g &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span> </div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <span class="keywordtype">double</span> result_k = numerical_methods::midpoint_rule::midpoint(</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::midpoint_rule::k);</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    assert((used_argv_parameters || (result_k &gt;= 9.06 &amp;&amp; result_k &lt;= 9.07)) &amp;&amp;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>           <span class="stringliteral">&quot;The result of k(x) is wrong&quot;</span>);</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The result of integral k(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_k &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span> </div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    <span class="keywordtype">double</span> result_l = numerical_methods::midpoint_rule::midpoint(</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, numerical_methods::midpoint_rule::l);</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    assert((used_argv_parameters || (result_l &gt;= 7.16 &amp;&amp; result_l &lt;= 7.17)) &amp;&amp;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>           <span class="stringliteral">&quot;The result of l(x) is wrong&quot;</span>);</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;The result of integral l(x) on interval [&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> &lt;&lt; b</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>              &lt;&lt; <span class="stringliteral">&quot;] is equal to: &quot;</span> &lt;&lt; result_l &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>}</div>
+</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span> </div>
+<div class="foldopen" id="foldopen00162" data-start="{" data-end="}">
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"><a class="line" href="../../df/d11/midpoint__integral__method_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">  162</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span>** argv) {</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    std::int32_t N =</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>        16;  </div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    <span class="keywordtype">double</span> a = 1, b = 3;  </div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = NAN;  </div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span> </div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    <span class="keywordtype">bool</span> used_argv_parameters =</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>        <span class="keyword">false</span>;  <span class="comment">// If argv parameters are used then the assert must be omitted</span></div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <span class="comment">// for the test cases</span></div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span> </div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>    <span class="comment">// Get user input (by the command line parameters or the console after</span></div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    <span class="comment">// displaying messages)</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    <span class="keywordflow">if</span> (argc == 4) {</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>        N = std::atoi(argv[1]);</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        a = std::atof(argv[2]);</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>        b = std::atof(argv[3]);</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        <span class="comment">// Check if a&lt;b else abort</span></div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>        assert(a &lt; b &amp;&amp; <span class="stringliteral">&quot;a has to be less than b&quot;</span>);</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>        assert(N &gt; 0 &amp;&amp; <span class="stringliteral">&quot;N has to be &gt; 0&quot;</span>);</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>        <span class="keywordflow">if</span> (N &lt; 4 || a != 1 || b != 3) {</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>            used_argv_parameters = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        }</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;You selected N=&quot;</span> &lt;&lt; N &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>                  &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Default N=&quot;</span> &lt;&lt; N &lt;&lt; <span class="stringliteral">&quot;, a=&quot;</span> &lt;&lt; a &lt;&lt; <span class="stringliteral">&quot;, b=&quot;</span> &lt;&lt; b</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>                  &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span>    }</div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span> </div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>    <span class="comment">// Find the step</span></div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> = (b - a) / N;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span> </div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(N, <a class="code hl_function" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, a, b, used_argv_parameters);  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span> </div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>}</div>
+</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00082">generate_parentheses.cpp:82</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00045">hash_search.cpp:45</a></div></div>
+<div class="ttc" id="amidpoint__integral__method_8cpp_html_a7072493d1f0f8a91b2a71d4cc456c09c"><div class="ttname"><a href="../../df/d11/midpoint__integral__method_8cpp.html#a7072493d1f0f8a91b2a71d4cc456c09c">numerical_methods::midpoint_rule::midpoint</a></div><div class="ttdeci">double midpoint(const std::int32_t N, const double h, const double a, const std::function&lt; double(double)&gt; &amp;func)</div><div class="ttdoc">Main function for implementing the Midpoint Integral Method implementation.</div><div class="ttdef"><b>Definition</b> <a href="#l00052">midpoint_integral_method.cpp:52</a></div></div>
+<div class="ttc" id="anamespacemidpoint__rule_html"><div class="ttname"><a href="../../d9/daa/namespacemidpoint__rule.html">midpoint_rule</a></div><div class="ttdoc">Functions for the Midpoint Integral method implementation.</div></div>
+<div class="ttc" id="anamespacenumerical__methods_html"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></div><div class="ttdoc">for assert</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../df/d11/midpoint__integral__method_8cpp.html">midpoint_integral_method.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/d14/bellman__ford_8cpp_source.html b/df/d14/bellman__ford_8cpp_source.html
new file mode 100644
index 000000000..3be968618
--- /dev/null
+++ b/df/d14/bellman__ford_8cpp_source.html
@@ -0,0 +1,264 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/bellman_ford.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/d14/bellman__ford_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">bellman_ford.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;climits&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span> </div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment">// Wrapper class for storing an edge</span></div>
+<div class="foldopen" id="foldopen00008" data-start="{" data-end="};">
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"><a class="line" href="../../d7/d77/class_edge.html">    8</a></span><span class="keyword">class </span><a class="code hl_struct" href="../../d7/d77/class_edge.html">Edge</a> {</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    <span class="keywordtype">int</span> src, dst, weight;</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>};</div>
+</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment">// Wrapper class for storing a graph</span></div>
+<div class="foldopen" id="foldopen00014" data-start="{" data-end="};">
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"><a class="line" href="../../da/d9a/class_graph.html">   14</a></span><span class="keyword">class </span><a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> {</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <span class="keywordtype">int</span> vertexNum, edgeNum;</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    std::vector&lt;Edge&gt; edges;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    <span class="comment">// Constructs a graph with V vertices and E edges</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    <a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a>(<span class="keywordtype">int</span> V, <span class="keywordtype">int</span> E) {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>        this-&gt;vertexNum = V;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        this-&gt;edgeNum = E;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        this-&gt;edges.reserve(E);</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    }</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="comment">// Adds the given edge to the graph</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordtype">void</span> addEdge(<span class="keywordtype">int</span> src, <span class="keywordtype">int</span> dst, <span class="keywordtype">int</span> weight) {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        <span class="keyword">static</span> <span class="keywordtype">int</span> edgeInd = 0;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>        <span class="keywordflow">if</span> (edgeInd &lt; this-&gt;edgeNum) {</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>            <a class="code hl_struct" href="../../d7/d77/class_edge.html">Edge</a> newEdge;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>            newEdge.src = src;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>            newEdge.dst = dst;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>            newEdge.weight = weight;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>            this-&gt;edges[edgeInd++] = newEdge;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        }</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    }</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>};</div>
+</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="comment">// Utility function to print distances</span></div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="keywordtype">void</span> print(<span class="keyword">const</span> std::vector&lt;int&gt;&amp; dist, <span class="keywordtype">int</span> V) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    cout &lt;&lt; <span class="stringliteral">&quot;\nVertex  Distance&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        <span class="keywordflow">if</span> (dist[i] != INT_MAX)</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>            cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span> &lt;&lt; dist[i] &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            cout &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;\tINF&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    }</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>}</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="comment">// The main function that finds the shortest path from given source</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="comment">// to all other vertices using Bellman-Ford.It also detects negative</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="comment">// weight cycle</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="keywordtype">void</span> BellmanFord(<a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, <span class="keywordtype">int</span> src) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    <span class="keywordtype">int</span> V = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.vertexNum;</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordtype">int</span> E = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edgeNum;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    std::vector&lt;int&gt; dist;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    dist.reserve(E);</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span> </div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="comment">// Initialize distances array as INF for all except source</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="comment">// Intialize source as zero</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) dist[i] = INT_MAX;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    dist[src] = 0;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="comment">// Calculate shortest path distance from source to all edges</span></div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="comment">// A path can contain maximum (|V|-1) edges</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= V - 1; i++)</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; E; j++) {</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>            <span class="keywordtype">int</span> u = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edges[j].src;</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            <span class="keywordtype">int</span> v = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edges[j].dst;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            <span class="keywordtype">int</span> w = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edges[j].weight;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            <span class="keywordflow">if</span> (dist[u] != INT_MAX &amp;&amp; dist[u] + w &lt; dist[v])</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>                dist[v] = dist[u] + w;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        }</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    <span class="comment">// Iterate inner loop once more to check for negative cycle</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; E; j++) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        <span class="keywordtype">int</span> u = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edges[j].src;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        <span class="keywordtype">int</span> v = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edges[j].dst;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="keywordtype">int</span> w = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edges[j].weight;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <span class="keywordflow">if</span> (dist[u] != INT_MAX &amp;&amp; dist[u] + w &lt; dist[v]) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>            cout &lt;&lt; <span class="stringliteral">&quot;Graph contains negative weight cycle. Hence, shortest &quot;</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>                    <span class="stringliteral">&quot;distance not guaranteed.&quot;</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>                 &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    print(dist, V);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>}</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span> </div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span><span class="comment">// Driver Function</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <span class="keywordtype">int</span> V, E, gsrc;</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keywordtype">int</span> src, dst, weight;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    cout &lt;&lt; <span class="stringliteral">&quot;Enter number of vertices: &quot;</span>;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    cin &gt;&gt; V;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    cout &lt;&lt; <span class="stringliteral">&quot;Enter number of edges: &quot;</span>;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    cin &gt;&gt; E;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    <a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> G(V, E);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; E; i++) {</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nEdge &quot;</span> &lt;&lt; i + 1 &lt;&lt; <span class="stringliteral">&quot;\nEnter source: &quot;</span>;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        cin &gt;&gt; src;</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>        cout &lt;&lt; <span class="stringliteral">&quot;Enter destination: &quot;</span>;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>        cin &gt;&gt; dst;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        cout &lt;&lt; <span class="stringliteral">&quot;Enter weight: &quot;</span>;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>        cin &gt;&gt; weight;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        G.addEdge(src, dst, weight);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    }</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    cout &lt;&lt; <span class="stringliteral">&quot;\nEnter source: &quot;</span>;</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    cin &gt;&gt; gsrc;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    BellmanFord(G, gsrc);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>}</div>
+<div class="ttc" id="aclass_edge_html"><div class="ttname"><a href="../../d7/d77/class_edge.html">Edge</a></div><div class="ttdef"><b>Definition</b> <a href="#l00008">bellman_ford.cpp:8</a></div></div>
+<div class="ttc" id="aclass_graph_html"><div class="ttname"><a href="../../da/d9a/class_graph.html">Graph</a></div><div class="ttdef"><b>Definition</b> <a href="#l00014">bellman_ford.cpp:14</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></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><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><b>bellman_ford.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/d1c/namespacestack__using__queue.html b/df/d1c/namespacestack__using__queue.html
index 24266705e..23e5ec5b2 100644
--- a/df/d1c/namespacestack__using__queue.html
+++ b/df/d1c/namespacestack__using__queue.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: stack_using_queue Namespace Reference</title>
+<title>TheAlgorithms/C++: stack_using_queue Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/df/d28/dsu__union__rank_8cpp.html b/df/d28/dsu__union__rank_8cpp.html
index 6e598a3cf..a50ddf23e 100644
--- a/df/d28/dsu__union__rank_8cpp.html
+++ b/df/d28/dsu__union__rank_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/dsu_union_rank.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/dsu_union_rank.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for dsu_union_rank.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/dda/dsu__union__rank_8cpp__incl.svg" width="336" height="126"><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">
+</div>
+<p><a href="../../df/d28/dsu__union__rank_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d1f/classdsu.html">dsu</a></td></tr>
@@ -146,6 +165,8 @@ Functions</h2></td></tr>
 <p>dsu : It is a very powerful data structure which keeps track of different clusters(sets) of elements, these sets are disjoint(doesnot have a common
 element). Disjoint sets uses cases : for finding connected components in a graph, used in Kruskal's algorithm for finding <a class="el" href="../../d4/d12/namespace_minimum.html" title="Implementation of Minimum Edit Distance algorithm.">Minimum</a> Spanning tree. Operations that can be performed: 1) UnionSet(i,j): add(element i and j to the set) 2) findSet(i): returns the representative of the set to which i belogngs to. 3) getParents(i): prints the parent of i and so on and so forth. Below is the class-based approach which uses the heuristic of union-ranks. Using union-rank in findSet(i),we are able to get to the representative of i in slightly delayed O(logN) time but it allows us to keep tracks of the parent of i. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AayushVyasKIIT" target="_blank">AayushVyasKIIT</a> </dd></dl>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d3/dae/dsu__path__compression_8cpp.html" title="DSU (Disjoint sets)">dsu_path_compression.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html">dsu_union_rank.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -164,20 +185,17 @@ element). Disjoint sets uses cases : for finding connected components in a graph
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html#l00183">183</a> of file <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html">dsu_union_rank.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  183</span>           {</div>
 <div class="line"><span class="lineno">  184</span>    <a class="code hl_function" href="#ae7880ce913f3058a35ff106d5be9e243">test1</a>();  <span class="comment">// run 1st test case</span></div>
 <div class="line"><span class="lineno">  185</span>    <a class="code hl_function" href="#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>();  <span class="comment">// run 2nd test case</span></div>
 <div class="line"><span class="lineno">  186</span> </div>
 <div class="line"><span class="lineno">  187</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  188</span>}</div>
-<div class="ttc" id="adsu__union__rank_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> dsu_union_rank.cpp:158</div></div>
-<div class="ttc" id="adsu__union__rank_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-implementations, 1st test.</div><div class="ttdef"><b>Definition</b> dsu_union_rank.cpp:134</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="602" height="138"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="adsu__union__rank_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d28/dsu__union__rank_8cpp_source.html#l00158">dsu_union_rank.cpp:158</a></div></div>
+<div class="ttc" id="adsu__union__rank_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-implementations, 1st test.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d28/dsu__union__rank_8cpp_source.html#l00134">dsu_union_rank.cpp:134</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae7880ce913f3058a35ff106d5be9e243" name="ae7880ce913f3058a35ff106d5be9e243"></a>
@@ -208,11 +226,13 @@ Here is the call graph for this function:</div>
 <p>&lt; number of elements</p>
 <p>&lt; object of class disjoint sets</p>
 <p>&lt; performs union operation on 1 and 2</p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html#l00134">134</a> of file <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html">dsu_union_rank.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  134</span>                    {</div>
 <div class="line"><span class="lineno">  135</span>    <span class="comment">/* checks the parents in the resultant structures */</span></div>
-<div class="line"><span class="lineno">  136</span>    uint64_t n = 10;   <span class="comment">///&lt; number of elements</span></div>
-<div class="line"><span class="lineno">  137</span>    <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1);      <span class="comment">///&lt; object of class disjoint sets</span></div>
-<div class="line"><span class="lineno">  138</span>    d.unionSet(2, 1);  <span class="comment">///&lt; performs union operation on 1 and 2</span></div>
+<div class="line"><span class="lineno">  136</span>    uint64_t n = 10;   </div>
+<div class="line"><span class="lineno">  137</span>    <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1);      </div>
+<div class="line"><span class="lineno">  138</span>    d.unionSet(2, 1);  </div>
 <div class="line"><span class="lineno">  139</span>    d.unionSet(1, 4);</div>
 <div class="line"><span class="lineno">  140</span>    d.unionSet(8, 1);</div>
 <div class="line"><span class="lineno">  141</span>    d.unionSet(3, 5);</div>
@@ -221,23 +241,16 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  144</span>    d.unionSet(9, 10);</div>
 <div class="line"><span class="lineno">  145</span>    d.unionSet(2, 10);</div>
 <div class="line"><span class="lineno">  146</span>    <span class="comment">// keeping track of the changes using parent pointers</span></div>
-<div class="line"><span class="lineno">  147</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;uint64_t&gt;</a> ans = {7, 5};</div>
+<div class="line"><span class="lineno">  147</span>    vector&lt;uint64_t&gt; ans = {7, 5};</div>
 <div class="line"><span class="lineno">  148</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; ans.size(); i++) {</div>
 <div class="line"><span class="lineno">  149</span>        assert(d.getParents(7).at(i) ==</div>
 <div class="line"><span class="lineno">  150</span>               ans[i]);  <span class="comment">// makes sure algorithm works fine</span></div>
 <div class="line"><span class="lineno">  151</span>    }</div>
-<div class="line"><span class="lineno">  152</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;1st test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><span class="lineno">  152</span>    cout &lt;&lt; <span class="stringliteral">&quot;1st test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">  153</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="aclassdsu_html"><div class="ttname"><a href="../../dd/d1f/classdsu.html">dsu</a></div><div class="ttdoc">Disjoint sets union data structure, class based representation.</div><div class="ttdef"><b>Definition</b> dsu_path_compression.cpp:34</div></div>
-<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> matrix_exponentiation.cpp:36</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg" width="504" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassdsu_html"><div class="ttname"><a href="../../dd/d1f/classdsu.html">dsu</a></div><div class="ttdoc">Disjoint sets union data structure, class based representation.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00034">dsu_path_compression.cpp:34</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a45d94ead4cf4e1ff9f87c38bc99f59ae" name="a45d94ead4cf4e1ff9f87c38bc99f59ae"></a>
@@ -270,11 +283,13 @@ Here is the call graph for this function:</div>
 <p>performs union operation on 1 and 2</p>
 <p>keeping track of the changes using parent pointers</p>
 <p>makes sure algorithm works fine</p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html#l00158">158</a> of file <a class="el" href="../../df/d28/dsu__union__rank_8cpp_source.html">dsu_union_rank.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  158</span>                    {</div>
 <div class="line"><span class="lineno">  159</span>    <span class="comment">// checks the parents in the resultant structures</span></div>
-<div class="line"><span class="lineno">  160</span>    uint64_t n = 10;   <span class="comment">///&lt; number of elements</span></div>
-<div class="line"><span class="lineno">  161</span>    <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1);      <span class="comment">///&lt; object of class disjoint sets</span></div>
-<div class="line"><span class="lineno">  162</span>    d.unionSet(2, 1);  <span class="comment">/// performs union operation on 1 and 2</span></div>
+<div class="line"><span class="lineno">  160</span>    uint64_t n = 10;   </div>
+<div class="line"><span class="lineno">  161</span>    <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1);      </div>
+<div class="line"><span class="lineno">  162</span>    d.unionSet(2, 1);  </div>
 <div class="line"><span class="lineno">  163</span>    d.unionSet(1, 4);</div>
 <div class="line"><span class="lineno">  164</span>    d.unionSet(8, 1);</div>
 <div class="line"><span class="lineno">  165</span>    d.unionSet(3, 5);</div>
@@ -282,21 +297,15 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  167</span>    d.unionSet(5, 7);</div>
 <div class="line"><span class="lineno">  168</span>    d.unionSet(9, 10);</div>
 <div class="line"><span class="lineno">  169</span>    d.unionSet(2, 10);</div>
-<div class="line"><span class="lineno">  170</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  171</span><span class="comment">    /// keeping track of the changes using parent pointers</span></div>
-<div class="line"><span class="lineno">  172</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;uint64_t&gt;</a> ans = {2, 1, 10};</div>
+<div class="line"><span class="lineno">  170</span> </div>
+<div class="line"><span class="lineno">  172</span>    vector&lt;uint64_t&gt; ans = {2, 1, 10};</div>
 <div class="line"><span class="lineno">  173</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; ans.size(); i++) {</div>
 <div class="line"><span class="lineno">  174</span>        assert(d.getParents(2).at(i) ==</div>
-<div class="line"><span class="lineno">  175</span>               ans[i]);  <span class="comment">/// makes sure algorithm works fine</span></div>
+<div class="line"><span class="lineno">  175</span>               ans[i]);  </div>
 <div class="line"><span class="lineno">  176</span>    }</div>
-<div class="line"><span class="lineno">  177</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;2nd test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><span class="lineno">  177</span>    cout &lt;&lt; <span class="stringliteral">&quot;2nd test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">  178</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg" width="504" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.map b/df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.map
deleted file mode 100644
index b6d01eb57..000000000
--- a/df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="test2" name="test2">
-<area shape="rect" id="Node000001" title="Self&#45;implementations, 2nd test." alt="" coords="5,31,56,56"/>
-<area shape="rect" id="Node000002" href="$dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280" title="Method to print all the parents of i, or the path from i to representative." alt="" coords="104,5,217,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,36,88,30,89,35,56,41"/>
-<area shape="rect" id="Node000003" href="$dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="110,55,211,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,45,95,53,94,58,55,51"/>
-<area shape="rect" id="Node000004" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="407,29,499,55"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="206,51,265,40,330,35,392,36,392,41,331,41,265,45,207,57"/>
-<area shape="rect" id="Node000005" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="265,55,359,80"/>
-<area shape="poly" id="edge5_Node000003_Node000005" title=" " alt="" coords="211,65,249,65,249,70,211,70"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="273,104,351,130"/>
-<area shape="poly" id="edge7_Node000003_Node000006" title=" " alt="" coords="203,78,259,97,258,102,202,84"/>
-<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="429,30,424,21,427,11,437,5,453,3,470,5,480,12,476,16,468,10,453,8,439,10,431,14,429,20,433,28"/>
-<area shape="poly" id="edge6_Node000005_Node000004" title=" " alt="" coords="359,56,392,50,393,56,360,62"/>
-</map>
diff --git a/df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.md5 b/df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.md5
deleted file mode 100644
index 875ba33c0..000000000
--- a/df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d1e99c0a23b6cc37f6d88d019fd6b459
\ No newline at end of file
diff --git a/df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg b/df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg
deleted file mode 100644
index e558b2cda..000000000
--- a/df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph.svg
+++ /dev/null
@@ -1,155 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="378pt" height="101pt"
- viewBox="0.00 0.00 378.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;implementations, 2nd test.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-74.25 0,-74.25 0,-55 37.75,-55 37.75,-74.25"/>
-<text text-anchor="middle" x="18.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280" target="_top" xlink:title="Method to print all the parents of i, or the path from i to representative.">
-<polygon fill="white" stroke="#666666" points="158.75,-93.25 73.75,-93.25 73.75,-74 158.75,-74 158.75,-93.25"/>
-<text text-anchor="middle" x="116.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::getParents</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.81,-68.2C44.87,-69.6 53.38,-71.3 62.13,-73.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.28,-76.44 71.77,-74.96 62.65,-69.58 61.28,-76.44"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="154.25,-56.25 78.25,-56.25 78.25,-37 154.25,-37 154.25,-56.25"/>
-<text text-anchor="middle" x="116.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::unionSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.81,-61.24C46.14,-59.67 56.47,-57.72 66.85,-55.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.37,-59.22 76.55,-53.93 66.07,-52.34 67.37,-59.22"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="370,-75.25 301.5,-75.25 301.5,-56 370,-56 370,-75.25"/>
-<text text-anchor="middle" x="335.75" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.88,-56.74C164.38,-60.3 180.17,-63.86 194.75,-65.62 226.42,-69.45 262.42,-69.35 289.98,-68.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.88,-71.86 299.72,-67.94 289.58,-64.86 289.88,-71.86"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="265.5,-56.25 194.75,-56.25 194.75,-37 265.5,-37 265.5,-56.25"/>
-<text text-anchor="middle" x="230.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge5_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge5_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.5,-46.62C163.63,-46.62 173.51,-46.62 183,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.79,-50.13 192.79,-46.63 182.79,-43.13 182.79,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.5,-19.25 200.75,-19.25 200.75,0 259.5,0 259.5,-19.25"/>
-<text text-anchor="middle" x="230.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge7_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge7_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.82,-36.51C160.79,-32.23 176.06,-27.17 189.85,-22.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.68,-26.03 199.08,-19.56 188.48,-19.38 190.68,-26.03"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M319.21,-75.54C311.67,-84.15 317.18,-93.25 335.75,-93.25 345.9,-93.25 352.15,-90.53 354.5,-86.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="357.97,-86.15 352.58,-77.02 351.1,-87.51 357.97,-86.15"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge6_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M265.92,-53C273.67,-54.43 282,-55.95 290.08,-57.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.32,-60.85 299.79,-59.21 290.58,-53.97 289.32,-60.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg b/df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg
deleted file mode 100644
index 1396932cb..000000000
--- a/df/d28/dsu__union__rank_8cpp_a45d94ead4cf4e1ff9f87c38bc99f59ae_cgraph_org.svg
+++ /dev/null
@@ -1,129 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test2 Pages: 1 -->
-<svg width="378pt" height="101pt"
- viewBox="0.00 0.00 378.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test2</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;implementations, 2nd test.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-74.25 0,-74.25 0,-55 37.75,-55 37.75,-74.25"/>
-<text text-anchor="middle" x="18.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280" target="_top" xlink:title="Method to print all the parents of i, or the path from i to representative.">
-<polygon fill="white" stroke="#666666" points="158.75,-93.25 73.75,-93.25 73.75,-74 158.75,-74 158.75,-93.25"/>
-<text text-anchor="middle" x="116.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::getParents</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.81,-68.2C44.87,-69.6 53.38,-71.3 62.13,-73.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.28,-76.44 71.77,-74.96 62.65,-69.58 61.28,-76.44"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="154.25,-56.25 78.25,-56.25 78.25,-37 154.25,-37 154.25,-56.25"/>
-<text text-anchor="middle" x="116.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::unionSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.81,-61.24C46.14,-59.67 56.47,-57.72 66.85,-55.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.37,-59.22 76.55,-53.93 66.07,-52.34 67.37,-59.22"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="370,-75.25 301.5,-75.25 301.5,-56 370,-56 370,-75.25"/>
-<text text-anchor="middle" x="335.75" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.88,-56.74C164.38,-60.3 180.17,-63.86 194.75,-65.62 226.42,-69.45 262.42,-69.35 289.98,-68.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.88,-71.86 299.72,-67.94 289.58,-64.86 289.88,-71.86"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="265.5,-56.25 194.75,-56.25 194.75,-37 265.5,-37 265.5,-56.25"/>
-<text text-anchor="middle" x="230.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge5_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge5_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.5,-46.62C163.63,-46.62 173.51,-46.62 183,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.79,-50.13 192.79,-46.63 182.79,-43.13 182.79,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.5,-19.25 200.75,-19.25 200.75,0 259.5,0 259.5,-19.25"/>
-<text text-anchor="middle" x="230.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge7_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge7_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.82,-36.51C160.79,-32.23 176.06,-27.17 189.85,-22.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.68,-26.03 199.08,-19.56 188.48,-19.38 190.68,-26.03"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M319.21,-75.54C311.67,-84.15 317.18,-93.25 335.75,-93.25 345.9,-93.25 352.15,-90.53 354.5,-86.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="357.97,-86.15 352.58,-77.02 351.1,-87.51 357.97,-86.15"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge6_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M265.92,-53C273.67,-54.43 282,-55.95 290.08,-57.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.32,-60.85 299.79,-59.21 290.58,-53.97 289.32,-60.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 74926c3f2..000000000
--- a/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,21 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,32,55,58"/>
-<area shape="rect" id="Node000002" href="$df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" title="Self&#45;implementations, 1st test." alt="" coords="103,7,153,32"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,36,87,27,89,32,56,41"/>
-<area shape="rect" id="Node000008" href="$df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" title="Self&#45;implementations, 2nd test." alt="" coords="103,56,153,82"/>
-<area shape="poly" id="edge9_Node000001_Node000008" title=" " alt="" coords="56,48,89,57,87,62,54,53"/>
-<area shape="rect" id="Node000003" href="$dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280" title="Method to print all the parents of i, or the path from i to representative." alt="" coords="201,7,314,32"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,17,185,17,185,22,153,22"/>
-<area shape="rect" id="Node000004" href="$dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="207,56,308,82"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="154,26,209,48,207,53,152,31"/>
-<area shape="rect" id="Node000005" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="505,31,596,56"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="309,62,489,46,489,51,309,67"/>
-<area shape="rect" id="Node000006" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="362,5,457,31"/>
-<area shape="poly" id="edge6_Node000004_Node000006" title=" " alt="" coords="298,53,354,34,355,39,299,58"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="370,107,449,132"/>
-<area shape="poly" id="edge8_Node000004_Node000007" title=" " alt="" coords="299,80,356,99,355,104,298,85"/>
-<area shape="poly" id="edge5_Node000005_Node000005" title=" " alt="" coords="526,31,521,22,524,13,534,6,550,4,568,7,577,13,574,18,566,12,550,9,536,11,528,16,527,22,531,29"/>
-<area shape="poly" id="edge7_Node000006_Node000005" title=" " alt="" coords="458,24,490,30,489,35,457,29"/>
-<area shape="poly" id="edge10_Node000008_Node000003" title=" " alt="" coords="152,57,207,36,209,41,154,62"/>
-<area shape="poly" id="edge11_Node000008_Node000004" title=" " alt="" coords="153,66,192,66,192,72,153,72"/>
-</map>
diff --git a/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 3e062e9cd..000000000
--- a/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-dac6f7ebedee78270a24ea5e106a593a
\ No newline at end of file
diff --git a/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index becad455c..000000000
--- a/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,209 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="451pt" height="103pt"
- viewBox="0.00 0.00 451.00 103.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 99.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-75.25 0,-75.25 0,-56 37,-56 37,-75.25"/>
-<text text-anchor="middle" x="18.5" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title="Self&#45;implementations, 1st test.">
-<polygon fill="white" stroke="#666666" points="110.75,-94.25 73,-94.25 73,-75 110.75,-75 110.75,-94.25"/>
-<text text-anchor="middle" x="91.88" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-70.32C44.64,-72.32 53.57,-74.69 61.98,-76.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.91,-80.27 71.48,-79.46 62.71,-73.51 60.91,-80.27"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title="Self&#45;implementations, 2nd test.">
-<polygon fill="white" stroke="#666666" points="110.75,-57.25 73,-57.25 73,-38 110.75,-38 110.75,-57.25"/>
-<text text-anchor="middle" x="91.88" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge9_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge9_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-61.18C44.64,-59.29 53.57,-57.03 61.98,-54.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.63,-58.36 71.47,-52.52 60.92,-51.57 62.63,-58.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280" target="_top" xlink:title="Method to print all the parents of i, or the path from i to representative.">
-<polygon fill="white" stroke="#666666" points="231.75,-94.25 146.75,-94.25 146.75,-75 231.75,-75 231.75,-94.25"/>
-<text text-anchor="middle" x="189.25" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::getParents</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.81,-84.62C117.79,-84.62 126.19,-84.62 134.84,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.74,-88.13 144.74,-84.63 134.74,-81.13 134.74,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="227.25,-57.25 151.25,-57.25 151.25,-38 227.25,-38 227.25,-57.25"/>
-<text text-anchor="middle" x="189.25" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::unionSet</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.81,-77.67C122.42,-73.16 137.95,-67.14 152.05,-61.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153,-65.05 161.06,-58.17 150.47,-58.53 153,-65.05"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="443,-76.25 374.5,-76.25 374.5,-57 443,-57 443,-76.25"/>
-<text text-anchor="middle" x="408.75" y="-62.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M227.64,-50.89C265.11,-54.16 322.83,-59.21 362.78,-62.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="362.28,-66.17 372.55,-63.55 362.89,-59.19 362.28,-66.17"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="338.5,-95.25 267.75,-95.25 267.75,-76 338.5,-76 338.5,-95.25"/>
-<text text-anchor="middle" x="303.12" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge6_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge6_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.94,-57.71C232.81,-62.08 248.08,-67.27 261.94,-71.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.66,-75.24 271.25,-75.14 262.91,-68.61 260.66,-75.24"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="332.5,-19.25 273.75,-19.25 273.75,0 332.5,0 332.5,-19.25"/>
-<text text-anchor="middle" x="303.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge8_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge8_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.94,-37.54C233.01,-33.1 248.56,-27.82 262.6,-23.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="263.68,-26.38 272.03,-19.85 261.43,-19.75 263.68,-26.38"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M392.21,-76.54C384.67,-85.15 390.18,-94.25 408.75,-94.25 418.9,-94.25 425.15,-91.53 427.5,-87.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="430.97,-87.15 425.58,-78.02 424.1,-88.51 430.97,-87.15"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge7_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge7_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M338.92,-79.25C346.67,-77.82 355,-76.3 363.08,-74.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="363.58,-78.28 372.79,-73.04 362.32,-71.4 363.58,-78.28"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node3 -->
-<g id="edge10_Node000008_Node000003" class="edge">
-<title>Node8&#45;&gt;Node3</title>
-<g id="a_edge10_Node000008_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.81,-54.58C122.42,-59.09 137.95,-65.11 152.05,-70.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.47,-73.72 161.06,-74.08 153,-67.2 150.47,-73.72"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge11_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge11_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.81,-47.62C119.14,-47.62 129.47,-47.62 139.85,-47.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.52,-51.13 149.52,-47.63 139.52,-44.13 139.52,-51.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 686391eb5..000000000
--- a/df/d28/dsu__union__rank_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,183 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="451pt" height="103pt"
- viewBox="0.00 0.00 451.00 103.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 99.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-75.25 0,-75.25 0,-56 37,-56 37,-75.25"/>
-<text text-anchor="middle" x="18.5" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243" target="_top" xlink:title="Self&#45;implementations, 1st test.">
-<polygon fill="white" stroke="#666666" points="110.75,-94.25 73,-94.25 73,-75 110.75,-75 110.75,-94.25"/>
-<text text-anchor="middle" x="91.88" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-70.32C44.64,-72.32 53.57,-74.69 61.98,-76.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.91,-80.27 71.48,-79.46 62.71,-73.51 60.91,-80.27"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae" target="_top" xlink:title="Self&#45;implementations, 2nd test.">
-<polygon fill="white" stroke="#666666" points="110.75,-57.25 73,-57.25 73,-38 110.75,-38 110.75,-57.25"/>
-<text text-anchor="middle" x="91.88" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">test2</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge9_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge9_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-61.18C44.64,-59.29 53.57,-57.03 61.98,-54.91"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.63,-58.36 71.47,-52.52 60.92,-51.57 62.63,-58.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280" target="_top" xlink:title="Method to print all the parents of i, or the path from i to representative.">
-<polygon fill="white" stroke="#666666" points="231.75,-94.25 146.75,-94.25 146.75,-75 231.75,-75 231.75,-94.25"/>
-<text text-anchor="middle" x="189.25" y="-80.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::getParents</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.81,-84.62C117.79,-84.62 126.19,-84.62 134.84,-84.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.74,-88.13 144.74,-84.63 134.74,-81.13 134.74,-88.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="227.25,-57.25 151.25,-57.25 151.25,-38 227.25,-38 227.25,-57.25"/>
-<text text-anchor="middle" x="189.25" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::unionSet</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.81,-77.67C122.42,-73.16 137.95,-67.14 152.05,-61.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153,-65.05 161.06,-58.17 150.47,-58.53 153,-65.05"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="443,-76.25 374.5,-76.25 374.5,-57 443,-57 443,-76.25"/>
-<text text-anchor="middle" x="408.75" y="-62.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M227.64,-50.89C265.11,-54.16 322.83,-59.21 362.78,-62.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="362.28,-66.17 372.55,-63.55 362.89,-59.19 362.28,-66.17"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="338.5,-95.25 267.75,-95.25 267.75,-76 338.5,-76 338.5,-95.25"/>
-<text text-anchor="middle" x="303.12" y="-81.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge6_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge6_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.94,-57.71C232.81,-62.08 248.08,-67.27 261.94,-71.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.66,-75.24 271.25,-75.14 262.91,-68.61 260.66,-75.24"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="332.5,-19.25 273.75,-19.25 273.75,0 332.5,0 332.5,-19.25"/>
-<text text-anchor="middle" x="303.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node7 -->
-<g id="edge8_Node000004_Node000007" class="edge">
-<title>Node4&#45;&gt;Node7</title>
-<g id="a_edge8_Node000004_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M219.94,-37.54C233.01,-33.1 248.56,-27.82 262.6,-23.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="263.68,-26.38 272.03,-19.85 261.43,-19.75 263.68,-26.38"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M392.21,-76.54C384.67,-85.15 390.18,-94.25 408.75,-94.25 418.9,-94.25 425.15,-91.53 427.5,-87.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="430.97,-87.15 425.58,-78.02 424.1,-88.51 430.97,-87.15"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node5 -->
-<g id="edge7_Node000006_Node000005" class="edge">
-<title>Node6&#45;&gt;Node5</title>
-<g id="a_edge7_Node000006_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M338.92,-79.25C346.67,-77.82 355,-76.3 363.08,-74.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="363.58,-78.28 372.79,-73.04 362.32,-71.4 363.58,-78.28"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node3 -->
-<g id="edge10_Node000008_Node000003" class="edge">
-<title>Node8&#45;&gt;Node3</title>
-<g id="a_edge10_Node000008_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.81,-54.58C122.42,-59.09 137.95,-65.11 152.05,-70.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.47,-73.72 161.06,-74.08 153,-67.2 150.47,-73.72"/>
-</a>
-</g>
-</g>
-<!-- Node8&#45;&gt;Node4 -->
-<g id="edge11_Node000008_Node000004" class="edge">
-<title>Node8&#45;&gt;Node4</title>
-<g id="a_edge11_Node000008_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.81,-47.62C119.14,-47.62 129.47,-47.62 139.85,-47.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.52,-51.13 149.52,-47.63 139.52,-44.13 139.52,-51.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map b/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map
deleted file mode 100644
index 0177e75c0..000000000
--- a/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="test1" name="test1">
-<area shape="rect" id="Node000001" title="Self&#45;implementations, 1st test." alt="" coords="5,31,56,56"/>
-<area shape="rect" id="Node000002" href="$dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280" title="Method to print all the parents of i, or the path from i to representative." alt="" coords="104,5,217,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,36,88,30,89,35,56,41"/>
-<area shape="rect" id="Node000003" href="$dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f" title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com..." alt="" coords="110,55,211,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,45,95,53,94,58,55,51"/>
-<area shape="rect" id="Node000004" href="$dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" title="Method to find the representative of the set to which i belongs to, T(n) = O(1)" alt="" coords="407,29,499,55"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="206,51,265,40,330,35,392,36,392,41,331,41,265,45,207,57"/>
-<area shape="rect" id="Node000005" href="$dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" title="A utility function which check whether i and j belongs to same set or not." alt="" coords="265,55,359,80"/>
-<area shape="poly" id="edge5_Node000003_Node000005" title=" " alt="" coords="211,65,249,65,249,70,211,70"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="273,104,351,130"/>
-<area shape="poly" id="edge7_Node000003_Node000006" title=" " alt="" coords="203,78,259,97,258,102,202,84"/>
-<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="429,30,424,21,427,11,437,5,453,3,470,5,480,12,476,16,468,10,453,8,439,10,431,14,429,20,433,28"/>
-<area shape="poly" id="edge6_Node000005_Node000004" title=" " alt="" coords="359,56,392,50,393,56,360,62"/>
-</map>
diff --git a/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5 b/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5
deleted file mode 100644
index 9d27fa8f4..000000000
--- a/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ab21a1520d6bf943e1068afc32495f26
\ No newline at end of file
diff --git a/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg b/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg
deleted file mode 100644
index 279d27842..000000000
--- a/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph.svg
+++ /dev/null
@@ -1,155 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="378pt" height="101pt"
- viewBox="0.00 0.00 378.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;implementations, 1st test.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-74.25 0,-74.25 0,-55 37.75,-55 37.75,-74.25"/>
-<text text-anchor="middle" x="18.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280" target="_top" xlink:title="Method to print all the parents of i, or the path from i to representative.">
-<polygon fill="white" stroke="#666666" points="158.75,-93.25 73.75,-93.25 73.75,-74 158.75,-74 158.75,-93.25"/>
-<text text-anchor="middle" x="116.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::getParents</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.81,-68.2C44.87,-69.6 53.38,-71.3 62.13,-73.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.28,-76.44 71.77,-74.96 62.65,-69.58 61.28,-76.44"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="154.25,-56.25 78.25,-56.25 78.25,-37 154.25,-37 154.25,-56.25"/>
-<text text-anchor="middle" x="116.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::unionSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.81,-61.24C46.14,-59.67 56.47,-57.72 66.85,-55.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.37,-59.22 76.55,-53.93 66.07,-52.34 67.37,-59.22"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="370,-75.25 301.5,-75.25 301.5,-56 370,-56 370,-75.25"/>
-<text text-anchor="middle" x="335.75" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.88,-56.74C164.38,-60.3 180.17,-63.86 194.75,-65.62 226.42,-69.45 262.42,-69.35 289.98,-68.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.88,-71.86 299.72,-67.94 289.58,-64.86 289.88,-71.86"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="265.5,-56.25 194.75,-56.25 194.75,-37 265.5,-37 265.5,-56.25"/>
-<text text-anchor="middle" x="230.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge5_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge5_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.5,-46.62C163.63,-46.62 173.51,-46.62 183,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.79,-50.13 192.79,-46.63 182.79,-43.13 182.79,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.5,-19.25 200.75,-19.25 200.75,0 259.5,0 259.5,-19.25"/>
-<text text-anchor="middle" x="230.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge7_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge7_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.82,-36.51C160.79,-32.23 176.06,-27.17 189.85,-22.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.68,-26.03 199.08,-19.56 188.48,-19.38 190.68,-26.03"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M319.21,-75.54C311.67,-84.15 317.18,-93.25 335.75,-93.25 345.9,-93.25 352.15,-90.53 354.5,-86.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="357.97,-86.15 352.58,-77.02 351.1,-87.51 357.97,-86.15"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge6_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M265.92,-53C273.67,-54.43 282,-55.95 290.08,-57.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.32,-60.85 299.79,-59.21 290.58,-53.97 289.32,-60.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg b/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg
deleted file mode 100644
index 0b4a5e35b..000000000
--- a/df/d28/dsu__union__rank_8cpp_ae7880ce913f3058a35ff106d5be9e243_cgraph_org.svg
+++ /dev/null
@@ -1,129 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test1 Pages: 1 -->
-<svg width="378pt" height="101pt"
- viewBox="0.00 0.00 378.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>test1</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;implementations, 1st test.">
-<polygon fill="#999999" stroke="#666666" points="37.75,-74.25 0,-74.25 0,-55 37.75,-55 37.75,-74.25"/>
-<text text-anchor="middle" x="18.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">test1</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280" target="_top" xlink:title="Method to print all the parents of i, or the path from i to representative.">
-<polygon fill="white" stroke="#666666" points="158.75,-93.25 73.75,-93.25 73.75,-74 158.75,-74 158.75,-93.25"/>
-<text text-anchor="middle" x="116.25" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::getParents</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.81,-68.2C44.87,-69.6 53.38,-71.3 62.13,-73.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.28,-76.44 71.77,-74.96 62.65,-69.58 61.28,-76.44"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f" target="_top" xlink:title="Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...">
-<polygon fill="white" stroke="#666666" points="154.25,-56.25 78.25,-56.25 78.25,-37 154.25,-37 154.25,-56.25"/>
-<text text-anchor="middle" x="116.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::unionSet</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.81,-61.24C46.14,-59.67 56.47,-57.72 66.85,-55.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="67.37,-59.22 76.55,-53.93 66.07,-52.34 67.37,-59.22"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c" target="_top" xlink:title="Method to find the representative of the set to which i belongs to, T(n) = O(1)">
-<polygon fill="white" stroke="#666666" points="370,-75.25 301.5,-75.25 301.5,-56 370,-56 370,-75.25"/>
-<text text-anchor="middle" x="335.75" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::findSet</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.88,-56.74C164.38,-60.3 180.17,-63.86 194.75,-65.62 226.42,-69.45 262.42,-69.35 289.98,-68.35"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.88,-71.86 299.72,-67.94 289.58,-64.86 289.88,-71.86"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303" target="_top" xlink:title="A utility function which check whether i and j belongs to same set or not.">
-<polygon fill="white" stroke="#666666" points="265.5,-56.25 194.75,-56.25 194.75,-37 265.5,-37 265.5,-56.25"/>
-<text text-anchor="middle" x="230.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">dsu::isSame</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge5_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge5_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.5,-46.62C163.63,-46.62 173.51,-46.62 183,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.79,-50.13 192.79,-46.63 182.79,-43.13 182.79,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="259.5,-19.25 200.75,-19.25 200.75,0 259.5,0 259.5,-19.25"/>
-<text text-anchor="middle" x="230.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge7_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge7_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M147.82,-36.51C160.79,-32.23 176.06,-27.17 189.85,-22.61"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.68,-26.03 199.08,-19.56 188.48,-19.38 190.68,-26.03"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M319.21,-75.54C311.67,-84.15 317.18,-93.25 335.75,-93.25 345.9,-93.25 352.15,-90.53 354.5,-86.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="357.97,-86.15 352.58,-77.02 351.1,-87.51 357.97,-86.15"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge6_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge6_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M265.92,-53C273.67,-54.43 282,-55.95 290.08,-57.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="289.32,-60.85 299.79,-59.21 290.58,-53.97 289.32,-60.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d28/dsu__union__rank_8cpp_source.html b/df/d28/dsu__union__rank_8cpp_source.html
new file mode 100644
index 000000000..254ea9aa6
--- /dev/null
+++ b/df/d28/dsu__union__rank_8cpp_source.html
@@ -0,0 +1,277 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/dsu_union_rank.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/d28/dsu__union__rank_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">dsu_union_rank.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../df/d28/dsu__union__rank_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;vector&gt;</span>    </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">using </span>std::cout;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">using </span>std::endl;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">using </span>std::vector;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="keyword">class </span><a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    vector&lt;uint64_t&gt; <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>;        </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    vector&lt;uint64_t&gt; <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>;    </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    vector&lt;uint64_t&gt; <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>;  </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00045" data-start="{" data-end="}">
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72">   45</a></span>    <span class="keyword">explicit</span> <a class="code hl_function" href="../../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72">dsu</a>(uint64_t n) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>.assign(n, 0);</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>.assign(n, 0);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>.assign(n, 0);</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>            <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] = i;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[i] = 0;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>            <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[i] = 1;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        }</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">   62</a></span>    uint64_t <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(uint64_t i) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        <span class="keywordflow">while</span> (i != <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i]) {</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>            i = <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i];</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <span class="keywordflow">return</span> i;</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00076" data-start="{" data-end="}">
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">   76</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a>(uint64_t i, uint64_t j) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">isSame</a>(i, j)) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        }</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        uint64_t x = <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        uint64_t y = <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(j);</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span> </div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] &gt; <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>            std::swap(x, y);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        }</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[x] = y;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[x] == <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]) {</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>            <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">depth</a>[y]++;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        }</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[y] += <a class="code hl_variable" href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">setSize</a>[x];</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00108" data-start="{" data-end="}">
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">  108</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">isSame</a>(uint64_t i, uint64_t j) {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(i) == <a class="code hl_function" href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">findSet</a>(j)) {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        }</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    }</div>
+</div>
+<div class="foldopen" id="foldopen00120" data-start="{" data-end="}">
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"><a class="line" href="../../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280">  120</a></span>    vector&lt;uint64_t&gt; <a class="code hl_function" href="../../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280">getParents</a>(uint64_t i) {</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        vector&lt;uint64_t&gt; ans;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        <span class="keywordflow">while</span> (<a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i] != i) {</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>            ans.push_back(i);</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>            i = <a class="code hl_variable" href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">p</a>[i];</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>        }</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>        ans.push_back(i);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <span class="keywordflow">return</span> ans;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    }</div>
+</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>};</div>
+<div class="foldopen" id="foldopen00134" data-start="{" data-end="}">
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"><a class="line" href="../../df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">  134</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>() {</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    <span class="comment">/* checks the parents in the resultant structures */</span></div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    uint64_t n = 10;   </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1);      </div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a>(2, 1);  </div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a>(1, 4);</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a>(8, 1);</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a>(3, 5);</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a>(5, 6);</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a>(5, 7);</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a>(9, 10);</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a>(2, 10);</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    <span class="comment">// keeping track of the changes using parent pointers</span></div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    vector&lt;uint64_t&gt; ans = {7, 5};</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; ans.size(); i++) {</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>        assert(d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280">getParents</a>(7).at(i) ==</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>               ans[i]);  <span class="comment">// makes sure algorithm works fine</span></div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    }</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>    cout &lt;&lt; <span class="stringliteral">&quot;1st test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00158" data-start="{" data-end="}">
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"><a class="line" href="../../df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">  158</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>() {</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    <span class="comment">// checks the parents in the resultant structures</span></div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    uint64_t n = 10;   </div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>    <a class="code hl_class" href="../../dd/d1f/classdsu.html">dsu</a> d(n + 1);      </div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a>(2, 1);  </div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a>(1, 4);</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a>(8, 1);</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a>(3, 5);</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a>(5, 6);</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a>(5, 7);</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a>(9, 10);</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">unionSet</a>(2, 10);</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span> </div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    vector&lt;uint64_t&gt; ans = {2, 1, 10};</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; ans.size(); i++) {</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        assert(d.<a class="code hl_function" href="../../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280">getParents</a>(2).at(i) ==</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>               ans[i]);  </div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    }</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    cout &lt;&lt; <span class="stringliteral">&quot;2nd test passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>}</div>
+</div>
+<div class="foldopen" id="foldopen00183" data-start="{" data-end="}">
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"><a class="line" href="../../df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  183</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>    <a class="code hl_function" href="../../df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>();  <span class="comment">// run 1st test case</span></div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    <a class="code hl_function" href="../../df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>();  <span class="comment">// run 2nd test case</span></div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span> </div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>}</div>
+</div>
+<div class="ttc" id="aclassdsu_html"><div class="ttname"><a href="../../dd/d1f/classdsu.html">dsu</a></div><div class="ttdoc">Disjoint sets union data structure, class based representation.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00034">dsu_path_compression.cpp:34</a></div></div>
+<div class="ttc" id="aclassdsu_html_a126e3002a464e53cd54b07ba56482a72"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72">dsu::dsu</a></div><div class="ttdeci">dsu(uint64_t n)</div><div class="ttdoc">constructor for initialising all data members</div><div class="ttdef"><b>Definition</b> <a href="#l00045">dsu_union_rank.cpp:45</a></div></div>
+<div class="ttc" id="aclassdsu_html_a16851f78fe390fc1430905c83d6a2f1c"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c">dsu::findSet</a></div><div class="ttdeci">uint64_t findSet(uint64_t i)</div><div class="ttdoc">Method to find the representative of the set to which i belongs to, T(n) = O(logN)</div><div class="ttdef"><b>Definition</b> <a href="#l00062">dsu_union_rank.cpp:62</a></div></div>
+<div class="ttc" id="aclassdsu_html_a1ef0b0462a0dda63514f641cbb7dd8cb"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb">dsu::p</a></div><div class="ttdeci">vector&lt; uint64_t &gt; p</div><div class="ttdoc">keeps track of the parent of ith element</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00036">dsu_path_compression.cpp:36</a></div></div>
+<div class="ttc" id="aclassdsu_html_a4bf54d33fba178998dbbe4c57f2e9429"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429">dsu::depth</a></div><div class="ttdeci">vector&lt; uint64_t &gt; depth</div><div class="ttdoc">tracks the depth(rank) of i in the tree</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00037">dsu_path_compression.cpp:37</a></div></div>
+<div class="ttc" id="aclassdsu_html_a64d25c5986742f7c234ed449b2ff7303"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">dsu::isSame</a></div><div class="ttdeci">bool isSame(uint64_t i, uint64_t j)</div><div class="ttdoc">A utility function which check whether i and j belongs to same set or not.</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00124">dsu_path_compression.cpp:124</a></div></div>
+<div class="ttc" id="aclassdsu_html_a81897528bdb53fd5e796d75d7dbc430f"><div class="ttname"><a href="../../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">dsu::unionSet</a></div><div class="ttdeci">void unionSet(uint64_t i, uint64_t j)</div><div class="ttdoc">Method that combines two disjoint sets to which i and j belongs to and make a single set having a com...</div><div class="ttdef"><b>Definition</b> <a href="#l00076">dsu_union_rank.cpp:76</a></div></div>
+<div class="ttc" id="aclassdsu_html_ab8ee27083a3c2e2df80755165a2ec280"><div class="ttname"><a href="../../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280">dsu::getParents</a></div><div class="ttdeci">vector&lt; uint64_t &gt; getParents(uint64_t i)</div><div class="ttdoc">Method to print all the parents of i, or the path from i to representative.</div><div class="ttdef"><b>Definition</b> <a href="#l00120">dsu_union_rank.cpp:120</a></div></div>
+<div class="ttc" id="aclassdsu_html_ac0dc3e17e49fe19b159b4ea4096d7b55"><div class="ttname"><a href="../../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">dsu::setSize</a></div><div class="ttdeci">vector&lt; uint64_t &gt; setSize</div><div class="ttdoc">size of each chunk(set)</div><div class="ttdef"><b>Definition</b> <a href="../../d3/dae/dsu__path__compression_8cpp_source.html#l00038">dsu_path_compression.cpp:38</a></div></div>
+<div class="ttc" id="adsu__union__rank_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition</b> <a href="#l00158">dsu_union_rank.cpp:158</a></div></div>
+<div class="ttc" id="adsu__union__rank_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00183">dsu_union_rank.cpp:183</a></div></div>
+<div class="ttc" id="adsu__union__rank_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">Self-implementations, 1st test.</div><div class="ttdef"><b>Definition</b> <a href="#l00134">dsu_union_rank.cpp:134</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../df/d28/dsu__union__rank_8cpp.html">dsu_union_rank.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/d2c/elliptic__curve__key__exchange_8cpp.html b/df/d2c/elliptic__curve__key__exchange_8cpp.html
index 0686e7a40..a7b9d79dc 100644
--- a/df/d2c/elliptic__curve__key__exchange_8cpp.html
+++ b/df/d2c/elliptic__curve__key__exchange_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ciphers/elliptic_curve_key_exchange.cpp File Reference</title>
+<title>TheAlgorithms/C++: ciphers/elliptic_curve_key_exchange.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for elliptic_curve_key_exchange.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d83/elliptic__curve__key__exchange_8cpp__incl.svg" width="547" height="272"><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">
+</div>
+<p><a href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">ciphers::elliptic_curve_key_exchange::Point</a></td></tr>
@@ -172,6 +191,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of <a href="https://cryptobook.nakov.com/asymmetric-key-ciphers/ecdh-key-exchange" target="_blank">Elliptic Curve Diffie Hellman Key Exchange</a>. </p>
 <p>The ECDH (Elliptic Curve Diffie–Hellman Key Exchange) is anonymous key agreement scheme, which allows two parties, each having an elliptic-curve public–private key pair, to establish a shared secret over an insecure channel. ECDH is very similar to the classical DHKE (Diffie–Hellman Key Exchange) algorithm, but it uses ECC point multiplication instead of modular exponentiations. ECDH is based on the following property of EC points: (a * G) * b = (b * G) * a If we have two secret numbers a and b (two private keys, belonging to Alice and Bob) and an ECC elliptic curve with generator point G, we can exchange over an insecure channel the values (a * G) and (b * G) (the public keys of Alice and Bob) and then we can derive a shared secret: secret = (a * G) * b = (b * G) * a. Pretty simple. The above equation takes the following form: alicePubKey * bobPrivKey = bobPubKey * alicePrivKey = secret </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AshishYUO" target="_blank">Ashish Daulatabad</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html">elliptic_curve_key_exchange.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -190,21 +211,18 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00320">320</a> of file <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html">elliptic_curve_key_exchange.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  320</span>           {</div>
 <div class="line"><span class="lineno">  321</span>    <a class="code hl_function" href="#a8800c8a84d77dadadb05ad5e83b77ef4">uint128_t_tests</a>();  <span class="comment">// running predefined 128-bit unsigned integer tests</span></div>
 <div class="line"><span class="lineno">  322</span>    <a class="code hl_function" href="#a37775d1724ffe404c088dabbc8da91ae">uint256_t_tests</a>();  <span class="comment">// running predefined 256-bit unsigned integer tests</span></div>
 <div class="line"><span class="lineno">  323</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();             <span class="comment">// running self-test implementations</span></div>
 <div class="line"><span class="lineno">  324</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  325</span>}</div>
-<div class="ttc" id="aelliptic__curve__key__exchange_8cpp_html_a37775d1724ffe404c088dabbc8da91ae"><div class="ttname"><a href="#a37775d1724ffe404c088dabbc8da91ae">uint256_t_tests</a></div><div class="ttdeci">static void uint256_t_tests()</div><div class="ttdoc">Function to test the uint256_t header.</div><div class="ttdef"><b>Definition</b> elliptic_curve_key_exchange.cpp:230</div></div>
-<div class="ttc" id="aelliptic__curve__key__exchange_8cpp_html_a8800c8a84d77dadadb05ad5e83b77ef4"><div class="ttname"><a href="#a8800c8a84d77dadadb05ad5e83b77ef4">uint128_t_tests</a></div><div class="ttdeci">static void uint128_t_tests()</div><div class="ttdoc">Function to test the uint128_t header.</div><div class="ttdef"><b>Definition</b> elliptic_curve_key_exchange.cpp:197</div></div>
-<div class="ttc" id="aelliptic__curve__key__exchange_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the provided algorithm above.</div><div class="ttdef"><b>Definition</b> elliptic_curve_key_exchange.cpp:267</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="338" height="159"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aelliptic__curve__key__exchange_8cpp_html_a37775d1724ffe404c088dabbc8da91ae"><div class="ttname"><a href="#a37775d1724ffe404c088dabbc8da91ae">uint256_t_tests</a></div><div class="ttdeci">static void uint256_t_tests()</div><div class="ttdoc">Function to test the uint256_t header.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00230">elliptic_curve_key_exchange.cpp:230</a></div></div>
+<div class="ttc" id="aelliptic__curve__key__exchange_8cpp_html_a8800c8a84d77dadadb05ad5e83b77ef4"><div class="ttname"><a href="#a8800c8a84d77dadadb05ad5e83b77ef4">uint128_t_tests</a></div><div class="ttdeci">static void uint128_t_tests()</div><div class="ttdoc">Function to test the uint128_t header.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00197">elliptic_curve_key_exchange.cpp:197</a></div></div>
+<div class="ttc" id="aelliptic__curve__key__exchange_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the provided algorithm above.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00267">elliptic_curve_key_exchange.cpp:267</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -232,6 +250,8 @@ Here is the call graph for this function:</div>
 
 <p>Function to test the provided algorithm above. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00267">267</a> of file <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html">elliptic_curve_key_exchange.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  267</span>                   {</div>
 <div class="line"><span class="lineno">  268</span>    <span class="comment">// demonstration of key exchange using curve secp112r1</span></div>
 <div class="line"><span class="lineno">  269</span> </div>
@@ -247,22 +267,22 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  279</span> </div>
 <div class="line"><span class="lineno">  280</span>    <span class="comment">// Shared key generation.</span></div>
 <div class="line"><span class="lineno">  281</span>    <span class="comment">// For alice</span></div>
-<div class="line"><span class="lineno">  282</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;For alice:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  282</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;For alice:\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  283</span>    <span class="comment">// Alice&#39;s private key (can be generated randomly)</span></div>
 <div class="line"><span class="lineno">  284</span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> alice_private_key(<span class="stringliteral">&quot;164330438812053169644452143505618&quot;</span>);</div>
 <div class="line"><span class="lineno">  285</span>    <a class="code hl_struct" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">ciphers::elliptic_curve_key_exchange::Point</a> alice_public_key =</div>
 <div class="line"><span class="lineno">  286</span>        <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">multiply</a>(ptr, a, alice_private_key, mod);</div>
-<div class="line"><span class="lineno">  287</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tPrivate key: &quot;</span> &lt;&lt; alice_private_key &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  288</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tPublic Key: &quot;</span> &lt;&lt; alice_public_key &lt;&lt; <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">  287</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tPrivate key: &quot;</span> &lt;&lt; alice_private_key &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  288</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tPublic Key: &quot;</span> &lt;&lt; alice_public_key &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  289</span> </div>
 <div class="line"><span class="lineno">  290</span>    <span class="comment">// For Bob</span></div>
-<div class="line"><span class="lineno">  291</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;For Bob:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  291</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;For Bob:\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  292</span>    <span class="comment">// Bob&#39;s private key (can be generated randomly)</span></div>
 <div class="line"><span class="lineno">  293</span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> bob_private_key(<span class="stringliteral">&quot;1959473333748537081510525763478373&quot;</span>);</div>
 <div class="line"><span class="lineno">  294</span>    <a class="code hl_struct" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">ciphers::elliptic_curve_key_exchange::Point</a> bob_public_key =</div>
 <div class="line"><span class="lineno">  295</span>        <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">multiply</a>(ptr, a, bob_private_key, mod);</div>
-<div class="line"><span class="lineno">  296</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tPrivate key: &quot;</span> &lt;&lt; bob_private_key &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  297</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\tPublic Key: &quot;</span> &lt;&lt; bob_public_key &lt;&lt; <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">  296</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tPrivate key: &quot;</span> &lt;&lt; bob_private_key &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  297</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tPublic Key: &quot;</span> &lt;&lt; bob_public_key &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  298</span> </div>
 <div class="line"><span class="lineno">  299</span>    <span class="comment">// After public key exchange, create a shared key for communication.</span></div>
 <div class="line"><span class="lineno">  300</span>    <span class="comment">// create shared key:</span></div>
@@ -273,24 +293,17 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  305</span>                                                    alice_public_key, a,</div>
 <div class="line"><span class="lineno">  306</span>                                                    bob_private_key, mod);</div>
 <div class="line"><span class="lineno">  307</span> </div>
-<div class="line"><span class="lineno">  308</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Shared keys:\n&quot;</span>;</div>
-<div class="line"><span class="lineno">  309</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; alice_shared_key &lt;&lt; <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">  310</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; bob_shared_key &lt;&lt; <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">  308</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Shared keys:\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  309</span>    std::cout &lt;&lt; alice_shared_key &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  310</span>    std::cout &lt;&lt; bob_shared_key &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  311</span> </div>
 <div class="line"><span class="lineno">  312</span>    <span class="comment">// Check whether shared keys are equal</span></div>
 <div class="line"><span class="lineno">  313</span>    assert(alice_shared_key == bob_shared_key);</div>
 <div class="line"><span class="lineno">  314</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="aclassuint256__t_html"><div class="ttname"><a href="../../d1/d83/classuint256__t.html">uint256_t</a></div><div class="ttdoc">class for 256-bit unsigned integer</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:33</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="apower__for__huge__numbers_8cpp_html_aa141a7904f0c4668bac112d652a3acf9"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">multiply</a></div><div class="ttdeci">int multiply(int x, int res[], int res_size)</div><div class="ttdef"><b>Definition</b> power_for_huge_numbers.cpp:25</div></div>
-<div class="ttc" id="astructciphers_1_1elliptic__curve__key__exchange_1_1_point_html"><div class="ttname"><a href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">ciphers::elliptic_curve_key_exchange::Point</a></div><div class="ttdoc">Definition of struct Point.</div><div class="ttdef"><b>Definition</b> elliptic_curve_key_exchange.cpp:46</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassuint256__t_html"><div class="ttname"><a href="../../d1/d83/classuint256__t.html">uint256_t</a></div><div class="ttdoc">class for 256-bit unsigned integer</div><div class="ttdef"><b>Definition</b> <a href="../../da/da3/uint256__t_8hpp_source.html#l00033">uint256_t.hpp:33</a></div></div>
+<div class="ttc" id="apower__for__huge__numbers_8cpp_html_aa141a7904f0c4668bac112d652a3acf9"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">multiply</a></div><div class="ttdeci">int multiply(int x, int res[], int res_size)</div><div class="ttdef"><b>Definition</b> <a href="../../df/def/power__for__huge__numbers_8cpp_source.html#l00025">power_for_huge_numbers.cpp:25</a></div></div>
+<div class="ttc" id="astructciphers_1_1elliptic__curve__key__exchange_1_1_point_html"><div class="ttname"><a href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">ciphers::elliptic_curve_key_exchange::Point</a></div><div class="ttdoc">Definition of struct Point.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00046">elliptic_curve_key_exchange.cpp:46</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a8800c8a84d77dadadb05ad5e83b77ef4" name="a8800c8a84d77dadadb05ad5e83b77ef4"></a>
@@ -318,6 +331,8 @@ Here is the call graph for this function:</div>
 
 <p>Function to test the <a class="el" href="../../db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer">uint128_t</a> header. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00197">197</a> of file <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html">elliptic_curve_key_exchange.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  197</span>                              {</div>
 <div class="line"><span class="lineno">  198</span>    <span class="comment">// 1st test: Operations test</span></div>
 <div class="line"><span class="lineno">  199</span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> a(<span class="stringliteral">&quot;122&quot;</span>), b(<span class="stringliteral">&quot;2312&quot;</span>);</div>
@@ -345,7 +360,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  221</span>    assert((a ^ b) == <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(<span class="stringliteral">&quot;12321421424217440294&quot;</span>));</div>
 <div class="line"><span class="lineno">  222</span>    assert((a &lt;&lt; 64) == <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(<span class="stringliteral">&quot;227290107637132170748078080907806769152&quot;</span>));</div>
 <div class="line"><span class="lineno">  223</span>}</div>
-<div class="ttc" id="aclassuint128__t_html"><div class="ttname"><a href="../../db/d9a/classuint128__t.html">uint128_t</a></div><div class="ttdoc">class for 128-bit unsigned integer</div><div class="ttdef"><b>Definition</b> uint128_t.hpp:60</div></div>
+<div class="ttc" id="aclassuint128__t_html"><div class="ttname"><a href="../../db/d9a/classuint128__t.html">uint128_t</a></div><div class="ttdoc">class for 128-bit unsigned integer</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00060">uint128_t.hpp:60</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -374,6 +389,8 @@ Here is the call graph for this function:</div>
 
 <p>Function to test the <a class="el" href="../../d1/d83/classuint256__t.html" title="class for 256-bit unsigned integer">uint256_t</a> header. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00230">230</a> of file <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html">elliptic_curve_key_exchange.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  230</span>                              {</div>
 <div class="line"><span class="lineno">  231</span>    <span class="comment">// 1st test: Operations test</span></div>
 <div class="line"><span class="lineno">  232</span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> a(<span class="stringliteral">&quot;122&quot;</span>), b(<span class="stringliteral">&quot;2312&quot;</span>);</div>
diff --git a/df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index 49773abf4..000000000
--- a/df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Function to test the provided algorithm above." alt="" coords="5,31,49,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,36,81,28,82,33,50,41"/>
-<area shape="rect" id="Node000003" href="$df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" title=" " alt="" coords="99,55,166,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="50,46,85,54,83,59,49,51"/>
-</map>
diff --git a/df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 12fac6537..000000000
--- a/df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-caf745e54a1b4b20ae01a3e9e116a8e3
\ No newline at end of file
diff --git a/df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 97bc3db98..000000000
--- a/df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="64pt"
- viewBox="0.00 0.00 130.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the provided algorithm above.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-56.25 68.5,-56.25 68.5,-37 122,-37 122,-56.25"/>
-<text text-anchor="middle" x="95.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-31.47C39.86,-33.2 48.49,-35.33 57.03,-37.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.06,-40.81 66.61,-39.8 57.74,-34.01 56.06,-40.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="120.12,-19.25 70.38,-19.25 70.38,0 120.12,0 120.12,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-23.98C40.39,-22.22 49.81,-20.01 58.98,-17.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="59.48,-21.35 68.42,-15.66 57.89,-14.53 59.48,-21.35"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 68baa0e45..000000000
--- a/df/d2c/elliptic__curve__key__exchange_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="64pt"
- viewBox="0.00 0.00 130.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to test the provided algorithm above.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-37.25 0,-37.25 0,-18 32.5,-18 32.5,-37.25"/>
-<text text-anchor="middle" x="16.25" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-56.25 68.5,-56.25 68.5,-37 122,-37 122,-56.25"/>
-<text text-anchor="middle" x="95.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-31.47C39.86,-33.2 48.49,-35.33 57.03,-37.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.06,-40.81 66.61,-39.8 57.74,-34.01 56.06,-40.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="120.12,-19.25 70.38,-19.25 70.38,0 120.12,0 120.12,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-23.98C40.39,-22.22 49.81,-20.01 58.98,-17.87"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="59.48,-21.35 68.42,-15.66 57.89,-14.53 59.48,-21.35"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 1423826fa..000000000
--- a/df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,79,55,104"/>
-<area shape="rect" id="Node000002" href="$df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Function to test the provided algorithm above." alt="" coords="136,29,180,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="54,80,121,53,123,58,56,85"/>
-<area shape="rect" id="Node000005" href="$df/d2c/elliptic__curve__key__exchange_8cpp.html#a8800c8a84d77dadadb05ad5e83b77ef4" title="Function to test the uint128_t header." alt="" coords="103,79,213,104"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="55,89,87,89,87,94,55,94"/>
-<area shape="rect" id="Node000006" href="$df/d2c/elliptic__curve__key__exchange_8cpp.html#a37775d1724ffe404c088dabbc8da91ae" title="Function to test the uint256_t header." alt="" coords="103,128,213,154"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="56,98,109,119,107,124,54,103"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="261,5,332,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="179,36,245,24,246,30,180,41"/>
-<area shape="rect" id="Node000004" href="$df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" title=" " alt="" coords="264,55,330,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="180,43,249,56,248,61,179,49"/>
-</map>
diff --git a/df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index f68311bb6..000000000
--- a/df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-712e220a798629e15d8744a1cb28c2ce
\ No newline at end of file
diff --git a/df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 70a6cdc6e..000000000
--- a/df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,137 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="253pt" height="119pt"
- viewBox="0.00 0.00 253.25 119.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 115.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the provided algorithm above.">
-<polygon fill="white" stroke="#666666" points="130.62,-93.25 98.12,-93.25 98.12,-74 130.62,-74 130.62,-93.25"/>
-<text text-anchor="middle" x="114.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.16,-53.58C51.31,-59.16 71.38,-67.07 87.37,-73.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.67,-76.47 96.26,-76.88 88.24,-69.96 85.67,-76.47"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#a8800c8a84d77dadadb05ad5e83b77ef4" target="_top" xlink:title="Function to test the uint128_t header.">
-<polygon fill="white" stroke="#666666" points="155.75,-56.25 73,-56.25 73,-37 155.75,-37 155.75,-56.25"/>
-<text text-anchor="middle" x="114.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t_tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.16,-46.62C44.17,-46.62 52.64,-46.62 61.35,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.32,-50.13 71.32,-46.63 61.32,-43.13 61.32,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#a37775d1724ffe404c088dabbc8da91ae" target="_top" xlink:title="Function to test the uint256_t header.">
-<polygon fill="white" stroke="#666666" points="155.75,-19.25 73,-19.25 73,0 155.75,0 155.75,-19.25"/>
-<text text-anchor="middle" x="114.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t_tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.16,-39.67C48.47,-35.21 63.57,-29.26 77.34,-23.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.57,-27.1 86.59,-20.18 76.01,-20.59 78.57,-27.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245.25,-111.25 191.75,-111.25 191.75,-92 245.25,-92 245.25,-111.25"/>
-<text text-anchor="middle" x="218.5" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.89,-86.36C143.94,-88.66 163.16,-92.05 180.17,-95.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.55,-98.49 190.01,-96.78 180.77,-91.6 179.55,-98.49"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.38,-74.25 193.62,-74.25 193.62,-55 243.38,-55 243.38,-74.25"/>
-<text text-anchor="middle" x="218.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.89,-80.74C144.46,-78.21 164.69,-74.45 182.19,-71.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.79,-74.64 191.98,-69.37 181.51,-67.76 182.79,-74.64"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 94fb0daa0..000000000
--- a/df/d2c/elliptic__curve__key__exchange_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,111 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="253pt" height="119pt"
- viewBox="0.00 0.00 253.25 119.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 115.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Function to test the provided algorithm above.">
-<polygon fill="white" stroke="#666666" points="130.62,-93.25 98.12,-93.25 98.12,-74 130.62,-74 130.62,-93.25"/>
-<text text-anchor="middle" x="114.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.16,-53.58C51.31,-59.16 71.38,-67.07 87.37,-73.38"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.67,-76.47 96.26,-76.88 88.24,-69.96 85.67,-76.47"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#a8800c8a84d77dadadb05ad5e83b77ef4" target="_top" xlink:title="Function to test the uint128_t header.">
-<polygon fill="white" stroke="#666666" points="155.75,-56.25 73,-56.25 73,-37 155.75,-37 155.75,-56.25"/>
-<text text-anchor="middle" x="114.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t_tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.16,-46.62C44.17,-46.62 52.64,-46.62 61.35,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.32,-50.13 71.32,-46.63 61.32,-43.13 61.32,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#a37775d1724ffe404c088dabbc8da91ae" target="_top" xlink:title="Function to test the uint256_t header.">
-<polygon fill="white" stroke="#666666" points="155.75,-19.25 73,-19.25 73,0 155.75,0 155.75,-19.25"/>
-<text text-anchor="middle" x="114.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t_tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.16,-39.67C48.47,-35.21 63.57,-29.26 77.34,-23.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="78.57,-27.1 86.59,-20.18 76.01,-20.59 78.57,-27.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="245.25,-111.25 191.75,-111.25 191.75,-92 245.25,-92 245.25,-111.25"/>
-<text text-anchor="middle" x="218.5" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.89,-86.36C143.94,-88.66 163.16,-92.05 180.17,-95.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.55,-98.49 190.01,-96.78 180.77,-91.6 179.55,-98.49"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="243.38,-74.25 193.62,-74.25 193.62,-55 243.38,-55 243.38,-74.25"/>
-<text text-anchor="middle" x="218.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M130.89,-80.74C144.46,-78.21 164.69,-74.45 182.19,-71.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="182.79,-74.64 191.98,-69.37 181.51,-67.76 182.79,-74.64"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d2c/elliptic__curve__key__exchange_8cpp_source.html b/df/d2c/elliptic__curve__key__exchange_8cpp_source.html
new file mode 100644
index 000000000..b14eeb8f4
--- /dev/null
+++ b/df/d2c/elliptic__curve__key__exchange_8cpp_source.html
@@ -0,0 +1,388 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: ciphers/elliptic_curve_key_exchange.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/d2c/elliptic__curve__key__exchange_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">elliptic_curve_key_exchange.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &quot;<a class="code" href="../../da/da3/uint256__t_8hpp.html">uint256_t.hpp</a>&quot;</span>  </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d6/d4e/namespaceciphers.html">ciphers</a> {</div>
+<div class="foldopen" id="foldopen00040" data-start="{" data-end="}">
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"><a class="line" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html">   40</a></span><span class="keyword">namespace </span>elliptic_curve_key_exchange {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="foldopen" id="foldopen00046" data-start="{" data-end="};">
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"><a class="line" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">   46</a></span><span class="keyword">typedef</span> <span class="keyword">struct </span><a class="code hl_struct" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> x, y;  </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446">   55</a></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446">operator==</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> &amp;p) { <span class="keywordflow">return</span> x == p.x &amp;&amp; y == p.y; }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="foldopen" id="foldopen00063" data-start="{" data-end="};">
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"><a class="line" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#af2142b27241b28f835e8ce78d7d6463c">   63</a></span>    <span class="keyword">friend</span> std::ostream &amp;<a class="code hl_friend" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#af2142b27241b28f835e8ce78d7d6463c">operator&lt;&lt;</a>(std::ostream &amp;op, <span class="keyword">const</span> <a class="code hl_struct" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> &amp;p) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>        op &lt;&lt; p.x &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; p.y;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <span class="keywordflow">return</span> op;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
+</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"><a class="line" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#af0a6e3521629c25c2b5d620f26429830">   67</a></span>} <a class="code hl_typedef" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#af0a6e3521629c25c2b5d620f26429830">Point</a>;</div>
+</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="foldopen" id="foldopen00078" data-start="{" data-end="}">
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"><a class="line" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">   78</a></span><a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">exp</a>(<a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> number, <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a>, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;mod) {</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a>) {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(1);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    }</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> ans(1);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    number = number % mod;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    <span class="keywordflow">while</span> (<a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a>) {</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        <span class="keywordflow">if</span> ((<a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a> &amp; 1)) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            ans = (ans * number) % mod;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>        }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a> &gt;&gt;= 1;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a>) {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>            number = (number * number) % mod;</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        }</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    }</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="keywordflow">return</span> ans;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>}</div>
+</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="foldopen" id="foldopen00110" data-start="{" data-end="}">
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"><a class="line" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf">  110</a></span><a class="code hl_struct" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf">addition</a>(<a class="code hl_struct" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> a, <a class="code hl_struct" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> b, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;curve_a_coeff,</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>               <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> mod) {</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> lambda(0);  </div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> zero(0);    </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    lambda = zero = 0;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> inf = ~zero;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <span class="keywordflow">if</span> (a.x != b.x || a.y != b.y) {</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>        <span class="comment">// Slope being infinite.</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>        <span class="keywordflow">if</span> (b.x == a.x) {</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>            <span class="keywordflow">return</span> {inf, inf};</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>        }</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>        <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> num = (b.y - a.y + mod), den = (b.x - a.x + mod);</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>        lambda = (num * (<a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">exp</a>(den, mod - 2, mod))) % mod;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>        <span class="keywordflow">if</span> (!a.y) {</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>            <span class="keywordflow">return</span> {inf, inf};</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>        }</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> axsq = ((a.x * a.x)) % mod;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>        <span class="comment">// Mulitply by 3 adjustment</span></div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>        axsq += (axsq &lt;&lt; 1);</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>        axsq %= mod;</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        <span class="comment">// Mulitply by 2 adjustment</span></div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> a_2 = (a.y &lt;&lt; 1);</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>        lambda =</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>            (((axsq + curve_a_coeff) % mod) * <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">exp</a>(a_2, mod - 2, mod)) % mod;</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    }</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    <a class="code hl_struct" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> c;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    <span class="comment">// new point: x = ((lambda^2) - x1 - x2)</span></div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    <span class="comment">// y = (lambda * (x1 - x)) - y1</span></div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    c.x = ((lambda * lambda) % mod + (mod &lt;&lt; 1) - a.x - b.x) % mod;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>    c.y = (((lambda * (a.x + mod - c.x)) % mod) + mod - a.y) % mod;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    <span class="keywordflow">return</span> c;</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>}</div>
+</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span> </div>
+<div class="foldopen" id="foldopen00165" data-start="{" data-end="}">
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"><a class="line" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#a17f3d667241b88115a95282cdd719cb2">  165</a></span><a class="code hl_struct" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#a17f3d667241b88115a95282cdd719cb2">multiply</a>(<span class="keyword">const</span> <a class="code hl_struct" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> &amp;a, <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;curve_a_coeff, <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> p,</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>               <span class="keyword">const</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> &amp;mod) {</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    <a class="code hl_struct" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> N = a;</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    N.x %= mod;</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    N.y %= mod;</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> inf{};</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>    inf = <a class="code hl_class" href="../../d1/d83/classuint256__t.html">~uint256_t</a>(0);</div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    <a class="code hl_struct" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> Q = {inf, inf};</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    <span class="keywordflow">while</span> (p) {</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        <span class="keywordflow">if</span> ((p &amp; 1)) {</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>            <span class="keywordflow">if</span> (Q.x == inf &amp;&amp; Q.y == inf) {</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>                Q.x = N.x;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>                Q.y = N.y;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>                Q = <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf">addition</a>(Q, N, curve_a_coeff, mod);</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>            }</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>        }</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>        p &gt;&gt;= 1;</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>        <span class="keywordflow">if</span> (p) {</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>            N = <a class="code hl_function" href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf">addition</a>(N, N, curve_a_coeff, mod);</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>        }</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>    }</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    <span class="keywordflow">return</span> Q;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>}</div>
+</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>}  <span class="comment">// namespace elliptic_curve_key_exchange</span></div>
+</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>}  <span class="comment">// namespace ciphers</span></div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span> </div>
+<div class="foldopen" id="foldopen00197" data-start="{" data-end="}">
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"><a class="line" href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#a8800c8a84d77dadadb05ad5e83b77ef4">  197</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#a8800c8a84d77dadadb05ad5e83b77ef4">uint128_t_tests</a>() {</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>    <span class="comment">// 1st test: Operations test</span></div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>    <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a> a(<span class="stringliteral">&quot;122&quot;</span>), b(<span class="stringliteral">&quot;2312&quot;</span>);</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    assert(a + b == 2434);</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>    assert(b - a == 2190);</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    assert(a * b == 282064);</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    assert(b / a == 18);</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>    assert(b % a == 116);</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>    assert((a &amp; b) == 8);</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    assert((a | b) == 2426);</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>    assert((a ^ b) == 2418);</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>    assert((a &lt;&lt; 64) == <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(<span class="stringliteral">&quot;2250502776992565297152&quot;</span>));</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>    assert((b &gt;&gt; 7) == 18);</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span> </div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    <span class="comment">// 2nd test: Operations test</span></div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>    a = <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(<span class="stringliteral">&quot;12321421424232142122&quot;</span>);</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span>    b = <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(<span class="stringliteral">&quot;23123212&quot;</span>);</div>
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno">  214</span>    assert(a + b == <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(<span class="stringliteral">&quot;12321421424255265334&quot;</span>));</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>    assert(a - b == <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(<span class="stringliteral">&quot;12321421424209018910&quot;</span>));</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>    assert(a * b == <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(<span class="stringliteral">&quot;284910839733861759501135864&quot;</span>));</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>    assert(a / b == 532859423865LL);</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>    assert(a % b == 3887742);</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span>    assert((a &amp; b) == 18912520);</div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>    assert((a | b) == <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(<span class="stringliteral">&quot;12321421424236352814&quot;</span>));</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>    assert((a ^ b) == <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(<span class="stringliteral">&quot;12321421424217440294&quot;</span>));</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>    assert((a &lt;&lt; 64) == <a class="code hl_class" href="../../db/d9a/classuint128__t.html">uint128_t</a>(<span class="stringliteral">&quot;227290107637132170748078080907806769152&quot;</span>));</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>}</div>
+</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span> </div>
+<div class="foldopen" id="foldopen00230" data-start="{" data-end="}">
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"><a class="line" href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#a37775d1724ffe404c088dabbc8da91ae">  230</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#a37775d1724ffe404c088dabbc8da91ae">uint256_t_tests</a>() {</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    <span class="comment">// 1st test: Operations test</span></div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> a(<span class="stringliteral">&quot;122&quot;</span>), b(<span class="stringliteral">&quot;2312&quot;</span>);</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>    assert(a + b == 2434);</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>    assert(b - a == 2190);</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>    assert(a * b == 282064);</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>    assert(b / a == 18);</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>    assert(b % a == 116);</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>    assert((a &amp; b) == 8);</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>    assert((a | b) == 2426);</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    assert((a ^ b) == 2418);</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>    assert((a &lt;&lt; 64) == <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(<span class="stringliteral">&quot;2250502776992565297152&quot;</span>));</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span>    assert((b &gt;&gt; 7) == 18);</div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span> </div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>    <span class="comment">// 2nd test: Operations test</span></div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>    a = <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(<span class="stringliteral">&quot;12321423124513251424232142122&quot;</span>);</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>    b = <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(<span class="stringliteral">&quot;23124312431243243215354315132413213212&quot;</span>);</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>    assert(a + b == <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(<span class="stringliteral">&quot;23124312443564666339867566556645355334&quot;</span>));</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>    <span class="comment">// Since a &lt; b, the value is greater</span></div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    assert(a - b == <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(<span class="stringliteral">&quot;115792089237316195423570985008687907853246860353&quot;</span></div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>                              <span class="stringliteral">&quot;221642219366742944204948568846&quot;</span>));</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>    assert(a * b == <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(<span class="stringliteral">&quot;284924437928789743312147393953938013677909398222&quot;</span></div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span>                              <span class="stringliteral">&quot;169728183872115864&quot;</span>));</div>
+<div class="line"><a id="l00253" name="l00253"></a><span class="lineno">  253</span>    assert(b / a == <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(<span class="stringliteral">&quot;1876756621&quot;</span>));</div>
+<div class="line"><a id="l00254" name="l00254"></a><span class="lineno">  254</span>    assert(b % a == <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(<span class="stringliteral">&quot;2170491202688962563936723450&quot;</span>));</div>
+<div class="line"><a id="l00255" name="l00255"></a><span class="lineno">  255</span>    assert((a &amp; b) == <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(<span class="stringliteral">&quot;3553901085693256462344&quot;</span>));</div>
+<div class="line"><a id="l00256" name="l00256"></a><span class="lineno">  256</span>    assert((a | b) == <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(<span class="stringliteral">&quot;23124312443564662785966480863388892990&quot;</span>));</div>
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno">  257</span>    assert((a ^ b) == <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(<span class="stringliteral">&quot;23124312443564659232065395170132430646&quot;</span>));</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    assert((a &lt;&lt; 128) == <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(<span class="stringliteral">&quot;4192763024643754272961909047609369343091683&quot;</span></div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>                                   <span class="stringliteral">&quot;376561852756163540549632&quot;</span>));</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>}</div>
+</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span> </div>
+<div class="foldopen" id="foldopen00267" data-start="{" data-end="}">
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"><a class="line" href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  267</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>    <span class="comment">// demonstration of key exchange using curve secp112r1</span></div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span> </div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>    <span class="comment">// Equation of the form y^2 = (x^3 + ax + b) % P (here p is mod)</span></div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> a(<span class="stringliteral">&quot;4451685225093714772084598273548424&quot;</span>),</div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>        b(<span class="stringliteral">&quot;2061118396808653202902996166388514&quot;</span>),</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>        mod(<span class="stringliteral">&quot;4451685225093714772084598273548427&quot;</span>);</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span> </div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>    <span class="comment">// Generator value: is pre-defined for the given curve</span></div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>    <a class="code hl_struct" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">ciphers::elliptic_curve_key_exchange::Point</a> ptr = {</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>        <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(<span class="stringliteral">&quot;188281465057972534892223778713752&quot;</span>),</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>        <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(<span class="stringliteral">&quot;3419875491033170827167861896082688&quot;</span>)};</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span> </div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>    <span class="comment">// Shared key generation.</span></div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>    <span class="comment">// For alice</span></div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;For alice:\n&quot;</span>;</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span>    <span class="comment">// Alice&#39;s private key (can be generated randomly)</span></div>
+<div class="line"><a id="l00284" name="l00284"></a><span class="lineno">  284</span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> alice_private_key(<span class="stringliteral">&quot;164330438812053169644452143505618&quot;</span>);</div>
+<div class="line"><a id="l00285" name="l00285"></a><span class="lineno">  285</span>    <a class="code hl_struct" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">ciphers::elliptic_curve_key_exchange::Point</a> alice_public_key =</div>
+<div class="line"><a id="l00286" name="l00286"></a><span class="lineno">  286</span>        <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">multiply</a>(ptr, a, alice_private_key, mod);</div>
+<div class="line"><a id="l00287" name="l00287"></a><span class="lineno">  287</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tPrivate key: &quot;</span> &lt;&lt; alice_private_key &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno">  288</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tPublic Key: &quot;</span> &lt;&lt; alice_public_key &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span> </div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>    <span class="comment">// For Bob</span></div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;For Bob:\n&quot;</span>;</div>
+<div class="line"><a id="l00292" name="l00292"></a><span class="lineno">  292</span>    <span class="comment">// Bob&#39;s private key (can be generated randomly)</span></div>
+<div class="line"><a id="l00293" name="l00293"></a><span class="lineno">  293</span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> bob_private_key(<span class="stringliteral">&quot;1959473333748537081510525763478373&quot;</span>);</div>
+<div class="line"><a id="l00294" name="l00294"></a><span class="lineno">  294</span>    <a class="code hl_struct" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">ciphers::elliptic_curve_key_exchange::Point</a> bob_public_key =</div>
+<div class="line"><a id="l00295" name="l00295"></a><span class="lineno">  295</span>        <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">multiply</a>(ptr, a, bob_private_key, mod);</div>
+<div class="line"><a id="l00296" name="l00296"></a><span class="lineno">  296</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tPrivate key: &quot;</span> &lt;&lt; bob_private_key &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00297" name="l00297"></a><span class="lineno">  297</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\tPublic Key: &quot;</span> &lt;&lt; bob_public_key &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno">  298</span> </div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span>    <span class="comment">// After public key exchange, create a shared key for communication.</span></div>
+<div class="line"><a id="l00300" name="l00300"></a><span class="lineno">  300</span>    <span class="comment">// create shared key:</span></div>
+<div class="line"><a id="l00301" name="l00301"></a><span class="lineno">  301</span>    <a class="code hl_struct" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">ciphers::elliptic_curve_key_exchange::Point</a> alice_shared_key = <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">multiply</a>(</div>
+<div class="line"><a id="l00302" name="l00302"></a><span class="lineno">  302</span>                                                    bob_public_key, a,</div>
+<div class="line"><a id="l00303" name="l00303"></a><span class="lineno">  303</span>                                                    alice_private_key, mod),</div>
+<div class="line"><a id="l00304" name="l00304"></a><span class="lineno">  304</span>                                                bob_shared_key = <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">multiply</a>(</div>
+<div class="line"><a id="l00305" name="l00305"></a><span class="lineno">  305</span>                                                    alice_public_key, a,</div>
+<div class="line"><a id="l00306" name="l00306"></a><span class="lineno">  306</span>                                                    bob_private_key, mod);</div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno">  307</span> </div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Shared keys:\n&quot;</span>;</div>
+<div class="line"><a id="l00309" name="l00309"></a><span class="lineno">  309</span>    std::cout &lt;&lt; alice_shared_key &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00310" name="l00310"></a><span class="lineno">  310</span>    std::cout &lt;&lt; bob_shared_key &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00311" name="l00311"></a><span class="lineno">  311</span> </div>
+<div class="line"><a id="l00312" name="l00312"></a><span class="lineno">  312</span>    <span class="comment">// Check whether shared keys are equal</span></div>
+<div class="line"><a id="l00313" name="l00313"></a><span class="lineno">  313</span>    assert(alice_shared_key == bob_shared_key);</div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno">  314</span>}</div>
+</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span> </div>
+<div class="foldopen" id="foldopen00320" data-start="{" data-end="}">
+<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"><a class="line" href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  320</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno">  321</span>    <a class="code hl_function" href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#a8800c8a84d77dadadb05ad5e83b77ef4">uint128_t_tests</a>();  <span class="comment">// running predefined 128-bit unsigned integer tests</span></div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>    <a class="code hl_function" href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#a37775d1724ffe404c088dabbc8da91ae">uint256_t_tests</a>();  <span class="comment">// running predefined 256-bit unsigned integer tests</span></div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>    <a class="code hl_function" href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();             <span class="comment">// running self-test implementations</span></div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>}</div>
+</div>
+<div class="ttc" id="aclassuint128__t_html"><div class="ttname"><a href="../../db/d9a/classuint128__t.html">uint128_t</a></div><div class="ttdoc">class for 128-bit unsigned integer</div><div class="ttdef"><b>Definition</b> <a href="../../da/d41/uint128__t_8hpp_source.html#l00060">uint128_t.hpp:60</a></div></div>
+<div class="ttc" id="aclassuint256__t_html"><div class="ttname"><a href="../../d1/d83/classuint256__t.html">uint256_t</a></div><div class="ttdoc">class for 256-bit unsigned integer</div><div class="ttdef"><b>Definition</b> <a href="../../da/da3/uint256__t_8hpp_source.html#l00033">uint256_t.hpp:33</a></div></div>
+<div class="ttc" id="aelliptic__curve__key__exchange_8cpp_html_a37775d1724ffe404c088dabbc8da91ae"><div class="ttname"><a href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#a37775d1724ffe404c088dabbc8da91ae">uint256_t_tests</a></div><div class="ttdeci">static void uint256_t_tests()</div><div class="ttdoc">Function to test the uint256_t header.</div><div class="ttdef"><b>Definition</b> <a href="#l00230">elliptic_curve_key_exchange.cpp:230</a></div></div>
+<div class="ttc" id="aelliptic__curve__key__exchange_8cpp_html_a8800c8a84d77dadadb05ad5e83b77ef4"><div class="ttname"><a href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#a8800c8a84d77dadadb05ad5e83b77ef4">uint128_t_tests</a></div><div class="ttdeci">static void uint128_t_tests()</div><div class="ttdoc">Function to test the uint128_t header.</div><div class="ttdef"><b>Definition</b> <a href="#l00197">elliptic_curve_key_exchange.cpp:197</a></div></div>
+<div class="ttc" id="aelliptic__curve__key__exchange_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test the provided algorithm above.</div><div class="ttdef"><b>Definition</b> <a href="#l00267">elliptic_curve_key_exchange.cpp:267</a></div></div>
+<div class="ttc" id="aelliptic__curve__key__exchange_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00320">elliptic_curve_key_exchange.cpp:320</a></div></div>
+<div class="ttc" id="anamespaceciphers_1_1elliptic__curve__key__exchange_html_a17f3d667241b88115a95282cdd719cb2"><div class="ttname"><a href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#a17f3d667241b88115a95282cdd719cb2">ciphers::elliptic_curve_key_exchange::multiply</a></div><div class="ttdeci">Point multiply(const Point &amp;a, const uint256_t &amp;curve_a_coeff, uint256_t p, const uint256_t &amp;mod)</div><div class="ttdoc">multiply Point and integer</div><div class="ttdef"><b>Definition</b> <a href="#l00165">elliptic_curve_key_exchange.cpp:165</a></div></div>
+<div class="ttc" id="anamespaceciphers_1_1elliptic__curve__key__exchange_html_ac00616a4e40d3cd5cfb4da87d9ff9af0"><div class="ttname"><a href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0">ciphers::elliptic_curve_key_exchange::exp</a></div><div class="ttdeci">uint256_t exp(uint256_t number, uint256_t power, const uint256_t &amp;mod)</div><div class="ttdoc">This function calculates number raised to exponent power under modulo mod using Modular Exponentiatio...</div><div class="ttdef"><b>Definition</b> <a href="#l00078">elliptic_curve_key_exchange.cpp:78</a></div></div>
+<div class="ttc" id="anamespaceciphers_1_1elliptic__curve__key__exchange_html_acc5fe9c2032fb7582c38a20d1fa69bcf"><div class="ttname"><a href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf">ciphers::elliptic_curve_key_exchange::addition</a></div><div class="ttdeci">Point addition(Point a, Point b, const uint256_t &amp;curve_a_coeff, uint256_t mod)</div><div class="ttdoc">Addition of points.</div><div class="ttdef"><b>Definition</b> <a href="#l00110">elliptic_curve_key_exchange.cpp:110</a></div></div>
+<div class="ttc" id="anamespaceciphers_1_1elliptic__curve__key__exchange_html_af0a6e3521629c25c2b5d620f26429830"><div class="ttname"><a href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#af0a6e3521629c25c2b5d620f26429830">ciphers::elliptic_curve_key_exchange::Point</a></div><div class="ttdeci">struct ciphers::elliptic_curve_key_exchange::Point Point</div><div class="ttdoc">Definition of struct Point.</div></div>
+<div class="ttc" id="anamespaceciphers_html"><div class="ttname"><a href="../../d6/d4e/namespaceciphers.html">ciphers</a></div><div class="ttdoc">Algorithms for encryption and decryption.</div></div>
+<div class="ttc" id="apower__for__huge__numbers_8cpp_html_aa141a7904f0c4668bac112d652a3acf9"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">multiply</a></div><div class="ttdeci">int multiply(int x, int res[], int res_size)</div><div class="ttdef"><b>Definition</b> <a href="../../df/def/power__for__huge__numbers_8cpp_source.html#l00025">power_for_huge_numbers.cpp:25</a></div></div>
+<div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae249a2af508aa94266023ce8aa81426f"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a></div><div class="ttdeci">void power(int x, int n)</div><div class="ttdef"><b>Definition</b> <a href="../../df/def/power__for__huge__numbers_8cpp_source.html#l00056">power_for_huge_numbers.cpp:56</a></div></div>
+<div class="ttc" id="astructciphers_1_1elliptic__curve__key__exchange_1_1_point_html"><div class="ttname"><a href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">ciphers::elliptic_curve_key_exchange::Point</a></div><div class="ttdoc">Definition of struct Point.</div><div class="ttdef"><b>Definition</b> <a href="#l00046">elliptic_curve_key_exchange.cpp:46</a></div></div>
+<div class="ttc" id="astructciphers_1_1elliptic__curve__key__exchange_1_1_point_html_a5084e9ca27837662c31d4dc003815446"><div class="ttname"><a href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446">ciphers::elliptic_curve_key_exchange::Point::operator==</a></div><div class="ttdeci">bool operator==(const Point &amp;p)</div><div class="ttdoc">x and y co-ordinates</div><div class="ttdef"><b>Definition</b> <a href="#l00055">elliptic_curve_key_exchange.cpp:55</a></div></div>
+<div class="ttc" id="astructciphers_1_1elliptic__curve__key__exchange_1_1_point_html_af2142b27241b28f835e8ce78d7d6463c"><div class="ttname"><a href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#af2142b27241b28f835e8ce78d7d6463c">ciphers::elliptic_curve_key_exchange::Point::operator&lt;&lt;</a></div><div class="ttdeci">friend std::ostream &amp; operator&lt;&lt;(std::ostream &amp;op, const Point &amp;p)</div><div class="ttdoc">ostream operator for printing Point</div><div class="ttdef"><b>Definition</b> <a href="#l00063">elliptic_curve_key_exchange.cpp:63</a></div></div>
+<div class="ttc" id="auint256__t_8hpp_html"><div class="ttname"><a href="../../da/da3/uint256__t_8hpp.html">uint256_t.hpp</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_4d6e05837bf820fb089a8a8cdf2f42b7.html">ciphers</a></li><li class="navelem"><a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp.html">elliptic_curve_key_exchange.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/d31/floyd__warshall_8cpp_source.html b/df/d31/floyd__warshall_8cpp_source.html
new file mode 100644
index 000000000..319cbdc4c
--- /dev/null
+++ b/df/d31/floyd__warshall_8cpp_source.html
@@ -0,0 +1,252 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: dynamic_programming/floyd_warshall.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/d31/floyd__warshall_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">floyd_warshall.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;climits&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="preprocessor">#include &lt;cstddef&gt;</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="keyword">using </span>std::cin;</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="keyword">using </span>std::cout;</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="keyword">using </span>std::endl;</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment">// Wrapper class for storing a graph</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="keyword">class </span><a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    <span class="keywordtype">int</span> vertexNum;</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    <span class="keywordtype">int</span> **edges;</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <span class="comment">// Constructs a graph with V vertices and E edges</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a>(<span class="keywordtype">int</span> V) {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        this-&gt;vertexNum = V;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        this-&gt;edges = <span class="keyword">new</span> <span class="keywordtype">int</span> *[V];</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>            this-&gt;edges[i] = <span class="keyword">new</span> <span class="keywordtype">int</span>[V];</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; V; j++) this-&gt;edges[i][j] = INT_MAX;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>            this-&gt;edges[i][i] = 0;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        }</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    }</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <a class="code hl_class" href="../../da/d9a/class_graph.html">~Graph</a>() {</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; vertexNum; i++) {</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>            <span class="keyword">delete</span>[] edges[i];</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        }</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>        <span class="keyword">delete</span>[] edges;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    }</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="comment">// Adds the given edge to the graph</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    <span class="keywordtype">void</span> addEdge(<span class="keywordtype">int</span> src, <span class="keywordtype">int</span> dst, <span class="keywordtype">int</span> weight) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        this-&gt;edges[src][dst] = weight;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    }</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>};</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span> </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="comment">// Utility function to print distances</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="keywordtype">void</span> print(<span class="keyword">const</span> std::vector&lt;int&gt;&amp; dist, <span class="keywordtype">int</span> V) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    cout &lt;&lt; <span class="stringliteral">&quot;\nThe Distance matrix for Floyd - Warshall&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++) {</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; V; j++) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>            <span class="keywordflow">if</span> (dist[i * V + j] != INT_MAX)</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>                cout &lt;&lt; dist[i * V + j] &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>                cout &lt;&lt; <span class="stringliteral">&quot;INF&quot;</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>                     &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        }</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        cout &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    }</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>}</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="comment">// The main function that finds the shortest path from a vertex</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="comment">// to all other vertices using Floyd-Warshall Algorithm.</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="keywordtype">void</span> FloydWarshall(<a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    std::size_t V = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.vertexNum;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    std::vector&lt;std::vector&lt;int&gt; &gt; dist(V, std::vector&lt;int&gt;(V));</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    <span class="comment">// Initialise distance array</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++)</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; V; j++) dist[i][j] = <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.edges[i][j];</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="comment">// Calculate distances</span></div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> k = 0; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> &lt; V; <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>++)</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>        <span class="comment">// Choose an intermediate vertex</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++)</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            <span class="comment">// Choose a source vertex for given intermediate</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> </div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; V; j++)</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>                <span class="comment">// Choose a destination vertex for above source vertex</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> </div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>                <span class="keywordflow">if</span> (dist[i][k] != INT_MAX &amp;&amp; dist[k][j] != INT_MAX &amp;&amp;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>                    dist[i][k] + dist[k][j] &lt; dist[i][j])</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>                    <span class="comment">// If the distance through intermediate vertex is less than</span></div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>                    <span class="comment">// direct edge then update value in distance array</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>                    dist[i][j] = dist[i][<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>] + dist[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>][j];</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="comment">// Convert 2d array to 1d array for print</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    std::vector&lt;int&gt; dist1d(V * V);</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; V; i++)</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; V; j++) dist1d[i * V + j] = dist[i][j];</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    print(dist1d, V);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>}</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span><span class="comment">// Driver Function</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    <span class="keywordtype">int</span> V, E;</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    <span class="keywordtype">int</span> src, dst, weight;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    cout &lt;&lt; <span class="stringliteral">&quot;Enter number of vertices: &quot;</span>;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    cin &gt;&gt; V;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    cout &lt;&lt; <span class="stringliteral">&quot;Enter number of edges: &quot;</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    cin &gt;&gt; E;</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> G(V);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; E; i++) {</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nEdge &quot;</span> &lt;&lt; i + 1 &lt;&lt; <span class="stringliteral">&quot;\nEnter source: &quot;</span>;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>        cin &gt;&gt; src;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        cout &lt;&lt; <span class="stringliteral">&quot;Enter destination: &quot;</span>;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>        cin &gt;&gt; dst;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        cout &lt;&lt; <span class="stringliteral">&quot;Enter weight: &quot;</span>;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>        cin &gt;&gt; weight;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>        G.addEdge(src, dst, weight);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    }</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    FloydWarshall(G);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>}</div>
+<div class="ttc" id="aclass_graph_html"><div class="ttname"><a href="../../da/d9a/class_graph.html">Graph</a></div><div class="ttdef"><b>Definition</b> <a href="../../df/d14/bellman__ford_8cpp_source.html#l00014">bellman_ford.cpp:14</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></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><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><b>floyd_warshall.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html
index fc6268713..6f58cd2ae 100644
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html
+++ b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: probability::windowed_median::WindowedMedian Class Reference</title>
+<title>TheAlgorithms/C++: probability::windowed_median::WindowedMedian Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -147,21 +164,21 @@ Private Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:aafda847b152684578dab891e5268d750" id="r_aafda847b152684578dab891e5268d750"><td class="memItemLeft" align="right" valign="top"><a id="aafda847b152684578dab891e5268d750" name="aafda847b152684578dab891e5268d750"></a>
-const size_type&#160;</td><td class="memItemRight" valign="bottom"><b>_windowSize</b></td></tr>
-<tr class="memdesc:aafda847b152684578dab891e5268d750"><td class="mdescLeft">&#160;</td><td class="mdescRight">sliding window size <br /></td></tr>
+<tr class="memitem:aafda847b152684578dab891e5268d750" id="r_aafda847b152684578dab891e5268d750"><td class="memItemLeft" align="right" valign="top">const size_type&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aafda847b152684578dab891e5268d750">_windowSize</a></td></tr>
+<tr class="memdesc:aafda847b152684578dab891e5268d750"><td class="mdescLeft">&#160;</td><td class="mdescRight">sliding window size  <br /></td></tr>
 <tr class="separator:aafda847b152684578dab891e5268d750"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a825a7aaef844c9f743a27b268e8569b2" id="r_a825a7aaef844c9f743a27b268e8569b2"><td class="memItemLeft" align="right" valign="top"><a id="a825a7aaef844c9f743a27b268e8569b2" name="a825a7aaef844c9f743a27b268e8569b2"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">Window</a>&#160;</td><td class="memItemRight" valign="bottom"><b>_window</b></td></tr>
-<tr class="memdesc:a825a7aaef844c9f743a27b268e8569b2"><td class="mdescLeft">&#160;</td><td class="mdescRight">a sliding window of values along the stream <br /></td></tr>
+<tr class="memitem:a825a7aaef844c9f743a27b268e8569b2" id="r_a825a7aaef844c9f743a27b268e8569b2"><td class="memItemLeft" align="right" valign="top">Window&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a825a7aaef844c9f743a27b268e8569b2">_window</a></td></tr>
+<tr class="memdesc:a825a7aaef844c9f743a27b268e8569b2"><td class="mdescLeft">&#160;</td><td class="mdescRight">a sliding window of values along the stream  <br /></td></tr>
 <tr class="separator:a825a7aaef844c9f743a27b268e8569b2"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aacd76f078632faee1a8788d031e6c2de" id="r_aacd76f078632faee1a8788d031e6c2de"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset.html">std::multiset</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a></td></tr>
+<tr class="memitem:aacd76f078632faee1a8788d031e6c2de" id="r_aacd76f078632faee1a8788d031e6c2de"><td class="memItemLeft" align="right" valign="top">std::multiset&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a></td></tr>
 <tr class="separator:aacd76f078632faee1a8788d031e6c2de"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a55ae3543a76045dffcb5ec7904a32a20" id="r_a55ae3543a76045dffcb5ec7904a32a20"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset.html">std::multiset</a>&lt; int &gt;::const_iterator&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a></td></tr>
+<tr class="memitem:a55ae3543a76045dffcb5ec7904a32a20" id="r_a55ae3543a76045dffcb5ec7904a32a20"><td class="memItemLeft" align="right" valign="top">std::multiset&lt; int &gt;::const_iterator&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a></td></tr>
 <tr class="separator:a55ae3543a76045dffcb5ec7904a32a20"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A class to calculate the median of a leading sliding window at the back of a stream of integer values. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html#l00056">56</a> of file <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html">windowed_median.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="aac676369661d15a3eb782c0fee77d45d" name="aac676369661d15a3eb782c0fee77d45d"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aac676369661d15a3eb782c0fee77d45d">&#9670;&#160;</a></span>WindowedMedian()</h2>
@@ -193,8 +210,10 @@ const size_type&#160;</td><td class="memItemRight" valign="bottom"><b>_windowSiz
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html#l00123">123</a> of file <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html">windowed_median.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  123</span>: <a class="code hl_variable" href="#aafda847b152684578dab891e5268d750">_windowSize</a>(windowSize){};</div>
-<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_aafda847b152684578dab891e5268d750"><div class="ttname"><a href="#aafda847b152684578dab891e5268d750">probability::windowed_median::WindowedMedian::_windowSize</a></div><div class="ttdeci">const size_type _windowSize</div><div class="ttdoc">sliding window size</div><div class="ttdef"><b>Definition</b> windowed_median.cpp:57</div></div>
+<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_aafda847b152684578dab891e5268d750"><div class="ttname"><a href="#aafda847b152684578dab891e5268d750">probability::windowed_median::WindowedMedian::_windowSize</a></div><div class="ttdeci">const size_type _windowSize</div><div class="ttdoc">sliding window size</div><div class="ttdef"><b>Definition</b> <a href="../../d1/ded/windowed__median_8cpp_source.html#l00057">windowed_median.cpp:57</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -233,39 +252,25 @@ const size_type&#160;</td><td class="memItemRight" valign="bottom"><b>_windowSiz
 <p>O(1) - traversing one step to the right child</p>
 <p>However, if the erased value is on the right branch or the median itself, and the number of elements is odd, the new median will be the left child of the current one</p>
 <p>Find the (first) position of the value we want to erase, and erase it</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html#l00095">95</a> of file <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html">windowed_median.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   95</span>                                    {</div>
-<div class="line"><span class="lineno">   96</span>        <span class="keyword">const</span> <span class="keyword">auto</span> sz = <a class="code hl_variable" href="#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset/size.html">size</a>();</div>
-<div class="line"><span class="lineno">   97</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   98</span><span class="comment">        /// If the erased value is on the left branch or the median itself and</span></div>
-<div class="line"><span class="lineno">   99</span><span class="comment">        /// the number of elements is even, the new median will be the right</span></div>
-<div class="line"><span class="lineno">  100</span><span class="comment">        /// child of the current one</span></div>
-<div class="line"><span class="lineno">  101</span><span class="comment"></span>        <span class="keywordflow">if</span> (value &lt;= *<a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> &amp;&amp; sz % 2 == 0) {</div>
-<div class="line"><span class="lineno">  102</span>            ++<a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>;  <span class="comment">/// O(1) - traversing one step to the right child</span></div>
+<div class="line"><span class="lineno">   96</span>        <span class="keyword">const</span> <span class="keyword">auto</span> sz = <a class="code hl_variable" href="#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.size();</div>
+<div class="line"><span class="lineno">   97</span> </div>
+<div class="line"><span class="lineno">  101</span>        <span class="keywordflow">if</span> (value &lt;= *<a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> &amp;&amp; sz % 2 == 0) {</div>
+<div class="line"><span class="lineno">  102</span>            ++<a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>;  </div>
 <div class="line"><span class="lineno">  103</span>        }</div>
-<div class="line"><span class="lineno">  104</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  105</span><span class="comment">        /// However, if the erased value is on the right branch or the median</span></div>
-<div class="line"><span class="lineno">  106</span><span class="comment">        /// itself, and the number of elements is odd, the new median will be</span></div>
-<div class="line"><span class="lineno">  107</span><span class="comment">        /// the left child of the current one</span></div>
-<div class="line"><span class="lineno">  108</span><span class="comment"></span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (value &gt;= *<a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> &amp;&amp; sz % 2 != 0) {</div>
+<div class="line"><span class="lineno">  104</span> </div>
+<div class="line"><span class="lineno">  108</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (value &gt;= *<a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> &amp;&amp; sz % 2 != 0) {</div>
 <div class="line"><span class="lineno">  109</span>            --<a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>;  <span class="comment">// O(1) - traversing one step to the left child</span></div>
 <div class="line"><span class="lineno">  110</span>        }</div>
-<div class="line"><span class="lineno">  111</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  112</span><span class="comment">        /// Find the (first) position of the value we want to erase, and erase</span></div>
-<div class="line"><span class="lineno">  113</span><span class="comment">        /// it</span></div>
-<div class="line"><span class="lineno">  114</span><span class="comment"></span>        <span class="keyword">const</span> <span class="keyword">auto</span> it = <a class="code hl_variable" href="#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset/find.html">find</a>(value);  <span class="comment">// O(logN)</span></div>
-<div class="line"><span class="lineno">  115</span>        <a class="code hl_variable" href="#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset/erase.html">erase</a>(it);                    <span class="comment">// O(logN)</span></div>
+<div class="line"><span class="lineno">  111</span> </div>
+<div class="line"><span class="lineno">  114</span>        <span class="keyword">const</span> <span class="keyword">auto</span> it = <a class="code hl_variable" href="#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.find(value);  <span class="comment">// O(logN)</span></div>
+<div class="line"><span class="lineno">  115</span>        <a class="code hl_variable" href="#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.erase(it);                    <span class="comment">// O(logN)</span></div>
 <div class="line"><span class="lineno">  116</span>    }</div>
-<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_a55ae3543a76045dffcb5ec7904a32a20"><div class="ttname"><a href="#a55ae3543a76045dffcb5ec7904a32a20">probability::windowed_median::WindowedMedian::_itMedian</a></div><div class="ttdeci">std::multiset&lt; int &gt;::const_iterator _itMedian</div><div class="ttdef"><b>Definition</b> windowed_median.cpp:62</div></div>
-<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_aacd76f078632faee1a8788d031e6c2de"><div class="ttname"><a href="#aacd76f078632faee1a8788d031e6c2de">probability::windowed_median::WindowedMedian::_sortedValues</a></div><div class="ttdeci">std::multiset&lt; int &gt; _sortedValues</div><div class="ttdef"><b>Definition</b> windowed_median.cpp:59</div></div>
-<div class="ttc" id="aerase_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/multiset/erase.html">std::multiset::erase</a></div><div class="ttdeci">T erase(T... args)</div></div>
-<div class="ttc" id="afind_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/multiset/find.html">std::multiset::find</a></div><div class="ttdeci">T find(T... args)</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/multiset/size.html">std::multiset::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median_af544e271ea19a6fd69a6b3ed6816453e_cgraph.svg" width="374" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_a55ae3543a76045dffcb5ec7904a32a20"><div class="ttname"><a href="#a55ae3543a76045dffcb5ec7904a32a20">probability::windowed_median::WindowedMedian::_itMedian</a></div><div class="ttdeci">std::multiset&lt; int &gt;::const_iterator _itMedian</div><div class="ttdef"><b>Definition</b> <a href="../../d1/ded/windowed__median_8cpp_source.html#l00062">windowed_median.cpp:62</a></div></div>
+<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_aacd76f078632faee1a8788d031e6c2de"><div class="ttname"><a href="#aacd76f078632faee1a8788d031e6c2de">probability::windowed_median::WindowedMedian::_sortedValues</a></div><div class="ttdeci">std::multiset&lt; int &gt; _sortedValues</div><div class="ttdef"><b>Definition</b> <a href="../../d1/ded/windowed__median_8cpp_source.html#l00059">windowed_median.cpp:59</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a938cafbdf70dc01e86e9bb12d29ec65d" name="a938cafbdf70dc01e86e9bb12d29ec65d"></a>
@@ -294,19 +299,15 @@ Here is the call graph for this function:</div>
 <p>Gets the median of the values in the sliding window. </p>
 <dl class="section return"><dt>Returns</dt><dd>Median of sliding window. For even window size return the average between the two values in the middle </dd></dl>
 <p>O(1)</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html#l00148">148</a> of file <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html">windowed_median.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  148</span>                            {</div>
-<div class="line"><span class="lineno">  149</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset/size.html">size</a>() % 2 != 0) {</div>
+<div class="line"><span class="lineno">  149</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.size() % 2 != 0) {</div>
 <div class="line"><span class="lineno">  150</span>            <span class="keywordflow">return</span> *<a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>;  <span class="comment">// O(1)</span></div>
 <div class="line"><span class="lineno">  151</span>        }</div>
-<div class="line"><span class="lineno">  152</span>        <span class="keywordflow">return</span> 0.5f * *<a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> + 0.5f * *<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a>(<a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>);  <span class="comment">/// O(1)</span></div>
+<div class="line"><span class="lineno">  152</span>        <span class="keywordflow">return</span> 0.5f * *<a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> + 0.5f * *next(<a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>);  </div>
 <div class="line"><span class="lineno">  153</span>    }</div>
-<div class="ttc" id="anext_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/next.html">std::next</a></div><div class="ttdeci">T next(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a938cafbdf70dc01e86e9bb12d29ec65d_cgraph.svg" width="366" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a61804988fcb1a6caf640f8291979aaa6" name="a61804988fcb1a6caf640f8291979aaa6"></a>
@@ -337,26 +338,22 @@ Here is the call graph for this function:</div>
 <p>Sort window - O(NlogN)</p>
 <p>Find value in the middle - O(N)</p>
 <p>O(N)</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html#l00161">161</a> of file <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html">windowed_median.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  161</span>                                 {</div>
 <div class="line"><span class="lineno">  162</span>        <span class="keyword">auto</span> window = <a class="code hl_variable" href="#a825a7aaef844c9f743a27b268e8569b2">_window</a>;</div>
-<div class="line"><span class="lineno">  163</span>        window.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/sort.html">sort</a>();  <span class="comment">/// Sort window - O(NlogN)</span></div>
+<div class="line"><span class="lineno">  163</span>        window.sort();  </div>
 <div class="line"><span class="lineno">  164</span>        <span class="keyword">auto</span> median =</div>
-<div class="line"><span class="lineno">  165</span>            *<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a>(window.begin(),</div>
-<div class="line"><span class="lineno">  166</span>                  window.size() / 2);  <span class="comment">/// Find value in the middle - O(N)</span></div>
+<div class="line"><span class="lineno">  165</span>            *next(window.begin(),</div>
+<div class="line"><span class="lineno">  166</span>                  window.size() / 2);  </div>
 <div class="line"><span class="lineno">  167</span>        <span class="keywordflow">if</span> (window.size() % 2 != 0) {</div>
 <div class="line"><span class="lineno">  168</span>            <span class="keywordflow">return</span> median;</div>
 <div class="line"><span class="lineno">  169</span>        }</div>
 <div class="line"><span class="lineno">  170</span>        <span class="keywordflow">return</span> 0.5f * median +</div>
-<div class="line"><span class="lineno">  171</span>               0.5f * *<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a>(window.begin(), window.size() / 2 - 1);  <span class="comment">/// O(N)</span></div>
+<div class="line"><span class="lineno">  171</span>               0.5f * *next(window.begin(), window.size() / 2 - 1);  </div>
 <div class="line"><span class="lineno">  172</span>    }</div>
-<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_a825a7aaef844c9f743a27b268e8569b2"><div class="ttname"><a href="#a825a7aaef844c9f743a27b268e8569b2">probability::windowed_median::WindowedMedian::_window</a></div><div class="ttdeci">Window _window</div><div class="ttdoc">a sliding window of values along the stream</div><div class="ttdef"><b>Definition</b> windowed_median.cpp:58</div></div>
-<div class="ttc" id="asort_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/sort.html">std::list::sort</a></div><div class="ttdeci">T sort(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph.svg" width="335" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_a825a7aaef844c9f743a27b268e8569b2"><div class="ttname"><a href="#a825a7aaef844c9f743a27b268e8569b2">probability::windowed_median::WindowedMedian::_window</a></div><div class="ttdeci">Window _window</div><div class="ttdoc">a sliding window of values along the stream</div><div class="ttdef"><b>Definition</b> <a href="../../d1/ded/windowed__median_8cpp_source.html#l00058">windowed_median.cpp:58</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a6b52b7851750f28d53508e63c52a69f7" name="a6b52b7851750f28d53508e63c52a69f7"></a>
@@ -393,30 +390,20 @@ Here is the call graph for this function:</div>
 <p>If exceeding size of window, pop from its left side</p>
 <p>Erase from the multi-value BST the window left side value</p>
 <p>Pop the left side value from the window - O(1)</p>
-<div class="fragment"><div class="line"><span class="lineno">  129</span>                           {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  130</span><span class="comment">        /// Push new value to the back of the sliding window - O(1)</span></div>
-<div class="line"><span class="lineno">  131</span><span class="comment"></span>        <a class="code hl_variable" href="#a825a7aaef844c9f743a27b268e8569b2">_window</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/push_back.html">push_back</a>(value);</div>
-<div class="line"><span class="lineno">  132</span>        <a class="code hl_function" href="#a3a7f57679e9cd6c9f042dfd0612b2b24">insertToSorted</a>(value);  <span class="comment">// Insert value to the multi-value BST - O(logN)</span></div>
-<div class="line"><span class="lineno">  133</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a825a7aaef844c9f743a27b268e8569b2">_window</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/size.html">size</a>() &gt; <a class="code hl_variable" href="#aafda847b152684578dab891e5268d750">_windowSize</a>) {  <span class="comment">/// If exceeding size of window,</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  134</span><span class="comment">                                             /// pop from its left side</span></div>
-<div class="line"><span class="lineno">  135</span><span class="comment"></span>            <a class="code hl_function" href="#af544e271ea19a6fd69a6b3ed6816453e">eraseFromSorted</a>(</div>
-<div class="line"><span class="lineno">  136</span>                <a class="code hl_variable" href="#a825a7aaef844c9f743a27b268e8569b2">_window</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/front.html">front</a>());  <span class="comment">/// Erase from the multi-value BST</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  137</span><span class="comment">                                   /// the window left side value</span></div>
-<div class="line"><span class="lineno">  138</span><span class="comment"></span>            <a class="code hl_variable" href="#a825a7aaef844c9f743a27b268e8569b2">_window</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/pop_front.html">pop_front</a>();   <span class="comment">/// Pop the left side value from the window -</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  139</span><span class="comment">                                   /// O(1)</span></div>
-<div class="line"><span class="lineno">  140</span><span class="comment"></span>        }</div>
-<div class="line"><span class="lineno">  141</span>    }</div>
-<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_a3a7f57679e9cd6c9f042dfd0612b2b24"><div class="ttname"><a href="#a3a7f57679e9cd6c9f042dfd0612b2b24">probability::windowed_median::WindowedMedian::insertToSorted</a></div><div class="ttdeci">void insertToSorted(int value)</div><div class="ttdoc">Inserts a value to a sorted multi-value BST.</div><div class="ttdef"><b>Definition</b> windowed_median.cpp:69</div></div>
-<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_af544e271ea19a6fd69a6b3ed6816453e"><div class="ttname"><a href="#af544e271ea19a6fd69a6b3ed6816453e">probability::windowed_median::WindowedMedian::eraseFromSorted</a></div><div class="ttdeci">void eraseFromSorted(int value)</div><div class="ttdoc">Erases a value from a sorted multi-value BST.</div><div class="ttdef"><b>Definition</b> windowed_median.cpp:95</div></div>
-<div class="ttc" id="afront_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/front.html">std::list::front</a></div><div class="ttdeci">T front(T... args)</div></div>
-<div class="ttc" id="apop_front_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/pop_front.html">std::list::pop_front</a></div><div class="ttdeci">T pop_front(T... args)</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/push_back.html">std::list::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph.svg" width="603" height="376"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
 
+<p class="definition">Definition at line <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html#l00129">129</a> of file <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html">windowed_median.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  129</span>                           {</div>
+<div class="line"><span class="lineno">  131</span>        <a class="code hl_variable" href="#a825a7aaef844c9f743a27b268e8569b2">_window</a>.push_back(value);</div>
+<div class="line"><span class="lineno">  132</span>        <a class="code hl_function" href="#a3a7f57679e9cd6c9f042dfd0612b2b24">insertToSorted</a>(value);  <span class="comment">// Insert value to the multi-value BST - O(logN)</span></div>
+<div class="line"><span class="lineno">  133</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#a825a7aaef844c9f743a27b268e8569b2">_window</a>.size() &gt; <a class="code hl_variable" href="#aafda847b152684578dab891e5268d750">_windowSize</a>) {  </div>
+<div class="line"><span class="lineno">  135</span>            <a class="code hl_function" href="#af544e271ea19a6fd69a6b3ed6816453e">eraseFromSorted</a>(</div>
+<div class="line"><span class="lineno">  136</span>                <a class="code hl_variable" href="#a825a7aaef844c9f743a27b268e8569b2">_window</a>.front());  </div>
+<div class="line"><span class="lineno">  138</span>            <a class="code hl_variable" href="#a825a7aaef844c9f743a27b268e8569b2">_window</a>.pop_front();   </div>
+<div class="line"><span class="lineno">  140</span>        }</div>
+<div class="line"><span class="lineno">  141</span>    }</div>
+<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_a3a7f57679e9cd6c9f042dfd0612b2b24"><div class="ttname"><a href="#a3a7f57679e9cd6c9f042dfd0612b2b24">probability::windowed_median::WindowedMedian::insertToSorted</a></div><div class="ttdeci">void insertToSorted(int value)</div><div class="ttdoc">Inserts a value to a sorted multi-value BST.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/ded/windowed__median_8cpp_source.html#l00069">windowed_median.cpp:69</a></div></div>
+<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_af544e271ea19a6fd69a6b3ed6816453e"><div class="ttname"><a href="#af544e271ea19a6fd69a6b3ed6816453e">probability::windowed_median::WindowedMedian::eraseFromSorted</a></div><div class="ttdeci">void eraseFromSorted(int value)</div><div class="ttdoc">Erases a value from a sorted multi-value BST.</div><div class="ttdef"><b>Definition</b> <a href="../../d1/ded/windowed__median_8cpp_source.html#l00095">windowed_median.cpp:95</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a3a7f57679e9cd6c9f042dfd0612b2b24" name="a3a7f57679e9cd6c9f042dfd0612b2b24"></a>
@@ -454,35 +441,25 @@ Here is the call graph for this function:</div>
 <p>If new value goes to left tree branch, and number of elements is even, the new median in the balanced tree is the left child of the median before the insertion</p>
 <p>However, if the new value goes to the right branch, the previous median's right child is the new median in the balanced tree</p>
 <p>O(1) - traversing one step to the right child</p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html#l00069">69</a> of file <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html">windowed_median.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   69</span>                                   {</div>
-<div class="line"><span class="lineno">   70</span>        <a class="code hl_variable" href="#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset/insert.html">insert</a>(value);  <span class="comment">/// Insert value to BST - O(logN)</span></div>
-<div class="line"><span class="lineno">   71</span>        <span class="keyword">const</span> <span class="keyword">auto</span> sz = <a class="code hl_variable" href="#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset/size.html">size</a>();</div>
-<div class="line"><span class="lineno">   72</span>        <span class="keywordflow">if</span> (sz == 1) {  <span class="comment">/// For the first value, set median iterator to BST root</span></div>
-<div class="line"><span class="lineno">   73</span>            <a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> = <a class="code hl_variable" href="#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset/begin.html">begin</a>();</div>
+<div class="line"><span class="lineno">   70</span>        <a class="code hl_variable" href="#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.insert(value);  </div>
+<div class="line"><span class="lineno">   71</span>        <span class="keyword">const</span> <span class="keyword">auto</span> sz = <a class="code hl_variable" href="#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.size();</div>
+<div class="line"><span class="lineno">   72</span>        <span class="keywordflow">if</span> (sz == 1) {  </div>
+<div class="line"><span class="lineno">   73</span>            <a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> = <a class="code hl_variable" href="#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.begin();</div>
 <div class="line"><span class="lineno">   74</span>            <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">   75</span>        }</div>
-<div class="line"><span class="lineno">   76</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   77</span><span class="comment">        /// If new value goes to left tree branch, and number of elements is</span></div>
-<div class="line"><span class="lineno">   78</span><span class="comment">        /// even, the new median in the balanced tree is the left child of the</span></div>
-<div class="line"><span class="lineno">   79</span><span class="comment">        /// median before the insertion</span></div>
-<div class="line"><span class="lineno">   80</span><span class="comment"></span>        <span class="keywordflow">if</span> (value &lt; *<a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> &amp;&amp; sz % 2 == 0) {</div>
+<div class="line"><span class="lineno">   76</span> </div>
+<div class="line"><span class="lineno">   80</span>        <span class="keywordflow">if</span> (value &lt; *<a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> &amp;&amp; sz % 2 == 0) {</div>
 <div class="line"><span class="lineno">   81</span>            --<a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>;  <span class="comment">// O(1) - traversing one step to the left child</span></div>
 <div class="line"><span class="lineno">   82</span>        }</div>
-<div class="line"><span class="lineno">   83</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   84</span><span class="comment">        /// However, if the new value goes to the right branch, the previous</span></div>
-<div class="line"><span class="lineno">   85</span><span class="comment">        /// median&#39;s right child is the new median in the balanced tree</span></div>
-<div class="line"><span class="lineno">   86</span><span class="comment"></span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (value &gt;= *<a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> &amp;&amp; sz % 2 != 0) {</div>
-<div class="line"><span class="lineno">   87</span>            ++<a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>;  <span class="comment">/// O(1) - traversing one step to the right child</span></div>
+<div class="line"><span class="lineno">   83</span> </div>
+<div class="line"><span class="lineno">   86</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (value &gt;= *<a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> &amp;&amp; sz % 2 != 0) {</div>
+<div class="line"><span class="lineno">   87</span>            ++<a class="code hl_variable" href="#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>;  </div>
 <div class="line"><span class="lineno">   88</span>        }</div>
 <div class="line"><span class="lineno">   89</span>    }</div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/multiset/begin.html">std::multiset::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="ainsert_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/multiset/insert.html">std::multiset::insert</a></div><div class="ttdeci">T insert(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a3a7f57679e9cd6c9f042dfd0612b2b24_cgraph.svg" width="374" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <h2 class="groupheader">Member Data Documentation</h2>
@@ -496,7 +473,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset.html">std::multiset</a>&lt;int&gt;::const_iterator probability::windowed_median::WindowedMedian::_itMedian</td>
+          <td class="memname">std::multiset&lt;int&gt;::const_iterator probability::windowed_median::WindowedMedian::_itMedian</td>
         </tr>
       </table>
   </td>
@@ -507,6 +484,8 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 <p>an iterator that points to the root of the multi-value BST </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html#l00062">62</a> of file <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html">windowed_median.cpp</a>.</p>
+
 </div>
 </div>
 <a id="aacd76f078632faee1a8788d031e6c2de" name="aacd76f078632faee1a8788d031e6c2de"></a>
@@ -519,7 +498,7 @@ Here is the call graph for this function:</div>
   <td class="mlabels-left">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset.html">std::multiset</a>&lt;int&gt; probability::windowed_median::WindowedMedian::_sortedValues</td>
+          <td class="memname">std::multiset&lt;int&gt; probability::windowed_median::WindowedMedian::_sortedValues</td>
         </tr>
       </table>
   </td>
@@ -530,10 +509,64 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 <p>a DS to represent a balanced multi-value binary search tree (BST) </p>
 
+<p class="definition">Definition at line <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html">windowed_median.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a825a7aaef844c9f743a27b268e8569b2" name="a825a7aaef844c9f743a27b268e8569b2"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a825a7aaef844c9f743a27b268e8569b2">&#9670;&#160;</a></span>_window</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">Window probability::windowed_median::WindowedMedian::_window</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>a sliding window of values along the stream </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html#l00058">58</a> of file <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html">windowed_median.cpp</a>.</p>
+
+</div>
+</div>
+<a id="aafda847b152684578dab891e5268d750" name="aafda847b152684578dab891e5268d750"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aafda847b152684578dab891e5268d750">&#9670;&#160;</a></span>_windowSize</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">const size_type probability::windowed_median::WindowedMedian::_windowSize</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>sliding window size </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html#l00057">57</a> of file <a class="el" href="../../d1/ded/windowed__median_8cpp_source.html">windowed_median.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>probability/<a class="el" href="../../d1/ded/windowed__median_8cpp.html">windowed_median.cpp</a></li>
+<li>probability/<a class="el" href="../../d1/ded/windowed__median_8cpp_source.html">windowed_median.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a3a7f57679e9cd6c9f042dfd0612b2b24_cgraph.map b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a3a7f57679e9cd6c9f042dfd0612b2b24_cgraph.map
deleted file mode 100644
index f70acc806..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a3a7f57679e9cd6c9f042dfd0612b2b24_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="probability::windowed_median::WindowedMedian::insertToSorted" name="probability::windowed_median::WindowedMedian::insertToSorted">
-<area shape="rect" id="Node000001" title="Inserts a value to a sorted multi&#45;value BST." alt="" coords="5,40,187,95"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/multiset/begin.html#" title=" " alt="" coords="235,5,368,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="186,43,229,33,231,38,187,48"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/multiset/insert.html#" title=" " alt="" coords="235,55,368,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="187,65,219,65,219,70,187,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/multiset/size.html#" title=" " alt="" coords="239,104,364,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="187,87,231,97,229,102,186,92"/>
-</map>
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a3a7f57679e9cd6c9f042dfd0612b2b24_cgraph.md5 b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a3a7f57679e9cd6c9f042dfd0612b2b24_cgraph.md5
deleted file mode 100644
index 6776d52b9..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a3a7f57679e9cd6c9f042dfd0612b2b24_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-23af3cec44715d19fdc09fc1d904afae
\ No newline at end of file
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a3a7f57679e9cd6c9f042dfd0612b2b24_cgraph.svg b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a3a7f57679e9cd6c9f042dfd0612b2b24_cgraph.svg
deleted file mode 100644
index 2916d089f..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a3a7f57679e9cd6c9f042dfd0612b2b24_cgraph.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::windowed_median::WindowedMedian::insertToSorted Pages: 1 -->
-<svg width="280pt" height="101pt"
- viewBox="0.00 0.00 280.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>probability::windowed_median::WindowedMedian::insertToSorted</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Inserts a value to a sorted multi&#45;value BST.">
-<polygon fill="#999999" stroke="#666666" points="136,-67.5 0,-67.5 0,-25.75 136,-25.75 136,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="68" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insertToSorted</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.62,-93.25 172.38,-93.25 172.38,-74 271.62,-74 271.62,-93.25"/>
-<text text-anchor="middle" x="222" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.11,-62.96C146.97,-65.61 158.08,-68.31 168.53,-70.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.56,-74.22 178.1,-73.18 169.21,-67.42 167.56,-74.22"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272,-56.25 172,-56.25 172,-37 272,-37 272,-56.25"/>
-<text text-anchor="middle" x="222" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.11,-46.62C144.13,-46.62 152.28,-46.62 160.19,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.08,-50.13 170.08,-46.63 160.08,-43.13 160.08,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269,-19.25 175,-19.25 175,0 269,0 269,-19.25"/>
-<text text-anchor="middle" x="222" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.11,-30.29C146.97,-27.64 158.08,-24.94 168.53,-22.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.21,-25.83 178.1,-20.07 167.56,-19.03 169.21,-25.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a3a7f57679e9cd6c9f042dfd0612b2b24_cgraph_org.svg b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a3a7f57679e9cd6c9f042dfd0612b2b24_cgraph_org.svg
deleted file mode 100644
index dae6d372f..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a3a7f57679e9cd6c9f042dfd0612b2b24_cgraph_org.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::windowed_median::WindowedMedian::insertToSorted Pages: 1 -->
-<svg width="280pt" height="101pt"
- viewBox="0.00 0.00 280.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>probability::windowed_median::WindowedMedian::insertToSorted</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Inserts a value to a sorted multi&#45;value BST.">
-<polygon fill="#999999" stroke="#666666" points="136,-67.5 0,-67.5 0,-25.75 136,-25.75 136,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="68" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insertToSorted</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.62,-93.25 172.38,-93.25 172.38,-74 271.62,-74 271.62,-93.25"/>
-<text text-anchor="middle" x="222" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.11,-62.96C146.97,-65.61 158.08,-68.31 168.53,-70.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.56,-74.22 178.1,-73.18 169.21,-67.42 167.56,-74.22"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272,-56.25 172,-56.25 172,-37 272,-37 272,-56.25"/>
-<text text-anchor="middle" x="222" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.11,-46.62C144.13,-46.62 152.28,-46.62 160.19,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.08,-50.13 170.08,-46.63 160.08,-43.13 160.08,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269,-19.25 175,-19.25 175,0 269,0 269,-19.25"/>
-<text text-anchor="middle" x="222" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.11,-30.29C146.97,-27.64 158.08,-24.94 168.53,-22.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.21,-25.83 178.1,-20.07 167.56,-19.03 169.21,-25.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph.map b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph.map
deleted file mode 100644
index f6a5eef4a..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="probability::windowed_median::WindowedMedian::getMedianNaive" name="probability::windowed_median::WindowedMedian::getMedianNaive">
-<area shape="rect" id="Node000001" title="A naive and inefficient method to obtain the median of the sliding window. Used for testing!" alt="" coords="5,5,187,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/sort.html#" title=" " alt="" coords="235,20,329,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="187,30,219,30,219,36,187,36"/>
-</map>
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph.md5 b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph.md5
deleted file mode 100644
index 99a196c5d..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ec1b5cae49714a888e2f851fe6e922f2
\ No newline at end of file
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph.svg b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph.svg
deleted file mode 100644
index 33a544909..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::windowed_median::WindowedMedian::getMedianNaive Pages: 1 -->
-<svg width="251pt" height="50pt"
- viewBox="0.00 0.00 250.75 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>probability::windowed_median::WindowedMedian::getMedianNaive</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A naive and inefficient method to obtain the median of the sliding window. Used for testing!">
-<polygon fill="#999999" stroke="#666666" points="136,-41.75 0,-41.75 0,0 136,0 136,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="68" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::getMedianNaive</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242.75,-30.5 172,-30.5 172,-11.25 242.75,-11.25 242.75,-30.5"/>
-<text text-anchor="middle" x="207.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.48,-20.88C144.59,-20.88 152.72,-20.88 160.43,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.22,-24.38 170.22,-20.88 160.22,-17.38 160.22,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph_org.svg b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph_org.svg
deleted file mode 100644
index d4ff57d8d..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::windowed_median::WindowedMedian::getMedianNaive Pages: 1 -->
-<svg width="251pt" height="50pt"
- viewBox="0.00 0.00 250.75 49.75" 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.75)">
-<title>probability::windowed_median::WindowedMedian::getMedianNaive</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="A naive and inefficient method to obtain the median of the sliding window. Used for testing!">
-<polygon fill="#999999" stroke="#666666" points="136,-41.75 0,-41.75 0,0 136,0 136,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="68" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::getMedianNaive</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/sort.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="242.75,-30.5 172,-30.5 172,-11.25 242.75,-11.25 242.75,-30.5"/>
-<text text-anchor="middle" x="207.38" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::sort</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.48,-20.88C144.59,-20.88 152.72,-20.88 160.43,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.22,-24.38 170.22,-20.88 160.22,-17.38 160.22,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph.map b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph.map
deleted file mode 100644
index f7b856406..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph.map
+++ /dev/null
@@ -1,26 +0,0 @@
-<map id="probability::windowed_median::WindowedMedian::insert" name="probability::windowed_median::WindowedMedian::insert">
-<area shape="rect" id="Node000001" title="Insert a new value to the stream." alt="" coords="5,200,187,255"/>
-<area shape="rect" id="Node000002" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e" title="Erases a value from a sorted multi&#45;value BST." alt="" coords="235,36,416,91"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="122,197,171,149,233,101,240,97,243,102,236,106,175,154,125,201"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/front.html#" title=" " alt="" coords="276,116,374,142"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="143,197,234,152,261,142,262,147,236,157,146,202"/>
-<area shape="rect" id="Node000007" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24" title="Inserts a value to a sorted multi&#45;value BST." alt="" coords="235,166,416,222"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="187,212,219,207,220,212,187,217"/>
-<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/pop_front.html#" title=" " alt="" coords="262,247,388,272"/>
-<area shape="poly" id="edge10_Node000001_Node000010" title=" " alt="" coords="187,238,247,246,246,251,187,243"/>
-<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/push_back.html#" title=" " alt="" coords="258,296,393,322"/>
-<area shape="poly" id="edge11_Node000001_Node000011" title=" " alt="" coords="162,253,236,282,255,289,254,294,234,287,160,258"/>
-<area shape="rect" id="Node000012" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/size.html#" title=" " alt="" coords="277,345,374,371"/>
-<area shape="poly" id="edge12_Node000001_Node000012" title=" " alt="" coords="128,254,177,294,236,332,263,343,261,347,233,337,173,299,125,258"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/multiset/erase.html#" title=" " alt="" coords="464,5,597,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="416,41,454,32,455,38,417,46"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/multiset/find.html#" title=" " alt="" coords="470,55,592,80"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="416,63,454,63,454,69,416,68"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/multiset/size.html#" title=" " alt="" coords="468,112,593,138"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="417,88,471,104,470,110,415,93"/>
-<area shape="poly" id="edge9_Node000007_Node000005" title=" " alt="" coords="409,163,475,141,477,146,411,168"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/multiset/begin.html#" title=" " alt="" coords="464,177,597,203"/>
-<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="416,190,449,189,449,194,416,195"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/multiset/insert.html#" title=" " alt="" coords="464,227,597,252"/>
-<area shape="poly" id="edge8_Node000007_Node000009" title=" " alt="" coords="417,212,455,220,454,225,416,217"/>
-</map>
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph.md5 b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph.md5
deleted file mode 100644
index 7be927e86..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fec25684f35884d46c18f6f0a7de0130
\ No newline at end of file
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph.svg b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph.svg
deleted file mode 100644
index 350e942f3..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph.svg
+++ /dev/null
@@ -1,260 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::windowed_median::WindowedMedian::insert Pages: 1 -->
-<svg width="452pt" height="282pt"
- viewBox="0.00 0.00 452.00 282.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 278.25)">
-<title>probability::windowed_median::WindowedMedian::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Insert a new value to the stream.">
-<polygon fill="#999999" stroke="#666666" points="136,-128.5 0,-128.5 0,-86.75 136,-86.75 136,-128.5"/>
-<text text-anchor="start" x="8" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="8" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="68" y="-92.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e" target="_top" xlink:title="Erases a value from a sorted multi&#45;value BST.">
-<polygon fill="white" stroke="#666666" points="308,-251.5 172,-251.5 172,-209.75 308,-209.75 308,-251.5"/>
-<text text-anchor="start" x="180" y="-238" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="180" y="-226.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="240" y="-215.5" font-family="Helvetica,sans-Serif" font-size="10.00">::eraseFromSorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.71,-128.94C108.35,-149.28 140.11,-179.84 172,-200.62 173.61,-201.68 175.27,-202.71 176.96,-203.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.16,-206.73 185.6,-208.54 178.57,-200.61 175.16,-206.73"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="276.88,-191.25 203.12,-191.25 203.12,-172 276.88,-172 276.88,-191.25"/>
-<text text-anchor="middle" x="240" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.32,-128.91C123.79,-140.02 148.69,-153.22 172,-162.62 178.4,-165.21 185.28,-167.58 192.11,-169.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.68,-172.94 201.26,-172.43 192.67,-166.23 190.68,-172.94"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24" target="_top" xlink:title="Inserts a value to a sorted multi&#45;value BST.">
-<polygon fill="white" stroke="#666666" points="308,-153.5 172,-153.5 172,-111.75 308,-111.75 308,-153.5"/>
-<text text-anchor="start" x="180" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="180" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="240" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insertToSorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.19,-117.51C144.14,-118.67 152.3,-119.88 160.39,-121.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.84,-124.52 170.25,-122.51 160.86,-117.6 159.84,-124.52"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="287.38,-93.25 192.62,-93.25 192.62,-74 287.38,-74 287.38,-93.25"/>
-<text text-anchor="middle" x="240" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge10_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge10_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.19,-98.14C150.98,-96.05 166.53,-93.86 180.92,-91.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.28,-95.31 190.69,-90.45 180.3,-88.38 181.28,-95.31"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.75,-56.25 189.25,-56.25 189.25,-37 290.75,-37 290.75,-56.25"/>
-<text text-anchor="middle" x="240" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge11_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge11_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.44,-86.27C133.74,-78.9 153.57,-70.92 172,-64.62 176.81,-62.98 181.86,-61.39 186.93,-59.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.89,-63.25 196.54,-57.13 185.96,-56.52 187.89,-63.25"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="276.12,-19.25 203.88,-19.25 203.88,0 276.12,0 276.12,-19.25"/>
-<text text-anchor="middle" x="240" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge12_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge12_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.93,-86.33C110.65,-68.28 141.18,-42.95 172,-27.62 178.44,-24.42 185.52,-21.73 192.6,-19.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="193.51,-22.88 202.16,-16.75 191.58,-16.15 193.51,-22.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="444,-274.25 344,-274.25 344,-255 444,-255 444,-274.25"/>
-<text text-anchor="middle" x="394" y="-260.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::erase</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.11,-245.64C317.72,-247.79 327.53,-249.98 336.9,-252.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.07,-255.48 346.59,-254.24 337.6,-248.65 336.07,-255.48"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="439.88,-237.25 348.12,-237.25 348.12,-218 439.88,-218 439.88,-237.25"/>
-<text text-anchor="middle" x="394" y="-223.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::find</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.11,-229.3C317.51,-229.12 327.08,-228.93 336.26,-228.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.18,-232.25 346.11,-228.55 336.05,-225.25 336.18,-232.25"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441,-194.25 347,-194.25 347,-175 441,-175 441,-194.25"/>
-<text text-anchor="middle" x="394" y="-180.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.11,-210.31C321.89,-206.15 336.06,-201.86 348.79,-198.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="349.54,-201.43 358.1,-195.19 347.52,-194.73 349.54,-201.43"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge9_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge9_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.26,-153.93C320.02,-159.66 337.7,-165.71 352.89,-170.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="351.44,-174.11 362.04,-174.03 353.71,-167.48 351.44,-174.11"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="443.62,-145.25 344.38,-145.25 344.38,-126 443.62,-126 443.62,-145.25"/>
-<text text-anchor="middle" x="394" y="-131.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::begin</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.11,-133.95C316.33,-134.11 324.68,-134.28 332.79,-134.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="332.46,-137.93 342.53,-134.63 332.6,-130.93 332.46,-137.93"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="444,-108.25 344,-108.25 344,-89 444,-89 444,-108.25"/>
-<text text-anchor="middle" x="394" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::insert</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.11,-117.61C317.72,-115.46 327.53,-113.27 336.9,-111.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="337.6,-114.6 346.59,-109.01 336.07,-107.77 337.6,-114.6"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph_org.svg b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph_org.svg
deleted file mode 100644
index f5c290188..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph_org.svg
+++ /dev/null
@@ -1,234 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::windowed_median::WindowedMedian::insert Pages: 1 -->
-<svg width="452pt" height="282pt"
- viewBox="0.00 0.00 452.00 282.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 278.25)">
-<title>probability::windowed_median::WindowedMedian::insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Insert a new value to the stream.">
-<polygon fill="#999999" stroke="#666666" points="136,-128.5 0,-128.5 0,-86.75 136,-86.75 136,-128.5"/>
-<text text-anchor="start" x="8" y="-115" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="8" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="68" y="-92.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e" target="_top" xlink:title="Erases a value from a sorted multi&#45;value BST.">
-<polygon fill="white" stroke="#666666" points="308,-251.5 172,-251.5 172,-209.75 308,-209.75 308,-251.5"/>
-<text text-anchor="start" x="180" y="-238" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="180" y="-226.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="240" y="-215.5" font-family="Helvetica,sans-Serif" font-size="10.00">::eraseFromSorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M88.71,-128.94C108.35,-149.28 140.11,-179.84 172,-200.62 173.61,-201.68 175.27,-202.71 176.96,-203.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.16,-206.73 185.6,-208.54 178.57,-200.61 175.16,-206.73"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="276.88,-191.25 203.12,-191.25 203.12,-172 276.88,-172 276.88,-191.25"/>
-<text text-anchor="middle" x="240" y="-177.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M104.32,-128.91C123.79,-140.02 148.69,-153.22 172,-162.62 178.4,-165.21 185.28,-167.58 192.11,-169.72"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.68,-172.94 201.26,-172.43 192.67,-166.23 190.68,-172.94"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24" target="_top" xlink:title="Inserts a value to a sorted multi&#45;value BST.">
-<polygon fill="white" stroke="#666666" points="308,-153.5 172,-153.5 172,-111.75 308,-111.75 308,-153.5"/>
-<text text-anchor="start" x="180" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="180" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="240" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insertToSorted</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.19,-117.51C144.14,-118.67 152.3,-119.88 160.39,-121.06"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.84,-124.52 170.25,-122.51 160.86,-117.6 159.84,-124.52"/>
-</a>
-</g>
-</g>
-<!-- Node10 -->
-<g id="Node000010" class="node">
-<title>Node10</title>
-<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="287.38,-93.25 192.62,-93.25 192.62,-74 287.38,-74 287.38,-93.25"/>
-<text text-anchor="middle" x="240" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_front</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node10 -->
-<g id="edge10_Node000001_Node000010" class="edge">
-<title>Node1&#45;&gt;Node10</title>
-<g id="a_edge10_Node000001_Node000010"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.19,-98.14C150.98,-96.05 166.53,-93.86 180.92,-91.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.28,-95.31 190.69,-90.45 180.3,-88.38 181.28,-95.31"/>
-</a>
-</g>
-</g>
-<!-- Node11 -->
-<g id="Node000011" class="node">
-<title>Node11</title>
-<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="290.75,-56.25 189.25,-56.25 189.25,-37 290.75,-37 290.75,-56.25"/>
-<text text-anchor="middle" x="240" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node11 -->
-<g id="edge11_Node000001_Node000011" class="edge">
-<title>Node1&#45;&gt;Node11</title>
-<g id="a_edge11_Node000001_Node000011"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M116.44,-86.27C133.74,-78.9 153.57,-70.92 172,-64.62 176.81,-62.98 181.86,-61.39 186.93,-59.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.89,-63.25 196.54,-57.13 185.96,-56.52 187.89,-63.25"/>
-</a>
-</g>
-</g>
-<!-- Node12 -->
-<g id="Node000012" class="node">
-<title>Node12</title>
-<g id="a_Node000012"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="276.12,-19.25 203.88,-19.25 203.88,0 276.12,0 276.12,-19.25"/>
-<text text-anchor="middle" x="240" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node12 -->
-<g id="edge12_Node000001_Node000012" class="edge">
-<title>Node1&#45;&gt;Node12</title>
-<g id="a_edge12_Node000001_Node000012"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90.93,-86.33C110.65,-68.28 141.18,-42.95 172,-27.62 178.44,-24.42 185.52,-21.73 192.6,-19.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="193.51,-22.88 202.16,-16.75 191.58,-16.15 193.51,-22.88"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="444,-274.25 344,-274.25 344,-255 444,-255 444,-274.25"/>
-<text text-anchor="middle" x="394" y="-260.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::erase</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.11,-245.64C317.72,-247.79 327.53,-249.98 336.9,-252.08"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.07,-255.48 346.59,-254.24 337.6,-248.65 336.07,-255.48"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="439.88,-237.25 348.12,-237.25 348.12,-218 439.88,-218 439.88,-237.25"/>
-<text text-anchor="middle" x="394" y="-223.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::find</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.11,-229.3C317.51,-229.12 327.08,-228.93 336.26,-228.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="336.18,-232.25 346.11,-228.55 336.05,-225.25 336.18,-232.25"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441,-194.25 347,-194.25 347,-175 441,-175 441,-194.25"/>
-<text text-anchor="middle" x="394" y="-180.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::size</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.11,-210.31C321.89,-206.15 336.06,-201.86 348.79,-198.01"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="349.54,-201.43 358.1,-195.19 347.52,-194.73 349.54,-201.43"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node5 -->
-<g id="edge9_Node000007_Node000005" class="edge">
-<title>Node7&#45;&gt;Node5</title>
-<g id="a_edge9_Node000007_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M303.26,-153.93C320.02,-159.66 337.7,-165.71 352.89,-170.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="351.44,-174.11 362.04,-174.03 353.71,-167.48 351.44,-174.11"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="443.62,-145.25 344.38,-145.25 344.38,-126 443.62,-126 443.62,-145.25"/>
-<text text-anchor="middle" x="394" y="-131.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::begin</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.11,-133.95C316.33,-134.11 324.68,-134.28 332.79,-134.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="332.46,-137.93 342.53,-134.63 332.6,-130.93 332.46,-137.93"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="444,-108.25 344,-108.25 344,-89 444,-89 444,-108.25"/>
-<text text-anchor="middle" x="394" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::insert</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node9 -->
-<g id="edge8_Node000007_Node000009" class="edge">
-<title>Node7&#45;&gt;Node9</title>
-<g id="a_edge8_Node000007_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M308.11,-117.61C317.72,-115.46 327.53,-113.27 336.9,-111.17"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="337.6,-114.6 346.59,-109.01 336.07,-107.77 337.6,-114.6"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a938cafbdf70dc01e86e9bb12d29ec65d_cgraph.map b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a938cafbdf70dc01e86e9bb12d29ec65d_cgraph.map
deleted file mode 100644
index 52a4cc3b5..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a938cafbdf70dc01e86e9bb12d29ec65d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="probability::windowed_median::WindowedMedian::getMedian" name="probability::windowed_median::WindowedMedian::getMedian">
-<area shape="rect" id="Node000001" title="Gets the median of the values in the sliding window." alt="" coords="5,5,187,61"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/multiset/size.html#" title=" " alt="" coords="235,20,360,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="187,30,219,30,219,36,187,36"/>
-</map>
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a938cafbdf70dc01e86e9bb12d29ec65d_cgraph.md5 b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a938cafbdf70dc01e86e9bb12d29ec65d_cgraph.md5
deleted file mode 100644
index ad62a4c7f..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a938cafbdf70dc01e86e9bb12d29ec65d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-0f3e332de2f999ed26606078d7f048fd
\ No newline at end of file
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a938cafbdf70dc01e86e9bb12d29ec65d_cgraph.svg b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a938cafbdf70dc01e86e9bb12d29ec65d_cgraph.svg
deleted file mode 100644
index b1ca1f9c2..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a938cafbdf70dc01e86e9bb12d29ec65d_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::windowed_median::WindowedMedian::getMedian Pages: 1 -->
-<svg width="274pt" height="50pt"
- viewBox="0.00 0.00 274.00 49.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 45.75)">
-<title>probability::windowed_median::WindowedMedian::getMedian</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Gets the median of the values in the sliding window.">
-<polygon fill="#999999" stroke="#666666" points="136,-41.75 0,-41.75 0,0 136,0 136,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="68" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::getMedian</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-30.5 172,-30.5 172,-11.25 266,-11.25 266,-30.5"/>
-<text text-anchor="middle" x="219" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.09,-20.88C144.19,-20.88 152.4,-20.88 160.34,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.23,-24.38 170.23,-20.88 160.23,-17.38 160.23,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a938cafbdf70dc01e86e9bb12d29ec65d_cgraph_org.svg b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a938cafbdf70dc01e86e9bb12d29ec65d_cgraph_org.svg
deleted file mode 100644
index 106b3e3ac..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a938cafbdf70dc01e86e9bb12d29ec65d_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::windowed_median::WindowedMedian::getMedian Pages: 1 -->
-<svg width="274pt" height="50pt"
- viewBox="0.00 0.00 274.00 49.75" 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.75)">
-<title>probability::windowed_median::WindowedMedian::getMedian</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Gets the median of the values in the sliding window.">
-<polygon fill="#999999" stroke="#666666" points="136,-41.75 0,-41.75 0,0 136,0 136,-41.75"/>
-<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="68" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::getMedian</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266,-30.5 172,-30.5 172,-11.25 266,-11.25 266,-30.5"/>
-<text text-anchor="middle" x="219" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.09,-20.88C144.19,-20.88 152.4,-20.88 160.34,-20.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.23,-24.38 170.23,-20.88 160.23,-17.38 160.23,-24.38"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_af544e271ea19a6fd69a6b3ed6816453e_cgraph.map b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_af544e271ea19a6fd69a6b3ed6816453e_cgraph.map
deleted file mode 100644
index 583b15d79..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_af544e271ea19a6fd69a6b3ed6816453e_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="probability::windowed_median::WindowedMedian::eraseFromSorted" name="probability::windowed_median::WindowedMedian::eraseFromSorted">
-<area shape="rect" id="Node000001" title="Erases a value from a sorted multi&#45;value BST." alt="" coords="5,40,187,95"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/multiset/erase.html#" title=" " alt="" coords="235,5,368,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="186,43,229,33,231,38,187,48"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/multiset/find.html#" title=" " alt="" coords="240,55,362,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="187,65,224,65,224,70,187,70"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/multiset/size.html#" title=" " alt="" coords="239,104,364,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="187,87,231,97,229,102,186,92"/>
-</map>
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_af544e271ea19a6fd69a6b3ed6816453e_cgraph.md5 b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_af544e271ea19a6fd69a6b3ed6816453e_cgraph.md5
deleted file mode 100644
index 921973c02..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_af544e271ea19a6fd69a6b3ed6816453e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-acd4114aa4b6e22e94b55d063d346be8
\ No newline at end of file
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_af544e271ea19a6fd69a6b3ed6816453e_cgraph.svg b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_af544e271ea19a6fd69a6b3ed6816453e_cgraph.svg
deleted file mode 100644
index 8381b17eb..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_af544e271ea19a6fd69a6b3ed6816453e_cgraph.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::windowed_median::WindowedMedian::eraseFromSorted Pages: 1 -->
-<svg width="280pt" height="101pt"
- viewBox="0.00 0.00 280.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>probability::windowed_median::WindowedMedian::eraseFromSorted</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Erases a value from a sorted multi&#45;value BST.">
-<polygon fill="#999999" stroke="#666666" points="136,-67.5 0,-67.5 0,-25.75 136,-25.75 136,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="68" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::eraseFromSorted</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272,-93.25 172,-93.25 172,-74 272,-74 272,-93.25"/>
-<text text-anchor="middle" x="222" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.11,-62.96C146.97,-65.61 158.08,-68.31 168.53,-70.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.56,-74.22 178.1,-73.18 169.21,-67.42 167.56,-74.22"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.88,-56.25 176.12,-56.25 176.12,-37 267.88,-37 267.88,-56.25"/>
-<text text-anchor="middle" x="222" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.11,-46.62C145.51,-46.62 155.08,-46.62 164.26,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.11,-50.13 174.11,-46.63 164.11,-43.13 164.11,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269,-19.25 175,-19.25 175,0 269,0 269,-19.25"/>
-<text text-anchor="middle" x="222" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.11,-30.29C146.97,-27.64 158.08,-24.94 168.53,-22.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.21,-25.83 178.1,-20.07 167.56,-19.03 169.21,-25.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_af544e271ea19a6fd69a6b3ed6816453e_cgraph_org.svg b/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_af544e271ea19a6fd69a6b3ed6816453e_cgraph_org.svg
deleted file mode 100644
index 3ee81beca..000000000
--- a/df/d34/classprobability_1_1windowed__median_1_1_windowed_median_af544e271ea19a6fd69a6b3ed6816453e_cgraph_org.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: probability::windowed_median::WindowedMedian::eraseFromSorted Pages: 1 -->
-<svg width="280pt" height="101pt"
- viewBox="0.00 0.00 280.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
-<title>probability::windowed_median::WindowedMedian::eraseFromSorted</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Erases a value from a sorted multi&#45;value BST.">
-<polygon fill="#999999" stroke="#666666" points="136,-67.5 0,-67.5 0,-25.75 136,-25.75 136,-67.5"/>
-<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
-<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
-<text text-anchor="middle" x="68" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">::eraseFromSorted</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/erase.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="272,-93.25 172,-93.25 172,-74 272,-74 272,-93.25"/>
-<text text-anchor="middle" x="222" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::erase</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.11,-62.96C146.97,-65.61 158.08,-68.31 168.53,-70.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.56,-74.22 178.1,-73.18 169.21,-67.42 167.56,-74.22"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.88,-56.25 176.12,-56.25 176.12,-37 267.88,-37 267.88,-56.25"/>
-<text text-anchor="middle" x="222" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.11,-46.62C145.51,-46.62 155.08,-46.62 164.26,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.11,-50.13 174.11,-46.63 164.11,-43.13 164.11,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/multiset/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="269,-19.25 175,-19.25 175,0 269,0 269,-19.25"/>
-<text text-anchor="middle" x="222" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::multiset::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M136.11,-30.29C146.97,-27.64 158.08,-24.94 168.53,-22.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.21,-25.83 178.1,-20.07 167.56,-19.03 169.21,-25.83"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d39/interpolation__search2_8cpp.html b/df/d39/interpolation__search2_8cpp.html
index b5bb95ebd..c5de0bc54 100644
--- a/df/d39/interpolation__search2_8cpp.html
+++ b/df/d39/interpolation__search2_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: search/interpolation_search2.cpp File Reference</title>
+<title>TheAlgorithms/C++: search/interpolation_search2.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -118,7 +135,9 @@ Include dependency graph for interpolation_search2.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/dc0/interpolation__search2_8cpp__incl.svg" width="146" height="126"><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">
+</div>
+<p><a href="../../df/d39/interpolation__search2_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:aa3ec659ec8394d186c761df81ad1f629" id="r_aa3ec659ec8394d186c761df81ad1f629"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa3ec659ec8394d186c761df81ad1f629">InterpolationSearch</a> (int A[], int n, int x)</td></tr>
@@ -128,6 +147,8 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Interpolation_search" target="_blank">Interpolation search</a> algorithm </p>
+
+<p class="definition">Definition in file <a class="el" href="../../df/d39/interpolation__search2_8cpp_source.html">interpolation_search2.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="aa3ec659ec8394d186c761df81ad1f629" name="aa3ec659ec8394d186c761df81ad1f629"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#aa3ec659ec8394d186c761df81ad1f629">&#9670;&#160;</a></span>InterpolationSearch()</h2>
@@ -163,6 +184,8 @@ Functions</h2></td></tr>
 <dl class="section return"><dt>Returns</dt><dd>index where the value is found </dd>
 <dd>
 -1 if not found </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d39/interpolation__search2_8cpp_source.html#l00015">15</a> of file <a class="el" href="../../df/d39/interpolation__search2_8cpp_source.html">interpolation_search2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   15</span>                                               {</div>
 <div class="line"><span class="lineno">   16</span>    <span class="keywordtype">int</span> low = 0;</div>
 <div class="line"><span class="lineno">   17</span>    <span class="keywordtype">int</span> high = n - 1;</div>
@@ -197,26 +220,20 @@ Functions</h2></td></tr>
 </div><div class="memdoc">
 <p>main function </p>
 <p>&lt; passed array A inside the InterpolationSearch function</p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d39/interpolation__search2_8cpp_source.html#l00032">32</a> of file <a class="el" href="../../df/d39/interpolation__search2_8cpp_source.html">interpolation_search2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   32</span>           {</div>
 <div class="line"><span class="lineno">   33</span>    <span class="keywordtype">int</span> A[] = {2, 4, 5, 7, 13, 14, 15, 23};</div>
 <div class="line"><span class="lineno">   34</span>    <span class="keywordtype">int</span> x = 17;</div>
-<div class="line"><span class="lineno">   35</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   36</span><span class="comment">    ///&lt; passed array A inside the InterpolationSearch function</span></div>
-<div class="line"><span class="lineno">   37</span><span class="comment"></span>    <span class="keywordtype">int</span> index = <a class="code hl_function" href="#aa3ec659ec8394d186c761df81ad1f629">InterpolationSearch</a>(A, 8, x);</div>
+<div class="line"><span class="lineno">   35</span> </div>
+<div class="line"><span class="lineno">   37</span>    <span class="keywordtype">int</span> index = <a class="code hl_function" href="#aa3ec659ec8394d186c761df81ad1f629">InterpolationSearch</a>(A, 8, x);</div>
 <div class="line"><span class="lineno">   38</span>    <span class="keywordflow">if</span> (index &lt; 0)</div>
-<div class="line"><span class="lineno">   39</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Number &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; not found&quot;</span> &lt;&lt; <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">   39</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Number &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; not found&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   40</span>    <span class="keywordflow">else</span></div>
-<div class="line"><span class="lineno">   41</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Number &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; is at &quot;</span> &lt;&lt; index &lt;&lt; <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">   41</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Number &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; is at &quot;</span> &lt;&lt; index &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   42</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="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="ainterpolation__search2_8cpp_html_aa3ec659ec8394d186c761df81ad1f629"><div class="ttname"><a href="#aa3ec659ec8394d186c761df81ad1f629">InterpolationSearch</a></div><div class="ttdeci">int InterpolationSearch(int A[], int n, int x)</div><div class="ttdef"><b>Definition</b> interpolation_search2.cpp:15</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="242" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="ainterpolation__search2_8cpp_html_aa3ec659ec8394d186c761df81ad1f629"><div class="ttname"><a href="#aa3ec659ec8394d186c761df81ad1f629">InterpolationSearch</a></div><div class="ttdeci">int InterpolationSearch(int A[], int n, int x)</div><div class="ttdef"><b>Definition</b> <a href="../../df/d39/interpolation__search2_8cpp_source.html#l00015">interpolation_search2.cpp:15</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 216e1e0ff..000000000
--- a/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="134,5,205,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,36,118,25,119,30,56,42"/>
-<area shape="rect" id="Node000003" href="$df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629" title=" " alt="" coords="103,55,236,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,45,88,51,87,56,55,50"/>
-</map>
diff --git a/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 2183f09a5..000000000
--- a/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-7b0fe994babe27e0c9d78dcac19343ff
\ No newline at end of file
diff --git a/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 9f9a8ac09..000000000
--- a/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="181pt" height="64pt"
- viewBox="0.00 0.00 181.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149.75,-56.25 96.25,-56.25 96.25,-37 149.75,-37 149.75,-56.25"/>
-<text text-anchor="middle" x="123" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-30.93C50.37,-33.35 68.48,-36.7 84.6,-39.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.94,-43.13 94.41,-41.51 85.21,-36.25 83.94,-43.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173,-19.25 73,-19.25 73,0 173,0 173,-19.25"/>
-<text text-anchor="middle" x="123" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">InterpolationSearch</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-24.49C44.29,-23.27 52.67,-21.8 61.43,-20.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.91,-23.73 71.15,-18.55 60.7,-16.84 61.91,-23.73"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index dd2f8cd31..000000000
--- a/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="181pt" height="64pt"
- viewBox="0.00 0.00 181.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="149.75,-56.25 96.25,-56.25 96.25,-37 149.75,-37 149.75,-56.25"/>
-<text text-anchor="middle" x="123" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-30.93C50.37,-33.35 68.48,-36.7 84.6,-39.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.94,-43.13 94.41,-41.51 85.21,-36.25 83.94,-43.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173,-19.25 73,-19.25 73,0 173,0 173,-19.25"/>
-<text text-anchor="middle" x="123" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">InterpolationSearch</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.35,-24.49C44.29,-23.27 52.67,-21.8 61.43,-20.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.91,-23.73 71.15,-18.55 60.7,-16.84 61.91,-23.73"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d39/interpolation__search2_8cpp_source.html b/df/d39/interpolation__search2_8cpp_source.html
new file mode 100644
index 000000000..7748a81b6
--- /dev/null
+++ b/df/d39/interpolation__search2_8cpp_source.html
@@ -0,0 +1,176 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: search/interpolation_search2.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/d39/interpolation__search2_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">interpolation_search2.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../df/d39/interpolation__search2_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="foldopen" id="foldopen00015" data-start="{" data-end="}">
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"><a class="line" href="../../df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629">   15</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629">InterpolationSearch</a>(<span class="keywordtype">int</span> A[], <span class="keywordtype">int</span> n, <span class="keywordtype">int</span> x) {</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    <span class="keywordtype">int</span> low = 0;</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="keywordtype">int</span> high = n - 1;</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    <span class="keywordflow">while</span> (low &lt;= high) {</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>        <span class="keywordtype">int</span> mid = low + (((high - 1) * (x - A[low])) / (A[high] - A[low]));</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>        <span class="keywordflow">if</span> (x == A[mid])</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>            <span class="keywordflow">return</span> mid;  <span class="comment">// Found x, return (exit)</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x &lt; A[mid])</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>            high = mid - 1;  <span class="comment">// X lies before mid</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>        <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>            low = mid + 1;  <span class="comment">// x lies after mid</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    }</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    <span class="keywordflow">return</span> -1;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>}</div>
+</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="foldopen" id="foldopen00032" data-start="{" data-end="}">
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"><a class="line" href="../../df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   32</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    <span class="keywordtype">int</span> A[] = {2, 4, 5, 7, 13, 14, 15, 23};</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordtype">int</span> x = 17;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keywordtype">int</span> index = <a class="code hl_function" href="../../df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629">InterpolationSearch</a>(A, 8, x);</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordflow">if</span> (index &lt; 0)</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Number &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; not found&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Number &quot;</span> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot; is at &quot;</span> &lt;&lt; index &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>}</div>
+</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="comment">// randomly set x bcoz array was defined by us , therefore not reasonable for</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="comment">// asking input. We could have asked for input if array elements were inputed by</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="comment">// the user.</span></div>
+<div class="ttc" id="ainterpolation__search2_8cpp_html_aa3ec659ec8394d186c761df81ad1f629"><div class="ttname"><a href="../../df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629">InterpolationSearch</a></div><div class="ttdeci">int InterpolationSearch(int A[], int n, int x)</div><div class="ttdef"><b>Definition</b> <a href="#l00015">interpolation_search2.cpp:15</a></div></div>
+<div class="ttc" id="ainterpolation__search2_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00032">interpolation_search2.cpp:32</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../df/d39/interpolation__search2_8cpp.html">interpolation_search2.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/d42/binary__search__tree2_8cpp.html b/df/d42/binary__search__tree2_8cpp.html
index 95f1f6043..c1dd3761b 100644
--- a/df/d42/binary__search__tree2_8cpp.html
+++ b/df/d42/binary__search__tree2_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/binary_search_tree2.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/binary_search_tree2.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for binary_search_tree2.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d33/binary__search__tree2_8cpp__incl.svg" width="446" height="126"><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">
+</div>
+<p><a href="../../df/d42/binary__search__tree2_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt; T &gt;</a></td></tr>
@@ -165,6 +184,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>A generic <a href="https://en.wikipedia.org/wiki/Binary_search_tree" target="_blank">binary search tree</a> implementation. Here you can find more information about the algorithm: <a href="https://www.scaler.com/topics/data-structures/binary-search-tree/" target="_blank">Scaler - Binary Search tree</a>. </p>
 <dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d3/d26/binary__search__tree_8cpp.html" title="A simple tree implementation using structured nodes.">binary_search_tree.cpp</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -180,6 +201,8 @@ Functions</h2></td></tr>
         </tr>
       </table>
 </div><div class="memdoc">
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00556">556</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  556</span>           {</div>
 <div class="line"><span class="lineno">  557</span>    <a class="code hl_function" href="#a8c882f43e1e52948a7841a8bfb091350">test_insert</a>();</div>
 <div class="line"><span class="lineno">  558</span>    <a class="code hl_function" href="#ab1333c3ea06dcad896ee204bbd407c4e">test_remove</a>();</div>
@@ -190,14 +213,14 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  563</span>    <a class="code hl_function" href="#ab00b8d0f21aeb5fbddb6decf3bcb640a">test_get_elements_preorder</a>();</div>
 <div class="line"><span class="lineno">  564</span>    <a class="code hl_function" href="#a94b76f781fcbe1ad0e3397ace6bb1965">test_get_elements_postorder</a>();</div>
 <div class="line"><span class="lineno">  565</span>}</div>
-<div class="ttc" id="abinary__search__tree2_8cpp_html_a06f35064850e891d6fda0093c0d9ee6e"><div class="ttname"><a href="#a06f35064850e891d6fda0093c0d9ee6e">test_get_elements_inorder</a></div><div class="ttdeci">static void test_get_elements_inorder()</div><div class="ttdoc">Function for testing get_elements_inorder().</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:498</div></div>
-<div class="ttc" id="abinary__search__tree2_8cpp_html_a1d42876440ac5346e2850a32497385c3"><div class="ttname"><a href="#a1d42876440ac5346e2850a32497385c3">test_contains</a></div><div class="ttdeci">static void test_contains()</div><div class="ttdoc">Function for testing contains().</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:429</div></div>
-<div class="ttc" id="abinary__search__tree2_8cpp_html_a8c882f43e1e52948a7841a8bfb091350"><div class="ttname"><a href="#a8c882f43e1e52948a7841a8bfb091350">test_insert</a></div><div class="ttdeci">static void test_insert()</div><div class="ttdoc">Function for testing insert().</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:358</div></div>
-<div class="ttc" id="abinary__search__tree2_8cpp_html_a94b76f781fcbe1ad0e3397ace6bb1965"><div class="ttname"><a href="#a94b76f781fcbe1ad0e3397ace6bb1965">test_get_elements_postorder</a></div><div class="ttdeci">static void test_get_elements_postorder()</div><div class="ttdoc">Function for testing get_elements_postorder().</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:540</div></div>
-<div class="ttc" id="abinary__search__tree2_8cpp_html_a9856b68e2cba50d2e26a1cbe374e0365"><div class="ttname"><a href="#a9856b68e2cba50d2e26a1cbe374e0365">test_find_max</a></div><div class="ttdeci">static void test_find_max()</div><div class="ttdoc">Function for testing find_max().</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:475</div></div>
-<div class="ttc" id="abinary__search__tree2_8cpp_html_ab00b8d0f21aeb5fbddb6decf3bcb640a"><div class="ttname"><a href="#ab00b8d0f21aeb5fbddb6decf3bcb640a">test_get_elements_preorder</a></div><div class="ttdeci">static void test_get_elements_preorder()</div><div class="ttdoc">Function for testing get_elements_preorder().</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:519</div></div>
-<div class="ttc" id="abinary__search__tree2_8cpp_html_ab1333c3ea06dcad896ee204bbd407c4e"><div class="ttname"><a href="#ab1333c3ea06dcad896ee204bbd407c4e">test_remove</a></div><div class="ttdeci">static void test_remove()</div><div class="ttdoc">Function for testing remove().</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:392</div></div>
-<div class="ttc" id="abinary__search__tree2_8cpp_html_af2847a901160fd45b4044550e9921cb4"><div class="ttname"><a href="#af2847a901160fd45b4044550e9921cb4">test_find_min</a></div><div class="ttdeci">static void test_find_min()</div><div class="ttdoc">Function for testing find_min().</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:452</div></div>
+<div class="ttc" id="abinary__search__tree2_8cpp_html_a06f35064850e891d6fda0093c0d9ee6e"><div class="ttname"><a href="#a06f35064850e891d6fda0093c0d9ee6e">test_get_elements_inorder</a></div><div class="ttdeci">static void test_get_elements_inorder()</div><div class="ttdoc">Function for testing get_elements_inorder().</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00498">binary_search_tree2.cpp:498</a></div></div>
+<div class="ttc" id="abinary__search__tree2_8cpp_html_a1d42876440ac5346e2850a32497385c3"><div class="ttname"><a href="#a1d42876440ac5346e2850a32497385c3">test_contains</a></div><div class="ttdeci">static void test_contains()</div><div class="ttdoc">Function for testing contains().</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00429">binary_search_tree2.cpp:429</a></div></div>
+<div class="ttc" id="abinary__search__tree2_8cpp_html_a8c882f43e1e52948a7841a8bfb091350"><div class="ttname"><a href="#a8c882f43e1e52948a7841a8bfb091350">test_insert</a></div><div class="ttdeci">static void test_insert()</div><div class="ttdoc">Function for testing insert().</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00358">binary_search_tree2.cpp:358</a></div></div>
+<div class="ttc" id="abinary__search__tree2_8cpp_html_a94b76f781fcbe1ad0e3397ace6bb1965"><div class="ttname"><a href="#a94b76f781fcbe1ad0e3397ace6bb1965">test_get_elements_postorder</a></div><div class="ttdeci">static void test_get_elements_postorder()</div><div class="ttdoc">Function for testing get_elements_postorder().</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00540">binary_search_tree2.cpp:540</a></div></div>
+<div class="ttc" id="abinary__search__tree2_8cpp_html_a9856b68e2cba50d2e26a1cbe374e0365"><div class="ttname"><a href="#a9856b68e2cba50d2e26a1cbe374e0365">test_find_max</a></div><div class="ttdeci">static void test_find_max()</div><div class="ttdoc">Function for testing find_max().</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00475">binary_search_tree2.cpp:475</a></div></div>
+<div class="ttc" id="abinary__search__tree2_8cpp_html_ab00b8d0f21aeb5fbddb6decf3bcb640a"><div class="ttname"><a href="#ab00b8d0f21aeb5fbddb6decf3bcb640a">test_get_elements_preorder</a></div><div class="ttdeci">static void test_get_elements_preorder()</div><div class="ttdoc">Function for testing get_elements_preorder().</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00519">binary_search_tree2.cpp:519</a></div></div>
+<div class="ttc" id="abinary__search__tree2_8cpp_html_ab1333c3ea06dcad896ee204bbd407c4e"><div class="ttname"><a href="#ab1333c3ea06dcad896ee204bbd407c4e">test_remove</a></div><div class="ttdeci">static void test_remove()</div><div class="ttdoc">Function for testing remove().</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00392">binary_search_tree2.cpp:392</a></div></div>
+<div class="ttc" id="abinary__search__tree2_8cpp_html_af2847a901160fd45b4044550e9921cb4"><div class="ttname"><a href="#af2847a901160fd45b4044550e9921cb4">test_find_min</a></div><div class="ttdeci">static void test_find_min()</div><div class="ttdoc">Function for testing find_min().</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00452">binary_search_tree2.cpp:452</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -226,8 +249,10 @@ Functions</h2></td></tr>
 
 <p>Function for testing contains(). </p>
 <dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00429">429</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  429</span>                            {</div>
-<div class="line"><span class="lineno">  430</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testing BST contains...&quot;</span>;</div>
+<div class="line"><span class="lineno">  430</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing BST contains...&quot;</span>;</div>
 <div class="line"><span class="lineno">  431</span> </div>
 <div class="line"><span class="lineno">  432</span>    <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt;int&gt;</a> tree;</div>
 <div class="line"><span class="lineno">  433</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
@@ -241,19 +266,12 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  441</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(6));</div>
 <div class="line"><span class="lineno">  442</span>    assert(!tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(999));</div>
 <div class="line"><span class="lineno">  443</span> </div>
-<div class="line"><span class="lineno">  444</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; <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">  444</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  445</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="aclassbinary__search__tree_html"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a></div><div class="ttdoc">The Binary Search Tree class.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:20</div></div>
-<div class="ttc" id="aclassbinary__search__tree_html_a9d1e7e10efa74d741bf48cf032df3778"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">binary_search_tree::insert</a></div><div class="ttdeci">bool insert(std::unique_ptr&lt; bst_node &gt; &amp;node, T new_value)</div><div class="ttdoc">Recursive function to insert a value into the BST.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:90</div></div>
-<div class="ttc" id="aclassbinary__search__tree_html_aa4f84b2eec9b9201af1840868ddb5fb2"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">binary_search_tree::contains</a></div><div class="ttdeci">bool contains(std::unique_ptr&lt; bst_node &gt; &amp;node, T value)</div><div class="ttdoc">Recursive function to check if a value is in the BST.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:177</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><!-- 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="../../df/d42/binary__search__tree2_8cpp_a1d42876440ac5346e2850a32497385c3_cgraph.svg" width="290" height="215"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassbinary__search__tree_html"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a></div><div class="ttdoc">The Binary Search Tree class.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00020">binary_search_tree2.cpp:20</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_a9d1e7e10efa74d741bf48cf032df3778"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">binary_search_tree::insert</a></div><div class="ttdeci">bool insert(std::unique_ptr&lt; bst_node &gt; &amp;node, T new_value)</div><div class="ttdoc">Recursive function to insert a value into the BST.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00090">binary_search_tree2.cpp:90</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_aa4f84b2eec9b9201af1840868ddb5fb2"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">binary_search_tree::contains</a></div><div class="ttdeci">bool contains(std::unique_ptr&lt; bst_node &gt; &amp;node, T value)</div><div class="ttdoc">Recursive function to check if a value is in the BST.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00177">binary_search_tree2.cpp:177</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a9856b68e2cba50d2e26a1cbe374e0365" name="a9856b68e2cba50d2e26a1cbe374e0365"></a>
@@ -281,10 +299,12 @@ Here is the call graph for this function:</div>
 
 <p>Function for testing find_max(). </p>
 <dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00475">475</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  475</span>                            {</div>
-<div class="line"><span class="lineno">  476</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testing BST find_max...&quot;</span>;</div>
+<div class="line"><span class="lineno">  476</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing BST find_max...&quot;</span>;</div>
 <div class="line"><span class="lineno">  477</span> </div>
-<div class="line"><span class="lineno">  478</span>    <span class="keywordtype">int</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">max</a> = 0;</div>
+<div class="line"><span class="lineno">  478</span>    <span class="keywordtype">int</span> max = 0;</div>
 <div class="line"><span class="lineno">  479</span>    <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt;int&gt;</a> tree;</div>
 <div class="line"><span class="lineno">  480</span>    assert(!tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(max));</div>
 <div class="line"><span class="lineno">  481</span> </div>
@@ -296,16 +316,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  487</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(max));</div>
 <div class="line"><span class="lineno">  488</span>    assert(max == 6);</div>
 <div class="line"><span class="lineno">  489</span> </div>
-<div class="line"><span class="lineno">  490</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; <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">  490</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  491</span>}</div>
-<div class="ttc" id="aclassbinary__search__tree_html_a75f897af6aa732a9901454401c869bcb"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">binary_search_tree::find_max</a></div><div class="ttdeci">bool find_max(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)</div><div class="ttdoc">Recursive function to find the maximum value in the BST.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:53</div></div>
-<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
-</div><!-- 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="../../df/d42/binary__search__tree2_8cpp_a9856b68e2cba50d2e26a1cbe374e0365_cgraph.svg" width="294" height="215"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassbinary__search__tree_html_a75f897af6aa732a9901454401c869bcb"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">binary_search_tree::find_max</a></div><div class="ttdeci">bool find_max(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)</div><div class="ttdoc">Recursive function to find the maximum value in the BST.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00053">binary_search_tree2.cpp:53</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af2847a901160fd45b4044550e9921cb4" name="af2847a901160fd45b4044550e9921cb4"></a>
@@ -333,10 +347,12 @@ Here is the call graph for this function:</div>
 
 <p>Function for testing find_min(). </p>
 <dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00452">452</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  452</span>                            {</div>
-<div class="line"><span class="lineno">  453</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testing BST find_min...&quot;</span>;</div>
+<div class="line"><span class="lineno">  453</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing BST find_min...&quot;</span>;</div>
 <div class="line"><span class="lineno">  454</span> </div>
-<div class="line"><span class="lineno">  455</span>    <span class="keywordtype">int</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a> = 0;</div>
+<div class="line"><span class="lineno">  455</span>    <span class="keywordtype">int</span> min = 0;</div>
 <div class="line"><span class="lineno">  456</span>    <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt;int&gt;</a> tree;</div>
 <div class="line"><span class="lineno">  457</span>    assert(!tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(min));</div>
 <div class="line"><span class="lineno">  458</span> </div>
@@ -348,16 +364,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  464</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(min));</div>
 <div class="line"><span class="lineno">  465</span>    assert(min == 3);</div>
 <div class="line"><span class="lineno">  466</span> </div>
-<div class="line"><span class="lineno">  467</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; <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">  467</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  468</span>}</div>
-<div class="ttc" id="aclassbinary__search__tree_html_af9a2c7c187a7ca3142c77ce342ef3153"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">binary_search_tree::find_min</a></div><div class="ttdeci">bool find_min(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)</div><div class="ttdoc">Recursive function to find the minimum value in the BST.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:71</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><!-- 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="../../df/d42/binary__search__tree2_8cpp_af2847a901160fd45b4044550e9921cb4_cgraph.svg" width="290" height="215"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassbinary__search__tree_html_af9a2c7c187a7ca3142c77ce342ef3153"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">binary_search_tree::find_min</a></div><div class="ttdeci">bool find_min(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)</div><div class="ttdoc">Recursive function to find the minimum value in the BST.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00071">binary_search_tree2.cpp:71</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a06f35064850e891d6fda0093c0d9ee6e" name="a06f35064850e891d6fda0093c0d9ee6e"></a>
@@ -385,8 +395,10 @@ Here is the call graph for this function:</div>
 
 <p>Function for testing get_elements_inorder(). </p>
 <dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00498">498</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  498</span>                                        {</div>
-<div class="line"><span class="lineno">  499</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testing BST get_elements_inorder...&quot;</span>;</div>
+<div class="line"><span class="lineno">  499</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing BST get_elements_inorder...&quot;</span>;</div>
 <div class="line"><span class="lineno">  500</span> </div>
 <div class="line"><span class="lineno">  501</span>    <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt;int&gt;</a> tree;</div>
 <div class="line"><span class="lineno">  502</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
@@ -394,20 +406,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  504</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(3);</div>
 <div class="line"><span class="lineno">  505</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
 <div class="line"><span class="lineno">  506</span> </div>
-<div class="line"><span class="lineno">  507</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> expected = {3, 4, 5, 6};</div>
-<div class="line"><span class="lineno">  508</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> actual = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a">get_elements_inorder</a>();</div>
+<div class="line"><span class="lineno">  507</span>    std::vector&lt;int&gt; expected = {3, 4, 5, 6};</div>
+<div class="line"><span class="lineno">  508</span>    std::vector&lt;int&gt; actual = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a">get_elements_inorder</a>();</div>
 <div class="line"><span class="lineno">  509</span>    assert(actual == expected);</div>
 <div class="line"><span class="lineno">  510</span> </div>
-<div class="line"><span class="lineno">  511</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; <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">  511</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  512</span>}</div>
-<div class="ttc" id="aclassbinary__search__tree_html_a1f23830316204664514f396a4eb5275a"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a">binary_search_tree::get_elements_inorder</a></div><div class="ttdeci">std::vector&lt; T &gt; get_elements_inorder()</div><div class="ttdoc">Get all values of the BST in in-order order.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:321</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d42/binary__search__tree2_8cpp_a06f35064850e891d6fda0093c0d9ee6e_cgraph.svg" width="566" height="191"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassbinary__search__tree_html_a1f23830316204664514f396a4eb5275a"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a">binary_search_tree::get_elements_inorder</a></div><div class="ttdeci">std::vector&lt; T &gt; get_elements_inorder()</div><div class="ttdoc">Get all values of the BST in in-order order.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00321">binary_search_tree2.cpp:321</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a94b76f781fcbe1ad0e3397ace6bb1965" name="a94b76f781fcbe1ad0e3397ace6bb1965"></a>
@@ -435,8 +441,10 @@ Here is the call graph for this function:</div>
 
 <p>Function for testing get_elements_postorder(). </p>
 <dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00540">540</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  540</span>                                          {</div>
-<div class="line"><span class="lineno">  541</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testing BST get_elements_postorder...&quot;</span>;</div>
+<div class="line"><span class="lineno">  541</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing BST get_elements_postorder...&quot;</span>;</div>
 <div class="line"><span class="lineno">  542</span> </div>
 <div class="line"><span class="lineno">  543</span>    <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt;int&gt;</a> tree;</div>
 <div class="line"><span class="lineno">  544</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
@@ -444,19 +452,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  546</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(3);</div>
 <div class="line"><span class="lineno">  547</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
 <div class="line"><span class="lineno">  548</span> </div>
-<div class="line"><span class="lineno">  549</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> expected = {3, 4, 6, 5};</div>
-<div class="line"><span class="lineno">  550</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> actual = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff">get_elements_postorder</a>();</div>
+<div class="line"><span class="lineno">  549</span>    std::vector&lt;int&gt; expected = {3, 4, 6, 5};</div>
+<div class="line"><span class="lineno">  550</span>    std::vector&lt;int&gt; actual = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff">get_elements_postorder</a>();</div>
 <div class="line"><span class="lineno">  551</span>    assert(actual == expected);</div>
 <div class="line"><span class="lineno">  552</span> </div>
-<div class="line"><span class="lineno">  553</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; <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">  553</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  554</span>}</div>
-<div class="ttc" id="aclassbinary__search__tree_html_a5c011e1b0863d79c3a7c11a0426bdcff"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff">binary_search_tree::get_elements_postorder</a></div><div class="ttdeci">std::vector&lt; T &gt; get_elements_postorder()</div><div class="ttdoc">Get all values of the BST in post-order order.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:345</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d42/binary__search__tree2_8cpp_a94b76f781fcbe1ad0e3397ace6bb1965_cgraph.svg" width="602" height="191"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassbinary__search__tree_html_a5c011e1b0863d79c3a7c11a0426bdcff"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff">binary_search_tree::get_elements_postorder</a></div><div class="ttdeci">std::vector&lt; T &gt; get_elements_postorder()</div><div class="ttdoc">Get all values of the BST in post-order order.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00345">binary_search_tree2.cpp:345</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ab00b8d0f21aeb5fbddb6decf3bcb640a" name="ab00b8d0f21aeb5fbddb6decf3bcb640a"></a>
@@ -484,8 +487,10 @@ Here is the call graph for this function:</div>
 
 <p>Function for testing get_elements_preorder(). </p>
 <dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00519">519</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  519</span>                                         {</div>
-<div class="line"><span class="lineno">  520</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testing BST get_elements_preorder...&quot;</span>;</div>
+<div class="line"><span class="lineno">  520</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing BST get_elements_preorder...&quot;</span>;</div>
 <div class="line"><span class="lineno">  521</span> </div>
 <div class="line"><span class="lineno">  522</span>    <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt;int&gt;</a> tree;</div>
 <div class="line"><span class="lineno">  523</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
@@ -493,19 +498,14 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  525</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(3);</div>
 <div class="line"><span class="lineno">  526</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
 <div class="line"><span class="lineno">  527</span> </div>
-<div class="line"><span class="lineno">  528</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> expected = {5, 4, 3, 6};</div>
-<div class="line"><span class="lineno">  529</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> actual = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13">get_elements_preorder</a>();</div>
+<div class="line"><span class="lineno">  528</span>    std::vector&lt;int&gt; expected = {5, 4, 3, 6};</div>
+<div class="line"><span class="lineno">  529</span>    std::vector&lt;int&gt; actual = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13">get_elements_preorder</a>();</div>
 <div class="line"><span class="lineno">  530</span>    assert(actual == expected);</div>
 <div class="line"><span class="lineno">  531</span> </div>
-<div class="line"><span class="lineno">  532</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; <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">  532</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  533</span>}</div>
-<div class="ttc" id="aclassbinary__search__tree_html_a5764c1cf848f84a5b77462036a6d8c13"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13">binary_search_tree::get_elements_preorder</a></div><div class="ttdeci">std::vector&lt; T &gt; get_elements_preorder()</div><div class="ttdoc">Get all values of the BST in pre-order order.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:333</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d42/binary__search__tree2_8cpp_ab00b8d0f21aeb5fbddb6decf3bcb640a_cgraph.svg" width="582" height="191"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassbinary__search__tree_html_a5764c1cf848f84a5b77462036a6d8c13"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13">binary_search_tree::get_elements_preorder</a></div><div class="ttdeci">std::vector&lt; T &gt; get_elements_preorder()</div><div class="ttdoc">Get all values of the BST in pre-order order.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00333">binary_search_tree2.cpp:333</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a8c882f43e1e52948a7841a8bfb091350" name="a8c882f43e1e52948a7841a8bfb091350"></a>
@@ -533,12 +533,14 @@ Here is the call graph for this function:</div>
 
 <p>Function for testing <a class="el" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b" title="inserts a new element into AVL tree">insert()</a>. </p>
 <dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00358">358</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  358</span>                          {</div>
-<div class="line"><span class="lineno">  359</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testing BST insert...&quot;</span>;</div>
+<div class="line"><span class="lineno">  359</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing BST insert...&quot;</span>;</div>
 <div class="line"><span class="lineno">  360</span> </div>
 <div class="line"><span class="lineno">  361</span>    <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt;int&gt;</a> tree;</div>
 <div class="line"><span class="lineno">  362</span>    <span class="keywordtype">bool</span> res = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
-<div class="line"><span class="lineno">  363</span>    <span class="keywordtype">int</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a> = -1, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">max</a> = -1;</div>
+<div class="line"><span class="lineno">  363</span>    <span class="keywordtype">int</span> min = -1, max = -1;</div>
 <div class="line"><span class="lineno">  364</span>    assert(res);</div>
 <div class="line"><span class="lineno">  365</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(max));</div>
 <div class="line"><span class="lineno">  366</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(min));</div>
@@ -559,15 +561,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  381</span>    assert(!fail_res);</div>
 <div class="line"><span class="lineno">  382</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">size</a>() == 4);</div>
 <div class="line"><span class="lineno">  383</span> </div>
-<div class="line"><span class="lineno">  384</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; <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">  384</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  385</span>}</div>
-<div class="ttc" id="aclassbinary__search__tree_html_a564fe43e7e8f7ecb6f10667a70fbc6f3"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">binary_search_tree::size</a></div><div class="ttdeci">std::size_t size()</div><div class="ttdoc">Get the number of values in the BST.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:314</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d42/binary__search__tree2_8cpp_a8c882f43e1e52948a7841a8bfb091350_cgraph.svg" width="272" height="370"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassbinary__search__tree_html_a564fe43e7e8f7ecb6f10667a70fbc6f3"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">binary_search_tree::size</a></div><div class="ttdeci">std::size_t size()</div><div class="ttdoc">Get the number of values in the BST.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00314">binary_search_tree2.cpp:314</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ab1333c3ea06dcad896ee204bbd407c4e" name="ab1333c3ea06dcad896ee204bbd407c4e"></a>
@@ -595,8 +592,10 @@ Here is the call graph for this function:</div>
 
 <p>Function for testing remove(). </p>
 <dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00392">392</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  392</span>                          {</div>
-<div class="line"><span class="lineno">  393</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Testing BST remove...&quot;</span>;</div>
+<div class="line"><span class="lineno">  393</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing BST remove...&quot;</span>;</div>
 <div class="line"><span class="lineno">  394</span> </div>
 <div class="line"><span class="lineno">  395</span>    <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt;int&gt;</a> tree;</div>
 <div class="line"><span class="lineno">  396</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
@@ -605,7 +604,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  399</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
 <div class="line"><span class="lineno">  400</span> </div>
 <div class="line"><span class="lineno">  401</span>    <span class="keywordtype">bool</span> res = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(5);</div>
-<div class="line"><span class="lineno">  402</span>    <span class="keywordtype">int</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">min</a> = -1, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">max</a> = -1;</div>
+<div class="line"><span class="lineno">  402</span>    <span class="keywordtype">int</span> min = -1, max = -1;</div>
 <div class="line"><span class="lineno">  403</span>    assert(res);</div>
 <div class="line"><span class="lineno">  404</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(max));</div>
 <div class="line"><span class="lineno">  405</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(min));</div>
@@ -624,15 +623,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  418</span>    assert(!fail_res);</div>
 <div class="line"><span class="lineno">  419</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">size</a>() == 0);</div>
 <div class="line"><span class="lineno">  420</span> </div>
-<div class="line"><span class="lineno">  421</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; <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">  421</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  422</span>}</div>
-<div class="ttc" id="aclassbinary__search__tree_html_af4a865ce5244608819b169fc78a41153"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">binary_search_tree::remove</a></div><div class="ttdeci">bool remove(std::unique_ptr&lt; bst_node &gt; &amp;parent, std::unique_ptr&lt; bst_node &gt; &amp;node, T rm_value)</div><div class="ttdoc">Recursive function to remove a value from the BST.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:125</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d42/binary__search__tree2_8cpp_ab1333c3ea06dcad896ee204bbd407c4e_cgraph.svg" width="463" height="510"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassbinary__search__tree_html_af4a865ce5244608819b169fc78a41153"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">binary_search_tree::remove</a></div><div class="ttdeci">bool remove(std::unique_ptr&lt; bst_node &gt; &amp;parent, std::unique_ptr&lt; bst_node &gt; &amp;node, T rm_value)</div><div class="ttdoc">Recursive function to remove a value from the BST.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00125">binary_search_tree2.cpp:125</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/df/d42/binary__search__tree2_8cpp_a06f35064850e891d6fda0093c0d9ee6e_cgraph.map b/df/d42/binary__search__tree2_8cpp_a06f35064850e891d6fda0093c0d9ee6e_cgraph.map
deleted file mode 100644
index bd57bafe1..000000000
--- a/df/d42/binary__search__tree2_8cpp_a06f35064850e891d6fda0093c0d9ee6e_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="test_get_elements_inorder" name="test_get_elements_inorder">
-<area shape="rect" id="Node000001" title="Function for testing get_elements_inorder()." alt="" coords="5,63,180,88"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="269,5,340,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="142,59,253,29,255,34,144,65"/>
-<area shape="rect" id="Node000003" href="$d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a" title="Get all values of the BST in in&#45;order order." alt="" coords="228,55,381,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="180,73,213,73,213,78,180,78"/>
-<area shape="rect" id="Node000005" href="$d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" title="Recursive function to insert a value into the BST." alt="" coords="239,144,370,185"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="126,86,241,135,239,140,124,91"/>
-<area shape="rect" id="Node000004" href="$d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd" title="Recursive function to traverse the tree in in&#45;order order." alt="" coords="429,55,560,96"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="381,73,413,73,413,78,381,78"/>
-<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="458,55,457,45,463,36,475,31,495,29,515,31,528,37,525,42,514,36,495,34,477,36,466,40,462,46,464,54"/>
-<area shape="poly" id="edge6_Node000005_Node000005" title=" " alt="" coords="268,144,266,135,272,126,285,120,304,118,325,120,337,127,335,131,324,125,304,123,286,125,276,130,271,136,273,143"/>
-</map>
diff --git a/df/d42/binary__search__tree2_8cpp_a06f35064850e891d6fda0093c0d9ee6e_cgraph.md5 b/df/d42/binary__search__tree2_8cpp_a06f35064850e891d6fda0093c0d9ee6e_cgraph.md5
deleted file mode 100644
index cf9723e8e..000000000
--- a/df/d42/binary__search__tree2_8cpp_a06f35064850e891d6fda0093c0d9ee6e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-039111e3a580375fa7c477fbf817ca2c
\ No newline at end of file
diff --git a/df/d42/binary__search__tree2_8cpp_a06f35064850e891d6fda0093c0d9ee6e_cgraph.svg b/df/d42/binary__search__tree2_8cpp_a06f35064850e891d6fda0093c0d9ee6e_cgraph.svg
deleted file mode 100644
index cbe613f75..000000000
--- a/df/d42/binary__search__tree2_8cpp_a06f35064850e891d6fda0093c0d9ee6e_cgraph.svg
+++ /dev/null
@@ -1,140 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_get_elements_inorder Pages: 1 -->
-<svg width="424pt" height="143pt"
- viewBox="0.00 0.00 424.25 142.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138.88)">
-<title>test_get_elements_inorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function for testing get_elements_inorder().">
-<polygon fill="#999999" stroke="#666666" points="130.75,-91.88 0,-91.88 0,-72.62 130.75,-72.62 130.75,-91.88"/>
-<text text-anchor="middle" x="65.38" y="-78.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_get_elements_inorder</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251,-134.88 197.5,-134.88 197.5,-115.62 251,-115.62 251,-134.88"/>
-<text text-anchor="middle" x="224.25" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.16,-92.33C128.29,-99.22 161.45,-108.31 186.56,-115.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.45,-118.52 196.02,-117.79 187.3,-111.77 185.45,-118.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a" target="_top" xlink:title="Get all values of the BST in in&#45;order order.">
-<polygon fill="white" stroke="#666666" points="281.75,-97.5 166.75,-97.5 166.75,-67 281.75,-67 281.75,-97.5"/>
-<text text-anchor="start" x="174.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="224.25" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_elements_inorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.09,-82.25C139.12,-82.25 147.35,-82.25 155.42,-82.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.19,-85.75 165.19,-82.25 155.19,-78.75 155.19,-85.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="white" stroke="#666666" points="273.5,-30.5 175,-30.5 175,0 273.5,0 273.5,-30.5"/>
-<text text-anchor="start" x="183" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="224.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.86,-72.22C112.52,-62.54 147.48,-47.61 175.93,-35.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.26,-38.7 185.08,-31.55 174.51,-32.26 177.26,-38.7"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd" target="_top" xlink:title="Recursive function to traverse the tree in in&#45;order order.">
-<polygon fill="white" stroke="#666666" points="416.25,-97.5 317.75,-97.5 317.75,-67 416.25,-67 416.25,-97.5"/>
-<text text-anchor="start" x="325.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="367" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_inorder</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.09,-82.25C289.99,-82.25 298.12,-82.25 306.07,-82.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="306.02,-85.75 316.02,-82.25 306.02,-78.75 306.02,-85.75"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M341.7,-97.99C336.54,-107.06 344.97,-115.5 367,-115.5 379.05,-115.5 387.03,-112.97 390.94,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="394.39,-109.84 392.11,-99.49 387.44,-109 394.39,-109.84"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M198.95,-30.99C193.79,-40.06 202.22,-48.5 224.25,-48.5 236.3,-48.5 244.28,-45.97 248.19,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="251.64,-42.84 249.36,-32.49 244.69,-42 251.64,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d42/binary__search__tree2_8cpp_a06f35064850e891d6fda0093c0d9ee6e_cgraph_org.svg b/df/d42/binary__search__tree2_8cpp_a06f35064850e891d6fda0093c0d9ee6e_cgraph_org.svg
deleted file mode 100644
index 0ac2ca0b8..000000000
--- a/df/d42/binary__search__tree2_8cpp_a06f35064850e891d6fda0093c0d9ee6e_cgraph_org.svg
+++ /dev/null
@@ -1,114 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_get_elements_inorder Pages: 1 -->
-<svg width="424pt" height="143pt"
- viewBox="0.00 0.00 424.25 142.88" 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 138.88)">
-<title>test_get_elements_inorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function for testing get_elements_inorder().">
-<polygon fill="#999999" stroke="#666666" points="130.75,-91.88 0,-91.88 0,-72.62 130.75,-72.62 130.75,-91.88"/>
-<text text-anchor="middle" x="65.38" y="-78.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_get_elements_inorder</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251,-134.88 197.5,-134.88 197.5,-115.62 251,-115.62 251,-134.88"/>
-<text text-anchor="middle" x="224.25" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M103.16,-92.33C128.29,-99.22 161.45,-108.31 186.56,-115.19"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="185.45,-118.52 196.02,-117.79 187.3,-111.77 185.45,-118.52"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a" target="_top" xlink:title="Get all values of the BST in in&#45;order order.">
-<polygon fill="white" stroke="#666666" points="281.75,-97.5 166.75,-97.5 166.75,-67 281.75,-67 281.75,-97.5"/>
-<text text-anchor="start" x="174.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="224.25" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_elements_inorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.09,-82.25C139.12,-82.25 147.35,-82.25 155.42,-82.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.19,-85.75 165.19,-82.25 155.19,-78.75 155.19,-85.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="white" stroke="#666666" points="273.5,-30.5 175,-30.5 175,0 273.5,0 273.5,-30.5"/>
-<text text-anchor="start" x="183" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="224.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M89.86,-72.22C112.52,-62.54 147.48,-47.61 175.93,-35.46"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="177.26,-38.7 185.08,-31.55 174.51,-32.26 177.26,-38.7"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd" target="_top" xlink:title="Recursive function to traverse the tree in in&#45;order order.">
-<polygon fill="white" stroke="#666666" points="416.25,-97.5 317.75,-97.5 317.75,-67 416.25,-67 416.25,-97.5"/>
-<text text-anchor="start" x="325.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="367" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_inorder</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M282.09,-82.25C289.99,-82.25 298.12,-82.25 306.07,-82.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="306.02,-85.75 316.02,-82.25 306.02,-78.75 306.02,-85.75"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M341.7,-97.99C336.54,-107.06 344.97,-115.5 367,-115.5 379.05,-115.5 387.03,-112.97 390.94,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="394.39,-109.84 392.11,-99.49 387.44,-109 394.39,-109.84"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M198.95,-30.99C193.79,-40.06 202.22,-48.5 224.25,-48.5 236.3,-48.5 244.28,-45.97 248.19,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="251.64,-42.84 249.36,-32.49 244.69,-42 251.64,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d42/binary__search__tree2_8cpp_a1d42876440ac5346e2850a32497385c3_cgraph.map b/df/d42/binary__search__tree2_8cpp_a1d42876440ac5346e2850a32497385c3_cgraph.map
deleted file mode 100644
index 49cf025be..000000000
--- a/df/d42/binary__search__tree2_8cpp_a1d42876440ac5346e2850a32497385c3_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="test_contains" name="test_contains">
-<area shape="rect" id="Node000001" title="Function for testing contains()." alt="" coords="5,94,105,120"/>
-<area shape="rect" id="Node000002" href="$d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2" title="Recursive function to check if a value is in the BST." alt="" coords="153,29,284,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="93,91,143,73,145,78,95,96"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="183,94,254,120"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="105,104,167,104,167,110,105,110"/>
-<area shape="rect" id="Node000004" href="$d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" title="Recursive function to insert a value into the BST." alt="" coords="153,168,284,209"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="84,118,164,158,161,163,82,123"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="187,29,185,19,190,11,202,5,218,3,236,5,247,11,244,16,235,10,218,8,203,10,194,14,191,20,192,28"/>
-<area shape="poly" id="edge5_Node000004_Node000004" title=" " alt="" coords="187,168,185,158,190,149,202,143,218,141,236,144,247,150,244,155,235,149,218,147,203,148,194,153,191,159,192,167"/>
-</map>
diff --git a/df/d42/binary__search__tree2_8cpp_a1d42876440ac5346e2850a32497385c3_cgraph.md5 b/df/d42/binary__search__tree2_8cpp_a1d42876440ac5346e2850a32497385c3_cgraph.md5
deleted file mode 100644
index 856b0b02e..000000000
--- a/df/d42/binary__search__tree2_8cpp_a1d42876440ac5346e2850a32497385c3_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-16b26ac714ebebf6cb7dbfb45c70b349
\ No newline at end of file
diff --git a/df/d42/binary__search__tree2_8cpp_a1d42876440ac5346e2850a32497385c3_cgraph.svg b/df/d42/binary__search__tree2_8cpp_a1d42876440ac5346e2850a32497385c3_cgraph.svg
deleted file mode 100644
index db3af59c3..000000000
--- a/df/d42/binary__search__tree2_8cpp_a1d42876440ac5346e2850a32497385c3_cgraph.svg
+++ /dev/null
@@ -1,121 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_contains Pages: 1 -->
-<svg width="217pt" height="161pt"
- viewBox="0.00 0.00 217.00 160.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 156.5)">
-<title>test_contains</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function for testing contains().">
-<polygon fill="#999999" stroke="#666666" points="74.5,-85.88 0,-85.88 0,-66.62 74.5,-66.62 74.5,-85.88"/>
-<text text-anchor="middle" x="37.25" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_contains</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2" target="_top" xlink:title="Recursive function to check if a value is in the BST.">
-<polygon fill="white" stroke="#666666" points="209,-134.5 110.5,-134.5 110.5,-104 209,-104 209,-134.5"/>
-<text text-anchor="start" x="118.5" y="-121" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="159.75" y="-109.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.5,-86.33C77.7,-90.33 90.97,-95.06 103.91,-99.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.62,-102.94 113.22,-103 104.97,-96.34 102.62,-102.94"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="186.5,-85.88 133,-85.88 133,-66.62 186.5,-66.62 186.5,-85.88"/>
-<text text-anchor="middle" x="159.75" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.73,-76.25C89.49,-76.25 106.51,-76.25 121.36,-76.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="121.2,-79.75 131.2,-76.25 121.2,-72.75 121.2,-79.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="white" stroke="#666666" points="209,-30.5 110.5,-30.5 110.5,0 209,0 209,-30.5"/>
-<text text-anchor="start" x="118.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="159.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M58.15,-66.18C74.31,-57.99 97.65,-46.18 117.78,-35.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="119.27,-39.16 126.61,-31.52 116.11,-32.91 119.27,-39.16"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.04,-134.99C133.61,-144.06 140.85,-152.5 159.75,-152.5 170.09,-152.5 176.93,-149.97 180.29,-146.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.75,-146.8 181.3,-136.49 176.79,-146.08 183.75,-146.8"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.04,-30.99C133.61,-40.06 140.85,-48.5 159.75,-48.5 170.09,-48.5 176.93,-45.97 180.29,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.75,-42.8 181.3,-32.49 176.79,-42.08 183.75,-42.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d42/binary__search__tree2_8cpp_a1d42876440ac5346e2850a32497385c3_cgraph_org.svg b/df/d42/binary__search__tree2_8cpp_a1d42876440ac5346e2850a32497385c3_cgraph_org.svg
deleted file mode 100644
index 5cbb3aa6a..000000000
--- a/df/d42/binary__search__tree2_8cpp_a1d42876440ac5346e2850a32497385c3_cgraph_org.svg
+++ /dev/null
@@ -1,95 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_contains Pages: 1 -->
-<svg width="217pt" height="161pt"
- viewBox="0.00 0.00 217.00 160.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 156.5)">
-<title>test_contains</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function for testing contains().">
-<polygon fill="#999999" stroke="#666666" points="74.5,-85.88 0,-85.88 0,-66.62 74.5,-66.62 74.5,-85.88"/>
-<text text-anchor="middle" x="37.25" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_contains</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2" target="_top" xlink:title="Recursive function to check if a value is in the BST.">
-<polygon fill="white" stroke="#666666" points="209,-134.5 110.5,-134.5 110.5,-104 209,-104 209,-134.5"/>
-<text text-anchor="start" x="118.5" y="-121" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="159.75" y="-109.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M66.5,-86.33C77.7,-90.33 90.97,-95.06 103.91,-99.68"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.62,-102.94 113.22,-103 104.97,-96.34 102.62,-102.94"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="186.5,-85.88 133,-85.88 133,-66.62 186.5,-66.62 186.5,-85.88"/>
-<text text-anchor="middle" x="159.75" y="-72.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.73,-76.25C89.49,-76.25 106.51,-76.25 121.36,-76.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="121.2,-79.75 131.2,-76.25 121.2,-72.75 121.2,-79.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="white" stroke="#666666" points="209,-30.5 110.5,-30.5 110.5,0 209,0 209,-30.5"/>
-<text text-anchor="start" x="118.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="159.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M58.15,-66.18C74.31,-57.99 97.65,-46.18 117.78,-35.99"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="119.27,-39.16 126.61,-31.52 116.11,-32.91 119.27,-39.16"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.04,-134.99C133.61,-144.06 140.85,-152.5 159.75,-152.5 170.09,-152.5 176.93,-149.97 180.29,-146.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.75,-146.8 181.3,-136.49 176.79,-146.08 183.75,-146.8"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.04,-30.99C133.61,-40.06 140.85,-48.5 159.75,-48.5 170.09,-48.5 176.93,-45.97 180.29,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.75,-42.8 181.3,-32.49 176.79,-42.08 183.75,-42.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d42/binary__search__tree2_8cpp_a8c882f43e1e52948a7841a8bfb091350_cgraph.map b/df/d42/binary__search__tree2_8cpp_a8c882f43e1e52948a7841a8bfb091350_cgraph.map
deleted file mode 100644
index 897f7e553..000000000
--- a/df/d42/binary__search__tree2_8cpp_a8c882f43e1e52948a7841a8bfb091350_cgraph.map
+++ /dev/null
@@ -1,16 +0,0 @@
-<map id="test_insert" name="test_insert">
-<area shape="rect" id="Node000001" title="Function for testing insert()." alt="" coords="5,176,88,202"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="166,5,237,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="50,175,79,112,103,74,134,41,150,31,153,36,137,46,107,78,84,114,55,177"/>
-<area shape="rect" id="Node000003" href="$d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" title="Recursive function to find the maximum value in the BST." alt="" coords="136,79,267,120"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="66,173,134,131,144,125,146,130,137,135,69,178"/>
-<area shape="rect" id="Node000004" href="$d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153" title="Recursive function to find the minimum value in the BST." alt="" coords="136,168,267,209"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="88,186,120,186,120,192,88,192"/>
-<area shape="rect" id="Node000005" href="$d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" title="Recursive function to insert a value into the BST." alt="" coords="136,258,267,298"/>
-<area shape="poly" id="edge6_Node000001_Node000005" title=" " alt="" coords="72,200,153,247,150,252,69,204"/>
-<area shape="rect" id="Node000006" href="$d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3" title="Get the number of values in the BST." alt="" coords="136,323,267,364"/>
-<area shape="poly" id="edge8_Node000001_Node000006" title=" " alt="" coords="57,201,88,251,111,281,137,308,143,312,139,316,134,312,107,285,84,255,52,203"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="171,79,170,69,175,60,185,55,201,53,219,55,229,61,226,66,217,60,201,58,187,60,178,64,175,70,177,78"/>
-<area shape="poly" id="edge5_Node000004_Node000004" title=" " alt="" coords="171,168,170,159,175,150,185,144,201,142,219,144,229,151,226,155,217,149,201,147,187,149,178,154,175,160,177,167"/>
-<area shape="poly" id="edge7_Node000005_Node000005" title=" " alt="" coords="171,258,170,248,175,239,185,233,201,231,219,234,229,240,226,244,217,239,201,236,187,238,178,243,175,249,177,257"/>
-</map>
diff --git a/df/d42/binary__search__tree2_8cpp_a8c882f43e1e52948a7841a8bfb091350_cgraph.md5 b/df/d42/binary__search__tree2_8cpp_a8c882f43e1e52948a7841a8bfb091350_cgraph.md5
deleted file mode 100644
index 8bdb8162e..000000000
--- a/df/d42/binary__search__tree2_8cpp_a8c882f43e1e52948a7841a8bfb091350_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e98e0e6d35aef66244459af54ef7abb0
\ No newline at end of file
diff --git a/df/d42/binary__search__tree2_8cpp_a8c882f43e1e52948a7841a8bfb091350_cgraph.svg b/df/d42/binary__search__tree2_8cpp_a8c882f43e1e52948a7841a8bfb091350_cgraph.svg
deleted file mode 100644
index eba9524e3..000000000
--- a/df/d42/binary__search__tree2_8cpp_a8c882f43e1e52948a7841a8bfb091350_cgraph.svg
+++ /dev/null
@@ -1,168 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_insert Pages: 1 -->
-<svg width="204pt" height="277pt"
- viewBox="0.00 0.00 204.25 276.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 272.88)">
-<title>test_insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function for testing insert().">
-<polygon fill="#999999" stroke="#666666" points="61.75,-140.88 0,-140.88 0,-121.62 61.75,-121.62 61.75,-140.88"/>
-<text text-anchor="middle" x="30.88" y="-127.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173.75,-268.88 120.25,-268.88 120.25,-249.62 173.75,-249.62 173.75,-268.88"/>
-<text text-anchor="middle" x="147" y="-255.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.34,-141.15C43.19,-162.25 64.3,-212.01 97.75,-240.25 101.21,-243.17 105.18,-245.68 109.31,-247.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="107.81,-250.99 118.37,-251.82 110.63,-244.58 107.81,-250.99"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" target="_top" xlink:title="Recursive function to find the maximum value in the BST.">
-<polygon fill="white" stroke="#666666" points="196.25,-213.5 97.75,-213.5 97.75,-183 196.25,-183 196.25,-213.5"/>
-<text text-anchor="start" x="105.75" y="-200" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="147" y="-188.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M46.81,-141.32C60.01,-150.08 79.89,-162.96 97.75,-173.25 100.03,-174.56 102.38,-175.88 104.76,-177.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.84,-180.14 113.3,-181.8 106.16,-173.97 102.84,-180.14"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153" target="_top" xlink:title="Recursive function to find the minimum value in the BST.">
-<polygon fill="white" stroke="#666666" points="196.25,-146.5 97.75,-146.5 97.75,-116 196.25,-116 196.25,-146.5"/>
-<text text-anchor="start" x="105.75" y="-133" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="147" y="-121.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.16,-131.25C69.6,-131.25 77.84,-131.25 86.15,-131.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.95,-134.75 95.95,-131.25 85.95,-127.75 85.95,-134.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="white" stroke="#666666" points="196.25,-79.5 97.75,-79.5 97.75,-49 196.25,-49 196.25,-79.5"/>
-<text text-anchor="start" x="105.75" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="147" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M48.71,-121.36C64.63,-112.02 89.03,-97.7 109.41,-85.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.18,-88.75 118.04,-80.67 107.64,-82.71 111.18,-88.75"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3" target="_top" xlink:title="Get the number of values in the BST.">
-<polygon fill="white" stroke="#666666" points="196.25,-30.5 97.75,-30.5 97.75,0 196.25,0 196.25,-30.5"/>
-<text text-anchor="start" x="105.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="147" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge8_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge8_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37,-121.33C46.75,-103.25 69.53,-64.56 97.75,-40.25 99,-39.17 100.31,-38.13 101.65,-37.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.36,-40.18 109.74,-31.71 99.48,-34.35 103.36,-40.18"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.42,-213.99C122.22,-223.06 129.08,-231.5 147,-231.5 156.8,-231.5 163.29,-228.97 166.47,-225.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.93,-225.79 167.43,-215.49 162.97,-225.1 169.93,-225.79"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.42,-146.99C122.22,-156.06 129.08,-164.5 147,-164.5 156.8,-164.5 163.29,-161.97 166.47,-158.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.93,-158.79 167.43,-148.49 162.97,-158.1 169.93,-158.79"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge7_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge7_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.42,-79.99C122.22,-89.06 129.08,-97.5 147,-97.5 156.8,-97.5 163.29,-94.97 166.47,-91.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.93,-91.79 167.43,-81.49 162.97,-91.1 169.93,-91.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d42/binary__search__tree2_8cpp_a8c882f43e1e52948a7841a8bfb091350_cgraph_org.svg b/df/d42/binary__search__tree2_8cpp_a8c882f43e1e52948a7841a8bfb091350_cgraph_org.svg
deleted file mode 100644
index c46dca64b..000000000
--- a/df/d42/binary__search__tree2_8cpp_a8c882f43e1e52948a7841a8bfb091350_cgraph_org.svg
+++ /dev/null
@@ -1,142 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_insert Pages: 1 -->
-<svg width="204pt" height="277pt"
- viewBox="0.00 0.00 204.25 276.88" 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 272.88)">
-<title>test_insert</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function for testing insert().">
-<polygon fill="#999999" stroke="#666666" points="61.75,-140.88 0,-140.88 0,-121.62 61.75,-121.62 61.75,-140.88"/>
-<text text-anchor="middle" x="30.88" y="-127.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_insert</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="173.75,-268.88 120.25,-268.88 120.25,-249.62 173.75,-249.62 173.75,-268.88"/>
-<text text-anchor="middle" x="147" y="-255.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M35.34,-141.15C43.19,-162.25 64.3,-212.01 97.75,-240.25 101.21,-243.17 105.18,-245.68 109.31,-247.82"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="107.81,-250.99 118.37,-251.82 110.63,-244.58 107.81,-250.99"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" target="_top" xlink:title="Recursive function to find the maximum value in the BST.">
-<polygon fill="white" stroke="#666666" points="196.25,-213.5 97.75,-213.5 97.75,-183 196.25,-183 196.25,-213.5"/>
-<text text-anchor="start" x="105.75" y="-200" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="147" y="-188.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M46.81,-141.32C60.01,-150.08 79.89,-162.96 97.75,-173.25 100.03,-174.56 102.38,-175.88 104.76,-177.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="102.84,-180.14 113.3,-181.8 106.16,-173.97 102.84,-180.14"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153" target="_top" xlink:title="Recursive function to find the minimum value in the BST.">
-<polygon fill="white" stroke="#666666" points="196.25,-146.5 97.75,-146.5 97.75,-116 196.25,-116 196.25,-146.5"/>
-<text text-anchor="start" x="105.75" y="-133" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="147" y="-121.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M62.16,-131.25C69.6,-131.25 77.84,-131.25 86.15,-131.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="85.95,-134.75 95.95,-131.25 85.95,-127.75 85.95,-134.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="white" stroke="#666666" points="196.25,-79.5 97.75,-79.5 97.75,-49 196.25,-49 196.25,-79.5"/>
-<text text-anchor="start" x="105.75" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="147" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M48.71,-121.36C64.63,-112.02 89.03,-97.7 109.41,-85.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="111.18,-88.75 118.04,-80.67 107.64,-82.71 111.18,-88.75"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3" target="_top" xlink:title="Get the number of values in the BST.">
-<polygon fill="white" stroke="#666666" points="196.25,-30.5 97.75,-30.5 97.75,0 196.25,0 196.25,-30.5"/>
-<text text-anchor="start" x="105.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="147" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge8_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge8_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37,-121.33C46.75,-103.25 69.53,-64.56 97.75,-40.25 99,-39.17 100.31,-38.13 101.65,-37.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="103.36,-40.18 109.74,-31.71 99.48,-34.35 103.36,-40.18"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.42,-213.99C122.22,-223.06 129.08,-231.5 147,-231.5 156.8,-231.5 163.29,-228.97 166.47,-225.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.93,-225.79 167.43,-215.49 162.97,-225.1 169.93,-225.79"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.42,-146.99C122.22,-156.06 129.08,-164.5 147,-164.5 156.8,-164.5 163.29,-161.97 166.47,-158.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.93,-158.79 167.43,-148.49 162.97,-158.1 169.93,-158.79"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge7_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge7_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M126.42,-79.99C122.22,-89.06 129.08,-97.5 147,-97.5 156.8,-97.5 163.29,-94.97 166.47,-91.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="169.93,-91.79 167.43,-81.49 162.97,-91.1 169.93,-91.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d42/binary__search__tree2_8cpp_a94b76f781fcbe1ad0e3397ace6bb1965_cgraph.map b/df/d42/binary__search__tree2_8cpp_a94b76f781fcbe1ad0e3397ace6bb1965_cgraph.map
deleted file mode 100644
index 8f75effbd..000000000
--- a/df/d42/binary__search__tree2_8cpp_a94b76f781fcbe1ad0e3397ace6bb1965_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="test_get_elements_postorder" name="test_get_elements_postorder">
-<area shape="rect" id="Node000001" title="Function for testing get_elements_postorder()." alt="" coords="5,63,195,88"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="291,5,362,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="153,59,275,28,277,33,155,65"/>
-<area shape="rect" id="Node000003" href="$d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff" title="Get all values of the BST in post&#45;order order." alt="" coords="243,55,411,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="195,73,227,73,227,78,195,78"/>
-<area shape="rect" id="Node000005" href="$d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" title="Recursive function to insert a value into the BST." alt="" coords="261,144,392,185"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="136,86,260,136,258,141,134,91"/>
-<area shape="rect" id="Node000004" href="$d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362" title="Recursive function to traverse the tree in post&#45;order order." alt="" coords="459,55,596,96"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="412,73,443,73,443,78,412,78"/>
-<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="489,55,488,45,494,36,507,31,528,29,550,31,563,37,560,42,548,36,528,34,509,36,497,40,493,46,495,54"/>
-<area shape="poly" id="edge6_Node000005_Node000005" title=" " alt="" coords="289,144,287,135,293,126,307,120,327,118,349,120,362,126,359,131,347,125,327,123,308,125,296,130,292,136,294,143"/>
-</map>
diff --git a/df/d42/binary__search__tree2_8cpp_a94b76f781fcbe1ad0e3397ace6bb1965_cgraph.md5 b/df/d42/binary__search__tree2_8cpp_a94b76f781fcbe1ad0e3397ace6bb1965_cgraph.md5
deleted file mode 100644
index 56267a62b..000000000
--- a/df/d42/binary__search__tree2_8cpp_a94b76f781fcbe1ad0e3397ace6bb1965_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5848010a12eb295a757ad2cf075efc03
\ No newline at end of file
diff --git a/df/d42/binary__search__tree2_8cpp_a94b76f781fcbe1ad0e3397ace6bb1965_cgraph.svg b/df/d42/binary__search__tree2_8cpp_a94b76f781fcbe1ad0e3397ace6bb1965_cgraph.svg
deleted file mode 100644
index 05fcb8c4b..000000000
--- a/df/d42/binary__search__tree2_8cpp_a94b76f781fcbe1ad0e3397ace6bb1965_cgraph.svg
+++ /dev/null
@@ -1,140 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_get_elements_postorder Pages: 1 -->
-<svg width="451pt" height="143pt"
- viewBox="0.00 0.00 451.25 142.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138.88)">
-<title>test_get_elements_postorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function for testing get_elements_postorder().">
-<polygon fill="#999999" stroke="#666666" points="142,-91.88 0,-91.88 0,-72.62 142,-72.62 142,-91.88"/>
-<text text-anchor="middle" x="71" y="-78.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_get_elements_postorder</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.88,-134.88 214.38,-134.88 214.38,-115.62 267.88,-115.62 267.88,-134.88"/>
-<text text-anchor="middle" x="241.12" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.42,-92.33C139.1,-99.41 175.89,-108.82 203.04,-115.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.01,-119.12 212.57,-118.2 203.75,-112.33 202.01,-119.12"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff" target="_top" xlink:title="Get all values of the BST in post&#45;order order.">
-<polygon fill="white" stroke="#666666" points="304.25,-97.5 178,-97.5 178,-67 304.25,-67 304.25,-97.5"/>
-<text text-anchor="start" x="186" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="241.12" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_elements_postorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.33,-82.25C150.19,-82.25 158.21,-82.25 166.11,-82.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.06,-85.75 176.06,-82.25 166.06,-78.75 166.06,-85.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="white" stroke="#666666" points="290.38,-30.5 191.88,-30.5 191.88,0 290.38,0 290.38,-30.5"/>
-<text text-anchor="start" x="199.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="241.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.17,-72.22C121.67,-62.46 159.59,-47.35 190.21,-35.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.31,-38.47 199.3,-31.52 188.72,-31.97 191.31,-38.47"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362" target="_top" xlink:title="Recursive function to traverse the tree in post&#45;order order.">
-<polygon fill="white" stroke="#666666" points="443.25,-97.5 340.25,-97.5 340.25,-67 443.25,-67 443.25,-97.5"/>
-<text text-anchor="start" x="348.25" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="391.75" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_postorder</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.72,-82.25C312.61,-82.25 320.68,-82.25 328.56,-82.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.42,-85.75 338.42,-82.25 328.42,-78.75 328.42,-85.75"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M365.06,-97.99C359.61,-107.06 368.51,-115.5 391.75,-115.5 404.46,-115.5 412.88,-112.97 417.01,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="420.46,-109.85 418.25,-99.49 413.51,-108.96 420.46,-109.85"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.43,-30.99C208.99,-40.06 217.88,-48.5 241.12,-48.5 253.83,-48.5 262.25,-45.97 266.39,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.83,-42.85 267.62,-32.49 262.89,-41.96 269.83,-42.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d42/binary__search__tree2_8cpp_a94b76f781fcbe1ad0e3397ace6bb1965_cgraph_org.svg b/df/d42/binary__search__tree2_8cpp_a94b76f781fcbe1ad0e3397ace6bb1965_cgraph_org.svg
deleted file mode 100644
index 01af93527..000000000
--- a/df/d42/binary__search__tree2_8cpp_a94b76f781fcbe1ad0e3397ace6bb1965_cgraph_org.svg
+++ /dev/null
@@ -1,114 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_get_elements_postorder Pages: 1 -->
-<svg width="451pt" height="143pt"
- viewBox="0.00 0.00 451.25 142.88" 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 138.88)">
-<title>test_get_elements_postorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function for testing get_elements_postorder().">
-<polygon fill="#999999" stroke="#666666" points="142,-91.88 0,-91.88 0,-72.62 142,-72.62 142,-91.88"/>
-<text text-anchor="middle" x="71" y="-78.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_get_elements_postorder</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.88,-134.88 214.38,-134.88 214.38,-115.62 267.88,-115.62 267.88,-134.88"/>
-<text text-anchor="middle" x="241.12" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.42,-92.33C139.1,-99.41 175.89,-108.82 203.04,-115.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="202.01,-119.12 212.57,-118.2 203.75,-112.33 202.01,-119.12"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff" target="_top" xlink:title="Get all values of the BST in post&#45;order order.">
-<polygon fill="white" stroke="#666666" points="304.25,-97.5 178,-97.5 178,-67 304.25,-67 304.25,-97.5"/>
-<text text-anchor="start" x="186" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="241.12" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_elements_postorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M142.33,-82.25C150.19,-82.25 158.21,-82.25 166.11,-82.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="166.06,-85.75 176.06,-82.25 166.06,-78.75 166.06,-85.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="white" stroke="#666666" points="290.38,-30.5 191.88,-30.5 191.88,0 290.38,0 290.38,-30.5"/>
-<text text-anchor="start" x="199.88" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="241.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M97.17,-72.22C121.67,-62.46 159.59,-47.35 190.21,-35.14"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="191.31,-38.47 199.3,-31.52 188.72,-31.97 191.31,-38.47"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362" target="_top" xlink:title="Recursive function to traverse the tree in post&#45;order order.">
-<polygon fill="white" stroke="#666666" points="443.25,-97.5 340.25,-97.5 340.25,-67 443.25,-67 443.25,-97.5"/>
-<text text-anchor="start" x="348.25" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="391.75" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_postorder</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M304.72,-82.25C312.61,-82.25 320.68,-82.25 328.56,-82.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="328.42,-85.75 338.42,-82.25 328.42,-78.75 328.42,-85.75"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M365.06,-97.99C359.61,-107.06 368.51,-115.5 391.75,-115.5 404.46,-115.5 412.88,-112.97 417.01,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="420.46,-109.85 418.25,-99.49 413.51,-108.96 420.46,-109.85"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M214.43,-30.99C208.99,-40.06 217.88,-48.5 241.12,-48.5 253.83,-48.5 262.25,-45.97 266.39,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="269.83,-42.85 267.62,-32.49 262.89,-41.96 269.83,-42.85"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d42/binary__search__tree2_8cpp_a9856b68e2cba50d2e26a1cbe374e0365_cgraph.map b/df/d42/binary__search__tree2_8cpp_a9856b68e2cba50d2e26a1cbe374e0365_cgraph.map
deleted file mode 100644
index fe2bb91e3..000000000
--- a/df/d42/binary__search__tree2_8cpp_a9856b68e2cba50d2e26a1cbe374e0365_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="test_find_max" name="test_find_max">
-<area shape="rect" id="Node000001" title="Function for testing find_max()." alt="" coords="5,87,109,112"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="187,5,258,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="78,84,155,41,171,34,173,39,158,46,81,88"/>
-<area shape="rect" id="Node000003" href="$d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" title="Recursive function to find the maximum value in the BST." alt="" coords="157,79,288,120"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="109,97,141,97,141,102,109,102"/>
-<area shape="rect" id="Node000004" href="$d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" title="Recursive function to insert a value into the BST." alt="" coords="157,168,288,209"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="84,111,171,158,169,163,81,115"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="190,79,189,69,194,60,205,55,222,53,241,55,251,61,249,66,239,60,222,58,207,60,198,64,194,70,196,78"/>
-<area shape="poly" id="edge5_Node000004_Node000004" title=" " alt="" coords="190,168,189,159,194,150,205,144,222,142,241,144,251,151,249,155,239,149,222,147,207,149,198,154,194,160,196,167"/>
-</map>
diff --git a/df/d42/binary__search__tree2_8cpp_a9856b68e2cba50d2e26a1cbe374e0365_cgraph.md5 b/df/d42/binary__search__tree2_8cpp_a9856b68e2cba50d2e26a1cbe374e0365_cgraph.md5
deleted file mode 100644
index 7a537d3d0..000000000
--- a/df/d42/binary__search__tree2_8cpp_a9856b68e2cba50d2e26a1cbe374e0365_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5d65cdde446251e2c27e1823488ea4d3
\ No newline at end of file
diff --git a/df/d42/binary__search__tree2_8cpp_a9856b68e2cba50d2e26a1cbe374e0365_cgraph.svg b/df/d42/binary__search__tree2_8cpp_a9856b68e2cba50d2e26a1cbe374e0365_cgraph.svg
deleted file mode 100644
index 7993beeb0..000000000
--- a/df/d42/binary__search__tree2_8cpp_a9856b68e2cba50d2e26a1cbe374e0365_cgraph.svg
+++ /dev/null
@@ -1,121 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_find_max Pages: 1 -->
-<svg width="220pt" height="161pt"
- viewBox="0.00 0.00 220.00 160.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 156.88)">
-<title>test_find_max</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function for testing find_max().">
-<polygon fill="#999999" stroke="#666666" points="77.5,-91.88 0,-91.88 0,-72.62 77.5,-72.62 77.5,-91.88"/>
-<text text-anchor="middle" x="38.75" y="-78.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_find_max</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.5,-152.88 136,-152.88 136,-133.62 189.5,-133.62 189.5,-152.88"/>
-<text text-anchor="middle" x="162.75" y="-139.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.8,-92.27C70.5,-101.24 93.03,-114.45 113.5,-124.25 117.25,-126.05 121.22,-127.81 125.21,-129.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.68,-132.66 134.27,-133.19 126.32,-126.18 123.68,-132.66"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" target="_top" xlink:title="Recursive function to find the maximum value in the BST.">
-<polygon fill="white" stroke="#666666" points="212,-97.5 113.5,-97.5 113.5,-67 212,-67 212,-97.5"/>
-<text text-anchor="start" x="121.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="162.75" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.68,-82.25C85.29,-82.25 93.46,-82.25 101.61,-82.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.54,-85.75 111.54,-82.25 101.54,-78.75 101.54,-85.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="white" stroke="#666666" points="212,-30.5 113.5,-30.5 113.5,0 212,0 212,-30.5"/>
-<text text-anchor="start" x="121.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="162.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M58.01,-72.22C75.23,-62.77 101.57,-48.3 123.4,-36.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.97,-39.44 132.05,-31.56 121.6,-33.3 124.97,-39.44"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.78,-97.99C136.29,-107.06 143.62,-115.5 162.75,-115.5 173.21,-115.5 180.14,-112.97 183.54,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187,-109.8 184.56,-99.49 180.04,-109.07 187,-109.8"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.78,-30.99C136.29,-40.06 143.62,-48.5 162.75,-48.5 173.21,-48.5 180.14,-45.97 183.54,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187,-42.8 184.56,-32.49 180.04,-42.07 187,-42.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d42/binary__search__tree2_8cpp_a9856b68e2cba50d2e26a1cbe374e0365_cgraph_org.svg b/df/d42/binary__search__tree2_8cpp_a9856b68e2cba50d2e26a1cbe374e0365_cgraph_org.svg
deleted file mode 100644
index 8ce3fcafb..000000000
--- a/df/d42/binary__search__tree2_8cpp_a9856b68e2cba50d2e26a1cbe374e0365_cgraph_org.svg
+++ /dev/null
@@ -1,95 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_find_max Pages: 1 -->
-<svg width="220pt" height="161pt"
- viewBox="0.00 0.00 220.00 160.88" 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 156.88)">
-<title>test_find_max</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function for testing find_max().">
-<polygon fill="#999999" stroke="#666666" points="77.5,-91.88 0,-91.88 0,-72.62 77.5,-72.62 77.5,-91.88"/>
-<text text-anchor="middle" x="38.75" y="-78.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_find_max</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.5,-152.88 136,-152.88 136,-133.62 189.5,-133.62 189.5,-152.88"/>
-<text text-anchor="middle" x="162.75" y="-139.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.8,-92.27C70.5,-101.24 93.03,-114.45 113.5,-124.25 117.25,-126.05 121.22,-127.81 125.21,-129.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="123.68,-132.66 134.27,-133.19 126.32,-126.18 123.68,-132.66"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" target="_top" xlink:title="Recursive function to find the maximum value in the BST.">
-<polygon fill="white" stroke="#666666" points="212,-97.5 113.5,-97.5 113.5,-67 212,-67 212,-97.5"/>
-<text text-anchor="start" x="121.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="162.75" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.68,-82.25C85.29,-82.25 93.46,-82.25 101.61,-82.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.54,-85.75 111.54,-82.25 101.54,-78.75 101.54,-85.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="white" stroke="#666666" points="212,-30.5 113.5,-30.5 113.5,0 212,0 212,-30.5"/>
-<text text-anchor="start" x="121.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="162.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M58.01,-72.22C75.23,-62.77 101.57,-48.3 123.4,-36.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="124.97,-39.44 132.05,-31.56 121.6,-33.3 124.97,-39.44"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.78,-97.99C136.29,-107.06 143.62,-115.5 162.75,-115.5 173.21,-115.5 180.14,-112.97 183.54,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187,-109.8 184.56,-99.49 180.04,-109.07 187,-109.8"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M140.78,-30.99C136.29,-40.06 143.62,-48.5 162.75,-48.5 173.21,-48.5 180.14,-45.97 183.54,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187,-42.8 184.56,-32.49 180.04,-42.07 187,-42.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d42/binary__search__tree2_8cpp_ab00b8d0f21aeb5fbddb6decf3bcb640a_cgraph.map b/df/d42/binary__search__tree2_8cpp_ab00b8d0f21aeb5fbddb6decf3bcb640a_cgraph.map
deleted file mode 100644
index 4eb0d8d6f..000000000
--- a/df/d42/binary__search__tree2_8cpp_ab00b8d0f21aeb5fbddb6decf3bcb640a_cgraph.map
+++ /dev/null
@@ -1,13 +0,0 @@
-<map id="test_get_elements_preorder" name="test_get_elements_preorder">
-<area shape="rect" id="Node000001" title="Function for testing get_elements_preorder()." alt="" coords="5,63,188,88"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="281,5,352,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="148,59,265,29,267,34,149,65"/>
-<area shape="rect" id="Node000003" href="$d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13" title="Get all values of the BST in pre&#45;order order." alt="" coords="236,55,397,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="188,73,220,73,220,78,188,78"/>
-<area shape="rect" id="Node000005" href="$d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" title="Recursive function to insert a value into the BST." alt="" coords="251,144,382,185"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="131,86,251,136,249,141,129,91"/>
-<area shape="rect" id="Node000004" href="$d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1" title="Recursive function to traverse the tree in pre&#45;order order." alt="" coords="445,55,576,96"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="397,73,429,73,429,78,397,78"/>
-<area shape="poly" id="edge4_Node000004_Node000004" title=" " alt="" coords="474,55,472,45,478,36,491,31,511,29,532,31,544,37,542,42,530,36,511,34,492,36,481,40,477,46,479,54"/>
-<area shape="poly" id="edge6_Node000005_Node000005" title=" " alt="" coords="279,144,277,135,284,126,297,120,316,118,338,120,350,127,348,131,336,125,316,123,298,125,287,130,283,136,285,143"/>
-</map>
diff --git a/df/d42/binary__search__tree2_8cpp_ab00b8d0f21aeb5fbddb6decf3bcb640a_cgraph.md5 b/df/d42/binary__search__tree2_8cpp_ab00b8d0f21aeb5fbddb6decf3bcb640a_cgraph.md5
deleted file mode 100644
index 90ba772c3..000000000
--- a/df/d42/binary__search__tree2_8cpp_ab00b8d0f21aeb5fbddb6decf3bcb640a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-62e3247feb1cafb171dbbc79c234264e
\ No newline at end of file
diff --git a/df/d42/binary__search__tree2_8cpp_ab00b8d0f21aeb5fbddb6decf3bcb640a_cgraph.svg b/df/d42/binary__search__tree2_8cpp_ab00b8d0f21aeb5fbddb6decf3bcb640a_cgraph.svg
deleted file mode 100644
index d1e71ff22..000000000
--- a/df/d42/binary__search__tree2_8cpp_ab00b8d0f21aeb5fbddb6decf3bcb640a_cgraph.svg
+++ /dev/null
@@ -1,140 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_get_elements_preorder Pages: 1 -->
-<svg width="436pt" height="143pt"
- viewBox="0.00 0.00 436.25 142.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138.88)">
-<title>test_get_elements_preorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function for testing get_elements_preorder().">
-<polygon fill="#999999" stroke="#666666" points="136.75,-91.88 0,-91.88 0,-72.62 136.75,-72.62 136.75,-91.88"/>
-<text text-anchor="middle" x="68.38" y="-78.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_get_elements_preorder</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260,-134.88 206.5,-134.88 206.5,-115.62 260,-115.62 260,-134.88"/>
-<text text-anchor="middle" x="233.25" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.56,-92.33C134.1,-99.34 169.27,-108.62 195.49,-115.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.46,-118.89 205.02,-118.06 196.25,-112.12 194.46,-118.89"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13" target="_top" xlink:title="Get all values of the BST in pre&#45;order order.">
-<polygon fill="white" stroke="#666666" points="293.75,-97.5 172.75,-97.5 172.75,-67 293.75,-67 293.75,-97.5"/>
-<text text-anchor="start" x="180.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="233.25" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_elements_preorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M137.03,-82.25C144.9,-82.25 152.95,-82.25 160.87,-82.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.82,-85.75 170.82,-82.25 160.82,-78.75 160.82,-85.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="white" stroke="#666666" points="282.5,-30.5 184,-30.5 184,0 282.5,0 282.5,-30.5"/>
-<text text-anchor="start" x="192" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="233.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.76,-72.22C117.39,-62.5 153.9,-47.48 183.51,-35.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.75,-38.58 192.66,-31.53 182.08,-32.1 184.75,-38.58"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1" target="_top" xlink:title="Recursive function to traverse the tree in pre&#45;order order.">
-<polygon fill="white" stroke="#666666" points="428.25,-97.5 329.75,-97.5 329.75,-67 428.25,-67 428.25,-97.5"/>
-<text text-anchor="start" x="337.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="379" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_preorder</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.96,-82.25C301.95,-82.25 310.13,-82.25 318.12,-82.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.11,-85.75 328.11,-82.25 318.11,-78.75 318.11,-85.75"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M353.17,-97.99C347.9,-107.06 356.51,-115.5 379,-115.5 391.3,-115.5 399.45,-112.97 403.44,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="406.89,-109.84 404.64,-99.49 399.94,-108.98 406.89,-109.84"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.42,-30.99C202.15,-40.06 210.76,-48.5 233.25,-48.5 245.55,-48.5 253.7,-45.97 257.69,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.14,-42.84 258.89,-32.49 254.19,-41.98 261.14,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d42/binary__search__tree2_8cpp_ab00b8d0f21aeb5fbddb6decf3bcb640a_cgraph_org.svg b/df/d42/binary__search__tree2_8cpp_ab00b8d0f21aeb5fbddb6decf3bcb640a_cgraph_org.svg
deleted file mode 100644
index 5b08dff02..000000000
--- a/df/d42/binary__search__tree2_8cpp_ab00b8d0f21aeb5fbddb6decf3bcb640a_cgraph_org.svg
+++ /dev/null
@@ -1,114 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_get_elements_preorder Pages: 1 -->
-<svg width="436pt" height="143pt"
- viewBox="0.00 0.00 436.25 142.88" 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 138.88)">
-<title>test_get_elements_preorder</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function for testing get_elements_preorder().">
-<polygon fill="#999999" stroke="#666666" points="136.75,-91.88 0,-91.88 0,-72.62 136.75,-72.62 136.75,-91.88"/>
-<text text-anchor="middle" x="68.38" y="-78.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_get_elements_preorder</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="260,-134.88 206.5,-134.88 206.5,-115.62 260,-115.62 260,-134.88"/>
-<text text-anchor="middle" x="233.25" y="-121.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M107.56,-92.33C134.1,-99.34 169.27,-108.62 195.49,-115.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="194.46,-118.89 205.02,-118.06 196.25,-112.12 194.46,-118.89"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13" target="_top" xlink:title="Get all values of the BST in pre&#45;order order.">
-<polygon fill="white" stroke="#666666" points="293.75,-97.5 172.75,-97.5 172.75,-67 293.75,-67 293.75,-97.5"/>
-<text text-anchor="start" x="180.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="233.25" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_elements_preorder</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M137.03,-82.25C144.9,-82.25 152.95,-82.25 160.87,-82.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="160.82,-85.75 170.82,-82.25 160.82,-78.75 160.82,-85.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="white" stroke="#666666" points="282.5,-30.5 184,-30.5 184,0 282.5,0 282.5,-30.5"/>
-<text text-anchor="start" x="192" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="233.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M93.76,-72.22C117.39,-62.5 153.9,-47.48 183.51,-35.3"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.75,-38.58 192.66,-31.53 182.08,-32.1 184.75,-38.58"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1" target="_top" xlink:title="Recursive function to traverse the tree in pre&#45;order order.">
-<polygon fill="white" stroke="#666666" points="428.25,-97.5 329.75,-97.5 329.75,-67 428.25,-67 428.25,-97.5"/>
-<text text-anchor="start" x="337.75" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="379" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_preorder</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M293.96,-82.25C301.95,-82.25 310.13,-82.25 318.12,-82.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="318.11,-85.75 328.11,-82.25 318.11,-78.75 318.11,-85.75"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M353.17,-97.99C347.9,-107.06 356.51,-115.5 379,-115.5 391.3,-115.5 399.45,-112.97 403.44,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="406.89,-109.84 404.64,-99.49 399.94,-108.98 406.89,-109.84"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge6_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M207.42,-30.99C202.15,-40.06 210.76,-48.5 233.25,-48.5 245.55,-48.5 253.7,-45.97 257.69,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="261.14,-42.84 258.89,-32.49 254.19,-41.98 261.14,-42.84"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d42/binary__search__tree2_8cpp_ab1333c3ea06dcad896ee204bbd407c4e_cgraph.map b/df/d42/binary__search__tree2_8cpp_ab1333c3ea06dcad896ee204bbd407c4e_cgraph.map
deleted file mode 100644
index f8f1815c4..000000000
--- a/df/d42/binary__search__tree2_8cpp_ab1333c3ea06dcad896ee204bbd407c4e_cgraph.map
+++ /dev/null
@@ -1,25 +0,0 @@
-<map id="test_remove" name="test_remove">
-<area shape="rect" id="Node000001" title="Function for testing remove()." alt="" coords="5,226,99,252"/>
-<area shape="rect" id="Node000002" href="$d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2" title="Recursive function to check if a value is in the BST." alt="" coords="147,29,278,70"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,225,87,158,113,117,145,80,147,77,151,81,149,84,117,120,91,160,61,227"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="177,94,248,120"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="61,224,96,182,145,137,163,125,166,130,148,141,100,186,65,227"/>
-<area shape="rect" id="Node000004" href="$d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" title="Recursive function to find the maximum value in the BST." alt="" coords="326,239,457,279"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="68,224,102,200,146,180,183,171,212,168,242,171,279,180,322,200,358,226,355,231,319,205,277,186,241,176,213,173,184,177,148,186,105,205,71,228"/>
-<area shape="rect" id="Node000005" href="$d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153" title="Recursive function to find the minimum value in the BST." alt="" coords="147,219,278,259"/>
-<area shape="poly" id="edge6_Node000001_Node000005" title=" " alt="" coords="99,236,131,236,131,242,99,242"/>
-<area shape="rect" id="Node000006" href="$d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" title="Recursive function to insert a value into the BST." alt="" coords="147,308,278,349"/>
-<area shape="poly" id="edge8_Node000001_Node000006" title=" " alt="" coords="78,250,162,298,160,302,76,255"/>
-<area shape="rect" id="Node000007" href="$d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153" title="Recursive function to remove a value from the BST." alt="" coords="147,397,278,438"/>
-<area shape="poly" id="edge10_Node000001_Node000007" title=" " alt="" coords="65,251,100,300,149,359,176,385,172,389,145,362,96,303,60,254"/>
-<area shape="rect" id="Node000009" href="$d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3" title="Get the number of values in the BST." alt="" coords="147,463,278,503"/>
-<area shape="poly" id="edge14_Node000001_Node000009" title=" " alt="" coords="59,251,68,289,85,341,112,397,129,424,149,448,152,451,148,455,145,451,125,427,107,400,80,343,63,290,53,253"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="181,29,180,19,185,11,196,5,212,3,230,5,241,11,238,16,228,10,212,8,197,10,189,14,185,20,187,28"/>
-<area shape="poly" id="edge5_Node000004_Node000004" title=" " alt="" coords="357,239,356,229,361,220,373,214,392,212,411,214,423,221,420,225,410,220,392,217,375,219,365,224,361,230,363,238"/>
-<area shape="poly" id="edge7_Node000005_Node000005" title=" " alt="" coords="181,218,180,209,185,200,196,194,212,192,230,194,241,201,238,205,228,199,212,197,197,199,189,204,185,210,187,218"/>
-<area shape="poly" id="edge9_Node000006_Node000006" title=" " alt="" coords="181,308,180,298,185,289,196,283,212,281,230,284,241,290,238,295,228,289,212,287,197,288,189,293,185,299,187,307"/>
-<area shape="poly" id="edge11_Node000007_Node000004" title=" " alt="" coords="235,395,276,358,355,287,358,291,280,362,239,399"/>
-<area shape="poly" id="edge13_Node000007_Node000007" title=" " alt="" coords="181,397,180,387,185,379,196,373,212,371,230,373,241,379,238,384,228,378,212,376,197,378,189,382,185,388,187,396"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="352,405,431,430"/>
-<area shape="poly" id="edge12_Node000007_Node000008" title=" " alt="" coords="278,415,337,415,337,420,278,420"/>
-</map>
diff --git a/df/d42/binary__search__tree2_8cpp_ab1333c3ea06dcad896ee204bbd407c4e_cgraph.md5 b/df/d42/binary__search__tree2_8cpp_ab1333c3ea06dcad896ee204bbd407c4e_cgraph.md5
deleted file mode 100644
index e79306494..000000000
--- a/df/d42/binary__search__tree2_8cpp_ab1333c3ea06dcad896ee204bbd407c4e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cc1a6832b39fa3134775ce86077f8b77
\ No newline at end of file
diff --git a/df/d42/binary__search__tree2_8cpp_ab1333c3ea06dcad896ee204bbd407c4e_cgraph.svg b/df/d42/binary__search__tree2_8cpp_ab1333c3ea06dcad896ee204bbd407c4e_cgraph.svg
deleted file mode 100644
index 0944cb8f6..000000000
--- a/df/d42/binary__search__tree2_8cpp_ab1333c3ea06dcad896ee204bbd407c4e_cgraph.svg
+++ /dev/null
@@ -1,251 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_remove Pages: 1 -->
-<svg width="347pt" height="382pt"
- viewBox="0.00 0.00 347.00 381.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 377.5)">
-<title>test_remove</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function for testing remove().">
-<polygon fill="#999999" stroke="#666666" points="70,-207.88 0,-207.88 0,-188.62 70,-188.62 70,-207.88"/>
-<text text-anchor="middle" x="35" y="-194.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_remove</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2" target="_top" xlink:title="Recursive function to check if a value is in the BST.">
-<polygon fill="white" stroke="#666666" points="204.5,-355.5 106,-355.5 106,-325 204.5,-325 204.5,-355.5"/>
-<text text-anchor="start" x="114" y="-342" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="155.25" y="-330.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.57,-208.07C48,-230.05 71.09,-283.83 106,-316.25 106.62,-316.82 107.25,-317.39 107.9,-317.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.59,-320.59 115.74,-323.63 109.7,-314.92 105.59,-320.59"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="182,-306.88 128.5,-306.88 128.5,-287.62 182,-287.62 182,-306.88"/>
-<text text-anchor="middle" x="155.25" y="-293.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.46,-208.31C55.33,-223.81 79.87,-253.77 106,-273.25 110.16,-276.35 114.79,-279.24 119.48,-281.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="117.87,-284.96 128.36,-286.44 121.08,-278.74 117.87,-284.96"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" target="_top" xlink:title="Recursive function to find the maximum value in the BST.">
-<polygon fill="white" stroke="#666666" points="339,-198.5 240.5,-198.5 240.5,-168 339,-168 339,-198.5"/>
-<text text-anchor="start" x="248.5" y="-185" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="289.75" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47.95,-208.22C61.17,-218.55 83.6,-234.05 106,-240.25 148.19,-251.94 162.64,-253.08 204.5,-240.25 226.52,-233.5 247.97,-218.84 263.71,-206.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.73,-208.95 271.13,-199.83 261.22,-203.59 265.73,-208.95"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153" target="_top" xlink:title="Recursive function to find the minimum value in the BST.">
-<polygon fill="white" stroke="#666666" points="204.5,-213.5 106,-213.5 106,-183 204.5,-183 204.5,-213.5"/>
-<text text-anchor="start" x="114" y="-200" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="155.25" y="-188.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.2,-198.25C77.8,-198.25 86.07,-198.25 94.36,-198.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.1,-201.75 104.1,-198.25 94.1,-194.75 94.1,-201.75"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="white" stroke="#666666" points="204.5,-146.5 106,-146.5 106,-116 204.5,-116 204.5,-146.5"/>
-<text text-anchor="start" x="114" y="-133" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="155.25" y="-121.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge8_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge8_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.7,-188.22C70.31,-178.81 95.69,-164.43 116.79,-152.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="118.46,-155.55 125.43,-147.58 115.01,-149.46 118.46,-155.55"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153" target="_top" xlink:title="Recursive function to remove a value from the BST.">
-<polygon fill="white" stroke="#666666" points="204.5,-79.5 106,-79.5 106,-49 204.5,-49 204.5,-79.5"/>
-<text text-anchor="start" x="114" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="155.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::remove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge10_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge10_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.79,-188.21C54.69,-170.9 80.48,-134.69 106,-107.25 112.34,-100.43 119.64,-93.52 126.61,-87.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.8,-90.02 134.03,-80.81 124.19,-84.75 128.8,-90.02"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3" target="_top" xlink:title="Get the number of values in the BST.">
-<polygon fill="white" stroke="#666666" points="204.5,-30.5 106,-30.5 106,0 204.5,0 204.5,-30.5"/>
-<text text-anchor="start" x="114" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="155.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge14_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge14_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.95,-188.46C43.75,-161.6 63.24,-85.7 106,-40.25 106.84,-39.36 107.72,-38.49 108.63,-37.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.58,-40.57 116.37,-31.69 106.31,-35.02 110.58,-40.57"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.94,-355.99C129.59,-365.06 136.7,-373.5 155.25,-373.5 165.4,-373.5 172.12,-370.97 175.42,-367.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.87,-367.79 176.4,-357.49 171.91,-367.09 178.87,-367.79"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M265.92,-198.99C261.05,-208.06 269,-216.5 289.75,-216.5 301.1,-216.5 308.62,-213.97 312.31,-210.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.76,-210.82 313.41,-200.49 308.8,-210.03 315.76,-210.82"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge7_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge7_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.94,-213.99C129.59,-223.06 136.7,-231.5 155.25,-231.5 165.4,-231.5 172.12,-228.97 175.42,-225.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.87,-225.79 176.4,-215.49 171.91,-225.09 178.87,-225.79"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge9_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge9_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.94,-146.99C129.59,-156.06 136.7,-164.5 155.25,-164.5 165.4,-164.5 172.12,-161.97 175.42,-158.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.87,-158.79 176.4,-148.49 171.91,-158.09 178.87,-158.79"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge11_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge11_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M173.69,-79.75C182.87,-87.92 194.31,-98.11 204.5,-107.25 224.36,-125.06 246.78,-145.29 263.49,-160.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.79,-162.66 270.55,-166.78 265.48,-157.47 260.79,-162.66"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge13_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge13_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.94,-79.99C129.59,-89.06 136.7,-97.5 155.25,-97.5 165.4,-97.5 172.12,-94.97 175.42,-91.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.87,-91.79 176.4,-81.49 171.91,-91.09 178.87,-91.79"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="319.5,-73.88 260,-73.88 260,-54.62 319.5,-54.62 319.5,-73.88"/>
-<text text-anchor="middle" x="289.75" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge12_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge12_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.84,-64.25C219.26,-64.25 234.89,-64.25 248.71,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.31,-67.75 258.31,-64.25 248.31,-60.75 248.31,-67.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d42/binary__search__tree2_8cpp_ab1333c3ea06dcad896ee204bbd407c4e_cgraph_org.svg b/df/d42/binary__search__tree2_8cpp_ab1333c3ea06dcad896ee204bbd407c4e_cgraph_org.svg
deleted file mode 100644
index aa7db07a7..000000000
--- a/df/d42/binary__search__tree2_8cpp_ab1333c3ea06dcad896ee204bbd407c4e_cgraph_org.svg
+++ /dev/null
@@ -1,225 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_remove Pages: 1 -->
-<svg width="347pt" height="382pt"
- viewBox="0.00 0.00 347.00 381.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 377.5)">
-<title>test_remove</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function for testing remove().">
-<polygon fill="#999999" stroke="#666666" points="70,-207.88 0,-207.88 0,-188.62 70,-188.62 70,-207.88"/>
-<text text-anchor="middle" x="35" y="-194.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_remove</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2" target="_top" xlink:title="Recursive function to check if a value is in the BST.">
-<polygon fill="white" stroke="#666666" points="204.5,-355.5 106,-355.5 106,-325 204.5,-325 204.5,-355.5"/>
-<text text-anchor="start" x="114" y="-342" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="155.25" y="-330.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.57,-208.07C48,-230.05 71.09,-283.83 106,-316.25 106.62,-316.82 107.25,-317.39 107.9,-317.94"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="105.59,-320.59 115.74,-323.63 109.7,-314.92 105.59,-320.59"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="182,-306.88 128.5,-306.88 128.5,-287.62 182,-287.62 182,-306.88"/>
-<text text-anchor="middle" x="155.25" y="-293.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M43.46,-208.31C55.33,-223.81 79.87,-253.77 106,-273.25 110.16,-276.35 114.79,-279.24 119.48,-281.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="117.87,-284.96 128.36,-286.44 121.08,-278.74 117.87,-284.96"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" target="_top" xlink:title="Recursive function to find the maximum value in the BST.">
-<polygon fill="white" stroke="#666666" points="339,-198.5 240.5,-198.5 240.5,-168 339,-168 339,-198.5"/>
-<text text-anchor="start" x="248.5" y="-185" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="289.75" y="-173.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M47.95,-208.22C61.17,-218.55 83.6,-234.05 106,-240.25 148.19,-251.94 162.64,-253.08 204.5,-240.25 226.52,-233.5 247.97,-218.84 263.71,-206.07"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="265.73,-208.95 271.13,-199.83 261.22,-203.59 265.73,-208.95"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153" target="_top" xlink:title="Recursive function to find the minimum value in the BST.">
-<polygon fill="white" stroke="#666666" points="204.5,-213.5 106,-213.5 106,-183 204.5,-183 204.5,-213.5"/>
-<text text-anchor="start" x="114" y="-200" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="155.25" y="-188.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge6_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge6_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M70.2,-198.25C77.8,-198.25 86.07,-198.25 94.36,-198.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.1,-201.75 104.1,-198.25 94.1,-194.75 94.1,-201.75"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="white" stroke="#666666" points="204.5,-146.5 106,-146.5 106,-116 204.5,-116 204.5,-146.5"/>
-<text text-anchor="start" x="114" y="-133" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="155.25" y="-121.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge8_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge8_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.7,-188.22C70.31,-178.81 95.69,-164.43 116.79,-152.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="118.46,-155.55 125.43,-147.58 115.01,-149.46 118.46,-155.55"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153" target="_top" xlink:title="Recursive function to remove a value from the BST.">
-<polygon fill="white" stroke="#666666" points="204.5,-79.5 106,-79.5 106,-49 204.5,-49 204.5,-79.5"/>
-<text text-anchor="start" x="114" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="155.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">::remove</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge10_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge10_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.79,-188.21C54.69,-170.9 80.48,-134.69 106,-107.25 112.34,-100.43 119.64,-93.52 126.61,-87.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="128.8,-90.02 134.03,-80.81 124.19,-84.75 128.8,-90.02"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3" target="_top" xlink:title="Get the number of values in the BST.">
-<polygon fill="white" stroke="#666666" points="204.5,-30.5 106,-30.5 106,0 204.5,0 204.5,-30.5"/>
-<text text-anchor="start" x="114" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="155.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node9 -->
-<g id="edge14_Node000001_Node000009" class="edge">
-<title>Node1&#45;&gt;Node9</title>
-<g id="a_edge14_Node000001_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.95,-188.46C43.75,-161.6 63.24,-85.7 106,-40.25 106.84,-39.36 107.72,-38.49 108.63,-37.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="110.58,-40.57 116.37,-31.69 106.31,-35.02 110.58,-40.57"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.94,-355.99C129.59,-365.06 136.7,-373.5 155.25,-373.5 165.4,-373.5 172.12,-370.97 175.42,-367.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.87,-367.79 176.4,-357.49 171.91,-367.09 178.87,-367.79"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M265.92,-198.99C261.05,-208.06 269,-216.5 289.75,-216.5 301.1,-216.5 308.62,-213.97 312.31,-210.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="315.76,-210.82 313.41,-200.49 308.8,-210.03 315.76,-210.82"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge7_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge7_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.94,-213.99C129.59,-223.06 136.7,-231.5 155.25,-231.5 165.4,-231.5 172.12,-228.97 175.42,-225.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.87,-225.79 176.4,-215.49 171.91,-225.09 178.87,-225.79"/>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node6 -->
-<g id="edge9_Node000006_Node000006" class="edge">
-<title>Node6&#45;&gt;Node6</title>
-<g id="a_edge9_Node000006_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.94,-146.99C129.59,-156.06 136.7,-164.5 155.25,-164.5 165.4,-164.5 172.12,-161.97 175.42,-158.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.87,-158.79 176.4,-148.49 171.91,-158.09 178.87,-158.79"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge11_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge11_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M173.69,-79.75C182.87,-87.92 194.31,-98.11 204.5,-107.25 224.36,-125.06 246.78,-145.29 263.49,-160.4"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.79,-162.66 270.55,-166.78 265.48,-157.47 260.79,-162.66"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node7 -->
-<g id="edge13_Node000007_Node000007" class="edge">
-<title>Node7&#45;&gt;Node7</title>
-<g id="a_edge13_Node000007_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M133.94,-79.99C129.59,-89.06 136.7,-97.5 155.25,-97.5 165.4,-97.5 172.12,-94.97 175.42,-91.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="178.87,-91.79 176.4,-81.49 171.91,-91.09 178.87,-91.79"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="319.5,-73.88 260,-73.88 260,-54.62 319.5,-54.62 319.5,-73.88"/>
-<text text-anchor="middle" x="289.75" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge12_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge12_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M204.84,-64.25C219.26,-64.25 234.89,-64.25 248.71,-64.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="248.31,-67.75 258.31,-64.25 248.31,-60.75 248.31,-67.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d42/binary__search__tree2_8cpp_af2847a901160fd45b4044550e9921cb4_cgraph.map b/df/d42/binary__search__tree2_8cpp_af2847a901160fd45b4044550e9921cb4_cgraph.map
deleted file mode 100644
index 755a38672..000000000
--- a/df/d42/binary__search__tree2_8cpp_af2847a901160fd45b4044550e9921cb4_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="test_find_min" name="test_find_min">
-<area shape="rect" id="Node000001" title="Function for testing find_min()." alt="" coords="5,87,105,112"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="183,5,254,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="76,84,151,41,167,34,169,39,154,46,79,88"/>
-<area shape="rect" id="Node000003" href="$d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153" title="Recursive function to find the minimum value in the BST." alt="" coords="153,79,284,120"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="105,97,137,97,137,102,105,102"/>
-<area shape="rect" id="Node000004" href="$d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" title="Recursive function to insert a value into the BST." alt="" coords="153,168,284,209"/>
-<area shape="poly" id="edge4_Node000001_Node000004" title=" " alt="" coords="82,111,168,158,165,163,79,115"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="187,79,185,69,190,60,202,55,218,53,236,55,247,61,244,66,235,60,218,58,203,60,194,64,191,70,192,78"/>
-<area shape="poly" id="edge5_Node000004_Node000004" title=" " alt="" coords="187,168,185,159,190,150,202,144,218,142,236,144,247,151,244,155,235,149,218,147,203,149,194,154,191,160,192,167"/>
-</map>
diff --git a/df/d42/binary__search__tree2_8cpp_af2847a901160fd45b4044550e9921cb4_cgraph.md5 b/df/d42/binary__search__tree2_8cpp_af2847a901160fd45b4044550e9921cb4_cgraph.md5
deleted file mode 100644
index 25b3300aa..000000000
--- a/df/d42/binary__search__tree2_8cpp_af2847a901160fd45b4044550e9921cb4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-29a175341cd92fbc38ed50dc139f13d7
\ No newline at end of file
diff --git a/df/d42/binary__search__tree2_8cpp_af2847a901160fd45b4044550e9921cb4_cgraph.svg b/df/d42/binary__search__tree2_8cpp_af2847a901160fd45b4044550e9921cb4_cgraph.svg
deleted file mode 100644
index f5ea50abe..000000000
--- a/df/d42/binary__search__tree2_8cpp_af2847a901160fd45b4044550e9921cb4_cgraph.svg
+++ /dev/null
@@ -1,121 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_find_min Pages: 1 -->
-<svg width="217pt" height="161pt"
- viewBox="0.00 0.00 217.00 160.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 156.88)">
-<title>test_find_min</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function for testing find_min().">
-<polygon fill="#999999" stroke="#666666" points="74.5,-91.88 0,-91.88 0,-72.62 74.5,-72.62 74.5,-91.88"/>
-<text text-anchor="middle" x="37.25" y="-78.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_find_min</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="186.5,-152.88 133,-152.88 133,-133.62 186.5,-133.62 186.5,-152.88"/>
-<text text-anchor="middle" x="159.75" y="-139.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.94,-92.3C68.33,-101.29 90.39,-114.51 110.5,-124.25 114.25,-126.06 118.21,-127.84 122.2,-129.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.66,-132.69 131.25,-133.23 123.31,-126.21 120.66,-132.69"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153" target="_top" xlink:title="Recursive function to find the minimum value in the BST.">
-<polygon fill="white" stroke="#666666" points="209,-97.5 110.5,-97.5 110.5,-67 209,-67 209,-97.5"/>
-<text text-anchor="start" x="118.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="159.75" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.73,-82.25C82.45,-82.25 90.78,-82.25 99.1,-82.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.86,-85.75 108.86,-82.25 98.86,-78.75 98.86,-85.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="white" stroke="#666666" points="209,-30.5 110.5,-30.5 110.5,0 209,0 209,-30.5"/>
-<text text-anchor="start" x="118.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="159.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M56.29,-72.22C73.29,-62.77 99.31,-48.3 120.87,-36.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.37,-39.48 129.41,-31.57 118.96,-33.37 122.37,-39.48"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.04,-97.99C133.61,-107.06 140.85,-115.5 159.75,-115.5 170.09,-115.5 176.93,-112.97 180.29,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.75,-109.8 181.3,-99.49 176.79,-109.08 183.75,-109.8"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.04,-30.99C133.61,-40.06 140.85,-48.5 159.75,-48.5 170.09,-48.5 176.93,-45.97 180.29,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.75,-42.8 181.3,-32.49 176.79,-42.08 183.75,-42.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d42/binary__search__tree2_8cpp_af2847a901160fd45b4044550e9921cb4_cgraph_org.svg b/df/d42/binary__search__tree2_8cpp_af2847a901160fd45b4044550e9921cb4_cgraph_org.svg
deleted file mode 100644
index 8650d33e3..000000000
--- a/df/d42/binary__search__tree2_8cpp_af2847a901160fd45b4044550e9921cb4_cgraph_org.svg
+++ /dev/null
@@ -1,95 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test_find_min Pages: 1 -->
-<svg width="217pt" height="161pt"
- viewBox="0.00 0.00 217.00 160.88" 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 156.88)">
-<title>test_find_min</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function for testing find_min().">
-<polygon fill="#999999" stroke="#666666" points="74.5,-91.88 0,-91.88 0,-72.62 74.5,-72.62 74.5,-91.88"/>
-<text text-anchor="middle" x="37.25" y="-78.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_find_min</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="186.5,-152.88 133,-152.88 133,-133.62 186.5,-133.62 186.5,-152.88"/>
-<text text-anchor="middle" x="159.75" y="-139.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.94,-92.3C68.33,-101.29 90.39,-114.51 110.5,-124.25 114.25,-126.06 118.21,-127.84 122.2,-129.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.66,-132.69 131.25,-133.23 123.31,-126.21 120.66,-132.69"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153" target="_top" xlink:title="Recursive function to find the minimum value in the BST.">
-<polygon fill="white" stroke="#666666" points="209,-97.5 110.5,-97.5 110.5,-67 209,-67 209,-97.5"/>
-<text text-anchor="start" x="118.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="159.75" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M74.73,-82.25C82.45,-82.25 90.78,-82.25 99.1,-82.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.86,-85.75 108.86,-82.25 98.86,-78.75 98.86,-85.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
-<polygon fill="white" stroke="#666666" points="209,-30.5 110.5,-30.5 110.5,0 209,0 209,-30.5"/>
-<text text-anchor="start" x="118.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
-<text text-anchor="middle" x="159.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge4_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge4_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M56.29,-72.22C73.29,-62.77 99.31,-48.3 120.87,-36.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.37,-39.48 129.41,-31.57 118.96,-33.37 122.37,-39.48"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.04,-97.99C133.61,-107.06 140.85,-115.5 159.75,-115.5 170.09,-115.5 176.93,-112.97 180.29,-109.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.75,-109.8 181.3,-99.49 176.79,-109.08 183.75,-109.8"/>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node4 -->
-<g id="edge5_Node000004_Node000004" class="edge">
-<title>Node4&#45;&gt;Node4</title>
-<g id="a_edge5_Node000004_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M138.04,-30.99C133.61,-40.06 140.85,-48.5 159.75,-48.5 170.09,-48.5 176.93,-45.97 180.29,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="183.75,-42.8 181.3,-32.49 176.79,-42.08 183.75,-42.8"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d42/binary__search__tree2_8cpp_source.html b/df/d42/binary__search__tree2_8cpp_source.html
new file mode 100644
index 000000000..f598801e7
--- /dev/null
+++ b/df/d42/binary__search__tree2_8cpp_source.html
@@ -0,0 +1,609 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/binary_search_tree2.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">binary_search_tree2.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../df/d42/binary__search__tree2_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;functional&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="preprocessor">#include &lt;memory&gt;</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> T&gt;</div>
+<div class="foldopen" id="foldopen00020" data-start="{" data-end="};">
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html">   20</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a> {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> <span class="keyword">private</span>:</div>
+<div class="foldopen" id="foldopen00025" data-start="{" data-end="};">
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"><a class="line" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">   25</a></span>    <span class="keyword">struct </span><a class="code hl_struct" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"><a class="line" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29">   26</a></span>        T <a class="code hl_variable" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29">value</a>; </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788">   27</a></span>        std::unique_ptr&lt;bst_node&gt; <a class="code hl_variable" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788">left</a>; </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"><a class="line" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df">   28</a></span>        std::unique_ptr&lt;bst_node&gt; <a class="code hl_variable" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df">right</a>; </div>
+<div class="foldopen" id="foldopen00035" data-start="{" data-end="}">
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778">   35</a></span>        <span class="keyword">explicit</span> <a class="code hl_function" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778">bst_node</a>(T _value) {</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>            <a class="code hl_variable" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29">value</a> = _value;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>            left = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>            <a class="code hl_variable" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df">right</a> = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        }</div>
+</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    };</div>
+</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">   42</a></span>    std::unique_ptr&lt;bst_node&gt; <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>; </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">   43</a></span>    std::size_t <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a> = 0; </div>
+<div class="foldopen" id="foldopen00053" data-start="{" data-end="}">
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">   53</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(std::unique_ptr&lt;bst_node&gt;&amp; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, T&amp; ret_value) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>            ret_value = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        }</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right, ret_value);</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    }</div>
+</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="foldopen" id="foldopen00071" data-start="{" data-end="}">
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">   71</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(std::unique_ptr&lt;bst_node&gt;&amp; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, T&amp; ret_value) {</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>        <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left) {</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            ret_value = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        }</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span> </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left, ret_value);</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    }</div>
+</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="foldopen" id="foldopen00090" data-start="{" data-end="}">
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">   90</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(std::unique_ptr&lt;bst_node&gt;&amp; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, T new_value) {</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> == <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> &amp;&amp; !<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>) {</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>            <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = std::unique_ptr&lt;bst_node&gt;(<span class="keyword">new</span> <a class="code hl_struct" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a>(new_value));</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>        }</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span> </div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>        <span class="keywordflow">if</span> (new_value &lt; node-&gt;value) {</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>            <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left) {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>                <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left = std::unique_ptr&lt;bst_node&gt;(<span class="keyword">new</span> <a class="code hl_struct" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a>(new_value));</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>                <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left, new_value);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>            }</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (new_value &gt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value) {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>            <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right) {</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>                <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right =</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>                    std::unique_ptr&lt;bst_node&gt;(<span class="keyword">new</span> <a class="code hl_struct" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a>(new_value));</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>                <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right, new_value);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>            }</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>        }</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    }</div>
+</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="foldopen" id="foldopen00125" data-start="{" data-end="}">
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">  125</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(std::unique_ptr&lt;bst_node&gt;&amp; parent,</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>                std::unique_ptr&lt;bst_node&gt;&amp; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, T rm_value) {</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>        <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>        }</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value == rm_value) {</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>            <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left &amp;&amp; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right) {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>                T successor_node_value{};</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>                <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left, successor_node_value);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>                <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, successor_node_value);</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>                <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value = successor_node_value;</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left || <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right) {</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>                std::unique_ptr&lt;bst_node&gt;&amp; non_null =</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>                    (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left ? <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left : <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right);</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>                <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> == <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>) {</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>                    <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = std::move(non_null);</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>                } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rm_value &lt; parent-&gt;value) {</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>                    parent-&gt;left = std::move(non_null);</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>                } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>                    parent-&gt;right = std::move(non_null);</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>                }</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span> </div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>            } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span>                <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> == <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>) {</div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>                    <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>.reset(<span class="keyword">nullptr</span>);</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>                } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rm_value &lt; parent-&gt;value) {</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>                    parent-&gt;left.reset(<span class="keyword">nullptr</span>);</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>                } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>                    parent-&gt;right.reset(<span class="keyword">nullptr</span>);</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span>                }</div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span> </div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>                <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span>            }</div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rm_value &lt; node-&gt;value) {</div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left, rm_value);</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right, rm_value);</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>        }</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    }</div>
+</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span> </div>
+<div class="foldopen" id="foldopen00177" data-start="{" data-end="}">
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">  177</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(std::unique_ptr&lt;bst_node&gt;&amp; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, T value) {</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>        <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>            <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>        }</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span> </div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>        <span class="keywordflow">if</span> (value &lt; node-&gt;value) {</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left, value);</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (value &gt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value) {</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>            <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right, value);</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>        }</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    }</div>
+</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span> </div>
+<div class="foldopen" id="foldopen00197" data-start="{" data-end="}">
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">  197</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>(std::function&lt;<span class="keywordtype">void</span>(T)&gt; callback,</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>                          std::unique_ptr&lt;bst_node&gt;&amp; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span>        }</div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span> </div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>        <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left);</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>        callback(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value);</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>        <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right);</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>    }</div>
+</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span> </div>
+<div class="foldopen" id="foldopen00214" data-start="{" data-end="}">
+<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">  214</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>(std::function&lt;<span class="keywordtype">void</span>(T)&gt; callback,</div>
+<div class="line"><a id="l00215" name="l00215"></a><span class="lineno">  215</span>                           std::unique_ptr&lt;bst_node&gt;&amp; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00216" name="l00216"></a><span class="lineno">  216</span>        <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00217" name="l00217"></a><span class="lineno">  217</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00218" name="l00218"></a><span class="lineno">  218</span>        }</div>
+<div class="line"><a id="l00219" name="l00219"></a><span class="lineno">  219</span> </div>
+<div class="line"><a id="l00220" name="l00220"></a><span class="lineno">  220</span>        callback(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value);</div>
+<div class="line"><a id="l00221" name="l00221"></a><span class="lineno">  221</span>        <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left);</div>
+<div class="line"><a id="l00222" name="l00222"></a><span class="lineno">  222</span>        <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right);</div>
+<div class="line"><a id="l00223" name="l00223"></a><span class="lineno">  223</span>    }</div>
+</div>
+<div class="line"><a id="l00224" name="l00224"></a><span class="lineno">  224</span> </div>
+<div class="foldopen" id="foldopen00231" data-start="{" data-end="}">
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">  231</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>(std::function&lt;<span class="keywordtype">void</span>(T)&gt; callback,</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>                            std::unique_ptr&lt;bst_node&gt;&amp; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>        <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span>            <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>        }</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span> </div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>        <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left);</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>        <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right);</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>        callback(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value);</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>    }</div>
+</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span> </div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00247" data-start="{" data-end="}">
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6">  247</a></span>    <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6">binary_search_tree</a>() {</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>        <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = <span class="keyword">nullptr</span>;</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>        <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a> = 0;</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    }</div>
+</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span> </div>
+<div class="foldopen" id="foldopen00259" data-start="{" data-end="}">
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0">  259</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0">insert</a>(T new_value) {</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>        <span class="keywordtype">bool</span> result = <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, new_value);</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>        <span class="keywordflow">if</span> (result) {</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>            <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a>++;</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span>        }</div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>        <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>    }</div>
+</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span> </div>
+<div class="foldopen" id="foldopen00274" data-start="{" data-end="}">
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb">  274</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb">remove</a>(T rm_value) {</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>        <span class="keywordtype">bool</span> result = <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, rm_value);</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>        <span class="keywordflow">if</span> (result) {</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>            <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a>--;</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>        }</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>        <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>    }</div>
+</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span> </div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63">  289</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63">contains</a>(T value) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63">contains</a>(<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, value); }</div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span> </div>
+<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03">  298</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03">find_min</a>(T&amp; ret_value) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03">find_min</a>(<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, ret_value); }</div>
+<div class="line"><a id="l00299" name="l00299"></a><span class="lineno">  299</span> </div>
+<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0">  307</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0">find_max</a>(T&amp; ret_value) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0">find_max</a>(<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, ret_value); }</div>
+<div class="line"><a id="l00308" name="l00308"></a><span class="lineno">  308</span> </div>
+<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">  314</a></span>    std::size_t <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">size</a>() { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a>; }</div>
+<div class="line"><a id="l00315" name="l00315"></a><span class="lineno">  315</span> </div>
+<div class="foldopen" id="foldopen00321" data-start="{" data-end="}">
+<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a">  321</a></span>    std::vector&lt;T&gt; <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a">get_elements_inorder</a>() {</div>
+<div class="line"><a id="l00322" name="l00322"></a><span class="lineno">  322</span>        std::vector&lt;T&gt; result;</div>
+<div class="line"><a id="l00323" name="l00323"></a><span class="lineno">  323</span>        <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>([&amp;](T node_value) { result.push_back(node_value); },</div>
+<div class="line"><a id="l00324" name="l00324"></a><span class="lineno">  324</span>                         <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
+<div class="line"><a id="l00325" name="l00325"></a><span class="lineno">  325</span>        <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00326" name="l00326"></a><span class="lineno">  326</span>    }</div>
+</div>
+<div class="line"><a id="l00327" name="l00327"></a><span class="lineno">  327</span> </div>
+<div class="foldopen" id="foldopen00333" data-start="{" data-end="}">
+<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13">  333</a></span>    std::vector&lt;T&gt; <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13">get_elements_preorder</a>() {</div>
+<div class="line"><a id="l00334" name="l00334"></a><span class="lineno">  334</span>        std::vector&lt;T&gt; result;</div>
+<div class="line"><a id="l00335" name="l00335"></a><span class="lineno">  335</span>        <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>([&amp;](T node_value) { result.push_back(node_value); },</div>
+<div class="line"><a id="l00336" name="l00336"></a><span class="lineno">  336</span>                          <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
+<div class="line"><a id="l00337" name="l00337"></a><span class="lineno">  337</span>        <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00338" name="l00338"></a><span class="lineno">  338</span>    }</div>
+</div>
+<div class="line"><a id="l00339" name="l00339"></a><span class="lineno">  339</span> </div>
+<div class="foldopen" id="foldopen00345" data-start="{" data-end="}">
+<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff">  345</a></span>    std::vector&lt;T&gt; <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff">get_elements_postorder</a>() {</div>
+<div class="line"><a id="l00346" name="l00346"></a><span class="lineno">  346</span>        std::vector&lt;T&gt; result;</div>
+<div class="line"><a id="l00347" name="l00347"></a><span class="lineno">  347</span>        <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>([&amp;](T node_value) { result.push_back(node_value); },</div>
+<div class="line"><a id="l00348" name="l00348"></a><span class="lineno">  348</span>                           <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
+<div class="line"><a id="l00349" name="l00349"></a><span class="lineno">  349</span>        <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00350" name="l00350"></a><span class="lineno">  350</span>    }</div>
+</div>
+<div class="line"><a id="l00351" name="l00351"></a><span class="lineno">  351</span>};</div>
+</div>
+<div class="line"><a id="l00352" name="l00352"></a><span class="lineno">  352</span> </div>
+<div class="foldopen" id="foldopen00358" data-start="{" data-end="}">
+<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"><a class="line" href="../../df/d42/binary__search__tree2_8cpp.html#a8c882f43e1e52948a7841a8bfb091350">  358</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#a8c882f43e1e52948a7841a8bfb091350">test_insert</a>() {</div>
+<div class="line"><a id="l00359" name="l00359"></a><span class="lineno">  359</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing BST insert...&quot;</span>;</div>
+<div class="line"><a id="l00360" name="l00360"></a><span class="lineno">  360</span> </div>
+<div class="line"><a id="l00361" name="l00361"></a><span class="lineno">  361</span>    <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt;int&gt;</a> tree;</div>
+<div class="line"><a id="l00362" name="l00362"></a><span class="lineno">  362</span>    <span class="keywordtype">bool</span> res = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
+<div class="line"><a id="l00363" name="l00363"></a><span class="lineno">  363</span>    <span class="keywordtype">int</span> min = -1, max = -1;</div>
+<div class="line"><a id="l00364" name="l00364"></a><span class="lineno">  364</span>    assert(res);</div>
+<div class="line"><a id="l00365" name="l00365"></a><span class="lineno">  365</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(max));</div>
+<div class="line"><a id="l00366" name="l00366"></a><span class="lineno">  366</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(min));</div>
+<div class="line"><a id="l00367" name="l00367"></a><span class="lineno">  367</span>    assert(max == 5);</div>
+<div class="line"><a id="l00368" name="l00368"></a><span class="lineno">  368</span>    assert(min == 5);</div>
+<div class="line"><a id="l00369" name="l00369"></a><span class="lineno">  369</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">size</a>() == 1);</div>
+<div class="line"><a id="l00370" name="l00370"></a><span class="lineno">  370</span> </div>
+<div class="line"><a id="l00371" name="l00371"></a><span class="lineno">  371</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(4);</div>
+<div class="line"><a id="l00372" name="l00372"></a><span class="lineno">  372</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(3);</div>
+<div class="line"><a id="l00373" name="l00373"></a><span class="lineno">  373</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
+<div class="line"><a id="l00374" name="l00374"></a><span class="lineno">  374</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(max));</div>
+<div class="line"><a id="l00375" name="l00375"></a><span class="lineno">  375</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(min));</div>
+<div class="line"><a id="l00376" name="l00376"></a><span class="lineno">  376</span>    assert(max == 6);</div>
+<div class="line"><a id="l00377" name="l00377"></a><span class="lineno">  377</span>    assert(min == 3);</div>
+<div class="line"><a id="l00378" name="l00378"></a><span class="lineno">  378</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">size</a>() == 4);</div>
+<div class="line"><a id="l00379" name="l00379"></a><span class="lineno">  379</span> </div>
+<div class="line"><a id="l00380" name="l00380"></a><span class="lineno">  380</span>    <span class="keywordtype">bool</span> fail_res = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(4);</div>
+<div class="line"><a id="l00381" name="l00381"></a><span class="lineno">  381</span>    assert(!fail_res);</div>
+<div class="line"><a id="l00382" name="l00382"></a><span class="lineno">  382</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">size</a>() == 4);</div>
+<div class="line"><a id="l00383" name="l00383"></a><span class="lineno">  383</span> </div>
+<div class="line"><a id="l00384" name="l00384"></a><span class="lineno">  384</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00385" name="l00385"></a><span class="lineno">  385</span>}</div>
+</div>
+<div class="line"><a id="l00386" name="l00386"></a><span class="lineno">  386</span> </div>
+<div class="foldopen" id="foldopen00392" data-start="{" data-end="}">
+<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"><a class="line" href="../../df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e">  392</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e">test_remove</a>() {</div>
+<div class="line"><a id="l00393" name="l00393"></a><span class="lineno">  393</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing BST remove...&quot;</span>;</div>
+<div class="line"><a id="l00394" name="l00394"></a><span class="lineno">  394</span> </div>
+<div class="line"><a id="l00395" name="l00395"></a><span class="lineno">  395</span>    <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt;int&gt;</a> tree;</div>
+<div class="line"><a id="l00396" name="l00396"></a><span class="lineno">  396</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
+<div class="line"><a id="l00397" name="l00397"></a><span class="lineno">  397</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(4);</div>
+<div class="line"><a id="l00398" name="l00398"></a><span class="lineno">  398</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(3);</div>
+<div class="line"><a id="l00399" name="l00399"></a><span class="lineno">  399</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
+<div class="line"><a id="l00400" name="l00400"></a><span class="lineno">  400</span> </div>
+<div class="line"><a id="l00401" name="l00401"></a><span class="lineno">  401</span>    <span class="keywordtype">bool</span> res = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(5);</div>
+<div class="line"><a id="l00402" name="l00402"></a><span class="lineno">  402</span>    <span class="keywordtype">int</span> min = -1, max = -1;</div>
+<div class="line"><a id="l00403" name="l00403"></a><span class="lineno">  403</span>    assert(res);</div>
+<div class="line"><a id="l00404" name="l00404"></a><span class="lineno">  404</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(max));</div>
+<div class="line"><a id="l00405" name="l00405"></a><span class="lineno">  405</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(min));</div>
+<div class="line"><a id="l00406" name="l00406"></a><span class="lineno">  406</span>    assert(max == 6);</div>
+<div class="line"><a id="l00407" name="l00407"></a><span class="lineno">  407</span>    assert(min == 3);</div>
+<div class="line"><a id="l00408" name="l00408"></a><span class="lineno">  408</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">size</a>() == 3);</div>
+<div class="line"><a id="l00409" name="l00409"></a><span class="lineno">  409</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(5) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00410" name="l00410"></a><span class="lineno">  410</span> </div>
+<div class="line"><a id="l00411" name="l00411"></a><span class="lineno">  411</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(4);</div>
+<div class="line"><a id="l00412" name="l00412"></a><span class="lineno">  412</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(3);</div>
+<div class="line"><a id="l00413" name="l00413"></a><span class="lineno">  413</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(6);</div>
+<div class="line"><a id="l00414" name="l00414"></a><span class="lineno">  414</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">size</a>() == 0);</div>
+<div class="line"><a id="l00415" name="l00415"></a><span class="lineno">  415</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(6) == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00416" name="l00416"></a><span class="lineno">  416</span> </div>
+<div class="line"><a id="l00417" name="l00417"></a><span class="lineno">  417</span>    <span class="keywordtype">bool</span> fail_res = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(5);</div>
+<div class="line"><a id="l00418" name="l00418"></a><span class="lineno">  418</span>    assert(!fail_res);</div>
+<div class="line"><a id="l00419" name="l00419"></a><span class="lineno">  419</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">size</a>() == 0);</div>
+<div class="line"><a id="l00420" name="l00420"></a><span class="lineno">  420</span> </div>
+<div class="line"><a id="l00421" name="l00421"></a><span class="lineno">  421</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00422" name="l00422"></a><span class="lineno">  422</span>}</div>
+</div>
+<div class="line"><a id="l00423" name="l00423"></a><span class="lineno">  423</span> </div>
+<div class="foldopen" id="foldopen00429" data-start="{" data-end="}">
+<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"><a class="line" href="../../df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3">  429</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3">test_contains</a>() {</div>
+<div class="line"><a id="l00430" name="l00430"></a><span class="lineno">  430</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing BST contains...&quot;</span>;</div>
+<div class="line"><a id="l00431" name="l00431"></a><span class="lineno">  431</span> </div>
+<div class="line"><a id="l00432" name="l00432"></a><span class="lineno">  432</span>    <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt;int&gt;</a> tree;</div>
+<div class="line"><a id="l00433" name="l00433"></a><span class="lineno">  433</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
+<div class="line"><a id="l00434" name="l00434"></a><span class="lineno">  434</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(4);</div>
+<div class="line"><a id="l00435" name="l00435"></a><span class="lineno">  435</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(3);</div>
+<div class="line"><a id="l00436" name="l00436"></a><span class="lineno">  436</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
+<div class="line"><a id="l00437" name="l00437"></a><span class="lineno">  437</span> </div>
+<div class="line"><a id="l00438" name="l00438"></a><span class="lineno">  438</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(5));</div>
+<div class="line"><a id="l00439" name="l00439"></a><span class="lineno">  439</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(4));</div>
+<div class="line"><a id="l00440" name="l00440"></a><span class="lineno">  440</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(3));</div>
+<div class="line"><a id="l00441" name="l00441"></a><span class="lineno">  441</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(6));</div>
+<div class="line"><a id="l00442" name="l00442"></a><span class="lineno">  442</span>    assert(!tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(999));</div>
+<div class="line"><a id="l00443" name="l00443"></a><span class="lineno">  443</span> </div>
+<div class="line"><a id="l00444" name="l00444"></a><span class="lineno">  444</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00445" name="l00445"></a><span class="lineno">  445</span>}</div>
+</div>
+<div class="line"><a id="l00446" name="l00446"></a><span class="lineno">  446</span> </div>
+<div class="foldopen" id="foldopen00452" data-start="{" data-end="}">
+<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"><a class="line" href="../../df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4">  452</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4">test_find_min</a>() {</div>
+<div class="line"><a id="l00453" name="l00453"></a><span class="lineno">  453</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing BST find_min...&quot;</span>;</div>
+<div class="line"><a id="l00454" name="l00454"></a><span class="lineno">  454</span> </div>
+<div class="line"><a id="l00455" name="l00455"></a><span class="lineno">  455</span>    <span class="keywordtype">int</span> min = 0;</div>
+<div class="line"><a id="l00456" name="l00456"></a><span class="lineno">  456</span>    <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt;int&gt;</a> tree;</div>
+<div class="line"><a id="l00457" name="l00457"></a><span class="lineno">  457</span>    assert(!tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(min));</div>
+<div class="line"><a id="l00458" name="l00458"></a><span class="lineno">  458</span> </div>
+<div class="line"><a id="l00459" name="l00459"></a><span class="lineno">  459</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
+<div class="line"><a id="l00460" name="l00460"></a><span class="lineno">  460</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(4);</div>
+<div class="line"><a id="l00461" name="l00461"></a><span class="lineno">  461</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(3);</div>
+<div class="line"><a id="l00462" name="l00462"></a><span class="lineno">  462</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
+<div class="line"><a id="l00463" name="l00463"></a><span class="lineno">  463</span> </div>
+<div class="line"><a id="l00464" name="l00464"></a><span class="lineno">  464</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(min));</div>
+<div class="line"><a id="l00465" name="l00465"></a><span class="lineno">  465</span>    assert(min == 3);</div>
+<div class="line"><a id="l00466" name="l00466"></a><span class="lineno">  466</span> </div>
+<div class="line"><a id="l00467" name="l00467"></a><span class="lineno">  467</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00468" name="l00468"></a><span class="lineno">  468</span>}</div>
+</div>
+<div class="line"><a id="l00469" name="l00469"></a><span class="lineno">  469</span> </div>
+<div class="foldopen" id="foldopen00475" data-start="{" data-end="}">
+<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"><a class="line" href="../../df/d42/binary__search__tree2_8cpp.html#a9856b68e2cba50d2e26a1cbe374e0365">  475</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#a9856b68e2cba50d2e26a1cbe374e0365">test_find_max</a>() {</div>
+<div class="line"><a id="l00476" name="l00476"></a><span class="lineno">  476</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing BST find_max...&quot;</span>;</div>
+<div class="line"><a id="l00477" name="l00477"></a><span class="lineno">  477</span> </div>
+<div class="line"><a id="l00478" name="l00478"></a><span class="lineno">  478</span>    <span class="keywordtype">int</span> max = 0;</div>
+<div class="line"><a id="l00479" name="l00479"></a><span class="lineno">  479</span>    <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt;int&gt;</a> tree;</div>
+<div class="line"><a id="l00480" name="l00480"></a><span class="lineno">  480</span>    assert(!tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(max));</div>
+<div class="line"><a id="l00481" name="l00481"></a><span class="lineno">  481</span> </div>
+<div class="line"><a id="l00482" name="l00482"></a><span class="lineno">  482</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
+<div class="line"><a id="l00483" name="l00483"></a><span class="lineno">  483</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(4);</div>
+<div class="line"><a id="l00484" name="l00484"></a><span class="lineno">  484</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(3);</div>
+<div class="line"><a id="l00485" name="l00485"></a><span class="lineno">  485</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
+<div class="line"><a id="l00486" name="l00486"></a><span class="lineno">  486</span> </div>
+<div class="line"><a id="l00487" name="l00487"></a><span class="lineno">  487</span>    assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(max));</div>
+<div class="line"><a id="l00488" name="l00488"></a><span class="lineno">  488</span>    assert(max == 6);</div>
+<div class="line"><a id="l00489" name="l00489"></a><span class="lineno">  489</span> </div>
+<div class="line"><a id="l00490" name="l00490"></a><span class="lineno">  490</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00491" name="l00491"></a><span class="lineno">  491</span>}</div>
+</div>
+<div class="line"><a id="l00492" name="l00492"></a><span class="lineno">  492</span> </div>
+<div class="foldopen" id="foldopen00498" data-start="{" data-end="}">
+<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"><a class="line" href="../../df/d42/binary__search__tree2_8cpp.html#a06f35064850e891d6fda0093c0d9ee6e">  498</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#a06f35064850e891d6fda0093c0d9ee6e">test_get_elements_inorder</a>() {</div>
+<div class="line"><a id="l00499" name="l00499"></a><span class="lineno">  499</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing BST get_elements_inorder...&quot;</span>;</div>
+<div class="line"><a id="l00500" name="l00500"></a><span class="lineno">  500</span> </div>
+<div class="line"><a id="l00501" name="l00501"></a><span class="lineno">  501</span>    <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt;int&gt;</a> tree;</div>
+<div class="line"><a id="l00502" name="l00502"></a><span class="lineno">  502</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
+<div class="line"><a id="l00503" name="l00503"></a><span class="lineno">  503</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(4);</div>
+<div class="line"><a id="l00504" name="l00504"></a><span class="lineno">  504</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(3);</div>
+<div class="line"><a id="l00505" name="l00505"></a><span class="lineno">  505</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
+<div class="line"><a id="l00506" name="l00506"></a><span class="lineno">  506</span> </div>
+<div class="line"><a id="l00507" name="l00507"></a><span class="lineno">  507</span>    std::vector&lt;int&gt; expected = {3, 4, 5, 6};</div>
+<div class="line"><a id="l00508" name="l00508"></a><span class="lineno">  508</span>    std::vector&lt;int&gt; actual = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a">get_elements_inorder</a>();</div>
+<div class="line"><a id="l00509" name="l00509"></a><span class="lineno">  509</span>    assert(actual == expected);</div>
+<div class="line"><a id="l00510" name="l00510"></a><span class="lineno">  510</span> </div>
+<div class="line"><a id="l00511" name="l00511"></a><span class="lineno">  511</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00512" name="l00512"></a><span class="lineno">  512</span>}</div>
+</div>
+<div class="line"><a id="l00513" name="l00513"></a><span class="lineno">  513</span> </div>
+<div class="foldopen" id="foldopen00519" data-start="{" data-end="}">
+<div class="line"><a id="l00519" name="l00519"></a><span class="lineno"><a class="line" href="../../df/d42/binary__search__tree2_8cpp.html#ab00b8d0f21aeb5fbddb6decf3bcb640a">  519</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#ab00b8d0f21aeb5fbddb6decf3bcb640a">test_get_elements_preorder</a>() {</div>
+<div class="line"><a id="l00520" name="l00520"></a><span class="lineno">  520</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing BST get_elements_preorder...&quot;</span>;</div>
+<div class="line"><a id="l00521" name="l00521"></a><span class="lineno">  521</span> </div>
+<div class="line"><a id="l00522" name="l00522"></a><span class="lineno">  522</span>    <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt;int&gt;</a> tree;</div>
+<div class="line"><a id="l00523" name="l00523"></a><span class="lineno">  523</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
+<div class="line"><a id="l00524" name="l00524"></a><span class="lineno">  524</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(4);</div>
+<div class="line"><a id="l00525" name="l00525"></a><span class="lineno">  525</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(3);</div>
+<div class="line"><a id="l00526" name="l00526"></a><span class="lineno">  526</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
+<div class="line"><a id="l00527" name="l00527"></a><span class="lineno">  527</span> </div>
+<div class="line"><a id="l00528" name="l00528"></a><span class="lineno">  528</span>    std::vector&lt;int&gt; expected = {5, 4, 3, 6};</div>
+<div class="line"><a id="l00529" name="l00529"></a><span class="lineno">  529</span>    std::vector&lt;int&gt; actual = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13">get_elements_preorder</a>();</div>
+<div class="line"><a id="l00530" name="l00530"></a><span class="lineno">  530</span>    assert(actual == expected);</div>
+<div class="line"><a id="l00531" name="l00531"></a><span class="lineno">  531</span> </div>
+<div class="line"><a id="l00532" name="l00532"></a><span class="lineno">  532</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00533" name="l00533"></a><span class="lineno">  533</span>}</div>
+</div>
+<div class="line"><a id="l00534" name="l00534"></a><span class="lineno">  534</span> </div>
+<div class="foldopen" id="foldopen00540" data-start="{" data-end="}">
+<div class="line"><a id="l00540" name="l00540"></a><span class="lineno"><a class="line" href="../../df/d42/binary__search__tree2_8cpp.html#a94b76f781fcbe1ad0e3397ace6bb1965">  540</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#a94b76f781fcbe1ad0e3397ace6bb1965">test_get_elements_postorder</a>() {</div>
+<div class="line"><a id="l00541" name="l00541"></a><span class="lineno">  541</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Testing BST get_elements_postorder...&quot;</span>;</div>
+<div class="line"><a id="l00542" name="l00542"></a><span class="lineno">  542</span> </div>
+<div class="line"><a id="l00543" name="l00543"></a><span class="lineno">  543</span>    <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt;int&gt;</a> tree;</div>
+<div class="line"><a id="l00544" name="l00544"></a><span class="lineno">  544</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
+<div class="line"><a id="l00545" name="l00545"></a><span class="lineno">  545</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(4);</div>
+<div class="line"><a id="l00546" name="l00546"></a><span class="lineno">  546</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(3);</div>
+<div class="line"><a id="l00547" name="l00547"></a><span class="lineno">  547</span>    tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
+<div class="line"><a id="l00548" name="l00548"></a><span class="lineno">  548</span> </div>
+<div class="line"><a id="l00549" name="l00549"></a><span class="lineno">  549</span>    std::vector&lt;int&gt; expected = {3, 4, 6, 5};</div>
+<div class="line"><a id="l00550" name="l00550"></a><span class="lineno">  550</span>    std::vector&lt;int&gt; actual = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff">get_elements_postorder</a>();</div>
+<div class="line"><a id="l00551" name="l00551"></a><span class="lineno">  551</span>    assert(actual == expected);</div>
+<div class="line"><a id="l00552" name="l00552"></a><span class="lineno">  552</span> </div>
+<div class="line"><a id="l00553" name="l00553"></a><span class="lineno">  553</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;ok&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00554" name="l00554"></a><span class="lineno">  554</span>}</div>
+</div>
+<div class="line"><a id="l00555" name="l00555"></a><span class="lineno">  555</span> </div>
+<div class="line"><a id="l00556" name="l00556"></a><span class="lineno">  556</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00557" name="l00557"></a><span class="lineno">  557</span>    <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#a8c882f43e1e52948a7841a8bfb091350">test_insert</a>();</div>
+<div class="line"><a id="l00558" name="l00558"></a><span class="lineno">  558</span>    <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e">test_remove</a>();</div>
+<div class="line"><a id="l00559" name="l00559"></a><span class="lineno">  559</span>    <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3">test_contains</a>();</div>
+<div class="line"><a id="l00560" name="l00560"></a><span class="lineno">  560</span>    <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#a9856b68e2cba50d2e26a1cbe374e0365">test_find_max</a>();</div>
+<div class="line"><a id="l00561" name="l00561"></a><span class="lineno">  561</span>    <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4">test_find_min</a>();</div>
+<div class="line"><a id="l00562" name="l00562"></a><span class="lineno">  562</span>    <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#a06f35064850e891d6fda0093c0d9ee6e">test_get_elements_inorder</a>();</div>
+<div class="line"><a id="l00563" name="l00563"></a><span class="lineno">  563</span>    <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#ab00b8d0f21aeb5fbddb6decf3bcb640a">test_get_elements_preorder</a>();</div>
+<div class="line"><a id="l00564" name="l00564"></a><span class="lineno">  564</span>    <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#a94b76f781fcbe1ad0e3397ace6bb1965">test_get_elements_postorder</a>();</div>
+<div class="line"><a id="l00565" name="l00565"></a><span class="lineno">  565</span>}</div>
+<div class="ttc" id="abinary__search__tree2_8cpp_html_a06f35064850e891d6fda0093c0d9ee6e"><div class="ttname"><a href="../../df/d42/binary__search__tree2_8cpp.html#a06f35064850e891d6fda0093c0d9ee6e">test_get_elements_inorder</a></div><div class="ttdeci">static void test_get_elements_inorder()</div><div class="ttdoc">Function for testing get_elements_inorder().</div><div class="ttdef"><b>Definition</b> <a href="#l00498">binary_search_tree2.cpp:498</a></div></div>
+<div class="ttc" id="abinary__search__tree2_8cpp_html_a1d42876440ac5346e2850a32497385c3"><div class="ttname"><a href="../../df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3">test_contains</a></div><div class="ttdeci">static void test_contains()</div><div class="ttdoc">Function for testing contains().</div><div class="ttdef"><b>Definition</b> <a href="#l00429">binary_search_tree2.cpp:429</a></div></div>
+<div class="ttc" id="abinary__search__tree2_8cpp_html_a8c882f43e1e52948a7841a8bfb091350"><div class="ttname"><a href="../../df/d42/binary__search__tree2_8cpp.html#a8c882f43e1e52948a7841a8bfb091350">test_insert</a></div><div class="ttdeci">static void test_insert()</div><div class="ttdoc">Function for testing insert().</div><div class="ttdef"><b>Definition</b> <a href="#l00358">binary_search_tree2.cpp:358</a></div></div>
+<div class="ttc" id="abinary__search__tree2_8cpp_html_a94b76f781fcbe1ad0e3397ace6bb1965"><div class="ttname"><a href="../../df/d42/binary__search__tree2_8cpp.html#a94b76f781fcbe1ad0e3397ace6bb1965">test_get_elements_postorder</a></div><div class="ttdeci">static void test_get_elements_postorder()</div><div class="ttdoc">Function for testing get_elements_postorder().</div><div class="ttdef"><b>Definition</b> <a href="#l00540">binary_search_tree2.cpp:540</a></div></div>
+<div class="ttc" id="abinary__search__tree2_8cpp_html_a9856b68e2cba50d2e26a1cbe374e0365"><div class="ttname"><a href="../../df/d42/binary__search__tree2_8cpp.html#a9856b68e2cba50d2e26a1cbe374e0365">test_find_max</a></div><div class="ttdeci">static void test_find_max()</div><div class="ttdoc">Function for testing find_max().</div><div class="ttdef"><b>Definition</b> <a href="#l00475">binary_search_tree2.cpp:475</a></div></div>
+<div class="ttc" id="abinary__search__tree2_8cpp_html_ab00b8d0f21aeb5fbddb6decf3bcb640a"><div class="ttname"><a href="../../df/d42/binary__search__tree2_8cpp.html#ab00b8d0f21aeb5fbddb6decf3bcb640a">test_get_elements_preorder</a></div><div class="ttdeci">static void test_get_elements_preorder()</div><div class="ttdoc">Function for testing get_elements_preorder().</div><div class="ttdef"><b>Definition</b> <a href="#l00519">binary_search_tree2.cpp:519</a></div></div>
+<div class="ttc" id="abinary__search__tree2_8cpp_html_ab1333c3ea06dcad896ee204bbd407c4e"><div class="ttname"><a href="../../df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e">test_remove</a></div><div class="ttdeci">static void test_remove()</div><div class="ttdoc">Function for testing remove().</div><div class="ttdef"><b>Definition</b> <a href="#l00392">binary_search_tree2.cpp:392</a></div></div>
+<div class="ttc" id="abinary__search__tree2_8cpp_html_af2847a901160fd45b4044550e9921cb4"><div class="ttname"><a href="../../df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4">test_find_min</a></div><div class="ttdeci">static void test_find_min()</div><div class="ttdoc">Function for testing find_min().</div><div class="ttdef"><b>Definition</b> <a href="#l00452">binary_search_tree2.cpp:452</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a></div><div class="ttdoc">The Binary Search Tree class.</div><div class="ttdef"><b>Definition</b> <a href="#l00020">binary_search_tree2.cpp:20</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_a07ba32ce1a2af6e357600ac8c8e98dbc"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">binary_search_tree::size_</a></div><div class="ttdeci">std::size_t size_</div><div class="ttdef"><b>Definition</b> <a href="#l00043">binary_search_tree2.cpp:43</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_a1f23830316204664514f396a4eb5275a"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a">binary_search_tree::get_elements_inorder</a></div><div class="ttdeci">std::vector&lt; T &gt; get_elements_inorder()</div><div class="ttdoc">Get all values of the BST in in-order order.</div><div class="ttdef"><b>Definition</b> <a href="#l00321">binary_search_tree2.cpp:321</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_a2fcf37549bd002c174a45b0b4203c2bd"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">binary_search_tree::traverse_inorder</a></div><div class="ttdeci">void traverse_inorder(std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; bst_node &gt; &amp;node)</div><div class="ttdoc">Recursive function to traverse the tree in in-order order.</div><div class="ttdef"><b>Definition</b> <a href="#l00197">binary_search_tree2.cpp:197</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_a42b16f26928b5e994925100594a167a0"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0">binary_search_tree::find_max</a></div><div class="ttdeci">bool find_max(T &amp;ret_value)</div><div class="ttdoc">Find the largest value in the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00307">binary_search_tree2.cpp:307</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_a564fe43e7e8f7ecb6f10667a70fbc6f3"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">binary_search_tree::size</a></div><div class="ttdeci">std::size_t size()</div><div class="ttdoc">Get the number of values in the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00314">binary_search_tree2.cpp:314</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_a5764c1cf848f84a5b77462036a6d8c13"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13">binary_search_tree::get_elements_preorder</a></div><div class="ttdeci">std::vector&lt; T &gt; get_elements_preorder()</div><div class="ttdoc">Get all values of the BST in pre-order order.</div><div class="ttdef"><b>Definition</b> <a href="#l00333">binary_search_tree2.cpp:333</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_a5c011e1b0863d79c3a7c11a0426bdcff"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff">binary_search_tree::get_elements_postorder</a></div><div class="ttdeci">std::vector&lt; T &gt; get_elements_postorder()</div><div class="ttdoc">Get all values of the BST in post-order order.</div><div class="ttdef"><b>Definition</b> <a href="#l00345">binary_search_tree2.cpp:345</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_a6bf5b410299df2320ddf2709dda61f63"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63">binary_search_tree::contains</a></div><div class="ttdeci">bool contains(T value)</div><div class="ttdoc">Check if a value is in the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00289">binary_search_tree2.cpp:289</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_a75f897af6aa732a9901454401c869bcb"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">binary_search_tree::find_max</a></div><div class="ttdeci">bool find_max(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)</div><div class="ttdoc">Recursive function to find the maximum value in the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00053">binary_search_tree2.cpp:53</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_a8168edf29316f2b436eac1fc416c52e0"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0">binary_search_tree::insert</a></div><div class="ttdeci">bool insert(T new_value)</div><div class="ttdoc">Insert a new value into the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00259">binary_search_tree2.cpp:259</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_a87c0a35845d27e0f6fc1f4eaa0333362"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">binary_search_tree::traverse_postorder</a></div><div class="ttdeci">void traverse_postorder(std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; bst_node &gt; &amp;node)</div><div class="ttdoc">Recursive function to traverse the tree in post-order order.</div><div class="ttdef"><b>Definition</b> <a href="#l00231">binary_search_tree2.cpp:231</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_a99771c2e1353e8ddfd4bb9d30b7a98fb"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb">binary_search_tree::remove</a></div><div class="ttdeci">bool remove(T rm_value)</div><div class="ttdoc">Remove a specified value from the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00274">binary_search_tree2.cpp:274</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_a9d1e7e10efa74d741bf48cf032df3778"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">binary_search_tree::insert</a></div><div class="ttdeci">bool insert(std::unique_ptr&lt; bst_node &gt; &amp;node, T new_value)</div><div class="ttdoc">Recursive function to insert a value into the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00090">binary_search_tree2.cpp:90</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_aa08f65f6f3bfcb14f8c3d1e65305ae50"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">binary_search_tree::root_</a></div><div class="ttdeci">std::unique_ptr&lt; bst_node &gt; root_</div><div class="ttdef"><b>Definition</b> <a href="#l00042">binary_search_tree2.cpp:42</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_aa4f84b2eec9b9201af1840868ddb5fb2"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">binary_search_tree::contains</a></div><div class="ttdeci">bool contains(std::unique_ptr&lt; bst_node &gt; &amp;node, T value)</div><div class="ttdoc">Recursive function to check if a value is in the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00177">binary_search_tree2.cpp:177</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_aa67321ed575ca313cd71d833d91234a6"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6">binary_search_tree::binary_search_tree</a></div><div class="ttdeci">binary_search_tree()</div><div class="ttdoc">Construct a new Binary Search Tree object.</div><div class="ttdef"><b>Definition</b> <a href="#l00247">binary_search_tree2.cpp:247</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_ab81edd415324d372632c42dc7dbcb9e1"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">binary_search_tree::traverse_preorder</a></div><div class="ttdeci">void traverse_preorder(std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; bst_node &gt; &amp;node)</div><div class="ttdoc">Recursive function to traverse the tree in pre-order order.</div><div class="ttdef"><b>Definition</b> <a href="#l00214">binary_search_tree2.cpp:214</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_ad9912e8574538e86f9bd2c38e7e63d03"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03">binary_search_tree::find_min</a></div><div class="ttdeci">bool find_min(T &amp;ret_value)</div><div class="ttdoc">Find the smallest value in the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00298">binary_search_tree2.cpp:298</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_af4a865ce5244608819b169fc78a41153"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">binary_search_tree::remove</a></div><div class="ttdeci">bool remove(std::unique_ptr&lt; bst_node &gt; &amp;parent, std::unique_ptr&lt; bst_node &gt; &amp;node, T rm_value)</div><div class="ttdoc">Recursive function to remove a value from the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00125">binary_search_tree2.cpp:125</a></div></div>
+<div class="ttc" id="aclassbinary__search__tree_html_af9a2c7c187a7ca3142c77ce342ef3153"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">binary_search_tree::find_min</a></div><div class="ttdeci">bool find_min(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)</div><div class="ttdoc">Recursive function to find the minimum value in the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00071">binary_search_tree2.cpp:71</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html"><div class="ttname"><a href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">binary_search_tree::bst_node</a></div><div class="ttdoc">A struct to represent a node in the Binary Search Tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00025">binary_search_tree2.cpp:25</a></div></div>
+<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a05f3a7aa6c31622f855ce4b5a95e91df"><div class="ttname"><a href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df">binary_search_tree::bst_node::right</a></div><div class="ttdeci">std::unique_ptr&lt; bst_node &gt; right</div><div class="ttdef"><b>Definition</b> <a href="#l00028">binary_search_tree2.cpp:28</a></div></div>
+<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a09da9e5b801ede4764bc812975ff7f29"><div class="ttname"><a href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29">binary_search_tree::bst_node::value</a></div><div class="ttdeci">T value</div><div class="ttdef"><b>Definition</b> <a href="#l00026">binary_search_tree2.cpp:26</a></div></div>
+<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a51dd9bd6dd32bce3b74dd64557306778"><div class="ttname"><a href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778">binary_search_tree::bst_node::bst_node</a></div><div class="ttdeci">bst_node(T _value)</div><div class="ttdef"><b>Definition</b> <a href="#l00035">binary_search_tree2.cpp:35</a></div></div>
+<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a55c165b9e0e5b50a23104e0604dcc788"><div class="ttname"><a href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788">binary_search_tree::bst_node::left</a></div><div class="ttdeci">std::unique_ptr&lt; bst_node &gt; left</div><div class="ttdef"><b>Definition</b> <a href="#l00027">binary_search_tree2.cpp:27</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../df/d42/binary__search__tree2_8cpp.html">binary_search_tree2.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/d44/namespacen__queens__all__solutions.html b/df/d44/namespacen__queens__all__solutions.html
index a318bf8b7..69f37df84 100644
--- a/df/d44/namespacen__queens__all__solutions.html
+++ b/df/d44/namespacen__queens__all__solutions.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: n_queens_all_solutions Namespace Reference</title>
+<title>TheAlgorithms/C++: n_queens_all_solutions Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/df/d47/fcfs__scheduling_8cpp.html b/df/d47/fcfs__scheduling_8cpp.html
index c178a51d0..76e55aa08 100644
--- a/df/d47/fcfs__scheduling_8cpp.html
+++ b/df/d47/fcfs__scheduling_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: cpu_scheduling_algorithms/fcfs_scheduling.cpp File Reference</title>
+<title>TheAlgorithms/C++: cpu_scheduling_algorithms/fcfs_scheduling.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -128,7 +145,9 @@ Include dependency graph for fcfs_scheduling.cpp:</div>
 <div class="dyncontent">
 <div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/d2f/fcfs__scheduling_8cpp__incl.svg" width="100%" height="394"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
 </div>
-</div><table class="memberdecls">
+</div>
+<p><a href="../../df/d47/fcfs__scheduling_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d4a/class_compare.html">Compare&lt; S, T, E &gt;</a></td></tr>
@@ -141,11 +160,11 @@ Classes</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a18920aa331faf4476b251c8cdb2c2bec" id="r_a18920aa331faf4476b251c8cdb2c2bec"><td class="memTemplParams" colspan="2">template&lt;typename S , typename T , typename E &gt; </td></tr>
-<tr class="memitem:a18920aa331faf4476b251c8cdb2c2bec"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a18920aa331faf4476b251c8cdb2c2bec">sortcol</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a>&lt; S, T, E &gt; &amp;t1, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a>&lt; S, T, E &gt; &amp;t2)</td></tr>
+<tr class="memitem:a18920aa331faf4476b251c8cdb2c2bec"><td class="memTemplItemLeft" align="right" valign="top">bool&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a18920aa331faf4476b251c8cdb2c2bec">sortcol</a> (tuple&lt; S, T, E &gt; &amp;t1, tuple&lt; S, T, E &gt; &amp;t2)</td></tr>
 <tr class="memdesc:a18920aa331faf4476b251c8cdb2c2bec"><td class="mdescLeft">&#160;</td><td class="mdescRight">Comparator function for sorting a vector.  <br /></td></tr>
 <tr class="separator:a18920aa331faf4476b251c8cdb2c2bec"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a8f2b90cb64d63a7080965e66a05ccf86" id="r_a8f2b90cb64d63a7080965e66a05ccf86"><td class="memTemplParams" colspan="2">template&lt;typename S , typename T , typename E &gt; </td></tr>
-<tr class="memitem:a8f2b90cb64d63a7080965e66a05ccf86"><td class="memTemplItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a>&lt; S, T, E, double, double, double &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a8f2b90cb64d63a7080965e66a05ccf86">get_final_status</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a>&lt; uint32_t, uint32_t, uint32_t &gt; &gt; input)</td></tr>
+<tr class="memitem:a8f2b90cb64d63a7080965e66a05ccf86"><td class="memTemplItemLeft" align="right" valign="top">vector&lt; tuple&lt; S, T, E, double, double, double &gt; &gt;&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#a8f2b90cb64d63a7080965e66a05ccf86">get_final_status</a> (vector&lt; tuple&lt; uint32_t, uint32_t, uint32_t &gt; &gt; input)</td></tr>
 <tr class="memdesc:a8f2b90cb64d63a7080965e66a05ccf86"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to be used for testing purposes. This function guarantees the correct solution for <a class="el" href="../../dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> scheduling algorithm.  <br /></td></tr>
 <tr class="separator:a8f2b90cb64d63a7080965e66a05ccf86"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -158,6 +177,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Implementation of <a class="el" href="../../dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> CPU scheduling algorithm. </p>
 <p><a class="el" href="../../dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> is a non-preemptive CPU scheduling algorithm in which whichever process arrives first, gets executed first. If two or more processes arrive simultaneously, the process with smaller process ID gets executed first. <a class="el" href="">https://bit.ly/3ABNXOC</a>Pratyush Vatsa </p>
+
+<p class="definition">Definition in file <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html">fcfs_scheduling.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a8f2b90cb64d63a7080965e66a05ccf86" name="a8f2b90cb64d63a7080965e66a05ccf86"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a8f2b90cb64d63a7080965e66a05ccf86">&#9670;&#160;</a></span>get_final_status()</h2>
@@ -168,9 +189,9 @@ Functions</h2></td></tr>
 template&lt;typename S , typename T , typename E &gt; </div>
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a>&lt; S, T, E, double, double, double &gt; &gt; get_final_status </td>
+          <td class="memname">vector&lt; tuple&lt; S, T, E, double, double, double &gt; &gt; get_final_status </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a>&lt; uint32_t, uint32_t, uint32_t &gt; &gt;</td>          <td class="paramname"><span class="paramname"><em>input</em></span></td><td>)</td>
+          <td class="paramtype">vector&lt; tuple&lt; uint32_t, uint32_t, uint32_t &gt; &gt;</td>          <td class="paramname"><span class="paramname"><em>input</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -184,11 +205,13 @@ template&lt;typename S , typename T , typename E &gt; </div>
   </dd>
 </dl>
 <p>Sorts the input vector according to arrival time. Processes whose arrival times are same get sorted according to process ID For each process, completion time, turnaround time and completion time are calculated, inserted in a tuple, which is added to the vector result. </p><dl class="section return"><dt>Returns</dt><dd>A vector of tuples consisting of process ID, arrival time, burst time, completion time, turnaround time and waiting time for each process. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00226">226</a> of file <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html">fcfs_scheduling.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  227</span>                                                       {</div>
-<div class="line"><span class="lineno">  228</span>    <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">sort</a>(input.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), input.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>(), <a class="code hl_function" href="#a18920aa331faf4476b251c8cdb2c2bec">sortcol&lt;S, T, E&gt;</a>);</div>
-<div class="line"><span class="lineno">  229</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;tuple&lt;S, T, E, double, double, double&gt;</a>&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(input.<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">  228</span>    sort(input.begin(), input.end(), <a class="code hl_function" href="#a18920aa331faf4476b251c8cdb2c2bec">sortcol&lt;S, T, E&gt;</a>);</div>
+<div class="line"><span class="lineno">  229</span>    vector&lt;tuple&lt;S, T, E, double, double, double&gt;&gt; <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>(input.size());</div>
 <div class="line"><span class="lineno">  230</span>    <span class="keywordtype">double</span> timeElapsed = 0;</div>
-<div class="line"><span class="lineno">  231</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i{}; i &lt; input.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>(); i++) {</div>
+<div class="line"><span class="lineno">  231</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i{}; i &lt; input.size(); i++) {</div>
 <div class="line"><span class="lineno">  232</span>        T arrival = get&lt;1&gt;(input[i]);</div>
 <div class="line"><span class="lineno">  233</span>        E burst = get&lt;2&gt;(input[i]);</div>
 <div class="line"><span class="lineno">  234</span> </div>
@@ -209,19 +232,9 @@ template&lt;typename S , typename T , typename E &gt; </div>
 <div class="line"><span class="lineno">  249</span>    }</div>
 <div class="line"><span class="lineno">  250</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">  251</span>}</div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="afcfs__scheduling_8cpp_html_a18920aa331faf4476b251c8cdb2c2bec"><div class="ttname"><a href="#a18920aa331faf4476b251c8cdb2c2bec">sortcol</a></div><div class="ttdeci">bool sortcol(tuple&lt; S, T, E &gt; &amp;t1, tuple&lt; S, T, E &gt; &amp;t2)</div><div class="ttdoc">Comparator function for sorting a vector.</div><div class="ttdef"><b>Definition</b> fcfs_scheduling.cpp:46</div></div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</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="asort_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort</a></div><div class="ttdeci">T sort(T... args)</div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph.svg" width="232" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afcfs__scheduling_8cpp_html_a18920aa331faf4476b251c8cdb2c2bec"><div class="ttname"><a href="#a18920aa331faf4476b251c8cdb2c2bec">sortcol</a></div><div class="ttdeci">bool sortcol(tuple&lt; S, T, E &gt; &amp;t1, tuple&lt; S, T, E &gt; &amp;t2)</div><div class="ttdoc">Comparator function for sorting a vector.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00046">fcfs_scheduling.cpp:46</a></div></div>
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -241,17 +254,14 @@ Here is the call graph for this function:</div>
 
 <p>Entry point of the program. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00288">288</a> of file <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html">fcfs_scheduling.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  288</span>           {</div>
 <div class="line"><span class="lineno">  289</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  290</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  291</span>}</div>
-<div class="ttc" id="afcfs__scheduling_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> fcfs_scheduling.cpp:257</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="567" height="247"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afcfs__scheduling_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00257">fcfs_scheduling.cpp:257</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a18920aa331faf4476b251c8cdb2c2bec" name="a18920aa331faf4476b251c8cdb2c2bec"></a>
@@ -265,12 +275,12 @@ template&lt;typename S , typename T , typename E &gt; </div>
         <tr>
           <td class="memname">bool sortcol </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a>&lt; S, T, E &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>t1</em></span>, </td>
+          <td class="paramtype">tuple&lt; S, T, E &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>t1</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/tuple.html">tuple</a>&lt; S, T, E &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>t2</em></span>&#160;)</td>
+          <td class="paramtype">tuple&lt; S, T, E &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>t2</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -294,6 +304,8 @@ template&lt;typename S , typename T , typename E &gt; </div>
 <dl class="section return"><dt>Returns</dt><dd>true if t1 and t2 are in the CORRECT order </dd>
 <dd>
 false if t1 and t2 are in the INCORRECT order </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00046">46</a> of file <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html">fcfs_scheduling.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   46</span>                                                     {</div>
 <div class="line"><span class="lineno">   47</span>    <span class="keywordflow">if</span> (get&lt;1&gt;(t1) &lt; get&lt;1&gt;(t2)) {</div>
 <div class="line"><span class="lineno">   48</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
@@ -330,18 +342,20 @@ false if t1 and t2 are in the INCORRECT order </dd></dl>
 
 <p>Self-test implementations. </p>
 <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00257">257</a> of file <a class="el" href="../../df/d47/fcfs__scheduling_8cpp_source.html">fcfs_scheduling.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  257</span>                   {</div>
 <div class="line"><span class="lineno">  258</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i{}; i &lt; 1000; i++) {</div>
-<div class="line"><span class="lineno">  259</span>        srand(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">time</a>(<span class="keyword">nullptr</span>));</div>
+<div class="line"><span class="lineno">  259</span>        srand(time(<span class="keyword">nullptr</span>));</div>
 <div class="line"><span class="lineno">  260</span>        uint32_t n = 1 + rand() % 1000;</div>
 <div class="line"><span class="lineno">  261</span>        <a class="code hl_class" href="../../dd/dca/class_f_c_f_s.html">FCFS&lt;uint32_t, uint32_t, uint32_t&gt;</a> readyQueue;</div>
-<div class="line"><span class="lineno">  262</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;tuple&lt;uint32_t, uint32_t, uint32_t&gt;</a>&gt; input(n);</div>
+<div class="line"><span class="lineno">  262</span>        vector&lt;tuple&lt;uint32_t, uint32_t, uint32_t&gt;&gt; input(n);</div>
 <div class="line"><span class="lineno">  263</span> </div>
 <div class="line"><span class="lineno">  264</span>        <span class="keywordflow">for</span> (uint32_t i{}; i &lt; n; i++) {</div>
 <div class="line"><span class="lineno">  265</span>            get&lt;0&gt;(input[i]) = i;</div>
-<div class="line"><span class="lineno">  266</span>            srand(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">time</a>(<span class="keyword">nullptr</span>));</div>
+<div class="line"><span class="lineno">  266</span>            srand(time(<span class="keyword">nullptr</span>));</div>
 <div class="line"><span class="lineno">  267</span>            get&lt;1&gt;(input[i]) = 1 + rand() % 10000;</div>
-<div class="line"><span class="lineno">  268</span>            srand(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">time</a>(<span class="keyword">nullptr</span>));</div>
+<div class="line"><span class="lineno">  268</span>            srand(time(<span class="keyword">nullptr</span>));</div>
 <div class="line"><span class="lineno">  269</span>            get&lt;2&gt;(input[i]) = 1 + rand() % 10000;</div>
 <div class="line"><span class="lineno">  270</span>        }</div>
 <div class="line"><span class="lineno">  271</span> </div>
@@ -349,26 +363,19 @@ false if t1 and t2 are in the INCORRECT order </dd></dl>
 <div class="line"><span class="lineno">  273</span>            readyQueue.<a class="code hl_function" href="../../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69">addProcess</a>(get&lt;0&gt;(input[i]), get&lt;1&gt;(input[i]),</div>
 <div class="line"><span class="lineno">  274</span>                                  get&lt;2&gt;(input[i]));</div>
 <div class="line"><span class="lineno">  275</span>        }</div>
-<div class="line"><span class="lineno">  276</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">vector&lt;tuple&lt;uint32_t, uint32_t, uint32_t, double, double, double&gt;</a>&gt;</div>
+<div class="line"><span class="lineno">  276</span>        vector&lt;tuple&lt;uint32_t, uint32_t, uint32_t, double, double, double&gt;&gt;</div>
 <div class="line"><span class="lineno">  277</span>            res = <a class="code hl_function" href="#a8f2b90cb64d63a7080965e66a05ccf86">get_final_status&lt;uint32_t, uint32_t, uint32_t&gt;</a>(input);</div>
 <div class="line"><span class="lineno">  278</span>        assert(res == readyQueue.<a class="code hl_function" href="../../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91">scheduleForFcfs</a>());</div>
 <div class="line"><span class="lineno">  279</span>        <span class="comment">// readyQueue.printResult();</span></div>
 <div class="line"><span class="lineno">  280</span>    }</div>
-<div class="line"><span class="lineno">  281</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">cout</a> &lt;&lt; <span class="stringliteral">&quot;All the tests have successfully passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><span class="lineno">  281</span>    cout &lt;&lt; <span class="stringliteral">&quot;All the tests have successfully passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
 <div class="line"><span class="lineno">  282</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="aclass_f_c_f_s_html"><div class="ttname"><a href="../../dd/dca/class_f_c_f_s.html">FCFS</a></div><div class="ttdoc">Class which implements the FCFS scheduling algorithm.</div><div class="ttdef"><b>Definition</b> fcfs_scheduling.cpp:98</div></div>
-<div class="ttc" id="aclass_f_c_f_s_html_a8fbfe4d85f7576b4a7aade07d29fbd69"><div class="ttname"><a href="../../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69">FCFS::addProcess</a></div><div class="ttdeci">void addProcess(S id, T arrival, E burst)</div><div class="ttdoc">Adds the process to the ready queue if it isn't already there.</div><div class="ttdef"><b>Definition</b> fcfs_scheduling.cpp:130</div></div>
-<div class="ttc" id="aclass_f_c_f_s_html_aa25dbe30ba9930b5a7c1a6d11758bd91"><div class="ttname"><a href="../../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91">FCFS::scheduleForFcfs</a></div><div class="ttdeci">vector&lt; tuple&lt; S, T, E, double, double, double &gt; &gt; scheduleForFcfs()</div><div class="ttdoc">Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algor...</div><div class="ttdef"><b>Definition</b> fcfs_scheduling.cpp:155</div></div>
-<div class="ttc" id="afcfs__scheduling_8cpp_html_a8f2b90cb64d63a7080965e66a05ccf86"><div class="ttname"><a href="#a8f2b90cb64d63a7080965e66a05ccf86">get_final_status</a></div><div class="ttdeci">vector&lt; tuple&lt; S, T, E, double, double, double &gt; &gt; get_final_status(vector&lt; tuple&lt; uint32_t, uint32_t, uint32_t &gt; &gt; input)</div><div class="ttdoc">Function to be used for testing purposes. This function guarantees the correct solution for FCFS sche...</div><div class="ttdef"><b>Definition</b> fcfs_scheduling.cpp:226</div></div>
-<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> matrix_exponentiation.cpp:36</div></div>
-<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="470" height="247"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclass_f_c_f_s_html"><div class="ttname"><a href="../../dd/dca/class_f_c_f_s.html">FCFS</a></div><div class="ttdoc">Class which implements the FCFS scheduling algorithm.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00098">fcfs_scheduling.cpp:98</a></div></div>
+<div class="ttc" id="aclass_f_c_f_s_html_a8fbfe4d85f7576b4a7aade07d29fbd69"><div class="ttname"><a href="../../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69">FCFS::addProcess</a></div><div class="ttdeci">void addProcess(S id, T arrival, E burst)</div><div class="ttdoc">Adds the process to the ready queue if it isn't already there.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00130">fcfs_scheduling.cpp:130</a></div></div>
+<div class="ttc" id="aclass_f_c_f_s_html_aa25dbe30ba9930b5a7c1a6d11758bd91"><div class="ttname"><a href="../../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91">FCFS::scheduleForFcfs</a></div><div class="ttdeci">vector&lt; tuple&lt; S, T, E, double, double, double &gt; &gt; scheduleForFcfs()</div><div class="ttdoc">Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algor...</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00155">fcfs_scheduling.cpp:155</a></div></div>
+<div class="ttc" id="afcfs__scheduling_8cpp_html_a8f2b90cb64d63a7080965e66a05ccf86"><div class="ttname"><a href="#a8f2b90cb64d63a7080965e66a05ccf86">get_final_status</a></div><div class="ttdeci">vector&lt; tuple&lt; S, T, E, double, double, double &gt; &gt; get_final_status(vector&lt; tuple&lt; uint32_t, uint32_t, uint32_t &gt; &gt; input)</div><div class="ttdoc">Function to be used for testing purposes. This function guarantees the correct solution for FCFS sche...</div><div class="ttdef"><b>Definition</b> <a href="../../df/d47/fcfs__scheduling_8cpp_source.html#l00226">fcfs_scheduling.cpp:226</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph.map b/df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph.map
deleted file mode 100644
index 1dfb3caf2..000000000
--- a/df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="get_final_status" name="get_final_status">
-<area shape="rect" id="Node000001" title="Function to be used for testing purposes. This function guarantees the correct solution for FCFS sche..." alt="" coords="5,5,119,31"/>
-<area shape="rect" id="Node000002" href="$df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec" title="Comparator function for sorting a vector." alt="" coords="167,5,227,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="119,16,151,16,151,21,119,21"/>
-</map>
diff --git a/df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph.md5 b/df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph.md5
deleted file mode 100644
index 9dd4e5e03..000000000
--- a/df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-07278229db85ad944de7b00a4fa4ed42
\ No newline at end of file
diff --git a/df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph.svg b/df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph.svg
deleted file mode 100644
index 135d3bfdf..000000000
--- a/df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: get_final_status Pages: 1 -->
-<svg width="174pt" height="27pt"
- viewBox="0.00 0.00 174.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>get_final_status</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to be used for testing purposes. This function guarantees the correct solution for FCFS sche...">
-<polygon fill="#999999" stroke="#666666" points="85,-19.25 0,-19.25 0,0 85,0 85,-19.25"/>
-<text text-anchor="middle" x="42.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_final_status</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec" target="_top" xlink:title="Comparator function for sorting a vector.">
-<polygon fill="white" stroke="#666666" points="166.25,-19.25 121,-19.25 121,0 166.25,0 166.25,-19.25"/>
-<text text-anchor="middle" x="143.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sortcol</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.25,-9.62C93.24,-9.62 101.5,-9.62 109.18,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="109.14,-13.13 119.14,-9.63 109.14,-6.13 109.14,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph_org.svg b/df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph_org.svg
deleted file mode 100644
index 275d01cac..000000000
--- a/df/d47/fcfs__scheduling_8cpp_a8f2b90cb64d63a7080965e66a05ccf86_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: get_final_status Pages: 1 -->
-<svg width="174pt" height="27pt"
- viewBox="0.00 0.00 174.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>get_final_status</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to be used for testing purposes. This function guarantees the correct solution for FCFS sche...">
-<polygon fill="#999999" stroke="#666666" points="85,-19.25 0,-19.25 0,0 85,0 85,-19.25"/>
-<text text-anchor="middle" x="42.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_final_status</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec" target="_top" xlink:title="Comparator function for sorting a vector.">
-<polygon fill="white" stroke="#666666" points="166.25,-19.25 121,-19.25 121,0 166.25,0 166.25,-19.25"/>
-<text text-anchor="middle" x="143.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">sortcol</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M85.25,-9.62C93.24,-9.62 101.5,-9.62 109.18,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="109.14,-13.13 119.14,-9.63 109.14,-6.13 109.14,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index af0bb23f9..000000000
--- a/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,167,49,192"/>
-<area shape="rect" id="Node000002" href="$dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69" title="Adds the process to the ready queue if it isn&#39;t already there." alt="" coords="111,81,244,107"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="48,165,138,113,141,117,50,170"/>
-<area shape="rect" id="Node000006" href="$df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86" title="Function to be used for testing purposes. This function guarantees the correct solution for FCFS sche..." alt="" coords="121,167,234,192"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="49,177,105,177,105,182,49,182"/>
-<area shape="rect" id="Node000008" href="$dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91" title="Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algor..." alt="" coords="97,216,258,242"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="50,185,98,202,116,208,114,213,96,207,48,190"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/end.html#" title=" " alt="" coords="306,5,464,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="210,78,305,41,326,34,328,39,307,46,212,83"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/find.html#" title=" " alt="" coords="320,55,450,96"/>
-<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="244,86,305,80,305,85,244,91"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/insert.html#" title=" " alt="" coords="320,120,450,161"/>
-<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="239,105,306,120,305,126,237,110"/>
-<area shape="rect" id="Node000007" href="$df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec" title="Comparator function for sorting a vector." alt="" coords="355,185,415,211"/>
-<area shape="poly" id="edge6_Node000006_Node000007" title=" " alt="" coords="234,182,340,191,339,197,234,187"/>
-</map>
diff --git a/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 074c3375d..000000000
--- a/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-f5516df712d2062d62bc91fd5718e722
\ No newline at end of file
diff --git a/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index c7a4e150e..000000000
--- a/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,175 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="352pt" height="185pt"
- viewBox="0.00 0.00 352.25 185.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 181.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-56.25 0,-56.25 0,-37 32.5,-37 32.5,-56.25"/>
-<text text-anchor="middle" x="16.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69" target="_top" xlink:title="Adds the process to the ready queue if it isn&#39;t already there.">
-<polygon fill="white" stroke="#666666" points="179,-120.25 79,-120.25 79,-101 179,-101 179,-120.25"/>
-<text text-anchor="middle" x="129" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::addProcess</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.65,-55.52C50.22,-65.68 79.29,-82.48 100.72,-94.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.82,-97.81 109.23,-99.78 102.33,-91.75 98.82,-97.81"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86" target="_top" xlink:title="Function to be used for testing purposes. This function guarantees the correct solution for FCFS sche...">
-<polygon fill="white" stroke="#666666" points="171.5,-56.25 86.5,-56.25 86.5,-37 171.5,-37 171.5,-56.25"/>
-<text text-anchor="middle" x="129" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_final_status</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.65,-46.62C43.75,-46.62 59.43,-46.62 74.87,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.5,-50.13 84.5,-46.63 74.5,-43.13 74.5,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91" target="_top" xlink:title="Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algor...">
-<polygon fill="white" stroke="#666666" points="189.5,-19.25 68.5,-19.25 68.5,0 189.5,0 189.5,-19.25"/>
-<text text-anchor="middle" x="129" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::scheduleForFcfs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-40.55C42.97,-36.69 56.45,-31.68 68.5,-27.62 72.99,-26.12 77.69,-24.6 82.39,-23.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.31,-26.49 91.83,-20.19 81.24,-19.8 83.31,-26.49"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="344.25,-177.25 225.5,-177.25 225.5,-158 344.25,-158 344.25,-177.25"/>
-<text text-anchor="middle" x="284.88" y="-163.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.17,-120.74C173.38,-128.66 201,-139.77 225.5,-148.62 230.5,-150.43 235.77,-152.25 241.01,-154.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.6,-157.24 250.2,-157.06 241.8,-150.6 239.6,-157.24"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="333.38,-139.88 236.38,-139.88 236.38,-109.38 333.38,-109.38 333.38,-139.88"/>
-<text text-anchor="start" x="244.38" y="-126.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="284.88" y="-115.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M179.11,-115.09C193.62,-116.41 209.65,-117.87 224.72,-119.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.24,-122.71 234.51,-120.13 224.87,-115.74 224.24,-122.71"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="333.38,-90.88 236.38,-90.88 236.38,-60.38 333.38,-60.38 333.38,-90.88"/>
-<text text-anchor="start" x="244.38" y="-77.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="284.88" y="-66.12" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.51,-100.5C190.31,-96.91 208.34,-92.81 225.14,-88.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.52,-92.49 234.5,-86.86 223.97,-85.66 225.52,-92.49"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec" target="_top" xlink:title="Comparator function for sorting a vector.">
-<polygon fill="white" stroke="#666666" points="307.5,-42.25 262.25,-42.25 262.25,-23 307.5,-23 307.5,-42.25"/>
-<text text-anchor="middle" x="284.88" y="-28.75" font-family="Helvetica,sans-Serif" font-size="10.00">sortcol</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M171.64,-42.84C196.5,-40.57 227.64,-37.74 250.81,-35.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="250.97,-39.13 260.61,-34.74 250.34,-32.16 250.97,-39.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 5ce500751..000000000
--- a/df/d47/fcfs__scheduling_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,149 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="352pt" height="185pt"
- viewBox="0.00 0.00 352.25 185.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 181.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-56.25 0,-56.25 0,-37 32.5,-37 32.5,-56.25"/>
-<text text-anchor="middle" x="16.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69" target="_top" xlink:title="Adds the process to the ready queue if it isn&#39;t already there.">
-<polygon fill="white" stroke="#666666" points="179,-120.25 79,-120.25 79,-101 179,-101 179,-120.25"/>
-<text text-anchor="middle" x="129" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::addProcess</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.65,-55.52C50.22,-65.68 79.29,-82.48 100.72,-94.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.82,-97.81 109.23,-99.78 102.33,-91.75 98.82,-97.81"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a xlink:href="../../df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86" target="_top" xlink:title="Function to be used for testing purposes. This function guarantees the correct solution for FCFS sche...">
-<polygon fill="white" stroke="#666666" points="171.5,-56.25 86.5,-56.25 86.5,-37 171.5,-37 171.5,-56.25"/>
-<text text-anchor="middle" x="129" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_final_status</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.65,-46.62C43.75,-46.62 59.43,-46.62 74.87,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="74.5,-50.13 84.5,-46.63 74.5,-43.13 74.5,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91" target="_top" xlink:title="Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algor...">
-<polygon fill="white" stroke="#666666" points="189.5,-19.25 68.5,-19.25 68.5,0 189.5,0 189.5,-19.25"/>
-<text text-anchor="middle" x="129" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::scheduleForFcfs</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.86,-40.55C42.97,-36.69 56.45,-31.68 68.5,-27.62 72.99,-26.12 77.69,-24.6 82.39,-23.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="83.31,-26.49 91.83,-20.19 81.24,-19.8 83.31,-26.49"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="344.25,-177.25 225.5,-177.25 225.5,-158 344.25,-158 344.25,-177.25"/>
-<text text-anchor="middle" x="284.88" y="-163.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set::end</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M154.17,-120.74C173.38,-128.66 201,-139.77 225.5,-148.62 230.5,-150.43 235.77,-152.25 241.01,-154.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="239.6,-157.24 250.2,-157.06 241.8,-150.6 239.6,-157.24"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="333.38,-139.88 236.38,-139.88 236.38,-109.38 333.38,-109.38 333.38,-139.88"/>
-<text text-anchor="start" x="244.38" y="-126.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="284.88" y="-115.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node4 -->
-<g id="edge3_Node000002_Node000004" class="edge">
-<title>Node2&#45;&gt;Node4</title>
-<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M179.11,-115.09C193.62,-116.41 209.65,-117.87 224.72,-119.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.24,-122.71 234.51,-120.13 224.87,-115.74 224.24,-122.71"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="333.38,-90.88 236.38,-90.88 236.38,-60.38 333.38,-60.38 333.38,-90.88"/>
-<text text-anchor="start" x="244.38" y="-77.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="284.88" y="-66.12" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node5 -->
-<g id="edge4_Node000002_Node000005" class="edge">
-<title>Node2&#45;&gt;Node5</title>
-<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M174.51,-100.5C190.31,-96.91 208.34,-92.81 225.14,-88.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="225.52,-92.49 234.5,-86.86 223.97,-85.66 225.52,-92.49"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec" target="_top" xlink:title="Comparator function for sorting a vector.">
-<polygon fill="white" stroke="#666666" points="307.5,-42.25 262.25,-42.25 262.25,-23 307.5,-23 307.5,-42.25"/>
-<text text-anchor="middle" x="284.88" y="-28.75" font-family="Helvetica,sans-Serif" font-size="10.00">sortcol</text>
-</a>
-</g>
-</g>
-<!-- Node6&#45;&gt;Node7 -->
-<g id="edge6_Node000006_Node000007" class="edge">
-<title>Node6&#45;&gt;Node7</title>
-<g id="a_edge6_Node000006_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M171.64,-42.84C196.5,-40.57 227.64,-37.74 250.81,-35.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="250.97,-39.13 260.61,-34.74 250.34,-32.16 250.97,-39.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 019245566..000000000
--- a/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Entry point of the program." alt="" coords="5,167,55,192"/>
-<area shape="rect" id="Node000002" href="$df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,167,146,192"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,177,87,177,87,182,55,182"/>
-<area shape="rect" id="Node000003" href="$dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69" title="Adds the process to the ready queue if it isn&#39;t already there." alt="" coords="208,81,341,107"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="145,165,236,113,238,117,148,170"/>
-<area shape="rect" id="Node000007" href="$df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86" title="Function to be used for testing purposes. This function guarantees the correct solution for FCFS sche..." alt="" coords="218,167,331,192"/>
-<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="146,177,202,177,202,182,146,182"/>
-<area shape="rect" id="Node000009" href="$dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91" title="Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algor..." alt="" coords="194,216,355,242"/>
-<area shape="poly" id="edge8_Node000002_Node000009" title=" " alt="" coords="147,185,195,202,213,208,212,213,193,207,146,190"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/end.html#" title=" " alt="" coords="403,5,562,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="307,78,402,41,423,34,425,39,404,46,309,83"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/find.html#" title=" " alt="" coords="418,55,547,96"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="341,86,402,80,403,85,342,91"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set/insert.html#" title=" " alt="" coords="418,120,547,161"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="336,105,403,120,402,126,335,110"/>
-<area shape="rect" id="Node000008" href="$df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec" title="Comparator function for sorting a vector." alt="" coords="452,185,513,211"/>
-<area shape="poly" id="edge7_Node000007_Node000008" title=" " alt="" coords="332,182,437,191,437,197,331,187"/>
-</map>
diff --git a/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 8b8f32198..000000000
--- a/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-06a59461d7d4976cb5e2234e5948888a
\ No newline at end of file
diff --git a/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 4b98ea0ba..000000000
--- a/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,193 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="425pt" height="185pt"
- viewBox="0.00 0.00 425.25 185.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 181.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Entry point of the program.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-56.25 73,-56.25 73,-37 105.5,-37 105.5,-56.25"/>
-<text text-anchor="middle" x="89.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-46.62C44.58,-46.62 53.31,-46.62 61.45,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-50.13 71.2,-46.63 61.2,-43.13 61.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69" target="_top" xlink:title="Adds the process to the ready queue if it isn&#39;t already there.">
-<polygon fill="white" stroke="#666666" points="252,-120.25 152,-120.25 152,-101 252,-101 252,-120.25"/>
-<text text-anchor="middle" x="202" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::addProcess</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.65,-55.52C123.22,-65.68 152.29,-82.48 173.72,-94.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.82,-97.81 182.23,-99.78 175.33,-91.75 171.82,-97.81"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86" target="_top" xlink:title="Function to be used for testing purposes. This function guarantees the correct solution for FCFS sche...">
-<polygon fill="white" stroke="#666666" points="244.5,-56.25 159.5,-56.25 159.5,-37 244.5,-37 244.5,-56.25"/>
-<text text-anchor="middle" x="202" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_final_status</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.65,-46.62C116.75,-46.62 132.43,-46.62 147.87,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.5,-50.13 157.5,-46.63 147.5,-43.13 147.5,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91" target="_top" xlink:title="Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algor...">
-<polygon fill="white" stroke="#666666" points="262.5,-19.25 141.5,-19.25 141.5,0 262.5,0 262.5,-19.25"/>
-<text text-anchor="middle" x="202" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::scheduleForFcfs</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-40.55C115.97,-36.69 129.45,-31.68 141.5,-27.62 145.99,-26.12 150.69,-24.6 155.39,-23.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.31,-26.49 164.83,-20.19 154.24,-19.8 156.31,-26.49"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="417.25,-177.25 298.5,-177.25 298.5,-158 417.25,-158 417.25,-177.25"/>
-<text text-anchor="middle" x="357.88" y="-163.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set::end</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M227.17,-120.74C246.38,-128.66 274,-139.77 298.5,-148.62 303.5,-150.43 308.77,-152.25 314.01,-154.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="312.6,-157.24 323.2,-157.06 314.8,-150.6 312.6,-157.24"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="406.38,-139.88 309.38,-139.88 309.38,-109.38 406.38,-109.38 406.38,-139.88"/>
-<text text-anchor="start" x="317.38" y="-126.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="357.88" y="-115.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M252.11,-115.09C266.62,-116.41 282.65,-117.87 297.72,-119.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.24,-122.71 307.51,-120.13 297.87,-115.74 297.24,-122.71"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="406.38,-90.88 309.38,-90.88 309.38,-60.38 406.38,-60.38 406.38,-90.88"/>
-<text text-anchor="start" x="317.38" y="-77.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="357.88" y="-66.12" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M247.51,-100.5C263.31,-96.91 281.34,-92.81 298.14,-88.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.52,-92.49 307.5,-86.86 296.97,-85.66 298.52,-92.49"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec" target="_top" xlink:title="Comparator function for sorting a vector.">
-<polygon fill="white" stroke="#666666" points="380.5,-42.25 335.25,-42.25 335.25,-23 380.5,-23 380.5,-42.25"/>
-<text text-anchor="middle" x="357.88" y="-28.75" font-family="Helvetica,sans-Serif" font-size="10.00">sortcol</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M244.64,-42.84C269.5,-40.57 300.64,-37.74 323.81,-35.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="323.97,-39.13 333.61,-34.74 323.34,-32.16 323.97,-39.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 4d6dcd2d2..000000000
--- a/df/d47/fcfs__scheduling_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,167 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="425pt" height="185pt"
- viewBox="0.00 0.00 425.25 185.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 181.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Entry point of the program.">
-<polygon fill="#999999" stroke="#666666" points="37,-56.25 0,-56.25 0,-37 37,-37 37,-56.25"/>
-<text text-anchor="middle" x="18.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-56.25 73,-56.25 73,-37 105.5,-37 105.5,-56.25"/>
-<text text-anchor="middle" x="89.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-46.62C44.58,-46.62 53.31,-46.62 61.45,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-50.13 71.2,-46.63 61.2,-43.13 61.2,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69" target="_top" xlink:title="Adds the process to the ready queue if it isn&#39;t already there.">
-<polygon fill="white" stroke="#666666" points="252,-120.25 152,-120.25 152,-101 252,-101 252,-120.25"/>
-<text text-anchor="middle" x="202" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::addProcess</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.65,-55.52C123.22,-65.68 152.29,-82.48 173.72,-94.86"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.82,-97.81 182.23,-99.78 175.33,-91.75 171.82,-97.81"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86" target="_top" xlink:title="Function to be used for testing purposes. This function guarantees the correct solution for FCFS sche...">
-<polygon fill="white" stroke="#666666" points="244.5,-56.25 159.5,-56.25 159.5,-37 244.5,-37 244.5,-56.25"/>
-<text text-anchor="middle" x="202" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_final_status</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node7 -->
-<g id="edge6_Node000002_Node000007" class="edge">
-<title>Node2&#45;&gt;Node7</title>
-<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.65,-46.62C116.75,-46.62 132.43,-46.62 147.87,-46.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="147.5,-50.13 157.5,-46.63 147.5,-43.13 147.5,-50.13"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a xlink:href="../../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91" target="_top" xlink:title="Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algor...">
-<polygon fill="white" stroke="#666666" points="262.5,-19.25 141.5,-19.25 141.5,0 262.5,0 262.5,-19.25"/>
-<text text-anchor="middle" x="202" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS::scheduleForFcfs</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node9 -->
-<g id="edge8_Node000002_Node000009" class="edge">
-<title>Node2&#45;&gt;Node9</title>
-<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.86,-40.55C115.97,-36.69 129.45,-31.68 141.5,-27.62 145.99,-26.12 150.69,-24.6 155.39,-23.11"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="156.31,-26.49 164.83,-20.19 154.24,-19.8 156.31,-26.49"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="417.25,-177.25 298.5,-177.25 298.5,-158 417.25,-158 417.25,-177.25"/>
-<text text-anchor="middle" x="357.88" y="-163.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set::end</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M227.17,-120.74C246.38,-128.66 274,-139.77 298.5,-148.62 303.5,-150.43 308.77,-152.25 314.01,-154.02"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="312.6,-157.24 323.2,-157.06 314.8,-150.6 312.6,-157.24"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="406.38,-139.88 309.38,-139.88 309.38,-109.38 406.38,-109.38 406.38,-139.88"/>
-<text text-anchor="start" x="317.38" y="-126.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="357.88" y="-115.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M252.11,-115.09C266.62,-116.41 282.65,-117.87 297.72,-119.24"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.24,-122.71 307.51,-120.13 297.87,-115.74 297.24,-122.71"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set/insert.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="406.38,-90.88 309.38,-90.88 309.38,-60.38 406.38,-60.38 406.38,-90.88"/>
-<text text-anchor="start" x="317.38" y="-77.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set</text>
-<text text-anchor="middle" x="357.88" y="-66.12" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M247.51,-100.5C263.31,-96.91 281.34,-92.81 298.14,-88.98"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.52,-92.49 307.5,-86.86 296.97,-85.66 298.52,-92.49"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a xlink:href="../../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec" target="_top" xlink:title="Comparator function for sorting a vector.">
-<polygon fill="white" stroke="#666666" points="380.5,-42.25 335.25,-42.25 335.25,-23 380.5,-23 380.5,-42.25"/>
-<text text-anchor="middle" x="357.88" y="-28.75" font-family="Helvetica,sans-Serif" font-size="10.00">sortcol</text>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node8 -->
-<g id="edge7_Node000007_Node000008" class="edge">
-<title>Node7&#45;&gt;Node8</title>
-<g id="a_edge7_Node000007_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M244.64,-42.84C269.5,-40.57 300.64,-37.74 323.81,-35.63"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="323.97,-39.13 333.61,-34.74 323.34,-32.16 323.97,-39.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d47/fcfs__scheduling_8cpp_source.html b/df/d47/fcfs__scheduling_8cpp_source.html
new file mode 100644
index 000000000..dc6f65507
--- /dev/null
+++ b/df/d47/fcfs__scheduling_8cpp_source.html
@@ -0,0 +1,358 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: cpu_scheduling_algorithms/fcfs_scheduling.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/d47/fcfs__scheduling_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">fcfs_scheduling.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../df/d47/fcfs__scheduling_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &lt;algorithm&gt;</span>      </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="preprocessor">#include &lt;cassert&gt;</span>        </div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="preprocessor">#include &lt;cstdlib&gt;</span>        </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;ctime&gt;</span>          </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;iomanip&gt;</span>        </div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;iostream&gt;</span>       </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;queue&gt;</span>          </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;unordered_set&gt;</span>  </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;vector&gt;</span>         </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="keyword">using </span>std::cin;</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="keyword">using </span>std::cout;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="keyword">using </span>std::endl;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">using </span>std::get;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="keyword">using </span>std::left;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">using </span>std::make_tuple;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="keyword">using </span>std::priority_queue;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keyword">using </span>std::rand;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keyword">using </span>std::srand;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keyword">using </span>std::tuple;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="keyword">using </span>std::unordered_set;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="keyword">using </span>std::vector;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> S, <span class="keyword">typename</span> T, <span class="keyword">typename</span> E&gt;</div>
+<div class="foldopen" id="foldopen00046" data-start="{" data-end="}">
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"><a class="line" href="../../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec">   46</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec">sortcol</a>(tuple&lt;S, T, E&gt;&amp; t1, tuple&lt;S, T, E&gt;&amp; t2) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">if</span> (get&lt;1&gt;(t1) &lt; get&lt;1&gt;(t2)) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (get&lt;1&gt;(t1) == get&lt;1&gt;(t2) &amp;&amp; get&lt;0&gt;(t1) &lt; get&lt;0&gt;(t2)) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    }</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>}</div>
+</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> S, <span class="keyword">typename</span> T, <span class="keyword">typename</span> E&gt;</div>
+<div class="foldopen" id="foldopen00063" data-start="{" data-end="};">
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"><a class="line" href="../../de/d4a/class_compare.html">   63</a></span><span class="keyword">class </span><a class="code hl_class" href="../../de/d4a/class_compare.html">Compare</a> {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00076" data-start="{" data-end="}">
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"><a class="line" href="../../de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c">   76</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c">operator()</a>(tuple&lt;S, T, E, double, double, double&gt;&amp; t1,</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>                    tuple&lt;S, T, E, double, double, double&gt;&amp; t2) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        <span class="comment">// Compare arrival times</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        <span class="keywordflow">if</span> (get&lt;1&gt;(t2) &lt; get&lt;1&gt;(t1)) {</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>            <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>        }</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>        <span class="comment">// If arrival times are same, then compare Process IDs</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (get&lt;1&gt;(t2) == get&lt;1&gt;(t1)) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            <span class="keywordflow">return</span> get&lt;0&gt;(t2) &lt; get&lt;0&gt;(t1);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        }</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    }</div>
+</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>};</div>
+</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> S, <span class="keyword">typename</span> T, <span class="keyword">typename</span> E&gt;</div>
+<div class="foldopen" id="foldopen00098" data-start="{" data-end="};">
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"><a class="line" href="../../dd/dca/class_f_c_f_s.html">   98</a></span><span class="keyword">class </span><a class="code hl_class" href="../../dd/dca/class_f_c_f_s.html">FCFS</a> {</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    priority_queue&lt;tuple&lt;S, T, E, double, double, double&gt;,</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>                   vector&lt;tuple&lt;S, T, E, double, double, double&gt;&gt;,</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>                   <a class="code hl_class" href="../../de/d4a/class_compare.html">Compare&lt;S, T, E&gt;</a>&gt;</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"><a class="line" href="../../dd/dca/class_f_c_f_s.html#af2594e22a867b308e027623940193d46">  112</a></span>        <a class="code hl_variable" href="../../dd/dca/class_f_c_f_s.html#af2594e22a867b308e027623940193d46">schedule</a>;</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <span class="comment">// Stores final status of all the processes after completing the execution.</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    vector&lt;tuple&lt;S, T, E, double, double, double&gt;&gt; result;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="comment">// Stores process IDs. Used for confirming absence of a process while adding</span></div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <span class="comment">// it.</span></div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    unordered_set&lt;S&gt; idList;</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span> <span class="keyword">public</span>:</div>
+<div class="foldopen" id="foldopen00130" data-start="{" data-end="}">
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"><a class="line" href="../../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69">  130</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69">addProcess</a>(S <span class="keywordtype">id</span>, T arrival, E burst) {</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        <span class="comment">// Add if a process with process ID as id is not found in idList.</span></div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        <span class="keywordflow">if</span> (idList.find(<span class="keywordtype">id</span>) == idList.end()) {</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>            tuple&lt;S, T, E, double, double, double&gt; t =</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>                make_tuple(<span class="keywordtype">id</span>, arrival, burst, 0, 0, 0);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>            <a class="code hl_variable" href="../../dd/dca/class_f_c_f_s.html#af2594e22a867b308e027623940193d46">schedule</a>.push(t);</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>            idList.insert(<span class="keywordtype">id</span>);</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>        }</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>    }</div>
+</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span> </div>
+<div class="foldopen" id="foldopen00155" data-start="{" data-end="}">
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"><a class="line" href="../../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91">  155</a></span>    vector&lt;tuple&lt;S, T, E, double, double, double&gt;&gt; <a class="code hl_function" href="../../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91">scheduleForFcfs</a>() {</div>
+<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span>        <span class="comment">// Variable to keep track of time elapsed so far</span></div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>        <span class="keywordtype">double</span> timeElapsed = 0;</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span> </div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>        <span class="keywordflow">while</span> (!<a class="code hl_variable" href="../../dd/dca/class_f_c_f_s.html#af2594e22a867b308e027623940193d46">schedule</a>.empty()) {</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>            tuple&lt;S, T, E, double, double, double&gt; cur = <a class="code hl_variable" href="../../dd/dca/class_f_c_f_s.html#af2594e22a867b308e027623940193d46">schedule</a>.top();</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span> </div>
+<div class="line"><a id="l00162" name="l00162"></a><span class="lineno">  162</span>            <span class="comment">// If the current process arrived at time t2, the last process</span></div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>            <span class="comment">// completed its execution at time t1, and t2 &gt; t1.</span></div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span>            <span class="keywordflow">if</span> (get&lt;1&gt;(cur) &gt; timeElapsed) {</div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>                timeElapsed += get&lt;1&gt;(cur) - timeElapsed;</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>            }</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span> </div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>            <span class="comment">// Add Burst time to time elapsed</span></div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>            timeElapsed += get&lt;2&gt;(cur);</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span> </div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span>            <span class="comment">// Completion time of the current process will be same as time</span></div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>            <span class="comment">// elapsed so far</span></div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>            get&lt;3&gt;(cur) = timeElapsed;</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span> </div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>            <span class="comment">// Turnaround time = Completion time - Arrival time</span></div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>            get&lt;4&gt;(cur) = get&lt;3&gt;(cur) - get&lt;1&gt;(cur);</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span> </div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>            <span class="comment">// Waiting time = Turnaround time - Burst time</span></div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>            get&lt;5&gt;(cur) = get&lt;4&gt;(cur) - get&lt;2&gt;(cur);</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span> </div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>            result.push_back(cur);</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>            <a class="code hl_variable" href="../../dd/dca/class_f_c_f_s.html#af2594e22a867b308e027623940193d46">schedule</a>.pop();</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>        }</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span>        <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>    }</div>
+</div>
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span> </div>
+<div class="foldopen" id="foldopen00192" data-start="{" data-end="}">
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"><a class="line" href="../../dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793">  192</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793">printResult</a>() {</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span>        cout &lt;&lt; <span class="stringliteral">&quot;Status of all the proceses post completion is as follows:&quot;</span></div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>             &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span> </div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>        cout &lt;&lt; std::setw(17) &lt;&lt; left &lt;&lt; <span class="stringliteral">&quot;Process ID&quot;</span> &lt;&lt; std::setw(17) &lt;&lt; left</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>             &lt;&lt; <span class="stringliteral">&quot;Arrival Time&quot;</span> &lt;&lt; std::setw(17) &lt;&lt; left &lt;&lt; <span class="stringliteral">&quot;Burst Time&quot;</span></div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>             &lt;&lt; std::setw(17) &lt;&lt; left &lt;&lt; <span class="stringliteral">&quot;Completion Time&quot;</span> &lt;&lt; std::setw(17)</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>             &lt;&lt; left &lt;&lt; <span class="stringliteral">&quot;Turnaround Time&quot;</span> &lt;&lt; std::setw(17) &lt;&lt; left</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>             &lt;&lt; <span class="stringliteral">&quot;Waiting Time&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span> </div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>        <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i{}; i &lt; result.size(); i++) {</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>            cout &lt;&lt; std::setprecision(2) &lt;&lt; std::fixed &lt;&lt; std::setw(17) &lt;&lt; left</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>                 &lt;&lt; get&lt;0&gt;(result[i]) &lt;&lt; std::setw(17) &lt;&lt; left</div>
+<div class="line"><a id="l00205" name="l00205"></a><span class="lineno">  205</span>                 &lt;&lt; get&lt;1&gt;(result[i]) &lt;&lt; std::setw(17) &lt;&lt; left</div>
+<div class="line"><a id="l00206" name="l00206"></a><span class="lineno">  206</span>                 &lt;&lt; get&lt;2&gt;(result[i]) &lt;&lt; std::setw(17) &lt;&lt; left</div>
+<div class="line"><a id="l00207" name="l00207"></a><span class="lineno">  207</span>                 &lt;&lt; get&lt;3&gt;(result[i]) &lt;&lt; std::setw(17) &lt;&lt; left</div>
+<div class="line"><a id="l00208" name="l00208"></a><span class="lineno">  208</span>                 &lt;&lt; get&lt;4&gt;(result[i]) &lt;&lt; std::setw(17) &lt;&lt; left</div>
+<div class="line"><a id="l00209" name="l00209"></a><span class="lineno">  209</span>                 &lt;&lt; get&lt;5&gt;(result[i]) &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00210" name="l00210"></a><span class="lineno">  210</span>        }</div>
+<div class="line"><a id="l00211" name="l00211"></a><span class="lineno">  211</span>    }</div>
+</div>
+<div class="line"><a id="l00212" name="l00212"></a><span class="lineno">  212</span>};</div>
+</div>
+<div class="line"><a id="l00213" name="l00213"></a><span class="lineno">  213</span> </div>
+<div class="line"><a id="l00225" name="l00225"></a><span class="lineno">  225</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> S, <span class="keyword">typename</span> T, <span class="keyword">typename</span> E&gt;</div>
+<div class="foldopen" id="foldopen00226" data-start="{" data-end="}">
+<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"><a class="line" href="../../df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86">  226</a></span>vector&lt;tuple&lt;S, T, E, double, double, double&gt;&gt; <a class="code hl_function" href="../../df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86">get_final_status</a>(</div>
+<div class="line"><a id="l00227" name="l00227"></a><span class="lineno">  227</span>    vector&lt;tuple&lt;uint32_t, uint32_t, uint32_t&gt;&gt; input) {</div>
+<div class="line"><a id="l00228" name="l00228"></a><span class="lineno">  228</span>    sort(input.begin(), input.end(), <a class="code hl_function" href="../../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec">sortcol&lt;S, T, E&gt;</a>);</div>
+<div class="line"><a id="l00229" name="l00229"></a><span class="lineno">  229</span>    vector&lt;tuple&lt;S, T, E, double, double, double&gt;&gt; result(input.size());</div>
+<div class="line"><a id="l00230" name="l00230"></a><span class="lineno">  230</span>    <span class="keywordtype">double</span> timeElapsed = 0;</div>
+<div class="line"><a id="l00231" name="l00231"></a><span class="lineno">  231</span>    <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i{}; i &lt; input.size(); i++) {</div>
+<div class="line"><a id="l00232" name="l00232"></a><span class="lineno">  232</span>        T arrival = get&lt;1&gt;(input[i]);</div>
+<div class="line"><a id="l00233" name="l00233"></a><span class="lineno">  233</span>        E burst = get&lt;2&gt;(input[i]);</div>
+<div class="line"><a id="l00234" name="l00234"></a><span class="lineno">  234</span> </div>
+<div class="line"><a id="l00235" name="l00235"></a><span class="lineno">  235</span>        <span class="keywordflow">if</span> (arrival &gt; timeElapsed) {</div>
+<div class="line"><a id="l00236" name="l00236"></a><span class="lineno">  236</span>            timeElapsed += arrival - timeElapsed;</div>
+<div class="line"><a id="l00237" name="l00237"></a><span class="lineno">  237</span>        }</div>
+<div class="line"><a id="l00238" name="l00238"></a><span class="lineno">  238</span>        timeElapsed += burst;</div>
+<div class="line"><a id="l00239" name="l00239"></a><span class="lineno">  239</span>        <span class="keywordtype">double</span> completion = timeElapsed;</div>
+<div class="line"><a id="l00240" name="l00240"></a><span class="lineno">  240</span>        <span class="keywordtype">double</span> turnaround = completion - arrival;</div>
+<div class="line"><a id="l00241" name="l00241"></a><span class="lineno">  241</span>        <span class="keywordtype">double</span> waiting = turnaround - burst;</div>
+<div class="line"><a id="l00242" name="l00242"></a><span class="lineno">  242</span> </div>
+<div class="line"><a id="l00243" name="l00243"></a><span class="lineno">  243</span>        get&lt;0&gt;(result[i]) = get&lt;0&gt;(input[i]);</div>
+<div class="line"><a id="l00244" name="l00244"></a><span class="lineno">  244</span>        get&lt;1&gt;(result[i]) = arrival;</div>
+<div class="line"><a id="l00245" name="l00245"></a><span class="lineno">  245</span>        get&lt;2&gt;(result[i]) = burst;</div>
+<div class="line"><a id="l00246" name="l00246"></a><span class="lineno">  246</span>        get&lt;3&gt;(result[i]) = completion;</div>
+<div class="line"><a id="l00247" name="l00247"></a><span class="lineno">  247</span>        get&lt;4&gt;(result[i]) = turnaround;</div>
+<div class="line"><a id="l00248" name="l00248"></a><span class="lineno">  248</span>        get&lt;5&gt;(result[i]) = waiting;</div>
+<div class="line"><a id="l00249" name="l00249"></a><span class="lineno">  249</span>    }</div>
+<div class="line"><a id="l00250" name="l00250"></a><span class="lineno">  250</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00251" name="l00251"></a><span class="lineno">  251</span>}</div>
+</div>
+<div class="line"><a id="l00252" name="l00252"></a><span class="lineno">  252</span> </div>
+<div class="foldopen" id="foldopen00257" data-start="{" data-end="}">
+<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"><a class="line" href="../../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">  257</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00258" name="l00258"></a><span class="lineno">  258</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i{}; i &lt; 1000; i++) {</div>
+<div class="line"><a id="l00259" name="l00259"></a><span class="lineno">  259</span>        srand(time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><a id="l00260" name="l00260"></a><span class="lineno">  260</span>        uint32_t n = 1 + rand() % 1000;</div>
+<div class="line"><a id="l00261" name="l00261"></a><span class="lineno">  261</span>        <a class="code hl_class" href="../../dd/dca/class_f_c_f_s.html">FCFS&lt;uint32_t, uint32_t, uint32_t&gt;</a> readyQueue;</div>
+<div class="line"><a id="l00262" name="l00262"></a><span class="lineno">  262</span>        vector&lt;tuple&lt;uint32_t, uint32_t, uint32_t&gt;&gt; input(n);</div>
+<div class="line"><a id="l00263" name="l00263"></a><span class="lineno">  263</span> </div>
+<div class="line"><a id="l00264" name="l00264"></a><span class="lineno">  264</span>        <span class="keywordflow">for</span> (uint32_t i{}; i &lt; n; i++) {</div>
+<div class="line"><a id="l00265" name="l00265"></a><span class="lineno">  265</span>            get&lt;0&gt;(input[i]) = i;</div>
+<div class="line"><a id="l00266" name="l00266"></a><span class="lineno">  266</span>            srand(time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><a id="l00267" name="l00267"></a><span class="lineno">  267</span>            get&lt;1&gt;(input[i]) = 1 + rand() % 10000;</div>
+<div class="line"><a id="l00268" name="l00268"></a><span class="lineno">  268</span>            srand(time(<span class="keyword">nullptr</span>));</div>
+<div class="line"><a id="l00269" name="l00269"></a><span class="lineno">  269</span>            get&lt;2&gt;(input[i]) = 1 + rand() % 10000;</div>
+<div class="line"><a id="l00270" name="l00270"></a><span class="lineno">  270</span>        }</div>
+<div class="line"><a id="l00271" name="l00271"></a><span class="lineno">  271</span> </div>
+<div class="line"><a id="l00272" name="l00272"></a><span class="lineno">  272</span>        <span class="keywordflow">for</span> (uint32_t i{}; i &lt; n; i++) {</div>
+<div class="line"><a id="l00273" name="l00273"></a><span class="lineno">  273</span>            readyQueue.<a class="code hl_function" href="../../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69">addProcess</a>(get&lt;0&gt;(input[i]), get&lt;1&gt;(input[i]),</div>
+<div class="line"><a id="l00274" name="l00274"></a><span class="lineno">  274</span>                                  get&lt;2&gt;(input[i]));</div>
+<div class="line"><a id="l00275" name="l00275"></a><span class="lineno">  275</span>        }</div>
+<div class="line"><a id="l00276" name="l00276"></a><span class="lineno">  276</span>        vector&lt;tuple&lt;uint32_t, uint32_t, uint32_t, double, double, double&gt;&gt;</div>
+<div class="line"><a id="l00277" name="l00277"></a><span class="lineno">  277</span>            res = <a class="code hl_function" href="../../df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86">get_final_status&lt;uint32_t, uint32_t, uint32_t&gt;</a>(input);</div>
+<div class="line"><a id="l00278" name="l00278"></a><span class="lineno">  278</span>        assert(res == readyQueue.<a class="code hl_function" href="../../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91">scheduleForFcfs</a>());</div>
+<div class="line"><a id="l00279" name="l00279"></a><span class="lineno">  279</span>        <span class="comment">// readyQueue.printResult();</span></div>
+<div class="line"><a id="l00280" name="l00280"></a><span class="lineno">  280</span>    }</div>
+<div class="line"><a id="l00281" name="l00281"></a><span class="lineno">  281</span>    cout &lt;&lt; <span class="stringliteral">&quot;All the tests have successfully passed!&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00282" name="l00282"></a><span class="lineno">  282</span>}</div>
+</div>
+<div class="line"><a id="l00283" name="l00283"></a><span class="lineno">  283</span> </div>
+<div class="foldopen" id="foldopen00288" data-start="{" data-end="}">
+<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"><a class="line" href="../../df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  288</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00289" name="l00289"></a><span class="lineno">  289</span>    <a class="code hl_function" href="../../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00290" name="l00290"></a><span class="lineno">  290</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00291" name="l00291"></a><span class="lineno">  291</span>}</div>
+</div>
+<div class="ttc" id="aclass_compare_html"><div class="ttname"><a href="../../de/d4a/class_compare.html">Compare</a></div><div class="ttdoc">Comparator class for priority queue.</div><div class="ttdef"><b>Definition</b> <a href="#l00063">fcfs_scheduling.cpp:63</a></div></div>
+<div class="ttc" id="aclass_compare_html_afbdf9a44adb49728dc704155d7d1570c"><div class="ttname"><a href="../../de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c">Compare::operator()</a></div><div class="ttdeci">bool operator()(tuple&lt; S, T, E, double, double, double &gt; &amp;t1, tuple&lt; S, T, E, double, double, double &gt; &amp;t2)</div><div class="ttdoc">A comparator function that checks whether to swap the two tuples or not. to https://www....</div><div class="ttdef"><b>Definition</b> <a href="#l00076">fcfs_scheduling.cpp:76</a></div></div>
+<div class="ttc" id="aclass_f_c_f_s_html"><div class="ttname"><a href="../../dd/dca/class_f_c_f_s.html">FCFS</a></div><div class="ttdoc">Class which implements the FCFS scheduling algorithm.</div><div class="ttdef"><b>Definition</b> <a href="#l00098">fcfs_scheduling.cpp:98</a></div></div>
+<div class="ttc" id="aclass_f_c_f_s_html_a8fbfe4d85f7576b4a7aade07d29fbd69"><div class="ttname"><a href="../../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69">FCFS::addProcess</a></div><div class="ttdeci">void addProcess(S id, T arrival, E burst)</div><div class="ttdoc">Adds the process to the ready queue if it isn't already there.</div><div class="ttdef"><b>Definition</b> <a href="#l00130">fcfs_scheduling.cpp:130</a></div></div>
+<div class="ttc" id="aclass_f_c_f_s_html_aa25dbe30ba9930b5a7c1a6d11758bd91"><div class="ttname"><a href="../../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91">FCFS::scheduleForFcfs</a></div><div class="ttdeci">vector&lt; tuple&lt; S, T, E, double, double, double &gt; &gt; scheduleForFcfs()</div><div class="ttdoc">Algorithm for scheduling CPU processes according to the First Come First Serve(FCFS) scheduling algor...</div><div class="ttdef"><b>Definition</b> <a href="#l00155">fcfs_scheduling.cpp:155</a></div></div>
+<div class="ttc" id="aclass_f_c_f_s_html_abb361a612b18bb189aa6d3c49288b793"><div class="ttname"><a href="../../dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793">FCFS::printResult</a></div><div class="ttdeci">void printResult()</div><div class="ttdoc">Utility function for printing the status of each process after execution.</div><div class="ttdef"><b>Definition</b> <a href="#l00192">fcfs_scheduling.cpp:192</a></div></div>
+<div class="ttc" id="aclass_f_c_f_s_html_af2594e22a867b308e027623940193d46"><div class="ttname"><a href="../../dd/dca/class_f_c_f_s.html#af2594e22a867b308e027623940193d46">FCFS::schedule</a></div><div class="ttdeci">priority_queue&lt; tuple&lt; S, T, E, double, double, double &gt;, vector&lt; tuple&lt; S, T, E, double, double, double &gt; &gt;, Compare&lt; S, T, E &gt; &gt; schedule</div><div class="ttdef"><b>Definition</b> <a href="#l00112">fcfs_scheduling.cpp:112</a></div></div>
+<div class="ttc" id="afcfs__scheduling_8cpp_html_a18920aa331faf4476b251c8cdb2c2bec"><div class="ttname"><a href="../../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec">sortcol</a></div><div class="ttdeci">bool sortcol(tuple&lt; S, T, E &gt; &amp;t1, tuple&lt; S, T, E &gt; &amp;t2)</div><div class="ttdoc">Comparator function for sorting a vector.</div><div class="ttdef"><b>Definition</b> <a href="#l00046">fcfs_scheduling.cpp:46</a></div></div>
+<div class="ttc" id="afcfs__scheduling_8cpp_html_a8f2b90cb64d63a7080965e66a05ccf86"><div class="ttname"><a href="../../df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86">get_final_status</a></div><div class="ttdeci">vector&lt; tuple&lt; S, T, E, double, double, double &gt; &gt; get_final_status(vector&lt; tuple&lt; uint32_t, uint32_t, uint32_t &gt; &gt; input)</div><div class="ttdoc">Function to be used for testing purposes. This function guarantees the correct solution for FCFS sche...</div><div class="ttdef"><b>Definition</b> <a href="#l00226">fcfs_scheduling.cpp:226</a></div></div>
+<div class="ttc" id="afcfs__scheduling_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../df/d47/fcfs__scheduling_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> <a href="#l00257">fcfs_scheduling.cpp:257</a></div></div>
+<div class="ttc" id="afcfs__scheduling_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Entry point of the program.</div><div class="ttdef"><b>Definition</b> <a href="#l00288">fcfs_scheduling.cpp:288</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html">cpu_scheduling_algorithms</a></li><li class="navelem"><a class="el" href="../../df/d47/fcfs__scheduling_8cpp.html">fcfs_scheduling.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/d47/stack_8hpp.html b/df/d47/stack_8hpp.html
index 2be7ffe5f..3f9db0698 100644
--- a/df/d47/stack_8hpp.html
+++ b/df/d47/stack_8hpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/stack.hpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/stack.hpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,13 +136,18 @@ Include dependency graph for stack.hpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../df/deb/stack_8hpp__incl.svg" width="266" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 </div>
+</div><div class="textblock"><div class="dynheader">
+This graph shows which files directly or indirectly include this file:</div>
+<div class="dyncontent">
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/df9/stack_8hpp__dep__incl.svg" width="315" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+</div>
 </div>
 <p><a href="../../df/d47/stack_8hpp_source.html">Go to the source code of this file.</a></p>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/dc2/classstack.html">stack&lt; ValueType &gt;</a></td></tr>
-<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>  <a href="../../d1/dc2/classstack.html#details">More...</a><br /></td></tr>
+<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::invalid_argument  <a href="../../d1/dc2/classstack.html#details">More...</a><br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -133,6 +155,8 @@ Classes</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd>danghai </dd>
 <dd>
 <a href="https://github.com/vil02" target="_blank">Piotr Idzik</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../df/d47/stack_8hpp_source.html">stack.hpp</a>.</p>
 </div></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/df/d47/stack_8hpp_source.html b/df/d47/stack_8hpp_source.html
index 4535c63db..54cfa7fc4 100644
--- a/df/d47/stack_8hpp_source.html
+++ b/df/d47/stack_8hpp_source.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/stack.hpp Source File</title>
+<title>TheAlgorithms/C++: data_structures/stack.hpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -107,74 +124,60 @@ $(function(){initNavTree('df/d47/stack_8hpp_source.html','../../'); initResizabl
   <div class="headertitle"><div class="title">stack.hpp</div></div>
 </div><!--header-->
 <div class="contents">
-<a href="../../df/d47/stack_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/**</span></div>
-<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * @file</span></div>
-<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * @author danghai</span></div>
-<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * @author [Piotr Idzik](https://github.com/vil02)</span></div>
-<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * @brief  This class specifies the basic operation on a stack as a linked list</span></div>
-<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> **/</span></div>
+<a href="../../df/d47/stack_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
 <div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#ifndef DATA_STRUCTURES_STACK_HPP_</span></div>
 <div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#define DATA_STRUCTURES_STACK_HPP_</span></div>
 <div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span> </div>
-<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;stdexcept&gt;</span>  <span class="comment">/// for std::invalid_argument</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;stdexcept&gt;</span>  </div>
 <div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
-<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &quot;<a class="code" href="../../d3/d09/node_8hpp.html">node.hpp</a>&quot;</span>  <span class="comment">/// for Node</span></div>
-<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment"></span> </div>
-<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment">/** Definition of the stack class</span></div>
-<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment"> * \tparam value_type type of data nodes of the linked list in the stack should</span></div>
-<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment"> * contain</span></div>
-<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment"> */</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="preprocessor">#include &quot;<a class="code" href="../../d3/d09/node_8hpp.html">node.hpp</a>&quot;</span>  </div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
 <div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="keyword">template</span> &lt;<span class="keyword">class</span> ValueType&gt;</div>
 <div class="foldopen" id="foldopen00019" data-start="{" data-end="};">
 <div class="line"><a id="l00019" name="l00019"></a><span class="lineno"><a class="line" href="../../d1/dc2/classstack.html">   19</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a> {</div>
 <div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> <span class="keyword">public</span>:</div>
 <div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keyword">using </span>value_type = ValueType;</div>
-<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"></span> </div>
-<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment">    /** Show stack */</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
 <div class="foldopen" id="foldopen00024" data-start="{" data-end="}">
 <div class="line"><a id="l00024" name="l00024"></a><span class="lineno"><a class="line" href="../../d1/dc2/classstack.html#a8bce109630118a34faae717f72986033">   24</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/dc2/classstack.html#a8bce109630118a34faae717f72986033">display</a>()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Top --&gt; &quot;</span>;</div>
-<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        display_all(this-&gt;<a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html">get</a>());</div>
-<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
-<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Size of stack: &quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e">size</a> &lt;&lt; <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"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Top --&gt; &quot;</span>;</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        display_all(this-&gt;<a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>.get());</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;Size of stack: &quot;</span> &lt;&lt; <a class="code hl_variable" href="../../d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e">size</a> &lt;&lt; std::endl;</div>
 <div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    }</div>
 </div>
 <div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
-<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;value_type&gt;</a> toVector()<span class="keyword"> const </span>{</div>
-<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        <span class="keywordflow">return</span> push_all_to_vector(this-&gt;<a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html">get</a>(), this-&gt;size);</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    std::vector&lt;value_type&gt; toVector()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        <span class="keywordflow">return</span> push_all_to_vector(this-&gt;<a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>.get(), this-&gt;size);</div>
 <div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    }</div>
 <div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span> </div>
 <div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span> <span class="keyword">private</span>:</div>
 <div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    <span class="keywordtype">void</span> ensureNotEmpty()<span class="keyword"> const </span>{</div>
 <div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5">isEmptyStack</a>()) {</div>
-<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>            <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>(<span class="stringliteral">&quot;Stack is empty.&quot;</span>);</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>            <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;Stack is empty.&quot;</span>);</div>
 <div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        }</div>
 <div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    }</div>
 <div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
-<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> <span class="keyword">public</span>:<span class="comment"></span></div>
-<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="comment">    /** Determine whether the stack is empty */</span></div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span> <span class="keyword">public</span>:</div>
 <div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="../../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5">   44</a></span>    <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5">isEmptyStack</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> (<a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a> == <span class="keyword">nullptr</span>); }</div>
-<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="comment"></span> </div>
-<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="comment">    /** Add new item to the stack */</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span> </div>
 <div class="foldopen" id="foldopen00047" data-start="{" data-end="}">
 <div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">   47</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(<span class="keyword">const</span> value_type&amp; item) {</div>
-<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="keyword">auto</span> newNode = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared&lt;Node&lt;value_type&gt;</a>&gt;();</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        <span class="keyword">auto</span> newNode = std::make_shared&lt;Node&lt;value_type&gt;&gt;();</div>
 <div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        newNode-&gt;data = item;</div>
 <div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        newNode-&gt;next = <a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>;</div>
 <div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        <a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a> = newNode;</div>
 <div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        <a class="code hl_variable" href="../../d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e">size</a>++;</div>
 <div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    }</div>
 </div>
-<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="comment"></span> </div>
-<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="comment">    /** Return the top element of the stack */</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
 <div class="foldopen" id="foldopen00056" data-start="{" data-end="}">
 <div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">   56</a></span>    value_type <a class="code hl_function" href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">top</a>()<span class="keyword"> const </span>{</div>
 <div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        ensureNotEmpty();</div>
 <div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a>-&gt;data;</div>
 <div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    }</div>
 </div>
-<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="comment"></span> </div>
-<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="comment">    /** Remove the top element of the stack */</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
 <div class="foldopen" id="foldopen00062" data-start="{" data-end="}">
 <div class="line"><a id="l00062" name="l00062"></a><span class="lineno"><a class="line" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">   62</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">pop</a>() {</div>
 <div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        ensureNotEmpty();</div>
@@ -182,8 +185,7 @@ $(function(){initNavTree('df/d47/stack_8hpp_source.html','../../'); initResizabl
 <div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        <a class="code hl_variable" href="../../d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e">size</a>--;</div>
 <div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
 </div>
-<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span><span class="comment"></span> </div>
-<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span><span class="comment">    /** Clear stack */</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
 <div class="foldopen" id="foldopen00069" data-start="{" data-end="}">
 <div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="../../d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092">   69</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092">clear</a>() {</div>
 <div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        <a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a> = <span class="keyword">nullptr</span>;</div>
@@ -193,32 +195,24 @@ $(function(){initNavTree('df/d47/stack_8hpp_source.html','../../'); initResizabl
 <div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span> </div>
 <div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span> <span class="keyword">private</span>:</div>
 <div class="foldopen" id="foldopen00075" data-start="{" data-end="};">
-<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">   75</a></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt;Node&lt;value_type&gt;</a>&gt; <a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a> =</div>
-<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        {};                <span class="comment">/**&lt; Pointer to the stack */</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">   75</a></span>    std::shared_ptr&lt;Node&lt;value_type&gt;&gt; <a class="code hl_variable" href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stackTop</a> =</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        {};                </div>
 </div>
-<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e">   77</a></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> <a class="code hl_variable" href="../../d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e">size</a> = 0;  <span class="comment">///&lt; size of stack</span></div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e">   77</a></span>    std::size_t <a class="code hl_variable" href="../../d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e">size</a> = 0;  </div>
 <div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>};</div>
 </div>
 <div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span> </div>
 <div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span><span class="preprocessor">#endif  </span><span class="comment">// DATA_STRUCTURES_STACK_HPP_</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="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> stack.hpp:19</div></div>
-<div class="ttc" id="aclassstack_html_a0a6b2b93ec970296940798ee98a5072e"><div class="ttname"><a href="../../d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e">stack::size</a></div><div class="ttdeci">std::size_t size</div><div class="ttdoc">size of stack</div><div class="ttdef"><b>Definition</b> stack.hpp:77</div></div>
-<div class="ttc" id="aclassstack_html_a163eb9a6206c874c9bf98d032fca11c5"><div class="ttname"><a href="../../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5">stack::isEmptyStack</a></div><div class="ttdeci">bool isEmptyStack() const</div><div class="ttdef"><b>Definition</b> stack.hpp:44</div></div>
-<div class="ttc" id="aclassstack_html_a3647fb4418890f19e0dc414b8092b8b0"><div class="ttname"><a href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition</b> stack.hpp:62</div></div>
-<div class="ttc" id="aclassstack_html_a6f13157faa1a762c59e67da8b9516092"><div class="ttname"><a href="../../d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092">stack::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition</b> stack.hpp:69</div></div>
-<div class="ttc" id="aclassstack_html_a8bce109630118a34faae717f72986033"><div class="ttname"><a href="../../d1/dc2/classstack.html#a8bce109630118a34faae717f72986033">stack::display</a></div><div class="ttdeci">void display() const</div><div class="ttdef"><b>Definition</b> stack.hpp:24</div></div>
-<div class="ttc" id="aclassstack_html_a90df277532c23519aa7ac3c08ed90a1d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack::push</a></div><div class="ttdeci">void push(const value_type &amp;item)</div><div class="ttdef"><b>Definition</b> stack.hpp:47</div></div>
-<div class="ttc" id="aclassstack_html_ae09630c4384903d187801921b2ddc709"><div class="ttname"><a href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">stack::top</a></div><div class="ttdeci">value_type top() const</div><div class="ttdef"><b>Definition</b> stack.hpp:56</div></div>
-<div class="ttc" id="aclassstack_html_aefb3dac828e32b4ec014ff4b5d43a6b8"><div class="ttname"><a href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stack::stackTop</a></div><div class="ttdeci">std::shared_ptr&lt; Node&lt; value_type &gt; &gt; stackTop</div><div class="ttdef"><b>Definition</b> stack.hpp:75</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="aget_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html">std::shared_ptr::get</a></div><div class="ttdeci">T get(T... args)</div></div>
-<div class="ttc" id="ainvalid_argument_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></div></div>
-<div class="ttc" id="amake_shared_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html">std::make_shared</a></div><div class="ttdeci">T make_shared(T... args)</div></div>
+<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> <a href="#l00019">stack.hpp:19</a></div></div>
+<div class="ttc" id="aclassstack_html_a0a6b2b93ec970296940798ee98a5072e"><div class="ttname"><a href="../../d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e">stack::size</a></div><div class="ttdeci">std::size_t size</div><div class="ttdoc">size of stack</div><div class="ttdef"><b>Definition</b> <a href="#l00077">stack.hpp:77</a></div></div>
+<div class="ttc" id="aclassstack_html_a163eb9a6206c874c9bf98d032fca11c5"><div class="ttname"><a href="../../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5">stack::isEmptyStack</a></div><div class="ttdeci">bool isEmptyStack() const</div><div class="ttdef"><b>Definition</b> <a href="#l00044">stack.hpp:44</a></div></div>
+<div class="ttc" id="aclassstack_html_a3647fb4418890f19e0dc414b8092b8b0"><div class="ttname"><a href="../../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition</b> <a href="#l00062">stack.hpp:62</a></div></div>
+<div class="ttc" id="aclassstack_html_a6f13157faa1a762c59e67da8b9516092"><div class="ttname"><a href="../../d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092">stack::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition</b> <a href="#l00069">stack.hpp:69</a></div></div>
+<div class="ttc" id="aclassstack_html_a8bce109630118a34faae717f72986033"><div class="ttname"><a href="../../d1/dc2/classstack.html#a8bce109630118a34faae717f72986033">stack::display</a></div><div class="ttdeci">void display() const</div><div class="ttdef"><b>Definition</b> <a href="#l00024">stack.hpp:24</a></div></div>
+<div class="ttc" id="aclassstack_html_a90df277532c23519aa7ac3c08ed90a1d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack::push</a></div><div class="ttdeci">void push(const value_type &amp;item)</div><div class="ttdef"><b>Definition</b> <a href="#l00047">stack.hpp:47</a></div></div>
+<div class="ttc" id="aclassstack_html_ae09630c4384903d187801921b2ddc709"><div class="ttname"><a href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">stack::top</a></div><div class="ttdeci">value_type top() const</div><div class="ttdef"><b>Definition</b> <a href="#l00056">stack.hpp:56</a></div></div>
+<div class="ttc" id="aclassstack_html_aefb3dac828e32b4ec014ff4b5d43a6b8"><div class="ttname"><a href="../../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stack::stackTop</a></div><div class="ttdeci">std::shared_ptr&lt; Node&lt; value_type &gt; &gt; stackTop</div><div class="ttdef"><b>Definition</b> <a href="#l00075">stack.hpp:75</a></div></div>
 <div class="ttc" id="anode_8hpp_html"><div class="ttname"><a href="../../d3/d09/node_8hpp.html">node.hpp</a></div><div class="ttdoc">Provides Node class and related utilities.</div></div>
-<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div></div>
-<div class="ttc" id="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></div></div>
-<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/df/d4a/namespaceselection__sort__recursive.html b/df/d4a/namespaceselection__sort__recursive.html
index a2a140653..e424a7ecd 100644
--- a/df/d4a/namespaceselection__sort__recursive.html
+++ b/df/d4a/namespaceselection__sort__recursive.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: selection_sort_recursive Namespace Reference</title>
+<title>TheAlgorithms/C++: selection_sort_recursive Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/df/d51/classothers_1_1lru__cache_1_1_l_r_u_cache-members.html b/df/d51/classothers_1_1lru__cache_1_1_l_r_u_cache-members.html
index 19920e68d..19a11af36 100644
--- a/df/d51/classothers_1_1lru__cache_1_1_l_r_u_cache-members.html
+++ b/df/d51/classothers_1_1lru__cache_1_1_l_r_u_cache-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/df/d66/vector__cross__product_8cpp.html b/df/d66/vector__cross__product_8cpp.html
index 53ecd23fe..f62f47ff8 100644
--- a/df/d66/vector__cross__product_8cpp.html
+++ b/df/d66/vector__cross__product_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/vector_cross_product.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/vector_cross_product.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for vector_cross_product.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../db/dc3/vector__cross__product_8cpp__incl.svg" width="327" height="111"><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">
+</div>
+<p><a href="../../df/d66/vector__cross__product_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -134,10 +153,10 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a225732399c5c076976eae5b180a9f8c9" id="r_a225732399c5c076976eae5b180a9f8c9"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 3 &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a225732399c5c076976eae5b180a9f8c9">math::vector_cross::cross</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 3 &gt; &amp;A, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 3 &gt; &amp;B)</td></tr>
+<tr class="memitem:a225732399c5c076976eae5b180a9f8c9" id="r_a225732399c5c076976eae5b180a9f8c9"><td class="memItemLeft" align="right" valign="top">std::array&lt; double, 3 &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a225732399c5c076976eae5b180a9f8c9">math::vector_cross::cross</a> (const std::array&lt; double, 3 &gt; &amp;A, const std::array&lt; double, 3 &gt; &amp;B)</td></tr>
 <tr class="memdesc:a225732399c5c076976eae5b180a9f8c9"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to calculate the cross product of the passed arrays containing the direction ratios of the two mathematical vectors.  <br /></td></tr>
 <tr class="separator:a225732399c5c076976eae5b180a9f8c9"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a4b2a9757a87c18e1642d72410ecfaba8" id="r_a4b2a9757a87c18e1642d72410ecfaba8"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4b2a9757a87c18e1642d72410ecfaba8">math::vector_cross::mag</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 3 &gt; &amp;vec)</td></tr>
+<tr class="memitem:a4b2a9757a87c18e1642d72410ecfaba8" id="r_a4b2a9757a87c18e1642d72410ecfaba8"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4b2a9757a87c18e1642d72410ecfaba8">math::vector_cross::mag</a> (const std::array&lt; double, 3 &gt; &amp;vec)</td></tr>
 <tr class="memdesc:a4b2a9757a87c18e1642d72410ecfaba8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Calculates the magnitude of the mathematical vector from it's direction ratios.  <br /></td></tr>
 <tr class="separator:a4b2a9757a87c18e1642d72410ecfaba8"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -162,6 +181,8 @@ Example:</h3>
 <p>An example of a running instance of the executable program:</p>
 <p>Pass the first Vector: 1 2 3 Pass the second Vector: 4 5 6 The cross product is: -3 6 -3 Magnitude: 7.34847</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Shreyas-OwO" target="_blank">Shreyas Sable</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../df/d66/vector__cross__product_8cpp_source.html">vector_cross_product.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a225732399c5c076976eae5b180a9f8c9" name="a225732399c5c076976eae5b180a9f8c9"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a225732399c5c076976eae5b180a9f8c9">&#9670;&#160;</a></span>cross()</h2>
@@ -170,14 +191,14 @@ Example:</h3>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 3 &gt; math::vector_cross::cross </td>
+          <td class="memname">std::array&lt; double, 3 &gt; math::vector_cross::cross </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 3 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
+          <td class="paramtype">const std::array&lt; double, 3 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>A</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 3 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
+          <td class="paramtype">const std::array&lt; double, 3 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>B</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -192,21 +213,16 @@ Example:</h3>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the direction ratios of the cross product. </dd></dl>
 <p>Performs the cross product as shown in @algorithm.</p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d66/vector__cross__product_8cpp_source.html#l00069">69</a> of file <a class="el" href="../../df/d66/vector__cross__product_8cpp_source.html">vector_cross_product.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   69</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/array.html">std::array&lt;double, 3&gt;</a> product;<span class="comment"></span></div>
-<div class="line"><span class="lineno">   71</span><span class="comment">            /// Performs the cross product as shown in @algorithm.</span></div>
-<div class="line"><span class="lineno">   72</span><span class="comment"></span>            product[0] = (A[1] * B[2]) - (A[2] * B[1]);</div>
+<div class="line"><span class="lineno">   70</span>            std::array&lt;double, 3&gt; product;</div>
+<div class="line"><span class="lineno">   72</span>            product[0] = (A[1] * B[2]) - (A[2] * B[1]);</div>
 <div class="line"><span class="lineno">   73</span>            product[1] = -((A[0] * B[2]) - (A[2] * B[0]));</div>
 <div class="line"><span class="lineno">   74</span>            product[2] = (A[0] * B[1]) - (A[1] * B[0]);</div>
 <div class="line"><span class="lineno">   75</span>            <span class="keywordflow">return</span> product;</div>
 <div class="line"><span class="lineno">   76</span>        }</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d66/vector__cross__product_8cpp_a225732399c5c076976eae5b180a9f8c9_cgraph.svg" width="144" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a4b2a9757a87c18e1642d72410ecfaba8" name="a4b2a9757a87c18e1642d72410ecfaba8"></a>
@@ -218,7 +234,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">double math::vector_cross::mag </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; double, 3 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>vec</em></span></td><td>)</td>
+          <td class="paramtype">const std::array&lt; double, 3 &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>vec</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -232,17 +248,13 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>type: double description: the magnitude of the mathematical vector from the given direction ratios. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d66/vector__cross__product_8cpp_source.html#l00083">83</a> of file <a class="el" href="../../df/d66/vector__cross__product_8cpp_source.html">vector_cross_product.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   83</span>                                                   {</div>
-<div class="line"><span class="lineno">   84</span>            <span class="keywordtype">double</span> magnitude = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">sqrt</a>((vec[0] * vec[0]) + (vec[1] * vec[1]) + (vec[2] * vec[2]));</div>
+<div class="line"><span class="lineno">   84</span>            <span class="keywordtype">double</span> magnitude = sqrt((vec[0] * vec[0]) + (vec[1] * vec[1]) + (vec[2] * vec[2]));</div>
 <div class="line"><span class="lineno">   85</span>            <span class="keywordflow">return</span> magnitude;</div>
 <div class="line"><span class="lineno">   86</span>        }</div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d66/vector__cross__product_8cpp_a4b2a9757a87c18e1642d72410ecfaba8_cgraph.svg" width="178" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
@@ -261,49 +273,38 @@ Here is the call graph for this function:</div>
 </div><div class="memdoc">
 
 <p>Main Function. </p>
-<p>Asks the user to enter the direction ratios for each of the two mathematical vectors using <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> </p><dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+<p>Asks the user to enter the direction ratios for each of the two mathematical vectors using std::cin </p><dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
 <p>Tests the functions with sample input before asking for user input.</p>
 <p>Gets the values for the first vector.</p>
 <p>Gets the values for the second vector.</p>
 <p>Displays the output out.</p>
 <p>Displays the magnitude of the cross product.</p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d66/vector__cross__product_8cpp_source.html#l00109">109</a> of file <a class="el" href="../../df/d66/vector__cross__product_8cpp_source.html">vector_cross_product.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  109</span>           {</div>
-<div class="line"><span class="lineno">  110</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  111</span><span class="comment">    /// Tests the functions with sample input before asking for user input.</span></div>
-<div class="line"><span class="lineno">  112</span><span class="comment"></span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
+<div class="line"><span class="lineno">  110</span> </div>
+<div class="line"><span class="lineno">  112</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
 <div class="line"><span class="lineno">  113</span> </div>
-<div class="line"><span class="lineno">  114</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a> vec1;</div>
-<div class="line"><span class="lineno">  115</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a> vec2;</div>
-<div class="line"><span class="lineno">  116</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  117</span><span class="comment">    /// Gets the values for the first vector.</span></div>
-<div class="line"><span class="lineno">  118</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPass the first Vector: &quot;</span>;</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_istream.html">std::cin</a> &gt;&gt; vec1[0] &gt;&gt; vec1[1] &gt;&gt; vec1[2];</div>
-<div class="line"><span class="lineno">  120</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  121</span><span class="comment">    /// Gets the values for the second vector.</span></div>
-<div class="line"><span class="lineno">  122</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nPass the second Vector: &quot;</span>;</div>
-<div class="line"><span class="lineno">  123</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; vec2[0] &gt;&gt; vec2[1] &gt;&gt; vec2[2];</div>
-<div class="line"><span class="lineno">  124</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  125</span><span class="comment">    /// Displays the output out.</span></div>
-<div class="line"><span class="lineno">  126</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a> product = <a class="code hl_function" href="#a225732399c5c076976eae5b180a9f8c9">math::vector_cross::cross</a>(vec1, vec2);</div>
-<div class="line"><span class="lineno">  127</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nThe cross product is: &quot;</span> &lt;&lt; product[0] &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; product[1] &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; product[2] &lt;&lt; <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">  128</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  129</span><span class="comment">    /// Displays the magnitude of the cross product.</span></div>
-<div class="line"><span class="lineno">  130</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Magnitude: &quot;</span> &lt;&lt; <a class="code hl_function" href="#a4b2a9757a87c18e1642d72410ecfaba8">math::vector_cross::mag</a>(product) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span> &lt;&lt; <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">  114</span>    std::array&lt;double, 3&gt; vec1;</div>
+<div class="line"><span class="lineno">  115</span>    std::array&lt;double, 3&gt; vec2;</div>
+<div class="line"><span class="lineno">  116</span> </div>
+<div class="line"><span class="lineno">  118</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPass the first Vector: &quot;</span>;</div>
+<div class="line"><span class="lineno">  119</span>    std::cin &gt;&gt; vec1[0] &gt;&gt; vec1[1] &gt;&gt; vec1[2];</div>
+<div class="line"><span class="lineno">  120</span> </div>
+<div class="line"><span class="lineno">  122</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPass the second Vector: &quot;</span>;</div>
+<div class="line"><span class="lineno">  123</span>    std::cin &gt;&gt; vec2[0] &gt;&gt; vec2[1] &gt;&gt; vec2[2];</div>
+<div class="line"><span class="lineno">  124</span> </div>
+<div class="line"><span class="lineno">  126</span>    std::array&lt;double, 3&gt; product = <a class="code hl_function" href="#a225732399c5c076976eae5b180a9f8c9">math::vector_cross::cross</a>(vec1, vec2);</div>
+<div class="line"><span class="lineno">  127</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nThe cross product is: &quot;</span> &lt;&lt; product[0] &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; product[1] &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; product[2] &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  128</span> </div>
+<div class="line"><span class="lineno">  130</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Magnitude: &quot;</span> &lt;&lt; <a class="code hl_function" href="#a4b2a9757a87c18e1642d72410ecfaba8">math::vector_cross::mag</a>(product) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  131</span> </div>
 <div class="line"><span class="lineno">  132</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  133</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="avector__cross__product_8cpp_html_a225732399c5c076976eae5b180a9f8c9"><div class="ttname"><a href="#a225732399c5c076976eae5b180a9f8c9">math::vector_cross::cross</a></div><div class="ttdeci">std::array&lt; double, 3 &gt; cross(const std::array&lt; double, 3 &gt; &amp;A, const std::array&lt; double, 3 &gt; &amp;B)</div><div class="ttdoc">Function to calculate the cross product of the passed arrays containing the direction ratios of the t...</div><div class="ttdef"><b>Definition</b> vector_cross_product.cpp:69</div></div>
-<div class="ttc" id="avector__cross__product_8cpp_html_a4b2a9757a87c18e1642d72410ecfaba8"><div class="ttname"><a href="#a4b2a9757a87c18e1642d72410ecfaba8">math::vector_cross::mag</a></div><div class="ttdeci">double mag(const std::array&lt; double, 3 &gt; &amp;vec)</div><div class="ttdoc">Calculates the magnitude of the mathematical vector from it's direction ratios.</div><div class="ttdef"><b>Definition</b> vector_cross_product.cpp:83</div></div>
-<div class="ttc" id="avector__cross__product_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">namespace math</div><div class="ttdef"><b>Definition</b> vector_cross_product.cpp:94</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d66/vector__cross__product_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="180" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="avector__cross__product_8cpp_html_a225732399c5c076976eae5b180a9f8c9"><div class="ttname"><a href="#a225732399c5c076976eae5b180a9f8c9">math::vector_cross::cross</a></div><div class="ttdeci">std::array&lt; double, 3 &gt; cross(const std::array&lt; double, 3 &gt; &amp;A, const std::array&lt; double, 3 &gt; &amp;B)</div><div class="ttdoc">Function to calculate the cross product of the passed arrays containing the direction ratios of the t...</div><div class="ttdef"><b>Definition</b> <a href="../../df/d66/vector__cross__product_8cpp_source.html#l00069">vector_cross_product.cpp:69</a></div></div>
+<div class="ttc" id="avector__cross__product_8cpp_html_a4b2a9757a87c18e1642d72410ecfaba8"><div class="ttname"><a href="#a4b2a9757a87c18e1642d72410ecfaba8">math::vector_cross::mag</a></div><div class="ttdeci">double mag(const std::array&lt; double, 3 &gt; &amp;vec)</div><div class="ttdoc">Calculates the magnitude of the mathematical vector from it's direction ratios.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d66/vector__cross__product_8cpp_source.html#l00083">vector_cross_product.cpp:83</a></div></div>
+<div class="ttc" id="avector__cross__product_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">namespace math</div><div class="ttdef"><b>Definition</b> <a href="../../df/d66/vector__cross__product_8cpp_source.html#l00094">vector_cross_product.cpp:94</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -334,13 +335,13 @@ Here is the call graph for this function:</div>
 <p>test the cross() and the mag() functions. </p>
 <p>Tests the cross() function.</p>
 <p>Tests the mag() function.</p>
-<div class="fragment"><div class="line"><span class="lineno">   94</span>                   {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   95</span><span class="comment">    /// Tests the cross() function.</span></div>
-<div class="line"><span class="lineno">   96</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 3&gt;</a> t_vec = <a class="code hl_function" href="#a225732399c5c076976eae5b180a9f8c9">math::vector_cross::cross</a>({1, 2, 3}, {4, 5, 6});</div>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d66/vector__cross__product_8cpp_source.html#l00094">94</a> of file <a class="el" href="../../df/d66/vector__cross__product_8cpp_source.html">vector_cross_product.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   94</span>                   {</div>
+<div class="line"><span class="lineno">   96</span>    std::array&lt;double, 3&gt; t_vec = <a class="code hl_function" href="#a225732399c5c076976eae5b180a9f8c9">math::vector_cross::cross</a>({1, 2, 3}, {4, 5, 6});</div>
 <div class="line"><span class="lineno">   97</span>    assert(t_vec[0] == -3 &amp;&amp; t_vec[1] == 6 &amp;&amp; t_vec[2] == -3);</div>
-<div class="line"><span class="lineno">   98</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   99</span><span class="comment">    /// Tests the mag() function.</span></div>
-<div class="line"><span class="lineno">  100</span><span class="comment"></span>    <span class="keywordtype">double</span> t_mag = <a class="code hl_function" href="#a4b2a9757a87c18e1642d72410ecfaba8">math::vector_cross::mag</a>({6, 8, 0});</div>
+<div class="line"><span class="lineno">   98</span> </div>
+<div class="line"><span class="lineno">  100</span>    <span class="keywordtype">double</span> t_mag = <a class="code hl_function" href="#a4b2a9757a87c18e1642d72410ecfaba8">math::vector_cross::mag</a>({6, 8, 0});</div>
 <div class="line"><span class="lineno">  101</span>    assert(t_mag == 10);</div>
 <div class="line"><span class="lineno">  102</span>}</div>
 </div><!-- fragment -->
diff --git a/df/d66/vector__cross__product_8cpp_a225732399c5c076976eae5b180a9f8c9_cgraph.map b/df/d66/vector__cross__product_8cpp_a225732399c5c076976eae5b180a9f8c9_cgraph.map
deleted file mode 100644
index bcb363219..000000000
--- a/df/d66/vector__cross__product_8cpp_a225732399c5c076976eae5b180a9f8c9_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="math::vector_cross::cross" name="math::vector_cross::cross">
-<area shape="rect" id="Node000001" title="Function to calculate the cross product of the passed arrays containing the direction ratios of the t..." alt="" coords="5,29,139,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="46,29,45,20,49,11,58,5,72,3,87,5,96,12,93,16,85,10,72,8,60,10,53,14,50,20,51,28"/>
-</map>
diff --git a/df/d66/vector__cross__product_8cpp_a225732399c5c076976eae5b180a9f8c9_cgraph.md5 b/df/d66/vector__cross__product_8cpp_a225732399c5c076976eae5b180a9f8c9_cgraph.md5
deleted file mode 100644
index f06d894de..000000000
--- a/df/d66/vector__cross__product_8cpp_a225732399c5c076976eae5b180a9f8c9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-fbc9c89b82d64d40b1245384749c8a57
\ No newline at end of file
diff --git a/df/d66/vector__cross__product_8cpp_a225732399c5c076976eae5b180a9f8c9_cgraph.svg b/df/d66/vector__cross__product_8cpp_a225732399c5c076976eae5b180a9f8c9_cgraph.svg
deleted file mode 100644
index 1b1ec2cec..000000000
--- a/df/d66/vector__cross__product_8cpp_a225732399c5c076976eae5b180a9f8c9_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::vector_cross::cross Pages: 1 -->
-<svg width="108pt" height="57pt"
- viewBox="0.00 0.00 108.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::vector_cross::cross</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to calculate the cross product of the passed arrays containing the direction ratios of the t...">
-<polygon fill="#999999" stroke="#666666" points="100,-30.5 0,-30.5 0,0 100,0 100,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::vector_cross</text>
-<text text-anchor="middle" x="50" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::cross</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.28,-30.99C28.66,-40.06 34.57,-48.5 50,-48.5 58.44,-48.5 64.03,-45.97 66.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.24,-42.75 67.59,-32.49 63.26,-42.16 70.24,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d66/vector__cross__product_8cpp_a225732399c5c076976eae5b180a9f8c9_cgraph_org.svg b/df/d66/vector__cross__product_8cpp_a225732399c5c076976eae5b180a9f8c9_cgraph_org.svg
deleted file mode 100644
index 05e21f862..000000000
--- a/df/d66/vector__cross__product_8cpp_a225732399c5c076976eae5b180a9f8c9_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::vector_cross::cross Pages: 1 -->
-<svg width="108pt" height="57pt"
- viewBox="0.00 0.00 108.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::vector_cross::cross</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function to calculate the cross product of the passed arrays containing the direction ratios of the t...">
-<polygon fill="#999999" stroke="#666666" points="100,-30.5 0,-30.5 0,0 100,0 100,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::vector_cross</text>
-<text text-anchor="middle" x="50" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::cross</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.28,-30.99C28.66,-40.06 34.57,-48.5 50,-48.5 58.44,-48.5 64.03,-45.97 66.77,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="70.24,-42.75 67.59,-32.49 63.26,-42.16 70.24,-42.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d66/vector__cross__product_8cpp_a4b2a9757a87c18e1642d72410ecfaba8_cgraph.map b/df/d66/vector__cross__product_8cpp_a4b2a9757a87c18e1642d72410ecfaba8_cgraph.map
deleted file mode 100644
index 32b28e1f6..000000000
--- a/df/d66/vector__cross__product_8cpp_a4b2a9757a87c18e1642d72410ecfaba8_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="math::vector_cross::mag" name="math::vector_cross::mag">
-<area shape="rect" id="Node000001" title="Calculates the magnitude of the mathematical vector from it&#39;s direction ratios." alt="" coords="5,29,172,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="60,30,55,21,58,11,70,5,89,3,109,5,119,12,117,16,107,10,88,8,71,10,62,15,60,20,65,28"/>
-</map>
diff --git a/df/d66/vector__cross__product_8cpp_a4b2a9757a87c18e1642d72410ecfaba8_cgraph.md5 b/df/d66/vector__cross__product_8cpp_a4b2a9757a87c18e1642d72410ecfaba8_cgraph.md5
deleted file mode 100644
index 2d0651c5f..000000000
--- a/df/d66/vector__cross__product_8cpp_a4b2a9757a87c18e1642d72410ecfaba8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ab3c29ea72945fcd6f2da7ac6ec5e811
\ No newline at end of file
diff --git a/df/d66/vector__cross__product_8cpp_a4b2a9757a87c18e1642d72410ecfaba8_cgraph.svg b/df/d66/vector__cross__product_8cpp_a4b2a9757a87c18e1642d72410ecfaba8_cgraph.svg
deleted file mode 100644
index b8000d694..000000000
--- a/df/d66/vector__cross__product_8cpp_a4b2a9757a87c18e1642d72410ecfaba8_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::vector_cross::mag Pages: 1 -->
-<svg width="133pt" height="45pt"
- viewBox="0.00 0.00 132.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>math::vector_cross::mag</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Calculates the magnitude of the mathematical vector from it&#39;s direction ratios.">
-<polygon fill="#999999" stroke="#666666" points="124.75,-19.25 0,-19.25 0,0 124.75,0 124.75,-19.25"/>
-<text text-anchor="middle" x="62.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::vector_cross::mag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.84,-19.54C33.94,-28.15 40.45,-37.25 62.38,-37.25 74.37,-37.25 81.75,-34.53 84.52,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.95,-29.95 82.25,-21.01 81.13,-31.55 87.95,-29.95"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d66/vector__cross__product_8cpp_a4b2a9757a87c18e1642d72410ecfaba8_cgraph_org.svg b/df/d66/vector__cross__product_8cpp_a4b2a9757a87c18e1642d72410ecfaba8_cgraph_org.svg
deleted file mode 100644
index b0729f2df..000000000
--- a/df/d66/vector__cross__product_8cpp_a4b2a9757a87c18e1642d72410ecfaba8_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::vector_cross::mag Pages: 1 -->
-<svg width="133pt" height="45pt"
- viewBox="0.00 0.00 132.75 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>math::vector_cross::mag</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Calculates the magnitude of the mathematical vector from it&#39;s direction ratios.">
-<polygon fill="#999999" stroke="#666666" points="124.75,-19.25 0,-19.25 0,0 124.75,0 124.75,-19.25"/>
-<text text-anchor="middle" x="62.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">math::vector_cross::mag</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.84,-19.54C33.94,-28.15 40.45,-37.25 62.38,-37.25 74.37,-37.25 81.75,-34.53 84.52,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.95,-29.95 82.25,-21.01 81.13,-31.55 87.95,-29.95"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d66/vector__cross__product_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/d66/vector__cross__product_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index e433d4c55..000000000
--- a/df/d66/vector__cross__product_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main Function." alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,5,174,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,35,87,27,88,33,56,40"/>
-<area shape="rect" id="Node000003" href="$df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="namespace math" alt="" coords="117,55,160,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,46,102,57,101,62,55,52"/>
-</map>
diff --git a/df/d66/vector__cross__product_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/d66/vector__cross__product_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index ada782579..000000000
--- a/df/d66/vector__cross__product_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-99b196c3a8a9d36b647c3ba154635fc5
\ No newline at end of file
diff --git a/df/d66/vector__cross__product_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/d66/vector__cross__product_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 41bb1e5e3..000000000
--- a/df/d66/vector__cross__product_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="64pt"
- viewBox="0.00 0.00 134.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main Function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-56.25 73,-56.25 73,-37 126.5,-37 126.5,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.64,-33.65 53.16,-35.69 61.53,-37.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.71,-41.1 71.25,-40.03 62.34,-34.3 60.71,-41.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="namespace math">
-<polygon fill="white" stroke="#666666" points="116,-19.25 83.5,-19.25 83.5,0 116,0 116,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C47.72,-21.22 60.73,-18.26 72.13,-15.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.79,-19.11 81.77,-13.48 71.24,-12.28 72.79,-19.11"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d66/vector__cross__product_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/d66/vector__cross__product_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 160d69c59..000000000
--- a/df/d66/vector__cross__product_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="135pt" height="64pt"
- viewBox="0.00 0.00 134.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main Function.">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="126.5,-56.25 73,-56.25 73,-37 126.5,-37 126.5,-56.25"/>
-<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.64,-33.65 53.16,-35.69 61.53,-37.7"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.71,-41.1 71.25,-40.03 62.34,-34.3 60.71,-41.1"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="namespace math">
-<polygon fill="white" stroke="#666666" points="116,-19.25 83.5,-19.25 83.5,0 116,0 116,-19.25"/>
-<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C47.72,-21.22 60.73,-18.26 72.13,-15.67"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="72.79,-19.11 81.77,-13.48 71.24,-12.28 72.79,-19.11"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d66/vector__cross__product_8cpp_source.html b/df/d66/vector__cross__product_8cpp_source.html
new file mode 100644
index 000000000..01b088400
--- /dev/null
+++ b/df/d66/vector__cross__product_8cpp_source.html
@@ -0,0 +1,202 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/vector_cross_product.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/d66/vector__cross__product_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">vector_cross_product.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../df/d66/vector__cross__product_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="preprocessor">#include &lt;array&gt;</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span> </div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keyword">namespace </span><a class="code hl_namespace" href="../../d4/d91/namespacevector__cross.html">vector_cross</a> {</div>
+<div class="foldopen" id="foldopen00069" data-start="{" data-end="}">
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="../../df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9">   69</a></span>        std::array&lt;double, 3&gt; <a class="code hl_function" href="../../df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9">cross</a>(<span class="keyword">const</span> std::array&lt;double, 3&gt; &amp;A, <span class="keyword">const</span> std::array&lt;double, 3&gt; &amp;B) {</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>            std::array&lt;double, 3&gt; product;</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>            product[0] = (A[1] * B[2]) - (A[2] * B[1]);</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>            product[1] = -((A[0] * B[2]) - (A[2] * B[0]));</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>            product[2] = (A[0] * B[1]) - (A[1] * B[0]);</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>            <span class="keywordflow">return</span> product;</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>        }</div>
+</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="foldopen" id="foldopen00083" data-start="{" data-end="}">
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"><a class="line" href="../../df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8">   83</a></span>        <span class="keywordtype">double</span> <a class="code hl_function" href="../../df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8">mag</a>(<span class="keyword">const</span> std::array&lt;double, 3&gt; &amp;vec) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            <span class="keywordtype">double</span> magnitude = sqrt((vec[0] * vec[0]) + (vec[1] * vec[1]) + (vec[2] * vec[2]));</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>            <span class="keywordflow">return</span> magnitude;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        }</div>
+</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    } </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>} </div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span> </div>
+<div class="foldopen" id="foldopen00094" data-start="{" data-end="}">
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"><a class="line" href="../../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   94</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    std::array&lt;double, 3&gt; t_vec = math::vector_cross::cross({1, 2, 3}, {4, 5, 6});</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    assert(t_vec[0] == -3 &amp;&amp; t_vec[1] == 6 &amp;&amp; t_vec[2] == -3);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span> </div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <span class="keywordtype">double</span> t_mag = math::vector_cross::mag({6, 8, 0});</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    assert(t_mag == 10);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>}</div>
+</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
+<div class="foldopen" id="foldopen00109" data-start="{" data-end="}">
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"><a class="line" href="../../df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  109</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span> </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <a class="code hl_function" href="../../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span> </div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::array&lt;double, 3&gt; vec1;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    std::array&lt;double, 3&gt; vec2;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span> </div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPass the first Vector: &quot;</span>;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    std::cin &gt;&gt; vec1[0] &gt;&gt; vec1[1] &gt;&gt; vec1[2];</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span> </div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nPass the second Vector: &quot;</span>;</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    std::cin &gt;&gt; vec2[0] &gt;&gt; vec2[1] &gt;&gt; vec2[2];</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span> </div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    std::array&lt;double, 3&gt; product = math::vector_cross::cross(vec1, vec2);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;\nThe cross product is: &quot;</span> &lt;&lt; product[0] &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; product[1] &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; product[2] &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Magnitude: &quot;</span> &lt;&lt; math::vector_cross::mag(product) &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>}</div>
+</div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacevector__cross_html"><div class="ttname"><a href="../../d4/d91/namespacevector__cross.html">vector_cross</a></div><div class="ttdoc">Functions for Vector Cross Product algorithms.</div></div>
+<div class="ttc" id="avector__cross__product_8cpp_html_a225732399c5c076976eae5b180a9f8c9"><div class="ttname"><a href="../../df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9">math::vector_cross::cross</a></div><div class="ttdeci">std::array&lt; double, 3 &gt; cross(const std::array&lt; double, 3 &gt; &amp;A, const std::array&lt; double, 3 &gt; &amp;B)</div><div class="ttdoc">Function to calculate the cross product of the passed arrays containing the direction ratios of the t...</div><div class="ttdef"><b>Definition</b> <a href="#l00069">vector_cross_product.cpp:69</a></div></div>
+<div class="ttc" id="avector__cross__product_8cpp_html_a4b2a9757a87c18e1642d72410ecfaba8"><div class="ttname"><a href="../../df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8">math::vector_cross::mag</a></div><div class="ttdeci">double mag(const std::array&lt; double, 3 &gt; &amp;vec)</div><div class="ttdoc">Calculates the magnitude of the mathematical vector from it's direction ratios.</div><div class="ttdef"><b>Definition</b> <a href="#l00083">vector_cross_product.cpp:83</a></div></div>
+<div class="ttc" id="avector__cross__product_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">namespace math</div><div class="ttdef"><b>Definition</b> <a href="#l00094">vector_cross_product.cpp:94</a></div></div>
+<div class="ttc" id="avector__cross__product_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main Function.</div><div class="ttdef"><b>Definition</b> <a href="#l00109">vector_cross_product.cpp:109</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../df/d66/vector__cross__product_8cpp.html">vector_cross_product.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html
index cdb3d67d7..b119b037f 100644
--- a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html
+++ b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ciphers::elliptic_curve_key_exchange Namespace Reference</title>
+<title>TheAlgorithms/C++: ciphers::elliptic_curve_key_exchange Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -205,9 +222,11 @@ Functions</h2></td></tr>
 <p>value zero</p>
 <p>slope when the line is tangent to curve. This operation is performed while doubling. Taking derivative of <code>y^2 = x^3 + ax + b</code> =&gt; <code>2y dy = (3 * x^2 + a)dx</code> =&gt; <code>(dy/dx) = (3x^2 + a)/(2y)</code></p>
 <p>if y co-ordinate is zero, the slope is infinite, return inf. else calculate the slope (here % mod and store in lambda)</p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00110">110</a> of file <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html">elliptic_curve_key_exchange.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  111</span>                              {</div>
-<div class="line"><span class="lineno">  112</span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> lambda(0);  <span class="comment">/// Slope</span></div>
-<div class="line"><span class="lineno">  113</span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> zero(0);    <span class="comment">/// value zero</span></div>
+<div class="line"><span class="lineno">  112</span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> lambda(0);  </div>
+<div class="line"><span class="lineno">  113</span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> zero(0);    </div>
 <div class="line"><span class="lineno">  114</span>    lambda = zero = 0;</div>
 <div class="line"><span class="lineno">  115</span>    <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> inf = ~zero;</div>
 <div class="line"><span class="lineno">  116</span>    <span class="keywordflow">if</span> (a.x != b.x || a.y != b.y) {</div>
@@ -217,17 +236,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  120</span>        }</div>
 <div class="line"><span class="lineno">  121</span>        <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> num = (b.y - a.y + mod), den = (b.x - a.x + mod);</div>
 <div class="line"><span class="lineno">  122</span>        lambda = (num * (exp(den, mod - 2, mod))) % mod;</div>
-<div class="line"><span class="lineno">  123</span>    } <span class="keywordflow">else</span> {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  124</span><span class="comment">        /**</span></div>
-<div class="line"><span class="lineno">  125</span><span class="comment">         *  slope when the line is tangent to curve. This operation is performed</span></div>
-<div class="line"><span class="lineno">  126</span><span class="comment">         * while doubling. Taking derivative of `y^2 = x^3 + ax + b`</span></div>
-<div class="line"><span class="lineno">  127</span><span class="comment">         * =&gt; `2y dy = (3 * x^2 + a)dx`</span></div>
-<div class="line"><span class="lineno">  128</span><span class="comment">         * =&gt; `(dy/dx) = (3x^2 + a)/(2y)`</span></div>
-<div class="line"><span class="lineno">  129</span><span class="comment">         */</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">  130</span><span class="comment">        /**</span></div>
-<div class="line"><span class="lineno">  131</span><span class="comment">         * if y co-ordinate is zero, the slope is infinite, return inf.</span></div>
-<div class="line"><span class="lineno">  132</span><span class="comment">         * else calculate the slope (here % mod and store in lambda)</span></div>
-<div class="line"><span class="lineno">  133</span><span class="comment">         */</span></div>
+<div class="line"><span class="lineno">  123</span>    } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">  134</span>        <span class="keywordflow">if</span> (!a.y) {</div>
 <div class="line"><span class="lineno">  135</span>            <span class="keywordflow">return</span> {inf, inf};</div>
 <div class="line"><span class="lineno">  136</span>        }</div>
@@ -238,7 +247,7 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  141</span>        <span class="comment">// Mulitply by 2 adjustment</span></div>
 <div class="line"><span class="lineno">  142</span>        <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a> a_2 = (a.y &lt;&lt; 1);</div>
 <div class="line"><span class="lineno">  143</span>        lambda =</div>
-<div class="line"><span class="lineno">  144</span>            (((axsq + curve_a_coeff) % mod) * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">exp</a>(a_2, mod - 2, mod)) % mod;</div>
+<div class="line"><span class="lineno">  144</span>            (((axsq + curve_a_coeff) % mod) * <a class="code hl_function" href="#ac00616a4e40d3cd5cfb4da87d9ff9af0">exp</a>(a_2, mod - 2, mod)) % mod;</div>
 <div class="line"><span class="lineno">  145</span>    }</div>
 <div class="line"><span class="lineno">  146</span>    <a class="code hl_struct" href="../../d8/dc8/struct_point.html">Point</a> c;</div>
 <div class="line"><span class="lineno">  147</span>    <span class="comment">// new point: x = ((lambda^2) - x1 - x2)</span></div>
@@ -247,16 +256,11 @@ Functions</h2></td></tr>
 <div class="line"><span class="lineno">  150</span>    c.<a class="code hl_variable" href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">y</a> = (((lambda * (a.x + mod - c.x)) % mod) + mod - a.y) % mod;</div>
 <div class="line"><span class="lineno">  151</span>    <span class="keywordflow">return</span> c;</div>
 <div class="line"><span class="lineno">  152</span>}</div>
-<div class="ttc" id="aclassuint256__t_html"><div class="ttname"><a href="../../d1/d83/classuint256__t.html">uint256_t</a></div><div class="ttdoc">class for 256-bit unsigned integer</div><div class="ttdef"><b>Definition</b> uint256_t.hpp:33</div></div>
-<div class="ttc" id="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div>
-<div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:12</div></div>
-<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> line_segment_intersection.cpp:14</div></div>
-</div><!-- 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="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_acc5fe9c2032fb7582c38a20d1fa69bcf_cgraph.svg" width="591" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassuint256__t_html"><div class="ttname"><a href="../../d1/d83/classuint256__t.html">uint256_t</a></div><div class="ttdoc">class for 256-bit unsigned integer</div><div class="ttdef"><b>Definition</b> <a href="../../da/da3/uint256__t_8hpp_source.html#l00033">uint256_t.hpp:33</a></div></div>
+<div class="ttc" id="anamespaceciphers_1_1elliptic__curve__key__exchange_html_ac00616a4e40d3cd5cfb4da87d9ff9af0"><div class="ttname"><a href="#ac00616a4e40d3cd5cfb4da87d9ff9af0">ciphers::elliptic_curve_key_exchange::exp</a></div><div class="ttdeci">uint256_t exp(uint256_t number, uint256_t power, const uint256_t &amp;mod)</div><div class="ttdoc">This function calculates number raised to exponent power under modulo mod using Modular Exponentiatio...</div><div class="ttdef"><b>Definition</b> <a href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00078">elliptic_curve_key_exchange.cpp:78</a></div></div>
+<div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition</b> <a href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00012">line_segment_intersection.cpp:12</a></div></div>
+<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d6c/line__segment__intersection_8cpp_source.html#l00014">line_segment_intersection.cpp:14</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac00616a4e40d3cd5cfb4da87d9ff9af0" name="ac00616a4e40d3cd5cfb4da87d9ff9af0"></a>
@@ -293,6 +297,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>number raised to power modulo mod </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00078">78</a> of file <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html">elliptic_curve_key_exchange.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   78</span>                                                                       {</div>
 <div class="line"><span class="lineno">   79</span>    <span class="keywordflow">if</span> (!<a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a>) {</div>
 <div class="line"><span class="lineno">   80</span>        <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/d83/classuint256__t.html">uint256_t</a>(1);</div>
@@ -310,13 +316,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   92</span>    }</div>
 <div class="line"><span class="lineno">   93</span>    <span class="keywordflow">return</span> ans;</div>
 <div class="line"><span class="lineno">   94</span>}</div>
-<div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae249a2af508aa94266023ce8aa81426f"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a></div><div class="ttdeci">void power(int x, int n)</div><div class="ttdef"><b>Definition</b> power_for_huge_numbers.cpp:56</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_ac00616a4e40d3cd5cfb4da87d9ff9af0_cgraph.svg" width="378" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae249a2af508aa94266023ce8aa81426f"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a></div><div class="ttdeci">void power(int x, int n)</div><div class="ttdef"><b>Definition</b> <a href="../../df/def/power__for__huge__numbers_8cpp_source.html#l00056">power_for_huge_numbers.cpp:56</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a17f3d667241b88115a95282cdd719cb2" name="a17f3d667241b88115a95282cdd719cb2"></a>
@@ -359,6 +360,8 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>the resultant point </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00165">165</a> of file <a class="el" href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html">elliptic_curve_key_exchange.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  166</span>                                     {</div>
 <div class="line"><span class="lineno">  167</span>    <a class="code hl_struct" href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> N = a;</div>
 <div class="line"><span class="lineno">  168</span>    N.x %= mod;</div>
@@ -382,15 +385,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  186</span>    }</div>
 <div class="line"><span class="lineno">  187</span>    <span class="keywordflow">return</span> Q;</div>
 <div class="line"><span class="lineno">  188</span>}</div>
-<div class="ttc" id="anamespaceciphers_1_1elliptic__curve__key__exchange_html_acc5fe9c2032fb7582c38a20d1fa69bcf"><div class="ttname"><a href="#acc5fe9c2032fb7582c38a20d1fa69bcf">ciphers::elliptic_curve_key_exchange::addition</a></div><div class="ttdeci">Point addition(Point a, Point b, const uint256_t &amp;curve_a_coeff, uint256_t mod)</div><div class="ttdoc">Addition of points.</div><div class="ttdef"><b>Definition</b> elliptic_curve_key_exchange.cpp:110</div></div>
-<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> sparse_table.cpp:48</div></div>
-<div class="ttc" id="astructciphers_1_1elliptic__curve__key__exchange_1_1_point_html"><div class="ttname"><a href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">ciphers::elliptic_curve_key_exchange::Point</a></div><div class="ttdoc">Definition of struct Point.</div><div class="ttdef"><b>Definition</b> elliptic_curve_key_exchange.cpp:46</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph.svg" width="100%" height="300"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="anamespaceciphers_1_1elliptic__curve__key__exchange_html_acc5fe9c2032fb7582c38a20d1fa69bcf"><div class="ttname"><a href="#acc5fe9c2032fb7582c38a20d1fa69bcf">ciphers::elliptic_curve_key_exchange::addition</a></div><div class="ttdeci">Point addition(Point a, Point b, const uint256_t &amp;curve_a_coeff, uint256_t mod)</div><div class="ttdoc">Addition of points.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00110">elliptic_curve_key_exchange.cpp:110</a></div></div>
+<div class="ttc" id="asparse__table_8cpp_html_a10f3ffb3f6f7e1b83d556b9c8de89a5d"><div class="ttname"><a href="../../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d">data_structures::sparse_table::N</a></div><div class="ttdeci">constexpr uint32_t N</div><div class="ttdoc">A struct to represent sparse table for min() as their invariant function, for the given array A....</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dab/sparse__table_8cpp_source.html#l00048">sparse_table.cpp:48</a></div></div>
+<div class="ttc" id="astructciphers_1_1elliptic__curve__key__exchange_1_1_point_html"><div class="ttname"><a href="../../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">ciphers::elliptic_curve_key_exchange::Point</a></div><div class="ttdoc">Definition of struct Point.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d2c/elliptic__curve__key__exchange_8cpp_source.html#l00046">elliptic_curve_key_exchange.cpp:46</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph.map b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph.map
deleted file mode 100644
index 73a9f4925..000000000
--- a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="ciphers::elliptic_curve_key_exchange::multiply" name="ciphers::elliptic_curve_key_exchange::multiply">
-<area shape="rect" id="Node000001" title="multiply Point and integer" alt="" coords="5,5,171,46"/>
-<area shape="rect" id="Node000002" href="$df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf" title="Addition of points." alt="" coords="219,5,384,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="171,23,203,23,203,28,171,28"/>
-<area shape="rect" id="Node000003" href="$df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0" title="This function calculates number raised to exponent power under modulo mod using Modular Exponentiatio..." alt="" coords="432,5,579,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="384,23,417,23,417,28,384,28"/>
-<area shape="rect" id="Node000004" href="$df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" title=" " alt="" coords="627,13,684,38"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="580,23,612,23,612,28,580,28"/>
-<area shape="rect" id="Node000005" href="$df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" title=" " alt="" coords="732,13,798,38"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="684,23,716,23,716,28,684,28"/>
-</map>
diff --git a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph.md5 b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph.md5
deleted file mode 100644
index 40426c3d1..000000000
--- a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9b445232e38cc6d11ccb51813ee90e45
\ No newline at end of file
diff --git a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph.svg b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph.svg
deleted file mode 100644
index f76921652..000000000
--- a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph.svg
+++ /dev/null
@@ -1,179 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::elliptic_curve_key_exchange::multiply Pages: 1 -->
-<!--zoomable 39 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 603;
-var viewHeight = 39;
-var sectionId = 'dynsection-2';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>ciphers::elliptic_curve_key_exchange::multiply</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="multiply Point and integer">
-<polygon fill="#999999" stroke="#666666" points="124,-30.5 0,-30.5 0,0 124,0 124,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::elliptic_curve</text>
-<text text-anchor="middle" x="62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_key_exchange::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf" target="_top" xlink:title="Addition of points.">
-<polygon fill="white" stroke="#666666" points="284,-30.5 160,-30.5 160,0 284,0 284,-30.5"/>
-<text text-anchor="start" x="168" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::elliptic_curve</text>
-<text text-anchor="middle" x="222" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_key_exchange::addition</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.09,-15.25C132,-15.25 140.16,-15.25 148.23,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.04,-18.75 158.04,-15.25 148.04,-11.75 148.04,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0" target="_top" xlink:title="This function calculates number raised to exponent power under modulo mod using Modular Exponentiatio...">
-<polygon fill="white" stroke="#666666" points="430.5,-30.5 320,-30.5 320,0 430.5,0 430.5,-30.5"/>
-<text text-anchor="start" x="328" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::elliptic_curve</text>
-<text text-anchor="middle" x="375.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_key_exchange::exp</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M284.08,-15.25C292.11,-15.25 300.36,-15.25 308.46,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="308.25,-18.75 318.25,-15.25 308.25,-11.75 308.25,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="508.75,-24.88 466.5,-24.88 466.5,-5.63 508.75,-5.63 508.75,-24.88"/>
-<text text-anchor="middle" x="487.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M430.79,-15.25C438.96,-15.25 447.15,-15.25 454.64,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="454.59,-18.75 464.59,-15.25 454.59,-11.75 454.59,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="594.5,-24.88 544.75,-24.88 544.75,-5.63 594.5,-5.63 594.5,-24.88"/>
-<text text-anchor="middle" x="569.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M509.23,-15.25C516.53,-15.25 524.96,-15.25 533.15,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="532.88,-18.75 542.88,-15.25 532.88,-11.75 532.88,-18.75"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph_org.svg b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph_org.svg
deleted file mode 100644
index d70234de8..000000000
--- a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_a17f3d667241b88115a95282cdd719cb2_cgraph_org.svg
+++ /dev/null
@@ -1,96 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::elliptic_curve_key_exchange::multiply Pages: 1 -->
-<svg width="603pt" height="39pt"
- viewBox="0.00 0.00 602.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>ciphers::elliptic_curve_key_exchange::multiply</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="multiply Point and integer">
-<polygon fill="#999999" stroke="#666666" points="124,-30.5 0,-30.5 0,0 124,0 124,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::elliptic_curve</text>
-<text text-anchor="middle" x="62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_key_exchange::multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf" target="_top" xlink:title="Addition of points.">
-<polygon fill="white" stroke="#666666" points="284,-30.5 160,-30.5 160,0 284,0 284,-30.5"/>
-<text text-anchor="start" x="168" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::elliptic_curve</text>
-<text text-anchor="middle" x="222" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_key_exchange::addition</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.09,-15.25C132,-15.25 140.16,-15.25 148.23,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.04,-18.75 158.04,-15.25 148.04,-11.75 148.04,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0" target="_top" xlink:title="This function calculates number raised to exponent power under modulo mod using Modular Exponentiatio...">
-<polygon fill="white" stroke="#666666" points="430.5,-30.5 320,-30.5 320,0 430.5,0 430.5,-30.5"/>
-<text text-anchor="start" x="328" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::elliptic_curve</text>
-<text text-anchor="middle" x="375.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_key_exchange::exp</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M284.08,-15.25C292.11,-15.25 300.36,-15.25 308.46,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="308.25,-18.75 318.25,-15.25 308.25,-11.75 308.25,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="508.75,-24.88 466.5,-24.88 466.5,-5.63 508.75,-5.63 508.75,-24.88"/>
-<text text-anchor="middle" x="487.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M430.79,-15.25C438.96,-15.25 447.15,-15.25 454.64,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="454.59,-18.75 464.59,-15.25 454.59,-11.75 454.59,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="594.5,-24.88 544.75,-24.88 544.75,-5.63 594.5,-5.63 594.5,-24.88"/>
-<text text-anchor="middle" x="569.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M509.23,-15.25C516.53,-15.25 524.96,-15.25 533.15,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="532.88,-18.75 542.88,-15.25 532.88,-11.75 532.88,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_ac00616a4e40d3cd5cfb4da87d9ff9af0_cgraph.map b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_ac00616a4e40d3cd5cfb4da87d9ff9af0_cgraph.map
deleted file mode 100644
index b6d9f31ed..000000000
--- a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_ac00616a4e40d3cd5cfb4da87d9ff9af0_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="ciphers::elliptic_curve_key_exchange::exp" name="ciphers::elliptic_curve_key_exchange::exp">
-<area shape="rect" id="Node000001" title="This function calculates number raised to exponent power under modulo mod using Modular Exponentiatio..." alt="" coords="5,5,153,46"/>
-<area shape="rect" id="Node000002" href="$df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" title=" " alt="" coords="201,13,257,38"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="153,23,185,23,185,28,153,28"/>
-<area shape="rect" id="Node000003" href="$df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" title=" " alt="" coords="305,13,371,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="258,23,290,23,290,28,258,28"/>
-</map>
diff --git a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_ac00616a4e40d3cd5cfb4da87d9ff9af0_cgraph.md5 b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_ac00616a4e40d3cd5cfb4da87d9ff9af0_cgraph.md5
deleted file mode 100644
index f3e990868..000000000
--- a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_ac00616a4e40d3cd5cfb4da87d9ff9af0_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9874859218051b34c93f0d55ccd2baf1
\ No newline at end of file
diff --git a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_ac00616a4e40d3cd5cfb4da87d9ff9af0_cgraph.svg b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_ac00616a4e40d3cd5cfb4da87d9ff9af0_cgraph.svg
deleted file mode 100644
index 97e06ac00..000000000
--- a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_ac00616a4e40d3cd5cfb4da87d9ff9af0_cgraph.svg
+++ /dev/null
@@ -1,84 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::elliptic_curve_key_exchange::exp Pages: 1 -->
-<svg width="283pt" height="39pt"
- viewBox="0.00 0.00 282.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>ciphers::elliptic_curve_key_exchange::exp</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function calculates number raised to exponent power under modulo mod using Modular Exponentiatio...">
-<polygon fill="#999999" stroke="#666666" points="110.5,-30.5 0,-30.5 0,0 110.5,0 110.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::elliptic_curve</text>
-<text text-anchor="middle" x="55.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_key_exchange::exp</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="188.75,-24.88 146.5,-24.88 146.5,-5.63 188.75,-5.63 188.75,-24.88"/>
-<text text-anchor="middle" x="167.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.79,-15.25C118.96,-15.25 127.15,-15.25 134.64,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.59,-18.75 144.59,-15.25 134.59,-11.75 134.59,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.5,-24.88 224.75,-24.88 224.75,-5.63 274.5,-5.63 274.5,-24.88"/>
-<text text-anchor="middle" x="249.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.23,-15.25C196.53,-15.25 204.96,-15.25 213.15,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.88,-18.75 222.88,-15.25 212.88,-11.75 212.88,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_ac00616a4e40d3cd5cfb4da87d9ff9af0_cgraph_org.svg b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_ac00616a4e40d3cd5cfb4da87d9ff9af0_cgraph_org.svg
deleted file mode 100644
index b31b0edc5..000000000
--- a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_ac00616a4e40d3cd5cfb4da87d9ff9af0_cgraph_org.svg
+++ /dev/null
@@ -1,58 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::elliptic_curve_key_exchange::exp Pages: 1 -->
-<svg width="283pt" height="39pt"
- viewBox="0.00 0.00 282.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>ciphers::elliptic_curve_key_exchange::exp</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function calculates number raised to exponent power under modulo mod using Modular Exponentiatio...">
-<polygon fill="#999999" stroke="#666666" points="110.5,-30.5 0,-30.5 0,0 110.5,0 110.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::elliptic_curve</text>
-<text text-anchor="middle" x="55.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_key_exchange::exp</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="188.75,-24.88 146.5,-24.88 146.5,-5.63 188.75,-5.63 188.75,-24.88"/>
-<text text-anchor="middle" x="167.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M110.79,-15.25C118.96,-15.25 127.15,-15.25 134.64,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="134.59,-18.75 144.59,-15.25 134.59,-11.75 134.59,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.5,-24.88 224.75,-24.88 224.75,-5.63 274.5,-5.63 274.5,-24.88"/>
-<text text-anchor="middle" x="249.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.23,-15.25C196.53,-15.25 204.96,-15.25 213.15,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.88,-18.75 222.88,-15.25 212.88,-11.75 212.88,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_acc5fe9c2032fb7582c38a20d1fa69bcf_cgraph.map b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_acc5fe9c2032fb7582c38a20d1fa69bcf_cgraph.map
deleted file mode 100644
index f6fc4a08f..000000000
--- a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_acc5fe9c2032fb7582c38a20d1fa69bcf_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="ciphers::elliptic_curve_key_exchange::addition" name="ciphers::elliptic_curve_key_exchange::addition">
-<area shape="rect" id="Node000001" title="Addition of points." alt="" coords="5,5,171,46"/>
-<area shape="rect" id="Node000002" href="$df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0" title="This function calculates number raised to exponent power under modulo mod using Modular Exponentiatio..." alt="" coords="219,5,366,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="171,23,203,23,203,28,171,28"/>
-<area shape="rect" id="Node000003" href="$df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" title=" " alt="" coords="414,13,470,38"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="366,23,398,23,398,28,366,28"/>
-<area shape="rect" id="Node000004" href="$df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" title=" " alt="" coords="518,13,585,38"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="471,23,503,23,503,28,471,28"/>
-</map>
diff --git a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_acc5fe9c2032fb7582c38a20d1fa69bcf_cgraph.md5 b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_acc5fe9c2032fb7582c38a20d1fa69bcf_cgraph.md5
deleted file mode 100644
index d74ceaddd..000000000
--- a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_acc5fe9c2032fb7582c38a20d1fa69bcf_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-9e8486f6c4fa6150b90bf8ead6610a42
\ No newline at end of file
diff --git a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_acc5fe9c2032fb7582c38a20d1fa69bcf_cgraph.svg b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_acc5fe9c2032fb7582c38a20d1fa69bcf_cgraph.svg
deleted file mode 100644
index c50d2aeaa..000000000
--- a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_acc5fe9c2032fb7582c38a20d1fa69bcf_cgraph.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::elliptic_curve_key_exchange::addition Pages: 1 -->
-<svg width="443pt" height="39pt"
- viewBox="0.00 0.00 442.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>ciphers::elliptic_curve_key_exchange::addition</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Addition of points.">
-<polygon fill="#999999" stroke="#666666" points="124,-30.5 0,-30.5 0,0 124,0 124,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::elliptic_curve</text>
-<text text-anchor="middle" x="62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_key_exchange::addition</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0" target="_top" xlink:title="This function calculates number raised to exponent power under modulo mod using Modular Exponentiatio...">
-<polygon fill="white" stroke="#666666" points="270.5,-30.5 160,-30.5 160,0 270.5,0 270.5,-30.5"/>
-<text text-anchor="start" x="168" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::elliptic_curve</text>
-<text text-anchor="middle" x="215.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_key_exchange::exp</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.08,-15.25C132.11,-15.25 140.36,-15.25 148.46,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.25,-18.75 158.25,-15.25 148.25,-11.75 148.25,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="348.75,-24.88 306.5,-24.88 306.5,-5.63 348.75,-5.63 348.75,-24.88"/>
-<text text-anchor="middle" x="327.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.79,-15.25C278.96,-15.25 287.15,-15.25 294.64,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.59,-18.75 304.59,-15.25 294.59,-11.75 294.59,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="434.5,-24.88 384.75,-24.88 384.75,-5.63 434.5,-5.63 434.5,-24.88"/>
-<text text-anchor="middle" x="409.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M349.23,-15.25C356.53,-15.25 364.96,-15.25 373.15,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="372.88,-18.75 382.88,-15.25 372.88,-11.75 372.88,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_acc5fe9c2032fb7582c38a20d1fa69bcf_cgraph_org.svg b/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_acc5fe9c2032fb7582c38a20d1fa69bcf_cgraph_org.svg
deleted file mode 100644
index 4c09c8fe3..000000000
--- a/df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange_acc5fe9c2032fb7582c38a20d1fa69bcf_cgraph_org.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: ciphers::elliptic_curve_key_exchange::addition Pages: 1 -->
-<svg width="443pt" height="39pt"
- viewBox="0.00 0.00 442.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>ciphers::elliptic_curve_key_exchange::addition</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Addition of points.">
-<polygon fill="#999999" stroke="#666666" points="124,-30.5 0,-30.5 0,0 124,0 124,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::elliptic_curve</text>
-<text text-anchor="middle" x="62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_key_exchange::addition</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0" target="_top" xlink:title="This function calculates number raised to exponent power under modulo mod using Modular Exponentiatio...">
-<polygon fill="white" stroke="#666666" points="270.5,-30.5 160,-30.5 160,0 270.5,0 270.5,-30.5"/>
-<text text-anchor="start" x="168" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">ciphers::elliptic_curve</text>
-<text text-anchor="middle" x="215.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_key_exchange::exp</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M124.08,-15.25C132.11,-15.25 140.36,-15.25 148.46,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="148.25,-18.75 158.25,-15.25 148.25,-11.75 148.25,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="348.75,-24.88 306.5,-24.88 306.5,-5.63 348.75,-5.63 348.75,-24.88"/>
-<text text-anchor="middle" x="327.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.79,-15.25C278.96,-15.25 287.15,-15.25 294.64,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.59,-18.75 304.59,-15.25 294.59,-11.75 294.59,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="434.5,-24.88 384.75,-24.88 384.75,-5.63 434.5,-5.63 434.5,-24.88"/>
-<text text-anchor="middle" x="409.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M349.23,-15.25C356.53,-15.25 364.96,-15.25 373.15,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="372.88,-18.75 382.88,-15.25 372.88,-11.75 372.88,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d72/modular__division_8cpp.html b/df/d72/modular__division_8cpp.html
index 3477b2c16..62200e6c8 100644
--- a/df/d72/modular__division_8cpp.html
+++ b/df/d72/modular__division_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/modular_division.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/modular_division.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -121,7 +138,9 @@ Include dependency graph for modular_division.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/dcc/modular__division_8cpp__incl.svg" width="255" height="111"><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">
+</div>
+<p><a href="../../df/d72/modular__division_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
@@ -149,6 +168,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p>An algorithm to divide two numbers under modulo p <a href="https://www.geeksforgeeks.org/modular-division" target="_blank">Modular Division</a> </p>
 <p>To calculate division of two numbers under modulo p Modulo operator is not distributive under division, therefore we first have to calculate the inverse of divisor using <a href="https://en.wikipedia.org/wiki/Fermat%27s_little_theorem" target="_blank">Fermat's little theorem</a> Now, we can multiply the dividend with the inverse of divisor and modulo is distributive over multiplication operation. Let, We have 3 numbers a, b, p To compute (a/b)p (a/b)p ≡ (a*(inverse(b)))p ≡ ((ap)*inverse(b)p)p NOTE: For the existence of inverse of 'b', 'b' and 'p' must be coprime For simplicity we take p as prime Time Complexity: O(log(b)) Example: ( 24 / 3 ) % 5 =&gt; 8 % 5 = 3 &mdash; (i) Now the inverse of 3 is 2 (24 * 2) % 5 = (24 % 5) * (2 % 5) = (4 * 2) % 5 = 3 &mdash; (ii) (i) and (ii) are equal hence the answer is correct. </p><dl class="section see"><dt>See also</dt><dd><a class="el" href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html" title="C++ Program to find the modular inverse using Fermat&#39;s Little Theorem">modular_inverse_fermat_little_theorem.cpp</a>, <a class="el" href="../../d0/d6d/modular__exponentiation_8cpp.html" title="C++ Program for Modular Exponentiation Iteratively.">modular_exponentiation.cpp</a> </dd></dl>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/shubhamamsa" target="_blank">Shubham Yadav</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../df/d72/modular__division_8cpp_source.html">modular_division.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">&#9670;&#160;</a></span>main()</h2>
@@ -178,17 +199,14 @@ Functions</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d72/modular__division_8cpp_source.html#l00113">113</a> of file <a class="el" href="../../df/d72/modular__division_8cpp_source.html">modular_division.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  113</span>                                 {</div>
 <div class="line"><span class="lineno">  114</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the tests</span></div>
 <div class="line"><span class="lineno">  115</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  116</span>}</div>
-<div class="ttc" id="amodular__division_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> modular_division.cpp:89</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amodular__division_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="../../df/d72/modular__division_8cpp_source.html#l00089">modular_division.cpp:89</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a905e368ae121beb7e7ea35349ddcdac7" name="a905e368ae121beb7e7ea35349ddcdac7"></a>
@@ -227,20 +245,17 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>a/b modulo c </dd></dl>
 <p>Calculate the inverse of b</p>
 <p>Calculate the final result</p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d72/modular__division_8cpp_source.html#l00075">75</a> of file <a class="el" href="../../df/d72/modular__division_8cpp_source.html">modular_division.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   75</span>                                                          {</div>
-<div class="line"><span class="lineno">   76</span>    uint64_t inverse = <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a>(b, p - 2, p) % p;  <span class="comment">/// Calculate the inverse of b</span></div>
+<div class="line"><span class="lineno">   76</span>    uint64_t inverse = <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a>(b, p - 2, p) % p;  </div>
 <div class="line"><span class="lineno">   77</span>    uint64_t <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> =</div>
-<div class="line"><span class="lineno">   78</span>        ((a % p) * (inverse % p)) % p;  <span class="comment">/// Calculate the final result</span></div>
+<div class="line"><span class="lineno">   78</span>        ((a % p) * (inverse % p)) % p;  </div>
 <div class="line"><span class="lineno">   79</span>    <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
 <div class="line"><span class="lineno">   80</span>}</div>
-<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:77</div></div>
-<div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae249a2af508aa94266023ce8aa81426f"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a></div><div class="ttdeci">void power(int x, int n)</div><div class="ttdef"><b>Definition</b> power_for_huge_numbers.cpp:56</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.svg" width="167" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dc3/fibonacci__sum_8cpp_source.html#l00077">fibonacci_sum.cpp:77</a></div></div>
+<div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae249a2af508aa94266023ce8aa81426f"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a></div><div class="ttdeci">void power(int x, int n)</div><div class="ttdef"><b>Definition</b> <a href="../../df/def/power__for__huge__numbers_8cpp_source.html#l00056">power_for_huge_numbers.cpp:56</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a66cdf93153cbd1408bd74ac68961d179" name="a66cdf93153cbd1408bd74ac68961d179"></a>
@@ -283,19 +298,19 @@ Here is the call graph for this function:</div>
 <p>If b is odd, multiply a with answer</p>
 <p>b must be even now</p>
 <p>b = b/2</p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d72/modular__division_8cpp_source.html#l00050">50</a> of file <a class="el" href="../../df/d72/modular__division_8cpp_source.html">modular_division.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   50</span>                                                   {</div>
-<div class="line"><span class="lineno">   51</span>    uint64_t ans = 1;  <span class="comment">/// Initialize the answer to be returned</span></div>
-<div class="line"><span class="lineno">   52</span>    a = a % c;         <span class="comment">/// Update a if it is more than or equal to c</span></div>
+<div class="line"><span class="lineno">   51</span>    uint64_t ans = 1;  </div>
+<div class="line"><span class="lineno">   52</span>    a = a % c;         </div>
 <div class="line"><span class="lineno">   53</span>    <span class="keywordflow">if</span> (a == 0) {</div>
-<div class="line"><span class="lineno">   54</span>        <span class="keywordflow">return</span> 0;  <span class="comment">/// In case a is divisible by c;</span></div>
+<div class="line"><span class="lineno">   54</span>        <span class="keywordflow">return</span> 0;  </div>
 <div class="line"><span class="lineno">   55</span>    }</div>
-<div class="line"><span class="lineno">   56</span>    <span class="keywordflow">while</span> (b &gt; 0) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   57</span><span class="comment">        /// If b is odd, multiply a with answer</span></div>
-<div class="line"><span class="lineno">   58</span><span class="comment"></span>        <span class="keywordflow">if</span> (b &amp; 1) {</div>
+<div class="line"><span class="lineno">   56</span>    <span class="keywordflow">while</span> (b &gt; 0) {</div>
+<div class="line"><span class="lineno">   58</span>        <span class="keywordflow">if</span> (b &amp; 1) {</div>
 <div class="line"><span class="lineno">   59</span>            ans = ((ans % c) * (a % c)) % c;</div>
-<div class="line"><span class="lineno">   60</span>        }<span class="comment"></span></div>
-<div class="line"><span class="lineno">   61</span><span class="comment">        /// b must be even now</span></div>
-<div class="line"><span class="lineno">   62</span><span class="comment"></span>        b = b &gt;&gt; 1;  <span class="comment">/// b = b/2</span></div>
+<div class="line"><span class="lineno">   60</span>        }</div>
+<div class="line"><span class="lineno">   62</span>        b = b &gt;&gt; 1;  </div>
 <div class="line"><span class="lineno">   63</span>        a = ((a % c) * (a % c)) % c;</div>
 <div class="line"><span class="lineno">   64</span>    }</div>
 <div class="line"><span class="lineno">   65</span>    <span class="keywordflow">return</span> ans;</div>
@@ -326,32 +341,27 @@ Here is the call graph for this function:</div>
 </table>
 </div><div class="memdoc">
 <p>Function for testing power function. test cases and assert statement. </p><dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d72/modular__division_8cpp_source.html#l00089">89</a> of file <a class="el" href="../../df/d72/modular__division_8cpp_source.html">modular_division.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   89</span>                   {</div>
 <div class="line"><span class="lineno">   90</span>    uint64_t test_case_1 = <a class="code hl_function" href="#a905e368ae121beb7e7ea35349ddcdac7">math::modular_division::mod_division</a>(8, 2, 2);</div>
 <div class="line"><span class="lineno">   91</span>    assert(test_case_1 == 0);</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> &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed!&quot;</span> &lt;&lt; <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">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   93</span>    uint64_t test_case_2 = <a class="code hl_function" href="#a905e368ae121beb7e7ea35349ddcdac7">math::modular_division::mod_division</a>(15, 3, 7);</div>
 <div class="line"><span class="lineno">   94</span>    assert(test_case_2 == 5);</div>
-<div class="line"><span class="lineno">   95</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed!&quot;</span> &lt;&lt; <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">   95</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   96</span>    uint64_t test_case_3 = <a class="code hl_function" href="#a905e368ae121beb7e7ea35349ddcdac7">math::modular_division::mod_division</a>(10, 5, 2);</div>
 <div class="line"><span class="lineno">   97</span>    assert(test_case_3 == 0);</div>
-<div class="line"><span class="lineno">   98</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed!&quot;</span> &lt;&lt; <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">   98</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   99</span>    uint64_t test_case_4 = <a class="code hl_function" href="#a905e368ae121beb7e7ea35349ddcdac7">math::modular_division::mod_division</a>(81, 3, 5);</div>
 <div class="line"><span class="lineno">  100</span>    assert(test_case_4 == 2);</div>
-<div class="line"><span class="lineno">  101</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 4 Passed!&quot;</span> &lt;&lt; <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">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  102</span>    uint64_t test_case_5 = <a class="code hl_function" href="#a905e368ae121beb7e7ea35349ddcdac7">math::modular_division::mod_division</a>(12848, 73, 29);</div>
 <div class="line"><span class="lineno">  103</span>    assert(test_case_5 == 2);</div>
-<div class="line"><span class="lineno">  104</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 5 Passed!&quot;</span> &lt;&lt; <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">  104</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 5 Passed!&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  105</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="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="amodular__division_8cpp_html_a905e368ae121beb7e7ea35349ddcdac7"><div class="ttname"><a href="#a905e368ae121beb7e7ea35349ddcdac7">math::modular_division::mod_division</a></div><div class="ttdeci">uint64_t mod_division(uint64_t a, uint64_t b, uint64_t p)</div><div class="ttdoc">This function calculates modular division.</div><div class="ttdef"><b>Definition</b> modular_division.cpp:75</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="amodular__division_8cpp_html_a905e368ae121beb7e7ea35349ddcdac7"><div class="ttname"><a href="#a905e368ae121beb7e7ea35349ddcdac7">math::modular_division::mod_division</a></div><div class="ttdeci">uint64_t mod_division(uint64_t a, uint64_t b, uint64_t p)</div><div class="ttdoc">This function calculates modular division.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d72/modular__division_8cpp_source.html#l00075">modular_division.cpp:75</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
deleted file mode 100644
index 3b1afc0b8..000000000
--- a/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title=" " alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
deleted file mode 100644
index 005216ff9..000000000
--- a/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d0ccd64f41c4f6be3375aaab70065cf8
\ No newline at end of file
diff --git a/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
deleted file mode 100644
index 773fd35f0..000000000
--- a/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
deleted file mode 100644
index 33b310508..000000000
--- a/df/d72/modular__division_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.map b/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.map
deleted file mode 100644
index bd3e68569..000000000
--- a/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="math::modular_division::mod_division" name="math::modular_division::mod_division">
-<area shape="rect" id="Node000001" title="This function calculates modular division." alt="" coords="5,29,161,70"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="53,29,51,19,56,11,67,5,83,3,100,5,110,11,108,16,98,10,83,8,69,10,60,14,57,20,58,28"/>
-</map>
diff --git a/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.md5 b/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.md5
deleted file mode 100644
index d2f00e3de..000000000
--- a/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5aee12c175e58176ec955564cbdf4891
\ No newline at end of file
diff --git a/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.svg b/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.svg
deleted file mode 100644
index aa1f08f68..000000000
--- a/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::modular_division::mod_division Pages: 1 -->
-<svg width="125pt" height="57pt"
- viewBox="0.00 0.00 124.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::modular_division::mod_division</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function calculates modular division.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-30.5 0,-30.5 0,0 116.5,0 116.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::modular_division</text>
-<text text-anchor="middle" x="58.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::mod_division</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.61,-30.99C33.39,-40.06 40.27,-48.5 58.25,-48.5 68.08,-48.5 74.59,-45.97 77.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.25,-42.79 78.75,-32.49 74.28,-42.1 81.25,-42.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph_org.svg b/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph_org.svg
deleted file mode 100644
index ffb8aa775..000000000
--- a/df/d72/modular__division_8cpp_a905e368ae121beb7e7ea35349ddcdac7_cgraph_org.svg
+++ /dev/null
@@ -1,31 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: math::modular_division::mod_division Pages: 1 -->
-<svg width="125pt" height="57pt"
- viewBox="0.00 0.00 124.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
-<title>math::modular_division::mod_division</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="This function calculates modular division.">
-<polygon fill="#999999" stroke="#666666" points="116.5,-30.5 0,-30.5 0,0 116.5,0 116.5,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">math::modular_division</text>
-<text text-anchor="middle" x="58.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::mod_division</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.61,-30.99C33.39,-40.06 40.27,-48.5 58.25,-48.5 68.08,-48.5 74.59,-45.97 77.79,-42.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.25,-42.79 78.75,-32.49 74.28,-42.1 81.25,-42.79"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index ab849b4e9..000000000
--- a/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 027bb45f5..000000000
--- a/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a1d13d80069df469bd6cb7baa71c0ea1
\ No newline at end of file
diff --git a/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 74b7e7dc5..000000000
--- a/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index b7b979de9..000000000
--- a/df/d72/modular__division_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d72/modular__division_8cpp_source.html b/df/d72/modular__division_8cpp_source.html
new file mode 100644
index 000000000..165e4cd62
--- /dev/null
+++ b/df/d72/modular__division_8cpp_source.html
@@ -0,0 +1,204 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/modular_division.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/d72/modular__division_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">modular_division.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../df/d72/modular__division_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="preprocessor">#include &lt;cassert&gt;</span>   </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;iostream&gt;</span>  </div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d1/d64/namespacemodular__division.html">modular_division</a> {</div>
+<div class="foldopen" id="foldopen00050" data-start="{" data-end="}">
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"><a class="line" href="../../df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179">   50</a></span>uint64_t power(uint64_t a, uint64_t b, uint64_t c) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>    uint64_t ans = 1;  </div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>    a = a % c;         </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>    <span class="keywordflow">if</span> (a == 0) {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <span class="keywordflow">return</span> 0;  </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    }</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">while</span> (b &gt; 0) {</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>        <span class="keywordflow">if</span> (b &amp; 1) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>            ans = ((ans % c) * (a % c)) % c;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        }</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        b = b &gt;&gt; 1;  </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        a = ((a % c) * (a % c)) % c;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    }</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordflow">return</span> ans;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>}</div>
+</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="foldopen" id="foldopen00075" data-start="{" data-end="}">
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"><a class="line" href="../../df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7">   75</a></span>uint64_t <a class="code hl_function" href="../../df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7">mod_division</a>(uint64_t a, uint64_t b, uint64_t p) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    uint64_t inverse = power(b, p - 2, p) % p;  </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    uint64_t result =</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>        ((a % p) * (inverse % p)) % p;  </div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keywordflow">return</span> result;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>}</div>
+</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>}  <span class="comment">// namespace modular_division</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>}  <span class="comment">// namespace math</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="foldopen" id="foldopen00089" data-start="{" data-end="}">
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"><a class="line" href="../../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   89</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>    uint64_t test_case_1 = math::modular_division::mod_division(8, 2, 2);</div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>    assert(test_case_1 == 0);</div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    uint64_t test_case_2 = math::modular_division::mod_division(15, 3, 7);</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    assert(test_case_2 == 5);</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    uint64_t test_case_3 = math::modular_division::mod_division(10, 5, 2);</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    assert(test_case_3 == 0);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    uint64_t test_case_4 = math::modular_division::mod_division(81, 3, 5);</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    assert(test_case_4 == 2);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 4 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    uint64_t test_case_5 = math::modular_division::mod_division(12848, 73, 29);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    assert(test_case_5 == 2);</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 5 Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>}</div>
+</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="foldopen" id="foldopen00113" data-start="{" data-end="}">
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"><a class="line" href="../../df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">  113</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>(<span class="keywordtype">int</span> argc, <span class="keywordtype">char</span> *argv[]) {</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <a class="code hl_function" href="../../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// execute the tests</span></div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>}</div>
+</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="amodular__division_8cpp_html_a905e368ae121beb7e7ea35349ddcdac7"><div class="ttname"><a href="../../df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7">math::modular_division::mod_division</a></div><div class="ttdeci">uint64_t mod_division(uint64_t a, uint64_t b, uint64_t p)</div><div class="ttdoc">This function calculates modular division.</div><div class="ttdef"><b>Definition</b> <a href="#l00075">modular_division.cpp:75</a></div></div>
+<div class="ttc" id="amodular__division_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition</b> <a href="#l00089">modular_division.cpp:89</a></div></div>
+<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
+<div class="ttc" id="anamespacemodular__division_html"><div class="ttname"><a href="../../d1/d64/namespacemodular__division.html">modular_division</a></div><div class="ttdoc">Functions for Modular Division implementation.</div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../df/d72/modular__division_8cpp.html">modular_division.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/d74/namespacesubarray__sum.html b/df/d74/namespacesubarray__sum.html
index 6a3577776..5d869237b 100644
--- a/df/d74/namespacesubarray__sum.html
+++ b/df/d74/namespacesubarray__sum.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: subarray_sum Namespace Reference</title>
+<title>TheAlgorithms/C++: subarray_sum Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/df/d76/namespacefibonacci.html b/df/d76/namespacefibonacci.html
index 2b59025b7..674a468e5 100644
--- a/df/d76/namespacefibonacci.html
+++ b/df/d76/namespacefibonacci.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: fibonacci Namespace Reference</title>
+<title>TheAlgorithms/C++: fibonacci Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/df/d82/breadth__first__search_8cpp.html b/df/d82/breadth__first__search_8cpp.html
index b1705d218..1c6aace28 100644
--- a/df/d82/breadth__first__search_8cpp.html
+++ b/df/d82/breadth__first__search_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph/breadth_first_search.cpp File Reference</title>
+<title>TheAlgorithms/C++: graph/breadth_first_search.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -127,7 +144,9 @@ Include dependency graph for breadth_first_search.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/dec/breadth__first__search_8cpp__incl.svg" width="642" height="126"><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">
+</div>
+<p><a href="../../df/d82/breadth__first__search_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
 Classes</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td></tr>
@@ -171,6 +190,8 @@ Functions</h2></td></tr>
 </ol>
 </li>
 </ol>
+
+<p class="definition">Definition in file <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html">breadth_first_search.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -187,37 +208,31 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html#l00186">186</a> of file <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html">breadth_first_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  186</span>           {</div>
 <div class="line"><span class="lineno">  187</span>    <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();</div>
 <div class="line"><span class="lineno">  188</span>    <span class="keywordtype">size_t</span> edges = 0;</div>
-<div class="line"><span class="lineno">  189</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the number of edges: &quot;</span>;</div>
-<div class="line"><span class="lineno">  190</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; edges;</div>
+<div class="line"><span class="lineno">  189</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of edges: &quot;</span>;</div>
+<div class="line"><span class="lineno">  190</span>    std::cin &gt;&gt; edges;</div>
 <div class="line"><span class="lineno">  191</span> </div>
 <div class="line"><span class="lineno">  192</span>    <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt;int&gt;</a> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>;</div>
 <div class="line"><span class="lineno">  193</span> </div>
-<div class="line"><span class="lineno">  194</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter space-separated pairs of vertices that form edges: &quot;</span></div>
-<div class="line"><span class="lineno">  195</span>              &lt;&lt; <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">  194</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter space-separated pairs of vertices that form edges: &quot;</span></div>
+<div class="line"><span class="lineno">  195</span>              &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  196</span>    <span class="keywordflow">while</span> (edges--) {</div>
 <div class="line"><span class="lineno">  197</span>        <span class="keywordtype">int</span> u = 0, v = 0;</div>
-<div class="line"><span class="lineno">  198</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; u &gt;&gt; v;</div>
+<div class="line"><span class="lineno">  198</span>        std::cin &gt;&gt; u &gt;&gt; v;</div>
 <div class="line"><span class="lineno">  199</span>        <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.add_edge(u, v);</div>
 <div class="line"><span class="lineno">  200</span>    }</div>
 <div class="line"><span class="lineno">  201</span> </div>
 <div class="line"><span class="lineno">  202</span>    <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.breadth_first_search(0);</div>
 <div class="line"><span class="lineno">  203</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  204</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="abreadth__first__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition</b> breadth_first_search.cpp:139</div></div>
-<div class="ttc" id="aclassgraph_1_1_graph_html"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></div><div class="ttdef"><b>Definition</b> lowest_common_ancestor.cpp:53</div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:115</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><!-- 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="../../df/d82/breadth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="542" height="216"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="abreadth__first__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition</b> <a href="../../df/d82/breadth__first__search_8cpp_source.html#l00139">breadth_first_search.cpp:139</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_graph_html"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00053">lowest_common_ancestor.cpp:53</a></div></div>
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a2f67508d5f392b0321772169342c98ad"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">numerical_methods::simpson_method::g</a></div><div class="ttdeci">double g(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00115">composite_simpson_rule.cpp:115</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
@@ -246,10 +261,11 @@ Here is the call graph for this function:</div>
 <p>Test 1 Begin</p>
 <p>Test 2 Begin</p>
 <p>Test 3 Begins</p>
-<div class="fragment"><div class="line"><span class="lineno">  139</span>                    {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  140</span><span class="comment">    /// Test 1 Begin</span></div>
-<div class="line"><span class="lineno">  141</span><span class="comment"></span>    <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt;int&gt;</a> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>;</div>
-<div class="line"><span class="lineno">  142</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map&lt;int, bool&gt;</a> correct_result;</div>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html#l00139">139</a> of file <a class="el" href="../../df/d82/breadth__first__search_8cpp_source.html">breadth_first_search.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  139</span>                    {</div>
+<div class="line"><span class="lineno">  141</span>    <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt;int&gt;</a> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>;</div>
+<div class="line"><span class="lineno">  142</span>    std::map&lt;int, bool&gt; correct_result;</div>
 <div class="line"><span class="lineno">  143</span>    <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.add_edge(0, 1);</div>
 <div class="line"><span class="lineno">  144</span>    <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.add_edge(1, 2);</div>
 <div class="line"><span class="lineno">  145</span>    <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.add_edge(2, 3);</div>
@@ -258,19 +274,17 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  148</span>    correct_result[2] = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  149</span>    correct_result[3] = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  150</span> </div>
-<div class="line"><span class="lineno">  151</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map&lt;int, bool&gt;</a> returned_result = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.breadth_first_search(2);</div>
+<div class="line"><span class="lineno">  151</span>    std::map&lt;int, bool&gt; returned_result = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.breadth_first_search(2);</div>
 <div class="line"><span class="lineno">  152</span> </div>
 <div class="line"><span class="lineno">  153</span>    assert(returned_result == correct_result);</div>
-<div class="line"><span class="lineno">  154</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed...&quot;</span> &lt;&lt; <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">  155</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  156</span><span class="comment">    /// Test 2 Begin</span></div>
-<div class="line"><span class="lineno">  157</span><span class="comment"></span>    returned_result = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.breadth_first_search(0);</div>
+<div class="line"><span class="lineno">  154</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  155</span> </div>
+<div class="line"><span class="lineno">  157</span>    returned_result = <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>.breadth_first_search(0);</div>
 <div class="line"><span class="lineno">  158</span> </div>
 <div class="line"><span class="lineno">  159</span>    assert(returned_result == correct_result);</div>
-<div class="line"><span class="lineno">  160</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed...&quot;</span> &lt;&lt; <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">  161</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">  162</span><span class="comment">    /// Test 3 Begins</span></div>
-<div class="line"><span class="lineno">  163</span><span class="comment"></span>    <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt;std::string&gt;</a> g2;</div>
+<div class="line"><span class="lineno">  160</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  161</span> </div>
+<div class="line"><span class="lineno">  163</span>    <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt;std::string&gt;</a> g2;</div>
 <div class="line"><span class="lineno">  164</span> </div>
 <div class="line"><span class="lineno">  165</span>    g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">&quot;Gorakhpur&quot;</span>, <span class="stringliteral">&quot;Lucknow&quot;</span>, <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">  166</span>    g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">&quot;Gorakhpur&quot;</span>, <span class="stringliteral">&quot;Kanpur&quot;</span>, <span class="keyword">false</span>);</div>
@@ -279,8 +293,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  169</span>    g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">&quot;Lucknow&quot;</span>, <span class="stringliteral">&quot;Prayagraj&quot;</span>, <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">  170</span>    g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">&quot;Agra&quot;</span>, <span class="stringliteral">&quot;Noida&quot;</span>, <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">  171</span> </div>
-<div class="line"><span class="lineno">  172</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map&lt;std::string, bool&gt;</a> correct_res;</div>
-<div class="line"><span class="lineno">  173</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map&lt;std::string, bool&gt;</a> returned_res =</div>
+<div class="line"><span class="lineno">  172</span>    std::map&lt;std::string, bool&gt; correct_res;</div>
+<div class="line"><span class="lineno">  173</span>    std::map&lt;std::string, bool&gt; returned_res =</div>
 <div class="line"><span class="lineno">  174</span>        g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981">breadth_first_search</a>(<span class="stringliteral">&quot;Kanpur&quot;</span>);</div>
 <div class="line"><span class="lineno">  175</span>    correct_res[<span class="stringliteral">&quot;Gorakhpur&quot;</span>] = <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  176</span>    correct_res[<span class="stringliteral">&quot;Lucknow&quot;</span>] = <span class="keyword">false</span>;</div>
@@ -289,17 +303,11 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  179</span>    correct_res[<span class="stringliteral">&quot;Prayagraj&quot;</span>] = <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">  180</span>    correct_res[<span class="stringliteral">&quot;Noida&quot;</span>] = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">  181</span>    assert(correct_res == returned_res);</div>
-<div class="line"><span class="lineno">  182</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed...&quot;</span> &lt;&lt; <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">  182</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  183</span>}</div>
-<div class="ttc" id="aclassgraph_1_1_graph_html_a3755ec9e6a842238c7f4aac10b661981"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981">graph::Graph::breadth_first_search</a></div><div class="ttdeci">std::map&lt; T, bool &gt; breadth_first_search(T src)</div><div class="ttdef"><b>Definition</b> breadth_first_search.cpp:96</div></div>
-<div class="ttc" id="aclassgraph_1_1_graph_html_a877b2cba40d8d46dde6fb4209effed19"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">graph::Graph::add_edge</a></div><div class="ttdeci">void add_edge(T u, T v, bool bidir=true)</div><div class="ttdef"><b>Definition</b> breadth_first_search.cpp:74</div></div>
-<div class="ttc" id="amap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d82/breadth__first__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="444" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassgraph_1_1_graph_html_a3755ec9e6a842238c7f4aac10b661981"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981">graph::Graph::breadth_first_search</a></div><div class="ttdeci">std::map&lt; T, bool &gt; breadth_first_search(T src)</div><div class="ttdef"><b>Definition</b> <a href="../../df/d82/breadth__first__search_8cpp_source.html#l00096">breadth_first_search.cpp:96</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_graph_html_a877b2cba40d8d46dde6fb4209effed19"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">graph::Graph::add_edge</a></div><div class="ttdeci">void add_edge(T u, T v, bool bidir=true)</div><div class="ttdef"><b>Definition</b> <a href="../../df/d82/breadth__first__search_8cpp_source.html#l00074">breadth_first_search.cpp:74</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/df/d82/breadth__first__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/df/d82/breadth__first__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
deleted file mode 100644
index b25b00f50..000000000
--- a/df/d82/breadth__first__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
+++ /dev/null
@@ -1,17 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,80,56,106"/>
-<area shape="rect" id="Node000002" href="$dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19" title=" " alt="" coords="104,23,264,48"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,79,103,58,123,51,124,56,105,63,57,84"/>
-<area shape="rect" id="Node000003" href="$dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981" title=" " alt="" coords="110,72,258,113"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,90,94,90,94,96,56,96"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="148,137,220,163"/>
-<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="57,102,105,122,134,133,132,138,103,127,55,107"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/empty.html#" title=" " alt="" coords="312,5,438,31"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="236,70,311,40,324,35,326,40,313,45,238,74"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/front.html#" title=" " alt="" coords="317,55,433,80"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="258,80,301,75,302,80,258,86"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/pop.html#" title=" " alt="" coords="320,104,431,130"/>
-<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="258,99,304,105,304,111,258,105"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/push.html#" title=" " alt="" coords="316,153,434,179"/>
-<area shape="poly" id="edge6_Node000003_Node000007" title=" " alt="" coords="240,111,313,140,326,145,324,150,311,145,238,116"/>
-</map>
diff --git a/df/d82/breadth__first__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/df/d82/breadth__first__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
deleted file mode 100644
index 63bc9091b..000000000
--- a/df/d82/breadth__first__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-d7ff6d50be7b254f8fe3c66dc1acbeac
\ No newline at end of file
diff --git a/df/d82/breadth__first__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/df/d82/breadth__first__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
deleted file mode 100644
index a4f78b90f..000000000
--- a/df/d82/breadth__first__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
+++ /dev/null
@@ -1,174 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="333pt" height="138pt"
- viewBox="0.00 0.00 332.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-74.25 0,-74.25 0,-55 37.75,-55 37.75,-74.25"/>
-<text text-anchor="middle" x="18.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194,-117.25 73.75,-117.25 73.75,-98 194,-98 194,-117.25"/>
-<text text-anchor="middle" x="133.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.12,-73.34C48.46,-78.13 61.7,-84.02 73.75,-88.62 78.52,-90.45 83.56,-92.25 88.59,-93.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.48,-97.29 98.07,-97.12 89.68,-90.65 87.48,-97.29"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.12,-79.88 78.62,-79.88 78.62,-49.38 189.12,-49.38 189.12,-79.88"/>
-<text text-anchor="start" x="86.62" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::breadth</text>
-<text text-anchor="middle" x="133.88" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">_first_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.03,-64.62C46.09,-64.62 56.13,-64.62 66.63,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.62,-68.13 76.62,-64.63 66.62,-61.13 66.62,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.62,-31.25 107.12,-31.25 107.12,-12 160.62,-12 160.62,-31.25"/>
-<text text-anchor="middle" x="133.88" y="-17.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.12,-55.91C48.46,-51.12 61.7,-45.23 73.75,-40.62 80.84,-37.92 88.5,-35.26 95.88,-32.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.86,-36.19 105.32,-29.81 94.73,-29.53 96.86,-36.19"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.75,-130.25 230,-130.25 230,-111 324.75,-111 324.75,-130.25"/>
-<text text-anchor="middle" x="277.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M173.72,-80.24C190.94,-87.14 211.47,-95.33 230,-102.62 233.19,-103.88 236.51,-105.18 239.84,-106.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.36,-109.66 248.95,-110.03 240.9,-103.14 238.36,-109.66"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321,-93.25 233.75,-93.25 233.75,-74 321,-74 321,-93.25"/>
-<text text-anchor="middle" x="277.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.58,-71.97C200.32,-73.41 211.58,-74.92 222.29,-76.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.78,-79.83 232.16,-77.69 222.71,-72.89 221.78,-79.83"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="319.12,-56.25 235.62,-56.25 235.62,-37 319.12,-37 319.12,-56.25"/>
-<text text-anchor="middle" x="277.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.58,-57.67C200.9,-56.23 212.79,-54.71 224.01,-53.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.44,-56.76 233.92,-52.03 223.56,-49.82 224.44,-56.76"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321.75,-19.25 233,-19.25 233,0 321.75,0 321.75,-19.25"/>
-<text text-anchor="middle" x="277.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.14,-48.96C192.08,-42.37 212,-34.62 230,-27.62 233.2,-26.38 236.52,-25.09 239.85,-23.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="240.91,-27.14 248.96,-20.26 238.37,-20.62 240.91,-27.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d82/breadth__first__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/df/d82/breadth__first__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
deleted file mode 100644
index ac3a68d0c..000000000
--- a/df/d82/breadth__first__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
+++ /dev/null
@@ -1,148 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="333pt" height="138pt"
- viewBox="0.00 0.00 332.75 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-74.25 0,-74.25 0,-55 37.75,-55 37.75,-74.25"/>
-<text text-anchor="middle" x="18.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="194,-117.25 73.75,-117.25 73.75,-98 194,-98 194,-117.25"/>
-<text text-anchor="middle" x="133.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.12,-73.34C48.46,-78.13 61.7,-84.02 73.75,-88.62 78.52,-90.45 83.56,-92.25 88.59,-93.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="87.48,-97.29 98.07,-97.12 89.68,-90.65 87.48,-97.29"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="189.12,-79.88 78.62,-79.88 78.62,-49.38 189.12,-49.38 189.12,-79.88"/>
-<text text-anchor="start" x="86.62" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::breadth</text>
-<text text-anchor="middle" x="133.88" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">_first_search</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.03,-64.62C46.09,-64.62 56.13,-64.62 66.63,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.62,-68.13 76.62,-64.63 66.62,-61.13 66.62,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="160.62,-31.25 107.12,-31.25 107.12,-12 160.62,-12 160.62,-31.25"/>
-<text text-anchor="middle" x="133.88" y="-17.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node8 -->
-<g id="edge7_Node000001_Node000008" class="edge">
-<title>Node1&#45;&gt;Node8</title>
-<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.12,-55.91C48.46,-51.12 61.7,-45.23 73.75,-40.62 80.84,-37.92 88.5,-35.26 95.88,-32.83"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="96.86,-36.19 105.32,-29.81 94.73,-29.53 96.86,-36.19"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="324.75,-130.25 230,-130.25 230,-111 324.75,-111 324.75,-130.25"/>
-<text text-anchor="middle" x="277.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M173.72,-80.24C190.94,-87.14 211.47,-95.33 230,-102.62 233.19,-103.88 236.51,-105.18 239.84,-106.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="238.36,-109.66 248.95,-110.03 240.9,-103.14 238.36,-109.66"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321,-93.25 233.75,-93.25 233.75,-74 321,-74 321,-93.25"/>
-<text text-anchor="middle" x="277.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.58,-71.97C200.32,-73.41 211.58,-74.92 222.29,-76.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="221.78,-79.83 232.16,-77.69 222.71,-72.89 221.78,-79.83"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="319.12,-56.25 235.62,-56.25 235.62,-37 319.12,-37 319.12,-56.25"/>
-<text text-anchor="middle" x="277.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node6 -->
-<g id="edge5_Node000003_Node000006" class="edge">
-<title>Node3&#45;&gt;Node6</title>
-<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M189.58,-57.67C200.9,-56.23 212.79,-54.71 224.01,-53.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="224.44,-56.76 233.92,-52.03 223.56,-49.82 224.44,-56.76"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="321.75,-19.25 233,-19.25 233,0 321.75,0 321.75,-19.25"/>
-<text text-anchor="middle" x="277.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node7 -->
-<g id="edge6_Node000003_Node000007" class="edge">
-<title>Node3&#45;&gt;Node7</title>
-<g id="a_edge6_Node000003_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M175.14,-48.96C192.08,-42.37 212,-34.62 230,-27.62 233.2,-26.38 236.52,-25.09 239.85,-23.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="240.91,-27.14 248.96,-20.26 238.37,-20.62 240.91,-27.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d82/breadth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/d82/breadth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 7ce5ba707..000000000
--- a/df/d82/breadth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,20 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="246,5,317,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,38,230,21,230,26,55,44"/>
-<area shape="rect" id="Node000003" href="$df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title=" " alt="" coords="103,56,153,82"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,47,89,56,87,61,54,52"/>
-<area shape="poly" id="edge9_Node000003_Node000002" title=" " alt="" coords="153,57,200,40,230,30,231,35,202,45,155,62"/>
-<area shape="rect" id="Node000004" href="$dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19" title=" " alt="" coords="201,55,361,80"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="153,66,186,66,186,71,153,71"/>
-<area shape="rect" id="Node000005" href="$dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981" title=" " alt="" coords="208,104,355,145"/>
-<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="154,75,211,96,209,101,152,80"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/empty.html#" title=" " alt="" coords="409,37,536,63"/>
-<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="333,102,408,72,421,67,423,72,410,77,335,106"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/front.html#" title=" " alt="" coords="414,87,531,112"/>
-<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="355,112,399,107,399,112,356,118"/>
-<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/pop.html#" title=" " alt="" coords="417,136,528,162"/>
-<area shape="poly" id="edge7_Node000005_Node000008" title=" " alt="" coords="356,131,402,137,401,143,355,137"/>
-<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/push.html#" title=" " alt="" coords="413,185,532,211"/>
-<area shape="poly" id="edge8_Node000005_Node000009" title=" " alt="" coords="337,143,410,172,423,177,422,182,408,177,335,148"/>
-</map>
diff --git a/df/d82/breadth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/d82/breadth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index c2256c53e..000000000
--- a/df/d82/breadth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b66224793e870e3d84b373cf4241f8f8
\ No newline at end of file
diff --git a/df/d82/breadth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/d82/breadth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 0dec7f87e..000000000
--- a/df/d82/breadth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,201 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="406pt" height="162pt"
- viewBox="0.00 0.00 405.75 162.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 158.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-135.25 0,-135.25 0,-116 37,-116 37,-135.25"/>
-<text text-anchor="middle" x="18.5" y="-121.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.62,-154.25 180.12,-154.25 180.12,-135 233.62,-135 233.62,-154.25"/>
-<text text-anchor="middle" x="206.88" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.37,-127.45C67.41,-130.51 128.63,-136.75 168.42,-140.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.96,-144.28 178.27,-141.81 168.67,-137.31 167.96,-144.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-116.25 73,-116.25 73,-97 110.75,-97 110.75,-116.25"/>
-<text text-anchor="middle" x="91.88" y="-102.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-120.93C44.64,-118.93 53.57,-116.56 61.98,-114.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.71,-117.74 71.48,-111.79 60.91,-110.98 62.71,-117.74"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge9_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge9_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.23,-113.75C121.6,-117.7 134.84,-122.61 146.75,-126.62 153.91,-129.04 161.6,-131.49 168.99,-133.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.83,-137.07 178.42,-136.63 169.87,-130.38 167.83,-137.07"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267,-117.25 146.75,-117.25 146.75,-98 267,-98 267,-117.25"/>
-<text text-anchor="middle" x="206.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.03,-106.79C117.96,-106.85 126.35,-106.92 135.24,-107"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.14,-110.5 145.18,-107.09 135.21,-103.5 135.14,-110.5"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.12,-79.88 151.62,-79.88 151.62,-49.38 262.12,-49.38 262.12,-79.88"/>
-<text text-anchor="start" x="159.62" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::breadth</text>
-<text text-anchor="middle" x="206.88" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">_first_search</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.03,-99.88C122.59,-95.58 138.2,-89.78 153.42,-84.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.26,-87.54 162.41,-80.78 151.82,-80.98 154.26,-87.54"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.75,-130.25 303,-130.25 303,-111 397.75,-111 397.75,-130.25"/>
-<text text-anchor="middle" x="350.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M246.72,-80.24C263.94,-87.14 284.47,-95.33 303,-102.62 306.19,-103.88 309.51,-105.18 312.84,-106.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="311.36,-109.66 321.95,-110.03 313.9,-103.14 311.36,-109.66"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="394,-93.25 306.75,-93.25 306.75,-74 394,-74 394,-93.25"/>
-<text text-anchor="middle" x="350.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.58,-71.97C273.32,-73.41 284.58,-74.92 295.29,-76.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.78,-79.83 305.16,-77.69 295.71,-72.89 294.78,-79.83"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="392.12,-56.25 308.62,-56.25 308.62,-37 392.12,-37 392.12,-56.25"/>
-<text text-anchor="middle" x="350.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.58,-57.67C273.9,-56.23 285.79,-54.71 297.01,-53.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.44,-56.76 306.92,-52.03 296.56,-49.82 297.44,-56.76"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="394.75,-19.25 306,-19.25 306,0 394.75,0 394.75,-19.25"/>
-<text text-anchor="middle" x="350.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge8_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge8_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.14,-48.96C265.08,-42.37 285,-34.62 303,-27.62 306.2,-26.38 309.52,-25.09 312.85,-23.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.91,-27.14 321.96,-20.26 311.37,-20.62 313.91,-27.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d82/breadth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/d82/breadth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 8a34da3f5..000000000
--- a/df/d82/breadth__first__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,175 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="406pt" height="162pt"
- viewBox="0.00 0.00 405.75 162.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 158.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-135.25 0,-135.25 0,-116 37,-116 37,-135.25"/>
-<text text-anchor="middle" x="18.5" y="-121.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="233.62,-154.25 180.12,-154.25 180.12,-135 233.62,-135 233.62,-154.25"/>
-<text text-anchor="middle" x="206.88" y="-140.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.37,-127.45C67.41,-130.51 128.63,-136.75 168.42,-140.81"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.96,-144.28 178.27,-141.81 168.67,-137.31 167.96,-144.28"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-116.25 73,-116.25 73,-97 110.75,-97 110.75,-116.25"/>
-<text text-anchor="middle" x="91.88" y="-102.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-120.93C44.64,-118.93 53.57,-116.56 61.98,-114.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.71,-117.74 71.48,-111.79 60.91,-110.98 62.71,-117.74"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge9_Node000003_Node000002" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge9_Node000003_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.23,-113.75C121.6,-117.7 134.84,-122.61 146.75,-126.62 153.91,-129.04 161.6,-131.49 168.99,-133.77"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="167.83,-137.07 178.42,-136.63 169.87,-130.38 167.83,-137.07"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267,-117.25 146.75,-117.25 146.75,-98 267,-98 267,-117.25"/>
-<text text-anchor="middle" x="206.88" y="-103.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::add_edge</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.03,-106.79C117.96,-106.85 126.35,-106.92 135.24,-107"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="135.14,-110.5 145.18,-107.09 135.21,-103.5 135.14,-110.5"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="262.12,-79.88 151.62,-79.88 151.62,-49.38 262.12,-49.38 262.12,-79.88"/>
-<text text-anchor="start" x="159.62" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph::breadth</text>
-<text text-anchor="middle" x="206.88" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">_first_search</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge4_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.03,-99.88C122.59,-95.58 138.2,-89.78 153.42,-84.12"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.26,-87.54 162.41,-80.78 151.82,-80.98 154.26,-87.54"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="397.75,-130.25 303,-130.25 303,-111 397.75,-111 397.75,-130.25"/>
-<text text-anchor="middle" x="350.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge5_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M246.72,-80.24C263.94,-87.14 284.47,-95.33 303,-102.62 306.19,-103.88 309.51,-105.18 312.84,-106.48"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="311.36,-109.66 321.95,-110.03 313.9,-103.14 311.36,-109.66"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="394,-93.25 306.75,-93.25 306.75,-74 394,-74 394,-93.25"/>
-<text text-anchor="middle" x="350.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node7 -->
-<g id="edge6_Node000005_Node000007" class="edge">
-<title>Node5&#45;&gt;Node7</title>
-<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.58,-71.97C273.32,-73.41 284.58,-74.92 295.29,-76.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="294.78,-79.83 305.16,-77.69 295.71,-72.89 294.78,-79.83"/>
-</a>
-</g>
-</g>
-<!-- Node8 -->
-<g id="Node000008" class="node">
-<title>Node8</title>
-<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="392.12,-56.25 308.62,-56.25 308.62,-37 392.12,-37 392.12,-56.25"/>
-<text text-anchor="middle" x="350.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node8 -->
-<g id="edge7_Node000005_Node000008" class="edge">
-<title>Node5&#45;&gt;Node8</title>
-<g id="a_edge7_Node000005_Node000008"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M262.58,-57.67C273.9,-56.23 285.79,-54.71 297.01,-53.29"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="297.44,-56.76 306.92,-52.03 296.56,-49.82 297.44,-56.76"/>
-</a>
-</g>
-</g>
-<!-- Node9 -->
-<g id="Node000009" class="node">
-<title>Node9</title>
-<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="394.75,-19.25 306,-19.25 306,0 394.75,0 394.75,-19.25"/>
-<text text-anchor="middle" x="350.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node9 -->
-<g id="edge8_Node000005_Node000009" class="edge">
-<title>Node5&#45;&gt;Node9</title>
-<g id="a_edge8_Node000005_Node000009"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M248.14,-48.96C265.08,-42.37 285,-34.62 303,-27.62 306.2,-26.38 309.52,-25.09 312.85,-23.8"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.91,-27.14 321.96,-20.26 311.37,-20.62 313.91,-27.14"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d82/breadth__first__search_8cpp_source.html b/df/d82/breadth__first__search_8cpp_source.html
new file mode 100644
index 000000000..dfd33341b
--- /dev/null
+++ b/df/d82/breadth__first__search_8cpp_source.html
@@ -0,0 +1,273 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/breadth_first_search.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/d82/breadth__first__search_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">breadth_first_search.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../df/d82/breadth__first__search_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="preprocessor">#include &lt;list&gt;</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="preprocessor">#include &lt;map&gt;</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="preprocessor">#include &lt;queue&gt;</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="preprocessor">#include &lt;string&gt;</span></div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span> </div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span><span class="comment">/* Class Graph definition */</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span><span class="keyword">class </span><a class="code hl_class" href="../../da/d9a/class_graph.html">Graph</a> {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="../../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0">   69</a></span>    std::map&lt;T, std::list&lt;T&gt; &gt; <a class="code hl_variable" href="../../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span> </div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a>() = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    ;</div>
+<div class="foldopen" id="foldopen00074" data-start="{" data-end="}">
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"><a class="line" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">   74</a></span>    <span class="keywordtype">void</span> <a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(T u, T v, <span class="keywordtype">bool</span> bidir = <span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>        <a class="code hl_variable" href="../../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[u].push_back(v);  <span class="comment">// u--&gt;v edge added</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>        <span class="keywordflow">if</span> (bidir == <span class="keyword">true</span>) {</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>            <span class="comment">// if graph is bidirectional</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>            <a class="code hl_variable" href="../../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[v].push_back(u);  <span class="comment">// v--&gt;u edge added</span></div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>        }</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    }</div>
+</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
+<div class="foldopen" id="foldopen00096" data-start="{" data-end="}">
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"><a class="line" href="../../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981">   96</a></span>    std::map&lt;T, bool&gt; <a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981">breadth_first_search</a>(T src) {</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>        std::map&lt;T, bool&gt; visited;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>        <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span> &amp;adjlist : <a class="code hl_variable" href="../../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>) {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>            visited[adjlist.first] = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>            <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span> &amp;<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> : <a class="code hl_variable" href="../../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[adjlist.first]) {</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>                visited[<a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>] = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>            }</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>        }</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span> </div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>        std::queue&lt;T&gt; tracker;</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span> </div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>        tracker.push(src);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>        visited[src] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>        <span class="keywordflow">while</span> (!tracker.empty()) {</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>            T <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = tracker.front();</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>            tracker.pop();</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>            <span class="keywordflow">for</span> (T <span class="keyword">const</span> &amp;neighbour : <a class="code hl_variable" href="../../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>]) {</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>                <span class="keywordflow">if</span> (!visited[neighbour]) {</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>                    tracker.push(neighbour);</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>                    visited[neighbour] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>                }</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>            }</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>        }</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>        <span class="keywordflow">return</span> visited;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    }</div>
+</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>};</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span><span class="comment">/* Class definition ends */</span></div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>}  <span class="comment">// namespace graph</span></div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span> </div>
+<div class="foldopen" id="foldopen00139" data-start="{" data-end="}">
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"><a class="line" href="../../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">  139</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>() {</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>    <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt;int&gt;</a> g;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    std::map&lt;int, bool&gt; correct_result;</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    g.add_edge(0, 1);</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>    g.add_edge(1, 2);</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    g.add_edge(2, 3);</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    correct_result[0] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    correct_result[1] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>    correct_result[2] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    correct_result[3] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span> </div>
+<div class="line"><a id="l00151" name="l00151"></a><span class="lineno">  151</span>    std::map&lt;int, bool&gt; returned_result = g.breadth_first_search(2);</div>
+<div class="line"><a id="l00152" name="l00152"></a><span class="lineno">  152</span> </div>
+<div class="line"><a id="l00153" name="l00153"></a><span class="lineno">  153</span>    assert(returned_result == correct_result);</div>
+<div class="line"><a id="l00154" name="l00154"></a><span class="lineno">  154</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span> </div>
+<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span>    returned_result = g.breadth_first_search(0);</div>
+<div class="line"><a id="l00158" name="l00158"></a><span class="lineno">  158</span> </div>
+<div class="line"><a id="l00159" name="l00159"></a><span class="lineno">  159</span>    assert(returned_result == correct_result);</div>
+<div class="line"><a id="l00160" name="l00160"></a><span class="lineno">  160</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00161" name="l00161"></a><span class="lineno">  161</span> </div>
+<div class="line"><a id="l00163" name="l00163"></a><span class="lineno">  163</span>    <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt;std::string&gt;</a> g2;</div>
+<div class="line"><a id="l00164" name="l00164"></a><span class="lineno">  164</span> </div>
+<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span>    g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">&quot;Gorakhpur&quot;</span>, <span class="stringliteral">&quot;Lucknow&quot;</span>, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00166" name="l00166"></a><span class="lineno">  166</span>    g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">&quot;Gorakhpur&quot;</span>, <span class="stringliteral">&quot;Kanpur&quot;</span>, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00167" name="l00167"></a><span class="lineno">  167</span>    g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">&quot;Lucknow&quot;</span>, <span class="stringliteral">&quot;Agra&quot;</span>, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00168" name="l00168"></a><span class="lineno">  168</span>    g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">&quot;Kanpur&quot;</span>, <span class="stringliteral">&quot;Agra&quot;</span>, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00169" name="l00169"></a><span class="lineno">  169</span>    g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">&quot;Lucknow&quot;</span>, <span class="stringliteral">&quot;Prayagraj&quot;</span>, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00170" name="l00170"></a><span class="lineno">  170</span>    g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(<span class="stringliteral">&quot;Agra&quot;</span>, <span class="stringliteral">&quot;Noida&quot;</span>, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00171" name="l00171"></a><span class="lineno">  171</span> </div>
+<div class="line"><a id="l00172" name="l00172"></a><span class="lineno">  172</span>    std::map&lt;std::string, bool&gt; correct_res;</div>
+<div class="line"><a id="l00173" name="l00173"></a><span class="lineno">  173</span>    std::map&lt;std::string, bool&gt; returned_res =</div>
+<div class="line"><a id="l00174" name="l00174"></a><span class="lineno">  174</span>        g2.<a class="code hl_function" href="../../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981">breadth_first_search</a>(<span class="stringliteral">&quot;Kanpur&quot;</span>);</div>
+<div class="line"><a id="l00175" name="l00175"></a><span class="lineno">  175</span>    correct_res[<span class="stringliteral">&quot;Gorakhpur&quot;</span>] = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00176" name="l00176"></a><span class="lineno">  176</span>    correct_res[<span class="stringliteral">&quot;Lucknow&quot;</span>] = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00177" name="l00177"></a><span class="lineno">  177</span>    correct_res[<span class="stringliteral">&quot;Kanpur&quot;</span>] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00178" name="l00178"></a><span class="lineno">  178</span>    correct_res[<span class="stringliteral">&quot;Agra&quot;</span>] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00179" name="l00179"></a><span class="lineno">  179</span>    correct_res[<span class="stringliteral">&quot;Prayagraj&quot;</span>] = <span class="keyword">false</span>;</div>
+<div class="line"><a id="l00180" name="l00180"></a><span class="lineno">  180</span>    correct_res[<span class="stringliteral">&quot;Noida&quot;</span>] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00181" name="l00181"></a><span class="lineno">  181</span>    assert(correct_res == returned_res);</div>
+<div class="line"><a id="l00182" name="l00182"></a><span class="lineno">  182</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 3 Passed...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00183" name="l00183"></a><span class="lineno">  183</span>}</div>
+</div>
+<div class="line"><a id="l00184" name="l00184"></a><span class="lineno">  184</span> </div>
+<div class="foldopen" id="foldopen00186" data-start="{" data-end="}">
+<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"><a class="line" href="../../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  186</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00187" name="l00187"></a><span class="lineno">  187</span>    <a class="code hl_function" href="../../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();</div>
+<div class="line"><a id="l00188" name="l00188"></a><span class="lineno">  188</span>    <span class="keywordtype">size_t</span> edges = 0;</div>
+<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of edges: &quot;</span>;</div>
+<div class="line"><a id="l00190" name="l00190"></a><span class="lineno">  190</span>    std::cin &gt;&gt; edges;</div>
+<div class="line"><a id="l00191" name="l00191"></a><span class="lineno">  191</span> </div>
+<div class="line"><a id="l00192" name="l00192"></a><span class="lineno">  192</span>    <a class="code hl_class" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt;int&gt;</a> g;</div>
+<div class="line"><a id="l00193" name="l00193"></a><span class="lineno">  193</span> </div>
+<div class="line"><a id="l00194" name="l00194"></a><span class="lineno">  194</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter space-separated pairs of vertices that form edges: &quot;</span></div>
+<div class="line"><a id="l00195" name="l00195"></a><span class="lineno">  195</span>              &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00196" name="l00196"></a><span class="lineno">  196</span>    <span class="keywordflow">while</span> (edges--) {</div>
+<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>        <span class="keywordtype">int</span> u = 0, v = 0;</div>
+<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>        std::cin &gt;&gt; u &gt;&gt; v;</div>
+<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span>        g.add_edge(u, v);</div>
+<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>    }</div>
+<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span> </div>
+<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span>    g.breadth_first_search(0);</div>
+<div class="line"><a id="l00203" name="l00203"></a><span class="lineno">  203</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00204" name="l00204"></a><span class="lineno">  204</span>}</div>
+</div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
+<div class="ttc" id="abreadth__first__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition</b> <a href="#l00139">breadth_first_search.cpp:139</a></div></div>
+<div class="ttc" id="abreadth__first__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00186">breadth_first_search.cpp:186</a></div></div>
+<div class="ttc" id="aclass_graph_html"><div class="ttname"><a href="../../da/d9a/class_graph.html">Graph</a></div><div class="ttdef"><b>Definition</b> <a href="../../df/d14/bellman__ford_8cpp_source.html#l00014">bellman_ford.cpp:14</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_graph_html"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a></div><div class="ttdef"><b>Definition</b> <a href="../../de/dde/lowest__common__ancestor_8cpp_source.html#l00053">lowest_common_ancestor.cpp:53</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_graph_html_a3755ec9e6a842238c7f4aac10b661981"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981">graph::Graph::breadth_first_search</a></div><div class="ttdeci">std::map&lt; T, bool &gt; breadth_first_search(T src)</div><div class="ttdef"><b>Definition</b> <a href="#l00096">breadth_first_search.cpp:96</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_graph_html_a877b2cba40d8d46dde6fb4209effed19"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">graph::Graph::add_edge</a></div><div class="ttdeci">void add_edge(T u, T v, bool bidir=true)</div><div class="ttdef"><b>Definition</b> <a href="#l00074">breadth_first_search.cpp:74</a></div></div>
+<div class="ttc" id="aclassgraph_1_1_graph_html_acebf0505d625b043bb9c8c27c7a8def0"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0">graph::Graph::adjacency_list</a></div><div class="ttdeci">std::map&lt; T, std::list&lt; T &gt; &gt; adjacency_list</div><div class="ttdef"><b>Definition</b> <a href="#l00069">breadth_first_search.cpp:69</a></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 class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a class="el" href="../../df/d82/breadth__first__search_8cpp.html">breadth_first_search.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/d82/classgraph_1_1_h_k_graph__coll__graph.map b/df/d82/classgraph_1_1_h_k_graph__coll__graph.map
index b28692291..fe529520b 100644
--- a/df/d82/classgraph_1_1_h_k_graph__coll__graph.map
+++ b/df/d82/classgraph_1_1_h_k_graph__coll__graph.map
@@ -1,9 +1,9 @@
 <map id="graph::HKGraph" name="graph::HKGraph">
 <area shape="rect" id="Node000001" title="Represents Bipartite graph for Hopcroft Karp implementation." alt="" coords="93,228,208,253"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="5,94,144,135"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,144,135"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="97,147,145,226,141,228,92,149"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list.html" title=" " alt="" coords="23,5,126,31"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="23,5,126,31"/>
 <area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="77,46,77,93,72,93,72,46"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="167,102,288,127"/>
+<area shape="rect" id="Node000004" title=" " alt="" coords="167,102,288,127"/>
 <area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="215,142,160,229,156,226,210,139"/>
 </map>
diff --git a/df/d82/classgraph_1_1_h_k_graph__coll__graph.md5 b/df/d82/classgraph_1_1_h_k_graph__coll__graph.md5
index 3f0c9efa3..a6384e9e8 100644
--- a/df/d82/classgraph_1_1_h_k_graph__coll__graph.md5
+++ b/df/d82/classgraph_1_1_h_k_graph__coll__graph.md5
@@ -1 +1 @@
-356ddd95dc9cd91243361fbffa1ee341
\ No newline at end of file
+26a16adfc8d3efa9111432be5e0888b6
\ No newline at end of file
diff --git a/df/d82/classgraph_1_1_h_k_graph__coll__graph.svg b/df/d82/classgraph_1_1_h_k_graph__coll__graph.svg
index 51bf055a4..b197ca18f 100644
--- a/df/d82/classgraph_1_1_h_k_graph__coll__graph.svg
+++ b/df/d82/classgraph_1_1_h_k_graph__coll__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="103.75,-119.5 0,-119.5 0,-89 103.75,-89 103.75,-119.5"/>
 <text text-anchor="start" x="8" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::list</text>
 <text text-anchor="middle" x="51.88" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -51,7 +51,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="90.25,-186 13.5,-186 13.5,-166.75 90.25,-166.75 90.25,-186"/>
 <text text-anchor="middle" x="51.88" y="-172.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list&lt; int &gt;</text>
 </a>
@@ -70,7 +70,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="212.38,-113.88 121.38,-113.88 121.38,-94.62 212.38,-94.62 212.38,-113.88"/>
 <text text-anchor="middle" x="166.88" y="-100.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
diff --git a/df/d82/classgraph_1_1_h_k_graph__coll__graph_org.svg b/df/d82/classgraph_1_1_h_k_graph__coll__graph_org.svg
index ae25b1e53..0e0de1ba4 100644
--- a/df/d82/classgraph_1_1_h_k_graph__coll__graph_org.svg
+++ b/df/d82/classgraph_1_1_h_k_graph__coll__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="103.75,-119.5 0,-119.5 0,-89 103.75,-89 103.75,-119.5"/>
 <text text-anchor="start" x="8" y="-106" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::list</text>
 <text text-anchor="middle" x="51.88" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -40,7 +40,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="90.25,-186 13.5,-186 13.5,-166.75 90.25,-166.75 90.25,-186"/>
 <text text-anchor="middle" x="51.88" y="-172.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list&lt; int &gt;</text>
 </a>
@@ -59,7 +59,7 @@
 <!-- Node4 -->
 <g id="Node000004" class="node">
 <title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000004"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="212.38,-113.88 121.38,-113.88 121.38,-94.62 212.38,-94.62 212.38,-113.88"/>
 <text text-anchor="middle" x="166.88" y="-100.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
diff --git a/df/d88/namespacedp.html b/df/d88/namespacedp.html
index 4d16a80e5..084fc19c0 100644
--- a/df/d88/namespacedp.html
+++ b/df/d88/namespacedp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dp Namespace Reference</title>
+<title>TheAlgorithms/C++: dp Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -108,11 +125,11 @@ $(function(){initNavTree('df/d88/namespacedp.html','../../'); initResizable(true
 </div><!--header-->
 <div class="contents">
 
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>  
+<p>for std::vector  
 <a href="#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>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> for IO Operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/accumulate.html">std::accumulate</a> </p>
+<div class="textblock"><p>for std::vector </p>
+<p>for assert for std::uint64_t for IO Operations for std::accumulate </p>
 </div></div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/df/d8e/namespacetrie__operations.html b/df/d8e/namespacetrie__operations.html
index 923096b57..528a908b3 100644
--- a/df/d8e/namespacetrie__operations.html
+++ b/df/d8e/namespacetrie__operations.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: trie_operations Namespace Reference</title>
+<title>TheAlgorithms/C++: trie_operations Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html b/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html
index 20e60eb44..6e3f80e55 100644
--- a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html
+++ b/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others::Cache::LFUCache&lt; K, V &gt; Class Template Reference</title>
+<title>TheAlgorithms/C++: others::Cache::LFUCache&lt; K, V &gt; Class Template Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -150,7 +167,7 @@ Private Member Functions</h2></td></tr>
 <tr class="memitem:adad4ab43141fb8ba43facd3a71e07047" id="r_adad4ab43141fb8ba43facd3a71e07047"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adad4ab43141fb8ba43facd3a71e07047">push</a> (int freq, <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
 <tr class="memdesc:adad4ab43141fb8ba43facd3a71e07047"><td class="mdescLeft">&#160;</td><td class="mdescRight">push the node at first position in the linked list of given frequency  <br /></td></tr>
 <tr class="separator:adad4ab43141fb8ba43facd3a71e07047"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a16a25c102554c5653721a5112ef676c9" id="r_a16a25c102554c5653721a5112ef676c9"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a16a25c102554c5653721a5112ef676c9">increase_frequency</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *, int &gt; &amp;p_node)</td></tr>
+<tr class="memitem:a16a25c102554c5653721a5112ef676c9" id="r_a16a25c102554c5653721a5112ef676c9"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a16a25c102554c5653721a5112ef676c9">increase_frequency</a> (std::pair&lt; <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *, int &gt; &amp;p_node)</td></tr>
 <tr class="memdesc:a16a25c102554c5653721a5112ef676c9"><td class="mdescLeft">&#160;</td><td class="mdescRight">increase the frequency of node and push it in the respective list.  <br /></td></tr>
 <tr class="separator:a16a25c102554c5653721a5112ef676c9"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ab3561ab204754295199f9566924f7e69" id="r_ab3561ab204754295199f9566924f7e69"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab3561ab204754295199f9566924f7e69">pop</a> ()</td></tr>
@@ -159,21 +176,17 @@ Private Member Functions</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:ac7684879e2e5da3d8bc5b1699ee42d35" id="r_ac7684879e2e5da3d8bc5b1699ee42d35"><td class="memItemLeft" align="right" valign="top"><a id="ac7684879e2e5da3d8bc5b1699ee42d35" name="ac7684879e2e5da3d8bc5b1699ee42d35"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a>&lt; K, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *, int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>node_map</b></td></tr>
-<tr class="memdesc:ac7684879e2e5da3d8bc5b1699ee42d35"><td class="mdescLeft">&#160;</td><td class="mdescRight">maps the key to the node address and frequency <br /></td></tr>
+<tr class="memitem:ac7684879e2e5da3d8bc5b1699ee42d35" id="r_ac7684879e2e5da3d8bc5b1699ee42d35"><td class="memItemLeft" align="right" valign="top">std::unordered_map&lt; K, std::pair&lt; <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *, int &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a></td></tr>
+<tr class="memdesc:ac7684879e2e5da3d8bc5b1699ee42d35"><td class="mdescLeft">&#160;</td><td class="mdescRight">maps the key to the node address and frequency  <br /></td></tr>
 <tr class="separator:ac7684879e2e5da3d8bc5b1699ee42d35"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:aba5d59d0f6ab0c0d30a92551ca5a05f2" id="r_aba5d59d0f6ab0c0d30a92551ca5a05f2"><td class="memItemLeft" align="right" valign="top"><a id="aba5d59d0f6ab0c0d30a92551ca5a05f2" name="aba5d59d0f6ab0c0d30a92551ca5a05f2"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a>&lt; int, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *, <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; * &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>freq_map</b></td></tr>
-<tr class="memdesc:aba5d59d0f6ab0c0d30a92551ca5a05f2"><td class="mdescLeft">&#160;</td><td class="mdescRight">maps the frequency to doubly linked list <br /></td></tr>
+<tr class="memitem:aba5d59d0f6ab0c0d30a92551ca5a05f2" id="r_aba5d59d0f6ab0c0d30a92551ca5a05f2"><td class="memItemLeft" align="right" valign="top">std::unordered_map&lt; int, std::pair&lt; <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *, <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; * &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a></td></tr>
+<tr class="memdesc:aba5d59d0f6ab0c0d30a92551ca5a05f2"><td class="mdescLeft">&#160;</td><td class="mdescRight">maps the frequency to doubly linked list  <br /></td></tr>
 <tr class="separator:aba5d59d0f6ab0c0d30a92551ca5a05f2"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a6de844d1589a809239cc07752f311285" id="r_a6de844d1589a809239cc07752f311285"><td class="memItemLeft" align="right" valign="top"><a id="a6de844d1589a809239cc07752f311285" name="a6de844d1589a809239cc07752f311285"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>minFreq</b></td></tr>
-<tr class="memdesc:a6de844d1589a809239cc07752f311285"><td class="mdescLeft">&#160;</td><td class="mdescRight">minimum frequency in the cache <br /></td></tr>
+<tr class="memitem:a6de844d1589a809239cc07752f311285" id="r_a6de844d1589a809239cc07752f311285"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6de844d1589a809239cc07752f311285">minFreq</a></td></tr>
+<tr class="memdesc:a6de844d1589a809239cc07752f311285"><td class="mdescLeft">&#160;</td><td class="mdescRight">minimum frequency in the cache  <br /></td></tr>
 <tr class="separator:a6de844d1589a809239cc07752f311285"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a3acc10e6bb67d9d9c4187f625723e6c5" id="r_a3acc10e6bb67d9d9c4187f625723e6c5"><td class="memItemLeft" align="right" valign="top"><a id="a3acc10e6bb67d9d9c4187f625723e6c5" name="a3acc10e6bb67d9d9c4187f625723e6c5"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>_capacity</b></td></tr>
-<tr class="memdesc:a3acc10e6bb67d9d9c4187f625723e6c5"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum capacity of the cache <br /></td></tr>
+<tr class="memitem:a3acc10e6bb67d9d9c4187f625723e6c5" id="r_a3acc10e6bb67d9d9c4187f625723e6c5"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3acc10e6bb67d9d9c4187f625723e6c5">_capacity</a></td></tr>
+<tr class="memdesc:a3acc10e6bb67d9d9c4187f625723e6c5"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum capacity of the cache  <br /></td></tr>
 <tr class="separator:a3acc10e6bb67d9d9c4187f625723e6c5"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -186,6 +199,8 @@ class others::Cache::LFUCache&lt; K, V &gt;</div><p><a class="el" href="../../df
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00064">64</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
 </div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
 <a id="affd7776c246caa2d0f92fd8616f6e5dc" name="affd7776c246caa2d0f92fd8616f6e5dc"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#affd7776c246caa2d0f92fd8616f6e5dc">&#9670;&#160;</a></span>LFUCache()</h2>
@@ -219,9 +234,11 @@ template&lt;typename K , typename V &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00078">78</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   78</span>: <a class="code hl_variable" href="#a6de844d1589a809239cc07752f311285">minFreq</a>(0), <a class="code hl_variable" href="#a3acc10e6bb67d9d9c4187f625723e6c5">_capacity</a>(<a class="code hl_variable" href="#a3acc10e6bb67d9d9c4187f625723e6c5">_capacity</a>) {}</div>
-<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_a3acc10e6bb67d9d9c4187f625723e6c5"><div class="ttname"><a href="#a3acc10e6bb67d9d9c4187f625723e6c5">others::Cache::LFUCache::_capacity</a></div><div class="ttdeci">int _capacity</div><div class="ttdoc">maximum capacity of the cache</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:71</div></div>
-<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_a6de844d1589a809239cc07752f311285"><div class="ttname"><a href="#a6de844d1589a809239cc07752f311285">others::Cache::LFUCache::minFreq</a></div><div class="ttdeci">int minFreq</div><div class="ttdoc">minimum frequency in the cache</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:70</div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_a3acc10e6bb67d9d9c4187f625723e6c5"><div class="ttname"><a href="#a3acc10e6bb67d9d9c4187f625723e6c5">others::Cache::LFUCache::_capacity</a></div><div class="ttdeci">int _capacity</div><div class="ttdoc">maximum capacity of the cache</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d65/lfu__cache_8cpp_source.html#l00071">lfu_cache.cpp:71</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_a6de844d1589a809239cc07752f311285"><div class="ttname"><a href="#a6de844d1589a809239cc07752f311285">others::Cache::LFUCache::minFreq</a></div><div class="ttdeci">int minFreq</div><div class="ttdoc">minimum frequency in the cache</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d65/lfu__cache_8cpp_source.html#l00070">lfu_cache.cpp:70</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -251,6 +268,8 @@ template&lt;typename K , typename V &gt; </div>
 </div><div class="memdoc">
 
 <p>destructs the cache, iterates on the map and deletes every node present in the cache. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00235">235</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  235</span>                {</div>
 <div class="line"><span class="lineno">  236</span>        <span class="keyword">auto</span> it = <a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.begin();</div>
 <div class="line"><span class="lineno">  237</span>        <span class="keywordflow">while</span> (it != <a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.end()) {</div>
@@ -258,7 +277,7 @@ template&lt;typename K , typename V &gt; </div>
 <div class="line"><span class="lineno">  239</span>            ++it;</div>
 <div class="line"><span class="lineno">  240</span>        }</div>
 <div class="line"><span class="lineno">  241</span>    }</div>
-<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_ac7684879e2e5da3d8bc5b1699ee42d35"><div class="ttname"><a href="#ac7684879e2e5da3d8bc5b1699ee42d35">others::Cache::LFUCache::node_map</a></div><div class="ttdeci">std::unordered_map&lt; K, std::pair&lt; CacheNode&lt; K, V &gt; *, int &gt; &gt; node_map</div><div class="ttdoc">maps the key to the node address and frequency</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:66</div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_ac7684879e2e5da3d8bc5b1699ee42d35"><div class="ttname"><a href="#ac7684879e2e5da3d8bc5b1699ee42d35">others::Cache::LFUCache::node_map</a></div><div class="ttdeci">std::unordered_map&lt; K, std::pair&lt; CacheNode&lt; K, V &gt; *, int &gt; &gt; node_map</div><div class="ttdoc">maps the key to the node address and frequency</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d65/lfu__cache_8cpp_source.html#l00066">lfu_cache.cpp:66</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -290,6 +309,8 @@ template&lt;typename K , typename V &gt; </div>
 
 <p>Returns the total capacity of the cache. </p>
 <dl class="section return"><dt>Returns</dt><dd>Total capacity of the cache </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00223">223</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  223</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a3acc10e6bb67d9d9c4187f625723e6c5">_capacity</a>; }</div>
 </div><!-- fragment -->
 </div>
@@ -321,6 +342,8 @@ template&lt;typename K , typename V &gt; </div>
 
 <p>returns true if the cache is empty, false otherwise. </p>
 <dl class="section return"><dt>Returns</dt><dd>true if the cache is empty, false otherwise. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00229">229</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  229</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.empty(); }</div>
 </div><!-- fragment -->
 </div>
@@ -364,9 +387,11 @@ template&lt;typename K , typename V &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00202">202</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  202</span>                 {</div>
 <div class="line"><span class="lineno">  203</span>        <span class="keywordflow">if</span> (!<a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.count(key)) {</div>
-<div class="line"><span class="lineno">  204</span>            <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/runtime_error.html">std::runtime_error</a>(<span class="stringliteral">&quot;key is not present in the cache&quot;</span>);</div>
+<div class="line"><span class="lineno">  204</span>            <span class="keywordflow">throw</span> std::runtime_error(<span class="stringliteral">&quot;key is not present in the cache&quot;</span>);</div>
 <div class="line"><span class="lineno">  205</span>        }</div>
 <div class="line"><span class="lineno">  206</span> </div>
 <div class="line"><span class="lineno">  207</span>        <span class="comment">// increase the frequency and return the value</span></div>
@@ -374,14 +399,8 @@ template&lt;typename K , typename V &gt; </div>
 <div class="line"><span class="lineno">  209</span>        <a class="code hl_function" href="#a16a25c102554c5653721a5112ef676c9">increase_frequency</a>(<a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>[key]);</div>
 <div class="line"><span class="lineno">  210</span>        <span class="keywordflow">return</span> value;</div>
 <div class="line"><span class="lineno">  211</span>    }</div>
-<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_a16a25c102554c5653721a5112ef676c9"><div class="ttname"><a href="#a16a25c102554c5653721a5112ef676c9">others::Cache::LFUCache::increase_frequency</a></div><div class="ttdeci">void increase_frequency(std::pair&lt; CacheNode&lt; K, V &gt; *, int &gt; &amp;p_node)</div><div class="ttdoc">increase the frequency of node and push it in the respective list.</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:109</div></div>
-<div class="ttc" id="aruntime_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/runtime_error.html">std::runtime_error</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph.svg" width="656" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_a16a25c102554c5653721a5112ef676c9"><div class="ttname"><a href="#a16a25c102554c5653721a5112ef676c9">others::Cache::LFUCache::increase_frequency</a></div><div class="ttdeci">void increase_frequency(std::pair&lt; CacheNode&lt; K, V &gt; *, int &gt; &amp;p_node)</div><div class="ttdoc">increase the frequency of node and push it in the respective list.</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d65/lfu__cache_8cpp_source.html#l00109">lfu_cache.cpp:109</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a16a25c102554c5653721a5112ef676c9" name="a16a25c102554c5653721a5112ef676c9"></a>
@@ -398,7 +417,7 @@ template&lt;typename K , typename V &gt; </div>
         <tr>
           <td class="memname">void <a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache</a>&lt; K, V &gt;::increase_frequency </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *, int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>p_node</em></span></td><td>)</td>
+          <td class="paramtype">std::pair&lt; <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt; K, V &gt; *, int &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>p_node</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -416,11 +435,13 @@ template&lt;typename K , typename V &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00109">109</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  109</span>                                                                     {</div>
 <div class="line"><span class="lineno">  110</span>        CacheNode&lt;K, V&gt; *<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> = p_node.first;</div>
 <div class="line"><span class="lineno">  111</span>        <span class="keywordtype">int</span> freq = p_node.second;</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/utility/pair.html">std::pair&lt;CacheNode&lt;K, V&gt;</a> *, CacheNode&lt;K, V&gt; *&gt; &amp;p = <a class="code hl_variable" href="#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>[freq];</div>
+<div class="line"><span class="lineno">  113</span>        std::pair&lt;CacheNode&lt;K, V&gt; *, CacheNode&lt;K, V&gt; *&gt; &amp;p = <a class="code hl_variable" href="#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>[freq];</div>
 <div class="line"><span class="lineno">  114</span> </div>
 <div class="line"><span class="lineno">  115</span>        <span class="comment">// if the given node is the only node in the list,</span></div>
 <div class="line"><span class="lineno">  116</span>        <span class="comment">// then erase the frequency from map</span></div>
@@ -432,38 +453,30 @@ template&lt;typename K , typename V &gt; </div>
 <div class="line"><span class="lineno">  122</span>            }</div>
 <div class="line"><span class="lineno">  123</span>        } <span class="keywordflow">else</span> {</div>
 <div class="line"><span class="lineno">  124</span>            <span class="comment">// remove the given node from current freq linked list</span></div>
-<div class="line"><span class="lineno">  125</span>            CacheNode&lt;K, V&gt; *<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a> = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;prev;</div>
-<div class="line"><span class="lineno">  126</span>            CacheNode&lt;K, V&gt; *<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a> = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next;</div>
+<div class="line"><span class="lineno">  125</span>            CacheNode&lt;K, V&gt; *prev = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;prev;</div>
+<div class="line"><span class="lineno">  126</span>            CacheNode&lt;K, V&gt; *next = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next;</div>
 <div class="line"><span class="lineno">  127</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;prev = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  128</span>            <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next = <span class="keyword">nullptr</span>;</div>
 <div class="line"><span class="lineno">  129</span> </div>
 <div class="line"><span class="lineno">  130</span>            <span class="keywordflow">if</span> (prev) {</div>
-<div class="line"><span class="lineno">  131</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a>-&gt;next = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a>;</div>
+<div class="line"><span class="lineno">  131</span>                prev-&gt;next = next;</div>
 <div class="line"><span class="lineno">  132</span>            } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  133</span>                p.first = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a>;</div>
+<div class="line"><span class="lineno">  133</span>                p.first = next;</div>
 <div class="line"><span class="lineno">  134</span>            }</div>
 <div class="line"><span class="lineno">  135</span> </div>
 <div class="line"><span class="lineno">  136</span>            <span class="keywordflow">if</span> (next) {</div>
-<div class="line"><span class="lineno">  137</span>                <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a>-&gt;prev = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a>;</div>
+<div class="line"><span class="lineno">  137</span>                next-&gt;prev = prev;</div>
 <div class="line"><span class="lineno">  138</span>            } <span class="keywordflow">else</span> {</div>
-<div class="line"><span class="lineno">  139</span>                p.second = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/prev.html">prev</a>;</div>
+<div class="line"><span class="lineno">  139</span>                p.second = prev;</div>
 <div class="line"><span class="lineno">  140</span>            }</div>
 <div class="line"><span class="lineno">  141</span>        }</div>
 <div class="line"><span class="lineno">  142</span>        <a class="code hl_function" href="#adad4ab43141fb8ba43facd3a71e07047">push</a>(freq + 1, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
 <div class="line"><span class="lineno">  143</span>        ++p_node.second;</div>
 <div class="line"><span class="lineno">  144</span>    }</div>
-<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_aba5d59d0f6ab0c0d30a92551ca5a05f2"><div class="ttname"><a href="#aba5d59d0f6ab0c0d30a92551ca5a05f2">others::Cache::LFUCache::freq_map</a></div><div class="ttdeci">std::unordered_map&lt; int, std::pair&lt; CacheNode&lt; K, V &gt; *, CacheNode&lt; K, V &gt; * &gt; &gt; freq_map</div><div class="ttdoc">maps the frequency to doubly linked list</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:68</div></div>
-<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_adad4ab43141fb8ba43facd3a71e07047"><div class="ttname"><a href="#adad4ab43141fb8ba43facd3a71e07047">others::Cache::LFUCache::push</a></div><div class="ttdeci">void push(int freq, CacheNode&lt; K, V &gt; *node)</div><div class="ttdoc">push the node at first position in the linked list of given frequency</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:88</div></div>
-<div class="ttc" id="anext_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/next.html">std::next</a></div><div class="ttdeci">T next(T... args)</div></div>
-<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
-<div class="ttc" id="aprev_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/prev.html">std::prev</a></div><div class="ttdeci">T prev(T... args)</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph.svg" width="408" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_aba5d59d0f6ab0c0d30a92551ca5a05f2"><div class="ttname"><a href="#aba5d59d0f6ab0c0d30a92551ca5a05f2">others::Cache::LFUCache::freq_map</a></div><div class="ttdeci">std::unordered_map&lt; int, std::pair&lt; CacheNode&lt; K, V &gt; *, CacheNode&lt; K, V &gt; * &gt; &gt; freq_map</div><div class="ttdoc">maps the frequency to doubly linked list</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d65/lfu__cache_8cpp_source.html#l00068">lfu_cache.cpp:68</a></div></div>
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_adad4ab43141fb8ba43facd3a71e07047"><div class="ttname"><a href="#adad4ab43141fb8ba43facd3a71e07047">others::Cache::LFUCache::push</a></div><div class="ttdeci">void push(int freq, CacheNode&lt; K, V &gt; *node)</div><div class="ttdoc">push the node at first position in the linked list of given frequency</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d65/lfu__cache_8cpp_source.html#l00088">lfu_cache.cpp:88</a></div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ab3561ab204754295199f9566924f7e69" name="ab3561ab204754295199f9566924f7e69"></a>
@@ -492,8 +505,10 @@ template&lt;typename K , typename V &gt; </div>
 </div><div class="memdoc">
 
 <p>pop the last node in the least frequently used linked list </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00149">149</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  149</span>               {</div>
-<div class="line"><span class="lineno">  150</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;CacheNode&lt;K, V&gt;</a> *, CacheNode&lt;K, V&gt; *&gt; &amp;p = <a class="code hl_variable" href="#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>[<a class="code hl_variable" href="#a6de844d1589a809239cc07752f311285">minFreq</a>];</div>
+<div class="line"><span class="lineno">  150</span>        std::pair&lt;CacheNode&lt;K, V&gt; *, CacheNode&lt;K, V&gt; *&gt; &amp;p = <a class="code hl_variable" href="#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>[<a class="code hl_variable" href="#a6de844d1589a809239cc07752f311285">minFreq</a>];</div>
 <div class="line"><span class="lineno">  151</span> </div>
 <div class="line"><span class="lineno">  152</span>        <span class="comment">// if there is only one node</span></div>
 <div class="line"><span class="lineno">  153</span>        <span class="comment">// remove the node and erase</span></div>
@@ -550,6 +565,8 @@ template&lt;typename K , typename V &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00088">88</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   88</span>                                               {</div>
 <div class="line"><span class="lineno">   89</span>        <span class="comment">// if freq is not present, then make a new list with node as the head as</span></div>
 <div class="line"><span class="lineno">   90</span>        <span class="comment">// well as tail.</span></div>
@@ -558,7 +575,7 @@ template&lt;typename K , typename V &gt; </div>
 <div class="line"><span class="lineno">   93</span>            <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">   94</span>        }</div>
 <div class="line"><span class="lineno">   95</span> </div>
-<div class="line"><span class="lineno">   96</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;CacheNode&lt;K, V&gt;</a> *, CacheNode&lt;K, V&gt; *&gt; &amp;p = <a class="code hl_variable" href="#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>[freq];</div>
+<div class="line"><span class="lineno">   96</span>        std::pair&lt;CacheNode&lt;K, V&gt; *, CacheNode&lt;K, V&gt; *&gt; &amp;p = <a class="code hl_variable" href="#aba5d59d0f6ab0c0d30a92551ca5a05f2">freq_map</a>[freq];</div>
 <div class="line"><span class="lineno">   97</span> </div>
 <div class="line"><span class="lineno">   98</span>        <span class="comment">// insert the node at the beginning of the linked list and update the</span></div>
 <div class="line"><span class="lineno">   99</span>        <span class="comment">// head.</span></div>
@@ -566,7 +583,7 @@ template&lt;typename K , typename V &gt; </div>
 <div class="line"><span class="lineno">  101</span>        <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;next = p.first;</div>
 <div class="line"><span class="lineno">  102</span>        p.first = <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
 <div class="line"><span class="lineno">  103</span>    }</div>
-<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
+<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -607,6 +624,8 @@ template&lt;typename K , typename V &gt; </div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00174">174</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  174</span>                             {</div>
 <div class="line"><span class="lineno">  175</span>        <span class="comment">// update the value if key already exists</span></div>
 <div class="line"><span class="lineno">  176</span>        <span class="keywordflow">if</span> (<a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.count(key)) {</div>
@@ -628,13 +647,8 @@ template&lt;typename K , typename V &gt; </div>
 <div class="line"><span class="lineno">  192</span>        <a class="code hl_variable" href="#a6de844d1589a809239cc07752f311285">minFreq</a> = 1;</div>
 <div class="line"><span class="lineno">  193</span>        <a class="code hl_function" href="#adad4ab43141fb8ba43facd3a71e07047">push</a>(1, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>);</div>
 <div class="line"><span class="lineno">  194</span>    }</div>
-<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_ab3561ab204754295199f9566924f7e69"><div class="ttname"><a href="#ab3561ab204754295199f9566924f7e69">others::Cache::LFUCache::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdoc">pop the last node in the least frequently used linked list</div><div class="ttdef"><b>Definition</b> lfu_cache.cpp:149</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph.svg" width="100%" height="414"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
-</div>
-
+<div class="ttc" id="aclassothers_1_1_cache_1_1_l_f_u_cache_html_ab3561ab204754295199f9566924f7e69"><div class="ttname"><a href="#ab3561ab204754295199f9566924f7e69">others::Cache::LFUCache::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdoc">pop the last node in the least frequently used linked list</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d65/lfu__cache_8cpp_source.html#l00149">lfu_cache.cpp:149</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="adbfb2ef7358423fdf1f49d410f55f195" name="adbfb2ef7358423fdf1f49d410f55f195"></a>
@@ -664,12 +678,127 @@ template&lt;typename K , typename V &gt; </div>
 
 <p>Returns the number of items present in the cache. </p>
 <dl class="section return"><dt>Returns</dt><dd>number of items in the cache </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00217">217</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  217</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#ac7684879e2e5da3d8bc5b1699ee42d35">node_map</a>.size(); }</div>
 </div><!-- fragment -->
+</div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="a3acc10e6bb67d9d9c4187f625723e6c5" name="a3acc10e6bb67d9d9c4187f625723e6c5"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a3acc10e6bb67d9d9c4187f625723e6c5">&#9670;&#160;</a></span>_capacity</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename K , typename V &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int <a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache</a>&lt; K, V &gt;::_capacity</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>maximum capacity of the cache </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00071">71</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
+
+</div>
+</div>
+<a id="aba5d59d0f6ab0c0d30a92551ca5a05f2" name="aba5d59d0f6ab0c0d30a92551ca5a05f2"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#aba5d59d0f6ab0c0d30a92551ca5a05f2">&#9670;&#160;</a></span>freq_map</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename K , typename V &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::unordered_map&lt;int, std::pair&lt;<a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt;K, V&gt; *, <a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt;K, V&gt; *&gt; &gt; <a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache</a>&lt; K, V &gt;::freq_map</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>maps the frequency to doubly linked list </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00068">68</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
+
+</div>
+</div>
+<a id="a6de844d1589a809239cc07752f311285" name="a6de844d1589a809239cc07752f311285"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#a6de844d1589a809239cc07752f311285">&#9670;&#160;</a></span>minFreq</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename K , typename V &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">int <a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache</a>&lt; K, V &gt;::minFreq</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>minimum frequency in the cache </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00070">70</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
+
+</div>
+</div>
+<a id="ac7684879e2e5da3d8bc5b1699ee42d35" name="ac7684879e2e5da3d8bc5b1699ee42d35"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ac7684879e2e5da3d8bc5b1699ee42d35">&#9670;&#160;</a></span>node_map</h2>
+
+<div class="memitem">
+<div class="memproto">
+<div class="memtemplate">
+template&lt;typename K , typename V &gt; </div>
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::unordered_map&lt;K, std::pair&lt;<a class="el" href="../../de/d21/classothers_1_1_cache_1_1_d___node.html">CacheNode</a>&lt;K, V&gt; *, int&gt; &gt; <a class="el" href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">others::Cache::LFUCache</a>&lt; K, V &gt;::node_map</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>maps the key to the node address and frequency </p>
+
+<p class="definition">Definition at line <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html#l00066">66</a> of file <a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a>.</p>
+
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>others/<a class="el" href="../../d9/d65/lfu__cache_8cpp.html">lfu_cache.cpp</a></li>
+<li>others/<a class="el" href="../../d9/d65/lfu__cache_8cpp_source.html">lfu_cache.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph.map b/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph.map
deleted file mode 100644
index 1cf680f50..000000000
--- a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="others::Cache::LFUCache::increase_frequency" name="others::Cache::LFUCache::increase_frequency">
-<area shape="rect" id="Node000001" title="increase the frequency of node and push it in the respective list." alt="" coords="5,5,180,46"/>
-<area shape="rect" id="Node000002" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" title="push the node at first position in the linked list of given frequency" alt="" coords="228,5,402,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="180,23,212,23,212,28,180,28"/>
-</map>
diff --git a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph.md5 b/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph.md5
deleted file mode 100644
index 67ab39f10..000000000
--- a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-136e5b2fde508fd9779a8e62e4f72912
\ No newline at end of file
diff --git a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph.svg b/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph.svg
deleted file mode 100644
index 5263716e0..000000000
--- a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::Cache::LFUCache::increase_frequency Pages: 1 -->
-<svg width="306pt" height="39pt"
- viewBox="0.00 0.00 305.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>others::Cache::LFUCache::increase_frequency</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="increase the frequency of node and push it in the respective list.">
-<polygon fill="#999999" stroke="#666666" points="130.75,-30.5 0,-30.5 0,0 130.75,0 130.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="65.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
-<polygon fill="white" stroke="#666666" points="297.5,-30.5 166.75,-30.5 166.75,0 297.5,0 297.5,-30.5"/>
-<text text-anchor="start" x="174.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="232.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.02,-15.25C138.92,-15.25 147.05,-15.25 155.1,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.89,-18.75 164.89,-15.25 154.89,-11.75 154.89,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph_org.svg b/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph_org.svg
deleted file mode 100644
index 7b24966c4..000000000
--- a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a16a25c102554c5653721a5112ef676c9_cgraph_org.svg
+++ /dev/null
@@ -1,41 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::Cache::LFUCache::increase_frequency Pages: 1 -->
-<svg width="306pt" height="39pt"
- viewBox="0.00 0.00 305.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>others::Cache::LFUCache::increase_frequency</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="increase the frequency of node and push it in the respective list.">
-<polygon fill="#999999" stroke="#666666" points="130.75,-30.5 0,-30.5 0,0 130.75,0 130.75,-30.5"/>
-<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="65.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
-<polygon fill="white" stroke="#666666" points="297.5,-30.5 166.75,-30.5 166.75,0 297.5,0 297.5,-30.5"/>
-<text text-anchor="start" x="174.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="232.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.02,-15.25C138.92,-15.25 147.05,-15.25 155.1,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="154.89,-18.75 164.89,-15.25 154.89,-11.75 154.89,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph.map b/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph.map
deleted file mode 100644
index 38f488886..000000000
--- a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="others::Cache::LFUCache::get" name="others::Cache::LFUCache::get">
-<area shape="rect" id="Node000001" title="get the value of the key&#45;value pair if exists" alt="" coords="5,13,206,38"/>
-<area shape="rect" id="Node000002" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" title="increase the frequency of node and push it in the respective list." alt="" coords="254,5,428,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="206,23,238,23,238,28,206,28"/>
-<area shape="rect" id="Node000003" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" title="push the node at first position in the linked list of given frequency" alt="" coords="476,5,650,46"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="428,23,460,23,460,28,428,28"/>
-</map>
diff --git a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph.md5 b/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph.md5
deleted file mode 100644
index 7860c59f0..000000000
--- a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-a478dd2129b44698d51017d165ed8e6b
\ No newline at end of file
diff --git a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph.svg b/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph.svg
deleted file mode 100644
index 1c6ba9cf0..000000000
--- a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph.svg
+++ /dev/null
@@ -1,85 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::Cache::LFUCache::get Pages: 1 -->
-<svg width="492pt" height="39pt"
- viewBox="0.00 0.00 491.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>others::Cache::LFUCache::get</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="get the value of the key&#45;value pair if exists">
-<polygon fill="#999999" stroke="#666666" points="150.25,-24.88 0,-24.88 0,-5.63 150.25,-5.63 150.25,-24.88"/>
-<text text-anchor="middle" x="75.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::get</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" target="_top" xlink:title="increase the frequency of node and push it in the respective list.">
-<polygon fill="white" stroke="#666666" points="317,-30.5 186.25,-30.5 186.25,0 317,0 317,-30.5"/>
-<text text-anchor="start" x="194.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="251.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.63,-15.25C158.54,-15.25 166.59,-15.25 174.51,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.48,-18.75 184.48,-15.25 174.48,-11.75 174.48,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
-<polygon fill="white" stroke="#666666" points="483.75,-30.5 353,-30.5 353,0 483.75,0 483.75,-30.5"/>
-<text text-anchor="start" x="361" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="418.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M317.27,-15.25C325.17,-15.25 333.3,-15.25 341.35,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="341.14,-18.75 351.14,-15.25 341.14,-11.75 341.14,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph_org.svg b/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph_org.svg
deleted file mode 100644
index 998b1dc7a..000000000
--- a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_a58e37d3713f28d36abbb8cdf6c432781_cgraph_org.svg
+++ /dev/null
@@ -1,59 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::Cache::LFUCache::get Pages: 1 -->
-<svg width="492pt" height="39pt"
- viewBox="0.00 0.00 491.75 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
-<title>others::Cache::LFUCache::get</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="get the value of the key&#45;value pair if exists">
-<polygon fill="#999999" stroke="#666666" points="150.25,-24.88 0,-24.88 0,-5.63 150.25,-5.63 150.25,-24.88"/>
-<text text-anchor="middle" x="75.12" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::get</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" target="_top" xlink:title="increase the frequency of node and push it in the respective list.">
-<polygon fill="white" stroke="#666666" points="317,-30.5 186.25,-30.5 186.25,0 317,0 317,-30.5"/>
-<text text-anchor="start" x="194.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="251.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.63,-15.25C158.54,-15.25 166.59,-15.25 174.51,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.48,-18.75 184.48,-15.25 174.48,-11.75 174.48,-18.75"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
-<polygon fill="white" stroke="#666666" points="483.75,-30.5 353,-30.5 353,0 483.75,0 483.75,-30.5"/>
-<text text-anchor="start" x="361" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="418.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M317.27,-15.25C325.17,-15.25 333.3,-15.25 341.35,-15.25"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="341.14,-18.75 351.14,-15.25 341.14,-11.75 341.14,-18.75"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph.map b/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph.map
deleted file mode 100644
index 30a25279c..000000000
--- a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph.map
+++ /dev/null
@@ -1,10 +0,0 @@
-<map id="others::Cache::LFUCache::put" name="others::Cache::LFUCache::put">
-<area shape="rect" id="Node000001" title="upsert a key&#45;value pair" alt="" coords="5,70,206,96"/>
-<area shape="rect" id="Node000002" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" title="increase the frequency of node and push it in the respective list." alt="" coords="268,5,442,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="164,67,253,46,254,52,165,72"/>
-<area shape="rect" id="Node000003" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" title="push the node at first position in the linked list of given frequency" alt="" coords="505,35,679,75"/>
-<area shape="poly" id="edge4_Node000001_Node000003" title=" " alt="" coords="206,75,489,58,489,64,206,80"/>
-<area shape="rect" id="Node000004" href="$df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69" title="pop the last node in the least frequently used linked list" alt="" coords="254,121,457,146"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="173,94,274,115,273,120,172,99"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="443,34,490,40,489,45,442,39"/>
-</map>
diff --git a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph.md5 b/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph.md5
deleted file mode 100644
index 087ab199a..000000000
--- a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-2f5e8422a3e70831f5f71798302110cc
\ No newline at end of file
diff --git a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph.svg b/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph.svg
deleted file mode 100644
index 4d267658a..000000000
--- a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph.svg
+++ /dev/null
@@ -1,169 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::Cache::LFUCache::put Pages: 1 -->
-<!--zoomable 114 -->
-
-<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[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-
-<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="arrowUp" transform="translate(30 24)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
-    <use xlink:href="#rim"/>
-    <path pointer-events="none" 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="application/ecmascript">
-var viewWidth = 514;
-var viewHeight = 114;
-var sectionId = 'dynsection-3';
-</script>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="viewport">
-<title>others::Cache::LFUCache::put</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="upsert a key&#45;value pair">
-<polygon fill="#999999" stroke="#666666" points="150.25,-57.25 0,-57.25 0,-38 150.25,-38 150.25,-57.25"/>
-<text text-anchor="middle" x="75.12" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::put</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" target="_top" xlink:title="increase the frequency of node and push it in the respective list.">
-<polygon fill="white" stroke="#666666" points="327.88,-105.88 197.12,-105.88 197.12,-75.38 327.88,-75.38 327.88,-105.88"/>
-<text text-anchor="start" x="205.12" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="262.5" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.59,-57.71C139.36,-62.29 163.34,-67.86 185.92,-73.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.86,-76.44 195.39,-75.29 186.44,-69.62 184.86,-76.44"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
-<polygon fill="white" stroke="#666666" points="505.5,-83.88 374.75,-83.88 374.75,-53.38 505.5,-53.38 505.5,-83.88"/>
-<text text-anchor="start" x="382.75" y="-70.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="440.12" y="-59.12" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.46,-51.93C212.46,-55.51 300.45,-60.6 362.95,-64.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="362.62,-67.7 372.8,-64.79 363.02,-60.72 362.62,-67.7"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69" target="_top" xlink:title="pop the last node in the least frequently used linked list">
-<polygon fill="white" stroke="#666666" points="338.75,-19.25 186.25,-19.25 186.25,0 338.75,0 338.75,-19.25"/>
-<text text-anchor="middle" x="262.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.32,-37.54C148.66,-32.76 176.77,-26.99 201.37,-21.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.83,-25.43 210.92,-19.99 200.42,-18.57 201.83,-25.43"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M327.9,-82.56C339.4,-81.12 351.48,-79.6 363.26,-78.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="363.45,-81.63 372.94,-76.92 362.58,-74.69 363.45,-81.63"/>
-</a>
-</g>
-</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()"/>
-   <use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
-  <use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
-  <use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
-  <use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
-</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="classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_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>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph_org.svg b/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph_org.svg
deleted file mode 100644
index e1785447c..000000000
--- a/df/d8f/classothers_1_1_cache_1_1_l_f_u_cache_af6f8e5a66a45436b490dfe015ff8866e_cgraph_org.svg
+++ /dev/null
@@ -1,86 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: others::Cache::LFUCache::put Pages: 1 -->
-<svg width="514pt" height="114pt"
- viewBox="0.00 0.00 513.50 113.88" 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 109.88)">
-<title>others::Cache::LFUCache::put</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="upsert a key&#45;value pair">
-<polygon fill="#999999" stroke="#666666" points="150.25,-57.25 0,-57.25 0,-38 150.25,-38 150.25,-57.25"/>
-<text text-anchor="middle" x="75.12" y="-43.75" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::put</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9" target="_top" xlink:title="increase the frequency of node and push it in the respective list.">
-<polygon fill="white" stroke="#666666" points="327.88,-105.88 197.12,-105.88 197.12,-75.38 327.88,-75.38 327.88,-105.88"/>
-<text text-anchor="start" x="205.12" y="-92.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="262.5" y="-81.12" font-family="Helvetica,sans-Serif" font-size="10.00">::increase_frequency</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M119.59,-57.71C139.36,-62.29 163.34,-67.86 185.92,-73.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="184.86,-76.44 195.39,-75.29 186.44,-69.62 184.86,-76.44"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047" target="_top" xlink:title="push the node at first position in the linked list of given frequency">
-<polygon fill="white" stroke="#666666" points="505.5,-83.88 374.75,-83.88 374.75,-53.38 505.5,-53.38 505.5,-83.88"/>
-<text text-anchor="start" x="382.75" y="-70.38" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache</text>
-<text text-anchor="middle" x="440.12" y="-59.12" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge4_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M150.46,-51.93C212.46,-55.51 300.45,-60.6 362.95,-64.22"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="362.62,-67.7 372.8,-64.79 363.02,-60.72 362.62,-67.7"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69" target="_top" xlink:title="pop the last node in the least frequently used linked list">
-<polygon fill="white" stroke="#666666" points="338.75,-19.25 186.25,-19.25 186.25,0 338.75,0 338.75,-19.25"/>
-<text text-anchor="middle" x="262.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">others::Cache::LFUCache::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M125.32,-37.54C148.66,-32.76 176.77,-26.99 201.37,-21.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="201.83,-25.43 210.92,-19.99 200.42,-18.57 201.83,-25.43"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M327.9,-82.56C339.4,-81.12 351.48,-79.6 363.26,-78.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="363.45,-81.63 372.94,-76.92 362.58,-74.69 363.45,-81.63"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d94/classhash__chain-members.html b/df/d94/classhash__chain-members.html
index 2f756d15b..c43e3a0fa 100644
--- a/df/d94/classhash__chain-members.html
+++ b/df/d94/classhash__chain-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/df/d94/subarray__sum_8cpp.html b/df/d94/subarray__sum_8cpp.html
index 51dfd7127..8fe474a7e 100644
--- a/df/d94/subarray__sum_8cpp.html
+++ b/df/d94/subarray__sum_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: backtracking/subarray_sum.cpp File Reference</title>
+<title>TheAlgorithms/C++: backtracking/subarray_sum.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,9 @@ Include dependency graph for subarray_sum.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d90/subarray__sum_8cpp__incl.svg" width="471" height="126"><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">
+</div>
+<p><a href="../../df/d94/subarray__sum_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html">backtracking</a></td></tr>
@@ -135,7 +154,7 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:af5687bbd9faf927fbd363c71e0baba5e" id="r_af5687bbd9faf927fbd363c71e0baba5e"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af5687bbd9faf927fbd363c71e0baba5e">backtracking::subarray_sum::subarray_sum</a> (int64_t sum, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;in_arr)</td></tr>
+<tr class="memitem:af5687bbd9faf927fbd363c71e0baba5e" id="r_af5687bbd9faf927fbd363c71e0baba5e"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af5687bbd9faf927fbd363c71e0baba5e">backtracking::subarray_sum::subarray_sum</a> (int64_t sum, const std::vector&lt; int64_t &gt; &amp;in_arr)</td></tr>
 <tr class="memdesc:af5687bbd9faf927fbd363c71e0baba5e"><td class="mdescLeft">&#160;</td><td class="mdescRight">The main function that implements the count of the subarrays.  <br /></td></tr>
 <tr class="separator:af5687bbd9faf927fbd363c71e0baba5e"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
@@ -149,6 +168,8 @@ Functions</h2></td></tr>
 <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset-sum</a> (only continuous subsets) problem </p>
 <p>We are given an array and a sum value. The algorithms find all the subarrays of that array with sum equal to the given sum and return such subarrays count. This approach will have \(O(n)\) time complexity and \(O(n)\) space complexity. NOTE: In this problem, we are only referring to the continuous subsets as subarrays everywhere. Subarrays can be created using deletion operation at the end of the front of an array only. The parent array is also counted in subarrays having 0 number of deletion operations.</p>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Swastyy" target="_blank">Swastika Gupta</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../df/d94/subarray__sum_8cpp_source.html">subarray_sum.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -167,17 +188,14 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d94/subarray__sum_8cpp_source.html#l00115">115</a> of file <a class="el" href="../../df/d94/subarray__sum_8cpp_source.html">subarray_sum.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  115</span>           {</div>
 <div class="line"><span class="lineno">  116</span>    <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
 <div class="line"><span class="lineno">  117</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  118</span>}</div>
-<div class="ttc" id="asubarray__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> subarray_sum.cpp:68</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d94/subarray__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="271" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="asubarray__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d94/subarray__sum_8cpp_source.html#l00068">subarray_sum.cpp:68</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="af5687bbd9faf927fbd363c71e0baba5e" name="af5687bbd9faf927fbd363c71e0baba5e"></a>
@@ -194,7 +212,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>in_arr</em></span>&#160;)</td>
+          <td class="paramtype">const std::vector&lt; int64_t &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>in_arr</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -208,11 +226,13 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>count of the number of subsets with required sum </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d94/subarray__sum_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../df/d94/subarray__sum_8cpp_source.html">subarray_sum.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   39</span>                                                                     {</div>
-<div class="line"><span class="lineno">   40</span>    int64_t nelement = in_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">   40</span>    int64_t nelement = in_arr.size();</div>
 <div class="line"><span class="lineno">   41</span>    int64_t count_of_subset = 0;</div>
 <div class="line"><span class="lineno">   42</span>    int64_t current_sum = 0;</div>
-<div class="line"><span class="lineno">   43</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map&lt;int64_t, int64_t&gt;</a></div>
+<div class="line"><span class="lineno">   43</span>    std::unordered_map&lt;int64_t, int64_t&gt;</div>
 <div class="line"><span class="lineno">   44</span>        sumarray;  <span class="comment">// to store the subarrays count</span></div>
 <div class="line"><span class="lineno">   45</span>                   <span class="comment">// frequency having some sum value</span></div>
 <div class="line"><span class="lineno">   46</span> </div>
@@ -223,24 +243,15 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   51</span>            count_of_subset++;</div>
 <div class="line"><span class="lineno">   52</span>        }</div>
 <div class="line"><span class="lineno">   53</span>        <span class="comment">// If in case current_sum is greater than the required sum</span></div>
-<div class="line"><span class="lineno">   54</span>        <span class="keywordflow">if</span> (sumarray.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">find</a>(current_sum - sum) != sumarray.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">end</a>()) {</div>
+<div class="line"><span class="lineno">   54</span>        <span class="keywordflow">if</span> (sumarray.find(current_sum - sum) != sumarray.end()) {</div>
 <div class="line"><span class="lineno">   55</span>            count_of_subset += (sumarray[current_sum - <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a>]);</div>
 <div class="line"><span class="lineno">   56</span>        }</div>
 <div class="line"><span class="lineno">   57</span>        sumarray[current_sum]++;</div>
 <div class="line"><span class="lineno">   58</span>    }</div>
 <div class="line"><span class="lineno">   59</span>    <span class="keywordflow">return</span> count_of_subset;</div>
 <div class="line"><span class="lineno">   60</span>}</div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html">std::unordered_map::end</a></div><div class="ttdeci">T end(T... args)</div></div>
-<div class="ttc" id="afind_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html">std::unordered_map::find</a></div><div class="ttdeci">T find(T... args)</div></div>
-<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:232</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="aunordered_map_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a></div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d94/subarray__sum_8cpp_af5687bbd9faf927fbd363c71e0baba5e_cgraph.svg" width="378" height="151"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00232">vector_ops.hpp:232</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
@@ -268,57 +279,51 @@ 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>
+
+<p class="definition">Definition at line <a class="el" href="../../df/d94/subarray__sum_8cpp_source.html#l00068">68</a> of file <a class="el" href="../../df/d94/subarray__sum_8cpp_source.html">subarray_sum.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   68</span>                   {</div>
 <div class="line"><span class="lineno">   69</span>    <span class="comment">// 1st test</span></div>
-<div class="line"><span class="lineno">   70</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1st test &quot;</span>;</div>
-<div class="line"><span class="lineno">   71</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> array1 = {-7, -3, -2, 5, 8};  <span class="comment">// input array</span></div>
+<div class="line"><span class="lineno">   70</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test &quot;</span>;</div>
+<div class="line"><span class="lineno">   71</span>    std::vector&lt;int64_t&gt; array1 = {-7, -3, -2, 5, 8};  <span class="comment">// input array</span></div>
 <div class="line"><span class="lineno">   72</span>    assert(</div>
 <div class="line"><span class="lineno">   73</span>        backtracking::subarray_sum::subarray_sum(0, array1) ==</div>
 <div class="line"><span class="lineno">   74</span>        1);  <span class="comment">// first argument in subarray_sum function is the required sum and</span></div>
 <div class="line"><span class="lineno">   75</span>             <span class="comment">// second is the input array, answer is the subarray {(-3,-2,5)}</span></div>
-<div class="line"><span class="lineno">   76</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   76</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   77</span> </div>
 <div class="line"><span class="lineno">   78</span>    <span class="comment">// 2nd test</span></div>
-<div class="line"><span class="lineno">   79</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;2nd test &quot;</span>;</div>
-<div class="line"><span class="lineno">   80</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> array2 = {1, 2, 3, 3};</div>
+<div class="line"><span class="lineno">   79</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test &quot;</span>;</div>
+<div class="line"><span class="lineno">   80</span>    std::vector&lt;int64_t&gt; array2 = {1, 2, 3, 3};</div>
 <div class="line"><span class="lineno">   81</span>    assert(backtracking::subarray_sum::subarray_sum(6, array2) ==</div>
 <div class="line"><span class="lineno">   82</span>           2);  <span class="comment">// here we are expecting 2 subsets which sum up to 6 i.e.</span></div>
 <div class="line"><span class="lineno">   83</span>                <span class="comment">// {(1,2,3),(3,3)}</span></div>
-<div class="line"><span class="lineno">   84</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   85</span> </div>
 <div class="line"><span class="lineno">   86</span>    <span class="comment">// 3rd test</span></div>
-<div class="line"><span class="lineno">   87</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;3rd test &quot;</span>;</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&lt;int64_t&gt;</a> array3 = {1, 1, 1, 1};</div>
+<div class="line"><span class="lineno">   87</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test &quot;</span>;</div>
+<div class="line"><span class="lineno">   88</span>    std::vector&lt;int64_t&gt; array3 = {1, 1, 1, 1};</div>
 <div class="line"><span class="lineno">   89</span>    assert(backtracking::subarray_sum::subarray_sum(1, array3) ==</div>
 <div class="line"><span class="lineno">   90</span>           4);  <span class="comment">// here we are expecting 4 subsets which sum up to 1 i.e.</span></div>
 <div class="line"><span class="lineno">   91</span>                <span class="comment">// {(1),(1),(1),(1)}</span></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> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   93</span> </div>
 <div class="line"><span class="lineno">   94</span>    <span class="comment">// 4rd test</span></div>
-<div class="line"><span class="lineno">   95</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;4th test &quot;</span>;</div>
-<div class="line"><span class="lineno">   96</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> array4 = {3, 3, 3, 3};</div>
+<div class="line"><span class="lineno">   95</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;4th test &quot;</span>;</div>
+<div class="line"><span class="lineno">   96</span>    std::vector&lt;int64_t&gt; array4 = {3, 3, 3, 3};</div>
 <div class="line"><span class="lineno">   97</span>    assert(backtracking::subarray_sum::subarray_sum(6, array4) ==</div>
 <div class="line"><span class="lineno">   98</span>           3);  <span class="comment">// here we are expecting 3 subsets which sum up to 6 i.e.</span></div>
 <div class="line"><span class="lineno">   99</span>                <span class="comment">// {(3,3),(3,3),(3,3)}</span></div>
-<div class="line"><span class="lineno">  100</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  100</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  101</span> </div>
 <div class="line"><span class="lineno">  102</span>    <span class="comment">// 5th test</span></div>
-<div class="line"><span class="lineno">  103</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;5th test &quot;</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&lt;int64_t&gt;</a> array5 = {};</div>
+<div class="line"><span class="lineno">  103</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;5th test &quot;</span>;</div>
+<div class="line"><span class="lineno">  104</span>    std::vector&lt;int64_t&gt; array5 = {};</div>
 <div class="line"><span class="lineno">  105</span>    assert(backtracking::subarray_sum::subarray_sum(6, array5) ==</div>
 <div class="line"><span class="lineno">  106</span>           0);  <span class="comment">// here we are expecting 0 subsets which sum up to 6 i.e. we</span></div>
 <div class="line"><span class="lineno">  107</span>                <span class="comment">// cannot select anything from an empty array</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> &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; <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">  108</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  109</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="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="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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d94/subarray__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="174" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/df/d94/subarray__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/df/d94/subarray__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
deleted file mode 100644
index e85e01374..000000000
--- a/df/d94/subarray__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="test" name="test">
-<area shape="rect" id="Node000001" title="Self&#45;test implementations." alt="" coords="5,5,49,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="97,5,168,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="49,16,81,16,81,21,49,21"/>
-</map>
diff --git a/df/d94/subarray__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/df/d94/subarray__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
deleted file mode 100644
index 5901bc148..000000000
--- a/df/d94/subarray__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-729fb887ee50b6291b0542ba0592a5c7
\ No newline at end of file
diff --git a/df/d94/subarray__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/df/d94/subarray__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
deleted file mode 100644
index 2e04695b9..000000000
--- a/df/d94/subarray__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d94/subarray__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/df/d94/subarray__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
deleted file mode 100644
index 1813bd719..000000000
--- a/df/d94/subarray__sum_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: test Pages: 1 -->
-<svg width="130pt" height="27pt"
- viewBox="0.00 0.00 130.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>test</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Self&#45;test implementations.">
-<polygon fill="#999999" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
-<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="122,-19.25 68.5,-19.25 68.5,0 122,0 122,-19.25"/>
-<text text-anchor="middle" x="95.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M32.83,-9.62C39.78,-9.62 48.3,-9.62 56.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.56,-13.13 66.56,-9.63 56.56,-6.13 56.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d94/subarray__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/d94/subarray__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index c314b0bd3..000000000
--- a/df/d94/subarray__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="103,5,146,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="194,5,265,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="146,16,178,16,178,21,146,21"/>
-</map>
diff --git a/df/d94/subarray__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/d94/subarray__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index ff67a36b0..000000000
--- a/df/d94/subarray__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-adfe0d5364ebbdb0084c14fad9bb5b46
\ No newline at end of file
diff --git a/df/d94/subarray__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/d94/subarray__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 199ecd6aa..000000000
--- a/df/d94/subarray__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d94/subarray__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/d94/subarray__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 92e8aa74f..000000000
--- a/df/d94/subarray__sum_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="203pt" height="27pt"
- viewBox="0.00 0.00 203.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
-<polygon fill="white" stroke="#666666" points="105.5,-19.25 73,-19.25 73,0 105.5,0 105.5,-19.25"/>
-<text text-anchor="middle" x="89.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.2,-9.62C44.58,-9.62 53.31,-9.62 61.45,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.2,-13.13 71.2,-9.63 61.2,-6.13 61.2,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="195,-19.25 141.5,-19.25 141.5,0 195,0 195,-19.25"/>
-<text text-anchor="middle" x="168.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M105.83,-9.62C112.78,-9.62 121.3,-9.62 129.75,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="129.56,-13.13 139.56,-9.63 129.56,-6.13 129.56,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d94/subarray__sum_8cpp_af5687bbd9faf927fbd363c71e0baba5e_cgraph.map b/df/d94/subarray__sum_8cpp_af5687bbd9faf927fbd363c71e0baba5e_cgraph.map
deleted file mode 100644
index a3698fa08..000000000
--- a/df/d94/subarray__sum_8cpp_af5687bbd9faf927fbd363c71e0baba5e_cgraph.map
+++ /dev/null
@@ -1,9 +0,0 @@
-<map id="backtracking::subarray_sum::subarray_sum" name="backtracking::subarray_sum::subarray_sum">
-<area shape="rect" id="Node000001" title="The main function that implements the count of the subarrays." alt="" coords="5,55,159,96"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/end.html#" title=" " alt="" coords="207,5,372,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="157,52,225,33,226,38,159,57"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_map/find.html#" title=" " alt="" coords="221,55,358,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="159,73,206,73,206,78,159,78"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="232,120,347,146"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="159,94,226,113,225,118,157,99"/>
-</map>
diff --git a/df/d94/subarray__sum_8cpp_af5687bbd9faf927fbd363c71e0baba5e_cgraph.md5 b/df/d94/subarray__sum_8cpp_af5687bbd9faf927fbd363c71e0baba5e_cgraph.md5
deleted file mode 100644
index 01888354a..000000000
--- a/df/d94/subarray__sum_8cpp_af5687bbd9faf927fbd363c71e0baba5e_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-4147049f5fd4b58e55c397a018f41089
\ No newline at end of file
diff --git a/df/d94/subarray__sum_8cpp_af5687bbd9faf927fbd363c71e0baba5e_cgraph.svg b/df/d94/subarray__sum_8cpp_af5687bbd9faf927fbd363c71e0baba5e_cgraph.svg
deleted file mode 100644
index c423220b9..000000000
--- a/df/d94/subarray__sum_8cpp_af5687bbd9faf927fbd363c71e0baba5e_cgraph.svg
+++ /dev/null
@@ -1,103 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::subarray_sum::subarray_sum Pages: 1 -->
-<svg width="283pt" height="113pt"
- viewBox="0.00 0.00 283.00 113.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 109.25)">
-<title>backtracking::subarray_sum::subarray_sum</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function that implements the count of the subarrays.">
-<polygon fill="#999999" stroke="#666666" points="115,-67.88 0,-67.88 0,-37.38 115,-37.38 115,-67.88"/>
-<text text-anchor="start" x="8" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::subarray</text>
-<text text-anchor="middle" x="57.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_sum::subarray_sum</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275,-105.25 151,-105.25 151,-86 275,-86 275,-105.25"/>
-<text text-anchor="middle" x="213" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.35,-68.27C131.07,-72.95 149.21,-78.04 165.28,-82.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.99,-85.81 174.57,-85.14 165.88,-79.07 163.99,-85.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.12,-67.88 161.88,-67.88 161.88,-37.38 264.12,-37.38 264.12,-67.88"/>
-<text text-anchor="start" x="169.88" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="213" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.22,-52.62C126.62,-52.62 138.66,-52.62 150.22,-52.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.07,-56.13 160.07,-52.63 150.07,-49.13 150.07,-56.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="256.25,-19.25 169.75,-19.25 169.75,0 256.25,0 256.25,-19.25"/>
-<text text-anchor="middle" x="213" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.35,-36.98C131.07,-32.3 149.21,-27.21 165.28,-22.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.88,-26.18 174.57,-20.11 163.99,-19.44 165.88,-26.18"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/d94/subarray__sum_8cpp_af5687bbd9faf927fbd363c71e0baba5e_cgraph_org.svg b/df/d94/subarray__sum_8cpp_af5687bbd9faf927fbd363c71e0baba5e_cgraph_org.svg
deleted file mode 100644
index 5b21776e8..000000000
--- a/df/d94/subarray__sum_8cpp_af5687bbd9faf927fbd363c71e0baba5e_cgraph_org.svg
+++ /dev/null
@@ -1,77 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::subarray_sum::subarray_sum Pages: 1 -->
-<svg width="283pt" height="113pt"
- viewBox="0.00 0.00 283.00 113.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 109.25)">
-<title>backtracking::subarray_sum::subarray_sum</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="The main function that implements the count of the subarrays.">
-<polygon fill="#999999" stroke="#666666" points="115,-67.88 0,-67.88 0,-37.38 115,-37.38 115,-67.88"/>
-<text text-anchor="start" x="8" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::subarray</text>
-<text text-anchor="middle" x="57.5" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">_sum::subarray_sum</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275,-105.25 151,-105.25 151,-86 275,-86 275,-105.25"/>
-<text text-anchor="middle" x="213" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.35,-68.27C131.07,-72.95 149.21,-78.04 165.28,-82.54"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="163.99,-85.81 174.57,-85.14 165.88,-79.07 163.99,-85.81"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_map/find.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="264.12,-67.88 161.88,-67.88 161.88,-37.38 264.12,-37.38 264.12,-67.88"/>
-<text text-anchor="start" x="169.88" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_map</text>
-<text text-anchor="middle" x="213" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.22,-52.62C126.62,-52.62 138.66,-52.62 150.22,-52.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="150.07,-56.13 160.07,-52.63 150.07,-49.13 150.07,-56.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="256.25,-19.25 169.75,-19.25 169.75,0 256.25,0 256.25,-19.25"/>
-<text text-anchor="middle" x="213" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M114.35,-36.98C131.07,-32.3 149.21,-27.21 165.28,-22.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="165.88,-26.18 174.57,-20.11 163.99,-19.44 165.88,-26.18"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/d94/subarray__sum_8cpp_source.html b/df/d94/subarray__sum_8cpp_source.html
new file mode 100644
index 000000000..9cfbe6c33
--- /dev/null
+++ b/df/d94/subarray__sum_8cpp_source.html
@@ -0,0 +1,228 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: backtracking/subarray_sum.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/d94/subarray__sum_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">subarray_sum.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../df/d94/subarray__sum_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="preprocessor">#include &lt;cassert&gt;</span>        </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="preprocessor">#include &lt;iostream&gt;</span>       </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;unordered_map&gt;</span>  </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;vector&gt;</span>         </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span> </div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../db/dc0/namespacebacktracking.html">backtracking</a> {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/d74/namespacesubarray__sum.html">subarray_sum</a> {</div>
+<div class="foldopen" id="foldopen00039" data-start="{" data-end="}">
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../df/d94/subarray__sum_8cpp.html#af5687bbd9faf927fbd363c71e0baba5e">   39</a></span>uint64_t <a class="code hl_namespace" href="../../df/d74/namespacesubarray__sum.html">subarray_sum</a>(int64_t sum, <span class="keyword">const</span> std::vector&lt;int64_t&gt; &amp;in_arr) {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    int64_t nelement = in_arr.size();</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    int64_t count_of_subset = 0;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    int64_t current_sum = 0;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    std::unordered_map&lt;int64_t, int64_t&gt;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        sumarray;  <span class="comment">// to store the subarrays count</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>                   <span class="comment">// frequency having some sum value</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordflow">for</span> (int64_t i = 0; i &lt; nelement; i++) {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>        current_sum += in_arr[i];</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>        <span class="keywordflow">if</span> (current_sum == sum) {</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>            count_of_subset++;</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>        }</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        <span class="comment">// If in case current_sum is greater than the required sum</span></div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>        <span class="keywordflow">if</span> (sumarray.find(current_sum - sum) != sumarray.end()) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>            count_of_subset += (sumarray[current_sum - sum]);</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        }</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        sumarray[current_sum]++;</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    <span class="keywordflow">return</span> count_of_subset;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>}</div>
+</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>}  <span class="comment">// namespace subarray_sum</span></div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>}  <span class="comment">// namespace backtracking</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span> </div>
+<div class="foldopen" id="foldopen00068" data-start="{" data-end="}">
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"><a class="line" href="../../df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">   68</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>    <span class="comment">// 1st test</span></div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;1st test &quot;</span>;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    std::vector&lt;int64_t&gt; array1 = {-7, -3, -2, 5, 8};  <span class="comment">// input array</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    assert(</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>        backtracking::subarray_sum::subarray_sum(0, array1) ==</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>        1);  <span class="comment">// first argument in subarray_sum function is the required sum and</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>             <span class="comment">// second is the input array, answer is the subarray {(-3,-2,5)}</span></div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span> </div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="comment">// 2nd test</span></div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;2nd test &quot;</span>;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    std::vector&lt;int64_t&gt; array2 = {1, 2, 3, 3};</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    assert(backtracking::subarray_sum::subarray_sum(6, array2) ==</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>           2);  <span class="comment">// here we are expecting 2 subsets which sum up to 6 i.e.</span></div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>                <span class="comment">// {(1,2,3),(3,3)}</span></div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    <span class="comment">// 3rd test</span></div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;3rd test &quot;</span>;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    std::vector&lt;int64_t&gt; array3 = {1, 1, 1, 1};</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    assert(backtracking::subarray_sum::subarray_sum(1, array3) ==</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>           4);  <span class="comment">// here we are expecting 4 subsets which sum up to 1 i.e.</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span>                <span class="comment">// {(1),(1),(1),(1)}</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span> </div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="comment">// 4rd test</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;4th test &quot;</span>;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    std::vector&lt;int64_t&gt; array4 = {3, 3, 3, 3};</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    assert(backtracking::subarray_sum::subarray_sum(6, array4) ==</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>           3);  <span class="comment">// here we are expecting 3 subsets which sum up to 6 i.e.</span></div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>                <span class="comment">// {(3,3),(3,3),(3,3)}</span></div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span> </div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <span class="comment">// 5th test</span></div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;5th test &quot;</span>;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    std::vector&lt;int64_t&gt; array5 = {};</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    assert(backtracking::subarray_sum::subarray_sum(6, array5) ==</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>           0);  <span class="comment">// here we are expecting 0 subsets which sum up to 6 i.e. we</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>                <span class="comment">// cannot select anything from an empty array</span></div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;passed&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>}</div>
+</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span> </div>
+<div class="foldopen" id="foldopen00115" data-start="{" data-end="}">
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"><a class="line" href="../../df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  115</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <a class="code hl_function" href="../../df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// run self-test implementations</span></div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>}</div>
+</div>
+<div class="ttc" id="anamespacebacktracking_html"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html">backtracking</a></div><div class="ttdoc">for vector container</div></div>
+<div class="ttc" id="anamespacesubarray__sum_html"><div class="ttname"><a href="../../df/d74/namespacesubarray__sum.html">subarray_sum</a></div><div class="ttdoc">Functions for the Subset sum implementation.</div></div>
+<div class="ttc" id="asubarray__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../df/d94/subarray__sum_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> <a href="#l00068">subarray_sum.cpp:68</a></div></div>
+<div class="ttc" id="asubarray__sum_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00115">subarray_sum.cpp:115</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a class="el" href="../../df/d94/subarray__sum_8cpp.html">subarray_sum.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/d97/main__cll_8cpp_source.html b/df/d97/main__cll_8cpp_source.html
new file mode 100644
index 000000000..f1a4441a7
--- /dev/null
+++ b/df/d97/main__cll_8cpp_source.html
@@ -0,0 +1,183 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/cll/main_cll.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/d97/main__cll_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">main_cll.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &quot;cll.h&quot;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span>    <span class="comment">/* Test CLL */</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span>    cout &lt;&lt; <span class="stringliteral">&quot;----------- Test construct -----------&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span>    <a class="code hl_class" href="../../d5/d15/classcll.html">cll</a> list1;</div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span>    list1.display();</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    cout &lt;&lt; <span class="stringliteral">&quot;----------- Test insert front -----------&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>    list1.insert_front(5);</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    cout &lt;&lt; <span class="stringliteral">&quot;After insert 5 at front: &quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>    list1.display();</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    cout &lt;&lt; <span class="stringliteral">&quot;After insert 10 3 7 at front: &quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>    list1.insert_front(10);</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span>    list1.insert_front(3);</div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span>    list1.insert_front(7);</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    list1.display();</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>    cout &lt;&lt; <span class="stringliteral">&quot;----------- Test insert tail -----------&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    cout &lt;&lt; <span class="stringliteral">&quot;After insert 18 19 20 at tail: &quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span>    list1.insert_tail(18);</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    list1.insert_tail(19);</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    list1.insert_tail(20);</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>    list1.display();</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    cout &lt;&lt; <span class="stringliteral">&quot;----------- Test find item -----------&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>    <span class="keywordflow">if</span> (list1.find_item(10))</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        cout &lt;&lt; <span class="stringliteral">&quot;PASS&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>        cout &lt;&lt; <span class="stringliteral">&quot;FAIL&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="keywordflow">if</span> (!list1.find_item(30))</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>        cout &lt;&lt; <span class="stringliteral">&quot;PASS&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordflow">else</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        cout &lt;&lt; <span class="stringliteral">&quot;FAIL&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>    cout &lt;&lt; <span class="stringliteral">&quot;----------- Test * operator -----------&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordtype">int</span> value = *list1;</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>    cout &lt;&lt; <span class="stringliteral">&quot;Value at *list1: &quot;</span> &lt;&lt; value &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>    cout &lt;&lt; <span class="stringliteral">&quot;----------- Test ++ operator -----------&quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    list1.display();</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    ++list1;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    cout &lt;&lt; <span class="stringliteral">&quot;After ++list1: &quot;</span> &lt;&lt; <a class="code hl_define" href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a>;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    list1.display();</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>}</div>
+<div class="ttc" id="aclasscll_html"><div class="ttname"><a href="../../d5/d15/classcll.html">cll</a></div><div class="ttdef"><b>Definition</b> <a href="../../d7/dba/cll_8h_source.html#l00017">cll.h:17</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d35/matrix__exponentiation_8cpp_source.html#l00036">matrix_exponentiation.cpp:36</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../dir_f1797d0c2a0a12033e7d74efffeb14e1.html">cll</a></li><li class="navelem"><b>main_cll.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html b/df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html
index 98404c564..8e5e4d390 100644
--- a/df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html
+++ b/df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: std::is_unsigned&lt; uint256_t &gt; Struct Reference</title>
+<title>TheAlgorithms/C++: std::is_unsigned&lt; uint256_t &gt; Struct Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -117,7 +134,10 @@ Collaboration diagram for std::is_unsigned&lt; uint256_t &gt;:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d75/structstd_1_1is__unsigned_3_01uint256__t_01_4__coll__graph.svg" width="204" height="111"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
-<hr/>The documentation for this struct was generated from the following file:<ul>
+<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
+<div class="textblock">
+<p class="definition">Definition at line <a class="el" href="../../da/da3/uint256__t_8hpp_source.html#l00027">27</a> of file <a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a>.</p>
+</div><hr/>The documentation for this struct was generated from the following file:<ul>
 <li>ciphers/<a class="el" href="../../da/da3/uint256__t_8hpp_source.html">uint256_t.hpp</a></li>
 </ul>
 </div><!-- contents -->
@@ -125,7 +145,7 @@ Collaboration diagram for std::is_unsigned&lt; uint256_t &gt;:</div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
   <ul>
-    <li class="navelem"><a class="el" href="../../d8/dcc/namespacestd.html">std</a></li><li class="navelem"><a class="el" href="../../df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html">is_unsigned&lt; uint256_t &gt;</a></li>
+    <li class="navelem"><b>std</b></li><li class="navelem"><a class="el" href="../../df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html">is_unsigned&lt; uint256_t &gt;</a></li>
     <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
   </ul>
 </div>
diff --git a/df/da7/queue__using__array2_8cpp_source.html b/df/da7/queue__using__array2_8cpp_source.html
new file mode 100644
index 000000000..cf9126f5f
--- /dev/null
+++ b/df/da7/queue__using__array2_8cpp_source.html
@@ -0,0 +1,195 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/queue_using_array2.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/da7/queue__using__array2_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">queue_using_array2.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="keyword">using namespace </span>std;</div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span> </div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="keywordtype">int</span> queue[10];</div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="keywordtype">int</span> front = 0;</div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="keywordtype">int</span> rear = 0;</div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="keywordtype">void</span> Enque(<span class="keywordtype">int</span> x) {</div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span>    <span class="keywordflow">if</span> (rear == 10) {</div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nOverflow&quot;</span>;</div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span>    } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span>        queue[rear++] = x;</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span>    }</div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span>}</div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span> </div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="keywordtype">void</span> Deque() {</div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span>    <span class="keywordflow">if</span> (front == rear) {</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nUnderflow&quot;</span>;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span>    }</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span> &lt;&lt; queue[front++] &lt;&lt; <span class="stringliteral">&quot; deleted&quot;</span>;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = front; i &lt; rear; i++) {</div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>            queue[i - front] = queue[i];</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        }</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        rear = rear - front;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        front = 0;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    }</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>}</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span> </div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="keywordtype">void</span> show() {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = front; i &lt; rear; i++) {</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span>        cout &lt;&lt; queue[i] &lt;&lt; <span class="stringliteral">&quot;\t&quot;</span>;</div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    }</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>}</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    <span class="keywordtype">int</span> ch, x;</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n1. Enque&quot;</span>;</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n2. Deque&quot;</span>;</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        cout &lt;&lt; <span class="stringliteral">&quot;\n3. Print&quot;</span>;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>        cout &lt;&lt; <span class="stringliteral">&quot;\nEnter Your Choice : &quot;</span>;</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>        cin &gt;&gt; ch;</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        <span class="keywordflow">if</span> (ch == 1) {</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>            cout &lt;&lt; <span class="stringliteral">&quot;\nInsert : &quot;</span>;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>            cin &gt;&gt; x;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>            Enque(x);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ch == 2) {</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>            Deque();</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span>        } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ch == 3) {</div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>            show();</div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span>        }</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span>    } <span class="keywordflow">while</span> (ch != 0);</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span> </div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>}</div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><b>queue_using_array2.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.map b/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.map
index e93fff69d..1b9b30b01 100644
--- a/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.map
+++ b/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.map
@@ -1,7 +1,7 @@
 <map id="graph::is_graph_bipartite::Graph" name="graph::is_graph_bipartite::Graph">
 <area shape="rect" id="Node000001" title="Class for representing graph as an adjacency list." alt="" coords="84,109,247,150"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="5,5,163,46"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,5,163,46"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="111,57,152,107,148,110,107,60"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="187,13,309,38"/>
+<area shape="rect" id="Node000003" title=" " alt="" coords="187,13,309,38"/>
 <area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="231,52,183,110,179,107,227,49"/>
 </map>
diff --git a/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.md5 b/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.md5
index dedb71475..ef85b0962 100644
--- a/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.md5
+++ b/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.md5
@@ -1 +1 @@
-35c96562232fae48ac4dddb674158dba
\ No newline at end of file
+5bdb1c0eb8ba8607df7866cc3bb4dbb6
\ No newline at end of file
diff --git a/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.svg b/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.svg
index f13394446..ade4f8493 100644
--- a/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.svg
+++ b/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph.svg
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="118,-108.25 0,-108.25 0,-77.75 118,-77.75 118,-108.25"/>
 <text text-anchor="start" x="8" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="59" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -52,7 +52,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="227.5,-102.62 136.5,-102.62 136.5,-83.38 227.5,-83.38 227.5,-102.62"/>
 <text text-anchor="middle" x="182" y="-89.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
diff --git a/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph_org.svg b/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph_org.svg
index 438a6075d..de12abcaa 100644
--- a/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph_org.svg
+++ b/df/db7/classgraph_1_1is__graph__bipartite_1_1_graph__coll__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="118,-108.25 0,-108.25 0,-77.75 118,-77.75 118,-108.25"/>
 <text text-anchor="start" x="8" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="59" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
@@ -41,7 +41,7 @@
 <!-- Node3 -->
 <g id="Node000003" class="node">
 <title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000003"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="227.5,-102.62 136.5,-102.62 136.5,-83.38 227.5,-83.38 227.5,-102.62"/>
 <text text-anchor="middle" x="182" y="-89.12" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; int &gt;</text>
 </a>
diff --git a/df/dbb/class_f_c_f_s__coll__graph.map b/df/dbb/class_f_c_f_s__coll__graph.map
deleted file mode 100644
index ff4f8f529..000000000
--- a/df/dbb/class_f_c_f_s__coll__graph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="FCFS&lt; S, T, E &gt;" name="FCFS&lt; S, T, E &gt;">
-<area shape="rect" id="Node000001" title="Class which implements the FCFS scheduling algorithm." alt="" coords="477,146,597,171"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue.html" title=" " alt="" coords="149,5,373,106"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="388,100,501,142,499,147,387,105"/>
-<area shape="rect" id="Node000003" title=" " alt="" coords="5,95,44,120"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="58,98,148,78,149,83,59,103"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="176,130,346,186"/>
-<area shape="poly" id="edge4_Node000004_Node000003" title=" " alt="" coords="59,112,176,138,175,143,58,117"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="361,156,476,156,476,161,361,161"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/unordered_set.html" title=" " alt="" coords="180,211,342,236"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="336,204,372,196,481,169,483,174,374,201,337,209"/>
-</map>
diff --git a/df/dbb/class_f_c_f_s__coll__graph.md5 b/df/dbb/class_f_c_f_s__coll__graph.md5
deleted file mode 100644
index fd6fd8673..000000000
--- a/df/dbb/class_f_c_f_s__coll__graph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cce4215a15c4cbcdf3722e4ecc3b7c4d
\ No newline at end of file
diff --git a/df/dbb/class_f_c_f_s__coll__graph.svg b/df/dbb/class_f_c_f_s__coll__graph.svg
deleted file mode 100644
index c4fb17503..000000000
--- a/df/dbb/class_f_c_f_s__coll__graph.svg
+++ /dev/null
@@ -1,140 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: FCFS&lt; S, T, E &gt; Pages: 1 -->
-<svg width="452pt" height="181pt"
- viewBox="0.00 0.00 452.05 181.38" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 177.38)">
-<title>FCFS&lt; S, T, E &gt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Class which implements the FCFS scheduling algorithm.">
-<polygon fill="#999999" stroke="#666666" points="444.05,-68.25 353.8,-68.25 353.8,-49 444.05,-49 444.05,-68.25"/>
-<text text-anchor="middle" x="398.92" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS&lt; S, T, E &gt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275.8,-173.38 107.55,-173.38 107.55,-97.88 275.8,-97.88 275.8,-173.38"/>
-<text text-anchor="start" x="115.55" y="-159.88" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
-<text text-anchor="start" x="115.55" y="-148.62" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; std::tuple&lt; S, T,</text>
-<text text-anchor="start" x="115.55" y="-137.38" font-family="Helvetica,sans-Serif" font-size="10.00"> E, double, double, double</text>
-<text text-anchor="start" x="115.55" y="-126.12" font-family="Helvetica,sans-Serif" font-size="10.00"> &gt;, std::vector&lt; std::tuple</text>
-<text text-anchor="start" x="115.55" y="-114.88" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; S, T, E, double, double,</text>
-<text text-anchor="middle" x="191.67" y="-103.62" font-family="Helvetica,sans-Serif" font-size="10.00"> double &gt; &gt;, Compare&lt; S, T, E &gt; &gt;</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node2&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M286.58,-100.4C317.48,-88.81 349.43,-76.82 371.14,-68.67"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="285.71,-96.98 277.58,-103.77 288.17,-103.54 285.71,-96.98"/>
-</a>
-</g>
-<text text-anchor="middle" x="314.8" y="-98.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> schedule</text>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="28.8,-106.25 0,-106.25 0,-87 28.8,-87 28.8,-106.25"/>
-<text text-anchor="middle" x="14.4" y="-92.75" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M40.17,-102.14C57.88,-106.08 82.84,-111.63 107.34,-117.08"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="41.15,-98.77 30.63,-100.01 39.63,-105.6 41.15,-98.77"/>
-</a>
-</g>
-<text text-anchor="middle" x="68.17" y="-114.38" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.17,-79.5 128.17,-79.5 128.17,-37.75 255.17,-37.75 255.17,-79.5"/>
-<text text-anchor="start" x="136.17" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::tuple</text>
-<text text-anchor="start" x="136.17" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; S, T, E, double, double,</text>
-<text text-anchor="middle" x="191.67" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00"> double &gt; &gt;</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M40.16,-91.26C62.89,-86.33 97.55,-78.82 127.88,-72.24"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="39.66,-87.78 30.63,-93.32 41.15,-94.62 39.66,-87.78"/>
-</a>
-</g>
-<text text-anchor="middle" x="68.17" y="-91.11" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
-<!-- Node4&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node4&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M266.97,-58.62C295.9,-58.62 328.08,-58.62 353.3,-58.62"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="267.17,-55.13 257.17,-58.63 267.17,-62.13 267.17,-55.13"/>
-</a>
-</g>
-<text text-anchor="middle" x="314.8" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> result</text>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.55,-19.25 130.8,-19.25 130.8,0 252.55,0 252.55,-19.25"/>
-<text text-anchor="middle" x="191.67" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set&lt; S &gt;</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node5&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M248.53,-22.26C257.65,-24.36 266.99,-26.54 275.8,-28.62 303.1,-35.1 333.76,-42.63 357.53,-48.53"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="249.58,-18.91 239.05,-20.09 248.01,-25.73 249.58,-18.91"/>
-</a>
-</g>
-<text text-anchor="middle" x="314.8" y="-44.15" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> idList</text>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/dbb/class_f_c_f_s__coll__graph_org.svg b/df/dbb/class_f_c_f_s__coll__graph_org.svg
deleted file mode 100644
index 5f86cf079..000000000
--- a/df/dbb/class_f_c_f_s__coll__graph_org.svg
+++ /dev/null
@@ -1,114 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: FCFS&lt; S, T, E &gt; Pages: 1 -->
-<svg width="452pt" height="181pt"
- viewBox="0.00 0.00 452.05 181.38" 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 177.38)">
-<title>FCFS&lt; S, T, E &gt;</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Class which implements the FCFS scheduling algorithm.">
-<polygon fill="#999999" stroke="#666666" points="444.05,-68.25 353.8,-68.25 353.8,-49 444.05,-49 444.05,-68.25"/>
-<text text-anchor="middle" x="398.92" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">FCFS&lt; S, T, E &gt;</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275.8,-173.38 107.55,-173.38 107.55,-97.88 275.8,-97.88 275.8,-173.38"/>
-<text text-anchor="start" x="115.55" y="-159.88" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
-<text text-anchor="start" x="115.55" y="-148.62" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; std::tuple&lt; S, T,</text>
-<text text-anchor="start" x="115.55" y="-137.38" font-family="Helvetica,sans-Serif" font-size="10.00"> E, double, double, double</text>
-<text text-anchor="start" x="115.55" y="-126.12" font-family="Helvetica,sans-Serif" font-size="10.00"> &gt;, std::vector&lt; std::tuple</text>
-<text text-anchor="start" x="115.55" y="-114.88" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; S, T, E, double, double,</text>
-<text text-anchor="middle" x="191.67" y="-103.62" font-family="Helvetica,sans-Serif" font-size="10.00"> double &gt; &gt;, Compare&lt; S, T, E &gt; &gt;</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node2&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M286.58,-100.4C317.48,-88.81 349.43,-76.82 371.14,-68.67"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="285.71,-96.98 277.58,-103.77 288.17,-103.54 285.71,-96.98"/>
-</a>
-</g>
-<text text-anchor="middle" x="314.8" y="-98.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> schedule</text>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:title=" ">
-<polygon fill="white" stroke="#bfbfbf" points="28.8,-106.25 0,-106.25 0,-87 28.8,-87 28.8,-106.25"/>
-<text text-anchor="middle" x="14.4" y="-92.75" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node3&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M40.17,-102.14C57.88,-106.08 82.84,-111.63 107.34,-117.08"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="41.15,-98.77 30.63,-100.01 39.63,-105.6 41.15,-98.77"/>
-</a>
-</g>
-<text text-anchor="middle" x="68.17" y="-114.38" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="255.17,-79.5 128.17,-79.5 128.17,-37.75 255.17,-37.75 255.17,-79.5"/>
-<text text-anchor="start" x="136.17" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::tuple</text>
-<text text-anchor="start" x="136.17" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; S, T, E, double, double,</text>
-<text text-anchor="middle" x="191.67" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00"> double &gt; &gt;</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000004_Node000003" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M40.16,-91.26C62.89,-86.33 97.55,-78.82 127.88,-72.24"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="39.66,-87.78 30.63,-93.32 41.15,-94.62 39.66,-87.78"/>
-</a>
-</g>
-<text text-anchor="middle" x="68.17" y="-91.11" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
-</g>
-<!-- Node4&#45;&gt;Node1 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node4&#45;&gt;Node1</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M266.97,-58.62C295.9,-58.62 328.08,-58.62 353.3,-58.62"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="267.17,-55.13 257.17,-58.63 267.17,-62.13 267.17,-55.13"/>
-</a>
-</g>
-<text text-anchor="middle" x="314.8" y="-60.38" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> result</text>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/unordered_set.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="252.55,-19.25 130.8,-19.25 130.8,0 252.55,0 252.55,-19.25"/>
-<text text-anchor="middle" x="191.67" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::unordered_set&lt; S &gt;</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node1 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node5&#45;&gt;Node1</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M248.53,-22.26C257.65,-24.36 266.99,-26.54 275.8,-28.62 303.1,-35.1 333.76,-42.63 357.53,-48.53"/>
-<polygon fill="#9a32cd" stroke="#9a32cd" points="249.58,-18.91 239.05,-20.09 248.01,-25.73 249.58,-18.91"/>
-</a>
-</g>
-<text text-anchor="middle" x="314.8" y="-44.15" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> idList</text>
-</g>
-</g>
-</svg>
diff --git a/df/dc8/successive__approximation_8cpp.html b/df/dc8/successive__approximation_8cpp.html
index dbe2e3358..d908b28a4 100644
--- a/df/dc8/successive__approximation_8cpp.html
+++ b/df/dc8/successive__approximation_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods/successive_approximation.cpp File Reference</title>
+<title>TheAlgorithms/C++: numerical_methods/successive_approximation.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,7 +136,9 @@ Include dependency graph for successive_approximation.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/dcc/successive__approximation_8cpp__incl.svg" width="215" height="126"><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">
+</div>
+<p><a href="../../df/dc8/successive__approximation_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a79c1d08919ff7780a5d7723172602389" id="r_a79c1d08919ff7780a5d7723172602389"><td class="memItemLeft" align="right" valign="top">static float&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a79c1d08919ff7780a5d7723172602389">eq</a> (float y)</td></tr>
@@ -131,6 +150,8 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Method of successive approximations using <a href="https://en.wikipedia.org/wiki/Fixed-point_iteration" target="_blank">fixed-point iteration</a> method. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../df/dc8/successive__approximation_8cpp_source.html">successive_approximation.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a79c1d08919ff7780a5d7723172602389" name="a79c1d08919ff7780a5d7723172602389"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a79c1d08919ff7780a5d7723172602389">&#9670;&#160;</a></span>eq()</h2>
@@ -157,8 +178,9 @@ Functions</h2></td></tr>
 <p>equation 1 </p><p class="formulaDsp">
 \[f(y) = 3y - \cos y -2\]
 </p>
- <div class="fragment"><div class="line"><span class="lineno">   12</span>{ <span class="keywordflow">return</span> (3 * y) - <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">cos</a>(y) - 2; }</div>
-<div class="ttc" id="acos_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a></div><div class="ttdeci">T cos(T... args)</div></div>
+ 
+<p class="definition">Definition at line <a class="el" href="../../df/dc8/successive__approximation_8cpp_source.html#l00012">12</a> of file <a class="el" href="../../df/dc8/successive__approximation_8cpp_source.html">successive_approximation.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   12</span>{ <span class="keywordflow">return</span> (3 * y) - cos(y) - 2; }</div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -187,7 +209,9 @@ Functions</h2></td></tr>
 <p>equation 2 </p><p class="formulaDsp">
 \[f(y) = \frac{\cos y+2}{2}\]
 </p>
- <div class="fragment"><div class="line"><span class="lineno">   17</span>{ <span class="keywordflow">return</span> 0.5 * (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">cos</a>(y) + 2); }</div>
+ 
+<p class="definition">Definition at line <a class="el" href="../../df/dc8/successive__approximation_8cpp_source.html#l00017">17</a> of file <a class="el" href="../../df/dc8/successive__approximation_8cpp_source.html">successive_approximation.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   17</span>{ <span class="keywordflow">return</span> 0.5 * (cos(y) + 2); }</div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -206,38 +230,33 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/dc8/successive__approximation_8cpp_source.html#l00020">20</a> of file <a class="el" href="../../df/dc8/successive__approximation_8cpp_source.html">successive_approximation.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   20</span>           {</div>
 <div class="line"><span class="lineno">   21</span>    <span class="keywordtype">float</span> y, x1, x2, x3, <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a>, s, a, f1, f2, gd;</div>
 <div class="line"><span class="lineno">   22</span>    <span class="keywordtype">int</span> i, n;</div>
 <div class="line"><span class="lineno">   23</span> </div>
 <div class="line"><span class="lineno">   24</span>    <span class="keywordflow">for</span> (i = 0; i &lt; 10; i++) {</div>
 <div class="line"><span class="lineno">   25</span>        <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> = <a class="code hl_function" href="#a79c1d08919ff7780a5d7723172602389">eq</a>(y);</div>
-<div class="line"><span class="lineno">   26</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;value of equation at &quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   26</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;value of equation at &quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
 <div class="line"><span class="lineno">   27</span>        y++;</div>
 <div class="line"><span class="lineno">   28</span>    }</div>
-<div class="line"><span class="lineno">   29</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;enter the x1-&gt;&quot;</span>;</div>
-<div class="line"><span class="lineno">   30</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; x1;</div>
-<div class="line"><span class="lineno">   31</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;enter the no iteration to perform-&gt;\n&quot;</span>;</div>
-<div class="line"><span class="lineno">   32</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; n;</div>
+<div class="line"><span class="lineno">   29</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;enter the x1-&gt;&quot;</span>;</div>
+<div class="line"><span class="lineno">   30</span>    std::cin &gt;&gt; x1;</div>
+<div class="line"><span class="lineno">   31</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;enter the no iteration to perform-&gt;\n&quot;</span>;</div>
+<div class="line"><span class="lineno">   32</span>    std::cin &gt;&gt; n;</div>
 <div class="line"><span class="lineno">   33</span> </div>
 <div class="line"><span class="lineno">   34</span>    <span class="keywordflow">for</span> (i = 0; i &lt;= n; i++) {</div>
 <div class="line"><span class="lineno">   35</span>        x2 = <a class="code hl_function" href="#ae89c36add7c55298c5195d0a83de1456">eqd</a>(x1);</div>
-<div class="line"><span class="lineno">   36</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nenter the x2-&gt;&quot;</span> &lt;&lt; x2;</div>
+<div class="line"><span class="lineno">   36</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nenter the x2-&gt;&quot;</span> &lt;&lt; x2;</div>
 <div class="line"><span class="lineno">   37</span>        x1 = x2;</div>
 <div class="line"><span class="lineno">   38</span>    }</div>
 <div class="line"><span class="lineno">   39</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   40</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:232</div></div>
-<div class="ttc" id="asuccessive__approximation_8cpp_html_a79c1d08919ff7780a5d7723172602389"><div class="ttname"><a href="#a79c1d08919ff7780a5d7723172602389">eq</a></div><div class="ttdeci">static float eq(float y)</div><div class="ttdef"><b>Definition</b> successive_approximation.cpp:12</div></div>
-<div class="ttc" id="asuccessive__approximation_8cpp_html_ae89c36add7c55298c5195d0a83de1456"><div class="ttname"><a href="#ae89c36add7c55298c5195d0a83de1456">eqd</a></div><div class="ttdeci">static float eqd(float y)</div><div class="ttdef"><b>Definition</b> successive_approximation.cpp:17</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="151" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/d95/vector__ops_8hpp_source.html#l00232">vector_ops.hpp:232</a></div></div>
+<div class="ttc" id="asuccessive__approximation_8cpp_html_a79c1d08919ff7780a5d7723172602389"><div class="ttname"><a href="#a79c1d08919ff7780a5d7723172602389">eq</a></div><div class="ttdeci">static float eq(float y)</div><div class="ttdef"><b>Definition</b> <a href="../../df/dc8/successive__approximation_8cpp_source.html#l00012">successive_approximation.cpp:12</a></div></div>
+<div class="ttc" id="asuccessive__approximation_8cpp_html_ae89c36add7c55298c5195d0a83de1456"><div class="ttname"><a href="#ae89c36add7c55298c5195d0a83de1456">eqd</a></div><div class="ttdeci">static float eqd(float y)</div><div class="ttdef"><b>Definition</b> <a href="../../df/dc8/successive__approximation_8cpp_source.html#l00017">successive_approximation.cpp:17</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index a1ae83fcc..000000000
--- a/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,31,55,56"/>
-<area shape="rect" id="Node000002" href="$df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389" title=" " alt="" coords="105,5,143,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,34,89,25,91,30,56,39"/>
-<area shape="rect" id="Node000003" href="$df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456" title=" " alt="" coords="103,55,145,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,47,88,56,87,61,55,52"/>
-</map>
diff --git a/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 0dd643537..000000000
--- a/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-429e9355a163ed9c840a46407bfa74fd
\ No newline at end of file
diff --git a/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index c1bb0b88c..000000000
--- a/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="113pt" height="64pt"
- viewBox="0.00 0.00 112.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="103.28,-56.25 74.47,-56.25 74.47,-37 103.28,-37 103.28,-56.25"/>
-<text text-anchor="middle" x="88.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">eq</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.46,-32.62C45.41,-34.82 54.87,-37.45 63.44,-39.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.32,-43.16 72.89,-42.46 64.19,-36.41 62.32,-43.16"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="104.75,-19.25 73,-19.25 73,0 104.75,0 104.75,-19.25"/>
-<text text-anchor="middle" x="88.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">eqd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.46,-22.9C44.8,-20.96 53.44,-18.69 61.47,-16.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.34,-19.97 71.11,-14.04 60.55,-13.2 62.34,-19.97"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index cd44b6455..000000000
--- a/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="113pt" height="64pt"
- viewBox="0.00 0.00 112.75 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
-<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="103.28,-56.25 74.47,-56.25 74.47,-37 103.28,-37 103.28,-56.25"/>
-<text text-anchor="middle" x="88.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">eq</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.46,-32.62C45.41,-34.82 54.87,-37.45 63.44,-39.84"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.32,-43.16 72.89,-42.46 64.19,-36.41 62.32,-43.16"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="104.75,-19.25 73,-19.25 73,0 104.75,0 104.75,-19.25"/>
-<text text-anchor="middle" x="88.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">eqd</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.46,-22.9C44.8,-20.96 53.44,-18.69 61.47,-16.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="62.34,-19.97 71.11,-14.04 60.55,-13.2 62.34,-19.97"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/dc8/successive__approximation_8cpp_source.html b/df/dc8/successive__approximation_8cpp_source.html
new file mode 100644
index 000000000..a30602927
--- /dev/null
+++ b/df/dc8/successive__approximation_8cpp_source.html
@@ -0,0 +1,171 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: numerical_methods/successive_approximation.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/dc8/successive__approximation_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">successive_approximation.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../df/dc8/successive__approximation_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="preprocessor">#include &lt;cmath&gt;</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"><a class="line" href="../../df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389">   12</a></span><span class="keyword">static</span> <span class="keywordtype">float</span> <a class="code hl_function" href="../../df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389">eq</a>(<span class="keywordtype">float</span> y) { <span class="keywordflow">return</span> (3 * y) - cos(y) - 2; }</div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span> </div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"><a class="line" href="../../df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456">   17</a></span><span class="keyword">static</span> <span class="keywordtype">float</span> <a class="code hl_function" href="../../df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456">eqd</a>(<span class="keywordtype">float</span> y) { <span class="keywordflow">return</span> 0.5 * (cos(y) + 2); }</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span> </div>
+<div class="foldopen" id="foldopen00020" data-start="{" data-end="}">
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"><a class="line" href="../../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   20</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    <span class="keywordtype">float</span> y, x1, x2, x3, sum, s, a, f1, f2, gd;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span>    <span class="keywordtype">int</span> i, n;</div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span>    <span class="keywordflow">for</span> (i = 0; i &lt; 10; i++) {</div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span>        sum = <a class="code hl_function" href="../../df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389">eq</a>(y);</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;value of equation at &quot;</span> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span> &lt;&lt; sum &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>        y++;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span>    }</div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;enter the x1-&gt;&quot;</span>;</div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    std::cin &gt;&gt; x1;</div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;enter the no iteration to perform-&gt;\n&quot;</span>;</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    std::cin &gt;&gt; n;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>    <span class="keywordflow">for</span> (i = 0; i &lt;= n; i++) {</div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        x2 = <a class="code hl_function" href="../../df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456">eqd</a>(x1);</div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;\nenter the x2-&gt;&quot;</span> &lt;&lt; x2;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>        x1 = x2;</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>    }</div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>}</div>
+</div>
+<div class="ttc" id="asuccessive__approximation_8cpp_html_a79c1d08919ff7780a5d7723172602389"><div class="ttname"><a href="../../df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389">eq</a></div><div class="ttdeci">static float eq(float y)</div><div class="ttdef"><b>Definition</b> <a href="#l00012">successive_approximation.cpp:12</a></div></div>
+<div class="ttc" id="asuccessive__approximation_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00020">successive_approximation.cpp:20</a></div></div>
+<div class="ttc" id="asuccessive__approximation_8cpp_html_ae89c36add7c55298c5195d0a83de1456"><div class="ttname"><a href="../../df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456">eqd</a></div><div class="ttdeci">static float eqd(float y)</div><div class="ttdef"><b>Definition</b> <a href="#l00017">successive_approximation.cpp:17</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_9c6faab82c22511b50177aa2e38e2780.html">numerical_methods</a></li><li class="navelem"><a class="el" href="../../df/dc8/successive__approximation_8cpp.html">successive_approximation.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/dcb/namespacestrings.html b/df/dcb/namespacestrings.html
index 20983ae8c..1dd13df84 100644
--- a/df/dcb/namespacestrings.html
+++ b/df/dcb/namespacestrings.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: strings Namespace Reference</title>
+<title>TheAlgorithms/C++: strings Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,7 +140,7 @@ Namespaces</h2></td></tr>
 <div class="textblock"><p>String algorithms. </p>
 <p>for assert</p>
 <p>Algorithms with strings.</p>
-<p>for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> STL for string</p>
+<p>for IO operations for std::vector STL for string</p>
 <p>Algorithms with strings </p>
 </div></div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html b/df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html
index 40ff59211..07b3bf96a 100644
--- a/df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html
+++ b/df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: /Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/quadratic_equations_complex_numbers.cpp</title>
+<title>TheAlgorithms/C++: /Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/quadratic_equations_complex_numbers.cpp</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -107,71 +124,30 @@ $(function(){initNavTree('df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plu
   <div class="headertitle"><div class="title">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/math/quadratic_equations_complex_numbers.cpp</div></div>
 </div><!--header-->
 <div class="contents">
-<p>int <a class="el" href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4" title="Main function.">main()</a> { using <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>; using <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a>; using <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>;</p>
+<p>int <a class="el" href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4" title="Main function.">main()</a> { using std::array; using std::complex; using std::cout;</p>
 <p>array&lt;complex&lt;long double, 2&gt; solutions = quadraticEquation(1, 2, 1); cout &lt;&lt; solutions[0] &lt;&lt; " " &lt;&lt; solutions[1] &lt;&lt; "\n";</p>
 <p>solutions = quadraticEquation(1, 1, 1); // Reusing solutions. cout &lt;&lt; solutions[0] &lt;&lt; " " &lt;&lt; solutions[1] &lt;&lt; "\n"; return 0; }</p>
 <p>Output: (-1, 0) (-1, 0) (-0.5,0.866025) (-0.5,0.866025)</p>
-<div class="fragment"><div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @file</span></div>
-<div class="line"><span class="comment"> * @brief Calculate quadratic equation with complex roots, i.e. b^2 - 4ac &lt; 0.</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * @author [Renjian-buchai](https://github.com/Renjian-buchai)</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * @description Calculates any quadratic equation in form ax^2 + bx + c.</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * Quadratic equation:</span></div>
-<div class="line"><span class="comment"> * x = (-b +/- sqrt(b^2 - 4ac)) / 2a</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * @example</span></div>
-<div class="line"><span class="comment"> * int main() {</span></div>
-<div class="line"><span class="comment"> *   using std::array;</span></div>
-<div class="line"><span class="comment"> *   using std::complex;</span></div>
-<div class="line"><span class="comment"> *   using std::cout;</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> *   array&lt;complex&lt;long double, 2&gt; solutions = quadraticEquation(1, 2, 1);</span></div>
-<div class="line"><span class="comment"> *   cout &lt;&lt; solutions[0] &lt;&lt; &quot; &quot; &lt;&lt; solutions[1] &lt;&lt; &quot;\n&quot;;</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> *   solutions = quadraticEquation(1, 1, 1);  // Reusing solutions.</span></div>
-<div class="line"><span class="comment"> *   cout &lt;&lt; solutions[0] &lt;&lt; &quot; &quot; &lt;&lt; solutions[1] &lt;&lt; &quot;\n&quot;;</span></div>
-<div class="line"><span class="comment"> *   return 0;</span></div>
-<div class="line"><span class="comment"> * }</span></div>
-<div class="line"><span class="comment"> *</span></div>
-<div class="line"><span class="comment"> * Output:</span></div>
-<div class="line"><span class="comment"> * (-1, 0) (-1, 0)</span></div>
-<div class="line"><span class="comment"> * (-0.5,0.866025) (-0.5,0.866025)</span></div>
-<div class="line"><span class="comment"> */</span></div>
+<div class="fragment"><div class="line"> </div>
+<div class="line"><span class="preprocessor">#include &lt;array&gt;</span>      </div>
+<div class="line"><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><span class="preprocessor">#include &lt;cmath&gt;</span>      </div>
+<div class="line"><span class="preprocessor">#include &lt;complex&gt;</span>    </div>
+<div class="line"><span class="preprocessor">#include &lt;exception&gt;</span>  </div>
+<div class="line"><span class="preprocessor">#include &lt;iomanip&gt;</span>    </div>
+<div class="line"><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
 <div class="line"> </div>
-<div class="line"><span class="preprocessor">#include &lt;array&gt;</span>      <span class="comment">/// std::array</span></div>
-<div class="line"><span class="preprocessor">#include &lt;cassert&gt;</span>    <span class="comment">/// assert</span></div>
-<div class="line"><span class="preprocessor">#include &lt;cmath&gt;</span>      <span class="comment">/// std::sqrt, std::trunc, std::pow</span></div>
-<div class="line"><span class="preprocessor">#include &lt;complex&gt;</span>    <span class="comment">/// std::complex</span></div>
-<div class="line"><span class="preprocessor">#include &lt;exception&gt;</span>  <span class="comment">/// std::invalid_argument</span></div>
-<div class="line"><span class="preprocessor">#include &lt;iomanip&gt;</span>    <span class="comment">/// std::setprecision</span></div>
-<div class="line"><span class="preprocessor">#include &lt;iostream&gt;</span>   <span class="comment">/// std::cout</span></div>
-<div class="line"><span class="comment"></span> </div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @namespace</span></div>
-<div class="line"><span class="comment"> * @brief Mathematical algorithms</span></div>
-<div class="line"><span class="comment"> */</span></div>
 <div class="line"><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
-<div class="line"><span class="comment"></span> </div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @brief Quadratic equation calculator.</span></div>
-<div class="line"><span class="comment"> * @param a quadratic coefficient.</span></div>
-<div class="line"><span class="comment"> * @param b linear coefficient.</span></div>
-<div class="line"><span class="comment"> * @param c constant</span></div>
-<div class="line"><span class="comment"> * @return Array containing the roots of quadratic equation, incl. complex</span></div>
-<div class="line"><span class="comment"> * root.</span></div>
-<div class="line"><span class="comment"> */</span></div>
-<div class="line"><a id="_a0" name="_a0"></a><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::complex&lt;long double&gt;</a>, 2&gt; <a id="a1" name="a1"></a><a class="code hl_function" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">quadraticEquation</a>(<span class="keywordtype">long</span> <span class="keywordtype">double</span> a,</div>
+<div class="line"> </div>
+<div class="line">std::array&lt;std::complex&lt;long double&gt;, 2&gt; <a id="a0" name="a0"></a><a class="code hl_function" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">quadraticEquation</a>(<span class="keywordtype">long</span> <span class="keywordtype">double</span> a,</div>
 <div class="line">                                                           <span class="keywordtype">long</span> <span class="keywordtype">double</span> b,</div>
 <div class="line">                                                           <span class="keywordtype">long</span> <span class="keywordtype">double</span> c) {</div>
 <div class="line">    <span class="keywordflow">if</span> (a == 0) {</div>
-<div class="line">        <span class="keywordflow">throw</span> <a id="_a2" name="_a2"></a><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>(<span class="stringliteral">&quot;quadratic coefficient cannot be 0&quot;</span>);</div>
+<div class="line">        <span class="keywordflow">throw</span> std::invalid_argument(<span class="stringliteral">&quot;quadratic coefficient cannot be 0&quot;</span>);</div>
 <div class="line">    }</div>
 <div class="line"> </div>
 <div class="line">    <span class="keywordtype">long</span> <span class="keywordtype">double</span> discriminant = b * b - 4 * a * c;</div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::complex&lt;long double&gt;</a>, 2&gt; solutions{0, 0};</div>
+<div class="line">    std::array&lt;std::complex&lt;long double&gt;, 2&gt; solutions{0, 0};</div>
 <div class="line"> </div>
 <div class="line">    <span class="keywordflow">if</span> (discriminant == 0) {</div>
 <div class="line">        solutions[0] = -b * 0.5 / a;</div>
@@ -186,100 +162,89 @@ $(function(){initNavTree('df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plu
 <div class="line">    <span class="keywordflow">if</span> (discriminant &gt; 0) {</div>
 <div class="line">        <span class="comment">// Since discriminant &gt; 0, there are only real roots. Therefore,</span></div>
 <div class="line">        <span class="comment">// imaginary component = 0.</span></div>
-<div class="line">        solutions[0] = <a id="_a3" name="_a3"></a><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{</div>
-<div class="line">            (-b - <a id="a4" name="a4"></a><a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(discriminant)) * 0.5 / a, 0};</div>
-<div class="line">        solutions[1] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{</div>
-<div class="line">            (-b + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(discriminant)) * 0.5 / a, 0};</div>
+<div class="line">        solutions[0] = std::complex&lt;long double&gt;{</div>
+<div class="line">            (-b - std::sqrt(discriminant)) * 0.5 / a, 0};</div>
+<div class="line">        solutions[1] = std::complex&lt;long double&gt;{</div>
+<div class="line">            (-b + std::sqrt(discriminant)) * 0.5 / a, 0};</div>
 <div class="line">        <span class="keywordflow">return</span> solutions;</div>
 <div class="line">    }</div>
 <div class="line">    <span class="comment">// Since b^2 - 4ac is &lt; 0, for faster computation, -discriminant is</span></div>
 <div class="line">    <span class="comment">// enough to make it positive.</span></div>
-<div class="line">    solutions[0] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{</div>
-<div class="line">        -b * 0.5 / a, -<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(-discriminant) * 0.5 / a};</div>
-<div class="line">    solutions[1] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{</div>
-<div class="line">        -b * 0.5 / a, <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a>(-discriminant) * 0.5 / a};</div>
+<div class="line">    solutions[0] = std::complex&lt;long double&gt;{</div>
+<div class="line">        -b * 0.5 / a, -std::sqrt(-discriminant) * 0.5 / a};</div>
+<div class="line">    solutions[1] = std::complex&lt;long double&gt;{</div>
+<div class="line">        -b * 0.5 / a, std::sqrt(-discriminant) * 0.5 / a};</div>
 <div class="line"> </div>
 <div class="line">    <span class="keywordflow">return</span> solutions;</div>
 <div class="line">}</div>
 <div class="line"> </div>
 <div class="line">}  <span class="comment">// namespace math</span></div>
-<div class="line"><span class="comment"></span> </div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @brief Asserts an array of complex numbers.</span></div>
-<div class="line"><span class="comment"> * @param input Input array of complex numbers. .</span></div>
-<div class="line"><span class="comment"> * @param expected Expected array of complex numbers.</span></div>
-<div class="line"><span class="comment"> * @param precision Precision to be asserted. Default=10</span></div>
-<div class="line"><span class="comment"> */</span></div>
-<div class="line"><span class="keywordtype">void</span> <a id="a5" name="a5"></a><a class="code hl_function" href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a">assertArray</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>, 2&gt; input,</div>
-<div class="line">                 <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt;<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>, 2&gt; expected,</div>
-<div class="line">                 <span class="keywordtype">size_t</span> precision = 10) {</div>
-<div class="line">    <span class="keywordtype">long</span> <span class="keywordtype">double</span> exponent = <a id="a6" name="a6"></a><a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(10, precision);</div>
-<div class="line">    input[0].real(<a id="a7" name="a7"></a><a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(input[0].real() * exponent));</div>
-<div class="line">    input[1].real(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(input[1].real() * exponent));</div>
-<div class="line">    input[0].imag(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(input[0].imag() * exponent));</div>
-<div class="line">    input[1].imag(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(input[1].imag() * exponent));</div>
 <div class="line"> </div>
-<div class="line">    expected[0].real(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(expected[0].real() * exponent));</div>
-<div class="line">    expected[1].real(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(expected[1].real() * exponent));</div>
-<div class="line">    expected[0].imag(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(expected[0].imag() * exponent));</div>
-<div class="line">    expected[1].imag(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a>(expected[1].imag() * exponent));</div>
+<div class="line"><span class="keywordtype">void</span> <a id="a1" name="a1"></a><a class="code hl_function" href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a">assertArray</a>(std::array&lt;std::complex&lt;long double&gt;, 2&gt; input,</div>
+<div class="line">                 std::array&lt;std::complex&lt;long double&gt;, 2&gt; expected,</div>
+<div class="line">                 <span class="keywordtype">size_t</span> precision = 10) {</div>
+<div class="line">    <span class="keywordtype">long</span> <span class="keywordtype">double</span> exponent = std::pow(10, precision);</div>
+<div class="line">    input[0].real(std::round(input[0].real() * exponent));</div>
+<div class="line">    input[1].real(std::round(input[1].real() * exponent));</div>
+<div class="line">    input[0].imag(std::round(input[0].imag() * exponent));</div>
+<div class="line">    input[1].imag(std::round(input[1].imag() * exponent));</div>
+<div class="line"> </div>
+<div class="line">    expected[0].real(std::round(expected[0].real() * exponent));</div>
+<div class="line">    expected[1].real(std::round(expected[1].real() * exponent));</div>
+<div class="line">    expected[0].imag(std::round(expected[0].imag() * exponent));</div>
+<div class="line">    expected[1].imag(std::round(expected[1].imag() * exponent));</div>
 <div class="line"> </div>
 <div class="line">    assert(input == expected);</div>
 <div class="line">}</div>
-<div class="line"><span class="comment"></span> </div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @brief Self-test implementations to test quadraticEquation function.</span></div>
-<div class="line"><span class="comment"> * @note There are 4 different types of solutions: Real and equal, real,</span></div>
-<div class="line"><span class="comment"> * complex, complex and equal.</span></div>
-<div class="line"><span class="comment"> */</span></div>
-<div class="line"><span class="keyword">static</span> <span class="keywordtype">void</span> <a id="a8" name="a8"></a><a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
+<div class="line"> </div>
+<div class="line"><span class="keyword">static</span> <span class="keywordtype">void</span> <a id="a2" name="a2"></a><a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
 <div class="line">    <span class="comment">// Values are equal and real.</span></div>
-<div class="line">    <a id="_a9" name="_a9"></a><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;a=1 \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;b=-2 \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;c=1 \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;Expected output: \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;(1, 0), (1, 0)\n\n&quot;</span>;</div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::complex&lt;long double&gt;</a>, 2&gt; equalCase{</div>
-<div class="line">        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{1, 0}, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{1, 0}};</div>
+<div class="line">    std::array&lt;std::complex&lt;long double&gt;, 2&gt; equalCase{</div>
+<div class="line">        std::complex&lt;long double&gt;{1, 0}, std::complex&lt;long double&gt;{1, 0}};</div>
 <div class="line">    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a>(1, -2, 1) == equalCase);</div>
 <div class="line"> </div>
 <div class="line">    <span class="comment">// Values are equal and complex.</span></div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;a=1 \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;b=4 \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;c=5 \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;Expected output: \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;(-2, -1), (-2, 1)\n\n&quot;</span>;</div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::complex&lt;long double&gt;</a>, 2&gt; complexCase{</div>
-<div class="line">        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{-2, -1}, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{-2, 1}};</div>
+<div class="line">    std::array&lt;std::complex&lt;long double&gt;, 2&gt; complexCase{</div>
+<div class="line">        std::complex&lt;long double&gt;{-2, -1}, std::complex&lt;long double&gt;{-2, 1}};</div>
 <div class="line">    assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a>(1, 4, 5) == complexCase);</div>
 <div class="line"> </div>
 <div class="line">    <span class="comment">// Values are real.</span></div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;a=1 \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;b=5 \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;c=1 \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;Expected output: \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;(-4.7912878475, 0), (-0.2087121525, 0)\n\n&quot;</span>;</div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::complex&lt;long double&gt;</a>, 2&gt; floatCase{</div>
-<div class="line">        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{-4.7912878475, 0},</div>
-<div class="line">        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{-0.2087121525, 0}};</div>
+<div class="line">    std::array&lt;std::complex&lt;long double&gt;, 2&gt; floatCase{</div>
+<div class="line">        std::complex&lt;long double&gt;{-4.7912878475, 0},</div>
+<div class="line">        std::complex&lt;long double&gt;{-0.2087121525, 0}};</div>
 <div class="line">    <a class="code hl_function" href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a">assertArray</a>(<a class="code hl_function" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a>(1, 5, 1), floatCase);</div>
 <div class="line"> </div>
 <div class="line">    <span class="comment">// Values are complex.</span></div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;Input: \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;a=1 \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;b=1 \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;c=1 \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;Expected output: \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;(-0.5, -0.8660254038), (-0.5, 0.8660254038)\n\n&quot;</span>;</div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::complex&lt;long double&gt;</a>, 2&gt; ifloatCase{</div>
-<div class="line">        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{-0.5, -0.8660254038},</div>
-<div class="line">        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex&lt;long double&gt;</a>{-0.5, 0.8660254038}};</div>
+<div class="line">    std::array&lt;std::complex&lt;long double&gt;, 2&gt; ifloatCase{</div>
+<div class="line">        std::complex&lt;long double&gt;{-0.5, -0.8660254038},</div>
+<div class="line">        std::complex&lt;long double&gt;{-0.5, 0.8660254038}};</div>
 <div class="line">    <a class="code hl_function" href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a">assertArray</a>(<a class="code hl_function" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a>(1, 1, 1), ifloatCase);</div>
 <div class="line"> </div>
-<div class="line">    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Exception test: \n&quot;</span></div>
+<div class="line">    std::cout &lt;&lt; <span class="stringliteral">&quot;Exception test: \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;Input: \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;a=0 \n&quot;</span></div>
 <div class="line">                 <span class="stringliteral">&quot;b=0 \n&quot;</span></div>
@@ -287,31 +252,20 @@ $(function(){initNavTree('df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plu
 <div class="line">                 <span class="stringliteral">&quot;Expected output: Exception thrown \n&quot;</span>;</div>
 <div class="line">    <span class="keywordflow">try</span> {</div>
 <div class="line">        <a class="code hl_function" href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a>(0, 0, 0);</div>
-<div class="line">    } <span class="keywordflow">catch</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>&amp; e) {</div>
-<div class="line">        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Exception thrown successfully \n&quot;</span>;</div>
+<div class="line">    } <span class="keywordflow">catch</span> (std::invalid_argument&amp; e) {</div>
+<div class="line">        std::cout &lt;&lt; <span class="stringliteral">&quot;Exception thrown successfully \n&quot;</span>;</div>
 <div class="line">    }</div>
 <div class="line">}</div>
-<div class="line"><span class="comment"></span> </div>
-<div class="line"><span class="comment">/**</span></div>
-<div class="line"><span class="comment"> * @brief Main function</span></div>
-<div class="line"><span class="comment"> * @returns 0 on exit</span></div>
-<div class="line"><span class="comment"> */</span></div>
-<div class="line"><span class="keywordtype">int</span> <a id="a10" name="a10"></a><a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"> </div>
+<div class="line"><span class="keywordtype">int</span> <a id="a3" name="a3"></a><a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
 <div class="line">    <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();  <span class="comment">// Run self-test implementation.</span></div>
 <div class="line">    <span class="keywordflow">return</span> 0;</div>
 <div class="line">}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div></div>
-<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> generate_parentheses.cpp:82</div></div>
-<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> generate_parentheses.cpp:110</div></div>
-<div class="ttc" id="ainvalid_argument_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_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> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00082">generate_parentheses.cpp:82</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
 <div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
-<div class="ttc" id="anamespacemath_html_aacb1411ef2029e81f249c21e17c96fdb"><div class="ttname"><a href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a></div><div class="ttdeci">std::array&lt; std::complex&lt; long double &gt;, 2 &gt; quadraticEquation(long double a, long double b, long double c)</div><div class="ttdoc">Quadratic equation calculator.</div><div class="ttdef"><b>Definition</b> quadratic_equations_complex_numbers.cpp:53</div></div>
-<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
-<div class="ttc" id="aquadratic__equations__complex__numbers_8cpp_html_af7a6d4e3dc85a6288c8f1f7094830c5a"><div class="ttname"><a href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a">assertArray</a></div><div class="ttdeci">void assertArray(std::array&lt; std::complex&lt; long double &gt;, 2 &gt; input, std::array&lt; std::complex&lt; long double &gt;, 2 &gt; expected, size_t precision=10)</div><div class="ttdoc">Asserts an array of complex numbers.</div><div class="ttdef"><b>Definition</b> quadratic_equations_complex_numbers.cpp:100</div></div>
-<div class="ttc" id="around_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/round.html">std::round</a></div><div class="ttdeci">T round(T... args)</div></div>
-<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
+<div class="ttc" id="anamespacemath_html_aacb1411ef2029e81f249c21e17c96fdb"><div class="ttname"><a href="../../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb">math::quadraticEquation</a></div><div class="ttdeci">std::array&lt; std::complex&lt; long double &gt;, 2 &gt; quadraticEquation(long double a, long double b, long double c)</div><div class="ttdoc">Quadratic equation calculator.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d18/quadratic__equations__complex__numbers_8cpp_source.html#l00053">quadratic_equations_complex_numbers.cpp:53</a></div></div>
+<div class="ttc" id="aquadratic__equations__complex__numbers_8cpp_html_af7a6d4e3dc85a6288c8f1f7094830c5a"><div class="ttname"><a href="../../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a">assertArray</a></div><div class="ttdeci">void assertArray(std::array&lt; std::complex&lt; long double &gt;, 2 &gt; input, std::array&lt; std::complex&lt; long double &gt;, 2 &gt; expected, size_t precision=10)</div><div class="ttdoc">Asserts an array of complex numbers.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d18/quadratic__equations__complex__numbers_8cpp_source.html#l00100">quadratic_equations_complex_numbers.cpp:100</a></div></div>
 </div><!-- fragment --> </div><!-- contents -->
 </div><!-- doc-content -->
 <!-- start footer part -->
diff --git a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.map b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.map
index 29c4a8b31..7c598801a 100644
--- a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.map
+++ b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.map
@@ -1,5 +1,5 @@
 <map id="greedy_algorithms::dijkstra::Graph" name="greedy_algorithms::dijkstra::Graph">
 <area shape="rect" id="Node000001" title="Wrapper class for storing a graph." alt="" coords="16,109,152,150"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="5,5,163,46"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,5,163,46"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="87,62,87,109,81,109,81,62"/>
 </map>
diff --git a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.md5 b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.md5
index 010724ef2..87b2bf61e 100644
--- a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.md5
+++ b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.md5
@@ -1 +1 @@
-24db918ea4b864252d7d1e4eb4c36930
\ No newline at end of file
+688de14e7efb7d4a90281b5af0b3cd06
\ No newline at end of file
diff --git a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.svg b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.svg
index 53b944789..bbe703021 100644
--- a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.svg
+++ b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph.svg
@@ -32,7 +32,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="118,-108.25 0,-108.25 0,-77.75 118,-77.75 118,-108.25"/>
 <text text-anchor="start" x="8" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="59" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
diff --git a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph_org.svg b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph_org.svg
index a7ff5aac8..f5a50cdf1 100644
--- a/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph_org.svg
+++ b/df/dce/classgreedy__algorithms_1_1dijkstra_1_1_graph__coll__graph_org.svg
@@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="118,-108.25 0,-108.25 0,-77.75 118,-77.75 118,-108.25"/>
 <text text-anchor="start" x="8" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; std::vector</text>
 <text text-anchor="middle" x="59" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; int &gt; &gt;</text>
diff --git a/df/dce/namespacegraph.html b/df/dce/namespacegraph.html
index e8db086ce..4bce62d97 100644
--- a/df/dce/namespacegraph.html
+++ b/df/dce/namespacegraph.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph Namespace Reference</title>
+<title>TheAlgorithms/C++: graph Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -128,37 +145,37 @@ Classes</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a9125ceb66bfbec3093bba64c2c1e99e2" id="r_a9125ceb66bfbec3093bba64c2c1e99e2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9125ceb66bfbec3093bba64c2c1e99e2">addEdge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; *adj, int u, int v)</td></tr>
+<tr class="memitem:a9125ceb66bfbec3093bba64c2c1e99e2" id="r_a9125ceb66bfbec3093bba64c2c1e99e2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9125ceb66bfbec3093bba64c2c1e99e2">addEdge</a> (std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, int v)</td></tr>
 <tr class="memdesc:a9125ceb66bfbec3093bba64c2c1e99e2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that add edge between two nodes or vertices of graph.  <br /></td></tr>
 <tr class="separator:a9125ceb66bfbec3093bba64c2c1e99e2"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a3ae80bc4c6a79d041b4f3a6589eb7fb8" id="r_a3ae80bc4c6a79d041b4f3a6589eb7fb8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3ae80bc4c6a79d041b4f3a6589eb7fb8">explore</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; *adj, int u, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; *visited)</td></tr>
+<tr class="memitem:a3ae80bc4c6a79d041b4f3a6589eb7fb8" id="r_a3ae80bc4c6a79d041b4f3a6589eb7fb8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a3ae80bc4c6a79d041b4f3a6589eb7fb8">explore</a> (const std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, std::vector&lt; bool &gt; *visited)</td></tr>
 <tr class="memdesc:a3ae80bc4c6a79d041b4f3a6589eb7fb8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function for depth first seach algorithm this function explores the vertex which is passed into.  <br /></td></tr>
 <tr class="separator:a3ae80bc4c6a79d041b4f3a6589eb7fb8"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a83ab16e96cec644109a58dfc9329bc2b" id="r_a83ab16e96cec644109a58dfc9329bc2b"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a83ab16e96cec644109a58dfc9329bc2b">getConnectedComponents</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; *adj)</td></tr>
+<tr class="memitem:a83ab16e96cec644109a58dfc9329bc2b" id="r_a83ab16e96cec644109a58dfc9329bc2b"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a83ab16e96cec644109a58dfc9329bc2b">getConnectedComponents</a> (const std::vector&lt; std::vector&lt; int &gt; &gt; *adj)</td></tr>
 <tr class="memdesc:a83ab16e96cec644109a58dfc9329bc2b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that perfoms depth first search algorithm on graph and calculated the number of connected components.  <br /></td></tr>
 <tr class="separator:a83ab16e96cec644109a58dfc9329bc2b"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ad4016cfc80485a43748895a2c26c7d08" id="r_ad4016cfc80485a43748895a2c26c7d08"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad4016cfc80485a43748895a2c26c7d08">addEdge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &gt; *adj, size_t u, size_t v)</td></tr>
+<tr class="memitem:ad4016cfc80485a43748895a2c26c7d08" id="r_ad4016cfc80485a43748895a2c26c7d08"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad4016cfc80485a43748895a2c26c7d08">addEdge</a> (std::vector&lt; std::vector&lt; size_t &gt; &gt; *adj, size_t u, size_t v)</td></tr>
 <tr class="memdesc:ad4016cfc80485a43748895a2c26c7d08"><td class="mdescLeft">&#160;</td><td class="mdescRight">Adds and edge between two vertices of graph say u and v in this case.  <br /></td></tr>
 <tr class="separator:ad4016cfc80485a43748895a2c26c7d08"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a64c1db5aad7502c6f08e4652f6edd463" id="r_a64c1db5aad7502c6f08e4652f6edd463"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a64c1db5aad7502c6f08e4652f6edd463">explore</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &gt; &amp;adj, size_t v, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; *visited)</td></tr>
+<tr class="memitem:a64c1db5aad7502c6f08e4652f6edd463" id="r_a64c1db5aad7502c6f08e4652f6edd463"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a64c1db5aad7502c6f08e4652f6edd463">explore</a> (const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;adj, size_t v, std::vector&lt; bool &gt; *visited)</td></tr>
 <tr class="memdesc:a64c1db5aad7502c6f08e4652f6edd463"><td class="mdescLeft">&#160;</td><td class="mdescRight">Explores the given vertex, exploring a vertex means traversing over all the vertices which are connected to the vertex that is currently being explored.  <br /></td></tr>
 <tr class="separator:a64c1db5aad7502c6f08e4652f6edd463"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ab5428a3519267a28bba4b4310cfbb6ae" id="r_ab5428a3519267a28bba4b4310cfbb6ae"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab5428a3519267a28bba4b4310cfbb6ae">depth_first_search</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &gt; &amp;adj, size_t start)</td></tr>
+<tr class="memitem:ab5428a3519267a28bba4b4310cfbb6ae" id="r_ab5428a3519267a28bba4b4310cfbb6ae"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab5428a3519267a28bba4b4310cfbb6ae">depth_first_search</a> (const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;adj, size_t start)</td></tr>
 <tr class="memdesc:ab5428a3519267a28bba4b4310cfbb6ae"><td class="mdescLeft">&#160;</td><td class="mdescRight">initiates depth first search algorithm.  <br /></td></tr>
 <tr class="separator:ab5428a3519267a28bba4b4310cfbb6ae"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a0e30e0dca68cb6e4f671440819b35b6a" id="r_a0e30e0dca68cb6e4f671440819b35b6a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0e30e0dca68cb6e4f671440819b35b6a">addEdge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &gt; *adj, int u, int v, int w)</td></tr>
+<tr class="memitem:a0e30e0dca68cb6e4f671440819b35b6a" id="r_a0e30e0dca68cb6e4f671440819b35b6a"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0e30e0dca68cb6e4f671440819b35b6a">addEdge</a> (std::vector&lt; std::vector&lt; std::pair&lt; int, int &gt; &gt; &gt; *adj, int u, int v, int w)</td></tr>
 <tr class="memdesc:a0e30e0dca68cb6e4f671440819b35b6a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that add edge between two nodes or vertices of graph.  <br /></td></tr>
 <tr class="separator:a0e30e0dca68cb6e4f671440819b35b6a"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:adc68cbc8ba09eb1142265935c0d45b84" id="r_adc68cbc8ba09eb1142265935c0d45b84"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adc68cbc8ba09eb1142265935c0d45b84">dijkstra</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &gt; *adj, int s, int t)</td></tr>
+<tr class="memitem:adc68cbc8ba09eb1142265935c0d45b84" id="r_adc68cbc8ba09eb1142265935c0d45b84"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adc68cbc8ba09eb1142265935c0d45b84">dijkstra</a> (std::vector&lt; std::vector&lt; std::pair&lt; int, int &gt; &gt; &gt; *adj, int s, int t)</td></tr>
 <tr class="memdesc:adc68cbc8ba09eb1142265935c0d45b84"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and returns the shortest distance of target from the source.  <br /></td></tr>
 <tr class="separator:adc68cbc8ba09eb1142265935c0d45b84"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a8e1b547cd407c0774e63f0dc95cda9e7" id="r_a8e1b547cd407c0774e63f0dc95cda9e7"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8e1b547cd407c0774e63f0dc95cda9e7">checkBipartite</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &gt; &amp;graph, int64_t index, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; *visited)</td></tr>
+<tr class="memitem:a8e1b547cd407c0774e63f0dc95cda9e7" id="r_a8e1b547cd407c0774e63f0dc95cda9e7"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8e1b547cd407c0774e63f0dc95cda9e7">checkBipartite</a> (const std::vector&lt; std::vector&lt; int64_t &gt; &gt; &amp;graph, int64_t index, std::vector&lt; int64_t &gt; *visited)</td></tr>
 <tr class="memdesc:a8e1b547cd407c0774e63f0dc95cda9e7"><td class="mdescLeft">&#160;</td><td class="mdescRight">function to check whether the passed graph is bipartite or not  <br /></td></tr>
 <tr class="separator:a8e1b547cd407c0774e63f0dc95cda9e7"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a84b0551489c613a681cc83b34450da4b" id="r_a84b0551489c613a681cc83b34450da4b"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a84b0551489c613a681cc83b34450da4b">isBipartite</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &gt; &amp;graph)</td></tr>
+<tr class="memitem:a84b0551489c613a681cc83b34450da4b" id="r_a84b0551489c613a681cc83b34450da4b"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a84b0551489c613a681cc83b34450da4b">isBipartite</a> (const std::vector&lt; std::vector&lt; int64_t &gt; &gt; &amp;graph)</td></tr>
 <tr class="memdesc:a84b0551489c613a681cc83b34450da4b"><td class="mdescLeft">&#160;</td><td class="mdescRight">returns true if the given graph is bipartite else returns false  <br /></td></tr>
 <tr class="separator:a84b0551489c613a681cc83b34450da4b"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:ab7706341d006e20d1ae58274187a3346" id="r_ab7706341d006e20d1ae58274187a3346"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab7706341d006e20d1ae58274187a3346">TravellingSalesmanProblem</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint32_t &gt; &gt; *cities, int32_t src, uint32_t V)</td></tr>
+<tr class="memitem:ab7706341d006e20d1ae58274187a3346" id="r_ab7706341d006e20d1ae58274187a3346"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab7706341d006e20d1ae58274187a3346">TravellingSalesmanProblem</a> (std::vector&lt; std::vector&lt; uint32_t &gt; &gt; *cities, int32_t src, uint32_t V)</td></tr>
 <tr class="memdesc:ab7706341d006e20d1ae58274187a3346"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function calculates the minimum path distance that will cover all the cities starting from the source.  <br /></td></tr>
 <tr class="separator:ab7706341d006e20d1ae58274187a3346"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
@@ -166,14 +183,14 @@ Functions</h2></td></tr>
 <div class="textblock"><p><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms. </p>
 <p>for assert</p>
 <p>Check whether a given graph is bipartite or not.</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
+<p>for std::vector</p>
 <p><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> algorithms.</p>
-<p>for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/set.html">std::set</a></p>
+<p>for IO operations for std::set</p>
 <p><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms</p>
 <p>A bipartite graph is the one whose nodes can be divided into two disjoint sets in such a way that the nodes in a set are not connected to each other at all, i.e. no intra-set connections. The only connections that exist are that of inter-set, i.e. the nodes from one set are connected to a subset of nodes in the other set. In this implementation, using a graph in the form of adjacency list, check whether the given graph is a bipartite or not.</p>
 <p>References used: <a href="https://www.geeksforgeeks.org/bipartite-graph/" target="_blank">GeeksForGeeks</a> </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/tushar2407" target="_blank">tushar2407</a> for assert for IO operations for queue data structure for vector data structure</dd></dl>
 <p>Graphical algorithms</p>
-<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a> 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>
+<p>for std::min for IO operations for limits of integral types for std::vector</p>
 <p><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">Graph</a> Algorithms </p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="a9125ceb66bfbec3093bba64c2c1e99e2" name="a9125ceb66bfbec3093bba64c2c1e99e2"></a>
@@ -185,7 +202,7 @@ Functions</h2></td></tr>
         <tr>
           <td class="memname">void graph::addEdge </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; int &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -209,6 +226,8 @@ Functions</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/ddd/connected__components_8cpp_source.html#l00046">46</a> of file <a class="el" href="../../df/ddd/connected__components_8cpp_source.html">connected_components.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   46</span>                                                           {</div>
 <div class="line"><span class="lineno">   47</span>    (*adj)[u - 1].push_back(v - 1);</div>
 <div class="line"><span class="lineno">   48</span>    (*adj)[v - 1].push_back(u - 1);</div>
@@ -225,7 +244,7 @@ Functions</h2></td></tr>
         <tr>
           <td class="memname">void graph::addEdge </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; size_t &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -249,6 +268,8 @@ Functions</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d8d/depth__first__search_8cpp_source.html#l00056">56</a> of file <a class="el" href="../../da/d8d/depth__first__search_8cpp_source.html">depth_first_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   56</span>                                                                    {</div>
 <div class="line"><span class="lineno">   57</span>    <span class="comment">/*</span></div>
 <div class="line"><span class="lineno">   58</span><span class="comment">     *</span></div>
@@ -272,7 +293,7 @@ Functions</h2></td></tr>
         <tr>
           <td class="memname">void graph::addEdge </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; std::pair&lt; int, int &gt; &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -300,17 +321,13 @@ Functions</h2></td></tr>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d68/dijkstra_8cpp_source.html#l00048">48</a> of file <a class="el" href="../../d8/d68/dijkstra_8cpp_source.html">dijkstra.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   49</span>                    {</div>
-<div class="line"><span class="lineno">   50</span>    (*adj)[u - 1].push_back(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(v - 1, w));</div>
+<div class="line"><span class="lineno">   50</span>    (*adj)[u - 1].push_back(std::make_pair(v - 1, w));</div>
 <div class="line"><span class="lineno">   51</span>    <span class="comment">// (*adj)[v - 1].push_back(std::make_pair(u - 1, w));</span></div>
 <div class="line"><span class="lineno">   52</span>}</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><!-- 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="../../df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph.svg" width="279" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a8e1b547cd407c0774e63f0dc95cda9e7" name="a8e1b547cd407c0774e63f0dc95cda9e7"></a>
@@ -322,7 +339,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool graph::checkBipartite </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>graph</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; int64_t &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>graph</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -332,7 +349,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; *</td>          <td class="paramname"><span class="paramname"><em>visited</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; int64_t &gt; *</td>          <td class="paramname"><span class="paramname"><em>visited</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -356,40 +373,35 @@ Here is the call graph for this function:</div>
 <p>insert the neighbouring node into the queue</p>
 <p>if both the current node and its neighbour has the same state then it is not a bipartite graph</p>
 <p>return true when all the connected nodes of the current nodes are travelled and satisify all the above conditions</p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dc3/is__graph__bipartite2_8cpp_source.html#l00037">37</a> of file <a class="el" href="../../dd/dc3/is__graph__bipartite2_8cpp_source.html">is_graph_bipartite2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   38</span>                                                                {</div>
-<div class="line"><span class="lineno">   39</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue&lt;int64_t&gt;</a> q;  <span class="comment">///&lt; stores the neighbouring node indexes in squence</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">   40</span><span class="comment">                            /// of being reached</span></div>
-<div class="line"><span class="lineno">   41</span><span class="comment"></span>    q.push(index);          <span class="comment">/// insert the current node into the queue</span></div>
-<div class="line"><span class="lineno">   42</span>    (*visited)[index] = 1;  <span class="comment">/// mark the current node as travelled</span></div>
+<div class="line"><span class="lineno">   39</span>    std::queue&lt;int64_t&gt; q;  </div>
+<div class="line"><span class="lineno">   41</span>    q.push(index);          </div>
+<div class="line"><span class="lineno">   42</span>    (*visited)[index] = 1;  </div>
 <div class="line"><span class="lineno">   43</span>    <span class="keywordflow">while</span> (q.size()) {</div>
 <div class="line"><span class="lineno">   44</span>        int64_t u = q.front();</div>
 <div class="line"><span class="lineno">   45</span>        q.pop();</div>
 <div class="line"><span class="lineno">   46</span>        <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[u].size(); i++) {</div>
 <div class="line"><span class="lineno">   47</span>            int64_t v =</div>
-<div class="line"><span class="lineno">   48</span>                <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[u][i];     <span class="comment">///&lt; stores the neighbour of the current node</span></div>
-<div class="line"><span class="lineno">   49</span>            <span class="keywordflow">if</span> (!(*visited)[v])  <span class="comment">/// check whether the neighbour node is</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">   50</span><span class="comment">                                 /// travelled already or not</span></div>
-<div class="line"><span class="lineno">   51</span><span class="comment"></span>            {</div>
+<div class="line"><span class="lineno">   48</span>                <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>[u][i];     </div>
+<div class="line"><span class="lineno">   49</span>            <span class="keywordflow">if</span> (!(*visited)[v])  </div>
+<div class="line"><span class="lineno">   51</span>            {</div>
 <div class="line"><span class="lineno">   52</span>                (*visited)[v] =</div>
 <div class="line"><span class="lineno">   53</span>                    ((*visited)[u] == 1)</div>
 <div class="line"><span class="lineno">   54</span>                        ? -1</div>
-<div class="line"><span class="lineno">   55</span>                        : 1;  <span class="comment">/// colour the neighbouring node with</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">   56</span><span class="comment">                              /// different colour than the current node</span></div>
-<div class="line"><span class="lineno">   57</span><span class="comment"></span>                q.push(v);    <span class="comment">/// insert the neighbouring node into the queue</span></div>
+<div class="line"><span class="lineno">   55</span>                        : 1;  </div>
+<div class="line"><span class="lineno">   57</span>                q.push(v);    </div>
 <div class="line"><span class="lineno">   58</span>            } <span class="keywordflow">else</span> <span class="keywordflow">if</span> ((*visited)[v] ==</div>
-<div class="line"><span class="lineno">   59</span>                       (*visited)[u])  <span class="comment">/// if both the current node and its</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">   60</span><span class="comment">                                       /// neighbour has the same state then it</span></div>
-<div class="line"><span class="lineno">   61</span><span class="comment">                                       /// is not a bipartite graph</span></div>
-<div class="line"><span class="lineno">   62</span><span class="comment"></span>            {</div>
+<div class="line"><span class="lineno">   59</span>                       (*visited)[u])  </div>
+<div class="line"><span class="lineno">   62</span>            {</div>
 <div class="line"><span class="lineno">   63</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</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>    }</div>
-<div class="line"><span class="lineno">   67</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;  <span class="comment">/// return true when all the connected nodes of the current</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">   68</span><span class="comment">                  /// nodes are travelled and satisify all the above conditions</span></div>
-<div class="line"><span class="lineno">   69</span><span class="comment"></span>}</div>
+<div class="line"><span class="lineno">   67</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;  </div>
+<div class="line"><span class="lineno">   69</span>}</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 class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -402,7 +414,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void graph::depth_first_search </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -420,21 +432,16 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d8d/depth__first__search_8cpp_source.html#l00099">99</a> of file <a class="el" href="../../da/d8d/depth__first__search_8cpp_source.html">depth_first_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  100</span>                                      {</div>
-<div class="line"><span class="lineno">  101</span>    <span class="keywordtype">size_t</span> vertices = 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">  101</span>    <span class="keywordtype">size_t</span> vertices = adj.size();</div>
 <div class="line"><span class="lineno">  102</span> </div>
-<div class="line"><span class="lineno">  103</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a> visited(vertices, <span class="keyword">false</span>);</div>
+<div class="line"><span class="lineno">  103</span>    std::vector&lt;bool&gt; visited(vertices, <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">  104</span>    <a class="code hl_function" href="#a3ae80bc4c6a79d041b4f3a6589eb7fb8">explore</a>(adj, start, &amp;visited);</div>
 <div class="line"><span class="lineno">  105</span>}</div>
-<div class="ttc" id="anamespacegraph_html_a3ae80bc4c6a79d041b4f3a6589eb7fb8"><div class="ttname"><a href="#a3ae80bc4c6a79d041b4f3a6589eb7fb8">graph::explore</a></div><div class="ttdeci">void explore(const std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, std::vector&lt; bool &gt; *visited)</div><div class="ttdoc">Utility function for depth first seach algorithm this function explores the vertex which is passed in...</div><div class="ttdef"><b>Definition</b> connected_components.cpp:59</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>
-</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="../../df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph.svg" width="296" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacegraph_html_a3ae80bc4c6a79d041b4f3a6589eb7fb8"><div class="ttname"><a href="#a3ae80bc4c6a79d041b4f3a6589eb7fb8">graph::explore</a></div><div class="ttdeci">void explore(const std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, std::vector&lt; bool &gt; *visited)</div><div class="ttdoc">Utility function for depth first seach algorithm this function explores the vertex which is passed in...</div><div class="ttdef"><b>Definition</b> <a href="../../df/ddd/connected__components_8cpp_source.html#l00059">connected_components.cpp:59</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="adc68cbc8ba09eb1142265935c0d45b84" name="adc68cbc8ba09eb1142265935c0d45b84"></a>
@@ -446,7 +453,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">int graph::dijkstra </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; std::pair&lt; int, int &gt; &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -480,42 +487,32 @@ Here is the call graph for this function:</div>
 <p>first element of pair denotes the distance</p>
 <p>for all the reachable vertex from the currently exploring vertex we will try to minimize the distance</p>
 <p>minimizing distances</p>
-<div class="fragment"><div class="line"><span class="lineno">   66</span>                                                                         {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   67</span><span class="comment">    /// n denotes the number of vertices in graph</span></div>
-<div class="line"><span class="lineno">   68</span><span class="comment"></span>    <span class="keywordtype">int</span> n = adj-&gt;<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">   69</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   70</span><span class="comment">    /// setting all the distances initially to INF</span></div>
-<div class="line"><span class="lineno">   71</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> dist(n, INF);</div>
-<div class="line"><span class="lineno">   72</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   73</span><span class="comment">    /// creating a min heap using priority queue</span></div>
-<div class="line"><span class="lineno">   74</span><span class="comment">    /// first element of pair contains the distance</span></div>
-<div class="line"><span class="lineno">   75</span><span class="comment">    /// second element of pair contains the vertex</span></div>
-<div class="line"><span class="lineno">   76</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue&lt;std::pair&lt;int, int&gt;</a>, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::pair&lt;int, int&gt;</a>&gt;,</div>
-<div class="line"><span class="lineno">   77</span>                        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/greater.html">std::greater&lt;std::pair&lt;int, int&gt;</a>&gt;&gt;</div>
+
+<p class="definition">Definition at line <a class="el" href="../../d8/d68/dijkstra_8cpp_source.html#l00066">66</a> of file <a class="el" href="../../d8/d68/dijkstra_8cpp_source.html">dijkstra.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   66</span>                                                                         {</div>
+<div class="line"><span class="lineno">   68</span>    <span class="keywordtype">int</span> n = adj-&gt;size();</div>
+<div class="line"><span class="lineno">   69</span> </div>
+<div class="line"><span class="lineno">   71</span>    std::vector&lt;int64_t&gt; dist(n, INF);</div>
+<div class="line"><span class="lineno">   72</span> </div>
+<div class="line"><span class="lineno">   76</span>    std::priority_queue&lt;std::pair&lt;int, int&gt;, std::vector&lt;std::pair&lt;int, int&gt;&gt;,</div>
+<div class="line"><span class="lineno">   77</span>                        std::greater&lt;std::pair&lt;int, int&gt;&gt;&gt;</div>
 <div class="line"><span class="lineno">   78</span>        pq;</div>
-<div class="line"><span class="lineno">   79</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   80</span><span class="comment">    /// pushing the source vertex &#39;s&#39; with 0 distance in min heap</span></div>
-<div class="line"><span class="lineno">   81</span><span class="comment"></span>    pq.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html">push</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(0, s));</div>
-<div class="line"><span class="lineno">   82</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   83</span><span class="comment">    /// marking the distance of source as 0</span></div>
-<div class="line"><span class="lineno">   84</span><span class="comment"></span>    dist[s] = 0;</div>
+<div class="line"><span class="lineno">   79</span> </div>
+<div class="line"><span class="lineno">   81</span>    pq.push(std::make_pair(0, s));</div>
+<div class="line"><span class="lineno">   82</span> </div>
+<div class="line"><span class="lineno">   84</span>    dist[s] = 0;</div>
 <div class="line"><span class="lineno">   85</span> </div>
-<div class="line"><span class="lineno">   86</span>    <span class="keywordflow">while</span> (!pq.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/empty.html">empty</a>()) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   87</span><span class="comment">        /// second element of pair denotes the node / vertex</span></div>
-<div class="line"><span class="lineno">   88</span><span class="comment"></span>        <span class="keywordtype">int</span> currentNode = pq.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html">top</a>().second;</div>
-<div class="line"><span class="lineno">   89</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   90</span><span class="comment">        /// first element of pair denotes the distance</span></div>
-<div class="line"><span class="lineno">   91</span><span class="comment"></span>        <span class="keywordtype">int</span> currentDist = pq.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html">top</a>().first;</div>
+<div class="line"><span class="lineno">   86</span>    <span class="keywordflow">while</span> (!pq.empty()) {</div>
+<div class="line"><span class="lineno">   88</span>        <span class="keywordtype">int</span> currentNode = pq.top().second;</div>
+<div class="line"><span class="lineno">   89</span> </div>
+<div class="line"><span class="lineno">   91</span>        <span class="keywordtype">int</span> currentDist = pq.top().first;</div>
 <div class="line"><span class="lineno">   92</span> </div>
-<div class="line"><span class="lineno">   93</span>        pq.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/pop.html">pop</a>();</div>
-<div class="line"><span class="lineno">   94</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   95</span><span class="comment">        /// for all the reachable vertex from the currently exploring vertex</span></div>
-<div class="line"><span class="lineno">   96</span><span class="comment">        /// we will try to minimize the distance</span></div>
-<div class="line"><span class="lineno">   97</span><span class="comment"></span>        <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair&lt;int, int&gt;</a> edge : (*adj)[currentNode]) {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   98</span><span class="comment">            /// minimizing distances</span></div>
-<div class="line"><span class="lineno">   99</span><span class="comment"></span>            <span class="keywordflow">if</span> (currentDist + edge.second &lt; dist[edge.first]) {</div>
+<div class="line"><span class="lineno">   93</span>        pq.pop();</div>
+<div class="line"><span class="lineno">   94</span> </div>
+<div class="line"><span class="lineno">   97</span>        <span class="keywordflow">for</span> (std::pair&lt;int, int&gt; edge : (*adj)[currentNode]) {</div>
+<div class="line"><span class="lineno">   99</span>            <span class="keywordflow">if</span> (currentDist + edge.second &lt; dist[edge.first]) {</div>
 <div class="line"><span class="lineno">  100</span>                dist[edge.first] = currentDist + edge.second;</div>
-<div class="line"><span class="lineno">  101</span>                pq.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html">push</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a>(dist[edge.first], edge.first));</div>
+<div class="line"><span class="lineno">  101</span>                pq.push(std::make_pair(dist[edge.first], edge.first));</div>
 <div class="line"><span class="lineno">  102</span>            }</div>
 <div class="line"><span class="lineno">  103</span>        }</div>
 <div class="line"><span class="lineno">  104</span>    }</div>
@@ -524,19 +521,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  107</span>    }</div>
 <div class="line"><span class="lineno">  108</span>    <span class="keywordflow">return</span> -1;</div>
 <div class="line"><span class="lineno">  109</span>}</div>
-<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue/empty.html">std::priority_queue::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
-<div class="ttc" id="agreater_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/functional/greater.html">std::greater</a></div></div>
-<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
-<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue/pop.html">std::priority_queue::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
-<div class="ttc" id="apriority_queue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a></div></div>
-<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html">std::priority_queue::push</a></div><div class="ttdeci">T push(T... args)</div></div>
-<div class="ttc" id="atop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html">std::priority_queue::top</a></div><div class="ttdeci">T top(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dce/namespacegraph_adc68cbc8ba09eb1142265935c0d45b84_cgraph.svg" width="320" height="315"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a3ae80bc4c6a79d041b4f3a6589eb7fb8" name="a3ae80bc4c6a79d041b4f3a6589eb7fb8"></a>
@@ -548,7 +533,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void graph::explore </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; int &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -558,7 +543,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; *</td>          <td class="paramname"><span class="paramname"><em>visited</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; bool &gt; *</td>          <td class="paramname"><span class="paramname"><em>visited</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -572,6 +557,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/ddd/connected__components_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../df/ddd/connected__components_8cpp_source.html">connected_components.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   60</span>                                       {</div>
 <div class="line"><span class="lineno">   61</span>    (*visited)[u] = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   62</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> v : (*adj)[u]) {</div>
@@ -580,12 +567,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   65</span>        }</div>
 <div class="line"><span class="lineno">   66</span>    }</div>
 <div class="line"><span class="lineno">   67</span>}</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="../../df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.svg" width="115" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a64c1db5aad7502c6f08e4652f6edd463" name="a64c1db5aad7502c6f08e4652f6edd463"></a>
@@ -597,7 +579,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void graph::explore </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; size_t &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>adj</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -607,7 +589,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="paramkey"></td>
           <td></td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; *</td>          <td class="paramname"><span class="paramname"><em>visited</em></span>&#160;)</td>
+          <td class="paramtype">std::vector&lt; bool &gt; *</td>          <td class="paramname"><span class="paramname"><em>visited</em></span>&#160;)</td>
         </tr>
       </table>
 </div><div class="memdoc">
@@ -621,8 +603,10 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../da/d8d/depth__first__search_8cpp_source.html#l00080">80</a> of file <a class="el" href="../../da/d8d/depth__first__search_8cpp_source.html">depth_first_search.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   81</span>                                       {</div>
-<div class="line"><span class="lineno">   82</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; v + 1 &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
+<div class="line"><span class="lineno">   82</span>    std::cout &lt;&lt; v + 1 &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
 <div class="line"><span class="lineno">   83</span>    (*visited)[v] = <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   84</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> x : adj[v]) {</div>
 <div class="line"><span class="lineno">   85</span>        <span class="keywordflow">if</span> (!(*visited)[x]) {</div>
@@ -630,13 +614,7 @@ Here is the call graph for this function:</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>}</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><!-- 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="../../df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph.svg" width="266" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a83ab16e96cec644109a58dfc9329bc2b" name="a83ab16e96cec644109a58dfc9329bc2b"></a>
@@ -648,7 +626,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">int graph::getConnectedComponents </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; int &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>adj</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -662,10 +640,12 @@ Here is the call graph for this function:</div>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>connected_components number of connected components in graph. </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/ddd/connected__components_8cpp_source.html#l00077">77</a> of file <a class="el" href="../../df/ddd/connected__components_8cpp_source.html">connected_components.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   77</span>                                                                 {</div>
-<div class="line"><span class="lineno">   78</span>    <span class="keywordtype">int</span> n = adj-&gt;<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">   78</span>    <span class="keywordtype">int</span> n = adj-&gt;size();</div>
 <div class="line"><span class="lineno">   79</span>    <span class="keywordtype">int</span> connected_components = 0;</div>
-<div class="line"><span class="lineno">   80</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a> visited(n, <span class="keyword">false</span>);</div>
+<div class="line"><span class="lineno">   80</span>    std::vector&lt;bool&gt; visited(n, <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">   81</span> </div>
 <div class="line"><span class="lineno">   82</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
 <div class="line"><span class="lineno">   83</span>        <span class="keywordflow">if</span> (!visited[i]) {</div>
@@ -675,12 +655,7 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   87</span>    }</div>
 <div class="line"><span class="lineno">   88</span>    <span class="keywordflow">return</span> connected_components;</div>
 <div class="line"><span class="lineno">   89</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph.svg" width="391" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a84b0551489c613a681cc83b34450da4b" name="a84b0551489c613a681cc83b34450da4b"></a>
@@ -692,7 +667,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">bool graph::isBipartite </td>
           <td>(</td>
-          <td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>graph</em></span></td><td>)</td>
+          <td class="paramtype">const std::vector&lt; std::vector&lt; int64_t &gt; &gt; &amp;</td>          <td class="paramname"><span class="paramname"><em>graph</em></span></td><td>)</td>
           <td></td>
         </tr>
       </table>
@@ -708,17 +683,15 @@ Here is the call graph for this function:</div>
 <dl class="section return"><dt>Returns</dt><dd>booleans </dd></dl>
 <p>&lt; stores boolean values which signify whether that node had been visited or not</p>
 <p>if the current node is not visited then check whether the sub-graph of that node is a bipartite or not</p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/dc3/is__graph__bipartite2_8cpp_source.html#l00076">76</a> of file <a class="el" href="../../dd/dc3/is__graph__bipartite2_8cpp_source.html">is_graph_bipartite2.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   76</span>                                                             {</div>
-<div class="line"><span class="lineno">   77</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> visited(</div>
-<div class="line"><span class="lineno">   78</span>        <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.size());  <span class="comment">///&lt; stores boolean values</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">   79</span><span class="comment">                        /// which signify whether that node had been visited or</span></div>
-<div class="line"><span class="lineno">   80</span><span class="comment">                        /// not</span></div>
-<div class="line"><span class="lineno">   81</span><span class="comment"></span> </div>
+<div class="line"><span class="lineno">   77</span>    std::vector&lt;int64_t&gt; visited(</div>
+<div class="line"><span class="lineno">   78</span>        <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.size());  </div>
+<div class="line"><span class="lineno">   81</span> </div>
 <div class="line"><span class="lineno">   82</span>    <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; <a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.size(); i++) {</div>
-<div class="line"><span class="lineno">   83</span>        <span class="keywordflow">if</span> (!visited[i])  <span class="comment">/// if the current node is not visited then check</span><span class="comment"></span></div>
-<div class="line"><span class="lineno">   84</span><span class="comment">                          /// whether the sub-graph of that node is a bipartite</span></div>
-<div class="line"><span class="lineno">   85</span><span class="comment">                          /// or not</span></div>
-<div class="line"><span class="lineno">   86</span><span class="comment"></span>        {</div>
+<div class="line"><span class="lineno">   83</span>        <span class="keywordflow">if</span> (!visited[i])  </div>
+<div class="line"><span class="lineno">   86</span>        {</div>
 <div class="line"><span class="lineno">   87</span>            <span class="keywordflow">if</span> (!<a class="code hl_function" href="#a8e1b547cd407c0774e63f0dc95cda9e7">checkBipartite</a>(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>, i, &amp;visited)) {</div>
 <div class="line"><span class="lineno">   88</span>                <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
 <div class="line"><span class="lineno">   89</span>            }</div>
@@ -726,13 +699,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   91</span>    }</div>
 <div class="line"><span class="lineno">   92</span>    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
 <div class="line"><span class="lineno">   93</span>}</div>
-<div class="ttc" id="anamespacegraph_html_a8e1b547cd407c0774e63f0dc95cda9e7"><div class="ttname"><a href="#a8e1b547cd407c0774e63f0dc95cda9e7">graph::checkBipartite</a></div><div class="ttdeci">bool checkBipartite(const std::vector&lt; std::vector&lt; int64_t &gt; &gt; &amp;graph, int64_t index, std::vector&lt; int64_t &gt; *visited)</div><div class="ttdoc">function to check whether the passed graph is bipartite or not</div><div class="ttdef"><b>Definition</b> is_graph_bipartite2.cpp:37</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dce/namespacegraph_a84b0551489c613a681cc83b34450da4b_cgraph.svg" width="323" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="anamespacegraph_html_a8e1b547cd407c0774e63f0dc95cda9e7"><div class="ttname"><a href="#a8e1b547cd407c0774e63f0dc95cda9e7">graph::checkBipartite</a></div><div class="ttdeci">bool checkBipartite(const std::vector&lt; std::vector&lt; int64_t &gt; &gt; &amp;graph, int64_t index, std::vector&lt; int64_t &gt; *visited)</div><div class="ttdoc">function to check whether the passed graph is bipartite or not</div><div class="ttdef"><b>Definition</b> <a href="../../dd/dc3/is__graph__bipartite2_8cpp_source.html#l00037">is_graph_bipartite2.cpp:37</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ab7706341d006e20d1ae58274187a3346" name="ab7706341d006e20d1ae58274187a3346"></a>
@@ -744,7 +712,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">int graph::TravellingSalesmanProblem </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint32_t &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>cities</em></span>, </td>
+          <td class="paramtype">std::vector&lt; std::vector&lt; uint32_t &gt; &gt; *</td>          <td class="paramname"><span class="paramname"><em>cities</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -768,48 +736,35 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
-<div class="fragment"><div class="line"><span class="lineno">   42</span>                                                       {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   43</span><span class="comment">    //// vtx stores the vertexs of the graph</span></div>
-<div class="line"><span class="lineno">   44</span><span class="comment"></span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a> vtx;</div>
+
+<p class="definition">Definition at line <a class="el" href="../../de/d88/travelling__salesman__problem_8cpp_source.html#l00041">41</a> of file <a class="el" href="../../de/d88/travelling__salesman__problem_8cpp_source.html">travelling_salesman_problem.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">   42</span>                                                       {</div>
+<div class="line"><span class="lineno">   44</span>    std::vector&lt;uint32_t&gt; vtx;</div>
 <div class="line"><span class="lineno">   45</span>    <span class="keywordflow">for</span> (uint32_t i = 0; i &lt; V; i++) {</div>
 <div class="line"><span class="lineno">   46</span>        <span class="keywordflow">if</span> (i != src) {</div>
-<div class="line"><span class="lineno">   47</span>            vtx.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(i);</div>
+<div class="line"><span class="lineno">   47</span>            vtx.push_back(i);</div>
 <div class="line"><span class="lineno">   48</span>        }</div>
 <div class="line"><span class="lineno">   49</span>    }</div>
-<div class="line"><span class="lineno">   50</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   51</span><span class="comment">    //// store minimum weight Hamiltonian Cycle.</span></div>
-<div class="line"><span class="lineno">   52</span><span class="comment"></span>    int32_t min_path = 2147483647;</div>
-<div class="line"><span class="lineno">   53</span>    <span class="keywordflow">do</span> {<span class="comment"></span></div>
-<div class="line"><span class="lineno">   54</span><span class="comment">        //// store current Path weight(cost)</span></div>
-<div class="line"><span class="lineno">   55</span><span class="comment"></span>        int32_t curr_weight = 0;</div>
-<div class="line"><span class="lineno">   56</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   57</span><span class="comment">        //// compute current path weight</span></div>
-<div class="line"><span class="lineno">   58</span><span class="comment"></span>        <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = src;</div>
+<div class="line"><span class="lineno">   50</span> </div>
+<div class="line"><span class="lineno">   52</span>    int32_t min_path = 2147483647;</div>
+<div class="line"><span class="lineno">   53</span>    <span class="keywordflow">do</span> {</div>
+<div class="line"><span class="lineno">   55</span>        int32_t curr_weight = 0;</div>
+<div class="line"><span class="lineno">   56</span> </div>
+<div class="line"><span class="lineno">   58</span>        <span class="keywordtype">int</span> <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = src;</div>
 <div class="line"><span class="lineno">   59</span>        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : vtx) {</div>
 <div class="line"><span class="lineno">   60</span>            curr_weight += (*cities)[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>][i];</div>
 <div class="line"><span class="lineno">   61</span>            <a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a> = i;</div>
 <div class="line"><span class="lineno">   62</span>        }</div>
 <div class="line"><span class="lineno">   63</span>        curr_weight += (*cities)[<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">k</a>][src];</div>
-<div class="line"><span class="lineno">   64</span><span class="comment"></span> </div>
-<div class="line"><span class="lineno">   65</span><span class="comment">        //// update minimum</span></div>
-<div class="line"><span class="lineno">   66</span><span class="comment"></span>        min_path = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(min_path, curr_weight);</div>
+<div class="line"><span class="lineno">   64</span> </div>
+<div class="line"><span class="lineno">   66</span>        min_path = std::min(min_path, curr_weight);</div>
 <div class="line"><span class="lineno">   67</span> </div>
-<div class="line"><span class="lineno">   68</span>    } <span class="keywordflow">while</span> (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/next_permutation.html">next_permutation</a>(vtx.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), vtx.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()));</div>
+<div class="line"><span class="lineno">   68</span>    } <span class="keywordflow">while</span> (next_permutation(vtx.begin(), vtx.end()));</div>
 <div class="line"><span class="lineno">   69</span> </div>
 <div class="line"><span class="lineno">   70</span>    <span class="keywordflow">return</span> min_path;</div>
 <div class="line"><span class="lineno">   71</span>}</div>
-<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
-<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> composite_simpson_rule.cpp:117</div></div>
-<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</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="anext_permutation_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/next_permutation.html">std::next_permutation</a></div><div class="ttdeci">T next_permutation(T... args)</div></div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-</div><!-- 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="../../df/dce/namespacegraph_ab7706341d006e20d1ae58274187a3346_cgraph.svg" width="388" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="acomposite__simpson__rule_8cpp_html_a1b74d828b33760094906797042b89442"><div class="ttname"><a href="../../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442">numerical_methods::simpson_method::k</a></div><div class="ttdeci">double k(double x)</div><div class="ttdoc">Another test function.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/d18/composite__simpson__rule_8cpp_source.html#l00117">composite_simpson_rule.cpp:117</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph.map b/df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph.map
deleted file mode 100644
index dc45524d9..000000000
--- a/df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="graph::addEdge" name="graph::addEdge">
-<area shape="rect" id="Node000001" title="Function that add edge between two nodes or vertices of graph." alt="" coords="5,5,118,31"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="166,5,273,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="118,16,150,16,150,21,118,21"/>
-</map>
diff --git a/df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph.md5 b/df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph.md5
deleted file mode 100644
index 25eb99583..000000000
--- a/df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-b00dad386c3ad344f61096db0dce38d4
\ No newline at end of file
diff --git a/df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph.svg b/df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph.svg
deleted file mode 100644
index 162382fba..000000000
--- a/df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::addEdge Pages: 1 -->
-<svg width="209pt" height="27pt"
- viewBox="0.00 0.00 208.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>graph::addEdge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that add edge between two nodes or vertices of graph.">
-<polygon fill="#999999" stroke="#666666" points="84.25,-19.25 0,-19.25 0,0 84.25,0 84.25,-19.25"/>
-<text text-anchor="middle" x="42.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.75,-19.25 120.25,-19.25 120.25,0 200.75,0 200.75,-19.25"/>
-<text text-anchor="middle" x="160.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.48,-9.62C92.21,-9.62 100.37,-9.62 108.35,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.32,-13.13 118.32,-9.63 108.32,-6.13 108.32,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph_org.svg b/df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph_org.svg
deleted file mode 100644
index e4ed3d22c..000000000
--- a/df/dce/namespacegraph_a0e30e0dca68cb6e4f671440819b35b6a_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::addEdge Pages: 1 -->
-<svg width="209pt" height="27pt"
- viewBox="0.00 0.00 208.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>graph::addEdge</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that add edge between two nodes or vertices of graph.">
-<polygon fill="#999999" stroke="#666666" points="84.25,-19.25 0,-19.25 0,0 84.25,0 84.25,-19.25"/>
-<text text-anchor="middle" x="42.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="200.75,-19.25 120.25,-19.25 120.25,0 200.75,0 200.75,-19.25"/>
-<text text-anchor="middle" x="160.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M84.48,-9.62C92.21,-9.62 100.37,-9.62 108.35,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="108.32,-13.13 118.32,-9.63 108.32,-6.13 108.32,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.map b/df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.map
deleted file mode 100644
index 7d11f2cad..000000000
--- a/df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.map
+++ /dev/null
@@ -1,4 +0,0 @@
-<map id="graph::explore" name="graph::explore">
-<area shape="rect" id="Node000001" title="Utility function for depth first seach algorithm this function explores the vertex which is passed in..." alt="" coords="5,29,109,55"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="38,30,35,21,37,11,45,5,57,3,70,5,77,12,73,16,68,10,57,8,47,10,42,14,40,20,43,28"/>
-</map>
diff --git a/df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.md5 b/df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.md5
deleted file mode 100644
index 103ee0270..000000000
--- a/df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-675573ab4b9e78c486c65bb5c30a6eff
\ No newline at end of file
diff --git a/df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.svg b/df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.svg
deleted file mode 100644
index 9cc32cd78..000000000
--- a/df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph.svg
+++ /dev/null
@@ -1,56 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::explore Pages: 1 -->
-<svg width="86pt" height="45pt"
- viewBox="0.00 0.00 85.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>graph::explore</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function for depth first seach algorithm this function explores the vertex which is passed in...">
-<polygon fill="#999999" stroke="#666666" points="77.5,-19.25 0,-19.25 0,0 77.5,0 77.5,-19.25"/>
-<text text-anchor="middle" x="38.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.62,-19.54C21.08,-28.15 25.13,-37.25 38.75,-37.25 46.2,-37.25 50.79,-34.53 52.51,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.01,-30.42 51.1,-21.04 49.08,-31.44 56.01,-30.42"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph_org.svg b/df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph_org.svg
deleted file mode 100644
index dd0b1510d..000000000
--- a/df/dce/namespacegraph_a3ae80bc4c6a79d041b4f3a6589eb7fb8_cgraph_org.svg
+++ /dev/null
@@ -1,30 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::explore Pages: 1 -->
-<svg width="86pt" height="45pt"
- viewBox="0.00 0.00 85.50 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>graph::explore</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Utility function for depth first seach algorithm this function explores the vertex which is passed in...">
-<polygon fill="#999999" stroke="#666666" points="77.5,-19.25 0,-19.25 0,0 77.5,0 77.5,-19.25"/>
-<text text-anchor="middle" x="38.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge1_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M26.62,-19.54C21.08,-28.15 25.13,-37.25 38.75,-37.25 46.2,-37.25 50.79,-34.53 52.51,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="56.01,-30.42 51.1,-21.04 49.08,-31.44 56.01,-30.42"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph.map b/df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph.map
deleted file mode 100644
index 8abdf92f2..000000000
--- a/df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph.map
+++ /dev/null
@@ -1,6 +0,0 @@
-<map id="graph::explore" name="graph::explore">
-<area shape="rect" id="Node000001" title="Explores the given vertex, exploring a vertex means traversing over all the vertices which are connec..." alt="" coords="5,29,109,55"/>
-<area shape="rect" id="Node000002" href="$df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" title="Utility function for depth first seach algorithm this function explores the vertex which is passed in..." alt="" coords="157,29,260,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="109,40,141,40,141,45,109,45"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="182,30,177,21,180,11,191,5,208,3,227,5,237,12,234,16,225,10,208,8,193,10,185,15,183,20,187,28"/>
-</map>
diff --git a/df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph.md5 b/df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph.md5
deleted file mode 100644
index 63db14bc1..000000000
--- a/df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-1ad0a04b415348c77d8158144d548b3a
\ No newline at end of file
diff --git a/df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph.svg b/df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph.svg
deleted file mode 100644
index 4e0cd2ac1..000000000
--- a/df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph.svg
+++ /dev/null
@@ -1,74 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::explore Pages: 1 -->
-<svg width="199pt" height="45pt"
- viewBox="0.00 0.00 199.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>graph::explore</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Explores the given vertex, exploring a vertex means traversing over all the vertices which are connec...">
-<polygon fill="#999999" stroke="#666666" points="77.5,-19.25 0,-19.25 0,0 77.5,0 77.5,-19.25"/>
-<text text-anchor="middle" x="38.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" target="_top" xlink:title="Utility function for depth first seach algorithm this function explores the vertex which is passed in...">
-<polygon fill="white" stroke="#666666" points="191,-19.25 113.5,-19.25 113.5,0 191,0 191,-19.25"/>
-<text text-anchor="middle" x="152.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.81,-9.62C85.61,-9.62 93.93,-9.62 102.07,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.85,-13.13 111.85,-9.63 101.85,-6.13 101.85,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.48,-19.54C126.38,-28.15 132.3,-37.25 152.25,-37.25 163.16,-37.25 169.88,-34.53 172.4,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.85,-30.06 170.34,-21.02 169,-31.53 175.85,-30.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph_org.svg b/df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph_org.svg
deleted file mode 100644
index a2588661a..000000000
--- a/df/dce/namespacegraph_a64c1db5aad7502c6f08e4652f6edd463_cgraph_org.svg
+++ /dev/null
@@ -1,48 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::explore Pages: 1 -->
-<svg width="199pt" height="45pt"
- viewBox="0.00 0.00 199.00 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
-<title>graph::explore</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Explores the given vertex, exploring a vertex means traversing over all the vertices which are connec...">
-<polygon fill="#999999" stroke="#666666" points="77.5,-19.25 0,-19.25 0,0 77.5,0 77.5,-19.25"/>
-<text text-anchor="middle" x="38.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" target="_top" xlink:title="Utility function for depth first seach algorithm this function explores the vertex which is passed in...">
-<polygon fill="white" stroke="#666666" points="191,-19.25 113.5,-19.25 113.5,0 191,0 191,-19.25"/>
-<text text-anchor="middle" x="152.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.81,-9.62C85.61,-9.62 93.93,-9.62 102.07,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.85,-13.13 111.85,-9.63 101.85,-6.13 101.85,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M134.48,-19.54C126.38,-28.15 132.3,-37.25 152.25,-37.25 163.16,-37.25 169.88,-34.53 172.4,-30.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="175.85,-30.06 170.34,-21.02 169,-31.53 175.85,-30.06"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph.map b/df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph.map
deleted file mode 100644
index 352c37d69..000000000
--- a/df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="graph::getConnectedComponents" name="graph::getConnectedComponents">
-<area shape="rect" id="Node000001" title="Function that perfoms depth first search algorithm on graph and calculated the number of connected co..." alt="" coords="5,55,222,80"/>
-<area shape="rect" id="Node000002" href="$df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" title="Utility function for depth first seach algorithm this function explores the vertex which is passed in..." alt="" coords="276,29,379,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="222,52,260,47,261,53,223,57"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="270,79,385,104"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="223,77,255,81,254,86,222,82"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="292,31,285,21,289,11,303,5,327,3,354,5,367,12,364,17,352,10,327,8,305,10,293,15,290,20,296,27"/>
-</map>
diff --git a/df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph.md5 b/df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph.md5
deleted file mode 100644
index ad53fb8b9..000000000
--- a/df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-e5519b4e4ad515e239ffd9c3919c33b2
\ No newline at end of file
diff --git a/df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph.svg b/df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph.svg
deleted file mode 100644
index 7af282aa5..000000000
--- a/df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph.svg
+++ /dev/null
@@ -1,92 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::getConnectedComponents Pages: 1 -->
-<svg width="293pt" height="82pt"
- viewBox="0.00 0.00 292.75 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>graph::getConnectedComponents</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that perfoms depth first search algorithm on graph and calculated the number of connected co...">
-<polygon fill="#999999" stroke="#666666" points="162.25,-37.25 0,-37.25 0,-18 162.25,-18 162.25,-37.25"/>
-<text text-anchor="middle" x="81.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::getConnectedComponents</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" target="_top" xlink:title="Utility function for depth first seach algorithm this function explores the vertex which is passed in...">
-<polygon fill="white" stroke="#666666" points="280.25,-56.25 202.75,-56.25 202.75,-37 280.25,-37 280.25,-56.25"/>
-<text text-anchor="middle" x="241.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.7,-37.29C172.48,-38.47 182.23,-39.63 191.36,-40.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.69,-44.17 201.04,-41.89 191.52,-37.22 190.69,-44.17"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="284.75,-19.25 198.25,-19.25 198.25,0 284.75,0 284.75,-19.25"/>
-<text text-anchor="middle" x="241.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.7,-18.47C170.82,-17.54 178.92,-16.62 186.66,-15.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.04,-19.22 196.58,-14.62 186.25,-12.27 187.04,-19.22"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.39,-56.54C204.94,-65.15 213.31,-74.25 241.5,-74.25 257.36,-74.25 266.94,-71.37 270.26,-67.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.62,-66.32 267.09,-57.97 266.98,-68.57 273.62,-66.32"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph_org.svg b/df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph_org.svg
deleted file mode 100644
index 8b6456650..000000000
--- a/df/dce/namespacegraph_a83ab16e96cec644109a58dfc9329bc2b_cgraph_org.svg
+++ /dev/null
@@ -1,66 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::getConnectedComponents Pages: 1 -->
-<svg width="293pt" height="82pt"
- viewBox="0.00 0.00 292.75 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>graph::getConnectedComponents</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function that perfoms depth first search algorithm on graph and calculated the number of connected co...">
-<polygon fill="#999999" stroke="#666666" points="162.25,-37.25 0,-37.25 0,-18 162.25,-18 162.25,-37.25"/>
-<text text-anchor="middle" x="81.12" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::getConnectedComponents</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" target="_top" xlink:title="Utility function for depth first seach algorithm this function explores the vertex which is passed in...">
-<polygon fill="white" stroke="#666666" points="280.25,-56.25 202.75,-56.25 202.75,-37 280.25,-37 280.25,-56.25"/>
-<text text-anchor="middle" x="241.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.7,-37.29C172.48,-38.47 182.23,-39.63 191.36,-40.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.69,-44.17 201.04,-41.89 191.52,-37.22 190.69,-44.17"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="284.75,-19.25 198.25,-19.25 198.25,0 284.75,0 284.75,-19.25"/>
-<text text-anchor="middle" x="241.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M162.7,-18.47C170.82,-17.54 178.92,-16.62 186.66,-15.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="187.04,-19.22 196.58,-14.62 186.25,-12.27 187.04,-19.22"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M216.39,-56.54C204.94,-65.15 213.31,-74.25 241.5,-74.25 257.36,-74.25 266.94,-71.37 270.26,-67.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="273.62,-66.32 267.09,-57.97 266.98,-68.57 273.62,-66.32"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/dce/namespacegraph_a84b0551489c613a681cc83b34450da4b_cgraph.map b/df/dce/namespacegraph_a84b0551489c613a681cc83b34450da4b_cgraph.map
deleted file mode 100644
index b1874eafb..000000000
--- a/df/dce/namespacegraph_a84b0551489c613a681cc83b34450da4b_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="graph::isBipartite" name="graph::isBipartite">
-<area shape="rect" id="Node000001" title="returns true if the given graph is bipartite else returns false" alt="" coords="5,5,125,31"/>
-<area shape="rect" id="Node000002" href="$df/dce/namespacegraph.html#a8e1b547cd407c0774e63f0dc95cda9e7" title="function to check whether the passed graph is bipartite or not" alt="" coords="173,5,317,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="125,16,157,16,157,21,125,21"/>
-</map>
diff --git a/df/dce/namespacegraph_a84b0551489c613a681cc83b34450da4b_cgraph.md5 b/df/dce/namespacegraph_a84b0551489c613a681cc83b34450da4b_cgraph.md5
deleted file mode 100644
index 4fe470281..000000000
--- a/df/dce/namespacegraph_a84b0551489c613a681cc83b34450da4b_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-950f9d0235ed52479cbfd22350523221
\ No newline at end of file
diff --git a/df/dce/namespacegraph_a84b0551489c613a681cc83b34450da4b_cgraph.svg b/df/dce/namespacegraph_a84b0551489c613a681cc83b34450da4b_cgraph.svg
deleted file mode 100644
index f525d6666..000000000
--- a/df/dce/namespacegraph_a84b0551489c613a681cc83b34450da4b_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::isBipartite Pages: 1 -->
-<svg width="242pt" height="27pt"
- viewBox="0.00 0.00 241.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>graph::isBipartite</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="returns true if the given graph is bipartite else returns false">
-<polygon fill="#999999" stroke="#666666" points="89.5,-19.25 0,-19.25 0,0 89.5,0 89.5,-19.25"/>
-<text text-anchor="middle" x="44.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::isBipartite</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dce/namespacegraph.html#a8e1b547cd407c0774e63f0dc95cda9e7" target="_top" xlink:title="function to check whether the passed graph is bipartite or not">
-<polygon fill="white" stroke="#666666" points="233.75,-19.25 125.5,-19.25 125.5,0 233.75,0 233.75,-19.25"/>
-<text text-anchor="middle" x="179.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::checkBipartite</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90,-9.62C97.69,-9.62 105.84,-9.62 113.95,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="113.83,-13.13 123.83,-9.63 113.83,-6.13 113.83,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/dce/namespacegraph_a84b0551489c613a681cc83b34450da4b_cgraph_org.svg b/df/dce/namespacegraph_a84b0551489c613a681cc83b34450da4b_cgraph_org.svg
deleted file mode 100644
index fb6ec7c86..000000000
--- a/df/dce/namespacegraph_a84b0551489c613a681cc83b34450da4b_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::isBipartite Pages: 1 -->
-<svg width="242pt" height="27pt"
- viewBox="0.00 0.00 241.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>graph::isBipartite</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="returns true if the given graph is bipartite else returns false">
-<polygon fill="#999999" stroke="#666666" points="89.5,-19.25 0,-19.25 0,0 89.5,0 89.5,-19.25"/>
-<text text-anchor="middle" x="44.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::isBipartite</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dce/namespacegraph.html#a8e1b547cd407c0774e63f0dc95cda9e7" target="_top" xlink:title="function to check whether the passed graph is bipartite or not">
-<polygon fill="white" stroke="#666666" points="233.75,-19.25 125.5,-19.25 125.5,0 233.75,0 233.75,-19.25"/>
-<text text-anchor="middle" x="179.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::checkBipartite</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M90,-9.62C97.69,-9.62 105.84,-9.62 113.95,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="113.83,-13.13 123.83,-9.63 113.83,-6.13 113.83,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph.map b/df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph.map
deleted file mode 100644
index cf5c7ab49..000000000
--- a/df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="graph::depth_first_search" name="graph::depth_first_search">
-<area shape="rect" id="Node000001" title="initiates depth first search algorithm." alt="" coords="5,47,128,88"/>
-<area shape="rect" id="Node000002" href="$df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" title="Utility function for depth first seach algorithm this function explores the vertex which is passed in..." alt="" coords="182,29,285,55"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="128,56,166,50,167,55,128,61"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="176,79,291,104"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="128,74,161,78,160,84,128,79"/>
-<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="205,30,199,21,203,11,214,5,233,3,254,5,264,12,262,16,252,10,233,8,216,10,207,15,205,20,210,28"/>
-</map>
diff --git a/df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph.md5 b/df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph.md5
deleted file mode 100644
index 44a7b0130..000000000
--- a/df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-77aa3edb5da1f45515c4d9e8c6f53406
\ No newline at end of file
diff --git a/df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph.svg b/df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph.svg
deleted file mode 100644
index 8bbd12120..000000000
--- a/df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::depth_first_search Pages: 1 -->
-<svg width="222pt" height="82pt"
- viewBox="0.00 0.00 222.25 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>graph::depth_first_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="initiates depth first search algorithm.">
-<polygon fill="#999999" stroke="#666666" points="91.75,-42.88 0,-42.88 0,-12.37 91.75,-12.37 91.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::depth_first</text>
-<text text-anchor="middle" x="45.88" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" target="_top" xlink:title="Utility function for depth first seach algorithm this function explores the vertex which is passed in...">
-<polygon fill="white" stroke="#666666" points="209.75,-56.25 132.25,-56.25 132.25,-37 209.75,-37 209.75,-56.25"/>
-<text text-anchor="middle" x="171" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.02,-34.59C101.39,-36.04 111.31,-37.57 120.81,-39.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.23,-42.49 130.64,-40.55 121.29,-35.57 120.23,-42.49"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.25,-19.25 127.75,-19.25 127.75,0 214.25,0 214.25,-19.25"/>
-<text text-anchor="middle" x="171" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.02,-21.02C99.86,-19.88 108.08,-18.68 116.12,-17.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="116.43,-20.99 125.82,-16.08 115.42,-14.07 116.43,-20.99"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.41,-56.54C142.48,-65.15 149.01,-74.25 171,-74.25 183.03,-74.25 190.43,-71.53 193.21,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.64,-66.94 190.94,-58.01 189.82,-68.55 196.64,-66.94"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph_org.svg b/df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph_org.svg
deleted file mode 100644
index dc881c9e0..000000000
--- a/df/dce/namespacegraph_ab5428a3519267a28bba4b4310cfbb6ae_cgraph_org.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::depth_first_search Pages: 1 -->
-<svg width="222pt" height="82pt"
- viewBox="0.00 0.00 222.25 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
-<title>graph::depth_first_search</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="initiates depth first search algorithm.">
-<polygon fill="#999999" stroke="#666666" points="91.75,-42.88 0,-42.88 0,-12.37 91.75,-12.37 91.75,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::depth_first</text>
-<text text-anchor="middle" x="45.88" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_search</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" target="_top" xlink:title="Utility function for depth first seach algorithm this function explores the vertex which is passed in...">
-<polygon fill="white" stroke="#666666" points="209.75,-56.25 132.25,-56.25 132.25,-37 209.75,-37 209.75,-56.25"/>
-<text text-anchor="middle" x="171" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.02,-34.59C101.39,-36.04 111.31,-37.57 120.81,-39.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.23,-42.49 130.64,-40.55 121.29,-35.57 120.23,-42.49"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="214.25,-19.25 127.75,-19.25 127.75,0 214.25,0 214.25,-19.25"/>
-<text text-anchor="middle" x="171" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M92.02,-21.02C99.86,-19.88 108.08,-18.68 116.12,-17.5"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="116.43,-20.99 125.82,-16.08 115.42,-14.07 116.43,-20.99"/>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node2 -->
-<g id="edge2_Node000002_Node000002" class="edge">
-<title>Node2&#45;&gt;Node2</title>
-<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M151.41,-56.54C142.48,-65.15 149.01,-74.25 171,-74.25 183.03,-74.25 190.43,-71.53 193.21,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="196.64,-66.94 190.94,-58.01 189.82,-68.55 196.64,-66.94"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/dce/namespacegraph_ab7706341d006e20d1ae58274187a3346_cgraph.map b/df/dce/namespacegraph_ab7706341d006e20d1ae58274187a3346_cgraph.map
deleted file mode 100644
index 3727b041b..000000000
--- a/df/dce/namespacegraph_ab7706341d006e20d1ae58274187a3346_cgraph.map
+++ /dev/null
@@ -1,11 +0,0 @@
-<map id="graph::TravellingSalesmanProblem" name="graph::TravellingSalesmanProblem">
-<area shape="rect" id="Node000001" title="Function calculates the minimum path distance that will cover all the cities starting from the source..." alt="" coords="5,72,181,113"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/begin.html#" title=" " alt="" coords="245,5,367,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="147,69,228,40,245,34,247,39,230,45,149,74"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/end.html#" title=" " alt="" coords="250,55,362,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="181,80,234,73,234,79,181,85"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="272,104,340,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="181,100,257,109,257,114,181,105"/>
-<area shape="rect" id="Node000005" 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="229,153,383,179"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="151,111,230,140,247,145,245,151,228,145,149,116"/>
-</map>
diff --git a/df/dce/namespacegraph_ab7706341d006e20d1ae58274187a3346_cgraph.md5 b/df/dce/namespacegraph_ab7706341d006e20d1ae58274187a3346_cgraph.md5
deleted file mode 100644
index 62124bb38..000000000
--- a/df/dce/namespacegraph_ab7706341d006e20d1ae58274187a3346_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-cb47a93220ea9c21e39f3c1848af5dbf
\ No newline at end of file
diff --git a/df/dce/namespacegraph_ab7706341d006e20d1ae58274187a3346_cgraph.svg b/df/dce/namespacegraph_ab7706341d006e20d1ae58274187a3346_cgraph.svg
deleted file mode 100644
index 3b39f3033..000000000
--- a/df/dce/namespacegraph_ab7706341d006e20d1ae58274187a3346_cgraph.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::TravellingSalesmanProblem Pages: 1 -->
-<svg width="291pt" height="138pt"
- viewBox="0.00 0.00 291.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>graph::TravellingSalesmanProblem</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function calculates the minimum path distance that will cover all the cities starting from the source...">
-<polygon fill="#999999" stroke="#666666" points="131.5,-79.88 0,-79.88 0,-49.38 131.5,-49.38 131.5,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::TravellingSalesman</text>
-<text text-anchor="middle" x="65.75" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">Problem</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.25,-130.25 179.5,-130.25 179.5,-111 271.25,-111 271.25,-130.25"/>
-<text text-anchor="middle" x="225.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.77,-80.29C125.18,-87.35 147.36,-95.65 167.5,-102.62 171.73,-104.09 176.15,-105.57 180.58,-107.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.46,-110.34 190.05,-110.09 181.61,-103.68 179.46,-110.34"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.5,-93.25 183.25,-93.25 183.25,-74 267.5,-74 267.5,-93.25"/>
-<text text-anchor="middle" x="225.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.77,-72.46C145.02,-74.06 158.8,-75.72 171.56,-77.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.09,-80.73 181.44,-78.45 171.93,-73.78 171.09,-80.73"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251,-56.25 199.75,-56.25 199.75,-37 251,-37 251,-56.25"/>
-<text text-anchor="middle" x="225.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.77,-57.2C151.2,-54.98 171.79,-52.63 188.6,-50.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.54,-54.24 198.08,-49.63 187.74,-47.29 188.54,-54.24"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.25,-19.25 167.5,-19.25 167.5,0 283.25,0 283.25,-19.25"/>
-<text text-anchor="middle" x="225.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.26,-48.9C126.39,-42.16 147.93,-34.31 167.5,-27.62 171.73,-26.18 176.16,-24.71 180.59,-23.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.62,-26.61 190.07,-20.21 179.48,-19.94 181.62,-26.61"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/dce/namespacegraph_ab7706341d006e20d1ae58274187a3346_cgraph_org.svg b/df/dce/namespacegraph_ab7706341d006e20d1ae58274187a3346_cgraph_org.svg
deleted file mode 100644
index df04df8f6..000000000
--- a/df/dce/namespacegraph_ab7706341d006e20d1ae58274187a3346_cgraph_org.svg
+++ /dev/null
@@ -1,94 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::TravellingSalesmanProblem Pages: 1 -->
-<svg width="291pt" height="138pt"
- viewBox="0.00 0.00 291.25 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
-<title>graph::TravellingSalesmanProblem</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function calculates the minimum path distance that will cover all the cities starting from the source...">
-<polygon fill="#999999" stroke="#666666" points="131.5,-79.88 0,-79.88 0,-49.38 131.5,-49.38 131.5,-79.88"/>
-<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">graph::TravellingSalesman</text>
-<text text-anchor="middle" x="65.75" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">Problem</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/begin.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="271.25,-130.25 179.5,-130.25 179.5,-111 271.25,-111 271.25,-130.25"/>
-<text text-anchor="middle" x="225.38" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::begin</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M106.77,-80.29C125.18,-87.35 147.36,-95.65 167.5,-102.62 171.73,-104.09 176.15,-105.57 180.58,-107.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="179.46,-110.34 190.05,-110.09 181.61,-103.68 179.46,-110.34"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/end.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="267.5,-93.25 183.25,-93.25 183.25,-74 267.5,-74 267.5,-93.25"/>
-<text text-anchor="middle" x="225.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::end</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.77,-72.46C145.02,-74.06 158.8,-75.72 171.56,-77.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.09,-80.73 181.44,-78.45 171.93,-73.78 171.09,-80.73"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="251,-56.25 199.75,-56.25 199.75,-37 251,-37 251,-56.25"/>
-<text text-anchor="middle" x="225.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M131.77,-57.2C151.2,-54.98 171.79,-52.63 188.6,-50.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="188.54,-54.24 198.08,-49.63 187.74,-47.29 188.54,-54.24"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="283.25,-19.25 167.5,-19.25 167.5,0 283.25,0 283.25,-19.25"/>
-<text text-anchor="middle" x="225.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M108.26,-48.9C126.39,-42.16 147.93,-34.31 167.5,-27.62 171.73,-26.18 176.16,-24.71 180.59,-23.26"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="181.62,-26.61 190.07,-20.21 179.48,-19.94 181.62,-26.61"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/dce/namespacegraph_adc68cbc8ba09eb1142265935c0d45b84_cgraph.map b/df/dce/namespacegraph_adc68cbc8ba09eb1142265935c0d45b84_cgraph.map
deleted file mode 100644
index c91811a44..000000000
--- a/df/dce/namespacegraph_adc68cbc8ba09eb1142265935c0d45b84_cgraph.map
+++ /dev/null
@@ -1,15 +0,0 @@
-<map id="graph::dijkstra" name="graph::dijkstra">
-<area shape="rect" id="Node000001" title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return..." alt="" coords="5,149,109,174"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/empty.html#" title=" " alt="" coords="171,5,300,46"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="66,147,102,103,127,78,155,56,162,51,164,56,158,60,131,82,106,107,70,150"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/pair/make_pair.html#" title=" " alt="" coords="182,70,289,96"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="78,146,156,105,170,99,172,104,158,109,81,151"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/pop.html#" title=" " alt="" coords="157,120,314,145"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="109,151,141,145,142,150,110,156"/>
-<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/push.html#" title=" " alt="" coords="171,169,300,210"/>
-<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="110,167,156,175,155,180,109,172"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="178,234,293,260"/>
-<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="79,173,115,196,158,219,174,226,172,231,156,224,112,201,76,177"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/priority_queue/top.html#" title=" " alt="" coords="158,284,312,309"/>
-<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="69,173,104,221,129,247,158,270,166,274,163,279,155,275,126,251,100,224,64,177"/>
-</map>
diff --git a/df/dce/namespacegraph_adc68cbc8ba09eb1142265935c0d45b84_cgraph.md5 b/df/dce/namespacegraph_adc68cbc8ba09eb1142265935c0d45b84_cgraph.md5
deleted file mode 100644
index f5218f006..000000000
--- a/df/dce/namespacegraph_adc68cbc8ba09eb1142265935c0d45b84_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-855e56c99675b63f73abd12c0a226174
\ No newline at end of file
diff --git a/df/dce/namespacegraph_adc68cbc8ba09eb1142265935c0d45b84_cgraph.svg b/df/dce/namespacegraph_adc68cbc8ba09eb1142265935c0d45b84_cgraph.svg
deleted file mode 100644
index 93a51037c..000000000
--- a/df/dce/namespacegraph_adc68cbc8ba09eb1142265935c0d45b84_cgraph.svg
+++ /dev/null
@@ -1,157 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::dijkstra Pages: 1 -->
-<svg width="240pt" height="236pt"
- viewBox="0.00 0.00 239.50 235.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 231.88)">
-<title>graph::dijkstra</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...">
-<polygon fill="#999999" stroke="#666666" points="77.5,-120.25 0,-120.25 0,-101 77.5,-101 77.5,-120.25"/>
-<text text-anchor="middle" x="38.75" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::dijkstra</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.62,-227.88 124.38,-227.88 124.38,-197.38 220.62,-197.38 220.62,-227.88"/>
-<text text-anchor="start" x="132.38" y="-214.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
-<text text-anchor="middle" x="172.5" y="-203.12" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M46.87,-120.52C58.95,-136.7 84.95,-168.97 113.5,-188.62 115.04,-189.69 116.64,-190.71 118.28,-191.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="116.21,-194.57 126.66,-196.29 119.57,-188.42 116.21,-194.57"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="212.75,-179.25 132.25,-179.25 132.25,-160 212.75,-160 212.75,-179.25"/>
-<text text-anchor="middle" x="172.5" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.67,-120.74C70.28,-129.72 92.76,-142.75 113.5,-151.62 116.89,-153.08 120.44,-154.47 124.04,-155.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.86,-159.08 133.45,-159.03 125.14,-152.46 122.86,-159.08"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.5,-142.25 113.5,-142.25 113.5,-123 231.5,-123 231.5,-142.25"/>
-<text text-anchor="middle" x="172.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.86,-116.99C85.49,-118.26 93.72,-119.64 102.03,-121.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.44,-124.47 111.88,-122.67 102.59,-117.57 101.44,-124.47"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.62,-104.88 124.38,-104.88 124.38,-74.38 220.62,-74.38 220.62,-104.88"/>
-<text text-anchor="start" x="132.38" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
-<text text-anchor="middle" x="172.5" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.86,-104.55C88.8,-102.81 100.99,-100.86 112.87,-98.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="113.29,-102.45 122.61,-97.42 112.19,-95.54 113.29,-102.45"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.75,-56.25 129.25,-56.25 129.25,-37 215.75,-37 215.75,-56.25"/>
-<text text-anchor="middle" x="172.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.89,-100.63C68.35,-90.74 91.71,-75.68 113.5,-65.62 117.45,-63.8 121.62,-62.08 125.84,-60.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.69,-63.88 134.92,-57.21 124.32,-57.29 126.69,-63.88"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="230.38,-19.25 114.62,-19.25 114.62,0 230.38,0 230.38,-19.25"/>
-<text text-anchor="middle" x="172.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::top</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.97,-100.6C57.27,-83.2 82.88,-47.37 113.5,-27.62 115.33,-26.45 117.24,-25.34 119.2,-24.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.36,-27.63 128.02,-20.3 117.46,-21.25 120.36,-27.63"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/dce/namespacegraph_adc68cbc8ba09eb1142265935c0d45b84_cgraph_org.svg b/df/dce/namespacegraph_adc68cbc8ba09eb1142265935c0d45b84_cgraph_org.svg
deleted file mode 100644
index c17311476..000000000
--- a/df/dce/namespacegraph_adc68cbc8ba09eb1142265935c0d45b84_cgraph_org.svg
+++ /dev/null
@@ -1,131 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: graph::dijkstra Pages: 1 -->
-<svg width="240pt" height="236pt"
- viewBox="0.00 0.00 239.50 235.88" 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 231.88)">
-<title>graph::dijkstra</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Function runs the dijkstra algorithm for some source vertex and target vertex in the graph and return...">
-<polygon fill="#999999" stroke="#666666" points="77.5,-120.25 0,-120.25 0,-101 77.5,-101 77.5,-120.25"/>
-<text text-anchor="middle" x="38.75" y="-106.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::dijkstra</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/empty.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.62,-227.88 124.38,-227.88 124.38,-197.38 220.62,-197.38 220.62,-227.88"/>
-<text text-anchor="start" x="132.38" y="-214.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
-<text text-anchor="middle" x="172.5" y="-203.12" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M46.87,-120.52C58.95,-136.7 84.95,-168.97 113.5,-188.62 115.04,-189.69 116.64,-190.71 118.28,-191.71"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="116.21,-194.57 126.66,-196.29 119.57,-188.42 116.21,-194.57"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="212.75,-179.25 132.25,-179.25 132.25,-160 212.75,-160 212.75,-179.25"/>
-<text text-anchor="middle" x="172.5" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::make_pair</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M55.67,-120.74C70.28,-129.72 92.76,-142.75 113.5,-151.62 116.89,-153.08 120.44,-154.47 124.04,-155.79"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="122.86,-159.08 133.45,-159.03 125.14,-152.46 122.86,-159.08"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/pop.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="231.5,-142.25 113.5,-142.25 113.5,-123 231.5,-123 231.5,-142.25"/>
-<text text-anchor="middle" x="172.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::pop</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.86,-116.99C85.49,-118.26 93.72,-119.64 102.03,-121.03"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="101.44,-124.47 111.88,-122.67 102.59,-117.57 101.44,-124.47"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/push.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="220.62,-104.88 124.38,-104.88 124.38,-74.38 220.62,-74.38 220.62,-104.88"/>
-<text text-anchor="start" x="132.38" y="-91.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue</text>
-<text text-anchor="middle" x="172.5" y="-80.12" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge4_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M77.86,-104.55C88.8,-102.81 100.99,-100.86 112.87,-98.97"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="113.29,-102.45 122.61,-97.42 112.19,-95.54 113.29,-102.45"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="215.75,-56.25 129.25,-56.25 129.25,-37 215.75,-37 215.75,-56.25"/>
-<text text-anchor="middle" x="172.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node6 -->
-<g id="edge5_Node000001_Node000006" class="edge">
-<title>Node1&#45;&gt;Node6</title>
-<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M53.89,-100.63C68.35,-90.74 91.71,-75.68 113.5,-65.62 117.45,-63.8 121.62,-62.08 125.84,-60.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="126.69,-63.88 134.92,-57.21 124.32,-57.29 126.69,-63.88"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/priority_queue/top.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="230.38,-19.25 114.62,-19.25 114.62,0 230.38,0 230.38,-19.25"/>
-<text text-anchor="middle" x="172.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::priority_queue::top</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge6_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M45.97,-100.6C57.27,-83.2 82.88,-47.37 113.5,-27.62 115.33,-26.45 117.24,-25.34 119.2,-24.31"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="120.36,-27.63 128.02,-20.3 117.46,-21.25 120.36,-27.63"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/dd0/queue__using__two__stacks_8cpp.html b/df/dd0/queue__using__two__stacks_8cpp.html
index 7d3429b33..431d8d46f 100644
--- a/df/dd0/queue__using__two__stacks_8cpp.html
+++ b/df/dd0/queue__using__two__stacks_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/queue_using_two_stacks.cpp File Reference</title>
+<title>TheAlgorithms/C++: data_structures/queue_using_two_stacks.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -117,7 +134,9 @@ Include dependency graph for queue_using_two_stacks.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d3c/queue__using__two__stacks_8cpp__incl.svg" width="248" height="126"><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">
+</div>
+<p><a href="../../df/dd0/queue__using__two__stacks_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a831ded10ecad88c14a8e22b96f4c1863" id="r_a831ded10ecad88c14a8e22b96f4c1863"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a831ded10ecad88c14a8e22b96f4c1863">queue_test</a> ()</td></tr>
@@ -128,6 +147,8 @@ Functions</h2></td></tr>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/shoniavika" target="_blank">shoniavika</a></dd></dl>
 <p>Implementation of a <a class="el" href="../../dc/db5/struct_queue.html">Queue</a> using two Stacks. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../df/dd0/queue__using__two__stacks_8cpp_source.html">queue_using_two_stacks.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -144,17 +165,14 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function, calls testing function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/dd0/queue__using__two__stacks_8cpp_source.html#l00141">141</a> of file <a class="el" href="../../df/dd0/queue__using__two__stacks_8cpp_source.html">queue_using_two_stacks.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  141</span>           {</div>
 <div class="line"><span class="lineno">  142</span>    <a class="code hl_function" href="#a831ded10ecad88c14a8e22b96f4c1863">queue_test</a>();</div>
 <div class="line"><span class="lineno">  143</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  144</span>}</div>
-<div class="ttc" id="aqueue__using__two__stacks_8cpp_html_a831ded10ecad88c14a8e22b96f4c1863"><div class="ttname"><a href="#a831ded10ecad88c14a8e22b96f4c1863">queue_test</a></div><div class="ttdeci">void queue_test()</div><div class="ttdef"><b>Definition</b> queue_using_two_stacks.cpp:101</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dd0/queue__using__two__stacks_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="194" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aqueue__using__two__stacks_8cpp_html_a831ded10ecad88c14a8e22b96f4c1863"><div class="ttname"><a href="#a831ded10ecad88c14a8e22b96f4c1863">queue_test</a></div><div class="ttdeci">void queue_test()</div><div class="ttdef"><b>Definition</b> <a href="../../df/dd0/queue__using__two__stacks_8cpp_source.html#l00101">queue_using_two_stacks.cpp:101</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a831ded10ecad88c14a8e22b96f4c1863" name="a831ded10ecad88c14a8e22b96f4c1863"></a>
@@ -172,9 +190,11 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Testing function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/dd0/queue__using__two__stacks_8cpp_source.html#l00101">101</a> of file <a class="el" href="../../df/dd0/queue__using__two__stacks_8cpp_source.html">queue_using_two_stacks.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">  101</span>                  {</div>
 <div class="line"><span class="lineno">  102</span>    MyQueue&lt;int&gt; que;</div>
-<div class="line"><span class="lineno">  103</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test #1\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  103</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test #1\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  104</span>    que.push(2);</div>
 <div class="line"><span class="lineno">  105</span>    que.push(5);</div>
 <div class="line"><span class="lineno">  106</span>    que.push(0);</div>
@@ -185,17 +205,17 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  111</span>    assert(que.peek() == 0);</div>
 <div class="line"><span class="lineno">  112</span>    assert(que.pop() == 0);</div>
 <div class="line"><span class="lineno">  113</span>    assert(que.empty() == <span class="keyword">true</span>);</div>
-<div class="line"><span class="lineno">  114</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;PASSED\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;PASSED\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  115</span> </div>
-<div class="line"><span class="lineno">  116</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test #2\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  116</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test #2\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  117</span>    que.push(-1);</div>
 <div class="line"><span class="lineno">  118</span>    assert(que.empty() == <span class="keyword">false</span>);</div>
 <div class="line"><span class="lineno">  119</span>    assert(que.peek() == -1);</div>
 <div class="line"><span class="lineno">  120</span>    assert(que.pop() == -1);</div>
-<div class="line"><span class="lineno">  121</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;PASSED\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  121</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;PASSED\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  122</span> </div>
 <div class="line"><span class="lineno">  123</span>    MyQueue&lt;double&gt; que2;</div>
-<div class="line"><span class="lineno">  124</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test #3\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  124</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test #3\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  125</span>    que2.push(2.31223);</div>
 <div class="line"><span class="lineno">  126</span>    que2.push(3.1415926);</div>
 <div class="line"><span class="lineno">  127</span>    que2.push(2.92);</div>
@@ -206,9 +226,8 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  132</span>    assert(que2.pop() == 3.1415926);</div>
 <div class="line"><span class="lineno">  133</span>    assert(que2.peek() == 2.92);</div>
 <div class="line"><span class="lineno">  134</span>    assert(que2.pop() == 2.92);</div>
-<div class="line"><span class="lineno">  135</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;PASSED\n&quot;</span>;</div>
+<div class="line"><span class="lineno">  135</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;PASSED\n&quot;</span>;</div>
 <div class="line"><span class="lineno">  136</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><!-- fragment -->
 </div>
 </div>
diff --git a/df/dd0/queue__using__two__stacks_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/dd0/queue__using__two__stacks_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 51cc03152..000000000
--- a/df/dd0/queue__using__two__stacks_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863" title=" " alt="" coords="103,5,188,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-</map>
diff --git a/df/dd0/queue__using__two__stacks_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/dd0/queue__using__two__stacks_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 53113211d..000000000
--- a/df/dd0/queue__using__two__stacks_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-32e32581d5ee380ba5616c3611fc7546
\ No newline at end of file
diff --git a/df/dd0/queue__using__two__stacks_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/dd0/queue__using__two__stacks_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 11234a5bf..000000000
--- a/df/dd0/queue__using__two__stacks_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="145pt" height="27pt"
- viewBox="0.00 0.00 145.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="137,-19.25 73,-19.25 73,0 137,0 137,-19.25"/>
-<text text-anchor="middle" x="105" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue_test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.42,-9.62C44.48,-9.62 52.92,-9.62 61.37,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.28,-13.13 71.28,-9.63 61.28,-6.13 61.28,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/dd0/queue__using__two__stacks_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/dd0/queue__using__two__stacks_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 3a7b85f8a..000000000
--- a/df/dd0/queue__using__two__stacks_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="145pt" height="27pt"
- viewBox="0.00 0.00 145.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="137,-19.25 73,-19.25 73,0 137,0 137,-19.25"/>
-<text text-anchor="middle" x="105" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">queue_test</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.42,-9.62C44.48,-9.62 52.92,-9.62 61.37,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.28,-13.13 71.28,-9.63 61.28,-6.13 61.28,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/dd0/queue__using__two__stacks_8cpp_source.html b/df/dd0/queue__using__two__stacks_8cpp_source.html
new file mode 100644
index 000000000..c3a578675
--- /dev/null
+++ b/df/dd0/queue__using__two__stacks_8cpp_source.html
@@ -0,0 +1,242 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: data_structures/queue_using_two_stacks.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/dd0/queue__using__two__stacks_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">queue_using_two_stacks.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../df/dd0/queue__using__two__stacks_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="preprocessor">#include &lt;stack&gt;</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="keyword">namespace </span>{</div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="keyword">class </span>MyQueue {</div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> <span class="keyword">private</span>:</div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span>    std::stack&lt;T&gt; s1, s2;</div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span> </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> <span class="keyword">public</span>:</div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    MyQueue() = <span class="keywordflow">default</span>;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>    <span class="keywordtype">void</span> push(T x);</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span>    <span class="keyword">const</span> T&amp; pop();</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="keyword">const</span> T&amp; peek() <span class="keyword">const</span>;</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span> </div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    <span class="keywordtype">bool</span> empty() <span class="keyword">const</span>;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>};</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span> </div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span><span class="keywordtype">void</span> MyQueue&lt;T&gt;::push(T x) {</div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span>    <span class="keywordflow">while</span> (!s2.empty()) {</div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span>        s1.push(s2.top());</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>        s2.pop();</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    }</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>    s2.push(x);</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    <span class="keywordflow">while</span> (!s1.empty()) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>        s2.push(s1.top());</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>        s1.pop();</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    }</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>}</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span> </div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span><span class="keyword">const</span> T&amp; MyQueue&lt;T&gt;::pop() {</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    <span class="keyword">const</span> T&amp; temp = MyQueue::peek();</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span>    s2.pop();</div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="keywordflow">return</span> temp;</div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>}</div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span> </div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span><span class="keyword">const</span> T&amp; MyQueue&lt;T&gt;::peek()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">if</span> (!empty()) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordflow">return</span> s2.top();</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    }</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::cerr &lt;&lt; <span class="stringliteral">&quot;Queue is empty&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    exit(0);</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>}</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span> </div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span><span class="keywordtype">bool</span> MyQueue&lt;T&gt;::empty()<span class="keyword"> const </span>{</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="keywordflow">return</span> s2.empty() &amp;&amp; s1.empty();</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>}</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>}  <span class="comment">// namespace</span></div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span> </div>
+<div class="foldopen" id="foldopen00101" data-start="{" data-end="}">
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"><a class="line" href="../../df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863">  101</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863">queue_test</a>() {</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    MyQueue&lt;int&gt; que;</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test #1\n&quot;</span>;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    que.push(2);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    que.push(5);</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span>    que.push(0);</div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    assert(que.peek() == 2);</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    assert(que.pop() == 2);</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    assert(que.peek() == 5);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    assert(que.pop() == 5);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    assert(que.peek() == 0);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    assert(que.pop() == 0);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    assert(que.empty() == <span class="keyword">true</span>);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;PASSED\n&quot;</span>;</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test #2\n&quot;</span>;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    que.push(-1);</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    assert(que.empty() == <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    assert(que.peek() == -1);</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    assert(que.pop() == -1);</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;PASSED\n&quot;</span>;</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span> </div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    MyQueue&lt;double&gt; que2;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test #3\n&quot;</span>;</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span>    que2.push(2.31223);</div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span>    que2.push(3.1415926);</div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span>    que2.push(2.92);</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span> </div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    assert(que2.peek() == 2.31223);</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    assert(que2.pop() == 2.31223);</div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    assert(que2.peek() == 3.1415926);</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    assert(que2.pop() == 3.1415926);</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    assert(que2.peek() == 2.92);</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    assert(que2.pop() == 2.92);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;PASSED\n&quot;</span>;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>}</div>
+</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span> </div>
+<div class="foldopen" id="foldopen00141" data-start="{" data-end="}">
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"><a class="line" href="../../df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  141</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>    <a class="code hl_function" href="../../df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863">queue_test</a>();</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span>}</div>
+</div>
+<div class="ttc" id="aqueue__using__two__stacks_8cpp_html_a831ded10ecad88c14a8e22b96f4c1863"><div class="ttname"><a href="../../df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863">queue_test</a></div><div class="ttdeci">void queue_test()</div><div class="ttdef"><b>Definition</b> <a href="#l00101">queue_using_two_stacks.cpp:101</a></div></div>
+<div class="ttc" id="aqueue__using__two__stacks_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00141">queue_using_two_stacks.cpp:141</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../df/dd0/queue__using__two__stacks_8cpp.html">queue_using_two_stacks.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/dd5/binary__search_8cpp_source.html b/df/dd5/binary__search_8cpp_source.html
new file mode 100644
index 000000000..5401778a0
--- /dev/null
+++ b/df/dd5/binary__search_8cpp_source.html
@@ -0,0 +1,294 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: search/binary_search.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/dd5/binary__search_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">binary_search.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/******************************************************************************</span></div>
+<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment"> * @file</span></div>
+<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * @brief [Binary search</span></div>
+<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * algorithm](https://en.wikipedia.org/wiki/Binary_search_algorithm)</span></div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * @details</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> * Binary search is a search algorithm that finds the position of a target value</span></div>
+<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> * within a sorted array.Just like looking for a word in a dictionary, in binary search we compare the target value to the middle</span></div>
+<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> * element of the array. If they are not equal, then the half in which the target</span></div>
+<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> * cannot lie is eliminated and the search continues on the remaining half,</span></div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment"> * again taking the middle element to compare to the target value, and repeating</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment"> * this until the target value is found. If the search ends with the remaining</span></div>
+<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment"> * half being empty, the target is not in the array.</span></div>
+<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment"> * ### Implementation</span></div>
+<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment"> * Binary search works on sorted arrays. It begins by comparing an</span></div>
+<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment"> * element in the middle of the array with the target value. If the target value</span></div>
+<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment"> * matches the element, its position in the array is returned. If the target</span></div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment"> * value is less than the element, the search continues in the lower half of</span></div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="comment"> * the array. If the target value is greater than the element, the search</span></div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="comment"> * continues in the upper half of the array. By doing this, the algorithm</span></div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="comment"> * eliminates the half in which the target value cannot lie in each iteration.</span></div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="comment"> * ### Complexities</span></div>
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="comment"> * //n is the number of element in the array.</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="comment"> * Worst-case time complexity   O(log n)</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="comment"> * Best-case time complexity    O(1)</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="comment"> * Average time complexity      O(log n)</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="comment"> * space complexity  0(1)</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span><span class="comment"> * Worst-case space complexity  0(1)</span></div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span><span class="comment"> *</span></div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span><span class="comment"> * @author [Lajat Manekar](https://github.com/Lazeeez)</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span><span class="comment"> * @author Unknown author</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span><span class="preprocessor">#include &lt;cassert&gt;</span>    </div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span><span class="preprocessor">#include &lt;vector&gt;</span>     </div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span><span class="comment">/******************************************************************************</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span><span class="comment"> * @namespace search</span></div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span><span class="comment"> * @brief Searching algorithms</span></div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="foldopen" id="foldopen00047" data-start="{" data-end="}">
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"><a class="line" href="../../d9/dca/namespacesearch.html">   47</a></span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d9/dca/namespacesearch.html">search</a> {</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span> </div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span><span class="comment">/******************************************************************************</span></div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span><span class="comment"> * @namespace binary_search</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span><span class="comment"> * @brief Binary search searching algorihm</span></div>
+<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="keyword">namespace </span>binary_search {</div>
+<div class="line"><a id="l00054" name="l00054"></a><span class="lineno">   54</span> </div>
+<div class="line"><a id="l00055" name="l00055"></a><span class="lineno">   55</span><span class="comment">/******************************************************************************</span></div>
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno">   56</span><span class="comment"> * @brief The main function which implements binary search</span></div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span><span class="comment"> * @param arr vector to be searched in</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span><span class="comment"> * @param val value to be searched</span></div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span><span class="comment"> * @returns @param int index of val in vector arr</span></div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>uint64_t binarySearch(std::vector&lt;uint64_t&gt; arr, uint64_t val) {</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    uint64_t low = 0;                <span class="comment">// set the lowest point of the vector.</span></div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    uint64_t high = arr.size() - 1;  <span class="comment">// set the highest point of the vector.</span></div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span> </div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordflow">while</span> (low &lt;= high) {</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>        uint64_t m = low + (high - low) / 2;  <span class="comment">// set the pivot point</span></div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span> </div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>        <span class="keywordflow">if</span> (val == arr[m]) {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>            <span class="keywordflow">return</span> m;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        } <span class="comment">/****************************************************</span></div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span><span class="comment">           * if pivot point is the val, return it,</span></div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span><span class="comment">           * else check if val is greater or smaller than pivot value</span></div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span><span class="comment">           * and set the next pivot point accordingly.</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span><span class="comment">           ****************************************************/</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>        <span class="keywordflow">else</span> <span class="keywordflow">if</span> (val &lt; arr[m]) {</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span>            high = m - 1;</div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>        } <span class="keywordflow">else</span> {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>            low = m + 1;</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>        }</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    }</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span>    <span class="keywordflow">return</span> -1;  <span class="comment">// if val is not in the array, return -1.</span></div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>}</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span> </div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>}  <span class="comment">// namespace binary_search</span></div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span> </div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>}  <span class="comment">// namespace search</span></div>
+</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span> </div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span><span class="comment">/*******************************************************************************</span></div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span><span class="comment"> * @brief Self-test implementation #1</span></div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span><span class="comment"> * @returns void</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00092" name="l00092"></a><span class="lineno">   92</span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/db9/hill__cipher_8cpp.html#a3147ad576f8a94a2a6b66948672b452b">test1</a>() {</div>
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno">   93</span>    <span class="comment">// testcase #1</span></div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    <span class="comment">// array = [1,3,5,7,9,8,6,4,2] , Value = 4</span></div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    <span class="comment">// should return 3</span></div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span> </div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    std::vector&lt;uint64_t&gt; arr = {{1, 3, 5, 7, 9, 8, 6, 4, 2}};</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    std::sort(arr.begin(), arr.end());</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    uint64_t expected_ans = 3;</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    uint64_t derived_ans = search::binary_search::binarySearch(arr, 4);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test #1: &quot;</span>;</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    assert(derived_ans == expected_ans);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>}</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span> </div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span><span class="comment">/*******************************************************************************</span></div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span><span class="comment"> * @brief Self-test implementation #2</span></div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span><span class="comment"> * @returns void</span></div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/db9/hill__cipher_8cpp.html#a04391124480d2a49f2dec900237b0712">test2</a>() {</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <span class="comment">// testcase #2</span></div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <span class="comment">// array = [1,23,25,4,2] , Value = 25</span></div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <span class="comment">// should return 4</span></div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    std::vector&lt;uint64_t&gt; arr = {{1, 23, 25, 4, 2}};</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    std::sort(arr.begin(), arr.end());</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    uint64_t expected_ans = 4;</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    uint64_t derived_ans = search::binary_search::binarySearch(arr, 25);</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test #2: &quot;</span>;</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    assert(derived_ans == expected_ans);</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>}</div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span> </div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span><span class="comment">/*******************************************************************************</span></div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span><span class="comment"> * @brief Self-test implementation #3</span></div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span><span class="comment"> * @returns void</span></div>
+<div class="line"><a id="l00126" name="l00126"></a><span class="lineno">  126</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno">  127</span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9">test3</a>() {</div>
+<div class="line"><a id="l00128" name="l00128"></a><span class="lineno">  128</span>    <span class="comment">// testcase #3</span></div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    <span class="comment">// array = [1,31,231,12,12,2,5,51,21,23,12,3] , Value = 5</span></div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>    <span class="comment">// should return 8</span></div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    std::vector&lt;uint64_t&gt; arr = {{1, 31, 231, 12, 2, 5, 51, 21, 23, 12, 3}};</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    std::sort(arr.begin(), arr.end());</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    uint64_t expected_ans = 8;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    uint64_t derived_ans = search::binary_search::binarySearch(arr, 31);</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test #3: &quot;</span>;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span>    assert(derived_ans == expected_ans);</div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Passed!&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span>}</div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span> </div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span><span class="comment">/*******************************************************************************</span></div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span><span class="comment"> * @brief Main function</span></div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span><span class="comment"> * @returns 0 on exit</span></div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span><span class="comment"> *******************************************************************************/</span></div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <a class="code hl_function" href="../../d7/db9/hill__cipher_8cpp.html#a3147ad576f8a94a2a6b66948672b452b">test1</a>();  <span class="comment">// run self-test implementation #1</span></div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    <a class="code hl_function" href="../../d7/db9/hill__cipher_8cpp.html#a04391124480d2a49f2dec900237b0712">test2</a>();  <span class="comment">// run self-test implementation #2</span></div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    <a class="code hl_function" href="../../d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9">test3</a>();  <span class="comment">// run self-test implementation #3</span></div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span> </div>
+<div class="line"><a id="l00149" name="l00149"></a><span class="lineno">  149</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00150" name="l00150"></a><span class="lineno">  150</span>}</div>
+<div class="ttc" id="aadaline__learning_8cpp_html_a992bdf1fdb0b9d414bcf7981d2d87aa9"><div class="ttname"><a href="../../d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9">test3</a></div><div class="ttdeci">void test3(double eta=0.01)</div><div class="ttdef"><b>Definition</b> <a href="../../d5/db0/adaline__learning_8cpp_source.html#l00313">adaline_learning.cpp:313</a></div></div>
+<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
+<div class="ttc" id="ahill__cipher_8cpp_html_a04391124480d2a49f2dec900237b0712"><div class="ttname"><a href="../../d7/db9/hill__cipher_8cpp.html#a04391124480d2a49f2dec900237b0712">test2</a></div><div class="ttdeci">void test2(const std::string &amp;text)</div><div class="ttdoc">Self test 2 - using 8x8 randomly generated key.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/db9/hill__cipher_8cpp_source.html#l00506">hill_cipher.cpp:506</a></div></div>
+<div class="ttc" id="ahill__cipher_8cpp_html_a3147ad576f8a94a2a6b66948672b452b"><div class="ttname"><a href="../../d7/db9/hill__cipher_8cpp.html#a3147ad576f8a94a2a6b66948672b452b">test1</a></div><div class="ttdeci">void test1(const std::string &amp;text)</div><div class="ttdoc">Self test 1 - using 3x3 randomly generated key.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/db9/hill__cipher_8cpp_source.html#l00471">hill_cipher.cpp:471</a></div></div>
+<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::assert</div><div class="ttdef"><b>Definition</b> <a href="#l00047">binary_search.cpp:47</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><b>binary_search.cpp</b></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/dd7/structlinkedlist-members.html b/df/dd7/structlinkedlist-members.html
index 2d2667b07..5d48a06b2 100644
--- a/df/dd7/structlinkedlist-members.html
+++ b/df/dd7/structlinkedlist-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/df/ddb/structdata__structures_1_1treap_1_1_treap-members.html b/df/ddb/structdata__structures_1_1treap_1_1_treap-members.html
index ae531e1cf..0515eea98 100644
--- a/df/ddb/structdata__structures_1_1treap_1_1_treap-members.html
+++ b/df/ddb/structdata__structures_1_1treap_1_1_treap-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/df/ddc/struct_node__coll__graph.map b/df/ddc/struct_node__coll__graph.map
index 9142a821d..560cb8408 100644
--- a/df/ddc/struct_node__coll__graph.map
+++ b/df/ddc/struct_node__coll__graph.map
@@ -1,6 +1,6 @@
 <map id="Node&lt; ValueType &gt;" name="Node&lt; ValueType &gt;">
 <area shape="rect" id="Node000001" title=" " alt="" coords="13,198,149,223"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/shared_ptr.html" title=" " alt="" coords="5,5,157,46"/>
+<area shape="rect" id="Node000002" title=" " alt="" coords="5,5,157,46"/>
 <area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="78,61,75,97,75,135,82,197,76,197,69,135,70,96,73,61"/>
 <area shape="rect" id="Node000003" href="$db/d8b/struct_node.html" title=" " alt="" coords="113,109,249,135"/>
 <area shape="poly" id="edge3_Node000003_Node000002" title=" " alt="" coords="115,55,170,107,167,111,111,59"/>
diff --git a/df/ddc/struct_node__coll__graph.md5 b/df/ddc/struct_node__coll__graph.md5
index 0c56d973e..338aba061 100644
--- a/df/ddc/struct_node__coll__graph.md5
+++ b/df/ddc/struct_node__coll__graph.md5
@@ -1 +1 @@
-e264eaed2b1f629691284c1caf0a1d32
\ No newline at end of file
+63d73f0fc58ea5140cde16b4e60e46d3
\ No newline at end of file
diff --git a/df/ddc/struct_node__coll__graph.svg b/df/ddc/struct_node__coll__graph.svg
index 7c0c6ecb6..7a59659ba 100644
--- a/df/ddc/struct_node__coll__graph.svg
+++ b/df/ddc/struct_node__coll__graph.svg
@@ -31,7 +31,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="113.5,-163.5 0,-163.5 0,-133 113.5,-133 113.5,-163.5"/>
 <text text-anchor="start" x="8" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Node</text>
 <text text-anchor="middle" x="56.75" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; ValueType &gt; &gt;</text>
diff --git a/df/ddc/struct_node__coll__graph_org.svg b/df/ddc/struct_node__coll__graph_org.svg
index dba9b6587..bd7344952 100644
--- a/df/ddc/struct_node__coll__graph_org.svg
+++ b/df/ddc/struct_node__coll__graph_org.svg
@@ -20,7 +20,7 @@
 <!-- Node2 -->
 <g id="Node000002" class="node">
 <title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html" xlink:title=" ">
+<g id="a_Node000002"><a xlink:title=" ">
 <polygon fill="white" stroke="#666666" points="113.5,-163.5 0,-163.5 0,-133 113.5,-133 113.5,-163.5"/>
 <text text-anchor="start" x="8" y="-150" font-family="Helvetica,sans-Serif" font-size="10.00">std::shared_ptr&lt; Node</text>
 <text text-anchor="middle" x="56.75" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; ValueType &gt; &gt;</text>
diff --git a/df/ddd/connected__components_8cpp.html b/df/ddd/connected__components_8cpp.html
index e807b6cbb..c4c39dff7 100644
--- a/df/ddd/connected__components_8cpp.html
+++ b/df/ddd/connected__components_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph/connected_components.cpp File Reference</title>
+<title>TheAlgorithms/C++: graph/connected_components.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for connected_components.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d77/connected__components_8cpp__incl.svg" width="350" height="111"><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">
+</div>
+<p><a href="../../df/ddd/connected__components_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html">graph</a></td></tr>
@@ -131,13 +150,13 @@ Namespaces</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
-<tr class="memitem:a9125ceb66bfbec3093bba64c2c1e99e2" id="r_a9125ceb66bfbec3093bba64c2c1e99e2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; *adj, int u, int v)</td></tr>
+<tr class="memitem:a9125ceb66bfbec3093bba64c2c1e99e2" id="r_a9125ceb66bfbec3093bba64c2c1e99e2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a> (std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, int v)</td></tr>
 <tr class="memdesc:a9125ceb66bfbec3093bba64c2c1e99e2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that add edge between two nodes or vertices of graph.  <br /></td></tr>
 <tr class="separator:a9125ceb66bfbec3093bba64c2c1e99e2"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a3ae80bc4c6a79d041b4f3a6589eb7fb8" id="r_a3ae80bc4c6a79d041b4f3a6589eb7fb8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8">graph::explore</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; *adj, int u, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; bool &gt; *visited)</td></tr>
+<tr class="memitem:a3ae80bc4c6a79d041b4f3a6589eb7fb8" id="r_a3ae80bc4c6a79d041b4f3a6589eb7fb8"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8">graph::explore</a> (const std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, std::vector&lt; bool &gt; *visited)</td></tr>
 <tr class="memdesc:a3ae80bc4c6a79d041b4f3a6589eb7fb8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Utility function for depth first seach algorithm this function explores the vertex which is passed into.  <br /></td></tr>
 <tr class="separator:a3ae80bc4c6a79d041b4f3a6589eb7fb8"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:a83ab16e96cec644109a58dfc9329bc2b" id="r_a83ab16e96cec644109a58dfc9329bc2b"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b">graph::getConnectedComponents</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &gt; *adj)</td></tr>
+<tr class="memitem:a83ab16e96cec644109a58dfc9329bc2b" id="r_a83ab16e96cec644109a58dfc9329bc2b"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b">graph::getConnectedComponents</a> (const std::vector&lt; std::vector&lt; int &gt; &gt; *adj)</td></tr>
 <tr class="memdesc:a83ab16e96cec644109a58dfc9329bc2b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that perfoms depth first search algorithm on graph and calculated the number of connected components.  <br /></td></tr>
 <tr class="separator:a83ab16e96cec644109a58dfc9329bc2b"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a88ec9ad42717780d6caaff9d3d6977f9" id="r_a88ec9ad42717780d6caaff9d3d6977f9"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a> ()</td></tr>
@@ -158,7 +177,9 @@ Example - Here is graph with 3 connected components
 
    first          second           third
    component      component        component
-</pre> </div><h2 class="groupheader">Function Documentation</h2>
+</pre> 
+<p class="definition">Definition in file <a class="el" href="../../df/ddd/connected__components_8cpp_source.html">connected_components.cpp</a>.</p>
+</div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
 
@@ -175,41 +196,33 @@ Example - Here is graph with 3 connected components
 </div><div class="memdoc">
 <p>Main function </p>
 <p>running predefined tests</p>
-<div class="fragment"><div class="line"><span class="lineno">  127</span>           {<span class="comment"></span></div>
-<div class="line"><span class="lineno">  128</span><span class="comment">    /// running predefined tests</span></div>
-<div class="line"><span class="lineno">  129</span><span class="comment"></span>    <a class="code hl_function" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
+
+<p class="definition">Definition at line <a class="el" href="../../df/ddd/connected__components_8cpp_source.html#l00127">127</a> of file <a class="el" href="../../df/ddd/connected__components_8cpp_source.html">connected_components.cpp</a>.</p>
+<div class="fragment"><div class="line"><span class="lineno">  127</span>           {</div>
+<div class="line"><span class="lineno">  129</span>    <a class="code hl_function" href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
 <div class="line"><span class="lineno">  130</span> </div>
 <div class="line"><span class="lineno">  131</span>    <span class="keywordtype">int</span> vertices = int(), edges = int();</div>
-<div class="line"><span class="lineno">  132</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the number of vertices : &quot;</span>;</div>
-<div class="line"><span class="lineno">  133</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; vertices;</div>
-<div class="line"><span class="lineno">  134</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the number of edges : &quot;</span>;</div>
-<div class="line"><span class="lineno">  135</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; edges;</div>
+<div class="line"><span class="lineno">  132</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of vertices : &quot;</span>;</div>
+<div class="line"><span class="lineno">  133</span>    std::cin &gt;&gt; vertices;</div>
+<div class="line"><span class="lineno">  134</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of edges : &quot;</span>;</div>
+<div class="line"><span class="lineno">  135</span>    std::cin &gt;&gt; edges;</div>
 <div class="line"><span class="lineno">  136</span> </div>
-<div class="line"><span class="lineno">  137</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;int&gt;</a>&gt; adj(vertices, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>());</div>
+<div class="line"><span class="lineno">  137</span>    std::vector&lt;std::vector&lt;int&gt;&gt; adj(vertices, std::vector&lt;int&gt;());</div>
 <div class="line"><span class="lineno">  138</span> </div>
 <div class="line"><span class="lineno">  139</span>    <span class="keywordtype">int</span> u = int(), v = int();</div>
 <div class="line"><span class="lineno">  140</span>    <span class="keywordflow">while</span> (edges--) {</div>
-<div class="line"><span class="lineno">  141</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; u &gt;&gt; v;</div>
+<div class="line"><span class="lineno">  141</span>        std::cin &gt;&gt; u &gt;&gt; v;</div>
 <div class="line"><span class="lineno">  142</span>        <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj, u, v);</div>
 <div class="line"><span class="lineno">  143</span>    }</div>
 <div class="line"><span class="lineno">  144</span> </div>
 <div class="line"><span class="lineno">  145</span>    <span class="keywordtype">int</span> cc = <a class="code hl_function" href="../../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b">graph::getConnectedComponents</a>(&amp;adj);</div>
-<div class="line"><span class="lineno">  146</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; cc &lt;&lt; <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">  146</span>    std::cout &lt;&lt; cc &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  147</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">  148</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="aconnected__components_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> connected_components.cpp:93</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_a83ab16e96cec644109a58dfc9329bc2b"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b">graph::getConnectedComponents</a></div><div class="ttdeci">int getConnectedComponents(const std::vector&lt; std::vector&lt; int &gt; &gt; *adj)</div><div class="ttdoc">Function that perfoms depth first search algorithm on graph and calculated the number of connected co...</div><div class="ttdef"><b>Definition</b> connected_components.cpp:77</div></div>
-<div class="ttc" id="anamespacegraph_html_a9125ceb66bfbec3093bba64c2c1e99e2"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a></div><div class="ttdeci">void addEdge(std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, int v)</div><div class="ttdoc">Function that add edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition</b> connected_components.cpp:46</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>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="587" height="186"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aconnected__components_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="../../df/ddd/connected__components_8cpp_source.html#l00093">connected_components.cpp:93</a></div></div>
+<div class="ttc" id="anamespacegraph_html_a83ab16e96cec644109a58dfc9329bc2b"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b">graph::getConnectedComponents</a></div><div class="ttdeci">int getConnectedComponents(const std::vector&lt; std::vector&lt; int &gt; &gt; *adj)</div><div class="ttdoc">Function that perfoms depth first search algorithm on graph and calculated the number of connected co...</div><div class="ttdef"><b>Definition</b> <a href="../../df/ddd/connected__components_8cpp_source.html#l00077">connected_components.cpp:77</a></div></div>
+<div class="ttc" id="anamespacegraph_html_a9125ceb66bfbec3093bba64c2c1e99e2"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a></div><div class="ttdeci">void addEdge(std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, int v)</div><div class="ttdoc">Function that add edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition</b> <a href="../../df/ddd/connected__components_8cpp_source.html#l00046">connected_components.cpp:46</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="a88ec9ad42717780d6caaff9d3d6977f9" name="a88ec9ad42717780d6caaff9d3d6977f9"></a>
@@ -227,10 +240,12 @@ Here is the call graph for this function:</div>
       </table>
 </div><div class="memdoc">
 <p>Function to test the algorithm </p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/ddd/connected__components_8cpp_source.html#l00093">93</a> of file <a class="el" href="../../df/ddd/connected__components_8cpp_source.html">connected_components.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   93</span>             {</div>
-<div class="line"><span class="lineno">   94</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Running predefined tests...&quot;</span> &lt;&lt; <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">   95</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Initiating Test 1...&quot;</span> &lt;&lt; <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">   96</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;int&gt;</a>&gt; adj1(9, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>());</div>
+<div class="line"><span class="lineno">   94</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Running predefined tests...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   95</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 1...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">   96</span>    std::vector&lt;std::vector&lt;int&gt;&gt; adj1(9, std::vector&lt;int&gt;());</div>
 <div class="line"><span class="lineno">   97</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj1, 1, 2);</div>
 <div class="line"><span class="lineno">   98</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj1, 1, 3);</div>
 <div class="line"><span class="lineno">   99</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj1, 3, 4);</div>
@@ -239,10 +254,10 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  102</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj1, 8, 9);</div>
 <div class="line"><span class="lineno">  103</span> </div>
 <div class="line"><span class="lineno">  104</span>    assert(<a class="code hl_function" href="../../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b">graph::getConnectedComponents</a>(&amp;adj1) == 3);</div>
-<div class="line"><span class="lineno">  105</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed...&quot;</span> &lt;&lt; <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">  105</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  106</span> </div>
-<div class="line"><span class="lineno">  107</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Innitiating Test 2...&quot;</span> &lt;&lt; <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">  108</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;int&gt;</a>&gt; adj2(10, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>());</div>
+<div class="line"><span class="lineno">  107</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Innitiating Test 2...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><span class="lineno">  108</span>    std::vector&lt;std::vector&lt;int&gt;&gt; adj2(10, std::vector&lt;int&gt;());</div>
 <div class="line"><span class="lineno">  109</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 1, 2);</div>
 <div class="line"><span class="lineno">  110</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 1, 3);</div>
 <div class="line"><span class="lineno">  111</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 1, 4);</div>
@@ -257,14 +272,9 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">  120</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 6, 7);</div>
 <div class="line"><span class="lineno">  121</span> </div>
 <div class="line"><span class="lineno">  122</span>    assert(<a class="code hl_function" href="../../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b">graph::getConnectedComponents</a>(&amp;adj2) == 2);</div>
-<div class="line"><span class="lineno">  123</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed...&quot;</span> &lt;&lt; <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">  123</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed...&quot;</span> &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">  124</span>}</div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/ddd/connected__components_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg" width="490" height="159"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/df/ddd/connected__components_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map b/df/ddd/connected__components_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
deleted file mode 100644
index 71aa6b638..000000000
--- a/df/ddd/connected__components_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map
+++ /dev/null
@@ -1,14 +0,0 @@
-<map id="tests" name="tests">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,55,56,80"/>
-<area shape="rect" id="Node000002" href="$df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2" title="Function that add edge between two nodes or vertices of graph." alt="" coords="156,5,268,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,56,103,40,140,30,141,35,104,45,57,61"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="176,55,248,80"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,65,161,65,161,70,56,70"/>
-<area shape="rect" id="Node000004" href="$df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b" title="Function that perfoms depth first search algorithm on graph and calculated the number of connected co..." alt="" coords="104,104,320,130"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="57,74,104,90,132,97,130,103,103,95,55,79"/>
-<area shape="rect" id="Node000005" href="$df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" title="Utility function for depth first seach algorithm this function explores the vertex which is passed in..." alt="" coords="374,79,477,104"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="320,101,358,97,359,102,321,107"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="368,128,483,154"/>
-<area shape="poly" id="edge6_Node000004_Node000006" title=" " alt="" coords="321,126,353,130,352,135,320,132"/>
-<area shape="poly" id="edge5_Node000005_Node000005" title=" " alt="" coords="390,80,383,70,387,60,402,54,426,52,452,55,465,62,463,66,450,60,426,57,403,59,391,64,388,69,394,77"/>
-</map>
diff --git a/df/ddd/connected__components_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 b/df/ddd/connected__components_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
deleted file mode 100644
index 4fffff082..000000000
--- a/df/ddd/connected__components_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-ce9123d675422e0f6d8bc9543678e05d
\ No newline at end of file
diff --git a/df/ddd/connected__components_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg b/df/ddd/connected__components_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
deleted file mode 100644
index 0ba101bda..000000000
--- a/df/ddd/connected__components_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg
+++ /dev/null
@@ -1,146 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="367pt" height="119pt"
- viewBox="0.00 0.00 366.50 119.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 115.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-74.25 0,-74.25 0,-55 37.75,-55 37.75,-74.25"/>
-<text text-anchor="middle" x="18.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2" target="_top" xlink:title="Function that add edge between two nodes or vertices of graph.">
-<polygon fill="white" stroke="#666666" points="197,-111.25 112.75,-111.25 112.75,-92 197,-92 197,-111.25"/>
-<text text-anchor="middle" x="154.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.15,-71.68C48.5,-75.51 61.74,-80.17 73.75,-83.62 82.61,-86.17 92.12,-88.58 101.37,-90.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.46,-94.15 110.99,-92.96 102.02,-87.32 100.46,-94.15"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="181.62,-74.25 128.12,-74.25 128.12,-55 181.62,-55 181.62,-74.25"/>
-<text text-anchor="middle" x="154.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.23,-64.62C58.27,-64.62 90.93,-64.62 116.44,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="116.43,-68.13 126.43,-64.63 116.43,-61.13 116.43,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b" target="_top" xlink:title="Function that perfoms depth first search algorithm on graph and calculated the number of connected co...">
-<polygon fill="white" stroke="#666666" points="236,-37.25 73.75,-37.25 73.75,-18 236,-18 236,-37.25"/>
-<text text-anchor="middle" x="154.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::getConnectedComponents</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.15,-57.57C48.5,-53.74 61.74,-49.08 73.75,-45.62 80.31,-43.74 87.23,-41.93 94.13,-40.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.52,-43.73 103.44,-38.01 92.9,-36.92 94.52,-43.73"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" target="_top" xlink:title="Utility function for depth first seach algorithm this function explores the vertex which is passed in...">
-<polygon fill="white" stroke="#666666" points="354,-56.25 276.5,-56.25 276.5,-37 354,-37 354,-56.25"/>
-<text text-anchor="middle" x="315.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M236.45,-37.29C246.23,-38.47 255.98,-39.63 265.11,-40.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="264.44,-44.17 274.79,-41.89 265.27,-37.22 264.44,-44.17"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.5,-19.25 272,-19.25 272,0 358.5,0 358.5,-19.25"/>
-<text text-anchor="middle" x="315.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge6_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge6_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M236.45,-18.47C244.57,-17.54 252.67,-16.62 260.41,-15.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.79,-19.22 270.33,-14.62 260,-12.27 260.79,-19.22"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.14,-56.54C278.69,-65.15 287.06,-74.25 315.25,-74.25 331.11,-74.25 340.69,-71.37 344.01,-67.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="347.37,-66.32 340.84,-57.97 340.73,-68.57 347.37,-66.32"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/ddd/connected__components_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg b/df/ddd/connected__components_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
deleted file mode 100644
index 418ee16ca..000000000
--- a/df/ddd/connected__components_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph_org.svg
+++ /dev/null
@@ -1,120 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: tests Pages: 1 -->
-<svg width="367pt" height="119pt"
- viewBox="0.00 0.00 366.50 119.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 115.25)">
-<title>tests</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37.75,-74.25 0,-74.25 0,-55 37.75,-55 37.75,-74.25"/>
-<text text-anchor="middle" x="18.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2" target="_top" xlink:title="Function that add edge between two nodes or vertices of graph.">
-<polygon fill="white" stroke="#666666" points="197,-111.25 112.75,-111.25 112.75,-92 197,-92 197,-111.25"/>
-<text text-anchor="middle" x="154.88" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.15,-71.68C48.5,-75.51 61.74,-80.17 73.75,-83.62 82.61,-86.17 92.12,-88.58 101.37,-90.76"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="100.46,-94.15 110.99,-92.96 102.02,-87.32 100.46,-94.15"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="181.62,-74.25 128.12,-74.25 128.12,-55 181.62,-55 181.62,-74.25"/>
-<text text-anchor="middle" x="154.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.23,-64.62C58.27,-64.62 90.93,-64.62 116.44,-64.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="116.43,-68.13 126.43,-64.63 116.43,-61.13 116.43,-68.13"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b" target="_top" xlink:title="Function that perfoms depth first search algorithm on graph and calculated the number of connected co...">
-<polygon fill="white" stroke="#666666" points="236,-37.25 73.75,-37.25 73.75,-18 236,-18 236,-37.25"/>
-<text text-anchor="middle" x="154.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::getConnectedComponents</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M38.15,-57.57C48.5,-53.74 61.74,-49.08 73.75,-45.62 80.31,-43.74 87.23,-41.93 94.13,-40.23"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="94.52,-43.73 103.44,-38.01 92.9,-36.92 94.52,-43.73"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" target="_top" xlink:title="Utility function for depth first seach algorithm this function explores the vertex which is passed in...">
-<polygon fill="white" stroke="#666666" points="354,-56.25 276.5,-56.25 276.5,-37 354,-37 354,-56.25"/>
-<text text-anchor="middle" x="315.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M236.45,-37.29C246.23,-38.47 255.98,-39.63 265.11,-40.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="264.44,-44.17 274.79,-41.89 265.27,-37.22 264.44,-44.17"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="358.5,-19.25 272,-19.25 272,0 358.5,0 358.5,-19.25"/>
-<text text-anchor="middle" x="315.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge6_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge6_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M236.45,-18.47C244.57,-17.54 252.67,-16.62 260.41,-15.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="260.79,-19.22 270.33,-14.62 260,-12.27 260.79,-19.22"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M290.14,-56.54C278.69,-65.15 287.06,-74.25 315.25,-74.25 331.11,-74.25 340.69,-71.37 344.01,-67.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="347.37,-66.32 340.84,-57.97 340.73,-68.57 347.37,-66.32"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 1c39998c8..000000000
--- a/df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,56,55,82"/>
-<area shape="rect" id="Node000002" href="$df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2" title="Function that add edge between two nodes or vertices of graph." alt="" coords="253,5,365,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="43,54,69,33,102,16,136,8,171,4,238,5,237,11,171,9,137,13,104,21,72,37,46,58"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="274,81,345,107"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,68,258,87,258,92,55,74"/>
-<area shape="rect" id="Node000004" href="$df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b" title="Function that perfoms depth first search algorithm on graph and calculated the number of connected co..." alt="" coords="201,131,417,156"/>
-<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="56,74,202,117,230,124,229,129,200,122,54,79"/>
-<area shape="rect" id="Node000007" href="$df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" title=" " alt="" coords="103,31,153,56"/>
-<area shape="poly" id="edge7_Node000001_Node000007" title=" " alt="" coords="54,60,87,51,89,56,56,65"/>
-<area shape="rect" id="Node000005" href="$df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" title="Utility function for depth first seach algorithm this function explores the vertex which is passed in..." alt="" coords="471,105,575,131"/>
-<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="418,128,456,124,456,129,418,133"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="465,155,581,180"/>
-<area shape="poly" id="edge6_Node000004_Node000006" title=" " alt="" coords="418,153,450,157,450,162,418,159"/>
-<area shape="poly" id="edge5_Node000005_Node000005" title=" " alt="" coords="487,107,480,97,485,87,499,81,523,79,549,82,563,88,560,93,548,87,523,84,500,86,488,91,486,96,492,103"/>
-<area shape="poly" id="edge8_Node000007_Node000002" title=" " alt="" coords="153,38,237,26,238,31,154,43"/>
-<area shape="poly" id="edge9_Node000007_Node000003" title=" " alt="" coords="154,48,260,78,258,83,153,53"/>
-<area shape="poly" id="edge10_Node000007_Node000004" title=" " alt="" coords="140,55,165,87,183,104,202,117,212,122,210,127,200,122,179,108,161,90,136,58"/>
-</map>
diff --git a/df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 47dd8206b..000000000
--- a/df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-c0d479d766f2b8778d6accfacb3568a3
\ No newline at end of file
diff --git a/df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index b6fe7de0e..000000000
--- a/df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,191 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="440pt" height="139pt"
- viewBox="0.00 0.00 439.50 139.37" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 135.37)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-93.25 0,-93.25 0,-74 37,-74 37,-93.25"/>
-<text text-anchor="middle" x="18.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2" target="_top" xlink:title="Function that add edge between two nodes or vertices of graph.">
-<polygon fill="white" stroke="#666666" points="270,-131.25 185.75,-131.25 185.75,-112 270,-112 270,-131.25"/>
-<text text-anchor="middle" x="227.88" y="-117.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.48,-93.66C39.49,-102.96 55.85,-116.15 73,-121.62 105.5,-131.99 143.86,-132.02 174.15,-129.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.22,-132.95 183.83,-128.49 173.53,-125.98 174.22,-132.95"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.62,-74.25 201.12,-74.25 201.12,-55 254.62,-55 254.62,-74.25"/>
-<text text-anchor="middle" x="227.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.18,-82.01C70.81,-78.92 144.63,-72.16 189.62,-68.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.8,-71.54 199.44,-67.14 189.16,-64.57 189.8,-71.54"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b" target="_top" xlink:title="Function that perfoms depth first search algorithm on graph and calculated the number of connected co...">
-<polygon fill="white" stroke="#666666" points="309,-37.25 146.75,-37.25 146.75,-18 309,-18 309,-37.25"/>
-<text text-anchor="middle" x="227.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::getConnectedComponents</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.09,-77.95C61.55,-70.16 107.27,-55.94 146.75,-45.62 153.71,-43.81 161.04,-42 168.33,-40.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.86,-43.75 177.82,-38.09 167.28,-36.93 168.86,-43.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-112.25 73,-112.25 73,-93 110.75,-93 110.75,-112.25"/>
-<text text-anchor="middle" x="91.88" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-88.32C44.64,-90.32 53.57,-92.69 61.98,-94.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.91,-98.27 71.48,-97.46 62.71,-91.51 60.91,-98.27"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" target="_top" xlink:title="Utility function for depth first seach algorithm this function explores the vertex which is passed in...">
-<polygon fill="white" stroke="#666666" points="427,-56.25 349.5,-56.25 349.5,-37 427,-37 427,-56.25"/>
-<text text-anchor="middle" x="388.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M309.45,-37.29C319.23,-38.47 328.98,-39.63 338.11,-40.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="337.44,-44.17 347.79,-41.89 338.27,-37.22 337.44,-44.17"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="431.5,-19.25 345,-19.25 345,0 431.5,0 431.5,-19.25"/>
-<text text-anchor="middle" x="388.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge6_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge6_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M309.45,-18.47C317.57,-17.54 325.67,-16.62 333.41,-15.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.79,-19.22 343.33,-14.62 333,-12.27 333.79,-19.22"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M363.14,-56.54C351.69,-65.15 360.06,-74.25 388.25,-74.25 404.11,-74.25 413.69,-71.37 417.01,-67.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="420.37,-66.32 413.84,-57.97 413.73,-68.57 420.37,-66.32"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node2 -->
-<g id="edge8_Node000007_Node000002" class="edge">
-<title>Node7&#45;&gt;Node2</title>
-<g id="a_edge8_Node000007_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.23,-105.23C127.4,-107.52 151.78,-110.98 174,-114.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.47,-117.59 183.86,-115.53 174.45,-110.66 173.47,-117.59"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge9_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge9_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.23,-97.42C131.46,-91.68 164.52,-82.31 190.13,-75.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.82,-78.49 199.49,-72.39 188.91,-71.75 190.82,-78.49"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge10_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge10_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.27,-92.88C108.27,-79.97 125.92,-57.48 146.75,-45.62 149.1,-44.29 151.55,-43.05 154.06,-41.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.26,-45.19 163.26,-38.24 152.68,-38.68 155.26,-45.19"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index e1e44764b..000000000
--- a/df/ddd/connected__components_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,165 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="440pt" height="139pt"
- viewBox="0.00 0.00 439.50 139.37" 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 135.37)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-93.25 0,-93.25 0,-74 37,-74 37,-93.25"/>
-<text text-anchor="middle" x="18.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2" target="_top" xlink:title="Function that add edge between two nodes or vertices of graph.">
-<polygon fill="white" stroke="#666666" points="270,-131.25 185.75,-131.25 185.75,-112 270,-112 270,-131.25"/>
-<text text-anchor="middle" x="227.88" y="-117.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::addEdge</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M29.48,-93.66C39.49,-102.96 55.85,-116.15 73,-121.62 105.5,-131.99 143.86,-132.02 174.15,-129.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="174.22,-132.95 183.83,-128.49 173.53,-125.98 174.22,-132.95"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="254.62,-74.25 201.12,-74.25 201.12,-55 254.62,-55 254.62,-74.25"/>
-<text text-anchor="middle" x="227.88" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.18,-82.01C70.81,-78.92 144.63,-72.16 189.62,-68.04"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="189.8,-71.54 199.44,-67.14 189.16,-64.57 189.8,-71.54"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a xlink:href="../../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b" target="_top" xlink:title="Function that perfoms depth first search algorithm on graph and calculated the number of connected co...">
-<polygon fill="white" stroke="#666666" points="309,-37.25 146.75,-37.25 146.75,-18 309,-18 309,-37.25"/>
-<text text-anchor="middle" x="227.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::getConnectedComponents</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node4 -->
-<g id="edge3_Node000001_Node000004" class="edge">
-<title>Node1&#45;&gt;Node4</title>
-<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.09,-77.95C61.55,-70.16 107.27,-55.94 146.75,-45.62 153.71,-43.81 161.04,-42 168.33,-40.28"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="168.86,-43.75 177.82,-38.09 167.28,-36.93 168.86,-43.75"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a xlink:href="../../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="110.75,-112.25 73,-112.25 73,-93 110.75,-93 110.75,-112.25"/>
-<text text-anchor="middle" x="91.88" y="-98.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge7_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge7_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.14,-88.32C44.64,-90.32 53.57,-92.69 61.98,-94.93"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="60.91,-98.27 71.48,-97.46 62.71,-91.51 60.91,-98.27"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8" target="_top" xlink:title="Utility function for depth first seach algorithm this function explores the vertex which is passed in...">
-<polygon fill="white" stroke="#666666" points="427,-56.25 349.5,-56.25 349.5,-37 427,-37 427,-56.25"/>
-<text text-anchor="middle" x="388.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">graph::explore</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node5 -->
-<g id="edge4_Node000004_Node000005" class="edge">
-<title>Node4&#45;&gt;Node5</title>
-<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M309.45,-37.29C319.23,-38.47 328.98,-39.63 338.11,-40.73"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="337.44,-44.17 347.79,-41.89 338.27,-37.22 337.44,-44.17"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="431.5,-19.25 345,-19.25 345,0 431.5,0 431.5,-19.25"/>
-<text text-anchor="middle" x="388.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
-</a>
-</g>
-</g>
-<!-- Node4&#45;&gt;Node6 -->
-<g id="edge6_Node000004_Node000006" class="edge">
-<title>Node4&#45;&gt;Node6</title>
-<g id="a_edge6_Node000004_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M309.45,-18.47C317.57,-17.54 325.67,-16.62 333.41,-15.74"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="333.79,-19.22 343.33,-14.62 333,-12.27 333.79,-19.22"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge5_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge5_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M363.14,-56.54C351.69,-65.15 360.06,-74.25 388.25,-74.25 404.11,-74.25 413.69,-71.37 417.01,-67.32"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="420.37,-66.32 413.84,-57.97 413.73,-68.57 420.37,-66.32"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node2 -->
-<g id="edge8_Node000007_Node000002" class="edge">
-<title>Node7&#45;&gt;Node2</title>
-<g id="a_edge8_Node000007_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.23,-105.23C127.4,-107.52 151.78,-110.98 174,-114.13"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="173.47,-117.59 183.86,-115.53 174.45,-110.66 173.47,-117.59"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node3 -->
-<g id="edge9_Node000007_Node000003" class="edge">
-<title>Node7&#45;&gt;Node3</title>
-<g id="a_edge9_Node000007_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M111.23,-97.42C131.46,-91.68 164.52,-82.31 190.13,-75.05"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="190.82,-78.49 199.49,-72.39 188.91,-71.75 190.82,-78.49"/>
-</a>
-</g>
-</g>
-<!-- Node7&#45;&gt;Node4 -->
-<g id="edge10_Node000007_Node000004" class="edge">
-<title>Node7&#45;&gt;Node4</title>
-<g id="a_edge10_Node000007_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M99.27,-92.88C108.27,-79.97 125.92,-57.48 146.75,-45.62 149.1,-44.29 151.55,-43.05 154.06,-41.9"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="155.26,-45.19 163.26,-38.24 152.68,-38.68 155.26,-45.19"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/ddd/connected__components_8cpp_source.html b/df/ddd/connected__components_8cpp_source.html
new file mode 100644
index 000000000..49350c3c7
--- /dev/null
+++ b/df/ddd/connected__components_8cpp_source.html
@@ -0,0 +1,244 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: graph/connected_components.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/ddd/connected__components_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">connected_components.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../df/ddd/connected__components_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span><span class="preprocessor">#include &lt;cassert&gt;</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span><span class="preprocessor">#include &lt;vector&gt;</span></div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a> {</div>
+<div class="foldopen" id="foldopen00046" data-start="{" data-end="}">
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"><a class="line" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">   46</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">addEdge</a>(std::vector&lt;std::vector&lt;int&gt;&gt; *adj, <span class="keywordtype">int</span> u, <span class="keywordtype">int</span> v) {</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>    (*adj)[u - 1].push_back(v - 1);</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    (*adj)[v - 1].push_back(u - 1);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>}</div>
+</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span> </div>
+<div class="foldopen" id="foldopen00059" data-start="{" data-end="}">
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8">   59</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8">explore</a>(<span class="keyword">const</span> std::vector&lt;std::vector&lt;int&gt;&gt; *adj, <span class="keywordtype">int</span> u,</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>             std::vector&lt;bool&gt; *visited) {</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    (*visited)[u] = <span class="keyword">true</span>;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordflow">for</span> (<span class="keyword">auto</span> v : (*adj)[u]) {</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>        <span class="keywordflow">if</span> (!(*visited)[v]) {</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>            <a class="code hl_function" href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8">explore</a>(adj, v, visited);</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>        }</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span>    }</div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>}</div>
+</div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
+<div class="foldopen" id="foldopen00077" data-start="{" data-end="}">
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"><a class="line" href="../../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b">   77</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b">getConnectedComponents</a>(<span class="keyword">const</span> std::vector&lt;std::vector&lt;int&gt;&gt; *adj) {</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordtype">int</span> n = adj-&gt;size();</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>    <span class="keywordtype">int</span> connected_components = 0;</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span>    std::vector&lt;bool&gt; visited(n, <span class="keyword">false</span>);</div>
+<div class="line"><a id="l00081" name="l00081"></a><span class="lineno">   81</span> </div>
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno">   82</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>        <span class="keywordflow">if</span> (!visited[i]) {</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>            <a class="code hl_function" href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8">explore</a>(adj, i, &amp;visited);</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>            connected_components++;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>        }</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    }</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <span class="keywordflow">return</span> connected_components;</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>}</div>
+</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>}  <span class="comment">// namespace graph</span></div>
+<div class="line"><a id="l00091" name="l00091"></a><span class="lineno">   91</span> </div>
+<div class="foldopen" id="foldopen00093" data-start="{" data-end="}">
+<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"><a class="line" href="../../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">   93</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>() {</div>
+<div class="line"><a id="l00094" name="l00094"></a><span class="lineno">   94</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Running predefined tests...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00095" name="l00095"></a><span class="lineno">   95</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Initiating Test 1...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00096" name="l00096"></a><span class="lineno">   96</span>    std::vector&lt;std::vector&lt;int&gt;&gt; adj1(9, std::vector&lt;int&gt;());</div>
+<div class="line"><a id="l00097" name="l00097"></a><span class="lineno">   97</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj1, 1, 2);</div>
+<div class="line"><a id="l00098" name="l00098"></a><span class="lineno">   98</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj1, 1, 3);</div>
+<div class="line"><a id="l00099" name="l00099"></a><span class="lineno">   99</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj1, 3, 4);</div>
+<div class="line"><a id="l00100" name="l00100"></a><span class="lineno">  100</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj1, 5, 7);</div>
+<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj1, 5, 6);</div>
+<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj1, 8, 9);</div>
+<div class="line"><a id="l00103" name="l00103"></a><span class="lineno">  103</span> </div>
+<div class="line"><a id="l00104" name="l00104"></a><span class="lineno">  104</span>    assert(<a class="code hl_function" href="../../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b">graph::getConnectedComponents</a>(&amp;adj1) == 3);</div>
+<div class="line"><a id="l00105" name="l00105"></a><span class="lineno">  105</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 1 Passed...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00106" name="l00106"></a><span class="lineno">  106</span> </div>
+<div class="line"><a id="l00107" name="l00107"></a><span class="lineno">  107</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Innitiating Test 2...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00108" name="l00108"></a><span class="lineno">  108</span>    std::vector&lt;std::vector&lt;int&gt;&gt; adj2(10, std::vector&lt;int&gt;());</div>
+<div class="line"><a id="l00109" name="l00109"></a><span class="lineno">  109</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 1, 2);</div>
+<div class="line"><a id="l00110" name="l00110"></a><span class="lineno">  110</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 1, 3);</div>
+<div class="line"><a id="l00111" name="l00111"></a><span class="lineno">  111</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 1, 4);</div>
+<div class="line"><a id="l00112" name="l00112"></a><span class="lineno">  112</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 2, 3);</div>
+<div class="line"><a id="l00113" name="l00113"></a><span class="lineno">  113</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 3, 4);</div>
+<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 4, 8);</div>
+<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 4, 10);</div>
+<div class="line"><a id="l00116" name="l00116"></a><span class="lineno">  116</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 8, 10);</div>
+<div class="line"><a id="l00117" name="l00117"></a><span class="lineno">  117</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 8, 9);</div>
+<div class="line"><a id="l00118" name="l00118"></a><span class="lineno">  118</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 5, 7);</div>
+<div class="line"><a id="l00119" name="l00119"></a><span class="lineno">  119</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 5, 6);</div>
+<div class="line"><a id="l00120" name="l00120"></a><span class="lineno">  120</span>    <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj2, 6, 7);</div>
+<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span> </div>
+<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span>    assert(<a class="code hl_function" href="../../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b">graph::getConnectedComponents</a>(&amp;adj2) == 2);</div>
+<div class="line"><a id="l00123" name="l00123"></a><span class="lineno">  123</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Test 2 Passed...&quot;</span> &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00124" name="l00124"></a><span class="lineno">  124</span>}</div>
+</div>
+<div class="line"><a id="l00125" name="l00125"></a><span class="lineno">  125</span> </div>
+<div class="foldopen" id="foldopen00127" data-start="{" data-end="}">
+<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"><a class="line" href="../../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">  127</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00129" name="l00129"></a><span class="lineno">  129</span>    <a class="code hl_function" href="../../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a>();</div>
+<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span> </div>
+<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span>    <span class="keywordtype">int</span> vertices = int(), edges = int();</div>
+<div class="line"><a id="l00132" name="l00132"></a><span class="lineno">  132</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of vertices : &quot;</span>;</div>
+<div class="line"><a id="l00133" name="l00133"></a><span class="lineno">  133</span>    std::cin &gt;&gt; vertices;</div>
+<div class="line"><a id="l00134" name="l00134"></a><span class="lineno">  134</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter the number of edges : &quot;</span>;</div>
+<div class="line"><a id="l00135" name="l00135"></a><span class="lineno">  135</span>    std::cin &gt;&gt; edges;</div>
+<div class="line"><a id="l00136" name="l00136"></a><span class="lineno">  136</span> </div>
+<div class="line"><a id="l00137" name="l00137"></a><span class="lineno">  137</span>    std::vector&lt;std::vector&lt;int&gt;&gt; adj(vertices, std::vector&lt;int&gt;());</div>
+<div class="line"><a id="l00138" name="l00138"></a><span class="lineno">  138</span> </div>
+<div class="line"><a id="l00139" name="l00139"></a><span class="lineno">  139</span>    <span class="keywordtype">int</span> u = int(), v = int();</div>
+<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>    <span class="keywordflow">while</span> (edges--) {</div>
+<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span>        std::cin &gt;&gt; u &gt;&gt; v;</div>
+<div class="line"><a id="l00142" name="l00142"></a><span class="lineno">  142</span>        <a class="code hl_function" href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a>(&amp;adj, u, v);</div>
+<div class="line"><a id="l00143" name="l00143"></a><span class="lineno">  143</span>    }</div>
+<div class="line"><a id="l00144" name="l00144"></a><span class="lineno">  144</span> </div>
+<div class="line"><a id="l00145" name="l00145"></a><span class="lineno">  145</span>    <span class="keywordtype">int</span> cc = <a class="code hl_function" href="../../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b">graph::getConnectedComponents</a>(&amp;adj);</div>
+<div class="line"><a id="l00146" name="l00146"></a><span class="lineno">  146</span>    std::cout &lt;&lt; cc &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00147" name="l00147"></a><span class="lineno">  147</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00148" name="l00148"></a><span class="lineno">  148</span>}</div>
+</div>
+<div class="ttc" id="aconnected__components_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition</b> <a href="#l00093">connected_components.cpp:93</a></div></div>
+<div class="ttc" id="aconnected__components_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00127">connected_components.cpp:127</a></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 class="ttc" id="anamespacegraph_html_a3ae80bc4c6a79d041b4f3a6589eb7fb8"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8">graph::explore</a></div><div class="ttdeci">void explore(const std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, std::vector&lt; bool &gt; *visited)</div><div class="ttdoc">Utility function for depth first seach algorithm this function explores the vertex which is passed in...</div><div class="ttdef"><b>Definition</b> <a href="#l00059">connected_components.cpp:59</a></div></div>
+<div class="ttc" id="anamespacegraph_html_a83ab16e96cec644109a58dfc9329bc2b"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b">graph::getConnectedComponents</a></div><div class="ttdeci">int getConnectedComponents(const std::vector&lt; std::vector&lt; int &gt; &gt; *adj)</div><div class="ttdoc">Function that perfoms depth first search algorithm on graph and calculated the number of connected co...</div><div class="ttdef"><b>Definition</b> <a href="#l00077">connected_components.cpp:77</a></div></div>
+<div class="ttc" id="anamespacegraph_html_a9125ceb66bfbec3093bba64c2c1e99e2"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2">graph::addEdge</a></div><div class="ttdeci">void addEdge(std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, int v)</div><div class="ttdoc">Function that add edge between two nodes or vertices of graph.</div><div class="ttdef"><b>Definition</b> <a href="#l00046">connected_components.cpp:46</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_12552d7fa429bf94a2e32e5cf39f7e69.html">graph</a></li><li class="navelem"><a class="el" href="../../df/ddd/connected__components_8cpp.html">connected_components.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/de3/classqueue-members.html b/df/de3/classqueue-members.html
index 15bf658ac..6a5060a64 100644
--- a/df/de3/classqueue-members.html
+++ b/df/de3/classqueue-members.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Member List</title>
+<title>TheAlgorithms/C++: Member List</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/df/de5/classbacktracking_1_1generate__parentheses.html b/df/de5/classbacktracking_1_1generate__parentheses.html
index 716fb741d..8c699cfda 100644
--- a/df/de5/classbacktracking_1_1generate__parentheses.html
+++ b/df/de5/classbacktracking_1_1generate__parentheses.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: backtracking::generate_parentheses Class Reference</title>
+<title>TheAlgorithms/C++: backtracking::generate_parentheses Class Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -123,25 +140,26 @@ Collaboration diagram for backtracking::generate_parentheses:</div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
 Public Member Functions</h2></td></tr>
-<tr class="memitem:af39c03d80ce0ba9fbf659b420980d160" id="r_af39c03d80ce0ba9fbf659b420980d160"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af39c03d80ce0ba9fbf659b420980d160">generate</a> (int n)</td></tr>
+<tr class="memitem:af39c03d80ce0ba9fbf659b420980d160" id="r_af39c03d80ce0ba9fbf659b420980d160"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::string &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af39c03d80ce0ba9fbf659b420980d160">generate</a> (int n)</td></tr>
 <tr class="memdesc:af39c03d80ce0ba9fbf659b420980d160"><td class="mdescLeft">&#160;</td><td class="mdescRight">wrapper interface  <br /></td></tr>
 <tr class="separator:af39c03d80ce0ba9fbf659b420980d160"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
 Private Member Functions</h2></td></tr>
-<tr class="memitem:ac1489edd65374f22fe04851051f0a2ec" id="r_ac1489edd65374f22fe04851051f0a2ec"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac1489edd65374f22fe04851051f0a2ec">makeStrings</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> str, int n, int closed, int open)</td></tr>
+<tr class="memitem:ac1489edd65374f22fe04851051f0a2ec" id="r_ac1489edd65374f22fe04851051f0a2ec"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac1489edd65374f22fe04851051f0a2ec">makeStrings</a> (std::string str, int n, int closed, int open)</td></tr>
 <tr class="memdesc:ac1489edd65374f22fe04851051f0a2ec"><td class="mdescLeft">&#160;</td><td class="mdescRight">function that adds parenthesis to the string.  <br /></td></tr>
 <tr class="separator:ac1489edd65374f22fe04851051f0a2ec"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
 Private Attributes</h2></td></tr>
-<tr class="memitem:ab35b9b6d2886abed3d6fb05c2be1c508" id="r_ab35b9b6d2886abed3d6fb05c2be1c508"><td class="memItemLeft" align="right" valign="top"><a id="ab35b9b6d2886abed3d6fb05c2be1c508" name="ab35b9b6d2886abed3d6fb05c2be1c508"></a>
-<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>res</b></td></tr>
-<tr class="memdesc:ab35b9b6d2886abed3d6fb05c2be1c508"><td class="mdescLeft">&#160;</td><td class="mdescRight">Contains all possible valid patterns. <br /></td></tr>
+<tr class="memitem:ab35b9b6d2886abed3d6fb05c2be1c508" id="r_ab35b9b6d2886abed3d6fb05c2be1c508"><td class="memItemLeft" align="right" valign="top">std::vector&lt; std::string &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab35b9b6d2886abed3d6fb05c2be1c508">res</a></td></tr>
+<tr class="memdesc:ab35b9b6d2886abed3d6fb05c2be1c508"><td class="mdescLeft">&#160;</td><td class="mdescRight">Contains all possible valid patterns.  <br /></td></tr>
 <tr class="separator:ab35b9b6d2886abed3d6fb05c2be1c508"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p><a class="el" href="../../df/de5/classbacktracking_1_1generate__parentheses.html" title="generate_parentheses class">generate_parentheses</a> class </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00026">26</a> of file <a class="el" href="../../dd/d1e/generate__parentheses_8cpp_source.html">generate_parentheses.cpp</a>.</p>
 </div><h2 class="groupheader">Member Function Documentation</h2>
 <a id="af39c03d80ce0ba9fbf659b420980d160" name="af39c03d80ce0ba9fbf659b420980d160"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#af39c03d80ce0ba9fbf659b420980d160">&#9670;&#160;</a></span>generate()</h2>
@@ -150,7 +168,7 @@ Private Attributes</h2></td></tr>
 <div class="memproto">
       <table class="memname">
         <tr>
-          <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &gt; backtracking::generate_parentheses::generate </td>
+          <td class="memname">std::vector&lt; std::string &gt; backtracking::generate_parentheses::generate </td>
           <td>(</td>
           <td class="paramtype">int</td>          <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
           <td></td>
@@ -166,22 +184,17 @@ Private Attributes</h2></td></tr>
   </dd>
 </dl>
 <dl class="section return"><dt>Returns</dt><dd>all well-formed pattern of parentheses </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00070">70</a> of file <a class="el" href="../../dd/d1e/generate__parentheses_8cpp_source.html">generate_parentheses.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   70</span>                                                         {</div>
-<div class="line"><span class="lineno">   71</span>    <a class="code hl_variable" href="#ab35b9b6d2886abed3d6fb05c2be1c508">backtracking::generate_parentheses::res</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/clear.html">clear</a>();</div>
-<div class="line"><span class="lineno">   72</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> str = <span class="stringliteral">&quot;(&quot;</span>;</div>
+<div class="line"><span class="lineno">   71</span>    <a class="code hl_variable" href="#ab35b9b6d2886abed3d6fb05c2be1c508">backtracking::generate_parentheses::res</a>.clear();</div>
+<div class="line"><span class="lineno">   72</span>    std::string str = <span class="stringliteral">&quot;(&quot;</span>;</div>
 <div class="line"><span class="lineno">   73</span>    <a class="code hl_function" href="#ac1489edd65374f22fe04851051f0a2ec">generate_parentheses::makeStrings</a>(str, n, 0, 1);</div>
 <div class="line"><span class="lineno">   74</span>    <span class="keywordflow">return</span> <a class="code hl_variable" href="#ab35b9b6d2886abed3d6fb05c2be1c508">res</a>;</div>
 <div class="line"><span class="lineno">   75</span>}</div>
-<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
-<div class="ttc" id="aclassbacktracking_1_1generate__parentheses_html_ab35b9b6d2886abed3d6fb05c2be1c508"><div class="ttname"><a href="#ab35b9b6d2886abed3d6fb05c2be1c508">backtracking::generate_parentheses::res</a></div><div class="ttdeci">std::vector&lt; std::string &gt; res</div><div class="ttdoc">Contains all possible valid patterns.</div><div class="ttdef"><b>Definition</b> generate_parentheses.cpp:28</div></div>
-<div class="ttc" id="aclassbacktracking_1_1generate__parentheses_html_ac1489edd65374f22fe04851051f0a2ec"><div class="ttname"><a href="#ac1489edd65374f22fe04851051f0a2ec">backtracking::generate_parentheses::makeStrings</a></div><div class="ttdeci">void makeStrings(std::string str, int n, int closed, int open)</div><div class="ttdoc">function that adds parenthesis to the string.</div><div class="ttdef"><b>Definition</b> generate_parentheses.cpp:45</div></div>
-<div class="ttc" id="aclear_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/clear.html">std::vector::clear</a></div><div class="ttdeci">T clear(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/de5/classbacktracking_1_1generate__parentheses_af39c03d80ce0ba9fbf659b420980d160_cgraph.svg" width="599" height="142"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aclassbacktracking_1_1generate__parentheses_html_ab35b9b6d2886abed3d6fb05c2be1c508"><div class="ttname"><a href="#ab35b9b6d2886abed3d6fb05c2be1c508">backtracking::generate_parentheses::res</a></div><div class="ttdeci">std::vector&lt; std::string &gt; res</div><div class="ttdoc">Contains all possible valid patterns.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00028">generate_parentheses.cpp:28</a></div></div>
+<div class="ttc" id="aclassbacktracking_1_1generate__parentheses_html_ac1489edd65374f22fe04851051f0a2ec"><div class="ttname"><a href="#ac1489edd65374f22fe04851051f0a2ec">backtracking::generate_parentheses::makeStrings</a></div><div class="ttdeci">void makeStrings(std::string str, int n, int closed, int open)</div><div class="ttdoc">function that adds parenthesis to the string.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00045">generate_parentheses.cpp:45</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="ac1489edd65374f22fe04851051f0a2ec" name="ac1489edd65374f22fe04851051f0a2ec"></a>
@@ -196,7 +209,7 @@ Here is the call graph for this function:</div>
         <tr>
           <td class="memname">void backtracking::generate_parentheses::makeStrings </td>
           <td>(</td>
-          <td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
+          <td class="paramtype">std::string</td>          <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
         </tr>
         <tr>
           <td class="paramkey"></td>
@@ -231,35 +244,57 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00045">45</a> of file <a class="el" href="../../dd/d1e/generate__parentheses_8cpp_source.html">generate_parentheses.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   46</span>                                                                           {</div>
 <div class="line"><span class="lineno">   47</span>    <span class="keywordflow">if</span> (closed &gt; open)  <span class="comment">// We can never have more closed than open</span></div>
 <div class="line"><span class="lineno">   48</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">   49</span> </div>
-<div class="line"><span class="lineno">   50</span>    <span class="keywordflow">if</span> ((str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>() == 2 * n) &amp;&amp;</div>
+<div class="line"><span class="lineno">   50</span>    <span class="keywordflow">if</span> ((str.length() == 2 * n) &amp;&amp;</div>
 <div class="line"><span class="lineno">   51</span>        (closed != open)) {  <span class="comment">// closed and open must be the same</span></div>
 <div class="line"><span class="lineno">   52</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">   53</span>    }</div>
 <div class="line"><span class="lineno">   54</span> </div>
-<div class="line"><span class="lineno">   55</span>    <span class="keywordflow">if</span> (str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>() == 2 * n) {</div>
-<div class="line"><span class="lineno">   56</span>        <a class="code hl_variable" href="#ab35b9b6d2886abed3d6fb05c2be1c508">res</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(str);</div>
+<div class="line"><span class="lineno">   55</span>    <span class="keywordflow">if</span> (str.length() == 2 * n) {</div>
+<div class="line"><span class="lineno">   56</span>        <a class="code hl_variable" href="#ab35b9b6d2886abed3d6fb05c2be1c508">res</a>.push_back(str);</div>
 <div class="line"><span class="lineno">   57</span>        <span class="keywordflow">return</span>;</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>    <a class="code hl_function" href="#ac1489edd65374f22fe04851051f0a2ec">makeStrings</a>(str + <span class="charliteral">&#39;)&#39;</span>, n, closed + 1, open);</div>
 <div class="line"><span class="lineno">   61</span>    <a class="code hl_function" href="#ac1489edd65374f22fe04851051f0a2ec">makeStrings</a>(str + <span class="charliteral">&#39;(&#39;</span>, n, closed, open + 1);</div>
 <div class="line"><span class="lineno">   62</span>}</div>
-<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::length</a></div><div class="ttdeci">T length(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.svg" width="394" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+</div><!-- fragment -->
 </div>
+</div>
+<h2 class="groupheader">Member Data Documentation</h2>
+<a id="ab35b9b6d2886abed3d6fb05c2be1c508" name="ab35b9b6d2886abed3d6fb05c2be1c508"></a>
+<h2 class="memtitle"><span class="permalink"><a href="#ab35b9b6d2886abed3d6fb05c2be1c508">&#9670;&#160;</a></span>res</h2>
+
+<div class="memitem">
+<div class="memproto">
+<table class="mlabels">
+  <tr>
+  <td class="mlabels-left">
+      <table class="memname">
+        <tr>
+          <td class="memname">std::vector&lt;std::string&gt; backtracking::generate_parentheses::res</td>
+        </tr>
+      </table>
+  </td>
+  <td class="mlabels-right">
+<span class="mlabels"><span class="mlabel">private</span></span>  </td>
+  </tr>
+</table>
+</div><div class="memdoc">
+
+<p>Contains all possible valid patterns. </p>
+
+<p class="definition">Definition at line <a class="el" href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../dd/d1e/generate__parentheses_8cpp_source.html">generate_parentheses.cpp</a>.</p>
 
 </div>
 </div>
 <hr/>The documentation for this class was generated from the following file:<ul>
-<li>backtracking/<a class="el" href="../../dd/d1e/generate__parentheses_8cpp.html">generate_parentheses.cpp</a></li>
+<li>backtracking/<a class="el" href="../../dd/d1e/generate__parentheses_8cpp_source.html">generate_parentheses.cpp</a></li>
 </ul>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.map b/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.map
deleted file mode 100644
index b81fa5ac2..000000000
--- a/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.map
+++ /dev/null
@@ -1,8 +0,0 @@
-<map id="backtracking::generate_parentheses::makeStrings" name="backtracking::generate_parentheses::makeStrings">
-<area shape="rect" id="Node000001" title="function that adds parenthesis to the string." alt="" coords="5,29,186,70"/>
-<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="55,29,53,19,59,10,74,5,96,3,119,5,133,11,131,16,117,10,95,8,75,10,63,15,58,21,60,28"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="250,12,372,37"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="185,36,234,31,234,36,186,42"/>
-<area shape="rect" id="Node000003" 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="234,61,388,86"/>
-<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="186,57,218,61,218,66,185,62"/>
-</map>
diff --git a/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.md5 b/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.md5
deleted file mode 100644
index 3bf9e4aa5..000000000
--- a/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-dc78b92bd61c2693e50391c7882bab8a
\ No newline at end of file
diff --git a/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.svg b/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.svg
deleted file mode 100644
index 2fbad41df..000000000
--- a/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph.svg
+++ /dev/null
@@ -1,93 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::generate_parentheses::makeStrings Pages: 1 -->
-<svg width="295pt" height="69pt"
- viewBox="0.00 0.00 295.00 68.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64.88)">
-<title>backtracking::generate_parentheses::makeStrings</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="function that adds parenthesis to the string.">
-<polygon fill="#999999" stroke="#666666" points="135.25,-42.88 0,-42.88 0,-12.37 135.25,-12.37 135.25,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="67.62" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::makeStrings</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.01,-43.36C33.17,-52.43 42.71,-60.88 67.62,-60.88 81.25,-60.88 90.28,-58.35 94.71,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.15,-55.24 96.04,-44.86 91.21,-54.29 98.15,-55.24"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275,-56.25 183.25,-56.25 183.25,-37 275,-37 275,-56.25"/>
-<text text-anchor="middle" x="229.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.34,-35.57C147.38,-37.01 159.82,-38.49 171.54,-39.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.12,-43.36 181.46,-41.07 171.95,-36.41 171.12,-43.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="287,-19.25 171.25,-19.25 171.25,0 287,0 287,-19.25"/>
-<text text-anchor="middle" x="229.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.34,-20.1C143.35,-19.19 151.54,-18.27 159.57,-17.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.74,-20.86 169.28,-16.27 158.95,-13.91 159.74,-20.86"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph_org.svg b/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph_org.svg
deleted file mode 100644
index 1f98c8f15..000000000
--- a/df/de5/classbacktracking_1_1generate__parentheses_ac1489edd65374f22fe04851051f0a2ec_cgraph_org.svg
+++ /dev/null
@@ -1,67 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::generate_parentheses::makeStrings Pages: 1 -->
-<svg width="295pt" height="69pt"
- viewBox="0.00 0.00 295.00 68.88" 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 64.88)">
-<title>backtracking::generate_parentheses::makeStrings</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="function that adds parenthesis to the string.">
-<polygon fill="#999999" stroke="#666666" points="135.25,-42.88 0,-42.88 0,-12.37 135.25,-12.37 135.25,-42.88"/>
-<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="67.62" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::makeStrings</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node1 -->
-<g id="edge2_Node000001_Node000001" class="edge">
-<title>Node1&#45;&gt;Node1</title>
-<g id="a_edge2_Node000001_Node000001"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M39.01,-43.36C33.17,-52.43 42.71,-60.88 67.62,-60.88 81.25,-60.88 90.28,-58.35 94.71,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="98.15,-55.24 96.04,-44.86 91.21,-54.29 98.15,-55.24"/>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="275,-56.25 183.25,-56.25 183.25,-37 275,-37 275,-56.25"/>
-<text text-anchor="middle" x="229.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.34,-35.57C147.38,-37.01 159.82,-38.49 171.54,-39.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="171.12,-43.36 181.46,-41.07 171.95,-36.41 171.12,-43.36"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="287,-19.25 171.25,-19.25 171.25,0 287,0 287,-19.25"/>
-<text text-anchor="middle" x="229.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge3_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M135.34,-20.1C143.35,-19.19 151.54,-18.27 159.57,-17.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="159.74,-20.86 169.28,-16.27 158.95,-13.91 159.74,-20.86"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/de5/classbacktracking_1_1generate__parentheses_af39c03d80ce0ba9fbf659b420980d160_cgraph.map b/df/de5/classbacktracking_1_1generate__parentheses_af39c03d80ce0ba9fbf659b420980d160_cgraph.map
deleted file mode 100644
index b6e802a8d..000000000
--- a/df/de5/classbacktracking_1_1generate__parentheses_af39c03d80ce0ba9fbf659b420980d160_cgraph.map
+++ /dev/null
@@ -1,12 +0,0 @@
-<map id="backtracking::generate_parentheses::generate" name="backtracking::generate_parentheses::generate">
-<area shape="rect" id="Node000001" title="wrapper interface" alt="" coords="5,39,163,80"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/clear.html#" title=" " alt="" coords="241,5,360,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="163,42,225,30,226,35,164,47"/>
-<area shape="rect" id="Node000003" href="$df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" title="function that adds parenthesis to the string." alt="" coords="211,79,391,120"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="164,71,195,77,194,83,163,77"/>
-<area shape="poly" id="edge4_Node000003_Node000003" title=" " alt="" coords="260,79,258,69,265,60,279,55,301,53,324,55,338,61,336,66,323,60,301,58,280,60,268,64,263,70,265,78"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="455,61,577,87"/>
-<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="391,86,439,81,440,86,391,92"/>
-<area shape="rect" id="Node000005" 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="439,111,593,136"/>
-<area shape="poly" id="edge5_Node000003_Node000005" title=" " alt="" coords="391,107,424,111,423,116,391,112"/>
-</map>
diff --git a/df/de5/classbacktracking_1_1generate__parentheses_af39c03d80ce0ba9fbf659b420980d160_cgraph.md5 b/df/de5/classbacktracking_1_1generate__parentheses_af39c03d80ce0ba9fbf659b420980d160_cgraph.md5
deleted file mode 100644
index abda998d0..000000000
--- a/df/de5/classbacktracking_1_1generate__parentheses_af39c03d80ce0ba9fbf659b420980d160_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-53fe3aa68c5ae52908ea0c33dfc3dd40
\ No newline at end of file
diff --git a/df/de5/classbacktracking_1_1generate__parentheses_af39c03d80ce0ba9fbf659b420980d160_cgraph.svg b/df/de5/classbacktracking_1_1generate__parentheses_af39c03d80ce0ba9fbf659b420980d160_cgraph.svg
deleted file mode 100644
index 38729fad1..000000000
--- a/df/de5/classbacktracking_1_1generate__parentheses_af39c03d80ce0ba9fbf659b420980d160_cgraph.svg
+++ /dev/null
@@ -1,130 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::generate_parentheses::generate Pages: 1 -->
-<svg width="449pt" height="106pt"
- viewBox="0.00 0.00 449.00 106.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 102.25)">
-<title>backtracking::generate_parentheses::generate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="wrapper interface">
-<polygon fill="#999999" stroke="#666666" points="118,-72.88 0,-72.88 0,-42.38 118,-42.38 118,-72.88"/>
-<text text-anchor="start" x="8" y="-59.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="59" y="-48.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::generate</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.38,-98.25 176.88,-98.25 176.88,-79 266.38,-79 266.38,-98.25"/>
-<text text-anchor="middle" x="221.62" y="-84.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.44,-68.9C133.74,-71.86 150.18,-75.03 165.31,-77.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.61,-81.38 175.1,-79.84 165.94,-74.51 164.61,-81.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" target="_top" xlink:title="function that adds parenthesis to the string.">
-<polygon fill="white" stroke="#666666" points="289.25,-42.88 154,-42.88 154,-12.37 289.25,-12.37 289.25,-42.88"/>
-<text text-anchor="start" x="162" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="221.62" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::makeStrings</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.44,-46.71C126.19,-45.26 134.22,-43.76 142.23,-42.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.83,-45.71 152.02,-40.44 141.55,-38.83 142.83,-45.71"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.01,-43.36C187.17,-52.43 196.71,-60.88 221.62,-60.88 235.25,-60.88 244.28,-58.35 248.71,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="252.15,-55.24 250.04,-44.86 245.21,-54.29 252.15,-55.24"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="429,-56.25 337.25,-56.25 337.25,-37 429,-37 429,-56.25"/>
-<text text-anchor="middle" x="383.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M289.34,-35.57C301.38,-37.01 313.82,-38.49 325.54,-39.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.12,-43.36 335.46,-41.07 325.95,-36.41 325.12,-43.36"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441,-19.25 325.25,-19.25 325.25,0 441,0 441,-19.25"/>
-<text text-anchor="middle" x="383.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge5_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge5_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M289.34,-20.1C297.35,-19.19 305.54,-18.27 313.57,-17.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.74,-20.86 323.28,-16.27 312.95,-13.91 313.74,-20.86"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/de5/classbacktracking_1_1generate__parentheses_af39c03d80ce0ba9fbf659b420980d160_cgraph_org.svg b/df/de5/classbacktracking_1_1generate__parentheses_af39c03d80ce0ba9fbf659b420980d160_cgraph_org.svg
deleted file mode 100644
index def70aca3..000000000
--- a/df/de5/classbacktracking_1_1generate__parentheses_af39c03d80ce0ba9fbf659b420980d160_cgraph_org.svg
+++ /dev/null
@@ -1,104 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: backtracking::generate_parentheses::generate Pages: 1 -->
-<svg width="449pt" height="106pt"
- viewBox="0.00 0.00 449.00 106.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 102.25)">
-<title>backtracking::generate_parentheses::generate</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="wrapper interface">
-<polygon fill="#999999" stroke="#666666" points="118,-72.88 0,-72.88 0,-42.38 118,-42.38 118,-72.88"/>
-<text text-anchor="start" x="8" y="-59.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="59" y="-48.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::generate</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="266.38,-98.25 176.88,-98.25 176.88,-79 266.38,-79 266.38,-98.25"/>
-<text text-anchor="middle" x="221.62" y="-84.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.44,-68.9C133.74,-71.86 150.18,-75.03 165.31,-77.95"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="164.61,-81.38 175.1,-79.84 165.94,-74.51 164.61,-81.38"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec" target="_top" xlink:title="function that adds parenthesis to the string.">
-<polygon fill="white" stroke="#666666" points="289.25,-42.88 154,-42.88 154,-12.37 289.25,-12.37 289.25,-42.88"/>
-<text text-anchor="start" x="162" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::generate</text>
-<text text-anchor="middle" x="221.62" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_parentheses::makeStrings</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M118.44,-46.71C126.19,-45.26 134.22,-43.76 142.23,-42.27"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="142.83,-45.71 152.02,-40.44 141.55,-38.83 142.83,-45.71"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge4_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge4_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M193.01,-43.36C187.17,-52.43 196.71,-60.88 221.62,-60.88 235.25,-60.88 244.28,-58.35 248.71,-54.58"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="252.15,-55.24 250.04,-44.86 245.21,-54.29 252.15,-55.24"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="429,-56.25 337.25,-56.25 337.25,-37 429,-37 429,-56.25"/>
-<text text-anchor="middle" x="383.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge3_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M289.34,-35.57C301.38,-37.01 313.82,-38.49 325.54,-39.88"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="325.12,-43.36 335.46,-41.07 325.95,-36.41 325.12,-43.36"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="441,-19.25 325.25,-19.25 325.25,0 441,0 441,-19.25"/>
-<text text-anchor="middle" x="383.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node5 -->
-<g id="edge5_Node000003_Node000005" class="edge">
-<title>Node3&#45;&gt;Node5</title>
-<g id="a_edge5_Node000003_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M289.34,-20.1C297.35,-19.19 305.54,-18.27 313.57,-17.36"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="313.74,-20.86 323.28,-16.27 312.95,-13.91 313.74,-20.86"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/dea/namespacefalse__position.html b/df/dea/namespacefalse__position.html
index b5fe85054..016e9ac96 100644
--- a/df/dea/namespacefalse__position.html
+++ b/df/dea/namespacefalse__position.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: false_position Namespace Reference</title>
+<title>TheAlgorithms/C++: false_position Namespace Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/df/def/power__for__huge__numbers_8cpp.html b/df/def/power__for__huge__numbers_8cpp.html
index 17f9dd565..91036b8d2 100644
--- a/df/def/power__for__huge__numbers_8cpp.html
+++ b/df/def/power__for__huge__numbers_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math/power_for_huge_numbers.cpp File Reference</title>
+<title>TheAlgorithms/C++: math/power_for_huge_numbers.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -119,7 +136,9 @@ Include dependency graph for power_for_huge_numbers.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d8e/power__for__huge__numbers_8cpp__incl.svg" width="158" height="126"><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">
+</div>
+<p><a href="../../df/def/power__for__huge__numbers_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="define-members" name="define-members"></a>
 Macros</h2></td></tr>
 <tr class="memitem:a392fb874e547e582e9c66a08a1f23326" id="r_a392fb874e547e582e9c66a08a1f23326"><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a392fb874e547e582e9c66a08a1f23326">MAX</a>&#160;&#160;&#160;100000</td></tr>
@@ -136,6 +155,8 @@ Functions</h2></td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
 <div class="textblock"><p>Compute powers of large numbers. </p>
+
+<p class="definition">Definition in file <a class="el" href="../../df/def/power__for__huge__numbers_8cpp_source.html">power_for_huge_numbers.cpp</a>.</p>
 </div><h2 class="groupheader">Macro Definition Documentation</h2>
 <a id="a392fb874e547e582e9c66a08a1f23326" name="a392fb874e547e582e9c66a08a1f23326"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#a392fb874e547e582e9c66a08a1f23326">&#9670;&#160;</a></span>MAX</h2>
@@ -150,6 +171,8 @@ Functions</h2></td></tr>
 </div><div class="memdoc">
 <p>Maximum number of digits in output \(x^n\) where \(1 &lt;= x,\; n &lt;= 10000\) and overflow may happen </p>
 
+<p class="definition">Definition at line <a class="el" href="../../df/def/power__for__huge__numbers_8cpp_source.html#l00010">10</a> of file <a class="el" href="../../df/def/power__for__huge__numbers_8cpp_source.html">power_for_huge_numbers.cpp</a>.</p>
+
 </div>
 </div>
 <h2 class="groupheader">Function Documentation</h2>
@@ -168,24 +191,19 @@ Functions</h2></td></tr>
       </table>
 </div><div class="memdoc">
 <p>Main function </p>
+
+<p class="definition">Definition at line <a class="el" href="../../df/def/power__for__huge__numbers_8cpp_source.html#l00082">82</a> of file <a class="el" href="../../df/def/power__for__huge__numbers_8cpp_source.html">power_for_huge_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   82</span>           {</div>
 <div class="line"><span class="lineno">   83</span>    <span class="keywordtype">int</span> exponent, base;</div>
-<div class="line"><span class="lineno">   84</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter base &quot;</span>;</div>
-<div class="line"><span class="lineno">   85</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; base;</div>
-<div class="line"><span class="lineno">   86</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter exponent &quot;</span>;</div>
-<div class="line"><span class="lineno">   87</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; exponent;</div>
+<div class="line"><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter base &quot;</span>;</div>
+<div class="line"><span class="lineno">   85</span>    std::cin &gt;&gt; base;</div>
+<div class="line"><span class="lineno">   86</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter exponent &quot;</span>;</div>
+<div class="line"><span class="lineno">   87</span>    std::cin &gt;&gt; exponent;</div>
 <div class="line"><span class="lineno">   88</span>    <a class="code hl_function" href="#ae249a2af508aa94266023ce8aa81426f">power</a>(base, exponent);</div>
 <div class="line"><span class="lineno">   89</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   90</span>}</div>
-<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae249a2af508aa94266023ce8aa81426f"><div class="ttname"><a href="#ae249a2af508aa94266023ce8aa81426f">power</a></div><div class="ttdeci">void power(int x, int n)</div><div class="ttdef"><b>Definition</b> power_for_huge_numbers.cpp:56</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="279" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae249a2af508aa94266023ce8aa81426f"><div class="ttname"><a href="#ae249a2af508aa94266023ce8aa81426f">power</a></div><div class="ttdeci">void power(int x, int n)</div><div class="ttdef"><b>Definition</b> <a href="../../df/def/power__for__huge__numbers_8cpp_source.html#l00056">power_for_huge_numbers.cpp:56</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 <a id="aa141a7904f0c4668bac112d652a3acf9" name="aa141a7904f0c4668bac112d652a3acf9"></a>
@@ -219,6 +237,8 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/def/power__for__huge__numbers_8cpp_source.html#l00025">25</a> of file <a class="el" href="../../df/def/power__for__huge__numbers_8cpp_source.html">power_for_huge_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   25</span>                                             {</div>
 <div class="line"><span class="lineno">   26</span>    <span class="comment">// Initialize carry</span></div>
 <div class="line"><span class="lineno">   27</span>    <span class="keywordtype">int</span> carry = 0;</div>
@@ -273,10 +293,12 @@ Here is the call graph for this function:</div>
   </table>
   </dd>
 </dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/def/power__for__huge__numbers_8cpp_source.html#l00056">56</a> of file <a class="el" href="../../df/def/power__for__huge__numbers_8cpp_source.html">power_for_huge_numbers.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   56</span>                         {</div>
 <div class="line"><span class="lineno">   57</span>    <span class="comment">// printing value &quot;1&quot; for power = 0</span></div>
 <div class="line"><span class="lineno">   58</span>    <span class="keywordflow">if</span> (n == 0) {</div>
-<div class="line"><span class="lineno">   59</span>        <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;1&quot;</span>;</div>
+<div class="line"><span class="lineno">   59</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;1&quot;</span>;</div>
 <div class="line"><span class="lineno">   60</span>        <span class="keywordflow">return</span>;</div>
 <div class="line"><span class="lineno">   61</span>    }</div>
 <div class="line"><span class="lineno">   62</span> </div>
@@ -294,17 +316,12 @@ Here is the call graph for this function:</div>
 <div class="line"><span class="lineno">   74</span>    <span class="comment">// (x^n = x*x*x....n times)</span></div>
 <div class="line"><span class="lineno">   75</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i &lt;= n; i++) res_size = <a class="code hl_function" href="#aa141a7904f0c4668bac112d652a3acf9">multiply</a>(x, res, res_size);</div>
 <div class="line"><span class="lineno">   76</span> </div>
-<div class="line"><span class="lineno">   77</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;^&quot;</span> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; = &quot;</span>;</div>
-<div class="line"><span class="lineno">   78</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = res_size - 1; i &gt;= 0; i--) <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; res[i];</div>
+<div class="line"><span class="lineno">   77</span>    std::cout &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;^&quot;</span> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; = &quot;</span>;</div>
+<div class="line"><span class="lineno">   78</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = res_size - 1; i &gt;= 0; i--) std::cout &lt;&lt; res[i];</div>
 <div class="line"><span class="lineno">   79</span>}</div>
-<div class="ttc" id="apower__for__huge__numbers_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdef"><b>Definition</b> power_for_huge_numbers.cpp:10</div></div>
-<div class="ttc" id="apower__for__huge__numbers_8cpp_html_aa141a7904f0c4668bac112d652a3acf9"><div class="ttname"><a href="#aa141a7904f0c4668bac112d652a3acf9">multiply</a></div><div class="ttdeci">int multiply(int x, int res[], int res_size)</div><div class="ttdef"><b>Definition</b> power_for_huge_numbers.cpp:25</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.svg" width="182" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="apower__for__huge__numbers_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdef"><b>Definition</b> <a href="../../df/def/power__for__huge__numbers_8cpp_source.html#l00010">power_for_huge_numbers.cpp:10</a></div></div>
+<div class="ttc" id="apower__for__huge__numbers_8cpp_html_aa141a7904f0c4668bac112d652a3acf9"><div class="ttname"><a href="#aa141a7904f0c4668bac112d652a3acf9">multiply</a></div><div class="ttdeci">int multiply(int x, int res[], int res_size)</div><div class="ttdef"><b>Definition</b> <a href="../../df/def/power__for__huge__numbers_8cpp_source.html#l00025">power_for_huge_numbers.cpp:25</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.map b/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.map
deleted file mode 100644
index a8918d386..000000000
--- a/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.map
+++ /dev/null
@@ -1,5 +0,0 @@
-<map id="power" name="power">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,62,31"/>
-<area shape="rect" id="Node000002" href="$df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" title=" " alt="" coords="110,5,176,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="62,16,94,16,94,21,62,21"/>
-</map>
diff --git a/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.md5 b/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.md5
deleted file mode 100644
index 38d641b01..000000000
--- a/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-bca904e090a799dbfda5d017822f5ace
\ No newline at end of file
diff --git a/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.svg b/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.svg
deleted file mode 100644
index 2825b08d8..000000000
--- a/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.svg
+++ /dev/null
@@ -1,65 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: power Pages: 1 -->
-<svg width="136pt" height="27pt"
- viewBox="0.00 0.00 136.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>power</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="42.25,-19.25 0,-19.25 0,0 42.25,0 42.25,-19.25"/>
-<text text-anchor="middle" x="21.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="128,-19.25 78.25,-19.25 78.25,0 128,0 128,-19.25"/>
-<text text-anchor="middle" x="103.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.73,-9.62C50.03,-9.62 58.46,-9.62 66.65,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.38,-13.13 76.38,-9.63 66.38,-6.13 66.38,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph_org.svg b/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph_org.svg
deleted file mode 100644
index 179d0deec..000000000
--- a/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph_org.svg
+++ /dev/null
@@ -1,39 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: power Pages: 1 -->
-<svg width="136pt" height="27pt"
- viewBox="0.00 0.00 136.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>power</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="42.25,-19.25 0,-19.25 0,0 42.25,0 42.25,-19.25"/>
-<text text-anchor="middle" x="21.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="128,-19.25 78.25,-19.25 78.25,0 128,0 128,-19.25"/>
-<text text-anchor="middle" x="103.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M42.73,-9.62C50.03,-9.62 58.46,-9.62 66.65,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="66.38,-13.13 76.38,-9.63 66.38,-6.13 66.38,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 935b03ab9..000000000
--- a/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,7 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title=" " alt="" coords="5,5,55,31"/>
-<area shape="rect" id="Node000002" href="$df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" title=" " alt="" coords="103,5,159,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,16,87,16,87,21,55,21"/>
-<area shape="rect" id="Node000003" href="$df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" title=" " alt="" coords="207,5,273,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="160,16,192,16,192,21,160,21"/>
-</map>
diff --git a/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index e9516afc4..000000000
--- a/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-6c2f49db8978fbaa55feafa3a142af7c
\ No newline at end of file
diff --git a/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index fb54a6b58..000000000
--- a/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,83 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="209pt" height="27pt"
- viewBox="0.00 0.00 209.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="115.25,-19.25 73,-19.25 73,0 115.25,0 115.25,-19.25"/>
-<text text-anchor="middle" x="94.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-9.62C44.55,-9.62 53.13,-9.62 61.37,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.09,-13.13 71.09,-9.63 61.09,-6.13 61.09,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201,-19.25 151.25,-19.25 151.25,0 201,0 201,-19.25"/>
-<text text-anchor="middle" x="176.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.73,-9.62C123.03,-9.62 131.46,-9.62 139.65,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.38,-13.13 149.38,-9.63 139.38,-6.13 139.38,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index 8c8ae4221..000000000
--- a/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,57 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="209pt" height="27pt"
- viewBox="0.00 0.00 209.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title=" ">
-<polygon fill="#999999" stroke="#666666" points="37,-19.25 0,-19.25 0,0 37,0 37,-19.25"/>
-<text text-anchor="middle" x="18.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="115.25,-19.25 73,-19.25 73,0 115.25,0 115.25,-19.25"/>
-<text text-anchor="middle" x="94.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">power</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.32,-9.62C44.55,-9.62 53.13,-9.62 61.37,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="61.09,-13.13 71.09,-9.63 61.09,-6.13 61.09,-13.13"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="201,-19.25 151.25,-19.25 151.25,0 201,0 201,-19.25"/>
-<text text-anchor="middle" x="176.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">multiply</text>
-</a>
-</g>
-</g>
-<!-- Node2&#45;&gt;Node3 -->
-<g id="edge2_Node000002_Node000003" class="edge">
-<title>Node2&#45;&gt;Node3</title>
-<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M115.73,-9.62C123.03,-9.62 131.46,-9.62 139.65,-9.62"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="139.38,-13.13 149.38,-9.63 139.38,-6.13 139.38,-13.13"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/def/power__for__huge__numbers_8cpp_source.html b/df/def/power__for__huge__numbers_8cpp_source.html
new file mode 100644
index 000000000..d9279464d
--- /dev/null
+++ b/df/def/power__for__huge__numbers_8cpp_source.html
@@ -0,0 +1,213 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: math/power_for_huge_numbers.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/def/power__for__huge__numbers_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">power_for_huge_numbers.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../df/def/power__for__huge__numbers_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
+<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span> </div>
+<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"><a class="line" href="../../df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326">   10</a></span><span class="preprocessor">#define MAX 100000</span></div>
+<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span> </div>
+<div class="foldopen" id="foldopen00025" data-start="{" data-end="}">
+<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"><a class="line" href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">   25</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">multiply</a>(<span class="keywordtype">int</span> x, <span class="keywordtype">int</span> res[], <span class="keywordtype">int</span> res_size) {</div>
+<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span>    <span class="comment">// Initialize carry</span></div>
+<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span>    <span class="keywordtype">int</span> carry = 0;</div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span> </div>
+<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span>    <span class="comment">// One by one multiply n with</span></div>
+<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span>    <span class="comment">// individual digits of res[]</span></div>
+<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; res_size; i++) {</div>
+<div class="line"><a id="l00032" name="l00032"></a><span class="lineno">   32</span>        <span class="keywordtype">int</span> prod = res[i] * x + carry;</div>
+<div class="line"><a id="l00033" name="l00033"></a><span class="lineno">   33</span> </div>
+<div class="line"><a id="l00034" name="l00034"></a><span class="lineno">   34</span>        <span class="comment">// Store last digit of</span></div>
+<div class="line"><a id="l00035" name="l00035"></a><span class="lineno">   35</span>        <span class="comment">// &#39;prod&#39; in res[]</span></div>
+<div class="line"><a id="l00036" name="l00036"></a><span class="lineno">   36</span>        res[i] = prod % 10;</div>
+<div class="line"><a id="l00037" name="l00037"></a><span class="lineno">   37</span> </div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span>        <span class="comment">// Put rest in carry</span></div>
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno">   39</span>        carry = prod / 10;</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>    }</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span> </div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>    <span class="comment">// Put carry in res and</span></div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    <span class="comment">// increase result size</span></div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span>    <span class="keywordflow">while</span> (carry) {</div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>        res[res_size] = carry % 10;</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>        carry = carry / 10;</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span>        res_size++;</div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    }</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>    <span class="keywordflow">return</span> res_size;</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>}</div>
+</div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="foldopen" id="foldopen00056" data-start="{" data-end="}">
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">   56</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a>(<span class="keywordtype">int</span> x, <span class="keywordtype">int</span> n) {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    <span class="comment">// printing value &quot;1&quot; for power = 0</span></div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordflow">if</span> (n == 0) {</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>        std::cout &lt;&lt; <span class="stringliteral">&quot;1&quot;</span>;</div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>        <span class="keywordflow">return</span>;</div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>    }</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span> </div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>    <span class="keywordtype">int</span> res[<a class="code hl_define" href="../../df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a>];</div>
+<div class="line"><a id="l00064" name="l00064"></a><span class="lineno">   64</span>    <span class="keywordtype">int</span> res_size = 0;</div>
+<div class="line"><a id="l00065" name="l00065"></a><span class="lineno">   65</span>    <span class="keywordtype">int</span> temp = x;</div>
+<div class="line"><a id="l00066" name="l00066"></a><span class="lineno">   66</span> </div>
+<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>    <span class="comment">// Initialize result</span></div>
+<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span>    <span class="keywordflow">while</span> (temp != 0) {</div>
+<div class="line"><a id="l00069" name="l00069"></a><span class="lineno">   69</span>        res[res_size++] = temp % 10;</div>
+<div class="line"><a id="l00070" name="l00070"></a><span class="lineno">   70</span>        temp = temp / 10;</div>
+<div class="line"><a id="l00071" name="l00071"></a><span class="lineno">   71</span>    }</div>
+<div class="line"><a id="l00072" name="l00072"></a><span class="lineno">   72</span> </div>
+<div class="line"><a id="l00073" name="l00073"></a><span class="lineno">   73</span>    <span class="comment">// Multiply x n times</span></div>
+<div class="line"><a id="l00074" name="l00074"></a><span class="lineno">   74</span>    <span class="comment">// (x^n = x*x*x....n times)</span></div>
+<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 2; i &lt;= n; i++) res_size = <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">multiply</a>(x, res, res_size);</div>
+<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
+<div class="line"><a id="l00077" name="l00077"></a><span class="lineno">   77</span>    std::cout &lt;&lt; x &lt;&lt; <span class="stringliteral">&quot;^&quot;</span> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; = &quot;</span>;</div>
+<div class="line"><a id="l00078" name="l00078"></a><span class="lineno">   78</span>    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = res_size - 1; i &gt;= 0; i--) std::cout &lt;&lt; res[i];</div>
+<div class="line"><a id="l00079" name="l00079"></a><span class="lineno">   79</span>}</div>
+</div>
+<div class="line"><a id="l00080" name="l00080"></a><span class="lineno">   80</span> </div>
+<div class="foldopen" id="foldopen00082" data-start="{" data-end="}">
+<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"><a class="line" href="../../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   82</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00083" name="l00083"></a><span class="lineno">   83</span>    <span class="keywordtype">int</span> exponent, base;</div>
+<div class="line"><a id="l00084" name="l00084"></a><span class="lineno">   84</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter base &quot;</span>;</div>
+<div class="line"><a id="l00085" name="l00085"></a><span class="lineno">   85</span>    std::cin &gt;&gt; base;</div>
+<div class="line"><a id="l00086" name="l00086"></a><span class="lineno">   86</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Enter exponent &quot;</span>;</div>
+<div class="line"><a id="l00087" name="l00087"></a><span class="lineno">   87</span>    std::cin &gt;&gt; exponent;</div>
+<div class="line"><a id="l00088" name="l00088"></a><span class="lineno">   88</span>    <a class="code hl_function" href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a>(base, exponent);</div>
+<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span>}</div>
+</div>
+<div class="ttc" id="apower__for__huge__numbers_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdef"><b>Definition</b> <a href="#l00010">power_for_huge_numbers.cpp:10</a></div></div>
+<div class="ttc" id="apower__for__huge__numbers_8cpp_html_aa141a7904f0c4668bac112d652a3acf9"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">multiply</a></div><div class="ttdeci">int multiply(int x, int res[], int res_size)</div><div class="ttdef"><b>Definition</b> <a href="#l00025">power_for_huge_numbers.cpp:25</a></div></div>
+<div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae249a2af508aa94266023ce8aa81426f"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a></div><div class="ttdeci">void power(int x, int n)</div><div class="ttdef"><b>Definition</b> <a href="#l00056">power_for_huge_numbers.cpp:56</a></div></div>
+<div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition</b> <a href="#l00082">power_for_huge_numbers.cpp:82</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../df/def/power__for__huge__numbers_8cpp.html">power_for_huge_numbers.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/df/dfb/minimax_8cpp.html b/df/dfb/minimax_8cpp.html
index 0bb0fe7d5..1dafc1641 100644
--- a/df/dfb/minimax_8cpp.html
+++ b/df/dfb/minimax_8cpp.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: backtracking/minimax.cpp File Reference</title>
+<title>TheAlgorithms/C++: backtracking/minimax.cpp File Reference</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
 <link href="../../tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../jquery.js"></script>
 <script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="../../clipboard.js"></script>
 <link href="../../navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="../../navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -122,7 +139,9 @@ Include dependency graph for minimax.cpp:</div>
 <div class="dyncontent">
 <div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d36/minimax_8cpp__incl.svg" width="336" height="111"><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">
+</div>
+<p><a href="../../df/dfb/minimax_8cpp_source.html">Go to the source code of this file.</a></p>
+<table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
 Namespaces</h2></td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html">backtracking</a></td></tr>
@@ -132,7 +151,7 @@ Namespaces</h2></td></tr>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
 Functions</h2></td></tr>
 <tr class="memitem:a78540bcb5ef3473b2348cbc34748ec50" id="r_a78540bcb5ef3473b2348cbc34748ec50"><td class="memTemplParams" colspan="2">template&lt;size_t T&gt; </td></tr>
-<tr class="memitem:a78540bcb5ef3473b2348cbc34748ec50"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">backtracking::minimax</a> (int depth, int node_index, bool is_max, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int, T &gt; &amp;scores, double <a class="el" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>)</td></tr>
+<tr class="memitem:a78540bcb5ef3473b2348cbc34748ec50"><td class="memTemplItemLeft" align="right" valign="top">int&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">backtracking::minimax</a> (int depth, int node_index, bool is_max, const std::array&lt; int, T &gt; &amp;scores, double <a class="el" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>)</td></tr>
 <tr class="memdesc:a78540bcb5ef3473b2348cbc34748ec50"><td class="mdescLeft">&#160;</td><td class="mdescRight">Check which is the maximum/minimum number in the array.  <br /></td></tr>
 <tr class="separator:a78540bcb5ef3473b2348cbc34748ec50"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
@@ -145,6 +164,8 @@ Functions</h2></td></tr>
 <dl class="section author"><dt>Author</dt><dd><a href="https://github.com/gleisonbs" target="_blank">Gleison Batista</a> </dd>
 <dd>
 <a href="https://github.com/Panquesito7" target="_blank">David Leal</a> </dd></dl>
+
+<p class="definition">Definition in file <a class="el" href="../../df/dfb/minimax_8cpp_source.html">minimax.cpp</a>.</p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
 <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
@@ -163,26 +184,19 @@ Functions</h2></td></tr>
 
 <p>Main function. </p>
 <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
+
+<p class="definition">Definition at line <a class="el" href="../../df/dfb/minimax_8cpp_source.html#l00056">56</a> of file <a class="el" href="../../df/dfb/minimax_8cpp_source.html">minimax.cpp</a>.</p>
 <div class="fragment"><div class="line"><span class="lineno">   56</span>           {</div>
-<div class="line"><span class="lineno">   57</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, 8&gt;</a> scores = {90, 23, 6, 33, 21, 65, 123, 34423};</div>
-<div class="line"><span class="lineno">   58</span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> = log2(scores.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>());</div>
+<div class="line"><span class="lineno">   57</span>    std::array&lt;int, 8&gt; scores = {90, 23, 6, 33, 21, 65, 123, 34423};</div>
+<div class="line"><span class="lineno">   58</span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> = log2(scores.size());</div>
 <div class="line"><span class="lineno">   59</span> </div>
-<div class="line"><span class="lineno">   60</span>    <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Optimal value: &quot;</span></div>
-<div class="line"><span class="lineno">   61</span>              &lt;&lt; <a class="code hl_function" href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">backtracking::minimax</a>(0, 0, <span class="keyword">true</span>, scores, <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>) &lt;&lt; <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">   60</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Optimal value: &quot;</span></div>
+<div class="line"><span class="lineno">   61</span>              &lt;&lt; <a class="code hl_function" href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">backtracking::minimax</a>(0, 0, <span class="keyword">true</span>, scores, <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>) &lt;&lt; std::endl;</div>
 <div class="line"><span class="lineno">   62</span>    <span class="keywordflow">return</span> 0;</div>
 <div class="line"><span class="lineno">   63</span>}</div>
-<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div></div>
-<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition</b> avltree.cpp:38</div></div>
-<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
-<div class="ttc" id="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="anamespacebacktracking_html_a78540bcb5ef3473b2348cbc34748ec50"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">backtracking::minimax</a></div><div class="ttdeci">int minimax(int depth, int node_index, bool is_max, const std::array&lt; int, T &gt; &amp;scores, double height)</div><div class="ttdoc">Check which is the maximum/minimum number in the array.</div><div class="ttdef"><b>Definition</b> minimax.cpp:39</div></div>
-<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/size.html">std::array::size</a></div><div class="ttdeci">T size(T... args)</div></div>
-</div><!-- fragment --><div class="dynheader">
-Here is the call graph for this function:</div>
-<div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="498" height="211"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
-</div>
-
+<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00038">avltree.cpp:38</a></div></div>
+<div class="ttc" id="anamespacebacktracking_html_a78540bcb5ef3473b2348cbc34748ec50"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">backtracking::minimax</a></div><div class="ttdeci">int minimax(int depth, int node_index, bool is_max, const std::array&lt; int, T &gt; &amp;scores, double height)</div><div class="ttdoc">Check which is the maximum/minimum number in the array.</div><div class="ttdef"><b>Definition</b> <a href="../../df/dfb/minimax_8cpp_source.html#l00039">minimax.cpp:39</a></div></div>
+</div><!-- fragment -->
 </div>
 </div>
 </div><!-- contents -->
diff --git a/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
deleted file mode 100644
index 6c03dcee2..000000000
--- a/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
+++ /dev/null
@@ -1,19 +0,0 @@
-<map id="main" name="main">
-<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,93,55,119"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="143,5,214,31"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="44,91,70,70,101,48,128,34,130,39,104,52,73,74,48,95"/>
-<area shape="rect" id="Node000003" href="$d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" title=" " alt="" coords="309,68,365,94"/>
-<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="55,99,102,92,205,83,293,79,293,85,205,88,103,97,55,104"/>
-<area shape="rect" id="Node000005" href="$db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50" title="Check which is the maximum/minimum number in the array." alt="" coords="103,131,255,156"/>
-<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="55,110,111,124,110,129,54,115"/>
-<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="125,180,233,206"/>
-<area shape="poly" id="edge10_Node000001_Node000007" title=" " alt="" coords="45,118,71,142,104,167,113,171,111,176,101,171,67,146,41,121"/>
-<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="316,69,312,59,315,50,323,44,337,41,352,44,360,51,356,55,350,49,337,47,325,49,319,53,318,59,321,67"/>
-<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="419,93,492,119"/>
-<area shape="poly" id="edge4_Node000003_Node000004" title=" " alt="" coords="366,84,405,93,404,98,365,89"/>
-<area shape="poly" id="edge6_Node000005_Node000003" title=" " alt="" coords="213,128,294,95,296,100,215,133"/>
-<area shape="poly" id="edge7_Node000005_Node000004" title=" " alt="" coords="255,131,403,110,404,116,256,136"/>
-<area shape="poly" id="edge9_Node000005_Node000005" title=" " alt="" coords="153,132,148,122,151,113,162,106,179,104,197,107,207,113,204,118,195,112,179,109,164,111,155,116,154,122,158,129"/>
-<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/min.html#" title=" " alt="" coords="303,169,371,195"/>
-<area shape="poly" id="edge8_Node000005_Node000006" title=" " alt="" coords="235,154,289,168,287,173,234,160"/>
-</map>
diff --git a/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
deleted file mode 100644
index 9553d9439..000000000
--- a/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
+++ /dev/null
@@ -1 +0,0 @@
-5733f15115d6a3b35636bada4c01d808
\ No newline at end of file
diff --git a/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
deleted file mode 100644
index 2eac8a076..000000000
--- a/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
+++ /dev/null
@@ -1,191 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="373pt" height="158pt"
- viewBox="0.00 0.00 372.75 158.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-
-<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
-
-<style type="text/css"><![CDATA[
-.node, .edge {opacity: 0.7;}
-.node.selected, .edge.selected {opacity: 1;}
-.edge:hover path { stroke: red; }
-.edge:hover polygon { stroke: red; fill: red; }
-]]></style>
-<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
-<svg id="graph" class="graph">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 154.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-84.25 0,-84.25 0,-65 37,-65 37,-84.25"/>
-<text text-anchor="middle" x="18.5" y="-70.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="156.88,-150.25 103.38,-150.25 103.38,-131 156.88,-131 156.88,-150.25"/>
-<text text-anchor="middle" x="130.12" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.36,-84.55C40.75,-93.69 57.15,-107.24 73,-116.62 79.16,-120.28 85.98,-123.67 92.69,-126.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.05,-129.8 101.62,-130.52 93.8,-123.36 91.05,-129.8"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270,-103.25 227.75,-103.25 227.75,-84 270,-84 270,-103.25"/>
-<text text-anchor="middle" x="248.88" y="-89.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.26,-78.12C47.64,-80.03 61.02,-82.28 73,-83.62 122.74,-89.21 180.81,-91.75 215.94,-92.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.74,-96.34 225.84,-93.14 215.95,-89.35 215.74,-96.34"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50" target="_top" xlink:title="Check which is the maximum/minimum number in the array.">
-<polygon fill="white" stroke="#666666" points="187.25,-56.25 73,-56.25 73,-37 187.25,-37 187.25,-56.25"/>
-<text text-anchor="middle" x="130.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::minimax</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.11,-70.13C48.51,-67.22 63.97,-63.27 78.96,-59.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.44,-62.93 88.26,-57.06 77.71,-56.15 79.44,-62.93"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170.75,-19.25 89.5,-19.25 89.5,0 170.75,0 170.75,-19.25"/>
-<text text-anchor="middle" x="130.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge10_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge10_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.43,-64.65C38.36,-54.1 55.36,-37.62 73,-27.62 75.21,-26.37 77.51,-25.2 79.88,-24.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.2,-27.33 89.1,-20.27 78.52,-20.87 81.2,-27.33"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.98,-103.54C228.64,-112.15 233.27,-121.25 248.88,-121.25 257.41,-121.25 262.66,-118.53 264.63,-114.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="268.12,-114.32 263.02,-105.03 261.22,-115.47 268.12,-114.32"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="364.75,-84.25 310.5,-84.25 310.5,-65 364.75,-65 364.75,-84.25"/>
-<text text-anchor="middle" x="337.62" y="-70.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.43,-89.12C279,-87.25 289.24,-85 299.06,-82.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.79,-86.28 308.81,-80.72 298.29,-79.44 299.79,-86.28"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge6_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge6_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.17,-56.71C173.98,-63.88 198.02,-73.55 217.01,-81.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.54,-84.38 226.13,-84.87 218.16,-77.89 215.54,-84.38"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge7_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge7_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.55,-54.31C222.95,-59.14 267.63,-65.22 298.8,-69.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.16,-72.92 308.54,-70.8 299.11,-65.98 298.16,-72.92"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge9_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge9_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.65,-56.54C104.68,-65.15 110.5,-74.25 130.12,-74.25 140.86,-74.25 147.46,-71.53 149.94,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.4,-67.08 147.91,-58.02 146.55,-68.53 153.4,-67.08"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.5,-27.25 223.25,-27.25 223.25,-8 274.5,-8 274.5,-27.25"/>
-<text text-anchor="middle" x="248.88" y="-13.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge8_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge8_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M171.63,-36.56C184.74,-33.31 199.18,-29.72 211.94,-26.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.76,-29.95 221.62,-24.15 211.07,-23.16 212.76,-29.95"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
-</svg>
-
-<style type='text/css'>
-<![CDATA[
-[data-mouse-over-selected='false'] { opacity: 0.7; }
-[data-mouse-over-selected='true']  { opacity: 1.0; }
-]]>
-</style>
-<script type="application/ecmascript"><![CDATA[
-document.addEventListener('DOMContentLoaded', (event) => {
-  highlightEdges();
-  highlightAdjacentNodes();
-});
-]]></script>
-</svg>
diff --git a/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
deleted file mode 100644
index b0fc4a0b1..000000000
--- a/df/dfb/minimax_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
+++ /dev/null
@@ -1,165 +0,0 @@
-<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
- "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 12.1.2 (20240928.0832)
- -->
-<!-- Title: main Pages: 1 -->
-<svg width="373pt" height="158pt"
- viewBox="0.00 0.00 372.75 158.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
-<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 154.25)">
-<title>main</title>
-<!-- Node1 -->
-<g id="Node000001" class="node">
-<title>Node1</title>
-<g id="a_Node000001"><a xlink:title="Main function.">
-<polygon fill="#999999" stroke="#666666" points="37,-84.25 0,-84.25 0,-65 37,-65 37,-84.25"/>
-<text text-anchor="middle" x="18.5" y="-70.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
-</a>
-</g>
-</g>
-<!-- Node2 -->
-<g id="Node000002" class="node">
-<title>Node2</title>
-<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="156.88,-150.25 103.38,-150.25 103.38,-131 156.88,-131 156.88,-150.25"/>
-<text text-anchor="middle" x="130.12" y="-136.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node2 -->
-<g id="edge1_Node000001_Node000002" class="edge">
-<title>Node1&#45;&gt;Node2</title>
-<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M30.36,-84.55C40.75,-93.69 57.15,-107.24 73,-116.62 79.16,-120.28 85.98,-123.67 92.69,-126.69"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="91.05,-129.8 101.62,-130.52 93.8,-123.36 91.05,-129.8"/>
-</a>
-</g>
-</g>
-<!-- Node3 -->
-<g id="Node000003" class="node">
-<title>Node3</title>
-<g id="a_Node000003"><a xlink:href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83" target="_top" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="270,-103.25 227.75,-103.25 227.75,-84 270,-84 270,-103.25"/>
-<text text-anchor="middle" x="248.88" y="-89.75" font-family="Helvetica,sans-Serif" font-size="10.00">height</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node3 -->
-<g id="edge2_Node000001_Node000003" class="edge">
-<title>Node1&#45;&gt;Node3</title>
-<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.26,-78.12C47.64,-80.03 61.02,-82.28 73,-83.62 122.74,-89.21 180.81,-91.75 215.94,-92.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.74,-96.34 225.84,-93.14 215.95,-89.35 215.74,-96.34"/>
-</a>
-</g>
-</g>
-<!-- Node5 -->
-<g id="Node000005" class="node">
-<title>Node5</title>
-<g id="a_Node000005"><a xlink:href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50" target="_top" xlink:title="Check which is the maximum/minimum number in the array.">
-<polygon fill="white" stroke="#666666" points="187.25,-56.25 73,-56.25 73,-37 187.25,-37 187.25,-56.25"/>
-<text text-anchor="middle" x="130.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">backtracking::minimax</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node5 -->
-<g id="edge5_Node000001_Node000005" class="edge">
-<title>Node1&#45;&gt;Node5</title>
-<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M37.11,-70.13C48.51,-67.22 63.97,-63.27 78.96,-59.44"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="79.44,-62.93 88.26,-57.06 77.71,-56.15 79.44,-62.93"/>
-</a>
-</g>
-</g>
-<!-- Node7 -->
-<g id="Node000007" class="node">
-<title>Node7</title>
-<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="170.75,-19.25 89.5,-19.25 89.5,0 170.75,0 170.75,-19.25"/>
-<text text-anchor="middle" x="130.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
-</a>
-</g>
-</g>
-<!-- Node1&#45;&gt;Node7 -->
-<g id="edge10_Node000001_Node000007" class="edge">
-<title>Node1&#45;&gt;Node7</title>
-<g id="a_edge10_Node000001_Node000007"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M28.43,-64.65C38.36,-54.1 55.36,-37.62 73,-27.62 75.21,-26.37 77.51,-25.2 79.88,-24.09"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="81.2,-27.33 89.1,-20.27 78.52,-20.87 81.2,-27.33"/>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node3 -->
-<g id="edge3_Node000003_Node000003" class="edge">
-<title>Node3&#45;&gt;Node3</title>
-<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M234.98,-103.54C228.64,-112.15 233.27,-121.25 248.88,-121.25 257.41,-121.25 262.66,-118.53 264.63,-114.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="268.12,-114.32 263.02,-105.03 261.22,-115.47 268.12,-114.32"/>
-</a>
-</g>
-</g>
-<!-- Node4 -->
-<g id="Node000004" class="node">
-<title>Node4</title>
-<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="364.75,-84.25 310.5,-84.25 310.5,-65 364.75,-65 364.75,-84.25"/>
-<text text-anchor="middle" x="337.62" y="-70.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
-</a>
-</g>
-</g>
-<!-- Node3&#45;&gt;Node4 -->
-<g id="edge4_Node000003_Node000004" class="edge">
-<title>Node3&#45;&gt;Node4</title>
-<g id="a_edge4_Node000003_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M270.43,-89.12C279,-87.25 289.24,-85 299.06,-82.85"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="299.79,-86.28 308.81,-80.72 298.29,-79.44 299.79,-86.28"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node3 -->
-<g id="edge6_Node000005_Node000003" class="edge">
-<title>Node5&#45;&gt;Node3</title>
-<g id="a_edge6_Node000005_Node000003"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M156.17,-56.71C173.98,-63.88 198.02,-73.55 217.01,-81.2"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="215.54,-84.38 226.13,-84.87 218.16,-77.89 215.54,-84.38"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node4 -->
-<g id="edge7_Node000005_Node000004" class="edge">
-<title>Node5&#45;&gt;Node4</title>
-<g id="a_edge7_Node000005_Node000004"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M187.55,-54.31C222.95,-59.14 267.63,-65.22 298.8,-69.47"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="298.16,-72.92 308.54,-70.8 299.11,-65.98 298.16,-72.92"/>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node5 -->
-<g id="edge9_Node000005_Node000005" class="edge">
-<title>Node5&#45;&gt;Node5</title>
-<g id="a_edge9_Node000005_Node000005"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M112.65,-56.54C104.68,-65.15 110.5,-74.25 130.12,-74.25 140.86,-74.25 147.46,-71.53 149.94,-67.65"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="153.4,-67.08 147.91,-58.02 146.55,-68.53 153.4,-67.08"/>
-</a>
-</g>
-</g>
-<!-- Node6 -->
-<g id="Node000006" class="node">
-<title>Node6</title>
-<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/min.html#" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="274.5,-27.25 223.25,-27.25 223.25,-8 274.5,-8 274.5,-27.25"/>
-<text text-anchor="middle" x="248.88" y="-13.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::min</text>
-</a>
-</g>
-</g>
-<!-- Node5&#45;&gt;Node6 -->
-<g id="edge8_Node000005_Node000006" class="edge">
-<title>Node5&#45;&gt;Node6</title>
-<g id="a_edge8_Node000005_Node000006"><a xlink:title=" ">
-<path fill="none" stroke="#63b8ff" d="M171.63,-36.56C184.74,-33.31 199.18,-29.72 211.94,-26.55"/>
-<polygon fill="#63b8ff" stroke="#63b8ff" points="212.76,-29.95 221.62,-24.15 211.07,-23.16 212.76,-29.95"/>
-</a>
-</g>
-</g>
-</g>
-</svg>
diff --git a/df/dfb/minimax_8cpp_source.html b/df/dfb/minimax_8cpp_source.html
new file mode 100644
index 000000000..de9c6ad70
--- /dev/null
+++ b/df/dfb/minimax_8cpp_source.html
@@ -0,0 +1,174 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: backtracking/minimax.cpp Source File</title>
+<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
+<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../jquery.js"></script>
+<script type="text/javascript" src="../../dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="../../clipboard.js"></script>
+<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../navtreedata.js"></script>
+<script type="text/javascript" src="../../navtree.js"></script>
+<script type="text/javascript" src="../../resize.js"></script>
+<script type="text/javascript" src="../../cookie.js"></script>
+<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="../../search/searchdata.js"></script>
+<script type="text/javascript" src="../../search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
+<link href="../../doxygen-awesome.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="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "../../search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(1); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="../../menudata.js"></script>
+<script type="text/javascript" src="../../menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('../../',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('df/dfb/minimax_8cpp_source.html','../../'); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">minimax.cpp</div></div>
+</div><!--header-->
+<div class="contents">
+<a href="../../df/dfb/minimax_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span> </div>
+<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="preprocessor">#include &lt;algorithm&gt;</span>  </div>
+<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span><span class="preprocessor">#include &lt;array&gt;</span>      </div>
+<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#include &lt;cmath&gt;</span>      </div>
+<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#include &lt;iostream&gt;</span>   </div>
+<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
+<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../db/dc0/namespacebacktracking.html">backtracking</a> {</div>
+<div class="line"><a id="l00038" name="l00038"></a><span class="lineno">   38</span><span class="keyword">template</span> &lt;<span class="keywordtype">size_t</span> T&gt;</div>
+<div class="foldopen" id="foldopen00039" data-start="{" data-end="}">
+<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">   39</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">minimax</a>(<span class="keywordtype">int</span> depth, <span class="keywordtype">int</span> node_index, <span class="keywordtype">bool</span> is_max,</div>
+<div class="line"><a id="l00040" name="l00040"></a><span class="lineno">   40</span>            <span class="keyword">const</span> std::array&lt;int, T&gt; &amp;scores, <span class="keywordtype">double</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>) {</div>
+<div class="line"><a id="l00041" name="l00041"></a><span class="lineno">   41</span>    <span class="keywordflow">if</span> (depth == <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>) {</div>
+<div class="line"><a id="l00042" name="l00042"></a><span class="lineno">   42</span>        <span class="keywordflow">return</span> scores[node_index];</div>
+<div class="line"><a id="l00043" name="l00043"></a><span class="lineno">   43</span>    }</div>
+<div class="line"><a id="l00044" name="l00044"></a><span class="lineno">   44</span> </div>
+<div class="line"><a id="l00045" name="l00045"></a><span class="lineno">   45</span>    <span class="keywordtype">int</span> v1 = <a class="code hl_function" href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">minimax</a>(depth + 1, node_index * 2, !is_max, scores, <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>);</div>
+<div class="line"><a id="l00046" name="l00046"></a><span class="lineno">   46</span>    <span class="keywordtype">int</span> v2 = <a class="code hl_function" href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">minimax</a>(depth + 1, node_index * 2 + 1, !is_max, scores, <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>);</div>
+<div class="line"><a id="l00047" name="l00047"></a><span class="lineno">   47</span> </div>
+<div class="line"><a id="l00048" name="l00048"></a><span class="lineno">   48</span>    <span class="keywordflow">return</span> is_max ? std::max(v1, v2) : std::min(v1, v2);</div>
+<div class="line"><a id="l00049" name="l00049"></a><span class="lineno">   49</span>}</div>
+</div>
+<div class="line"><a id="l00050" name="l00050"></a><span class="lineno">   50</span>}  <span class="comment">// namespace backtracking</span></div>
+<div class="line"><a id="l00051" name="l00051"></a><span class="lineno">   51</span> </div>
+<div class="foldopen" id="foldopen00056" data-start="{" data-end="}">
+<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="../../df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">   56</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
+<div class="line"><a id="l00057" name="l00057"></a><span class="lineno">   57</span>    std::array&lt;int, 8&gt; scores = {90, 23, 6, 33, 21, 65, 123, 34423};</div>
+<div class="line"><a id="l00058" name="l00058"></a><span class="lineno">   58</span>    <span class="keywordtype">double</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a> = log2(scores.size());</div>
+<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span> </div>
+<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span>    std::cout &lt;&lt; <span class="stringliteral">&quot;Optimal value: &quot;</span></div>
+<div class="line"><a id="l00061" name="l00061"></a><span class="lineno">   61</span>              &lt;&lt; <a class="code hl_function" href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">backtracking::minimax</a>(0, 0, <span class="keyword">true</span>, scores, <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>) &lt;&lt; std::endl;</div>
+<div class="line"><a id="l00062" name="l00062"></a><span class="lineno">   62</span>    <span class="keywordflow">return</span> 0;</div>
+<div class="line"><a id="l00063" name="l00063"></a><span class="lineno">   63</span>}</div>
+</div>
+<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00038">avltree.cpp:38</a></div></div>
+<div class="ttc" id="aminimax_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00056">minimax.cpp:56</a></div></div>
+<div class="ttc" id="anamespacebacktracking_html"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html">backtracking</a></div><div class="ttdoc">for vector container</div></div>
+<div class="ttc" id="anamespacebacktracking_html_a78540bcb5ef3473b2348cbc34748ec50"><div class="ttname"><a href="../../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50">backtracking::minimax</a></div><div class="ttdeci">int minimax(int depth, int node_index, bool is_max, const std::array&lt; int, T &gt; &amp;scores, double height)</div><div class="ttdoc">Check which is the maximum/minimum number in the array.</div><div class="ttdef"><b>Definition</b> <a href="#l00039">minimax.cpp:39</a></div></div>
+</div><!-- fragment --></div><!-- contents -->
+</div><!-- doc-content -->
+<!-- start footer part -->
+<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
+  <ul>
+    <li class="navelem"><a class="el" href="../../dir_c11585dfcef32a26e29098facab6c144.html">backtracking</a></li><li class="navelem"><a class="el" href="../../df/dfb/minimax_8cpp.html">minimax.cpp</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dir_000002_000016.html b/dir_000002_000016.html
index f79b38512..6038ef493 100644
--- a/dir_000002_000016.html
+++ b/dir_000002_000016.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ciphers -&gt; numerical_methods Relation</title>
+<title>TheAlgorithms/C++: ciphers -&gt; numerical_methods Relation</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/dir_074119ce3a874b57120c49a0cc4bb5ad.html b/dir_074119ce3a874b57120c49a0cc4bb5ad.html
index 38ab5de38..810362e5f 100644
--- a/dir_074119ce3a874b57120c49a0cc4bb5ad.html
+++ b/dir_074119ce3a874b57120c49a0cc4bb5ad.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: range_queries Directory Reference</title>
+<title>TheAlgorithms/C++: range_queries Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,21 +127,25 @@ $(function(){initNavTree('dir_074119ce3a874b57120c49a0cc4bb5ad.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d2e/fenwick__tree_8cpp.html">fenwick_tree.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/d2e/fenwick__tree_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d2e/fenwick__tree_8cpp.html">fenwick_tree.cpp</a></td></tr>
 <tr class="memdesc:d6/d2e/fenwick__tree_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Fenwick_tree" target="_blank">Fenwick Tree</a> algorithm implementation <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/de9/heavy__light__decomposition_8cpp.html">heavy_light_decomposition.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d2/de9/heavy__light__decomposition_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/de9/heavy__light__decomposition_8cpp.html">heavy_light_decomposition.cpp</a></td></tr>
 <tr class="memdesc:d2/de9/heavy__light__decomposition_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Heavy_path_decomposition" target="_blank">Heavy Light Decomposition</a> implementation <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d58/persistent__seg__tree__lazy__prop_8cpp.html">persistent_seg_tree_lazy_prop.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/d53/mo_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>mo.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d58/persistent__seg__tree__lazy__prop_8cpp.html">persistent_seg_tree_lazy_prop.cpp</a></td></tr>
 <tr class="memdesc:d5/d58/persistent__seg__tree__lazy__prop_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Persistent_data_structure" target="_blank">Persistent segment tree with range updates (lazy propagation)</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/d9e/prefix__sum__array_8cpp.html">prefix_sum_array.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/d9e/prefix__sum__array_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/d9e/prefix__sum__array_8cpp.html">prefix_sum_array.cpp</a></td></tr>
 <tr class="memdesc:d1/d9e/prefix__sum__array_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Prefix_sum" target="_blank">Prefix Sum Array</a> data structure implementation. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d45/segtree_8cpp.html">segtree.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d2/d45/segtree_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d45/segtree_8cpp.html">segtree.cpp</a></td></tr>
 <tr class="memdesc:d2/d45/segtree_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of [Segment Tree] (<a href="https://en.wikipedia.org/wiki/Segment_tree">https://en.wikipedia.org/wiki/Segment_tree</a>) data structure. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d2/d96/sparse__table__range__queries_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>sparse_table_range_queries.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dir_074119ce3a874b57120c49a0cc4bb5ad.js b/dir_074119ce3a874b57120c49a0cc4bb5ad.js
index 6005e0f23..66f21ca3f 100644
--- a/dir_074119ce3a874b57120c49a0cc4bb5ad.js
+++ b/dir_074119ce3a874b57120c49a0cc4bb5ad.js
@@ -2,7 +2,9 @@ var dir_074119ce3a874b57120c49a0cc4bb5ad =
 [
     [ "fenwick_tree.cpp", "d6/d2e/fenwick__tree_8cpp.html", "d6/d2e/fenwick__tree_8cpp" ],
     [ "heavy_light_decomposition.cpp", "d2/de9/heavy__light__decomposition_8cpp.html", "d2/de9/heavy__light__decomposition_8cpp" ],
+    [ "mo.cpp", "d3/d53/mo_8cpp_source.html", null ],
     [ "persistent_seg_tree_lazy_prop.cpp", "d5/d58/persistent__seg__tree__lazy__prop_8cpp.html", "d5/d58/persistent__seg__tree__lazy__prop_8cpp" ],
     [ "prefix_sum_array.cpp", "d1/d9e/prefix__sum__array_8cpp.html", "d1/d9e/prefix__sum__array_8cpp" ],
-    [ "segtree.cpp", "d2/d45/segtree_8cpp.html", "d2/d45/segtree_8cpp" ]
+    [ "segtree.cpp", "d2/d45/segtree_8cpp.html", "d2/d45/segtree_8cpp" ],
+    [ "sparse_table_range_queries.cpp", "d2/d96/sparse__table__range__queries_8cpp_source.html", null ]
 ];
\ No newline at end of file
diff --git a/dir_0eaa691bd54ab0922ca7f50599de6d22.html b/dir_0eaa691bd54ab0922ca7f50599de6d22.html
index ecfbdf771..80bcd19b4 100644
--- a/dir_0eaa691bd54ab0922ca7f50599de6d22.html
+++ b/dir_0eaa691bd54ab0922ca7f50599de6d22.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: greedy_algorithms Directory Reference</title>
+<title>TheAlgorithms/C++: greedy_algorithms Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,27 +127,33 @@ $(function(){initNavTree('dir_0eaa691bd54ab0922ca7f50599de6d22.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d1f/binary__addition_8cpp.html">binary_addition.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d1f/binary__addition_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d1f/binary__addition_8cpp.html">binary_addition.cpp</a></td></tr>
 <tr class="memdesc:d9/d1f/binary__addition_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Adds two binary numbers and outputs resulting string. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html">boruvkas_minimum_spanning_tree.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html">boruvkas_minimum_spanning_tree.cpp</a></td></tr>
 <tr class="memdesc:d4/d6c/boruvkas__minimum__spanning__tree_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">[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 <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d36/digit__separation_8cpp.html">digit_separation.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/d36/digit__separation_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d36/digit__separation_8cpp.html">digit_separation.cpp</a></td></tr>
 <tr class="memdesc:d3/d36/digit__separation_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Separates digits from numbers in forward and reverse order. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/de8/dijkstra__greedy_8cpp.html">dijkstra_greedy.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/de8/dijkstra__greedy_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/de8/dijkstra__greedy_8cpp.html">dijkstra_greedy.cpp</a></td></tr>
 <tr class="memdesc:da/de8/dijkstra__greedy_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" target="_blank">Dijkstra</a> algorithm implementation <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d80/gale__shapley_8cpp.html">gale_shapley.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/d80/gale__shapley_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d80/gale__shapley_8cpp.html">gale_shapley.cpp</a></td></tr>
 <tr class="memdesc:db/d80/gale__shapley_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Gale%E2%80%93Shapley_algorithm" target="_blank">Gale Shapley Algorithm</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/dba/jump__game_8cpp.html">jump_game.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/d8e/huffman_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>huffman.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/dba/jump__game_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/dba/jump__game_8cpp.html">jump_game.cpp</a></td></tr>
 <tr class="memdesc:d6/dba/jump__game_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://leetcode.com/problems/jump-game/" target="_blank">Jumping Game</a> algorithm implementation <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d7d/kruskals__minimum__spanning__tree_8cpp.html">kruskals_minimum_spanning_tree.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d0/d61/knapsack_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>knapsack.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d7d/kruskals__minimum__spanning__tree_8cpp.html">kruskals_minimum_spanning_tree.cpp</a></td></tr>
 <tr class="memdesc:d8/d7d/kruskals__minimum__spanning__tree_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://www.simplilearn.com/tutorials/data-structure-tutorial/kruskal-algorithm" target="_blank">Kruskals Minimum Spanning Tree</a> implementation <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d2/d64/prims__minimum__spanning__tree_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>prims_minimum_spanning_tree.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dir_0eaa691bd54ab0922ca7f50599de6d22.js b/dir_0eaa691bd54ab0922ca7f50599de6d22.js
index 4f3ea7df9..f7c056a39 100644
--- a/dir_0eaa691bd54ab0922ca7f50599de6d22.js
+++ b/dir_0eaa691bd54ab0922ca7f50599de6d22.js
@@ -5,6 +5,9 @@ var dir_0eaa691bd54ab0922ca7f50599de6d22 =
     [ "digit_separation.cpp", "d3/d36/digit__separation_8cpp.html", "d3/d36/digit__separation_8cpp" ],
     [ "dijkstra_greedy.cpp", "da/de8/dijkstra__greedy_8cpp.html", "da/de8/dijkstra__greedy_8cpp" ],
     [ "gale_shapley.cpp", "db/d80/gale__shapley_8cpp.html", "db/d80/gale__shapley_8cpp" ],
+    [ "huffman.cpp", "d5/d8e/huffman_8cpp_source.html", null ],
     [ "jump_game.cpp", "d6/dba/jump__game_8cpp.html", "d6/dba/jump__game_8cpp" ],
-    [ "kruskals_minimum_spanning_tree.cpp", "d8/d7d/kruskals__minimum__spanning__tree_8cpp.html", "d8/d7d/kruskals__minimum__spanning__tree_8cpp" ]
+    [ "knapsack.cpp", "d0/d61/knapsack_8cpp_source.html", null ],
+    [ "kruskals_minimum_spanning_tree.cpp", "d8/d7d/kruskals__minimum__spanning__tree_8cpp.html", "d8/d7d/kruskals__minimum__spanning__tree_8cpp" ],
+    [ "prims_minimum_spanning_tree.cpp", "d2/d64/prims__minimum__spanning__tree_8cpp_source.html", null ]
 ];
\ No newline at end of file
diff --git a/dir_12552d7fa429bf94a2e32e5cf39f7e69.html b/dir_12552d7fa429bf94a2e32e5cf39f7e69.html
index bcd4dbee0..9d97cd0b8 100644
--- a/dir_12552d7fa429bf94a2e32e5cf39f7e69.html
+++ b/dir_12552d7fa429bf94a2e32e5cf39f7e69.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graph Directory Reference</title>
+<title>TheAlgorithms/C++: graph Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,43 +127,59 @@ $(function(){initNavTree('dir_12552d7fa429bf94a2e32e5cf39f7e69.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html">bidirectional_dijkstra.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/d07/bidirectional__dijkstra_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html">bidirectional_dijkstra.cpp</a></td></tr>
 <tr class="memdesc:d7/d07/bidirectional__dijkstra_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">[Bidirectional Dijkstra Shortest Path Algorithm] (<a href="https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra">https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra</a>) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d82/breadth__first__search_8cpp.html">breadth_first_search.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/d82/breadth__first__search_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d82/breadth__first__search_8cpp.html">breadth_first_search.cpp</a></td></tr>
 <tr class="memdesc:df/d82/breadth__first__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Breadth-first_search" target="_blank">Breadth First Search Algorithm (Breadth First Search)</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/ddd/connected__components_8cpp.html">connected_components.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>bridge_finding_with_tarjan_algorithm.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/ddd/connected__components_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/ddd/connected__components_8cpp.html">connected_components.cpp</a></td></tr>
 <tr class="memdesc:df/ddd/connected__components_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">[<a class="el" href="da/d9a/class_graph.html">Graph</a> Connected Components (Connected Components)] (<a href="https://en.wikipedia.org/wiki/Component_(graph_theory)">https://en.wikipedia.org/wiki/Component_(graph_theory)</a>) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d99/connected__components__with__dsu_8cpp.html">connected_components_with_dsu.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/d99/connected__components__with__dsu_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d99/connected__components__with__dsu_8cpp.html">connected_components_with_dsu.cpp</a></td></tr>
 <tr class="memdesc:d8/d99/connected__components__with__dsu_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Disjoint_union" target="_blank">Disjoint union</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d8d/depth__first__search_8cpp.html">depth_first_search.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/dec/cycle__check__directed__graph_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>cycle_check_directed_graph.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/d8d/depth__first__search_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d8d/depth__first__search_8cpp.html">depth_first_search.cpp</a></td></tr>
 <tr class="memdesc:da/d8d/depth__first__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Depth-first_search" target="_blank">Depth First Search Algorithm (Depth First Search)</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html">depth_first_search_with_stack.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/d4b/depth__first__search__with__stack_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html">depth_first_search_with_stack.cpp</a></td></tr>
 <tr class="memdesc:da/d4b/depth__first__search__with__stack_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Depth-first_search" target="_blank">Depth First Search Algorithm using Stack (Depth First Search Algorithm)</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d68/dijkstra_8cpp.html">dijkstra.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/d68/dijkstra_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d68/dijkstra_8cpp.html">dijkstra.cpp</a></td></tr>
 <tr class="memdesc:d8/d68/dijkstra_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">[<a class="el" href="da/d9a/class_graph.html">Graph</a> Dijkstras Shortest Path Algorithm (Dijkstra's Shortest Path)] (<a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm">https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm</a>) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html">hamiltons_cycle.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dd/d0c/hamiltons__cycle_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html">hamiltons_cycle.cpp</a></td></tr>
 <tr class="memdesc:dd/d0c/hamiltons__cycle_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">The implementation of <a href="https://en.wikipedia.org/wiki/Hamiltonian_path" target="_blank">Hamilton's cycle</a> dynamic solution for vertices number less than 20. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/d9a/hopcroft__karp_8cpp.html">hopcroft_karp.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/d9a/hopcroft__karp_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/d9a/hopcroft__karp_8cpp.html">hopcroft_karp.cpp</a></td></tr>
 <tr class="memdesc:d1/d9a/hopcroft__karp_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Hopcroft%E2%80%93Karp_algorithm" target="_blank">Hopcroft–Karp</a> algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/dd8/is__graph__bipartite_8cpp.html">is_graph_bipartite.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/dd8/is__graph__bipartite_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/dd8/is__graph__bipartite_8cpp.html">is_graph_bipartite.cpp</a></td></tr>
 <tr class="memdesc:d6/dd8/is__graph__bipartite_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Algorithm to check whether a graph is <a href="https://en.wikipedia.org/wiki/Bipartite_graph" target="_blank">bipartite</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dde/lowest__common__ancestor_8cpp.html">lowest_common_ancestor.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dd/dc3/is__graph__bipartite2_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>is_graph_bipartite2.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/d83/kosaraju_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>kosaraju.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d1c/kruskal_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>kruskal.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/dde/lowest__common__ancestor_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dde/lowest__common__ancestor_8cpp.html">lowest_common_ancestor.cpp</a></td></tr>
 <tr class="memdesc:de/dde/lowest__common__ancestor_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Data structure for finding the lowest common ancestor of two vertices in a rooted tree using binary lifting. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/db9/topological__sort_8cpp.html">topological_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/d27/prim_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>prim.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/db9/topological__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/db9/topological__sort_8cpp.html">topological_sort.cpp</a></td></tr>
 <tr class="memdesc:d8/db9/topological__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Topological_sorting" target="_blank">Topological Sort Algorithm</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d88/travelling__salesman__problem_8cpp.html">travelling_salesman_problem.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/d1b/topological__sort__by__kahns__algo_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>topological_sort_by_kahns_algo.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d88/travelling__salesman__problem_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d88/travelling__salesman__problem_8cpp.html">travelling_salesman_problem.cpp</a></td></tr>
 <tr class="memdesc:de/d88/travelling__salesman__problem_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">[Travelling Salesman Problem] (<a href="https://en.wikipedia.org/wiki/Travelling_salesman_problem">https://en.wikipedia.org/wiki/Travelling_salesman_problem</a>) implementation <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
diff --git a/dir_12552d7fa429bf94a2e32e5cf39f7e69.js b/dir_12552d7fa429bf94a2e32e5cf39f7e69.js
index d093efe40..16000e270 100644
--- a/dir_12552d7fa429bf94a2e32e5cf39f7e69.js
+++ b/dir_12552d7fa429bf94a2e32e5cf39f7e69.js
@@ -2,15 +2,23 @@ var dir_12552d7fa429bf94a2e32e5cf39f7e69 =
 [
     [ "bidirectional_dijkstra.cpp", "d7/d07/bidirectional__dijkstra_8cpp.html", "d7/d07/bidirectional__dijkstra_8cpp" ],
     [ "breadth_first_search.cpp", "df/d82/breadth__first__search_8cpp.html", "df/d82/breadth__first__search_8cpp" ],
+    [ "bridge_finding_with_tarjan_algorithm.cpp", "d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html", null ],
     [ "connected_components.cpp", "df/ddd/connected__components_8cpp.html", "df/ddd/connected__components_8cpp" ],
     [ "connected_components_with_dsu.cpp", "d8/d99/connected__components__with__dsu_8cpp.html", "d8/d99/connected__components__with__dsu_8cpp" ],
+    [ "cycle_check_directed_graph.cpp", "d3/dec/cycle__check__directed__graph_8cpp_source.html", null ],
     [ "depth_first_search.cpp", "da/d8d/depth__first__search_8cpp.html", "da/d8d/depth__first__search_8cpp" ],
     [ "depth_first_search_with_stack.cpp", "da/d4b/depth__first__search__with__stack_8cpp.html", "da/d4b/depth__first__search__with__stack_8cpp" ],
     [ "dijkstra.cpp", "d8/d68/dijkstra_8cpp.html", "d8/d68/dijkstra_8cpp" ],
     [ "hamiltons_cycle.cpp", "dd/d0c/hamiltons__cycle_8cpp.html", "dd/d0c/hamiltons__cycle_8cpp" ],
     [ "hopcroft_karp.cpp", "d1/d9a/hopcroft__karp_8cpp.html", "d1/d9a/hopcroft__karp_8cpp" ],
     [ "is_graph_bipartite.cpp", "d6/dd8/is__graph__bipartite_8cpp.html", "d6/dd8/is__graph__bipartite_8cpp" ],
+    [ "is_graph_bipartite2.cpp", "dd/dc3/is__graph__bipartite2_8cpp_source.html", null ],
+    [ "kosaraju.cpp", "da/d83/kosaraju_8cpp_source.html", null ],
+    [ "kruskal.cpp", "d9/d1c/kruskal_8cpp_source.html", null ],
     [ "lowest_common_ancestor.cpp", "de/dde/lowest__common__ancestor_8cpp.html", "de/dde/lowest__common__ancestor_8cpp" ],
+    [ "max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp", "d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html", null ],
+    [ "prim.cpp", "da/d27/prim_8cpp_source.html", null ],
     [ "topological_sort.cpp", "d8/db9/topological__sort_8cpp.html", "d8/db9/topological__sort_8cpp" ],
+    [ "topological_sort_by_kahns_algo.cpp", "d1/d1b/topological__sort__by__kahns__algo_8cpp_source.html", null ],
     [ "travelling_salesman_problem.cpp", "de/d88/travelling__salesman__problem_8cpp.html", "de/d88/travelling__salesman__problem_8cpp" ]
 ];
\ No newline at end of file
diff --git a/dir_19b2bf9199a15c634a08b1ede1dd896a.html b/dir_19b2bf9199a15c634a08b1ede1dd896a.html
index b88592dc5..89128c6f5 100644
--- a/dir_19b2bf9199a15c634a08b1ede1dd896a.html
+++ b/dir_19b2bf9199a15c634a08b1ede1dd896a.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: search Directory Reference</title>
+<title>TheAlgorithms/C++: search Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,46 +127,50 @@ $(function(){initNavTree('dir_19b2bf9199a15c634a08b1ede1dd896a.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d8a/exponential__search_8cpp.html">exponential_search.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/dd5/binary__search_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>binary_search.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/d8a/exponential__search_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d8a/exponential__search_8cpp.html">exponential_search.cpp</a></td></tr>
 <tr class="memdesc:d8/d8a/exponential__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Exponential_search" target="_blank">Exponential search algorithm</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d0d/fibonacci__search_8cpp.html">fibonacci_search.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d0d/fibonacci__search_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d0d/fibonacci__search_8cpp.html">fibonacci_search.cpp</a></td></tr>
 <tr class="memdesc:de/d0d/fibonacci__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Fibonacci_search_technique" target="_blank">Fibonacci search algorithm</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/dc4/floyd__cycle__detection__algo_8cpp.html">floyd_cycle_detection_algo.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/dc4/floyd__cycle__detection__algo_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/dc4/floyd__cycle__detection__algo_8cpp.html">floyd_cycle_detection_algo.cpp</a></td></tr>
 <tr class="memdesc:db/dc4/floyd__cycle__detection__algo_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Cycle_detection" target="_blank">Floyd's Cycle Detection</a> algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/df3/hash__search_8cpp.html">hash_search.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/df3/hash__search_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/df3/hash__search_8cpp.html">hash_search.cpp</a></td></tr>
 <tr class="memdesc:d1/df3/hash__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Hash Search Algorithm - Best Time Complexity Ω(1) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d39/interpolation__search2_8cpp.html">interpolation_search2.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/dd7/interpolation__search_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>interpolation_search.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/d39/interpolation__search2_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d39/interpolation__search2_8cpp.html">interpolation_search2.cpp</a></td></tr>
 <tr class="memdesc:df/d39/interpolation__search2_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Interpolation_search" target="_blank">Interpolation search</a> algorithm <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d22/jump__search_8cpp.html">jump_search.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d2/d22/jump__search_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d22/jump__search_8cpp.html">jump_search.cpp</a></td></tr>
 <tr class="memdesc:d2/d22/jump__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">C++ program to implement <a href="https://en.wikipedia.org/wiki/Jump_search" target="_blank">Jump Search</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d02/linear__search_8cpp.html">linear_search.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d02/linear__search_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d02/linear__search_8cpp.html">linear_search.cpp</a></td></tr>
 <tr class="memdesc:d9/d02/linear__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Linear_search" target="_blank">Linear search algorithm</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html">longest_increasing_subsequence_using_binary_search.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html">longest_increasing_subsequence_using_binary_search.cpp</a></td></tr>
 <tr class="memdesc:d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">find the length of the Longest Increasing Subsequence (LIS) using <a href="https://en.wikipedia.org/wiki/Longest_increasing_subsequence" target="_blank">Binary Search</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d69/median__search_8cpp.html">median_search.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d69/median__search_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d69/median__search_8cpp.html">median_search.cpp</a></td></tr>
 <tr class="memdesc:d9/d69/median__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Median_of_medians" target="_blank">Median search</a> algorithm. @cases from <a href="https://brilliant.org/wiki/median-finding-algorithm/" target="_blank">here</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/dfa/median__search2_8cpp.html">median_search2.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/dfa/median__search2_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/dfa/median__search2_8cpp.html">median_search2.cpp</a></td></tr>
 <tr class="memdesc:d8/dfa/median__search2_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Given a linked list L[0,....,n] of n numbers, find the middle node. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d22/saddleback__search_8cpp.html">saddleback_search.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/d22/saddleback__search_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d22/saddleback__search_8cpp.html">saddleback_search.cpp</a></td></tr>
 <tr class="memdesc:d3/d22/saddleback__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a> for 2D arrays. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d45/sublist__search_8cpp.html">sublist_search.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/d45/sublist__search_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d45/sublist__search_8cpp.html">sublist_search.cpp</a></td></tr>
 <tr class="memdesc:d5/d45/sublist__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list" target="_blank">Sublist Search Algorithm</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/dfe/ternary__search_8cpp.html">ternary_search.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dc/dfe/ternary__search_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/dfe/ternary__search_8cpp.html">ternary_search.cpp</a></td></tr>
 <tr class="memdesc:dc/dfe/ternary__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Ternary_search" target="_blank">Ternary search</a> algorithm <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/db5/text__search_8cpp.html">text_search.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dc/db5/text__search_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/db5/text__search_8cpp.html">text_search.cpp</a></td></tr>
 <tr class="memdesc:dc/db5/text__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Search for words in a long textual paragraph. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
diff --git a/dir_19b2bf9199a15c634a08b1ede1dd896a.js b/dir_19b2bf9199a15c634a08b1ede1dd896a.js
index 74cf2be32..e9732a7ed 100644
--- a/dir_19b2bf9199a15c634a08b1ede1dd896a.js
+++ b/dir_19b2bf9199a15c634a08b1ede1dd896a.js
@@ -1,9 +1,11 @@
 var dir_19b2bf9199a15c634a08b1ede1dd896a =
 [
+    [ "binary_search.cpp", "df/dd5/binary__search_8cpp_source.html", null ],
     [ "exponential_search.cpp", "d8/d8a/exponential__search_8cpp.html", "d8/d8a/exponential__search_8cpp" ],
     [ "fibonacci_search.cpp", "de/d0d/fibonacci__search_8cpp.html", "de/d0d/fibonacci__search_8cpp" ],
     [ "floyd_cycle_detection_algo.cpp", "db/dc4/floyd__cycle__detection__algo_8cpp.html", "db/dc4/floyd__cycle__detection__algo_8cpp" ],
     [ "hash_search.cpp", "d1/df3/hash__search_8cpp.html", "d1/df3/hash__search_8cpp" ],
+    [ "interpolation_search.cpp", "d9/dd7/interpolation__search_8cpp_source.html", null ],
     [ "interpolation_search2.cpp", "df/d39/interpolation__search2_8cpp.html", "df/d39/interpolation__search2_8cpp" ],
     [ "jump_search.cpp", "d2/d22/jump__search_8cpp.html", "d2/d22/jump__search_8cpp" ],
     [ "linear_search.cpp", "d9/d02/linear__search_8cpp.html", "d9/d02/linear__search_8cpp" ],
diff --git a/dir_296d53ceaeaa7e099814a6def439fe8a.html b/dir_296d53ceaeaa7e099814a6def439fe8a.html
index 59bbc43b0..a4294e555 100644
--- a/dir_296d53ceaeaa7e099814a6def439fe8a.html
+++ b/dir_296d53ceaeaa7e099814a6def439fe8a.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: math Directory Reference</title>
+<title>TheAlgorithms/C++: math Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,179 +127,183 @@ $(function(){initNavTree('dir_296d53ceaeaa7e099814a6def439fe8a.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d99/aliquot__sum_8cpp.html">aliquot_sum.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d99/aliquot__sum_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d99/aliquot__sum_8cpp.html">aliquot_sum.cpp</a></td></tr>
 <tr class="memdesc:de/d99/aliquot__sum_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Program to return the <a href="https://en.wikipedia.org/wiki/Aliquot_sum" target="_blank">Aliquot Sum</a> of a number. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d51/approximate__pi_8cpp.html">approximate_pi.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d0/d51/approximate__pi_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d51/approximate__pi_8cpp.html">approximate_pi.cpp</a></td></tr>
 <tr class="memdesc:d0/d51/approximate__pi_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation to calculate an estimate of the <a href="https://en.wikipedia.org/wiki/File:Pi_30K.gif" target="_blank">number π (Pi)</a>. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d82/area_8cpp.html">area.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dc/d82/area_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d82/area_8cpp.html">area.cpp</a></td></tr>
 <tr class="memdesc:dc/d82/area_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementations for the <a href="https://en.wikipedia.org/wiki/Area" target="_blank">area</a> of various shapes. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dcf/binary__exponent_8cpp.html">binary_exponent.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d1e/armstrong__number_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>armstrong_number.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/dcf/binary__exponent_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dcf/binary__exponent_8cpp.html">binary_exponent.cpp</a></td></tr>
 <tr class="memdesc:de/dcf/binary__exponent_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">C++ Program to find Binary Exponent Iteratively and Recursively. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/db1/binomial__calculate_8cpp.html">binomial_calculate.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/db1/binomial__calculate_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/db1/binomial__calculate_8cpp.html">binomial_calculate.cpp</a></td></tr>
 <tr class="memdesc:d8/db1/binomial__calculate_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Program to calculate <a href="https://en.wikipedia.org/wiki/Binomial_coefficient" target="_blank">Binomial coefficients</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/df6/check__amicable__pair_8cpp.html">check_amicable_pair.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/df6/check__amicable__pair_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/df6/check__amicable__pair_8cpp.html">check_amicable_pair.cpp</a></td></tr>
 <tr class="memdesc:d5/df6/check__amicable__pair_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A C++ Program to check whether a pair of numbers is an <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/dd5/check__factorial_8cpp.html">check_factorial.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/dd5/check__factorial_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/dd5/check__factorial_8cpp.html">check_factorial.cpp</a></td></tr>
 <tr class="memdesc:d8/dd5/check__factorial_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A simple program to check if the given number is a <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">factorial</a> of some number or not. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d93/check__prime_8cpp.html">check_prime.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/d93/check__prime_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d93/check__prime_8cpp.html">check_prime.cpp</a></td></tr>
 <tr class="memdesc:db/d93/check__prime_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A simple program to check if the given number is <a href="https://en.wikipedia.org/wiki/Primality_test" target="_blank">Prime</a> or not. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d67/complex__numbers_8cpp.html">complex_numbers.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/d67/complex__numbers_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d67/complex__numbers_8cpp.html">complex_numbers.cpp</a></td></tr>
 <tr class="memdesc:d5/d67/complex__numbers_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">An implementation of <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> Number as Objects. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d89/double__factorial_8cpp.html">double_factorial.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/d89/double__factorial_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d89/double__factorial_8cpp.html">double_factorial.cpp</a></td></tr>
 <tr class="memdesc:d7/d89/double__factorial_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute <a href="https://en.wikipedia.org/wiki/Double_factorial" target="_blank">double factorial</a>: \(n!!\). <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/da6/eratosthenes_8cpp.html">eratosthenes.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/da6/eratosthenes_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/da6/eratosthenes_8cpp.html">eratosthenes.cpp</a></td></tr>
 <tr class="memdesc:d7/da6/eratosthenes_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes" target="_blank">The Sieve of Eratosthenes</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d23/eulers__totient__function_8cpp.html">eulers_totient_function.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/d23/eulers__totient__function_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d23/eulers__totient__function_8cpp.html">eulers_totient_function.cpp</a></td></tr>
 <tr class="memdesc:da/d23/eulers__totient__function_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Euler%27s_totient_function" target="_blank">Euler's Totient</a> @description Euler Totient Function is also known as phi function. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html">extended_euclid_algorithm.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d5d/extended__euclid__algorithm_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html">extended_euclid_algorithm.cpp</a></td></tr>
 <tr class="memdesc:d9/d5d/extended__euclid__algorithm_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">GCD using [extended Euclid's algorithm] (<a href="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm">https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm</a>) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d00/factorial_8cpp.html">factorial.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d00/factorial_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d00/factorial_8cpp.html">factorial.cpp</a></td></tr>
 <tr class="memdesc:d9/d00/factorial_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Find the <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">factorial</a> of a given number. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d0b/fast__power_8cpp.html">fast_power.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d2/d0b/fast__power_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d0b/fast__power_8cpp.html">fast_power.cpp</a></td></tr>
 <tr class="memdesc:d2/d0b/fast__power_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Faster computation for \(a^b\). <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d89/fibonacci_8cpp.html">fibonacci.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d89/fibonacci_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d89/fibonacci_8cpp.html">fibonacci.cpp</a></td></tr>
 <tr class="memdesc:d9/d89/fibonacci_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">n-th <a href="https://en.wikipedia.org/wiki/Fibonacci_sequence" target="_blank">Fibonacci number</a>. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d32/fibonacci__fast_8cpp.html">fibonacci_fast.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d32/fibonacci__fast_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d32/fibonacci__fast_8cpp.html">fibonacci_fast.cpp</a></td></tr>
 <tr class="memdesc:d4/d32/fibonacci__fast_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Faster computation of Fibonacci series. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/de4/fibonacci__large_8cpp.html">fibonacci_large.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/de4/fibonacci__large_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/de4/fibonacci__large_8cpp.html">fibonacci_large.cpp</a></td></tr>
 <tr class="memdesc:de/de4/fibonacci__large_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/dc9/fibonacci__matrix__exponentiation_8cpp.html">fibonacci_matrix_exponentiation.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/dc9/fibonacci__matrix__exponentiation_8cpp.html">fibonacci_matrix_exponentiation.cpp</a></td></tr>
 <tr class="memdesc:da/dc9/fibonacci__matrix__exponentiation_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">This program computes the N^th Fibonacci number in modulo mod input argument . <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dc3/fibonacci__sum_8cpp.html">fibonacci_sum.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/dc3/fibonacci__sum_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dc3/fibonacci__sum_8cpp.html">fibonacci_sum.cpp</a></td></tr>
 <tr class="memdesc:de/dc3/fibonacci__sum_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">An algorithm to calculate the sum of <a href="https://en.wikipedia.org/wiki/Fibonacci_number" target="_blank">Fibonacci Sequence</a>:  \(\mathrm{F}(n) +
 \mathrm{F}(n+1) + .. + \mathrm{F}(m)\). <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d46/finding__number__of__digits__in__a__number_8cpp.html">finding_number_of_digits_in_a_number.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d46/finding__number__of__digits__in__a__number_8cpp.html">finding_number_of_digits_in_a_number.cpp</a></td></tr>
 <tr class="memdesc:d0/d46/finding__number__of__digits__in__a__number_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">[Program to count digits in an integer](<a href="https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods">https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods</a>) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html">gcd_iterative_euclidean.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/da0/gcd__iterative__euclidean_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html">gcd_iterative_euclidean.cpp</a></td></tr>
 <tr class="memdesc:d4/da0/gcd__iterative__euclidean_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute the greatest common denominator of two integers using <em>iterative form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html">gcd_of_n_numbers.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/d11/gcd__of__n__numbers_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html">gcd_of_n_numbers.cpp</a></td></tr>
 <tr class="memdesc:d1/d11/gcd__of__n__numbers_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">This program aims at calculating the GCD of n numbers. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html">gcd_recursive_euclidean.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d45/gcd__recursive__euclidean_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html">gcd_recursive_euclidean.cpp</a></td></tr>
 <tr class="memdesc:d4/d45/gcd__recursive__euclidean_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute the greatest common denominator of two integers using <em>recursive form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/de9/integral__approximation_8cpp.html">integral_approximation.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/de9/integral__approximation_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/de9/integral__approximation_8cpp.html">integral_approximation.cpp</a></td></tr>
 <tr class="memdesc:d1/de9/integral__approximation_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute integral approximation of the function using <a href="https://en.wikipedia.org/wiki/Riemann_sum" target="_blank">Riemann sum</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d40/integral__approximation2_8cpp.html">integral_approximation2.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/d40/integral__approximation2_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d40/integral__approximation2_8cpp.html">integral_approximation2.cpp</a></td></tr>
 <tr class="memdesc:db/d40/integral__approximation2_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/db8/inv__sqrt_8cpp.html">inv_sqrt.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/db8/inv__sqrt_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/db8/inv__sqrt_8cpp.html">inv_sqrt.cpp</a></td></tr>
 <tr class="memdesc:d6/db8/inv__sqrt_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://medium.com/hard-mode/the-legendary-fast-inverse-square-root-e51fee3b49d9" target="_blank">the inverse square root Root</a>. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d9f/iterative__factorial_8cpp.html">iterative_factorial.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/d9f/iterative__factorial_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d9f/iterative__factorial_8cpp.html">iterative_factorial.cpp</a></td></tr>
 <tr class="memdesc:db/d9f/iterative__factorial_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Iterative implementation of <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">Factorial</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d9d/large__factorial_8cpp.html">large_factorial.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/d9d/large__factorial_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d9d/large__factorial_8cpp.html">large_factorial.cpp</a></td></tr>
 <tr class="memdesc:d6/d9d/large__factorial_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute factorial of any arbitratily large number/. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d86/large__number_8h_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d86/large__number_8h.html">large_number.h</a></td></tr>
 <tr class="memdesc:d4/d86/large__number_8h"><td class="mdescLeft">&#160;</td><td class="mdescRight">Library to perform arithmatic operations on arbitrarily large numbers. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d7a/largest__power_8cpp.html">largest_power.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/d7a/largest__power_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d7a/largest__power_8cpp.html">largest_power.cpp</a></td></tr>
 <tr class="memdesc:d5/d7a/largest__power_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Algorithm to find largest x such that p^x divides n! (factorial) using Legendre's Formula. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d83/lcm__sum_8cpp.html">lcm_sum.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/d83/lcm__sum_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d83/lcm__sum_8cpp.html">lcm_sum.cpp</a></td></tr>
 <tr class="memdesc:d5/d83/lcm__sum_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">An algorithm to calculate the sum of LCM:  \(\mathrm{LCM}(1,n) +
 \mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\). <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d21/least__common__multiple_8cpp.html">least_common_multiple.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d21/least__common__multiple_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d21/least__common__multiple_8cpp.html">least_common_multiple.cpp</a></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d44/magic__number_8cpp.html">magic_number.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dc/d52/linear__recurrence__matrix_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>linear_recurrence_matrix.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d44/magic__number_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d44/magic__number_8cpp.html">magic_number.cpp</a></td></tr>
 <tr class="memdesc:d9/d44/magic__number_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A simple program to check if the given number is a magic number or not. A number is said to be a magic number, if the sum of its digits are calculated till a single digit recursively by adding the sum of the digits after every addition. If the single digit comes out to be 1,then the number is a magic number. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d42/miller__rabin_8cpp.html">miller_rabin.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/d42/miller__rabin_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d42/miller__rabin_8cpp.html">miller_rabin.cpp</a></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d72/modular__division_8cpp.html">modular_division.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/d72/modular__division_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d72/modular__division_8cpp.html">modular_division.cpp</a></td></tr>
 <tr class="memdesc:df/d72/modular__division_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">An algorithm to divide two numbers under modulo p <a href="https://www.geeksforgeeks.org/modular-division" target="_blank">Modular Division</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d6d/modular__exponentiation_8cpp.html">modular_exponentiation.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d0/d6d/modular__exponentiation_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d6d/modular__exponentiation_8cpp.html">modular_exponentiation.cpp</a></td></tr>
 <tr class="memdesc:d0/d6d/modular__exponentiation_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">C++ Program for Modular Exponentiation Iteratively. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html">modular_inverse_fermat_little_theorem.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html">modular_inverse_fermat_little_theorem.cpp</a></td></tr>
 <tr class="memdesc:d8/d53/modular__inverse__fermat__little__theorem_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">C++ Program to find the modular inverse using <a href="https://en.wikipedia.org/wiki/Fermat%27s_little_theorem" target="_blank">Fermat's Little Theorem</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d2d/modular__inverse__simple_8cpp.html">modular_inverse_simple.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/d2d/modular__inverse__simple_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d2d/modular__inverse__simple_8cpp.html">modular_inverse_simple.cpp</a></td></tr>
 <tr class="memdesc:d6/d2d/modular__inverse__simple_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Simple implementation of <a href="https://en.wikipedia.org/wiki/Modular_multiplicative_inverse" target="_blank">modular multiplicative inverse</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d27/n__bonacci_8cpp.html">n_bonacci.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/d27/n__bonacci_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d27/n__bonacci_8cpp.html">n_bonacci.cpp</a></td></tr>
 <tr class="memdesc:db/d27/n__bonacci_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the <a href="http://oeis.org/wiki/N-bonacci_numbers" target="_blank">N-bonacci</a> series. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/dbb/n__choose__r_8cpp.html">n_choose_r.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/dbb/n__choose__r_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/dbb/n__choose__r_8cpp.html">n_choose_r.cpp</a></td></tr>
 <tr class="memdesc:d1/dbb/n__choose__r_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Combination" target="_blank">Combinations</a> n choose r function implementation <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dab/ncr__modulo__p_8cpp.html">ncr_modulo_p.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/dab/ncr__modulo__p_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dab/ncr__modulo__p_8cpp.html">ncr_modulo_p.cpp</a></td></tr>
 <tr class="memdesc:de/dab/ncr__modulo__p_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">This program aims at calculating <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a>. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html">number_of_positive_divisors.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d0/da2/number__of__positive__divisors_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html">number_of_positive_divisors.cpp</a></td></tr>
 <tr class="memdesc:d0/da2/number__of__positive__divisors_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">C++ Program to calculate the number of positive divisors. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/dfe/perimeter_8cpp.html">perimeter.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/dfe/perimeter_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/dfe/perimeter_8cpp.html">perimeter.cpp</a></td></tr>
 <tr class="memdesc:d3/dfe/perimeter_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementations for the <a href="https://en.wikipedia.org/wiki/Perimeter" target="_blank">perimeter</a> of various shapes. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/def/power__for__huge__numbers_8cpp.html">power_for_huge_numbers.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/def/power__for__huge__numbers_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/def/power__for__huge__numbers_8cpp.html">power_for_huge_numbers.cpp</a></td></tr>
 <tr class="memdesc:df/def/power__for__huge__numbers_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute powers of large numbers. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d38/power__of__two_8cpp.html">power_of_two.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d38/power__of__two_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d38/power__of__two_8cpp.html">power_of_two.cpp</a></td></tr>
 <tr class="memdesc:d4/d38/power__of__two_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation to check whether a number is a power of 2 or not. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d0d/prime__factorization_8cpp.html">prime_factorization.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/d0d/prime__factorization_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d0d/prime__factorization_8cpp.html">prime_factorization.cpp</a></td></tr>
 <tr class="memdesc:db/d0d/prime__factorization_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prime factorization of positive integers. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d9b/prime__numbers_8cpp.html">prime_numbers.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d9b/prime__numbers_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d9b/prime__numbers_8cpp.html">prime_numbers.cpp</a></td></tr>
 <tr class="memdesc:de/d9b/prime__numbers_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get list of prime numbers. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html">primes_up_to_billion.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d9c/primes__up__to__billion_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html">primes_up_to_billion.cpp</a></td></tr>
 <tr class="memdesc:d4/d9c/primes__up__to__billion_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute prime numbers upto 1 billion. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d18/quadratic__equations__complex__numbers_8cpp.html">quadratic_equations_complex_numbers.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/d18/quadratic__equations__complex__numbers_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d18/quadratic__equations__complex__numbers_8cpp.html">quadratic_equations_complex_numbers.cpp</a></td></tr>
 <tr class="memdesc:da/d18/quadratic__equations__complex__numbers_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Calculate quadratic equation with complex roots, i.e. b^2 - 4ac &lt; 0. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d08/realtime__stats_8cpp.html">realtime_stats.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d0/d08/realtime__stats_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d08/realtime__stats_8cpp.html">realtime_stats.cpp</a></td></tr>
 <tr class="memdesc:d0/d08/realtime__stats_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute statistics for data entered in rreal-time. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html">sieve_of_eratosthenes.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/ddf/sieve__of__eratosthenes_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html">sieve_of_eratosthenes.cpp</a></td></tr>
 <tr class="memdesc:d8/ddf/sieve__of__eratosthenes_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prime Numbers using <a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes" target="_blank">Sieve of Eratosthenes</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d24/sqrt__double_8cpp.html">sqrt_double.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/d24/sqrt__double_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d24/sqrt__double_8cpp.html">sqrt_double.cpp</a></td></tr>
 <tr class="memdesc:da/d24/sqrt__double_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Calculate the square root of any positive real number in  \(O(\log
 N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bisection_method" target="_blank">bisection method</a> of root-finding. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d47/string__fibonacci_8cpp.html">string_fibonacci.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d47/string__fibonacci_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d47/string__fibonacci_8cpp.html">string_fibonacci.cpp</a></td></tr>
 <tr class="memdesc:de/d47/string__fibonacci_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">This Programme returns the Nth fibonacci as a string. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d9d/sum__of__binomial__coefficient_8cpp.html">sum_of_binomial_coefficient.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d9d/sum__of__binomial__coefficient_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d9d/sum__of__binomial__coefficient_8cpp.html">sum_of_binomial_coefficient.cpp</a></td></tr>
 <tr class="memdesc:d4/d9d/sum__of__binomial__coefficient_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Algorithm to find sum of binomial coefficients of a given positive integer. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d83/sum__of__digits_8cpp.html">sum_of_digits.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d83/sum__of__digits_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d83/sum__of__digits_8cpp.html">sum_of_digits.cpp</a></td></tr>
 <tr class="memdesc:d4/d83/sum__of__digits_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A C++ Program to find the Sum of Digits of input integer. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d66/vector__cross__product_8cpp.html">vector_cross_product.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/d66/vector__cross__product_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d66/vector__cross__product_8cpp.html">vector_cross_product.cpp</a></td></tr>
 <tr class="memdesc:df/d66/vector__cross__product_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Calculates the <a href="https://en.wikipedia.org/wiki/Cross_product" target="_blank">Cross Product</a> and the magnitude of two mathematical 3D vectors. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d39/volume_8cpp.html">volume.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/d39/volume_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d39/volume_8cpp.html">volume.cpp</a></td></tr>
 <tr class="memdesc:da/d39/volume_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implmentations for the <a href="https://en.wikipedia.org/wiki/Volume" target="_blank">volume</a> of various 3D shapes. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
diff --git a/dir_296d53ceaeaa7e099814a6def439fe8a.js b/dir_296d53ceaeaa7e099814a6def439fe8a.js
index adf4bc33b..ca21c717a 100644
--- a/dir_296d53ceaeaa7e099814a6def439fe8a.js
+++ b/dir_296d53ceaeaa7e099814a6def439fe8a.js
@@ -3,6 +3,7 @@ var dir_296d53ceaeaa7e099814a6def439fe8a =
     [ "aliquot_sum.cpp", "de/d99/aliquot__sum_8cpp.html", "de/d99/aliquot__sum_8cpp" ],
     [ "approximate_pi.cpp", "d0/d51/approximate__pi_8cpp.html", "d0/d51/approximate__pi_8cpp" ],
     [ "area.cpp", "dc/d82/area_8cpp.html", "dc/d82/area_8cpp" ],
+    [ "armstrong_number.cpp", "de/d1e/armstrong__number_8cpp_source.html", null ],
     [ "binary_exponent.cpp", "de/dcf/binary__exponent_8cpp.html", "de/dcf/binary__exponent_8cpp" ],
     [ "binomial_calculate.cpp", "d8/db1/binomial__calculate_8cpp.html", "d8/db1/binomial__calculate_8cpp" ],
     [ "check_amicable_pair.cpp", "d5/df6/check__amicable__pair_8cpp.html", "d5/df6/check__amicable__pair_8cpp" ],
@@ -33,6 +34,7 @@ var dir_296d53ceaeaa7e099814a6def439fe8a =
     [ "largest_power.cpp", "d5/d7a/largest__power_8cpp.html", "d5/d7a/largest__power_8cpp" ],
     [ "lcm_sum.cpp", "d5/d83/lcm__sum_8cpp.html", "d5/d83/lcm__sum_8cpp" ],
     [ "least_common_multiple.cpp", "d4/d21/least__common__multiple_8cpp.html", "d4/d21/least__common__multiple_8cpp" ],
+    [ "linear_recurrence_matrix.cpp", "dc/d52/linear__recurrence__matrix_8cpp_source.html", null ],
     [ "magic_number.cpp", "d9/d44/magic__number_8cpp.html", "d9/d44/magic__number_8cpp" ],
     [ "miller_rabin.cpp", "d6/d42/miller__rabin_8cpp.html", "d6/d42/miller__rabin_8cpp" ],
     [ "modular_division.cpp", "df/d72/modular__division_8cpp.html", "df/d72/modular__division_8cpp" ],
diff --git a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html
index 9ec5dfaac..ddc4966e8 100644
--- a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html
+++ b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures Directory Reference</title>
+<title>TheAlgorithms/C++: data_structures Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -115,77 +132,105 @@ Directories</h2></td></tr>
 </table><table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/dee/avltree_8cpp.html">avltree.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/dee/avltree_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/dee/avltree_8cpp.html">avltree.cpp</a></td></tr>
 <tr class="memdesc:d8/dee/avltree_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A simple tree implementation using nodes. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d26/binary__search__tree_8cpp.html">binary_search_tree.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/d26/binary__search__tree_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d26/binary__search__tree_8cpp.html">binary_search_tree.cpp</a></td></tr>
 <tr class="memdesc:d3/d26/binary__search__tree_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A simple tree implementation using structured nodes. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d42/binary__search__tree2_8cpp.html">binary_search_tree2.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/d42/binary__search__tree2_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d42/binary__search__tree2_8cpp.html">binary_search_tree2.cpp</a></td></tr>
 <tr class="memdesc:df/d42/binary__search__tree2_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A generic <a href="https://en.wikipedia.org/wiki/Binary_search_tree" target="_blank">binary search tree</a> implementation. Here you can find more information about the algorithm: <a href="https://www.scaler.com/topics/data-structures/binary-search-tree/" target="_blank">Scaler - Binary Search tree</a>. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dc3/binaryheap_8cpp.html">binaryheap.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/dc3/binaryheap_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dc3/binaryheap_8cpp.html">binaryheap.cpp</a></td></tr>
 <tr class="memdesc:de/dc3/binaryheap_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A C++ program to demonstrate common Binary Heap Operations. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/dab/bloom__filter_8cpp.html">bloom_filter.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/dab/bloom__filter_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/dab/bloom__filter_8cpp.html">bloom_filter.cpp</a></td></tr>
 <tr class="memdesc:d9/dab/bloom__filter_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Bloom_filter" target="_blank">Bloom Filter</a> generic implementation in C++ <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d23/disjoint__set_8cpp.html">disjoint_set.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/dfd/circular__queue__using__linked__list_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>circular_queue_using_linked_list.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d23/disjoint__set_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d23/disjoint__set_8cpp.html">disjoint_set.cpp</a></td></tr>
 <tr class="memdesc:de/d23/disjoint__set_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Disjoint-set_data_structure" target="_blank">Disjoint Sets Data Structure (Disjoint Sets)</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/dae/dsu__path__compression_8cpp.html">dsu_path_compression.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/d85/doubly__linked__list_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>doubly_linked_list.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/dae/dsu__path__compression_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/dae/dsu__path__compression_8cpp.html">dsu_path_compression.cpp</a></td></tr>
 <tr class="memdesc:d3/dae/dsu__path__compression_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Disjoint-set-data_structure" target="_blank">DSU (Disjoint sets)</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d28/dsu__union__rank_8cpp.html">dsu_union_rank.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/d28/dsu__union__rank_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d28/dsu__union__rank_8cpp.html">dsu_union_rank.cpp</a></td></tr>
 <tr class="memdesc:df/d28/dsu__union__rank_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Disjoint-set-data_structure" target="_blank">DSU (Disjoint sets)</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/dc3/linked__list_8cpp.html">linked_list.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/dc3/linked__list_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/dc3/linked__list_8cpp.html">linked_list.cpp</a></td></tr>
 <tr class="memdesc:da/dc3/linked__list_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of singly linked list algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html">linkedlist_implentation_usingarray.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/dce/linkedlist__implentation__usingarray_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html">linkedlist_implentation_usingarray.cpp</a></td></tr>
 <tr class="memdesc:d3/dce/linkedlist__implentation__usingarray_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Linked list implementation using Arrays. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d00/list__array_8cpp.html">list_array.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/d00/list__array_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d00/list__array_8cpp.html">list_array.cpp</a></td></tr>
 <tr class="memdesc:d7/d00/list__array_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Dynamic_array" target="_blank">Dynamic Array</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/dc5/morrisinorder_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>morrisinorder.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/d09/node_8hpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d09/node_8hpp.html">node.hpp</a></td></tr>
 <tr class="memdesc:d3/d09/node_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Provides <a class="el" href="db/d8b/struct_node.html">Node</a> class and related utilities. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/ded/queue_8hpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>queue.hpp</b></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/df0/queue__using__array_8cpp.html">queue_using_array.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/df0/queue__using__array_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/df0/queue__using__array_8cpp.html">queue_using_array.cpp</a></td></tr>
 <tr class="memdesc:d8/df0/queue__using__array_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of Linear [<a class="el" href="dc/db5/struct_queue.html">Queue</a> using array] (<a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/">https://www.geeksforgeeks.org/array-implementation-of-queue-simple/</a>). <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/dd0/queue__using__two__stacks_8cpp.html">queue_using_two_stacks.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/da7/queue__using__array2_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>queue_using_array2.cpp</b></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d05/reverse__a__linked__list_8cpp.html">reverse_a_linked_list.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/db7/queue__using__linked__list_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>queue_using_linked_list.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d5b/queue__using__linkedlist_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>queue_using_linkedlist.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/dd0/queue__using__two__stacks_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/dd0/queue__using__two__stacks_8cpp.html">queue_using_two_stacks.cpp</a></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/dad/rb__tree_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>rb_tree.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/d05/reverse__a__linked__list_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d05/reverse__a__linked__list_8cpp.html">reverse_a_linked_list.cpp</a></td></tr>
 <tr class="memdesc:d6/d05/reverse__a__linked__list_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://simple.wikipedia.org/wiki/Linked_list" target="_blank">Reversing a single linked list</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dd1/segment__tree_8cpp.html">segment_tree.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/dd1/segment__tree_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dd1/segment__tree_8cpp.html">segment_tree.cpp</a></td></tr>
 <tr class="memdesc:de/dd1/segment__tree_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A data structure to quickly do operations on ranges: the <a href="https://en.wikipedia.org/wiki/Segment_tree" target="_blank">Segment Tree</a> algorithm implementation. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d5a/skip__list_8cpp.html">skip_list.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d0/d5a/skip__list_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d5a/skip__list_8cpp.html">skip_list.cpp</a></td></tr>
 <tr class="memdesc:d0/d5a/skip__list_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Data structure for fast searching and insertion in \(O(\log n)\) time. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/dab/sparse__table_8cpp.html">sparse_table.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/dab/sparse__table_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/dab/sparse__table_8cpp.html">sparse_table.cpp</a></td></tr>
 <tr class="memdesc:d8/dab/sparse__table_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://brilliant.org/wiki/sparse-table/" target="_blank">Sparse Table</a> for <code>min()</code> function. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/d47/stack_8hpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d47/stack_8hpp.html">stack.hpp</a></td></tr>
 <tr class="memdesc:df/d47/stack_8hpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">This class specifies the basic operation on a stack as a linked list. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/dd2/treap_8cpp.html">treap.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/d96/stack__using__array_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>stack_using_array.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/dea/stack__using__linked__list_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>stack_using_linked_list.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/d43/stack__using__queue_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>stack_using_queue.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/dce/test__queue_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>test_queue.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/dbf/test__stack_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>test_stack.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/dbd/test__stack__students_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>test_stack_students.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d0/dd2/treap_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/dd2/treap_8cpp.html">treap.cpp</a></td></tr>
 <tr class="memdesc:d0/dd2/treap_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A balanced binary search tree (BST) on the basis of binary search tree and heap: the <a href="https://en.wikipedia.org/wiki/Treap" target="_blank">Treap</a> algorithm implementation. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/dbc/tree__234_8cpp.html">tree_234.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/d12/tree_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>tree.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/dbc/tree__234_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/dbc/tree__234_8cpp.html">tree_234.cpp</a></td></tr>
 <tr class="memdesc:db/dbc/tree__234_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A demo 2-3-4 tree implementation. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d93/trie__modern_8cpp.html">trie_modern.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dc/d93/trie__modern_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d93/trie__modern_8cpp.html">trie_modern.cpp</a></td></tr>
 <tr class="memdesc:dc/d93/trie__modern_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A basic implementation of trie class to store only lower-case strings. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d83/trie__tree_8cpp.html">trie_tree.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/d83/trie__tree_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d83/trie__tree_8cpp.html">trie_tree.cpp</a></td></tr>
 <tr class="memdesc:d7/d83/trie__tree_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure for English alphabets in small characters. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d8a/trie__using__hashmap_8cpp.html">trie_using_hashmap.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/d8a/trie__using__hashmap_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d8a/trie__using__hashmap_8cpp.html">trie_using_hashmap.cpp</a></td></tr>
 <tr class="memdesc:d5/d8a/trie__using__hashmap_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure using HashMap for different characters and method for predicting words based on prefix. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
diff --git a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js
index 96baf8596..09046f45a 100644
--- a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js
+++ b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js
@@ -6,22 +6,36 @@ var dir_2e746e9d06bf2d8ff842208bcc6ebcfc =
     [ "binary_search_tree2.cpp", "df/d42/binary__search__tree2_8cpp.html", "df/d42/binary__search__tree2_8cpp" ],
     [ "binaryheap.cpp", "de/dc3/binaryheap_8cpp.html", "de/dc3/binaryheap_8cpp" ],
     [ "bloom_filter.cpp", "d9/dab/bloom__filter_8cpp.html", "d9/dab/bloom__filter_8cpp" ],
+    [ "circular_queue_using_linked_list.cpp", "d9/dfd/circular__queue__using__linked__list_8cpp_source.html", null ],
     [ "disjoint_set.cpp", "de/d23/disjoint__set_8cpp.html", "de/d23/disjoint__set_8cpp" ],
+    [ "doubly_linked_list.cpp", "d7/d85/doubly__linked__list_8cpp_source.html", null ],
     [ "dsu_path_compression.cpp", "d3/dae/dsu__path__compression_8cpp.html", "d3/dae/dsu__path__compression_8cpp" ],
     [ "dsu_union_rank.cpp", "df/d28/dsu__union__rank_8cpp.html", "df/d28/dsu__union__rank_8cpp" ],
     [ "linked_list.cpp", "da/dc3/linked__list_8cpp.html", "da/dc3/linked__list_8cpp" ],
     [ "linkedlist_implentation_usingarray.cpp", "d3/dce/linkedlist__implentation__usingarray_8cpp.html", "d3/dce/linkedlist__implentation__usingarray_8cpp" ],
     [ "list_array.cpp", "d7/d00/list__array_8cpp.html", "d7/d00/list__array_8cpp" ],
+    [ "morrisinorder.cpp", "d5/dc5/morrisinorder_8cpp_source.html", null ],
     [ "node.hpp", "d3/d09/node_8hpp.html", "d3/d09/node_8hpp" ],
     [ "queue.hpp", "d7/ded/queue_8hpp_source.html", null ],
     [ "queue_using_array.cpp", "d8/df0/queue__using__array_8cpp.html", "d8/df0/queue__using__array_8cpp" ],
+    [ "queue_using_array2.cpp", "df/da7/queue__using__array2_8cpp_source.html", null ],
+    [ "queue_using_linked_list.cpp", "d8/db7/queue__using__linked__list_8cpp_source.html", null ],
+    [ "queue_using_linkedlist.cpp", "de/d5b/queue__using__linkedlist_8cpp_source.html", null ],
     [ "queue_using_two_stacks.cpp", "df/dd0/queue__using__two__stacks_8cpp.html", "df/dd0/queue__using__two__stacks_8cpp" ],
+    [ "rb_tree.cpp", "d9/dad/rb__tree_8cpp_source.html", null ],
     [ "reverse_a_linked_list.cpp", "d6/d05/reverse__a__linked__list_8cpp.html", "d6/d05/reverse__a__linked__list_8cpp" ],
     [ "segment_tree.cpp", "de/dd1/segment__tree_8cpp.html", "de/dd1/segment__tree_8cpp" ],
     [ "skip_list.cpp", "d0/d5a/skip__list_8cpp.html", "d0/d5a/skip__list_8cpp" ],
     [ "sparse_table.cpp", "d8/dab/sparse__table_8cpp.html", "d8/dab/sparse__table_8cpp" ],
     [ "stack.hpp", "df/d47/stack_8hpp.html", "df/d47/stack_8hpp" ],
+    [ "stack_using_array.cpp", "d8/d96/stack__using__array_8cpp_source.html", null ],
+    [ "stack_using_linked_list.cpp", "d3/dea/stack__using__linked__list_8cpp_source.html", null ],
+    [ "stack_using_queue.cpp", "d7/d43/stack__using__queue_8cpp_source.html", null ],
+    [ "test_queue.cpp", "d8/dce/test__queue_8cpp_source.html", null ],
+    [ "test_stack.cpp", "d9/dbf/test__stack_8cpp_source.html", null ],
+    [ "test_stack_students.cpp", "db/dbd/test__stack__students_8cpp_source.html", null ],
     [ "treap.cpp", "d0/dd2/treap_8cpp.html", "d0/dd2/treap_8cpp" ],
+    [ "tree.cpp", "d1/d12/tree_8cpp_source.html", null ],
     [ "tree_234.cpp", "db/dbc/tree__234_8cpp.html", "db/dbc/tree__234_8cpp" ],
     [ "trie_modern.cpp", "dc/d93/trie__modern_8cpp.html", "dc/d93/trie__modern_8cpp" ],
     [ "trie_tree.cpp", "d7/d83/trie__tree_8cpp.html", "d7/d83/trie__tree_8cpp" ],
diff --git a/dir_3343723ae086de42ee4ca9774da3a13f.html b/dir_3343723ae086de42ee4ca9774da3a13f.html
index cc39f1851..95cfe8beb 100644
--- a/dir_3343723ae086de42ee4ca9774da3a13f.html
+++ b/dir_3343723ae086de42ee4ca9774da3a13f.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: machine_learning Directory Reference</title>
+<title>TheAlgorithms/C++: machine_learning Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,22 +127,24 @@ $(function(){initNavTree('dir_3343723ae086de42ee4ca9774da3a13f.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/db0/adaline__learning_8cpp.html">adaline_learning.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dd/dec/a__star__search_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>a_star_search.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/db0/adaline__learning_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/db0/adaline__learning_8cpp.html">adaline_learning.cpp</a></td></tr>
 <tr class="memdesc:d5/db0/adaline__learning_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/ADALINE" target="_blank">Adaptive Linear Neuron (ADALINE)</a> implementation <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d3e/k__nearest__neighbors_8cpp.html">k_nearest_neighbors.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d3e/k__nearest__neighbors_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d3e/k__nearest__neighbors_8cpp.html">k_nearest_neighbors.cpp</a></td></tr>
 <tr class="memdesc:d4/d3e/k__nearest__neighbors_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of [K-Nearest Neighbors algorithm] (<a href="https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm">https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm</a>). <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/def/kohonen__som__topology_8cpp.html">kohonen_som_topology.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/def/kohonen__som__topology_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/def/kohonen__som__topology_8cpp.html">kohonen_som_topology.cpp</a></td></tr>
 <tr class="memdesc:d4/def/kohonen__som__topology_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Self-organizing_map" target="_blank">Kohonen self organizing map</a> (topological map) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d49/kohonen__som__trace_8cpp.html">kohonen_som_trace.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d49/kohonen__som__trace_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d49/kohonen__som__trace_8cpp.html">kohonen_som_trace.cpp</a></td></tr>
 <tr class="memdesc:d9/d49/kohonen__som__trace_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Self-organizing_map" target="_blank">Kohonen self organizing map</a> (data tracing) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d58/neural__network_8cpp.html">neural_network.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d2/d58/neural__network_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d58/neural__network_8cpp.html">neural_network.cpp</a></td></tr>
 <tr class="memdesc:d2/d58/neural__network_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of [Multilayer Perceptron] (<a href="https://en.wikipedia.org/wiki/Multilayer_perceptron">https://en.wikipedia.org/wiki/Multilayer_perceptron</a>). <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html">ordinary_least_squares_regressor.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dc/d38/ordinary__least__squares__regressor_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html">ordinary_least_squares_regressor.cpp</a></td></tr>
 <tr class="memdesc:dc/d38/ordinary__least__squares__regressor_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Linear regression example using <a href="https://en.wikipedia.org/wiki/Ordinary_least_squares" target="_blank">Ordinary least squares</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/d95/vector__ops_8hpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d95/vector__ops_8hpp.html">vector_ops.hpp</a></td></tr>
diff --git a/dir_3343723ae086de42ee4ca9774da3a13f.js b/dir_3343723ae086de42ee4ca9774da3a13f.js
index 93ee24550..eb28d4675 100644
--- a/dir_3343723ae086de42ee4ca9774da3a13f.js
+++ b/dir_3343723ae086de42ee4ca9774da3a13f.js
@@ -1,5 +1,6 @@
 var dir_3343723ae086de42ee4ca9774da3a13f =
 [
+    [ "a_star_search.cpp", "dd/dec/a__star__search_8cpp_source.html", null ],
     [ "adaline_learning.cpp", "d5/db0/adaline__learning_8cpp.html", "d5/db0/adaline__learning_8cpp" ],
     [ "k_nearest_neighbors.cpp", "d4/d3e/k__nearest__neighbors_8cpp.html", "d4/d3e/k__nearest__neighbors_8cpp" ],
     [ "kohonen_som_topology.cpp", "d4/def/kohonen__som__topology_8cpp.html", "d4/def/kohonen__som__topology_8cpp" ],
diff --git a/dir_35422be6552f1b3672c1b6c4aba2da64.html b/dir_35422be6552f1b3672c1b6c4aba2da64.html
index 0f81d70a9..829deeebb 100644
--- a/dir_35422be6552f1b3672c1b6c4aba2da64.html
+++ b/dir_35422be6552f1b3672c1b6c4aba2da64.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: operations_on_datastructures Directory Reference</title>
+<title>TheAlgorithms/C++: operations_on_datastructures Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,28 +127,36 @@ $(function(){initNavTree('dir_35422be6552f1b3672c1b6c4aba2da64.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d14/array__left__rotation_8cpp.html">array_left_rotation.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d14/array__left__rotation_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d14/array__left__rotation_8cpp.html">array_left_rotation.cpp</a></td></tr>
 <tr class="memdesc:d9/d14/array__left__rotation_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation for the <a href="https://www.javatpoint.com/program-to-left-rotate-the-elements-of-an-array" target="_blank">Array Left Rotation</a> algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d57/array__right__rotation_8cpp.html">array_right_rotation.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/d57/array__right__rotation_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d57/array__right__rotation_8cpp.html">array_right_rotation.cpp</a></td></tr>
 <tr class="memdesc:d6/d57/array__right__rotation_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation for the <a href="https://www.javatpoint.com/program-to-right-rotate-the-elements-of-an-array" target="_blank">Array right Rotation</a> algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d33/circular__linked__list_8cpp.html">circular_linked_list.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d33/circular__linked__list_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d33/circular__linked__list_8cpp.html">circular_linked_list.cpp</a></td></tr>
 <tr class="memdesc:de/d33/circular__linked__list_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation for a <a href="https://www.geeksforgeeks.org/circular-linked-list/" target="_blank">Circular Linked List</a>. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d32/inorder__successor__of__bst_8cpp.html">inorder_successor_of_bst.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/dfb/circular__queue__using__array_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>circular_queue_using_array.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/dab/get__size__of__linked__list_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>get_size_of_linked_list.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d32/inorder__successor__of__bst_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d32/inorder__successor__of__bst_8cpp.html">inorder_successor_of_bst.cpp</a></td></tr>
 <tr class="memdesc:d4/d32/inorder__successor__of__bst_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">An implementation for finding the <a href="https://www.youtube.com/watch?v=5cPbNCrdotA" target="_blank">Inorder successor of a binary search tree</a> Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the last node in Inorder traversal. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dc5/intersection__of__two__arrays_8cpp.html">intersection_of_two_arrays.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/dc5/intersection__of__two__arrays_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dc5/intersection__of__two__arrays_8cpp.html">intersection_of_two_arrays.cpp</a></td></tr>
 <tr class="memdesc:de/dc5/intersection__of__two__arrays_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation for the <a href="https://en.wikipedia.org/wiki/Intersection_(set_theory)" target="_blank">Intersection of two sorted Arrays</a> algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/db6/reverse__binary__tree_8cpp.html">reverse_binary_tree.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/d30/reverse__a__linked__list__using__recusion_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>reverse_a_linked_list_using_recusion.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/db6/reverse__binary__tree_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/db6/reverse__binary__tree_8cpp.html">reverse_binary_tree.cpp</a></td></tr>
 <tr class="memdesc:d4/db6/reverse__binary__tree_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation for the <a href="https://www.geeksforgeeks.org/reverse-tree-path/" target="_blank">Reversing a Binary Tree</a> recursively algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/def/trie__multiple__search_8cpp.html">trie_multiple_search.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/dcc/selectionsortlinkedlist_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>selectionsortlinkedlist.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/def/trie__multiple__search_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/def/trie__multiple__search_8cpp.html">trie_multiple_search.cpp</a></td></tr>
 <tr class="memdesc:d7/def/trie__multiple__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://iq.opengenus.org/autocomplete-using-trie-data-structure/" target="_blank">Trie datastructure</a> with search variants <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d9c/union__of__two__arrays_8cpp.html">union_of_two_arrays.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/d9c/union__of__two__arrays_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d9c/union__of__two__arrays_8cpp.html">union_of_two_arrays.cpp</a></td></tr>
 <tr class="memdesc:d8/d9c/union__of__two__arrays_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation for the <a href="https://en.wikipedia.org/wiki/Union_(set_theory)" target="_blank">Union of two sorted Arrays</a> algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
diff --git a/dir_35422be6552f1b3672c1b6c4aba2da64.js b/dir_35422be6552f1b3672c1b6c4aba2da64.js
index b74cebda3..890da32c9 100644
--- a/dir_35422be6552f1b3672c1b6c4aba2da64.js
+++ b/dir_35422be6552f1b3672c1b6c4aba2da64.js
@@ -3,9 +3,13 @@ var dir_35422be6552f1b3672c1b6c4aba2da64 =
     [ "array_left_rotation.cpp", "d9/d14/array__left__rotation_8cpp.html", "d9/d14/array__left__rotation_8cpp" ],
     [ "array_right_rotation.cpp", "d6/d57/array__right__rotation_8cpp.html", "d6/d57/array__right__rotation_8cpp" ],
     [ "circular_linked_list.cpp", "de/d33/circular__linked__list_8cpp.html", "de/d33/circular__linked__list_8cpp" ],
+    [ "circular_queue_using_array.cpp", "d3/dfb/circular__queue__using__array_8cpp_source.html", null ],
+    [ "get_size_of_linked_list.cpp", "d7/dab/get__size__of__linked__list_8cpp_source.html", null ],
     [ "inorder_successor_of_bst.cpp", "d4/d32/inorder__successor__of__bst_8cpp.html", "d4/d32/inorder__successor__of__bst_8cpp" ],
     [ "intersection_of_two_arrays.cpp", "de/dc5/intersection__of__two__arrays_8cpp.html", "de/dc5/intersection__of__two__arrays_8cpp" ],
+    [ "reverse_a_linked_list_using_recusion.cpp", "d8/d30/reverse__a__linked__list__using__recusion_8cpp_source.html", null ],
     [ "reverse_binary_tree.cpp", "d4/db6/reverse__binary__tree_8cpp.html", "d4/db6/reverse__binary__tree_8cpp" ],
+    [ "selectionsortlinkedlist.cpp", "d9/dcc/selectionsortlinkedlist_8cpp_source.html", null ],
     [ "trie_multiple_search.cpp", "d7/def/trie__multiple__search_8cpp.html", "d7/def/trie__multiple__search_8cpp" ],
     [ "union_of_two_arrays.cpp", "d8/d9c/union__of__two__arrays_8cpp.html", "d8/d9c/union__of__two__arrays_8cpp" ]
 ];
\ No newline at end of file
diff --git a/dir_4b6f782e158b0b98da980a0e11a23a15.html b/dir_4b6f782e158b0b98da980a0e11a23a15.html
index e3836d690..285442922 100644
--- a/dir_4b6f782e158b0b98da980a0e11a23a15.html
+++ b/dir_4b6f782e158b0b98da980a0e11a23a15.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: games Directory Reference</title>
+<title>TheAlgorithms/C++: games Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,7 +127,7 @@ $(function(){initNavTree('dir_4b6f782e158b0b98da980a0e11a23a15.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d92/memory__game_8cpp.html">memory_game.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dd/d92/memory__game_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d92/memory__game_8cpp.html">memory_game.cpp</a></td></tr>
 <tr class="memdesc:dd/d92/memory__game_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A simple <a href="https://en.wikipedia.org/wiki/Matching_game" target="_blank">Memory Game</a> with <b>3 different sizes</b> and multiple letters. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
diff --git a/dir_4d6e05837bf820fb089a8a8cdf2f42b7.html b/dir_4d6e05837bf820fb089a8a8cdf2f42b7.html
index 8f2a4448c..f7c14c4fa 100644
--- a/dir_4d6e05837bf820fb089a8a8cdf2f42b7.html
+++ b/dir_4d6e05837bf820fb089a8a8cdf2f42b7.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: ciphers Directory Reference</title>
+<title>TheAlgorithms/C++: ciphers Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -115,32 +132,34 @@ Directory dependency graph for ciphers:</div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/db6/a1z26__cipher_8cpp.html">a1z26_cipher.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/db6/a1z26__cipher_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/db6/a1z26__cipher_8cpp.html">a1z26_cipher.cpp</a></td></tr>
 <tr class="memdesc:de/db6/a1z26__cipher_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the <a href="https://www.dcode.fr/letter-number-cipher" target="_blank">A1Z26 cipher</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/dfb/atbash__cipher_8cpp.html">atbash_cipher.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dc/dfb/atbash__cipher_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/dfb/atbash__cipher_8cpp.html">atbash_cipher.cpp</a></td></tr>
 <tr class="memdesc:dc/dfb/atbash__cipher_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Atbash" target="_blank">Atbash Cipher</a> implementation <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d2c/caesar__cipher_8cpp.html">caesar_cipher.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/d1c/base64__encoding_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>base64_encoding.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/d2c/caesar__cipher_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d2c/caesar__cipher_8cpp.html">caesar_cipher.cpp</a></td></tr>
 <tr class="memdesc:d6/d2c/caesar__cipher_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Caesar_cipher" target="_blank">Caesar cipher</a> algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d2c/elliptic__curve__key__exchange_8cpp.html">elliptic_curve_key_exchange.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/d2c/elliptic__curve__key__exchange_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d2c/elliptic__curve__key__exchange_8cpp.html">elliptic_curve_key_exchange.cpp</a></td></tr>
 <tr class="memdesc:df/d2c/elliptic__curve__key__exchange_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://cryptobook.nakov.com/asymmetric-key-ciphers/ecdh-key-exchange" target="_blank">Elliptic Curve Diffie Hellman Key Exchange</a>. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/db9/hill__cipher_8cpp.html">hill_cipher.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/db9/hill__cipher_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/db9/hill__cipher_8cpp.html">hill_cipher.cpp</a></td></tr>
 <tr class="memdesc:d7/db9/hill__cipher_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Hill_cipher" target="_blank">Hill cipher</a> algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d76/morse__code_8cpp.html">morse_code.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/d76/morse__code_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d76/morse__code_8cpp.html">morse_code.cpp</a></td></tr>
 <tr class="memdesc:d8/d76/morse__code_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of [Morse Code] (<a href="https://en.wikipedia.org/wiki/Morse_code">https://en.wikipedia.org/wiki/Morse_code</a>). <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/d41/uint128__t_8hpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d41/uint128__t_8hpp.html">uint128_t.hpp</a></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/da3/uint256__t_8hpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/da3/uint256__t_8hpp.html">uint256_t.hpp</a></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d12/vigenere__cipher_8cpp.html">vigenere_cipher.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dd/d12/vigenere__cipher_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d12/vigenere__cipher_8cpp.html">vigenere_cipher.cpp</a></td></tr>
 <tr class="memdesc:dd/d12/vigenere__cipher_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Vigen%C3%A8re_cipher" target="_blank">Vigenère cipher</a> algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d4c/xor__cipher_8cpp.html">xor_cipher.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/d4c/xor__cipher_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d4c/xor__cipher_8cpp.html">xor_cipher.cpp</a></td></tr>
 <tr class="memdesc:d3/d4c/xor__cipher_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/XOR_cipher" target="_blank">XOR cipher</a> algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
diff --git a/dir_4d6e05837bf820fb089a8a8cdf2f42b7.js b/dir_4d6e05837bf820fb089a8a8cdf2f42b7.js
index 3985eb10e..79f8b4ed8 100644
--- a/dir_4d6e05837bf820fb089a8a8cdf2f42b7.js
+++ b/dir_4d6e05837bf820fb089a8a8cdf2f42b7.js
@@ -2,6 +2,7 @@ var dir_4d6e05837bf820fb089a8a8cdf2f42b7 =
 [
     [ "a1z26_cipher.cpp", "de/db6/a1z26__cipher_8cpp.html", "de/db6/a1z26__cipher_8cpp" ],
     [ "atbash_cipher.cpp", "dc/dfb/atbash__cipher_8cpp.html", "dc/dfb/atbash__cipher_8cpp" ],
+    [ "base64_encoding.cpp", "d1/d1c/base64__encoding_8cpp_source.html", null ],
     [ "caesar_cipher.cpp", "d6/d2c/caesar__cipher_8cpp.html", "d6/d2c/caesar__cipher_8cpp" ],
     [ "elliptic_curve_key_exchange.cpp", "df/d2c/elliptic__curve__key__exchange_8cpp.html", "df/d2c/elliptic__curve__key__exchange_8cpp" ],
     [ "hill_cipher.cpp", "d7/db9/hill__cipher_8cpp.html", "d7/db9/hill__cipher_8cpp" ],
diff --git a/dir_53e6fa9553ac22a5646d2a2b2d7b97a1.html b/dir_53e6fa9553ac22a5646d2a2b2d7b97a1.html
new file mode 100644
index 000000000..4597b56b6
--- /dev/null
+++ b/dir_53e6fa9553ac22a5646d2a2b2d7b97a1.html
@@ -0,0 +1,143 @@
+<!-- HTML header for doxygen 1.12.0-->
+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
+<head>
+<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
+<meta http-equiv="X-UA-Compatible" content="IE=11"/>
+<meta name="generator" content="Doxygen 1.12.0"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>TheAlgorithms/C++: scripts Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
+<link href="tabs.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="jquery.js"></script>
+<script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
+<script type="text/javascript" src="clipboard.js"></script>
+<link href="navtree.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="navtreedata.js"></script>
+<script type="text/javascript" src="navtree.js"></script>
+<script type="text/javascript" src="resize.js"></script>
+<script type="text/javascript" src="cookie.js"></script>
+<link href="search/search.css" rel="stylesheet" type="text/css"/>
+<script type="text/javascript" src="search/searchdata.js"></script>
+<script type="text/javascript" src="search/search.js"></script>
+<script type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
+</script>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
+<link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.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="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
+  <td id="projectalign">
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
+   </div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
+  </td>
+ </tr>
+ </tbody>
+</table>
+</div>
+<!-- end header part -->
+<!-- Generated by Doxygen 1.12.0 -->
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+var searchBox = new SearchBox("searchBox", "search/",'.html');
+/* @license-end */
+</script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() { codefold.init(0); });
+/* @license-end */
+</script>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function() {
+  initMenu('',true,false,'search.php','Search',true);
+  $(function() { init_search(); });
+});
+/* @license-end */
+</script>
+<div id="main-nav"></div>
+</div><!-- top -->
+<div id="side-nav" class="ui-resizable side-nav-resizable">
+  <div id="nav-tree">
+    <div id="nav-tree-contents">
+      <div id="nav-sync" class="sync"></div>
+    </div>
+  </div>
+  <div id="splitbar" style="-moz-user-select:none;" 
+       class="ui-resizable-handle">
+  </div>
+</div>
+<script type="text/javascript">
+/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
+$(function(){initNavTree('dir_53e6fa9553ac22a5646d2a2b2d7b97a1.html',''); initResizable(true); });
+/* @license-end */
+</script>
+<div id="doc-content">
+<!-- window showing the filter options -->
+<div id="MSearchSelectWindow"
+     onmouseover="return searchBox.OnSearchSelectShow()"
+     onmouseout="return searchBox.OnSearchSelectHide()"
+     onkeydown="return searchBox.OnSearchSelectKey(event)">
+</div>
+
+<!-- iframe showing the search results (closed by default) -->
+<div id="MSearchResultsWindow">
+<div id="MSearchResults">
+<div class="SRPage">
+<div id="SRIndex">
+<div id="SRResults"></div>
+<div class="SRStatus" id="Loading">Loading...</div>
+<div class="SRStatus" id="Searching">Searching...</div>
+<div class="SRStatus" id="NoMatches">No Matches</div>
+</div>
+</div>
+</div>
+</div>
+
+<div class="header">
+  <div class="headertitle"><div class="title">scripts Directory Reference</div></div>
+</div><!--header-->
+<div class="contents">
+<table class="memberdecls">
+<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
+Files</h2></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/d02/file__linter_8py_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>file_linter.py</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</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="navelem"><a class="el" href="dir_53e6fa9553ac22a5646d2a2b2d7b97a1.html">scripts</a></li>
+    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
+  </ul>
+</div>
+</body>
+</html>
diff --git a/dir_53e6fa9553ac22a5646d2a2b2d7b97a1.js b/dir_53e6fa9553ac22a5646d2a2b2d7b97a1.js
new file mode 100644
index 000000000..1fbe92b31
--- /dev/null
+++ b/dir_53e6fa9553ac22a5646d2a2b2d7b97a1.js
@@ -0,0 +1,4 @@
+var dir_53e6fa9553ac22a5646d2a2b2d7b97a1 =
+[
+    [ "file_linter.py", "d6/d02/file__linter_8py_source.html", null ]
+];
\ No newline at end of file
diff --git a/dir_59dc24c326e2a72d1164f014b22de83d.html b/dir_59dc24c326e2a72d1164f014b22de83d.html
index 58ee0508b..38df3aff2 100644
--- a/dir_59dc24c326e2a72d1164f014b22de83d.html
+++ b/dir_59dc24c326e2a72d1164f014b22de83d.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: physics Directory Reference</title>
+<title>TheAlgorithms/C++: physics Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,7 +127,7 @@ $(function(){initNavTree('dir_59dc24c326e2a72d1164f014b22de83d.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d29/ground__to__ground__projectile__motion_8cpp.html">ground_to_ground_projectile_motion.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d29/ground__to__ground__projectile__motion_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d29/ground__to__ground__projectile__motion_8cpp.html">ground_to_ground_projectile_motion.cpp</a></td></tr>
 <tr class="memdesc:d9/d29/ground__to__ground__projectile__motion_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Ground to ground <a href="https://en.wikipedia.org/wiki/Projectile_motion" target="_blank">projectile motion</a> equation implementations. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
diff --git a/dir_73a3cc5065b223eb41b02873c0e19f0e.html b/dir_73a3cc5065b223eb41b02873c0e19f0e.html
index 6b2036b11..c03f97d6e 100644
--- a/dir_73a3cc5065b223eb41b02873c0e19f0e.html
+++ b/dir_73a3cc5065b223eb41b02873c0e19f0e.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: strings Directory Reference</title>
+<title>TheAlgorithms/C++: strings Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,28 +127,28 @@ $(function(){initNavTree('dir_73a3cc5065b223eb41b02873c0e19f0e.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/db2/boyer__moore_8cpp.html">boyer_moore.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/db2/boyer__moore_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/db2/boyer__moore_8cpp.html">boyer_moore.cpp</a></td></tr>
 <tr class="memdesc:d3/db2/boyer__moore_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">The <a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm" target="_blank">Boyer–Moore</a> algorithm searches for occurrences of pattern P in text T by performing explicit character comparisons at different alignments. Instead of a brute-force search of all alignments (of which there are n - m + 1), Boyer–Moore uses information gained by preprocessing P to skip as many alignments as possible. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html">brute_force_string_searching.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/d7d/brute__force__string__searching_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html">brute_force_string_searching.cpp</a></td></tr>
 <tr class="memdesc:d3/d7d/brute__force__string__searching_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">String pattern search - brute force. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d09/duval_8cpp.html">duval.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/d09/duval_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d09/duval_8cpp.html">duval.cpp</a></td></tr>
 <tr class="memdesc:db/d09/duval_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Lyndon_word" target="_blank">Duval's algorithm</a>. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/dfe/horspool_8cpp.html">horspool.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/dfe/horspool_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/dfe/horspool_8cpp.html">horspool.cpp</a></td></tr>
 <tr class="memdesc:d3/dfe/horspool_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Horspool's algorithm that finds if a string contains a substring (<a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm">https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm</a>) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html">knuth_morris_pratt.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d6a/knuth__morris__pratt_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html">knuth_morris_pratt.cpp</a></td></tr>
 <tr class="memdesc:de/d6a/knuth__morris__pratt_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">The <a href="https://en.wikipedia.org/wiki/Knuth–Morris–Pratt_algorithm" target="_blank">Knuth-Morris-Pratt Algorithm</a> for finding a pattern within a piece of text with complexity O(n + m) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d39/manacher__algorithm_8cpp.html">manacher_algorithm.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/d39/manacher__algorithm_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d39/manacher__algorithm_8cpp.html">manacher_algorithm.cpp</a></td></tr>
 <tr class="memdesc:d3/d39/manacher__algorithm_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Longest_palindromic_substring" target="_blank">Manacher's Algorithm</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/dce/rabin__karp_8cpp.html">rabin_karp.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/dce/rabin__karp_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/dce/rabin__karp_8cpp.html">rabin_karp.cpp</a></td></tr>
 <tr class="memdesc:d6/dce/rabin__karp_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">The <a href="https://en.wikipedia.org/wiki/Rabin–Karp_algorithm" target="_blank">Rabin-Karp Algorithm</a> for finding a pattern within a piece of text with complexity O(n + m) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d80/z__function_8cpp.html">z_function.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/d80/z__function_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d80/z__function_8cpp.html">z_function.cpp</a></td></tr>
 <tr class="memdesc:d3/d80/z__function_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">The <a href="https://cp-algorithms.com/string/z-function.html" target="_blank">Z function</a> for finding occurences of a pattern within a piece of text with time and space complexity O(n + m) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
diff --git a/dir_82e494173a87936756866de2fa774307.html b/dir_82e494173a87936756866de2fa774307.html
index 745c2cc1b..dec00b6fd 100644
--- a/dir_82e494173a87936756866de2fa774307.html
+++ b/dir_82e494173a87936756866de2fa774307.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: probability Directory Reference</title>
+<title>TheAlgorithms/C++: probability Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,25 +127,25 @@ $(function(){initNavTree('dir_82e494173a87936756866de2fa774307.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d4a/addition__rule_8cpp.html">addition_rule.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/d4a/addition__rule_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d4a/addition__rule_8cpp.html">addition_rule.cpp</a></td></tr>
 <tr class="memdesc:d6/d4a/addition__rule_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Addition rule of probabilities. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d67/bayes__theorem_8cpp.html">bayes_theorem.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/d67/bayes__theorem_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d67/bayes__theorem_8cpp.html">bayes_theorem.cpp</a></td></tr>
 <tr class="memdesc:d5/d67/bayes__theorem_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Bayes%27_theorem" target="_blank">Bayes' theorem</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/db0/binomial__dist_8cpp.html">binomial_dist.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/db0/binomial__dist_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/db0/binomial__dist_8cpp.html">binomial_dist.cpp</a></td></tr>
 <tr class="memdesc:d6/db0/binomial__dist_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Binomial_distribution" target="_blank">Binomial distribution</a> example <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/da2/exponential__dist_8cpp.html">exponential_dist.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/da2/exponential__dist_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/da2/exponential__dist_8cpp.html">exponential_dist.cpp</a></td></tr>
 <tr class="memdesc:d9/da2/exponential__dist_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Exponential_distribution" target="_blank">Exponential Distribution</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d72/geometric__dist_8cpp.html">geometric_dist.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d72/geometric__dist_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d72/geometric__dist_8cpp.html">geometric_dist.cpp</a></td></tr>
 <tr class="memdesc:de/d72/geometric__dist_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Geometric_distribution" target="_blank">Geometric Distribution</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d24/poisson__dist_8cpp.html">poisson_dist.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d24/poisson__dist_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d24/poisson__dist_8cpp.html">poisson_dist.cpp</a></td></tr>
 <tr class="memdesc:d9/d24/poisson__dist_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Poisson_distribution" target="_blank">Poisson statistics</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/ded/windowed__median_8cpp.html">windowed_median.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/ded/windowed__median_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/ded/windowed__median_8cpp.html">windowed_median.cpp</a></td></tr>
 <tr class="memdesc:d1/ded/windowed__median_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">An implementation of a median calculation of a sliding window along a data stream. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
diff --git a/dir_8a20dd5bfd5341a725342bf72b6b686f.html b/dir_8a20dd5bfd5341a725342bf72b6b686f.html
index 34c5826b3..2cd80f420 100644
--- a/dir_8a20dd5bfd5341a725342bf72b6b686f.html
+++ b/dir_8a20dd5bfd5341a725342bf72b6b686f.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: dynamic_programming Directory Reference</title>
+<title>TheAlgorithms/C++: dynamic_programming Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,61 +127,85 @@ $(function(){initNavTree('dir_8a20dd5bfd5341a725342bf72b6b686f.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d16/0__1__knapsack_8cpp.html">0_1_knapsack.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/d16/0__1__knapsack_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d16/0__1__knapsack_8cpp.html">0_1_knapsack.cpp</a></td></tr>
 <tr class="memdesc:db/d16/0__1__knapsack_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of [0-1 <a class="el" href="d7/daf/namespace_knapsack.html" title="Implementation of 0-1 Knapsack problem.">Knapsack</a> Problem] (<a href="https://en.wikipedia.org/wiki/Knapsack_problem">https://en.wikipedia.org/wiki/Knapsack_problem</a>) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d73/abbreviation_8cpp.html">abbreviation.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/d73/abbreviation_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d73/abbreviation_8cpp.html">abbreviation.cpp</a></td></tr>
 <tr class="memdesc:d7/d73/abbreviation_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://www.hackerrank.com/challenges/abbr/problem" target="_blank">Abbrievation</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/da7/armstrong__number__templated_8cpp.html">armstrong_number_templated.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/da7/armstrong__number__templated_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/da7/armstrong__number__templated_8cpp.html">armstrong_number_templated.cpp</a></td></tr>
 <tr class="memdesc:d1/da7/armstrong__number__templated_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Checks whether a number is an <a href="https://en.wikipedia.org/wiki/Narcissistic_number" target="_blank">Armstrong Number</a> or not. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dd9/catalan__numbers_8cpp.html">catalan_numbers.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/d14/bellman__ford_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>bellman_ford.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/dd9/catalan__numbers_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dd9/catalan__numbers_8cpp.html">catalan_numbers.cpp</a></td></tr>
 <tr class="memdesc:de/dd9/catalan__numbers_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Provides utilities to compute Catalan numbers using dynamic programming. A Catalan numbers satisfy these recurrence relations: C(0) = C(1) = 1; C(n) = sum(C(i).C(n-i-1)), for i = 0 to n-1 Read more about Catalan numbers here: <a href="https://en.wikipedia.org/wiki/Catalan_number">https://en.wikipedia.org/wiki/Catalan_number</a> <a href="https://oeis.org/A000108/">https://oeis.org/A000108/</a>. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d31/coin__change__topdown_8cpp.html">coin_change_topdown.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d6b/coin__change_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>coin_change.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d31/coin__change__topdown_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d31/coin__change__topdown_8cpp.html">coin_change_topdown.cpp</a></td></tr>
 <tr class="memdesc:d9/d31/coin__change__topdown_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://leetcode.com/problems/coin-change/" target="_blank">Minimum coins</a> change problem is a problem used to find the minimum number of coins required to completely reach a target amount. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d10/cut__rod_8cpp.html">cut_rod.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/d10/cut__rod_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d10/cut__rod_8cpp.html">cut_rod.cpp</a></td></tr>
 <tr class="memdesc:d6/d10/cut__rod_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of cutting a rod problem. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d26/house__robber_8cpp.html">house_robber.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/d82/edit__distance_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>edit_distance.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d2/d7d/egg__dropping__puzzle_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>egg_dropping_puzzle.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/d7c/fibonacci__bottom__up_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>fibonacci_bottom_up.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/d31/floyd__warshall_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>floyd_warshall.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/d26/house__robber_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d26/house__robber_8cpp.html">house_robber.cpp</a></td></tr>
 <tr class="memdesc:d6/d26/house__robber_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://labuladong.gitbook.io/algo-en/i.-dynamic-programming/houserobber" target="_blank">House Robber Problem</a> algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/da0/kadane_8cpp.html">kadane.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/da0/kadane_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/da0/kadane_8cpp.html">kadane.cpp</a></td></tr>
 <tr class="memdesc:d4/da0/kadane_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm" target="_blank">Kadane Algorithm</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d0d/longest__common__string_8cpp.html">longest_common_string.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/d0d/longest__common__string_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d0d/longest__common__string_8cpp.html">longest_common_string.cpp</a></td></tr>
 <tr class="memdesc:da/d0d/longest__common__string_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">contains the definition of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d57/longest__increasing__subsequence_8cpp.html">longest_increasing_subsequence.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/def/longest__common__subsequence_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>longest_common_subsequence.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/d57/longest__increasing__subsequence_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d57/longest__increasing__subsequence_8cpp.html">longest_increasing_subsequence.cpp</a></td></tr>
 <tr class="memdesc:d7/d57/longest__increasing__subsequence_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Calculate the length of the <a href="https://en.wikipedia.org/wiki/Longest_increasing_subsequence" target="_blank">longest increasing subsequence</a> in an array. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d77/longest__palindromic__subsequence_8cpp.html">longest_palindromic_subsequence.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/d21/longest__increasing__subsequence__nlogn_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>longest_increasing_subsequence_nlogn.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d0/d77/longest__palindromic__subsequence_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d77/longest__palindromic__subsequence_8cpp.html">longest_palindromic_subsequence.cpp</a></td></tr>
 <tr class="memdesc:d0/d77/longest__palindromic__subsequence_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Program to find the <a href="https://www.geeksforgeeks.org/longest-palindromic-subsequence-dp-12/" target="_blank">Longest Palindormic Subsequence</a> of a string. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/dfb/maximum__circular__subarray_8cpp.html">maximum_circular_subarray.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d2/da2/matrix__chain__multiplication_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>matrix_chain_multiplication.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/dfb/maximum__circular__subarray_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/dfb/maximum__circular__subarray_8cpp.html">maximum_circular_subarray.cpp</a></td></tr>
 <tr class="memdesc:db/dfb/maximum__circular__subarray_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">C++ program for maximum contiguous circular sum problem using <a href="https://en.wikipedia.org/wiki/Maximum_subarray_problem" target="_blank">Kadane's Algorithm</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d52/minimum__edit__distance_8cpp.html">minimum_edit_distance.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/d52/minimum__edit__distance_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d52/minimum__edit__distance_8cpp.html">minimum_edit_distance.cpp</a></td></tr>
 <tr class="memdesc:da/d52/minimum__edit__distance_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Edit_distance" target="_blank">Minimum Edit Distance</a> using Dynamic Programing. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d90/palindrome__partitioning_8cpp.html">palindrome_partitioning.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/d90/palindrome__partitioning_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d90/palindrome__partitioning_8cpp.html">palindrome_partitioning.cpp</a></td></tr>
 <tr class="memdesc:d5/d90/palindrome__partitioning_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implements <a href="https://leetcode.com/problems/palindrome-partitioning-ii/" target="_blank">Palindrome Partitioning</a> algorithm, giving you the minimum number of partitions you need to make. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d65/shortest__common__supersequence_8cpp.html">shortest_common_supersequence.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d8c/partition__problem_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>partition_problem.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/d68/searching__of__element__in__dynamic__array_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>searching_of_element_in_dynamic_array.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/d65/shortest__common__supersequence_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d65/shortest__common__supersequence_8cpp.html">shortest_common_supersequence.cpp</a></td></tr>
 <tr class="memdesc:d7/d65/shortest__common__supersequence_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">SCS is a string Z which is the shortest supersequence of strings X and Y (may not be continuous in Z, but order is maintained). <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d67/subset__sum__dynamic_8cpp.html">subset_sum_dynamic.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dc/d67/subset__sum__dynamic_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d67/subset__sum__dynamic_8cpp.html">subset_sum_dynamic.cpp</a></td></tr>
 <tr class="memdesc:dc/d67/subset__sum__dynamic_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implements [Sub-set sum problem] (<a href="https://en.wikipedia.org/wiki/Subset_sum_problem">https://en.wikipedia.org/wiki/Subset_sum_problem</a>) algorithm, which tells whether a subset with target sum exists or not. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d80/trapped__rainwater_8cpp.html">trapped_rainwater.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d80/trapped__rainwater_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d80/trapped__rainwater_8cpp.html">trapped_rainwater.cpp</a></td></tr>
 <tr class="memdesc:d9/d80/trapped__rainwater_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the <a href="https://www.geeksforgeeks.org/trapping-rain-water/" target="_blank">Trapped Rainwater Problem</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/dec/unbounded__0__1__knapsack_8cpp.html">unbounded_0_1_knapsack.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d77/tree__height_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>tree_height.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/dec/unbounded__0__1__knapsack_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/dec/unbounded__0__1__knapsack_8cpp.html">unbounded_0_1_knapsack.cpp</a></td></tr>
 <tr class="memdesc:d9/dec/unbounded__0__1__knapsack_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the Unbounded 0/1 <a class="el" href="d7/daf/namespace_knapsack.html" title="Implementation of 0-1 Knapsack problem.">Knapsack</a> Problem. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d84/word__break_8cpp.html">word_break.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/d84/word__break_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d84/word__break_8cpp.html">word_break.cpp</a></td></tr>
 <tr class="memdesc:d3/d84/word__break_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://leetcode.com/problems/word-break/" target="_blank">Word Break Problem</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
diff --git a/dir_8a20dd5bfd5341a725342bf72b6b686f.js b/dir_8a20dd5bfd5341a725342bf72b6b686f.js
index a96479ead..0af5548c1 100644
--- a/dir_8a20dd5bfd5341a725342bf72b6b686f.js
+++ b/dir_8a20dd5bfd5341a725342bf72b6b686f.js
@@ -3,20 +3,32 @@ var dir_8a20dd5bfd5341a725342bf72b6b686f =
     [ "0_1_knapsack.cpp", "db/d16/0__1__knapsack_8cpp.html", "db/d16/0__1__knapsack_8cpp" ],
     [ "abbreviation.cpp", "d7/d73/abbreviation_8cpp.html", "d7/d73/abbreviation_8cpp" ],
     [ "armstrong_number_templated.cpp", "d1/da7/armstrong__number__templated_8cpp.html", "d1/da7/armstrong__number__templated_8cpp" ],
+    [ "bellman_ford.cpp", "df/d14/bellman__ford_8cpp_source.html", null ],
     [ "catalan_numbers.cpp", "de/dd9/catalan__numbers_8cpp.html", "de/dd9/catalan__numbers_8cpp" ],
+    [ "coin_change.cpp", "d9/d6b/coin__change_8cpp_source.html", null ],
     [ "coin_change_topdown.cpp", "d9/d31/coin__change__topdown_8cpp.html", "d9/d31/coin__change__topdown_8cpp" ],
     [ "cut_rod.cpp", "d6/d10/cut__rod_8cpp.html", "d6/d10/cut__rod_8cpp" ],
+    [ "edit_distance.cpp", "d5/d82/edit__distance_8cpp_source.html", null ],
+    [ "egg_dropping_puzzle.cpp", "d2/d7d/egg__dropping__puzzle_8cpp_source.html", null ],
+    [ "fibonacci_bottom_up.cpp", "d1/d7c/fibonacci__bottom__up_8cpp_source.html", null ],
+    [ "floyd_warshall.cpp", "df/d31/floyd__warshall_8cpp_source.html", null ],
     [ "house_robber.cpp", "d6/d26/house__robber_8cpp.html", "d6/d26/house__robber_8cpp" ],
     [ "kadane.cpp", "d4/da0/kadane_8cpp.html", "d4/da0/kadane_8cpp" ],
     [ "longest_common_string.cpp", "da/d0d/longest__common__string_8cpp.html", "da/d0d/longest__common__string_8cpp" ],
+    [ "longest_common_subsequence.cpp", "d4/def/longest__common__subsequence_8cpp_source.html", null ],
     [ "longest_increasing_subsequence.cpp", "d7/d57/longest__increasing__subsequence_8cpp.html", "d7/d57/longest__increasing__subsequence_8cpp" ],
+    [ "longest_increasing_subsequence_nlogn.cpp", "d5/d21/longest__increasing__subsequence__nlogn_8cpp_source.html", null ],
     [ "longest_palindromic_subsequence.cpp", "d0/d77/longest__palindromic__subsequence_8cpp.html", "d0/d77/longest__palindromic__subsequence_8cpp" ],
+    [ "matrix_chain_multiplication.cpp", "d2/da2/matrix__chain__multiplication_8cpp_source.html", null ],
     [ "maximum_circular_subarray.cpp", "db/dfb/maximum__circular__subarray_8cpp.html", "db/dfb/maximum__circular__subarray_8cpp" ],
     [ "minimum_edit_distance.cpp", "da/d52/minimum__edit__distance_8cpp.html", "da/d52/minimum__edit__distance_8cpp" ],
     [ "palindrome_partitioning.cpp", "d5/d90/palindrome__partitioning_8cpp.html", "d5/d90/palindrome__partitioning_8cpp" ],
+    [ "partition_problem.cpp", "de/d8c/partition__problem_8cpp_source.html", null ],
+    [ "searching_of_element_in_dynamic_array.cpp", "da/d68/searching__of__element__in__dynamic__array_8cpp_source.html", null ],
     [ "shortest_common_supersequence.cpp", "d7/d65/shortest__common__supersequence_8cpp.html", "d7/d65/shortest__common__supersequence_8cpp" ],
     [ "subset_sum_dynamic.cpp", "dc/d67/subset__sum__dynamic_8cpp.html", "dc/d67/subset__sum__dynamic_8cpp" ],
     [ "trapped_rainwater.cpp", "d9/d80/trapped__rainwater_8cpp.html", "d9/d80/trapped__rainwater_8cpp" ],
+    [ "tree_height.cpp", "de/d77/tree__height_8cpp_source.html", null ],
     [ "unbounded_0_1_knapsack.cpp", "d9/dec/unbounded__0__1__knapsack_8cpp.html", "d9/dec/unbounded__0__1__knapsack_8cpp" ],
     [ "word_break.cpp", "d3/d84/word__break_8cpp.html", "d3/d84/word__break_8cpp" ]
 ];
\ No newline at end of file
diff --git a/dir_93bc990c5cceb745f78af6949e9ef947.html b/dir_93bc990c5cceb745f78af6949e9ef947.html
index 65bca9cab..b57716d3f 100644
--- a/dir_93bc990c5cceb745f78af6949e9ef947.html
+++ b/dir_93bc990c5cceb745f78af6949e9ef947.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: divide_and_conquer Directory Reference</title>
+<title>TheAlgorithms/C++: divide_and_conquer Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,9 +127,11 @@ $(function(){initNavTree('dir_93bc990c5cceb745f78af6949e9ef947.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html">karatsuba_algorithm_for_fast_multiplication.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html">karatsuba_algorithm_for_fast_multiplication.cpp</a></td></tr>
 <tr class="memdesc:da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the <a href="https://en.wikipedia.org/wiki/Karatsuba_algorithm" target="_blank">Karatsuba algorithm for fast multiplication</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d0/dea/strassen__matrix__multiplication_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>strassen_matrix_multiplication.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dir_93bc990c5cceb745f78af6949e9ef947.js b/dir_93bc990c5cceb745f78af6949e9ef947.js
index 38a80c977..8536b76f1 100644
--- a/dir_93bc990c5cceb745f78af6949e9ef947.js
+++ b/dir_93bc990c5cceb745f78af6949e9ef947.js
@@ -1,4 +1,5 @@
 var dir_93bc990c5cceb745f78af6949e9ef947 =
 [
-    [ "karatsuba_algorithm_for_fast_multiplication.cpp", "da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html", "da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp" ]
+    [ "karatsuba_algorithm_for_fast_multiplication.cpp", "da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html", "da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp" ],
+    [ "strassen_matrix_multiplication.cpp", "d0/dea/strassen__matrix__multiplication_8cpp_source.html", null ]
 ];
\ No newline at end of file
diff --git a/dir_9510827d0b234b3cc54b29892f217477.html b/dir_9510827d0b234b3cc54b29892f217477.html
index eef24b88c..3d293ebf4 100644
--- a/dir_9510827d0b234b3cc54b29892f217477.html
+++ b/dir_9510827d0b234b3cc54b29892f217477.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: others Directory Reference</title>
+<title>TheAlgorithms/C++: others Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,82 +127,84 @@ $(function(){initNavTree('dir_9510827d0b234b3cc54b29892f217477.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/d76/buzz__number_8cpp.html">buzz_number.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/d76/buzz__number_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/d76/buzz__number_8cpp.html">buzz_number.cpp</a></td></tr>
 <tr class="memdesc:d1/d76/buzz__number_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A buzz number is a number that is either divisible by 7 or has last digit as 7. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d06/decimal__to__binary_8cpp.html">decimal_to_binary.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/d06/decimal__to__binary_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d06/decimal__to__binary_8cpp.html">decimal_to_binary.cpp</a></td></tr>
 <tr class="memdesc:df/d06/decimal__to__binary_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to convert decimal number to binary representation. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/de7/decimal__to__hexadecimal_8cpp.html">decimal_to_hexadecimal.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/de7/decimal__to__hexadecimal_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/de7/decimal__to__hexadecimal_8cpp.html">decimal_to_hexadecimal.cpp</a></td></tr>
 <tr class="memdesc:da/de7/decimal__to__hexadecimal_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Convert decimal number to hexadecimal representation. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html">decimal_to_roman_numeral.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d85/decimal__to__roman__numeral_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html">decimal_to_roman_numeral.cpp</a></td></tr>
 <tr class="memdesc:de/d85/decimal__to__roman__numeral_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">This Programme Converts a given decimal number in the range [0,4000) to both Lower case and Upper case Roman Numeral. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/df0/fast__integer__input_8cpp.html">fast_integer_input.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/d4e/easter_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>easter.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/df0/fast__integer__input_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/df0/fast__integer__input_8cpp.html">fast_integer_input.cpp</a></td></tr>
 <tr class="memdesc:d9/df0/fast__integer__input_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Read integers from stdin continuously as they are entered without waiting for the <code>\n</code> character. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/df3/happy__number_8cpp.html">happy_number.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/df3/happy__number_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/df3/happy__number_8cpp.html">happy_number.cpp</a></td></tr>
 <tr class="memdesc:db/df3/happy__number_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A happy number is a number whose sum of digits is calculated until the sum is a single digit, and this sum turns out to be 1. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d90/iterative__tree__traversals_8cpp.html">iterative_tree_traversals.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/d90/iterative__tree__traversals_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d90/iterative__tree__traversals_8cpp.html">iterative_tree_traversals.cpp</a></td></tr>
 <tr class="memdesc:d8/d90/iterative__tree__traversals_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Iterative version of Preorder, Postorder, and preorder [Traversal of the Tree] (<a href="https://en.wikipedia.org/wiki/Tree_traversal">https://en.wikipedia.org/wiki/Tree_traversal</a>) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dcd/kadanes3_8cpp.html">kadanes3.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/dcd/kadanes3_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dcd/kadanes3_8cpp.html">kadanes3.cpp</a></td></tr>
 <tr class="memdesc:de/dcd/kadanes3_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Efficient implementation for maximum contiguous subarray sum by <a href="https://www.geeksforgeeks.org/largest-sum-contiguous-subarray/" target="_blank">Kadane's algorithm</a>. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html">kelvin_to_celsius.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/d6b/kelvin__to__celsius_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html">kelvin_to_celsius.cpp</a></td></tr>
 <tr class="memdesc:db/d6b/kelvin__to__celsius_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Conversion from <a href="https://byjus.com/chemistry/kelvin-to-celsius/" target="_blank">Kelvin to Celsius</a> degrees. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d65/lfu__cache_8cpp.html">lfu_cache.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d65/lfu__cache_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d65/lfu__cache_8cpp.html">lfu_cache.cpp</a></td></tr>
 <tr class="memdesc:d9/d65/lfu__cache_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation for [LFU Cache] (<a href="https://en.wikipedia.org/wiki/Least_frequently_used">https://en.wikipedia.org/wiki/Least_frequently_used</a>) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/db8/longest__substring__without__repeating__characters_8cpp.html">longest_substring_without_repeating_characters.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/db8/longest__substring__without__repeating__characters_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/db8/longest__substring__without__repeating__characters_8cpp.html">longest_substring_without_repeating_characters.cpp</a></td></tr>
 <tr class="memdesc:d4/db8/longest__substring__without__repeating__characters_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="dd/d4f/class_solution.html">Solution</a> for Longest Substring Without Repeating Characters problem. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/db3/lru__cache_8cpp.html">lru_cache.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/db3/lru__cache_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/db3/lru__cache_8cpp.html">lru_cache.cpp</a></td></tr>
 <tr class="memdesc:d3/db3/lru__cache_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">An implementation of <a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU)" target="_blank">LRU Cache</a>. Lru is a part of cache algorithms (also frequently called cache replacement algorithms or cache replacement policies). <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/daa/lru__cache2_8cpp.html">lru_cache2.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dc/daa/lru__cache2_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/daa/lru__cache2_8cpp.html">lru_cache2.cpp</a></td></tr>
 <tr class="memdesc:dc/daa/lru__cache2_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation for [LRU Cache] (<a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Least%20Recently%20Used%20(LRU)">https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Least%20Recently%20Used%20(LRU)</a>) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d35/matrix__exponentiation_8cpp.html">matrix_exponentiation.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/d35/matrix__exponentiation_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d35/matrix__exponentiation_8cpp.html">matrix_exponentiation.cpp</a></td></tr>
 <tr class="memdesc:d7/d35/matrix__exponentiation_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Matrix Exponentiation. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d9a/palindrome__of__number_8cpp.html">palindrome_of_number.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/d9a/palindrome__of__number_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d9a/palindrome__of__number_8cpp.html">palindrome_of_number.cpp</a></td></tr>
 <tr class="memdesc:da/d9a/palindrome__of__number_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Check if a number is <a href="https://en.wikipedia.org/wiki/Palindrome" target="_blank">palindrome</a> or not. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/dc5/paranthesis__matching_8cpp.html">paranthesis_matching.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dc/dc5/paranthesis__matching_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/dc5/paranthesis__matching_8cpp.html">paranthesis_matching.cpp</a></td></tr>
 <tr class="memdesc:dc/dc5/paranthesis__matching_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Perform paranthesis matching. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d1a/pascal__triangle_8cpp.html">pascal_triangle.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dc/d1a/pascal__triangle_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d1a/pascal__triangle_8cpp.html">pascal_triangle.cpp</a></td></tr>
 <tr class="memdesc:dc/d1a/pascal__triangle_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Pascal's triangle implementation. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d75/postfix__evaluation_8cpp.html">postfix_evaluation.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/d75/postfix__evaluation_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d75/postfix__evaluation_8cpp.html">postfix_evaluation.cpp</a></td></tr>
 <tr class="memdesc:d7/d75/postfix__evaluation_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Evaluation of <a href="https://en.wikipedia.org/wiki/Reverse_Polish_notation" target="_blank">Postfix Expression</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d7b/primality__test_8cpp.html">primality_test.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/d7b/primality__test_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d7b/primality__test_8cpp.html">primality_test.cpp</a></td></tr>
 <tr class="memdesc:da/d7b/primality__test_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Primality_test" target="_blank">Primality test</a> implementation. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html">recursive_tree_traversal.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dc/de1/recursive__tree__traversal_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html">recursive_tree_traversal.cpp</a></td></tr>
 <tr class="memdesc:dc/de1/recursive__tree__traversal_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive version of Inorder, Preorder, and Postorder [Traversal of the Tree] (<a href="https://en.wikipedia.org/wiki/Tree_traversal">https://en.wikipedia.org/wiki/Tree_traversal</a>) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d01/smallest__circle_8cpp.html">smallest_circle.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d0/d01/smallest__circle_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d01/smallest__circle_8cpp.html">smallest_circle.cpp</a></td></tr>
 <tr class="memdesc:d0/d01/smallest__circle_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get centre and radius of the <a href="https://en.wikipedia.org/wiki/Smallest-circle_problem" target="_blank">smallest circle</a> that circumscribes given set of points. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d19/sparse__matrix_8cpp.html">sparse_matrix.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/d19/sparse__matrix_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d19/sparse__matrix_8cpp.html">sparse_matrix.cpp</a></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d07/spiral__print_8cpp.html">spiral_print.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/d07/spiral__print_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d07/spiral__print_8cpp.html">spiral_print.cpp</a></td></tr>
 <tr class="memdesc:db/d07/spiral__print_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Print the elements of a matrix traversing it spirally. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/def/stairs__pattern_8cpp.html">stairs_pattern.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/def/stairs__pattern_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/def/stairs__pattern_8cpp.html">stairs_pattern.cpp</a></td></tr>
 <tr class="memdesc:d5/def/stairs__pattern_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">This program is use to print the following pattern. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d3c/tower__of__hanoi_8cpp.html">tower_of_hanoi.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/d3c/tower__of__hanoi_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d3c/tower__of__hanoi_8cpp.html">tower_of_hanoi.cpp</a></td></tr>
 <tr class="memdesc:db/d3c/tower__of__hanoi_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Solve the <a href="https://en.wikipedia.org/wiki/Tower_of_Hanoi" target="_blank">Tower of Hanoi</a> problem. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d61/vector__important__functions_8cpp.html">vector_important_functions.cpp</a></td></tr>
-<tr class="memdesc:d3/d61/vector__important__functions_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A C++ program to demonstrate working of <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort()</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse()</a> <br /></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/d61/vector__important__functions_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d61/vector__important__functions_8cpp.html">vector_important_functions.cpp</a></td></tr>
+<tr class="memdesc:d3/d61/vector__important__functions_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A C++ program to demonstrate working of std::sort(), std::reverse() <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 </div><!-- contents -->
diff --git a/dir_9510827d0b234b3cc54b29892f217477.js b/dir_9510827d0b234b3cc54b29892f217477.js
index f648abcff..26933fa54 100644
--- a/dir_9510827d0b234b3cc54b29892f217477.js
+++ b/dir_9510827d0b234b3cc54b29892f217477.js
@@ -4,6 +4,7 @@ var dir_9510827d0b234b3cc54b29892f217477 =
     [ "decimal_to_binary.cpp", "df/d06/decimal__to__binary_8cpp.html", "df/d06/decimal__to__binary_8cpp" ],
     [ "decimal_to_hexadecimal.cpp", "da/de7/decimal__to__hexadecimal_8cpp.html", "da/de7/decimal__to__hexadecimal_8cpp" ],
     [ "decimal_to_roman_numeral.cpp", "de/d85/decimal__to__roman__numeral_8cpp.html", "de/d85/decimal__to__roman__numeral_8cpp" ],
+    [ "easter.cpp", "d6/d4e/easter_8cpp_source.html", null ],
     [ "fast_integer_input.cpp", "d9/df0/fast__integer__input_8cpp.html", "d9/df0/fast__integer__input_8cpp" ],
     [ "happy_number.cpp", "db/df3/happy__number_8cpp.html", "db/df3/happy__number_8cpp" ],
     [ "iterative_tree_traversals.cpp", "d8/d90/iterative__tree__traversals_8cpp.html", "d8/d90/iterative__tree__traversals_8cpp" ],
diff --git a/dir_9c6faab82c22511b50177aa2e38e2780.html b/dir_9c6faab82c22511b50177aa2e38e2780.html
index acb63477f..3eb6a316e 100644
--- a/dir_9c6faab82c22511b50177aa2e38e2780.html
+++ b/dir_9c6faab82c22511b50177aa2e38e2780.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: numerical_methods Directory Reference</title>
+<title>TheAlgorithms/C++: numerical_methods Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,73 +127,73 @@ $(function(){initNavTree('dir_9c6faab82c22511b50177aa2e38e2780.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d9c/babylonian__method_8cpp.html">babylonian_method.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dc/d9c/babylonian__method_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d9c/babylonian__method_8cpp.html">babylonian_method.cpp</a></td></tr>
 <tr class="memdesc:dc/d9c/babylonian__method_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Babylonian_method" target="_blank">A babylonian method (BM)</a> is an algorithm that computes the square root. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d6a/bisection__method_8cpp.html">bisection_method.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/d6a/bisection__method_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d6a/bisection__method_8cpp.html">bisection_method.cpp</a></td></tr>
 <tr class="memdesc:d7/d6a/bisection__method_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Solve the equation \(f(x)=0\) using <a href="https://en.wikipedia.org/wiki/Bisection_method" target="_blank">bisection method</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d01/brent__method__extrema_8cpp.html">brent_method_extrema.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/d01/brent__method__extrema_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d01/brent__method__extrema_8cpp.html">brent_method_extrema.cpp</a></td></tr>
 <tr class="memdesc:db/d01/brent__method__extrema_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Find real extrema of a univariate real function in a given interval using <a href="https://en.wikipedia.org/wiki/Brent%27s_method" target="_blank">Brent's method</a>. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d18/composite__simpson__rule_8cpp.html">composite_simpson_rule.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d18/composite__simpson__rule_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d18/composite__simpson__rule_8cpp.html">composite_simpson_rule.cpp</a></td></tr>
 <tr class="memdesc:d4/d18/composite__simpson__rule_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the Composite Simpson Rule for the approximation. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/df2/durand__kerner__roots_8cpp.html">durand_kerner_roots.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/df2/durand__kerner__roots_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/df2/durand__kerner__roots_8cpp.html">durand_kerner_roots.cpp</a></td></tr>
 <tr class="memdesc:da/df2/durand__kerner__roots_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute all possible approximate roots of any given polynomial using <a href="https://en.wikipedia.org/wiki/Durand%E2%80%93Kerner_method" target="_blank">Durand Kerner algorithm</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d29/false__position_8cpp.html">false_position.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dd/d29/false__position_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d29/false__position_8cpp.html">false_position.cpp</a></td></tr>
 <tr class="memdesc:dd/d29/false__position_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Solve the equation \(f(x)=0\) using <a href="https://en.wikipedia.org/wiki/Regula_falsi" target="_blank">false position method</a>, also known as the Secant method. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d9a/fast__fourier__transform_8cpp.html">fast_fourier_transform.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/d9a/fast__fourier__transform_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d9a/fast__fourier__transform_8cpp.html">fast_fourier_transform.cpp</a></td></tr>
 <tr class="memdesc:d8/d9a/fast__fourier__transform_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://medium.com/@aiswaryamathur/understanding-fast-fouriertransform-from-scratch-to-solve-polynomial-multiplication-8018d511162f" target="_blank">A fast Fourier transform (FFT)</a> is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/de2/gaussian__elimination_8cpp.html">gaussian_elimination.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d0/de2/gaussian__elimination_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/de2/gaussian__elimination_8cpp.html">gaussian_elimination.cpp</a></td></tr>
 <tr class="memdesc:d0/de2/gaussian__elimination_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Gaussian_elimination" target="_blank">Gaussian elimination method</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d7a/golden__search__extrema_8cpp.html">golden_search_extrema.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/d7a/golden__search__extrema_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d7a/golden__search__extrema_8cpp.html">golden_search_extrema.cpp</a></td></tr>
 <tr class="memdesc:d6/d7a/golden__search__extrema_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Find extrema of a univariate real function in a given interval using <a href="https://en.wikipedia.org/wiki/Golden-section_search" target="_blank">golden section search algorithm</a>. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d33/gram__schmidt_8cpp.html">gram_schmidt.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/d33/gram__schmidt_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d33/gram__schmidt_8cpp.html">gram_schmidt.cpp</a></td></tr>
 <tr class="memdesc:d5/d33/gram__schmidt_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process" target="_blank">Gram Schmidt Orthogonalisation Process</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d37/inverse__fast__fourier__transform_8cpp.html">inverse_fast_fourier_transform.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d37/inverse__fast__fourier__transform_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d37/inverse__fast__fourier__transform_8cpp.html">inverse_fast_fourier_transform.cpp</a></td></tr>
 <tr class="memdesc:d9/d37/inverse__fast__fourier__transform_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://www.geeksforgeeks.org/python-inverse-fast-fourier-transformation/" target="_blank">An inverse fast Fourier transform (IFFT)</a> is an algorithm that computes the inverse fourier transform. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d65/lu__decompose_8cpp.html">lu_decompose.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dd/d65/lu__decompose_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d65/lu__decompose_8cpp.html">lu_decompose.cpp</a></td></tr>
 <tr class="memdesc:dd/d65/lu__decompose_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/LU_decompositon" target="_blank">LU decomposition</a> of a square matrix <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/dbe/lu__decomposition_8h_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/dbe/lu__decomposition_8h.html">lu_decomposition.h</a></td></tr>
 <tr class="memdesc:d1/dbe/lu__decomposition_8h"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions associated with <a href="https://en.wikipedia.org/wiki/LU_decomposition" target="_blank">LU Decomposition</a> of a square matrix. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d11/midpoint__integral__method_8cpp.html">midpoint_integral_method.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/d11/midpoint__integral__method_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d11/midpoint__integral__method_8cpp.html">midpoint_integral_method.cpp</a></td></tr>
 <tr class="memdesc:df/d11/midpoint__integral__method_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">A numerical method for easy <a href="https://en.wikipedia.org/wiki/Midpoint_method" target="_blank">approximation of integrals</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dd3/newton__raphson__method_8cpp.html">newton_raphson_method.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/dd3/newton__raphson__method_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/dd3/newton__raphson__method_8cpp.html">newton_raphson_method.cpp</a></td></tr>
 <tr class="memdesc:de/dd3/newton__raphson__method_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Solve the equation \(f(x)=0\) using <a href="https://en.wikipedia.org/wiki/Newton%27s_method" target="_blank">Newton-Raphson method</a> for both real and complex solutions. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/dd3/ode__forward__euler_8cpp.html">ode_forward_euler.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/dd3/ode__forward__euler_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/dd3/ode__forward__euler_8cpp.html">ode_forward_euler.cpp</a></td></tr>
 <tr class="memdesc:db/dd3/ode__forward__euler_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Numerical_methods_for_ordinary_differential_equations#Euler_method" target="_blank">forward Euler method</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/dd3/ode__midpoint__euler_8cpp.html">ode_midpoint_euler.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/dd3/ode__midpoint__euler_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/dd3/ode__midpoint__euler_8cpp.html">ode_midpoint_euler.cpp</a></td></tr>
 <tr class="memdesc:d6/dd3/ode__midpoint__euler_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Midpoint_method" target="_blank">midpoint Euler method</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d06/ode__semi__implicit__euler_8cpp.html">ode_semi_implicit_euler.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/d06/ode__semi__implicit__euler_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d06/ode__semi__implicit__euler_8cpp.html">ode_semi_implicit_euler.cpp</a></td></tr>
 <tr class="memdesc:d3/d06/ode__semi__implicit__euler_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Semi-implicit_Euler_method" target="_blank">semi implicit Euler method</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d68/qr__decompose_8h_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d68/qr__decompose_8h.html">qr_decompose.h</a></td></tr>
 <tr class="memdesc:d4/d68/qr__decompose_8h"><td class="mdescLeft">&#160;</td><td class="mdescRight">Library functions to compute <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> of a given matrix. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d24/qr__decomposition_8cpp.html">qr_decomposition.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/d24/qr__decomposition_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d24/qr__decomposition_8cpp.html">qr_decomposition.cpp</a></td></tr>
 <tr class="memdesc:d3/d24/qr__decomposition_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Program to compute the <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> of a given matrix. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d75/qr__eigen__values_8cpp.html">qr_eigen_values.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d75/qr__eigen__values_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d75/qr__eigen__values_8cpp.html">qr_eigen_values.cpp</a></td></tr>
 <tr class="memdesc:de/d75/qr__eigen__values_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Compute real eigen values and eigen vectors of a symmetric matrix using <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> method. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/da6/rungekutta_8cpp.html">rungekutta.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/da6/rungekutta_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/da6/rungekutta_8cpp.html">rungekutta.cpp</a></td></tr>
 <tr class="memdesc:d1/da6/rungekutta_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods" target="_blank">Runge Kutta fourth order</a> method implementation <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/dc8/successive__approximation_8cpp.html">successive_approximation.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/dc8/successive__approximation_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/dc8/successive__approximation_8cpp.html">successive_approximation.cpp</a></td></tr>
 <tr class="memdesc:df/dc8/successive__approximation_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Method of successive approximations using <a href="https://en.wikipedia.org/wiki/Fixed-point_iteration" target="_blank">fixed-point iteration</a> method. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
diff --git a/dir_bb1b521853a9c46347182a9d10420771.html b/dir_bb1b521853a9c46347182a9d10420771.html
index c623c505b..3591d6155 100644
--- a/dir_bb1b521853a9c46347182a9d10420771.html
+++ b/dir_bb1b521853a9c46347182a9d10420771.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: sorting Directory Reference</title>
+<title>TheAlgorithms/C++: sorting Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,87 +127,117 @@ $(function(){initNavTree('dir_bb1b521853a9c46347182a9d10420771.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/dcc/binary__insertion__sort_8cpp.html">binary_insertion_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/d25/bead__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>bead_sort.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/dcc/binary__insertion__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/dcc/binary__insertion__sort_8cpp.html">binary_insertion_sort.cpp</a></td></tr>
 <tr class="memdesc:d8/dcc/binary__insertion__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Insertion_sort" target="_blank">Binary Insertion Sort Algorithm (Insertion Sort)</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/ddb/bogo__sort_8cpp.html">bogo_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/d8f/bitonic__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>bitonic_sort.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/ddb/bogo__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/ddb/bogo__sort_8cpp.html">bogo_sort.cpp</a></td></tr>
 <tr class="memdesc:d5/ddb/bogo__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Bogosort" target="_blank">Bogosort algorithm</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d13/bubble__sort_8cpp.html">bubble_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/d13/bubble__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d13/bubble__sort_8cpp.html">bubble_sort.cpp</a></td></tr>
 <tr class="memdesc:d8/d13/bubble__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Bubble sort algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/dfd/comb__sort_8cpp.html">comb_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/dc1/bucket__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>bucket_sort.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/dd2/cocktail__selection__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>cocktail_selection_sort.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/dfd/comb__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/dfd/comb__sort_8cpp.html">comb_sort.cpp</a></td></tr>
 <tr class="memdesc:d9/dfd/comb__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Comb_sort" target="_blank">Comb Sort Algorithm (Comb Sort)</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d26/count__inversions_8cpp.html">count_inversions.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d2/d26/count__inversions_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d26/count__inversions_8cpp.html">count_inversions.cpp</a></td></tr>
 <tr class="memdesc:d2/d26/count__inversions_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Counting Inversions using <a href="https://en.wikipedia.org/wiki/Merge_sort" target="_blank">Merge Sort</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d07/cycle__sort_8cpp.html">cycle_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/d40/counting__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>counting_sort.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/db2/counting__sort__string_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>counting_sort_string.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d07/cycle__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d07/cycle__sort_8cpp.html">cycle_sort.cpp</a></td></tr>
 <tr class="memdesc:de/d07/cycle__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Cycle_sort" target="_blank">Cycle sort</a> algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d1a/dnf__sort_8cpp.html">dnf_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/d1a/dnf__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d1a/dnf__sort_8cpp.html">dnf_sort.cpp</a></td></tr>
 <tr class="memdesc:d6/d1a/dnf__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the <a href="https://www.geeksforgeeks.org/sort-an-array-of-0s-1s-and-2s/" target="_blank">DNF sort</a> implementation. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d21/gnome__sort_8cpp.html">gnome_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d2/d21/gnome__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d21/gnome__sort_8cpp.html">gnome_sort.cpp</a></td></tr>
 <tr class="memdesc:d2/d21/gnome__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Gnome_sort" target="_blank">gnome sort</a> algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d52/heap__sort_8cpp.html">heap_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d2/d52/heap__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d52/heap__sort_8cpp.html">heap_sort.cpp</a></td></tr>
 <tr class="memdesc:d2/d52/heap__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Heapsort" target="_blank">Heap Sort Algorithm (heap sort)</a> implementation <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d0d/insertion__sort_8cpp.html">insertion_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dd/d0d/insertion__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d0d/insertion__sort_8cpp.html">insertion_sort.cpp</a></td></tr>
 <tr class="memdesc:dd/d0d/insertion__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Insertion_sort" target="_blank">Insertion Sort Algorithm (Insertion Sort)</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d89/insertion__sort__recursive_8cpp.html">insertion_sort_recursive.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dd/d89/insertion__sort__recursive_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d89/insertion__sort__recursive_8cpp.html">insertion_sort_recursive.cpp</a></td></tr>
 <tr class="memdesc:dd/d89/insertion__sort__recursive_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insertion Sort Algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d7b/merge__insertion__sort_8cpp.html">merge_insertion_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/d74/library__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>library_sort.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d7b/merge__insertion__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="de/d7b/merge__insertion__sort_8cpp.html">merge_insertion_sort.cpp</a></td></tr>
 <tr class="memdesc:de/d7b/merge__insertion__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Algorithm that combines insertion sort and merge sort. <a href="https://en.wikipedia.org/wiki/Merge-insertion_sort" target="_blank">Wiki link</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/df4/merge__sort_8cpp.html">merge_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/df4/merge__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/df4/merge__sort_8cpp.html">merge_sort.cpp</a></td></tr>
 <tr class="memdesc:d5/df4/merge__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Merge_sort" target="_blank">Merege Sort Algorithm (MEREGE SORT)</a> implementation <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/db6/non__recursive__merge__sort_8cpp.html">non_recursive_merge_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d0/db6/non__recursive__merge__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/db6/non__recursive__merge__sort_8cpp.html">non_recursive_merge_sort.cpp</a></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d92/pancake__sort_8cpp.html">pancake_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/de3/numeric__string__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>numeric_string_sort.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/da9/odd__even__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>odd_even_sort.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/d92/pancake__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d92/pancake__sort_8cpp.html">pancake_sort.cpp</a></td></tr>
 <tr class="memdesc:d3/d92/pancake__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">pancake sort sorts a disordered stack of pancakes by flipping any number of pancakes using a spatula using minimum number of flips. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/da8/pigeonhole__sort_8cpp.html">pigeonhole_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dd/da8/pigeonhole__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/da8/pigeonhole__sort_8cpp.html">pigeonhole_sort.cpp</a></td></tr>
 <tr class="memdesc:dd/da8/pigeonhole__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of [Pigeonhole Sort algorithm] (<a href="https://en.wikipedia.org/wiki/Pigeonhole_sort">https://en.wikipedia.org/wiki/Pigeonhole_sort</a>) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/d21/quick__sort_8cpp.html">quick_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/d21/quick__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/d21/quick__sort_8cpp.html">quick_sort.cpp</a></td></tr>
 <tr class="memdesc:d1/d21/quick__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Quicksort" target="_blank">Quick sort implementation</a> in C++ <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d4c/quick__sort__3_8cpp.html">quick_sort_3.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/d4c/quick__sort__3_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d4c/quick__sort__3_8cpp.html">quick_sort_3.cpp</a></td></tr>
 <tr class="memdesc:d3/d4c/quick__sort__3_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation Details. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d22/quick__sort__iterative_8cpp.html">quick_sort_iterative.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/d22/quick__sort__iterative_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d22/quick__sort__iterative_8cpp.html">quick_sort_iterative.cpp</a></td></tr>
 <tr class="memdesc:d3/d22/quick__sort__iterative_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Quick Sort without recursion. This method uses the stack instead. Both recursive and iterative implementations have O(n log n) best case and O(n^2) worst case. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d61/radix__sort2_8cpp.html">radix_sort2.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/d7c/radix__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>radix_sort.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/d61/radix__sort2_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d61/radix__sort2_8cpp.html">radix_sort2.cpp</a></td></tr>
 <tr class="memdesc:d8/d61/radix__sort2_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Algorithm of <a href="https://en.wikipedia.org/wiki/Radix_sort" target="_blank">Radix sort</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/daa/random__pivot__quick__sort_8cpp.html">random_pivot_quick_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/daa/random__pivot__quick__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/daa/random__pivot__quick__sort_8cpp.html">random_pivot_quick_sort.cpp</a></td></tr>
 <tr class="memdesc:d1/daa/random__pivot__quick__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the <a href="https://www.sanfoundry.com/cpp-program-implement-quick-sort-using-randomisation" target="_blank">Random Pivot Quick Sort</a> algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/df9/recursive__bubble__sort_8cpp.html">recursive_bubble_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/df9/recursive__bubble__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/df9/recursive__bubble__sort_8cpp.html">recursive_bubble_sort.cpp</a></td></tr>
 <tr class="memdesc:d3/df9/recursive__bubble__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">This is an implementation of a recursive version of the <a href="https://www.geeksforgeeks.org/recursive-bubble-sort/" target="_blank">Bubble sort algorithm</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d9f/selection__sort__recursive_8cpp.html">selection_sort_recursive.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d85/selection__sort__iterative_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>selection_sort_iterative.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d9f/selection__sort__recursive_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d9f/selection__sort__recursive_8cpp.html">selection_sort_recursive.cpp</a></td></tr>
 <tr class="memdesc:d4/d9f/selection__sort__recursive_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the <a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection sort</a> implementation using recursion. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d7a/shell__sort2_8cpp.html">shell_sort2.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d40/shell__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>shell_sort.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d7a/shell__sort2_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d7a/shell__sort2_8cpp.html">shell_sort2.cpp</a></td></tr>
 <tr class="memdesc:d4/d7a/shell__sort2_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Shell_sort" target="_blank">Shell sort</a> algorithm <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d4f/stooge__sort_8cpp.html">stooge_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/db5/slow__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>slow_sort.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d4f/stooge__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d4f/stooge__sort_8cpp.html">stooge_sort.cpp</a></td></tr>
 <tr class="memdesc:d4/d4f/stooge__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Stooge_sort" target="_blank">Stooge sort implementation</a> in C++ <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/dd9/strand__sort_8cpp.html">strand_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dc/dd9/strand__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/dd9/strand__sort_8cpp.html">strand_sort.cpp</a></td></tr>
 <tr class="memdesc:dc/dd9/strand__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Strand_sort" target="_blank">Strand Sort</a> algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d3f/wave__sort_8cpp.html">wave_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dd/dd5/swap__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>swap_sort.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/d1e/tim__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>tim_sort.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/d3f/wave__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d3f/wave__sort_8cpp.html">wave_sort.cpp</a></td></tr>
 <tr class="memdesc:db/d3f/wave__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the <a href="https://www.geeksforgeeks.org/sort-array-wave-form-2/" target="_blank">Wave sort</a> algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/dcc/wiggle__sort_8cpp.html">wiggle_sort.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/dcc/wiggle__sort_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/dcc/wiggle__sort_8cpp.html">wiggle_sort.cpp</a></td></tr>
 <tr class="memdesc:d1/dcc/wiggle__sort_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">[Wiggle Sort Algorithm] (<a href="https://leetcode.com/problems/wiggle-sort-ii/">https://leetcode.com/problems/wiggle-sort-ii/</a>) Implementation <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
diff --git a/dir_bb1b521853a9c46347182a9d10420771.js b/dir_bb1b521853a9c46347182a9d10420771.js
index f68319ac9..5548938d6 100644
--- a/dir_bb1b521853a9c46347182a9d10420771.js
+++ b/dir_bb1b521853a9c46347182a9d10420771.js
@@ -1,31 +1,46 @@
 var dir_bb1b521853a9c46347182a9d10420771 =
 [
+    [ "bead_sort.cpp", "d5/d25/bead__sort_8cpp_source.html", null ],
     [ "binary_insertion_sort.cpp", "d8/dcc/binary__insertion__sort_8cpp.html", "d8/dcc/binary__insertion__sort_8cpp" ],
+    [ "bitonic_sort.cpp", "d8/d8f/bitonic__sort_8cpp_source.html", null ],
     [ "bogo_sort.cpp", "d5/ddb/bogo__sort_8cpp.html", "d5/ddb/bogo__sort_8cpp" ],
     [ "bubble_sort.cpp", "d8/d13/bubble__sort_8cpp.html", "d8/d13/bubble__sort_8cpp" ],
+    [ "bucket_sort.cpp", "d3/dc1/bucket__sort_8cpp_source.html", null ],
+    [ "cocktail_selection_sort.cpp", "d9/dd2/cocktail__selection__sort_8cpp_source.html", null ],
     [ "comb_sort.cpp", "d9/dfd/comb__sort_8cpp.html", "d9/dfd/comb__sort_8cpp" ],
     [ "count_inversions.cpp", "d2/d26/count__inversions_8cpp.html", "d2/d26/count__inversions_8cpp" ],
+    [ "counting_sort.cpp", "d1/d40/counting__sort_8cpp_source.html", null ],
+    [ "counting_sort_string.cpp", "db/db2/counting__sort__string_8cpp_source.html", null ],
     [ "cycle_sort.cpp", "de/d07/cycle__sort_8cpp.html", "de/d07/cycle__sort_8cpp" ],
     [ "dnf_sort.cpp", "d6/d1a/dnf__sort_8cpp.html", "d6/d1a/dnf__sort_8cpp" ],
     [ "gnome_sort.cpp", "d2/d21/gnome__sort_8cpp.html", "d2/d21/gnome__sort_8cpp" ],
     [ "heap_sort.cpp", "d2/d52/heap__sort_8cpp.html", "d2/d52/heap__sort_8cpp" ],
     [ "insertion_sort.cpp", "dd/d0d/insertion__sort_8cpp.html", "dd/d0d/insertion__sort_8cpp" ],
     [ "insertion_sort_recursive.cpp", "dd/d89/insertion__sort__recursive_8cpp.html", "dd/d89/insertion__sort__recursive_8cpp" ],
+    [ "library_sort.cpp", "d6/d74/library__sort_8cpp_source.html", null ],
     [ "merge_insertion_sort.cpp", "de/d7b/merge__insertion__sort_8cpp.html", "de/d7b/merge__insertion__sort_8cpp" ],
     [ "merge_sort.cpp", "d5/df4/merge__sort_8cpp.html", "d5/df4/merge__sort_8cpp" ],
     [ "non_recursive_merge_sort.cpp", "d0/db6/non__recursive__merge__sort_8cpp.html", "d0/db6/non__recursive__merge__sort_8cpp" ],
+    [ "numeric_string_sort.cpp", "db/de3/numeric__string__sort_8cpp_source.html", null ],
+    [ "odd_even_sort.cpp", "d6/da9/odd__even__sort_8cpp_source.html", null ],
     [ "pancake_sort.cpp", "d3/d92/pancake__sort_8cpp.html", "d3/d92/pancake__sort_8cpp" ],
     [ "pigeonhole_sort.cpp", "dd/da8/pigeonhole__sort_8cpp.html", "dd/da8/pigeonhole__sort_8cpp" ],
     [ "quick_sort.cpp", "d1/d21/quick__sort_8cpp.html", "d1/d21/quick__sort_8cpp" ],
     [ "quick_sort_3.cpp", "d3/d4c/quick__sort__3_8cpp.html", "d3/d4c/quick__sort__3_8cpp" ],
     [ "quick_sort_iterative.cpp", "d3/d22/quick__sort__iterative_8cpp.html", "d3/d22/quick__sort__iterative_8cpp" ],
+    [ "radix_sort.cpp", "d8/d7c/radix__sort_8cpp_source.html", null ],
     [ "radix_sort2.cpp", "d8/d61/radix__sort2_8cpp.html", "d8/d61/radix__sort2_8cpp" ],
     [ "random_pivot_quick_sort.cpp", "d1/daa/random__pivot__quick__sort_8cpp.html", "d1/daa/random__pivot__quick__sort_8cpp" ],
     [ "recursive_bubble_sort.cpp", "d3/df9/recursive__bubble__sort_8cpp.html", "d3/df9/recursive__bubble__sort_8cpp" ],
+    [ "selection_sort_iterative.cpp", "d9/d85/selection__sort__iterative_8cpp_source.html", null ],
     [ "selection_sort_recursive.cpp", "d4/d9f/selection__sort__recursive_8cpp.html", "d4/d9f/selection__sort__recursive_8cpp" ],
+    [ "shell_sort.cpp", "de/d40/shell__sort_8cpp_source.html", null ],
     [ "shell_sort2.cpp", "d4/d7a/shell__sort2_8cpp.html", "d4/d7a/shell__sort2_8cpp" ],
+    [ "slow_sort.cpp", "db/db5/slow__sort_8cpp_source.html", null ],
     [ "stooge_sort.cpp", "d4/d4f/stooge__sort_8cpp.html", "d4/d4f/stooge__sort_8cpp" ],
     [ "strand_sort.cpp", "dc/dd9/strand__sort_8cpp.html", "dc/dd9/strand__sort_8cpp" ],
+    [ "swap_sort.cpp", "dd/dd5/swap__sort_8cpp_source.html", null ],
+    [ "tim_sort.cpp", "d5/d1e/tim__sort_8cpp_source.html", null ],
     [ "wave_sort.cpp", "db/d3f/wave__sort_8cpp.html", "db/d3f/wave__sort_8cpp" ],
     [ "wiggle_sort.cpp", "d1/dcc/wiggle__sort_8cpp.html", "d1/dcc/wiggle__sort_8cpp" ]
 ];
\ No newline at end of file
diff --git a/dir_c11585dfcef32a26e29098facab6c144.html b/dir_c11585dfcef32a26e29098facab6c144.html
index 69bc877e0..13ec93f62 100644
--- a/dir_c11585dfcef32a26e29098facab6c144.html
+++ b/dir_c11585dfcef32a26e29098facab6c144.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: backtracking Directory Reference</title>
+<title>TheAlgorithms/C++: backtracking Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,41 +127,43 @@ $(function(){initNavTree('dir_c11585dfcef32a26e29098facab6c144.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d1e/generate__parentheses_8cpp.html">generate_parentheses.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dd/d1e/generate__parentheses_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dd/d1e/generate__parentheses_8cpp.html">generate_parentheses.cpp</a></td></tr>
 <tr class="memdesc:dd/d1e/generate__parentheses_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Well-formed <a href="https://leetcode.com/explore/interview/card/top-interview-questions-medium/109/backtracking/794/" target="_blank">Generated Parentheses</a> with all combinations. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d40/graph__coloring_8cpp.html">graph_coloring.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/d40/graph__coloring_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d40/graph__coloring_8cpp.html">graph_coloring.cpp</a></td></tr>
 <tr class="memdesc:d3/d40/graph__coloring_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">prints the assigned colors using <a href="https://en.wikipedia.org/wiki/Graph_coloring" target="_blank">Graph Coloring</a> algorithm <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/d2a/knight__tour_8cpp.html">knight_tour.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/d2a/knight__tour_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/d2a/knight__tour_8cpp.html">knight_tour.cpp</a></td></tr>
 <tr class="memdesc:d1/d2a/knight__tour_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Knight%27s_tour" target="_blank">Knight's tour</a> algorithm <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/dfb/minimax_8cpp.html">minimax.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/d37/magic__sequence_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>magic_sequence.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/dfb/minimax_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/dfb/minimax_8cpp.html">minimax.cpp</a></td></tr>
 <tr class="memdesc:df/dfb/minimax_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">returns which is the longest/shortest number using <a href="https://en.wikipedia.org/wiki/Minimax" target="_blank">minimax</a> algorithm <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d3e/n__queens_8cpp.html">n_queens.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d3e/n__queens_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d3e/n__queens_8cpp.html">n_queens.cpp</a></td></tr>
 <tr class="memdesc:d4/d3e/n__queens_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/dac/n__queens__all__solution__optimised_8cpp.html">n_queens_all_solution_optimised.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/dac/n__queens__all__solution__optimised_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/dac/n__queens__all__solution__optimised_8cpp.html">n_queens_all_solution_optimised.cpp</a></td></tr>
 <tr class="memdesc:da/dac/n__queens__all__solution__optimised_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">N queens</a> all optimized <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d24/nqueen__print__all__solutions_8cpp.html">nqueen_print_all_solutions.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/d24/nqueen__print__all__solutions_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d24/nqueen__print__all__solutions_8cpp.html">nqueen_print_all_solutions.cpp</a></td></tr>
 <tr class="memdesc:d7/d24/nqueen__print__all__solutions_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle, printing all solutions <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d5a/rat__maze_8cpp.html">rat_maze.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dc/d5a/rat__maze_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d5a/rat__maze_8cpp.html">rat_maze.cpp</a></td></tr>
 <tr class="memdesc:dc/d5a/rat__maze_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implements <a href="https://www.codesdope.com/blog/article/backtracking-to-
 solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d94/subarray__sum_8cpp.html">subarray_sum.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/d94/subarray__sum_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d94/subarray__sum_8cpp.html">subarray_sum.cpp</a></td></tr>
 <tr class="memdesc:df/d94/subarray__sum_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset-sum</a> (only continuous subsets) problem <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d5a/subset__sum_8cpp.html">subset_sum.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d2/d5a/subset__sum_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d2/d5a/subset__sum_8cpp.html">subset_sum.cpp</a></td></tr>
 <tr class="memdesc:d2/d5a/subset__sum_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the <a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset Sum</a> problem. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d05/sudoku__solver_8cpp.html">sudoku_solver.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d3/d05/sudoku__solver_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d05/sudoku__solver_8cpp.html">sudoku_solver.cpp</a></td></tr>
 <tr class="memdesc:d3/d05/sudoku__solver_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Sudoku" target="_blank">Sudoku Solver</a> algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d14/wildcard__matching_8cpp.html">wildcard_matching.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dc/d14/wildcard__matching_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d14/wildcard__matching_8cpp.html">wildcard_matching.cpp</a></td></tr>
 <tr class="memdesc:dc/d14/wildcard__matching_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of the <a href="https://www.geeksforgeeks.org/wildcard-pattern-matching/" target="_blank">Wildcard Matching</a> problem. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
diff --git a/dir_c11585dfcef32a26e29098facab6c144.js b/dir_c11585dfcef32a26e29098facab6c144.js
index da2392fc2..6c141c0f8 100644
--- a/dir_c11585dfcef32a26e29098facab6c144.js
+++ b/dir_c11585dfcef32a26e29098facab6c144.js
@@ -3,6 +3,7 @@ var dir_c11585dfcef32a26e29098facab6c144 =
     [ "generate_parentheses.cpp", "dd/d1e/generate__parentheses_8cpp.html", "dd/d1e/generate__parentheses_8cpp" ],
     [ "graph_coloring.cpp", "d3/d40/graph__coloring_8cpp.html", "d3/d40/graph__coloring_8cpp" ],
     [ "knight_tour.cpp", "d1/d2a/knight__tour_8cpp.html", "d1/d2a/knight__tour_8cpp" ],
+    [ "magic_sequence.cpp", "d7/d37/magic__sequence_8cpp_source.html", null ],
     [ "minimax.cpp", "df/dfb/minimax_8cpp.html", "df/dfb/minimax_8cpp" ],
     [ "n_queens.cpp", "d4/d3e/n__queens_8cpp.html", "d4/d3e/n__queens_8cpp" ],
     [ "n_queens_all_solution_optimised.cpp", "da/dac/n__queens__all__solution__optimised_8cpp.html", "da/dac/n__queens__all__solution__optimised_8cpp" ],
diff --git a/dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html b/dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html
index fc0f25f25..e3f23ab6a 100644
--- a/dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html
+++ b/dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: cpu_scheduling_algorithms Directory Reference</title>
+<title>TheAlgorithms/C++: cpu_scheduling_algorithms Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,7 +127,7 @@ $(function(){initNavTree('dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d47/fcfs__scheduling_8cpp.html">fcfs_scheduling.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/d47/fcfs__scheduling_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/d47/fcfs__scheduling_8cpp.html">fcfs_scheduling.cpp</a></td></tr>
 <tr class="memdesc:df/d47/fcfs__scheduling_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a class="el" href="dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> CPU scheduling algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
diff --git a/dir_e3380d2178455503f266746fb14246a5.html b/dir_e3380d2178455503f266746fb14246a5.html
index 1ee339b4d..df49df1f0 100644
--- a/dir_e3380d2178455503f266746fb14246a5.html
+++ b/dir_e3380d2178455503f266746fb14246a5.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: geometry Directory Reference</title>
+<title>TheAlgorithms/C++: geometry Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,12 +127,14 @@ $(function(){initNavTree('dir_e3380d2178455503f266746fb14246a5.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d79/graham__scan__algorithm_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>graham_scan_algorithm.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="de/d89/graham__scan__functions_8hpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>graham_scan_functions.hpp</b></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d8d/jarvis__algorithm_8cpp.html">jarvis_algorithm.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d8d/jarvis__algorithm_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d8d/jarvis__algorithm_8cpp.html">jarvis_algorithm.cpp</a></td></tr>
 <tr class="memdesc:d4/d8d/jarvis__algorithm_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm" target="_blank">Jarvis’s</a> algorithm. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d6c/line__segment__intersection_8cpp.html">line_segment_intersection.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/d6c/line__segment__intersection_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d6c/line__segment__intersection_8cpp.html">line_segment_intersection.cpp</a></td></tr>
 <tr class="memdesc:d8/d6c/line__segment__intersection_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">check whether two line segments intersect each other or not. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
diff --git a/dir_e3380d2178455503f266746fb14246a5.js b/dir_e3380d2178455503f266746fb14246a5.js
index c9a648f50..5d507ff1e 100644
--- a/dir_e3380d2178455503f266746fb14246a5.js
+++ b/dir_e3380d2178455503f266746fb14246a5.js
@@ -1,5 +1,6 @@
 var dir_e3380d2178455503f266746fb14246a5 =
 [
+    [ "graham_scan_algorithm.cpp", "de/d79/graham__scan__algorithm_8cpp_source.html", null ],
     [ "graham_scan_functions.hpp", "de/d89/graham__scan__functions_8hpp_source.html", null ],
     [ "jarvis_algorithm.cpp", "d4/d8d/jarvis__algorithm_8cpp.html", "d4/d8d/jarvis__algorithm_8cpp" ],
     [ "line_segment_intersection.cpp", "d8/d6c/line__segment__intersection_8cpp.html", "d8/d6c/line__segment__intersection_8cpp" ]
diff --git a/dir_e79632891301b850df87e9c0030293fa.html b/dir_e79632891301b850df87e9c0030293fa.html
index e454fd253..65fd24731 100644
--- a/dir_e79632891301b850df87e9c0030293fa.html
+++ b/dir_e79632891301b850df87e9c0030293fa.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: graphics Directory Reference</title>
+<title>TheAlgorithms/C++: graphics Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,7 +127,7 @@ $(function(){initNavTree('dir_e79632891301b850df87e9c0030293fa.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d77/spirograph_8cpp.html">spirograph.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/d77/spirograph_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d77/spirograph_8cpp.html">spirograph.cpp</a></td></tr>
 <tr class="memdesc:da/d77/spirograph_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Spirograph" target="_blank">Spirograph</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
diff --git a/dir_ece9b94c107bbaa1dd68197a8c9983b9.html b/dir_ece9b94c107bbaa1dd68197a8c9983b9.html
index 903cd57cb..408035d2b 100644
--- a/dir_ece9b94c107bbaa1dd68197a8c9983b9.html
+++ b/dir_ece9b94c107bbaa1dd68197a8c9983b9.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: hashing Directory Reference</title>
+<title>TheAlgorithms/C++: hashing Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,25 +127,25 @@ $(function(){initNavTree('dir_ece9b94c107bbaa1dd68197a8c9983b9.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d92/chaining_8cpp.html">chaining.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d9/d92/chaining_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d92/chaining_8cpp.html">chaining.cpp</a></td></tr>
 <tr class="memdesc:d9/d92/chaining_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Hash_chain" target="_blank">hash chains</a>. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d80/double__hash__hash__table_8cpp.html">double_hash_hash_table.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/d80/double__hash__hash__table_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d80/double__hash__hash__table_8cpp.html">double_hash_hash_table.cpp</a></td></tr>
 <tr class="memdesc:d6/d80/double__hash__hash__table_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Storage mechanism using <a href="https://en.wikipedia.org/wiki/Double_hashing" target="_blank">double-hashed keys</a>. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/dc7/linear__probing__hash__table_8cpp.html">linear_probing_hash_table.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/dc7/linear__probing__hash__table_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d1/dc7/linear__probing__hash__table_8cpp.html">linear_probing_hash_table.cpp</a></td></tr>
 <tr class="memdesc:d1/dc7/linear__probing__hash__table_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Storage mechanism using <a href="https://en.wikipedia.org/wiki/Linear_probing" target="_blank">linear probing hash</a> keys. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d96/md5_8cpp.html">md5.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/d96/md5_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d96/md5_8cpp.html">md5.cpp</a></td></tr>
 <tr class="memdesc:d5/d96/md5_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Simple C++ implementation of the <a href="https://en.wikipedia.org/wiki/MD5" target="_blank">MD5 Hashing Algorithm</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d71/quadratic__probing__hash__table_8cpp.html">quadratic_probing_hash_table.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="db/d71/quadratic__probing__hash__table_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/d71/quadratic__probing__hash__table_8cpp.html">quadratic_probing_hash_table.cpp</a></td></tr>
 <tr class="memdesc:db/d71/quadratic__probing__hash__table_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Storage mechanism using <a href="https://en.wikipedia.org/wiki/Quadratic_probing" target="_blank">quadratic probing hash</a> keys. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d7a/sha1_8cpp.html">sha1.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d8/d7a/sha1_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/d7a/sha1_8cpp.html">sha1.cpp</a></td></tr>
 <tr class="memdesc:d8/d7a/sha1_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Simple C++ implementation of the <a href="https://en.wikipedia.org/wiki/SHA-1" target="_blank">SHA-1 Hashing Algorithm</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d08/sha256_8cpp.html">sha256.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d08/sha256_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d08/sha256_8cpp.html">sha256.cpp</a></td></tr>
 <tr class="memdesc:d4/d08/sha256_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Simple C++ implementation of the [SHA-256 Hashing Algorithm] (<a href="https://en.wikipedia.org/wiki/SHA-2">https://en.wikipedia.org/wiki/SHA-2</a>) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
diff --git a/dir_f1797d0c2a0a12033e7d74efffeb14e1.html b/dir_f1797d0c2a0a12033e7d74efffeb14e1.html
index 5aa0894bf..95b3ff67c 100644
--- a/dir_f1797d0c2a0a12033e7d74efffeb14e1.html
+++ b/dir_f1797d0c2a0a12033e7d74efffeb14e1.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: data_structures/cll Directory Reference</title>
+<title>TheAlgorithms/C++: data_structures/cll Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -115,8 +132,12 @@ Directory dependency graph for cll:</div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d1/d70/cll_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>cll.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/dba/cll_8h_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>cll.h</b></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="df/d97/main__cll_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>main_cll.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 </div><!-- contents -->
 </div><!-- doc-content -->
diff --git a/dir_f1797d0c2a0a12033e7d74efffeb14e1.js b/dir_f1797d0c2a0a12033e7d74efffeb14e1.js
index fef75ea2b..5efbf97dd 100644
--- a/dir_f1797d0c2a0a12033e7d74efffeb14e1.js
+++ b/dir_f1797d0c2a0a12033e7d74efffeb14e1.js
@@ -1,4 +1,6 @@
 var dir_f1797d0c2a0a12033e7d74efffeb14e1 =
 [
-    [ "cll.h", "d7/dba/cll_8h_source.html", null ]
+    [ "cll.cpp", "d1/d70/cll_8cpp_source.html", null ],
+    [ "cll.h", "d7/dba/cll_8h_source.html", null ],
+    [ "main_cll.cpp", "df/d97/main__cll_8cpp_source.html", null ]
 ];
\ No newline at end of file
diff --git a/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html b/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html
index 9ba84f06b..bca30cb2e 100644
--- a/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html
+++ b/dir_f3c4fbc4e901afa0a54d0623c5574aa7.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: bit_manipulation Directory Reference</title>
+<title>TheAlgorithms/C++: bit_manipulation Directory Reference</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,31 +127,33 @@ $(function(){initNavTree('dir_f3c4fbc4e901afa0a54d0623c5574aa7.html',''); initRe
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
 Files</h2></td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d56/count__bits__flip_8cpp.html">count_bits_flip.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d7/d56/count__bits__flip_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d56/count__bits__flip_8cpp.html">count_bits_flip.cpp</a></td></tr>
 <tr class="memdesc:d7/d56/count__bits__flip_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation to [Count number of bits to be flipped to convert A to B] (<a href="https://www.geeksforgeeks.org/count-number-of-bits-to-be-flipped-to-convert-a-to-b/">https://www.geeksforgeeks.org/count-number-of-bits-to-be-flipped-to-convert-a-to-b/</a>) in an integer. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/db8/count__of__set__bits_8cpp.html">count_of_set_bits.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/db8/count__of__set__bits_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/db8/count__of__set__bits_8cpp.html">count_of_set_bits.cpp</a></td></tr>
 <tr class="memdesc:da/db8/count__of__set__bits_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation to [count number of set bits of a number] (<a href="https://www.geeksforgeeks.org/count-set-bits-in-an-integer/">https://www.geeksforgeeks.org/count-set-bits-in-an-integer/</a>) in an integer. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html">count_of_trailing_ciphers_in_factorial_n.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html">count_of_trailing_ciphers_in_factorial_n.cpp</a></td></tr>
 <tr class="memdesc:da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://www.tutorialspoint.com/count-trailing-zeros-in-factorial-of-a-number-in-cplusplus" target="_blank">Count the number of ciphers</a> in <code>n!</code> implementation <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d38/find__non__repeating__number_8cpp.html">find_non_repeating_number.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d6/d38/find__non__repeating__number_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d6/d38/find__non__repeating__number_8cpp.html">find_non_repeating_number.cpp</a></td></tr>
 <tr class="memdesc:d6/d38/find__non__repeating__number_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation to find the non repeating integer in an array of repeating integers. <a href="https://leetcode.com/problems/single-number/" target="_blank">Single Number</a> <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d48/hamming__distance_8cpp.html">hamming_distance.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d8b/gray__code_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><b>gray_code.cpp</b></td></tr>
+<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d48/hamming__distance_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d48/hamming__distance_8cpp.html">hamming_distance.cpp</a></td></tr>
 <tr class="memdesc:d4/d48/hamming__distance_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns the <a href="https://en.wikipedia.org/wiki/Hamming_distance" target="_blank">Hamming distance</a> between two integers. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html">next_higher_number_with_same_number_of_set_bits.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html">next_higher_number_with_same_number_of_set_bits.cpp</a></td></tr>
 <tr class="memdesc:d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">[Next higher number with same number of set bits] (<a href="https://www.geeksforgeeks.org/next-higher-number-with-same-number-of-set-bits/">https://www.geeksforgeeks.org/next-higher-number-with-same-number-of-set-bits/</a>) implementation <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d6d/power__of__2_8cpp.html">power_of_2.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="dc/d6d/power__of__2_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d6d/power__of__2_8cpp.html">power_of_2.cpp</a></td></tr>
 <tr class="memdesc:dc/d6d/power__of__2_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">[Find whether a given number is power of 2] (<a href="https://www.geeksforgeeks.org/program-to-find-whether-a-given-number-is-power-of-2/">https://www.geeksforgeeks.org/program-to-find-whether-a-given-number-is-power-of-2/</a>) implementation <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/db5/set__kth__bit_8cpp.html">set_kth_bit.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d5/db5/set__kth__bit_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d5/db5/set__kth__bit_8cpp.html">set_kth_bit.cpp</a></td></tr>
 <tr class="memdesc:d5/db5/set__kth__bit_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation to [From the right, set the Kth bit in the binary representation of N] (<a href="https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/">https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/</a>) in an integer. <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
-<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html">travelling_salesman_using_bit_manipulation.cpp</a></td></tr>
+<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><a href="d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html"><span class="icondoc"></span></a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html">travelling_salesman_using_bit_manipulation.cpp</a></td></tr>
 <tr class="memdesc:d4/d8f/travelling__salesman__using__bit__manipulation_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation to [Travelling Salesman problem using bit-masking] (<a href="https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/">https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/</a>) <br /></td></tr>
 <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
diff --git a/dir_f3c4fbc4e901afa0a54d0623c5574aa7.js b/dir_f3c4fbc4e901afa0a54d0623c5574aa7.js
index dff96a6a7..8be350521 100644
--- a/dir_f3c4fbc4e901afa0a54d0623c5574aa7.js
+++ b/dir_f3c4fbc4e901afa0a54d0623c5574aa7.js
@@ -4,6 +4,7 @@ var dir_f3c4fbc4e901afa0a54d0623c5574aa7 =
     [ "count_of_set_bits.cpp", "da/db8/count__of__set__bits_8cpp.html", "da/db8/count__of__set__bits_8cpp" ],
     [ "count_of_trailing_ciphers_in_factorial_n.cpp", "da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html", "da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp" ],
     [ "find_non_repeating_number.cpp", "d6/d38/find__non__repeating__number_8cpp.html", "d6/d38/find__non__repeating__number_8cpp" ],
+    [ "gray_code.cpp", "d4/d8b/gray__code_8cpp_source.html", null ],
     [ "hamming_distance.cpp", "d4/d48/hamming__distance_8cpp.html", "d4/d48/hamming__distance_8cpp" ],
     [ "next_higher_number_with_same_number_of_set_bits.cpp", "d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html", "d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp" ],
     [ "power_of_2.cpp", "dc/d6d/power__of__2_8cpp.html", "dc/d6d/power__of__2_8cpp" ],
diff --git a/doxygen-awesome.css b/doxygen-awesome.css
new file mode 100644
index 000000000..c2f41142f
--- /dev/null
+++ b/doxygen-awesome.css
@@ -0,0 +1,2681 @@
+/**
+
+Doxygen Awesome
+https://github.com/jothepro/doxygen-awesome-css
+
+MIT License
+
+Copyright (c) 2021 - 2023 jothepro
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+*/
+
+html {
+    /* primary theme color. This will affect the entire websites color scheme: links, arrows, labels, ... */
+    --primary-color: #1779c4;
+    --primary-dark-color: #335c80;
+    --primary-light-color: #70b1e9;
+
+    /* page base colors */
+    --page-background-color: #ffffff;
+    --page-foreground-color: #2f4153;
+    --page-secondary-foreground-color: #6f7e8e;
+
+    /* color for all separators on the website: hr, borders, ... */
+    --separator-color: #dedede;
+
+    /* border radius for all rounded components. Will affect many components, like dropdowns, memitems, codeblocks, ... */
+    --border-radius-large: 8px;
+    --border-radius-small: 4px;
+    --border-radius-medium: 6px;
+
+    /* default spacings. Most components reference these values for spacing, to provide uniform spacing on the page. */
+    --spacing-small: 5px;
+    --spacing-medium: 10px;
+    --spacing-large: 16px;
+
+    /* default box shadow used for raising an element above the normal content. Used in dropdowns, search result, ... */
+    --box-shadow: 0 2px 8px 0 rgba(0,0,0,.075);
+
+    --odd-color: rgba(0,0,0,.028);
+
+    /* font-families. will affect all text on the website
+     * font-family: the normal font for text, headlines, menus
+     * font-family-monospace: used for preformatted text in memtitle, code, fragments
+     */
+    --font-family: -apple-system,BlinkMacSystemFont,Segoe UI,Roboto,Oxygen,Ubuntu,Cantarell,Fira Sans,Droid Sans,Helvetica Neue,sans-serif;
+    --font-family-monospace: ui-monospace,SFMono-Regular,SF Mono,Menlo,Consolas,Liberation Mono,monospace;
+
+    /* font sizes */
+    --page-font-size: 15.6px;
+    --navigation-font-size: 14.4px;
+    --toc-font-size: 13.4px;
+    --code-font-size: 14px; /* affects code, fragment */
+    --title-font-size: 22px;
+
+    /* content text properties. These only affect the page content, not the navigation or any other ui elements */
+    --content-line-height: 27px;
+    /* The content is centered and constraint in it's width. To make the content fill the whole page, set the variable to auto.*/
+    --content-maxwidth: 1050px;
+    --table-line-height: 24px;
+    --toc-sticky-top: var(--spacing-medium);
+    --toc-width: 200px;
+    --toc-max-height: calc(100vh - 2 * var(--spacing-medium) - 85px);
+
+    /* colors for various content boxes: @warning, @note, @deprecated @bug */
+    --warning-color: #faf3d8;
+    --warning-color-dark: #f3a600;
+    --warning-color-darker: #5f4204;
+    --note-color: #e4f3ff;
+    --note-color-dark: #1879C4;
+    --note-color-darker: #274a5c;
+    --todo-color: #e4dafd;
+    --todo-color-dark: #5b2bdd;
+    --todo-color-darker: #2a0d72;
+    --deprecated-color: #ecf0f3;
+    --deprecated-color-dark: #5b6269;
+    --deprecated-color-darker: #43454a;
+    --bug-color: #f8d1cc;
+    --bug-color-dark: #b61825;
+    --bug-color-darker: #75070f;
+    --invariant-color: #d8f1e3;
+    --invariant-color-dark: #44b86f;
+    --invariant-color-darker: #265532;
+
+    /* blockquote colors */
+    --blockquote-background: #f8f9fa;
+    --blockquote-foreground: #636568;
+
+    /* table colors */
+    --tablehead-background: #f1f1f1;
+    --tablehead-foreground: var(--page-foreground-color);
+
+    /* menu-display: block | none
+     * Visibility of the top navigation on screens >= 768px. On smaller screen the menu is always visible.
+     * `GENERATE_TREEVIEW` MUST be enabled!
+     */
+    --menu-display: block;
+
+    --menu-focus-foreground: var(--page-background-color);
+    --menu-focus-background: var(--primary-color);
+    --menu-selected-background: rgba(0,0,0,.05);
+
+
+    --header-background: var(--page-background-color);
+    --header-foreground: var(--page-foreground-color);
+
+    /* searchbar colors */
+    --searchbar-background: var(--side-nav-background);
+    --searchbar-foreground: var(--page-foreground-color);
+
+    /* searchbar size
+     * (`searchbar-width` is only applied on screens >= 768px.
+     * on smaller screens the searchbar will always fill the entire screen width) */
+    --searchbar-height: 33px;
+    --searchbar-width: 210px;
+    --searchbar-border-radius: var(--searchbar-height);
+
+    /* code block colors */
+    --code-background: #f5f5f5;
+    --code-foreground: var(--page-foreground-color);
+
+    /* fragment colors */
+    --fragment-background: #F8F9FA;
+    --fragment-foreground: #37474F;
+    --fragment-keyword: #bb6bb2;
+    --fragment-keywordtype: #8258b3;
+    --fragment-keywordflow: #d67c3b;
+    --fragment-token: #438a59;
+    --fragment-comment: #969696;
+    --fragment-link: #5383d6;
+    --fragment-preprocessor: #46aaa5;
+    --fragment-linenumber-color: #797979;
+    --fragment-linenumber-background: #f4f4f5;
+    --fragment-linenumber-border: #e3e5e7;
+    --fragment-lineheight: 20px;
+
+    /* sidebar navigation (treeview) colors */
+    --side-nav-background: #fbfbfb;
+    --side-nav-foreground: var(--page-foreground-color);
+    --side-nav-arrow-opacity: 0;
+    --side-nav-arrow-hover-opacity: 0.9;
+
+    --toc-background: var(--side-nav-background);
+    --toc-foreground: var(--side-nav-foreground);
+
+    /* height of an item in any tree / collapsible table */
+    --tree-item-height: 30px;
+
+    --memname-font-size: var(--code-font-size);
+    --memtitle-font-size: 18px;
+
+    --webkit-scrollbar-size: 7px;
+    --webkit-scrollbar-padding: 4px;
+    --webkit-scrollbar-color: var(--separator-color);
+
+    --animation-duration: .12s
+}
+
+@media screen and (max-width: 767px) {
+    html {
+        --page-font-size: 16px;
+        --navigation-font-size: 16px;
+        --toc-font-size: 15px;
+        --code-font-size: 15px; /* affects code, fragment */
+        --title-font-size: 22px;
+    }
+}
+
+@media (prefers-color-scheme: dark) {
+    html:not(.light-mode) {
+        color-scheme: dark;
+
+        --primary-color: #1982d2;
+        --primary-dark-color: #86a9c4;
+        --primary-light-color: #4779ac;
+
+        --box-shadow: 0 2px 8px 0 rgba(0,0,0,.35);
+
+        --odd-color: rgba(100,100,100,.06);
+
+        --menu-selected-background: rgba(0,0,0,.4);
+
+        --page-background-color: #1C1D1F;
+        --page-foreground-color: #d2dbde;
+        --page-secondary-foreground-color: #859399;
+        --separator-color: #38393b;
+        --side-nav-background: #252628;
+
+        --code-background: #2a2c2f;
+
+        --tablehead-background: #2a2c2f;
+    
+        --blockquote-background: #222325;
+        --blockquote-foreground: #7e8c92;
+
+        --warning-color: #3b2e04;
+        --warning-color-dark: #f1b602;
+        --warning-color-darker: #ceb670;
+        --note-color: #163750;
+        --note-color-dark: #1982D2;
+        --note-color-darker: #dcf0fa;
+        --todo-color: #2a2536;
+        --todo-color-dark: #7661b3;
+        --todo-color-darker: #ae9ed6;
+        --deprecated-color: #2e323b;
+        --deprecated-color-dark: #738396;
+        --deprecated-color-darker: #abb0bd;
+        --bug-color: #2e1917;
+        --bug-color-dark: #ad2617;
+        --bug-color-darker: #f5b1aa;
+        --invariant-color: #303a35;
+        --invariant-color-dark: #76ce96;
+        --invariant-color-darker: #cceed5;
+
+        --fragment-background: #282c34;
+        --fragment-foreground: #dbe4eb;
+        --fragment-keyword: #cc99cd;
+        --fragment-keywordtype: #ab99cd;
+        --fragment-keywordflow: #e08000;
+        --fragment-token: #7ec699;
+        --fragment-comment: #999999;
+        --fragment-link: #98c0e3;
+        --fragment-preprocessor: #65cabe;
+        --fragment-linenumber-color: #cccccc;
+        --fragment-linenumber-background: #35393c;
+        --fragment-linenumber-border: #1f1f1f;
+    }
+}
+
+/* dark mode variables are defined twice, to support both the dark-mode without and with doxygen-awesome-darkmode-toggle.js */
+html.dark-mode {
+    color-scheme: dark;
+
+    --primary-color: #1982d2;
+    --primary-dark-color: #86a9c4;
+    --primary-light-color: #4779ac;
+
+    --box-shadow: 0 2px 8px 0 rgba(0,0,0,.30);
+
+    --odd-color: rgba(100,100,100,.06);
+
+    --menu-selected-background: rgba(0,0,0,.4);
+
+    --page-background-color: #1C1D1F;
+    --page-foreground-color: #d2dbde;
+    --page-secondary-foreground-color: #859399;
+    --separator-color: #38393b;
+    --side-nav-background: #252628;
+
+    --code-background: #2a2c2f;
+
+    --tablehead-background: #2a2c2f;
+
+    --blockquote-background: #222325;
+    --blockquote-foreground: #7e8c92;
+
+    --warning-color: #3b2e04;
+    --warning-color-dark: #f1b602;
+    --warning-color-darker: #ceb670;
+    --note-color: #163750;
+    --note-color-dark: #1982D2;
+    --note-color-darker: #dcf0fa;
+    --todo-color: #2a2536;
+    --todo-color-dark: #7661b3;
+    --todo-color-darker: #ae9ed6;
+    --deprecated-color: #2e323b;
+    --deprecated-color-dark: #738396;
+    --deprecated-color-darker: #abb0bd;
+    --bug-color: #2e1917;
+    --bug-color-dark: #ad2617;
+    --bug-color-darker: #f5b1aa;
+    --invariant-color: #303a35;
+    --invariant-color-dark: #76ce96;
+    --invariant-color-darker: #cceed5;
+
+    --fragment-background: #282c34;
+    --fragment-foreground: #dbe4eb;
+    --fragment-keyword: #cc99cd;
+    --fragment-keywordtype: #ab99cd;
+    --fragment-keywordflow: #e08000;
+    --fragment-token: #7ec699;
+    --fragment-comment: #999999;
+    --fragment-link: #98c0e3;
+    --fragment-preprocessor: #65cabe;
+    --fragment-linenumber-color: #cccccc;
+    --fragment-linenumber-background: #35393c;
+    --fragment-linenumber-border: #1f1f1f;
+}
+
+body {
+    color: var(--page-foreground-color);
+    background-color: var(--page-background-color);
+    font-size: var(--page-font-size);
+}
+
+body, table, div, p, dl, #nav-tree .label, .title,
+.sm-dox a, .sm-dox a:hover, .sm-dox a:focus, #projectname,
+.SelectItem, #MSearchField, .navpath li.navelem a,
+.navpath li.navelem a:hover, p.reference, p.definition, div.toc li, div.toc h3 {
+    font-family: var(--font-family);
+}
+
+h1, h2, h3, h4, h5 {
+    margin-top: 1em;
+    font-weight: 600;
+    line-height: initial;
+}
+
+p, div, table, dl, p.reference, p.definition {
+    font-size: var(--page-font-size);
+}
+
+p.reference, p.definition {
+    color: var(--page-secondary-foreground-color);
+}
+
+a:link, a:visited, a:hover, a:focus, a:active {
+    color: var(--primary-color) !important;
+    font-weight: 500;
+    background: none;
+}
+
+a.anchor {
+    scroll-margin-top: var(--spacing-large);
+    display: block;
+}
+
+/*
+ Title and top navigation
+ */
+
+#top {
+    background: var(--header-background);
+    border-bottom: 1px solid var(--separator-color);
+}
+
+@media screen and (min-width: 768px) {
+    #top {
+        display: flex;
+        flex-wrap: wrap;
+        justify-content: space-between;
+        align-items: center;
+    }
+}
+
+#main-nav {
+    flex-grow: 5;
+    padding: var(--spacing-small) var(--spacing-medium);
+}
+
+#titlearea {
+    width: auto;
+    padding: var(--spacing-medium) var(--spacing-large);
+    background: none;
+    color: var(--header-foreground);
+    border-bottom: none;
+}
+
+@media screen and (max-width: 767px) {
+    #titlearea {
+        padding-bottom: var(--spacing-small);
+    }
+}
+
+#titlearea table tbody tr {
+    height: auto !important;
+}
+
+#projectname {
+    font-size: var(--title-font-size);
+    font-weight: 600;
+}
+
+#projectnumber {
+    font-family: inherit;
+    font-size: 60%;
+}
+
+#projectbrief {
+    font-family: inherit;
+    font-size: 80%;
+}
+
+#projectlogo {
+    vertical-align: middle;
+}
+
+#projectlogo img {
+    max-height: calc(var(--title-font-size) * 2);
+    margin-right: var(--spacing-small);
+}
+
+.sm-dox, .tabs, .tabs2, .tabs3 {
+    background: none;
+    padding: 0;
+}
+
+.tabs, .tabs2, .tabs3 {
+    border-bottom: 1px solid var(--separator-color);
+    margin-bottom: -1px;
+}
+
+.main-menu-btn-icon, .main-menu-btn-icon:before, .main-menu-btn-icon:after {
+    background: var(--page-secondary-foreground-color);
+}
+
+@media screen and (max-width: 767px) {
+    .sm-dox a span.sub-arrow {
+        background: var(--code-background);
+    }
+
+    #main-menu a.has-submenu span.sub-arrow {
+        color: var(--page-secondary-foreground-color);
+        border-radius: var(--border-radius-medium);
+    }
+
+    #main-menu a.has-submenu:hover span.sub-arrow {
+        color: var(--page-foreground-color);
+    }
+}
+
+@media screen and (min-width: 768px) {
+    .sm-dox li, .tablist li {
+        display: var(--menu-display);
+    }
+
+    .sm-dox a span.sub-arrow {
+        border-color: var(--header-foreground) transparent transparent transparent;
+    }
+
+    .sm-dox a:hover span.sub-arrow {
+        border-color: var(--menu-focus-foreground) transparent transparent transparent;
+    }
+
+    .sm-dox ul a span.sub-arrow {
+        border-color: transparent transparent transparent var(--page-foreground-color);
+    }
+
+    .sm-dox ul a:hover span.sub-arrow {
+        border-color: transparent transparent transparent var(--menu-focus-foreground);
+    }
+}
+
+.sm-dox ul {
+    background: var(--page-background-color);
+    box-shadow: var(--box-shadow);
+    border: 1px solid var(--separator-color);
+    border-radius: var(--border-radius-medium) !important;
+    padding: var(--spacing-small);
+    animation: ease-out 150ms slideInMenu;
+}
+
+@keyframes slideInMenu {
+    from {
+        opacity: 0;
+        transform: translate(0px, -2px);
+    }
+
+    to {
+        opacity: 1;
+        transform: translate(0px, 0px);
+    }
+}
+
+.sm-dox ul a {
+    color: var(--page-foreground-color) !important;
+    background: var(--page-background-color);
+    font-size: var(--navigation-font-size);
+}
+
+.sm-dox>li>ul:after {
+    border-bottom-color: var(--page-background-color) !important;
+}
+
+.sm-dox>li>ul:before {
+    border-bottom-color: var(--separator-color) !important;
+}
+
+.sm-dox ul a:hover, .sm-dox ul a:active, .sm-dox ul a:focus {
+    font-size: var(--navigation-font-size) !important;
+    color: var(--menu-focus-foreground) !important;
+    text-shadow: none;
+    background-color: var(--menu-focus-background);
+    border-radius: var(--border-radius-small) !important;
+}
+
+.sm-dox a, .sm-dox a:focus, .tablist li, .tablist li a, .tablist li.current a {
+    text-shadow: none;
+    background: transparent;
+    background-image: none !important;
+    color: var(--header-foreground) !important;
+    font-weight: normal;
+    font-size: var(--navigation-font-size);
+    border-radius: var(--border-radius-small) !important;
+}
+
+.sm-dox a:focus {
+    outline: auto;
+}
+
+.sm-dox a:hover, .sm-dox a:active, .tablist li a:hover {
+    text-shadow: none;
+    font-weight: normal;
+    background: var(--menu-focus-background);
+    color: var(--menu-focus-foreground) !important;
+    border-radius: var(--border-radius-small) !important;
+    font-size: var(--navigation-font-size);
+}
+
+.tablist li.current {
+    border-radius: var(--border-radius-small);
+    background: var(--menu-selected-background);
+}
+
+.tablist li {
+    margin: var(--spacing-small) 0 var(--spacing-small) var(--spacing-small);
+}
+
+.tablist a {
+    padding: 0 var(--spacing-large);
+}
+
+
+/*
+ Search box
+ */
+
+#MSearchBox {
+    height: var(--searchbar-height);
+    background: var(--searchbar-background);
+    border-radius: var(--searchbar-border-radius);
+    border: 1px solid var(--separator-color);
+    overflow: hidden;
+    width: var(--searchbar-width);
+    position: relative;
+    box-shadow: none;
+    display: block;
+    margin-top: 0;
+}
+
+/* until Doxygen 1.9.4 */
+.left img#MSearchSelect {
+    left: 0;
+    user-select: none;
+    padding-left: 8px;
+}
+
+/* Doxygen 1.9.5 */
+.left span#MSearchSelect {
+    left: 0;
+    user-select: none;
+    margin-left: 8px;
+    padding: 0;
+}
+
+.left #MSearchSelect[src$=".png"] {
+    padding-left: 0
+}
+
+.SelectionMark {
+    user-select: none;
+}
+
+.tabs .left #MSearchSelect {
+    padding-left: 0;
+}
+
+.tabs #MSearchBox {
+    position: absolute;
+    right: var(--spacing-medium);
+}
+
+@media screen and (max-width: 767px) {
+    .tabs #MSearchBox {
+        position: relative;
+        right: 0;
+        margin-left: var(--spacing-medium);
+        margin-top: 0;
+    }
+}
+
+#MSearchSelectWindow, #MSearchResultsWindow {
+    z-index: 9999;
+}
+
+#MSearchBox.MSearchBoxActive {
+    border-color: var(--primary-color);
+    box-shadow: inset 0 0 0 1px var(--primary-color);
+}
+
+#main-menu > li:last-child {
+    margin-right: 0;
+}
+
+@media screen and (max-width: 767px) {
+    #main-menu > li:last-child {
+        height: 50px;
+    }
+}
+
+#MSearchField {
+    font-size: var(--navigation-font-size);
+    height: calc(var(--searchbar-height) - 2px);
+    background: transparent;
+    width: calc(var(--searchbar-width) - 64px);
+}
+
+.MSearchBoxActive #MSearchField {
+    color: var(--searchbar-foreground);
+}
+
+#MSearchSelect {
+    top: calc(calc(var(--searchbar-height) / 2) - 11px);
+}
+
+#MSearchBox span.left, #MSearchBox span.right {
+    background: none;
+    background-image: none;
+}
+
+#MSearchBox span.right {
+    padding-top: calc(calc(var(--searchbar-height) / 2) - 12px);
+    position: absolute;
+    right: var(--spacing-small);
+}
+
+.tabs #MSearchBox span.right {
+    top: calc(calc(var(--searchbar-height) / 2) - 12px);
+}
+
+@keyframes slideInSearchResults {
+    from {
+        opacity: 0;
+        transform: translate(0, 15px);
+    }
+
+    to {
+        opacity: 1;
+        transform: translate(0, 20px);
+    }
+}
+
+#MSearchResultsWindow {
+    left: auto !important;
+    right: var(--spacing-medium);
+    border-radius: var(--border-radius-large);
+    border: 1px solid var(--separator-color);
+    transform: translate(0, 20px);
+    box-shadow: var(--box-shadow);
+    animation: ease-out 280ms slideInSearchResults;
+    background: var(--page-background-color);
+}
+
+iframe#MSearchResults {
+    margin: 4px;
+}
+
+iframe {
+    color-scheme: normal;
+}
+
+@media (prefers-color-scheme: dark) {
+    html:not(.light-mode) iframe#MSearchResults {
+        filter: invert() hue-rotate(180deg);
+    }
+}
+
+html.dark-mode iframe#MSearchResults {
+    filter: invert() hue-rotate(180deg);
+}
+
+#MSearchResults .SRPage {
+    background-color: transparent;
+}
+
+#MSearchResults .SRPage .SREntry {
+    font-size: 10pt;
+    padding: var(--spacing-small) var(--spacing-medium);
+}
+
+#MSearchSelectWindow {
+    border: 1px solid var(--separator-color);
+    border-radius: var(--border-radius-medium);
+    box-shadow: var(--box-shadow);
+    background: var(--page-background-color);
+    padding-top: var(--spacing-small);
+    padding-bottom: var(--spacing-small);
+}
+
+#MSearchSelectWindow a.SelectItem {
+    font-size: var(--navigation-font-size);
+    line-height: var(--content-line-height);
+    margin: 0 var(--spacing-small);
+    border-radius: var(--border-radius-small);
+    color: var(--page-foreground-color) !important;
+    font-weight: normal;
+}
+
+#MSearchSelectWindow a.SelectItem:hover {
+    background: var(--menu-focus-background);
+    color: var(--menu-focus-foreground) !important;
+}
+
+@media screen and (max-width: 767px) {
+    #MSearchBox {
+        margin-top: var(--spacing-medium);
+        margin-bottom: var(--spacing-medium);
+        width: calc(100vw - 30px);
+    }
+
+    #main-menu > li:last-child {
+        float: none !important;
+    }
+
+    #MSearchField {
+        width: calc(100vw - 110px);
+    }
+
+    @keyframes slideInSearchResultsMobile {
+        from {
+            opacity: 0;
+            transform: translate(0, 15px);
+        }
+
+        to {
+            opacity: 1;
+            transform: translate(0, 20px);
+        }
+    }
+
+    #MSearchResultsWindow {
+        left: var(--spacing-medium) !important;
+        right: var(--spacing-medium);
+        overflow: auto;
+        transform: translate(0, 20px);
+        animation: ease-out 280ms slideInSearchResultsMobile;
+        width: auto !important;
+    }
+
+    /*
+     * Overwrites for fixing the searchbox on mobile in doxygen 1.9.2
+     */
+    label.main-menu-btn ~ #searchBoxPos1 {
+        top: 3px !important;
+        right: 6px !important;
+        left: 45px;
+        display: flex;
+    }
+
+    label.main-menu-btn ~ #searchBoxPos1 > #MSearchBox {
+        margin-top: 0;
+        margin-bottom: 0;
+        flex-grow: 2;
+        float: left;
+    }
+}
+
+/*
+ Tree view
+ */
+
+#side-nav {
+    padding: 0 !important;
+    background: var(--side-nav-background);
+    min-width: 8px;
+    max-width: 50vw;
+}
+
+@media screen and (max-width: 767px) {
+    #side-nav {
+        display: none;
+    }
+
+    #doc-content {
+        margin-left: 0 !important;
+    }
+}
+
+#nav-tree {
+    background: transparent;
+    margin-right: 1px;
+}
+
+#nav-tree .label {
+    font-size: var(--navigation-font-size);
+}
+
+#nav-tree .item {
+    height: var(--tree-item-height);
+    line-height: var(--tree-item-height);
+    overflow: hidden;
+    text-overflow: ellipsis;
+}
+
+#nav-tree .item > a:focus {
+    outline: none;
+}
+
+#nav-sync {
+    bottom: 12px;
+    right: 12px;
+    top: auto !important;
+    user-select: none;
+}
+
+#nav-tree .selected {
+    text-shadow: none;
+    background-image: none;
+    background-color: transparent;
+    position: relative;
+    color: var(--primary-color) !important;
+    font-weight: 500;
+}
+
+#nav-tree .selected::after {
+    content: "";
+    position: absolute;
+    top: 1px;
+    bottom: 1px;
+    left: 0;
+    width: 4px;
+    border-radius: 0 var(--border-radius-small) var(--border-radius-small) 0;
+    background: var(--primary-color);
+}
+
+
+#nav-tree a {
+    color: var(--side-nav-foreground) !important;
+    font-weight: normal;
+}
+
+#nav-tree a:focus {
+    outline-style: auto;
+}
+
+#nav-tree .arrow {
+    opacity: var(--side-nav-arrow-opacity);
+    background: none;
+}
+
+.arrow {
+    color: inherit;
+    cursor: pointer;
+    font-size: 45%;
+    vertical-align: middle;
+    margin-right: 2px;
+    font-family: serif;
+    height: auto;
+    text-align: right;
+}
+
+#nav-tree div.item:hover .arrow, #nav-tree a:focus .arrow {
+    opacity: var(--side-nav-arrow-hover-opacity);
+}
+
+#nav-tree .selected a {
+    color: var(--primary-color) !important;
+    font-weight: bolder;
+    font-weight: 600;
+}
+
+.ui-resizable-e {
+    width: 4px;
+    background: transparent;
+    box-shadow: inset -1px 0 0 0 var(--separator-color);
+}
+
+/*
+ Contents
+ */
+
+div.header {
+    border-bottom: 1px solid var(--separator-color);
+    background-color: var(--page-background-color);
+    background-image: none;
+}
+
+@media screen and (min-width: 1000px) {
+    #doc-content > div > div.contents,
+    .PageDoc > div.contents {
+        display: flex;
+        flex-direction: row-reverse;
+        flex-wrap: nowrap;
+        align-items: flex-start;
+    }
+    
+    div.contents .textblock {
+        min-width: 200px;
+        flex-grow: 1;
+    }
+}
+
+div.contents, div.header .title, div.header .summary {
+    max-width: var(--content-maxwidth);
+}
+
+div.contents, div.header .title  {
+    line-height: initial;
+    margin: calc(var(--spacing-medium) + .2em) auto var(--spacing-medium) auto;
+}
+
+div.header .summary {
+    margin: var(--spacing-medium) auto 0 auto;
+}
+
+div.headertitle {
+    padding: 0;
+}
+
+div.header .title {
+    font-weight: 600;
+    font-size: 225%;
+    padding: var(--spacing-medium) var(--spacing-large);
+    word-break: break-word;
+}
+
+div.header .summary {
+    width: auto;
+    display: block;
+    float: none;
+    padding: 0 var(--spacing-large);
+}
+
+td.memSeparator {
+    border-color: var(--separator-color);
+}
+
+span.mlabel {
+    background: var(--primary-color);
+    border: none;
+    padding: 4px 9px;
+    border-radius: 12px;
+    margin-right: var(--spacing-medium);
+}
+
+span.mlabel:last-of-type {
+    margin-right: 2px;
+}
+
+div.contents {
+    padding: 0 var(--spacing-large);
+}
+
+div.contents p, div.contents li {
+    line-height: var(--content-line-height);
+}
+
+div.contents div.dyncontent {
+    margin: var(--spacing-medium) 0;
+}
+
+@media (prefers-color-scheme: dark) {
+    html:not(.light-mode) div.contents div.dyncontent img,
+    html:not(.light-mode) div.contents center img,
+    html:not(.light-mode) div.contents > table img,
+    html:not(.light-mode) div.contents div.dyncontent iframe,
+    html:not(.light-mode) div.contents center iframe,
+    html:not(.light-mode) div.contents table iframe,
+    html:not(.light-mode) div.contents .dotgraph iframe {
+        filter: brightness(89%) hue-rotate(180deg) invert();
+    }
+}
+
+html.dark-mode div.contents div.dyncontent img,
+html.dark-mode div.contents center img,
+html.dark-mode div.contents > table img,
+html.dark-mode div.contents div.dyncontent iframe,
+html.dark-mode div.contents center iframe,
+html.dark-mode div.contents table iframe,
+html.dark-mode div.contents .dotgraph iframe
+ {
+    filter: brightness(89%) hue-rotate(180deg) invert();
+}
+
+h2.groupheader {
+    border-bottom: 0px;
+    color: var(--page-foreground-color);
+    box-shadow: 
+        100px 0 var(--page-background-color), 
+        -100px 0 var(--page-background-color),
+        100px 0.75px var(--separator-color),
+        -100px 0.75px var(--separator-color),
+        500px 0 var(--page-background-color), 
+        -500px 0 var(--page-background-color),
+        500px 0.75px var(--separator-color),
+        -500px 0.75px var(--separator-color),
+        900px 0 var(--page-background-color), 
+        -900px 0 var(--page-background-color),
+        900px 0.75px var(--separator-color),
+        -900px 0.75px var(--separator-color),
+        1400px 0 var(--page-background-color),
+        -1400px 0 var(--page-background-color), 
+        1400px 0.75px var(--separator-color),
+        -1400px 0.75px var(--separator-color),
+        1900px 0 var(--page-background-color),
+        -1900px 0 var(--page-background-color),
+        1900px 0.75px var(--separator-color),
+        -1900px 0.75px var(--separator-color);
+}
+
+blockquote {
+    margin: 0 var(--spacing-medium) 0 var(--spacing-medium);
+    padding: var(--spacing-small) var(--spacing-large);
+    background: var(--blockquote-background);
+    color: var(--blockquote-foreground);
+    border-left: 0;
+    overflow: visible;
+    border-radius: var(--border-radius-medium);
+    overflow: visible;
+    position: relative;
+}
+
+blockquote::before, blockquote::after {
+    font-weight: bold;
+    font-family: serif;
+    font-size: 360%;
+    opacity: .15;
+    position: absolute;
+}
+
+blockquote::before {
+    content: "“";
+    left: -10px;
+    top: 4px;
+}
+
+blockquote::after {
+    content: "”";
+    right: -8px;
+    bottom: -25px;
+}
+
+blockquote p {
+    margin: var(--spacing-small) 0 var(--spacing-medium) 0;
+}
+.paramname, .paramname em {
+    font-weight: 600;
+    color: var(--primary-dark-color);
+}
+
+.paramname > code {
+    border: 0;
+}
+
+table.params .paramname {
+    font-weight: 600;
+    font-family: var(--font-family-monospace);
+    font-size: var(--code-font-size);
+    padding-right: var(--spacing-small);
+    line-height: var(--table-line-height);
+}
+
+h1.glow, h2.glow, h3.glow, h4.glow, h5.glow, h6.glow {
+    text-shadow: 0 0 15px var(--primary-light-color);
+}
+
+.alphachar a {
+    color: var(--page-foreground-color);
+}
+
+.dotgraph {
+    max-width: 100%;
+    overflow-x: scroll;
+}
+
+.dotgraph .caption {
+    position: sticky;
+    left: 0;
+}
+
+/* Wrap Graphviz graphs with the `interactive_dotgraph` class if `INTERACTIVE_SVG = YES` */
+.interactive_dotgraph .dotgraph iframe {
+    max-width: 100%;
+}
+
+/*
+ Table of Contents
+ */
+
+div.contents .toc {
+    max-height: var(--toc-max-height);
+    min-width: var(--toc-width);
+    border: 0;
+    border-left: 1px solid var(--separator-color);
+    border-radius: 0;
+    background-color: var(--page-background-color);
+    box-shadow: none;
+    position: sticky;
+    top: var(--toc-sticky-top);
+    padding: 0 var(--spacing-large);
+    margin: var(--spacing-small) 0 var(--spacing-large) var(--spacing-large);
+}
+
+div.toc h3 {
+    color: var(--toc-foreground);
+    font-size: var(--navigation-font-size);
+    margin: var(--spacing-large) 0 var(--spacing-medium) 0;
+}
+
+div.toc li {
+    padding: 0;
+    background: none;
+    line-height: var(--toc-font-size);
+    margin: var(--toc-font-size) 0 0 0;
+}
+
+div.toc li::before {
+    display: none;
+}
+
+div.toc ul {
+    margin-top: 0
+}
+
+div.toc li a {
+    font-size: var(--toc-font-size);
+    color: var(--page-foreground-color) !important;
+    text-decoration: none;
+}
+
+div.toc li a:hover, div.toc li a.active {
+    color: var(--primary-color) !important;
+}
+
+div.toc li a.aboveActive {
+    color: var(--page-secondary-foreground-color) !important;
+}
+
+
+@media screen and (max-width: 999px) {
+    div.contents .toc {
+        max-height: 45vh;
+        float: none;
+        width: auto;
+        margin: 0 0 var(--spacing-medium) 0;
+        position: relative;
+        top: 0;
+        position: relative;
+        border: 1px solid var(--separator-color);
+        border-radius: var(--border-radius-medium);
+        background-color: var(--toc-background);
+        box-shadow: var(--box-shadow);
+    }
+
+    div.contents .toc.interactive {
+        max-height: calc(var(--navigation-font-size) + 2 * var(--spacing-large));
+        overflow: hidden;
+    }
+
+    div.contents .toc > h3 {
+        -webkit-tap-highlight-color: transparent;
+        cursor: pointer;
+        position: sticky;
+        top: 0;
+        background-color: var(--toc-background);
+        margin: 0;
+        padding: var(--spacing-large) 0;
+        display: block;
+    }
+
+    div.contents .toc.interactive > h3::before {
+        content: "";
+        width: 0; 
+        height: 0; 
+        border-left: 4px solid transparent;
+        border-right: 4px solid transparent;
+        border-top: 5px solid var(--primary-color);
+        display: inline-block;
+        margin-right: var(--spacing-small);
+        margin-bottom: calc(var(--navigation-font-size) / 4);
+        transform: rotate(-90deg);
+        transition: transform var(--animation-duration) ease-out;
+    }
+
+    div.contents .toc.interactive.open > h3::before {
+        transform: rotate(0deg);
+    }
+
+    div.contents .toc.interactive.open {
+        max-height: 45vh;
+        overflow: auto;
+        transition: max-height 0.2s ease-in-out;
+    }
+
+    div.contents .toc a, div.contents .toc a.active {
+        color: var(--primary-color) !important;
+    }
+
+    div.contents .toc a:hover {
+        text-decoration: underline;
+    }
+}
+
+/*
+ Code & Fragments
+ */
+
+code, div.fragment, pre.fragment {
+    border-radius: var(--border-radius-small);
+    border: 1px solid var(--separator-color);
+    overflow: hidden;
+}
+
+code {
+    display: inline;
+    background: var(--code-background);
+    color: var(--code-foreground);
+    padding: 2px 6px;
+}
+
+div.fragment, pre.fragment {
+    margin: var(--spacing-medium) 0;
+    padding: calc(var(--spacing-large) - (var(--spacing-large) / 6)) var(--spacing-large);
+    background: var(--fragment-background);
+    color: var(--fragment-foreground);
+    overflow-x: auto;
+}
+
+@media screen and (max-width: 767px) {
+    div.fragment, pre.fragment {
+        border-top-right-radius: 0;
+        border-bottom-right-radius: 0;
+        border-right: 0;
+    }
+
+    .contents > div.fragment,
+    .textblock > div.fragment,
+    .textblock > pre.fragment,
+    .textblock > .tabbed > ul > li > div.fragment,
+    .textblock > .tabbed > ul > li > pre.fragment,
+    .contents > .doxygen-awesome-fragment-wrapper > div.fragment,
+    .textblock > .doxygen-awesome-fragment-wrapper > div.fragment,
+    .textblock > .doxygen-awesome-fragment-wrapper > pre.fragment,
+    .textblock > .tabbed > ul > li > .doxygen-awesome-fragment-wrapper > div.fragment,
+    .textblock > .tabbed > ul > li > .doxygen-awesome-fragment-wrapper > pre.fragment {
+        margin: var(--spacing-medium) calc(0px - var(--spacing-large));
+        border-radius: 0;
+        border-left: 0;
+    }
+
+    .textblock li > .fragment,
+    .textblock li > .doxygen-awesome-fragment-wrapper > .fragment {
+        margin: var(--spacing-medium) calc(0px - var(--spacing-large));
+    }
+
+    .memdoc li > .fragment,
+    .memdoc li > .doxygen-awesome-fragment-wrapper > .fragment {
+        margin: var(--spacing-medium) calc(0px - var(--spacing-medium));
+    }
+
+    .textblock ul, .memdoc ul {
+        overflow: initial;
+    }
+
+    .memdoc > div.fragment,
+    .memdoc > pre.fragment,
+    dl dd > div.fragment,
+    dl dd pre.fragment,
+    .memdoc > .doxygen-awesome-fragment-wrapper > div.fragment,
+    .memdoc > .doxygen-awesome-fragment-wrapper > pre.fragment,
+    dl dd > .doxygen-awesome-fragment-wrapper > div.fragment,
+    dl dd .doxygen-awesome-fragment-wrapper > pre.fragment {
+        margin: var(--spacing-medium) calc(0px - var(--spacing-medium));
+        border-radius: 0;
+        border-left: 0;
+    }
+}
+
+code, code a, pre.fragment, div.fragment, div.fragment .line, div.fragment span, div.fragment .line a, div.fragment .line span {
+    font-family: var(--font-family-monospace);
+    font-size: var(--code-font-size) !important;
+}
+
+div.line:after {
+    margin-right: var(--spacing-medium);
+}
+
+div.fragment .line, pre.fragment {
+    white-space: pre;
+    word-wrap: initial;
+    line-height: var(--fragment-lineheight);
+}
+
+div.fragment span.keyword {
+    color: var(--fragment-keyword);
+}
+
+div.fragment span.keywordtype {
+    color: var(--fragment-keywordtype);
+}
+
+div.fragment span.keywordflow {
+    color: var(--fragment-keywordflow);
+}
+
+div.fragment span.stringliteral {
+    color: var(--fragment-token)
+}
+
+div.fragment span.comment {
+    color: var(--fragment-comment);
+}
+
+div.fragment a.code {
+    color: var(--fragment-link) !important;
+}
+
+div.fragment span.preprocessor {
+    color: var(--fragment-preprocessor);
+}
+
+div.fragment span.lineno {
+    display: inline-block;
+    width: 27px;
+    border-right: none;
+    background: var(--fragment-linenumber-background);
+    color: var(--fragment-linenumber-color);
+}
+
+div.fragment span.lineno a {
+    background: none;
+    color: var(--fragment-link) !important;
+}
+
+div.fragment > .line:first-child .lineno {
+    box-shadow: -999999px 0px 0 999999px var(--fragment-linenumber-background), -999998px 0px 0 999999px var(--fragment-linenumber-border);
+    background-color: var(--fragment-linenumber-background) !important;
+}
+
+div.line {
+    border-radius: var(--border-radius-small);
+}
+
+div.line.glow {
+    background-color: var(--primary-light-color);
+    box-shadow: none;
+}
+
+/*
+ dl warning, attention, note, deprecated, bug, ...
+ */
+
+dl.bug dt a, dl.deprecated dt a, dl.todo dt a {
+    font-weight: bold !important;
+}
+
+dl.warning, dl.attention, dl.note, dl.deprecated, dl.bug, dl.invariant, dl.pre, dl.post, dl.todo, dl.remark {
+    padding: var(--spacing-medium);
+    margin: var(--spacing-medium) 0;
+    color: var(--page-background-color);
+    overflow: hidden;
+    margin-left: 0;
+    border-radius: var(--border-radius-small);
+}
+
+dl.section dd {
+    margin-bottom: 2px;
+}
+
+dl.warning, dl.attention {
+    background: var(--warning-color);
+    border-left: 8px solid var(--warning-color-dark);
+    color: var(--warning-color-darker);
+}
+
+dl.warning dt, dl.attention dt {
+    color: var(--warning-color-dark);
+}
+
+dl.note, dl.remark {
+    background: var(--note-color);
+    border-left: 8px solid var(--note-color-dark);
+    color: var(--note-color-darker);
+}
+
+dl.note dt, dl.remark dt {
+    color: var(--note-color-dark);
+}
+
+dl.todo {
+    background: var(--todo-color);
+    border-left: 8px solid var(--todo-color-dark);
+    color: var(--todo-color-darker);
+}
+
+dl.todo dt a {
+    color: var(--todo-color-dark) !important;
+}
+
+dl.bug dt a {
+    color: var(--todo-color-dark) !important;
+}
+
+dl.bug {
+    background: var(--bug-color);
+    border-left: 8px solid var(--bug-color-dark);
+    color: var(--bug-color-darker);
+}
+
+dl.bug dt a {
+    color: var(--bug-color-dark) !important;
+}
+
+dl.deprecated {
+    background: var(--deprecated-color);
+    border-left: 8px solid var(--deprecated-color-dark);
+    color: var(--deprecated-color-darker);
+}
+
+dl.deprecated dt a {
+    color: var(--deprecated-color-dark) !important;
+}
+
+dl.section dd, dl.bug dd, dl.deprecated dd, dl.todo dd {
+    margin-inline-start: 0px;
+}
+
+dl.invariant, dl.pre, dl.post {
+    background: var(--invariant-color);
+    border-left: 8px solid var(--invariant-color-dark);
+    color: var(--invariant-color-darker);
+}
+
+dl.invariant dt, dl.pre dt, dl.post dt {
+    color: var(--invariant-color-dark);
+}
+
+/*
+ memitem
+ */
+
+div.memdoc, div.memproto, h2.memtitle {
+    box-shadow: none;
+    background-image: none;
+    border: none;
+}
+
+div.memdoc {
+    padding: 0 var(--spacing-medium);
+    background: var(--page-background-color);
+}
+
+h2.memtitle, div.memitem {
+    border: 1px solid var(--separator-color);
+    box-shadow: var(--box-shadow);
+}
+
+h2.memtitle {
+    box-shadow: 0px var(--spacing-medium) 0 -1px var(--fragment-background), var(--box-shadow);
+}
+
+div.memitem {
+    transition: none;
+}
+
+div.memproto, h2.memtitle {
+    background: var(--fragment-background);
+}
+
+h2.memtitle {
+    font-weight: 500;
+    font-size: var(--memtitle-font-size);
+    font-family: var(--font-family-monospace);
+    border-bottom: none;
+    border-top-left-radius: var(--border-radius-medium);
+    border-top-right-radius: var(--border-radius-medium);
+    word-break: break-all;
+    position: relative;
+}
+
+h2.memtitle:after {
+    content: "";
+    display: block;
+    background: var(--fragment-background);
+    height: var(--spacing-medium);
+    bottom: calc(0px - var(--spacing-medium));
+    left: 0;
+    right: -14px;
+    position: absolute;
+    border-top-right-radius: var(--border-radius-medium);
+}
+
+h2.memtitle > span.permalink {
+    font-size: inherit;
+}
+
+h2.memtitle > span.permalink > a {
+    text-decoration: none;
+    padding-left: 3px;
+    margin-right: -4px;
+    user-select: none;
+    display: inline-block;
+    margin-top: -6px;
+}
+
+h2.memtitle > span.permalink > a:hover {
+    color: var(--primary-dark-color) !important;
+}
+
+a:target + h2.memtitle, a:target + h2.memtitle + div.memitem {
+    border-color: var(--primary-light-color);
+}
+
+div.memitem {
+    border-top-right-radius: var(--border-radius-medium);
+    border-bottom-right-radius: var(--border-radius-medium);
+    border-bottom-left-radius: var(--border-radius-medium);
+    overflow: hidden;
+    display: block !important;
+}
+
+div.memdoc {
+    border-radius: 0;
+}
+
+div.memproto {
+    border-radius: 0 var(--border-radius-small) 0 0;
+    overflow: auto;
+    border-bottom: 1px solid var(--separator-color);
+    padding: var(--spacing-medium);
+    margin-bottom: -1px;
+}
+
+div.memtitle {
+    border-top-right-radius: var(--border-radius-medium);
+    border-top-left-radius: var(--border-radius-medium);
+}
+
+div.memproto table.memname {
+    font-family: var(--font-family-monospace);
+    color: var(--page-foreground-color);
+    font-size: var(--memname-font-size);
+    text-shadow: none;
+}
+
+div.memproto div.memtemplate {
+    font-family: var(--font-family-monospace);
+    color: var(--primary-dark-color);
+    font-size: var(--memname-font-size);
+    margin-left: 2px;
+    text-shadow: none;
+}
+
+table.mlabels, table.mlabels > tbody {
+    display: block;
+}
+
+td.mlabels-left {
+    width: auto;
+}
+
+td.mlabels-right {
+    margin-top: 3px;
+    position: sticky;
+    left: 0;
+}
+
+table.mlabels > tbody > tr:first-child {
+    display: flex;
+    justify-content: space-between;
+    flex-wrap: wrap;
+}
+
+.memname, .memitem span.mlabels {
+    margin: 0
+}
+
+/*
+ reflist
+ */
+
+dl.reflist {
+    box-shadow: var(--box-shadow);
+    border-radius: var(--border-radius-medium);
+    border: 1px solid var(--separator-color);
+    overflow: hidden;
+    padding: 0;
+}
+
+
+dl.reflist dt, dl.reflist dd {
+    box-shadow: none;
+    text-shadow: none;
+    background-image: none;
+    border: none;
+    padding: 12px;
+}
+
+
+dl.reflist dt {
+    font-weight: 500;
+    border-radius: 0;
+    background: var(--code-background);
+    border-bottom: 1px solid var(--separator-color);
+    color: var(--page-foreground-color)
+}
+
+
+dl.reflist dd {
+    background: none;
+}
+
+/*
+ Table
+ */
+
+.contents table:not(.memberdecls):not(.mlabels):not(.fieldtable):not(.memname),
+.contents table:not(.memberdecls):not(.mlabels):not(.fieldtable):not(.memname) tbody {
+    display: inline-block;
+    max-width: 100%;
+}
+
+.contents > table:not(.memberdecls):not(.mlabels):not(.fieldtable):not(.memname):not(.classindex) {
+    margin-left: calc(0px - var(--spacing-large));
+    margin-right: calc(0px - var(--spacing-large));
+    max-width: calc(100% + 2 * var(--spacing-large));
+}
+
+table.fieldtable,
+table.markdownTable tbody,
+table.doxtable tbody {
+    border: none;
+    margin: var(--spacing-medium) 0;
+    box-shadow: 0 0 0 1px var(--separator-color);
+    border-radius: var(--border-radius-small);
+}
+
+table.markdownTable, table.doxtable, table.fieldtable {
+    padding: 1px;
+}
+
+table.doxtable caption {
+    display: block;
+}
+
+table.fieldtable {
+    border-collapse: collapse;
+    width: 100%;
+}
+
+th.markdownTableHeadLeft,
+th.markdownTableHeadRight,
+th.markdownTableHeadCenter,
+th.markdownTableHeadNone,
+table.doxtable th {
+    background: var(--tablehead-background);
+    color: var(--tablehead-foreground);
+    font-weight: 600;
+    font-size: var(--page-font-size);
+}
+
+th.markdownTableHeadLeft:first-child,
+th.markdownTableHeadRight:first-child,
+th.markdownTableHeadCenter:first-child,
+th.markdownTableHeadNone:first-child,
+table.doxtable tr th:first-child {
+    border-top-left-radius: var(--border-radius-small);
+}
+
+th.markdownTableHeadLeft:last-child,
+th.markdownTableHeadRight:last-child,
+th.markdownTableHeadCenter:last-child,
+th.markdownTableHeadNone:last-child,
+table.doxtable tr th:last-child {
+    border-top-right-radius: var(--border-radius-small);
+}
+
+table.markdownTable td,
+table.markdownTable th,
+table.fieldtable td,
+table.fieldtable th,
+table.doxtable td,
+table.doxtable th {
+    border: 1px solid var(--separator-color);
+    padding: var(--spacing-small) var(--spacing-medium);
+}
+
+table.markdownTable td:last-child,
+table.markdownTable th:last-child,
+table.fieldtable td:last-child,
+table.fieldtable th:last-child,
+table.doxtable td:last-child,
+table.doxtable th:last-child {
+    border-right: none;
+}
+
+table.markdownTable td:first-child,
+table.markdownTable th:first-child,
+table.fieldtable td:first-child,
+table.fieldtable th:first-child,
+table.doxtable td:first-child,
+table.doxtable th:first-child {
+    border-left: none;
+}
+
+table.markdownTable tr:first-child td,
+table.markdownTable tr:first-child th,
+table.fieldtable tr:first-child td,
+table.fieldtable tr:first-child th,
+table.doxtable tr:first-child td,
+table.doxtable tr:first-child th {
+    border-top: none;
+}
+
+table.markdownTable tr:last-child td,
+table.markdownTable tr:last-child th,
+table.fieldtable tr:last-child td,
+table.fieldtable tr:last-child th,
+table.doxtable tr:last-child td,
+table.doxtable tr:last-child th {
+    border-bottom: none;
+}
+
+table.markdownTable tr, table.doxtable tr {
+    border-bottom: 1px solid var(--separator-color);
+}
+
+table.markdownTable tr:last-child, table.doxtable tr:last-child {
+    border-bottom: none;
+}
+
+.full_width_table table:not(.memberdecls):not(.mlabels):not(.fieldtable):not(.memname) {
+    display: block;
+}
+
+.full_width_table table:not(.memberdecls):not(.mlabels):not(.fieldtable):not(.memname) tbody {
+    display: table;
+    width: 100%;
+}
+
+table.fieldtable th {
+    font-size: var(--page-font-size);
+    font-weight: 600;
+    background-image: none;
+    background-color: var(--tablehead-background);
+    color: var(--tablehead-foreground);
+}
+
+table.fieldtable td.fieldtype, .fieldtable td.fieldname, .fieldtable td.fieldinit, .fieldtable td.fielddoc, .fieldtable th {
+    border-bottom: 1px solid var(--separator-color);
+    border-right: 1px solid var(--separator-color);
+}
+
+table.fieldtable tr:last-child td:first-child {
+    border-bottom-left-radius: var(--border-radius-small);
+}
+
+table.fieldtable tr:last-child td:last-child {
+    border-bottom-right-radius: var(--border-radius-small);
+}
+
+.memberdecls td.glow, .fieldtable tr.glow {
+    background-color: var(--primary-light-color);
+    box-shadow: none;
+}
+
+table.memberdecls {
+    display: block;
+    -webkit-tap-highlight-color: transparent;
+}
+
+table.memberdecls tr[class^='memitem'] {
+    font-family: var(--font-family-monospace);
+    font-size: var(--code-font-size);
+}
+
+table.memberdecls tr[class^='memitem'] .memTemplParams {
+    font-family: var(--font-family-monospace);
+    font-size: var(--code-font-size);
+    color: var(--primary-dark-color);
+    white-space: normal;
+}
+
+table.memberdecls .memItemLeft,
+table.memberdecls .memItemRight,
+table.memberdecls .memTemplItemLeft,
+table.memberdecls .memTemplItemRight,
+table.memberdecls .memTemplParams {
+    transition: none;
+    padding-top: var(--spacing-small);
+    padding-bottom: var(--spacing-small);
+    border-top: 1px solid var(--separator-color);
+    border-bottom: 1px solid var(--separator-color);
+    background-color: var(--fragment-background);
+}
+
+table.memberdecls .memTemplItemLeft,
+table.memberdecls .memTemplItemRight {
+    padding-top: 2px;
+}
+
+table.memberdecls .memTemplParams {
+    border-bottom: 0;
+    border-left: 1px solid var(--separator-color);
+    border-right: 1px solid var(--separator-color);
+    border-radius: var(--border-radius-small) var(--border-radius-small) 0 0;
+    padding-bottom: var(--spacing-small);
+}
+
+table.memberdecls .memTemplItemLeft {
+    border-radius: 0 0 0 var(--border-radius-small);
+    border-left: 1px solid var(--separator-color);
+    border-top: 0;
+}
+
+table.memberdecls .memTemplItemRight {
+    border-radius: 0 0 var(--border-radius-small) 0;
+    border-right: 1px solid var(--separator-color);
+    padding-left: 0;
+    border-top: 0;
+}
+
+table.memberdecls .memItemLeft {
+    border-radius: var(--border-radius-small) 0 0 var(--border-radius-small);
+    border-left: 1px solid var(--separator-color);
+    padding-left: var(--spacing-medium);
+    padding-right: 0;
+}
+
+table.memberdecls .memItemRight  {
+    border-radius: 0 var(--border-radius-small) var(--border-radius-small) 0;
+    border-right: 1px solid var(--separator-color);
+    padding-right: var(--spacing-medium);
+    padding-left: 0;
+
+}
+
+table.memberdecls .mdescLeft, table.memberdecls .mdescRight {
+    background: none;
+    color: var(--page-foreground-color);
+    padding: var(--spacing-small) 0;
+}
+
+table.memberdecls .memItemLeft,
+table.memberdecls .memTemplItemLeft {
+    padding-right: var(--spacing-medium);
+}
+
+table.memberdecls .memSeparator {
+    background: var(--page-background-color);
+    height: var(--spacing-large);
+    border: 0;
+    transition: none;
+}
+
+table.memberdecls .groupheader {
+    margin-bottom: var(--spacing-large);
+}
+
+table.memberdecls .inherit_header td {
+    padding: 0 0 var(--spacing-medium) 0;
+    text-indent: -12px;
+    color: var(--page-secondary-foreground-color);
+}
+
+table.memberdecls img[src="closed.png"],
+table.memberdecls img[src="open.png"],
+div.dynheader img[src="open.png"],
+div.dynheader img[src="closed.png"] {
+    width: 0; 
+    height: 0; 
+    border-left: 4px solid transparent;
+    border-right: 4px solid transparent;
+    border-top: 5px solid var(--primary-color);
+    margin-top: 8px;
+    display: block;
+    float: left;
+    margin-left: -10px;
+    transition: transform var(--animation-duration) ease-out;
+}
+
+table.memberdecls img {
+    margin-right: 10px;
+}
+
+table.memberdecls img[src="closed.png"],
+div.dynheader img[src="closed.png"] {
+    transform: rotate(-90deg);
+    
+}
+
+.compoundTemplParams {
+    font-family: var(--font-family-monospace);
+    color: var(--primary-dark-color);
+    font-size: var(--code-font-size);
+}
+
+@media screen and (max-width: 767px) {
+
+    table.memberdecls .memItemLeft,
+    table.memberdecls .memItemRight,
+    table.memberdecls .mdescLeft,
+    table.memberdecls .mdescRight,
+    table.memberdecls .memTemplItemLeft,
+    table.memberdecls .memTemplItemRight,
+    table.memberdecls .memTemplParams {
+        display: block;
+        text-align: left;
+        padding-left: var(--spacing-large);
+        margin: 0 calc(0px - var(--spacing-large)) 0 calc(0px - var(--spacing-large));
+        border-right: none;
+        border-left: none;
+        border-radius: 0;
+        white-space: normal;
+    }
+
+    table.memberdecls .memItemLeft,
+    table.memberdecls .mdescLeft,
+    table.memberdecls .memTemplItemLeft {
+        border-bottom: 0;
+        padding-bottom: 0;
+    }
+
+    table.memberdecls .memTemplItemLeft {
+        padding-top: 0;
+    }
+
+    table.memberdecls .mdescLeft {
+        margin-bottom: calc(0px - var(--page-font-size));
+    }
+
+    table.memberdecls .memItemRight, 
+    table.memberdecls .mdescRight,
+    table.memberdecls .memTemplItemRight {
+        border-top: 0;
+        padding-top: 0;
+        padding-right: var(--spacing-large);
+        overflow-x: auto;
+    }
+
+    table.memberdecls tr[class^='memitem']:not(.inherit) {
+        display: block;
+        width: calc(100vw - 2 * var(--spacing-large));
+    }
+
+    table.memberdecls .mdescRight {
+        color: var(--page-foreground-color);
+    }
+
+    table.memberdecls tr.inherit {
+        visibility: hidden;
+    }
+
+    table.memberdecls tr[style="display: table-row;"] {
+        display: block !important;
+        visibility: visible;
+        width: calc(100vw - 2 * var(--spacing-large));
+        animation: fade .5s;
+    }
+
+    @keyframes fade {
+        0% {
+            opacity: 0;
+            max-height: 0;
+        }
+
+        100% {
+            opacity: 1;
+            max-height: 200px;
+        }
+    }
+}
+
+
+/*
+ Horizontal Rule
+ */
+
+hr {
+    margin-top: var(--spacing-large);
+    margin-bottom: var(--spacing-large);
+    height: 1px;
+    background-color: var(--separator-color);
+    border: 0;
+}
+
+.contents hr {
+    box-shadow: 100px 0 var(--separator-color),
+                -100px 0 var(--separator-color),
+                500px 0 var(--separator-color),
+                -500px 0 var(--separator-color),
+                900px 0 var(--separator-color),
+                -900px 0 var(--separator-color),
+                1400px 0 var(--separator-color),
+                -1400px 0 var(--separator-color),
+                1900px 0 var(--separator-color),
+                -1900px 0 var(--separator-color);       
+}
+
+.contents img, .contents .center, .contents center, .contents div.image object {
+    max-width: 100%;
+    overflow: auto;
+}
+
+@media screen and (max-width: 767px) {
+    .contents .dyncontent > .center, .contents > center {
+        margin-left: calc(0px - var(--spacing-large));
+        margin-right: calc(0px - var(--spacing-large));
+        max-width: calc(100% + 2 * var(--spacing-large));
+    }
+}
+
+/*
+ Directories
+ */
+div.directory {
+    border-top: 1px solid var(--separator-color);
+    border-bottom: 1px solid var(--separator-color);
+    width: auto;
+}
+
+table.directory {
+    font-family: var(--font-family);
+    font-size: var(--page-font-size);
+    font-weight: normal;
+    width: 100%;
+}
+
+table.directory td.entry, table.directory td.desc {
+    padding: calc(var(--spacing-small) / 2) var(--spacing-small);
+    line-height: var(--table-line-height);
+}
+
+table.directory tr.even td:last-child {
+    border-radius: 0 var(--border-radius-small) var(--border-radius-small) 0;
+}
+
+table.directory tr.even td:first-child {
+    border-radius: var(--border-radius-small) 0 0 var(--border-radius-small);
+}
+
+table.directory tr.even:last-child td:last-child {
+    border-radius: 0 var(--border-radius-small) 0 0;
+}
+
+table.directory tr.even:last-child td:first-child {
+    border-radius: var(--border-radius-small) 0 0 0;
+}
+
+table.directory td.desc {
+    min-width: 250px;
+}
+
+table.directory tr.even {
+    background-color: var(--odd-color);
+}
+
+table.directory tr.odd {
+    background-color: transparent;
+}
+
+.icona {
+    width: auto;
+    height: auto;
+    margin: 0 var(--spacing-small);
+}
+
+.icon {
+    background: var(--primary-color);
+    border-radius: var(--border-radius-small);
+    font-size: var(--page-font-size);
+    padding: calc(var(--page-font-size) / 5);
+    line-height: var(--page-font-size);
+    transform: scale(0.8);
+    height: auto;
+    width: var(--page-font-size);
+    user-select: none;
+}
+
+.iconfopen, .icondoc, .iconfclosed {
+    background-position: center;
+    margin-bottom: 0;
+    height: var(--table-line-height);
+}
+
+.icondoc {
+    filter: saturate(0.2);
+}
+
+@media screen and (max-width: 767px) {
+    div.directory {
+        margin-left: calc(0px - var(--spacing-large));
+        margin-right: calc(0px - var(--spacing-large));
+    }
+}
+
+@media (prefers-color-scheme: dark) {
+    html:not(.light-mode) .iconfopen, html:not(.light-mode) .iconfclosed {
+        filter: hue-rotate(180deg) invert();
+    }
+}
+
+html.dark-mode .iconfopen, html.dark-mode .iconfclosed {
+    filter: hue-rotate(180deg) invert();
+}
+
+/*
+ Class list
+ */
+
+.classindex dl.odd {
+    background: var(--odd-color);
+    border-radius: var(--border-radius-small);
+}
+
+.classindex dl.even {
+    background-color: transparent;
+}
+
+/* 
+ Class Index Doxygen 1.8 
+*/
+
+table.classindex {
+    margin-left: 0;
+    margin-right: 0;
+    width: 100%;
+}
+
+table.classindex table div.ah {
+    background-image: none;
+    background-color: initial;
+    border-color: var(--separator-color);
+    color: var(--page-foreground-color);
+    box-shadow: var(--box-shadow);
+    border-radius: var(--border-radius-large);
+    padding: var(--spacing-small);
+}
+
+div.qindex {
+    background-color: var(--odd-color);
+    border-radius: var(--border-radius-small);
+    border: 1px solid var(--separator-color);
+    padding: var(--spacing-small) 0;
+}
+
+/*
+  Footer and nav-path
+ */
+
+#nav-path {
+    width: 100%;
+}
+
+#nav-path ul {
+    background-image: none;
+    background: var(--page-background-color);
+    border: none;
+    border-top: 1px solid var(--separator-color);
+    border-bottom: 1px solid var(--separator-color);
+    border-bottom: 0;
+    box-shadow: 0 0.75px 0 var(--separator-color);
+    font-size: var(--navigation-font-size);
+}
+
+img.footer {
+    width: 60px;
+}
+
+.navpath li.footer {
+    color: var(--page-secondary-foreground-color);
+}
+
+address.footer {
+    color: var(--page-secondary-foreground-color);
+    margin-bottom: var(--spacing-large);
+}
+
+#nav-path li.navelem {
+    background-image: none;
+    display: flex;
+    align-items: center;
+}
+
+.navpath li.navelem a {
+    text-shadow: none;
+    display: inline-block;
+    color: var(--primary-color) !important;
+}
+
+.navpath li.navelem b {
+    color: var(--primary-dark-color);
+    font-weight: 500;
+}
+
+li.navelem {
+    padding: 0;
+    margin-left: -8px;
+}
+
+li.navelem:first-child {
+    margin-left: var(--spacing-large);
+}
+
+li.navelem:first-child:before {
+    display: none;
+}
+
+#nav-path li.navelem:after {
+    content: '';
+    border: 5px solid var(--page-background-color);
+    border-bottom-color: transparent;
+    border-right-color: transparent;
+    border-top-color: transparent;
+    transform: translateY(-1px) scaleY(4.2);
+    z-index: 10;
+    margin-left: 6px;
+}
+
+#nav-path li.navelem:before {
+    content: '';
+    border: 5px solid var(--separator-color);
+    border-bottom-color: transparent;
+    border-right-color: transparent;
+    border-top-color: transparent;
+    transform: translateY(-1px) scaleY(3.2);
+    margin-right: var(--spacing-small);
+}
+
+.navpath li.navelem a:hover {
+    color: var(--primary-color);
+}
+
+/*
+ Scrollbars for Webkit
+*/
+
+#nav-tree::-webkit-scrollbar,
+div.fragment::-webkit-scrollbar,
+pre.fragment::-webkit-scrollbar,
+div.memproto::-webkit-scrollbar,
+.contents center::-webkit-scrollbar,
+.contents .center::-webkit-scrollbar,
+.contents table:not(.memberdecls):not(.mlabels):not(.fieldtable):not(.memname) tbody::-webkit-scrollbar,
+div.contents .toc::-webkit-scrollbar,
+.contents .dotgraph::-webkit-scrollbar,
+.contents .tabs-overview-container::-webkit-scrollbar {
+    background: transparent;
+    width: calc(var(--webkit-scrollbar-size) + var(--webkit-scrollbar-padding) + var(--webkit-scrollbar-padding));
+    height: calc(var(--webkit-scrollbar-size) + var(--webkit-scrollbar-padding) + var(--webkit-scrollbar-padding));
+}
+
+#nav-tree::-webkit-scrollbar-thumb,
+div.fragment::-webkit-scrollbar-thumb,
+pre.fragment::-webkit-scrollbar-thumb,
+div.memproto::-webkit-scrollbar-thumb,
+.contents center::-webkit-scrollbar-thumb,
+.contents .center::-webkit-scrollbar-thumb,
+.contents table:not(.memberdecls):not(.mlabels):not(.fieldtable):not(.memname) tbody::-webkit-scrollbar-thumb,
+div.contents .toc::-webkit-scrollbar-thumb,
+.contents .dotgraph::-webkit-scrollbar-thumb,
+.contents .tabs-overview-container::-webkit-scrollbar-thumb {
+    background-color: transparent;
+    border: var(--webkit-scrollbar-padding) solid transparent;
+    border-radius: calc(var(--webkit-scrollbar-padding) + var(--webkit-scrollbar-padding));
+    background-clip: padding-box;  
+}
+
+#nav-tree:hover::-webkit-scrollbar-thumb,
+div.fragment:hover::-webkit-scrollbar-thumb,
+pre.fragment:hover::-webkit-scrollbar-thumb,
+div.memproto:hover::-webkit-scrollbar-thumb,
+.contents center:hover::-webkit-scrollbar-thumb,
+.contents .center:hover::-webkit-scrollbar-thumb,
+.contents table:not(.memberdecls):not(.mlabels):not(.fieldtable):not(.memname) tbody:hover::-webkit-scrollbar-thumb,
+div.contents .toc:hover::-webkit-scrollbar-thumb,
+.contents .dotgraph:hover::-webkit-scrollbar-thumb,
+.contents .tabs-overview-container:hover::-webkit-scrollbar-thumb {
+    background-color: var(--webkit-scrollbar-color);
+}
+
+#nav-tree::-webkit-scrollbar-track,
+div.fragment::-webkit-scrollbar-track,
+pre.fragment::-webkit-scrollbar-track,
+div.memproto::-webkit-scrollbar-track,
+.contents center::-webkit-scrollbar-track,
+.contents .center::-webkit-scrollbar-track,
+.contents table:not(.memberdecls):not(.mlabels):not(.fieldtable):not(.memname) tbody::-webkit-scrollbar-track,
+div.contents .toc::-webkit-scrollbar-track,
+.contents .dotgraph::-webkit-scrollbar-track,
+.contents .tabs-overview-container::-webkit-scrollbar-track {
+    background: transparent;
+}
+
+#nav-tree::-webkit-scrollbar-corner {
+    background-color: var(--side-nav-background);
+}
+
+#nav-tree,
+div.fragment,
+pre.fragment,
+div.memproto,
+.contents center,
+.contents .center,
+.contents table:not(.memberdecls):not(.mlabels):not(.fieldtable):not(.memname) tbody,
+div.contents .toc {
+    overflow-x: auto;
+    overflow-x: overlay;
+}
+
+#nav-tree {
+    overflow-x: auto;
+    overflow-y: auto;
+    overflow-y: overlay;
+}
+
+/*
+ Scrollbars for Firefox
+*/
+
+#nav-tree,
+div.fragment,
+pre.fragment,
+div.memproto,
+.contents center,
+.contents .center,
+.contents table:not(.memberdecls):not(.mlabels):not(.fieldtable):not(.memname) tbody,
+div.contents .toc,
+.contents .dotgraph,
+.contents .tabs-overview-container {
+    scrollbar-width: thin;
+}
+
+/*
+  Optional Dark mode toggle button
+*/
+
+doxygen-awesome-dark-mode-toggle {
+    display: inline-block;
+    margin: 0 0 0 var(--spacing-small);
+    padding: 0;
+    width: var(--searchbar-height);
+    height: var(--searchbar-height);
+    background: none;
+    border: none;
+    border-radius: var(--searchbar-height);
+    vertical-align: middle;
+    text-align: center;
+    line-height: var(--searchbar-height);
+    font-size: 22px;
+    display: flex;
+    align-items: center;
+    justify-content: center;
+    user-select: none;
+    cursor: pointer;
+}
+
+doxygen-awesome-dark-mode-toggle > svg {
+    transition: transform var(--animation-duration) ease-in-out;
+}
+
+doxygen-awesome-dark-mode-toggle:active > svg {
+    transform: scale(.5);
+}
+
+doxygen-awesome-dark-mode-toggle:hover {
+    background-color: rgba(0,0,0,.03);
+}
+
+html.dark-mode doxygen-awesome-dark-mode-toggle:hover {
+    background-color: rgba(0,0,0,.18);
+}
+
+/*
+ Optional fragment copy button
+*/
+.doxygen-awesome-fragment-wrapper {
+    position: relative;
+}
+
+doxygen-awesome-fragment-copy-button {
+    opacity: 0;
+    background: var(--fragment-background);
+    width: 28px;
+    height: 28px;
+    position: absolute;
+    right: calc(var(--spacing-large) - (var(--spacing-large) / 2.5));
+    top: calc(var(--spacing-large) - (var(--spacing-large) / 2.5));
+    border: 1px solid var(--fragment-foreground);
+    cursor: pointer;
+    border-radius: var(--border-radius-small);
+    display: flex;
+    justify-content: center;
+    align-items: center;
+}
+
+.doxygen-awesome-fragment-wrapper:hover doxygen-awesome-fragment-copy-button, doxygen-awesome-fragment-copy-button.success {
+    opacity: .28;
+}
+
+doxygen-awesome-fragment-copy-button:hover, doxygen-awesome-fragment-copy-button.success {
+    opacity: 1 !important;
+}
+
+doxygen-awesome-fragment-copy-button:active:not([class~=success]) svg {
+    transform: scale(.91);
+}
+
+doxygen-awesome-fragment-copy-button svg {
+    fill: var(--fragment-foreground);
+    width: 18px;
+    height: 18px;
+}
+
+doxygen-awesome-fragment-copy-button.success svg {
+    fill: rgb(14, 168, 14);
+}
+
+doxygen-awesome-fragment-copy-button.success {
+    border-color: rgb(14, 168, 14);
+}
+
+@media screen and (max-width: 767px) {
+    .textblock > .doxygen-awesome-fragment-wrapper > doxygen-awesome-fragment-copy-button,
+    .textblock li > .doxygen-awesome-fragment-wrapper > doxygen-awesome-fragment-copy-button,
+    .memdoc li > .doxygen-awesome-fragment-wrapper > doxygen-awesome-fragment-copy-button,
+    .memdoc > .doxygen-awesome-fragment-wrapper > doxygen-awesome-fragment-copy-button,
+    dl dd > .doxygen-awesome-fragment-wrapper > doxygen-awesome-fragment-copy-button {
+        right: 0;
+    }
+}
+
+/*
+ Optional paragraph link button
+*/
+
+a.anchorlink {
+    font-size: 90%;
+    margin-left: var(--spacing-small);
+    color: var(--page-foreground-color) !important;
+    text-decoration: none;
+    opacity: .15;
+    display: none;
+    transition: opacity var(--animation-duration) ease-in-out, color var(--animation-duration) ease-in-out;
+}
+
+a.anchorlink svg {
+    fill: var(--page-foreground-color);
+}
+
+h3 a.anchorlink svg, h4 a.anchorlink svg {
+    margin-bottom: -3px;
+    margin-top: -4px;
+}
+
+a.anchorlink:hover {
+    opacity: .45;
+}
+
+h2:hover a.anchorlink, h1:hover a.anchorlink, h3:hover a.anchorlink, h4:hover a.anchorlink  {
+    display: inline-block;
+}
+
+/*
+ Optional tab feature
+*/
+
+.tabbed > ul {
+    padding-inline-start: 0px;
+    margin: 0;
+    padding: var(--spacing-small) 0;
+}
+
+.tabbed > ul > li {
+    display: none;
+}
+
+.tabbed > ul > li.selected {
+    display: block;
+}
+
+.tabs-overview-container {
+    overflow-x: auto;
+    display: block;
+    overflow-y: visible;
+}
+
+.tabs-overview {
+    border-bottom: 1px solid var(--separator-color);
+    display: flex;
+    flex-direction: row;
+}
+
+@media screen and (max-width: 767px) {
+    .tabs-overview-container {
+        margin: 0 calc(0px - var(--spacing-large));
+    }
+    .tabs-overview {
+        padding: 0 var(--spacing-large)
+    }
+}
+
+.tabs-overview button.tab-button {
+    color: var(--page-foreground-color);
+    margin: 0;
+    border: none;
+    background: transparent;
+    padding: calc(var(--spacing-large) / 2) 0;
+    display: inline-block;
+    font-size: var(--page-font-size);
+    cursor: pointer;
+    box-shadow: 0 1px 0 0 var(--separator-color);
+    position: relative;
+    
+    -webkit-tap-highlight-color: transparent;
+}
+
+.tabs-overview button.tab-button .tab-title::before {
+    display: block;
+    content: attr(title);
+    font-weight: 600;
+    height: 0;
+    overflow: hidden;
+    visibility: hidden;
+}
+
+.tabs-overview button.tab-button .tab-title {
+    float: left;
+    white-space: nowrap;
+    font-weight: normal;
+    padding: calc(var(--spacing-large) / 2) var(--spacing-large);
+    border-radius: var(--border-radius-medium);
+    transition: background-color var(--animation-duration) ease-in-out, font-weight var(--animation-duration) ease-in-out;
+}
+
+.tabs-overview button.tab-button:not(:last-child) .tab-title {
+    box-shadow: 8px 0 0 -7px var(--separator-color);
+}
+
+.tabs-overview button.tab-button:hover .tab-title {
+    background: var(--separator-color);
+    box-shadow: none;
+}
+
+.tabs-overview button.tab-button.active .tab-title {
+    font-weight: 600;
+}
+
+.tabs-overview button.tab-button::after {
+    content: '';
+    display: block;
+    position: absolute;
+    left: 0;
+    bottom: 0;
+    right: 0;
+    height: 0;
+    width: 0%;
+    margin: 0 auto;
+    border-radius: var(--border-radius-small) var(--border-radius-small) 0 0;
+    background-color: var(--primary-color);
+    transition: width var(--animation-duration) ease-in-out, height var(--animation-duration) ease-in-out;
+}
+
+.tabs-overview button.tab-button.active::after {
+    width: 100%;
+    box-sizing: border-box;
+    height: 3px;
+}
+
+
+/*
+ Navigation Buttons
+*/
+
+.section_buttons:not(:empty) {
+    margin-top: calc(var(--spacing-large) * 3);
+}
+
+.section_buttons table.markdownTable {
+    display: block;
+    width: 100%;
+}
+
+.section_buttons table.markdownTable tbody {
+    display: table !important;
+    width: 100%;
+    box-shadow: none;
+    border-spacing: 10px;
+}
+
+.section_buttons table.markdownTable td {
+    padding: 0;
+}
+
+.section_buttons table.markdownTable th {
+    display: none;
+}
+
+.section_buttons table.markdownTable tr.markdownTableHead {
+    border: none;
+}
+
+.section_buttons tr th, .section_buttons tr td {
+    background: none;
+    border: none;
+    padding: var(--spacing-large) 0 var(--spacing-small);
+}
+
+.section_buttons a {
+    display: inline-block;
+    border: 1px solid var(--separator-color);
+    border-radius: var(--border-radius-medium);
+    color: var(--page-secondary-foreground-color) !important;
+    text-decoration: none;
+    transition: color var(--animation-duration) ease-in-out, background-color var(--animation-duration) ease-in-out;
+}
+
+.section_buttons a:hover {
+    color: var(--page-foreground-color) !important;
+    background-color: var(--odd-color);
+}
+
+.section_buttons tr td.markdownTableBodyLeft a {
+    padding: var(--spacing-medium) var(--spacing-large) var(--spacing-medium) calc(var(--spacing-large) / 2);
+}
+
+.section_buttons tr td.markdownTableBodyRight a {
+    padding: var(--spacing-medium) calc(var(--spacing-large) / 2) var(--spacing-medium) var(--spacing-large);
+}
+
+.section_buttons tr td.markdownTableBodyLeft a::before,
+.section_buttons tr td.markdownTableBodyRight a::after {
+    color: var(--page-secondary-foreground-color) !important;
+    display: inline-block;
+    transition: color .08s ease-in-out, transform .09s ease-in-out;
+}
+
+.section_buttons tr td.markdownTableBodyLeft a::before {
+    content: '〈';
+    padding-right: var(--spacing-large);
+}
+
+
+.section_buttons tr td.markdownTableBodyRight a::after {
+    content: '〉';
+    padding-left: var(--spacing-large);
+}
+
+
+.section_buttons tr td.markdownTableBodyLeft a:hover::before {
+    color: var(--page-foreground-color) !important;
+    transform: translateX(-3px);
+}
+
+.section_buttons tr td.markdownTableBodyRight a:hover::after {
+    color: var(--page-foreground-color) !important;
+    transform: translateX(3px);
+}
+
+@media screen and (max-width: 450px) {
+    .section_buttons a {
+        width: 100%;
+        box-sizing: border-box;
+    }
+
+    .section_buttons tr td:nth-of-type(1).markdownTableBodyLeft a {
+        border-radius: var(--border-radius-medium) 0 0 var(--border-radius-medium);
+        border-right: none;
+    }
+
+    .section_buttons tr td:nth-of-type(2).markdownTableBodyRight a {
+        border-radius: 0 var(--border-radius-medium) var(--border-radius-medium) 0;
+    }
+}
diff --git a/doxygen.css b/doxygen.css
index 574b33357..3653ad2e0 100644
--- a/doxygen.css
+++ b/doxygen.css
@@ -1,409 +1,21 @@
 /* The standard CSS for doxygen 1.12.0*/
 
-html {
-/* page base colors */
---page-background-color: white;
---page-foreground-color: black;
---page-link-color: #3D578C;
---page-visited-link-color: #4665A2;
-
-/* index */
---index-odd-item-bg-color: #F8F9FC;
---index-even-item-bg-color: white;
---index-header-color: black;
---index-separator-color: #A0A0A0;
-
-/* header */
---header-background-color: #F9FAFC;
---header-separator-color: #C4CFE5;
---header-gradient-image: url('nav_h.png');
---group-header-separator-color: #879ECB;
---group-header-color: #354C7B;
---inherit-header-color: gray;
-
---footer-foreground-color: #2A3D61;
---footer-logo-width: 104px;
---citation-label-color: #334975;
---glow-color: cyan;
-
---title-background-color: white;
---title-separator-color: #5373B4;
---directory-separator-color: #9CAFD4;
---separator-color: #4A6AAA;
-
---blockquote-background-color: #F7F8FB;
---blockquote-border-color: #9CAFD4;
-
---scrollbar-thumb-color: #9CAFD4;
---scrollbar-background-color: #F9FAFC;
-
---icon-background-color: #728DC1;
---icon-foreground-color: white;
---icon-doc-image: url('doc.svg');
---icon-folder-open-image: url('folderopen.svg');
---icon-folder-closed-image: url('folderclosed.svg');
-
-/* brief member declaration list */
---memdecl-background-color: #F9FAFC;
---memdecl-separator-color: #DEE4F0;
---memdecl-foreground-color: #555;
---memdecl-template-color: #4665A2;
-
-/* detailed member list */
---memdef-border-color: #A8B8D9;
---memdef-title-background-color: #E2E8F2;
---memdef-title-gradient-image: url('nav_f.png');
---memdef-proto-background-color: #DFE5F1;
---memdef-proto-text-color: #253555;
---memdef-proto-text-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9);
---memdef-doc-background-color: white;
---memdef-param-name-color: #602020;
---memdef-template-color: #4665A2;
-
-/* tables */
---table-cell-border-color: #2D4068;
---table-header-background-color: #374F7F;
---table-header-foreground-color: #FFFFFF;
-
-/* labels */
---label-background-color: #728DC1;
---label-left-top-border-color: #5373B4;
---label-right-bottom-border-color: #C4CFE5;
---label-foreground-color: white;
-
-/** navigation bar/tree/menu */
---nav-background-color: #F9FAFC;
---nav-foreground-color: #364D7C;
---nav-gradient-image: url('tab_b.png');
---nav-gradient-hover-image: url('tab_h.png');
---nav-gradient-active-image: url('tab_a.png');
---nav-gradient-active-image-parent: url("../tab_a.png");
---nav-separator-image: url('tab_s.png');
---nav-breadcrumb-image: url('bc_s.png');
---nav-breadcrumb-border-color: #C2CDE4;
---nav-splitbar-image: url('splitbar.png');
---nav-font-size-level1: 13px;
---nav-font-size-level2: 10px;
---nav-font-size-level3: 9px;
---nav-text-normal-color: #283A5D;
---nav-text-hover-color: white;
---nav-text-active-color: white;
---nav-text-normal-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9);
---nav-text-hover-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0);
---nav-text-active-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0);
---nav-menu-button-color: #364D7C;
---nav-menu-background-color: white;
---nav-menu-foreground-color: #555555;
---nav-menu-toggle-color: rgba(255, 255, 255, 0.5);
---nav-arrow-color: #9CAFD4;
---nav-arrow-selected-color: #9CAFD4;
-
-/* table of contents */
---toc-background-color: #F4F6FA;
---toc-border-color: #D8DFEE;
---toc-header-color: #4665A2;
---toc-down-arrow-image: url("data:image/svg+xml;utf8,<svg xmlns='http://www.w3.org/2000/svg' version='1.1' height='10px' width='5px' fill='grey'><text x='0' y='5' font-size='10'>&%238595;</text></svg>");
-
-/** search field */
---search-background-color: white;
---search-foreground-color: #909090;
---search-magnification-image: url('mag.svg');
---search-magnification-select-image: url('mag_sel.svg');
---search-active-color: black;
---search-filter-background-color: #F9FAFC;
---search-filter-foreground-color: black;
---search-filter-border-color: #90A5CE;
---search-filter-highlight-text-color: white;
---search-filter-highlight-bg-color: #3D578C;
---search-results-foreground-color: #425E97;
---search-results-background-color: #EEF1F7;
---search-results-border-color: black;
---search-box-shadow: inset 0.5px 0.5px 3px 0px #555;
-
-/** code fragments */
---code-keyword-color: #008000;
---code-type-keyword-color: #604020;
---code-flow-keyword-color: #E08000;
---code-comment-color: #800000;
---code-preprocessor-color: #806020;
---code-string-literal-color: #002080;
---code-char-literal-color: #008080;
---code-xml-cdata-color: black;
---code-vhdl-digit-color: #FF00FF;
---code-vhdl-char-color: #000000;
---code-vhdl-keyword-color: #700070;
---code-vhdl-logic-color: #FF0000;
---code-link-color: #4665A2;
---code-external-link-color: #4665A2;
---fragment-foreground-color: black;
---fragment-background-color: #FBFCFD;
---fragment-border-color: #C4CFE5;
---fragment-lineno-border-color: #00FF00;
---fragment-lineno-background-color: #E8E8E8;
---fragment-lineno-foreground-color: black;
---fragment-lineno-link-fg-color: #4665A2;
---fragment-lineno-link-bg-color: #D8D8D8;
---fragment-lineno-link-hover-fg-color: #4665A2;
---fragment-lineno-link-hover-bg-color: #C8C8C8;
---fragment-copy-ok-color: #2EC82E;
---tooltip-foreground-color: black;
---tooltip-background-color: white;
---tooltip-border-color: gray;
---tooltip-doc-color: grey;
---tooltip-declaration-color: #006318;
---tooltip-link-color: #4665A2;
---tooltip-shadow: 1px 1px 7px gray;
---fold-line-color: #808080;
---fold-minus-image: url('minus.svg');
---fold-plus-image: url('plus.svg');
---fold-minus-image-relpath: url('../../minus.svg');
---fold-plus-image-relpath: url('../../plus.svg');
-
-/** font-family */
---font-family-normal: Roboto,sans-serif;
---font-family-monospace: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed;
---font-family-nav: 'Lucida Grande',Geneva,Helvetica,Arial,sans-serif;
---font-family-title: Tahoma,Arial,sans-serif;
---font-family-toc: Verdana,'DejaVu Sans',Geneva,sans-serif;
---font-family-search: Arial,Verdana,sans-serif;
---font-family-icon: Arial,Helvetica;
---font-family-tooltip: Roboto,sans-serif;
-
-/** special sections */
---warning-color-bg: #f8d1cc;
---warning-color-hl: #b61825;
---warning-color-text: #75070f;
---note-color-bg: #faf3d8;
---note-color-hl: #f3a600;
---note-color-text: #5f4204;
---todo-color-bg: #e4f3ff;
---todo-color-hl: #1879C4;
---todo-color-text: #274a5c;
---test-color-bg: #e8e8ff;
---test-color-hl: #3939C4;
---test-color-text: #1a1a5c;
---deprecated-color-bg: #ecf0f3;
---deprecated-color-hl: #5b6269;
---deprecated-color-text: #43454a;
---bug-color-bg: #e4dafd;
---bug-color-hl: #5b2bdd;
---bug-color-text: #2a0d72;
---invariant-color-bg: #d8f1e3;
---invariant-color-hl: #44b86f;
---invariant-color-text: #265532;
-}
-
-@media (prefers-color-scheme: dark) {
-  html:not(.dark-mode) {
-    color-scheme: dark;
-
-/* page base colors */
---page-background-color: black;
---page-foreground-color: #C9D1D9;
---page-link-color: #90A5CE;
---page-visited-link-color: #A3B4D7;
-
-/* index */
---index-odd-item-bg-color: #0B101A;
---index-even-item-bg-color: black;
---index-header-color: #C4CFE5;
---index-separator-color: #334975;
-
-/* header */
---header-background-color: #070B11;
---header-separator-color: #141C2E;
---header-gradient-image: url('nav_hd.png');
---group-header-separator-color: #283A5D;
---group-header-color: #90A5CE;
---inherit-header-color: #A0A0A0;
-
---footer-foreground-color: #5B7AB7;
---footer-logo-width: 60px;
---citation-label-color: #90A5CE;
---glow-color: cyan;
-
---title-background-color: #090D16;
---title-separator-color: #354C79;
---directory-separator-color: #283A5D;
---separator-color: #283A5D;
-
---blockquote-background-color: #101826;
---blockquote-border-color: #283A5D;
-
---scrollbar-thumb-color: #283A5D;
---scrollbar-background-color: #070B11;
-
---icon-background-color: #334975;
---icon-foreground-color: #C4CFE5;
---icon-doc-image: url('docd.svg');
---icon-folder-open-image: url('folderopend.svg');
---icon-folder-closed-image: url('folderclosedd.svg');
-
-/* brief member declaration list */
---memdecl-background-color: #0B101A;
---memdecl-separator-color: #2C3F65;
---memdecl-foreground-color: #BBB;
---memdecl-template-color: #7C95C6;
-
-/* detailed member list */
---memdef-border-color: #233250;
---memdef-title-background-color: #1B2840;
---memdef-title-gradient-image: url('nav_fd.png');
---memdef-proto-background-color: #19243A;
---memdef-proto-text-color: #9DB0D4;
---memdef-proto-text-shadow: 0px 1px 1px rgba(0, 0, 0, 0.9);
---memdef-doc-background-color: black;
---memdef-param-name-color: #D28757;
---memdef-template-color: #7C95C6;
-
-/* tables */
---table-cell-border-color: #283A5D;
---table-header-background-color: #283A5D;
---table-header-foreground-color: #C4CFE5;
-
-/* labels */
---label-background-color: #354C7B;
---label-left-top-border-color: #4665A2;
---label-right-bottom-border-color: #283A5D;
---label-foreground-color: #CCCCCC;
-
-/** navigation bar/tree/menu */
---nav-background-color: #101826;
---nav-foreground-color: #364D7C;
---nav-gradient-image: url('tab_bd.png');
---nav-gradient-hover-image: url('tab_hd.png');
---nav-gradient-active-image: url('tab_ad.png');
---nav-gradient-active-image-parent: url("../tab_ad.png");
---nav-separator-image: url('tab_sd.png');
---nav-breadcrumb-image: url('bc_sd.png');
---nav-breadcrumb-border-color: #2A3D61;
---nav-splitbar-image: url('splitbard.png');
---nav-font-size-level1: 13px;
---nav-font-size-level2: 10px;
---nav-font-size-level3: 9px;
---nav-text-normal-color: #B6C4DF;
---nav-text-hover-color: #DCE2EF;
---nav-text-active-color: #DCE2EF;
---nav-text-normal-shadow: 0px 1px 1px black;
---nav-text-hover-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0);
---nav-text-active-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0);
---nav-menu-button-color: #B6C4DF;
---nav-menu-background-color: #05070C;
---nav-menu-foreground-color: #BBBBBB;
---nav-menu-toggle-color: rgba(255, 255, 255, 0.2);
---nav-arrow-color: #334975;
---nav-arrow-selected-color: #90A5CE;
-
-/* table of contents */
---toc-background-color: #151E30;
---toc-border-color: #202E4A;
---toc-header-color: #A3B4D7;
---toc-down-arrow-image: url("data:image/svg+xml;utf8,<svg xmlns='http://www.w3.org/2000/svg' version='1.1' height='10px' width='5px'><text x='0' y='5' font-size='10' fill='grey'>&%238595;</text></svg>");
-
-/** search field */
---search-background-color: black;
---search-foreground-color: #C5C5C5;
---search-magnification-image: url('mag_d.svg');
---search-magnification-select-image: url('mag_seld.svg');
---search-active-color: #C5C5C5;
---search-filter-background-color: #101826;
---search-filter-foreground-color: #90A5CE;
---search-filter-border-color: #7C95C6;
---search-filter-highlight-text-color: #BCC9E2;
---search-filter-highlight-bg-color: #283A5D;
---search-results-background-color: #101826;
---search-results-foreground-color: #90A5CE;
---search-results-border-color: #7C95C6;
---search-box-shadow: inset 0.5px 0.5px 3px 0px #2F436C;
-
-/** code fragments */
---code-keyword-color: #CC99CD;
---code-type-keyword-color: #AB99CD;
---code-flow-keyword-color: #E08000;
---code-comment-color: #717790;
---code-preprocessor-color: #65CABE;
---code-string-literal-color: #7EC699;
---code-char-literal-color: #00E0F0;
---code-xml-cdata-color: #C9D1D9;
---code-vhdl-digit-color: #FF00FF;
---code-vhdl-char-color: #C0C0C0;
---code-vhdl-keyword-color: #CF53C9;
---code-vhdl-logic-color: #FF0000;
---code-link-color: #79C0FF;
---code-external-link-color: #79C0FF;
---fragment-foreground-color: #C9D1D9;
---fragment-background-color: #090D16;
---fragment-border-color: #30363D;
---fragment-lineno-border-color: #30363D;
---fragment-lineno-background-color: black;
---fragment-lineno-foreground-color: #6E7681;
---fragment-lineno-link-fg-color: #6E7681;
---fragment-lineno-link-bg-color: #303030;
---fragment-lineno-link-hover-fg-color: #8E96A1;
---fragment-lineno-link-hover-bg-color: #505050;
---fragment-copy-ok-color: #0EA80E;
---tooltip-foreground-color: #C9D1D9;
---tooltip-background-color: #202020;
---tooltip-border-color: #C9D1D9;
---tooltip-doc-color: #D9E1E9;
---tooltip-declaration-color: #20C348;
---tooltip-link-color: #79C0FF;
---tooltip-shadow: none;
---fold-line-color: #808080;
---fold-minus-image: url('minusd.svg');
---fold-plus-image: url('plusd.svg');
---fold-minus-image-relpath: url('../../minusd.svg');
---fold-plus-image-relpath: url('../../plusd.svg');
-
-/** font-family */
---font-family-normal: Roboto,sans-serif;
---font-family-monospace: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed;
---font-family-nav: 'Lucida Grande',Geneva,Helvetica,Arial,sans-serif;
---font-family-title: Tahoma,Arial,sans-serif;
---font-family-toc: Verdana,'DejaVu Sans',Geneva,sans-serif;
---font-family-search: Arial,Verdana,sans-serif;
---font-family-icon: Arial,Helvetica;
---font-family-tooltip: Roboto,sans-serif;
-
-/** special sections */
---warning-color-bg: #2e1917;
---warning-color-hl: #ad2617;
---warning-color-text: #f5b1aa;
---note-color-bg: #3b2e04;
---note-color-hl: #f1b602;
---note-color-text: #ceb670;
---todo-color-bg: #163750;
---todo-color-hl: #1982D2;
---todo-color-text: #dcf0fa;
---test-color-bg: #121258;
---test-color-hl: #4242cf;
---test-color-text: #c0c0da;
---deprecated-color-bg: #2e323b;
---deprecated-color-hl: #738396;
---deprecated-color-text: #abb0bd;
---bug-color-bg: #2a2536;
---bug-color-hl: #7661b3;
---bug-color-text: #ae9ed6;
---invariant-color-bg: #303a35;
---invariant-color-hl: #76ce96;
---invariant-color-text: #cceed5;
-}}
 body {
-    background-color: var(--page-background-color);
-    color: var(--page-foreground-color);
+    background-color: white;
+    color: black;
 }
 
 body, table, div, p, dl {
 	font-weight: 400;
 	font-size: 14px;
-	font-family: var(--font-family-normal);
+	font-family: Roboto,sans-serif;
 	line-height: 22px;
 }
 
 /* @group Heading Levels */
 
 .title {
-	font-family: var(--font-family-normal);
+	font-family: Roboto,sans-serif;
 	line-height: 28px;
 	font-size: 150%;
 	font-weight: bold;
@@ -415,8 +27,8 @@ h1.groupheader {
 }
 
 h2.groupheader {
-	border-bottom: 1px solid var(--group-header-separator-color);
-	color: var(--group-header-color);
+	border-bottom: 1px solid #879ECB;
+	color: #354C7B;
 	font-size: 150%;
 	font-weight: normal;
 	margin-top: 1.75em;
@@ -439,7 +51,7 @@ h1, h2, h3, h4, h5, h6 {
 }
 
 h1.glow, h2.glow, h3.glow, h4.glow, h5.glow, h6.glow {
-	text-shadow: 0 0 15px var(--glow-color);
+	text-shadow: 0 0 15px cyan;
 }
 
 dt {
@@ -512,15 +124,15 @@ td.navtab {
 }
 
 td.navtabHL {
-	background-image: var(--nav-gradient-active-image);
+	background-image: url('tab_a.png');
 	background-repeat:repeat-x;
 	padding-right: 6px;
 	padding-left: 6px;
 }
 
 td.navtabHL a, td.navtabHL a:visited {
-	color: var(--nav-text-hover-color);
-	text-shadow: var(--nav-text-hover-shadow);
+	color: white;
+	text-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0);
 }
 
 a.navtab {
@@ -532,7 +144,7 @@ div.qindex{
 	width: 100%;
 	line-height: 140%;
 	font-size: 130%;
-	color: var(--index-separator-color);
+	color: #A0A0A0;
 }
 
 #main-menu a:focus {
@@ -547,7 +159,7 @@ dt.alphachar{
 }
 
 .alphachar a{
-	color: var(--index-header-color);
+	color: black;
 }
 
 .alphachar a:hover, .alphachar a:visited{
@@ -567,11 +179,11 @@ dt.alphachar{
 }
 
 .classindex dl.even {
-	background-color: var(--index-even-item-bg-color);
+	background-color: white;
 }
 
 .classindex dl.odd {
-	background-color: var(--index-odd-item-bg-color);
+	background-color: #F8F9FC;
 }
 
 @media(min-width: 1120px) {
@@ -590,13 +202,13 @@ dt.alphachar{
 /* @group Link Styling */
 
 a {
-	color: var(--page-link-color);
+	color: #3D578C;
 	font-weight: normal;
 	text-decoration: none;
 }
 
 .contents a:visited {
-	color: var(--page-visited-link-color);
+	color: #4665A2;
 }
 
 a:hover {
@@ -606,7 +218,7 @@ a:hover {
 
 a:hover > span.arrow {
         text-decoration: none;
-        background : var(--nav-background-color);
+        background : #F9FAFC;
 }
 
 a.el {
@@ -617,11 +229,11 @@ a.elRef {
 }
 
 a.code, a.code:visited, a.line, a.line:visited {
-	color: var(--code-link-color);
+	color: #4665A2;
 }
 
 a.codeRef, a.codeRef:visited, a.lineRef, a.lineRef:visited {
-	color: var(--code-external-link-color);
+	color: #4665A2;
 }
 
 a.code.hl_class { /* style for links to class names in code snippets */ }
@@ -705,17 +317,17 @@ ul.multicol {
   min-height: 12px;
   margin: 10px 0px;
   padding: 10px 10px;
-  border: 1px solid var(--fragment-border-color);
+  border: 1px solid #C4CFE5;
   border-radius: 4px;
-  background-color: var(--fragment-background-color);
-  color: var(--fragment-foreground-color);
+  background-color: #FBFCFD;
+  color: black;
 }
 
 pre.fragment {
   word-wrap: break-word;
   font-size:  10pt;
   line-height: 125%;
-  font-family: var(--font-family-monospace);
+  font-family: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed;
 }
 
 .clipboard {
@@ -727,14 +339,14 @@ pre.fragment {
         position: absolute;
         display: inline;
         overflow: auto;
-        fill: var(--fragment-foreground-color);
+        fill: black;
         justify-content: center;
         align-items: center;
         cursor: pointer;
 }
 
 .clipboard.success {
-        border: 1px solid var(--fragment-foreground-color);
+        border: 1px solid black;
         border-radius: 4px;
 }
 
@@ -751,15 +363,15 @@ pre.fragment {
 }
 
 .clipboard.success svg {
-        fill: var(--fragment-copy-ok-color);
+        fill: #2EC82E;
 }
 
 .clipboard.success {
-        border-color: var(--fragment-copy-ok-color);
+        border-color: #2EC82E;
 }
 
 div.line {
-	font-family: var(--font-family-monospace);
+	font-family: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed;
         font-size: 13px;
 	min-height: 13px;
 	line-height: 1.2;
@@ -791,8 +403,8 @@ div.line:after {
 }
 
 div.line.glow {
-	background-color: var(--glow-color);
-	box-shadow: 0 0 10px var(--glow-color);
+	background-color: cyan;
+	box-shadow: 0 0 10px cyan;
 }
 
 span.fold {
@@ -812,19 +424,19 @@ span.lineno {
 	padding-right: 4px;
         margin-right: 9px;
 	text-align: right;
-	border-right: 2px solid var(--fragment-lineno-border-color);
-	color: var(--fragment-lineno-foreground-color);
-	background-color: var(--fragment-lineno-background-color);
+	border-right: 2px solid #00FF00;
+	color: black;
+	background-color: #E8E8E8;
         white-space: pre;
 }
 span.lineno a, span.lineno a:visited {
-	color: var(--fragment-lineno-link-fg-color);
-	background-color: var(--fragment-lineno-link-bg-color);
+	color: #4665A2;
+	background-color: #D8D8D8;
 }
 
 span.lineno a:hover {
-	color: var(--fragment-lineno-link-hover-fg-color);
-	background-color: var(--fragment-lineno-link-hover-bg-color);
+	color: #4665A2;
+	background-color: #C8C8C8;
 }
 
 .lineno {
@@ -857,7 +469,7 @@ div.groupText {
 }
 
 body {
-	color: var(--page-foreground-color);
+	color: black;
         margin: 0;
 }
 
@@ -901,11 +513,11 @@ address.footer {
 img.footer {
 	border: 0px;
 	vertical-align: middle;
-	width: var(--footer-logo-width);
+	width: 104px;
 }
 
 .compoundTemplParams {
-	color: var(--memdecl-template-color);
+	color: #4665A2;
 	font-size: 80%;
 	line-height: 120%;
 }
@@ -913,56 +525,56 @@ img.footer {
 /* @group Code Colorization */
 
 span.keyword {
-	color: var(--code-keyword-color);
+	color: #008000;
 }
 
 span.keywordtype {
-	color: var(--code-type-keyword-color);
+	color: #604020;
 }
 
 span.keywordflow {
-	color: var(--code-flow-keyword-color);
+	color: #E08000;
 }
 
 span.comment {
-	color: var(--code-comment-color);
+	color: #800000;
 }
 
 span.preprocessor {
-	color: var(--code-preprocessor-color);
+	color: #806020;
 }
 
 span.stringliteral {
-	color: var(--code-string-literal-color);
+	color: #002080;
 }
 
 span.charliteral {
-	color: var(--code-char-literal-color);
+	color: #008080;
 }
 
 span.xmlcdata {
-	color: var(--code-xml-cdata-color);
+	color: black;
 }
 
 span.vhdldigit { 
-	color: var(--code-vhdl-digit-color);
+	color: #FF00FF;
 }
 
 span.vhdlchar { 
-	color: var(--code-vhdl-char-color);
+	color: #000000;
 }
 
 span.vhdlkeyword { 
-	color: var(--code-vhdl-keyword-color);
+	color: #700070;
 }
 
 span.vhdllogic { 
-	color: var(--code-vhdl-logic-color);
+	color: #FF0000;
 }
 
 blockquote {
-        background-color: var(--blockquote-background-color);
-        border-left: 2px solid var(--blockquote-border-color);
+        background-color: #F7F8FB;
+        border-left: 2px solid #9CAFD4;
         margin: 0 24px 0 4px;
         padding: 0 12px 0 16px;
 }
@@ -976,19 +588,19 @@ td.tiny {
 .dirtab {
 	padding: 4px;
 	border-collapse: collapse;
-	border: 1px solid var(--table-cell-border-color);
+	border: 1px solid #2D4068;
 }
 
 th.dirtab {
-	background-color: var(--table-header-background-color);
-	color: var(--table-header-foreground-color);
+	background-color: #374F7F;
+	color: #FFFFFF;
 	font-weight: bold;
 }
 
 hr {
 	height: 0px;
 	border: none;
-	border-top: 1px solid var(--separator-color);
+	border-top: 1px solid #4A6AAA;
 }
 
 hr.footer {
@@ -1016,14 +628,14 @@ table.memberdecls {
 }
 
 .memberdecls td.glow, .fieldtable tr.glow {
-	background-color: var(--glow-color);
-	box-shadow: 0 0 15px var(--glow-color);
+	background-color: cyan;
+	box-shadow: 0 0 15px cyan;
 }
 
 .mdescLeft, .mdescRight,
 .memItemLeft, .memItemRight,
 .memTemplItemLeft, .memTemplItemRight, .memTemplParams {
-	background-color: var(--memdecl-background-color);
+	background-color: #F9FAFC;
 	border: none;
 	margin: 4px;
 	padding: 1px 0 0 8px;
@@ -1031,11 +643,11 @@ table.memberdecls {
 
 .mdescLeft, .mdescRight {
 	padding: 0px 8px 4px 8px;
-	color: var(--memdecl-foreground-color);
+	color: #555;
 }
 
 .memSeparator {
-        border-bottom: 1px solid var(--memdecl-separator-color);
+        border-bottom: 1px solid #DEE4F0;
         line-height: 1px;
         margin: 0px;
         padding: 0px;
@@ -1050,7 +662,7 @@ table.memberdecls {
 }
 
 .memTemplParams {
-	color: var(--memdecl-template-color);
+	color: #4665A2;
         white-space: nowrap;
 	font-size: 80%;
 }
@@ -1063,15 +675,15 @@ table.memberdecls {
 
 .memtitle {
 	padding: 8px;
-	border-top: 1px solid var(--memdef-border-color);
-	border-left: 1px solid var(--memdef-border-color);
-	border-right: 1px solid var(--memdef-border-color);
+	border-top: 1px solid #A8B8D9;
+	border-left: 1px solid #A8B8D9;
+	border-right: 1px solid #A8B8D9;
 	border-top-right-radius: 4px;
 	border-top-left-radius: 4px;
 	margin-bottom: -1px;
-	background-image: var(--memdef-title-gradient-image);
+	background-image: url('nav_f.png');
 	background-repeat: repeat-x;
-	background-color: var(--memdef-title-background-color);
+	background-color: #E2E8F2;
 	line-height: 1.25;
 	font-weight: 300;
 	float:left;
@@ -1086,7 +698,7 @@ table.memberdecls {
 
 .memtemplate {
 	font-size: 80%;
-	color: var(--memdef-template-color);
+	color: #4665A2;
 	font-weight: normal;
 	margin-left: 9px;
 }
@@ -1109,7 +721,7 @@ table.memberdecls {
 }
 
 .memitem.glow {
-         box-shadow: 0 0 15px var(--glow-color);
+         box-shadow: 0 0 15px cyan;
 }
 
 .memname {
@@ -1122,32 +734,32 @@ table.memberdecls {
 }
 
 .memproto, dl.reflist dt {
-        border-top: 1px solid var(--memdef-border-color);
-        border-left: 1px solid var(--memdef-border-color);
-        border-right: 1px solid var(--memdef-border-color);
+        border-top: 1px solid #A8B8D9;
+        border-left: 1px solid #A8B8D9;
+        border-right: 1px solid #A8B8D9;
         padding: 6px 0px 6px 0px;
-        color: var(--memdef-proto-text-color);
+        color: #253555;
         font-weight: bold;
-        text-shadow: var(--memdef-proto-text-shadow);
-        background-color: var(--memdef-proto-background-color);
+        text-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9);
+        background-color: #DFE5F1;
         box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15);
         border-top-right-radius: 4px;
 }
 
 .overload {
-        font-family: var(--font-family-monospace);
+        font-family: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed;
 	font-size: 65%;
 }
 
 .memdoc, dl.reflist dd {
-        border-bottom: 1px solid var(--memdef-border-color);
-        border-left: 1px solid var(--memdef-border-color);
-        border-right: 1px solid var(--memdef-border-color);
+        border-bottom: 1px solid #A8B8D9;
+        border-left: 1px solid #A8B8D9;
+        border-right: 1px solid #A8B8D9;
         padding: 6px 10px 2px 10px;
         border-top-width: 0;
         background-image:url('nav_g.png');
         background-repeat:repeat-x;
-        background-color: var(--memdef-doc-background-color);
+        background-color: white;
         /* opera specific markup */
         border-bottom-left-radius: 4px;
         border-bottom-right-radius: 4px;
@@ -1189,13 +801,13 @@ dl.reflist dd {
 }
 
 .paramname em {
-	color: var(--memdef-param-name-color);
+	color: #602020;
 	font-style: normal;
 	margin-right: 1px;
 }
 
 .paramname .paramdefval {
-	font-family: var(--font-family-monospace);
+	font-family: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed;
 }
 
 .params, .retval, .exception, .tparams {
@@ -1214,7 +826,7 @@ dl.reflist dd {
 }
 
 .params .paramdir, .tparams .paramdir {
-        font-family: var(--font-family-monospace);
+        font-family: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed;
         vertical-align: top;
 }
 
@@ -1238,13 +850,13 @@ span.mlabels {
 }
 
 span.mlabel {
-        background-color: var(--label-background-color);
-        border-top:1px solid var(--label-left-top-border-color);
-        border-left:1px solid var(--label-left-top-border-color);
-        border-right:1px solid var(--label-right-bottom-border-color);
-        border-bottom:1px solid var(--label-right-bottom-border-color);
+        background-color: #728DC1;
+        border-top:1px solid #5373B4;
+        border-left:1px solid #5373B4;
+        border-right:1px solid #C4CFE5;
+        border-bottom:1px solid #C4CFE5;
 	text-shadow: none;
-	color: var(--label-foreground-color);
+	color: white;
 	margin-right: 4px;
 	padding: 2px 3px;
 	border-radius: 3px;
@@ -1261,8 +873,8 @@ span.mlabel {
 
 div.directory {
         margin: 10px 0px;
-        border-top: 1px solid var(--directory-separator-color);
-        border-bottom: 1px solid var(--directory-separator-color);
+        border-top: 1px solid #9CAFD4;
+        border-bottom: 1px solid #9CAFD4;
         width: 100%;
 }
 
@@ -1300,12 +912,12 @@ div.directory {
 
 .directory tr.odd {
 	padding-left: 6px;
-	background-color: var(--index-odd-item-bg-color);
+	background-color: #F8F9FC;
 }
 
 .directory tr.even {
 	padding-left: 6px;
-	background-color: var(--index-even-item-bg-color);
+	background-color: white;
 }
 
 .directory img {
@@ -1323,11 +935,11 @@ div.directory {
         cursor: pointer;
         padding-left: 2px;
         padding-right: 2px;
-	color: var(--page-link-color);
+	color: #3D578C;
 }
 
 .arrow {
-    color: var(--nav-arrow-color);
+    color: #9CAFD4;
     -webkit-user-select: none;
     -khtml-user-select: none;
     -moz-user-select: none;
@@ -1341,15 +953,15 @@ div.directory {
 }
 
 .icon {
-    font-family: var(--font-family-icon);
+    font-family: Arial,Helvetica;
     line-height: normal;
     font-weight: bold;
     font-size: 12px;
     height: 14px;
     width: 16px;
     display: inline-block;
-    background-color: var(--icon-background-color);
-    color: var(--icon-foreground-color);
+    background-color: #728DC1;
+    color: white;
     text-align: center;
     border-radius: 4px;
     margin-left: 2px;
@@ -1366,7 +978,7 @@ div.directory {
     width: 24px;
     height: 18px;
     margin-bottom: 4px;
-    background-image:var(--icon-folder-open-image);
+    background-image:url('folderopen.svg');
     background-repeat: repeat-y;
     vertical-align:top;
     display: inline-block;
@@ -1376,7 +988,7 @@ div.directory {
     width: 24px;
     height: 18px;
     margin-bottom: 4px;
-    background-image:var(--icon-folder-closed-image);
+    background-image:url('folderclosed.svg');
     background-repeat: repeat-y;
     vertical-align:top;
     display: inline-block;
@@ -1386,7 +998,7 @@ div.directory {
     width: 24px;
     height: 18px;
     margin-bottom: 4px;
-    background-image:var(--icon-doc-image);
+    background-image:url('doc.svg');
     background-position: 0px -4px;
     background-repeat: repeat-y;
     vertical-align:top;
@@ -1407,7 +1019,7 @@ div.dynheader {
 
 address {
 	font-style: normal;
-	color: var(--footer-foreground-color);
+	color: #2A3D61;
 }
 
 table.doxtable caption {
@@ -1421,13 +1033,13 @@ table.doxtable {
 }
 
 table.doxtable td, table.doxtable th {
-	border: 1px solid var(--table-cell-border-color);
+	border: 1px solid #2D4068;
 	padding: 3px 7px 2px;
 }
 
 table.doxtable th {
-	background-color: var(--table-header-background-color);
-	color: var(--table-header-foreground-color);
+	background-color: #374F7F;
+	color: #FFFFFF;
 	font-size: 110%;
 	padding-bottom: 4px;
 	padding-top: 5px;
@@ -1435,7 +1047,7 @@ table.doxtable th {
 
 table.fieldtable {
         margin-bottom: 10px;
-        border: 1px solid var(--memdef-border-color);
+        border: 1px solid #A8B8D9;
         border-spacing: 0px;
         border-radius: 4px;
         box-shadow: 2px 2px 2px rgba(0, 0, 0, 0.15);
@@ -1447,8 +1059,8 @@ table.fieldtable {
 
 .fieldtable td.fieldtype, .fieldtable td.fieldname, .fieldtable td.fieldinit {
         white-space: nowrap;
-        border-right: 1px solid var(--memdef-border-color);
-        border-bottom: 1px solid var(--memdef-border-color);
+        border-right: 1px solid #A8B8D9;
+        border-bottom: 1px solid #A8B8D9;
         vertical-align: top;
 }
 
@@ -1463,7 +1075,7 @@ table.fieldtable {
 
 
 .fieldtable td.fielddoc {
-        border-bottom: 1px solid var(--memdef-border-color);
+        border-bottom: 1px solid #A8B8D9;
 }
 
 .fieldtable td.fielddoc p:first-child {
@@ -1479,18 +1091,18 @@ table.fieldtable {
 }
 
 .fieldtable th {
-        background-image: var(--memdef-title-gradient-image);
+        background-image: url('nav_f.png');
         background-repeat:repeat-x;
-        background-color: var(--memdef-title-background-color);
+        background-color: #E2E8F2;
         font-size: 90%;
-        color: var(--memdef-proto-text-color);
+        color: #253555;
         padding-bottom: 4px;
         padding-top: 5px;
         text-align:left;
         font-weight: 400;
         border-top-left-radius: 4px;
         border-top-right-radius: 4px;
-        border-bottom: 1px solid var(--memdef-border-color);
+        border-bottom: 1px solid #A8B8D9;
 }
 
 
@@ -1498,7 +1110,7 @@ table.fieldtable {
 	top: 0px;
 	left: 10px;
 	height: 36px;
-	background-image: var(--nav-gradient-image);
+	background-image: url('tab_b.png');
 	z-index: 101;
 	overflow: hidden;
 	font-size: 13px;
@@ -1507,13 +1119,13 @@ table.fieldtable {
 .navpath ul
 {
 	font-size: 11px;
-	background-image: var(--nav-gradient-image);
+	background-image: url('tab_b.png');
 	background-repeat:repeat-x;
 	background-position: 0 -5px;
 	height:30px;
 	line-height:30px;
-	color:var(--nav-text-normal-color);
-	border:solid 1px var(--nav-breadcrumb-border-color);
+	color:#283A5D;
+	border:solid 1px #C2CDE4;
 	overflow:hidden;
 	margin:0px;
 	padding:0px;
@@ -1525,10 +1137,10 @@ table.fieldtable {
 	float:left;
 	padding-left:10px;
 	padding-right:15px;
-	background-image:var(--nav-breadcrumb-image);
+	background-image:url('bc_s.png');
 	background-repeat:no-repeat;
 	background-position:right;
-	color: var(--nav-foreground-color);
+	color: #364D7C;
 }
 
 .navpath li.navelem a
@@ -1536,16 +1148,16 @@ table.fieldtable {
 	height:32px;
 	display:block;
 	outline: none;
-	color: var(--nav-text-normal-color);
-	font-family: var(--font-family-nav);
-	text-shadow: var(--nav-text-normal-shadow);
+	color: #283A5D;
+	font-family: 'Lucida Grande',Geneva,Helvetica,Arial,sans-serif;
+	text-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9);
 	text-decoration: none;
 }
 
 .navpath li.navelem a:hover
 {
-	color: var(--nav-text-hover-color);
-	text-shadow: var(--nav-text-hover-shadow);
+	color: white;
+	text-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0);
 }
 
 .navpath li.footer
@@ -1557,7 +1169,7 @@ table.fieldtable {
         background-image:none;
         background-repeat:no-repeat;
         background-position:right;
-        color: var(--footer-foreground-color);
+        color: #2A3D61;
         font-size: 8pt;
 }
 
@@ -1602,11 +1214,11 @@ div.ingroups a
 
 div.header
 {
-        background-image: var(--header-gradient-image);
+        background-image: url('nav_h.png');
         background-repeat:repeat-x;
-	background-color: var(--header-background-color);
+	background-color: #F9FAFC;
 	margin:  0px;
-	border-bottom: 1px solid var(--header-separator-color);
+	border-bottom: 1px solid #C4CFE5;
 }
 
 div.headertitle
@@ -1699,67 +1311,67 @@ dl.section dd {
 }
 
 dl.warning, dl.attention, dl.important {
-    background: var(--warning-color-bg);
-    border-left: 8px solid var(--warning-color-hl);
-    color: var(--warning-color-text);
+    background: #f8d1cc;
+    border-left: 8px solid #b61825;
+    color: #75070f;
 }
 
 dl.warning dt, dl.attention dt, dl.important dt {
-    color: var(--warning-color-hl);
+    color: #b61825;
 }
 
 dl.note, dl.remark {
-    background: var(--note-color-bg);
-    border-left: 8px solid var(--note-color-hl);
-    color: var(--note-color-text);
+    background: #faf3d8;
+    border-left: 8px solid #f3a600;
+    color: #5f4204;
 }
 
 dl.note dt, dl.remark dt {
-    color: var(--note-color-hl);
+    color: #f3a600;
 }
 
 dl.todo {
-    background: var(--todo-color-bg);
-    border-left: 8px solid var(--todo-color-hl);
-    color: var(--todo-color-text);
+    background: #e4f3ff;
+    border-left: 8px solid #1879C4;
+    color: #274a5c;
 }
 
 dl.todo dt {
-    color: var(--todo-color-hl);
+    color: #1879C4;
 }
 
 dl.test {
-    background: var(--test-color-bg);
-    border-left: 8px solid var(--test-color-hl);
-    color: var(--test-color-text);
+    background: #e8e8ff;
+    border-left: 8px solid #3939C4;
+    color: #1a1a5c;
 }
 
 dl.test dt {
-    color: var(--test-color-hl);
+    color: #3939C4;
 }
 
 dl.bug dt a {
-    color: var(--bug-color-hl) !important;
+    color: #5b2bdd !important;
 }
 
 dl.bug {
-    background: var(--bug-color-bg);
-    border-left: 8px solid var(--bug-color-hl);
-    color: var(--bug-color-text);
+    background: #e4dafd;
+    border-left: 8px solid #5b2bdd;
+    color: #2a0d72;
 }
 
 dl.bug dt a {
-    color: var(--bug-color-hl) !important;
+    color: #5b2bdd !important;
 }
 
 dl.deprecated {
-    background: var(--deprecated-color-bg);
-    border-left: 8px solid var(--deprecated-color-hl);
-    color: var(--deprecated-color-text);
+    background: #ecf0f3;
+    border-left: 8px solid #5b6269;
+    color: #43454a;
 }
 
 dl.deprecated dt a {
-    color: var(--deprecated-color-hl) !important;
+    color: #5b6269 !important;
 }
 
 dl.note dd, dl.warning dd, dl.pre dd, dl.post dd,
@@ -1769,13 +1381,13 @@ dl.bug dd, dl.deprecated dd, dl.todo dd, dl.test dd {
 }
 
 dl.invariant, dl.pre, dl.post {
-    background: var(--invariant-color-bg);
-    border-left: 8px solid var(--invariant-color-hl);
-    color: var(--invariant-color-text);
+    background: #d8f1e3;
+    border-left: 8px solid #44b86f;
+    color: #265532;
 }
 
 dl.invariant dt, dl.pre dt, dl.post dt {
-    color: var(--invariant-color-hl);
+    color: #44b86f;
 }
 
 
@@ -1805,7 +1417,7 @@ dl.invariant dt, dl.pre dt, dl.post dt {
 #projectname
 {
 	font-size: 200%;
-	font-family: var(--font-family-title);
+	font-family: Tahoma,Arial,sans-serif;
 	margin: 0px;
 	padding: 2px 0px;
 }
@@ -1813,7 +1425,7 @@ dl.invariant dt, dl.pre dt, dl.post dt {
 #projectbrief
 {
 	font-size: 90%;
-        font-family: var(--font-family-title);
+        font-family: Tahoma,Arial,sans-serif;
 	margin: 0px;
 	padding: 0px;
 }
@@ -1821,7 +1433,7 @@ dl.invariant dt, dl.pre dt, dl.post dt {
 #projectnumber
 {
 	font-size: 50%;
-	font-family: 50% var(--font-family-title);
+	font-family: 50% Tahoma,Arial,sans-serif;
 	margin: 0px;
 	padding: 0px;
 }
@@ -1831,8 +1443,8 @@ dl.invariant dt, dl.pre dt, dl.post dt {
 	padding: 0px;
 	margin: 0px;
 	width: 100%;
-	border-bottom: 1px solid var(--title-separator-color);
-	background-color: var(--title-background-color);
+	border-bottom: 1px solid #5373B4;
+	background-color: white;
 }
 
 .image
@@ -1870,7 +1482,7 @@ dl.citelist {
 }
 
 dl.citelist dt {
-        color:var(--citation-label-color);
+        color:#334975;
         float:left;
         font-weight:bold;
         margin-right:10px;
@@ -1886,8 +1498,8 @@ dl.citelist dd {
 
 div.toc {
         padding: 14px 25px;
-        background-color: var(--toc-background-color);
-        border: 1px solid var(--toc-border-color);
+        background-color: #F4F6FA;
+        border: 1px solid #D8DFEE;
         border-radius: 7px 7px 7px 7px;
         float: right;
         height: auto;
@@ -1896,16 +1508,16 @@ div.toc {
 }
 
 div.toc li {
-        background: var(--toc-down-arrow-image) no-repeat scroll 0 5px transparent;
-        font: 10px/1.2 var(--font-family-toc);
+        background: url("data:image/svg+xml;utf8,<svg xmlns='http://www.w3.org/2000/svg' version='1.1' height='10px' width='5px' fill='grey'><text x='0' y='5' font-size='10'>&%238595;</text></svg>") no-repeat scroll 0 5px transparent;
+        font: 10px/1.2 Verdana,'DejaVu Sans',Geneva,sans-serif;
         margin-top: 5px;
         padding-left: 10px;
         padding-top: 2px;
 }
 
 div.toc h3 {
-        font: bold 12px/1.2 var(--font-family-toc);
-	color: var(--toc-header-color);
+        font: bold 12px/1.2 Verdana,'DejaVu Sans',Geneva,sans-serif;
+	color: #4665A2;
         border-bottom: 0 none;
         margin: 0;
 }
@@ -1941,7 +1553,7 @@ span.obfuscator {
 
 .inherit_header {
         font-weight: bold;
-        color: var(--inherit-header-color);
+        color: gray;
         cursor: pointer;
 	-webkit-touch-callout: none;
 	-webkit-user-select: none;
@@ -1974,11 +1586,11 @@ tr.heading h2 {
 #powerTip {
 	cursor: default;
 	/*white-space: nowrap;*/
-        color: var(--tooltip-foreground-color);
-	background-color: var(--tooltip-background-color);
-	border: 1px solid var(--tooltip-border-color);
+        color: black;
+	background-color: white;
+	border: 1px solid gray;
 	border-radius: 4px 4px 4px 4px;
-	box-shadow: var(--tooltip-shadow);
+	box-shadow: 1px 1px 7px gray;
 	display: none;
 	font-size: smaller;
 	max-width: 80%;
@@ -1989,7 +1601,7 @@ tr.heading h2 {
 }
 
 #powerTip div.ttdoc {
-        color: var(--tooltip-doc-color);
+        color: grey;
 	font-style: italic;
 }
 
@@ -1998,7 +1610,7 @@ tr.heading h2 {
 }
 
 #powerTip a {
-	color: var(--tooltip-link-color);
+	color: #4665A2;
 }
 
 #powerTip div.ttname {
@@ -2006,14 +1618,14 @@ tr.heading h2 {
 }
 
 #powerTip div.ttdeci {
-        color: var(--tooltip-declaration-color);
+        color: #006318;
 }
 
 #powerTip div {
         margin: 0px;
         padding: 0px;
         font-size: 12px;
-       	font-family: var(--font-family-tooltip);
+       	font-family: Roboto,sans-serif;
 	line-height: 16px;
 }
 
@@ -2059,12 +1671,12 @@ tr.heading h2 {
 }
 
 #powerTip.n:after, #powerTip.ne:after, #powerTip.nw:after {
-	border-top-color: var(--tooltip-background-color);
+	border-top-color: white;
 	border-width: 10px;
 	margin: 0px -10px;
 }
 #powerTip.n:before, #powerTip.ne:before, #powerTip.nw:before {
-	border-top-color: var(--tooltip-border-color);
+	border-top-color: gray;
 	border-width: 11px;
 	margin: 0px -11px;
 }
@@ -2087,13 +1699,13 @@ tr.heading h2 {
 }
 
 #powerTip.s:after, #powerTip.se:after, #powerTip.sw:after {
-	border-bottom-color: var(--tooltip-background-color);
+	border-bottom-color: white;
 	border-width: 10px;
 	margin: 0px -10px;
 }
 
 #powerTip.s:before, #powerTip.se:before, #powerTip.sw:before {
-	border-bottom-color: var(--tooltip-border-color);
+	border-bottom-color: gray;
 	border-width: 11px;
 	margin: 0px -11px;
 }
@@ -2114,13 +1726,13 @@ tr.heading h2 {
 	left: 100%;
 }
 #powerTip.e:after {
-	border-left-color: var(--tooltip-border-color);
+	border-left-color: gray;
 	border-width: 10px;
 	top: 50%;
 	margin-top: -10px;
 }
 #powerTip.e:before {
-	border-left-color: var(--tooltip-border-color);
+	border-left-color: gray;
 	border-width: 11px;
 	top: 50%;
 	margin-top: -11px;
@@ -2130,13 +1742,13 @@ tr.heading h2 {
 	right: 100%;
 }
 #powerTip.w:after {
-	border-right-color: var(--tooltip-border-color);
+	border-right-color: gray;
 	border-width: 10px;
 	top: 50%;
 	margin-top: -10px;
 }
 #powerTip.w:before {
-	border-right-color: var(--tooltip-border-color);
+	border-right-color: gray;
 	border-width: 11px;
 	top: 50%;
 	margin-top: -11px;
@@ -2170,7 +1782,7 @@ table.markdownTable {
 }
 
 table.markdownTable td, table.markdownTable th {
-	border: 1px solid var(--table-cell-border-color);
+	border: 1px solid #2D4068;
 	padding: 3px 7px 2px;
 }
 
@@ -2178,8 +1790,8 @@ table.markdownTable tr {
 }
 
 th.markdownTableHeadLeft, th.markdownTableHeadRight, th.markdownTableHeadCenter, th.markdownTableHeadNone {
-	background-color: var(--table-header-background-color);
-	color: var(--table-header-foreground-color);
+	background-color: #374F7F;
+	color: #FFFFFF;
 	font-size: 110%;
 	padding-bottom: 4px;
 	padding-top: 5px;
@@ -2227,21 +1839,3 @@ details[open]>summary::before {
     font-size: 80%;
 }
 
-body {
-    scrollbar-color: var(--scrollbar-thumb-color) var(--scrollbar-background-color);
-}
-
-::-webkit-scrollbar {
-        background-color: var(--scrollbar-background-color);
-        height: 12px;
-        width: 12px;
-}
-::-webkit-scrollbar-thumb {
-        border-radius: 6px;
-        box-shadow: inset 0 0 12px 12px var(--scrollbar-thumb-color);
-        border: solid 2px transparent;
-}
-::-webkit-scrollbar-corner {
-        background-color: var(--scrollbar-background-color);
-}
-
diff --git a/doxygen_crawl.html b/doxygen_crawl.html
index 4f648110e..3586e2d1d 100644
--- a/doxygen_crawl.html
+++ b/doxygen_crawl.html
@@ -13,17 +13,373 @@
 <a href="df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html"/>
 <a href="dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html"/>
 <a href="dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html"/>
+<a href="dd/d1e/generate__parentheses_8cpp_source.html"/>
+<a href="d3/d40/graph__coloring_8cpp_source.html"/>
+<a href="d1/d2a/knight__tour_8cpp_source.html"/>
+<a href="d7/d37/magic__sequence_8cpp_source.html"/>
+<a href="df/dfb/minimax_8cpp_source.html"/>
+<a href="d4/d3e/n__queens_8cpp_source.html"/>
+<a href="da/dac/n__queens__all__solution__optimised_8cpp_source.html"/>
+<a href="d7/d24/nqueen__print__all__solutions_8cpp_source.html"/>
+<a href="dc/d5a/rat__maze_8cpp_source.html"/>
+<a href="df/d94/subarray__sum_8cpp_source.html"/>
+<a href="d2/d5a/subset__sum_8cpp_source.html"/>
+<a href="d3/d05/sudoku__solver_8cpp_source.html"/>
+<a href="dc/d14/wildcard__matching_8cpp_source.html"/>
+<a href="d7/d56/count__bits__flip_8cpp_source.html"/>
+<a href="da/db8/count__of__set__bits_8cpp_source.html"/>
+<a href="da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html"/>
+<a href="d6/d38/find__non__repeating__number_8cpp_source.html"/>
+<a href="d4/d8b/gray__code_8cpp_source.html"/>
+<a href="d4/d48/hamming__distance_8cpp_source.html"/>
+<a href="d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html"/>
+<a href="dc/d6d/power__of__2_8cpp_source.html"/>
+<a href="d5/db5/set__kth__bit_8cpp_source.html"/>
+<a href="d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html"/>
+<a href="de/db6/a1z26__cipher_8cpp_source.html"/>
+<a href="dc/dfb/atbash__cipher_8cpp_source.html"/>
+<a href="d1/d1c/base64__encoding_8cpp_source.html"/>
+<a href="d6/d2c/caesar__cipher_8cpp_source.html"/>
+<a href="df/d2c/elliptic__curve__key__exchange_8cpp_source.html"/>
+<a href="d7/db9/hill__cipher_8cpp_source.html"/>
+<a href="d8/d76/morse__code_8cpp_source.html"/>
 <a href="da/d41/uint128__t_8hpp_source.html"/>
 <a href="da/da3/uint256__t_8hpp_source.html"/>
+<a href="dd/d12/vigenere__cipher_8cpp_source.html"/>
+<a href="d3/d4c/xor__cipher_8cpp_source.html"/>
+<a href="df/d47/fcfs__scheduling_8cpp_source.html"/>
+<a href="d8/dee/avltree_8cpp_source.html"/>
+<a href="d3/d26/binary__search__tree_8cpp_source.html"/>
+<a href="df/d42/binary__search__tree2_8cpp_source.html"/>
+<a href="de/dc3/binaryheap_8cpp_source.html"/>
+<a href="d9/dab/bloom__filter_8cpp_source.html"/>
+<a href="d9/dfd/circular__queue__using__linked__list_8cpp_source.html"/>
+<a href="d1/d70/cll_8cpp_source.html"/>
 <a href="d7/dba/cll_8h_source.html"/>
+<a href="df/d97/main__cll_8cpp_source.html"/>
+<a href="de/d23/disjoint__set_8cpp_source.html"/>
+<a href="d7/d85/doubly__linked__list_8cpp_source.html"/>
+<a href="d3/dae/dsu__path__compression_8cpp_source.html"/>
+<a href="df/d28/dsu__union__rank_8cpp_source.html"/>
+<a href="da/dc3/linked__list_8cpp_source.html"/>
+<a href="d3/dce/linkedlist__implentation__usingarray_8cpp_source.html"/>
+<a href="d7/d00/list__array_8cpp_source.html"/>
+<a href="d5/dc5/morrisinorder_8cpp_source.html"/>
 <a href="d3/d09/node_8hpp_source.html"/>
 <a href="d7/ded/queue_8hpp_source.html"/>
+<a href="d8/df0/queue__using__array_8cpp_source.html"/>
+<a href="df/da7/queue__using__array2_8cpp_source.html"/>
+<a href="d8/db7/queue__using__linked__list_8cpp_source.html"/>
+<a href="de/d5b/queue__using__linkedlist_8cpp_source.html"/>
+<a href="df/dd0/queue__using__two__stacks_8cpp_source.html"/>
+<a href="d9/dad/rb__tree_8cpp_source.html"/>
+<a href="d6/d05/reverse__a__linked__list_8cpp_source.html"/>
+<a href="de/dd1/segment__tree_8cpp_source.html"/>
+<a href="d0/d5a/skip__list_8cpp_source.html"/>
+<a href="d8/dab/sparse__table_8cpp_source.html"/>
 <a href="df/d47/stack_8hpp_source.html"/>
+<a href="d8/d96/stack__using__array_8cpp_source.html"/>
+<a href="d3/dea/stack__using__linked__list_8cpp_source.html"/>
+<a href="d7/d43/stack__using__queue_8cpp_source.html"/>
+<a href="d8/dce/test__queue_8cpp_source.html"/>
+<a href="d9/dbf/test__stack_8cpp_source.html"/>
+<a href="db/dbd/test__stack__students_8cpp_source.html"/>
+<a href="d0/dd2/treap_8cpp_source.html"/>
+<a href="d1/d12/tree_8cpp_source.html"/>
+<a href="db/dbc/tree__234_8cpp_source.html"/>
+<a href="dc/d93/trie__modern_8cpp_source.html"/>
+<a href="d7/d83/trie__tree_8cpp_source.html"/>
+<a href="d5/d8a/trie__using__hashmap_8cpp_source.html"/>
+<a href="da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html"/>
+<a href="d0/dea/strassen__matrix__multiplication_8cpp_source.html"/>
+<a href="db/d16/0__1__knapsack_8cpp_source.html"/>
+<a href="d7/d73/abbreviation_8cpp_source.html"/>
+<a href="d1/da7/armstrong__number__templated_8cpp_source.html"/>
+<a href="df/d14/bellman__ford_8cpp_source.html"/>
+<a href="de/dd9/catalan__numbers_8cpp_source.html"/>
+<a href="d9/d6b/coin__change_8cpp_source.html"/>
+<a href="d9/d31/coin__change__topdown_8cpp_source.html"/>
+<a href="d6/d10/cut__rod_8cpp_source.html"/>
+<a href="d5/d82/edit__distance_8cpp_source.html"/>
+<a href="d2/d7d/egg__dropping__puzzle_8cpp_source.html"/>
+<a href="d1/d7c/fibonacci__bottom__up_8cpp_source.html"/>
+<a href="df/d31/floyd__warshall_8cpp_source.html"/>
+<a href="d6/d26/house__robber_8cpp_source.html"/>
+<a href="d4/da0/kadane_8cpp_source.html"/>
+<a href="da/d0d/longest__common__string_8cpp_source.html"/>
+<a href="d4/def/longest__common__subsequence_8cpp_source.html"/>
+<a href="d7/d57/longest__increasing__subsequence_8cpp_source.html"/>
+<a href="d5/d21/longest__increasing__subsequence__nlogn_8cpp_source.html"/>
+<a href="d0/d77/longest__palindromic__subsequence_8cpp_source.html"/>
+<a href="d2/da2/matrix__chain__multiplication_8cpp_source.html"/>
+<a href="db/dfb/maximum__circular__subarray_8cpp_source.html"/>
+<a href="da/d52/minimum__edit__distance_8cpp_source.html"/>
+<a href="d5/d90/palindrome__partitioning_8cpp_source.html"/>
+<a href="de/d8c/partition__problem_8cpp_source.html"/>
+<a href="da/d68/searching__of__element__in__dynamic__array_8cpp_source.html"/>
+<a href="d7/d65/shortest__common__supersequence_8cpp_source.html"/>
+<a href="dc/d67/subset__sum__dynamic_8cpp_source.html"/>
+<a href="d9/d80/trapped__rainwater_8cpp_source.html"/>
+<a href="de/d77/tree__height_8cpp_source.html"/>
+<a href="d9/dec/unbounded__0__1__knapsack_8cpp_source.html"/>
+<a href="d3/d84/word__break_8cpp_source.html"/>
+<a href="dd/d92/memory__game_8cpp_source.html"/>
+<a href="de/d79/graham__scan__algorithm_8cpp_source.html"/>
 <a href="de/d89/graham__scan__functions_8hpp_source.html"/>
+<a href="d4/d8d/jarvis__algorithm_8cpp_source.html"/>
+<a href="d8/d6c/line__segment__intersection_8cpp_source.html"/>
+<a href="d7/d07/bidirectional__dijkstra_8cpp_source.html"/>
+<a href="df/d82/breadth__first__search_8cpp_source.html"/>
+<a href="d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html"/>
+<a href="df/ddd/connected__components_8cpp_source.html"/>
+<a href="d8/d99/connected__components__with__dsu_8cpp_source.html"/>
+<a href="d3/dec/cycle__check__directed__graph_8cpp_source.html"/>
+<a href="da/d8d/depth__first__search_8cpp_source.html"/>
+<a href="da/d4b/depth__first__search__with__stack_8cpp_source.html"/>
+<a href="d8/d68/dijkstra_8cpp_source.html"/>
+<a href="dd/d0c/hamiltons__cycle_8cpp_source.html"/>
+<a href="d1/d9a/hopcroft__karp_8cpp_source.html"/>
+<a href="d6/dd8/is__graph__bipartite_8cpp_source.html"/>
+<a href="dd/dc3/is__graph__bipartite2_8cpp_source.html"/>
+<a href="da/d83/kosaraju_8cpp_source.html"/>
+<a href="d9/d1c/kruskal_8cpp_source.html"/>
+<a href="de/dde/lowest__common__ancestor_8cpp_source.html"/>
+<a href="d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html"/>
+<a href="da/d27/prim_8cpp_source.html"/>
+<a href="d8/db9/topological__sort_8cpp_source.html"/>
+<a href="d1/d1b/topological__sort__by__kahns__algo_8cpp_source.html"/>
+<a href="de/d88/travelling__salesman__problem_8cpp_source.html"/>
+<a href="da/d77/spirograph_8cpp_source.html"/>
+<a href="d9/d1f/binary__addition_8cpp_source.html"/>
+<a href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html"/>
+<a href="d3/d36/digit__separation_8cpp_source.html"/>
+<a href="da/de8/dijkstra__greedy_8cpp_source.html"/>
+<a href="db/d80/gale__shapley_8cpp_source.html"/>
+<a href="d5/d8e/huffman_8cpp_source.html"/>
+<a href="d6/dba/jump__game_8cpp_source.html"/>
+<a href="d0/d61/knapsack_8cpp_source.html"/>
+<a href="d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html"/>
+<a href="d2/d64/prims__minimum__spanning__tree_8cpp_source.html"/>
+<a href="d9/d92/chaining_8cpp_source.html"/>
+<a href="d6/d80/double__hash__hash__table_8cpp_source.html"/>
+<a href="d1/dc7/linear__probing__hash__table_8cpp_source.html"/>
+<a href="d5/d96/md5_8cpp_source.html"/>
+<a href="db/d71/quadratic__probing__hash__table_8cpp_source.html"/>
+<a href="d8/d7a/sha1_8cpp_source.html"/>
+<a href="d4/d08/sha256_8cpp_source.html"/>
+<a href="dd/dec/a__star__search_8cpp_source.html"/>
+<a href="d5/db0/adaline__learning_8cpp_source.html"/>
+<a href="d4/d3e/k__nearest__neighbors_8cpp_source.html"/>
+<a href="d4/def/kohonen__som__topology_8cpp_source.html"/>
+<a href="d9/d49/kohonen__som__trace_8cpp_source.html"/>
+<a href="d2/d58/neural__network_8cpp_source.html"/>
+<a href="dc/d38/ordinary__least__squares__regressor_8cpp_source.html"/>
 <a href="d8/d95/vector__ops_8hpp_source.html"/>
+<a href="de/d99/aliquot__sum_8cpp_source.html"/>
+<a href="d0/d51/approximate__pi_8cpp_source.html"/>
+<a href="dc/d82/area_8cpp_source.html"/>
+<a href="de/d1e/armstrong__number_8cpp_source.html"/>
+<a href="de/dcf/binary__exponent_8cpp_source.html"/>
+<a href="d8/db1/binomial__calculate_8cpp_source.html"/>
+<a href="d5/df6/check__amicable__pair_8cpp_source.html"/>
+<a href="d8/dd5/check__factorial_8cpp_source.html"/>
+<a href="db/d93/check__prime_8cpp_source.html"/>
+<a href="d5/d67/complex__numbers_8cpp_source.html"/>
+<a href="d7/d89/double__factorial_8cpp_source.html"/>
+<a href="d7/da6/eratosthenes_8cpp_source.html"/>
+<a href="da/d23/eulers__totient__function_8cpp_source.html"/>
+<a href="d9/d5d/extended__euclid__algorithm_8cpp_source.html"/>
+<a href="d9/d00/factorial_8cpp_source.html"/>
+<a href="d2/d0b/fast__power_8cpp_source.html"/>
+<a href="d9/d89/fibonacci_8cpp_source.html"/>
+<a href="d4/d32/fibonacci__fast_8cpp_source.html"/>
+<a href="de/de4/fibonacci__large_8cpp_source.html"/>
+<a href="da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html"/>
+<a href="de/dc3/fibonacci__sum_8cpp_source.html"/>
+<a href="d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html"/>
+<a href="d4/da0/gcd__iterative__euclidean_8cpp_source.html"/>
+<a href="d1/d11/gcd__of__n__numbers_8cpp_source.html"/>
+<a href="d4/d45/gcd__recursive__euclidean_8cpp_source.html"/>
+<a href="d1/de9/integral__approximation_8cpp_source.html"/>
+<a href="db/d40/integral__approximation2_8cpp_source.html"/>
+<a href="d6/db8/inv__sqrt_8cpp_source.html"/>
+<a href="db/d9f/iterative__factorial_8cpp_source.html"/>
+<a href="d6/d9d/large__factorial_8cpp_source.html"/>
 <a href="d4/d86/large__number_8h_source.html"/>
+<a href="d5/d7a/largest__power_8cpp_source.html"/>
+<a href="d5/d83/lcm__sum_8cpp_source.html"/>
+<a href="d4/d21/least__common__multiple_8cpp_source.html"/>
+<a href="dc/d52/linear__recurrence__matrix_8cpp_source.html"/>
+<a href="d9/d44/magic__number_8cpp_source.html"/>
+<a href="d6/d42/miller__rabin_8cpp_source.html"/>
+<a href="df/d72/modular__division_8cpp_source.html"/>
+<a href="d0/d6d/modular__exponentiation_8cpp_source.html"/>
+<a href="d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html"/>
+<a href="d6/d2d/modular__inverse__simple_8cpp_source.html"/>
+<a href="db/d27/n__bonacci_8cpp_source.html"/>
+<a href="d1/dbb/n__choose__r_8cpp_source.html"/>
+<a href="de/dab/ncr__modulo__p_8cpp_source.html"/>
+<a href="d0/da2/number__of__positive__divisors_8cpp_source.html"/>
+<a href="d3/dfe/perimeter_8cpp_source.html"/>
+<a href="df/def/power__for__huge__numbers_8cpp_source.html"/>
+<a href="d4/d38/power__of__two_8cpp_source.html"/>
+<a href="db/d0d/prime__factorization_8cpp_source.html"/>
+<a href="de/d9b/prime__numbers_8cpp_source.html"/>
+<a href="d4/d9c/primes__up__to__billion_8cpp_source.html"/>
+<a href="da/d18/quadratic__equations__complex__numbers_8cpp_source.html"/>
+<a href="d0/d08/realtime__stats_8cpp_source.html"/>
+<a href="d8/ddf/sieve__of__eratosthenes_8cpp_source.html"/>
+<a href="da/d24/sqrt__double_8cpp_source.html"/>
+<a href="de/d47/string__fibonacci_8cpp_source.html"/>
+<a href="d4/d9d/sum__of__binomial__coefficient_8cpp_source.html"/>
+<a href="d4/d83/sum__of__digits_8cpp_source.html"/>
+<a href="df/d66/vector__cross__product_8cpp_source.html"/>
+<a href="da/d39/volume_8cpp_source.html"/>
+<a href="dc/d9c/babylonian__method_8cpp_source.html"/>
+<a href="d7/d6a/bisection__method_8cpp_source.html"/>
+<a href="db/d01/brent__method__extrema_8cpp_source.html"/>
+<a href="d4/d18/composite__simpson__rule_8cpp_source.html"/>
+<a href="da/df2/durand__kerner__roots_8cpp_source.html"/>
+<a href="dd/d29/false__position_8cpp_source.html"/>
+<a href="d8/d9a/fast__fourier__transform_8cpp_source.html"/>
+<a href="d0/de2/gaussian__elimination_8cpp_source.html"/>
+<a href="d6/d7a/golden__search__extrema_8cpp_source.html"/>
+<a href="d5/d33/gram__schmidt_8cpp_source.html"/>
+<a href="d9/d37/inverse__fast__fourier__transform_8cpp_source.html"/>
+<a href="dd/d65/lu__decompose_8cpp_source.html"/>
 <a href="d1/dbe/lu__decomposition_8h_source.html"/>
+<a href="df/d11/midpoint__integral__method_8cpp_source.html"/>
+<a href="de/dd3/newton__raphson__method_8cpp_source.html"/>
+<a href="db/dd3/ode__forward__euler_8cpp_source.html"/>
+<a href="d6/dd3/ode__midpoint__euler_8cpp_source.html"/>
+<a href="d3/d06/ode__semi__implicit__euler_8cpp_source.html"/>
 <a href="d4/d68/qr__decompose_8h_source.html"/>
+<a href="d3/d24/qr__decomposition_8cpp_source.html"/>
+<a href="de/d75/qr__eigen__values_8cpp_source.html"/>
+<a href="d1/da6/rungekutta_8cpp_source.html"/>
+<a href="df/dc8/successive__approximation_8cpp_source.html"/>
+<a href="d9/d14/array__left__rotation_8cpp_source.html"/>
+<a href="d6/d57/array__right__rotation_8cpp_source.html"/>
+<a href="de/d33/circular__linked__list_8cpp_source.html"/>
+<a href="d3/dfb/circular__queue__using__array_8cpp_source.html"/>
+<a href="d7/dab/get__size__of__linked__list_8cpp_source.html"/>
+<a href="d4/d32/inorder__successor__of__bst_8cpp_source.html"/>
+<a href="de/dc5/intersection__of__two__arrays_8cpp_source.html"/>
+<a href="d8/d30/reverse__a__linked__list__using__recusion_8cpp_source.html"/>
+<a href="d4/db6/reverse__binary__tree_8cpp_source.html"/>
+<a href="d9/dcc/selectionsortlinkedlist_8cpp_source.html"/>
+<a href="d7/def/trie__multiple__search_8cpp_source.html"/>
+<a href="d8/d9c/union__of__two__arrays_8cpp_source.html"/>
+<a href="d1/d76/buzz__number_8cpp_source.html"/>
+<a href="df/d06/decimal__to__binary_8cpp_source.html"/>
+<a href="da/de7/decimal__to__hexadecimal_8cpp_source.html"/>
+<a href="de/d85/decimal__to__roman__numeral_8cpp_source.html"/>
+<a href="d6/d4e/easter_8cpp_source.html"/>
+<a href="d9/df0/fast__integer__input_8cpp_source.html"/>
+<a href="db/df3/happy__number_8cpp_source.html"/>
+<a href="d8/d90/iterative__tree__traversals_8cpp_source.html"/>
+<a href="de/dcd/kadanes3_8cpp_source.html"/>
+<a href="db/d6b/kelvin__to__celsius_8cpp_source.html"/>
+<a href="d9/d65/lfu__cache_8cpp_source.html"/>
+<a href="d4/db8/longest__substring__without__repeating__characters_8cpp_source.html"/>
+<a href="d3/db3/lru__cache_8cpp_source.html"/>
+<a href="dc/daa/lru__cache2_8cpp_source.html"/>
+<a href="d7/d35/matrix__exponentiation_8cpp_source.html"/>
+<a href="da/d9a/palindrome__of__number_8cpp_source.html"/>
+<a href="dc/dc5/paranthesis__matching_8cpp_source.html"/>
+<a href="dc/d1a/pascal__triangle_8cpp_source.html"/>
+<a href="d7/d75/postfix__evaluation_8cpp_source.html"/>
+<a href="da/d7b/primality__test_8cpp_source.html"/>
+<a href="dc/de1/recursive__tree__traversal_8cpp_source.html"/>
+<a href="d0/d01/smallest__circle_8cpp_source.html"/>
+<a href="d3/d19/sparse__matrix_8cpp_source.html"/>
+<a href="db/d07/spiral__print_8cpp_source.html"/>
+<a href="d5/def/stairs__pattern_8cpp_source.html"/>
+<a href="db/d3c/tower__of__hanoi_8cpp_source.html"/>
+<a href="d3/d61/vector__important__functions_8cpp_source.html"/>
+<a href="d9/d29/ground__to__ground__projectile__motion_8cpp_source.html"/>
+<a href="d6/d4a/addition__rule_8cpp_source.html"/>
+<a href="d5/d67/bayes__theorem_8cpp_source.html"/>
+<a href="d6/db0/binomial__dist_8cpp_source.html"/>
+<a href="d9/da2/exponential__dist_8cpp_source.html"/>
+<a href="de/d72/geometric__dist_8cpp_source.html"/>
+<a href="d9/d24/poisson__dist_8cpp_source.html"/>
+<a href="d1/ded/windowed__median_8cpp_source.html"/>
+<a href="d6/d2e/fenwick__tree_8cpp_source.html"/>
+<a href="d2/de9/heavy__light__decomposition_8cpp_source.html"/>
+<a href="d3/d53/mo_8cpp_source.html"/>
+<a href="d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html"/>
+<a href="d1/d9e/prefix__sum__array_8cpp_source.html"/>
+<a href="d2/d45/segtree_8cpp_source.html"/>
+<a href="d2/d96/sparse__table__range__queries_8cpp_source.html"/>
+<a href="d6/d02/file__linter_8py_source.html"/>
+<a href="df/dd5/binary__search_8cpp_source.html"/>
+<a href="d8/d8a/exponential__search_8cpp_source.html"/>
+<a href="de/d0d/fibonacci__search_8cpp_source.html"/>
+<a href="db/dc4/floyd__cycle__detection__algo_8cpp_source.html"/>
+<a href="d1/df3/hash__search_8cpp_source.html"/>
+<a href="d9/dd7/interpolation__search_8cpp_source.html"/>
+<a href="df/d39/interpolation__search2_8cpp_source.html"/>
+<a href="d2/d22/jump__search_8cpp_source.html"/>
+<a href="d9/d02/linear__search_8cpp_source.html"/>
+<a href="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html"/>
+<a href="d9/d69/median__search_8cpp_source.html"/>
+<a href="d8/dfa/median__search2_8cpp_source.html"/>
+<a href="d3/d22/saddleback__search_8cpp_source.html"/>
+<a href="d5/d45/sublist__search_8cpp_source.html"/>
+<a href="dc/dfe/ternary__search_8cpp_source.html"/>
+<a href="dc/db5/text__search_8cpp_source.html"/>
+<a href="d5/d25/bead__sort_8cpp_source.html"/>
+<a href="d8/dcc/binary__insertion__sort_8cpp_source.html"/>
+<a href="d8/d8f/bitonic__sort_8cpp_source.html"/>
+<a href="d5/ddb/bogo__sort_8cpp_source.html"/>
+<a href="d8/d13/bubble__sort_8cpp_source.html"/>
+<a href="d3/dc1/bucket__sort_8cpp_source.html"/>
+<a href="d9/dd2/cocktail__selection__sort_8cpp_source.html"/>
+<a href="d9/dfd/comb__sort_8cpp_source.html"/>
+<a href="d2/d26/count__inversions_8cpp_source.html"/>
+<a href="d1/d40/counting__sort_8cpp_source.html"/>
+<a href="db/db2/counting__sort__string_8cpp_source.html"/>
+<a href="de/d07/cycle__sort_8cpp_source.html"/>
+<a href="d6/d1a/dnf__sort_8cpp_source.html"/>
+<a href="d2/d21/gnome__sort_8cpp_source.html"/>
+<a href="d2/d52/heap__sort_8cpp_source.html"/>
+<a href="dd/d0d/insertion__sort_8cpp_source.html"/>
+<a href="dd/d89/insertion__sort__recursive_8cpp_source.html"/>
+<a href="d6/d74/library__sort_8cpp_source.html"/>
+<a href="de/d7b/merge__insertion__sort_8cpp_source.html"/>
+<a href="d5/df4/merge__sort_8cpp_source.html"/>
+<a href="d0/db6/non__recursive__merge__sort_8cpp_source.html"/>
+<a href="db/de3/numeric__string__sort_8cpp_source.html"/>
+<a href="d6/da9/odd__even__sort_8cpp_source.html"/>
+<a href="d3/d92/pancake__sort_8cpp_source.html"/>
+<a href="dd/da8/pigeonhole__sort_8cpp_source.html"/>
+<a href="d1/d21/quick__sort_8cpp_source.html"/>
+<a href="d3/d4c/quick__sort__3_8cpp_source.html"/>
+<a href="d3/d22/quick__sort__iterative_8cpp_source.html"/>
+<a href="d8/d7c/radix__sort_8cpp_source.html"/>
+<a href="d8/d61/radix__sort2_8cpp_source.html"/>
+<a href="d1/daa/random__pivot__quick__sort_8cpp_source.html"/>
+<a href="d3/df9/recursive__bubble__sort_8cpp_source.html"/>
+<a href="d9/d85/selection__sort__iterative_8cpp_source.html"/>
+<a href="d4/d9f/selection__sort__recursive_8cpp_source.html"/>
+<a href="de/d40/shell__sort_8cpp_source.html"/>
+<a href="d4/d7a/shell__sort2_8cpp_source.html"/>
+<a href="db/db5/slow__sort_8cpp_source.html"/>
+<a href="d4/d4f/stooge__sort_8cpp_source.html"/>
+<a href="dc/dd9/strand__sort_8cpp_source.html"/>
+<a href="dd/dd5/swap__sort_8cpp_source.html"/>
+<a href="d5/d1e/tim__sort_8cpp_source.html"/>
+<a href="db/d3f/wave__sort_8cpp_source.html"/>
+<a href="d1/dcc/wiggle__sort_8cpp_source.html"/>
+<a href="d3/db2/boyer__moore_8cpp_source.html"/>
+<a href="d3/d7d/brute__force__string__searching_8cpp_source.html"/>
+<a href="db/d09/duval_8cpp_source.html"/>
+<a href="d3/dfe/horspool_8cpp_source.html"/>
+<a href="de/d6a/knuth__morris__pratt_8cpp_source.html"/>
+<a href="d3/d39/manacher__algorithm_8cpp_source.html"/>
+<a href="d6/dce/rabin__karp_8cpp_source.html"/>
+<a href="d3/d80/z__function_8cpp_source.html"/>
 <a href="dd/d1e/generate__parentheses_8cpp.html"/>
 <a href="d3/d40/graph__coloring_8cpp.html"/>
 <a href="d1/d2a/knight__tour_8cpp.html"/>
@@ -685,7 +1041,6 @@
 <a href="d0/d78/classstatistics_1_1stats__computer1-members.html"/>
 <a href="d8/dab/classstatistics_1_1stats__computer2.html"/>
 <a href="d3/da3/classstatistics_1_1stats__computer2-members.html"/>
-<a href="d8/dcc/namespacestd.html"/>
 <a href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html"/>
 <a href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html"/>
 <a href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html"/>
@@ -744,6 +1099,7 @@
 <a href="dir_59dc24c326e2a72d1164f014b22de83d.html"/>
 <a href="dir_82e494173a87936756866de2fa774307.html"/>
 <a href="dir_074119ce3a874b57120c49a0cc4bb5ad.html"/>
+<a href="dir_53e6fa9553ac22a5646d2a2b2d7b97a1.html"/>
 <a href="dir_19b2bf9199a15c634a08b1ede1dd896a.html"/>
 <a href="dir_bb1b521853a9c46347182a9d10420771.html"/>
 <a href="dir_73a3cc5065b223eb41b02873c0e19f0e.html"/>
@@ -1022,6 +1378,7 @@
 <a href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169"/>
 <a href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aefd24626ac47277431c9b8604e064340"/>
 <a href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0"/>
+<a href="d0/d61/knapsack_8cpp_source.html"/>
 <a href="d0/d65/namespacedouble__hashing.html"/>
 <a href="d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003"/>
 <a href="d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd"/>
@@ -1078,6 +1435,7 @@
 <a href="d0/dda/namespacesaddleback.html"/>
 <a href="d0/de2/gaussian__elimination_8cpp.html"/>
 <a href="d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
+<a href="d0/dea/strassen__matrix__multiplication_8cpp_source.html"/>
 <a href="d0/df7/namespacesorting_1_1wave__sort.html#a7d4f243b9dc13ace4ef77e30dbc56f12"/>
 <a href="d0/df8/namespaceabbreviation.html"/>
 <a href="d0/dff/structlinkedlist.html"/>
@@ -1088,6 +1446,9 @@
 <a href="d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a"/>
 <a href="d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
 <a href="d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
+<a href="d1/d12/tree_8cpp_source.html"/>
+<a href="d1/d1b/topological__sort__by__kahns__algo_8cpp_source.html"/>
+<a href="d1/d1c/base64__encoding_8cpp_source.html"/>
 <a href="d1/d21/quick__sort_8cpp.html"/>
 <a href="d1/d21/quick__sort_8cpp.html#a1b2a2cc2d319240f3b65c5b2f479ed82"/>
 <a href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e"/>
@@ -1100,6 +1461,7 @@
 <a href="d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
 <a href="d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2"/>
 <a href="d1/d35/namespaceexponential__dist.html"/>
+<a href="d1/d40/counting__sort_8cpp_source.html"/>
 <a href="d1/d50/namespacesorting_1_1wiggle__sort.html#a99eeded693ac073717282fae365957a1"/>
 <a href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html"/>
 <a href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70"/>
@@ -1123,9 +1485,11 @@
 <a href="d1/d51/namespacedynamic__programming_1_1kadane.html#af3029007a422a914a85c0b0122f1c7b4"/>
 <a href="d1/d64/namespaceinterpolation__search.html"/>
 <a href="d1/d64/namespacemodular__division.html"/>
+<a href="d1/d70/cll_8cpp_source.html"/>
 <a href="d1/d76/buzz__number_8cpp.html"/>
 <a href="d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
 <a href="d1/d77/structmst.html"/>
+<a href="d1/d7c/fibonacci__bottom__up_8cpp_source.html"/>
 <a href="d1/d83/classuint256__t.html"/>
 <a href="d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3"/>
 <a href="d1/d83/classuint256__t.html#a028c585069fa53b74c153667ff66352c"/>
@@ -1370,6 +1734,7 @@
 <a href="d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0"/>
 <a href="d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
 <a href="d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696"/>
+<a href="d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html"/>
 <a href="d2/d4d/namespacebacktracking_1_1subarray__sum.html#af5687bbd9faf927fbd363c71e0baba5e"/>
 <a href="d2/d52/heap__sort_8cpp.html"/>
 <a href="d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767"/>
@@ -1390,6 +1755,8 @@
 <a href="d2/d5a/subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99"/>
 <a href="d2/d5a/subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
 <a href="d2/d5a/subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
+<a href="d2/d64/prims__minimum__spanning__tree_8cpp_source.html"/>
+<a href="d2/d7d/egg__dropping__puzzle_8cpp_source.html"/>
 <a href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html"/>
 <a href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8"/>
 <a href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725"/>
@@ -1406,10 +1773,12 @@
 <a href="d2/d90/namespacegreedy__algorithms.html"/>
 <a href="d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502"/>
 <a href="d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098"/>
+<a href="d2/d96/sparse__table__range__queries_8cpp_source.html"/>
 <a href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html"/>
 <a href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e"/>
 <a href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f"/>
 <a href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143"/>
+<a href="d2/da2/matrix__chain__multiplication_8cpp_source.html"/>
 <a href="d2/da3/namespacesorting_1_1selection__sort__recursive.html#a5454eeb691725ccac0f59df1e133f834"/>
 <a href="d2/da3/namespacesorting_1_1selection__sort__recursive.html#ab6f7b33a070e376e1f4374e534435e89"/>
 <a href="d2/da7/namespacefind__non__repeating__integer.html"/>
@@ -1507,6 +1876,7 @@
 <a href="d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002"/>
 <a href="d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
 <a href="d3/d4c/xor__cipher_8cpp.html#aeff72a463ffc580c16cc849cbbdc58ef"/>
+<a href="d3/d53/mo_8cpp_source.html"/>
 <a href="d3/d61/vector__important__functions_8cpp.html"/>
 <a href="d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
 <a href="d3/d6d/namespacesimpson__method.html"/>
@@ -1589,6 +1959,7 @@
 <a href="d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b"/>
 <a href="d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5"/>
 <a href="d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474"/>
+<a href="d3/dc1/bucket__sort_8cpp_source.html"/>
 <a href="d3/dc1/namespacesorting_1_1radix__sort.html#a98ead7d43b11505398daf9a894f122f9"/>
 <a href="d3/dc1/namespacesorting_1_1radix__sort.html#ae0cfd94fa3765b53d4ec7893ffaee5f8"/>
 <a href="d3/dc9/namespacefibonacci__sum.html"/>
@@ -1615,11 +1986,14 @@
 <a href="d3/dd9/namespacemath_1_1vector__cross.html#a225732399c5c076976eae5b180a9f8c9"/>
 <a href="d3/dd9/namespacemath_1_1vector__cross.html#a4b2a9757a87c18e1642d72410ecfaba8"/>
 <a href="d3/de2/namespacebit__manipulation_1_1travelling__salesman__using__bit__manipulation.html#ad08f082be02c3437c2fe89cb035fcee1"/>
+<a href="d3/dea/stack__using__linked__list_8cpp_source.html"/>
 <a href="d3/deb/namespaceshortest__common__supersequence.html"/>
+<a href="d3/dec/cycle__check__directed__graph_8cpp_source.html"/>
 <a href="d3/df9/recursive__bubble__sort_8cpp.html"/>
 <a href="d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
 <a href="d3/df9/recursive__bubble__sort_8cpp.html#ae3a775d99dbbb94c130a973df0cfddcf"/>
 <a href="d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
+<a href="d3/dfb/circular__queue__using__array_8cpp_source.html"/>
 <a href="d3/dfe/horspool_8cpp.html"/>
 <a href="d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336"/>
 <a href="d3/dfe/horspool_8cpp.html#a9884bca75ce39c116697ea2574adb37d"/>
@@ -1651,7 +2025,7 @@
 <a href="d4/d10/namespacebit__manipulation_1_1count__of__trailing__ciphers__in__factorial__n.html#a0d5e1d651d0d30bd682f176d8f2b83d0"/>
 <a href="d4/d12/namespace_minimum.html"/>
 <a href="d4/d13/namespacebidirectional__dijkstra.html"/>
-<a href="d4/d14/namespacebacktracking_1_1wildcard__matching.html#a4a5b107f93db24e424b12899fa692c5a"/>
+<a href="d4/d14/namespacebacktracking_1_1wildcard__matching.html#a1f8c260cf0d7e22c666b85f1f71ee4a7"/>
 <a href="d4/d18/composite__simpson__rule_8cpp.html"/>
 <a href="d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442"/>
 <a href="d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e"/>
@@ -1742,6 +2116,7 @@
 <a href="d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002"/>
 <a href="d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
 <a href="d4/d86/large__number_8h.html"/>
+<a href="d4/d8b/gray__code_8cpp_source.html"/>
 <a href="d4/d8b/namespacedata__structures_1_1sparse__table.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d"/>
 <a href="d4/d8b/namespacedata__structures_1_1sparse__table.html#af7db62f21983565c64d5d42d2a49888e"/>
 <a href="d4/d8d/jarvis__algorithm_8cpp.html"/>
@@ -1829,6 +2204,7 @@
 <a href="d4/def/kohonen__som__topology_8cpp.html#aa72a53c88203fde278f1fe6c3afe5b07"/>
 <a href="d4/def/kohonen__som__topology_8cpp.html#ac43d294e21a0c4fa33c53757df054576"/>
 <a href="d4/def/kohonen__som__topology_8cpp.html#ae868ad43698a1d69ba46ea3827d7d2c3"/>
+<a href="d4/def/longest__common__subsequence_8cpp_source.html"/>
 <a href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html"/>
 <a href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a173bb71780af6953ec2e307a4c74b025"/>
 <a href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a176b955c90ae57d7dbc3c63f27c84c75"/>
@@ -1866,6 +2242,9 @@
 <a href="d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#a4b76571a2a04fa99c30a96eca9997f0e"/>
 <a href="d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
 <a href="d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
+<a href="d5/d1e/tim__sort_8cpp_source.html"/>
+<a href="d5/d21/longest__increasing__subsequence__nlogn_8cpp_source.html"/>
+<a href="d5/d25/bead__sort_8cpp_source.html"/>
 <a href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html"/>
 <a href="d5/d29/struct_min_heap_node.html"/>
 <a href="d5/d2a/namespacebacktracking_1_1subset__sum.html#a7cb50d36a59427a33f64a266dac83d99"/>
@@ -1934,6 +2313,7 @@
 <a href="d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
 <a href="d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
 <a href="d5/d7a/largest__power_8cpp.html#afa39ec943a4836c878e1614fd89b146f"/>
+<a href="d5/d82/edit__distance_8cpp_source.html"/>
 <a href="d5/d83/lcm__sum_8cpp.html"/>
 <a href="d5/d83/lcm__sum_8cpp.html#a04065193d190d605e1f0d0d93a87e244"/>
 <a href="d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
@@ -1971,6 +2351,7 @@
 <a href="d5/d8a/trie__using__hashmap_8cpp.html"/>
 <a href="d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
 <a href="d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
+<a href="d5/d8e/huffman_8cpp_source.html"/>
 <a href="d5/d90/palindrome__partitioning_8cpp.html"/>
 <a href="d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a"/>
 <a href="d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
@@ -2053,6 +2434,7 @@
 <a href="d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
 <a href="d5/db8/namespacemincoins__topdown.html"/>
 <a href="d5/dc3/namespacebit__manipulation_1_1set__kth__bit.html#ad4d0ffd9331242c42a28834ee19f5fd9"/>
+<a href="d5/dc5/morrisinorder_8cpp_source.html"/>
 <a href="d5/dd0/namespacephysics.html"/>
 <a href="d5/ddb/bogo__sort_8cpp.html"/>
 <a href="d5/ddb/bogo__sort_8cpp.html#a7bfe11bd4703eacd1dab93f25ec639c5"/>
@@ -2073,6 +2455,7 @@
 <a href="d5/df6/check__amicable__pair_8cpp.html#a8e6eede206201db0d1dbb618fa969bec"/>
 <a href="d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
 <a href="d5/df6/check__amicable__pair_8cpp.html#af05567415a9ea36c254b54e3d5a2152a"/>
+<a href="d6/d02/file__linter_8py_source.html"/>
 <a href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html"/>
 <a href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622"/>
 <a href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e"/>
@@ -2157,6 +2540,7 @@
 <a href="d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d"/>
 <a href="d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0"/>
 <a href="d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
+<a href="d6/d4e/easter_8cpp_source.html"/>
 <a href="d6/d4e/namespaceciphers.html"/>
 <a href="d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216"/>
 <a href="d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html"/>
@@ -2178,6 +2562,7 @@
 <a href="d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f"/>
 <a href="d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812"/>
 <a href="d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9"/>
+<a href="d6/d74/library__sort_8cpp_source.html"/>
 <a href="d6/d74/namespacekadane.html"/>
 <a href="d6/d7a/golden__search__extrema_8cpp.html"/>
 <a href="d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70"/>
@@ -2209,6 +2594,7 @@
 <a href="d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8"/>
 <a href="d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa"/>
 <a href="d6/da2/namespacevigenere.html"/>
+<a href="d6/da9/odd__even__sort_8cpp_source.html"/>
 <a href="d6/dab/namespacetree__234.html"/>
 <a href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html"/>
 <a href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a09cbe562b0c396329607f5d388d57c9c"/>
@@ -2322,7 +2708,10 @@
 <a href="d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa"/>
 <a href="d7/d35/matrix__exponentiation_8cpp.html#ae1d1ec9482079231e898236e2b23c9ba"/>
 <a href="d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
+<a href="d7/d37/magic__sequence_8cpp_source.html"/>
+<a href="d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html"/>
 <a href="d7/d3f/namespacetravelling_salesman__bitmanipulation.html"/>
+<a href="d7/d43/stack__using__queue_8cpp_source.html"/>
 <a href="d7/d47/namespace_x_o_r.html"/>
 <a href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html"/>
 <a href="d7/d48/structgeometry_1_1grahamscan_1_1_point.html"/>
@@ -2377,6 +2766,7 @@
 <a href="d7/d83/trie__tree_8cpp.html"/>
 <a href="d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
 <a href="d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
+<a href="d7/d85/doubly__linked__list_8cpp_source.html"/>
 <a href="d7/d88/namespaceprefix__sum__array.html"/>
 <a href="d7/d89/double__factorial_8cpp.html"/>
 <a href="d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26"/>
@@ -2395,6 +2785,7 @@
 <a href="d7/da6/eratosthenes_8cpp.html#a91366864111e1fac29722ca45e02ea8f"/>
 <a href="d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
 <a href="d7/da6/eratosthenes_8cpp.html#ad09d59850865012a6fd95d89954c82e4"/>
+<a href="d7/dab/get__size__of__linked__list_8cpp_source.html"/>
 <a href="d7/daf/namespace_knapsack.html"/>
 <a href="d7/db9/hill__cipher_8cpp.html"/>
 <a href="d7/db9/hill__cipher_8cpp.html#a04391124480d2a49f2dec900237b0712"/>
@@ -2451,6 +2842,7 @@
 <a href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4"/>
 <a href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af34bb8b8eaa34cc499b4fed30b9d05fc"/>
 <a href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a"/>
+<a href="d8/d30/reverse__a__linked__list__using__recusion_8cpp_source.html"/>
 <a href="d8/d36/namespacecut__rod.html"/>
 <a href="d8/d41/namespacegames_1_1memory__game.html"/>
 <a href="d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59"/>
@@ -2556,6 +2948,7 @@
 <a href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2"/>
 <a href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592"/>
 <a href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d"/>
+<a href="d8/d7c/radix__sort_8cpp_source.html"/>
 <a href="d8/d7d/kruskals__minimum__spanning__tree_8cpp.html"/>
 <a href="d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#a349e4ab9a97532c3931a2bd2a19c0098"/>
 <a href="d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
@@ -2576,6 +2969,7 @@
 <a href="d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae"/>
 <a href="d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
 <a href="d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208"/>
+<a href="d8/d8f/bitonic__sort_8cpp_source.html"/>
 <a href="d8/d90/iterative__tree__traversals_8cpp.html"/>
 <a href="d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2"/>
 <a href="d8/d90/iterative__tree__traversals_8cpp.html#a21d922dbb5905993960c6a7f0ba71ac0"/>
@@ -2608,6 +3002,7 @@
 <a href="d8/d95/vector__ops_8hpp.html#ae6ec42318d172b97fbdf45638d09d7b5"/>
 <a href="d8/d95/vector__ops_8hpp.html#af4986b23760039711848155739c31b35"/>
 <a href="d8/d95/vector__ops_8hpp.html#af801bf30591ca6b2c38ff4fed0ded23f"/>
+<a href="d8/d96/stack__using__array_8cpp_source.html"/>
 <a href="d8/d99/connected__components__with__dsu_8cpp.html"/>
 <a href="d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e"/>
 <a href="d8/d99/connected__components__with__dsu_8cpp.html#a67cb7472f310a798f555fe45cdf50145"/>
@@ -2650,6 +3045,7 @@
 <a href="d8/db1/namespacenumerical__methods_1_1false__position.html#a7d69b49dc37da1c02b3ab8c7fe783494"/>
 <a href="d8/db1/namespacenumerical__methods_1_1false__position.html#a85a6ec58b5064d63d4f0df3854496713"/>
 <a href="d8/db1/namespacenumerical__methods_1_1false__position.html#a85cb7bfb90abc898e042d624372c5345"/>
+<a href="d8/db7/queue__using__linked__list_8cpp_source.html"/>
 <a href="d8/db9/topological__sort_8cpp.html"/>
 <a href="d8/db9/topological__sort_8cpp.html#a54dc5d7914958dbd24dda2fd862dc41b"/>
 <a href="d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
@@ -2671,8 +3067,8 @@
 <a href="d8/dcc/binary__insertion__sort_8cpp.html#a5f4bc75cca6dd8294af2d0e328006c68"/>
 <a href="d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
 <a href="d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
-<a href="d8/dcc/namespacestd.html"/>
 <a href="d8/dcd/namespacelru__cache.html"/>
+<a href="d8/dce/test__queue_8cpp_source.html"/>
 <a href="d8/dd5/check__factorial_8cpp.html"/>
 <a href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e"/>
 <a href="d8/dd5/check__factorial_8cpp.html#a6c72f756a7bf1b9043c357e3fe7814ca"/>
@@ -2743,6 +3139,7 @@
 <a href="d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
 <a href="d9/d14/array__left__rotation_8cpp.html#af7b81d7a1534216af6a36a80135beb86"/>
 <a href="d9/d14/array__left__rotation_8cpp.html#afce39cf843989a39811a49ebe29dd6d8"/>
+<a href="d9/d1c/kruskal_8cpp_source.html"/>
 <a href="d9/d1f/binary__addition_8cpp.html"/>
 <a href="d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e"/>
 <a href="d9/d1f/binary__addition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
@@ -2832,12 +3229,14 @@
 <a href="d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae"/>
 <a href="d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002"/>
 <a href="d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
+<a href="d9/d6b/coin__change_8cpp_source.html"/>
 <a href="d9/d70/namespacequeue__using__array.html"/>
 <a href="d9/d75/namespacednf__sort.html"/>
 <a href="d9/d80/trapped__rainwater_8cpp.html"/>
 <a href="d9/d80/trapped__rainwater_8cpp.html#a066e0e739e7c276eee6e61d5b4d37ce8"/>
 <a href="d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
 <a href="d9/d80/trapped__rainwater_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
+<a href="d9/d85/selection__sort__iterative_8cpp_source.html"/>
 <a href="d9/d89/fibonacci_8cpp.html"/>
 <a href="d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
 <a href="d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
@@ -2861,6 +3260,7 @@
 <a href="d9/dab/bloom__filter_8cpp.html#a9ed236419034917c5270c1dccd220b5c"/>
 <a href="d9/dab/bloom__filter_8cpp.html#aa6deb9d4a0f63ea97aef3dce4c6c6677"/>
 <a href="d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
+<a href="d9/dad/rb__tree_8cpp_source.html"/>
 <a href="d9/dae/classdata__structures_1_1_bitset.html"/>
 <a href="d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130"/>
 <a href="d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c"/>
@@ -2868,9 +3268,13 @@
 <a href="d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac"/>
 <a href="d9/dae/classdata__structures_1_1_bitset.html#ad7f7d479079a95bcc9175465395fa23f"/>
 <a href="d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73"/>
+<a href="d9/dbf/test__stack_8cpp_source.html"/>
 <a href="d9/dc9/namespacebase64__encoding.html"/>
 <a href="d9/dca/namespacesearch.html"/>
+<a href="d9/dcc/selectionsortlinkedlist_8cpp_source.html"/>
 <a href="d9/dd1/namespacelinear__recurrence__matrix.html"/>
+<a href="d9/dd2/cocktail__selection__sort_8cpp_source.html"/>
+<a href="d9/dd7/interpolation__search_8cpp_source.html"/>
 <a href="d9/dde/classbinary__search__tree.html"/>
 <a href="d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc"/>
 <a href="d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a"/>
@@ -2916,6 +3320,7 @@
 <a href="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade"/>
 <a href="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3"/>
 <a href="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83"/>
+<a href="d9/dfd/circular__queue__using__linked__list_8cpp_source.html"/>
 <a href="d9/dfd/comb__sort_8cpp.html"/>
 <a href="d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f"/>
 <a href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9"/>
@@ -2965,6 +3370,7 @@
 <a href="da/d24/sqrt__double_8cpp.html"/>
 <a href="da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc"/>
 <a href="da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
+<a href="da/d27/prim_8cpp_source.html"/>
 <a href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html"/>
 <a href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a0c8cbe7239232863f104793c08273039"/>
 <a href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a6cf72f93b1551f0d943c585b4f173be3"/>
@@ -3022,6 +3428,7 @@
 <a href="da/d61/structsearch_1_1sublist__search_1_1_node.html"/>
 <a href="da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b"/>
 <a href="da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a"/>
+<a href="da/d68/searching__of__element__in__dynamic__array_8cpp_source.html"/>
 <a href="da/d6d/namespaceoperations__on__datastructures.html"/>
 <a href="da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86"/>
 <a href="da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74"/>
@@ -3048,6 +3455,7 @@
 <a href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf"/>
 <a href="da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
 <a href="da/d82/namespacecycle__detection.html"/>
+<a href="da/d83/kosaraju_8cpp_source.html"/>
 <a href="da/d84/namespacebacktracking_1_1graph__coloring.html#a40337efc5dad761096489bf2c5b1c80c"/>
 <a href="da/d84/namespacebacktracking_1_1graph__coloring.html#a8c47fa37fb6eeeb781b2ec1b05af6b07"/>
 <a href="da/d84/namespacebacktracking_1_1graph__coloring.html#a976efe049deb042bf1f02612e181ab1d"/>
@@ -3352,10 +3760,13 @@
 <a href="db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d"/>
 <a href="db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85"/>
 <a href="db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094"/>
+<a href="db/db2/counting__sort__string_8cpp_source.html"/>
+<a href="db/db5/slow__sort_8cpp_source.html"/>
 <a href="db/dbc/tree__234_8cpp.html"/>
 <a href="db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97"/>
 <a href="db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243"/>
 <a href="db/dbc/tree__234_8cpp.html#af1ac73779b0fcfbbdce3976c0ca57342"/>
+<a href="db/dbd/test__stack__students_8cpp_source.html"/>
 <a href="db/dc0/namespacebacktracking.html"/>
 <a href="db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50"/>
 <a href="db/dc4/floyd__cycle__detection__algo_8cpp.html"/>
@@ -3369,6 +3780,7 @@
 <a href="db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b"/>
 <a href="db/ddc/namespaceaystar__search.html"/>
 <a href="db/dde/namespaceothers_1_1_cache.html"/>
+<a href="db/de3/numeric__string__sort_8cpp_source.html"/>
 <a href="db/ded/namespacemath_1_1gcd__of__n__numbers.html#a1161713c662a14c2d5e33504f4324532"/>
 <a href="db/ded/namespacemath_1_1gcd__of__n__numbers.html#a509a35e11ed1e17a9e00dd56320a4181"/>
 <a href="db/ded/namespacemath_1_1gcd__of__n__numbers.html#a71b9357c7a722f8208499d9ba573297a"/>
@@ -3399,7 +3811,7 @@
 <a href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12"/>
 <a href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af12ceffdc07cc87eca8a4a8ac87d60fe"/>
 <a href="dc/d14/wildcard__matching_8cpp.html"/>
-<a href="dc/d14/wildcard__matching_8cpp.html#a4a5b107f93db24e424b12899fa692c5a"/>
+<a href="dc/d14/wildcard__matching_8cpp.html#a1f8c260cf0d7e22c666b85f1f71ee4a7"/>
 <a href="dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
 <a href="dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
 <a href="dc/d1a/pascal__triangle_8cpp.html"/>
@@ -3427,6 +3839,7 @@
 <a href="dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
 <a href="dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a"/>
 <a href="dc/d3a/namespacesubset__sum.html"/>
+<a href="dc/d52/linear__recurrence__matrix_8cpp_source.html"/>
 <a href="dc/d5a/rat__maze_8cpp.html"/>
 <a href="dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
 <a href="dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3"/>
@@ -3770,15 +4183,18 @@
 <a href="dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778"/>
 <a href="dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788"/>
 <a href="dd/dba/namespacedivide__and__conquer.html"/>
+<a href="dd/dc3/is__graph__bipartite2_8cpp_source.html"/>
 <a href="dd/dca/class_f_c_f_s.html"/>
 <a href="dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69"/>
 <a href="dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91"/>
 <a href="dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793"/>
 <a href="dd/dca/class_f_c_f_s.html#af2594e22a867b308e027623940193d46"/>
+<a href="dd/dd5/swap__sort_8cpp_source.html"/>
 <a href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html"/>
 <a href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5"/>
 <a href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c"/>
 <a href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114"/>
+<a href="dd/dec/a__star__search_8cpp_source.html"/>
 <a href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html"/>
 <a href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3"/>
 <a href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b"/>
@@ -3807,6 +4223,7 @@
 <a href="de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f"/>
 <a href="de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d"/>
 <a href="de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
+<a href="de/d1e/armstrong__number_8cpp_source.html"/>
 <a href="de/d1f/namespacesorting_1_1bubble__sort.html#af3b12930a83915712461d53fe9659686"/>
 <a href="de/d21/classothers_1_1_cache_1_1_d___node.html"/>
 <a href="de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd"/>
@@ -3827,6 +4244,7 @@
 <a href="de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
 <a href="de/d33/circular__linked__list_8cpp.html#af7b81d7a1534216af6a36a80135beb86"/>
 <a href="de/d36/namespacen__bonacci.html"/>
+<a href="de/d40/shell__sort_8cpp_source.html"/>
 <a href="de/d41/namespacekaratsuba__algorithm.html"/>
 <a href="de/d47/string__fibonacci_8cpp.html"/>
 <a href="de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35"/>
@@ -3838,6 +4256,7 @@
 <a href="de/d5b/namespacebacktracking_1_1sudoku__solver.html#a07dc6acffd0500de9bdbf16b3ade94b0"/>
 <a href="de/d5b/namespacebacktracking_1_1sudoku__solver.html#ab040a12d7684cd85fb3684f4211ea5ac"/>
 <a href="de/d5b/namespacebacktracking_1_1sudoku__solver.html#ac911c8bca8556206ff64461b2424866b"/>
+<a href="de/d5b/queue__using__linkedlist_8cpp_source.html"/>
 <a href="de/d6a/knuth__morris__pratt_8cpp.html"/>
 <a href="de/d6a/knuth__morris__pratt_8cpp.html#a1e37af2f023495129cb57338c801209e"/>
 <a href="de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e"/>
@@ -3856,6 +4275,8 @@
 <a href="de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d"/>
 <a href="de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae"/>
 <a href="de/d75/qr__eigen__values_8cpp.html#aee57a411f07599034f5ceb8cc7d65b40"/>
+<a href="de/d77/tree__height_8cpp_source.html"/>
+<a href="de/d79/graham__scan__algorithm_8cpp_source.html"/>
 <a href="de/d7b/merge__insertion__sort_8cpp.html"/>
 <a href="de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1"/>
 <a href="de/d7b/merge__insertion__sort_8cpp.html#a7161278f18e83b671c6454b139cc5674"/>
@@ -3875,6 +4296,7 @@
 <a href="de/d89/graham__scan__functions_8hpp_source.html"/>
 <a href="de/d8a/namespacemath_1_1modular__division.html#a66cdf93153cbd1408bd74ac68961d179"/>
 <a href="de/d8a/namespacemath_1_1modular__division.html#a905e368ae121beb7e7ea35349ddcdac7"/>
+<a href="de/d8c/partition__problem_8cpp_source.html"/>
 <a href="de/d95/namespace_subsets.html"/>
 <a href="de/d99/aliquot__sum_8cpp.html"/>
 <a href="de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
@@ -3978,6 +4400,7 @@
 <a href="df/d11/midpoint__integral__method_8cpp.html#ae9f66040f8e0ba73c1c741261c22a52a"/>
 <a href="df/d13/namespaceciphers_1_1a1z26.html#a0a78954e96c862430904ee3e64623c38"/>
 <a href="df/d13/namespaceciphers_1_1a1z26.html#a77a6b827a0b9c7aca2d705811459d744"/>
+<a href="df/d14/bellman__ford_8cpp_source.html"/>
 <a href="df/d1c/namespacestack__using__queue.html"/>
 <a href="df/d28/dsu__union__rank_8cpp.html"/>
 <a href="df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae"/>
@@ -3992,6 +4415,7 @@
 <a href="df/d2c/elliptic__curve__key__exchange_8cpp.html#acc5fe9c2032fb7582c38a20d1fa69bcf"/>
 <a href="df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
 <a href="df/d2c/elliptic__curve__key__exchange_8cpp.html#af0a6e3521629c25c2b5d620f26429830"/>
+<a href="df/d31/floyd__warshall_8cpp_source.html"/>
 <a href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html"/>
 <a href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24"/>
 <a href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20"/>
@@ -4069,6 +4493,7 @@
 <a href="df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
 <a href="df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
 <a href="df/d94/subarray__sum_8cpp.html#af5687bbd9faf927fbd363c71e0baba5e"/>
+<a href="df/d97/main__cll_8cpp_source.html"/>
 <a href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html"/>
 <a href="df/d9f/namespacemath_1_1n__bonacci.html#a6849b68f760be628d5975ab3eddec63d"/>
 <a href="df/da2/namespacenumerical__methods_1_1midpoint__rule.html#a7072493d1f0f8a91b2a71d4cc456c09c"/>
@@ -4076,6 +4501,7 @@
 <a href="df/da2/namespacenumerical__methods_1_1midpoint__rule.html#ad53616fb4fa6880ae876bcba53365c51"/>
 <a href="df/da2/namespacenumerical__methods_1_1midpoint__rule.html#ae682ee71af44b1e9e884849cc6a6b040"/>
 <a href="df/da2/namespacenumerical__methods_1_1midpoint__rule.html#ae9f66040f8e0ba73c1c741261c22a52a"/>
+<a href="df/da7/queue__using__array2_8cpp_source.html"/>
 <a href="df/dc8/successive__approximation_8cpp.html"/>
 <a href="df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389"/>
 <a href="df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
@@ -4097,6 +4523,7 @@
 <a href="df/dd0/queue__using__two__stacks_8cpp.html"/>
 <a href="df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863"/>
 <a href="df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
+<a href="df/dd5/binary__search_8cpp_source.html"/>
 <a href="df/ddd/connected__components_8cpp.html"/>
 <a href="df/ddd/connected__components_8cpp.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8"/>
 <a href="df/ddd/connected__components_8cpp.html#a83ab16e96cec644109a58dfc9329bc2b"/>
@@ -4128,6 +4555,7 @@
 <a href="dir_35422be6552f1b3672c1b6c4aba2da64.html"/>
 <a href="dir_4b6f782e158b0b98da980a0e11a23a15.html"/>
 <a href="dir_4d6e05837bf820fb089a8a8cdf2f42b7.html"/>
+<a href="dir_53e6fa9553ac22a5646d2a2b2d7b97a1.html"/>
 <a href="dir_59dc24c326e2a72d1164f014b22de83d.html"/>
 <a href="dir_73a3cc5065b223eb41b02873c0e19f0e.html"/>
 <a href="dir_82e494173a87936756866de2fa774307.html"/>
diff --git a/dynsections.js b/dynsections.js
index b05f4c8d7..0c3560522 100644
--- a/dynsections.js
+++ b/dynsections.js
@@ -128,8 +128,8 @@ let codefold = {
   opened : true,
 
   // in case HTML_COLORSTYLE is LIGHT or DARK the vars will be replaced, so we write them out explicitly and use double quotes
-  plusImg:  [ "var(--fold-plus-image)",  "var(--fold-plus-image-relpath)" ],
-  minusImg: [ "var(--fold-minus-image)", "var(--fold-minus-image-relpath)" ],
+  plusImg:  [ "url('plus.svg')",  "url('../../plus.svg')" ],
+  minusImg: [ "url('minus.svg')", "url('../../minus.svg')" ],
 
   // toggle all folding blocks
   toggle_all : function(relPath) {
@@ -157,7 +157,7 @@ let codefold = {
       'margin-right':'2px',
       'display':'inline-block',
       'width':'54px',
-      'background':'linear-gradient(var(--fold-line-color),var(--fold-line-color)) no-repeat 46px/2px 100%'
+      'background':'linear-gradient(#808080,#808080) no-repeat 46px/2px 100%'
     });
     // add global toggle to first line
     $('span[class=lineno]:first').append('<span class="fold" id="fold_all" '+
@@ -196,3 +196,10 @@ let codefold = {
   },
 };
 /* @license-end */
+$(function() {
+  $('.code,.codeRef').each(function() {
+    $(this).data('powertip',$('#a'+$(this).attr('href').replace(/.*\//,'').replace(/[^a-z_A-Z0-9]/g,'_')).html());
+    $.fn.powerTip.smartPlacementLists.s = [ 's', 'n', 'ne', 'se' ];
+    $(this).powerTip({ placement: 's', smartPlacement: true, mouseOnToPopup: true });
+  });
+});
diff --git a/examples.html b/examples.html
index b6bf4deb2..e7465bf9c 100644
--- a/examples.html
+++ b/examples.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Examples</title>
+<title>TheAlgorithms/C++: Examples</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/favicon.svg b/favicon.svg
new file mode 100644
index 000000000..3c5280c2b
--- /dev/null
+++ b/favicon.svg
@@ -0,0 +1,5 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!-- Generator: Adobe Illustrator 25.0.0, SVG Export Plug-In . SVG Version: 6.00 Build 0)  -->
+<svg version="1.1" id="Layer_1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" x="0px" y="0px" viewBox="0 0 159.7 116.9" enable-background="new 0 0 159.7 116.9" xml:space="preserve">
+<path fill="#00BCB4" d="M54.7,110.7H9l11.9-28.1h32L88.5,0H50.3L22.2,65.3h17.2c1.2,2,3.4,3.4,5.9,3.4c3.8,0,6.9-3.1,6.9-6.9  S49.1,55,45.3,55c-2.8,0-5.1,1.6-6.2,4h-8.2L54.2,6.2h25L49.1,76.3l-31.7,0.2L0,116.9h58.8l7.7-16.8h25.5l8.5,16.8h59.1L106.3,0  L54.7,110.7z M69.8,93.5L79,73.4L89,93.5H69.8z M104.5,111.4l-5.8-11.7h18.2c1.2,2.2,3.5,3.7,6.1,3.7c3.8,0,6.9-3.1,6.9-6.9  c0-3.8-3.1-6.9-6.9-6.9c-2.8,0-5.2,1.7-6.3,4.1H95.9L82,66.7l10.2-22.4l11.5,23.4h5.4c1.1,2.3,3.5,4,6.2,4c3.8,0,6.9-3.1,6.9-6.9  c0-3.8-3.1-6.9-6.9-6.9c-2.9,0-5.4,1.8-6.4,4.4h-2L95,38.1l11.3-24.8l44.4,98.1H104.5z"/>
+</svg>
\ No newline at end of file
diff --git a/files.html b/files.html
index 2bb17725c..ef5317b8d 100644
--- a/files.html
+++ b/files.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File List</title>
+<title>TheAlgorithms/C++: File List</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -110,329 +127,402 @@ $(function(){initNavTree('files.html',''); initResizable(true); });
 <div class="textblock">Here is a list of all documented files with brief descriptions:</div><div class="directory">
 <div class="levels">[detail level <span onclick="javascript:dynsection.toggleLevel(1);">1</span><span onclick="javascript:dynsection.toggleLevel(2);">2</span><span onclick="javascript:dynsection.toggleLevel(3);">3</span>]</div><table class="directory">
 <tr id="row_0_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_0_" class="arrow" onclick="dynsection.toggleFolder('0_')">&#9658;</span><span id="img_0_" class="iconfclosed" onclick="dynsection.toggleFolder('0_')">&#160;</span><a class="el" href="dir_c11585dfcef32a26e29098facab6c144.html" target="_self">backtracking</a></td><td class="desc"></td></tr>
-<tr id="row_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d1e/generate__parentheses_8cpp.html" target="_self">generate_parentheses.cpp</a></td><td class="desc">Well-formed <a href="https://leetcode.com/explore/interview/card/top-interview-questions-medium/109/backtracking/794/" target="_blank">Generated Parentheses</a> with all combinations </td></tr>
-<tr id="row_0_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d40/graph__coloring_8cpp.html" target="_self">graph_coloring.cpp</a></td><td class="desc">Prints the assigned colors using <a href="https://en.wikipedia.org/wiki/Graph_coloring" target="_blank">Graph Coloring</a> algorithm </td></tr>
-<tr id="row_0_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d2a/knight__tour_8cpp.html" target="_self">knight_tour.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Knight%27s_tour" target="_blank">Knight's tour</a> algorithm </td></tr>
-<tr id="row_0_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/dfb/minimax_8cpp.html" target="_self">minimax.cpp</a></td><td class="desc">Returns which is the longest/shortest number using <a href="https://en.wikipedia.org/wiki/Minimax" target="_blank">minimax</a> algorithm </td></tr>
-<tr id="row_0_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d3e/n__queens_8cpp.html" target="_self">n_queens.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle </td></tr>
-<tr id="row_0_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/dac/n__queens__all__solution__optimised_8cpp.html" target="_self">n_queens_all_solution_optimised.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">N queens</a> all optimized </td></tr>
-<tr id="row_0_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d24/nqueen__print__all__solutions_8cpp.html" target="_self">nqueen_print_all_solutions.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle, printing all solutions </td></tr>
-<tr id="row_0_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d5a/rat__maze_8cpp.html" target="_self">rat_maze.cpp</a></td><td class="desc">Implements <a href="https://www.codesdope.com/blog/article/backtracking-to-
+<tr id="row_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/d1e/generate__parentheses_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dd/d1e/generate__parentheses_8cpp.html" target="_self">generate_parentheses.cpp</a></td><td class="desc">Well-formed <a href="https://leetcode.com/explore/interview/card/top-interview-questions-medium/109/backtracking/794/" target="_blank">Generated Parentheses</a> with all combinations </td></tr>
+<tr id="row_0_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d40/graph__coloring_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/d40/graph__coloring_8cpp.html" target="_self">graph_coloring.cpp</a></td><td class="desc">Prints the assigned colors using <a href="https://en.wikipedia.org/wiki/Graph_coloring" target="_blank">Graph Coloring</a> algorithm </td></tr>
+<tr id="row_0_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d2a/knight__tour_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d1/d2a/knight__tour_8cpp.html" target="_self">knight_tour.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Knight%27s_tour" target="_blank">Knight's tour</a> algorithm </td></tr>
+<tr id="row_0_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d37/magic__sequence_8cpp_source.html"><span class="icondoc"></span></a><b>magic_sequence.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_0_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/dfb/minimax_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/dfb/minimax_8cpp.html" target="_self">minimax.cpp</a></td><td class="desc">Returns which is the longest/shortest number using <a href="https://en.wikipedia.org/wiki/Minimax" target="_blank">minimax</a> algorithm </td></tr>
+<tr id="row_0_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d3e/n__queens_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d3e/n__queens_8cpp.html" target="_self">n_queens.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle </td></tr>
+<tr id="row_0_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/dac/n__queens__all__solution__optimised_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/dac/n__queens__all__solution__optimised_8cpp.html" target="_self">n_queens_all_solution_optimised.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">N queens</a> all optimized </td></tr>
+<tr id="row_0_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d24/nqueen__print__all__solutions_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d7/d24/nqueen__print__all__solutions_8cpp.html" target="_self">nqueen_print_all_solutions.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle" target="_blank">Eight Queens</a> puzzle, printing all solutions </td></tr>
+<tr id="row_0_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d5a/rat__maze_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dc/d5a/rat__maze_8cpp.html" target="_self">rat_maze.cpp</a></td><td class="desc">Implements <a href="https://www.codesdope.com/blog/article/backtracking-to-
 solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm </td></tr>
-<tr id="row_0_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d94/subarray__sum_8cpp.html" target="_self">subarray_sum.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset-sum</a> (only continuous subsets) problem </td></tr>
-<tr id="row_0_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d5a/subset__sum_8cpp.html" target="_self">subset_sum.cpp</a></td><td class="desc">Implementation of the <a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset Sum</a> problem </td></tr>
-<tr id="row_0_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d05/sudoku__solver_8cpp.html" target="_self">sudoku_solver.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Sudoku" target="_blank">Sudoku Solver</a> algorithm </td></tr>
-<tr id="row_0_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d14/wildcard__matching_8cpp.html" target="_self">wildcard_matching.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/wildcard-pattern-matching/" target="_blank">Wildcard Matching</a> problem </td></tr>
+<tr id="row_0_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d94/subarray__sum_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/d94/subarray__sum_8cpp.html" target="_self">subarray_sum.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset-sum</a> (only continuous subsets) problem </td></tr>
+<tr id="row_0_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d5a/subset__sum_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d2/d5a/subset__sum_8cpp.html" target="_self">subset_sum.cpp</a></td><td class="desc">Implementation of the <a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset Sum</a> problem </td></tr>
+<tr id="row_0_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d05/sudoku__solver_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/d05/sudoku__solver_8cpp.html" target="_self">sudoku_solver.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Sudoku" target="_blank">Sudoku Solver</a> algorithm </td></tr>
+<tr id="row_0_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d14/wildcard__matching_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dc/d14/wildcard__matching_8cpp.html" target="_self">wildcard_matching.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/wildcard-pattern-matching/" target="_blank">Wildcard Matching</a> problem </td></tr>
 <tr id="row_1_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_1_" class="arrow" onclick="dynsection.toggleFolder('1_')">&#9658;</span><span id="img_1_" class="iconfclosed" onclick="dynsection.toggleFolder('1_')">&#160;</span><a class="el" href="dir_f3c4fbc4e901afa0a54d0623c5574aa7.html" target="_self">bit_manipulation</a></td><td class="desc"></td></tr>
-<tr id="row_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d56/count__bits__flip_8cpp.html" target="_self">count_bits_flip.cpp</a></td><td class="desc">Implementation to [Count number of bits to be flipped to convert A to B] (<a href="https://www.geeksforgeeks.org/count-number-of-bits-to-be-flipped-to-convert-a-to-b/">https://www.geeksforgeeks.org/count-number-of-bits-to-be-flipped-to-convert-a-to-b/</a>) in an integer </td></tr>
-<tr id="row_1_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/db8/count__of__set__bits_8cpp.html" target="_self">count_of_set_bits.cpp</a></td><td class="desc">Implementation to [count number of set bits of a number] (<a href="https://www.geeksforgeeks.org/count-set-bits-in-an-integer/">https://www.geeksforgeeks.org/count-set-bits-in-an-integer/</a>) in an integer </td></tr>
-<tr id="row_1_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html" target="_self">count_of_trailing_ciphers_in_factorial_n.cpp</a></td><td class="desc"><a href="https://www.tutorialspoint.com/count-trailing-zeros-in-factorial-of-a-number-in-cplusplus" target="_blank">Count the number of ciphers</a> in <code>n!</code> implementation </td></tr>
-<tr id="row_1_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d38/find__non__repeating__number_8cpp.html" target="_self">find_non_repeating_number.cpp</a></td><td class="desc">Implementation to find the non repeating integer in an array of repeating integers. <a href="https://leetcode.com/problems/single-number/" target="_blank">Single Number</a> </td></tr>
-<tr id="row_1_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d48/hamming__distance_8cpp.html" target="_self">hamming_distance.cpp</a></td><td class="desc">Returns the <a href="https://en.wikipedia.org/wiki/Hamming_distance" target="_blank">Hamming distance</a> between two integers </td></tr>
-<tr id="row_1_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html" target="_self">next_higher_number_with_same_number_of_set_bits.cpp</a></td><td class="desc">[Next higher number with same number of set bits] (<a href="https://www.geeksforgeeks.org/next-higher-number-with-same-number-of-set-bits/">https://www.geeksforgeeks.org/next-higher-number-with-same-number-of-set-bits/</a>) implementation </td></tr>
-<tr id="row_1_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d6d/power__of__2_8cpp.html" target="_self">power_of_2.cpp</a></td><td class="desc">[Find whether a given number is power of 2] (<a href="https://www.geeksforgeeks.org/program-to-find-whether-a-given-number-is-power-of-2/">https://www.geeksforgeeks.org/program-to-find-whether-a-given-number-is-power-of-2/</a>) implementation </td></tr>
-<tr id="row_1_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/db5/set__kth__bit_8cpp.html" target="_self">set_kth_bit.cpp</a></td><td class="desc">Implementation to [From the right, set the Kth bit in the binary representation of N] (<a href="https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/">https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/</a>) in an integer </td></tr>
-<tr id="row_1_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html" target="_self">travelling_salesman_using_bit_manipulation.cpp</a></td><td class="desc">Implementation to [Travelling Salesman problem using bit-masking] (<a href="https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/">https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/</a>) </td></tr>
+<tr id="row_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d56/count__bits__flip_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d7/d56/count__bits__flip_8cpp.html" target="_self">count_bits_flip.cpp</a></td><td class="desc">Implementation to [Count number of bits to be flipped to convert A to B] (<a href="https://www.geeksforgeeks.org/count-number-of-bits-to-be-flipped-to-convert-a-to-b/">https://www.geeksforgeeks.org/count-number-of-bits-to-be-flipped-to-convert-a-to-b/</a>) in an integer </td></tr>
+<tr id="row_1_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/db8/count__of__set__bits_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/db8/count__of__set__bits_8cpp.html" target="_self">count_of_set_bits.cpp</a></td><td class="desc">Implementation to [count number of set bits of a number] (<a href="https://www.geeksforgeeks.org/count-set-bits-in-an-integer/">https://www.geeksforgeeks.org/count-set-bits-in-an-integer/</a>) in an integer </td></tr>
+<tr id="row_1_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html" target="_self">count_of_trailing_ciphers_in_factorial_n.cpp</a></td><td class="desc"><a href="https://www.tutorialspoint.com/count-trailing-zeros-in-factorial-of-a-number-in-cplusplus" target="_blank">Count the number of ciphers</a> in <code>n!</code> implementation </td></tr>
+<tr id="row_1_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d38/find__non__repeating__number_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/d38/find__non__repeating__number_8cpp.html" target="_self">find_non_repeating_number.cpp</a></td><td class="desc">Implementation to find the non repeating integer in an array of repeating integers. <a href="https://leetcode.com/problems/single-number/" target="_blank">Single Number</a> </td></tr>
+<tr id="row_1_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d8b/gray__code_8cpp_source.html"><span class="icondoc"></span></a><b>gray_code.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_1_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d48/hamming__distance_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d48/hamming__distance_8cpp.html" target="_self">hamming_distance.cpp</a></td><td class="desc">Returns the <a href="https://en.wikipedia.org/wiki/Hamming_distance" target="_blank">Hamming distance</a> between two integers </td></tr>
+<tr id="row_1_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html" target="_self">next_higher_number_with_same_number_of_set_bits.cpp</a></td><td class="desc">[Next higher number with same number of set bits] (<a href="https://www.geeksforgeeks.org/next-higher-number-with-same-number-of-set-bits/">https://www.geeksforgeeks.org/next-higher-number-with-same-number-of-set-bits/</a>) implementation </td></tr>
+<tr id="row_1_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d6d/power__of__2_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dc/d6d/power__of__2_8cpp.html" target="_self">power_of_2.cpp</a></td><td class="desc">[Find whether a given number is power of 2] (<a href="https://www.geeksforgeeks.org/program-to-find-whether-a-given-number-is-power-of-2/">https://www.geeksforgeeks.org/program-to-find-whether-a-given-number-is-power-of-2/</a>) implementation </td></tr>
+<tr id="row_1_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/db5/set__kth__bit_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d5/db5/set__kth__bit_8cpp.html" target="_self">set_kth_bit.cpp</a></td><td class="desc">Implementation to [From the right, set the Kth bit in the binary representation of N] (<a href="https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/">https://practice.geeksforgeeks.org/problems/set-kth-bit3724/1/</a>) in an integer </td></tr>
+<tr id="row_1_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html" target="_self">travelling_salesman_using_bit_manipulation.cpp</a></td><td class="desc">Implementation to [Travelling Salesman problem using bit-masking] (<a href="https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/">https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/</a>) </td></tr>
 <tr id="row_2_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_2_" class="arrow" onclick="dynsection.toggleFolder('2_')">&#9658;</span><span id="img_2_" class="iconfclosed" onclick="dynsection.toggleFolder('2_')">&#160;</span><a class="el" href="dir_4d6e05837bf820fb089a8a8cdf2f42b7.html" target="_self">ciphers</a></td><td class="desc"></td></tr>
-<tr id="row_2_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/db6/a1z26__cipher_8cpp.html" target="_self">a1z26_cipher.cpp</a></td><td class="desc">Implementation of the <a href="https://www.dcode.fr/letter-number-cipher" target="_blank">A1Z26 cipher</a> </td></tr>
-<tr id="row_2_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/dfb/atbash__cipher_8cpp.html" target="_self">atbash_cipher.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Atbash" target="_blank">Atbash Cipher</a> implementation </td></tr>
-<tr id="row_2_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d2c/caesar__cipher_8cpp.html" target="_self">caesar_cipher.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Caesar_cipher" target="_blank">Caesar cipher</a> algorithm </td></tr>
-<tr id="row_2_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d2c/elliptic__curve__key__exchange_8cpp.html" target="_self">elliptic_curve_key_exchange.cpp</a></td><td class="desc">Implementation of <a href="https://cryptobook.nakov.com/asymmetric-key-ciphers/ecdh-key-exchange" target="_blank">Elliptic Curve Diffie Hellman Key Exchange</a> </td></tr>
-<tr id="row_2_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/db9/hill__cipher_8cpp.html" target="_self">hill_cipher.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Hill_cipher" target="_blank">Hill cipher</a> algorithm </td></tr>
-<tr id="row_2_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d76/morse__code_8cpp.html" target="_self">morse_code.cpp</a></td><td class="desc">Implementation of [Morse Code] (<a href="https://en.wikipedia.org/wiki/Morse_code">https://en.wikipedia.org/wiki/Morse_code</a>) </td></tr>
-<tr id="row_2_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d41/uint128__t_8hpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/d41/uint128__t_8hpp.html" target="_self">uint128_t.hpp</a></td><td class="desc"></td></tr>
-<tr id="row_2_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/da3/uint256__t_8hpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/da3/uint256__t_8hpp.html" target="_self">uint256_t.hpp</a></td><td class="desc"></td></tr>
-<tr id="row_2_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d12/vigenere__cipher_8cpp.html" target="_self">vigenere_cipher.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Vigen%C3%A8re_cipher" target="_blank">Vigenère cipher</a> algorithm </td></tr>
-<tr id="row_2_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d4c/xor__cipher_8cpp.html" target="_self">xor_cipher.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/XOR_cipher" target="_blank">XOR cipher</a> algorithm </td></tr>
+<tr id="row_2_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/db6/a1z26__cipher_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/db6/a1z26__cipher_8cpp.html" target="_self">a1z26_cipher.cpp</a></td><td class="desc">Implementation of the <a href="https://www.dcode.fr/letter-number-cipher" target="_blank">A1Z26 cipher</a> </td></tr>
+<tr id="row_2_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/dfb/atbash__cipher_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dc/dfb/atbash__cipher_8cpp.html" target="_self">atbash_cipher.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Atbash" target="_blank">Atbash Cipher</a> implementation </td></tr>
+<tr id="row_2_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d1c/base64__encoding_8cpp_source.html"><span class="icondoc"></span></a><b>base64_encoding.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_2_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d2c/caesar__cipher_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/d2c/caesar__cipher_8cpp.html" target="_self">caesar_cipher.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Caesar_cipher" target="_blank">Caesar cipher</a> algorithm </td></tr>
+<tr id="row_2_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d2c/elliptic__curve__key__exchange_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/d2c/elliptic__curve__key__exchange_8cpp.html" target="_self">elliptic_curve_key_exchange.cpp</a></td><td class="desc">Implementation of <a href="https://cryptobook.nakov.com/asymmetric-key-ciphers/ecdh-key-exchange" target="_blank">Elliptic Curve Diffie Hellman Key Exchange</a> </td></tr>
+<tr id="row_2_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/db9/hill__cipher_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d7/db9/hill__cipher_8cpp.html" target="_self">hill_cipher.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Hill_cipher" target="_blank">Hill cipher</a> algorithm </td></tr>
+<tr id="row_2_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d76/morse__code_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/d76/morse__code_8cpp.html" target="_self">morse_code.cpp</a></td><td class="desc">Implementation of [Morse Code] (<a href="https://en.wikipedia.org/wiki/Morse_code">https://en.wikipedia.org/wiki/Morse_code</a>) </td></tr>
+<tr id="row_2_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d41/uint128__t_8hpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/d41/uint128__t_8hpp.html" target="_self">uint128_t.hpp</a></td><td class="desc"></td></tr>
+<tr id="row_2_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/da3/uint256__t_8hpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/da3/uint256__t_8hpp.html" target="_self">uint256_t.hpp</a></td><td class="desc"></td></tr>
+<tr id="row_2_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/d12/vigenere__cipher_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dd/d12/vigenere__cipher_8cpp.html" target="_self">vigenere_cipher.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Vigen%C3%A8re_cipher" target="_blank">Vigenère cipher</a> algorithm </td></tr>
+<tr id="row_2_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d4c/xor__cipher_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/d4c/xor__cipher_8cpp.html" target="_self">xor_cipher.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/XOR_cipher" target="_blank">XOR cipher</a> algorithm </td></tr>
 <tr id="row_3_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_3_" class="arrow" onclick="dynsection.toggleFolder('3_')">&#9658;</span><span id="img_3_" class="iconfclosed" onclick="dynsection.toggleFolder('3_')">&#160;</span><a class="el" href="dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html" target="_self">cpu_scheduling_algorithms</a></td><td class="desc"></td></tr>
-<tr id="row_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d47/fcfs__scheduling_8cpp.html" target="_self">fcfs_scheduling.cpp</a></td><td class="desc">Implementation of <a class="el" href="dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> CPU scheduling algorithm </td></tr>
+<tr id="row_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d47/fcfs__scheduling_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/d47/fcfs__scheduling_8cpp.html" target="_self">fcfs_scheduling.cpp</a></td><td class="desc">Implementation of <a class="el" href="dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> CPU scheduling algorithm </td></tr>
 <tr id="row_4_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_4_" class="arrow" onclick="dynsection.toggleFolder('4_')">&#9658;</span><span id="img_4_" class="iconfclosed" onclick="dynsection.toggleFolder('4_')">&#160;</span><a class="el" href="dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html" target="_self">data_structures</a></td><td class="desc"></td></tr>
 <tr id="row_4_0_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_4_0_" class="arrow" onclick="dynsection.toggleFolder('4_0_')">&#9658;</span><span id="img_4_0_" class="iconfclosed" onclick="dynsection.toggleFolder('4_0_')">&#160;</span><a class="el" href="dir_f1797d0c2a0a12033e7d74efffeb14e1.html" target="_self">cll</a></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;">&#160;</span><a href="d7/dba/cll_8h_source.html"><span class="icondoc"></span></a><b>cll.h</b></td><td class="desc"></td></tr>
-<tr id="row_4_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/dee/avltree_8cpp.html" target="_self">avltree.cpp</a></td><td class="desc">A simple tree implementation using nodes </td></tr>
-<tr id="row_4_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d26/binary__search__tree_8cpp.html" target="_self">binary_search_tree.cpp</a></td><td class="desc">A simple tree implementation using structured nodes </td></tr>
-<tr id="row_4_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d42/binary__search__tree2_8cpp.html" target="_self">binary_search_tree2.cpp</a></td><td class="desc">A generic <a href="https://en.wikipedia.org/wiki/Binary_search_tree" target="_blank">binary search tree</a> implementation. Here you can find more information about the algorithm: <a href="https://www.scaler.com/topics/data-structures/binary-search-tree/" target="_blank">Scaler - Binary Search tree</a> </td></tr>
-<tr id="row_4_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dc3/binaryheap_8cpp.html" target="_self">binaryheap.cpp</a></td><td class="desc">A C++ program to demonstrate common Binary Heap Operations </td></tr>
-<tr id="row_4_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/dab/bloom__filter_8cpp.html" target="_self">bloom_filter.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Bloom_filter" target="_blank">Bloom Filter</a> generic implementation in C++ </td></tr>
-<tr id="row_4_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d23/disjoint__set_8cpp.html" target="_self">disjoint_set.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Disjoint-set_data_structure" target="_blank">Disjoint Sets Data Structure (Disjoint Sets)</a> </td></tr>
-<tr id="row_4_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/dae/dsu__path__compression_8cpp.html" target="_self">dsu_path_compression.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Disjoint-set-data_structure" target="_blank">DSU (Disjoint sets)</a> </td></tr>
-<tr id="row_4_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d28/dsu__union__rank_8cpp.html" target="_self">dsu_union_rank.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Disjoint-set-data_structure" target="_blank">DSU (Disjoint sets)</a> </td></tr>
-<tr id="row_4_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/dc3/linked__list_8cpp.html" target="_self">linked_list.cpp</a></td><td class="desc">Implementation of singly linked list algorithm </td></tr>
-<tr id="row_4_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html" target="_self">linkedlist_implentation_usingarray.cpp</a></td><td class="desc">Linked list implementation using Arrays </td></tr>
-<tr id="row_4_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d00/list__array_8cpp.html" target="_self">list_array.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Dynamic_array" target="_blank">Dynamic Array</a> </td></tr>
-<tr id="row_4_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d09/node_8hpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/d09/node_8hpp.html" target="_self">node.hpp</a></td><td class="desc">Provides <a class="el" href="db/d8b/struct_node.html">Node</a> class and related utilities </td></tr>
-<tr id="row_4_13_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/ded/queue_8hpp_source.html"><span class="icondoc"></span></a><b>queue.hpp</b></td><td class="desc"></td></tr>
-<tr id="row_4_14_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/df0/queue__using__array_8cpp.html" target="_self">queue_using_array.cpp</a></td><td class="desc">Implementation of Linear [<a class="el" href="dc/db5/struct_queue.html">Queue</a> using array] (<a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/">https://www.geeksforgeeks.org/array-implementation-of-queue-simple/</a>) </td></tr>
-<tr id="row_4_15_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/dd0/queue__using__two__stacks_8cpp.html" target="_self">queue_using_two_stacks.cpp</a></td><td class="desc"></td></tr>
-<tr id="row_4_16_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d05/reverse__a__linked__list_8cpp.html" target="_self">reverse_a_linked_list.cpp</a></td><td class="desc">Implementation of <a href="https://simple.wikipedia.org/wiki/Linked_list" target="_blank">Reversing a single linked list</a> </td></tr>
-<tr id="row_4_17_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dd1/segment__tree_8cpp.html" target="_self">segment_tree.cpp</a></td><td class="desc">A data structure to quickly do operations on ranges: the <a href="https://en.wikipedia.org/wiki/Segment_tree" target="_blank">Segment Tree</a> algorithm implementation </td></tr>
-<tr id="row_4_18_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d5a/skip__list_8cpp.html" target="_self">skip_list.cpp</a></td><td class="desc">Data structure for fast searching and insertion in \(O(\log n)\) time </td></tr>
-<tr id="row_4_19_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/dab/sparse__table_8cpp.html" target="_self">sparse_table.cpp</a></td><td class="desc">Implementation of <a href="https://brilliant.org/wiki/sparse-table/" target="_blank">Sparse Table</a> for <code>min()</code> function </td></tr>
-<tr id="row_4_20_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d47/stack_8hpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/d47/stack_8hpp.html" target="_self">stack.hpp</a></td><td class="desc">This class specifies the basic operation on a stack as a linked list </td></tr>
-<tr id="row_4_21_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/dd2/treap_8cpp.html" target="_self">treap.cpp</a></td><td class="desc">A balanced binary search tree (BST) on the basis of binary search tree and heap: the <a href="https://en.wikipedia.org/wiki/Treap" target="_blank">Treap</a> algorithm implementation </td></tr>
-<tr id="row_4_22_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/dbc/tree__234_8cpp.html" target="_self">tree_234.cpp</a></td><td class="desc">A demo 2-3-4 tree implementation </td></tr>
-<tr id="row_4_23_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d93/trie__modern_8cpp.html" target="_self">trie_modern.cpp</a></td><td class="desc">A basic implementation of trie class to store only lower-case strings </td></tr>
-<tr id="row_4_24_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d83/trie__tree_8cpp.html" target="_self">trie_tree.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure for English alphabets in small characters </td></tr>
-<tr id="row_4_25_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d8a/trie__using__hashmap_8cpp.html" target="_self">trie_using_hashmap.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure using HashMap for different characters and method for predicting words based on prefix </td></tr>
+<tr id="row_4_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="d1/d70/cll_8cpp_source.html"><span class="icondoc"></span></a><b>cll.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_4_0_1_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="d7/dba/cll_8h_source.html"><span class="icondoc"></span></a><b>cll.h</b></td><td class="desc"></td></tr>
+<tr id="row_4_0_2_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><a href="df/d97/main__cll_8cpp_source.html"><span class="icondoc"></span></a><b>main_cll.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_4_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/dee/avltree_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/dee/avltree_8cpp.html" target="_self">avltree.cpp</a></td><td class="desc">A simple tree implementation using nodes </td></tr>
+<tr id="row_4_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d26/binary__search__tree_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/d26/binary__search__tree_8cpp.html" target="_self">binary_search_tree.cpp</a></td><td class="desc">A simple tree implementation using structured nodes </td></tr>
+<tr id="row_4_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d42/binary__search__tree2_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/d42/binary__search__tree2_8cpp.html" target="_self">binary_search_tree2.cpp</a></td><td class="desc">A generic <a href="https://en.wikipedia.org/wiki/Binary_search_tree" target="_blank">binary search tree</a> implementation. Here you can find more information about the algorithm: <a href="https://www.scaler.com/topics/data-structures/binary-search-tree/" target="_blank">Scaler - Binary Search tree</a> </td></tr>
+<tr id="row_4_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dc3/binaryheap_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/dc3/binaryheap_8cpp.html" target="_self">binaryheap.cpp</a></td><td class="desc">A C++ program to demonstrate common Binary Heap Operations </td></tr>
+<tr id="row_4_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/dab/bloom__filter_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/dab/bloom__filter_8cpp.html" target="_self">bloom_filter.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Bloom_filter" target="_blank">Bloom Filter</a> generic implementation in C++ </td></tr>
+<tr id="row_4_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/dfd/circular__queue__using__linked__list_8cpp_source.html"><span class="icondoc"></span></a><b>circular_queue_using_linked_list.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_4_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d23/disjoint__set_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/d23/disjoint__set_8cpp.html" target="_self">disjoint_set.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Disjoint-set_data_structure" target="_blank">Disjoint Sets Data Structure (Disjoint Sets)</a> </td></tr>
+<tr id="row_4_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d85/doubly__linked__list_8cpp_source.html"><span class="icondoc"></span></a><b>doubly_linked_list.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_4_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/dae/dsu__path__compression_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/dae/dsu__path__compression_8cpp.html" target="_self">dsu_path_compression.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Disjoint-set-data_structure" target="_blank">DSU (Disjoint sets)</a> </td></tr>
+<tr id="row_4_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d28/dsu__union__rank_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/d28/dsu__union__rank_8cpp.html" target="_self">dsu_union_rank.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Disjoint-set-data_structure" target="_blank">DSU (Disjoint sets)</a> </td></tr>
+<tr id="row_4_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/dc3/linked__list_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/dc3/linked__list_8cpp.html" target="_self">linked_list.cpp</a></td><td class="desc">Implementation of singly linked list algorithm </td></tr>
+<tr id="row_4_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/dce/linkedlist__implentation__usingarray_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html" target="_self">linkedlist_implentation_usingarray.cpp</a></td><td class="desc">Linked list implementation using Arrays </td></tr>
+<tr id="row_4_13_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d00/list__array_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d7/d00/list__array_8cpp.html" target="_self">list_array.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Dynamic_array" target="_blank">Dynamic Array</a> </td></tr>
+<tr id="row_4_14_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/dc5/morrisinorder_8cpp_source.html"><span class="icondoc"></span></a><b>morrisinorder.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_4_15_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d09/node_8hpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/d09/node_8hpp.html" target="_self">node.hpp</a></td><td class="desc">Provides <a class="el" href="db/d8b/struct_node.html">Node</a> class and related utilities </td></tr>
+<tr id="row_4_16_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/ded/queue_8hpp_source.html"><span class="icondoc"></span></a><b>queue.hpp</b></td><td class="desc"></td></tr>
+<tr id="row_4_17_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/df0/queue__using__array_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/df0/queue__using__array_8cpp.html" target="_self">queue_using_array.cpp</a></td><td class="desc">Implementation of Linear [<a class="el" href="dc/db5/struct_queue.html">Queue</a> using array] (<a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/">https://www.geeksforgeeks.org/array-implementation-of-queue-simple/</a>) </td></tr>
+<tr id="row_4_18_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/da7/queue__using__array2_8cpp_source.html"><span class="icondoc"></span></a><b>queue_using_array2.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_4_19_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/db7/queue__using__linked__list_8cpp_source.html"><span class="icondoc"></span></a><b>queue_using_linked_list.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_4_20_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d5b/queue__using__linkedlist_8cpp_source.html"><span class="icondoc"></span></a><b>queue_using_linkedlist.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_4_21_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/dd0/queue__using__two__stacks_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/dd0/queue__using__two__stacks_8cpp.html" target="_self">queue_using_two_stacks.cpp</a></td><td class="desc"></td></tr>
+<tr id="row_4_22_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/dad/rb__tree_8cpp_source.html"><span class="icondoc"></span></a><b>rb_tree.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_4_23_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d05/reverse__a__linked__list_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/d05/reverse__a__linked__list_8cpp.html" target="_self">reverse_a_linked_list.cpp</a></td><td class="desc">Implementation of <a href="https://simple.wikipedia.org/wiki/Linked_list" target="_blank">Reversing a single linked list</a> </td></tr>
+<tr id="row_4_24_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dd1/segment__tree_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/dd1/segment__tree_8cpp.html" target="_self">segment_tree.cpp</a></td><td class="desc">A data structure to quickly do operations on ranges: the <a href="https://en.wikipedia.org/wiki/Segment_tree" target="_blank">Segment Tree</a> algorithm implementation </td></tr>
+<tr id="row_4_25_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d5a/skip__list_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d0/d5a/skip__list_8cpp.html" target="_self">skip_list.cpp</a></td><td class="desc">Data structure for fast searching and insertion in \(O(\log n)\) time </td></tr>
+<tr id="row_4_26_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/dab/sparse__table_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/dab/sparse__table_8cpp.html" target="_self">sparse_table.cpp</a></td><td class="desc">Implementation of <a href="https://brilliant.org/wiki/sparse-table/" target="_blank">Sparse Table</a> for <code>min()</code> function </td></tr>
+<tr id="row_4_27_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d47/stack_8hpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/d47/stack_8hpp.html" target="_self">stack.hpp</a></td><td class="desc">This class specifies the basic operation on a stack as a linked list </td></tr>
+<tr id="row_4_28_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d96/stack__using__array_8cpp_source.html"><span class="icondoc"></span></a><b>stack_using_array.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_4_29_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/dea/stack__using__linked__list_8cpp_source.html"><span class="icondoc"></span></a><b>stack_using_linked_list.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_4_30_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d43/stack__using__queue_8cpp_source.html"><span class="icondoc"></span></a><b>stack_using_queue.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_4_31_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/dce/test__queue_8cpp_source.html"><span class="icondoc"></span></a><b>test_queue.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_4_32_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/dbf/test__stack_8cpp_source.html"><span class="icondoc"></span></a><b>test_stack.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_4_33_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/dbd/test__stack__students_8cpp_source.html"><span class="icondoc"></span></a><b>test_stack_students.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_4_34_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/dd2/treap_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d0/dd2/treap_8cpp.html" target="_self">treap.cpp</a></td><td class="desc">A balanced binary search tree (BST) on the basis of binary search tree and heap: the <a href="https://en.wikipedia.org/wiki/Treap" target="_blank">Treap</a> algorithm implementation </td></tr>
+<tr id="row_4_35_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d12/tree_8cpp_source.html"><span class="icondoc"></span></a><b>tree.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_4_36_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/dbc/tree__234_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="db/dbc/tree__234_8cpp.html" target="_self">tree_234.cpp</a></td><td class="desc">A demo 2-3-4 tree implementation </td></tr>
+<tr id="row_4_37_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d93/trie__modern_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dc/d93/trie__modern_8cpp.html" target="_self">trie_modern.cpp</a></td><td class="desc">A basic implementation of trie class to store only lower-case strings </td></tr>
+<tr id="row_4_38_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d83/trie__tree_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d7/d83/trie__tree_8cpp.html" target="_self">trie_tree.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure for English alphabets in small characters </td></tr>
+<tr id="row_4_39_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d8a/trie__using__hashmap_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d5/d8a/trie__using__hashmap_8cpp.html" target="_self">trie_using_hashmap.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure using HashMap for different characters and method for predicting words based on prefix </td></tr>
 <tr id="row_5_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_5_" class="arrow" onclick="dynsection.toggleFolder('5_')">&#9658;</span><span id="img_5_" class="iconfclosed" onclick="dynsection.toggleFolder('5_')">&#160;</span><a class="el" href="dir_93bc990c5cceb745f78af6949e9ef947.html" target="_self">divide_and_conquer</a></td><td class="desc"></td></tr>
-<tr id="row_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html" target="_self">karatsuba_algorithm_for_fast_multiplication.cpp</a></td><td class="desc">Implementation of the <a href="https://en.wikipedia.org/wiki/Karatsuba_algorithm" target="_blank">Karatsuba algorithm for fast multiplication</a> </td></tr>
+<tr id="row_5_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html" target="_self">karatsuba_algorithm_for_fast_multiplication.cpp</a></td><td class="desc">Implementation of the <a href="https://en.wikipedia.org/wiki/Karatsuba_algorithm" target="_blank">Karatsuba algorithm for fast multiplication</a> </td></tr>
+<tr id="row_5_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/dea/strassen__matrix__multiplication_8cpp_source.html"><span class="icondoc"></span></a><b>strassen_matrix_multiplication.cpp</b></td><td class="desc"></td></tr>
 <tr id="row_6_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_6_" class="arrow" onclick="dynsection.toggleFolder('6_')">&#9658;</span><span id="img_6_" class="iconfclosed" onclick="dynsection.toggleFolder('6_')">&#160;</span><a class="el" href="dir_8a20dd5bfd5341a725342bf72b6b686f.html" target="_self">dynamic_programming</a></td><td class="desc"></td></tr>
-<tr id="row_6_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d16/0__1__knapsack_8cpp.html" target="_self">0_1_knapsack.cpp</a></td><td class="desc">Implementation of [0-1 <a class="el" href="d7/daf/namespace_knapsack.html" title="Implementation of 0-1 Knapsack problem.">Knapsack</a> Problem] (<a href="https://en.wikipedia.org/wiki/Knapsack_problem">https://en.wikipedia.org/wiki/Knapsack_problem</a>) </td></tr>
-<tr id="row_6_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d73/abbreviation_8cpp.html" target="_self">abbreviation.cpp</a></td><td class="desc">Implementation of <a href="https://www.hackerrank.com/challenges/abbr/problem" target="_blank">Abbrievation</a> </td></tr>
-<tr id="row_6_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/da7/armstrong__number__templated_8cpp.html" target="_self">armstrong_number_templated.cpp</a></td><td class="desc">Checks whether a number is an <a href="https://en.wikipedia.org/wiki/Narcissistic_number" target="_blank">Armstrong Number</a> or not </td></tr>
-<tr id="row_6_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dd9/catalan__numbers_8cpp.html" target="_self">catalan_numbers.cpp</a></td><td class="desc">Provides utilities to compute Catalan numbers using dynamic programming. A Catalan numbers satisfy these recurrence relations: C(0) = C(1) = 1; C(n) = sum(C(i).C(n-i-1)), for i = 0 to n-1 Read more about Catalan numbers here: <a href="https://en.wikipedia.org/wiki/Catalan_number">https://en.wikipedia.org/wiki/Catalan_number</a> <a href="https://oeis.org/A000108/">https://oeis.org/A000108/</a> </td></tr>
-<tr id="row_6_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d31/coin__change__topdown_8cpp.html" target="_self">coin_change_topdown.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/coin-change/" target="_blank">Minimum coins</a> change problem is a problem used to find the minimum number of coins required to completely reach a target amount </td></tr>
-<tr id="row_6_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d10/cut__rod_8cpp.html" target="_self">cut_rod.cpp</a></td><td class="desc">Implementation of cutting a rod problem </td></tr>
-<tr id="row_6_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d26/house__robber_8cpp.html" target="_self">house_robber.cpp</a></td><td class="desc">Implementation of <a href="https://labuladong.gitbook.io/algo-en/i.-dynamic-programming/houserobber" target="_blank">House Robber Problem</a> algorithm </td></tr>
-<tr id="row_6_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/da0/kadane_8cpp.html" target="_self">kadane.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm" target="_blank">Kadane Algorithm</a> </td></tr>
-<tr id="row_6_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d0d/longest__common__string_8cpp.html" target="_self">longest_common_string.cpp</a></td><td class="desc">Definition of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> </td></tr>
-<tr id="row_6_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d57/longest__increasing__subsequence_8cpp.html" target="_self">longest_increasing_subsequence.cpp</a></td><td class="desc">Calculate the length of the <a href="https://en.wikipedia.org/wiki/Longest_increasing_subsequence" target="_blank">longest increasing subsequence</a> in an array </td></tr>
-<tr id="row_6_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d77/longest__palindromic__subsequence_8cpp.html" target="_self">longest_palindromic_subsequence.cpp</a></td><td class="desc">Program to find the <a href="https://www.geeksforgeeks.org/longest-palindromic-subsequence-dp-12/" target="_blank">Longest Palindormic Subsequence</a> of a string </td></tr>
-<tr id="row_6_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/dfb/maximum__circular__subarray_8cpp.html" target="_self">maximum_circular_subarray.cpp</a></td><td class="desc">C++ program for maximum contiguous circular sum problem using <a href="https://en.wikipedia.org/wiki/Maximum_subarray_problem" target="_blank">Kadane's Algorithm</a> </td></tr>
-<tr id="row_6_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d52/minimum__edit__distance_8cpp.html" target="_self">minimum_edit_distance.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Edit_distance" target="_blank">Minimum Edit Distance</a> using Dynamic Programing </td></tr>
-<tr id="row_6_13_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d90/palindrome__partitioning_8cpp.html" target="_self">palindrome_partitioning.cpp</a></td><td class="desc">Implements <a href="https://leetcode.com/problems/palindrome-partitioning-ii/" target="_blank">Palindrome Partitioning</a> algorithm, giving you the minimum number of partitions you need to make </td></tr>
-<tr id="row_6_14_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d65/shortest__common__supersequence_8cpp.html" target="_self">shortest_common_supersequence.cpp</a></td><td class="desc">SCS is a string Z which is the shortest supersequence of strings X and Y (may not be continuous in Z, but order is maintained) </td></tr>
-<tr id="row_6_15_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d67/subset__sum__dynamic_8cpp.html" target="_self">subset_sum_dynamic.cpp</a></td><td class="desc">Implements [Sub-set sum problem] (<a href="https://en.wikipedia.org/wiki/Subset_sum_problem">https://en.wikipedia.org/wiki/Subset_sum_problem</a>) algorithm, which tells whether a subset with target sum exists or not </td></tr>
-<tr id="row_6_16_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d80/trapped__rainwater_8cpp.html" target="_self">trapped_rainwater.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/trapping-rain-water/" target="_blank">Trapped Rainwater Problem</a> </td></tr>
-<tr id="row_6_17_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/dec/unbounded__0__1__knapsack_8cpp.html" target="_self">unbounded_0_1_knapsack.cpp</a></td><td class="desc">Implementation of the Unbounded 0/1 <a class="el" href="d7/daf/namespace_knapsack.html" title="Implementation of 0-1 Knapsack problem.">Knapsack</a> Problem </td></tr>
-<tr id="row_6_18_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d84/word__break_8cpp.html" target="_self">word_break.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/word-break/" target="_blank">Word Break Problem</a> </td></tr>
+<tr id="row_6_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d16/0__1__knapsack_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="db/d16/0__1__knapsack_8cpp.html" target="_self">0_1_knapsack.cpp</a></td><td class="desc">Implementation of [0-1 <a class="el" href="d7/daf/namespace_knapsack.html" title="Implementation of 0-1 Knapsack problem.">Knapsack</a> Problem] (<a href="https://en.wikipedia.org/wiki/Knapsack_problem">https://en.wikipedia.org/wiki/Knapsack_problem</a>) </td></tr>
+<tr id="row_6_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d73/abbreviation_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d7/d73/abbreviation_8cpp.html" target="_self">abbreviation.cpp</a></td><td class="desc">Implementation of <a href="https://www.hackerrank.com/challenges/abbr/problem" target="_blank">Abbrievation</a> </td></tr>
+<tr id="row_6_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/da7/armstrong__number__templated_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d1/da7/armstrong__number__templated_8cpp.html" target="_self">armstrong_number_templated.cpp</a></td><td class="desc">Checks whether a number is an <a href="https://en.wikipedia.org/wiki/Narcissistic_number" target="_blank">Armstrong Number</a> or not </td></tr>
+<tr id="row_6_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d14/bellman__ford_8cpp_source.html"><span class="icondoc"></span></a><b>bellman_ford.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_6_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dd9/catalan__numbers_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/dd9/catalan__numbers_8cpp.html" target="_self">catalan_numbers.cpp</a></td><td class="desc">Provides utilities to compute Catalan numbers using dynamic programming. A Catalan numbers satisfy these recurrence relations: C(0) = C(1) = 1; C(n) = sum(C(i).C(n-i-1)), for i = 0 to n-1 Read more about Catalan numbers here: <a href="https://en.wikipedia.org/wiki/Catalan_number">https://en.wikipedia.org/wiki/Catalan_number</a> <a href="https://oeis.org/A000108/">https://oeis.org/A000108/</a> </td></tr>
+<tr id="row_6_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d6b/coin__change_8cpp_source.html"><span class="icondoc"></span></a><b>coin_change.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_6_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d31/coin__change__topdown_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/d31/coin__change__topdown_8cpp.html" target="_self">coin_change_topdown.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/coin-change/" target="_blank">Minimum coins</a> change problem is a problem used to find the minimum number of coins required to completely reach a target amount </td></tr>
+<tr id="row_6_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d10/cut__rod_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/d10/cut__rod_8cpp.html" target="_self">cut_rod.cpp</a></td><td class="desc">Implementation of cutting a rod problem </td></tr>
+<tr id="row_6_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d82/edit__distance_8cpp_source.html"><span class="icondoc"></span></a><b>edit_distance.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_6_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d7d/egg__dropping__puzzle_8cpp_source.html"><span class="icondoc"></span></a><b>egg_dropping_puzzle.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_6_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d7c/fibonacci__bottom__up_8cpp_source.html"><span class="icondoc"></span></a><b>fibonacci_bottom_up.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_6_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d31/floyd__warshall_8cpp_source.html"><span class="icondoc"></span></a><b>floyd_warshall.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_6_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d26/house__robber_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/d26/house__robber_8cpp.html" target="_self">house_robber.cpp</a></td><td class="desc">Implementation of <a href="https://labuladong.gitbook.io/algo-en/i.-dynamic-programming/houserobber" target="_blank">House Robber Problem</a> algorithm </td></tr>
+<tr id="row_6_13_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/da0/kadane_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/da0/kadane_8cpp.html" target="_self">kadane.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm" target="_blank">Kadane Algorithm</a> </td></tr>
+<tr id="row_6_14_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d0d/longest__common__string_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/d0d/longest__common__string_8cpp.html" target="_self">longest_common_string.cpp</a></td><td class="desc">Definition of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> </td></tr>
+<tr id="row_6_15_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/def/longest__common__subsequence_8cpp_source.html"><span class="icondoc"></span></a><b>longest_common_subsequence.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_6_16_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d57/longest__increasing__subsequence_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d7/d57/longest__increasing__subsequence_8cpp.html" target="_self">longest_increasing_subsequence.cpp</a></td><td class="desc">Calculate the length of the <a href="https://en.wikipedia.org/wiki/Longest_increasing_subsequence" target="_blank">longest increasing subsequence</a> in an array </td></tr>
+<tr id="row_6_17_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d21/longest__increasing__subsequence__nlogn_8cpp_source.html"><span class="icondoc"></span></a><b>longest_increasing_subsequence_nlogn.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_6_18_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d77/longest__palindromic__subsequence_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d0/d77/longest__palindromic__subsequence_8cpp.html" target="_self">longest_palindromic_subsequence.cpp</a></td><td class="desc">Program to find the <a href="https://www.geeksforgeeks.org/longest-palindromic-subsequence-dp-12/" target="_blank">Longest Palindormic Subsequence</a> of a string </td></tr>
+<tr id="row_6_19_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/da2/matrix__chain__multiplication_8cpp_source.html"><span class="icondoc"></span></a><b>matrix_chain_multiplication.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_6_20_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/dfb/maximum__circular__subarray_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="db/dfb/maximum__circular__subarray_8cpp.html" target="_self">maximum_circular_subarray.cpp</a></td><td class="desc">C++ program for maximum contiguous circular sum problem using <a href="https://en.wikipedia.org/wiki/Maximum_subarray_problem" target="_blank">Kadane's Algorithm</a> </td></tr>
+<tr id="row_6_21_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d52/minimum__edit__distance_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/d52/minimum__edit__distance_8cpp.html" target="_self">minimum_edit_distance.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Edit_distance" target="_blank">Minimum Edit Distance</a> using Dynamic Programing </td></tr>
+<tr id="row_6_22_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d90/palindrome__partitioning_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d5/d90/palindrome__partitioning_8cpp.html" target="_self">palindrome_partitioning.cpp</a></td><td class="desc">Implements <a href="https://leetcode.com/problems/palindrome-partitioning-ii/" target="_blank">Palindrome Partitioning</a> algorithm, giving you the minimum number of partitions you need to make </td></tr>
+<tr id="row_6_23_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d8c/partition__problem_8cpp_source.html"><span class="icondoc"></span></a><b>partition_problem.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_6_24_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d68/searching__of__element__in__dynamic__array_8cpp_source.html"><span class="icondoc"></span></a><b>searching_of_element_in_dynamic_array.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_6_25_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d65/shortest__common__supersequence_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d7/d65/shortest__common__supersequence_8cpp.html" target="_self">shortest_common_supersequence.cpp</a></td><td class="desc">SCS is a string Z which is the shortest supersequence of strings X and Y (may not be continuous in Z, but order is maintained) </td></tr>
+<tr id="row_6_26_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d67/subset__sum__dynamic_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dc/d67/subset__sum__dynamic_8cpp.html" target="_self">subset_sum_dynamic.cpp</a></td><td class="desc">Implements [Sub-set sum problem] (<a href="https://en.wikipedia.org/wiki/Subset_sum_problem">https://en.wikipedia.org/wiki/Subset_sum_problem</a>) algorithm, which tells whether a subset with target sum exists or not </td></tr>
+<tr id="row_6_27_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d80/trapped__rainwater_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/d80/trapped__rainwater_8cpp.html" target="_self">trapped_rainwater.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/trapping-rain-water/" target="_blank">Trapped Rainwater Problem</a> </td></tr>
+<tr id="row_6_28_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d77/tree__height_8cpp_source.html"><span class="icondoc"></span></a><b>tree_height.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_6_29_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/dec/unbounded__0__1__knapsack_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/dec/unbounded__0__1__knapsack_8cpp.html" target="_self">unbounded_0_1_knapsack.cpp</a></td><td class="desc">Implementation of the Unbounded 0/1 <a class="el" href="d7/daf/namespace_knapsack.html" title="Implementation of 0-1 Knapsack problem.">Knapsack</a> Problem </td></tr>
+<tr id="row_6_30_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d84/word__break_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/d84/word__break_8cpp.html" target="_self">word_break.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/word-break/" target="_blank">Word Break Problem</a> </td></tr>
 <tr id="row_7_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_7_" class="arrow" onclick="dynsection.toggleFolder('7_')">&#9658;</span><span id="img_7_" class="iconfclosed" onclick="dynsection.toggleFolder('7_')">&#160;</span><a class="el" href="dir_4b6f782e158b0b98da980a0e11a23a15.html" target="_self">games</a></td><td class="desc"></td></tr>
-<tr id="row_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d92/memory__game_8cpp.html" target="_self">memory_game.cpp</a></td><td class="desc">A simple <a href="https://en.wikipedia.org/wiki/Matching_game" target="_blank">Memory Game</a> with <b>3 different sizes</b> and multiple letters </td></tr>
+<tr id="row_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/d92/memory__game_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dd/d92/memory__game_8cpp.html" target="_self">memory_game.cpp</a></td><td class="desc">A simple <a href="https://en.wikipedia.org/wiki/Matching_game" target="_blank">Memory Game</a> with <b>3 different sizes</b> and multiple letters </td></tr>
 <tr id="row_8_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_8_" class="arrow" onclick="dynsection.toggleFolder('8_')">&#9658;</span><span id="img_8_" class="iconfclosed" onclick="dynsection.toggleFolder('8_')">&#160;</span><a class="el" href="dir_e3380d2178455503f266746fb14246a5.html" target="_self">geometry</a></td><td class="desc"></td></tr>
-<tr id="row_8_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d89/graham__scan__functions_8hpp_source.html"><span class="icondoc"></span></a><b>graham_scan_functions.hpp</b></td><td class="desc"></td></tr>
-<tr id="row_8_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d8d/jarvis__algorithm_8cpp.html" target="_self">jarvis_algorithm.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm" target="_blank">Jarvis’s</a> algorithm </td></tr>
-<tr id="row_8_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d6c/line__segment__intersection_8cpp.html" target="_self">line_segment_intersection.cpp</a></td><td class="desc">Check whether two line segments intersect each other or not </td></tr>
+<tr id="row_8_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d79/graham__scan__algorithm_8cpp_source.html"><span class="icondoc"></span></a><b>graham_scan_algorithm.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_8_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d89/graham__scan__functions_8hpp_source.html"><span class="icondoc"></span></a><b>graham_scan_functions.hpp</b></td><td class="desc"></td></tr>
+<tr id="row_8_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d8d/jarvis__algorithm_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d8d/jarvis__algorithm_8cpp.html" target="_self">jarvis_algorithm.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm" target="_blank">Jarvis’s</a> algorithm </td></tr>
+<tr id="row_8_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d6c/line__segment__intersection_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/d6c/line__segment__intersection_8cpp.html" target="_self">line_segment_intersection.cpp</a></td><td class="desc">Check whether two line segments intersect each other or not </td></tr>
 <tr id="row_9_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_9_" class="arrow" onclick="dynsection.toggleFolder('9_')">&#9658;</span><span id="img_9_" class="iconfclosed" onclick="dynsection.toggleFolder('9_')">&#160;</span><a class="el" href="dir_12552d7fa429bf94a2e32e5cf39f7e69.html" target="_self">graph</a></td><td class="desc"></td></tr>
-<tr id="row_9_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html" target="_self">bidirectional_dijkstra.cpp</a></td><td class="desc">[Bidirectional Dijkstra Shortest Path Algorithm] (<a href="https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra">https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra</a>) </td></tr>
-<tr id="row_9_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d82/breadth__first__search_8cpp.html" target="_self">breadth_first_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Breadth-first_search" target="_blank">Breadth First Search Algorithm (Breadth First Search)</a> </td></tr>
-<tr id="row_9_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/ddd/connected__components_8cpp.html" target="_self">connected_components.cpp</a></td><td class="desc">[<a class="el" href="da/d9a/class_graph.html">Graph</a> Connected Components (Connected Components)] (<a href="https://en.wikipedia.org/wiki/Component_(graph_theory)">https://en.wikipedia.org/wiki/Component_(graph_theory)</a>) </td></tr>
-<tr id="row_9_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d99/connected__components__with__dsu_8cpp.html" target="_self">connected_components_with_dsu.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Disjoint_union" target="_blank">Disjoint union</a> </td></tr>
-<tr id="row_9_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d8d/depth__first__search_8cpp.html" target="_self">depth_first_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Depth-first_search" target="_blank">Depth First Search Algorithm (Depth First Search)</a> </td></tr>
-<tr id="row_9_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html" target="_self">depth_first_search_with_stack.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Depth-first_search" target="_blank">Depth First Search Algorithm using Stack (Depth First Search Algorithm)</a> </td></tr>
-<tr id="row_9_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d68/dijkstra_8cpp.html" target="_self">dijkstra.cpp</a></td><td class="desc">[<a class="el" href="da/d9a/class_graph.html">Graph</a> Dijkstras Shortest Path Algorithm (Dijkstra's Shortest Path)] (<a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm">https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm</a>) </td></tr>
-<tr id="row_9_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html" target="_self">hamiltons_cycle.cpp</a></td><td class="desc">The implementation of <a href="https://en.wikipedia.org/wiki/Hamiltonian_path" target="_blank">Hamilton's cycle</a> dynamic solution for vertices number less than 20 </td></tr>
-<tr id="row_9_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d9a/hopcroft__karp_8cpp.html" target="_self">hopcroft_karp.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Hopcroft%E2%80%93Karp_algorithm" target="_blank">Hopcroft–Karp</a> algorithm </td></tr>
-<tr id="row_9_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/dd8/is__graph__bipartite_8cpp.html" target="_self">is_graph_bipartite.cpp</a></td><td class="desc">Algorithm to check whether a graph is <a href="https://en.wikipedia.org/wiki/Bipartite_graph" target="_blank">bipartite</a> </td></tr>
-<tr id="row_9_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dde/lowest__common__ancestor_8cpp.html" target="_self">lowest_common_ancestor.cpp</a></td><td class="desc">Data structure for finding the lowest common ancestor of two vertices in a rooted tree using binary lifting </td></tr>
-<tr id="row_9_11_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/db9/topological__sort_8cpp.html" target="_self">topological_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Topological_sorting" target="_blank">Topological Sort Algorithm</a> </td></tr>
-<tr id="row_9_12_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d88/travelling__salesman__problem_8cpp.html" target="_self">travelling_salesman_problem.cpp</a></td><td class="desc">[Travelling Salesman Problem] (<a href="https://en.wikipedia.org/wiki/Travelling_salesman_problem">https://en.wikipedia.org/wiki/Travelling_salesman_problem</a>) implementation </td></tr>
+<tr id="row_9_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d07/bidirectional__dijkstra_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html" target="_self">bidirectional_dijkstra.cpp</a></td><td class="desc">[Bidirectional Dijkstra Shortest Path Algorithm] (<a href="https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra">https://www.coursera.org/learn/algorithms-on-graphs/lecture/7ml18/bidirectional-dijkstra</a>) </td></tr>
+<tr id="row_9_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d82/breadth__first__search_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/d82/breadth__first__search_8cpp.html" target="_self">breadth_first_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Breadth-first_search" target="_blank">Breadth First Search Algorithm (Breadth First Search)</a> </td></tr>
+<tr id="row_9_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html"><span class="icondoc"></span></a><b>bridge_finding_with_tarjan_algorithm.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_9_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/ddd/connected__components_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/ddd/connected__components_8cpp.html" target="_self">connected_components.cpp</a></td><td class="desc">[<a class="el" href="da/d9a/class_graph.html">Graph</a> Connected Components (Connected Components)] (<a href="https://en.wikipedia.org/wiki/Component_(graph_theory)">https://en.wikipedia.org/wiki/Component_(graph_theory)</a>) </td></tr>
+<tr id="row_9_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d99/connected__components__with__dsu_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/d99/connected__components__with__dsu_8cpp.html" target="_self">connected_components_with_dsu.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Disjoint_union" target="_blank">Disjoint union</a> </td></tr>
+<tr id="row_9_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/dec/cycle__check__directed__graph_8cpp_source.html"><span class="icondoc"></span></a><b>cycle_check_directed_graph.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_9_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d8d/depth__first__search_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/d8d/depth__first__search_8cpp.html" target="_self">depth_first_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Depth-first_search" target="_blank">Depth First Search Algorithm (Depth First Search)</a> </td></tr>
+<tr id="row_9_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d4b/depth__first__search__with__stack_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html" target="_self">depth_first_search_with_stack.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Depth-first_search" target="_blank">Depth First Search Algorithm using Stack (Depth First Search Algorithm)</a> </td></tr>
+<tr id="row_9_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d68/dijkstra_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/d68/dijkstra_8cpp.html" target="_self">dijkstra.cpp</a></td><td class="desc">[<a class="el" href="da/d9a/class_graph.html">Graph</a> Dijkstras Shortest Path Algorithm (Dijkstra's Shortest Path)] (<a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm">https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm</a>) </td></tr>
+<tr id="row_9_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/d0c/hamiltons__cycle_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html" target="_self">hamiltons_cycle.cpp</a></td><td class="desc">The implementation of <a href="https://en.wikipedia.org/wiki/Hamiltonian_path" target="_blank">Hamilton's cycle</a> dynamic solution for vertices number less than 20 </td></tr>
+<tr id="row_9_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d9a/hopcroft__karp_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d1/d9a/hopcroft__karp_8cpp.html" target="_self">hopcroft_karp.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Hopcroft%E2%80%93Karp_algorithm" target="_blank">Hopcroft–Karp</a> algorithm </td></tr>
+<tr id="row_9_11_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/dd8/is__graph__bipartite_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/dd8/is__graph__bipartite_8cpp.html" target="_self">is_graph_bipartite.cpp</a></td><td class="desc">Algorithm to check whether a graph is <a href="https://en.wikipedia.org/wiki/Bipartite_graph" target="_blank">bipartite</a> </td></tr>
+<tr id="row_9_12_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/dc3/is__graph__bipartite2_8cpp_source.html"><span class="icondoc"></span></a><b>is_graph_bipartite2.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_9_13_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d83/kosaraju_8cpp_source.html"><span class="icondoc"></span></a><b>kosaraju.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_9_14_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d1c/kruskal_8cpp_source.html"><span class="icondoc"></span></a><b>kruskal.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_9_15_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dde/lowest__common__ancestor_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/dde/lowest__common__ancestor_8cpp.html" target="_self">lowest_common_ancestor.cpp</a></td><td class="desc">Data structure for finding the lowest common ancestor of two vertices in a rooted tree using binary lifting </td></tr>
+<tr id="row_9_16_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html"><span class="icondoc"></span></a><b>max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_9_17_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d27/prim_8cpp_source.html"><span class="icondoc"></span></a><b>prim.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_9_18_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/db9/topological__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/db9/topological__sort_8cpp.html" target="_self">topological_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Topological_sorting" target="_blank">Topological Sort Algorithm</a> </td></tr>
+<tr id="row_9_19_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d1b/topological__sort__by__kahns__algo_8cpp_source.html"><span class="icondoc"></span></a><b>topological_sort_by_kahns_algo.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_9_20_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d88/travelling__salesman__problem_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/d88/travelling__salesman__problem_8cpp.html" target="_self">travelling_salesman_problem.cpp</a></td><td class="desc">[Travelling Salesman Problem] (<a href="https://en.wikipedia.org/wiki/Travelling_salesman_problem">https://en.wikipedia.org/wiki/Travelling_salesman_problem</a>) implementation </td></tr>
 <tr id="row_10_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_10_" class="arrow" onclick="dynsection.toggleFolder('10_')">&#9658;</span><span id="img_10_" class="iconfclosed" onclick="dynsection.toggleFolder('10_')">&#160;</span><a class="el" href="dir_e79632891301b850df87e9c0030293fa.html" target="_self">graphics</a></td><td class="desc"></td></tr>
-<tr id="row_10_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d77/spirograph_8cpp.html" target="_self">spirograph.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Spirograph" target="_blank">Spirograph</a> </td></tr>
+<tr id="row_10_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d77/spirograph_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/d77/spirograph_8cpp.html" target="_self">spirograph.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Spirograph" target="_blank">Spirograph</a> </td></tr>
 <tr id="row_11_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_11_" class="arrow" onclick="dynsection.toggleFolder('11_')">&#9658;</span><span id="img_11_" class="iconfclosed" onclick="dynsection.toggleFolder('11_')">&#160;</span><a class="el" href="dir_0eaa691bd54ab0922ca7f50599de6d22.html" target="_self">greedy_algorithms</a></td><td class="desc"></td></tr>
-<tr id="row_11_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d1f/binary__addition_8cpp.html" target="_self">binary_addition.cpp</a></td><td class="desc">Adds two binary numbers and outputs resulting string </td></tr>
-<tr id="row_11_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html" target="_self">boruvkas_minimum_spanning_tree.cpp</a></td><td class="desc">[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 </td></tr>
-<tr id="row_11_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d36/digit__separation_8cpp.html" target="_self">digit_separation.cpp</a></td><td class="desc">Separates digits from numbers in forward and reverse order </td></tr>
-<tr id="row_11_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/de8/dijkstra__greedy_8cpp.html" target="_self">dijkstra_greedy.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" target="_blank">Dijkstra</a> algorithm implementation </td></tr>
-<tr id="row_11_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d80/gale__shapley_8cpp.html" target="_self">gale_shapley.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Gale%E2%80%93Shapley_algorithm" target="_blank">Gale Shapley Algorithm</a> </td></tr>
-<tr id="row_11_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/dba/jump__game_8cpp.html" target="_self">jump_game.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/jump-game/" target="_blank">Jumping Game</a> algorithm implementation </td></tr>
-<tr id="row_11_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d7d/kruskals__minimum__spanning__tree_8cpp.html" target="_self">kruskals_minimum_spanning_tree.cpp</a></td><td class="desc"><a href="https://www.simplilearn.com/tutorials/data-structure-tutorial/kruskal-algorithm" target="_blank">Kruskals Minimum Spanning Tree</a> implementation </td></tr>
+<tr id="row_11_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d1f/binary__addition_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/d1f/binary__addition_8cpp.html" target="_self">binary_addition.cpp</a></td><td class="desc">Adds two binary numbers and outputs resulting string </td></tr>
+<tr id="row_11_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html" target="_self">boruvkas_minimum_spanning_tree.cpp</a></td><td class="desc">[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 </td></tr>
+<tr id="row_11_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d36/digit__separation_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/d36/digit__separation_8cpp.html" target="_self">digit_separation.cpp</a></td><td class="desc">Separates digits from numbers in forward and reverse order </td></tr>
+<tr id="row_11_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/de8/dijkstra__greedy_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/de8/dijkstra__greedy_8cpp.html" target="_self">dijkstra_greedy.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" target="_blank">Dijkstra</a> algorithm implementation </td></tr>
+<tr id="row_11_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d80/gale__shapley_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="db/d80/gale__shapley_8cpp.html" target="_self">gale_shapley.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Gale%E2%80%93Shapley_algorithm" target="_blank">Gale Shapley Algorithm</a> </td></tr>
+<tr id="row_11_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d8e/huffman_8cpp_source.html"><span class="icondoc"></span></a><b>huffman.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_11_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/dba/jump__game_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/dba/jump__game_8cpp.html" target="_self">jump_game.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/jump-game/" target="_blank">Jumping Game</a> algorithm implementation </td></tr>
+<tr id="row_11_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d61/knapsack_8cpp_source.html"><span class="icondoc"></span></a><b>knapsack.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_11_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/d7d/kruskals__minimum__spanning__tree_8cpp.html" target="_self">kruskals_minimum_spanning_tree.cpp</a></td><td class="desc"><a href="https://www.simplilearn.com/tutorials/data-structure-tutorial/kruskal-algorithm" target="_blank">Kruskals Minimum Spanning Tree</a> implementation </td></tr>
+<tr id="row_11_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d64/prims__minimum__spanning__tree_8cpp_source.html"><span class="icondoc"></span></a><b>prims_minimum_spanning_tree.cpp</b></td><td class="desc"></td></tr>
 <tr id="row_12_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_12_" class="arrow" onclick="dynsection.toggleFolder('12_')">&#9658;</span><span id="img_12_" class="iconfclosed" onclick="dynsection.toggleFolder('12_')">&#160;</span><a class="el" href="dir_ece9b94c107bbaa1dd68197a8c9983b9.html" target="_self">hashing</a></td><td class="desc"></td></tr>
-<tr id="row_12_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d92/chaining_8cpp.html" target="_self">chaining.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Hash_chain" target="_blank">hash chains</a> </td></tr>
-<tr id="row_12_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d80/double__hash__hash__table_8cpp.html" target="_self">double_hash_hash_table.cpp</a></td><td class="desc">Storage mechanism using <a href="https://en.wikipedia.org/wiki/Double_hashing" target="_blank">double-hashed keys</a> </td></tr>
-<tr id="row_12_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/dc7/linear__probing__hash__table_8cpp.html" target="_self">linear_probing_hash_table.cpp</a></td><td class="desc">Storage mechanism using <a href="https://en.wikipedia.org/wiki/Linear_probing" target="_blank">linear probing hash</a> keys </td></tr>
-<tr id="row_12_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d96/md5_8cpp.html" target="_self">md5.cpp</a></td><td class="desc">Simple C++ implementation of the <a href="https://en.wikipedia.org/wiki/MD5" target="_blank">MD5 Hashing Algorithm</a> </td></tr>
-<tr id="row_12_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d71/quadratic__probing__hash__table_8cpp.html" target="_self">quadratic_probing_hash_table.cpp</a></td><td class="desc">Storage mechanism using <a href="https://en.wikipedia.org/wiki/Quadratic_probing" target="_blank">quadratic probing hash</a> keys </td></tr>
-<tr id="row_12_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d7a/sha1_8cpp.html" target="_self">sha1.cpp</a></td><td class="desc">Simple C++ implementation of the <a href="https://en.wikipedia.org/wiki/SHA-1" target="_blank">SHA-1 Hashing Algorithm</a> </td></tr>
-<tr id="row_12_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d08/sha256_8cpp.html" target="_self">sha256.cpp</a></td><td class="desc">Simple C++ implementation of the [SHA-256 Hashing Algorithm] (<a href="https://en.wikipedia.org/wiki/SHA-2">https://en.wikipedia.org/wiki/SHA-2</a>) </td></tr>
+<tr id="row_12_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d92/chaining_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/d92/chaining_8cpp.html" target="_self">chaining.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Hash_chain" target="_blank">hash chains</a> </td></tr>
+<tr id="row_12_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d80/double__hash__hash__table_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/d80/double__hash__hash__table_8cpp.html" target="_self">double_hash_hash_table.cpp</a></td><td class="desc">Storage mechanism using <a href="https://en.wikipedia.org/wiki/Double_hashing" target="_blank">double-hashed keys</a> </td></tr>
+<tr id="row_12_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/dc7/linear__probing__hash__table_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d1/dc7/linear__probing__hash__table_8cpp.html" target="_self">linear_probing_hash_table.cpp</a></td><td class="desc">Storage mechanism using <a href="https://en.wikipedia.org/wiki/Linear_probing" target="_blank">linear probing hash</a> keys </td></tr>
+<tr id="row_12_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d96/md5_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d5/d96/md5_8cpp.html" target="_self">md5.cpp</a></td><td class="desc">Simple C++ implementation of the <a href="https://en.wikipedia.org/wiki/MD5" target="_blank">MD5 Hashing Algorithm</a> </td></tr>
+<tr id="row_12_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d71/quadratic__probing__hash__table_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="db/d71/quadratic__probing__hash__table_8cpp.html" target="_self">quadratic_probing_hash_table.cpp</a></td><td class="desc">Storage mechanism using <a href="https://en.wikipedia.org/wiki/Quadratic_probing" target="_blank">quadratic probing hash</a> keys </td></tr>
+<tr id="row_12_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d7a/sha1_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/d7a/sha1_8cpp.html" target="_self">sha1.cpp</a></td><td class="desc">Simple C++ implementation of the <a href="https://en.wikipedia.org/wiki/SHA-1" target="_blank">SHA-1 Hashing Algorithm</a> </td></tr>
+<tr id="row_12_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d08/sha256_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d08/sha256_8cpp.html" target="_self">sha256.cpp</a></td><td class="desc">Simple C++ implementation of the [SHA-256 Hashing Algorithm] (<a href="https://en.wikipedia.org/wiki/SHA-2">https://en.wikipedia.org/wiki/SHA-2</a>) </td></tr>
 <tr id="row_13_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_13_" class="arrow" onclick="dynsection.toggleFolder('13_')">&#9658;</span><span id="img_13_" class="iconfclosed" onclick="dynsection.toggleFolder('13_')">&#160;</span><a class="el" href="dir_3343723ae086de42ee4ca9774da3a13f.html" target="_self">machine_learning</a></td><td class="desc"></td></tr>
-<tr id="row_13_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/db0/adaline__learning_8cpp.html" target="_self">adaline_learning.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/ADALINE" target="_blank">Adaptive Linear Neuron (ADALINE)</a> implementation </td></tr>
-<tr id="row_13_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d3e/k__nearest__neighbors_8cpp.html" target="_self">k_nearest_neighbors.cpp</a></td><td class="desc">Implementation of [K-Nearest Neighbors algorithm] (<a href="https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm">https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm</a>) </td></tr>
-<tr id="row_13_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/def/kohonen__som__topology_8cpp.html" target="_self">kohonen_som_topology.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Self-organizing_map" target="_blank">Kohonen self organizing map</a> (topological map) </td></tr>
-<tr id="row_13_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d49/kohonen__som__trace_8cpp.html" target="_self">kohonen_som_trace.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Self-organizing_map" target="_blank">Kohonen self organizing map</a> (data tracing) </td></tr>
-<tr id="row_13_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d58/neural__network_8cpp.html" target="_self">neural_network.cpp</a></td><td class="desc">Implementation of [Multilayer Perceptron] (<a href="https://en.wikipedia.org/wiki/Multilayer_perceptron">https://en.wikipedia.org/wiki/Multilayer_perceptron</a>) </td></tr>
-<tr id="row_13_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html" target="_self">ordinary_least_squares_regressor.cpp</a></td><td class="desc">Linear regression example using <a href="https://en.wikipedia.org/wiki/Ordinary_least_squares" target="_blank">Ordinary least squares</a> </td></tr>
-<tr id="row_13_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d95/vector__ops_8hpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/d95/vector__ops_8hpp.html" target="_self">vector_ops.hpp</a></td><td class="desc">Various functions for vectors associated with [NeuralNetwork (aka Multilayer Perceptron)] (<a href="https://en.wikipedia.org/wiki/Multilayer_perceptron">https://en.wikipedia.org/wiki/Multilayer_perceptron</a>) </td></tr>
+<tr id="row_13_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/dec/a__star__search_8cpp_source.html"><span class="icondoc"></span></a><b>a_star_search.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_13_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/db0/adaline__learning_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d5/db0/adaline__learning_8cpp.html" target="_self">adaline_learning.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/ADALINE" target="_blank">Adaptive Linear Neuron (ADALINE)</a> implementation </td></tr>
+<tr id="row_13_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d3e/k__nearest__neighbors_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d3e/k__nearest__neighbors_8cpp.html" target="_self">k_nearest_neighbors.cpp</a></td><td class="desc">Implementation of [K-Nearest Neighbors algorithm] (<a href="https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm">https://en.wikipedia.org/wiki/K-nearest_neighbors_algorithm</a>) </td></tr>
+<tr id="row_13_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/def/kohonen__som__topology_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/def/kohonen__som__topology_8cpp.html" target="_self">kohonen_som_topology.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Self-organizing_map" target="_blank">Kohonen self organizing map</a> (topological map) </td></tr>
+<tr id="row_13_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d49/kohonen__som__trace_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/d49/kohonen__som__trace_8cpp.html" target="_self">kohonen_som_trace.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Self-organizing_map" target="_blank">Kohonen self organizing map</a> (data tracing) </td></tr>
+<tr id="row_13_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d58/neural__network_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d2/d58/neural__network_8cpp.html" target="_self">neural_network.cpp</a></td><td class="desc">Implementation of [Multilayer Perceptron] (<a href="https://en.wikipedia.org/wiki/Multilayer_perceptron">https://en.wikipedia.org/wiki/Multilayer_perceptron</a>) </td></tr>
+<tr id="row_13_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d38/ordinary__least__squares__regressor_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html" target="_self">ordinary_least_squares_regressor.cpp</a></td><td class="desc">Linear regression example using <a href="https://en.wikipedia.org/wiki/Ordinary_least_squares" target="_blank">Ordinary least squares</a> </td></tr>
+<tr id="row_13_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d95/vector__ops_8hpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/d95/vector__ops_8hpp.html" target="_self">vector_ops.hpp</a></td><td class="desc">Various functions for vectors associated with [NeuralNetwork (aka Multilayer Perceptron)] (<a href="https://en.wikipedia.org/wiki/Multilayer_perceptron">https://en.wikipedia.org/wiki/Multilayer_perceptron</a>) </td></tr>
 <tr id="row_14_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_14_" class="arrow" onclick="dynsection.toggleFolder('14_')">&#9658;</span><span id="img_14_" class="iconfclosed" onclick="dynsection.toggleFolder('14_')">&#160;</span><a class="el" href="dir_296d53ceaeaa7e099814a6def439fe8a.html" target="_self">math</a></td><td class="desc"></td></tr>
-<tr id="row_14_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d99/aliquot__sum_8cpp.html" target="_self">aliquot_sum.cpp</a></td><td class="desc">Program to return the <a href="https://en.wikipedia.org/wiki/Aliquot_sum" target="_blank">Aliquot Sum</a> of a number </td></tr>
-<tr id="row_14_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d51/approximate__pi_8cpp.html" target="_self">approximate_pi.cpp</a></td><td class="desc">Implementation to calculate an estimate of the <a href="https://en.wikipedia.org/wiki/File:Pi_30K.gif" target="_blank">number π (Pi)</a> </td></tr>
-<tr id="row_14_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d82/area_8cpp.html" target="_self">area.cpp</a></td><td class="desc">Implementations for the <a href="https://en.wikipedia.org/wiki/Area" target="_blank">area</a> of various shapes </td></tr>
-<tr id="row_14_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dcf/binary__exponent_8cpp.html" target="_self">binary_exponent.cpp</a></td><td class="desc">C++ Program to find Binary Exponent Iteratively and Recursively </td></tr>
-<tr id="row_14_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/db1/binomial__calculate_8cpp.html" target="_self">binomial_calculate.cpp</a></td><td class="desc">Program to calculate <a href="https://en.wikipedia.org/wiki/Binomial_coefficient" target="_blank">Binomial coefficients</a> </td></tr>
-<tr id="row_14_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/df6/check__amicable__pair_8cpp.html" target="_self">check_amicable_pair.cpp</a></td><td class="desc">A C++ Program to check whether a pair of numbers is an <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not </td></tr>
-<tr id="row_14_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/dd5/check__factorial_8cpp.html" target="_self">check_factorial.cpp</a></td><td class="desc">A simple program to check if the given number is a <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">factorial</a> of some number or not </td></tr>
-<tr id="row_14_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d93/check__prime_8cpp.html" target="_self">check_prime.cpp</a></td><td class="desc">A simple program to check if the given number is <a href="https://en.wikipedia.org/wiki/Primality_test" target="_blank">Prime</a> or not </td></tr>
-<tr id="row_14_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d67/complex__numbers_8cpp.html" target="_self">complex_numbers.cpp</a></td><td class="desc">An implementation of <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> Number as Objects </td></tr>
-<tr id="row_14_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d89/double__factorial_8cpp.html" target="_self">double_factorial.cpp</a></td><td class="desc">Compute <a href="https://en.wikipedia.org/wiki/Double_factorial" target="_blank">double factorial</a>: \(n!!\) </td></tr>
-<tr id="row_14_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/da6/eratosthenes_8cpp.html" target="_self">eratosthenes.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes" target="_blank">The Sieve of Eratosthenes</a> </td></tr>
-<tr id="row_14_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d23/eulers__totient__function_8cpp.html" target="_self">eulers_totient_function.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Euler%27s_totient_function" target="_blank">Euler's Totient</a> @description Euler Totient Function is also known as phi function </td></tr>
-<tr id="row_14_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html" target="_self">extended_euclid_algorithm.cpp</a></td><td class="desc">GCD using [extended Euclid's algorithm] (<a href="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm">https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm</a>) </td></tr>
-<tr id="row_14_13_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d00/factorial_8cpp.html" target="_self">factorial.cpp</a></td><td class="desc">Find the <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">factorial</a> of a given number </td></tr>
-<tr id="row_14_14_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d0b/fast__power_8cpp.html" target="_self">fast_power.cpp</a></td><td class="desc">Faster computation for \(a^b\) </td></tr>
-<tr id="row_14_15_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d89/fibonacci_8cpp.html" target="_self">fibonacci.cpp</a></td><td class="desc">N-th <a href="https://en.wikipedia.org/wiki/Fibonacci_sequence" target="_blank">Fibonacci number</a> </td></tr>
-<tr id="row_14_16_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d32/fibonacci__fast_8cpp.html" target="_self">fibonacci_fast.cpp</a></td><td class="desc">Faster computation of Fibonacci series </td></tr>
-<tr id="row_14_17_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/de4/fibonacci__large_8cpp.html" target="_self">fibonacci_large.cpp</a></td><td class="desc">Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations </td></tr>
-<tr id="row_14_18_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/dc9/fibonacci__matrix__exponentiation_8cpp.html" target="_self">fibonacci_matrix_exponentiation.cpp</a></td><td class="desc">This program computes the N^th Fibonacci number in modulo mod input argument </td></tr>
-<tr id="row_14_19_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dc3/fibonacci__sum_8cpp.html" target="_self">fibonacci_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of <a href="https://en.wikipedia.org/wiki/Fibonacci_number" target="_blank">Fibonacci Sequence</a>:  \(\mathrm{F}(n) +
+<tr id="row_14_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d99/aliquot__sum_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/d99/aliquot__sum_8cpp.html" target="_self">aliquot_sum.cpp</a></td><td class="desc">Program to return the <a href="https://en.wikipedia.org/wiki/Aliquot_sum" target="_blank">Aliquot Sum</a> of a number </td></tr>
+<tr id="row_14_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d51/approximate__pi_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d0/d51/approximate__pi_8cpp.html" target="_self">approximate_pi.cpp</a></td><td class="desc">Implementation to calculate an estimate of the <a href="https://en.wikipedia.org/wiki/File:Pi_30K.gif" target="_blank">number π (Pi)</a> </td></tr>
+<tr id="row_14_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d82/area_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dc/d82/area_8cpp.html" target="_self">area.cpp</a></td><td class="desc">Implementations for the <a href="https://en.wikipedia.org/wiki/Area" target="_blank">area</a> of various shapes </td></tr>
+<tr id="row_14_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d1e/armstrong__number_8cpp_source.html"><span class="icondoc"></span></a><b>armstrong_number.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_14_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dcf/binary__exponent_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/dcf/binary__exponent_8cpp.html" target="_self">binary_exponent.cpp</a></td><td class="desc">C++ Program to find Binary Exponent Iteratively and Recursively </td></tr>
+<tr id="row_14_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/db1/binomial__calculate_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/db1/binomial__calculate_8cpp.html" target="_self">binomial_calculate.cpp</a></td><td class="desc">Program to calculate <a href="https://en.wikipedia.org/wiki/Binomial_coefficient" target="_blank">Binomial coefficients</a> </td></tr>
+<tr id="row_14_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/df6/check__amicable__pair_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d5/df6/check__amicable__pair_8cpp.html" target="_self">check_amicable_pair.cpp</a></td><td class="desc">A C++ Program to check whether a pair of numbers is an <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not </td></tr>
+<tr id="row_14_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/dd5/check__factorial_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/dd5/check__factorial_8cpp.html" target="_self">check_factorial.cpp</a></td><td class="desc">A simple program to check if the given number is a <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">factorial</a> of some number or not </td></tr>
+<tr id="row_14_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d93/check__prime_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="db/d93/check__prime_8cpp.html" target="_self">check_prime.cpp</a></td><td class="desc">A simple program to check if the given number is <a href="https://en.wikipedia.org/wiki/Primality_test" target="_blank">Prime</a> or not </td></tr>
+<tr id="row_14_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d67/complex__numbers_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d5/d67/complex__numbers_8cpp.html" target="_self">complex_numbers.cpp</a></td><td class="desc">An implementation of <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> Number as Objects </td></tr>
+<tr id="row_14_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d89/double__factorial_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d7/d89/double__factorial_8cpp.html" target="_self">double_factorial.cpp</a></td><td class="desc">Compute <a href="https://en.wikipedia.org/wiki/Double_factorial" target="_blank">double factorial</a>: \(n!!\) </td></tr>
+<tr id="row_14_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/da6/eratosthenes_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d7/da6/eratosthenes_8cpp.html" target="_self">eratosthenes.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes" target="_blank">The Sieve of Eratosthenes</a> </td></tr>
+<tr id="row_14_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d23/eulers__totient__function_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/d23/eulers__totient__function_8cpp.html" target="_self">eulers_totient_function.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Euler%27s_totient_function" target="_blank">Euler's Totient</a> @description Euler Totient Function is also known as phi function </td></tr>
+<tr id="row_14_13_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d5d/extended__euclid__algorithm_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html" target="_self">extended_euclid_algorithm.cpp</a></td><td class="desc">GCD using [extended Euclid's algorithm] (<a href="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm">https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm</a>) </td></tr>
+<tr id="row_14_14_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d00/factorial_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/d00/factorial_8cpp.html" target="_self">factorial.cpp</a></td><td class="desc">Find the <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">factorial</a> of a given number </td></tr>
+<tr id="row_14_15_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d0b/fast__power_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d2/d0b/fast__power_8cpp.html" target="_self">fast_power.cpp</a></td><td class="desc">Faster computation for \(a^b\) </td></tr>
+<tr id="row_14_16_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d89/fibonacci_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/d89/fibonacci_8cpp.html" target="_self">fibonacci.cpp</a></td><td class="desc">N-th <a href="https://en.wikipedia.org/wiki/Fibonacci_sequence" target="_blank">Fibonacci number</a> </td></tr>
+<tr id="row_14_17_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d32/fibonacci__fast_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d32/fibonacci__fast_8cpp.html" target="_self">fibonacci_fast.cpp</a></td><td class="desc">Faster computation of Fibonacci series </td></tr>
+<tr id="row_14_18_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/de4/fibonacci__large_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/de4/fibonacci__large_8cpp.html" target="_self">fibonacci_large.cpp</a></td><td class="desc">Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations </td></tr>
+<tr id="row_14_19_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/dc9/fibonacci__matrix__exponentiation_8cpp.html" target="_self">fibonacci_matrix_exponentiation.cpp</a></td><td class="desc">This program computes the N^th Fibonacci number in modulo mod input argument </td></tr>
+<tr id="row_14_20_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dc3/fibonacci__sum_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/dc3/fibonacci__sum_8cpp.html" target="_self">fibonacci_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of <a href="https://en.wikipedia.org/wiki/Fibonacci_number" target="_blank">Fibonacci Sequence</a>:  \(\mathrm{F}(n) +
 \mathrm{F}(n+1) + .. + \mathrm{F}(m)\) </td></tr>
-<tr id="row_14_20_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d46/finding__number__of__digits__in__a__number_8cpp.html" target="_self">finding_number_of_digits_in_a_number.cpp</a></td><td class="desc">[Program to count digits in an integer](<a href="https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods">https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods</a>) </td></tr>
-<tr id="row_14_21_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html" target="_self">gcd_iterative_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>iterative form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
-<tr id="row_14_22_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html" target="_self">gcd_of_n_numbers.cpp</a></td><td class="desc">This program aims at calculating the GCD of n numbers </td></tr>
-<tr id="row_14_23_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html" target="_self">gcd_recursive_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>recursive form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
-<tr id="row_14_24_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/de9/integral__approximation_8cpp.html" target="_self">integral_approximation.cpp</a></td><td class="desc">Compute integral approximation of the function using <a href="https://en.wikipedia.org/wiki/Riemann_sum" target="_blank">Riemann sum</a> </td></tr>
-<tr id="row_14_25_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d40/integral__approximation2_8cpp.html" target="_self">integral_approximation2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> </td></tr>
-<tr id="row_14_26_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/db8/inv__sqrt_8cpp.html" target="_self">inv_sqrt.cpp</a></td><td class="desc">Implementation of <a href="https://medium.com/hard-mode/the-legendary-fast-inverse-square-root-e51fee3b49d9" target="_blank">the inverse square root Root</a> </td></tr>
-<tr id="row_14_27_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d9f/iterative__factorial_8cpp.html" target="_self">iterative_factorial.cpp</a></td><td class="desc">Iterative implementation of <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">Factorial</a> </td></tr>
-<tr id="row_14_28_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d9d/large__factorial_8cpp.html" target="_self">large_factorial.cpp</a></td><td class="desc">Compute factorial of any arbitratily large number/ </td></tr>
-<tr id="row_14_29_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d86/large__number_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d86/large__number_8h.html" target="_self">large_number.h</a></td><td class="desc">Library to perform arithmatic operations on arbitrarily large numbers </td></tr>
-<tr id="row_14_30_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d7a/largest__power_8cpp.html" target="_self">largest_power.cpp</a></td><td class="desc">Algorithm to find largest x such that p^x divides n! (factorial) using Legendre's Formula </td></tr>
-<tr id="row_14_31_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d83/lcm__sum_8cpp.html" target="_self">lcm_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of LCM:  \(\mathrm{LCM}(1,n) +
+<tr id="row_14_21_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d0/d46/finding__number__of__digits__in__a__number_8cpp.html" target="_self">finding_number_of_digits_in_a_number.cpp</a></td><td class="desc">[Program to count digits in an integer](<a href="https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods">https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods</a>) </td></tr>
+<tr id="row_14_22_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/da0/gcd__iterative__euclidean_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html" target="_self">gcd_iterative_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>iterative form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
+<tr id="row_14_23_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d11/gcd__of__n__numbers_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html" target="_self">gcd_of_n_numbers.cpp</a></td><td class="desc">This program aims at calculating the GCD of n numbers </td></tr>
+<tr id="row_14_24_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d45/gcd__recursive__euclidean_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html" target="_self">gcd_recursive_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>recursive form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
+<tr id="row_14_25_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/de9/integral__approximation_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d1/de9/integral__approximation_8cpp.html" target="_self">integral_approximation.cpp</a></td><td class="desc">Compute integral approximation of the function using <a href="https://en.wikipedia.org/wiki/Riemann_sum" target="_blank">Riemann sum</a> </td></tr>
+<tr id="row_14_26_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d40/integral__approximation2_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="db/d40/integral__approximation2_8cpp.html" target="_self">integral_approximation2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> </td></tr>
+<tr id="row_14_27_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/db8/inv__sqrt_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/db8/inv__sqrt_8cpp.html" target="_self">inv_sqrt.cpp</a></td><td class="desc">Implementation of <a href="https://medium.com/hard-mode/the-legendary-fast-inverse-square-root-e51fee3b49d9" target="_blank">the inverse square root Root</a> </td></tr>
+<tr id="row_14_28_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d9f/iterative__factorial_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="db/d9f/iterative__factorial_8cpp.html" target="_self">iterative_factorial.cpp</a></td><td class="desc">Iterative implementation of <a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">Factorial</a> </td></tr>
+<tr id="row_14_29_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d9d/large__factorial_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/d9d/large__factorial_8cpp.html" target="_self">large_factorial.cpp</a></td><td class="desc">Compute factorial of any arbitratily large number/ </td></tr>
+<tr id="row_14_30_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d86/large__number_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d86/large__number_8h.html" target="_self">large_number.h</a></td><td class="desc">Library to perform arithmatic operations on arbitrarily large numbers </td></tr>
+<tr id="row_14_31_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d7a/largest__power_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d5/d7a/largest__power_8cpp.html" target="_self">largest_power.cpp</a></td><td class="desc">Algorithm to find largest x such that p^x divides n! (factorial) using Legendre's Formula </td></tr>
+<tr id="row_14_32_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d83/lcm__sum_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d5/d83/lcm__sum_8cpp.html" target="_self">lcm_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of LCM:  \(\mathrm{LCM}(1,n) +
 \mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\) </td></tr>
-<tr id="row_14_32_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d21/least__common__multiple_8cpp.html" target="_self">least_common_multiple.cpp</a></td><td class="desc"></td></tr>
-<tr id="row_14_33_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d44/magic__number_8cpp.html" target="_self">magic_number.cpp</a></td><td class="desc">A simple program to check if the given number is a magic number or not. A number is said to be a magic number, if the sum of its digits are calculated till a single digit recursively by adding the sum of the digits after every addition. If the single digit comes out to be 1,then the number is a magic number </td></tr>
-<tr id="row_14_34_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d42/miller__rabin_8cpp.html" target="_self">miller_rabin.cpp</a></td><td class="desc"></td></tr>
-<tr id="row_14_35_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d72/modular__division_8cpp.html" target="_self">modular_division.cpp</a></td><td class="desc">An algorithm to divide two numbers under modulo p <a href="https://www.geeksforgeeks.org/modular-division" target="_blank">Modular Division</a> </td></tr>
-<tr id="row_14_36_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d6d/modular__exponentiation_8cpp.html" target="_self">modular_exponentiation.cpp</a></td><td class="desc">C++ Program for Modular Exponentiation Iteratively </td></tr>
-<tr id="row_14_37_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html" target="_self">modular_inverse_fermat_little_theorem.cpp</a></td><td class="desc">C++ Program to find the modular inverse using <a href="https://en.wikipedia.org/wiki/Fermat%27s_little_theorem" target="_blank">Fermat's Little Theorem</a> </td></tr>
-<tr id="row_14_38_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d2d/modular__inverse__simple_8cpp.html" target="_self">modular_inverse_simple.cpp</a></td><td class="desc">Simple implementation of <a href="https://en.wikipedia.org/wiki/Modular_multiplicative_inverse" target="_blank">modular multiplicative inverse</a> </td></tr>
-<tr id="row_14_39_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d27/n__bonacci_8cpp.html" target="_self">n_bonacci.cpp</a></td><td class="desc">Implementation of the <a href="http://oeis.org/wiki/N-bonacci_numbers" target="_blank">N-bonacci</a> series </td></tr>
-<tr id="row_14_40_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/dbb/n__choose__r_8cpp.html" target="_self">n_choose_r.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Combination" target="_blank">Combinations</a> n choose r function implementation </td></tr>
-<tr id="row_14_41_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dab/ncr__modulo__p_8cpp.html" target="_self">ncr_modulo_p.cpp</a></td><td class="desc">This program aims at calculating <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a> </td></tr>
-<tr id="row_14_42_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html" target="_self">number_of_positive_divisors.cpp</a></td><td class="desc">C++ Program to calculate the number of positive divisors </td></tr>
-<tr id="row_14_43_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/dfe/perimeter_8cpp.html" target="_self">perimeter.cpp</a></td><td class="desc">Implementations for the <a href="https://en.wikipedia.org/wiki/Perimeter" target="_blank">perimeter</a> of various shapes </td></tr>
-<tr id="row_14_44_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/def/power__for__huge__numbers_8cpp.html" target="_self">power_for_huge_numbers.cpp</a></td><td class="desc">Compute powers of large numbers </td></tr>
-<tr id="row_14_45_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d38/power__of__two_8cpp.html" target="_self">power_of_two.cpp</a></td><td class="desc">Implementation to check whether a number is a power of 2 or not </td></tr>
-<tr id="row_14_46_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d0d/prime__factorization_8cpp.html" target="_self">prime_factorization.cpp</a></td><td class="desc">Prime factorization of positive integers </td></tr>
-<tr id="row_14_47_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d9b/prime__numbers_8cpp.html" target="_self">prime_numbers.cpp</a></td><td class="desc">Get list of prime numbers </td></tr>
-<tr id="row_14_48_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html" target="_self">primes_up_to_billion.cpp</a></td><td class="desc">Compute prime numbers upto 1 billion </td></tr>
-<tr id="row_14_49_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d18/quadratic__equations__complex__numbers_8cpp.html" target="_self">quadratic_equations_complex_numbers.cpp</a></td><td class="desc">Calculate quadratic equation with complex roots, i.e. b^2 - 4ac &lt; 0 </td></tr>
-<tr id="row_14_50_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d08/realtime__stats_8cpp.html" target="_self">realtime_stats.cpp</a></td><td class="desc">Compute statistics for data entered in rreal-time </td></tr>
-<tr id="row_14_51_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html" target="_self">sieve_of_eratosthenes.cpp</a></td><td class="desc">Prime Numbers using <a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes" target="_blank">Sieve of Eratosthenes</a> </td></tr>
-<tr id="row_14_52_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d24/sqrt__double_8cpp.html" target="_self">sqrt_double.cpp</a></td><td class="desc">Calculate the square root of any positive real number in  \(O(\log
+<tr id="row_14_33_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d21/least__common__multiple_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d21/least__common__multiple_8cpp.html" target="_self">least_common_multiple.cpp</a></td><td class="desc"></td></tr>
+<tr id="row_14_34_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d52/linear__recurrence__matrix_8cpp_source.html"><span class="icondoc"></span></a><b>linear_recurrence_matrix.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_14_35_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d44/magic__number_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/d44/magic__number_8cpp.html" target="_self">magic_number.cpp</a></td><td class="desc">A simple program to check if the given number is a magic number or not. A number is said to be a magic number, if the sum of its digits are calculated till a single digit recursively by adding the sum of the digits after every addition. If the single digit comes out to be 1,then the number is a magic number </td></tr>
+<tr id="row_14_36_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d42/miller__rabin_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/d42/miller__rabin_8cpp.html" target="_self">miller_rabin.cpp</a></td><td class="desc"></td></tr>
+<tr id="row_14_37_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d72/modular__division_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/d72/modular__division_8cpp.html" target="_self">modular_division.cpp</a></td><td class="desc">An algorithm to divide two numbers under modulo p <a href="https://www.geeksforgeeks.org/modular-division" target="_blank">Modular Division</a> </td></tr>
+<tr id="row_14_38_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d6d/modular__exponentiation_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d0/d6d/modular__exponentiation_8cpp.html" target="_self">modular_exponentiation.cpp</a></td><td class="desc">C++ Program for Modular Exponentiation Iteratively </td></tr>
+<tr id="row_14_39_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html" target="_self">modular_inverse_fermat_little_theorem.cpp</a></td><td class="desc">C++ Program to find the modular inverse using <a href="https://en.wikipedia.org/wiki/Fermat%27s_little_theorem" target="_blank">Fermat's Little Theorem</a> </td></tr>
+<tr id="row_14_40_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d2d/modular__inverse__simple_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/d2d/modular__inverse__simple_8cpp.html" target="_self">modular_inverse_simple.cpp</a></td><td class="desc">Simple implementation of <a href="https://en.wikipedia.org/wiki/Modular_multiplicative_inverse" target="_blank">modular multiplicative inverse</a> </td></tr>
+<tr id="row_14_41_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d27/n__bonacci_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="db/d27/n__bonacci_8cpp.html" target="_self">n_bonacci.cpp</a></td><td class="desc">Implementation of the <a href="http://oeis.org/wiki/N-bonacci_numbers" target="_blank">N-bonacci</a> series </td></tr>
+<tr id="row_14_42_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/dbb/n__choose__r_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d1/dbb/n__choose__r_8cpp.html" target="_self">n_choose_r.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Combination" target="_blank">Combinations</a> n choose r function implementation </td></tr>
+<tr id="row_14_43_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dab/ncr__modulo__p_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/dab/ncr__modulo__p_8cpp.html" target="_self">ncr_modulo_p.cpp</a></td><td class="desc">This program aims at calculating <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a> </td></tr>
+<tr id="row_14_44_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/da2/number__of__positive__divisors_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html" target="_self">number_of_positive_divisors.cpp</a></td><td class="desc">C++ Program to calculate the number of positive divisors </td></tr>
+<tr id="row_14_45_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/dfe/perimeter_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/dfe/perimeter_8cpp.html" target="_self">perimeter.cpp</a></td><td class="desc">Implementations for the <a href="https://en.wikipedia.org/wiki/Perimeter" target="_blank">perimeter</a> of various shapes </td></tr>
+<tr id="row_14_46_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/def/power__for__huge__numbers_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/def/power__for__huge__numbers_8cpp.html" target="_self">power_for_huge_numbers.cpp</a></td><td class="desc">Compute powers of large numbers </td></tr>
+<tr id="row_14_47_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d38/power__of__two_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d38/power__of__two_8cpp.html" target="_self">power_of_two.cpp</a></td><td class="desc">Implementation to check whether a number is a power of 2 or not </td></tr>
+<tr id="row_14_48_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d0d/prime__factorization_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="db/d0d/prime__factorization_8cpp.html" target="_self">prime_factorization.cpp</a></td><td class="desc">Prime factorization of positive integers </td></tr>
+<tr id="row_14_49_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d9b/prime__numbers_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/d9b/prime__numbers_8cpp.html" target="_self">prime_numbers.cpp</a></td><td class="desc">Get list of prime numbers </td></tr>
+<tr id="row_14_50_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d9c/primes__up__to__billion_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html" target="_self">primes_up_to_billion.cpp</a></td><td class="desc">Compute prime numbers upto 1 billion </td></tr>
+<tr id="row_14_51_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d18/quadratic__equations__complex__numbers_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/d18/quadratic__equations__complex__numbers_8cpp.html" target="_self">quadratic_equations_complex_numbers.cpp</a></td><td class="desc">Calculate quadratic equation with complex roots, i.e. b^2 - 4ac &lt; 0 </td></tr>
+<tr id="row_14_52_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d08/realtime__stats_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d0/d08/realtime__stats_8cpp.html" target="_self">realtime_stats.cpp</a></td><td class="desc">Compute statistics for data entered in rreal-time </td></tr>
+<tr id="row_14_53_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/ddf/sieve__of__eratosthenes_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html" target="_self">sieve_of_eratosthenes.cpp</a></td><td class="desc">Prime Numbers using <a href="https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes" target="_blank">Sieve of Eratosthenes</a> </td></tr>
+<tr id="row_14_54_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d24/sqrt__double_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/d24/sqrt__double_8cpp.html" target="_self">sqrt_double.cpp</a></td><td class="desc">Calculate the square root of any positive real number in  \(O(\log
 N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bisection_method" target="_blank">bisection method</a> of root-finding </td></tr>
-<tr id="row_14_53_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d47/string__fibonacci_8cpp.html" target="_self">string_fibonacci.cpp</a></td><td class="desc">This Programme returns the Nth fibonacci as a string </td></tr>
-<tr id="row_14_54_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d9d/sum__of__binomial__coefficient_8cpp.html" target="_self">sum_of_binomial_coefficient.cpp</a></td><td class="desc">Algorithm to find sum of binomial coefficients of a given positive integer </td></tr>
-<tr id="row_14_55_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d83/sum__of__digits_8cpp.html" target="_self">sum_of_digits.cpp</a></td><td class="desc">A C++ Program to find the Sum of Digits of input integer </td></tr>
-<tr id="row_14_56_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d66/vector__cross__product_8cpp.html" target="_self">vector_cross_product.cpp</a></td><td class="desc">Calculates the <a href="https://en.wikipedia.org/wiki/Cross_product" target="_blank">Cross Product</a> and the magnitude of two mathematical 3D vectors </td></tr>
-<tr id="row_14_57_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d39/volume_8cpp.html" target="_self">volume.cpp</a></td><td class="desc">Implmentations for the <a href="https://en.wikipedia.org/wiki/Volume" target="_blank">volume</a> of various 3D shapes </td></tr>
+<tr id="row_14_55_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d47/string__fibonacci_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/d47/string__fibonacci_8cpp.html" target="_self">string_fibonacci.cpp</a></td><td class="desc">This Programme returns the Nth fibonacci as a string </td></tr>
+<tr id="row_14_56_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d9d/sum__of__binomial__coefficient_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d9d/sum__of__binomial__coefficient_8cpp.html" target="_self">sum_of_binomial_coefficient.cpp</a></td><td class="desc">Algorithm to find sum of binomial coefficients of a given positive integer </td></tr>
+<tr id="row_14_57_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d83/sum__of__digits_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d83/sum__of__digits_8cpp.html" target="_self">sum_of_digits.cpp</a></td><td class="desc">A C++ Program to find the Sum of Digits of input integer </td></tr>
+<tr id="row_14_58_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d66/vector__cross__product_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/d66/vector__cross__product_8cpp.html" target="_self">vector_cross_product.cpp</a></td><td class="desc">Calculates the <a href="https://en.wikipedia.org/wiki/Cross_product" target="_blank">Cross Product</a> and the magnitude of two mathematical 3D vectors </td></tr>
+<tr id="row_14_59_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d39/volume_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/d39/volume_8cpp.html" target="_self">volume.cpp</a></td><td class="desc">Implmentations for the <a href="https://en.wikipedia.org/wiki/Volume" target="_blank">volume</a> of various 3D shapes </td></tr>
 <tr id="row_15_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_15_" class="arrow" onclick="dynsection.toggleFolder('15_')">&#9658;</span><span id="img_15_" class="iconfclosed" onclick="dynsection.toggleFolder('15_')">&#160;</span><a class="el" href="dir_9c6faab82c22511b50177aa2e38e2780.html" target="_self">numerical_methods</a></td><td class="desc"></td></tr>
-<tr id="row_15_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d9c/babylonian__method_8cpp.html" target="_self">babylonian_method.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Babylonian_method" target="_blank">A babylonian method (BM)</a> is an algorithm that computes the square root </td></tr>
-<tr id="row_15_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d6a/bisection__method_8cpp.html" target="_self">bisection_method.cpp</a></td><td class="desc">Solve the equation \(f(x)=0\) using <a href="https://en.wikipedia.org/wiki/Bisection_method" target="_blank">bisection method</a> </td></tr>
-<tr id="row_15_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d01/brent__method__extrema_8cpp.html" target="_self">brent_method_extrema.cpp</a></td><td class="desc">Find real extrema of a univariate real function in a given interval using <a href="https://en.wikipedia.org/wiki/Brent%27s_method" target="_blank">Brent's method</a> </td></tr>
-<tr id="row_15_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d18/composite__simpson__rule_8cpp.html" target="_self">composite_simpson_rule.cpp</a></td><td class="desc">Implementation of the Composite Simpson Rule for the approximation </td></tr>
-<tr id="row_15_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/df2/durand__kerner__roots_8cpp.html" target="_self">durand_kerner_roots.cpp</a></td><td class="desc">Compute all possible approximate roots of any given polynomial using <a href="https://en.wikipedia.org/wiki/Durand%E2%80%93Kerner_method" target="_blank">Durand Kerner algorithm</a> </td></tr>
-<tr id="row_15_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d29/false__position_8cpp.html" target="_self">false_position.cpp</a></td><td class="desc">Solve the equation \(f(x)=0\) using <a href="https://en.wikipedia.org/wiki/Regula_falsi" target="_blank">false position method</a>, also known as the Secant method </td></tr>
-<tr id="row_15_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d9a/fast__fourier__transform_8cpp.html" target="_self">fast_fourier_transform.cpp</a></td><td class="desc"><a href="https://medium.com/@aiswaryamathur/understanding-fast-fouriertransform-from-scratch-to-solve-polynomial-multiplication-8018d511162f" target="_blank">A fast Fourier transform (FFT)</a> is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT) </td></tr>
-<tr id="row_15_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/de2/gaussian__elimination_8cpp.html" target="_self">gaussian_elimination.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Gaussian_elimination" target="_blank">Gaussian elimination method</a> </td></tr>
-<tr id="row_15_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d7a/golden__search__extrema_8cpp.html" target="_self">golden_search_extrema.cpp</a></td><td class="desc">Find extrema of a univariate real function in a given interval using <a href="https://en.wikipedia.org/wiki/Golden-section_search" target="_blank">golden section search algorithm</a> </td></tr>
-<tr id="row_15_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d33/gram__schmidt_8cpp.html" target="_self">gram_schmidt.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process" target="_blank">Gram Schmidt Orthogonalisation Process</a> </td></tr>
-<tr id="row_15_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d37/inverse__fast__fourier__transform_8cpp.html" target="_self">inverse_fast_fourier_transform.cpp</a></td><td class="desc"><a href="https://www.geeksforgeeks.org/python-inverse-fast-fourier-transformation/" target="_blank">An inverse fast Fourier transform (IFFT)</a> is an algorithm that computes the inverse fourier transform </td></tr>
-<tr id="row_15_11_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d65/lu__decompose_8cpp.html" target="_self">lu_decompose.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/LU_decompositon" target="_blank">LU decomposition</a> of a square matrix </td></tr>
+<tr id="row_15_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d9c/babylonian__method_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dc/d9c/babylonian__method_8cpp.html" target="_self">babylonian_method.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Babylonian_method" target="_blank">A babylonian method (BM)</a> is an algorithm that computes the square root </td></tr>
+<tr id="row_15_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d6a/bisection__method_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d7/d6a/bisection__method_8cpp.html" target="_self">bisection_method.cpp</a></td><td class="desc">Solve the equation \(f(x)=0\) using <a href="https://en.wikipedia.org/wiki/Bisection_method" target="_blank">bisection method</a> </td></tr>
+<tr id="row_15_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d01/brent__method__extrema_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="db/d01/brent__method__extrema_8cpp.html" target="_self">brent_method_extrema.cpp</a></td><td class="desc">Find real extrema of a univariate real function in a given interval using <a href="https://en.wikipedia.org/wiki/Brent%27s_method" target="_blank">Brent's method</a> </td></tr>
+<tr id="row_15_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d18/composite__simpson__rule_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d18/composite__simpson__rule_8cpp.html" target="_self">composite_simpson_rule.cpp</a></td><td class="desc">Implementation of the Composite Simpson Rule for the approximation </td></tr>
+<tr id="row_15_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/df2/durand__kerner__roots_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/df2/durand__kerner__roots_8cpp.html" target="_self">durand_kerner_roots.cpp</a></td><td class="desc">Compute all possible approximate roots of any given polynomial using <a href="https://en.wikipedia.org/wiki/Durand%E2%80%93Kerner_method" target="_blank">Durand Kerner algorithm</a> </td></tr>
+<tr id="row_15_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/d29/false__position_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dd/d29/false__position_8cpp.html" target="_self">false_position.cpp</a></td><td class="desc">Solve the equation \(f(x)=0\) using <a href="https://en.wikipedia.org/wiki/Regula_falsi" target="_blank">false position method</a>, also known as the Secant method </td></tr>
+<tr id="row_15_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d9a/fast__fourier__transform_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/d9a/fast__fourier__transform_8cpp.html" target="_self">fast_fourier_transform.cpp</a></td><td class="desc"><a href="https://medium.com/@aiswaryamathur/understanding-fast-fouriertransform-from-scratch-to-solve-polynomial-multiplication-8018d511162f" target="_blank">A fast Fourier transform (FFT)</a> is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT) </td></tr>
+<tr id="row_15_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/de2/gaussian__elimination_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d0/de2/gaussian__elimination_8cpp.html" target="_self">gaussian_elimination.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Gaussian_elimination" target="_blank">Gaussian elimination method</a> </td></tr>
+<tr id="row_15_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d7a/golden__search__extrema_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/d7a/golden__search__extrema_8cpp.html" target="_self">golden_search_extrema.cpp</a></td><td class="desc">Find extrema of a univariate real function in a given interval using <a href="https://en.wikipedia.org/wiki/Golden-section_search" target="_blank">golden section search algorithm</a> </td></tr>
+<tr id="row_15_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d33/gram__schmidt_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d5/d33/gram__schmidt_8cpp.html" target="_self">gram_schmidt.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process" target="_blank">Gram Schmidt Orthogonalisation Process</a> </td></tr>
+<tr id="row_15_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d37/inverse__fast__fourier__transform_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/d37/inverse__fast__fourier__transform_8cpp.html" target="_self">inverse_fast_fourier_transform.cpp</a></td><td class="desc"><a href="https://www.geeksforgeeks.org/python-inverse-fast-fourier-transformation/" target="_blank">An inverse fast Fourier transform (IFFT)</a> is an algorithm that computes the inverse fourier transform </td></tr>
+<tr id="row_15_11_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/d65/lu__decompose_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dd/d65/lu__decompose_8cpp.html" target="_self">lu_decompose.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/LU_decompositon" target="_blank">LU decomposition</a> of a square matrix </td></tr>
 <tr id="row_15_12_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/dbe/lu__decomposition_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d1/dbe/lu__decomposition_8h.html" target="_self">lu_decomposition.h</a></td><td class="desc">Functions associated with <a href="https://en.wikipedia.org/wiki/LU_decomposition" target="_blank">LU Decomposition</a> of a square matrix </td></tr>
-<tr id="row_15_13_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d11/midpoint__integral__method_8cpp.html" target="_self">midpoint_integral_method.cpp</a></td><td class="desc">A numerical method for easy <a href="https://en.wikipedia.org/wiki/Midpoint_method" target="_blank">approximation of integrals</a> </td></tr>
-<tr id="row_15_14_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dd3/newton__raphson__method_8cpp.html" target="_self">newton_raphson_method.cpp</a></td><td class="desc">Solve the equation \(f(x)=0\) using <a href="https://en.wikipedia.org/wiki/Newton%27s_method" target="_blank">Newton-Raphson method</a> for both real and complex solutions </td></tr>
-<tr id="row_15_15_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/dd3/ode__forward__euler_8cpp.html" target="_self">ode_forward_euler.cpp</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Numerical_methods_for_ordinary_differential_equations#Euler_method" target="_blank">forward Euler method</a> </td></tr>
-<tr id="row_15_16_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/dd3/ode__midpoint__euler_8cpp.html" target="_self">ode_midpoint_euler.cpp</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Midpoint_method" target="_blank">midpoint Euler method</a> </td></tr>
-<tr id="row_15_17_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d06/ode__semi__implicit__euler_8cpp.html" target="_self">ode_semi_implicit_euler.cpp</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Semi-implicit_Euler_method" target="_blank">semi implicit Euler method</a> </td></tr>
+<tr id="row_15_13_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d11/midpoint__integral__method_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/d11/midpoint__integral__method_8cpp.html" target="_self">midpoint_integral_method.cpp</a></td><td class="desc">A numerical method for easy <a href="https://en.wikipedia.org/wiki/Midpoint_method" target="_blank">approximation of integrals</a> </td></tr>
+<tr id="row_15_14_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dd3/newton__raphson__method_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/dd3/newton__raphson__method_8cpp.html" target="_self">newton_raphson_method.cpp</a></td><td class="desc">Solve the equation \(f(x)=0\) using <a href="https://en.wikipedia.org/wiki/Newton%27s_method" target="_blank">Newton-Raphson method</a> for both real and complex solutions </td></tr>
+<tr id="row_15_15_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/dd3/ode__forward__euler_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="db/dd3/ode__forward__euler_8cpp.html" target="_self">ode_forward_euler.cpp</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Numerical_methods_for_ordinary_differential_equations#Euler_method" target="_blank">forward Euler method</a> </td></tr>
+<tr id="row_15_16_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/dd3/ode__midpoint__euler_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/dd3/ode__midpoint__euler_8cpp.html" target="_self">ode_midpoint_euler.cpp</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Midpoint_method" target="_blank">midpoint Euler method</a> </td></tr>
+<tr id="row_15_17_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d06/ode__semi__implicit__euler_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/d06/ode__semi__implicit__euler_8cpp.html" target="_self">ode_semi_implicit_euler.cpp</a></td><td class="desc">Solve a multivariable first order <a href="https://en.wikipedia.org/wiki/Ordinary_differential_equation" target="_blank">ordinary differential equation (ODEs)</a> using <a href="https://en.wikipedia.org/wiki/Semi-implicit_Euler_method" target="_blank">semi implicit Euler method</a> </td></tr>
 <tr id="row_15_18_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d68/qr__decompose_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d68/qr__decompose_8h.html" target="_self">qr_decompose.h</a></td><td class="desc">Library functions to compute <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> of a given matrix </td></tr>
-<tr id="row_15_19_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d24/qr__decomposition_8cpp.html" target="_self">qr_decomposition.cpp</a></td><td class="desc">Program to compute the <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> of a given matrix </td></tr>
-<tr id="row_15_20_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d75/qr__eigen__values_8cpp.html" target="_self">qr_eigen_values.cpp</a></td><td class="desc">Compute real eigen values and eigen vectors of a symmetric matrix using <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> method </td></tr>
-<tr id="row_15_21_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/da6/rungekutta_8cpp.html" target="_self">rungekutta.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods" target="_blank">Runge Kutta fourth order</a> method implementation </td></tr>
-<tr id="row_15_22_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/dc8/successive__approximation_8cpp.html" target="_self">successive_approximation.cpp</a></td><td class="desc">Method of successive approximations using <a href="https://en.wikipedia.org/wiki/Fixed-point_iteration" target="_blank">fixed-point iteration</a> method </td></tr>
+<tr id="row_15_19_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d24/qr__decomposition_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/d24/qr__decomposition_8cpp.html" target="_self">qr_decomposition.cpp</a></td><td class="desc">Program to compute the <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> of a given matrix </td></tr>
+<tr id="row_15_20_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d75/qr__eigen__values_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/d75/qr__eigen__values_8cpp.html" target="_self">qr_eigen_values.cpp</a></td><td class="desc">Compute real eigen values and eigen vectors of a symmetric matrix using <a href="https://en.wikipedia.org/wiki/QR_decomposition" target="_blank">QR decomposition</a> method </td></tr>
+<tr id="row_15_21_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/da6/rungekutta_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d1/da6/rungekutta_8cpp.html" target="_self">rungekutta.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods" target="_blank">Runge Kutta fourth order</a> method implementation </td></tr>
+<tr id="row_15_22_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/dc8/successive__approximation_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/dc8/successive__approximation_8cpp.html" target="_self">successive_approximation.cpp</a></td><td class="desc">Method of successive approximations using <a href="https://en.wikipedia.org/wiki/Fixed-point_iteration" target="_blank">fixed-point iteration</a> method </td></tr>
 <tr id="row_16_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_16_" class="arrow" onclick="dynsection.toggleFolder('16_')">&#9658;</span><span id="img_16_" class="iconfclosed" onclick="dynsection.toggleFolder('16_')">&#160;</span><a class="el" href="dir_35422be6552f1b3672c1b6c4aba2da64.html" target="_self">operations_on_datastructures</a></td><td class="desc"></td></tr>
-<tr id="row_16_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d14/array__left__rotation_8cpp.html" target="_self">array_left_rotation.cpp</a></td><td class="desc">Implementation for the <a href="https://www.javatpoint.com/program-to-left-rotate-the-elements-of-an-array" target="_blank">Array Left Rotation</a> algorithm </td></tr>
-<tr id="row_16_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d57/array__right__rotation_8cpp.html" target="_self">array_right_rotation.cpp</a></td><td class="desc">Implementation for the <a href="https://www.javatpoint.com/program-to-right-rotate-the-elements-of-an-array" target="_blank">Array right Rotation</a> algorithm </td></tr>
-<tr id="row_16_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d33/circular__linked__list_8cpp.html" target="_self">circular_linked_list.cpp</a></td><td class="desc">Implementation for a <a href="https://www.geeksforgeeks.org/circular-linked-list/" target="_blank">Circular Linked List</a> </td></tr>
-<tr id="row_16_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d32/inorder__successor__of__bst_8cpp.html" target="_self">inorder_successor_of_bst.cpp</a></td><td class="desc">An implementation for finding the <a href="https://www.youtube.com/watch?v=5cPbNCrdotA" target="_blank">Inorder successor of a binary search tree</a> Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the last node in Inorder traversal </td></tr>
-<tr id="row_16_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dc5/intersection__of__two__arrays_8cpp.html" target="_self">intersection_of_two_arrays.cpp</a></td><td class="desc">Implementation for the <a href="https://en.wikipedia.org/wiki/Intersection_(set_theory)" target="_blank">Intersection of two sorted Arrays</a> algorithm </td></tr>
-<tr id="row_16_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/db6/reverse__binary__tree_8cpp.html" target="_self">reverse_binary_tree.cpp</a></td><td class="desc">Implementation for the <a href="https://www.geeksforgeeks.org/reverse-tree-path/" target="_blank">Reversing a Binary Tree</a> recursively algorithm </td></tr>
-<tr id="row_16_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/def/trie__multiple__search_8cpp.html" target="_self">trie_multiple_search.cpp</a></td><td class="desc"><a href="https://iq.opengenus.org/autocomplete-using-trie-data-structure/" target="_blank">Trie datastructure</a> with search variants </td></tr>
-<tr id="row_16_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d9c/union__of__two__arrays_8cpp.html" target="_self">union_of_two_arrays.cpp</a></td><td class="desc">Implementation for the <a href="https://en.wikipedia.org/wiki/Union_(set_theory)" target="_blank">Union of two sorted Arrays</a> algorithm </td></tr>
+<tr id="row_16_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d14/array__left__rotation_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/d14/array__left__rotation_8cpp.html" target="_self">array_left_rotation.cpp</a></td><td class="desc">Implementation for the <a href="https://www.javatpoint.com/program-to-left-rotate-the-elements-of-an-array" target="_blank">Array Left Rotation</a> algorithm </td></tr>
+<tr id="row_16_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d57/array__right__rotation_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/d57/array__right__rotation_8cpp.html" target="_self">array_right_rotation.cpp</a></td><td class="desc">Implementation for the <a href="https://www.javatpoint.com/program-to-right-rotate-the-elements-of-an-array" target="_blank">Array right Rotation</a> algorithm </td></tr>
+<tr id="row_16_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d33/circular__linked__list_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/d33/circular__linked__list_8cpp.html" target="_self">circular_linked_list.cpp</a></td><td class="desc">Implementation for a <a href="https://www.geeksforgeeks.org/circular-linked-list/" target="_blank">Circular Linked List</a> </td></tr>
+<tr id="row_16_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/dfb/circular__queue__using__array_8cpp_source.html"><span class="icondoc"></span></a><b>circular_queue_using_array.cpp</b></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;">&#160;</span><a href="d7/dab/get__size__of__linked__list_8cpp_source.html"><span class="icondoc"></span></a><b>get_size_of_linked_list.cpp</b></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;">&#160;</span><a href="d4/d32/inorder__successor__of__bst_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d32/inorder__successor__of__bst_8cpp.html" target="_self">inorder_successor_of_bst.cpp</a></td><td class="desc">An implementation for finding the <a href="https://www.youtube.com/watch?v=5cPbNCrdotA" target="_blank">Inorder successor of a binary search tree</a> Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the last node in Inorder traversal </td></tr>
+<tr id="row_16_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dc5/intersection__of__two__arrays_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/dc5/intersection__of__two__arrays_8cpp.html" target="_self">intersection_of_two_arrays.cpp</a></td><td class="desc">Implementation for the <a href="https://en.wikipedia.org/wiki/Intersection_(set_theory)" target="_blank">Intersection of two sorted Arrays</a> algorithm </td></tr>
+<tr id="row_16_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d30/reverse__a__linked__list__using__recusion_8cpp_source.html"><span class="icondoc"></span></a><b>reverse_a_linked_list_using_recusion.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_16_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/db6/reverse__binary__tree_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/db6/reverse__binary__tree_8cpp.html" target="_self">reverse_binary_tree.cpp</a></td><td class="desc">Implementation for the <a href="https://www.geeksforgeeks.org/reverse-tree-path/" target="_blank">Reversing a Binary Tree</a> recursively algorithm </td></tr>
+<tr id="row_16_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/dcc/selectionsortlinkedlist_8cpp_source.html"><span class="icondoc"></span></a><b>selectionsortlinkedlist.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_16_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/def/trie__multiple__search_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d7/def/trie__multiple__search_8cpp.html" target="_self">trie_multiple_search.cpp</a></td><td class="desc"><a href="https://iq.opengenus.org/autocomplete-using-trie-data-structure/" target="_blank">Trie datastructure</a> with search variants </td></tr>
+<tr id="row_16_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d9c/union__of__two__arrays_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/d9c/union__of__two__arrays_8cpp.html" target="_self">union_of_two_arrays.cpp</a></td><td class="desc">Implementation for the <a href="https://en.wikipedia.org/wiki/Union_(set_theory)" target="_blank">Union of two sorted Arrays</a> algorithm </td></tr>
 <tr id="row_17_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_17_" class="arrow" onclick="dynsection.toggleFolder('17_')">&#9658;</span><span id="img_17_" class="iconfclosed" onclick="dynsection.toggleFolder('17_')">&#160;</span><a class="el" href="dir_9510827d0b234b3cc54b29892f217477.html" target="_self">others</a></td><td class="desc"></td></tr>
-<tr id="row_17_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d76/buzz__number_8cpp.html" target="_self">buzz_number.cpp</a></td><td class="desc">A buzz number is a number that is either divisible by 7 or has last digit as 7 </td></tr>
-<tr id="row_17_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d06/decimal__to__binary_8cpp.html" target="_self">decimal_to_binary.cpp</a></td><td class="desc">Function to convert decimal number to binary representation </td></tr>
-<tr id="row_17_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/de7/decimal__to__hexadecimal_8cpp.html" target="_self">decimal_to_hexadecimal.cpp</a></td><td class="desc">Convert decimal number to hexadecimal representation </td></tr>
-<tr id="row_17_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html" target="_self">decimal_to_roman_numeral.cpp</a></td><td class="desc">This Programme Converts a given decimal number in the range [0,4000) to both Lower case and Upper case Roman Numeral </td></tr>
-<tr id="row_17_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/df0/fast__integer__input_8cpp.html" target="_self">fast_integer_input.cpp</a></td><td class="desc">Read integers from stdin continuously as they are entered without waiting for the <code>\n</code> character </td></tr>
-<tr id="row_17_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/df3/happy__number_8cpp.html" target="_self">happy_number.cpp</a></td><td class="desc">A happy number is a number whose sum of digits is calculated until the sum is a single digit, and this sum turns out to be 1 </td></tr>
-<tr id="row_17_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d90/iterative__tree__traversals_8cpp.html" target="_self">iterative_tree_traversals.cpp</a></td><td class="desc">Iterative version of Preorder, Postorder, and preorder [Traversal of the Tree] (<a href="https://en.wikipedia.org/wiki/Tree_traversal">https://en.wikipedia.org/wiki/Tree_traversal</a>) </td></tr>
-<tr id="row_17_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dcd/kadanes3_8cpp.html" target="_self">kadanes3.cpp</a></td><td class="desc">Efficient implementation for maximum contiguous subarray sum by <a href="https://www.geeksforgeeks.org/largest-sum-contiguous-subarray/" target="_blank">Kadane's algorithm</a> </td></tr>
-<tr id="row_17_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html" target="_self">kelvin_to_celsius.cpp</a></td><td class="desc">Conversion from <a href="https://byjus.com/chemistry/kelvin-to-celsius/" target="_blank">Kelvin to Celsius</a> degrees </td></tr>
-<tr id="row_17_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d65/lfu__cache_8cpp.html" target="_self">lfu_cache.cpp</a></td><td class="desc">Implementation for [LFU Cache] (<a href="https://en.wikipedia.org/wiki/Least_frequently_used">https://en.wikipedia.org/wiki/Least_frequently_used</a>) </td></tr>
-<tr id="row_17_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/db8/longest__substring__without__repeating__characters_8cpp.html" target="_self">longest_substring_without_repeating_characters.cpp</a></td><td class="desc"><a class="el" href="dd/d4f/class_solution.html">Solution</a> for Longest Substring Without Repeating Characters problem </td></tr>
-<tr id="row_17_11_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/db3/lru__cache_8cpp.html" target="_self">lru_cache.cpp</a></td><td class="desc">An implementation of <a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU)" target="_blank">LRU Cache</a>. Lru is a part of cache algorithms (also frequently called cache replacement algorithms or cache replacement policies) </td></tr>
-<tr id="row_17_12_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/daa/lru__cache2_8cpp.html" target="_self">lru_cache2.cpp</a></td><td class="desc">Implementation for [LRU Cache] (<a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Least%20Recently%20Used%20(LRU)">https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Least%20Recently%20Used%20(LRU)</a>) </td></tr>
-<tr id="row_17_13_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d35/matrix__exponentiation_8cpp.html" target="_self">matrix_exponentiation.cpp</a></td><td class="desc">Matrix Exponentiation </td></tr>
-<tr id="row_17_14_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d9a/palindrome__of__number_8cpp.html" target="_self">palindrome_of_number.cpp</a></td><td class="desc">Check if a number is <a href="https://en.wikipedia.org/wiki/Palindrome" target="_blank">palindrome</a> or not </td></tr>
-<tr id="row_17_15_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/dc5/paranthesis__matching_8cpp.html" target="_self">paranthesis_matching.cpp</a></td><td class="desc">Perform paranthesis matching </td></tr>
-<tr id="row_17_16_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d1a/pascal__triangle_8cpp.html" target="_self">pascal_triangle.cpp</a></td><td class="desc">Pascal's triangle implementation </td></tr>
-<tr id="row_17_17_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d75/postfix__evaluation_8cpp.html" target="_self">postfix_evaluation.cpp</a></td><td class="desc">Evaluation of <a href="https://en.wikipedia.org/wiki/Reverse_Polish_notation" target="_blank">Postfix Expression</a> </td></tr>
-<tr id="row_17_18_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d7b/primality__test_8cpp.html" target="_self">primality_test.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Primality_test" target="_blank">Primality test</a> implementation </td></tr>
-<tr id="row_17_19_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html" target="_self">recursive_tree_traversal.cpp</a></td><td class="desc">Recursive version of Inorder, Preorder, and Postorder [Traversal of the Tree] (<a href="https://en.wikipedia.org/wiki/Tree_traversal">https://en.wikipedia.org/wiki/Tree_traversal</a>) </td></tr>
-<tr id="row_17_20_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d01/smallest__circle_8cpp.html" target="_self">smallest_circle.cpp</a></td><td class="desc">Get centre and radius of the <a href="https://en.wikipedia.org/wiki/Smallest-circle_problem" target="_blank">smallest circle</a> that circumscribes given set of points </td></tr>
-<tr id="row_17_21_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d19/sparse__matrix_8cpp.html" target="_self">sparse_matrix.cpp</a></td><td class="desc"></td></tr>
-<tr id="row_17_22_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d07/spiral__print_8cpp.html" target="_self">spiral_print.cpp</a></td><td class="desc">Print the elements of a matrix traversing it spirally </td></tr>
-<tr id="row_17_23_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/def/stairs__pattern_8cpp.html" target="_self">stairs_pattern.cpp</a></td><td class="desc">This program is use to print the following pattern </td></tr>
-<tr id="row_17_24_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d3c/tower__of__hanoi_8cpp.html" target="_self">tower_of_hanoi.cpp</a></td><td class="desc">Solve the <a href="https://en.wikipedia.org/wiki/Tower_of_Hanoi" target="_blank">Tower of Hanoi</a> problem </td></tr>
-<tr id="row_17_25_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d61/vector__important__functions_8cpp.html" target="_self">vector_important_functions.cpp</a></td><td class="desc">A C++ program to demonstrate working of <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/sort.html">std::sort()</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse()</a> </td></tr>
+<tr id="row_17_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d76/buzz__number_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d1/d76/buzz__number_8cpp.html" target="_self">buzz_number.cpp</a></td><td class="desc">A buzz number is a number that is either divisible by 7 or has last digit as 7 </td></tr>
+<tr id="row_17_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d06/decimal__to__binary_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/d06/decimal__to__binary_8cpp.html" target="_self">decimal_to_binary.cpp</a></td><td class="desc">Function to convert decimal number to binary representation </td></tr>
+<tr id="row_17_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/de7/decimal__to__hexadecimal_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/de7/decimal__to__hexadecimal_8cpp.html" target="_self">decimal_to_hexadecimal.cpp</a></td><td class="desc">Convert decimal number to hexadecimal representation </td></tr>
+<tr id="row_17_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d85/decimal__to__roman__numeral_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html" target="_self">decimal_to_roman_numeral.cpp</a></td><td class="desc">This Programme Converts a given decimal number in the range [0,4000) to both Lower case and Upper case Roman Numeral </td></tr>
+<tr id="row_17_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d4e/easter_8cpp_source.html"><span class="icondoc"></span></a><b>easter.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_17_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/df0/fast__integer__input_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/df0/fast__integer__input_8cpp.html" target="_self">fast_integer_input.cpp</a></td><td class="desc">Read integers from stdin continuously as they are entered without waiting for the <code>\n</code> character </td></tr>
+<tr id="row_17_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/df3/happy__number_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="db/df3/happy__number_8cpp.html" target="_self">happy_number.cpp</a></td><td class="desc">A happy number is a number whose sum of digits is calculated until the sum is a single digit, and this sum turns out to be 1 </td></tr>
+<tr id="row_17_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d90/iterative__tree__traversals_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/d90/iterative__tree__traversals_8cpp.html" target="_self">iterative_tree_traversals.cpp</a></td><td class="desc">Iterative version of Preorder, Postorder, and preorder [Traversal of the Tree] (<a href="https://en.wikipedia.org/wiki/Tree_traversal">https://en.wikipedia.org/wiki/Tree_traversal</a>) </td></tr>
+<tr id="row_17_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/dcd/kadanes3_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/dcd/kadanes3_8cpp.html" target="_self">kadanes3.cpp</a></td><td class="desc">Efficient implementation for maximum contiguous subarray sum by <a href="https://www.geeksforgeeks.org/largest-sum-contiguous-subarray/" target="_blank">Kadane's algorithm</a> </td></tr>
+<tr id="row_17_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d6b/kelvin__to__celsius_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html" target="_self">kelvin_to_celsius.cpp</a></td><td class="desc">Conversion from <a href="https://byjus.com/chemistry/kelvin-to-celsius/" target="_blank">Kelvin to Celsius</a> degrees </td></tr>
+<tr id="row_17_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d65/lfu__cache_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/d65/lfu__cache_8cpp.html" target="_self">lfu_cache.cpp</a></td><td class="desc">Implementation for [LFU Cache] (<a href="https://en.wikipedia.org/wiki/Least_frequently_used">https://en.wikipedia.org/wiki/Least_frequently_used</a>) </td></tr>
+<tr id="row_17_11_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/db8/longest__substring__without__repeating__characters_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/db8/longest__substring__without__repeating__characters_8cpp.html" target="_self">longest_substring_without_repeating_characters.cpp</a></td><td class="desc"><a class="el" href="dd/d4f/class_solution.html">Solution</a> for Longest Substring Without Repeating Characters problem </td></tr>
+<tr id="row_17_12_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/db3/lru__cache_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/db3/lru__cache_8cpp.html" target="_self">lru_cache.cpp</a></td><td class="desc">An implementation of <a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU)" target="_blank">LRU Cache</a>. Lru is a part of cache algorithms (also frequently called cache replacement algorithms or cache replacement policies) </td></tr>
+<tr id="row_17_13_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/daa/lru__cache2_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dc/daa/lru__cache2_8cpp.html" target="_self">lru_cache2.cpp</a></td><td class="desc">Implementation for [LRU Cache] (<a href="https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Least%20Recently%20Used%20(LRU)">https://en.wikipedia.org/wiki/Cache_replacement_policies#:~:text=Least%20Recently%20Used%20(LRU)</a>) </td></tr>
+<tr id="row_17_14_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d35/matrix__exponentiation_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d7/d35/matrix__exponentiation_8cpp.html" target="_self">matrix_exponentiation.cpp</a></td><td class="desc">Matrix Exponentiation </td></tr>
+<tr id="row_17_15_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d9a/palindrome__of__number_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/d9a/palindrome__of__number_8cpp.html" target="_self">palindrome_of_number.cpp</a></td><td class="desc">Check if a number is <a href="https://en.wikipedia.org/wiki/Palindrome" target="_blank">palindrome</a> or not </td></tr>
+<tr id="row_17_16_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/dc5/paranthesis__matching_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dc/dc5/paranthesis__matching_8cpp.html" target="_self">paranthesis_matching.cpp</a></td><td class="desc">Perform paranthesis matching </td></tr>
+<tr id="row_17_17_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/d1a/pascal__triangle_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dc/d1a/pascal__triangle_8cpp.html" target="_self">pascal_triangle.cpp</a></td><td class="desc">Pascal's triangle implementation </td></tr>
+<tr id="row_17_18_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/d75/postfix__evaluation_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d7/d75/postfix__evaluation_8cpp.html" target="_self">postfix_evaluation.cpp</a></td><td class="desc">Evaluation of <a href="https://en.wikipedia.org/wiki/Reverse_Polish_notation" target="_blank">Postfix Expression</a> </td></tr>
+<tr id="row_17_19_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="da/d7b/primality__test_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="da/d7b/primality__test_8cpp.html" target="_self">primality_test.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Primality_test" target="_blank">Primality test</a> implementation </td></tr>
+<tr id="row_17_20_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/de1/recursive__tree__traversal_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html" target="_self">recursive_tree_traversal.cpp</a></td><td class="desc">Recursive version of Inorder, Preorder, and Postorder [Traversal of the Tree] (<a href="https://en.wikipedia.org/wiki/Tree_traversal">https://en.wikipedia.org/wiki/Tree_traversal</a>) </td></tr>
+<tr id="row_17_21_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/d01/smallest__circle_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d0/d01/smallest__circle_8cpp.html" target="_self">smallest_circle.cpp</a></td><td class="desc">Get centre and radius of the <a href="https://en.wikipedia.org/wiki/Smallest-circle_problem" target="_blank">smallest circle</a> that circumscribes given set of points </td></tr>
+<tr id="row_17_22_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d19/sparse__matrix_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/d19/sparse__matrix_8cpp.html" target="_self">sparse_matrix.cpp</a></td><td class="desc"></td></tr>
+<tr id="row_17_23_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d07/spiral__print_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="db/d07/spiral__print_8cpp.html" target="_self">spiral_print.cpp</a></td><td class="desc">Print the elements of a matrix traversing it spirally </td></tr>
+<tr id="row_17_24_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/def/stairs__pattern_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d5/def/stairs__pattern_8cpp.html" target="_self">stairs_pattern.cpp</a></td><td class="desc">This program is use to print the following pattern </td></tr>
+<tr id="row_17_25_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d3c/tower__of__hanoi_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="db/d3c/tower__of__hanoi_8cpp.html" target="_self">tower_of_hanoi.cpp</a></td><td class="desc">Solve the <a href="https://en.wikipedia.org/wiki/Tower_of_Hanoi" target="_blank">Tower of Hanoi</a> problem </td></tr>
+<tr id="row_17_26_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d61/vector__important__functions_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/d61/vector__important__functions_8cpp.html" target="_self">vector_important_functions.cpp</a></td><td class="desc">A C++ program to demonstrate working of std::sort(), std::reverse() </td></tr>
 <tr id="row_18_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_18_" class="arrow" onclick="dynsection.toggleFolder('18_')">&#9658;</span><span id="img_18_" class="iconfclosed" onclick="dynsection.toggleFolder('18_')">&#160;</span><a class="el" href="dir_59dc24c326e2a72d1164f014b22de83d.html" target="_self">physics</a></td><td class="desc"></td></tr>
-<tr id="row_18_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d29/ground__to__ground__projectile__motion_8cpp.html" target="_self">ground_to_ground_projectile_motion.cpp</a></td><td class="desc">Ground to ground <a href="https://en.wikipedia.org/wiki/Projectile_motion" target="_blank">projectile motion</a> equation implementations </td></tr>
+<tr id="row_18_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d29/ground__to__ground__projectile__motion_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/d29/ground__to__ground__projectile__motion_8cpp.html" target="_self">ground_to_ground_projectile_motion.cpp</a></td><td class="desc">Ground to ground <a href="https://en.wikipedia.org/wiki/Projectile_motion" target="_blank">projectile motion</a> equation implementations </td></tr>
 <tr id="row_19_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_19_" class="arrow" onclick="dynsection.toggleFolder('19_')">&#9658;</span><span id="img_19_" class="iconfclosed" onclick="dynsection.toggleFolder('19_')">&#160;</span><a class="el" href="dir_82e494173a87936756866de2fa774307.html" target="_self">probability</a></td><td class="desc"></td></tr>
-<tr id="row_19_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d4a/addition__rule_8cpp.html" target="_self">addition_rule.cpp</a></td><td class="desc">Addition rule of probabilities </td></tr>
-<tr id="row_19_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d67/bayes__theorem_8cpp.html" target="_self">bayes_theorem.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Bayes%27_theorem" target="_blank">Bayes' theorem</a> </td></tr>
-<tr id="row_19_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/db0/binomial__dist_8cpp.html" target="_self">binomial_dist.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Binomial_distribution" target="_blank">Binomial distribution</a> example </td></tr>
-<tr id="row_19_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/da2/exponential__dist_8cpp.html" target="_self">exponential_dist.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Exponential_distribution" target="_blank">Exponential Distribution</a> </td></tr>
-<tr id="row_19_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d72/geometric__dist_8cpp.html" target="_self">geometric_dist.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Geometric_distribution" target="_blank">Geometric Distribution</a> </td></tr>
-<tr id="row_19_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d24/poisson__dist_8cpp.html" target="_self">poisson_dist.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Poisson_distribution" target="_blank">Poisson statistics</a> </td></tr>
-<tr id="row_19_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/ded/windowed__median_8cpp.html" target="_self">windowed_median.cpp</a></td><td class="desc">An implementation of a median calculation of a sliding window along a data stream </td></tr>
+<tr id="row_19_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d4a/addition__rule_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/d4a/addition__rule_8cpp.html" target="_self">addition_rule.cpp</a></td><td class="desc">Addition rule of probabilities </td></tr>
+<tr id="row_19_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d67/bayes__theorem_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d5/d67/bayes__theorem_8cpp.html" target="_self">bayes_theorem.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Bayes%27_theorem" target="_blank">Bayes' theorem</a> </td></tr>
+<tr id="row_19_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/db0/binomial__dist_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/db0/binomial__dist_8cpp.html" target="_self">binomial_dist.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Binomial_distribution" target="_blank">Binomial distribution</a> example </td></tr>
+<tr id="row_19_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/da2/exponential__dist_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/da2/exponential__dist_8cpp.html" target="_self">exponential_dist.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Exponential_distribution" target="_blank">Exponential Distribution</a> </td></tr>
+<tr id="row_19_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d72/geometric__dist_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/d72/geometric__dist_8cpp.html" target="_self">geometric_dist.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Geometric_distribution" target="_blank">Geometric Distribution</a> </td></tr>
+<tr id="row_19_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d24/poisson__dist_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/d24/poisson__dist_8cpp.html" target="_self">poisson_dist.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Poisson_distribution" target="_blank">Poisson statistics</a> </td></tr>
+<tr id="row_19_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/ded/windowed__median_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d1/ded/windowed__median_8cpp.html" target="_self">windowed_median.cpp</a></td><td class="desc">An implementation of a median calculation of a sliding window along a data stream </td></tr>
 <tr id="row_20_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_20_" class="arrow" onclick="dynsection.toggleFolder('20_')">&#9658;</span><span id="img_20_" class="iconfclosed" onclick="dynsection.toggleFolder('20_')">&#160;</span><a class="el" href="dir_074119ce3a874b57120c49a0cc4bb5ad.html" target="_self">range_queries</a></td><td class="desc"></td></tr>
-<tr id="row_20_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d2e/fenwick__tree_8cpp.html" target="_self">fenwick_tree.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Fenwick_tree" target="_blank">Fenwick Tree</a> algorithm implementation </td></tr>
-<tr id="row_20_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/de9/heavy__light__decomposition_8cpp.html" target="_self">heavy_light_decomposition.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Heavy_path_decomposition" target="_blank">Heavy Light Decomposition</a> implementation </td></tr>
-<tr id="row_20_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d58/persistent__seg__tree__lazy__prop_8cpp.html" target="_self">persistent_seg_tree_lazy_prop.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Persistent_data_structure" target="_blank">Persistent segment tree with range updates (lazy propagation)</a> </td></tr>
-<tr id="row_20_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d9e/prefix__sum__array_8cpp.html" target="_self">prefix_sum_array.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Prefix_sum" target="_blank">Prefix Sum Array</a> data structure implementation </td></tr>
-<tr id="row_20_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d45/segtree_8cpp.html" target="_self">segtree.cpp</a></td><td class="desc">Implementation of [Segment Tree] (<a href="https://en.wikipedia.org/wiki/Segment_tree">https://en.wikipedia.org/wiki/Segment_tree</a>) data structure </td></tr>
-<tr id="row_21_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_21_" class="arrow" onclick="dynsection.toggleFolder('21_')">&#9658;</span><span id="img_21_" class="iconfclosed" onclick="dynsection.toggleFolder('21_')">&#160;</span><a class="el" href="dir_19b2bf9199a15c634a08b1ede1dd896a.html" target="_self">search</a></td><td class="desc"></td></tr>
-<tr id="row_21_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d8a/exponential__search_8cpp.html" target="_self">exponential_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Exponential_search" target="_blank">Exponential search algorithm</a> </td></tr>
-<tr id="row_21_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d0d/fibonacci__search_8cpp.html" target="_self">fibonacci_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Fibonacci_search_technique" target="_blank">Fibonacci search algorithm</a> </td></tr>
-<tr id="row_21_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/dc4/floyd__cycle__detection__algo_8cpp.html" target="_self">floyd_cycle_detection_algo.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Cycle_detection" target="_blank">Floyd's Cycle Detection</a> algorithm </td></tr>
-<tr id="row_21_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/df3/hash__search_8cpp.html" target="_self">hash_search.cpp</a></td><td class="desc">Hash Search Algorithm - Best Time Complexity Ω(1) </td></tr>
-<tr id="row_21_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d39/interpolation__search2_8cpp.html" target="_self">interpolation_search2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Interpolation_search" target="_blank">Interpolation search</a> algorithm </td></tr>
-<tr id="row_21_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d22/jump__search_8cpp.html" target="_self">jump_search.cpp</a></td><td class="desc">C++ program to implement <a href="https://en.wikipedia.org/wiki/Jump_search" target="_blank">Jump Search</a> </td></tr>
-<tr id="row_21_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d02/linear__search_8cpp.html" target="_self">linear_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Linear_search" target="_blank">Linear search algorithm</a> </td></tr>
-<tr id="row_21_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html" target="_self">longest_increasing_subsequence_using_binary_search.cpp</a></td><td class="desc">Find the length of the Longest Increasing Subsequence (LIS) using <a href="https://en.wikipedia.org/wiki/Longest_increasing_subsequence" target="_blank">Binary Search</a> </td></tr>
-<tr id="row_21_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d69/median__search_8cpp.html" target="_self">median_search.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Median_of_medians" target="_blank">Median search</a> algorithm. @cases from <a href="https://brilliant.org/wiki/median-finding-algorithm/" target="_blank">here</a> </td></tr>
-<tr id="row_21_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/dfa/median__search2_8cpp.html" target="_self">median_search2.cpp</a></td><td class="desc">Given a linked list L[0,....,n] of n numbers, find the middle node </td></tr>
-<tr id="row_21_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d22/saddleback__search_8cpp.html" target="_self">saddleback_search.cpp</a></td><td class="desc">Implementation of <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a> for 2D arrays </td></tr>
-<tr id="row_21_11_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d45/sublist__search_8cpp.html" target="_self">sublist_search.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list" target="_blank">Sublist Search Algorithm</a> </td></tr>
-<tr id="row_21_12_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/dfe/ternary__search_8cpp.html" target="_self">ternary_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Ternary_search" target="_blank">Ternary search</a> algorithm </td></tr>
-<tr id="row_21_13_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/db5/text__search_8cpp.html" target="_self">text_search.cpp</a></td><td class="desc">Search for words in a long textual paragraph </td></tr>
-<tr id="row_22_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_22_" class="arrow" onclick="dynsection.toggleFolder('22_')">&#9658;</span><span id="img_22_" class="iconfclosed" onclick="dynsection.toggleFolder('22_')">&#160;</span><a class="el" href="dir_bb1b521853a9c46347182a9d10420771.html" target="_self">sorting</a></td><td class="desc"></td></tr>
-<tr id="row_22_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/dcc/binary__insertion__sort_8cpp.html" target="_self">binary_insertion_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Insertion_sort" target="_blank">Binary Insertion Sort Algorithm (Insertion Sort)</a> </td></tr>
-<tr id="row_22_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/ddb/bogo__sort_8cpp.html" target="_self">bogo_sort.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Bogosort" target="_blank">Bogosort algorithm</a> </td></tr>
-<tr id="row_22_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d13/bubble__sort_8cpp.html" target="_self">bubble_sort.cpp</a></td><td class="desc">Bubble sort algorithm </td></tr>
-<tr id="row_22_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/dfd/comb__sort_8cpp.html" target="_self">comb_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Comb_sort" target="_blank">Comb Sort Algorithm (Comb Sort)</a> </td></tr>
-<tr id="row_22_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d26/count__inversions_8cpp.html" target="_self">count_inversions.cpp</a></td><td class="desc">Counting Inversions using <a href="https://en.wikipedia.org/wiki/Merge_sort" target="_blank">Merge Sort</a> </td></tr>
-<tr id="row_22_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d07/cycle__sort_8cpp.html" target="_self">cycle_sort.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Cycle_sort" target="_blank">Cycle sort</a> algorithm </td></tr>
-<tr id="row_22_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d1a/dnf__sort_8cpp.html" target="_self">dnf_sort.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/sort-an-array-of-0s-1s-and-2s/" target="_blank">DNF sort</a> implementation </td></tr>
-<tr id="row_22_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d21/gnome__sort_8cpp.html" target="_self">gnome_sort.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Gnome_sort" target="_blank">gnome sort</a> algorithm </td></tr>
-<tr id="row_22_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d52/heap__sort_8cpp.html" target="_self">heap_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Heapsort" target="_blank">Heap Sort Algorithm (heap sort)</a> implementation </td></tr>
-<tr id="row_22_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d0d/insertion__sort_8cpp.html" target="_self">insertion_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Insertion_sort" target="_blank">Insertion Sort Algorithm (Insertion Sort)</a> </td></tr>
-<tr id="row_22_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d89/insertion__sort__recursive_8cpp.html" target="_self">insertion_sort_recursive.cpp</a></td><td class="desc">Insertion Sort Algorithm </td></tr>
-<tr id="row_22_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d7b/merge__insertion__sort_8cpp.html" target="_self">merge_insertion_sort.cpp</a></td><td class="desc">Algorithm that combines insertion sort and merge sort. <a href="https://en.wikipedia.org/wiki/Merge-insertion_sort" target="_blank">Wiki link</a> </td></tr>
-<tr id="row_22_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/df4/merge__sort_8cpp.html" target="_self">merge_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Merge_sort" target="_blank">Merege Sort Algorithm (MEREGE SORT)</a> implementation </td></tr>
-<tr id="row_22_13_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/db6/non__recursive__merge__sort_8cpp.html" target="_self">non_recursive_merge_sort.cpp</a></td><td class="desc"></td></tr>
-<tr id="row_22_14_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d92/pancake__sort_8cpp.html" target="_self">pancake_sort.cpp</a></td><td class="desc">Pancake sort sorts a disordered stack of pancakes by flipping any number of pancakes using a spatula using minimum number of flips </td></tr>
-<tr id="row_22_15_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/da8/pigeonhole__sort_8cpp.html" target="_self">pigeonhole_sort.cpp</a></td><td class="desc">Implementation of [Pigeonhole Sort algorithm] (<a href="https://en.wikipedia.org/wiki/Pigeonhole_sort">https://en.wikipedia.org/wiki/Pigeonhole_sort</a>) </td></tr>
-<tr id="row_22_16_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d21/quick__sort_8cpp.html" target="_self">quick_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Quicksort" target="_blank">Quick sort implementation</a> in C++ </td></tr>
-<tr id="row_22_17_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d4c/quick__sort__3_8cpp.html" target="_self">quick_sort_3.cpp</a></td><td class="desc">Implementation Details </td></tr>
-<tr id="row_22_18_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d22/quick__sort__iterative_8cpp.html" target="_self">quick_sort_iterative.cpp</a></td><td class="desc">Quick Sort without recursion. This method uses the stack instead. Both recursive and iterative implementations have O(n log n) best case and O(n^2) worst case </td></tr>
-<tr id="row_22_19_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d61/radix__sort2_8cpp.html" target="_self">radix_sort2.cpp</a></td><td class="desc">Algorithm of <a href="https://en.wikipedia.org/wiki/Radix_sort" target="_blank">Radix sort</a> </td></tr>
-<tr id="row_22_20_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/daa/random__pivot__quick__sort_8cpp.html" target="_self">random_pivot_quick_sort.cpp</a></td><td class="desc">Implementation of the <a href="https://www.sanfoundry.com/cpp-program-implement-quick-sort-using-randomisation" target="_blank">Random Pivot Quick Sort</a> algorithm </td></tr>
-<tr id="row_22_21_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/df9/recursive__bubble__sort_8cpp.html" target="_self">recursive_bubble_sort.cpp</a></td><td class="desc">This is an implementation of a recursive version of the <a href="https://www.geeksforgeeks.org/recursive-bubble-sort/" target="_blank">Bubble sort algorithm</a> </td></tr>
-<tr id="row_22_22_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d9f/selection__sort__recursive_8cpp.html" target="_self">selection_sort_recursive.cpp</a></td><td class="desc">Implementation of the <a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection sort</a> implementation using recursion </td></tr>
-<tr id="row_22_23_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d7a/shell__sort2_8cpp.html" target="_self">shell_sort2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Shell_sort" target="_blank">Shell sort</a> algorithm </td></tr>
-<tr id="row_22_24_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d4f/stooge__sort_8cpp.html" target="_self">stooge_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Stooge_sort" target="_blank">Stooge sort implementation</a> in C++ </td></tr>
-<tr id="row_22_25_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/dd9/strand__sort_8cpp.html" target="_self">strand_sort.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Strand_sort" target="_blank">Strand Sort</a> algorithm </td></tr>
-<tr id="row_22_26_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d3f/wave__sort_8cpp.html" target="_self">wave_sort.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/sort-array-wave-form-2/" target="_blank">Wave sort</a> algorithm </td></tr>
-<tr id="row_22_27_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/dcc/wiggle__sort_8cpp.html" target="_self">wiggle_sort.cpp</a></td><td class="desc">[Wiggle Sort Algorithm] (<a href="https://leetcode.com/problems/wiggle-sort-ii/">https://leetcode.com/problems/wiggle-sort-ii/</a>) Implementation </td></tr>
-<tr id="row_23_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_23_" class="arrow" onclick="dynsection.toggleFolder('23_')">&#9658;</span><span id="img_23_" class="iconfclosed" onclick="dynsection.toggleFolder('23_')">&#160;</span><a class="el" href="dir_73a3cc5065b223eb41b02873c0e19f0e.html" target="_self">strings</a></td><td class="desc"></td></tr>
-<tr id="row_23_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/db2/boyer__moore_8cpp.html" target="_self">boyer_moore.cpp</a></td><td class="desc">The <a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm" target="_blank">Boyer–Moore</a> algorithm searches for occurrences of pattern P in text T by performing explicit character comparisons at different alignments. Instead of a brute-force search of all alignments (of which there are n - m + 1), Boyer–Moore uses information gained by preprocessing P to skip as many alignments as possible </td></tr>
-<tr id="row_23_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html" target="_self">brute_force_string_searching.cpp</a></td><td class="desc">String pattern search - brute force </td></tr>
-<tr id="row_23_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d09/duval_8cpp.html" target="_self">duval.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Lyndon_word" target="_blank">Duval's algorithm</a> </td></tr>
-<tr id="row_23_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/dfe/horspool_8cpp.html" target="_self">horspool.cpp</a></td><td class="desc">Horspool's algorithm that finds if a string contains a substring (<a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm">https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm</a>) </td></tr>
-<tr id="row_23_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html" target="_self">knuth_morris_pratt.cpp</a></td><td class="desc">The <a href="https://en.wikipedia.org/wiki/Knuth–Morris–Pratt_algorithm" target="_blank">Knuth-Morris-Pratt Algorithm</a> for finding a pattern within a piece of text with complexity O(n + m) </td></tr>
-<tr id="row_23_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d39/manacher__algorithm_8cpp.html" target="_self">manacher_algorithm.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Longest_palindromic_substring" target="_blank">Manacher's Algorithm</a> </td></tr>
-<tr id="row_23_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/dce/rabin__karp_8cpp.html" target="_self">rabin_karp.cpp</a></td><td class="desc">The <a href="https://en.wikipedia.org/wiki/Rabin–Karp_algorithm" target="_blank">Rabin-Karp Algorithm</a> for finding a pattern within a piece of text with complexity O(n + m) </td></tr>
-<tr id="row_23_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d80/z__function_8cpp.html" target="_self">z_function.cpp</a></td><td class="desc">The <a href="https://cp-algorithms.com/string/z-function.html" target="_blank">Z function</a> for finding occurences of a pattern within a piece of text with time and space complexity O(n + m) </td></tr>
+<tr id="row_20_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d2e/fenwick__tree_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/d2e/fenwick__tree_8cpp.html" target="_self">fenwick_tree.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Fenwick_tree" target="_blank">Fenwick Tree</a> algorithm implementation </td></tr>
+<tr id="row_20_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/de9/heavy__light__decomposition_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d2/de9/heavy__light__decomposition_8cpp.html" target="_self">heavy_light_decomposition.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Heavy_path_decomposition" target="_blank">Heavy Light Decomposition</a> implementation </td></tr>
+<tr id="row_20_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d53/mo_8cpp_source.html"><span class="icondoc"></span></a><b>mo.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_20_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d5/d58/persistent__seg__tree__lazy__prop_8cpp.html" target="_self">persistent_seg_tree_lazy_prop.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Persistent_data_structure" target="_blank">Persistent segment tree with range updates (lazy propagation)</a> </td></tr>
+<tr id="row_20_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d9e/prefix__sum__array_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d1/d9e/prefix__sum__array_8cpp.html" target="_self">prefix_sum_array.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Prefix_sum" target="_blank">Prefix Sum Array</a> data structure implementation </td></tr>
+<tr id="row_20_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d45/segtree_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d2/d45/segtree_8cpp.html" target="_self">segtree.cpp</a></td><td class="desc">Implementation of [Segment Tree] (<a href="https://en.wikipedia.org/wiki/Segment_tree">https://en.wikipedia.org/wiki/Segment_tree</a>) data structure </td></tr>
+<tr id="row_20_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d96/sparse__table__range__queries_8cpp_source.html"><span class="icondoc"></span></a><b>sparse_table_range_queries.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_21_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_21_" class="arrow" onclick="dynsection.toggleFolder('21_')">&#9658;</span><span id="img_21_" class="iconfclosed" onclick="dynsection.toggleFolder('21_')">&#160;</span><a class="el" href="dir_53e6fa9553ac22a5646d2a2b2d7b97a1.html" target="_self">scripts</a></td><td class="desc"></td></tr>
+<tr id="row_21_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d02/file__linter_8py_source.html"><span class="icondoc"></span></a><b>file_linter.py</b></td><td class="desc"></td></tr>
+<tr id="row_22_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_22_" class="arrow" onclick="dynsection.toggleFolder('22_')">&#9658;</span><span id="img_22_" class="iconfclosed" onclick="dynsection.toggleFolder('22_')">&#160;</span><a class="el" href="dir_19b2bf9199a15c634a08b1ede1dd896a.html" target="_self">search</a></td><td class="desc"></td></tr>
+<tr id="row_22_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/dd5/binary__search_8cpp_source.html"><span class="icondoc"></span></a><b>binary_search.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_22_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d8a/exponential__search_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/d8a/exponential__search_8cpp.html" target="_self">exponential_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Exponential_search" target="_blank">Exponential search algorithm</a> </td></tr>
+<tr id="row_22_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d0d/fibonacci__search_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/d0d/fibonacci__search_8cpp.html" target="_self">fibonacci_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Fibonacci_search_technique" target="_blank">Fibonacci search algorithm</a> </td></tr>
+<tr id="row_22_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/dc4/floyd__cycle__detection__algo_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="db/dc4/floyd__cycle__detection__algo_8cpp.html" target="_self">floyd_cycle_detection_algo.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Cycle_detection" target="_blank">Floyd's Cycle Detection</a> algorithm </td></tr>
+<tr id="row_22_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/df3/hash__search_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d1/df3/hash__search_8cpp.html" target="_self">hash_search.cpp</a></td><td class="desc">Hash Search Algorithm - Best Time Complexity Ω(1) </td></tr>
+<tr id="row_22_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/dd7/interpolation__search_8cpp_source.html"><span class="icondoc"></span></a><b>interpolation_search.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_22_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="df/d39/interpolation__search2_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="df/d39/interpolation__search2_8cpp.html" target="_self">interpolation_search2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Interpolation_search" target="_blank">Interpolation search</a> algorithm </td></tr>
+<tr id="row_22_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d22/jump__search_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d2/d22/jump__search_8cpp.html" target="_self">jump_search.cpp</a></td><td class="desc">C++ program to implement <a href="https://en.wikipedia.org/wiki/Jump_search" target="_blank">Jump Search</a> </td></tr>
+<tr id="row_22_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d02/linear__search_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/d02/linear__search_8cpp.html" target="_self">linear_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Linear_search" target="_blank">Linear search algorithm</a> </td></tr>
+<tr id="row_22_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html" target="_self">longest_increasing_subsequence_using_binary_search.cpp</a></td><td class="desc">Find the length of the Longest Increasing Subsequence (LIS) using <a href="https://en.wikipedia.org/wiki/Longest_increasing_subsequence" target="_blank">Binary Search</a> </td></tr>
+<tr id="row_22_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d69/median__search_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/d69/median__search_8cpp.html" target="_self">median_search.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Median_of_medians" target="_blank">Median search</a> algorithm. @cases from <a href="https://brilliant.org/wiki/median-finding-algorithm/" target="_blank">here</a> </td></tr>
+<tr id="row_22_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/dfa/median__search2_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/dfa/median__search2_8cpp.html" target="_self">median_search2.cpp</a></td><td class="desc">Given a linked list L[0,....,n] of n numbers, find the middle node </td></tr>
+<tr id="row_22_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d22/saddleback__search_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/d22/saddleback__search_8cpp.html" target="_self">saddleback_search.cpp</a></td><td class="desc">Implementation of <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a> for 2D arrays </td></tr>
+<tr id="row_22_13_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d45/sublist__search_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d5/d45/sublist__search_8cpp.html" target="_self">sublist_search.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list" target="_blank">Sublist Search Algorithm</a> </td></tr>
+<tr id="row_22_14_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/dfe/ternary__search_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dc/dfe/ternary__search_8cpp.html" target="_self">ternary_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Ternary_search" target="_blank">Ternary search</a> algorithm </td></tr>
+<tr id="row_22_15_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/db5/text__search_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dc/db5/text__search_8cpp.html" target="_self">text_search.cpp</a></td><td class="desc">Search for words in a long textual paragraph </td></tr>
+<tr id="row_23_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_23_" class="arrow" onclick="dynsection.toggleFolder('23_')">&#9658;</span><span id="img_23_" class="iconfclosed" onclick="dynsection.toggleFolder('23_')">&#160;</span><a class="el" href="dir_bb1b521853a9c46347182a9d10420771.html" target="_self">sorting</a></td><td class="desc"></td></tr>
+<tr id="row_23_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d25/bead__sort_8cpp_source.html"><span class="icondoc"></span></a><b>bead_sort.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_23_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/dcc/binary__insertion__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/dcc/binary__insertion__sort_8cpp.html" target="_self">binary_insertion_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Insertion_sort" target="_blank">Binary Insertion Sort Algorithm (Insertion Sort)</a> </td></tr>
+<tr id="row_23_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d8f/bitonic__sort_8cpp_source.html"><span class="icondoc"></span></a><b>bitonic_sort.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_23_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/ddb/bogo__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d5/ddb/bogo__sort_8cpp.html" target="_self">bogo_sort.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Bogosort" target="_blank">Bogosort algorithm</a> </td></tr>
+<tr id="row_23_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d13/bubble__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/d13/bubble__sort_8cpp.html" target="_self">bubble_sort.cpp</a></td><td class="desc">Bubble sort algorithm </td></tr>
+<tr id="row_23_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/dc1/bucket__sort_8cpp_source.html"><span class="icondoc"></span></a><b>bucket_sort.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_23_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/dd2/cocktail__selection__sort_8cpp_source.html"><span class="icondoc"></span></a><b>cocktail_selection_sort.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_23_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/dfd/comb__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d9/dfd/comb__sort_8cpp.html" target="_self">comb_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Comb_sort" target="_blank">Comb Sort Algorithm (Comb Sort)</a> </td></tr>
+<tr id="row_23_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d26/count__inversions_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d2/d26/count__inversions_8cpp.html" target="_self">count_inversions.cpp</a></td><td class="desc">Counting Inversions using <a href="https://en.wikipedia.org/wiki/Merge_sort" target="_blank">Merge Sort</a> </td></tr>
+<tr id="row_23_9_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d40/counting__sort_8cpp_source.html"><span class="icondoc"></span></a><b>counting_sort.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_23_10_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/db2/counting__sort__string_8cpp_source.html"><span class="icondoc"></span></a><b>counting_sort_string.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_23_11_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d07/cycle__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/d07/cycle__sort_8cpp.html" target="_self">cycle_sort.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Cycle_sort" target="_blank">Cycle sort</a> algorithm </td></tr>
+<tr id="row_23_12_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d1a/dnf__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/d1a/dnf__sort_8cpp.html" target="_self">dnf_sort.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/sort-an-array-of-0s-1s-and-2s/" target="_blank">DNF sort</a> implementation </td></tr>
+<tr id="row_23_13_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d21/gnome__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d2/d21/gnome__sort_8cpp.html" target="_self">gnome_sort.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Gnome_sort" target="_blank">gnome sort</a> algorithm </td></tr>
+<tr id="row_23_14_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d2/d52/heap__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d2/d52/heap__sort_8cpp.html" target="_self">heap_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Heapsort" target="_blank">Heap Sort Algorithm (heap sort)</a> implementation </td></tr>
+<tr id="row_23_15_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/d0d/insertion__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dd/d0d/insertion__sort_8cpp.html" target="_self">insertion_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Insertion_sort" target="_blank">Insertion Sort Algorithm (Insertion Sort)</a> </td></tr>
+<tr id="row_23_16_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/d89/insertion__sort__recursive_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dd/d89/insertion__sort__recursive_8cpp.html" target="_self">insertion_sort_recursive.cpp</a></td><td class="desc">Insertion Sort Algorithm </td></tr>
+<tr id="row_23_17_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/d74/library__sort_8cpp_source.html"><span class="icondoc"></span></a><b>library_sort.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_23_18_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d7b/merge__insertion__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/d7b/merge__insertion__sort_8cpp.html" target="_self">merge_insertion_sort.cpp</a></td><td class="desc">Algorithm that combines insertion sort and merge sort. <a href="https://en.wikipedia.org/wiki/Merge-insertion_sort" target="_blank">Wiki link</a> </td></tr>
+<tr id="row_23_19_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/df4/merge__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d5/df4/merge__sort_8cpp.html" target="_self">merge_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Merge_sort" target="_blank">Merege Sort Algorithm (MEREGE SORT)</a> implementation </td></tr>
+<tr id="row_23_20_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d0/db6/non__recursive__merge__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d0/db6/non__recursive__merge__sort_8cpp.html" target="_self">non_recursive_merge_sort.cpp</a></td><td class="desc"></td></tr>
+<tr id="row_23_21_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/de3/numeric__string__sort_8cpp_source.html"><span class="icondoc"></span></a><b>numeric_string_sort.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_23_22_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/da9/odd__even__sort_8cpp_source.html"><span class="icondoc"></span></a><b>odd_even_sort.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_23_23_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d92/pancake__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/d92/pancake__sort_8cpp.html" target="_self">pancake_sort.cpp</a></td><td class="desc">Pancake sort sorts a disordered stack of pancakes by flipping any number of pancakes using a spatula using minimum number of flips </td></tr>
+<tr id="row_23_24_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/da8/pigeonhole__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dd/da8/pigeonhole__sort_8cpp.html" target="_self">pigeonhole_sort.cpp</a></td><td class="desc">Implementation of [Pigeonhole Sort algorithm] (<a href="https://en.wikipedia.org/wiki/Pigeonhole_sort">https://en.wikipedia.org/wiki/Pigeonhole_sort</a>) </td></tr>
+<tr id="row_23_25_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/d21/quick__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d1/d21/quick__sort_8cpp.html" target="_self">quick_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Quicksort" target="_blank">Quick sort implementation</a> in C++ </td></tr>
+<tr id="row_23_26_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d4c/quick__sort__3_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/d4c/quick__sort__3_8cpp.html" target="_self">quick_sort_3.cpp</a></td><td class="desc">Implementation Details </td></tr>
+<tr id="row_23_27_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d22/quick__sort__iterative_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/d22/quick__sort__iterative_8cpp.html" target="_self">quick_sort_iterative.cpp</a></td><td class="desc">Quick Sort without recursion. This method uses the stack instead. Both recursive and iterative implementations have O(n log n) best case and O(n^2) worst case </td></tr>
+<tr id="row_23_28_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d7c/radix__sort_8cpp_source.html"><span class="icondoc"></span></a><b>radix_sort.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_23_29_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d61/radix__sort2_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/d61/radix__sort2_8cpp.html" target="_self">radix_sort2.cpp</a></td><td class="desc">Algorithm of <a href="https://en.wikipedia.org/wiki/Radix_sort" target="_blank">Radix sort</a> </td></tr>
+<tr id="row_23_30_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/daa/random__pivot__quick__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d1/daa/random__pivot__quick__sort_8cpp.html" target="_self">random_pivot_quick_sort.cpp</a></td><td class="desc">Implementation of the <a href="https://www.sanfoundry.com/cpp-program-implement-quick-sort-using-randomisation" target="_blank">Random Pivot Quick Sort</a> algorithm </td></tr>
+<tr id="row_23_31_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/df9/recursive__bubble__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/df9/recursive__bubble__sort_8cpp.html" target="_self">recursive_bubble_sort.cpp</a></td><td class="desc">This is an implementation of a recursive version of the <a href="https://www.geeksforgeeks.org/recursive-bubble-sort/" target="_blank">Bubble sort algorithm</a> </td></tr>
+<tr id="row_23_32_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d9/d85/selection__sort__iterative_8cpp_source.html"><span class="icondoc"></span></a><b>selection_sort_iterative.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_23_33_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d9f/selection__sort__recursive_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d9f/selection__sort__recursive_8cpp.html" target="_self">selection_sort_recursive.cpp</a></td><td class="desc">Implementation of the <a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection sort</a> implementation using recursion </td></tr>
+<tr id="row_23_34_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d40/shell__sort_8cpp_source.html"><span class="icondoc"></span></a><b>shell_sort.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_23_35_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d7a/shell__sort2_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d7a/shell__sort2_8cpp.html" target="_self">shell_sort2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Shell_sort" target="_blank">Shell sort</a> algorithm </td></tr>
+<tr id="row_23_36_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/db5/slow__sort_8cpp_source.html"><span class="icondoc"></span></a><b>slow_sort.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_23_37_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d4f/stooge__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d4f/stooge__sort_8cpp.html" target="_self">stooge_sort.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Stooge_sort" target="_blank">Stooge sort implementation</a> in C++ </td></tr>
+<tr id="row_23_38_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dc/dd9/strand__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="dc/dd9/strand__sort_8cpp.html" target="_self">strand_sort.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Strand_sort" target="_blank">Strand Sort</a> algorithm </td></tr>
+<tr id="row_23_39_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="dd/dd5/swap__sort_8cpp_source.html"><span class="icondoc"></span></a><b>swap_sort.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_23_40_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d5/d1e/tim__sort_8cpp_source.html"><span class="icondoc"></span></a><b>tim_sort.cpp</b></td><td class="desc"></td></tr>
+<tr id="row_23_41_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d3f/wave__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="db/d3f/wave__sort_8cpp.html" target="_self">wave_sort.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/sort-array-wave-form-2/" target="_blank">Wave sort</a> algorithm </td></tr>
+<tr id="row_23_42_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d1/dcc/wiggle__sort_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d1/dcc/wiggle__sort_8cpp.html" target="_self">wiggle_sort.cpp</a></td><td class="desc">[Wiggle Sort Algorithm] (<a href="https://leetcode.com/problems/wiggle-sort-ii/">https://leetcode.com/problems/wiggle-sort-ii/</a>) Implementation </td></tr>
+<tr id="row_24_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_24_" class="arrow" onclick="dynsection.toggleFolder('24_')">&#9658;</span><span id="img_24_" class="iconfclosed" onclick="dynsection.toggleFolder('24_')">&#160;</span><a class="el" href="dir_73a3cc5065b223eb41b02873c0e19f0e.html" target="_self">strings</a></td><td class="desc"></td></tr>
+<tr id="row_24_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/db2/boyer__moore_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/db2/boyer__moore_8cpp.html" target="_self">boyer_moore.cpp</a></td><td class="desc">The <a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm" target="_blank">Boyer–Moore</a> algorithm searches for occurrences of pattern P in text T by performing explicit character comparisons at different alignments. Instead of a brute-force search of all alignments (of which there are n - m + 1), Boyer–Moore uses information gained by preprocessing P to skip as many alignments as possible </td></tr>
+<tr id="row_24_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d7d/brute__force__string__searching_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html" target="_self">brute_force_string_searching.cpp</a></td><td class="desc">String pattern search - brute force </td></tr>
+<tr id="row_24_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="db/d09/duval_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="db/d09/duval_8cpp.html" target="_self">duval.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Lyndon_word" target="_blank">Duval's algorithm</a> </td></tr>
+<tr id="row_24_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/dfe/horspool_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/dfe/horspool_8cpp.html" target="_self">horspool.cpp</a></td><td class="desc">Horspool's algorithm that finds if a string contains a substring (<a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm">https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm</a>) </td></tr>
+<tr id="row_24_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="de/d6a/knuth__morris__pratt_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html" target="_self">knuth_morris_pratt.cpp</a></td><td class="desc">The <a href="https://en.wikipedia.org/wiki/Knuth–Morris–Pratt_algorithm" target="_blank">Knuth-Morris-Pratt Algorithm</a> for finding a pattern within a piece of text with complexity O(n + m) </td></tr>
+<tr id="row_24_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d39/manacher__algorithm_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/d39/manacher__algorithm_8cpp.html" target="_self">manacher_algorithm.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Longest_palindromic_substring" target="_blank">Manacher's Algorithm</a> </td></tr>
+<tr id="row_24_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d6/dce/rabin__karp_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d6/dce/rabin__karp_8cpp.html" target="_self">rabin_karp.cpp</a></td><td class="desc">The <a href="https://en.wikipedia.org/wiki/Rabin–Karp_algorithm" target="_blank">Rabin-Karp Algorithm</a> for finding a pattern within a piece of text with complexity O(n + m) </td></tr>
+<tr id="row_24_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d3/d80/z__function_8cpp_source.html"><span class="icondoc"></span></a><a class="el" href="d3/d80/z__function_8cpp.html" target="_self">z_function.cpp</a></td><td class="desc">The <a href="https://cp-algorithms.com/string/z-function.html" target="_blank">Z function</a> for finding occurences of a pattern within a piece of text with time and space complexity O(n + m) </td></tr>
 </table>
 </div><!-- directory -->
 </div><!-- contents -->
diff --git a/files_dup.js b/files_dup.js
index 4d5668aba..ef89b77d5 100644
--- a/files_dup.js
+++ b/files_dup.js
@@ -21,6 +21,7 @@ var files_dup =
     [ "physics", "dir_59dc24c326e2a72d1164f014b22de83d.html", "dir_59dc24c326e2a72d1164f014b22de83d" ],
     [ "probability", "dir_82e494173a87936756866de2fa774307.html", "dir_82e494173a87936756866de2fa774307" ],
     [ "range_queries", "dir_074119ce3a874b57120c49a0cc4bb5ad.html", "dir_074119ce3a874b57120c49a0cc4bb5ad" ],
+    [ "scripts", "dir_53e6fa9553ac22a5646d2a2b2d7b97a1.html", "dir_53e6fa9553ac22a5646d2a2b2d7b97a1" ],
     [ "search", "dir_19b2bf9199a15c634a08b1ede1dd896a.html", "dir_19b2bf9199a15c634a08b1ede1dd896a" ],
     [ "sorting", "dir_bb1b521853a9c46347182a9d10420771.html", "dir_bb1b521853a9c46347182a9d10420771" ],
     [ "strings", "dir_73a3cc5065b223eb41b02873c0e19f0e.html", "dir_73a3cc5065b223eb41b02873c0e19f0e" ]
diff --git a/functions.html b/functions.html
index 53de1791a..5b5c88320 100644
--- a/functions.html
+++ b/functions.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_a.html b/functions_a.html
index 0e74489f3..24fc5ff2d 100644
--- a/functions_a.html
+++ b/functions_a.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_b.html b/functions_b.html
index 3361a9807..b6517c3c9 100644
--- a/functions_b.html
+++ b/functions_b.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_c.html b/functions_c.html
index 4c995dbf1..35abf084a 100644
--- a/functions_c.html
+++ b/functions_c.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_d.html b/functions_d.html
index 75d0ba852..cff880537 100644
--- a/functions_d.html
+++ b/functions_d.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_e.html b/functions_e.html
index 0063389d3..1ee9c9eb8 100644
--- a/functions_e.html
+++ b/functions_e.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_f.html b/functions_f.html
index 365dd72cf..6b5e962fa 100644
--- a/functions_f.html
+++ b/functions_f.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func.html b/functions_func.html
index 0b4820159..7ceed9074 100644
--- a/functions_func.html
+++ b/functions_func.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_a.html b/functions_func_a.html
index 8669bb064..7d43f2fb0 100644
--- a/functions_func_a.html
+++ b/functions_func_a.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_b.html b/functions_func_b.html
index b455c1530..170e2dfb9 100644
--- a/functions_func_b.html
+++ b/functions_func_b.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_c.html b/functions_func_c.html
index 5078c5f6c..4c841ddba 100644
--- a/functions_func_c.html
+++ b/functions_func_c.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_d.html b/functions_func_d.html
index 0b69f3e81..71ee2d837 100644
--- a/functions_func_d.html
+++ b/functions_func_d.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_e.html b/functions_func_e.html
index 2b23a090b..7b6eac4de 100644
--- a/functions_func_e.html
+++ b/functions_func_e.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_f.html b/functions_func_f.html
index 59e892ba8..1a7f8b469 100644
--- a/functions_func_f.html
+++ b/functions_func_f.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_g.html b/functions_func_g.html
index f6654f307..d17b046eb 100644
--- a/functions_func_g.html
+++ b/functions_func_g.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_h.html b/functions_func_h.html
index 17a248332..908b6a0ca 100644
--- a/functions_func_h.html
+++ b/functions_func_h.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_i.html b/functions_func_i.html
index ba0145b1b..02d6114a6 100644
--- a/functions_func_i.html
+++ b/functions_func_i.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_k.html b/functions_func_k.html
index bf09174ba..4af967b06 100644
--- a/functions_func_k.html
+++ b/functions_func_k.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_l.html b/functions_func_l.html
index b8eb79d49..26545dab4 100644
--- a/functions_func_l.html
+++ b/functions_func_l.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_m.html b/functions_func_m.html
index 7bda40a9a..4076b08ee 100644
--- a/functions_func_m.html
+++ b/functions_func_m.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_n.html b/functions_func_n.html
index 5b9094ba0..a7909140e 100644
--- a/functions_func_n.html
+++ b/functions_func_n.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_o.html b/functions_func_o.html
index c0811b2a0..fc143b659 100644
--- a/functions_func_o.html
+++ b/functions_func_o.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_p.html b/functions_func_p.html
index f0b5a9d5c..72df2b1c7 100644
--- a/functions_func_p.html
+++ b/functions_func_p.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_q.html b/functions_func_q.html
index 1283cc83c..fd9dd2d5c 100644
--- a/functions_func_q.html
+++ b/functions_func_q.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_r.html b/functions_func_r.html
index 3f6ba2a9c..587582041 100644
--- a/functions_func_r.html
+++ b/functions_func_r.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_s.html b/functions_func_s.html
index ffda930e5..48f278a16 100644
--- a/functions_func_s.html
+++ b/functions_func_s.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_t.html b/functions_func_t.html
index 0ba68fec9..f35b36618 100644
--- a/functions_func_t.html
+++ b/functions_func_t.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_u.html b/functions_func_u.html
index 20beb84e9..d471d72cd 100644
--- a/functions_func_u.html
+++ b/functions_func_u.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_v.html b/functions_func_v.html
index 3095d191a..aebb13617 100644
--- a/functions_func_v.html
+++ b/functions_func_v.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_w.html b/functions_func_w.html
index 6bb7085bf..de9a14e42 100644
--- a/functions_func_w.html
+++ b/functions_func_w.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_func_~.html b/functions_func_~.html
index 5e058144e..0d844706a 100644
--- a/functions_func_~.html
+++ b/functions_func_~.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Functions</title>
+<title>TheAlgorithms/C++: Class Members - Functions</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_g.html b/functions_g.html
index cc3bbcc93..fafddc079 100644
--- a/functions_g.html
+++ b/functions_g.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_h.html b/functions_h.html
index d1b865fbb..b81df4a75 100644
--- a/functions_h.html
+++ b/functions_h.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_i.html b/functions_i.html
index 4a448f4e8..191963bcb 100644
--- a/functions_i.html
+++ b/functions_i.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_k.html b/functions_k.html
index eaaf09a05..0d1e3c0c0 100644
--- a/functions_k.html
+++ b/functions_k.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_l.html b/functions_l.html
index 357c05786..291933f3d 100644
--- a/functions_l.html
+++ b/functions_l.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_m.html b/functions_m.html
index c36c5cc63..f31dc7cfd 100644
--- a/functions_m.html
+++ b/functions_m.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_n.html b/functions_n.html
index 504a725dc..5ed60755a 100644
--- a/functions_n.html
+++ b/functions_n.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_o.html b/functions_o.html
index d598dbe82..e737b89ff 100644
--- a/functions_o.html
+++ b/functions_o.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_p.html b/functions_p.html
index c750dff0b..0021383b6 100644
--- a/functions_p.html
+++ b/functions_p.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_q.html b/functions_q.html
index bb6f40351..728a47126 100644
--- a/functions_q.html
+++ b/functions_q.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_r.html b/functions_r.html
index f9622297d..4fa6c439e 100644
--- a/functions_r.html
+++ b/functions_r.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_rela.html b/functions_rela.html
index c3851dc10..09f52d76a 100644
--- a/functions_rela.html
+++ b/functions_rela.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Related Symbols</title>
+<title>TheAlgorithms/C++: Class Members - Related Symbols</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_s.html b/functions_s.html
index 3d6c23a60..69a490d25 100644
--- a/functions_s.html
+++ b/functions_s.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_t.html b/functions_t.html
index da702a08a..6d9db1fdf 100644
--- a/functions_t.html
+++ b/functions_t.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_type.html b/functions_type.html
index 31d3d54f0..d8fdf7cf1 100644
--- a/functions_type.html
+++ b/functions_type.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Typedefs</title>
+<title>TheAlgorithms/C++: Class Members - Typedefs</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_u.html b/functions_u.html
index 754693bb3..75d50c0a1 100644
--- a/functions_u.html
+++ b/functions_u.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_v.html b/functions_v.html
index ddb219edc..137c2ea1f 100644
--- a/functions_v.html
+++ b/functions_v.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_vars.html b/functions_vars.html
index 84746901d..27f200a68 100644
--- a/functions_vars.html
+++ b/functions_vars.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members - Variables</title>
+<title>TheAlgorithms/C++: Class Members - Variables</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_w.html b/functions_w.html
index e8c9add3c..552c836b4 100644
--- a/functions_w.html
+++ b/functions_w.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_x.html b/functions_x.html
index 730a1417c..f9dedd5c9 100644
--- a/functions_x.html
+++ b/functions_x.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_y.html b/functions_y.html
index cc7d4e13d..9f4eb61f1 100644
--- a/functions_y.html
+++ b/functions_y.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/functions_~.html b/functions_~.html
index 1a0af9a85..8f92594c6 100644
--- a/functions_~.html
+++ b/functions_~.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Members</title>
+<title>TheAlgorithms/C++: Class Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals.html b/globals.html
index 57ee4819e..520fb9174 100644
--- a/globals.html
+++ b/globals.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_a.html b/globals_a.html
index 4a525b6a2..f1de5d692 100644
--- a/globals_a.html
+++ b/globals_a.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_b.html b/globals_b.html
index ddb2e86a3..62d65685a 100644
--- a/globals_b.html
+++ b/globals_b.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_c.html b/globals_c.html
index 8a15fcdde..2e7f37dd3 100644
--- a/globals_c.html
+++ b/globals_c.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_d.html b/globals_d.html
index e090ee149..a6903180e 100644
--- a/globals_d.html
+++ b/globals_d.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_defs.html b/globals_defs.html
index d781a6c41..293ad133e 100644
--- a/globals_defs.html
+++ b/globals_defs.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_e.html b/globals_e.html
index 220615268..911da26de 100644
--- a/globals_e.html
+++ b/globals_e.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_f.html b/globals_f.html
index 11c17d356..3b3c5376d 100644
--- a/globals_f.html
+++ b/globals_f.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func.html b/globals_func.html
index fcdbc3e04..c591f85cd 100644
--- a/globals_func.html
+++ b/globals_func.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_a.html b/globals_func_a.html
index 5eee8fba3..435532d54 100644
--- a/globals_func_a.html
+++ b/globals_func_a.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_b.html b/globals_func_b.html
index 74a2da0a6..ea72c525d 100644
--- a/globals_func_b.html
+++ b/globals_func_b.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_c.html b/globals_func_c.html
index fb928c380..dc0016f73 100644
--- a/globals_func_c.html
+++ b/globals_func_c.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_d.html b/globals_func_d.html
index 33b476347..8e0e79fe1 100644
--- a/globals_func_d.html
+++ b/globals_func_d.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_e.html b/globals_func_e.html
index f36bc9f80..bf5b55e04 100644
--- a/globals_func_e.html
+++ b/globals_func_e.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_f.html b/globals_func_f.html
index b66bf28c5..2fd947c08 100644
--- a/globals_func_f.html
+++ b/globals_func_f.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_g.html b/globals_func_g.html
index 80cb2c461..fdbacc77e 100644
--- a/globals_func_g.html
+++ b/globals_func_g.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_h.html b/globals_func_h.html
index 24a13c7e3..a7ae93b58 100644
--- a/globals_func_h.html
+++ b/globals_func_h.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_i.html b/globals_func_i.html
index 0dbc53315..3de82783c 100644
--- a/globals_func_i.html
+++ b/globals_func_i.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_j.html b/globals_func_j.html
index e8ca75fde..ea42a459c 100644
--- a/globals_func_j.html
+++ b/globals_func_j.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_l.html b/globals_func_l.html
index 5ec0a4e4f..89500f9f7 100644
--- a/globals_func_l.html
+++ b/globals_func_l.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_m.html b/globals_func_m.html
index d61925ac2..76fe8ac00 100644
--- a/globals_func_m.html
+++ b/globals_func_m.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_n.html b/globals_func_n.html
index f9de5d235..ceb9821f9 100644
--- a/globals_func_n.html
+++ b/globals_func_n.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_o.html b/globals_func_o.html
index c0a30db5b..911ab9df4 100644
--- a/globals_func_o.html
+++ b/globals_func_o.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_p.html b/globals_func_p.html
index f8d14859a..5f7d85354 100644
--- a/globals_func_p.html
+++ b/globals_func_p.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_q.html b/globals_func_q.html
index 179ea492b..8e0a06f13 100644
--- a/globals_func_q.html
+++ b/globals_func_q.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_r.html b/globals_func_r.html
index d9d506ef8..c995c8c09 100644
--- a/globals_func_r.html
+++ b/globals_func_r.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_s.html b/globals_func_s.html
index 8af17b9b3..e5115604d 100644
--- a/globals_func_s.html
+++ b/globals_func_s.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_t.html b/globals_func_t.html
index b55efcedc..ed0d0867c 100644
--- a/globals_func_t.html
+++ b/globals_func_t.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_u.html b/globals_func_u.html
index 95e2d43ad..f8a01c8e1 100644
--- a/globals_func_u.html
+++ b/globals_func_u.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_func_z.html b/globals_func_z.html
index 1ecb03805..450e8075f 100644
--- a/globals_func_z.html
+++ b/globals_func_z.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_g.html b/globals_g.html
index fdb06016f..166dcf003 100644
--- a/globals_g.html
+++ b/globals_g.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_h.html b/globals_h.html
index 0b7d180ee..206f3c0cb 100644
--- a/globals_h.html
+++ b/globals_h.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_i.html b/globals_i.html
index 893820043..141dca0bb 100644
--- a/globals_i.html
+++ b/globals_i.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_j.html b/globals_j.html
index 9b6196dc5..4f93a0f0c 100644
--- a/globals_j.html
+++ b/globals_j.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_l.html b/globals_l.html
index b4f900e23..1728a1e0b 100644
--- a/globals_l.html
+++ b/globals_l.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_m.html b/globals_m.html
index 7a7b5fa51..d847ab4b5 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_n.html b/globals_n.html
index f6c17e4fd..e3e2ed737 100644
--- a/globals_n.html
+++ b/globals_n.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_o.html b/globals_o.html
index 634b0246d..0d6e4e164 100644
--- a/globals_o.html
+++ b/globals_o.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_p.html b/globals_p.html
index 474a48d05..e7c93fa46 100644
--- a/globals_p.html
+++ b/globals_p.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_q.html b/globals_q.html
index baff51701..fb90948e0 100644
--- a/globals_q.html
+++ b/globals_q.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_r.html b/globals_r.html
index 72e3881d0..21cc22c23 100644
--- a/globals_r.html
+++ b/globals_r.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_s.html b/globals_s.html
index 194c7b5ac..987d04d3a 100644
--- a/globals_s.html
+++ b/globals_s.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_t.html b/globals_t.html
index ac0e9b5bc..28e9d6839 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_type.html b/globals_type.html
index cfbb80334..c4d275ee9 100644
--- a/globals_type.html
+++ b/globals_type.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_u.html b/globals_u.html
index ee24d18df..89cb68021 100644
--- a/globals_u.html
+++ b/globals_u.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_vars.html b/globals_vars.html
index 29d5e8bfd..c285b1477 100644
--- a/globals_vars.html
+++ b/globals_vars.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_w.html b/globals_w.html
index 8a7f77257..5cc3498b6 100644
--- a/globals_w.html
+++ b/globals_w.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/globals_z.html b/globals_z.html
index f262345e9..2c083c153 100644
--- a/globals_z.html
+++ b/globals_z.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: File Members</title>
+<title>TheAlgorithms/C++: File Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/graph_legend.html b/graph_legend.html
index d771dd039..33fdc8e4d 100644
--- a/graph_legend.html
+++ b/graph_legend.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Graph Legend</title>
+<title>TheAlgorithms/C++: Graph Legend</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/hierarchy.html b/hierarchy.html
index d9a6bd8fe..e116e462e 100644
--- a/hierarchy.html
+++ b/hierarchy.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Hierarchy</title>
+<title>TheAlgorithms/C++: Class Hierarchy</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -213,7 +230,7 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
 <tr id="row_97_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc8/classdata__structures_1_1_stack.html" target="_self">data_structures::Stack&lt; T &gt;</a></td><td class="desc">Class representation of a stack </td></tr>
 <tr id="row_98_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" target="_self">data_structures::stack_using_queue::Stack</a></td><td class="desc"><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Class implementation for basic methods of <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Data Structure </td></tr>
 <tr id="row_99_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">others::postfix_expression::Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
-<tr id="row_100_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack&lt; ValueType &gt;</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a> </td></tr>
+<tr id="row_100_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack&lt; ValueType &gt;</a></td><td class="desc">For std::invalid_argument </td></tr>
 <tr id="row_101_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
 <tr id="row_102_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1&lt; T &gt;</a></td><td class="desc"></td></tr>
 <tr id="row_103_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2&lt; T &gt;</a></td><td class="desc"></td></tr>
@@ -229,7 +246,7 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
 <tr id="row_112_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
 <tr id="row_113_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d3e/classdata__structures_1_1trie.html" target="_self">data_structures::trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
 <tr id="row_114_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
-<tr id="row_115_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_115_" class="arrow" onclick="dynsection.toggleFolder('115_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a>&#160;[external]</td><td class="desc"></td></tr>
+<tr id="row_115_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_115_" class="arrow" onclick="dynsection.toggleFolder('115_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><b>std::true_type</b></td><td class="desc"></td></tr>
 <tr id="row_115_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">std::is_arithmetic&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
 <tr id="row_115_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">std::is_arithmetic&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
 <tr id="row_115_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">std::is_integral&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
diff --git a/hierarchy.js b/hierarchy.js
index 74519eaaa..934742f14 100644
--- a/hierarchy.js
+++ b/hierarchy.js
@@ -121,7 +121,7 @@ var hierarchy =
     [ "Trie", "dd/d2f/class_trie.html", null ],
     [ "data_structures::trie", "d0/d3e/classdata__structures_1_1trie.html", null ],
     [ "Trie::TrieNode", "de/d48/struct_trie_1_1_trie_node.html", null ],
-    [ "std::true_type", "http://en.cppreference.com/w/cpp/types/integral_constant.html", [
+    [ "std::true_type", null, [
       [ "std::is_arithmetic< uint128_t >", "d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html", null ],
       [ "std::is_arithmetic< uint256_t >", "dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html", null ],
       [ "std::is_integral< uint128_t >", "d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html", null ],
diff --git a/index.html b/index.html
index e1df2e25b..920fb374a 100644
--- a/index.html
+++ b/index.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: The Algorithms - C++</title>
+<title>TheAlgorithms/C++: The Algorithms - C++</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/inherit_graph_109.map b/inherit_graph_109.map
index c32095b1d..6e6f4540f 100644
--- a/inherit_graph_109.map
+++ b/inherit_graph_109.map
@@ -1,5 +1,5 @@
 <map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
-<area shape="rect" id="Node000000" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integral_constant.html" title=" " alt="" coords="5,161,107,186"/>
+<area shape="rect" id="Node000000" title=" " alt="" coords="5,161,107,186"/>
 <area shape="rect" id="Node000001" href="$d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" title=" " alt="" coords="191,5,312,46"/>
 <area shape="poly" id="edge4_Node000000_Node000001" title=" " alt="" coords="71,146,106,101,128,77,153,57,189,39,191,44,156,61,132,81,110,104,76,149"/>
 <area shape="rect" id="Node000002" href="$dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" title=" " alt="" coords="191,71,312,111"/>
diff --git a/inherit_graph_109.md5 b/inherit_graph_109.md5
index b9994081c..23de87cac 100644
--- a/inherit_graph_109.md5
+++ b/inherit_graph_109.md5
@@ -1 +1 @@
-53ba32e546959cac79e584e353db1db7
\ No newline at end of file
+40148db2c502b9385ae4dd5781440f30
\ No newline at end of file
diff --git a/inherit_graph_109.svg b/inherit_graph_109.svg
index f5df45beb..272fc6909 100644
--- a/inherit_graph_109.svg
+++ b/inherit_graph_109.svg
@@ -11,8 +11,8 @@
 <!-- Node0 -->
 <g id="Node000000" class="node">
 <title>Node0</title>
-<g id="a_Node000000"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
-<polygon fill="white" stroke="#666666" points="76,-111.25 0,-111.25 0,-92 76,-92 76,-111.25"/>
+<g id="a_Node000000"><a xlink:title=" ">
+<polygon fill="#e0e0e0" stroke="#999999" points="76,-111.25 0,-111.25 0,-92 76,-92 76,-111.25"/>
 <text text-anchor="middle" x="38" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
 </a>
 </g>
diff --git a/inherits.html b/inherits.html
index fd2649103..2289f1e4d 100644
--- a/inherits.html
+++ b/inherits.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Class Hierarchy</title>
+<title>TheAlgorithms/C++: Class Hierarchy</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers.html b/namespacemembers.html
index 5f617768c..538805365 100644
--- a/namespacemembers.html
+++ b/namespacemembers.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_b.html b/namespacemembers_b.html
index 041185be5..815259859 100644
--- a/namespacemembers_b.html
+++ b/namespacemembers_b.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_c.html b/namespacemembers_c.html
index ae05834cd..15eed4e91 100644
--- a/namespacemembers_c.html
+++ b/namespacemembers_c.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_d.html b/namespacemembers_d.html
index 3a8334c62..17af3fbb9 100644
--- a/namespacemembers_d.html
+++ b/namespacemembers_d.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_e.html b/namespacemembers_e.html
index 565d93e61..bfb362569 100644
--- a/namespacemembers_e.html
+++ b/namespacemembers_e.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_f.html b/namespacemembers_f.html
index 0da182a6c..3639e3b60 100644
--- a/namespacemembers_f.html
+++ b/namespacemembers_f.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func.html b/namespacemembers_func.html
index 660aaa124..9b7e75a4b 100644
--- a/namespacemembers_func.html
+++ b/namespacemembers_func.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_b.html b/namespacemembers_func_b.html
index 84a68993c..bb1417ede 100644
--- a/namespacemembers_func_b.html
+++ b/namespacemembers_func_b.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_c.html b/namespacemembers_func_c.html
index b17b7c1a2..b05aab1a3 100644
--- a/namespacemembers_func_c.html
+++ b/namespacemembers_func_c.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_d.html b/namespacemembers_func_d.html
index 740998cf9..5f3814f30 100644
--- a/namespacemembers_func_d.html
+++ b/namespacemembers_func_d.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_e.html b/namespacemembers_func_e.html
index 9c287859b..400f1807a 100644
--- a/namespacemembers_func_e.html
+++ b/namespacemembers_func_e.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_f.html b/namespacemembers_func_f.html
index 0f3565b4c..65493298f 100644
--- a/namespacemembers_func_f.html
+++ b/namespacemembers_func_f.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_g.html b/namespacemembers_func_g.html
index 2337ef3fb..ee3226475 100644
--- a/namespacemembers_func_g.html
+++ b/namespacemembers_func_g.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_h.html b/namespacemembers_func_h.html
index 444839e8b..308f44d9e 100644
--- a/namespacemembers_func_h.html
+++ b/namespacemembers_func_h.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_i.html b/namespacemembers_func_i.html
index b799cb7be..070c29fc2 100644
--- a/namespacemembers_func_i.html
+++ b/namespacemembers_func_i.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_k.html b/namespacemembers_func_k.html
index e48a5c602..be6366bec 100644
--- a/namespacemembers_func_k.html
+++ b/namespacemembers_func_k.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_l.html b/namespacemembers_func_l.html
index 5dee59456..162129f4c 100644
--- a/namespacemembers_func_l.html
+++ b/namespacemembers_func_l.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_m.html b/namespacemembers_func_m.html
index c90008ef8..5d01dd5a8 100644
--- a/namespacemembers_func_m.html
+++ b/namespacemembers_func_m.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_n.html b/namespacemembers_func_n.html
index 5da1d477a..5a87eeda8 100644
--- a/namespacemembers_func_n.html
+++ b/namespacemembers_func_n.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_o.html b/namespacemembers_func_o.html
index 3e90f21cb..704e7b041 100644
--- a/namespacemembers_func_o.html
+++ b/namespacemembers_func_o.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_p.html b/namespacemembers_func_p.html
index 67bdf33dd..f4f09ec34 100644
--- a/namespacemembers_func_p.html
+++ b/namespacemembers_func_p.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_q.html b/namespacemembers_func_q.html
index fc5c98030..25188bcbd 100644
--- a/namespacemembers_func_q.html
+++ b/namespacemembers_func_q.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_r.html b/namespacemembers_func_r.html
index 4b204597a..bd3befa98 100644
--- a/namespacemembers_func_r.html
+++ b/namespacemembers_func_r.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_s.html b/namespacemembers_func_s.html
index 3a87b86c5..67a0405eb 100644
--- a/namespacemembers_func_s.html
+++ b/namespacemembers_func_s.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_t.html b/namespacemembers_func_t.html
index f8d1bfb37..028c4eac5 100644
--- a/namespacemembers_func_t.html
+++ b/namespacemembers_func_t.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_u.html b/namespacemembers_func_u.html
index 91122ee10..972fbe01e 100644
--- a/namespacemembers_func_u.html
+++ b/namespacemembers_func_u.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_v.html b/namespacemembers_func_v.html
index 3dd8edc99..38d6f1745 100644
--- a/namespacemembers_func_v.html
+++ b/namespacemembers_func_v.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_func_z.html b/namespacemembers_func_z.html
index 56f078f9c..dd0d724b6 100644
--- a/namespacemembers_func_z.html
+++ b/namespacemembers_func_z.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_g.html b/namespacemembers_g.html
index 136c4da8e..69bafdba9 100644
--- a/namespacemembers_g.html
+++ b/namespacemembers_g.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_h.html b/namespacemembers_h.html
index b1bfb3a8e..1d5b34838 100644
--- a/namespacemembers_h.html
+++ b/namespacemembers_h.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_i.html b/namespacemembers_i.html
index 6b158a48e..95bcf1dee 100644
--- a/namespacemembers_i.html
+++ b/namespacemembers_i.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_k.html b/namespacemembers_k.html
index 42d1756a3..2624d55f0 100644
--- a/namespacemembers_k.html
+++ b/namespacemembers_k.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_l.html b/namespacemembers_l.html
index 5a3997284..e53e60520 100644
--- a/namespacemembers_l.html
+++ b/namespacemembers_l.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_m.html b/namespacemembers_m.html
index fd1fa1967..c13d9c2c2 100644
--- a/namespacemembers_m.html
+++ b/namespacemembers_m.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_n.html b/namespacemembers_n.html
index 480f483f2..a415eff8e 100644
--- a/namespacemembers_n.html
+++ b/namespacemembers_n.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_o.html b/namespacemembers_o.html
index 4d2198e81..9d1a97f18 100644
--- a/namespacemembers_o.html
+++ b/namespacemembers_o.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_p.html b/namespacemembers_p.html
index 5ccb80c1c..4ef50c7fc 100644
--- a/namespacemembers_p.html
+++ b/namespacemembers_p.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_q.html b/namespacemembers_q.html
index 6491f9be6..60c7a9415 100644
--- a/namespacemembers_q.html
+++ b/namespacemembers_q.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_r.html b/namespacemembers_r.html
index 0452eb54b..3e4975af5 100644
--- a/namespacemembers_r.html
+++ b/namespacemembers_r.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_s.html b/namespacemembers_s.html
index 21ccea1b2..6abc8721f 100644
--- a/namespacemembers_s.html
+++ b/namespacemembers_s.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_t.html b/namespacemembers_t.html
index 5fe07d91b..cbf79ce5e 100644
--- a/namespacemembers_t.html
+++ b/namespacemembers_t.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_type.html b/namespacemembers_type.html
index 8e0de7228..2df51a09d 100644
--- a/namespacemembers_type.html
+++ b/namespacemembers_type.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_u.html b/namespacemembers_u.html
index a977c80cc..14a3caba7 100644
--- a/namespacemembers_u.html
+++ b/namespacemembers_u.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_v.html b/namespacemembers_v.html
index bcc3dacf1..028ad2b3a 100644
--- a/namespacemembers_v.html
+++ b/namespacemembers_v.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_vars.html b/namespacemembers_vars.html
index 3963cb5a0..2129b1b30 100644
--- a/namespacemembers_vars.html
+++ b/namespacemembers_vars.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespacemembers_z.html b/namespacemembers_z.html
index acb2c0333..3dbb9e5d7 100644
--- a/namespacemembers_z.html
+++ b/namespacemembers_z.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace Members</title>
+<title>TheAlgorithms/C++: Namespace Members</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/namespaces.html b/namespaces.html
index ac8aff924..b3051f46b 100644
--- a/namespaces.html
+++ b/namespaces.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Namespace List</title>
+<title>TheAlgorithms/C++: Namespace List</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
@@ -135,10 +152,10 @@ $(function(){initNavTree('namespaces.html',''); initResizable(true); });
 <tr id="row_21_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d2e/namespacedata__structures_1_1treap.html" target="_self">treap</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Treap" target="_blank">Treap</a> algorithm implementation </td></tr>
 <tr id="row_22_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/da7/namespacedepth__first__search.html" target="_self">depth_first_search</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Depth-first_search" target="_blank">Depth First Search</a> algorithm </td></tr>
 <tr id="row_23_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/db4/namespacedisjoint__union.html" target="_self">disjoint_union</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Disjoint_union" target="_blank">Disjoint union</a> implementation </td></tr>
-<tr id="row_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</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_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</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 std::vector </td></tr>
 <tr id="row_25_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d75/namespacednf__sort.html" target="_self">dnf_sort</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Dutch_national_flag_problem" target="_blank">DNF sort</a> implementation </td></tr>
 <tr id="row_26_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</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_27_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d88/namespacedp.html" target="_self">dp</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_27_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d88/namespacedp.html" target="_self">dp</a></td><td class="desc">For std::vector </td></tr>
 <tr id="row_28_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d24/namespacedynamic__programming.html" target="_self">dynamic_programming</a></td><td class="desc">Dynamic Programming algorithms </td></tr>
 <tr id="row_29_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d1/d35/namespaceexponential__dist.html" target="_self">exponential_dist</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Exponential_distribution" target="_blank">Exponential Distribution</a> algorithm implementation </td></tr>
 <tr id="row_30_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/dea/namespacefalse__position.html" target="_self">false_position</a></td><td class="desc">Functions for [False Position] (<a href="https://en.wikipedia.org/wiki/Regula_falsi">https://en.wikipedia.org/wiki/Regula_falsi</a>) method </td></tr>
@@ -150,7 +167,7 @@ $(function(){initNavTree('namespaces.html',''); initResizable(true); });
 <tr id="row_34_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d41/namespacegames_1_1memory__game.html" target="_self">memory_game</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Matching_game" target="_blank">Memory Game</a> implementation </td></tr>
 <tr id="row_35_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/ddb/namespacegcd__of__n__numbers.html" target="_self">gcd_of_n_numbers</a></td><td class="desc">Compute GCD of numbers in an array </td></tr>
 <tr id="row_36_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d8a/namespacegeometric__dist.html" target="_self">geometric_dist</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Geometric_distribution" target="_blank">Geometric Distribution</a> algorithm implementation </td></tr>
-<tr id="row_37_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</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/algorithm/swap.html">std::swap</a> </td></tr>
+<tr id="row_37_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</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 std::swap </td></tr>
 <tr id="row_38_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/d0f/namespacegram__schmidt.html" target="_self">gram_schmidt</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process" target="_blank">Gram Schmidt Orthogonalisation Process</a> </td></tr>
 <tr id="row_39_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</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_40_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d08/namespacegraph__coloring.html" target="_self">graph_coloring</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Graph_coloring" target="_blank">Graph Coloring</a> algorithm, </td></tr>
@@ -202,7 +219,7 @@ $(function(){initNavTree('namespaces.html',''); initResizable(true); });
 <tr id="row_84_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/db9/namespacencr__modulo__p.html" target="_self">ncr_modulo_p</a></td><td class="desc">Functions for <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a> implementation </td></tr>
 <tr id="row_85_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d2e/namespaceneural__network.html" target="_self">neural_network</a></td><td class="desc">Neural Network or Multilayer Perceptron </td></tr>
 <tr id="row_86_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d1/de0/namespacenumerical__methods.html" target="_self">numerical_methods</a></td><td class="desc">For assert </td></tr>
-<tr id="row_87_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</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_87_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</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 std::vector </td></tr>
 <tr id="row_88_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_88_" class="arrow" onclick="dynsection.toggleFolder('88_')">&#9658;</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_88_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="db/dde/namespaceothers_1_1_cache.html" target="_self">Cache</a></td><td class="desc"><a class="el" href="db/dde/namespaceothers_1_1_cache.html" title="Cache algorithm.">Cache</a> algorithm </td></tr>
 <tr id="row_89_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d89/namespacepalindrome__partitioning.html" target="_self">palindrome_partitioning</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/palindrome-partitioning-ii/" target="_blank">Palindrome Partitioning</a> algorithm </td></tr>
@@ -217,7 +234,7 @@ $(function(){initNavTree('namespaces.html',''); initResizable(true); });
 <tr id="row_98_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d2b/namespacequick__sort.html" target="_self">quick_sort</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Quicksort" target="_blank">Quick sort implementation</a> in C++ </td></tr>
 <tr id="row_99_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/dda/namespaceradix__sort.html" target="_self">radix_sort</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Radix_sort" target="_blank">Radix sort</a> algorithm </td></tr>
 <tr id="row_100_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d6b/namespacerandom__pivot__quick__sort.html" target="_self">random_pivot_quick_sort</a></td><td class="desc">Functions for the <a href="https://www.sanfoundry.com/cpp-program-implement-quick-sort-using-randomisation" target="_blank">Random Pivot Quick Sort</a> implementation </td></tr>
-<tr id="row_101_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</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">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
+<tr id="row_101_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</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">For std::vector </td></tr>
 <tr id="row_102_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d60/namespacerat__maze.html" target="_self">rat_maze</a></td><td class="desc">Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to-
 solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm </td></tr>
 <tr id="row_103_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dc/dc5/namespacereverse__binary__tree.html" target="_self">reverse_binary_tree</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/reverse-tree-path/" target="_blank">Reverse a Binary Tree</a> implementation </td></tr>
@@ -235,34 +252,33 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm
 <tr id="row_115_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/dd3/namespacespirograph.html" target="_self">spirograph</a></td><td class="desc"></td></tr>
 <tr id="row_116_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d1c/namespacestack__using__queue.html" target="_self">stack_using_queue</a></td><td class="desc">Functions for the <a href="https://www.studytonight.com/data-structures/stack-using-queue" target="_blank">Stack Using Queue</a> implementation </td></tr>
 <tr id="row_117_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</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_118_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</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_119_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d1d/namespacestrand.html" target="_self">strand</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Strand_sort" target="_blank">Strand Sort</a> algorithm </td></tr>
-<tr id="row_120_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/d91/namespacestrassens__multiplication.html" target="_self">strassens_multiplication</a></td><td class="desc">Namespace for performing strassen's multiplication </td></tr>
-<tr id="row_121_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/dd6/namespacestring.html" target="_self">string</a></td><td class="desc">String manipulation algorithms </td></tr>
-<tr id="row_122_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d03/namespacestring__search.html" target="_self">string_search</a></td><td class="desc">String search algorithms </td></tr>
-<tr id="row_123_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_123_" class="arrow" onclick="dynsection.toggleFolder('123_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/dcb/namespacestrings.html" target="_self">strings</a></td><td class="desc">String algorithms </td></tr>
-<tr id="row_123_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/dbc/namespacestrings_1_1boyer__moore.html" target="_self">boyer_moore</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm" target="_blank">Boyer Moore</a> algorithm implementation </td></tr>
-<tr id="row_124_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d74/namespacesubarray__sum.html" target="_self">subarray_sum</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset sum</a> implementation </td></tr>
-<tr id="row_125_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/def/namespacesublist__search.html" target="_self">sublist_search</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list" target="_blank">Sublist Search</a> implementation </td></tr>
-<tr id="row_126_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dc/d3a/namespacesubset__sum.html" target="_self">subset_sum</a></td><td class="desc">Functions for [Sub-set sum problem] (<a href="https://en.wikipedia.org/wiki/Subset_sum_problem">https://en.wikipedia.org/wiki/Subset_sum_problem</a>) algorithm </td></tr>
-<tr id="row_127_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d95/namespace_subsets.html" target="_self">Subsets</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset Sum</a> problem </td></tr>
-<tr id="row_128_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d9f/namespacesudoku__solver.html" target="_self">sudoku_solver</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Sudoku" target="_blank">Sudoku Solver</a> implementation </td></tr>
-<tr id="row_129_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/df4/namespacetests.html" target="_self">tests</a></td><td class="desc">Testcases to check Union of Two Arrays </td></tr>
-<tr id="row_130_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d76/namespacetopological__sort.html" target="_self">topological_sort</a></td><td class="desc">Topological Sort Algorithm </td></tr>
-<tr id="row_131_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d3f/namespacetravelling_salesman__bitmanipulation.html" target="_self">travellingSalesman_bitmanipulation</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/" target="_blank">Travelling Salesman Bitmask</a> implementation </td></tr>
-<tr id="row_132_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/dab/namespacetree__234.html" target="_self">tree_234</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree" target="_blank">2–3–4 tree</a> </td></tr>
-<tr id="row_133_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d8e/namespacetrie__operations.html" target="_self">trie_operations</a></td><td class="desc">Functions for <a href="https://iq.opengenus.org/autocomplete-using-trie-data-structure/" target="_blank">Trie datastructure</a> implementation </td></tr>
-<tr id="row_134_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d0a/namespacetrie__using__hashmap.html" target="_self">trie_using_hashmap</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure using hashmap implementation </td></tr>
-<tr id="row_135_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/d17/namespaceutil__functions.html" target="_self">util_functions</a></td><td class="desc">Various utility functions used in Neural network </td></tr>
-<tr id="row_136_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d84/namespaceutils.html" target="_self">utils</a></td><td class="desc">This namespace contains the definitions of the functions called from the class <a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" title="Class which contains all methods required for calculating nCr mod p.">math::ncr_modulo_p::NCRModuloP</a> </td></tr>
-<tr id="row_137_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/d91/namespacevector__cross.html" target="_self">vector_cross</a></td><td class="desc">Functions for Vector Cross Product algorithms </td></tr>
-<tr id="row_138_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/da2/namespacevigenere.html" target="_self">vigenere</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Vigen%C3%A8re_cipher" target="_blank">vigenère cipher</a> algorithm </td></tr>
-<tr id="row_139_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d21/namespacewave__sort.html" target="_self">wave_sort</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/sort-array-wave-form-2/" target="_blank">Wave sort</a> implementation </td></tr>
-<tr id="row_140_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d52/namespacewiggle__sort.html" target="_self">wiggle_sort</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/wiggle-sort-ii/" target="_blank">Wiggle Sort</a> algorithm </td></tr>
-<tr id="row_141_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="db/d03/namespacewildcard__matching.html" target="_self">wildcard_matching</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/wildcard-pattern-matching/" target="_blank">Wildcard Matching</a> problem </td></tr>
-<tr id="row_142_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d21/namespacewindowed__median.html" target="_self">windowed_median</a></td><td class="desc">Functions for the Windowed Median algorithm implementation </td></tr>
-<tr id="row_143_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d53/namespaceword__break.html" target="_self">word_break</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/word-break/" target="_blank">Word Break</a> problem </td></tr>
-<tr id="row_144_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d47/namespace_x_o_r.html" target="_self">XOR</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/XOR_cipher" target="_blank">XOR cipher</a> algorithm </td></tr>
+<tr id="row_118_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d1d/namespacestrand.html" target="_self">strand</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Strand_sort" target="_blank">Strand Sort</a> algorithm </td></tr>
+<tr id="row_119_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/d91/namespacestrassens__multiplication.html" target="_self">strassens_multiplication</a></td><td class="desc">Namespace for performing strassen's multiplication </td></tr>
+<tr id="row_120_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/dd6/namespacestring.html" target="_self">string</a></td><td class="desc">String manipulation algorithms </td></tr>
+<tr id="row_121_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d03/namespacestring__search.html" target="_self">string_search</a></td><td class="desc">String search algorithms </td></tr>
+<tr id="row_122_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_122_" class="arrow" onclick="dynsection.toggleFolder('122_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/dcb/namespacestrings.html" target="_self">strings</a></td><td class="desc">String algorithms </td></tr>
+<tr id="row_122_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/dbc/namespacestrings_1_1boyer__moore.html" target="_self">boyer_moore</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm" target="_blank">Boyer Moore</a> algorithm implementation </td></tr>
+<tr id="row_123_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d74/namespacesubarray__sum.html" target="_self">subarray_sum</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset sum</a> implementation </td></tr>
+<tr id="row_124_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/def/namespacesublist__search.html" target="_self">sublist_search</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list" target="_blank">Sublist Search</a> implementation </td></tr>
+<tr id="row_125_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dc/d3a/namespacesubset__sum.html" target="_self">subset_sum</a></td><td class="desc">Functions for [Sub-set sum problem] (<a href="https://en.wikipedia.org/wiki/Subset_sum_problem">https://en.wikipedia.org/wiki/Subset_sum_problem</a>) algorithm </td></tr>
+<tr id="row_126_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="de/d95/namespace_subsets.html" target="_self">Subsets</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset Sum</a> problem </td></tr>
+<tr id="row_127_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d9f/namespacesudoku__solver.html" target="_self">sudoku_solver</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Sudoku" target="_blank">Sudoku Solver</a> implementation </td></tr>
+<tr id="row_128_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/df4/namespacetests.html" target="_self">tests</a></td><td class="desc">Testcases to check Union of Two Arrays </td></tr>
+<tr id="row_129_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d76/namespacetopological__sort.html" target="_self">topological_sort</a></td><td class="desc">Topological Sort Algorithm </td></tr>
+<tr id="row_130_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d3f/namespacetravelling_salesman__bitmanipulation.html" target="_self">travellingSalesman_bitmanipulation</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/travelling-salesman-problem-set-1/" target="_blank">Travelling Salesman Bitmask</a> implementation </td></tr>
+<tr id="row_131_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/dab/namespacetree__234.html" target="_self">tree_234</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree" target="_blank">2–3–4 tree</a> </td></tr>
+<tr id="row_132_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/d8e/namespacetrie__operations.html" target="_self">trie_operations</a></td><td class="desc">Functions for <a href="https://iq.opengenus.org/autocomplete-using-trie-data-structure/" target="_blank">Trie datastructure</a> implementation </td></tr>
+<tr id="row_133_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d0a/namespacetrie__using__hashmap.html" target="_self">trie_using_hashmap</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> data structure using hashmap implementation </td></tr>
+<tr id="row_134_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d3/d17/namespaceutil__functions.html" target="_self">util_functions</a></td><td class="desc">Various utility functions used in Neural network </td></tr>
+<tr id="row_135_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d84/namespaceutils.html" target="_self">utils</a></td><td class="desc">This namespace contains the definitions of the functions called from the class <a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" title="Class which contains all methods required for calculating nCr mod p.">math::ncr_modulo_p::NCRModuloP</a> </td></tr>
+<tr id="row_136_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/d91/namespacevector__cross.html" target="_self">vector_cross</a></td><td class="desc">Functions for Vector Cross Product algorithms </td></tr>
+<tr id="row_137_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/da2/namespacevigenere.html" target="_self">vigenere</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Vigen%C3%A8re_cipher" target="_blank">vigenère cipher</a> algorithm </td></tr>
+<tr id="row_138_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/d21/namespacewave__sort.html" target="_self">wave_sort</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/sort-array-wave-form-2/" target="_blank">Wave sort</a> implementation </td></tr>
+<tr id="row_139_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d52/namespacewiggle__sort.html" target="_self">wiggle_sort</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/wiggle-sort-ii/" target="_blank">Wiggle Sort</a> algorithm </td></tr>
+<tr id="row_140_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="db/d03/namespacewildcard__matching.html" target="_self">wildcard_matching</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/wildcard-pattern-matching/" target="_blank">Wildcard Matching</a> problem </td></tr>
+<tr id="row_141_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d21/namespacewindowed__median.html" target="_self">windowed_median</a></td><td class="desc">Functions for the Windowed Median algorithm implementation </td></tr>
+<tr id="row_142_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d53/namespaceword__break.html" target="_self">word_break</a></td><td class="desc">Functions for <a href="https://leetcode.com/problems/word-break/" target="_blank">Word Break</a> problem </td></tr>
+<tr id="row_143_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d7/d47/namespace_x_o_r.html" target="_self">XOR</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/XOR_cipher" target="_blank">XOR cipher</a> algorithm </td></tr>
 </table>
 </div><!-- directory -->
 </div><!-- contents -->
diff --git a/namespaces_dup.js b/namespaces_dup.js
index 5e7c8ffd8..8926f190e 100644
--- a/namespaces_dup.js
+++ b/namespaces_dup.js
@@ -164,7 +164,6 @@ var namespaces_dup =
     ] ],
     [ "stack_using_queue", "df/d1c/namespacestack__using__queue.html", null ],
     [ "statistics", "d2/dcf/namespacestatistics.html", "d2/dcf/namespacestatistics" ],
-    [ "std", "d8/dcc/namespacestd.html", "d8/dcc/namespacestd" ],
     [ "strand", "d8/d1d/namespacestrand.html", null ],
     [ "strassens_multiplication", "d3/d91/namespacestrassens__multiplication.html", null ],
     [ "string", "d6/dd6/namespacestring.html", [
diff --git a/navtree.css b/navtree.css
index 69211d4a7..6b1e5e46b 100644
--- a/navtree.css
+++ b/navtree.css
@@ -22,12 +22,12 @@
 #nav-tree .selected {
   background-image: url('tab_a.png');
   background-repeat:repeat-x;
-  color: var(--nav-text-active-color);
-  text-shadow: var(--nav-text-active-shadow);
+  color: white;
+  text-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0);
 }
 
 #nav-tree .selected .arrow {
-  color: var(--nav-arrow-selected-color);
+  color: #9CAFD4;
   text-shadow: none;
 }
 
@@ -47,7 +47,7 @@
 #nav-tree .label {
   margin:0px;
   padding:0px;
-  font: 12px var(--font-family-nav);
+  font: 12px 'Lucida Grande',Geneva,Helvetica,Arial,sans-serif;
 }
 
 #nav-tree .label a {
@@ -56,7 +56,7 @@
 
 #nav-tree .selected a {
   text-decoration:none;
-  color:var(--nav-text-active-color);
+  color:white;
 }
 
 #nav-tree .children_ul {
@@ -98,7 +98,7 @@
 }
 
 .ui-resizable-e {
-  background-image:var(--nav-splitbar-image);
+  background-image:url('splitbar.png');
   background-size:100%;
   background-repeat:repeat-y;
   background-attachment: scroll;
@@ -122,7 +122,7 @@
 
 #nav-tree {
   background-repeat:repeat-x;
-  background-color: var(--nav-background-color);
+  background-color: #F9FAFC;
   -webkit-overflow-scrolling : touch; /* iOS 5+ */
 }
 
diff --git a/navtreedata.js b/navtreedata.js
index ac1057483..068dffcf4 100644
--- a/navtreedata.js
+++ b/navtreedata.js
@@ -24,7 +24,7 @@
 */
 var NAVTREE =
 [
-  [ "Algorithms_in_C++", "index.html", [
+  [ "TheAlgorithms/C++", "index.html", [
     [ "The Algorithms - C++", "index.html", "index" ],
     [ "Contributor Covenant Code of Conduct", "d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html", [
       [ "Our Pledge", "d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md5", null ],
@@ -137,21 +137,20 @@ var NAVTREE =
 var NAVTREEINDEX =
 [
 "annotated.html",
-"cpp/iterator/distance.html",
-"cpp/thread/lock.html",
-"d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc",
-"d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1",
-"d4/d3e/n__queens_8cpp.html",
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58",
-"d6/d57/array__right__rotation_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d",
-"d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5",
-"d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e",
-"d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153",
-"db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b",
-"dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd",
-"dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a",
-"de/db4/namespacedisjoint__union.html",
-"examples.html"
+"d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6",
+"d2/dc8/classdata__structures_1_1_stack.html#a2ac469fcc2229d273450e429139d90e6",
+"d4/d13/namespacebidirectional__dijkstra.html",
+"d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53",
+"d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5",
+"d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec",
+"d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd",
+"d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4",
+"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf",
+"db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d",
+"dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4",
+"dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb",
+"de/d95/namespace_subsets.html",
+"df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863"
 ];
 
 var SYNCONMSG = 'click to disable panel synchronisation';
diff --git a/navtreeindex0.js b/navtreeindex0.js
index c57449f22..5ec5f20bd 100644
--- a/navtreeindex0.js
+++ b/navtreeindex0.js
@@ -2,252 +2,252 @@ var NAVTREEINDEX0 =
 {
 "annotated.html":[10,0],
 "classes.html":[10,1],
-"cpp/algorithm/accumulate.html":[9,0,118,15],
-"cpp/algorithm/adjacent_difference.html":[9,0,118,19],
-"cpp/algorithm/adjacent_find.html":[9,0,118,20],
-"cpp/algorithm/all_any_none_of.html":[9,0,118,23],
-"cpp/algorithm/all_any_none_of.html":[9,0,118,25],
-"cpp/algorithm/all_any_none_of.html":[9,0,118,300],
-"cpp/algorithm/binary_search.html":[9,0,118,65],
-"cpp/algorithm/bsearch.html":[9,0,118,68],
-"cpp/algorithm/copy.html":[9,0,118,79],
-"cpp/algorithm/copy.html":[9,0,118,81],
-"cpp/algorithm/copy_backward.html":[9,0,118,80],
-"cpp/algorithm/copy_n.html":[9,0,118,82],
-"cpp/algorithm/count.html":[9,0,118,86],
-"cpp/algorithm/count.html":[9,0,118,87],
-"cpp/algorithm/equal.html":[9,0,118,103],
-"cpp/algorithm/equal_range.html":[9,0,118,104],
-"cpp/algorithm/fill.html":[9,0,118,133],
-"cpp/algorithm/fill_n.html":[9,0,118,134],
-"cpp/algorithm/find.html":[9,0,118,135],
-"cpp/algorithm/find.html":[9,0,118,138],
-"cpp/algorithm/find.html":[9,0,118,139],
-"cpp/algorithm/find_end.html":[9,0,118,136],
-"cpp/algorithm/find_first_of.html":[9,0,118,137],
-"cpp/algorithm/for_each.html":[9,0,118,148],
-"cpp/algorithm/generate.html":[9,0,118,170],
-"cpp/algorithm/generate_n.html":[9,0,118,172],
-"cpp/algorithm/includes.html":[9,0,118,193],
-"cpp/algorithm/inner_product.html":[9,0,118,194],
-"cpp/algorithm/inplace_merge.html":[9,0,118,195],
-"cpp/algorithm/iota.html":[9,0,118,198],
-"cpp/algorithm/is_heap.html":[9,0,118,199],
-"cpp/algorithm/is_heap_until.html":[9,0,118,200],
-"cpp/algorithm/is_partitioned.html":[9,0,118,201],
-"cpp/algorithm/is_permutation.html":[9,0,118,202],
-"cpp/algorithm/is_sorted.html":[9,0,118,203],
-"cpp/algorithm/is_sorted_until.html":[9,0,118,204],
-"cpp/algorithm/iter_swap.html":[9,0,118,234],
-"cpp/algorithm/lexicographical_compare.html":[9,0,118,240],
-"cpp/algorithm/lower_bound.html":[9,0,118,253],
-"cpp/algorithm/make_heap.html":[9,0,118,257],
-"cpp/algorithm/max.html":[9,0,118,263],
-"cpp/algorithm/max_element.html":[9,0,118,264],
-"cpp/algorithm/merge.html":[9,0,118,280],
-"cpp/algorithm/min.html":[9,0,118,281],
-"cpp/algorithm/min_element.html":[9,0,118,282],
-"cpp/algorithm/minmax.html":[9,0,118,283],
-"cpp/algorithm/minmax_element.html":[9,0,118,284],
-"cpp/algorithm/mismatch.html":[9,0,118,285],
-"cpp/algorithm/move_backward.html":[9,0,118,289],
-"cpp/algorithm/next_permutation.html":[9,0,118,296],
-"cpp/algorithm/nth_element.html":[9,0,118,310],
-"cpp/algorithm/partial_sort.html":[9,0,118,312],
-"cpp/algorithm/partial_sort_copy.html":[9,0,118,313],
-"cpp/algorithm/partial_sum.html":[9,0,118,314],
-"cpp/algorithm/partition.html":[9,0,118,315],
-"cpp/algorithm/partition_copy.html":[9,0,118,316],
-"cpp/algorithm/partition_point.html":[9,0,118,317],
-"cpp/algorithm/pop_heap.html":[9,0,118,319],
-"cpp/algorithm/prev_permutation.html":[9,0,118,322],
-"cpp/algorithm/push_heap.html":[9,0,118,324],
-"cpp/algorithm/qsort.html":[9,0,118,331],
-"cpp/algorithm/random_shuffle.html":[9,0,118,335],
-"cpp/algorithm/random_shuffle.html":[9,0,118,388],
-"cpp/algorithm/remove.html":[9,0,118,342],
-"cpp/algorithm/remove.html":[9,0,118,345],
-"cpp/algorithm/remove_copy.html":[9,0,118,343],
-"cpp/algorithm/remove_copy.html":[9,0,118,344],
-"cpp/algorithm/replace.html":[9,0,118,348],
-"cpp/algorithm/replace.html":[9,0,118,351],
-"cpp/algorithm/replace_copy.html":[9,0,118,349],
-"cpp/algorithm/replace_copy.html":[9,0,118,350],
-"cpp/algorithm/reverse.html":[9,0,118,356],
-"cpp/algorithm/reverse_copy.html":[9,0,118,357],
-"cpp/algorithm/rotate.html":[9,0,118,361],
-"cpp/algorithm/rotate_copy.html":[9,0,118,362],
-"cpp/algorithm/search.html":[9,0,118,368],
-"cpp/algorithm/search_n.html":[9,0,118,369],
-"cpp/algorithm/set_difference.html":[9,0,118,370],
-"cpp/algorithm/set_intersection.html":[9,0,118,371],
-"cpp/algorithm/set_symmetric_difference.html":[9,0,118,373],
-"cpp/algorithm/set_union.html":[9,0,118,376],
-"cpp/algorithm/sort.html":[9,0,118,395],
-"cpp/algorithm/sort_heap.html":[9,0,118,396],
-"cpp/algorithm/stable_partition.html":[9,0,118,401],
-"cpp/algorithm/stable_sort.html":[9,0,118,402],
-"cpp/algorithm/swap.html":[9,0,118,439],
-"cpp/algorithm/swap_ranges.html":[9,0,118,440],
-"cpp/algorithm/transform.html":[9,0,118,461],
-"cpp/algorithm/unique.html":[9,0,118,475],
-"cpp/algorithm/unique_copy.html":[9,0,118,476],
-"cpp/algorithm/upper_bound.html":[9,0,118,478],
-"cpp/atomic/atomic_compare_exchange.html":[9,0,118,39],
-"cpp/atomic/atomic_compare_exchange.html":[9,0,118,40],
-"cpp/atomic/atomic_compare_exchange.html":[9,0,118,41],
-"cpp/atomic/atomic_compare_exchange.html":[9,0,118,42],
-"cpp/atomic/atomic_exchange.html":[9,0,118,43],
-"cpp/atomic/atomic_exchange.html":[9,0,118,44],
-"cpp/atomic/atomic_fetch_add.html":[9,0,118,45],
-"cpp/atomic/atomic_fetch_add.html":[9,0,118,46],
-"cpp/atomic/atomic_fetch_or.html":[9,0,118,49],
-"cpp/atomic/atomic_fetch_or.html":[9,0,118,50],
-"cpp/atomic/atomic_fetch_sub.html":[9,0,118,47],
-"cpp/atomic/atomic_fetch_sub.html":[9,0,118,48],
-"cpp/atomic/atomic_fetch_sub.html":[9,0,118,51],
-"cpp/atomic/atomic_fetch_sub.html":[9,0,118,52],
-"cpp/atomic/atomic_fetch_xor.html":[9,0,118,53],
-"cpp/atomic/atomic_fetch_xor.html":[9,0,118,54],
-"cpp/atomic/atomic_init.html":[9,0,118,55],
-"cpp/atomic/atomic_is_lock_free.html":[9,0,118,56],
-"cpp/atomic/atomic_load.html":[9,0,118,57],
-"cpp/atomic/atomic_load.html":[9,0,118,58],
-"cpp/atomic/atomic_signal_fence.html":[9,0,118,59],
-"cpp/atomic/atomic_store.html":[9,0,118,60],
-"cpp/atomic/atomic_store.html":[9,0,118,61],
-"cpp/atomic/atomic_thread_fence.html":[9,0,118,62],
-"cpp/atomic/kill_dependency.html":[9,0,118,235],
-"cpp/chrono/c/asctime.html":[9,0,118,26],
-"cpp/chrono/c/clock.html":[9,0,118,77],
-"cpp/chrono/c/ctime.html":[9,0,118,89],
-"cpp/chrono/c/difftime.html":[9,0,118,96],
-"cpp/chrono/c/gmtime.html":[9,0,118,187],
-"cpp/chrono/c/localtime.html":[9,0,118,246],
-"cpp/chrono/c/mktime.html":[9,0,118,286],
-"cpp/chrono/c/strftime.html":[9,0,118,419],
-"cpp/chrono/c/time.html":[9,0,118,451],
-"cpp/chrono/c/wcsftime.html":[9,0,118,501],
-"cpp/chrono/duration/duration_cast.html":[9,0,118,0,0],
-"cpp/chrono/time_point/time_point_cast.html":[9,0,118,0,1],
-"cpp/error/current_exception.html":[9,0,118,90],
-"cpp/error/generic_category.html":[9,0,118,173],
-"cpp/error/get_terminate.html":[9,0,118,178],
-"cpp/error/get_unexpected.html":[9,0,118,180],
-"cpp/error/make_exception_ptr.html":[9,0,118,256],
-"cpp/error/rethrow_exception.html":[9,0,118,353],
-"cpp/error/rethrow_if_nested.html":[9,0,118,354],
-"cpp/error/set_terminate.html":[9,0,118,374],
-"cpp/error/set_unexpected.html":[9,0,118,375],
-"cpp/error/system_category.html":[9,0,118,444],
-"cpp/error/terminate.html":[9,0,118,447],
-"cpp/error/throw_with_nested.html":[9,0,118,449],
-"cpp/error/uncaught_exception.html":[9,0,118,465],
-"cpp/error/unexpected.html":[9,0,118,468],
-"cpp/experimental/optional/make_optional.html":[9,0,118,1,0],
-"cpp/io/c/clearerr.html":[9,0,118,76],
-"cpp/io/c/fclose.html":[9,0,118,112],
-"cpp/io/c/feof.html":[9,0,118,119],
-"cpp/io/c/ferror.html":[9,0,118,121],
-"cpp/io/c/fflush.html":[9,0,118,127],
-"cpp/io/c/fgetc.html":[9,0,118,128],
-"cpp/io/c/fgetc.html":[9,0,118,181],
-"cpp/io/c/fgetpos.html":[9,0,118,129],
-"cpp/io/c/fgets.html":[9,0,118,130],
-"cpp/io/c/fgetwc.html":[9,0,118,131],
-"cpp/io/c/fgetws.html":[9,0,118,132],
-"cpp/io/c/fopen.html":[9,0,118,147],
-"cpp/io/c/fprintf.html":[9,0,118,152],
-"cpp/io/c/fprintf.html":[9,0,118,323],
-"cpp/io/c/fprintf.html":[9,0,118,394],
-"cpp/io/c/fprintf.html":[9,0,118,397],
-"cpp/io/c/fputc.html":[9,0,118,153],
-"cpp/io/c/fputc.html":[9,0,118,327],
-"cpp/io/c/fputs.html":[9,0,118,154],
-"cpp/io/c/fputwc.html":[9,0,118,155],
-"cpp/io/c/fputws.html":[9,0,118,156],
-"cpp/io/c/fread.html":[9,0,118,157],
-"cpp/io/c/freopen.html":[9,0,118,159],
-"cpp/io/c/fscanf.html":[9,0,118,162],
-"cpp/io/c/fscanf.html":[9,0,118,366],
-"cpp/io/c/fscanf.html":[9,0,118,400],
-"cpp/io/c/fseek.html":[9,0,118,163],
-"cpp/io/c/fsetpos.html":[9,0,118,164],
-"cpp/io/c/ftell.html":[9,0,118,165],
-"cpp/io/c/fwprintf.html":[9,0,118,167],
-"cpp/io/c/fwprintf.html":[9,0,118,441],
-"cpp/io/c/fwprintf.html":[9,0,118,531],
-"cpp/io/c/fwrite.html":[9,0,118,168],
-"cpp/io/c/fwscanf.html":[9,0,118,169],
-"cpp/io/c/fwscanf.html":[9,0,118,442],
-"cpp/io/c/fwscanf.html":[9,0,118,533],
-"cpp/io/c/getchar.html":[9,0,118,182],
-"cpp/io/c/gets.html":[9,0,118,185],
-"cpp/io/c/getwchar.html":[9,0,118,186],
-"cpp/io/c/perror.html":[9,0,118,318],
-"cpp/io/c/putchar.html":[9,0,118,328],
-"cpp/io/c/puts.html":[9,0,118,329],
-"cpp/io/c/putwchar.html":[9,0,118,330],
-"cpp/io/c/rename.html":[9,0,118,347],
-"cpp/io/c/rewind.html":[9,0,118,358],
-"cpp/io/c/setbuf.html":[9,0,118,378],
-"cpp/io/c/setvbuf.html":[9,0,118,383],
-"cpp/io/c/tmpfile.html":[9,0,118,452],
-"cpp/io/c/tmpnam.html":[9,0,118,453],
-"cpp/io/c/ungetc.html":[9,0,118,469],
-"cpp/io/c/ungetwc.html":[9,0,118,470],
-"cpp/io/c/vfprintf.html":[9,0,118,481],
-"cpp/io/c/vfprintf.html":[9,0,118,485],
-"cpp/io/c/vfprintf.html":[9,0,118,487],
-"cpp/io/c/vfprintf.html":[9,0,118,488],
-"cpp/io/c/vfscanf.html":[9,0,118,482],
-"cpp/io/c/vfscanf.html":[9,0,118,486],
-"cpp/io/c/vfscanf.html":[9,0,118,489],
-"cpp/io/c/vfwprintf.html":[9,0,118,483],
-"cpp/io/c/vfwprintf.html":[9,0,118,490],
-"cpp/io/c/vfwprintf.html":[9,0,118,492],
-"cpp/io/c/vfwscanf.html":[9,0,118,484],
-"cpp/io/c/vfwscanf.html":[9,0,118,491],
-"cpp/io/c/vfwscanf.html":[9,0,118,493],
-"cpp/io/manip/boolalpha.html":[9,0,118,67],
-"cpp/io/manip/boolalpha.html":[9,0,118,299],
-"cpp/io/manip/endl.html":[9,0,118,101],
-"cpp/io/manip/ends.html":[9,0,118,102],
-"cpp/io/manip/fixed.html":[9,0,118,95],
-"cpp/io/manip/fixed.html":[9,0,118,140],
-"cpp/io/manip/fixed.html":[9,0,118,190],
-"cpp/io/manip/fixed.html":[9,0,118,367],
-"cpp/io/manip/flush.html":[9,0,118,142],
-"cpp/io/manip/get_money.html":[9,0,118,174],
-"cpp/io/manip/get_time.html":[9,0,118,179],
-"cpp/io/manip/hex.html":[9,0,118,91],
-"cpp/io/manip/hex.html":[9,0,118,189],
-"cpp/io/manip/hex.html":[9,0,118,311],
-"cpp/io/manip/left.html":[9,0,118,197],
-"cpp/io/manip/left.html":[9,0,118,239],
-"cpp/io/manip/left.html":[9,0,118,359],
-"cpp/io/manip/put_money.html":[9,0,118,325],
-"cpp/io/manip/put_time.html":[9,0,118,326],
-"cpp/io/manip/resetiosflags.html":[9,0,118,352],
-"cpp/io/manip/setbase.html":[9,0,118,377],
-"cpp/io/manip/setfill.html":[9,0,118,379],
-"cpp/io/manip/setiosflags.html":[9,0,118,380],
-"cpp/io/manip/setprecision.html":[9,0,118,382],
-"cpp/io/manip/setw.html":[9,0,118,384],
-"cpp/io/manip/showbase.html":[9,0,118,301],
-"cpp/io/manip/showbase.html":[9,0,118,385],
-"cpp/io/manip/showpoint.html":[9,0,118,302],
-"cpp/io/manip/showpoint.html":[9,0,118,386],
-"cpp/io/manip/showpos.html":[9,0,118,303],
-"cpp/io/manip/showpos.html":[9,0,118,387],
-"cpp/io/manip/skipws.html":[9,0,118,304],
-"cpp/io/manip/skipws.html":[9,0,118,393],
-"cpp/io/manip/unitbuf.html":[9,0,118,308],
-"cpp/io/manip/unitbuf.html":[9,0,118,477],
-"cpp/io/manip/uppercase.html":[9,0,118,309],
-"cpp/io/manip/uppercase.html":[9,0,118,479],
-"cpp/io/manip/ws.html":[9,0,118,532],
-"cpp/iterator/advance.html":[9,0,118,21],
-"cpp/iterator/back_inserter.html":[9,0,118,63],
-"cpp/iterator/begin.html":[9,0,118,64]
+"d0/d01/smallest__circle_8cpp.html":[11,0,17,21],
+"d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,17,21,6],
+"d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903":[11,0,17,21,1],
+"d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a":[11,0,17,21,2],
+"d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e":[11,0,17,21,7],
+"d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc":[11,0,17,21,8],
+"d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,17,21,5],
+"d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,21,3],
+"d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad":[11,0,17,21,4],
+"d0/d01/smallest__circle_8cpp_source.html":[11,0,17,21],
+"d0/d08/realtime__stats_8cpp.html":[11,0,14,52],
+"d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,14,52,2],
+"d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd":[11,0,14,52,3],
+"d0/d08/realtime__stats_8cpp_source.html":[11,0,14,52],
+"d0/d20/namespaceground__to__ground__projectile__motion.html":[9,0,43],
+"d0/d2b/namespacequick__sort.html":[9,0,98],
+"d0/d2e/namespaceneural__network.html":[9,0,85],
+"d0/d3e/classdata__structures_1_1trie.html":[9,0,21,7],
+"d0/d3e/classdata__structures_1_1trie.html":[10,0,2,14],
+"d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546":[9,0,21,7,3],
+"d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546":[10,0,2,14,3],
+"d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b":[9,0,21,7,6],
+"d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b":[10,0,2,14,6],
+"d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d":[9,0,21,7,5],
+"d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d":[10,0,2,14,5],
+"d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191":[9,0,21,7,8],
+"d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191":[10,0,2,14,8],
+"d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6":[9,0,21,7,7],
+"d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6":[10,0,2,14,7],
+"d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8":[9,0,21,7,0],
+"d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8":[10,0,2,14,0],
+"d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63":[9,0,21,7,4],
+"d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63":[10,0,2,14,4],
+"d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988":[9,0,21,7,1],
+"d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988":[10,0,2,14,1],
+"d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab":[9,0,21,7,2],
+"d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab":[10,0,2,14,2],
+"d0/d46/finding__number__of__digits__in__a__number_8cpp.html":[11,0,14,21],
+"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1":[11,0,14,21,0],
+"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300":[11,0,14,21,2],
+"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49":[11,0,14,21,1],
+"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,21,3],
+"d0/d46/finding__number__of__digits__in__a__number_8cpp_source.html":[11,0,14,21],
+"d0/d51/approximate__pi_8cpp.html":[11,0,14,1],
+"d0/d51/approximate__pi_8cpp.html#a006c8ebd11bb1e035815dc835a1a7a85":[11,0,14,1,0],
+"d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,1,3],
+"d0/d51/approximate__pi_8cpp.html#abf7f2a6d91f1ca6c89698792aea3f188":[11,0,14,1,1],
+"d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,1,2],
+"d0/d51/approximate__pi_8cpp_source.html":[11,0,14,1],
+"d0/d52/namespacewiggle__sort.html":[9,0,139],
+"d0/d58/classgraph_1_1_rooted_tree.html":[9,0,39,3],
+"d0/d58/classgraph_1_1_rooted_tree.html":[10,0,6,5],
+"d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3":[9,0,39,3,2],
+"d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3":[10,0,6,5,2],
+"d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43":[9,0,39,3,3],
+"d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43":[10,0,6,5,3],
+"d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d":[9,0,39,3,0],
+"d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d":[10,0,6,5,0],
+"d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe":[9,0,39,3,4],
+"d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe":[10,0,6,5,4],
+"d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e":[9,0,39,3,1],
+"d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e":[10,0,6,5,1],
+"d0/d5a/skip__list_8cpp.html":[11,0,4,25],
+"d0/d5a/skip__list_8cpp.html#a903639d8e6f955dd8d5c263781455d61":[11,0,4,25,4],
+"d0/d5a/skip__list_8cpp.html#ac0d7e0be24da9f41bcb19745873c436a":[11,0,4,25,3],
+"d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,25,2],
+"d0/d5a/skip__list_8cpp_source.html":[11,0,4,25],
+"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html":[10,0,12,3,0],
+"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe":[10,0,12,3,0,8],
+"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a18b70172ca4fb2811dbfb9a86e48b34c":[10,0,12,3,0,6],
+"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a4a624fcdf3c3beb2025d69f2cfda8023":[10,0,12,3,0,5],
+"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503":[10,0,12,3,0,4],
+"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c":[10,0,12,3,0,2],
+"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c":[10,0,12,3,0,9],
+"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6":[10,0,12,3,0,7],
+"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169":[10,0,12,3,0,1],
+"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aefd24626ac47277431c9b8604e064340":[10,0,12,3,0,0],
+"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0":[10,0,12,3,0,3],
+"d0/d61/knapsack_8cpp_source.html":[11,0,11,7],
+"d0/d65/namespacedouble__hashing.html":[8,0,0],
+"d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003":[9,0,26,5],
+"d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd":[9,0,26,3],
+"d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931":[9,0,26,10],
+"d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6":[9,0,26,11],
+"d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082":[9,0,26,6],
+"d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824":[9,0,26,9],
+"d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a":[9,0,26,1],
+"d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200":[9,0,26,4],
+"d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560":[9,0,26,2],
+"d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b":[9,0,26,7],
+"d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d":[9,0,26,8],
+"d0/d6d/modular__exponentiation_8cpp.html":[11,0,14,38],
+"d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,38,2],
+"d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,38,0],
+"d0/d6d/modular__exponentiation_8cpp.html#afcd07701d73ed65cd616bcba02737f3d":[11,0,14,38,1],
+"d0/d6d/modular__exponentiation_8cpp_source.html":[11,0,14,38],
+"d0/d6f/namespaceothers.html":[9,0,88],
+"d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec":[9,0,88,2],
+"d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703":[9,0,88,1],
+"d0/d77/longest__palindromic__subsequence_8cpp.html":[11,0,6,18],
+"d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,18,2],
+"d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,18,1],
+"d0/d77/longest__palindromic__subsequence_8cpp.html#afe9f45b6e30ee187509da2d1d0093412":[11,0,6,18,0],
+"d0/d77/longest__palindromic__subsequence_8cpp_source.html":[11,0,6,18],
+"d0/da2/number__of__positive__divisors_8cpp.html":[11,0,14,44],
+"d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,14,44,2],
+"d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb":[11,0,14,44,1],
+"d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,44,0],
+"d0/da2/number__of__positive__divisors_8cpp_source.html":[11,0,14,44],
+"d0/da4/namespacemonte__carlo.html":[9,0,78],
+"d0/db6/non__recursive__merge__sort_8cpp.html":[11,0,23,20],
+"d0/db6/non__recursive__merge__sort_8cpp.html#a140d913e42fb94176a0b2c8b29a80420":[11,0,23,20,2],
+"d0/db6/non__recursive__merge__sort_8cpp.html#a27236b8d3df3832e1f1225576a122534":[11,0,23,20,3],
+"d0/db6/non__recursive__merge__sort_8cpp.html#aa26de383227859210f14dcf12201a079":[11,0,23,20,0],
+"d0/db6/non__recursive__merge__sort_8cpp.html#ae97f4dd815654c4682f564afd718e824":[11,0,23,20,1],
+"d0/db6/non__recursive__merge__sort_8cpp_source.html":[11,0,23,20],
+"d0/dbc/namespacestrings_1_1boyer__moore.html":[9,0,122,0],
+"d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a":[9,0,122,0,4],
+"d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8":[9,0,122,0,3],
+"d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738":[9,0,122,0,5],
+"d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00":[9,0,122,0,1],
+"d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1":[9,0,122,0,2],
+"d0/dd2/treap_8cpp.html":[11,0,4,34],
+"d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,4,34,2],
+"d0/dd2/treap_8cpp.html#ad939ec178d0069aeea14b7d6d7d12099":[11,0,4,34,3],
+"d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,34,1],
+"d0/dd2/treap_8cpp_source.html":[11,0,4,34],
+"d0/dd5/namespacebubble__sort.html":[9,0,11],
+"d0/dda/namespacesaddleback.html":[9,0,105],
+"d0/de2/gaussian__elimination_8cpp.html":[11,0,15,7],
+"d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,7,0],
+"d0/de2/gaussian__elimination_8cpp_source.html":[11,0,15,7],
+"d0/dea/strassen__matrix__multiplication_8cpp_source.html":[11,0,5,1],
+"d0/df8/namespaceabbreviation.html":[9,0,1],
+"d0/dff/structlinkedlist.html":[10,0,38],
+"d1/d11/gcd__of__n__numbers_8cpp.html":[11,0,14,23],
+"d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532":[11,0,14,23,1],
+"d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181":[11,0,14,23,2],
+"d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a":[11,0,14,23,0],
+"d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,23,4],
+"d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,23,3],
+"d1/d11/gcd__of__n__numbers_8cpp_source.html":[11,0,14,23],
+"d1/d12/tree_8cpp_source.html":[11,0,4,35],
+"d1/d1b/topological__sort__by__kahns__algo_8cpp_source.html":[11,0,9,19],
+"d1/d1c/base64__encoding_8cpp_source.html":[11,0,2,2],
+"d1/d21/quick__sort_8cpp.html":[11,0,23,25],
+"d1/d21/quick__sort_8cpp.html#a1b2a2cc2d319240f3b65c5b2f479ed82":[11,0,23,25,1],
+"d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,23,25,5],
+"d1/d21/quick__sort_8cpp.html#a53adad7e4d83e1495df25fe8dbb4cc05":[11,0,23,25,3],
+"d1/d21/quick__sort_8cpp.html#a5e6213e8008356ac6eda9427f3f4b394":[11,0,23,25,2],
+"d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,25,0],
+"d1/d21/quick__sort_8cpp.html#aeccefcf6fcca62c54939c5ec9a93109b":[11,0,23,25,4],
+"d1/d21/quick__sort_8cpp_source.html":[11,0,23,25],
+"d1/d2a/knight__tour_8cpp.html":[11,0,0,2],
+"d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9":[11,0,0,2,2],
+"d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,2,1],
+"d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2":[11,0,0,2,0],
+"d1/d2a/knight__tour_8cpp_source.html":[11,0,0,2],
+"d1/d35/namespaceexponential__dist.html":[9,0,29],
+"d1/d40/counting__sort_8cpp_source.html":[11,0,23,9],
+"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html":[10,0,16,0,2],
+"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70":[10,0,16,0,2,9],
+"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1":[10,0,16,0,2,11],
+"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a135b7952593c9b1aae38fcaf1cc1abf7":[10,0,16,0,2,17],
+"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203":[10,0,16,0,2,14],
+"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d":[10,0,16,0,2,1],
+"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1":[10,0,16,0,2,0],
+"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a8f7bca1746d40f21ad832fcea59aa6c6":[10,0,16,0,2,6],
+"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460":[10,0,16,0,2,4],
+"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa6c37e840355b9fb2105181c578694e8":[10,0,16,0,2,15],
+"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab1aeaefa1bd97b867c652ba916fbdb43":[10,0,16,0,2,10],
+"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab2ab020f798d00be2613ecf63074b7c1":[10,0,16,0,2,12],
+"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0":[10,0,16,0,2,2],
+"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3":[10,0,16,0,2,8],
+"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc":[10,0,16,0,2,5],
+"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ada1494fccbc7f1f07b2f9be9f7e07ad5":[10,0,16,0,2,16],
+"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4":[10,0,16,0,2,7],
+"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a":[10,0,16,0,2,13],
+"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4":[10,0,16,0,2,3],
+"d1/d64/namespaceinterpolation__search.html":[9,0,50],
+"d1/d64/namespacemodular__division.html":[9,0,76],
+"d1/d70/cll_8cpp_source.html":[11,0,4,0,0],
+"d1/d76/buzz__number_8cpp.html":[11,0,17,0],
+"d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,0,0],
+"d1/d76/buzz__number_8cpp_source.html":[11,0,17,0],
+"d1/d77/structmst.html":[10,0,44],
+"d1/d7c/fibonacci__bottom__up_8cpp_source.html":[11,0,6,10],
+"d1/d83/classuint256__t.html":[10,0,61],
+"d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3":[10,0,61,4],
+"d1/d83/classuint256__t.html#a028c585069fa53b74c153667ff66352c":[10,0,61,15],
+"d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163":[10,0,61,8],
+"d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa":[10,0,61,3],
+"d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5":[10,0,61,53],
+"d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88":[10,0,61,55],
+"d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39":[10,0,61,1],
+"d1/d83/classuint256__t.html#a2029e9777f999bffef6004429b4f19f2":[10,0,61,54],
+"d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f":[10,0,61,33],
+"d1/d83/classuint256__t.html#a28aa5786bbfce1b00398a8d38691bdaa":[10,0,61,12],
+"d1/d83/classuint256__t.html#a28d26847f9b19a4f86c187791cb0db13":[10,0,61,43],
+"d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052":[10,0,61,5],
+"d1/d83/classuint256__t.html#a2cd43a4a92dc825a010a17578b3bdedb":[10,0,61,21],
+"d1/d83/classuint256__t.html#a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2":[10,0,61,73],
+"d1/d83/classuint256__t.html#a303287d7bc8686dcb47fcb04720ad409":[10,0,61,24],
+"d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d":[10,0,61,27],
+"d1/d83/classuint256__t.html#a3dc4d3ab175f5f2a3172eb8d99a60fc3":[10,0,61,70],
+"d1/d83/classuint256__t.html#a3ff17ab14b2371eb3239107d10947067":[10,0,61,6],
+"d1/d83/classuint256__t.html#a406c951a07d8173685dbe384c6ab6a06":[10,0,61,39],
+"d1/d83/classuint256__t.html#a41f4bb928c4ee067732503395b65f9d7":[10,0,61,77],
+"d1/d83/classuint256__t.html#a42bf7490b31d8c750a67fd9bb6f2df2e":[10,0,61,2],
+"d1/d83/classuint256__t.html#a4645040fe68ff01d83400f173fd2bb21":[10,0,61,32],
+"d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51":[10,0,61,66],
+"d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5":[10,0,61,52],
+"d1/d83/classuint256__t.html#a4886747ffff15cdeb6bc93712629f9e7":[10,0,61,76],
+"d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc":[10,0,61,58],
+"d1/d83/classuint256__t.html#a4fdeb4d4bf8cca4ee99b8487e59831df":[10,0,61,47],
+"d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1":[10,0,61,37],
+"d1/d83/classuint256__t.html#a5e84ed2a2f99cee81ede4a0107702a45":[10,0,61,45],
+"d1/d83/classuint256__t.html#a6c5e025f901f6af4b748f98013350638":[10,0,61,59],
+"d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8":[10,0,61,22],
+"d1/d83/classuint256__t.html#a6eec1f632aebfc44fee8a74c395e10c2":[10,0,61,78],
+"d1/d83/classuint256__t.html#a74d1e1dd8cd2b31e00813ed939943be7":[10,0,61,69],
+"d1/d83/classuint256__t.html#a76914bc727eab927a3941ef71275327d":[10,0,61,20],
+"d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b":[10,0,61,28],
+"d1/d83/classuint256__t.html#a7bbe36e2ebd52df5efab118897b3050c":[10,0,61,36],
+"d1/d83/classuint256__t.html#a7bd9693b88c4df08b1f8d1fd81c597cc":[10,0,61,18],
+"d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1":[10,0,61,10],
+"d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2":[10,0,61,56],
+"d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4":[10,0,61,40],
+"d1/d83/classuint256__t.html#a89cf7fa466458ee08edd9a809d072bcb":[10,0,61,16],
+"d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261":[10,0,61,61],
+"d1/d83/classuint256__t.html#a91badfd31be84b12cbb6d85ebc04d13a":[10,0,61,80],
+"d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484":[10,0,61,60],
+"d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839":[10,0,61,23],
+"d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250":[10,0,61,9],
+"d1/d83/classuint256__t.html#a9e1b39a46ea16bc6587e25e294c6c363":[10,0,61,13],
+"d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183":[10,0,61,42],
+"d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963":[10,0,61,25],
+"d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc":[10,0,61,75],
+"d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1":[10,0,61,11],
+"d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967":[10,0,61,30],
+"d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616":[10,0,61,29],
+"d1/d83/classuint256__t.html#aae68a7bd17c14a926fb77758b5c8e547":[10,0,61,17],
+"d1/d83/classuint256__t.html#ab909ef62a0c85121e7d743c016fb723d":[10,0,61,41],
+"d1/d83/classuint256__t.html#abc793979ec70bb8e5cf177d83649a259":[10,0,61,48],
+"d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4":[10,0,61,49],
+"d1/d83/classuint256__t.html#ac6bdcf64653af8173987bf7217e99056":[10,0,61,50],
+"d1/d83/classuint256__t.html#ac75a46fe3625caf10e07db1eb75a1d6e":[10,0,61,38],
+"d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7":[10,0,61,71]
 };
diff --git a/navtreeindex1.js b/navtreeindex1.js
index 1be19fb22..e457c4c32 100644
--- a/navtreeindex1.js
+++ b/navtreeindex1.js
@@ -1,253 +1,253 @@
 var NAVTREEINDEX1 =
 {
-"cpp/iterator/distance.html":[9,0,118,97],
-"cpp/iterator/end.html":[9,0,118,100],
-"cpp/iterator/front_inserter.html":[9,0,118,161],
-"cpp/iterator/inserter.html":[9,0,118,196],
-"cpp/iterator/make_move_iterator.html":[9,0,118,258],
-"cpp/iterator/next.html":[9,0,118,295],
-"cpp/iterator/prev.html":[9,0,118,321],
-"cpp/locale/has_facet.html":[9,0,118,188],
-"cpp/locale/localeconv.html":[9,0,118,245],
-"cpp/locale/setlocale.html":[9,0,118,381],
-"cpp/locale/use_facet.html":[9,0,118,480],
-"cpp/memory/addressof.html":[9,0,118,18],
-"cpp/memory/align.html":[9,0,118,22],
-"cpp/memory/c/calloc.html":[9,0,118,73],
-"cpp/memory/c/free.html":[9,0,118,158],
-"cpp/memory/c/malloc.html":[9,0,118,262],
-"cpp/memory/c/realloc.html":[9,0,118,336],
-"cpp/memory/gc/declare_no_pointers.html":[9,0,118,92],
-"cpp/memory/gc/declare_reachable.html":[9,0,118,93],
-"cpp/memory/gc/get_pointer_safety.html":[9,0,118,176],
-"cpp/memory/gc/undeclare_no_pointers.html":[9,0,118,466],
-"cpp/memory/gc/undeclare_reachable.html":[9,0,118,467],
-"cpp/memory/get_temporary_buffer.html":[9,0,118,177],
-"cpp/memory/new/get_new_handler.html":[9,0,118,175],
-"cpp/memory/new/set_new_handler.html":[9,0,118,372],
-"cpp/memory/return_temporary_buffer.html":[9,0,118,355],
-"cpp/memory/shared_ptr/allocate_shared.html":[9,0,118,24],
-"cpp/memory/shared_ptr/make_shared.html":[9,0,118,260],
-"cpp/memory/shared_ptr/pointer_cast.html":[9,0,118,78],
-"cpp/memory/shared_ptr/pointer_cast.html":[9,0,118,99],
-"cpp/memory/shared_ptr/pointer_cast.html":[9,0,118,403],
-"cpp/memory/uninitialized_copy.html":[9,0,118,471],
-"cpp/memory/uninitialized_copy_n.html":[9,0,118,472],
-"cpp/memory/uninitialized_fill.html":[9,0,118,473],
-"cpp/memory/uninitialized_fill_n.html":[9,0,118,474],
-"cpp/numeric/fenv/feclearexcept.html":[9,0,118,114],
-"cpp/numeric/fenv/feenv.html":[9,0,118,115],
-"cpp/numeric/fenv/feenv.html":[9,0,118,122],
-"cpp/numeric/fenv/feexceptflag.html":[9,0,118,116],
-"cpp/numeric/fenv/feexceptflag.html":[9,0,118,123],
-"cpp/numeric/fenv/feholdexcept.html":[9,0,118,118],
-"cpp/numeric/fenv/feraiseexcept.html":[9,0,118,120],
-"cpp/numeric/fenv/feround.html":[9,0,118,117],
-"cpp/numeric/fenv/feround.html":[9,0,118,124],
-"cpp/numeric/fenv/fetestexcept.html":[9,0,118,125],
-"cpp/numeric/fenv/feupdateenv.html":[9,0,118,126],
-"cpp/numeric/math/abs.html":[9,0,118,14],
-"cpp/numeric/math/abs.html":[9,0,118,236],
-"cpp/numeric/math/abs.html":[9,0,118,242],
-"cpp/numeric/math/acos.html":[9,0,118,16],
-"cpp/numeric/math/acosh.html":[9,0,118,17],
-"cpp/numeric/math/asin.html":[9,0,118,27],
-"cpp/numeric/math/asinh.html":[9,0,118,28],
-"cpp/numeric/math/atan.html":[9,0,118,31],
-"cpp/numeric/math/atan2.html":[9,0,118,32],
-"cpp/numeric/math/atanh.html":[9,0,118,33],
-"cpp/numeric/math/cbrt.html":[9,0,118,74],
-"cpp/numeric/math/ceil.html":[9,0,118,75],
-"cpp/numeric/math/copysign.html":[9,0,118,83],
-"cpp/numeric/math/cos.html":[9,0,118,84],
-"cpp/numeric/math/cosh.html":[9,0,118,85],
-"cpp/numeric/math/div.html":[9,0,118,98],
-"cpp/numeric/math/div.html":[9,0,118,238],
-"cpp/numeric/math/erf.html":[9,0,118,105],
-"cpp/numeric/math/erfc.html":[9,0,118,106],
-"cpp/numeric/math/exp.html":[9,0,118,108],
-"cpp/numeric/math/exp2.html":[9,0,118,109],
-"cpp/numeric/math/expm1.html":[9,0,118,110],
-"cpp/numeric/math/fabs.html":[9,0,118,13],
-"cpp/numeric/math/fabs.html":[9,0,118,111],
-"cpp/numeric/math/fdim.html":[9,0,118,113],
-"cpp/numeric/math/floor.html":[9,0,118,141],
-"cpp/numeric/math/fma.html":[9,0,118,143],
-"cpp/numeric/math/fmax.html":[9,0,118,144],
-"cpp/numeric/math/fmin.html":[9,0,118,145],
-"cpp/numeric/math/fmod.html":[9,0,118,146],
-"cpp/numeric/math/fpclassify.html":[9,0,118,151],
-"cpp/numeric/math/frexp.html":[9,0,118,160],
-"cpp/numeric/math/hypot.html":[9,0,118,191],
-"cpp/numeric/math/ilogb.html":[9,0,118,192],
-"cpp/numeric/math/isfinite.html":[9,0,118,210],
-"cpp/numeric/math/isinf.html":[9,0,118,212],
-"cpp/numeric/math/isnan.html":[9,0,118,214],
-"cpp/numeric/math/isnormal.html":[9,0,118,215],
-"cpp/numeric/math/ldexp.html":[9,0,118,237],
-"cpp/numeric/math/lgamma.html":[9,0,118,241],
-"cpp/numeric/math/log.html":[9,0,118,248],
-"cpp/numeric/math/log10.html":[9,0,118,249],
-"cpp/numeric/math/log1p.html":[9,0,118,250],
-"cpp/numeric/math/logb.html":[9,0,118,251],
-"cpp/numeric/math/modf.html":[9,0,118,287],
-"cpp/numeric/math/nan.html":[9,0,118,291],
-"cpp/numeric/math/nan.html":[9,0,118,292],
-"cpp/numeric/math/nan.html":[9,0,118,293],
-"cpp/numeric/math/nearbyint.html":[9,0,118,294],
-"cpp/numeric/math/nextafter.html":[9,0,118,297],
-"cpp/numeric/math/nextafter.html":[9,0,118,298],
-"cpp/numeric/math/pow.html":[9,0,118,320],
-"cpp/numeric/math/remainder.html":[9,0,118,341],
-"cpp/numeric/math/remquo.html":[9,0,118,346],
-"cpp/numeric/math/rint.html":[9,0,118,243],
-"cpp/numeric/math/rint.html":[9,0,118,254],
-"cpp/numeric/math/rint.html":[9,0,118,360],
-"cpp/numeric/math/round.html":[9,0,118,244],
-"cpp/numeric/math/round.html":[9,0,118,255],
-"cpp/numeric/math/round.html":[9,0,118,363],
-"cpp/numeric/math/scalbn.html":[9,0,118,364],
-"cpp/numeric/math/scalbn.html":[9,0,118,365],
-"cpp/numeric/math/signbit.html":[9,0,118,390],
-"cpp/numeric/math/sin.html":[9,0,118,391],
-"cpp/numeric/math/sinh.html":[9,0,118,392],
-"cpp/numeric/math/sqrt.html":[9,0,118,398],
-"cpp/numeric/math/tan.html":[9,0,118,445],
-"cpp/numeric/math/tanh.html":[9,0,118,446],
-"cpp/numeric/math/tgamma.html":[9,0,118,448],
-"cpp/numeric/math/trunc.html":[9,0,118,462],
-"cpp/numeric/random/generate_canonical.html":[9,0,118,171],
-"cpp/numeric/random/rand.html":[9,0,118,334],
-"cpp/numeric/random/srand.html":[9,0,118,399],
-"cpp/regex/regex_match.html":[9,0,118,338],
-"cpp/regex/regex_replace.html":[9,0,118,339],
-"cpp/regex/regex_search.html":[9,0,118,340],
-"cpp/string/basic_string/getline.html":[9,0,118,184],
-"cpp/string/basic_string/stof.html":[9,0,118,404],
-"cpp/string/basic_string/stof.html":[9,0,118,405],
-"cpp/string/basic_string/stof.html":[9,0,118,408],
-"cpp/string/basic_string/stol.html":[9,0,118,406],
-"cpp/string/basic_string/stol.html":[9,0,118,407],
-"cpp/string/basic_string/stol.html":[9,0,118,409],
-"cpp/string/basic_string/stoul.html":[9,0,118,410],
-"cpp/string/basic_string/stoul.html":[9,0,118,411],
-"cpp/string/basic_string/to_string.html":[9,0,118,454],
-"cpp/string/basic_string/to_wstring.html":[9,0,118,455],
-"cpp/string/byte/atof.html":[9,0,118,35],
-"cpp/string/byte/atoi.html":[9,0,118,36],
-"cpp/string/byte/atoi.html":[9,0,118,37],
-"cpp/string/byte/atoi.html":[9,0,118,38],
-"cpp/string/byte/isalnum.html":[9,0,118,205],
-"cpp/string/byte/isalpha.html":[9,0,118,206],
-"cpp/string/byte/isblank.html":[9,0,118,207],
-"cpp/string/byte/iscntrl.html":[9,0,118,208],
-"cpp/string/byte/isdigit.html":[9,0,118,209],
-"cpp/string/byte/isgraph.html":[9,0,118,211],
-"cpp/string/byte/islower.html":[9,0,118,213],
-"cpp/string/byte/isprint.html":[9,0,118,216],
-"cpp/string/byte/ispunct.html":[9,0,118,217],
-"cpp/string/byte/isspace.html":[9,0,118,218],
-"cpp/string/byte/isupper.html":[9,0,118,219],
-"cpp/string/byte/isxdigit.html":[9,0,118,233],
-"cpp/string/byte/memchr.html":[9,0,118,275],
-"cpp/string/byte/memcmp.html":[9,0,118,276],
-"cpp/string/byte/memcpy.html":[9,0,118,277],
-"cpp/string/byte/memmove.html":[9,0,118,278],
-"cpp/string/byte/memset.html":[9,0,118,279],
-"cpp/string/byte/strcat.html":[9,0,118,412],
-"cpp/string/byte/strchr.html":[9,0,118,413],
-"cpp/string/byte/strcmp.html":[9,0,118,414],
-"cpp/string/byte/strcoll.html":[9,0,118,415],
-"cpp/string/byte/strcpy.html":[9,0,118,416],
-"cpp/string/byte/strcspn.html":[9,0,118,417],
-"cpp/string/byte/strerror.html":[9,0,118,418],
-"cpp/string/byte/strlen.html":[9,0,118,420],
-"cpp/string/byte/strncat.html":[9,0,118,421],
-"cpp/string/byte/strncmp.html":[9,0,118,422],
-"cpp/string/byte/strncpy.html":[9,0,118,423],
-"cpp/string/byte/strpbrk.html":[9,0,118,424],
-"cpp/string/byte/strrchr.html":[9,0,118,425],
-"cpp/string/byte/strspn.html":[9,0,118,426],
-"cpp/string/byte/strstr.html":[9,0,118,427],
-"cpp/string/byte/strtof.html":[9,0,118,428],
-"cpp/string/byte/strtof.html":[9,0,118,429],
-"cpp/string/byte/strtof.html":[9,0,118,433],
-"cpp/string/byte/strtoimax.html":[9,0,118,430],
-"cpp/string/byte/strtoimax.html":[9,0,118,437],
-"cpp/string/byte/strtok.html":[9,0,118,431],
-"cpp/string/byte/strtol.html":[9,0,118,432],
-"cpp/string/byte/strtol.html":[9,0,118,434],
-"cpp/string/byte/strtoul.html":[9,0,118,435],
-"cpp/string/byte/strtoul.html":[9,0,118,436],
-"cpp/string/byte/strxfrm.html":[9,0,118,438],
-"cpp/string/byte/tolower.html":[9,0,118,456],
-"cpp/string/byte/toupper.html":[9,0,118,457],
-"cpp/string/multibyte/btowc.html":[9,0,118,69],
-"cpp/string/multibyte/c16rtomb.html":[9,0,118,70],
-"cpp/string/multibyte/c32rtomb.html":[9,0,118,71],
-"cpp/string/multibyte/mblen.html":[9,0,118,265],
-"cpp/string/multibyte/mbrlen.html":[9,0,118,266],
-"cpp/string/multibyte/mbrtoc16.html":[9,0,118,267],
-"cpp/string/multibyte/mbrtoc32.html":[9,0,118,268],
-"cpp/string/multibyte/mbrtowc.html":[9,0,118,269],
-"cpp/string/multibyte/mbsinit.html":[9,0,118,270],
-"cpp/string/multibyte/mbsrtowcs.html":[9,0,118,271],
-"cpp/string/multibyte/mbstowcs.html":[9,0,118,272],
-"cpp/string/multibyte/mbtowc.html":[9,0,118,273],
-"cpp/string/multibyte/wcrtomb.html":[9,0,118,494],
-"cpp/string/multibyte/wcstombs.html":[9,0,118,517],
-"cpp/string/multibyte/wctob.html":[9,0,118,522],
-"cpp/string/multibyte/wctomb.html":[9,0,118,523],
-"cpp/string/wide/iswalnum.html":[9,0,118,220],
-"cpp/string/wide/iswalpha.html":[9,0,118,221],
-"cpp/string/wide/iswblank.html":[9,0,118,222],
-"cpp/string/wide/iswcntrl.html":[9,0,118,223],
-"cpp/string/wide/iswctype.html":[9,0,118,224],
-"cpp/string/wide/iswdigit.html":[9,0,118,225],
-"cpp/string/wide/iswgraph.html":[9,0,118,226],
-"cpp/string/wide/iswlower.html":[9,0,118,227],
-"cpp/string/wide/iswprint.html":[9,0,118,228],
-"cpp/string/wide/iswpunct.html":[9,0,118,229],
-"cpp/string/wide/iswspace.html":[9,0,118,230],
-"cpp/string/wide/iswupper.html":[9,0,118,231],
-"cpp/string/wide/iswxdigit.html":[9,0,118,232],
-"cpp/string/wide/towctrans.html":[9,0,118,458],
-"cpp/string/wide/towlower.html":[9,0,118,459],
-"cpp/string/wide/towupper.html":[9,0,118,460],
-"cpp/string/wide/wcscat.html":[9,0,118,495],
-"cpp/string/wide/wcschr.html":[9,0,118,496],
-"cpp/string/wide/wcscmp.html":[9,0,118,497],
-"cpp/string/wide/wcscoll.html":[9,0,118,498],
-"cpp/string/wide/wcscpy.html":[9,0,118,499],
-"cpp/string/wide/wcscspn.html":[9,0,118,500],
-"cpp/string/wide/wcslen.html":[9,0,118,502],
-"cpp/string/wide/wcsncat.html":[9,0,118,503],
-"cpp/string/wide/wcsncmp.html":[9,0,118,504],
-"cpp/string/wide/wcsncpy.html":[9,0,118,505],
-"cpp/string/wide/wcspbrk.html":[9,0,118,506],
-"cpp/string/wide/wcsrchr.html":[9,0,118,507],
-"cpp/string/wide/wcsspn.html":[9,0,118,508],
-"cpp/string/wide/wcsstr.html":[9,0,118,509],
-"cpp/string/wide/wcstof.html":[9,0,118,510],
-"cpp/string/wide/wcstof.html":[9,0,118,511],
-"cpp/string/wide/wcstof.html":[9,0,118,515],
-"cpp/string/wide/wcstoimax.html":[9,0,118,512],
-"cpp/string/wide/wcstoimax.html":[9,0,118,520],
-"cpp/string/wide/wcstok.html":[9,0,118,513],
-"cpp/string/wide/wcstol.html":[9,0,118,514],
-"cpp/string/wide/wcstol.html":[9,0,118,516],
-"cpp/string/wide/wcstoul.html":[9,0,118,518],
-"cpp/string/wide/wcstoul.html":[9,0,118,519],
-"cpp/string/wide/wcsxfrm.html":[9,0,118,521],
-"cpp/string/wide/wctrans.html":[9,0,118,524],
-"cpp/string/wide/wctype.html":[9,0,118,525],
-"cpp/string/wide/wmemchr.html":[9,0,118,526],
-"cpp/string/wide/wmemcmp.html":[9,0,118,527],
-"cpp/string/wide/wmemcpy.html":[9,0,118,528],
-"cpp/string/wide/wmemmove.html":[9,0,118,529],
-"cpp/string/wide/wmemset.html":[9,0,118,530],
-"cpp/thread/async.html":[9,0,118,29],
-"cpp/thread/call_once.html":[9,0,118,72],
-"cpp/thread/future/future_category.html":[9,0,118,166],
-"cpp/thread/get_id.html":[9,0,118,4,0]
+"d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6":[10,0,61,46],
+"d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d":[10,0,61,63],
+"d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e":[10,0,61,68],
+"d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7":[10,0,61,44],
+"d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf":[10,0,61,72],
+"d1/d83/classuint256__t.html#ad4928175eaaaa2b559bc945affe63ad2":[10,0,61,19],
+"d1/d83/classuint256__t.html#ad5bd38b2d3becca998457af1124d6e8b":[10,0,61,14],
+"d1/d83/classuint256__t.html#ad74d33215517459c2b33ace7a9c6bc13":[10,0,61,62],
+"d1/d83/classuint256__t.html#ad9ce2370b1497efbcc426793048e1f78":[10,0,61,67],
+"d1/d83/classuint256__t.html#addff5645f6005e7b50a6ad0731e4f19c":[10,0,61,57],
+"d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad":[10,0,61,65],
+"d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5":[10,0,61,79],
+"d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc":[10,0,61,0],
+"d1/d83/classuint256__t.html#af0a6e09fcf1cbf234ed32df6d7265a0b":[10,0,61,74],
+"d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9":[10,0,61,35],
+"d1/d83/classuint256__t.html#af18e2e3d7ed635c4056062bc906fef75":[10,0,61,34],
+"d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028":[10,0,61,31],
+"d1/d83/classuint256__t.html#afa79020c27caea31236d04ecaa0e5ef5":[10,0,61,26],
+"d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96":[10,0,61,51],
+"d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4":[10,0,61,7],
+"d1/d83/classuint256__t.html#aff4d49cf84de64301b169ad974f00bad":[10,0,61,64],
+"d1/d9a/hopcroft__karp_8cpp.html":[11,0,9,10],
+"d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,9,10,2],
+"d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,10,1],
+"d1/d9a/hopcroft__karp_8cpp_source.html":[11,0,9,10],
+"d1/d9e/prefix__sum__array_8cpp.html":[11,0,20,4],
+"d1/d9e/prefix__sum__array_8cpp.html#a7c8fd967c36dbba5fdf9c71faed604cf":[11,0,20,4,2],
+"d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,20,4,3],
+"d1/d9e/prefix__sum__array_8cpp.html#ab36151479ad37d53ef9fcb60a274b1d9":[11,0,20,4,0],
+"d1/d9e/prefix__sum__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,4,1],
+"d1/d9e/prefix__sum__array_8cpp_source.html":[11,0,20,4],
+"d1/da6/rungekutta_8cpp.html":[11,0,15,21],
+"d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579":[11,0,15,21,0],
+"d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856":[11,0,15,21,2],
+"d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,15,21,3],
+"d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,21,1],
+"d1/da6/rungekutta_8cpp_source.html":[11,0,15,21],
+"d1/da7/armstrong__number__templated_8cpp.html":[11,0,6,2],
+"d1/da7/armstrong__number__templated_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,6,2,2],
+"d1/da7/armstrong__number__templated_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,2,1],
+"d1/da7/armstrong__number__templated_8cpp.html#af046365a8d77a1267acc082f86135a26":[11,0,6,2,0],
+"d1/da7/armstrong__number__templated_8cpp_source.html":[11,0,6,2],
+"d1/daa/random__pivot__quick__sort_8cpp.html":[11,0,23,30],
+"d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,23,30,3],
+"d1/daa/random__pivot__quick__sort_8cpp.html#a3d1c39e1ff42c04fb8ec0c0b9411cd3e":[11,0,23,30,4],
+"d1/daa/random__pivot__quick__sort_8cpp.html#a40675d2eb960c71ca31ec475ba90120d":[11,0,23,30,1],
+"d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5":[11,0,23,30,5],
+"d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,23,30,7],
+"d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5":[11,0,23,30,2],
+"d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10":[11,0,23,30,6],
+"d1/daa/random__pivot__quick__sort_8cpp_source.html":[11,0,23,30],
+"d1/db3/structcompare.html":[10,0,26],
+"d1/db6/namespaceknight__tour.html":[9,0,59],
+"d1/dbb/n__choose__r_8cpp.html":[11,0,14,42],
+"d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,14,42,0],
+"d1/dbb/n__choose__r_8cpp.html#a6e2dff75c5de70455b90c799d6ad6967":[11,0,14,42,1],
+"d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,42,2],
+"d1/dbb/n__choose__r_8cpp_source.html":[11,0,14,42],
+"d1/dbe/lu__decomposition_8h.html":[11,0,15,12],
+"d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f":[11,0,15,12,1],
+"d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509":[11,0,15,12,2],
+"d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4":[11,0,15,12,0],
+"d1/dbe/lu__decomposition_8h_source.html":[11,0,15,12],
+"d1/dc2/classstack.html":[10,0,54],
+"d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e":[10,0,54,6],
+"d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5":[10,0,54,2],
+"d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0":[10,0,54,3],
+"d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092":[10,0,54,0],
+"d1/dc2/classstack.html#a8bce109630118a34faae717f72986033":[10,0,54,1],
+"d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d":[10,0,54,4],
+"d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709":[10,0,54,5],
+"d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8":[10,0,54,7],
+"d1/dc7/linear__probing__hash__table_8cpp.html":[11,0,12,2],
+"d1/dc7/linear__probing__hash__table_8cpp.html#a16680b8a37d442c2f208faa286e33908":[11,0,12,2,2],
+"d1/dc7/linear__probing__hash__table_8cpp.html#a16d34fd3511626a83ab00665d7bc34d1":[11,0,12,2,1],
+"d1/dc7/linear__probing__hash__table_8cpp.html#a4bde7a47f98dd1ad24c84038e2608527":[11,0,12,2,4],
+"d1/dc7/linear__probing__hash__table_8cpp.html#a6322209aaa91b7bbf16f96e1cc52b746":[11,0,12,2,5],
+"d1/dc7/linear__probing__hash__table_8cpp.html#a6a082dc1426a79f866cee6b370df37b0":[11,0,12,2,8],
+"d1/dc7/linear__probing__hash__table_8cpp.html#a75854f5aa216e61219154c62167ce8f0":[11,0,12,2,9],
+"d1/dc7/linear__probing__hash__table_8cpp.html#a75d779938df7ebc68581d922b60a2541":[11,0,12,2,7],
+"d1/dc7/linear__probing__hash__table_8cpp.html#a942fc8407b8001890ea26830cdcd9d77":[11,0,12,2,11],
+"d1/dc7/linear__probing__hash__table_8cpp.html#abcf8d033f8115f39f3c93cfb6cee0b28":[11,0,12,2,10],
+"d1/dc7/linear__probing__hash__table_8cpp.html#ad87b71d810901fab69c4ad9d4d0fa635":[11,0,12,2,3],
+"d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,12,2,6],
+"d1/dc7/linear__probing__hash__table_8cpp_source.html":[11,0,12,2],
+"d1/dcc/wiggle__sort_8cpp.html":[8,3,1],
+"d1/de0/namespacenumerical__methods.html":[9,0,86],
+"d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150":[9,0,86,1],
+"d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309":[9,0,86,0],
+"d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93":[9,0,86,2],
+"d1/de9/integral__approximation_8cpp.html":[11,0,14,25],
+"d1/de9/integral__approximation_8cpp.html#a50936ee98f4d40f17823befc65a32aec":[11,0,14,25,2],
+"d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,25,1],
+"d1/de9/integral__approximation_8cpp.html#aec65db4e5c7317323227f026fe50ef11":[11,0,14,25,0],
+"d1/de9/integral__approximation_8cpp_source.html":[11,0,14,25],
+"d1/ded/windowed__median_8cpp.html":[11,0,19,6],
+"d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601":[11,0,19,6,2],
+"d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c":[11,0,19,6,1],
+"d1/ded/windowed__median_8cpp_source.html":[11,0,19,6],
+"d1/def/classdata__structures_1_1linked__list_1_1list.html":[10,0,2,0,1],
+"d1/def/classdata__structures_1_1linked__list_1_1list.html#a009b19ac8cca40f2e4daa2e5989fa4f3":[10,0,2,0,1,4],
+"d1/def/classdata__structures_1_1linked__list_1_1list.html#a1313837c0e9ec67fd9fbd17987e2d615":[10,0,2,0,1,3],
+"d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69":[10,0,2,0,1,14],
+"d1/def/classdata__structures_1_1linked__list_1_1list.html#a326ac4f721f7b74d5ed4f418a67b8d38":[10,0,2,0,1,1],
+"d1/def/classdata__structures_1_1linked__list_1_1list.html#a332b965afd9d6bea8d3246673acd52c7":[10,0,2,0,1,10],
+"d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897":[10,0,2,0,1,6],
+"d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826":[10,0,2,0,1,0],
+"d1/def/classdata__structures_1_1linked__list_1_1list.html#a6e9859d1a0755fb51e41904d20c95496":[10,0,2,0,1,9],
+"d1/def/classdata__structures_1_1linked__list_1_1list.html#a73c52b2243a6c9501af65756123e7149":[10,0,2,0,1,7],
+"d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6":[10,0,2,0,1,13],
+"d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1":[10,0,2,0,1,15],
+"d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1":[10,0,2,0,1,5],
+"d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e":[10,0,2,0,1,11],
+"d1/def/classdata__structures_1_1linked__list_1_1list.html#ac614ed8f1953f5486fab1cd6d7aa0500":[10,0,2,0,1,2],
+"d1/def/classdata__structures_1_1linked__list_1_1list.html#ad3423f7518671351340932db3c24959a":[10,0,2,0,1,12],
+"d1/def/classdata__structures_1_1linked__list_1_1list.html#adb04f732911fcfd30f7177b367c6af41":[10,0,2,0,1,8],
+"d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015":[10,0,2,0,1,16],
+"d1/df3/hash__search_8cpp.html":[11,0,22,4],
+"d1/df3/hash__search_8cpp.html#a36ea13c16028f18ef2d5ff47f3fda7a2":[11,0,22,4,7],
+"d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326":[11,0,22,4,2],
+"d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001":[11,0,22,4,6],
+"d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243":[11,0,22,4,9],
+"d1/df3/hash__search_8cpp.html#a77c722016053a1d484aa177ce205b367":[11,0,22,4,1],
+"d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555":[11,0,22,4,4],
+"d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5":[11,0,22,4,5],
+"d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6":[11,0,22,4,3],
+"d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,4,8],
+"d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d":[11,0,22,4,10],
+"d1/df3/hash__search_8cpp_source.html":[11,0,22,4],
+"d1/df6/class_easter_year_month_day.html":[10,0,31],
+"d1/df6/class_easter_year_month_day.html#a01a068eae0b6fa8f86f5f60c2840bbde":[10,0,31,1],
+"d1/df6/class_easter_year_month_day.html#a28d3cd09391390250932b7fb58fe61dc":[10,0,31,2],
+"d1/df6/class_easter_year_month_day.html#ade0b934e5b1af24e19ff959673b2ec51":[10,0,31,0],
+"d2/d05/class_min_heap.html":[10,0,42],
+"d2/d05/class_min_heap.html#a078cb888e642bb1f95dd0e03f0a35820":[10,0,42,0],
+"d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130":[10,0,42,4],
+"d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e":[10,0,42,10],
+"d2/d05/class_min_heap.html#a37ac126eabb0c3ce04047172abccca29":[10,0,42,2],
+"d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980":[10,0,42,3],
+"d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02":[10,0,42,9],
+"d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5":[10,0,42,1],
+"d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca":[10,0,42,6],
+"d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad":[10,0,42,7],
+"d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e":[10,0,42,8],
+"d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913":[10,0,42,11],
+"d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82":[10,0,42,5],
+"d2/d0b/fast__power_8cpp.html":[11,0,14,15],
+"d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d":[11,0,14,15,0],
+"d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445":[11,0,14,15,1],
+"d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,15,2],
+"d2/d0b/fast__power_8cpp_source.html":[11,0,14,15],
+"d2/d21/gnome__sort_8cpp.html":[11,0,23,13],
+"d2/d21/gnome__sort_8cpp.html#a2f8bc626eb57acae24a94636a23af6a1":[11,0,23,13,1],
+"d2/d21/gnome__sort_8cpp.html#aa3677f87b5b4756bc77e9e34c5f27935":[11,0,23,13,0],
+"d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,23,13,3],
+"d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,13,2],
+"d2/d21/gnome__sort_8cpp_source.html":[11,0,23,13],
+"d2/d22/jump__search_8cpp.html":[11,0,22,7],
+"d2/d22/jump__search_8cpp.html#ab49fd8f401bfc71f63b74711390cccf0":[11,0,22,7,0],
+"d2/d22/jump__search_8cpp_source.html":[11,0,22,7],
+"d2/d26/count__inversions_8cpp.html":[11,0,23,8],
+"d2/d26/count__inversions_8cpp.html#a3332498eabf6579ef059c0d0e9f4ec80":[11,0,23,8,0],
+"d2/d26/count__inversions_8cpp.html#a851ca6a0391d14fb49a97d55e4377497":[11,0,23,8,4],
+"d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,23,8,5],
+"d2/d26/count__inversions_8cpp.html#aad643c14734394e784a75169cb58132f":[11,0,23,8,2],
+"d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,8,1],
+"d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661":[11,0,23,8,3],
+"d2/d26/count__inversions_8cpp_source.html":[11,0,23,8],
+"d2/d2c/structtower.html":[10,0,58],
+"d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9":[10,0,58,1],
+"d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d":[10,0,58,0],
+"d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html":[9,0,42,0],
+"d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8":[9,0,42,0,3],
+"d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71":[9,0,42,0,2],
+"d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af915876d0ca33cc71a6a6191a8cd3ccd":[9,0,42,0,1],
+"d2/d3b/namespaceqr__algorithm.html":[9,0,95],
+"d2/d3b/namespaceqr__algorithm.html#a257425cb2365359da51c6fe6741834d8":[9,0,95,2],
+"d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc":[9,0,95,0],
+"d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc":[9,0,95,6],
+"d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1":[9,0,95,3],
+"d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec":[9,0,95,4],
+"d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f":[9,0,95,5],
+"d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834":[9,0,95,1],
+"d2/d45/segtree_8cpp.html":[11,0,20,5],
+"d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d":[11,0,20,5,2],
+"d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,20,5,3],
+"d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0":[11,0,20,5,4],
+"d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,5,1],
+"d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696":[11,0,20,5,0],
+"d2/d45/segtree_8cpp_source.html":[11,0,20,5],
+"d2/d48/max__flow__with__ford__fulkerson__and__edmond__karp__algo_8cpp_source.html":[11,0,9,16],
+"d2/d52/heap__sort_8cpp.html":[11,0,23,14],
+"d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767":[11,0,23,14,2],
+"d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,23,14,3],
+"d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,14,1],
+"d2/d52/heap__sort_8cpp_source.html":[11,0,23,14],
+"d2/d58/neural__network_8cpp.html":[11,0,13,5],
+"d2/d58/neural__network_8cpp.html#a23aa9d32bcbcd65cfc85f0a41e2afadc":[11,0,13,5,8],
+"d2/d58/neural__network_8cpp.html#a2a5e874b9774aa5362dbcf288828b95c":[11,0,13,5,4],
+"d2/d58/neural__network_8cpp.html#a32c00da08f2cf641dd336270f6e3c407":[11,0,13,5,5],
+"d2/d58/neural__network_8cpp.html#a371aa7dd5d5add0143d1756bb0a1b32f":[11,0,13,5,10],
+"d2/d58/neural__network_8cpp.html#a45d3e30406712ada3d9713ece3c1b153":[11,0,13,5,9],
+"d2/d58/neural__network_8cpp.html#a76eb66212d577f948a457b6e29d87c46":[11,0,13,5,3],
+"d2/d58/neural__network_8cpp.html#aa69e95a34054d7989bf446f96b2ffaf9":[11,0,13,5,2],
+"d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,13,5,11],
+"d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,13,5,6],
+"d2/d58/neural__network_8cpp.html#af8f264600754602b6a9ea19cc690e50e":[11,0,13,5,7],
+"d2/d58/neural__network_8cpp_source.html":[11,0,13,5],
+"d2/d5a/subset__sum_8cpp.html":[11,0,0,10],
+"d2/d5a/subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99":[11,0,0,10,1],
+"d2/d5a/subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,10,2],
+"d2/d5a/subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,10,0],
+"d2/d5a/subset__sum_8cpp_source.html":[11,0,0,10],
+"d2/d64/prims__minimum__spanning__tree_8cpp_source.html":[11,0,11,9],
+"d2/d7d/egg__dropping__puzzle_8cpp_source.html":[11,0,6,9],
+"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html":[10,0,16,0,0],
+"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8":[10,0,16,0,0,3],
+"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725":[10,0,16,0,0,10],
+"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a":[10,0,16,0,0,4],
+"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab":[10,0,16,0,0,6],
+"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a6e486767434e44076c1ac374a22da726":[10,0,16,0,0,0],
+"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a722cc7cf2c3e4d15583601a48b09776f":[10,0,16,0,0,11],
+"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24":[10,0,16,0,0,1],
+"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a84424f180f12b514eaab57a6aa20b104":[10,0,16,0,0,8],
+"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57":[10,0,16,0,0,7],
+"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#aa86a91ae0cd7898990a8170a2f2c9cda":[10,0,16,0,0,9],
+"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828":[10,0,16,0,0,5],
+"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8":[10,0,16,0,0,2],
+"d2/d90/namespacegreedy__algorithms.html":[9,0,42],
+"d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502":[9,0,42,4],
+"d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098":[9,0,42,5],
+"d2/d96/sparse__table__range__queries_8cpp_source.html":[11,0,20,6],
+"d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html":[10,0,13,1,1],
+"d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e":[10,0,13,1,1,1],
+"d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f":[10,0,13,1,1,0],
+"d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143":[10,0,13,1,1,2],
+"d2/da2/matrix__chain__multiplication_8cpp_source.html":[11,0,6,19],
+"d2/da7/namespacefind__non__repeating__integer.html":[9,0,33],
+"d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html":[9,0,42,0,0],
+"d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html":[10,0,7,0,0],
+"d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79":[9,0,42,0,0,1],
+"d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79":[10,0,7,0,0,1],
+"d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc":[9,0,42,0,0,0],
+"d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc":[10,0,7,0,0,0],
+"d2/db0/namespacesieve__of__eratosthenes.html":[9,0,111],
+"d2/dc4/classstack__linked_list.html":[10,0,55],
+"d2/dc8/classdata__structures_1_1_stack.html":[9,0,21,6],
+"d2/dc8/classdata__structures_1_1_stack.html":[10,0,2,13],
+"d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080":[9,0,21,6,2],
+"d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080":[10,0,2,13,2]
 };
diff --git a/navtreeindex10.js b/navtreeindex10.js
index f0f71ed0c..92ab2d7f2 100644
--- a/navtreeindex10.js
+++ b/navtreeindex10.js
@@ -1,253 +1,253 @@
 var NAVTREEINDEX10 =
 {
-"d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153":[10,0,21,13],
-"d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153":[10,0,21,6],
-"d9/dde/structdouble__hashing_1_1_entry.html":[9,0,26,0],
-"d9/dde/structdouble__hashing_1_1_entry.html":[10,0,4,0],
-"d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475":[9,0,26,0,0],
-"d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475":[10,0,4,0,0],
-"d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248":[9,0,26,0,1],
-"d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248":[10,0,4,0,1],
-"d9/dec/unbounded__0__1__knapsack_8cpp.html":[11,0,6,17],
-"d9/dec/unbounded__0__1__knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef":[11,0,6,17,3],
-"d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,6,17,2],
-"d9/dec/unbounded__0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,17,1],
-"d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c":[11,0,6,17,0],
-"d9/dee/classdouble__linked__list.html":[10,0,29],
-"d9/def/namespacesublist__search.html":[9,0,125],
-"d9/df0/fast__integer__input_8cpp.html":[11,0,17,4],
-"d9/df0/fast__integer__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82":[11,0,17,4,0],
-"d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,4,1],
-"d9/df4/namespacetests.html":[9,0,129],
-"d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5":[9,0,129,0],
-"d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d":[9,0,129,3],
-"d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76":[9,0,129,2],
-"d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2":[9,0,129,5],
-"d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669":[9,0,129,1],
-"d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86":[9,0,129,4],
-"d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html":[10,0,13,4,1],
-"d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade":[10,0,13,4,1,0],
-"d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3":[10,0,13,4,1,1],
-"d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83":[10,0,13,4,1,2],
-"d9/dfd/comb__sort_8cpp.html":[11,0,22,3],
-"d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f":[11,0,22,3,0],
-"d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,22,3,3],
-"d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,3,2],
-"d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5":[11,0,22,3,1],
-"da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html":[10,0,10,0,0],
-"da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4":[10,0,10,0,0,5],
-"da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a48284e156fdd48fd0c41008c7e48f201":[10,0,10,0,0,4],
-"da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e":[10,0,10,0,0,3],
-"da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#acd897e6e519849edb9fb0d1e1bfa881a":[10,0,10,0,0,2],
-"da/d0d/longest__common__string_8cpp.html":[11,0,6,8],
-"da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe":[11,0,6,8,6],
-"da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,6,8,8],
-"da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c":[11,0,6,8,1],
-"da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561":[11,0,6,8,5],
-"da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5":[11,0,6,8,2],
-"da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541":[11,0,6,8,4],
-"da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155":[11,0,6,8,7],
-"da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,8,3],
-"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html":[10,0,12,0,1],
-"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5":[10,0,12,0,1,0],
-"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95":[10,0,12,0,1,1],
-"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1":[10,0,12,0,1,2],
-"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77":[10,0,12,0,1,3],
-"da/d18/quadratic__equations__complex__numbers_8cpp.html":[11,0,14,49],
-"da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,49,3],
-"da/d18/quadratic__equations__complex__numbers_8cpp.html#aacb1411ef2029e81f249c21e17c96fdb":[11,0,14,49,2],
-"da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,49,1],
-"da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a":[11,0,14,49,0],
-"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html":[10,0,14,0,0],
-"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a":[10,0,14,0,0,1],
-"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2":[10,0,14,0,0,7],
-"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413":[10,0,14,0,0,3],
-"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69":[10,0,14,0,0,6],
-"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3":[10,0,14,0,0,2],
-"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797":[10,0,14,0,0,0],
-"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf":[10,0,14,0,0,4],
-"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3":[10,0,14,0,0,9],
-"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960":[10,0,14,0,0,8],
-"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1":[10,0,14,0,0,5],
-"da/d21/class_longest___substring.html":[10,0,41],
-"da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d":[10,0,41,0],
-"da/d23/eulers__totient__function_8cpp.html":[11,0,14,11],
-"da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,14,11,0],
-"da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,11,2],
-"da/d23/eulers__totient__function_8cpp.html#ac37d3ba52eb296597d7a024ba8c4a5a5":[11,0,14,11,1],
-"da/d24/sqrt__double_8cpp.html":[11,0,14,52],
-"da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc":[11,0,14,52,1],
-"da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,52,0],
-"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html":[10,0,2,3,0],
-"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a0c8cbe7239232863f104793c08273039":[10,0,2,3,0,0],
-"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a6cf72f93b1551f0d943c585b4f173be3":[10,0,2,3,0,2],
-"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e":[10,0,2,3,0,1],
-"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81":[10,0,2,3,0,4],
-"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad71ecd43d0af1127df5f4006258f9635":[10,0,2,3,0,3],
-"da/d39/volume_8cpp.html":[11,0,14,57],
-"da/d39/volume_8cpp.html#a2d704a7b72a6b2db8b76c8581b577b2c":[11,0,14,57,8],
-"da/d39/volume_8cpp.html#a34d66a77c19ce9b8b3a3d14352b34551":[11,0,14,57,6],
-"da/d39/volume_8cpp.html#a3fdc74c24697ec5bb5c3698c96117c12":[11,0,14,57,5],
-"da/d39/volume_8cpp.html#a3fe35440c27758ecc2287e08217d63a7":[11,0,14,57,0],
-"da/d39/volume_8cpp.html#a94db02b3c9e55a69ac1696f30e2f761c":[11,0,14,57,4],
-"da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,57,7],
-"da/d39/volume_8cpp.html#abde24398be43538c62e4a496968e60ca":[11,0,14,57,2],
-"da/d39/volume_8cpp.html#ae413098478fa38acaac887b7654f0725":[11,0,14,57,1],
-"da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,57,3],
-"da/d41/uint128__t_8hpp.html":[11,0,2,6],
-"da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3":[11,0,2,6,5],
-"da/d41/uint128__t_8hpp.html#acce684d03a24f9c13a9ed36de6d24a57":[11,0,2,6,4],
-"da/d41/uint128__t_8hpp_source.html":[11,0,2,6],
-"da/d42/namespacestd_1_1rel__ops.html":[9,0,118,3],
-"da/d49/classgreedy__algorithms_1_1_digit_separation.html":[9,0,42,3],
-"da/d49/classgreedy__algorithms_1_1_digit_separation.html":[10,0,7,2],
-"da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8":[9,0,42,3,1],
-"da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8":[10,0,7,2,1],
-"da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79":[9,0,42,3,2],
-"da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79":[10,0,7,2,2],
-"da/d49/classgreedy__algorithms_1_1_digit_separation.html#afd54c969a6c9bab16b4a064fbc8ed40e":[9,0,42,3,0],
-"da/d49/classgreedy__algorithms_1_1_digit_separation.html#afd54c969a6c9bab16b4a064fbc8ed40e":[10,0,7,2,0],
-"da/d4b/depth__first__search__with__stack_8cpp.html":[11,0,9,5],
-"da/d4b/depth__first__search__with__stack_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c":[11,0,9,5,6],
-"da/d4b/depth__first__search__with__stack_8cpp.html#a43e30173f12330e85cce6239a277527e":[11,0,9,5,5],
-"da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,9,5,3],
-"da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9":[11,0,9,5,1],
-"da/d4b/depth__first__search__with__stack_8cpp.html#a7f1cd94cf4da32933e8551cb3577e18b":[11,0,9,5,4],
-"da/d4b/depth__first__search__with__stack_8cpp.html#aadebe9c855821d6515ca5b171222ef7b":[11,0,9,5,0],
-"da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,5,2],
-"da/d4b/depth__first__search__with__stack_8cpp.html#afb80b42b42381658a12a57a975ecd0c7":[11,0,9,5,7],
-"da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html":[11,0,1,2],
-"da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#a0d5e1d651d0d30bd682f176d8f2b83d0":[11,0,1,2,1],
-"da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,2,2],
-"da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,2,0],
-"da/d52/minimum__edit__distance_8cpp.html":[11,0,6,12],
-"da/d52/minimum__edit__distance_8cpp.html#a0138c226bd79ffe6d839c787cfc60347":[11,0,6,12,2],
-"da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,6,12,1],
-"da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,12,3],
-"da/d52/minimum__edit__distance_8cpp.html#ade2fcfe0359f3c7691bfaa04b14943e2":[11,0,6,12,0],
-"da/d5a/class_complex.html":[10,0,27],
-"da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6":[10,0,27,11],
-"da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da":[10,0,27,7],
-"da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867":[10,0,27,0],
-"da/d5a/class_complex.html#a466cd7b664cc6a864937ceb3dead1323":[10,0,27,1],
-"da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac":[10,0,27,9],
-"da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c":[10,0,27,6],
-"da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d":[10,0,27,10],
-"da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d":[10,0,27,5],
-"da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90":[10,0,27,8],
-"da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41":[10,0,27,3],
-"da/d5a/class_complex.html#ae5b51b749ea4964104b9527af9d8f556":[10,0,27,2],
-"da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974":[10,0,27,4],
-"da/d61/structsearch_1_1sublist__search_1_1_node.html":[10,0,17,0,0],
-"da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b":[10,0,17,0,0,0],
-"da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a":[10,0,17,0,0,1],
-"da/d6d/namespaceoperations__on__datastructures.html":[9,0,87],
-"da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86":[9,0,87,4],
-"da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74":[9,0,87,1],
-"da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20":[9,0,87,2],
-"da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e":[9,0,87,0],
-"da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8":[9,0,87,3],
-"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html":[10,0,10,0,0,1],
-"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d":[10,0,10,0,0,1,8],
-"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3":[10,0,10,0,0,1,9],
-"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a572de12115e39e34dde6e68b707d59f5":[10,0,10,0,0,1,3],
-"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a695e4314ebc3ab58e13004dc63599fe8":[10,0,10,0,0,1,1],
-"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a6abc89925ae7055a63b428e61525ad7a":[10,0,10,0,0,1,4],
-"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aa816af5a64b37c86be8acda89fdefba2":[10,0,10,0,0,1,5],
-"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7":[10,0,10,0,0,1,0],
-"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317":[10,0,10,0,0,1,6],
-"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3950824936488f66408313b1f8a8ca8":[10,0,10,0,0,1,2],
-"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3993dbca9c5b3ef9ac361dc7f62ce57":[10,0,10,0,0,1,7],
-"da/d77/spirograph_8cpp.html":[11,0,10,0],
-"da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,10,0,1],
-"da/d77/spirograph_8cpp.html#a525335710b53cb064ca56b936120431e":[11,0,10,0,0],
-"da/d77/spirograph_8cpp.html#a8e83a64e8443fff1e5ffdc1c299c1e99":[11,0,10,0,3],
-"da/d77/spirograph_8cpp.html#aeca22dbe4563358960e907a40cd3e1ac":[11,0,10,0,2],
-"da/d7b/primality__test_8cpp.html":[11,0,17,18],
-"da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf":[11,0,17,18,0],
-"da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,18,1],
-"da/d82/namespacecycle__detection.html":[9,0,19],
-"da/d86/struct_test_case.html":[10,0,56],
-"da/d8d/depth__first__search_8cpp.html":[11,0,9,4],
-"da/d8d/depth__first__search_8cpp.html#a64c1db5aad7502c6f08e4652f6edd463":[11,0,9,4,2],
-"da/d8d/depth__first__search_8cpp.html#ab5428a3519267a28bba4b4310cfbb6ae":[11,0,9,4,1],
-"da/d8d/depth__first__search_8cpp.html#ad4016cfc80485a43748895a2c26c7d08":[11,0,9,4,0],
-"da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,4,3],
-"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html":[10,0,10,1,0],
-"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a080f5b1742832a03c1cbba596a48bd1a":[10,0,10,1,0,4],
-"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a16ddc13621eec6ac5f83658b3401a581":[10,0,10,1,0,7],
-"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200":[10,0,10,1,0,0],
-"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a209383503fb6c03afac405a80bace964":[10,0,10,1,0,8],
-"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e":[10,0,10,1,0,2],
-"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a62e152db014cd4de675fa906e5ef2861":[10,0,10,1,0,6],
-"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b":[10,0,10,1,0,1],
-"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#ac06986d5afddc767ddba4da738f75563":[10,0,10,1,0,5],
-"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#afe732a33112b457b738f403622d226e5":[10,0,10,1,0,3],
-"da/d9a/class_graph.html":[10,0,34],
-"da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d":[10,0,34,6],
-"da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3":[10,0,34,1],
-"da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1":[10,0,34,7],
-"da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1":[10,0,34,2],
-"da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413":[10,0,34,5],
-"da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910":[10,0,34,4],
-"da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d":[10,0,34,0],
-"da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5":[10,0,34,3],
-"da/d9a/palindrome__of__number_8cpp.html":[11,0,17,14],
-"da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,14,0],
-"da/d9c/namespacegames.html":[9,0,34],
-"da/da3/uint256__t_8hpp.html":[11,0,2,7],
-"da/da3/uint256__t_8hpp.html#a1d8c5ec5b5e419c5c8a740251485102c":[11,0,2,7,4],
-"da/da3/uint256__t_8hpp_source.html":[11,0,2,7],
-"da/dac/n__queens__all__solution__optimised_8cpp.html":[11,0,0,5],
-"da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905":[11,0,0,5,3],
-"da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f":[11,0,0,5,2],
-"da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9":[11,0,0,5,0],
-"da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,5,1],
-"da/db8/count__of__set__bits_8cpp.html":[11,0,1,1],
-"da/db8/count__of__set__bits_8cpp.html#a86c98dc299e4db28b73e08309d977e62":[11,0,1,1,0],
-"da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,1,1],
-"da/dc3/linked__list_8cpp.html":[11,0,4,9],
-"da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180":[11,0,4,9,2],
-"da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,9,3],
-"da/dc9/fibonacci__matrix__exponentiation_8cpp.html":[11,0,14,18],
-"da/dc9/fibonacci__matrix__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,18,2],
-"da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f":[11,0,14,18,0],
-"da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,18,1],
-"da/dd1/structquadratic__probing_1_1_entry.html":[9,0,96,0],
-"da/dd1/structquadratic__probing_1_1_entry.html":[10,0,15,0],
-"da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8":[9,0,96,0,1],
-"da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8":[10,0,15,0,1],
-"da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e":[9,0,96,0,0],
-"da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e":[10,0,15,0,0],
-"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html":[11,0,5,0],
-"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#a7a890d2f26855ada3b9f1d43aec70a86":[11,0,5,0,1],
-"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,5,0,4],
-"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aad9e3edfe156b59fc06a5585403fe0d6":[11,0,5,0,3],
-"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ad76f5cac3ef8dc034f6abb99b64c2b20":[11,0,5,0,0],
-"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,5,0,2],
-"da/dd3/namespacespirograph.html":[9,0,115],
-"da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99":[9,0,115,1],
-"da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac":[9,0,115,0],
-"da/dd4/namespacemedian__search.html":[9,0,71],
-"da/dda/namespaceradix__sort.html":[9,0,99],
-"da/de7/decimal__to__hexadecimal_8cpp.html":[11,0,17,2],
-"da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe":[11,0,17,2,0],
-"da/de8/dijkstra__greedy_8cpp.html":[11,0,11,3],
-"da/de8/dijkstra__greedy_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,11,3,5],
-"da/de8/dijkstra__greedy_8cpp.html#a7341d7c76a6145e991cdd231f689fca8":[11,0,11,3,4],
-"da/de8/dijkstra__greedy_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,3,2],
-"da/de8/dijkstra__greedy_8cpp.html#af6cb29ca6dc5771439f6ea7262058a71":[11,0,11,3,3],
-"da/de8/dijkstra__greedy_8cpp.html#af915876d0ca33cc71a6a6191a8cd3ccd":[11,0,11,3,1],
-"da/df2/durand__kerner__roots_8cpp.html":[11,0,15,4],
-"da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377":[11,0,15,4,1],
-"da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,15,4,6],
-"da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,15,4,5],
-"da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd":[11,0,15,4,3],
-"da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c":[11,0,15,4,2],
-"da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569":[11,0,15,4,4],
-"da/df2/durand__kerner__roots_8cpp.html#af270a96662132d0385cb6b4637c5a689":[11,0,15,4,0],
-"db/d01/brent__method__extrema_8cpp.html":[11,0,15,2],
-"db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70":[11,0,15,2,1],
-"db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,15,2,5],
-"db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,15,2,4]
+"db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d":[11,0,17,25,2],
+"db/d3c/tower__of__hanoi_8cpp_source.html":[11,0,17,25],
+"db/d3f/wave__sort_8cpp.html":[11,0,23,41],
+"db/d3f/wave__sort_8cpp.html#a7d4f243b9dc13ace4ef77e30dbc56f12":[11,0,23,41,2],
+"db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,23,41,1],
+"db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,41,0],
+"db/d3f/wave__sort_8cpp_source.html":[11,0,23,41],
+"db/d40/integral__approximation2_8cpp.html":[11,0,14,26],
+"db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf":[11,0,14,26,0],
+"db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,26,3],
+"db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,26,2],
+"db/d40/integral__approximation2_8cpp.html#af7da9ba8932f1f48b9bbc2d80471af51":[11,0,14,26,1],
+"db/d40/integral__approximation2_8cpp_source.html":[11,0,14,26],
+"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html":[10,0,2,4,0],
+"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323":[10,0,2,4,0,4],
+"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7":[10,0,2,4,0,3],
+"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb":[10,0,2,4,0,0],
+"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39":[10,0,2,4,0,2],
+"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6":[10,0,2,4,0,6],
+"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2":[10,0,2,4,0,1],
+"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b":[10,0,2,4,0,5],
+"db/d66/struct_item.html":[10,0,36],
+"db/d6b/kelvin__to__celsius_8cpp.html":[11,0,17,9],
+"db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,17,9,3],
+"db/d6b/kelvin__to__celsius_8cpp.html#a48677fae5d683070432b1a905722d9ec":[11,0,17,9,1],
+"db/d6b/kelvin__to__celsius_8cpp.html#aa17dc6d061dff34f6b9a610bc5e26703":[11,0,17,9,0],
+"db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,9,2],
+"db/d6b/kelvin__to__celsius_8cpp_source.html":[11,0,17,9],
+"db/d6f/namespaceheavy__light__decomposition.html":[9,0,46],
+"db/d71/quadratic__probing__hash__table_8cpp.html":[11,0,12,4],
+"db/d71/quadratic__probing__hash__table_8cpp.html#a00ebcc6d39653eccc26f8432efbfc8d9":[11,0,12,4,1],
+"db/d71/quadratic__probing__hash__table_8cpp.html#a07a0467b24102260fbb6b554c453c20a":[11,0,12,4,11],
+"db/d71/quadratic__probing__hash__table_8cpp.html#a2093d91dd3d377cf0a5c939e45dcefc7":[11,0,12,4,5],
+"db/d71/quadratic__probing__hash__table_8cpp.html#a312143ed316d48978084c025ff8d9768":[11,0,12,4,2],
+"db/d71/quadratic__probing__hash__table_8cpp.html#a40d617ebf4d6ba21bcda8d8d1faa2357":[11,0,12,4,3],
+"db/d71/quadratic__probing__hash__table_8cpp.html#a5ceee4128d92ca4412040b7104d1299d":[11,0,12,4,4],
+"db/d71/quadratic__probing__hash__table_8cpp.html#a69fe1f7c36fe004ba83eef2ca82e7e30":[11,0,12,4,10],
+"db/d71/quadratic__probing__hash__table_8cpp.html#ab431981b54c0bae1b2956f716aee1dcf":[11,0,12,4,8],
+"db/d71/quadratic__probing__hash__table_8cpp.html#ada6f1f44f7e83b0094fbcbe170788486":[11,0,12,4,9],
+"db/d71/quadratic__probing__hash__table_8cpp.html#adccc63a7e57cc6dba75bd62f40feb88b":[11,0,12,4,7],
+"db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,12,4,6],
+"db/d71/quadratic__probing__hash__table_8cpp.html#aeb6bca8db4768226f8ea8291ea4f83f6":[11,0,12,4,12],
+"db/d71/quadratic__probing__hash__table_8cpp_source.html":[11,0,12,4],
+"db/d80/gale__shapley_8cpp.html":[11,0,11,4],
+"db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,11,4,2],
+"db/d80/gale__shapley_8cpp.html#a6d7e84df47dcf19e88f95f8f9040306c":[11,0,11,4,0],
+"db/d80/gale__shapley_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,4,1],
+"db/d80/gale__shapley_8cpp_source.html":[11,0,11,4],
+"db/d82/classlarge__number.html":[10,0,37],
+"db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872":[10,0,37,2],
+"db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337":[10,0,37,0],
+"db/d82/classlarge__number.html#a13282908dfc4888392ed3d1fc6aae492":[10,0,37,17],
+"db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc":[10,0,37,6],
+"db/d82/classlarge__number.html#a4757697b1f7584b69e779a72abc4ae2a":[10,0,37,9],
+"db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615":[10,0,37,4],
+"db/d82/classlarge__number.html#a72ae1ef050c4c28c50952ecab22d4b94":[10,0,37,15],
+"db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f":[10,0,37,3],
+"db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350":[10,0,37,8],
+"db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca":[10,0,37,18],
+"db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08":[10,0,37,13],
+"db/d82/classlarge__number.html#a8d4364ee5a62964451d8cfee82649687":[10,0,37,10],
+"db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9":[10,0,37,14],
+"db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf":[10,0,37,11],
+"db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b":[10,0,37,12],
+"db/d82/classlarge__number.html#abbd52948bee1b16543f1dae19aa9dd46":[10,0,37,16],
+"db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93":[10,0,37,7],
+"db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac":[10,0,37,5],
+"db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57":[10,0,37,19],
+"db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a":[10,0,37,1],
+"db/d8b/struct_node.html":[10,0,45],
+"db/d93/check__prime_8cpp.html":[11,0,14,8],
+"db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,8,2],
+"db/d93/check__prime_8cpp.html#abd8f794b2229b42876169ff841b6e444":[11,0,14,8,0],
+"db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,8,1],
+"db/d93/check__prime_8cpp_source.html":[11,0,14,8],
+"db/d9a/classuint128__t.html":[10,0,60],
+"db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40":[10,0,60,18],
+"db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3":[10,0,60,37],
+"db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798":[10,0,60,42],
+"db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a":[10,0,60,22],
+"db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9":[10,0,60,65],
+"db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac":[10,0,60,1],
+"db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606":[10,0,60,32],
+"db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190":[10,0,60,50],
+"db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a":[10,0,60,53],
+"db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed":[10,0,60,40],
+"db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705":[10,0,60,77],
+"db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640":[10,0,60,24],
+"db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2":[10,0,60,19],
+"db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440":[10,0,60,61],
+"db/d9a/classuint128__t.html#a2ecb71686e1c9ed0267124580c91c414":[10,0,60,41],
+"db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd":[10,0,60,71],
+"db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db":[10,0,60,47],
+"db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092":[10,0,60,29],
+"db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee":[10,0,60,45],
+"db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03":[10,0,60,75],
+"db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481":[10,0,60,62],
+"db/d9a/classuint128__t.html#a3c4a7e775a0820196fc08303bbeed44a":[10,0,60,57],
+"db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304":[10,0,60,70],
+"db/d9a/classuint128__t.html#a4147188abcdcdb12c61bfbe4e4c0a363":[10,0,60,5],
+"db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f":[10,0,60,76],
+"db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860":[10,0,60,28],
+"db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67":[10,0,60,68],
+"db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c":[10,0,60,52],
+"db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30":[10,0,60,27],
+"db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d":[10,0,60,31],
+"db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004":[10,0,60,35],
+"db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc":[10,0,60,48],
+"db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953":[10,0,60,78],
+"db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b":[10,0,60,3],
+"db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee":[10,0,60,72],
+"db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec":[10,0,60,38],
+"db/d9a/classuint128__t.html#a6d45302022ef7f5195458f41b8aedb6e":[10,0,60,11],
+"db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848":[10,0,60,64],
+"db/d9a/classuint128__t.html#a75767cb2b6fd47ecb1f721755fdc7639":[10,0,60,12],
+"db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696":[10,0,60,14],
+"db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896":[10,0,60,58],
+"db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e":[10,0,60,59],
+"db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e":[10,0,60,8],
+"db/d9a/classuint128__t.html#a7d56143b2e291e8087188192533d2e3c":[10,0,60,4],
+"db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503":[10,0,60,74],
+"db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c":[10,0,60,39],
+"db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e":[10,0,60,60],
+"db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df":[10,0,60,6],
+"db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c":[10,0,60,9],
+"db/d9a/classuint128__t.html#a9487ed06019d846add5dc8874e41eb8b":[10,0,60,67],
+"db/d9a/classuint128__t.html#a95ac8be8f414fcbce09301b912f5079d":[10,0,60,2],
+"db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295":[10,0,60,30],
+"db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb":[10,0,60,36],
+"db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4":[10,0,60,20],
+"db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a":[10,0,60,51],
+"db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd":[10,0,60,10],
+"db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b":[10,0,60,46],
+"db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37":[10,0,60,66],
+"db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1":[10,0,60,23],
+"db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e":[10,0,60,15],
+"db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5":[10,0,60,56],
+"db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d":[10,0,60,73],
+"db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74":[10,0,60,54],
+"db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8":[10,0,60,43],
+"db/d9a/classuint128__t.html#abfc6a8765039cacc829a5cd386b5a066":[10,0,60,17],
+"db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050":[10,0,60,25],
+"db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e":[10,0,60,33],
+"db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544":[10,0,60,55],
+"db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4":[10,0,60,49],
+"db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244":[10,0,60,21],
+"db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d":[10,0,60,13],
+"db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040":[10,0,60,0],
+"db/d9a/classuint128__t.html#add9938b97fc66560cec2d32e8c83eaad":[10,0,60,16],
+"db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a":[10,0,60,69],
+"db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292":[10,0,60,63],
+"db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94":[10,0,60,44],
+"db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2":[10,0,60,7],
+"db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733":[10,0,60,26],
+"db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6":[10,0,60,34],
+"db/d9f/iterative__factorial_8cpp.html":[11,0,14,28],
+"db/d9f/iterative__factorial_8cpp.html#a2565c745aac2f9561cc6fd9e56d9b77a":[11,0,14,28,0],
+"db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,28,2],
+"db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,28,1],
+"db/d9f/iterative__factorial_8cpp_source.html":[11,0,14,28],
+"db/da9/classqueue.html":[10,0,50],
+"db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368":[10,0,50,2],
+"db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d":[10,0,50,7],
+"db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec":[10,0,50,6],
+"db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375":[10,0,50,0],
+"db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7":[10,0,50,5],
+"db/da9/classqueue.html#a7611df63ebefae613d311039d7305143":[10,0,50,9],
+"db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604":[10,0,50,4],
+"db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d":[10,0,50,3],
+"db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85":[10,0,50,1],
+"db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094":[10,0,50,8],
+"db/db2/counting__sort__string_8cpp_source.html":[11,0,23,10],
+"db/db5/slow__sort_8cpp_source.html":[11,0,23,36],
+"db/dbc/tree__234_8cpp.html":[11,0,4,36],
+"db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,4,36,2],
+"db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243":[11,0,4,36,3],
+"db/dbc/tree__234_8cpp.html#af1ac73779b0fcfbbdce3976c0ca57342":[11,0,4,36,4],
+"db/dbc/tree__234_8cpp_source.html":[11,0,4,36],
+"db/dbd/test__stack__students_8cpp_source.html":[11,0,4,33],
+"db/dc0/namespacebacktracking.html":[9,0,5],
+"db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50":[9,0,5,1],
+"db/dc4/floyd__cycle__detection__algo_8cpp.html":[11,0,22,3],
+"db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88":[11,0,22,3,0],
+"db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,3,2],
+"db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,3,1],
+"db/dc4/floyd__cycle__detection__algo_8cpp_source.html":[11,0,22,3],
+"db/dd3/ode__forward__euler_8cpp.html":[11,0,15,15],
+"db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,15,15,3],
+"db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f":[11,0,15,15,5],
+"db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe":[11,0,15,15,4],
+"db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b":[11,0,15,15,0],
+"db/dd3/ode__forward__euler_8cpp_source.html":[11,0,15,15],
+"db/ddc/namespaceaystar__search.html":[9,0,4],
+"db/dde/namespaceothers_1_1_cache.html":[9,0,88,0],
+"db/de3/numeric__string__sort_8cpp_source.html":[11,0,23,21],
+"db/df3/happy__number_8cpp.html":[11,0,17,6],
+"db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7":[11,0,17,6,0],
+"db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,6,1],
+"db/df3/happy__number_8cpp_source.html":[11,0,17,6],
+"db/dfb/maximum__circular__subarray_8cpp.html":[11,0,6,20],
+"db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,6,20,0],
+"db/dfb/maximum__circular__subarray_8cpp.html#a5239174fa0d987f2c67edc1f2af82beb":[11,0,6,20,1],
+"db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,20,2],
+"db/dfb/maximum__circular__subarray_8cpp_source.html":[11,0,6,20],
+"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html":[10,0,3,0,0],
+"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256":[10,0,3,0,0,0],
+"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17":[10,0,3,0,0,14],
+"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a42c986fb57b74fe1b7c5953cb1922c3d":[10,0,3,0,0,10],
+"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a4aa49765cce39ce48b9241e993e0cfb9":[10,0,3,0,0,1],
+"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c":[10,0,3,0,0,11],
+"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50":[10,0,3,0,0,3],
+"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c":[10,0,3,0,0,4],
+"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a678681c9f6266a8219bd6bee6972d70e":[10,0,3,0,0,9],
+"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a":[10,0,3,0,0,15],
+"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ab6534125643a02c114bd4cddba9bc17f":[10,0,3,0,0,2],
+"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ac4c64e5723fa12a043fd0a7f5ed5bb37":[10,0,3,0,0,12],
+"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211":[10,0,3,0,0,7],
+"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae190115f8d4d31e47d7290e0b6871391":[10,0,3,0,0,8],
+"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1":[10,0,3,0,0,13],
+"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e":[10,0,3,0,0,5],
+"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12":[10,0,3,0,0,6],
+"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af12ceffdc07cc87eca8a4a8ac87d60fe":[10,0,3,0,0,16],
+"dc/d14/wildcard__matching_8cpp.html":[11,0,0,12],
+"dc/d14/wildcard__matching_8cpp.html#a1f8c260cf0d7e22c666b85f1f71ee4a7":[11,0,0,12,0],
+"dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,12,2],
+"dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,12,1],
+"dc/d14/wildcard__matching_8cpp_source.html":[11,0,0,12],
+"dc/d1a/pascal__triangle_8cpp.html":[11,0,17,17],
+"dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd":[11,0,17,17,1],
+"dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c":[11,0,17,17,2],
+"dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,17,0],
+"dc/d1a/pascal__triangle_8cpp_source.html":[11,0,17,17],
+"dc/d1f/classcatalan__numbers.html":[10,0,23],
+"dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8":[10,0,23,0],
+"dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html":[9,0,17],
+"dc/d38/ordinary__least__squares__regressor_8cpp.html":[11,0,13,6],
+"dc/d38/ordinary__least__squares__regressor_8cpp.html#a01e6c7bf2b09272578b9c5819ce0f36f":[11,0,13,6,10],
+"dc/d38/ordinary__least__squares__regressor_8cpp.html#a207b3a99fd5974d3117e0b0ac0aad234":[11,0,13,6,6],
+"dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb":[11,0,13,6,2],
+"dc/d38/ordinary__least__squares__regressor_8cpp.html#a42535e20e97d85aa61271e0894cc0359":[11,0,13,6,9],
+"dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d":[11,0,13,6,5],
+"dc/d38/ordinary__least__squares__regressor_8cpp.html#a4a6a560dbdd0177633783b72db37dc19":[11,0,13,6,11],
+"dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4":[11,0,13,6,13],
+"dc/d38/ordinary__least__squares__regressor_8cpp.html#a7a2d742b9a3ae7b85292e1f86428bb4f":[11,0,13,6,12],
+"dc/d38/ordinary__least__squares__regressor_8cpp.html#a865e8d26a01962cc93aca66e71346f37":[11,0,13,6,8],
+"dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e":[11,0,13,6,3],
+"dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b":[11,0,13,6,0],
+"dc/d38/ordinary__least__squares__regressor_8cpp.html#ab1ad727903d7817c2758d25bcb52cbc8":[11,0,13,6,14],
+"dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493":[11,0,13,6,15],
+"dc/d38/ordinary__least__squares__regressor_8cpp.html#ae2edd40354a1ca7aeaee3d1e3589e713":[11,0,13,6,7]
 };
diff --git a/navtreeindex11.js b/navtreeindex11.js
index ba4c5a454..2fded7b66 100644
--- a/navtreeindex11.js
+++ b/navtreeindex11.js
@@ -1,253 +1,253 @@
 var NAVTREEINDEX11 =
 {
-"db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b":[11,0,15,2,2],
-"db/d01/brent__method__extrema_8cpp.html#a525335710b53cb064ca56b936120431e":[11,0,15,2,0],
-"db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e":[11,0,15,2,6],
-"db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,2,3],
-"db/d03/_s_t-example.html":[12,0],
-"db/d03/namespacewildcard__matching.html":[9,0,141],
-"db/d07/spiral__print_8cpp.html":[11,0,17,22],
-"db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197":[11,0,17,22,2],
-"db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5":[11,0,17,22,0],
-"db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,22,1],
-"db/d09/duval_8cpp.html":[11,0,23,2],
-"db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,23,2,2],
-"db/d09/duval_8cpp.html#ac2a35302e6bed93c4b2c6f55a21a5632":[11,0,23,2,0],
-"db/d09/duval_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,2,1],
-"db/d0d/prime__factorization_8cpp.html":[11,0,14,46],
-"db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46":[11,0,14,46,1],
-"db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23":[11,0,14,46,4],
-"db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b":[11,0,14,46,3],
-"db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,46,0],
-"db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe":[11,0,14,46,5],
-"db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099":[11,0,14,46,2],
-"db/d16/0__1__knapsack_8cpp.html":[11,0,6,0],
-"db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1":[11,0,6,0,1],
-"db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,0,2],
-"db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,0,0],
-"db/d19/structlinear__probing_1_1_entry.html":[9,0,61,0],
-"db/d19/structlinear__probing_1_1_entry.html":[10,0,9,0],
-"db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77":[9,0,61,0,0],
-"db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77":[10,0,9,0,0],
-"db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a":[9,0,61,0,1],
-"db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a":[10,0,9,0,1],
-"db/d27/n__bonacci_8cpp.html":[11,0,14,39],
-"db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d":[11,0,14,39,1],
-"db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,39,2],
-"db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,39,0],
-"db/d3c/tower__of__hanoi_8cpp.html":[11,0,17,24],
-"db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed":[11,0,17,24,3],
-"db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417":[11,0,17,24,4],
-"db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,24,1],
-"db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d":[11,0,17,24,2],
-"db/d3f/wave__sort_8cpp.html":[11,0,22,26],
-"db/d3f/wave__sort_8cpp.html#a7d4f243b9dc13ace4ef77e30dbc56f12":[11,0,22,26,2],
-"db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,26,1],
-"db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,26,0],
-"db/d40/integral__approximation2_8cpp.html":[11,0,14,25],
-"db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf":[11,0,14,25,0],
-"db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,25,3],
-"db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,25,2],
-"db/d40/integral__approximation2_8cpp.html#af7da9ba8932f1f48b9bbc2d80471af51":[11,0,14,25,1],
-"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html":[10,0,2,4,0],
-"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323":[10,0,2,4,0,4],
-"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7":[10,0,2,4,0,3],
-"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb":[10,0,2,4,0,0],
-"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39":[10,0,2,4,0,2],
-"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6":[10,0,2,4,0,6],
-"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2":[10,0,2,4,0,1],
-"db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b":[10,0,2,4,0,5],
-"db/d66/struct_item.html":[10,0,36],
-"db/d6b/kelvin__to__celsius_8cpp.html":[11,0,17,8],
-"db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,17,8,3],
-"db/d6b/kelvin__to__celsius_8cpp.html#a48677fae5d683070432b1a905722d9ec":[11,0,17,8,1],
-"db/d6b/kelvin__to__celsius_8cpp.html#aa17dc6d061dff34f6b9a610bc5e26703":[11,0,17,8,0],
-"db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,8,2],
-"db/d6f/namespaceheavy__light__decomposition.html":[9,0,46],
-"db/d71/quadratic__probing__hash__table_8cpp.html":[11,0,12,4],
-"db/d71/quadratic__probing__hash__table_8cpp.html#a00ebcc6d39653eccc26f8432efbfc8d9":[11,0,12,4,1],
-"db/d71/quadratic__probing__hash__table_8cpp.html#a07a0467b24102260fbb6b554c453c20a":[11,0,12,4,11],
-"db/d71/quadratic__probing__hash__table_8cpp.html#a2093d91dd3d377cf0a5c939e45dcefc7":[11,0,12,4,5],
-"db/d71/quadratic__probing__hash__table_8cpp.html#a312143ed316d48978084c025ff8d9768":[11,0,12,4,2],
-"db/d71/quadratic__probing__hash__table_8cpp.html#a40d617ebf4d6ba21bcda8d8d1faa2357":[11,0,12,4,3],
-"db/d71/quadratic__probing__hash__table_8cpp.html#a5ceee4128d92ca4412040b7104d1299d":[11,0,12,4,4],
-"db/d71/quadratic__probing__hash__table_8cpp.html#a69fe1f7c36fe004ba83eef2ca82e7e30":[11,0,12,4,10],
-"db/d71/quadratic__probing__hash__table_8cpp.html#ab431981b54c0bae1b2956f716aee1dcf":[11,0,12,4,8],
-"db/d71/quadratic__probing__hash__table_8cpp.html#ada6f1f44f7e83b0094fbcbe170788486":[11,0,12,4,9],
-"db/d71/quadratic__probing__hash__table_8cpp.html#adccc63a7e57cc6dba75bd62f40feb88b":[11,0,12,4,7],
-"db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,12,4,6],
-"db/d71/quadratic__probing__hash__table_8cpp.html#aeb6bca8db4768226f8ea8291ea4f83f6":[11,0,12,4,12],
-"db/d80/gale__shapley_8cpp.html":[11,0,11,4],
-"db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,11,4,2],
-"db/d80/gale__shapley_8cpp.html#a6d7e84df47dcf19e88f95f8f9040306c":[11,0,11,4,0],
-"db/d80/gale__shapley_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,4,1],
-"db/d82/classlarge__number.html":[10,0,37],
-"db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872":[10,0,37,2],
-"db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337":[10,0,37,0],
-"db/d82/classlarge__number.html#a13282908dfc4888392ed3d1fc6aae492":[10,0,37,17],
-"db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc":[10,0,37,6],
-"db/d82/classlarge__number.html#a4757697b1f7584b69e779a72abc4ae2a":[10,0,37,9],
-"db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615":[10,0,37,4],
-"db/d82/classlarge__number.html#a72ae1ef050c4c28c50952ecab22d4b94":[10,0,37,15],
-"db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f":[10,0,37,3],
-"db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350":[10,0,37,8],
-"db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca":[10,0,37,18],
-"db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08":[10,0,37,13],
-"db/d82/classlarge__number.html#a8d4364ee5a62964451d8cfee82649687":[10,0,37,10],
-"db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9":[10,0,37,14],
-"db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf":[10,0,37,11],
-"db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b":[10,0,37,12],
-"db/d82/classlarge__number.html#abbd52948bee1b16543f1dae19aa9dd46":[10,0,37,16],
-"db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93":[10,0,37,7],
-"db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac":[10,0,37,5],
-"db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57":[10,0,37,19],
-"db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a":[10,0,37,1],
-"db/d8b/struct_node.html":[10,0,45],
-"db/d93/check__prime_8cpp.html":[11,0,14,7],
-"db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,7,2],
-"db/d93/check__prime_8cpp.html#abd8f794b2229b42876169ff841b6e444":[11,0,14,7,0],
-"db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,7,1],
-"db/d9a/classuint128__t.html":[10,0,60],
-"db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40":[10,0,60,18],
-"db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3":[10,0,60,37],
-"db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798":[10,0,60,42],
-"db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a":[10,0,60,22],
-"db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9":[10,0,60,65],
-"db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac":[10,0,60,1],
-"db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606":[10,0,60,32],
-"db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190":[10,0,60,50],
-"db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a":[10,0,60,53],
-"db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed":[10,0,60,40],
-"db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705":[10,0,60,77],
-"db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640":[10,0,60,24],
-"db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2":[10,0,60,19],
-"db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440":[10,0,60,61],
-"db/d9a/classuint128__t.html#a2ecb71686e1c9ed0267124580c91c414":[10,0,60,41],
-"db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd":[10,0,60,71],
-"db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db":[10,0,60,47],
-"db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092":[10,0,60,29],
-"db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee":[10,0,60,45],
-"db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03":[10,0,60,75],
-"db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481":[10,0,60,62],
-"db/d9a/classuint128__t.html#a3c4a7e775a0820196fc08303bbeed44a":[10,0,60,57],
-"db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304":[10,0,60,70],
-"db/d9a/classuint128__t.html#a4147188abcdcdb12c61bfbe4e4c0a363":[10,0,60,5],
-"db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f":[10,0,60,76],
-"db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860":[10,0,60,28],
-"db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67":[10,0,60,68],
-"db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c":[10,0,60,52],
-"db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30":[10,0,60,27],
-"db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d":[10,0,60,31],
-"db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004":[10,0,60,35],
-"db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc":[10,0,60,48],
-"db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953":[10,0,60,78],
-"db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b":[10,0,60,3],
-"db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee":[10,0,60,72],
-"db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec":[10,0,60,38],
-"db/d9a/classuint128__t.html#a6d45302022ef7f5195458f41b8aedb6e":[10,0,60,11],
-"db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848":[10,0,60,64],
-"db/d9a/classuint128__t.html#a75767cb2b6fd47ecb1f721755fdc7639":[10,0,60,12],
-"db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696":[10,0,60,14],
-"db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896":[10,0,60,58],
-"db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e":[10,0,60,59],
-"db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e":[10,0,60,8],
-"db/d9a/classuint128__t.html#a7d56143b2e291e8087188192533d2e3c":[10,0,60,4],
-"db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503":[10,0,60,74],
-"db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c":[10,0,60,39],
-"db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e":[10,0,60,60],
-"db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df":[10,0,60,6],
-"db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c":[10,0,60,9],
-"db/d9a/classuint128__t.html#a9487ed06019d846add5dc8874e41eb8b":[10,0,60,67],
-"db/d9a/classuint128__t.html#a95ac8be8f414fcbce09301b912f5079d":[10,0,60,2],
-"db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295":[10,0,60,30],
-"db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb":[10,0,60,36],
-"db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4":[10,0,60,20],
-"db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a":[10,0,60,51],
-"db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd":[10,0,60,10],
-"db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b":[10,0,60,46],
-"db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37":[10,0,60,66],
-"db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1":[10,0,60,23],
-"db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e":[10,0,60,15],
-"db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5":[10,0,60,56],
-"db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d":[10,0,60,73],
-"db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74":[10,0,60,54],
-"db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8":[10,0,60,43],
-"db/d9a/classuint128__t.html#abfc6a8765039cacc829a5cd386b5a066":[10,0,60,17],
-"db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050":[10,0,60,25],
-"db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e":[10,0,60,33],
-"db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544":[10,0,60,55],
-"db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4":[10,0,60,49],
-"db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244":[10,0,60,21],
-"db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d":[10,0,60,13],
-"db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040":[10,0,60,0],
-"db/d9a/classuint128__t.html#add9938b97fc66560cec2d32e8c83eaad":[10,0,60,16],
-"db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a":[10,0,60,69],
-"db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292":[10,0,60,63],
-"db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94":[10,0,60,44],
-"db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2":[10,0,60,7],
-"db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733":[10,0,60,26],
-"db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6":[10,0,60,34],
-"db/d9f/iterative__factorial_8cpp.html":[11,0,14,27],
-"db/d9f/iterative__factorial_8cpp.html#a2565c745aac2f9561cc6fd9e56d9b77a":[11,0,14,27,0],
-"db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,27,2],
-"db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,27,1],
-"db/da4/namespacestd_1_1regex__constants.html":[9,0,118,2],
-"db/da9/classqueue.html":[10,0,50],
-"db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368":[10,0,50,2],
-"db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d":[10,0,50,7],
-"db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec":[10,0,50,6],
-"db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375":[10,0,50,0],
-"db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7":[10,0,50,5],
-"db/da9/classqueue.html#a7611df63ebefae613d311039d7305143":[10,0,50,9],
-"db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604":[10,0,50,4],
-"db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d":[10,0,50,3],
-"db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85":[10,0,50,1],
-"db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094":[10,0,50,8],
-"db/dbc/tree__234_8cpp.html":[11,0,4,22],
-"db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,4,22,2],
-"db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243":[11,0,4,22,3],
-"db/dbc/tree__234_8cpp.html#af1ac73779b0fcfbbdce3976c0ca57342":[11,0,4,22,4],
-"db/dc0/namespacebacktracking.html":[9,0,5],
-"db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50":[9,0,5,1],
-"db/dc4/floyd__cycle__detection__algo_8cpp.html":[11,0,21,2],
-"db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88":[11,0,21,2,0],
-"db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,21,2,2],
-"db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,2,1],
-"db/dd3/ode__forward__euler_8cpp.html":[11,0,15,15],
-"db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,15,15,3],
-"db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f":[11,0,15,15,5],
-"db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe":[11,0,15,15,4],
-"db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b":[11,0,15,15,0],
-"db/ddc/namespaceaystar__search.html":[9,0,4],
-"db/dde/namespaceothers_1_1_cache.html":[9,0,88,0],
-"db/df3/happy__number_8cpp.html":[11,0,17,5],
-"db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7":[11,0,17,5,0],
-"db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,5,1],
-"db/dfb/maximum__circular__subarray_8cpp.html":[11,0,6,11],
-"db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,6,11,0],
-"db/dfb/maximum__circular__subarray_8cpp.html#a5239174fa0d987f2c67edc1f2af82beb":[11,0,6,11,1],
-"db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,11,2],
-"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html":[10,0,3,0,0],
-"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256":[10,0,3,0,0,0],
-"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17":[10,0,3,0,0,14],
-"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a42c986fb57b74fe1b7c5953cb1922c3d":[10,0,3,0,0,10],
-"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a4aa49765cce39ce48b9241e993e0cfb9":[10,0,3,0,0,1],
-"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c":[10,0,3,0,0,11],
-"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50":[10,0,3,0,0,3],
-"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c":[10,0,3,0,0,4],
-"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a678681c9f6266a8219bd6bee6972d70e":[10,0,3,0,0,9],
-"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a":[10,0,3,0,0,15],
-"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ab6534125643a02c114bd4cddba9bc17f":[10,0,3,0,0,2],
-"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ac4c64e5723fa12a043fd0a7f5ed5bb37":[10,0,3,0,0,12],
-"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211":[10,0,3,0,0,7],
-"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae190115f8d4d31e47d7290e0b6871391":[10,0,3,0,0,8],
-"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1":[10,0,3,0,0,13],
-"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e":[10,0,3,0,0,5],
-"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12":[10,0,3,0,0,6],
-"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af12ceffdc07cc87eca8a4a8ac87d60fe":[10,0,3,0,0,16],
-"dc/d14/wildcard__matching_8cpp.html":[11,0,0,11],
-"dc/d14/wildcard__matching_8cpp.html#a4a5b107f93db24e424b12899fa692c5a":[11,0,0,11,2],
-"dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,11,1],
-"dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,11,0],
-"dc/d1a/pascal__triangle_8cpp.html":[11,0,17,16]
+"dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,13,6,4],
+"dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a":[11,0,13,6,1],
+"dc/d38/ordinary__least__squares__regressor_8cpp_source.html":[11,0,13,6],
+"dc/d3a/namespacesubset__sum.html":[9,0,125],
+"dc/d52/linear__recurrence__matrix_8cpp_source.html":[11,0,14,34],
+"dc/d5a/rat__maze_8cpp.html":[11,0,0,8],
+"dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,8,2],
+"dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3":[11,0,0,8,1],
+"dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,8,0],
+"dc/d5a/rat__maze_8cpp_source.html":[11,0,0,8],
+"dc/d61/classgraph_1_1_graph.html":[9,0,39,0],
+"dc/d61/classgraph_1_1_graph.html":[10,0,6,2],
+"dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981":[9,0,39,0,2],
+"dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981":[10,0,6,2,2],
+"dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a":[9,0,39,0,5],
+"dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a":[10,0,6,2,5],
+"dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19":[9,0,39,0,1],
+"dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19":[10,0,6,2,1],
+"dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5":[9,0,39,0,0],
+"dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5":[10,0,6,2,0],
+"dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904":[9,0,39,0,3],
+"dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904":[10,0,6,2,3],
+"dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0":[9,0,39,0,4],
+"dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0":[10,0,6,2,4],
+"dc/d64/md__coding_guidelines.html":[2],
+"dc/d64/md__coding_guidelines.html#autotoc_md18":[2,0],
+"dc/d64/md__coding_guidelines.html#autotoc_md20":[2,1],
+"dc/d67/subset__sum__dynamic_8cpp.html":[11,0,6,26],
+"dc/d67/subset__sum__dynamic_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607":[11,0,6,26,2],
+"dc/d67/subset__sum__dynamic_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,26,3],
+"dc/d67/subset__sum__dynamic_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50":[11,0,6,26,1],
+"dc/d67/subset__sum__dynamic_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,26,0],
+"dc/d67/subset__sum__dynamic_8cpp_source.html":[11,0,6,26],
+"dc/d6d/power__of__2_8cpp.html":[11,0,1,7],
+"dc/d6d/power__of__2_8cpp.html#a5032470c9974bbd6ec254bf296530a5f":[11,0,1,7,0],
+"dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,7,2],
+"dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,7,1],
+"dc/d6d/power__of__2_8cpp_source.html":[11,0,1,7],
+"dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html":[10,0,19,1],
+"dc/d82/area_8cpp.html":[11,0,14,2],
+"dc/d82/area_8cpp.html#a3277e65a8f380e7632791975bfba0efb":[11,0,14,2,3],
+"dc/d82/area_8cpp.html#a40e36c67da78d2131408c57ee091ad75":[11,0,14,2,0],
+"dc/d82/area_8cpp.html#a5de184925e68658f15415dd53954df4f":[11,0,14,2,5],
+"dc/d82/area_8cpp.html#a971ce57e368f2f631cf1f4ff3f864049":[11,0,14,2,8],
+"dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,2,9],
+"dc/d82/area_8cpp.html#ab31d141f7c5b551746b1eee0eb4dedca":[11,0,14,2,6],
+"dc/d82/area_8cpp.html#ab3b920cc56442abd92279ba23b50f4dc":[11,0,14,2,10],
+"dc/d82/area_8cpp.html#ab7f29862d30df351c317eedd60a0c656":[11,0,14,2,7],
+"dc/d82/area_8cpp.html#abc46c784a297fc1d2eb8b33a327fba4c":[11,0,14,2,1],
+"dc/d82/area_8cpp.html#ac5803413618fcfb922cb32c6db0fc864":[11,0,14,2,2],
+"dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,2,4],
+"dc/d82/area_8cpp_source.html":[11,0,14,2],
+"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html":[10,0,10,2,0,0],
+"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a11046825be0b6dbb73fbe834aa49200e":[10,0,10,2,0,0,0],
+"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a19aaccad279b22dbbb6c55e5697b4114":[10,0,10,2,0,0,6],
+"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2":[10,0,10,2,0,0,2],
+"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6c859e3737aa88b29854df0347b29f4e":[10,0,10,2,0,0,4],
+"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ac9cda9453c4a0caf5bae7f9213b019a0":[10,0,10,2,0,0,3],
+"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ae077132526d2863e46aa77cb0f7d6aa2":[10,0,10,2,0,0,5],
+"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#af136ec31dbd35b1be2eb9a057677c704":[10,0,10,2,0,0,1],
+"dc/d93/trie__modern_8cpp.html":[11,0,4,37],
+"dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,37,2],
+"dc/d93/trie__modern_8cpp_source.html":[11,0,4,37],
+"dc/d9c/babylonian__method_8cpp.html":[11,0,15,0],
+"dc/d9c/babylonian__method_8cpp.html#a28e67885f8606564cc8335f483f63309":[11,0,15,0,0],
+"dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,15,0,2],
+"dc/d9c/babylonian__method_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089":[11,0,15,0,1],
+"dc/d9c/babylonian__method_8cpp_source.html":[11,0,15,0],
+"dc/daa/lru__cache2_8cpp.html":[11,0,17,13],
+"dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,17,13,3],
+"dc/daa/lru__cache2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,13,2],
+"dc/daa/lru__cache2_8cpp_source.html":[11,0,17,13],
+"dc/db5/struct_queue.html":[10,0,49],
+"dc/db5/text__search_8cpp.html":[11,0,22,15],
+"dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9":[11,0,22,15,0],
+"dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,15,2],
+"dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,15,1],
+"dc/db5/text__search_8cpp_source.html":[11,0,22,15],
+"dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html":[12,3],
+"dc/dc5/namespacereverse__binary__tree.html":[9,0,103],
+"dc/dc5/paranthesis__matching_8cpp.html":[11,0,17,16],
+"dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326":[11,0,17,16,0],
+"dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664":[11,0,17,16,2],
+"dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7":[11,0,17,16,4],
+"dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095":[11,0,17,16,3],
+"dc/dc5/paranthesis__matching_8cpp.html#ade525d33459755a32ba21e1b6910ff21":[11,0,17,16,1],
+"dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f":[11,0,17,16,5],
+"dc/dc5/paranthesis__matching_8cpp_source.html":[11,0,17,16],
+"dc/dd4/classdata__structures_1_1_bloom_filter.html":[9,0,21,2],
+"dc/dd4/classdata__structures_1_1_bloom_filter.html":[10,0,2,9],
+"dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b":[9,0,21,2,2],
+"dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b":[10,0,2,9,2],
+"dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80":[9,0,21,2,3],
+"dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80":[10,0,2,9,3],
+"dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840":[9,0,21,2,1],
+"dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840":[10,0,2,9,1],
+"dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a":[9,0,21,2,0],
+"dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a":[10,0,2,9,0],
+"dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119":[9,0,21,2,4],
+"dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119":[10,0,2,9,4],
+"dc/dd9/strand__sort_8cpp.html":[11,0,23,38],
+"dc/dd9/strand__sort_8cpp.html#a2bea2fe5dd38ed63610fdeaddf5785cd":[11,0,23,38,1],
+"dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,23,38,2],
+"dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,38,0],
+"dc/dd9/strand__sort_8cpp_source.html":[11,0,23,38],
+"dc/de1/recursive__tree__traversal_8cpp.html":[11,0,17,20],
+"dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,17,20,4],
+"dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,17,20,3],
+"dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,17,20,6],
+"dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e":[11,0,17,20,5],
+"dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,20,2],
+"dc/de1/recursive__tree__traversal_8cpp_source.html":[11,0,17,20],
+"dc/dfb/atbash__cipher_8cpp.html":[11,0,2,1],
+"dc/dfb/atbash__cipher_8cpp.html#a8f7dd4dcd3df7c512c20482afc2dbb9d":[11,0,2,1,0],
+"dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,2,1,2],
+"dc/dfb/atbash__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,1,1],
+"dc/dfb/atbash__cipher_8cpp_source.html":[11,0,2,1],
+"dc/dfe/ternary__search_8cpp.html":[11,0,22,14],
+"dc/dfe/ternary__search_8cpp.html#a23ad617bfce1e7cf4591059c85c1a027":[11,0,22,14,0],
+"dc/dfe/ternary__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326":[11,0,22,14,2],
+"dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1":[11,0,22,14,3],
+"dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead":[11,0,22,14,6],
+"dc/dfe/ternary__search_8cpp.html#ae01eda5098801bb6b5b778828fb4fddc":[11,0,22,14,1],
+"dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0":[11,0,22,14,4],
+"dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,14,5],
+"dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8":[11,0,22,14,7],
+"dc/dfe/ternary__search_8cpp_source.html":[11,0,22,14],
+"dd/d0c/hamiltons__cycle_8cpp.html":[11,0,9,9],
+"dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299":[11,0,9,9,4],
+"dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,9,9,1],
+"dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae":[11,0,9,9,3],
+"dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4":[11,0,9,9,0],
+"dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243":[11,0,9,9,2],
+"dd/d0c/hamiltons__cycle_8cpp_source.html":[11,0,9,9],
+"dd/d0d/insertion__sort_8cpp.html":[11,0,23,15],
+"dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49":[11,0,23,15,0],
+"dd/d0d/insertion__sort_8cpp.html#a78cb2f3b97b6db2c062b2a1df05c9ea9":[11,0,23,15,2],
+"dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,23,15,4],
+"dd/d0d/insertion__sort_8cpp.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f":[11,0,23,15,1],
+"dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,15,3],
+"dd/d0d/insertion__sort_8cpp_source.html":[11,0,23,15],
+"dd/d12/vigenere__cipher_8cpp.html":[11,0,2,9],
+"dd/d12/vigenere__cipher_8cpp.html#a3cfc3f9b20a0f230a2fcefd31dc6848e":[11,0,2,9,0],
+"dd/d12/vigenere__cipher_8cpp.html#a6bd3880ea6820c232c1eddf47553c257":[11,0,2,9,1],
+"dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,2,9,3],
+"dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,9,2],
+"dd/d12/vigenere__cipher_8cpp_source.html":[11,0,2,9],
+"dd/d1b/structquery.html":[10,0,48],
+"dd/d1c/classhash__chain.html":[10,0,35],
+"dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a":[10,0,35,4],
+"dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff":[10,0,35,2],
+"dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed":[10,0,35,3],
+"dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595":[10,0,35,1],
+"dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64":[10,0,35,5],
+"dd/d1c/classhash__chain.html#a8b204861e9470377c956d3b5cd313036":[10,0,35,0],
+"dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0":[10,0,35,7],
+"dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2":[10,0,35,6],
+"dd/d1e/generate__parentheses_8cpp.html":[11,0,0,0],
+"dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,0,2],
+"dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,0,1],
+"dd/d1e/generate__parentheses_8cpp_source.html":[11,0,0,0],
+"dd/d1f/classdsu.html":[10,0,30],
+"dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a":[10,0,30,4],
+"dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72":[10,0,30,0],
+"dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72":[10,0,30,1],
+"dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c":[10,0,30,2],
+"dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c":[10,0,30,3],
+"dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c":[10,0,30,10],
+"dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63":[10,0,30,15],
+"dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb":[10,0,30,16],
+"dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53":[10,0,30,14],
+"dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429":[10,0,30,13],
+"dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303":[10,0,30,8],
+"dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303":[10,0,30,9],
+"dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde":[10,0,30,5],
+"dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559":[10,0,30,11],
+"dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f":[10,0,30,12],
+"dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280":[10,0,30,7],
+"dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55":[10,0,30,17],
+"dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415":[10,0,30,6],
+"dd/d21/namespacewindowed__median.html":[9,0,141],
+"dd/d24/namespacedynamic__programming.html":[9,0,28],
+"dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8":[9,0,28,4],
+"dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079":[9,0,28,1],
+"dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb":[9,0,28,3],
+"dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26":[9,0,28,0],
+"dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412":[9,0,28,2],
+"dd/d29/false__position_8cpp.html":[11,0,15,5],
+"dd/d29/false__position_8cpp.html#a7d69b49dc37da1c02b3ab8c7fe783494":[11,0,15,5,3],
+"dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713":[11,0,15,5,0],
+"dd/d29/false__position_8cpp.html#a85cb7bfb90abc898e042d624372c5345":[11,0,15,5,2],
+"dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,5,1],
+"dd/d29/false__position_8cpp_source.html":[11,0,15,5],
+"dd/d2e/namespacedata__structures_1_1treap.html":[9,0,21,0],
+"dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099":[9,0,21,0,1],
+"dd/d2f/class_trie.html":[10,0,59],
+"dd/d2f/class_trie.html#a26941759ecf94d67a27d4a610bc0f63d":[10,0,59,4],
+"dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206":[10,0,59,5],
+"dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908":[10,0,59,1],
+"dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb":[10,0,59,2],
+"dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2":[10,0,59,3],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html":[10,0,2,6,0],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4":[10,0,2,6,0,2],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f":[10,0,2,6,0,1],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57":[10,0,2,6,0,10],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a28944bb16ec22650b47fe3e80e3e13f8":[10,0,2,6,0,20],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956":[10,0,2,6,0,15],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a441cbee9896391f2b167d5aa7b4f8c95":[10,0,2,6,0,8],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3":[10,0,2,6,0,5],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd":[10,0,2,6,0,18],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71":[10,0,2,6,0,11],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8":[10,0,2,6,0,19],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a650f0ef26b7450e1addb5d80bb0ed629":[10,0,2,6,0,6],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18":[10,0,2,6,0,17],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94":[10,0,2,6,0,13],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9":[10,0,2,6,0,26],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb":[10,0,2,6,0,14],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46":[10,0,2,6,0,12],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921":[10,0,2,6,0,25],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc":[10,0,2,6,0,23],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06":[10,0,2,6,0,4],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74":[10,0,2,6,0,21],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab654d7376d3449fdc78edab0e7fed06e":[10,0,2,6,0,7],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e":[10,0,2,6,0,9],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5219979ea9a8baa3a273a9ec0f0c670":[10,0,2,6,0,0],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d":[10,0,2,6,0,24],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad632a0440295bc88ceadae7478fe0d37":[10,0,2,6,0,3],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1":[10,0,2,6,0,22],
+"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631":[10,0,2,6,0,16],
+"dd/d43/namespace_m_d5.html":[9,0,70],
+"dd/d47/namespacemath.html":[9,0,69],
+"dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85":[9,0,69,0],
+"dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244":[9,0,69,21],
+"dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3":[9,0,69,26],
+"dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73":[9,0,69,12],
+"dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a":[9,0,69,19],
+"dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c":[9,0,69,45],
+"dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb":[9,0,69,15],
+"dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551":[9,0,69,38],
+"dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3":[9,0,69,44],
+"dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12":[9,0,69,35],
+"dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7":[9,0,69,7],
+"dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75":[9,0,69,5],
+"dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6":[9,0,69,34],
+"dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec":[9,0,69,42],
+"dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f":[9,0,69,25],
+"dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca":[9,0,69,17],
+"dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967":[9,0,69,23],
+"dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a":[9,0,69,14],
+"dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b":[9,0,69,9]
 };
diff --git a/navtreeindex12.js b/navtreeindex12.js
index bfb0c73ab..5c65f911a 100644
--- a/navtreeindex12.js
+++ b/navtreeindex12.js
@@ -1,253 +1,253 @@
 var NAVTREEINDEX12 =
 {
-"dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd":[11,0,17,16,1],
-"dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c":[11,0,17,16,2],
-"dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,16,0],
-"dc/d1f/classcatalan__numbers.html":[10,0,23],
-"dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8":[10,0,23,0],
-"dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html":[9,0,17],
-"dc/d38/ordinary__least__squares__regressor_8cpp.html":[11,0,13,5],
-"dc/d38/ordinary__least__squares__regressor_8cpp.html#a01e6c7bf2b09272578b9c5819ce0f36f":[11,0,13,5,10],
-"dc/d38/ordinary__least__squares__regressor_8cpp.html#a207b3a99fd5974d3117e0b0ac0aad234":[11,0,13,5,6],
-"dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb":[11,0,13,5,2],
-"dc/d38/ordinary__least__squares__regressor_8cpp.html#a42535e20e97d85aa61271e0894cc0359":[11,0,13,5,9],
-"dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d":[11,0,13,5,5],
-"dc/d38/ordinary__least__squares__regressor_8cpp.html#a4a6a560dbdd0177633783b72db37dc19":[11,0,13,5,11],
-"dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4":[11,0,13,5,13],
-"dc/d38/ordinary__least__squares__regressor_8cpp.html#a7a2d742b9a3ae7b85292e1f86428bb4f":[11,0,13,5,12],
-"dc/d38/ordinary__least__squares__regressor_8cpp.html#a865e8d26a01962cc93aca66e71346f37":[11,0,13,5,8],
-"dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e":[11,0,13,5,3],
-"dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b":[11,0,13,5,0],
-"dc/d38/ordinary__least__squares__regressor_8cpp.html#ab1ad727903d7817c2758d25bcb52cbc8":[11,0,13,5,14],
-"dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493":[11,0,13,5,15],
-"dc/d38/ordinary__least__squares__regressor_8cpp.html#ae2edd40354a1ca7aeaee3d1e3589e713":[11,0,13,5,7],
-"dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,13,5,4],
-"dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a":[11,0,13,5,1],
-"dc/d3a/namespacesubset__sum.html":[9,0,126],
-"dc/d5a/rat__maze_8cpp.html":[11,0,0,7],
-"dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,7,2],
-"dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3":[11,0,0,7,1],
-"dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,7,0],
-"dc/d61/classgraph_1_1_graph.html":[9,0,39,0],
-"dc/d61/classgraph_1_1_graph.html":[10,0,6,2],
-"dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981":[9,0,39,0,2],
-"dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981":[10,0,6,2,2],
-"dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a":[9,0,39,0,5],
-"dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a":[10,0,6,2,5],
-"dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19":[9,0,39,0,1],
-"dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19":[10,0,6,2,1],
-"dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5":[9,0,39,0,0],
-"dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5":[10,0,6,2,0],
-"dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904":[9,0,39,0,3],
-"dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904":[10,0,6,2,3],
-"dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0":[9,0,39,0,4],
-"dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0":[10,0,6,2,4],
-"dc/d64/md__coding_guidelines.html":[2],
-"dc/d64/md__coding_guidelines.html#autotoc_md18":[2,0],
-"dc/d64/md__coding_guidelines.html#autotoc_md20":[2,1],
-"dc/d67/subset__sum__dynamic_8cpp.html":[11,0,6,15],
-"dc/d67/subset__sum__dynamic_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607":[11,0,6,15,2],
-"dc/d67/subset__sum__dynamic_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,15,3],
-"dc/d67/subset__sum__dynamic_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50":[11,0,6,15,1],
-"dc/d67/subset__sum__dynamic_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,15,0],
-"dc/d6d/power__of__2_8cpp.html":[11,0,1,6],
-"dc/d6d/power__of__2_8cpp.html#a5032470c9974bbd6ec254bf296530a5f":[11,0,1,6,0],
-"dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,6,2],
-"dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,6,1],
-"dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html":[9,0,118,6],
-"dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html":[10,0,19,1],
-"dc/d82/area_8cpp.html":[11,0,14,2],
-"dc/d82/area_8cpp.html#a3277e65a8f380e7632791975bfba0efb":[11,0,14,2,3],
-"dc/d82/area_8cpp.html#a40e36c67da78d2131408c57ee091ad75":[11,0,14,2,0],
-"dc/d82/area_8cpp.html#a5de184925e68658f15415dd53954df4f":[11,0,14,2,5],
-"dc/d82/area_8cpp.html#a971ce57e368f2f631cf1f4ff3f864049":[11,0,14,2,8],
-"dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,2,9],
-"dc/d82/area_8cpp.html#ab31d141f7c5b551746b1eee0eb4dedca":[11,0,14,2,6],
-"dc/d82/area_8cpp.html#ab3b920cc56442abd92279ba23b50f4dc":[11,0,14,2,10],
-"dc/d82/area_8cpp.html#ab7f29862d30df351c317eedd60a0c656":[11,0,14,2,7],
-"dc/d82/area_8cpp.html#abc46c784a297fc1d2eb8b33a327fba4c":[11,0,14,2,1],
-"dc/d82/area_8cpp.html#ac5803413618fcfb922cb32c6db0fc864":[11,0,14,2,2],
-"dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,2,4],
-"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html":[10,0,10,2,0,0],
-"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a11046825be0b6dbb73fbe834aa49200e":[10,0,10,2,0,0,0],
-"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a19aaccad279b22dbbb6c55e5697b4114":[10,0,10,2,0,0,6],
-"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2":[10,0,10,2,0,0,2],
-"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6c859e3737aa88b29854df0347b29f4e":[10,0,10,2,0,0,4],
-"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ac9cda9453c4a0caf5bae7f9213b019a0":[10,0,10,2,0,0,3],
-"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ae077132526d2863e46aa77cb0f7d6aa2":[10,0,10,2,0,0,5],
-"dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#af136ec31dbd35b1be2eb9a057677c704":[10,0,10,2,0,0,1],
-"dc/d93/trie__modern_8cpp.html":[11,0,4,23],
-"dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,23,2],
-"dc/d9c/babylonian__method_8cpp.html":[11,0,15,0],
-"dc/d9c/babylonian__method_8cpp.html#a28e67885f8606564cc8335f483f63309":[11,0,15,0,0],
-"dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,15,0,2],
-"dc/d9c/babylonian__method_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089":[11,0,15,0,1],
-"dc/daa/lru__cache2_8cpp.html":[11,0,17,12],
-"dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,17,12,3],
-"dc/daa/lru__cache2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,12,2],
-"dc/db5/struct_queue.html":[10,0,49],
-"dc/db5/text__search_8cpp.html":[11,0,21,13],
-"dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9":[11,0,21,13,0],
-"dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,21,13,2],
-"dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,13,1],
-"dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html":[12,3],
-"dc/dc5/namespacereverse__binary__tree.html":[9,0,103],
-"dc/dc5/paranthesis__matching_8cpp.html":[11,0,17,15],
-"dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326":[11,0,17,15,0],
-"dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664":[11,0,17,15,2],
-"dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7":[11,0,17,15,4],
-"dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095":[11,0,17,15,3],
-"dc/dc5/paranthesis__matching_8cpp.html#ade525d33459755a32ba21e1b6910ff21":[11,0,17,15,1],
-"dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f":[11,0,17,15,5],
-"dc/dd4/classdata__structures_1_1_bloom_filter.html":[9,0,21,2],
-"dc/dd4/classdata__structures_1_1_bloom_filter.html":[10,0,2,9],
-"dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b":[9,0,21,2,2],
-"dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b":[10,0,2,9,2],
-"dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80":[9,0,21,2,3],
-"dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80":[10,0,2,9,3],
-"dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840":[9,0,21,2,1],
-"dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840":[10,0,2,9,1],
-"dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a":[9,0,21,2,0],
-"dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a":[10,0,2,9,0],
-"dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119":[9,0,21,2,4],
-"dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119":[10,0,2,9,4],
-"dc/dd9/strand__sort_8cpp.html":[11,0,22,25],
-"dc/dd9/strand__sort_8cpp.html#a2bea2fe5dd38ed63610fdeaddf5785cd":[11,0,22,25,1],
-"dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,25,2],
-"dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,25,0],
-"dc/de1/recursive__tree__traversal_8cpp.html":[11,0,17,19],
-"dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,17,19,4],
-"dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,17,19,3],
-"dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,17,19,6],
-"dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e":[11,0,17,19,5],
-"dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,19,2],
-"dc/dfb/atbash__cipher_8cpp.html":[11,0,2,1],
-"dc/dfb/atbash__cipher_8cpp.html#a8f7dd4dcd3df7c512c20482afc2dbb9d":[11,0,2,1,0],
-"dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,2,1,2],
-"dc/dfb/atbash__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,1,1],
-"dc/dfe/ternary__search_8cpp.html":[11,0,21,12],
-"dc/dfe/ternary__search_8cpp.html#a23ad617bfce1e7cf4591059c85c1a027":[11,0,21,12,0],
-"dc/dfe/ternary__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326":[11,0,21,12,2],
-"dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1":[11,0,21,12,3],
-"dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead":[11,0,21,12,6],
-"dc/dfe/ternary__search_8cpp.html#ae01eda5098801bb6b5b778828fb4fddc":[11,0,21,12,1],
-"dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0":[11,0,21,12,4],
-"dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,12,5],
-"dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8":[11,0,21,12,7],
-"dd/d0c/hamiltons__cycle_8cpp.html":[11,0,9,7],
-"dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299":[11,0,9,7,4],
-"dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,9,7,1],
-"dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae":[11,0,9,7,3],
-"dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4":[11,0,9,7,0],
-"dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243":[11,0,9,7,2],
-"dd/d0d/insertion__sort_8cpp.html":[11,0,22,9],
-"dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49":[11,0,22,9,0],
-"dd/d0d/insertion__sort_8cpp.html#a78cb2f3b97b6db2c062b2a1df05c9ea9":[11,0,22,9,2],
-"dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,22,9,4],
-"dd/d0d/insertion__sort_8cpp.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f":[11,0,22,9,1],
-"dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,9,3],
-"dd/d12/vigenere__cipher_8cpp.html":[11,0,2,8],
-"dd/d12/vigenere__cipher_8cpp.html#a3cfc3f9b20a0f230a2fcefd31dc6848e":[11,0,2,8,0],
-"dd/d12/vigenere__cipher_8cpp.html#a6bd3880ea6820c232c1eddf47553c257":[11,0,2,8,1],
-"dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,2,8,3],
-"dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,8,2],
-"dd/d1b/structquery.html":[10,0,48],
-"dd/d1c/classhash__chain.html":[10,0,35],
-"dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a":[10,0,35,4],
-"dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff":[10,0,35,2],
-"dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed":[10,0,35,3],
-"dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595":[10,0,35,1],
-"dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64":[10,0,35,5],
-"dd/d1c/classhash__chain.html#a8b204861e9470377c956d3b5cd313036":[10,0,35,0],
-"dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0":[10,0,35,7],
-"dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2":[10,0,35,6],
-"dd/d1e/generate__parentheses_8cpp.html":[11,0,0,0],
-"dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,0,2],
-"dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,0,1],
-"dd/d1f/classdsu.html":[10,0,30],
-"dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a":[10,0,30,4],
-"dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72":[10,0,30,0],
-"dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72":[10,0,30,1],
-"dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c":[10,0,30,2],
-"dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c":[10,0,30,3],
-"dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c":[10,0,30,10],
-"dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63":[10,0,30,15],
-"dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb":[10,0,30,16],
-"dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53":[10,0,30,14],
-"dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429":[10,0,30,13],
-"dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303":[10,0,30,8],
-"dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303":[10,0,30,9],
-"dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde":[10,0,30,5],
-"dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559":[10,0,30,11],
-"dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f":[10,0,30,12],
-"dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280":[10,0,30,7],
-"dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55":[10,0,30,17],
-"dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415":[10,0,30,6],
-"dd/d21/namespacewindowed__median.html":[9,0,142],
-"dd/d24/namespacedynamic__programming.html":[9,0,28],
-"dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8":[9,0,28,4],
-"dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079":[9,0,28,1],
-"dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb":[9,0,28,3],
-"dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26":[9,0,28,0],
-"dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412":[9,0,28,2],
-"dd/d29/false__position_8cpp.html":[11,0,15,5],
-"dd/d29/false__position_8cpp.html#a7d69b49dc37da1c02b3ab8c7fe783494":[11,0,15,5,3],
-"dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713":[11,0,15,5,0],
-"dd/d29/false__position_8cpp.html#a85cb7bfb90abc898e042d624372c5345":[11,0,15,5,2],
-"dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,5,1],
-"dd/d2e/namespacedata__structures_1_1treap.html":[9,0,21,0],
-"dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099":[9,0,21,0,1],
-"dd/d2f/class_trie.html":[10,0,59],
-"dd/d2f/class_trie.html#a26941759ecf94d67a27d4a610bc0f63d":[10,0,59,4],
-"dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206":[10,0,59,5],
-"dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908":[10,0,59,1],
-"dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb":[10,0,59,2],
-"dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2":[10,0,59,3],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html":[10,0,2,6,0],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4":[10,0,2,6,0,2],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f":[10,0,2,6,0,1],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57":[10,0,2,6,0,10],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a28944bb16ec22650b47fe3e80e3e13f8":[10,0,2,6,0,20],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956":[10,0,2,6,0,15],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a441cbee9896391f2b167d5aa7b4f8c95":[10,0,2,6,0,8],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3":[10,0,2,6,0,5],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd":[10,0,2,6,0,18],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71":[10,0,2,6,0,11],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8":[10,0,2,6,0,19],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a650f0ef26b7450e1addb5d80bb0ed629":[10,0,2,6,0,6],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18":[10,0,2,6,0,17],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94":[10,0,2,6,0,13],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9":[10,0,2,6,0,26],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb":[10,0,2,6,0,14],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46":[10,0,2,6,0,12],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921":[10,0,2,6,0,25],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc":[10,0,2,6,0,23],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06":[10,0,2,6,0,4],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74":[10,0,2,6,0,21],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab654d7376d3449fdc78edab0e7fed06e":[10,0,2,6,0,7],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e":[10,0,2,6,0,9],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5219979ea9a8baa3a273a9ec0f0c670":[10,0,2,6,0,0],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d":[10,0,2,6,0,24],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad632a0440295bc88ceadae7478fe0d37":[10,0,2,6,0,3],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1":[10,0,2,6,0,22],
-"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631":[10,0,2,6,0,16],
-"dd/d43/namespace_m_d5.html":[9,0,70],
-"dd/d47/namespacemath.html":[9,0,69],
-"dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85":[9,0,69,0],
-"dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244":[9,0,69,21],
-"dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3":[9,0,69,26],
-"dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73":[9,0,69,12],
-"dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a":[9,0,69,19],
-"dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c":[9,0,69,45],
-"dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb":[9,0,69,15],
-"dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551":[9,0,69,38],
-"dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3":[9,0,69,44],
-"dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12":[9,0,69,35],
-"dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7":[9,0,69,7],
-"dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75":[9,0,69,5],
-"dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6":[9,0,69,34],
-"dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec":[9,0,69,42],
-"dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f":[9,0,69,25],
-"dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca":[9,0,69,17],
-"dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967":[9,0,69,23]
+"dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb":[9,0,69,29],
+"dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0":[9,0,69,22],
+"dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec":[9,0,69,3],
+"dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f":[9,0,69,36],
+"dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14":[9,0,69,40],
+"dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c":[9,0,69,31],
+"dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049":[9,0,69,39],
+"dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f":[9,0,69,24],
+"dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb":[9,0,69,32],
+"dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca":[9,0,69,33],
+"dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf":[9,0,69,1],
+"dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc":[9,0,69,43],
+"dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656":[9,0,69,37],
+"dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c":[9,0,69,8],
+"dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444":[9,0,69,18],
+"dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca":[9,0,69,13],
+"dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188":[9,0,69,2],
+"dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5":[9,0,69,27],
+"dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864":[9,0,69,11],
+"dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4":[9,0,69,30],
+"dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953":[9,0,69,6],
+"dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea":[9,0,69,4],
+"dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725":[9,0,69,10],
+"dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11":[9,0,69,16],
+"dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a":[9,0,69,41],
+"dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f":[9,0,69,20],
+"dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d":[9,0,69,28],
+"dd/d4f/class_solution.html":[10,0,53],
+"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html":[9,0,122,0,0],
+"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html":[10,0,20,0,0],
+"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e":[9,0,122,0,0,1],
+"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e":[10,0,20,0,0,1],
+"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645":[9,0,122,0,0,0],
+"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645":[10,0,20,0,0,0],
+"dd/d65/lu__decompose_8cpp.html":[11,0,15,11],
+"dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,15,11,3],
+"dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,15,11,2],
+"dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,15,11,0],
+"dd/d65/lu__decompose_8cpp.html#a575c989afcc78e875031cd4273e62a3e":[11,0,15,11,1],
+"dd/d65/lu__decompose_8cpp_source.html":[11,0,15,11],
+"dd/d69/namespacerange__queries.html":[9,0,101],
+"dd/d73/namespaceiterative__tree__traversals.html":[9,0,53],
+"dd/d74/namespaceinorder__successor__of__bst.html":[9,0,49],
+"dd/d81/namespacecaesar.html":[9,0,12],
+"dd/d89/insertion__sort__recursive_8cpp.html":[11,0,23,16],
+"dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,23,16,4],
+"dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49":[11,0,23,16,0],
+"dd/d89/insertion__sort__recursive_8cpp.html#a78cb2f3b97b6db2c062b2a1df05c9ea9":[11,0,23,16,2],
+"dd/d89/insertion__sort__recursive_8cpp.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f":[11,0,23,16,1],
+"dd/d89/insertion__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,16,3],
+"dd/d89/insertion__sort__recursive_8cpp_source.html":[11,0,23,16],
+"dd/d8a/namespacegeometric__dist.html":[9,0,36],
+"dd/d92/memory__game_8cpp.html":[11,0,7,0],
+"dd/d92/memory__game_8cpp.html#a33167bb9cce6d527b478b4f6ae8c3f59":[11,0,7,0,3],
+"dd/d92/memory__game_8cpp.html#a370760f2b328ad341bcb77d82fa17b01":[11,0,7,0,5],
+"dd/d92/memory__game_8cpp.html#a3ceeea62d8fa6c563e2c66359fd73413":[11,0,7,0,1],
+"dd/d92/memory__game_8cpp.html#a5714d97649c0edd57b4fb449799676a3":[11,0,7,0,0],
+"dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6":[11,0,7,0,8],
+"dd/d92/memory__game_8cpp.html#ac589ef65abb0a6b9a7116ee0f9fd5280":[11,0,7,0,6],
+"dd/d92/memory__game_8cpp.html#ad573c8ae66ab66156d03e5e81bbba214":[11,0,7,0,2],
+"dd/d92/memory__game_8cpp.html#adc62ebb75853446656e24932bdc6dd6b":[11,0,7,0,7],
+"dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,7,0,4],
+"dd/d92/memory__game_8cpp_source.html":[11,0,7,0],
+"dd/d95/classdata__structures_1_1_segment_tree.html":[9,0,21,4],
+"dd/d95/classdata__structures_1_1_segment_tree.html":[10,0,2,11],
+"dd/d95/classdata__structures_1_1_segment_tree.html#a10ffa5fc03c66170f0bc2592b843baa3":[9,0,21,4,6],
+"dd/d95/classdata__structures_1_1_segment_tree.html#a10ffa5fc03c66170f0bc2592b843baa3":[10,0,2,11,6],
+"dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3":[9,0,21,4,7],
+"dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3":[10,0,2,11,7],
+"dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b":[9,0,21,4,3],
+"dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b":[10,0,2,11,3],
+"dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1":[9,0,21,4,4],
+"dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1":[10,0,2,11,4],
+"dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141":[9,0,21,4,1],
+"dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141":[10,0,2,11,1],
+"dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258":[9,0,21,4,8],
+"dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258":[10,0,2,11,8],
+"dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841":[9,0,21,4,0],
+"dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841":[10,0,2,11,0],
+"dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52":[9,0,21,4,2],
+"dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52":[10,0,2,11,2],
+"dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17":[9,0,21,4,5],
+"dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17":[10,0,2,11,5],
+"dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html":[9,0,42,1],
+"dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c":[9,0,42,1,0],
+"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html":[10,0,10,0,1],
+"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101":[10,0,10,0,1,14],
+"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a194c2973b51a5467fc17064a4ea4e6f9":[10,0,10,0,1,4],
+"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658":[10,0,10,0,1,6],
+"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b":[10,0,10,0,1,0],
+"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2":[10,0,10,0,1,13],
+"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e":[10,0,10,0,1,10],
+"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba":[10,0,10,0,1,11],
+"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3":[10,0,10,0,1,5],
+"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a9517e162e2988f7db052296bd550a742":[10,0,10,0,1,16],
+"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915":[10,0,10,0,1,15],
+"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420":[10,0,10,0,1,7],
+"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71":[10,0,10,0,1,17],
+"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2":[10,0,10,0,1,1],
+"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7":[10,0,10,0,1,2],
+"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99":[10,0,10,0,1,9],
+"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f":[10,0,10,0,1,8],
+"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9":[10,0,10,0,1,3],
+"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee":[10,0,10,0,1,12],
+"dd/da0/todo.html":[7],
+"dd/da8/pigeonhole__sort_8cpp.html":[11,0,23,24],
+"dd/da8/pigeonhole__sort_8cpp.html#a0e9e1b21a1684585e9e50f9afe4d53a3":[11,0,23,24,1],
+"dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817":[11,0,23,24,2],
+"dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d":[11,0,23,24,3],
+"dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,24,0],
+"dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a":[11,0,23,24,4],
+"dd/da8/pigeonhole__sort_8cpp_source.html":[11,0,23,24],
+"dd/dae/namespacecount__of__set__bits.html":[9,0,16],
+"dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html":[12,4],
+"dd/db6/structbinary__search__tree_1_1bst__node.html":[10,0,21,0],
+"dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df":[10,0,21,0,2],
+"dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29":[10,0,21,0,3],
+"dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778":[10,0,21,0,0],
+"dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788":[10,0,21,0,1],
+"dd/dba/namespacedivide__and__conquer.html":[9,0,24],
+"dd/dc3/is__graph__bipartite2_8cpp_source.html":[11,0,9,12],
+"dd/dca/class_f_c_f_s.html":[10,0,33],
+"dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69":[10,0,33,0],
+"dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91":[10,0,33,2],
+"dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793":[10,0,33,1],
+"dd/dca/class_f_c_f_s.html#af2594e22a867b308e027623940193d46":[10,0,33,3],
+"dd/dd5/swap__sort_8cpp_source.html":[11,0,23,39],
+"dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html":[10,0,13,4,0],
+"dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5":[10,0,13,4,0,2],
+"dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c":[10,0,13,4,0,1],
+"dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114":[10,0,13,4,0,0],
+"dd/dec/a__star__search_8cpp_source.html":[11,0,13,0],
+"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html":[10,0,6,0,0],
+"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3":[10,0,6,0,0,0],
+"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b":[10,0,6,0,0,1],
+"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6":[10,0,6,0,0,5],
+"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ab0efcfa04fff8616aff0062522d1483f":[10,0,6,0,0,3],
+"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad475f8b838693812f7569a490729f373":[10,0,6,0,0,2],
+"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef":[10,0,6,0,0,4],
+"de/d07/cycle__sort_8cpp.html":[11,0,23,11],
+"de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,23,11,2],
+"de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,11,1],
+"de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa":[11,0,23,11,0],
+"de/d07/cycle__sort_8cpp_source.html":[11,0,23,11],
+"de/d0a/namespacemerge__insertion.html":[9,0,72],
+"de/d0d/classrange__queries_1_1fenwick__tree.html":[9,0,101,0],
+"de/d0d/classrange__queries_1_1fenwick__tree.html":[10,0,16,1],
+"de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe":[9,0,101,0,4],
+"de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe":[10,0,16,1,4],
+"de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9":[9,0,101,0,5],
+"de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9":[10,0,16,1,5],
+"de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd":[9,0,101,0,3],
+"de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd":[10,0,16,1,3],
+"de/d0d/classrange__queries_1_1fenwick__tree.html#a5ea37183524553bbf2234a36a44a4b9a":[9,0,101,0,0],
+"de/d0d/classrange__queries_1_1fenwick__tree.html#a5ea37183524553bbf2234a36a44a4b9a":[10,0,16,1,0],
+"de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801":[9,0,101,0,2],
+"de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801":[10,0,16,1,2],
+"de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c":[9,0,101,0,1],
+"de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c":[10,0,16,1,1],
+"de/d0d/classrange__queries_1_1fenwick__tree.html#af7b7a8c1c5724ed8683d7e28bef526e6":[9,0,101,0,6],
+"de/d0d/classrange__queries_1_1fenwick__tree.html#af7b7a8c1c5724ed8683d7e28bef526e6":[10,0,16,1,6],
+"de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6":[9,0,101,0,7],
+"de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6":[10,0,16,1,7],
+"de/d0d/fibonacci__search_8cpp.html":[11,0,22,2],
+"de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61":[11,0,22,2,0],
+"de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f":[11,0,22,2,3],
+"de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d":[11,0,22,2,2],
+"de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,2,1],
+"de/d0d/fibonacci__search_8cpp_source.html":[11,0,22,2],
+"de/d1e/armstrong__number_8cpp_source.html":[11,0,14,3],
+"de/d21/classothers_1_1_cache_1_1_d___node.html":[9,0,88,0,0],
+"de/d21/classothers_1_1_cache_1_1_d___node.html":[10,0,13,0,0],
+"de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd":[9,0,88,0,0,1],
+"de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd":[10,0,13,0,0,1],
+"de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5":[9,0,88,0,0,2],
+"de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5":[10,0,13,0,0,2],
+"de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75":[9,0,88,0,0,0],
+"de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75":[10,0,13,0,0,0],
+"de/d23/disjoint__set_8cpp.html":[11,0,4,7],
+"de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec":[11,0,4,7,0],
+"de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985":[11,0,4,7,2],
+"de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8":[11,0,4,7,1],
+"de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757":[11,0,4,7,4],
+"de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,7,3],
+"de/d23/disjoint__set_8cpp_source.html":[11,0,4,7],
+"de/d33/circular__linked__list_8cpp.html":[11,0,16,2],
+"de/d33/circular__linked__list_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,2,4],
+"de/d33/circular__linked__list_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d":[11,0,16,2,7],
+"de/d33/circular__linked__list_8cpp.html#aa515639572647508b94986489aab6d76":[11,0,16,2,6],
+"de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,2,3],
+"de/d33/circular__linked__list_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669":[11,0,16,2,5],
+"de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,16,2,2],
+"de/d33/circular__linked__list_8cpp.html#af7b81d7a1534216af6a36a80135beb86":[11,0,16,2,8],
+"de/d33/circular__linked__list_8cpp_source.html":[11,0,16,2],
+"de/d36/namespacen__bonacci.html":[9,0,80],
+"de/d40/shell__sort_8cpp_source.html":[11,0,23,34],
+"de/d41/namespacekaratsuba__algorithm.html":[9,0,57],
+"de/d47/string__fibonacci_8cpp.html":[11,0,14,55],
+"de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35":[11,0,14,55,0],
+"de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca":[11,0,14,55,1],
+"de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,55,2],
+"de/d47/string__fibonacci_8cpp_source.html":[11,0,14,55],
+"de/d48/struct_trie_1_1_trie_node.html":[10,0,59,0],
+"de/d4a/class_compare.html":[10,0,25],
+"de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c":[10,0,25,0],
+"de/d5b/queue__using__linkedlist_8cpp_source.html":[11,0,4,20],
+"de/d6a/knuth__morris__pratt_8cpp.html":[11,0,24,4],
+"de/d6a/knuth__morris__pratt_8cpp.html#a1e37af2f023495129cb57338c801209e":[11,0,24,4,1],
+"de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,24,4,2],
+"de/d6a/knuth__morris__pratt_8cpp.html#a83c72ff237cdf623e42d4295e0029bf9":[11,0,24,4,0],
+"de/d6a/knuth__morris__pratt_8cpp_source.html":[11,0,24,4],
+"de/d6b/namespacerandom__pivot__quick__sort.html":[9,0,100],
+"de/d72/geometric__dist_8cpp.html":[11,0,19,4],
+"de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6":[11,0,19,4,3],
+"de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba":[11,0,19,4,1],
+"de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,19,4,4],
+"de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,19,4,2],
+"de/d72/geometric__dist_8cpp_source.html":[11,0,19,4],
+"de/d75/qr__eigen__values_8cpp.html":[11,0,15,20],
+"de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,15,20,6],
+"de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,15,20,5],
+"de/d75/qr__eigen__values_8cpp.html#a28e2fa3e803abaea6c568dc45d69d8cc":[11,0,15,20,2],
+"de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,15,20,3],
+"de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d":[11,0,15,20,1],
+"de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae":[11,0,15,20,4],
+"de/d75/qr__eigen__values_8cpp.html#aee57a411f07599034f5ceb8cc7d65b40":[11,0,15,20,0],
+"de/d75/qr__eigen__values_8cpp_source.html":[11,0,15,20],
+"de/d77/tree__height_8cpp_source.html":[11,0,6,28],
+"de/d79/graham__scan__algorithm_8cpp_source.html":[11,0,8,0],
+"de/d7b/merge__insertion__sort_8cpp.html":[11,0,23,18],
+"de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1":[11,0,23,18,0],
+"de/d7b/merge__insertion__sort_8cpp.html#a7161278f18e83b671c6454b139cc5674":[11,0,23,18,3],
+"de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,23,18,4],
+"de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,18,1],
+"de/d7b/merge__insertion__sort_8cpp.html#af4de4067a9a866ffd985c5b5055ccedf":[11,0,23,18,2],
+"de/d7b/merge__insertion__sort_8cpp_source.html":[11,0,23,18],
+"de/d83/namespaceis__graph__bipartite.html":[9,0,52],
+"de/d85/decimal__to__roman__numeral_8cpp.html":[11,0,17,3],
+"de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d":[11,0,17,3,2],
+"de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979":[11,0,17,3,3],
+"de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780":[11,0,17,3,0],
+"de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,3,1],
+"de/d85/decimal__to__roman__numeral_8cpp_source.html":[11,0,17,3],
+"de/d88/travelling__salesman__problem_8cpp.html":[11,0,9,20],
+"de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,9,20,1],
+"de/d88/travelling__salesman__problem_8cpp.html#ab7706341d006e20d1ae58274187a3346":[11,0,9,20,2],
+"de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,20,0],
+"de/d88/travelling__salesman__problem_8cpp_source.html":[11,0,9,20],
+"de/d89/graham__scan__functions_8hpp_source.html":[11,0,8,1],
+"de/d8c/partition__problem_8cpp_source.html":[11,0,6,23]
 };
diff --git a/navtreeindex13.js b/navtreeindex13.js
index 03bb9d885..27b03d92c 100644
--- a/navtreeindex13.js
+++ b/navtreeindex13.js
@@ -1,253 +1,253 @@
 var NAVTREEINDEX13 =
 {
-"dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a":[9,0,69,14],
-"dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b":[9,0,69,9],
-"dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb":[9,0,69,29],
-"dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0":[9,0,69,22],
-"dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec":[9,0,69,3],
-"dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f":[9,0,69,36],
-"dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14":[9,0,69,40],
-"dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c":[9,0,69,31],
-"dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049":[9,0,69,39],
-"dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f":[9,0,69,24],
-"dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb":[9,0,69,32],
-"dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca":[9,0,69,33],
-"dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf":[9,0,69,1],
-"dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc":[9,0,69,43],
-"dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656":[9,0,69,37],
-"dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c":[9,0,69,8],
-"dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444":[9,0,69,18],
-"dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca":[9,0,69,13],
-"dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188":[9,0,69,2],
-"dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5":[9,0,69,27],
-"dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864":[9,0,69,11],
-"dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4":[9,0,69,30],
-"dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953":[9,0,69,6],
-"dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea":[9,0,69,4],
-"dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725":[9,0,69,10],
-"dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11":[9,0,69,16],
-"dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a":[9,0,69,41],
-"dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f":[9,0,69,20],
-"dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d":[9,0,69,28],
-"dd/d4f/class_solution.html":[10,0,53],
-"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html":[9,0,123,0,0],
-"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html":[10,0,20,0,0],
-"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e":[9,0,123,0,0,1],
-"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e":[10,0,20,0,0,1],
-"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645":[9,0,123,0,0,0],
-"dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645":[10,0,20,0,0,0],
-"dd/d65/lu__decompose_8cpp.html":[11,0,15,11],
-"dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,15,11,3],
-"dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,15,11,2],
-"dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,15,11,0],
-"dd/d65/lu__decompose_8cpp.html#a575c989afcc78e875031cd4273e62a3e":[11,0,15,11,1],
-"dd/d69/namespacerange__queries.html":[9,0,101],
-"dd/d73/namespaceiterative__tree__traversals.html":[9,0,53],
-"dd/d74/namespaceinorder__successor__of__bst.html":[9,0,49],
-"dd/d81/namespacecaesar.html":[9,0,12],
-"dd/d89/insertion__sort__recursive_8cpp.html":[11,0,22,10],
-"dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,22,10,4],
-"dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49":[11,0,22,10,0],
-"dd/d89/insertion__sort__recursive_8cpp.html#a78cb2f3b97b6db2c062b2a1df05c9ea9":[11,0,22,10,2],
-"dd/d89/insertion__sort__recursive_8cpp.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f":[11,0,22,10,1],
-"dd/d89/insertion__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,10,3],
-"dd/d8a/namespacegeometric__dist.html":[9,0,36],
-"dd/d92/memory__game_8cpp.html":[11,0,7,0],
-"dd/d92/memory__game_8cpp.html#a33167bb9cce6d527b478b4f6ae8c3f59":[11,0,7,0,3],
-"dd/d92/memory__game_8cpp.html#a370760f2b328ad341bcb77d82fa17b01":[11,0,7,0,5],
-"dd/d92/memory__game_8cpp.html#a3ceeea62d8fa6c563e2c66359fd73413":[11,0,7,0,1],
-"dd/d92/memory__game_8cpp.html#a5714d97649c0edd57b4fb449799676a3":[11,0,7,0,0],
-"dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6":[11,0,7,0,8],
-"dd/d92/memory__game_8cpp.html#ac589ef65abb0a6b9a7116ee0f9fd5280":[11,0,7,0,6],
-"dd/d92/memory__game_8cpp.html#ad573c8ae66ab66156d03e5e81bbba214":[11,0,7,0,2],
-"dd/d92/memory__game_8cpp.html#adc62ebb75853446656e24932bdc6dd6b":[11,0,7,0,7],
-"dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,7,0,4],
-"dd/d95/classdata__structures_1_1_segment_tree.html":[9,0,21,4],
-"dd/d95/classdata__structures_1_1_segment_tree.html":[10,0,2,11],
-"dd/d95/classdata__structures_1_1_segment_tree.html#a10ffa5fc03c66170f0bc2592b843baa3":[9,0,21,4,6],
-"dd/d95/classdata__structures_1_1_segment_tree.html#a10ffa5fc03c66170f0bc2592b843baa3":[10,0,2,11,6],
-"dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3":[9,0,21,4,7],
-"dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3":[10,0,2,11,7],
-"dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b":[9,0,21,4,3],
-"dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b":[10,0,2,11,3],
-"dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1":[9,0,21,4,4],
-"dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1":[10,0,2,11,4],
-"dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141":[9,0,21,4,1],
-"dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141":[10,0,2,11,1],
-"dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258":[9,0,21,4,8],
-"dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258":[10,0,2,11,8],
-"dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841":[9,0,21,4,0],
-"dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841":[10,0,2,11,0],
-"dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52":[9,0,21,4,2],
-"dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52":[10,0,2,11,2],
-"dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17":[9,0,21,4,5],
-"dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17":[10,0,2,11,5],
-"dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html":[9,0,42,1],
-"dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c":[9,0,42,1,0],
-"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html":[10,0,10,0,1],
-"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101":[10,0,10,0,1,14],
-"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a194c2973b51a5467fc17064a4ea4e6f9":[10,0,10,0,1,4],
-"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658":[10,0,10,0,1,6],
-"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b":[10,0,10,0,1,0],
-"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2":[10,0,10,0,1,13],
-"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e":[10,0,10,0,1,10],
-"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba":[10,0,10,0,1,11],
-"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3":[10,0,10,0,1,5],
-"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a9517e162e2988f7db052296bd550a742":[10,0,10,0,1,16],
-"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915":[10,0,10,0,1,15],
-"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420":[10,0,10,0,1,7],
-"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71":[10,0,10,0,1,17],
-"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2":[10,0,10,0,1,1],
-"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7":[10,0,10,0,1,2],
-"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99":[10,0,10,0,1,9],
-"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f":[10,0,10,0,1,8],
-"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9":[10,0,10,0,1,3],
-"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee":[10,0,10,0,1,12],
-"dd/da0/todo.html":[7],
-"dd/da8/pigeonhole__sort_8cpp.html":[11,0,22,15],
-"dd/da8/pigeonhole__sort_8cpp.html#a0e9e1b21a1684585e9e50f9afe4d53a3":[11,0,22,15,1],
-"dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817":[11,0,22,15,2],
-"dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d":[11,0,22,15,3],
-"dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,15,0],
-"dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a":[11,0,22,15,4],
-"dd/dae/namespacecount__of__set__bits.html":[9,0,16],
-"dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html":[12,4],
-"dd/db6/structbinary__search__tree_1_1bst__node.html":[10,0,21,0],
-"dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df":[10,0,21,0,2],
-"dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29":[10,0,21,0,3],
-"dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778":[10,0,21,0,0],
-"dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788":[10,0,21,0,1],
-"dd/dba/namespacedivide__and__conquer.html":[9,0,24],
-"dd/dca/class_f_c_f_s.html":[10,0,33],
-"dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69":[10,0,33,0],
-"dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91":[10,0,33,2],
-"dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793":[10,0,33,1],
-"dd/dca/class_f_c_f_s.html#af2594e22a867b308e027623940193d46":[10,0,33,3],
-"dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html":[10,0,13,4,0],
-"dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5":[10,0,13,4,0,2],
-"dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c":[10,0,13,4,0,1],
-"dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114":[10,0,13,4,0,0],
-"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html":[10,0,6,0,0],
-"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3":[10,0,6,0,0,0],
-"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b":[10,0,6,0,0,1],
-"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6":[10,0,6,0,0,5],
-"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ab0efcfa04fff8616aff0062522d1483f":[10,0,6,0,0,3],
-"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad475f8b838693812f7569a490729f373":[10,0,6,0,0,2],
-"de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef":[10,0,6,0,0,4],
-"de/d07/cycle__sort_8cpp.html":[11,0,22,5],
-"de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,5,2],
-"de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,5,1],
-"de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa":[11,0,22,5,0],
-"de/d0a/namespacemerge__insertion.html":[9,0,72],
-"de/d0d/classrange__queries_1_1fenwick__tree.html":[9,0,101,0],
-"de/d0d/classrange__queries_1_1fenwick__tree.html":[10,0,16,1],
-"de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe":[9,0,101,0,4],
-"de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe":[10,0,16,1,4],
-"de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9":[9,0,101,0,5],
-"de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9":[10,0,16,1,5],
-"de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd":[9,0,101,0,3],
-"de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd":[10,0,16,1,3],
-"de/d0d/classrange__queries_1_1fenwick__tree.html#a5ea37183524553bbf2234a36a44a4b9a":[9,0,101,0,0],
-"de/d0d/classrange__queries_1_1fenwick__tree.html#a5ea37183524553bbf2234a36a44a4b9a":[10,0,16,1,0],
-"de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801":[9,0,101,0,2],
-"de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801":[10,0,16,1,2],
-"de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c":[9,0,101,0,1],
-"de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c":[10,0,16,1,1],
-"de/d0d/classrange__queries_1_1fenwick__tree.html#af7b7a8c1c5724ed8683d7e28bef526e6":[9,0,101,0,6],
-"de/d0d/classrange__queries_1_1fenwick__tree.html#af7b7a8c1c5724ed8683d7e28bef526e6":[10,0,16,1,6],
-"de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6":[9,0,101,0,7],
-"de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6":[10,0,16,1,7],
-"de/d0d/fibonacci__search_8cpp.html":[11,0,21,1],
-"de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61":[11,0,21,1,0],
-"de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f":[11,0,21,1,3],
-"de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d":[11,0,21,1,2],
-"de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,1,1],
-"de/d21/classothers_1_1_cache_1_1_d___node.html":[9,0,88,0,0],
-"de/d21/classothers_1_1_cache_1_1_d___node.html":[10,0,13,0,0],
-"de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd":[9,0,88,0,0,1],
-"de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd":[10,0,13,0,0,1],
-"de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5":[9,0,88,0,0,2],
-"de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5":[10,0,13,0,0,2],
-"de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75":[9,0,88,0,0,0],
-"de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75":[10,0,13,0,0,0],
-"de/d23/disjoint__set_8cpp.html":[11,0,4,6],
-"de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec":[11,0,4,6,0],
-"de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985":[11,0,4,6,2],
-"de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8":[11,0,4,6,1],
-"de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757":[11,0,4,6,4],
-"de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,6,3],
-"de/d33/circular__linked__list_8cpp.html":[11,0,16,2],
-"de/d33/circular__linked__list_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,2,4],
-"de/d33/circular__linked__list_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d":[11,0,16,2,7],
-"de/d33/circular__linked__list_8cpp.html#aa515639572647508b94986489aab6d76":[11,0,16,2,6],
-"de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,2,3],
-"de/d33/circular__linked__list_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669":[11,0,16,2,5],
-"de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,16,2,2],
-"de/d33/circular__linked__list_8cpp.html#af7b81d7a1534216af6a36a80135beb86":[11,0,16,2,8],
-"de/d36/namespacen__bonacci.html":[9,0,80],
-"de/d41/namespacekaratsuba__algorithm.html":[9,0,57],
-"de/d47/string__fibonacci_8cpp.html":[11,0,14,53],
-"de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35":[11,0,14,53,0],
-"de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca":[11,0,14,53,1],
-"de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,53,2],
-"de/d48/struct_trie_1_1_trie_node.html":[10,0,59,0],
-"de/d4a/class_compare.html":[10,0,25],
-"de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c":[10,0,25,0],
-"de/d6a/knuth__morris__pratt_8cpp.html":[11,0,23,4],
-"de/d6a/knuth__morris__pratt_8cpp.html#a1e37af2f023495129cb57338c801209e":[11,0,23,4,1],
-"de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,23,4,2],
-"de/d6a/knuth__morris__pratt_8cpp.html#a83c72ff237cdf623e42d4295e0029bf9":[11,0,23,4,0],
-"de/d6b/namespacerandom__pivot__quick__sort.html":[9,0,100],
-"de/d72/geometric__dist_8cpp.html":[11,0,19,4],
-"de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6":[11,0,19,4,3],
-"de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba":[11,0,19,4,1],
-"de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,19,4,4],
-"de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,19,4,2],
-"de/d75/qr__eigen__values_8cpp.html":[11,0,15,20],
-"de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,15,20,6],
-"de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,15,20,5],
-"de/d75/qr__eigen__values_8cpp.html#a28e2fa3e803abaea6c568dc45d69d8cc":[11,0,15,20,2],
-"de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,15,20,3],
-"de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d":[11,0,15,20,1],
-"de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae":[11,0,15,20,4],
-"de/d75/qr__eigen__values_8cpp.html#aee57a411f07599034f5ceb8cc7d65b40":[11,0,15,20,0],
-"de/d7b/merge__insertion__sort_8cpp.html":[11,0,22,11],
-"de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1":[11,0,22,11,0],
-"de/d7b/merge__insertion__sort_8cpp.html#a7161278f18e83b671c6454b139cc5674":[11,0,22,11,3],
-"de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,11,4],
-"de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,11,1],
-"de/d7b/merge__insertion__sort_8cpp.html#af4de4067a9a866ffd985c5b5055ccedf":[11,0,22,11,2],
-"de/d83/namespaceis__graph__bipartite.html":[9,0,52],
-"de/d85/decimal__to__roman__numeral_8cpp.html":[11,0,17,3],
-"de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d":[11,0,17,3,2],
-"de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979":[11,0,17,3,3],
-"de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780":[11,0,17,3,0],
-"de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,3,1],
-"de/d88/travelling__salesman__problem_8cpp.html":[11,0,9,12],
-"de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,9,12,1],
-"de/d88/travelling__salesman__problem_8cpp.html#ab7706341d006e20d1ae58274187a3346":[11,0,9,12,2],
-"de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,12,0],
-"de/d89/graham__scan__functions_8hpp_source.html":[11,0,8,0],
-"de/d95/namespace_subsets.html":[9,0,127],
-"de/d97/namespacestd_1_1experimental.html":[9,0,118,1],
+"de/d95/namespace_subsets.html":[9,0,126],
 "de/d99/aliquot__sum_8cpp.html":[11,0,14,0],
 "de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,0,2],
 "de/d99/aliquot__sum_8cpp.html#ab37f3a7302a84179aae682c79d8390bf":[11,0,14,0,0],
 "de/d99/aliquot__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,0,1],
+"de/d99/aliquot__sum_8cpp_source.html":[11,0,14,0],
 "de/d9b/namespacegray__code.html":[9,0,41],
-"de/d9b/prime__numbers_8cpp.html":[11,0,14,47],
-"de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a":[11,0,14,47,1],
-"de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,47,0],
+"de/d9b/prime__numbers_8cpp.html":[11,0,14,49],
+"de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a":[11,0,14,49,1],
+"de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,49,0],
+"de/d9b/prime__numbers_8cpp_source.html":[11,0,14,49],
 "de/d9d/classdata__structures_1_1linked__list_1_1link.html":[10,0,2,0,0],
 "de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb":[10,0,2,0,0,0],
 "de/d9d/classdata__structures_1_1linked__list_1_1link.html#ac121ce37b6ea864b160ebcada0bce936":[10,0,2,0,0,4],
 "de/d9d/classdata__structures_1_1linked__list_1_1link.html#acf96f3a9a1d3b15268c38e8822300c11":[10,0,2,0,0,2],
 "de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3":[10,0,2,0,0,1],
 "de/d9d/classdata__structures_1_1linked__list_1_1link.html#af94c06f3220e5406245680f58b8e7081":[10,0,2,0,0,3],
-"de/dab/ncr__modulo__p_8cpp.html":[11,0,14,41],
-"de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,41,4],
-"de/dab/ncr__modulo__p_8cpp.html#a6c7bfe3bdaa086d32261a5c5584d0fa9":[11,0,14,41,3],
-"de/dab/ncr__modulo__p_8cpp.html#a9010ad5669d31449c3bf3271ab5ebc86":[11,0,14,41,2],
-"de/dab/ncr__modulo__p_8cpp.html#afa2b50f4716fc3b42221a72e676e1422":[11,0,14,41,1],
-"de/db3/namespaceatbash.html":[9,0,3]
+"de/dab/ncr__modulo__p_8cpp.html":[11,0,14,43],
+"de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,43,4],
+"de/dab/ncr__modulo__p_8cpp.html#a6c7bfe3bdaa086d32261a5c5584d0fa9":[11,0,14,43,3],
+"de/dab/ncr__modulo__p_8cpp.html#a9010ad5669d31449c3bf3271ab5ebc86":[11,0,14,43,2],
+"de/dab/ncr__modulo__p_8cpp.html#afa2b50f4716fc3b42221a72e676e1422":[11,0,14,43,1],
+"de/dab/ncr__modulo__p_8cpp_source.html":[11,0,14,43],
+"de/db3/namespaceatbash.html":[9,0,3],
+"de/db4/namespacedisjoint__union.html":[9,0,23],
+"de/db6/a1z26__cipher_8cpp.html":[11,0,2,0],
+"de/db6/a1z26__cipher_8cpp.html#a0a78954e96c862430904ee3e64623c38":[11,0,2,0,0],
+"de/db6/a1z26__cipher_8cpp.html#a77a6b827a0b9c7aca2d705811459d744":[11,0,2,0,1],
+"de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,2,0,3],
+"de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,0,2],
+"de/db6/a1z26__cipher_8cpp_source.html":[11,0,2,0],
+"de/dc3/binaryheap_8cpp.html":[11,0,4,4],
+"de/dc3/binaryheap_8cpp_source.html":[11,0,4,4],
+"de/dc3/fibonacci__sum_8cpp.html":[11,0,14,20],
+"de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742":[11,0,14,20,0],
+"de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311":[11,0,14,20,3],
+"de/dc3/fibonacci__sum_8cpp.html#a9c83cca09a3e4ff2a25c816a9303448e":[11,0,14,20,2],
+"de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,20,5],
+"de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa":[11,0,14,20,4],
+"de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,20,1],
+"de/dc3/fibonacci__sum_8cpp_source.html":[11,0,14,20],
+"de/dc5/intersection__of__two__arrays_8cpp.html":[11,0,16,6],
+"de/dc5/intersection__of__two__arrays_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,6,4],
+"de/dc5/intersection__of__two__arrays_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d":[11,0,16,6,7],
+"de/dc5/intersection__of__two__arrays_8cpp.html#a6109193567a5b7e36a27f2b4865fce20":[11,0,16,6,2],
+"de/dc5/intersection__of__two__arrays_8cpp.html#aa515639572647508b94986489aab6d76":[11,0,16,6,6],
+"de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,6,3],
+"de/dc5/intersection__of__two__arrays_8cpp.html#aacafde185abd8670abee51157f273dc2":[11,0,16,6,9],
+"de/dc5/intersection__of__two__arrays_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669":[11,0,16,6,5],
+"de/dc5/intersection__of__two__arrays_8cpp.html#adaf9a06f0c236c2d95c97e441ea2d12e":[11,0,16,6,0],
+"de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,16,6,1],
+"de/dc5/intersection__of__two__arrays_8cpp.html#af7b81d7a1534216af6a36a80135beb86":[11,0,16,6,8],
+"de/dc5/intersection__of__two__arrays_8cpp_source.html":[11,0,16,6],
+"de/dcd/kadanes3_8cpp.html":[11,0,17,8],
+"de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147":[11,0,17,8,1],
+"de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,17,8,2],
+"de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,8,0],
+"de/dcd/kadanes3_8cpp_source.html":[11,0,17,8],
+"de/dcf/binary__exponent_8cpp.html":[11,0,14,4],
+"de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f":[11,0,14,4,1],
+"de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,4,2],
+"de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73":[11,0,14,4,0],
+"de/dcf/binary__exponent_8cpp_source.html":[11,0,14,4],
+"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html":[10,0,12,2,0],
+"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c":[10,0,12,2,0,6],
+"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c":[10,0,12,2,0,3],
+"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d":[10,0,12,2,0,2],
+"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503":[10,0,12,2,0,5],
+"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb":[10,0,12,2,0,8],
+"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b":[10,0,12,2,0,1],
+"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56":[10,0,12,2,0,0],
+"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50":[10,0,12,2,0,4],
+"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1":[10,0,12,2,0,7],
+"de/dd1/segment__tree_8cpp.html":[11,0,4,24],
+"de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,4,24,2],
+"de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,24,1],
+"de/dd1/segment__tree_8cpp_source.html":[11,0,4,24],
+"de/dd3/namespace_s_h_a.html":[9,0,109],
+"de/dd3/newton__raphson__method_8cpp.html":[11,0,15,14],
+"de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d":[11,0,15,14,0],
+"de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386":[11,0,15,14,1],
+"de/dd3/newton__raphson__method_8cpp.html#a5c5ff05b9f37ae59dad67e1d4f6cd51d":[11,0,15,14,4],
+"de/dd3/newton__raphson__method_8cpp.html#a75f355966e0a97665eaf5a4c79baa7af":[11,0,15,14,3],
+"de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,14,2],
+"de/dd3/newton__raphson__method_8cpp_source.html":[11,0,15,14],
+"de/dd9/catalan__numbers_8cpp.html":[11,0,6,4],
+"de/dd9/catalan__numbers_8cpp_source.html":[11,0,6,4],
+"de/dde/lowest__common__ancestor_8cpp.html":[11,0,9,15],
+"de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,9,15,4],
+"de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,15,3],
+"de/dde/lowest__common__ancestor_8cpp_source.html":[11,0,9,15],
+"de/de4/fibonacci__large_8cpp.html":[11,0,14,18],
+"de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db":[11,0,14,18,0],
+"de/de4/fibonacci__large_8cpp_source.html":[11,0,14,18],
+"de/df6/classgreedy__algorithms_1_1_binary_addition.html":[9,0,42,2],
+"de/df6/classgreedy__algorithms_1_1_binary_addition.html":[10,0,7,1],
+"de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2":[9,0,42,2,1],
+"de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2":[10,0,7,1,1],
+"de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527":[9,0,42,2,0],
+"de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527":[10,0,7,1,0],
+"df/d06/decimal__to__binary_8cpp.html":[11,0,17,1],
+"df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7":[11,0,17,1,1],
+"df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11":[11,0,17,1,0],
+"df/d06/decimal__to__binary_8cpp_source.html":[11,0,17,1],
+"df/d10/namespacepancake__sort.html":[9,0,90],
+"df/d11/midpoint__integral__method_8cpp.html":[11,0,15,13],
+"df/d11/midpoint__integral__method_8cpp.html#a2ae48a41e43dc6ab11b962742349646e":[11,0,15,13,6],
+"df/d11/midpoint__integral__method_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,15,13,4],
+"df/d11/midpoint__integral__method_8cpp.html#a7072493d1f0f8a91b2a71d4cc456c09c":[11,0,15,13,5],
+"df/d11/midpoint__integral__method_8cpp.html#a7ee8e824ef3e138a9a21883b26d97226":[11,0,15,13,0],
+"df/d11/midpoint__integral__method_8cpp.html#ad53616fb4fa6880ae876bcba53365c51":[11,0,15,13,3],
+"df/d11/midpoint__integral__method_8cpp.html#ae682ee71af44b1e9e884849cc6a6b040":[11,0,15,13,1],
+"df/d11/midpoint__integral__method_8cpp.html#ae9f66040f8e0ba73c1c741261c22a52a":[11,0,15,13,2],
+"df/d11/midpoint__integral__method_8cpp_source.html":[11,0,15,13],
+"df/d14/bellman__ford_8cpp_source.html":[11,0,6,3],
+"df/d1c/namespacestack__using__queue.html":[9,0,116],
+"df/d28/dsu__union__rank_8cpp.html":[11,0,4,10],
+"df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae":[11,0,4,10,3],
+"df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,10,1],
+"df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243":[11,0,4,10,2],
+"df/d28/dsu__union__rank_8cpp_source.html":[11,0,4,10],
+"df/d2c/elliptic__curve__key__exchange_8cpp.html":[11,0,2,4],
+"df/d2c/elliptic__curve__key__exchange_8cpp.html#a17f3d667241b88115a95282cdd719cb2":[11,0,2,4,5],
+"df/d2c/elliptic__curve__key__exchange_8cpp.html#a37775d1724ffe404c088dabbc8da91ae":[11,0,2,4,8],
+"df/d2c/elliptic__curve__key__exchange_8cpp.html#a8800c8a84d77dadadb05ad5e83b77ef4":[11,0,2,4,7],
+"df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,2,4,6],
+"df/d2c/elliptic__curve__key__exchange_8cpp.html#ac00616a4e40d3cd5cfb4da87d9ff9af0":[11,0,2,4,3],
+"df/d2c/elliptic__curve__key__exchange_8cpp.html#acc5fe9c2032fb7582c38a20d1fa69bcf":[11,0,2,4,2],
+"df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,4,4],
+"df/d2c/elliptic__curve__key__exchange_8cpp.html#af0a6e3521629c25c2b5d620f26429830":[11,0,2,4,1],
+"df/d2c/elliptic__curve__key__exchange_8cpp_source.html":[11,0,2,4],
+"df/d31/floyd__warshall_8cpp_source.html":[11,0,6,11],
+"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html":[10,0,14,1,0],
+"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24":[10,0,14,1,0,5],
+"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20":[10,0,14,1,0,6],
+"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6":[10,0,14,1,0,3],
+"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7":[10,0,14,1,0,4],
+"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2":[10,0,14,1,0,8],
+"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d":[10,0,14,1,0,2],
+"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d":[10,0,14,1,0,0],
+"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de":[10,0,14,1,0,7],
+"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750":[10,0,14,1,0,9],
+"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e":[10,0,14,1,0,1],
+"df/d39/interpolation__search2_8cpp.html":[11,0,22,6],
+"df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629":[11,0,22,6,0],
+"df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,6,1],
+"df/d39/interpolation__search2_8cpp_source.html":[11,0,22,6],
+"df/d42/binary__search__tree2_8cpp.html":[11,0,4,3],
+"df/d42/binary__search__tree2_8cpp.html#a06f35064850e891d6fda0093c0d9ee6e":[11,0,4,3,5],
+"df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3":[11,0,4,3,2],
+"df/d42/binary__search__tree2_8cpp.html#a8c882f43e1e52948a7841a8bfb091350":[11,0,4,3,8],
+"df/d42/binary__search__tree2_8cpp.html#a94b76f781fcbe1ad0e3397ace6bb1965":[11,0,4,3,6],
+"df/d42/binary__search__tree2_8cpp.html#a9856b68e2cba50d2e26a1cbe374e0365":[11,0,4,3,3],
+"df/d42/binary__search__tree2_8cpp.html#ab00b8d0f21aeb5fbddb6decf3bcb640a":[11,0,4,3,7],
+"df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e":[11,0,4,3,9],
+"df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4":[11,0,4,3,4],
+"df/d42/binary__search__tree2_8cpp_source.html":[11,0,4,3],
+"df/d44/namespacen__queens__all__solutions.html":[9,0,82],
+"df/d47/fcfs__scheduling_8cpp.html":[11,0,3,0],
+"df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec":[11,0,3,0,4],
+"df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86":[11,0,3,0,2],
+"df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,3,0,5],
+"df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,3,0,3],
+"df/d47/fcfs__scheduling_8cpp_source.html":[11,0,3,0],
+"df/d47/stack_8hpp.html":[11,0,4,27],
+"df/d47/stack_8hpp_source.html":[11,0,4,27],
+"df/d4a/namespaceselection__sort__recursive.html":[9,0,107],
+"df/d66/vector__cross__product_8cpp.html":[11,0,14,58],
+"df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9":[11,0,14,58,0],
+"df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8":[11,0,14,58,1],
+"df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,58,3],
+"df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,58,2],
+"df/d66/vector__cross__product_8cpp_source.html":[11,0,14,58],
+"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html":[9,0,13,0],
+"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#a17f3d667241b88115a95282cdd719cb2":[9,0,13,0,4],
+"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0":[9,0,13,0,3],
+"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf":[9,0,13,0,2],
+"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#af0a6e3521629c25c2b5d620f26429830":[9,0,13,0,1],
+"df/d72/modular__division_8cpp.html":[11,0,14,37],
+"df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,14,37,0],
+"df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179":[11,0,14,37,2],
+"df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7":[11,0,14,37,1],
+"df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,37,3],
+"df/d72/modular__division_8cpp_source.html":[11,0,14,37],
+"df/d74/namespacesubarray__sum.html":[9,0,123],
+"df/d76/namespacefibonacci.html":[9,0,31],
+"df/d82/breadth__first__search_8cpp.html":[11,0,9,1],
+"df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,9,1,2],
+"df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,1,1],
+"df/d82/breadth__first__search_8cpp_source.html":[11,0,9,1],
+"df/d88/namespacedp.html":[9,0,27],
+"df/d8e/namespacetrie__operations.html":[9,0,132],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html":[9,0,88,0,1],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html":[10,0,13,0,1],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9":[9,0,88,0,1,5],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9":[10,0,13,0,1,5],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5":[9,0,88,0,1,10],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5":[10,0,13,0,1,10],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781":[9,0,88,0,1,4],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781":[10,0,13,0,1,4],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0":[9,0,88,0,1,3],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0":[10,0,13,0,1,3],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285":[9,0,88,0,1,12],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285":[10,0,13,0,1,12],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a8857531ecc8ed2e36868e267148eff36":[9,0,88,0,1,1],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a8857531ecc8ed2e36868e267148eff36":[10,0,13,0,1,1],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69":[9,0,88,0,1,6],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69":[10,0,13,0,1,6],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2":[9,0,88,0,1,11],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2":[10,0,13,0,1,11],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c":[9,0,88,0,1,2],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c":[10,0,13,0,1,2],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35":[9,0,88,0,1,13],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35":[10,0,13,0,1,13],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047":[9,0,88,0,1,7],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047":[10,0,13,0,1,7],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195":[9,0,88,0,1,9],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195":[10,0,13,0,1,9],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e":[9,0,88,0,1,8],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e":[10,0,13,0,1,8],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#affd7776c246caa2d0f92fd8616f6e5dc":[9,0,88,0,1,0],
+"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#affd7776c246caa2d0f92fd8616f6e5dc":[10,0,13,0,1,0],
+"df/d94/subarray__sum_8cpp.html":[11,0,0,9],
+"df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,9,2],
+"df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,9,0],
+"df/d94/subarray__sum_8cpp.html#af5687bbd9faf927fbd363c71e0baba5e":[11,0,0,9,1],
+"df/d94/subarray__sum_8cpp_source.html":[11,0,0,9],
+"df/d97/main__cll_8cpp_source.html":[11,0,4,0,2],
+"df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html":[10,0,19,5],
+"df/da7/queue__using__array2_8cpp_source.html":[11,0,4,18],
+"df/dc8/successive__approximation_8cpp.html":[11,0,15,22],
+"df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389":[11,0,15,22,0],
+"df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,22,2],
+"df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456":[11,0,15,22,1],
+"df/dc8/successive__approximation_8cpp_source.html":[11,0,15,22],
+"df/dcb/namespacestrings.html":[9,0,122],
+"df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html":[12,2],
+"df/dce/namespacegraph.html":[9,0,39],
+"df/dce/namespacegraph.html#a0e30e0dca68cb6e4f671440819b35b6a":[9,0,39,6],
+"df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8":[9,0,39,10],
+"df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463":[9,0,39,11],
+"df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b":[9,0,39,12],
+"df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b":[9,0,39,13],
+"df/dce/namespacegraph.html#a8e1b547cd407c0774e63f0dc95cda9e7":[9,0,39,7],
+"df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2":[9,0,39,4],
+"df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae":[9,0,39,8],
+"df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346":[9,0,39,14],
+"df/dce/namespacegraph.html#ad4016cfc80485a43748895a2c26c7d08":[9,0,39,5],
+"df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84":[9,0,39,9],
+"df/dd0/queue__using__two__stacks_8cpp.html":[11,0,4,21]
 };
diff --git a/navtreeindex14.js b/navtreeindex14.js
index 07006f97b..0316a5403 100644
--- a/navtreeindex14.js
+++ b/navtreeindex14.js
@@ -1,213 +1,16 @@
 var NAVTREEINDEX14 =
 {
-"de/db4/namespacedisjoint__union.html":[9,0,23],
-"de/db6/a1z26__cipher_8cpp.html":[11,0,2,0],
-"de/db6/a1z26__cipher_8cpp.html#a0a78954e96c862430904ee3e64623c38":[11,0,2,0,0],
-"de/db6/a1z26__cipher_8cpp.html#a77a6b827a0b9c7aca2d705811459d744":[11,0,2,0,1],
-"de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,2,0,3],
-"de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,0,2],
-"de/dc3/binaryheap_8cpp.html":[11,0,4,4],
-"de/dc3/fibonacci__sum_8cpp.html":[11,0,14,19],
-"de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742":[11,0,14,19,0],
-"de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311":[11,0,14,19,3],
-"de/dc3/fibonacci__sum_8cpp.html#a9c83cca09a3e4ff2a25c816a9303448e":[11,0,14,19,2],
-"de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,19,5],
-"de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa":[11,0,14,19,4],
-"de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,19,1],
-"de/dc5/intersection__of__two__arrays_8cpp.html":[11,0,16,4],
-"de/dc5/intersection__of__two__arrays_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,4,4],
-"de/dc5/intersection__of__two__arrays_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d":[11,0,16,4,7],
-"de/dc5/intersection__of__two__arrays_8cpp.html#a6109193567a5b7e36a27f2b4865fce20":[11,0,16,4,2],
-"de/dc5/intersection__of__two__arrays_8cpp.html#aa515639572647508b94986489aab6d76":[11,0,16,4,6],
-"de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,4,3],
-"de/dc5/intersection__of__two__arrays_8cpp.html#aacafde185abd8670abee51157f273dc2":[11,0,16,4,9],
-"de/dc5/intersection__of__two__arrays_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669":[11,0,16,4,5],
-"de/dc5/intersection__of__two__arrays_8cpp.html#adaf9a06f0c236c2d95c97e441ea2d12e":[11,0,16,4,0],
-"de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,16,4,1],
-"de/dc5/intersection__of__two__arrays_8cpp.html#af7b81d7a1534216af6a36a80135beb86":[11,0,16,4,8],
-"de/dcd/kadanes3_8cpp.html":[11,0,17,7],
-"de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147":[11,0,17,7,1],
-"de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,17,7,2],
-"de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,7,0],
-"de/dcf/binary__exponent_8cpp.html":[11,0,14,3],
-"de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f":[11,0,14,3,1],
-"de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,3,2],
-"de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73":[11,0,14,3,0],
-"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html":[10,0,12,2,0],
-"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c":[10,0,12,2,0,6],
-"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c":[10,0,12,2,0,3],
-"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d":[10,0,12,2,0,2],
-"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503":[10,0,12,2,0,5],
-"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb":[10,0,12,2,0,8],
-"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b":[10,0,12,2,0,1],
-"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56":[10,0,12,2,0,0],
-"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50":[10,0,12,2,0,4],
-"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1":[10,0,12,2,0,7],
-"de/dd1/segment__tree_8cpp.html":[11,0,4,17],
-"de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,4,17,2],
-"de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,17,1],
-"de/dd3/namespace_s_h_a.html":[9,0,109],
-"de/dd3/newton__raphson__method_8cpp.html":[11,0,15,14],
-"de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d":[11,0,15,14,0],
-"de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386":[11,0,15,14,1],
-"de/dd3/newton__raphson__method_8cpp.html#a5c5ff05b9f37ae59dad67e1d4f6cd51d":[11,0,15,14,4],
-"de/dd3/newton__raphson__method_8cpp.html#a75f355966e0a97665eaf5a4c79baa7af":[11,0,15,14,3],
-"de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,14,2],
-"de/dd9/catalan__numbers_8cpp.html":[11,0,6,3],
-"de/dde/lowest__common__ancestor_8cpp.html":[11,0,9,10],
-"de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,9,10,4],
-"de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,10,3],
-"de/de4/fibonacci__large_8cpp.html":[11,0,14,17],
-"de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db":[11,0,14,17,0],
-"de/df6/classgreedy__algorithms_1_1_binary_addition.html":[9,0,42,2],
-"de/df6/classgreedy__algorithms_1_1_binary_addition.html":[10,0,7,1],
-"de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2":[9,0,42,2,1],
-"de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2":[10,0,7,1,1],
-"de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527":[9,0,42,2,0],
-"de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527":[10,0,7,1,0],
-"df/d06/decimal__to__binary_8cpp.html":[11,0,17,1],
-"df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7":[11,0,17,1,1],
-"df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11":[11,0,17,1,0],
-"df/d10/namespacepancake__sort.html":[9,0,90],
-"df/d11/midpoint__integral__method_8cpp.html":[11,0,15,13],
-"df/d11/midpoint__integral__method_8cpp.html#a2ae48a41e43dc6ab11b962742349646e":[11,0,15,13,6],
-"df/d11/midpoint__integral__method_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,15,13,4],
-"df/d11/midpoint__integral__method_8cpp.html#a7072493d1f0f8a91b2a71d4cc456c09c":[11,0,15,13,5],
-"df/d11/midpoint__integral__method_8cpp.html#a7ee8e824ef3e138a9a21883b26d97226":[11,0,15,13,0],
-"df/d11/midpoint__integral__method_8cpp.html#ad53616fb4fa6880ae876bcba53365c51":[11,0,15,13,3],
-"df/d11/midpoint__integral__method_8cpp.html#ae682ee71af44b1e9e884849cc6a6b040":[11,0,15,13,1],
-"df/d11/midpoint__integral__method_8cpp.html#ae9f66040f8e0ba73c1c741261c22a52a":[11,0,15,13,2],
-"df/d1c/namespacestack__using__queue.html":[9,0,116],
-"df/d28/dsu__union__rank_8cpp.html":[11,0,4,8],
-"df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae":[11,0,4,8,3],
-"df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,8,1],
-"df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243":[11,0,4,8,2],
-"df/d2c/elliptic__curve__key__exchange_8cpp.html":[11,0,2,3],
-"df/d2c/elliptic__curve__key__exchange_8cpp.html#a17f3d667241b88115a95282cdd719cb2":[11,0,2,3,5],
-"df/d2c/elliptic__curve__key__exchange_8cpp.html#a37775d1724ffe404c088dabbc8da91ae":[11,0,2,3,8],
-"df/d2c/elliptic__curve__key__exchange_8cpp.html#a8800c8a84d77dadadb05ad5e83b77ef4":[11,0,2,3,7],
-"df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,2,3,6],
-"df/d2c/elliptic__curve__key__exchange_8cpp.html#ac00616a4e40d3cd5cfb4da87d9ff9af0":[11,0,2,3,3],
-"df/d2c/elliptic__curve__key__exchange_8cpp.html#acc5fe9c2032fb7582c38a20d1fa69bcf":[11,0,2,3,2],
-"df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,3,4],
-"df/d2c/elliptic__curve__key__exchange_8cpp.html#af0a6e3521629c25c2b5d620f26429830":[11,0,2,3,1],
-"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html":[10,0,14,1,0],
-"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24":[10,0,14,1,0,5],
-"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20":[10,0,14,1,0,6],
-"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6":[10,0,14,1,0,3],
-"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7":[10,0,14,1,0,4],
-"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2":[10,0,14,1,0,8],
-"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d":[10,0,14,1,0,2],
-"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d":[10,0,14,1,0,0],
-"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de":[10,0,14,1,0,7],
-"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750":[10,0,14,1,0,9],
-"df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e":[10,0,14,1,0,1],
-"df/d39/interpolation__search2_8cpp.html":[11,0,21,4],
-"df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629":[11,0,21,4,0],
-"df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,4,1],
-"df/d42/binary__search__tree2_8cpp.html":[11,0,4,3],
-"df/d42/binary__search__tree2_8cpp.html#a06f35064850e891d6fda0093c0d9ee6e":[11,0,4,3,5],
-"df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3":[11,0,4,3,2],
-"df/d42/binary__search__tree2_8cpp.html#a8c882f43e1e52948a7841a8bfb091350":[11,0,4,3,8],
-"df/d42/binary__search__tree2_8cpp.html#a94b76f781fcbe1ad0e3397ace6bb1965":[11,0,4,3,6],
-"df/d42/binary__search__tree2_8cpp.html#a9856b68e2cba50d2e26a1cbe374e0365":[11,0,4,3,3],
-"df/d42/binary__search__tree2_8cpp.html#ab00b8d0f21aeb5fbddb6decf3bcb640a":[11,0,4,3,7],
-"df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e":[11,0,4,3,9],
-"df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4":[11,0,4,3,4],
-"df/d44/namespacen__queens__all__solutions.html":[9,0,82],
-"df/d47/fcfs__scheduling_8cpp.html":[11,0,3,0],
-"df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec":[11,0,3,0,4],
-"df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86":[11,0,3,0,2],
-"df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,3,0,5],
-"df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,3,0,3],
-"df/d47/stack_8hpp.html":[11,0,4,20],
-"df/d47/stack_8hpp_source.html":[11,0,4,20],
-"df/d4a/namespaceselection__sort__recursive.html":[9,0,107],
-"df/d66/vector__cross__product_8cpp.html":[11,0,14,56],
-"df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9":[11,0,14,56,0],
-"df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8":[11,0,14,56,1],
-"df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,56,3],
-"df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,56,2],
-"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html":[9,0,13,0],
-"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#a17f3d667241b88115a95282cdd719cb2":[9,0,13,0,4],
-"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0":[9,0,13,0,3],
-"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf":[9,0,13,0,2],
-"df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#af0a6e3521629c25c2b5d620f26429830":[9,0,13,0,1],
-"df/d72/modular__division_8cpp.html":[11,0,14,35],
-"df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,14,35,0],
-"df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179":[11,0,14,35,2],
-"df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7":[11,0,14,35,1],
-"df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,35,3],
-"df/d74/namespacesubarray__sum.html":[9,0,124],
-"df/d76/namespacefibonacci.html":[9,0,31],
-"df/d82/breadth__first__search_8cpp.html":[11,0,9,1],
-"df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,9,1,2],
-"df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,1,1],
-"df/d88/namespacedp.html":[9,0,27],
-"df/d8e/namespacetrie__operations.html":[9,0,133],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html":[9,0,88,0,1],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html":[10,0,13,0,1],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9":[9,0,88,0,1,5],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9":[10,0,13,0,1,5],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5":[9,0,88,0,1,10],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5":[10,0,13,0,1,10],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781":[9,0,88,0,1,4],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781":[10,0,13,0,1,4],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0":[9,0,88,0,1,3],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0":[10,0,13,0,1,3],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285":[9,0,88,0,1,12],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285":[10,0,13,0,1,12],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a8857531ecc8ed2e36868e267148eff36":[9,0,88,0,1,1],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a8857531ecc8ed2e36868e267148eff36":[10,0,13,0,1,1],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69":[9,0,88,0,1,6],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69":[10,0,13,0,1,6],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2":[9,0,88,0,1,11],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2":[10,0,13,0,1,11],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c":[9,0,88,0,1,2],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c":[10,0,13,0,1,2],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35":[9,0,88,0,1,13],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35":[10,0,13,0,1,13],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047":[9,0,88,0,1,7],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047":[10,0,13,0,1,7],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195":[9,0,88,0,1,9],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195":[10,0,13,0,1,9],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e":[9,0,88,0,1,8],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e":[10,0,13,0,1,8],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#affd7776c246caa2d0f92fd8616f6e5dc":[9,0,88,0,1,0],
-"df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#affd7776c246caa2d0f92fd8616f6e5dc":[10,0,13,0,1,0],
-"df/d94/subarray__sum_8cpp.html":[11,0,0,8],
-"df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,8,2],
-"df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,8,0],
-"df/d94/subarray__sum_8cpp.html#af5687bbd9faf927fbd363c71e0baba5e":[11,0,0,8,1],
-"df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html":[9,0,118,10],
-"df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html":[10,0,19,5],
-"df/dc8/successive__approximation_8cpp.html":[11,0,15,22],
-"df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389":[11,0,15,22,0],
-"df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,22,2],
-"df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456":[11,0,15,22,1],
-"df/dcb/namespacestrings.html":[9,0,123],
-"df/dcd/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2quadratic_equations_complex_numbers_8cpp-example.html":[12,2],
-"df/dce/namespacegraph.html":[9,0,39],
-"df/dce/namespacegraph.html#a0e30e0dca68cb6e4f671440819b35b6a":[9,0,39,6],
-"df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8":[9,0,39,10],
-"df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463":[9,0,39,11],
-"df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b":[9,0,39,12],
-"df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b":[9,0,39,13],
-"df/dce/namespacegraph.html#a8e1b547cd407c0774e63f0dc95cda9e7":[9,0,39,7],
-"df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2":[9,0,39,4],
-"df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae":[9,0,39,8],
-"df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346":[9,0,39,14],
-"df/dce/namespacegraph.html#ad4016cfc80485a43748895a2c26c7d08":[9,0,39,5],
-"df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84":[9,0,39,9],
-"df/dd0/queue__using__two__stacks_8cpp.html":[11,0,4,15],
-"df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863":[11,0,4,15,1],
-"df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,15,0],
-"df/ddd/connected__components_8cpp.html":[11,0,9,2],
-"df/ddd/connected__components_8cpp.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8":[11,0,9,2,1],
-"df/ddd/connected__components_8cpp.html#a83ab16e96cec644109a58dfc9329bc2b":[11,0,9,2,2],
-"df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,9,2,4],
-"df/ddd/connected__components_8cpp.html#a9125ceb66bfbec3093bba64c2c1e99e2":[11,0,9,2,0],
-"df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,2,3],
+"df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863":[11,0,4,21,1],
+"df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,21,0],
+"df/dd0/queue__using__two__stacks_8cpp_source.html":[11,0,4,21],
+"df/dd5/binary__search_8cpp_source.html":[11,0,22,0],
+"df/ddd/connected__components_8cpp.html":[11,0,9,3],
+"df/ddd/connected__components_8cpp.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8":[11,0,9,3,1],
+"df/ddd/connected__components_8cpp.html#a83ab16e96cec644109a58dfc9329bc2b":[11,0,9,3,2],
+"df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,9,3,4],
+"df/ddd/connected__components_8cpp.html#a9125ceb66bfbec3093bba64c2c1e99e2":[11,0,9,3,0],
+"df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,3,3],
+"df/ddd/connected__components_8cpp_source.html":[11,0,9,3],
 "df/de5/classbacktracking_1_1generate__parentheses.html":[9,0,5,0],
 "df/de5/classbacktracking_1_1generate__parentheses.html":[10,0,0,0],
 "df/de5/classbacktracking_1_1generate__parentheses.html#ab35b9b6d2886abed3d6fb05c2be1c508":[9,0,5,0,2],
@@ -217,37 +20,205 @@ var NAVTREEINDEX14 =
 "df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160":[9,0,5,0,0],
 "df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160":[10,0,0,0,0],
 "df/dea/namespacefalse__position.html":[9,0,30],
-"df/def/power__for__huge__numbers_8cpp.html":[11,0,14,44],
-"df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326":[11,0,14,44,0],
-"df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9":[11,0,14,44,2],
-"df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f":[11,0,14,44,3],
-"df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,44,1],
-"df/dfb/minimax_8cpp.html":[11,0,0,3],
-"df/dfb/minimax_8cpp.html#a78540bcb5ef3473b2348cbc34748ec50":[11,0,0,3,1],
-"df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,3,0],
+"df/def/power__for__huge__numbers_8cpp.html":[11,0,14,46],
+"df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326":[11,0,14,46,0],
+"df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9":[11,0,14,46,2],
+"df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f":[11,0,14,46,3],
+"df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,46,1],
+"df/def/power__for__huge__numbers_8cpp_source.html":[11,0,14,46],
+"df/dfb/minimax_8cpp.html":[11,0,0,4],
+"df/dfb/minimax_8cpp.html#a78540bcb5ef3473b2348cbc34748ec50":[11,0,0,4,1],
+"df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,4,0],
+"df/dfb/minimax_8cpp_source.html":[11,0,0,4],
 "dir_074119ce3a874b57120c49a0cc4bb5ad.html":[11,0,20],
 "dir_0eaa691bd54ab0922ca7f50599de6d22.html":[11,0,11],
 "dir_12552d7fa429bf94a2e32e5cf39f7e69.html":[11,0,9],
-"dir_19b2bf9199a15c634a08b1ede1dd896a.html":[11,0,21],
+"dir_19b2bf9199a15c634a08b1ede1dd896a.html":[11,0,22],
 "dir_296d53ceaeaa7e099814a6def439fe8a.html":[11,0,14],
 "dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html":[11,0,4],
 "dir_3343723ae086de42ee4ca9774da3a13f.html":[11,0,13],
 "dir_35422be6552f1b3672c1b6c4aba2da64.html":[11,0,16],
 "dir_4b6f782e158b0b98da980a0e11a23a15.html":[11,0,7],
 "dir_4d6e05837bf820fb089a8a8cdf2f42b7.html":[11,0,2],
+"dir_53e6fa9553ac22a5646d2a2b2d7b97a1.html":[11,0,21],
 "dir_59dc24c326e2a72d1164f014b22de83d.html":[11,0,18],
-"dir_73a3cc5065b223eb41b02873c0e19f0e.html":[11,0,23],
+"dir_73a3cc5065b223eb41b02873c0e19f0e.html":[11,0,24],
 "dir_82e494173a87936756866de2fa774307.html":[11,0,19],
 "dir_8a20dd5bfd5341a725342bf72b6b686f.html":[11,0,6],
 "dir_93bc990c5cceb745f78af6949e9ef947.html":[11,0,5],
 "dir_9510827d0b234b3cc54b29892f217477.html":[11,0,17],
 "dir_9c6faab82c22511b50177aa2e38e2780.html":[11,0,15],
-"dir_bb1b521853a9c46347182a9d10420771.html":[11,0,22],
+"dir_bb1b521853a9c46347182a9d10420771.html":[11,0,23],
 "dir_c11585dfcef32a26e29098facab6c144.html":[11,0,0],
 "dir_cc8e79ed9d2b7756c78e8d0c87c6c0c7.html":[11,0,3],
 "dir_e3380d2178455503f266746fb14246a5.html":[11,0,8],
 "dir_e79632891301b850df87e9c0030293fa.html":[11,0,10],
 "dir_ece9b94c107bbaa1dd68197a8c9983b9.html":[11,0,12],
 "dir_f1797d0c2a0a12033e7d74efffeb14e1.html":[11,0,4,0],
-"dir_f3c4fbc4e901afa0a54d0623c5574aa7.html":[11,0,1]
+"dir_f3c4fbc4e901afa0a54d0623c5574aa7.html":[11,0,1],
+"examples.html":[12],
+"files.html":[11,0],
+"functions.html":[10,3,0],
+"functions.html":[10,3,0,0],
+"functions_a.html":[10,3,0,1],
+"functions_b.html":[10,3,0,2],
+"functions_c.html":[10,3,0,3],
+"functions_d.html":[10,3,0,4],
+"functions_e.html":[10,3,0,5],
+"functions_f.html":[10,3,0,6],
+"functions_func.html":[10,3,1],
+"functions_func.html":[10,3,1,0],
+"functions_func_a.html":[10,3,1,1],
+"functions_func_b.html":[10,3,1,2],
+"functions_func_c.html":[10,3,1,3],
+"functions_func_d.html":[10,3,1,4],
+"functions_func_e.html":[10,3,1,5],
+"functions_func_f.html":[10,3,1,6],
+"functions_func_g.html":[10,3,1,7],
+"functions_func_h.html":[10,3,1,8],
+"functions_func_i.html":[10,3,1,9],
+"functions_func_k.html":[10,3,1,10],
+"functions_func_l.html":[10,3,1,11],
+"functions_func_m.html":[10,3,1,12],
+"functions_func_n.html":[10,3,1,13],
+"functions_func_o.html":[10,3,1,14],
+"functions_func_p.html":[10,3,1,15],
+"functions_func_q.html":[10,3,1,16],
+"functions_func_r.html":[10,3,1,17],
+"functions_func_s.html":[10,3,1,18],
+"functions_func_t.html":[10,3,1,19],
+"functions_func_u.html":[10,3,1,20],
+"functions_func_v.html":[10,3,1,21],
+"functions_func_w.html":[10,3,1,22],
+"functions_func_~.html":[10,3,1,23],
+"functions_g.html":[10,3,0,7],
+"functions_h.html":[10,3,0,8],
+"functions_i.html":[10,3,0,9],
+"functions_k.html":[10,3,0,10],
+"functions_l.html":[10,3,0,11],
+"functions_m.html":[10,3,0,12],
+"functions_n.html":[10,3,0,13],
+"functions_o.html":[10,3,0,14],
+"functions_p.html":[10,3,0,15],
+"functions_q.html":[10,3,0,16],
+"functions_r.html":[10,3,0,17],
+"functions_rela.html":[10,3,4],
+"functions_s.html":[10,3,0,18],
+"functions_t.html":[10,3,0,19],
+"functions_type.html":[10,3,3],
+"functions_u.html":[10,3,0,20],
+"functions_v.html":[10,3,0,21],
+"functions_vars.html":[10,3,2],
+"functions_w.html":[10,3,0,22],
+"functions_x.html":[10,3,0,23],
+"functions_y.html":[10,3,0,24],
+"functions_~.html":[10,3,0,25],
+"globals.html":[11,1,0],
+"globals.html":[11,1,0,0],
+"globals_a.html":[11,1,0,1],
+"globals_b.html":[11,1,0,2],
+"globals_c.html":[11,1,0,3],
+"globals_d.html":[11,1,0,4],
+"globals_defs.html":[11,1,4],
+"globals_e.html":[11,1,0,5],
+"globals_f.html":[11,1,0,6],
+"globals_func.html":[11,1,1],
+"globals_func.html":[11,1,1,0],
+"globals_func_a.html":[11,1,1,1],
+"globals_func_b.html":[11,1,1,2],
+"globals_func_c.html":[11,1,1,3],
+"globals_func_d.html":[11,1,1,4],
+"globals_func_e.html":[11,1,1,5],
+"globals_func_f.html":[11,1,1,6],
+"globals_func_g.html":[11,1,1,7],
+"globals_func_h.html":[11,1,1,8],
+"globals_func_i.html":[11,1,1,9],
+"globals_func_j.html":[11,1,1,10],
+"globals_func_l.html":[11,1,1,11],
+"globals_func_m.html":[11,1,1,12],
+"globals_func_n.html":[11,1,1,13],
+"globals_func_o.html":[11,1,1,14],
+"globals_func_p.html":[11,1,1,15],
+"globals_func_q.html":[11,1,1,16],
+"globals_func_r.html":[11,1,1,17],
+"globals_func_s.html":[11,1,1,18],
+"globals_func_t.html":[11,1,1,19],
+"globals_func_u.html":[11,1,1,20],
+"globals_func_z.html":[11,1,1,21],
+"globals_g.html":[11,1,0,7],
+"globals_h.html":[11,1,0,8],
+"globals_i.html":[11,1,0,9],
+"globals_j.html":[11,1,0,10],
+"globals_l.html":[11,1,0,11],
+"globals_m.html":[11,1,0,12],
+"globals_n.html":[11,1,0,13],
+"globals_o.html":[11,1,0,14],
+"globals_p.html":[11,1,0,15],
+"globals_q.html":[11,1,0,16],
+"globals_r.html":[11,1,0,17],
+"globals_s.html":[11,1,0,18],
+"globals_t.html":[11,1,0,19],
+"globals_type.html":[11,1,3],
+"globals_u.html":[11,1,0,20],
+"globals_vars.html":[11,1,2],
+"globals_w.html":[11,1,0,21],
+"globals_z.html":[11,1,0,22],
+"hierarchy.html":[10,2],
+"index.html":[],
+"index.html":[0],
+"index.html#autotoc_md103":[0,0],
+"index.html#autotoc_md104":[0,1],
+"index.html#autotoc_md105":[0,2],
+"index.html#autotoc_md106":[0,3],
+"namespacemembers.html":[9,1,0],
+"namespacemembers.html":[9,1,0,0],
+"namespacemembers_b.html":[9,1,0,1],
+"namespacemembers_c.html":[9,1,0,2],
+"namespacemembers_d.html":[9,1,0,3],
+"namespacemembers_e.html":[9,1,0,4],
+"namespacemembers_f.html":[9,1,0,5],
+"namespacemembers_func.html":[9,1,1],
+"namespacemembers_func.html":[9,1,1,0],
+"namespacemembers_func_b.html":[9,1,1,1],
+"namespacemembers_func_c.html":[9,1,1,2],
+"namespacemembers_func_d.html":[9,1,1,3],
+"namespacemembers_func_e.html":[9,1,1,4],
+"namespacemembers_func_f.html":[9,1,1,5],
+"namespacemembers_func_g.html":[9,1,1,6],
+"namespacemembers_func_h.html":[9,1,1,7],
+"namespacemembers_func_i.html":[9,1,1,8],
+"namespacemembers_func_k.html":[9,1,1,9],
+"namespacemembers_func_l.html":[9,1,1,10],
+"namespacemembers_func_m.html":[9,1,1,11],
+"namespacemembers_func_n.html":[9,1,1,12],
+"namespacemembers_func_o.html":[9,1,1,13],
+"namespacemembers_func_p.html":[9,1,1,14],
+"namespacemembers_func_q.html":[9,1,1,15],
+"namespacemembers_func_r.html":[9,1,1,16],
+"namespacemembers_func_s.html":[9,1,1,17],
+"namespacemembers_func_t.html":[9,1,1,18],
+"namespacemembers_func_u.html":[9,1,1,19],
+"namespacemembers_func_v.html":[9,1,1,20],
+"namespacemembers_func_z.html":[9,1,1,21],
+"namespacemembers_g.html":[9,1,0,6],
+"namespacemembers_h.html":[9,1,0,7],
+"namespacemembers_i.html":[9,1,0,8],
+"namespacemembers_k.html":[9,1,0,9],
+"namespacemembers_l.html":[9,1,0,10],
+"namespacemembers_m.html":[9,1,0,11],
+"namespacemembers_n.html":[9,1,0,12],
+"namespacemembers_o.html":[9,1,0,13],
+"namespacemembers_p.html":[9,1,0,14],
+"namespacemembers_q.html":[9,1,0,15],
+"namespacemembers_r.html":[9,1,0,16],
+"namespacemembers_s.html":[9,1,0,17],
+"namespacemembers_t.html":[9,1,0,18],
+"namespacemembers_type.html":[9,1,3],
+"namespacemembers_u.html":[9,1,0,19],
+"namespacemembers_v.html":[9,1,0,20],
+"namespacemembers_vars.html":[9,1,2],
+"namespacemembers_z.html":[9,1,0,21],
+"namespaces.html":[9,0],
+"pages.html":[],
+"topics.html":[8]
 };
diff --git a/navtreeindex15.js b/navtreeindex15.js
deleted file mode 100644
index 65d612414..000000000
--- a/navtreeindex15.js
+++ /dev/null
@@ -1,168 +0,0 @@
-var NAVTREEINDEX15 =
-{
-"examples.html":[12],
-"files.html":[11,0],
-"functions.html":[10,3,0],
-"functions.html":[10,3,0,0],
-"functions_a.html":[10,3,0,1],
-"functions_b.html":[10,3,0,2],
-"functions_c.html":[10,3,0,3],
-"functions_d.html":[10,3,0,4],
-"functions_e.html":[10,3,0,5],
-"functions_f.html":[10,3,0,6],
-"functions_func.html":[10,3,1],
-"functions_func.html":[10,3,1,0],
-"functions_func_a.html":[10,3,1,1],
-"functions_func_b.html":[10,3,1,2],
-"functions_func_c.html":[10,3,1,3],
-"functions_func_d.html":[10,3,1,4],
-"functions_func_e.html":[10,3,1,5],
-"functions_func_f.html":[10,3,1,6],
-"functions_func_g.html":[10,3,1,7],
-"functions_func_h.html":[10,3,1,8],
-"functions_func_i.html":[10,3,1,9],
-"functions_func_k.html":[10,3,1,10],
-"functions_func_l.html":[10,3,1,11],
-"functions_func_m.html":[10,3,1,12],
-"functions_func_n.html":[10,3,1,13],
-"functions_func_o.html":[10,3,1,14],
-"functions_func_p.html":[10,3,1,15],
-"functions_func_q.html":[10,3,1,16],
-"functions_func_r.html":[10,3,1,17],
-"functions_func_s.html":[10,3,1,18],
-"functions_func_t.html":[10,3,1,19],
-"functions_func_u.html":[10,3,1,20],
-"functions_func_v.html":[10,3,1,21],
-"functions_func_w.html":[10,3,1,22],
-"functions_func_~.html":[10,3,1,23],
-"functions_g.html":[10,3,0,7],
-"functions_h.html":[10,3,0,8],
-"functions_i.html":[10,3,0,9],
-"functions_k.html":[10,3,0,10],
-"functions_l.html":[10,3,0,11],
-"functions_m.html":[10,3,0,12],
-"functions_n.html":[10,3,0,13],
-"functions_o.html":[10,3,0,14],
-"functions_p.html":[10,3,0,15],
-"functions_q.html":[10,3,0,16],
-"functions_r.html":[10,3,0,17],
-"functions_rela.html":[10,3,4],
-"functions_s.html":[10,3,0,18],
-"functions_t.html":[10,3,0,19],
-"functions_type.html":[10,3,3],
-"functions_u.html":[10,3,0,20],
-"functions_v.html":[10,3,0,21],
-"functions_vars.html":[10,3,2],
-"functions_w.html":[10,3,0,22],
-"functions_x.html":[10,3,0,23],
-"functions_y.html":[10,3,0,24],
-"functions_~.html":[10,3,0,25],
-"globals.html":[11,1,0],
-"globals.html":[11,1,0,0],
-"globals_a.html":[11,1,0,1],
-"globals_b.html":[11,1,0,2],
-"globals_c.html":[11,1,0,3],
-"globals_d.html":[11,1,0,4],
-"globals_defs.html":[11,1,4],
-"globals_e.html":[11,1,0,5],
-"globals_f.html":[11,1,0,6],
-"globals_func.html":[11,1,1],
-"globals_func.html":[11,1,1,0],
-"globals_func_a.html":[11,1,1,1],
-"globals_func_b.html":[11,1,1,2],
-"globals_func_c.html":[11,1,1,3],
-"globals_func_d.html":[11,1,1,4],
-"globals_func_e.html":[11,1,1,5],
-"globals_func_f.html":[11,1,1,6],
-"globals_func_g.html":[11,1,1,7],
-"globals_func_h.html":[11,1,1,8],
-"globals_func_i.html":[11,1,1,9],
-"globals_func_j.html":[11,1,1,10],
-"globals_func_l.html":[11,1,1,11],
-"globals_func_m.html":[11,1,1,12],
-"globals_func_n.html":[11,1,1,13],
-"globals_func_o.html":[11,1,1,14],
-"globals_func_p.html":[11,1,1,15],
-"globals_func_q.html":[11,1,1,16],
-"globals_func_r.html":[11,1,1,17],
-"globals_func_s.html":[11,1,1,18],
-"globals_func_t.html":[11,1,1,19],
-"globals_func_u.html":[11,1,1,20],
-"globals_func_z.html":[11,1,1,21],
-"globals_g.html":[11,1,0,7],
-"globals_h.html":[11,1,0,8],
-"globals_i.html":[11,1,0,9],
-"globals_j.html":[11,1,0,10],
-"globals_l.html":[11,1,0,11],
-"globals_m.html":[11,1,0,12],
-"globals_n.html":[11,1,0,13],
-"globals_o.html":[11,1,0,14],
-"globals_p.html":[11,1,0,15],
-"globals_q.html":[11,1,0,16],
-"globals_r.html":[11,1,0,17],
-"globals_s.html":[11,1,0,18],
-"globals_t.html":[11,1,0,19],
-"globals_type.html":[11,1,3],
-"globals_u.html":[11,1,0,20],
-"globals_vars.html":[11,1,2],
-"globals_w.html":[11,1,0,21],
-"globals_z.html":[11,1,0,22],
-"hierarchy.html":[10,2],
-"index.html":[],
-"index.html":[0],
-"index.html#autotoc_md103":[0,0],
-"index.html#autotoc_md104":[0,1],
-"index.html#autotoc_md105":[0,2],
-"index.html#autotoc_md106":[0,3],
-"namespacemembers.html":[9,1,0],
-"namespacemembers.html":[9,1,0,0],
-"namespacemembers_b.html":[9,1,0,1],
-"namespacemembers_c.html":[9,1,0,2],
-"namespacemembers_d.html":[9,1,0,3],
-"namespacemembers_e.html":[9,1,0,4],
-"namespacemembers_f.html":[9,1,0,5],
-"namespacemembers_func.html":[9,1,1],
-"namespacemembers_func.html":[9,1,1,0],
-"namespacemembers_func_b.html":[9,1,1,1],
-"namespacemembers_func_c.html":[9,1,1,2],
-"namespacemembers_func_d.html":[9,1,1,3],
-"namespacemembers_func_e.html":[9,1,1,4],
-"namespacemembers_func_f.html":[9,1,1,5],
-"namespacemembers_func_g.html":[9,1,1,6],
-"namespacemembers_func_h.html":[9,1,1,7],
-"namespacemembers_func_i.html":[9,1,1,8],
-"namespacemembers_func_k.html":[9,1,1,9],
-"namespacemembers_func_l.html":[9,1,1,10],
-"namespacemembers_func_m.html":[9,1,1,11],
-"namespacemembers_func_n.html":[9,1,1,12],
-"namespacemembers_func_o.html":[9,1,1,13],
-"namespacemembers_func_p.html":[9,1,1,14],
-"namespacemembers_func_q.html":[9,1,1,15],
-"namespacemembers_func_r.html":[9,1,1,16],
-"namespacemembers_func_s.html":[9,1,1,17],
-"namespacemembers_func_t.html":[9,1,1,18],
-"namespacemembers_func_u.html":[9,1,1,19],
-"namespacemembers_func_v.html":[9,1,1,20],
-"namespacemembers_func_z.html":[9,1,1,21],
-"namespacemembers_g.html":[9,1,0,6],
-"namespacemembers_h.html":[9,1,0,7],
-"namespacemembers_i.html":[9,1,0,8],
-"namespacemembers_k.html":[9,1,0,9],
-"namespacemembers_l.html":[9,1,0,10],
-"namespacemembers_m.html":[9,1,0,11],
-"namespacemembers_n.html":[9,1,0,12],
-"namespacemembers_o.html":[9,1,0,13],
-"namespacemembers_p.html":[9,1,0,14],
-"namespacemembers_q.html":[9,1,0,15],
-"namespacemembers_r.html":[9,1,0,16],
-"namespacemembers_s.html":[9,1,0,17],
-"namespacemembers_t.html":[9,1,0,18],
-"namespacemembers_type.html":[9,1,3],
-"namespacemembers_u.html":[9,1,0,19],
-"namespacemembers_v.html":[9,1,0,20],
-"namespacemembers_vars.html":[9,1,2],
-"namespacemembers_z.html":[9,1,0,21],
-"namespaces.html":[9,0],
-"pages.html":[],
-"topics.html":[8]
-};
diff --git a/navtreeindex2.js b/navtreeindex2.js
index 9721e8dee..bf0b62f19 100644
--- a/navtreeindex2.js
+++ b/navtreeindex2.js
@@ -1,253 +1,253 @@
 var NAVTREEINDEX2 =
 {
-"cpp/thread/lock.html":[9,0,118,247],
-"cpp/thread/notify_all_at_thread_exit.html":[9,0,118,307],
-"cpp/thread/sleep_for.html":[9,0,118,4,1],
-"cpp/thread/sleep_until.html":[9,0,118,4,2],
-"cpp/thread/try_lock.html":[9,0,118,463],
-"cpp/thread/yield.html":[9,0,118,4,3],
-"cpp/utility/declval.html":[9,0,118,94],
-"cpp/utility/forward.html":[9,0,118,149],
-"cpp/utility/functional/bind.html":[9,0,118,66],
-"cpp/utility/functional/mem_fn.html":[9,0,118,274],
-"cpp/utility/functional/not1.html":[9,0,118,305],
-"cpp/utility/functional/not2.html":[9,0,118,306],
-"cpp/utility/functional/ref.html":[9,0,118,88],
-"cpp/utility/functional/ref.html":[9,0,118,337],
-"cpp/utility/move.html":[9,0,118,288],
-"cpp/utility/move_if_noexcept.html":[9,0,118,290],
-"cpp/utility/pair/make_pair.html":[9,0,118,259],
-"cpp/utility/program/_Exit.html":[9,0,118,11],
-"cpp/utility/program/abort.html":[9,0,118,12],
-"cpp/utility/program/at_quick_exit.html":[9,0,118,30],
-"cpp/utility/program/atexit.html":[9,0,118,34],
-"cpp/utility/program/exit.html":[9,0,118,107],
-"cpp/utility/program/getenv.html":[9,0,118,183],
-"cpp/utility/program/longjmp.html":[9,0,118,252],
-"cpp/utility/program/quick_exit.html":[9,0,118,332],
-"cpp/utility/program/raise.html":[9,0,118,333],
-"cpp/utility/program/signal.html":[9,0,118,389],
-"cpp/utility/program/system.html":[9,0,118,443],
-"cpp/utility/rel_ops/operator_cmp.html":[9,0,118,3,0],
-"cpp/utility/rel_ops/operator_cmp.html":[9,0,118,3,1],
-"cpp/utility/rel_ops/operator_cmp.html":[9,0,118,3,2],
-"cpp/utility/rel_ops/operator_cmp.html":[9,0,118,3,3],
-"cpp/utility/tuple/forward_as_tuple.html":[9,0,118,150],
-"cpp/utility/tuple/make_tuple.html":[9,0,118,261],
-"cpp/utility/tuple/tie.html":[9,0,118,450],
-"cpp/utility/tuple/tuple_cat.html":[9,0,118,464],
-"d0/d01/smallest__circle_8cpp.html":[11,0,17,20],
-"d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,17,20,6],
-"d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903":[11,0,17,20,1],
-"d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a":[11,0,17,20,2],
-"d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e":[11,0,17,20,7],
-"d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc":[11,0,17,20,8],
-"d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,17,20,5],
-"d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,20,3],
-"d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad":[11,0,17,20,4],
-"d0/d08/realtime__stats_8cpp.html":[11,0,14,50],
-"d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,14,50,2],
-"d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd":[11,0,14,50,3],
-"d0/d20/namespaceground__to__ground__projectile__motion.html":[9,0,43],
-"d0/d2b/namespacequick__sort.html":[9,0,98],
-"d0/d2e/namespaceneural__network.html":[9,0,85],
-"d0/d3e/classdata__structures_1_1trie.html":[9,0,21,7],
-"d0/d3e/classdata__structures_1_1trie.html":[10,0,2,14],
-"d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546":[9,0,21,7,3],
-"d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546":[10,0,2,14,3],
-"d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b":[9,0,21,7,6],
-"d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b":[10,0,2,14,6],
-"d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d":[9,0,21,7,5],
-"d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d":[10,0,2,14,5],
-"d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191":[9,0,21,7,8],
-"d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191":[10,0,2,14,8],
-"d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6":[9,0,21,7,7],
-"d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6":[10,0,2,14,7],
-"d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8":[9,0,21,7,0],
-"d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8":[10,0,2,14,0],
-"d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63":[9,0,21,7,4],
-"d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63":[10,0,2,14,4],
-"d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988":[9,0,21,7,1],
-"d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988":[10,0,2,14,1],
-"d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab":[9,0,21,7,2],
-"d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab":[10,0,2,14,2],
-"d0/d46/finding__number__of__digits__in__a__number_8cpp.html":[11,0,14,20],
-"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1":[11,0,14,20,0],
-"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300":[11,0,14,20,2],
-"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49":[11,0,14,20,1],
-"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,20,3],
-"d0/d51/approximate__pi_8cpp.html":[11,0,14,1],
-"d0/d51/approximate__pi_8cpp.html#a006c8ebd11bb1e035815dc835a1a7a85":[11,0,14,1,0],
-"d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,1,3],
-"d0/d51/approximate__pi_8cpp.html#abf7f2a6d91f1ca6c89698792aea3f188":[11,0,14,1,1],
-"d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,1,2],
-"d0/d52/namespacewiggle__sort.html":[9,0,140],
-"d0/d58/classgraph_1_1_rooted_tree.html":[9,0,39,3],
-"d0/d58/classgraph_1_1_rooted_tree.html":[10,0,6,5],
-"d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3":[9,0,39,3,2],
-"d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3":[10,0,6,5,2],
-"d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43":[9,0,39,3,3],
-"d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43":[10,0,6,5,3],
-"d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d":[9,0,39,3,0],
-"d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d":[10,0,6,5,0],
-"d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe":[9,0,39,3,4],
-"d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe":[10,0,6,5,4],
-"d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e":[9,0,39,3,1],
-"d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e":[10,0,6,5,1],
-"d0/d5a/skip__list_8cpp.html":[11,0,4,18],
-"d0/d5a/skip__list_8cpp.html#a903639d8e6f955dd8d5c263781455d61":[11,0,4,18,4],
-"d0/d5a/skip__list_8cpp.html#ac0d7e0be24da9f41bcb19745873c436a":[11,0,4,18,3],
-"d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,18,2],
-"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html":[10,0,12,3,0],
-"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe":[10,0,12,3,0,8],
-"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a18b70172ca4fb2811dbfb9a86e48b34c":[10,0,12,3,0,6],
-"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a4a624fcdf3c3beb2025d69f2cfda8023":[10,0,12,3,0,5],
-"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503":[10,0,12,3,0,4],
-"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c":[10,0,12,3,0,2],
-"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c":[10,0,12,3,0,9],
-"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6":[10,0,12,3,0,7],
-"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169":[10,0,12,3,0,1],
-"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aefd24626ac47277431c9b8604e064340":[10,0,12,3,0,0],
-"d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0":[10,0,12,3,0,3],
-"d0/d65/namespacedouble__hashing.html":[8,0,0],
-"d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003":[9,0,26,5],
-"d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd":[9,0,26,3],
-"d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931":[9,0,26,10],
-"d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6":[9,0,26,11],
-"d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082":[9,0,26,6],
-"d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824":[9,0,26,9],
-"d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a":[9,0,26,1],
-"d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200":[9,0,26,4],
-"d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560":[9,0,26,2],
-"d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b":[9,0,26,7],
-"d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d":[9,0,26,8],
-"d0/d6d/modular__exponentiation_8cpp.html":[11,0,14,36],
-"d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,36,2],
-"d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,36,0],
-"d0/d6d/modular__exponentiation_8cpp.html#afcd07701d73ed65cd616bcba02737f3d":[11,0,14,36,1],
-"d0/d6f/namespaceothers.html":[9,0,88],
-"d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec":[9,0,88,2],
-"d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703":[9,0,88,1],
-"d0/d77/longest__palindromic__subsequence_8cpp.html":[11,0,6,10],
-"d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,10,2],
-"d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,10,1],
-"d0/d77/longest__palindromic__subsequence_8cpp.html#afe9f45b6e30ee187509da2d1d0093412":[11,0,6,10,0],
-"d0/da2/number__of__positive__divisors_8cpp.html":[11,0,14,42],
-"d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,14,42,2],
-"d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb":[11,0,14,42,1],
-"d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,42,0],
-"d0/da4/namespacemonte__carlo.html":[9,0,78],
-"d0/db6/non__recursive__merge__sort_8cpp.html":[11,0,22,13],
-"d0/db6/non__recursive__merge__sort_8cpp.html#a140d913e42fb94176a0b2c8b29a80420":[11,0,22,13,2],
-"d0/db6/non__recursive__merge__sort_8cpp.html#a27236b8d3df3832e1f1225576a122534":[11,0,22,13,3],
-"d0/db6/non__recursive__merge__sort_8cpp.html#aa26de383227859210f14dcf12201a079":[11,0,22,13,0],
-"d0/db6/non__recursive__merge__sort_8cpp.html#ae97f4dd815654c4682f564afd718e824":[11,0,22,13,1],
-"d0/dbc/namespacestrings_1_1boyer__moore.html":[9,0,123,0],
-"d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a":[9,0,123,0,4],
-"d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8":[9,0,123,0,3],
-"d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738":[9,0,123,0,5],
-"d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00":[9,0,123,0,1],
-"d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1":[9,0,123,0,2],
-"d0/dd2/treap_8cpp.html":[11,0,4,21],
-"d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,4,21,2],
-"d0/dd2/treap_8cpp.html#ad939ec178d0069aeea14b7d6d7d12099":[11,0,4,21,3],
-"d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,21,1],
-"d0/dd5/namespacebubble__sort.html":[9,0,11],
-"d0/dda/namespacesaddleback.html":[9,0,105],
-"d0/de2/gaussian__elimination_8cpp.html":[11,0,15,7],
-"d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,7,0],
-"d0/df8/namespaceabbreviation.html":[9,0,1],
-"d0/dff/structlinkedlist.html":[10,0,38],
-"d1/d11/gcd__of__n__numbers_8cpp.html":[11,0,14,22],
-"d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532":[11,0,14,22,1],
-"d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181":[11,0,14,22,2],
-"d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a":[11,0,14,22,0],
-"d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,22,4],
-"d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,22,3],
-"d1/d21/quick__sort_8cpp.html":[11,0,22,16],
-"d1/d21/quick__sort_8cpp.html#a1b2a2cc2d319240f3b65c5b2f479ed82":[11,0,22,16,1],
-"d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,22,16,5],
-"d1/d21/quick__sort_8cpp.html#a53adad7e4d83e1495df25fe8dbb4cc05":[11,0,22,16,3],
-"d1/d21/quick__sort_8cpp.html#a5e6213e8008356ac6eda9427f3f4b394":[11,0,22,16,2],
-"d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,16,0],
-"d1/d21/quick__sort_8cpp.html#aeccefcf6fcca62c54939c5ec9a93109b":[11,0,22,16,4],
-"d1/d2a/knight__tour_8cpp.html":[11,0,0,2],
-"d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9":[11,0,0,2,2],
-"d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,2,1],
-"d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2":[11,0,0,2,0],
-"d1/d35/namespaceexponential__dist.html":[9,0,29],
-"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html":[10,0,16,0,2],
-"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70":[10,0,16,0,2,9],
-"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1":[10,0,16,0,2,11],
-"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a135b7952593c9b1aae38fcaf1cc1abf7":[10,0,16,0,2,17],
-"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203":[10,0,16,0,2,14],
-"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d":[10,0,16,0,2,1],
-"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1":[10,0,16,0,2,0],
-"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a8f7bca1746d40f21ad832fcea59aa6c6":[10,0,16,0,2,6],
-"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460":[10,0,16,0,2,4],
-"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa6c37e840355b9fb2105181c578694e8":[10,0,16,0,2,15],
-"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab1aeaefa1bd97b867c652ba916fbdb43":[10,0,16,0,2,10],
-"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab2ab020f798d00be2613ecf63074b7c1":[10,0,16,0,2,12],
-"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0":[10,0,16,0,2,2],
-"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3":[10,0,16,0,2,8],
-"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc":[10,0,16,0,2,5],
-"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ada1494fccbc7f1f07b2f9be9f7e07ad5":[10,0,16,0,2,16],
-"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4":[10,0,16,0,2,7],
-"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae4630fa70a80a1dc65a875488a67178a":[10,0,16,0,2,13],
-"d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4":[10,0,16,0,2,3],
-"d1/d64/namespaceinterpolation__search.html":[9,0,50],
-"d1/d64/namespacemodular__division.html":[9,0,76],
-"d1/d76/buzz__number_8cpp.html":[11,0,17,0],
-"d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,0,0],
-"d1/d77/structmst.html":[10,0,44],
-"d1/d83/classuint256__t.html":[10,0,61],
-"d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3":[10,0,61,4],
-"d1/d83/classuint256__t.html#a028c585069fa53b74c153667ff66352c":[10,0,61,15],
-"d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163":[10,0,61,8],
-"d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa":[10,0,61,3],
-"d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5":[10,0,61,53],
-"d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88":[10,0,61,55],
-"d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39":[10,0,61,1],
-"d1/d83/classuint256__t.html#a2029e9777f999bffef6004429b4f19f2":[10,0,61,54],
-"d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f":[10,0,61,33],
-"d1/d83/classuint256__t.html#a28aa5786bbfce1b00398a8d38691bdaa":[10,0,61,12],
-"d1/d83/classuint256__t.html#a28d26847f9b19a4f86c187791cb0db13":[10,0,61,43],
-"d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052":[10,0,61,5],
-"d1/d83/classuint256__t.html#a2cd43a4a92dc825a010a17578b3bdedb":[10,0,61,21],
-"d1/d83/classuint256__t.html#a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2":[10,0,61,73],
-"d1/d83/classuint256__t.html#a303287d7bc8686dcb47fcb04720ad409":[10,0,61,24],
-"d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d":[10,0,61,27],
-"d1/d83/classuint256__t.html#a3dc4d3ab175f5f2a3172eb8d99a60fc3":[10,0,61,70],
-"d1/d83/classuint256__t.html#a3ff17ab14b2371eb3239107d10947067":[10,0,61,6],
-"d1/d83/classuint256__t.html#a406c951a07d8173685dbe384c6ab6a06":[10,0,61,39],
-"d1/d83/classuint256__t.html#a41f4bb928c4ee067732503395b65f9d7":[10,0,61,77],
-"d1/d83/classuint256__t.html#a42bf7490b31d8c750a67fd9bb6f2df2e":[10,0,61,2],
-"d1/d83/classuint256__t.html#a4645040fe68ff01d83400f173fd2bb21":[10,0,61,32],
-"d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51":[10,0,61,66],
-"d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5":[10,0,61,52],
-"d1/d83/classuint256__t.html#a4886747ffff15cdeb6bc93712629f9e7":[10,0,61,76],
-"d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc":[10,0,61,58],
-"d1/d83/classuint256__t.html#a4fdeb4d4bf8cca4ee99b8487e59831df":[10,0,61,47],
-"d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1":[10,0,61,37],
-"d1/d83/classuint256__t.html#a5e84ed2a2f99cee81ede4a0107702a45":[10,0,61,45],
-"d1/d83/classuint256__t.html#a6c5e025f901f6af4b748f98013350638":[10,0,61,59],
-"d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8":[10,0,61,22],
-"d1/d83/classuint256__t.html#a6eec1f632aebfc44fee8a74c395e10c2":[10,0,61,78],
-"d1/d83/classuint256__t.html#a74d1e1dd8cd2b31e00813ed939943be7":[10,0,61,69],
-"d1/d83/classuint256__t.html#a76914bc727eab927a3941ef71275327d":[10,0,61,20],
-"d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b":[10,0,61,28],
-"d1/d83/classuint256__t.html#a7bbe36e2ebd52df5efab118897b3050c":[10,0,61,36],
-"d1/d83/classuint256__t.html#a7bd9693b88c4df08b1f8d1fd81c597cc":[10,0,61,18],
-"d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1":[10,0,61,10],
-"d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2":[10,0,61,56],
-"d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4":[10,0,61,40],
-"d1/d83/classuint256__t.html#a89cf7fa466458ee08edd9a809d072bcb":[10,0,61,16],
-"d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261":[10,0,61,61],
-"d1/d83/classuint256__t.html#a91badfd31be84b12cbb6d85ebc04d13a":[10,0,61,80],
-"d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484":[10,0,61,60],
-"d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839":[10,0,61,23],
-"d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250":[10,0,61,9],
-"d1/d83/classuint256__t.html#a9e1b39a46ea16bc6587e25e294c6c363":[10,0,61,13],
-"d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183":[10,0,61,42],
-"d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963":[10,0,61,25]
+"d2/dc8/classdata__structures_1_1_stack.html#a2ac469fcc2229d273450e429139d90e6":[9,0,21,6,1],
+"d2/dc8/classdata__structures_1_1_stack.html#a2ac469fcc2229d273450e429139d90e6":[10,0,2,13,1],
+"d2/dc8/classdata__structures_1_1_stack.html#a3f912a0e9bed5b24b206584e3010dce3":[9,0,21,6,8],
+"d2/dc8/classdata__structures_1_1_stack.html#a3f912a0e9bed5b24b206584e3010dce3":[10,0,2,13,8],
+"d2/dc8/classdata__structures_1_1_stack.html#a61dc70e128ee64c9684f03a4c04818b0":[9,0,21,6,7],
+"d2/dc8/classdata__structures_1_1_stack.html#a61dc70e128ee64c9684f03a4c04818b0":[10,0,2,13,7],
+"d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6":[9,0,21,6,9],
+"d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6":[10,0,2,13,9],
+"d2/dc8/classdata__structures_1_1_stack.html#a88a10062c0662a385f172669f2f19b86":[9,0,21,6,10],
+"d2/dc8/classdata__structures_1_1_stack.html#a88a10062c0662a385f172669f2f19b86":[10,0,2,13,10],
+"d2/dc8/classdata__structures_1_1_stack.html#a8cb0602c8a9c1603d0315938177ecc6a":[9,0,21,6,0],
+"d2/dc8/classdata__structures_1_1_stack.html#a8cb0602c8a9c1603d0315938177ecc6a":[10,0,2,13,0],
+"d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1":[9,0,21,6,3],
+"d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1":[10,0,2,13,3],
+"d2/dc8/classdata__structures_1_1_stack.html#aa9f9b087e9e7c00628e1289f0f1de3b2":[9,0,21,6,5],
+"d2/dc8/classdata__structures_1_1_stack.html#aa9f9b087e9e7c00628e1289f0f1de3b2":[10,0,2,13,5],
+"d2/dc8/classdata__structures_1_1_stack.html#abb86ed67d9d97112897a09cfb10ff586":[9,0,21,6,6],
+"d2/dc8/classdata__structures_1_1_stack.html#abb86ed67d9d97112897a09cfb10ff586":[10,0,2,13,6],
+"d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b":[9,0,21,6,4],
+"d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b":[10,0,2,13,4],
+"d2/dcf/namespacestatistics.html":[9,0,117],
+"d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html":[10,0,19,2],
+"d2/ddb/namespacegcd__of__n__numbers.html":[9,0,35],
+"d2/de1/namespacehouse__robber.html":[9,0,48],
+"d2/de7/namespacerunge__kutta.html":[9,0,104],
+"d2/de9/heavy__light__decomposition_8cpp.html":[11,0,20,1],
+"d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817":[11,0,20,1,4],
+"d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d":[11,0,20,1,5],
+"d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,1,3],
+"d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a":[11,0,20,1,6],
+"d2/de9/heavy__light__decomposition_8cpp_source.html":[11,0,20,1],
+"d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html":[10,0,19,0],
+"d3/d05/sudoku__solver_8cpp.html":[11,0,0,11],
+"d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0":[11,0,0,11,0],
+"d3/d05/sudoku__solver_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac":[11,0,0,11,2],
+"d3/d05/sudoku__solver_8cpp.html#ac911c8bca8556206ff64461b2424866b":[11,0,0,11,3],
+"d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,11,1],
+"d3/d05/sudoku__solver_8cpp_source.html":[11,0,0,11],
+"d3/d06/ode__semi__implicit__euler_8cpp.html":[11,0,15,17],
+"d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,15,17,1],
+"d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f":[11,0,15,17,3],
+"d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe":[11,0,15,17,2],
+"d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b":[11,0,15,17,0],
+"d3/d06/ode__semi__implicit__euler_8cpp_source.html":[11,0,15,17],
+"d3/d09/node_8hpp.html":[11,0,4,15],
+"d3/d09/node_8hpp_source.html":[11,0,4,15],
+"d3/d17/namespaceutil__functions.html":[9,0,134],
+"d3/d19/sparse__matrix_8cpp.html":[11,0,17,22],
+"d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,22,0],
+"d3/d19/sparse__matrix_8cpp_source.html":[11,0,17,22],
+"d3/d22/quick__sort__iterative_8cpp.html":[11,0,23,27],
+"d3/d22/quick__sort__iterative_8cpp.html#a263595fd9a0163b5b997b89fab3a0dc5":[11,0,23,27,0],
+"d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,23,27,3],
+"d3/d22/quick__sort__iterative_8cpp.html#aac8f44b28b4aa96444383030b28f8b34":[11,0,23,27,2],
+"d3/d22/quick__sort__iterative_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,27,1],
+"d3/d22/quick__sort__iterative_8cpp_source.html":[11,0,23,27],
+"d3/d22/saddleback__search_8cpp.html":[11,0,22,12],
+"d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,12,2],
+"d3/d22/saddleback__search_8cpp.html#ad1e0ca34797d88490747c08eca70a2e6":[11,0,22,12,1],
+"d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,12,0],
+"d3/d22/saddleback__search_8cpp_source.html":[11,0,22,12],
+"d3/d24/qr__decomposition_8cpp.html":[11,0,15,19],
+"d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe":[11,0,15,19,0],
+"d3/d24/qr__decomposition_8cpp_source.html":[11,0,15,19],
+"d3/d26/binary__search__tree_8cpp.html":[11,0,4,2],
+"d3/d26/binary__search__tree_8cpp_source.html":[11,0,4,2],
+"d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html":[10,0,2,7,0],
+"d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a092d0805a9e647c2048777dbe67b35ab":[10,0,2,7,0,1],
+"d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd":[10,0,2,7,0,3],
+"d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a832072498abeaa52ad43c4fc99cba248":[10,0,2,7,0,8],
+"d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2":[10,0,2,7,0,4],
+"d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75":[10,0,2,7,0,2],
+"d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f":[10,0,2,7,0,6],
+"d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4":[10,0,2,7,0,5],
+"d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17":[10,0,2,7,0,7],
+"d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html":[10,0,10,0,0,0],
+"d3/d36/digit__separation_8cpp.html":[11,0,11,2],
+"d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,11,2,2],
+"d3/d36/digit__separation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,2,1],
+"d3/d36/digit__separation_8cpp_source.html":[11,0,11,2],
+"d3/d39/manacher__algorithm_8cpp.html":[11,0,24,5],
+"d3/d39/manacher__algorithm_8cpp.html#a95e6a2976bb2f332898f373941d52098":[11,0,24,5,1],
+"d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,24,5,2],
+"d3/d39/manacher__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,24,5,0],
+"d3/d39/manacher__algorithm_8cpp_source.html":[11,0,24,5],
+"d3/d40/graph__coloring_8cpp.html":[11,0,0,1],
+"d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c":[11,0,0,1,0],
+"d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07":[11,0,0,1,3],
+"d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d":[11,0,0,1,1],
+"d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,1,2],
+"d3/d40/graph__coloring_8cpp_source.html":[11,0,0,1],
+"d3/d4c/quick__sort__3_8cpp.html":[11,0,23,26],
+"d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda":[11,0,23,26,4],
+"d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792":[11,0,23,26,3],
+"d3/d4c/quick__sort__3_8cpp.html#a6eb67c2f91c98cf4464f75b5882022de":[11,0,23,26,2],
+"d3/d4c/quick__sort__3_8cpp.html#a9f59fe72dacc1f1218ef3c303d843168":[11,0,23,26,1],
+"d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,26,0],
+"d3/d4c/quick__sort__3_8cpp_source.html":[11,0,23,26],
+"d3/d4c/xor__cipher_8cpp.html":[11,0,2,10],
+"d3/d4c/xor__cipher_8cpp.html#a6099b7e0f1793f418d2c1befca8355a4":[11,0,2,10,0],
+"d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,2,10,3],
+"d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,10,2],
+"d3/d4c/xor__cipher_8cpp.html#aeff72a463ffc580c16cc849cbbdc58ef":[11,0,2,10,1],
+"d3/d4c/xor__cipher_8cpp_source.html":[11,0,2,10],
+"d3/d53/mo_8cpp_source.html":[11,0,20,2],
+"d3/d61/vector__important__functions_8cpp.html":[11,0,17,26],
+"d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,26,0],
+"d3/d61/vector__important__functions_8cpp_source.html":[11,0,17,26],
+"d3/d6d/namespacesimpson__method.html":[9,0,112],
+"d3/d7d/brute__force__string__searching_8cpp.html":[11,0,24,1],
+"d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123":[11,0,24,1,2],
+"d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,24,1,1],
+"d3/d7d/brute__force__string__searching_8cpp.html#aeb2cd81064717aedd62bfb096b1a73d8":[11,0,24,1,0],
+"d3/d7d/brute__force__string__searching_8cpp_source.html":[11,0,24,1],
+"d3/d80/z__function_8cpp.html":[11,0,24,7],
+"d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,24,7,2],
+"d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773":[11,0,24,7,3],
+"d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8":[11,0,24,7,0],
+"d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,24,7,1],
+"d3/d80/z__function_8cpp_source.html":[11,0,24,7],
+"d3/d84/word__break_8cpp.html":[11,0,6,30],
+"d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81":[11,0,6,30,1],
+"d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a":[11,0,6,30,0],
+"d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,30,3],
+"d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,30,2],
+"d3/d84/word__break_8cpp.html#afe4dcd6fd5282e535685361cba645d7c":[11,0,6,30,4],
+"d3/d84/word__break_8cpp_source.html":[11,0,6,30],
+"d3/d91/namespacestrassens__multiplication.html":[9,0,119],
+"d3/d92/pancake__sort_8cpp.html":[11,0,23,23],
+"d3/d92/pancake__sort_8cpp.html#a99e27ad84ad43df9977776b1a8d5416e":[11,0,23,23,2],
+"d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,23,23,3],
+"d3/d92/pancake__sort_8cpp.html#abff90bc0f54e4f8ea5f0330471781bd5":[11,0,23,23,1],
+"d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,23,0],
+"d3/d92/pancake__sort_8cpp_source.html":[11,0,23,23],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html":[10,0,2,6,1],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f":[10,0,2,6,1,4],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d":[10,0,2,6,1,6],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805":[10,0,2,6,1,9],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a273511e84a5243ffffe81be28bd24855":[10,0,2,6,1,0],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165":[10,0,2,6,1,11],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36":[10,0,2,6,1,21],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9":[10,0,2,6,1,8],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9":[10,0,2,6,1,16],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11":[10,0,2,6,1,13],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4":[10,0,2,6,1,14],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36":[10,0,2,6,1,2],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e":[10,0,2,6,1,3],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd":[10,0,2,6,1,17],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a936bb546e6a94d8b9d35b30ee1bb291a":[10,0,2,6,1,18],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aa7e5e00033f38006a224f30bdbf3f703":[10,0,2,6,1,5],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9":[10,0,2,6,1,19],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657":[10,0,2,6,1,1],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95":[10,0,2,6,1,10],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e":[10,0,2,6,1,7],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9":[10,0,2,6,1,15],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3":[10,0,2,6,1,20],
+"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be":[10,0,2,6,1,12],
+"d3/da1/namespacen__queens.html":[9,0,81],
+"d3/dae/dsu__path__compression_8cpp.html":[11,0,4,9],
+"d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae":[11,0,4,9,3],
+"d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,9,1],
+"d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243":[11,0,4,9,2],
+"d3/dae/dsu__path__compression_8cpp_source.html":[11,0,4,9],
+"d3/db0/namespacelinked__list.html":[9,0,63],
+"d3/db2/boyer__moore_8cpp.html":[11,0,24,0],
+"d3/db2/boyer__moore_8cpp.html#a056122c8fe8fb0f5fca6428d3f7b5c3a":[11,0,24,0,6],
+"d3/db2/boyer__moore_8cpp.html#a0b165af1dc341289fd705be4c67728f8":[11,0,24,0,5],
+"d3/db2/boyer__moore_8cpp.html#a15703b553faed0d28202c10808cf9738":[11,0,24,0,9],
+"d3/db2/boyer__moore_8cpp.html#a2f6688c9bb3e692297a3aa09cebc1c00":[11,0,24,0,3],
+"d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,24,0,10],
+"d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd":[11,0,24,0,1],
+"d3/db2/boyer__moore_8cpp.html#aa709cf7fca02b7d3e1888423d5f739a1":[11,0,24,0,4],
+"d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2":[11,0,24,0,8],
+"d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9":[11,0,24,0,2],
+"d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,24,0,7],
+"d3/db2/boyer__moore_8cpp_source.html":[11,0,24,0],
+"d3/db3/lru__cache_8cpp.html":[11,0,17,12],
+"d3/db3/lru__cache_8cpp.html#a01ec21fc91ddafd964ae2035ba7892c0":[11,0,17,12,6],
+"d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058":[11,0,17,12,1],
+"d3/db3/lru__cache_8cpp.html#a4b02e288a407876a8d6024f98a2a25ec":[11,0,17,12,5],
+"d3/db3/lru__cache_8cpp.html#a6401e8f2d41d8cc9cd0e52ab381608d4":[11,0,17,12,4],
+"d3/db3/lru__cache_8cpp.html#a6a3be6d8871b1f5dc03688da8f3ee9e6":[11,0,17,12,3],
+"d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,12,2],
+"d3/db3/lru__cache_8cpp_source.html":[11,0,17,12],
+"d3/dbb/class_cycle_check.html":[10,0,28],
+"d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b":[10,0,28,2],
+"d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5":[10,0,28,0],
+"d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474":[10,0,28,1],
+"d3/dc1/bucket__sort_8cpp_source.html":[11,0,23,5],
+"d3/dc9/namespacefibonacci__sum.html":[9,0,32],
+"d3/dce/linkedlist__implentation__usingarray_8cpp.html":[11,0,4,12],
+"d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02":[11,0,4,12,1],
+"d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be":[11,0,4,12,2],
+"d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,12,4],
+"d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c":[11,0,4,12,5],
+"d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df":[11,0,4,12,3],
+"d3/dce/linkedlist__implentation__usingarray_8cpp_source.html":[11,0,4,12],
+"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html":[1],
+"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md10":[1,5],
+"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md11":[1,5,0],
+"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md12":[1,5,1],
+"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md13":[1,5,2],
+"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md14":[1,5,3],
+"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md15":[1,6],
+"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md5":[1,0],
+"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md6":[1,1],
+"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md7":[1,2],
+"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md8":[1,3],
+"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md9":[1,4],
+"d3/dea/stack__using__linked__list_8cpp_source.html":[11,0,4,29],
+"d3/deb/namespaceshortest__common__supersequence.html":[9,0,110],
+"d3/dec/cycle__check__directed__graph_8cpp_source.html":[11,0,9,5],
+"d3/df9/recursive__bubble__sort_8cpp.html":[11,0,23,31],
+"d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,23,31,2],
+"d3/df9/recursive__bubble__sort_8cpp.html#ae3a775d99dbbb94c130a973df0cfddcf":[11,0,23,31,1],
+"d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,31,0],
+"d3/df9/recursive__bubble__sort_8cpp_source.html":[11,0,23,31],
+"d3/dfb/circular__queue__using__array_8cpp_source.html":[11,0,16,3],
+"d3/dfe/horspool_8cpp.html":[11,0,24,3],
+"d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336":[11,0,24,3,0],
+"d3/dfe/horspool_8cpp.html#a9884bca75ce39c116697ea2574adb37d":[11,0,24,3,1],
+"d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,24,3,3],
+"d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,24,3,2],
+"d3/dfe/horspool_8cpp_source.html":[11,0,24,3],
+"d3/dfe/perimeter_8cpp.html":[11,0,14,45],
+"d3/dfe/perimeter_8cpp.html#a0efb235330ff48e14fd31faaccbcebb3":[11,0,14,45,5],
+"d3/dfe/perimeter_8cpp.html#a1d4df7a4e43a2eac1acc0ac610487c73":[11,0,14,45,2],
+"d3/dfe/perimeter_8cpp.html#a3d1e4db743b189f309327572663415f3":[11,0,14,45,9],
+"d3/dfe/perimeter_8cpp.html#a428769a16e9525e56588d7c7709d25a6":[11,0,14,45,6],
+"d3/dfe/perimeter_8cpp.html#a8998ca7b1886d1d7d00aef3b457a9b1b":[11,0,14,45,1],
+"d3/dfe/perimeter_8cpp.html#a9236348755183644f1225e162d01ab14":[11,0,14,45,7],
+"d3/dfe/perimeter_8cpp.html#aa8592c3279c41a2c6d4d64eeb488f63f":[11,0,14,45,4],
+"d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,45,8],
+"d3/dfe/perimeter_8cpp.html#ad0acf82b7bc920182bf8322d1e103953":[11,0,14,45,0],
+"d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,45,3],
+"d3/dfe/perimeter_8cpp_source.html":[11,0,14,45],
+"d4/d08/sha256_8cpp.html":[11,0,12,6],
+"d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27":[11,0,12,6,1],
+"d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a":[11,0,12,6,2],
+"d4/d08/sha256_8cpp.html#a55475649a2bb7aae15de0716a217f43a":[11,0,12,6,7],
+"d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da":[11,0,12,6,4],
+"d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c":[11,0,12,6,6],
+"d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,12,6,5],
+"d4/d08/sha256_8cpp.html#af9b52eba85d23e309035354141259f27":[11,0,12,6,8],
+"d4/d08/sha256_8cpp.html#afea411191ec5281f43e91ea327984627":[11,0,12,6,3],
+"d4/d08/sha256_8cpp_source.html":[11,0,12,6],
+"d4/d0e/classdata__structures_1_1linked__list_1_1_node.html":[10,0,2,0,2],
+"d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e":[10,0,2,0,2,0],
+"d4/d0f/namespacegram__schmidt.html":[9,0,38],
+"d4/d12/namespace_minimum.html":[9,0,75]
 };
diff --git a/navtreeindex3.js b/navtreeindex3.js
index da0720521..ace158116 100644
--- a/navtreeindex3.js
+++ b/navtreeindex3.js
@@ -1,253 +1,253 @@
 var NAVTREEINDEX3 =
 {
-"d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc":[10,0,61,75],
-"d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1":[10,0,61,11],
-"d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967":[10,0,61,30],
-"d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616":[10,0,61,29],
-"d1/d83/classuint256__t.html#aae68a7bd17c14a926fb77758b5c8e547":[10,0,61,17],
-"d1/d83/classuint256__t.html#ab909ef62a0c85121e7d743c016fb723d":[10,0,61,41],
-"d1/d83/classuint256__t.html#abc793979ec70bb8e5cf177d83649a259":[10,0,61,48],
-"d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4":[10,0,61,49],
-"d1/d83/classuint256__t.html#ac6bdcf64653af8173987bf7217e99056":[10,0,61,50],
-"d1/d83/classuint256__t.html#ac75a46fe3625caf10e07db1eb75a1d6e":[10,0,61,38],
-"d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7":[10,0,61,71],
-"d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6":[10,0,61,46],
-"d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d":[10,0,61,63],
-"d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e":[10,0,61,68],
-"d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7":[10,0,61,44],
-"d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf":[10,0,61,72],
-"d1/d83/classuint256__t.html#ad4928175eaaaa2b559bc945affe63ad2":[10,0,61,19],
-"d1/d83/classuint256__t.html#ad5bd38b2d3becca998457af1124d6e8b":[10,0,61,14],
-"d1/d83/classuint256__t.html#ad74d33215517459c2b33ace7a9c6bc13":[10,0,61,62],
-"d1/d83/classuint256__t.html#ad9ce2370b1497efbcc426793048e1f78":[10,0,61,67],
-"d1/d83/classuint256__t.html#addff5645f6005e7b50a6ad0731e4f19c":[10,0,61,57],
-"d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad":[10,0,61,65],
-"d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5":[10,0,61,79],
-"d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc":[10,0,61,0],
-"d1/d83/classuint256__t.html#af0a6e09fcf1cbf234ed32df6d7265a0b":[10,0,61,74],
-"d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9":[10,0,61,35],
-"d1/d83/classuint256__t.html#af18e2e3d7ed635c4056062bc906fef75":[10,0,61,34],
-"d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028":[10,0,61,31],
-"d1/d83/classuint256__t.html#afa79020c27caea31236d04ecaa0e5ef5":[10,0,61,26],
-"d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96":[10,0,61,51],
-"d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4":[10,0,61,7],
-"d1/d83/classuint256__t.html#aff4d49cf84de64301b169ad974f00bad":[10,0,61,64],
-"d1/d9a/hopcroft__karp_8cpp.html":[11,0,9,8],
-"d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,9,8,2],
-"d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,8,1],
-"d1/d9e/prefix__sum__array_8cpp.html":[11,0,20,3],
-"d1/d9e/prefix__sum__array_8cpp.html#a7c8fd967c36dbba5fdf9c71faed604cf":[11,0,20,3,2],
-"d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,20,3,3],
-"d1/d9e/prefix__sum__array_8cpp.html#ab36151479ad37d53ef9fcb60a274b1d9":[11,0,20,3,0],
-"d1/d9e/prefix__sum__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,3,1],
-"d1/da6/rungekutta_8cpp.html":[11,0,15,21],
-"d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579":[11,0,15,21,0],
-"d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856":[11,0,15,21,2],
-"d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,15,21,3],
-"d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,21,1],
-"d1/da7/armstrong__number__templated_8cpp.html":[11,0,6,2],
-"d1/da7/armstrong__number__templated_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,6,2,2],
-"d1/da7/armstrong__number__templated_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,2,1],
-"d1/da7/armstrong__number__templated_8cpp.html#af046365a8d77a1267acc082f86135a26":[11,0,6,2,0],
-"d1/daa/random__pivot__quick__sort_8cpp.html":[11,0,22,20],
-"d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,22,20,3],
-"d1/daa/random__pivot__quick__sort_8cpp.html#a3d1c39e1ff42c04fb8ec0c0b9411cd3e":[11,0,22,20,4],
-"d1/daa/random__pivot__quick__sort_8cpp.html#a40675d2eb960c71ca31ec475ba90120d":[11,0,22,20,1],
-"d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5":[11,0,22,20,5],
-"d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,20,7],
-"d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5":[11,0,22,20,2],
-"d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10":[11,0,22,20,6],
-"d1/db3/structcompare.html":[10,0,26],
-"d1/db6/namespaceknight__tour.html":[9,0,59],
-"d1/dbb/n__choose__r_8cpp.html":[11,0,14,40],
-"d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,14,40,0],
-"d1/dbb/n__choose__r_8cpp.html#a6e2dff75c5de70455b90c799d6ad6967":[11,0,14,40,1],
-"d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,40,2],
-"d1/dbe/lu__decomposition_8h.html":[11,0,15,12],
-"d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f":[11,0,15,12,1],
-"d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509":[11,0,15,12,2],
-"d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4":[11,0,15,12,0],
-"d1/dbe/lu__decomposition_8h_source.html":[11,0,15,12],
-"d1/dc2/classstack.html":[10,0,54],
-"d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e":[10,0,54,6],
-"d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5":[10,0,54,2],
-"d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0":[10,0,54,3],
-"d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092":[10,0,54,0],
-"d1/dc2/classstack.html#a8bce109630118a34faae717f72986033":[10,0,54,1],
-"d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d":[10,0,54,4],
-"d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709":[10,0,54,5],
-"d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8":[10,0,54,7],
-"d1/dc7/linear__probing__hash__table_8cpp.html":[11,0,12,2],
-"d1/dc7/linear__probing__hash__table_8cpp.html#a16680b8a37d442c2f208faa286e33908":[11,0,12,2,2],
-"d1/dc7/linear__probing__hash__table_8cpp.html#a16d34fd3511626a83ab00665d7bc34d1":[11,0,12,2,1],
-"d1/dc7/linear__probing__hash__table_8cpp.html#a4bde7a47f98dd1ad24c84038e2608527":[11,0,12,2,4],
-"d1/dc7/linear__probing__hash__table_8cpp.html#a6322209aaa91b7bbf16f96e1cc52b746":[11,0,12,2,5],
-"d1/dc7/linear__probing__hash__table_8cpp.html#a6a082dc1426a79f866cee6b370df37b0":[11,0,12,2,8],
-"d1/dc7/linear__probing__hash__table_8cpp.html#a75854f5aa216e61219154c62167ce8f0":[11,0,12,2,9],
-"d1/dc7/linear__probing__hash__table_8cpp.html#a75d779938df7ebc68581d922b60a2541":[11,0,12,2,7],
-"d1/dc7/linear__probing__hash__table_8cpp.html#a942fc8407b8001890ea26830cdcd9d77":[11,0,12,2,11],
-"d1/dc7/linear__probing__hash__table_8cpp.html#abcf8d033f8115f39f3c93cfb6cee0b28":[11,0,12,2,10],
-"d1/dc7/linear__probing__hash__table_8cpp.html#ad87b71d810901fab69c4ad9d4d0fa635":[11,0,12,2,3],
-"d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,12,2,6],
-"d1/dcc/wiggle__sort_8cpp.html":[8,3,1],
-"d1/de0/namespacenumerical__methods.html":[9,0,86],
-"d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150":[9,0,86,1],
-"d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309":[9,0,86,0],
-"d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93":[9,0,86,2],
-"d1/de9/integral__approximation_8cpp.html":[11,0,14,24],
-"d1/de9/integral__approximation_8cpp.html#a50936ee98f4d40f17823befc65a32aec":[11,0,14,24,2],
-"d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,24,1],
-"d1/de9/integral__approximation_8cpp.html#aec65db4e5c7317323227f026fe50ef11":[11,0,14,24,0],
-"d1/ded/windowed__median_8cpp.html":[11,0,19,6],
-"d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601":[11,0,19,6,2],
-"d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c":[11,0,19,6,1],
-"d1/def/classdata__structures_1_1linked__list_1_1list.html":[10,0,2,0,1],
-"d1/def/classdata__structures_1_1linked__list_1_1list.html#a009b19ac8cca40f2e4daa2e5989fa4f3":[10,0,2,0,1,4],
-"d1/def/classdata__structures_1_1linked__list_1_1list.html#a1313837c0e9ec67fd9fbd17987e2d615":[10,0,2,0,1,3],
-"d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69":[10,0,2,0,1,14],
-"d1/def/classdata__structures_1_1linked__list_1_1list.html#a326ac4f721f7b74d5ed4f418a67b8d38":[10,0,2,0,1,1],
-"d1/def/classdata__structures_1_1linked__list_1_1list.html#a332b965afd9d6bea8d3246673acd52c7":[10,0,2,0,1,10],
-"d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897":[10,0,2,0,1,6],
-"d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826":[10,0,2,0,1,0],
-"d1/def/classdata__structures_1_1linked__list_1_1list.html#a6e9859d1a0755fb51e41904d20c95496":[10,0,2,0,1,9],
-"d1/def/classdata__structures_1_1linked__list_1_1list.html#a73c52b2243a6c9501af65756123e7149":[10,0,2,0,1,7],
-"d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6":[10,0,2,0,1,13],
-"d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1":[10,0,2,0,1,15],
-"d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1":[10,0,2,0,1,5],
-"d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e":[10,0,2,0,1,11],
-"d1/def/classdata__structures_1_1linked__list_1_1list.html#ac614ed8f1953f5486fab1cd6d7aa0500":[10,0,2,0,1,2],
-"d1/def/classdata__structures_1_1linked__list_1_1list.html#ad3423f7518671351340932db3c24959a":[10,0,2,0,1,12],
-"d1/def/classdata__structures_1_1linked__list_1_1list.html#adb04f732911fcfd30f7177b367c6af41":[10,0,2,0,1,8],
-"d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015":[10,0,2,0,1,16],
-"d1/df3/hash__search_8cpp.html":[11,0,21,3],
-"d1/df3/hash__search_8cpp.html#a36ea13c16028f18ef2d5ff47f3fda7a2":[11,0,21,3,7],
-"d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326":[11,0,21,3,2],
-"d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001":[11,0,21,3,6],
-"d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243":[11,0,21,3,9],
-"d1/df3/hash__search_8cpp.html#a77c722016053a1d484aa177ce205b367":[11,0,21,3,1],
-"d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555":[11,0,21,3,4],
-"d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5":[11,0,21,3,5],
-"d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6":[11,0,21,3,3],
-"d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,3,8],
-"d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d":[11,0,21,3,10],
-"d1/df6/class_easter_year_month_day.html":[10,0,31],
-"d1/df6/class_easter_year_month_day.html#a01a068eae0b6fa8f86f5f60c2840bbde":[10,0,31,1],
-"d1/df6/class_easter_year_month_day.html#a28d3cd09391390250932b7fb58fe61dc":[10,0,31,2],
-"d1/df6/class_easter_year_month_day.html#ade0b934e5b1af24e19ff959673b2ec51":[10,0,31,0],
-"d2/d05/class_min_heap.html":[10,0,42],
-"d2/d05/class_min_heap.html#a078cb888e642bb1f95dd0e03f0a35820":[10,0,42,0],
-"d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130":[10,0,42,4],
-"d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e":[10,0,42,10],
-"d2/d05/class_min_heap.html#a37ac126eabb0c3ce04047172abccca29":[10,0,42,2],
-"d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980":[10,0,42,3],
-"d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02":[10,0,42,9],
-"d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5":[10,0,42,1],
-"d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca":[10,0,42,6],
-"d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad":[10,0,42,7],
-"d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e":[10,0,42,8],
-"d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913":[10,0,42,11],
-"d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82":[10,0,42,5],
-"d2/d0b/fast__power_8cpp.html":[11,0,14,14],
-"d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d":[11,0,14,14,0],
-"d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445":[11,0,14,14,1],
-"d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,14,2],
-"d2/d21/gnome__sort_8cpp.html":[11,0,22,7],
-"d2/d21/gnome__sort_8cpp.html#a2f8bc626eb57acae24a94636a23af6a1":[11,0,22,7,1],
-"d2/d21/gnome__sort_8cpp.html#aa3677f87b5b4756bc77e9e34c5f27935":[11,0,22,7,0],
-"d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,7,3],
-"d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,7,2],
-"d2/d22/jump__search_8cpp.html":[11,0,21,5],
-"d2/d22/jump__search_8cpp.html#ab49fd8f401bfc71f63b74711390cccf0":[11,0,21,5,0],
-"d2/d26/count__inversions_8cpp.html":[11,0,22,4],
-"d2/d26/count__inversions_8cpp.html#a3332498eabf6579ef059c0d0e9f4ec80":[11,0,22,4,0],
-"d2/d26/count__inversions_8cpp.html#a851ca6a0391d14fb49a97d55e4377497":[11,0,22,4,4],
-"d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,4,5],
-"d2/d26/count__inversions_8cpp.html#aad643c14734394e784a75169cb58132f":[11,0,22,4,2],
-"d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,4,1],
-"d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661":[11,0,22,4,3],
-"d2/d2c/structtower.html":[10,0,58],
-"d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9":[10,0,58,1],
-"d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d":[10,0,58,0],
-"d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html":[9,0,42,0],
-"d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8":[9,0,42,0,3],
-"d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71":[9,0,42,0,2],
-"d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af915876d0ca33cc71a6a6191a8cd3ccd":[9,0,42,0,1],
-"d2/d3b/namespaceqr__algorithm.html":[9,0,95],
-"d2/d3b/namespaceqr__algorithm.html#a257425cb2365359da51c6fe6741834d8":[9,0,95,2],
-"d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc":[9,0,95,0],
-"d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc":[9,0,95,6],
-"d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1":[9,0,95,3],
-"d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec":[9,0,95,4],
-"d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f":[9,0,95,5],
-"d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834":[9,0,95,1],
-"d2/d45/segtree_8cpp.html":[11,0,20,4],
-"d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d":[11,0,20,4,2],
-"d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,20,4,3],
-"d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0":[11,0,20,4,4],
-"d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,4,1],
-"d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696":[11,0,20,4,0],
-"d2/d52/heap__sort_8cpp.html":[11,0,22,8],
-"d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767":[11,0,22,8,2],
-"d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,22,8,3],
-"d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,8,1],
-"d2/d58/neural__network_8cpp.html":[11,0,13,4],
-"d2/d58/neural__network_8cpp.html#a23aa9d32bcbcd65cfc85f0a41e2afadc":[11,0,13,4,8],
-"d2/d58/neural__network_8cpp.html#a2a5e874b9774aa5362dbcf288828b95c":[11,0,13,4,4],
-"d2/d58/neural__network_8cpp.html#a32c00da08f2cf641dd336270f6e3c407":[11,0,13,4,5],
-"d2/d58/neural__network_8cpp.html#a371aa7dd5d5add0143d1756bb0a1b32f":[11,0,13,4,10],
-"d2/d58/neural__network_8cpp.html#a45d3e30406712ada3d9713ece3c1b153":[11,0,13,4,9],
-"d2/d58/neural__network_8cpp.html#a76eb66212d577f948a457b6e29d87c46":[11,0,13,4,3],
-"d2/d58/neural__network_8cpp.html#aa69e95a34054d7989bf446f96b2ffaf9":[11,0,13,4,2],
-"d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,13,4,11],
-"d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,13,4,6],
-"d2/d58/neural__network_8cpp.html#af8f264600754602b6a9ea19cc690e50e":[11,0,13,4,7],
-"d2/d5a/subset__sum_8cpp.html":[11,0,0,9],
-"d2/d5a/subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99":[11,0,0,9,1],
-"d2/d5a/subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,0,9,2],
-"d2/d5a/subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,9,0],
-"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html":[10,0,16,0,0],
-"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8":[10,0,16,0,0,3],
-"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725":[10,0,16,0,0,10],
-"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a":[10,0,16,0,0,4],
-"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab":[10,0,16,0,0,6],
-"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a6e486767434e44076c1ac374a22da726":[10,0,16,0,0,0],
-"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a722cc7cf2c3e4d15583601a48b09776f":[10,0,16,0,0,11],
-"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24":[10,0,16,0,0,1],
-"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a84424f180f12b514eaab57a6aa20b104":[10,0,16,0,0,8],
-"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57":[10,0,16,0,0,7],
-"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#aa86a91ae0cd7898990a8170a2f2c9cda":[10,0,16,0,0,9],
-"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828":[10,0,16,0,0,5],
-"d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8":[10,0,16,0,0,2],
-"d2/d90/namespacegreedy__algorithms.html":[9,0,42],
-"d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502":[9,0,42,4],
-"d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098":[9,0,42,5],
-"d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html":[10,0,13,1,1],
-"d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e":[10,0,13,1,1,1],
-"d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f":[10,0,13,1,1,0],
-"d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143":[10,0,13,1,1,2],
-"d2/da7/namespacefind__non__repeating__integer.html":[9,0,33],
-"d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html":[9,0,42,0,0],
-"d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html":[10,0,7,0,0],
-"d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79":[9,0,42,0,0,1],
-"d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79":[10,0,7,0,0,1],
-"d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc":[9,0,42,0,0,0],
-"d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc":[10,0,7,0,0,0],
-"d2/db0/namespacesieve__of__eratosthenes.html":[9,0,111],
-"d2/dc4/classstack__linked_list.html":[10,0,55],
-"d2/dc8/classdata__structures_1_1_stack.html":[9,0,21,6],
-"d2/dc8/classdata__structures_1_1_stack.html":[10,0,2,13],
-"d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080":[9,0,21,6,2],
-"d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080":[10,0,2,13,2],
-"d2/dc8/classdata__structures_1_1_stack.html#a2ac469fcc2229d273450e429139d90e6":[9,0,21,6,1],
-"d2/dc8/classdata__structures_1_1_stack.html#a2ac469fcc2229d273450e429139d90e6":[10,0,2,13,1],
-"d2/dc8/classdata__structures_1_1_stack.html#a3f912a0e9bed5b24b206584e3010dce3":[9,0,21,6,8],
-"d2/dc8/classdata__structures_1_1_stack.html#a3f912a0e9bed5b24b206584e3010dce3":[10,0,2,13,8],
-"d2/dc8/classdata__structures_1_1_stack.html#a61dc70e128ee64c9684f03a4c04818b0":[9,0,21,6,7],
-"d2/dc8/classdata__structures_1_1_stack.html#a61dc70e128ee64c9684f03a4c04818b0":[10,0,2,13,7],
-"d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6":[9,0,21,6,9],
-"d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6":[10,0,2,13,9],
-"d2/dc8/classdata__structures_1_1_stack.html#a88a10062c0662a385f172669f2f19b86":[9,0,21,6,10],
-"d2/dc8/classdata__structures_1_1_stack.html#a88a10062c0662a385f172669f2f19b86":[10,0,2,13,10],
-"d2/dc8/classdata__structures_1_1_stack.html#a8cb0602c8a9c1603d0315938177ecc6a":[9,0,21,6,0],
-"d2/dc8/classdata__structures_1_1_stack.html#a8cb0602c8a9c1603d0315938177ecc6a":[10,0,2,13,0]
+"d4/d13/namespacebidirectional__dijkstra.html":[9,0,7],
+"d4/d18/composite__simpson__rule_8cpp.html":[11,0,15,3],
+"d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442":[11,0,15,3,2],
+"d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e":[11,0,15,3,5],
+"d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad":[11,0,15,3,1],
+"d4/d18/composite__simpson__rule_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,15,3,4],
+"d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397":[11,0,15,3,0],
+"d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a":[11,0,15,3,3],
+"d4/d18/composite__simpson__rule_8cpp_source.html":[11,0,15,3],
+"d4/d1c/namespacehamming__distance.html":[9,0,44],
+"d4/d21/least__common__multiple_8cpp.html":[11,0,14,33],
+"d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,14,33,3],
+"d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563":[11,0,14,33,0],
+"d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25":[11,0,14,33,1],
+"d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,33,2],
+"d4/d21/least__common__multiple_8cpp_source.html":[11,0,14,33],
+"d4/d32/fibonacci__fast_8cpp.html":[11,0,14,17],
+"d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326":[11,0,14,17,0],
+"d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f":[11,0,14,17,1],
+"d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,17,2],
+"d4/d32/fibonacci__fast_8cpp_source.html":[11,0,14,17],
+"d4/d32/inorder__successor__of__bst_8cpp.html":[11,0,16,5],
+"d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9":[11,0,16,5,8],
+"d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,16,5,7],
+"d4/d32/inorder__successor__of__bst_8cpp.html#a3923fb22b46e085376703cae0b44d690":[11,0,16,5,4],
+"d4/d32/inorder__successor__of__bst_8cpp.html#a3ae0bea4123fd2ce155108e88f2ef78c":[11,0,16,5,6],
+"d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4":[11,0,16,5,10],
+"d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db":[11,0,16,5,3],
+"d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589":[11,0,16,5,2],
+"d4/d32/inorder__successor__of__bst_8cpp.html#a7f6f73a33beec448c27cc1d70b220702":[11,0,16,5,9],
+"d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95":[11,0,16,5,5],
+"d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,5,11],
+"d4/d32/inorder__successor__of__bst_8cpp_source.html":[11,0,16,5],
+"d4/d38/namespacecount__bits__flip.html":[9,0,15],
+"d4/d38/power__of__two_8cpp.html":[11,0,14,47],
+"d4/d38/power__of__two_8cpp.html#a8a48be4d7f14e34c5c92925bc1cbf3bb":[11,0,14,47,1],
+"d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,47,2],
+"d4/d38/power__of__two_8cpp.html#adfd6be45be425ae28c62ce3bfb4b40dc":[11,0,14,47,3],
+"d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,47,0],
+"d4/d38/power__of__two_8cpp_source.html":[11,0,14,47],
+"d4/d39/group__open__addressing.html":[8,0],
+"d4/d3e/k__nearest__neighbors_8cpp.html":[11,0,13,2],
+"d4/d3e/k__nearest__neighbors_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,13,2,2],
+"d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,13,2,3],
+"d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69":[11,0,13,2,1],
+"d4/d3e/k__nearest__neighbors_8cpp_source.html":[11,0,13,2],
+"d4/d3e/n__queens_8cpp.html":[11,0,0,5],
+"d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb":[11,0,0,5,3],
+"d4/d3e/n__queens_8cpp.html#a40ae0c7fd04eb20e7f3bff13fc6a5808":[11,0,0,5,2],
+"d4/d3e/n__queens_8cpp.html#a5730b6683f6adcf5c5ef75cf53dc7160":[11,0,0,5,0],
+"d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,5,1],
+"d4/d3e/n__queens_8cpp_source.html":[11,0,0,5],
+"d4/d45/gcd__recursive__euclidean_8cpp.html":[11,0,14,24],
+"d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e":[11,0,14,24,0],
+"d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,24,1],
+"d4/d45/gcd__recursive__euclidean_8cpp_source.html":[11,0,14,24],
+"d4/d48/hamming__distance_8cpp.html":[11,0,1,5],
+"d4/d48/hamming__distance_8cpp.html#a40ba9fe8b5df5c268f0c7d677ff2fe80":[11,0,1,5,1],
+"d4/d48/hamming__distance_8cpp.html#a65d845df3fecff7087a2126c7b72030b":[11,0,1,5,0],
+"d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,5,4],
+"d4/d48/hamming__distance_8cpp.html#abfe6fbb2f3460a2623c96f283178a07a":[11,0,1,5,2],
+"d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,5,3],
+"d4/d48/hamming__distance_8cpp_source.html":[11,0,1,5],
+"d4/d4f/stooge__sort_8cpp.html":[11,0,23,37],
+"d4/d4f/stooge__sort_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,23,37,3],
+"d4/d4f/stooge__sort_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,23,37,2],
+"d4/d4f/stooge__sort_8cpp.html#a6d0455dd5c30adda100e95f0423c786e":[11,0,23,37,4],
+"d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b":[11,0,23,37,1],
+"d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,37,0],
+"d4/d4f/stooge__sort_8cpp_source.html":[11,0,23,37],
+"d4/d68/qr__decompose_8h.html":[11,0,15,18],
+"d4/d68/qr__decompose_8h.html#a257425cb2365359da51c6fe6741834d8":[11,0,15,18,1],
+"d4/d68/qr__decompose_8h.html#a6d3c7dce1f142141f509d09f6c0e25dc":[11,0,15,18,5],
+"d4/d68/qr__decompose_8h.html#a73ce637634fc49e1d10d190eb388ebf1":[11,0,15,18,2],
+"d4/d68/qr__decompose_8h.html#a8ea313a1a1b5f9d0e3e332c29c6446ec":[11,0,15,18,3],
+"d4/d68/qr__decompose_8h.html#ad16da2183db22378435042f26af43d5f":[11,0,15,18,4],
+"d4/d68/qr__decompose_8h.html#adfbdf47277c8cfee229b05b72f1f7834":[11,0,15,18,0],
+"d4/d68/qr__decompose_8h_source.html":[11,0,15,18],
+"d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html":[11,0,11,1],
+"d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a2311b22324cf09926726e4ce1309af8b":[11,0,11,1,3],
+"d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,11,1,4],
+"d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59":[11,0,11,1,0],
+"d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84":[11,0,11,1,1],
+"d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,1,2],
+"d4/d6c/boruvkas__minimum__spanning__tree_8cpp_source.html":[11,0,11,1],
+"d4/d7a/shell__sort2_8cpp.html":[11,0,23,35],
+"d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,23,35,1],
+"d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d":[11,0,23,35,7],
+"d4/d7a/shell__sort2_8cpp.html#a4d76603c54d3dc56146e92d10a043924":[11,0,23,35,4],
+"d4/d7a/shell__sort2_8cpp.html#a5669396c6a6b1e14b97589b6e37980aa":[11,0,23,35,3],
+"d4/d7a/shell__sort2_8cpp.html#a63aaff7cabfa3da2da8b9477b5fad9d6":[11,0,23,35,6],
+"d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c":[11,0,23,35,0],
+"d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e":[11,0,23,35,8],
+"d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246":[11,0,23,35,5],
+"d4/d7a/shell__sort2_8cpp.html#af2c5b92cbfe73f63f6074c61b0a45331":[11,0,23,35,2],
+"d4/d7a/shell__sort2_8cpp_source.html":[11,0,23,35],
+"d4/d83/sum__of__digits_8cpp.html":[11,0,14,57],
+"d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,14,57,4],
+"d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,14,57,3],
+"d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395":[11,0,14,57,1],
+"d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,14,57,2],
+"d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,57,0],
+"d4/d83/sum__of__digits_8cpp_source.html":[11,0,14,57],
+"d4/d86/large__number_8h.html":[11,0,14,30],
+"d4/d86/large__number_8h_source.html":[11,0,14,30],
+"d4/d8b/gray__code_8cpp_source.html":[11,0,1,4],
+"d4/d8d/jarvis__algorithm_8cpp.html":[11,0,8,2],
+"d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,8,2,3],
+"d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,8,2,2],
+"d4/d8d/jarvis__algorithm_8cpp_source.html":[11,0,8,2],
+"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html":[11,0,1,9],
+"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,9,1],
+"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1":[11,0,1,9,2],
+"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,9,0],
+"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp_source.html":[11,0,1,9],
+"d4/d90/classdata__structures_1_1_skip_list.html":[9,0,21,5],
+"d4/d90/classdata__structures_1_1_skip_list.html":[10,0,2,12],
+"d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650":[9,0,21,5,7],
+"d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650":[10,0,2,12,7],
+"d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9":[9,0,21,5,3],
+"d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9":[10,0,2,12,3],
+"d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4":[9,0,21,5,0],
+"d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4":[10,0,2,12,0],
+"d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c":[9,0,21,5,2],
+"d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c":[10,0,2,12,2],
+"d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0":[9,0,21,5,1],
+"d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0":[10,0,2,12,1],
+"d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4":[9,0,21,5,4],
+"d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4":[10,0,2,12,4],
+"d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16":[9,0,21,5,6],
+"d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16":[10,0,2,12,6],
+"d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4":[9,0,21,5,5],
+"d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4":[10,0,2,12,5],
+"d4/d91/namespacevector__cross.html":[9,0,136],
+"d4/d9c/primes__up__to__billion_8cpp.html":[11,0,14,50],
+"d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c":[11,0,14,50,1],
+"d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95":[11,0,14,50,2],
+"d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,50,0],
+"d4/d9c/primes__up__to__billion_8cpp_source.html":[11,0,14,50],
+"d4/d9d/sum__of__binomial__coefficient_8cpp.html":[11,0,14,56],
+"d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,56,2],
+"d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae1ca505751f5a6d3977b86372cfe75ea":[11,0,14,56,0],
+"d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,56,1],
+"d4/d9d/sum__of__binomial__coefficient_8cpp_source.html":[11,0,14,56],
+"d4/d9f/selection__sort__recursive_8cpp.html":[11,0,23,33],
+"d4/d9f/selection__sort__recursive_8cpp.html#a5454eeb691725ccac0f59df1e133f834":[11,0,23,33,0],
+"d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,23,33,3],
+"d4/d9f/selection__sort__recursive_8cpp.html#ab6f7b33a070e376e1f4374e534435e89":[11,0,23,33,2],
+"d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,33,1],
+"d4/d9f/selection__sort__recursive_8cpp_source.html":[11,0,23,33],
+"d4/da0/gcd__iterative__euclidean_8cpp.html":[11,0,14,22],
+"d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e":[11,0,14,22,0],
+"d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,22,1],
+"d4/da0/gcd__iterative__euclidean_8cpp_source.html":[11,0,14,22],
+"d4/da0/kadane_8cpp.html":[11,0,6,13],
+"d4/da0/kadane_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,13,0],
+"d4/da0/kadane_8cpp.html#af3029007a422a914a85c0b0122f1c7b4":[11,0,6,13,1],
+"d4/da0/kadane_8cpp_source.html":[11,0,6,13],
+"d4/db4/struct_segment_intersection.html":[10,0,52],
+"d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf":[10,0,52,1],
+"d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655":[10,0,52,0],
+"d4/db6/reverse__binary__tree_8cpp.html":[11,0,16,8],
+"d4/db6/reverse__binary__tree_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,8,4],
+"d4/db6/reverse__binary__tree_8cpp.html#aa515639572647508b94986489aab6d76":[11,0,16,8,6],
+"d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,8,3],
+"d4/db6/reverse__binary__tree_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669":[11,0,16,8,5],
+"d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,16,8,2],
+"d4/db6/reverse__binary__tree_8cpp_source.html":[11,0,16,8],
+"d4/db8/longest__substring__without__repeating__characters_8cpp.html":[11,0,17,11],
+"d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,17,11,2],
+"d4/db8/longest__substring__without__repeating__characters_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,11,1],
+"d4/db8/longest__substring__without__repeating__characters_8cpp_source.html":[11,0,17,11],
+"d4/db9/namespacencr__modulo__p.html":[9,0,84],
+"d4/dcd/namespacecircular__linked__list.html":[9,0,14],
+"d4/dd2/namespacequadratic__probing.html":[8,0,2],
+"d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9":[9,0,96,1],
+"d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a":[9,0,96,10],
+"d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7":[9,0,96,5],
+"d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768":[9,0,96,2],
+"d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357":[9,0,96,3],
+"d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d":[9,0,96,4],
+"d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30":[9,0,96,9],
+"d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf":[9,0,96,7],
+"d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486":[9,0,96,8],
+"d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b":[9,0,96,6],
+"d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6":[9,0,96,11],
+"d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html":[10,0,5,1,0],
+"d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c":[10,0,5,1,0,2],
+"d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870":[10,0,5,1,0,0],
+"d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1":[10,0,5,1,0,1],
+"d4/de6/namespacepostfix__expression.html":[9,0,92],
+"d4/ded/namespaceprobability.html":[9,0,94],
+"d4/def/kohonen__som__topology_8cpp.html":[8,1,1],
+"d4/def/longest__common__subsequence_8cpp_source.html":[11,0,6,15],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html":[10,0,10,2,1],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a173bb71780af6953ec2e307a4c74b025":[10,0,10,2,1,5],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a176b955c90ae57d7dbc3c63f27c84c75":[10,0,10,2,1,3],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0":[10,0,10,2,1,10],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2c49bfebf9b859d5ceb26035d3003601":[10,0,10,2,1,15],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b":[10,0,10,2,1,6],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a36494e26ff36d6e15c1022bb9a1ee848":[10,0,10,2,1,9],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f":[10,0,10,2,1,17],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4c4c6f63ab965317f9471518ee931b89":[10,0,10,2,1,0],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4f14e473bb0722c6490b9dc8da5982aa":[10,0,10,2,1,16],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff":[10,0,10,2,1,11],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58a9614e4c6d4ca672d3358e99a3404f":[10,0,10,2,1,14],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58ed20abf6ce3744535bd8b5bb9e741b":[10,0,10,2,1,13],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931":[10,0,10,2,1,18],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a62151b0398a2536be60d950e10ffe9a8":[10,0,10,2,1,2],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d":[10,0,10,2,1,12],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a88bf9023ab3d4cdb61cf707c7cdfc86b":[10,0,10,2,1,7],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a8973f687738ddd76f93b5562feae4027":[10,0,10,2,1,4],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ae7cf126a3a8f9d20c81b21584d061a08":[10,0,10,2,1,1],
+"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e":[10,0,10,2,1,8],
+"d4/dfb/namespacecycle__sort.html":[9,0,20],
+"d5/d02/namespacehorspool.html":[9,0,47],
+"d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html":[10,0,2,7,0,0],
+"d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a08212cdc99164b59da91b81f45e2f88e":[10,0,2,7,0,0,0],
+"d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a3cdb077745d3dc97212d693132371219":[10,0,2,7,0,0,1],
+"d5/d15/classcll.html":[10,0,24],
+"d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html":[11,0,1,6],
+"d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#a4b76571a2a04fa99c30a96eca9997f0e":[11,0,1,6,1],
+"d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,6,2],
+"d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,6,0],
+"d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp_source.html":[11,0,1,6],
+"d5/d1e/tim__sort_8cpp_source.html":[11,0,23,40],
+"d5/d21/longest__increasing__subsequence__nlogn_8cpp_source.html":[11,0,6,17],
+"d5/d25/bead__sort_8cpp_source.html":[11,0,23,0],
+"d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html":[10,0,19,4],
+"d5/d29/struct_min_heap_node.html":[10,0,43],
+"d5/d2c/namespacelayers.html":[9,0,60],
+"d5/d33/gram__schmidt_8cpp.html":[11,0,15,9],
+"d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5":[11,0,15,9,2],
+"d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc":[11,0,15,9,4],
+"d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,15,9,5],
+"d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d":[11,0,15,9,1],
+"d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,9,3],
+"d5/d33/gram__schmidt_8cpp.html#ae6b496dce691e04f7f95ba0f0d33a289":[11,0,15,9,0],
+"d5/d33/gram__schmidt_8cpp_source.html":[11,0,15,9],
+"d5/d39/namespaceactivations.html":[9,0,2],
+"d5/d3c/namespacedata__structures.html":[9,0,21],
+"d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4":[9,0,21,8],
+"d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15":[9,0,21,11],
+"d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61":[9,0,21,13],
+"d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c":[9,0,21,10],
+"d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677":[9,0,21,9],
+"d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a":[9,0,21,12],
+"d5/d45/sublist__search_8cpp.html":[11,0,22,13],
+"d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,22,13,2],
+"d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c":[11,0,22,13,5]
 };
diff --git a/navtreeindex4.js b/navtreeindex4.js
index 5a458eee3..f5753ab43 100644
--- a/navtreeindex4.js
+++ b/navtreeindex4.js
@@ -1,253 +1,253 @@
 var NAVTREEINDEX4 =
 {
-"d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1":[9,0,21,6,3],
-"d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1":[10,0,2,13,3],
-"d2/dc8/classdata__structures_1_1_stack.html#aa9f9b087e9e7c00628e1289f0f1de3b2":[9,0,21,6,5],
-"d2/dc8/classdata__structures_1_1_stack.html#aa9f9b087e9e7c00628e1289f0f1de3b2":[10,0,2,13,5],
-"d2/dc8/classdata__structures_1_1_stack.html#abb86ed67d9d97112897a09cfb10ff586":[9,0,21,6,6],
-"d2/dc8/classdata__structures_1_1_stack.html#abb86ed67d9d97112897a09cfb10ff586":[10,0,2,13,6],
-"d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b":[9,0,21,6,4],
-"d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b":[10,0,2,13,4],
-"d2/dcf/namespacestatistics.html":[9,0,117],
-"d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html":[9,0,118,7],
-"d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html":[10,0,19,2],
-"d2/ddb/namespacegcd__of__n__numbers.html":[9,0,35],
-"d2/de1/namespacehouse__robber.html":[9,0,48],
-"d2/de7/namespacerunge__kutta.html":[9,0,104],
-"d2/de9/heavy__light__decomposition_8cpp.html":[11,0,20,1],
-"d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817":[11,0,20,1,4],
-"d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d":[11,0,20,1,5],
-"d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,1,3],
-"d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a":[11,0,20,1,6],
-"d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html":[9,0,118,5],
-"d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html":[10,0,19,0],
-"d3/d05/sudoku__solver_8cpp.html":[11,0,0,10],
-"d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0":[11,0,0,10,0],
-"d3/d05/sudoku__solver_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac":[11,0,0,10,2],
-"d3/d05/sudoku__solver_8cpp.html#ac911c8bca8556206ff64461b2424866b":[11,0,0,10,3],
-"d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,10,1],
-"d3/d06/ode__semi__implicit__euler_8cpp.html":[11,0,15,17],
-"d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,15,17,1],
-"d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f":[11,0,15,17,3],
-"d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe":[11,0,15,17,2],
-"d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b":[11,0,15,17,0],
-"d3/d09/node_8hpp.html":[11,0,4,12],
-"d3/d09/node_8hpp_source.html":[11,0,4,12],
-"d3/d17/namespaceutil__functions.html":[9,0,135],
-"d3/d19/sparse__matrix_8cpp.html":[11,0,17,21],
-"d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,21,0],
-"d3/d22/quick__sort__iterative_8cpp.html":[11,0,22,18],
-"d3/d22/quick__sort__iterative_8cpp.html#a263595fd9a0163b5b997b89fab3a0dc5":[11,0,22,18,0],
-"d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,22,18,3],
-"d3/d22/quick__sort__iterative_8cpp.html#aac8f44b28b4aa96444383030b28f8b34":[11,0,22,18,2],
-"d3/d22/quick__sort__iterative_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,18,1],
-"d3/d22/saddleback__search_8cpp.html":[11,0,21,10],
-"d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,21,10,2],
-"d3/d22/saddleback__search_8cpp.html#ad1e0ca34797d88490747c08eca70a2e6":[11,0,21,10,1],
-"d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,10,0],
-"d3/d24/qr__decomposition_8cpp.html":[11,0,15,19],
-"d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe":[11,0,15,19,0],
-"d3/d26/binary__search__tree_8cpp.html":[11,0,4,2],
-"d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html":[10,0,2,7,0],
-"d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a092d0805a9e647c2048777dbe67b35ab":[10,0,2,7,0,1],
-"d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd":[10,0,2,7,0,3],
-"d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a832072498abeaa52ad43c4fc99cba248":[10,0,2,7,0,8],
-"d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2":[10,0,2,7,0,4],
-"d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75":[10,0,2,7,0,2],
-"d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f":[10,0,2,7,0,6],
-"d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4":[10,0,2,7,0,5],
-"d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17":[10,0,2,7,0,7],
-"d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html":[10,0,10,0,0,0],
-"d3/d36/digit__separation_8cpp.html":[11,0,11,2],
-"d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,11,2,2],
-"d3/d36/digit__separation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,2,1],
-"d3/d39/manacher__algorithm_8cpp.html":[11,0,23,5],
-"d3/d39/manacher__algorithm_8cpp.html#a95e6a2976bb2f332898f373941d52098":[11,0,23,5,1],
-"d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,23,5,2],
-"d3/d39/manacher__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,5,0],
-"d3/d40/graph__coloring_8cpp.html":[11,0,0,1],
-"d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c":[11,0,0,1,0],
-"d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07":[11,0,0,1,3],
-"d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d":[11,0,0,1,1],
-"d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,1,2],
-"d3/d4c/quick__sort__3_8cpp.html":[11,0,22,17],
-"d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda":[11,0,22,17,4],
-"d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792":[11,0,22,17,3],
-"d3/d4c/quick__sort__3_8cpp.html#a6eb67c2f91c98cf4464f75b5882022de":[11,0,22,17,2],
-"d3/d4c/quick__sort__3_8cpp.html#a9f59fe72dacc1f1218ef3c303d843168":[11,0,22,17,1],
-"d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,17,0],
-"d3/d4c/xor__cipher_8cpp.html":[11,0,2,9],
-"d3/d4c/xor__cipher_8cpp.html#a6099b7e0f1793f418d2c1befca8355a4":[11,0,2,9,0],
-"d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,2,9,3],
-"d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,9,2],
-"d3/d4c/xor__cipher_8cpp.html#aeff72a463ffc580c16cc849cbbdc58ef":[11,0,2,9,1],
-"d3/d61/vector__important__functions_8cpp.html":[11,0,17,25],
-"d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,25,0],
-"d3/d6d/namespacesimpson__method.html":[9,0,112],
-"d3/d7d/brute__force__string__searching_8cpp.html":[11,0,23,1],
-"d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123":[11,0,23,1,2],
-"d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,1,1],
-"d3/d7d/brute__force__string__searching_8cpp.html#aeb2cd81064717aedd62bfb096b1a73d8":[11,0,23,1,0],
-"d3/d80/z__function_8cpp.html":[11,0,23,7],
-"d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,23,7,2],
-"d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773":[11,0,23,7,3],
-"d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8":[11,0,23,7,0],
-"d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,7,1],
-"d3/d84/word__break_8cpp.html":[11,0,6,18],
-"d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81":[11,0,6,18,1],
-"d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a":[11,0,6,18,0],
-"d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,18,3],
-"d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,18,2],
-"d3/d84/word__break_8cpp.html#afe4dcd6fd5282e535685361cba645d7c":[11,0,6,18,4],
-"d3/d91/namespacestrassens__multiplication.html":[9,0,120],
-"d3/d92/pancake__sort_8cpp.html":[11,0,22,14],
-"d3/d92/pancake__sort_8cpp.html#a99e27ad84ad43df9977776b1a8d5416e":[11,0,22,14,2],
-"d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,14,3],
-"d3/d92/pancake__sort_8cpp.html#abff90bc0f54e4f8ea5f0330471781bd5":[11,0,22,14,1],
-"d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,14,0],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html":[10,0,2,6,1],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f":[10,0,2,6,1,4],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d":[10,0,2,6,1,6],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805":[10,0,2,6,1,9],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a273511e84a5243ffffe81be28bd24855":[10,0,2,6,1,0],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165":[10,0,2,6,1,11],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36":[10,0,2,6,1,21],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9":[10,0,2,6,1,8],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9":[10,0,2,6,1,16],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11":[10,0,2,6,1,13],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4":[10,0,2,6,1,14],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36":[10,0,2,6,1,2],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e":[10,0,2,6,1,3],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd":[10,0,2,6,1,17],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a936bb546e6a94d8b9d35b30ee1bb291a":[10,0,2,6,1,18],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aa7e5e00033f38006a224f30bdbf3f703":[10,0,2,6,1,5],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9":[10,0,2,6,1,19],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657":[10,0,2,6,1,1],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95":[10,0,2,6,1,10],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e":[10,0,2,6,1,7],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9":[10,0,2,6,1,15],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3":[10,0,2,6,1,20],
-"d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be":[10,0,2,6,1,12],
-"d3/da1/namespacen__queens.html":[9,0,81],
-"d3/dae/dsu__path__compression_8cpp.html":[11,0,4,7],
-"d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae":[11,0,4,7,3],
-"d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,7,1],
-"d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243":[11,0,4,7,2],
-"d3/db0/namespacelinked__list.html":[9,0,63],
-"d3/db2/boyer__moore_8cpp.html":[11,0,23,0],
-"d3/db2/boyer__moore_8cpp.html#a056122c8fe8fb0f5fca6428d3f7b5c3a":[11,0,23,0,6],
-"d3/db2/boyer__moore_8cpp.html#a0b165af1dc341289fd705be4c67728f8":[11,0,23,0,5],
-"d3/db2/boyer__moore_8cpp.html#a15703b553faed0d28202c10808cf9738":[11,0,23,0,9],
-"d3/db2/boyer__moore_8cpp.html#a2f6688c9bb3e692297a3aa09cebc1c00":[11,0,23,0,3],
-"d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,23,0,10],
-"d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd":[11,0,23,0,1],
-"d3/db2/boyer__moore_8cpp.html#aa709cf7fca02b7d3e1888423d5f739a1":[11,0,23,0,4],
-"d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2":[11,0,23,0,8],
-"d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9":[11,0,23,0,2],
-"d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,0,7],
-"d3/db3/lru__cache_8cpp.html":[11,0,17,11],
-"d3/db3/lru__cache_8cpp.html#a01ec21fc91ddafd964ae2035ba7892c0":[11,0,17,11,6],
-"d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058":[11,0,17,11,1],
-"d3/db3/lru__cache_8cpp.html#a4b02e288a407876a8d6024f98a2a25ec":[11,0,17,11,5],
-"d3/db3/lru__cache_8cpp.html#a6401e8f2d41d8cc9cd0e52ab381608d4":[11,0,17,11,4],
-"d3/db3/lru__cache_8cpp.html#a6a3be6d8871b1f5dc03688da8f3ee9e6":[11,0,17,11,3],
-"d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,11,2],
-"d3/dbb/class_cycle_check.html":[10,0,28],
-"d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b":[10,0,28,2],
-"d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5":[10,0,28,0],
-"d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474":[10,0,28,1],
-"d3/dc9/namespacefibonacci__sum.html":[9,0,32],
-"d3/dce/linkedlist__implentation__usingarray_8cpp.html":[11,0,4,10],
-"d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02":[11,0,4,10,1],
-"d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be":[11,0,4,10,2],
-"d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,10,4],
-"d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c":[11,0,4,10,5],
-"d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df":[11,0,4,10,3],
-"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html":[1],
-"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md10":[1,5],
-"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md11":[1,5,0],
-"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md12":[1,5,1],
-"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md13":[1,5,2],
-"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md14":[1,5,3],
-"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md15":[1,6],
-"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md5":[1,0],
-"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md6":[1,1],
-"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md7":[1,2],
-"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md8":[1,3],
-"d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md9":[1,4],
-"d3/deb/namespaceshortest__common__supersequence.html":[9,0,110],
-"d3/df9/recursive__bubble__sort_8cpp.html":[11,0,22,21],
-"d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,21,2],
-"d3/df9/recursive__bubble__sort_8cpp.html#ae3a775d99dbbb94c130a973df0cfddcf":[11,0,22,21,1],
-"d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,21,0],
-"d3/dfe/horspool_8cpp.html":[11,0,23,3],
-"d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336":[11,0,23,3,0],
-"d3/dfe/horspool_8cpp.html#a9884bca75ce39c116697ea2574adb37d":[11,0,23,3,1],
-"d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,23,3,3],
-"d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,3,2],
-"d3/dfe/perimeter_8cpp.html":[11,0,14,43],
-"d3/dfe/perimeter_8cpp.html#a0efb235330ff48e14fd31faaccbcebb3":[11,0,14,43,5],
-"d3/dfe/perimeter_8cpp.html#a1d4df7a4e43a2eac1acc0ac610487c73":[11,0,14,43,2],
-"d3/dfe/perimeter_8cpp.html#a3d1e4db743b189f309327572663415f3":[11,0,14,43,9],
-"d3/dfe/perimeter_8cpp.html#a428769a16e9525e56588d7c7709d25a6":[11,0,14,43,6],
-"d3/dfe/perimeter_8cpp.html#a8998ca7b1886d1d7d00aef3b457a9b1b":[11,0,14,43,1],
-"d3/dfe/perimeter_8cpp.html#a9236348755183644f1225e162d01ab14":[11,0,14,43,7],
-"d3/dfe/perimeter_8cpp.html#aa8592c3279c41a2c6d4d64eeb488f63f":[11,0,14,43,4],
-"d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,43,8],
-"d3/dfe/perimeter_8cpp.html#ad0acf82b7bc920182bf8322d1e103953":[11,0,14,43,0],
-"d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,43,3],
-"d4/d08/sha256_8cpp.html":[11,0,12,6],
-"d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27":[11,0,12,6,1],
-"d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a":[11,0,12,6,2],
-"d4/d08/sha256_8cpp.html#a55475649a2bb7aae15de0716a217f43a":[11,0,12,6,7],
-"d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da":[11,0,12,6,4],
-"d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c":[11,0,12,6,6],
-"d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,12,6,5],
-"d4/d08/sha256_8cpp.html#af9b52eba85d23e309035354141259f27":[11,0,12,6,8],
-"d4/d08/sha256_8cpp.html#afea411191ec5281f43e91ea327984627":[11,0,12,6,3],
-"d4/d0c/namespacestd_1_1chrono.html":[9,0,118,0],
-"d4/d0e/classdata__structures_1_1linked__list_1_1_node.html":[10,0,2,0,2],
-"d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e":[10,0,2,0,2,0],
-"d4/d0f/namespacegram__schmidt.html":[9,0,38],
-"d4/d12/namespace_minimum.html":[9,0,75],
-"d4/d13/namespacebidirectional__dijkstra.html":[9,0,7],
-"d4/d18/composite__simpson__rule_8cpp.html":[11,0,15,3],
-"d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442":[11,0,15,3,2],
-"d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e":[11,0,15,3,5],
-"d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad":[11,0,15,3,1],
-"d4/d18/composite__simpson__rule_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,15,3,4],
-"d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397":[11,0,15,3,0],
-"d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a":[11,0,15,3,3],
-"d4/d1c/namespacehamming__distance.html":[9,0,44],
-"d4/d21/least__common__multiple_8cpp.html":[11,0,14,32],
-"d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,14,32,3],
-"d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563":[11,0,14,32,0],
-"d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25":[11,0,14,32,1],
-"d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,32,2],
-"d4/d32/fibonacci__fast_8cpp.html":[11,0,14,16],
-"d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326":[11,0,14,16,0],
-"d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f":[11,0,14,16,1],
-"d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,16,2],
-"d4/d32/inorder__successor__of__bst_8cpp.html":[11,0,16,3],
-"d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9":[11,0,16,3,8],
-"d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,16,3,7],
-"d4/d32/inorder__successor__of__bst_8cpp.html#a3923fb22b46e085376703cae0b44d690":[11,0,16,3,4],
-"d4/d32/inorder__successor__of__bst_8cpp.html#a3ae0bea4123fd2ce155108e88f2ef78c":[11,0,16,3,6],
-"d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4":[11,0,16,3,10],
-"d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db":[11,0,16,3,3],
-"d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589":[11,0,16,3,2],
-"d4/d32/inorder__successor__of__bst_8cpp.html#a7f6f73a33beec448c27cc1d70b220702":[11,0,16,3,9],
-"d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95":[11,0,16,3,5],
-"d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,3,11],
-"d4/d38/namespacecount__bits__flip.html":[9,0,15],
-"d4/d38/power__of__two_8cpp.html":[11,0,14,45],
-"d4/d38/power__of__two_8cpp.html#a8a48be4d7f14e34c5c92925bc1cbf3bb":[11,0,14,45,1],
-"d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,45,2],
-"d4/d38/power__of__two_8cpp.html#adfd6be45be425ae28c62ce3bfb4b40dc":[11,0,14,45,3],
-"d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,45,0],
-"d4/d39/group__open__addressing.html":[8,0],
-"d4/d3e/k__nearest__neighbors_8cpp.html":[11,0,13,1],
-"d4/d3e/k__nearest__neighbors_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,13,1,2],
-"d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,13,1,3],
-"d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69":[11,0,13,1,1]
+"d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53":[11,0,22,13,3],
+"d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,13,6],
+"d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2":[11,0,22,13,4],
+"d5/d45/sublist__search_8cpp_source.html":[11,0,22,13],
+"d5/d4c/group__sorting.html":[8,3],
+"d5/d4c/group__sorting.html#ga0a9a57a1f1bbba3d4822531d002b7e07":[8,3,8],
+"d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72":[8,3,3],
+"d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f":[8,3,4],
+"d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73":[8,3,6],
+"d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d":[8,3,9],
+"d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7":[8,3,7],
+"d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4":[8,3,5],
+"d5/d58/class_test_cases.html":[10,0,57],
+"d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e":[10,0,57,0],
+"d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e":[10,0,57,1],
+"d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e":[10,0,57,2],
+"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[10,0,57,9],
+"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[10,0,57,10],
+"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[10,0,57,11],
+"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[10,0,57,6],
+"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[10,0,57,7],
+"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[10,0,57,8],
+"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[10,0,57,12],
+"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[10,0,57,13],
+"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[10,0,57,14],
+"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[10,0,57,3],
+"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[10,0,57,4],
+"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[10,0,57,5],
+"d5/d58/persistent__seg__tree__lazy__prop_8cpp.html":[11,0,20,3],
+"d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,20,3,3],
+"d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,3,2],
+"d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.html":[11,0,20,3],
+"d5/d5f/namespacegeometry.html":[9,0,37],
+"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html":[9,0,101,1,0],
+"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html":[10,0,16,2,0],
+"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088":[9,0,101,1,0,0],
+"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088":[10,0,16,2,0,0],
+"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf":[9,0,101,1,0,1],
+"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf":[10,0,16,2,0,1],
+"d5/d67/bayes__theorem_8cpp.html":[11,0,19,1],
+"d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba":[11,0,19,1,0],
+"d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f":[11,0,19,1,1],
+"d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,19,1,2],
+"d5/d67/bayes__theorem_8cpp_source.html":[11,0,19,1],
+"d5/d67/complex__numbers_8cpp.html":[11,0,14,9],
+"d5/d67/complex__numbers_8cpp.html#a44d5f25b573e870accdf26fd32b8484d":[11,0,14,9,3],
+"d5/d67/complex__numbers_8cpp.html#a5a73e9d4e68af8cedb95bd0864054b89":[11,0,14,9,4],
+"d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0":[11,0,14,9,1],
+"d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,14,9,5],
+"d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,9,2],
+"d5/d67/complex__numbers_8cpp_source.html":[11,0,14,9],
+"d5/d7a/largest__power_8cpp.html":[11,0,14,31],
+"d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,31,2],
+"d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,31,1],
+"d5/d7a/largest__power_8cpp.html#afa39ec943a4836c878e1614fd89b146f":[11,0,14,31,0],
+"d5/d7a/largest__power_8cpp_source.html":[11,0,14,31],
+"d5/d82/edit__distance_8cpp_source.html":[11,0,6,8],
+"d5/d83/lcm__sum_8cpp.html":[11,0,14,32],
+"d5/d83/lcm__sum_8cpp.html#a04065193d190d605e1f0d0d93a87e244":[11,0,14,32,0],
+"d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,32,2],
+"d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,32,1],
+"d5/d83/lcm__sum_8cpp_source.html":[11,0,14,32],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html":[4],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46":[4,0],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47":[4,1],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48":[4,2],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49":[4,3],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50":[4,4],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51":[4,5],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52":[4,6],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53":[4,7],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54":[4,8],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55":[4,9],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56":[4,10],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57":[4,11],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58":[4,12],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59":[4,13],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60":[4,14],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61":[4,15],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62":[4,16],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63":[4,17],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64":[4,18],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md65":[4,19],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md66":[4,20],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md67":[4,21],
+"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md68":[4,22],
+"d5/d89/namespacepalindrome__partitioning.html":[9,0,89],
+"d5/d8a/classothers_1_1postfix__expression_1_1_stack.html":[10,0,13,3,0],
+"d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#a6ae98710503b894b843d01cb69d5490c":[10,0,13,3,0,1],
+"d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#af06360122e20ce2ba32c574a27a20ba1":[10,0,13,3,0,0],
+"d5/d8a/trie__using__hashmap_8cpp.html":[11,0,4,39],
+"d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,4,39,3],
+"d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,39,2],
+"d5/d8a/trie__using__hashmap_8cpp_source.html":[11,0,4,39],
+"d5/d8e/huffman_8cpp_source.html":[11,0,11,5],
+"d5/d90/palindrome__partitioning_8cpp.html":[11,0,6,22],
+"d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a":[11,0,6,22,1],
+"d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,22,2],
+"d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,22,0],
+"d5/d90/palindrome__partitioning_8cpp_source.html":[11,0,6,22],
+"d5/d91/namespacesorting.html":[8,3,2],
+"d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd":[9,0,113,0],
+"d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3":[9,0,113,12],
+"d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420":[9,0,113,9],
+"d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5":[9,0,113,6],
+"d5/d91/namespacesorting.html#a27236b8d3df3832e1f1225576a122534":[9,0,113,10],
+"d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1":[9,0,113,2],
+"d5/d91/namespacesorting.html#a4d76603c54d3dc56146e92d10a043924":[9,0,113,19],
+"d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa":[9,0,113,18],
+"d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68":[9,0,113,5],
+"d5/d91/namespacesorting.html#a6eb67c2f91c98cf4464f75b5882022de":[9,0,113,14],
+"d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9":[9,0,113,4],
+"d5/d91/namespacesorting.html#a7bfe11bd4703eacd1dab93f25ec639c5":[9,0,113,20],
+"d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f":[9,0,113,3],
+"d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168":[9,0,113,13],
+"d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079":[9,0,113,7],
+"d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935":[9,0,113,1],
+"d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34":[9,0,113,11],
+"d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf":[9,0,113,16],
+"d5/d91/namespacesorting.html#ae97f4dd815654c4682f564afd718e824":[9,0,113,8],
+"d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331":[9,0,113,17],
+"d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd":[9,0,113,15],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html":[9,0,21,0,0],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html":[10,0,2,5,0],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425":[9,0,21,0,0,19],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425":[10,0,2,5,0,19],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c":[9,0,21,0,0,17],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c":[10,0,2,5,0,17],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04":[9,0,21,0,0,15],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04":[10,0,2,5,0,15],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683":[9,0,21,0,0,0],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683":[10,0,2,5,0,0],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f":[9,0,21,0,0,10],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f":[10,0,2,5,0,10],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c":[9,0,21,0,0,4],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c":[10,0,2,5,0,4],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29":[9,0,21,0,0,11],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29":[10,0,2,5,0,11],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4":[9,0,21,0,0,7],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4":[10,0,2,5,0,7],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723":[9,0,21,0,0,16],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723":[10,0,2,5,0,16],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec":[9,0,21,0,0,3],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec":[10,0,2,5,0,3],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469":[9,0,21,0,0,5],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469":[10,0,2,5,0,5],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7":[9,0,21,0,0,12],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7":[10,0,2,5,0,12],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69":[9,0,21,0,0,6],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69":[10,0,2,5,0,6],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126":[9,0,21,0,0,8],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126":[10,0,2,5,0,8],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f":[9,0,21,0,0,13],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f":[10,0,2,5,0,13],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039":[9,0,21,0,0,9],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039":[10,0,2,5,0,9],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2":[9,0,21,0,0,2],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2":[10,0,2,5,0,2],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887":[9,0,21,0,0,1],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887":[10,0,2,5,0,1],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c":[9,0,21,0,0,18],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c":[10,0,2,5,0,18],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919":[9,0,21,0,0,14],
+"d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919":[10,0,2,5,0,14],
+"d5/d96/md5_8cpp.html":[11,0,12,3],
+"d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425":[11,0,12,3,1],
+"d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689":[11,0,12,3,8],
+"d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef":[11,0,12,3,9],
+"d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb":[11,0,12,3,0],
+"d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,12,3,7],
+"d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348":[11,0,12,3,6],
+"d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661":[11,0,12,3,2],
+"d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d":[11,0,12,3,4],
+"d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,12,3,5],
+"d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446":[11,0,12,3,3],
+"d5/d96/md5_8cpp_source.html":[11,0,12,3],
+"d5/da1/structnode.html":[10,0,46],
+"d5/da7/namespacejarvis.html":[9,0,54],
+"d5/dab/structdata__structures_1_1list__array_1_1list.html":[10,0,2,1,0],
+"d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e":[10,0,2,1,0,4],
+"d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180":[10,0,2,1,0,5],
+"d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf":[10,0,2,1,0,0],
+"d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6":[10,0,2,1,0,3],
+"d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1":[10,0,2,1,0,1],
+"d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9":[10,0,2,1,0,2],
+"d5/db0/adaline__learning_8cpp.html":[8,1,0],
+"d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html":[10,0,12,1,0],
+"d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0":[10,0,12,1,0,2],
+"d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9ccef4c746b7226488b014f5bac4789a":[10,0,12,1,0,1],
+"d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2":[10,0,12,1,0,0],
+"d5/db5/set__kth__bit_8cpp.html":[11,0,1,8],
+"d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,8,2],
+"d5/db5/set__kth__bit_8cpp.html#ad4d0ffd9331242c42a28834ee19f5fd9":[11,0,1,8,1],
+"d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,8,0],
+"d5/db5/set__kth__bit_8cpp_source.html":[11,0,1,8],
+"d5/db8/namespacemincoins__topdown.html":[9,0,74],
+"d5/dc5/morrisinorder_8cpp_source.html":[11,0,4,14],
+"d5/dd0/namespacephysics.html":[9,0,91],
+"d5/ddb/bogo__sort_8cpp.html":[11,0,23,3],
+"d5/ddb/bogo__sort_8cpp.html#a7bfe11bd4703eacd1dab93f25ec639c5":[11,0,23,3,3],
+"d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,23,3,4],
+"d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,3,0],
+"d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859":[11,0,23,3,2],
+"d5/ddb/bogo__sort_8cpp.html#affc6ee160142cd017f8c4b213437d0fd":[11,0,23,3,1],
+"d5/ddb/bogo__sort_8cpp_source.html":[11,0,23,3],
+"d5/dec/classgraph_1_1topological__sort_1_1_graph.html":[10,0,6,1,0],
+"d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345":[10,0,6,1,0,1],
+"d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a5e84b175ef768ff58eaeededd43e8368":[10,0,6,1,0,2],
+"d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a75a849f80a66304e7da39b3ccd6129d6":[10,0,6,1,0,0],
+"d5/dec/classgraph_1_1topological__sort_1_1_graph.html#ad22018e4f4f80aecb0538044bb83d096":[10,0,6,1,0,3],
+"d5/def/stairs__pattern_8cpp.html":[11,0,17,24],
+"d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,24,0],
+"d5/def/stairs__pattern_8cpp_source.html":[11,0,17,24],
+"d5/df4/merge__sort_8cpp.html":[8,3,0],
+"d5/df6/check__amicable__pair_8cpp.html":[11,0,14,6],
+"d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,6,3],
+"d5/df6/check__amicable__pair_8cpp.html#a8e6eede206201db0d1dbb618fa969bec":[11,0,14,6,0],
+"d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,6,1],
+"d5/df6/check__amicable__pair_8cpp.html#af05567415a9ea36c254b54e3d5a2152a":[11,0,14,6,2],
+"d5/df6/check__amicable__pair_8cpp_source.html":[11,0,14,6],
+"d6/d02/file__linter_8py_source.html":[11,0,21,0],
+"d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html":[10,0,2,2,0],
+"d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622":[10,0,2,2,0,0],
+"d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e":[10,0,2,2,0,4],
+"d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663":[10,0,2,2,0,2],
+"d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631":[10,0,2,2,0,1],
+"d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85":[10,0,2,2,0,5],
+"d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d":[10,0,2,2,0,3],
+"d6/d05/reverse__a__linked__list_8cpp.html":[11,0,4,23],
+"d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511":[11,0,4,23,2],
+"d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,4,23,4],
+"d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,23,3],
+"d6/d05/reverse__a__linked__list_8cpp_source.html":[11,0,4,23],
+"d6/d0c/namespacehashing.html":[9,0,45],
+"d6/d10/cut__rod_8cpp.html":[11,0,6,7],
+"d6/d10/cut__rod_8cpp.html#a1cc523a30c18c63eac58220c3c494cfa":[11,0,6,7,1],
+"d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,7,2],
+"d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,7,0],
+"d6/d10/cut__rod_8cpp_source.html":[11,0,6,7],
+"d6/d1a/dnf__sort_8cpp.html":[11,0,23,12],
+"d6/d1a/dnf__sort_8cpp.html#a621767fe711db64fe57a2ac4987b11f0":[11,0,23,12,0],
+"d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,23,12,2],
+"d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,12,1],
+"d6/d1a/dnf__sort_8cpp_source.html":[11,0,23,12],
+"d6/d26/classciphers_1_1_hill_cipher.html":[9,0,13,1],
+"d6/d26/classciphers_1_1_hill_cipher.html":[10,0,1,1],
+"d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c":[9,0,13,1,8],
+"d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c":[10,0,1,1,8],
+"d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7":[9,0,13,1,9],
+"d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7":[10,0,1,1,9]
 };
diff --git a/navtreeindex5.js b/navtreeindex5.js
index 2e0e1c628..5e07af051 100644
--- a/navtreeindex5.js
+++ b/navtreeindex5.js
@@ -1,253 +1,253 @@
 var NAVTREEINDEX5 =
 {
-"d4/d3e/n__queens_8cpp.html":[11,0,0,4],
-"d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb":[11,0,0,4,3],
-"d4/d3e/n__queens_8cpp.html#a40ae0c7fd04eb20e7f3bff13fc6a5808":[11,0,0,4,2],
-"d4/d3e/n__queens_8cpp.html#a5730b6683f6adcf5c5ef75cf53dc7160":[11,0,0,4,0],
-"d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,4,1],
-"d4/d45/gcd__recursive__euclidean_8cpp.html":[11,0,14,23],
-"d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e":[11,0,14,23,0],
-"d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,23,1],
-"d4/d48/hamming__distance_8cpp.html":[11,0,1,4],
-"d4/d48/hamming__distance_8cpp.html#a40ba9fe8b5df5c268f0c7d677ff2fe80":[11,0,1,4,1],
-"d4/d48/hamming__distance_8cpp.html#a65d845df3fecff7087a2126c7b72030b":[11,0,1,4,0],
-"d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,4,4],
-"d4/d48/hamming__distance_8cpp.html#abfe6fbb2f3460a2623c96f283178a07a":[11,0,1,4,2],
-"d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,4,3],
-"d4/d4f/stooge__sort_8cpp.html":[11,0,22,24],
-"d4/d4f/stooge__sort_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,22,24,3],
-"d4/d4f/stooge__sort_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,22,24,2],
-"d4/d4f/stooge__sort_8cpp.html#a6d0455dd5c30adda100e95f0423c786e":[11,0,22,24,4],
-"d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b":[11,0,22,24,1],
-"d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,24,0],
-"d4/d68/qr__decompose_8h.html":[11,0,15,18],
-"d4/d68/qr__decompose_8h.html#a257425cb2365359da51c6fe6741834d8":[11,0,15,18,1],
-"d4/d68/qr__decompose_8h.html#a6d3c7dce1f142141f509d09f6c0e25dc":[11,0,15,18,5],
-"d4/d68/qr__decompose_8h.html#a73ce637634fc49e1d10d190eb388ebf1":[11,0,15,18,2],
-"d4/d68/qr__decompose_8h.html#a8ea313a1a1b5f9d0e3e332c29c6446ec":[11,0,15,18,3],
-"d4/d68/qr__decompose_8h.html#ad16da2183db22378435042f26af43d5f":[11,0,15,18,4],
-"d4/d68/qr__decompose_8h.html#adfbdf47277c8cfee229b05b72f1f7834":[11,0,15,18,0],
-"d4/d68/qr__decompose_8h_source.html":[11,0,15,18],
-"d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html":[11,0,11,1],
-"d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a2311b22324cf09926726e4ce1309af8b":[11,0,11,1,3],
-"d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,11,1,4],
-"d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59":[11,0,11,1,0],
-"d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84":[11,0,11,1,1],
-"d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,1,2],
-"d4/d7a/shell__sort2_8cpp.html":[11,0,22,23],
-"d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,22,23,1],
-"d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d":[11,0,22,23,7],
-"d4/d7a/shell__sort2_8cpp.html#a4d76603c54d3dc56146e92d10a043924":[11,0,22,23,4],
-"d4/d7a/shell__sort2_8cpp.html#a5669396c6a6b1e14b97589b6e37980aa":[11,0,22,23,3],
-"d4/d7a/shell__sort2_8cpp.html#a63aaff7cabfa3da2da8b9477b5fad9d6":[11,0,22,23,6],
-"d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c":[11,0,22,23,0],
-"d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e":[11,0,22,23,8],
-"d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246":[11,0,22,23,5],
-"d4/d7a/shell__sort2_8cpp.html#af2c5b92cbfe73f63f6074c61b0a45331":[11,0,22,23,2],
-"d4/d83/sum__of__digits_8cpp.html":[11,0,14,55],
-"d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,14,55,4],
-"d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,14,55,3],
-"d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395":[11,0,14,55,1],
-"d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,14,55,2],
-"d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,55,0],
-"d4/d86/large__number_8h.html":[11,0,14,29],
-"d4/d86/large__number_8h_source.html":[11,0,14,29],
-"d4/d8d/jarvis__algorithm_8cpp.html":[11,0,8,1],
-"d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,8,1,3],
-"d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,8,1,2],
-"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html":[11,0,1,8],
-"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,8,1],
-"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1":[11,0,1,8,2],
-"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,8,0],
-"d4/d90/classdata__structures_1_1_skip_list.html":[9,0,21,5],
-"d4/d90/classdata__structures_1_1_skip_list.html":[10,0,2,12],
-"d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650":[9,0,21,5,7],
-"d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650":[10,0,2,12,7],
-"d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9":[9,0,21,5,3],
-"d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9":[10,0,2,12,3],
-"d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4":[9,0,21,5,0],
-"d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4":[10,0,2,12,0],
-"d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c":[9,0,21,5,2],
-"d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c":[10,0,2,12,2],
-"d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0":[9,0,21,5,1],
-"d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0":[10,0,2,12,1],
-"d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4":[9,0,21,5,4],
-"d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4":[10,0,2,12,4],
-"d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16":[9,0,21,5,6],
-"d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16":[10,0,2,12,6],
-"d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4":[9,0,21,5,5],
-"d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4":[10,0,2,12,5],
-"d4/d91/namespacevector__cross.html":[9,0,137],
-"d4/d9c/primes__up__to__billion_8cpp.html":[11,0,14,48],
-"d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c":[11,0,14,48,1],
-"d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95":[11,0,14,48,2],
-"d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,48,0],
-"d4/d9d/sum__of__binomial__coefficient_8cpp.html":[11,0,14,54],
-"d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,54,2],
-"d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae1ca505751f5a6d3977b86372cfe75ea":[11,0,14,54,0],
-"d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,54,1],
-"d4/d9f/selection__sort__recursive_8cpp.html":[11,0,22,22],
-"d4/d9f/selection__sort__recursive_8cpp.html#a5454eeb691725ccac0f59df1e133f834":[11,0,22,22,0],
-"d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,22,3],
-"d4/d9f/selection__sort__recursive_8cpp.html#ab6f7b33a070e376e1f4374e534435e89":[11,0,22,22,2],
-"d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,22,1],
-"d4/da0/gcd__iterative__euclidean_8cpp.html":[11,0,14,21],
-"d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e":[11,0,14,21,0],
-"d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,21,1],
-"d4/da0/kadane_8cpp.html":[11,0,6,7],
-"d4/da0/kadane_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,7,0],
-"d4/da0/kadane_8cpp.html#af3029007a422a914a85c0b0122f1c7b4":[11,0,6,7,1],
-"d4/db4/struct_segment_intersection.html":[10,0,52],
-"d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf":[10,0,52,1],
-"d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655":[10,0,52,0],
-"d4/db6/reverse__binary__tree_8cpp.html":[11,0,16,5],
-"d4/db6/reverse__binary__tree_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,5,4],
-"d4/db6/reverse__binary__tree_8cpp.html#aa515639572647508b94986489aab6d76":[11,0,16,5,6],
-"d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,5,3],
-"d4/db6/reverse__binary__tree_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669":[11,0,16,5,5],
-"d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,16,5,2],
-"d4/db8/longest__substring__without__repeating__characters_8cpp.html":[11,0,17,10],
-"d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,17,10,2],
-"d4/db8/longest__substring__without__repeating__characters_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,10,1],
-"d4/db9/namespacencr__modulo__p.html":[9,0,84],
-"d4/dcd/namespacecircular__linked__list.html":[9,0,14],
-"d4/dd2/namespacequadratic__probing.html":[8,0,2],
-"d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9":[9,0,96,1],
-"d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a":[9,0,96,10],
-"d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7":[9,0,96,5],
-"d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768":[9,0,96,2],
-"d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357":[9,0,96,3],
-"d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d":[9,0,96,4],
-"d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30":[9,0,96,9],
-"d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf":[9,0,96,7],
-"d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486":[9,0,96,8],
-"d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b":[9,0,96,6],
-"d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6":[9,0,96,11],
-"d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html":[10,0,5,1,0],
-"d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c":[10,0,5,1,0,2],
-"d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870":[10,0,5,1,0,0],
-"d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1":[10,0,5,1,0,1],
-"d4/de6/namespacepostfix__expression.html":[9,0,92],
-"d4/ded/namespaceprobability.html":[9,0,94],
-"d4/def/kohonen__som__topology_8cpp.html":[8,1,1],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html":[10,0,10,2,1],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a173bb71780af6953ec2e307a4c74b025":[10,0,10,2,1,5],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a176b955c90ae57d7dbc3c63f27c84c75":[10,0,10,2,1,3],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0":[10,0,10,2,1,10],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2c49bfebf9b859d5ceb26035d3003601":[10,0,10,2,1,15],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b":[10,0,10,2,1,6],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a36494e26ff36d6e15c1022bb9a1ee848":[10,0,10,2,1,9],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f":[10,0,10,2,1,17],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4c4c6f63ab965317f9471518ee931b89":[10,0,10,2,1,0],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4f14e473bb0722c6490b9dc8da5982aa":[10,0,10,2,1,16],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff":[10,0,10,2,1,11],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58a9614e4c6d4ca672d3358e99a3404f":[10,0,10,2,1,14],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58ed20abf6ce3744535bd8b5bb9e741b":[10,0,10,2,1,13],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931":[10,0,10,2,1,18],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a62151b0398a2536be60d950e10ffe9a8":[10,0,10,2,1,2],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d":[10,0,10,2,1,12],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a88bf9023ab3d4cdb61cf707c7cdfc86b":[10,0,10,2,1,7],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a8973f687738ddd76f93b5562feae4027":[10,0,10,2,1,4],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ae7cf126a3a8f9d20c81b21584d061a08":[10,0,10,2,1,1],
-"d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e":[10,0,10,2,1,8],
-"d4/dfb/namespacecycle__sort.html":[9,0,20],
-"d5/d02/namespacehorspool.html":[9,0,47],
-"d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html":[10,0,2,7,0,0],
-"d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a08212cdc99164b59da91b81f45e2f88e":[10,0,2,7,0,0,0],
-"d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a3cdb077745d3dc97212d693132371219":[10,0,2,7,0,0,1],
-"d5/d15/classcll.html":[10,0,24],
-"d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html":[11,0,1,5],
-"d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#a4b76571a2a04fa99c30a96eca9997f0e":[11,0,1,5,1],
-"d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,5,2],
-"d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,5,0],
-"d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html":[9,0,118,9],
-"d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html":[10,0,19,4],
-"d5/d29/struct_min_heap_node.html":[10,0,43],
-"d5/d2c/namespacelayers.html":[9,0,60],
-"d5/d33/gram__schmidt_8cpp.html":[11,0,15,9],
-"d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5":[11,0,15,9,2],
-"d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc":[11,0,15,9,4],
-"d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,15,9,5],
-"d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d":[11,0,15,9,1],
-"d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,9,3],
-"d5/d33/gram__schmidt_8cpp.html#ae6b496dce691e04f7f95ba0f0d33a289":[11,0,15,9,0],
-"d5/d39/namespaceactivations.html":[9,0,2],
-"d5/d3c/namespacedata__structures.html":[9,0,21],
-"d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4":[9,0,21,8],
-"d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15":[9,0,21,11],
-"d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61":[9,0,21,13],
-"d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c":[9,0,21,10],
-"d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677":[9,0,21,9],
-"d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a":[9,0,21,12],
-"d5/d45/sublist__search_8cpp.html":[11,0,21,11],
-"d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,21,11,2],
-"d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c":[11,0,21,11,5],
-"d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53":[11,0,21,11,3],
-"d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,21,11,6],
-"d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2":[11,0,21,11,4],
-"d5/d4c/group__sorting.html":[8,3],
-"d5/d4c/group__sorting.html#ga0a9a57a1f1bbba3d4822531d002b7e07":[8,3,8],
-"d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72":[8,3,3],
-"d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f":[8,3,4],
-"d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73":[8,3,6],
-"d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d":[8,3,9],
-"d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7":[8,3,7],
-"d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4":[8,3,5],
-"d5/d58/class_test_cases.html":[10,0,57],
-"d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e":[10,0,57,0],
-"d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e":[10,0,57,1],
-"d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e":[10,0,57,2],
-"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[10,0,57,9],
-"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[10,0,57,10],
-"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[10,0,57,11],
-"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[10,0,57,6],
-"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[10,0,57,7],
-"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[10,0,57,8],
-"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[10,0,57,12],
-"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[10,0,57,13],
-"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[10,0,57,14],
-"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[10,0,57,3],
-"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[10,0,57,4],
-"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[10,0,57,5],
-"d5/d58/persistent__seg__tree__lazy__prop_8cpp.html":[11,0,20,2],
-"d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,20,2,3],
-"d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,2,2],
-"d5/d5f/namespacegeometry.html":[9,0,37],
-"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html":[9,0,101,1,0],
-"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html":[10,0,16,2,0],
-"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088":[9,0,101,1,0,0],
-"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088":[10,0,16,2,0,0],
-"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf":[9,0,101,1,0,1],
-"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf":[10,0,16,2,0,1],
-"d5/d67/bayes__theorem_8cpp.html":[11,0,19,1],
-"d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba":[11,0,19,1,0],
-"d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f":[11,0,19,1,1],
-"d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,19,1,2],
-"d5/d67/complex__numbers_8cpp.html":[11,0,14,8],
-"d5/d67/complex__numbers_8cpp.html#a44d5f25b573e870accdf26fd32b8484d":[11,0,14,8,3],
-"d5/d67/complex__numbers_8cpp.html#a5a73e9d4e68af8cedb95bd0864054b89":[11,0,14,8,4],
-"d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0":[11,0,14,8,1],
-"d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,14,8,5],
-"d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,8,2],
-"d5/d7a/largest__power_8cpp.html":[11,0,14,30],
-"d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,30,2],
-"d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,30,1],
-"d5/d7a/largest__power_8cpp.html#afa39ec943a4836c878e1614fd89b146f":[11,0,14,30,0],
-"d5/d83/lcm__sum_8cpp.html":[11,0,14,31],
-"d5/d83/lcm__sum_8cpp.html#a04065193d190d605e1f0d0d93a87e244":[11,0,14,31,0],
-"d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,31,2],
-"d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,31,1],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html":[4],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46":[4,0],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47":[4,1],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48":[4,2],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49":[4,3],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50":[4,4],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51":[4,5],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52":[4,6],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53":[4,7],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54":[4,8],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55":[4,9],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56":[4,10],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57":[4,11]
+"d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5":[9,0,13,1,6],
+"d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5":[10,0,1,1,6],
+"d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b":[9,0,13,1,1],
+"d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b":[10,0,1,1,1],
+"d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9":[9,0,13,1,12],
+"d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9":[10,0,1,1,12],
+"d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e":[9,0,13,1,5],
+"d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e":[10,0,1,1,5],
+"d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395":[9,0,13,1,11],
+"d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395":[10,0,1,1,11],
+"d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0":[9,0,13,1,3],
+"d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0":[10,0,1,1,3],
+"d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917":[9,0,13,1,2],
+"d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917":[10,0,1,1,2],
+"d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706":[9,0,13,1,4],
+"d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706":[10,0,1,1,4],
+"d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590":[9,0,13,1,10],
+"d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590":[10,0,1,1,10],
+"d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa":[9,0,13,1,0],
+"d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa":[10,0,1,1,0],
+"d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41":[9,0,13,1,7],
+"d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41":[10,0,1,1,7],
+"d6/d26/house__robber_8cpp.html":[11,0,6,12],
+"d6/d26/house__robber_8cpp.html#a1e497c3e3f169afe5baaae6a5d40cbc8":[11,0,6,12,0],
+"d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,12,2],
+"d6/d26/house__robber_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,12,1],
+"d6/d26/house__robber_8cpp_source.html":[11,0,6,12],
+"d6/d2c/caesar__cipher_8cpp.html":[11,0,2,3],
+"d6/d2c/caesar__cipher_8cpp.html#a355e69511cd2006b5c4c80ae95b71056":[11,0,2,3,0],
+"d6/d2c/caesar__cipher_8cpp.html#ac3381121289548640b1c27a58a8524c3":[11,0,2,3,1],
+"d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,2,3,3],
+"d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,3,2],
+"d6/d2c/caesar__cipher_8cpp_source.html":[11,0,2,3],
+"d6/d2d/modular__inverse__simple_8cpp.html":[11,0,14,40],
+"d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6":[11,0,14,40,0],
+"d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,40,2],
+"d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,40,1],
+"d6/d2d/modular__inverse__simple_8cpp_source.html":[11,0,14,40],
+"d6/d2e/fenwick__tree_8cpp.html":[11,0,20,0],
+"d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,20,0,2],
+"d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,0,1],
+"d6/d2e/fenwick__tree_8cpp_source.html":[11,0,20,0],
+"d6/d30/classmachine__learning_1_1adaline.html":[9,0,66,0],
+"d6/d30/classmachine__learning_1_1adaline.html":[10,0,10,3],
+"d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325":[9,0,66,0,1],
+"d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325":[10,0,10,3,1],
+"d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c":[9,0,66,0,0],
+"d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c":[10,0,10,3,0],
+"d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda":[9,0,66,0,8],
+"d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda":[10,0,10,3,8],
+"d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492":[9,0,66,0,9],
+"d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492":[10,0,10,3,9],
+"d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5":[9,0,66,0,3],
+"d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5":[10,0,10,3,3],
+"d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91":[9,0,66,0,4],
+"d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91":[10,0,10,3,4],
+"d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3":[9,0,66,0,7],
+"d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3":[10,0,10,3,7],
+"d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3":[9,0,66,0,5],
+"d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3":[10,0,10,3,5],
+"d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56":[9,0,66,0,2],
+"d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56":[10,0,10,3,2],
+"d6/d30/classmachine__learning_1_1adaline.html#ae347040516e995c8fb8ca2e5c0496daa":[9,0,66,0,6],
+"d6/d30/classmachine__learning_1_1adaline.html#ae347040516e995c8fb8ca2e5c0496daa":[10,0,10,3,6],
+"d6/d38/find__non__repeating__number_8cpp.html":[11,0,1,3],
+"d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,3,2],
+"d6/d38/find__non__repeating__number_8cpp.html#ac5ca4c0be0967b4dd572507f50451ae3":[11,0,1,3,0],
+"d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,3,1],
+"d6/d38/find__non__repeating__number_8cpp_source.html":[11,0,1,3],
+"d6/d42/miller__rabin_8cpp.html":[11,0,14,36],
+"d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb":[11,0,14,36,4],
+"d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506":[11,0,14,36,2],
+"d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,14,36,5],
+"d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce":[11,0,14,36,1],
+"d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29":[11,0,14,36,3],
+"d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,36,0],
+"d6/d42/miller__rabin_8cpp_source.html":[11,0,14,36],
+"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html":[9,0,13,0,0],
+"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html":[10,0,1,0,0],
+"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446":[9,0,13,0,0,0],
+"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446":[10,0,1,0,0,0],
+"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#af2142b27241b28f835e8ce78d7d6463c":[9,0,13,0,0,1],
+"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#af2142b27241b28f835e8ce78d7d6463c":[10,0,1,0,0,1],
+"d6/d4a/addition__rule_8cpp.html":[11,0,19,0],
+"d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d":[11,0,19,0,1],
+"d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0":[11,0,19,0,0],
+"d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,19,0,2],
+"d6/d4a/addition__rule_8cpp_source.html":[11,0,19,0],
+"d6/d4e/easter_8cpp_source.html":[11,0,17,4],
+"d6/d4e/namespaceciphers.html":[9,0,13],
+"d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216":[9,0,13,2],
+"d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html":[12,1],
+"d6/d53/namespaceword__break.html":[9,0,142],
+"d6/d57/array__right__rotation_8cpp.html":[11,0,16,1],
+"d6/d57/array__right__rotation_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,1,4],
+"d6/d57/array__right__rotation_8cpp.html#a1bfb8711f49e591eb168ccaa3df6fb86":[11,0,16,1,2],
+"d6/d57/array__right__rotation_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d":[11,0,16,1,7],
+"d6/d57/array__right__rotation_8cpp.html#a6109193567a5b7e36a27f2b4865fce20":[11,0,16,1,1],
+"d6/d57/array__right__rotation_8cpp.html#aa515639572647508b94986489aab6d76":[11,0,16,1,6],
+"d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,1,3],
+"d6/d57/array__right__rotation_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669":[11,0,16,1,5],
+"d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,16,1,0],
+"d6/d57/array__right__rotation_8cpp.html#af7b81d7a1534216af6a36a80135beb86":[11,0,16,1,8],
+"d6/d57/array__right__rotation_8cpp_source.html":[11,0,16,1],
+"d6/d60/group__ode.html":[8,2],
+"d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723":[8,2,1],
+"d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985":[8,2,2],
+"d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089":[8,2,4],
+"d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f":[8,2,5],
+"d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812":[8,2,3],
+"d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9":[8,2,0],
+"d6/d74/library__sort_8cpp_source.html":[11,0,23,17],
+"d6/d74/namespacekadane.html":[9,0,56],
+"d6/d7a/golden__search__extrema_8cpp.html":[11,0,15,8],
+"d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70":[11,0,15,8,0],
+"d6/d7a/golden__search__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,15,8,4],
+"d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,15,8,3],
+"d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b":[11,0,15,8,1],
+"d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e":[11,0,15,8,5],
+"d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,8,2],
+"d6/d7a/golden__search__extrema_8cpp_source.html":[11,0,15,8],
+"d6/d80/double__hash__hash__table_8cpp.html":[11,0,12,1],
+"d6/d80/double__hash__hash__table_8cpp.html#a0d90726ed1de7b3d2ae261baed048003":[11,0,12,1,5],
+"d6/d80/double__hash__hash__table_8cpp.html#a1e901418c759627557eff359b8db38cd":[11,0,12,1,3],
+"d6/d80/double__hash__hash__table_8cpp.html#a28083ecac6eb94b643281875c8665931":[11,0,12,1,11],
+"d6/d80/double__hash__hash__table_8cpp.html#a29f543e2626bad58907661e1e45028a6":[11,0,12,1,12],
+"d6/d80/double__hash__hash__table_8cpp.html#a33968a1178289ab61445dd4000df7082":[11,0,12,1,7],
+"d6/d80/double__hash__hash__table_8cpp.html#a5d06e4598569526294f10104875f6824":[11,0,12,1,10],
+"d6/d80/double__hash__hash__table_8cpp.html#a79a9c914a6c68275b3640303d7faad8a":[11,0,12,1,1],
+"d6/d80/double__hash__hash__table_8cpp.html#a8f8ff4fb018e1bb32d67d8a1885d3200":[11,0,12,1,4],
+"d6/d80/double__hash__hash__table_8cpp.html#a9c652b2e467e5d250dfe3bed83b12560":[11,0,12,1,2],
+"d6/d80/double__hash__hash__table_8cpp.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b":[11,0,12,1,8],
+"d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,12,1,6],
+"d6/d80/double__hash__hash__table_8cpp.html#af4981819aae8bc7e7beeaef02615e30d":[11,0,12,1,9],
+"d6/d80/double__hash__hash__table_8cpp_source.html":[11,0,12,1],
+"d6/d84/classhashing_1_1sha256_1_1_hash.html":[10,0,8,0,0],
+"d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3":[10,0,8,0,0,1],
+"d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08":[10,0,8,0,0,0],
+"d6/d84/namespaceutils.html":[9,0,135],
+"d6/d8d/namespacemorse.html":[9,0,79],
+"d6/d9d/large__factorial_8cpp.html":[11,0,14,29],
+"d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,14,29,0],
+"d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8":[11,0,14,29,1],
+"d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa":[11,0,14,29,2],
+"d6/d9d/large__factorial_8cpp_source.html":[11,0,14,29],
+"d6/da2/namespacevigenere.html":[9,0,137],
+"d6/da9/odd__even__sort_8cpp_source.html":[11,0,23,22],
+"d6/dab/namespacetree__234.html":[9,0,131],
+"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html":[10,0,13,2,0],
+"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a09cbe562b0c396329607f5d388d57c9c":[10,0,13,2,0,7],
+"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a1aafd0444b410e0fcb66287e9954c893":[10,0,13,2,0,8],
+"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8":[10,0,13,2,0,5],
+"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4":[10,0,13,2,0,0],
+"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a5f33913e7ddfbb38062362e7bd859154":[10,0,13,2,0,6],
+"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2":[10,0,13,2,0,3],
+"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602":[10,0,13,2,0,4],
+"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933":[10,0,13,2,0,2],
+"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa4d6db56109af196ffc7e5f72bc9907c":[10,0,13,2,0,9],
+"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53":[10,0,13,2,0,1],
+"d6/db0/binomial__dist_8cpp.html":[11,0,19,2],
+"d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76":[11,0,19,2,4],
+"d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813":[11,0,19,2,0],
+"d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25":[11,0,19,2,1],
+"d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a":[11,0,19,2,6],
+"d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861":[11,0,19,2,3],
+"d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,19,2,5],
+"d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc":[11,0,19,2,2],
+"d6/db0/binomial__dist_8cpp_source.html":[11,0,19,2],
+"d6/db8/inv__sqrt_8cpp.html":[11,0,14,27],
+"d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97":[11,0,14,27,2],
+"d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,27,3],
+"d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52":[11,0,14,27,0],
+"d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,27,1],
+"d6/db8/inv__sqrt_8cpp_source.html":[11,0,14,27],
+"d6/dba/jump__game_8cpp.html":[11,0,11,6],
+"d6/dba/jump__game_8cpp.html#a33e3819aa9ffec0e380383c52603b502":[11,0,11,6,0],
+"d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,11,6,2],
+"d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,6,1],
+"d6/dba/jump__game_8cpp_source.html":[11,0,11,6],
+"d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html":[10,0,11,0,0],
+"d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a499df7a01bcd348345dc5a0ab79bb0e9":[10,0,11,0,0,2],
+"d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a738a5f59bb3560c81cdb7f43bcfe9fec":[10,0,11,0,0,3],
+"d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a94b07e7dc61d8d7a1e9c5a28988e72f9":[10,0,11,0,0,0],
+"d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#ab5744fa589f6a48f9fe7bca13dbe661f":[10,0,11,0,0,1],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html":[3],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md22":[3,0],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md23":[3,1],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md24":[3,1,0],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md25":[3,1,1],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md26":[3,1,2],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md27":[3,1,2,0],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28":[3,1,2,1],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29":[3,1,2,2],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30":[3,1,2,2,0],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31":[3,1,2,3],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32":[3,1,2,4],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33":[3,1,2,5],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34":[3,1,2,5,0],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35":[3,1,2,6],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36":[3,1,3],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md37":[3,1,3,0],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md38":[3,1,3,1],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md39":[3,1,3,2],
+"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md40":[3,1,3,3],
+"d6/dce/rabin__karp_8cpp.html":[11,0,24,6],
+"d6/dce/rabin__karp_8cpp.html#a21c673d56cbf67b1d2ee4d869185b7d9":[11,0,24,6,4],
+"d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe":[11,0,24,6,3],
+"d6/dce/rabin__karp_8cpp.html#a8fb0bc932ba8b582c9f4c71338d050f8":[11,0,24,6,2],
+"d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8":[11,0,24,6,0],
+"d6/dce/rabin__karp_8cpp.html#aebe07cea289a13142503d98be7df11fd":[11,0,24,6,1],
+"d6/dce/rabin__karp_8cpp.html#aed769d565b705a9b3e0eb1ec74088893":[11,0,24,6,5],
+"d6/dce/rabin__karp_8cpp_source.html":[11,0,24,6],
+"d6/dd3/ode__midpoint__euler_8cpp.html":[11,0,15,16],
+"d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,15,16,1],
+"d6/dd3/ode__midpoint__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f":[11,0,15,16,5],
+"d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe":[11,0,15,16,4],
+"d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b":[11,0,15,16,0],
+"d6/dd3/ode__midpoint__euler_8cpp_source.html":[11,0,15,16],
+"d6/dd6/namespacestring.html":[9,0,120],
+"d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632":[9,0,120,0],
+"d6/dd8/is__graph__bipartite_8cpp.html":[11,0,9,11],
+"d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,9,11,2],
+"d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,11,1],
+"d6/dd8/is__graph__bipartite_8cpp_source.html":[11,0,9,11],
+"d7/d00/list__array_8cpp.html":[11,0,4,13],
+"d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,4,13,2],
+"d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,13,1],
+"d7/d00/list__array_8cpp_source.html":[11,0,4,13],
+"d7/d07/bidirectional__dijkstra_8cpp.html":[11,0,9,0],
+"d7/d07/bidirectional__dijkstra_8cpp.html#a1b2df3d52a403ad46523ab90d3a723c1":[11,0,9,0,1],
+"d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6":[11,0,9,0,3],
+"d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c":[11,0,9,0,5],
+"d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,9,0,4],
+"d7/d07/bidirectional__dijkstra_8cpp.html#a69172365aebde9be1997157f6f80e0cf":[11,0,9,0,0],
+"d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,0,2],
+"d7/d07/bidirectional__dijkstra_8cpp_source.html":[11,0,9,0],
+"d7/d08/namespacegraph__coloring.html":[9,0,40],
+"d7/d0a/namespacetrie__using__hashmap.html":[9,0,133],
+"d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html":[6],
+"d7/d24/nqueen__print__all__solutions_8cpp.html":[11,0,0,7],
+"d7/d24/nqueen__print__all__solutions_8cpp.html#acc809c055f335011de0d9030034c7108":[11,0,0,7,2],
+"d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,7,1],
+"d7/d24/nqueen__print__all__solutions_8cpp.html#aea343d8a72a39c9a4c0fbcbc362f2648":[11,0,0,7,0],
+"d7/d24/nqueen__print__all__solutions_8cpp.html#aebd5e11fab6dab282efccfb61beb0bd9":[11,0,0,7,3],
+"d7/d24/nqueen__print__all__solutions_8cpp_source.html":[11,0,0,7],
+"d7/d35/matrix__exponentiation_8cpp.html":[11,0,17,14],
+"d7/d35/matrix__exponentiation_8cpp.html#a276c5a0e984cf60015b27252fe04fe6b":[11,0,17,14,2],
+"d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252":[11,0,17,14,5],
+"d7/d35/matrix__exponentiation_8cpp.html#a35b7c98af53ad2ec18658679ad7d43de":[11,0,17,14,7],
+"d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258":[11,0,17,14,0]
 };
diff --git a/navtreeindex6.js b/navtreeindex6.js
index d13397d98..e8373d3ef 100644
--- a/navtreeindex6.js
+++ b/navtreeindex6.js
@@ -1,253 +1,253 @@
 var NAVTREEINDEX6 =
 {
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58":[4,12],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59":[4,13],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60":[4,14],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61":[4,15],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62":[4,16],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63":[4,17],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64":[4,18],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md65":[4,19],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md66":[4,20],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md67":[4,21],
-"d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md68":[4,22],
-"d5/d89/namespacepalindrome__partitioning.html":[9,0,89],
-"d5/d8a/classothers_1_1postfix__expression_1_1_stack.html":[10,0,13,3,0],
-"d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#a6ae98710503b894b843d01cb69d5490c":[10,0,13,3,0,1],
-"d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#af06360122e20ce2ba32c574a27a20ba1":[10,0,13,3,0,0],
-"d5/d8a/trie__using__hashmap_8cpp.html":[11,0,4,25],
-"d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,4,25,3],
-"d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,25,2],
-"d5/d90/palindrome__partitioning_8cpp.html":[11,0,6,13],
-"d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a":[11,0,6,13,1],
-"d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,13,2],
-"d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,13,0],
-"d5/d91/namespacesorting.html":[8,3,2],
-"d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd":[9,0,113,0],
-"d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3":[9,0,113,12],
-"d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420":[9,0,113,9],
-"d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5":[9,0,113,6],
-"d5/d91/namespacesorting.html#a27236b8d3df3832e1f1225576a122534":[9,0,113,10],
-"d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1":[9,0,113,2],
-"d5/d91/namespacesorting.html#a4d76603c54d3dc56146e92d10a043924":[9,0,113,19],
-"d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa":[9,0,113,18],
-"d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68":[9,0,113,5],
-"d5/d91/namespacesorting.html#a6eb67c2f91c98cf4464f75b5882022de":[9,0,113,14],
-"d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9":[9,0,113,4],
-"d5/d91/namespacesorting.html#a7bfe11bd4703eacd1dab93f25ec639c5":[9,0,113,20],
-"d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f":[9,0,113,3],
-"d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168":[9,0,113,13],
-"d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079":[9,0,113,7],
-"d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935":[9,0,113,1],
-"d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34":[9,0,113,11],
-"d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf":[9,0,113,16],
-"d5/d91/namespacesorting.html#ae97f4dd815654c4682f564afd718e824":[9,0,113,8],
-"d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331":[9,0,113,17],
-"d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd":[9,0,113,15],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html":[9,0,21,0,0],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html":[10,0,2,5,0],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425":[9,0,21,0,0,19],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425":[10,0,2,5,0,19],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c":[9,0,21,0,0,17],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c":[10,0,2,5,0,17],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04":[9,0,21,0,0,15],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04":[10,0,2,5,0,15],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683":[9,0,21,0,0,0],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683":[10,0,2,5,0,0],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f":[9,0,21,0,0,10],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f":[10,0,2,5,0,10],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c":[9,0,21,0,0,4],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c":[10,0,2,5,0,4],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29":[9,0,21,0,0,11],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29":[10,0,2,5,0,11],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4":[9,0,21,0,0,7],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4":[10,0,2,5,0,7],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723":[9,0,21,0,0,16],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723":[10,0,2,5,0,16],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec":[9,0,21,0,0,3],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec":[10,0,2,5,0,3],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469":[9,0,21,0,0,5],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469":[10,0,2,5,0,5],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7":[9,0,21,0,0,12],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7":[10,0,2,5,0,12],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69":[9,0,21,0,0,6],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69":[10,0,2,5,0,6],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126":[9,0,21,0,0,8],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126":[10,0,2,5,0,8],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f":[9,0,21,0,0,13],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f":[10,0,2,5,0,13],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039":[9,0,21,0,0,9],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039":[10,0,2,5,0,9],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2":[9,0,21,0,0,2],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2":[10,0,2,5,0,2],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887":[9,0,21,0,0,1],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887":[10,0,2,5,0,1],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c":[9,0,21,0,0,18],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c":[10,0,2,5,0,18],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919":[9,0,21,0,0,14],
-"d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919":[10,0,2,5,0,14],
-"d5/d96/md5_8cpp.html":[11,0,12,3],
-"d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425":[11,0,12,3,1],
-"d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689":[11,0,12,3,8],
-"d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef":[11,0,12,3,9],
-"d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb":[11,0,12,3,0],
-"d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,12,3,7],
-"d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348":[11,0,12,3,6],
-"d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661":[11,0,12,3,2],
-"d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d":[11,0,12,3,4],
-"d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,12,3,5],
-"d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446":[11,0,12,3,3],
-"d5/da1/structnode.html":[10,0,46],
-"d5/da7/namespacejarvis.html":[9,0,54],
-"d5/dab/structdata__structures_1_1list__array_1_1list.html":[10,0,2,1,0],
-"d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e":[10,0,2,1,0,4],
-"d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180":[10,0,2,1,0,5],
-"d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf":[10,0,2,1,0,0],
-"d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6":[10,0,2,1,0,3],
-"d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1":[10,0,2,1,0,1],
-"d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9":[10,0,2,1,0,2],
-"d5/db0/adaline__learning_8cpp.html":[8,1,0],
-"d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html":[10,0,12,1,0],
-"d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0":[10,0,12,1,0,2],
-"d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9ccef4c746b7226488b014f5bac4789a":[10,0,12,1,0,1],
-"d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2":[10,0,12,1,0,0],
-"d5/db5/set__kth__bit_8cpp.html":[11,0,1,7],
-"d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,7,2],
-"d5/db5/set__kth__bit_8cpp.html#ad4d0ffd9331242c42a28834ee19f5fd9":[11,0,1,7,1],
-"d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,7,0],
-"d5/db8/namespacemincoins__topdown.html":[9,0,74],
-"d5/dd0/namespacephysics.html":[9,0,91],
-"d5/ddb/bogo__sort_8cpp.html":[11,0,22,1],
-"d5/ddb/bogo__sort_8cpp.html#a7bfe11bd4703eacd1dab93f25ec639c5":[11,0,22,1,3],
-"d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,22,1,4],
-"d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,1,0],
-"d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859":[11,0,22,1,2],
-"d5/ddb/bogo__sort_8cpp.html#affc6ee160142cd017f8c4b213437d0fd":[11,0,22,1,1],
-"d5/dec/classgraph_1_1topological__sort_1_1_graph.html":[10,0,6,1,0],
-"d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345":[10,0,6,1,0,1],
-"d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a5e84b175ef768ff58eaeededd43e8368":[10,0,6,1,0,2],
-"d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a75a849f80a66304e7da39b3ccd6129d6":[10,0,6,1,0,0],
-"d5/dec/classgraph_1_1topological__sort_1_1_graph.html#ad22018e4f4f80aecb0538044bb83d096":[10,0,6,1,0,3],
-"d5/def/stairs__pattern_8cpp.html":[11,0,17,23],
-"d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,23,0],
-"d5/df4/merge__sort_8cpp.html":[8,3,0],
-"d5/df6/check__amicable__pair_8cpp.html":[11,0,14,5],
-"d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,5,3],
-"d5/df6/check__amicable__pair_8cpp.html#a8e6eede206201db0d1dbb618fa969bec":[11,0,14,5,0],
-"d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,5,1],
-"d5/df6/check__amicable__pair_8cpp.html#af05567415a9ea36c254b54e3d5a2152a":[11,0,14,5,2],
-"d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html":[10,0,2,2,0],
-"d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622":[10,0,2,2,0,0],
-"d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e":[10,0,2,2,0,4],
-"d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663":[10,0,2,2,0,2],
-"d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631":[10,0,2,2,0,1],
-"d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85":[10,0,2,2,0,5],
-"d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d":[10,0,2,2,0,3],
-"d6/d05/reverse__a__linked__list_8cpp.html":[11,0,4,16],
-"d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511":[11,0,4,16,2],
-"d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,4,16,4],
-"d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,16,3],
-"d6/d0c/namespacehashing.html":[9,0,45],
-"d6/d10/cut__rod_8cpp.html":[11,0,6,5],
-"d6/d10/cut__rod_8cpp.html#a1cc523a30c18c63eac58220c3c494cfa":[11,0,6,5,1],
-"d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,5,2],
-"d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,5,0],
-"d6/d1a/dnf__sort_8cpp.html":[11,0,22,6],
-"d6/d1a/dnf__sort_8cpp.html#a621767fe711db64fe57a2ac4987b11f0":[11,0,22,6,0],
-"d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,6,2],
-"d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,6,1],
-"d6/d26/classciphers_1_1_hill_cipher.html":[9,0,13,1],
-"d6/d26/classciphers_1_1_hill_cipher.html":[10,0,1,1],
-"d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c":[9,0,13,1,8],
-"d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c":[10,0,1,1,8],
-"d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7":[9,0,13,1,9],
-"d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7":[10,0,1,1,9],
-"d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5":[9,0,13,1,6],
-"d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5":[10,0,1,1,6],
-"d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b":[9,0,13,1,1],
-"d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b":[10,0,1,1,1],
-"d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9":[9,0,13,1,12],
-"d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9":[10,0,1,1,12],
-"d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e":[9,0,13,1,5],
-"d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e":[10,0,1,1,5],
-"d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395":[9,0,13,1,11],
-"d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395":[10,0,1,1,11],
-"d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0":[9,0,13,1,3],
-"d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0":[10,0,1,1,3],
-"d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917":[9,0,13,1,2],
-"d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917":[10,0,1,1,2],
-"d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706":[9,0,13,1,4],
-"d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706":[10,0,1,1,4],
-"d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590":[9,0,13,1,10],
-"d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590":[10,0,1,1,10],
-"d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa":[9,0,13,1,0],
-"d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa":[10,0,1,1,0],
-"d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41":[9,0,13,1,7],
-"d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41":[10,0,1,1,7],
-"d6/d26/house__robber_8cpp.html":[11,0,6,6],
-"d6/d26/house__robber_8cpp.html#a1e497c3e3f169afe5baaae6a5d40cbc8":[11,0,6,6,0],
-"d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,6,2],
-"d6/d26/house__robber_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,6,1],
-"d6/d2c/caesar__cipher_8cpp.html":[11,0,2,2],
-"d6/d2c/caesar__cipher_8cpp.html#a355e69511cd2006b5c4c80ae95b71056":[11,0,2,2,0],
-"d6/d2c/caesar__cipher_8cpp.html#ac3381121289548640b1c27a58a8524c3":[11,0,2,2,1],
-"d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,2,2,3],
-"d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,2,2],
-"d6/d2d/modular__inverse__simple_8cpp.html":[11,0,14,38],
-"d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6":[11,0,14,38,0],
-"d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,38,2],
-"d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,38,1],
-"d6/d2e/fenwick__tree_8cpp.html":[11,0,20,0],
-"d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,20,0,2],
-"d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,0,1],
-"d6/d30/classmachine__learning_1_1adaline.html":[9,0,66,0],
-"d6/d30/classmachine__learning_1_1adaline.html":[10,0,10,3],
-"d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325":[9,0,66,0,1],
-"d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325":[10,0,10,3,1],
-"d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c":[9,0,66,0,0],
-"d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c":[10,0,10,3,0],
-"d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda":[9,0,66,0,8],
-"d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda":[10,0,10,3,8],
-"d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492":[9,0,66,0,9],
-"d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492":[10,0,10,3,9],
-"d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5":[9,0,66,0,3],
-"d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5":[10,0,10,3,3],
-"d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91":[9,0,66,0,4],
-"d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91":[10,0,10,3,4],
-"d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3":[9,0,66,0,7],
-"d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3":[10,0,10,3,7],
-"d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3":[9,0,66,0,5],
-"d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3":[10,0,10,3,5],
-"d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56":[9,0,66,0,2],
-"d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56":[10,0,10,3,2],
-"d6/d30/classmachine__learning_1_1adaline.html#ae347040516e995c8fb8ca2e5c0496daa":[9,0,66,0,6],
-"d6/d30/classmachine__learning_1_1adaline.html#ae347040516e995c8fb8ca2e5c0496daa":[10,0,10,3,6],
-"d6/d38/find__non__repeating__number_8cpp.html":[11,0,1,3],
-"d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,3,2],
-"d6/d38/find__non__repeating__number_8cpp.html#ac5ca4c0be0967b4dd572507f50451ae3":[11,0,1,3,0],
-"d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,3,1],
-"d6/d42/miller__rabin_8cpp.html":[11,0,14,34],
-"d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb":[11,0,14,34,4],
-"d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506":[11,0,14,34,2],
-"d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,14,34,5],
-"d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce":[11,0,14,34,1],
-"d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29":[11,0,14,34,3],
-"d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,34,0],
-"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html":[9,0,13,0,0],
-"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html":[10,0,1,0,0],
-"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446":[9,0,13,0,0,0],
-"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446":[10,0,1,0,0,0],
-"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#af2142b27241b28f835e8ce78d7d6463c":[9,0,13,0,0,1],
-"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#af2142b27241b28f835e8ce78d7d6463c":[10,0,1,0,0,1],
-"d6/d4a/addition__rule_8cpp.html":[11,0,19,0],
-"d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d":[11,0,19,0,1],
-"d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0":[11,0,19,0,0],
-"d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,19,0,2],
-"d6/d4e/namespaceciphers.html":[9,0,13],
-"d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216":[9,0,13,2],
-"d6/d50/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2math_2iterative_factorial_8cpp-example.html":[12,1],
-"d6/d53/namespaceword__break.html":[9,0,143],
-"d6/d57/array__right__rotation_8cpp.html":[11,0,16,1],
-"d6/d57/array__right__rotation_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,1,4],
-"d6/d57/array__right__rotation_8cpp.html#a1bfb8711f49e591eb168ccaa3df6fb86":[11,0,16,1,2]
+"d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec":[11,0,17,14,6],
+"d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54":[11,0,17,14,8],
+"d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa":[11,0,17,14,3],
+"d7/d35/matrix__exponentiation_8cpp.html#ae1d1ec9482079231e898236e2b23c9ba":[11,0,17,14,1],
+"d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,14,4],
+"d7/d35/matrix__exponentiation_8cpp_source.html":[11,0,17,14],
+"d7/d37/magic__sequence_8cpp_source.html":[11,0,0,3],
+"d7/d39/bridge__finding__with__tarjan__algorithm_8cpp_source.html":[11,0,9,2],
+"d7/d3f/namespacetravelling_salesman__bitmanipulation.html":[9,0,130],
+"d7/d43/stack__using__queue_8cpp_source.html":[11,0,4,30],
+"d7/d47/namespace_x_o_r.html":[9,0,143],
+"d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html":[10,0,19,3],
+"d7/d48/structgeometry_1_1grahamscan_1_1_point.html":[10,0,5,0,0],
+"d7/d4c/namespacek__nearest__neighbors.html":[9,0,55],
+"d7/d50/namespacemodular__inverse__fermat.html":[9,0,77],
+"d7/d56/count__bits__flip_8cpp.html":[11,0,1,0],
+"d7/d56/count__bits__flip_8cpp.html#a2548486b6c3b80101e768562e687ef7b":[11,0,1,0,0],
+"d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,0,2],
+"d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,0,1],
+"d7/d56/count__bits__flip_8cpp_source.html":[11,0,1,0],
+"d7/d57/longest__increasing__subsequence_8cpp.html":[11,0,6,16],
+"d7/d57/longest__increasing__subsequence_8cpp.html#a0a2215194e58786c34db1ccaf8031079":[11,0,6,16,0],
+"d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,16,2],
+"d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089":[11,0,6,16,1],
+"d7/d57/longest__increasing__subsequence_8cpp_source.html":[11,0,6,16],
+"d7/d65/shortest__common__supersequence_8cpp.html":[11,0,6,25],
+"d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,25,2],
+"d7/d65/shortest__common__supersequence_8cpp.html#ad2ee8d7e67da9f6eb85146b08dad95e6":[11,0,6,25,1],
+"d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,25,0],
+"d7/d65/shortest__common__supersequence_8cpp_source.html":[11,0,6,25],
+"d7/d6a/bisection__method_8cpp.html":[11,0,15,1],
+"d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14":[11,0,15,1,0],
+"d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2":[11,0,15,1,3],
+"d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d":[11,0,15,1,1],
+"d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,1,2],
+"d7/d6a/bisection__method_8cpp_source.html":[11,0,15,1],
+"d7/d73/abbreviation_8cpp.html":[11,0,6,1],
+"d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,1,3],
+"d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa":[11,0,6,1,1],
+"d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,1,2],
+"d7/d73/abbreviation_8cpp.html#af53b2f647bee9c5b75ef8dd9ef685dc8":[11,0,6,1,0],
+"d7/d73/abbreviation_8cpp_source.html":[11,0,6,1],
+"d7/d75/postfix__evaluation_8cpp.html":[11,0,17,18],
+"d7/d75/postfix__evaluation_8cpp.html#a421baa2002a64bc0bfc3e1b64800d734":[11,0,17,18,4],
+"d7/d75/postfix__evaluation_8cpp.html#a4c27f949c9d6659be9f5bd2ccbe1360a":[11,0,17,18,2],
+"d7/d75/postfix__evaluation_8cpp.html#a59fd597e0ea394abe027ced4d2ea3338":[11,0,17,18,1],
+"d7/d75/postfix__evaluation_8cpp.html#a5b97d12e8b61484f756a8721992bfae1":[11,0,17,18,8],
+"d7/d75/postfix__evaluation_8cpp.html#a6a8eeb7d346d5cd6335d9780fb7c0f15":[11,0,17,18,7],
+"d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea":[11,0,17,18,6],
+"d7/d75/postfix__evaluation_8cpp.html#ae38bd3a177a6d61da3859a281233bbe1":[11,0,17,18,5],
+"d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,18,3],
+"d7/d75/postfix__evaluation_8cpp_source.html":[11,0,17,18],
+"d7/d77/class_edge.html":[10,0,32],
+"d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980":[10,0,32,0],
+"d7/d7a/namespacebinomial.html":[9,0,8],
+"d7/d7c/classstatistics_1_1stats__computer1.html":[9,0,117,0],
+"d7/d7c/classstatistics_1_1stats__computer1.html":[10,0,18,0],
+"d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92":[9,0,117,0,3],
+"d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92":[10,0,18,0,3],
+"d7/d7c/classstatistics_1_1stats__computer1.html#a350bf6c429691d3578c4dfc6679a0797":[9,0,117,0,4],
+"d7/d7c/classstatistics_1_1stats__computer1.html#a350bf6c429691d3578c4dfc6679a0797":[10,0,18,0,4],
+"d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b":[9,0,117,0,0],
+"d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b":[10,0,18,0,0],
+"d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2":[9,0,117,0,1],
+"d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2":[10,0,18,0,1],
+"d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1":[9,0,117,0,2],
+"d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1":[10,0,18,0,2],
+"d7/d7f/section.html":[5],
+"d7/d81/namespacebit__manipulation.html":[9,0,9],
+"d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e":[9,0,9,1],
+"d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f":[9,0,9,0],
+"d7/d83/trie__tree_8cpp.html":[11,0,4,38],
+"d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,4,38,2],
+"d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,38,1],
+"d7/d83/trie__tree_8cpp_source.html":[11,0,4,38],
+"d7/d85/doubly__linked__list_8cpp_source.html":[11,0,4,8],
+"d7/d88/namespaceprefix__sum__array.html":[9,0,93],
+"d7/d89/double__factorial_8cpp.html":[11,0,14,10],
+"d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26":[11,0,14,10,0],
+"d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d":[11,0,14,10,1],
+"d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,14,10,4],
+"d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981":[11,0,14,10,3],
+"d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,10,2],
+"d7/d89/double__factorial_8cpp_source.html":[11,0,14,10],
+"d7/da4/struct_list_node.html":[10,0,40],
+"d7/da4/struct_list_node.html#a3cfee2eb667c332dc32595208164ef0a":[10,0,40,0],
+"d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3":[10,0,40,4],
+"d7/da4/struct_list_node.html#aaad9b553e2f936726f5b35ff2734125d":[10,0,40,1],
+"d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1":[10,0,40,3],
+"d7/da4/struct_list_node.html#afc97c5b9d2e7cc82d0718245688f6ff9":[10,0,40,2],
+"d7/da6/eratosthenes_8cpp.html":[11,0,14,11],
+"d7/da6/eratosthenes_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,14,11,0],
+"d7/da6/eratosthenes_8cpp.html#a91366864111e1fac29722ca45e02ea8f":[11,0,14,11,2],
+"d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,11,3],
+"d7/da6/eratosthenes_8cpp.html#ad09d59850865012a6fd95d89954c82e4":[11,0,14,11,1],
+"d7/da6/eratosthenes_8cpp_source.html":[11,0,14,11],
+"d7/dab/get__size__of__linked__list_8cpp_source.html":[11,0,16,4],
+"d7/daf/namespace_knapsack.html":[9,0,58],
+"d7/db9/hill__cipher_8cpp.html":[11,0,2,5],
+"d7/db9/hill__cipher_8cpp.html#a04391124480d2a49f2dec900237b0712":[11,0,2,5,4],
+"d7/db9/hill__cipher_8cpp.html#a3147ad576f8a94a2a6b66948672b452b":[11,0,2,5,3],
+"d7/db9/hill__cipher_8cpp.html#a34bfcd756610834acac501f9eea1e2eb":[11,0,2,5,2],
+"d7/db9/hill__cipher_8cpp.html#ab9aec0ccf4b6809f652bb540be87c216":[11,0,2,5,5],
+"d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,5,1],
+"d7/db9/hill__cipher_8cpp_source.html":[11,0,2,5],
+"d7/dba/cll_8h_source.html":[11,0,4,0,1],
+"d7/ded/queue_8hpp_source.html":[11,0,4,16],
+"d7/def/trie__multiple__search_8cpp.html":[11,0,16,10],
+"d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,10,2],
+"d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089":[11,0,16,10,1],
+"d7/def/trie__multiple__search_8cpp_source.html":[11,0,16,10],
+"d8/d10/structlist.html":[10,0,39],
+"d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f":[10,0,39,1],
+"d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c":[10,0,39,0],
+"d8/d13/bubble__sort_8cpp.html":[11,0,23,4],
+"d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,23,4,2],
+"d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,4,1],
+"d8/d13/bubble__sort_8cpp.html#af3b12930a83915712461d53fe9659686":[11,0,23,4,0],
+"d8/d13/bubble__sort_8cpp_source.html":[11,0,23,4],
+"d8/d14/namespacen__queens__optimized.html":[9,0,83],
+"d8/d1d/namespacestrand.html":[9,0,118],
+"d8/d28/classrange__queries_1_1per_seg_tree.html":[9,0,101,1],
+"d8/d28/classrange__queries_1_1per_seg_tree.html":[10,0,16,2],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817":[9,0,101,1,4],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817":[10,0,16,2,4],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865":[9,0,101,1,7],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865":[10,0,16,2,7],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5":[9,0,101,1,10],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5":[10,0,16,2,10],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6":[9,0,101,1,8],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6":[10,0,16,2,8],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4":[9,0,101,1,2],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4":[10,0,16,2,2],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3":[9,0,101,1,11],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3":[10,0,16,2,11],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3":[9,0,101,1,1],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3":[10,0,16,2,1],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79":[9,0,101,1,3],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79":[10,0,16,2,3],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571":[9,0,101,1,6],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571":[10,0,16,2,6],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4":[9,0,101,1,5],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4":[10,0,16,2,5],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d":[9,0,101,1,9],
+"d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d":[10,0,16,2,9],
+"d8/d2a/namespacea1z26.html":[9,0,0],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html":[9,0,88,0,2],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html":[10,0,13,0,2],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821":[9,0,88,0,2,11],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821":[10,0,13,0,2,11],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1":[9,0,88,0,2,9],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1":[10,0,13,0,2,9],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2":[9,0,88,0,2,7],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2":[10,0,13,0,2,7],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100":[9,0,88,0,2,13],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100":[10,0,13,0,2,13],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45":[9,0,88,0,2,8],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45":[10,0,13,0,2,8],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a6d855ff72ad6fe548eb564b7f87abe06":[9,0,88,0,2,1],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a6d855ff72ad6fe548eb564b7f87abe06":[10,0,13,0,2,1],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f":[9,0,88,0,2,0],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f":[10,0,13,0,2,0],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5":[9,0,88,0,2,12],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5":[10,0,13,0,2,12],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7":[9,0,88,0,2,6],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7":[10,0,13,0,2,6],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e":[9,0,88,0,2,3],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e":[10,0,13,0,2,3],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea":[9,0,88,0,2,4],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea":[10,0,13,0,2,4],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4":[9,0,88,0,2,5],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4":[10,0,13,0,2,5],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af34bb8b8eaa34cc499b4fed30b9d05fc":[9,0,88,0,2,10],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af34bb8b8eaa34cc499b4fed30b9d05fc":[10,0,13,0,2,10],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a":[9,0,88,0,2,2],
+"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a":[10,0,13,0,2,2],
+"d8/d30/reverse__a__linked__list__using__recusion_8cpp_source.html":[11,0,16,7],
+"d8/d36/namespacecut__rod.html":[9,0,18],
+"d8/d41/namespacegames_1_1memory__game.html":[9,0,34,0],
+"d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59":[9,0,34,0,3],
+"d8/d41/namespacegames_1_1memory__game.html#a370760f2b328ad341bcb77d82fa17b01":[9,0,34,0,4],
+"d8/d41/namespacegames_1_1memory__game.html#a3ceeea62d8fa6c563e2c66359fd73413":[9,0,34,0,1],
+"d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3":[9,0,34,0,0],
+"d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280":[9,0,34,0,5],
+"d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214":[9,0,34,0,2],
+"d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b":[9,0,34,0,6],
+"d8/d53/modular__inverse__fermat__little__theorem_8cpp.html":[11,0,14,39],
+"d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a1c62a87e79f29b98d8fe5b12eacdd928":[11,0,14,39,0],
+"d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,39,4],
+"d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aba4929409fee35c3cb559e962a544b3e":[11,0,14,39,1],
+"d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,39,2],
+"d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae7e807e02c65c6fffd6162b4c66290c2":[11,0,14,39,3],
+"d8/d53/modular__inverse__fermat__little__theorem_8cpp_source.html":[11,0,14,39],
+"d8/d61/radix__sort2_8cpp.html":[11,0,23,29],
+"d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,23,29,3],
+"d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9":[11,0,23,29,2],
+"d8/d61/radix__sort2_8cpp.html#ae0cfd94fa3765b53d4ec7893ffaee5f8":[11,0,23,29,1],
+"d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,29,0],
+"d8/d61/radix__sort2_8cpp_source.html":[11,0,23,29],
+"d8/d64/namespaceboruvkas__minimum__spanning__tree.html":[9,0,10],
+"d8/d68/dijkstra_8cpp.html":[11,0,9,8],
+"d8/d68/dijkstra_8cpp.html#a0e30e0dca68cb6e4f671440819b35b6a":[11,0,9,8,0],
+"d8/d68/dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,9,8,3],
+"d8/d68/dijkstra_8cpp.html#adc68cbc8ba09eb1142265935c0d45b84":[11,0,9,8,1],
+"d8/d68/dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,8,2],
+"d8/d68/dijkstra_8cpp_source.html":[11,0,9,8],
+"d8/d69/classgraph_1_1_h_k_graph.html":[9,0,39,1],
+"d8/d69/classgraph_1_1_h_k_graph.html":[10,0,6,3],
+"d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64":[9,0,39,1,1],
+"d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64":[10,0,6,3,1],
+"d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f":[9,0,39,1,6],
+"d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f":[10,0,6,3,6],
+"d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a":[9,0,39,1,2],
+"d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a":[10,0,6,3,2],
+"d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74":[9,0,39,1,8],
+"d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74":[10,0,6,3,8],
+"d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a":[9,0,39,1,7],
+"d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a":[10,0,6,3,7],
+"d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c":[9,0,39,1,9],
+"d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c":[10,0,6,3,9],
+"d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93":[9,0,39,1,3],
+"d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93":[10,0,6,3,3],
+"d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b":[9,0,39,1,10],
+"d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b":[10,0,6,3,10],
+"d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77":[9,0,39,1,11],
+"d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77":[10,0,6,3,11],
+"d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d":[9,0,39,1,5],
+"d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d":[10,0,6,3,5],
+"d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0":[9,0,39,1,4],
+"d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0":[10,0,6,3,4],
+"d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9":[9,0,39,1,0],
+"d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9":[10,0,6,3,0],
+"d8/d6c/line__segment__intersection_8cpp.html":[11,0,8,3],
+"d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,8,3,2],
+"d8/d6c/line__segment__intersection_8cpp_source.html":[11,0,8,3],
+"d8/d72/class_r_btree.html":[10,0,51],
+"d8/d76/morse__code_8cpp.html":[11,0,2,6],
+"d8/d76/morse__code_8cpp.html#a0242e458904de8a242fcdaffe9e3ba1a":[11,0,2,6,2],
+"d8/d76/morse__code_8cpp.html#a15c66ec8cf4cef0a35c50cbab86965dc":[11,0,2,6,1],
+"d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,2,6,5],
+"d8/d76/morse__code_8cpp.html#ab31773fd11555d21f70d6914138d9535":[11,0,2,6,0],
+"d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829":[11,0,2,6,4],
+"d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,6,3],
+"d8/d76/morse__code_8cpp_source.html":[11,0,2,6],
+"d8/d76/namespacetopological__sort.html":[9,0,129],
+"d8/d77/namespacemachine__learning.html":[8,1,3],
+"d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3":[9,0,66,8],
+"d8/d77/namespacemachine__learning.html#a0cc29566568e0383dd7d374068cbe6b3":[9,0,66,13],
+"d8/d77/namespacemachine__learning.html#a16f34574b7e0dd51bc3b3fda37446695":[9,0,66,11],
+"d8/d77/namespacemachine__learning.html#a2466857dab977a49f117029835b3b6d2":[9,0,66,12]
 };
diff --git a/navtreeindex7.js b/navtreeindex7.js
index c70dfb743..95142dcf1 100644
--- a/navtreeindex7.js
+++ b/navtreeindex7.js
@@ -1,253 +1,253 @@
 var NAVTREEINDEX7 =
 {
-"d6/d57/array__right__rotation_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d":[11,0,16,1,7],
-"d6/d57/array__right__rotation_8cpp.html#a6109193567a5b7e36a27f2b4865fce20":[11,0,16,1,1],
-"d6/d57/array__right__rotation_8cpp.html#aa515639572647508b94986489aab6d76":[11,0,16,1,6],
-"d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,1,3],
-"d6/d57/array__right__rotation_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669":[11,0,16,1,5],
-"d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,16,1,0],
-"d6/d57/array__right__rotation_8cpp.html#af7b81d7a1534216af6a36a80135beb86":[11,0,16,1,8],
-"d6/d60/group__ode.html":[8,2],
-"d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723":[8,2,1],
-"d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985":[8,2,2],
-"d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089":[8,2,4],
-"d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f":[8,2,5],
-"d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812":[8,2,3],
-"d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9":[8,2,0],
-"d6/d74/namespacekadane.html":[9,0,56],
-"d6/d7a/golden__search__extrema_8cpp.html":[11,0,15,8],
-"d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70":[11,0,15,8,0],
-"d6/d7a/golden__search__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,15,8,4],
-"d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,15,8,3],
-"d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b":[11,0,15,8,1],
-"d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e":[11,0,15,8,5],
-"d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,8,2],
-"d6/d80/double__hash__hash__table_8cpp.html":[11,0,12,1],
-"d6/d80/double__hash__hash__table_8cpp.html#a0d90726ed1de7b3d2ae261baed048003":[11,0,12,1,5],
-"d6/d80/double__hash__hash__table_8cpp.html#a1e901418c759627557eff359b8db38cd":[11,0,12,1,3],
-"d6/d80/double__hash__hash__table_8cpp.html#a28083ecac6eb94b643281875c8665931":[11,0,12,1,11],
-"d6/d80/double__hash__hash__table_8cpp.html#a29f543e2626bad58907661e1e45028a6":[11,0,12,1,12],
-"d6/d80/double__hash__hash__table_8cpp.html#a33968a1178289ab61445dd4000df7082":[11,0,12,1,7],
-"d6/d80/double__hash__hash__table_8cpp.html#a5d06e4598569526294f10104875f6824":[11,0,12,1,10],
-"d6/d80/double__hash__hash__table_8cpp.html#a79a9c914a6c68275b3640303d7faad8a":[11,0,12,1,1],
-"d6/d80/double__hash__hash__table_8cpp.html#a8f8ff4fb018e1bb32d67d8a1885d3200":[11,0,12,1,4],
-"d6/d80/double__hash__hash__table_8cpp.html#a9c652b2e467e5d250dfe3bed83b12560":[11,0,12,1,2],
-"d6/d80/double__hash__hash__table_8cpp.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b":[11,0,12,1,8],
-"d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,12,1,6],
-"d6/d80/double__hash__hash__table_8cpp.html#af4981819aae8bc7e7beeaef02615e30d":[11,0,12,1,9],
-"d6/d84/classhashing_1_1sha256_1_1_hash.html":[10,0,8,0,0],
-"d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3":[10,0,8,0,0,1],
-"d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08":[10,0,8,0,0,0],
-"d6/d84/namespaceutils.html":[9,0,136],
-"d6/d8d/namespacemorse.html":[9,0,79],
-"d6/d9d/large__factorial_8cpp.html":[11,0,14,28],
-"d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,14,28,0],
-"d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8":[11,0,14,28,1],
-"d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa":[11,0,14,28,2],
-"d6/da2/namespacevigenere.html":[9,0,138],
-"d6/dab/namespacetree__234.html":[9,0,132],
-"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html":[10,0,13,2,0],
-"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a09cbe562b0c396329607f5d388d57c9c":[10,0,13,2,0,7],
-"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a1aafd0444b410e0fcb66287e9954c893":[10,0,13,2,0,8],
-"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8":[10,0,13,2,0,5],
-"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4":[10,0,13,2,0,0],
-"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a5f33913e7ddfbb38062362e7bd859154":[10,0,13,2,0,6],
-"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2":[10,0,13,2,0,3],
-"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602":[10,0,13,2,0,4],
-"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933":[10,0,13,2,0,2],
-"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa4d6db56109af196ffc7e5f72bc9907c":[10,0,13,2,0,9],
-"d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53":[10,0,13,2,0,1],
-"d6/db0/binomial__dist_8cpp.html":[11,0,19,2],
-"d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76":[11,0,19,2,4],
-"d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813":[11,0,19,2,0],
-"d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25":[11,0,19,2,1],
-"d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a":[11,0,19,2,6],
-"d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861":[11,0,19,2,3],
-"d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,19,2,5],
-"d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc":[11,0,19,2,2],
-"d6/db8/inv__sqrt_8cpp.html":[11,0,14,26],
-"d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97":[11,0,14,26,2],
-"d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,26,3],
-"d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52":[11,0,14,26,0],
-"d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,26,1],
-"d6/dba/jump__game_8cpp.html":[11,0,11,5],
-"d6/dba/jump__game_8cpp.html#a33e3819aa9ffec0e380383c52603b502":[11,0,11,5,0],
-"d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,11,5,2],
-"d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,5,1],
-"d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html":[10,0,11,0,0],
-"d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a499df7a01bcd348345dc5a0ab79bb0e9":[10,0,11,0,0,2],
-"d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a738a5f59bb3560c81cdb7f43bcfe9fec":[10,0,11,0,0,3],
-"d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a94b07e7dc61d8d7a1e9c5a28988e72f9":[10,0,11,0,0,0],
-"d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#ab5744fa589f6a48f9fe7bca13dbe661f":[10,0,11,0,0,1],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html":[3],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md22":[3,0],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md23":[3,1],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md24":[3,1,0],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md25":[3,1,1],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md26":[3,1,2],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md27":[3,1,2,0],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28":[3,1,2,1],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29":[3,1,2,2],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30":[3,1,2,2,0],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31":[3,1,2,3],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32":[3,1,2,4],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33":[3,1,2,5],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34":[3,1,2,5,0],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35":[3,1,2,6],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36":[3,1,3],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md37":[3,1,3,0],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md38":[3,1,3,1],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md39":[3,1,3,2],
-"d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md40":[3,1,3,3],
-"d6/dce/rabin__karp_8cpp.html":[11,0,23,6],
-"d6/dce/rabin__karp_8cpp.html#a21c673d56cbf67b1d2ee4d869185b7d9":[11,0,23,6,4],
-"d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe":[11,0,23,6,3],
-"d6/dce/rabin__karp_8cpp.html#a8fb0bc932ba8b582c9f4c71338d050f8":[11,0,23,6,2],
-"d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8":[11,0,23,6,0],
-"d6/dce/rabin__karp_8cpp.html#aebe07cea289a13142503d98be7df11fd":[11,0,23,6,1],
-"d6/dce/rabin__karp_8cpp.html#aed769d565b705a9b3e0eb1ec74088893":[11,0,23,6,5],
-"d6/dd3/ode__midpoint__euler_8cpp.html":[11,0,15,16],
-"d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,15,16,1],
-"d6/dd3/ode__midpoint__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f":[11,0,15,16,5],
-"d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe":[11,0,15,16,4],
-"d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b":[11,0,15,16,0],
-"d6/dd6/namespacestring.html":[9,0,121],
-"d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632":[9,0,121,0],
-"d6/dd8/is__graph__bipartite_8cpp.html":[11,0,9,9],
-"d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,9,9,2],
-"d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,9,1],
-"d7/d00/list__array_8cpp.html":[11,0,4,11],
-"d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,4,11,2],
-"d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,11,1],
-"d7/d07/bidirectional__dijkstra_8cpp.html":[11,0,9,0],
-"d7/d07/bidirectional__dijkstra_8cpp.html#a1b2df3d52a403ad46523ab90d3a723c1":[11,0,9,0,1],
-"d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6":[11,0,9,0,3],
-"d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c":[11,0,9,0,5],
-"d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,9,0,4],
-"d7/d07/bidirectional__dijkstra_8cpp.html#a69172365aebde9be1997157f6f80e0cf":[11,0,9,0,0],
-"d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,0,2],
-"d7/d08/namespacegraph__coloring.html":[9,0,40],
-"d7/d0a/namespacetrie__using__hashmap.html":[9,0,134],
-"d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html":[6],
-"d7/d24/nqueen__print__all__solutions_8cpp.html":[11,0,0,6],
-"d7/d24/nqueen__print__all__solutions_8cpp.html#acc809c055f335011de0d9030034c7108":[11,0,0,6,2],
-"d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,6,1],
-"d7/d24/nqueen__print__all__solutions_8cpp.html#aea343d8a72a39c9a4c0fbcbc362f2648":[11,0,0,6,0],
-"d7/d24/nqueen__print__all__solutions_8cpp.html#aebd5e11fab6dab282efccfb61beb0bd9":[11,0,0,6,3],
-"d7/d35/matrix__exponentiation_8cpp.html":[11,0,17,13],
-"d7/d35/matrix__exponentiation_8cpp.html#a276c5a0e984cf60015b27252fe04fe6b":[11,0,17,13,2],
-"d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252":[11,0,17,13,5],
-"d7/d35/matrix__exponentiation_8cpp.html#a35b7c98af53ad2ec18658679ad7d43de":[11,0,17,13,7],
-"d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258":[11,0,17,13,0],
-"d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec":[11,0,17,13,6],
-"d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54":[11,0,17,13,8],
-"d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa":[11,0,17,13,3],
-"d7/d35/matrix__exponentiation_8cpp.html#ae1d1ec9482079231e898236e2b23c9ba":[11,0,17,13,1],
-"d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,13,4],
-"d7/d3f/namespacetravelling_salesman__bitmanipulation.html":[9,0,131],
-"d7/d47/namespace_x_o_r.html":[9,0,144],
-"d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html":[9,0,118,8],
-"d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html":[10,0,19,3],
-"d7/d48/structgeometry_1_1grahamscan_1_1_point.html":[10,0,5,0,0],
-"d7/d4c/namespacek__nearest__neighbors.html":[9,0,55],
-"d7/d50/namespacemodular__inverse__fermat.html":[9,0,77],
-"d7/d56/count__bits__flip_8cpp.html":[11,0,1,0],
-"d7/d56/count__bits__flip_8cpp.html#a2548486b6c3b80101e768562e687ef7b":[11,0,1,0,0],
-"d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,0,2],
-"d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,0,1],
-"d7/d57/longest__increasing__subsequence_8cpp.html":[11,0,6,9],
-"d7/d57/longest__increasing__subsequence_8cpp.html#a0a2215194e58786c34db1ccaf8031079":[11,0,6,9,0],
-"d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,9,2],
-"d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089":[11,0,6,9,1],
-"d7/d65/shortest__common__supersequence_8cpp.html":[11,0,6,14],
-"d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,14,2],
-"d7/d65/shortest__common__supersequence_8cpp.html#ad2ee8d7e67da9f6eb85146b08dad95e6":[11,0,6,14,1],
-"d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,14,0],
-"d7/d6a/bisection__method_8cpp.html":[11,0,15,1],
-"d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14":[11,0,15,1,0],
-"d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2":[11,0,15,1,3],
-"d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d":[11,0,15,1,1],
-"d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,1,2],
-"d7/d73/abbreviation_8cpp.html":[11,0,6,1],
-"d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,1,3],
-"d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa":[11,0,6,1,1],
-"d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,1,2],
-"d7/d73/abbreviation_8cpp.html#af53b2f647bee9c5b75ef8dd9ef685dc8":[11,0,6,1,0],
-"d7/d75/postfix__evaluation_8cpp.html":[11,0,17,17],
-"d7/d75/postfix__evaluation_8cpp.html#a421baa2002a64bc0bfc3e1b64800d734":[11,0,17,17,4],
-"d7/d75/postfix__evaluation_8cpp.html#a4c27f949c9d6659be9f5bd2ccbe1360a":[11,0,17,17,2],
-"d7/d75/postfix__evaluation_8cpp.html#a59fd597e0ea394abe027ced4d2ea3338":[11,0,17,17,1],
-"d7/d75/postfix__evaluation_8cpp.html#a5b97d12e8b61484f756a8721992bfae1":[11,0,17,17,8],
-"d7/d75/postfix__evaluation_8cpp.html#a6a8eeb7d346d5cd6335d9780fb7c0f15":[11,0,17,17,7],
-"d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea":[11,0,17,17,6],
-"d7/d75/postfix__evaluation_8cpp.html#ae38bd3a177a6d61da3859a281233bbe1":[11,0,17,17,5],
-"d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,17,3],
-"d7/d77/class_edge.html":[10,0,32],
-"d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980":[10,0,32,0],
-"d7/d7a/namespacebinomial.html":[9,0,8],
-"d7/d7c/classstatistics_1_1stats__computer1.html":[9,0,117,0],
-"d7/d7c/classstatistics_1_1stats__computer1.html":[10,0,18,0],
-"d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92":[9,0,117,0,3],
-"d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92":[10,0,18,0,3],
-"d7/d7c/classstatistics_1_1stats__computer1.html#a350bf6c429691d3578c4dfc6679a0797":[9,0,117,0,4],
-"d7/d7c/classstatistics_1_1stats__computer1.html#a350bf6c429691d3578c4dfc6679a0797":[10,0,18,0,4],
-"d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b":[9,0,117,0,0],
-"d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b":[10,0,18,0,0],
-"d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2":[9,0,117,0,1],
-"d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2":[10,0,18,0,1],
-"d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1":[9,0,117,0,2],
-"d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1":[10,0,18,0,2],
-"d7/d7f/section.html":[5],
-"d7/d81/namespacebit__manipulation.html":[9,0,9],
-"d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e":[9,0,9,1],
-"d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f":[9,0,9,0],
-"d7/d83/trie__tree_8cpp.html":[11,0,4,24],
-"d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,4,24,2],
-"d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,24,1],
-"d7/d88/namespaceprefix__sum__array.html":[9,0,93],
-"d7/d89/double__factorial_8cpp.html":[11,0,14,9],
-"d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26":[11,0,14,9,0],
-"d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d":[11,0,14,9,1],
-"d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,14,9,4],
-"d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981":[11,0,14,9,3],
-"d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,9,2],
-"d7/da4/struct_list_node.html":[10,0,40],
-"d7/da4/struct_list_node.html#a3cfee2eb667c332dc32595208164ef0a":[10,0,40,0],
-"d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3":[10,0,40,4],
-"d7/da4/struct_list_node.html#aaad9b553e2f936726f5b35ff2734125d":[10,0,40,1],
-"d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1":[10,0,40,3],
-"d7/da4/struct_list_node.html#afc97c5b9d2e7cc82d0718245688f6ff9":[10,0,40,2],
-"d7/da6/eratosthenes_8cpp.html":[11,0,14,10],
-"d7/da6/eratosthenes_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,14,10,0],
-"d7/da6/eratosthenes_8cpp.html#a91366864111e1fac29722ca45e02ea8f":[11,0,14,10,2],
-"d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,10,3],
-"d7/da6/eratosthenes_8cpp.html#ad09d59850865012a6fd95d89954c82e4":[11,0,14,10,1],
-"d7/daf/namespace_knapsack.html":[9,0,58],
-"d7/db9/hill__cipher_8cpp.html":[11,0,2,4],
-"d7/db9/hill__cipher_8cpp.html#a04391124480d2a49f2dec900237b0712":[11,0,2,4,4],
-"d7/db9/hill__cipher_8cpp.html#a3147ad576f8a94a2a6b66948672b452b":[11,0,2,4,3],
-"d7/db9/hill__cipher_8cpp.html#a34bfcd756610834acac501f9eea1e2eb":[11,0,2,4,2],
-"d7/db9/hill__cipher_8cpp.html#ab9aec0ccf4b6809f652bb540be87c216":[11,0,2,4,5],
-"d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,4,1],
-"d7/dba/cll_8h_source.html":[11,0,4,0,0],
-"d7/dbf/namespacestd_1_1this__thread.html":[9,0,118,4],
-"d7/ded/queue_8hpp_source.html":[11,0,4,13],
-"d7/def/trie__multiple__search_8cpp.html":[11,0,16,6],
-"d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,6,2],
-"d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089":[11,0,16,6,1],
-"d8/d10/structlist.html":[10,0,39],
-"d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f":[10,0,39,1],
-"d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c":[10,0,39,0],
-"d8/d13/bubble__sort_8cpp.html":[11,0,22,2],
-"d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,2,2],
-"d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,2,1],
-"d8/d13/bubble__sort_8cpp.html#af3b12930a83915712461d53fe9659686":[11,0,22,2,0],
-"d8/d14/namespacen__queens__optimized.html":[9,0,83],
-"d8/d1d/namespacestrand.html":[9,0,119],
-"d8/d28/classrange__queries_1_1per_seg_tree.html":[9,0,101,1],
-"d8/d28/classrange__queries_1_1per_seg_tree.html":[10,0,16,2],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817":[9,0,101,1,4],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817":[10,0,16,2,4],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865":[9,0,101,1,7],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865":[10,0,16,2,7]
+"d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd":[9,0,66,6],
+"d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec":[9,0,66,2],
+"d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9":[9,0,66,10],
+"d8/d77/namespacemachine__learning.html#a54bf1f3c43271a5fc93101f6ae2e6269":[9,0,66,16],
+"d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35":[9,0,66,21],
+"d8/d77/namespacemachine__learning.html#a7220dbb7fa896d83bfb7a50e4fce1786":[9,0,66,28],
+"d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7":[9,0,66,17],
+"d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a":[9,0,66,22],
+"d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4":[9,0,66,24],
+"d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093":[9,0,66,19],
+"d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078":[9,0,66,4],
+"d8/d77/namespacemachine__learning.html#aa6aac06ccf128b0a9c55c9ee1a8e5631":[9,0,66,25],
+"d8/d77/namespacemachine__learning.html#aa72a53c88203fde278f1fe6c3afe5b07":[9,0,66,20],
+"d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905":[9,0,66,23],
+"d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e":[9,0,66,27],
+"d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26":[9,0,66,9],
+"d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576":[9,0,66,7],
+"d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43":[9,0,66,5],
+"d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb":[9,0,66,1],
+"d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d":[9,0,66,18],
+"d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5":[9,0,66,14],
+"d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3":[9,0,66,26],
+"d8/d77/namespacemachine__learning.html#af4986b23760039711848155739c31b35":[9,0,66,15],
+"d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f":[9,0,66,3],
+"d8/d7a/sha1_8cpp.html":[11,0,12,5],
+"d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c":[11,0,12,5,0],
+"d8/d7a/sha1_8cpp.html#a7be3471f7e489d7d0df42b97a48bf141":[11,0,12,5,1],
+"d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,12,5,6],
+"d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228":[11,0,12,5,5],
+"d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661":[11,0,12,5,2],
+"d8/d7a/sha1_8cpp.html#acf6bd970f29a68702bdbdfe8338e45e0":[11,0,12,5,3],
+"d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,12,5,4],
+"d8/d7a/sha1_8cpp_source.html":[11,0,12,5],
+"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html":[10,0,12,0,0],
+"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a03a896b34d27fda69049827e0c4dab42":[10,0,12,0,0,13],
+"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a142fa439b102c6f86341f421ddcfe0a1":[10,0,12,0,0,1],
+"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae":[10,0,12,0,0,7],
+"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986":[10,0,12,0,0,4],
+"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a3b7bbb0918c261bc216aef9e6dd39aa4":[10,0,12,0,0,6],
+"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a424b17ddc672b25fe0bd9dc8612fba21":[10,0,12,0,0,11],
+"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a46195fcf11b636064c7172cb74b55dd0":[10,0,12,0,0,3],
+"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de":[10,0,12,0,0,12],
+"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13":[10,0,12,0,0,15],
+"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5":[10,0,12,0,0,8],
+"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9":[10,0,12,0,0,9],
+"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888":[10,0,12,0,0,0],
+"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208":[10,0,12,0,0,14],
+"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2":[10,0,12,0,0,2],
+"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592":[10,0,12,0,0,10],
+"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d":[10,0,12,0,0,5],
+"d8/d7c/radix__sort_8cpp_source.html":[11,0,23,28],
+"d8/d7d/kruskals__minimum__spanning__tree_8cpp.html":[11,0,11,8],
+"d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#a349e4ab9a97532c3931a2bd2a19c0098":[11,0,11,8,0],
+"d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,11,8,2],
+"d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,8,1],
+"d8/d7d/kruskals__minimum__spanning__tree_8cpp_source.html":[11,0,11,8],
+"d8/d88/namespaceset_kth_bit.html":[9,0,108],
+"d8/d89/namespacelinear__probing.html":[8,0,1],
+"d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908":[9,0,61,2],
+"d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1":[9,0,61,1],
+"d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527":[9,0,61,4],
+"d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746":[9,0,61,5],
+"d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0":[9,0,61,7],
+"d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0":[9,0,61,8],
+"d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541":[9,0,61,6],
+"d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77":[9,0,61,10],
+"d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28":[9,0,61,9],
+"d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635":[9,0,61,3],
+"d8/d8a/exponential__search_8cpp.html":[11,0,22,1],
+"d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae":[11,0,22,1,0],
+"d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,1,1],
+"d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208":[11,0,22,1,2],
+"d8/d8a/exponential__search_8cpp_source.html":[11,0,22,1],
+"d8/d8f/bitonic__sort_8cpp_source.html":[11,0,23,2],
+"d8/d90/iterative__tree__traversals_8cpp.html":[11,0,17,7],
+"d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2":[11,0,17,7,6],
+"d8/d90/iterative__tree__traversals_8cpp.html#a21d922dbb5905993960c6a7f0ba71ac0":[11,0,17,7,3],
+"d8/d90/iterative__tree__traversals_8cpp.html#a425c4c8520991999ee6dbe13d99b87f4":[11,0,17,7,5],
+"d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8":[11,0,17,7,7],
+"d8/d90/iterative__tree__traversals_8cpp.html#ac35ae2868441f8a11c965b87b2494f21":[11,0,17,7,4],
+"d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,7,2],
+"d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89":[11,0,17,7,8],
+"d8/d90/iterative__tree__traversals_8cpp_source.html":[11,0,17,7],
+"d8/d93/namespacemagic__sequence.html":[9,0,67],
+"d8/d95/vector__ops_8hpp.html":[11,0,13,7],
+"d8/d95/vector__ops_8hpp.html#a0cc29566568e0383dd7d374068cbe6b3":[11,0,13,7,10],
+"d8/d95/vector__ops_8hpp.html#a16f34574b7e0dd51bc3b3fda37446695":[11,0,13,7,8],
+"d8/d95/vector__ops_8hpp.html#a2466857dab977a49f117029835b3b6d2":[11,0,13,7,9],
+"d8/d95/vector__ops_8hpp.html#a496302e3371aa7b478cb7d5917904bdd":[11,0,13,7,5],
+"d8/d95/vector__ops_8hpp.html#a50480fccfb39de20ca47f1bf51ecb6ec":[11,0,13,7,1],
+"d8/d95/vector__ops_8hpp.html#a5342906d42b80fc6b6b3ad17bf00fcb9":[11,0,13,7,7],
+"d8/d95/vector__ops_8hpp.html#a54bf1f3c43271a5fc93101f6ae2e6269":[11,0,13,7,13],
+"d8/d95/vector__ops_8hpp.html#a6f1c98c016ad34ff3d9f39372161bd35":[11,0,13,7,17],
+"d8/d95/vector__ops_8hpp.html#a84260cb1be9b63d6e38107000ac4b7e7":[11,0,13,7,14],
+"d8/d95/vector__ops_8hpp.html#a89fde571b38f9483576594f66572958a":[11,0,13,7,18],
+"d8/d95/vector__ops_8hpp.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4":[11,0,13,7,20],
+"d8/d95/vector__ops_8hpp.html#a912cf68863063a38d6e63545be5eb093":[11,0,13,7,16],
+"d8/d95/vector__ops_8hpp.html#aa4bbf61e65f8cd297255fa94b983d078":[11,0,13,7,3],
+"d8/d95/vector__ops_8hpp.html#abee7b35403af3612222d3b7a53074905":[11,0,13,7,19],
+"d8/d95/vector__ops_8hpp.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e":[11,0,13,7,21],
+"d8/d95/vector__ops_8hpp.html#ac332d152078e96311e43ac5e7183ea26":[11,0,13,7,6],
+"d8/d95/vector__ops_8hpp.html#acafa3e62b686aebdbad81c4f89913f43":[11,0,13,7,4],
+"d8/d95/vector__ops_8hpp.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb":[11,0,13,7,0],
+"d8/d95/vector__ops_8hpp.html#ae10178b082f0205c326550877d998e5d":[11,0,13,7,15],
+"d8/d95/vector__ops_8hpp.html#ae6ec42318d172b97fbdf45638d09d7b5":[11,0,13,7,11],
+"d8/d95/vector__ops_8hpp.html#af4986b23760039711848155739c31b35":[11,0,13,7,12],
+"d8/d95/vector__ops_8hpp.html#af801bf30591ca6b2c38ff4fed0ded23f":[11,0,13,7,2],
+"d8/d95/vector__ops_8hpp_source.html":[11,0,13,7],
+"d8/d96/stack__using__array_8cpp_source.html":[11,0,4,28],
+"d8/d99/connected__components__with__dsu_8cpp.html":[11,0,9,4],
+"d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e":[11,0,9,4,0],
+"d8/d99/connected__components__with__dsu_8cpp.html#a67cb7472f310a798f555fe45cdf50145":[11,0,9,4,5],
+"d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,9,4,4],
+"d8/d99/connected__components__with__dsu_8cpp.html#ac2d6698b71384a352ec4b81b31b13141":[11,0,9,4,3],
+"d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,4,1],
+"d8/d99/connected__components__with__dsu_8cpp.html#ae91ed94113c56191b75fe45f688d6e62":[11,0,9,4,2],
+"d8/d99/connected__components__with__dsu_8cpp_source.html":[11,0,9,4],
+"d8/d9a/fast__fourier__transform_8cpp.html":[11,0,15,6],
+"d8/d9a/fast__fourier__transform_8cpp.html#a158fd271b9a53e8f3f60b08b18857150":[11,0,15,6,0],
+"d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,15,6,2],
+"d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089":[11,0,15,6,1],
+"d8/d9a/fast__fourier__transform_8cpp_source.html":[11,0,15,6],
+"d8/d9c/union__of__two__arrays_8cpp.html":[11,0,16,11],
+"d8/d9c/union__of__two__arrays_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,11,4],
+"d8/d9c/union__of__two__arrays_8cpp.html#a2b8ff06a84b041457873840bf82e2d74":[11,0,16,11,0],
+"d8/d9c/union__of__two__arrays_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d":[11,0,16,11,7],
+"d8/d9c/union__of__two__arrays_8cpp.html#a6109193567a5b7e36a27f2b4865fce20":[11,0,16,11,2],
+"d8/d9c/union__of__two__arrays_8cpp.html#aa515639572647508b94986489aab6d76":[11,0,16,11,6],
+"d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,11,3],
+"d8/d9c/union__of__two__arrays_8cpp.html#aacafde185abd8670abee51157f273dc2":[11,0,16,11,9],
+"d8/d9c/union__of__two__arrays_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669":[11,0,16,11,5],
+"d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,16,11,1],
+"d8/d9c/union__of__two__arrays_8cpp.html#af7b81d7a1534216af6a36a80135beb86":[11,0,16,11,8],
+"d8/d9c/union__of__two__arrays_8cpp_source.html":[11,0,16,11],
+"d8/d9f/namespacesudoku__solver.html":[9,0,127],
+"d8/da7/namespacedepth__first__search.html":[9,0,22],
+"d8/dab/classstatistics_1_1stats__computer2.html":[9,0,117,1],
+"d8/dab/classstatistics_1_1stats__computer2.html":[10,0,18,1],
+"d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e":[9,0,117,1,0],
+"d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e":[10,0,18,1,0],
+"d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a":[9,0,117,1,4],
+"d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a":[10,0,18,1,4],
+"d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e":[9,0,117,1,2],
+"d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e":[10,0,18,1,2],
+"d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534":[9,0,117,1,1],
+"d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534":[10,0,18,1,1],
+"d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555":[9,0,117,1,3],
+"d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555":[10,0,18,1,3],
+"d8/dab/sparse__table_8cpp.html":[11,0,4,26],
+"d8/dab/sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,4,26,1],
+"d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d":[11,0,4,26,4],
+"d8/dab/sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,4,26,2],
+"d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e":[11,0,4,26,3],
+"d8/dab/sparse__table_8cpp_source.html":[11,0,4,26],
+"d8/db1/binomial__calculate_8cpp.html":[11,0,14,5],
+"d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,5,2],
+"d8/db1/binomial__calculate_8cpp.html#aae407a2a13362c4c64fbe509ff325978":[11,0,14,5,0],
+"d8/db1/binomial__calculate_8cpp.html#ac0f2228420376f4db7e1274f2b41667c":[11,0,14,5,1],
+"d8/db1/binomial__calculate_8cpp_source.html":[11,0,14,5],
+"d8/db7/queue__using__linked__list_8cpp_source.html":[11,0,4,19],
+"d8/db9/topological__sort_8cpp.html":[11,0,9,18],
+"d8/db9/topological__sort_8cpp.html#a54dc5d7914958dbd24dda2fd862dc41b":[11,0,9,18,4],
+"d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,9,18,3],
+"d8/db9/topological__sort_8cpp.html#abcbcaa2bb70af0a11d0c090ea1796aea":[11,0,9,18,1],
+"d8/db9/topological__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,18,2],
+"d8/db9/topological__sort_8cpp_source.html":[11,0,9,18],
+"d8/dc6/namespacemanacher.html":[9,0,68],
+"d8/dc8/struct_point.html":[10,0,47],
+"d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7":[10,0,47,2],
+"d8/dc8/struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7":[10,0,47,1],
+"d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a":[10,0,47,0],
+"d8/dc8/struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8":[10,0,47,3],
+"d8/dcc/binary__insertion__sort_8cpp.html":[11,0,23,1],
+"d8/dcc/binary__insertion__sort_8cpp.html#a034d8b276518a902962e87d3158b64fd":[11,0,23,1,0],
+"d8/dcc/binary__insertion__sort_8cpp.html#a5f4bc75cca6dd8294af2d0e328006c68":[11,0,23,1,1],
+"d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,23,1,3],
+"d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,1,2],
+"d8/dcc/binary__insertion__sort_8cpp_source.html":[11,0,23,1],
+"d8/dcd/namespacelru__cache.html":[9,0,65],
+"d8/dce/test__queue_8cpp_source.html":[11,0,4,31],
+"d8/dd5/check__factorial_8cpp.html":[11,0,14,7],
+"d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,7,2],
+"d8/dd5/check__factorial_8cpp.html#a6c72f756a7bf1b9043c357e3fe7814ca":[11,0,14,7,0],
+"d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,7,1],
+"d8/dd5/check__factorial_8cpp_source.html":[11,0,14,7],
+"d8/ddf/sieve__of__eratosthenes_8cpp.html":[11,0,14,53],
+"d8/ddf/sieve__of__eratosthenes_8cpp.html#a22be949d160b26361f7e323310f7fa0c":[11,0,14,53,2],
+"d8/ddf/sieve__of__eratosthenes_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,53,3],
+"d8/ddf/sieve__of__eratosthenes_8cpp.html#a55bc4a221e584d33b79b322432ecc0f3":[11,0,14,53,1],
+"d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,53,0],
+"d8/ddf/sieve__of__eratosthenes_8cpp_source.html":[11,0,14,53],
+"d8/dee/avltree_8cpp.html":[11,0,4,1],
+"d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b":[11,0,4,1,6],
+"d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6":[11,0,4,1,7],
+"d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6":[11,0,4,1,1],
+"d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e":[11,0,4,1,10],
+"d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287":[11,0,4,1,0],
+"d8/dee/avltree_8cpp.html#a82659e9e223e520cf91d7e55c4a3f88c":[11,0,4,1,2],
+"d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5":[11,0,4,1,3],
+"d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546":[11,0,4,1,4],
+"d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c":[11,0,4,1,11],
+"d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59":[11,0,4,1,8],
+"d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83":[11,0,4,1,5],
+"d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,1,9],
+"d8/dee/avltree_8cpp_source.html":[11,0,4,1],
+"d8/df0/queue__using__array_8cpp.html":[11,0,4,17],
+"d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8":[11,0,4,17,2],
+"d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,17,1],
+"d8/df0/queue__using__array_8cpp_source.html":[11,0,4,17],
+"d8/dfa/median__search2_8cpp.html":[11,0,22,11],
+"d8/dfa/median__search2_8cpp.html#a5fefe132a0c3ee780ebc703f37ebce6a":[11,0,22,11,2],
+"d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,11,3],
+"d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,11,1],
+"d8/dfa/median__search2_8cpp_source.html":[11,0,22,11],
+"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html":[10,0,12,2,1],
+"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3":[10,0,12,2,1,0],
+"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256":[10,0,12,2,1,3],
+"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f":[10,0,12,2,1,1],
+"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352":[10,0,12,2,1,2],
+"d9/d00/factorial_8cpp.html":[11,0,14,14],
+"d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,14,2],
+"d9/d00/factorial_8cpp.html#a7e78996673df791014cfe540b183456a":[11,0,14,14,0],
+"d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,14,1],
+"d9/d00/factorial_8cpp_source.html":[11,0,14,14],
+"d9/d02/linear__search_8cpp.html":[11,0,22,8],
+"d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,22,8,2],
+"d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84":[11,0,22,8,0],
+"d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,8,1],
+"d9/d02/linear__search_8cpp_source.html":[11,0,22,8],
+"d9/d03/namespacestring__search.html":[9,0,121],
+"d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e":[9,0,121,4],
+"d9/d03/namespacestring__search.html#a21c673d56cbf67b1d2ee4d869185b7d9":[9,0,121,5],
+"d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9":[9,0,121,3],
+"d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8":[9,0,121,2],
+"d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8":[9,0,121,0],
+"d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd":[9,0,121,1],
+"d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893":[9,0,121,6],
+"d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html":[10,0,13,1,0],
+"d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499":[10,0,13,1,0,1],
+"d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6":[10,0,13,1,0,0],
+"d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25":[10,0,13,1,0,2],
+"d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae":[10,0,13,1,0,3],
+"d9/d13/namespaceinversion.html":[9,0,51],
+"d9/d14/array__left__rotation_8cpp.html":[11,0,16,0],
+"d9/d14/array__left__rotation_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,0,4],
+"d9/d14/array__left__rotation_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d":[11,0,16,0,7],
+"d9/d14/array__left__rotation_8cpp.html#a6109193567a5b7e36a27f2b4865fce20":[11,0,16,0,1],
+"d9/d14/array__left__rotation_8cpp.html#aa515639572647508b94986489aab6d76":[11,0,16,0,6],
+"d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,0,3],
+"d9/d14/array__left__rotation_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669":[11,0,16,0,5]
 };
diff --git a/navtreeindex8.js b/navtreeindex8.js
index 651717092..ea3ee2584 100644
--- a/navtreeindex8.js
+++ b/navtreeindex8.js
@@ -1,253 +1,253 @@
 var NAVTREEINDEX8 =
 {
-"d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5":[9,0,101,1,10],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5":[10,0,16,2,10],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6":[9,0,101,1,8],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6":[10,0,16,2,8],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4":[9,0,101,1,2],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4":[10,0,16,2,2],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3":[9,0,101,1,11],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3":[10,0,16,2,11],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3":[9,0,101,1,1],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3":[10,0,16,2,1],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79":[9,0,101,1,3],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79":[10,0,16,2,3],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571":[9,0,101,1,6],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571":[10,0,16,2,6],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4":[9,0,101,1,5],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4":[10,0,16,2,5],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d":[9,0,101,1,9],
-"d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d":[10,0,16,2,9],
-"d8/d2a/namespacea1z26.html":[9,0,0],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html":[9,0,88,0,2],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html":[10,0,13,0,2],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821":[9,0,88,0,2,11],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821":[10,0,13,0,2,11],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1":[9,0,88,0,2,9],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1":[10,0,13,0,2,9],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2":[9,0,88,0,2,7],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2":[10,0,13,0,2,7],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100":[9,0,88,0,2,13],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100":[10,0,13,0,2,13],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45":[9,0,88,0,2,8],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45":[10,0,13,0,2,8],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a6d855ff72ad6fe548eb564b7f87abe06":[9,0,88,0,2,1],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a6d855ff72ad6fe548eb564b7f87abe06":[10,0,13,0,2,1],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f":[9,0,88,0,2,0],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f":[10,0,13,0,2,0],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5":[9,0,88,0,2,12],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5":[10,0,13,0,2,12],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7":[9,0,88,0,2,6],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7":[10,0,13,0,2,6],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e":[9,0,88,0,2,3],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e":[10,0,13,0,2,3],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea":[9,0,88,0,2,4],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea":[10,0,13,0,2,4],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4":[9,0,88,0,2,5],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4":[10,0,13,0,2,5],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af34bb8b8eaa34cc499b4fed30b9d05fc":[9,0,88,0,2,10],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af34bb8b8eaa34cc499b4fed30b9d05fc":[10,0,13,0,2,10],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a":[9,0,88,0,2,2],
-"d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a":[10,0,13,0,2,2],
-"d8/d36/namespacecut__rod.html":[9,0,18],
-"d8/d41/namespacegames_1_1memory__game.html":[9,0,34,0],
-"d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59":[9,0,34,0,3],
-"d8/d41/namespacegames_1_1memory__game.html#a370760f2b328ad341bcb77d82fa17b01":[9,0,34,0,4],
-"d8/d41/namespacegames_1_1memory__game.html#a3ceeea62d8fa6c563e2c66359fd73413":[9,0,34,0,1],
-"d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3":[9,0,34,0,0],
-"d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280":[9,0,34,0,5],
-"d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214":[9,0,34,0,2],
-"d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b":[9,0,34,0,6],
-"d8/d53/modular__inverse__fermat__little__theorem_8cpp.html":[11,0,14,37],
-"d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a1c62a87e79f29b98d8fe5b12eacdd928":[11,0,14,37,0],
-"d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,37,4],
-"d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aba4929409fee35c3cb559e962a544b3e":[11,0,14,37,1],
-"d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,37,2],
-"d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae7e807e02c65c6fffd6162b4c66290c2":[11,0,14,37,3],
-"d8/d61/radix__sort2_8cpp.html":[11,0,22,19],
-"d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,22,19,3],
-"d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9":[11,0,22,19,2],
-"d8/d61/radix__sort2_8cpp.html#ae0cfd94fa3765b53d4ec7893ffaee5f8":[11,0,22,19,1],
-"d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,19,0],
-"d8/d64/namespaceboruvkas__minimum__spanning__tree.html":[9,0,10],
-"d8/d68/dijkstra_8cpp.html":[11,0,9,6],
-"d8/d68/dijkstra_8cpp.html#a0e30e0dca68cb6e4f671440819b35b6a":[11,0,9,6,0],
-"d8/d68/dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,9,6,3],
-"d8/d68/dijkstra_8cpp.html#adc68cbc8ba09eb1142265935c0d45b84":[11,0,9,6,1],
-"d8/d68/dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,6,2],
-"d8/d69/classgraph_1_1_h_k_graph.html":[9,0,39,1],
-"d8/d69/classgraph_1_1_h_k_graph.html":[10,0,6,3],
-"d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64":[9,0,39,1,1],
-"d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64":[10,0,6,3,1],
-"d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f":[9,0,39,1,6],
-"d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f":[10,0,6,3,6],
-"d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a":[9,0,39,1,2],
-"d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a":[10,0,6,3,2],
-"d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74":[9,0,39,1,8],
-"d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74":[10,0,6,3,8],
-"d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a":[9,0,39,1,7],
-"d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a":[10,0,6,3,7],
-"d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c":[9,0,39,1,9],
-"d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c":[10,0,6,3,9],
-"d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93":[9,0,39,1,3],
-"d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93":[10,0,6,3,3],
-"d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b":[9,0,39,1,10],
-"d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b":[10,0,6,3,10],
-"d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77":[9,0,39,1,11],
-"d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77":[10,0,6,3,11],
-"d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d":[9,0,39,1,5],
-"d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d":[10,0,6,3,5],
-"d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0":[9,0,39,1,4],
-"d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0":[10,0,6,3,4],
-"d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9":[9,0,39,1,0],
-"d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9":[10,0,6,3,0],
-"d8/d6c/line__segment__intersection_8cpp.html":[11,0,8,2],
-"d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,8,2,2],
-"d8/d72/class_r_btree.html":[10,0,51],
-"d8/d76/morse__code_8cpp.html":[11,0,2,5],
-"d8/d76/morse__code_8cpp.html#a0242e458904de8a242fcdaffe9e3ba1a":[11,0,2,5,2],
-"d8/d76/morse__code_8cpp.html#a15c66ec8cf4cef0a35c50cbab86965dc":[11,0,2,5,1],
-"d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,2,5,5],
-"d8/d76/morse__code_8cpp.html#ab31773fd11555d21f70d6914138d9535":[11,0,2,5,0],
-"d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829":[11,0,2,5,4],
-"d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,2,5,3],
-"d8/d76/namespacetopological__sort.html":[9,0,130],
-"d8/d77/namespacemachine__learning.html":[8,1,3],
-"d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3":[9,0,66,8],
-"d8/d77/namespacemachine__learning.html#a0cc29566568e0383dd7d374068cbe6b3":[9,0,66,13],
-"d8/d77/namespacemachine__learning.html#a16f34574b7e0dd51bc3b3fda37446695":[9,0,66,11],
-"d8/d77/namespacemachine__learning.html#a2466857dab977a49f117029835b3b6d2":[9,0,66,12],
-"d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd":[9,0,66,6],
-"d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec":[9,0,66,2],
-"d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9":[9,0,66,10],
-"d8/d77/namespacemachine__learning.html#a54bf1f3c43271a5fc93101f6ae2e6269":[9,0,66,16],
-"d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35":[9,0,66,21],
-"d8/d77/namespacemachine__learning.html#a7220dbb7fa896d83bfb7a50e4fce1786":[9,0,66,28],
-"d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7":[9,0,66,17],
-"d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a":[9,0,66,22],
-"d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4":[9,0,66,24],
-"d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093":[9,0,66,19],
-"d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078":[9,0,66,4],
-"d8/d77/namespacemachine__learning.html#aa6aac06ccf128b0a9c55c9ee1a8e5631":[9,0,66,25],
-"d8/d77/namespacemachine__learning.html#aa72a53c88203fde278f1fe6c3afe5b07":[9,0,66,20],
-"d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905":[9,0,66,23],
-"d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e":[9,0,66,27],
-"d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26":[9,0,66,9],
-"d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576":[9,0,66,7],
-"d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43":[9,0,66,5],
-"d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb":[9,0,66,1],
-"d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d":[9,0,66,18],
-"d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5":[9,0,66,14],
-"d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3":[9,0,66,26],
-"d8/d77/namespacemachine__learning.html#af4986b23760039711848155739c31b35":[9,0,66,15],
-"d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f":[9,0,66,3],
-"d8/d7a/sha1_8cpp.html":[11,0,12,5],
-"d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c":[11,0,12,5,0],
-"d8/d7a/sha1_8cpp.html#a7be3471f7e489d7d0df42b97a48bf141":[11,0,12,5,1],
-"d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,12,5,6],
-"d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228":[11,0,12,5,5],
-"d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661":[11,0,12,5,2],
-"d8/d7a/sha1_8cpp.html#acf6bd970f29a68702bdbdfe8338e45e0":[11,0,12,5,3],
-"d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,12,5,4],
-"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html":[10,0,12,0,0],
-"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a03a896b34d27fda69049827e0c4dab42":[10,0,12,0,0,13],
-"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a142fa439b102c6f86341f421ddcfe0a1":[10,0,12,0,0,1],
-"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae":[10,0,12,0,0,7],
-"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986":[10,0,12,0,0,4],
-"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a3b7bbb0918c261bc216aef9e6dd39aa4":[10,0,12,0,0,6],
-"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a424b17ddc672b25fe0bd9dc8612fba21":[10,0,12,0,0,11],
-"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a46195fcf11b636064c7172cb74b55dd0":[10,0,12,0,0,3],
-"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de":[10,0,12,0,0,12],
-"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13":[10,0,12,0,0,15],
-"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5":[10,0,12,0,0,8],
-"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9":[10,0,12,0,0,9],
-"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888":[10,0,12,0,0,0],
-"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208":[10,0,12,0,0,14],
-"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2":[10,0,12,0,0,2],
-"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592":[10,0,12,0,0,10],
-"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d":[10,0,12,0,0,5],
-"d8/d7d/kruskals__minimum__spanning__tree_8cpp.html":[11,0,11,6],
-"d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#a349e4ab9a97532c3931a2bd2a19c0098":[11,0,11,6,0],
-"d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,11,6,2],
-"d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,6,1],
-"d8/d88/namespaceset_kth_bit.html":[9,0,108],
-"d8/d89/namespacelinear__probing.html":[8,0,1],
-"d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908":[9,0,61,2],
-"d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1":[9,0,61,1],
-"d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527":[9,0,61,4],
-"d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746":[9,0,61,5],
-"d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0":[9,0,61,7],
-"d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0":[9,0,61,8],
-"d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541":[9,0,61,6],
-"d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77":[9,0,61,10],
-"d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28":[9,0,61,9],
-"d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635":[9,0,61,3],
-"d8/d8a/exponential__search_8cpp.html":[11,0,21,0],
-"d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae":[11,0,21,0,0],
-"d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,0,1],
-"d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208":[11,0,21,0,2],
-"d8/d90/iterative__tree__traversals_8cpp.html":[11,0,17,6],
-"d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2":[11,0,17,6,6],
-"d8/d90/iterative__tree__traversals_8cpp.html#a21d922dbb5905993960c6a7f0ba71ac0":[11,0,17,6,3],
-"d8/d90/iterative__tree__traversals_8cpp.html#a425c4c8520991999ee6dbe13d99b87f4":[11,0,17,6,5],
-"d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8":[11,0,17,6,7],
-"d8/d90/iterative__tree__traversals_8cpp.html#ac35ae2868441f8a11c965b87b2494f21":[11,0,17,6,4],
-"d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,6,2],
-"d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89":[11,0,17,6,8],
-"d8/d93/namespacemagic__sequence.html":[9,0,67],
-"d8/d95/vector__ops_8hpp.html":[11,0,13,6],
-"d8/d95/vector__ops_8hpp.html#a0cc29566568e0383dd7d374068cbe6b3":[11,0,13,6,10],
-"d8/d95/vector__ops_8hpp.html#a16f34574b7e0dd51bc3b3fda37446695":[11,0,13,6,8],
-"d8/d95/vector__ops_8hpp.html#a2466857dab977a49f117029835b3b6d2":[11,0,13,6,9],
-"d8/d95/vector__ops_8hpp.html#a496302e3371aa7b478cb7d5917904bdd":[11,0,13,6,5],
-"d8/d95/vector__ops_8hpp.html#a50480fccfb39de20ca47f1bf51ecb6ec":[11,0,13,6,1],
-"d8/d95/vector__ops_8hpp.html#a5342906d42b80fc6b6b3ad17bf00fcb9":[11,0,13,6,7],
-"d8/d95/vector__ops_8hpp.html#a54bf1f3c43271a5fc93101f6ae2e6269":[11,0,13,6,13],
-"d8/d95/vector__ops_8hpp.html#a6f1c98c016ad34ff3d9f39372161bd35":[11,0,13,6,17],
-"d8/d95/vector__ops_8hpp.html#a84260cb1be9b63d6e38107000ac4b7e7":[11,0,13,6,14],
-"d8/d95/vector__ops_8hpp.html#a89fde571b38f9483576594f66572958a":[11,0,13,6,18],
-"d8/d95/vector__ops_8hpp.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4":[11,0,13,6,20],
-"d8/d95/vector__ops_8hpp.html#a912cf68863063a38d6e63545be5eb093":[11,0,13,6,16],
-"d8/d95/vector__ops_8hpp.html#aa4bbf61e65f8cd297255fa94b983d078":[11,0,13,6,3],
-"d8/d95/vector__ops_8hpp.html#abee7b35403af3612222d3b7a53074905":[11,0,13,6,19],
-"d8/d95/vector__ops_8hpp.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e":[11,0,13,6,21],
-"d8/d95/vector__ops_8hpp.html#ac332d152078e96311e43ac5e7183ea26":[11,0,13,6,6],
-"d8/d95/vector__ops_8hpp.html#acafa3e62b686aebdbad81c4f89913f43":[11,0,13,6,4],
-"d8/d95/vector__ops_8hpp.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb":[11,0,13,6,0],
-"d8/d95/vector__ops_8hpp.html#ae10178b082f0205c326550877d998e5d":[11,0,13,6,15],
-"d8/d95/vector__ops_8hpp.html#ae6ec42318d172b97fbdf45638d09d7b5":[11,0,13,6,11],
-"d8/d95/vector__ops_8hpp.html#af4986b23760039711848155739c31b35":[11,0,13,6,12],
-"d8/d95/vector__ops_8hpp.html#af801bf30591ca6b2c38ff4fed0ded23f":[11,0,13,6,2],
-"d8/d95/vector__ops_8hpp_source.html":[11,0,13,6],
-"d8/d99/connected__components__with__dsu_8cpp.html":[11,0,9,3],
-"d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e":[11,0,9,3,0],
-"d8/d99/connected__components__with__dsu_8cpp.html#a67cb7472f310a798f555fe45cdf50145":[11,0,9,3,5],
-"d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,9,3,4],
-"d8/d99/connected__components__with__dsu_8cpp.html#ac2d6698b71384a352ec4b81b31b13141":[11,0,9,3,3],
-"d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,3,1],
-"d8/d99/connected__components__with__dsu_8cpp.html#ae91ed94113c56191b75fe45f688d6e62":[11,0,9,3,2],
-"d8/d9a/fast__fourier__transform_8cpp.html":[11,0,15,6],
-"d8/d9a/fast__fourier__transform_8cpp.html#a158fd271b9a53e8f3f60b08b18857150":[11,0,15,6,0],
-"d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,15,6,2],
-"d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089":[11,0,15,6,1],
-"d8/d9c/union__of__two__arrays_8cpp.html":[11,0,16,7],
-"d8/d9c/union__of__two__arrays_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,7,4],
-"d8/d9c/union__of__two__arrays_8cpp.html#a2b8ff06a84b041457873840bf82e2d74":[11,0,16,7,0],
-"d8/d9c/union__of__two__arrays_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d":[11,0,16,7,7],
-"d8/d9c/union__of__two__arrays_8cpp.html#a6109193567a5b7e36a27f2b4865fce20":[11,0,16,7,2],
-"d8/d9c/union__of__two__arrays_8cpp.html#aa515639572647508b94986489aab6d76":[11,0,16,7,6],
-"d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,7,3],
-"d8/d9c/union__of__two__arrays_8cpp.html#aacafde185abd8670abee51157f273dc2":[11,0,16,7,9],
-"d8/d9c/union__of__two__arrays_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669":[11,0,16,7,5],
-"d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,16,7,1],
-"d8/d9c/union__of__two__arrays_8cpp.html#af7b81d7a1534216af6a36a80135beb86":[11,0,16,7,8],
-"d8/d9f/namespacesudoku__solver.html":[9,0,128],
-"d8/da7/namespacedepth__first__search.html":[9,0,22],
-"d8/dab/classstatistics_1_1stats__computer2.html":[9,0,117,1],
-"d8/dab/classstatistics_1_1stats__computer2.html":[10,0,18,1],
-"d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e":[9,0,117,1,0],
-"d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e":[10,0,18,1,0],
-"d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a":[9,0,117,1,4],
-"d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a":[10,0,18,1,4],
-"d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e":[9,0,117,1,2]
+"d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,16,0,0],
+"d9/d14/array__left__rotation_8cpp.html#af7b81d7a1534216af6a36a80135beb86":[11,0,16,0,8],
+"d9/d14/array__left__rotation_8cpp.html#afce39cf843989a39811a49ebe29dd6d8":[11,0,16,0,2],
+"d9/d14/array__left__rotation_8cpp_source.html":[11,0,16,0],
+"d9/d1c/kruskal_8cpp_source.html":[11,0,9,14],
+"d9/d1f/binary__addition_8cpp.html":[11,0,11,0],
+"d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,11,0,2],
+"d9/d1f/binary__addition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,0,1],
+"d9/d1f/binary__addition_8cpp_source.html":[11,0,11,0],
+"d9/d21/namespacewave__sort.html":[9,0,138],
+"d9/d23/classgraph_1_1_lowest_common_ancestor.html":[9,0,39,2],
+"d9/d23/classgraph_1_1_lowest_common_ancestor.html":[10,0,6,4],
+"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356":[9,0,39,2,2],
+"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356":[10,0,6,4,2],
+"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad":[9,0,39,2,3],
+"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad":[10,0,6,4,3],
+"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488":[9,0,39,2,1],
+"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488":[10,0,6,4,1],
+"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93":[9,0,39,2,0],
+"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93":[10,0,6,4,0],
+"d9/d24/poisson__dist_8cpp.html":[11,0,19,5],
+"d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a":[11,0,19,5,0],
+"d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1":[11,0,19,5,5],
+"d9/d24/poisson__dist_8cpp.html#ac217ab9a06291f360d816700a6958ca8":[11,0,19,5,4],
+"d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71":[11,0,19,5,2],
+"d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a":[11,0,19,5,3],
+"d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,19,5,1],
+"d9/d24/poisson__dist_8cpp_source.html":[11,0,19,5],
+"d9/d27/namespacelist__array.html":[9,0,64],
+"d9/d29/ground__to__ground__projectile__motion_8cpp.html":[11,0,18,0],
+"d9/d29/ground__to__ground__projectile__motion_8cpp.html#a10362eb607d7882bac3a0688504b00ff":[11,0,18,0,2],
+"d9/d29/ground__to__ground__projectile__motion_8cpp.html#a525335710b53cb064ca56b936120431e":[11,0,18,0,0],
+"d9/d29/ground__to__ground__projectile__motion_8cpp.html#a563e066975fed1b84750a0a47c3cbb37":[11,0,18,0,6],
+"d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa554429def63077ab7a550c0affbfefa":[11,0,18,0,4],
+"d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,18,0,5],
+"d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c":[11,0,18,0,1],
+"d9/d29/ground__to__ground__projectile__motion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,18,0,3],
+"d9/d29/ground__to__ground__projectile__motion_8cpp_source.html":[11,0,18,0],
+"d9/d31/coin__change__topdown_8cpp.html":[11,0,6,6],
+"d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,6,2],
+"d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a":[11,0,6,6,1],
+"d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,6,0],
+"d9/d31/coin__change__topdown_8cpp_source.html":[11,0,6,6],
+"d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html":[10,0,16,0,1],
+"d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a1fda852e6e522707fd97f61cdb0a2591":[10,0,16,0,1,2],
+"d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c":[10,0,16,0,1,4],
+"d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74":[10,0,16,0,1,1],
+"d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5":[10,0,16,0,1,7],
+"d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ac6d912bbfafa3a7509f66bbc1729ca25":[10,0,16,0,1,5],
+"d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ad3b942be27a1b0fe3cff6cb6edf01294":[10,0,16,0,1,3],
+"d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1":[10,0,16,0,1,0],
+"d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afbf8a9cb9449d5ca844f4e141a801e6a":[10,0,16,0,1,6],
+"d9/d37/inverse__fast__fourier__transform_8cpp.html":[11,0,15,10],
+"d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,15,10,2],
+"d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089":[11,0,15,10,1],
+"d9/d37/inverse__fast__fourier__transform_8cpp.html#aee56dc85997b8cd42bad71a5d6bd2d93":[11,0,15,10,0],
+"d9/d37/inverse__fast__fourier__transform_8cpp_source.html":[11,0,15,10],
+"d9/d44/magic__number_8cpp.html":[11,0,14,35],
+"d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,35,2],
+"d9/d44/magic__number_8cpp.html#a8d8e81a7cd59644b311ef9adb268f5f0":[11,0,14,35,0],
+"d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,35,1],
+"d9/d44/magic__number_8cpp_source.html":[11,0,14,35],
+"d9/d49/kohonen__som__trace_8cpp.html":[8,1,2],
+"d9/d49/structdata__structures_1_1_node.html":[9,0,21,3],
+"d9/d49/structdata__structures_1_1_node.html":[10,0,2,10],
+"d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78":[9,0,21,3,0],
+"d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78":[10,0,2,10,0],
+"d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731":[9,0,21,3,3],
+"d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731":[10,0,2,10,3],
+"d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68":[9,0,21,3,2],
+"d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68":[10,0,2,10,2],
+"d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e":[9,0,21,3,1],
+"d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e":[10,0,2,10,1],
+"d9/d55/namespacesparse__table.html":[9,0,114],
+"d9/d5a/structgeometry_1_1jarvis_1_1_point.html":[10,0,5,1,1],
+"d9/d5d/extended__euclid__algorithm_8cpp.html":[11,0,14,13],
+"d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25":[11,0,14,13,1],
+"d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217":[11,0,14,13,3],
+"d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d":[11,0,14,13,0],
+"d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,13,2],
+"d9/d5d/extended__euclid__algorithm_8cpp_source.html":[11,0,14,13],
+"d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html":[11,0,22,9],
+"d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e":[11,0,22,9,0],
+"d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,22,9,2],
+"d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,9,1],
+"d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_source.html":[11,0,22,9],
+"d9/d60/namespacerat__maze.html":[9,0,102],
+"d9/d65/lfu__cache_8cpp.html":[11,0,17,10],
+"d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,17,10,3],
+"d9/d65/lfu__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,10,2],
+"d9/d65/lfu__cache_8cpp_source.html":[11,0,17,10],
+"d9/d66/group__machine__learning.html":[8,1],
+"d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1":[8,1,8],
+"d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e":[8,1,5],
+"d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c":[8,1,6],
+"d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67":[8,1,7],
+"d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485":[8,1,4],
+"d9/d69/median__search_8cpp.html":[11,0,22,10],
+"d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae":[11,0,22,10,1],
+"d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,22,10,2],
+"d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,10,0],
+"d9/d69/median__search_8cpp_source.html":[11,0,22,10],
+"d9/d6b/coin__change_8cpp_source.html":[11,0,6,5],
+"d9/d70/namespacequeue__using__array.html":[9,0,97],
+"d9/d75/namespacednf__sort.html":[9,0,25],
+"d9/d80/trapped__rainwater_8cpp.html":[11,0,6,27],
+"d9/d80/trapped__rainwater_8cpp.html#a066e0e739e7c276eee6e61d5b4d37ce8":[11,0,6,27,2],
+"d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,27,1],
+"d9/d80/trapped__rainwater_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,27,0],
+"d9/d80/trapped__rainwater_8cpp_source.html":[11,0,6,27],
+"d9/d85/selection__sort__iterative_8cpp_source.html":[11,0,23,32],
+"d9/d89/fibonacci_8cpp.html":[11,0,14,16],
+"d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,16,2],
+"d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,16,1],
+"d9/d89/fibonacci_8cpp.html#aeaaf5439cb29de4630c7dff2fd914b28":[11,0,14,16,0],
+"d9/d89/fibonacci_8cpp_source.html":[11,0,14,16],
+"d9/d90/struct_btree.html":[10,0,22],
+"d9/d92/chaining_8cpp.html":[11,0,12,0],
+"d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,12,0,1],
+"d9/d92/chaining_8cpp_source.html":[11,0,12,0],
+"d9/da2/exponential__dist_8cpp.html":[11,0,19,3],
+"d9/da2/exponential__dist_8cpp.html#a1c8b6e787f72a209ef96c096eedf7afc":[11,0,19,3,0],
+"d9/da2/exponential__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,19,3,4],
+"d9/da2/exponential__dist_8cpp.html#ac7b0091e17479d47438a281fefc2549a":[11,0,19,3,1],
+"d9/da2/exponential__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,19,3,3],
+"d9/da2/exponential__dist_8cpp.html#af435dbeb43a05c8c7785f53bf4ce1df1":[11,0,19,3,2],
+"d9/da2/exponential__dist_8cpp_source.html":[11,0,19,3],
+"d9/daa/namespacemidpoint__rule.html":[9,0,73],
+"d9/dab/bloom__filter_8cpp.html":[11,0,4,5],
+"d9/dab/bloom__filter_8cpp.html#a271c753baf6dc5ac6f19fa03c5873eb4":[11,0,4,5,2],
+"d9/dab/bloom__filter_8cpp.html#a30edc0d2bb59c185baec81d69d20ed3b":[11,0,4,5,8],
+"d9/dab/bloom__filter_8cpp.html#a35eb2bc3edbb52f9c5f0b1e51046ef15":[11,0,4,5,5],
+"d9/dab/bloom__filter_8cpp.html#a6e509afe40db07681f676ad8da4fb905":[11,0,4,5,7],
+"d9/dab/bloom__filter_8cpp.html#a71f57bf262fe55db928b19dc124cc0d8":[11,0,4,5,9],
+"d9/dab/bloom__filter_8cpp.html#a9ed236419034917c5270c1dccd220b5c":[11,0,4,5,4],
+"d9/dab/bloom__filter_8cpp.html#aa6deb9d4a0f63ea97aef3dce4c6c6677":[11,0,4,5,3],
+"d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,5,6],
+"d9/dab/bloom__filter_8cpp_source.html":[11,0,4,5],
+"d9/dad/rb__tree_8cpp_source.html":[11,0,4,22],
+"d9/dae/classdata__structures_1_1_bitset.html":[9,0,21,1],
+"d9/dae/classdata__structures_1_1_bitset.html":[10,0,2,8],
+"d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130":[9,0,21,1,0],
+"d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130":[10,0,2,8,0],
+"d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c":[9,0,21,1,1],
+"d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c":[10,0,2,8,1],
+"d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54":[9,0,21,1,3],
+"d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54":[10,0,2,8,3],
+"d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac":[9,0,21,1,2],
+"d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac":[10,0,2,8,2],
+"d9/dae/classdata__structures_1_1_bitset.html#ad7f7d479079a95bcc9175465395fa23f":[9,0,21,1,4],
+"d9/dae/classdata__structures_1_1_bitset.html#ad7f7d479079a95bcc9175465395fa23f":[10,0,2,8,4],
+"d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73":[9,0,21,1,5],
+"d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73":[10,0,2,8,5],
+"d9/dbf/test__stack_8cpp_source.html":[11,0,4,32],
+"d9/dc9/namespacebase64__encoding.html":[9,0,6],
+"d9/dca/namespacesearch.html":[9,0,106],
+"d9/dcc/selectionsortlinkedlist_8cpp_source.html":[11,0,16,9],
+"d9/dd1/namespacelinear__recurrence__matrix.html":[9,0,62],
+"d9/dd2/cocktail__selection__sort_8cpp_source.html":[11,0,23,6],
+"d9/dd7/interpolation__search_8cpp_source.html":[11,0,22,5],
+"d9/dde/classbinary__search__tree.html":[10,0,21],
+"d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc":[10,0,21,20],
+"d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a":[10,0,21,8],
+"d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd":[10,0,21,16],
+"d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0":[10,0,21,5],
+"d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3":[10,0,21,15],
+"d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13":[10,0,21,10],
+"d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff":[10,0,21,9],
+"d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63":[10,0,21,3],
+"d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb":[10,0,21,4],
+"d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0":[10,0,21,12],
+"d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362":[10,0,21,17],
+"d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb":[10,0,21,14],
+"d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778":[10,0,21,11],
+"d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50":[10,0,21,19],
+"d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2":[10,0,21,2],
+"d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6":[10,0,21,1],
+"d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1":[10,0,21,18],
+"d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03":[10,0,21,7],
+"d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153":[10,0,21,13],
+"d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153":[10,0,21,6],
+"d9/dde/structdouble__hashing_1_1_entry.html":[9,0,26,0],
+"d9/dde/structdouble__hashing_1_1_entry.html":[10,0,4,0],
+"d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475":[9,0,26,0,0],
+"d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475":[10,0,4,0,0],
+"d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248":[9,0,26,0,1],
+"d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248":[10,0,4,0,1],
+"d9/dec/unbounded__0__1__knapsack_8cpp.html":[11,0,6,29],
+"d9/dec/unbounded__0__1__knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef":[11,0,6,29,3],
+"d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,6,29,2],
+"d9/dec/unbounded__0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,29,1],
+"d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c":[11,0,6,29,0],
+"d9/dec/unbounded__0__1__knapsack_8cpp_source.html":[11,0,6,29],
+"d9/dee/classdouble__linked__list.html":[10,0,29],
+"d9/def/namespacesublist__search.html":[9,0,124],
+"d9/df0/fast__integer__input_8cpp.html":[11,0,17,5],
+"d9/df0/fast__integer__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82":[11,0,17,5,0],
+"d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,5,1],
+"d9/df0/fast__integer__input_8cpp_source.html":[11,0,17,5],
+"d9/df4/namespacetests.html":[9,0,128],
+"d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5":[9,0,128,0],
+"d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d":[9,0,128,3],
+"d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76":[9,0,128,2],
+"d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2":[9,0,128,5],
+"d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669":[9,0,128,1],
+"d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86":[9,0,128,4],
+"d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html":[10,0,13,4,1],
+"d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade":[10,0,13,4,1,0],
+"d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3":[10,0,13,4,1,1],
+"d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83":[10,0,13,4,1,2],
+"d9/dfd/circular__queue__using__linked__list_8cpp_source.html":[11,0,4,6],
+"d9/dfd/comb__sort_8cpp.html":[11,0,23,7],
+"d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f":[11,0,23,7,0],
+"d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,23,7,3],
+"d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,7,2],
+"d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5":[11,0,23,7,1],
+"d9/dfd/comb__sort_8cpp_source.html":[11,0,23,7],
+"da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html":[10,0,10,0,0],
+"da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4":[10,0,10,0,0,5],
+"da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a48284e156fdd48fd0c41008c7e48f201":[10,0,10,0,0,4],
+"da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e":[10,0,10,0,0,3],
+"da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#acd897e6e519849edb9fb0d1e1bfa881a":[10,0,10,0,0,2],
+"da/d0d/longest__common__string_8cpp.html":[11,0,6,14],
+"da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe":[11,0,6,14,6],
+"da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,6,14,8],
+"da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c":[11,0,6,14,1],
+"da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561":[11,0,6,14,5],
+"da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5":[11,0,6,14,2],
+"da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541":[11,0,6,14,4],
+"da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155":[11,0,6,14,7],
+"da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,14,3],
+"da/d0d/longest__common__string_8cpp_source.html":[11,0,6,14],
+"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html":[10,0,12,0,1],
+"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5":[10,0,12,0,1,0],
+"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95":[10,0,12,0,1,1],
+"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1":[10,0,12,0,1,2],
+"da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77":[10,0,12,0,1,3],
+"da/d18/quadratic__equations__complex__numbers_8cpp.html":[11,0,14,51],
+"da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,51,3],
+"da/d18/quadratic__equations__complex__numbers_8cpp.html#aacb1411ef2029e81f249c21e17c96fdb":[11,0,14,51,2],
+"da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,51,1],
+"da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a":[11,0,14,51,0],
+"da/d18/quadratic__equations__complex__numbers_8cpp_source.html":[11,0,14,51],
+"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html":[10,0,14,0,0],
+"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a":[10,0,14,0,0,1],
+"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2":[10,0,14,0,0,7],
+"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413":[10,0,14,0,0,3],
+"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69":[10,0,14,0,0,6],
+"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3":[10,0,14,0,0,2],
+"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797":[10,0,14,0,0,0]
 };
diff --git a/navtreeindex9.js b/navtreeindex9.js
index 85d0e40ab..691a30a5e 100644
--- a/navtreeindex9.js
+++ b/navtreeindex9.js
@@ -1,253 +1,253 @@
 var NAVTREEINDEX9 =
 {
-"d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e":[10,0,18,1,2],
-"d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534":[9,0,117,1,1],
-"d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534":[10,0,18,1,1],
-"d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555":[9,0,117,1,3],
-"d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555":[10,0,18,1,3],
-"d8/dab/sparse__table_8cpp.html":[11,0,4,19],
-"d8/dab/sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,4,19,1],
-"d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d":[11,0,4,19,4],
-"d8/dab/sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,4,19,2],
-"d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e":[11,0,4,19,3],
-"d8/db1/binomial__calculate_8cpp.html":[11,0,14,4],
-"d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,4,2],
-"d8/db1/binomial__calculate_8cpp.html#aae407a2a13362c4c64fbe509ff325978":[11,0,14,4,0],
-"d8/db1/binomial__calculate_8cpp.html#ac0f2228420376f4db7e1274f2b41667c":[11,0,14,4,1],
-"d8/db9/topological__sort_8cpp.html":[11,0,9,11],
-"d8/db9/topological__sort_8cpp.html#a54dc5d7914958dbd24dda2fd862dc41b":[11,0,9,11,4],
-"d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,9,11,3],
-"d8/db9/topological__sort_8cpp.html#abcbcaa2bb70af0a11d0c090ea1796aea":[11,0,9,11,1],
-"d8/db9/topological__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,11,2],
-"d8/dc6/namespacemanacher.html":[9,0,68],
-"d8/dc8/struct_point.html":[10,0,47],
-"d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7":[10,0,47,2],
-"d8/dc8/struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7":[10,0,47,1],
-"d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a":[10,0,47,0],
-"d8/dc8/struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8":[10,0,47,3],
-"d8/dcc/binary__insertion__sort_8cpp.html":[11,0,22,0],
-"d8/dcc/binary__insertion__sort_8cpp.html#a034d8b276518a902962e87d3158b64fd":[11,0,22,0,0],
-"d8/dcc/binary__insertion__sort_8cpp.html#a5f4bc75cca6dd8294af2d0e328006c68":[11,0,22,0,1],
-"d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,0,3],
-"d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,0,2],
-"d8/dcc/namespacestd.html":[9,0,118],
-"d8/dcd/namespacelru__cache.html":[9,0,65],
-"d8/dd5/check__factorial_8cpp.html":[11,0,14,6],
-"d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,6,2],
-"d8/dd5/check__factorial_8cpp.html#a6c72f756a7bf1b9043c357e3fe7814ca":[11,0,14,6,0],
-"d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,6,1],
-"d8/ddf/sieve__of__eratosthenes_8cpp.html":[11,0,14,51],
-"d8/ddf/sieve__of__eratosthenes_8cpp.html#a22be949d160b26361f7e323310f7fa0c":[11,0,14,51,2],
-"d8/ddf/sieve__of__eratosthenes_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,51,3],
-"d8/ddf/sieve__of__eratosthenes_8cpp.html#a55bc4a221e584d33b79b322432ecc0f3":[11,0,14,51,1],
-"d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,51,0],
-"d8/dee/avltree_8cpp.html":[11,0,4,1],
-"d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b":[11,0,4,1,6],
-"d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6":[11,0,4,1,7],
-"d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6":[11,0,4,1,1],
-"d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e":[11,0,4,1,10],
-"d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287":[11,0,4,1,0],
-"d8/dee/avltree_8cpp.html#a82659e9e223e520cf91d7e55c4a3f88c":[11,0,4,1,2],
-"d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5":[11,0,4,1,3],
-"d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546":[11,0,4,1,4],
-"d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c":[11,0,4,1,11],
-"d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59":[11,0,4,1,8],
-"d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83":[11,0,4,1,5],
-"d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,1,9],
-"d8/df0/queue__using__array_8cpp.html":[11,0,4,14],
-"d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8":[11,0,4,14,2],
-"d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,14,1],
-"d8/dfa/median__search2_8cpp.html":[11,0,21,9],
-"d8/dfa/median__search2_8cpp.html#a5fefe132a0c3ee780ebc703f37ebce6a":[11,0,21,9,2],
-"d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,21,9,3],
-"d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,9,1],
-"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html":[10,0,12,2,1],
-"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3":[10,0,12,2,1,0],
-"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256":[10,0,12,2,1,3],
-"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f":[10,0,12,2,1,1],
-"d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352":[10,0,12,2,1,2],
-"d9/d00/factorial_8cpp.html":[11,0,14,13],
-"d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,13,2],
-"d9/d00/factorial_8cpp.html#a7e78996673df791014cfe540b183456a":[11,0,14,13,0],
-"d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,13,1],
-"d9/d02/linear__search_8cpp.html":[11,0,21,6],
-"d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,21,6,2],
-"d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84":[11,0,21,6,0],
-"d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,6,1],
-"d9/d03/namespacestring__search.html":[9,0,122],
-"d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e":[9,0,122,4],
-"d9/d03/namespacestring__search.html#a21c673d56cbf67b1d2ee4d869185b7d9":[9,0,122,5],
-"d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9":[9,0,122,3],
-"d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8":[9,0,122,2],
-"d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8":[9,0,122,0],
-"d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd":[9,0,122,1],
-"d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893":[9,0,122,6],
-"d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html":[10,0,13,1,0],
-"d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499":[10,0,13,1,0,1],
-"d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6":[10,0,13,1,0,0],
-"d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25":[10,0,13,1,0,2],
-"d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae":[10,0,13,1,0,3],
-"d9/d13/namespaceinversion.html":[9,0,51],
-"d9/d14/array__left__rotation_8cpp.html":[11,0,16,0],
-"d9/d14/array__left__rotation_8cpp.html#a167c24bd817469ae47358d12e034f2d5":[11,0,16,0,4],
-"d9/d14/array__left__rotation_8cpp.html#a2b9769e44683dcb67fe1083ad91e134d":[11,0,16,0,7],
-"d9/d14/array__left__rotation_8cpp.html#a6109193567a5b7e36a27f2b4865fce20":[11,0,16,0,1],
-"d9/d14/array__left__rotation_8cpp.html#aa515639572647508b94986489aab6d76":[11,0,16,0,6],
-"d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,16,0,3],
-"d9/d14/array__left__rotation_8cpp.html#abdd77344d4af8fd56d14a5cabbf2f669":[11,0,16,0,5],
-"d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,16,0,0],
-"d9/d14/array__left__rotation_8cpp.html#af7b81d7a1534216af6a36a80135beb86":[11,0,16,0,8],
-"d9/d14/array__left__rotation_8cpp.html#afce39cf843989a39811a49ebe29dd6d8":[11,0,16,0,2],
-"d9/d1f/binary__addition_8cpp.html":[11,0,11,0],
-"d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,11,0,2],
-"d9/d1f/binary__addition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,0,1],
-"d9/d21/namespacewave__sort.html":[9,0,139],
-"d9/d23/classgraph_1_1_lowest_common_ancestor.html":[9,0,39,2],
-"d9/d23/classgraph_1_1_lowest_common_ancestor.html":[10,0,6,4],
-"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356":[9,0,39,2,2],
-"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356":[10,0,6,4,2],
-"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad":[9,0,39,2,3],
-"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad":[10,0,6,4,3],
-"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488":[9,0,39,2,1],
-"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488":[10,0,6,4,1],
-"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93":[9,0,39,2,0],
-"d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93":[10,0,6,4,0],
-"d9/d24/poisson__dist_8cpp.html":[11,0,19,5],
-"d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a":[11,0,19,5,0],
-"d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1":[11,0,19,5,5],
-"d9/d24/poisson__dist_8cpp.html#ac217ab9a06291f360d816700a6958ca8":[11,0,19,5,4],
-"d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71":[11,0,19,5,2],
-"d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a":[11,0,19,5,3],
-"d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,19,5,1],
-"d9/d27/namespacelist__array.html":[9,0,64],
-"d9/d29/ground__to__ground__projectile__motion_8cpp.html":[11,0,18,0],
-"d9/d29/ground__to__ground__projectile__motion_8cpp.html#a10362eb607d7882bac3a0688504b00ff":[11,0,18,0,2],
-"d9/d29/ground__to__ground__projectile__motion_8cpp.html#a525335710b53cb064ca56b936120431e":[11,0,18,0,0],
-"d9/d29/ground__to__ground__projectile__motion_8cpp.html#a563e066975fed1b84750a0a47c3cbb37":[11,0,18,0,6],
-"d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa554429def63077ab7a550c0affbfefa":[11,0,18,0,4],
-"d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,18,0,5],
-"d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c":[11,0,18,0,1],
-"d9/d29/ground__to__ground__projectile__motion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,18,0,3],
-"d9/d31/coin__change__topdown_8cpp.html":[11,0,6,4],
-"d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,4,2],
-"d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a":[11,0,6,4,1],
-"d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,4,0],
-"d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html":[10,0,16,0,1],
-"d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a1fda852e6e522707fd97f61cdb0a2591":[10,0,16,0,1,2],
-"d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c":[10,0,16,0,1,4],
-"d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74":[10,0,16,0,1,1],
-"d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5":[10,0,16,0,1,7],
-"d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ac6d912bbfafa3a7509f66bbc1729ca25":[10,0,16,0,1,5],
-"d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ad3b942be27a1b0fe3cff6cb6edf01294":[10,0,16,0,1,3],
-"d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1":[10,0,16,0,1,0],
-"d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afbf8a9cb9449d5ca844f4e141a801e6a":[10,0,16,0,1,6],
-"d9/d37/inverse__fast__fourier__transform_8cpp.html":[11,0,15,10],
-"d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,15,10,2],
-"d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089":[11,0,15,10,1],
-"d9/d37/inverse__fast__fourier__transform_8cpp.html#aee56dc85997b8cd42bad71a5d6bd2d93":[11,0,15,10,0],
-"d9/d44/magic__number_8cpp.html":[11,0,14,33],
-"d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,33,2],
-"d9/d44/magic__number_8cpp.html#a8d8e81a7cd59644b311ef9adb268f5f0":[11,0,14,33,0],
-"d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,33,1],
-"d9/d49/kohonen__som__trace_8cpp.html":[8,1,2],
-"d9/d49/structdata__structures_1_1_node.html":[9,0,21,3],
-"d9/d49/structdata__structures_1_1_node.html":[10,0,2,10],
-"d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78":[9,0,21,3,0],
-"d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78":[10,0,2,10,0],
-"d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731":[9,0,21,3,3],
-"d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731":[10,0,2,10,3],
-"d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68":[9,0,21,3,2],
-"d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68":[10,0,2,10,2],
-"d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e":[9,0,21,3,1],
-"d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e":[10,0,2,10,1],
-"d9/d55/namespacesparse__table.html":[9,0,114],
-"d9/d5a/structgeometry_1_1jarvis_1_1_point.html":[10,0,5,1,1],
-"d9/d5d/extended__euclid__algorithm_8cpp.html":[11,0,14,12],
-"d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25":[11,0,14,12,1],
-"d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217":[11,0,14,12,3],
-"d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d":[11,0,14,12,0],
-"d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,12,2],
-"d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html":[11,0,21,7],
-"d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e":[11,0,21,7,0],
-"d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,21,7,2],
-"d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,7,1],
-"d9/d60/namespacerat__maze.html":[9,0,102],
-"d9/d65/lfu__cache_8cpp.html":[11,0,17,9],
-"d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,17,9,3],
-"d9/d65/lfu__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,9,2],
-"d9/d66/group__machine__learning.html":[8,1],
-"d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1":[8,1,8],
-"d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e":[8,1,5],
-"d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c":[8,1,6],
-"d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67":[8,1,7],
-"d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485":[8,1,4],
-"d9/d69/median__search_8cpp.html":[11,0,21,8],
-"d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae":[11,0,21,8,1],
-"d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002":[11,0,21,8,2],
-"d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,21,8,0],
-"d9/d70/namespacequeue__using__array.html":[9,0,97],
-"d9/d75/namespacednf__sort.html":[9,0,25],
-"d9/d80/trapped__rainwater_8cpp.html":[11,0,6,16],
-"d9/d80/trapped__rainwater_8cpp.html#a066e0e739e7c276eee6e61d5b4d37ce8":[11,0,6,16,2],
-"d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,16,1],
-"d9/d80/trapped__rainwater_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,16,0],
-"d9/d89/fibonacci_8cpp.html":[11,0,14,15],
-"d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,15,2],
-"d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,15,1],
-"d9/d89/fibonacci_8cpp.html#aeaaf5439cb29de4630c7dff2fd914b28":[11,0,14,15,0],
-"d9/d90/struct_btree.html":[10,0,22],
-"d9/d92/chaining_8cpp.html":[11,0,12,0],
-"d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,12,0,1],
-"d9/da2/exponential__dist_8cpp.html":[11,0,19,3],
-"d9/da2/exponential__dist_8cpp.html#a1c8b6e787f72a209ef96c096eedf7afc":[11,0,19,3,0],
-"d9/da2/exponential__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,19,3,4],
-"d9/da2/exponential__dist_8cpp.html#ac7b0091e17479d47438a281fefc2549a":[11,0,19,3,1],
-"d9/da2/exponential__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,19,3,3],
-"d9/da2/exponential__dist_8cpp.html#af435dbeb43a05c8c7785f53bf4ce1df1":[11,0,19,3,2],
-"d9/daa/namespacemidpoint__rule.html":[9,0,73],
-"d9/dab/bloom__filter_8cpp.html":[11,0,4,5],
-"d9/dab/bloom__filter_8cpp.html#a271c753baf6dc5ac6f19fa03c5873eb4":[11,0,4,5,2],
-"d9/dab/bloom__filter_8cpp.html#a30edc0d2bb59c185baec81d69d20ed3b":[11,0,4,5,8],
-"d9/dab/bloom__filter_8cpp.html#a35eb2bc3edbb52f9c5f0b1e51046ef15":[11,0,4,5,5],
-"d9/dab/bloom__filter_8cpp.html#a6e509afe40db07681f676ad8da4fb905":[11,0,4,5,7],
-"d9/dab/bloom__filter_8cpp.html#a71f57bf262fe55db928b19dc124cc0d8":[11,0,4,5,9],
-"d9/dab/bloom__filter_8cpp.html#a9ed236419034917c5270c1dccd220b5c":[11,0,4,5,4],
-"d9/dab/bloom__filter_8cpp.html#aa6deb9d4a0f63ea97aef3dce4c6c6677":[11,0,4,5,3],
-"d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,5,6],
-"d9/dae/classdata__structures_1_1_bitset.html":[9,0,21,1],
-"d9/dae/classdata__structures_1_1_bitset.html":[10,0,2,8],
-"d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130":[9,0,21,1,0],
-"d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130":[10,0,2,8,0],
-"d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c":[9,0,21,1,1],
-"d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c":[10,0,2,8,1],
-"d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54":[9,0,21,1,3],
-"d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54":[10,0,2,8,3],
-"d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac":[9,0,21,1,2],
-"d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac":[10,0,2,8,2],
-"d9/dae/classdata__structures_1_1_bitset.html#ad7f7d479079a95bcc9175465395fa23f":[9,0,21,1,4],
-"d9/dae/classdata__structures_1_1_bitset.html#ad7f7d479079a95bcc9175465395fa23f":[10,0,2,8,4],
-"d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73":[9,0,21,1,5],
-"d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73":[10,0,2,8,5],
-"d9/dc9/namespacebase64__encoding.html":[9,0,6],
-"d9/dca/namespacesearch.html":[9,0,106],
-"d9/dd1/namespacelinear__recurrence__matrix.html":[9,0,62],
-"d9/dde/classbinary__search__tree.html":[10,0,21],
-"d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc":[10,0,21,20],
-"d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a":[10,0,21,8],
-"d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd":[10,0,21,16],
-"d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0":[10,0,21,5],
-"d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3":[10,0,21,15],
-"d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13":[10,0,21,10],
-"d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff":[10,0,21,9],
-"d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63":[10,0,21,3],
-"d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb":[10,0,21,4],
-"d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0":[10,0,21,12],
-"d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362":[10,0,21,17],
-"d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb":[10,0,21,14],
-"d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778":[10,0,21,11],
-"d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50":[10,0,21,19],
-"d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2":[10,0,21,2],
-"d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6":[10,0,21,1],
-"d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1":[10,0,21,18],
-"d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03":[10,0,21,7]
+"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf":[10,0,14,0,0,4],
+"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3":[10,0,14,0,0,9],
+"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960":[10,0,14,0,0,8],
+"da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1":[10,0,14,0,0,5],
+"da/d21/class_longest___substring.html":[10,0,41],
+"da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d":[10,0,41,0],
+"da/d23/eulers__totient__function_8cpp.html":[11,0,14,12],
+"da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,14,12,0],
+"da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,12,2],
+"da/d23/eulers__totient__function_8cpp.html#ac37d3ba52eb296597d7a024ba8c4a5a5":[11,0,14,12,1],
+"da/d23/eulers__totient__function_8cpp_source.html":[11,0,14,12],
+"da/d24/sqrt__double_8cpp.html":[11,0,14,54],
+"da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc":[11,0,14,54,1],
+"da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,54,0],
+"da/d24/sqrt__double_8cpp_source.html":[11,0,14,54],
+"da/d27/prim_8cpp_source.html":[11,0,9,17],
+"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html":[10,0,2,3,0],
+"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a0c8cbe7239232863f104793c08273039":[10,0,2,3,0,0],
+"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a6cf72f93b1551f0d943c585b4f173be3":[10,0,2,3,0,2],
+"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e":[10,0,2,3,0,1],
+"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81":[10,0,2,3,0,4],
+"da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad71ecd43d0af1127df5f4006258f9635":[10,0,2,3,0,3],
+"da/d39/volume_8cpp.html":[11,0,14,59],
+"da/d39/volume_8cpp.html#a2d704a7b72a6b2db8b76c8581b577b2c":[11,0,14,59,8],
+"da/d39/volume_8cpp.html#a34d66a77c19ce9b8b3a3d14352b34551":[11,0,14,59,6],
+"da/d39/volume_8cpp.html#a3fdc74c24697ec5bb5c3698c96117c12":[11,0,14,59,5],
+"da/d39/volume_8cpp.html#a3fe35440c27758ecc2287e08217d63a7":[11,0,14,59,0],
+"da/d39/volume_8cpp.html#a94db02b3c9e55a69ac1696f30e2f761c":[11,0,14,59,4],
+"da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,59,7],
+"da/d39/volume_8cpp.html#abde24398be43538c62e4a496968e60ca":[11,0,14,59,2],
+"da/d39/volume_8cpp.html#ae413098478fa38acaac887b7654f0725":[11,0,14,59,1],
+"da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,59,3],
+"da/d39/volume_8cpp_source.html":[11,0,14,59],
+"da/d41/uint128__t_8hpp.html":[11,0,2,7],
+"da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3":[11,0,2,7,5],
+"da/d41/uint128__t_8hpp.html#acce684d03a24f9c13a9ed36de6d24a57":[11,0,2,7,4],
+"da/d41/uint128__t_8hpp_source.html":[11,0,2,7],
+"da/d49/classgreedy__algorithms_1_1_digit_separation.html":[9,0,42,3],
+"da/d49/classgreedy__algorithms_1_1_digit_separation.html":[10,0,7,2],
+"da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8":[9,0,42,3,1],
+"da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8":[10,0,7,2,1],
+"da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79":[9,0,42,3,2],
+"da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79":[10,0,7,2,2],
+"da/d49/classgreedy__algorithms_1_1_digit_separation.html#afd54c969a6c9bab16b4a064fbc8ed40e":[9,0,42,3,0],
+"da/d49/classgreedy__algorithms_1_1_digit_separation.html#afd54c969a6c9bab16b4a064fbc8ed40e":[10,0,7,2,0],
+"da/d4b/depth__first__search__with__stack_8cpp.html":[11,0,9,7],
+"da/d4b/depth__first__search__with__stack_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c":[11,0,9,7,6],
+"da/d4b/depth__first__search__with__stack_8cpp.html#a43e30173f12330e85cce6239a277527e":[11,0,9,7,5],
+"da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,9,7,3],
+"da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9":[11,0,9,7,1],
+"da/d4b/depth__first__search__with__stack_8cpp.html#a7f1cd94cf4da32933e8551cb3577e18b":[11,0,9,7,4],
+"da/d4b/depth__first__search__with__stack_8cpp.html#aadebe9c855821d6515ca5b171222ef7b":[11,0,9,7,0],
+"da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,7,2],
+"da/d4b/depth__first__search__with__stack_8cpp.html#afb80b42b42381658a12a57a975ecd0c7":[11,0,9,7,7],
+"da/d4b/depth__first__search__with__stack_8cpp_source.html":[11,0,9,7],
+"da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html":[11,0,1,2],
+"da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#a0d5e1d651d0d30bd682f176d8f2b83d0":[11,0,1,2,1],
+"da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,2,2],
+"da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,2,0],
+"da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp_source.html":[11,0,1,2],
+"da/d52/minimum__edit__distance_8cpp.html":[11,0,6,21],
+"da/d52/minimum__edit__distance_8cpp.html#a0138c226bd79ffe6d839c787cfc60347":[11,0,6,21,2],
+"da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,6,21,1],
+"da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,21,3],
+"da/d52/minimum__edit__distance_8cpp.html#ade2fcfe0359f3c7691bfaa04b14943e2":[11,0,6,21,0],
+"da/d52/minimum__edit__distance_8cpp_source.html":[11,0,6,21],
+"da/d5a/class_complex.html":[10,0,27],
+"da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6":[10,0,27,11],
+"da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da":[10,0,27,7],
+"da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867":[10,0,27,0],
+"da/d5a/class_complex.html#a466cd7b664cc6a864937ceb3dead1323":[10,0,27,1],
+"da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac":[10,0,27,9],
+"da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c":[10,0,27,6],
+"da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d":[10,0,27,10],
+"da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d":[10,0,27,5],
+"da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90":[10,0,27,8],
+"da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41":[10,0,27,3],
+"da/d5a/class_complex.html#ae5b51b749ea4964104b9527af9d8f556":[10,0,27,2],
+"da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974":[10,0,27,4],
+"da/d61/structsearch_1_1sublist__search_1_1_node.html":[10,0,17,0,0],
+"da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b":[10,0,17,0,0,0],
+"da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a":[10,0,17,0,0,1],
+"da/d68/searching__of__element__in__dynamic__array_8cpp_source.html":[11,0,6,24],
+"da/d6d/namespaceoperations__on__datastructures.html":[9,0,87],
+"da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86":[9,0,87,4],
+"da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74":[9,0,87,1],
+"da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20":[9,0,87,2],
+"da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e":[9,0,87,0],
+"da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8":[9,0,87,3],
+"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html":[10,0,10,0,0,1],
+"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d":[10,0,10,0,0,1,8],
+"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3":[10,0,10,0,0,1,9],
+"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a572de12115e39e34dde6e68b707d59f5":[10,0,10,0,0,1,3],
+"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a695e4314ebc3ab58e13004dc63599fe8":[10,0,10,0,0,1,1],
+"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a6abc89925ae7055a63b428e61525ad7a":[10,0,10,0,0,1,4],
+"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aa816af5a64b37c86be8acda89fdefba2":[10,0,10,0,0,1,5],
+"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7":[10,0,10,0,0,1,0],
+"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317":[10,0,10,0,0,1,6],
+"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3950824936488f66408313b1f8a8ca8":[10,0,10,0,0,1,2],
+"da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3993dbca9c5b3ef9ac361dc7f62ce57":[10,0,10,0,0,1,7],
+"da/d77/spirograph_8cpp.html":[11,0,10,0],
+"da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627":[11,0,10,0,1],
+"da/d77/spirograph_8cpp.html#a525335710b53cb064ca56b936120431e":[11,0,10,0,0],
+"da/d77/spirograph_8cpp.html#a8e83a64e8443fff1e5ffdc1c299c1e99":[11,0,10,0,3],
+"da/d77/spirograph_8cpp.html#aeca22dbe4563358960e907a40cd3e1ac":[11,0,10,0,2],
+"da/d77/spirograph_8cpp_source.html":[11,0,10,0],
+"da/d7b/primality__test_8cpp.html":[11,0,17,19],
+"da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf":[11,0,17,19,0],
+"da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,19,1],
+"da/d7b/primality__test_8cpp_source.html":[11,0,17,19],
+"da/d82/namespacecycle__detection.html":[9,0,19],
+"da/d83/kosaraju_8cpp_source.html":[11,0,9,13],
+"da/d86/struct_test_case.html":[10,0,56],
+"da/d8d/depth__first__search_8cpp.html":[11,0,9,6],
+"da/d8d/depth__first__search_8cpp.html#a64c1db5aad7502c6f08e4652f6edd463":[11,0,9,6,2],
+"da/d8d/depth__first__search_8cpp.html#ab5428a3519267a28bba4b4310cfbb6ae":[11,0,9,6,1],
+"da/d8d/depth__first__search_8cpp.html#ad4016cfc80485a43748895a2c26c7d08":[11,0,9,6,0],
+"da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,6,3],
+"da/d8d/depth__first__search_8cpp_source.html":[11,0,9,6],
+"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html":[10,0,10,1,0],
+"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a080f5b1742832a03c1cbba596a48bd1a":[10,0,10,1,0,4],
+"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a16ddc13621eec6ac5f83658b3401a581":[10,0,10,1,0,7],
+"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200":[10,0,10,1,0,0],
+"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a209383503fb6c03afac405a80bace964":[10,0,10,1,0,8],
+"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e":[10,0,10,1,0,2],
+"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a62e152db014cd4de675fa906e5ef2861":[10,0,10,1,0,6],
+"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b":[10,0,10,1,0,1],
+"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#ac06986d5afddc767ddba4da738f75563":[10,0,10,1,0,5],
+"da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#afe732a33112b457b738f403622d226e5":[10,0,10,1,0,3],
+"da/d9a/class_graph.html":[10,0,34],
+"da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d":[10,0,34,6],
+"da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3":[10,0,34,1],
+"da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1":[10,0,34,7],
+"da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1":[10,0,34,2],
+"da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413":[10,0,34,5],
+"da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910":[10,0,34,4],
+"da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d":[10,0,34,0],
+"da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5":[10,0,34,3],
+"da/d9a/palindrome__of__number_8cpp.html":[11,0,17,15],
+"da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,15,0],
+"da/d9a/palindrome__of__number_8cpp_source.html":[11,0,17,15],
+"da/d9c/namespacegames.html":[9,0,34],
+"da/da3/uint256__t_8hpp.html":[11,0,2,8],
+"da/da3/uint256__t_8hpp.html#a1d8c5ec5b5e419c5c8a740251485102c":[11,0,2,8,4],
+"da/da3/uint256__t_8hpp_source.html":[11,0,2,8],
+"da/dac/n__queens__all__solution__optimised_8cpp.html":[11,0,0,6],
+"da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905":[11,0,0,6,3],
+"da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f":[11,0,0,6,2],
+"da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9":[11,0,0,6,0],
+"da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,6,1],
+"da/dac/n__queens__all__solution__optimised_8cpp_source.html":[11,0,0,6],
+"da/db8/count__of__set__bits_8cpp.html":[11,0,1,1],
+"da/db8/count__of__set__bits_8cpp.html#a86c98dc299e4db28b73e08309d977e62":[11,0,1,1,0],
+"da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,1,1],
+"da/db8/count__of__set__bits_8cpp_source.html":[11,0,1,1],
+"da/dc3/linked__list_8cpp.html":[11,0,4,11],
+"da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180":[11,0,4,11,2],
+"da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,11,3],
+"da/dc3/linked__list_8cpp_source.html":[11,0,4,11],
+"da/dc9/fibonacci__matrix__exponentiation_8cpp.html":[11,0,14,19],
+"da/dc9/fibonacci__matrix__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,19,2],
+"da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f":[11,0,14,19,0],
+"da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,19,1],
+"da/dc9/fibonacci__matrix__exponentiation_8cpp_source.html":[11,0,14,19],
+"da/dd1/structquadratic__probing_1_1_entry.html":[9,0,96,0],
+"da/dd1/structquadratic__probing_1_1_entry.html":[10,0,15,0],
+"da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8":[9,0,96,0,1],
+"da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8":[10,0,15,0,1],
+"da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e":[9,0,96,0,0],
+"da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e":[10,0,15,0,0],
+"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html":[11,0,5,0],
+"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#a7a890d2f26855ada3b9f1d43aec70a86":[11,0,5,0,1],
+"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,5,0,4],
+"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aad9e3edfe156b59fc06a5585403fe0d6":[11,0,5,0,3],
+"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ad76f5cac3ef8dc034f6abb99b64c2b20":[11,0,5,0,0],
+"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,5,0,2],
+"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp_source.html":[11,0,5,0],
+"da/dd3/namespacespirograph.html":[9,0,115],
+"da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99":[9,0,115,1],
+"da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac":[9,0,115,0],
+"da/dd4/namespacemedian__search.html":[9,0,71],
+"da/dda/namespaceradix__sort.html":[9,0,99],
+"da/de7/decimal__to__hexadecimal_8cpp.html":[11,0,17,2],
+"da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe":[11,0,17,2,0],
+"da/de7/decimal__to__hexadecimal_8cpp_source.html":[11,0,17,2],
+"da/de8/dijkstra__greedy_8cpp.html":[11,0,11,3],
+"da/de8/dijkstra__greedy_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,11,3,5],
+"da/de8/dijkstra__greedy_8cpp.html#a7341d7c76a6145e991cdd231f689fca8":[11,0,11,3,4],
+"da/de8/dijkstra__greedy_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,11,3,2],
+"da/de8/dijkstra__greedy_8cpp.html#af6cb29ca6dc5771439f6ea7262058a71":[11,0,11,3,3],
+"da/de8/dijkstra__greedy_8cpp.html#af915876d0ca33cc71a6a6191a8cd3ccd":[11,0,11,3,1],
+"da/de8/dijkstra__greedy_8cpp_source.html":[11,0,11,3],
+"da/df2/durand__kerner__roots_8cpp.html":[11,0,15,4],
+"da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377":[11,0,15,4,1],
+"da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,15,4,6],
+"da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,15,4,5],
+"da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd":[11,0,15,4,3],
+"da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c":[11,0,15,4,2],
+"da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569":[11,0,15,4,4],
+"da/df2/durand__kerner__roots_8cpp.html#af270a96662132d0385cb6b4637c5a689":[11,0,15,4,0],
+"da/df2/durand__kerner__roots_8cpp_source.html":[11,0,15,4],
+"db/d01/brent__method__extrema_8cpp.html":[11,0,15,2],
+"db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70":[11,0,15,2,1],
+"db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0":[11,0,15,2,5],
+"db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0":[11,0,15,2,4],
+"db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b":[11,0,15,2,2],
+"db/d01/brent__method__extrema_8cpp.html#a525335710b53cb064ca56b936120431e":[11,0,15,2,0],
+"db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e":[11,0,15,2,6],
+"db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,2,3],
+"db/d01/brent__method__extrema_8cpp_source.html":[11,0,15,2],
+"db/d03/_s_t-example.html":[12,0],
+"db/d03/namespacewildcard__matching.html":[9,0,140],
+"db/d07/spiral__print_8cpp.html":[11,0,17,23],
+"db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197":[11,0,17,23,2],
+"db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5":[11,0,17,23,0],
+"db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,23,1],
+"db/d07/spiral__print_8cpp_source.html":[11,0,17,23],
+"db/d09/duval_8cpp.html":[11,0,24,2],
+"db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,24,2,2],
+"db/d09/duval_8cpp.html#ac2a35302e6bed93c4b2c6f55a21a5632":[11,0,24,2,0],
+"db/d09/duval_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,24,2,1],
+"db/d09/duval_8cpp_source.html":[11,0,24,2],
+"db/d0d/prime__factorization_8cpp.html":[11,0,14,48],
+"db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46":[11,0,14,48,1],
+"db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23":[11,0,14,48,4],
+"db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b":[11,0,14,48,3],
+"db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,48,0],
+"db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe":[11,0,14,48,5],
+"db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099":[11,0,14,48,2],
+"db/d0d/prime__factorization_8cpp_source.html":[11,0,14,48],
+"db/d16/0__1__knapsack_8cpp.html":[11,0,6,0],
+"db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1":[11,0,6,0,1],
+"db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,0,2],
+"db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,0,0],
+"db/d16/0__1__knapsack_8cpp_source.html":[11,0,6,0],
+"db/d19/structlinear__probing_1_1_entry.html":[9,0,61,0],
+"db/d19/structlinear__probing_1_1_entry.html":[10,0,9,0],
+"db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77":[9,0,61,0,0],
+"db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77":[10,0,9,0,0],
+"db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a":[9,0,61,0,1],
+"db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a":[10,0,9,0,1],
+"db/d27/n__bonacci_8cpp.html":[11,0,14,41],
+"db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d":[11,0,14,41,1],
+"db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,41,2],
+"db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,41,0],
+"db/d27/n__bonacci_8cpp_source.html":[11,0,14,41],
+"db/d3c/tower__of__hanoi_8cpp.html":[11,0,17,25],
+"db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed":[11,0,17,25,3],
+"db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417":[11,0,17,25,4],
+"db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,25,1]
 };
diff --git a/pages.html b/pages.html
index 1eb520890..2149bd471 100644
--- a/pages.html
+++ b/pages.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Related Pages</title>
+<title>TheAlgorithms/C++: Related Pages</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>
diff --git a/project_logo.png b/project_logo.png
new file mode 100644
index 0000000000000000000000000000000000000000..f857ccaf1fcc7de998248cea60ecffa774562b79
GIT binary patch
literal 7452
zcmd6s^;gtS)W-qYC6^BAMx+I#yFogZrC9_dB$RFt78Ddj1f(0KyB3LM>F!vmMd|K_
zhwt;_^A|in%*;8TGc$M2=ggh^zOVa9Pe%=ePm7O%fdSG`S2lPY`~GXVSdTrcq(nak
z2K`?RWd$R@jNQyxPqzNdjX?wnwtT15ho!)p`H%oJ+QqKnOwI!F#l(WZ=D^nW4aR-@
zWzm8!pgm-i1Na60bCD2K^;Q~tUl9N#t$@WGGz~;-F*4U;u!d{qboA+RQT%wzT&f<F
zntE2dkgpq}M2c&G6uAN7Hj=aQVo`mp!i6w*vf6~>#)bj@|9x<#RjhT#;8BKXBgLfB
zCK|<V_&pFWZ-52Q%3VgCQMCRloGFu$`RYt)n(NDbqY}gAi};PX{nFG0MX2ljc77ys
zqK`+?s_Z=Y3TulEQH{`w<`<Nhx*O&ZP3iS<(f-@u3fs_e>2!1ZN4aG&a`hgx#U_oU
zm&wTG;;sZ|j(mCDQt$A-G?GJa3NhJ2p)Gctm;8mnnDx_X!U`l5ZWwxZeTmQl7j}8N
z4F3b;@vK*MSvCNzr{HkdHR;39=FO~sl90G8^O^R`Y;%sXjwz3b$~h|O$xQ47S+d%+
z)j~D-hts}2VVQ+2WMG3f;9;wjZ6n4`Gwo`+<a;ssQ?K745%7bog-k5bor3PC^gE4i
zyECDQ$LMoh9zj_y4-Pq^%u(HYv~ZzvC+ezONgkrb>7r_+WcG)OW*^oY&p2Wx>O&VG
z+BL*Cj}NF09;>StNGcI>-Cp@eBDe{$*r<^x@c&J`jt&0jn<eCvb>=<o8-Ki-jLRc3
zks?ADrqEj|W-xq^&48xl7-UJ;Y{{x**8a9Tg;O+`g{4cyxznUD|Bfz_gQ9`Vrizbb
z{7Uh^+1LQ+(!yUM(*pk>VKxfGbLx=sy(W=OmsYj^CVMaKg{AQPDN!rAQeq2EC9>@Q
z%A7Njy)n1aWmD)o=2cCTH{A^CJXZS2!<k;&=Fijr&twoCL1Uvw{@L*kTHxP_Y;8`L
z{t@2Kl4U=BpdVNFyQ;>uq)(4n(9s+vzxZ?D9lGHepQ^__W!;))4%hPTQ^7eZ$^1yN
zCt#~`$xNK(nY_m(LBjcAN#WXW;31G?=ljGfJe$Z@MZ6ye(Wap$3r+xFU|SG$?g%SF
z?c$Albo9@97{|xG2+q+g*31OE`_HPuqANh)-bXMnJdcQJ851~-{slegYxs@#d1HED
z3=&#?!NX=|4q@$eJ`FCxdOYijM4ZMO`pVe^P6=NrepgPLs+&J5X?cV<z0O=;cbq{L
zXHjcP1O%~fHj&R(G{>ra*^`pO-#9MQ`>j^D&4UZZl97J{4Ld&eFbTQtS<B$!D+*Bb
zCDlF6ml;WOGgYmtsv5b5FX3eW?!CMFW^@v*iX$Y+_xMK?V(ry^97h8!J92{kPg*Z}
zs&-l>yHi%PUHw}g?ePe{#QN;0`{X(?j6IP+B-ksIHcf7h=u?i+ed>#jwV|Sk^)Ia#
z4;qFPK@*ZYzRz;`+UgyRp&U})ht;Sf{Jm4d@IISHbzUTET0B=N`1+0f*`H(?i-s-=
zTk}8bno0mbvW#B<^-=PgN-6%%Hk1T{_ibw@BG&FCrPH!VZ$qwGI2GqD&Ig<5nP;Lr
zWDE2(+ZsL%hk4WAI#*3O#W8zmA+wD%St)k+brmxB44*Ruz^T%mx28!GV#GbQ>9f95
z)bB2b&kI3BxLr9;);xiJW(JU-o_|fti|jsb?8VYe49fu_G)>B6(*rB%41i=F$@HD8
z>%z_S=C>ma*cEo+TL~Ek;a>VzV*#D3H0ziAml*CSl)F^ChKL+PShCXKwRr(MUwF~V
zWRg>$HDx>R1?is{oYTW!-*d;oFOwUxsydM}&F2R070l|JNIWe<#7Vw`7IqJgaKK@t
zUGz+W?Nqh$2LC47$?~<+4&Kfw(dKXA-2nY^jJ3YnvWp{nK}XbrYkUTqR%dmzE>)Pq
zUiE{jA#PA)dtGX$5^L_z@z3taBtg1WqOo+Bq>*THn%xoSS3A#h1ftPs*+X22c-HbI
zf~ZpWFU}%xsn@f-$+7-N)vcamrBJfqE`!EPIeN*mi>!wHDSIyEzA#<S7)WQGx5wW%
zPBHI8FKC}?rGd&H561yrlModr0z%D}-U|N~37vS}dj6a47GFPD9Iuo#?(0@S!_a!E
z<PDwgZ|6DW<OiQ<Fj=y@4{s$niSX#Rx3_u86*QkGMT=&6>GuT1-*n8onHaxL@R{}m
zg}pV<_q-O<mlkDiuQQ0t^V5ia5l1Pq+~tpfDa|oG&uWP25wj_c0o+HtYVpW9v)HW}
z-UDywE}H0O!y0U`*!!AH3U(|ISO)T%7?{!A8X|49;LH%x3&h`>Nh}kxI-QLZQDs9w
z%CPB-Zy2Iuio{wLsTNf?)Y{qWjLb5bk}-H9jm(f&H9?+ZPQ3py<BX-3{G-3NlFKrr
z1o7yyPhWYaiC(74kJLp~@zYby4KPDxogM20@&!Pxt5;c-)-2lZCFL-AO};aWTbIpv
z$nBwjIgx8EUC3s*vJmUK;10@xvO<i;W8;v9{p-=TG?GL*B5!b2^|PSLobz%sK(_kD
zZ#ONoInh707Zn+^s7S!za{TyH%!r00zG6*B3)<6aekpM|+yAUGNn_zFUNpwOTuxfw
z&GV$L8@+NcD_YSfz}?wI5L&|lf~jSZG~{hp?>Yu@et)EEBreTX$ociRB`06wK&D*y
z+G+^-TGm%;JGB<tX9+P)B9pB{fu&z&d{pW8eCt6dLIRm>puvPXiSHa}nsrELyh_X+
z*=Qm<D5gEu?-V8VXZ3{wp5>I7G-sRu%wEjnQ+%!{RLGKcw^R~@<5R2!ix9_ep#JFO
z%FD4UBhhRTGS4jujG|NOtFY6e+UW+b<GA%jOYlBrd?0@TuW(~AeZl%<|GjrwYyA3S
z+zHqpYk+qrt0v>q2OhFKm1I$}<10JVBhFYcR(dgCa}rBynVoCgTC&pjHwk~vB@R2K
zUy`L%)2~jh5a(p#UsMpxxMC=FpQ8N7TfmAt!}Mm_?i6DDh$H0(P5DW|nqMoCpC3N@
z@V%T<zX@c+?WT}Yn$*0oR;X)ty@|YR@yj;yNY|vKP*vYZwGyP%?eTSG!t?~Vi>66#
zj#g_EqYnF=_ZUILL%Lu74aT6tG-8hOS);VT;MUSqh)?|K%egHgJD-B^xXdWhUXM-I
zf+fv3cj|dVH)4&8%Lw0<zQ9jOFkO<@WR`-90j|sa+irNOsFW6*%00)Oi8H--nIcR=
z#ZwIXW|3@$Pyi<oHi7cd0{?qzE_`21S|yBc>u91=EZ+JgIsc{mF5If(d9EP}oe0Qn
z<D=K{9Cn(@)gNPFVfx3#8(xG)q1L}x7RQ{fNf1>i7+2Xc*L6L<KA86y+@me+)_H&d
zB75ed&kSe;oQe;*pTHe}NqB9afn-zr&#(ed1hY65N9iC*##0Pd{Vj{7FRQbEov!UL
zPtiYQT3lfVOKo-i3ds%mIKpQi!_bdj&|x<lxfn#`FJb>-H<Dv)iqxyDB6sK&;8rh{
z7Fl7!@XAO|sjiZM|MFbc_3PmJ3U1e{^sBr!pg~c2Fy$^f!R2f6Zlw3jhK^FVAiI}D
zcFSA5Uu}%eyia!9rm#EVd36dmF*veL2$}@-F_=?0;zP7r9Qv?^d}fPbEIR)qho1S&
zccr@ATuJ)9g(um~+$6Q;d3u3l8?p7P8mZF6(U&Sw0k&r^x9ZCM<|d9yuzDF~6J8_O
z{PB3^S-yp>1vP{1_ou#eF;Iz%4Z<6~oObzKBIud5RaPf<=btP&nE#35TgTCh5+Tcg
znEx94K`$eHOa_+c#U!wLZ~+n>7kEk(piu8hkACBvqP>FK3F$f@)rm7IjeqmnLZ%xi
z1?jW$oWwgDw))f|{s0^)FV{gvs%j)yqQ=?SgYd1RV`ytGT)9e!UTG0%JWe3qv_{*z
zN;jq|KY5ssM~0H`Y62BWUOT9s;QM>yeov?hnq-q;?o%cy6Jsbnp$~N0Rrhv;rJE_>
z^x|Lx=Ela(=vn4jCW}6_fF8YjEf0&vs;V9MN>ur#Wt(?;<KBl9KiUKqwPw$o6gzan
zOK@Q<?6%jK8QV*X3!9={9)c`5H8+gc7T5LHZUnS(r`2-kQDmgsFQ~dWKK((9d5h`A
zZz91x25;C47U`unvEji^J$tw_J(~qM601oO>4e!1-KUc7(A6PX!T)M(Re&wEl2t>m
zU?@}|)8g{|>Bfu3yF0N=lTs|<{8tY*VhJH*cz%m4yA$}0T?!xVNh)qSlWb8a6D#ny
zBG%06vWPcL9sfKk+S)h|*XexCcIpx}Vl5&$!0X*6BV6zY^ao<+cb;E5s?D?S3B{QS
zU<J}EnXb9DL;{LfrXE36AN1?6;<`a4r;ejMlpeq4r@?=gsOaeqWi!rXGeDm~cBnxg
z0^xl>V|@?kxolQSe6$*sIkfX_SUDl*=+bomCn$Cl+I0OI)*+a(K9U${130(!E9^Yk
zu^zgc%wD>odd=@bsOh$KwasC9cJXy%E`nGEZewH!w(|6GvtBw)qOumx%&y{dZCkGQ
z)a*ti!a7dX-@Ue$95pu)4Qvm<lWU`pmKJCTInzH{nPz*FQvSEkdQTTdZi-95fAYS5
zKKK?_1Z1oYF8xI4Wxfn>N66B9vpa`v3xS!X7YL~BcJ7N%Mot&Lm3M~7Zc`Sl!OQiY
z>-(cyO=Ir0ZTC>Ti(?8%kDOS@_}Y)_zi;TLd<N?3D<xahQ$+30hCdG|Lxz{}Pw@Fg
zh|DmzpPi48q!~X)kMaNEHe=_u$WZtFH)*^`V3?qVoT=&fH|9NX`zM|WQ4*j#VLNvv
zK#YE8#+%G3G?h3$mDI*UIZQos)XDB>|MkOe%M(o-=cgmSD)<U<r{3L`Iju`)^n8Hw
zohy8giGfn%()I_hHQ#L29BKEkL&s3UWA}T<EesiH`h|D3&qYij{&6tm8hiNjI!aPk
zN5_Sw%C_8GdHranFsF!tlOIrG=(AQ-(CFVN2Ei6dC!wxP@a0ns#Yxg?4}Si{mrC_Y
zx07sQX{WUEi7-mqJ)9F2jyxHX=6w?2<0a#U7;lQ=2E^?RX3@4uzF{a2;U8YnJ-XMy
zc<lr(4Sz_c)fFZ_P(-6Y!gb_V08txTI}dBitt<ZP+x2?VeV!I&JHQA~;&7^%FCguM
zr<Au<HshKf!R)ZD;nsWEjDgMgpv;z~Uq4d!RQ<rW=@Y=tp1mg>Oe?|C?xxF7&xxi^
z=lp(MSYqhy=l+dKWy3Qy>@=&ZyPtT093~Yv=_V!0La4p4n@HcgDx<slZvn1##9k8S
zCXLQ6AT8=^d9@q3+tLj)H+yJHyZL9rGm6nvS9gLhrzjFSlUJ{V8x`Rmnl^ey-it|I
zyUX__&mWW>0$W2eeK2uG8UbvXIM1f72j!&jV^_+SEj@Lt1I6(hvws0IXH9%Y^o)q_
z^t1))cnPGaxCaKOrkL(`gGDy78K1{l&1M1NZPuc@0b4?Nc5&Tj+bS8xpS<V_xVY`N
z3AG64T*_ypFH_uwuCujlv9tq2?qapNC7A|d#pw@>KkuxeREl>5_v@_0%MI!Q<>AQ`
zGt&ysQV#C6?MKBb`7>q;sw4W>>f5R~j|~e$$FYS7P6>^}C#A^!lS+o<v{7J}(@XBe
z=N%`DH;qgUA$R)oclspP_vcD$dc7leuh;wu55=z>RMWZ2*8fy*hp)rp*xG~b2jOjo
zW!#Svo!<VW$L%cF(lqI~?z7Z!uNx`lD^X@>NTA^9e9Bt`cIuQ@MN#*+#N>8AF-XdZ
zm>Bo9Q!YeTqr8a+I<q+W!apIHS9(Yz5$!>i5@fkQ5~avJO1xea>$Fmi2U&-okEOc0
zruT20(DQikCJs6&zL}{n&mC>AsNuCS-yD*YGBdDDv48J8{UxtUxzr6tNy4@LG=^b}
zDZ?mRp3_KQTwuRWHP8~sb<*lU(Qovh#!KNdE)YJS-RUhv7b89)_T8y@L^Qh8T-;%K
z%7K>8mDC<{<EBt9IuyWj<{*mA4${}<ad^rv@PzInFhgJ&gOM=?nnp<!N&o|xv`%1m
zs>_Cs*CDL9)=wsEKNEV*2Bc5qs~4i9)gGoi45g(TwINRB>t#&0H3>oDc!tk{1RMDR
z%XZwSNvqlywiH`AVhXw&u-6amy!S$yX2?QlgL`7;wN_*~p68Cs=Ez{DYnqofC=gK8
zKhy@w^SxBzg<Ae80_5)8tTna=nceDE^WXS4<{QGnK<_+)$TO>D6<-ab{EG<x!5$)m
z#^P(IUsc#KsQUw5Xr&-{C><9Z6*=ukWG~T@Rc?`<FqGbcqe~t3u{{x{afQ1hNzX_E
zZm=Y0+^<#4y?{7vg8k4nq7dWn%*=Zcwu?Z4y#oiEu9zj|8@R3Br4spzR++FtRgtz^
zYb6-$`DqDOW{Z{U^t&vYFJ=XQR%|sI6>fGwfWuRr$rdKLZ%VjRFSW7`qEN58EgJ~l
zSklb(HI7&D6xOHp+2m*Eex;=aaz?MXMacK?rVJxo)5(2KXehA9m3ir;G`X55W+9DU
ze<QuULW|yqL;J_GuuqL=_t(3*nSV&%X!cFoTK@SEyMvf-&@LF8z~c53Sx6Zd89`3w
zAOkfkVeJj)lR3ab1!-=FU%F0!pxS&78ijGU2(8@Oosnm{F*pM7%ng3?-fCVUJA43K
zH2zh(`4Rs9VZ;?epv`p%B%%&^1PU>Ll+tj4ws9aw>7)s<G_r%HfD#TeoAD*e;{B&-
z`TH3`;xTD5Ytjq<^ACljPLC@dZ=8A|*rkXxkX(1tqf7zqk_aoQD7S7tpMd*Owt$4B
z55l<TvOrCLlWR;ZzNoQ>z{44{RB?G8BamnhWn`8BB4Be^kwl8cd!NCW=+O%*Jmt%<
zk-H(c5ZNfdR)MMJC#t2_>pjPXQ0E_xkyR_|n60xWp1S7!pCrmX+$nF!AR)M6gLW-B
zX&mo<zC=Bl!FOa`)I;QF6!8gJm_QG?5&UJ5-5!|J+Fz?6u6G?YStXmW+?bMr^Ca!d
zVk>ZbG)f-giwzvSDWZe=cJT8aM3`1xzh-qpp?ZTCxiuOaVQMR8&gNc}43C)LAZ)uN
z^8!u=I_EdS)<MQM?}0ohS17?XhScGxzNSZ(RbPe}7>_XJ61k5ubMA(iG<Jydr6o`2
z*`s8Qtim{UTjN#CIyDKF#_SIA{c|*{S(BgM-wry@L;%0;j<w#o>xKcQ&)&{MyrZbh
zaXEp`?3QVuqH-A+gfP%GqvdTcu|wScXvRpq3J`7>P=3v7W&h-<8A+2Jw~$c{_fNv>
zxK_5Zgu<sLyjk`i^k`^y(p@<PQr5P&i}R*vI_zpZ4lW18lSLhwSz-1>vfqo&1FR7K
zvUgYM%l8v<!nD4YGIq*0i%ZW4Dj!B4PL+}b2BD_ZM~5pq(p_9-W9m#}HBqa80wQw=
z>7J;gf9)3(zNUZbhk8HJm5K*?r0`JB!=*Uy%xbKOhg5cu2X^5@tYWMTA51Nv*7@k4
zs78mqKQ-4jc8tAXn+!?0^dE}21I0xk0CBzU+5ozmb$!%5y2L3%s*_7<o=TxtC0SC^
z&BB<<U`%>h)6K&yaAMDE>vMX!A85*MMn;&s!_*xiLL(lVADY>+m!hZflg`CO>~n?z
z%lodPt?7p|o??Dd29Ng3_VyHK(RWX;y+SN5u7;0|3nn;6L#n)B=eqG;GUh!L`w{j$
zycCI<PyQFWG3B~pftBH)2F`ISlcZ6Fs_18vxuCd+qc;ZODiCUZb3!vDLARa#kzn7X
zSLT<de@Z%&$))?h3gkeYXX->*3y6Pc1S{`cbbee0UHbQL1mt_3h|C?cRObf^bTXBx
zrPN!;@7P<gB;!(y(*Am4HU8WdTiJ{mSc}&CV&_=zty?I=ck55j>8-AjEujvP0<NY=
zyP98_oJXX!>1ekI3)bh;qM3%JVV4du)D&F7Io#R+Xi#9-DfLcJ^Y*(GubVI4^RGo~
zN34xuAGZ@A5G<9eoV;z$QO1<yB3-{bdf6--t-ZHG^@k4+D%=8-XyiOw2UO9J{Nb7@
zO>oZpLN$(>lQ_huaze@vaYa^M+x~90^fQO%z`OA}cL(JQSXbvaKOVv_rw$&XOXZ18
z-F`%GBr4rBHe2ch+=b+6*|ZPjT1}7vn|`fUxnHf(L#LWgygyYC^67!+Ad)ESh_ebI
z1N=uUsq`ztvG-p8j0V&s5e^4UH2=<zv+WTa82k=$t|H&_Rm;ud7wi0YbtD&z_N&%Z
zvUg6}I6{X$wA{>Vf_yh2C>zaIg5L)3F4b)t>%Qx3s)sg)5@on<o>UrffmV+aoDBDZ
zjxks0AM-a}%2L4@d2{vvNjV}e@lt)$aVc|QX?Jn)>WWtT_x@=c&32l;^d7AchRYq_
zmyKs{Jg>^kC<R<8eVksR!0bB`+($HzvN}%&BvNh066V;bP|$_s*6$@dFVtQR(l9AH
zS*nOEu5B$UV>gx_H}qc4a(>+GWHgQ{&<{KLOcylUfE~j+4}L^NEBNc`nJQJRDA%zj
z@37}yU3ZJC-Y%cBza|=k{ZmB(Iv}qePCrJTyYxo_d=G6WX_{EnYH{O;KYG!X6%)(9
z<T9YSjOP{+{aOKGXin&m3oKId1=83$tI|FKH!6OxgXNLO#NPbbV@mPlve@<j*M&Cc
zQ9K{|_3<<<#xt(8u##O*=1^T9aeNL=Qhj{)q2dC>#X|((PNh~4>y@<9VDKmIggT`{
zr;(_DRXtU`+A!+!SU0ubK@n2y>?Bm9g1r|VABB-|)YDxbi2YtpGhCIHsag<Qj+#Jz
zrC#-au+TAkOwgO&#~Gmy$sW1?4DotC746`RTrInWc=@|u1dXrCxFY^}Y!T91(9-U;
z^SZ{Oc;_sZKzx7RL@egDlIkaPEUZM-HaG>G`DRaaPRA(`blyC)$L)n)WOr8rHixHL
z;*Cxm91E)E$8V<{hww@?{TY?E|Cke>7Y^q~*LG_MK98Ees$|;y2Nj`udcB=uaXY0l
zd7r9pxmd5XO$i=y10H+)>KqOq-+$i;Hf%(o^a_M$>Rm&fq*clW8Fy;LwyD12eK|i1
zx~m!C&4)KAhUcAUFO}wMn2|#bX@bB&eTz|WhX|uTk|!xTz5~O?XqybY;1JWic9Zff
z=Jk=b>mtxamEqN#TM0Ic7}g|P>NTzREJvAxx6CgZ(IlVWim}28*cY|-q8z68&QC}n
zRQu;2mG?RaN|GKCEPRY9Y1Myw@yKFi4lE6_s;JOspY&+9PxX|P1ADfQ!if%IjMncT
zZZ=jEnCw+1v9zi0+b>^gj~k8eOptDGdv}YaT$ybD4CQ+`%C<@`AhP?#*t-hHs&VSi
z$S^A`dwy=bx*5eZdU(KeiKoJ4;M62C%(vcfHo?+|{r|6G_kT)>m!pq`&WDHMx2cL^
T!bktrJ~1>@bd)O;Z9e=D#pz|V

literal 0
HcmV?d00001

diff --git a/search/all_10.js b/search/all_10.js
index f03f173a1..a95d99d8f 100644
--- a/search/all_10.js
+++ b/search/all_10.js
@@ -1,6 +1,6 @@
 var searchData=
 [
-  ['k_0',['k',['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/params.html',0,'std::negative_binomial_distribution::k()'],['../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442',1,'numerical_methods::simpson_method::k()'],['../df/d11/midpoint__integral__method_8cpp.html#ae9f66040f8e0ba73c1c741261c22a52a',1,'numerical_methods::midpoint_rule::k()']]],
+  ['k_0',['k',['../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442',1,'numerical_methods::simpson_method::k()'],['../df/d11/midpoint__integral__method_8cpp.html#ae9f66040f8e0ba73c1c741261c22a52a',1,'numerical_methods::midpoint_rule::k()']]],
   ['k_5fnearest_5fneighbors_1',['k_nearest_neighbors',['../d7/d4c/namespacek__nearest__neighbors.html',1,'']]],
   ['k_5fnearest_5fneighbors_2ecpp_2',['k_nearest_neighbors.cpp',['../d4/d3e/k__nearest__neighbors_8cpp.html',1,'']]],
   ['kadane_3',['kadane',['../d6/d74/namespacekadane.html',1,'']]],
@@ -11,22 +11,17 @@ var searchData=
   ['kelvin_5fto_5fcelsius_8',['kelvin_to_celsius',['../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec',1,'others']]],
   ['kelvin_5fto_5fcelsius_2ecpp_9',['kelvin_to_celsius.cpp',['../db/d6b/kelvin__to__celsius_8cpp.html',1,'']]],
   ['key_10',['key',['../d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68',1,'data_structures::Node::key'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a32db3ba3b2630943faacd27b2ecd1b04',1,'data_structures::treap::Treap::key'],['../d9/dde/structdouble__hashing_1_1_entry.html#ae114967c89dbba3b754dc4976bba3248',1,'double_hashing::Entry::key'],['../db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a',1,'linear_probing::Entry::key'],['../da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8',1,'quadratic_probing::Entry::key'],['../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c',1,'list::key']]],
-  ['key_5fcomp_11',['key_comp',['http://en.cppreference.com/w/cpp/container/multiset/key_comp.html',0,'std::multiset::key_comp()'],['http://en.cppreference.com/w/cpp/container/set/key_comp.html',0,'std::set::key_comp()'],['http://en.cppreference.com/w/cpp/container/map/key_comp.html',0,'std::map::key_comp()'],['http://en.cppreference.com/w/cpp/container/multimap/key_comp.html',0,'std::multimap::key_comp()']]],
-  ['key_5feq_12',['key_eq',['http://en.cppreference.com/w/cpp/container/unordered_map/key_eq.html',0,'std::unordered_map::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/key_eq.html',0,'std::unordered_multimap::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/key_eq.html',0,'std::unordered_multiset::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_set/key_eq.html',0,'std::unordered_set::key_eq()']]],
-  ['kill_5fdependency_13',['kill_dependency',['http://en.cppreference.com/w/cpp/atomic/kill_dependency.html',0,'std']]],
-  ['kilo_14',['kilo',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['kmp_15',['kmp',['../d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e',1,'string_search']]],
-  ['knapsack_16',['Knapsack',['../d7/daf/namespace_knapsack.html',1,'']]],
-  ['knapsackfilling_17',['KnapSackFilling',['../d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c',1,'dynamic_programming::unbounded_knapsack']]],
-  ['knight_5ftour_18',['knight_tour',['../d1/db6/namespaceknight__tour.html',1,'']]],
-  ['knight_5ftour_2ecpp_19',['knight_tour.cpp',['../d1/d2a/knight__tour_8cpp.html',1,'']]],
-  ['knn_20',['Knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html',1,'machine_learning::k_nearest_neighbors::Knn'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200',1,'machine_learning::k_nearest_neighbors::Knn::Knn(std::vector&lt; std::vector&lt; double &gt; &gt; &amp;X, std::vector&lt; int &gt; &amp;Y)'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b',1,'machine_learning::k_nearest_neighbors::Knn::Knn(const Knn &amp;model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e',1,'machine_learning::k_nearest_neighbors::Knn::Knn(Knn &amp;&amp;)=default']]],
-  ['knuth_5fb_21',['knuth_b',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine.html',0,'std::knuth_b'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::knuth_b::knuth_b()']]],
-  ['knuth_5fmorris_5fpratt_2ecpp_22',['knuth_morris_pratt.cpp',['../de/d6a/knuth__morris__pratt_8cpp.html',1,'']]],
-  ['kohonen_5fsom_23',['kohonen_som',['../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576',1,'machine_learning']]],
-  ['kohonen_5fsom_5ftopology_2ecpp_24',['kohonen_som_topology.cpp',['../d4/def/kohonen__som__topology_8cpp.html',1,'']]],
-  ['kohonen_5fsom_5ftrace_2ecpp_25',['kohonen_som_trace.cpp',['../d9/d49/kohonen__som__trace_8cpp.html',1,'']]],
-  ['kohonen_5fsom_5ftracer_26',['kohonen_som_tracer',['../d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3',1,'machine_learning']]],
-  ['kruskals_5fminimum_5fspanning_5ftree_2ecpp_27',['kruskals_minimum_spanning_tree.cpp',['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html',1,'']]],
-  ['kth_5fancestor_28',['kth_ancestor',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a8f7bca1746d40f21ad832fcea59aa6c6',1,'range_queries::heavy_light_decomposition::Tree']]]
+  ['kmp_11',['kmp',['../d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e',1,'string_search']]],
+  ['knapsack_12',['Knapsack',['../d7/daf/namespace_knapsack.html',1,'']]],
+  ['knapsackfilling_13',['KnapSackFilling',['../d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c',1,'dynamic_programming::unbounded_knapsack']]],
+  ['knight_5ftour_14',['knight_tour',['../d1/db6/namespaceknight__tour.html',1,'']]],
+  ['knight_5ftour_2ecpp_15',['knight_tour.cpp',['../d1/d2a/knight__tour_8cpp.html',1,'']]],
+  ['knn_16',['Knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html',1,'machine_learning::k_nearest_neighbors::Knn'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200',1,'machine_learning::k_nearest_neighbors::Knn::Knn(std::vector&lt; std::vector&lt; double &gt; &gt; &amp;X, std::vector&lt; int &gt; &amp;Y)'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b',1,'machine_learning::k_nearest_neighbors::Knn::Knn(const Knn &amp;model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e',1,'machine_learning::k_nearest_neighbors::Knn::Knn(Knn &amp;&amp;)=default']]],
+  ['knuth_5fmorris_5fpratt_2ecpp_17',['knuth_morris_pratt.cpp',['../de/d6a/knuth__morris__pratt_8cpp.html',1,'']]],
+  ['kohonen_5fsom_18',['kohonen_som',['../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576',1,'machine_learning']]],
+  ['kohonen_5fsom_5ftopology_2ecpp_19',['kohonen_som_topology.cpp',['../d4/def/kohonen__som__topology_8cpp.html',1,'']]],
+  ['kohonen_5fsom_5ftrace_2ecpp_20',['kohonen_som_trace.cpp',['../d9/d49/kohonen__som__trace_8cpp.html',1,'']]],
+  ['kohonen_5fsom_5ftracer_21',['kohonen_som_tracer',['../d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3',1,'machine_learning']]],
+  ['kruskals_5fminimum_5fspanning_5ftree_2ecpp_22',['kruskals_minimum_spanning_tree.cpp',['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html',1,'']]],
+  ['kth_5fancestor_23',['kth_ancestor',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a8f7bca1746d40f21ad832fcea59aa6c6',1,'range_queries::heavy_light_decomposition::Tree']]]
 ];
diff --git a/search/all_11.js b/search/all_11.js
index 2e12b058b..26518430b 100644
--- a/search/all_11.js
+++ b/search/all_11.js
@@ -2,116 +2,75 @@ var searchData=
 [
   ['l_0',['l',['../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a',1,'numerical_methods::simpson_method::l()'],['../df/d11/midpoint__integral__method_8cpp.html#ad53616fb4fa6880ae876bcba53365c51',1,'numerical_methods::midpoint_rule::l()']]],
   ['label_1',['label',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a722cc7cf2c3e4d15583601a48b09776f',1,'range_queries::heavy_light_decomposition::HLD']]],
-  ['labs_2',['labs',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]],
-  ['lambda_3',['lambda',['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/lambda.html',0,'std::exponential_distribution']]],
-  ['large_5ffactorial_2ecpp_4',['large_factorial.cpp',['../d6/d9d/large__factorial_8cpp.html',1,'']]],
-  ['large_5fnumber_5',['large_number',['../db/d82/classlarge__number.html',1,'large_number'],['../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337',1,'large_number::large_number()'],['../db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a',1,'large_number::large_number(int n)'],['../db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872',1,'large_number::large_number(const large_number &amp;a)'],['../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f',1,'large_number::large_number(std::vector&lt; unsigned char &gt; &amp;vec)']]],
-  ['large_5fnumber_2eh_6',['large_number.h',['../d4/d86/large__number_8h.html',1,'']]],
-  ['largest_5fpower_2ecpp_7',['largest_power.cpp',['../d5/d7a/largest__power_8cpp.html',1,'']]],
-  ['largestpower_8',['largestPower',['../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f',1,'math']]],
-  ['last_9',['last',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015',1,'data_structures::linked_list::list']]],
-  ['layers_10',['layers',['../d5/d2c/namespacelayers.html',1,'']]],
-  ['lazy_11',['lazy',['../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79',1,'range_queries::perSegTree']]],
-  ['lca_12',['lca',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4',1,'range_queries::heavy_light_decomposition::Tree']]],
-  ['lcm_13',['lcm',['../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25',1,'least_common_multiple.cpp']]],
-  ['lcm_5fsum_2ecpp_14',['lcm_sum.cpp',['../d5/d83/lcm__sum_8cpp.html',1,'']]],
-  ['lcmsum_15',['lcmSum',['../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244',1,'math']]],
-  ['lconv_16',['lconv',['http://en.cppreference.com/w/cpp/locale/lconv.html',0,'std']]],
-  ['ldexp_17',['ldexp',['http://en.cppreference.com/w/cpp/numeric/math/ldexp.html',0,'std']]],
-  ['ldiv_18',['ldiv',['http://en.cppreference.com/w/cpp/numeric/math/div.html',0,'std']]],
-  ['learning_19',['Machine Learning',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58',1,'']]],
-  ['learning_20algorithms_20',['Machine Learning Algorithms',['../d9/d66/group__machine__learning.html',1,'']]],
-  ['least_5fcommon_5fmultiple_2ecpp_21',['least_common_multiple.cpp',['../d4/d21/least__common__multiple_8cpp.html',1,'']]],
-  ['left_22',['left',['../dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788',1,'binary_search_tree::bst_node::left'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9ccef4c746b7226488b014f5bac4789a',1,'operations_on_datastructures::inorder_traversal_of_bst::Node::left'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352',1,'operations_on_datastructures::reverse_binary_tree::Node::left'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e',1,'others::iterative_tree_traversals::Node::left'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3',1,'others::recursive_tree_traversals::Node::left'],['../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca',1,'MinHeap::left()'],['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std::left()']]],
-  ['leftrotate_23',['LeftRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e',1,'data_structures::tree_234::Tree234']]],
-  ['leftrotate_24',['leftRotate',['../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6',1,'avltree.cpp']]],
-  ['leftrotate32bits_25',['leftRotate32bits',['../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d',1,'hashing::md5::leftRotate32bits()'],['../d8/d7a/sha1_8cpp.html#acf6bd970f29a68702bdbdfe8338e45e0',1,'hashing::sha1::leftRotate32bits()']]],
-  ['lenghtline_26',['LenghtLine',['../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a',1,'smallest_circle.cpp']]],
-  ['length_27',['length',['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::match_results::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt::length()'],['http://en.cppreference.com/w/cpp/string/char_traits/length.html',0,'std::char_traits::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::string::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_byname::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::wsmatch::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::wcsub_match::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::smatch::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8_utf16::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::wcmatch::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::wssub_match::length()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/length.html',0,'std::regex_traits::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::csub_match::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::ssub_match::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::basic_string::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::wstring::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u16string::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u32string::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf16::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::cmatch::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::sub_match::length()']]],
-  ['length_5ferror_28',['length_error',['http://en.cppreference.com/w/cpp/error/length_error.html',0,'std::length_error'],['http://en.cppreference.com/w/cpp/error/length_error.html',0,'std::length_error::length_error()']]],
-  ['lengthoflongestsubstring_29',['lengthOfLongestSubstring',['../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d',1,'Longest_Substring']]],
-  ['less_30',['less',['http://en.cppreference.com/w/cpp/utility/functional/less.html',0,'std']]],
-  ['less_5fequal_31',['less_equal',['http://en.cppreference.com/w/cpp/utility/functional/less_equal.html',0,'std']]],
-  ['level_32',['level',['../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650',1,'data_structures::SkipList::level'],['../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3',1,'graph::RootedTree::level']]],
-  ['levelorder_33',['levelOrder',['../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59',1,'avltree.cpp']]],
-  ['lexicographical_5fcompare_34',['lexicographical_compare',['http://en.cppreference.com/w/cpp/algorithm/lexicographical_compare.html',0,'std']]],
-  ['lfu_5fcache_2ecpp_35',['lfu_cache.cpp',['../d9/d65/lfu__cache_8cpp.html',1,'']]],
-  ['lfucache_36',['LFUCache',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html',1,'others::Cache::LFUCache&lt; K, V &gt;'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#affd7776c246caa2d0f92fd8616f6e5dc',1,'others::Cache::LFUCache::LFUCache()']]],
-  ['lgamma_37',['lgamma',['http://en.cppreference.com/w/cpp/numeric/math/lgamma.html',0,'std']]],
-  ['lift_38',['lift',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3',1,'range_queries::heavy_light_decomposition::Tree']]],
-  ['lims_39',['LIMS',['../de/d75/qr__eigen__values_8cpp.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.cpp']]],
-  ['line_5fsegment_5fintersection_2ecpp_40',['line_segment_intersection.cpp',['../d8/d6c/line__segment__intersection_8cpp.html',1,'']]],
-  ['linear_5fcongruential_5fengine_41',['linear_congruential_engine',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html',0,'std::linear_congruential_engine'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::linear_congruential_engine::linear_congruential_engine()']]],
-  ['linear_5fprobing_42',['linear_probing',['../d8/d89/namespacelinear__probing.html',1,'']]],
-  ['linear_5fprobing_5fhash_5ftable_2ecpp_43',['linear_probing_hash_table.cpp',['../d1/dc7/linear__probing__hash__table_8cpp.html',1,'']]],
-  ['linear_5frecurrence_5fmatrix_44',['linear_recurrence_matrix',['../d9/dd1/namespacelinear__recurrence__matrix.html',1,'']]],
-  ['linear_5fsearch_2ecpp_45',['linear_search.cpp',['../d9/d02/linear__search_8cpp.html',1,'']]],
-  ['linearprobe_46',['linearProbe',['../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746',1,'linear_probing']]],
-  ['linearsearch_47',['LinearSearch',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9',1,'data_structures::list_array::list::LinearSearch()'],['../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84',1,'LinearSearch():&#160;linear_search.cpp']]],
-  ['link_48',['link',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html',1,'data_structures::linked_list::link'],['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb',1,'data_structures::linked_list::link::link()'],['../d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6',1,'link:&#160;hash_search.cpp']]],
-  ['linked_5flist_49',['linked_list',['../d3/db0/namespacelinked__list.html',1,'']]],
-  ['linked_5flist_2ecpp_50',['linked_list.cpp',['../da/dc3/linked__list_8cpp.html',1,'']]],
-  ['linkedlist_51',['linkedlist',['../d0/dff/structlinkedlist.html',1,'']]],
-  ['linkedlist_5fimplentation_5fusingarray_2ecpp_52',['linkedlist_implentation_usingarray.cpp',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html',1,'']]],
-  ['lis_53',['LIS',['../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079',1,'dynamic_programming']]],
-  ['list_54',['Todo List',['../dd/da0/todo.html',1,'']]],
-  ['list_55',['list',['../d1/def/classdata__structures_1_1linked__list_1_1list.html',1,'data_structures::linked_list::list'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html',1,'data_structures::list_array::list&lt; N &gt;'],['../d8/d10/structlist.html',1,'list'],['http://en.cppreference.com/w/cpp/container/list.html',0,'std::list&lt; T &gt;'],['http://en.cppreference.com/w/cpp/container/list/list.html',0,'std::list::list()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826',1,'data_structures::linked_list::list::list()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a326ac4f721f7b74d5ed4f418a67b8d38',1,'data_structures::linked_list::list::list(const list &amp;other)']]],
-  ['list_3c_20int_20_3e_56',['list&lt; int &gt;',['http://en.cppreference.com/w/cpp/container/list.html',0,'std']]],
-  ['list_3c_20uint64_5ft_20_3e_57',['list&lt; uint64_t &gt;',['http://en.cppreference.com/w/cpp/container/list.html',0,'std']]],
-  ['list_5farray_58',['list_array',['../d9/d27/namespacelist__array.html',1,'']]],
-  ['list_5farray_2ecpp_59',['list_array.cpp',['../d7/d00/list__array_8cpp.html',1,'']]],
-  ['listnode_60',['ListNode',['../d7/da4/struct_list_node.html',1,'ListNode'],['../d7/da4/struct_list_node.html#a3cfee2eb667c332dc32595208164ef0a',1,'ListNode::ListNode()=default'],['../d7/da4/struct_list_node.html#aaad9b553e2f936726f5b35ff2734125d',1,'ListNode::ListNode(int x)'],['../d7/da4/struct_list_node.html#afc97c5b9d2e7cc82d0718245688f6ff9',1,'ListNode::ListNode(int x, ListNode *next)']]],
-  ['ll_61',['ll',['../d7/d35/matrix__exponentiation_8cpp.html#ae1d1ec9482079231e898236e2b23c9ba',1,'matrix_exponentiation.cpp']]],
-  ['llabs_62',['llabs',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]],
-  ['llrint_63',['llrint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]],
-  ['llround_64',['llround',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]],
-  ['load_65',['load',['http://en.cppreference.com/w/cpp/atomic/atomic/load.html',0,'std::atomic']]],
-  ['load_5ffactor_66',['load_factor',['http://en.cppreference.com/w/cpp/container/unordered_map/load_factor.html',0,'std::unordered_map::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/load_factor.html',0,'std::unordered_multimap::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/load_factor.html',0,'std::unordered_multiset::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_set/load_factor.html',0,'std::unordered_set::load_factor()']]],
-  ['load_5fmodel_67',['load_model',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58ed20abf6ce3744535bd8b5bb9e741b',1,'machine_learning::neural_network::NeuralNetwork']]],
-  ['locale_68',['locale',['http://en.cppreference.com/w/cpp/locale/locale.html',0,'std::locale'],['http://en.cppreference.com/w/cpp/locale/locale/locale.html',0,'std::locale::locale()']]],
-  ['localeconv_69',['localeconv',['http://en.cppreference.com/w/cpp/locale/localeconv.html',0,'std']]],
-  ['locally_70',['Building Locally',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md37',1,'']]],
-  ['localtime_71',['localtime',['http://en.cppreference.com/w/cpp/chrono/c/localtime.html',0,'std']]],
-  ['lock_72',['lock',['http://en.cppreference.com/w/cpp/memory/weak_ptr/lock.html',0,'std::weak_ptr::lock()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/lock.html',0,'std::unique_lock::lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/lock.html',0,'std::recursive_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/lock.html',0,'std::recursive_timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/lock.html',0,'std::shared_lock::lock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/lock.html',0,'std::timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/mutex/lock.html',0,'std::mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/lock.html',0,'std::shared_timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/lock.html',0,'std::lock(T... args)']]],
-  ['lock_5fguard_73',['lock_guard',['http://en.cppreference.com/w/cpp/thread/lock_guard.html',0,'std::lock_guard&lt; T &gt;'],['http://en.cppreference.com/w/cpp/thread/lock_guard/lock_guard.html',0,'std::lock_guard::lock_guard()']]],
-  ['lock_5fshared_74',['lock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/lock_shared.html',0,'std::shared_timed_mutex']]],
-  ['log_75',['LOG',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a6cf72f93b1551f0d943c585b4f173be3',1,'data_structures::sparse_table::Sparse_table']]],
-  ['log_76',['log',['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['http://en.cppreference.com/w/cpp/numeric/math/log.html',0,'std::log()'],['../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058',1,'lru_tests::log()']]],
-  ['log10_77',['log10',['http://en.cppreference.com/w/cpp/numeric/math/log10.html',0,'std']]],
-  ['log1p_78',['log1p',['http://en.cppreference.com/w/cpp/numeric/math/log1p.html',0,'std']]],
-  ['logb_79',['logb',['http://en.cppreference.com/w/cpp/numeric/math/logb.html',0,'std']]],
-  ['logic_80',['Logic',['../d3/db3/lru__cache_8cpp.html#autotoc_md96',1,'']]],
-  ['logic_5ferror_81',['logic_error',['http://en.cppreference.com/w/cpp/error/logic_error.html',0,'std::logic_error'],['http://en.cppreference.com/w/cpp/error/logic_error.html',0,'std::logic_error::logic_error()']]],
-  ['logical_5fand_82',['logical_and',['http://en.cppreference.com/w/cpp/utility/functional/logical_and.html',0,'std']]],
-  ['logical_5fnot_83',['logical_not',['http://en.cppreference.com/w/cpp/utility/functional/logical_not.html',0,'std']]],
-  ['logical_5for_84',['logical_or',['http://en.cppreference.com/w/cpp/utility/functional/logical_or.html',0,'std']]],
-  ['lognormal_5fdistribution_85',['lognormal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution.html',0,'std::lognormal_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/lognormal_distribution.html',0,'std::lognormal_distribution::lognormal_distribution()']]],
-  ['longest_5fcommon_5fstring_2ecpp_86',['longest_common_string.cpp',['../da/d0d/longest__common__string_8cpp.html',1,'']]],
-  ['longest_5fcommon_5fstring_5flength_87',['longest_common_string_length',['../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5',1,'longest_common_string.cpp']]],
-  ['longest_5fincreasing_5fsubsequence_2ecpp_88',['longest_increasing_subsequence.cpp',['../d7/d57/longest__increasing__subsequence_8cpp.html',1,'']]],
-  ['longest_5fincreasing_5fsubsequence_5fusing_5fbinary_5fsearch_89',['longest_increasing_subsequence_using_binary_search',['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e',1,'longest_increasing_subsequence_using_binary_search.cpp']]],
-  ['longest_5fincreasing_5fsubsequence_5fusing_5fbinary_5fsearch_2ecpp_90',['longest_increasing_subsequence_using_binary_search.cpp',['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html',1,'']]],
-  ['longest_5fpalindromic_5fsubsequence_2ecpp_91',['longest_palindromic_subsequence.cpp',['../d0/d77/longest__palindromic__subsequence_8cpp.html',1,'']]],
-  ['longest_5fsubstring_92',['Longest_Substring',['../da/d21/class_longest___substring.html',1,'']]],
-  ['longest_5fsubstring_5fwithout_5frepeating_5fcharacters_2ecpp_93',['longest_substring_without_repeating_characters.cpp',['../d4/db8/longest__substring__without__repeating__characters_8cpp.html',1,'']]],
-  ['longjmp_94',['longjmp',['http://en.cppreference.com/w/cpp/utility/program/longjmp.html',0,'std']]],
-  ['lookup_5fclassname_95',['lookup_classname',['http://en.cppreference.com/w/cpp/regex/regex_traits/lookup_classname.html',0,'std::regex_traits']]],
-  ['lookup_5fcollatename_96',['lookup_collatename',['http://en.cppreference.com/w/cpp/regex/regex_traits/lookup_collatename.html',0,'std::regex_traits']]],
-  ['lower_97',['lower',['../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd',1,'uint128_t::lower()'],['../d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1',1,'uint256_t::lower()'],['../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9',1,'lower():&#160;text_search.cpp']]],
-  ['lower_5fbound_98',['lower_bound',['http://en.cppreference.com/w/cpp/container/multiset/lower_bound.html',0,'std::multiset::lower_bound()'],['http://en.cppreference.com/w/cpp/container/set/lower_bound.html',0,'std::set::lower_bound()'],['http://en.cppreference.com/w/cpp/container/map/lower_bound.html',0,'std::map::lower_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/lower_bound.html',0,'std::multimap::lower_bound()'],['http://en.cppreference.com/w/cpp/algorithm/lower_bound.html',0,'std::lower_bound()']]],
-  ['lowest_99',['lowest',['http://en.cppreference.com/w/cpp/types/numeric_limits/lowest.html',0,'std::numeric_limits']]],
-  ['lowest_5fcommon_5fancestor_100',['lowest_common_ancestor',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488',1,'graph::LowestCommonAncestor']]],
-  ['lowest_5fcommon_5fancestor_2ecpp_101',['lowest_common_ancestor.cpp',['../de/dde/lowest__common__ancestor_8cpp.html',1,'']]],
-  ['lowestcommonancestor_102',['LowestCommonAncestor',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html',1,'graph::LowestCommonAncestor'],['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93',1,'graph::LowestCommonAncestor::LowestCommonAncestor()']]],
-  ['lps_103',['lps',['../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412',1,'dynamic_programming']]],
-  ['lrint_104',['lrint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]],
-  ['lround_105',['lround',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]],
-  ['lru_5fcache_106',['lru_cache',['../d8/dcd/namespacelru__cache.html',1,'']]],
-  ['lru_5fcache_2ecpp_107',['lru_cache.cpp',['../d3/db3/lru__cache_8cpp.html',1,'']]],
-  ['lru_5fcache2_2ecpp_108',['lru_cache2.cpp',['../dc/daa/lru__cache2_8cpp.html',1,'']]],
-  ['lrucache_109',['LRUCache',['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html',1,'others::Cache::LRUCache&lt; K, V &gt;'],['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html',1,'others::lru_cache::LRUCache'],['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4',1,'others::lru_cache::LRUCache::LRUCache()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f',1,'others::Cache::LRUCache::LRUCache()']]],
-  ['lt_110',['lt',['http://en.cppreference.com/w/cpp/string/char_traits/cmp.html',0,'std::char_traits']]],
-  ['lu_5fdecompose_2ecpp_111',['lu_decompose.cpp',['../dd/d65/lu__decompose_8cpp.html',1,'']]],
-  ['lu_5fdecomposition_112',['lu_decomposition',['../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509',1,'lu_decomposition.h']]],
-  ['lu_5fdecomposition_2eh_113',['lu_decomposition.h',['../d1/dbe/lu__decomposition_8h.html',1,'']]]
+  ['large_5ffactorial_2ecpp_2',['large_factorial.cpp',['../d6/d9d/large__factorial_8cpp.html',1,'']]],
+  ['large_5fnumber_3',['large_number',['../db/d82/classlarge__number.html',1,'large_number'],['../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337',1,'large_number::large_number()'],['../db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a',1,'large_number::large_number(int n)'],['../db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872',1,'large_number::large_number(const large_number &amp;a)'],['../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f',1,'large_number::large_number(std::vector&lt; unsigned char &gt; &amp;vec)']]],
+  ['large_5fnumber_2eh_4',['large_number.h',['../d4/d86/large__number_8h.html',1,'']]],
+  ['largest_5fpower_2ecpp_5',['largest_power.cpp',['../d5/d7a/largest__power_8cpp.html',1,'']]],
+  ['largestpower_6',['largestPower',['../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f',1,'math']]],
+  ['last_7',['last',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#af39bcc08641ce0c813023f364a9a9015',1,'data_structures::linked_list::list']]],
+  ['layers_8',['layers',['../d5/d2c/namespacelayers.html',1,'']]],
+  ['lazy_9',['lazy',['../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79',1,'range_queries::perSegTree']]],
+  ['lca_10',['lca',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4',1,'range_queries::heavy_light_decomposition::Tree']]],
+  ['lcm_11',['lcm',['../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25',1,'least_common_multiple.cpp']]],
+  ['lcm_5fsum_2ecpp_12',['lcm_sum.cpp',['../d5/d83/lcm__sum_8cpp.html',1,'']]],
+  ['lcmsum_13',['lcmSum',['../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244',1,'math']]],
+  ['learning_14',['Machine Learning',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58',1,'']]],
+  ['learning_20algorithms_15',['Machine Learning Algorithms',['../d9/d66/group__machine__learning.html',1,'']]],
+  ['least_5fcommon_5fmultiple_2ecpp_16',['least_common_multiple.cpp',['../d4/d21/least__common__multiple_8cpp.html',1,'']]],
+  ['left_17',['left',['../dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788',1,'binary_search_tree::bst_node::left'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9ccef4c746b7226488b014f5bac4789a',1,'operations_on_datastructures::inorder_traversal_of_bst::Node::left'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352',1,'operations_on_datastructures::reverse_binary_tree::Node::left'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e',1,'others::iterative_tree_traversals::Node::left'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3',1,'others::recursive_tree_traversals::Node::left'],['../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca',1,'MinHeap::left()']]],
+  ['leftrotate_18',['LeftRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e',1,'data_structures::tree_234::Tree234']]],
+  ['leftrotate_19',['leftRotate',['../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6',1,'avltree.cpp']]],
+  ['leftrotate32bits_20',['leftRotate32bits',['../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d',1,'hashing::md5::leftRotate32bits()'],['../d8/d7a/sha1_8cpp.html#acf6bd970f29a68702bdbdfe8338e45e0',1,'hashing::sha1::leftRotate32bits()']]],
+  ['lenghtline_21',['LenghtLine',['../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a',1,'smallest_circle.cpp']]],
+  ['lengthoflongestsubstring_22',['lengthOfLongestSubstring',['../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d',1,'Longest_Substring']]],
+  ['level_23',['level',['../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650',1,'data_structures::SkipList::level'],['../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3',1,'graph::RootedTree::level']]],
+  ['levelorder_24',['levelOrder',['../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59',1,'avltree.cpp']]],
+  ['lfu_5fcache_2ecpp_25',['lfu_cache.cpp',['../d9/d65/lfu__cache_8cpp.html',1,'']]],
+  ['lfucache_26',['LFUCache',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html',1,'others::Cache::LFUCache&lt; K, V &gt;'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#affd7776c246caa2d0f92fd8616f6e5dc',1,'others::Cache::LFUCache::LFUCache()']]],
+  ['lift_27',['lift',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3',1,'range_queries::heavy_light_decomposition::Tree']]],
+  ['lims_28',['LIMS',['../de/d75/qr__eigen__values_8cpp.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.cpp']]],
+  ['line_5fsegment_5fintersection_2ecpp_29',['line_segment_intersection.cpp',['../d8/d6c/line__segment__intersection_8cpp.html',1,'']]],
+  ['linear_5fprobing_30',['linear_probing',['../d8/d89/namespacelinear__probing.html',1,'']]],
+  ['linear_5fprobing_5fhash_5ftable_2ecpp_31',['linear_probing_hash_table.cpp',['../d1/dc7/linear__probing__hash__table_8cpp.html',1,'']]],
+  ['linear_5frecurrence_5fmatrix_32',['linear_recurrence_matrix',['../d9/dd1/namespacelinear__recurrence__matrix.html',1,'']]],
+  ['linear_5fsearch_2ecpp_33',['linear_search.cpp',['../d9/d02/linear__search_8cpp.html',1,'']]],
+  ['linearprobe_34',['linearProbe',['../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746',1,'linear_probing']]],
+  ['linearsearch_35',['LinearSearch',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9',1,'data_structures::list_array::list::LinearSearch()'],['../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84',1,'LinearSearch():&#160;linear_search.cpp']]],
+  ['link_36',['link',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html',1,'data_structures::linked_list::link'],['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb',1,'data_structures::linked_list::link::link()'],['../d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6',1,'link:&#160;hash_search.cpp']]],
+  ['linked_5flist_37',['linked_list',['../d3/db0/namespacelinked__list.html',1,'']]],
+  ['linked_5flist_2ecpp_38',['linked_list.cpp',['../da/dc3/linked__list_8cpp.html',1,'']]],
+  ['linkedlist_39',['linkedlist',['../d0/dff/structlinkedlist.html',1,'']]],
+  ['linkedlist_5fimplentation_5fusingarray_2ecpp_40',['linkedlist_implentation_usingarray.cpp',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html',1,'']]],
+  ['lis_41',['LIS',['../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079',1,'dynamic_programming']]],
+  ['list_42',['Todo List',['../dd/da0/todo.html',1,'']]],
+  ['list_43',['list',['../d1/def/classdata__structures_1_1linked__list_1_1list.html',1,'data_structures::linked_list::list'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html',1,'data_structures::list_array::list&lt; N &gt;'],['../d8/d10/structlist.html',1,'list'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826',1,'data_structures::linked_list::list::list()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a326ac4f721f7b74d5ed4f418a67b8d38',1,'data_structures::linked_list::list::list(const list &amp;other)']]],
+  ['list_5farray_44',['list_array',['../d9/d27/namespacelist__array.html',1,'']]],
+  ['list_5farray_2ecpp_45',['list_array.cpp',['../d7/d00/list__array_8cpp.html',1,'']]],
+  ['listnode_46',['ListNode',['../d7/da4/struct_list_node.html',1,'ListNode'],['../d7/da4/struct_list_node.html#a3cfee2eb667c332dc32595208164ef0a',1,'ListNode::ListNode()=default'],['../d7/da4/struct_list_node.html#aaad9b553e2f936726f5b35ff2734125d',1,'ListNode::ListNode(int x)'],['../d7/da4/struct_list_node.html#afc97c5b9d2e7cc82d0718245688f6ff9',1,'ListNode::ListNode(int x, ListNode *next)']]],
+  ['ll_47',['ll',['../d7/d35/matrix__exponentiation_8cpp.html#ae1d1ec9482079231e898236e2b23c9ba',1,'matrix_exponentiation.cpp']]],
+  ['load_5fmodel_48',['load_model',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58ed20abf6ce3744535bd8b5bb9e741b',1,'machine_learning::neural_network::NeuralNetwork']]],
+  ['locally_49',['Building Locally',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md37',1,'']]],
+  ['log_50',['LOG',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a6cf72f93b1551f0d943c585b4f173be3',1,'data_structures::sparse_table::Sparse_table']]],
+  ['log_51',['log',['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058',1,'lru_tests::log()']]],
+  ['logic_52',['Logic',['../d3/db3/lru__cache_8cpp.html#autotoc_md96',1,'']]],
+  ['longest_5fcommon_5fstring_2ecpp_53',['longest_common_string.cpp',['../da/d0d/longest__common__string_8cpp.html',1,'']]],
+  ['longest_5fcommon_5fstring_5flength_54',['longest_common_string_length',['../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5',1,'longest_common_string.cpp']]],
+  ['longest_5fincreasing_5fsubsequence_2ecpp_55',['longest_increasing_subsequence.cpp',['../d7/d57/longest__increasing__subsequence_8cpp.html',1,'']]],
+  ['longest_5fincreasing_5fsubsequence_5fusing_5fbinary_5fsearch_56',['longest_increasing_subsequence_using_binary_search',['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e',1,'longest_increasing_subsequence_using_binary_search.cpp']]],
+  ['longest_5fincreasing_5fsubsequence_5fusing_5fbinary_5fsearch_2ecpp_57',['longest_increasing_subsequence_using_binary_search.cpp',['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html',1,'']]],
+  ['longest_5fpalindromic_5fsubsequence_2ecpp_58',['longest_palindromic_subsequence.cpp',['../d0/d77/longest__palindromic__subsequence_8cpp.html',1,'']]],
+  ['longest_5fsubstring_59',['Longest_Substring',['../da/d21/class_longest___substring.html',1,'']]],
+  ['longest_5fsubstring_5fwithout_5frepeating_5fcharacters_2ecpp_60',['longest_substring_without_repeating_characters.cpp',['../d4/db8/longest__substring__without__repeating__characters_8cpp.html',1,'']]],
+  ['lower_61',['lower',['../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd',1,'uint128_t::lower()'],['../d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1',1,'uint256_t::lower()'],['../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9',1,'lower():&#160;text_search.cpp']]],
+  ['lowest_5fcommon_5fancestor_62',['lowest_common_ancestor',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488',1,'graph::LowestCommonAncestor']]],
+  ['lowest_5fcommon_5fancestor_2ecpp_63',['lowest_common_ancestor.cpp',['../de/dde/lowest__common__ancestor_8cpp.html',1,'']]],
+  ['lowestcommonancestor_64',['LowestCommonAncestor',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html',1,'graph::LowestCommonAncestor'],['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93',1,'graph::LowestCommonAncestor::LowestCommonAncestor()']]],
+  ['lps_65',['lps',['../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412',1,'dynamic_programming']]],
+  ['lru_5fcache_66',['lru_cache',['../d8/dcd/namespacelru__cache.html',1,'']]],
+  ['lru_5fcache_2ecpp_67',['lru_cache.cpp',['../d3/db3/lru__cache_8cpp.html',1,'']]],
+  ['lru_5fcache2_2ecpp_68',['lru_cache2.cpp',['../dc/daa/lru__cache2_8cpp.html',1,'']]],
+  ['lrucache_69',['LRUCache',['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html',1,'others::Cache::LRUCache&lt; K, V &gt;'],['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html',1,'others::lru_cache::LRUCache'],['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4',1,'others::lru_cache::LRUCache::LRUCache()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f',1,'others::Cache::LRUCache::LRUCache()']]],
+  ['lu_5fdecompose_2ecpp_70',['lu_decompose.cpp',['../dd/d65/lu__decompose_8cpp.html',1,'']]],
+  ['lu_5fdecomposition_71',['lu_decomposition',['../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509',1,'lu_decomposition.h']]],
+  ['lu_5fdecomposition_2eh_72',['lu_decomposition.h',['../d1/dbe/lu__decomposition_8h.html',1,'']]]
 ];
diff --git a/search/all_12.js b/search/all_12.js
index 4139991ad..af15a6f06 100644
--- a/search/all_12.js
+++ b/search/all_12.js
@@ -1,7 +1,7 @@
 var searchData=
 [
   ['m_0',['M',['../d8/dab/sparse__table_8cpp.html#af7db62f21983565c64d5d42d2a49888e',1,'data_structures::sparse_table']]],
-  ['m_1',['m',['../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74',1,'graph::HKGraph::m'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/params.html',0,'std::lognormal_distribution::m()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/params.html',0,'std::fisher_f_distribution::m()']]],
+  ['m_1',['m',['../d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74',1,'graph::HKGraph']]],
   ['machine_20learning_2',['Machine Learning',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md58',1,'']]],
   ['machine_20learning_20algorithms_3',['Machine Learning Algorithms',['../d9/d66/group__machine__learning.html',1,'']]],
   ['machine_5flearning_4',['machine_learning',['../d8/d77/namespacemachine__learning.html',1,'']]],
@@ -13,182 +13,106 @@ var searchData=
   ['main_5fq_10',['main_q',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#acf8ca54d5dd6676f255fff3dedacc7c6',1,'data_structures::stack_using_queue::Stack']]],
   ['maintainer_20reviewer_11',['Maintainer/reviewer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md24',1,'']]],
   ['maintainers_12',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]],
-  ['make_5fexception_5fptr_13',['make_exception_ptr',['http://en.cppreference.com/w/cpp/error/make_exception_ptr.html',0,'std']]],
-  ['make_5fheap_14',['make_heap',['http://en.cppreference.com/w/cpp/algorithm/make_heap.html',0,'std']]],
-  ['make_5fmove_5fiterator_15',['make_move_iterator',['http://en.cppreference.com/w/cpp/iterator/make_move_iterator.html',0,'std']]],
-  ['make_5foptional_16',['make_optional',['http://en.cppreference.com/w/cpp/experimental/optional/make_optional.html',0,'std::experimental']]],
-  ['make_5fpair_17',['make_pair',['http://en.cppreference.com/w/cpp/utility/pair/make_pair.html',0,'std']]],
-  ['make_5fready_5fat_5fthread_5fexit_18',['make_ready_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/packaged_task/make_ready_at_thread_exit.html',0,'std::packaged_task']]],
-  ['make_5frecent_19',['make_recent',['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4',1,'others::Cache::LRUCache']]],
-  ['make_5fset_20',['make_set',['../d8/d99/connected__components__with__dsu_8cpp.html#ae91ed94113c56191b75fe45f688d6e62',1,'graph::disjoint_union']]],
-  ['make_5fshared_21',['make_shared',['http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html',0,'std']]],
-  ['make_5fsigned_22',['make_signed',['http://en.cppreference.com/w/cpp/types/make_signed.html',0,'std']]],
-  ['make_5ftuple_23',['make_tuple',['http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html',0,'std']]],
-  ['make_5funsigned_24',['make_unsigned',['http://en.cppreference.com/w/cpp/types/make_unsigned.html',0,'std']]],
-  ['makebst_25',['makeBST',['../d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
-  ['makelinkedlist_26',['makeLinkedList',['../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53',1,'search::sublist_search']]],
-  ['makenode_27',['makeNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a7f6f73a33beec448c27cc1d70b220702',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
-  ['makestrings_28',['makeStrings',['../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec',1,'backtracking::generate_parentheses']]],
-  ['making_20changes_29',['Making Changes',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md26',1,'']]],
-  ['malloc_30',['malloc',['http://en.cppreference.com/w/cpp/memory/c/malloc.html',0,'std']]],
-  ['manacher_31',['manacher',['../d8/dc6/namespacemanacher.html',1,'manacher'],['../d3/d39/manacher__algorithm_8cpp.html#a95e6a2976bb2f332898f373941d52098',1,'strings::manacher::manacher()']]],
-  ['manacher_5falgorithm_2ecpp_32',['manacher_algorithm.cpp',['../d3/d39/manacher__algorithm_8cpp.html',1,'']]],
-  ['manipulation_33',['Bit Manipulation',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46',1,'']]],
-  ['map_34',['map',['http://en.cppreference.com/w/cpp/container/map.html',0,'std::map&lt; K, T &gt;'],['http://en.cppreference.com/w/cpp/container/map/map.html',0,'std::map::map()']]],
-  ['map_3c_20t_2c_20std_3a_3alist_3c_20t_20_3e_20_3e_35',['map&lt; T, std::list&lt; T &gt; &gt;',['http://en.cppreference.com/w/cpp/container/map.html',0,'std']]],
-  ['map_3c_20unsigned_20int_2c_20std_3a_3avector_3c_20unsigned_20int_20_3e_20_3e_36',['map&lt; unsigned int, std::vector&lt; unsigned int &gt; &gt;',['http://en.cppreference.com/w/cpp/container/map.html',0,'std']]],
-  ['mark_5fcount_37',['mark_count',['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::regex::mark_count()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::basic_regex::mark_count()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::wregex::mark_count()']]],
-  ['mask_38',['mask',['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std::ctype::mask'],['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std::ctype_base::mask'],['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std::ctype_byname::mask']]],
-  ['mat_5fmul_39',['mat_mul',['../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590',1,'ciphers::HillCipher::mat_mul()'],['../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae',1,'mat_mul(const std::valarray&lt; std::valarray&lt; double &gt; &gt; &amp;A, const std::valarray&lt; std::valarray&lt; double &gt; &gt; &amp;B, std::valarray&lt; std::valarray&lt; double &gt; &gt; *OUT):&#160;qr_eigen_values.cpp']]],
-  ['mat_5fsize_40',['mat_size',['../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54',1,'matrix_exponentiation.cpp']]],
-  ['match_41',['match',['../d8/d41/namespacegames_1_1memory__game.html#a370760f2b328ad341bcb77d82fa17b01',1,'games::memory_game']]],
-  ['match_5fresults_42',['match_results',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std::match_results'],['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::match_results::match_results()']]],
-  ['matching_43',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]],
-  ['matching_20and_20not_20matching_20edges_44',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]],
-  ['matching_20edges_45',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]],
-  ['math_46',['Math',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59',1,'']]],
-  ['math_47',['math',['../dd/d47/namespacemath.html',1,'']]],
-  ['matrix_48',['Matrix',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html',1,'divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256',1,'divide_and_conquer::strassens_multiplication::Matrix::Matrix(const Integer size)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a4aa49765cce39ce48b9241e993e0cfb9',1,'divide_and_conquer::strassens_multiplication::Matrix::Matrix(const Integer rows, const Integer cols)']]],
-  ['matrix_49',['matrix',['../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4',1,'lu_decomposition.h']]],
-  ['matrix_5fexponentiation_2ecpp_50',['matrix_exponentiation.cpp',['../d7/d35/matrix__exponentiation_8cpp.html',1,'']]],
-  ['max_51',['MAX',['../d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX:&#160;fibonacci_fast.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX:&#160;power_for_huge_numbers.cpp'],['../dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX:&#160;paranthesis_matching.cpp'],['../d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX:&#160;hash_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX:&#160;ternary_search.cpp']]],
-  ['max_52',['max',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/max.html',0,'std::student_t_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mt19937_64::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::ranlux24_base::max()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/max.html',0,'std::extreme_value_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/max.html',0,'std::lognormal_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/max.html',0,'std::discrete_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::ranlux48::max()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/max.html',0,'std::piecewise_constant_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/max.html',0,'std::poisson_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/max.html',0,'std::bernoulli_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::discard_block_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/max.html',0,'std::exponential_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/max.html',0,'std::uniform_real_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/max.html',0,'std::geometric_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mersenne_twister_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/max.html',0,'std::independent_bits_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/max.html',0,'std::normal_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::minstd_rand::max()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/max.html',0,'std::weibull_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::ranlux48_base::max()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/max.html',0,'std::negative_binomial_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mt19937::max()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/max.html',0,'std::chi_squared_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/max.html',0,'std::piecewise_linear_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/max.html',0,'std::shuffle_order_engine::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::minutes::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::seconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::duration::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::milliseconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::hours::max()'],['http://en.cppreference.com/w/cpp/chrono/time_point/max.html',0,'std::chrono::time_point::max()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/max.html',0,'std::chrono::duration_values::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::microseconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::nanoseconds::max()'],['http://en.cppreference.com/w/cpp/types/numeric_limits/max.html',0,'std::numeric_limits::max()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/max.html',0,'std::uniform_int_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/max.html',0,'std::fisher_f_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::ranlux24::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::linear_congruential_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/max.html',0,'std::knuth_b::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::minstd_rand0::max()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/max.html',0,'std::gamma_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/max.html',0,'std::binomial_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/max.html',0,'std::cauchy_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::subtract_with_carry_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/max.html',0,'std::random_device::max()'],['http://en.cppreference.com/w/cpp/algorithm/max.html',0,'std::max(T... args)']]],
-  ['max_5falign_5ft_53',['max_align_t',['http://en.cppreference.com/w/cpp/types/max_align_t.html',0,'std']]],
-  ['max_5fbucket_5fcount_54',['max_bucket_count',['http://en.cppreference.com/w/cpp/container/unordered_map/max_bucket_count.html',0,'std::unordered_map::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_bucket_count.html',0,'std::unordered_multimap::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_bucket_count.html',0,'std::unordered_multiset::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_bucket_count.html',0,'std::unordered_set::max_bucket_count()']]],
-  ['max_5felement_55',['max_element',['http://en.cppreference.com/w/cpp/algorithm/max_element.html',0,'std']]],
-  ['max_5fheight_56',['max_height',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa554429def63077ab7a550c0affbfefa',1,'physics::ground_to_ground_projectile_motion']]],
-  ['max_5fiter_57',['MAX_ITER',['../d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1',1,'adaline_learning.cpp']]],
-  ['max_5fiterations_58',['MAX_ITERATIONS',['../d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14',1,'MAX_ITERATIONS:&#160;bisection_method.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#a5c5ff05b9f37ae59dad67e1d4f6cd51d',1,'MAX_ITERATIONS:&#160;newton_raphson_method.cpp']]],
-  ['max_5flength_59',['max_length',['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_byname::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8_utf16::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf16::max_length()']]],
-  ['max_5flevel_60',['MAX_LEVEL',['../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a',1,'data_structures']]],
-  ['max_5fload_5ffactor_61',['max_load_factor',['http://en.cppreference.com/w/cpp/container/unordered_map/max_load_factor.html',0,'std::unordered_map::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_load_factor.html',0,'std::unordered_multimap::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_load_factor.html',0,'std::unordered_multiset::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_load_factor.html',0,'std::unordered_set::max_load_factor()']]],
-  ['max_5fsize_62',['max_size',['http://en.cppreference.com/w/cpp/container/dynarray/max_size.html',0,'std::dynarray::max_size()'],['http://en.cppreference.com/w/cpp/container/vector/max_size.html',0,'std::vector::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::match_results::max_size()'],['http://en.cppreference.com/w/cpp/memory/allocator_traits/max_size.html',0,'std::allocator_traits::max_size()'],['http://en.cppreference.com/w/cpp/container/multiset/max_size.html',0,'std::multiset::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::string::max_size()'],['http://en.cppreference.com/w/cpp/container/set/max_size.html',0,'std::set::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/max_size.html',0,'std::unordered_map::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::wsmatch::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::smatch::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_size.html',0,'std::unordered_multimap::max_size()'],['http://en.cppreference.com/w/cpp/container/forward_list/max_size.html',0,'std::forward_list::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::wcmatch::max_size()'],['http://en.cppreference.com/w/cpp/container/deque/max_size.html',0,'std::deque::max_size()'],['http://en.cppreference.com/w/cpp/memory/allocator/max_size.html',0,'std::allocator::max_size()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/max_size.html',0,'std::scoped_allocator_adaptor::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::basic_string::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::wstring::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_size.html',0,'std::unordered_multiset::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::u16string::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::u32string::max_size()'],['http://en.cppreference.com/w/cpp/container/list/max_size.html',0,'std::list::max_size()'],['http://en.cppreference.com/w/cpp/container/map/max_size.html',0,'std::map::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::cmatch::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_size.html',0,'std::unordered_set::max_size()'],['http://en.cppreference.com/w/cpp/container/multimap/max_size.html',0,'std::multimap::max_size()'],['http://en.cppreference.com/w/cpp/container/array/max_size.html',0,'std::array::max_size()'],['../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8',1,'max_size:&#160;queue_using_array.cpp']]],
-  ['max_5fsubarray_5fsum_63',['max_subarray_sum',['../de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147',1,'kadanes3.cpp']]],
-  ['maxcircularsum_64',['maxCircularSum',['../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb',1,'dynamic_programming']]],
-  ['maxelement_65',['maxElement',['../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53',1,'dsu']]],
-  ['maximum_20cardinality_20matching_66',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]],
-  ['maximum_5fcircular_5fsubarray_2ecpp_67',['maximum_circular_subarray.cpp',['../db/dfb/maximum__circular__subarray_8cpp.html',1,'']]],
-  ['maxknapsackvalue_68',['maxKnapsackValue',['../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1',1,'dynamic_programming::knapsack']]],
-  ['maxnode_69',['maxNode',['../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099',1,'data_structures::treap']]],
-  ['maxprofitbycuttingrod_70',['maxProfitByCuttingRod',['../d6/d10/cut__rod_8cpp.html#a1cc523a30c18c63eac58220c3c494cfa',1,'dynamic_programming::cut_rod']]],
-  ['maxsubarray_71',['maxSubArray',['../d4/da0/kadane_8cpp.html#af3029007a422a914a85c0b0122f1c7b4',1,'dynamic_programming::kadane']]],
-  ['mblen_72',['mblen',['http://en.cppreference.com/w/cpp/string/multibyte/mblen.html',0,'std']]],
-  ['mbrlen_73',['mbrlen',['http://en.cppreference.com/w/cpp/string/multibyte/mbrlen.html',0,'std']]],
-  ['mbrtoc16_74',['mbrtoc16',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc16.html',0,'std']]],
-  ['mbrtoc32_75',['mbrtoc32',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc32.html',0,'std']]],
-  ['mbrtowc_76',['mbrtowc',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtowc.html',0,'std']]],
-  ['mbsinit_77',['mbsinit',['http://en.cppreference.com/w/cpp/string/multibyte/mbsinit.html',0,'std']]],
-  ['mbsrtowcs_78',['mbsrtowcs',['http://en.cppreference.com/w/cpp/string/multibyte/mbsrtowcs.html',0,'std']]],
-  ['mbstate_5ft_79',['mbstate_t',['http://en.cppreference.com/w/cpp/string/multibyte/mbstate_t.html',0,'std']]],
-  ['mbstowcs_80',['mbstowcs',['http://en.cppreference.com/w/cpp/string/multibyte/mbstowcs.html',0,'std']]],
-  ['mbtowc_81',['mbtowc',['http://en.cppreference.com/w/cpp/string/multibyte/mbtowc.html',0,'std']]],
-  ['md5_82',['MD5',['../dd/d43/namespace_m_d5.html',1,'']]],
-  ['md5_2ecpp_83',['md5.cpp',['../d5/d96/md5_8cpp.html',1,'']]],
-  ['mean_84',['mean',['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/mean.html',0,'std::poisson_distribution::mean()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/params.html',0,'std::normal_distribution::mean()'],['../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b',1,'statistics::stats_computer1::mean()'],['../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e',1,'statistics::stats_computer2::mean()']]],
-  ['median_5fof_5fmedians_85',['median_of_medians',['../d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae',1,'search::median_search']]],
-  ['median_5fsearch_86',['median_search',['../da/dd4/namespacemedian__search.html',1,'']]],
-  ['median_5fsearch_2ecpp_87',['median_search.cpp',['../d9/d69/median__search_8cpp.html',1,'']]],
-  ['median_5fsearch2_2ecpp_88',['median_search2.cpp',['../d8/dfa/median__search2_8cpp.html',1,'']]],
-  ['mega_89',['mega',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['mem_5ffn_90',['mem_fn',['http://en.cppreference.com/w/cpp/utility/functional/mem_fn.html',0,'std']]],
-  ['memchr_91',['memchr',['http://en.cppreference.com/w/cpp/string/byte/memchr.html',0,'std']]],
-  ['memcmp_92',['memcmp',['http://en.cppreference.com/w/cpp/string/byte/memcmp.html',0,'std']]],
-  ['memcpy_93',['memcpy',['http://en.cppreference.com/w/cpp/string/byte/memcpy.html',0,'std']]],
-  ['memmove_94',['memmove',['http://en.cppreference.com/w/cpp/string/byte/memmove.html',0,'std']]],
-  ['memory_5fgame_2ecpp_95',['memory_game.cpp',['../dd/d92/memory__game_8cpp.html',1,'']]],
-  ['memset_96',['memset',['http://en.cppreference.com/w/cpp/string/byte/memset.html',0,'std']]],
-  ['merge_97',['Merge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9',1,'data_structures::tree_234::Tree234']]],
-  ['merge_98',['merge',['http://en.cppreference.com/w/cpp/container/forward_list/merge.html',0,'std::forward_list::merge()'],['http://en.cppreference.com/w/cpp/container/list/merge.html',0,'std::list::merge()'],['http://en.cppreference.com/w/cpp/algorithm/merge.html',0,'std::merge()'],['../d2/d26/count__inversions_8cpp.html#aad643c14734394e784a75169cb58132f',1,'sorting::inversion::merge()'],['../de/d7b/merge__insertion__sort_8cpp.html#af4de4067a9a866ffd985c5b5055ccedf',1,'sorting::merge_insertion::merge()'],['../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73',1,'merge():&#160;merge_sort.cpp'],['../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079',1,'sorting::merge()']]],
-  ['merge_5finsertion_99',['merge_insertion',['../de/d0a/namespacemerge__insertion.html',1,'']]],
-  ['merge_5finsertion_5fsort_2ecpp_100',['merge_insertion_sort.cpp',['../de/d7b/merge__insertion__sort_8cpp.html',1,'']]],
-  ['merge_5fsort_2ecpp_101',['merge_sort.cpp',['../d5/df4/merge__sort_8cpp.html',1,'']]],
-  ['mergenode_102',['MergeNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805',1,'data_structures::tree_234::Tree234']]],
-  ['mergenodenotfull_103',['MergeNodeNotFull',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95',1,'data_structures::tree_234::Tree234']]],
-  ['mergesort_104',['mergeSort',['../d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661',1,'sorting::inversion::mergeSort()'],['../de/d7b/merge__insertion__sort_8cpp.html#a7161278f18e83b671c6454b139cc5674',1,'sorting::merge_insertion::mergeSort()'],['../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7',1,'mergeSort():&#160;merge_sort.cpp']]],
-  ['mersenne_5ftwister_5fengine_105',['mersenne_twister_engine',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html',0,'std::mersenne_twister_engine'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mersenne_twister_engine::mersenne_twister_engine()']]],
-  ['message_106',['message',['http://en.cppreference.com/w/cpp/error/error_code/message.html',0,'std::error_code::message()'],['http://en.cppreference.com/w/cpp/error/error_category/message.html',0,'std::error_category::message()'],['http://en.cppreference.com/w/cpp/error/error_condition/message.html',0,'std::error_condition::message()']]],
-  ['messages_107',['messages',['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages'],['http://en.cppreference.com/w/cpp/locale/messages/messages.html',0,'std::messages::messages()']]],
-  ['messages_5fbase_108',['messages_base',['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std']]],
-  ['messages_5fbyname_109',['messages_byname',['http://en.cppreference.com/w/cpp/locale/messages_byname.html',0,'std::messages_byname'],['http://en.cppreference.com/w/cpp/locale/messages_byname.html',0,'std::messages_byname::messages_byname()']]],
-  ['method_201_3a_20use_20parent_20pointer_20store_20the_20address_20of_20parent_20nodes_110',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
-  ['method_202_3a_20search_20from_20the_20root_20node_111',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]],
-  ['method1_112',['method1',['../df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11',1,'decimal_to_binary.cpp']]],
-  ['method2_113',['method2',['../df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7',1,'decimal_to_binary.cpp']]],
-  ['methods_114',['Numerical Methods',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60',1,'']]],
-  ['micro_115',['micro',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['microseconds_116',['microseconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::microseconds'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::microseconds::microseconds()']]],
-  ['mid_117',['mid',['../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141',1,'data_structures::SegmentTree']]],
-  ['middlenode_118',['middleNode',['../d8/dfa/median__search2_8cpp.html#a5fefe132a0c3ee780ebc703f37ebce6a',1,'search::median_search2']]],
-  ['midpoint_119',['midpoint',['../df/d11/midpoint__integral__method_8cpp.html#a7072493d1f0f8a91b2a71d4cc456c09c',1,'numerical_methods::midpoint_rule']]],
-  ['midpoint_5feuler_120',['midpoint_euler',['../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985',1,'ode_midpoint_euler.cpp']]],
-  ['midpoint_5feuler_5fstep_121',['midpoint_euler_step',['../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812',1,'ode_midpoint_euler.cpp']]],
-  ['midpoint_5fintegral_5fmethod_2ecpp_122',['midpoint_integral_method.cpp',['../df/d11/midpoint__integral__method_8cpp.html',1,'']]],
-  ['midpoint_5frule_123',['midpoint_rule',['../d9/daa/namespacemidpoint__rule.html',1,'']]],
-  ['miller_5frabin_2ecpp_124',['miller_rabin.cpp',['../d6/d42/miller__rabin_8cpp.html',1,'']]],
-  ['miller_5frabin_5fprimality_5ftest_125',['miller_rabin_primality_test',['../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce',1,'miller_rabin.cpp']]],
-  ['miller_5ftest_126',['miller_test',['../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506',1,'miller_rabin.cpp']]],
-  ['milli_127',['milli',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['milliseconds_128',['milliseconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::milliseconds'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::milliseconds::milliseconds()']]],
-  ['min_129',['min',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/min.html',0,'std::student_t_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mt19937_64::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::ranlux24_base::min()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/min.html',0,'std::extreme_value_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/min.html',0,'std::lognormal_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/min.html',0,'std::discrete_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::ranlux48::min()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/min.html',0,'std::piecewise_constant_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/min.html',0,'std::poisson_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/min.html',0,'std::bernoulli_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::discard_block_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/min.html',0,'std::exponential_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/min.html',0,'std::uniform_real_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/min.html',0,'std::geometric_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mersenne_twister_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/min.html',0,'std::independent_bits_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/min.html',0,'std::normal_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::minstd_rand::min()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/min.html',0,'std::weibull_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::ranlux48_base::min()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/min.html',0,'std::negative_binomial_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mt19937::min()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/min.html',0,'std::chi_squared_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/min.html',0,'std::piecewise_linear_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/min.html',0,'std::shuffle_order_engine::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::minutes::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::seconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::duration::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::milliseconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::hours::min()'],['http://en.cppreference.com/w/cpp/chrono/time_point/min.html',0,'std::chrono::time_point::min()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/min.html',0,'std::chrono::duration_values::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::microseconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::nanoseconds::min()'],['http://en.cppreference.com/w/cpp/types/numeric_limits/min.html',0,'std::numeric_limits::min()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/min.html',0,'std::uniform_int_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/min.html',0,'std::fisher_f_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::ranlux24::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::linear_congruential_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/min.html',0,'std::knuth_b::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::minstd_rand0::min()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/min.html',0,'std::gamma_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/min.html',0,'std::binomial_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/min.html',0,'std::cauchy_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::subtract_with_carry_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/min.html',0,'std::random_device::min()'],['http://en.cppreference.com/w/cpp/algorithm/min.html',0,'std::min()'],['../da/d52/minimum__edit__distance_8cpp.html#a0138c226bd79ffe6d839c787cfc60347',1,'dynamic_programming::minimum_edit_distance::min()']]],
-  ['min_5fdistance_130',['MIN_DISTANCE',['../d8/d77/namespacemachine__learning.html#a7220dbb7fa896d83bfb7a50e4fce1786',1,'machine_learning']]],
-  ['min_5felement_131',['min_element',['http://en.cppreference.com/w/cpp/algorithm/min_element.html',0,'std']]],
-  ['mincoins_132',['mincoins',['../d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a',1,'dynamic_programming::mincoins_topdown']]],
-  ['mincoins_5ftopdown_133',['mincoins_topdown',['../d5/db8/namespacemincoins__topdown.html',1,'']]],
-  ['minelement_134',['minElement',['../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63',1,'dsu']]],
-  ['minfreq_135',['minFreq',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285',1,'others::Cache::LFUCache']]],
-  ['minheap_136',['MinHeap',['../d2/d05/class_min_heap.html',1,'MinHeap'],['../d2/d05/class_min_heap.html#a078cb888e642bb1f95dd0e03f0a35820',1,'MinHeap::MinHeap(int cap)']]],
-  ['minheapify_137',['MinHeapify',['../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad',1,'MinHeap']]],
-  ['minheapnode_138',['MinHeapNode',['../d5/d29/struct_min_heap_node.html',1,'']]],
-  ['minimax_139',['minimax',['../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50',1,'backtracking']]],
-  ['minimax_2ecpp_140',['minimax.cpp',['../df/dfb/minimax_8cpp.html',1,'']]],
-  ['minimum_141',['Minimum',['../d4/d12/namespace_minimum.html',1,'']]],
-  ['minimum_5fdistance_142',['minimum_distance',['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71',1,'greedy_algorithms::dijkstra']]],
-  ['minimum_5fedit_5fdistance_2ecpp_143',['minimum_edit_distance.cpp',['../da/d52/minimum__edit__distance_8cpp.html',1,'']]],
-  ['minmax_144',['minmax',['http://en.cppreference.com/w/cpp/algorithm/minmax.html',0,'std']]],
-  ['minmax_5felement_145',['minmax_element',['http://en.cppreference.com/w/cpp/algorithm/minmax_element.html',0,'std']]],
-  ['minmax_5fscaler_146',['minmax_scaler',['../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26',1,'machine_learning']]],
-  ['minstd_5frand_147',['minstd_rand',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html',0,'std::minstd_rand'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::minstd_rand::minstd_rand()']]],
-  ['minstd_5frand0_148',['minstd_rand0',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html',0,'std::minstd_rand0'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::minstd_rand0::minstd_rand0()']]],
-  ['minus_149',['minus',['http://en.cppreference.com/w/cpp/utility/functional/minus.html',0,'std']]],
-  ['minutes_150',['minutes',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::minutes'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::minutes::minutes()']]],
-  ['minvalue_151',['minValue',['../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e',1,'avltree.cpp']]],
-  ['mismatch_152',['mismatch',['http://en.cppreference.com/w/cpp/algorithm/mismatch.html',0,'std']]],
-  ['mktime_153',['mktime',['http://en.cppreference.com/w/cpp/chrono/c/mktime.html',0,'std']]],
-  ['mod_5fdivision_154',['mod_division',['../df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7',1,'math::modular_division']]],
-  ['modf_155',['modf',['http://en.cppreference.com/w/cpp/numeric/math/modf.html',0,'std']]],
-  ['modinverse_156',['modInverse',['../de/dab/ncr__modulo__p_8cpp.html#a6c7bfe3bdaa086d32261a5c5584d0fa9',1,'math::ncr_modulo_p::utils']]],
-  ['modular_5fdivision_157',['modular_division',['../d1/d64/namespacemodular__division.html',1,'']]],
-  ['modular_5fdivision_2ecpp_158',['modular_division.cpp',['../df/d72/modular__division_8cpp.html',1,'']]],
-  ['modular_5fexponentiation_159',['modular_exponentiation',['../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29',1,'miller_rabin.cpp']]],
-  ['modular_5fexponentiation_2ecpp_160',['modular_exponentiation.cpp',['../d0/d6d/modular__exponentiation_8cpp.html',1,'']]],
-  ['modular_5finverse_161',['modular_inverse',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae7e807e02c65c6fffd6162b4c66290c2',1,'math::modular_inverse_fermat']]],
-  ['modular_5finverse_5ffermat_162',['modular_inverse_fermat',['../d7/d50/namespacemodular__inverse__fermat.html',1,'']]],
-  ['modular_5finverse_5ffermat_5flittle_5ftheorem_2ecpp_163',['modular_inverse_fermat_little_theorem.cpp',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html',1,'']]],
-  ['modular_5finverse_5fsimple_2ecpp_164',['modular_inverse_simple.cpp',['../d6/d2d/modular__inverse__simple_8cpp.html',1,'']]],
-  ['modulus_165',['modulus',['http://en.cppreference.com/w/cpp/utility/functional/modulus.html',0,'std']]],
-  ['money_5fbase_166',['money_base',['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std']]],
-  ['money_5fget_167',['money_get',['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get'],['http://en.cppreference.com/w/cpp/locale/money_get/money_get.html',0,'std::money_get::money_get()']]],
-  ['money_5fput_168',['money_put',['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put'],['http://en.cppreference.com/w/cpp/locale/money_put/money_put.html',0,'std::money_put::money_put()']]],
-  ['moneypunct_169',['moneypunct',['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct'],['http://en.cppreference.com/w/cpp/locale/moneypunct/moneypunct.html',0,'std::moneypunct::moneypunct()']]],
-  ['moneypunct_5fbyname_170',['moneypunct_byname',['http://en.cppreference.com/w/cpp/locale/moneypunct_byname.html',0,'std::moneypunct_byname'],['http://en.cppreference.com/w/cpp/locale/moneypunct_byname.html',0,'std::moneypunct_byname::moneypunct_byname()']]],
-  ['monte_5fcarlo_171',['monte_carlo',['../d0/da4/namespacemonte__carlo.html',1,'']]],
-  ['month_172',['month',['../d1/df6/class_easter_year_month_day.html#a01a068eae0b6fa8f86f5f60c2840bbde',1,'EasterYearMonthDay']]],
-  ['morse_173',['morse',['../d6/d8d/namespacemorse.html',1,'']]],
-  ['morse_5fcode_2ecpp_174',['morse_code.cpp',['../d8/d76/morse__code_8cpp.html',1,'']]],
-  ['morse_5fto_5fchar_175',['morse_to_char',['../d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829',1,'ciphers::morse']]],
-  ['mov_176',['mov',['../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d',1,'tower_of_hanoi.cpp']]],
-  ['move_177',['move',['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::fstream::move()'],['http://en.cppreference.com/w/cpp/string/char_traits/move.html',0,'std::char_traits::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ios::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_fstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::iostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wistream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::stringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wifstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_istream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::strstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_stringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istrstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wiostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_istringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ifstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostrstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wfstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_iostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wstringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wistringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ifstream::move()'],['http://en.cppreference.com/w/cpp/utility/move.html',0,'std::move(T... args)']]],
-  ['move_5fbackward_178',['move_backward',['http://en.cppreference.com/w/cpp/algorithm/move_backward.html',0,'std']]],
-  ['move_5fif_5fnoexcept_179',['move_if_noexcept',['http://en.cppreference.com/w/cpp/utility/move_if_noexcept.html',0,'std']]],
-  ['move_5fiterator_180',['move_iterator',['http://en.cppreference.com/w/cpp/iterator/move_iterator.html',0,'std']]],
-  ['moves_181',['moves',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71',1,'machine_learning::aystar_search::EightPuzzle']]],
-  ['mst_182',['mst',['../d1/d77/structmst.html',1,'']]],
-  ['mt19937_183',['mt19937',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html',0,'std::mt19937'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mt19937::mt19937()']]],
-  ['mt19937_5f64_184',['mt19937_64',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html',0,'std::mt19937_64'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mt19937_64::mt19937_64()']]],
-  ['multimap_185',['multimap',['http://en.cppreference.com/w/cpp/container/multimap.html',0,'std::multimap&lt; K, T &gt;'],['http://en.cppreference.com/w/cpp/container/multimap/multimap.html',0,'std::multimap::multimap()']]],
-  ['multiplies_186',['multiplies',['http://en.cppreference.com/w/cpp/utility/functional/multiplies.html',0,'std']]],
-  ['multiply_187',['multiply',['../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc',1,'large_number::multiply()'],['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#a17f3d667241b88115a95282cdd719cb2',1,'ciphers::elliptic_curve_key_exchange::multiply()'],['../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9',1,'machine_learning::multiply()'],['../de/dc3/fibonacci__sum_8cpp.html#a9c83cca09a3e4ff2a25c816a9303448e',1,'math::fibonacci_sum::multiply()'],['../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9',1,'multiply(int x, int res[], int res_size):&#160;power_for_huge_numbers.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252',1,'multiply(const vector&lt; vector&lt; ll &gt; &gt; &amp;A, const vector&lt; vector&lt; ll &gt; &gt; &amp;B):&#160;matrix_exponentiation.cpp']]],
-  ['multiset_188',['multiset',['http://en.cppreference.com/w/cpp/container/multiset.html',0,'std::multiset&lt; K &gt;'],['http://en.cppreference.com/w/cpp/container/multiset/multiset.html',0,'std::multiset::multiset()']]],
-  ['multiset_3c_20int_20_3e_189',['multiset&lt; int &gt;',['http://en.cppreference.com/w/cpp/container/multiset.html',0,'std']]],
-  ['mutex_190',['mutex',['http://en.cppreference.com/w/cpp/thread/mutex.html',0,'std::mutex'],['http://en.cppreference.com/w/cpp/thread/unique_lock/mutex.html',0,'std::unique_lock::mutex()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/mutex.html',0,'std::shared_lock::mutex()'],['http://en.cppreference.com/w/cpp/thread/mutex/mutex.html',0,'std::mutex::mutex()']]]
+  ['make_5frecent_13',['make_recent',['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4',1,'others::Cache::LRUCache']]],
+  ['make_5fset_14',['make_set',['../d8/d99/connected__components__with__dsu_8cpp.html#ae91ed94113c56191b75fe45f688d6e62',1,'graph::disjoint_union']]],
+  ['makebst_15',['makeBST',['../d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
+  ['makelinkedlist_16',['makeLinkedList',['../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53',1,'search::sublist_search']]],
+  ['makenode_17',['makeNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a7f6f73a33beec448c27cc1d70b220702',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
+  ['makestrings_18',['makeStrings',['../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec',1,'backtracking::generate_parentheses']]],
+  ['making_20changes_19',['Making Changes',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md26',1,'']]],
+  ['manacher_20',['manacher',['../d8/dc6/namespacemanacher.html',1,'manacher'],['../d3/d39/manacher__algorithm_8cpp.html#a95e6a2976bb2f332898f373941d52098',1,'strings::manacher::manacher()']]],
+  ['manacher_5falgorithm_2ecpp_21',['manacher_algorithm.cpp',['../d3/d39/manacher__algorithm_8cpp.html',1,'']]],
+  ['manipulation_22',['Bit Manipulation',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46',1,'']]],
+  ['mat_5fmul_23',['mat_mul',['../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590',1,'ciphers::HillCipher::mat_mul()'],['../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae',1,'mat_mul(const std::valarray&lt; std::valarray&lt; double &gt; &gt; &amp;A, const std::valarray&lt; std::valarray&lt; double &gt; &gt; &amp;B, std::valarray&lt; std::valarray&lt; double &gt; &gt; *OUT):&#160;qr_eigen_values.cpp']]],
+  ['mat_5fsize_24',['mat_size',['../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54',1,'matrix_exponentiation.cpp']]],
+  ['match_25',['match',['../d8/d41/namespacegames_1_1memory__game.html#a370760f2b328ad341bcb77d82fa17b01',1,'games::memory_game']]],
+  ['matching_26',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]],
+  ['matching_20and_20not_20matching_20edges_27',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]],
+  ['matching_20edges_28',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]],
+  ['math_29',['Math',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md59',1,'']]],
+  ['math_30',['math',['../dd/d47/namespacemath.html',1,'']]],
+  ['matrix_31',['Matrix',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html',1,'divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256',1,'divide_and_conquer::strassens_multiplication::Matrix::Matrix(const Integer size)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a4aa49765cce39ce48b9241e993e0cfb9',1,'divide_and_conquer::strassens_multiplication::Matrix::Matrix(const Integer rows, const Integer cols)']]],
+  ['matrix_32',['matrix',['../d1/dbe/lu__decomposition_8h.html#ac029b636b353cefbb18b2fcc71e427e4',1,'lu_decomposition.h']]],
+  ['matrix_5fexponentiation_2ecpp_33',['matrix_exponentiation.cpp',['../d7/d35/matrix__exponentiation_8cpp.html',1,'']]],
+  ['max_34',['MAX',['../d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX:&#160;fibonacci_fast.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX:&#160;power_for_huge_numbers.cpp'],['../dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX:&#160;paranthesis_matching.cpp'],['../d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX:&#160;hash_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX:&#160;ternary_search.cpp']]],
+  ['max_5fheight_35',['max_height',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa554429def63077ab7a550c0affbfefa',1,'physics::ground_to_ground_projectile_motion']]],
+  ['max_5fiter_36',['MAX_ITER',['../d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1',1,'adaline_learning.cpp']]],
+  ['max_5fiterations_37',['MAX_ITERATIONS',['../d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14',1,'MAX_ITERATIONS:&#160;bisection_method.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#a5c5ff05b9f37ae59dad67e1d4f6cd51d',1,'MAX_ITERATIONS:&#160;newton_raphson_method.cpp']]],
+  ['max_5flevel_38',['MAX_LEVEL',['../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a',1,'data_structures']]],
+  ['max_5fsize_39',['max_size',['../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8',1,'queue_using_array.cpp']]],
+  ['max_5fsubarray_5fsum_40',['max_subarray_sum',['../de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147',1,'kadanes3.cpp']]],
+  ['maxcircularsum_41',['maxCircularSum',['../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb',1,'dynamic_programming']]],
+  ['maxelement_42',['maxElement',['../dd/d1f/classdsu.html#a4ade6f16c418fc98b54452f7b0252a53',1,'dsu']]],
+  ['maximum_20cardinality_20matching_43',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]],
+  ['maximum_5fcircular_5fsubarray_2ecpp_44',['maximum_circular_subarray.cpp',['../db/dfb/maximum__circular__subarray_8cpp.html',1,'']]],
+  ['maxknapsackvalue_45',['maxKnapsackValue',['../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1',1,'dynamic_programming::knapsack']]],
+  ['maxnode_46',['maxNode',['../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099',1,'data_structures::treap']]],
+  ['maxprofitbycuttingrod_47',['maxProfitByCuttingRod',['../d6/d10/cut__rod_8cpp.html#a1cc523a30c18c63eac58220c3c494cfa',1,'dynamic_programming::cut_rod']]],
+  ['maxsubarray_48',['maxSubArray',['../d4/da0/kadane_8cpp.html#af3029007a422a914a85c0b0122f1c7b4',1,'dynamic_programming::kadane']]],
+  ['md5_49',['MD5',['../dd/d43/namespace_m_d5.html',1,'']]],
+  ['md5_2ecpp_50',['md5.cpp',['../d5/d96/md5_8cpp.html',1,'']]],
+  ['mean_51',['mean',['../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b',1,'statistics::stats_computer1::mean()'],['../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e',1,'statistics::stats_computer2::mean()']]],
+  ['median_5fof_5fmedians_52',['median_of_medians',['../d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae',1,'search::median_search']]],
+  ['median_5fsearch_53',['median_search',['../da/dd4/namespacemedian__search.html',1,'']]],
+  ['median_5fsearch_2ecpp_54',['median_search.cpp',['../d9/d69/median__search_8cpp.html',1,'']]],
+  ['median_5fsearch2_2ecpp_55',['median_search2.cpp',['../d8/dfa/median__search2_8cpp.html',1,'']]],
+  ['memory_5fgame_2ecpp_56',['memory_game.cpp',['../dd/d92/memory__game_8cpp.html',1,'']]],
+  ['merge_57',['Merge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9',1,'data_structures::tree_234::Tree234']]],
+  ['merge_58',['merge',['../d2/d26/count__inversions_8cpp.html#aad643c14734394e784a75169cb58132f',1,'sorting::inversion::merge()'],['../de/d7b/merge__insertion__sort_8cpp.html#af4de4067a9a866ffd985c5b5055ccedf',1,'sorting::merge_insertion::merge()'],['../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73',1,'merge():&#160;merge_sort.cpp'],['../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079',1,'sorting::merge()']]],
+  ['merge_5finsertion_59',['merge_insertion',['../de/d0a/namespacemerge__insertion.html',1,'']]],
+  ['merge_5finsertion_5fsort_2ecpp_60',['merge_insertion_sort.cpp',['../de/d7b/merge__insertion__sort_8cpp.html',1,'']]],
+  ['merge_5fsort_2ecpp_61',['merge_sort.cpp',['../d5/df4/merge__sort_8cpp.html',1,'']]],
+  ['mergenode_62',['MergeNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805',1,'data_structures::tree_234::Tree234']]],
+  ['mergenodenotfull_63',['MergeNodeNotFull',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95',1,'data_structures::tree_234::Tree234']]],
+  ['mergesort_64',['mergeSort',['../d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661',1,'sorting::inversion::mergeSort()'],['../de/d7b/merge__insertion__sort_8cpp.html#a7161278f18e83b671c6454b139cc5674',1,'sorting::merge_insertion::mergeSort()'],['../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7',1,'mergeSort():&#160;merge_sort.cpp']]],
+  ['method_201_3a_20use_20parent_20pointer_20store_20the_20address_20of_20parent_20nodes_65',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
+  ['method_202_3a_20search_20from_20the_20root_20node_66',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]],
+  ['method1_67',['method1',['../df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11',1,'decimal_to_binary.cpp']]],
+  ['method2_68',['method2',['../df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7',1,'decimal_to_binary.cpp']]],
+  ['methods_69',['Numerical Methods',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60',1,'']]],
+  ['mid_70',['mid',['../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141',1,'data_structures::SegmentTree']]],
+  ['middlenode_71',['middleNode',['../d8/dfa/median__search2_8cpp.html#a5fefe132a0c3ee780ebc703f37ebce6a',1,'search::median_search2']]],
+  ['midpoint_72',['midpoint',['../df/d11/midpoint__integral__method_8cpp.html#a7072493d1f0f8a91b2a71d4cc456c09c',1,'numerical_methods::midpoint_rule']]],
+  ['midpoint_5feuler_73',['midpoint_euler',['../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985',1,'ode_midpoint_euler.cpp']]],
+  ['midpoint_5feuler_5fstep_74',['midpoint_euler_step',['../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812',1,'ode_midpoint_euler.cpp']]],
+  ['midpoint_5fintegral_5fmethod_2ecpp_75',['midpoint_integral_method.cpp',['../df/d11/midpoint__integral__method_8cpp.html',1,'']]],
+  ['midpoint_5frule_76',['midpoint_rule',['../d9/daa/namespacemidpoint__rule.html',1,'']]],
+  ['miller_5frabin_2ecpp_77',['miller_rabin.cpp',['../d6/d42/miller__rabin_8cpp.html',1,'']]],
+  ['miller_5frabin_5fprimality_5ftest_78',['miller_rabin_primality_test',['../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce',1,'miller_rabin.cpp']]],
+  ['miller_5ftest_79',['miller_test',['../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506',1,'miller_rabin.cpp']]],
+  ['min_80',['min',['../da/d52/minimum__edit__distance_8cpp.html#a0138c226bd79ffe6d839c787cfc60347',1,'dynamic_programming::minimum_edit_distance']]],
+  ['min_5fdistance_81',['MIN_DISTANCE',['../d8/d77/namespacemachine__learning.html#a7220dbb7fa896d83bfb7a50e4fce1786',1,'machine_learning']]],
+  ['mincoins_82',['mincoins',['../d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a',1,'dynamic_programming::mincoins_topdown']]],
+  ['mincoins_5ftopdown_83',['mincoins_topdown',['../d5/db8/namespacemincoins__topdown.html',1,'']]],
+  ['minelement_84',['minElement',['../dd/d1f/classdsu.html#a1d77aad7fc39fe7140d834cd347e5c63',1,'dsu']]],
+  ['minfreq_85',['minFreq',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a6de844d1589a809239cc07752f311285',1,'others::Cache::LFUCache']]],
+  ['minheap_86',['MinHeap',['../d2/d05/class_min_heap.html',1,'MinHeap'],['../d2/d05/class_min_heap.html#a078cb888e642bb1f95dd0e03f0a35820',1,'MinHeap::MinHeap(int cap)']]],
+  ['minheapify_87',['MinHeapify',['../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad',1,'MinHeap']]],
+  ['minheapnode_88',['MinHeapNode',['../d5/d29/struct_min_heap_node.html',1,'']]],
+  ['minimax_89',['minimax',['../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50',1,'backtracking']]],
+  ['minimax_2ecpp_90',['minimax.cpp',['../df/dfb/minimax_8cpp.html',1,'']]],
+  ['minimum_91',['Minimum',['../d4/d12/namespace_minimum.html',1,'']]],
+  ['minimum_5fdistance_92',['minimum_distance',['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71',1,'greedy_algorithms::dijkstra']]],
+  ['minimum_5fedit_5fdistance_2ecpp_93',['minimum_edit_distance.cpp',['../da/d52/minimum__edit__distance_8cpp.html',1,'']]],
+  ['minmax_5fscaler_94',['minmax_scaler',['../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26',1,'machine_learning']]],
+  ['minvalue_95',['minValue',['../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e',1,'avltree.cpp']]],
+  ['mod_5fdivision_96',['mod_division',['../df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7',1,'math::modular_division']]],
+  ['modinverse_97',['modInverse',['../de/dab/ncr__modulo__p_8cpp.html#a6c7bfe3bdaa086d32261a5c5584d0fa9',1,'math::ncr_modulo_p::utils']]],
+  ['modular_5fdivision_98',['modular_division',['../d1/d64/namespacemodular__division.html',1,'']]],
+  ['modular_5fdivision_2ecpp_99',['modular_division.cpp',['../df/d72/modular__division_8cpp.html',1,'']]],
+  ['modular_5fexponentiation_100',['modular_exponentiation',['../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29',1,'miller_rabin.cpp']]],
+  ['modular_5fexponentiation_2ecpp_101',['modular_exponentiation.cpp',['../d0/d6d/modular__exponentiation_8cpp.html',1,'']]],
+  ['modular_5finverse_102',['modular_inverse',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae7e807e02c65c6fffd6162b4c66290c2',1,'math::modular_inverse_fermat']]],
+  ['modular_5finverse_5ffermat_103',['modular_inverse_fermat',['../d7/d50/namespacemodular__inverse__fermat.html',1,'']]],
+  ['modular_5finverse_5ffermat_5flittle_5ftheorem_2ecpp_104',['modular_inverse_fermat_little_theorem.cpp',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html',1,'']]],
+  ['modular_5finverse_5fsimple_2ecpp_105',['modular_inverse_simple.cpp',['../d6/d2d/modular__inverse__simple_8cpp.html',1,'']]],
+  ['monte_5fcarlo_106',['monte_carlo',['../d0/da4/namespacemonte__carlo.html',1,'']]],
+  ['month_107',['month',['../d1/df6/class_easter_year_month_day.html#a01a068eae0b6fa8f86f5f60c2840bbde',1,'EasterYearMonthDay']]],
+  ['morse_108',['morse',['../d6/d8d/namespacemorse.html',1,'']]],
+  ['morse_5fcode_2ecpp_109',['morse_code.cpp',['../d8/d76/morse__code_8cpp.html',1,'']]],
+  ['morse_5fto_5fchar_110',['morse_to_char',['../d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829',1,'ciphers::morse']]],
+  ['mov_111',['mov',['../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d',1,'tower_of_hanoi.cpp']]],
+  ['moves_112',['moves',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa73857052e69b86347859d9148933f71',1,'machine_learning::aystar_search::EightPuzzle']]],
+  ['mst_113',['mst',['../d1/d77/structmst.html',1,'']]],
+  ['multiply_114',['multiply',['../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc',1,'large_number::multiply()'],['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#a17f3d667241b88115a95282cdd719cb2',1,'ciphers::elliptic_curve_key_exchange::multiply()'],['../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9',1,'machine_learning::multiply()'],['../de/dc3/fibonacci__sum_8cpp.html#a9c83cca09a3e4ff2a25c816a9303448e',1,'math::fibonacci_sum::multiply()'],['../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9',1,'multiply(int x, int res[], int res_size):&#160;power_for_huge_numbers.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252',1,'multiply(const vector&lt; vector&lt; ll &gt; &gt; &amp;A, const vector&lt; vector&lt; ll &gt; &gt; &amp;B):&#160;matrix_exponentiation.cpp']]]
 ];
diff --git a/search/all_13.js b/search/all_13.js
index 6b5bfea9f..3f376a5b3 100644
--- a/search/all_13.js
+++ b/search/all_13.js
@@ -1,7 +1,7 @@
 var searchData=
 [
   ['n_0',['N',['../d8/dab/sparse__table_8cpp.html#a10f3ffb3f6f7e1b83d556b9c8de89a5d',1,'data_structures::sparse_table']]],
-  ['n_1',['n',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad71ecd43d0af1127df5f4006258f9635',1,'data_structures::sparse_table::Sparse_table::n'],['../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c',1,'graph::HKGraph::n'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef',1,'graph::is_graph_bipartite::Graph::n'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6',1,'range_queries::fenwick_tree::n'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/n.html',0,'std::student_t_distribution::n()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/n.html',0,'std::chi_squared_distribution::n()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/params.html',0,'std::fisher_f_distribution::n()']]],
+  ['n_1',['n',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad71ecd43d0af1127df5f4006258f9635',1,'data_structures::sparse_table::Sparse_table::n'],['../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c',1,'graph::HKGraph::n'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#aefea7ee87a708298c486d5a38ac628ef',1,'graph::is_graph_bipartite::Graph::n'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#af9f543aa5976b8cc5422490b3d6250c6',1,'range_queries::fenwick_tree::n']]],
   ['n_5fbonacci_2',['N_bonacci',['../db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d',1,'math::n_bonacci']]],
   ['n_5fbonacci_3',['n_bonacci',['../de/d36/namespacen__bonacci.html',1,'']]],
   ['n_5fbonacci_2ecpp_4',['n_bonacci.cpp',['../db/d27/n__bonacci_8cpp.html',1,'']]],
@@ -14,93 +14,48 @@ var searchData=
   ['n_5fqueens_5fall_5fsolutions_11',['n_queens_all_solutions',['../df/d44/namespacen__queens__all__solutions.html',1,'']]],
   ['n_5fqueens_5foptimized_12',['n_queens_optimized',['../d8/d14/namespacen__queens__optimized.html',1,'']]],
   ['naive_5fmultiplication_13',['naive_multiplication',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50',1,'divide_and_conquer::strassens_multiplication::Matrix']]],
-  ['name_14',['name',['http://en.cppreference.com/w/cpp/locale/locale/name.html',0,'std::locale::name()'],['http://en.cppreference.com/w/cpp/error/error_category/name.html',0,'std::error_category::name()'],['http://en.cppreference.com/w/cpp/types/type_info/name.html',0,'std::type_info::name()'],['http://en.cppreference.com/w/cpp/types/type_index/name.html',0,'std::type_index::name()']]],
-  ['name_20guidelines_15',['File Name guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'']]],
-  ['nan_16',['nan',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]],
-  ['nanf_17',['nanf',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]],
-  ['nanl_18',['nanl',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]],
-  ['nano_19',['nano',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['nanoseconds_20',['nanoseconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::nanoseconds'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::nanoseconds::nanoseconds()']]],
-  ['narrow_21',['narrow',['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ofstream::narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype_byname::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::fstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ios::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_fstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::iostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wistream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::stringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wifstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_istream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::strstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_stringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istrstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wiostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ofstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_istringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ifstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istringstream::narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostrstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wfstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_iostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wofstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wstringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wistringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ifstream::narrow()']]],
-  ['native_5fhandle_22',['native_handle',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/native_handle.html',0,'std::condition_variable_any::native_handle()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/native_handle.html',0,'std::condition_variable::native_handle()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/native_handle.html',0,'std::recursive_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/native_handle.html',0,'std::recursive_timed_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/thread/native_handle.html',0,'std::thread::native_handle()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/native_handle.html',0,'std::timed_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/mutex/native_handle.html',0,'std::mutex::native_handle()']]],
-  ['ncr_23',['nCr',['../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a',1,'binomial_dist.cpp']]],
-  ['ncr_24',['ncr',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a499df7a01bcd348345dc5a0ab79bb0e9',1,'math::ncr_modulo_p::NCRModuloP']]],
-  ['ncr_5fmodulo_5fp_25',['ncr_modulo_p',['../d4/db9/namespacencr__modulo__p.html',1,'']]],
-  ['ncr_5fmodulo_5fp_2ecpp_26',['ncr_modulo_p.cpp',['../de/dab/ncr__modulo__p_8cpp.html',1,'']]],
-  ['ncrmodulop_27',['NCRModuloP',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html',1,'math::ncr_modulo_p::NCRModuloP'],['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a94b07e7dc61d8d7a1e9c5a28988e72f9',1,'math::ncr_modulo_p::NCRModuloP::NCRModuloP()']]],
-  ['nearbyint_28',['nearbyint',['http://en.cppreference.com/w/cpp/numeric/math/nearbyint.html',0,'std']]],
-  ['neg_5fformat_29',['neg_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::neg_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::neg_format()']]],
-  ['negate_30',['negate',['http://en.cppreference.com/w/cpp/utility/functional/negate.html',0,'std']]],
-  ['negative_5fbinomial_5fdistribution_31',['negative_binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution.html',0,'std::negative_binomial_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/negative_binomial_distribution.html',0,'std::negative_binomial_distribution::negative_binomial_distribution()']]],
-  ['negative_5fsign_32',['negative_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::negative_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::negative_sign()']]],
-  ['neighbors_33',['neighbors',['../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a',1,'graph::Graph']]],
-  ['nested_5fexception_34',['nested_exception',['http://en.cppreference.com/w/cpp/error/nested_exception.html',0,'std::nested_exception'],['http://en.cppreference.com/w/cpp/error/nested_exception/nested_exception.html',0,'std::nested_exception::nested_exception(T... args)']]],
-  ['nested_5fptr_35',['nested_ptr',['http://en.cppreference.com/w/cpp/error/nested_exception/nested_ptr.html',0,'std::nested_exception']]],
-  ['neural_5fnetwork_36',['neural_network',['../d0/d2e/namespaceneural__network.html',1,'']]],
-  ['neural_5fnetwork_2ecpp_37',['neural_network.cpp',['../d2/d58/neural__network_8cpp.html',1,'']]],
-  ['neuralnetwork_38',['NeuralNetwork',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html',1,'machine_learning::neural_network::NeuralNetwork'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4c4c6f63ab965317f9471518ee931b89',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const std::vector&lt; std::pair&lt; int, std::string &gt; &gt; &amp;config, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;kernels)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ae7cf126a3a8f9d20c81b21584d061a08',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork()=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a62151b0398a2536be60d950e10ffe9a8',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const std::vector&lt; std::pair&lt; int, std::string &gt; &gt; &amp;config)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a176b955c90ae57d7dbc3c63f27c84c75',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const NeuralNetwork &amp;model)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a173bb71780af6953ec2e307a4c74b025',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(NeuralNetwork &amp;&amp;)=default']]],
-  ['new_20directory_39',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]],
-  ['new_5fhandler_40',['new_handler',['http://en.cppreference.com/w/cpp/memory/new/new_handler.html',0,'std']]],
-  ['new_5fval_41',['new_val',['../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2',1,'statistics::stats_computer1::new_val()'],['../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534',1,'statistics::stats_computer2::new_val()']]],
-  ['newkid_42',['newKid',['../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817',1,'range_queries::perSegTree']]],
-  ['newton_5fraphson_5fmethod_2ecpp_43',['newton_raphson_method.cpp',['../de/dd3/newton__raphson__method_8cpp.html',1,'']]],
-  ['next_44',['next',['../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e',1,'data_structures::linked_list::Node::next'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77',1,'operations_on_datastructures::circular_linked_list::Node::next'],['../de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd',1,'others::Cache::D_Node::next'],['../d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f',1,'list::next'],['../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1',1,'ListNode::next'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a',1,'search::sublist_search::Node::next'],['http://en.cppreference.com/w/cpp/iterator/next.html',0,'std::next()']]],
-  ['next_5fhigher_5fnumber_45',['next_higher_number',['../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e',1,'bit_manipulation']]],
-  ['next_5fhigher_5fnumber_5fwith_5fsame_5fnumber_5fof_5fset_5fbits_2ecpp_46',['next_higher_number_with_same_number_of_set_bits.cpp',['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html',1,'']]],
-  ['next_5fpermutation_47',['next_permutation',['http://en.cppreference.com/w/cpp/algorithm/next_permutation.html',0,'std']]],
-  ['nextafter_48',['nextafter',['http://en.cppreference.com/w/cpp/numeric/math/nextafter.html',0,'std']]],
-  ['nexttoward_49',['nexttoward',['http://en.cppreference.com/w/cpp/numeric/math/nextafter.html',0,'std']]],
-  ['no_5foccurence_5ftests_50',['no_occurence_tests',['../de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d',1,'fibonacci_search.cpp']]],
-  ['no_5fof_5fconnected_5fcomponents_51',['no_of_connected_components',['../d8/d99/connected__components__with__dsu_8cpp.html#ac2d6698b71384a352ec4b81b31b13141',1,'graph::disjoint_union']]],
-  ['noboolalpha_52',['noboolalpha',['http://en.cppreference.com/w/cpp/io/manip/boolalpha.html',0,'std']]],
-  ['node_53',['Node',['../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html',1,'data_structures::linked_list::Node'],['../d9/d49/structdata__structures_1_1_node.html',1,'data_structures::Node'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html',1,'data_structures::tree_234::Node'],['../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html',1,'data_structures::trie_using_hashmap::Trie::Node'],['../db/d8b/struct_node.html',1,'Node&lt; ValueType &gt;'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html',1,'operations_on_datastructures::circular_linked_list::Node'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html',1,'operations_on_datastructures::inorder_traversal_of_bst::Node'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html',1,'operations_on_datastructures::reverse_binary_tree::Node'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html',1,'others::iterative_tree_traversals::Node'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html',1,'others::recursive_tree_traversals::Node'],['../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html',1,'range_queries::perSegTree::Node'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html',1,'search::sublist_search::Node'],['../dd/d1c/classhash__chain.html#a8b204861e9470377c956d3b5cd313036',1,'hash_chain::Node'],['../d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78',1,'data_structures::Node::Node()'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5219979ea9a8baa3a273a9ec0f0c670',1,'data_structures::tree_234::Node::Node()'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5',1,'operations_on_datastructures::circular_linked_list::Node::Node(int64_t _data)'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95',1,'operations_on_datastructures::circular_linked_list::Node::Node(int64_t _data, Node *_next)'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3',1,'operations_on_datastructures::reverse_binary_tree::Node::Node()']]],
-  ['node_54',['node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'Method 2: Search from the root node'],['../d5/da1/structnode.html',1,'node'],['../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287',1,'node:&#160;avltree.cpp'],['../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555',1,'node:&#160;hash_search.cpp']]],
-  ['node_20does_20not_20have_20a_20right_20node_20subtree_55',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]],
-  ['node_20has_20the_20right_20node_20subtree_56',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]],
-  ['node_20subtree_57',['node subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'Case 2: The given node does not have a right node/subtree']]],
-  ['node_2ehpp_58',['node.hpp',['../d3/d09/node_8hpp.html',1,'']]],
-  ['node_3c_20value_5ftype_20_3e_59',['Node&lt; value_type &gt;',['../db/d8b/struct_node.html',1,'']]],
-  ['node_5fmap_60',['node_map',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35',1,'others::Cache::LFUCache::node_map'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5',1,'others::Cache::LRUCache::node_map']]],
-  ['nodes_61',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
-  ['non_5frecursive_5fmerge_5fsort_62',['non_recursive_merge_sort',['../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)'],['../d5/d91/namespacesorting.html#a27236b8d3df3832e1f1225576a122534',1,'sorting::non_recursive_merge_sort(const Iterator first, const size_t n)'],['../d5/d91/namespacesorting.html#ae97f4dd815654c4682f564afd718e824',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last)']]],
-  ['non_5frecursive_5fmerge_5fsort_2ecpp_63',['non_recursive_merge_sort.cpp',['../d0/db6/non__recursive__merge__sort_8cpp.html',1,'']]],
-  ['none_64',['none',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]],
-  ['none_5fof_65',['none_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]],
-  ['normal_5fdistribution_66',['normal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution.html',0,'std::normal_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/normal_distribution.html',0,'std::normal_distribution::normal_distribution()']]],
-  ['noshowbase_67',['noshowbase',['http://en.cppreference.com/w/cpp/io/manip/showbase.html',0,'std']]],
-  ['noshowpoint_68',['noshowpoint',['http://en.cppreference.com/w/cpp/io/manip/showpoint.html',0,'std']]],
-  ['noshowpos_69',['noshowpos',['http://en.cppreference.com/w/cpp/io/manip/showpos.html',0,'std']]],
-  ['noskipws_70',['noskipws',['http://en.cppreference.com/w/cpp/io/manip/skipws.html',0,'std']]],
-  ['not_20have_20a_20right_20node_20subtree_71',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]],
-  ['not_20matching_20edges_72',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]],
-  ['not1_73',['not1',['http://en.cppreference.com/w/cpp/utility/functional/not1.html',0,'std']]],
-  ['not2_74',['not2',['http://en.cppreference.com/w/cpp/utility/functional/not2.html',0,'std']]],
-  ['not_5feof_75',['not_eof',['http://en.cppreference.com/w/cpp/string/char_traits/not_eof.html',0,'std::char_traits']]],
-  ['not_5fequal_5fto_76',['not_equal_to',['http://en.cppreference.com/w/cpp/utility/functional/not_equal_to.html',0,'std']]],
-  ['nothrow_5ft_77',['nothrow_t',['http://en.cppreference.com/w/cpp/memory/new/nothrow_t.html',0,'std']]],
-  ['notify_5fall_78',['notify_all',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/notify_all.html',0,'std::condition_variable_any::notify_all()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/notify_all.html',0,'std::condition_variable::notify_all()']]],
-  ['notify_5fall_5fat_5fthread_5fexit_79',['notify_all_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/notify_all_at_thread_exit.html',0,'std']]],
-  ['notify_5fone_80',['notify_one',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/notify_one.html',0,'std::condition_variable_any::notify_one()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/notify_one.html',0,'std::condition_variable::notify_one()']]],
-  ['nounitbuf_81',['nounitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]],
-  ['nouppercase_82',['nouppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]],
-  ['now_83',['now',['http://en.cppreference.com/w/cpp/chrono/steady_clock/now.html',0,'std::chrono::steady_clock::now()'],['http://en.cppreference.com/w/cpp/chrono/system_clock/now.html',0,'std::chrono::system_clock::now()'],['http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html',0,'std::chrono::high_resolution_clock::now()']]],
-  ['nqueen_5fprint_5fall_5fsolutions_2ecpp_84',['nqueen_print_all_solutions.cpp',['../d7/d24/nqueen__print__all__solutions_8cpp.html',1,'']]],
-  ['nqueensol_85',['NQueenSol',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f',1,'backtracking::n_queens_optimized::NQueenSol()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#acc809c055f335011de0d9030034c7108',1,'backtracking::n_queens_all_solutions::NQueenSol()']]],
-  ['nth_5felement_86',['nth_element',['http://en.cppreference.com/w/cpp/algorithm/nth_element.html',0,'std']]],
-  ['nullptr_5ft_87',['nullptr_t',['http://en.cppreference.com/w/cpp/types/nullptr_t.html',0,'std']]],
-  ['num_5fchars_88',['NUM_CHARS',['../d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191',1,'data_structures::trie']]],
-  ['num_5fdigits_89',['num_digits',['../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93',1,'large_number']]],
-  ['num_5fget_90',['num_get',['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std::num_get'],['http://en.cppreference.com/w/cpp/locale/num_get/num_get.html',0,'std::num_get::num_get()']]],
-  ['num_5fput_91',['num_put',['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put'],['http://en.cppreference.com/w/cpp/locale/num_put/num_put.html',0,'std::num_put::num_put()']]],
-  ['number_5fof_5fpositive_5fdivisors_92',['number_of_positive_divisors',['../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb',1,'number_of_positive_divisors.cpp']]],
-  ['number_5fof_5fpositive_5fdivisors_2ecpp_93',['number_of_positive_divisors.cpp',['../d0/da2/number__of__positive__divisors_8cpp.html',1,'']]],
-  ['number_5fof_5fsubsets_94',['number_of_subsets',['../d2/d5a/subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99',1,'backtracking::subset_sum']]],
-  ['number_5fof_5fvertices_95',['number_of_vertices',['../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904',1,'graph::Graph']]],
-  ['numberofchildren_96',['numberOfChildren',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0',1,'operations_on_datastructures::trie_operations::Tnode']]],
-  ['numberofciphersinfactorialn_97',['numberOfCiphersInFactorialN',['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#a0d5e1d651d0d30bd682f176d8f2b83d0',1,'bit_manipulation::count_of_trailing_ciphers_in_factorial_n']]],
-  ['numeric_5flimits_98',['numeric_limits',['http://en.cppreference.com/w/cpp/types/numeric_limits.html',0,'std']]],
-  ['numerical_20methods_99',['Numerical Methods',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60',1,'']]],
-  ['numerical_5fmethods_100',['numerical_methods',['../d1/de0/namespacenumerical__methods.html',1,'']]],
-  ['numpunct_101',['numpunct',['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct'],['http://en.cppreference.com/w/cpp/locale/numpunct/numpunct.html',0,'std::numpunct::numpunct()']]],
-  ['numpunct_5fbyname_102',['numpunct_byname',['http://en.cppreference.com/w/cpp/locale/numpunct_byname.html',0,'std::numpunct_byname'],['http://en.cppreference.com/w/cpp/locale/numpunct_byname.html',0,'std::numpunct_byname::numpunct_byname()']]]
+  ['name_20guidelines_14',['File Name guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'']]],
+  ['ncr_15',['nCr',['../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a',1,'binomial_dist.cpp']]],
+  ['ncr_16',['ncr',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a499df7a01bcd348345dc5a0ab79bb0e9',1,'math::ncr_modulo_p::NCRModuloP']]],
+  ['ncr_5fmodulo_5fp_17',['ncr_modulo_p',['../d4/db9/namespacencr__modulo__p.html',1,'']]],
+  ['ncr_5fmodulo_5fp_2ecpp_18',['ncr_modulo_p.cpp',['../de/dab/ncr__modulo__p_8cpp.html',1,'']]],
+  ['ncrmodulop_19',['NCRModuloP',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html',1,'math::ncr_modulo_p::NCRModuloP'],['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a94b07e7dc61d8d7a1e9c5a28988e72f9',1,'math::ncr_modulo_p::NCRModuloP::NCRModuloP()']]],
+  ['neighbors_20',['neighbors',['../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a',1,'graph::Graph']]],
+  ['neural_5fnetwork_21',['neural_network',['../d0/d2e/namespaceneural__network.html',1,'']]],
+  ['neural_5fnetwork_2ecpp_22',['neural_network.cpp',['../d2/d58/neural__network_8cpp.html',1,'']]],
+  ['neuralnetwork_23',['NeuralNetwork',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html',1,'machine_learning::neural_network::NeuralNetwork'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4c4c6f63ab965317f9471518ee931b89',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const std::vector&lt; std::pair&lt; int, std::string &gt; &gt; &amp;config, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;kernels)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ae7cf126a3a8f9d20c81b21584d061a08',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork()=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a62151b0398a2536be60d950e10ffe9a8',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const std::vector&lt; std::pair&lt; int, std::string &gt; &gt; &amp;config)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a176b955c90ae57d7dbc3c63f27c84c75',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const NeuralNetwork &amp;model)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a173bb71780af6953ec2e307a4c74b025',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(NeuralNetwork &amp;&amp;)=default']]],
+  ['new_20directory_24',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]],
+  ['new_5fval_25',['new_val',['../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2',1,'statistics::stats_computer1::new_val()'],['../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534',1,'statistics::stats_computer2::new_val()']]],
+  ['newkid_26',['newKid',['../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817',1,'range_queries::perSegTree']]],
+  ['newton_5fraphson_5fmethod_2ecpp_27',['newton_raphson_method.cpp',['../de/dd3/newton__raphson__method_8cpp.html',1,'']]],
+  ['next_28',['next',['../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html#acfccd7b52c91d91300c5b317e5ec7a6e',1,'data_structures::linked_list::Node::next'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7c867b8e1034a6f5da490c8b8c09cb77',1,'operations_on_datastructures::circular_linked_list::Node::next'],['../de/d21/classothers_1_1_cache_1_1_d___node.html#a0043eb287c54b3b2fb91ce354878a7bd',1,'others::Cache::D_Node::next'],['../d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f',1,'list::next'],['../d7/da4/struct_list_node.html#ad78b392c2ddc25c3243d0c2f30692fb1',1,'ListNode::next'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a',1,'search::sublist_search::Node::next']]],
+  ['next_5fhigher_5fnumber_29',['next_higher_number',['../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e',1,'bit_manipulation']]],
+  ['next_5fhigher_5fnumber_5fwith_5fsame_5fnumber_5fof_5fset_5fbits_2ecpp_30',['next_higher_number_with_same_number_of_set_bits.cpp',['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html',1,'']]],
+  ['no_5foccurence_5ftests_31',['no_occurence_tests',['../de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d',1,'fibonacci_search.cpp']]],
+  ['no_5fof_5fconnected_5fcomponents_32',['no_of_connected_components',['../d8/d99/connected__components__with__dsu_8cpp.html#ac2d6698b71384a352ec4b81b31b13141',1,'graph::disjoint_union']]],
+  ['node_33',['Node',['../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html',1,'data_structures::linked_list::Node'],['../d9/d49/structdata__structures_1_1_node.html',1,'data_structures::Node'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html',1,'data_structures::tree_234::Node'],['../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html',1,'data_structures::trie_using_hashmap::Trie::Node'],['../db/d8b/struct_node.html',1,'Node&lt; ValueType &gt;'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html',1,'operations_on_datastructures::circular_linked_list::Node'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html',1,'operations_on_datastructures::inorder_traversal_of_bst::Node'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html',1,'operations_on_datastructures::reverse_binary_tree::Node'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html',1,'others::iterative_tree_traversals::Node'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html',1,'others::recursive_tree_traversals::Node'],['../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html',1,'range_queries::perSegTree::Node'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html',1,'search::sublist_search::Node'],['../dd/d1c/classhash__chain.html#a8b204861e9470377c956d3b5cd313036',1,'hash_chain::Node'],['../d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78',1,'data_structures::Node::Node()'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5219979ea9a8baa3a273a9ec0f0c670',1,'data_structures::tree_234::Node::Node()'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5',1,'operations_on_datastructures::circular_linked_list::Node::Node(int64_t _data)'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95',1,'operations_on_datastructures::circular_linked_list::Node::Node(int64_t _data, Node *_next)'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3',1,'operations_on_datastructures::reverse_binary_tree::Node::Node()']]],
+  ['node_34',['node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'Method 2: Search from the root node'],['../d5/da1/structnode.html',1,'node'],['../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287',1,'node:&#160;avltree.cpp'],['../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555',1,'node:&#160;hash_search.cpp']]],
+  ['node_20does_20not_20have_20a_20right_20node_20subtree_35',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]],
+  ['node_20has_20the_20right_20node_20subtree_36',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]],
+  ['node_20subtree_37',['node subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'Case 2: The given node does not have a right node/subtree']]],
+  ['node_2ehpp_38',['node.hpp',['../d3/d09/node_8hpp.html',1,'']]],
+  ['node_3c_20value_5ftype_20_3e_39',['Node&lt; value_type &gt;',['../db/d8b/struct_node.html',1,'']]],
+  ['node_5fmap_40',['node_map',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac7684879e2e5da3d8bc5b1699ee42d35',1,'others::Cache::LFUCache::node_map'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8dab0f69410484f772946befd24cc3c5',1,'others::Cache::LRUCache::node_map']]],
+  ['nodes_41',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
+  ['non_5frecursive_5fmerge_5fsort_42',['non_recursive_merge_sort',['../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)'],['../d5/d91/namespacesorting.html#a27236b8d3df3832e1f1225576a122534',1,'sorting::non_recursive_merge_sort(const Iterator first, const size_t n)'],['../d5/d91/namespacesorting.html#ae97f4dd815654c4682f564afd718e824',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last)']]],
+  ['non_5frecursive_5fmerge_5fsort_2ecpp_43',['non_recursive_merge_sort.cpp',['../d0/db6/non__recursive__merge__sort_8cpp.html',1,'']]],
+  ['not_20have_20a_20right_20node_20subtree_44',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]],
+  ['not_20matching_20edges_45',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]],
+  ['nqueen_5fprint_5fall_5fsolutions_2ecpp_46',['nqueen_print_all_solutions.cpp',['../d7/d24/nqueen__print__all__solutions_8cpp.html',1,'']]],
+  ['nqueensol_47',['NQueenSol',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f',1,'backtracking::n_queens_optimized::NQueenSol()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#acc809c055f335011de0d9030034c7108',1,'backtracking::n_queens_all_solutions::NQueenSol()']]],
+  ['num_5fchars_48',['NUM_CHARS',['../d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191',1,'data_structures::trie']]],
+  ['num_5fdigits_49',['num_digits',['../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93',1,'large_number']]],
+  ['number_5fof_5fpositive_5fdivisors_50',['number_of_positive_divisors',['../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb',1,'number_of_positive_divisors.cpp']]],
+  ['number_5fof_5fpositive_5fdivisors_2ecpp_51',['number_of_positive_divisors.cpp',['../d0/da2/number__of__positive__divisors_8cpp.html',1,'']]],
+  ['number_5fof_5fsubsets_52',['number_of_subsets',['../d2/d5a/subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99',1,'backtracking::subset_sum']]],
+  ['number_5fof_5fvertices_53',['number_of_vertices',['../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904',1,'graph::Graph']]],
+  ['numberofchildren_54',['numberOfChildren',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0',1,'operations_on_datastructures::trie_operations::Tnode']]],
+  ['numberofciphersinfactorialn_55',['numberOfCiphersInFactorialN',['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#a0d5e1d651d0d30bd682f176d8f2b83d0',1,'bit_manipulation::count_of_trailing_ciphers_in_factorial_n']]],
+  ['numerical_20methods_56',['Numerical Methods',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md60',1,'']]],
+  ['numerical_5fmethods_57',['numerical_methods',['../d1/de0/namespacenumerical__methods.html',1,'']]]
 ];
diff --git a/search/all_14.js b/search/all_14.js
index 2bfdb4f6d..527685383 100644
--- a/search/all_14.js
+++ b/search/all_14.js
@@ -1,91 +1,66 @@
 var searchData=
 [
-  ['oct_0',['oct',['http://en.cppreference.com/w/cpp/io/manip/hex.html',0,'std']]],
-  ['ode_5fforward_5feuler_2ecpp_1',['ode_forward_euler.cpp',['../db/dd3/ode__forward__euler_8cpp.html',1,'']]],
-  ['ode_5fmidpoint_5feuler_2ecpp_2',['ode_midpoint_euler.cpp',['../d6/dd3/ode__midpoint__euler_8cpp.html',1,'']]],
-  ['ode_5fsemi_5fimplicit_5feuler_2ecpp_3',['ode_semi_implicit_euler.cpp',['../d3/d06/ode__semi__implicit__euler_8cpp.html',1,'']]],
-  ['of_20a_20program_4',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]],
-  ['of_20a_20tree_5',['of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]],
-  ['of_20conduct_6',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]],
-  ['of_20parent_20nodes_7',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
-  ['offset_8',['offset',['../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801',1,'range_queries::fenwick_tree']]],
-  ['ofstream_9',['ofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std::ofstream'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/basic_ofstream.html',0,'std::ofstream::ofstream()']]],
-  ['ols_5ftest_10',['ols_test',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d',1,'ordinary_least_squares_regressor.cpp']]],
-  ['on_20datastructures_11',['Operations On Datastructures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61',1,'']]],
-  ['on_5fsegment_12',['on_segment',['../d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf',1,'SegmentIntersection']]],
-  ['once_5fflag_13',['once_flag',['http://en.cppreference.com/w/cpp/thread/once_flag.html',0,'std::once_flag'],['http://en.cppreference.com/w/cpp/thread/once_flag.html',0,'std::once_flag::once_flag()']]],
-  ['open_14',['open',['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::basic_ofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::fstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::basic_filebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::basic_fstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::wfilebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::wifstream::open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages_byname::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::filebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::ofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::basic_ifstream::open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::wfstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::wofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::ifstream::open()']]],
-  ['open_20addressing_15',['Open Addressing',['../d4/d39/group__open__addressing.html',1,'']]],
-  ['opening_16',['opening',['../dc/dc5/paranthesis__matching_8cpp.html#ade525d33459755a32ba21e1b6910ff21',1,'paranthesis_matching.cpp']]],
-  ['operations_20on_20datastructures_17',['Operations On Datastructures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61',1,'']]],
-  ['operations_5fon_5fdatastructures_18',['operations_on_datastructures',['../da/d6d/namespaceoperations__on__datastructures.html',1,'']]],
-  ['operator_20auto_5fptr_3c_20y_20_3e_19',['operator auto_ptr&lt; Y &gt;',['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator_auto_ptr.html',0,'std::auto_ptr']]],
-  ['operator_20bool_20',['operator bool',['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::fstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::fstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/operator_bool.html',0,'std::unique_lock::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ios::operator bool()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator_bool.html',0,'std::shared_ptr::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_fstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_fstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::iostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::iostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wistream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::stringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::stringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator_bool.html',0,'std::unique_ptr::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/operator_bool.html',0,'std::shared_lock::operator bool()'],['http://en.cppreference.com/w/cpp/error/error_code/operator_bool.html',0,'std::error_code::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_istream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::strstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::strstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_stringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_stringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istrstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator_bool.html',0,'std::function::operator bool()'],['http://en.cppreference.com/w/cpp/error/error_condition/operator_bool.html',0,'std::error_condition::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wiostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wiostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_istringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator_bool.html',0,'std::experimental::optional::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostrstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wfstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wfstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_iostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_iostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wstringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wstringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wistringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry::operator bool()'],['../db/d9a/classuint128__t.html#a6d45302022ef7f5195458f41b8aedb6e',1,'uint128_t::operator bool()'],['../d1/d83/classuint256__t.html#a28aa5786bbfce1b00398a8d38691bdaa',1,'uint256_t::operator bool()']]],
-  ['operator_20string_5ftype_21',['operator string_type',['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wcsub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wssub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::csub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::ssub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::sub_match::operator string_type()']]],
-  ['operator_20t_22',['operator T',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_T.html',0,'std::atomic::operator T()'],['../db/d9a/classuint128__t.html#a75767cb2b6fd47ecb1f721755fdc7639',1,'uint128_t::operator T()'],['../d1/d83/classuint256__t.html#a9e1b39a46ea16bc6587e25e294c6c363',1,'uint256_t::operator T()']]],
-  ['operator_20t_26_23',['operator T&amp;',['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/get.html',0,'std::reference_wrapper']]],
-  ['operator_20uint128_5ft_24',['operator uint128_t',['../d1/d83/classuint256__t.html#ad5bd38b2d3becca998457af1124d6e8b',1,'uint256_t']]],
-  ['operator_21_25',['operator!',['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::fstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ios::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_fstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::iostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wistream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::stringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wifstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_istream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::strstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_stringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istrstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wiostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_istringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ifstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostrstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wfstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_iostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wstringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wistringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ifstream::operator!()'],['../db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d',1,'uint128_t::operator!()'],['../d1/d83/classuint256__t.html#a028c585069fa53b74c153667ff66352c',1,'uint256_t::operator!()']]],
-  ['operator_21_3d_26',['operator!=',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::regex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::sregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wcregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::cregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/locale/locale/operator_cmp.html',0,'std::locale::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wsregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator!=()'],['http://en.cppreference.com/w/cpp/types/type_info/operator_cmp.html',0,'std::type_info::operator!=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_cmp.html',0,'std::bitset::operator!=()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::cregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wsregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wcregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::regex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::sregex_token_iterator::operator!=()'],['../db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e',1,'uint128_t::operator!=(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696',1,'uint128_t::operator!=(const T other)'],['../d1/d83/classuint256__t.html#aae68a7bd17c14a926fb77758b5c8e547',1,'uint256_t::operator!=(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#a89cf7fa466458ee08edd9a809d072bcb',1,'uint256_t::operator!=(const T &amp;other)'],['../db/d82/classlarge__number.html#a72ae1ef050c4c28c50952ecab22d4b94',1,'large_number::operator!='],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator!=()']]],
-  ['operator_25_27',['operator%',['../db/d9a/classuint128__t.html#abfc6a8765039cacc829a5cd386b5a066',1,'uint128_t::operator%(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#add9938b97fc66560cec2d32e8c83eaad',1,'uint128_t::operator%(const T &amp;p)'],['../d1/d83/classuint256__t.html#ad4928175eaaaa2b559bc945affe63ad2',1,'uint256_t::operator%(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#a7bd9693b88c4df08b1f8d1fd81c597cc',1,'uint256_t::operator%(const T &amp;p)']]],
-  ['operator_25_3d_28',['operator%=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator%=()'],['../db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2',1,'uint128_t::operator%=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40',1,'uint128_t::operator%=(const T &amp;p)'],['../d1/d83/classuint256__t.html#a2cd43a4a92dc825a010a17578b3bdedb',1,'uint256_t::operator%=(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#a76914bc727eab927a3941ef71275327d',1,'uint256_t::operator%=(const T &amp;p)']]],
-  ['operator_26_29',['operator&amp;',['../db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244',1,'uint128_t::operator&amp;(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4',1,'uint128_t::operator&amp;(const T p)'],['../d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8',1,'uint256_t::operator&amp;(const T &amp;p)'],['../d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839',1,'uint256_t::operator&amp;(const uint256_t &amp;p)']]],
-  ['operator_26_26_30',['operator&amp;&amp;',['../db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1',1,'uint128_t::operator&amp;&amp;(const uint128_t &amp;b)'],['../db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a',1,'uint128_t::operator&amp;&amp;(const T b)'],['../d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963',1,'uint256_t::operator&amp;&amp;(const uint256_t &amp;b)'],['../d1/d83/classuint256__t.html#a303287d7bc8686dcb47fcb04720ad409',1,'uint256_t::operator&amp;&amp;(const T &amp;b)']]],
-  ['operator_26_3d_31',['operator&amp;=',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator&amp;=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator&amp;=()'],['../db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050',1,'uint128_t::operator&amp;=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640',1,'uint128_t::operator&amp;=(const T p)'],['../d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d',1,'uint256_t::operator&amp;=(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#afa79020c27caea31236d04ecaa0e5ef5',1,'uint256_t::operator&amp;=(const T p)']]],
-  ['operator_28_29_32',['operator()',['http://en.cppreference.com/w/cpp/utility/functional/logical_and.html',0,'std::logical_and::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/modulus.html',0,'std::modulus::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/operator().html',0,'std::student_t_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mt19937_64::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::ranlux24_base::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/operator().html',0,'std::extreme_value_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/operator().html',0,'std::lognormal_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html',0,'std::greater_equal::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/operator().html',0,'std::discrete_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::ranlux48::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/operator().html',0,'std::piecewise_constant_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/less_equal.html',0,'std::less_equal::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/logical_or.html',0,'std::logical_or::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std::binary_negate::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::discard_block_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/operator().html',0,'std::exponential_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mersenne_twister_engine::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/negate.html',0,'std::negate::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/not_equal_to.html',0,'std::not_equal_to::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/operator().html',0,'std::independent_bits_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/operator().html',0,'std::normal_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::minstd_rand::operator()()'],['http://en.cppreference.com/w/cpp/locale/locale/operator().html',0,'std::locale::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/equal_to.html',0,'std::equal_to::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/divides.html',0,'std::divides::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/operator().html',0,'std::weibull_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/less.html',0,'std::less::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/multiplies.html',0,'std::multiplies::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/operator().html',0,'std::reference_wrapper::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::ranlux48_base::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_not.html',0,'std::bit_not::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mt19937::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/operator().html',0,'std::chi_squared_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/operator().html',0,'std::piecewise_linear_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/hash/operator().html',0,'std::hash::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/operator().html',0,'std::shuffle_order_engine::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/greater.html',0,'std::greater::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_and.html',0,'std::bit_and::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/operator().html',0,'std::uniform_int_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/operator().html',0,'std::fisher_f_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::ranlux24::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/plus.html',0,'std::plus::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_or.html',0,'std::bit_or::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator().html',0,'std::function::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/minus.html',0,'std::minus::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::linear_congruential_engine::operator()()'],['http://en.cppreference.com/w/cpp/memory/owner_less.html',0,'std::owner_less::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/operator().html',0,'std::knuth_b::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::minstd_rand0::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/logical_not.html',0,'std::logical_not::operator()()'],['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/operator().html',0,'std::gamma_distribution::operator()()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/operator().html',0,'std::packaged_task::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/operator().html',0,'std::cauchy_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::subtract_with_carry_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/operator().html',0,'std::random_device::operator()()'],['../db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733',1,'uint128_t::operator()()'],['../d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b',1,'uint256_t::operator()()'],['../de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c',1,'Compare::operator()()']]],
-  ['operator_2a_33',['operator*',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::regex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::sregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator*.html',0,'std::shared_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wcregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::cregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator*.html',0,'std::unique_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wsregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::cregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wsregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator*.html',0,'std::experimental::optional::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wcregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::regex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator*.html',0,'std::auto_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::sregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator*.html',0,'std::raw_storage_iterator::operator*()'],['../db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30',1,'uint128_t::operator*(const T p)'],['../db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860',1,'uint128_t::operator*(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616',1,'uint256_t::operator*(const T &amp;p)'],['../d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967',1,'uint256_t::operator*(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*(const Matrix&lt; Number &gt; &amp;other) const'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*(const Number other) const'],['../da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d',1,'Complex::operator*()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae2edd40354a1ca7aeaee3d1e3589e713',1,'operator*(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A, std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;B):&#160;ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a865e8d26a01962cc93aca66e71346f37',1,'operator*(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A, std::vector&lt; T &gt; const &amp;B):&#160;ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a207b3a99fd5974d3117e0b0ac0aad234',1,'operator*(float const scalar, std::vector&lt; T &gt; const &amp;A):&#160;ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a42535e20e97d85aa61271e0894cc0359',1,'operator*(std::vector&lt; T &gt; const &amp;A, float const scalar):&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a16f34574b7e0dd51bc3b3fda37446695',1,'machine_learning::operator*()']]],
-  ['operator_2a_3d_34',['operator*=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator*=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator*=()'],['../db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092',1,'uint128_t::operator*=(const T p)'],['../db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295',1,'uint128_t::operator*=(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028',1,'uint256_t::operator*=(const T &amp;p)'],['../d1/d83/classuint256__t.html#a4645040fe68ff01d83400f173fd2bb21',1,'uint256_t::operator*=(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*=()'],['../db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350',1,'large_number::operator*=()']]],
-  ['operator_2b_35',['operator+',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::minutes::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::seconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::duration::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::milliseconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::hours::operator+()'],['http://en.cppreference.com/w/cpp/chrono/time_point/operator_arith.html',0,'std::chrono::time_point::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::microseconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::nanoseconds::operator+()'],['../db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d',1,'uint128_t::operator+(const T p)'],['../db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606',1,'uint128_t::operator+(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f',1,'uint256_t::operator+(const T &amp;p)'],['../d1/d83/classuint256__t.html#af18e2e3d7ed635c4056062bc906fef75',1,'uint256_t::operator+(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211',1,'divide_and_conquer::strassens_multiplication::Matrix::operator+()'],['../da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c',1,'Complex::operator+()'],['../db/d82/classlarge__number.html#abbd52948bee1b16543f1dae19aa9dd46',1,'large_number::operator+'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a01e6c7bf2b09272578b9c5819ce0f36f',1,'operator+():&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a2466857dab977a49f117029835b3b6d2',1,'machine_learning::operator+()']]],
-  ['operator_2b_2b_36',['operator++',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::regex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::sregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wcregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::cregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wsregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator++()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::cregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wsregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wcregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::regex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::sregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator_arith.html',0,'std::raw_storage_iterator::operator++()'],['../db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e',1,'uint128_t::operator++()'],['../db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6',1,'uint128_t::operator++(int)'],['../d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9',1,'uint256_t::operator++()'],['../d1/d83/classuint256__t.html#a7bbe36e2ebd52df5efab118897b3050c',1,'uint256_t::operator++(int)'],['../db/d82/classlarge__number.html#a4757697b1f7584b69e779a72abc4ae2a',1,'large_number::operator++()'],['../db/d82/classlarge__number.html#a8d4364ee5a62964451d8cfee82649687',1,'large_number::operator++(int)']]],
-  ['operator_2b_2b_28int_29_37',['operator++(int)',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::regex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::sregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wcregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::cregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wsregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::cregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wsregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wcregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::regex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::sregex_token_iterator::operator++(int)()']]],
-  ['operator_2b_3d_38',['operator+=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator+=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator+=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator+=()'],['../db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004',1,'uint128_t::operator+=(const T p)'],['../db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb',1,'uint128_t::operator+=(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1',1,'uint256_t::operator+=(const T &amp;p)'],['../d1/d83/classuint256__t.html#ac75a46fe3625caf10e07db1eb75a1d6e',1,'uint256_t::operator+=(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae190115f8d4d31e47d7290e0b6871391',1,'divide_and_conquer::strassens_multiplication::Matrix::operator+=()'],['../db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf',1,'large_number::operator+=()']]],
-  ['operator_2d_39',['operator-',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::minutes::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::seconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::duration::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::milliseconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::hours::operator-()'],['http://en.cppreference.com/w/cpp/chrono/time_point/operator_arith.html',0,'std::chrono::time_point::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::microseconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::nanoseconds::operator-()'],['../db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec',1,'uint128_t::operator-(const T &amp;p)'],['../db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c',1,'uint128_t::operator-(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3',1,'uint128_t::operator-()'],['../d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4',1,'uint256_t::operator-(const T &amp;p)'],['../d1/d83/classuint256__t.html#ab909ef62a0c85121e7d743c016fb723d',1,'uint256_t::operator-(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#a406c951a07d8173685dbe384c6ab6a06',1,'uint256_t::operator-()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a678681c9f6266a8219bd6bee6972d70e',1,'divide_and_conquer::strassens_multiplication::Matrix::operator-()'],['../da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da',1,'Complex::operator-()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4a6a560dbdd0177633783b72db37dc19',1,'operator-():&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a0cc29566568e0383dd7d374068cbe6b3',1,'machine_learning::operator-()']]],
-  ['operator_2d_2d_40',['operator--',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator--()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator--()'],['../db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed',1,'uint128_t::operator--()'],['../db/d9a/classuint128__t.html#a2ecb71686e1c9ed0267124580c91c414',1,'uint128_t::operator--(int p)'],['../d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183',1,'uint256_t::operator--()'],['../d1/d83/classuint256__t.html#a28d26847f9b19a4f86c187791cb0db13',1,'uint256_t::operator--(int p)']]],
-  ['operator_2d_2d_28int_29_41',['operator--(int)',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator--(int)()']]],
-  ['operator_2d_3d_42',['operator-=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator-=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator-=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator-=()'],['../db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798',1,'uint128_t::operator-=(const T &amp;p)'],['../db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8',1,'uint128_t::operator-=(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7',1,'uint256_t::operator-=(const T p)'],['../d1/d83/classuint256__t.html#a5e84ed2a2f99cee81ede4a0107702a45',1,'uint256_t::operator-=(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a42c986fb57b74fe1b7c5953cb1922c3d',1,'divide_and_conquer::strassens_multiplication::Matrix::operator-=()']]],
-  ['operator_2d_3e_43',['operator-&gt;',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::regex_iterator::operator-&gt;()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::sregex_iterator::operator-&gt;()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator*.html',0,'std::shared_ptr::operator-&gt;()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wcregex_iterator::operator-&gt;()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::cregex_token_iterator::operator-&gt;()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator*.html',0,'std::unique_ptr::operator-&gt;()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wsregex_token_iterator::operator-&gt;()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::cregex_iterator::operator-&gt;()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wsregex_iterator::operator-&gt;()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator*.html',0,'std::experimental::optional::operator-&gt;()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wcregex_token_iterator::operator-&gt;()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::regex_token_iterator::operator-&gt;()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator*.html',0,'std::auto_ptr::operator-&gt;()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::sregex_token_iterator::operator-&gt;()']]],
-  ['operator_2f_44',['operator/',['../db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee',1,'uint128_t::operator/(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94',1,'uint128_t::operator/(const T p)'],['../d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6',1,'uint256_t::operator/(const T &amp;p)'],['../d1/d83/classuint256__t.html#a4fdeb4d4bf8cca4ee99b8487e59831df',1,'uint256_t::operator/(const uint256_t &amp;p)'],['../da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90',1,'Complex::operator/()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7a2d742b9a3ae7b85292e1f86428bb4f',1,'operator/():&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5',1,'machine_learning::operator/()']]],
-  ['operator_2f_3d_45',['operator/=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator/=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator/=()'],['../db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db',1,'uint128_t::operator/=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b',1,'uint128_t::operator/=(const T p)'],['../d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4',1,'uint256_t::operator/=(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#abc793979ec70bb8e5cf177d83649a259',1,'uint256_t::operator/=(const T &amp;p)']]],
-  ['operator_3c_46',['operator&lt;',['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator&lt;()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator&lt;()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator&lt;()'],['../db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4',1,'uint128_t::operator&lt;(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc',1,'uint128_t::operator&lt;(const T other)'],['../d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96',1,'uint256_t::operator&lt;(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#ac6bdcf64653af8173987bf7217e99056',1,'uint256_t::operator&lt;(const T &amp;other)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba',1,'machine_learning::aystar_search::EightPuzzle::operator&lt;()']]],
-  ['operator_3c_3c_47',['operator&lt;&lt;',['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ofstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::fstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wostream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ostringstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostringstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_fstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::iostream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::stringstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::strstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_stringstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_ltlt.html',0,'std::thread::id::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wostringstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ostream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wiostream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ofstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostrstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wfstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_iostream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wofstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wstringstream::operator&lt;&lt;()'],['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#af2142b27241b28f835e8ce78d7d6463c',1,'ciphers::elliptic_curve_key_exchange::Point::operator&lt;&lt;'],['../db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190',1,'uint128_t::operator&lt;&lt;(const T p)'],['../db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953',1,'uint128_t::operator&lt;&lt;'],['../d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5',1,'uint256_t::operator&lt;&lt;(const T &amp;p)'],['../d1/d83/classuint256__t.html#a91badfd31be84b12cbb6d85ebc04d13a',1,'uint256_t::operator&lt;&lt;'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a9517e162e2988f7db052296bd550a742',1,'machine_learning::aystar_search::EightPuzzle::operator&lt;&lt;'],['../d6/d30/classmachine__learning_1_1adaline.html#ae347040516e995c8fb8ca2e5c0496daa',1,'machine_learning::adaline::operator&lt;&lt;'],['../db/d82/classlarge__number.html#a13282908dfc4888392ed3d1fc6aae492',1,'large_number::operator&lt;&lt;'],['../d7/db9/hill__cipher_8cpp.html#a34bfcd756610834acac501f9eea1e2eb',1,'operator&lt;&lt;(std::ostream &amp;out, matrix&lt; T &gt; const &amp;v):&#160;hill_cipher.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4',1,'operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;v):&#160;ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ab1ad727903d7817c2758d25bcb52cbc8',1,'operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; T &gt; const &amp;v):&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7',1,'machine_learning::operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; std::valarray&lt; T &gt; &gt; const &amp;A)'],['../d8/d77/namespacemachine__learning.html#af4986b23760039711848155739c31b35',1,'machine_learning::operator&lt;&lt;(std::ostream &amp;out, const std::pair&lt; T, T &gt; &amp;A)'],['../d8/d77/namespacemachine__learning.html#a54bf1f3c43271a5fc93101f6ae2e6269',1,'machine_learning::operator&lt;&lt;(std::ostream &amp;out, const std::valarray&lt; T &gt; &amp;A)'],['../d5/d67/complex__numbers_8cpp.html#a44d5f25b573e870accdf26fd32b8484d',1,'operator&lt;&lt;(std::ostream &amp;os, const Complex &amp;num):&#160;complex_numbers.cpp'],['../dd/d65/lu__decompose_8cpp.html#a575c989afcc78e875031cd4273e62a3e',1,'operator&lt;&lt;(std::ostream &amp;out, matrix&lt; T &gt; const &amp;v):&#160;lu_decompose.cpp'],['../d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834',1,'qr_algorithm::operator&lt;&lt;(std::ostream &amp;out, std::valarray&lt; std::valarray&lt; T &gt; &gt; const &amp;v)'],['../d2/d3b/namespaceqr__algorithm.html#a257425cb2365359da51c6fe6741834d8',1,'qr_algorithm::operator&lt;&lt;(std::ostream &amp;out, std::valarray&lt; T &gt; const &amp;v)']]],
-  ['operator_3c_3c_3d_48',['operator&lt;&lt;=',['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator&lt;&lt;=()'],['../db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a',1,'uint128_t::operator&lt;&lt;=()'],['../d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5',1,'uint256_t::operator&lt;&lt;=()']]],
-  ['operator_3c_3d_49',['operator&lt;=',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator&lt;=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator&lt;=()'],['../db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a',1,'uint128_t::operator&lt;=(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c',1,'uint128_t::operator&lt;=(const T other)'],['../d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88',1,'uint256_t::operator&lt;=(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#a2029e9777f999bffef6004429b4f19f2',1,'uint256_t::operator&lt;=(const T &amp;other)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee',1,'machine_learning::aystar_search::EightPuzzle::operator&lt;=()'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator&lt;=()']]],
-  ['operator_3d_50',['operator=',['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::basic_ofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::fstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::regex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/container/vector/operator=.html',0,'std::vector::operator=()'],['http://en.cppreference.com/w/cpp/container/multiset/operator=.html',0,'std::multiset::operator=()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/operator=.html',0,'std::weak_ptr::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::string::operator=()'],['http://en.cppreference.com/w/cpp/container/set/operator=.html',0,'std::set::operator=()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/operator=.html',0,'std::unique_lock::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::basic_ostringstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::regex::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_map/operator=.html',0,'std::unordered_map::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::basic_regex::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::basic_filebuf::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::wstringbuf::operator=()'],['http://en.cppreference.com/w/cpp/utility/tuple/operator=.html',0,'std::tuple::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::sregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator=.html',0,'std::shared_ptr::operator=()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_alloc::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::ostringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::basic_fstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::stringbuf::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::wcregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::wregex::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::cregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::wfilebuf::operator=()'],['http://en.cppreference.com/w/cpp/container/stack/operator=.html',0,'std::stack::operator=()'],['http://en.cppreference.com/w/cpp/thread/shared_future/operator=.html',0,'std::shared_future::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::wstreambuf::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::stringstream::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/operator=.html',0,'std::unordered_multimap::operator=()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator=.html',0,'std::unique_ptr::operator=()'],['http://en.cppreference.com/w/cpp/container/forward_list/operator=.html',0,'std::forward_list::operator=()'],['http://en.cppreference.com/w/cpp/locale/locale/operator=.html',0,'std::locale::operator=()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/operator=.html',0,'std::shared_lock::operator=()'],['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/operator=.html',0,'std::enable_shared_from_this::operator=()'],['http://en.cppreference.com/w/cpp/thread/future/operator=.html',0,'std::future::operator=()'],['http://en.cppreference.com/w/cpp/utility/pair/operator=.html',0,'std::pair::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::wsregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/error/error_code/operator=.html',0,'std::error_code::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::wifstream::operator=()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/operator=.html',0,'std::reference_wrapper::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::minutes::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::seconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::duration::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::milliseconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::hours::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::microseconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::nanoseconds::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::basic_stringbuf::operator=()'],['http://en.cppreference.com/w/cpp/container/deque/operator=.html',0,'std::deque::operator=()'],['http://en.cppreference.com/w/cpp/thread/promise/operator=.html',0,'std::promise::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::basic_streambuf::operator=()'],['http://en.cppreference.com/w/cpp/container/queue/operator=.html',0,'std::queue::operator=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator=.html',0,'std::atomic::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::basic_stringstream::operator=()'],['http://en.cppreference.com/w/cpp/thread/thread/operator=.html',0,'std::thread::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::basic_string::operator=()'],['http://en.cppreference.com/w/cpp/container/priority_queue/operator=.html',0,'std::priority_queue::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::wostringstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::cregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::wstring::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/operator=.html',0,'std::unordered_multiset::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::wsregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator=.html',0,'std::function::operator=()'],['http://en.cppreference.com/w/cpp/error/error_condition/operator=.html',0,'std::error_condition::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::filebuf::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::u16string::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::u32string::operator=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator=.html',0,'std::complex::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::ofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::basic_istringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::basic_ifstream::operator=()'],['http://en.cppreference.com/w/cpp/container/list/operator=.html',0,'std::list::operator=()'],['http://en.cppreference.com/w/cpp/container/map/operator=.html',0,'std::map::operator=()'],['http://en.cppreference.com/w/cpp/error/exception/operator=.html',0,'std::exception::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::streambuf::operator=()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator=.html',0,'std::experimental::optional::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::wcregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::regex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::istringstream::operator=()'],['http://en.cppreference.com/w/cpp/error/nested_exception/operator=.html',0,'std::nested_exception::operator=()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator=.html',0,'std::auto_ptr::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::sregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/operator=.html',0,'std::packaged_task::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_set/operator=.html',0,'std::unordered_set::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::wfstream::operator=()'],['http://en.cppreference.com/w/cpp/container/multimap/operator=.html',0,'std::multimap::operator=()'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/operator=.html',0,'std::atomic_flag::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::wofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::wstringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::wistringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::ifstream::operator=()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator=.html',0,'std::raw_storage_iterator::operator=()'],['../db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544',1,'uint128_t::operator=(const T &amp;p)'],['../db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74',1,'uint128_t::operator=(const std::string &amp;p)'],['../db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5',1,'uint128_t::operator=(const uint128_t &amp;p)=default'],['../db/d9a/classuint128__t.html#a3c4a7e775a0820196fc08303bbeed44a',1,'uint128_t::operator=(uint128_t &amp;&amp;p)=default'],['../d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc',1,'uint256_t::operator=(const uint256_t &amp;p)=default'],['../d1/d83/classuint256__t.html#addff5645f6005e7b50a6ad0731e4f19c',1,'uint256_t::operator=(const T &amp;p)'],['../d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2',1,'uint256_t::operator=(const std::string &amp;p)'],['../d1/d83/classuint256__t.html#a6c5e025f901f6af4b748f98013350638',1,'uint256_t::operator=(uint256_t &amp;&amp;p)=default'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#adb04f732911fcfd30f7177b367c6af41',1,'data_structures::linked_list::list::operator=()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2',1,'machine_learning::aystar_search::EightPuzzle::operator=(const EightPuzzle &amp;A)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101',1,'machine_learning::aystar_search::EightPuzzle::operator=(EightPuzzle &amp;&amp;A) noexcept'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317',1,'machine_learning::aystar_search::AyStarSearch::Info::operator=(const Info &amp;A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3993dbca9c5b3ef9ac361dc7f62ce57',1,'machine_learning::aystar_search::AyStarSearch::Info::operator=(Info &amp;&amp;A) noexcept'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a080f5b1742832a03c1cbba596a48bd1a',1,'machine_learning::k_nearest_neighbors::Knn::operator=(const Knn &amp;model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#ac06986d5afddc767ddba4da738f75563',1,'machine_learning::k_nearest_neighbors::Knn::operator=(Knn &amp;&amp;)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ae077132526d2863e46aa77cb0f7d6aa2',1,'machine_learning::neural_network::layers::DenseLayer::operator=(const DenseLayer &amp;layer)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a19aaccad279b22dbbb6c55e5697b4114',1,'machine_learning::neural_network::layers::DenseLayer::operator=(DenseLayer &amp;&amp;)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58a9614e4c6d4ca672d3358e99a3404f',1,'machine_learning::neural_network::NeuralNetwork::operator=(const NeuralNetwork &amp;model)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2c49bfebf9b859d5ceb26035d3003601',1,'machine_learning::neural_network::NeuralNetwork::operator=(NeuralNetwork &amp;&amp;)=default'],['../da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac',1,'Complex::operator=()'],['../db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b',1,'large_number::operator=()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=(const CircularLinkedList &amp;other)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=(CircularLinkedList &amp;&amp;other) noexcept']]],
-  ['operator_3d_3d_51',['operator==',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::regex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::sregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wcregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::cregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/locale/locale/operator_cmp.html',0,'std::locale::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wsregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator==()'],['http://en.cppreference.com/w/cpp/types/type_info/operator_cmp.html',0,'std::type_info::operator==()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_cmp.html',0,'std::bitset::operator==()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::cregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wsregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wcregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::regex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::sregex_token_iterator::operator==()'],['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446',1,'ciphers::elliptic_curve_key_exchange::Point::operator==()'],['../db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e',1,'uint128_t::operator==(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896',1,'uint128_t::operator==(const T other)'],['../d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261',1,'uint256_t::operator==(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484',1,'uint256_t::operator==(const T &amp;other)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c',1,'divide_and_conquer::strassens_multiplication::Matrix::operator==()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915',1,'machine_learning::aystar_search::EightPuzzle::operator==()'],['../db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca',1,'large_number::operator=='],['../d5/d67/complex__numbers_8cpp.html#a5a73e9d4e68af8cedb95bd0864054b89',1,'operator==():&#160;complex_numbers.cpp']]],
-  ['operator_3e_52',['operator&gt;',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator&gt;()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator&gt;()'],['../db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440',1,'uint128_t::operator&gt;(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e',1,'uint128_t::operator&gt;(const T other)'],['../d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d',1,'uint256_t::operator&gt;(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#ad74d33215517459c2b33ace7a9c6bc13',1,'uint256_t::operator&gt;(const T &amp;other)'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator&gt;()']]],
-  ['operator_3e_3d_53',['operator&gt;=',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator&gt;=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator&gt;=()'],['../db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292',1,'uint128_t::operator&gt;=(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481',1,'uint128_t::operator&gt;=(const T other)'],['../d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad',1,'uint256_t::operator&gt;=(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#aff4d49cf84de64301b169ad974f00bad',1,'uint256_t::operator&gt;=(const T &amp;other)'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator&gt;=()']]],
-  ['operator_3e_3e_54',['operator&gt;&gt;',['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::fstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_fstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::iostream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wistream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::stringstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wifstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_istream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::strstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_stringstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istrstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wiostream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_istringstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_ifstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istringstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wfstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_iostream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wstringstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wistringstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::ifstream::operator&gt;&gt;()'],['../db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848',1,'uint128_t::operator&gt;&gt;()'],['../d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51',1,'uint256_t::operator&gt;&gt;()'],['../d7/d7c/classstatistics_1_1stats__computer1.html#a350bf6c429691d3578c4dfc6679a0797',1,'statistics::stats_computer1::operator&gt;&gt;'],['../d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a',1,'statistics::stats_computer2::operator&gt;&gt;']]],
-  ['operator_3e_3e_3d_55',['operator&gt;&gt;=',['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator&gt;&gt;=()'],['../db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9',1,'uint128_t::operator&gt;&gt;=()'],['../d1/d83/classuint256__t.html#ad9ce2370b1497efbcc426793048e1f78',1,'uint256_t::operator&gt;&gt;=()']]],
-  ['operator_5b_5d_56',['operator[]',['http://en.cppreference.com/w/cpp/container/dynarray/operator_at.html',0,'std::dynarray::operator[]()'],['http://en.cppreference.com/w/cpp/container/vector/operator_at.html',0,'std::vector::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::match_results::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::string::operator[]()'],['http://en.cppreference.com/w/cpp/container/unordered_map/operator_at.html',0,'std::unordered_map::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::wsmatch::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::smatch::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::wcmatch::operator[]()'],['http://en.cppreference.com/w/cpp/container/deque/operator_at.html',0,'std::deque::operator[]()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_at.html',0,'std::bitset::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::basic_string::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::wstring::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::u16string::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::u32string::operator[]()'],['http://en.cppreference.com/w/cpp/container/map/operator_at.html',0,'std::map::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::cmatch::operator[]()'],['http://en.cppreference.com/w/cpp/container/array/operator_at.html',0,'std::array::operator[]()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ac4c64e5723fa12a043fd0a7f5ed5bb37',1,'divide_and_conquer::strassens_multiplication::Matrix::operator[]()'],['../db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08',1,'large_number::operator[]()']]],
-  ['operator_5e_57',['operator^',['../db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37',1,'uint128_t::operator^(const T p)'],['../db/d9a/classuint128__t.html#a9487ed06019d846add5dc8874e41eb8b',1,'uint128_t::operator^(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e',1,'uint256_t::operator^(const T &amp;p)'],['../d1/d83/classuint256__t.html#a74d1e1dd8cd2b31e00813ed939943be7',1,'uint256_t::operator^(const uint256_t &amp;p)']]],
-  ['operator_5e_3d_58',['operator^=',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator^=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator^=()'],['../db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a',1,'uint128_t::operator^=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67',1,'uint128_t::operator^=(const T &amp;p)'],['../d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7',1,'uint256_t::operator^=(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#a3dc4d3ab175f5f2a3172eb8d99a60fc3',1,'uint256_t::operator^=(const T &amp;p)']]],
-  ['operator_7c_59',['operator|',['../db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304',1,'uint128_t::operator|(const T p)'],['../db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd',1,'uint128_t::operator|(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf',1,'uint256_t::operator|(const T &amp;p)'],['../d1/d83/classuint256__t.html#a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2',1,'uint256_t::operator|(const uint256_t &amp;p)']]],
-  ['operator_7c_3d_60',['operator|=',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator|=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator|=()'],['../db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d',1,'uint128_t::operator|=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee',1,'uint128_t::operator|=(const T p)'],['../d1/d83/classuint256__t.html#af0a6e09fcf1cbf234ed32df6d7265a0b',1,'uint256_t::operator|=(const T &amp;p)'],['../d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc',1,'uint256_t::operator|=(const uint256_t &amp;p)']]],
-  ['operator_7c_7c_61',['operator||',['../db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03',1,'uint128_t::operator||(const uint128_t &amp;b)'],['../db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503',1,'uint128_t::operator||(const T b)'],['../d1/d83/classuint256__t.html#a41f4bb928c4ee067732503395b65f9d7',1,'uint256_t::operator||(const uint256_t &amp;b)'],['../d1/d83/classuint256__t.html#a4886747ffff15cdeb6bc93712629f9e7',1,'uint256_t::operator||(const T &amp;b)']]],
-  ['operator_7e_62',['operator~',['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator~()'],['../db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f',1,'uint128_t::operator~()'],['../d1/d83/classuint256__t.html#a6eec1f632aebfc44fee8a74c395e10c2',1,'uint256_t::operator~()'],['../da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d',1,'Complex::operator~()']]],
-  ['optional_63',['optional',['http://en.cppreference.com/w/cpp/experimental/optional.html',0,'std::experimental::optional'],['http://en.cppreference.com/w/cpp/experimental/optional/optional.html',0,'std::experimental::optional::optional()']]],
-  ['ordinary_20differential_20equations_64',['Ordinary Differential Equations',['../d6/d60/group__ode.html',1,'']]],
-  ['ordinary_5fleast_5fsquares_5fregressor_2ecpp_65',['ordinary_least_squares_regressor.cpp',['../dc/d38/ordinary__least__squares__regressor_8cpp.html',1,'']]],
-  ['orientation_66',['orientation',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c',1,'geometry::jarvis::Convexhull']]],
-  ['ostream_67',['ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std::ostream'],['http://en.cppreference.com/w/cpp/io/basic_ostream/basic_ostream.html',0,'std::ostream::ostream()']]],
-  ['ostream_5fiterator_68',['ostream_iterator',['http://en.cppreference.com/w/cpp/iterator/ostream_iterator.html',0,'std']]],
-  ['ostreambuf_5fiterator_69',['ostreambuf_iterator',['http://en.cppreference.com/w/cpp/iterator/ostreambuf_iterator.html',0,'std']]],
-  ['ostringstream_70',['ostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std::ostringstream'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::ostringstream::ostringstream()']]],
-  ['ostrstream_71',['ostrstream',['http://en.cppreference.com/w/cpp/io/ostrstream.html',0,'std::ostrstream'],['http://en.cppreference.com/w/cpp/io/ostrstream/ostrstream.html',0,'std::ostrstream::ostrstream()']]],
-  ['otherhashfxn_72',['otherHashFxn',['../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082',1,'double_hashing']]],
-  ['others_73',['Others',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62',1,'']]],
-  ['others_74',['others',['../d0/d6f/namespaceothers.html',1,'']]],
-  ['others_3a_3acache_75',['Cache',['../db/dde/namespaceothers_1_1_cache.html',1,'others']]],
-  ['our_20pledge_76',['Our Pledge',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md5',1,'']]],
-  ['our_20standards_77',['Our Standards',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md6',1,'']]],
-  ['out_78',['out',['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_byname::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8_utf16::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf16::out()']]],
-  ['out_5fof_5frange_79',['out_of_range',['http://en.cppreference.com/w/cpp/error/out_of_range.html',0,'std::out_of_range'],['http://en.cppreference.com/w/cpp/error/out_of_range.html',0,'std::out_of_range::out_of_range()']]],
-  ['outer_5fallocator_80',['outer_allocator',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/outer_allocator.html',0,'std::scoped_allocator_adaptor']]],
-  ['output_5fiterator_5ftag_81',['output_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]],
-  ['overflow_82',['overflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_filebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wstringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::stringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wfilebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wstreambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::strstreambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_stringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_streambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::filebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::streambuf::overflow()']]],
-  ['overflow_5ferror_83',['overflow_error',['http://en.cppreference.com/w/cpp/error/overflow_error.html',0,'std::overflow_error'],['http://en.cppreference.com/w/cpp/error/overflow_error.html',0,'std::overflow_error::overflow_error()']]],
-  ['overview_84',['Overview',['../index.html#autotoc_md103',1,'']]],
-  ['owner_5fbefore_85',['owner_before',['http://en.cppreference.com/w/cpp/memory/weak_ptr/owner_before.html',0,'std::weak_ptr::owner_before()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/owner_before.html',0,'std::shared_ptr::owner_before()']]],
-  ['owner_5fless_86',['owner_less',['http://en.cppreference.com/w/cpp/memory/owner_less.html',0,'std']]],
-  ['owns_5flock_87',['owns_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/owns_lock.html',0,'std::unique_lock::owns_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/owns_lock.html',0,'std::shared_lock::owns_lock()']]]
+  ['ode_5fforward_5feuler_2ecpp_0',['ode_forward_euler.cpp',['../db/dd3/ode__forward__euler_8cpp.html',1,'']]],
+  ['ode_5fmidpoint_5feuler_2ecpp_1',['ode_midpoint_euler.cpp',['../d6/dd3/ode__midpoint__euler_8cpp.html',1,'']]],
+  ['ode_5fsemi_5fimplicit_5feuler_2ecpp_2',['ode_semi_implicit_euler.cpp',['../d3/d06/ode__semi__implicit__euler_8cpp.html',1,'']]],
+  ['of_20a_20program_3',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]],
+  ['of_20a_20tree_4',['of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]],
+  ['of_20conduct_5',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]],
+  ['of_20parent_20nodes_6',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
+  ['offset_7',['offset',['../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801',1,'range_queries::fenwick_tree']]],
+  ['ols_5ftest_8',['ols_test',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d',1,'ordinary_least_squares_regressor.cpp']]],
+  ['on_20datastructures_9',['Operations On Datastructures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61',1,'']]],
+  ['on_5fsegment_10',['on_segment',['../d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf',1,'SegmentIntersection']]],
+  ['open_20addressing_11',['Open Addressing',['../d4/d39/group__open__addressing.html',1,'']]],
+  ['opening_12',['opening',['../dc/dc5/paranthesis__matching_8cpp.html#ade525d33459755a32ba21e1b6910ff21',1,'paranthesis_matching.cpp']]],
+  ['operations_20on_20datastructures_13',['Operations On Datastructures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61',1,'']]],
+  ['operations_5fon_5fdatastructures_14',['operations_on_datastructures',['../da/d6d/namespaceoperations__on__datastructures.html',1,'']]],
+  ['operator_20bool_15',['operator bool',['../db/d9a/classuint128__t.html#a6d45302022ef7f5195458f41b8aedb6e',1,'uint128_t::operator bool()'],['../d1/d83/classuint256__t.html#a28aa5786bbfce1b00398a8d38691bdaa',1,'uint256_t::operator bool()']]],
+  ['operator_20t_16',['operator T',['../db/d9a/classuint128__t.html#a75767cb2b6fd47ecb1f721755fdc7639',1,'uint128_t::operator T()'],['../d1/d83/classuint256__t.html#a9e1b39a46ea16bc6587e25e294c6c363',1,'uint256_t::operator T() const']]],
+  ['operator_20uint128_5ft_17',['operator uint128_t',['../d1/d83/classuint256__t.html#ad5bd38b2d3becca998457af1124d6e8b',1,'uint256_t']]],
+  ['operator_21_18',['operator!',['../db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d',1,'uint128_t::operator!()'],['../d1/d83/classuint256__t.html#a028c585069fa53b74c153667ff66352c',1,'uint256_t::operator!()']]],
+  ['operator_21_3d_19',['operator!=',['../db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e',1,'uint128_t::operator!=(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696',1,'uint128_t::operator!=(const T other)'],['../d1/d83/classuint256__t.html#aae68a7bd17c14a926fb77758b5c8e547',1,'uint256_t::operator!=(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#a89cf7fa466458ee08edd9a809d072bcb',1,'uint256_t::operator!=(const T &amp;other)'],['../db/d82/classlarge__number.html#a72ae1ef050c4c28c50952ecab22d4b94',1,'large_number::operator!=']]],
+  ['operator_25_20',['operator%',['../db/d9a/classuint128__t.html#abfc6a8765039cacc829a5cd386b5a066',1,'uint128_t::operator%(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#add9938b97fc66560cec2d32e8c83eaad',1,'uint128_t::operator%(const T &amp;p)'],['../d1/d83/classuint256__t.html#ad4928175eaaaa2b559bc945affe63ad2',1,'uint256_t::operator%(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#a7bd9693b88c4df08b1f8d1fd81c597cc',1,'uint256_t::operator%(const T &amp;p)']]],
+  ['operator_25_3d_21',['operator%=',['../db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2',1,'uint128_t::operator%=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40',1,'uint128_t::operator%=(const T &amp;p)'],['../d1/d83/classuint256__t.html#a2cd43a4a92dc825a010a17578b3bdedb',1,'uint256_t::operator%=(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#a76914bc727eab927a3941ef71275327d',1,'uint256_t::operator%=(const T &amp;p)']]],
+  ['operator_26_22',['operator&amp;',['../db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244',1,'uint128_t::operator&amp;(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4',1,'uint128_t::operator&amp;(const T p)'],['../d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8',1,'uint256_t::operator&amp;(const T &amp;p)'],['../d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839',1,'uint256_t::operator&amp;(const uint256_t &amp;p)']]],
+  ['operator_26_26_23',['operator&amp;&amp;',['../db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1',1,'uint128_t::operator&amp;&amp;(const uint128_t &amp;b)'],['../db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a',1,'uint128_t::operator&amp;&amp;(const T b)'],['../d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963',1,'uint256_t::operator&amp;&amp;(const uint256_t &amp;b)'],['../d1/d83/classuint256__t.html#a303287d7bc8686dcb47fcb04720ad409',1,'uint256_t::operator&amp;&amp;(const T &amp;b)']]],
+  ['operator_26_3d_24',['operator&amp;=',['../db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050',1,'uint128_t::operator&amp;=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640',1,'uint128_t::operator&amp;=(const T p)'],['../d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d',1,'uint256_t::operator&amp;=(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#afa79020c27caea31236d04ecaa0e5ef5',1,'uint256_t::operator&amp;=(const T p)']]],
+  ['operator_28_29_25',['operator()',['../db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733',1,'uint128_t::operator()()'],['../d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b',1,'uint256_t::operator()()'],['../de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c',1,'Compare::operator()()']]],
+  ['operator_2a_26',['operator*',['../db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30',1,'uint128_t::operator*(const T p)'],['../db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860',1,'uint128_t::operator*(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616',1,'uint256_t::operator*(const T &amp;p)'],['../d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967',1,'uint256_t::operator*(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*(const Matrix&lt; Number &gt; &amp;other) const'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*(const Number other) const'],['../da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d',1,'Complex::operator*()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae2edd40354a1ca7aeaee3d1e3589e713',1,'operator*(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A, std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;B):&#160;ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a865e8d26a01962cc93aca66e71346f37',1,'operator*(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A, std::vector&lt; T &gt; const &amp;B):&#160;ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a207b3a99fd5974d3117e0b0ac0aad234',1,'operator*(float const scalar, std::vector&lt; T &gt; const &amp;A):&#160;ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a42535e20e97d85aa61271e0894cc0359',1,'operator*(std::vector&lt; T &gt; const &amp;A, float const scalar):&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a16f34574b7e0dd51bc3b3fda37446695',1,'machine_learning::operator*()']]],
+  ['operator_2a_3d_27',['operator*=',['../db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092',1,'uint128_t::operator*=(const T p)'],['../db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295',1,'uint128_t::operator*=(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028',1,'uint256_t::operator*=(const T &amp;p)'],['../d1/d83/classuint256__t.html#a4645040fe68ff01d83400f173fd2bb21',1,'uint256_t::operator*=(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*=()'],['../db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350',1,'large_number::operator*=()']]],
+  ['operator_2b_28',['operator+',['../db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d',1,'uint128_t::operator+(const T p)'],['../db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606',1,'uint128_t::operator+(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f',1,'uint256_t::operator+(const T &amp;p)'],['../d1/d83/classuint256__t.html#af18e2e3d7ed635c4056062bc906fef75',1,'uint256_t::operator+(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211',1,'divide_and_conquer::strassens_multiplication::Matrix::operator+()'],['../da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c',1,'Complex::operator+()'],['../db/d82/classlarge__number.html#abbd52948bee1b16543f1dae19aa9dd46',1,'large_number::operator+'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a01e6c7bf2b09272578b9c5819ce0f36f',1,'operator+():&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a2466857dab977a49f117029835b3b6d2',1,'machine_learning::operator+()']]],
+  ['operator_2b_2b_29',['operator++',['../db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e',1,'uint128_t::operator++()'],['../db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6',1,'uint128_t::operator++(int)'],['../d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9',1,'uint256_t::operator++()'],['../d1/d83/classuint256__t.html#a7bbe36e2ebd52df5efab118897b3050c',1,'uint256_t::operator++(int)'],['../db/d82/classlarge__number.html#a4757697b1f7584b69e779a72abc4ae2a',1,'large_number::operator++()'],['../db/d82/classlarge__number.html#a8d4364ee5a62964451d8cfee82649687',1,'large_number::operator++(int)']]],
+  ['operator_2b_3d_30',['operator+=',['../db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004',1,'uint128_t::operator+=(const T p)'],['../db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb',1,'uint128_t::operator+=(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1',1,'uint256_t::operator+=(const T &amp;p)'],['../d1/d83/classuint256__t.html#ac75a46fe3625caf10e07db1eb75a1d6e',1,'uint256_t::operator+=(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae190115f8d4d31e47d7290e0b6871391',1,'divide_and_conquer::strassens_multiplication::Matrix::operator+=()'],['../db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf',1,'large_number::operator+=()']]],
+  ['operator_2d_31',['operator-',['../db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec',1,'uint128_t::operator-(const T &amp;p)'],['../db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c',1,'uint128_t::operator-(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3',1,'uint128_t::operator-()'],['../d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4',1,'uint256_t::operator-(const T &amp;p)'],['../d1/d83/classuint256__t.html#ab909ef62a0c85121e7d743c016fb723d',1,'uint256_t::operator-(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#a406c951a07d8173685dbe384c6ab6a06',1,'uint256_t::operator-()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a678681c9f6266a8219bd6bee6972d70e',1,'divide_and_conquer::strassens_multiplication::Matrix::operator-()'],['../da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da',1,'Complex::operator-()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4a6a560dbdd0177633783b72db37dc19',1,'operator-():&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a0cc29566568e0383dd7d374068cbe6b3',1,'machine_learning::operator-()']]],
+  ['operator_2d_2d_32',['operator--',['../db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed',1,'uint128_t::operator--()'],['../db/d9a/classuint128__t.html#a2ecb71686e1c9ed0267124580c91c414',1,'uint128_t::operator--(int p)'],['../d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183',1,'uint256_t::operator--()'],['../d1/d83/classuint256__t.html#a28d26847f9b19a4f86c187791cb0db13',1,'uint256_t::operator--(int p)']]],
+  ['operator_2d_3d_33',['operator-=',['../db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798',1,'uint128_t::operator-=(const T &amp;p)'],['../db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8',1,'uint128_t::operator-=(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7',1,'uint256_t::operator-=(const T p)'],['../d1/d83/classuint256__t.html#a5e84ed2a2f99cee81ede4a0107702a45',1,'uint256_t::operator-=(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a42c986fb57b74fe1b7c5953cb1922c3d',1,'divide_and_conquer::strassens_multiplication::Matrix::operator-=()']]],
+  ['operator_2f_34',['operator/',['../db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee',1,'uint128_t::operator/(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94',1,'uint128_t::operator/(const T p)'],['../d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6',1,'uint256_t::operator/(const T &amp;p)'],['../d1/d83/classuint256__t.html#a4fdeb4d4bf8cca4ee99b8487e59831df',1,'uint256_t::operator/(const uint256_t &amp;p)'],['../da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90',1,'Complex::operator/()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7a2d742b9a3ae7b85292e1f86428bb4f',1,'operator/():&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5',1,'machine_learning::operator/()']]],
+  ['operator_2f_3d_35',['operator/=',['../db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db',1,'uint128_t::operator/=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b',1,'uint128_t::operator/=(const T p)'],['../d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4',1,'uint256_t::operator/=(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#abc793979ec70bb8e5cf177d83649a259',1,'uint256_t::operator/=(const T &amp;p)']]],
+  ['operator_3c_36',['operator&lt;',['../db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4',1,'uint128_t::operator&lt;(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc',1,'uint128_t::operator&lt;(const T other)'],['../d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96',1,'uint256_t::operator&lt;(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#ac6bdcf64653af8173987bf7217e99056',1,'uint256_t::operator&lt;(const T &amp;other)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba',1,'machine_learning::aystar_search::EightPuzzle::operator&lt;()']]],
+  ['operator_3c_3c_37',['operator&lt;&lt;',['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#af2142b27241b28f835e8ce78d7d6463c',1,'ciphers::elliptic_curve_key_exchange::Point::operator&lt;&lt;'],['../db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190',1,'uint128_t::operator&lt;&lt;(const T p)'],['../db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953',1,'uint128_t::operator&lt;&lt;'],['../d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5',1,'uint256_t::operator&lt;&lt;(const T &amp;p)'],['../d1/d83/classuint256__t.html#a91badfd31be84b12cbb6d85ebc04d13a',1,'uint256_t::operator&lt;&lt;'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a9517e162e2988f7db052296bd550a742',1,'machine_learning::aystar_search::EightPuzzle::operator&lt;&lt;'],['../d6/d30/classmachine__learning_1_1adaline.html#ae347040516e995c8fb8ca2e5c0496daa',1,'machine_learning::adaline::operator&lt;&lt;'],['../db/d82/classlarge__number.html#a13282908dfc4888392ed3d1fc6aae492',1,'large_number::operator&lt;&lt;'],['../d7/db9/hill__cipher_8cpp.html#a34bfcd756610834acac501f9eea1e2eb',1,'operator&lt;&lt;(std::ostream &amp;out, matrix&lt; T &gt; const &amp;v):&#160;hill_cipher.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4',1,'operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;v):&#160;ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ab1ad727903d7817c2758d25bcb52cbc8',1,'operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; T &gt; const &amp;v):&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7',1,'machine_learning::operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; std::valarray&lt; T &gt; &gt; const &amp;A)'],['../d8/d77/namespacemachine__learning.html#af4986b23760039711848155739c31b35',1,'machine_learning::operator&lt;&lt;(std::ostream &amp;out, const std::pair&lt; T, T &gt; &amp;A)'],['../d8/d77/namespacemachine__learning.html#a54bf1f3c43271a5fc93101f6ae2e6269',1,'machine_learning::operator&lt;&lt;(std::ostream &amp;out, const std::valarray&lt; T &gt; &amp;A)'],['../d5/d67/complex__numbers_8cpp.html#a44d5f25b573e870accdf26fd32b8484d',1,'operator&lt;&lt;(std::ostream &amp;os, const Complex &amp;num):&#160;complex_numbers.cpp'],['../dd/d65/lu__decompose_8cpp.html#a575c989afcc78e875031cd4273e62a3e',1,'operator&lt;&lt;(std::ostream &amp;out, matrix&lt; T &gt; const &amp;v):&#160;lu_decompose.cpp'],['../d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834',1,'qr_algorithm::operator&lt;&lt;(std::ostream &amp;out, std::valarray&lt; std::valarray&lt; T &gt; &gt; const &amp;v)'],['../d2/d3b/namespaceqr__algorithm.html#a257425cb2365359da51c6fe6741834d8',1,'qr_algorithm::operator&lt;&lt;(std::ostream &amp;out, std::valarray&lt; T &gt; const &amp;v)']]],
+  ['operator_3c_3c_3d_38',['operator&lt;&lt;=',['../db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a',1,'uint128_t::operator&lt;&lt;=()'],['../d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5',1,'uint256_t::operator&lt;&lt;=()']]],
+  ['operator_3c_3d_39',['operator&lt;=',['../db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a',1,'uint128_t::operator&lt;=(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c',1,'uint128_t::operator&lt;=(const T other)'],['../d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88',1,'uint256_t::operator&lt;=(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#a2029e9777f999bffef6004429b4f19f2',1,'uint256_t::operator&lt;=(const T &amp;other)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee',1,'machine_learning::aystar_search::EightPuzzle::operator&lt;=()']]],
+  ['operator_3d_40',['operator=',['../db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544',1,'uint128_t::operator=(const T &amp;p)'],['../db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74',1,'uint128_t::operator=(const std::string &amp;p)'],['../db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5',1,'uint128_t::operator=(const uint128_t &amp;p)=default'],['../db/d9a/classuint128__t.html#a3c4a7e775a0820196fc08303bbeed44a',1,'uint128_t::operator=(uint128_t &amp;&amp;p)=default'],['../d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc',1,'uint256_t::operator=(const uint256_t &amp;p)=default'],['../d1/d83/classuint256__t.html#addff5645f6005e7b50a6ad0731e4f19c',1,'uint256_t::operator=(const T &amp;p)'],['../d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2',1,'uint256_t::operator=(const std::string &amp;p)'],['../d1/d83/classuint256__t.html#a6c5e025f901f6af4b748f98013350638',1,'uint256_t::operator=(uint256_t &amp;&amp;p)=default'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#adb04f732911fcfd30f7177b367c6af41',1,'data_structures::linked_list::list::operator=()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2',1,'machine_learning::aystar_search::EightPuzzle::operator=(const EightPuzzle &amp;A)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101',1,'machine_learning::aystar_search::EightPuzzle::operator=(EightPuzzle &amp;&amp;A) noexcept'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317',1,'machine_learning::aystar_search::AyStarSearch::Info::operator=(const Info &amp;A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3993dbca9c5b3ef9ac361dc7f62ce57',1,'machine_learning::aystar_search::AyStarSearch::Info::operator=(Info &amp;&amp;A) noexcept'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a080f5b1742832a03c1cbba596a48bd1a',1,'machine_learning::k_nearest_neighbors::Knn::operator=(const Knn &amp;model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#ac06986d5afddc767ddba4da738f75563',1,'machine_learning::k_nearest_neighbors::Knn::operator=(Knn &amp;&amp;)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ae077132526d2863e46aa77cb0f7d6aa2',1,'machine_learning::neural_network::layers::DenseLayer::operator=(const DenseLayer &amp;layer)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a19aaccad279b22dbbb6c55e5697b4114',1,'machine_learning::neural_network::layers::DenseLayer::operator=(DenseLayer &amp;&amp;)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58a9614e4c6d4ca672d3358e99a3404f',1,'machine_learning::neural_network::NeuralNetwork::operator=(const NeuralNetwork &amp;model)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2c49bfebf9b859d5ceb26035d3003601',1,'machine_learning::neural_network::NeuralNetwork::operator=(NeuralNetwork &amp;&amp;)=default'],['../da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac',1,'Complex::operator=()'],['../db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b',1,'large_number::operator=()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=(const CircularLinkedList &amp;other)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=(CircularLinkedList &amp;&amp;other) noexcept']]],
+  ['operator_3d_3d_41',['operator==',['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446',1,'ciphers::elliptic_curve_key_exchange::Point::operator==()'],['../db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e',1,'uint128_t::operator==(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896',1,'uint128_t::operator==(const T other)'],['../d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261',1,'uint256_t::operator==(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484',1,'uint256_t::operator==(const T &amp;other)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c',1,'divide_and_conquer::strassens_multiplication::Matrix::operator==()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915',1,'machine_learning::aystar_search::EightPuzzle::operator==()'],['../db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca',1,'large_number::operator=='],['../d5/d67/complex__numbers_8cpp.html#a5a73e9d4e68af8cedb95bd0864054b89',1,'operator==():&#160;complex_numbers.cpp']]],
+  ['operator_3e_42',['operator&gt;',['../db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440',1,'uint128_t::operator&gt;(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e',1,'uint128_t::operator&gt;(const T other)'],['../d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d',1,'uint256_t::operator&gt;(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#ad74d33215517459c2b33ace7a9c6bc13',1,'uint256_t::operator&gt;(const T &amp;other)']]],
+  ['operator_3e_3d_43',['operator&gt;=',['../db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292',1,'uint128_t::operator&gt;=(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481',1,'uint128_t::operator&gt;=(const T other)'],['../d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad',1,'uint256_t::operator&gt;=(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#aff4d49cf84de64301b169ad974f00bad',1,'uint256_t::operator&gt;=(const T &amp;other)']]],
+  ['operator_3e_3e_44',['operator&gt;&gt;',['../db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848',1,'uint128_t::operator&gt;&gt;()'],['../d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51',1,'uint256_t::operator&gt;&gt;()'],['../d7/d7c/classstatistics_1_1stats__computer1.html#a350bf6c429691d3578c4dfc6679a0797',1,'statistics::stats_computer1::operator&gt;&gt;'],['../d8/dab/classstatistics_1_1stats__computer2.html#ab444d485c9e7db35bdc2ff6b7775291a',1,'statistics::stats_computer2::operator&gt;&gt;']]],
+  ['operator_3e_3e_3d_45',['operator&gt;&gt;=',['../db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9',1,'uint128_t::operator&gt;&gt;=()'],['../d1/d83/classuint256__t.html#ad9ce2370b1497efbcc426793048e1f78',1,'uint256_t::operator&gt;&gt;=()']]],
+  ['operator_5b_5d_46',['operator[]',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ac4c64e5723fa12a043fd0a7f5ed5bb37',1,'divide_and_conquer::strassens_multiplication::Matrix::operator[]()'],['../db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08',1,'large_number::operator[]()']]],
+  ['operator_5e_47',['operator^',['../db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37',1,'uint128_t::operator^(const T p)'],['../db/d9a/classuint128__t.html#a9487ed06019d846add5dc8874e41eb8b',1,'uint128_t::operator^(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e',1,'uint256_t::operator^(const T &amp;p)'],['../d1/d83/classuint256__t.html#a74d1e1dd8cd2b31e00813ed939943be7',1,'uint256_t::operator^(const uint256_t &amp;p)']]],
+  ['operator_5e_3d_48',['operator^=',['../db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a',1,'uint128_t::operator^=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67',1,'uint128_t::operator^=(const T &amp;p)'],['../d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7',1,'uint256_t::operator^=(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#a3dc4d3ab175f5f2a3172eb8d99a60fc3',1,'uint256_t::operator^=(const T &amp;p)']]],
+  ['operator_7c_49',['operator|',['../db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304',1,'uint128_t::operator|(const T p)'],['../db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd',1,'uint128_t::operator|(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf',1,'uint256_t::operator|(const T &amp;p)'],['../d1/d83/classuint256__t.html#a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2',1,'uint256_t::operator|(const uint256_t &amp;p)']]],
+  ['operator_7c_3d_50',['operator|=',['../db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d',1,'uint128_t::operator|=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee',1,'uint128_t::operator|=(const T p)'],['../d1/d83/classuint256__t.html#af0a6e09fcf1cbf234ed32df6d7265a0b',1,'uint256_t::operator|=(const T &amp;p)'],['../d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc',1,'uint256_t::operator|=(const uint256_t &amp;p)']]],
+  ['operator_7c_7c_51',['operator||',['../db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03',1,'uint128_t::operator||(const uint128_t &amp;b)'],['../db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503',1,'uint128_t::operator||(const T b)'],['../d1/d83/classuint256__t.html#a41f4bb928c4ee067732503395b65f9d7',1,'uint256_t::operator||(const uint256_t &amp;b)'],['../d1/d83/classuint256__t.html#a4886747ffff15cdeb6bc93712629f9e7',1,'uint256_t::operator||(const T &amp;b)']]],
+  ['operator_7e_52',['operator~',['../db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f',1,'uint128_t::operator~()'],['../d1/d83/classuint256__t.html#a6eec1f632aebfc44fee8a74c395e10c2',1,'uint256_t::operator~()'],['../da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d',1,'Complex::operator~()']]],
+  ['ordinary_20differential_20equations_53',['Ordinary Differential Equations',['../d6/d60/group__ode.html',1,'']]],
+  ['ordinary_5fleast_5fsquares_5fregressor_2ecpp_54',['ordinary_least_squares_regressor.cpp',['../dc/d38/ordinary__least__squares__regressor_8cpp.html',1,'']]],
+  ['orientation_55',['orientation',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c',1,'geometry::jarvis::Convexhull']]],
+  ['otherhashfxn_56',['otherHashFxn',['../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082',1,'double_hashing']]],
+  ['others_57',['Others',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md62',1,'']]],
+  ['others_58',['others',['../d0/d6f/namespaceothers.html',1,'']]],
+  ['others_3a_3acache_59',['Cache',['../db/dde/namespaceothers_1_1_cache.html',1,'others']]],
+  ['our_20pledge_60',['Our Pledge',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md5',1,'']]],
+  ['our_20standards_61',['Our Standards',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md6',1,'']]],
+  ['overview_62',['Overview',['../index.html#autotoc_md103',1,'']]]
 ];
diff --git a/search/all_15.js b/search/all_15.js
index 7ab171cce..7ab4886bd 100644
--- a/search/all_15.js
+++ b/search/all_15.js
@@ -1,172 +1,115 @@
 var searchData=
 [
-  ['p_0',['p',['../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb',1,'dsu::p'],['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3',1,'probability::geometric_dist::geometric_distribution::p'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/p.html',0,'std::bernoulli_distribution::p()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/p.html',0,'std::geometric_distribution::p()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/params.html',0,'std::negative_binomial_distribution::p()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/params.html',0,'std::binomial_distribution::p()']]],
-  ['packaged_5ftask_1',['packaged_task',['http://en.cppreference.com/w/cpp/thread/packaged_task.html',0,'std::packaged_task'],['http://en.cppreference.com/w/cpp/thread/packaged_task/packaged_task.html',0,'std::packaged_task::packaged_task()']]],
-  ['pagefault_2',['pageFault',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a09cbe562b0c396329607f5d388d57c9c',1,'others::lru_cache::LRUCache']]],
-  ['pageframe_3',['pageFrame',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a1aafd0444b410e0fcb66287e9954c893',1,'others::lru_cache::LRUCache']]],
-  ['pagemap_4',['pageMap',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa4d6db56109af196ffc7e5f72bc9907c',1,'others::lru_cache::LRUCache']]],
-  ['pair_5',['pair',['http://en.cppreference.com/w/cpp/utility/pair.html',0,'std::pair&lt; T1, T2 &gt;'],['http://en.cppreference.com/w/cpp/utility/pair/pair.html',0,'std::pair::pair()']]],
-  ['pair_3c_20int8_5ft_2c_20int8_5ft_20_3e_6',['pair&lt; int8_t, int8_t &gt;',['http://en.cppreference.com/w/cpp/utility/pair.html',0,'std']]],
-  ['pair_3c_20others_3a_3acache_3a_3ad_5fnode_3c_20k_2c_20v_20_3e_20_2a_2c_20int_20_3e_7',['pair&lt; others::Cache::D_Node&lt; K, V &gt; *, int &gt;',['http://en.cppreference.com/w/cpp/utility/pair.html',0,'std']]],
-  ['pair_3c_20others_3a_3acache_3a_3ad_5fnode_3c_20k_2c_20v_20_3e_20_2a_2c_20others_3a_3acache_3a_3ad_5fnode_3c_20k_2c_20v_20_3e_20_2a_20_3e_8',['pair&lt; others::Cache::D_Node&lt; K, V &gt; *, others::Cache::D_Node&lt; K, V &gt; * &gt;',['http://en.cppreference.com/w/cpp/utility/pair.html',0,'std']]],
-  ['pair_5fu_9',['pair_u',['../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b',1,'graph::HKGraph']]],
-  ['pair_5fv_10',['pair_v',['../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77',1,'graph::HKGraph']]],
-  ['pal_5fpart_11',['pal_part',['../d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a',1,'dynamic_programming::palindrome_partitioning']]],
-  ['palindrome_5fof_5fnumber_2ecpp_12',['palindrome_of_number.cpp',['../da/d9a/palindrome__of__number_8cpp.html',1,'']]],
-  ['palindrome_5fpartitioning_13',['palindrome_partitioning',['../d5/d89/namespacepalindrome__partitioning.html',1,'']]],
-  ['palindrome_5fpartitioning_2ecpp_14',['palindrome_partitioning.cpp',['../d5/d90/palindrome__partitioning_8cpp.html',1,'']]],
-  ['pancake_5fsort_15',['pancake_sort',['../df/d10/namespacepancake__sort.html',1,'']]],
-  ['pancake_5fsort_2ecpp_16',['pancake_sort.cpp',['../d3/d92/pancake__sort_8cpp.html',1,'']]],
-  ['pancakesort_17',['pancakeSort',['../d3/d92/pancake__sort_8cpp.html#abff90bc0f54e4f8ea5f0330471781bd5',1,'sorting::pancake_sort']]],
-  ['parallelogram_5farea_18',['parallelogram_area',['../dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f',1,'math']]],
-  ['parallelogram_5fperimeter_19',['parallelogram_perimeter',['../dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3',1,'math']]],
-  ['param_20',['param',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/param.html',0,'std::student_t_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/param.html',0,'std::extreme_value_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/param.html',0,'std::lognormal_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/param.html',0,'std::discrete_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/param.html',0,'std::piecewise_constant_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/param.html',0,'std::poisson_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/param.html',0,'std::bernoulli_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/param.html',0,'std::exponential_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/param.html',0,'std::uniform_real_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/param.html',0,'std::geometric_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/param.html',0,'std::normal_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/param.html',0,'std::weibull_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/param.html',0,'std::negative_binomial_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/param.html',0,'std::chi_squared_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/param.html',0,'std::piecewise_linear_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/param.html',0,'std::uniform_int_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/param.html',0,'std::fisher_f_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/param.html',0,'std::seed_seq::param()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/param.html',0,'std::gamma_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/param.html',0,'std::binomial_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/param.html',0,'std::cauchy_distribution::param()']]],
-  ['paranthesis_5fmatching_2ecpp_21',['paranthesis_matching.cpp',['../dc/dc5/paranthesis__matching_8cpp.html',1,'']]],
-  ['parent_22',['parent',['../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43',1,'graph::RootedTree']]],
-  ['parent_20nodes_23',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
-  ['parent_20pointer_20store_20the_20address_20of_20parent_20nodes_24',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
-  ['partial_5fsort_25',['partial_sort',['http://en.cppreference.com/w/cpp/algorithm/partial_sort.html',0,'std']]],
-  ['partial_5fsort_5fcopy_26',['partial_sort_copy',['http://en.cppreference.com/w/cpp/algorithm/partial_sort_copy.html',0,'std']]],
-  ['partial_5fsum_27',['partial_sum',['http://en.cppreference.com/w/cpp/algorithm/partial_sum.html',0,'std']]],
-  ['partition_28',['partition',['http://en.cppreference.com/w/cpp/algorithm/partition.html',0,'std::partition()'],['../d1/d21/quick__sort_8cpp.html#a1b2a2cc2d319240f3b65c5b2f479ed82',1,'sorting::quick_sort::partition()'],['../d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34',1,'sorting::partition()'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a3d1c39e1ff42c04fb8ec0c0b9411cd3e',1,'sorting::random_pivot_quick_sort::partition()']]],
-  ['partition_5fcopy_29',['partition_copy',['http://en.cppreference.com/w/cpp/algorithm/partition_copy.html',0,'std']]],
-  ['partition_5fpoint_30',['partition_point',['http://en.cppreference.com/w/cpp/algorithm/partition_point.html',0,'std']]],
-  ['pascal_5ftriangle_31',['pascal_triangle',['../dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd',1,'pascal_triangle.cpp']]],
-  ['pascal_5ftriangle_2ecpp_32',['pascal_triangle.cpp',['../dc/d1a/pascal__triangle_8cpp.html',1,'']]],
-  ['pat_5ftest_33',['pat_test',['../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2',1,'boyer_moore.cpp']]],
-  ['paths_34',['Augmenting paths',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md80',1,'']]],
-  ['pattern_35',['pattern',['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_base::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_get::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_put::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::moneypunct::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::moneypunct_byname::pattern'],['../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html',1,'strings::boyer_moore::pattern']]],
-  ['pb_36',['pb',['../d7/d35/matrix__exponentiation_8cpp.html#a276c5a0e984cf60015b27252fe04fe6b',1,'matrix_exponentiation.cpp']]],
-  ['pbackfail_37',['pbackfail',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_filebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wstringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::stringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wfilebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wstreambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::strstreambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_stringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_streambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::filebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::streambuf::pbackfail()']]],
-  ['pbase_38',['pbase',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::pbase()']]],
-  ['pbump_39',['pbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_filebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wstringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::stringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wfilebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wstreambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::strstreambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_stringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_streambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::filebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::streambuf::pbump()']]],
-  ['pcount_40',['pcount',['http://en.cppreference.com/w/cpp/io/strstreambuf/pcount.html',0,'std::strstreambuf::pcount()'],['http://en.cppreference.com/w/cpp/io/strstream/pcount.html',0,'std::strstream::pcount()'],['http://en.cppreference.com/w/cpp/io/ostrstream/pcount.html',0,'std::ostrstream::pcount()']]],
-  ['peek_41',['peek',['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::fstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_fstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::iostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wistream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::stringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wifstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_istream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::strstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_stringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istrstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wiostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_istringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_ifstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wfstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_iostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wstringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wistringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::ifstream::peek()']]],
-  ['perimeter_2ecpp_42',['perimeter.cpp',['../d3/dfe/perimeter_8cpp.html',1,'']]],
-  ['permanent_20ban_43',['4. Permanent Ban',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md14',1,'']]],
-  ['perror_44',['perror',['http://en.cppreference.com/w/cpp/io/c/perror.html',0,'std']]],
-  ['persegtree_45',['perSegTree',['../d8/d28/classrange__queries_1_1per_seg_tree.html',1,'range_queries']]],
-  ['persistent_5fseg_5ftree_5flazy_5fprop_2ecpp_46',['persistent_seg_tree_lazy_prop.cpp',['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html',1,'']]],
-  ['peta_47',['peta',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['phifunction_48',['phiFunction',['../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5',1,'math']]],
-  ['physics_49',['Physics',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63',1,'']]],
-  ['physics_50',['physics',['../d5/dd0/namespacephysics.html',1,'']]],
-  ['pico_51',['pico',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['piecewise_5fconstant_5fdistribution_52',['piecewise_constant_distribution',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution.html',0,'std::piecewise_constant_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/piecewise_constant_distribution.html',0,'std::piecewise_constant_distribution::piecewise_constant_distribution()']]],
-  ['piecewise_5fconstruct_5ft_53',['piecewise_construct_t',['http://en.cppreference.com/w/cpp/utility/piecewise_construct_t.html',0,'std']]],
-  ['piecewise_5flinear_5fdistribution_54',['piecewise_linear_distribution',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution.html',0,'std::piecewise_linear_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/piecewise_linear_distribution.html',0,'std::piecewise_linear_distribution::piecewise_linear_distribution()']]],
-  ['pigeonhole_5fsort_2ecpp_55',['pigeonhole_sort.cpp',['../dd/da8/pigeonhole__sort_8cpp.html',1,'']]],
-  ['pigeonsort_56',['pigeonSort',['../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3',1,'sorting']]],
-  ['placeholders_57',['placeholders',['http://en.cppreference.com/w/cpp/utility/functional/placeholders.html',0,'std']]],
-  ['pledge_58',['Our Pledge',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md5',1,'']]],
-  ['plus_59',['plus',['http://en.cppreference.com/w/cpp/utility/functional/plus.html',0,'std']]],
-  ['point_60',['Point',['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html',1,'ciphers::elliptic_curve_key_exchange::Point'],['../d7/d48/structgeometry_1_1grahamscan_1_1_point.html',1,'geometry::grahamscan::Point'],['../d9/d5a/structgeometry_1_1jarvis_1_1_point.html',1,'geometry::jarvis::Point'],['../d8/dc8/struct_point.html',1,'Point'],['../d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a',1,'Point::Point()'],['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#af0a6e3521629c25c2b5d620f26429830',1,'ciphers::elliptic_curve_key_exchange::Point'],['../dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85',1,'math::Point']]],
-  ['pointer_20store_20the_20address_20of_20parent_20nodes_61',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
-  ['pointer_5fsafety_62',['pointer_safety',['http://en.cppreference.com/w/cpp/memory/gc/pointer_safety.html',0,'std']]],
-  ['pointer_5fto_63',['pointer_to',['http://en.cppreference.com/w/cpp/memory/pointer_traits/pointer_to.html',0,'std::pointer_traits']]],
-  ['pointer_5ftraits_64',['pointer_traits',['http://en.cppreference.com/w/cpp/memory/pointer_traits.html',0,'std']]],
-  ['pointincircle_65',['PointInCircle',['../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad',1,'smallest_circle.cpp']]],
-  ['poisson_5fdist_2ecpp_66',['poisson_dist.cpp',['../d9/d24/poisson__dist_8cpp.html',1,'']]],
-  ['poisson_5fdistribution_67',['poisson_distribution',['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution.html',0,'std::poisson_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/poisson_distribution.html',0,'std::poisson_distribution::poisson_distribution()']]],
-  ['poisson_5fexpected_68',['poisson_expected',['../d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71',1,'poisson_dist.cpp']]],
-  ['poisson_5frange_5fsuccesses_69',['poisson_range_successes',['../d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a',1,'poisson_dist.cpp']]],
-  ['poisson_5frate_70',['poisson_rate',['../d9/d24/poisson__dist_8cpp.html#ac217ab9a06291f360d816700a6958ca8',1,'poisson_dist.cpp']]],
-  ['poisson_5fx_5fsuccesses_71',['poisson_x_successes',['../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1',1,'poisson_dist.cpp']]],
-  ['poly_5ffunction_72',['poly_function',['../da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569',1,'durand_kerner_roots.cpp']]],
-  ['pop_73',['pop',['http://en.cppreference.com/w/cpp/container/stack/pop.html',0,'std::stack::pop()'],['http://en.cppreference.com/w/cpp/container/queue/pop.html',0,'std::queue::pop()'],['http://en.cppreference.com/w/cpp/container/priority_queue/pop.html',0,'std::priority_queue::pop()'],['../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0',1,'stack::pop()'],['../d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b',1,'data_structures::Stack::pop()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb',1,'data_structures::stack_using_queue::Stack::pop()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69',1,'others::Cache::LFUCache::pop()'],['../dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664',1,'pop():&#160;paranthesis_matching.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#a421baa2002a64bc0bfc3e1b64800d734',1,'others::postfix_expression::pop()']]],
-  ['pop_5fback_74',['pop_back',['http://en.cppreference.com/w/cpp/container/vector/pop_back.html',0,'std::vector::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::string::pop_back()'],['http://en.cppreference.com/w/cpp/container/deque/pop_back.html',0,'std::deque::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::basic_string::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::wstring::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::u16string::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::u32string::pop_back()'],['http://en.cppreference.com/w/cpp/container/list/pop_back.html',0,'std::list::pop_back()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7',1,'others::Cache::LRUCache::pop_back()'],['../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d',1,'machine_learning::pop_back()']]],
-  ['pop_5ffront_75',['pop_front',['http://en.cppreference.com/w/cpp/container/forward_list/pop_front.html',0,'std::forward_list::pop_front()'],['http://en.cppreference.com/w/cpp/container/deque/pop_front.html',0,'std::deque::pop_front()'],['http://en.cppreference.com/w/cpp/container/list/pop_front.html',0,'std::list::pop_front()'],['../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093',1,'machine_learning::pop_front()']]],
-  ['pop_5fheap_76',['pop_heap',['http://en.cppreference.com/w/cpp/algorithm/pop_heap.html',0,'std']]],
-  ['populate_5fparents_77',['populate_parents',['../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e',1,'graph::RootedTree']]],
-  ['populate_5fup_78',['populate_up',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356',1,'graph::LowestCommonAncestor']]],
-  ['pos_5fformat_79',['pos_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::pos_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::pos_format()']]],
-  ['position_80',['position',['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::match_results::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::wsmatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::smatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::wcmatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::cmatch::position()']]],
-  ['positive_5fsign_81',['positive_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::positive_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::positive_sign()']]],
-  ['postfix_5fevaluation_82',['postfix_evaluation',['../d7/d75/postfix__evaluation_8cpp.html#ae38bd3a177a6d61da3859a281233bbe1',1,'others::postfix_expression']]],
-  ['postfix_5fevaluation_2ecpp_83',['postfix_evaluation.cpp',['../d7/d75/postfix__evaluation_8cpp.html',1,'']]],
-  ['postfix_5fexpression_84',['postfix_expression',['../d4/de6/namespacepostfix__expression.html',1,'']]],
-  ['postorder_85',['postorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c',1,'others::recursive_tree_traversals::BT']]],
-  ['postorder_20traversal_20of_20a_20tree_86',['Postorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree']]],
-  ['postorderiterative_87',['postOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25',1,'others::iterative_tree_traversals::BinaryTree']]],
-  ['pow_88',['pow',['http://en.cppreference.com/w/cpp/numeric/math/pow.html',0,'std']]],
-  ['power_89',['power',['../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311',1,'math::fibonacci_sum::power()'],['../df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179',1,'math::modular_division::power()'],['../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d',1,'math::power()'],['../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f',1,'power(int x, int n):&#160;power_for_huge_numbers.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec',1,'power(const vector&lt; vector&lt; ll &gt; &gt; &amp;A, ll p):&#160;matrix_exponentiation.cpp']]],
-  ['power_5ffor_5fhuge_5fnumbers_2ecpp_90',['power_for_huge_numbers.cpp',['../df/def/power__for__huge__numbers_8cpp.html',1,'']]],
-  ['power_5fof_5f2_2ecpp_91',['power_of_2.cpp',['../dc/d6d/power__of__2_8cpp.html',1,'']]],
-  ['power_5fof_5ftwo_92',['power_of_two',['../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb',1,'math']]],
-  ['power_5fof_5ftwo_2ecpp_93',['power_of_two.cpp',['../d4/d38/power__of__two_8cpp.html',1,'']]],
-  ['pptr_94',['pptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::pptr()']]],
-  ['precision_95',['precision',['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::fstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ios::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_fstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::iostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ios_base::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wistream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::stringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wifstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_istream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::strstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_stringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istrstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wiostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_istringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ifstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostrstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wfstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_iostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wstringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wistringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ifstream::precision()']]],
-  ['predict_96',['predict',['../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3',1,'machine_learning::adaline::predict()'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a62e152db014cd4de675fa906e5ef2861',1,'machine_learning::k_nearest_neighbors::Knn::predict()']]],
-  ['predict_5fols_5fregressor_97',['predict_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493',1,'ordinary_least_squares_regressor.cpp']]],
-  ['predict_5fwords_98',['predict_words',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4',1,'data_structures::trie_using_hashmap::Trie']]],
-  ['prefix_99',['prefix',['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::match_results::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wsmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::smatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wcmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::cmatch::prefix()']]],
-  ['prefix_5fsum_5farray_100',['prefix_sum_array',['../d7/d88/namespaceprefix__sum__array.html',1,'']]],
-  ['prefix_5fsum_5farray_2ecpp_101',['prefix_sum_array.cpp',['../d1/d9e/prefix__sum__array_8cpp.html',1,'']]],
-  ['preorder_102',['preorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5',1,'others::recursive_tree_traversals::BT']]],
-  ['preorder_20traversal_20of_20a_20tree_103',['Preorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]],
-  ['preorderiterative_104',['preOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae',1,'others::iterative_tree_traversals::BinaryTree']]],
-  ['prev_105',['prev',['../de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5',1,'others::Cache::D_Node::prev'],['http://en.cppreference.com/w/cpp/iterator/prev.html',0,'std::prev(T... args)']]],
-  ['prev_5fpermutation_106',['prev_permutation',['http://en.cppreference.com/w/cpp/algorithm/prev_permutation.html',0,'std']]],
-  ['primality_5ftest_2ecpp_107',['primality_test.cpp',['../da/d7b/primality__test_8cpp.html',1,'']]],
-  ['prime_108',['PRIME',['../d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8',1,'rabin_karp.cpp']]],
-  ['prime_109',['prime',['../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95',1,'primes_up_to_billion.cpp']]],
-  ['prime_20factorization_110',['Prime factorization',['../d7/d7f/section.html',1,'']]],
-  ['prime_5ffactorization_111',['prime_factorization',['../db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46',1,'prime_factorization.cpp']]],
-  ['prime_5ffactorization_2ecpp_112',['prime_factorization.cpp',['../db/d0d/prime__factorization_8cpp.html',1,'']]],
-  ['prime_5fnumbers_113',['prime_numbers',['../db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe',1,'prime_factorization.cpp']]],
-  ['prime_5fnumbers_2ecpp_114',['prime_numbers.cpp',['../de/d9b/prime__numbers_8cpp.html',1,'']]],
-  ['primes_115',['primes',['../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a',1,'prime_numbers.cpp']]],
-  ['primes_5fup_5fto_5fbillion_2ecpp_116',['primes_up_to_billion.cpp',['../d4/d9c/primes__up__to__billion_8cpp.html',1,'']]],
-  ['print_117',['Print',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165',1,'data_structures::tree_234::Tree234']]],
-  ['print_118',['print',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::print()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a424b17ddc672b25fe0bd9dc8612fba21',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::print(Node *root)'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::print()'],['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8',1,'greedy_algorithms::dijkstra::print()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a55bc4a221e584d33b79b322432ecc0f3',1,'math::sieve_of_eratosthenes::print()'],['../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20',1,'operations_on_datastructures::print()']]],
-  ['print_5fprimes_119',['print_primes',['../dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4',1,'math']]],
-  ['print_5ftable_120',['print_table',['../d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280',1,'games::memory_game']]],
-  ['printarray_121',['printArray',['../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767',1,'heap_sort.cpp']]],
-  ['printf_122',['printf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]],
-  ['printinorder_123',['printInorder',['../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
-  ['printlinkedlist_124',['printLinkedList',['../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2',1,'search::sublist_search']]],
-  ['printmat_125',['printMat',['../d3/d05/sudoku__solver_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac',1,'backtracking::sudoku_solver']]],
-  ['printnode_126',['PrintNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be',1,'data_structures::tree_234::Tree234']]],
-  ['printresult_127',['printResult',['../dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793',1,'FCFS']]],
-  ['printroot_128',['printRoot',['../dd/d29/false__position_8cpp.html#a85cb7bfb90abc898e042d624372c5345',1,'numerical_methods::false_position']]],
-  ['printsol_129',['PrintSol',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905',1,'backtracking::n_queens_optimized::PrintSol()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aebd5e11fab6dab282efccfb61beb0bd9',1,'backtracking::n_queens_all_solutions::PrintSol()']]],
-  ['printsolution_130',['printSolution',['../d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07',1,'backtracking::graph_coloring::printSolution()'],['../d4/d3e/n__queens_8cpp.html#a40ae0c7fd04eb20e7f3bff13fc6a5808',1,'backtracking::n_queens::printSolution()']]],
-  ['priority_131',['priority',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723',1,'data_structures::treap::Treap']]],
-  ['priority_5fqueue_132',['priority_queue',['http://en.cppreference.com/w/cpp/container/priority_queue.html',0,'std::priority_queue&lt; T &gt;'],['http://en.cppreference.com/w/cpp/container/priority_queue/priority_queue.html',0,'std::priority_queue::priority_queue()']]],
-  ['priority_5fqueue_3c_20std_3a_3atuple_3c_20s_2c_20t_2c_20e_2c_20double_2c_20double_2c_20double_20_3e_2c_20std_3a_3avector_3c_20std_3a_3atuple_3c_20s_2c_20t_2c_20e_2c_20double_2c_20double_2c_20double_20_3e_20_3e_2c_20compare_3c_20s_2c_20t_2c_20e_20_3e_20_3e_133',['priority_queue&lt; std::tuple&lt; S, T, E, double, double, double &gt;, std::vector&lt; std::tuple&lt; S, T, E, double, double, double &gt; &gt;, Compare&lt; S, T, E &gt; &gt;',['http://en.cppreference.com/w/cpp/container/priority_queue.html',0,'std']]],
-  ['probabilities_134',['probabilities',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/probabilities.html',0,'std::discrete_distribution']]],
-  ['probability_135',['PROBABILITY',['../d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61',1,'data_structures']]],
-  ['probability_136',['Probability',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64',1,'']]],
-  ['probability_137',['probability',['../d4/ded/namespaceprobability.html',1,'']]],
-  ['probability_5fdensity_138',['probability_density',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1',1,'probability::geometric_dist::geometric_distribution']]],
-  ['problem_139',['problem',['../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy):&#160;ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy):&#160;ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy):&#160;ode_semi_implicit_euler.cpp']]],
-  ['program_140',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]],
-  ['programming_141',['Dynamic Programming',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51',1,'']]],
-  ['projection_142',['projection',['../d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc',1,'numerical_methods::gram_schmidt']]],
-  ['promise_143',['promise',['http://en.cppreference.com/w/cpp/thread/promise.html',0,'std::promise'],['http://en.cppreference.com/w/cpp/thread/promise/promise.html',0,'std::promise::promise()']]],
-  ['psucc_144',['psucc',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af94c06f3220e5406245680f58b8e7081',1,'data_structures::linked_list::link']]],
-  ['ptrdiff_5ft_145',['ptrdiff_t',['http://en.cppreference.com/w/cpp/types/ptrdiff_t.html',0,'std']]],
-  ['ptrs_146',['ptrs',['../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5',1,'range_queries::perSegTree']]],
-  ['pubimbue_147',['pubimbue',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_filebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::stringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wfilebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstreambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::strstreambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_stringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_streambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::filebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::streambuf::pubimbue()']]],
-  ['pubseekoff_148',['pubseekoff',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_filebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::stringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wfilebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstreambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::strstreambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_stringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_streambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::filebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::streambuf::pubseekoff()']]],
-  ['pubseekpos_149',['pubseekpos',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_filebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::stringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wfilebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstreambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::strstreambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_stringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_streambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::filebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::streambuf::pubseekpos()']]],
-  ['pubsetbuf_150',['pubsetbuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_filebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::stringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wfilebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstreambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::strstreambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_stringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_streambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::filebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::streambuf::pubsetbuf()']]],
-  ['pubsync_151',['pubsync',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_filebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::stringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wfilebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstreambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::strstreambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_stringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_streambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::filebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::streambuf::pubsync()']]],
-  ['pull_20requests_152',['Pull Requests',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36',1,'']]],
-  ['push_153',['push',['http://en.cppreference.com/w/cpp/container/stack/push.html',0,'std::stack::push()'],['http://en.cppreference.com/w/cpp/container/queue/push.html',0,'std::queue::push()'],['http://en.cppreference.com/w/cpp/container/priority_queue/push.html',0,'std::priority_queue::push()'],['../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d',1,'stack::push()'],['../d2/dc8/classdata__structures_1_1_stack.html#aa9f9b087e9e7c00628e1289f0f1de3b2',1,'data_structures::Stack::push()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2',1,'data_structures::stack_using_queue::Stack::push()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047',1,'others::Cache::LFUCache::push()'],['../dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095',1,'push():&#160;paranthesis_matching.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea',1,'others::postfix_expression::push()']]],
-  ['push_5fback_154',['push_back',['http://en.cppreference.com/w/cpp/container/vector/push_back.html',0,'std::vector::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::string::push_back()'],['http://en.cppreference.com/w/cpp/container/deque/push_back.html',0,'std::deque::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::basic_string::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::wstring::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::u16string::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::u32string::push_back()'],['http://en.cppreference.com/w/cpp/container/list/push_back.html',0,'std::list::push_back()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a6e9859d1a0755fb51e41904d20c95496',1,'data_structures::linked_list::list::push_back()']]],
-  ['push_5ffront_155',['push_front',['http://en.cppreference.com/w/cpp/container/forward_list/push_front.html',0,'std::forward_list::push_front()'],['http://en.cppreference.com/w/cpp/container/deque/push_front.html',0,'std::deque::push_front()'],['http://en.cppreference.com/w/cpp/container/list/push_front.html',0,'std::list::push_front()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a332b965afd9d6bea8d3246673acd52c7',1,'data_structures::linked_list::list::push_front()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2',1,'others::Cache::LRUCache::push_front()']]],
-  ['push_5fheap_156',['push_heap',['http://en.cppreference.com/w/cpp/algorithm/push_heap.html',0,'std']]],
-  ['put_157',['put',['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ofstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::fstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ostringstream::put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put_byname::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_fstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::iostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::stringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::strstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_stringstream::put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wostringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wiostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ofstream::put()'],['http://en.cppreference.com/w/cpp/locale/num_put/put.html',0,'std::num_put::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostrstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wfstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_iostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wofstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wstringstream::put()'],['http://en.cppreference.com/w/cpp/locale/money_put/put.html',0,'std::money_put::put()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e',1,'others::Cache::LFUCache::put()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45',1,'others::Cache::LRUCache::put()']]],
-  ['put_5fmoney_158',['put_money',['http://en.cppreference.com/w/cpp/io/manip/put_money.html',0,'std']]],
-  ['put_5ftime_159',['put_time',['http://en.cppreference.com/w/cpp/io/manip/put_time.html',0,'std']]],
-  ['putback_160',['putback',['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::fstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_fstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::iostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wistream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::stringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wifstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_istream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::strstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_stringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istrstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wiostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_istringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_ifstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wfstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_iostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wstringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wistringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::ifstream::putback()']]],
-  ['putc_161',['putc',['http://en.cppreference.com/w/cpp/io/c/fputc.html',0,'std']]],
-  ['putchar_162',['putchar',['http://en.cppreference.com/w/cpp/io/c/putchar.html',0,'std']]],
-  ['putprober_163',['putProber',['../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b',1,'double_hashing::putProber()'],['../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541',1,'linear_probing::putProber()'],['../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b',1,'quadratic_probing::putProber()']]],
-  ['puts_164',['puts',['http://en.cppreference.com/w/cpp/io/c/puts.html',0,'std']]],
-  ['putwchar_165',['putwchar',['http://en.cppreference.com/w/cpp/io/c/putwchar.html',0,'std']]],
-  ['pvalue_166',['pvalue',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#ac121ce37b6ea864b160ebcada0bce936',1,'data_structures::linked_list::link']]],
-  ['pword_167',['pword',['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::fstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ios::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_fstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::iostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ios_base::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wistream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::stringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wifstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_istream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::strstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_stringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istrstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wiostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_istringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ifstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostrstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wfstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_iostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wstringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wistringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ifstream::pword()']]],
-  ['pyramid_5fvolume_168',['pyramid_volume',['../dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c',1,'math']]]
+  ['p_0',['p',['../dd/d1f/classdsu.html#a1ef0b0462a0dda63514f641cbb7dd8cb',1,'dsu::p'],['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#ad5ed23a251dbe55ad1ed06bf1a465ad3',1,'probability::geometric_dist::geometric_distribution::p']]],
+  ['pagefault_1',['pageFault',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a09cbe562b0c396329607f5d388d57c9c',1,'others::lru_cache::LRUCache']]],
+  ['pageframe_2',['pageFrame',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a1aafd0444b410e0fcb66287e9954c893',1,'others::lru_cache::LRUCache']]],
+  ['pagemap_3',['pageMap',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa4d6db56109af196ffc7e5f72bc9907c',1,'others::lru_cache::LRUCache']]],
+  ['pair_5fu_4',['pair_u',['../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b',1,'graph::HKGraph']]],
+  ['pair_5fv_5',['pair_v',['../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77',1,'graph::HKGraph']]],
+  ['pal_5fpart_6',['pal_part',['../d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a',1,'dynamic_programming::palindrome_partitioning']]],
+  ['palindrome_5fof_5fnumber_2ecpp_7',['palindrome_of_number.cpp',['../da/d9a/palindrome__of__number_8cpp.html',1,'']]],
+  ['palindrome_5fpartitioning_8',['palindrome_partitioning',['../d5/d89/namespacepalindrome__partitioning.html',1,'']]],
+  ['palindrome_5fpartitioning_2ecpp_9',['palindrome_partitioning.cpp',['../d5/d90/palindrome__partitioning_8cpp.html',1,'']]],
+  ['pancake_5fsort_10',['pancake_sort',['../df/d10/namespacepancake__sort.html',1,'']]],
+  ['pancake_5fsort_2ecpp_11',['pancake_sort.cpp',['../d3/d92/pancake__sort_8cpp.html',1,'']]],
+  ['pancakesort_12',['pancakeSort',['../d3/d92/pancake__sort_8cpp.html#abff90bc0f54e4f8ea5f0330471781bd5',1,'sorting::pancake_sort']]],
+  ['parallelogram_5farea_13',['parallelogram_area',['../dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f',1,'math']]],
+  ['parallelogram_5fperimeter_14',['parallelogram_perimeter',['../dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3',1,'math']]],
+  ['paranthesis_5fmatching_2ecpp_15',['paranthesis_matching.cpp',['../dc/dc5/paranthesis__matching_8cpp.html',1,'']]],
+  ['parent_16',['parent',['../d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43',1,'graph::RootedTree']]],
+  ['parent_20nodes_17',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
+  ['parent_20pointer_20store_20the_20address_20of_20parent_20nodes_18',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
+  ['partition_19',['partition',['../d1/d21/quick__sort_8cpp.html#a1b2a2cc2d319240f3b65c5b2f479ed82',1,'sorting::quick_sort::partition()'],['../d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34',1,'sorting::partition()'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a3d1c39e1ff42c04fb8ec0c0b9411cd3e',1,'sorting::random_pivot_quick_sort::partition()']]],
+  ['pascal_5ftriangle_20',['pascal_triangle',['../dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd',1,'pascal_triangle.cpp']]],
+  ['pascal_5ftriangle_2ecpp_21',['pascal_triangle.cpp',['../dc/d1a/pascal__triangle_8cpp.html',1,'']]],
+  ['pat_5ftest_22',['pat_test',['../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2',1,'boyer_moore.cpp']]],
+  ['paths_23',['Augmenting paths',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md80',1,'']]],
+  ['pattern_24',['pattern',['../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html',1,'strings::boyer_moore']]],
+  ['pb_25',['pb',['../d7/d35/matrix__exponentiation_8cpp.html#a276c5a0e984cf60015b27252fe04fe6b',1,'matrix_exponentiation.cpp']]],
+  ['perimeter_2ecpp_26',['perimeter.cpp',['../d3/dfe/perimeter_8cpp.html',1,'']]],
+  ['permanent_20ban_27',['4. Permanent Ban',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md14',1,'']]],
+  ['persegtree_28',['perSegTree',['../d8/d28/classrange__queries_1_1per_seg_tree.html',1,'range_queries']]],
+  ['persistent_5fseg_5ftree_5flazy_5fprop_2ecpp_29',['persistent_seg_tree_lazy_prop.cpp',['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html',1,'']]],
+  ['phifunction_30',['phiFunction',['../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5',1,'math']]],
+  ['physics_31',['Physics',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md63',1,'']]],
+  ['physics_32',['physics',['../d5/dd0/namespacephysics.html',1,'']]],
+  ['pigeonhole_5fsort_2ecpp_33',['pigeonhole_sort.cpp',['../dd/da8/pigeonhole__sort_8cpp.html',1,'']]],
+  ['pigeonsort_34',['pigeonSort',['../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3',1,'sorting']]],
+  ['pledge_35',['Our Pledge',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md5',1,'']]],
+  ['point_36',['Point',['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html',1,'ciphers::elliptic_curve_key_exchange::Point'],['../d7/d48/structgeometry_1_1grahamscan_1_1_point.html',1,'geometry::grahamscan::Point'],['../d9/d5a/structgeometry_1_1jarvis_1_1_point.html',1,'geometry::jarvis::Point'],['../d8/dc8/struct_point.html',1,'Point'],['../d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a',1,'Point::Point()'],['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#af0a6e3521629c25c2b5d620f26429830',1,'ciphers::elliptic_curve_key_exchange::Point'],['../dd/d47/namespacemath.html#a006c8ebd11bb1e035815dc835a1a7a85',1,'math::Point']]],
+  ['pointer_20store_20the_20address_20of_20parent_20nodes_37',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
+  ['pointincircle_38',['PointInCircle',['../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad',1,'smallest_circle.cpp']]],
+  ['poisson_5fdist_2ecpp_39',['poisson_dist.cpp',['../d9/d24/poisson__dist_8cpp.html',1,'']]],
+  ['poisson_5fexpected_40',['poisson_expected',['../d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71',1,'poisson_dist.cpp']]],
+  ['poisson_5frange_5fsuccesses_41',['poisson_range_successes',['../d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a',1,'poisson_dist.cpp']]],
+  ['poisson_5frate_42',['poisson_rate',['../d9/d24/poisson__dist_8cpp.html#ac217ab9a06291f360d816700a6958ca8',1,'poisson_dist.cpp']]],
+  ['poisson_5fx_5fsuccesses_43',['poisson_x_successes',['../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1',1,'poisson_dist.cpp']]],
+  ['poly_5ffunction_44',['poly_function',['../da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569',1,'durand_kerner_roots.cpp']]],
+  ['pop_45',['pop',['../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0',1,'stack::pop()'],['../d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b',1,'data_structures::Stack::pop()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb',1,'data_structures::stack_using_queue::Stack::pop()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69',1,'others::Cache::LFUCache::pop()'],['../dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664',1,'pop():&#160;paranthesis_matching.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#a421baa2002a64bc0bfc3e1b64800d734',1,'others::postfix_expression::pop()']]],
+  ['pop_5fback_46',['pop_back',['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7',1,'others::Cache::LRUCache::pop_back()'],['../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d',1,'machine_learning::pop_back(const std::valarray&lt; T &gt; &amp;A)']]],
+  ['pop_5ffront_47',['pop_front',['../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093',1,'machine_learning']]],
+  ['populate_5fparents_48',['populate_parents',['../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e',1,'graph::RootedTree']]],
+  ['populate_5fup_49',['populate_up',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356',1,'graph::LowestCommonAncestor']]],
+  ['postfix_5fevaluation_50',['postfix_evaluation',['../d7/d75/postfix__evaluation_8cpp.html#ae38bd3a177a6d61da3859a281233bbe1',1,'others::postfix_expression']]],
+  ['postfix_5fevaluation_2ecpp_51',['postfix_evaluation.cpp',['../d7/d75/postfix__evaluation_8cpp.html',1,'']]],
+  ['postfix_5fexpression_52',['postfix_expression',['../d4/de6/namespacepostfix__expression.html',1,'']]],
+  ['postorder_53',['postorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c',1,'others::recursive_tree_traversals::BT']]],
+  ['postorder_20traversal_20of_20a_20tree_54',['Postorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree']]],
+  ['postorderiterative_55',['postOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25',1,'others::iterative_tree_traversals::BinaryTree']]],
+  ['power_56',['power',['../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311',1,'math::fibonacci_sum::power()'],['../df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179',1,'math::modular_division::power()'],['../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d',1,'math::power()'],['../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f',1,'power(int x, int n):&#160;power_for_huge_numbers.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec',1,'power(const vector&lt; vector&lt; ll &gt; &gt; &amp;A, ll p):&#160;matrix_exponentiation.cpp']]],
+  ['power_5ffor_5fhuge_5fnumbers_2ecpp_57',['power_for_huge_numbers.cpp',['../df/def/power__for__huge__numbers_8cpp.html',1,'']]],
+  ['power_5fof_5f2_2ecpp_58',['power_of_2.cpp',['../dc/d6d/power__of__2_8cpp.html',1,'']]],
+  ['power_5fof_5ftwo_59',['power_of_two',['../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb',1,'math']]],
+  ['power_5fof_5ftwo_2ecpp_60',['power_of_two.cpp',['../d4/d38/power__of__two_8cpp.html',1,'']]],
+  ['predict_61',['predict',['../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3',1,'machine_learning::adaline::predict()'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a62e152db014cd4de675fa906e5ef2861',1,'machine_learning::k_nearest_neighbors::Knn::predict()']]],
+  ['predict_5fols_5fregressor_62',['predict_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493',1,'ordinary_least_squares_regressor.cpp']]],
+  ['predict_5fwords_63',['predict_words',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4',1,'data_structures::trie_using_hashmap::Trie']]],
+  ['prefix_5fsum_5farray_64',['prefix_sum_array',['../d7/d88/namespaceprefix__sum__array.html',1,'']]],
+  ['prefix_5fsum_5farray_2ecpp_65',['prefix_sum_array.cpp',['../d1/d9e/prefix__sum__array_8cpp.html',1,'']]],
+  ['preorder_66',['preorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5',1,'others::recursive_tree_traversals::BT']]],
+  ['preorder_20traversal_20of_20a_20tree_67',['Preorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]],
+  ['preorderiterative_68',['preOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae',1,'others::iterative_tree_traversals::BinaryTree']]],
+  ['prev_69',['prev',['../de/d21/classothers_1_1_cache_1_1_d___node.html#a19e954cbb710ea8318bcb6aaef78e2d5',1,'others::Cache::D_Node']]],
+  ['primality_5ftest_2ecpp_70',['primality_test.cpp',['../da/d7b/primality__test_8cpp.html',1,'']]],
+  ['prime_71',['PRIME',['../d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8',1,'rabin_karp.cpp']]],
+  ['prime_72',['prime',['../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95',1,'primes_up_to_billion.cpp']]],
+  ['prime_20factorization_73',['Prime factorization',['../d7/d7f/section.html',1,'']]],
+  ['prime_5ffactorization_74',['prime_factorization',['../db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46',1,'prime_factorization.cpp']]],
+  ['prime_5ffactorization_2ecpp_75',['prime_factorization.cpp',['../db/d0d/prime__factorization_8cpp.html',1,'']]],
+  ['prime_5fnumbers_76',['prime_numbers',['../db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe',1,'prime_factorization.cpp']]],
+  ['prime_5fnumbers_2ecpp_77',['prime_numbers.cpp',['../de/d9b/prime__numbers_8cpp.html',1,'']]],
+  ['primes_78',['primes',['../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a',1,'prime_numbers.cpp']]],
+  ['primes_5fup_5fto_5fbillion_2ecpp_79',['primes_up_to_billion.cpp',['../d4/d9c/primes__up__to__billion_8cpp.html',1,'']]],
+  ['print_80',['Print',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165',1,'data_structures::tree_234::Tree234']]],
+  ['print_81',['print',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::print()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a424b17ddc672b25fe0bd9dc8612fba21',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::print(Node *root)'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::print()'],['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8',1,'greedy_algorithms::dijkstra::print()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a55bc4a221e584d33b79b322432ecc0f3',1,'math::sieve_of_eratosthenes::print()'],['../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20',1,'operations_on_datastructures::print()']]],
+  ['print_5fprimes_82',['print_primes',['../dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4',1,'math']]],
+  ['print_5ftable_83',['print_table',['../d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280',1,'games::memory_game']]],
+  ['printarray_84',['printArray',['../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767',1,'heap_sort.cpp']]],
+  ['printinorder_85',['printInorder',['../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
+  ['printlinkedlist_86',['printLinkedList',['../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2',1,'search::sublist_search']]],
+  ['printmat_87',['printMat',['../d3/d05/sudoku__solver_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac',1,'backtracking::sudoku_solver']]],
+  ['printnode_88',['PrintNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be',1,'data_structures::tree_234::Tree234']]],
+  ['printresult_89',['printResult',['../dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793',1,'FCFS']]],
+  ['printroot_90',['printRoot',['../dd/d29/false__position_8cpp.html#a85cb7bfb90abc898e042d624372c5345',1,'numerical_methods::false_position']]],
+  ['printsol_91',['PrintSol',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905',1,'backtracking::n_queens_optimized::PrintSol()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aebd5e11fab6dab282efccfb61beb0bd9',1,'backtracking::n_queens_all_solutions::PrintSol()']]],
+  ['printsolution_92',['printSolution',['../d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07',1,'backtracking::graph_coloring::printSolution()'],['../d4/d3e/n__queens_8cpp.html#a40ae0c7fd04eb20e7f3bff13fc6a5808',1,'backtracking::n_queens::printSolution()']]],
+  ['priority_93',['priority',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a8be70f0a25e53e870e97d8d23968d723',1,'data_structures::treap::Treap']]],
+  ['probability_94',['PROBABILITY',['../d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61',1,'data_structures']]],
+  ['probability_95',['Probability',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md64',1,'']]],
+  ['probability_96',['probability',['../d4/ded/namespaceprobability.html',1,'']]],
+  ['probability_5fdensity_97',['probability_density',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1',1,'probability::geometric_dist::geometric_distribution']]],
+  ['problem_98',['problem',['../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy):&#160;ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy):&#160;ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy):&#160;ode_semi_implicit_euler.cpp']]],
+  ['program_99',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]],
+  ['programming_100',['Dynamic Programming',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51',1,'']]],
+  ['projection_101',['projection',['../d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc',1,'numerical_methods::gram_schmidt']]],
+  ['psucc_102',['psucc',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af94c06f3220e5406245680f58b8e7081',1,'data_structures::linked_list::link']]],
+  ['ptrs_103',['ptrs',['../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5',1,'range_queries::perSegTree']]],
+  ['pull_20requests_104',['Pull Requests',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36',1,'']]],
+  ['push_105',['push',['../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d',1,'stack::push()'],['../d2/dc8/classdata__structures_1_1_stack.html#aa9f9b087e9e7c00628e1289f0f1de3b2',1,'data_structures::Stack::push()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2',1,'data_structures::stack_using_queue::Stack::push()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047',1,'others::Cache::LFUCache::push()'],['../dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095',1,'push():&#160;paranthesis_matching.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea',1,'others::postfix_expression::push()']]],
+  ['push_5fback_106',['push_back',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a6e9859d1a0755fb51e41904d20c95496',1,'data_structures::linked_list::list']]],
+  ['push_5ffront_107',['push_front',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a332b965afd9d6bea8d3246673acd52c7',1,'data_structures::linked_list::list::push_front()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2',1,'others::Cache::LRUCache::push_front()']]],
+  ['put_108',['put',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e',1,'others::Cache::LFUCache::put()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45',1,'others::Cache::LRUCache::put()']]],
+  ['putprober_109',['putProber',['../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b',1,'double_hashing::putProber()'],['../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541',1,'linear_probing::putProber()'],['../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b',1,'quadratic_probing::putProber()']]],
+  ['pvalue_110',['pvalue',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#ac121ce37b6ea864b160ebcada0bce936',1,'data_structures::linked_list::link']]],
+  ['pyramid_5fvolume_111',['pyramid_volume',['../dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c',1,'math']]]
 ];
diff --git a/search/all_16.js b/search/all_16.js
index 3991c3ddc..d9fcee3e3 100644
--- a/search/all_16.js
+++ b/search/all_16.js
@@ -5,30 +5,26 @@ var searchData=
   ['qr_5fdecompose_2eh_2',['qr_decompose.h',['../d4/d68/qr__decompose_8h.html',1,'']]],
   ['qr_5fdecomposition_2ecpp_3',['qr_decomposition.cpp',['../d3/d24/qr__decomposition_8cpp.html',1,'']]],
   ['qr_5feigen_5fvalues_2ecpp_4',['qr_eigen_values.cpp',['../de/d75/qr__eigen__values_8cpp.html',1,'']]],
-  ['qsort_5',['qsort',['http://en.cppreference.com/w/cpp/algorithm/qsort.html',0,'std']]],
-  ['quadratic_5fequations_5fcomplex_5fnumbers_2ecpp_6',['quadratic_equations_complex_numbers.cpp',['../da/d18/quadratic__equations__complex__numbers_8cpp.html',1,'']]],
-  ['quadratic_5fprobing_7',['quadratic_probing',['../d4/dd2/namespacequadratic__probing.html',1,'']]],
-  ['quadratic_5fprobing_5fhash_5ftable_2ecpp_8',['quadratic_probing_hash_table.cpp',['../db/d71/quadratic__probing__hash__table_8cpp.html',1,'']]],
-  ['quadraticequation_9',['quadraticEquation',['../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb',1,'math']]],
-  ['quadraticprobe_10',['quadraticProbe',['../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf',1,'quadratic_probing']]],
-  ['queries_11',['Range Queries',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md65',1,'']]],
-  ['query_12',['query',['../dd/d1b/structquery.html',1,'query'],['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a0c8cbe7239232863f104793c08273039',1,'data_structures::sparse_table::Sparse_table::query()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a1fda852e6e522707fd97f61cdb0a2591',1,'range_queries::heavy_light_decomposition::SG::query()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab',1,'range_queries::heavy_light_decomposition::HLD::query()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4',1,'range_queries::perSegTree::query(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, std::shared_ptr&lt; Node &gt; const &amp;curr)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571',1,'range_queries::perSegTree::query(const uint32_t &amp;l, const uint32_t &amp;r, const uint32_t &amp;version)'],['../d1/d9e/prefix__sum__array_8cpp.html#a7c8fd967c36dbba5fdf9c71faed604cf',1,'range_queries::prefix_sum_array::query()'],['../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d',1,'query(std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, uint64_t qlow, uint64_t qhigh, uint64_t low, uint64_t high, uint64_t pos):&#160;segtree.cpp']]],
-  ['queue_13',['Queue',['../dc/db5/struct_queue.html',1,'']]],
-  ['queue_14',['queue',['../db/da9/classqueue.html',1,'queue&lt; ValueType &gt;'],['http://en.cppreference.com/w/cpp/container/queue.html',0,'std::queue&lt; T &gt;'],['http://en.cppreference.com/w/cpp/container/queue/queue.html',0,'std::queue::queue()']]],
-  ['queue_3c_20int64_5ft_20_3e_15',['queue&lt; int64_t &gt;',['http://en.cppreference.com/w/cpp/container/queue.html',0,'std']]],
-  ['queue_5farray_16',['Queue_Array',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html',1,'data_structures::queue_using_array']]],
-  ['queue_5ftest_17',['queue_test',['../df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863',1,'queue_using_two_stacks.cpp']]],
-  ['queue_5fusing_5farray_18',['queue_using_array',['../d9/d70/namespacequeue__using__array.html',1,'']]],
-  ['queue_5fusing_5farray_2ecpp_19',['queue_using_array.cpp',['../d8/df0/queue__using__array_8cpp.html',1,'']]],
-  ['queue_5fusing_5ftwo_5fstacks_2ecpp_20',['queue_using_two_stacks.cpp',['../df/dd0/queue__using__two__stacks_8cpp.html',1,'']]],
-  ['queuefront_21',['queueFront',['../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094',1,'queue']]],
-  ['queuerear_22',['queueRear',['../db/da9/classqueue.html#a7611df63ebefae613d311039d7305143',1,'queue']]],
-  ['quick_5fexit_23',['quick_exit',['http://en.cppreference.com/w/cpp/utility/program/quick_exit.html',0,'std']]],
-  ['quick_5fsort_24',['quick_sort',['../d0/d2b/namespacequick__sort.html',1,'quick_sort'],['../d1/d21/quick__sort_8cpp.html#a5e6213e8008356ac6eda9427f3f4b394',1,'sorting::quick_sort::quick_sort(std::vector&lt; T &gt; *arr, const int &amp;low, const int &amp;high)'],['../d1/d21/quick__sort_8cpp.html#a53adad7e4d83e1495df25fe8dbb4cc05',1,'sorting::quick_sort::quick_sort(std::vector&lt; T &gt; arr, const int &amp;low, const int &amp;high)']]],
-  ['quick_5fsort_2ecpp_25',['quick_sort.cpp',['../d1/d21/quick__sort_8cpp.html',1,'']]],
-  ['quick_5fsort_5f3_2ecpp_26',['quick_sort_3.cpp',['../d3/d4c/quick__sort__3_8cpp.html',1,'']]],
-  ['quick_5fsort_5fiterative_2ecpp_27',['quick_sort_iterative.cpp',['../d3/d22/quick__sort__iterative_8cpp.html',1,'']]],
-  ['quicksort_28',['quicksort',['../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168',1,'sorting::quicksort(std::vector&lt; T &gt; *arr, int32_t low, int32_t high)'],['../d5/d91/namespacesorting.html#a6eb67c2f91c98cf4464f75b5882022de',1,'sorting::quicksort(std::vector&lt; T &gt; arr, int32_t low, int32_t high)']]],
-  ['quicksortrp_29',['quickSortRP',['../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5',1,'sorting::random_pivot_quick_sort']]],
-  ['quiet_5fnan_30',['quiet_NaN',['http://en.cppreference.com/w/cpp/types/numeric_limits/quiet_NaN.html',0,'std::numeric_limits']]]
+  ['quadratic_5fequations_5fcomplex_5fnumbers_2ecpp_5',['quadratic_equations_complex_numbers.cpp',['../da/d18/quadratic__equations__complex__numbers_8cpp.html',1,'']]],
+  ['quadratic_5fprobing_6',['quadratic_probing',['../d4/dd2/namespacequadratic__probing.html',1,'']]],
+  ['quadratic_5fprobing_5fhash_5ftable_2ecpp_7',['quadratic_probing_hash_table.cpp',['../db/d71/quadratic__probing__hash__table_8cpp.html',1,'']]],
+  ['quadraticequation_8',['quadraticEquation',['../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb',1,'math']]],
+  ['quadraticprobe_9',['quadraticProbe',['../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf',1,'quadratic_probing']]],
+  ['queries_10',['Range Queries',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md65',1,'']]],
+  ['query_11',['query',['../dd/d1b/structquery.html',1,'query'],['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a0c8cbe7239232863f104793c08273039',1,'data_structures::sparse_table::Sparse_table::query()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a1fda852e6e522707fd97f61cdb0a2591',1,'range_queries::heavy_light_decomposition::SG::query()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab',1,'range_queries::heavy_light_decomposition::HLD::query()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4',1,'range_queries::perSegTree::query(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, std::shared_ptr&lt; Node &gt; const &amp;curr)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571',1,'range_queries::perSegTree::query(const uint32_t &amp;l, const uint32_t &amp;r, const uint32_t &amp;version)'],['../d1/d9e/prefix__sum__array_8cpp.html#a7c8fd967c36dbba5fdf9c71faed604cf',1,'range_queries::prefix_sum_array::query()'],['../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d',1,'query(std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, uint64_t qlow, uint64_t qhigh, uint64_t low, uint64_t high, uint64_t pos):&#160;segtree.cpp']]],
+  ['queue_12',['Queue',['../dc/db5/struct_queue.html',1,'']]],
+  ['queue_13',['queue',['../db/da9/classqueue.html',1,'']]],
+  ['queue_5farray_14',['Queue_Array',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html',1,'data_structures::queue_using_array']]],
+  ['queue_5ftest_15',['queue_test',['../df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863',1,'queue_using_two_stacks.cpp']]],
+  ['queue_5fusing_5farray_16',['queue_using_array',['../d9/d70/namespacequeue__using__array.html',1,'']]],
+  ['queue_5fusing_5farray_2ecpp_17',['queue_using_array.cpp',['../d8/df0/queue__using__array_8cpp.html',1,'']]],
+  ['queue_5fusing_5ftwo_5fstacks_2ecpp_18',['queue_using_two_stacks.cpp',['../df/dd0/queue__using__two__stacks_8cpp.html',1,'']]],
+  ['queuefront_19',['queueFront',['../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094',1,'queue']]],
+  ['queuerear_20',['queueRear',['../db/da9/classqueue.html#a7611df63ebefae613d311039d7305143',1,'queue']]],
+  ['quick_5fsort_21',['quick_sort',['../d0/d2b/namespacequick__sort.html',1,'quick_sort'],['../d1/d21/quick__sort_8cpp.html#a5e6213e8008356ac6eda9427f3f4b394',1,'sorting::quick_sort::quick_sort(std::vector&lt; T &gt; *arr, const int &amp;low, const int &amp;high)'],['../d1/d21/quick__sort_8cpp.html#a53adad7e4d83e1495df25fe8dbb4cc05',1,'sorting::quick_sort::quick_sort(std::vector&lt; T &gt; arr, const int &amp;low, const int &amp;high)']]],
+  ['quick_5fsort_2ecpp_22',['quick_sort.cpp',['../d1/d21/quick__sort_8cpp.html',1,'']]],
+  ['quick_5fsort_5f3_2ecpp_23',['quick_sort_3.cpp',['../d3/d4c/quick__sort__3_8cpp.html',1,'']]],
+  ['quick_5fsort_5fiterative_2ecpp_24',['quick_sort_iterative.cpp',['../d3/d22/quick__sort__iterative_8cpp.html',1,'']]],
+  ['quicksort_25',['quicksort',['../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168',1,'sorting::quicksort(std::vector&lt; T &gt; *arr, int32_t low, int32_t high)'],['../d5/d91/namespacesorting.html#a6eb67c2f91c98cf4464f75b5882022de',1,'sorting::quicksort(std::vector&lt; T &gt; arr, int32_t low, int32_t high)']]],
+  ['quicksortrp_26',['quickSortRP',['../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5',1,'sorting::random_pivot_quick_sort']]]
 ];
diff --git a/search/all_17.js b/search/all_17.js
index 34421ec65..629dda97e 100644
--- a/search/all_17.js
+++ b/search/all_17.js
@@ -5,150 +5,69 @@ var searchData=
   ['radix_2',['radix',['../d8/d61/radix__sort2_8cpp.html#ae0cfd94fa3765b53d4ec7893ffaee5f8',1,'sorting::radix_sort']]],
   ['radix_5fsort_3',['radix_sort',['../da/dda/namespaceradix__sort.html',1,'']]],
   ['radix_5fsort2_2ecpp_4',['radix_sort2.cpp',['../d8/d61/radix__sort2_8cpp.html',1,'']]],
-  ['raise_5',['raise',['http://en.cppreference.com/w/cpp/utility/program/raise.html',0,'std']]],
-  ['rand_6',['rand',['http://en.cppreference.com/w/cpp/numeric/random/rand.html',0,'std']]],
-  ['rand_5frange_7',['rand_range',['../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9',1,'ciphers::HillCipher::rand_range(T1 a, T1 b)'],['../d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395',1,'ciphers::HillCipher::rand_range(matrix&lt; T2 &gt; *M, T1 a, T1 b)']]],
-  ['random_5faccess_5fiterator_5ftag_8',['random_access_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]],
-  ['random_5fdevice_9',['random_device',['http://en.cppreference.com/w/cpp/numeric/random/random_device.html',0,'std::random_device'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/random_device.html',0,'std::random_device::random_device()']]],
-  ['random_5fpivot_5fquick_5fsort_10',['random_pivot_quick_sort',['../de/d6b/namespacerandom__pivot__quick__sort.html',1,'']]],
-  ['random_5fpivot_5fquick_5fsort_2ecpp_11',['random_pivot_quick_sort.cpp',['../d1/daa/random__pivot__quick__sort_8cpp.html',1,'']]],
-  ['random_5fshuffle_12',['random_shuffle',['http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html',0,'std']]],
-  ['random_5ftests_13',['random_tests',['../de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f',1,'fibonacci_search.cpp']]],
-  ['randomized_5fbogosort_14',['randomized_bogosort',['../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd',1,'sorting']]],
-  ['randomlevel_15',['randomLevel',['../d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4',1,'data_structures::SkipList']]],
-  ['range_20queries_16',['Range Queries',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md65',1,'']]],
-  ['range_5fcomb_17',['range_comb',['../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52',1,'data_structures::SegmentTree::range_comb(int i, int l, int r, int tl, int tr)'],['../dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b',1,'data_structures::SegmentTree::range_comb(int l, int r)']]],
-  ['range_5ferror_18',['range_error',['http://en.cppreference.com/w/cpp/error/range_error.html',0,'std::range_error'],['http://en.cppreference.com/w/cpp/error/range_error.html',0,'std::range_error::range_error()']]],
-  ['range_5fqueries_19',['range_queries',['../dd/d69/namespacerange__queries.html',1,'']]],
-  ['range_5ftries_20',['range_tries',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69',1,'probability::geometric_dist::geometric_distribution']]],
-  ['rank_21',['rank',['http://en.cppreference.com/w/cpp/types/rank.html',0,'std']]],
-  ['ranlux24_22',['ranlux24',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std::ranlux24'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::ranlux24::ranlux24()']]],
-  ['ranlux24_5fbase_23',['ranlux24_base',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std::ranlux24_base'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::ranlux24_base::ranlux24_base()']]],
-  ['ranlux48_24',['ranlux48',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std::ranlux48'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::ranlux48::ranlux48()']]],
-  ['ranlux48_5fbase_25',['ranlux48_base',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std::ranlux48_base'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::ranlux48_base::ranlux48_base()']]],
-  ['rat_5fmaze_26',['rat_maze',['../d9/d60/namespacerat__maze.html',1,'']]],
-  ['rat_5fmaze_2ecpp_27',['rat_maze.cpp',['../dc/d5a/rat__maze_8cpp.html',1,'']]],
-  ['ratio_28',['ratio',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['ratio_5fadd_29',['ratio_add',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_add.html',0,'std']]],
-  ['ratio_5fdivide_30',['ratio_divide',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_divide.html',0,'std']]],
-  ['ratio_5fequal_31',['ratio_equal',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_equal.html',0,'std']]],
-  ['ratio_5fgreater_32',['ratio_greater',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_greater.html',0,'std']]],
-  ['ratio_5fgreater_5fequal_33',['ratio_greater_equal',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_greater_equal.html',0,'std']]],
-  ['ratio_5fless_34',['ratio_less',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_less.html',0,'std']]],
-  ['ratio_5fless_5fequal_35',['ratio_less_equal',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_less_equal.html',0,'std']]],
-  ['ratio_5fmultiply_36',['ratio_multiply',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_multiply.html',0,'std']]],
-  ['ratio_5fnot_5fequal_37',['ratio_not_equal',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_not_equal.html',0,'std']]],
-  ['ratio_5fsubtract_38',['ratio_subtract',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_subtract.html',0,'std']]],
-  ['raw_5fstorage_5fiterator_39',['raw_storage_iterator',['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator.html',0,'std::raw_storage_iterator'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/raw_storage_iterator.html',0,'std::raw_storage_iterator::raw_storage_iterator()']]],
-  ['rbegin_40',['rbegin',['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::rbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::rbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::rbegin()'],['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::rbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::rbegin()'],['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::rbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::rbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::rbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::rbegin()']]],
-  ['rbtree_41',['RBtree',['../d8/d72/class_r_btree.html',1,'']]],
-  ['rdbuf_42',['rdbuf',['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::fstream::rdbuf()'],['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/rdbuf.html',0,'std::wbuffer_convert::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ios::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_fstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::iostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wistream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::stringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wifstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_istream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::strstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_stringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istrstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wiostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_istringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ifstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostrstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wfstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_iostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wstringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wistringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ifstream::rdbuf()']]],
-  ['rdstate_43',['rdstate',['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::fstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ios::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_fstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::iostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wistream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::stringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wifstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_istream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::strstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_stringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istrstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wiostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_istringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ifstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostrstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wfstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_iostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wstringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wistringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ifstream::rdstate()']]],
-  ['read_44',['read',['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::fstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_fstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::iostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wistream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::stringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wifstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_istream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::strstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_stringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istrstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wiostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_istringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_ifstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wfstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_iostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wstringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wistringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::ifstream::read()']]],
-  ['readsome_45',['readsome',['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::fstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_fstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::iostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wistream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::stringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wifstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_istream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::strstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_stringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istrstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wiostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_istringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_ifstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wfstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_iostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wstringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wistringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::ifstream::readsome()']]],
-  ['ready_46',['ready',['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::match_results::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::wsmatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::smatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::wcmatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::cmatch::ready()']]],
-  ['real_47',['real',['http://en.cppreference.com/w/cpp/numeric/complex/real.html',0,'std::complex::real()'],['../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6',1,'Complex::real()']]],
-  ['realloc_48',['realloc',['http://en.cppreference.com/w/cpp/memory/c/realloc.html',0,'std']]],
-  ['realtime_5fstats_2ecpp_49',['realtime_stats.cpp',['../d0/d08/realtime__stats_8cpp.html',1,'']]],
-  ['rear_50',['rear',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85',1,'data_structures::queue_using_array::Queue_Array']]],
-  ['rec_5fternary_5fsearch_51',['rec_ternary_search',['../dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead',1,'ternary_search.cpp']]],
-  ['recalculate_5fhash_52',['recalculate_hash',['../d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893',1,'string_search']]],
-  ['rect_5farea_53',['rect_area',['../dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca',1,'math']]],
-  ['rect_5fperimeter_54',['rect_perimeter',['../dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6',1,'math']]],
-  ['rect_5fprism_5fvolume_55',['rect_prism_volume',['../dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12',1,'math']]],
-  ['recursive_5fbubble_5fsort_56',['recursive_bubble_sort',['../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf',1,'sorting']]],
-  ['recursive_5fbubble_5fsort_2ecpp_57',['recursive_bubble_sort.cpp',['../d3/df9/recursive__bubble__sort_8cpp.html',1,'']]],
-  ['recursive_5fmutex_58',['recursive_mutex',['http://en.cppreference.com/w/cpp/thread/recursive_mutex.html',0,'std::recursive_mutex'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/recursive_mutex.html',0,'std::recursive_mutex::recursive_mutex()']]],
-  ['recursive_5ftimed_5fmutex_59',['recursive_timed_mutex',['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex.html',0,'std::recursive_timed_mutex'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/recursive_timed_mutex.html',0,'std::recursive_timed_mutex::recursive_timed_mutex()']]],
-  ['recursive_5ftree_5ftraversal_2ecpp_60',['recursive_tree_traversal.cpp',['../dc/de1/recursive__tree__traversal_8cpp.html',1,'']]],
-  ['ref_61',['ref',['http://en.cppreference.com/w/cpp/utility/functional/ref.html',0,'std']]],
-  ['refer_62',['refer',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602',1,'others::lru_cache::LRUCache']]],
-  ['reference_63',['reference',['http://en.cppreference.com/w/cpp/utility/bitset/reference.html',0,'std::bitset']]],
-  ['reference_5fwrapper_64',['reference_wrapper',['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper.html',0,'std::reference_wrapper'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/reference_wrapper.html',0,'std::reference_wrapper::reference_wrapper()']]],
-  ['regex_65',['regex',['http://en.cppreference.com/w/cpp/regex/basic_regex.html',0,'std::regex'],['http://en.cppreference.com/w/cpp/regex/basic_regex/basic_regex.html',0,'std::regex::regex()']]],
-  ['regex_5ferror_66',['regex_error',['http://en.cppreference.com/w/cpp/regex/regex_error.html',0,'std::regex_error'],['http://en.cppreference.com/w/cpp/regex/regex_error/regex_error.html',0,'std::regex_error::regex_error()']]],
-  ['regex_5fiterator_67',['regex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::regex_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::regex_iterator::regex_iterator()']]],
-  ['regex_5fmatch_68',['regex_match',['http://en.cppreference.com/w/cpp/regex/regex_match.html',0,'std']]],
-  ['regex_5freplace_69',['regex_replace',['http://en.cppreference.com/w/cpp/regex/regex_replace.html',0,'std']]],
-  ['regex_5fsearch_70',['regex_search',['http://en.cppreference.com/w/cpp/regex/regex_search.html',0,'std']]],
-  ['regex_5ftoken_5fiterator_71',['regex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::regex_token_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::regex_token_iterator::regex_token_iterator()']]],
-  ['regex_5ftraits_72',['regex_traits',['http://en.cppreference.com/w/cpp/regex/regex_traits.html',0,'std::regex_traits'],['http://en.cppreference.com/w/cpp/regex/regex_traits/regex_traits.html',0,'std::regex_traits::regex_traits()']]],
-  ['register_5fcallback_73',['register_callback',['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::fstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ios::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_fstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::iostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ios_base::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wistream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::stringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wifstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_istream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::strstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_stringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istrstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wiostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_istringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ifstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostrstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wfstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_iostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wstringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wistringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ifstream::register_callback()']]],
-  ['regula_5ffalsi_74',['regula_falsi',['../dd/d29/false__position_8cpp.html#a7d69b49dc37da1c02b3ab8c7fe783494',1,'numerical_methods::false_position']]],
-  ['rehash_75',['rehash',['http://en.cppreference.com/w/cpp/container/unordered_map/rehash.html',0,'std::unordered_map::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/rehash.html',0,'std::unordered_multimap::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/rehash.html',0,'std::unordered_multiset::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_set/rehash.html',0,'std::unordered_set::rehash()'],['../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d',1,'double_hashing::rehash()'],['../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0',1,'linear_probing::rehash()'],['../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486',1,'quadratic_probing::rehash()']]],
-  ['release_76',['release',['http://en.cppreference.com/w/cpp/thread/unique_lock/release.html',0,'std::unique_lock::release()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/release.html',0,'std::unique_ptr::release()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/release.html',0,'std::shared_lock::release()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/release.html',0,'std::auto_ptr::release()']]],
-  ['relu_77',['relu',['../d2/d58/neural__network_8cpp.html#af8f264600754602b6a9ea19cc690e50e',1,'machine_learning::neural_network::activations']]],
-  ['remainder_78',['remainder',['http://en.cppreference.com/w/cpp/numeric/math/remainder.html',0,'std']]],
-  ['removalinfo_79',['removalInfo',['../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824',1,'double_hashing::removalInfo()'],['../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0',1,'linear_probing::removalInfo()'],['../d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30',1,'quadratic_probing::removalInfo()']]],
-  ['remove_80',['Remove',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11',1,'data_structures::tree_234::Tree234']]],
-  ['remove_81',['remove',['http://en.cppreference.com/w/cpp/container/forward_list/remove.html',0,'std::forward_list::remove()'],['http://en.cppreference.com/w/cpp/container/list/remove.html',0,'std::list::remove()'],['../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153',1,'binary_search_tree::remove(std::unique_ptr&lt; bst_node &gt; &amp;parent, std::unique_ptr&lt; bst_node &gt; &amp;node, T rm_value)'],['../d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb',1,'binary_search_tree::remove(T rm_value)'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6',1,'data_structures::list_array::list::remove()'],['http://en.cppreference.com/w/cpp/algorithm/remove.html',0,'std::remove()'],['../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931',1,'double_hashing::remove()'],['../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28',1,'linear_probing::remove()'],['../d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a',1,'quadratic_probing::remove()']]],
-  ['remove_5fall_5fextents_82',['remove_all_extents',['http://en.cppreference.com/w/cpp/types/remove_all_extents.html',0,'std']]],
-  ['remove_5fconst_83',['remove_const',['http://en.cppreference.com/w/cpp/types/remove_cv.html',0,'std']]],
-  ['remove_5fcopy_84',['remove_copy',['http://en.cppreference.com/w/cpp/algorithm/remove_copy.html',0,'std']]],
-  ['remove_5fcopy_5fif_85',['remove_copy_if',['http://en.cppreference.com/w/cpp/algorithm/remove_copy.html',0,'std']]],
-  ['remove_5fcv_86',['remove_cv',['http://en.cppreference.com/w/cpp/types/remove_cv.html',0,'std']]],
-  ['remove_5fextent_87',['remove_extent',['http://en.cppreference.com/w/cpp/types/remove_extent.html',0,'std']]],
-  ['remove_5fif_88',['remove_if',['http://en.cppreference.com/w/cpp/container/forward_list/remove.html',0,'std::forward_list::remove_if()'],['http://en.cppreference.com/w/cpp/container/list/remove.html',0,'std::list::remove_if()'],['http://en.cppreference.com/w/cpp/algorithm/remove.html',0,'std::remove_if(T... args)']]],
-  ['remove_5fpointer_89',['remove_pointer',['http://en.cppreference.com/w/cpp/types/remove_pointer.html',0,'std']]],
-  ['remove_5freference_90',['remove_reference',['http://en.cppreference.com/w/cpp/types/remove_reference.html',0,'std']]],
-  ['remove_5fvolatile_91',['remove_volatile',['http://en.cppreference.com/w/cpp/types/remove_cv.html',0,'std']]],
-  ['removeitembyindex_92',['RemoveItemByIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a28944bb16ec22650b47fe3e80e3e13f8',1,'data_structures::tree_234::Node']]],
-  ['removepremerge_93',['RemovePreMerge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4',1,'data_structures::tree_234::Tree234']]],
-  ['removewordhelper_94',['removeWordHelper',['../dd/d2f/class_trie.html#a26941759ecf94d67a27d4a610bc0f63d',1,'Trie']]],
-  ['remquo_95',['remquo',['http://en.cppreference.com/w/cpp/numeric/math/remquo.html',0,'std']]],
-  ['rename_96',['rename',['http://en.cppreference.com/w/cpp/io/c/rename.html',0,'std']]],
-  ['rend_97',['rend',['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::rend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::rend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::rend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::rend()'],['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::rend()'],['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::rend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::rend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::rend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::rend()']]],
-  ['replace_98',['replace',['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::basic_string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::wstring::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::u16string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::u32string::replace()'],['http://en.cppreference.com/w/cpp/algorithm/replace.html',0,'std::replace(T... args)']]],
-  ['replace_5fcopy_99',['replace_copy',['http://en.cppreference.com/w/cpp/algorithm/replace_copy.html',0,'std']]],
-  ['replace_5fcopy_5fif_100',['replace_copy_if',['http://en.cppreference.com/w/cpp/algorithm/replace_copy.html',0,'std']]],
-  ['replace_5fif_101',['replace_if',['http://en.cppreference.com/w/cpp/algorithm/replace.html',0,'std']]],
-  ['requests_102',['Pull Requests',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36',1,'']]],
-  ['res_103',['res',['../df/de5/classbacktracking_1_1generate__parentheses.html#ab35b9b6d2886abed3d6fb05c2be1c508',1,'backtracking::generate_parentheses']]],
-  ['reserve_104',['reserve',['http://en.cppreference.com/w/cpp/container/vector/reserve.html',0,'std::vector::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::string::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_map/reserve.html',0,'std::unordered_map::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/reserve.html',0,'std::unordered_multimap::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::basic_string::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::wstring::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/reserve.html',0,'std::unordered_multiset::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::u16string::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::u32string::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_set/reserve.html',0,'std::unordered_set::reserve()']]],
-  ['reset_105',['reset',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/reset.html',0,'std::student_t_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/reset.html',0,'std::extreme_value_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/reset.html',0,'std::lognormal_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/reset.html',0,'std::weak_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/reset.html',0,'std::discrete_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/reset.html',0,'std::piecewise_constant_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/reset.html',0,'std::poisson_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/reset.html',0,'std::bernoulli_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/reset.html',0,'std::shared_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/reset.html',0,'std::exponential_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/reset.html',0,'std::uniform_real_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/reset.html',0,'std::geometric_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/reset.html',0,'std::normal_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/reset.html',0,'std::unique_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/reset.html',0,'std::weibull_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/reset.html',0,'std::negative_binomial_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/reset.html',0,'std::chi_squared_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/reset.html',0,'std::piecewise_linear_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/reset.html',0,'std::uniform_int_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/reset.html',0,'std::fisher_f_distribution::reset()'],['http://en.cppreference.com/w/cpp/utility/bitset/reset.html',0,'std::bitset::reset()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/reset.html',0,'std::auto_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/reset.html',0,'std::gamma_distribution::reset()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/reset.html',0,'std::packaged_task::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/reset.html',0,'std::binomial_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/reset.html',0,'std::cauchy_distribution::reset()']]],
-  ['reset_5fdata_106',['reset_data',['../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b',1,'games::memory_game']]],
-  ['resetiosflags_107',['resetiosflags',['http://en.cppreference.com/w/cpp/io/manip/resetiosflags.html',0,'std']]],
-  ['resize_108',['resize',['http://en.cppreference.com/w/cpp/container/vector/resize.html',0,'std::vector::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::string::resize()'],['http://en.cppreference.com/w/cpp/container/forward_list/resize.html',0,'std::forward_list::resize()'],['http://en.cppreference.com/w/cpp/container/deque/resize.html',0,'std::deque::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::basic_string::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::wstring::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::u16string::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::u32string::resize()'],['http://en.cppreference.com/w/cpp/container/list/resize.html',0,'std::list::resize()']]],
-  ['responsibilities_109',['Enforcement Responsibilities',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md7',1,'']]],
-  ['result_110',['result',['../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa',1,'math::fibonacci_sum']]],
-  ['result_5fof_111',['result_of',['http://en.cppreference.com/w/cpp/types/result_of.html',0,'std']]],
-  ['rethrow_5fexception_112',['rethrow_exception',['http://en.cppreference.com/w/cpp/error/rethrow_exception.html',0,'std']]],
-  ['rethrow_5fif_5fnested_113',['rethrow_if_nested',['http://en.cppreference.com/w/cpp/error/rethrow_if_nested.html',0,'std']]],
-  ['rethrow_5fnested_114',['rethrow_nested',['http://en.cppreference.com/w/cpp/error/nested_exception/rethrow_nested.html',0,'std::nested_exception']]],
-  ['return_5ftemporary_5fbuffer_115',['return_temporary_buffer',['http://en.cppreference.com/w/cpp/memory/return_temporary_buffer.html',0,'std']]],
-  ['reverse_116',['reverse',['http://en.cppreference.com/w/cpp/container/forward_list/reverse.html',0,'std::forward_list::reverse()'],['http://en.cppreference.com/w/cpp/container/list/reverse.html',0,'std::list::reverse()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse()'],['http://en.cppreference.com/w/cpp/algorithm/reverse.html',0,'std::reverse()'],['../d3/d92/pancake__sort_8cpp.html#a99e27ad84ad43df9977776b1a8d5416e',1,'sorting::pancake_sort::reverse()']]],
-  ['reverse_5fa_5flinked_5flist_2ecpp_117',['reverse_a_linked_list.cpp',['../d6/d05/reverse__a__linked__list_8cpp.html',1,'']]],
-  ['reverse_5fbinary_118',['reverse_binary',['../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb',1,'miller_rabin.cpp']]],
-  ['reverse_5fbinary_5ftree_119',['reverse_binary_tree',['../dc/dc5/namespacereverse__binary__tree.html',1,'']]],
-  ['reverse_5fbinary_5ftree_2ecpp_120',['reverse_binary_tree.cpp',['../d4/db6/reverse__binary__tree_8cpp.html',1,'']]],
-  ['reverse_5fcopy_121',['reverse_copy',['http://en.cppreference.com/w/cpp/algorithm/reverse_copy.html',0,'std']]],
-  ['reverse_5fiterator_122',['reverse_iterator',['http://en.cppreference.com/w/cpp/iterator/reverse_iterator.html',0,'std']]],
-  ['reverse_5fstr_123',['reverse_str',['../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541',1,'longest_common_string.cpp']]],
-  ['reversebinarytree_124',['reverseBinaryTree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree']]],
-  ['reverselist_125',['reverseList',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e',1,'data_structures::linked_list::list']]],
-  ['reviewer_126',['Maintainer/reviewer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md24',1,'']]],
-  ['reviewers_20and_20maintainers_127',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]],
-  ['rewind_128',['rewind',['http://en.cppreference.com/w/cpp/io/c/rewind.html',0,'std']]],
-  ['rfind_129',['rfind',['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::basic_string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::wstring::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::u16string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::u32string::rfind()']]],
-  ['right_130',['right',['../dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df',1,'binary_search_tree::bst_node::right'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0',1,'operations_on_datastructures::inorder_traversal_of_bst::Node::right'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256',1,'operations_on_datastructures::reverse_binary_tree::Node::right'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143',1,'others::iterative_tree_traversals::Node::right'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83',1,'others::recursive_tree_traversals::Node::right'],['../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088',1,'range_queries::perSegTree::Node::right'],['../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e',1,'MinHeap::right()'],['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std::right()']]],
-  ['right_20node_20subtree_131',['right node subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'Case 2: The given node does not have a right node/subtree']]],
-  ['right_5frotate_132',['right_rotate',['../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c',1,'hashing::sha256']]],
-  ['rightrotate_133',['RightRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9',1,'data_structures::tree_234::Tree234']]],
-  ['rightrotate_134',['rightRotate',['../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c',1,'avltree.cpp']]],
-  ['rint_135',['rint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]],
-  ['root_136',['root',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c',1,'data_structures::treap::Treap::root'],['../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe',1,'graph::RootedTree::root'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::root'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::root']]],
-  ['root_20node_137',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]],
-  ['root_5f_138',['root_',['../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50',1,'binary_search_tree::root_'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36',1,'data_structures::tree_234::Tree234::root_']]],
-  ['root_5fnode_139',['root_node',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a832072498abeaa52ad43c4fc99cba248',1,'data_structures::trie_using_hashmap::Trie']]],
-  ['rootedtree_140',['RootedTree',['../d0/d58/classgraph_1_1_rooted_tree.html',1,'graph::RootedTree'],['../d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d',1,'graph::RootedTree::RootedTree()']]],
-  ['rotate_141',['rotate',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29',1,'data_structures::treap::Treap::rotate()'],['http://en.cppreference.com/w/cpp/algorithm/rotate.html',0,'std::rotate(T... args)']]],
-  ['rotate_5fcopy_142',['rotate_copy',['http://en.cppreference.com/w/cpp/algorithm/rotate_copy.html',0,'std']]],
-  ['round_143',['round',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]],
-  ['round_5ferror_144',['round_error',['http://en.cppreference.com/w/cpp/types/numeric_limits/round_error.html',0,'std::numeric_limits']]],
-  ['run_5ftests_145',['run_tests',['../d3/db3/lru__cache_8cpp.html#a6a3be6d8871b1f5dc03688da8f3ee9e6',1,'lru_tests']]],
-  ['runge_5fkutta_146',['runge_kutta',['../d2/de7/namespacerunge__kutta.html',1,'']]],
-  ['rungekutta_147',['rungeKutta',['../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856',1,'numerical_methods::runge_kutta']]],
-  ['rungekutta_2ecpp_148',['rungekutta.cpp',['../d1/da6/rungekutta_8cpp.html',1,'']]],
-  ['runtests_149',['runTests',['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()'],['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()'],['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()']]],
-  ['runtime_5ferror_150',['runtime_error',['http://en.cppreference.com/w/cpp/error/runtime_error.html',0,'std::runtime_error'],['http://en.cppreference.com/w/cpp/error/runtime_error.html',0,'std::runtime_error::runtime_error()']]]
+  ['rand_5frange_5',['rand_range',['../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9',1,'ciphers::HillCipher::rand_range(T1 a, T1 b)'],['../d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395',1,'ciphers::HillCipher::rand_range(matrix&lt; T2 &gt; *M, T1 a, T1 b)']]],
+  ['random_5fpivot_5fquick_5fsort_6',['random_pivot_quick_sort',['../de/d6b/namespacerandom__pivot__quick__sort.html',1,'']]],
+  ['random_5fpivot_5fquick_5fsort_2ecpp_7',['random_pivot_quick_sort.cpp',['../d1/daa/random__pivot__quick__sort_8cpp.html',1,'']]],
+  ['random_5ftests_8',['random_tests',['../de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f',1,'fibonacci_search.cpp']]],
+  ['randomized_5fbogosort_9',['randomized_bogosort',['../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd',1,'sorting']]],
+  ['randomlevel_10',['randomLevel',['../d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4',1,'data_structures::SkipList']]],
+  ['range_20queries_11',['Range Queries',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md65',1,'']]],
+  ['range_5fcomb_12',['range_comb',['../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52',1,'data_structures::SegmentTree::range_comb(int i, int l, int r, int tl, int tr)'],['../dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b',1,'data_structures::SegmentTree::range_comb(int l, int r)']]],
+  ['range_5fqueries_13',['range_queries',['../dd/d69/namespacerange__queries.html',1,'']]],
+  ['range_5ftries_14',['range_tries',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69',1,'probability::geometric_dist::geometric_distribution']]],
+  ['rat_5fmaze_15',['rat_maze',['../d9/d60/namespacerat__maze.html',1,'']]],
+  ['rat_5fmaze_2ecpp_16',['rat_maze.cpp',['../dc/d5a/rat__maze_8cpp.html',1,'']]],
+  ['rbtree_17',['RBtree',['../d8/d72/class_r_btree.html',1,'']]],
+  ['real_18',['real',['../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6',1,'Complex']]],
+  ['realtime_5fstats_2ecpp_19',['realtime_stats.cpp',['../d0/d08/realtime__stats_8cpp.html',1,'']]],
+  ['rear_20',['rear',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85',1,'data_structures::queue_using_array::Queue_Array']]],
+  ['rec_5fternary_5fsearch_21',['rec_ternary_search',['../dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead',1,'ternary_search.cpp']]],
+  ['recalculate_5fhash_22',['recalculate_hash',['../d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893',1,'string_search']]],
+  ['rect_5farea_23',['rect_area',['../dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca',1,'math']]],
+  ['rect_5fperimeter_24',['rect_perimeter',['../dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6',1,'math']]],
+  ['rect_5fprism_5fvolume_25',['rect_prism_volume',['../dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12',1,'math']]],
+  ['recursive_5fbubble_5fsort_26',['recursive_bubble_sort',['../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf',1,'sorting']]],
+  ['recursive_5fbubble_5fsort_2ecpp_27',['recursive_bubble_sort.cpp',['../d3/df9/recursive__bubble__sort_8cpp.html',1,'']]],
+  ['recursive_5ftree_5ftraversal_2ecpp_28',['recursive_tree_traversal.cpp',['../dc/de1/recursive__tree__traversal_8cpp.html',1,'']]],
+  ['refer_29',['refer',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602',1,'others::lru_cache::LRUCache']]],
+  ['regula_5ffalsi_30',['regula_falsi',['../dd/d29/false__position_8cpp.html#a7d69b49dc37da1c02b3ab8c7fe783494',1,'numerical_methods::false_position']]],
+  ['rehash_31',['rehash',['../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d',1,'double_hashing::rehash()'],['../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0',1,'linear_probing::rehash()'],['../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486',1,'quadratic_probing::rehash()']]],
+  ['relu_32',['relu',['../d2/d58/neural__network_8cpp.html#af8f264600754602b6a9ea19cc690e50e',1,'machine_learning::neural_network::activations']]],
+  ['removalinfo_33',['removalInfo',['../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824',1,'double_hashing::removalInfo()'],['../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0',1,'linear_probing::removalInfo()'],['../d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30',1,'quadratic_probing::removalInfo()']]],
+  ['remove_34',['Remove',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11',1,'data_structures::tree_234::Tree234']]],
+  ['remove_35',['remove',['../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153',1,'binary_search_tree::remove(std::unique_ptr&lt; bst_node &gt; &amp;parent, std::unique_ptr&lt; bst_node &gt; &amp;node, T rm_value)'],['../d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb',1,'binary_search_tree::remove(T rm_value)'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6',1,'data_structures::list_array::list::remove()'],['../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931',1,'double_hashing::remove()'],['../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28',1,'linear_probing::remove()'],['../d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a',1,'quadratic_probing::remove()']]],
+  ['removeitembyindex_36',['RemoveItemByIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a28944bb16ec22650b47fe3e80e3e13f8',1,'data_structures::tree_234::Node']]],
+  ['removepremerge_37',['RemovePreMerge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4',1,'data_structures::tree_234::Tree234']]],
+  ['removewordhelper_38',['removeWordHelper',['../dd/d2f/class_trie.html#a26941759ecf94d67a27d4a610bc0f63d',1,'Trie']]],
+  ['requests_39',['Pull Requests',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md36',1,'']]],
+  ['res_40',['res',['../df/de5/classbacktracking_1_1generate__parentheses.html#ab35b9b6d2886abed3d6fb05c2be1c508',1,'backtracking::generate_parentheses']]],
+  ['reset_5fdata_41',['reset_data',['../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b',1,'games::memory_game']]],
+  ['responsibilities_42',['Enforcement Responsibilities',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md7',1,'']]],
+  ['result_43',['result',['../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa',1,'math::fibonacci_sum']]],
+  ['reverse_44',['reverse',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse()'],['../d3/d92/pancake__sort_8cpp.html#a99e27ad84ad43df9977776b1a8d5416e',1,'sorting::pancake_sort::reverse()']]],
+  ['reverse_5fa_5flinked_5flist_2ecpp_45',['reverse_a_linked_list.cpp',['../d6/d05/reverse__a__linked__list_8cpp.html',1,'']]],
+  ['reverse_5fbinary_46',['reverse_binary',['../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb',1,'miller_rabin.cpp']]],
+  ['reverse_5fbinary_5ftree_47',['reverse_binary_tree',['../dc/dc5/namespacereverse__binary__tree.html',1,'']]],
+  ['reverse_5fbinary_5ftree_2ecpp_48',['reverse_binary_tree.cpp',['../d4/db6/reverse__binary__tree_8cpp.html',1,'']]],
+  ['reverse_5fstr_49',['reverse_str',['../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541',1,'longest_common_string.cpp']]],
+  ['reversebinarytree_50',['reverseBinaryTree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree']]],
+  ['reverselist_51',['reverseList',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e',1,'data_structures::linked_list::list']]],
+  ['reviewer_52',['Maintainer/reviewer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md24',1,'']]],
+  ['reviewers_20and_20maintainers_53',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]],
+  ['right_54',['right',['../dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df',1,'binary_search_tree::bst_node::right'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0',1,'operations_on_datastructures::inorder_traversal_of_bst::Node::right'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256',1,'operations_on_datastructures::reverse_binary_tree::Node::right'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143',1,'others::iterative_tree_traversals::Node::right'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83',1,'others::recursive_tree_traversals::Node::right'],['../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088',1,'range_queries::perSegTree::Node::right'],['../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e',1,'MinHeap::right()']]],
+  ['right_20node_20subtree_55',['right node subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'Case 2: The given node does not have a right node/subtree']]],
+  ['right_5frotate_56',['right_rotate',['../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c',1,'hashing::sha256']]],
+  ['rightrotate_57',['RightRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9',1,'data_structures::tree_234::Tree234']]],
+  ['rightrotate_58',['rightRotate',['../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c',1,'avltree.cpp']]],
+  ['root_59',['root',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a3081969b2714a8101f7df28b1ce5ed2c',1,'data_structures::treap::Treap::root'],['../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe',1,'graph::RootedTree::root'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a5d5cebd6bc906c60763fc6be10cfdd13',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::root'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::root']]],
+  ['root_20node_60',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]],
+  ['root_5f_61',['root_',['../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50',1,'binary_search_tree::root_'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a348ea76c7629b2dcf740be062f970a36',1,'data_structures::tree_234::Tree234::root_']]],
+  ['root_5fnode_62',['root_node',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a832072498abeaa52ad43c4fc99cba248',1,'data_structures::trie_using_hashmap::Trie']]],
+  ['rootedtree_63',['RootedTree',['../d0/d58/classgraph_1_1_rooted_tree.html',1,'graph::RootedTree'],['../d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d',1,'graph::RootedTree::RootedTree()']]],
+  ['rotate_64',['rotate',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29',1,'data_structures::treap::Treap']]],
+  ['run_5ftests_65',['run_tests',['../d3/db3/lru__cache_8cpp.html#a6a3be6d8871b1f5dc03688da8f3ee9e6',1,'lru_tests']]],
+  ['runge_5fkutta_66',['runge_kutta',['../d2/de7/namespacerunge__kutta.html',1,'']]],
+  ['rungekutta_67',['rungeKutta',['../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856',1,'numerical_methods::runge_kutta']]],
+  ['rungekutta_2ecpp_68',['rungekutta.cpp',['../d1/da6/rungekutta_8cpp.html',1,'']]],
+  ['runtests_69',['runTests',['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()'],['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()'],['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()']]]
 ];
diff --git a/search/all_18.js b/search/all_18.js
index c7246e95b..376a02b95 100644
--- a/search/all_18.js
+++ b/search/all_18.js
@@ -1,343 +1,177 @@
 var searchData=
 [
-  ['s_0',['s',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/params.html',0,'std::lognormal_distribution']]],
-  ['s_5fsize_1',['s_size',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ac6d912bbfafa3a7509f66bbc1729ca25',1,'range_queries::heavy_light_decomposition::SG']]],
-  ['s_5ftree_2',['s_tree',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afbf8a9cb9449d5ca844f4e141a801e6a',1,'range_queries::heavy_light_decomposition::SG']]],
-  ['saddleback_3',['saddleback',['../d0/dda/namespacesaddleback.html',1,'saddleback'],['../d3/d22/saddleback__search_8cpp.html#ad1e0ca34797d88490747c08eca70a2e6',1,'search::saddleback::saddleback()']]],
-  ['saddleback_5fsearch_2ecpp_4',['saddleback_search.cpp',['../d3/d22/saddleback__search_8cpp.html',1,'']]],
-  ['safe_5fsubstr_5',['safe_substr',['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aad9e3edfe156b59fc06a5585403fe0d6',1,'divide_and_conquer::karatsuba_algorithm']]],
-  ['sample_5ftest_6',['sample_test',['../de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6',1,'geometric_dist.cpp']]],
-  ['save_5f2d_5fdata_7',['save_2d_data',['../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c',1,'kohonen_som_topology.cpp']]],
-  ['save_5fexact_5fsolution_8',['save_exact_solution',['../db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0):&#160;ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0):&#160;ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0):&#160;ode_semi_implicit_euler.cpp']]],
-  ['save_5fmodel_9',['save_model',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4f14e473bb0722c6490b9dc8da5982aa',1,'machine_learning::neural_network::NeuralNetwork']]],
-  ['save_5fnd_5fdata_10',['save_nd_data',['../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67',1,'kohonen_som_trace.cpp']]],
-  ['save_5fu_5fmatrix_11',['save_u_matrix',['../d8/d77/namespacemachine__learning.html#aa72a53c88203fde278f1fe6c3afe5b07',1,'machine_learning']]],
-  ['sbumpc_12',['sbumpc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_filebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wstringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::stringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wfilebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wstreambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::strstreambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_stringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_streambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::filebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::streambuf::sbumpc()']]],
-  ['scalbln_13',['scalbln',['http://en.cppreference.com/w/cpp/numeric/math/scalbn.html',0,'std']]],
-  ['scalbn_14',['scalbn',['http://en.cppreference.com/w/cpp/numeric/math/scalbn.html',0,'std']]],
-  ['scan_5fis_15',['scan_is',['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype_byname::scan_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype::scan_is()']]],
-  ['scanf_16',['scanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]],
-  ['schedule_17',['schedule',['../dd/dca/class_f_c_f_s.html#af2594e22a867b308e027623940193d46',1,'FCFS']]],
-  ['scheduleforfcfs_18',['scheduleForFcfs',['../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91',1,'FCFS']]],
-  ['scheduling_20algorithms_19',['Cpu Scheduling Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48',1,'']]],
-  ['scientific_20',['scientific',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]],
-  ['scope_21',['Scope',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md8',1,'']]],
-  ['scoped_5fallocator_5fadaptor_22',['scoped_allocator_adaptor',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor.html',0,'std::scoped_allocator_adaptor'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/scoped_allocator_adaptor.html',0,'std::scoped_allocator_adaptor::scoped_allocator_adaptor()']]],
-  ['scs_23',['scs',['../d7/d65/shortest__common__supersequence_8cpp.html#ad2ee8d7e67da9f6eb85146b08dad95e6',1,'dynamic_programming::shortest_common_supersequence']]],
-  ['search_24',['Search',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md66',1,'']]],
-  ['search_25',['search',['../d9/dca/namespacesearch.html',1,'search'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ad3423f7518671351340932db3c24959a',1,'data_structures::linked_list::list::search()'],['../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206',1,'Trie::search()'],['../d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63',1,'data_structures::trie::search(const std::shared_ptr&lt; trie &gt; &amp;root, const std::string &amp;str, int index)'],['../d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d',1,'data_structures::trie::search(const std::string &amp;str, int index)'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f',1,'data_structures::trie_using_hashmap::Trie::search()'],['http://en.cppreference.com/w/cpp/algorithm/search.html',0,'std::search()'],['../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738',1,'strings::boyer_moore::search()']]],
-  ['search_20from_20the_20root_20node_26',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]],
-  ['search_5fn_27',['search_n',['http://en.cppreference.com/w/cpp/algorithm/search_n.html',0,'std']]],
-  ['searchelement_28',['searchElement',['../d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4',1,'data_structures::SkipList']]],
-  ['searchfreqsuggestions_29',['SearchFreqSuggestions',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503',1,'operations_on_datastructures::trie_operations::Tnode']]],
-  ['searchingprober_30',['searchingProber',['../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6',1,'double_hashing::searchingProber()'],['../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77',1,'linear_probing::searchingProber()'],['../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6',1,'quadratic_probing::searchingProber()']]],
-  ['searchpresence_31',['SearchPresence',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a4a624fcdf3c3beb2025d69f2cfda8023',1,'operations_on_datastructures::trie_operations::Tnode']]],
-  ['searchsuggestions_32',['SearchSuggestions',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a18b70172ca4fb2811dbfb9a86e48b34c',1,'operations_on_datastructures::trie_operations::Tnode']]],
-  ['seconds_33',['seconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::seconds'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::seconds::seconds()']]],
-  ['seed_34',['seed',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937_64::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux24_base::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux48::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::discard_block_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mersenne_twister_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/seed.html',0,'std::independent_bits_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux48_base::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::shuffle_order_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux24::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::linear_congruential_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::knuth_b::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand0::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::subtract_with_carry_engine::seed()']]],
-  ['seed_5fseq_35',['seed_seq',['http://en.cppreference.com/w/cpp/numeric/random/seed_seq.html',0,'std::seed_seq'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/seed_seq.html',0,'std::seed_seq::seed_seq()']]],
-  ['seekg_36',['seekg',['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::fstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_fstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::iostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wistream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::stringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wifstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_istream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::strstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_stringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istrstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wiostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_istringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_ifstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wfstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_iostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wstringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wistringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::ifstream::seekg()']]],
-  ['seekoff_37',['seekoff',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_filebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::stringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wfilebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstreambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::strstreambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_stringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_streambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::filebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::streambuf::seekoff()']]],
-  ['seekp_38',['seekp',['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::fstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_fstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::iostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::stringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::strstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_stringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wiostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostrstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wfstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_iostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wstringstream::seekp()']]],
-  ['seekpos_39',['seekpos',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_filebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::stringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wfilebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstreambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::strstreambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_stringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_streambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::filebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::streambuf::seekpos()']]],
-  ['segment_5ftree_2ecpp_40',['segment_tree.cpp',['../de/dd1/segment__tree_8cpp.html',1,'']]],
-  ['segmentintersection_41',['SegmentIntersection',['../d4/db4/struct_segment_intersection.html',1,'']]],
-  ['segmenttree_42',['SegmentTree',['../dd/d95/classdata__structures_1_1_segment_tree.html',1,'data_structures']]],
-  ['segtree_2ecpp_43',['segtree.cpp',['../d2/d45/segtree_8cpp.html',1,'']]],
-  ['select_5fon_5fcontainer_5fcopy_5fconstruction_44',['select_on_container_copy_construction',['http://en.cppreference.com/w/cpp/memory/allocator_traits/select_on_container_copy_construction.html',0,'std::allocator_traits::select_on_container_copy_construction()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/select_on_container_copy_construction.html',0,'std::scoped_allocator_adaptor::select_on_container_copy_construction()']]],
-  ['selection_5fsort_5frecursive_45',['selection_sort_recursive',['../df/d4a/namespaceselection__sort__recursive.html',1,'']]],
-  ['selection_5fsort_5frecursive_2ecpp_46',['selection_sort_recursive.cpp',['../d4/d9f/selection__sort__recursive_8cpp.html',1,'']]],
-  ['selectionsortrecursive_47',['selectionSortRecursive',['../d4/d9f/selection__sort__recursive_8cpp.html#ab6f7b33a070e376e1f4374e534435e89',1,'sorting::selection_sort_recursive']]],
-  ['selectiontop_5f3_48',['SelectionTop_3',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6',1,'operations_on_datastructures::trie_operations::Tnode']]],
-  ['self_20test_20examples_49',['Self-test examples',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30',1,'']]],
-  ['semi_5fimplicit_5feuler_50',['semi_implicit_euler',['../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089',1,'ode_semi_implicit_euler.cpp']]],
-  ['semi_5fimplicit_5feuler_5fstep_51',['semi_implicit_euler_step',['../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f',1,'ode_semi_implicit_euler.cpp']]],
-  ['sentry_52',['sentry',['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_fstream&lt; Char &gt;::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream&lt; Char &gt;::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_iostream&lt; Char &gt;::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream&lt; Char &gt;::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream&lt; Char &gt;::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream&lt; Char &gt;::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream&lt; Char &gt;::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream&lt; Char &gt;::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_stringstream&lt; Char &gt;::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::fstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::iostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::stringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::strstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wfstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wiostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wstringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::fstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_fstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::iostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::stringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::strstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_stringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wiostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wfstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_iostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wstringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry::sentry()']]],
-  ['set_53',['set',['http://en.cppreference.com/w/cpp/container/set.html',0,'std::set&lt; K &gt;'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119',1,'data_structures::BloomFilter::set'],['http://en.cppreference.com/w/cpp/container/set/set.html',0,'std::set::set()'],['http://en.cppreference.com/w/cpp/utility/bitset/set.html',0,'std::bitset::set()']]],
-  ['set_5fdifference_54',['set_difference',['http://en.cppreference.com/w/cpp/algorithm/set_difference.html',0,'std']]],
-  ['set_5fexception_55',['set_exception',['http://en.cppreference.com/w/cpp/thread/promise/set_exception.html',0,'std::promise']]],
-  ['set_5fexception_5fat_5fthread_5fexit_56',['set_exception_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/promise/set_exception_at_thread_exit.html',0,'std::promise']]],
-  ['set_5fintersection_57',['set_intersection',['http://en.cppreference.com/w/cpp/algorithm/set_intersection.html',0,'std']]],
-  ['set_5fkth_5fbit_2ecpp_58',['set_kth_bit.cpp',['../d5/db5/set__kth__bit_8cpp.html',1,'']]],
-  ['set_5fnew_5fhandler_59',['set_new_handler',['http://en.cppreference.com/w/cpp/memory/new/set_new_handler.html',0,'std']]],
-  ['set_5fnode_5fval_60',['set_node_val',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70',1,'range_queries::heavy_light_decomposition::Tree']]],
-  ['set_5frdbuf_61',['set_rdbuf',['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::fstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ios::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_fstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::iostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wistream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::stringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wifstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_istream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::strstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_stringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istrstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wiostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_istringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ifstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostrstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wfstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_iostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wstringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wistringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ifstream::set_rdbuf()']]],
-  ['set_5fsret_5finit_62',['set_sret_init',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ad3b942be27a1b0fe3cff6cb6edf01294',1,'range_queries::heavy_light_decomposition::SG']]],
-  ['set_5fsymmetric_5fdifference_63',['set_symmetric_difference',['http://en.cppreference.com/w/cpp/algorithm/set_symmetric_difference.html',0,'std']]],
-  ['set_5fterminate_64',['set_terminate',['http://en.cppreference.com/w/cpp/error/set_terminate.html',0,'std']]],
-  ['set_5funexpected_65',['set_unexpected',['http://en.cppreference.com/w/cpp/error/set_unexpected.html',0,'std']]],
-  ['set_5funion_66',['set_union',['http://en.cppreference.com/w/cpp/algorithm/set_union.html',0,'std']]],
-  ['set_5fvalue_67',['set_value',['http://en.cppreference.com/w/cpp/thread/promise/set_value.html',0,'std::promise']]],
-  ['set_5fvalue_5fat_5fthread_5fexit_68',['set_value_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/promise/set_value_at_thread_exit.html',0,'std::promise']]],
-  ['setbase_69',['setbase',['http://en.cppreference.com/w/cpp/io/manip/setbase.html',0,'std']]],
-  ['setbuf_70',['setbuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_filebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::stringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wfilebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstreambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::strstreambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_stringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_streambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::filebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::streambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/c/setbuf.html',0,'std::setbuf()']]],
-  ['setchild_71',['SetChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74',1,'data_structures::tree_234::Node']]],
-  ['setcount_72',['SetCount',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1',1,'data_structures::tree_234::Node']]],
-  ['setf_73',['setf',['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::fstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ios::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_fstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::iostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ios_base::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wistream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::stringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wifstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_istream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::strstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_stringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istrstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wiostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_istringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ifstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostrstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wfstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_iostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wstringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wistringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ifstream::setf()']]],
-  ['setfill_74',['setfill',['http://en.cppreference.com/w/cpp/io/manip/setfill.html',0,'std']]],
-  ['setg_75',['setg',['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_filebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wstringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::stringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wfilebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wstreambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::strstreambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_stringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_streambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::filebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::streambuf::setg()']]],
-  ['setiosflags_76',['setiosflags',['http://en.cppreference.com/w/cpp/io/manip/setiosflags.html',0,'std']]],
-  ['setitem_77',['SetItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc',1,'data_structures::tree_234::Node']]],
-  ['setkthbit_78',['setKthBit',['../d8/d88/namespaceset_kth_bit.html',1,'setKthBit'],['../d5/db5/set__kth__bit_8cpp.html#ad4d0ffd9331242c42a28834ee19f5fd9',1,'bit_manipulation::set_kth_bit::setKthBit()']]],
-  ['setlocale_79',['setlocale',['http://en.cppreference.com/w/cpp/locale/setlocale.html',0,'std']]],
-  ['setp_80',['setp',['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_filebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wstringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::stringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wfilebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wstreambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::strstreambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_stringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_streambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::filebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::streambuf::setp()']]],
-  ['setprecision_81',['setprecision',['http://en.cppreference.com/w/cpp/io/manip/setprecision.html',0,'std']]],
-  ['setsize_82',['setSize',['../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55',1,'dsu']]],
-  ['setstate_83',['setstate',['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::fstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ios::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_fstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::iostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wistream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::stringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wifstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_istream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::strstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_stringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istrstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wiostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_istringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ifstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostrstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wfstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_iostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wstringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wistringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ifstream::setstate()']]],
-  ['setvbuf_84',['setvbuf',['http://en.cppreference.com/w/cpp/io/c/setvbuf.html',0,'std']]],
-  ['setw_85',['setw',['http://en.cppreference.com/w/cpp/io/manip/setw.html',0,'std']]],
-  ['sg_86',['SG',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html',1,'range_queries::heavy_light_decomposition::SG&lt; X &gt;'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1',1,'range_queries::heavy_light_decomposition::SG::SG()']]],
-  ['sgetc_87',['sgetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_filebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wstringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::stringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wfilebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wstreambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::strstreambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_stringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_streambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::filebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::streambuf::sgetc()']]],
-  ['sgetn_88',['sgetn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_filebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::stringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wfilebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstreambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::strstreambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_stringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_streambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::filebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::streambuf::sgetn()']]],
-  ['sgn_89',['sgn',['../d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2',1,'bisection_method.cpp']]],
-  ['sha_90',['SHA',['../de/dd3/namespace_s_h_a.html',1,'']]],
-  ['sha1_2ecpp_91',['sha1.cpp',['../d8/d7a/sha1_8cpp.html',1,'']]],
-  ['sha256_92',['sha256',['../d4/d08/sha256_8cpp.html#a55475649a2bb7aae15de0716a217f43a',1,'hashing::sha256']]],
-  ['sha256_2ecpp_93',['sha256.cpp',['../d4/d08/sha256_8cpp.html',1,'']]],
-  ['share_94',['share',['http://en.cppreference.com/w/cpp/thread/future/share.html',0,'std::future']]],
-  ['shared_5ffrom_5fthis_95',['shared_from_this',['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/shared_from_this.html',0,'std::enable_shared_from_this']]],
-  ['shared_5ffuture_96',['shared_future',['http://en.cppreference.com/w/cpp/thread/shared_future.html',0,'std::shared_future'],['http://en.cppreference.com/w/cpp/thread/shared_future/shared_future.html',0,'std::shared_future::shared_future()']]],
-  ['shared_5flock_97',['shared_lock',['http://en.cppreference.com/w/cpp/thread/shared_lock.html',0,'std::shared_lock&lt; T &gt;'],['http://en.cppreference.com/w/cpp/thread/shared_lock/shared_lock.html',0,'std::shared_lock::shared_lock()']]],
-  ['shared_5fptr_98',['shared_ptr',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std::shared_ptr&lt; T &gt;'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/shared_ptr.html',0,'std::shared_ptr::shared_ptr()']]],
-  ['shared_5fptr_3c_20data_5fstructures_3a_3alinked_5flist_3a_3alink_20_3e_99',['shared_ptr&lt; data_structures::linked_list::link &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5fptr_3c_20data_5fstructures_3a_3anode_20_3e_100',['shared_ptr&lt; data_structures::Node &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5fptr_3c_20data_5fstructures_3a_3atrie_5fusing_5fhashmap_3a_3atrie_3a_3anode_20_3e_101',['shared_ptr&lt; data_structures::trie_using_hashmap::Trie::Node &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5fptr_3c_20machine_5flearning_3a_3aaystar_5fsearch_3a_3aaystarsearch_3a_3ainfo_20_3e_102',['shared_ptr&lt; machine_learning::aystar_search::AyStarSearch::Info &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5fptr_3c_20node_20_3e_103',['shared_ptr&lt; Node &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5fptr_3c_20node_3c_20value_5ftype_20_3e_20_3e_104',['shared_ptr&lt; Node&lt; value_type &gt; &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5fptr_3c_20node_3c_20valuetype_20_3e_20_3e_105',['shared_ptr&lt; Node&lt; ValueType &gt; &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5fptr_3c_20puzzle_20_3e_106',['shared_ptr&lt; Puzzle &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5fptr_3c_20range_5fqueries_3a_3apersegtree_3a_3anode_20_3e_107',['shared_ptr&lt; range_queries::perSegTree::Node &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5fptr_3c_20trie_3a_3atrienode_20_3e_108',['shared_ptr&lt; Trie::TrieNode &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5ftimed_5fmutex_109',['shared_timed_mutex',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex.html',0,'std::shared_timed_mutex'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/shared_timed_mutex.html',0,'std::shared_timed_mutex::shared_timed_mutex()']]],
-  ['shell_5fsort_110',['shell_sort',['../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa',1,'sorting::shell_sort(T *arr, size_t LEN)'],['../d5/d91/namespacesorting.html#a4d76603c54d3dc56146e92d10a043924',1,'sorting::shell_sort(T(&amp;arr)[N])'],['../d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331',1,'sorting::shell_sort(std::vector&lt; T &gt; *arr)']]],
-  ['shell_5fsort2_2ecpp_111',['shell_sort2.cpp',['../d4/d7a/shell__sort2_8cpp.html',1,'']]],
-  ['shift_5fleft_112',['shift_left',['../da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8',1,'operations_on_datastructures']]],
-  ['shift_5fright_113',['shift_right',['../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86',1,'operations_on_datastructures']]],
-  ['shortest_5fcommon_5fsupersequence_114',['shortest_common_supersequence',['../d3/deb/namespaceshortest__common__supersequence.html',1,'']]],
-  ['shortest_5fcommon_5fsupersequence_2ecpp_115',['shortest_common_supersequence.cpp',['../d7/d65/shortest__common__supersequence_8cpp.html',1,'']]],
-  ['shortest_5fpath_5fdistance_116',['Shortest_Path_Distance',['../d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6',1,'graph::bidirectional_dijkstra']]],
-  ['show_117',['show',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e',1,'data_structures::list_array::list::show()'],['../d2/dc8/classdata__structures_1_1_stack.html#abb86ed67d9d97112897a09cfb10ff586',1,'data_structures::Stack::show()'],['../db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed',1,'show():&#160;tower_of_hanoi.cpp'],['../d2/d26/count__inversions_8cpp.html#a851ca6a0391d14fb49a97d55e4377497',1,'sorting::inversion::show()'],['../d5/d4c/group__sorting.html#ga0a9a57a1f1bbba3d4822531d002b7e07',1,'show():&#160;merge_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#aeccefcf6fcca62c54939c5ec9a93109b',1,'sorting::quick_sort::show()']]],
-  ['show_5farray_118',['show_array',['../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859',1,'bogo_sort.cpp']]],
-  ['show_5fdata_119',['show_data',['../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246',1,'show_data(T *arr, size_t LEN):&#160;shell_sort2.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a63aaff7cabfa3da2da8b9477b5fad9d6',1,'show_data(T(&amp;arr)[N]):&#160;shell_sort2.cpp']]],
-  ['show_5fpascal_120',['show_pascal',['../dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c',1,'pascal_triangle.cpp']]],
-  ['showarray_121',['showArray',['../d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10',1,'sorting::random_pivot_quick_sort']]],
-  ['showbase_122',['showbase',['http://en.cppreference.com/w/cpp/io/manip/showbase.html',0,'std']]],
-  ['showmanyc_123',['showmanyc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_filebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wstringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::stringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wfilebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wstreambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::strstreambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_stringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_streambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::filebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::streambuf::showmanyc()']]],
-  ['showpoint_124',['showpoint',['http://en.cppreference.com/w/cpp/io/manip/showpoint.html',0,'std']]],
-  ['showpos_125',['showpos',['http://en.cppreference.com/w/cpp/io/manip/showpos.html',0,'std']]],
-  ['shrink_5fto_5ffit_126',['shrink_to_fit',['http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html',0,'std::vector::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/container/deque/shrink_to_fit.html',0,'std::deque::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::basic_string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::wstring::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u16string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u32string::shrink_to_fit()']]],
-  ['shuffle_127',['shuffle',['http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html',0,'std::shuffle()'],['../d5/d91/namespacesorting.html#a7bfe11bd4703eacd1dab93f25ec639c5',1,'sorting::shuffle()']]],
-  ['shuffle_5forder_5fengine_128',['shuffle_order_engine',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine.html',0,'std::shuffle_order_engine'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::shuffle_order_engine::shuffle_order_engine()']]],
-  ['side_129',['side',['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6',1,'graph::is_graph_bipartite::Graph']]],
-  ['sieve_130',['Sieve',['../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c',1,'primes_up_to_billion.cpp']]],
-  ['sieve_131',['sieve',['../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f',1,'math::sieve()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a22be949d160b26361f7e323310f7fa0c',1,'math::sieve_of_eratosthenes::sieve()']]],
-  ['sieve_5fof_5feratosthenes_132',['sieve_of_eratosthenes',['../d2/db0/namespacesieve__of__eratosthenes.html',1,'']]],
-  ['sieve_5fof_5feratosthenes_2ecpp_133',['sieve_of_eratosthenes.cpp',['../d8/ddf/sieve__of__eratosthenes_8cpp.html',1,'']]],
-  ['sieveoferatosthenes_134',['SieveOfEratosthenes',['../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099',1,'prime_factorization.cpp']]],
-  ['sig2hex_135',['sig2hex',['../d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348',1,'hashing::md5::sig2hex()'],['../d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228',1,'hashing::sha1::sig2hex()']]],
-  ['sig_5fatomic_5ft_136',['sig_atomic_t',['http://en.cppreference.com/w/cpp/utility/program/sig_atomic_t.html',0,'std']]],
-  ['sigmoid_137',['sigmoid',['../d2/d58/neural__network_8cpp.html#a23aa9d32bcbcd65cfc85f0a41e2afadc',1,'machine_learning::neural_network::activations']]],
-  ['signal_138',['signal',['http://en.cppreference.com/w/cpp/utility/program/signal.html',0,'std']]],
-  ['signaling_5fnan_139',['signaling_NaN',['http://en.cppreference.com/w/cpp/types/numeric_limits/signaling_NaN.html',0,'std::numeric_limits']]],
-  ['signbit_140',['signbit',['http://en.cppreference.com/w/cpp/numeric/math/signbit.html',0,'std']]],
-  ['simpson_5fmethod_141',['simpson_method',['../d3/d6d/namespacesimpson__method.html',1,'']]],
-  ['sin_142',['sin',['http://en.cppreference.com/w/cpp/numeric/math/sin.html',0,'std']]],
-  ['single_5fpredict_143',['single_predict',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f',1,'machine_learning::neural_network::NeuralNetwork']]],
-  ['sinh_144',['sinh',['http://en.cppreference.com/w/cpp/numeric/math/sinh.html',0,'std']]],
-  ['size_145',['size',['../dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3',1,'data_structures::SegmentTree::size'],['../d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e',1,'stack::size'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c',1,'data_structures::treap::Treap::size'],['http://en.cppreference.com/w/cpp/container/dynarray/size.html',0,'std::dynarray::size()'],['http://en.cppreference.com/w/cpp/container/vector/size.html',0,'std::vector::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::match_results::size()'],['http://en.cppreference.com/w/cpp/container/multiset/size.html',0,'std::multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::string::size()'],['http://en.cppreference.com/w/cpp/container/set/size.html',0,'std::set::size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/size.html',0,'std::unordered_map::size()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/size.html',0,'std::initializer_list::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wsmatch::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::smatch::size()'],['http://en.cppreference.com/w/cpp/container/stack/size.html',0,'std::stack::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/size.html',0,'std::unordered_multimap::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wcmatch::size()'],['http://en.cppreference.com/w/cpp/container/deque/size.html',0,'std::deque::size()'],['http://en.cppreference.com/w/cpp/container/queue/size.html',0,'std::queue::size()'],['http://en.cppreference.com/w/cpp/utility/bitset/size.html',0,'std::bitset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::basic_string::size()'],['http://en.cppreference.com/w/cpp/container/priority_queue/size.html',0,'std::priority_queue::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::wstring::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/size.html',0,'std::unordered_multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u16string::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u32string::size()'],['http://en.cppreference.com/w/cpp/container/list/size.html',0,'std::list::size()'],['http://en.cppreference.com/w/cpp/container/map/size.html',0,'std::map::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::cmatch::size()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/size.html',0,'std::seed_seq::size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/size.html',0,'std::unordered_set::size()'],['http://en.cppreference.com/w/cpp/container/multimap/size.html',0,'std::multimap::size()'],['http://en.cppreference.com/w/cpp/container/array/size.html',0,'std::array::size()'],['../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3',1,'binary_search_tree::size()'],['../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54',1,'data_structures::Bitset::size()'],['../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c',1,'dsu::size()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39',1,'data_structures::stack_using_queue::Stack::size()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1',1,'divide_and_conquer::strassens_multiplication::Matrix::size()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195',1,'others::Cache::LFUCache::size()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1',1,'others::Cache::LRUCache::size()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865',1,'range_queries::perSegTree::size()']]],
-  ['size_5f_146',['size_',['../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc',1,'binary_search_tree']]],
-  ['size_5ft_147',['size_t',['http://en.cppreference.com/w/cpp/types/size_t.html',0,'std']]],
-  ['skip_5flist_2ecpp_148',['skip_list.cpp',['../d0/d5a/skip__list_8cpp.html',1,'']]],
-  ['skiplist_149',['SkipList',['../d4/d90/classdata__structures_1_1_skip_list.html',1,'data_structures::SkipList'],['../d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4',1,'data_structures::SkipList::SkipList()']]],
-  ['skipws_150',['skipws',['http://en.cppreference.com/w/cpp/io/manip/skipws.html',0,'std']]],
-  ['sleep_151',['SLEEP',['../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6',1,'memory_game.cpp']]],
-  ['sleep_5ffor_152',['sleep_for',['http://en.cppreference.com/w/cpp/thread/sleep_for.html',0,'std::this_thread']]],
-  ['sleep_5funtil_153',['sleep_until',['http://en.cppreference.com/w/cpp/thread/sleep_until.html',0,'std::this_thread']]],
-  ['slice_154',['slice',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17',1,'divide_and_conquer::strassens_multiplication::Matrix']]],
-  ['smallest_5fcircle_2ecpp_155',['smallest_circle.cpp',['../d0/d01/smallest__circle_8cpp.html',1,'']]],
-  ['smatch_156',['smatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std::smatch'],['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::smatch::smatch()']]],
-  ['snextc_157',['snextc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_filebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wstringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::stringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wfilebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wstreambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::strstreambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_stringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_streambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::filebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::streambuf::snextc()']]],
-  ['snprintf_158',['snprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]],
-  ['solution_159',['Solution',['../dd/d4f/class_solution.html',1,'Solution'],['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4',1,'machine_learning::aystar_search::AyStarSearch::Solution()']]],
-  ['solve_160',['solve',['../d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9',1,'backtracking::knight_tour']]],
-  ['solvemaze_161',['solveMaze',['../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3',1,'backtracking::rat_maze']]],
-  ['solvenq_162',['solveNQ',['../d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb',1,'backtracking::n_queens']]],
-  ['solvesudoku_163',['solveSudoku',['../d3/d05/sudoku__solver_8cpp.html#ac911c8bca8556206ff64461b2424866b',1,'backtracking::sudoku_solver']]],
-  ['sort_164',['sort',['http://en.cppreference.com/w/cpp/container/forward_list/sort.html',0,'std::forward_list::sort()'],['http://en.cppreference.com/w/cpp/container/list/sort.html',0,'std::list::sort()'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180',1,'data_structures::list_array::list::sort()'],['http://en.cppreference.com/w/cpp/algorithm/sort.html',0,'std::sort()']]],
-  ['sort_20algorithm_20analysis_20best_20case_20worst_20case_20average_20case_165',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]],
-  ['sort_5fheap_166',['sort_heap',['http://en.cppreference.com/w/cpp/algorithm/sort_heap.html',0,'std']]],
-  ['sortcol_167',['sortcol',['../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec',1,'fcfs_scheduling.cpp']]],
-  ['sorting_168',['Sorting',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md67',1,'']]],
-  ['sorting_169',['sorting',['../d5/d91/namespacesorting.html',1,'']]],
-  ['sorting_20algorithm_170',['Sorting Algorithm',['../d5/d4c/group__sorting.html',1,'']]],
-  ['sparse_5fmatrix_2ecpp_171',['sparse_matrix.cpp',['../d3/d19/sparse__matrix_8cpp.html',1,'']]],
-  ['sparse_5ftable_172',['Sparse_table',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html',1,'data_structures::sparse_table']]],
-  ['sparse_5ftable_173',['sparse_table',['../d9/d55/namespacesparse__table.html',1,'']]],
-  ['sparse_5ftable_2ecpp_174',['sparse_table.cpp',['../d8/dab/sparse__table_8cpp.html',1,'']]],
-  ['sphere_5fsurface_5farea_175',['sphere_surface_area',['../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656',1,'math']]],
-  ['sphere_5fvolume_176',['sphere_volume',['../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551',1,'math']]],
-  ['spiral_5fprint_2ecpp_177',['spiral_print.cpp',['../db/d07/spiral__print_8cpp.html',1,'']]],
-  ['spiralprint_178',['spiralPrint',['../db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197',1,'spiral_print.cpp']]],
-  ['spirograph_179',['spirograph',['../da/dd3/namespacespirograph.html',1,'spirograph'],['../da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac',1,'spirograph::spirograph()']]],
-  ['spirograph_2ecpp_180',['spirograph.cpp',['../da/d77/spirograph_8cpp.html',1,'']]],
-  ['splice_181',['splice',['http://en.cppreference.com/w/cpp/container/list/splice.html',0,'std::list']]],
-  ['splice_5fafter_182',['splice_after',['http://en.cppreference.com/w/cpp/container/forward_list/splice_after.html',0,'std::forward_list']]],
-  ['splitnode_183',['SplitNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9',1,'data_structures::tree_234::Tree234']]],
-  ['sprintf_184',['sprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]],
-  ['sputbackc_185',['sputbackc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_filebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wstringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::stringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wfilebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wstreambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::strstreambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_stringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_streambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::filebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::streambuf::sputbackc()']]],
-  ['sputc_186',['sputc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_filebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wstringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::stringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wfilebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wstreambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::strstreambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_stringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_streambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::filebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::streambuf::sputc()']]],
-  ['sputn_187',['sputn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_filebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::stringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wfilebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstreambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::strstreambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_stringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_streambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::filebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::streambuf::sputn()']]],
-  ['sqrt_188',['Sqrt',['../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc',1,'sqrt_double.cpp']]],
-  ['sqrt_189',['sqrt',['http://en.cppreference.com/w/cpp/numeric/math/sqrt.html',0,'std']]],
-  ['sqrt_5fdouble_2ecpp_190',['sqrt_double.cpp',['../da/d24/sqrt__double_8cpp.html',1,'']]],
-  ['square_191',['square',['../d2/d58/neural__network_8cpp.html#a45d3e30406712ada3d9713ece3c1b153',1,'machine_learning::neural_network::util_functions']]],
-  ['square_5farea_192',['square_area',['../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049',1,'math']]],
-  ['square_5fperimeter_193',['square_perimeter',['../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14',1,'math']]],
-  ['srand_194',['srand',['http://en.cppreference.com/w/cpp/numeric/random/srand.html',0,'std']]],
-  ['sregex_5fiterator_195',['sregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::sregex_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::sregex_iterator::sregex_iterator()']]],
-  ['sregex_5ftoken_5fiterator_196',['sregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::sregex_token_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::sregex_token_iterator::sregex_token_iterator()']]],
-  ['sret_5finit_197',['sret_init',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5',1,'range_queries::heavy_light_decomposition::SG']]],
-  ['sscanf_198',['sscanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]],
-  ['ssub_5fmatch_199',['ssub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std::ssub_match'],['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::ssub_match::ssub_match()']]],
-  ['st_200',['ST',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81',1,'data_structures::sparse_table::Sparse_table']]],
-  ['stable_5fpartition_201',['stable_partition',['http://en.cppreference.com/w/cpp/algorithm/stable_partition.html',0,'std']]],
-  ['stable_5fsort_202',['stable_sort',['http://en.cppreference.com/w/cpp/algorithm/stable_sort.html',0,'std']]],
-  ['stack_203',['Stack',['../d2/dc8/classdata__structures_1_1_stack.html',1,'data_structures::Stack&lt; T &gt;'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html',1,'data_structures::stack_using_queue::Stack'],['../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html',1,'others::postfix_expression::Stack'],['../d2/dc8/classdata__structures_1_1_stack.html#a8cb0602c8a9c1603d0315938177ecc6a',1,'data_structures::Stack::Stack()']]],
-  ['stack_204',['stack',['../d1/dc2/classstack.html',1,'stack&lt; ValueType &gt;'],['http://en.cppreference.com/w/cpp/container/stack.html',0,'std::stack&lt; T &gt;'],['../d2/dc8/classdata__structures_1_1_stack.html#a3f912a0e9bed5b24b206584e3010dce3',1,'data_structures::Stack::stack'],['../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#af06360122e20ce2ba32c574a27a20ba1',1,'others::postfix_expression::Stack::stack'],['http://en.cppreference.com/w/cpp/container/stack/stack.html',0,'std::stack::stack()'],['../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7',1,'stack:&#160;paranthesis_matching.cpp']]],
-  ['stack_2ehpp_205',['stack.hpp',['../df/d47/stack_8hpp.html',1,'']]],
-  ['stack_5fidx_206',['stack_idx',['../dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f',1,'paranthesis_matching.cpp']]],
-  ['stack_5flinkedlist_207',['stack_linkedList',['../d2/dc4/classstack__linked_list.html',1,'']]],
-  ['stack_5fusing_5fqueue_208',['stack_using_queue',['../df/d1c/namespacestack__using__queue.html',1,'']]],
-  ['stackindex_209',['stackIndex',['../d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6',1,'data_structures::Stack']]],
-  ['stacksize_210',['stackSize',['../d2/dc8/classdata__structures_1_1_stack.html#a88a10062c0662a385f172669f2f19b86',1,'data_structures::Stack']]],
-  ['stacktop_211',['stackTop',['../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8',1,'stack::stackTop'],['../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#a6ae98710503b894b843d01cb69d5490c',1,'others::postfix_expression::Stack::stackTop']]],
-  ['stairs_5fpattern_2ecpp_212',['stairs_pattern.cpp',['../d5/def/stairs__pattern_8cpp.html',1,'']]],
-  ['standard_5fdeviation_213',['standard_deviation',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2',1,'probability::geometric_dist::geometric_distribution']]],
-  ['standard_5finvsqrt_214',['Standard_InvSqrt',['../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97',1,'inv_sqrt.cpp']]],
-  ['standards_215',['Our Standards',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md6',1,'']]],
-  ['startwith_216',['startwith',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17',1,'data_structures::trie_using_hashmap::Trie']]],
-  ['state_217',['state',['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/state.html',0,'std::wbuffer_convert::state()'],['http://en.cppreference.com/w/cpp/locale/wstring_convert/state.html',0,'std::wstring_convert::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::wstreampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::u16streampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::streampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::fpos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::u32streampos::state()']]],
-  ['state_5ftype_218',['state_type',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_byname::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf16::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8_utf16::state_type']]],
-  ['static_20code_20analyzer_219',['Static Code Analyzer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md38',1,'']]],
-  ['static_5fpointer_5fcast_220',['static_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]],
-  ['statistics_221',['statistics',['../d2/dcf/namespacestatistics.html',1,'']]],
-  ['stats_5fcomputer1_222',['stats_computer1',['../d7/d7c/classstatistics_1_1stats__computer1.html',1,'statistics']]],
-  ['stats_5fcomputer2_223',['stats_computer2',['../d8/dab/classstatistics_1_1stats__computer2.html',1,'statistics']]],
-  ['std_224',['std',['../d8/dcc/namespacestd.html',1,'std'],['../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1',1,'statistics::stats_computer1::std()'],['../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e',1,'statistics::stats_computer2::std()']]],
-  ['std_3a_3achrono_225',['chrono',['http://en.cppreference.com/w/d4/d0c/namespacestd_1_1chrono.html',0,'std']]],
-  ['std_3a_3aexperimental_226',['experimental',['http://en.cppreference.com/w/de/d97/namespacestd_1_1experimental.html',0,'std']]],
-  ['std_3a_3aregex_5fconstants_227',['regex_constants',['http://en.cppreference.com/w/db/da4/namespacestd_1_1regex__constants.html',0,'std']]],
-  ['std_3a_3arel_5fops_228',['rel_ops',['http://en.cppreference.com/w/da/d42/namespacestd_1_1rel__ops.html',0,'std']]],
-  ['std_3a_3athis_5fthread_229',['this_thread',['http://en.cppreference.com/w/d7/dbf/namespacestd_1_1this__thread.html',0,'std']]],
-  ['stddev_230',['stddev',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/params.html',0,'std::normal_distribution']]],
-  ['steady_5fclock_231',['steady_clock',['http://en.cppreference.com/w/cpp/chrono/steady_clock.html',0,'std::chrono']]],
-  ['step_5fith_232',['step_ith',['../d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9',1,'sorting::radix_sort']]],
-  ['stod_233',['stod',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]],
-  ['stof_234',['stof',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]],
-  ['stoi_235',['stoi',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]],
-  ['stol_236',['stol',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]],
-  ['stold_237',['stold',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]],
-  ['stoll_238',['stoll',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]],
-  ['stooge_5fsort_2ecpp_239',['stooge_sort.cpp',['../d4/d4f/stooge__sort_8cpp.html',1,'']]],
-  ['stoogesort_240',['stoogeSort',['../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b',1,'stooge_sort.cpp']]],
-  ['store_241',['store',['http://en.cppreference.com/w/cpp/atomic/atomic/store.html',0,'std::atomic']]],
-  ['store_20the_20address_20of_20parent_20nodes_242',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
-  ['stoul_243',['stoul',['http://en.cppreference.com/w/cpp/string/basic_string/stoul.html',0,'std']]],
-  ['stoull_244',['stoull',['http://en.cppreference.com/w/cpp/string/basic_string/stoul.html',0,'std']]],
-  ['str_245',['str',['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::match_results::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::basic_ostringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::wstringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::wsmatch::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wcsub_match::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::ostringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::stringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::smatch::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::stringstream::str()'],['http://en.cppreference.com/w/cpp/io/strstreambuf/str.html',0,'std::strstreambuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::wcmatch::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wssub_match::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::csub_match::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::basic_stringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::ssub_match::str()'],['http://en.cppreference.com/w/cpp/io/strstream/str.html',0,'std::strstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::basic_stringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::wostringstream::str()'],['http://en.cppreference.com/w/cpp/io/istrstream/str.html',0,'std::istrstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::basic_istringstream::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::cmatch::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::istringstream::str()'],['http://en.cppreference.com/w/cpp/io/ostrstream/str.html',0,'std::ostrstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::wstringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::wistringstream::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::sub_match::str()']]],
-  ['strand_246',['strand',['../d8/d1d/namespacestrand.html',1,'']]],
-  ['strand_5fsort_247',['strand_sort',['../dc/dd9/strand__sort_8cpp.html#a2bea2fe5dd38ed63610fdeaddf5785cd',1,'sorting::strand']]],
-  ['strand_5fsort_2ecpp_248',['strand_sort.cpp',['../dc/dd9/strand__sort_8cpp.html',1,'']]],
-  ['strassens_5fmultiplication_249',['strassens_multiplication',['../d3/d91/namespacestrassens__multiplication.html',1,'strassens_multiplication'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a',1,'divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication()']]],
-  ['strcat_250',['strcat',['http://en.cppreference.com/w/cpp/string/byte/strcat.html',0,'std']]],
-  ['strchr_251',['strchr',['http://en.cppreference.com/w/cpp/string/byte/strchr.html',0,'std']]],
-  ['strcmp_252',['strcmp',['http://en.cppreference.com/w/cpp/string/byte/strcmp.html',0,'std']]],
-  ['strcoll_253',['strcoll',['http://en.cppreference.com/w/cpp/string/byte/strcoll.html',0,'std']]],
-  ['strcpy_254',['strcpy',['http://en.cppreference.com/w/cpp/string/byte/strcpy.html',0,'std']]],
-  ['strcspn_255',['strcspn',['http://en.cppreference.com/w/cpp/string/byte/strcspn.html',0,'std']]],
-  ['streambuf_256',['streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf.html',0,'std::streambuf'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/basic_streambuf.html',0,'std::streambuf::streambuf()']]],
-  ['streamoff_257',['streamoff',['http://en.cppreference.com/w/cpp/io/streamoff.html',0,'std']]],
-  ['streampos_258',['streampos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]],
-  ['streamsize_259',['streamsize',['http://en.cppreference.com/w/cpp/io/streamsize.html',0,'std']]],
-  ['strerror_260',['strerror',['http://en.cppreference.com/w/cpp/string/byte/strerror.html',0,'std']]],
-  ['strftime_261',['strftime',['http://en.cppreference.com/w/cpp/chrono/c/strftime.html',0,'std']]],
-  ['string_262',['string',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std::string'],['../d6/dd6/namespacestring.html',1,'string'],['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::string::string()']]],
-  ['string_5ffibonacci_2ecpp_263',['string_fibonacci.cpp',['../de/d47/string__fibonacci_8cpp.html',1,'']]],
-  ['string_5fsearch_264',['string_search',['../d9/d03/namespacestring__search.html',1,'']]],
-  ['string_5ftype_265',['string_type',['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate::string_type'],['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate_byname::string_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages::string_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages_byname::string_type'],['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::string_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::string_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct::string_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct_byname::string_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct::string_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct_byname::string_type']]],
-  ['stringbuf_266',['stringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf.html',0,'std::stringbuf'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::stringbuf::stringbuf()']]],
-  ['strings_267',['Strings',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md68',1,'']]],
-  ['strings_268',['strings',['../df/dcb/namespacestrings.html',1,'']]],
-  ['strings_3a_3aboyer_5fmoore_269',['boyer_moore',['../d0/dbc/namespacestrings_1_1boyer__moore.html',1,'strings']]],
-  ['stringstream_270',['stringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std::stringstream'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::stringstream::stringstream()']]],
-  ['strkey_271',['STRKEY',['../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216',1,'ciphers']]],
-  ['strlen_272',['strlen',['http://en.cppreference.com/w/cpp/string/byte/strlen.html',0,'std']]],
-  ['strncat_273',['strncat',['http://en.cppreference.com/w/cpp/string/byte/strncat.html',0,'std']]],
-  ['strncmp_274',['strncmp',['http://en.cppreference.com/w/cpp/string/byte/strncmp.html',0,'std']]],
-  ['strncpy_275',['strncpy',['http://en.cppreference.com/w/cpp/string/byte/strncpy.html',0,'std']]],
-  ['strpbrk_276',['strpbrk',['http://en.cppreference.com/w/cpp/string/byte/strpbrk.html',0,'std']]],
-  ['strrchr_277',['strrchr',['http://en.cppreference.com/w/cpp/string/byte/strrchr.html',0,'std']]],
-  ['strspn_278',['strspn',['http://en.cppreference.com/w/cpp/string/byte/strspn.html',0,'std']]],
-  ['strstr_279',['strstr',['http://en.cppreference.com/w/cpp/string/byte/strstr.html',0,'std']]],
-  ['strstream_280',['strstream',['http://en.cppreference.com/w/cpp/io/strstream.html',0,'std::strstream'],['http://en.cppreference.com/w/cpp/io/strstream/strstream.html',0,'std::strstream::strstream()']]],
-  ['strstreambuf_281',['strstreambuf',['http://en.cppreference.com/w/cpp/io/strstreambuf.html',0,'std::strstreambuf'],['http://en.cppreference.com/w/cpp/io/strstreambuf/strstreambuf.html',0,'std::strstreambuf::strstreambuf()']]],
-  ['strtod_282',['strtod',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]],
-  ['strtof_283',['strtof',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]],
-  ['strtoimax_284',['strtoimax',['http://en.cppreference.com/w/cpp/string/byte/strtoimax.html',0,'std']]],
-  ['strtok_285',['strtok',['http://en.cppreference.com/w/cpp/string/byte/strtok.html',0,'std']]],
-  ['strtol_286',['strtol',['http://en.cppreference.com/w/cpp/string/byte/strtol.html',0,'std']]],
-  ['strtold_287',['strtold',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]],
-  ['strtoll_288',['strtoll',['http://en.cppreference.com/w/cpp/string/byte/strtol.html',0,'std']]],
-  ['strtoul_289',['strtoul',['http://en.cppreference.com/w/cpp/string/byte/strtoul.html',0,'std']]],
-  ['strtoull_290',['strtoull',['http://en.cppreference.com/w/cpp/string/byte/strtoul.html',0,'std']]],
-  ['strtoumax_291',['strtoumax',['http://en.cppreference.com/w/cpp/string/byte/strtoimax.html',0,'std']]],
-  ['structure_20of_20a_20program_292',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]],
-  ['structure_20used_293',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md98',1,'']]],
-  ['structures_294',['Data Structures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49',1,'']]],
-  ['struzik_5fsearch_295',['struzik_search',['../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208',1,'exponential_search.cpp']]],
-  ['strxfrm_296',['strxfrm',['http://en.cppreference.com/w/cpp/string/byte/strxfrm.html',0,'std']]],
-  ['student_5ft_5fdistribution_297',['student_t_distribution',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution.html',0,'std::student_t_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/student_t_distribution.html',0,'std::student_t_distribution::student_t_distribution()']]],
-  ['style_20convention_298',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]],
-  ['style_20conventions_299',['Code style conventions',['../dc/d64/md__coding_guidelines.html#autotoc_md20',1,'']]],
-  ['sub_5fmatch_300',['sub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std::sub_match'],['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::sub_match::sub_match()']]],
-  ['subarray_5fsum_301',['subarray_sum',['../df/d74/namespacesubarray__sum.html',1,'subarray_sum'],['../df/d94/subarray__sum_8cpp.html#af5687bbd9faf927fbd363c71e0baba5e',1,'backtracking::subarray_sum::subarray_sum()']]],
-  ['subarray_5fsum_2ecpp_302',['subarray_sum.cpp',['../df/d94/subarray__sum_8cpp.html',1,'']]],
-  ['sublist_5fsearch_303',['sublist_search',['../d9/def/namespacesublist__search.html',1,'']]],
-  ['sublist_5fsearch_2ecpp_304',['sublist_search.cpp',['../d5/d45/sublist__search_8cpp.html',1,'']]],
-  ['sublistsearch_305',['sublistSearch',['../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c',1,'search::sublist_search']]],
-  ['subset_5fsum_306',['subset_sum',['../dc/d3a/namespacesubset__sum.html',1,'']]],
-  ['subset_5fsum_2ecpp_307',['subset_sum.cpp',['../d2/d5a/subset__sum_8cpp.html',1,'']]],
-  ['subset_5fsum_5fdynamic_2ecpp_308',['subset_sum_dynamic.cpp',['../dc/d67/subset__sum__dynamic_8cpp.html',1,'']]],
-  ['subset_5fsum_5fproblem_309',['subset_sum_problem',['../dc/d67/subset__sum__dynamic_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50',1,'dynamic_programming::subset_sum']]],
-  ['subset_5fsum_5frecursion_310',['subset_sum_recursion',['../dc/d67/subset__sum__dynamic_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607',1,'dynamic_programming::subset_sum']]],
-  ['subsets_311',['Subsets',['../de/d95/namespace_subsets.html',1,'']]],
-  ['substr_312',['substr',['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::basic_string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::wstring::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u16string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u32string::substr()']]],
-  ['subtract_5fwith_5fcarry_5fengine_313',['subtract_with_carry_engine',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std::subtract_with_carry_engine'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::subtract_with_carry_engine::subtract_with_carry_engine()']]],
-  ['subtree_314',['subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'Case 2: The given node does not have a right node/subtree']]],
-  ['succ_315',['succ',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3',1,'data_structures::linked_list::link']]],
-  ['successive_5fapproximation_2ecpp_316',['successive_approximation.cpp',['../df/dc8/successive__approximation_8cpp.html',1,'']]],
-  ['sudoku_5fsolver_317',['sudoku_solver',['../d8/d9f/namespacesudoku__solver.html',1,'']]],
-  ['sudoku_5fsolver_2ecpp_318',['sudoku_solver.cpp',['../d3/d05/sudoku__solver_8cpp.html',1,'']]],
-  ['suffix_319',['suffix',['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::match_results::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wsmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::smatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wcmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::cmatch::suffix()']]],
-  ['suggestautocomplete_320',['SuggestAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe',1,'operations_on_datastructures::trie_operations::Tnode']]],
-  ['suggestfreqautocomplete_321',['SuggestFreqAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c',1,'operations_on_datastructures::trie_operations::Tnode']]],
-  ['sum_322',['sum',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd',1,'range_queries::fenwick_tree::sum()'],['../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35',1,'machine_learning::sum()']]],
-  ['sum_5fof_5fbinomial_5fcoefficient_2ecpp_323',['sum_of_binomial_coefficient.cpp',['../d4/d9d/sum__of__binomial__coefficient_8cpp.html',1,'']]],
-  ['sum_5fof_5fdigits_324',['sum_of_digits',['../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395',1,'sum_of_digits.cpp']]],
-  ['sum_5fof_5fdigits_2ecpp_325',['sum_of_digits.cpp',['../d4/d83/sum__of__digits_8cpp.html',1,'']]],
-  ['sum_5fof_5fdivisor_326',['sum_of_divisor',['../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a',1,'math']]],
-  ['sum_5frange_327',['sum_range',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe',1,'range_queries::fenwick_tree']]],
-  ['summary_328',['summary',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931',1,'machine_learning::neural_network::NeuralNetwork']]],
-  ['sungetc_329',['sungetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wfilebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::strstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_streambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::streambuf::sungetc()']]],
-  ['swap_330',['swap',['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::fstream::swap()'],['http://en.cppreference.com/w/cpp/container/vector/swap.html',0,'std::vector::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::match_results::swap()'],['http://en.cppreference.com/w/cpp/container/multiset/swap.html',0,'std::multiset::swap()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/swap.html',0,'std::weak_ptr::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostream::swap()'],['http://en.cppreference.com/w/cpp/container/set/swap.html',0,'std::set::swap()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/swap.html',0,'std::unique_lock::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostringstream::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::regex::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_map/swap.html',0,'std::unordered_map::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::basic_regex::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_filebuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstringbuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ios::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wsmatch::swap()'],['http://en.cppreference.com/w/cpp/utility/tuple/swap.html',0,'std::tuple::swap()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/swap.html',0,'std::shared_ptr::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_fstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::stringbuf::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::wregex::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::smatch::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wfilebuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::iostream::swap()'],['http://en.cppreference.com/w/cpp/container/stack/swap.html',0,'std::stack::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstreambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::stringstream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/swap.html',0,'std::unordered_multimap::swap()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/swap.html',0,'std::unique_ptr::swap()'],['http://en.cppreference.com/w/cpp/container/forward_list/swap.html',0,'std::forward_list::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::strstreambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostream::swap()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/swap.html',0,'std::shared_lock::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wcmatch::swap()'],['http://en.cppreference.com/w/cpp/utility/pair/swap.html',0,'std::pair::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wifstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_stringbuf::swap()'],['http://en.cppreference.com/w/cpp/container/deque/swap.html',0,'std::deque::swap()'],['http://en.cppreference.com/w/cpp/thread/promise/swap.html',0,'std::promise::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::strstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_streambuf::swap()'],['http://en.cppreference.com/w/cpp/container/queue/swap.html',0,'std::queue::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_stringstream::swap()'],['http://en.cppreference.com/w/cpp/thread/thread/swap.html',0,'std::thread::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::basic_string::swap()'],['http://en.cppreference.com/w/cpp/container/priority_queue/swap.html',0,'std::priority_queue::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostringstream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::wstring::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istrstream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/swap.html',0,'std::unordered_multiset::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostream::swap()'],['http://en.cppreference.com/w/cpp/utility/functional/function/swap.html',0,'std::function::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::filebuf::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u16string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wiostream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u32string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ifstream::swap()'],['http://en.cppreference.com/w/cpp/container/list/swap.html',0,'std::list::swap()'],['http://en.cppreference.com/w/cpp/container/map/swap.html',0,'std::map::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::cmatch::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::streambuf::swap()'],['http://en.cppreference.com/w/cpp/experimental/optional/swap.html',0,'std::experimental::optional::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostrstream::swap()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/swap.html',0,'std::packaged_task::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_set/swap.html',0,'std::unordered_set::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wfstream::swap()'],['http://en.cppreference.com/w/cpp/container/multimap/swap.html',0,'std::multimap::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_iostream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wstringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ifstream::swap()'],['http://en.cppreference.com/w/cpp/container/array/swap.html',0,'std::array::swap()'],['http://en.cppreference.com/w/cpp/algorithm/swap.html',0,'std::swap(T... args)']]],
-  ['swap_5franges_331',['swap_ranges',['http://en.cppreference.com/w/cpp/algorithm/swap_ranges.html',0,'std']]],
-  ['swprintf_332',['swprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]],
-  ['swscanf_333',['swscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]],
-  ['sync_334',['sync',['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wfilebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::strstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::strstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istrstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wiostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_ifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wfstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wstringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::ifstream::sync()']]],
-  ['sync_5fwith_5fstdio_335',['sync_with_stdio',['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ios::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ios_base::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::strstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wiostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wfstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wstringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ifstream::sync_with_stdio()']]],
-  ['system_336',['system',['http://en.cppreference.com/w/cpp/utility/program/system.html',0,'std']]],
-  ['system_5fcategory_337',['system_category',['http://en.cppreference.com/w/cpp/error/system_category.html',0,'std']]],
-  ['system_5fclock_338',['system_clock',['http://en.cppreference.com/w/cpp/chrono/system_clock.html',0,'std::chrono']]],
-  ['system_5ferror_339',['system_error',['http://en.cppreference.com/w/cpp/error/system_error.html',0,'std::system_error'],['http://en.cppreference.com/w/cpp/error/system_error/system_error.html',0,'std::system_error::system_error()']]]
+  ['s_5fsize_0',['s_size',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ac6d912bbfafa3a7509f66bbc1729ca25',1,'range_queries::heavy_light_decomposition::SG']]],
+  ['s_5ftree_1',['s_tree',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afbf8a9cb9449d5ca844f4e141a801e6a',1,'range_queries::heavy_light_decomposition::SG']]],
+  ['saddleback_2',['saddleback',['../d0/dda/namespacesaddleback.html',1,'saddleback'],['../d3/d22/saddleback__search_8cpp.html#ad1e0ca34797d88490747c08eca70a2e6',1,'search::saddleback::saddleback()']]],
+  ['saddleback_5fsearch_2ecpp_3',['saddleback_search.cpp',['../d3/d22/saddleback__search_8cpp.html',1,'']]],
+  ['safe_5fsubstr_4',['safe_substr',['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aad9e3edfe156b59fc06a5585403fe0d6',1,'divide_and_conquer::karatsuba_algorithm']]],
+  ['sample_5ftest_5',['sample_test',['../de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6',1,'geometric_dist.cpp']]],
+  ['save_5f2d_5fdata_6',['save_2d_data',['../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c',1,'kohonen_som_topology.cpp']]],
+  ['save_5fexact_5fsolution_7',['save_exact_solution',['../db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0):&#160;ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0):&#160;ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0):&#160;ode_semi_implicit_euler.cpp']]],
+  ['save_5fmodel_8',['save_model',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4f14e473bb0722c6490b9dc8da5982aa',1,'machine_learning::neural_network::NeuralNetwork']]],
+  ['save_5fnd_5fdata_9',['save_nd_data',['../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67',1,'kohonen_som_trace.cpp']]],
+  ['save_5fu_5fmatrix_10',['save_u_matrix',['../d8/d77/namespacemachine__learning.html#aa72a53c88203fde278f1fe6c3afe5b07',1,'machine_learning']]],
+  ['schedule_11',['schedule',['../dd/dca/class_f_c_f_s.html#af2594e22a867b308e027623940193d46',1,'FCFS']]],
+  ['scheduleforfcfs_12',['scheduleForFcfs',['../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91',1,'FCFS']]],
+  ['scheduling_20algorithms_13',['Cpu Scheduling Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48',1,'']]],
+  ['scope_14',['Scope',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md8',1,'']]],
+  ['scs_15',['scs',['../d7/d65/shortest__common__supersequence_8cpp.html#ad2ee8d7e67da9f6eb85146b08dad95e6',1,'dynamic_programming::shortest_common_supersequence']]],
+  ['search_16',['Search',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md66',1,'']]],
+  ['search_17',['search',['../d9/dca/namespacesearch.html',1,'search'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ad3423f7518671351340932db3c24959a',1,'data_structures::linked_list::list::search()'],['../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206',1,'Trie::search()'],['../d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63',1,'data_structures::trie::search(const std::shared_ptr&lt; trie &gt; &amp;root, const std::string &amp;str, int index)'],['../d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d',1,'data_structures::trie::search(const std::string &amp;str, int index)'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f',1,'data_structures::trie_using_hashmap::Trie::search()'],['../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738',1,'strings::boyer_moore::search()']]],
+  ['search_20from_20the_20root_20node_18',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]],
+  ['searchelement_19',['searchElement',['../d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4',1,'data_structures::SkipList']]],
+  ['searchfreqsuggestions_20',['SearchFreqSuggestions',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503',1,'operations_on_datastructures::trie_operations::Tnode']]],
+  ['searchingprober_21',['searchingProber',['../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6',1,'double_hashing::searchingProber()'],['../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77',1,'linear_probing::searchingProber()'],['../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6',1,'quadratic_probing::searchingProber()']]],
+  ['searchpresence_22',['SearchPresence',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a4a624fcdf3c3beb2025d69f2cfda8023',1,'operations_on_datastructures::trie_operations::Tnode']]],
+  ['searchsuggestions_23',['SearchSuggestions',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a18b70172ca4fb2811dbfb9a86e48b34c',1,'operations_on_datastructures::trie_operations::Tnode']]],
+  ['segment_5ftree_2ecpp_24',['segment_tree.cpp',['../de/dd1/segment__tree_8cpp.html',1,'']]],
+  ['segmentintersection_25',['SegmentIntersection',['../d4/db4/struct_segment_intersection.html',1,'']]],
+  ['segmenttree_26',['SegmentTree',['../dd/d95/classdata__structures_1_1_segment_tree.html',1,'data_structures']]],
+  ['segtree_2ecpp_27',['segtree.cpp',['../d2/d45/segtree_8cpp.html',1,'']]],
+  ['selection_5fsort_5frecursive_28',['selection_sort_recursive',['../df/d4a/namespaceselection__sort__recursive.html',1,'']]],
+  ['selection_5fsort_5frecursive_2ecpp_29',['selection_sort_recursive.cpp',['../d4/d9f/selection__sort__recursive_8cpp.html',1,'']]],
+  ['selectionsortrecursive_30',['selectionSortRecursive',['../d4/d9f/selection__sort__recursive_8cpp.html#ab6f7b33a070e376e1f4374e534435e89',1,'sorting::selection_sort_recursive']]],
+  ['selectiontop_5f3_31',['SelectionTop_3',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6',1,'operations_on_datastructures::trie_operations::Tnode']]],
+  ['self_20test_20examples_32',['Self-test examples',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30',1,'']]],
+  ['semi_5fimplicit_5feuler_33',['semi_implicit_euler',['../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089',1,'ode_semi_implicit_euler.cpp']]],
+  ['semi_5fimplicit_5feuler_5fstep_34',['semi_implicit_euler_step',['../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f',1,'ode_semi_implicit_euler.cpp']]],
+  ['set_35',['set',['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119',1,'data_structures::BloomFilter']]],
+  ['set_5fkth_5fbit_2ecpp_36',['set_kth_bit.cpp',['../d5/db5/set__kth__bit_8cpp.html',1,'']]],
+  ['set_5fnode_5fval_37',['set_node_val',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70',1,'range_queries::heavy_light_decomposition::Tree']]],
+  ['set_5fsret_5finit_38',['set_sret_init',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ad3b942be27a1b0fe3cff6cb6edf01294',1,'range_queries::heavy_light_decomposition::SG']]],
+  ['setchild_39',['SetChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74',1,'data_structures::tree_234::Node']]],
+  ['setcount_40',['SetCount',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1',1,'data_structures::tree_234::Node']]],
+  ['setitem_41',['SetItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc',1,'data_structures::tree_234::Node']]],
+  ['setkthbit_42',['setKthBit',['../d8/d88/namespaceset_kth_bit.html',1,'setKthBit'],['../d5/db5/set__kth__bit_8cpp.html#ad4d0ffd9331242c42a28834ee19f5fd9',1,'bit_manipulation::set_kth_bit::setKthBit()']]],
+  ['setsize_43',['setSize',['../dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55',1,'dsu']]],
+  ['sg_44',['SG',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html',1,'range_queries::heavy_light_decomposition::SG&lt; X &gt;'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1',1,'range_queries::heavy_light_decomposition::SG::SG()']]],
+  ['sgn_45',['sgn',['../d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2',1,'bisection_method.cpp']]],
+  ['sha_46',['SHA',['../de/dd3/namespace_s_h_a.html',1,'']]],
+  ['sha1_2ecpp_47',['sha1.cpp',['../d8/d7a/sha1_8cpp.html',1,'']]],
+  ['sha256_48',['sha256',['../d4/d08/sha256_8cpp.html#a55475649a2bb7aae15de0716a217f43a',1,'hashing::sha256']]],
+  ['sha256_2ecpp_49',['sha256.cpp',['../d4/d08/sha256_8cpp.html',1,'']]],
+  ['shell_5fsort_50',['shell_sort',['../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa',1,'sorting::shell_sort(T *arr, size_t LEN)'],['../d5/d91/namespacesorting.html#a4d76603c54d3dc56146e92d10a043924',1,'sorting::shell_sort(T(&amp;arr)[N])'],['../d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331',1,'sorting::shell_sort(std::vector&lt; T &gt; *arr)']]],
+  ['shell_5fsort2_2ecpp_51',['shell_sort2.cpp',['../d4/d7a/shell__sort2_8cpp.html',1,'']]],
+  ['shift_5fleft_52',['shift_left',['../da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8',1,'operations_on_datastructures']]],
+  ['shift_5fright_53',['shift_right',['../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86',1,'operations_on_datastructures']]],
+  ['shortest_5fcommon_5fsupersequence_54',['shortest_common_supersequence',['../d3/deb/namespaceshortest__common__supersequence.html',1,'']]],
+  ['shortest_5fcommon_5fsupersequence_2ecpp_55',['shortest_common_supersequence.cpp',['../d7/d65/shortest__common__supersequence_8cpp.html',1,'']]],
+  ['shortest_5fpath_5fdistance_56',['Shortest_Path_Distance',['../d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6',1,'graph::bidirectional_dijkstra']]],
+  ['show_57',['show',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e',1,'data_structures::list_array::list::show()'],['../d2/dc8/classdata__structures_1_1_stack.html#abb86ed67d9d97112897a09cfb10ff586',1,'data_structures::Stack::show()'],['../db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed',1,'show():&#160;tower_of_hanoi.cpp'],['../d2/d26/count__inversions_8cpp.html#a851ca6a0391d14fb49a97d55e4377497',1,'sorting::inversion::show()'],['../d5/d4c/group__sorting.html#ga0a9a57a1f1bbba3d4822531d002b7e07',1,'show():&#160;merge_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#aeccefcf6fcca62c54939c5ec9a93109b',1,'sorting::quick_sort::show()']]],
+  ['show_5farray_58',['show_array',['../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859',1,'bogo_sort.cpp']]],
+  ['show_5fdata_59',['show_data',['../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246',1,'show_data(T *arr, size_t LEN):&#160;shell_sort2.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a63aaff7cabfa3da2da8b9477b5fad9d6',1,'show_data(T(&amp;arr)[N]):&#160;shell_sort2.cpp']]],
+  ['show_5fpascal_60',['show_pascal',['../dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c',1,'pascal_triangle.cpp']]],
+  ['showarray_61',['showArray',['../d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10',1,'sorting::random_pivot_quick_sort']]],
+  ['shuffle_62',['shuffle',['../d5/d91/namespacesorting.html#a7bfe11bd4703eacd1dab93f25ec639c5',1,'sorting']]],
+  ['side_63',['side',['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6',1,'graph::is_graph_bipartite::Graph']]],
+  ['sieve_64',['Sieve',['../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c',1,'primes_up_to_billion.cpp']]],
+  ['sieve_65',['sieve',['../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f',1,'math::sieve()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a22be949d160b26361f7e323310f7fa0c',1,'math::sieve_of_eratosthenes::sieve()']]],
+  ['sieve_5fof_5feratosthenes_66',['sieve_of_eratosthenes',['../d2/db0/namespacesieve__of__eratosthenes.html',1,'']]],
+  ['sieve_5fof_5feratosthenes_2ecpp_67',['sieve_of_eratosthenes.cpp',['../d8/ddf/sieve__of__eratosthenes_8cpp.html',1,'']]],
+  ['sieveoferatosthenes_68',['SieveOfEratosthenes',['../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099',1,'prime_factorization.cpp']]],
+  ['sig2hex_69',['sig2hex',['../d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348',1,'hashing::md5::sig2hex()'],['../d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228',1,'hashing::sha1::sig2hex()']]],
+  ['sigmoid_70',['sigmoid',['../d2/d58/neural__network_8cpp.html#a23aa9d32bcbcd65cfc85f0a41e2afadc',1,'machine_learning::neural_network::activations']]],
+  ['simpson_5fmethod_71',['simpson_method',['../d3/d6d/namespacesimpson__method.html',1,'']]],
+  ['single_5fpredict_72',['single_predict',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f',1,'machine_learning::neural_network::NeuralNetwork']]],
+  ['size_73',['size',['../dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3',1,'data_structures::SegmentTree::size'],['../d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e',1,'stack::size'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c',1,'data_structures::treap::Treap::size'],['../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3',1,'binary_search_tree::size()'],['../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54',1,'data_structures::Bitset::size()'],['../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c',1,'dsu::size()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39',1,'data_structures::stack_using_queue::Stack::size()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1',1,'divide_and_conquer::strassens_multiplication::Matrix::size()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195',1,'others::Cache::LFUCache::size()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1',1,'others::Cache::LRUCache::size()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865',1,'range_queries::perSegTree::size()']]],
+  ['size_5f_74',['size_',['../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc',1,'binary_search_tree']]],
+  ['skip_5flist_2ecpp_75',['skip_list.cpp',['../d0/d5a/skip__list_8cpp.html',1,'']]],
+  ['skiplist_76',['SkipList',['../d4/d90/classdata__structures_1_1_skip_list.html',1,'data_structures::SkipList'],['../d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4',1,'data_structures::SkipList::SkipList()']]],
+  ['sleep_77',['SLEEP',['../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6',1,'memory_game.cpp']]],
+  ['slice_78',['slice',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17',1,'divide_and_conquer::strassens_multiplication::Matrix']]],
+  ['smallest_5fcircle_2ecpp_79',['smallest_circle.cpp',['../d0/d01/smallest__circle_8cpp.html',1,'']]],
+  ['solution_80',['Solution',['../dd/d4f/class_solution.html',1,'Solution'],['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4',1,'machine_learning::aystar_search::AyStarSearch::Solution()']]],
+  ['solve_81',['solve',['../d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9',1,'backtracking::knight_tour']]],
+  ['solvemaze_82',['solveMaze',['../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3',1,'backtracking::rat_maze']]],
+  ['solvenq_83',['solveNQ',['../d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb',1,'backtracking::n_queens']]],
+  ['solvesudoku_84',['solveSudoku',['../d3/d05/sudoku__solver_8cpp.html#ac911c8bca8556206ff64461b2424866b',1,'backtracking::sudoku_solver']]],
+  ['sort_85',['sort',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180',1,'data_structures::list_array::list']]],
+  ['sort_20algorithm_20analysis_20best_20case_20worst_20case_20average_20case_86',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]],
+  ['sortcol_87',['sortcol',['../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec',1,'fcfs_scheduling.cpp']]],
+  ['sorting_88',['Sorting',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md67',1,'']]],
+  ['sorting_89',['sorting',['../d5/d91/namespacesorting.html',1,'']]],
+  ['sorting_20algorithm_90',['Sorting Algorithm',['../d5/d4c/group__sorting.html',1,'']]],
+  ['sparse_5fmatrix_2ecpp_91',['sparse_matrix.cpp',['../d3/d19/sparse__matrix_8cpp.html',1,'']]],
+  ['sparse_5ftable_92',['Sparse_table',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html',1,'data_structures::sparse_table']]],
+  ['sparse_5ftable_93',['sparse_table',['../d9/d55/namespacesparse__table.html',1,'']]],
+  ['sparse_5ftable_2ecpp_94',['sparse_table.cpp',['../d8/dab/sparse__table_8cpp.html',1,'']]],
+  ['sphere_5fsurface_5farea_95',['sphere_surface_area',['../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656',1,'math']]],
+  ['sphere_5fvolume_96',['sphere_volume',['../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551',1,'math']]],
+  ['spiral_5fprint_2ecpp_97',['spiral_print.cpp',['../db/d07/spiral__print_8cpp.html',1,'']]],
+  ['spiralprint_98',['spiralPrint',['../db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197',1,'spiral_print.cpp']]],
+  ['spirograph_99',['spirograph',['../da/dd3/namespacespirograph.html',1,'spirograph'],['../da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac',1,'spirograph::spirograph()']]],
+  ['spirograph_2ecpp_100',['spirograph.cpp',['../da/d77/spirograph_8cpp.html',1,'']]],
+  ['splitnode_101',['SplitNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9',1,'data_structures::tree_234::Tree234']]],
+  ['sqrt_102',['Sqrt',['../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc',1,'sqrt_double.cpp']]],
+  ['sqrt_5fdouble_2ecpp_103',['sqrt_double.cpp',['../da/d24/sqrt__double_8cpp.html',1,'']]],
+  ['square_104',['square',['../d2/d58/neural__network_8cpp.html#a45d3e30406712ada3d9713ece3c1b153',1,'machine_learning::neural_network::util_functions']]],
+  ['square_5farea_105',['square_area',['../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049',1,'math']]],
+  ['square_5fperimeter_106',['square_perimeter',['../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14',1,'math']]],
+  ['sret_5finit_107',['sret_init',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5',1,'range_queries::heavy_light_decomposition::SG']]],
+  ['st_108',['ST',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81',1,'data_structures::sparse_table::Sparse_table']]],
+  ['stack_109',['Stack',['../d2/dc8/classdata__structures_1_1_stack.html',1,'data_structures::Stack&lt; T &gt;'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html',1,'data_structures::stack_using_queue::Stack'],['../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html',1,'others::postfix_expression::Stack'],['../d2/dc8/classdata__structures_1_1_stack.html#a8cb0602c8a9c1603d0315938177ecc6a',1,'data_structures::Stack::Stack()']]],
+  ['stack_110',['stack',['../d1/dc2/classstack.html',1,'stack&lt; ValueType &gt;'],['../d2/dc8/classdata__structures_1_1_stack.html#a3f912a0e9bed5b24b206584e3010dce3',1,'data_structures::Stack::stack'],['../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#af06360122e20ce2ba32c574a27a20ba1',1,'others::postfix_expression::Stack::stack'],['../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7',1,'stack:&#160;paranthesis_matching.cpp']]],
+  ['stack_2ehpp_111',['stack.hpp',['../df/d47/stack_8hpp.html',1,'']]],
+  ['stack_5fidx_112',['stack_idx',['../dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f',1,'paranthesis_matching.cpp']]],
+  ['stack_5flinkedlist_113',['stack_linkedList',['../d2/dc4/classstack__linked_list.html',1,'']]],
+  ['stack_5fusing_5fqueue_114',['stack_using_queue',['../df/d1c/namespacestack__using__queue.html',1,'']]],
+  ['stackindex_115',['stackIndex',['../d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6',1,'data_structures::Stack']]],
+  ['stacksize_116',['stackSize',['../d2/dc8/classdata__structures_1_1_stack.html#a88a10062c0662a385f172669f2f19b86',1,'data_structures::Stack']]],
+  ['stacktop_117',['stackTop',['../d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8',1,'stack::stackTop'],['../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#a6ae98710503b894b843d01cb69d5490c',1,'others::postfix_expression::Stack::stackTop']]],
+  ['stairs_5fpattern_2ecpp_118',['stairs_pattern.cpp',['../d5/def/stairs__pattern_8cpp.html',1,'']]],
+  ['standard_5fdeviation_119',['standard_deviation',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2',1,'probability::geometric_dist::geometric_distribution']]],
+  ['standard_5finvsqrt_120',['Standard_InvSqrt',['../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97',1,'inv_sqrt.cpp']]],
+  ['standards_121',['Our Standards',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md6',1,'']]],
+  ['startwith_122',['startwith',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17',1,'data_structures::trie_using_hashmap::Trie']]],
+  ['static_20code_20analyzer_123',['Static Code Analyzer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md38',1,'']]],
+  ['statistics_124',['statistics',['../d2/dcf/namespacestatistics.html',1,'']]],
+  ['stats_5fcomputer1_125',['stats_computer1',['../d7/d7c/classstatistics_1_1stats__computer1.html',1,'statistics']]],
+  ['stats_5fcomputer2_126',['stats_computer2',['../d8/dab/classstatistics_1_1stats__computer2.html',1,'statistics']]],
+  ['std_127',['std',['../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1',1,'statistics::stats_computer1::std()'],['../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e',1,'statistics::stats_computer2::std()']]],
+  ['step_5fith_128',['step_ith',['../d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9',1,'sorting::radix_sort']]],
+  ['stooge_5fsort_2ecpp_129',['stooge_sort.cpp',['../d4/d4f/stooge__sort_8cpp.html',1,'']]],
+  ['stoogesort_130',['stoogeSort',['../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b',1,'stooge_sort.cpp']]],
+  ['store_20the_20address_20of_20parent_20nodes_131',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
+  ['strand_132',['strand',['../d8/d1d/namespacestrand.html',1,'']]],
+  ['strand_5fsort_133',['strand_sort',['../dc/dd9/strand__sort_8cpp.html#a2bea2fe5dd38ed63610fdeaddf5785cd',1,'sorting::strand']]],
+  ['strand_5fsort_2ecpp_134',['strand_sort.cpp',['../dc/dd9/strand__sort_8cpp.html',1,'']]],
+  ['strassens_5fmultiplication_135',['strassens_multiplication',['../d3/d91/namespacestrassens__multiplication.html',1,'strassens_multiplication'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a',1,'divide_and_conquer::strassens_multiplication::Matrix::strassens_multiplication()']]],
+  ['string_136',['string',['../d6/dd6/namespacestring.html',1,'']]],
+  ['string_5ffibonacci_2ecpp_137',['string_fibonacci.cpp',['../de/d47/string__fibonacci_8cpp.html',1,'']]],
+  ['string_5fsearch_138',['string_search',['../d9/d03/namespacestring__search.html',1,'']]],
+  ['strings_139',['Strings',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md68',1,'']]],
+  ['strings_140',['strings',['../df/dcb/namespacestrings.html',1,'']]],
+  ['strings_3a_3aboyer_5fmoore_141',['boyer_moore',['../d0/dbc/namespacestrings_1_1boyer__moore.html',1,'strings']]],
+  ['strkey_142',['STRKEY',['../d6/d4e/namespaceciphers.html#ab9aec0ccf4b6809f652bb540be87c216',1,'ciphers']]],
+  ['structure_20of_20a_20program_143',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]],
+  ['structure_20used_144',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md98',1,'']]],
+  ['structures_145',['Data Structures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49',1,'']]],
+  ['struzik_5fsearch_146',['struzik_search',['../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208',1,'exponential_search.cpp']]],
+  ['style_20convention_147',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]],
+  ['style_20conventions_148',['Code style conventions',['../dc/d64/md__coding_guidelines.html#autotoc_md20',1,'']]],
+  ['subarray_5fsum_149',['subarray_sum',['../df/d74/namespacesubarray__sum.html',1,'subarray_sum'],['../df/d94/subarray__sum_8cpp.html#af5687bbd9faf927fbd363c71e0baba5e',1,'backtracking::subarray_sum::subarray_sum()']]],
+  ['subarray_5fsum_2ecpp_150',['subarray_sum.cpp',['../df/d94/subarray__sum_8cpp.html',1,'']]],
+  ['sublist_5fsearch_151',['sublist_search',['../d9/def/namespacesublist__search.html',1,'']]],
+  ['sublist_5fsearch_2ecpp_152',['sublist_search.cpp',['../d5/d45/sublist__search_8cpp.html',1,'']]],
+  ['sublistsearch_153',['sublistSearch',['../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c',1,'search::sublist_search']]],
+  ['subset_5fsum_154',['subset_sum',['../dc/d3a/namespacesubset__sum.html',1,'']]],
+  ['subset_5fsum_2ecpp_155',['subset_sum.cpp',['../d2/d5a/subset__sum_8cpp.html',1,'']]],
+  ['subset_5fsum_5fdynamic_2ecpp_156',['subset_sum_dynamic.cpp',['../dc/d67/subset__sum__dynamic_8cpp.html',1,'']]],
+  ['subset_5fsum_5fproblem_157',['subset_sum_problem',['../dc/d67/subset__sum__dynamic_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50',1,'dynamic_programming::subset_sum']]],
+  ['subset_5fsum_5frecursion_158',['subset_sum_recursion',['../dc/d67/subset__sum__dynamic_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607',1,'dynamic_programming::subset_sum']]],
+  ['subsets_159',['Subsets',['../de/d95/namespace_subsets.html',1,'']]],
+  ['subtree_160',['subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'Case 1: The given node has the right node/subtree'],['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'Case 2: The given node does not have a right node/subtree']]],
+  ['succ_161',['succ',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3',1,'data_structures::linked_list::link']]],
+  ['successive_5fapproximation_2ecpp_162',['successive_approximation.cpp',['../df/dc8/successive__approximation_8cpp.html',1,'']]],
+  ['sudoku_5fsolver_163',['sudoku_solver',['../d8/d9f/namespacesudoku__solver.html',1,'']]],
+  ['sudoku_5fsolver_2ecpp_164',['sudoku_solver.cpp',['../d3/d05/sudoku__solver_8cpp.html',1,'']]],
+  ['suggestautocomplete_165',['SuggestAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe',1,'operations_on_datastructures::trie_operations::Tnode']]],
+  ['suggestfreqautocomplete_166',['SuggestFreqAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c',1,'operations_on_datastructures::trie_operations::Tnode']]],
+  ['sum_167',['sum',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd',1,'range_queries::fenwick_tree::sum()'],['../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35',1,'machine_learning::sum()']]],
+  ['sum_5fof_5fbinomial_5fcoefficient_2ecpp_168',['sum_of_binomial_coefficient.cpp',['../d4/d9d/sum__of__binomial__coefficient_8cpp.html',1,'']]],
+  ['sum_5fof_5fdigits_169',['sum_of_digits',['../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395',1,'sum_of_digits.cpp']]],
+  ['sum_5fof_5fdigits_2ecpp_170',['sum_of_digits.cpp',['../d4/d83/sum__of__digits_8cpp.html',1,'']]],
+  ['sum_5fof_5fdivisor_171',['sum_of_divisor',['../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a',1,'math']]],
+  ['sum_5frange_172',['sum_range',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe',1,'range_queries::fenwick_tree']]],
+  ['summary_173',['summary',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931',1,'machine_learning::neural_network::NeuralNetwork']]]
 ];
diff --git a/search/all_19.js b/search/all_19.js
index 7c6d4a7d1..ed8edccce 100644
--- a/search/all_19.js
+++ b/search/all_19.js
@@ -1,6 +1,6 @@
 var searchData=
 [
-  ['t_0',['t',['../dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258',1,'data_structures::SegmentTree::t'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/params.html',0,'std::binomial_distribution::t()']]],
+  ['t_0',['t',['../dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258',1,'data_structures::SegmentTree']]],
   ['t_5fadj_1',['t_adj',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab1aeaefa1bd97b867c652ba916fbdb43',1,'range_queries::heavy_light_decomposition::Tree']]],
   ['t_5fdepth_2',['t_depth',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a0efd0b9c564092f443ca97030d866ef1',1,'range_queries::heavy_light_decomposition::Tree']]],
   ['t_5fmaxlift_3',['t_maxlift',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab2ab020f798d00be2613ecf63074b7c1',1,'range_queries::heavy_light_decomposition::Tree']]],
@@ -10,178 +10,118 @@ var searchData=
   ['t_5fsize_7',['t_size',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ada1494fccbc7f1f07b2f9be9f7e07ad5',1,'range_queries::heavy_light_decomposition::Tree']]],
   ['t_5fval_8',['t_val',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a135b7952593c9b1aae38fcaf1cc1abf7',1,'range_queries::heavy_light_decomposition::Tree']]],
   ['tail_9',['tail',['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a448121f391a71f4cf88c3cb6c4cf3100',1,'others::Cache::LRUCache']]],
-  ['tan_10',['tan',['http://en.cppreference.com/w/cpp/numeric/math/tan.html',0,'std']]],
-  ['tanh_11',['tanh',['http://en.cppreference.com/w/cpp/numeric/math/tanh.html',0,'std::tanh()'],['../d2/d58/neural__network_8cpp.html#a371aa7dd5d5add0143d1756bb0a1b32f',1,'machine_learning::neural_network::activations::tanh()']]],
-  ['target_12',['target',['http://en.cppreference.com/w/cpp/utility/functional/function/target.html',0,'std::function']]],
-  ['target_5ftype_13',['target_type',['http://en.cppreference.com/w/cpp/utility/functional/function/target_type.html',0,'std::function']]],
-  ['tellg_14',['tellg',['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::fstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_fstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::iostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wistream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::stringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wifstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_istream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::strstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_stringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istrstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wiostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_istringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_ifstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wfstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_iostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wstringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wistringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::ifstream::tellg()']]],
-  ['tellp_15',['tellp',['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_ofstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::fstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_ostringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ostringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_fstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::iostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::stringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::strstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_stringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wostringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_ostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wiostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ofstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ostrstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wfstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_iostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wofstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wstringstream::tellp()']]],
-  ['temporary_20ban_16',['3. Temporary Ban',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md13',1,'']]],
-  ['tera_17',['tera',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['terminate_18',['terminate',['http://en.cppreference.com/w/cpp/error/terminate.html',0,'std']]],
-  ['terminate_5fhandler_19',['terminate_handler',['http://en.cppreference.com/w/cpp/error/terminate_handler.html',0,'std']]],
-  ['ternary_5fsearch_20',['ternary_search',['../dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8',1,'ternary_search.cpp']]],
-  ['ternary_5fsearch_2ecpp_21',['ternary_search.cpp',['../dc/dfe/ternary__search_8cpp.html',1,'']]],
-  ['test_22',['Test',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29',1,'']]],
-  ['test_23',['test',['http://en.cppreference.com/w/cpp/utility/bitset/test.html',0,'std::bitset::test()'],['../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9',1,'large_number::test()'],['../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;generate_parentheses.cpp'],['../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;subarray_sum.cpp'],['../d2/d5a/subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;subset_sum.cpp'],['../dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;count_bits_flip.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;elliptic_curve_key_exchange.cpp'],['../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fcfs_scheduling.cpp'],['../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;list_array.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;segment_tree.cpp'],['../d8/dab/sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;treap.cpp'],['../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;abbreviation.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;house_robber.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;shortest_common_supersequence.cpp'],['../dc/d67/subset__sum__dynamic_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;subset_sum_dynamic.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;trapped_rainwater.cpp'],['../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;word_break.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;jarvis_algorithm.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;connected_components_with_dsu.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;is_graph_bipartite.cpp'],['../d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;topological_sort.cpp'],['../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99',1,'spirograph::test()'],['../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;kruskals_minimum_spanning_tree.cpp'],['../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;md5.cpp'],['../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sha1.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;k_nearest_neighbors.cpp'],['../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;neural_network.cpp'],['../de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;aliquot_sum.cpp'],['../dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;area.cpp'],['../d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981',1,'test(uint64_t n, uint64_t expected):&#160;double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;eulers_totient_function.cpp'],['../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fibonacci.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fibonacci_sum.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;gcd_of_n_numbers.cpp'],['../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;iterative_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;lcm_sum.cpp'],['../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;n_choose_r.cpp'],['../d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;perimeter.cpp'],['../d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;power_of_two.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;quadratic_equations_complex_numbers.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;babylonian_method.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters):&#160;composite_simpson_rule.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fast_fourier_transform.cpp'],['../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;inverse_fast_fourier_transform.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters):&#160;midpoint_integral_method.cpp'],['../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;rungekutta.cpp'],['../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;union_of_two_arrays.cpp'],['../de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;kadanes3.cpp'],['../d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;lfu_cache.cpp'],['../dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;lru_cache2.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;smallest_circle.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;ground_to_ground_projectile_motion.cpp'],['../d9/da2/exponential__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;exponential_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;geometric_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601',1,'test(const std::vector&lt; int &gt; &amp;vals, int windowSize):&#160;windowed_median.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;segtree.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;floyd_cycle_detection_algo.cpp'],['../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sublist_search.cpp'],['../dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bogo_sort.cpp'],['../d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;bubble_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;heap_sort.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;merge_insertion_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;pancake_sort.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;selection_sort_recursive.cpp'],['../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;wave_sort.cpp'],['../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;wiggle_sort.cpp'],['../db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;duval.cpp'],['../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;manacher_algorithm.cpp'],['../d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;z_function.cpp']]],
-  ['test_20examples_24',['Self-test examples',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30',1,'']]],
-  ['test1_25',['test1',['../d7/db9/hill__cipher_8cpp.html#a3147ad576f8a94a2a6b66948672b452b',1,'test1(const std::string &amp;text):&#160;hill_cipher.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1():&#160;dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1():&#160;dsu_union_rank.cpp'],['../db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1():&#160;tree_234.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1():&#160;hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499',1,'test1(double eta=0.01):&#160;adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8',1,'test1():&#160;large_factorial.cpp'],['../d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;sum_of_digits.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;brent_method_extrema.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;durand_kerner_roots.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;golden_search_extrema.cpp'],['../dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;lu_decompose.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;qr_eigen_values.cpp'],['../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5',1,'tests::test1()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a21d922dbb5905993960c6a7f0ba71ac0',1,'test1(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root):&#160;iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;recursive_tree_traversal.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;stooge_sort.cpp']]],
-  ['test2_26',['test2',['../d7/db9/hill__cipher_8cpp.html#a04391124480d2a49f2dec900237b0712',1,'test2(const std::string &amp;text):&#160;hill_cipher.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2():&#160;dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2():&#160;dsu_union_rank.cpp'],['../db/dbc/tree__234_8cpp.html#af1ac73779b0fcfbbdce3976c0ca57342',1,'test2(int64_t n):&#160;tree_234.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2():&#160;hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a379f7488a305f2571f2932b319931f82',1,'test2(double eta=0.01):&#160;adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa',1,'test2():&#160;large_factorial.cpp'],['../d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;sum_of_digits.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;brent_method_extrema.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;durand_kerner_roots.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;golden_search_extrema.cpp'],['../dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;lu_decompose.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;qr_eigen_values.cpp'],['../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669',1,'tests::test2()'],['../d8/d90/iterative__tree__traversals_8cpp.html#ac35ae2868441f8a11c965b87b2494f21',1,'test2(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root):&#160;iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;smallest_circle.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;stooge_sort.cpp']]],
-  ['test3_27',['test3',['../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299',1,'test3():&#160;hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9',1,'test3(double eta=0.01):&#160;adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;kohonen_som_trace.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;golden_search_extrema.cpp'],['../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76',1,'tests::test3()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a425c4c8520991999ee6dbe13d99b87f4',1,'test3(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root):&#160;iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;smallest_circle.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;stooge_sort.cpp']]],
-  ['test4_28',['test4',['../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d',1,'tests::test4()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2',1,'test4():&#160;iterative_tree_traversals.cpp']]],
-  ['test5_29',['test5',['../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86',1,'tests::test5()'],['../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8',1,'test5():&#160;iterative_tree_traversals.cpp']]],
-  ['test6_30',['test6',['../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2',1,'tests::test6()'],['../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89',1,'test6():&#160;iterative_tree_traversals.cpp']]],
-  ['test_5f1_31',['test_1',['../d3/db3/lru__cache_8cpp.html#a6401e8f2d41d8cc9cd0e52ab381608d4',1,'lru_tests::test_1()'],['../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817',1,'test_1():&#160;heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817',1,'test_1():&#160;pigeonhole_sort.cpp']]],
-  ['test_5f2_32',['test_2',['../d3/db3/lru__cache_8cpp.html#a4b02e288a407876a8d6024f98a2a25ec',1,'lru_tests::test_2()'],['../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d',1,'test_2():&#160;heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d',1,'test_2():&#160;pigeonhole_sort.cpp']]],
-  ['test_5f2d_5fclasses_33',['test_2d_classes',['../d4/def/kohonen__som__topology_8cpp.html#a48efb079040c7aaa3a4917a0e486cba9',1,'kohonen_som_topology.cpp']]],
-  ['test_5f3_34',['test_3',['../d3/db3/lru__cache_8cpp.html#a01ec21fc91ddafd964ae2035ba7892c0',1,'lru_tests::test_3()'],['../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a',1,'test_3():&#160;heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a',1,'test_3():&#160;pigeonhole_sort.cpp']]],
-  ['test_5f3d_5fclasses_35',['test_3d_classes',['../d9/d49/kohonen__som__trace_8cpp.html#a7154fe319e6033485a8a6cd6f0d8932d',1,'kohonen_som_trace.cpp']]],
-  ['test_5f3d_5fclasses1_36',['test_3d_classes1',['../d4/def/kohonen__som__topology_8cpp.html#a1302662a56ebf67a21249270b017297e',1,'kohonen_som_topology.cpp']]],
-  ['test_5f3d_5fclasses2_37',['test_3d_classes2',['../d4/def/kohonen__som__topology_8cpp.html#a4b7ab643f6a5002f991837de46f70653',1,'kohonen_som_topology.cpp']]],
-  ['test_5fand_5fset_38',['test_and_set',['http://en.cppreference.com/w/cpp/atomic/atomic_flag/test_and_set.html',0,'std::atomic_flag']]],
-  ['test_5fbitset_39',['test_bitset',['../d9/dab/bloom__filter_8cpp.html#a6e509afe40db07681f676ad8da4fb905',1,'bloom_filter.cpp']]],
-  ['test_5fbloom_5ffilter_5fint_40',['test_bloom_filter_int',['../d9/dab/bloom__filter_8cpp.html#a30edc0d2bb59c185baec81d69d20ed3b',1,'bloom_filter.cpp']]],
-  ['test_5fbloom_5ffilter_5fstring_41',['test_bloom_filter_string',['../d9/dab/bloom__filter_8cpp.html#a71f57bf262fe55db928b19dc124cc0d8',1,'bloom_filter.cpp']]],
-  ['test_5fcircle_42',['test_circle',['../d9/d49/kohonen__som__trace_8cpp.html#ae571600aa42a81bc14a4a602ea5ff00d',1,'kohonen_som_trace.cpp']]],
-  ['test_5fcompute_5fpadded_5fsize_43',['test_compute_padded_size',['../d4/d08/sha256_8cpp.html#af9b52eba85d23e309035354141259f27',1,'sha256.cpp']]],
-  ['test_5fcontains_44',['test_contains',['../df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3',1,'binary_search_tree2.cpp']]],
-  ['test_5fdouble_45',['test_double',['../d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792',1,'quick_sort_3.cpp']]],
-  ['test_5feval_46',['test_eval',['../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec',1,'math']]],
-  ['test_5ff_47',['test_f',['../d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d',1,'shell_sort2.cpp']]],
-  ['test_5ffind_5fmax_48',['test_find_max',['../df/d42/binary__search__tree2_8cpp.html#a9856b68e2cba50d2e26a1cbe374e0365',1,'binary_search_tree2.cpp']]],
-  ['test_5ffind_5fmin_49',['test_find_min',['../df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4',1,'binary_search_tree2.cpp']]],
-  ['test_5ffindgraphsum_50',['test_findGraphSum',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a2311b22324cf09926726e4ce1309af8b',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]],
-  ['test_5ffunction_51',['test_function',['../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.cpp']]],
-  ['test_5ffunction_5f1_52',['test_function_1',['../d7/d75/postfix__evaluation_8cpp.html#a6a8eeb7d346d5cd6335d9780fb7c0f15',1,'postfix_evaluation.cpp']]],
-  ['test_5ffunction_5f2_53',['test_function_2',['../d7/d75/postfix__evaluation_8cpp.html#a5b97d12e8b61484f756a8721992bfae1',1,'postfix_evaluation.cpp']]],
-  ['test_5fget_5felements_5finorder_54',['test_get_elements_inorder',['../df/d42/binary__search__tree2_8cpp.html#a06f35064850e891d6fda0093c0d9ee6e',1,'binary_search_tree2.cpp']]],
-  ['test_5fget_5felements_5fpostorder_55',['test_get_elements_postorder',['../df/d42/binary__search__tree2_8cpp.html#a94b76f781fcbe1ad0e3397ace6bb1965',1,'binary_search_tree2.cpp']]],
-  ['test_5fget_5felements_5fpreorder_56',['test_get_elements_preorder',['../df/d42/binary__search__tree2_8cpp.html#ab00b8d0f21aeb5fbddb6decf3bcb640a',1,'binary_search_tree2.cpp']]],
-  ['test_5finsert_57',['test_insert',['../df/d42/binary__search__tree2_8cpp.html#a8c882f43e1e52948a7841a8bfb091350',1,'binary_search_tree2.cpp']]],
-  ['test_5fint_58',['test_int',['../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda',1,'test_int():&#160;quick_sort_3.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e',1,'test_int(const int NUM_DATA):&#160;shell_sort2.cpp']]],
-  ['test_5flamniscate_59',['test_lamniscate',['../d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a',1,'kohonen_som_trace.cpp']]],
-  ['test_5flongest_5fcommon_5fstring_5flength_60',['test_longest_common_string_length',['../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561',1,'longest_common_string.cpp']]],
-  ['test_5flongest_5fcommon_5fstring_5flength_5ffor_5freversed_5finputs_61',['test_longest_common_string_length_for_reversed_inputs',['../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe',1,'longest_common_string.cpp']]],
-  ['test_5flongest_5fcommon_5fstring_5flength_5fis_5fsymmetric_62',['test_longest_common_string_length_is_symmetric',['../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155',1,'longest_common_string.cpp']]],
-  ['test_5fremove_63',['test_remove',['../df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e',1,'binary_search_tree2.cpp']]],
-  ['test_5fset_64',['test_set',['../d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123',1,'brute_force_string_searching.cpp']]],
-  ['testcase_65',['TestCase',['../da/d86/struct_test_case.html',1,'']]],
-  ['testcase_5f1_66',['testCase_1',['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()']]],
-  ['testcase_5f2_67',['testCase_2',['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()']]],
-  ['testcase_5f3_68',['testCase_3',['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()']]],
-  ['testcases_69',['TestCases',['../d5/d58/class_test_cases.html',1,'']]],
-  ['tests_70',['tests',['../d9/df4/namespacetests.html',1,'tests'],['../d1/da7/armstrong__number__templated_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;armstrong_number_templated.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;longest_common_string.cpp'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;unbounded_0_1_knapsack.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;depth_first_search_with_stack.cpp'],['../d8/d68/dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;travelling_salesman_problem.cpp'],['../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;digit_separation.cpp'],['../da/de8/dijkstra__greedy_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;dijkstra_greedy.cpp'],['../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;gale_shapley.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;kelvin_to_celsius.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;longest_substring_without_repeating_characters.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;longest_increasing_subsequence_using_binary_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;insertion_sort_recursive.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;quick_sort.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;boyer_moore.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;knuth_morris_pratt.cpp']]],
-  ['text_5fsearch_2ecpp_71',['text_search.cpp',['../dc/db5/text__search_8cpp.html',1,'']]],
-  ['tgamma_72',['tgamma',['http://en.cppreference.com/w/cpp/numeric/math/tgamma.html',0,'std']]],
-  ['th_73',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]],
-  ['the_20address_20of_20parent_20nodes_74',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
-  ['the_20algorithms_20c_75',['The Algorithms - C++',['../index.html',1,'']]],
-  ['the_20given_20node_20does_20not_20have_20a_20right_20node_20subtree_76',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]],
-  ['the_20given_20node_20has_20the_20right_20node_20subtree_77',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]],
-  ['the_20right_20node_20subtree_78',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]],
-  ['the_20root_20node_79',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]],
-  ['thousands_5fsep_80',['thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::thousands_sep()']]],
-  ['thread_81',['thread',['http://en.cppreference.com/w/cpp/thread/thread.html',0,'std::thread'],['http://en.cppreference.com/w/cpp/thread/thread/thread.html',0,'std::thread::thread()']]],
-  ['throw_5fwith_5fnested_82',['throw_with_nested',['http://en.cppreference.com/w/cpp/error/throw_with_nested.html',0,'std']]],
-  ['tie_83',['tie',['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::fstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ios::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_fstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::iostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wistream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::stringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wifstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_istream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::strstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_stringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istrstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wiostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_istringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ifstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostrstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wfstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_iostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wstringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wistringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ifstream::tie()'],['http://en.cppreference.com/w/cpp/utility/tuple/tie.html',0,'std::tie(T... args)']]],
-  ['time_84',['time',['http://en.cppreference.com/w/cpp/chrono/c/time.html',0,'std']]],
-  ['time_5fbase_85',['time_base',['http://en.cppreference.com/w/cpp/locale/time_base.html',0,'std']]],
-  ['time_5fget_86',['time_get',['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get'],['http://en.cppreference.com/w/cpp/locale/time_get/time_get.html',0,'std::time_get::time_get()']]],
-  ['time_5fget_5fbyname_87',['time_get_byname',['http://en.cppreference.com/w/cpp/locale/time_get_byname.html',0,'std::time_get_byname'],['http://en.cppreference.com/w/cpp/locale/time_get_byname.html',0,'std::time_get_byname::time_get_byname()']]],
-  ['time_5fof_5fflight_88',['time_of_flight',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a563e066975fed1b84750a0a47c3cbb37',1,'physics::ground_to_ground_projectile_motion']]],
-  ['time_5fpoint_89',['time_point',['http://en.cppreference.com/w/cpp/chrono/time_point.html',0,'std::chrono::time_point'],['http://en.cppreference.com/w/cpp/chrono/time_point/time_point.html',0,'std::chrono::time_point::time_point()']]],
-  ['time_5fpoint_5fcast_90',['time_point_cast',['http://en.cppreference.com/w/cpp/chrono/time_point/time_point_cast.html',0,'std::chrono']]],
-  ['time_5fput_91',['time_put',['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put'],['http://en.cppreference.com/w/cpp/locale/time_put/time_put.html',0,'std::time_put::time_put()']]],
-  ['time_5fput_5fbyname_92',['time_put_byname',['http://en.cppreference.com/w/cpp/locale/time_put_byname.html',0,'std::time_put_byname'],['http://en.cppreference.com/w/cpp/locale/time_put_byname.html',0,'std::time_put_byname::time_put_byname()']]],
-  ['time_5fsince_5fepoch_93',['time_since_epoch',['http://en.cppreference.com/w/cpp/chrono/time_point/time_since_epoch.html',0,'std::chrono::time_point']]],
-  ['time_5ft_94',['time_t',['http://en.cppreference.com/w/cpp/chrono/c/time_t.html',0,'std']]],
-  ['timed_5fmutex_95',['timed_mutex',['http://en.cppreference.com/w/cpp/thread/timed_mutex.html',0,'std::timed_mutex'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/timed_mutex.html',0,'std::timed_mutex::timed_mutex()']]],
-  ['tm_96',['tm',['http://en.cppreference.com/w/cpp/chrono/c/tm.html',0,'std']]],
-  ['tmpfile_97',['tmpfile',['http://en.cppreference.com/w/cpp/io/c/tmpfile.html',0,'std']]],
-  ['tmpnam_98',['tmpnam',['http://en.cppreference.com/w/cpp/io/c/tmpnam.html',0,'std']]],
-  ['tnode_99',['Tnode',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html',1,'operations_on_datastructures::trie_operations']]],
-  ['to_5fbytes_100',['to_bytes',['http://en.cppreference.com/w/cpp/locale/wstring_convert/to_bytes.html',0,'std::wstring_convert']]],
-  ['to_5fchar_5ftype_101',['to_char_type',['http://en.cppreference.com/w/cpp/string/char_traits/to_char_type.html',0,'std::char_traits']]],
-  ['to_5fint_5ftype_102',['to_int_type',['http://en.cppreference.com/w/cpp/string/char_traits/to_int_type.html',0,'std::char_traits']]],
-  ['to_5fstring_103',['to_string',['http://en.cppreference.com/w/cpp/utility/bitset/to_string.html',0,'std::bitset::to_string()'],['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08',1,'hashing::sha256::Hash::to_string()'],['http://en.cppreference.com/w/cpp/string/basic_string/to_string.html',0,'std::to_string()']]],
-  ['to_5ftime_5ft_104',['to_time_t',['http://en.cppreference.com/w/cpp/chrono/system_clock/to_time_t.html',0,'std::chrono::system_clock']]],
-  ['to_5fullong_105',['to_ullong',['http://en.cppreference.com/w/cpp/utility/bitset/to_ullong.html',0,'std::bitset']]],
-  ['to_5fulong_106',['to_ulong',['http://en.cppreference.com/w/cpp/utility/bitset/to_ulong.html',0,'std::bitset']]],
-  ['to_5fwstring_107',['to_wstring',['http://en.cppreference.com/w/cpp/string/basic_string/to_wstring.html',0,'std']]],
-  ['todo_20list_108',['Todo List',['../dd/da0/todo.html',1,'']]],
-  ['tolittleendian32_109',['toLittleEndian32',['../d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689',1,'hashing::md5']]],
-  ['tolittleendian64_110',['toLittleEndian64',['../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef',1,'hashing::md5']]],
-  ['tolower_111',['tolower',['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype_byname::tolower()'],['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype::tolower()'],['http://en.cppreference.com/w/cpp/string/byte/tolower.html',0,'std::tolower()']]],
-  ['tolowerroman_112',['tolowerRoman',['../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d',1,'decimal_to_roman_numeral.cpp']]],
-  ['top_113',['top',['../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d',1,'tower::top'],['http://en.cppreference.com/w/cpp/container/stack/top.html',0,'std::stack::top()'],['http://en.cppreference.com/w/cpp/container/priority_queue/top.html',0,'std::priority_queue::top()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6',1,'data_structures::linked_list::list::top()'],['../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709',1,'stack::top()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7',1,'data_structures::stack_using_queue::Stack::top()']]],
-  ['topmost_114',['topmost',['../d2/dc8/classdata__structures_1_1_stack.html#a61dc70e128ee64c9684f03a4c04818b0',1,'data_structures::Stack']]],
-  ['topological_5fsort_115',['topological_sort',['../d8/d76/namespacetopological__sort.html',1,'']]],
-  ['topological_5fsort_2ecpp_116',['topological_sort.cpp',['../d8/db9/topological__sort_8cpp.html',1,'']]],
-  ['topologicalsort_117',['topologicalSort',['../d8/db9/topological__sort_8cpp.html#a54dc5d7914958dbd24dda2fd862dc41b',1,'graph::topological_sort']]],
-  ['toupper_118',['toupper',['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype_byname::toupper()'],['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype::toupper()'],['http://en.cppreference.com/w/cpp/string/byte/toupper.html',0,'std::toupper()']]],
-  ['toupperroman_119',['toupperRoman',['../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979',1,'decimal_to_roman_numeral.cpp']]],
-  ['tovector_120',['toVector',['../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d',1,'queue']]],
-  ['towctrans_121',['towctrans',['http://en.cppreference.com/w/cpp/string/wide/towctrans.html',0,'std']]],
-  ['tower_122',['tower',['../d2/d2c/structtower.html',1,'']]],
-  ['tower_5fof_5fhanoi_2ecpp_123',['tower_of_hanoi.cpp',['../db/d3c/tower__of__hanoi_8cpp.html',1,'']]],
-  ['towlower_124',['towlower',['http://en.cppreference.com/w/cpp/string/wide/towlower.html',0,'std']]],
-  ['towupper_125',['towupper',['http://en.cppreference.com/w/cpp/string/wide/towupper.html',0,'std']]],
-  ['transform_126',['transform',['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate_byname::transform()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/transform.html',0,'std::regex_traits::transform()'],['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate::transform()'],['http://en.cppreference.com/w/cpp/algorithm/transform.html',0,'std::transform()']]],
-  ['transform_5fprimary_127',['transform_primary',['http://en.cppreference.com/w/cpp/regex/regex_traits/transform_primary.html',0,'std::regex_traits']]],
-  ['translate_128',['translate',['http://en.cppreference.com/w/cpp/regex/regex_traits/translate.html',0,'std::regex_traits']]],
-  ['translate_5fnocase_129',['translate_nocase',['http://en.cppreference.com/w/cpp/regex/regex_traits/translate_nocase.html',0,'std::regex_traits']]],
-  ['transpose_130',['transpose',['../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a',1,'machine_learning']]],
-  ['trapped_5frainwater_2ecpp_131',['trapped_rainwater.cpp',['../d9/d80/trapped__rainwater_8cpp.html',1,'']]],
-  ['trappedrainwater_132',['trappedRainwater',['../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8',1,'dynamic_programming']]],
-  ['travelling_5fsalesman_5fproblem_2ecpp_133',['travelling_salesman_problem.cpp',['../de/d88/travelling__salesman__problem_8cpp.html',1,'']]],
-  ['travelling_5fsalesman_5fusing_5fbit_5fmanipulation_134',['travelling_salesman_using_bit_manipulation',['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1',1,'bit_manipulation::travelling_salesman_using_bit_manipulation']]],
-  ['travelling_5fsalesman_5fusing_5fbit_5fmanipulation_2ecpp_135',['travelling_salesman_using_bit_manipulation.cpp',['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html',1,'']]],
-  ['travellingsalesman_5fbitmanipulation_136',['travellingSalesman_bitmanipulation',['../d7/d3f/namespacetravelling_salesman__bitmanipulation.html',1,'']]],
-  ['travellingsalesmanproblem_137',['TravellingSalesmanProblem',['../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346',1,'graph']]],
-  ['traversal_20of_20a_20tree_138',['Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]],
-  ['traverse_139',['Traverse',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd',1,'data_structures::tree_234::Tree234::Traverse()'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a936bb546e6a94d8b9d35b30ee1bb291a',1,'data_structures::tree_234::Tree234::Traverse(Node *tree)']]],
-  ['traverse_140',['traverse',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69',1,'data_structures::linked_list::list']]],
-  ['traverse_5finorder_141',['traverse_inorder',['../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd',1,'binary_search_tree']]],
-  ['traverse_5fpostorder_142',['traverse_postorder',['../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362',1,'binary_search_tree']]],
-  ['traverse_5fpreorder_143',['traverse_preorder',['../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1',1,'binary_search_tree']]],
-  ['treap_144',['Treap',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html',1,'data_structures::treap::Treap'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683',1,'data_structures::treap::Treap::Treap()']]],
-  ['treap_2ecpp_145',['treap.cpp',['../d0/dd2/treap_8cpp.html',1,'']]],
-  ['treapcnt_146',['treapCnt',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425',1,'data_structures::treap::Treap']]],
-  ['treat_5fas_5ffloating_5fpoint_147',['treat_as_floating_point',['http://en.cppreference.com/w/cpp/chrono/treat_as_floating_point.html',0,'std::chrono']]],
-  ['tree_148',['Tree',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html',1,'range_queries::heavy_light_decomposition::Tree&lt; X &gt;'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1',1,'range_queries::heavy_light_decomposition::Tree::Tree()']]],
-  ['tree_149',['tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]],
-  ['tree234_150',['Tree234',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html',1,'data_structures::tree_234']]],
-  ['tree_5f234_151',['tree_234',['../d6/dab/namespacetree__234.html',1,'']]],
-  ['tree_5f234_2ecpp_152',['tree_234.cpp',['../db/dbc/tree__234_8cpp.html',1,'']]],
-  ['triangle_5farea_153',['triangle_area',['../dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc',1,'math']]],
-  ['triangle_5fperimeter_154',['triangle_perimeter',['../dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3',1,'math']]],
-  ['triangle_5fprism_5fvolume_155',['triangle_prism_volume',['../dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c',1,'math']]],
-  ['trianglearea_156',['TriangleArea',['../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc',1,'smallest_circle.cpp']]],
-  ['trie_157',['Trie',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html',1,'data_structures::trie_using_hashmap::Trie'],['../dd/d2f/class_trie.html',1,'Trie'],['../dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908',1,'Trie::Trie()'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a092d0805a9e647c2048777dbe67b35ab',1,'data_structures::trie_using_hashmap::Trie::Trie()']]],
-  ['trie_158',['trie',['../d0/d3e/classdata__structures_1_1trie.html',1,'data_structures::trie'],['../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8',1,'data_structures::trie::trie()']]],
-  ['trie_5fmodern_2ecpp_159',['trie_modern.cpp',['../dc/d93/trie__modern_8cpp.html',1,'']]],
-  ['trie_5fmultiple_5fsearch_2ecpp_160',['trie_multiple_search.cpp',['../d7/def/trie__multiple__search_8cpp.html',1,'']]],
-  ['trie_5foperations_161',['trie_operations',['../df/d8e/namespacetrie__operations.html',1,'']]],
-  ['trie_5ftree_2ecpp_162',['trie_tree.cpp',['../d7/d83/trie__tree_8cpp.html',1,'']]],
-  ['trie_5fusing_5fhashmap_163',['trie_using_hashmap',['../d7/d0a/namespacetrie__using__hashmap.html',1,'']]],
-  ['trie_5fusing_5fhashmap_2ecpp_164',['trie_using_hashmap.cpp',['../d5/d8a/trie__using__hashmap_8cpp.html',1,'']]],
-  ['trienode_165',['TrieNode',['../de/d48/struct_trie_1_1_trie_node.html',1,'Trie']]],
-  ['true_5ftype_166',['true_type',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]],
-  ['truename_167',['truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::truename()']]],
-  ['trunc_168',['trunc',['http://en.cppreference.com/w/cpp/numeric/math/trunc.html',0,'std']]],
-  ['try_5flock_169',['try_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock.html',0,'std::unique_lock::try_lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/try_lock.html',0,'std::recursive_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock.html',0,'std::recursive_timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock.html',0,'std::shared_lock::try_lock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock.html',0,'std::timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/mutex/try_lock.html',0,'std::mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock.html',0,'std::shared_timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/try_lock.html',0,'std::try_lock()']]],
-  ['try_5flock_5ffor_170',['try_lock_for',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock_for.html',0,'std::unique_lock::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock_for.html',0,'std::recursive_timed_mutex::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock_for.html',0,'std::shared_lock::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock_for.html',0,'std::timed_mutex::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_for.html',0,'std::shared_timed_mutex::try_lock_for(T... args)']]],
-  ['try_5flock_5fshared_171',['try_lock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared.html',0,'std::shared_timed_mutex']]],
-  ['try_5flock_5fshared_5ffor_172',['try_lock_shared_for',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared_for.html',0,'std::shared_timed_mutex']]],
-  ['try_5flock_5fshared_5funtil_173',['try_lock_shared_until',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared_until.html',0,'std::shared_timed_mutex']]],
-  ['try_5flock_5funtil_174',['try_lock_until',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock_until.html',0,'std::unique_lock::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock_until.html',0,'std::recursive_timed_mutex::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock_until.html',0,'std::shared_lock::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock_until.html',0,'std::timed_mutex::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_until.html',0,'std::shared_timed_mutex::try_lock_until()']]],
-  ['try_5fto_5flock_5ft_175',['try_to_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]],
-  ['tryleftrotate_176',['TryLeftRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9',1,'data_structures::tree_234::Tree234']]],
-  ['tryrightrotate_177',['TryRightRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3',1,'data_structures::tree_234::Tree234']]],
-  ['tuple_178',['tuple',['http://en.cppreference.com/w/cpp/utility/tuple.html',0,'std::tuple'],['http://en.cppreference.com/w/cpp/utility/tuple/tuple.html',0,'std::tuple::tuple()']]],
-  ['tuple_3c_20int_2c_20int_2c_20int_20_3e_179',['tuple&lt; int, int, int &gt;',['http://en.cppreference.com/w/cpp/utility/tuple.html',0,'std']]],
-  ['tuple_5fcat_180',['tuple_cat',['http://en.cppreference.com/w/cpp/utility/tuple/tuple_cat.html',0,'std']]],
-  ['type_5findex_181',['type_index',['http://en.cppreference.com/w/cpp/types/type_index.html',0,'std::type_index'],['http://en.cppreference.com/w/cpp/types/type_index/type_index.html',0,'std::type_index::type_index()']]],
-  ['type_5finfo_182',['type_info',['http://en.cppreference.com/w/cpp/types/type_info.html',0,'std']]],
-  ['typical_20structure_20of_20a_20program_183',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]]
+  ['tanh_10',['tanh',['../d2/d58/neural__network_8cpp.html#a371aa7dd5d5add0143d1756bb0a1b32f',1,'machine_learning::neural_network::activations']]],
+  ['temporary_20ban_11',['3. Temporary Ban',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md13',1,'']]],
+  ['ternary_5fsearch_12',['ternary_search',['../dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8',1,'ternary_search.cpp']]],
+  ['ternary_5fsearch_2ecpp_13',['ternary_search.cpp',['../dc/dfe/ternary__search_8cpp.html',1,'']]],
+  ['test_14',['Test',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md29',1,'']]],
+  ['test_15',['test',['../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9',1,'large_number::test()'],['../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;generate_parentheses.cpp'],['../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;subarray_sum.cpp'],['../d2/d5a/subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;subset_sum.cpp'],['../dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;count_bits_flip.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;elliptic_curve_key_exchange.cpp'],['../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fcfs_scheduling.cpp'],['../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;list_array.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;segment_tree.cpp'],['../d8/dab/sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;treap.cpp'],['../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;abbreviation.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;house_robber.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;shortest_common_supersequence.cpp'],['../dc/d67/subset__sum__dynamic_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;subset_sum_dynamic.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;trapped_rainwater.cpp'],['../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;word_break.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;jarvis_algorithm.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;connected_components_with_dsu.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;is_graph_bipartite.cpp'],['../d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;topological_sort.cpp'],['../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99',1,'spirograph::test()'],['../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;kruskals_minimum_spanning_tree.cpp'],['../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;md5.cpp'],['../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sha1.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;k_nearest_neighbors.cpp'],['../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;neural_network.cpp'],['../de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;aliquot_sum.cpp'],['../dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;area.cpp'],['../d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981',1,'test(uint64_t n, uint64_t expected):&#160;double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;eulers_totient_function.cpp'],['../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fibonacci.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fibonacci_sum.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;gcd_of_n_numbers.cpp'],['../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;iterative_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;lcm_sum.cpp'],['../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;n_choose_r.cpp'],['../d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;perimeter.cpp'],['../d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;power_of_two.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;quadratic_equations_complex_numbers.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;babylonian_method.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters):&#160;composite_simpson_rule.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fast_fourier_transform.cpp'],['../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;inverse_fast_fourier_transform.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters):&#160;midpoint_integral_method.cpp'],['../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;rungekutta.cpp'],['../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;union_of_two_arrays.cpp'],['../de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;kadanes3.cpp'],['../d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;lfu_cache.cpp'],['../dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;lru_cache2.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;smallest_circle.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;ground_to_ground_projectile_motion.cpp'],['../d9/da2/exponential__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;exponential_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;geometric_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601',1,'test(const std::vector&lt; int &gt; &amp;vals, int windowSize):&#160;windowed_median.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;segtree.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;floyd_cycle_detection_algo.cpp'],['../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sublist_search.cpp'],['../dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bogo_sort.cpp'],['../d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;bubble_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;heap_sort.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;merge_insertion_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;pancake_sort.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;selection_sort_recursive.cpp'],['../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;wave_sort.cpp'],['../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;wiggle_sort.cpp'],['../db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;duval.cpp'],['../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;manacher_algorithm.cpp'],['../d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;z_function.cpp']]],
+  ['test_20examples_16',['Self-test examples',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30',1,'']]],
+  ['test1_17',['test1',['../d7/db9/hill__cipher_8cpp.html#a3147ad576f8a94a2a6b66948672b452b',1,'test1(const std::string &amp;text):&#160;hill_cipher.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1():&#160;dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1():&#160;dsu_union_rank.cpp'],['../db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1():&#160;tree_234.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1():&#160;hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499',1,'test1(double eta=0.01):&#160;adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8',1,'test1():&#160;large_factorial.cpp'],['../d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;sum_of_digits.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;brent_method_extrema.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;durand_kerner_roots.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;golden_search_extrema.cpp'],['../dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;lu_decompose.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;qr_eigen_values.cpp'],['../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5',1,'tests::test1()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a21d922dbb5905993960c6a7f0ba71ac0',1,'test1(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root):&#160;iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;recursive_tree_traversal.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;stooge_sort.cpp']]],
+  ['test2_18',['test2',['../d7/db9/hill__cipher_8cpp.html#a04391124480d2a49f2dec900237b0712',1,'test2(const std::string &amp;text):&#160;hill_cipher.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2():&#160;dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2():&#160;dsu_union_rank.cpp'],['../db/dbc/tree__234_8cpp.html#af1ac73779b0fcfbbdce3976c0ca57342',1,'test2(int64_t n):&#160;tree_234.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2():&#160;hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a379f7488a305f2571f2932b319931f82',1,'test2(double eta=0.01):&#160;adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa',1,'test2():&#160;large_factorial.cpp'],['../d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;sum_of_digits.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;brent_method_extrema.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;durand_kerner_roots.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;golden_search_extrema.cpp'],['../dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;lu_decompose.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;qr_eigen_values.cpp'],['../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669',1,'tests::test2()'],['../d8/d90/iterative__tree__traversals_8cpp.html#ac35ae2868441f8a11c965b87b2494f21',1,'test2(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root):&#160;iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;smallest_circle.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;stooge_sort.cpp']]],
+  ['test3_19',['test3',['../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299',1,'test3():&#160;hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9',1,'test3(double eta=0.01):&#160;adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;kohonen_som_trace.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;golden_search_extrema.cpp'],['../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76',1,'tests::test3()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a425c4c8520991999ee6dbe13d99b87f4',1,'test3(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root):&#160;iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;smallest_circle.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;stooge_sort.cpp']]],
+  ['test4_20',['test4',['../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d',1,'tests::test4()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2',1,'test4():&#160;iterative_tree_traversals.cpp']]],
+  ['test5_21',['test5',['../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86',1,'tests::test5()'],['../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8',1,'test5():&#160;iterative_tree_traversals.cpp']]],
+  ['test6_22',['test6',['../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2',1,'tests::test6()'],['../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89',1,'test6():&#160;iterative_tree_traversals.cpp']]],
+  ['test_5f1_23',['test_1',['../d3/db3/lru__cache_8cpp.html#a6401e8f2d41d8cc9cd0e52ab381608d4',1,'lru_tests::test_1()'],['../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817',1,'test_1():&#160;heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817',1,'test_1():&#160;pigeonhole_sort.cpp']]],
+  ['test_5f2_24',['test_2',['../d3/db3/lru__cache_8cpp.html#a4b02e288a407876a8d6024f98a2a25ec',1,'lru_tests::test_2()'],['../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d',1,'test_2():&#160;heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d',1,'test_2():&#160;pigeonhole_sort.cpp']]],
+  ['test_5f2d_5fclasses_25',['test_2d_classes',['../d4/def/kohonen__som__topology_8cpp.html#a48efb079040c7aaa3a4917a0e486cba9',1,'kohonen_som_topology.cpp']]],
+  ['test_5f3_26',['test_3',['../d3/db3/lru__cache_8cpp.html#a01ec21fc91ddafd964ae2035ba7892c0',1,'lru_tests::test_3()'],['../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a',1,'test_3():&#160;heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a',1,'test_3():&#160;pigeonhole_sort.cpp']]],
+  ['test_5f3d_5fclasses_27',['test_3d_classes',['../d9/d49/kohonen__som__trace_8cpp.html#a7154fe319e6033485a8a6cd6f0d8932d',1,'kohonen_som_trace.cpp']]],
+  ['test_5f3d_5fclasses1_28',['test_3d_classes1',['../d4/def/kohonen__som__topology_8cpp.html#a1302662a56ebf67a21249270b017297e',1,'kohonen_som_topology.cpp']]],
+  ['test_5f3d_5fclasses2_29',['test_3d_classes2',['../d4/def/kohonen__som__topology_8cpp.html#a4b7ab643f6a5002f991837de46f70653',1,'kohonen_som_topology.cpp']]],
+  ['test_5fbitset_30',['test_bitset',['../d9/dab/bloom__filter_8cpp.html#a6e509afe40db07681f676ad8da4fb905',1,'bloom_filter.cpp']]],
+  ['test_5fbloom_5ffilter_5fint_31',['test_bloom_filter_int',['../d9/dab/bloom__filter_8cpp.html#a30edc0d2bb59c185baec81d69d20ed3b',1,'bloom_filter.cpp']]],
+  ['test_5fbloom_5ffilter_5fstring_32',['test_bloom_filter_string',['../d9/dab/bloom__filter_8cpp.html#a71f57bf262fe55db928b19dc124cc0d8',1,'bloom_filter.cpp']]],
+  ['test_5fcircle_33',['test_circle',['../d9/d49/kohonen__som__trace_8cpp.html#ae571600aa42a81bc14a4a602ea5ff00d',1,'kohonen_som_trace.cpp']]],
+  ['test_5fcompute_5fpadded_5fsize_34',['test_compute_padded_size',['../d4/d08/sha256_8cpp.html#af9b52eba85d23e309035354141259f27',1,'sha256.cpp']]],
+  ['test_5fcontains_35',['test_contains',['../df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3',1,'binary_search_tree2.cpp']]],
+  ['test_5fdouble_36',['test_double',['../d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792',1,'quick_sort_3.cpp']]],
+  ['test_5feval_37',['test_eval',['../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec',1,'math']]],
+  ['test_5ff_38',['test_f',['../d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d',1,'shell_sort2.cpp']]],
+  ['test_5ffind_5fmax_39',['test_find_max',['../df/d42/binary__search__tree2_8cpp.html#a9856b68e2cba50d2e26a1cbe374e0365',1,'binary_search_tree2.cpp']]],
+  ['test_5ffind_5fmin_40',['test_find_min',['../df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4',1,'binary_search_tree2.cpp']]],
+  ['test_5ffindgraphsum_41',['test_findGraphSum',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a2311b22324cf09926726e4ce1309af8b',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]],
+  ['test_5ffunction_42',['test_function',['../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.cpp']]],
+  ['test_5ffunction_5f1_43',['test_function_1',['../d7/d75/postfix__evaluation_8cpp.html#a6a8eeb7d346d5cd6335d9780fb7c0f15',1,'postfix_evaluation.cpp']]],
+  ['test_5ffunction_5f2_44',['test_function_2',['../d7/d75/postfix__evaluation_8cpp.html#a5b97d12e8b61484f756a8721992bfae1',1,'postfix_evaluation.cpp']]],
+  ['test_5fget_5felements_5finorder_45',['test_get_elements_inorder',['../df/d42/binary__search__tree2_8cpp.html#a06f35064850e891d6fda0093c0d9ee6e',1,'binary_search_tree2.cpp']]],
+  ['test_5fget_5felements_5fpostorder_46',['test_get_elements_postorder',['../df/d42/binary__search__tree2_8cpp.html#a94b76f781fcbe1ad0e3397ace6bb1965',1,'binary_search_tree2.cpp']]],
+  ['test_5fget_5felements_5fpreorder_47',['test_get_elements_preorder',['../df/d42/binary__search__tree2_8cpp.html#ab00b8d0f21aeb5fbddb6decf3bcb640a',1,'binary_search_tree2.cpp']]],
+  ['test_5finsert_48',['test_insert',['../df/d42/binary__search__tree2_8cpp.html#a8c882f43e1e52948a7841a8bfb091350',1,'binary_search_tree2.cpp']]],
+  ['test_5fint_49',['test_int',['../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda',1,'test_int():&#160;quick_sort_3.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e',1,'test_int(const int NUM_DATA):&#160;shell_sort2.cpp']]],
+  ['test_5flamniscate_50',['test_lamniscate',['../d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a',1,'kohonen_som_trace.cpp']]],
+  ['test_5flongest_5fcommon_5fstring_5flength_51',['test_longest_common_string_length',['../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561',1,'longest_common_string.cpp']]],
+  ['test_5flongest_5fcommon_5fstring_5flength_5ffor_5freversed_5finputs_52',['test_longest_common_string_length_for_reversed_inputs',['../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe',1,'longest_common_string.cpp']]],
+  ['test_5flongest_5fcommon_5fstring_5flength_5fis_5fsymmetric_53',['test_longest_common_string_length_is_symmetric',['../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155',1,'longest_common_string.cpp']]],
+  ['test_5fremove_54',['test_remove',['../df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e',1,'binary_search_tree2.cpp']]],
+  ['test_5fset_55',['test_set',['../d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123',1,'brute_force_string_searching.cpp']]],
+  ['testcase_56',['TestCase',['../da/d86/struct_test_case.html',1,'']]],
+  ['testcase_5f1_57',['testCase_1',['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()']]],
+  ['testcase_5f2_58',['testCase_2',['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()']]],
+  ['testcase_5f3_59',['testCase_3',['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()']]],
+  ['testcases_60',['TestCases',['../d5/d58/class_test_cases.html',1,'']]],
+  ['tests_61',['tests',['../d9/df4/namespacetests.html',1,'tests'],['../d1/da7/armstrong__number__templated_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;armstrong_number_templated.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;longest_common_string.cpp'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;unbounded_0_1_knapsack.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;depth_first_search_with_stack.cpp'],['../d8/d68/dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;travelling_salesman_problem.cpp'],['../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;digit_separation.cpp'],['../da/de8/dijkstra__greedy_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;dijkstra_greedy.cpp'],['../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;gale_shapley.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;kelvin_to_celsius.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;longest_substring_without_repeating_characters.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;longest_increasing_subsequence_using_binary_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;insertion_sort_recursive.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;quick_sort.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;boyer_moore.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;knuth_morris_pratt.cpp']]],
+  ['text_5fsearch_2ecpp_62',['text_search.cpp',['../dc/db5/text__search_8cpp.html',1,'']]],
+  ['th_63',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]],
+  ['the_20address_20of_20parent_20nodes_64',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
+  ['the_20algorithms_20c_65',['The Algorithms - C++',['../index.html',1,'']]],
+  ['the_20given_20node_20does_20not_20have_20a_20right_20node_20subtree_66',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]],
+  ['the_20given_20node_20has_20the_20right_20node_20subtree_67',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]],
+  ['the_20right_20node_20subtree_68',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]],
+  ['the_20root_20node_69',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]],
+  ['time_5fof_5fflight_70',['time_of_flight',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a563e066975fed1b84750a0a47c3cbb37',1,'physics::ground_to_ground_projectile_motion']]],
+  ['tnode_71',['Tnode',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html',1,'operations_on_datastructures::trie_operations']]],
+  ['to_5fstring_72',['to_string',['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08',1,'hashing::sha256::Hash']]],
+  ['todo_20list_73',['Todo List',['../dd/da0/todo.html',1,'']]],
+  ['tolittleendian32_74',['toLittleEndian32',['../d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689',1,'hashing::md5']]],
+  ['tolittleendian64_75',['toLittleEndian64',['../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef',1,'hashing::md5']]],
+  ['tolowerroman_76',['tolowerRoman',['../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d',1,'decimal_to_roman_numeral.cpp']]],
+  ['top_77',['top',['../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d',1,'tower::top'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6',1,'data_structures::linked_list::list::top()'],['../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709',1,'stack::top()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7',1,'data_structures::stack_using_queue::Stack::top()']]],
+  ['topmost_78',['topmost',['../d2/dc8/classdata__structures_1_1_stack.html#a61dc70e128ee64c9684f03a4c04818b0',1,'data_structures::Stack']]],
+  ['topological_5fsort_79',['topological_sort',['../d8/d76/namespacetopological__sort.html',1,'']]],
+  ['topological_5fsort_2ecpp_80',['topological_sort.cpp',['../d8/db9/topological__sort_8cpp.html',1,'']]],
+  ['topologicalsort_81',['topologicalSort',['../d8/db9/topological__sort_8cpp.html#a54dc5d7914958dbd24dda2fd862dc41b',1,'graph::topological_sort']]],
+  ['toupperroman_82',['toupperRoman',['../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979',1,'decimal_to_roman_numeral.cpp']]],
+  ['tovector_83',['toVector',['../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d',1,'queue']]],
+  ['tower_84',['tower',['../d2/d2c/structtower.html',1,'']]],
+  ['tower_5fof_5fhanoi_2ecpp_85',['tower_of_hanoi.cpp',['../db/d3c/tower__of__hanoi_8cpp.html',1,'']]],
+  ['transpose_86',['transpose',['../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a',1,'machine_learning']]],
+  ['trapped_5frainwater_2ecpp_87',['trapped_rainwater.cpp',['../d9/d80/trapped__rainwater_8cpp.html',1,'']]],
+  ['trappedrainwater_88',['trappedRainwater',['../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8',1,'dynamic_programming']]],
+  ['travelling_5fsalesman_5fproblem_2ecpp_89',['travelling_salesman_problem.cpp',['../de/d88/travelling__salesman__problem_8cpp.html',1,'']]],
+  ['travelling_5fsalesman_5fusing_5fbit_5fmanipulation_90',['travelling_salesman_using_bit_manipulation',['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1',1,'bit_manipulation::travelling_salesman_using_bit_manipulation']]],
+  ['travelling_5fsalesman_5fusing_5fbit_5fmanipulation_2ecpp_91',['travelling_salesman_using_bit_manipulation.cpp',['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html',1,'']]],
+  ['travellingsalesman_5fbitmanipulation_92',['travellingSalesman_bitmanipulation',['../d7/d3f/namespacetravelling_salesman__bitmanipulation.html',1,'']]],
+  ['travellingsalesmanproblem_93',['TravellingSalesmanProblem',['../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346',1,'graph']]],
+  ['traversal_20of_20a_20tree_94',['Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]],
+  ['traverse_95',['Traverse',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd',1,'data_structures::tree_234::Tree234::Traverse()'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a936bb546e6a94d8b9d35b30ee1bb291a',1,'data_structures::tree_234::Tree234::Traverse(Node *tree)']]],
+  ['traverse_96',['traverse',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69',1,'data_structures::linked_list::list']]],
+  ['traverse_5finorder_97',['traverse_inorder',['../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd',1,'binary_search_tree']]],
+  ['traverse_5fpostorder_98',['traverse_postorder',['../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362',1,'binary_search_tree']]],
+  ['traverse_5fpreorder_99',['traverse_preorder',['../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1',1,'binary_search_tree']]],
+  ['treap_100',['Treap',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html',1,'data_structures::treap::Treap'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683',1,'data_structures::treap::Treap::Treap()']]],
+  ['treap_2ecpp_101',['treap.cpp',['../d0/dd2/treap_8cpp.html',1,'']]],
+  ['treapcnt_102',['treapCnt',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a1ab082fe0aa95a238bbbc68ab6a72425',1,'data_structures::treap::Treap']]],
+  ['tree_103',['Tree',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html',1,'range_queries::heavy_light_decomposition::Tree&lt; X &gt;'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1',1,'range_queries::heavy_light_decomposition::Tree::Tree()']]],
+  ['tree_104',['tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]],
+  ['tree234_105',['Tree234',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html',1,'data_structures::tree_234']]],
+  ['tree_5f234_106',['tree_234',['../d6/dab/namespacetree__234.html',1,'']]],
+  ['tree_5f234_2ecpp_107',['tree_234.cpp',['../db/dbc/tree__234_8cpp.html',1,'']]],
+  ['triangle_5farea_108',['triangle_area',['../dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc',1,'math']]],
+  ['triangle_5fperimeter_109',['triangle_perimeter',['../dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3',1,'math']]],
+  ['triangle_5fprism_5fvolume_110',['triangle_prism_volume',['../dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c',1,'math']]],
+  ['trianglearea_111',['TriangleArea',['../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc',1,'smallest_circle.cpp']]],
+  ['trie_112',['Trie',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html',1,'data_structures::trie_using_hashmap::Trie'],['../dd/d2f/class_trie.html',1,'Trie'],['../dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908',1,'Trie::Trie()'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a092d0805a9e647c2048777dbe67b35ab',1,'data_structures::trie_using_hashmap::Trie::Trie()']]],
+  ['trie_113',['trie',['../d0/d3e/classdata__structures_1_1trie.html',1,'data_structures::trie'],['../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8',1,'data_structures::trie::trie()']]],
+  ['trie_5fmodern_2ecpp_114',['trie_modern.cpp',['../dc/d93/trie__modern_8cpp.html',1,'']]],
+  ['trie_5fmultiple_5fsearch_2ecpp_115',['trie_multiple_search.cpp',['../d7/def/trie__multiple__search_8cpp.html',1,'']]],
+  ['trie_5foperations_116',['trie_operations',['../df/d8e/namespacetrie__operations.html',1,'']]],
+  ['trie_5ftree_2ecpp_117',['trie_tree.cpp',['../d7/d83/trie__tree_8cpp.html',1,'']]],
+  ['trie_5fusing_5fhashmap_118',['trie_using_hashmap',['../d7/d0a/namespacetrie__using__hashmap.html',1,'']]],
+  ['trie_5fusing_5fhashmap_2ecpp_119',['trie_using_hashmap.cpp',['../d5/d8a/trie__using__hashmap_8cpp.html',1,'']]],
+  ['trienode_120',['TrieNode',['../de/d48/struct_trie_1_1_trie_node.html',1,'Trie']]],
+  ['tryleftrotate_121',['TryLeftRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9',1,'data_structures::tree_234::Tree234']]],
+  ['tryrightrotate_122',['TryRightRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3',1,'data_structures::tree_234::Tree234']]],
+  ['typical_20structure_20of_20a_20program_123',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]]
 ];
diff --git a/search/all_1a.js b/search/all_1a.js
index 409b9b8f3..5bacbb01c 100644
--- a/search/all_1a.js
+++ b/search/all_1a.js
@@ -1,93 +1,29 @@
 var searchData=
 [
-  ['u16streampos_0',['u16streampos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]],
-  ['u16string_1',['u16string',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std::u16string'],['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::u16string::u16string()']]],
-  ['u32streampos_2',['u32streampos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]],
-  ['u32string_3',['u32string',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std::u32string'],['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::u32string::u32string()']]],
-  ['uflow_4',['uflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_filebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wstringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::stringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wfilebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wstreambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::strstreambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_stringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_streambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::filebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::streambuf::uflow()']]],
-  ['uint128_5ft_5',['uint128_t',['../db/d9a/classuint128__t.html',1,'uint128_t'],['../db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040',1,'uint128_t::uint128_t(T low)'],['../db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac',1,'uint128_t::uint128_t(const std::string &amp;str)'],['../db/d9a/classuint128__t.html#a95ac8be8f414fcbce09301b912f5079d',1,'uint128_t::uint128_t(const uint64_t high, const uint64_t low)'],['../db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b',1,'uint128_t::uint128_t(const uint128_t &amp;num)=default'],['../db/d9a/classuint128__t.html#a7d56143b2e291e8087188192533d2e3c',1,'uint128_t::uint128_t(uint128_t &amp;&amp;num) noexcept']]],
-  ['uint128_5ft_2ehpp_6',['uint128_t.hpp',['../da/d41/uint128__t_8hpp.html',1,'']]],
-  ['uint128_5ft_5ftests_7',['uint128_t_tests',['../df/d2c/elliptic__curve__key__exchange_8cpp.html#a8800c8a84d77dadadb05ad5e83b77ef4',1,'elliptic_curve_key_exchange.cpp']]],
-  ['uint16_5ft_8',['uint16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['uint256_5ft_9',['uint256_t',['../d1/d83/classuint256__t.html',1,'uint256_t'],['../d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc',1,'uint256_t::uint256_t(T low)'],['../d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39',1,'uint256_t::uint256_t(const std::string &amp;str)'],['../d1/d83/classuint256__t.html#a42bf7490b31d8c750a67fd9bb6f2df2e',1,'uint256_t::uint256_t(const uint256_t &amp;num)=default'],['../d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa',1,'uint256_t::uint256_t(uint256_t &amp;&amp;num) noexcept'],['../d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3',1,'uint256_t::uint256_t(uint128_t high, uint128_t low)'],['../d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052',1,'uint256_t::uint256_t(const uint64_t high, const uint64_t low)']]],
-  ['uint256_5ft_2ehpp_10',['uint256_t.hpp',['../da/da3/uint256__t_8hpp.html',1,'']]],
-  ['uint256_5ft_5ftests_11',['uint256_t_tests',['../df/d2c/elliptic__curve__key__exchange_8cpp.html#a37775d1724ffe404c088dabbc8da91ae',1,'elliptic_curve_key_exchange.cpp']]],
-  ['uint32_5ft_12',['uint32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['uint64_5ft_13',['uint64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['uint8_5ft_14',['uint8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['uint_5ffast16_5ft_15',['uint_fast16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['uint_5ffast32_5ft_16',['uint_fast32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['uint_5ffast64_5ft_17',['uint_fast64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['uint_5ffast8_5ft_18',['uint_fast8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['uint_5fleast16_5ft_19',['uint_least16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['uint_5fleast32_5ft_20',['uint_least32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['uint_5fleast64_5ft_21',['uint_least64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['uint_5fleast8_5ft_22',['uint_least8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['uintmax_5ft_23',['uintmax_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['uintptr_5ft_24',['uintptr_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['unary_5ffunction_25',['unary_function',['http://en.cppreference.com/w/cpp/utility/functional/unary_function.html',0,'std']]],
-  ['unary_5fnegate_26',['unary_negate',['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate'],['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate::unary_negate()']]],
-  ['unbounded_5f0_5f1_5fknapsack_2ecpp_27',['unbounded_0_1_knapsack.cpp',['../d9/dec/unbounded__0__1__knapsack_8cpp.html',1,'']]],
-  ['unboundedknapsack_28',['unboundedKnapsack',['../d9/dec/unbounded__0__1__knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef',1,'dynamic_programming::unbounded_knapsack']]],
-  ['uncaught_5fexception_29',['uncaught_exception',['http://en.cppreference.com/w/cpp/error/uncaught_exception.html',0,'std']]],
-  ['undeclare_5fno_5fpointers_30',['undeclare_no_pointers',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_no_pointers.html',0,'std']]],
-  ['undeclare_5freachable_31',['undeclare_reachable',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_reachable.html',0,'std']]],
-  ['underflow_32',['underflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wfilebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::strstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_streambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::streambuf::underflow()']]],
-  ['underflow_5ferror_33',['underflow_error',['http://en.cppreference.com/w/cpp/error/underflow_error.html',0,'std::underflow_error'],['http://en.cppreference.com/w/cpp/error/underflow_error.html',0,'std::underflow_error::underflow_error()']]],
-  ['underlying_5ftype_34',['underlying_type',['http://en.cppreference.com/w/cpp/types/underlying_type.html',0,'std']]],
-  ['unexpected_35',['unexpected',['http://en.cppreference.com/w/cpp/error/unexpected.html',0,'std']]],
-  ['unexpected_5fhandler_36',['unexpected_handler',['http://en.cppreference.com/w/cpp/error/unexpected_handler.html',0,'std']]],
-  ['unget_37',['unget',['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::strstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istrstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wiostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_ifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wfstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wstringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::ifstream::unget()']]],
-  ['ungetc_38',['ungetc',['http://en.cppreference.com/w/cpp/io/c/ungetc.html',0,'std']]],
-  ['ungetwc_39',['ungetwc',['http://en.cppreference.com/w/cpp/io/c/ungetwc.html',0,'std']]],
-  ['uniform_5fint_5fdistribution_40',['uniform_int_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution.html',0,'std::uniform_int_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/uniform_int_distribution.html',0,'std::uniform_int_distribution::uniform_int_distribution()']]],
-  ['uniform_5frandom_5finitialization_41',['uniform_random_initialization',['../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905',1,'machine_learning']]],
-  ['uniform_5freal_5fdistribution_42',['uniform_real_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution.html',0,'std::uniform_real_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/uniform_real_distribution.html',0,'std::uniform_real_distribution::uniform_real_distribution()']]],
-  ['uninitialized_5fcopy_43',['uninitialized_copy',['http://en.cppreference.com/w/cpp/memory/uninitialized_copy.html',0,'std']]],
-  ['uninitialized_5fcopy_5fn_44',['uninitialized_copy_n',['http://en.cppreference.com/w/cpp/memory/uninitialized_copy_n.html',0,'std']]],
-  ['uninitialized_5ffill_45',['uninitialized_fill',['http://en.cppreference.com/w/cpp/memory/uninitialized_fill.html',0,'std']]],
-  ['uninitialized_5ffill_5fn_46',['uninitialized_fill_n',['http://en.cppreference.com/w/cpp/memory/uninitialized_fill_n.html',0,'std']]],
-  ['union_47',['Union',['../de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757',1,'disjoint_set.cpp']]],
-  ['union_5fof_5ftwo_5farrays_2ecpp_48',['union_of_two_arrays.cpp',['../d8/d9c/union__of__two__arrays_8cpp.html',1,'']]],
-  ['union_5fsets_49',['union_sets',['../d8/d99/connected__components__with__dsu_8cpp.html#a67cb7472f310a798f555fe45cdf50145',1,'graph::disjoint_union']]],
-  ['unionset_50',['UnionSet',['../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559',1,'dsu']]],
-  ['unionset_51',['unionSet',['../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f',1,'dsu']]],
-  ['unique_52',['unique',['http://en.cppreference.com/w/cpp/memory/shared_ptr/unique.html',0,'std::shared_ptr::unique()'],['http://en.cppreference.com/w/cpp/container/forward_list/unique.html',0,'std::forward_list::unique()'],['http://en.cppreference.com/w/cpp/container/list/unique.html',0,'std::list::unique()'],['http://en.cppreference.com/w/cpp/algorithm/unique.html',0,'std::unique(T... args)']]],
-  ['unique_5fcopy_53',['unique_copy',['http://en.cppreference.com/w/cpp/algorithm/unique_copy.html',0,'std']]],
-  ['unique_5flock_54',['unique_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock.html',0,'std::unique_lock&lt; T &gt;'],['http://en.cppreference.com/w/cpp/thread/unique_lock/unique_lock.html',0,'std::unique_lock::unique_lock()']]],
-  ['unique_5fptr_55',['unique_ptr',['http://en.cppreference.com/w/cpp/memory/unique_ptr.html',0,'std::unique_ptr&lt; T &gt;'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/unique_ptr.html',0,'std::unique_ptr::unique_ptr()']]],
-  ['unique_5fptr_3c_20binary_5fsearch_5ftree_3a_3abst_5fnode_20_3e_56',['unique_ptr&lt; binary_search_tree::bst_node &gt;',['http://en.cppreference.com/w/cpp/memory/unique_ptr.html',0,'std']]],
-  ['unique_5fptr_3c_20t_5b_5d_3e_57',['unique_ptr&lt; T[]&gt;',['http://en.cppreference.com/w/cpp/memory/unique_ptr.html',0,'std']]],
-  ['unit_5fmatrix_5finitialization_58',['unit_matrix_initialization',['../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4',1,'machine_learning']]],
-  ['unitbuf_59',['unitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]],
-  ['unlock_60',['unlock',['http://en.cppreference.com/w/cpp/thread/unique_lock/unlock.html',0,'std::unique_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/unlock.html',0,'std::recursive_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/unlock.html',0,'std::recursive_timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/unlock.html',0,'std::shared_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/unlock.html',0,'std::timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/mutex/unlock.html',0,'std::mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock.html',0,'std::shared_timed_mutex::unlock(T... args)']]],
-  ['unlock_5fshared_61',['unlock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock_shared.html',0,'std::shared_timed_mutex']]],
-  ['unordered_5fmap_62',['unordered_map',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std::unordered_map&lt; K, T &gt;'],['http://en.cppreference.com/w/cpp/container/unordered_map/unordered_map.html',0,'std::unordered_map::unordered_map()']]],
-  ['unordered_5fmap_3c_20char16_5ft_2c_20std_3a_3ashared_5fptr_3c_20data_5fstructures_3a_3atrie_5fusing_5fhashmap_3a_3atrie_3a_3anode_20_3e_20_3e_63',['unordered_map&lt; char16_t, std::shared_ptr&lt; data_structures::trie_using_hashmap::Trie::Node &gt; &gt;',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]],
-  ['unordered_5fmap_3c_20int_2c_20std_3a_3apair_3c_20others_3a_3acache_3a_3ad_5fnode_3c_20k_2c_20v_20_3e_20_2a_2c_20others_3a_3acache_3a_3ad_5fnode_3c_20k_2c_20v_20_3e_20_2a_20_3e_20_3e_64',['unordered_map&lt; int, std::pair&lt; others::Cache::D_Node&lt; K, V &gt; *, others::Cache::D_Node&lt; K, V &gt; * &gt; &gt;',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]],
-  ['unordered_5fmap_3c_20k_2c_20others_3a_3acache_3a_3ad_5fnode_3c_20k_2c_20v_20_3e_20_2a_20_3e_65',['unordered_map&lt; K, others::Cache::D_Node&lt; K, V &gt; * &gt;',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]],
-  ['unordered_5fmap_3c_20k_2c_20std_3a_3apair_3c_20others_3a_3acache_3a_3ad_5fnode_3c_20k_2c_20v_20_3e_20_2a_2c_20int_20_3e_20_3e_66',['unordered_map&lt; K, std::pair&lt; others::Cache::D_Node&lt; K, V &gt; *, int &gt; &gt;',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]],
-  ['unordered_5fmap_3c_20uint64_5ft_2c_20std_3a_3alist_3c_20uint64_5ft_20_3e_3a_3aiterator_20_3e_67',['unordered_map&lt; uint64_t, std::list&lt; uint64_t &gt;::iterator &gt;',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]],
-  ['unordered_5fmultimap_68',['unordered_multimap',['http://en.cppreference.com/w/cpp/container/unordered_multimap.html',0,'std::unordered_multimap&lt; K, T &gt;'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/unordered_multimap.html',0,'std::unordered_multimap::unordered_multimap()']]],
-  ['unordered_5fmultiset_69',['unordered_multiset',['http://en.cppreference.com/w/cpp/container/unordered_multiset.html',0,'std::unordered_multiset&lt; K &gt;'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/unordered_multiset.html',0,'std::unordered_multiset::unordered_multiset()']]],
-  ['unordered_5fset_70',['unordered_set',['http://en.cppreference.com/w/cpp/container/unordered_set.html',0,'std::unordered_set&lt; K &gt;'],['http://en.cppreference.com/w/cpp/container/unordered_set/unordered_set.html',0,'std::unordered_set::unordered_set()']]],
-  ['unordered_5fset_3c_20s_20_3e_71',['unordered_set&lt; S &gt;',['http://en.cppreference.com/w/cpp/container/unordered_set.html',0,'std']]],
-  ['unsetf_72',['unsetf',['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ios::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ios_base::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::strstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wiostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wfstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wstringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ifstream::unsetf()']]],
-  ['unshift_73',['unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::unshift()']]],
-  ['up_74',['up',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad',1,'graph::LowestCommonAncestor']]],
-  ['update_75',['update',['../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1',1,'data_structures::SegmentTree::update(int i, int l, int r, int pos, T val)'],['../dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17',1,'data_structures::SegmentTree::update(int pos, T val)'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7',1,'data_structures::treap::Treap::update()'],['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3',1,'hashing::sha256::Hash::update()'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9',1,'range_queries::fenwick_tree::update()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c',1,'range_queries::heavy_light_decomposition::SG::update()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57',1,'range_queries::heavy_light_decomposition::HLD::update()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6',1,'range_queries::perSegTree::update(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value, std::shared_ptr&lt; Node &gt; const &amp;curr)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d',1,'range_queries::perSegTree::update(const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value)'],['../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0',1,'update(std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos):&#160;segtree.cpp']]],
-  ['update_5fstep_76',['update_step',['../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217',1,'extended_euclid_algorithm.cpp']]],
-  ['update_5fweights_77',['update_weights',['../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3',1,'machine_learning::update_weights(const std::valarray&lt; double &gt; &amp;X, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; *W, std::vector&lt; std::valarray&lt; double &gt; &gt; *D, double alpha, int R)'],['../d8/d77/namespacemachine__learning.html#aa6aac06ccf128b0a9c55c9ee1a8e5631',1,'machine_learning::update_weights(const std::valarray&lt; double &gt; &amp;x, std::vector&lt; std::valarray&lt; double &gt; &gt; *W, std::valarray&lt; double &gt; *D, double alpha, int R)']]],
-  ['upper_78',['upper',['../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705',1,'uint128_t::upper()'],['../d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5',1,'uint256_t::upper()']]],
-  ['upper_5fbound_79',['upper_bound',['http://en.cppreference.com/w/cpp/container/multiset/upper_bound.html',0,'std::multiset::upper_bound()'],['http://en.cppreference.com/w/cpp/container/set/upper_bound.html',0,'std::set::upper_bound()'],['http://en.cppreference.com/w/cpp/container/map/upper_bound.html',0,'std::map::upper_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/upper_bound.html',0,'std::multimap::upper_bound()'],['http://en.cppreference.com/w/cpp/algorithm/upper_bound.html',0,'std::upper_bound(T... args)']]],
-  ['uppercase_80',['uppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]],
-  ['use_20parent_20pointer_20store_20the_20address_20of_20parent_20nodes_81',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
-  ['use_5fcount_82',['use_count',['http://en.cppreference.com/w/cpp/memory/weak_ptr/use_count.html',0,'std::weak_ptr']]],
-  ['use_5ffacet_83',['use_facet',['http://en.cppreference.com/w/cpp/locale/use_facet.html',0,'std']]],
-  ['used_84',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md98',1,'']]],
-  ['user_20interface_85',['User-interface',['../dc/d64/md__coding_guidelines.html#autotoc_md18',1,'']]],
-  ['user_5finput_5ftest_86',['user_input_test',['../d4/d38/power__of__two_8cpp.html#adfd6be45be425ae28c62ce3bfb4b40dc',1,'power_of_two.cpp']]],
-  ['uses_5fallocator_87',['uses_allocator',['http://en.cppreference.com/w/cpp/memory/uses_allocator.html',0,'std']]],
-  ['util_5ffunctions_88',['util_functions',['../d3/d17/namespaceutil__functions.html',1,'']]],
-  ['utils_89',['utils',['../d6/d84/namespaceutils.html',1,'']]]
+  ['uint128_5ft_0',['uint128_t',['../db/d9a/classuint128__t.html',1,'uint128_t'],['../db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040',1,'uint128_t::uint128_t(T low)'],['../db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac',1,'uint128_t::uint128_t(const std::string &amp;str)'],['../db/d9a/classuint128__t.html#a95ac8be8f414fcbce09301b912f5079d',1,'uint128_t::uint128_t(const uint64_t high, const uint64_t low)'],['../db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b',1,'uint128_t::uint128_t(const uint128_t &amp;num)=default'],['../db/d9a/classuint128__t.html#a7d56143b2e291e8087188192533d2e3c',1,'uint128_t::uint128_t(uint128_t &amp;&amp;num) noexcept']]],
+  ['uint128_5ft_2ehpp_1',['uint128_t.hpp',['../da/d41/uint128__t_8hpp.html',1,'']]],
+  ['uint128_5ft_5ftests_2',['uint128_t_tests',['../df/d2c/elliptic__curve__key__exchange_8cpp.html#a8800c8a84d77dadadb05ad5e83b77ef4',1,'elliptic_curve_key_exchange.cpp']]],
+  ['uint256_5ft_3',['uint256_t',['../d1/d83/classuint256__t.html',1,'uint256_t'],['../d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc',1,'uint256_t::uint256_t(T low)'],['../d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39',1,'uint256_t::uint256_t(const std::string &amp;str)'],['../d1/d83/classuint256__t.html#a42bf7490b31d8c750a67fd9bb6f2df2e',1,'uint256_t::uint256_t(const uint256_t &amp;num)=default'],['../d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa',1,'uint256_t::uint256_t(uint256_t &amp;&amp;num) noexcept'],['../d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3',1,'uint256_t::uint256_t(uint128_t high, uint128_t low)'],['../d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052',1,'uint256_t::uint256_t(const uint64_t high, const uint64_t low)']]],
+  ['uint256_5ft_2ehpp_4',['uint256_t.hpp',['../da/da3/uint256__t_8hpp.html',1,'']]],
+  ['uint256_5ft_5ftests_5',['uint256_t_tests',['../df/d2c/elliptic__curve__key__exchange_8cpp.html#a37775d1724ffe404c088dabbc8da91ae',1,'elliptic_curve_key_exchange.cpp']]],
+  ['unbounded_5f0_5f1_5fknapsack_2ecpp_6',['unbounded_0_1_knapsack.cpp',['../d9/dec/unbounded__0__1__knapsack_8cpp.html',1,'']]],
+  ['unboundedknapsack_7',['unboundedKnapsack',['../d9/dec/unbounded__0__1__knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef',1,'dynamic_programming::unbounded_knapsack']]],
+  ['uniform_5frandom_5finitialization_8',['uniform_random_initialization',['../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905',1,'machine_learning']]],
+  ['union_9',['Union',['../de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757',1,'disjoint_set.cpp']]],
+  ['union_5fof_5ftwo_5farrays_2ecpp_10',['union_of_two_arrays.cpp',['../d8/d9c/union__of__two__arrays_8cpp.html',1,'']]],
+  ['union_5fsets_11',['union_sets',['../d8/d99/connected__components__with__dsu_8cpp.html#a67cb7472f310a798f555fe45cdf50145',1,'graph::disjoint_union']]],
+  ['unionset_12',['UnionSet',['../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559',1,'dsu']]],
+  ['unionset_13',['unionSet',['../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f',1,'dsu']]],
+  ['unit_5fmatrix_5finitialization_14',['unit_matrix_initialization',['../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4',1,'machine_learning']]],
+  ['up_15',['up',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad',1,'graph::LowestCommonAncestor']]],
+  ['update_16',['update',['../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1',1,'data_structures::SegmentTree::update(int i, int l, int r, int pos, T val)'],['../dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17',1,'data_structures::SegmentTree::update(int pos, T val)'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7',1,'data_structures::treap::Treap::update()'],['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3',1,'hashing::sha256::Hash::update()'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9',1,'range_queries::fenwick_tree::update()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c',1,'range_queries::heavy_light_decomposition::SG::update()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57',1,'range_queries::heavy_light_decomposition::HLD::update()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6',1,'range_queries::perSegTree::update(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value, std::shared_ptr&lt; Node &gt; const &amp;curr)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d',1,'range_queries::perSegTree::update(const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value)'],['../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0',1,'update(std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos):&#160;segtree.cpp']]],
+  ['update_5fstep_17',['update_step',['../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217',1,'extended_euclid_algorithm.cpp']]],
+  ['update_5fweights_18',['update_weights',['../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3',1,'machine_learning::update_weights(const std::valarray&lt; double &gt; &amp;X, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; *W, std::vector&lt; std::valarray&lt; double &gt; &gt; *D, double alpha, int R)'],['../d8/d77/namespacemachine__learning.html#aa6aac06ccf128b0a9c55c9ee1a8e5631',1,'machine_learning::update_weights(const std::valarray&lt; double &gt; &amp;x, std::vector&lt; std::valarray&lt; double &gt; &gt; *W, std::valarray&lt; double &gt; *D, double alpha, int R)']]],
+  ['upper_19',['upper',['../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705',1,'uint128_t::upper()'],['../d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5',1,'uint256_t::upper()']]],
+  ['use_20parent_20pointer_20store_20the_20address_20of_20parent_20nodes_20',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
+  ['used_21',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md98',1,'']]],
+  ['user_20interface_22',['User-interface',['../dc/d64/md__coding_guidelines.html#autotoc_md18',1,'']]],
+  ['user_5finput_5ftest_23',['user_input_test',['../d4/d38/power__of__two_8cpp.html#adfd6be45be425ae28c62ce3bfb4b40dc',1,'power_of_two.cpp']]],
+  ['util_5ffunctions_24',['util_functions',['../d3/d17/namespaceutil__functions.html',1,'']]],
+  ['utils_25',['utils',['../d6/d84/namespaceutils.html',1,'']]]
 ];
diff --git a/search/all_1b.js b/search/all_1b.js
index 5fcdfe5de..28978ec20 100644
--- a/search/all_1b.js
+++ b/search/all_1b.js
@@ -1,68 +1,19 @@
 var searchData=
 [
   ['v_5fstack_0',['v_stack',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af12ceffdc07cc87eca8a4a8ac87d60fe',1,'divide_and_conquer::strassens_multiplication::Matrix']]],
-  ['va_5flist_1',['va_list',['http://en.cppreference.com/w/cpp/utility/variadic/va_list.html',0,'']]],
-  ['val_2',['val',['../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf',1,'range_queries::perSegTree::Node::val'],['../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3',1,'ListNode::val'],['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#acf96f3a9a1d3b15268c38e8822300c11',1,'data_structures::linked_list::link::val()']]],
-  ['valarray_3',['valarray',['http://en.cppreference.com/w/cpp/numeric/valarray.html',0,'std']]],
-  ['valarray_3c_20double_20_3e_4',['valarray&lt; double &gt;',['http://en.cppreference.com/w/cpp/numeric/valarray.html',0,'std']]],
-  ['valid_5',['valid',['http://en.cppreference.com/w/cpp/thread/shared_future/valid.html',0,'std::shared_future::valid()'],['http://en.cppreference.com/w/cpp/thread/future/valid.html',0,'std::future::valid()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/valid.html',0,'std::packaged_task::valid()']]],
-  ['value_6',['value',['../dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29',1,'binary_search_tree::bst_node::value'],['../d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731',1,'data_structures::Node::value'],['http://en.cppreference.com/w/cpp/error/error_code/value.html',0,'std::error_code::value()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/value.html',0,'std::regex_traits::value()'],['http://en.cppreference.com/w/cpp/error/error_condition/value.html',0,'std::error_condition::value()'],['http://en.cppreference.com/w/cpp/experimental/optional/value.html',0,'std::experimental::optional::value()']]],
-  ['value_5fcomp_7',['value_comp',['http://en.cppreference.com/w/cpp/container/multiset/value_comp.html',0,'std::multiset::value_comp()'],['http://en.cppreference.com/w/cpp/container/set/value_comp.html',0,'std::set::value_comp()'],['http://en.cppreference.com/w/cpp/container/map/value_comp.html',0,'std::map::value_comp()'],['http://en.cppreference.com/w/cpp/container/multimap/value_comp.html',0,'std::multimap::value_comp()']]],
-  ['value_5fcompare_8',['value_compare',['http://en.cppreference.com/w/cpp/container/map/value_compare.html',0,'std::map&lt; K, T &gt;::value_compare'],['http://en.cppreference.com/w/cpp/container/multimap/value_compare.html',0,'std::multimap&lt; K, T &gt;::value_compare']]],
-  ['value_5for_9',['value_or',['http://en.cppreference.com/w/cpp/experimental/optional/value_or.html',0,'std::experimental::optional']]],
-  ['values_10',['values',['../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9',1,'tower::values'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::values()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a03a896b34d27fda69049827e0c4dab42',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::values(Node *root)']]],
-  ['variance_11',['variance',['../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92',1,'statistics::stats_computer1::variance()'],['../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555',1,'statistics::stats_computer2::variance()'],['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960',1,'probability::geometric_dist::geometric_distribution::variance()']]],
-  ['vec_12',['vec',['../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3',1,'range_queries::perSegTree']]],
-  ['vector_13',['vector',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std::vector&lt; T &gt;'],['http://en.cppreference.com/w/cpp/container/vector/vector.html',0,'std::vector::vector()']]],
-  ['vector_3c_20bool_20_3e_14',['vector&lt; bool &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20double_20_3e_15',['vector&lt; double &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20edge_20_3e_16',['vector&lt; Edge &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20geometry_3a_3ajarvis_3a_3apoint_20_3e_17',['vector&lt; geometry::jarvis::Point &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20int_20_3e_18',['vector&lt; int &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20int64_5ft_20_3e_19',['vector&lt; int64_t &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20machine_5flearning_3a_3aneural_5fnetwork_3a_3alayers_3a_3adenselayer_20_3e_20',['vector&lt; machine_learning::neural_network::layers::DenseLayer &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20operations_5fon_5fdatastructures_3a_3atrie_5foperations_3a_3atnode_20_2a_20_3e_21',['vector&lt; operations_on_datastructures::trie_operations::Tnode * &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20size_5ft_20_3e_22',['vector&lt; size_t &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20std_3a_3afunction_3c_20std_3a_3asize_5ft_28t_29_3e_20_3e_23',['vector&lt; std::function&lt; std::size_t(T)&gt; &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20std_3a_3alist_3c_20int_20_3e_20_3e_24',['vector&lt; std::list&lt; int &gt; &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20std_3a_3apair_3c_20int8_5ft_2c_20int8_5ft_20_3e_20_3e_25',['vector&lt; std::pair&lt; int8_t, int8_t &gt; &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20std_3a_3ashared_5fptr_3c_20data_5fstructures_3a_3anode_20_3e_20_3e_26',['vector&lt; std::shared_ptr&lt; data_structures::Node &gt; &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20std_3a_3ashared_5fptr_3c_20node_20_3e_20_3e_27',['vector&lt; std::shared_ptr&lt; Node &gt; &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20std_3a_3ashared_5fptr_3c_20range_5fqueries_3a_3apersegtree_3a_3anode_20_3e_20_3e_28',['vector&lt; std::shared_ptr&lt; range_queries::perSegTree::Node &gt; &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20std_3a_3asize_5ft_20_3e_29',['vector&lt; std::size_t &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20std_3a_3astring_20_3e_30',['vector&lt; std::string &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20std_3a_3atuple_3c_20int_2c_20int_2c_20int_20_3e_20_3e_31',['vector&lt; std::tuple&lt; int, int, int &gt; &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20std_3a_3atuple_3c_20s_2c_20t_2c_20e_2c_20double_2c_20double_2c_20double_20_3e_20_3e_32',['vector&lt; std::tuple&lt; S, T, E, double, double, double &gt; &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20std_3a_3auint64_5ft_20_3e_33',['vector&lt; std::uint64_t &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20std_3a_3avalarray_3c_20double_20_3e_20_3e_34',['vector&lt; std::valarray&lt; double &gt; &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20std_3a_3avector_3c_20double_20_3e_20_3e_35',['vector&lt; std::vector&lt; double &gt; &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20std_3a_3avector_3c_20int_20_3e_20_3e_36',['vector&lt; std::vector&lt; int &gt; &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20std_3a_3avector_3c_20t_20_3e_20_3e_37',['vector&lt; std::vector&lt; T &gt; &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20uint64_5ft_20_3e_38',['vector&lt; uint64_t &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20unsigned_20char_20_3e_39',['vector&lt; unsigned char &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20unsigned_20int_20_3e_40',['vector&lt; unsigned int &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_3c_20x_20_3e_41',['vector&lt; X &gt;',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]],
-  ['vector_5fcross_42',['vector_cross',['../d4/d91/namespacevector__cross.html',1,'']]],
-  ['vector_5fcross_5fproduct_2ecpp_43',['vector_cross_product.cpp',['../df/d66/vector__cross__product_8cpp.html',1,'']]],
-  ['vector_5fdot_44',['vector_dot',['../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec',1,'qr_algorithm']]],
-  ['vector_5fimportant_5ffunctions_2ecpp_45',['vector_important_functions.cpp',['../d3/d61/vector__important__functions_8cpp.html',1,'']]],
-  ['vector_5fmag_46',['vector_mag',['../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f',1,'qr_algorithm']]],
-  ['vector_5fops_2ehpp_47',['vector_ops.hpp',['../d8/d95/vector__ops_8hpp.html',1,'']]],
-  ['vector_5fproj_48',['vector_proj',['../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc',1,'qr_algorithm']]],
-  ['vfprintf_49',['vfprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]],
-  ['vfscanf_50',['vfscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]],
-  ['vfwprintf_51',['vfwprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]],
-  ['vfwscanf_52',['vfwscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]],
-  ['vigenere_53',['vigenere',['../d6/da2/namespacevigenere.html',1,'']]],
-  ['vigenere_5fcipher_2ecpp_54',['vigenere_cipher.cpp',['../dd/d12/vigenere__cipher_8cpp.html',1,'']]],
-  ['volume_2ecpp_55',['volume.cpp',['../da/d39/volume_8cpp.html',1,'']]],
-  ['vprintf_56',['vprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]],
-  ['vscanf_57',['vscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]],
-  ['vsnprintf_58',['vsnprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]],
-  ['vsprintf_59',['vsprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]],
-  ['vsscanf_60',['vsscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]],
-  ['vswprintf_61',['vswprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]],
-  ['vswscanf_62',['vswscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]],
-  ['vwprintf_63',['vwprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]],
-  ['vwscanf_64',['vwscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]]
+  ['val_1',['val',['../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf',1,'range_queries::perSegTree::Node::val'],['../d7/da4/struct_list_node.html#a58389d1d1fc5430c2f4ce7c5d5dc48b3',1,'ListNode::val'],['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#acf96f3a9a1d3b15268c38e8822300c11',1,'data_structures::linked_list::link::val()']]],
+  ['value_2',['value',['../dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29',1,'binary_search_tree::bst_node::value'],['../d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731',1,'data_structures::Node::value']]],
+  ['values_3',['values',['../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9',1,'tower::values'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::values()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a03a896b34d27fda69049827e0c4dab42',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::values(Node *root)']]],
+  ['variance_4',['variance',['../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92',1,'statistics::stats_computer1::variance()'],['../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555',1,'statistics::stats_computer2::variance()'],['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960',1,'probability::geometric_dist::geometric_distribution::variance()']]],
+  ['vec_5',['vec',['../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3',1,'range_queries::perSegTree']]],
+  ['vector_5fcross_6',['vector_cross',['../d4/d91/namespacevector__cross.html',1,'']]],
+  ['vector_5fcross_5fproduct_2ecpp_7',['vector_cross_product.cpp',['../df/d66/vector__cross__product_8cpp.html',1,'']]],
+  ['vector_5fdot_8',['vector_dot',['../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec',1,'qr_algorithm']]],
+  ['vector_5fimportant_5ffunctions_2ecpp_9',['vector_important_functions.cpp',['../d3/d61/vector__important__functions_8cpp.html',1,'']]],
+  ['vector_5fmag_10',['vector_mag',['../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f',1,'qr_algorithm']]],
+  ['vector_5fops_2ehpp_11',['vector_ops.hpp',['../d8/d95/vector__ops_8hpp.html',1,'']]],
+  ['vector_5fproj_12',['vector_proj',['../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc',1,'qr_algorithm']]],
+  ['vigenere_13',['vigenere',['../d6/da2/namespacevigenere.html',1,'']]],
+  ['vigenere_5fcipher_2ecpp_14',['vigenere_cipher.cpp',['../dd/d12/vigenere__cipher_8cpp.html',1,'']]],
+  ['volume_2ecpp_15',['volume.cpp',['../da/d39/volume_8cpp.html',1,'']]]
 ];
diff --git a/search/all_1c.js b/search/all_1c.js
index c679ecaf2..e6f76d2df 100644
--- a/search/all_1c.js
+++ b/search/all_1c.js
@@ -1,102 +1,24 @@
 var searchData=
 [
-  ['wait_0',['wait',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/wait.html',0,'std::condition_variable_any::wait()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/wait.html',0,'std::condition_variable::wait()'],['http://en.cppreference.com/w/cpp/thread/shared_future/wait.html',0,'std::shared_future::wait()'],['http://en.cppreference.com/w/cpp/thread/future/wait.html',0,'std::future::wait()']]],
-  ['wait_5ffor_1',['wait_for',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/wait_for.html',0,'std::condition_variable_any::wait_for()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/wait_for.html',0,'std::condition_variable::wait_for()'],['http://en.cppreference.com/w/cpp/thread/shared_future/wait_for.html',0,'std::shared_future::wait_for()'],['http://en.cppreference.com/w/cpp/thread/future/wait_for.html',0,'std::future::wait_for()']]],
-  ['wait_5funtil_2',['wait_until',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/wait_until.html',0,'std::condition_variable_any::wait_until()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/wait_until.html',0,'std::condition_variable::wait_until()'],['http://en.cppreference.com/w/cpp/thread/shared_future/wait_until.html',0,'std::shared_future::wait_until()'],['http://en.cppreference.com/w/cpp/thread/future/wait_until.html',0,'std::future::wait_until()']]],
-  ['warning_3',['2. Warning',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md12',1,'']]],
-  ['wave_5fsort_4',['wave_sort',['../d9/d21/namespacewave__sort.html',1,'']]],
-  ['wave_5fsort_2ecpp_5',['wave_sort.cpp',['../db/d3f/wave__sort_8cpp.html',1,'']]],
-  ['wavesort_6',['waveSort',['../db/d3f/wave__sort_8cpp.html#a7d4f243b9dc13ace4ef77e30dbc56f12',1,'sorting::wave_sort']]],
-  ['wbuffer_5fconvert_7',['wbuffer_convert',['http://en.cppreference.com/w/cpp/locale/wbuffer_convert.html',0,'std::wbuffer_convert'],['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/wbuffer_convert.html',0,'std::wbuffer_convert::wbuffer_convert()']]],
-  ['wcerr_8',['wcerr',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]],
-  ['wcin_9',['wcin',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]],
-  ['wclog_10',['wclog',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]],
-  ['wcmatch_11',['wcmatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std::wcmatch'],['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::wcmatch::wcmatch()']]],
-  ['wcout_12',['wcout',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]],
-  ['wcregex_5fiterator_13',['wcregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::wcregex_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::wcregex_iterator::wcregex_iterator()']]],
-  ['wcregex_5ftoken_5fiterator_14',['wcregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::wcregex_token_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::wcregex_token_iterator::wcregex_token_iterator()']]],
-  ['wcrtomb_15',['wcrtomb',['http://en.cppreference.com/w/cpp/string/multibyte/wcrtomb.html',0,'std']]],
-  ['wcscat_16',['wcscat',['http://en.cppreference.com/w/cpp/string/wide/wcscat.html',0,'std']]],
-  ['wcschr_17',['wcschr',['http://en.cppreference.com/w/cpp/string/wide/wcschr.html',0,'std']]],
-  ['wcscmp_18',['wcscmp',['http://en.cppreference.com/w/cpp/string/wide/wcscmp.html',0,'std']]],
-  ['wcscoll_19',['wcscoll',['http://en.cppreference.com/w/cpp/string/wide/wcscoll.html',0,'std']]],
-  ['wcscpy_20',['wcscpy',['http://en.cppreference.com/w/cpp/string/wide/wcscpy.html',0,'std']]],
-  ['wcscspn_21',['wcscspn',['http://en.cppreference.com/w/cpp/string/wide/wcscspn.html',0,'std']]],
-  ['wcsftime_22',['wcsftime',['http://en.cppreference.com/w/cpp/chrono/c/wcsftime.html',0,'std']]],
-  ['wcslen_23',['wcslen',['http://en.cppreference.com/w/cpp/string/wide/wcslen.html',0,'std']]],
-  ['wcsncat_24',['wcsncat',['http://en.cppreference.com/w/cpp/string/wide/wcsncat.html',0,'std']]],
-  ['wcsncmp_25',['wcsncmp',['http://en.cppreference.com/w/cpp/string/wide/wcsncmp.html',0,'std']]],
-  ['wcsncpy_26',['wcsncpy',['http://en.cppreference.com/w/cpp/string/wide/wcsncpy.html',0,'std']]],
-  ['wcspbrk_27',['wcspbrk',['http://en.cppreference.com/w/cpp/string/wide/wcspbrk.html',0,'std']]],
-  ['wcsrchr_28',['wcsrchr',['http://en.cppreference.com/w/cpp/string/wide/wcsrchr.html',0,'std']]],
-  ['wcsspn_29',['wcsspn',['http://en.cppreference.com/w/cpp/string/wide/wcsspn.html',0,'std']]],
-  ['wcsstr_30',['wcsstr',['http://en.cppreference.com/w/cpp/string/wide/wcsstr.html',0,'std']]],
-  ['wcstod_31',['wcstod',['http://en.cppreference.com/w/cpp/string/wide/wcstof.html',0,'std']]],
-  ['wcstof_32',['wcstof',['http://en.cppreference.com/w/cpp/string/wide/wcstof.html',0,'std']]],
-  ['wcstoimax_33',['wcstoimax',['http://en.cppreference.com/w/cpp/string/wide/wcstoimax.html',0,'std']]],
-  ['wcstok_34',['wcstok',['http://en.cppreference.com/w/cpp/string/wide/wcstok.html',0,'std']]],
-  ['wcstol_35',['wcstol',['http://en.cppreference.com/w/cpp/string/wide/wcstol.html',0,'std']]],
-  ['wcstold_36',['wcstold',['http://en.cppreference.com/w/cpp/string/wide/wcstof.html',0,'std']]],
-  ['wcstoll_37',['wcstoll',['http://en.cppreference.com/w/cpp/string/wide/wcstol.html',0,'std']]],
-  ['wcstombs_38',['wcstombs',['http://en.cppreference.com/w/cpp/string/multibyte/wcstombs.html',0,'std']]],
-  ['wcstoul_39',['wcstoul',['http://en.cppreference.com/w/cpp/string/wide/wcstoul.html',0,'std']]],
-  ['wcstoull_40',['wcstoull',['http://en.cppreference.com/w/cpp/string/wide/wcstoul.html',0,'std']]],
-  ['wcstoumax_41',['wcstoumax',['http://en.cppreference.com/w/cpp/string/wide/wcstoimax.html',0,'std']]],
-  ['wcsub_5fmatch_42',['wcsub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std::wcsub_match'],['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::wcsub_match::wcsub_match()']]],
-  ['wcsxfrm_43',['wcsxfrm',['http://en.cppreference.com/w/cpp/string/wide/wcsxfrm.html',0,'std']]],
-  ['wctob_44',['wctob',['http://en.cppreference.com/w/cpp/string/multibyte/wctob.html',0,'std']]],
-  ['wctomb_45',['wctomb',['http://en.cppreference.com/w/cpp/string/multibyte/wctomb.html',0,'std']]],
-  ['wctrans_46',['wctrans',['http://en.cppreference.com/w/cpp/string/wide/wctrans.html',0,'std']]],
-  ['wctype_47',['wctype',['http://en.cppreference.com/w/cpp/string/wide/wctype.html',0,'std']]],
-  ['weak_5fptr_48',['weak_ptr',['http://en.cppreference.com/w/cpp/memory/weak_ptr.html',0,'std::weak_ptr&lt; T &gt;'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/weak_ptr.html',0,'std::weak_ptr::weak_ptr()']]],
-  ['weibull_5fdistribution_49',['weibull_distribution',['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution.html',0,'std::weibull_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/weibull_distribution.html',0,'std::weibull_distribution::weibull_distribution()']]],
-  ['weights_50',['weights',['../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492',1,'machine_learning::adaline']]],
-  ['wfilebuf_51',['wfilebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf.html',0,'std::wfilebuf'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::wfilebuf::wfilebuf()']]],
-  ['wfstream_52',['wfstream',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std::wfstream'],['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::wfstream::wfstream()']]],
-  ['what_53',['what',['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ofstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::fstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::runtime_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wostream::failure::what()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_array_new_length::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_typeid::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ios::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::logic_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_alloc::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_fstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_function_call::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::range_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::invalid_argument::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::iostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ios_base::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wistream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::out_of_range::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::stringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::domain_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::overflow_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_istream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::strstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_stringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::future_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istrstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_cast::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wiostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ofstream::failure::what()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_array_length::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_istringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::exception::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_optional_access::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostrstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_weak_ptr::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wfstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_iostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wofstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::underflow_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wstringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::regex_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::system_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wistringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::length_error::what()']]],
-  ['white_54',['WHITE',['../da/d4b/depth__first__search__with__stack_8cpp.html#afb80b42b42381658a12a57a975ecd0c7',1,'depth_first_search_with_stack.cpp']]],
-  ['widen_55',['widen',['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ofstream::widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype_byname::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::fstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ios::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_fstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::iostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wistream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::stringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wifstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_istream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::strstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_stringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istrstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wiostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ofstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_istringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ifstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istringstream::widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostrstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wfstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_iostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wofstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wstringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wistringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ifstream::widen()']]],
-  ['width_56',['width',['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::fstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ios::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_fstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::iostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ios_base::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wistream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::stringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wifstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_istream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::strstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_stringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istrstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wiostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_istringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ifstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostrstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wfstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_iostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wstringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wistringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ifstream::width()']]],
-  ['wifstream_57',['wifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std::wifstream'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::wifstream::wifstream()']]],
-  ['wiggle_5fsort_58',['wiggle_sort',['../d0/d52/namespacewiggle__sort.html',1,'']]],
-  ['wiggle_5fsort_2ecpp_59',['wiggle_sort.cpp',['../d1/dcc/wiggle__sort_8cpp.html',1,'']]],
-  ['wigglesort_60',['wiggleSort',['../d1/dcc/wiggle__sort_8cpp.html#a99eeded693ac073717282fae365957a1',1,'sorting::wiggle_sort']]],
-  ['wildcard_5fmatching_61',['wildcard_matching',['../db/d03/namespacewildcard__matching.html',1,'']]],
-  ['wildcard_5fmatching_2ecpp_62',['wildcard_matching.cpp',['../dc/d14/wildcard__matching_8cpp.html',1,'']]],
-  ['windowed_5fmedian_63',['windowed_median',['../dd/d21/namespacewindowed__median.html',1,'']]],
-  ['windowed_5fmedian_2ecpp_64',['windowed_median.cpp',['../d1/ded/windowed__median_8cpp.html',1,'']]],
-  ['windowedmedian_65',['WindowedMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html',1,'probability::windowed_median::WindowedMedian'],['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d',1,'probability::windowed_median::WindowedMedian::WindowedMedian()']]],
-  ['wiostream_66',['wiostream',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std::wiostream'],['http://en.cppreference.com/w/cpp/io/basic_iostream/basic_iostream.html',0,'std::wiostream::wiostream()']]],
-  ['wistream_67',['wistream',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std::wistream'],['http://en.cppreference.com/w/cpp/io/basic_istream/basic_istream.html',0,'std::wistream::wistream()']]],
-  ['wistringstream_68',['wistringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std::wistringstream'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::wistringstream::wistringstream()']]],
-  ['wmemchr_69',['wmemchr',['http://en.cppreference.com/w/cpp/string/wide/wmemchr.html',0,'std']]],
-  ['wmemcmp_70',['wmemcmp',['http://en.cppreference.com/w/cpp/string/wide/wmemcmp.html',0,'std']]],
-  ['wmemcpy_71',['wmemcpy',['http://en.cppreference.com/w/cpp/string/wide/wmemcpy.html',0,'std']]],
-  ['wmemmove_72',['wmemmove',['http://en.cppreference.com/w/cpp/string/wide/wmemmove.html',0,'std']]],
-  ['wmemset_73',['wmemset',['http://en.cppreference.com/w/cpp/string/wide/wmemset.html',0,'std']]],
-  ['wofstream_74',['wofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std::wofstream'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/basic_ofstream.html',0,'std::wofstream::wofstream()']]],
-  ['word_5fbreak_75',['word_break',['../d6/d53/namespaceword__break.html',1,'']]],
-  ['word_5fbreak_2ecpp_76',['word_break.cpp',['../d3/d84/word__break_8cpp.html',1,'']]],
-  ['word_5fend_77',['word_end',['../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a3cdb077745d3dc97212d693132371219',1,'data_structures::trie_using_hashmap::Trie::Node']]],
-  ['wordbreak_78',['wordBreak',['../d3/d84/word__break_8cpp.html#afe4dcd6fd5282e535685361cba645d7c',1,'dynamic_programming::word_break']]],
-  ['working_79',['Working',['../d5/d45/sublist__search_8cpp.html#autotoc_md109',1,'']]],
-  ['worst_20case_80',['Worst Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md113',1,'']]],
-  ['worst_20case_20average_20case_81',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]],
-  ['wostream_82',['wostream',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std::wostream'],['http://en.cppreference.com/w/cpp/io/basic_ostream/basic_ostream.html',0,'std::wostream::wostream()']]],
-  ['wostringstream_83',['wostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std::wostringstream'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::wostringstream::wostringstream()']]],
-  ['wprintf_84',['wprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]],
-  ['wregex_85',['wregex',['http://en.cppreference.com/w/cpp/regex/basic_regex.html',0,'std::wregex'],['http://en.cppreference.com/w/cpp/regex/basic_regex/basic_regex.html',0,'std::wregex::wregex()']]],
-  ['write_86',['write',['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::fstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_fstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::iostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::stringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::strstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_stringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wiostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostrstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wfstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_iostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wstringstream::write()']]],
-  ['ws_87',['ws',['http://en.cppreference.com/w/cpp/io/manip/ws.html',0,'std']]],
-  ['wscanf_88',['wscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]],
-  ['wsmatch_89',['wsmatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std::wsmatch'],['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::wsmatch::wsmatch()']]],
-  ['wsregex_5fiterator_90',['wsregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::wsregex_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::wsregex_iterator::wsregex_iterator()']]],
-  ['wsregex_5ftoken_5fiterator_91',['wsregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::wsregex_token_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::wsregex_token_iterator::wsregex_token_iterator()']]],
-  ['wssub_5fmatch_92',['wssub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std::wssub_match'],['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::wssub_match::wssub_match()']]],
-  ['wstreambuf_93',['wstreambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf.html',0,'std::wstreambuf'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/basic_streambuf.html',0,'std::wstreambuf::wstreambuf()']]],
-  ['wstreampos_94',['wstreampos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]],
-  ['wstring_95',['wstring',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std::wstring'],['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::wstring::wstring()']]],
-  ['wstring_5fconvert_96',['wstring_convert',['http://en.cppreference.com/w/cpp/locale/wstring_convert.html',0,'std::wstring_convert'],['http://en.cppreference.com/w/cpp/locale/wstring_convert/wstring_convert.html',0,'std::wstring_convert::wstring_convert()']]],
-  ['wstringbuf_97',['wstringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf.html',0,'std::wstringbuf'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::wstringbuf::wstringbuf()']]],
-  ['wstringstream_98',['wstringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std::wstringstream'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::wstringstream::wstringstream()']]]
+  ['warning_0',['2. Warning',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md12',1,'']]],
+  ['wave_5fsort_1',['wave_sort',['../d9/d21/namespacewave__sort.html',1,'']]],
+  ['wave_5fsort_2ecpp_2',['wave_sort.cpp',['../db/d3f/wave__sort_8cpp.html',1,'']]],
+  ['wavesort_3',['waveSort',['../db/d3f/wave__sort_8cpp.html#a7d4f243b9dc13ace4ef77e30dbc56f12',1,'sorting::wave_sort']]],
+  ['weights_4',['weights',['../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492',1,'machine_learning::adaline']]],
+  ['white_5',['WHITE',['../da/d4b/depth__first__search__with__stack_8cpp.html#afb80b42b42381658a12a57a975ecd0c7',1,'depth_first_search_with_stack.cpp']]],
+  ['wiggle_5fsort_6',['wiggle_sort',['../d0/d52/namespacewiggle__sort.html',1,'']]],
+  ['wiggle_5fsort_2ecpp_7',['wiggle_sort.cpp',['../d1/dcc/wiggle__sort_8cpp.html',1,'']]],
+  ['wigglesort_8',['wiggleSort',['../d1/dcc/wiggle__sort_8cpp.html#a99eeded693ac073717282fae365957a1',1,'sorting::wiggle_sort']]],
+  ['wildcard_5fmatching_9',['wildcard_matching',['../db/d03/namespacewildcard__matching.html',1,'']]],
+  ['wildcard_5fmatching_2ecpp_10',['wildcard_matching.cpp',['../dc/d14/wildcard__matching_8cpp.html',1,'']]],
+  ['windowed_5fmedian_11',['windowed_median',['../dd/d21/namespacewindowed__median.html',1,'']]],
+  ['windowed_5fmedian_2ecpp_12',['windowed_median.cpp',['../d1/ded/windowed__median_8cpp.html',1,'']]],
+  ['windowedmedian_13',['WindowedMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html',1,'probability::windowed_median::WindowedMedian'],['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d',1,'probability::windowed_median::WindowedMedian::WindowedMedian()']]],
+  ['word_5fbreak_14',['word_break',['../d6/d53/namespaceword__break.html',1,'']]],
+  ['word_5fbreak_2ecpp_15',['word_break.cpp',['../d3/d84/word__break_8cpp.html',1,'']]],
+  ['word_5fend_16',['word_end',['../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a3cdb077745d3dc97212d693132371219',1,'data_structures::trie_using_hashmap::Trie::Node']]],
+  ['wordbreak_17',['wordBreak',['../d3/d84/word__break_8cpp.html#afe4dcd6fd5282e535685361cba645d7c',1,'dynamic_programming::word_break']]],
+  ['working_18',['Working',['../d5/d45/sublist__search_8cpp.html#autotoc_md109',1,'']]],
+  ['worst_20case_19',['Worst Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md113',1,'']]],
+  ['worst_20case_20average_20case_20',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]]
 ];
diff --git a/search/all_1d.js b/search/all_1d.js
index 78990c2c9..5d3bf13cc 100644
--- a/search/all_1d.js
+++ b/search/all_1d.js
@@ -2,9 +2,6 @@ var searchData=
 [
   ['x_0',['x',['../d8/dc8/struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7',1,'Point']]],
   ['x_5f_1',['X_',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a16ddc13621eec6ac5f83658b3401a581',1,'machine_learning::k_nearest_neighbors::Knn']]],
-  ['xalloc_2',['xalloc',['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ofstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::fstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ostringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ios::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ostringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_fstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::iostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ios_base::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wistream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::stringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wifstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_istream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::strstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_stringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wostringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::istrstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wiostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ofstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_istringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ifstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::istringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::istream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ostrstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wfstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_iostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wofstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wstringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wistringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ifstream::xalloc()']]],
-  ['xor_3',['XOR',['../d7/d47/namespace_x_o_r.html',1,'']]],
-  ['xor_5fcipher_2ecpp_4',['xor_cipher.cpp',['../d3/d4c/xor__cipher_8cpp.html',1,'']]],
-  ['xsgetn_5',['xsgetn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_filebuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstringbuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::stringbuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wfilebuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstreambuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::strstreambuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_stringbuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_streambuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::filebuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::streambuf::xsgetn()']]],
-  ['xsputn_6',['xsputn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_filebuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstringbuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::stringbuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wfilebuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstreambuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::strstreambuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_stringbuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_streambuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::filebuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::streambuf::xsputn()']]]
+  ['xor_2',['XOR',['../d7/d47/namespace_x_o_r.html',1,'']]],
+  ['xor_5fcipher_2ecpp_3',['xor_cipher.cpp',['../d3/d4c/xor__cipher_8cpp.html',1,'']]]
 ];
diff --git a/search/all_1e.js b/search/all_1e.js
index a5da38258..ec0d75c25 100644
--- a/search/all_1e.js
+++ b/search/all_1e.js
@@ -2,8 +2,5 @@ var searchData=
 [
   ['y_0',['y',['../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7',1,'Point::y'],['../d8/dc8/struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8',1,'Point::y']]],
   ['y_5f_1',['Y_',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a209383503fb6c03afac405a80bace964',1,'machine_learning::k_nearest_neighbors::Knn']]],
-  ['year_2',['year',['../d1/df6/class_easter_year_month_day.html#a28d3cd09391390250932b7fb58fe61dc',1,'EasterYearMonthDay']]],
-  ['yield_3',['yield',['http://en.cppreference.com/w/cpp/thread/yield.html',0,'std::this_thread']]],
-  ['yocto_4',['yocto',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['yotta_5',['yotta',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]]
+  ['year_2',['year',['../d1/df6/class_easter_year_month_day.html#a28d3cd09391390250932b7fb58fe61dc',1,'EasterYearMonthDay']]]
 ];
diff --git a/search/all_1f.js b/search/all_1f.js
index bc4acdc27..3f73ee9c3 100644
--- a/search/all_1f.js
+++ b/search/all_1f.js
@@ -2,7 +2,5 @@ var searchData=
 [
   ['z_5ffunction_0',['Z_function',['../d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773',1,'z_function.cpp']]],
   ['z_5ffunction_2ecpp_1',['z_function.cpp',['../d3/d80/z__function_8cpp.html',1,'']]],
-  ['zero_2',['zero',['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::minutes::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::seconds::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::duration::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::milliseconds::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::hours::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/zero.html',0,'std::chrono::duration_values::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::microseconds::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::nanoseconds::zero()']]],
-  ['zeroes_5finitialization_3',['zeroes_initialization',['../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e',1,'machine_learning']]],
-  ['zetta_4',['zetta',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]]
+  ['zeroes_5finitialization_2',['zeroes_initialization',['../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e',1,'machine_learning']]]
 ];
diff --git a/search/all_20.js b/search/all_20.js
index 98a047a47..de71404ed 100644
--- a/search/all_20.js
+++ b/search/all_20.js
@@ -1,104 +1,13 @@
 var searchData=
 [
-  ['_7eallocator_0',['~allocator',['http://en.cppreference.com/w/cpp/memory/allocator/~allocator.html',0,'std::allocator']]],
-  ['_7eauto_5fptr_1',['~auto_ptr',['http://en.cppreference.com/w/cpp/memory/auto_ptr/~auto_ptr.html',0,'std::auto_ptr']]],
-  ['_7ebasic_5ffilebuf_2',['~basic_filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/~basic_filebuf.html',0,'std::basic_filebuf']]],
-  ['_7ebasic_5fios_3',['~basic_ios',['http://en.cppreference.com/w/cpp/io/basic_ios/~basic_ios.html',0,'std::basic_ios']]],
-  ['_7ebasic_5fiostream_4',['~basic_iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream/~basic_iostream.html',0,'std::basic_iostream']]],
-  ['_7ebasic_5fistream_5',['~basic_istream',['http://en.cppreference.com/w/cpp/io/basic_istream/~basic_istream.html',0,'std::basic_istream']]],
-  ['_7ebasic_5fostream_6',['~basic_ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream/~basic_ostream.html',0,'std::basic_ostream']]],
-  ['_7ebasic_5fregex_7',['~basic_regex',['http://en.cppreference.com/w/cpp/regex/basic_regex/~basic_regex.html',0,'std::basic_regex']]],
-  ['_7ebasic_5fstreambuf_8',['~basic_streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/~basic_streambuf.html',0,'std::basic_streambuf']]],
-  ['_7ecircularlinkedlist_9',['~CircularLinkedList',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a46195fcf11b636064c7172cb74b55dd0',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList']]],
-  ['_7ecmatch_10',['~cmatch',['http://en.cppreference.com/w/cpp/regex/match_results/~match_results.html',0,'std::cmatch']]],
-  ['_7ecodecvt_11',['~codecvt',['http://en.cppreference.com/w/cpp/locale/codecvt/~codecvt.html',0,'std::codecvt']]],
-  ['_7ecodecvt_5fbyname_12',['~codecvt_byname',['http://en.cppreference.com/w/cpp/locale/codecvt_byname.html',0,'std::codecvt_byname']]],
-  ['_7ecollate_13',['~collate',['http://en.cppreference.com/w/cpp/locale/collate/~collate.html',0,'std::collate']]],
-  ['_7ecollate_5fbyname_14',['~collate_byname',['http://en.cppreference.com/w/cpp/locale/collate_byname.html',0,'std::collate_byname']]],
-  ['_7econdition_5fvariable_15',['~condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable/~condition_variable.html',0,'std::condition_variable']]],
-  ['_7econdition_5fvariable_5fany_16',['~condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/~condition_variable_any.html',0,'std::condition_variable_any']]],
-  ['_7ectype_17',['~ctype',['http://en.cppreference.com/w/cpp/locale/ctype/~ctype.html',0,'std::ctype']]],
-  ['_7ectype_5fbyname_18',['~ctype_byname',['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname']]],
-  ['_7edenselayer_19',['~DenseLayer',['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ac9cda9453c4a0caf5bae7f9213b019a0',1,'machine_learning::neural_network::layers::DenseLayer']]],
-  ['_7edeque_20',['~deque',['http://en.cppreference.com/w/cpp/container/deque/~deque.html',0,'std::deque']]],
-  ['_7edynarray_21',['~dynarray',['http://en.cppreference.com/w/cpp/container/dynarray/~dynarray.html',0,'std::dynarray']]],
-  ['_7eeightpuzzle_22',['~EightPuzzle',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a194c2973b51a5467fc17064a4ea4e6f9',1,'machine_learning::aystar_search::EightPuzzle']]],
-  ['_7eenable_5fshared_5ffrom_5fthis_23',['~enable_shared_from_this',['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/~enable_shared_from_this.html',0,'std::enable_shared_from_this']]],
-  ['_7eerror_5fcategory_24',['~error_category',['http://en.cppreference.com/w/cpp/error/error_category/~error_category.html',0,'std::error_category']]],
-  ['_7eexception_25',['~exception',['http://en.cppreference.com/w/cpp/error/exception/~exception.html',0,'std::exception']]],
-  ['_7efilebuf_26',['~filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/~basic_filebuf.html',0,'std::filebuf']]],
-  ['_7eforward_5flist_27',['~forward_list',['http://en.cppreference.com/w/cpp/container/forward_list/~forward_list.html',0,'std::forward_list']]],
-  ['_7efunction_28',['~function',['http://en.cppreference.com/w/cpp/utility/functional/function/~function.html',0,'std::function']]],
-  ['_7efuture_29',['~future',['http://en.cppreference.com/w/cpp/thread/future/~future.html',0,'std::future']]],
-  ['_7einfo_30',['~Info',['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aa816af5a64b37c86be8acda89fdefba2',1,'machine_learning::aystar_search::AyStarSearch::Info']]],
-  ['_7eios_5fbase_31',['~ios_base',['http://en.cppreference.com/w/cpp/io/ios_base/~ios_base.html',0,'std::ios_base']]],
-  ['_7eiostream_32',['~iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream/~basic_iostream.html',0,'std::iostream']]],
-  ['_7eistream_33',['~istream',['http://en.cppreference.com/w/cpp/io/basic_istream/~basic_istream.html',0,'std::istream']]],
-  ['_7eistrstream_34',['~istrstream',['http://en.cppreference.com/w/cpp/io/istrstream/~istrstream.html',0,'std::istrstream']]],
-  ['_7eknn_35',['~Knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#afe732a33112b457b738f403622d226e5',1,'machine_learning::k_nearest_neighbors::Knn']]],
-  ['_7elfucache_36',['~LFUCache',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a8857531ecc8ed2e36868e267148eff36',1,'others::Cache::LFUCache']]],
-  ['_7elist_37',['~list',['http://en.cppreference.com/w/cpp/container/list/~list.html',0,'std::list']]],
-  ['_7elocale_38',['~locale',['http://en.cppreference.com/w/cpp/locale/locale/~locale.html',0,'std::locale']]],
-  ['_7elock_5fguard_39',['~lock_guard',['http://en.cppreference.com/w/cpp/thread/lock_guard/~lock_guard.html',0,'std::lock_guard']]],
-  ['_7elrucache_40',['~LRUCache',['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a6d855ff72ad6fe548eb564b7f87abe06',1,'others::Cache::LRUCache']]],
-  ['_7emap_41',['~map',['http://en.cppreference.com/w/cpp/container/map/~map.html',0,'std::map']]],
-  ['_7ematch_5fresults_42',['~match_results',['http://en.cppreference.com/w/cpp/regex/match_results/~match_results.html',0,'std::match_results']]],
-  ['_7emessages_43',['~messages',['http://en.cppreference.com/w/cpp/locale/messages/~messages.html',0,'std::messages']]],
-  ['_7emessages_5fbyname_44',['~messages_byname',['http://en.cppreference.com/w/cpp/locale/messages_byname.html',0,'std::messages_byname']]],
-  ['_7emoney_5fget_45',['~money_get',['http://en.cppreference.com/w/cpp/locale/money_get/~money_get.html',0,'std::money_get']]],
-  ['_7emoney_5fput_46',['~money_put',['http://en.cppreference.com/w/cpp/locale/money_put/~money_put.html',0,'std::money_put']]],
-  ['_7emoneypunct_47',['~moneypunct',['http://en.cppreference.com/w/cpp/locale/moneypunct/~moneypunct.html',0,'std::moneypunct']]],
-  ['_7emoneypunct_5fbyname_48',['~moneypunct_byname',['http://en.cppreference.com/w/cpp/locale/moneypunct_byname.html',0,'std::moneypunct_byname']]],
-  ['_7emultimap_49',['~multimap',['http://en.cppreference.com/w/cpp/container/multimap/~multimap.html',0,'std::multimap']]],
-  ['_7emultiset_50',['~multiset',['http://en.cppreference.com/w/cpp/container/multiset/~multiset.html',0,'std::multiset']]],
-  ['_7enested_5fexception_51',['~nested_exception',['http://en.cppreference.com/w/cpp/error/nested_exception/~nested_exception.html',0,'std::nested_exception']]],
-  ['_7eneuralnetwork_52',['~NeuralNetwork',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a8973f687738ddd76f93b5562feae4027',1,'machine_learning::neural_network::NeuralNetwork']]],
-  ['_7enum_5fget_53',['~num_get',['http://en.cppreference.com/w/cpp/locale/num_get/~num_get.html',0,'std::num_get']]],
-  ['_7enum_5fput_54',['~num_put',['http://en.cppreference.com/w/cpp/locale/num_put/~num_put.html',0,'std::num_put']]],
-  ['_7enumpunct_55',['~numpunct',['http://en.cppreference.com/w/cpp/locale/numpunct/~numpunct.html',0,'std::numpunct']]],
-  ['_7enumpunct_5fbyname_56',['~numpunct_byname',['http://en.cppreference.com/w/cpp/locale/numpunct_byname.html',0,'std::numpunct_byname']]],
-  ['_7eoptional_57',['~optional',['http://en.cppreference.com/w/cpp/experimental/optional/~optional.html',0,'std::experimental::optional']]],
-  ['_7eostream_58',['~ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream/~basic_ostream.html',0,'std::ostream']]],
-  ['_7eostrstream_59',['~ostrstream',['http://en.cppreference.com/w/cpp/io/ostrstream/~ostrstream.html',0,'std::ostrstream']]],
-  ['_7epackaged_5ftask_60',['~packaged_task',['http://en.cppreference.com/w/cpp/thread/packaged_task/~packaged_task.html',0,'std::packaged_task']]],
-  ['_7epriority_5fqueue_61',['~priority_queue',['http://en.cppreference.com/w/cpp/container/priority_queue/~priority_queue.html',0,'std::priority_queue']]],
-  ['_7epromise_62',['~promise',['http://en.cppreference.com/w/cpp/thread/promise/~promise.html',0,'std::promise']]],
-  ['_7equeue_63',['~queue',['http://en.cppreference.com/w/cpp/container/queue/~queue.html',0,'std::queue']]],
-  ['_7eregex_64',['~regex',['http://en.cppreference.com/w/cpp/regex/basic_regex/~basic_regex.html',0,'std::regex']]],
-  ['_7escoped_5fallocator_5fadaptor_65',['~scoped_allocator_adaptor',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/~scoped_allocator_adaptor.html',0,'std::scoped_allocator_adaptor']]],
-  ['_7esentry_66',['~sentry',['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::fstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_fstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::iostream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::stringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::strstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_stringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wiostream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wfstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_iostream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wstringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry::~sentry()']]],
-  ['_7eset_67',['~set',['http://en.cppreference.com/w/cpp/container/set/~set.html',0,'std::set']]],
-  ['_7eshared_5ffuture_68',['~shared_future',['http://en.cppreference.com/w/cpp/thread/shared_future/~shared_future.html',0,'std::shared_future']]],
-  ['_7eshared_5flock_69',['~shared_lock',['http://en.cppreference.com/w/cpp/thread/shared_lock/~shared_lock.html',0,'std::shared_lock']]],
-  ['_7eshared_5fptr_70',['~shared_ptr',['http://en.cppreference.com/w/cpp/memory/shared_ptr/~shared_ptr.html',0,'std::shared_ptr']]],
-  ['_7esmatch_71',['~smatch',['http://en.cppreference.com/w/cpp/regex/match_results/~match_results.html',0,'std::smatch']]],
-  ['_7estack_72',['~stack',['http://en.cppreference.com/w/cpp/container/stack/~stack.html',0,'std::stack']]],
-  ['_7estreambuf_73',['~streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/~basic_streambuf.html',0,'std::streambuf']]],
-  ['_7estrstream_74',['~strstream',['http://en.cppreference.com/w/cpp/io/strstream/~strstream.html',0,'std::strstream']]],
-  ['_7estrstreambuf_75',['~strstreambuf',['http://en.cppreference.com/w/cpp/io/strstreambuf/~strstreambuf.html',0,'std::strstreambuf']]],
-  ['_7ethread_76',['~thread',['http://en.cppreference.com/w/cpp/thread/thread/~thread.html',0,'std::thread']]],
-  ['_7etime_5fget_77',['~time_get',['http://en.cppreference.com/w/cpp/locale/time_get/~time_get.html',0,'std::time_get']]],
-  ['_7etime_5fget_5fbyname_78',['~time_get_byname',['http://en.cppreference.com/w/cpp/locale/time_get_byname.html',0,'std::time_get_byname']]],
-  ['_7etime_5fput_79',['~time_put',['http://en.cppreference.com/w/cpp/locale/time_put/~time_put.html',0,'std::time_put']]],
-  ['_7etime_5fput_5fbyname_80',['~time_put_byname',['http://en.cppreference.com/w/cpp/locale/time_put_byname.html',0,'std::time_put_byname']]],
-  ['_7euint128_5ft_81',['~uint128_t',['../db/d9a/classuint128__t.html#a4147188abcdcdb12c61bfbe4e4c0a363',1,'uint128_t']]],
-  ['_7euint256_5ft_82',['~uint256_t',['../d1/d83/classuint256__t.html#a3ff17ab14b2371eb3239107d10947067',1,'uint256_t']]],
-  ['_7eunique_5flock_83',['~unique_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/~unique_lock.html',0,'std::unique_lock']]],
-  ['_7eunique_5fptr_84',['~unique_ptr',['http://en.cppreference.com/w/cpp/memory/unique_ptr/~unique_ptr.html',0,'std::unique_ptr']]],
-  ['_7eunordered_5fmap_85',['~unordered_map',['http://en.cppreference.com/w/cpp/container/unordered_map/~unordered_map.html',0,'std::unordered_map']]],
-  ['_7eunordered_5fmultimap_86',['~unordered_multimap',['http://en.cppreference.com/w/cpp/container/unordered_multimap/~unordered_multimap.html',0,'std::unordered_multimap']]],
-  ['_7eunordered_5fmultiset_87',['~unordered_multiset',['http://en.cppreference.com/w/cpp/container/unordered_multiset/~unordered_multiset.html',0,'std::unordered_multiset']]],
-  ['_7eunordered_5fset_88',['~unordered_set',['http://en.cppreference.com/w/cpp/container/unordered_set/~unordered_set.html',0,'std::unordered_set']]],
-  ['_7evector_89',['~vector',['http://en.cppreference.com/w/cpp/container/vector/~vector.html',0,'std::vector']]],
-  ['_7ewbuffer_5fconvert_90',['~wbuffer_convert',['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/~wbuffer_convert.html',0,'std::wbuffer_convert']]],
-  ['_7ewcmatch_91',['~wcmatch',['http://en.cppreference.com/w/cpp/regex/match_results/~match_results.html',0,'std::wcmatch']]],
-  ['_7eweak_5fptr_92',['~weak_ptr',['http://en.cppreference.com/w/cpp/memory/weak_ptr/~weak_ptr.html',0,'std::weak_ptr']]],
-  ['_7ewfilebuf_93',['~wfilebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/~basic_filebuf.html',0,'std::wfilebuf']]],
-  ['_7ewiostream_94',['~wiostream',['http://en.cppreference.com/w/cpp/io/basic_iostream/~basic_iostream.html',0,'std::wiostream']]],
-  ['_7ewistream_95',['~wistream',['http://en.cppreference.com/w/cpp/io/basic_istream/~basic_istream.html',0,'std::wistream']]],
-  ['_7ewostream_96',['~wostream',['http://en.cppreference.com/w/cpp/io/basic_ostream/~basic_ostream.html',0,'std::wostream']]],
-  ['_7ewregex_97',['~wregex',['http://en.cppreference.com/w/cpp/regex/basic_regex/~basic_regex.html',0,'std::wregex']]],
-  ['_7ewsmatch_98',['~wsmatch',['http://en.cppreference.com/w/cpp/regex/match_results/~match_results.html',0,'std::wsmatch']]],
-  ['_7ewstreambuf_99',['~wstreambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/~basic_streambuf.html',0,'std::wstreambuf']]],
-  ['_7ewstring_5fconvert_100',['~wstring_convert',['http://en.cppreference.com/w/cpp/locale/wstring_convert/~wstring_convert.html',0,'std::wstring_convert']]]
+  ['_7ecircularlinkedlist_0',['~CircularLinkedList',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a46195fcf11b636064c7172cb74b55dd0',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList']]],
+  ['_7edenselayer_1',['~DenseLayer',['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ac9cda9453c4a0caf5bae7f9213b019a0',1,'machine_learning::neural_network::layers::DenseLayer']]],
+  ['_7eeightpuzzle_2',['~EightPuzzle',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a194c2973b51a5467fc17064a4ea4e6f9',1,'machine_learning::aystar_search::EightPuzzle']]],
+  ['_7einfo_3',['~Info',['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aa816af5a64b37c86be8acda89fdefba2',1,'machine_learning::aystar_search::AyStarSearch::Info']]],
+  ['_7eknn_4',['~Knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#afe732a33112b457b738f403622d226e5',1,'machine_learning::k_nearest_neighbors::Knn']]],
+  ['_7elfucache_5',['~LFUCache',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a8857531ecc8ed2e36868e267148eff36',1,'others::Cache::LFUCache']]],
+  ['_7elrucache_6',['~LRUCache',['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a6d855ff72ad6fe548eb564b7f87abe06',1,'others::Cache::LRUCache']]],
+  ['_7eneuralnetwork_7',['~NeuralNetwork',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a8973f687738ddd76f93b5562feae4027',1,'machine_learning::neural_network::NeuralNetwork']]],
+  ['_7euint128_5ft_8',['~uint128_t',['../db/d9a/classuint128__t.html#a4147188abcdcdb12c61bfbe4e4c0a363',1,'uint128_t']]],
+  ['_7euint256_5ft_9',['~uint256_t',['../d1/d83/classuint256__t.html#a3ff17ab14b2371eb3239107d10947067',1,'uint256_t']]]
 ];
diff --git a/search/all_5.js b/search/all_5.js
index 3691b6dbd..25f5c53b5 100644
--- a/search/all_5.js
+++ b/search/all_5.js
@@ -5,18 +5,17 @@ var searchData=
   ['_5fcapacity_2',['_capacity',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a3acc10e6bb67d9d9c4187f625723e6c5',1,'others::Cache::LFUCache::_capacity'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af34bb8b8eaa34cc499b4fed30b9d05fc',1,'others::Cache::LRUCache::_capacity']]],
   ['_5fdigits_3',['_digits',['../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57',1,'large_number']]],
   ['_5ferase_4',['_erase',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887',1,'data_structures::treap::Treap']]],
-  ['_5fexit_5',['_Exit',['http://en.cppreference.com/w/cpp/utility/program/_Exit.html',0,'std']]],
-  ['_5fget_5fk_5fth_6',['_get_k_th',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2',1,'data_structures::treap::Treap']]],
-  ['_5fget_5frank_7',['_get_rank',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec',1,'data_structures::treap::Treap']]],
-  ['_5finsert_8',['_insert',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c',1,'data_structures::treap::Treap']]],
-  ['_5fitmedian_9',['_itMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20',1,'probability::windowed_median::WindowedMedian']]],
-  ['_5flez_10',['_lez',['../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2',1,'uint128_t::_lez()'],['../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163',1,'uint256_t::_lez()']]],
-  ['_5fmod_11',['_mod',['../dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2',1,'hash_chain']]],
-  ['_5frandom_12',['_random',['../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485',1,'kohonen_som_topology.cpp']]],
-  ['_5fsortedvalues_13',['_sortedValues',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de',1,'probability::windowed_median::WindowedMedian']]],
-  ['_5ftarget_14',['_target',['../dc/dfe/ternary__search_8cpp.html#a23ad617bfce1e7cf4591059c85c1a027',1,'ternary_search.cpp']]],
-  ['_5ftrz_15',['_trz',['../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e',1,'uint128_t::_trz()'],['../d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250',1,'uint256_t::_trz()']]],
-  ['_5fuse_5fmath_5fdefines_16',['_USE_MATH_DEFINES',['../da/d77/spirograph_8cpp.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES:&#160;spirograph.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES:&#160;brent_method_extrema.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES:&#160;ground_to_ground_projectile_motion.cpp']]],
-  ['_5fwindow_17',['_window',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2',1,'probability::windowed_median::WindowedMedian']]],
-  ['_5fwindowsize_18',['_windowSize',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750',1,'probability::windowed_median::WindowedMedian']]]
+  ['_5fget_5fk_5fth_5',['_get_k_th',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2',1,'data_structures::treap::Treap']]],
+  ['_5fget_5frank_6',['_get_rank',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec',1,'data_structures::treap::Treap']]],
+  ['_5finsert_7',['_insert',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c',1,'data_structures::treap::Treap']]],
+  ['_5fitmedian_8',['_itMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20',1,'probability::windowed_median::WindowedMedian']]],
+  ['_5flez_9',['_lez',['../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2',1,'uint128_t::_lez()'],['../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163',1,'uint256_t::_lez()']]],
+  ['_5fmod_10',['_mod',['../dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2',1,'hash_chain']]],
+  ['_5frandom_11',['_random',['../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485',1,'kohonen_som_topology.cpp']]],
+  ['_5fsortedvalues_12',['_sortedValues',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de',1,'probability::windowed_median::WindowedMedian']]],
+  ['_5ftarget_13',['_target',['../dc/dfe/ternary__search_8cpp.html#a23ad617bfce1e7cf4591059c85c1a027',1,'ternary_search.cpp']]],
+  ['_5ftrz_14',['_trz',['../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e',1,'uint128_t::_trz()'],['../d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250',1,'uint256_t::_trz()']]],
+  ['_5fuse_5fmath_5fdefines_15',['_USE_MATH_DEFINES',['../da/d77/spirograph_8cpp.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES:&#160;spirograph.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES:&#160;brent_method_extrema.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a525335710b53cb064ca56b936120431e',1,'_USE_MATH_DEFINES:&#160;ground_to_ground_projectile_motion.cpp']]],
+  ['_5fwindow_16',['_window',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2',1,'probability::windowed_median::WindowedMedian']]],
+  ['_5fwindowsize_17',['_windowSize',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750',1,'probability::windowed_median::WindowedMedian']]]
 ];
diff --git a/search/all_6.js b/search/all_6.js
index 6b7e2bc0d..16441fcb5 100644
--- a/search/all_6.js
+++ b/search/all_6.js
@@ -1,170 +1,81 @@
 var searchData=
 [
   ['a_0',['A',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ab78620742305a35ff2f8d61179f47d3e',1,'data_structures::sparse_table::Sparse_table']]],
-  ['a_1',['a',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/params.html',0,'std::extreme_value_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/params.html',0,'std::uniform_real_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/params.html',0,'std::weibull_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/params.html',0,'std::uniform_int_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/params.html',0,'std::cauchy_distribution::a()']]],
-  ['a_20new_20directory_2',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]],
-  ['a_20program_3',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]],
-  ['a_20right_20node_20subtree_4',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]],
-  ['a_20tree_5',['a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]],
-  ['a1z26_6',['a1z26',['../d8/d2a/namespacea1z26.html',1,'']]],
-  ['a1z26_5fcipher_2ecpp_7',['a1z26_cipher.cpp',['../de/db6/a1z26__cipher_8cpp.html',1,'']]],
-  ['a_5fstar_5fsearch_8',['a_star_search',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a48284e156fdd48fd0c41008c7e48f201',1,'machine_learning::aystar_search::AyStarSearch']]],
-  ['abbreviation_9',['abbreviation',['../d0/df8/namespaceabbreviation.html',1,'abbreviation'],['../d7/d73/abbreviation_8cpp.html#af53b2f647bee9c5b75ef8dd9ef685dc8',1,'dynamic_programming::abbreviation::abbreviation()']]],
-  ['abbreviation_2ecpp_10',['abbreviation.cpp',['../d7/d73/abbreviation_8cpp.html',1,'']]],
-  ['abbreviation_5frecursion_11',['abbreviation_recursion',['../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa',1,'dynamic_programming::abbreviation']]],
-  ['abort_12',['abort',['http://en.cppreference.com/w/cpp/utility/program/abort.html',0,'std']]],
-  ['abs_13',['abs',['../da/d5a/class_complex.html#ae5b51b749ea4964104b9527af9d8f556',1,'Complex']]],
-  ['abs_28float_29_14',['abs(float)',['http://en.cppreference.com/w/cpp/numeric/math/fabs.html',0,'std']]],
-  ['abs_28int_29_15',['abs(int)',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]],
-  ['absoluteprecision_16',['absolutePrecision',['../dc/dfe/ternary__search_8cpp.html#ae01eda5098801bb6b5b778828fb4fddc',1,'ternary_search.cpp']]],
-  ['accumulate_17',['accumulate',['http://en.cppreference.com/w/cpp/algorithm/accumulate.html',0,'std']]],
-  ['accuracy_18',['ACCURACY',['../da/df2/durand__kerner__roots_8cpp.html#af270a96662132d0385cb6b4637c5a689',1,'durand_kerner_roots.cpp']]],
-  ['accuracy_19',['accuracy',['../d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3',1,'machine_learning::adaline']]],
-  ['acos_20',['acos',['http://en.cppreference.com/w/cpp/numeric/math/acos.html',0,'std']]],
-  ['acosh_21',['acosh',['http://en.cppreference.com/w/cpp/numeric/math/acosh.html',0,'std']]],
-  ['actions_22',['GitHub Actions',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md40',1,'']]],
-  ['activation_23',['activation',['../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325',1,'machine_learning::adaline']]],
-  ['activations_24',['activations',['../d5/d39/namespaceactivations.html',1,'']]],
-  ['adaline_25',['adaline',['../d6/d30/classmachine__learning_1_1adaline.html',1,'machine_learning::adaline'],['../d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c',1,'machine_learning::adaline::adaline()']]],
-  ['adaline_5flearning_2ecpp_26',['adaline_learning.cpp',['../d5/db0/adaline__learning_8cpp.html',1,'']]],
-  ['add_27',['add',['../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c',1,'data_structures::Bitset::add()'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840',1,'data_structures::BloomFilter::add()'],['../dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff',1,'hash_chain::add()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::add()'],['../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3',1,'add():&#160;uint128_t.hpp'],['../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a',1,'double_hashing::add()'],['../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1',1,'linear_probing::add()'],['../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9',1,'quadratic_probing::add()'],['../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35',1,'add():&#160;string_fibonacci.cpp']]],
-  ['add_5fconst_28',['add_const',['http://en.cppreference.com/w/cpp/types/add_cv.html',0,'std']]],
-  ['add_5fcv_29',['add_cv',['http://en.cppreference.com/w/cpp/types/add_cv.html',0,'std']]],
-  ['add_5fdigit_30',['add_digit',['../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615',1,'large_number']]],
-  ['add_5fedge_31',['add_edge',['../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19',1,'graph::Graph::add_edge()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79',1,'greedy_algorithms::dijkstra::Graph::add_edge()'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d',1,'range_queries::heavy_light_decomposition::Tree::add_edge()']]],
-  ['add_5flvalue_5freference_32',['add_lvalue_reference',['http://en.cppreference.com/w/cpp/types/add_reference.html',0,'std']]],
-  ['add_5fpointer_33',['add_pointer',['http://en.cppreference.com/w/cpp/types/add_pointer.html',0,'std']]],
-  ['add_5frvalue_5freference_34',['add_rvalue_reference',['http://en.cppreference.com/w/cpp/types/add_reference.html',0,'std']]],
-  ['add_5fstrings_35',['add_strings',['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ad76f5cac3ef8dc034f6abb99b64c2b20',1,'divide_and_conquer::karatsuba_algorithm']]],
-  ['add_5fvolatile_36',['add_volatile',['http://en.cppreference.com/w/cpp/types/add_cv.html',0,'std']]],
-  ['addbinary_37',['addBinary',['../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527',1,'greedy_algorithms::BinaryAddition']]],
-  ['addedge_38',['addEdge',['../da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5',1,'Graph::addEdge(Edge const &amp;edge)'],['../da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910',1,'Graph::addEdge(unsigned int source, unsigned int destination)'],['../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a',1,'graph::HKGraph::addEdge()'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b',1,'graph::is_graph_bipartite::Graph::addEdge()'],['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345',1,'graph::topological_sort::Graph::addEdge()'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a69172365aebde9be1997157f6f80e0cf',1,'graph::bidirectional_dijkstra::addEdge()'],['../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2',1,'graph::addEdge(std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, int v)'],['../df/dce/namespacegraph.html#ad4016cfc80485a43748895a2c26c7d08',1,'graph::addEdge(std::vector&lt; std::vector&lt; size_t &gt; &gt; *adj, size_t u, size_t v)'],['../da/d4b/depth__first__search__with__stack_8cpp.html#aadebe9c855821d6515ca5b171222ef7b',1,'graph::depth_first_search::addEdge()'],['../df/dce/namespacegraph.html#a0e30e0dca68cb6e4f671440819b35b6a',1,'graph::addEdge()']]],
-  ['addinfo_39',['addInfo',['../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560',1,'double_hashing::addInfo()'],['../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908',1,'linear_probing::addInfo()'],['../d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768',1,'quadratic_probing::addInfo()']]],
-  ['addition_40',['addition',['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf',1,'ciphers::elliptic_curve_key_exchange']]],
-  ['addition_5frule_2ecpp_41',['addition_rule.cpp',['../d6/d4a/addition__rule_8cpp.html',1,'']]],
-  ['addition_5frule_5fdependent_42',['addition_rule_dependent',['../d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0',1,'addition_rule.cpp']]],
-  ['addition_5frule_5findependent_43',['addition_rule_independent',['../d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d',1,'addition_rule.cpp']]],
-  ['addprocess_44',['addProcess',['../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69',1,'FCFS']]],
-  ['address_45',['address',['http://en.cppreference.com/w/cpp/memory/allocator/address.html',0,'std::allocator']]],
-  ['address_20of_20parent_20nodes_46',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
-  ['addressing_47',['Open Addressing',['../d4/d39/group__open__addressing.html',1,'']]],
-  ['addressof_48',['addressof',['http://en.cppreference.com/w/cpp/memory/addressof.html',0,'std']]],
-  ['addvertices_49',['addVertices',['../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413',1,'Graph']]],
-  ['adj_50',['adj',['../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f',1,'graph::HKGraph::adj'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ab0efcfa04fff8616aff0062522d1483f',1,'graph::is_graph_bipartite::Graph::adj']]],
-  ['adjacency_5flist_51',['adjacency_list',['../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0',1,'graph::Graph']]],
-  ['adjacent_5fdifference_52',['adjacent_difference',['http://en.cppreference.com/w/cpp/algorithm/adjacent_difference.html',0,'std']]],
-  ['adjacent_5ffind_53',['adjacent_find',['http://en.cppreference.com/w/cpp/algorithm/adjacent_find.html',0,'std']]],
-  ['adopt_5flock_5ft_54',['adopt_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]],
-  ['advance_55',['advance',['http://en.cppreference.com/w/cpp/iterator/advance.html',0,'std']]],
-  ['algorithm_56',['Algorithm',['../dc/dfb/atbash__cipher_8cpp.html#autotoc_md0',1,'Algorithm'],['../d6/d2c/caesar__cipher_8cpp.html#autotoc_md1',1,'Algorithm'],['../dd/d12/vigenere__cipher_8cpp.html#autotoc_md2',1,'Algorithm'],['../d3/d4c/xor__cipher_8cpp.html#autotoc_md3',1,'Algorithm'],['../da/dc3/linked__list_8cpp.html#autotoc_md41',1,'Algorithm'],['../d7/d00/list__array_8cpp.html#autotoc_md42',1,'Algorithm'],['../d8/df0/queue__using__array_8cpp.html#autotoc_md43',1,'Algorithm'],['../d6/d05/reverse__a__linked__list_8cpp.html#autotoc_md44',1,'Algorithm'],['../db/d16/0__1__knapsack_8cpp.html#autotoc_md69',1,'Algorithm'],['../d7/d73/abbreviation_8cpp.html#autotoc_md70',1,'Algorithm'],['../d6/d10/cut__rod_8cpp.html#autotoc_md71',1,'Algorithm'],['../d4/da0/kadane_8cpp.html#autotoc_md72',1,'Algorithm'],['../da/d52/minimum__edit__distance_8cpp.html#autotoc_md73',1,'Algorithm'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#autotoc_md74',1,'Algorithm'],['../d4/d8d/jarvis__algorithm_8cpp.html#autotoc_md75',1,'Algorithm'],['../d8/d99/connected__components__with__dsu_8cpp.html#autotoc_md76',1,'Algorithm'],['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md82',1,'Algorithm'],['../d5/d96/md5_8cpp.html#autotoc_md83',1,'Algorithm'],['../d8/d7a/sha1_8cpp.html#autotoc_md84',1,'Algorithm'],['../dd/d47/namespacemath.html#autotoc_md85',1,'Algorithm'],['../d4/d38/power__of__two_8cpp.html#autotoc_md86',1,'Algorithm'],['../d5/d33/gram__schmidt_8cpp.html#autotoc_md88',1,'Algorithm'],['../d1/ded/windowed__median_8cpp.html#autotoc_md102',1,'Algorithm'],['../d5/d45/sublist__search_8cpp.html#autotoc_md108',1,'Algorithm'],['../d5/ddb/bogo__sort_8cpp.html#autotoc_md110',1,'Algorithm'],['../d2/d26/count__inversions_8cpp.html#autotoc_md115',1,'Algorithm'],['../d3/df9/recursive__bubble__sort_8cpp.html#autotoc_md116',1,'Algorithm'],['../d5/d4c/group__sorting.html',1,'Sorting Algorithm']]],
-  ['algorithm_20analysis_20best_20case_20worst_20case_20average_20case_57',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]],
-  ['algorithm_20explanation_58',['Algorithm explanation',['../d3/db3/lru__cache_8cpp.html#autotoc_md97',1,'']]],
-  ['algorithms_59',['Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48',1,'Cpu Scheduling Algorithms'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56',1,'Greedy Algorithms'],['../d9/d66/group__machine__learning.html',1,'Machine Learning Algorithms']]],
-  ['algorithms_20c_60',['The Algorithms - C++',['../index.html',1,'']]],
-  ['align_61',['align',['http://en.cppreference.com/w/cpp/memory/align.html',0,'std']]],
-  ['aligned_5fstorage_62',['aligned_storage',['http://en.cppreference.com/w/cpp/types/aligned_storage.html',0,'std']]],
-  ['aligned_5funion_63',['aligned_union',['http://en.cppreference.com/w/cpp/types/aligned_union.html',0,'std']]],
-  ['alignment_5fof_64',['alignment_of',['http://en.cppreference.com/w/cpp/types/alignment_of.html',0,'std']]],
-  ['aliquot_5fsum_65',['aliquot_sum',['../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf',1,'math']]],
-  ['aliquot_5fsum_2ecpp_66',['aliquot_sum.cpp',['../de/d99/aliquot__sum_8cpp.html',1,'']]],
-  ['all_67',['all',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]],
-  ['all_5fof_68',['all_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]],
-  ['allocate_69',['allocate',['http://en.cppreference.com/w/cpp/memory/allocator_traits/allocate.html',0,'std::allocator_traits::allocate()'],['http://en.cppreference.com/w/cpp/memory/allocator/allocate.html',0,'std::allocator::allocate()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/allocate.html',0,'std::scoped_allocator_adaptor::allocate()']]],
-  ['allocate_5fshared_70',['allocate_shared',['http://en.cppreference.com/w/cpp/memory/shared_ptr/allocate_shared.html',0,'std']]],
-  ['allocator_71',['allocator',['http://en.cppreference.com/w/cpp/memory/allocator.html',0,'std::allocator&lt; T &gt;'],['http://en.cppreference.com/w/cpp/memory/allocator/allocator.html',0,'std::allocator::allocator()']]],
-  ['allocator_5farg_5ft_72',['allocator_arg_t',['http://en.cppreference.com/w/cpp/memory/allocator_arg_t.html',0,'std']]],
-  ['allocator_5ftraits_73',['allocator_traits',['http://en.cppreference.com/w/cpp/memory/allocator_traits.html',0,'std']]],
-  ['alpha_74',['alpha',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/params.html',0,'std::gamma_distribution']]],
-  ['always_5fnoconv_75',['always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::always_noconv()']]],
-  ['analysis_20best_20case_20worst_20case_20average_20case_76',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]],
-  ['analyzer_77',['Static Code Analyzer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md38',1,'']]],
-  ['and_20conquer_78',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]],
-  ['and_20maintainers_79',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]],
-  ['and_20not_20matching_20edges_80',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]],
-  ['and_5ftest_81',['and_test',['../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9',1,'boyer_moore.cpp']]],
-  ['ans_82',['ans',['../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa',1,'matrix_exponentiation.cpp']]],
-  ['any_83',['any',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]],
-  ['any_5fof_84',['any_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]],
-  ['aplhabet_5fsize_85',['APLHABET_SIZE',['../d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd',1,'boyer_moore.cpp']]],
-  ['append_86',['append',['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::basic_string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::wstring::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::u16string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::u32string::append()']]],
-  ['apply_5ffunction_87',['apply_function',['../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb',1,'machine_learning']]],
-  ['approximate_5fpi_88',['approximate_pi',['../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188',1,'math']]],
-  ['approximate_5fpi_2ecpp_89',['approximate_pi.cpp',['../d0/d51/approximate__pi_8cpp.html',1,'']]],
-  ['are_5falmost_5fequal_90',['are_almost_equal',['../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703',1,'others']]],
-  ['are_5famicable_91',['are_amicable',['../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec',1,'math']]],
-  ['area_2ecpp_92',['area.cpp',['../dc/d82/area_8cpp.html',1,'']]],
-  ['arg_93',['arg',['../da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41',1,'Complex']]],
-  ['argmax_94',['argmax',['../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec',1,'machine_learning']]],
-  ['armstrong_5fnumber_5ftemplated_2ecpp_95',['armstrong_number_templated.cpp',['../d1/da7/armstrong__number__templated_8cpp.html',1,'']]],
-  ['arr_96',['arr',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d',1,'data_structures::queue_using_array::Queue_Array::arr'],['../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b',1,'data_structures::trie::arr']]],
-  ['array_97',['array',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20data_5fstructures_3a_3atree_5f234_3a_3anode_20_2a_2c_204_20_3e_98',['array&lt; data_structures::tree_234::Node *, 4 &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20float_2c_2020_20_3e_99',['array&lt; float, 20 &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20int_2c_20maxnode_20_3e_100',['array&lt; int, maxNode &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20int16_5ft_2c_20max_5fsize_20_3e_101',['array&lt; int16_t, max_size &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20int64_5ft_2c_203_20_3e_102',['array&lt; int64_t, 3 &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20int64_5ft_2c_20n_20_3e_103',['array&lt; int64_t, N &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20std_3a_3aarray_3c_20int_2c_202_20_3e_2c_20maxnode_20_3e_104',['array&lt; std::array&lt; int, 2 &gt;, maxNode &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20std_3a_3aarray_3c_20int64_5ft_2c_20n_20_3e_2c_20m_20_3e_105',['array&lt; std::array&lt; int64_t, N &gt;, M &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20std_3a_3aarray_3c_20uint32_5ft_2c_203_20_3e_2c_203_20_3e_106',['array&lt; std::array&lt; uint32_t, 3 &gt;, 3 &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20uint32_5ft_2c_208_20_3e_107',['array&lt; uint32_t, 8 &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20uint64_5ft_2c_20n_20_3e_108',['array&lt; uint64_t, N &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_5fleft_5frotation_2ecpp_109',['array_left_rotation.cpp',['../d9/d14/array__left__rotation_8cpp.html',1,'']]],
-  ['array_5fright_5frotation_2ecpp_110',['array_right_rotation.cpp',['../d6/d57/array__right__rotation_8cpp.html',1,'']]],
-  ['asctime_111',['asctime',['http://en.cppreference.com/w/cpp/chrono/c/asctime.html',0,'std']]],
-  ['asin_112',['asin',['http://en.cppreference.com/w/cpp/numeric/math/asin.html',0,'std']]],
-  ['asinh_113',['asinh',['http://en.cppreference.com/w/cpp/numeric/math/asinh.html',0,'std']]],
-  ['ask_5fdata_114',['ask_data',['../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3',1,'games::memory_game']]],
-  ['assertarray_115',['assertArray',['../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a',1,'quadratic_equations_complex_numbers.cpp']]],
-  ['assign_116',['assign',['http://en.cppreference.com/w/cpp/container/vector/assign.html',0,'std::vector::assign()'],['http://en.cppreference.com/w/cpp/string/char_traits/assign.html',0,'std::char_traits::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::string::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::regex::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::basic_regex::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::wregex::assign()'],['http://en.cppreference.com/w/cpp/container/forward_list/assign.html',0,'std::forward_list::assign()'],['http://en.cppreference.com/w/cpp/error/error_code/assign.html',0,'std::error_code::assign()'],['http://en.cppreference.com/w/cpp/container/deque/assign.html',0,'std::deque::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::basic_string::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::wstring::assign()'],['http://en.cppreference.com/w/cpp/utility/functional/function/assign.html',0,'std::function::assign()'],['http://en.cppreference.com/w/cpp/error/error_condition/assign.html',0,'std::error_condition::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::u16string::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::u32string::assign()'],['http://en.cppreference.com/w/cpp/container/list/assign.html',0,'std::list::assign()']]],
-  ['assign_5fresults_117',['assign_results',['../d8/d41/namespacegames_1_1memory__game.html#a3ceeea62d8fa6c563e2c66359fd73413',1,'games::memory_game']]],
-  ['async_118',['async',['http://en.cppreference.com/w/cpp/thread/async.html',0,'std']]],
-  ['at_119',['at',['http://en.cppreference.com/w/cpp/container/dynarray/at.html',0,'std::dynarray::at()'],['http://en.cppreference.com/w/cpp/container/vector/at.html',0,'std::vector::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::string::at()'],['http://en.cppreference.com/w/cpp/container/unordered_map/at.html',0,'std::unordered_map::at()'],['http://en.cppreference.com/w/cpp/container/deque/at.html',0,'std::deque::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::basic_string::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::wstring::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::u16string::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::u32string::at()'],['http://en.cppreference.com/w/cpp/container/map/at.html',0,'std::map::at()'],['http://en.cppreference.com/w/cpp/container/array/at.html',0,'std::array::at()']]],
-  ['at_5fquick_5fexit_120',['at_quick_exit',['http://en.cppreference.com/w/cpp/utility/program/at_quick_exit.html',0,'std']]],
-  ['atan_121',['atan',['http://en.cppreference.com/w/cpp/numeric/math/atan.html',0,'std']]],
-  ['atan2_122',['atan2',['http://en.cppreference.com/w/cpp/numeric/math/atan2.html',0,'std']]],
-  ['atanh_123',['atanh',['http://en.cppreference.com/w/cpp/numeric/math/atanh.html',0,'std']]],
-  ['atbash_124',['atbash',['../de/db3/namespaceatbash.html',1,'']]],
-  ['atbash_5fcipher_125',['atbash_cipher',['../dc/dfb/atbash__cipher_8cpp.html#a8f7dd4dcd3df7c512c20482afc2dbb9d',1,'ciphers::atbash']]],
-  ['atbash_5fcipher_2ecpp_126',['atbash_cipher.cpp',['../dc/dfb/atbash__cipher_8cpp.html',1,'']]],
-  ['atexit_127',['atexit',['http://en.cppreference.com/w/cpp/utility/program/atexit.html',0,'std']]],
-  ['atof_128',['atof',['http://en.cppreference.com/w/cpp/string/byte/atof.html',0,'std']]],
-  ['atoi_129',['atoi',['http://en.cppreference.com/w/cpp/string/byte/atoi.html',0,'std']]],
-  ['atol_130',['atol',['http://en.cppreference.com/w/cpp/string/byte/atoi.html',0,'std']]],
-  ['atoll_131',['atoll',['http://en.cppreference.com/w/cpp/string/byte/atoi.html',0,'std']]],
-  ['atomic_132',['atomic',['http://en.cppreference.com/w/cpp/atomic/atomic.html',0,'std::atomic&lt; T &gt;'],['http://en.cppreference.com/w/cpp/atomic/atomic/atomic.html',0,'std::atomic::atomic()']]],
-  ['atomic_5fcompare_5fexchange_5fstrong_133',['atomic_compare_exchange_strong',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]],
-  ['atomic_5fcompare_5fexchange_5fstrong_5fexplicit_134',['atomic_compare_exchange_strong_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]],
-  ['atomic_5fcompare_5fexchange_5fweak_135',['atomic_compare_exchange_weak',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]],
-  ['atomic_5fcompare_5fexchange_5fweak_5fexplicit_136',['atomic_compare_exchange_weak_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]],
-  ['atomic_5fexchange_137',['atomic_exchange',['http://en.cppreference.com/w/cpp/atomic/atomic_exchange.html',0,'std']]],
-  ['atomic_5fexchange_5fexplicit_138',['atomic_exchange_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_exchange.html',0,'std']]],
-  ['atomic_5ffetch_5fadd_139',['atomic_fetch_add',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_add.html',0,'std']]],
-  ['atomic_5ffetch_5fadd_5fexplicit_140',['atomic_fetch_add_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_add.html',0,'std']]],
-  ['atomic_5ffetch_5fand_141',['atomic_fetch_and',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]],
-  ['atomic_5ffetch_5fand_5fexplicit_142',['atomic_fetch_and_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]],
-  ['atomic_5ffetch_5for_143',['atomic_fetch_or',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_or.html',0,'std']]],
-  ['atomic_5ffetch_5for_5fexplicit_144',['atomic_fetch_or_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_or.html',0,'std']]],
-  ['atomic_5ffetch_5fsub_145',['atomic_fetch_sub',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]],
-  ['atomic_5ffetch_5fsub_5fexplicit_146',['atomic_fetch_sub_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]],
-  ['atomic_5ffetch_5fxor_147',['atomic_fetch_xor',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_xor.html',0,'std']]],
-  ['atomic_5ffetch_5fxor_5fexplicit_148',['atomic_fetch_xor_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_xor.html',0,'std']]],
-  ['atomic_5fflag_149',['atomic_flag',['http://en.cppreference.com/w/cpp/atomic/atomic_flag.html',0,'std::atomic_flag'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/atomic_flag.html',0,'std::atomic_flag::atomic_flag()']]],
-  ['atomic_5finit_150',['atomic_init',['http://en.cppreference.com/w/cpp/atomic/atomic_init.html',0,'std']]],
-  ['atomic_5fis_5flock_5ffree_151',['atomic_is_lock_free',['http://en.cppreference.com/w/cpp/atomic/atomic_is_lock_free.html',0,'std']]],
-  ['atomic_5fload_152',['atomic_load',['http://en.cppreference.com/w/cpp/atomic/atomic_load.html',0,'std']]],
-  ['atomic_5fload_5fexplicit_153',['atomic_load_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_load.html',0,'std']]],
-  ['atomic_5fsignal_5ffence_154',['atomic_signal_fence',['http://en.cppreference.com/w/cpp/atomic/atomic_signal_fence.html',0,'std']]],
-  ['atomic_5fstore_155',['atomic_store',['http://en.cppreference.com/w/cpp/atomic/atomic_store.html',0,'std']]],
-  ['atomic_5fstore_5fexplicit_156',['atomic_store_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_store.html',0,'std']]],
-  ['atomic_5fthread_5ffence_157',['atomic_thread_fence',['http://en.cppreference.com/w/cpp/atomic/atomic_thread_fence.html',0,'std']]],
-  ['attribution_158',['Attribution',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md15',1,'']]],
-  ['augmenting_20paths_159',['Augmenting paths',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md80',1,'']]],
-  ['auto_5fptr_160',['auto_ptr',['http://en.cppreference.com/w/cpp/memory/auto_ptr.html',0,'std::auto_ptr&lt; T &gt;'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/auto_ptr.html',0,'std::auto_ptr::auto_ptr()']]],
-  ['auxiliary_5fq_161',['auxiliary_q',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323',1,'data_structures::stack_using_queue::Stack']]],
-  ['availarray_162',['AvailArray',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c',1,'linkedlist_implentation_usingarray.cpp']]],
-  ['average_20case_163',['Average Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md114',1,'Average Case'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)']]],
-  ['avltree_2ecpp_164',['avltree.cpp',['../d8/dee/avltree_8cpp.html',1,'']]],
-  ['aystar_5fsearch_165',['aystar_search',['../db/ddc/namespaceaystar__search.html',1,'']]],
-  ['aystarsearch_166',['AyStarSearch',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html',1,'machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;'],['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e',1,'machine_learning::aystar_search::AyStarSearch::AyStarSearch()']]]
+  ['a_20new_20directory_1',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]],
+  ['a_20program_2',['Typical structure of a program',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md31',1,'']]],
+  ['a_20right_20node_20subtree_3',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]],
+  ['a_20tree_4',['a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree'],['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]],
+  ['a1z26_5',['a1z26',['../d8/d2a/namespacea1z26.html',1,'']]],
+  ['a1z26_5fcipher_2ecpp_6',['a1z26_cipher.cpp',['../de/db6/a1z26__cipher_8cpp.html',1,'']]],
+  ['a_5fstar_5fsearch_7',['a_star_search',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a48284e156fdd48fd0c41008c7e48f201',1,'machine_learning::aystar_search::AyStarSearch']]],
+  ['abbreviation_8',['abbreviation',['../d0/df8/namespaceabbreviation.html',1,'abbreviation'],['../d7/d73/abbreviation_8cpp.html#af53b2f647bee9c5b75ef8dd9ef685dc8',1,'dynamic_programming::abbreviation::abbreviation()']]],
+  ['abbreviation_2ecpp_9',['abbreviation.cpp',['../d7/d73/abbreviation_8cpp.html',1,'']]],
+  ['abbreviation_5frecursion_10',['abbreviation_recursion',['../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa',1,'dynamic_programming::abbreviation']]],
+  ['abs_11',['abs',['../da/d5a/class_complex.html#ae5b51b749ea4964104b9527af9d8f556',1,'Complex']]],
+  ['absoluteprecision_12',['absolutePrecision',['../dc/dfe/ternary__search_8cpp.html#ae01eda5098801bb6b5b778828fb4fddc',1,'ternary_search.cpp']]],
+  ['accuracy_13',['ACCURACY',['../da/df2/durand__kerner__roots_8cpp.html#af270a96662132d0385cb6b4637c5a689',1,'durand_kerner_roots.cpp']]],
+  ['accuracy_14',['accuracy',['../d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3',1,'machine_learning::adaline']]],
+  ['actions_15',['GitHub Actions',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md40',1,'']]],
+  ['activation_16',['activation',['../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325',1,'machine_learning::adaline']]],
+  ['activations_17',['activations',['../d5/d39/namespaceactivations.html',1,'']]],
+  ['adaline_18',['adaline',['../d6/d30/classmachine__learning_1_1adaline.html',1,'machine_learning::adaline'],['../d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c',1,'machine_learning::adaline::adaline()']]],
+  ['adaline_5flearning_2ecpp_19',['adaline_learning.cpp',['../d5/db0/adaline__learning_8cpp.html',1,'']]],
+  ['add_20',['add',['../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c',1,'data_structures::Bitset::add()'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840',1,'data_structures::BloomFilter::add()'],['../dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff',1,'hash_chain::add()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::add()'],['../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3',1,'add():&#160;uint128_t.hpp'],['../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a',1,'double_hashing::add()'],['../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1',1,'linear_probing::add()'],['../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9',1,'quadratic_probing::add()'],['../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35',1,'add():&#160;string_fibonacci.cpp']]],
+  ['add_5fdigit_21',['add_digit',['../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615',1,'large_number']]],
+  ['add_5fedge_22',['add_edge',['../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19',1,'graph::Graph::add_edge()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79',1,'greedy_algorithms::dijkstra::Graph::add_edge()'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d',1,'range_queries::heavy_light_decomposition::Tree::add_edge()']]],
+  ['add_5fstrings_23',['add_strings',['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ad76f5cac3ef8dc034f6abb99b64c2b20',1,'divide_and_conquer::karatsuba_algorithm']]],
+  ['addbinary_24',['addBinary',['../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527',1,'greedy_algorithms::BinaryAddition']]],
+  ['addedge_25',['addEdge',['../da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5',1,'Graph::addEdge(Edge const &amp;edge)'],['../da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910',1,'Graph::addEdge(unsigned int source, unsigned int destination)'],['../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a',1,'graph::HKGraph::addEdge()'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b',1,'graph::is_graph_bipartite::Graph::addEdge()'],['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345',1,'graph::topological_sort::Graph::addEdge()'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a69172365aebde9be1997157f6f80e0cf',1,'graph::bidirectional_dijkstra::addEdge()'],['../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2',1,'graph::addEdge(std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, int v)'],['../df/dce/namespacegraph.html#ad4016cfc80485a43748895a2c26c7d08',1,'graph::addEdge(std::vector&lt; std::vector&lt; size_t &gt; &gt; *adj, size_t u, size_t v)'],['../da/d4b/depth__first__search__with__stack_8cpp.html#aadebe9c855821d6515ca5b171222ef7b',1,'graph::depth_first_search::addEdge()'],['../df/dce/namespacegraph.html#a0e30e0dca68cb6e4f671440819b35b6a',1,'graph::addEdge()']]],
+  ['addinfo_26',['addInfo',['../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560',1,'double_hashing::addInfo()'],['../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908',1,'linear_probing::addInfo()'],['../d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768',1,'quadratic_probing::addInfo()']]],
+  ['addition_27',['addition',['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf',1,'ciphers::elliptic_curve_key_exchange']]],
+  ['addition_5frule_2ecpp_28',['addition_rule.cpp',['../d6/d4a/addition__rule_8cpp.html',1,'']]],
+  ['addition_5frule_5fdependent_29',['addition_rule_dependent',['../d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0',1,'addition_rule.cpp']]],
+  ['addition_5frule_5findependent_30',['addition_rule_independent',['../d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d',1,'addition_rule.cpp']]],
+  ['addprocess_31',['addProcess',['../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69',1,'FCFS']]],
+  ['address_20of_20parent_20nodes_32',['Method 1: Use parent pointer (store the address of parent nodes)',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md91',1,'']]],
+  ['addressing_33',['Open Addressing',['../d4/d39/group__open__addressing.html',1,'']]],
+  ['addvertices_34',['addVertices',['../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413',1,'Graph']]],
+  ['adj_35',['adj',['../d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f',1,'graph::HKGraph::adj'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ab0efcfa04fff8616aff0062522d1483f',1,'graph::is_graph_bipartite::Graph::adj']]],
+  ['adjacency_5flist_36',['adjacency_list',['../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0',1,'graph::Graph']]],
+  ['algorithm_37',['Algorithm',['../dc/dfb/atbash__cipher_8cpp.html#autotoc_md0',1,'Algorithm'],['../d6/d2c/caesar__cipher_8cpp.html#autotoc_md1',1,'Algorithm'],['../dd/d12/vigenere__cipher_8cpp.html#autotoc_md2',1,'Algorithm'],['../d3/d4c/xor__cipher_8cpp.html#autotoc_md3',1,'Algorithm'],['../da/dc3/linked__list_8cpp.html#autotoc_md41',1,'Algorithm'],['../d7/d00/list__array_8cpp.html#autotoc_md42',1,'Algorithm'],['../d8/df0/queue__using__array_8cpp.html#autotoc_md43',1,'Algorithm'],['../d6/d05/reverse__a__linked__list_8cpp.html#autotoc_md44',1,'Algorithm'],['../db/d16/0__1__knapsack_8cpp.html#autotoc_md69',1,'Algorithm'],['../d7/d73/abbreviation_8cpp.html#autotoc_md70',1,'Algorithm'],['../d6/d10/cut__rod_8cpp.html#autotoc_md71',1,'Algorithm'],['../d4/da0/kadane_8cpp.html#autotoc_md72',1,'Algorithm'],['../da/d52/minimum__edit__distance_8cpp.html#autotoc_md73',1,'Algorithm'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#autotoc_md74',1,'Algorithm'],['../d4/d8d/jarvis__algorithm_8cpp.html#autotoc_md75',1,'Algorithm'],['../d8/d99/connected__components__with__dsu_8cpp.html#autotoc_md76',1,'Algorithm'],['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md82',1,'Algorithm'],['../d5/d96/md5_8cpp.html#autotoc_md83',1,'Algorithm'],['../d8/d7a/sha1_8cpp.html#autotoc_md84',1,'Algorithm'],['../dd/d47/namespacemath.html#autotoc_md85',1,'Algorithm'],['../d4/d38/power__of__two_8cpp.html#autotoc_md86',1,'Algorithm'],['../d5/d33/gram__schmidt_8cpp.html#autotoc_md88',1,'Algorithm'],['../d1/ded/windowed__median_8cpp.html#autotoc_md102',1,'Algorithm'],['../d5/d45/sublist__search_8cpp.html#autotoc_md108',1,'Algorithm'],['../d5/ddb/bogo__sort_8cpp.html#autotoc_md110',1,'Algorithm'],['../d2/d26/count__inversions_8cpp.html#autotoc_md115',1,'Algorithm'],['../d3/df9/recursive__bubble__sort_8cpp.html#autotoc_md116',1,'Algorithm'],['../d5/d4c/group__sorting.html',1,'Sorting Algorithm']]],
+  ['algorithm_20analysis_20best_20case_20worst_20case_20average_20case_38',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]],
+  ['algorithm_20explanation_39',['Algorithm explanation',['../d3/db3/lru__cache_8cpp.html#autotoc_md97',1,'']]],
+  ['algorithms_40',['Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48',1,'Cpu Scheduling Algorithms'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56',1,'Greedy Algorithms'],['../d9/d66/group__machine__learning.html',1,'Machine Learning Algorithms']]],
+  ['algorithms_20c_41',['The Algorithms - C++',['../index.html',1,'']]],
+  ['aliquot_5fsum_42',['aliquot_sum',['../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf',1,'math']]],
+  ['aliquot_5fsum_2ecpp_43',['aliquot_sum.cpp',['../de/d99/aliquot__sum_8cpp.html',1,'']]],
+  ['analysis_20best_20case_20worst_20case_20average_20case_44',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]],
+  ['analyzer_45',['Static Code Analyzer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md38',1,'']]],
+  ['and_20conquer_46',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]],
+  ['and_20maintainers_47',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]],
+  ['and_20not_20matching_20edges_48',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]],
+  ['and_5ftest_49',['and_test',['../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9',1,'boyer_moore.cpp']]],
+  ['ans_50',['ans',['../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa',1,'matrix_exponentiation.cpp']]],
+  ['aplhabet_5fsize_51',['APLHABET_SIZE',['../d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd',1,'boyer_moore.cpp']]],
+  ['apply_5ffunction_52',['apply_function',['../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb',1,'machine_learning']]],
+  ['approximate_5fpi_53',['approximate_pi',['../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188',1,'math']]],
+  ['approximate_5fpi_2ecpp_54',['approximate_pi.cpp',['../d0/d51/approximate__pi_8cpp.html',1,'']]],
+  ['are_5falmost_5fequal_55',['are_almost_equal',['../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703',1,'others']]],
+  ['are_5famicable_56',['are_amicable',['../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec',1,'math']]],
+  ['area_2ecpp_57',['area.cpp',['../dc/d82/area_8cpp.html',1,'']]],
+  ['arg_58',['arg',['../da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41',1,'Complex']]],
+  ['argmax_59',['argmax',['../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec',1,'machine_learning']]],
+  ['armstrong_5fnumber_5ftemplated_2ecpp_60',['armstrong_number_templated.cpp',['../d1/da7/armstrong__number__templated_8cpp.html',1,'']]],
+  ['arr_61',['arr',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d',1,'data_structures::queue_using_array::Queue_Array::arr'],['../d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b',1,'data_structures::trie::arr']]],
+  ['array_5fleft_5frotation_2ecpp_62',['array_left_rotation.cpp',['../d9/d14/array__left__rotation_8cpp.html',1,'']]],
+  ['array_5fright_5frotation_2ecpp_63',['array_right_rotation.cpp',['../d6/d57/array__right__rotation_8cpp.html',1,'']]],
+  ['ask_5fdata_64',['ask_data',['../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3',1,'games::memory_game']]],
+  ['assertarray_65',['assertArray',['../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a',1,'quadratic_equations_complex_numbers.cpp']]],
+  ['assign_5fresults_66',['assign_results',['../d8/d41/namespacegames_1_1memory__game.html#a3ceeea62d8fa6c563e2c66359fd73413',1,'games::memory_game']]],
+  ['atbash_67',['atbash',['../de/db3/namespaceatbash.html',1,'']]],
+  ['atbash_5fcipher_68',['atbash_cipher',['../dc/dfb/atbash__cipher_8cpp.html#a8f7dd4dcd3df7c512c20482afc2dbb9d',1,'ciphers::atbash']]],
+  ['atbash_5fcipher_2ecpp_69',['atbash_cipher.cpp',['../dc/dfb/atbash__cipher_8cpp.html',1,'']]],
+  ['attribution_70',['Attribution',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md15',1,'']]],
+  ['augmenting_20paths_71',['Augmenting paths',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md80',1,'']]],
+  ['auxiliary_5fq_72',['auxiliary_q',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a2f80f87fc6f6ded938426698bba89323',1,'data_structures::stack_using_queue::Stack']]],
+  ['availarray_73',['AvailArray',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c',1,'linkedlist_implentation_usingarray.cpp']]],
+  ['average_20case_74',['Average Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md114',1,'Average Case'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)']]],
+  ['avltree_2ecpp_75',['avltree.cpp',['../d8/dee/avltree_8cpp.html',1,'']]],
+  ['aystar_5fsearch_76',['aystar_search',['../db/ddc/namespaceaystar__search.html',1,'']]],
+  ['aystarsearch_77',['AyStarSearch',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html',1,'machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;'],['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e',1,'machine_learning::aystar_search::AyStarSearch::AyStarSearch()']]]
 ];
diff --git a/search/all_7.js b/search/all_7.js
index 1490a73ef..09ab2a363 100644
--- a/search/all_7.js
+++ b/search/all_7.js
@@ -1,152 +1,75 @@
 var searchData=
 [
-  ['b_0',['b',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/params.html',0,'std::extreme_value_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/params.html',0,'std::uniform_real_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/params.html',0,'std::weibull_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/params.html',0,'std::uniform_int_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/params.html',0,'std::cauchy_distribution::b()']]],
-  ['babylonian_5fmethod_1',['babylonian_method',['../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309',1,'numerical_methods']]],
-  ['babylonian_5fmethod_2ecpp_2',['babylonian_method.cpp',['../dc/d9c/babylonian__method_8cpp.html',1,'']]],
-  ['back_3',['back',['http://en.cppreference.com/w/cpp/container/dynarray/back.html',0,'std::dynarray::back()'],['http://en.cppreference.com/w/cpp/container/vector/back.html',0,'std::vector::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::string::back()'],['http://en.cppreference.com/w/cpp/container/deque/back.html',0,'std::deque::back()'],['http://en.cppreference.com/w/cpp/container/queue/back.html',0,'std::queue::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::basic_string::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::wstring::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::u16string::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::u32string::back()'],['http://en.cppreference.com/w/cpp/container/list/back.html',0,'std::list::back()'],['http://en.cppreference.com/w/cpp/container/array/back.html',0,'std::array::back()']]],
-  ['back_5finsert_5fiterator_4',['back_insert_iterator',['http://en.cppreference.com/w/cpp/iterator/back_insert_iterator.html',0,'std']]],
-  ['back_5finserter_5',['back_inserter',['http://en.cppreference.com/w/cpp/iterator/back_inserter.html',0,'std']]],
-  ['backtracking_6',['Backtracking',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'']]],
-  ['backtracking_7',['backtracking',['../db/dc0/namespacebacktracking.html',1,'']]],
-  ['bad_8',['bad',['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::fstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ios::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_fstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::iostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wistream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::stringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wifstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_istream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::strstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_stringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istrstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wiostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_istringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ifstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostrstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wfstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_iostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wstringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wistringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ifstream::bad()']]],
-  ['bad_5falloc_9',['bad_alloc',['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_alloc'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_alloc::bad_alloc()']]],
-  ['bad_5farray_5flength_10',['bad_array_length',['http://en.cppreference.com/w/cpp/memory/new/bad_array_length.html',0,'std::bad_array_length'],['http://en.cppreference.com/w/cpp/memory/new/bad_array_length.html',0,'std::bad_array_length::bad_array_length()']]],
-  ['bad_5farray_5fnew_5flength_11',['bad_array_new_length',['http://en.cppreference.com/w/cpp/memory/new/bad_array_new_length.html',0,'std::bad_array_new_length'],['http://en.cppreference.com/w/cpp/memory/new/bad_array_new_length/bad_array_new_length.html',0,'std::bad_array_new_length::bad_array_new_length()']]],
-  ['bad_5fcast_12',['bad_cast',['http://en.cppreference.com/w/cpp/types/bad_cast.html',0,'std::bad_cast'],['http://en.cppreference.com/w/cpp/types/bad_cast/bad_cast.html',0,'std::bad_cast::bad_cast()']]],
-  ['bad_5fchar_13',['bad_char',['../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645',1,'strings::boyer_moore::pattern']]],
-  ['bad_5fexception_14',['bad_exception',['http://en.cppreference.com/w/cpp/error/bad_exception.html',0,'std']]],
-  ['bad_5ffunction_5fcall_15',['bad_function_call',['http://en.cppreference.com/w/cpp/utility/functional/bad_function_call.html',0,'std::bad_function_call'],['http://en.cppreference.com/w/cpp/utility/functional/bad_function_call.html',0,'std::bad_function_call::bad_function_call()']]],
-  ['bad_5foptional_5faccess_16',['bad_optional_access',['http://en.cppreference.com/w/cpp/utility/bad_optional_access.html',0,'std::bad_optional_access'],['http://en.cppreference.com/w/cpp/utility/bad_optional_access.html',0,'std::bad_optional_access::bad_optional_access()']]],
-  ['bad_5ftypeid_17',['bad_typeid',['http://en.cppreference.com/w/cpp/types/bad_typeid.html',0,'std::bad_typeid'],['http://en.cppreference.com/w/cpp/types/bad_typeid/bad_typeid.html',0,'std::bad_typeid::bad_typeid()']]],
-  ['bad_5fweak_5fptr_18',['bad_weak_ptr',['http://en.cppreference.com/w/cpp/memory/bad_weak_ptr.html',0,'std::bad_weak_ptr'],['http://en.cppreference.com/w/cpp/memory/bad_weak_ptr/bad_weak_ptr.html',0,'std::bad_weak_ptr::bad_weak_ptr()']]],
-  ['ban_19',['Ban',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md13',1,'3. Temporary Ban'],['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md14',1,'4. Permanent Ban']]],
-  ['base_20',['base',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::ranlux48::base()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::discard_block_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/base.html',0,'std::independent_bits_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/base.html',0,'std::shuffle_order_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::ranlux24::base()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/base.html',0,'std::knuth_b::base()']]],
-  ['base64_5fencoding_21',['base64_encoding',['../d9/dc9/namespacebase64__encoding.html',1,'']]],
-  ['basic_5ffilebuf_22',['basic_filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf.html',0,'std::basic_filebuf'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::basic_filebuf::basic_filebuf()']]],
-  ['basic_5ffstream_23',['basic_fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std::basic_fstream&lt; Char &gt;'],['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::basic_fstream::basic_fstream()']]],
-  ['basic_5ffstream_3c_20char_20_3e_24',['basic_fstream&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std']]],
-  ['basic_5ffstream_3c_20wchar_5ft_20_3e_25',['basic_fstream&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std']]],
-  ['basic_5fifstream_26',['basic_ifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std::basic_ifstream&lt; Char &gt;'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::basic_ifstream::basic_ifstream()']]],
-  ['basic_5fifstream_3c_20char_20_3e_27',['basic_ifstream&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std']]],
-  ['basic_5fifstream_3c_20wchar_5ft_20_3e_28',['basic_ifstream&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std']]],
-  ['basic_5fios_29',['basic_ios',['http://en.cppreference.com/w/cpp/io/basic_ios.html',0,'std::basic_ios&lt; Char &gt;'],['http://en.cppreference.com/w/cpp/io/basic_ios/basic_ios.html',0,'std::basic_ios::basic_ios()']]],
-  ['basic_5fios_3c_20char_20_3e_30',['basic_ios&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_ios.html',0,'std']]],
-  ['basic_5fios_3c_20wchar_5ft_20_3e_31',['basic_ios&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_ios.html',0,'std']]],
-  ['basic_5fiostream_32',['basic_iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std::basic_iostream&lt; Char &gt;'],['http://en.cppreference.com/w/cpp/io/basic_iostream/basic_iostream.html',0,'std::basic_iostream::basic_iostream()']]],
-  ['basic_5fiostream_3c_20char_20_3e_33',['basic_iostream&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std']]],
-  ['basic_5fiostream_3c_20wchar_5ft_20_3e_34',['basic_iostream&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std']]],
-  ['basic_5fistream_35',['basic_istream',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std::basic_istream&lt; Char &gt;'],['http://en.cppreference.com/w/cpp/io/basic_istream/basic_istream.html',0,'std::basic_istream::basic_istream()']]],
-  ['basic_5fistream_3c_20char_20_3e_36',['basic_istream&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]],
-  ['basic_5fistream_3c_20wchar_5ft_20_3e_37',['basic_istream&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]],
-  ['basic_5fistringstream_38',['basic_istringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std::basic_istringstream&lt; Char &gt;'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::basic_istringstream::basic_istringstream()']]],
-  ['basic_5fistringstream_3c_20char_20_3e_39',['basic_istringstream&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std']]],
-  ['basic_5fistringstream_3c_20wchar_5ft_20_3e_40',['basic_istringstream&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std']]],
-  ['basic_5fofstream_41',['basic_ofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std::basic_ofstream&lt; Char &gt;'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/basic_ofstream.html',0,'std::basic_ofstream::basic_ofstream()']]],
-  ['basic_5fofstream_3c_20char_20_3e_42',['basic_ofstream&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std']]],
-  ['basic_5fofstream_3c_20wchar_5ft_20_3e_43',['basic_ofstream&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std']]],
-  ['basic_5fostream_44',['basic_ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std::basic_ostream&lt; Char &gt;'],['http://en.cppreference.com/w/cpp/io/basic_ostream/basic_ostream.html',0,'std::basic_ostream::basic_ostream()']]],
-  ['basic_5fostream_3c_20char_20_3e_45',['basic_ostream&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]],
-  ['basic_5fostream_3c_20wchar_5ft_20_3e_46',['basic_ostream&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]],
-  ['basic_5fostringstream_47',['basic_ostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std::basic_ostringstream&lt; Char &gt;'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::basic_ostringstream::basic_ostringstream()']]],
-  ['basic_5fostringstream_3c_20char_20_3e_48',['basic_ostringstream&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std']]],
-  ['basic_5fostringstream_3c_20wchar_5ft_20_3e_49',['basic_ostringstream&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std']]],
-  ['basic_5fregex_50',['basic_regex',['http://en.cppreference.com/w/cpp/regex/basic_regex.html',0,'std::basic_regex'],['http://en.cppreference.com/w/cpp/regex/basic_regex/basic_regex.html',0,'std::basic_regex::basic_regex()']]],
-  ['basic_5fstreambuf_51',['basic_streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf.html',0,'std::basic_streambuf'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/basic_streambuf.html',0,'std::basic_streambuf::basic_streambuf()']]],
-  ['basic_5fstring_52',['basic_string',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std::basic_string&lt; Char &gt;'],['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::basic_string::basic_string()']]],
-  ['basic_5fstring_3c_20char_20_3e_53',['basic_string&lt; char &gt;',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]],
-  ['basic_5fstring_3c_20char16_5ft_20_3e_54',['basic_string&lt; char16_t &gt;',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]],
-  ['basic_5fstring_3c_20char32_5ft_20_3e_55',['basic_string&lt; char32_t &gt;',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]],
-  ['basic_5fstring_3c_20char8_5ft_20_3e_56',['basic_string&lt; char8_t &gt;',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]],
-  ['basic_5fstring_3c_20wchar_5ft_20_3e_57',['basic_string&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]],
-  ['basic_5fstringbuf_58',['basic_stringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf.html',0,'std::basic_stringbuf'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::basic_stringbuf::basic_stringbuf()']]],
-  ['basic_5fstringstream_59',['basic_stringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std::basic_stringstream&lt; Char &gt;'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::basic_stringstream::basic_stringstream()']]],
-  ['basic_5fstringstream_3c_20char_20_3e_60',['basic_stringstream&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std']]],
-  ['basic_5fstringstream_3c_20wchar_5ft_20_3e_61',['basic_stringstream&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std']]],
-  ['batch_5fpredict_62',['batch_predict',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a88bf9023ab3d4cdb61cf707c7cdfc86b',1,'machine_learning::neural_network::NeuralNetwork']]],
-  ['bayes_5fagivenb_63',['bayes_AgivenB',['../d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba',1,'bayes_theorem.cpp']]],
-  ['bayes_5fbgivena_64',['bayes_BgivenA',['../d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f',1,'bayes_theorem.cpp']]],
-  ['bayes_5ftheorem_2ecpp_65',['bayes_theorem.cpp',['../d5/d67/bayes__theorem_8cpp.html',1,'']]],
-  ['before_66',['before',['http://en.cppreference.com/w/cpp/types/type_info/before.html',0,'std::type_info']]],
-  ['before_20contributing_67',['Before contributing',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md22',1,'']]],
-  ['before_5fbegin_68',['before_begin',['http://en.cppreference.com/w/cpp/container/forward_list/before_begin.html',0,'std::forward_list']]],
-  ['begin_69',['begin',['http://en.cppreference.com/w/cpp/container/dynarray/begin.html',0,'std::dynarray::begin()'],['http://en.cppreference.com/w/cpp/container/vector/begin.html',0,'std::vector::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::match_results::begin()'],['http://en.cppreference.com/w/cpp/container/multiset/begin.html',0,'std::multiset::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::string::begin()'],['http://en.cppreference.com/w/cpp/container/set/begin.html',0,'std::set::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_map/begin.html',0,'std::unordered_map::begin()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/begin.html',0,'std::initializer_list::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wsmatch::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::smatch::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin.html',0,'std::unordered_multimap::begin()'],['http://en.cppreference.com/w/cpp/container/forward_list/begin.html',0,'std::forward_list::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wcmatch::begin()'],['http://en.cppreference.com/w/cpp/container/deque/begin.html',0,'std::deque::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::basic_string::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::wstring::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin.html',0,'std::unordered_multiset::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u16string::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u32string::begin()'],['http://en.cppreference.com/w/cpp/container/list/begin.html',0,'std::list::begin()'],['http://en.cppreference.com/w/cpp/container/map/begin.html',0,'std::map::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::cmatch::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin.html',0,'std::unordered_set::begin()'],['http://en.cppreference.com/w/cpp/container/multimap/begin.html',0,'std::multimap::begin()'],['http://en.cppreference.com/w/cpp/container/array/begin.html',0,'std::array::begin()'],['http://en.cppreference.com/w/cpp/iterator/begin.html',0,'std::begin()']]],
-  ['begin_28int_29_70',['begin(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/begin2.html',0,'std::unordered_map::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin2.html',0,'std::unordered_multimap::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin2.html',0,'std::unordered_multiset::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin2.html',0,'std::unordered_set::begin(int)()']]],
-  ['bernoulli_5fdistribution_71',['bernoulli_distribution',['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution.html',0,'std::bernoulli_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/bernoulli_distribution.html',0,'std::bernoulli_distribution::bernoulli_distribution()']]],
-  ['best_20case_72',['Best Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md112',1,'']]],
-  ['best_20case_20worst_20case_20average_20case_73',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]],
-  ['beta_74',['beta',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/params.html',0,'std::gamma_distribution']]],
-  ['bfs_75',['bfs',['../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93',1,'graph::HKGraph']]],
-  ['bidijkstra_76',['Bidijkstra',['../d7/d07/bidirectional__dijkstra_8cpp.html#a1b2df3d52a403ad46523ab90d3a723c1',1,'graph::bidirectional_dijkstra']]],
-  ['bidirectional_5fdijkstra_77',['bidirectional_dijkstra',['../d4/d13/namespacebidirectional__dijkstra.html',1,'']]],
-  ['bidirectional_5fdijkstra_2ecpp_78',['bidirectional_dijkstra.cpp',['../d7/d07/bidirectional__dijkstra_8cpp.html',1,'']]],
-  ['bidirectional_5fiterator_5ftag_79',['bidirectional_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]],
-  ['binary_5faddition_2ecpp_80',['binary_addition.cpp',['../d9/d1f/binary__addition_8cpp.html',1,'']]],
-  ['binary_5fexponent_2ecpp_81',['binary_exponent.cpp',['../de/dcf/binary__exponent_8cpp.html',1,'']]],
-  ['binary_5ffunction_82',['binary_function',['http://en.cppreference.com/w/cpp/utility/functional/binary_function.html',0,'std']]],
-  ['binary_5finsertion_5fsort_2ecpp_83',['binary_insertion_sort.cpp',['../d8/dcc/binary__insertion__sort_8cpp.html',1,'']]],
-  ['binary_5fnegate_84',['binary_negate',['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std::binary_negate'],['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std::binary_negate::binary_negate()']]],
-  ['binary_5fs_85',['binary_s',['../d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae',1,'exponential_search.cpp']]],
-  ['binary_5fsearch_86',['binary_search',['http://en.cppreference.com/w/cpp/algorithm/binary_search.html',0,'std::binary_search()'],['../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd',1,'sorting::binary_search()']]],
-  ['binary_5fsearch_5ftree_87',['binary_search_tree',['../d9/dde/classbinary__search__tree.html',1,'binary_search_tree&lt; T &gt;'],['../d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6',1,'binary_search_tree::binary_search_tree()']]],
-  ['binary_5fsearch_5ftree_2ecpp_88',['binary_search_tree.cpp',['../d3/d26/binary__search__tree_8cpp.html',1,'']]],
-  ['binary_5fsearch_5ftree2_2ecpp_89',['binary_search_tree2.cpp',['../df/d42/binary__search__tree2_8cpp.html',1,'']]],
-  ['binaryaddition_90',['BinaryAddition',['../de/df6/classgreedy__algorithms_1_1_binary_addition.html',1,'greedy_algorithms']]],
-  ['binaryheap_2ecpp_91',['binaryheap.cpp',['../de/dc3/binaryheap_8cpp.html',1,'']]],
-  ['binarysearch_92',['BinarySearch',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf',1,'data_structures::list_array::list']]],
-  ['binarytree_93',['BinaryTree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree'],['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html',1,'others::iterative_tree_traversals::BinaryTree'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree(int64_t data)']]],
-  ['bind_94',['bind',['http://en.cppreference.com/w/cpp/utility/functional/bind.html',0,'std']]],
-  ['binexpo_95',['binExpo',['../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73',1,'binExpo():&#160;binary_exponent.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a1c62a87e79f29b98d8fe5b12eacdd928',1,'math::modular_inverse_fermat::binExpo()']]],
-  ['binexpo_5falt_96',['binExpo_alt',['../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f',1,'binary_exponent.cpp']]],
-  ['binomial_97',['binomial',['../d7/d7a/namespacebinomial.html',1,'']]],
-  ['binomial_5fcalculate_2ecpp_98',['binomial_calculate.cpp',['../d8/db1/binomial__calculate_8cpp.html',1,'']]],
-  ['binomial_5fdist_2ecpp_99',['binomial_dist.cpp',['../d6/db0/binomial__dist_8cpp.html',1,'']]],
-  ['binomial_5fdistribution_100',['binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution.html',0,'std::binomial_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/binomial_distribution.html',0,'std::binomial_distribution::binomial_distribution()']]],
-  ['binomial_5fexpected_101',['binomial_expected',['../d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813',1,'binomial_dist.cpp']]],
-  ['binomial_5frange_5fsuccesses_102',['binomial_range_successes',['../d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25',1,'binomial_dist.cpp']]],
-  ['binomial_5fstandard_5fdeviation_103',['binomial_standard_deviation',['../d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc',1,'binomial_dist.cpp']]],
-  ['binomial_5fvariance_104',['binomial_variance',['../d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861',1,'binomial_dist.cpp']]],
-  ['binomial_5fx_5fsuccesses_105',['binomial_x_successes',['../d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76',1,'binomial_dist.cpp']]],
-  ['binomialcoeffsum_106',['binomialCoeffSum',['../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea',1,'math']]],
-  ['bipartite_20graph_107',['Bipartite graph',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md77',1,'']]],
-  ['bisection_5fmethod_2ecpp_108',['bisection_method.cpp',['../d7/d6a/bisection__method_8cpp.html',1,'']]],
-  ['bit_109',['bit',['../de/d0d/classrange__queries_1_1fenwick__tree.html#af7b7a8c1c5724ed8683d7e28bef526e6',1,'range_queries::fenwick_tree']]],
-  ['bit_20manipulation_110',['Bit Manipulation',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46',1,'']]],
-  ['bit_5fand_111',['bit_and',['http://en.cppreference.com/w/cpp/utility/functional/bit_and.html',0,'std']]],
-  ['bit_5fmanipulation_112',['bit_manipulation',['../d7/d81/namespacebit__manipulation.html',1,'']]],
-  ['bit_5fnot_113',['bit_not',['http://en.cppreference.com/w/cpp/utility/functional/bit_not.html',0,'std']]],
-  ['bit_5for_114',['bit_or',['http://en.cppreference.com/w/cpp/utility/functional/bit_or.html',0,'std']]],
-  ['bitcount_115',['bitCount',['../d4/d48/hamming__distance_8cpp.html#a65d845df3fecff7087a2126c7b72030b',1,'bit_manipulation::hamming_distance']]],
-  ['bitset_116',['Bitset',['../d9/dae/classdata__structures_1_1_bitset.html',1,'data_structures::Bitset'],['../d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130',1,'data_structures::Bitset::Bitset()']]],
-  ['bitset_117',['bitset',['http://en.cppreference.com/w/cpp/utility/bitset.html',0,'std::bitset&lt; Bits &gt;'],['http://en.cppreference.com/w/cpp/utility/bitset/bitset.html',0,'std::bitset::bitset()']]],
-  ['bitset_3c_20maxn_20_3e_118',['bitset&lt; MAXN &gt;',['http://en.cppreference.com/w/cpp/utility/bitset.html',0,'std']]],
-  ['black_119',['BLACK',['../da/d4b/depth__first__search__with__stack_8cpp.html#a7f1cd94cf4da32933e8551cb3577e18b',1,'depth_first_search_with_stack.cpp']]],
-  ['blocksize_120',['blockSize',['../d9/dae/classdata__structures_1_1_bitset.html#ad7f7d479079a95bcc9175465395fa23f',1,'data_structures::Bitset']]],
-  ['bloom_5ffilter_2ecpp_121',['bloom_filter.cpp',['../d9/dab/bloom__filter_8cpp.html',1,'']]],
-  ['bloomfilter_122',['BloomFilter',['../dc/dd4/classdata__structures_1_1_bloom_filter.html',1,'data_structures::BloomFilter&lt; T &gt;'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a',1,'data_structures::BloomFilter::BloomFilter()']]],
-  ['bogo_5fsort_2ecpp_123',['bogo_sort.cpp',['../d5/ddb/bogo__sort_8cpp.html',1,'']]],
-  ['boolalpha_124',['boolalpha',['http://en.cppreference.com/w/cpp/io/manip/boolalpha.html',0,'std']]],
-  ['boruvkas_125',['boruvkas',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]],
-  ['boruvkas_5fminimum_5fspanning_5ftree_126',['boruvkas_minimum_spanning_tree',['../d8/d64/namespaceboruvkas__minimum__spanning__tree.html',1,'']]],
-  ['boruvkas_5fminimum_5fspanning_5ftree_2ecpp_127',['boruvkas_minimum_spanning_tree.cpp',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html',1,'']]],
-  ['bottom_128',['bottom',['../d2/dc8/classdata__structures_1_1_stack.html#a2ac469fcc2229d273450e429139d90e6',1,'data_structures::Stack']]],
-  ['boyer_5fmoore_2ecpp_129',['boyer_moore.cpp',['../d3/db2/boyer__moore_8cpp.html',1,'']]],
-  ['breadth_5ffirst_5fsearch_130',['breadth_first_search',['../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981',1,'graph::Graph']]],
-  ['breadth_5ffirst_5fsearch_2ecpp_131',['breadth_first_search.cpp',['../df/d82/breadth__first__search_8cpp.html',1,'']]],
-  ['brent_5fmethod_5fextrema_2ecpp_132',['brent_method_extrema.cpp',['../db/d01/brent__method__extrema_8cpp.html',1,'']]],
-  ['brute_5fforce_133',['brute_force',['../d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8',1,'string_search']]],
-  ['brute_5fforce_5fstring_5fsearching_2ecpp_134',['brute_force_string_searching.cpp',['../d3/d7d/brute__force__string__searching_8cpp.html',1,'']]],
-  ['bsearch_135',['bsearch',['http://en.cppreference.com/w/cpp/algorithm/bsearch.html',0,'std']]],
-  ['bst_5fnode_136',['bst_node',['../dd/db6/structbinary__search__tree_1_1bst__node.html',1,'binary_search_tree&lt; T &gt;::bst_node'],['../dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778',1,'binary_search_tree::bst_node::bst_node()']]],
-  ['bt_137',['BT',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html',1,'others::recursive_tree_traversals']]],
-  ['btowc_138',['btowc',['http://en.cppreference.com/w/cpp/string/multibyte/btowc.html',0,'std']]],
-  ['btree_139',['Btree',['../d9/d90/struct_btree.html',1,'']]],
-  ['bubble_20sort_20algorithm_20analysis_20best_20case_20worst_20case_20average_20case_140',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]],
-  ['bubble_5fsort_141',['bubble_sort',['../d0/dd5/namespacebubble__sort.html',1,'bubble_sort'],['../d8/d13/bubble__sort_8cpp.html#af3b12930a83915712461d53fe9659686',1,'sorting::bubble_sort::bubble_sort()']]],
-  ['bubble_5fsort_2ecpp_142',['bubble_sort.cpp',['../d8/d13/bubble__sort_8cpp.html',1,'']]],
-  ['bucket_143',['bucket',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket.html',0,'std::unordered_map::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket.html',0,'std::unordered_multimap::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket.html',0,'std::unordered_multiset::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket.html',0,'std::unordered_set::bucket()']]],
-  ['bucket_5fcount_144',['bucket_count',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket_count.html',0,'std::unordered_map::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket_count.html',0,'std::unordered_multimap::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket_count.html',0,'std::unordered_multiset::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket_count.html',0,'std::unordered_set::bucket_count()']]],
-  ['bucket_5fsize_145',['bucket_size',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket_size.html',0,'std::unordered_map::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket_size.html',0,'std::unordered_multimap::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket_size.html',0,'std::unordered_multiset::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket_size.html',0,'std::unordered_set::bucket_size()']]],
-  ['build_146',['build',['../d1/d9e/prefix__sum__array_8cpp.html#ab36151479ad37d53ef9fcb60a274b1d9',1,'range_queries::prefix_sum_array']]],
-  ['building_20locally_147',['Building Locally',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md37',1,'']]],
-  ['buzz_5fnumber_2ecpp_148',['buzz_number.cpp',['../d1/d76/buzz__number_8cpp.html',1,'']]]
+  ['babylonian_5fmethod_0',['babylonian_method',['../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309',1,'numerical_methods']]],
+  ['babylonian_5fmethod_2ecpp_1',['babylonian_method.cpp',['../dc/d9c/babylonian__method_8cpp.html',1,'']]],
+  ['backtracking_2',['Backtracking',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'']]],
+  ['backtracking_3',['backtracking',['../db/dc0/namespacebacktracking.html',1,'']]],
+  ['bad_5fchar_4',['bad_char',['../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645',1,'strings::boyer_moore::pattern']]],
+  ['ban_5',['Ban',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md13',1,'3. Temporary Ban'],['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md14',1,'4. Permanent Ban']]],
+  ['base64_5fencoding_6',['base64_encoding',['../d9/dc9/namespacebase64__encoding.html',1,'']]],
+  ['batch_5fpredict_7',['batch_predict',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a88bf9023ab3d4cdb61cf707c7cdfc86b',1,'machine_learning::neural_network::NeuralNetwork']]],
+  ['bayes_5fagivenb_8',['bayes_AgivenB',['../d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba',1,'bayes_theorem.cpp']]],
+  ['bayes_5fbgivena_9',['bayes_BgivenA',['../d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f',1,'bayes_theorem.cpp']]],
+  ['bayes_5ftheorem_2ecpp_10',['bayes_theorem.cpp',['../d5/d67/bayes__theorem_8cpp.html',1,'']]],
+  ['before_20contributing_11',['Before contributing',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md22',1,'']]],
+  ['best_20case_12',['Best Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md112',1,'']]],
+  ['best_20case_20worst_20case_20average_20case_13',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]],
+  ['bfs_14',['bfs',['../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93',1,'graph::HKGraph']]],
+  ['bidijkstra_15',['Bidijkstra',['../d7/d07/bidirectional__dijkstra_8cpp.html#a1b2df3d52a403ad46523ab90d3a723c1',1,'graph::bidirectional_dijkstra']]],
+  ['bidirectional_5fdijkstra_16',['bidirectional_dijkstra',['../d4/d13/namespacebidirectional__dijkstra.html',1,'']]],
+  ['bidirectional_5fdijkstra_2ecpp_17',['bidirectional_dijkstra.cpp',['../d7/d07/bidirectional__dijkstra_8cpp.html',1,'']]],
+  ['binary_5faddition_2ecpp_18',['binary_addition.cpp',['../d9/d1f/binary__addition_8cpp.html',1,'']]],
+  ['binary_5fexponent_2ecpp_19',['binary_exponent.cpp',['../de/dcf/binary__exponent_8cpp.html',1,'']]],
+  ['binary_5finsertion_5fsort_2ecpp_20',['binary_insertion_sort.cpp',['../d8/dcc/binary__insertion__sort_8cpp.html',1,'']]],
+  ['binary_5fs_21',['binary_s',['../d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae',1,'exponential_search.cpp']]],
+  ['binary_5fsearch_22',['binary_search',['../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd',1,'sorting']]],
+  ['binary_5fsearch_5ftree_23',['binary_search_tree',['../d9/dde/classbinary__search__tree.html',1,'binary_search_tree&lt; T &gt;'],['../d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6',1,'binary_search_tree::binary_search_tree()']]],
+  ['binary_5fsearch_5ftree_2ecpp_24',['binary_search_tree.cpp',['../d3/d26/binary__search__tree_8cpp.html',1,'']]],
+  ['binary_5fsearch_5ftree2_2ecpp_25',['binary_search_tree2.cpp',['../df/d42/binary__search__tree2_8cpp.html',1,'']]],
+  ['binaryaddition_26',['BinaryAddition',['../de/df6/classgreedy__algorithms_1_1_binary_addition.html',1,'greedy_algorithms']]],
+  ['binaryheap_2ecpp_27',['binaryheap.cpp',['../de/dc3/binaryheap_8cpp.html',1,'']]],
+  ['binarysearch_28',['BinarySearch',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf',1,'data_structures::list_array::list']]],
+  ['binarytree_29',['BinaryTree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree'],['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html',1,'others::iterative_tree_traversals::BinaryTree'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree(int64_t data)']]],
+  ['binexpo_30',['binExpo',['../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73',1,'binExpo():&#160;binary_exponent.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a1c62a87e79f29b98d8fe5b12eacdd928',1,'math::modular_inverse_fermat::binExpo()']]],
+  ['binexpo_5falt_31',['binExpo_alt',['../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f',1,'binary_exponent.cpp']]],
+  ['binomial_32',['binomial',['../d7/d7a/namespacebinomial.html',1,'']]],
+  ['binomial_5fcalculate_2ecpp_33',['binomial_calculate.cpp',['../d8/db1/binomial__calculate_8cpp.html',1,'']]],
+  ['binomial_5fdist_2ecpp_34',['binomial_dist.cpp',['../d6/db0/binomial__dist_8cpp.html',1,'']]],
+  ['binomial_5fexpected_35',['binomial_expected',['../d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813',1,'binomial_dist.cpp']]],
+  ['binomial_5frange_5fsuccesses_36',['binomial_range_successes',['../d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25',1,'binomial_dist.cpp']]],
+  ['binomial_5fstandard_5fdeviation_37',['binomial_standard_deviation',['../d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc',1,'binomial_dist.cpp']]],
+  ['binomial_5fvariance_38',['binomial_variance',['../d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861',1,'binomial_dist.cpp']]],
+  ['binomial_5fx_5fsuccesses_39',['binomial_x_successes',['../d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76',1,'binomial_dist.cpp']]],
+  ['binomialcoeffsum_40',['binomialCoeffSum',['../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea',1,'math']]],
+  ['bipartite_20graph_41',['Bipartite graph',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md77',1,'']]],
+  ['bisection_5fmethod_2ecpp_42',['bisection_method.cpp',['../d7/d6a/bisection__method_8cpp.html',1,'']]],
+  ['bit_43',['bit',['../de/d0d/classrange__queries_1_1fenwick__tree.html#af7b7a8c1c5724ed8683d7e28bef526e6',1,'range_queries::fenwick_tree']]],
+  ['bit_20manipulation_44',['Bit Manipulation',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md46',1,'']]],
+  ['bit_5fmanipulation_45',['bit_manipulation',['../d7/d81/namespacebit__manipulation.html',1,'']]],
+  ['bitcount_46',['bitCount',['../d4/d48/hamming__distance_8cpp.html#a65d845df3fecff7087a2126c7b72030b',1,'bit_manipulation::hamming_distance']]],
+  ['bitset_47',['Bitset',['../d9/dae/classdata__structures_1_1_bitset.html',1,'data_structures::Bitset'],['../d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130',1,'data_structures::Bitset::Bitset()']]],
+  ['black_48',['BLACK',['../da/d4b/depth__first__search__with__stack_8cpp.html#a7f1cd94cf4da32933e8551cb3577e18b',1,'depth_first_search_with_stack.cpp']]],
+  ['blocksize_49',['blockSize',['../d9/dae/classdata__structures_1_1_bitset.html#ad7f7d479079a95bcc9175465395fa23f',1,'data_structures::Bitset']]],
+  ['bloom_5ffilter_2ecpp_50',['bloom_filter.cpp',['../d9/dab/bloom__filter_8cpp.html',1,'']]],
+  ['bloomfilter_51',['BloomFilter',['../dc/dd4/classdata__structures_1_1_bloom_filter.html',1,'data_structures::BloomFilter&lt; T &gt;'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a',1,'data_structures::BloomFilter::BloomFilter()']]],
+  ['bogo_5fsort_2ecpp_52',['bogo_sort.cpp',['../d5/ddb/bogo__sort_8cpp.html',1,'']]],
+  ['boruvkas_53',['boruvkas',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]],
+  ['boruvkas_5fminimum_5fspanning_5ftree_54',['boruvkas_minimum_spanning_tree',['../d8/d64/namespaceboruvkas__minimum__spanning__tree.html',1,'']]],
+  ['boruvkas_5fminimum_5fspanning_5ftree_2ecpp_55',['boruvkas_minimum_spanning_tree.cpp',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html',1,'']]],
+  ['bottom_56',['bottom',['../d2/dc8/classdata__structures_1_1_stack.html#a2ac469fcc2229d273450e429139d90e6',1,'data_structures::Stack']]],
+  ['boyer_5fmoore_2ecpp_57',['boyer_moore.cpp',['../d3/db2/boyer__moore_8cpp.html',1,'']]],
+  ['breadth_5ffirst_5fsearch_58',['breadth_first_search',['../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981',1,'graph::Graph']]],
+  ['breadth_5ffirst_5fsearch_2ecpp_59',['breadth_first_search.cpp',['../df/d82/breadth__first__search_8cpp.html',1,'']]],
+  ['brent_5fmethod_5fextrema_2ecpp_60',['brent_method_extrema.cpp',['../db/d01/brent__method__extrema_8cpp.html',1,'']]],
+  ['brute_5fforce_61',['brute_force',['../d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8',1,'string_search']]],
+  ['brute_5fforce_5fstring_5fsearching_2ecpp_62',['brute_force_string_searching.cpp',['../d3/d7d/brute__force__string__searching_8cpp.html',1,'']]],
+  ['bst_5fnode_63',['bst_node',['../dd/db6/structbinary__search__tree_1_1bst__node.html',1,'binary_search_tree&lt; T &gt;::bst_node'],['../dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778',1,'binary_search_tree::bst_node::bst_node()']]],
+  ['bt_64',['BT',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html',1,'others::recursive_tree_traversals']]],
+  ['btree_65',['Btree',['../d9/d90/struct_btree.html',1,'']]],
+  ['bubble_20sort_20algorithm_20analysis_20best_20case_20worst_20case_20average_20case_66',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]],
+  ['bubble_5fsort_67',['bubble_sort',['../d0/dd5/namespacebubble__sort.html',1,'bubble_sort'],['../d8/d13/bubble__sort_8cpp.html#af3b12930a83915712461d53fe9659686',1,'sorting::bubble_sort::bubble_sort()']]],
+  ['bubble_5fsort_2ecpp_68',['bubble_sort.cpp',['../d8/d13/bubble__sort_8cpp.html',1,'']]],
+  ['build_69',['build',['../d1/d9e/prefix__sum__array_8cpp.html#ab36151479ad37d53ef9fcb60a274b1d9',1,'range_queries::prefix_sum_array']]],
+  ['building_20locally_70',['Building Locally',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md37',1,'']]],
+  ['buzz_5fnumber_2ecpp_71',['buzz_number.cpp',['../d1/d76/buzz__number_8cpp.html',1,'']]]
 ];
diff --git a/search/all_8.js b/search/all_8.js
index 3cccbcdd9..e2c5b0dc9 100644
--- a/search/all_8.js
+++ b/search/all_8.js
@@ -1,200 +1,132 @@
 var searchData=
 [
   ['c_0',['The Algorithms - C++',['../index.html',1,'']]],
-  ['c16rtomb_1',['c16rtomb',['http://en.cppreference.com/w/cpp/string/multibyte/c16rtomb.html',0,'std']]],
-  ['c32rtomb_2',['c32rtomb',['http://en.cppreference.com/w/cpp/string/multibyte/c32rtomb.html',0,'std']]],
-  ['c_5fstr_3',['c_str',['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::basic_string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::wstring::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::u16string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::u32string::c_str()']]],
-  ['cache_4',['cache',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8',1,'others::lru_cache::LRUCache']]],
-  ['caesar_5',['caesar',['../dd/d81/namespacecaesar.html',1,'']]],
-  ['caesar_5fcipher_2ecpp_6',['caesar_cipher.cpp',['../d6/d2c/caesar__cipher_8cpp.html',1,'']]],
-  ['calculate_7',['calculate',['../d8/db1/binomial__calculate_8cpp.html#aae407a2a13362c4c64fbe509ff325978',1,'math::binomial']]],
-  ['call_5fonce_8',['call_once',['http://en.cppreference.com/w/cpp/thread/call_once.html',0,'std']]],
-  ['calloc_9',['calloc',['http://en.cppreference.com/w/cpp/memory/c/calloc.html',0,'std']]],
-  ['can_5fjump_10',['can_jump',['../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502',1,'greedy_algorithms']]],
-  ['canimove_11',['CanIMove',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9',1,'backtracking::n_queens_optimized::CanIMove()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aea343d8a72a39c9a4c0fbcbc362f2648',1,'backtracking::n_queens_all_solutions::CanIMove()']]],
-  ['capacity_12',['capacity',['../d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02',1,'MinHeap::capacity'],['http://en.cppreference.com/w/cpp/container/vector/capacity.html',0,'std::vector::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::basic_string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::wstring::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u16string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u32string::capacity()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c',1,'others::Cache::LFUCache::capacity()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a',1,'others::Cache::LRUCache::capacity()']]],
-  ['cardinality_20matching_13',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]],
-  ['case_14',['Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md114',1,'Average Case'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md112',1,'Best Case'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md113',1,'Worst Case']]],
-  ['case_201_3a_20the_20given_20node_20has_20the_20right_20node_20subtree_15',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]],
-  ['case_202_3a_20the_20given_20node_20does_20not_20have_20a_20right_20node_20subtree_16',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]],
-  ['case_20average_20case_17',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]],
-  ['case_20worst_20case_20average_20case_18',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]],
-  ['catalan_5fnumbers_19',['catalan_numbers',['../dc/d1f/classcatalan__numbers.html',1,'']]],
-  ['catalan_5fnumbers_2ecpp_20',['catalan_numbers.cpp',['../de/dd9/catalan__numbers_8cpp.html',1,'']]],
-  ['catalog_21',['catalog',['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages::catalog'],['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages_base::catalog'],['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages_byname::catalog']]],
-  ['category_22',['category',['http://en.cppreference.com/w/cpp/error/error_code/category.html',0,'std::error_code::category()'],['http://en.cppreference.com/w/cpp/error/error_condition/category.html',0,'std::error_condition::category()']]],
-  ['cauchy_5fdistribution_23',['cauchy_distribution',['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution.html',0,'std::cauchy_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/cauchy_distribution.html',0,'std::cauchy_distribution::cauchy_distribution()']]],
-  ['cbefore_5fbegin_24',['cbefore_begin',['http://en.cppreference.com/w/cpp/container/forward_list/before_begin.html',0,'std::forward_list']]],
-  ['cbegin_25',['cbegin',['http://en.cppreference.com/w/cpp/container/dynarray/begin.html',0,'std::dynarray::cbegin()'],['http://en.cppreference.com/w/cpp/container/vector/begin.html',0,'std::vector::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::match_results::cbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/begin.html',0,'std::multiset::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::string::cbegin()'],['http://en.cppreference.com/w/cpp/container/set/begin.html',0,'std::set::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_map/begin.html',0,'std::unordered_map::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wsmatch::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::smatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin.html',0,'std::unordered_multimap::cbegin()'],['http://en.cppreference.com/w/cpp/container/forward_list/begin.html',0,'std::forward_list::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wcmatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/deque/begin.html',0,'std::deque::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::basic_string::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::wstring::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin.html',0,'std::unordered_multiset::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u16string::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u32string::cbegin()'],['http://en.cppreference.com/w/cpp/container/list/begin.html',0,'std::list::cbegin()'],['http://en.cppreference.com/w/cpp/container/map/begin.html',0,'std::map::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::cmatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin.html',0,'std::unordered_set::cbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/begin.html',0,'std::multimap::cbegin()'],['http://en.cppreference.com/w/cpp/container/array/begin.html',0,'std::array::cbegin()']]],
-  ['cbegin_28int_29_26',['cbegin(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/begin2.html',0,'std::unordered_map::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin2.html',0,'std::unordered_multimap::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin2.html',0,'std::unordered_multiset::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin2.html',0,'std::unordered_set::cbegin(int)()']]],
-  ['cbrt_27',['cbrt',['http://en.cppreference.com/w/cpp/numeric/math/cbrt.html',0,'std']]],
-  ['ceil_28',['ceil',['http://en.cppreference.com/w/cpp/numeric/math/ceil.html',0,'std']]],
-  ['cend_29',['cend',['http://en.cppreference.com/w/cpp/container/dynarray/end.html',0,'std::dynarray::cend()'],['http://en.cppreference.com/w/cpp/container/vector/end.html',0,'std::vector::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::match_results::cend()'],['http://en.cppreference.com/w/cpp/container/multiset/end.html',0,'std::multiset::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::string::cend()'],['http://en.cppreference.com/w/cpp/container/set/end.html',0,'std::set::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_map/end.html',0,'std::unordered_map::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wsmatch::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::smatch::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end.html',0,'std::unordered_multimap::cend()'],['http://en.cppreference.com/w/cpp/container/forward_list/end.html',0,'std::forward_list::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wcmatch::cend()'],['http://en.cppreference.com/w/cpp/container/deque/end.html',0,'std::deque::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::basic_string::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::wstring::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end.html',0,'std::unordered_multiset::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u16string::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u32string::cend()'],['http://en.cppreference.com/w/cpp/container/list/end.html',0,'std::list::cend()'],['http://en.cppreference.com/w/cpp/container/map/end.html',0,'std::map::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::cmatch::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end.html',0,'std::unordered_set::cend()'],['http://en.cppreference.com/w/cpp/container/multimap/end.html',0,'std::multimap::cend()'],['http://en.cppreference.com/w/cpp/container/array/end.html',0,'std::array::cend()']]],
-  ['cend_28int_29_30',['cend(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/end2.html',0,'std::unordered_map::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end2.html',0,'std::unordered_multimap::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end2.html',0,'std::unordered_multiset::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end2.html',0,'std::unordered_set::cend(int)()']]],
-  ['centi_31',['centi',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['cerr_32',['cerr',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]],
-  ['chain_5fquery_33',['chain_query',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24',1,'range_queries::heavy_light_decomposition::HLD']]],
-  ['chaining_2ecpp_34',['chaining.cpp',['../d9/d92/chaining_8cpp.html',1,'']]],
-  ['change_35',['change',['../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579',1,'rungekutta.cpp']]],
-  ['change_5froot_36',['change_root',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0',1,'range_queries::heavy_light_decomposition::Tree']]],
-  ['changes_37',['Making Changes',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md26',1,'']]],
-  ['char_5fto_5fint_38',['char_to_int',['../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988',1,'data_structures::trie']]],
-  ['char_5fto_5fmorse_39',['char_to_morse',['../d8/d76/morse__code_8cpp.html#ab31773fd11555d21f70d6914138d9535',1,'ciphers::morse']]],
-  ['char_5ftraits_40',['char_traits',['http://en.cppreference.com/w/cpp/string/char_traits.html',0,'std']]],
-  ['char_5ftype_41',['char_type',['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate::char_type'],['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages::char_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::char_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::char_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct::char_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std::num_get::char_type'],['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put::char_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct::char_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get::char_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put::char_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put_byname::char_type']]],
-  ['check_42',['check',['../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a',1,'dynamic_programming::word_break']]],
-  ['check_5fall_5fzeros_43',['check_all_zeros',['../d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a',1,'math::gcd_of_n_numbers']]],
-  ['check_5famicable_5fpair_2ecpp_44',['check_amicable_pair.cpp',['../d5/df6/check__amicable__pair_8cpp.html',1,'']]],
-  ['check_5ffactorial_2ecpp_45',['check_factorial.cpp',['../d8/dd5/check__factorial_8cpp.html',1,'']]],
-  ['check_5fif_5fequal_46',['check_if_equal',['../d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd',1,'string_search']]],
-  ['check_5fprime_2ecpp_47',['check_prime.cpp',['../db/d93/check__prime_8cpp.html',1,'']]],
-  ['check_5fsize_5fmatch_48',['check_size_match',['../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56',1,'machine_learning::adaline']]],
-  ['check_5ftermination_49',['check_termination',['../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377',1,'durand_kerner_roots.cpp']]],
-  ['checkbipartite_50',['checkBipartite',['../df/dce/namespacegraph.html#a8e1b547cd407c0774e63f0dc95cda9e7',1,'graph']]],
-  ['chi_5fsquared_5fdistribution_51',['chi_squared_distribution',['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution.html',0,'std::chi_squared_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/chi_squared_distribution.html',0,'std::chi_squared_distribution::chi_squared_distribution()']]],
-  ['children_52',['children',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d',1,'data_structures::tree_234::Node::children'],['../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a08212cdc99164b59da91b81f45e2f88e',1,'data_structures::trie_using_hashmap::Trie::Node::children']]],
-  ['childs_53',['childs',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f',1,'data_structures::treap::Treap']]],
-  ['cin_54',['cin',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]],
-  ['ciphers_55',['Ciphers',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47',1,'']]],
-  ['ciphers_56',['ciphers',['../d6/d4e/namespaceciphers.html',1,'']]],
-  ['ciphers_3a_3aelliptic_5fcurve_5fkey_5fexchange_57',['elliptic_curve_key_exchange',['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html',1,'ciphers']]],
-  ['ciphers_5fuint128_5ft_5fhpp_5f_58',['CIPHERS_UINT128_T_HPP_',['../da/d41/uint128__t_8hpp.html#acce684d03a24f9c13a9ed36de6d24a57',1,'uint128_t.hpp']]],
-  ['ciphers_5fuint256_5ft_5fhpp_5f_59',['CIPHERS_UINT256_T_HPP_',['../da/da3/uint256__t_8hpp.html#a1d8c5ec5b5e419c5c8a740251485102c',1,'uint256_t.hpp']]],
-  ['circle_60',['circle',['../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903',1,'smallest_circle.cpp']]],
-  ['circle_5farea_61',['circle_area',['../dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75',1,'math']]],
-  ['circle_5fperimeter_62',['circle_perimeter',['../dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953',1,'math']]],
-  ['circular_5flinked_5flist_63',['circular_linked_list',['../d4/dcd/namespacecircular__linked__list.html',1,'']]],
-  ['circular_5flinked_5flist_2ecpp_64',['circular_linked_list.cpp',['../de/d33/circular__linked__list_8cpp.html',1,'']]],
-  ['circularlinkedlist_65',['CircularLinkedList',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a142fa439b102c6f86341f421ddcfe0a1',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList(const CircularLinkedList &amp;copy)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList(CircularLinkedList &amp;&amp;source) noexcept']]],
-  ['classic_66',['classic',['http://en.cppreference.com/w/cpp/locale/locale/classic.html',0,'std::locale']]],
-  ['clear_67',['clear',['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::fstream::clear()'],['http://en.cppreference.com/w/cpp/container/vector/clear.html',0,'std::vector::clear()'],['http://en.cppreference.com/w/cpp/container/multiset/clear.html',0,'std::multiset::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wostream::clear()'],['http://en.cppreference.com/w/cpp/container/set/clear.html',0,'std::set::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ostringstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_map/clear.html',0,'std::unordered_map::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ios::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_fstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::iostream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wistream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::stringstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/clear.html',0,'std::unordered_multimap::clear()'],['http://en.cppreference.com/w/cpp/container/forward_list/clear.html',0,'std::forward_list::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostream::clear()'],['http://en.cppreference.com/w/cpp/error/error_code/clear.html',0,'std::error_code::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wifstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_istream::clear()'],['http://en.cppreference.com/w/cpp/container/deque/clear.html',0,'std::deque::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::strstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_stringstream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::basic_string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wostringstream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::wstring::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istrstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/clear.html',0,'std::unordered_multiset::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ostream::clear()'],['http://en.cppreference.com/w/cpp/error/error_condition/clear.html',0,'std::error_condition::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::u16string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wiostream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::u32string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_istringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ifstream::clear()'],['http://en.cppreference.com/w/cpp/container/list/clear.html',0,'std::list::clear()'],['http://en.cppreference.com/w/cpp/container/map/clear.html',0,'std::map::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostrstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_set/clear.html',0,'std::unordered_set::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wfstream::clear()'],['http://en.cppreference.com/w/cpp/container/multimap/clear.html',0,'std::multimap::clear()'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/clear.html',0,'std::atomic_flag::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_iostream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wstringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wistringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ifstream::clear()'],['../db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375',1,'queue::clear()'],['../d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092',1,'stack::clear()']]],
-  ['clearerr_68',['clearerr',['http://en.cppreference.com/w/cpp/io/c/clearerr.html',0,'std']]],
-  ['cll_69',['cll',['../d5/d15/classcll.html',1,'']]],
-  ['clock_70',['clock',['http://en.cppreference.com/w/cpp/chrono/c/clock.html',0,'std']]],
-  ['clock_5ft_71',['clock_t',['http://en.cppreference.com/w/cpp/chrono/c/clock_t.html',0,'std']]],
-  ['clog_72',['clog',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]],
-  ['close_73',['close',['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::basic_ofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::fstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::basic_filebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::basic_fstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::wfilebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::wifstream::close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages_byname::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::filebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::ofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::basic_ifstream::close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::wfstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::wofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::ifstream::close()']]],
-  ['cmake_20in_20a_20new_20directory_74',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]],
-  ['cmatch_75',['cmatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std::cmatch'],['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::cmatch::cmatch()']]],
-  ['cnt_76',['cnt',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919',1,'data_structures::treap::Treap']]],
-  ['code_77',['Code',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md27',1,'']]],
-  ['code_78',['code',['http://en.cppreference.com/w/cpp/thread/future_error/code.html',0,'std::future_error::code()'],['http://en.cppreference.com/w/cpp/regex/regex_error/code.html',0,'std::regex_error::code()'],['http://en.cppreference.com/w/cpp/error/system_error/code.html',0,'std::system_error::code()']]],
-  ['code_20analyzer_79',['Static Code Analyzer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md38',1,'']]],
-  ['code_20formatter_80',['Code Formatter',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md39',1,'']]],
-  ['code_20of_20conduct_81',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]],
-  ['code_20style_20convention_82',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]],
-  ['code_20style_20conventions_83',['Code style conventions',['../dc/d64/md__coding_guidelines.html#autotoc_md20',1,'']]],
-  ['codec_84',['codec',['../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa',1,'ciphers::HillCipher']]],
-  ['codecvt_85',['codecvt',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt'],['http://en.cppreference.com/w/cpp/locale/codecvt/codecvt.html',0,'std::codecvt::codecvt()']]],
-  ['codecvt_5fbase_86',['codecvt_base',['http://en.cppreference.com/w/cpp/locale/codecvt_base.html',0,'std']]],
-  ['codecvt_5fbyname_87',['codecvt_byname',['http://en.cppreference.com/w/cpp/locale/codecvt_byname.html',0,'std::codecvt_byname'],['http://en.cppreference.com/w/cpp/locale/codecvt_byname.html',0,'std::codecvt_byname::codecvt_byname()']]],
-  ['codecvt_5futf16_88',['codecvt_utf16',['http://en.cppreference.com/w/cpp/locale/codecvt_utf16.html',0,'std']]],
-  ['codecvt_5futf8_89',['codecvt_utf8',['http://en.cppreference.com/w/cpp/locale/codecvt_utf8.html',0,'std']]],
-  ['codecvt_5futf8_5futf16_90',['codecvt_utf8_utf16',['http://en.cppreference.com/w/cpp/locale/codecvt_utf8_utf16.html',0,'std']]],
-  ['coin_5fchange_5ftopdown_2ecpp_91',['coin_change_topdown.cpp',['../d9/d31/coin__change__topdown_8cpp.html',1,'']]],
-  ['collate_92',['collate',['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate'],['http://en.cppreference.com/w/cpp/locale/collate/collate.html',0,'std::collate::collate()']]],
-  ['collate_5fbyname_93',['collate_byname',['http://en.cppreference.com/w/cpp/locale/collate_byname.html',0,'std::collate_byname'],['http://en.cppreference.com/w/cpp/locale/collate_byname.html',0,'std::collate_byname::collate_byname()']]],
-  ['comb_94',['comb',['../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841',1,'data_structures::SegmentTree']]],
-  ['comb_5fsort_2ecpp_95',['comb_sort.cpp',['../d9/dfd/comb__sort_8cpp.html',1,'']]],
-  ['combine_96',['combine',['http://en.cppreference.com/w/cpp/locale/locale/combine.html',0,'std::locale::combine()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74',1,'range_queries::heavy_light_decomposition::SG::combine()']]],
-  ['combsort_97',['CombSort',['../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f',1,'comb_sort.cpp']]],
-  ['commit_20guidelines_98',['Commit Guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35',1,'']]],
-  ['common_5ftype_99',['common_type',['http://en.cppreference.com/w/cpp/types/common_type.html',0,'std']]],
-  ['compare_100',['Compare',['../de/d4a/class_compare.html',1,'']]],
-  ['compare_101',['compare',['../d1/db3/structcompare.html',1,'compare'],['http://en.cppreference.com/w/cpp/string/char_traits/compare.html',0,'std::char_traits::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::string::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::wcsub_match::compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate_byname::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::wssub_match::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::csub_match::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::ssub_match::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::basic_string::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::wstring::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::u16string::compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::u32string::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::sub_match::compare()'],['../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c',1,'compare():&#160;shell_sort2.cpp']]],
-  ['compare_5fexchange_5fstrong_102',['compare_exchange_strong',['http://en.cppreference.com/w/cpp/atomic/atomic/compare_exchange.html',0,'std::atomic']]],
-  ['compare_5fexchange_5fweak_103',['compare_exchange_weak',['http://en.cppreference.com/w/cpp/atomic/atomic/compare_exchange.html',0,'std::atomic']]],
-  ['comparison_5foperator_104',['comparison_operator',['../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html',1,'machine_learning::aystar_search::AyStarSearch']]],
-  ['complex_105',['Complex',['../da/d5a/class_complex.html',1,'Complex'],['../da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867',1,'Complex::Complex(double x=0.f, double y=0.f, bool is_polar=false)'],['../da/d5a/class_complex.html#a466cd7b664cc6a864937ceb3dead1323',1,'Complex::Complex(const Complex &amp;other)']]],
-  ['complex_106',['complex',['http://en.cppreference.com/w/cpp/numeric/complex.html',0,'std::complex'],['http://en.cppreference.com/w/cpp/numeric/complex/complex.html',0,'std::complex::complex()']]],
-  ['complex_5fnumbers_2ecpp_107',['complex_numbers.cpp',['../d5/d67/complex__numbers_8cpp.html',1,'']]],
-  ['complex_5fstr_108',['complex_str',['../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c',1,'durand_kerner_roots.cpp']]],
-  ['composite_5fsimpson_5frule_2ecpp_109',['composite_simpson_rule.cpp',['../d4/d18/composite__simpson__rule_8cpp.html',1,'']]],
-  ['compute_5fpadded_5fsize_110',['compute_padded_size',['../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27',1,'hashing::sha256']]],
-  ['computefactorialsmod_111',['computeFactorialsMod',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#ab5744fa589f6a48f9fe7bca13dbe661f',1,'math::ncr_modulo_p::NCRModuloP']]],
-  ['concept_112',['Concept',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md81',1,'']]],
-  ['condition_5fvariable_113',['condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable.html',0,'std::condition_variable'],['http://en.cppreference.com/w/cpp/thread/condition_variable/condition_variable.html',0,'std::condition_variable::condition_variable()']]],
-  ['condition_5fvariable_5fany_114',['condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any.html',0,'std::condition_variable_any'],['http://en.cppreference.com/w/cpp/thread/condition_variable_any/condition_variable_any.html',0,'std::condition_variable_any::condition_variable_any()']]],
-  ['conditional_115',['conditional',['http://en.cppreference.com/w/cpp/types/conditional.html',0,'std']]],
-  ['conduct_116',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]],
-  ['cone_5fvolume_117',['cone_volume',['../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7',1,'math']]],
-  ['connected_5fcomponents_2ecpp_118',['connected_components.cpp',['../df/ddd/connected__components_8cpp.html',1,'']]],
-  ['connected_5fcomponents_5fwith_5fdsu_2ecpp_119',['connected_components_with_dsu.cpp',['../d8/d99/connected__components__with__dsu_8cpp.html',1,'']]],
-  ['conquer_120',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]],
-  ['const_5fpointer_5fcast_121',['const_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]],
-  ['constree_122',['ConsTree',['../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696',1,'segtree.cpp']]],
-  ['construct_123',['construct',['http://en.cppreference.com/w/cpp/memory/allocator_traits/construct.html',0,'std::allocator_traits::construct()'],['http://en.cppreference.com/w/cpp/memory/allocator/construct.html',0,'std::allocator::construct()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/construct.html',0,'std::scoped_allocator_adaptor::construct()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4',1,'range_queries::perSegTree::construct(const uint32_t &amp;i, const uint32_t &amp;j)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3',1,'range_queries::perSegTree::construct(const std::vector&lt; int64_t &gt; &amp;vec)']]],
-  ['contains_124',['Contains',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f',1,'data_structures::tree_234::Node']]],
-  ['contains_125',['contains',['../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2',1,'binary_search_tree::contains(std::unique_ptr&lt; bst_node &gt; &amp;node, T value)'],['../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63',1,'binary_search_tree::contains(T value)'],['../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac',1,'data_structures::Bitset::contains()'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b',1,'data_structures::BloomFilter::contains()']]],
-  ['contributing_126',['Contributing',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md23',1,'']]],
-  ['contributing_127',['Before contributing',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md22',1,'']]],
-  ['contribution_20guidelines_128',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]],
-  ['contributions_129',['Contributions',['../index.html#autotoc_md106',1,'']]],
-  ['contributor_130',['Contributor',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md25',1,'']]],
-  ['contributor_20covenant_20code_20of_20conduct_131',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]],
-  ['convention_132',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]],
-  ['conventions_133',['Code style conventions',['../dc/d64/md__coding_guidelines.html#autotoc_md20',1,'']]],
-  ['converted_134',['converted',['http://en.cppreference.com/w/cpp/locale/wstring_convert/converted.html',0,'std::wstring_convert']]],
-  ['convexhull_135',['Convexhull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html',1,'geometry::jarvis::Convexhull'],['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870',1,'geometry::jarvis::Convexhull::Convexhull()']]],
-  ['copy_136',['copy',['http://en.cppreference.com/w/cpp/string/char_traits/copy.html',0,'std::char_traits::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::basic_string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::wstring::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u16string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u32string::copy()'],['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std::copy()']]],
-  ['copy_5fall_5fnodes_137',['copy_all_nodes',['../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511',1,'data_structures::linked_list']]],
-  ['copy_5fbackward_138',['copy_backward',['http://en.cppreference.com/w/cpp/algorithm/copy_backward.html',0,'std']]],
-  ['copy_5fif_139',['copy_if',['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std']]],
-  ['copy_5fn_140',['copy_n',['http://en.cppreference.com/w/cpp/algorithm/copy_n.html',0,'std']]],
-  ['copyfmt_141',['copyfmt',['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ios::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::strstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wiostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wfstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wstringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ifstream::copyfmt()']]],
-  ['copysign_142',['copysign',['http://en.cppreference.com/w/cpp/numeric/math/copysign.html',0,'std']]],
-  ['correction_143',['1. Correction',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md11',1,'']]],
-  ['cos_144',['cos',['http://en.cppreference.com/w/cpp/numeric/math/cos.html',0,'std']]],
-  ['cosh_145',['cosh',['http://en.cppreference.com/w/cpp/numeric/math/cosh.html',0,'std']]],
-  ['count_146',['count',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921',1,'data_structures::tree_234::Node::count'],['http://en.cppreference.com/w/cpp/container/multiset/count.html',0,'std::multiset::count()'],['http://en.cppreference.com/w/cpp/container/set/count.html',0,'std::set::count()'],['http://en.cppreference.com/w/cpp/container/unordered_map/count.html',0,'std::unordered_map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/count.html',0,'std::unordered_multimap::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::minutes::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::seconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::duration::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::milliseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::hours::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::microseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::nanoseconds::count()'],['http://en.cppreference.com/w/cpp/utility/bitset/count.html',0,'std::bitset::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/count.html',0,'std::unordered_multiset::count()'],['http://en.cppreference.com/w/cpp/container/map/count.html',0,'std::map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/count.html',0,'std::unordered_set::count()'],['http://en.cppreference.com/w/cpp/container/multimap/count.html',0,'std::multimap::count()'],['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std::count()']]],
-  ['count_5fbits_5fflip_147',['count_bits_flip',['../d4/d38/namespacecount__bits__flip.html',1,'']]],
-  ['count_5fbits_5fflip_2ecpp_148',['count_bits_flip.cpp',['../d7/d56/count__bits__flip_8cpp.html',1,'']]],
-  ['count_5fif_149',['count_if',['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std']]],
-  ['count_5finversions_2ecpp_150',['count_inversions.cpp',['../d2/d26/count__inversions_8cpp.html',1,'']]],
-  ['count_5fof_5fset_5fbits_151',['count_of_set_bits',['../dd/dae/namespacecount__of__set__bits.html',1,'']]],
-  ['count_5fof_5fset_5fbits_2ecpp_152',['count_of_set_bits.cpp',['../da/db8/count__of__set__bits_8cpp.html',1,'']]],
-  ['count_5fof_5ftrailing_5fciphers_5fin_5ffactorial_5fn_153',['count_of_trailing_ciphers_in_factorial_n',['../dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html',1,'']]],
-  ['count_5fof_5ftrailing_5fciphers_5fin_5ffactorial_5fn_2ecpp_154',['count_of_trailing_ciphers_in_factorial_n.cpp',['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html',1,'']]],
-  ['countbitsflip_155',['countBitsFlip',['../d7/d56/count__bits__flip_8cpp.html#a2548486b6c3b80101e768562e687ef7b',1,'bit_manipulation::count_bits_flip']]],
-  ['countinversion_156',['countInversion',['../d2/d26/count__inversions_8cpp.html#a3332498eabf6579ef059c0d0e9f4ec80',1,'sorting::inversion']]],
-  ['countsetbits_157',['countSetBits',['../da/db8/count__of__set__bits_8cpp.html#a86c98dc299e4db28b73e08309d977e62',1,'bit_manipulation::count_of_set_bits']]],
-  ['cout_158',['cout',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]],
-  ['covenant_20code_20of_20conduct_159',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]],
-  ['cpu_20scheduling_20algorithms_160',['Cpu Scheduling Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48',1,'']]],
-  ['crbegin_161',['crbegin',['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::crbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::crbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::crbegin()'],['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::crbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::crbegin()'],['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::crbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::crbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::crbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::crbegin()']]],
-  ['create_5fhash_162',['create_hash',['../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8',1,'string_search']]],
-  ['create_5flist_163',['create_list',['../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5',1,'hash_search.cpp']]],
-  ['create_5fmatrix_164',['create_matrix',['../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d',1,'qr_eigen_values.cpp']]],
-  ['create_5fmessage_5fschedule_5farray_165',['create_message_schedule_array',['../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a',1,'hashing::sha256']]],
-  ['create_5frandom_5farray_166',['create_random_array',['../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49',1,'create_random_array(T *arr, int N):&#160;insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49',1,'create_random_array(T *arr, int N):&#160;insertion_sort_recursive.cpp']]],
-  ['createnewnode_167',['createNewNode',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6',1,'others::iterative_tree_traversals::BinaryTree::createNewNode()'],['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114',1,'others::recursive_tree_traversals::BT::createNewNode()']]],
-  ['createnode_168',['createNode',['../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6',1,'avltree.cpp']]],
-  ['createset_169',['CreateSet',['../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec',1,'disjoint_set.cpp']]],
-  ['cref_170',['cref',['http://en.cppreference.com/w/cpp/utility/functional/ref.html',0,'std']]],
-  ['cregex_5fiterator_171',['cregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::cregex_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::cregex_iterator::cregex_iterator()']]],
-  ['cregex_5ftoken_5fiterator_172',['cregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::cregex_token_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::cregex_token_iterator::cregex_token_iterator()']]],
-  ['crend_173',['crend',['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::crend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::crend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::crend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::crend()'],['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::crend()'],['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::crend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::crend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::crend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::crend()']]],
-  ['cross_174',['cross',['../df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9',1,'math::vector_cross']]],
-  ['csub_5fmatch_175',['csub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std::csub_match'],['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::csub_match::csub_match()']]],
-  ['ctime_176',['ctime',['http://en.cppreference.com/w/cpp/chrono/c/ctime.html',0,'std']]],
-  ['ctype_177',['ctype',['http://en.cppreference.com/w/cpp/locale/ctype.html',0,'std::ctype'],['http://en.cppreference.com/w/cpp/locale/ctype/ctype.html',0,'std::ctype::ctype()']]],
-  ['ctype_5fbase_178',['ctype_base',['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std']]],
-  ['ctype_5fbyname_179',['ctype_byname',['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname'],['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname::ctype_byname()']]],
-  ['cube_5fsurface_5farea_180',['cube_surface_area',['../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c',1,'math']]],
-  ['cube_5fsurface_5fperimeter_181',['cube_surface_perimeter',['../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b',1,'math']]],
-  ['cube_5fvolume_182',['cube_volume',['../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725',1,'math']]],
-  ['cumulative_5fdistribution_183',['cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a',1,'probability::geometric_dist::geometric_distribution']]],
-  ['curr_5fsymbol_184',['curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::curr_symbol()']]],
-  ['current_5fexception_185',['current_exception',['http://en.cppreference.com/w/cpp/error/current_exception.html',0,'std']]],
-  ['current_5fsize_186',['current_size',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b',1,'data_structures::stack_using_queue::Stack']]],
-  ['cut_5frod_187',['cut_rod',['../d8/d36/namespacecut__rod.html',1,'']]],
-  ['cut_5frod_2ecpp_188',['cut_rod.cpp',['../d6/d10/cut__rod_8cpp.html',1,'']]],
-  ['cycle_5fdetection_189',['cycle_detection',['../da/d82/namespacecycle__detection.html',1,'']]],
-  ['cycle_5fsort_190',['cycle_sort',['../d4/dfb/namespacecycle__sort.html',1,'']]],
-  ['cycle_5fsort_2ecpp_191',['cycle_sort.cpp',['../de/d07/cycle__sort_8cpp.html',1,'']]],
-  ['cyclecheck_192',['CycleCheck',['../d3/dbb/class_cycle_check.html',1,'']]],
-  ['cyclesort_193',['cycleSort',['../de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa',1,'sorting::cycle_sort']]],
-  ['cylinder_5fsurface_5farea_194',['cylinder_surface_area',['../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864',1,'math']]],
-  ['cylinder_5fsurface_5fperimeter_195',['cylinder_surface_perimeter',['../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73',1,'math']]],
-  ['cylinder_5fvolume_196',['cylinder_volume',['../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca',1,'math']]]
+  ['cache_1',['cache',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a3ee3560a6b90e6f50f6e063d690ba8e8',1,'others::lru_cache::LRUCache']]],
+  ['caesar_2',['caesar',['../dd/d81/namespacecaesar.html',1,'']]],
+  ['caesar_5fcipher_2ecpp_3',['caesar_cipher.cpp',['../d6/d2c/caesar__cipher_8cpp.html',1,'']]],
+  ['calculate_4',['calculate',['../d8/db1/binomial__calculate_8cpp.html#aae407a2a13362c4c64fbe509ff325978',1,'math::binomial']]],
+  ['can_5fjump_5',['can_jump',['../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502',1,'greedy_algorithms']]],
+  ['canimove_6',['CanIMove',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9',1,'backtracking::n_queens_optimized::CanIMove()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aea343d8a72a39c9a4c0fbcbc362f2648',1,'backtracking::n_queens_all_solutions::CanIMove()']]],
+  ['capacity_7',['capacity',['../d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02',1,'MinHeap::capacity'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c',1,'others::Cache::LFUCache::capacity()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a',1,'others::Cache::LRUCache::capacity()']]],
+  ['cardinality_20matching_8',['Maximum cardinality matching',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md79',1,'']]],
+  ['case_9',['Case',['../d8/d13/bubble__sort_8cpp.html#autotoc_md114',1,'Average Case'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md112',1,'Best Case'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)'],['../d8/d13/bubble__sort_8cpp.html#autotoc_md113',1,'Worst Case']]],
+  ['case_201_3a_20the_20given_20node_20has_20the_20right_20node_20subtree_10',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]],
+  ['case_202_3a_20the_20given_20node_20does_20not_20have_20a_20right_20node_20subtree_11',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]],
+  ['case_20average_20case_12',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]],
+  ['case_20worst_20case_20average_20case_13',['Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)',['../d8/d13/bubble__sort_8cpp.html#autotoc_md111',1,'']]],
+  ['catalan_5fnumbers_14',['catalan_numbers',['../dc/d1f/classcatalan__numbers.html',1,'']]],
+  ['catalan_5fnumbers_2ecpp_15',['catalan_numbers.cpp',['../de/dd9/catalan__numbers_8cpp.html',1,'']]],
+  ['chain_5fquery_16',['chain_query',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24',1,'range_queries::heavy_light_decomposition::HLD']]],
+  ['chaining_2ecpp_17',['chaining.cpp',['../d9/d92/chaining_8cpp.html',1,'']]],
+  ['change_18',['change',['../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579',1,'rungekutta.cpp']]],
+  ['change_5froot_19',['change_root',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0',1,'range_queries::heavy_light_decomposition::Tree']]],
+  ['changes_20',['Making Changes',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md26',1,'']]],
+  ['char_5fto_5fint_21',['char_to_int',['../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988',1,'data_structures::trie']]],
+  ['char_5fto_5fmorse_22',['char_to_morse',['../d8/d76/morse__code_8cpp.html#ab31773fd11555d21f70d6914138d9535',1,'ciphers::morse']]],
+  ['check_23',['check',['../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a',1,'dynamic_programming::word_break']]],
+  ['check_5fall_5fzeros_24',['check_all_zeros',['../d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a',1,'math::gcd_of_n_numbers']]],
+  ['check_5famicable_5fpair_2ecpp_25',['check_amicable_pair.cpp',['../d5/df6/check__amicable__pair_8cpp.html',1,'']]],
+  ['check_5ffactorial_2ecpp_26',['check_factorial.cpp',['../d8/dd5/check__factorial_8cpp.html',1,'']]],
+  ['check_5fif_5fequal_27',['check_if_equal',['../d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd',1,'string_search']]],
+  ['check_5fprime_2ecpp_28',['check_prime.cpp',['../db/d93/check__prime_8cpp.html',1,'']]],
+  ['check_5fsize_5fmatch_29',['check_size_match',['../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56',1,'machine_learning::adaline']]],
+  ['check_5ftermination_30',['check_termination',['../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377',1,'durand_kerner_roots.cpp']]],
+  ['checkbipartite_31',['checkBipartite',['../df/dce/namespacegraph.html#a8e1b547cd407c0774e63f0dc95cda9e7',1,'graph']]],
+  ['children_32',['children',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5d6b6ce5fab21ccc88c6bf3153eee5d',1,'data_structures::tree_234::Node::children'],['../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a08212cdc99164b59da91b81f45e2f88e',1,'data_structures::trie_using_hashmap::Trie::Node::children']]],
+  ['childs_33',['childs',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab99f68b79e1c4ff0f1cd6f2f0b6a545f',1,'data_structures::treap::Treap']]],
+  ['ciphers_34',['Ciphers',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md47',1,'']]],
+  ['ciphers_35',['ciphers',['../d6/d4e/namespaceciphers.html',1,'']]],
+  ['ciphers_3a_3aelliptic_5fcurve_5fkey_5fexchange_36',['elliptic_curve_key_exchange',['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html',1,'ciphers']]],
+  ['ciphers_5fuint128_5ft_5fhpp_5f_37',['CIPHERS_UINT128_T_HPP_',['../da/d41/uint128__t_8hpp.html#acce684d03a24f9c13a9ed36de6d24a57',1,'uint128_t.hpp']]],
+  ['ciphers_5fuint256_5ft_5fhpp_5f_38',['CIPHERS_UINT256_T_HPP_',['../da/da3/uint256__t_8hpp.html#a1d8c5ec5b5e419c5c8a740251485102c',1,'uint256_t.hpp']]],
+  ['circle_39',['circle',['../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903',1,'smallest_circle.cpp']]],
+  ['circle_5farea_40',['circle_area',['../dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75',1,'math']]],
+  ['circle_5fperimeter_41',['circle_perimeter',['../dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953',1,'math']]],
+  ['circular_5flinked_5flist_42',['circular_linked_list',['../d4/dcd/namespacecircular__linked__list.html',1,'']]],
+  ['circular_5flinked_5flist_2ecpp_43',['circular_linked_list.cpp',['../de/d33/circular__linked__list_8cpp.html',1,'']]],
+  ['circularlinkedlist_44',['CircularLinkedList',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a142fa439b102c6f86341f421ddcfe0a1',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList(const CircularLinkedList &amp;copy)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList(CircularLinkedList &amp;&amp;source) noexcept']]],
+  ['clear_45',['clear',['../db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375',1,'queue::clear()'],['../d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092',1,'stack::clear()']]],
+  ['cll_46',['cll',['../d5/d15/classcll.html',1,'']]],
+  ['cmake_20in_20a_20new_20directory_47',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]],
+  ['cnt_48',['cnt',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#af7e6c6620ab32bc96633d101245fa919',1,'data_structures::treap::Treap']]],
+  ['code_49',['Code',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md27',1,'']]],
+  ['code_20analyzer_50',['Static Code Analyzer',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md38',1,'']]],
+  ['code_20formatter_51',['Code Formatter',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md39',1,'']]],
+  ['code_20of_20conduct_52',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]],
+  ['code_20style_20convention_53',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]],
+  ['code_20style_20conventions_54',['Code style conventions',['../dc/d64/md__coding_guidelines.html#autotoc_md20',1,'']]],
+  ['codec_55',['codec',['../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa',1,'ciphers::HillCipher']]],
+  ['coin_5fchange_5ftopdown_2ecpp_56',['coin_change_topdown.cpp',['../d9/d31/coin__change__topdown_8cpp.html',1,'']]],
+  ['comb_57',['comb',['../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841',1,'data_structures::SegmentTree']]],
+  ['comb_5fsort_2ecpp_58',['comb_sort.cpp',['../d9/dfd/comb__sort_8cpp.html',1,'']]],
+  ['combine_59',['combine',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74',1,'range_queries::heavy_light_decomposition::SG']]],
+  ['combsort_60',['CombSort',['../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f',1,'comb_sort.cpp']]],
+  ['commit_20guidelines_61',['Commit Guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35',1,'']]],
+  ['compare_62',['Compare',['../de/d4a/class_compare.html',1,'']]],
+  ['compare_63',['compare',['../d1/db3/structcompare.html',1,'compare'],['../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c',1,'compare(const void *a, const void *b):&#160;shell_sort2.cpp']]],
+  ['comparison_5foperator_64',['comparison_operator',['../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html',1,'machine_learning::aystar_search::AyStarSearch']]],
+  ['complex_65',['Complex',['../da/d5a/class_complex.html',1,'Complex'],['../da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867',1,'Complex::Complex(double x=0.f, double y=0.f, bool is_polar=false)'],['../da/d5a/class_complex.html#a466cd7b664cc6a864937ceb3dead1323',1,'Complex::Complex(const Complex &amp;other)']]],
+  ['complex_5fnumbers_2ecpp_66',['complex_numbers.cpp',['../d5/d67/complex__numbers_8cpp.html',1,'']]],
+  ['complex_5fstr_67',['complex_str',['../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c',1,'durand_kerner_roots.cpp']]],
+  ['composite_5fsimpson_5frule_2ecpp_68',['composite_simpson_rule.cpp',['../d4/d18/composite__simpson__rule_8cpp.html',1,'']]],
+  ['compute_5fpadded_5fsize_69',['compute_padded_size',['../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27',1,'hashing::sha256']]],
+  ['computefactorialsmod_70',['computeFactorialsMod',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#ab5744fa589f6a48f9fe7bca13dbe661f',1,'math::ncr_modulo_p::NCRModuloP']]],
+  ['concept_71',['Concept',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md81',1,'']]],
+  ['conduct_72',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]],
+  ['cone_5fvolume_73',['cone_volume',['../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7',1,'math']]],
+  ['connected_5fcomponents_2ecpp_74',['connected_components.cpp',['../df/ddd/connected__components_8cpp.html',1,'']]],
+  ['connected_5fcomponents_5fwith_5fdsu_2ecpp_75',['connected_components_with_dsu.cpp',['../d8/d99/connected__components__with__dsu_8cpp.html',1,'']]],
+  ['conquer_76',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]],
+  ['constree_77',['ConsTree',['../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696',1,'segtree.cpp']]],
+  ['construct_78',['construct',['../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4',1,'range_queries::perSegTree::construct(const uint32_t &amp;i, const uint32_t &amp;j)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3',1,'range_queries::perSegTree::construct(const std::vector&lt; int64_t &gt; &amp;vec)']]],
+  ['contains_79',['Contains',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f',1,'data_structures::tree_234::Node']]],
+  ['contains_80',['contains',['../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2',1,'binary_search_tree::contains(std::unique_ptr&lt; bst_node &gt; &amp;node, T value)'],['../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63',1,'binary_search_tree::contains(T value)'],['../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac',1,'data_structures::Bitset::contains()'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b',1,'data_structures::BloomFilter::contains()']]],
+  ['contributing_81',['Contributing',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md23',1,'']]],
+  ['contributing_82',['Before contributing',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md22',1,'']]],
+  ['contribution_20guidelines_83',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]],
+  ['contributions_84',['Contributions',['../index.html#autotoc_md106',1,'']]],
+  ['contributor_85',['Contributor',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md25',1,'']]],
+  ['contributor_20covenant_20code_20of_20conduct_86',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]],
+  ['convention_87',['Code style convention',['../dc/d64/md__coding_guidelines.html',1,'']]],
+  ['conventions_88',['Code style conventions',['../dc/d64/md__coding_guidelines.html#autotoc_md20',1,'']]],
+  ['convexhull_89',['Convexhull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html',1,'geometry::jarvis::Convexhull'],['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870',1,'geometry::jarvis::Convexhull::Convexhull()']]],
+  ['copy_5fall_5fnodes_90',['copy_all_nodes',['../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511',1,'data_structures::linked_list']]],
+  ['correction_91',['1. Correction',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md11',1,'']]],
+  ['count_92',['count',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a934e6d53cfefae2b971e1241a8a4c921',1,'data_structures::tree_234::Node']]],
+  ['count_5fbits_5fflip_93',['count_bits_flip',['../d4/d38/namespacecount__bits__flip.html',1,'']]],
+  ['count_5fbits_5fflip_2ecpp_94',['count_bits_flip.cpp',['../d7/d56/count__bits__flip_8cpp.html',1,'']]],
+  ['count_5finversions_2ecpp_95',['count_inversions.cpp',['../d2/d26/count__inversions_8cpp.html',1,'']]],
+  ['count_5fof_5fset_5fbits_96',['count_of_set_bits',['../dd/dae/namespacecount__of__set__bits.html',1,'']]],
+  ['count_5fof_5fset_5fbits_2ecpp_97',['count_of_set_bits.cpp',['../da/db8/count__of__set__bits_8cpp.html',1,'']]],
+  ['count_5fof_5ftrailing_5fciphers_5fin_5ffactorial_5fn_98',['count_of_trailing_ciphers_in_factorial_n',['../dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html',1,'']]],
+  ['count_5fof_5ftrailing_5fciphers_5fin_5ffactorial_5fn_2ecpp_99',['count_of_trailing_ciphers_in_factorial_n.cpp',['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html',1,'']]],
+  ['countbitsflip_100',['countBitsFlip',['../d7/d56/count__bits__flip_8cpp.html#a2548486b6c3b80101e768562e687ef7b',1,'bit_manipulation::count_bits_flip']]],
+  ['countinversion_101',['countInversion',['../d2/d26/count__inversions_8cpp.html#a3332498eabf6579ef059c0d0e9f4ec80',1,'sorting::inversion']]],
+  ['countsetbits_102',['countSetBits',['../da/db8/count__of__set__bits_8cpp.html#a86c98dc299e4db28b73e08309d977e62',1,'bit_manipulation::count_of_set_bits']]],
+  ['covenant_20code_20of_20conduct_103',['Contributor Covenant Code of Conduct',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html',1,'']]],
+  ['cpu_20scheduling_20algorithms_104',['Cpu Scheduling Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md48',1,'']]],
+  ['create_5fhash_105',['create_hash',['../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8',1,'string_search']]],
+  ['create_5flist_106',['create_list',['../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5',1,'hash_search.cpp']]],
+  ['create_5fmatrix_107',['create_matrix',['../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d',1,'qr_eigen_values.cpp']]],
+  ['create_5fmessage_5fschedule_5farray_108',['create_message_schedule_array',['../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a',1,'hashing::sha256']]],
+  ['create_5frandom_5farray_109',['create_random_array',['../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49',1,'create_random_array(T *arr, int N):&#160;insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49',1,'create_random_array(T *arr, int N):&#160;insertion_sort_recursive.cpp']]],
+  ['createnewnode_110',['createNewNode',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6',1,'others::iterative_tree_traversals::BinaryTree::createNewNode()'],['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114',1,'others::recursive_tree_traversals::BT::createNewNode()']]],
+  ['createnode_111',['createNode',['../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6',1,'avltree.cpp']]],
+  ['createset_112',['CreateSet',['../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec',1,'disjoint_set.cpp']]],
+  ['cross_113',['cross',['../df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9',1,'math::vector_cross']]],
+  ['cube_5fsurface_5farea_114',['cube_surface_area',['../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c',1,'math']]],
+  ['cube_5fsurface_5fperimeter_115',['cube_surface_perimeter',['../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b',1,'math']]],
+  ['cube_5fvolume_116',['cube_volume',['../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725',1,'math']]],
+  ['cumulative_5fdistribution_117',['cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a',1,'probability::geometric_dist::geometric_distribution']]],
+  ['current_5fsize_118',['current_size',['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#afdfd2f4418c70b1bda50f2c3e416d80b',1,'data_structures::stack_using_queue::Stack']]],
+  ['cut_5frod_119',['cut_rod',['../d8/d36/namespacecut__rod.html',1,'']]],
+  ['cut_5frod_2ecpp_120',['cut_rod.cpp',['../d6/d10/cut__rod_8cpp.html',1,'']]],
+  ['cycle_5fdetection_121',['cycle_detection',['../da/d82/namespacecycle__detection.html',1,'']]],
+  ['cycle_5fsort_122',['cycle_sort',['../d4/dfb/namespacecycle__sort.html',1,'']]],
+  ['cycle_5fsort_2ecpp_123',['cycle_sort.cpp',['../de/d07/cycle__sort_8cpp.html',1,'']]],
+  ['cyclecheck_124',['CycleCheck',['../d3/dbb/class_cycle_check.html',1,'']]],
+  ['cyclesort_125',['cycleSort',['../de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa',1,'sorting::cycle_sort']]],
+  ['cylinder_5fsurface_5farea_126',['cylinder_surface_area',['../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864',1,'math']]],
+  ['cylinder_5fsurface_5fperimeter_127',['cylinder_surface_perimeter',['../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73',1,'math']]],
+  ['cylinder_5fvolume_128',['cylinder_volume',['../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca',1,'math']]]
 ];
diff --git a/search/all_9.js b/search/all_9.js
index a4e5574ae..616c00d9e 100644
--- a/search/all_9.js
+++ b/search/all_9.js
@@ -2,162 +2,93 @@ var searchData=
 [
   ['d_5fnode_0',['D_Node',['../de/d21/classothers_1_1_cache_1_1_d___node.html',1,'others::Cache']]],
   ['d_5fnode_3c_20k_2c_20v_20_3e_1',['D_Node&lt; K, V &gt;',['../de/d21/classothers_1_1_cache_1_1_d___node.html',1,'others::Cache']]],
-  ['data_2',['data',['../d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73',1,'data_structures::Bitset::data'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1',1,'operations_on_datastructures::circular_linked_list::Node::data'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2',1,'operations_on_datastructures::inorder_traversal_of_bst::Node::data'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f',1,'operations_on_datastructures::reverse_binary_tree::Node::data'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f',1,'others::iterative_tree_traversals::Node::data'],['../de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75',1,'others::Cache::D_Node::data'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade',1,'others::recursive_tree_traversals::Node::data'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b',1,'search::sublist_search::Node::data'],['http://en.cppreference.com/w/cpp/container/dynarray/data.html',0,'std::dynarray::data()'],['http://en.cppreference.com/w/cpp/container/vector/data.html',0,'std::vector::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::basic_string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::wstring::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u16string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u32string::data()'],['http://en.cppreference.com/w/cpp/container/array/data.html',0,'std::array::data()'],['../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243',1,'data:&#160;hash_search.cpp']]],
+  ['data_2',['data',['../d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73',1,'data_structures::Bitset::data'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1',1,'operations_on_datastructures::circular_linked_list::Node::data'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2',1,'operations_on_datastructures::inorder_traversal_of_bst::Node::data'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f',1,'operations_on_datastructures::reverse_binary_tree::Node::data'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f',1,'others::iterative_tree_traversals::Node::data'],['../de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75',1,'others::Cache::D_Node::data'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade',1,'others::recursive_tree_traversals::Node::data'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b',1,'search::sublist_search::Node::data'],['../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243',1,'data:&#160;hash_search.cpp']]],
   ['data_20structure_20used_3',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md98',1,'']]],
   ['data_20structures_4',['Data Structures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49',1,'']]],
   ['data_5fstructures_5',['data_structures',['../d5/d3c/namespacedata__structures.html',1,'']]],
   ['data_5fstructures_3a_3atreap_6',['treap',['../dd/d2e/namespacedata__structures_1_1treap.html',1,'data_structures']]],
   ['datastructures_7',['Operations On Datastructures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md61',1,'']]],
-  ['date_5forder_8',['date_order',['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get::date_order()'],['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get_byname::date_order()']]],
-  ['day_9',['day',['../d1/df6/class_easter_year_month_day.html#ade0b934e5b1af24e19ff959673b2ec51',1,'EasterYearMonthDay']]],
-  ['deallocate_10',['deallocate',['http://en.cppreference.com/w/cpp/memory/allocator_traits/deallocate.html',0,'std::allocator_traits::deallocate()'],['http://en.cppreference.com/w/cpp/memory/allocator/deallocate.html',0,'std::allocator::deallocate()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/deallocate.html',0,'std::scoped_allocator_adaptor::deallocate()'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589',1,'operations_on_datastructures::inorder_traversal_of_bst::deallocate()']]],
-  ['dec_11',['dec',['http://en.cppreference.com/w/cpp/io/manip/hex.html',0,'std']]],
-  ['deca_12',['deca',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['decay_13',['decay',['http://en.cppreference.com/w/cpp/types/decay.html',0,'std']]],
-  ['deci_14',['deci',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['decimal_5fpoint_15',['decimal_point',['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct_byname::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct_byname::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct::decimal_point()']]],
-  ['decimal_5fto_5fbinary_2ecpp_16',['decimal_to_binary.cpp',['../df/d06/decimal__to__binary_8cpp.html',1,'']]],
-  ['decimal_5fto_5fhexadecimal_2ecpp_17',['decimal_to_hexadecimal.cpp',['../da/de7/decimal__to__hexadecimal_8cpp.html',1,'']]],
-  ['decimal_5fto_5froman_5fnumeral_2ecpp_18',['decimal_to_roman_numeral.cpp',['../de/d85/decimal__to__roman__numeral_8cpp.html',1,'']]],
-  ['declare_5fno_5fpointers_19',['declare_no_pointers',['http://en.cppreference.com/w/cpp/memory/gc/declare_no_pointers.html',0,'std']]],
-  ['declare_5freachable_20',['declare_reachable',['http://en.cppreference.com/w/cpp/memory/gc/declare_reachable.html',0,'std']]],
-  ['declval_21',['declval',['http://en.cppreference.com/w/cpp/utility/declval.html',0,'std']]],
-  ['decreasekey_22',['decreaseKey',['../d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5',1,'MinHeap']]],
-  ['decrypt_23',['decrypt',['../de/db6/a1z26__cipher_8cpp.html#a0a78954e96c862430904ee3e64623c38',1,'ciphers::a1z26::decrypt()'],['../d6/d2c/caesar__cipher_8cpp.html#a355e69511cd2006b5c4c80ae95b71056',1,'ciphers::caesar::decrypt()'],['../d8/d76/morse__code_8cpp.html#a15c66ec8cf4cef0a35c50cbab86965dc',1,'ciphers::morse::decrypt()'],['../dd/d12/vigenere__cipher_8cpp.html#a3cfc3f9b20a0f230a2fcefd31dc6848e',1,'ciphers::vigenere::decrypt()'],['../d3/d4c/xor__cipher_8cpp.html#a6099b7e0f1793f418d2c1befca8355a4',1,'ciphers::XOR::decrypt()']]],
-  ['decrypt_5ftext_24',['decrypt_text',['../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b',1,'ciphers::HillCipher']]],
-  ['default_5fdelete_25',['default_delete',['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete'],['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete::default_delete()']]],
-  ['default_5ferror_5fcondition_26',['default_error_condition',['http://en.cppreference.com/w/cpp/error/error_code/default_error_condition.html',0,'std::error_code::default_error_condition()'],['http://en.cppreference.com/w/cpp/error/error_category/default_error_condition.html',0,'std::error_category::default_error_condition()']]],
-  ['default_5frandom_5fengine_27',['default_random_engine',['http://en.cppreference.com/w/cpp/numeric/random.html',0,'std']]],
-  ['defaultfloat_28',['defaultfloat',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]],
-  ['defer_5flock_5ft_29',['defer_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]],
-  ['degrees_5fto_5fradians_30',['degrees_to_radians',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c',1,'physics::ground_to_ground_projectile_motion']]],
-  ['delete_31',['Delete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aefd24626ac47277431c9b8604e064340',1,'operations_on_datastructures::trie_operations::Tnode']]],
-  ['delete_5fall_5fnodes_32',['delete_all_nodes',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac614ed8f1953f5486fab1cd6d7aa0500',1,'data_structures::linked_list::list']]],
-  ['delete_5fword_33',['delete_word',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75',1,'data_structures::trie_using_hashmap::Trie']]],
-  ['deleteallnodes_34',['deleteAllNodes',['../d8/dee/avltree_8cpp.html#a82659e9e223e520cf91d7e55c4a3f88c',1,'avltree.cpp']]],
-  ['deleteelement_35',['deleteElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0',1,'data_structures::SkipList']]],
-  ['deletefrom_36',['DeleteFrom',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169',1,'operations_on_datastructures::trie_operations::Tnode']]],
-  ['deletekey_37',['deleteKey',['../d2/d05/class_min_heap.html#a37ac126eabb0c3ce04047172abccca29',1,'MinHeap']]],
-  ['deletenode_38',['DeleteNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a273511e84a5243ffffe81be28bd24855',1,'data_structures::tree_234::Tree234']]],
-  ['deletenode_39',['deleteNode',['../d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5',1,'avltree.cpp']]],
-  ['deletestring_40',['deleteString',['../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab',1,'data_structures::trie']]],
-  ['denorm_5fmin_41',['denorm_min',['http://en.cppreference.com/w/cpp/types/numeric_limits/denorm_min.html',0,'std::numeric_limits']]],
-  ['denselayer_42',['DenseLayer',['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html',1,'machine_learning::neural_network::layers::DenseLayer'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a11046825be0b6dbb73fbe834aa49200e',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &amp;neurons, const std::string &amp;activation, const std::pair&lt; size_t, size_t &gt; &amp;kernel_shape, const bool &amp;random_kernel)'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#af136ec31dbd35b1be2eb9a057677c704',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &amp;neurons, const std::string &amp;activation, const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;kernel)'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const DenseLayer &amp;layer)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6c859e3737aa88b29854df0347b29f4e',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(DenseLayer &amp;&amp;)=default']]],
-  ['densities_43',['densities',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/params.html',0,'std::piecewise_constant_distribution::densities()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/params.html',0,'std::piecewise_linear_distribution::densities()']]],
-  ['depth_44',['depth',['../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429',1,'dsu::depth'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d',1,'machine_learning::aystar_search::AyStarSearch::Info::depth']]],
-  ['depth_5ffirst_5fsearch_45',['depth_first_search',['../d8/da7/namespacedepth__first__search.html',1,'depth_first_search'],['../df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae',1,'graph::depth_first_search()']]],
-  ['depth_5ffirst_5fsearch_2ecpp_46',['depth_first_search.cpp',['../da/d8d/depth__first__search_8cpp.html',1,'']]],
-  ['depth_5ffirst_5fsearch_5fwith_5fstack_2ecpp_47',['depth_first_search_with_stack.cpp',['../da/d4b/depth__first__search__with__stack_8cpp.html',1,'']]],
-  ['deque_48',['deque',['http://en.cppreference.com/w/cpp/container/deque.html',0,'std::deque&lt; T &gt;'],['http://en.cppreference.com/w/cpp/container/deque/deque.html',0,'std::deque::deque()']]],
-  ['dequeue_49',['deQueue',['../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85',1,'queue']]],
-  ['dequeue_50',['dequeue',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622',1,'data_structures::queue_using_array::Queue_Array']]],
-  ['destroy_51',['destroy',['http://en.cppreference.com/w/cpp/memory/allocator_traits/destroy.html',0,'std::allocator_traits::destroy()'],['http://en.cppreference.com/w/cpp/memory/allocator/destroy.html',0,'std::allocator::destroy()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/destroy.html',0,'std::scoped_allocator_adaptor::destroy()']]],
-  ['detach_52',['detach',['http://en.cppreference.com/w/cpp/thread/thread/detach.html',0,'std::thread']]],
-  ['determinant_5flu_53',['determinant_lu',['../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f',1,'lu_decomposition.h']]],
-  ['dfs_54',['dfs',['../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0',1,'graph::HKGraph::dfs()'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9',1,'graph::depth_first_search::dfs()'],['../d8/db9/topological__sort_8cpp.html#abcbcaa2bb70af0a11d0c090ea1796aea',1,'graph::topological_sort::dfs()']]],
-  ['dfs_5fhc_55',['dfs_hc',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8',1,'range_queries::heavy_light_decomposition::HLD']]],
-  ['dfs_5flabels_56',['dfs_labels',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8',1,'range_queries::heavy_light_decomposition::HLD']]],
-  ['dfs_5flca_57',['dfs_lca',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4',1,'range_queries::heavy_light_decomposition::Tree']]],
-  ['dfs_5fpar_58',['dfs_par',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a',1,'range_queries::heavy_light_decomposition::HLD']]],
-  ['dfs_5fsize_59',['dfs_size',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460',1,'range_queries::heavy_light_decomposition::Tree']]],
-  ['differential_20equations_60',['Ordinary Differential Equations',['../d6/d60/group__ode.html',1,'']]],
-  ['difftime_61',['difftime',['http://en.cppreference.com/w/cpp/chrono/c/difftime.html',0,'std']]],
-  ['digit_5fchar_62',['digit_char',['../db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac',1,'large_number']]],
-  ['digit_5fseparation_2ecpp_63',['digit_separation.cpp',['../d3/d36/digit__separation_8cpp.html',1,'']]],
-  ['digitseparation_64',['DigitSeparation',['../da/d49/classgreedy__algorithms_1_1_digit_separation.html',1,'greedy_algorithms::DigitSeparation'],['../da/d49/classgreedy__algorithms_1_1_digit_separation.html#afd54c969a6c9bab16b4a064fbc8ed40e',1,'greedy_algorithms::DigitSeparation::DigitSeparation()']]],
-  ['digitseparationforwardorder_65',['digitSeparationForwardOrder',['../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8',1,'greedy_algorithms::DigitSeparation']]],
-  ['digitseparationreverseorder_66',['digitSeparationReverseOrder',['../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79',1,'greedy_algorithms::DigitSeparation']]],
-  ['dijkstra_67',['dijkstra',['../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84',1,'graph::dijkstra()'],['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af915876d0ca33cc71a6a6191a8cd3ccd',1,'greedy_algorithms::dijkstra::dijkstra()']]],
-  ['dijkstra_2ecpp_68',['dijkstra.cpp',['../d8/d68/dijkstra_8cpp.html',1,'']]],
-  ['dijkstra_5fgreedy_2ecpp_69',['dijkstra_greedy.cpp',['../da/de8/dijkstra__greedy_8cpp.html',1,'']]],
-  ['direction_70',['direction',['../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655',1,'SegmentIntersection']]],
-  ['directory_71',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]],
-  ['directory_20guidelines_72',['Directory guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33',1,'']]],
-  ['discard_73',['discard',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937_64::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux24_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux48::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::discard_block_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mersenne_twister_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/discard.html',0,'std::independent_bits_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux48_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::shuffle_order_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux24::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::linear_congruential_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::knuth_b::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand0::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::subtract_with_carry_engine::discard()']]],
-  ['discard_5fblock_5fengine_74',['discard_block_engine',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std::discard_block_engine'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::discard_block_engine::discard_block_engine()']]],
-  ['discrete_5fdistribution_75',['discrete_distribution',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution.html',0,'std::discrete_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/discrete_distribution.html',0,'std::discrete_distribution::discrete_distribution()']]],
-  ['disjoint_5fset_2ecpp_76',['disjoint_set.cpp',['../de/d23/disjoint__set_8cpp.html',1,'']]],
-  ['disjoint_5funion_77',['disjoint_union',['../de/db4/namespacedisjoint__union.html',1,'']]],
-  ['display_78',['display',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a1313837c0e9ec67fd9fbd17987e2d615',1,'data_structures::linked_list::list::display()'],['../db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368',1,'queue::display()'],['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631',1,'data_structures::queue_using_array::Queue_Array::display()'],['../d1/dc2/classstack.html#a8bce109630118a34faae717f72986033',1,'stack::display()'],['../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed',1,'hash_chain::display()'],['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53',1,'others::lru_cache::LRUCache::display()'],['../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd',1,'double_hashing::display()'],['../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635',1,'linear_probing::display()'],['../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357',1,'quadratic_probing::display()'],['../d5/d33/gram__schmidt_8cpp.html#ae6b496dce691e04f7f95ba0f0d33a289',1,'numerical_methods::gram_schmidt::display()']]],
-  ['displayelements_79',['displayElements',['../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72',1,'wiggle_sort.cpp']]],
-  ['displaylist_80',['displayList',['../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c',1,'data_structures::SkipList']]],
-  ['dist_81',['dist',['../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a',1,'graph::HKGraph']]],
-  ['distance_82',['distance',['http://en.cppreference.com/w/cpp/iterator/distance.html',0,'std']]],
-  ['div_83',['div',['http://en.cppreference.com/w/cpp/numeric/math/div.html',0,'std']]],
-  ['divide_84',['divide',['../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c',1,'uint128_t::divide()'],['../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1',1,'uint256_t::divide()']]],
-  ['divide_20and_20conquer_85',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]],
-  ['divide_5fand_5fconquer_86',['divide_and_conquer',['../dd/dba/namespacedivide__and__conquer.html',1,'']]],
-  ['divides_87',['divides',['http://en.cppreference.com/w/cpp/utility/functional/divides.html',0,'std']]],
-  ['dnf_5fsort_88',['dnf_sort',['../d9/d75/namespacednf__sort.html',1,'']]],
-  ['dnf_5fsort_2ecpp_89',['dnf_sort.cpp',['../d6/d1a/dnf__sort_8cpp.html',1,'']]],
-  ['dnfsort_90',['dnfSort',['../d6/d1a/dnf__sort_8cpp.html#a621767fe711db64fe57a2ac4987b11f0',1,'sorting::dnf_sort']]],
-  ['do_5falways_5fnoconv_91',['do_always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::do_always_noconv()']]],
-  ['do_5fclose_92',['do_close',['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages_byname::do_close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages::do_close()']]],
-  ['do_5fcompare_93',['do_compare',['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate_byname::do_compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate::do_compare()']]],
-  ['do_5fcurr_5fsymbol_94',['do_curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::do_curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::do_curr_symbol()']]],
-  ['do_5fdate_5forder_95',['do_date_order',['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get::do_date_order()'],['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get_byname::do_date_order()']]],
-  ['do_5fdecimal_5fpoint_96',['do_decimal_point',['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct_byname::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct_byname::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct::do_decimal_point()']]],
-  ['do_5fencoding_97',['do_encoding',['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_byname::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8_utf16::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf16::do_encoding()']]],
-  ['do_5ffalsename_98',['do_falsename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_falsename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_falsename()']]],
-  ['do_5ffrac_5fdigits_99',['do_frac_digits',['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct_byname::do_frac_digits()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct::do_frac_digits()']]],
-  ['do_5fget_100',['do_get',['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::do_get()']]],
-  ['do_5fget_5fdate_101',['do_get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::do_get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::do_get_date()']]],
-  ['do_5fget_5fmonthname_102',['do_get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::do_get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::do_get_monthname()']]],
-  ['do_5fget_5ftime_103',['do_get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::do_get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::do_get_time()']]],
-  ['do_5fget_5fweekday_104',['do_get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::do_get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::do_get_weekday()']]],
-  ['do_5fget_5fyear_105',['do_get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::do_get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::do_get_year()']]],
-  ['do_5fgrouping_106',['do_grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::do_grouping()']]],
-  ['do_5fhash_107',['do_hash',['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate_byname::do_hash()'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate::do_hash()']]],
-  ['do_5fin_108',['do_in',['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_byname::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8_utf16::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf16::do_in()']]],
-  ['do_5fis_109',['do_is',['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype_byname::do_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype::do_is()']]],
-  ['do_5flength_110',['do_length',['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_byname::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8_utf16::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf16::do_length()']]],
-  ['do_5fmax_5flength_111',['do_max_length',['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_byname::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8_utf16::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf16::do_max_length()']]],
-  ['do_5fnarrow_112',['do_narrow',['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype_byname::do_narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype::do_narrow()']]],
-  ['do_5fneg_5fformat_113',['do_neg_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_neg_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_neg_format()']]],
-  ['do_5fnegative_5fsign_114',['do_negative_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_negative_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_negative_sign()']]],
-  ['do_5fopen_115',['do_open',['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages_byname::do_open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages::do_open()']]],
-  ['do_5fout_116',['do_out',['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_byname::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8_utf16::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf16::do_out()']]],
-  ['do_5fpos_5fformat_117',['do_pos_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_pos_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_pos_format()']]],
-  ['do_5fpositive_5fsign_118',['do_positive_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_positive_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_positive_sign()']]],
-  ['do_5fput_119',['do_put',['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put_byname::do_put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/num_put/put.html',0,'std::num_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/money_put/put.html',0,'std::money_put::do_put()']]],
-  ['do_5fscan_5fis_120',['do_scan_is',['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype_byname::do_scan_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype::do_scan_is()']]],
-  ['do_5fthousands_5fsep_121',['do_thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::do_thousands_sep()']]],
-  ['do_5ftolower_122',['do_tolower',['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype_byname::do_tolower()'],['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype::do_tolower()']]],
-  ['do_5ftoupper_123',['do_toupper',['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype_byname::do_toupper()'],['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype::do_toupper()']]],
-  ['do_5ftransform_124',['do_transform',['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate_byname::do_transform()'],['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate::do_transform()']]],
-  ['do_5ftruename_125',['do_truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_truename()']]],
-  ['do_5funshift_126',['do_unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::do_unshift()']]],
-  ['do_5fwiden_127',['do_widen',['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype_byname::do_widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype::do_widen()']]],
-  ['documentation_128',['Documentation',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28',1,'Documentation'],['../index.html#autotoc_md105',1,'Documentation']]],
-  ['does_20not_20have_20a_20right_20node_20subtree_129',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]],
-  ['domain_5ferror_130',['domain_error',['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std::domain_error'],['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std::domain_error::domain_error()']]],
-  ['dot_5fproduct_131',['dot_product',['../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d',1,'numerical_methods::gram_schmidt']]],
-  ['double_5ffactorial_2ecpp_132',['double_factorial.cpp',['../d7/d89/double__factorial_8cpp.html',1,'']]],
-  ['double_5ffactorial_5fiterative_133',['double_factorial_iterative',['../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26',1,'double_factorial.cpp']]],
-  ['double_5ffactorial_5frecursive_134',['double_factorial_recursive',['../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d',1,'double_factorial.cpp']]],
-  ['double_5fhash_5fhash_5ftable_2ecpp_135',['double_hash_hash_table.cpp',['../d6/d80/double__hash__hash__table_8cpp.html',1,'']]],
-  ['double_5fhashing_136',['double_hashing',['../d0/d65/namespacedouble__hashing.html',1,'']]],
-  ['double_5flinked_5flist_137',['double_linked_list',['../d9/dee/classdouble__linked__list.html',1,'']]],
-  ['doublehash_138',['doubleHash',['../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200',1,'double_hashing']]],
-  ['dp_139',['dp',['../df/d88/namespacedp.html',1,'']]],
-  ['dptable_140',['dpTable',['../dc/d14/wildcard__matching_8cpp.html#a4a5b107f93db24e424b12899fa692c5a',1,'backtracking::wildcard_matching']]],
-  ['draw_5fsample_141',['draw_sample',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3',1,'probability::geometric_dist::geometric_distribution']]],
-  ['drelu_142',['drelu',['../d2/d58/neural__network_8cpp.html#aa69e95a34054d7989bf446f96b2ffaf9',1,'machine_learning::neural_network::activations']]],
-  ['dsigmoid_143',['dsigmoid',['../d2/d58/neural__network_8cpp.html#a76eb66212d577f948a457b6e29d87c46',1,'machine_learning::neural_network::activations']]],
-  ['dsu_144',['dsu',['../dd/d1f/classdsu.html',1,'dsu'],['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)'],['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)']]],
-  ['dsu_5fpath_5fcompression_2ecpp_145',['dsu_path_compression.cpp',['../d3/dae/dsu__path__compression_8cpp.html',1,'']]],
-  ['dsu_5funion_5frank_2ecpp_146',['dsu_union_rank.cpp',['../df/d28/dsu__union__rank_8cpp.html',1,'']]],
-  ['dtanh_147',['dtanh',['../d2/d58/neural__network_8cpp.html#a2a5e874b9774aa5362dbcf288828b95c',1,'machine_learning::neural_network::activations']]],
-  ['duplicatenumber_148',['duplicateNumber',['../db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88',1,'search::cycle_detection']]],
-  ['durand_5fkerner_5falgo_149',['durand_kerner_algo',['../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd',1,'durand_kerner_roots.cpp']]],
-  ['durand_5fkerner_5froots_2ecpp_150',['durand_kerner_roots.cpp',['../da/df2/durand__kerner__roots_8cpp.html',1,'']]],
-  ['duration_151',['duration',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::duration'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::duration::duration()']]],
-  ['duration_5fcast_152',['duration_cast',['http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html',0,'std::chrono']]],
-  ['duration_5fvalues_153',['duration_values',['http://en.cppreference.com/w/cpp/chrono/duration_values.html',0,'std::chrono']]],
-  ['duval_154',['duval',['../d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632',1,'string']]],
-  ['duval_2ecpp_155',['duval.cpp',['../db/d09/duval_8cpp.html',1,'']]],
-  ['dynamic_20programming_156',['Dynamic Programming',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51',1,'']]],
-  ['dynamic_5fpointer_5fcast_157',['dynamic_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]],
-  ['dynamic_5fprogramming_158',['dynamic_programming',['../dd/d24/namespacedynamic__programming.html',1,'']]],
-  ['dynarray_159',['dynarray',['http://en.cppreference.com/w/cpp/container/dynarray.html',0,'std::dynarray'],['http://en.cppreference.com/w/cpp/container/dynarray/dynarray.html',0,'std::dynarray::dynarray()']]]
+  ['day_8',['day',['../d1/df6/class_easter_year_month_day.html#ade0b934e5b1af24e19ff959673b2ec51',1,'EasterYearMonthDay']]],
+  ['deallocate_9',['deallocate',['../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
+  ['decimal_5fto_5fbinary_2ecpp_10',['decimal_to_binary.cpp',['../df/d06/decimal__to__binary_8cpp.html',1,'']]],
+  ['decimal_5fto_5fhexadecimal_2ecpp_11',['decimal_to_hexadecimal.cpp',['../da/de7/decimal__to__hexadecimal_8cpp.html',1,'']]],
+  ['decimal_5fto_5froman_5fnumeral_2ecpp_12',['decimal_to_roman_numeral.cpp',['../de/d85/decimal__to__roman__numeral_8cpp.html',1,'']]],
+  ['decreasekey_13',['decreaseKey',['../d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5',1,'MinHeap']]],
+  ['decrypt_14',['decrypt',['../de/db6/a1z26__cipher_8cpp.html#a0a78954e96c862430904ee3e64623c38',1,'ciphers::a1z26::decrypt()'],['../d6/d2c/caesar__cipher_8cpp.html#a355e69511cd2006b5c4c80ae95b71056',1,'ciphers::caesar::decrypt()'],['../d8/d76/morse__code_8cpp.html#a15c66ec8cf4cef0a35c50cbab86965dc',1,'ciphers::morse::decrypt()'],['../dd/d12/vigenere__cipher_8cpp.html#a3cfc3f9b20a0f230a2fcefd31dc6848e',1,'ciphers::vigenere::decrypt()'],['../d3/d4c/xor__cipher_8cpp.html#a6099b7e0f1793f418d2c1befca8355a4',1,'ciphers::XOR::decrypt()']]],
+  ['decrypt_5ftext_15',['decrypt_text',['../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b',1,'ciphers::HillCipher']]],
+  ['degrees_5fto_5fradians_16',['degrees_to_radians',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c',1,'physics::ground_to_ground_projectile_motion']]],
+  ['delete_17',['Delete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aefd24626ac47277431c9b8604e064340',1,'operations_on_datastructures::trie_operations::Tnode']]],
+  ['delete_5fall_5fnodes_18',['delete_all_nodes',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac614ed8f1953f5486fab1cd6d7aa0500',1,'data_structures::linked_list::list']]],
+  ['delete_5fword_19',['delete_word',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75',1,'data_structures::trie_using_hashmap::Trie']]],
+  ['deleteallnodes_20',['deleteAllNodes',['../d8/dee/avltree_8cpp.html#a82659e9e223e520cf91d7e55c4a3f88c',1,'avltree.cpp']]],
+  ['deleteelement_21',['deleteElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0',1,'data_structures::SkipList']]],
+  ['deletefrom_22',['DeleteFrom',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169',1,'operations_on_datastructures::trie_operations::Tnode']]],
+  ['deletekey_23',['deleteKey',['../d2/d05/class_min_heap.html#a37ac126eabb0c3ce04047172abccca29',1,'MinHeap']]],
+  ['deletenode_24',['DeleteNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a273511e84a5243ffffe81be28bd24855',1,'data_structures::tree_234::Tree234']]],
+  ['deletenode_25',['deleteNode',['../d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5',1,'avltree.cpp']]],
+  ['deletestring_26',['deleteString',['../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab',1,'data_structures::trie']]],
+  ['denselayer_27',['DenseLayer',['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html',1,'machine_learning::neural_network::layers::DenseLayer'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a11046825be0b6dbb73fbe834aa49200e',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &amp;neurons, const std::string &amp;activation, const std::pair&lt; size_t, size_t &gt; &amp;kernel_shape, const bool &amp;random_kernel)'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#af136ec31dbd35b1be2eb9a057677c704',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &amp;neurons, const std::string &amp;activation, const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;kernel)'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const DenseLayer &amp;layer)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6c859e3737aa88b29854df0347b29f4e',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(DenseLayer &amp;&amp;)=default']]],
+  ['depth_28',['depth',['../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429',1,'dsu::depth'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d',1,'machine_learning::aystar_search::AyStarSearch::Info::depth']]],
+  ['depth_5ffirst_5fsearch_29',['depth_first_search',['../d8/da7/namespacedepth__first__search.html',1,'depth_first_search'],['../df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae',1,'graph::depth_first_search()']]],
+  ['depth_5ffirst_5fsearch_2ecpp_30',['depth_first_search.cpp',['../da/d8d/depth__first__search_8cpp.html',1,'']]],
+  ['depth_5ffirst_5fsearch_5fwith_5fstack_2ecpp_31',['depth_first_search_with_stack.cpp',['../da/d4b/depth__first__search__with__stack_8cpp.html',1,'']]],
+  ['dequeue_32',['deQueue',['../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85',1,'queue']]],
+  ['dequeue_33',['dequeue',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622',1,'data_structures::queue_using_array::Queue_Array']]],
+  ['determinant_5flu_34',['determinant_lu',['../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f',1,'lu_decomposition.h']]],
+  ['dfs_35',['dfs',['../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0',1,'graph::HKGraph::dfs()'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9',1,'graph::depth_first_search::dfs()'],['../d8/db9/topological__sort_8cpp.html#abcbcaa2bb70af0a11d0c090ea1796aea',1,'graph::topological_sort::dfs()']]],
+  ['dfs_5fhc_36',['dfs_hc',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8',1,'range_queries::heavy_light_decomposition::HLD']]],
+  ['dfs_5flabels_37',['dfs_labels',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8',1,'range_queries::heavy_light_decomposition::HLD']]],
+  ['dfs_5flca_38',['dfs_lca',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4',1,'range_queries::heavy_light_decomposition::Tree']]],
+  ['dfs_5fpar_39',['dfs_par',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a',1,'range_queries::heavy_light_decomposition::HLD']]],
+  ['dfs_5fsize_40',['dfs_size',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460',1,'range_queries::heavy_light_decomposition::Tree']]],
+  ['differential_20equations_41',['Ordinary Differential Equations',['../d6/d60/group__ode.html',1,'']]],
+  ['digit_5fchar_42',['digit_char',['../db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac',1,'large_number']]],
+  ['digit_5fseparation_2ecpp_43',['digit_separation.cpp',['../d3/d36/digit__separation_8cpp.html',1,'']]],
+  ['digitseparation_44',['DigitSeparation',['../da/d49/classgreedy__algorithms_1_1_digit_separation.html',1,'greedy_algorithms::DigitSeparation'],['../da/d49/classgreedy__algorithms_1_1_digit_separation.html#afd54c969a6c9bab16b4a064fbc8ed40e',1,'greedy_algorithms::DigitSeparation::DigitSeparation()']]],
+  ['digitseparationforwardorder_45',['digitSeparationForwardOrder',['../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8',1,'greedy_algorithms::DigitSeparation']]],
+  ['digitseparationreverseorder_46',['digitSeparationReverseOrder',['../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79',1,'greedy_algorithms::DigitSeparation']]],
+  ['dijkstra_47',['dijkstra',['../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84',1,'graph::dijkstra()'],['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af915876d0ca33cc71a6a6191a8cd3ccd',1,'greedy_algorithms::dijkstra::dijkstra()']]],
+  ['dijkstra_2ecpp_48',['dijkstra.cpp',['../d8/d68/dijkstra_8cpp.html',1,'']]],
+  ['dijkstra_5fgreedy_2ecpp_49',['dijkstra_greedy.cpp',['../da/de8/dijkstra__greedy_8cpp.html',1,'']]],
+  ['direction_50',['direction',['../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655',1,'SegmentIntersection']]],
+  ['directory_51',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]],
+  ['directory_20guidelines_52',['Directory guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33',1,'']]],
+  ['disjoint_5fset_2ecpp_53',['disjoint_set.cpp',['../de/d23/disjoint__set_8cpp.html',1,'']]],
+  ['disjoint_5funion_54',['disjoint_union',['../de/db4/namespacedisjoint__union.html',1,'']]],
+  ['display_55',['display',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a1313837c0e9ec67fd9fbd17987e2d615',1,'data_structures::linked_list::list::display()'],['../db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368',1,'queue::display()'],['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631',1,'data_structures::queue_using_array::Queue_Array::display()'],['../d1/dc2/classstack.html#a8bce109630118a34faae717f72986033',1,'stack::display()'],['../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed',1,'hash_chain::display()'],['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53',1,'others::lru_cache::LRUCache::display()'],['../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd',1,'double_hashing::display()'],['../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635',1,'linear_probing::display()'],['../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357',1,'quadratic_probing::display()'],['../d5/d33/gram__schmidt_8cpp.html#ae6b496dce691e04f7f95ba0f0d33a289',1,'numerical_methods::gram_schmidt::display()']]],
+  ['displayelements_56',['displayElements',['../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72',1,'wiggle_sort.cpp']]],
+  ['displaylist_57',['displayList',['../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c',1,'data_structures::SkipList']]],
+  ['dist_58',['dist',['../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a',1,'graph::HKGraph']]],
+  ['divide_59',['divide',['../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c',1,'uint128_t::divide()'],['../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1',1,'uint256_t::divide()']]],
+  ['divide_20and_20conquer_60',['Divide And Conquer',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md50',1,'']]],
+  ['divide_5fand_5fconquer_61',['divide_and_conquer',['../dd/dba/namespacedivide__and__conquer.html',1,'']]],
+  ['dnf_5fsort_62',['dnf_sort',['../d9/d75/namespacednf__sort.html',1,'']]],
+  ['dnf_5fsort_2ecpp_63',['dnf_sort.cpp',['../d6/d1a/dnf__sort_8cpp.html',1,'']]],
+  ['dnfsort_64',['dnfSort',['../d6/d1a/dnf__sort_8cpp.html#a621767fe711db64fe57a2ac4987b11f0',1,'sorting::dnf_sort']]],
+  ['documentation_65',['Documentation',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md28',1,'Documentation'],['../index.html#autotoc_md105',1,'Documentation']]],
+  ['does_20not_20have_20a_20right_20node_20subtree_66',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]],
+  ['dot_5fproduct_67',['dot_product',['../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d',1,'numerical_methods::gram_schmidt']]],
+  ['double_5ffactorial_2ecpp_68',['double_factorial.cpp',['../d7/d89/double__factorial_8cpp.html',1,'']]],
+  ['double_5ffactorial_5fiterative_69',['double_factorial_iterative',['../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26',1,'double_factorial.cpp']]],
+  ['double_5ffactorial_5frecursive_70',['double_factorial_recursive',['../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d',1,'double_factorial.cpp']]],
+  ['double_5fhash_5fhash_5ftable_2ecpp_71',['double_hash_hash_table.cpp',['../d6/d80/double__hash__hash__table_8cpp.html',1,'']]],
+  ['double_5fhashing_72',['double_hashing',['../d0/d65/namespacedouble__hashing.html',1,'']]],
+  ['double_5flinked_5flist_73',['double_linked_list',['../d9/dee/classdouble__linked__list.html',1,'']]],
+  ['doublehash_74',['doubleHash',['../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200',1,'double_hashing']]],
+  ['dp_75',['dp',['../df/d88/namespacedp.html',1,'']]],
+  ['dptable_76',['dpTable',['../dc/d14/wildcard__matching_8cpp.html#a1f8c260cf0d7e22c666b85f1f71ee4a7',1,'backtracking::wildcard_matching']]],
+  ['draw_5fsample_77',['draw_sample',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3',1,'probability::geometric_dist::geometric_distribution']]],
+  ['drelu_78',['drelu',['../d2/d58/neural__network_8cpp.html#aa69e95a34054d7989bf446f96b2ffaf9',1,'machine_learning::neural_network::activations']]],
+  ['dsigmoid_79',['dsigmoid',['../d2/d58/neural__network_8cpp.html#a76eb66212d577f948a457b6e29d87c46',1,'machine_learning::neural_network::activations']]],
+  ['dsu_80',['dsu',['../dd/d1f/classdsu.html',1,'dsu'],['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)'],['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)']]],
+  ['dsu_5fpath_5fcompression_2ecpp_81',['dsu_path_compression.cpp',['../d3/dae/dsu__path__compression_8cpp.html',1,'']]],
+  ['dsu_5funion_5frank_2ecpp_82',['dsu_union_rank.cpp',['../df/d28/dsu__union__rank_8cpp.html',1,'']]],
+  ['dtanh_83',['dtanh',['../d2/d58/neural__network_8cpp.html#a2a5e874b9774aa5362dbcf288828b95c',1,'machine_learning::neural_network::activations']]],
+  ['duplicatenumber_84',['duplicateNumber',['../db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88',1,'search::cycle_detection']]],
+  ['durand_5fkerner_5falgo_85',['durand_kerner_algo',['../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd',1,'durand_kerner_roots.cpp']]],
+  ['durand_5fkerner_5froots_2ecpp_86',['durand_kerner_roots.cpp',['../da/df2/durand__kerner__roots_8cpp.html',1,'']]],
+  ['duval_87',['duval',['../d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632',1,'string']]],
+  ['duval_2ecpp_88',['duval.cpp',['../db/d09/duval_8cpp.html',1,'']]],
+  ['dynamic_20programming_89',['Dynamic Programming',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md51',1,'']]],
+  ['dynamic_5fprogramming_90',['dynamic_programming',['../dd/d24/namespacedynamic__programming.html',1,'']]]
 ];
diff --git a/search/all_a.js b/search/all_a.js
index 49c14d572..d00116233 100644
--- a/search/all_a.js
+++ b/search/all_a.js
@@ -1,98 +1,56 @@
 var searchData=
 [
   ['easteryearmonthday_0',['EasterYearMonthDay',['../d1/df6/class_easter_year_month_day.html',1,'']]],
-  ['eback_1',['eback',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::eback()']]],
-  ['edge_2',['Edge',['../d7/d77/class_edge.html',1,'Edge'],['../d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980',1,'Edge::Edge()']]],
-  ['edges_3',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]],
-  ['editdistdp_4',['editDistDP',['../da/d52/minimum__edit__distance_8cpp.html#ade2fcfe0359f3c7691bfaa04b14943e2',1,'dynamic_programming::minimum_edit_distance']]],
-  ['egptr_5',['egptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::egptr()']]],
-  ['eigen_5fvalues_6',['eigen_values',['../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc',1,'qr_algorithm']]],
-  ['eightpuzzle_7',['EightPuzzle',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html',1,'machine_learning::aystar_search::EightPuzzle&lt; N &gt;'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const std::array&lt; std::array&lt; uint32_t, N &gt;, N &gt; &amp;init)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const EightPuzzle&lt; N &gt; &amp;A)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const EightPuzzle&lt; N &gt; &amp;&amp;A) noexcept']]],
-  ['elliptic_5fcurve_5fkey_5fexchange_2ecpp_8',['elliptic_curve_key_exchange.cpp',['../df/d2c/elliptic__curve__key__exchange_8cpp.html',1,'']]],
-  ['emplace_9',['emplace',['http://en.cppreference.com/w/cpp/container/vector/emplace.html',0,'std::vector::emplace()'],['http://en.cppreference.com/w/cpp/container/multiset/emplace.html',0,'std::multiset::emplace()'],['http://en.cppreference.com/w/cpp/container/set/emplace.html',0,'std::set::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_map/emplace.html',0,'std::unordered_map::emplace()'],['http://en.cppreference.com/w/cpp/container/stack/emplace.html',0,'std::stack::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/emplace.html',0,'std::unordered_multimap::emplace()'],['http://en.cppreference.com/w/cpp/container/deque/emplace.html',0,'std::deque::emplace()'],['http://en.cppreference.com/w/cpp/container/queue/emplace.html',0,'std::queue::emplace()'],['http://en.cppreference.com/w/cpp/container/priority_queue/emplace.html',0,'std::priority_queue::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/emplace.html',0,'std::unordered_multiset::emplace()'],['http://en.cppreference.com/w/cpp/container/list/emplace.html',0,'std::list::emplace()'],['http://en.cppreference.com/w/cpp/container/map/emplace.html',0,'std::map::emplace()'],['http://en.cppreference.com/w/cpp/experimental/optional/emplace.html',0,'std::experimental::optional::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_set/emplace.html',0,'std::unordered_set::emplace()'],['http://en.cppreference.com/w/cpp/container/multimap/emplace.html',0,'std::multimap::emplace()']]],
-  ['emplace_5fafter_10',['emplace_after',['http://en.cppreference.com/w/cpp/container/forward_list/emplace_after.html',0,'std::forward_list']]],
-  ['emplace_5fback_11',['emplace_back',['http://en.cppreference.com/w/cpp/container/vector/emplace_back.html',0,'std::vector::emplace_back()'],['http://en.cppreference.com/w/cpp/container/deque/emplace_back.html',0,'std::deque::emplace_back()'],['http://en.cppreference.com/w/cpp/container/list/emplace_back.html',0,'std::list::emplace_back()']]],
-  ['emplace_5ffront_12',['emplace_front',['http://en.cppreference.com/w/cpp/container/forward_list/emplace_front.html',0,'std::forward_list::emplace_front()'],['http://en.cppreference.com/w/cpp/container/deque/emplace_front.html',0,'std::deque::emplace_front()'],['http://en.cppreference.com/w/cpp/container/list/emplace_front.html',0,'std::list::emplace_front()']]],
-  ['emplace_5fhint_13',['emplace_hint',['http://en.cppreference.com/w/cpp/container/multiset/emplace_hint.html',0,'std::multiset::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/set/emplace_hint.html',0,'std::set::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_map/emplace_hint.html',0,'std::unordered_map::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/emplace_hint.html',0,'std::unordered_multimap::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/emplace_hint.html',0,'std::unordered_multiset::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/map/emplace_hint.html',0,'std::map::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_set/emplace_hint.html',0,'std::unordered_set::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/multimap/emplace_hint.html',0,'std::multimap::emplace_hint()']]],
-  ['empty_14',['empty',['http://en.cppreference.com/w/cpp/container/dynarray/empty.html',0,'std::dynarray::empty()'],['http://en.cppreference.com/w/cpp/container/vector/empty.html',0,'std::vector::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::match_results::empty()'],['http://en.cppreference.com/w/cpp/container/multiset/empty.html',0,'std::multiset::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::string::empty()'],['http://en.cppreference.com/w/cpp/container/set/empty.html',0,'std::set::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_map/empty.html',0,'std::unordered_map::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::wsmatch::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::smatch::empty()'],['http://en.cppreference.com/w/cpp/container/stack/empty.html',0,'std::stack::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/empty.html',0,'std::unordered_multimap::empty()'],['http://en.cppreference.com/w/cpp/container/forward_list/empty.html',0,'std::forward_list::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::wcmatch::empty()'],['http://en.cppreference.com/w/cpp/container/deque/empty.html',0,'std::deque::empty()'],['http://en.cppreference.com/w/cpp/container/queue/empty.html',0,'std::queue::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::basic_string::empty()'],['http://en.cppreference.com/w/cpp/container/priority_queue/empty.html',0,'std::priority_queue::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::wstring::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/empty.html',0,'std::unordered_multiset::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::u16string::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::u32string::empty()'],['http://en.cppreference.com/w/cpp/container/list/empty.html',0,'std::list::empty()'],['http://en.cppreference.com/w/cpp/container/map/empty.html',0,'std::map::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::cmatch::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_set/empty.html',0,'std::unordered_set::empty()'],['http://en.cppreference.com/w/cpp/container/multimap/empty.html',0,'std::multimap::empty()'],['http://en.cppreference.com/w/cpp/container/array/empty.html',0,'std::array::empty()'],['../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080',1,'data_structures::Stack::empty()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0',1,'others::Cache::LFUCache::empty()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e',1,'others::Cache::LRUCache::empty()']]],
-  ['enable_5fif_15',['enable_if',['http://en.cppreference.com/w/cpp/types/enable_if.html',0,'std']]],
-  ['enable_5fshared_5ffrom_5fthis_16',['enable_shared_from_this',['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this.html',0,'std::enable_shared_from_this'],['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/enable_shared_from_this.html',0,'std::enable_shared_from_this::enable_shared_from_this()']]],
-  ['encoding_17',['encoding',['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_byname::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8_utf16::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf16::encoding()']]],
-  ['encrypt_18',['encrypt',['../de/db6/a1z26__cipher_8cpp.html#a77a6b827a0b9c7aca2d705811459d744',1,'ciphers::a1z26::encrypt()'],['../d6/d2c/caesar__cipher_8cpp.html#ac3381121289548640b1c27a58a8524c3',1,'ciphers::caesar::encrypt()'],['../d8/d76/morse__code_8cpp.html#a0242e458904de8a242fcdaffe9e3ba1a',1,'ciphers::morse::encrypt()'],['../dd/d12/vigenere__cipher_8cpp.html#a6bd3880ea6820c232c1eddf47553c257',1,'ciphers::vigenere::encrypt()'],['../d3/d4c/xor__cipher_8cpp.html#aeff72a463ffc580c16cc849cbbdc58ef',1,'ciphers::XOR::encrypt()']]],
-  ['encrypt_5ftext_19',['encrypt_text',['../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917',1,'ciphers::HillCipher']]],
-  ['end_20',['end',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::end'],['http://en.cppreference.com/w/cpp/container/dynarray/end.html',0,'std::dynarray::end()'],['http://en.cppreference.com/w/cpp/container/vector/end.html',0,'std::vector::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::match_results::end()'],['http://en.cppreference.com/w/cpp/container/multiset/end.html',0,'std::multiset::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::string::end()'],['http://en.cppreference.com/w/cpp/container/set/end.html',0,'std::set::end()'],['http://en.cppreference.com/w/cpp/container/unordered_map/end.html',0,'std::unordered_map::end()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/end.html',0,'std::initializer_list::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wsmatch::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::smatch::end()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end.html',0,'std::unordered_multimap::end()'],['http://en.cppreference.com/w/cpp/container/forward_list/end.html',0,'std::forward_list::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wcmatch::end()'],['http://en.cppreference.com/w/cpp/container/deque/end.html',0,'std::deque::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::basic_string::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::wstring::end()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end.html',0,'std::unordered_multiset::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u16string::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u32string::end()'],['http://en.cppreference.com/w/cpp/container/list/end.html',0,'std::list::end()'],['http://en.cppreference.com/w/cpp/container/map/end.html',0,'std::map::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::cmatch::end()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end.html',0,'std::unordered_set::end()'],['http://en.cppreference.com/w/cpp/container/multimap/end.html',0,'std::multimap::end()'],['http://en.cppreference.com/w/cpp/container/array/end.html',0,'std::array::end()'],['http://en.cppreference.com/w/cpp/iterator/end.html',0,'std::end()']]],
-  ['end_28int_29_21',['end(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/end2.html',0,'std::unordered_map::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end2.html',0,'std::unordered_multimap::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end2.html',0,'std::unordered_multiset::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end2.html',0,'std::unordered_set::end(int)()']]],
-  ['endl_22',['endl',['../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258',1,'endl:&#160;matrix_exponentiation.cpp'],['http://en.cppreference.com/w/cpp/io/manip/endl.html',0,'std::endl(T... args)']]],
-  ['ends_23',['ends',['http://en.cppreference.com/w/cpp/io/manip/ends.html',0,'std']]],
-  ['enforcement_24',['Enforcement',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md9',1,'']]],
-  ['enforcement_20guidelines_25',['Enforcement Guidelines',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md10',1,'']]],
-  ['enforcement_20responsibilities_26',['Enforcement Responsibilities',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md7',1,'']]],
-  ['enqueue_27',['enQueue',['../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d',1,'queue']]],
-  ['enqueue_28',['enqueue',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663',1,'data_structures::queue_using_array::Queue_Array']]],
-  ['ensurenotempty_29',['ensureNotEmpty',['../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604',1,'queue']]],
-  ['entropy_30',['entropy',['http://en.cppreference.com/w/cpp/numeric/random/random_device/entropy.html',0,'std::random_device']]],
-  ['entry_31',['Entry',['../d9/dde/structdouble__hashing_1_1_entry.html',1,'double_hashing::Entry'],['../db/d19/structlinear__probing_1_1_entry.html',1,'linear_probing::Entry'],['../da/dd1/structquadratic__probing_1_1_entry.html',1,'quadratic_probing::Entry'],['../d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475',1,'double_hashing::Entry::Entry()'],['../db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77',1,'linear_probing::Entry::Entry()'],['../da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e',1,'quadratic_probing::Entry::Entry()']]],
-  ['eof_32',['eof',['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::fstream::eof()'],['http://en.cppreference.com/w/cpp/string/char_traits/eof.html',0,'std::char_traits::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ios::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_fstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::iostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wistream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::stringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wifstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_istream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::strstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_stringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istrstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wiostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_istringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ifstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostrstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wfstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_iostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wstringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wistringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ifstream::eof()']]],
-  ['epptr_33',['epptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::epptr()']]],
-  ['epsilon_34',['EPSILON',['../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70',1,'EPSILON:&#160;brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70',1,'EPSILON:&#160;golden_search_extrema.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#a75f355966e0a97665eaf5a4c79baa7af',1,'EPSILON:&#160;newton_raphson_method.cpp']]],
-  ['epsilon_35',['epsilon',['http://en.cppreference.com/w/cpp/types/numeric_limits/epsilon.html',0,'std::numeric_limits']]],
-  ['eq_36',['eq',['http://en.cppreference.com/w/cpp/string/char_traits/cmp.html',0,'std::char_traits::eq()'],['../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq():&#160;bisection_method.cpp'],['../dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713',1,'numerical_methods::false_position::eq()'],['../de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq(double i):&#160;newton_raphson_method.cpp'],['../df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389',1,'eq(float y):&#160;successive_approximation.cpp']]],
-  ['eq_5fder_37',['eq_der',['../de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386',1,'newton_raphson_method.cpp']]],
-  ['eq_5fint_5ftype_38',['eq_int_type',['http://en.cppreference.com/w/cpp/string/char_traits/eq_int_type.html',0,'std::char_traits']]],
-  ['eqd_39',['eqd',['../df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456',1,'successive_approximation.cpp']]],
-  ['equal_40',['equal',['http://en.cppreference.com/w/cpp/algorithm/equal.html',0,'std']]],
-  ['equal_5frange_41',['equal_range',['http://en.cppreference.com/w/cpp/container/multiset/equal_range.html',0,'std::multiset::equal_range()'],['http://en.cppreference.com/w/cpp/container/set/equal_range.html',0,'std::set::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_map/equal_range.html',0,'std::unordered_map::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/equal_range.html',0,'std::unordered_multimap::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/equal_range.html',0,'std::unordered_multiset::equal_range()'],['http://en.cppreference.com/w/cpp/container/map/equal_range.html',0,'std::map::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_set/equal_range.html',0,'std::unordered_set::equal_range()'],['http://en.cppreference.com/w/cpp/container/multimap/equal_range.html',0,'std::multimap::equal_range()'],['http://en.cppreference.com/w/cpp/algorithm/equal_range.html',0,'std::equal_range()']]],
-  ['equal_5fshuffle_42',['equal_shuffle',['../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f',1,'machine_learning']]],
-  ['equal_5fto_43',['equal_to',['http://en.cppreference.com/w/cpp/utility/functional/equal_to.html',0,'std']]],
-  ['equations_44',['Ordinary Differential Equations',['../d6/d60/group__ode.html',1,'']]],
-  ['equivalent_45',['equivalent',['http://en.cppreference.com/w/cpp/error/error_category/equivalent.html',0,'std::error_category']]],
-  ['erase_46',['erase',['http://en.cppreference.com/w/cpp/container/vector/erase.html',0,'std::vector::erase()'],['http://en.cppreference.com/w/cpp/container/multiset/erase.html',0,'std::multiset::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::string::erase()'],['http://en.cppreference.com/w/cpp/container/set/erase.html',0,'std::set::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_map/erase.html',0,'std::unordered_map::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/erase.html',0,'std::unordered_multimap::erase()'],['http://en.cppreference.com/w/cpp/container/deque/erase.html',0,'std::deque::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::basic_string::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::wstring::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/erase.html',0,'std::unordered_multiset::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::u16string::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::u32string::erase()'],['http://en.cppreference.com/w/cpp/container/list/erase.html',0,'std::list::erase()'],['http://en.cppreference.com/w/cpp/container/map/erase.html',0,'std::map::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_set/erase.html',0,'std::unordered_set::erase()'],['http://en.cppreference.com/w/cpp/container/multimap/erase.html',0,'std::multimap::erase()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a009b19ac8cca40f2e4daa2e5989fa4f3',1,'data_structures::linked_list::list::erase()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469',1,'data_structures::treap::Treap::erase()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::erase()']]],
-  ['erase_5fafter_47',['erase_after',['http://en.cppreference.com/w/cpp/container/forward_list/erase_after.html',0,'std::forward_list']]],
-  ['erasefromsorted_48',['eraseFromSorted',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e',1,'probability::windowed_median::WindowedMedian']]],
-  ['eratosthenes_2ecpp_49',['eratosthenes.cpp',['../d7/da6/eratosthenes_8cpp.html',1,'']]],
-  ['erf_50',['erf',['http://en.cppreference.com/w/cpp/numeric/math/erf.html',0,'std']]],
-  ['erfc_51',['erfc',['http://en.cppreference.com/w/cpp/numeric/math/erfc.html',0,'std']]],
-  ['errc_52',['errc',['http://en.cppreference.com/w/cpp/error/errc.html',0,'std']]],
-  ['error_5fcategory_53',['error_category',['http://en.cppreference.com/w/cpp/error/error_category.html',0,'std::error_category'],['http://en.cppreference.com/w/cpp/error/error_category/error_category.html',0,'std::error_category::error_category()']]],
-  ['error_5fcode_54',['error_code',['http://en.cppreference.com/w/cpp/error/error_code.html',0,'std::error_code'],['http://en.cppreference.com/w/cpp/error/error_code/error_code.html',0,'std::error_code::error_code()']]],
-  ['error_5fcondition_55',['error_condition',['http://en.cppreference.com/w/cpp/error/error_condition.html',0,'std::error_condition'],['http://en.cppreference.com/w/cpp/error/error_condition/error_condition.html',0,'std::error_condition::error_condition()']]],
-  ['eta_56',['eta',['../d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda',1,'machine_learning::adaline']]],
-  ['euclidean_5fdistance_57',['euclidean_distance',['../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69',1,'machine_learning::k_nearest_neighbors']]],
-  ['eulers_5ftotient_5ffunction_2ecpp_58',['eulers_totient_function.cpp',['../da/d23/eulers__totient__function_8cpp.html',1,'']]],
-  ['evaluate_59',['evaluate',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e',1,'machine_learning::neural_network::NeuralNetwork::evaluate()'],['../d7/d75/postfix__evaluation_8cpp.html#a59fd597e0ea394abe027ced4d2ea3338',1,'others::postfix_expression::evaluate()']]],
-  ['evaluate_5ffrom_5fcsv_60',['evaluate_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a36494e26ff36d6e15c1022bb9a1ee848',1,'machine_learning::neural_network::NeuralNetwork']]],
-  ['event_5fcallback_61',['event_callback',['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_fstream&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ifstream&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ios&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_iostream&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_istream&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_istringstream&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ofstream&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ostream&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ostringstream&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_stringstream&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::fstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ifstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ios_base::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::iostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::istream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::istringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::istrstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ofstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ostringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ostrstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::stringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::strstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wfstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wifstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wiostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wistream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wistringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wofstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wostringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wstringstream::event_callback']]],
-  ['exa_62',['exa',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['exact_5fsolution_63',['exact_solution',['../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y):&#160;ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y):&#160;ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y):&#160;ode_semi_implicit_euler.cpp']]],
-  ['example_64',['example',['../de/dab/ncr__modulo__p_8cpp.html#afa2b50f4716fc3b42221a72e676e1422',1,'ncr_modulo_p.cpp']]],
-  ['example_3a_65',['Example:',['../df/d66/vector__cross__product_8cpp.html#autotoc_md87',1,'']]],
-  ['examples_66',['Self-test examples',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30',1,'']]],
-  ['exception_67',['exception',['http://en.cppreference.com/w/cpp/error/exception.html',0,'std::exception'],['http://en.cppreference.com/w/cpp/error/exception/exception.html',0,'std::exception::exception()']]],
-  ['exception_5fptr_68',['exception_ptr',['http://en.cppreference.com/w/cpp/error/exception_ptr.html',0,'std']]],
-  ['exceptions_69',['exceptions',['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::fstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ios::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_fstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::iostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wistream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::stringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wifstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_istream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::strstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_stringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istrstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wiostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_istringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ifstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostrstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wfstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_iostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wstringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wistringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ifstream::exceptions()']]],
-  ['exchange_70',['exchange',['http://en.cppreference.com/w/cpp/atomic/atomic/exchange.html',0,'std::atomic']]],
-  ['exists_71',['exists',['../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81',1,'dynamic_programming::word_break']]],
-  ['exit_72',['exit',['http://en.cppreference.com/w/cpp/utility/program/exit.html',0,'std']]],
-  ['exp_73',['exp',['http://en.cppreference.com/w/cpp/numeric/math/exp.html',0,'std::exp()'],['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0',1,'ciphers::elliptic_curve_key_exchange::exp()']]],
-  ['exp2_74',['exp2',['http://en.cppreference.com/w/cpp/numeric/math/exp2.html',0,'std']]],
-  ['expected_5fvalue_75',['expected_value',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413',1,'probability::geometric_dist::geometric_distribution']]],
-  ['expired_76',['expired',['http://en.cppreference.com/w/cpp/memory/weak_ptr/expired.html',0,'std::weak_ptr']]],
-  ['explanation_77',['Algorithm explanation',['../d3/db3/lru__cache_8cpp.html#autotoc_md97',1,'']]],
-  ['explore_78',['explore',['../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8',1,'graph::explore(const std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, std::vector&lt; bool &gt; *visited)'],['../df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463',1,'graph::explore(const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;adj, size_t v, std::vector&lt; bool &gt; *visited)']]],
-  ['expm1_79',['expm1',['http://en.cppreference.com/w/cpp/numeric/math/expm1.html',0,'std']]],
-  ['exponential_5fdist_80',['exponential_dist',['../d1/d35/namespaceexponential__dist.html',1,'']]],
-  ['exponential_5fdist_2ecpp_81',['exponential_dist.cpp',['../d9/da2/exponential__dist_8cpp.html',1,'']]],
-  ['exponential_5fdistribution_82',['exponential_distribution',['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution.html',0,'std::exponential_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/exponential_distribution.html',0,'std::exponential_distribution::exponential_distribution()']]],
-  ['exponential_5fexpected_83',['exponential_expected',['../d9/da2/exponential__dist_8cpp.html#a1c8b6e787f72a209ef96c096eedf7afc',1,'probability::geometric_dist']]],
-  ['exponential_5fsearch_2ecpp_84',['exponential_search.cpp',['../d8/d8a/exponential__search_8cpp.html',1,'']]],
-  ['exponential_5fstd_85',['exponential_std',['../d9/da2/exponential__dist_8cpp.html#ac7b0091e17479d47438a281fefc2549a',1,'probability::geometric_dist']]],
-  ['exponential_5fvar_86',['exponential_var',['../d9/da2/exponential__dist_8cpp.html#af435dbeb43a05c8c7785f53bf4ce1df1',1,'probability::geometric_dist']]],
-  ['extended_5feuclid_5falgorithm_2ecpp_87',['extended_euclid_algorithm.cpp',['../d9/d5d/extended__euclid__algorithm_8cpp.html',1,'']]],
-  ['extendedeuclid_88',['extendedEuclid',['../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d',1,'extended_euclid_algorithm.cpp']]],
-  ['extendedeuclid_5f1_89',['extendedEuclid_1',['../d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25',1,'extended_euclid_algorithm.cpp']]],
-  ['extent_90',['extent',['http://en.cppreference.com/w/cpp/types/extent.html',0,'std']]],
-  ['extern_5ftype_91',['extern_type',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_byname::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf16::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8_utf16::extern_type']]],
-  ['extract_5fbyte_92',['extract_byte',['../d4/d08/sha256_8cpp.html#afea411191ec5281f43e91ea327984627',1,'hashing::sha256']]],
-  ['extractmin_93',['extractMin',['../d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980',1,'MinHeap']]],
-  ['extreme_5fvalue_5fdistribution_94',['extreme_value_distribution',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution.html',0,'std::extreme_value_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/extreme_value_distribution.html',0,'std::extreme_value_distribution::extreme_value_distribution()']]]
+  ['edge_1',['Edge',['../d7/d77/class_edge.html',1,'Edge'],['../d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980',1,'Edge::Edge()']]],
+  ['edges_2',['Matching and Not-Matching edges',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md78',1,'']]],
+  ['editdistdp_3',['editDistDP',['../da/d52/minimum__edit__distance_8cpp.html#ade2fcfe0359f3c7691bfaa04b14943e2',1,'dynamic_programming::minimum_edit_distance']]],
+  ['eigen_5fvalues_4',['eigen_values',['../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc',1,'qr_algorithm']]],
+  ['eightpuzzle_5',['EightPuzzle',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html',1,'machine_learning::aystar_search::EightPuzzle&lt; N &gt;'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const std::array&lt; std::array&lt; uint32_t, N &gt;, N &gt; &amp;init)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const EightPuzzle&lt; N &gt; &amp;A)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const EightPuzzle&lt; N &gt; &amp;&amp;A) noexcept']]],
+  ['elliptic_5fcurve_5fkey_5fexchange_2ecpp_6',['elliptic_curve_key_exchange.cpp',['../df/d2c/elliptic__curve__key__exchange_8cpp.html',1,'']]],
+  ['empty_7',['empty',['../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080',1,'data_structures::Stack::empty()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0',1,'others::Cache::LFUCache::empty()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e',1,'others::Cache::LRUCache::empty()']]],
+  ['encrypt_8',['encrypt',['../de/db6/a1z26__cipher_8cpp.html#a77a6b827a0b9c7aca2d705811459d744',1,'ciphers::a1z26::encrypt()'],['../d6/d2c/caesar__cipher_8cpp.html#ac3381121289548640b1c27a58a8524c3',1,'ciphers::caesar::encrypt()'],['../d8/d76/morse__code_8cpp.html#a0242e458904de8a242fcdaffe9e3ba1a',1,'ciphers::morse::encrypt()'],['../dd/d12/vigenere__cipher_8cpp.html#a6bd3880ea6820c232c1eddf47553c257',1,'ciphers::vigenere::encrypt()'],['../d3/d4c/xor__cipher_8cpp.html#aeff72a463ffc580c16cc849cbbdc58ef',1,'ciphers::XOR::encrypt()']]],
+  ['encrypt_5ftext_9',['encrypt_text',['../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917',1,'ciphers::HillCipher']]],
+  ['end_10',['end',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList']]],
+  ['endl_11',['endl',['../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258',1,'matrix_exponentiation.cpp']]],
+  ['enforcement_12',['Enforcement',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md9',1,'']]],
+  ['enforcement_20guidelines_13',['Enforcement Guidelines',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md10',1,'']]],
+  ['enforcement_20responsibilities_14',['Enforcement Responsibilities',['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md7',1,'']]],
+  ['enqueue_15',['enQueue',['../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d',1,'queue']]],
+  ['enqueue_16',['enqueue',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663',1,'data_structures::queue_using_array::Queue_Array']]],
+  ['ensurenotempty_17',['ensureNotEmpty',['../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604',1,'queue']]],
+  ['entry_18',['Entry',['../d9/dde/structdouble__hashing_1_1_entry.html',1,'double_hashing::Entry'],['../db/d19/structlinear__probing_1_1_entry.html',1,'linear_probing::Entry'],['../da/dd1/structquadratic__probing_1_1_entry.html',1,'quadratic_probing::Entry'],['../d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475',1,'double_hashing::Entry::Entry()'],['../db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77',1,'linear_probing::Entry::Entry()'],['../da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e',1,'quadratic_probing::Entry::Entry()']]],
+  ['epsilon_19',['EPSILON',['../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70',1,'EPSILON:&#160;brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70',1,'EPSILON:&#160;golden_search_extrema.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#a75f355966e0a97665eaf5a4c79baa7af',1,'EPSILON:&#160;newton_raphson_method.cpp']]],
+  ['eq_20',['eq',['../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq():&#160;bisection_method.cpp'],['../dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713',1,'numerical_methods::false_position::eq()'],['../de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq(double i):&#160;newton_raphson_method.cpp'],['../df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389',1,'eq(float y):&#160;successive_approximation.cpp']]],
+  ['eq_5fder_21',['eq_der',['../de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386',1,'newton_raphson_method.cpp']]],
+  ['eqd_22',['eqd',['../df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456',1,'successive_approximation.cpp']]],
+  ['equal_5fshuffle_23',['equal_shuffle',['../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f',1,'machine_learning']]],
+  ['equations_24',['Ordinary Differential Equations',['../d6/d60/group__ode.html',1,'']]],
+  ['erase_25',['erase',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a009b19ac8cca40f2e4daa2e5989fa4f3',1,'data_structures::linked_list::list::erase()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469',1,'data_structures::treap::Treap::erase()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::erase()']]],
+  ['erasefromsorted_26',['eraseFromSorted',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e',1,'probability::windowed_median::WindowedMedian']]],
+  ['eratosthenes_2ecpp_27',['eratosthenes.cpp',['../d7/da6/eratosthenes_8cpp.html',1,'']]],
+  ['eta_28',['eta',['../d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda',1,'machine_learning::adaline']]],
+  ['euclidean_5fdistance_29',['euclidean_distance',['../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69',1,'machine_learning::k_nearest_neighbors']]],
+  ['eulers_5ftotient_5ffunction_2ecpp_30',['eulers_totient_function.cpp',['../da/d23/eulers__totient__function_8cpp.html',1,'']]],
+  ['evaluate_31',['evaluate',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e',1,'machine_learning::neural_network::NeuralNetwork::evaluate()'],['../d7/d75/postfix__evaluation_8cpp.html#a59fd597e0ea394abe027ced4d2ea3338',1,'others::postfix_expression::evaluate()']]],
+  ['evaluate_5ffrom_5fcsv_32',['evaluate_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a36494e26ff36d6e15c1022bb9a1ee848',1,'machine_learning::neural_network::NeuralNetwork']]],
+  ['exact_5fsolution_33',['exact_solution',['../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y):&#160;ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y):&#160;ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y):&#160;ode_semi_implicit_euler.cpp']]],
+  ['example_34',['example',['../de/dab/ncr__modulo__p_8cpp.html#afa2b50f4716fc3b42221a72e676e1422',1,'ncr_modulo_p.cpp']]],
+  ['example_3a_35',['Example:',['../df/d66/vector__cross__product_8cpp.html#autotoc_md87',1,'']]],
+  ['examples_36',['Self-test examples',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md30',1,'']]],
+  ['exists_37',['exists',['../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81',1,'dynamic_programming::word_break']]],
+  ['exp_38',['exp',['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0',1,'ciphers::elliptic_curve_key_exchange']]],
+  ['expected_5fvalue_39',['expected_value',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413',1,'probability::geometric_dist::geometric_distribution']]],
+  ['explanation_40',['Algorithm explanation',['../d3/db3/lru__cache_8cpp.html#autotoc_md97',1,'']]],
+  ['explore_41',['explore',['../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8',1,'graph::explore(const std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, std::vector&lt; bool &gt; *visited)'],['../df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463',1,'graph::explore(const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;adj, size_t v, std::vector&lt; bool &gt; *visited)']]],
+  ['exponential_5fdist_42',['exponential_dist',['../d1/d35/namespaceexponential__dist.html',1,'']]],
+  ['exponential_5fdist_2ecpp_43',['exponential_dist.cpp',['../d9/da2/exponential__dist_8cpp.html',1,'']]],
+  ['exponential_5fexpected_44',['exponential_expected',['../d9/da2/exponential__dist_8cpp.html#a1c8b6e787f72a209ef96c096eedf7afc',1,'probability::geometric_dist']]],
+  ['exponential_5fsearch_2ecpp_45',['exponential_search.cpp',['../d8/d8a/exponential__search_8cpp.html',1,'']]],
+  ['exponential_5fstd_46',['exponential_std',['../d9/da2/exponential__dist_8cpp.html#ac7b0091e17479d47438a281fefc2549a',1,'probability::geometric_dist']]],
+  ['exponential_5fvar_47',['exponential_var',['../d9/da2/exponential__dist_8cpp.html#af435dbeb43a05c8c7785f53bf4ce1df1',1,'probability::geometric_dist']]],
+  ['extended_5feuclid_5falgorithm_2ecpp_48',['extended_euclid_algorithm.cpp',['../d9/d5d/extended__euclid__algorithm_8cpp.html',1,'']]],
+  ['extendedeuclid_49',['extendedEuclid',['../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d',1,'extended_euclid_algorithm.cpp']]],
+  ['extendedeuclid_5f1_50',['extendedEuclid_1',['../d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25',1,'extended_euclid_algorithm.cpp']]],
+  ['extract_5fbyte_51',['extract_byte',['../d4/d08/sha256_8cpp.html#afea411191ec5281f43e91ea327984627',1,'hashing::sha256']]],
+  ['extractmin_52',['extractMin',['../d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980',1,'MinHeap']]]
 ];
diff --git a/search/all_b.js b/search/all_b.js
index 58158e2c2..e8d8f2152 100644
--- a/search/all_b.js
+++ b/search/all_b.js
@@ -1,165 +1,76 @@
 var searchData=
 [
   ['f_0',['f',['../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397',1,'numerical_methods::simpson_method::f()'],['../df/d11/midpoint__integral__method_8cpp.html#a7ee8e824ef3e138a9a21883b26d97226',1,'numerical_methods::midpoint_rule::f()']]],
-  ['fabs_1',['fabs',['http://en.cppreference.com/w/cpp/numeric/math/fabs.html',0,'std']]],
-  ['fac_2',['fac',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a738a5f59bb3560c81cdb7f43bcfe9fec',1,'math::ncr_modulo_p::NCRModuloP']]],
-  ['facet_3',['facet',['http://en.cppreference.com/w/cpp/locale/locale/facet.html',0,'std::locale::facet'],['http://en.cppreference.com/w/cpp/locale/locale/facet/facet.html',0,'std::locale::facet::facet()']]],
-  ['fact_4',['fact',['../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a',1,'poisson_dist.cpp']]],
-  ['factorial_5',['factorial',['../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a',1,'math']]],
-  ['factorial_2ecpp_6',['factorial.cpp',['../d9/d00/factorial_8cpp.html',1,'']]],
-  ['factorization_7',['Prime factorization',['../d7/d7f/section.html',1,'']]],
-  ['factors_8',['factors',['../db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b',1,'prime_factorization.cpp']]],
-  ['fail_9',['fail',['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::fstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ios::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_fstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::iostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wistream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::stringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wifstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_istream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::strstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_stringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istrstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wiostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_istringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ifstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostrstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wfstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_iostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wstringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wistringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ifstream::fail()']]],
-  ['failure_10',['failure',['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_fstream&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ifstream&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ios&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_iostream&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istream&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istringstream&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ofstream&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostream&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostringstream&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_stringstream&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::fstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ifstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ios_base::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::iostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istrstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ofstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostrstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::stringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::strstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wfstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wifstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wiostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wofstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wstringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::fstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ios::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_fstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::iostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ios_base::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::stringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wifstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::strstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_stringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istrstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wiostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ifstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostrstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wfstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_iostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wstringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ifstream::failure::failure()']]],
-  ['false_5fposition_11',['false_position',['../df/dea/namespacefalse__position.html',1,'']]],
-  ['false_5fposition_2ecpp_12',['false_position.cpp',['../dd/d29/false__position_8cpp.html',1,'']]],
-  ['false_5ftype_13',['false_type',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]],
-  ['falsename_14',['falsename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::falsename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::falsename()']]],
-  ['fast_5ffourier_5ftransform_2ecpp_15',['fast_fourier_transform.cpp',['../d8/d9a/fast__fourier__transform_8cpp.html',1,'']]],
-  ['fast_5finteger_5finput_2ecpp_16',['fast_integer_input.cpp',['../d9/df0/fast__integer__input_8cpp.html',1,'']]],
-  ['fast_5finvsqrt_17',['Fast_InvSqrt',['../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52',1,'inv_sqrt.cpp']]],
-  ['fast_5fpower_2ecpp_18',['fast_power.cpp',['../d2/d0b/fast__power_8cpp.html',1,'']]],
-  ['fast_5fpower_5flinear_19',['fast_power_linear',['../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d',1,'fast_power.cpp']]],
-  ['fast_5fpower_5frecursive_20',['fast_power_recursive',['../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445',1,'fast_power.cpp']]],
-  ['fastfouriertransform_21',['FastFourierTransform',['../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150',1,'numerical_methods']]],
-  ['fastinput_22',['fastinput',['../d9/df0/fast__integer__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82',1,'fast_integer_input.cpp']]],
-  ['fcfs_23',['FCFS',['../dd/dca/class_f_c_f_s.html',1,'']]],
-  ['fcfs_5fscheduling_2ecpp_24',['fcfs_scheduling.cpp',['../df/d47/fcfs__scheduling_8cpp.html',1,'']]],
-  ['fclose_25',['fclose',['http://en.cppreference.com/w/cpp/io/c/fclose.html',0,'std']]],
-  ['fdim_26',['fdim',['http://en.cppreference.com/w/cpp/numeric/math/fdim.html',0,'std']]],
-  ['features_27',['Features',['../index.html#autotoc_md104',1,'']]],
-  ['feclearexcept_28',['feclearexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/feclearexcept.html',0,'std']]],
-  ['fegetenv_29',['fegetenv',['http://en.cppreference.com/w/cpp/numeric/fenv/feenv.html',0,'std']]],
-  ['fegetexceptflag_30',['fegetexceptflag',['http://en.cppreference.com/w/cpp/numeric/fenv/feexceptflag.html',0,'std']]],
-  ['fegetround_31',['fegetround',['http://en.cppreference.com/w/cpp/numeric/fenv/feround.html',0,'std']]],
-  ['feholdexcept_32',['feholdexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/feholdexcept.html',0,'std']]],
-  ['femto_33',['femto',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['fenwick_5ftree_34',['fenwick_tree',['../de/d0d/classrange__queries_1_1fenwick__tree.html',1,'range_queries::fenwick_tree'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#a5ea37183524553bbf2234a36a44a4b9a',1,'range_queries::fenwick_tree::fenwick_tree(const std::vector&lt; T &gt; &amp;arr)'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c',1,'range_queries::fenwick_tree::fenwick_tree(T x)']]],
-  ['fenwick_5ftree_2ecpp_35',['fenwick_tree.cpp',['../d6/d2e/fenwick__tree_8cpp.html',1,'']]],
-  ['feof_36',['feof',['http://en.cppreference.com/w/cpp/io/c/feof.html',0,'std']]],
-  ['feraiseexcept_37',['feraiseexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/feraiseexcept.html',0,'std']]],
-  ['ferror_38',['ferror',['http://en.cppreference.com/w/cpp/io/c/ferror.html',0,'std']]],
-  ['fesetenv_39',['fesetenv',['http://en.cppreference.com/w/cpp/numeric/fenv/feenv.html',0,'std']]],
-  ['fesetexceptflag_40',['fesetexceptflag',['http://en.cppreference.com/w/cpp/numeric/fenv/feexceptflag.html',0,'std']]],
-  ['fesetround_41',['fesetround',['http://en.cppreference.com/w/cpp/numeric/fenv/feround.html',0,'std']]],
-  ['fetch_5fadd_42',['fetch_add',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_add.html',0,'std::atomic']]],
-  ['fetch_5fand_43',['fetch_and',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_and.html',0,'std::atomic']]],
-  ['fetch_5for_44',['fetch_or',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_or.html',0,'std::atomic']]],
-  ['fetch_5fsub_45',['fetch_sub',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_sub.html',0,'std::atomic']]],
-  ['fetch_5fxor_46',['fetch_xor',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_xor.html',0,'std::atomic']]],
-  ['fetestexcept_47',['fetestexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/fetestexcept.html',0,'std']]],
-  ['feupdateenv_48',['feupdateenv',['http://en.cppreference.com/w/cpp/numeric/fenv/feupdateenv.html',0,'std']]],
-  ['fflush_49',['fflush',['http://en.cppreference.com/w/cpp/io/c/fflush.html',0,'std']]],
-  ['fgetc_50',['fgetc',['http://en.cppreference.com/w/cpp/io/c/fgetc.html',0,'std']]],
-  ['fgetpos_51',['fgetpos',['http://en.cppreference.com/w/cpp/io/c/fgetpos.html',0,'std']]],
-  ['fgets_52',['fgets',['http://en.cppreference.com/w/cpp/io/c/fgets.html',0,'std']]],
-  ['fgetwc_53',['fgetwc',['http://en.cppreference.com/w/cpp/io/c/fgetwc.html',0,'std']]],
-  ['fgetws_54',['fgetws',['http://en.cppreference.com/w/cpp/io/c/fgetws.html',0,'std']]],
-  ['fib_55',['fib',['../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f',1,'fib(uint64_t n):&#160;fibonacci_fast.cpp'],['../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db',1,'fib(uint64_t n):&#160;fibonacci_large.cpp']]],
-  ['fib_5faccurate_56',['fib_Accurate',['../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca',1,'string_fibonacci.cpp']]],
-  ['fib_5fb_57',['fib_b',['../d7/d35/matrix__exponentiation_8cpp.html#a35b7c98af53ad2ec18658679ad7d43de',1,'matrix_exponentiation.cpp']]],
-  ['fibo_58',['fibo',['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f',1,'fibonacci_matrix_exponentiation.cpp']]],
-  ['fibonacci_59',['fibonacci',['../df/d76/namespacefibonacci.html',1,'fibonacci'],['../d9/d89/fibonacci_8cpp.html#aeaaf5439cb29de4630c7dff2fd914b28',1,'math::fibonacci::fibonacci()']]],
-  ['fibonacci_2ecpp_60',['fibonacci.cpp',['../d9/d89/fibonacci_8cpp.html',1,'']]],
-  ['fibonacci_5ffast_2ecpp_61',['fibonacci_fast.cpp',['../d4/d32/fibonacci__fast_8cpp.html',1,'']]],
-  ['fibonacci_5flarge_2ecpp_62',['fibonacci_large.cpp',['../de/de4/fibonacci__large_8cpp.html',1,'']]],
-  ['fibonacci_5fmatrix_5fexponentiation_2ecpp_63',['fibonacci_matrix_exponentiation.cpp',['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html',1,'']]],
-  ['fibonacci_5fsearch_64',['fibonacci_search',['../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61',1,'fibonacci_search.cpp']]],
-  ['fibonacci_5fsearch_2ecpp_65',['fibonacci_search.cpp',['../de/d0d/fibonacci__search_8cpp.html',1,'']]],
-  ['fibonacci_5fsum_66',['fibonacci_sum',['../d3/dc9/namespacefibonacci__sum.html',1,'']]],
-  ['fibonacci_5fsum_2ecpp_67',['fibonacci_sum.cpp',['../de/dc3/fibonacci__sum_8cpp.html',1,'']]],
-  ['fibosum_68',['fiboSum',['../de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742',1,'math::fibonacci_sum']]],
-  ['file_69',['FILE',['http://en.cppreference.com/w/cpp/io/c.html',0,'std']]],
-  ['file_20name_20guidelines_70',['File Name guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'']]],
-  ['filebuf_71',['filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf.html',0,'std::filebuf'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::filebuf::filebuf()']]],
-  ['fill_72',['fill',['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::fstream::fill()'],['http://en.cppreference.com/w/cpp/container/dynarray/fill.html',0,'std::dynarray::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ios::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_fstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::iostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wistream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::stringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wifstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_istream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::strstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_stringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istrstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wiostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_istringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ifstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostrstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wfstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_iostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wstringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wistringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ifstream::fill()'],['http://en.cppreference.com/w/cpp/container/array/fill.html',0,'std::array::fill()'],['http://en.cppreference.com/w/cpp/algorithm/fill.html',0,'std::fill()'],['../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780',1,'fill():&#160;decimal_to_roman_numeral.cpp']]],
-  ['fill_5fn_73',['fill_n',['http://en.cppreference.com/w/cpp/algorithm/fill_n.html',0,'std']]],
-  ['find_74',['Find',['../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8',1,'disjoint_set.cpp']]],
-  ['find_75',['find',['http://en.cppreference.com/w/cpp/string/char_traits/find.html',0,'std::char_traits::find()'],['http://en.cppreference.com/w/cpp/container/multiset/find.html',0,'std::multiset::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::string::find()'],['http://en.cppreference.com/w/cpp/container/set/find.html',0,'std::set::find()'],['http://en.cppreference.com/w/cpp/container/unordered_map/find.html',0,'std::unordered_map::find()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/find.html',0,'std::unordered_multimap::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::basic_string::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::wstring::find()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/find.html',0,'std::unordered_multiset::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::u16string::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::u32string::find()'],['http://en.cppreference.com/w/cpp/container/map/find.html',0,'std::map::find()'],['http://en.cppreference.com/w/cpp/container/unordered_set/find.html',0,'std::unordered_set::find()'],['http://en.cppreference.com/w/cpp/container/multimap/find.html',0,'std::multimap::find()'],['../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a',1,'hash_chain::find()'],['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std::find()'],['../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d',1,'quadratic_probing::find()']]],
-  ['find_5fend_76',['find_end',['http://en.cppreference.com/w/cpp/algorithm/find_end.html',0,'std']]],
-  ['find_5ffirst_5fnot_5fof_77',['find_first_not_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::basic_string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::wstring::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::u16string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::u32string::find_first_not_of()']]],
-  ['find_5ffirst_5fof_78',['find_first_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::basic_string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::wstring::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::u16string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::u32string::find_first_of()'],['http://en.cppreference.com/w/cpp/algorithm/find_first_of.html',0,'std::find_first_of(T... args)']]],
-  ['find_5fif_79',['find_if',['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std']]],
-  ['find_5fif_5fnot_80',['find_if_not',['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std']]],
-  ['find_5flast_5fnot_5fof_81',['find_last_not_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::basic_string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::wstring::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::u16string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::u32string::find_last_not_of()']]],
-  ['find_5flast_5fof_82',['find_last_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::basic_string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::wstring::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::u16string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::u32string::find_last_of()']]],
-  ['find_5fmax_83',['find_max',['../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb',1,'binary_search_tree::find_max(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)'],['../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0',1,'binary_search_tree::find_max(T &amp;ret_value)']]],
-  ['find_5fmin_84',['find_min',['../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153',1,'binary_search_tree::find_min(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)'],['../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03',1,'binary_search_tree::find_min(T &amp;ret_value)']]],
-  ['find_5fnon_5frepeating_5finteger_85',['find_non_repeating_integer',['../d2/da7/namespacefind__non__repeating__integer.html',1,'find_non_repeating_integer'],['../d6/d38/find__non__repeating__number_8cpp.html#ac5ca4c0be0967b4dd572507f50451ae3',1,'bit_manipulation::find_non_repeating_integer::find_non_repeating_integer()']]],
-  ['find_5fnon_5frepeating_5fnumber_2ecpp_86',['find_non_repeating_number.cpp',['../d6/d38/find__non__repeating__number_8cpp.html',1,'']]],
-  ['find_5fpat_5fin_5ftext_87',['find_pat_in_text',['../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8',1,'z_function.cpp']]],
-  ['find_5fset_88',['find_set',['../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e',1,'graph::disjoint_union']]],
-  ['find_5fzero_89',['find_zero',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3',1,'machine_learning::aystar_search::EightPuzzle']]],
-  ['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_90',['finding_number_of_digits_in_a_number',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1',1,'finding_number_of_digits_in_a_number.cpp']]],
-  ['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_2ecpp_91',['finding_number_of_digits_in_a_number.cpp',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html',1,'']]],
-  ['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_5fusing_5flog_92',['finding_number_of_digits_in_a_number_using_log',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49',1,'finding_number_of_digits_in_a_number.cpp']]],
-  ['findminimumedge_93',['findMinimumEdge',['../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098',1,'greedy_algorithms']]],
-  ['findminindex_94',['findMinIndex',['../d4/d9f/selection__sort__recursive_8cpp.html#a5454eeb691725ccac0f59df1e133f834',1,'sorting::selection_sort_recursive']]],
-  ['findminnode_95',['findMinNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
-  ['findnextgap_96',['FindNextGap',['../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5',1,'comb_sort.cpp']]],
-  ['findparent_97',['findParent',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]],
-  ['findset_98',['findSet',['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)'],['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)']]],
-  ['findshifttable_99',['findShiftTable',['../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336',1,'strings::horspool']]],
-  ['first_100',['first',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1',1,'data_structures::linked_list::list']]],
-  ['first_5ftest_101',['first_test',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300',1,'finding_number_of_digits_in_a_number.cpp']]],
-  ['fisher_5ff_5fdistribution_102',['fisher_f_distribution',['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution.html',0,'std::fisher_f_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/fisher_f_distribution.html',0,'std::fisher_f_distribution::fisher_f_distribution()']]],
-  ['fit_103',['fit',['../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5',1,'machine_learning::adaline::fit(const std::vector&lt; double &gt; &amp;x, const int &amp;y)'],['../d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91',1,'machine_learning::adaline::fit(std::array&lt; std::vector&lt; double &gt;, N &gt; const &amp;X, std::array&lt; int, N &gt; const &amp;Y)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0',1,'machine_learning::neural_network::NeuralNetwork::fit(const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;X_, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;Y_, const int &amp;epochs=100, const double &amp;learning_rate=0.01, const size_t &amp;batch_size=32, const bool &amp;shuffle=true)']]],
-  ['fit_5ffrom_5fcsv_104',['fit_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff',1,'machine_learning::neural_network::NeuralNetwork']]],
-  ['fit_5fols_5fregressor_105',['fit_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b',1,'ordinary_least_squares_regressor.cpp']]],
-  ['fixed_106',['fixed',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]],
-  ['flags_107',['flags',['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::fstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ostringstream::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::regex::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::basic_regex::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ios::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_fstream::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::wregex::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::iostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ios_base::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wistream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::stringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wifstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_istream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::strstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_stringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wostringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istrstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wiostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_istringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ifstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostrstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wfstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_iostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wstringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wistringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ifstream::flags()']]],
-  ['flip_108',['flip',['http://en.cppreference.com/w/cpp/utility/bitset/flip.html',0,'std::bitset']]],
-  ['floor_109',['floor',['http://en.cppreference.com/w/cpp/numeric/math/floor.html',0,'std']]],
-  ['floyd_5fcycle_5fdetection_5falgo_2ecpp_110',['floyd_cycle_detection_algo.cpp',['../db/dc4/floyd__cycle__detection__algo_8cpp.html',1,'']]],
-  ['flush_111',['flush',['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::fstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_fstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::iostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::stringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::strstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_stringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wiostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostrstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wfstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_iostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wstringstream::flush()'],['http://en.cppreference.com/w/cpp/io/manip/flush.html',0,'std::flush(T... args)']]],
-  ['fma_112',['fma',['http://en.cppreference.com/w/cpp/numeric/math/fma.html',0,'std']]],
-  ['fmax_113',['fmax',['http://en.cppreference.com/w/cpp/numeric/math/fmax.html',0,'std']]],
-  ['fmin_114',['fmin',['http://en.cppreference.com/w/cpp/numeric/math/fmin.html',0,'std']]],
-  ['fmod_115',['fmod',['http://en.cppreference.com/w/cpp/numeric/math/fmod.html',0,'std']]],
-  ['fopen_116',['fopen',['http://en.cppreference.com/w/cpp/io/c/fopen.html',0,'std']]],
-  ['for_20reviewers_20and_20maintainers_117',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]],
-  ['for_5feach_118',['for_each',['http://en.cppreference.com/w/cpp/algorithm/for_each.html',0,'std']]],
-  ['format_119',['format',['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::match_results::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::wsmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::smatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::wcmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::cmatch::format()']]],
-  ['formatter_120',['Code Formatter',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md39',1,'']]],
-  ['forward_121',['forward',['../d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e',1,'data_structures::Node::forward'],['http://en.cppreference.com/w/cpp/utility/forward.html',0,'std::forward(T... args)']]],
-  ['forward_5fas_5ftuple_122',['forward_as_tuple',['http://en.cppreference.com/w/cpp/utility/tuple/forward_as_tuple.html',0,'std']]],
-  ['forward_5feuler_123',['forward_euler',['../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9',1,'ode_forward_euler.cpp']]],
-  ['forward_5feuler_5fstep_124',['forward_euler_step',['../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723',1,'ode_forward_euler.cpp']]],
-  ['forward_5fiterator_5ftag_125',['forward_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]],
-  ['forward_5flist_126',['forward_list',['http://en.cppreference.com/w/cpp/container/forward_list.html',0,'std::forward_list&lt; T &gt;'],['http://en.cppreference.com/w/cpp/container/forward_list/forward_list.html',0,'std::forward_list::forward_list()']]],
-  ['fpclassify_127',['fpclassify',['http://en.cppreference.com/w/cpp/numeric/math/fpclassify.html',0,'std']]],
-  ['fpos_128',['fpos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]],
-  ['fpos_5ft_129',['fpos_t',['http://en.cppreference.com/w/cpp/io/c.html',0,'std']]],
-  ['fprintf_130',['fprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]],
-  ['fputc_131',['fputc',['http://en.cppreference.com/w/cpp/io/c/fputc.html',0,'std']]],
-  ['fputs_132',['fputs',['http://en.cppreference.com/w/cpp/io/c/fputs.html',0,'std']]],
-  ['fputwc_133',['fputwc',['http://en.cppreference.com/w/cpp/io/c/fputwc.html',0,'std']]],
-  ['fputws_134',['fputws',['http://en.cppreference.com/w/cpp/io/c/fputws.html',0,'std']]],
-  ['frac_5fdigits_135',['frac_digits',['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct_byname::frac_digits()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct::frac_digits()']]],
-  ['fread_136',['fread',['http://en.cppreference.com/w/cpp/io/c/fread.html',0,'std']]],
-  ['free_137',['free',['http://en.cppreference.com/w/cpp/memory/c/free.html',0,'std']]],
-  ['freenode_138',['freeNode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02',1,'linkedlist_implentation_usingarray.cpp']]],
-  ['freeze_139',['freeze',['http://en.cppreference.com/w/cpp/io/strstreambuf/freeze.html',0,'std::strstreambuf::freeze()'],['http://en.cppreference.com/w/cpp/io/strstream/freeze.html',0,'std::strstream::freeze()'],['http://en.cppreference.com/w/cpp/io/ostrstream/freeze.html',0,'std::ostrstream::freeze()']]],
-  ['freopen_140',['freopen',['http://en.cppreference.com/w/cpp/io/c/freopen.html',0,'std']]],
-  ['freq_5fmap_141',['freq_map',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2',1,'others::Cache::LFUCache']]],
-  ['frexp_142',['frexp',['http://en.cppreference.com/w/cpp/numeric/math/frexp.html',0,'std']]],
-  ['from_20the_20root_20node_143',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]],
-  ['from_5fbytes_144',['from_bytes',['http://en.cppreference.com/w/cpp/locale/wstring_convert/from_bytes.html',0,'std::wstring_convert']]],
-  ['from_5ftime_5ft_145',['from_time_t',['http://en.cppreference.com/w/cpp/chrono/system_clock/from_time_t.html',0,'std::chrono::system_clock']]],
-  ['front_146',['front',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e',1,'data_structures::queue_using_array::Queue_Array::front'],['http://en.cppreference.com/w/cpp/container/dynarray/front.html',0,'std::dynarray::front()'],['http://en.cppreference.com/w/cpp/container/vector/front.html',0,'std::vector::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::string::front()'],['http://en.cppreference.com/w/cpp/container/forward_list/front.html',0,'std::forward_list::front()'],['http://en.cppreference.com/w/cpp/container/deque/front.html',0,'std::deque::front()'],['http://en.cppreference.com/w/cpp/container/queue/front.html',0,'std::queue::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::basic_string::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::wstring::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::u16string::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::u32string::front()'],['http://en.cppreference.com/w/cpp/container/list/front.html',0,'std::list::front()'],['http://en.cppreference.com/w/cpp/container/array/front.html',0,'std::array::front()'],['../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7',1,'queue::front()']]],
-  ['front_5finsert_5fiterator_147',['front_insert_iterator',['http://en.cppreference.com/w/cpp/iterator/front_insert_iterator.html',0,'std']]],
-  ['front_5finserter_148',['front_inserter',['http://en.cppreference.com/w/cpp/iterator/front_inserter.html',0,'std']]],
-  ['fscanf_149',['fscanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]],
-  ['fseek_150',['fseek',['http://en.cppreference.com/w/cpp/io/c/fseek.html',0,'std']]],
-  ['fsetpos_151',['fsetpos',['http://en.cppreference.com/w/cpp/io/c/fsetpos.html',0,'std']]],
-  ['fstream_152',['fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std::fstream'],['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::fstream::fstream()']]],
-  ['ftell_153',['ftell',['http://en.cppreference.com/w/cpp/io/c/ftell.html',0,'std']]],
-  ['full_154',['full',['../d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1',1,'data_structures::Stack']]],
-  ['function_155',['function',['http://en.cppreference.com/w/cpp/utility/functional/function.html',0,'std::function'],['http://en.cppreference.com/w/cpp/utility/functional/function/function.html',0,'std::function::function()']]],
-  ['future_156',['future',['http://en.cppreference.com/w/cpp/thread/future.html',0,'std::future'],['http://en.cppreference.com/w/cpp/thread/future/future.html',0,'std::future::future()']]],
-  ['future_5fcategory_157',['future_category',['http://en.cppreference.com/w/cpp/thread/future/future_category.html',0,'std']]],
-  ['future_5ferror_158',['future_error',['http://en.cppreference.com/w/cpp/thread/future_error.html',0,'std::future_error'],['http://en.cppreference.com/w/cpp/thread/future_error/future_error.html',0,'std::future_error::future_error()']]],
-  ['fwprintf_159',['fwprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]],
-  ['fwrite_160',['fwrite',['http://en.cppreference.com/w/cpp/io/c/fwrite.html',0,'std']]],
-  ['fwscanf_161',['fwscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]]
+  ['fac_1',['fac',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a738a5f59bb3560c81cdb7f43bcfe9fec',1,'math::ncr_modulo_p::NCRModuloP']]],
+  ['fact_2',['fact',['../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a',1,'poisson_dist.cpp']]],
+  ['factorial_3',['factorial',['../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a',1,'math']]],
+  ['factorial_2ecpp_4',['factorial.cpp',['../d9/d00/factorial_8cpp.html',1,'']]],
+  ['factorization_5',['Prime factorization',['../d7/d7f/section.html',1,'']]],
+  ['factors_6',['factors',['../db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b',1,'prime_factorization.cpp']]],
+  ['false_5fposition_7',['false_position',['../df/dea/namespacefalse__position.html',1,'']]],
+  ['false_5fposition_2ecpp_8',['false_position.cpp',['../dd/d29/false__position_8cpp.html',1,'']]],
+  ['fast_5ffourier_5ftransform_2ecpp_9',['fast_fourier_transform.cpp',['../d8/d9a/fast__fourier__transform_8cpp.html',1,'']]],
+  ['fast_5finteger_5finput_2ecpp_10',['fast_integer_input.cpp',['../d9/df0/fast__integer__input_8cpp.html',1,'']]],
+  ['fast_5finvsqrt_11',['Fast_InvSqrt',['../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52',1,'inv_sqrt.cpp']]],
+  ['fast_5fpower_2ecpp_12',['fast_power.cpp',['../d2/d0b/fast__power_8cpp.html',1,'']]],
+  ['fast_5fpower_5flinear_13',['fast_power_linear',['../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d',1,'fast_power.cpp']]],
+  ['fast_5fpower_5frecursive_14',['fast_power_recursive',['../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445',1,'fast_power.cpp']]],
+  ['fastfouriertransform_15',['FastFourierTransform',['../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150',1,'numerical_methods']]],
+  ['fastinput_16',['fastinput',['../d9/df0/fast__integer__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82',1,'fast_integer_input.cpp']]],
+  ['fcfs_17',['FCFS',['../dd/dca/class_f_c_f_s.html',1,'']]],
+  ['fcfs_5fscheduling_2ecpp_18',['fcfs_scheduling.cpp',['../df/d47/fcfs__scheduling_8cpp.html',1,'']]],
+  ['features_19',['Features',['../index.html#autotoc_md104',1,'']]],
+  ['fenwick_5ftree_20',['fenwick_tree',['../de/d0d/classrange__queries_1_1fenwick__tree.html',1,'range_queries::fenwick_tree'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#a5ea37183524553bbf2234a36a44a4b9a',1,'range_queries::fenwick_tree::fenwick_tree(const std::vector&lt; T &gt; &amp;arr)'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c',1,'range_queries::fenwick_tree::fenwick_tree(T x)']]],
+  ['fenwick_5ftree_2ecpp_21',['fenwick_tree.cpp',['../d6/d2e/fenwick__tree_8cpp.html',1,'']]],
+  ['fib_22',['fib',['../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f',1,'fib(uint64_t n):&#160;fibonacci_fast.cpp'],['../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db',1,'fib(uint64_t n):&#160;fibonacci_large.cpp']]],
+  ['fib_5faccurate_23',['fib_Accurate',['../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca',1,'string_fibonacci.cpp']]],
+  ['fib_5fb_24',['fib_b',['../d7/d35/matrix__exponentiation_8cpp.html#a35b7c98af53ad2ec18658679ad7d43de',1,'matrix_exponentiation.cpp']]],
+  ['fibo_25',['fibo',['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f',1,'fibonacci_matrix_exponentiation.cpp']]],
+  ['fibonacci_26',['fibonacci',['../df/d76/namespacefibonacci.html',1,'fibonacci'],['../d9/d89/fibonacci_8cpp.html#aeaaf5439cb29de4630c7dff2fd914b28',1,'math::fibonacci::fibonacci()']]],
+  ['fibonacci_2ecpp_27',['fibonacci.cpp',['../d9/d89/fibonacci_8cpp.html',1,'']]],
+  ['fibonacci_5ffast_2ecpp_28',['fibonacci_fast.cpp',['../d4/d32/fibonacci__fast_8cpp.html',1,'']]],
+  ['fibonacci_5flarge_2ecpp_29',['fibonacci_large.cpp',['../de/de4/fibonacci__large_8cpp.html',1,'']]],
+  ['fibonacci_5fmatrix_5fexponentiation_2ecpp_30',['fibonacci_matrix_exponentiation.cpp',['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html',1,'']]],
+  ['fibonacci_5fsearch_31',['fibonacci_search',['../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61',1,'fibonacci_search.cpp']]],
+  ['fibonacci_5fsearch_2ecpp_32',['fibonacci_search.cpp',['../de/d0d/fibonacci__search_8cpp.html',1,'']]],
+  ['fibonacci_5fsum_33',['fibonacci_sum',['../d3/dc9/namespacefibonacci__sum.html',1,'']]],
+  ['fibonacci_5fsum_2ecpp_34',['fibonacci_sum.cpp',['../de/dc3/fibonacci__sum_8cpp.html',1,'']]],
+  ['fibosum_35',['fiboSum',['../de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742',1,'math::fibonacci_sum']]],
+  ['file_20name_20guidelines_36',['File Name guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'']]],
+  ['fill_37',['fill',['../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780',1,'decimal_to_roman_numeral.cpp']]],
+  ['find_38',['Find',['../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8',1,'disjoint_set.cpp']]],
+  ['find_39',['find',['../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a',1,'hash_chain::find()'],['../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d',1,'quadratic_probing::find()']]],
+  ['find_5fmax_40',['find_max',['../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb',1,'binary_search_tree::find_max(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)'],['../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0',1,'binary_search_tree::find_max(T &amp;ret_value)']]],
+  ['find_5fmin_41',['find_min',['../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153',1,'binary_search_tree::find_min(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)'],['../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03',1,'binary_search_tree::find_min(T &amp;ret_value)']]],
+  ['find_5fnon_5frepeating_5finteger_42',['find_non_repeating_integer',['../d2/da7/namespacefind__non__repeating__integer.html',1,'find_non_repeating_integer'],['../d6/d38/find__non__repeating__number_8cpp.html#ac5ca4c0be0967b4dd572507f50451ae3',1,'bit_manipulation::find_non_repeating_integer::find_non_repeating_integer()']]],
+  ['find_5fnon_5frepeating_5fnumber_2ecpp_43',['find_non_repeating_number.cpp',['../d6/d38/find__non__repeating__number_8cpp.html',1,'']]],
+  ['find_5fpat_5fin_5ftext_44',['find_pat_in_text',['../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8',1,'z_function.cpp']]],
+  ['find_5fset_45',['find_set',['../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e',1,'graph::disjoint_union']]],
+  ['find_5fzero_46',['find_zero',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3',1,'machine_learning::aystar_search::EightPuzzle']]],
+  ['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_47',['finding_number_of_digits_in_a_number',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1',1,'finding_number_of_digits_in_a_number.cpp']]],
+  ['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_2ecpp_48',['finding_number_of_digits_in_a_number.cpp',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html',1,'']]],
+  ['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_5fusing_5flog_49',['finding_number_of_digits_in_a_number_using_log',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49',1,'finding_number_of_digits_in_a_number.cpp']]],
+  ['findminimumedge_50',['findMinimumEdge',['../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098',1,'greedy_algorithms']]],
+  ['findminindex_51',['findMinIndex',['../d4/d9f/selection__sort__recursive_8cpp.html#a5454eeb691725ccac0f59df1e133f834',1,'sorting::selection_sort_recursive']]],
+  ['findminnode_52',['findMinNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
+  ['findnextgap_53',['FindNextGap',['../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5',1,'comb_sort.cpp']]],
+  ['findparent_54',['findParent',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]],
+  ['findset_55',['findSet',['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)'],['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)']]],
+  ['findshifttable_56',['findShiftTable',['../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336',1,'strings::horspool']]],
+  ['first_57',['first',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1',1,'data_structures::linked_list::list']]],
+  ['first_5ftest_58',['first_test',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300',1,'finding_number_of_digits_in_a_number.cpp']]],
+  ['fit_59',['fit',['../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5',1,'machine_learning::adaline::fit(const std::vector&lt; double &gt; &amp;x, const int &amp;y)'],['../d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91',1,'machine_learning::adaline::fit(std::array&lt; std::vector&lt; double &gt;, N &gt; const &amp;X, std::array&lt; int, N &gt; const &amp;Y)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0',1,'machine_learning::neural_network::NeuralNetwork::fit(const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;X_, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;Y_, const int &amp;epochs=100, const double &amp;learning_rate=0.01, const size_t &amp;batch_size=32, const bool &amp;shuffle=true)']]],
+  ['fit_5ffrom_5fcsv_60',['fit_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff',1,'machine_learning::neural_network::NeuralNetwork']]],
+  ['fit_5fols_5fregressor_61',['fit_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b',1,'ordinary_least_squares_regressor.cpp']]],
+  ['floyd_5fcycle_5fdetection_5falgo_2ecpp_62',['floyd_cycle_detection_algo.cpp',['../db/dc4/floyd__cycle__detection__algo_8cpp.html',1,'']]],
+  ['for_20reviewers_20and_20maintainers_63',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]],
+  ['formatter_64',['Code Formatter',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md39',1,'']]],
+  ['forward_65',['forward',['../d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e',1,'data_structures::Node']]],
+  ['forward_5feuler_66',['forward_euler',['../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9',1,'ode_forward_euler.cpp']]],
+  ['forward_5feuler_5fstep_67',['forward_euler_step',['../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723',1,'ode_forward_euler.cpp']]],
+  ['freenode_68',['freeNode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02',1,'linkedlist_implentation_usingarray.cpp']]],
+  ['freq_5fmap_69',['freq_map',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#aba5d59d0f6ab0c0d30a92551ca5a05f2',1,'others::Cache::LFUCache']]],
+  ['from_20the_20root_20node_70',['Method 2: Search from the root node',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md92',1,'']]],
+  ['front_71',['front',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e',1,'data_structures::queue_using_array::Queue_Array::front'],['../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7',1,'queue::front()']]],
+  ['full_72',['full',['../d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1',1,'data_structures::Stack']]]
 ];
diff --git a/search/all_c.js b/search/all_c.js
index 0748749ef..85c3e43db 100644
--- a/search/all_c.js
+++ b/search/all_c.js
@@ -6,153 +6,117 @@ var searchData=
   ['games_3',['Games',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md52',1,'']]],
   ['games_4',['games',['../da/d9c/namespacegames.html',1,'']]],
   ['games_3a_3amemory_5fgame_5',['memory_game',['../d8/d41/namespacegames_1_1memory__game.html',1,'games']]],
-  ['gamma_5fdistribution_6',['gamma_distribution',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution.html',0,'std::gamma_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/gamma_distribution.html',0,'std::gamma_distribution::gamma_distribution()']]],
-  ['gaussian_5felimination_2ecpp_7',['gaussian_elimination.cpp',['../d0/de2/gaussian__elimination_8cpp.html',1,'']]],
-  ['gbump_8',['gbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wfilebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::strstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_streambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::streambuf::gbump()']]],
-  ['gcd_9',['gcd',['../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0',1,'ciphers::HillCipher::gcd()'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd():&#160;gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532',1,'math::gcd_of_n_numbers::gcd()'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2):&#160;gcd_recursive_euclidean.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563',1,'gcd(unsigned int x, unsigned int y):&#160;least_common_multiple.cpp']]],
-  ['gcd_5fiterative_5feuclidean_2ecpp_10',['gcd_iterative_euclidean.cpp',['../d4/da0/gcd__iterative__euclidean_8cpp.html',1,'']]],
-  ['gcd_5fof_5fn_5fnumbers_11',['gcd_of_n_numbers',['../d2/ddb/namespacegcd__of__n__numbers.html',1,'']]],
-  ['gcd_5fof_5fn_5fnumbers_2ecpp_12',['gcd_of_n_numbers.cpp',['../d1/d11/gcd__of__n__numbers_8cpp.html',1,'']]],
-  ['gcd_5frecursive_5feuclidean_2ecpp_13',['gcd_recursive_euclidean.cpp',['../d4/d45/gcd__recursive__euclidean_8cpp.html',1,'']]],
-  ['gcd_5ftwo_14',['gcd_two',['../d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181',1,'math::gcd_of_n_numbers']]],
-  ['gcdextended_15',['gcdExtended',['../de/dab/ncr__modulo__p_8cpp.html#a9010ad5669d31449c3bf3271ab5ebc86',1,'math::ncr_modulo_p::utils']]],
-  ['gcount_16',['gcount',['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::strstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istrstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wiostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_ifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wfstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wstringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::ifstream::gcount()']]],
-  ['genarray_17',['genArray',['../db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5',1,'spiral_print.cpp']]],
-  ['generate_18',['generate',['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/generate.html',0,'std::seed_seq::generate()'],['../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160',1,'backtracking::generate_parentheses::generate()'],['http://en.cppreference.com/w/cpp/algorithm/generate.html',0,'std::generate(T... args)']]],
-  ['generate_5fcanonical_19',['generate_canonical',['http://en.cppreference.com/w/cpp/numeric/random/generate_canonical.html',0,'std']]],
-  ['generate_5fdecryption_5fkey_20',['generate_decryption_key',['../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706',1,'ciphers::HillCipher']]],
-  ['generate_5fencryption_5fkey_21',['generate_encryption_key',['../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e',1,'ciphers::HillCipher']]],
-  ['generate_5fkeys_22',['generate_keys',['../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5',1,'ciphers::HillCipher']]],
-  ['generate_5fn_23',['generate_n',['http://en.cppreference.com/w/cpp/algorithm/generate_n.html',0,'std']]],
-  ['generate_5fparentheses_24',['generate_parentheses',['../df/de5/classbacktracking_1_1generate__parentheses.html',1,'backtracking']]],
-  ['generate_5fparentheses_2ecpp_25',['generate_parentheses.cpp',['../dd/d1e/generate__parentheses_8cpp.html',1,'']]],
-  ['generate_5fpossible_5fmoves_26',['generate_possible_moves',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658',1,'machine_learning::aystar_search::EightPuzzle']]],
-  ['generate_5fsamples_27',['generate_samples',['../db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf',1,'math::monte_carlo']]],
-  ['generate_5funiform_28',['generate_uniform',['../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba',1,'probability::geometric_dist']]],
-  ['generateunsortedarray_29',['generateUnsortedArray',['../d1/daa/random__pivot__quick__sort_8cpp.html#a40675d2eb960c71ca31ec475ba90120d',1,'sorting::random_pivot_quick_sort']]],
-  ['generic_5fcategory_30',['generic_category',['http://en.cppreference.com/w/cpp/error/generic_category.html',0,'std']]],
-  ['geometric_5fdist_31',['geometric_dist',['../dd/d8a/namespacegeometric__dist.html',1,'']]],
-  ['geometric_5fdist_2ecpp_32',['geometric_dist.cpp',['../de/d72/geometric__dist_8cpp.html',1,'']]],
-  ['geometric_5fdistribution_33',['geometric_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html',1,'probability::geometric_dist::geometric_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution.html',0,'std::geometric_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/geometric_distribution.html',0,'std::geometric_distribution::geometric_distribution()'],['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797',1,'probability::geometric_dist::geometric_distribution::geometric_distribution()']]],
-  ['geometry_34',['Geometry',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53',1,'']]],
-  ['geometry_35',['geometry',['../d5/d5f/namespacegeometry.html',1,'']]],
-  ['get_36',['get',['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::fstream::get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::get()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html',0,'std::shared_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_fstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::iostream::get()'],['http://en.cppreference.com/w/cpp/thread/shared_future/get.html',0,'std::shared_future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::stringstream::get()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html',0,'std::unique_ptr::get()'],['http://en.cppreference.com/w/cpp/thread/future/get.html',0,'std::future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wifstream::get()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/get.html',0,'std::reference_wrapper::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::strstream::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_stringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istrstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wiostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_ifstream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istringstream::get()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/get.html',0,'std::auto_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wfstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_iostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wstringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::ifstream::get()'],['../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a',1,'dsu::get()'],['../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8',1,'catalan_numbers::get()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420',1,'machine_learning::aystar_search::EightPuzzle::get()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781',1,'others::Cache::LFUCache::get()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea',1,'others::Cache::LRUCache::get()']]],
-  ['get_5fall_5fwords_37',['get_all_words',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd',1,'data_structures::trie_using_hashmap::Trie']]],
-  ['get_5fallocator_38',['get_allocator',['http://en.cppreference.com/w/cpp/container/vector/get_allocator.html',0,'std::vector::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::match_results::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multiset/get_allocator.html',0,'std::multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/set/get_allocator.html',0,'std::set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_map/get_allocator.html',0,'std::unordered_map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wsmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::smatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/get_allocator.html',0,'std::unordered_multimap::get_allocator()'],['http://en.cppreference.com/w/cpp/container/forward_list/get_allocator.html',0,'std::forward_list::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wcmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/deque/get_allocator.html',0,'std::deque::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::basic_string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::wstring::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/get_allocator.html',0,'std::unordered_multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u16string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u32string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/list/get_allocator.html',0,'std::list::get_allocator()'],['http://en.cppreference.com/w/cpp/container/map/get_allocator.html',0,'std::map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::cmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_set/get_allocator.html',0,'std::unordered_set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multimap/get_allocator.html',0,'std::multimap::get_allocator()']]],
-  ['get_5fchar_39',['get_char',['../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da',1,'hashing::sha256']]],
-  ['get_5fchar_5fidx_40',['get_char_idx',['../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41',1,'ciphers::HillCipher']]],
-  ['get_5fclock_5fdiff_41',['get_clock_diff',['../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_trace.cpp']]],
-  ['get_5fdate_42',['get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::get_date()']]],
-  ['get_5fdeleter_43',['get_deleter',['http://en.cppreference.com/w/cpp/memory/unique_ptr/get_deleter.html',0,'std::unique_ptr']]],
-  ['get_5felements_5finorder_44',['get_elements_inorder',['../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a',1,'binary_search_tree']]],
-  ['get_5felements_5fpostorder_45',['get_elements_postorder',['../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff',1,'binary_search_tree']]],
-  ['get_5felements_5fpreorder_46',['get_elements_preorder',['../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13',1,'binary_search_tree']]],
-  ['get_5ffinal_5fstatus_47',['get_final_status',['../df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86',1,'fcfs_scheduling.cpp']]],
-  ['get_5ffuture_48',['get_future',['http://en.cppreference.com/w/cpp/thread/promise/get_future.html',0,'std::promise::get_future()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/get_future.html',0,'std::packaged_task::get_future()']]],
-  ['get_5fid_49',['get_id',['http://en.cppreference.com/w/cpp/thread/thread/get_id.html',0,'std::thread::get_id()'],['http://en.cppreference.com/w/cpp/thread/get_id.html',0,'std::this_thread::get_id()']]],
-  ['get_5fidx_5fchar_50',['get_idx_char',['../d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c',1,'ciphers::HillCipher']]],
-  ['get_5finput_51',['get_input',['../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1',1,'ternary_search.cpp']]],
-  ['get_5fintersection_52',['get_intersection',['../da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e',1,'operations_on_datastructures']]],
-  ['get_5finverse_53',['get_inverse',['../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7',1,'ciphers::HillCipher::get_inverse()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a',1,'get_inverse():&#160;ordinary_least_squares_regressor.cpp']]],
-  ['get_5fk_5fth_54',['get_k_th',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69',1,'data_structures::treap::Treap']]],
-  ['get_5flevel_5forder_55',['get_level_order',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree']]],
-  ['get_5fmax_56',['get_max',['../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde',1,'dsu']]],
-  ['get_5fmin_57',['get_min',['../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415',1,'dsu']]],
-  ['get_5fmin_5f2d_58',['get_min_2d',['../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e',1,'kohonen_som_topology.cpp']]],
-  ['get_5fminima_59',['get_minima',['../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b):&#160;brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b):&#160;golden_search_extrema.cpp']]],
-  ['get_5fmoney_60',['get_money',['http://en.cppreference.com/w/cpp/io/manip/get_money.html',0,'std']]],
-  ['get_5fmonthname_61',['get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::get_monthname()']]],
-  ['get_5fnew_5fhandler_62',['get_new_handler',['http://en.cppreference.com/w/cpp/memory/new/get_new_handler.html',0,'std']]],
-  ['get_5fnext_63',['get_next',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4',1,'data_structures::treap::Treap']]],
-  ['get_5fpointer_5fsafety_64',['get_pointer_safety',['http://en.cppreference.com/w/cpp/memory/gc/get_pointer_safety.html',0,'std']]],
-  ['get_5fpredecessor_65',['get_predecessor',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126',1,'data_structures::treap::Treap']]],
-  ['get_5frand_66',['get_rand',['../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0',1,'complex_numbers.cpp']]],
-  ['get_5frank_67',['get_rank',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039',1,'data_structures::treap::Treap']]],
-  ['get_5fshape_68',['get_shape',['../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078',1,'machine_learning']]],
-  ['get_5fsize_69',['get_size',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f',1,'machine_learning::aystar_search::EightPuzzle']]],
-  ['get_5fstate_70',['get_state',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99',1,'machine_learning::aystar_search::EightPuzzle']]],
-  ['get_5ftemporary_5fbuffer_71',['get_temporary_buffer',['http://en.cppreference.com/w/cpp/memory/get_temporary_buffer.html',0,'std']]],
-  ['get_5fterminate_72',['get_terminate',['http://en.cppreference.com/w/cpp/error/get_terminate.html',0,'std']]],
-  ['get_5ftest_5fcases_73',['get_test_cases',['../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c',1,'longest_common_string.cpp']]],
-  ['get_5ftime_74',['get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::get_time()'],['http://en.cppreference.com/w/cpp/io/manip/get_time.html',0,'std::get_time()']]],
-  ['get_5ftranspose_75',['get_transpose',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb',1,'ordinary_least_squares_regressor.cpp']]],
-  ['get_5funexpected_76',['get_unexpected',['http://en.cppreference.com/w/cpp/error/get_unexpected.html',0,'std']]],
-  ['get_5funion_77',['get_union',['../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74',1,'operations_on_datastructures']]],
-  ['get_5fweekday_78',['get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::get_weekday()']]],
-  ['get_5fxy_5ffrom_5fcsv_79',['get_XY_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d',1,'machine_learning::neural_network::NeuralNetwork']]],
-  ['get_5fyear_80',['get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::get_year()']]],
-  ['getadjacencylist_81',['getAdjacencyList',['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a5e84b175ef768ff58eaeededd43e8368',1,'graph::topological_sort::Graph']]],
-  ['getadjlist_82',['getAdjList',['../da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d',1,'Graph']]],
-  ['getbalance_83',['getBalance',['../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546',1,'avltree.cpp']]],
-  ['getc_84',['getc',['http://en.cppreference.com/w/cpp/io/c/fgetc.html',0,'std']]],
-  ['getchar_85',['getchar',['http://en.cppreference.com/w/cpp/io/c/getchar.html',0,'std']]],
-  ['getchild_86',['GetChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4',1,'data_structures::tree_234::Node']]],
-  ['getchildindex_87',['GetChildIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad632a0440295bc88ceadae7478fe0d37',1,'data_structures::tree_234::Node']]],
-  ['getconnectedcomponents_88',['getConnectedComponents',['../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b',1,'graph']]],
-  ['getconvexhull_89',['getConvexHull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1',1,'geometry::jarvis::Convexhull']]],
-  ['getcount_90',['GetCount',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06',1,'data_structures::tree_234::Node']]],
-  ['getenv_91',['getenv',['http://en.cppreference.com/w/cpp/utility/program/getenv.html',0,'std']]],
-  ['getfailurearray_92',['getFailureArray',['../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9',1,'string_search']]],
-  ['gethits_93',['getHits',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933',1,'others::lru_cache::LRUCache']]],
-  ['getinordersuccessor_94',['getInorderSuccessor',['../d4/d32/inorder__successor__of__bst_8cpp.html#a3923fb22b46e085376703cae0b44d690',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
-  ['getitem_95',['GetItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3',1,'data_structures::tree_234::Node']]],
-  ['getitemindex_96',['GetItemIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a650f0ef26b7450e1addb5d80bb0ed629',1,'data_structures::tree_234::Node']]],
-  ['getitemleftchild_97',['GetItemLeftChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab654d7376d3449fdc78edab0e7fed06e',1,'data_structures::tree_234::Node']]],
-  ['getitemrightchild_98',['GetItemRightChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a441cbee9896391f2b167d5aa7b4f8c95',1,'data_structures::tree_234::Node']]],
-  ['getleftmostchild_99',['GetLeftmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e',1,'data_structures::tree_234::Node']]],
-  ['getline_100',['getline',['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::strstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istrstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wiostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_ifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wfstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wstringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::ifstream::getline()'],['http://en.cppreference.com/w/cpp/string/basic_string/getline.html',0,'std::getline()']]],
-  ['getloc_101',['getloc',['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::regex::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::basic_regex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ios::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::wregex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wfilebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ios_base::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::strstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wifstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/getloc.html',0,'std::regex_traits::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::strstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wiostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ifstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wfstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wstringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ifstream::getloc()']]],
-  ['getmaxitem_102',['GetMaxItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57',1,'data_structures::tree_234::Node']]],
-  ['getmedian_103',['getMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d',1,'probability::windowed_median::WindowedMedian']]],
-  ['getmediannaive_104',['getMedianNaive',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6',1,'probability::windowed_median::WindowedMedian']]],
-  ['getmin_105',['getMin',['../d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130',1,'MinHeap']]],
-  ['getminitem_106',['GetMinItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71',1,'data_structures::tree_234::Node']]],
-  ['getnextpossiblechild_107',['GetNextPossibleChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46',1,'data_structures::tree_234::Node']]],
-  ['getnode_108',['getNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
-  ['getnode_109',['getnode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be',1,'linkedlist_implentation_usingarray.cpp']]],
-  ['getnumnodes_110',['getNumNodes',['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#ad22018e4f4f80aecb0538044bb83d096',1,'graph::topological_sort::Graph']]],
-  ['getpagefault_111',['getPageFault',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2',1,'others::lru_cache::LRUCache']]],
-  ['getparents_112',['getParents',['../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280',1,'dsu']]],
-  ['getrandomindex_113',['getRandomIndex',['../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5',1,'sorting::random_pivot_quick_sort']]],
-  ['getrightmostchild_114',['GetRightmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94',1,'data_structures::tree_234::Node']]],
-  ['gets_115',['gets',['http://en.cppreference.com/w/cpp/io/c/gets.html',0,'std']]],
-  ['gettreemaxitem_116',['GetTreeMaxItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657',1,'data_structures::tree_234::Tree234']]],
-  ['gettreeminitem_117',['GetTreeMinItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36',1,'data_structures::tree_234::Tree234']]],
-  ['getvertices_118',['getVertices',['../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1',1,'Graph']]],
-  ['getwchar_119',['getwchar',['http://en.cppreference.com/w/cpp/io/c/getwchar.html',0,'std']]],
-  ['giga_120',['giga',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['github_20actions_121',['GitHub Actions',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md40',1,'']]],
-  ['given_20node_20does_20not_20have_20a_20right_20node_20subtree_122',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]],
-  ['given_20node_20has_20the_20right_20node_20subtree_123',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]],
-  ['global_124',['global',['http://en.cppreference.com/w/cpp/locale/locale/global.html',0,'std::locale']]],
-  ['gmtime_125',['gmtime',['http://en.cppreference.com/w/cpp/chrono/c/gmtime.html',0,'std']]],
-  ['gnome_5fsort_2ecpp_126',['gnome_sort.cpp',['../d2/d21/gnome__sort_8cpp.html',1,'']]],
-  ['gnomesort_127',['gnomeSort',['../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1',1,'sorting::gnomeSort(T *arr, int size)'],['../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935',1,'sorting::gnomeSort(std::array&lt; T, size &gt; arr)']]],
-  ['golden_5fsearch_5fextrema_2ecpp_128',['golden_search_extrema.cpp',['../d6/d7a/golden__search__extrema_8cpp.html',1,'']]],
-  ['good_129',['good',['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ios::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::strstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wiostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wfstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wstringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ifstream::good()']]],
-  ['good_5fsuffix_130',['good_suffix',['../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e',1,'strings::boyer_moore::pattern']]],
-  ['gptr_131',['gptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::gptr()']]],
-  ['gram_5fschmidt_132',['gram_schmidt',['../d4/d0f/namespacegram__schmidt.html',1,'gram_schmidt'],['../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5',1,'numerical_methods::gram_schmidt::gram_schmidt()']]],
-  ['gram_5fschmidt_2ecpp_133',['gram_schmidt.cpp',['../d5/d33/gram__schmidt_8cpp.html',1,'']]],
-  ['graph_134',['Graph',['../da/d9a/class_graph.html',1,'Graph'],['../dc/d61/classgraph_1_1_graph.html',1,'graph::Graph&lt; T &gt;'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html',1,'graph::is_graph_bipartite::Graph'],['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html',1,'graph::topological_sort::Graph'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html',1,'greedy_algorithms::dijkstra::Graph'],['../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d',1,'Graph::Graph(unsigned int vertices, AdjList adjList)'],['../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3',1,'Graph::Graph(unsigned int vertices, AdjList &amp;&amp;adjList)'],['../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1',1,'Graph::Graph(unsigned int vertices, std::vector&lt; Edge &gt; const &amp;edges)'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3',1,'graph::is_graph_bipartite::Graph::Graph()'],['../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5',1,'graph::Graph::Graph()'],['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a75a849f80a66304e7da39b3ccd6129d6',1,'graph::topological_sort::Graph::Graph()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc',1,'greedy_algorithms::dijkstra::Graph::Graph()'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54',1,'Graph']]],
-  ['graph_135',['graph',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md77',1,'Bipartite graph'],['../df/dce/namespacegraph.html',1,'graph']]],
-  ['graph_5fcoloring_136',['graph_coloring',['../d7/d08/namespacegraph__coloring.html',1,'']]],
-  ['graph_5fcoloring_2ecpp_137',['graph_coloring.cpp',['../d3/d40/graph__coloring_8cpp.html',1,'']]],
-  ['graphcoloring_138',['graphColoring',['../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c',1,'backtracking::graph_coloring']]],
-  ['graphics_139',['Graphics',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55',1,'']]],
-  ['gray_5fcode_140',['gray_code',['../de/d9b/namespacegray__code.html',1,'']]],
-  ['greater_141',['greater',['http://en.cppreference.com/w/cpp/utility/functional/greater.html',0,'std']]],
-  ['greater_5fequal_142',['greater_equal',['http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html',0,'std']]],
-  ['greedy_20algorithms_143',['Greedy Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56',1,'']]],
-  ['greedy_5falgorithms_144',['greedy_algorithms',['../d2/d90/namespacegreedy__algorithms.html',1,'']]],
-  ['greedy_5falgorithms_3a_3adijkstra_145',['dijkstra',['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html',1,'greedy_algorithms']]],
-  ['greedy_5falgorithms_3a_3astable_5fmatching_146',['stable_matching',['../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html',1,'greedy_algorithms']]],
-  ['grey_147',['GREY',['../da/d4b/depth__first__search__with__stack_8cpp.html#a43e30173f12330e85cce6239a277527e',1,'depth_first_search_with_stack.cpp']]],
-  ['ground_5fto_5fground_5fprojectile_5fmotion_148',['ground_to_ground_projectile_motion',['../d0/d20/namespaceground__to__ground__projectile__motion.html',1,'']]],
-  ['ground_5fto_5fground_5fprojectile_5fmotion_2ecpp_149',['ground_to_ground_projectile_motion.cpp',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html',1,'']]],
-  ['grouping_150',['grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::grouping()']]],
-  ['guidelines_151',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]],
-  ['guidelines_152',['Guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35',1,'Commit Guidelines'],['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md10',1,'Enforcement Guidelines']]],
-  ['guidelines_153',['guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33',1,'Directory guidelines'],['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'File Name guidelines']]],
-  ['guidelines_20for_20reviewers_20and_20maintainers_154',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]]
+  ['gaussian_5felimination_2ecpp_6',['gaussian_elimination.cpp',['../d0/de2/gaussian__elimination_8cpp.html',1,'']]],
+  ['gcd_7',['gcd',['../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0',1,'ciphers::HillCipher::gcd()'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd():&#160;gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532',1,'math::gcd_of_n_numbers::gcd()'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2):&#160;gcd_recursive_euclidean.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563',1,'gcd(unsigned int x, unsigned int y):&#160;least_common_multiple.cpp']]],
+  ['gcd_5fiterative_5feuclidean_2ecpp_8',['gcd_iterative_euclidean.cpp',['../d4/da0/gcd__iterative__euclidean_8cpp.html',1,'']]],
+  ['gcd_5fof_5fn_5fnumbers_9',['gcd_of_n_numbers',['../d2/ddb/namespacegcd__of__n__numbers.html',1,'']]],
+  ['gcd_5fof_5fn_5fnumbers_2ecpp_10',['gcd_of_n_numbers.cpp',['../d1/d11/gcd__of__n__numbers_8cpp.html',1,'']]],
+  ['gcd_5frecursive_5feuclidean_2ecpp_11',['gcd_recursive_euclidean.cpp',['../d4/d45/gcd__recursive__euclidean_8cpp.html',1,'']]],
+  ['gcd_5ftwo_12',['gcd_two',['../d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181',1,'math::gcd_of_n_numbers']]],
+  ['gcdextended_13',['gcdExtended',['../de/dab/ncr__modulo__p_8cpp.html#a9010ad5669d31449c3bf3271ab5ebc86',1,'math::ncr_modulo_p::utils']]],
+  ['genarray_14',['genArray',['../db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5',1,'spiral_print.cpp']]],
+  ['generate_15',['generate',['../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160',1,'backtracking::generate_parentheses']]],
+  ['generate_5fdecryption_5fkey_16',['generate_decryption_key',['../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706',1,'ciphers::HillCipher']]],
+  ['generate_5fencryption_5fkey_17',['generate_encryption_key',['../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e',1,'ciphers::HillCipher']]],
+  ['generate_5fkeys_18',['generate_keys',['../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5',1,'ciphers::HillCipher']]],
+  ['generate_5fparentheses_19',['generate_parentheses',['../df/de5/classbacktracking_1_1generate__parentheses.html',1,'backtracking']]],
+  ['generate_5fparentheses_2ecpp_20',['generate_parentheses.cpp',['../dd/d1e/generate__parentheses_8cpp.html',1,'']]],
+  ['generate_5fpossible_5fmoves_21',['generate_possible_moves',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658',1,'machine_learning::aystar_search::EightPuzzle']]],
+  ['generate_5fsamples_22',['generate_samples',['../db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf',1,'math::monte_carlo']]],
+  ['generate_5funiform_23',['generate_uniform',['../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba',1,'probability::geometric_dist']]],
+  ['generateunsortedarray_24',['generateUnsortedArray',['../d1/daa/random__pivot__quick__sort_8cpp.html#a40675d2eb960c71ca31ec475ba90120d',1,'sorting::random_pivot_quick_sort']]],
+  ['geometric_5fdist_25',['geometric_dist',['../dd/d8a/namespacegeometric__dist.html',1,'']]],
+  ['geometric_5fdist_2ecpp_26',['geometric_dist.cpp',['../de/d72/geometric__dist_8cpp.html',1,'']]],
+  ['geometric_5fdistribution_27',['geometric_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html',1,'probability::geometric_dist::geometric_distribution'],['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797',1,'probability::geometric_dist::geometric_distribution::geometric_distribution()']]],
+  ['geometry_28',['Geometry',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md53',1,'']]],
+  ['geometry_29',['geometry',['../d5/d5f/namespacegeometry.html',1,'']]],
+  ['get_30',['get',['../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a',1,'dsu::get()'],['../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8',1,'catalan_numbers::get()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420',1,'machine_learning::aystar_search::EightPuzzle::get()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781',1,'others::Cache::LFUCache::get()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea',1,'others::Cache::LRUCache::get()']]],
+  ['get_5fall_5fwords_31',['get_all_words',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd',1,'data_structures::trie_using_hashmap::Trie']]],
+  ['get_5fchar_32',['get_char',['../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da',1,'hashing::sha256']]],
+  ['get_5fchar_5fidx_33',['get_char_idx',['../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41',1,'ciphers::HillCipher']]],
+  ['get_5fclock_5fdiff_34',['get_clock_diff',['../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_trace.cpp']]],
+  ['get_5felements_5finorder_35',['get_elements_inorder',['../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a',1,'binary_search_tree']]],
+  ['get_5felements_5fpostorder_36',['get_elements_postorder',['../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff',1,'binary_search_tree']]],
+  ['get_5felements_5fpreorder_37',['get_elements_preorder',['../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13',1,'binary_search_tree']]],
+  ['get_5ffinal_5fstatus_38',['get_final_status',['../df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86',1,'fcfs_scheduling.cpp']]],
+  ['get_5fidx_5fchar_39',['get_idx_char',['../d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c',1,'ciphers::HillCipher']]],
+  ['get_5finput_40',['get_input',['../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1',1,'ternary_search.cpp']]],
+  ['get_5fintersection_41',['get_intersection',['../da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e',1,'operations_on_datastructures']]],
+  ['get_5finverse_42',['get_inverse',['../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7',1,'ciphers::HillCipher::get_inverse()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a',1,'get_inverse():&#160;ordinary_least_squares_regressor.cpp']]],
+  ['get_5fk_5fth_43',['get_k_th',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69',1,'data_structures::treap::Treap']]],
+  ['get_5flevel_5forder_44',['get_level_order',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree']]],
+  ['get_5fmax_45',['get_max',['../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde',1,'dsu']]],
+  ['get_5fmin_46',['get_min',['../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415',1,'dsu']]],
+  ['get_5fmin_5f2d_47',['get_min_2d',['../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e',1,'kohonen_som_topology.cpp']]],
+  ['get_5fminima_48',['get_minima',['../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b):&#160;brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b):&#160;golden_search_extrema.cpp']]],
+  ['get_5fnext_49',['get_next',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4',1,'data_structures::treap::Treap']]],
+  ['get_5fpredecessor_50',['get_predecessor',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126',1,'data_structures::treap::Treap']]],
+  ['get_5frand_51',['get_rand',['../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0',1,'complex_numbers.cpp']]],
+  ['get_5frank_52',['get_rank',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039',1,'data_structures::treap::Treap']]],
+  ['get_5fshape_53',['get_shape',['../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078',1,'machine_learning']]],
+  ['get_5fsize_54',['get_size',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f',1,'machine_learning::aystar_search::EightPuzzle']]],
+  ['get_5fstate_55',['get_state',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99',1,'machine_learning::aystar_search::EightPuzzle']]],
+  ['get_5ftest_5fcases_56',['get_test_cases',['../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c',1,'longest_common_string.cpp']]],
+  ['get_5ftranspose_57',['get_transpose',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb',1,'ordinary_least_squares_regressor.cpp']]],
+  ['get_5funion_58',['get_union',['../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74',1,'operations_on_datastructures']]],
+  ['get_5fxy_5ffrom_5fcsv_59',['get_XY_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d',1,'machine_learning::neural_network::NeuralNetwork']]],
+  ['getadjacencylist_60',['getAdjacencyList',['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a5e84b175ef768ff58eaeededd43e8368',1,'graph::topological_sort::Graph']]],
+  ['getadjlist_61',['getAdjList',['../da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d',1,'Graph']]],
+  ['getbalance_62',['getBalance',['../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546',1,'avltree.cpp']]],
+  ['getchild_63',['GetChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4',1,'data_structures::tree_234::Node']]],
+  ['getchildindex_64',['GetChildIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad632a0440295bc88ceadae7478fe0d37',1,'data_structures::tree_234::Node']]],
+  ['getconnectedcomponents_65',['getConnectedComponents',['../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b',1,'graph']]],
+  ['getconvexhull_66',['getConvexHull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1',1,'geometry::jarvis::Convexhull']]],
+  ['getcount_67',['GetCount',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06',1,'data_structures::tree_234::Node']]],
+  ['getfailurearray_68',['getFailureArray',['../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9',1,'string_search']]],
+  ['gethits_69',['getHits',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933',1,'others::lru_cache::LRUCache']]],
+  ['getinordersuccessor_70',['getInorderSuccessor',['../d4/d32/inorder__successor__of__bst_8cpp.html#a3923fb22b46e085376703cae0b44d690',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
+  ['getitem_71',['GetItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3',1,'data_structures::tree_234::Node']]],
+  ['getitemindex_72',['GetItemIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a650f0ef26b7450e1addb5d80bb0ed629',1,'data_structures::tree_234::Node']]],
+  ['getitemleftchild_73',['GetItemLeftChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab654d7376d3449fdc78edab0e7fed06e',1,'data_structures::tree_234::Node']]],
+  ['getitemrightchild_74',['GetItemRightChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a441cbee9896391f2b167d5aa7b4f8c95',1,'data_structures::tree_234::Node']]],
+  ['getleftmostchild_75',['GetLeftmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e',1,'data_structures::tree_234::Node']]],
+  ['getmaxitem_76',['GetMaxItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57',1,'data_structures::tree_234::Node']]],
+  ['getmedian_77',['getMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d',1,'probability::windowed_median::WindowedMedian']]],
+  ['getmediannaive_78',['getMedianNaive',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6',1,'probability::windowed_median::WindowedMedian']]],
+  ['getmin_79',['getMin',['../d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130',1,'MinHeap']]],
+  ['getminitem_80',['GetMinItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71',1,'data_structures::tree_234::Node']]],
+  ['getnextpossiblechild_81',['GetNextPossibleChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46',1,'data_structures::tree_234::Node']]],
+  ['getnode_82',['getNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
+  ['getnode_83',['getnode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be',1,'linkedlist_implentation_usingarray.cpp']]],
+  ['getnumnodes_84',['getNumNodes',['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#ad22018e4f4f80aecb0538044bb83d096',1,'graph::topological_sort::Graph']]],
+  ['getpagefault_85',['getPageFault',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2',1,'others::lru_cache::LRUCache']]],
+  ['getparents_86',['getParents',['../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280',1,'dsu']]],
+  ['getrandomindex_87',['getRandomIndex',['../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5',1,'sorting::random_pivot_quick_sort']]],
+  ['getrightmostchild_88',['GetRightmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94',1,'data_structures::tree_234::Node']]],
+  ['gettreemaxitem_89',['GetTreeMaxItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657',1,'data_structures::tree_234::Tree234']]],
+  ['gettreeminitem_90',['GetTreeMinItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36',1,'data_structures::tree_234::Tree234']]],
+  ['getvertices_91',['getVertices',['../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1',1,'Graph']]],
+  ['github_20actions_92',['GitHub Actions',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md40',1,'']]],
+  ['given_20node_20does_20not_20have_20a_20right_20node_20subtree_93',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]],
+  ['given_20node_20has_20the_20right_20node_20subtree_94',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]],
+  ['gnome_5fsort_2ecpp_95',['gnome_sort.cpp',['../d2/d21/gnome__sort_8cpp.html',1,'']]],
+  ['gnomesort_96',['gnomeSort',['../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1',1,'sorting::gnomeSort(T *arr, int size)'],['../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935',1,'sorting::gnomeSort(std::array&lt; T, size &gt; arr)']]],
+  ['golden_5fsearch_5fextrema_2ecpp_97',['golden_search_extrema.cpp',['../d6/d7a/golden__search__extrema_8cpp.html',1,'']]],
+  ['good_5fsuffix_98',['good_suffix',['../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e',1,'strings::boyer_moore::pattern']]],
+  ['gram_5fschmidt_99',['gram_schmidt',['../d4/d0f/namespacegram__schmidt.html',1,'gram_schmidt'],['../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5',1,'numerical_methods::gram_schmidt::gram_schmidt()']]],
+  ['gram_5fschmidt_2ecpp_100',['gram_schmidt.cpp',['../d5/d33/gram__schmidt_8cpp.html',1,'']]],
+  ['graph_101',['Graph',['../da/d9a/class_graph.html',1,'Graph'],['../dc/d61/classgraph_1_1_graph.html',1,'graph::Graph&lt; T &gt;'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html',1,'graph::is_graph_bipartite::Graph'],['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html',1,'graph::topological_sort::Graph'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html',1,'greedy_algorithms::dijkstra::Graph'],['../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d',1,'Graph::Graph(unsigned int vertices, AdjList adjList)'],['../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3',1,'Graph::Graph(unsigned int vertices, AdjList &amp;&amp;adjList)'],['../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1',1,'Graph::Graph(unsigned int vertices, std::vector&lt; Edge &gt; const &amp;edges)'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3',1,'graph::is_graph_bipartite::Graph::Graph()'],['../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5',1,'graph::Graph::Graph()'],['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a75a849f80a66304e7da39b3ccd6129d6',1,'graph::topological_sort::Graph::Graph()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc',1,'greedy_algorithms::dijkstra::Graph::Graph()'],['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md54',1,'Graph']]],
+  ['graph_102',['graph',['../d1/d9a/hopcroft__karp_8cpp.html#autotoc_md77',1,'Bipartite graph'],['../df/dce/namespacegraph.html',1,'graph']]],
+  ['graph_5fcoloring_103',['graph_coloring',['../d7/d08/namespacegraph__coloring.html',1,'']]],
+  ['graph_5fcoloring_2ecpp_104',['graph_coloring.cpp',['../d3/d40/graph__coloring_8cpp.html',1,'']]],
+  ['graphcoloring_105',['graphColoring',['../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c',1,'backtracking::graph_coloring']]],
+  ['graphics_106',['Graphics',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md55',1,'']]],
+  ['gray_5fcode_107',['gray_code',['../de/d9b/namespacegray__code.html',1,'']]],
+  ['greedy_20algorithms_108',['Greedy Algorithms',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md56',1,'']]],
+  ['greedy_5falgorithms_109',['greedy_algorithms',['../d2/d90/namespacegreedy__algorithms.html',1,'']]],
+  ['greedy_5falgorithms_3a_3adijkstra_110',['dijkstra',['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html',1,'greedy_algorithms']]],
+  ['greedy_5falgorithms_3a_3astable_5fmatching_111',['stable_matching',['../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html',1,'greedy_algorithms']]],
+  ['grey_112',['GREY',['../da/d4b/depth__first__search__with__stack_8cpp.html#a43e30173f12330e85cce6239a277527e',1,'depth_first_search_with_stack.cpp']]],
+  ['ground_5fto_5fground_5fprojectile_5fmotion_113',['ground_to_ground_projectile_motion',['../d0/d20/namespaceground__to__ground__projectile__motion.html',1,'']]],
+  ['ground_5fto_5fground_5fprojectile_5fmotion_2ecpp_114',['ground_to_ground_projectile_motion.cpp',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html',1,'']]],
+  ['guidelines_115',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]],
+  ['guidelines_116',['Guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md35',1,'Commit Guidelines'],['../d3/dd7/md__c_o_d_e___o_f___c_o_n_d_u_c_t.html#autotoc_md10',1,'Enforcement Guidelines']]],
+  ['guidelines_117',['guidelines',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md33',1,'Directory guidelines'],['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md32',1,'File Name guidelines']]],
+  ['guidelines_20for_20reviewers_20and_20maintainers_118',['Guidelines for reviewers and maintainers',['../d7/d1b/md__r_e_v_i_e_w_e_r___c_o_d_e.html',1,'']]]
 ];
diff --git a/search/all_d.js b/search/all_d.js
index 52b25d683..d58b03745 100644
--- a/search/all_d.js
+++ b/search/all_d.js
@@ -11,58 +11,47 @@ var searchData=
   ['hamming_5fdistance_8',['hamming_distance',['../d4/d1c/namespacehamming__distance.html',1,'hamming_distance'],['../d4/d48/hamming__distance_8cpp.html#abfe6fbb2f3460a2623c96f283178a07a',1,'bit_manipulation::hamming_distance::hamming_distance(uint64_t a, uint64_t b)'],['../d4/d48/hamming__distance_8cpp.html#a40ba9fe8b5df5c268f0c7d677ff2fe80',1,'bit_manipulation::hamming_distance::hamming_distance(const std::string &amp;a, const std::string &amp;b)']]],
   ['hamming_5fdistance_2ecpp_9',['hamming_distance.cpp',['../d4/d48/hamming__distance_8cpp.html',1,'']]],
   ['happy_5fnumber_2ecpp_10',['happy_number.cpp',['../db/df3/happy__number_8cpp.html',1,'']]],
-  ['hardware_5fconcurrency_11',['hardware_concurrency',['http://en.cppreference.com/w/cpp/thread/thread/hardware_concurrency.html',0,'std::thread']]],
-  ['harr_12',['harr',['../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e',1,'MinHeap']]],
-  ['has_20the_20right_20node_20subtree_13',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]],
-  ['has_5ffacet_14',['has_facet',['http://en.cppreference.com/w/cpp/locale/has_facet.html',0,'std']]],
-  ['has_5fvirtual_5fdestructor_15',['has_virtual_destructor',['http://en.cppreference.com/w/cpp/types/has_virtual_destructor.html',0,'std']]],
-  ['haschildren_16',['hasChildren',['../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb',1,'Trie']]],
-  ['hash_17',['Hash',['../d6/d84/classhashing_1_1sha256_1_1_hash.html',1,'hashing::sha256']]],
-  ['hash_18',['hash',['http://en.cppreference.com/w/cpp/utility/hash.html',0,'std::hash'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate_byname::hash()'],['http://en.cppreference.com/w/cpp/utility/hash/hash.html',0,'std::hash::hash()'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate::hash()'],['../dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64',1,'hash_chain::hash()'],['../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb',1,'hashing::md5::hash()'],['../d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c',1,'hashing::sha1::hash()']]],
-  ['hash_5fbs_19',['hash_bs',['../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425',1,'hashing::md5::hash_bs()'],['../d8/d7a/sha1_8cpp.html#a7be3471f7e489d7d0df42b97a48bf141',1,'hashing::sha1::hash_bs()']]],
-  ['hash_5fchain_20',['hash_chain',['../dd/d1c/classhash__chain.html',1,'hash_chain'],['../dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595',1,'hash_chain::hash_chain()']]],
-  ['hash_5fcode_21',['hash_code',['http://en.cppreference.com/w/cpp/types/type_info/hash_code.html',0,'std::type_info::hash_code()'],['http://en.cppreference.com/w/cpp/types/type_index/hash_code.html',0,'std::type_index::hash_code()']]],
-  ['hash_5ffunction_22',['hash_function',['http://en.cppreference.com/w/cpp/container/unordered_map/hash_function.html',0,'std::unordered_map::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/hash_function.html',0,'std::unordered_multimap::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/hash_function.html',0,'std::unordered_multiset::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_set/hash_function.html',0,'std::unordered_set::hash_function()']]],
-  ['hash_5fsearch_23',['hash_search',['../d1/df3/hash__search_8cpp.html#a36ea13c16028f18ef2d5ff47f3fda7a2',1,'hash_search.cpp']]],
-  ['hash_5fsearch_2ecpp_24',['hash_search.cpp',['../d1/df3/hash__search_8cpp.html',1,'']]],
-  ['hashdjb2_25',['hashDJB2',['../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4',1,'data_structures']]],
-  ['hashfunks_26',['hashFunks',['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80',1,'data_structures::BloomFilter']]],
-  ['hashfxn_27',['hashFxn',['../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003',1,'double_hashing::hashFxn()'],['../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527',1,'linear_probing::hashFxn()'],['../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7',1,'quadratic_probing::hashFxn()']]],
-  ['hashing_28',['Hashing',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57',1,'']]],
-  ['hashing_29',['hashing',['../d6/d0c/namespacehashing.html',1,'']]],
-  ['hashint_5f1_30',['hashInt_1',['../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677',1,'data_structures']]],
-  ['hashint_5f2_31',['hashInt_2',['../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c',1,'data_structures']]],
-  ['hashmax_32',['HASHMAX',['../d1/df3/hash__search_8cpp.html#a77c722016053a1d484aa177ce205b367',1,'hash_search.cpp']]],
-  ['hashstr_33',['hashStr',['../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15',1,'data_structures']]],
-  ['hashtab_34',['hashtab',['../d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d',1,'hash_search.cpp']]],
-  ['have_20a_20right_20node_20subtree_35',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]],
-  ['head_36',['head',['../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0',1,'hash_chain::head'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821',1,'others::Cache::LRUCache::head']]],
-  ['header_37',['header',['../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16',1,'data_structures::SkipList']]],
-  ['heap_5fsize_38',['heap_size',['../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913',1,'MinHeap']]],
-  ['heap_5fsort_2ecpp_39',['heap_sort.cpp',['../d2/d52/heap__sort_8cpp.html',1,'']]],
-  ['heapsort_40',['heapSort',['../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f',1,'heap_sort.cpp']]],
-  ['heavy_5flight_5fdecomposition_41',['heavy_light_decomposition',['../db/d6f/namespaceheavy__light__decomposition.html',1,'']]],
-  ['heavy_5flight_5fdecomposition_2ecpp_42',['heavy_light_decomposition.cpp',['../d2/de9/heavy__light__decomposition_8cpp.html',1,'']]],
-  ['hecto_43',['hecto',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['height_44',['height',['../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83',1,'avltree.cpp']]],
-  ['hemi_5fsphere_5fsurface_5farea_45',['hemi_sphere_surface_area',['../dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb',1,'math']]],
-  ['heuristic_5fvalue_46',['heuristic_value',['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3',1,'machine_learning::aystar_search::AyStarSearch::Info']]],
-  ['hex_47',['hex',['http://en.cppreference.com/w/cpp/io/manip/hex.html',0,'std']]],
-  ['hexfloat_48',['hexfloat',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]],
-  ['high_5fresolution_5fclock_49',['high_resolution_clock',['http://en.cppreference.com/w/cpp/chrono/high_resolution_clock.html',0,'std::chrono']]],
-  ['hill_5fcipher_2ecpp_50',['hill_cipher.cpp',['../d7/db9/hill__cipher_8cpp.html',1,'']]],
-  ['hillcipher_51',['HillCipher',['../d6/d26/classciphers_1_1_hill_cipher.html',1,'ciphers']]],
-  ['hits_52',['hits',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a5f33913e7ddfbb38062362e7bd859154',1,'others::lru_cache::LRUCache']]],
-  ['hkgraph_53',['HKGraph',['../d8/d69/classgraph_1_1_h_k_graph.html',1,'graph::HKGraph'],['../d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9',1,'graph::HKGraph::HKGraph()'],['../d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64',1,'graph::HKGraph::HKGraph(int m, int n)']]],
-  ['hld_54',['HLD',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html',1,'range_queries::heavy_light_decomposition::HLD&lt; X &gt;'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a6e486767434e44076c1ac374a22da726',1,'range_queries::heavy_light_decomposition::HLD::HLD()']]],
-  ['hopcroft_5fkarp_2ecpp_55',['hopcroft_karp.cpp',['../d1/d9a/hopcroft__karp_8cpp.html',1,'']]],
-  ['hopcroftkarpalgorithm_56',['hopcroftKarpAlgorithm',['../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d',1,'graph::HKGraph']]],
-  ['horizontal_5frange_57',['horizontal_range',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a10362eb607d7882bac3a0688504b00ff',1,'physics::ground_to_ground_projectile_motion']]],
-  ['horspool_58',['horspool',['../d5/d02/namespacehorspool.html',1,'horspool'],['../d3/dfe/horspool_8cpp.html#a9884bca75ce39c116697ea2574adb37d',1,'strings::horspool::horspool()']]],
-  ['horspool_2ecpp_59',['horspool.cpp',['../d3/dfe/horspool_8cpp.html',1,'']]],
-  ['hours_60',['hours',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::hours'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::hours::hours()']]],
-  ['house_5frobber_61',['house_robber',['../d2/de1/namespacehouse__robber.html',1,'']]],
-  ['house_5frobber_2ecpp_62',['house_robber.cpp',['../d6/d26/house__robber_8cpp.html',1,'']]],
-  ['houserobber_63',['houseRobber',['../d6/d26/house__robber_8cpp.html#a1e497c3e3f169afe5baaae6a5d40cbc8',1,'dynamic_programming::house_robber']]],
-  ['hypot_64',['hypot',['http://en.cppreference.com/w/cpp/numeric/math/hypot.html',0,'std']]]
+  ['harr_11',['harr',['../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e',1,'MinHeap']]],
+  ['has_20the_20right_20node_20subtree_12',['Case 1: The given node has the right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md89',1,'']]],
+  ['haschildren_13',['hasChildren',['../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb',1,'Trie']]],
+  ['hash_14',['Hash',['../d6/d84/classhashing_1_1sha256_1_1_hash.html',1,'hashing::sha256']]],
+  ['hash_15',['hash',['../dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64',1,'hash_chain::hash()'],['../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb',1,'hashing::md5::hash()'],['../d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c',1,'hashing::sha1::hash()']]],
+  ['hash_5fbs_16',['hash_bs',['../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425',1,'hashing::md5::hash_bs()'],['../d8/d7a/sha1_8cpp.html#a7be3471f7e489d7d0df42b97a48bf141',1,'hashing::sha1::hash_bs()']]],
+  ['hash_5fchain_17',['hash_chain',['../dd/d1c/classhash__chain.html',1,'hash_chain'],['../dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595',1,'hash_chain::hash_chain()']]],
+  ['hash_5fsearch_18',['hash_search',['../d1/df3/hash__search_8cpp.html#a36ea13c16028f18ef2d5ff47f3fda7a2',1,'hash_search.cpp']]],
+  ['hash_5fsearch_2ecpp_19',['hash_search.cpp',['../d1/df3/hash__search_8cpp.html',1,'']]],
+  ['hashdjb2_20',['hashDJB2',['../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4',1,'data_structures']]],
+  ['hashfunks_21',['hashFunks',['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80',1,'data_structures::BloomFilter']]],
+  ['hashfxn_22',['hashFxn',['../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003',1,'double_hashing::hashFxn()'],['../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527',1,'linear_probing::hashFxn()'],['../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7',1,'quadratic_probing::hashFxn()']]],
+  ['hashing_23',['Hashing',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md57',1,'']]],
+  ['hashing_24',['hashing',['../d6/d0c/namespacehashing.html',1,'']]],
+  ['hashint_5f1_25',['hashInt_1',['../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677',1,'data_structures']]],
+  ['hashint_5f2_26',['hashInt_2',['../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c',1,'data_structures']]],
+  ['hashmax_27',['HASHMAX',['../d1/df3/hash__search_8cpp.html#a77c722016053a1d484aa177ce205b367',1,'hash_search.cpp']]],
+  ['hashstr_28',['hashStr',['../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15',1,'data_structures']]],
+  ['hashtab_29',['hashtab',['../d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d',1,'hash_search.cpp']]],
+  ['have_20a_20right_20node_20subtree_30',['Case 2: The given node does not have a right node/subtree',['../d4/d32/inorder__successor__of__bst_8cpp.html#autotoc_md90',1,'']]],
+  ['head_31',['head',['../dd/d1c/classhash__chain.html#ae8457d13620497fa2046ac566252c4b0',1,'hash_chain::head'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a042bb403f4452ad8c669fbf87ef82821',1,'others::Cache::LRUCache::head']]],
+  ['header_32',['header',['../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16',1,'data_structures::SkipList']]],
+  ['heap_5fsize_33',['heap_size',['../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913',1,'MinHeap']]],
+  ['heap_5fsort_2ecpp_34',['heap_sort.cpp',['../d2/d52/heap__sort_8cpp.html',1,'']]],
+  ['heapsort_35',['heapSort',['../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f',1,'heap_sort.cpp']]],
+  ['heavy_5flight_5fdecomposition_36',['heavy_light_decomposition',['../db/d6f/namespaceheavy__light__decomposition.html',1,'']]],
+  ['heavy_5flight_5fdecomposition_2ecpp_37',['heavy_light_decomposition.cpp',['../d2/de9/heavy__light__decomposition_8cpp.html',1,'']]],
+  ['height_38',['height',['../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83',1,'avltree.cpp']]],
+  ['hemi_5fsphere_5fsurface_5farea_39',['hemi_sphere_surface_area',['../dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb',1,'math']]],
+  ['heuristic_5fvalue_40',['heuristic_value',['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a331d1070d008a4f9d55775a51013baa3',1,'machine_learning::aystar_search::AyStarSearch::Info']]],
+  ['hill_5fcipher_2ecpp_41',['hill_cipher.cpp',['../d7/db9/hill__cipher_8cpp.html',1,'']]],
+  ['hillcipher_42',['HillCipher',['../d6/d26/classciphers_1_1_hill_cipher.html',1,'ciphers']]],
+  ['hits_43',['hits',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a5f33913e7ddfbb38062362e7bd859154',1,'others::lru_cache::LRUCache']]],
+  ['hkgraph_44',['HKGraph',['../d8/d69/classgraph_1_1_h_k_graph.html',1,'graph::HKGraph'],['../d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9',1,'graph::HKGraph::HKGraph()'],['../d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64',1,'graph::HKGraph::HKGraph(int m, int n)']]],
+  ['hld_45',['HLD',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html',1,'range_queries::heavy_light_decomposition::HLD&lt; X &gt;'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a6e486767434e44076c1ac374a22da726',1,'range_queries::heavy_light_decomposition::HLD::HLD()']]],
+  ['hopcroft_5fkarp_2ecpp_46',['hopcroft_karp.cpp',['../d1/d9a/hopcroft__karp_8cpp.html',1,'']]],
+  ['hopcroftkarpalgorithm_47',['hopcroftKarpAlgorithm',['../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d',1,'graph::HKGraph']]],
+  ['horizontal_5frange_48',['horizontal_range',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a10362eb607d7882bac3a0688504b00ff',1,'physics::ground_to_ground_projectile_motion']]],
+  ['horspool_49',['horspool',['../d5/d02/namespacehorspool.html',1,'horspool'],['../d3/dfe/horspool_8cpp.html#a9884bca75ce39c116697ea2574adb37d',1,'strings::horspool::horspool()']]],
+  ['horspool_2ecpp_50',['horspool.cpp',['../d3/dfe/horspool_8cpp.html',1,'']]],
+  ['house_5frobber_51',['house_robber',['../d2/de1/namespacehouse__robber.html',1,'']]],
+  ['house_5frobber_2ecpp_52',['house_robber.cpp',['../d6/d26/house__robber_8cpp.html',1,'']]],
+  ['houserobber_53',['houseRobber',['../d6/d26/house__robber_8cpp.html#a1e497c3e3f169afe5baaae6a5d40cbc8',1,'dynamic_programming::house_robber']]]
 ];
diff --git a/search/all_e.js b/search/all_e.js
index 1fdf6dc40..aec0a5c37 100644
--- a/search/all_e.js
+++ b/search/all_e.js
@@ -1,257 +1,104 @@
 var searchData=
 [
   ['id_0',['ID',['../dd/d95/classdata__structures_1_1_segment_tree.html#a10ffa5fc03c66170f0bc2592b843baa3',1,'data_structures::SegmentTree']]],
-  ['id_1',['id',['http://en.cppreference.com/w/cpp/locale/locale/id.html',0,'std::locale::id'],['http://en.cppreference.com/w/cpp/thread/thread/id.html',0,'std::thread::id'],['http://en.cppreference.com/w/cpp/locale/locale/id/id.html',0,'std::locale::id::id()'],['http://en.cppreference.com/w/cpp/thread/thread/id/id.html',0,'std::thread::id::id()']]],
-  ['identity_5ffunction_2',['identity_function',['../d2/d58/neural__network_8cpp.html#a32c00da08f2cf641dd336270f6e3c407',1,'machine_learning::neural_network::util_functions']]],
-  ['ifstream_3',['ifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std::ifstream'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::ifstream::ifstream()']]],
-  ['ignore_4',['ignore',['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::fstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_fstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::iostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wistream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::stringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wifstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_istream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::strstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_stringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istrstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wiostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_istringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_ifstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wfstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_iostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wstringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wistringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::ifstream::ignore()']]],
-  ['ilogb_5',['ilogb',['http://en.cppreference.com/w/cpp/numeric/math/ilogb.html',0,'std']]],
-  ['imag_6',['imag',['http://en.cppreference.com/w/cpp/numeric/complex/imag.html',0,'std::complex::imag()'],['../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974',1,'Complex::imag()']]],
-  ['imbue_7',['imbue',['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::fstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ostringstream::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::regex::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::basic_regex::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_filebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstringbuf::imbue()'],['http://en.cppreference.com/w/cpp/io/ios_base/imbue.html',0,'std::basic_ios::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_fstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::stringbuf::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::wregex::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wfilebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::iostream::imbue()'],['http://en.cppreference.com/w/cpp/io/ios_base/imbue.html',0,'std::ios_base::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wistream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstreambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::stringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::strstreambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wifstream::imbue()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/imbue.html',0,'std::regex_traits::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_istream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_stringbuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::strstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_streambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_stringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wostringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istrstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::filebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wiostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_istringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ifstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::streambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostrstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wfstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_iostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wstringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wistringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ifstream::imbue()']]],
-  ['imod_8',['imod',['../d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6',1,'modular_inverse_simple.cpp']]],
-  ['implementation_9',['Implementation',['../d4/d9f/selection__sort__recursive_8cpp.html#autotoc_md117',1,'']]],
-  ['in_10',['in',['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_byname::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8_utf16::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf16::in()']]],
-  ['in_20a_20new_20directory_11',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]],
-  ['in_5favail_12',['in_avail',['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_filebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wstringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::stringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wfilebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wstreambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::strstreambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_stringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_streambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::filebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::streambuf::in_avail()']]],
-  ['in_5frange_13',['in_range',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e',1,'machine_learning::aystar_search::EightPuzzle']]],
-  ['includes_14',['includes',['http://en.cppreference.com/w/cpp/algorithm/includes.html',0,'std']]],
-  ['increase_5ffrequency_15',['increase_frequency',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9',1,'others::Cache::LFUCache']]],
-  ['independent_5fbits_5fengine_16',['independent_bits_engine',['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine.html',0,'std::independent_bits_engine'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/independent_bits_engine.html',0,'std::independent_bits_engine::independent_bits_engine()']]],
-  ['inf_17',['INF',['../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c',1,'INF:&#160;bidirectional_dijkstra.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c',1,'INF:&#160;depth_first_search_with_stack.cpp']]],
-  ['infinity_18',['infinity',['http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html',0,'std::numeric_limits']]],
-  ['info_19',['Info',['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html',1,'machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info'],['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#acd897e6e519849edb9fb0d1e1bfa881a',1,'machine_learning::aystar_search::AyStarSearch::Info'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7',1,'machine_learning::aystar_search::AyStarSearch::Info::Info()=default'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a695e4314ebc3ab58e13004dc63599fe8',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Puzzle &amp;A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3950824936488f66408313b1f8a8ca8',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Puzzle &amp;A, size_t h_value, size_t d)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a572de12115e39e34dde6e68b707d59f5',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Info &amp;A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a6abc89925ae7055a63b428e61525ad7a',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Info &amp;&amp;A) noexcept']]],
-  ['init_20',['init',['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ios::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::strstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wiostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wfstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wstringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ifstream::init()'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc',1,'range_queries::heavy_light_decomposition::Tree::init()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828',1,'range_queries::heavy_light_decomposition::HLD::init()'],['../d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214',1,'games::memory_game::init()']]],
-  ['init_5fbad_5fchar_21',['init_bad_char',['../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00',1,'strings::boyer_moore']]],
-  ['init_5fgood_5fsuffix_22',['init_good_suffix',['../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1',1,'strings::boyer_moore']]],
-  ['init_5fpattern_23',['init_pattern',['../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8',1,'strings::boyer_moore']]],
-  ['initializer_5flist_24',['initializer_list',['http://en.cppreference.com/w/cpp/utility/initializer_list.html',0,'std::initializer_list'],['http://en.cppreference.com/w/cpp/utility/initializer_list/initializer_list.html',0,'std::initializer_list::initializer_list()']]],
-  ['inner_5fallocator_25',['inner_allocator',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/inner_allocator.html',0,'std::scoped_allocator_adaptor']]],
-  ['inner_5fproduct_26',['inner_product',['http://en.cppreference.com/w/cpp/algorithm/inner_product.html',0,'std']]],
-  ['inorder_20traversal_20of_20a_20tree_27',['Inorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree']]],
-  ['inorder_5fsuccessor_5fof_5fbst_28',['inorder_successor_of_bst',['../dd/d74/namespaceinorder__successor__of__bst.html',1,'']]],
-  ['inorder_5fsuccessor_5fof_5fbst_2ecpp_29',['inorder_successor_of_bst.cpp',['../d4/d32/inorder__successor__of__bst_8cpp.html',1,'']]],
-  ['inorderiterative_30',['inOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499',1,'others::iterative_tree_traversals::BinaryTree']]],
-  ['inplace_5fmerge_31',['inplace_merge',['http://en.cppreference.com/w/cpp/algorithm/inplace_merge.html',0,'std']]],
-  ['input_5fiterator_5ftag_32',['input_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]],
-  ['insameunion_33',['InSameUnion',['../de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985',1,'disjoint_set.cpp']]],
-  ['insert_34',['Insert',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e',1,'data_structures::tree_234::Tree234::Insert(int64_t item)'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f',1,'data_structures::tree_234::Tree234::Insert(Node *tree, int64_t item)'],['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c',1,'operations_on_datastructures::trie_operations::Tnode::Insert()'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a3ae0bea4123fd2ce155108e88f2ef78c',1,'operations_on_datastructures::inorder_traversal_of_bst::Insert()']]],
-  ['insert_35',['insert',['http://en.cppreference.com/w/cpp/container/vector/insert.html',0,'std::vector::insert()'],['http://en.cppreference.com/w/cpp/container/multiset/insert.html',0,'std::multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::string::insert()'],['http://en.cppreference.com/w/cpp/container/set/insert.html',0,'std::set::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_map/insert.html',0,'std::unordered_map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/insert.html',0,'std::unordered_multimap::insert()'],['http://en.cppreference.com/w/cpp/container/deque/insert.html',0,'std::deque::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::basic_string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::wstring::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/insert.html',0,'std::unordered_multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u16string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u32string::insert()'],['http://en.cppreference.com/w/cpp/container/list/insert.html',0,'std::list::insert()'],['http://en.cppreference.com/w/cpp/container/map/insert.html',0,'std::map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_set/insert.html',0,'std::unordered_set::insert()'],['http://en.cppreference.com/w/cpp/container/multimap/insert.html',0,'std::multimap::insert()'],['../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778',1,'binary_search_tree::insert(std::unique_ptr&lt; bst_node &gt; &amp;node, T new_value)'],['../d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0',1,'binary_search_tree::insert(T new_value)'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1',1,'data_structures::list_array::list::insert()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1',1,'data_structures::linked_list::list::insert()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f',1,'data_structures::treap::Treap::insert()'],['../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2',1,'Trie::insert()'],['../d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546',1,'data_structures::trie::insert()'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2',1,'data_structures::trie_using_hashmap::Trie::insert()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(const std::vector&lt; int64_t &gt; &amp;values)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a3b7bbb0918c261bc216aef9e6dd39aa4',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(int64_t data)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(Node *node)'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::insert()'],['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7',1,'probability::windowed_median::WindowedMedian::insert()'],['../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b',1,'insert():&#160;avltree.cpp']]],
-  ['insert_5fafter_36',['insert_after',['http://en.cppreference.com/w/cpp/container/forward_list/insert_after.html',0,'std::forward_list']]],
-  ['insert_5felement_37',['insert_element',['../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd',1,'machine_learning']]],
-  ['insert_5fiterator_38',['insert_iterator',['http://en.cppreference.com/w/cpp/iterator/insert_iterator.html',0,'std']]],
-  ['insertatthebeginning_39',['insertAtTheBeginning',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df',1,'linkedlist_implentation_usingarray.cpp']]],
-  ['insertelement_40',['insertElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9',1,'data_structures::SkipList']]],
-  ['inserter_41',['inserter',['http://en.cppreference.com/w/cpp/iterator/inserter.html',0,'std']]],
-  ['insertion_5fsort_2ecpp_42',['insertion_sort.cpp',['../dd/d0d/insertion__sort_8cpp.html',1,'']]],
-  ['insertion_5fsort_5frecursive_2ecpp_43',['insertion_sort_recursive.cpp',['../dd/d89/insertion__sort__recursive_8cpp.html',1,'']]],
-  ['insertionsort_44',['InsertionSort',['../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1',1,'sorting::merge_insertion']]],
-  ['insertionsort_45',['insertionSort',['../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9',1,'sorting::insertionSort(T *arr, int n)'],['../d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f',1,'sorting::insertionSort(std::vector&lt; T &gt; *arr)']]],
-  ['insertionsort_5fbinsrch_46',['insertionSort_binsrch',['../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68',1,'sorting']]],
-  ['insertitem_47',['InsertItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb',1,'data_structures::tree_234::Node']]],
-  ['insertitembyindex_48',['InsertItemByIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956',1,'data_structures::tree_234::Node']]],
-  ['insertkey_49',['insertKey',['../d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82',1,'MinHeap']]],
-  ['insertpostmerge_50',['InsertPostMerge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aa7e5e00033f38006a224f30bdbf3f703',1,'data_structures::tree_234::Tree234']]],
-  ['insertpresplit_51',['InsertPreSplit',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d',1,'data_structures::tree_234::Tree234']]],
-  ['inserttosorted_52',['insertToSorted',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24',1,'probability::windowed_median::WindowedMedian']]],
-  ['int16_5ft_53',['int16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int32_5ft_54',['int32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int64_5ft_55',['int64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int8_5ft_56',['int8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int_5ffast16_5ft_57',['int_fast16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int_5ffast32_5ft_58',['int_fast32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int_5ffast64_5ft_59',['int_fast64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int_5ffast8_5ft_60',['int_fast8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int_5fleast16_5ft_61',['int_least16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int_5fleast32_5ft_62',['int_least32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int_5fleast64_5ft_63',['int_least64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int_5fleast8_5ft_64',['int_least8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['integer_5fsequence_65',['integer_sequence',['http://en.cppreference.com/w/cpp/utility/integer_sequence.html',0,'std']]],
-  ['integral_5fapprox_66',['integral_approx',['../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11',1,'math']]],
-  ['integral_5fapproximation_2ecpp_67',['integral_approximation.cpp',['../d1/de9/integral__approximation_8cpp.html',1,'']]],
-  ['integral_5fapproximation2_2ecpp_68',['integral_approximation2.cpp',['../db/d40/integral__approximation2_8cpp.html',1,'']]],
-  ['integral_5fconstant_69',['integral_constant',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]],
-  ['integral_5fmonte_5fcarlo_70',['integral_monte_carlo',['../db/d40/integral__approximation2_8cpp.html#af7da9ba8932f1f48b9bbc2d80471af51',1,'math::monte_carlo']]],
-  ['integrating_20cmake_20in_20a_20new_20directory_71',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]],
-  ['interactive_72',['interactive',['../d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661',1,'interactive():&#160;md5.cpp'],['../d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661',1,'interactive():&#160;sha1.cpp']]],
-  ['interface_73',['User-interface',['../dc/d64/md__coding_guidelines.html#autotoc_md18',1,'']]],
-  ['intern_5ftype_74',['intern_type',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_byname::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf16::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8_utf16::intern_type']]],
-  ['internal_75',['internal',['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std']]],
-  ['interpolation_5fsearch_76',['interpolation_search',['../d1/d64/namespaceinterpolation__search.html',1,'']]],
-  ['interpolation_5fsearch2_2ecpp_77',['interpolation_search2.cpp',['../df/d39/interpolation__search2_8cpp.html',1,'']]],
-  ['interpolationsearch_78',['InterpolationSearch',['../df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629',1,'interpolation_search2.cpp']]],
-  ['intersection_5fof_5ftwo_5farrays_2ecpp_79',['intersection_of_two_arrays.cpp',['../de/dc5/intersection__of__two__arrays_8cpp.html',1,'']]],
-  ['intervals_80',['intervals',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/params.html',0,'std::piecewise_constant_distribution::intervals()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/params.html',0,'std::piecewise_linear_distribution::intervals()']]],
-  ['intmax_5ft_81',['intmax_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['intptr_5ft_82',['intptr_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['inv_5fsqrt_2ecpp_83',['inv_sqrt.cpp',['../d6/db8/inv__sqrt_8cpp.html',1,'']]],
-  ['invalid_5fargument_84',['invalid_argument',['http://en.cppreference.com/w/cpp/error/invalid_argument.html',0,'std::invalid_argument'],['http://en.cppreference.com/w/cpp/error/invalid_argument.html',0,'std::invalid_argument::invalid_argument()']]],
-  ['inverse_5fcumulative_5fdistribution_85',['inverse_cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf',1,'probability::geometric_dist::geometric_distribution']]],
-  ['inverse_5ffast_5ffourier_5ftransform_2ecpp_86',['inverse_fast_fourier_transform.cpp',['../d9/d37/inverse__fast__fourier__transform_8cpp.html',1,'']]],
-  ['inversefastfouriertransform_87',['InverseFastFourierTransform',['../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93',1,'numerical_methods']]],
-  ['inversion_88',['inversion',['../d9/d13/namespaceinversion.html',1,'']]],
-  ['ios_5fbase_89',['ios_base',['http://en.cppreference.com/w/cpp/io/ios_base.html',0,'std::ios_base'],['http://en.cppreference.com/w/cpp/io/ios_base/ios_base.html',0,'std::ios_base::ios_base()']]],
-  ['iostream_90',['iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std::iostream'],['http://en.cppreference.com/w/cpp/io/basic_iostream/basic_iostream.html',0,'std::iostream::iostream()']]],
-  ['iota_91',['iota',['http://en.cppreference.com/w/cpp/algorithm/iota.html',0,'std']]],
-  ['is_92',['is',['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype_byname::is()'],['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype::is()']]],
-  ['is2node_93',['Is2Node',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631',1,'data_structures::tree_234::Node']]],
-  ['is34node_94',['Is34Node',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18',1,'data_structures::tree_234::Node']]],
-  ['is_5fabstract_95',['is_abstract',['http://en.cppreference.com/w/cpp/types/is_abstract.html',0,'std']]],
-  ['is_5farithmetic_96',['is_arithmetic',['http://en.cppreference.com/w/cpp/types/is_arithmetic.html',0,'std']]],
-  ['is_5farithmetic_3c_20uint128_5ft_20_3e_97',['is_arithmetic&lt; uint128_t &gt;',['../d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html',1,'std']]],
-  ['is_5farithmetic_3c_20uint256_5ft_20_3e_98',['is_arithmetic&lt; uint256_t &gt;',['../dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html',1,'std']]],
-  ['is_5farmstrong_99',['is_armstrong',['../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26',1,'dynamic_programming']]],
-  ['is_5farray_100',['is_array',['http://en.cppreference.com/w/cpp/types/is_array.html',0,'std']]],
-  ['is_5fassignable_101',['is_assignable',['http://en.cppreference.com/w/cpp/types/is_assignable.html',0,'std']]],
-  ['is_5fbase_5fof_102',['is_base_of',['http://en.cppreference.com/w/cpp/types/is_base_of.html',0,'std']]],
-  ['is_5fbind_5fexpression_103',['is_bind_expression',['http://en.cppreference.com/w/cpp/utility/functional/is_bind_expression.html',0,'std']]],
-  ['is_5fbipartite_104',['is_bipartite',['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad475f8b838693812f7569a490729f373',1,'graph::is_graph_bipartite::Graph']]],
-  ['is_5fclass_105',['is_class',['http://en.cppreference.com/w/cpp/types/is_class.html',0,'std']]],
-  ['is_5fcompound_106',['is_compound',['http://en.cppreference.com/w/cpp/types/is_compound.html',0,'std']]],
-  ['is_5fconst_107',['is_const',['http://en.cppreference.com/w/cpp/types/is_const.html',0,'std']]],
-  ['is_5fconstructible_108',['is_constructible',['http://en.cppreference.com/w/cpp/types/is_constructible.html',0,'std']]],
-  ['is_5fconvertible_109',['is_convertible',['http://en.cppreference.com/w/cpp/types/is_convertible.html',0,'std']]],
-  ['is_5fcopy_5fassignable_110',['is_copy_assignable',['http://en.cppreference.com/w/cpp/types/is_copy_assignable.html',0,'std']]],
-  ['is_5fcopy_5fconstructible_111',['is_copy_constructible',['http://en.cppreference.com/w/cpp/types/is_copy_constructible.html',0,'std']]],
-  ['is_5fdefault_5fconstructible_112',['is_default_constructible',['http://en.cppreference.com/w/cpp/types/is_default_constructible.html',0,'std']]],
-  ['is_5fdestructible_113',['is_destructible',['http://en.cppreference.com/w/cpp/types/is_destructible.html',0,'std']]],
-  ['is_5fempty_114',['is_empty',['http://en.cppreference.com/w/cpp/types/is_empty.html',0,'std']]],
-  ['is_5fenum_115',['is_enum',['http://en.cppreference.com/w/cpp/types/is_enum.html',0,'std']]],
-  ['is_5ferror_5fcode_5fenum_116',['is_error_code_enum',['http://en.cppreference.com/w/cpp/error/error_code/is_error_code_enum.html',0,'std']]],
-  ['is_5ferror_5fcondition_5fenum_117',['is_error_condition_enum',['http://en.cppreference.com/w/cpp/error/error_condition/is_error_condition_enum.html',0,'std']]],
-  ['is_5ffactorial_118',['is_factorial',['../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca',1,'math']]],
-  ['is_5ffloating_5fpoint_119',['is_floating_point',['http://en.cppreference.com/w/cpp/types/is_floating_point.html',0,'std']]],
-  ['is_5ffunction_120',['is_function',['http://en.cppreference.com/w/cpp/types/is_function.html',0,'std']]],
-  ['is_5ffundamental_121',['is_fundamental',['http://en.cppreference.com/w/cpp/types/is_fundamental.html',0,'std']]],
-  ['is_5fgraph_5fbipartite_122',['is_graph_bipartite',['../de/d83/namespaceis__graph__bipartite.html',1,'']]],
-  ['is_5fgraph_5fbipartite_2ecpp_123',['is_graph_bipartite.cpp',['../d6/dd8/is__graph__bipartite_8cpp.html',1,'']]],
-  ['is_5fhappy_124',['is_happy',['../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7',1,'happy_number.cpp']]],
-  ['is_5fheap_125',['is_heap',['http://en.cppreference.com/w/cpp/algorithm/is_heap.html',0,'std']]],
-  ['is_5fheap_5funtil_126',['is_heap_until',['http://en.cppreference.com/w/cpp/algorithm/is_heap_until.html',0,'std']]],
-  ['is_5fintegral_127',['is_integral',['http://en.cppreference.com/w/cpp/types/is_integral.html',0,'std']]],
-  ['is_5fintegral_3c_20uint128_5ft_20_3e_128',['is_integral&lt; uint128_t &gt;',['../d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html',1,'std']]],
-  ['is_5fintegral_3c_20uint256_5ft_20_3e_129',['is_integral&lt; uint256_t &gt;',['../d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html',1,'std']]],
-  ['is_5fliteral_5ftype_130',['is_literal_type',['http://en.cppreference.com/w/cpp/types/is_literal_type.html',0,'std']]],
-  ['is_5flock_5ffree_131',['is_lock_free',['http://en.cppreference.com/w/cpp/atomic/atomic/is_lock_free.html',0,'std::atomic']]],
-  ['is_5flvalue_5freference_132',['is_lvalue_reference',['http://en.cppreference.com/w/cpp/types/is_lvalue_reference.html',0,'std']]],
-  ['is_5fmember_5ffunction_5fpointer_133',['is_member_function_pointer',['http://en.cppreference.com/w/cpp/types/is_member_function_pointer.html',0,'std']]],
-  ['is_5fmember_5fobject_5fpointer_134',['is_member_object_pointer',['http://en.cppreference.com/w/cpp/types/is_member_object_pointer.html',0,'std']]],
-  ['is_5fmember_5fpointer_135',['is_member_pointer',['http://en.cppreference.com/w/cpp/types/is_member_pointer.html',0,'std']]],
-  ['is_5fmove_5fassignable_136',['is_move_assignable',['http://en.cppreference.com/w/cpp/types/is_move_assignable.html',0,'std']]],
-  ['is_5fmove_5fconstructible_137',['is_move_constructible',['http://en.cppreference.com/w/cpp/types/is_move_constructible.html',0,'std']]],
-  ['is_5fnothrow_5fassignable_138',['is_nothrow_assignable',['http://en.cppreference.com/w/cpp/types/is_assignable.html',0,'std']]],
-  ['is_5fnothrow_5fconstructible_139',['is_nothrow_constructible',['http://en.cppreference.com/w/cpp/types/is_constructible.html',0,'std']]],
-  ['is_5fnothrow_5fcopy_5fassignable_140',['is_nothrow_copy_assignable',['http://en.cppreference.com/w/cpp/types/is_copy_assignable.html',0,'std']]],
-  ['is_5fnothrow_5fcopy_5fconstructible_141',['is_nothrow_copy_constructible',['http://en.cppreference.com/w/cpp/types/is_copy_constructible.html',0,'std']]],
-  ['is_5fnothrow_5fdefault_5fconstructible_142',['is_nothrow_default_constructible',['http://en.cppreference.com/w/cpp/types/is_default_constructible.html',0,'std']]],
-  ['is_5fnothrow_5fdestructible_143',['is_nothrow_destructible',['http://en.cppreference.com/w/cpp/types/is_destructible.html',0,'std']]],
-  ['is_5fnothrow_5fmove_5fassignable_144',['is_nothrow_move_assignable',['http://en.cppreference.com/w/cpp/types/is_move_assignable.html',0,'std']]],
-  ['is_5fnothrow_5fmove_5fconstructible_145',['is_nothrow_move_constructible',['http://en.cppreference.com/w/cpp/types/is_move_constructible.html',0,'std']]],
-  ['is_5fnumber_146',['is_number',['../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59',1,'games::memory_game::is_number()'],['../d7/d75/postfix__evaluation_8cpp.html#a4c27f949c9d6659be9f5bd2ccbe1360a',1,'others::postfix_expression::is_number()']]],
-  ['is_5fobject_147',['is_object',['http://en.cppreference.com/w/cpp/types/is_object.html',0,'std']]],
-  ['is_5fopen_148',['is_open',['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::basic_ofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::fstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::basic_filebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::basic_fstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::wfilebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::wifstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::filebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::ofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::basic_ifstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::wfstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::wofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::ifstream::is_open()']]],
-  ['is_5fpartitioned_149',['is_partitioned',['http://en.cppreference.com/w/cpp/algorithm/is_partitioned.html',0,'std']]],
-  ['is_5fpermutation_150',['is_permutation',['http://en.cppreference.com/w/cpp/algorithm/is_permutation.html',0,'std']]],
-  ['is_5fplaceholder_151',['is_placeholder',['http://en.cppreference.com/w/cpp/utility/functional/is_placeholder.html',0,'std']]],
-  ['is_5fpod_152',['is_pod',['http://en.cppreference.com/w/cpp/types/is_pod.html',0,'std']]],
-  ['is_5fpointer_153',['is_pointer',['http://en.cppreference.com/w/cpp/types/is_pointer.html',0,'std']]],
-  ['is_5fpolymorphic_154',['is_polymorphic',['http://en.cppreference.com/w/cpp/types/is_polymorphic.html',0,'std']]],
-  ['is_5fprefix_155',['is_prefix',['../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a',1,'strings::boyer_moore']]],
-  ['is_5fprime_156',['is_prime',['../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444',1,'math']]],
-  ['is_5freference_157',['is_reference',['http://en.cppreference.com/w/cpp/types/is_reference.html',0,'std']]],
-  ['is_5frvalue_5freference_158',['is_rvalue_reference',['http://en.cppreference.com/w/cpp/types/is_rvalue_reference.html',0,'std']]],
-  ['is_5fsame_159',['is_same',['http://en.cppreference.com/w/cpp/types/is_same.html',0,'std']]],
-  ['is_5fscalar_160',['is_scalar',['http://en.cppreference.com/w/cpp/types/is_scalar.html',0,'std']]],
-  ['is_5fsigned_161',['is_signed',['http://en.cppreference.com/w/cpp/types/is_signed.html',0,'std']]],
-  ['is_5fsorted_162',['is_sorted',['http://en.cppreference.com/w/cpp/algorithm/is_sorted.html',0,'std']]],
-  ['is_5fsorted_5funtil_163',['is_sorted_until',['http://en.cppreference.com/w/cpp/algorithm/is_sorted_until.html',0,'std']]],
-  ['is_5fsquare_164',['is_square',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e',1,'ordinary_least_squares_regressor.cpp']]],
-  ['is_5fstandard_5flayout_165',['is_standard_layout',['http://en.cppreference.com/w/cpp/types/is_standard_layout.html',0,'std']]],
-  ['is_5ftrivial_166',['is_trivial',['http://en.cppreference.com/w/cpp/types/is_trivial.html',0,'std']]],
-  ['is_5ftrivially_5fassignable_167',['is_trivially_assignable',['http://en.cppreference.com/w/cpp/types/is_assignable.html',0,'std']]],
-  ['is_5ftrivially_5fconstructible_168',['is_trivially_constructible',['http://en.cppreference.com/w/cpp/types/is_constructible.html',0,'std']]],
-  ['is_5ftrivially_5fcopy_5fassignable_169',['is_trivially_copy_assignable',['http://en.cppreference.com/w/cpp/types/is_copy_assignable.html',0,'std']]],
-  ['is_5ftrivially_5fcopy_5fconstructible_170',['is_trivially_copy_constructible',['http://en.cppreference.com/w/cpp/types/is_copy_constructible.html',0,'std']]],
-  ['is_5ftrivially_5fcopyable_171',['is_trivially_copyable',['http://en.cppreference.com/w/cpp/types/is_trivially_copyable.html',0,'std']]],
-  ['is_5ftrivially_5fdefault_5fconstructible_172',['is_trivially_default_constructible',['http://en.cppreference.com/w/cpp/types/is_default_constructible.html',0,'std']]],
-  ['is_5ftrivially_5fdestructible_173',['is_trivially_destructible',['http://en.cppreference.com/w/cpp/types/is_destructible.html',0,'std']]],
-  ['is_5ftrivially_5fmove_5fassignable_174',['is_trivially_move_assignable',['http://en.cppreference.com/w/cpp/types/is_move_assignable.html',0,'std']]],
-  ['is_5ftrivially_5fmove_5fconstructible_175',['is_trivially_move_constructible',['http://en.cppreference.com/w/cpp/types/is_move_constructible.html',0,'std']]],
-  ['is_5funion_176',['is_union',['http://en.cppreference.com/w/cpp/types/is_union.html',0,'std']]],
-  ['is_5funsigned_177',['is_unsigned',['http://en.cppreference.com/w/cpp/types/is_unsigned.html',0,'std']]],
-  ['is_5funsigned_3c_20uint128_5ft_20_3e_178',['is_unsigned&lt; uint128_t &gt;',['../d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html',1,'std']]],
-  ['is_5funsigned_3c_20uint256_5ft_20_3e_179',['is_unsigned&lt; uint256_t &gt;',['../df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html',1,'std']]],
-  ['is_5fvoid_180',['is_void',['http://en.cppreference.com/w/cpp/types/is_void.html',0,'std']]],
-  ['is_5fvolatile_181',['is_volatile',['http://en.cppreference.com/w/cpp/types/is_volatile.html',0,'std']]],
-  ['isalnum_182',['isalnum',['http://en.cppreference.com/w/cpp/string/byte/isalnum.html',0,'std']]],
-  ['isalpha_183',['isalpha',['http://en.cppreference.com/w/cpp/string/byte/isalpha.html',0,'std']]],
-  ['isbigendian_184',['isBigEndian',['../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446',1,'hashing::md5']]],
-  ['isbipartite_185',['isBipartite',['../df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b',1,'graph']]],
-  ['isblank_186',['isblank',['http://en.cppreference.com/w/cpp/string/byte/isblank.html',0,'std']]],
-  ['iscntrl_187',['iscntrl',['http://en.cppreference.com/w/cpp/string/byte/iscntrl.html',0,'std']]],
-  ['isctype_188',['isctype',['http://en.cppreference.com/w/cpp/regex/regex_traits/isctype.html',0,'std::regex_traits']]],
-  ['iscyclicbfs_189',['isCyclicBFS',['../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5',1,'CycleCheck']]],
-  ['iscyclicdfs_190',['isCyclicDFS',['../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474',1,'CycleCheck']]],
-  ['iscyclicdfshelper_191',['isCyclicDFSHelper',['../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b',1,'CycleCheck']]],
-  ['isdigit_192',['isDigit',['../da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180',1,'data_structures::linked_list']]],
-  ['isdigit_193',['isdigit',['http://en.cppreference.com/w/cpp/string/byte/isdigit.html',0,'std']]],
-  ['isempty_194',['isEmpty',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897',1,'data_structures::linked_list::list::isEmpty()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a73c52b2243a6c9501af65756123e7149',1,'data_structures::linked_list::list::isEmpty() const']]],
-  ['isemptyqueue_195',['isEmptyQueue',['../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec',1,'queue']]],
-  ['isemptystack_196',['isEmptyStack',['../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5',1,'stack']]],
-  ['isendofword_197',['isEndofWord',['../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6',1,'data_structures::trie']]],
-  ['isfinite_198',['isfinite',['http://en.cppreference.com/w/cpp/numeric/math/isfinite.html',0,'std']]],
-  ['isfull_199',['IsFull',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd',1,'data_structures::tree_234::Node']]],
-  ['isgraph_200',['isgraph',['http://en.cppreference.com/w/cpp/string/byte/isgraph.html',0,'std']]],
-  ['isinf_201',['isinf',['http://en.cppreference.com/w/cpp/numeric/math/isinf.html',0,'std']]],
-  ['isleaf_202',['IsLeaf',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8',1,'data_structures::tree_234::Node']]],
-  ['islower_203',['islower',['http://en.cppreference.com/w/cpp/string/byte/islower.html',0,'std']]],
-  ['isnan_204',['isnan',['http://en.cppreference.com/w/cpp/numeric/math/isnan.html',0,'std']]],
-  ['isnormal_205',['isnormal',['http://en.cppreference.com/w/cpp/numeric/math/isnormal.html',0,'std']]],
-  ['ispossible_206',['isPossible',['../d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0',1,'backtracking::sudoku_solver']]],
-  ['ispoweroftwo_207',['isPowerOfTwo',['../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f',1,'bit_manipulation']]],
-  ['isprime_208',['IsPrime',['../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf',1,'primality_test.cpp']]],
-  ['isprime_209',['isPrime',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aba4929409fee35c3cb559e962a544b3e',1,'math::modular_inverse_fermat']]],
-  ['isprime_210',['isprime',['../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23',1,'prime_factorization.cpp']]],
-  ['isprint_211',['isprint',['http://en.cppreference.com/w/cpp/string/byte/isprint.html',0,'std']]],
-  ['ispunct_212',['ispunct',['http://en.cppreference.com/w/cpp/string/byte/ispunct.html',0,'std']]],
-  ['issafe_213',['isSafe',['../d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d',1,'backtracking::graph_coloring::isSafe()'],['../d4/d3e/n__queens_8cpp.html#a5730b6683f6adcf5c5ef75cf53dc7160',1,'backtracking::n_queens::isSafe()']]],
-  ['issafe_214',['issafe',['../d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2',1,'backtracking::knight_tour']]],
-  ['issame_215',['isSame',['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)'],['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)']]],
-  ['isspace_216',['isspace',['http://en.cppreference.com/w/cpp/string/byte/isspace.html',0,'std']]],
-  ['istream_217',['istream',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std::istream'],['http://en.cppreference.com/w/cpp/io/basic_istream/basic_istream.html',0,'std::istream::istream()']]],
-  ['istream_5fiterator_218',['istream_iterator',['http://en.cppreference.com/w/cpp/iterator/istream_iterator.html',0,'std']]],
-  ['istreambuf_5fiterator_219',['istreambuf_iterator',['http://en.cppreference.com/w/cpp/iterator/istreambuf_iterator.html',0,'std']]],
-  ['istringstream_220',['istringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std::istringstream'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::istringstream::istringstream()']]],
-  ['istrstream_221',['istrstream',['http://en.cppreference.com/w/cpp/io/istrstream.html',0,'std::istrstream'],['http://en.cppreference.com/w/cpp/io/istrstream/istrstream.html',0,'std::istrstream::istrstream()']]],
-  ['isupper_222',['isupper',['http://en.cppreference.com/w/cpp/string/byte/isupper.html',0,'std']]],
-  ['isvalidbinarystring_223',['isValidBinaryString',['../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2',1,'greedy_algorithms::BinaryAddition']]],
-  ['iswalnum_224',['iswalnum',['http://en.cppreference.com/w/cpp/string/wide/iswalnum.html',0,'std']]],
-  ['iswalpha_225',['iswalpha',['http://en.cppreference.com/w/cpp/string/wide/iswalpha.html',0,'std']]],
-  ['iswblank_226',['iswblank',['http://en.cppreference.com/w/cpp/string/wide/iswblank.html',0,'std']]],
-  ['iswcntrl_227',['iswcntrl',['http://en.cppreference.com/w/cpp/string/wide/iswcntrl.html',0,'std']]],
-  ['iswctype_228',['iswctype',['http://en.cppreference.com/w/cpp/string/wide/iswctype.html',0,'std']]],
-  ['iswdigit_229',['iswdigit',['http://en.cppreference.com/w/cpp/string/wide/iswdigit.html',0,'std']]],
-  ['iswgraph_230',['iswgraph',['http://en.cppreference.com/w/cpp/string/wide/iswgraph.html',0,'std']]],
-  ['iswlower_231',['iswlower',['http://en.cppreference.com/w/cpp/string/wide/iswlower.html',0,'std']]],
-  ['iswprint_232',['iswprint',['http://en.cppreference.com/w/cpp/string/wide/iswprint.html',0,'std']]],
-  ['iswpunct_233',['iswpunct',['http://en.cppreference.com/w/cpp/string/wide/iswpunct.html',0,'std']]],
-  ['iswspace_234',['iswspace',['http://en.cppreference.com/w/cpp/string/wide/iswspace.html',0,'std']]],
-  ['iswupper_235',['iswupper',['http://en.cppreference.com/w/cpp/string/wide/iswupper.html',0,'std']]],
-  ['iswxdigit_236',['iswxdigit',['http://en.cppreference.com/w/cpp/string/wide/iswxdigit.html',0,'std']]],
-  ['isxdigit_237',['isxdigit',['http://en.cppreference.com/w/cpp/string/byte/isxdigit.html',0,'std']]],
-  ['it_5fternary_5fsearch_238',['it_ternary_search',['../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0',1,'ternary_search.cpp']]],
-  ['item_239',['Item',['../db/d66/struct_item.html',1,'']]],
-  ['items_240',['items',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9',1,'data_structures::tree_234::Node']]],
-  ['iter_5fswap_241',['iter_swap',['http://en.cppreference.com/w/cpp/algorithm/iter_swap.html',0,'std']]],
-  ['iter_5ftype_242',['iter_type',['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std::num_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get_byname::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put_byname::iter_type']]],
-  ['iterative_20inorder_20traversal_20of_20a_20tree_243',['Iterative Inorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree']]],
-  ['iterative_20postorder_20traversal_20of_20a_20tree_244',['Iterative Postorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree']]],
-  ['iterative_20preorder_20traversal_20of_20a_20tree_245',['Iterative Preorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]],
-  ['iterative_5ffactorial_2ecpp_246',['iterative_factorial.cpp',['../db/d9f/iterative__factorial_8cpp.html',1,'']]],
-  ['iterative_5ftree_5ftraversals_247',['iterative_tree_traversals',['../dd/d73/namespaceiterative__tree__traversals.html',1,'']]],
-  ['iterative_5ftree_5ftraversals_2ecpp_248',['iterative_tree_traversals.cpp',['../d8/d90/iterative__tree__traversals_8cpp.html',1,'']]],
-  ['iterativefactorial_249',['iterativeFactorial',['../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a',1,'math']]],
-  ['iterativequicksort_250',['iterativeQuickSort',['../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5',1,'sorting']]],
-  ['iterator_251',['iterator',['http://en.cppreference.com/w/cpp/iterator/iterator.html',0,'std']]],
-  ['iterator_5ftraits_252',['iterator_traits',['http://en.cppreference.com/w/cpp/iterator/iterator_traits.html',0,'std']]],
-  ['iword_253',['iword',['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::fstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ios::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_fstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::iostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ios_base::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wistream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::stringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wifstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_istream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::strstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_stringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istrstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wiostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_istringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ifstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostrstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wfstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_iostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wstringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wistringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ifstream::iword()']]]
+  ['identity_5ffunction_1',['identity_function',['../d2/d58/neural__network_8cpp.html#a32c00da08f2cf641dd336270f6e3c407',1,'machine_learning::neural_network::util_functions']]],
+  ['imag_2',['imag',['../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974',1,'Complex']]],
+  ['imod_3',['imod',['../d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6',1,'modular_inverse_simple.cpp']]],
+  ['implementation_4',['Implementation',['../d4/d9f/selection__sort__recursive_8cpp.html#autotoc_md117',1,'']]],
+  ['in_20a_20new_20directory_5',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]],
+  ['in_5frange_6',['in_range',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e',1,'machine_learning::aystar_search::EightPuzzle']]],
+  ['increase_5ffrequency_7',['increase_frequency',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9',1,'others::Cache::LFUCache']]],
+  ['inf_8',['INF',['../d7/d07/bidirectional__dijkstra_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c',1,'INF:&#160;bidirectional_dijkstra.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c',1,'INF:&#160;depth_first_search_with_stack.cpp']]],
+  ['info_9',['Info',['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html',1,'machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info'],['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#acd897e6e519849edb9fb0d1e1bfa881a',1,'machine_learning::aystar_search::AyStarSearch::Info'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7',1,'machine_learning::aystar_search::AyStarSearch::Info::Info()=default'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a695e4314ebc3ab58e13004dc63599fe8',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Puzzle &amp;A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3950824936488f66408313b1f8a8ca8',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Puzzle &amp;A, size_t h_value, size_t d)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a572de12115e39e34dde6e68b707d59f5',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Info &amp;A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a6abc89925ae7055a63b428e61525ad7a',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Info &amp;&amp;A) noexcept']]],
+  ['init_10',['init',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc',1,'range_queries::heavy_light_decomposition::Tree::init()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828',1,'range_queries::heavy_light_decomposition::HLD::init()'],['../d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214',1,'games::memory_game::init()']]],
+  ['init_5fbad_5fchar_11',['init_bad_char',['../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00',1,'strings::boyer_moore']]],
+  ['init_5fgood_5fsuffix_12',['init_good_suffix',['../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1',1,'strings::boyer_moore']]],
+  ['init_5fpattern_13',['init_pattern',['../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8',1,'strings::boyer_moore']]],
+  ['inorder_20traversal_20of_20a_20tree_14',['Inorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree']]],
+  ['inorder_5fsuccessor_5fof_5fbst_15',['inorder_successor_of_bst',['../dd/d74/namespaceinorder__successor__of__bst.html',1,'']]],
+  ['inorder_5fsuccessor_5fof_5fbst_2ecpp_16',['inorder_successor_of_bst.cpp',['../d4/d32/inorder__successor__of__bst_8cpp.html',1,'']]],
+  ['inorderiterative_17',['inOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499',1,'others::iterative_tree_traversals::BinaryTree']]],
+  ['insameunion_18',['InSameUnion',['../de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985',1,'disjoint_set.cpp']]],
+  ['insert_19',['Insert',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e',1,'data_structures::tree_234::Tree234::Insert(int64_t item)'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f',1,'data_structures::tree_234::Tree234::Insert(Node *tree, int64_t item)'],['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c',1,'operations_on_datastructures::trie_operations::Tnode::Insert()'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a3ae0bea4123fd2ce155108e88f2ef78c',1,'operations_on_datastructures::inorder_traversal_of_bst::Insert()']]],
+  ['insert_20',['insert',['../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778',1,'binary_search_tree::insert(std::unique_ptr&lt; bst_node &gt; &amp;node, T new_value)'],['../d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0',1,'binary_search_tree::insert(T new_value)'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1',1,'data_structures::list_array::list::insert()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1',1,'data_structures::linked_list::list::insert()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f',1,'data_structures::treap::Treap::insert()'],['../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2',1,'Trie::insert()'],['../d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546',1,'data_structures::trie::insert()'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2',1,'data_structures::trie_using_hashmap::Trie::insert()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(const std::vector&lt; int64_t &gt; &amp;values)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a3b7bbb0918c261bc216aef9e6dd39aa4',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(int64_t data)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(Node *node)'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::insert()'],['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7',1,'probability::windowed_median::WindowedMedian::insert()'],['../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b',1,'insert():&#160;avltree.cpp']]],
+  ['insert_5felement_21',['insert_element',['../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd',1,'machine_learning']]],
+  ['insertatthebeginning_22',['insertAtTheBeginning',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df',1,'linkedlist_implentation_usingarray.cpp']]],
+  ['insertelement_23',['insertElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9',1,'data_structures::SkipList']]],
+  ['insertion_5fsort_2ecpp_24',['insertion_sort.cpp',['../dd/d0d/insertion__sort_8cpp.html',1,'']]],
+  ['insertion_5fsort_5frecursive_2ecpp_25',['insertion_sort_recursive.cpp',['../dd/d89/insertion__sort__recursive_8cpp.html',1,'']]],
+  ['insertionsort_26',['InsertionSort',['../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1',1,'sorting::merge_insertion']]],
+  ['insertionsort_27',['insertionSort',['../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9',1,'sorting::insertionSort(T *arr, int n)'],['../d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f',1,'sorting::insertionSort(std::vector&lt; T &gt; *arr)']]],
+  ['insertionsort_5fbinsrch_28',['insertionSort_binsrch',['../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68',1,'sorting']]],
+  ['insertitem_29',['InsertItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb',1,'data_structures::tree_234::Node']]],
+  ['insertitembyindex_30',['InsertItemByIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956',1,'data_structures::tree_234::Node']]],
+  ['insertkey_31',['insertKey',['../d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82',1,'MinHeap']]],
+  ['insertpostmerge_32',['InsertPostMerge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aa7e5e00033f38006a224f30bdbf3f703',1,'data_structures::tree_234::Tree234']]],
+  ['insertpresplit_33',['InsertPreSplit',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d',1,'data_structures::tree_234::Tree234']]],
+  ['inserttosorted_34',['insertToSorted',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24',1,'probability::windowed_median::WindowedMedian']]],
+  ['integral_5fapprox_35',['integral_approx',['../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11',1,'math']]],
+  ['integral_5fapproximation_2ecpp_36',['integral_approximation.cpp',['../d1/de9/integral__approximation_8cpp.html',1,'']]],
+  ['integral_5fapproximation2_2ecpp_37',['integral_approximation2.cpp',['../db/d40/integral__approximation2_8cpp.html',1,'']]],
+  ['integral_5fmonte_5fcarlo_38',['integral_monte_carlo',['../db/d40/integral__approximation2_8cpp.html#af7da9ba8932f1f48b9bbc2d80471af51',1,'math::monte_carlo']]],
+  ['integrating_20cmake_20in_20a_20new_20directory_39',['Integrating CMake in a new directory',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html#autotoc_md34',1,'']]],
+  ['interactive_40',['interactive',['../d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661',1,'interactive():&#160;md5.cpp'],['../d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661',1,'interactive():&#160;sha1.cpp']]],
+  ['interface_41',['User-interface',['../dc/d64/md__coding_guidelines.html#autotoc_md18',1,'']]],
+  ['interpolation_5fsearch_42',['interpolation_search',['../d1/d64/namespaceinterpolation__search.html',1,'']]],
+  ['interpolation_5fsearch2_2ecpp_43',['interpolation_search2.cpp',['../df/d39/interpolation__search2_8cpp.html',1,'']]],
+  ['interpolationsearch_44',['InterpolationSearch',['../df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629',1,'interpolation_search2.cpp']]],
+  ['intersection_5fof_5ftwo_5farrays_2ecpp_45',['intersection_of_two_arrays.cpp',['../de/dc5/intersection__of__two__arrays_8cpp.html',1,'']]],
+  ['inv_5fsqrt_2ecpp_46',['inv_sqrt.cpp',['../d6/db8/inv__sqrt_8cpp.html',1,'']]],
+  ['inverse_5fcumulative_5fdistribution_47',['inverse_cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf',1,'probability::geometric_dist::geometric_distribution']]],
+  ['inverse_5ffast_5ffourier_5ftransform_2ecpp_48',['inverse_fast_fourier_transform.cpp',['../d9/d37/inverse__fast__fourier__transform_8cpp.html',1,'']]],
+  ['inversefastfouriertransform_49',['InverseFastFourierTransform',['../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93',1,'numerical_methods']]],
+  ['inversion_50',['inversion',['../d9/d13/namespaceinversion.html',1,'']]],
+  ['is2node_51',['Is2Node',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631',1,'data_structures::tree_234::Node']]],
+  ['is34node_52',['Is34Node',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18',1,'data_structures::tree_234::Node']]],
+  ['is_5farithmetic_3c_20uint128_5ft_20_3e_53',['is_arithmetic&lt; uint128_t &gt;',['../d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html',1,'std']]],
+  ['is_5farithmetic_3c_20uint256_5ft_20_3e_54',['is_arithmetic&lt; uint256_t &gt;',['../dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html',1,'std']]],
+  ['is_5farmstrong_55',['is_armstrong',['../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26',1,'dynamic_programming']]],
+  ['is_5fbipartite_56',['is_bipartite',['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad475f8b838693812f7569a490729f373',1,'graph::is_graph_bipartite::Graph']]],
+  ['is_5ffactorial_57',['is_factorial',['../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca',1,'math']]],
+  ['is_5fgraph_5fbipartite_58',['is_graph_bipartite',['../de/d83/namespaceis__graph__bipartite.html',1,'']]],
+  ['is_5fgraph_5fbipartite_2ecpp_59',['is_graph_bipartite.cpp',['../d6/dd8/is__graph__bipartite_8cpp.html',1,'']]],
+  ['is_5fhappy_60',['is_happy',['../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7',1,'happy_number.cpp']]],
+  ['is_5fintegral_3c_20uint128_5ft_20_3e_61',['is_integral&lt; uint128_t &gt;',['../d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html',1,'std']]],
+  ['is_5fintegral_3c_20uint256_5ft_20_3e_62',['is_integral&lt; uint256_t &gt;',['../d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html',1,'std']]],
+  ['is_5fnumber_63',['is_number',['../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59',1,'games::memory_game::is_number()'],['../d7/d75/postfix__evaluation_8cpp.html#a4c27f949c9d6659be9f5bd2ccbe1360a',1,'others::postfix_expression::is_number()']]],
+  ['is_5fprefix_64',['is_prefix',['../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a',1,'strings::boyer_moore']]],
+  ['is_5fprime_65',['is_prime',['../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444',1,'math']]],
+  ['is_5fsquare_66',['is_square',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e',1,'ordinary_least_squares_regressor.cpp']]],
+  ['is_5funsigned_3c_20uint128_5ft_20_3e_67',['is_unsigned&lt; uint128_t &gt;',['../d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html',1,'std']]],
+  ['is_5funsigned_3c_20uint256_5ft_20_3e_68',['is_unsigned&lt; uint256_t &gt;',['../df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html',1,'std']]],
+  ['isbigendian_69',['isBigEndian',['../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446',1,'hashing::md5']]],
+  ['isbipartite_70',['isBipartite',['../df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b',1,'graph']]],
+  ['iscyclicbfs_71',['isCyclicBFS',['../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5',1,'CycleCheck']]],
+  ['iscyclicdfs_72',['isCyclicDFS',['../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474',1,'CycleCheck']]],
+  ['iscyclicdfshelper_73',['isCyclicDFSHelper',['../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b',1,'CycleCheck']]],
+  ['isdigit_74',['isDigit',['../da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180',1,'data_structures::linked_list']]],
+  ['isempty_75',['isEmpty',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897',1,'data_structures::linked_list::list::isEmpty()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a73c52b2243a6c9501af65756123e7149',1,'data_structures::linked_list::list::isEmpty() const']]],
+  ['isemptyqueue_76',['isEmptyQueue',['../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec',1,'queue']]],
+  ['isemptystack_77',['isEmptyStack',['../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5',1,'stack']]],
+  ['isendofword_78',['isEndofWord',['../d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6',1,'data_structures::trie']]],
+  ['isfull_79',['IsFull',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd',1,'data_structures::tree_234::Node']]],
+  ['isleaf_80',['IsLeaf',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8',1,'data_structures::tree_234::Node']]],
+  ['ispossible_81',['isPossible',['../d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0',1,'backtracking::sudoku_solver']]],
+  ['ispoweroftwo_82',['isPowerOfTwo',['../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f',1,'bit_manipulation']]],
+  ['isprime_83',['IsPrime',['../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf',1,'primality_test.cpp']]],
+  ['isprime_84',['isPrime',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aba4929409fee35c3cb559e962a544b3e',1,'math::modular_inverse_fermat']]],
+  ['isprime_85',['isprime',['../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23',1,'prime_factorization.cpp']]],
+  ['issafe_86',['isSafe',['../d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d',1,'backtracking::graph_coloring::isSafe()'],['../d4/d3e/n__queens_8cpp.html#a5730b6683f6adcf5c5ef75cf53dc7160',1,'backtracking::n_queens::isSafe()']]],
+  ['issafe_87',['issafe',['../d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2',1,'backtracking::knight_tour']]],
+  ['issame_88',['isSame',['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)'],['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)']]],
+  ['isvalidbinarystring_89',['isValidBinaryString',['../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2',1,'greedy_algorithms::BinaryAddition']]],
+  ['it_5fternary_5fsearch_90',['it_ternary_search',['../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0',1,'ternary_search.cpp']]],
+  ['item_91',['Item',['../db/d66/struct_item.html',1,'']]],
+  ['items_92',['items',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9',1,'data_structures::tree_234::Node']]],
+  ['iterative_20inorder_20traversal_20of_20a_20tree_93',['Iterative Inorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Inorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md99',1,'Iterative Inorder Traversal of a tree']]],
+  ['iterative_20postorder_20traversal_20of_20a_20tree_94',['Iterative Postorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Postorder Traversal of a tree']]],
+  ['iterative_20preorder_20traversal_20of_20a_20tree_95',['Iterative Preorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md93',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md100',1,'Iterative Preorder Traversal of a tree']]],
+  ['iterative_5ffactorial_2ecpp_96',['iterative_factorial.cpp',['../db/d9f/iterative__factorial_8cpp.html',1,'']]],
+  ['iterative_5ftree_5ftraversals_97',['iterative_tree_traversals',['../dd/d73/namespaceiterative__tree__traversals.html',1,'']]],
+  ['iterative_5ftree_5ftraversals_2ecpp_98',['iterative_tree_traversals.cpp',['../d8/d90/iterative__tree__traversals_8cpp.html',1,'']]],
+  ['iterativefactorial_99',['iterativeFactorial',['../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a',1,'math']]],
+  ['iterativequicksort_100',['iterativeQuickSort',['../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5',1,'sorting']]]
 ];
diff --git a/search/all_f.js b/search/all_f.js
index aafac8b35..3e853819d 100644
--- a/search/all_f.js
+++ b/search/all_f.js
@@ -2,10 +2,7 @@ var searchData=
 [
   ['jarvis_0',['jarvis',['../d5/da7/namespacejarvis.html',1,'']]],
   ['jarvis_5falgorithm_2ecpp_1',['jarvis_algorithm.cpp',['../d4/d8d/jarvis__algorithm_8cpp.html',1,'']]],
-  ['jmp_5fbuf_2',['jmp_buf',['http://en.cppreference.com/w/cpp/utility/program/jmp_buf.html',0,'std']]],
-  ['join_3',['join',['http://en.cppreference.com/w/cpp/thread/thread/join.html',0,'std::thread']]],
-  ['joinable_4',['joinable',['http://en.cppreference.com/w/cpp/thread/thread/joinable.html',0,'std::thread']]],
-  ['jump_5fgame_2ecpp_5',['jump_game.cpp',['../d6/dba/jump__game_8cpp.html',1,'']]],
-  ['jump_5fsearch_2ecpp_6',['jump_search.cpp',['../d2/d22/jump__search_8cpp.html',1,'']]],
-  ['jumpsearch_7',['jumpSearch',['../d2/d22/jump__search_8cpp.html#ab49fd8f401bfc71f63b74711390cccf0',1,'jump_search.cpp']]]
+  ['jump_5fgame_2ecpp_2',['jump_game.cpp',['../d6/dba/jump__game_8cpp.html',1,'']]],
+  ['jump_5fsearch_2ecpp_3',['jump_search.cpp',['../d2/d22/jump__search_8cpp.html',1,'']]],
+  ['jumpsearch_4',['jumpSearch',['../d2/d22/jump__search_8cpp.html#ab49fd8f401bfc71f63b74711390cccf0',1,'jump_search.cpp']]]
 ];
diff --git a/search/classes_0.js b/search/classes_0.js
index f69b7c4d8..4fda64cb2 100644
--- a/search/classes_0.js
+++ b/search/classes_0.js
@@ -1,33 +1,5 @@
 var searchData=
 [
   ['adaline_0',['adaline',['../d6/d30/classmachine__learning_1_1adaline.html',1,'machine_learning']]],
-  ['add_5fconst_1',['add_const',['http://en.cppreference.com/w/cpp/types/add_cv.html',0,'std']]],
-  ['add_5fcv_2',['add_cv',['http://en.cppreference.com/w/cpp/types/add_cv.html',0,'std']]],
-  ['add_5flvalue_5freference_3',['add_lvalue_reference',['http://en.cppreference.com/w/cpp/types/add_reference.html',0,'std']]],
-  ['add_5fpointer_4',['add_pointer',['http://en.cppreference.com/w/cpp/types/add_pointer.html',0,'std']]],
-  ['add_5frvalue_5freference_5',['add_rvalue_reference',['http://en.cppreference.com/w/cpp/types/add_reference.html',0,'std']]],
-  ['add_5fvolatile_6',['add_volatile',['http://en.cppreference.com/w/cpp/types/add_cv.html',0,'std']]],
-  ['adopt_5flock_5ft_7',['adopt_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]],
-  ['aligned_5fstorage_8',['aligned_storage',['http://en.cppreference.com/w/cpp/types/aligned_storage.html',0,'std']]],
-  ['aligned_5funion_9',['aligned_union',['http://en.cppreference.com/w/cpp/types/aligned_union.html',0,'std']]],
-  ['alignment_5fof_10',['alignment_of',['http://en.cppreference.com/w/cpp/types/alignment_of.html',0,'std']]],
-  ['allocator_11',['allocator',['http://en.cppreference.com/w/cpp/memory/allocator.html',0,'std']]],
-  ['allocator_5farg_5ft_12',['allocator_arg_t',['http://en.cppreference.com/w/cpp/memory/allocator_arg_t.html',0,'std']]],
-  ['allocator_5ftraits_13',['allocator_traits',['http://en.cppreference.com/w/cpp/memory/allocator_traits.html',0,'std']]],
-  ['array_14',['array',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20data_5fstructures_3a_3atree_5f234_3a_3anode_20_2a_2c_204_20_3e_15',['array&lt; data_structures::tree_234::Node *, 4 &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20float_2c_2020_20_3e_16',['array&lt; float, 20 &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20int_2c_20maxnode_20_3e_17',['array&lt; int, maxNode &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20int16_5ft_2c_20max_5fsize_20_3e_18',['array&lt; int16_t, max_size &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20int64_5ft_2c_203_20_3e_19',['array&lt; int64_t, 3 &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20int64_5ft_2c_20n_20_3e_20',['array&lt; int64_t, N &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20std_3a_3aarray_3c_20int_2c_202_20_3e_2c_20maxnode_20_3e_21',['array&lt; std::array&lt; int, 2 &gt;, maxNode &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20std_3a_3aarray_3c_20int64_5ft_2c_20n_20_3e_2c_20m_20_3e_22',['array&lt; std::array&lt; int64_t, N &gt;, M &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20std_3a_3aarray_3c_20uint32_5ft_2c_203_20_3e_2c_203_20_3e_23',['array&lt; std::array&lt; uint32_t, 3 &gt;, 3 &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20uint32_5ft_2c_208_20_3e_24',['array&lt; uint32_t, 8 &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['array_3c_20uint64_5ft_2c_20n_20_3e_25',['array&lt; uint64_t, N &gt;',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]],
-  ['atomic_26',['atomic',['http://en.cppreference.com/w/cpp/atomic/atomic.html',0,'std']]],
-  ['atomic_5fflag_27',['atomic_flag',['http://en.cppreference.com/w/cpp/atomic/atomic_flag.html',0,'std']]],
-  ['auto_5fptr_28',['auto_ptr',['http://en.cppreference.com/w/cpp/memory/auto_ptr.html',0,'std']]],
-  ['aystarsearch_29',['AyStarSearch',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html',1,'machine_learning::aystar_search']]]
+  ['aystarsearch_1',['AyStarSearch',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html',1,'machine_learning::aystar_search']]]
 ];
diff --git a/search/classes_1.js b/search/classes_1.js
index 51097c7fd..de21f2437 100644
--- a/search/classes_1.js
+++ b/search/classes_1.js
@@ -1,71 +1,11 @@
 var searchData=
 [
-  ['back_5finsert_5fiterator_0',['back_insert_iterator',['http://en.cppreference.com/w/cpp/iterator/back_insert_iterator.html',0,'std']]],
-  ['bad_5falloc_1',['bad_alloc',['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std']]],
-  ['bad_5farray_5flength_2',['bad_array_length',['http://en.cppreference.com/w/cpp/memory/new/bad_array_length.html',0,'std']]],
-  ['bad_5farray_5fnew_5flength_3',['bad_array_new_length',['http://en.cppreference.com/w/cpp/memory/new/bad_array_new_length.html',0,'std']]],
-  ['bad_5fcast_4',['bad_cast',['http://en.cppreference.com/w/cpp/types/bad_cast.html',0,'std']]],
-  ['bad_5fexception_5',['bad_exception',['http://en.cppreference.com/w/cpp/error/bad_exception.html',0,'std']]],
-  ['bad_5ffunction_5fcall_6',['bad_function_call',['http://en.cppreference.com/w/cpp/utility/functional/bad_function_call.html',0,'std']]],
-  ['bad_5foptional_5faccess_7',['bad_optional_access',['http://en.cppreference.com/w/cpp/utility/bad_optional_access.html',0,'std']]],
-  ['bad_5ftypeid_8',['bad_typeid',['http://en.cppreference.com/w/cpp/types/bad_typeid.html',0,'std']]],
-  ['bad_5fweak_5fptr_9',['bad_weak_ptr',['http://en.cppreference.com/w/cpp/memory/bad_weak_ptr.html',0,'std']]],
-  ['basic_5ffilebuf_10',['basic_filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf.html',0,'std']]],
-  ['basic_5ffstream_11',['basic_fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std']]],
-  ['basic_5ffstream_3c_20char_20_3e_12',['basic_fstream&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std']]],
-  ['basic_5ffstream_3c_20wchar_5ft_20_3e_13',['basic_fstream&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std']]],
-  ['basic_5fifstream_14',['basic_ifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std']]],
-  ['basic_5fifstream_3c_20char_20_3e_15',['basic_ifstream&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std']]],
-  ['basic_5fifstream_3c_20wchar_5ft_20_3e_16',['basic_ifstream&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std']]],
-  ['basic_5fios_17',['basic_ios',['http://en.cppreference.com/w/cpp/io/basic_ios.html',0,'std']]],
-  ['basic_5fios_3c_20char_20_3e_18',['basic_ios&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_ios.html',0,'std']]],
-  ['basic_5fios_3c_20wchar_5ft_20_3e_19',['basic_ios&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_ios.html',0,'std']]],
-  ['basic_5fiostream_20',['basic_iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std']]],
-  ['basic_5fiostream_3c_20char_20_3e_21',['basic_iostream&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std']]],
-  ['basic_5fiostream_3c_20wchar_5ft_20_3e_22',['basic_iostream&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std']]],
-  ['basic_5fistream_23',['basic_istream',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]],
-  ['basic_5fistream_3c_20char_20_3e_24',['basic_istream&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]],
-  ['basic_5fistream_3c_20wchar_5ft_20_3e_25',['basic_istream&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]],
-  ['basic_5fistringstream_26',['basic_istringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std']]],
-  ['basic_5fistringstream_3c_20char_20_3e_27',['basic_istringstream&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std']]],
-  ['basic_5fistringstream_3c_20wchar_5ft_20_3e_28',['basic_istringstream&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std']]],
-  ['basic_5fofstream_29',['basic_ofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std']]],
-  ['basic_5fofstream_3c_20char_20_3e_30',['basic_ofstream&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std']]],
-  ['basic_5fofstream_3c_20wchar_5ft_20_3e_31',['basic_ofstream&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std']]],
-  ['basic_5fostream_32',['basic_ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]],
-  ['basic_5fostream_3c_20char_20_3e_33',['basic_ostream&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]],
-  ['basic_5fostream_3c_20wchar_5ft_20_3e_34',['basic_ostream&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]],
-  ['basic_5fostringstream_35',['basic_ostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std']]],
-  ['basic_5fostringstream_3c_20char_20_3e_36',['basic_ostringstream&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std']]],
-  ['basic_5fostringstream_3c_20wchar_5ft_20_3e_37',['basic_ostringstream&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std']]],
-  ['basic_5fregex_38',['basic_regex',['http://en.cppreference.com/w/cpp/regex/basic_regex.html',0,'std']]],
-  ['basic_5fstreambuf_39',['basic_streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf.html',0,'std']]],
-  ['basic_5fstring_40',['basic_string',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]],
-  ['basic_5fstring_3c_20char_20_3e_41',['basic_string&lt; char &gt;',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]],
-  ['basic_5fstring_3c_20char16_5ft_20_3e_42',['basic_string&lt; char16_t &gt;',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]],
-  ['basic_5fstring_3c_20char32_5ft_20_3e_43',['basic_string&lt; char32_t &gt;',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]],
-  ['basic_5fstring_3c_20char8_5ft_20_3e_44',['basic_string&lt; char8_t &gt;',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]],
-  ['basic_5fstring_3c_20wchar_5ft_20_3e_45',['basic_string&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]],
-  ['basic_5fstringbuf_46',['basic_stringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf.html',0,'std']]],
-  ['basic_5fstringstream_47',['basic_stringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std']]],
-  ['basic_5fstringstream_3c_20char_20_3e_48',['basic_stringstream&lt; char &gt;',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std']]],
-  ['basic_5fstringstream_3c_20wchar_5ft_20_3e_49',['basic_stringstream&lt; wchar_t &gt;',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std']]],
-  ['bernoulli_5fdistribution_50',['bernoulli_distribution',['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution.html',0,'std']]],
-  ['bidirectional_5fiterator_5ftag_51',['bidirectional_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]],
-  ['binary_5ffunction_52',['binary_function',['http://en.cppreference.com/w/cpp/utility/functional/binary_function.html',0,'std']]],
-  ['binary_5fnegate_53',['binary_negate',['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std']]],
-  ['binary_5fsearch_5ftree_54',['binary_search_tree',['../d9/dde/classbinary__search__tree.html',1,'']]],
-  ['binaryaddition_55',['BinaryAddition',['../de/df6/classgreedy__algorithms_1_1_binary_addition.html',1,'greedy_algorithms']]],
-  ['binarytree_56',['BinaryTree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree'],['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html',1,'others::iterative_tree_traversals::BinaryTree']]],
-  ['binomial_5fdistribution_57',['binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution.html',0,'std']]],
-  ['bit_5fand_58',['bit_and',['http://en.cppreference.com/w/cpp/utility/functional/bit_and.html',0,'std']]],
-  ['bit_5fnot_59',['bit_not',['http://en.cppreference.com/w/cpp/utility/functional/bit_not.html',0,'std']]],
-  ['bit_5for_60',['bit_or',['http://en.cppreference.com/w/cpp/utility/functional/bit_or.html',0,'std']]],
-  ['bitset_61',['Bitset',['../d9/dae/classdata__structures_1_1_bitset.html',1,'data_structures']]],
-  ['bitset_62',['bitset',['http://en.cppreference.com/w/cpp/utility/bitset.html',0,'std']]],
-  ['bitset_3c_20maxn_20_3e_63',['bitset&lt; MAXN &gt;',['http://en.cppreference.com/w/cpp/utility/bitset.html',0,'std']]],
-  ['bloomfilter_64',['BloomFilter',['../dc/dd4/classdata__structures_1_1_bloom_filter.html',1,'data_structures']]],
-  ['bst_5fnode_65',['bst_node',['../dd/db6/structbinary__search__tree_1_1bst__node.html',1,'binary_search_tree']]],
-  ['bt_66',['BT',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html',1,'others::recursive_tree_traversals']]],
-  ['btree_67',['Btree',['../d9/d90/struct_btree.html',1,'']]]
+  ['binary_5fsearch_5ftree_0',['binary_search_tree',['../d9/dde/classbinary__search__tree.html',1,'']]],
+  ['binaryaddition_1',['BinaryAddition',['../de/df6/classgreedy__algorithms_1_1_binary_addition.html',1,'greedy_algorithms']]],
+  ['binarytree_2',['BinaryTree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree'],['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html',1,'others::iterative_tree_traversals::BinaryTree']]],
+  ['bitset_3',['Bitset',['../d9/dae/classdata__structures_1_1_bitset.html',1,'data_structures']]],
+  ['bloomfilter_4',['BloomFilter',['../dc/dd4/classdata__structures_1_1_bloom_filter.html',1,'data_structures']]],
+  ['bst_5fnode_5',['bst_node',['../dd/db6/structbinary__search__tree_1_1bst__node.html',1,'binary_search_tree']]],
+  ['bt_6',['BT',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html',1,'others::recursive_tree_traversals']]],
+  ['btree_7',['Btree',['../d9/d90/struct_btree.html',1,'']]]
 ];
diff --git a/search/classes_10.js b/search/classes_10.js
index 113076bcb..5170c9692 100644
--- a/search/classes_10.js
+++ b/search/classes_10.js
@@ -1,8 +1,14 @@
 var searchData=
 [
-  ['query_0',['query',['../dd/d1b/structquery.html',1,'']]],
-  ['queue_1',['Queue',['../dc/db5/struct_queue.html',1,'']]],
-  ['queue_2',['queue',['../db/da9/classqueue.html',1,'queue&lt; ValueType &gt;'],['http://en.cppreference.com/w/cpp/container/queue.html',0,'std::queue&lt; T &gt;']]],
-  ['queue_3c_20int64_5ft_20_3e_3',['queue&lt; int64_t &gt;',['http://en.cppreference.com/w/cpp/container/queue.html',0,'std']]],
-  ['queue_5farray_4',['Queue_Array',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html',1,'data_structures::queue_using_array']]]
+  ['segmentintersection_0',['SegmentIntersection',['../d4/db4/struct_segment_intersection.html',1,'']]],
+  ['segmenttree_1',['SegmentTree',['../dd/d95/classdata__structures_1_1_segment_tree.html',1,'data_structures']]],
+  ['sg_2',['SG',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html',1,'range_queries::heavy_light_decomposition']]],
+  ['skiplist_3',['SkipList',['../d4/d90/classdata__structures_1_1_skip_list.html',1,'data_structures']]],
+  ['solution_4',['Solution',['../dd/d4f/class_solution.html',1,'']]],
+  ['sparse_5ftable_5',['Sparse_table',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html',1,'data_structures::sparse_table']]],
+  ['stack_6',['Stack',['../d2/dc8/classdata__structures_1_1_stack.html',1,'data_structures::Stack&lt; T &gt;'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html',1,'data_structures::stack_using_queue::Stack'],['../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html',1,'others::postfix_expression::Stack']]],
+  ['stack_7',['stack',['../d1/dc2/classstack.html',1,'']]],
+  ['stack_5flinkedlist_8',['stack_linkedList',['../d2/dc4/classstack__linked_list.html',1,'']]],
+  ['stats_5fcomputer1_9',['stats_computer1',['../d7/d7c/classstatistics_1_1stats__computer1.html',1,'statistics']]],
+  ['stats_5fcomputer2_10',['stats_computer2',['../d8/dab/classstatistics_1_1stats__computer2.html',1,'statistics']]]
 ];
diff --git a/search/classes_11.js b/search/classes_11.js
index 88cba9e05..bd9f550a4 100644
--- a/search/classes_11.js
+++ b/search/classes_11.js
@@ -1,44 +1,13 @@
 var searchData=
 [
-  ['random_5faccess_5fiterator_5ftag_0',['random_access_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]],
-  ['random_5fdevice_1',['random_device',['http://en.cppreference.com/w/cpp/numeric/random/random_device.html',0,'std']]],
-  ['range_5ferror_2',['range_error',['http://en.cppreference.com/w/cpp/error/range_error.html',0,'std']]],
-  ['rank_3',['rank',['http://en.cppreference.com/w/cpp/types/rank.html',0,'std']]],
-  ['ranlux24_4',['ranlux24',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std']]],
-  ['ranlux24_5fbase_5',['ranlux24_base',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std']]],
-  ['ranlux48_6',['ranlux48',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std']]],
-  ['ranlux48_5fbase_7',['ranlux48_base',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std']]],
-  ['ratio_8',['ratio',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['ratio_5fadd_9',['ratio_add',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_add.html',0,'std']]],
-  ['ratio_5fdivide_10',['ratio_divide',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_divide.html',0,'std']]],
-  ['ratio_5fequal_11',['ratio_equal',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_equal.html',0,'std']]],
-  ['ratio_5fgreater_12',['ratio_greater',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_greater.html',0,'std']]],
-  ['ratio_5fgreater_5fequal_13',['ratio_greater_equal',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_greater_equal.html',0,'std']]],
-  ['ratio_5fless_14',['ratio_less',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_less.html',0,'std']]],
-  ['ratio_5fless_5fequal_15',['ratio_less_equal',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_less_equal.html',0,'std']]],
-  ['ratio_5fmultiply_16',['ratio_multiply',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_multiply.html',0,'std']]],
-  ['ratio_5fnot_5fequal_17',['ratio_not_equal',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_not_equal.html',0,'std']]],
-  ['ratio_5fsubtract_18',['ratio_subtract',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_subtract.html',0,'std']]],
-  ['raw_5fstorage_5fiterator_19',['raw_storage_iterator',['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator.html',0,'std']]],
-  ['rbtree_20',['RBtree',['../d8/d72/class_r_btree.html',1,'']]],
-  ['recursive_5fmutex_21',['recursive_mutex',['http://en.cppreference.com/w/cpp/thread/recursive_mutex.html',0,'std']]],
-  ['recursive_5ftimed_5fmutex_22',['recursive_timed_mutex',['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex.html',0,'std']]],
-  ['reference_23',['reference',['http://en.cppreference.com/w/cpp/utility/bitset/reference.html',0,'std::bitset']]],
-  ['reference_5fwrapper_24',['reference_wrapper',['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper.html',0,'std']]],
-  ['regex_25',['regex',['http://en.cppreference.com/w/cpp/regex/basic_regex.html',0,'std']]],
-  ['regex_5ferror_26',['regex_error',['http://en.cppreference.com/w/cpp/regex/regex_error.html',0,'std']]],
-  ['regex_5fiterator_27',['regex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std']]],
-  ['regex_5ftoken_5fiterator_28',['regex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std']]],
-  ['regex_5ftraits_29',['regex_traits',['http://en.cppreference.com/w/cpp/regex/regex_traits.html',0,'std']]],
-  ['remove_5fall_5fextents_30',['remove_all_extents',['http://en.cppreference.com/w/cpp/types/remove_all_extents.html',0,'std']]],
-  ['remove_5fconst_31',['remove_const',['http://en.cppreference.com/w/cpp/types/remove_cv.html',0,'std']]],
-  ['remove_5fcv_32',['remove_cv',['http://en.cppreference.com/w/cpp/types/remove_cv.html',0,'std']]],
-  ['remove_5fextent_33',['remove_extent',['http://en.cppreference.com/w/cpp/types/remove_extent.html',0,'std']]],
-  ['remove_5fpointer_34',['remove_pointer',['http://en.cppreference.com/w/cpp/types/remove_pointer.html',0,'std']]],
-  ['remove_5freference_35',['remove_reference',['http://en.cppreference.com/w/cpp/types/remove_reference.html',0,'std']]],
-  ['remove_5fvolatile_36',['remove_volatile',['http://en.cppreference.com/w/cpp/types/remove_cv.html',0,'std']]],
-  ['result_5fof_37',['result_of',['http://en.cppreference.com/w/cpp/types/result_of.html',0,'std']]],
-  ['reverse_5fiterator_38',['reverse_iterator',['http://en.cppreference.com/w/cpp/iterator/reverse_iterator.html',0,'std']]],
-  ['rootedtree_39',['RootedTree',['../d0/d58/classgraph_1_1_rooted_tree.html',1,'graph']]],
-  ['runtime_5ferror_40',['runtime_error',['http://en.cppreference.com/w/cpp/error/runtime_error.html',0,'std']]]
+  ['testcase_0',['TestCase',['../da/d86/struct_test_case.html',1,'']]],
+  ['testcases_1',['TestCases',['../d5/d58/class_test_cases.html',1,'']]],
+  ['tnode_2',['Tnode',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html',1,'operations_on_datastructures::trie_operations']]],
+  ['tower_3',['tower',['../d2/d2c/structtower.html',1,'']]],
+  ['treap_4',['Treap',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html',1,'data_structures::treap']]],
+  ['tree_5',['Tree',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html',1,'range_queries::heavy_light_decomposition']]],
+  ['tree234_6',['Tree234',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html',1,'data_structures::tree_234']]],
+  ['trie_7',['Trie',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html',1,'data_structures::trie_using_hashmap::Trie'],['../dd/d2f/class_trie.html',1,'Trie']]],
+  ['trie_8',['trie',['../d0/d3e/classdata__structures_1_1trie.html',1,'data_structures']]],
+  ['trienode_9',['TrieNode',['../de/d48/struct_trie_1_1_trie_node.html',1,'Trie']]]
 ];
diff --git a/search/classes_12.js b/search/classes_12.js
index c8f6fd926..a48f8c81a 100644
--- a/search/classes_12.js
+++ b/search/classes_12.js
@@ -1,57 +1,5 @@
 var searchData=
 [
-  ['scoped_5fallocator_5fadaptor_0',['scoped_allocator_adaptor',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor.html',0,'std']]],
-  ['seconds_1',['seconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono']]],
-  ['seed_5fseq_2',['seed_seq',['http://en.cppreference.com/w/cpp/numeric/random/seed_seq.html',0,'std']]],
-  ['segmentintersection_3',['SegmentIntersection',['../d4/db4/struct_segment_intersection.html',1,'']]],
-  ['segmenttree_4',['SegmentTree',['../dd/d95/classdata__structures_1_1_segment_tree.html',1,'data_structures']]],
-  ['sentry_5',['sentry',['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_fstream&lt; Char &gt;::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream&lt; Char &gt;::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_iostream&lt; Char &gt;::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream&lt; Char &gt;::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream&lt; Char &gt;::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream&lt; Char &gt;::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream&lt; Char &gt;::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream&lt; Char &gt;::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_stringstream&lt; Char &gt;::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::fstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::iostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::stringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::strstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wfstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wiostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wstringstream::sentry']]],
-  ['set_6',['set',['http://en.cppreference.com/w/cpp/container/set.html',0,'std']]],
-  ['sg_7',['SG',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html',1,'range_queries::heavy_light_decomposition']]],
-  ['shared_5ffuture_8',['shared_future',['http://en.cppreference.com/w/cpp/thread/shared_future.html',0,'std']]],
-  ['shared_5flock_9',['shared_lock',['http://en.cppreference.com/w/cpp/thread/shared_lock.html',0,'std']]],
-  ['shared_5fptr_10',['shared_ptr',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5fptr_3c_20data_5fstructures_3a_3alinked_5flist_3a_3alink_20_3e_11',['shared_ptr&lt; data_structures::linked_list::link &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5fptr_3c_20data_5fstructures_3a_3anode_20_3e_12',['shared_ptr&lt; data_structures::Node &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5fptr_3c_20data_5fstructures_3a_3atrie_5fusing_5fhashmap_3a_3atrie_3a_3anode_20_3e_13',['shared_ptr&lt; data_structures::trie_using_hashmap::Trie::Node &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5fptr_3c_20machine_5flearning_3a_3aaystar_5fsearch_3a_3aaystarsearch_3a_3ainfo_20_3e_14',['shared_ptr&lt; machine_learning::aystar_search::AyStarSearch::Info &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5fptr_3c_20node_20_3e_15',['shared_ptr&lt; Node &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5fptr_3c_20node_3c_20value_5ftype_20_3e_20_3e_16',['shared_ptr&lt; Node&lt; value_type &gt; &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5fptr_3c_20node_3c_20valuetype_20_3e_20_3e_17',['shared_ptr&lt; Node&lt; ValueType &gt; &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5fptr_3c_20puzzle_20_3e_18',['shared_ptr&lt; Puzzle &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5fptr_3c_20range_5fqueries_3a_3apersegtree_3a_3anode_20_3e_19',['shared_ptr&lt; range_queries::perSegTree::Node &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5fptr_3c_20trie_3a_3atrienode_20_3e_20',['shared_ptr&lt; Trie::TrieNode &gt;',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]],
-  ['shared_5ftimed_5fmutex_21',['shared_timed_mutex',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex.html',0,'std']]],
-  ['shuffle_5forder_5fengine_22',['shuffle_order_engine',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine.html',0,'std']]],
-  ['sig_5fatomic_5ft_23',['sig_atomic_t',['http://en.cppreference.com/w/cpp/utility/program/sig_atomic_t.html',0,'std']]],
-  ['size_5ft_24',['size_t',['http://en.cppreference.com/w/cpp/types/size_t.html',0,'std']]],
-  ['skiplist_25',['SkipList',['../d4/d90/classdata__structures_1_1_skip_list.html',1,'data_structures']]],
-  ['smatch_26',['smatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std']]],
-  ['solution_27',['Solution',['../dd/d4f/class_solution.html',1,'']]],
-  ['sparse_5ftable_28',['Sparse_table',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html',1,'data_structures::sparse_table']]],
-  ['sregex_5fiterator_29',['sregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std']]],
-  ['sregex_5ftoken_5fiterator_30',['sregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std']]],
-  ['ssub_5fmatch_31',['ssub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std']]],
-  ['stack_32',['Stack',['../d2/dc8/classdata__structures_1_1_stack.html',1,'data_structures::Stack&lt; T &gt;'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html',1,'data_structures::stack_using_queue::Stack'],['../d5/d8a/classothers_1_1postfix__expression_1_1_stack.html',1,'others::postfix_expression::Stack']]],
-  ['stack_33',['stack',['../d1/dc2/classstack.html',1,'stack&lt; ValueType &gt;'],['http://en.cppreference.com/w/cpp/container/stack.html',0,'std::stack&lt; T &gt;']]],
-  ['stack_5flinkedlist_34',['stack_linkedList',['../d2/dc4/classstack__linked_list.html',1,'']]],
-  ['state_5ftype_35',['state_type',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_byname::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf16::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8_utf16::state_type']]],
-  ['stats_5fcomputer1_36',['stats_computer1',['../d7/d7c/classstatistics_1_1stats__computer1.html',1,'statistics']]],
-  ['stats_5fcomputer2_37',['stats_computer2',['../d8/dab/classstatistics_1_1stats__computer2.html',1,'statistics']]],
-  ['steady_5fclock_38',['steady_clock',['http://en.cppreference.com/w/cpp/chrono/steady_clock.html',0,'std::chrono']]],
-  ['streambuf_39',['streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf.html',0,'std']]],
-  ['streamoff_40',['streamoff',['http://en.cppreference.com/w/cpp/io/streamoff.html',0,'std']]],
-  ['streampos_41',['streampos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]],
-  ['streamsize_42',['streamsize',['http://en.cppreference.com/w/cpp/io/streamsize.html',0,'std']]],
-  ['string_43',['string',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]],
-  ['string_5ftype_44',['string_type',['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate::string_type'],['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate_byname::string_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages::string_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages_byname::string_type'],['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::string_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::string_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct::string_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct_byname::string_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct::string_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct_byname::string_type']]],
-  ['stringbuf_45',['stringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf.html',0,'std']]],
-  ['stringstream_46',['stringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std']]],
-  ['strstream_47',['strstream',['http://en.cppreference.com/w/cpp/io/strstream.html',0,'std']]],
-  ['strstreambuf_48',['strstreambuf',['http://en.cppreference.com/w/cpp/io/strstreambuf.html',0,'std']]],
-  ['student_5ft_5fdistribution_49',['student_t_distribution',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution.html',0,'std']]],
-  ['sub_5fmatch_50',['sub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std']]],
-  ['subtract_5fwith_5fcarry_5fengine_51',['subtract_with_carry_engine',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std']]],
-  ['system_5fclock_52',['system_clock',['http://en.cppreference.com/w/cpp/chrono/system_clock.html',0,'std::chrono']]],
-  ['system_5ferror_53',['system_error',['http://en.cppreference.com/w/cpp/error/system_error.html',0,'std']]]
+  ['uint128_5ft_0',['uint128_t',['../db/d9a/classuint128__t.html',1,'']]],
+  ['uint256_5ft_1',['uint256_t',['../d1/d83/classuint256__t.html',1,'']]]
 ];
diff --git a/search/classes_13.js b/search/classes_13.js
index 530c414f1..676823ff6 100644
--- a/search/classes_13.js
+++ b/search/classes_13.js
@@ -1,32 +1,4 @@
 var searchData=
 [
-  ['tera_0',['tera',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['terminate_5fhandler_1',['terminate_handler',['http://en.cppreference.com/w/cpp/error/terminate_handler.html',0,'std']]],
-  ['testcase_2',['TestCase',['../da/d86/struct_test_case.html',1,'']]],
-  ['testcases_3',['TestCases',['../d5/d58/class_test_cases.html',1,'']]],
-  ['thread_4',['thread',['http://en.cppreference.com/w/cpp/thread/thread.html',0,'std']]],
-  ['time_5fbase_5',['time_base',['http://en.cppreference.com/w/cpp/locale/time_base.html',0,'std']]],
-  ['time_5fget_6',['time_get',['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std']]],
-  ['time_5fget_5fbyname_7',['time_get_byname',['http://en.cppreference.com/w/cpp/locale/time_get_byname.html',0,'std']]],
-  ['time_5fpoint_8',['time_point',['http://en.cppreference.com/w/cpp/chrono/time_point.html',0,'std::chrono']]],
-  ['time_5fput_9',['time_put',['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std']]],
-  ['time_5fput_5fbyname_10',['time_put_byname',['http://en.cppreference.com/w/cpp/locale/time_put_byname.html',0,'std']]],
-  ['time_5ft_11',['time_t',['http://en.cppreference.com/w/cpp/chrono/c/time_t.html',0,'std']]],
-  ['timed_5fmutex_12',['timed_mutex',['http://en.cppreference.com/w/cpp/thread/timed_mutex.html',0,'std']]],
-  ['tm_13',['tm',['http://en.cppreference.com/w/cpp/chrono/c/tm.html',0,'std']]],
-  ['tnode_14',['Tnode',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html',1,'operations_on_datastructures::trie_operations']]],
-  ['tower_15',['tower',['../d2/d2c/structtower.html',1,'']]],
-  ['treap_16',['Treap',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html',1,'data_structures::treap']]],
-  ['treat_5fas_5ffloating_5fpoint_17',['treat_as_floating_point',['http://en.cppreference.com/w/cpp/chrono/treat_as_floating_point.html',0,'std::chrono']]],
-  ['tree_18',['Tree',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html',1,'range_queries::heavy_light_decomposition']]],
-  ['tree234_19',['Tree234',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html',1,'data_structures::tree_234']]],
-  ['trie_20',['Trie',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html',1,'data_structures::trie_using_hashmap::Trie'],['../dd/d2f/class_trie.html',1,'Trie']]],
-  ['trie_21',['trie',['../d0/d3e/classdata__structures_1_1trie.html',1,'data_structures']]],
-  ['trienode_22',['TrieNode',['../de/d48/struct_trie_1_1_trie_node.html',1,'Trie']]],
-  ['true_5ftype_23',['true_type',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]],
-  ['try_5fto_5flock_5ft_24',['try_to_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]],
-  ['tuple_25',['tuple',['http://en.cppreference.com/w/cpp/utility/tuple.html',0,'std']]],
-  ['tuple_3c_20int_2c_20int_2c_20int_20_3e_26',['tuple&lt; int, int, int &gt;',['http://en.cppreference.com/w/cpp/utility/tuple.html',0,'std']]],
-  ['type_5findex_27',['type_index',['http://en.cppreference.com/w/cpp/types/type_index.html',0,'std']]],
-  ['type_5finfo_28',['type_info',['http://en.cppreference.com/w/cpp/types/type_info.html',0,'std']]]
+  ['windowedmedian_0',['WindowedMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html',1,'probability::windowed_median']]]
 ];
diff --git a/search/classes_2.js b/search/classes_2.js
index 12ace7880..b1451d0dd 100644
--- a/search/classes_2.js
+++ b/search/classes_2.js
@@ -1,43 +1,12 @@
 var searchData=
 [
   ['catalan_5fnumbers_0',['catalan_numbers',['../dc/d1f/classcatalan__numbers.html',1,'']]],
-  ['catalog_1',['catalog',['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages::catalog'],['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages_base::catalog'],['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages_byname::catalog']]],
-  ['cauchy_5fdistribution_2',['cauchy_distribution',['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution.html',0,'std']]],
-  ['centi_3',['centi',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['cerr_4',['cerr',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]],
-  ['char_5ftraits_5',['char_traits',['http://en.cppreference.com/w/cpp/string/char_traits.html',0,'std']]],
-  ['char_5ftype_6',['char_type',['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate::char_type'],['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages::char_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::char_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::char_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct::char_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std::num_get::char_type'],['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put::char_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct::char_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get::char_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put::char_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put_byname::char_type']]],
-  ['chi_5fsquared_5fdistribution_7',['chi_squared_distribution',['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution.html',0,'std']]],
-  ['cin_8',['cin',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]],
-  ['circularlinkedlist_9',['CircularLinkedList',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html',1,'operations_on_datastructures::circular_linked_list']]],
-  ['cll_10',['cll',['../d5/d15/classcll.html',1,'']]],
-  ['clock_5ft_11',['clock_t',['http://en.cppreference.com/w/cpp/chrono/c/clock_t.html',0,'std']]],
-  ['clog_12',['clog',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]],
-  ['cmatch_13',['cmatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std']]],
-  ['codecvt_14',['codecvt',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std']]],
-  ['codecvt_5fbase_15',['codecvt_base',['http://en.cppreference.com/w/cpp/locale/codecvt_base.html',0,'std']]],
-  ['codecvt_5fbyname_16',['codecvt_byname',['http://en.cppreference.com/w/cpp/locale/codecvt_byname.html',0,'std']]],
-  ['codecvt_5futf16_17',['codecvt_utf16',['http://en.cppreference.com/w/cpp/locale/codecvt_utf16.html',0,'std']]],
-  ['codecvt_5futf8_18',['codecvt_utf8',['http://en.cppreference.com/w/cpp/locale/codecvt_utf8.html',0,'std']]],
-  ['codecvt_5futf8_5futf16_19',['codecvt_utf8_utf16',['http://en.cppreference.com/w/cpp/locale/codecvt_utf8_utf16.html',0,'std']]],
-  ['collate_20',['collate',['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std']]],
-  ['collate_5fbyname_21',['collate_byname',['http://en.cppreference.com/w/cpp/locale/collate_byname.html',0,'std']]],
-  ['common_5ftype_22',['common_type',['http://en.cppreference.com/w/cpp/types/common_type.html',0,'std']]],
-  ['compare_23',['Compare',['../de/d4a/class_compare.html',1,'']]],
-  ['compare_24',['compare',['../d1/db3/structcompare.html',1,'']]],
-  ['comparison_5foperator_25',['comparison_operator',['../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html',1,'machine_learning::aystar_search::AyStarSearch']]],
-  ['complex_26',['Complex',['../da/d5a/class_complex.html',1,'']]],
-  ['complex_27',['complex',['http://en.cppreference.com/w/cpp/numeric/complex.html',0,'std']]],
-  ['condition_5fvariable_28',['condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable.html',0,'std']]],
-  ['condition_5fvariable_5fany_29',['condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any.html',0,'std']]],
-  ['conditional_30',['conditional',['http://en.cppreference.com/w/cpp/types/conditional.html',0,'std']]],
-  ['convexhull_31',['Convexhull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html',1,'geometry::jarvis']]],
-  ['cout_32',['cout',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]],
-  ['cregex_5fiterator_33',['cregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std']]],
-  ['cregex_5ftoken_5fiterator_34',['cregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std']]],
-  ['csub_5fmatch_35',['csub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std']]],
-  ['ctype_36',['ctype',['http://en.cppreference.com/w/cpp/locale/ctype.html',0,'std']]],
-  ['ctype_5fbase_37',['ctype_base',['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std']]],
-  ['ctype_5fbyname_38',['ctype_byname',['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std']]],
-  ['cyclecheck_39',['CycleCheck',['../d3/dbb/class_cycle_check.html',1,'']]]
+  ['circularlinkedlist_1',['CircularLinkedList',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html',1,'operations_on_datastructures::circular_linked_list']]],
+  ['cll_2',['cll',['../d5/d15/classcll.html',1,'']]],
+  ['compare_3',['Compare',['../de/d4a/class_compare.html',1,'']]],
+  ['compare_4',['compare',['../d1/db3/structcompare.html',1,'']]],
+  ['comparison_5foperator_5',['comparison_operator',['../d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html',1,'machine_learning::aystar_search::AyStarSearch']]],
+  ['complex_6',['Complex',['../da/d5a/class_complex.html',1,'']]],
+  ['convexhull_7',['Convexhull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html',1,'geometry::jarvis']]],
+  ['cyclecheck_8',['CycleCheck',['../d3/dbb/class_cycle_check.html',1,'']]]
 ];
diff --git a/search/classes_3.js b/search/classes_3.js
index 29fbf3152..5775acd28 100644
--- a/search/classes_3.js
+++ b/search/classes_3.js
@@ -2,22 +2,8 @@ var searchData=
 [
   ['d_5fnode_0',['D_Node',['../de/d21/classothers_1_1_cache_1_1_d___node.html',1,'others::Cache']]],
   ['d_5fnode_3c_20k_2c_20v_20_3e_1',['D_Node&lt; K, V &gt;',['../de/d21/classothers_1_1_cache_1_1_d___node.html',1,'others::Cache']]],
-  ['deca_2',['deca',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['decay_3',['decay',['http://en.cppreference.com/w/cpp/types/decay.html',0,'std']]],
-  ['deci_4',['deci',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['default_5fdelete_5',['default_delete',['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std']]],
-  ['default_5frandom_5fengine_6',['default_random_engine',['http://en.cppreference.com/w/cpp/numeric/random.html',0,'std']]],
-  ['defer_5flock_5ft_7',['defer_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]],
-  ['denselayer_8',['DenseLayer',['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html',1,'machine_learning::neural_network::layers']]],
-  ['deque_9',['deque',['http://en.cppreference.com/w/cpp/container/deque.html',0,'std']]],
-  ['digitseparation_10',['DigitSeparation',['../da/d49/classgreedy__algorithms_1_1_digit_separation.html',1,'greedy_algorithms']]],
-  ['discard_5fblock_5fengine_11',['discard_block_engine',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std']]],
-  ['discrete_5fdistribution_12',['discrete_distribution',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution.html',0,'std']]],
-  ['divides_13',['divides',['http://en.cppreference.com/w/cpp/utility/functional/divides.html',0,'std']]],
-  ['domain_5ferror_14',['domain_error',['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std']]],
-  ['double_5flinked_5flist_15',['double_linked_list',['../d9/dee/classdouble__linked__list.html',1,'']]],
-  ['dsu_16',['dsu',['../dd/d1f/classdsu.html',1,'']]],
-  ['duration_17',['duration',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono']]],
-  ['duration_5fvalues_18',['duration_values',['http://en.cppreference.com/w/cpp/chrono/duration_values.html',0,'std::chrono']]],
-  ['dynarray_19',['dynarray',['http://en.cppreference.com/w/cpp/container/dynarray.html',0,'std']]]
+  ['denselayer_2',['DenseLayer',['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html',1,'machine_learning::neural_network::layers']]],
+  ['digitseparation_3',['DigitSeparation',['../da/d49/classgreedy__algorithms_1_1_digit_separation.html',1,'greedy_algorithms']]],
+  ['double_5flinked_5flist_4',['double_linked_list',['../d9/dee/classdouble__linked__list.html',1,'']]],
+  ['dsu_5',['dsu',['../dd/d1f/classdsu.html',1,'']]]
 ];
diff --git a/search/classes_4.js b/search/classes_4.js
index ee97b953f..0353a9635 100644
--- a/search/classes_4.js
+++ b/search/classes_4.js
@@ -3,20 +3,5 @@ var searchData=
   ['easteryearmonthday_0',['EasterYearMonthDay',['../d1/df6/class_easter_year_month_day.html',1,'']]],
   ['edge_1',['Edge',['../d7/d77/class_edge.html',1,'']]],
   ['eightpuzzle_2',['EightPuzzle',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html',1,'machine_learning::aystar_search']]],
-  ['enable_5fif_3',['enable_if',['http://en.cppreference.com/w/cpp/types/enable_if.html',0,'std']]],
-  ['enable_5fshared_5ffrom_5fthis_4',['enable_shared_from_this',['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this.html',0,'std']]],
-  ['entry_5',['Entry',['../d9/dde/structdouble__hashing_1_1_entry.html',1,'double_hashing::Entry'],['../db/d19/structlinear__probing_1_1_entry.html',1,'linear_probing::Entry'],['../da/dd1/structquadratic__probing_1_1_entry.html',1,'quadratic_probing::Entry']]],
-  ['equal_5fto_6',['equal_to',['http://en.cppreference.com/w/cpp/utility/functional/equal_to.html',0,'std']]],
-  ['errc_7',['errc',['http://en.cppreference.com/w/cpp/error/errc.html',0,'std']]],
-  ['error_5fcategory_8',['error_category',['http://en.cppreference.com/w/cpp/error/error_category.html',0,'std']]],
-  ['error_5fcode_9',['error_code',['http://en.cppreference.com/w/cpp/error/error_code.html',0,'std']]],
-  ['error_5fcondition_10',['error_condition',['http://en.cppreference.com/w/cpp/error/error_condition.html',0,'std']]],
-  ['event_5fcallback_11',['event_callback',['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_fstream&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ifstream&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ios&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_iostream&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_istream&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_istringstream&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ofstream&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ostream&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ostringstream&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_stringstream&lt; Char &gt;::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::fstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ifstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ios_base::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::iostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::istream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::istringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::istrstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ofstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ostringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ostrstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::stringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::strstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wfstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wifstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wiostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wistream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wistringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wofstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wostringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wstringstream::event_callback']]],
-  ['exa_12',['exa',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['exception_13',['exception',['http://en.cppreference.com/w/cpp/error/exception.html',0,'std']]],
-  ['exception_5fptr_14',['exception_ptr',['http://en.cppreference.com/w/cpp/error/exception_ptr.html',0,'std']]],
-  ['exponential_5fdistribution_15',['exponential_distribution',['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution.html',0,'std']]],
-  ['extent_16',['extent',['http://en.cppreference.com/w/cpp/types/extent.html',0,'std']]],
-  ['extern_5ftype_17',['extern_type',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_byname::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf16::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8_utf16::extern_type']]],
-  ['extreme_5fvalue_5fdistribution_18',['extreme_value_distribution',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution.html',0,'std']]]
+  ['entry_3',['Entry',['../d9/dde/structdouble__hashing_1_1_entry.html',1,'double_hashing::Entry'],['../db/d19/structlinear__probing_1_1_entry.html',1,'linear_probing::Entry'],['../da/dd1/structquadratic__probing_1_1_entry.html',1,'quadratic_probing::Entry']]]
 ];
diff --git a/search/classes_5.js b/search/classes_5.js
index 48030014f..a2a688fa9 100644
--- a/search/classes_5.js
+++ b/search/classes_5.js
@@ -1,21 +1,5 @@
 var searchData=
 [
-  ['facet_0',['facet',['http://en.cppreference.com/w/cpp/locale/locale/facet.html',0,'std::locale']]],
-  ['failure_1',['failure',['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_fstream&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ifstream&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ios&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_iostream&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istream&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istringstream&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ofstream&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostream&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostringstream&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_stringstream&lt; Char &gt;::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::fstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ifstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ios_base::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::iostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istrstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ofstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostrstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::stringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::strstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wfstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wifstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wiostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wofstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wstringstream::failure']]],
-  ['false_5ftype_2',['false_type',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]],
-  ['fcfs_3',['FCFS',['../dd/dca/class_f_c_f_s.html',1,'']]],
-  ['femto_4',['femto',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['fenwick_5ftree_5',['fenwick_tree',['../de/d0d/classrange__queries_1_1fenwick__tree.html',1,'range_queries']]],
-  ['file_6',['FILE',['http://en.cppreference.com/w/cpp/io/c.html',0,'std']]],
-  ['filebuf_7',['filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf.html',0,'std']]],
-  ['fisher_5ff_5fdistribution_8',['fisher_f_distribution',['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution.html',0,'std']]],
-  ['forward_5fiterator_5ftag_9',['forward_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]],
-  ['forward_5flist_10',['forward_list',['http://en.cppreference.com/w/cpp/container/forward_list.html',0,'std']]],
-  ['fpos_11',['fpos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]],
-  ['fpos_5ft_12',['fpos_t',['http://en.cppreference.com/w/cpp/io/c.html',0,'std']]],
-  ['front_5finsert_5fiterator_13',['front_insert_iterator',['http://en.cppreference.com/w/cpp/iterator/front_insert_iterator.html',0,'std']]],
-  ['fstream_14',['fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std']]],
-  ['function_15',['function',['http://en.cppreference.com/w/cpp/utility/functional/function.html',0,'std']]],
-  ['future_16',['future',['http://en.cppreference.com/w/cpp/thread/future.html',0,'std']]],
-  ['future_5ferror_17',['future_error',['http://en.cppreference.com/w/cpp/thread/future_error.html',0,'std']]]
+  ['fcfs_0',['FCFS',['../dd/dca/class_f_c_f_s.html',1,'']]],
+  ['fenwick_5ftree_1',['fenwick_tree',['../de/d0d/classrange__queries_1_1fenwick__tree.html',1,'range_queries']]]
 ];
diff --git a/search/classes_6.js b/search/classes_6.js
index c0ca1a6fa..51652a352 100644
--- a/search/classes_6.js
+++ b/search/classes_6.js
@@ -1,10 +1,6 @@
 var searchData=
 [
-  ['gamma_5fdistribution_0',['gamma_distribution',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution.html',0,'std']]],
-  ['generate_5fparentheses_1',['generate_parentheses',['../df/de5/classbacktracking_1_1generate__parentheses.html',1,'backtracking']]],
-  ['geometric_5fdistribution_2',['geometric_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html',1,'probability::geometric_dist::geometric_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution.html',0,'std::geometric_distribution']]],
-  ['giga_3',['giga',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['graph_4',['Graph',['../da/d9a/class_graph.html',1,'Graph'],['../dc/d61/classgraph_1_1_graph.html',1,'graph::Graph&lt; T &gt;'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html',1,'graph::is_graph_bipartite::Graph'],['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html',1,'graph::topological_sort::Graph'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html',1,'greedy_algorithms::dijkstra::Graph']]],
-  ['greater_5',['greater',['http://en.cppreference.com/w/cpp/utility/functional/greater.html',0,'std']]],
-  ['greater_5fequal_6',['greater_equal',['http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html',0,'std']]]
+  ['generate_5fparentheses_0',['generate_parentheses',['../df/de5/classbacktracking_1_1generate__parentheses.html',1,'backtracking']]],
+  ['geometric_5fdistribution_1',['geometric_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html',1,'probability::geometric_dist']]],
+  ['graph_2',['Graph',['../da/d9a/class_graph.html',1,'Graph'],['../dc/d61/classgraph_1_1_graph.html',1,'graph::Graph&lt; T &gt;'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html',1,'graph::is_graph_bipartite::Graph'],['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html',1,'graph::topological_sort::Graph'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html',1,'greedy_algorithms::dijkstra::Graph']]]
 ];
diff --git a/search/classes_7.js b/search/classes_7.js
index 078a74a3f..ec6def94a 100644
--- a/search/classes_7.js
+++ b/search/classes_7.js
@@ -1,13 +1,8 @@
 var searchData=
 [
-  ['has_5fvirtual_5fdestructor_0',['has_virtual_destructor',['http://en.cppreference.com/w/cpp/types/has_virtual_destructor.html',0,'std']]],
-  ['hash_1',['Hash',['../d6/d84/classhashing_1_1sha256_1_1_hash.html',1,'hashing::sha256']]],
-  ['hash_2',['hash',['http://en.cppreference.com/w/cpp/utility/hash.html',0,'std']]],
-  ['hash_5fchain_3',['hash_chain',['../dd/d1c/classhash__chain.html',1,'']]],
-  ['hecto_4',['hecto',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['high_5fresolution_5fclock_5',['high_resolution_clock',['http://en.cppreference.com/w/cpp/chrono/high_resolution_clock.html',0,'std::chrono']]],
-  ['hillcipher_6',['HillCipher',['../d6/d26/classciphers_1_1_hill_cipher.html',1,'ciphers']]],
-  ['hkgraph_7',['HKGraph',['../d8/d69/classgraph_1_1_h_k_graph.html',1,'graph']]],
-  ['hld_8',['HLD',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html',1,'range_queries::heavy_light_decomposition']]],
-  ['hours_9',['hours',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono']]]
+  ['hash_0',['Hash',['../d6/d84/classhashing_1_1sha256_1_1_hash.html',1,'hashing::sha256']]],
+  ['hash_5fchain_1',['hash_chain',['../dd/d1c/classhash__chain.html',1,'']]],
+  ['hillcipher_2',['HillCipher',['../d6/d26/classciphers_1_1_hill_cipher.html',1,'ciphers']]],
+  ['hkgraph_3',['HKGraph',['../d8/d69/classgraph_1_1_h_k_graph.html',1,'graph']]],
+  ['hld_4',['HLD',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html',1,'range_queries::heavy_light_decomposition']]]
 ];
diff --git a/search/classes_8.js b/search/classes_8.js
index 5562bc1e0..1664c9ea8 100644
--- a/search/classes_8.js
+++ b/search/classes_8.js
@@ -1,108 +1,11 @@
 var searchData=
 [
-  ['id_0',['id',['http://en.cppreference.com/w/cpp/locale/locale/id.html',0,'std::locale::id'],['http://en.cppreference.com/w/cpp/thread/thread/id.html',0,'std::thread::id']]],
-  ['ifstream_1',['ifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std']]],
-  ['independent_5fbits_5fengine_2',['independent_bits_engine',['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine.html',0,'std']]],
-  ['info_3',['Info',['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html',1,'machine_learning::aystar_search::AyStarSearch']]],
-  ['initializer_5flist_4',['initializer_list',['http://en.cppreference.com/w/cpp/utility/initializer_list.html',0,'std']]],
-  ['input_5fiterator_5ftag_5',['input_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]],
-  ['insert_5fiterator_6',['insert_iterator',['http://en.cppreference.com/w/cpp/iterator/insert_iterator.html',0,'std']]],
-  ['int16_5ft_7',['int16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int32_5ft_8',['int32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int64_5ft_9',['int64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int8_5ft_10',['int8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int_5ffast16_5ft_11',['int_fast16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int_5ffast32_5ft_12',['int_fast32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int_5ffast64_5ft_13',['int_fast64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int_5ffast8_5ft_14',['int_fast8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int_5fleast16_5ft_15',['int_least16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int_5fleast32_5ft_16',['int_least32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int_5fleast64_5ft_17',['int_least64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['int_5fleast8_5ft_18',['int_least8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['integer_5fsequence_19',['integer_sequence',['http://en.cppreference.com/w/cpp/utility/integer_sequence.html',0,'std']]],
-  ['integral_5fconstant_20',['integral_constant',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]],
-  ['intern_5ftype_21',['intern_type',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_byname::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf16::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8_utf16::intern_type']]],
-  ['intmax_5ft_22',['intmax_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['intptr_5ft_23',['intptr_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]],
-  ['invalid_5fargument_24',['invalid_argument',['http://en.cppreference.com/w/cpp/error/invalid_argument.html',0,'std']]],
-  ['ios_5fbase_25',['ios_base',['http://en.cppreference.com/w/cpp/io/ios_base.html',0,'std']]],
-  ['iostream_26',['iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std']]],
-  ['is_5fabstract_27',['is_abstract',['http://en.cppreference.com/w/cpp/types/is_abstract.html',0,'std']]],
-  ['is_5farithmetic_28',['is_arithmetic',['http://en.cppreference.com/w/cpp/types/is_arithmetic.html',0,'std']]],
-  ['is_5farithmetic_3c_20uint128_5ft_20_3e_29',['is_arithmetic&lt; uint128_t &gt;',['../d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html',1,'std']]],
-  ['is_5farithmetic_3c_20uint256_5ft_20_3e_30',['is_arithmetic&lt; uint256_t &gt;',['../dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html',1,'std']]],
-  ['is_5farray_31',['is_array',['http://en.cppreference.com/w/cpp/types/is_array.html',0,'std']]],
-  ['is_5fassignable_32',['is_assignable',['http://en.cppreference.com/w/cpp/types/is_assignable.html',0,'std']]],
-  ['is_5fbase_5fof_33',['is_base_of',['http://en.cppreference.com/w/cpp/types/is_base_of.html',0,'std']]],
-  ['is_5fbind_5fexpression_34',['is_bind_expression',['http://en.cppreference.com/w/cpp/utility/functional/is_bind_expression.html',0,'std']]],
-  ['is_5fclass_35',['is_class',['http://en.cppreference.com/w/cpp/types/is_class.html',0,'std']]],
-  ['is_5fcompound_36',['is_compound',['http://en.cppreference.com/w/cpp/types/is_compound.html',0,'std']]],
-  ['is_5fconst_37',['is_const',['http://en.cppreference.com/w/cpp/types/is_const.html',0,'std']]],
-  ['is_5fconstructible_38',['is_constructible',['http://en.cppreference.com/w/cpp/types/is_constructible.html',0,'std']]],
-  ['is_5fconvertible_39',['is_convertible',['http://en.cppreference.com/w/cpp/types/is_convertible.html',0,'std']]],
-  ['is_5fcopy_5fassignable_40',['is_copy_assignable',['http://en.cppreference.com/w/cpp/types/is_copy_assignable.html',0,'std']]],
-  ['is_5fcopy_5fconstructible_41',['is_copy_constructible',['http://en.cppreference.com/w/cpp/types/is_copy_constructible.html',0,'std']]],
-  ['is_5fdefault_5fconstructible_42',['is_default_constructible',['http://en.cppreference.com/w/cpp/types/is_default_constructible.html',0,'std']]],
-  ['is_5fdestructible_43',['is_destructible',['http://en.cppreference.com/w/cpp/types/is_destructible.html',0,'std']]],
-  ['is_5fempty_44',['is_empty',['http://en.cppreference.com/w/cpp/types/is_empty.html',0,'std']]],
-  ['is_5fenum_45',['is_enum',['http://en.cppreference.com/w/cpp/types/is_enum.html',0,'std']]],
-  ['is_5ferror_5fcode_5fenum_46',['is_error_code_enum',['http://en.cppreference.com/w/cpp/error/error_code/is_error_code_enum.html',0,'std']]],
-  ['is_5ferror_5fcondition_5fenum_47',['is_error_condition_enum',['http://en.cppreference.com/w/cpp/error/error_condition/is_error_condition_enum.html',0,'std']]],
-  ['is_5ffloating_5fpoint_48',['is_floating_point',['http://en.cppreference.com/w/cpp/types/is_floating_point.html',0,'std']]],
-  ['is_5ffunction_49',['is_function',['http://en.cppreference.com/w/cpp/types/is_function.html',0,'std']]],
-  ['is_5ffundamental_50',['is_fundamental',['http://en.cppreference.com/w/cpp/types/is_fundamental.html',0,'std']]],
-  ['is_5fintegral_51',['is_integral',['http://en.cppreference.com/w/cpp/types/is_integral.html',0,'std']]],
-  ['is_5fintegral_3c_20uint128_5ft_20_3e_52',['is_integral&lt; uint128_t &gt;',['../d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html',1,'std']]],
-  ['is_5fintegral_3c_20uint256_5ft_20_3e_53',['is_integral&lt; uint256_t &gt;',['../d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html',1,'std']]],
-  ['is_5fliteral_5ftype_54',['is_literal_type',['http://en.cppreference.com/w/cpp/types/is_literal_type.html',0,'std']]],
-  ['is_5flvalue_5freference_55',['is_lvalue_reference',['http://en.cppreference.com/w/cpp/types/is_lvalue_reference.html',0,'std']]],
-  ['is_5fmember_5ffunction_5fpointer_56',['is_member_function_pointer',['http://en.cppreference.com/w/cpp/types/is_member_function_pointer.html',0,'std']]],
-  ['is_5fmember_5fobject_5fpointer_57',['is_member_object_pointer',['http://en.cppreference.com/w/cpp/types/is_member_object_pointer.html',0,'std']]],
-  ['is_5fmember_5fpointer_58',['is_member_pointer',['http://en.cppreference.com/w/cpp/types/is_member_pointer.html',0,'std']]],
-  ['is_5fmove_5fassignable_59',['is_move_assignable',['http://en.cppreference.com/w/cpp/types/is_move_assignable.html',0,'std']]],
-  ['is_5fmove_5fconstructible_60',['is_move_constructible',['http://en.cppreference.com/w/cpp/types/is_move_constructible.html',0,'std']]],
-  ['is_5fnothrow_5fassignable_61',['is_nothrow_assignable',['http://en.cppreference.com/w/cpp/types/is_assignable.html',0,'std']]],
-  ['is_5fnothrow_5fconstructible_62',['is_nothrow_constructible',['http://en.cppreference.com/w/cpp/types/is_constructible.html',0,'std']]],
-  ['is_5fnothrow_5fcopy_5fassignable_63',['is_nothrow_copy_assignable',['http://en.cppreference.com/w/cpp/types/is_copy_assignable.html',0,'std']]],
-  ['is_5fnothrow_5fcopy_5fconstructible_64',['is_nothrow_copy_constructible',['http://en.cppreference.com/w/cpp/types/is_copy_constructible.html',0,'std']]],
-  ['is_5fnothrow_5fdefault_5fconstructible_65',['is_nothrow_default_constructible',['http://en.cppreference.com/w/cpp/types/is_default_constructible.html',0,'std']]],
-  ['is_5fnothrow_5fdestructible_66',['is_nothrow_destructible',['http://en.cppreference.com/w/cpp/types/is_destructible.html',0,'std']]],
-  ['is_5fnothrow_5fmove_5fassignable_67',['is_nothrow_move_assignable',['http://en.cppreference.com/w/cpp/types/is_move_assignable.html',0,'std']]],
-  ['is_5fnothrow_5fmove_5fconstructible_68',['is_nothrow_move_constructible',['http://en.cppreference.com/w/cpp/types/is_move_constructible.html',0,'std']]],
-  ['is_5fobject_69',['is_object',['http://en.cppreference.com/w/cpp/types/is_object.html',0,'std']]],
-  ['is_5fplaceholder_70',['is_placeholder',['http://en.cppreference.com/w/cpp/utility/functional/is_placeholder.html',0,'std']]],
-  ['is_5fpod_71',['is_pod',['http://en.cppreference.com/w/cpp/types/is_pod.html',0,'std']]],
-  ['is_5fpointer_72',['is_pointer',['http://en.cppreference.com/w/cpp/types/is_pointer.html',0,'std']]],
-  ['is_5fpolymorphic_73',['is_polymorphic',['http://en.cppreference.com/w/cpp/types/is_polymorphic.html',0,'std']]],
-  ['is_5freference_74',['is_reference',['http://en.cppreference.com/w/cpp/types/is_reference.html',0,'std']]],
-  ['is_5frvalue_5freference_75',['is_rvalue_reference',['http://en.cppreference.com/w/cpp/types/is_rvalue_reference.html',0,'std']]],
-  ['is_5fsame_76',['is_same',['http://en.cppreference.com/w/cpp/types/is_same.html',0,'std']]],
-  ['is_5fscalar_77',['is_scalar',['http://en.cppreference.com/w/cpp/types/is_scalar.html',0,'std']]],
-  ['is_5fsigned_78',['is_signed',['http://en.cppreference.com/w/cpp/types/is_signed.html',0,'std']]],
-  ['is_5fstandard_5flayout_79',['is_standard_layout',['http://en.cppreference.com/w/cpp/types/is_standard_layout.html',0,'std']]],
-  ['is_5ftrivial_80',['is_trivial',['http://en.cppreference.com/w/cpp/types/is_trivial.html',0,'std']]],
-  ['is_5ftrivially_5fassignable_81',['is_trivially_assignable',['http://en.cppreference.com/w/cpp/types/is_assignable.html',0,'std']]],
-  ['is_5ftrivially_5fconstructible_82',['is_trivially_constructible',['http://en.cppreference.com/w/cpp/types/is_constructible.html',0,'std']]],
-  ['is_5ftrivially_5fcopy_5fassignable_83',['is_trivially_copy_assignable',['http://en.cppreference.com/w/cpp/types/is_copy_assignable.html',0,'std']]],
-  ['is_5ftrivially_5fcopy_5fconstructible_84',['is_trivially_copy_constructible',['http://en.cppreference.com/w/cpp/types/is_copy_constructible.html',0,'std']]],
-  ['is_5ftrivially_5fcopyable_85',['is_trivially_copyable',['http://en.cppreference.com/w/cpp/types/is_trivially_copyable.html',0,'std']]],
-  ['is_5ftrivially_5fdefault_5fconstructible_86',['is_trivially_default_constructible',['http://en.cppreference.com/w/cpp/types/is_default_constructible.html',0,'std']]],
-  ['is_5ftrivially_5fdestructible_87',['is_trivially_destructible',['http://en.cppreference.com/w/cpp/types/is_destructible.html',0,'std']]],
-  ['is_5ftrivially_5fmove_5fassignable_88',['is_trivially_move_assignable',['http://en.cppreference.com/w/cpp/types/is_move_assignable.html',0,'std']]],
-  ['is_5ftrivially_5fmove_5fconstructible_89',['is_trivially_move_constructible',['http://en.cppreference.com/w/cpp/types/is_move_constructible.html',0,'std']]],
-  ['is_5funion_90',['is_union',['http://en.cppreference.com/w/cpp/types/is_union.html',0,'std']]],
-  ['is_5funsigned_91',['is_unsigned',['http://en.cppreference.com/w/cpp/types/is_unsigned.html',0,'std']]],
-  ['is_5funsigned_3c_20uint128_5ft_20_3e_92',['is_unsigned&lt; uint128_t &gt;',['../d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html',1,'std']]],
-  ['is_5funsigned_3c_20uint256_5ft_20_3e_93',['is_unsigned&lt; uint256_t &gt;',['../df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html',1,'std']]],
-  ['is_5fvoid_94',['is_void',['http://en.cppreference.com/w/cpp/types/is_void.html',0,'std']]],
-  ['is_5fvolatile_95',['is_volatile',['http://en.cppreference.com/w/cpp/types/is_volatile.html',0,'std']]],
-  ['istream_96',['istream',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]],
-  ['istream_5fiterator_97',['istream_iterator',['http://en.cppreference.com/w/cpp/iterator/istream_iterator.html',0,'std']]],
-  ['istreambuf_5fiterator_98',['istreambuf_iterator',['http://en.cppreference.com/w/cpp/iterator/istreambuf_iterator.html',0,'std']]],
-  ['istringstream_99',['istringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std']]],
-  ['istrstream_100',['istrstream',['http://en.cppreference.com/w/cpp/io/istrstream.html',0,'std']]],
-  ['item_101',['Item',['../db/d66/struct_item.html',1,'']]],
-  ['iter_5ftype_102',['iter_type',['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std::num_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get_byname::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put_byname::iter_type']]],
-  ['iterator_103',['iterator',['http://en.cppreference.com/w/cpp/iterator/iterator.html',0,'std']]],
-  ['iterator_5ftraits_104',['iterator_traits',['http://en.cppreference.com/w/cpp/iterator/iterator_traits.html',0,'std']]]
+  ['info_0',['Info',['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html',1,'machine_learning::aystar_search::AyStarSearch']]],
+  ['is_5farithmetic_3c_20uint128_5ft_20_3e_1',['is_arithmetic&lt; uint128_t &gt;',['../d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html',1,'std']]],
+  ['is_5farithmetic_3c_20uint256_5ft_20_3e_2',['is_arithmetic&lt; uint256_t &gt;',['../dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html',1,'std']]],
+  ['is_5fintegral_3c_20uint128_5ft_20_3e_3',['is_integral&lt; uint128_t &gt;',['../d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html',1,'std']]],
+  ['is_5fintegral_3c_20uint256_5ft_20_3e_4',['is_integral&lt; uint256_t &gt;',['../d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html',1,'std']]],
+  ['is_5funsigned_3c_20uint128_5ft_20_3e_5',['is_unsigned&lt; uint128_t &gt;',['../d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html',1,'std']]],
+  ['is_5funsigned_3c_20uint256_5ft_20_3e_6',['is_unsigned&lt; uint256_t &gt;',['../df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html',1,'std']]],
+  ['item_7',['Item',['../db/d66/struct_item.html',1,'']]]
 ];
diff --git a/search/classes_9.js b/search/classes_9.js
index d62a24b31..a6f127cd0 100644
--- a/search/classes_9.js
+++ b/search/classes_9.js
@@ -1,4 +1,4 @@
 var searchData=
 [
-  ['jmp_5fbuf_0',['jmp_buf',['http://en.cppreference.com/w/cpp/utility/program/jmp_buf.html',0,'std']]]
+  ['knn_0',['Knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html',1,'machine_learning::k_nearest_neighbors']]]
 ];
diff --git a/search/classes_a.js b/search/classes_a.js
index 428636164..7841de90c 100644
--- a/search/classes_a.js
+++ b/search/classes_a.js
@@ -1,6 +1,12 @@
 var searchData=
 [
-  ['kilo_0',['kilo',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['knn_1',['Knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html',1,'machine_learning::k_nearest_neighbors']]],
-  ['knuth_5fb_2',['knuth_b',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine.html',0,'std']]]
+  ['large_5fnumber_0',['large_number',['../db/d82/classlarge__number.html',1,'']]],
+  ['lfucache_1',['LFUCache',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html',1,'others::Cache']]],
+  ['link_2',['link',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html',1,'data_structures::linked_list']]],
+  ['linkedlist_3',['linkedlist',['../d0/dff/structlinkedlist.html',1,'']]],
+  ['list_4',['list',['../d1/def/classdata__structures_1_1linked__list_1_1list.html',1,'data_structures::linked_list::list'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html',1,'data_structures::list_array::list&lt; N &gt;'],['../d8/d10/structlist.html',1,'list']]],
+  ['listnode_5',['ListNode',['../d7/da4/struct_list_node.html',1,'']]],
+  ['longest_5fsubstring_6',['Longest_Substring',['../da/d21/class_longest___substring.html',1,'']]],
+  ['lowestcommonancestor_7',['LowestCommonAncestor',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html',1,'graph']]],
+  ['lrucache_8',['LRUCache',['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html',1,'others::Cache::LRUCache&lt; K, V &gt;'],['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html',1,'others::lru_cache::LRUCache']]]
 ];
diff --git a/search/classes_b.js b/search/classes_b.js
index 7abb99b73..e1ab8e2c4 100644
--- a/search/classes_b.js
+++ b/search/classes_b.js
@@ -1,26 +1,7 @@
 var searchData=
 [
-  ['large_5fnumber_0',['large_number',['../db/d82/classlarge__number.html',1,'']]],
-  ['lconv_1',['lconv',['http://en.cppreference.com/w/cpp/locale/lconv.html',0,'std']]],
-  ['length_5ferror_2',['length_error',['http://en.cppreference.com/w/cpp/error/length_error.html',0,'std']]],
-  ['less_3',['less',['http://en.cppreference.com/w/cpp/utility/functional/less.html',0,'std']]],
-  ['less_5fequal_4',['less_equal',['http://en.cppreference.com/w/cpp/utility/functional/less_equal.html',0,'std']]],
-  ['lfucache_5',['LFUCache',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html',1,'others::Cache']]],
-  ['linear_5fcongruential_5fengine_6',['linear_congruential_engine',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html',0,'std']]],
-  ['link_7',['link',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html',1,'data_structures::linked_list']]],
-  ['linkedlist_8',['linkedlist',['../d0/dff/structlinkedlist.html',1,'']]],
-  ['list_9',['list',['../d1/def/classdata__structures_1_1linked__list_1_1list.html',1,'data_structures::linked_list::list'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html',1,'data_structures::list_array::list&lt; N &gt;'],['../d8/d10/structlist.html',1,'list'],['http://en.cppreference.com/w/cpp/container/list.html',0,'std::list&lt; T &gt;']]],
-  ['list_3c_20int_20_3e_10',['list&lt; int &gt;',['http://en.cppreference.com/w/cpp/container/list.html',0,'std']]],
-  ['list_3c_20uint64_5ft_20_3e_11',['list&lt; uint64_t &gt;',['http://en.cppreference.com/w/cpp/container/list.html',0,'std']]],
-  ['listnode_12',['ListNode',['../d7/da4/struct_list_node.html',1,'']]],
-  ['locale_13',['locale',['http://en.cppreference.com/w/cpp/locale/locale.html',0,'std']]],
-  ['lock_5fguard_14',['lock_guard',['http://en.cppreference.com/w/cpp/thread/lock_guard.html',0,'std']]],
-  ['logic_5ferror_15',['logic_error',['http://en.cppreference.com/w/cpp/error/logic_error.html',0,'std']]],
-  ['logical_5fand_16',['logical_and',['http://en.cppreference.com/w/cpp/utility/functional/logical_and.html',0,'std']]],
-  ['logical_5fnot_17',['logical_not',['http://en.cppreference.com/w/cpp/utility/functional/logical_not.html',0,'std']]],
-  ['logical_5for_18',['logical_or',['http://en.cppreference.com/w/cpp/utility/functional/logical_or.html',0,'std']]],
-  ['lognormal_5fdistribution_19',['lognormal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution.html',0,'std']]],
-  ['longest_5fsubstring_20',['Longest_Substring',['../da/d21/class_longest___substring.html',1,'']]],
-  ['lowestcommonancestor_21',['LowestCommonAncestor',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html',1,'graph']]],
-  ['lrucache_22',['LRUCache',['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html',1,'others::Cache::LRUCache&lt; K, V &gt;'],['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html',1,'others::lru_cache::LRUCache']]]
+  ['matrix_0',['Matrix',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html',1,'divide_and_conquer::strassens_multiplication']]],
+  ['minheap_1',['MinHeap',['../d2/d05/class_min_heap.html',1,'']]],
+  ['minheapnode_2',['MinHeapNode',['../d5/d29/struct_min_heap_node.html',1,'']]],
+  ['mst_3',['mst',['../d1/d77/structmst.html',1,'']]]
 ];
diff --git a/search/classes_c.js b/search/classes_c.js
index e1e53a42f..4fd6d9035 100644
--- a/search/classes_c.js
+++ b/search/classes_c.js
@@ -1,43 +1,8 @@
 var searchData=
 [
-  ['make_5fsigned_0',['make_signed',['http://en.cppreference.com/w/cpp/types/make_signed.html',0,'std']]],
-  ['make_5funsigned_1',['make_unsigned',['http://en.cppreference.com/w/cpp/types/make_unsigned.html',0,'std']]],
-  ['map_2',['map',['http://en.cppreference.com/w/cpp/container/map.html',0,'std']]],
-  ['map_3c_20t_2c_20std_3a_3alist_3c_20t_20_3e_20_3e_3',['map&lt; T, std::list&lt; T &gt; &gt;',['http://en.cppreference.com/w/cpp/container/map.html',0,'std']]],
-  ['map_3c_20unsigned_20int_2c_20std_3a_3avector_3c_20unsigned_20int_20_3e_20_3e_4',['map&lt; unsigned int, std::vector&lt; unsigned int &gt; &gt;',['http://en.cppreference.com/w/cpp/container/map.html',0,'std']]],
-  ['mask_5',['mask',['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std::ctype::mask'],['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std::ctype_base::mask'],['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std::ctype_byname::mask']]],
-  ['match_5fresults_6',['match_results',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std']]],
-  ['matrix_7',['Matrix',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html',1,'divide_and_conquer::strassens_multiplication']]],
-  ['max_5falign_5ft_8',['max_align_t',['http://en.cppreference.com/w/cpp/types/max_align_t.html',0,'std']]],
-  ['mbstate_5ft_9',['mbstate_t',['http://en.cppreference.com/w/cpp/string/multibyte/mbstate_t.html',0,'std']]],
-  ['mega_10',['mega',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['mersenne_5ftwister_5fengine_11',['mersenne_twister_engine',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html',0,'std']]],
-  ['messages_12',['messages',['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std']]],
-  ['messages_5fbase_13',['messages_base',['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std']]],
-  ['messages_5fbyname_14',['messages_byname',['http://en.cppreference.com/w/cpp/locale/messages_byname.html',0,'std']]],
-  ['micro_15',['micro',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['microseconds_16',['microseconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono']]],
-  ['milli_17',['milli',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['milliseconds_18',['milliseconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono']]],
-  ['minheap_19',['MinHeap',['../d2/d05/class_min_heap.html',1,'']]],
-  ['minheapnode_20',['MinHeapNode',['../d5/d29/struct_min_heap_node.html',1,'']]],
-  ['minstd_5frand_21',['minstd_rand',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html',0,'std']]],
-  ['minstd_5frand0_22',['minstd_rand0',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html',0,'std']]],
-  ['minus_23',['minus',['http://en.cppreference.com/w/cpp/utility/functional/minus.html',0,'std']]],
-  ['minutes_24',['minutes',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono']]],
-  ['modulus_25',['modulus',['http://en.cppreference.com/w/cpp/utility/functional/modulus.html',0,'std']]],
-  ['money_5fbase_26',['money_base',['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std']]],
-  ['money_5fget_27',['money_get',['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std']]],
-  ['money_5fput_28',['money_put',['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std']]],
-  ['moneypunct_29',['moneypunct',['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std']]],
-  ['moneypunct_5fbyname_30',['moneypunct_byname',['http://en.cppreference.com/w/cpp/locale/moneypunct_byname.html',0,'std']]],
-  ['move_5fiterator_31',['move_iterator',['http://en.cppreference.com/w/cpp/iterator/move_iterator.html',0,'std']]],
-  ['mst_32',['mst',['../d1/d77/structmst.html',1,'']]],
-  ['mt19937_33',['mt19937',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html',0,'std']]],
-  ['mt19937_5f64_34',['mt19937_64',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html',0,'std']]],
-  ['multimap_35',['multimap',['http://en.cppreference.com/w/cpp/container/multimap.html',0,'std']]],
-  ['multiplies_36',['multiplies',['http://en.cppreference.com/w/cpp/utility/functional/multiplies.html',0,'std']]],
-  ['multiset_37',['multiset',['http://en.cppreference.com/w/cpp/container/multiset.html',0,'std']]],
-  ['multiset_3c_20int_20_3e_38',['multiset&lt; int &gt;',['http://en.cppreference.com/w/cpp/container/multiset.html',0,'std']]],
-  ['mutex_39',['mutex',['http://en.cppreference.com/w/cpp/thread/mutex.html',0,'std']]]
+  ['ncrmodulop_0',['NCRModuloP',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html',1,'math::ncr_modulo_p']]],
+  ['neuralnetwork_1',['NeuralNetwork',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html',1,'machine_learning::neural_network']]],
+  ['node_2',['Node',['../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html',1,'data_structures::linked_list::Node'],['../d9/d49/structdata__structures_1_1_node.html',1,'data_structures::Node'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html',1,'data_structures::tree_234::Node'],['../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html',1,'data_structures::trie_using_hashmap::Trie::Node'],['../db/d8b/struct_node.html',1,'Node&lt; ValueType &gt;'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html',1,'operations_on_datastructures::circular_linked_list::Node'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html',1,'operations_on_datastructures::inorder_traversal_of_bst::Node'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html',1,'operations_on_datastructures::reverse_binary_tree::Node'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html',1,'others::iterative_tree_traversals::Node'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html',1,'others::recursive_tree_traversals::Node'],['../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html',1,'range_queries::perSegTree::Node'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html',1,'search::sublist_search::Node']]],
+  ['node_3',['node',['../d5/da1/structnode.html',1,'']]],
+  ['node_3c_20value_5ftype_20_3e_4',['Node&lt; value_type &gt;',['../db/d8b/struct_node.html',1,'']]]
 ];
diff --git a/search/classes_d.js b/search/classes_d.js
index 9725bcc18..0c28d01a0 100644
--- a/search/classes_d.js
+++ b/search/classes_d.js
@@ -1,23 +1,6 @@
 var searchData=
 [
-  ['nano_0',['nano',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['nanoseconds_1',['nanoseconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono']]],
-  ['ncrmodulop_2',['NCRModuloP',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html',1,'math::ncr_modulo_p']]],
-  ['negate_3',['negate',['http://en.cppreference.com/w/cpp/utility/functional/negate.html',0,'std']]],
-  ['negative_5fbinomial_5fdistribution_4',['negative_binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution.html',0,'std']]],
-  ['nested_5fexception_5',['nested_exception',['http://en.cppreference.com/w/cpp/error/nested_exception.html',0,'std']]],
-  ['neuralnetwork_6',['NeuralNetwork',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html',1,'machine_learning::neural_network']]],
-  ['new_5fhandler_7',['new_handler',['http://en.cppreference.com/w/cpp/memory/new/new_handler.html',0,'std']]],
-  ['node_8',['Node',['../d4/d0e/classdata__structures_1_1linked__list_1_1_node.html',1,'data_structures::linked_list::Node'],['../d9/d49/structdata__structures_1_1_node.html',1,'data_structures::Node'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html',1,'data_structures::tree_234::Node'],['../d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html',1,'data_structures::trie_using_hashmap::Trie::Node'],['../db/d8b/struct_node.html',1,'Node&lt; ValueType &gt;'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html',1,'operations_on_datastructures::circular_linked_list::Node'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html',1,'operations_on_datastructures::inorder_traversal_of_bst::Node'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html',1,'operations_on_datastructures::reverse_binary_tree::Node'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html',1,'others::iterative_tree_traversals::Node'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html',1,'others::recursive_tree_traversals::Node'],['../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html',1,'range_queries::perSegTree::Node'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html',1,'search::sublist_search::Node']]],
-  ['node_9',['node',['../d5/da1/structnode.html',1,'']]],
-  ['node_3c_20value_5ftype_20_3e_10',['Node&lt; value_type &gt;',['../db/d8b/struct_node.html',1,'']]],
-  ['normal_5fdistribution_11',['normal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution.html',0,'std']]],
-  ['not_5fequal_5fto_12',['not_equal_to',['http://en.cppreference.com/w/cpp/utility/functional/not_equal_to.html',0,'std']]],
-  ['nothrow_5ft_13',['nothrow_t',['http://en.cppreference.com/w/cpp/memory/new/nothrow_t.html',0,'std']]],
-  ['nullptr_5ft_14',['nullptr_t',['http://en.cppreference.com/w/cpp/types/nullptr_t.html',0,'std']]],
-  ['num_5fget_15',['num_get',['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std']]],
-  ['num_5fput_16',['num_put',['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std']]],
-  ['numeric_5flimits_17',['numeric_limits',['http://en.cppreference.com/w/cpp/types/numeric_limits.html',0,'std']]],
-  ['numpunct_18',['numpunct',['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std']]],
-  ['numpunct_5fbyname_19',['numpunct_byname',['http://en.cppreference.com/w/cpp/locale/numpunct_byname.html',0,'std']]]
+  ['pattern_0',['pattern',['../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html',1,'strings::boyer_moore']]],
+  ['persegtree_1',['perSegTree',['../d8/d28/classrange__queries_1_1per_seg_tree.html',1,'range_queries']]],
+  ['point_2',['Point',['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html',1,'ciphers::elliptic_curve_key_exchange::Point'],['../d7/d48/structgeometry_1_1grahamscan_1_1_point.html',1,'geometry::grahamscan::Point'],['../d9/d5a/structgeometry_1_1jarvis_1_1_point.html',1,'geometry::jarvis::Point'],['../d8/dc8/struct_point.html',1,'Point']]]
 ];
diff --git a/search/classes_e.js b/search/classes_e.js
index 35f87846d..d987de692 100644
--- a/search/classes_e.js
+++ b/search/classes_e.js
@@ -1,15 +1,7 @@
 var searchData=
 [
-  ['ofstream_0',['ofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std']]],
-  ['once_5fflag_1',['once_flag',['http://en.cppreference.com/w/cpp/thread/once_flag.html',0,'std']]],
-  ['optional_2',['optional',['http://en.cppreference.com/w/cpp/experimental/optional.html',0,'std::experimental']]],
-  ['ostream_3',['ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]],
-  ['ostream_5fiterator_4',['ostream_iterator',['http://en.cppreference.com/w/cpp/iterator/ostream_iterator.html',0,'std']]],
-  ['ostreambuf_5fiterator_5',['ostreambuf_iterator',['http://en.cppreference.com/w/cpp/iterator/ostreambuf_iterator.html',0,'std']]],
-  ['ostringstream_6',['ostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std']]],
-  ['ostrstream_7',['ostrstream',['http://en.cppreference.com/w/cpp/io/ostrstream.html',0,'std']]],
-  ['out_5fof_5frange_8',['out_of_range',['http://en.cppreference.com/w/cpp/error/out_of_range.html',0,'std']]],
-  ['output_5fiterator_5ftag_9',['output_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]],
-  ['overflow_5ferror_10',['overflow_error',['http://en.cppreference.com/w/cpp/error/overflow_error.html',0,'std']]],
-  ['owner_5fless_11',['owner_less',['http://en.cppreference.com/w/cpp/memory/owner_less.html',0,'std']]]
+  ['query_0',['query',['../dd/d1b/structquery.html',1,'']]],
+  ['queue_1',['Queue',['../dc/db5/struct_queue.html',1,'']]],
+  ['queue_2',['queue',['../db/da9/classqueue.html',1,'']]],
+  ['queue_5farray_3',['Queue_Array',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html',1,'data_structures::queue_using_array']]]
 ];
diff --git a/search/classes_f.js b/search/classes_f.js
index 850e61fbe..476da1b78 100644
--- a/search/classes_f.js
+++ b/search/classes_f.js
@@ -1,25 +1,5 @@
 var searchData=
 [
-  ['packaged_5ftask_0',['packaged_task',['http://en.cppreference.com/w/cpp/thread/packaged_task.html',0,'std']]],
-  ['pair_1',['pair',['http://en.cppreference.com/w/cpp/utility/pair.html',0,'std']]],
-  ['pair_3c_20int8_5ft_2c_20int8_5ft_20_3e_2',['pair&lt; int8_t, int8_t &gt;',['http://en.cppreference.com/w/cpp/utility/pair.html',0,'std']]],
-  ['pair_3c_20others_3a_3acache_3a_3ad_5fnode_3c_20k_2c_20v_20_3e_20_2a_2c_20int_20_3e_3',['pair&lt; others::Cache::D_Node&lt; K, V &gt; *, int &gt;',['http://en.cppreference.com/w/cpp/utility/pair.html',0,'std']]],
-  ['pair_3c_20others_3a_3acache_3a_3ad_5fnode_3c_20k_2c_20v_20_3e_20_2a_2c_20others_3a_3acache_3a_3ad_5fnode_3c_20k_2c_20v_20_3e_20_2a_20_3e_4',['pair&lt; others::Cache::D_Node&lt; K, V &gt; *, others::Cache::D_Node&lt; K, V &gt; * &gt;',['http://en.cppreference.com/w/cpp/utility/pair.html',0,'std']]],
-  ['pattern_5',['pattern',['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_base::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_get::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_put::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::moneypunct::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::moneypunct_byname::pattern'],['../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html',1,'strings::boyer_moore::pattern']]],
-  ['persegtree_6',['perSegTree',['../d8/d28/classrange__queries_1_1per_seg_tree.html',1,'range_queries']]],
-  ['peta_7',['peta',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['pico_8',['pico',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]],
-  ['piecewise_5fconstant_5fdistribution_9',['piecewise_constant_distribution',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution.html',0,'std']]],
-  ['piecewise_5fconstruct_5ft_10',['piecewise_construct_t',['http://en.cppreference.com/w/cpp/utility/piecewise_construct_t.html',0,'std']]],
-  ['piecewise_5flinear_5fdistribution_11',['piecewise_linear_distribution',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution.html',0,'std']]],
-  ['placeholders_12',['placeholders',['http://en.cppreference.com/w/cpp/utility/functional/placeholders.html',0,'std']]],
-  ['plus_13',['plus',['http://en.cppreference.com/w/cpp/utility/functional/plus.html',0,'std']]],
-  ['point_14',['Point',['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html',1,'ciphers::elliptic_curve_key_exchange::Point'],['../d7/d48/structgeometry_1_1grahamscan_1_1_point.html',1,'geometry::grahamscan::Point'],['../d9/d5a/structgeometry_1_1jarvis_1_1_point.html',1,'geometry::jarvis::Point'],['../d8/dc8/struct_point.html',1,'Point']]],
-  ['pointer_5fsafety_15',['pointer_safety',['http://en.cppreference.com/w/cpp/memory/gc/pointer_safety.html',0,'std']]],
-  ['pointer_5ftraits_16',['pointer_traits',['http://en.cppreference.com/w/cpp/memory/pointer_traits.html',0,'std']]],
-  ['poisson_5fdistribution_17',['poisson_distribution',['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution.html',0,'std']]],
-  ['priority_5fqueue_18',['priority_queue',['http://en.cppreference.com/w/cpp/container/priority_queue.html',0,'std']]],
-  ['priority_5fqueue_3c_20std_3a_3atuple_3c_20s_2c_20t_2c_20e_2c_20double_2c_20double_2c_20double_20_3e_2c_20std_3a_3avector_3c_20std_3a_3atuple_3c_20s_2c_20t_2c_20e_2c_20double_2c_20double_2c_20double_20_3e_20_3e_2c_20compare_3c_20s_2c_20t_2c_20e_20_3e_20_3e_19',['priority_queue&lt; std::tuple&lt; S, T, E, double, double, double &gt;, std::vector&lt; std::tuple&lt; S, T, E, double, double, double &gt; &gt;, Compare&lt; S, T, E &gt; &gt;',['http://en.cppreference.com/w/cpp/container/priority_queue.html',0,'std']]],
-  ['promise_20',['promise',['http://en.cppreference.com/w/cpp/thread/promise.html',0,'std']]],
-  ['ptrdiff_5ft_21',['ptrdiff_t',['http://en.cppreference.com/w/cpp/types/ptrdiff_t.html',0,'std']]]
+  ['rbtree_0',['RBtree',['../d8/d72/class_r_btree.html',1,'']]],
+  ['rootedtree_1',['RootedTree',['../d0/d58/classgraph_1_1_rooted_tree.html',1,'graph']]]
 ];
diff --git a/search/functions_0.js b/search/functions_0.js
index 9651c7188..63f714064 100644
--- a/search/functions_0.js
+++ b/search/functions_0.js
@@ -3,11 +3,10 @@ var searchData=
   ['_5f_5fdetailed_5fsingle_5fprediction_0',['__detailed_single_prediction',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b',1,'machine_learning::neural_network::NeuralNetwork']]],
   ['_5f_5fget_5finteger_5ffrom_5fstring_1',['__get_integer_from_string',['../db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df',1,'uint128_t::__get_integer_from_string()'],['../d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4',1,'uint256_t::__get_integer_from_string()']]],
   ['_5ferase_2',['_erase',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aeb4bb0db68c7c04ef9498c88c3777887',1,'data_structures::treap::Treap']]],
-  ['_5fexit_3',['_Exit',['http://en.cppreference.com/w/cpp/utility/program/_Exit.html',0,'std']]],
-  ['_5fget_5fk_5fth_4',['_get_k_th',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2',1,'data_structures::treap::Treap']]],
-  ['_5fget_5frank_5',['_get_rank',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec',1,'data_structures::treap::Treap']]],
-  ['_5finsert_6',['_insert',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c',1,'data_structures::treap::Treap']]],
-  ['_5flez_7',['_lez',['../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2',1,'uint128_t::_lez()'],['../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163',1,'uint256_t::_lez()']]],
-  ['_5frandom_8',['_random',['../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485',1,'kohonen_som_topology.cpp']]],
-  ['_5ftrz_9',['_trz',['../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e',1,'uint128_t::_trz()'],['../d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250',1,'uint256_t::_trz()']]]
+  ['_5fget_5fk_5fth_3',['_get_k_th',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ad08520c0617eb8dcfcbfa90d258aa6b2',1,'data_structures::treap::Treap']]],
+  ['_5fget_5frank_4',['_get_rank',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9a77d22f97add119123108211c6655ec',1,'data_structures::treap::Treap']]],
+  ['_5finsert_5',['_insert',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a6a023a4f0c42fb8ed5b3368fba1a5f2c',1,'data_structures::treap::Treap']]],
+  ['_5flez_6',['_lez',['../db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2',1,'uint128_t::_lez()'],['../d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163',1,'uint256_t::_lez()']]],
+  ['_5frandom_7',['_random',['../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485',1,'kohonen_som_topology.cpp']]],
+  ['_5ftrz_8',['_trz',['../db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e',1,'uint128_t::_trz()'],['../d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250',1,'uint256_t::_trz()']]]
 ];
diff --git a/search/functions_1.js b/search/functions_1.js
index 22af57896..75b450b13 100644
--- a/search/functions_1.js
+++ b/search/functions_1.js
@@ -1,100 +1,35 @@
 var searchData=
 [
-  ['a_0',['a',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/params.html',0,'std::extreme_value_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/params.html',0,'std::uniform_real_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/params.html',0,'std::weibull_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/params.html',0,'std::uniform_int_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/params.html',0,'std::cauchy_distribution::a()']]],
-  ['a_5fstar_5fsearch_1',['a_star_search',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a48284e156fdd48fd0c41008c7e48f201',1,'machine_learning::aystar_search::AyStarSearch']]],
-  ['abbreviation_2',['abbreviation',['../d7/d73/abbreviation_8cpp.html#af53b2f647bee9c5b75ef8dd9ef685dc8',1,'dynamic_programming::abbreviation']]],
-  ['abbreviation_5frecursion_3',['abbreviation_recursion',['../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa',1,'dynamic_programming::abbreviation']]],
-  ['abort_4',['abort',['http://en.cppreference.com/w/cpp/utility/program/abort.html',0,'std']]],
-  ['abs_5',['abs',['../da/d5a/class_complex.html#ae5b51b749ea4964104b9527af9d8f556',1,'Complex']]],
-  ['abs_28float_29_6',['abs(float)',['http://en.cppreference.com/w/cpp/numeric/math/fabs.html',0,'std']]],
-  ['abs_28int_29_7',['abs(int)',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]],
-  ['accumulate_8',['accumulate',['http://en.cppreference.com/w/cpp/algorithm/accumulate.html',0,'std']]],
-  ['acos_9',['acos',['http://en.cppreference.com/w/cpp/numeric/math/acos.html',0,'std']]],
-  ['acosh_10',['acosh',['http://en.cppreference.com/w/cpp/numeric/math/acosh.html',0,'std']]],
-  ['activation_11',['activation',['../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325',1,'machine_learning::adaline']]],
-  ['adaline_12',['adaline',['../d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c',1,'machine_learning::adaline']]],
-  ['add_13',['add',['../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c',1,'data_structures::Bitset::add()'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840',1,'data_structures::BloomFilter::add()'],['../dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff',1,'hash_chain::add()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::add()'],['../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3',1,'add():&#160;uint128_t.hpp'],['../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a',1,'double_hashing::add()'],['../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1',1,'linear_probing::add()'],['../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9',1,'quadratic_probing::add()'],['../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35',1,'add():&#160;string_fibonacci.cpp']]],
-  ['add_5fdigit_14',['add_digit',['../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615',1,'large_number']]],
-  ['add_5fedge_15',['add_edge',['../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19',1,'graph::Graph::add_edge()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79',1,'greedy_algorithms::dijkstra::Graph::add_edge()'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d',1,'range_queries::heavy_light_decomposition::Tree::add_edge()']]],
-  ['add_5fstrings_16',['add_strings',['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ad76f5cac3ef8dc034f6abb99b64c2b20',1,'divide_and_conquer::karatsuba_algorithm']]],
-  ['addbinary_17',['addBinary',['../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527',1,'greedy_algorithms::BinaryAddition']]],
-  ['addedge_18',['addEdge',['../da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5',1,'Graph::addEdge(Edge const &amp;edge)'],['../da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910',1,'Graph::addEdge(unsigned int source, unsigned int destination)'],['../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a',1,'graph::HKGraph::addEdge()'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b',1,'graph::is_graph_bipartite::Graph::addEdge()'],['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345',1,'graph::topological_sort::Graph::addEdge()'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a69172365aebde9be1997157f6f80e0cf',1,'graph::bidirectional_dijkstra::addEdge()'],['../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2',1,'graph::addEdge(std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, int v)'],['../df/dce/namespacegraph.html#ad4016cfc80485a43748895a2c26c7d08',1,'graph::addEdge(std::vector&lt; std::vector&lt; size_t &gt; &gt; *adj, size_t u, size_t v)'],['../da/d4b/depth__first__search__with__stack_8cpp.html#aadebe9c855821d6515ca5b171222ef7b',1,'graph::depth_first_search::addEdge()'],['../df/dce/namespacegraph.html#a0e30e0dca68cb6e4f671440819b35b6a',1,'graph::addEdge()']]],
-  ['addinfo_19',['addInfo',['../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560',1,'double_hashing::addInfo()'],['../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908',1,'linear_probing::addInfo()'],['../d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768',1,'quadratic_probing::addInfo()']]],
-  ['addition_20',['addition',['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf',1,'ciphers::elliptic_curve_key_exchange']]],
-  ['addition_5frule_5fdependent_21',['addition_rule_dependent',['../d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0',1,'addition_rule.cpp']]],
-  ['addition_5frule_5findependent_22',['addition_rule_independent',['../d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d',1,'addition_rule.cpp']]],
-  ['addprocess_23',['addProcess',['../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69',1,'FCFS']]],
-  ['address_24',['address',['http://en.cppreference.com/w/cpp/memory/allocator/address.html',0,'std::allocator']]],
-  ['addressof_25',['addressof',['http://en.cppreference.com/w/cpp/memory/addressof.html',0,'std']]],
-  ['addvertices_26',['addVertices',['../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413',1,'Graph']]],
-  ['adjacent_5fdifference_27',['adjacent_difference',['http://en.cppreference.com/w/cpp/algorithm/adjacent_difference.html',0,'std']]],
-  ['adjacent_5ffind_28',['adjacent_find',['http://en.cppreference.com/w/cpp/algorithm/adjacent_find.html',0,'std']]],
-  ['advance_29',['advance',['http://en.cppreference.com/w/cpp/iterator/advance.html',0,'std']]],
-  ['align_30',['align',['http://en.cppreference.com/w/cpp/memory/align.html',0,'std']]],
-  ['aliquot_5fsum_31',['aliquot_sum',['../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf',1,'math']]],
-  ['all_32',['all',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]],
-  ['all_5fof_33',['all_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]],
-  ['allocate_34',['allocate',['http://en.cppreference.com/w/cpp/memory/allocator_traits/allocate.html',0,'std::allocator_traits::allocate()'],['http://en.cppreference.com/w/cpp/memory/allocator/allocate.html',0,'std::allocator::allocate()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/allocate.html',0,'std::scoped_allocator_adaptor::allocate()']]],
-  ['allocate_5fshared_35',['allocate_shared',['http://en.cppreference.com/w/cpp/memory/shared_ptr/allocate_shared.html',0,'std']]],
-  ['allocator_36',['allocator',['http://en.cppreference.com/w/cpp/memory/allocator/allocator.html',0,'std::allocator']]],
-  ['alpha_37',['alpha',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/params.html',0,'std::gamma_distribution']]],
-  ['always_5fnoconv_38',['always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::always_noconv()']]],
-  ['and_5ftest_39',['and_test',['../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9',1,'boyer_moore.cpp']]],
-  ['ans_40',['ans',['../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa',1,'matrix_exponentiation.cpp']]],
-  ['any_41',['any',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]],
-  ['any_5fof_42',['any_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]],
-  ['append_43',['append',['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::basic_string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::wstring::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::u16string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::u32string::append()']]],
-  ['apply_5ffunction_44',['apply_function',['../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb',1,'machine_learning']]],
-  ['approximate_5fpi_45',['approximate_pi',['../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188',1,'math']]],
-  ['are_5falmost_5fequal_46',['are_almost_equal',['../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703',1,'others']]],
-  ['are_5famicable_47',['are_amicable',['../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec',1,'math']]],
-  ['arg_48',['arg',['../da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41',1,'Complex']]],
-  ['argmax_49',['argmax',['../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec',1,'machine_learning']]],
-  ['asctime_50',['asctime',['http://en.cppreference.com/w/cpp/chrono/c/asctime.html',0,'std']]],
-  ['asin_51',['asin',['http://en.cppreference.com/w/cpp/numeric/math/asin.html',0,'std']]],
-  ['asinh_52',['asinh',['http://en.cppreference.com/w/cpp/numeric/math/asinh.html',0,'std']]],
-  ['ask_5fdata_53',['ask_data',['../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3',1,'games::memory_game']]],
-  ['assertarray_54',['assertArray',['../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a',1,'quadratic_equations_complex_numbers.cpp']]],
-  ['assign_55',['assign',['http://en.cppreference.com/w/cpp/container/vector/assign.html',0,'std::vector::assign()'],['http://en.cppreference.com/w/cpp/string/char_traits/assign.html',0,'std::char_traits::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::string::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::regex::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::basic_regex::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::wregex::assign()'],['http://en.cppreference.com/w/cpp/container/forward_list/assign.html',0,'std::forward_list::assign()'],['http://en.cppreference.com/w/cpp/error/error_code/assign.html',0,'std::error_code::assign()'],['http://en.cppreference.com/w/cpp/container/deque/assign.html',0,'std::deque::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::basic_string::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::wstring::assign()'],['http://en.cppreference.com/w/cpp/utility/functional/function/assign.html',0,'std::function::assign()'],['http://en.cppreference.com/w/cpp/error/error_condition/assign.html',0,'std::error_condition::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::u16string::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::u32string::assign()'],['http://en.cppreference.com/w/cpp/container/list/assign.html',0,'std::list::assign()']]],
-  ['assign_5fresults_56',['assign_results',['../d8/d41/namespacegames_1_1memory__game.html#a3ceeea62d8fa6c563e2c66359fd73413',1,'games::memory_game']]],
-  ['async_57',['async',['http://en.cppreference.com/w/cpp/thread/async.html',0,'std']]],
-  ['at_58',['at',['http://en.cppreference.com/w/cpp/container/dynarray/at.html',0,'std::dynarray::at()'],['http://en.cppreference.com/w/cpp/container/vector/at.html',0,'std::vector::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::string::at()'],['http://en.cppreference.com/w/cpp/container/unordered_map/at.html',0,'std::unordered_map::at()'],['http://en.cppreference.com/w/cpp/container/deque/at.html',0,'std::deque::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::basic_string::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::wstring::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::u16string::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::u32string::at()'],['http://en.cppreference.com/w/cpp/container/map/at.html',0,'std::map::at()'],['http://en.cppreference.com/w/cpp/container/array/at.html',0,'std::array::at()']]],
-  ['at_5fquick_5fexit_59',['at_quick_exit',['http://en.cppreference.com/w/cpp/utility/program/at_quick_exit.html',0,'std']]],
-  ['atan_60',['atan',['http://en.cppreference.com/w/cpp/numeric/math/atan.html',0,'std']]],
-  ['atan2_61',['atan2',['http://en.cppreference.com/w/cpp/numeric/math/atan2.html',0,'std']]],
-  ['atanh_62',['atanh',['http://en.cppreference.com/w/cpp/numeric/math/atanh.html',0,'std']]],
-  ['atbash_5fcipher_63',['atbash_cipher',['../dc/dfb/atbash__cipher_8cpp.html#a8f7dd4dcd3df7c512c20482afc2dbb9d',1,'ciphers::atbash']]],
-  ['atexit_64',['atexit',['http://en.cppreference.com/w/cpp/utility/program/atexit.html',0,'std']]],
-  ['atof_65',['atof',['http://en.cppreference.com/w/cpp/string/byte/atof.html',0,'std']]],
-  ['atoi_66',['atoi',['http://en.cppreference.com/w/cpp/string/byte/atoi.html',0,'std']]],
-  ['atol_67',['atol',['http://en.cppreference.com/w/cpp/string/byte/atoi.html',0,'std']]],
-  ['atoll_68',['atoll',['http://en.cppreference.com/w/cpp/string/byte/atoi.html',0,'std']]],
-  ['atomic_69',['atomic',['http://en.cppreference.com/w/cpp/atomic/atomic/atomic.html',0,'std::atomic']]],
-  ['atomic_5fcompare_5fexchange_5fstrong_70',['atomic_compare_exchange_strong',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]],
-  ['atomic_5fcompare_5fexchange_5fstrong_5fexplicit_71',['atomic_compare_exchange_strong_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]],
-  ['atomic_5fcompare_5fexchange_5fweak_72',['atomic_compare_exchange_weak',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]],
-  ['atomic_5fcompare_5fexchange_5fweak_5fexplicit_73',['atomic_compare_exchange_weak_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]],
-  ['atomic_5fexchange_74',['atomic_exchange',['http://en.cppreference.com/w/cpp/atomic/atomic_exchange.html',0,'std']]],
-  ['atomic_5fexchange_5fexplicit_75',['atomic_exchange_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_exchange.html',0,'std']]],
-  ['atomic_5ffetch_5fadd_76',['atomic_fetch_add',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_add.html',0,'std']]],
-  ['atomic_5ffetch_5fadd_5fexplicit_77',['atomic_fetch_add_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_add.html',0,'std']]],
-  ['atomic_5ffetch_5fand_78',['atomic_fetch_and',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]],
-  ['atomic_5ffetch_5fand_5fexplicit_79',['atomic_fetch_and_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]],
-  ['atomic_5ffetch_5for_80',['atomic_fetch_or',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_or.html',0,'std']]],
-  ['atomic_5ffetch_5for_5fexplicit_81',['atomic_fetch_or_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_or.html',0,'std']]],
-  ['atomic_5ffetch_5fsub_82',['atomic_fetch_sub',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]],
-  ['atomic_5ffetch_5fsub_5fexplicit_83',['atomic_fetch_sub_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]],
-  ['atomic_5ffetch_5fxor_84',['atomic_fetch_xor',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_xor.html',0,'std']]],
-  ['atomic_5ffetch_5fxor_5fexplicit_85',['atomic_fetch_xor_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_xor.html',0,'std']]],
-  ['atomic_5fflag_86',['atomic_flag',['http://en.cppreference.com/w/cpp/atomic/atomic_flag/atomic_flag.html',0,'std::atomic_flag']]],
-  ['atomic_5finit_87',['atomic_init',['http://en.cppreference.com/w/cpp/atomic/atomic_init.html',0,'std']]],
-  ['atomic_5fis_5flock_5ffree_88',['atomic_is_lock_free',['http://en.cppreference.com/w/cpp/atomic/atomic_is_lock_free.html',0,'std']]],
-  ['atomic_5fload_89',['atomic_load',['http://en.cppreference.com/w/cpp/atomic/atomic_load.html',0,'std']]],
-  ['atomic_5fload_5fexplicit_90',['atomic_load_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_load.html',0,'std']]],
-  ['atomic_5fsignal_5ffence_91',['atomic_signal_fence',['http://en.cppreference.com/w/cpp/atomic/atomic_signal_fence.html',0,'std']]],
-  ['atomic_5fstore_92',['atomic_store',['http://en.cppreference.com/w/cpp/atomic/atomic_store.html',0,'std']]],
-  ['atomic_5fstore_5fexplicit_93',['atomic_store_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_store.html',0,'std']]],
-  ['atomic_5fthread_5ffence_94',['atomic_thread_fence',['http://en.cppreference.com/w/cpp/atomic/atomic_thread_fence.html',0,'std']]],
-  ['auto_5fptr_95',['auto_ptr',['http://en.cppreference.com/w/cpp/memory/auto_ptr/auto_ptr.html',0,'std::auto_ptr']]],
-  ['aystarsearch_96',['AyStarSearch',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e',1,'machine_learning::aystar_search::AyStarSearch']]]
+  ['a_5fstar_5fsearch_0',['a_star_search',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a48284e156fdd48fd0c41008c7e48f201',1,'machine_learning::aystar_search::AyStarSearch']]],
+  ['abbreviation_1',['abbreviation',['../d7/d73/abbreviation_8cpp.html#af53b2f647bee9c5b75ef8dd9ef685dc8',1,'dynamic_programming::abbreviation']]],
+  ['abbreviation_5frecursion_2',['abbreviation_recursion',['../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa',1,'dynamic_programming::abbreviation']]],
+  ['abs_3',['abs',['../da/d5a/class_complex.html#ae5b51b749ea4964104b9527af9d8f556',1,'Complex']]],
+  ['activation_4',['activation',['../d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325',1,'machine_learning::adaline']]],
+  ['adaline_5',['adaline',['../d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c',1,'machine_learning::adaline']]],
+  ['add_6',['add',['../d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c',1,'data_structures::Bitset::add()'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840',1,'data_structures::BloomFilter::add()'],['../dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff',1,'hash_chain::add()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::add()'],['../da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3',1,'add():&#160;uint128_t.hpp'],['../d0/d65/namespacedouble__hashing.html#a79a9c914a6c68275b3640303d7faad8a',1,'double_hashing::add()'],['../d8/d89/namespacelinear__probing.html#a16d34fd3511626a83ab00665d7bc34d1',1,'linear_probing::add()'],['../d4/dd2/namespacequadratic__probing.html#a00ebcc6d39653eccc26f8432efbfc8d9',1,'quadratic_probing::add()'],['../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35',1,'add():&#160;string_fibonacci.cpp']]],
+  ['add_5fdigit_7',['add_digit',['../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615',1,'large_number']]],
+  ['add_5fedge_8',['add_edge',['../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19',1,'graph::Graph::add_edge()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79',1,'greedy_algorithms::dijkstra::Graph::add_edge()'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d',1,'range_queries::heavy_light_decomposition::Tree::add_edge()']]],
+  ['add_5fstrings_9',['add_strings',['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ad76f5cac3ef8dc034f6abb99b64c2b20',1,'divide_and_conquer::karatsuba_algorithm']]],
+  ['addbinary_10',['addBinary',['../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527',1,'greedy_algorithms::BinaryAddition']]],
+  ['addedge_11',['addEdge',['../da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5',1,'Graph::addEdge(Edge const &amp;edge)'],['../da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910',1,'Graph::addEdge(unsigned int source, unsigned int destination)'],['../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a',1,'graph::HKGraph::addEdge()'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b',1,'graph::is_graph_bipartite::Graph::addEdge()'],['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a57036210706a45b9363563252393a345',1,'graph::topological_sort::Graph::addEdge()'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a69172365aebde9be1997157f6f80e0cf',1,'graph::bidirectional_dijkstra::addEdge()'],['../df/dce/namespacegraph.html#a9125ceb66bfbec3093bba64c2c1e99e2',1,'graph::addEdge(std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, int v)'],['../df/dce/namespacegraph.html#ad4016cfc80485a43748895a2c26c7d08',1,'graph::addEdge(std::vector&lt; std::vector&lt; size_t &gt; &gt; *adj, size_t u, size_t v)'],['../da/d4b/depth__first__search__with__stack_8cpp.html#aadebe9c855821d6515ca5b171222ef7b',1,'graph::depth_first_search::addEdge()'],['../df/dce/namespacegraph.html#a0e30e0dca68cb6e4f671440819b35b6a',1,'graph::addEdge()']]],
+  ['addinfo_12',['addInfo',['../d0/d65/namespacedouble__hashing.html#a9c652b2e467e5d250dfe3bed83b12560',1,'double_hashing::addInfo()'],['../d8/d89/namespacelinear__probing.html#a16680b8a37d442c2f208faa286e33908',1,'linear_probing::addInfo()'],['../d4/dd2/namespacequadratic__probing.html#a312143ed316d48978084c025ff8d9768',1,'quadratic_probing::addInfo()']]],
+  ['addition_13',['addition',['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#acc5fe9c2032fb7582c38a20d1fa69bcf',1,'ciphers::elliptic_curve_key_exchange']]],
+  ['addition_5frule_5fdependent_14',['addition_rule_dependent',['../d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0',1,'addition_rule.cpp']]],
+  ['addition_5frule_5findependent_15',['addition_rule_independent',['../d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d',1,'addition_rule.cpp']]],
+  ['addprocess_16',['addProcess',['../dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69',1,'FCFS']]],
+  ['addvertices_17',['addVertices',['../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413',1,'Graph']]],
+  ['aliquot_5fsum_18',['aliquot_sum',['../dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf',1,'math']]],
+  ['and_5ftest_19',['and_test',['../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9',1,'boyer_moore.cpp']]],
+  ['ans_20',['ans',['../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa',1,'matrix_exponentiation.cpp']]],
+  ['apply_5ffunction_21',['apply_function',['../d8/d77/namespacemachine__learning.html#ad0bdc88e5f1be47c46c0f0c8ebf754bb',1,'machine_learning']]],
+  ['approximate_5fpi_22',['approximate_pi',['../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188',1,'math']]],
+  ['are_5falmost_5fequal_23',['are_almost_equal',['../d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703',1,'others']]],
+  ['are_5famicable_24',['are_amicable',['../dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec',1,'math']]],
+  ['arg_25',['arg',['../da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41',1,'Complex']]],
+  ['argmax_26',['argmax',['../d8/d77/namespacemachine__learning.html#a50480fccfb39de20ca47f1bf51ecb6ec',1,'machine_learning']]],
+  ['ask_5fdata_27',['ask_data',['../d8/d41/namespacegames_1_1memory__game.html#a5714d97649c0edd57b4fb449799676a3',1,'games::memory_game']]],
+  ['assertarray_28',['assertArray',['../da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a',1,'quadratic_equations_complex_numbers.cpp']]],
+  ['assign_5fresults_29',['assign_results',['../d8/d41/namespacegames_1_1memory__game.html#a3ceeea62d8fa6c563e2c66359fd73413',1,'games::memory_game']]],
+  ['atbash_5fcipher_30',['atbash_cipher',['../dc/dfb/atbash__cipher_8cpp.html#a8f7dd4dcd3df7c512c20482afc2dbb9d',1,'ciphers::atbash']]],
+  ['aystarsearch_31',['AyStarSearch',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#abaff2ea6d309e1133fd95bbd1e39946e',1,'machine_learning::aystar_search::AyStarSearch']]]
 ];
diff --git a/search/functions_10.js b/search/functions_10.js
index 1a8db56a6..60d25188a 100644
--- a/search/functions_10.js
+++ b/search/functions_10.js
@@ -1,105 +1,58 @@
 var searchData=
 [
-  ['p_0',['p',['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/p.html',0,'std::bernoulli_distribution::p()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/p.html',0,'std::geometric_distribution::p()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/params.html',0,'std::negative_binomial_distribution::p()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/params.html',0,'std::binomial_distribution::p()']]],
-  ['packaged_5ftask_1',['packaged_task',['http://en.cppreference.com/w/cpp/thread/packaged_task/packaged_task.html',0,'std::packaged_task']]],
-  ['pair_2',['pair',['http://en.cppreference.com/w/cpp/utility/pair/pair.html',0,'std::pair']]],
-  ['pal_5fpart_3',['pal_part',['../d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a',1,'dynamic_programming::palindrome_partitioning']]],
-  ['pancakesort_4',['pancakeSort',['../d3/d92/pancake__sort_8cpp.html#abff90bc0f54e4f8ea5f0330471781bd5',1,'sorting::pancake_sort']]],
-  ['parallelogram_5farea_5',['parallelogram_area',['../dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f',1,'math']]],
-  ['parallelogram_5fperimeter_6',['parallelogram_perimeter',['../dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3',1,'math']]],
-  ['param_7',['param',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/param.html',0,'std::student_t_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/param.html',0,'std::extreme_value_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/param.html',0,'std::lognormal_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/param.html',0,'std::discrete_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/param.html',0,'std::piecewise_constant_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/param.html',0,'std::poisson_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/param.html',0,'std::bernoulli_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/param.html',0,'std::exponential_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/param.html',0,'std::uniform_real_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/param.html',0,'std::geometric_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/param.html',0,'std::normal_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/param.html',0,'std::weibull_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/param.html',0,'std::negative_binomial_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/param.html',0,'std::chi_squared_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/param.html',0,'std::piecewise_linear_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/param.html',0,'std::uniform_int_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/param.html',0,'std::fisher_f_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/param.html',0,'std::seed_seq::param()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/param.html',0,'std::gamma_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/param.html',0,'std::binomial_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/param.html',0,'std::cauchy_distribution::param()']]],
-  ['partial_5fsort_8',['partial_sort',['http://en.cppreference.com/w/cpp/algorithm/partial_sort.html',0,'std']]],
-  ['partial_5fsort_5fcopy_9',['partial_sort_copy',['http://en.cppreference.com/w/cpp/algorithm/partial_sort_copy.html',0,'std']]],
-  ['partial_5fsum_10',['partial_sum',['http://en.cppreference.com/w/cpp/algorithm/partial_sum.html',0,'std']]],
-  ['partition_11',['partition',['http://en.cppreference.com/w/cpp/algorithm/partition.html',0,'std::partition()'],['../d1/d21/quick__sort_8cpp.html#a1b2a2cc2d319240f3b65c5b2f479ed82',1,'sorting::quick_sort::partition()'],['../d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34',1,'sorting::partition()'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a3d1c39e1ff42c04fb8ec0c0b9411cd3e',1,'sorting::random_pivot_quick_sort::partition()']]],
-  ['partition_5fcopy_12',['partition_copy',['http://en.cppreference.com/w/cpp/algorithm/partition_copy.html',0,'std']]],
-  ['partition_5fpoint_13',['partition_point',['http://en.cppreference.com/w/cpp/algorithm/partition_point.html',0,'std']]],
-  ['pascal_5ftriangle_14',['pascal_triangle',['../dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd',1,'pascal_triangle.cpp']]],
-  ['pat_5ftest_15',['pat_test',['../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2',1,'boyer_moore.cpp']]],
-  ['pbackfail_16',['pbackfail',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_filebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wstringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::stringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wfilebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wstreambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::strstreambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_stringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_streambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::filebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::streambuf::pbackfail()']]],
-  ['pbase_17',['pbase',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::pbase()']]],
-  ['pbump_18',['pbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_filebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wstringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::stringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wfilebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wstreambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::strstreambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_stringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_streambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::filebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::streambuf::pbump()']]],
-  ['pcount_19',['pcount',['http://en.cppreference.com/w/cpp/io/strstreambuf/pcount.html',0,'std::strstreambuf::pcount()'],['http://en.cppreference.com/w/cpp/io/strstream/pcount.html',0,'std::strstream::pcount()'],['http://en.cppreference.com/w/cpp/io/ostrstream/pcount.html',0,'std::ostrstream::pcount()']]],
-  ['peek_20',['peek',['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::fstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_fstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::iostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wistream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::stringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wifstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_istream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::strstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_stringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istrstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wiostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_istringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_ifstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wfstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_iostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wstringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wistringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::ifstream::peek()']]],
-  ['perror_21',['perror',['http://en.cppreference.com/w/cpp/io/c/perror.html',0,'std']]],
-  ['phifunction_22',['phiFunction',['../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5',1,'math']]],
-  ['piecewise_5fconstant_5fdistribution_23',['piecewise_constant_distribution',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/piecewise_constant_distribution.html',0,'std::piecewise_constant_distribution']]],
-  ['piecewise_5flinear_5fdistribution_24',['piecewise_linear_distribution',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/piecewise_linear_distribution.html',0,'std::piecewise_linear_distribution']]],
-  ['pigeonsort_25',['pigeonSort',['../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3',1,'sorting']]],
-  ['point_26',['Point',['../d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a',1,'Point']]],
-  ['pointer_5fto_27',['pointer_to',['http://en.cppreference.com/w/cpp/memory/pointer_traits/pointer_to.html',0,'std::pointer_traits']]],
-  ['pointincircle_28',['PointInCircle',['../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad',1,'smallest_circle.cpp']]],
-  ['poisson_5fdistribution_29',['poisson_distribution',['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/poisson_distribution.html',0,'std::poisson_distribution']]],
-  ['poisson_5fexpected_30',['poisson_expected',['../d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71',1,'poisson_dist.cpp']]],
-  ['poisson_5frange_5fsuccesses_31',['poisson_range_successes',['../d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a',1,'poisson_dist.cpp']]],
-  ['poisson_5frate_32',['poisson_rate',['../d9/d24/poisson__dist_8cpp.html#ac217ab9a06291f360d816700a6958ca8',1,'poisson_dist.cpp']]],
-  ['poisson_5fx_5fsuccesses_33',['poisson_x_successes',['../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1',1,'poisson_dist.cpp']]],
-  ['poly_5ffunction_34',['poly_function',['../da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569',1,'durand_kerner_roots.cpp']]],
-  ['pop_35',['pop',['http://en.cppreference.com/w/cpp/container/stack/pop.html',0,'std::stack::pop()'],['http://en.cppreference.com/w/cpp/container/queue/pop.html',0,'std::queue::pop()'],['http://en.cppreference.com/w/cpp/container/priority_queue/pop.html',0,'std::priority_queue::pop()'],['../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0',1,'stack::pop()'],['../d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b',1,'data_structures::Stack::pop()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb',1,'data_structures::stack_using_queue::Stack::pop()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69',1,'others::Cache::LFUCache::pop()'],['../dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664',1,'pop():&#160;paranthesis_matching.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#a421baa2002a64bc0bfc3e1b64800d734',1,'others::postfix_expression::pop()']]],
-  ['pop_5fback_36',['pop_back',['http://en.cppreference.com/w/cpp/container/vector/pop_back.html',0,'std::vector::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::string::pop_back()'],['http://en.cppreference.com/w/cpp/container/deque/pop_back.html',0,'std::deque::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::basic_string::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::wstring::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::u16string::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::u32string::pop_back()'],['http://en.cppreference.com/w/cpp/container/list/pop_back.html',0,'std::list::pop_back()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7',1,'others::Cache::LRUCache::pop_back()'],['../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d',1,'machine_learning::pop_back()']]],
-  ['pop_5ffront_37',['pop_front',['http://en.cppreference.com/w/cpp/container/forward_list/pop_front.html',0,'std::forward_list::pop_front()'],['http://en.cppreference.com/w/cpp/container/deque/pop_front.html',0,'std::deque::pop_front()'],['http://en.cppreference.com/w/cpp/container/list/pop_front.html',0,'std::list::pop_front()'],['../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093',1,'machine_learning::pop_front()']]],
-  ['pop_5fheap_38',['pop_heap',['http://en.cppreference.com/w/cpp/algorithm/pop_heap.html',0,'std']]],
-  ['populate_5fparents_39',['populate_parents',['../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e',1,'graph::RootedTree']]],
-  ['populate_5fup_40',['populate_up',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356',1,'graph::LowestCommonAncestor']]],
-  ['pos_5fformat_41',['pos_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::pos_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::pos_format()']]],
-  ['position_42',['position',['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::match_results::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::wsmatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::smatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::wcmatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::cmatch::position()']]],
-  ['positive_5fsign_43',['positive_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::positive_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::positive_sign()']]],
-  ['postfix_5fevaluation_44',['postfix_evaluation',['../d7/d75/postfix__evaluation_8cpp.html#ae38bd3a177a6d61da3859a281233bbe1',1,'others::postfix_expression']]],
-  ['postorder_45',['postorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c',1,'others::recursive_tree_traversals::BT']]],
-  ['postorderiterative_46',['postOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25',1,'others::iterative_tree_traversals::BinaryTree']]],
-  ['pow_47',['pow',['http://en.cppreference.com/w/cpp/numeric/math/pow.html',0,'std']]],
-  ['power_48',['power',['../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311',1,'math::fibonacci_sum::power()'],['../df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179',1,'math::modular_division::power()'],['../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d',1,'math::power()'],['../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f',1,'power(int x, int n):&#160;power_for_huge_numbers.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec',1,'power(const vector&lt; vector&lt; ll &gt; &gt; &amp;A, ll p):&#160;matrix_exponentiation.cpp']]],
-  ['power_5fof_5ftwo_49',['power_of_two',['../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb',1,'math']]],
-  ['pptr_50',['pptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::pptr()']]],
-  ['precision_51',['precision',['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::fstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ios::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_fstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::iostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ios_base::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wistream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::stringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wifstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_istream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::strstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_stringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istrstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wiostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_istringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ifstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostrstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wfstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_iostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wstringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wistringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ifstream::precision()']]],
-  ['predict_52',['predict',['../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3',1,'machine_learning::adaline::predict()'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a62e152db014cd4de675fa906e5ef2861',1,'machine_learning::k_nearest_neighbors::Knn::predict()']]],
-  ['predict_5fols_5fregressor_53',['predict_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493',1,'ordinary_least_squares_regressor.cpp']]],
-  ['predict_5fwords_54',['predict_words',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4',1,'data_structures::trie_using_hashmap::Trie']]],
-  ['prefix_55',['prefix',['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::match_results::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wsmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::smatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wcmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::cmatch::prefix()']]],
-  ['preorder_56',['preorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5',1,'others::recursive_tree_traversals::BT']]],
-  ['preorderiterative_57',['preOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae',1,'others::iterative_tree_traversals::BinaryTree']]],
-  ['prev_58',['prev',['http://en.cppreference.com/w/cpp/iterator/prev.html',0,'std']]],
-  ['prev_5fpermutation_59',['prev_permutation',['http://en.cppreference.com/w/cpp/algorithm/prev_permutation.html',0,'std']]],
-  ['prime_5ffactorization_60',['prime_factorization',['../db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46',1,'prime_factorization.cpp']]],
-  ['primes_61',['primes',['../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a',1,'prime_numbers.cpp']]],
-  ['print_62',['Print',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165',1,'data_structures::tree_234::Tree234']]],
-  ['print_63',['print',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::print()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a424b17ddc672b25fe0bd9dc8612fba21',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::print(Node *root)'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::print()'],['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8',1,'greedy_algorithms::dijkstra::print()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a55bc4a221e584d33b79b322432ecc0f3',1,'math::sieve_of_eratosthenes::print()'],['../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20',1,'operations_on_datastructures::print()']]],
-  ['print_5fprimes_64',['print_primes',['../dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4',1,'math']]],
-  ['print_5ftable_65',['print_table',['../d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280',1,'games::memory_game']]],
-  ['printarray_66',['printArray',['../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767',1,'heap_sort.cpp']]],
-  ['printf_67',['printf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]],
-  ['printinorder_68',['printInorder',['../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
-  ['printlinkedlist_69',['printLinkedList',['../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2',1,'search::sublist_search']]],
-  ['printmat_70',['printMat',['../d3/d05/sudoku__solver_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac',1,'backtracking::sudoku_solver']]],
-  ['printnode_71',['PrintNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be',1,'data_structures::tree_234::Tree234']]],
-  ['printresult_72',['printResult',['../dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793',1,'FCFS']]],
-  ['printroot_73',['printRoot',['../dd/d29/false__position_8cpp.html#a85cb7bfb90abc898e042d624372c5345',1,'numerical_methods::false_position']]],
-  ['printsol_74',['PrintSol',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905',1,'backtracking::n_queens_optimized::PrintSol()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aebd5e11fab6dab282efccfb61beb0bd9',1,'backtracking::n_queens_all_solutions::PrintSol()']]],
-  ['printsolution_75',['printSolution',['../d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07',1,'backtracking::graph_coloring::printSolution()'],['../d4/d3e/n__queens_8cpp.html#a40ae0c7fd04eb20e7f3bff13fc6a5808',1,'backtracking::n_queens::printSolution()']]],
-  ['priority_5fqueue_76',['priority_queue',['http://en.cppreference.com/w/cpp/container/priority_queue/priority_queue.html',0,'std::priority_queue']]],
-  ['probabilities_77',['probabilities',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/probabilities.html',0,'std::discrete_distribution']]],
-  ['probability_5fdensity_78',['probability_density',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1',1,'probability::geometric_dist::geometric_distribution']]],
-  ['problem_79',['problem',['../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy):&#160;ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy):&#160;ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy):&#160;ode_semi_implicit_euler.cpp']]],
-  ['projection_80',['projection',['../d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc',1,'numerical_methods::gram_schmidt']]],
-  ['promise_81',['promise',['http://en.cppreference.com/w/cpp/thread/promise/promise.html',0,'std::promise']]],
-  ['pubimbue_82',['pubimbue',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_filebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::stringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wfilebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstreambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::strstreambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_stringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_streambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::filebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::streambuf::pubimbue()']]],
-  ['pubseekoff_83',['pubseekoff',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_filebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::stringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wfilebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstreambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::strstreambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_stringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_streambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::filebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::streambuf::pubseekoff()']]],
-  ['pubseekpos_84',['pubseekpos',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_filebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::stringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wfilebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstreambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::strstreambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_stringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_streambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::filebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::streambuf::pubseekpos()']]],
-  ['pubsetbuf_85',['pubsetbuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_filebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::stringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wfilebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstreambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::strstreambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_stringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_streambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::filebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::streambuf::pubsetbuf()']]],
-  ['pubsync_86',['pubsync',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_filebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::stringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wfilebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstreambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::strstreambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_stringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_streambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::filebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::streambuf::pubsync()']]],
-  ['push_87',['push',['http://en.cppreference.com/w/cpp/container/stack/push.html',0,'std::stack::push()'],['http://en.cppreference.com/w/cpp/container/queue/push.html',0,'std::queue::push()'],['http://en.cppreference.com/w/cpp/container/priority_queue/push.html',0,'std::priority_queue::push()'],['../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d',1,'stack::push()'],['../d2/dc8/classdata__structures_1_1_stack.html#aa9f9b087e9e7c00628e1289f0f1de3b2',1,'data_structures::Stack::push()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2',1,'data_structures::stack_using_queue::Stack::push()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047',1,'others::Cache::LFUCache::push()'],['../dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095',1,'push():&#160;paranthesis_matching.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea',1,'others::postfix_expression::push()']]],
-  ['push_5fback_88',['push_back',['http://en.cppreference.com/w/cpp/container/vector/push_back.html',0,'std::vector::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::string::push_back()'],['http://en.cppreference.com/w/cpp/container/deque/push_back.html',0,'std::deque::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::basic_string::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::wstring::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::u16string::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::u32string::push_back()'],['http://en.cppreference.com/w/cpp/container/list/push_back.html',0,'std::list::push_back()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a6e9859d1a0755fb51e41904d20c95496',1,'data_structures::linked_list::list::push_back()']]],
-  ['push_5ffront_89',['push_front',['http://en.cppreference.com/w/cpp/container/forward_list/push_front.html',0,'std::forward_list::push_front()'],['http://en.cppreference.com/w/cpp/container/deque/push_front.html',0,'std::deque::push_front()'],['http://en.cppreference.com/w/cpp/container/list/push_front.html',0,'std::list::push_front()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a332b965afd9d6bea8d3246673acd52c7',1,'data_structures::linked_list::list::push_front()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2',1,'others::Cache::LRUCache::push_front()']]],
-  ['push_5fheap_90',['push_heap',['http://en.cppreference.com/w/cpp/algorithm/push_heap.html',0,'std']]],
-  ['put_91',['put',['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ofstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::fstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ostringstream::put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put_byname::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_fstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::iostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::stringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::strstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_stringstream::put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wostringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wiostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ofstream::put()'],['http://en.cppreference.com/w/cpp/locale/num_put/put.html',0,'std::num_put::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostrstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wfstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_iostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wofstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wstringstream::put()'],['http://en.cppreference.com/w/cpp/locale/money_put/put.html',0,'std::money_put::put()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e',1,'others::Cache::LFUCache::put()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45',1,'others::Cache::LRUCache::put()']]],
-  ['put_5fmoney_92',['put_money',['http://en.cppreference.com/w/cpp/io/manip/put_money.html',0,'std']]],
-  ['put_5ftime_93',['put_time',['http://en.cppreference.com/w/cpp/io/manip/put_time.html',0,'std']]],
-  ['putback_94',['putback',['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::fstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_fstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::iostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wistream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::stringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wifstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_istream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::strstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_stringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istrstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wiostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_istringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_ifstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wfstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_iostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wstringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wistringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::ifstream::putback()']]],
-  ['putc_95',['putc',['http://en.cppreference.com/w/cpp/io/c/fputc.html',0,'std']]],
-  ['putchar_96',['putchar',['http://en.cppreference.com/w/cpp/io/c/putchar.html',0,'std']]],
-  ['putprober_97',['putProber',['../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b',1,'double_hashing::putProber()'],['../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541',1,'linear_probing::putProber()'],['../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b',1,'quadratic_probing::putProber()']]],
-  ['puts_98',['puts',['http://en.cppreference.com/w/cpp/io/c/puts.html',0,'std']]],
-  ['putwchar_99',['putwchar',['http://en.cppreference.com/w/cpp/io/c/putwchar.html',0,'std']]],
-  ['pword_100',['pword',['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::fstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ios::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_fstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::iostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ios_base::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wistream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::stringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wifstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_istream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::strstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_stringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istrstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wiostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_istringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ifstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostrstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wfstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_iostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wstringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wistringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ifstream::pword()']]],
-  ['pyramid_5fvolume_101',['pyramid_volume',['../dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c',1,'math']]]
+  ['pal_5fpart_0',['pal_part',['../d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a',1,'dynamic_programming::palindrome_partitioning']]],
+  ['pancakesort_1',['pancakeSort',['../d3/d92/pancake__sort_8cpp.html#abff90bc0f54e4f8ea5f0330471781bd5',1,'sorting::pancake_sort']]],
+  ['parallelogram_5farea_2',['parallelogram_area',['../dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f',1,'math']]],
+  ['parallelogram_5fperimeter_3',['parallelogram_perimeter',['../dd/d47/namespacemath.html#a0efb235330ff48e14fd31faaccbcebb3',1,'math']]],
+  ['partition_4',['partition',['../d1/d21/quick__sort_8cpp.html#a1b2a2cc2d319240f3b65c5b2f479ed82',1,'sorting::quick_sort::partition()'],['../d5/d91/namespacesorting.html#aac8f44b28b4aa96444383030b28f8b34',1,'sorting::partition()'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a3d1c39e1ff42c04fb8ec0c0b9411cd3e',1,'sorting::random_pivot_quick_sort::partition()']]],
+  ['pascal_5ftriangle_5',['pascal_triangle',['../dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd',1,'pascal_triangle.cpp']]],
+  ['pat_5ftest_6',['pat_test',['../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2',1,'boyer_moore.cpp']]],
+  ['phifunction_7',['phiFunction',['../dd/d47/namespacemath.html#ac37d3ba52eb296597d7a024ba8c4a5a5',1,'math']]],
+  ['pigeonsort_8',['pigeonSort',['../d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3',1,'sorting']]],
+  ['point_9',['Point',['../d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a',1,'Point']]],
+  ['pointincircle_10',['PointInCircle',['../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad',1,'smallest_circle.cpp']]],
+  ['poisson_5fexpected_11',['poisson_expected',['../d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71',1,'poisson_dist.cpp']]],
+  ['poisson_5frange_5fsuccesses_12',['poisson_range_successes',['../d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a',1,'poisson_dist.cpp']]],
+  ['poisson_5frate_13',['poisson_rate',['../d9/d24/poisson__dist_8cpp.html#ac217ab9a06291f360d816700a6958ca8',1,'poisson_dist.cpp']]],
+  ['poisson_5fx_5fsuccesses_14',['poisson_x_successes',['../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1',1,'poisson_dist.cpp']]],
+  ['poly_5ffunction_15',['poly_function',['../da/df2/durand__kerner__roots_8cpp.html#ae2ab49ba1969d7a5988f9bc2c8924569',1,'durand_kerner_roots.cpp']]],
+  ['pop_16',['pop',['../d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0',1,'stack::pop()'],['../d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b',1,'data_structures::Stack::pop()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb',1,'data_structures::stack_using_queue::Stack::pop()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ab3561ab204754295199f9566924f7e69',1,'others::Cache::LFUCache::pop()'],['../dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664',1,'pop():&#160;paranthesis_matching.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#a421baa2002a64bc0bfc3e1b64800d734',1,'others::postfix_expression::pop()']]],
+  ['pop_5fback_17',['pop_back',['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab211a4be58491bf11834cae88a0c44f7',1,'others::Cache::LRUCache::pop_back()'],['../d8/d77/namespacemachine__learning.html#ae10178b082f0205c326550877d998e5d',1,'machine_learning::pop_back(const std::valarray&lt; T &gt; &amp;A)']]],
+  ['pop_5ffront_18',['pop_front',['../d8/d77/namespacemachine__learning.html#a912cf68863063a38d6e63545be5eb093',1,'machine_learning']]],
+  ['populate_5fparents_19',['populate_parents',['../d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e',1,'graph::RootedTree']]],
+  ['populate_5fup_20',['populate_up',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356',1,'graph::LowestCommonAncestor']]],
+  ['postfix_5fevaluation_21',['postfix_evaluation',['../d7/d75/postfix__evaluation_8cpp.html#ae38bd3a177a6d61da3859a281233bbe1',1,'others::postfix_expression']]],
+  ['postorder_22',['postorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c',1,'others::recursive_tree_traversals::BT']]],
+  ['postorderiterative_23',['postOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25',1,'others::iterative_tree_traversals::BinaryTree']]],
+  ['power_24',['power',['../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311',1,'math::fibonacci_sum::power()'],['../df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179',1,'math::modular_division::power()'],['../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d',1,'math::power()'],['../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f',1,'power(int x, int n):&#160;power_for_huge_numbers.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec',1,'power(const vector&lt; vector&lt; ll &gt; &gt; &amp;A, ll p):&#160;matrix_exponentiation.cpp']]],
+  ['power_5fof_5ftwo_25',['power_of_two',['../dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb',1,'math']]],
+  ['predict_26',['predict',['../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3',1,'machine_learning::adaline::predict()'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a62e152db014cd4de675fa906e5ef2861',1,'machine_learning::k_nearest_neighbors::Knn::predict()']]],
+  ['predict_5fols_5fregressor_27',['predict_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493',1,'ordinary_least_squares_regressor.cpp']]],
+  ['predict_5fwords_28',['predict_words',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4',1,'data_structures::trie_using_hashmap::Trie']]],
+  ['preorder_29',['preorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5',1,'others::recursive_tree_traversals::BT']]],
+  ['preorderiterative_30',['preOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae',1,'others::iterative_tree_traversals::BinaryTree']]],
+  ['prime_5ffactorization_31',['prime_factorization',['../db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46',1,'prime_factorization.cpp']]],
+  ['primes_32',['primes',['../de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a',1,'prime_numbers.cpp']]],
+  ['print_33',['Print',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a2e9a9db7792cf5383f4c4cc418255165',1,'data_structures::tree_234::Tree234']]],
+  ['print_34',['print',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac341901e926b3fa3a796c64ca572f592',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::print()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a424b17ddc672b25fe0bd9dc8612fba21',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::print(Node *root)'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::print()'],['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#a7341d7c76a6145e991cdd231f689fca8',1,'greedy_algorithms::dijkstra::print()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a55bc4a221e584d33b79b322432ecc0f3',1,'math::sieve_of_eratosthenes::print()'],['../da/d6d/namespaceoperations__on__datastructures.html#a6109193567a5b7e36a27f2b4865fce20',1,'operations_on_datastructures::print()']]],
+  ['print_5fprimes_35',['print_primes',['../dd/d47/namespacemath.html#ad09d59850865012a6fd95d89954c82e4',1,'math']]],
+  ['print_5ftable_36',['print_table',['../d8/d41/namespacegames_1_1memory__game.html#ac589ef65abb0a6b9a7116ee0f9fd5280',1,'games::memory_game']]],
+  ['printarray_37',['printArray',['../d2/d52/heap__sort_8cpp.html#a9ed3e1510afdf3edd06cf2b68769a767',1,'heap_sort.cpp']]],
+  ['printinorder_38',['printInorder',['../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
+  ['printlinkedlist_39',['printLinkedList',['../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2',1,'search::sublist_search']]],
+  ['printmat_40',['printMat',['../d3/d05/sudoku__solver_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac',1,'backtracking::sudoku_solver']]],
+  ['printnode_41',['PrintNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be',1,'data_structures::tree_234::Tree234']]],
+  ['printresult_42',['printResult',['../dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793',1,'FCFS']]],
+  ['printroot_43',['printRoot',['../dd/d29/false__position_8cpp.html#a85cb7bfb90abc898e042d624372c5345',1,'numerical_methods::false_position']]],
+  ['printsol_44',['PrintSol',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a04090463be4942a69ea91fe7386da905',1,'backtracking::n_queens_optimized::PrintSol()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aebd5e11fab6dab282efccfb61beb0bd9',1,'backtracking::n_queens_all_solutions::PrintSol()']]],
+  ['printsolution_45',['printSolution',['../d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07',1,'backtracking::graph_coloring::printSolution()'],['../d4/d3e/n__queens_8cpp.html#a40ae0c7fd04eb20e7f3bff13fc6a5808',1,'backtracking::n_queens::printSolution()']]],
+  ['probability_5fdensity_46',['probability_density',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1',1,'probability::geometric_dist::geometric_distribution']]],
+  ['problem_47',['problem',['../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy):&#160;ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy):&#160;ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &amp;x, std::valarray&lt; double &gt; *y, std::valarray&lt; double &gt; *dy):&#160;ode_semi_implicit_euler.cpp']]],
+  ['projection_48',['projection',['../d5/d33/gram__schmidt_8cpp.html#a8eeaafdde8b56f459aadc6013cf078bc',1,'numerical_methods::gram_schmidt']]],
+  ['push_49',['push',['../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d',1,'stack::push()'],['../d2/dc8/classdata__structures_1_1_stack.html#aa9f9b087e9e7c00628e1289f0f1de3b2',1,'data_structures::Stack::push()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2',1,'data_structures::stack_using_queue::Stack::push()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adad4ab43141fb8ba43facd3a71e07047',1,'others::Cache::LFUCache::push()'],['../dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095',1,'push():&#160;paranthesis_matching.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ad77f8c9cc594975756838d498c237cea',1,'others::postfix_expression::push()']]],
+  ['push_5fback_50',['push_back',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a6e9859d1a0755fb51e41904d20c95496',1,'data_structures::linked_list::list']]],
+  ['push_5ffront_51',['push_front',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a332b965afd9d6bea8d3246673acd52c7',1,'data_structures::linked_list::list::push_front()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a2e53b5ad1368d87da501f61473eb9ea2',1,'others::Cache::LRUCache::push_front()']]],
+  ['put_52',['put',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#af6f8e5a66a45436b490dfe015ff8866e',1,'others::Cache::LFUCache::put()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a5ee34fcee480f21bb6f68a34f0f69b45',1,'others::Cache::LRUCache::put()']]],
+  ['putprober_53',['putProber',['../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b',1,'double_hashing::putProber()'],['../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541',1,'linear_probing::putProber()'],['../d4/dd2/namespacequadratic__probing.html#adccc63a7e57cc6dba75bd62f40feb88b',1,'quadratic_probing::putProber()']]],
+  ['pyramid_5fvolume_54',['pyramid_volume',['../dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c',1,'math']]]
 ];
diff --git a/search/functions_11.js b/search/functions_11.js
index 3e265c3a5..995d39a3b 100644
--- a/search/functions_11.js
+++ b/search/functions_11.js
@@ -1,15 +1,11 @@
 var searchData=
 [
   ['qr_5fdecompose_0',['qr_decompose',['../d2/d3b/namespaceqr__algorithm.html#a73ce637634fc49e1d10d190eb388ebf1',1,'qr_algorithm']]],
-  ['qsort_1',['qsort',['http://en.cppreference.com/w/cpp/algorithm/qsort.html',0,'std']]],
-  ['quadraticequation_2',['quadraticEquation',['../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb',1,'math']]],
-  ['quadraticprobe_3',['quadraticProbe',['../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf',1,'quadratic_probing']]],
-  ['query_4',['query',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a0c8cbe7239232863f104793c08273039',1,'data_structures::sparse_table::Sparse_table::query()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a1fda852e6e522707fd97f61cdb0a2591',1,'range_queries::heavy_light_decomposition::SG::query()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab',1,'range_queries::heavy_light_decomposition::HLD::query()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4',1,'range_queries::perSegTree::query(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, std::shared_ptr&lt; Node &gt; const &amp;curr)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571',1,'range_queries::perSegTree::query(const uint32_t &amp;l, const uint32_t &amp;r, const uint32_t &amp;version)'],['../d1/d9e/prefix__sum__array_8cpp.html#a7c8fd967c36dbba5fdf9c71faed604cf',1,'range_queries::prefix_sum_array::query()'],['../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d',1,'query():&#160;segtree.cpp']]],
-  ['queue_5',['queue',['http://en.cppreference.com/w/cpp/container/queue/queue.html',0,'std::queue']]],
-  ['queue_5ftest_6',['queue_test',['../df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863',1,'queue_using_two_stacks.cpp']]],
-  ['quick_5fexit_7',['quick_exit',['http://en.cppreference.com/w/cpp/utility/program/quick_exit.html',0,'std']]],
-  ['quick_5fsort_8',['quick_sort',['../d1/d21/quick__sort_8cpp.html#a5e6213e8008356ac6eda9427f3f4b394',1,'sorting::quick_sort::quick_sort(std::vector&lt; T &gt; *arr, const int &amp;low, const int &amp;high)'],['../d1/d21/quick__sort_8cpp.html#a53adad7e4d83e1495df25fe8dbb4cc05',1,'sorting::quick_sort::quick_sort(std::vector&lt; T &gt; arr, const int &amp;low, const int &amp;high)']]],
-  ['quicksort_9',['quicksort',['../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168',1,'sorting::quicksort(std::vector&lt; T &gt; *arr, int32_t low, int32_t high)'],['../d5/d91/namespacesorting.html#a6eb67c2f91c98cf4464f75b5882022de',1,'sorting::quicksort(std::vector&lt; T &gt; arr, int32_t low, int32_t high)']]],
-  ['quicksortrp_10',['quickSortRP',['../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5',1,'sorting::random_pivot_quick_sort']]],
-  ['quiet_5fnan_11',['quiet_NaN',['http://en.cppreference.com/w/cpp/types/numeric_limits/quiet_NaN.html',0,'std::numeric_limits']]]
+  ['quadraticequation_1',['quadraticEquation',['../dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb',1,'math']]],
+  ['quadraticprobe_2',['quadraticProbe',['../d4/dd2/namespacequadratic__probing.html#ab431981b54c0bae1b2956f716aee1dcf',1,'quadratic_probing']]],
+  ['query_3',['query',['../da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#a0c8cbe7239232863f104793c08273039',1,'data_structures::sparse_table::Sparse_table::query()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a1fda852e6e522707fd97f61cdb0a2591',1,'range_queries::heavy_light_decomposition::SG::query()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab',1,'range_queries::heavy_light_decomposition::HLD::query()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4',1,'range_queries::perSegTree::query(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, std::shared_ptr&lt; Node &gt; const &amp;curr)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571',1,'range_queries::perSegTree::query(const uint32_t &amp;l, const uint32_t &amp;r, const uint32_t &amp;version)'],['../d1/d9e/prefix__sum__array_8cpp.html#a7c8fd967c36dbba5fdf9c71faed604cf',1,'range_queries::prefix_sum_array::query()'],['../d2/d45/segtree_8cpp.html#a423a97ea0c7ea6e33b5844a6858d902d',1,'query(std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, uint64_t qlow, uint64_t qhigh, uint64_t low, uint64_t high, uint64_t pos):&#160;segtree.cpp']]],
+  ['queue_5ftest_4',['queue_test',['../df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863',1,'queue_using_two_stacks.cpp']]],
+  ['quick_5fsort_5',['quick_sort',['../d1/d21/quick__sort_8cpp.html#a5e6213e8008356ac6eda9427f3f4b394',1,'sorting::quick_sort::quick_sort(std::vector&lt; T &gt; *arr, const int &amp;low, const int &amp;high)'],['../d1/d21/quick__sort_8cpp.html#a53adad7e4d83e1495df25fe8dbb4cc05',1,'sorting::quick_sort::quick_sort(std::vector&lt; T &gt; arr, const int &amp;low, const int &amp;high)']]],
+  ['quicksort_6',['quicksort',['../d5/d91/namespacesorting.html#a9f59fe72dacc1f1218ef3c303d843168',1,'sorting::quicksort(std::vector&lt; T &gt; *arr, int32_t low, int32_t high)'],['../d5/d91/namespacesorting.html#a6eb67c2f91c98cf4464f75b5882022de',1,'sorting::quicksort(std::vector&lt; T &gt; arr, int32_t low, int32_t high)']]],
+  ['quicksortrp_7',['quickSortRP',['../d1/daa/random__pivot__quick__sort_8cpp.html#a7d2e7465e7b5d54c2de6d5e9db1ea6a5',1,'sorting::random_pivot_quick_sort']]]
 ];
diff --git a/search/functions_12.js b/search/functions_12.js
index d845f2dbb..82dae2c69 100644
--- a/search/functions_12.js
+++ b/search/functions_12.js
@@ -2,101 +2,43 @@ var searchData=
 [
   ['rabin_5fkarp_0',['rabin_karp',['../d9/d03/namespacestring__search.html#a21c673d56cbf67b1d2ee4d869185b7d9',1,'string_search']]],
   ['radix_1',['radix',['../d8/d61/radix__sort2_8cpp.html#ae0cfd94fa3765b53d4ec7893ffaee5f8',1,'sorting::radix_sort']]],
-  ['raise_2',['raise',['http://en.cppreference.com/w/cpp/utility/program/raise.html',0,'std']]],
-  ['rand_3',['rand',['http://en.cppreference.com/w/cpp/numeric/random/rand.html',0,'std']]],
-  ['rand_5frange_4',['rand_range',['../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9',1,'ciphers::HillCipher::rand_range(T1 a, T1 b)'],['../d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395',1,'ciphers::HillCipher::rand_range(matrix&lt; T2 &gt; *M, T1 a, T1 b)']]],
-  ['random_5fdevice_5',['random_device',['http://en.cppreference.com/w/cpp/numeric/random/random_device/random_device.html',0,'std::random_device']]],
-  ['random_5fshuffle_6',['random_shuffle',['http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html',0,'std']]],
-  ['random_5ftests_7',['random_tests',['../de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f',1,'fibonacci_search.cpp']]],
-  ['randomized_5fbogosort_8',['randomized_bogosort',['../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd',1,'sorting']]],
-  ['randomlevel_9',['randomLevel',['../d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4',1,'data_structures::SkipList']]],
-  ['range_5fcomb_10',['range_comb',['../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52',1,'data_structures::SegmentTree::range_comb(int i, int l, int r, int tl, int tr)'],['../dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b',1,'data_structures::SegmentTree::range_comb(int l, int r)']]],
-  ['range_5ferror_11',['range_error',['http://en.cppreference.com/w/cpp/error/range_error.html',0,'std::range_error']]],
-  ['range_5ftries_12',['range_tries',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69',1,'probability::geometric_dist::geometric_distribution']]],
-  ['ranlux24_13',['ranlux24',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::ranlux24']]],
-  ['ranlux24_5fbase_14',['ranlux24_base',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::ranlux24_base']]],
-  ['ranlux48_15',['ranlux48',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::ranlux48']]],
-  ['ranlux48_5fbase_16',['ranlux48_base',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::ranlux48_base']]],
-  ['raw_5fstorage_5fiterator_17',['raw_storage_iterator',['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/raw_storage_iterator.html',0,'std::raw_storage_iterator']]],
-  ['rbegin_18',['rbegin',['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::rbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::rbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::rbegin()'],['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::rbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::rbegin()'],['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::rbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::rbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::rbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::rbegin()']]],
-  ['rdbuf_19',['rdbuf',['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::fstream::rdbuf()'],['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/rdbuf.html',0,'std::wbuffer_convert::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ios::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_fstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::iostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wistream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::stringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wifstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_istream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::strstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_stringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istrstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wiostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_istringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ifstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostrstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wfstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_iostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wstringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wistringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ifstream::rdbuf()']]],
-  ['rdstate_20',['rdstate',['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::fstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ios::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_fstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::iostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wistream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::stringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wifstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_istream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::strstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_stringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istrstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wiostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_istringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ifstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostrstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wfstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_iostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wstringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wistringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ifstream::rdstate()']]],
-  ['read_21',['read',['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::fstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_fstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::iostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wistream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::stringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wifstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_istream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::strstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_stringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istrstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wiostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_istringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_ifstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wfstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_iostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wstringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wistringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::ifstream::read()']]],
-  ['readsome_22',['readsome',['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::fstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_fstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::iostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wistream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::stringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wifstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_istream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::strstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_stringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istrstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wiostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_istringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_ifstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wfstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_iostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wstringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wistringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::ifstream::readsome()']]],
-  ['ready_23',['ready',['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::match_results::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::wsmatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::smatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::wcmatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::cmatch::ready()']]],
-  ['real_24',['real',['http://en.cppreference.com/w/cpp/numeric/complex/real.html',0,'std::complex::real()'],['../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6',1,'Complex::real()']]],
-  ['realloc_25',['realloc',['http://en.cppreference.com/w/cpp/memory/c/realloc.html',0,'std']]],
-  ['rec_5fternary_5fsearch_26',['rec_ternary_search',['../dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead',1,'ternary_search.cpp']]],
-  ['recalculate_5fhash_27',['recalculate_hash',['../d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893',1,'string_search']]],
-  ['rect_5farea_28',['rect_area',['../dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca',1,'math']]],
-  ['rect_5fperimeter_29',['rect_perimeter',['../dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6',1,'math']]],
-  ['rect_5fprism_5fvolume_30',['rect_prism_volume',['../dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12',1,'math']]],
-  ['recursive_5fbubble_5fsort_31',['recursive_bubble_sort',['../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf',1,'sorting']]],
-  ['recursive_5fmutex_32',['recursive_mutex',['http://en.cppreference.com/w/cpp/thread/recursive_mutex/recursive_mutex.html',0,'std::recursive_mutex']]],
-  ['recursive_5ftimed_5fmutex_33',['recursive_timed_mutex',['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/recursive_timed_mutex.html',0,'std::recursive_timed_mutex']]],
-  ['ref_34',['ref',['http://en.cppreference.com/w/cpp/utility/functional/ref.html',0,'std']]],
-  ['refer_35',['refer',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602',1,'others::lru_cache::LRUCache']]],
-  ['reference_5fwrapper_36',['reference_wrapper',['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/reference_wrapper.html',0,'std::reference_wrapper']]],
-  ['regex_37',['regex',['http://en.cppreference.com/w/cpp/regex/basic_regex/basic_regex.html',0,'std::regex']]],
-  ['regex_5ferror_38',['regex_error',['http://en.cppreference.com/w/cpp/regex/regex_error/regex_error.html',0,'std::regex_error']]],
-  ['regex_5fiterator_39',['regex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::regex_iterator']]],
-  ['regex_5fmatch_40',['regex_match',['http://en.cppreference.com/w/cpp/regex/regex_match.html',0,'std']]],
-  ['regex_5freplace_41',['regex_replace',['http://en.cppreference.com/w/cpp/regex/regex_replace.html',0,'std']]],
-  ['regex_5fsearch_42',['regex_search',['http://en.cppreference.com/w/cpp/regex/regex_search.html',0,'std']]],
-  ['regex_5ftoken_5fiterator_43',['regex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::regex_token_iterator']]],
-  ['regex_5ftraits_44',['regex_traits',['http://en.cppreference.com/w/cpp/regex/regex_traits/regex_traits.html',0,'std::regex_traits']]],
-  ['register_5fcallback_45',['register_callback',['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::fstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ios::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_fstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::iostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ios_base::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wistream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::stringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wifstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_istream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::strstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_stringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istrstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wiostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_istringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ifstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostrstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wfstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_iostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wstringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wistringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ifstream::register_callback()']]],
-  ['regula_5ffalsi_46',['regula_falsi',['../dd/d29/false__position_8cpp.html#a7d69b49dc37da1c02b3ab8c7fe783494',1,'numerical_methods::false_position']]],
-  ['rehash_47',['rehash',['http://en.cppreference.com/w/cpp/container/unordered_map/rehash.html',0,'std::unordered_map::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/rehash.html',0,'std::unordered_multimap::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/rehash.html',0,'std::unordered_multiset::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_set/rehash.html',0,'std::unordered_set::rehash()'],['../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d',1,'double_hashing::rehash()'],['../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0',1,'linear_probing::rehash()'],['../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486',1,'quadratic_probing::rehash()']]],
-  ['release_48',['release',['http://en.cppreference.com/w/cpp/thread/unique_lock/release.html',0,'std::unique_lock::release()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/release.html',0,'std::unique_ptr::release()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/release.html',0,'std::shared_lock::release()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/release.html',0,'std::auto_ptr::release()']]],
-  ['relu_49',['relu',['../d2/d58/neural__network_8cpp.html#af8f264600754602b6a9ea19cc690e50e',1,'machine_learning::neural_network::activations']]],
-  ['remainder_50',['remainder',['http://en.cppreference.com/w/cpp/numeric/math/remainder.html',0,'std']]],
-  ['removalinfo_51',['removalInfo',['../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824',1,'double_hashing::removalInfo()'],['../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0',1,'linear_probing::removalInfo()'],['../d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30',1,'quadratic_probing::removalInfo()']]],
-  ['remove_52',['Remove',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11',1,'data_structures::tree_234::Tree234']]],
-  ['remove_53',['remove',['http://en.cppreference.com/w/cpp/container/forward_list/remove.html',0,'std::forward_list::remove()'],['http://en.cppreference.com/w/cpp/container/list/remove.html',0,'std::list::remove()'],['../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153',1,'binary_search_tree::remove(std::unique_ptr&lt; bst_node &gt; &amp;parent, std::unique_ptr&lt; bst_node &gt; &amp;node, T rm_value)'],['../d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb',1,'binary_search_tree::remove(T rm_value)'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6',1,'data_structures::list_array::list::remove()'],['http://en.cppreference.com/w/cpp/algorithm/remove.html',0,'std::remove()'],['../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931',1,'double_hashing::remove()'],['../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28',1,'linear_probing::remove()'],['../d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a',1,'quadratic_probing::remove()']]],
-  ['remove_5fcopy_54',['remove_copy',['http://en.cppreference.com/w/cpp/algorithm/remove_copy.html',0,'std']]],
-  ['remove_5fcopy_5fif_55',['remove_copy_if',['http://en.cppreference.com/w/cpp/algorithm/remove_copy.html',0,'std']]],
-  ['remove_5fif_56',['remove_if',['http://en.cppreference.com/w/cpp/container/forward_list/remove.html',0,'std::forward_list::remove_if()'],['http://en.cppreference.com/w/cpp/container/list/remove.html',0,'std::list::remove_if()'],['http://en.cppreference.com/w/cpp/algorithm/remove.html',0,'std::remove_if()']]],
-  ['removeitembyindex_57',['RemoveItemByIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a28944bb16ec22650b47fe3e80e3e13f8',1,'data_structures::tree_234::Node']]],
-  ['removepremerge_58',['RemovePreMerge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4',1,'data_structures::tree_234::Tree234']]],
-  ['removewordhelper_59',['removeWordHelper',['../dd/d2f/class_trie.html#a26941759ecf94d67a27d4a610bc0f63d',1,'Trie']]],
-  ['remquo_60',['remquo',['http://en.cppreference.com/w/cpp/numeric/math/remquo.html',0,'std']]],
-  ['rename_61',['rename',['http://en.cppreference.com/w/cpp/io/c/rename.html',0,'std']]],
-  ['rend_62',['rend',['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::rend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::rend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::rend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::rend()'],['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::rend()'],['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::rend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::rend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::rend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::rend()']]],
-  ['replace_63',['replace',['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::basic_string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::wstring::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::u16string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::u32string::replace()'],['http://en.cppreference.com/w/cpp/algorithm/replace.html',0,'std::replace(T... args)']]],
-  ['replace_5fcopy_64',['replace_copy',['http://en.cppreference.com/w/cpp/algorithm/replace_copy.html',0,'std']]],
-  ['replace_5fcopy_5fif_65',['replace_copy_if',['http://en.cppreference.com/w/cpp/algorithm/replace_copy.html',0,'std']]],
-  ['replace_5fif_66',['replace_if',['http://en.cppreference.com/w/cpp/algorithm/replace.html',0,'std']]],
-  ['reserve_67',['reserve',['http://en.cppreference.com/w/cpp/container/vector/reserve.html',0,'std::vector::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::string::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_map/reserve.html',0,'std::unordered_map::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/reserve.html',0,'std::unordered_multimap::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::basic_string::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::wstring::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/reserve.html',0,'std::unordered_multiset::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::u16string::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::u32string::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_set/reserve.html',0,'std::unordered_set::reserve()']]],
-  ['reset_68',['reset',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/reset.html',0,'std::student_t_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/reset.html',0,'std::extreme_value_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/reset.html',0,'std::lognormal_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/reset.html',0,'std::weak_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/reset.html',0,'std::discrete_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/reset.html',0,'std::piecewise_constant_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/reset.html',0,'std::poisson_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/reset.html',0,'std::bernoulli_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/reset.html',0,'std::shared_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/reset.html',0,'std::exponential_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/reset.html',0,'std::uniform_real_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/reset.html',0,'std::geometric_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/reset.html',0,'std::normal_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/reset.html',0,'std::unique_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/reset.html',0,'std::weibull_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/reset.html',0,'std::negative_binomial_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/reset.html',0,'std::chi_squared_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/reset.html',0,'std::piecewise_linear_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/reset.html',0,'std::uniform_int_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/reset.html',0,'std::fisher_f_distribution::reset()'],['http://en.cppreference.com/w/cpp/utility/bitset/reset.html',0,'std::bitset::reset()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/reset.html',0,'std::auto_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/reset.html',0,'std::gamma_distribution::reset()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/reset.html',0,'std::packaged_task::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/reset.html',0,'std::binomial_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/reset.html',0,'std::cauchy_distribution::reset()']]],
-  ['reset_5fdata_69',['reset_data',['../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b',1,'games::memory_game']]],
-  ['resetiosflags_70',['resetiosflags',['http://en.cppreference.com/w/cpp/io/manip/resetiosflags.html',0,'std']]],
-  ['resize_71',['resize',['http://en.cppreference.com/w/cpp/container/vector/resize.html',0,'std::vector::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::string::resize()'],['http://en.cppreference.com/w/cpp/container/forward_list/resize.html',0,'std::forward_list::resize()'],['http://en.cppreference.com/w/cpp/container/deque/resize.html',0,'std::deque::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::basic_string::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::wstring::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::u16string::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::u32string::resize()'],['http://en.cppreference.com/w/cpp/container/list/resize.html',0,'std::list::resize()']]],
-  ['result_72',['result',['../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa',1,'math::fibonacci_sum']]],
-  ['rethrow_5fexception_73',['rethrow_exception',['http://en.cppreference.com/w/cpp/error/rethrow_exception.html',0,'std']]],
-  ['rethrow_5fif_5fnested_74',['rethrow_if_nested',['http://en.cppreference.com/w/cpp/error/rethrow_if_nested.html',0,'std']]],
-  ['rethrow_5fnested_75',['rethrow_nested',['http://en.cppreference.com/w/cpp/error/nested_exception/rethrow_nested.html',0,'std::nested_exception']]],
-  ['return_5ftemporary_5fbuffer_76',['return_temporary_buffer',['http://en.cppreference.com/w/cpp/memory/return_temporary_buffer.html',0,'std']]],
-  ['reverse_77',['reverse',['http://en.cppreference.com/w/cpp/container/forward_list/reverse.html',0,'std::forward_list::reverse()'],['http://en.cppreference.com/w/cpp/container/list/reverse.html',0,'std::list::reverse()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse()'],['http://en.cppreference.com/w/cpp/algorithm/reverse.html',0,'std::reverse()'],['../d3/d92/pancake__sort_8cpp.html#a99e27ad84ad43df9977776b1a8d5416e',1,'sorting::pancake_sort::reverse()']]],
-  ['reverse_5fbinary_78',['reverse_binary',['../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb',1,'miller_rabin.cpp']]],
-  ['reverse_5fcopy_79',['reverse_copy',['http://en.cppreference.com/w/cpp/algorithm/reverse_copy.html',0,'std']]],
-  ['reverse_5fstr_80',['reverse_str',['../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541',1,'longest_common_string.cpp']]],
-  ['reversebinarytree_81',['reverseBinaryTree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree']]],
-  ['reverselist_82',['reverseList',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e',1,'data_structures::linked_list::list']]],
-  ['rewind_83',['rewind',['http://en.cppreference.com/w/cpp/io/c/rewind.html',0,'std']]],
-  ['rfind_84',['rfind',['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::basic_string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::wstring::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::u16string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::u32string::rfind()']]],
-  ['right_85',['right',['../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e',1,'MinHeap::right()'],['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std::right()']]],
-  ['right_5frotate_86',['right_rotate',['../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c',1,'hashing::sha256']]],
-  ['rightrotate_87',['RightRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9',1,'data_structures::tree_234::Tree234']]],
-  ['rightrotate_88',['rightRotate',['../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c',1,'avltree.cpp']]],
-  ['rint_89',['rint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]],
-  ['rootedtree_90',['RootedTree',['../d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d',1,'graph::RootedTree']]],
-  ['rotate_91',['rotate',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29',1,'data_structures::treap::Treap::rotate()'],['http://en.cppreference.com/w/cpp/algorithm/rotate.html',0,'std::rotate(T... args)']]],
-  ['rotate_5fcopy_92',['rotate_copy',['http://en.cppreference.com/w/cpp/algorithm/rotate_copy.html',0,'std']]],
-  ['round_93',['round',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]],
-  ['round_5ferror_94',['round_error',['http://en.cppreference.com/w/cpp/types/numeric_limits/round_error.html',0,'std::numeric_limits']]],
-  ['run_5ftests_95',['run_tests',['../d3/db3/lru__cache_8cpp.html#a6a3be6d8871b1f5dc03688da8f3ee9e6',1,'lru_tests']]],
-  ['rungekutta_96',['rungeKutta',['../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856',1,'numerical_methods::runge_kutta']]],
-  ['runtests_97',['runTests',['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()'],['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()'],['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()']]],
-  ['runtime_5ferror_98',['runtime_error',['http://en.cppreference.com/w/cpp/error/runtime_error.html',0,'std::runtime_error']]]
+  ['rand_5frange_2',['rand_range',['../d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9',1,'ciphers::HillCipher::rand_range(T1 a, T1 b)'],['../d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395',1,'ciphers::HillCipher::rand_range(matrix&lt; T2 &gt; *M, T1 a, T1 b)']]],
+  ['random_5ftests_3',['random_tests',['../de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f',1,'fibonacci_search.cpp']]],
+  ['randomized_5fbogosort_4',['randomized_bogosort',['../d5/d91/namespacesorting.html#affc6ee160142cd017f8c4b213437d0fd',1,'sorting']]],
+  ['randomlevel_5',['randomLevel',['../d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4',1,'data_structures::SkipList']]],
+  ['range_5fcomb_6',['range_comb',['../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52',1,'data_structures::SegmentTree::range_comb(int i, int l, int r, int tl, int tr)'],['../dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b',1,'data_structures::SegmentTree::range_comb(int l, int r)']]],
+  ['range_5ftries_7',['range_tries',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a4620163a196709484225774d87de6d69',1,'probability::geometric_dist::geometric_distribution']]],
+  ['real_8',['real',['../da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6',1,'Complex']]],
+  ['rec_5fternary_5fsearch_9',['rec_ternary_search',['../dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead',1,'ternary_search.cpp']]],
+  ['recalculate_5fhash_10',['recalculate_hash',['../d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893',1,'string_search']]],
+  ['rect_5farea_11',['rect_area',['../dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca',1,'math']]],
+  ['rect_5fperimeter_12',['rect_perimeter',['../dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6',1,'math']]],
+  ['rect_5fprism_5fvolume_13',['rect_prism_volume',['../dd/d47/namespacemath.html#a3fdc74c24697ec5bb5c3698c96117c12',1,'math']]],
+  ['recursive_5fbubble_5fsort_14',['recursive_bubble_sort',['../d5/d91/namespacesorting.html#ae3a775d99dbbb94c130a973df0cfddcf',1,'sorting']]],
+  ['refer_15',['refer',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a7dbf04bf7e1472c48639694f0b110602',1,'others::lru_cache::LRUCache']]],
+  ['regula_5ffalsi_16',['regula_falsi',['../dd/d29/false__position_8cpp.html#a7d69b49dc37da1c02b3ab8c7fe783494',1,'numerical_methods::false_position']]],
+  ['rehash_17',['rehash',['../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d',1,'double_hashing::rehash()'],['../d8/d89/namespacelinear__probing.html#a6a082dc1426a79f866cee6b370df37b0',1,'linear_probing::rehash()'],['../d4/dd2/namespacequadratic__probing.html#ada6f1f44f7e83b0094fbcbe170788486',1,'quadratic_probing::rehash()']]],
+  ['relu_18',['relu',['../d2/d58/neural__network_8cpp.html#af8f264600754602b6a9ea19cc690e50e',1,'machine_learning::neural_network::activations']]],
+  ['removalinfo_19',['removalInfo',['../d0/d65/namespacedouble__hashing.html#a5d06e4598569526294f10104875f6824',1,'double_hashing::removalInfo()'],['../d8/d89/namespacelinear__probing.html#a75854f5aa216e61219154c62167ce8f0',1,'linear_probing::removalInfo()'],['../d4/dd2/namespacequadratic__probing.html#a69fe1f7c36fe004ba83eef2ca82e7e30',1,'quadratic_probing::removalInfo()']]],
+  ['remove_20',['Remove',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11',1,'data_structures::tree_234::Tree234']]],
+  ['remove_21',['remove',['../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153',1,'binary_search_tree::remove(std::unique_ptr&lt; bst_node &gt; &amp;parent, std::unique_ptr&lt; bst_node &gt; &amp;node, T rm_value)'],['../d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb',1,'binary_search_tree::remove(T rm_value)'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a98f7d9079c0868e0f4e67d5c52174fb6',1,'data_structures::list_array::list::remove()'],['../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931',1,'double_hashing::remove()'],['../d8/d89/namespacelinear__probing.html#abcf8d033f8115f39f3c93cfb6cee0b28',1,'linear_probing::remove()'],['../d4/dd2/namespacequadratic__probing.html#a07a0467b24102260fbb6b554c453c20a',1,'quadratic_probing::remove()']]],
+  ['removeitembyindex_22',['RemoveItemByIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a28944bb16ec22650b47fe3e80e3e13f8',1,'data_structures::tree_234::Node']]],
+  ['removepremerge_23',['RemovePreMerge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a61dd051a74e5f36c8dc03dae8dca6ef4',1,'data_structures::tree_234::Tree234']]],
+  ['removewordhelper_24',['removeWordHelper',['../dd/d2f/class_trie.html#a26941759ecf94d67a27d4a610bc0f63d',1,'Trie']]],
+  ['reset_5fdata_25',['reset_data',['../d8/d41/namespacegames_1_1memory__game.html#adc62ebb75853446656e24932bdc6dd6b',1,'games::memory_game']]],
+  ['result_26',['result',['../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa',1,'math::fibonacci_sum']]],
+  ['reverse_27',['reverse',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse()'],['../d3/d92/pancake__sort_8cpp.html#a99e27ad84ad43df9977776b1a8d5416e',1,'sorting::pancake_sort::reverse()']]],
+  ['reverse_5fbinary_28',['reverse_binary',['../d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb',1,'miller_rabin.cpp']]],
+  ['reverse_5fstr_29',['reverse_str',['../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541',1,'longest_common_string.cpp']]],
+  ['reversebinarytree_30',['reverseBinaryTree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree']]],
+  ['reverselist_31',['reverseList',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac466ec086c0835822467bd3d8f3ab90e',1,'data_structures::linked_list::list']]],
+  ['right_32',['right',['../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e',1,'MinHeap']]],
+  ['right_5frotate_33',['right_rotate',['../d4/d08/sha256_8cpp.html#adbcd504103c342a4da718f8fce6ff06c',1,'hashing::sha256']]],
+  ['rightrotate_34',['RightRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae68f8e62be02657c1287def6b38d7cc9',1,'data_structures::tree_234::Tree234']]],
+  ['rightrotate_35',['rightRotate',['../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c',1,'avltree.cpp']]],
+  ['rootedtree_36',['RootedTree',['../d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d',1,'graph::RootedTree']]],
+  ['rotate_37',['rotate',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a75a48584a6560de20484fbba6229fd29',1,'data_structures::treap::Treap']]],
+  ['run_5ftests_38',['run_tests',['../d3/db3/lru__cache_8cpp.html#a6a3be6d8871b1f5dc03688da8f3ee9e6',1,'lru_tests']]],
+  ['rungekutta_39',['rungeKutta',['../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856',1,'numerical_methods::runge_kutta']]],
+  ['runtests_40',['runTests',['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()'],['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()'],['../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23',1,'TestCases::runTests()']]]
 ];
diff --git a/search/functions_13.js b/search/functions_13.js
index 9702a28f1..732432ef3 100644
--- a/search/functions_13.js
+++ b/search/functions_13.js
@@ -1,235 +1,90 @@
 var searchData=
 [
-  ['s_0',['s',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/params.html',0,'std::lognormal_distribution']]],
-  ['saddleback_1',['saddleback',['../d3/d22/saddleback__search_8cpp.html#ad1e0ca34797d88490747c08eca70a2e6',1,'search::saddleback']]],
-  ['safe_5fsubstr_2',['safe_substr',['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aad9e3edfe156b59fc06a5585403fe0d6',1,'divide_and_conquer::karatsuba_algorithm']]],
-  ['sample_5ftest_3',['sample_test',['../de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6',1,'geometric_dist.cpp']]],
-  ['save_5f2d_5fdata_4',['save_2d_data',['../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c',1,'kohonen_som_topology.cpp']]],
-  ['save_5fexact_5fsolution_5',['save_exact_solution',['../db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0):&#160;ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0):&#160;ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0):&#160;ode_semi_implicit_euler.cpp']]],
-  ['save_5fmodel_6',['save_model',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4f14e473bb0722c6490b9dc8da5982aa',1,'machine_learning::neural_network::NeuralNetwork']]],
-  ['save_5fnd_5fdata_7',['save_nd_data',['../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67',1,'kohonen_som_trace.cpp']]],
-  ['save_5fu_5fmatrix_8',['save_u_matrix',['../d8/d77/namespacemachine__learning.html#aa72a53c88203fde278f1fe6c3afe5b07',1,'machine_learning']]],
-  ['sbumpc_9',['sbumpc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_filebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wstringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::stringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wfilebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wstreambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::strstreambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_stringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_streambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::filebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::streambuf::sbumpc()']]],
-  ['scalbln_10',['scalbln',['http://en.cppreference.com/w/cpp/numeric/math/scalbn.html',0,'std']]],
-  ['scalbn_11',['scalbn',['http://en.cppreference.com/w/cpp/numeric/math/scalbn.html',0,'std']]],
-  ['scan_5fis_12',['scan_is',['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype_byname::scan_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype::scan_is()']]],
-  ['scanf_13',['scanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]],
-  ['scheduleforfcfs_14',['scheduleForFcfs',['../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91',1,'FCFS']]],
-  ['scientific_15',['scientific',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]],
-  ['scoped_5fallocator_5fadaptor_16',['scoped_allocator_adaptor',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/scoped_allocator_adaptor.html',0,'std::scoped_allocator_adaptor']]],
-  ['scs_17',['scs',['../d7/d65/shortest__common__supersequence_8cpp.html#ad2ee8d7e67da9f6eb85146b08dad95e6',1,'dynamic_programming::shortest_common_supersequence']]],
-  ['search_18',['search',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ad3423f7518671351340932db3c24959a',1,'data_structures::linked_list::list::search()'],['../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206',1,'Trie::search()'],['../d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63',1,'data_structures::trie::search(const std::shared_ptr&lt; trie &gt; &amp;root, const std::string &amp;str, int index)'],['../d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d',1,'data_structures::trie::search(const std::string &amp;str, int index)'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f',1,'data_structures::trie_using_hashmap::Trie::search()'],['http://en.cppreference.com/w/cpp/algorithm/search.html',0,'std::search()'],['../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738',1,'strings::boyer_moore::search()']]],
-  ['search_5fn_19',['search_n',['http://en.cppreference.com/w/cpp/algorithm/search_n.html',0,'std']]],
-  ['searchelement_20',['searchElement',['../d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4',1,'data_structures::SkipList']]],
-  ['searchfreqsuggestions_21',['SearchFreqSuggestions',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503',1,'operations_on_datastructures::trie_operations::Tnode']]],
-  ['searchingprober_22',['searchingProber',['../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6',1,'double_hashing::searchingProber()'],['../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77',1,'linear_probing::searchingProber()'],['../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6',1,'quadratic_probing::searchingProber()']]],
-  ['searchpresence_23',['SearchPresence',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a4a624fcdf3c3beb2025d69f2cfda8023',1,'operations_on_datastructures::trie_operations::Tnode']]],
-  ['searchsuggestions_24',['SearchSuggestions',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a18b70172ca4fb2811dbfb9a86e48b34c',1,'operations_on_datastructures::trie_operations::Tnode']]],
-  ['seconds_25',['seconds',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::seconds']]],
-  ['seed_26',['seed',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937_64::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux24_base::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux48::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::discard_block_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mersenne_twister_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/seed.html',0,'std::independent_bits_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux48_base::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::shuffle_order_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux24::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::linear_congruential_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::knuth_b::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand0::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::subtract_with_carry_engine::seed()']]],
-  ['seed_5fseq_27',['seed_seq',['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/seed_seq.html',0,'std::seed_seq']]],
-  ['seekg_28',['seekg',['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::fstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_fstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::iostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wistream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::stringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wifstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_istream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::strstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_stringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istrstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wiostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_istringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_ifstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wfstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_iostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wstringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wistringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::ifstream::seekg()']]],
-  ['seekoff_29',['seekoff',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_filebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::stringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wfilebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstreambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::strstreambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_stringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_streambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::filebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::streambuf::seekoff()']]],
-  ['seekp_30',['seekp',['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::fstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_fstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::iostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::stringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::strstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_stringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wiostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostrstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wfstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_iostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wstringstream::seekp()']]],
-  ['seekpos_31',['seekpos',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_filebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::stringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wfilebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstreambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::strstreambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_stringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_streambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::filebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::streambuf::seekpos()']]],
-  ['select_5fon_5fcontainer_5fcopy_5fconstruction_32',['select_on_container_copy_construction',['http://en.cppreference.com/w/cpp/memory/allocator_traits/select_on_container_copy_construction.html',0,'std::allocator_traits::select_on_container_copy_construction()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/select_on_container_copy_construction.html',0,'std::scoped_allocator_adaptor::select_on_container_copy_construction()']]],
-  ['selectionsortrecursive_33',['selectionSortRecursive',['../d4/d9f/selection__sort__recursive_8cpp.html#ab6f7b33a070e376e1f4374e534435e89',1,'sorting::selection_sort_recursive']]],
-  ['selectiontop_5f3_34',['SelectionTop_3',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6',1,'operations_on_datastructures::trie_operations::Tnode']]],
-  ['semi_5fimplicit_5feuler_35',['semi_implicit_euler',['../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089',1,'ode_semi_implicit_euler.cpp']]],
-  ['semi_5fimplicit_5feuler_5fstep_36',['semi_implicit_euler_step',['../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f',1,'ode_semi_implicit_euler.cpp']]],
-  ['sentry_37',['sentry',['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::fstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_fstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::iostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::stringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::strstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_stringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wiostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wfstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_iostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wstringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry::sentry()']]],
-  ['set_38',['set',['http://en.cppreference.com/w/cpp/container/set/set.html',0,'std::set::set()'],['http://en.cppreference.com/w/cpp/utility/bitset/set.html',0,'std::bitset::set()']]],
-  ['set_5fdifference_39',['set_difference',['http://en.cppreference.com/w/cpp/algorithm/set_difference.html',0,'std']]],
-  ['set_5fexception_40',['set_exception',['http://en.cppreference.com/w/cpp/thread/promise/set_exception.html',0,'std::promise']]],
-  ['set_5fexception_5fat_5fthread_5fexit_41',['set_exception_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/promise/set_exception_at_thread_exit.html',0,'std::promise']]],
-  ['set_5fintersection_42',['set_intersection',['http://en.cppreference.com/w/cpp/algorithm/set_intersection.html',0,'std']]],
-  ['set_5fnew_5fhandler_43',['set_new_handler',['http://en.cppreference.com/w/cpp/memory/new/set_new_handler.html',0,'std']]],
-  ['set_5fnode_5fval_44',['set_node_val',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70',1,'range_queries::heavy_light_decomposition::Tree']]],
-  ['set_5frdbuf_45',['set_rdbuf',['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::fstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ios::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_fstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::iostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wistream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::stringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wifstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_istream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::strstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_stringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istrstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wiostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_istringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ifstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostrstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wfstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_iostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wstringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wistringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ifstream::set_rdbuf()']]],
-  ['set_5fsret_5finit_46',['set_sret_init',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ad3b942be27a1b0fe3cff6cb6edf01294',1,'range_queries::heavy_light_decomposition::SG']]],
-  ['set_5fsymmetric_5fdifference_47',['set_symmetric_difference',['http://en.cppreference.com/w/cpp/algorithm/set_symmetric_difference.html',0,'std']]],
-  ['set_5fterminate_48',['set_terminate',['http://en.cppreference.com/w/cpp/error/set_terminate.html',0,'std']]],
-  ['set_5funexpected_49',['set_unexpected',['http://en.cppreference.com/w/cpp/error/set_unexpected.html',0,'std']]],
-  ['set_5funion_50',['set_union',['http://en.cppreference.com/w/cpp/algorithm/set_union.html',0,'std']]],
-  ['set_5fvalue_51',['set_value',['http://en.cppreference.com/w/cpp/thread/promise/set_value.html',0,'std::promise']]],
-  ['set_5fvalue_5fat_5fthread_5fexit_52',['set_value_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/promise/set_value_at_thread_exit.html',0,'std::promise']]],
-  ['setbase_53',['setbase',['http://en.cppreference.com/w/cpp/io/manip/setbase.html',0,'std']]],
-  ['setbuf_54',['setbuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_filebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::stringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wfilebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstreambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::strstreambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_stringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_streambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::filebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::streambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/c/setbuf.html',0,'std::setbuf()']]],
-  ['setchild_55',['SetChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74',1,'data_structures::tree_234::Node']]],
-  ['setcount_56',['SetCount',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1',1,'data_structures::tree_234::Node']]],
-  ['setf_57',['setf',['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::fstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ios::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_fstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::iostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ios_base::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wistream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::stringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wifstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_istream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::strstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_stringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istrstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wiostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_istringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ifstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostrstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wfstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_iostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wstringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wistringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ifstream::setf()']]],
-  ['setfill_58',['setfill',['http://en.cppreference.com/w/cpp/io/manip/setfill.html',0,'std']]],
-  ['setg_59',['setg',['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_filebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wstringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::stringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wfilebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wstreambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::strstreambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_stringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_streambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::filebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::streambuf::setg()']]],
-  ['setiosflags_60',['setiosflags',['http://en.cppreference.com/w/cpp/io/manip/setiosflags.html',0,'std']]],
-  ['setitem_61',['SetItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc',1,'data_structures::tree_234::Node']]],
-  ['setkthbit_62',['setKthBit',['../d5/db5/set__kth__bit_8cpp.html#ad4d0ffd9331242c42a28834ee19f5fd9',1,'bit_manipulation::set_kth_bit']]],
-  ['setlocale_63',['setlocale',['http://en.cppreference.com/w/cpp/locale/setlocale.html',0,'std']]],
-  ['setp_64',['setp',['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_filebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wstringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::stringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wfilebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wstreambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::strstreambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_stringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_streambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::filebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::streambuf::setp()']]],
-  ['setprecision_65',['setprecision',['http://en.cppreference.com/w/cpp/io/manip/setprecision.html',0,'std']]],
-  ['setstate_66',['setstate',['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::fstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ios::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_fstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::iostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wistream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::stringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wifstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_istream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::strstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_stringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istrstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wiostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_istringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ifstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostrstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wfstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_iostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wstringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wistringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ifstream::setstate()']]],
-  ['setvbuf_67',['setvbuf',['http://en.cppreference.com/w/cpp/io/c/setvbuf.html',0,'std']]],
-  ['setw_68',['setw',['http://en.cppreference.com/w/cpp/io/manip/setw.html',0,'std']]],
-  ['sg_69',['SG',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1',1,'range_queries::heavy_light_decomposition::SG']]],
-  ['sgetc_70',['sgetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_filebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wstringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::stringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wfilebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wstreambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::strstreambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_stringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_streambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::filebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::streambuf::sgetc()']]],
-  ['sgetn_71',['sgetn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_filebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::stringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wfilebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstreambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::strstreambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_stringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_streambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::filebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::streambuf::sgetn()']]],
-  ['sgn_72',['sgn',['../d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2',1,'bisection_method.cpp']]],
-  ['sha256_73',['sha256',['../d4/d08/sha256_8cpp.html#a55475649a2bb7aae15de0716a217f43a',1,'hashing::sha256']]],
-  ['share_74',['share',['http://en.cppreference.com/w/cpp/thread/future/share.html',0,'std::future']]],
-  ['shared_5ffrom_5fthis_75',['shared_from_this',['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/shared_from_this.html',0,'std::enable_shared_from_this']]],
-  ['shared_5ffuture_76',['shared_future',['http://en.cppreference.com/w/cpp/thread/shared_future/shared_future.html',0,'std::shared_future']]],
-  ['shared_5flock_77',['shared_lock',['http://en.cppreference.com/w/cpp/thread/shared_lock/shared_lock.html',0,'std::shared_lock']]],
-  ['shared_5fptr_78',['shared_ptr',['http://en.cppreference.com/w/cpp/memory/shared_ptr/shared_ptr.html',0,'std::shared_ptr']]],
-  ['shared_5ftimed_5fmutex_79',['shared_timed_mutex',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/shared_timed_mutex.html',0,'std::shared_timed_mutex']]],
-  ['shell_5fsort_80',['shell_sort',['../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa',1,'sorting::shell_sort(T *arr, size_t LEN)'],['../d5/d91/namespacesorting.html#a4d76603c54d3dc56146e92d10a043924',1,'sorting::shell_sort(T(&amp;arr)[N])'],['../d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331',1,'sorting::shell_sort(std::vector&lt; T &gt; *arr)']]],
-  ['shift_5fleft_81',['shift_left',['../da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8',1,'operations_on_datastructures']]],
-  ['shift_5fright_82',['shift_right',['../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86',1,'operations_on_datastructures']]],
-  ['shortest_5fpath_5fdistance_83',['Shortest_Path_Distance',['../d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6',1,'graph::bidirectional_dijkstra']]],
-  ['show_84',['show',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e',1,'data_structures::list_array::list::show()'],['../d2/dc8/classdata__structures_1_1_stack.html#abb86ed67d9d97112897a09cfb10ff586',1,'data_structures::Stack::show()'],['../db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed',1,'show():&#160;tower_of_hanoi.cpp'],['../d2/d26/count__inversions_8cpp.html#a851ca6a0391d14fb49a97d55e4377497',1,'sorting::inversion::show()'],['../d5/d4c/group__sorting.html#ga0a9a57a1f1bbba3d4822531d002b7e07',1,'show():&#160;merge_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#aeccefcf6fcca62c54939c5ec9a93109b',1,'sorting::quick_sort::show()']]],
-  ['show_5farray_85',['show_array',['../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859',1,'bogo_sort.cpp']]],
-  ['show_5fdata_86',['show_data',['../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246',1,'show_data(T *arr, size_t LEN):&#160;shell_sort2.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a63aaff7cabfa3da2da8b9477b5fad9d6',1,'show_data(T(&amp;arr)[N]):&#160;shell_sort2.cpp']]],
-  ['show_5fpascal_87',['show_pascal',['../dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c',1,'pascal_triangle.cpp']]],
-  ['showarray_88',['showArray',['../d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10',1,'sorting::random_pivot_quick_sort']]],
-  ['showbase_89',['showbase',['http://en.cppreference.com/w/cpp/io/manip/showbase.html',0,'std']]],
-  ['showmanyc_90',['showmanyc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_filebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wstringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::stringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wfilebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wstreambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::strstreambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_stringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_streambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::filebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::streambuf::showmanyc()']]],
-  ['showpoint_91',['showpoint',['http://en.cppreference.com/w/cpp/io/manip/showpoint.html',0,'std']]],
-  ['showpos_92',['showpos',['http://en.cppreference.com/w/cpp/io/manip/showpos.html',0,'std']]],
-  ['shrink_5fto_5ffit_93',['shrink_to_fit',['http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html',0,'std::vector::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/container/deque/shrink_to_fit.html',0,'std::deque::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::basic_string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::wstring::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u16string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u32string::shrink_to_fit()']]],
-  ['shuffle_94',['shuffle',['http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html',0,'std::shuffle()'],['../d5/d91/namespacesorting.html#a7bfe11bd4703eacd1dab93f25ec639c5',1,'sorting::shuffle()']]],
-  ['shuffle_5forder_5fengine_95',['shuffle_order_engine',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::shuffle_order_engine']]],
-  ['sieve_96',['Sieve',['../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c',1,'primes_up_to_billion.cpp']]],
-  ['sieve_97',['sieve',['../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f',1,'math::sieve()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a22be949d160b26361f7e323310f7fa0c',1,'math::sieve_of_eratosthenes::sieve()']]],
-  ['sieveoferatosthenes_98',['SieveOfEratosthenes',['../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099',1,'prime_factorization.cpp']]],
-  ['sig2hex_99',['sig2hex',['../d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348',1,'hashing::md5::sig2hex()'],['../d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228',1,'hashing::sha1::sig2hex()']]],
-  ['sigmoid_100',['sigmoid',['../d2/d58/neural__network_8cpp.html#a23aa9d32bcbcd65cfc85f0a41e2afadc',1,'machine_learning::neural_network::activations']]],
-  ['signal_101',['signal',['http://en.cppreference.com/w/cpp/utility/program/signal.html',0,'std']]],
-  ['signaling_5fnan_102',['signaling_NaN',['http://en.cppreference.com/w/cpp/types/numeric_limits/signaling_NaN.html',0,'std::numeric_limits']]],
-  ['signbit_103',['signbit',['http://en.cppreference.com/w/cpp/numeric/math/signbit.html',0,'std']]],
-  ['sin_104',['sin',['http://en.cppreference.com/w/cpp/numeric/math/sin.html',0,'std']]],
-  ['single_5fpredict_105',['single_predict',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f',1,'machine_learning::neural_network::NeuralNetwork']]],
-  ['sinh_106',['sinh',['http://en.cppreference.com/w/cpp/numeric/math/sinh.html',0,'std']]],
-  ['size_107',['size',['http://en.cppreference.com/w/cpp/container/dynarray/size.html',0,'std::dynarray::size()'],['http://en.cppreference.com/w/cpp/container/vector/size.html',0,'std::vector::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::match_results::size()'],['http://en.cppreference.com/w/cpp/container/multiset/size.html',0,'std::multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::string::size()'],['http://en.cppreference.com/w/cpp/container/set/size.html',0,'std::set::size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/size.html',0,'std::unordered_map::size()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/size.html',0,'std::initializer_list::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wsmatch::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::smatch::size()'],['http://en.cppreference.com/w/cpp/container/stack/size.html',0,'std::stack::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/size.html',0,'std::unordered_multimap::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wcmatch::size()'],['http://en.cppreference.com/w/cpp/container/deque/size.html',0,'std::deque::size()'],['http://en.cppreference.com/w/cpp/container/queue/size.html',0,'std::queue::size()'],['http://en.cppreference.com/w/cpp/utility/bitset/size.html',0,'std::bitset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::basic_string::size()'],['http://en.cppreference.com/w/cpp/container/priority_queue/size.html',0,'std::priority_queue::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::wstring::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/size.html',0,'std::unordered_multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u16string::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u32string::size()'],['http://en.cppreference.com/w/cpp/container/list/size.html',0,'std::list::size()'],['http://en.cppreference.com/w/cpp/container/map/size.html',0,'std::map::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::cmatch::size()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/size.html',0,'std::seed_seq::size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/size.html',0,'std::unordered_set::size()'],['http://en.cppreference.com/w/cpp/container/multimap/size.html',0,'std::multimap::size()'],['http://en.cppreference.com/w/cpp/container/array/size.html',0,'std::array::size()'],['../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3',1,'binary_search_tree::size()'],['../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54',1,'data_structures::Bitset::size()'],['../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c',1,'dsu::size()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39',1,'data_structures::stack_using_queue::Stack::size()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1',1,'divide_and_conquer::strassens_multiplication::Matrix::size()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195',1,'others::Cache::LFUCache::size()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1',1,'others::Cache::LRUCache::size()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865',1,'range_queries::perSegTree::size()']]],
-  ['skiplist_108',['SkipList',['../d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4',1,'data_structures::SkipList']]],
-  ['skipws_109',['skipws',['http://en.cppreference.com/w/cpp/io/manip/skipws.html',0,'std']]],
-  ['sleep_110',['SLEEP',['../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6',1,'memory_game.cpp']]],
-  ['sleep_5ffor_111',['sleep_for',['http://en.cppreference.com/w/cpp/thread/sleep_for.html',0,'std::this_thread']]],
-  ['sleep_5funtil_112',['sleep_until',['http://en.cppreference.com/w/cpp/thread/sleep_until.html',0,'std::this_thread']]],
-  ['slice_113',['slice',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17',1,'divide_and_conquer::strassens_multiplication::Matrix']]],
-  ['smatch_114',['smatch',['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::smatch']]],
-  ['snextc_115',['snextc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_filebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wstringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::stringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wfilebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wstreambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::strstreambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_stringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_streambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::filebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::streambuf::snextc()']]],
-  ['snprintf_116',['snprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]],
-  ['solution_117',['Solution',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4',1,'machine_learning::aystar_search::AyStarSearch']]],
-  ['solve_118',['solve',['../d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9',1,'backtracking::knight_tour']]],
-  ['solvemaze_119',['solveMaze',['../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3',1,'backtracking::rat_maze']]],
-  ['solvenq_120',['solveNQ',['../d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb',1,'backtracking::n_queens']]],
-  ['solvesudoku_121',['solveSudoku',['../d3/d05/sudoku__solver_8cpp.html#ac911c8bca8556206ff64461b2424866b',1,'backtracking::sudoku_solver']]],
-  ['sort_122',['sort',['http://en.cppreference.com/w/cpp/container/forward_list/sort.html',0,'std::forward_list::sort()'],['http://en.cppreference.com/w/cpp/container/list/sort.html',0,'std::list::sort()'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180',1,'data_structures::list_array::list::sort()'],['http://en.cppreference.com/w/cpp/algorithm/sort.html',0,'std::sort(T... args)']]],
-  ['sort_5fheap_123',['sort_heap',['http://en.cppreference.com/w/cpp/algorithm/sort_heap.html',0,'std']]],
-  ['sortcol_124',['sortcol',['../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec',1,'fcfs_scheduling.cpp']]],
-  ['sphere_5fsurface_5farea_125',['sphere_surface_area',['../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656',1,'math']]],
-  ['sphere_5fvolume_126',['sphere_volume',['../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551',1,'math']]],
-  ['spiralprint_127',['spiralPrint',['../db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197',1,'spiral_print.cpp']]],
-  ['spirograph_128',['spirograph',['../da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac',1,'spirograph']]],
-  ['splice_129',['splice',['http://en.cppreference.com/w/cpp/container/list/splice.html',0,'std::list']]],
-  ['splice_5fafter_130',['splice_after',['http://en.cppreference.com/w/cpp/container/forward_list/splice_after.html',0,'std::forward_list']]],
-  ['splitnode_131',['SplitNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9',1,'data_structures::tree_234::Tree234']]],
-  ['sprintf_132',['sprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]],
-  ['sputbackc_133',['sputbackc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_filebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wstringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::stringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wfilebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wstreambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::strstreambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_stringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_streambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::filebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::streambuf::sputbackc()']]],
-  ['sputc_134',['sputc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_filebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wstringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::stringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wfilebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wstreambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::strstreambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_stringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_streambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::filebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::streambuf::sputc()']]],
-  ['sputn_135',['sputn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_filebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::stringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wfilebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstreambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::strstreambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_stringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_streambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::filebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::streambuf::sputn()']]],
-  ['sqrt_136',['Sqrt',['../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc',1,'sqrt_double.cpp']]],
-  ['sqrt_137',['sqrt',['http://en.cppreference.com/w/cpp/numeric/math/sqrt.html',0,'std']]],
-  ['square_138',['square',['../d2/d58/neural__network_8cpp.html#a45d3e30406712ada3d9713ece3c1b153',1,'machine_learning::neural_network::util_functions']]],
-  ['square_5farea_139',['square_area',['../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049',1,'math']]],
-  ['square_5fperimeter_140',['square_perimeter',['../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14',1,'math']]],
-  ['srand_141',['srand',['http://en.cppreference.com/w/cpp/numeric/random/srand.html',0,'std']]],
-  ['sregex_5fiterator_142',['sregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::sregex_iterator']]],
-  ['sregex_5ftoken_5fiterator_143',['sregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::sregex_token_iterator']]],
-  ['sscanf_144',['sscanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]],
-  ['ssub_5fmatch_145',['ssub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::ssub_match']]],
-  ['stable_5fpartition_146',['stable_partition',['http://en.cppreference.com/w/cpp/algorithm/stable_partition.html',0,'std']]],
-  ['stable_5fsort_147',['stable_sort',['http://en.cppreference.com/w/cpp/algorithm/stable_sort.html',0,'std']]],
-  ['stack_148',['Stack',['../d2/dc8/classdata__structures_1_1_stack.html#a8cb0602c8a9c1603d0315938177ecc6a',1,'data_structures::Stack']]],
-  ['stack_149',['stack',['http://en.cppreference.com/w/cpp/container/stack/stack.html',0,'std::stack']]],
-  ['standard_5fdeviation_150',['standard_deviation',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2',1,'probability::geometric_dist::geometric_distribution']]],
-  ['standard_5finvsqrt_151',['Standard_InvSqrt',['../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97',1,'inv_sqrt.cpp']]],
-  ['startwith_152',['startwith',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17',1,'data_structures::trie_using_hashmap::Trie']]],
-  ['state_153',['state',['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/state.html',0,'std::wbuffer_convert::state()'],['http://en.cppreference.com/w/cpp/locale/wstring_convert/state.html',0,'std::wstring_convert::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::wstreampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::u16streampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::streampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::fpos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::u32streampos::state()']]],
-  ['static_5fpointer_5fcast_154',['static_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]],
-  ['std_155',['std',['../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1',1,'statistics::stats_computer1::std()'],['../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e',1,'statistics::stats_computer2::std()']]],
-  ['stddev_156',['stddev',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/params.html',0,'std::normal_distribution']]],
-  ['step_5fith_157',['step_ith',['../d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9',1,'sorting::radix_sort']]],
-  ['stod_158',['stod',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]],
-  ['stof_159',['stof',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]],
-  ['stoi_160',['stoi',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]],
-  ['stol_161',['stol',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]],
-  ['stold_162',['stold',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]],
-  ['stoll_163',['stoll',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]],
-  ['stoogesort_164',['stoogeSort',['../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b',1,'stooge_sort.cpp']]],
-  ['store_165',['store',['http://en.cppreference.com/w/cpp/atomic/atomic/store.html',0,'std::atomic']]],
-  ['stoul_166',['stoul',['http://en.cppreference.com/w/cpp/string/basic_string/stoul.html',0,'std']]],
-  ['stoull_167',['stoull',['http://en.cppreference.com/w/cpp/string/basic_string/stoul.html',0,'std']]],
-  ['str_168',['str',['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::match_results::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::basic_ostringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::wstringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::wsmatch::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wcsub_match::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::ostringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::stringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::smatch::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::stringstream::str()'],['http://en.cppreference.com/w/cpp/io/strstreambuf/str.html',0,'std::strstreambuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::wcmatch::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wssub_match::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::csub_match::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::basic_stringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::ssub_match::str()'],['http://en.cppreference.com/w/cpp/io/strstream/str.html',0,'std::strstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::basic_stringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::wostringstream::str()'],['http://en.cppreference.com/w/cpp/io/istrstream/str.html',0,'std::istrstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::basic_istringstream::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::cmatch::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::istringstream::str()'],['http://en.cppreference.com/w/cpp/io/ostrstream/str.html',0,'std::ostrstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::wstringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::wistringstream::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::sub_match::str()']]],
-  ['strand_5fsort_169',['strand_sort',['../dc/dd9/strand__sort_8cpp.html#a2bea2fe5dd38ed63610fdeaddf5785cd',1,'sorting::strand']]],
-  ['strassens_5fmultiplication_170',['strassens_multiplication',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a',1,'divide_and_conquer::strassens_multiplication::Matrix']]],
-  ['strcat_171',['strcat',['http://en.cppreference.com/w/cpp/string/byte/strcat.html',0,'std']]],
-  ['strchr_172',['strchr',['http://en.cppreference.com/w/cpp/string/byte/strchr.html',0,'std']]],
-  ['strcmp_173',['strcmp',['http://en.cppreference.com/w/cpp/string/byte/strcmp.html',0,'std']]],
-  ['strcoll_174',['strcoll',['http://en.cppreference.com/w/cpp/string/byte/strcoll.html',0,'std']]],
-  ['strcpy_175',['strcpy',['http://en.cppreference.com/w/cpp/string/byte/strcpy.html',0,'std']]],
-  ['strcspn_176',['strcspn',['http://en.cppreference.com/w/cpp/string/byte/strcspn.html',0,'std']]],
-  ['streambuf_177',['streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/basic_streambuf.html',0,'std::streambuf']]],
-  ['strerror_178',['strerror',['http://en.cppreference.com/w/cpp/string/byte/strerror.html',0,'std']]],
-  ['strftime_179',['strftime',['http://en.cppreference.com/w/cpp/chrono/c/strftime.html',0,'std']]],
-  ['string_180',['string',['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::string']]],
-  ['stringbuf_181',['stringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::stringbuf']]],
-  ['stringstream_182',['stringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::stringstream']]],
-  ['strlen_183',['strlen',['http://en.cppreference.com/w/cpp/string/byte/strlen.html',0,'std']]],
-  ['strncat_184',['strncat',['http://en.cppreference.com/w/cpp/string/byte/strncat.html',0,'std']]],
-  ['strncmp_185',['strncmp',['http://en.cppreference.com/w/cpp/string/byte/strncmp.html',0,'std']]],
-  ['strncpy_186',['strncpy',['http://en.cppreference.com/w/cpp/string/byte/strncpy.html',0,'std']]],
-  ['strpbrk_187',['strpbrk',['http://en.cppreference.com/w/cpp/string/byte/strpbrk.html',0,'std']]],
-  ['strrchr_188',['strrchr',['http://en.cppreference.com/w/cpp/string/byte/strrchr.html',0,'std']]],
-  ['strspn_189',['strspn',['http://en.cppreference.com/w/cpp/string/byte/strspn.html',0,'std']]],
-  ['strstr_190',['strstr',['http://en.cppreference.com/w/cpp/string/byte/strstr.html',0,'std']]],
-  ['strstream_191',['strstream',['http://en.cppreference.com/w/cpp/io/strstream/strstream.html',0,'std::strstream']]],
-  ['strstreambuf_192',['strstreambuf',['http://en.cppreference.com/w/cpp/io/strstreambuf/strstreambuf.html',0,'std::strstreambuf']]],
-  ['strtod_193',['strtod',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]],
-  ['strtof_194',['strtof',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]],
-  ['strtoimax_195',['strtoimax',['http://en.cppreference.com/w/cpp/string/byte/strtoimax.html',0,'std']]],
-  ['strtok_196',['strtok',['http://en.cppreference.com/w/cpp/string/byte/strtok.html',0,'std']]],
-  ['strtol_197',['strtol',['http://en.cppreference.com/w/cpp/string/byte/strtol.html',0,'std']]],
-  ['strtold_198',['strtold',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]],
-  ['strtoll_199',['strtoll',['http://en.cppreference.com/w/cpp/string/byte/strtol.html',0,'std']]],
-  ['strtoul_200',['strtoul',['http://en.cppreference.com/w/cpp/string/byte/strtoul.html',0,'std']]],
-  ['strtoull_201',['strtoull',['http://en.cppreference.com/w/cpp/string/byte/strtoul.html',0,'std']]],
-  ['strtoumax_202',['strtoumax',['http://en.cppreference.com/w/cpp/string/byte/strtoimax.html',0,'std']]],
-  ['struzik_5fsearch_203',['struzik_search',['../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208',1,'exponential_search.cpp']]],
-  ['strxfrm_204',['strxfrm',['http://en.cppreference.com/w/cpp/string/byte/strxfrm.html',0,'std']]],
-  ['student_5ft_5fdistribution_205',['student_t_distribution',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/student_t_distribution.html',0,'std::student_t_distribution']]],
-  ['sub_5fmatch_206',['sub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::sub_match']]],
-  ['subarray_5fsum_207',['subarray_sum',['../df/d94/subarray__sum_8cpp.html#af5687bbd9faf927fbd363c71e0baba5e',1,'backtracking::subarray_sum']]],
-  ['sublistsearch_208',['sublistSearch',['../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c',1,'search::sublist_search']]],
-  ['subset_5fsum_5fproblem_209',['subset_sum_problem',['../dc/d67/subset__sum__dynamic_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50',1,'dynamic_programming::subset_sum']]],
-  ['subset_5fsum_5frecursion_210',['subset_sum_recursion',['../dc/d67/subset__sum__dynamic_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607',1,'dynamic_programming::subset_sum']]],
-  ['substr_211',['substr',['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::basic_string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::wstring::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u16string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u32string::substr()']]],
-  ['subtract_5fwith_5fcarry_5fengine_212',['subtract_with_carry_engine',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::subtract_with_carry_engine']]],
-  ['succ_213',['succ',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3',1,'data_structures::linked_list::link']]],
-  ['suffix_214',['suffix',['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::match_results::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wsmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::smatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wcmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::cmatch::suffix()']]],
-  ['suggestautocomplete_215',['SuggestAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe',1,'operations_on_datastructures::trie_operations::Tnode']]],
-  ['suggestfreqautocomplete_216',['SuggestFreqAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c',1,'operations_on_datastructures::trie_operations::Tnode']]],
-  ['sum_217',['sum',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd',1,'range_queries::fenwick_tree::sum()'],['../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35',1,'machine_learning::sum()']]],
-  ['sum_5fof_5fdigits_218',['sum_of_digits',['../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395',1,'sum_of_digits.cpp']]],
-  ['sum_5fof_5fdivisor_219',['sum_of_divisor',['../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a',1,'math']]],
-  ['sum_5frange_220',['sum_range',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe',1,'range_queries::fenwick_tree']]],
-  ['summary_221',['summary',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931',1,'machine_learning::neural_network::NeuralNetwork']]],
-  ['sungetc_222',['sungetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wfilebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::strstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_streambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::streambuf::sungetc()']]],
-  ['swap_223',['swap',['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::fstream::swap()'],['http://en.cppreference.com/w/cpp/container/vector/swap.html',0,'std::vector::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::match_results::swap()'],['http://en.cppreference.com/w/cpp/container/multiset/swap.html',0,'std::multiset::swap()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/swap.html',0,'std::weak_ptr::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostream::swap()'],['http://en.cppreference.com/w/cpp/container/set/swap.html',0,'std::set::swap()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/swap.html',0,'std::unique_lock::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostringstream::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::regex::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_map/swap.html',0,'std::unordered_map::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::basic_regex::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_filebuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstringbuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ios::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wsmatch::swap()'],['http://en.cppreference.com/w/cpp/utility/tuple/swap.html',0,'std::tuple::swap()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/swap.html',0,'std::shared_ptr::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_fstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::stringbuf::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::wregex::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::smatch::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wfilebuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::iostream::swap()'],['http://en.cppreference.com/w/cpp/container/stack/swap.html',0,'std::stack::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstreambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::stringstream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/swap.html',0,'std::unordered_multimap::swap()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/swap.html',0,'std::unique_ptr::swap()'],['http://en.cppreference.com/w/cpp/container/forward_list/swap.html',0,'std::forward_list::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::strstreambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostream::swap()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/swap.html',0,'std::shared_lock::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wcmatch::swap()'],['http://en.cppreference.com/w/cpp/utility/pair/swap.html',0,'std::pair::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wifstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_stringbuf::swap()'],['http://en.cppreference.com/w/cpp/container/deque/swap.html',0,'std::deque::swap()'],['http://en.cppreference.com/w/cpp/thread/promise/swap.html',0,'std::promise::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::strstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_streambuf::swap()'],['http://en.cppreference.com/w/cpp/container/queue/swap.html',0,'std::queue::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_stringstream::swap()'],['http://en.cppreference.com/w/cpp/thread/thread/swap.html',0,'std::thread::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::basic_string::swap()'],['http://en.cppreference.com/w/cpp/container/priority_queue/swap.html',0,'std::priority_queue::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostringstream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::wstring::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istrstream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/swap.html',0,'std::unordered_multiset::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostream::swap()'],['http://en.cppreference.com/w/cpp/utility/functional/function/swap.html',0,'std::function::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::filebuf::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u16string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wiostream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u32string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ifstream::swap()'],['http://en.cppreference.com/w/cpp/container/list/swap.html',0,'std::list::swap()'],['http://en.cppreference.com/w/cpp/container/map/swap.html',0,'std::map::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::cmatch::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::streambuf::swap()'],['http://en.cppreference.com/w/cpp/experimental/optional/swap.html',0,'std::experimental::optional::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostrstream::swap()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/swap.html',0,'std::packaged_task::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_set/swap.html',0,'std::unordered_set::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wfstream::swap()'],['http://en.cppreference.com/w/cpp/container/multimap/swap.html',0,'std::multimap::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_iostream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wstringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ifstream::swap()'],['http://en.cppreference.com/w/cpp/container/array/swap.html',0,'std::array::swap()'],['http://en.cppreference.com/w/cpp/algorithm/swap.html',0,'std::swap(T... args)']]],
-  ['swap_5franges_224',['swap_ranges',['http://en.cppreference.com/w/cpp/algorithm/swap_ranges.html',0,'std']]],
-  ['swprintf_225',['swprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]],
-  ['swscanf_226',['swscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]],
-  ['sync_227',['sync',['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wfilebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::strstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::strstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istrstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wiostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_ifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wfstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wstringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::ifstream::sync()']]],
-  ['sync_5fwith_5fstdio_228',['sync_with_stdio',['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ios::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ios_base::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::strstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wiostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wfstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wstringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ifstream::sync_with_stdio()']]],
-  ['system_229',['system',['http://en.cppreference.com/w/cpp/utility/program/system.html',0,'std']]],
-  ['system_5fcategory_230',['system_category',['http://en.cppreference.com/w/cpp/error/system_category.html',0,'std']]],
-  ['system_5ferror_231',['system_error',['http://en.cppreference.com/w/cpp/error/system_error/system_error.html',0,'std::system_error']]]
+  ['saddleback_0',['saddleback',['../d3/d22/saddleback__search_8cpp.html#ad1e0ca34797d88490747c08eca70a2e6',1,'search::saddleback']]],
+  ['safe_5fsubstr_1',['safe_substr',['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aad9e3edfe156b59fc06a5585403fe0d6',1,'divide_and_conquer::karatsuba_algorithm']]],
+  ['sample_5ftest_2',['sample_test',['../de/d72/geometric__dist_8cpp.html#a70fd1cc5c3a2813f28683dc75dcd65b6',1,'geometric_dist.cpp']]],
+  ['save_5f2d_5fdata_3',['save_2d_data',['../d9/d66/group__machine__learning.html#gabc90175770bf0d5853c466e14993a08c',1,'kohonen_som_topology.cpp']]],
+  ['save_5fexact_5fsolution_4',['save_exact_solution',['../db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0):&#160;ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0):&#160;ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &amp;X0, const double &amp;X_MAX, const double &amp;step_size, const std::valarray&lt; double &gt; &amp;Y0):&#160;ode_semi_implicit_euler.cpp']]],
+  ['save_5fmodel_5',['save_model',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4f14e473bb0722c6490b9dc8da5982aa',1,'machine_learning::neural_network::NeuralNetwork']]],
+  ['save_5fnd_5fdata_6',['save_nd_data',['../d9/d66/group__machine__learning.html#gae0208548f8b393528e5db01717e88e67',1,'kohonen_som_trace.cpp']]],
+  ['save_5fu_5fmatrix_7',['save_u_matrix',['../d8/d77/namespacemachine__learning.html#aa72a53c88203fde278f1fe6c3afe5b07',1,'machine_learning']]],
+  ['scheduleforfcfs_8',['scheduleForFcfs',['../dd/dca/class_f_c_f_s.html#aa25dbe30ba9930b5a7c1a6d11758bd91',1,'FCFS']]],
+  ['scs_9',['scs',['../d7/d65/shortest__common__supersequence_8cpp.html#ad2ee8d7e67da9f6eb85146b08dad95e6',1,'dynamic_programming::shortest_common_supersequence']]],
+  ['search_10',['search',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ad3423f7518671351340932db3c24959a',1,'data_structures::linked_list::list::search()'],['../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206',1,'Trie::search()'],['../d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63',1,'data_structures::trie::search(const std::shared_ptr&lt; trie &gt; &amp;root, const std::string &amp;str, int index)'],['../d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d',1,'data_structures::trie::search(const std::string &amp;str, int index)'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ad71eb24207c28b546631802dba97310f',1,'data_structures::trie_using_hashmap::Trie::search()'],['../d0/dbc/namespacestrings_1_1boyer__moore.html#a15703b553faed0d28202c10808cf9738',1,'strings::boyer_moore::search()']]],
+  ['searchelement_11',['searchElement',['../d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4',1,'data_structures::SkipList']]],
+  ['searchfreqsuggestions_12',['SearchFreqSuggestions',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7c5ab271d8042540f64ef16d259d1503',1,'operations_on_datastructures::trie_operations::Tnode']]],
+  ['searchingprober_13',['searchingProber',['../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6',1,'double_hashing::searchingProber()'],['../d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77',1,'linear_probing::searchingProber()'],['../d4/dd2/namespacequadratic__probing.html#aeb6bca8db4768226f8ea8291ea4f83f6',1,'quadratic_probing::searchingProber()']]],
+  ['searchpresence_14',['SearchPresence',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a4a624fcdf3c3beb2025d69f2cfda8023',1,'operations_on_datastructures::trie_operations::Tnode']]],
+  ['searchsuggestions_15',['SearchSuggestions',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a18b70172ca4fb2811dbfb9a86e48b34c',1,'operations_on_datastructures::trie_operations::Tnode']]],
+  ['selectionsortrecursive_16',['selectionSortRecursive',['../d4/d9f/selection__sort__recursive_8cpp.html#ab6f7b33a070e376e1f4374e534435e89',1,'sorting::selection_sort_recursive']]],
+  ['selectiontop_5f3_17',['SelectionTop_3',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aacafb8c9f3ebac7ac6c01d9645bb67b6',1,'operations_on_datastructures::trie_operations::Tnode']]],
+  ['semi_5fimplicit_5feuler_18',['semi_implicit_euler',['../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089',1,'ode_semi_implicit_euler.cpp']]],
+  ['semi_5fimplicit_5feuler_5fstep_19',['semi_implicit_euler_step',['../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f',1,'ode_semi_implicit_euler.cpp']]],
+  ['set_5fnode_5fval_20',['set_node_val',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a04cd96efaba147b19d3afc769b90ff70',1,'range_queries::heavy_light_decomposition::Tree']]],
+  ['set_5fsret_5finit_21',['set_sret_init',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ad3b942be27a1b0fe3cff6cb6edf01294',1,'range_queries::heavy_light_decomposition::SG']]],
+  ['setchild_22',['SetChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab4e5f7b7b260bb81d9441652cc124c74',1,'data_structures::tree_234::Node']]],
+  ['setcount_23',['SetCount',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1',1,'data_structures::tree_234::Node']]],
+  ['setitem_24',['SetItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc',1,'data_structures::tree_234::Node']]],
+  ['setkthbit_25',['setKthBit',['../d5/db5/set__kth__bit_8cpp.html#ad4d0ffd9331242c42a28834ee19f5fd9',1,'bit_manipulation::set_kth_bit']]],
+  ['sg_26',['SG',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1',1,'range_queries::heavy_light_decomposition::SG']]],
+  ['sgn_27',['sgn',['../d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2',1,'bisection_method.cpp']]],
+  ['sha256_28',['sha256',['../d4/d08/sha256_8cpp.html#a55475649a2bb7aae15de0716a217f43a',1,'hashing::sha256']]],
+  ['shell_5fsort_29',['shell_sort',['../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa',1,'sorting::shell_sort(T *arr, size_t LEN)'],['../d5/d91/namespacesorting.html#a4d76603c54d3dc56146e92d10a043924',1,'sorting::shell_sort(T(&amp;arr)[N])'],['../d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331',1,'sorting::shell_sort(std::vector&lt; T &gt; *arr)']]],
+  ['shift_5fleft_30',['shift_left',['../da/d6d/namespaceoperations__on__datastructures.html#afce39cf843989a39811a49ebe29dd6d8',1,'operations_on_datastructures']]],
+  ['shift_5fright_31',['shift_right',['../da/d6d/namespaceoperations__on__datastructures.html#a1bfb8711f49e591eb168ccaa3df6fb86',1,'operations_on_datastructures']]],
+  ['shortest_5fpath_5fdistance_32',['Shortest_Path_Distance',['../d7/d07/bidirectional__dijkstra_8cpp.html#a22f1b7277e1dd4190f25014b48487ce6',1,'graph::bidirectional_dijkstra']]],
+  ['show_33',['show',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e',1,'data_structures::list_array::list::show()'],['../d2/dc8/classdata__structures_1_1_stack.html#abb86ed67d9d97112897a09cfb10ff586',1,'data_structures::Stack::show()'],['../db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed',1,'show():&#160;tower_of_hanoi.cpp'],['../d2/d26/count__inversions_8cpp.html#a851ca6a0391d14fb49a97d55e4377497',1,'sorting::inversion::show()'],['../d5/d4c/group__sorting.html#ga0a9a57a1f1bbba3d4822531d002b7e07',1,'show():&#160;merge_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#aeccefcf6fcca62c54939c5ec9a93109b',1,'sorting::quick_sort::show()']]],
+  ['show_5farray_34',['show_array',['../d5/ddb/bogo__sort_8cpp.html#ae8adaeff66471f9ed84f2e673b38a859',1,'bogo_sort.cpp']]],
+  ['show_5fdata_35',['show_data',['../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246',1,'show_data(T *arr, size_t LEN):&#160;shell_sort2.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a63aaff7cabfa3da2da8b9477b5fad9d6',1,'show_data(T(&amp;arr)[N]):&#160;shell_sort2.cpp']]],
+  ['show_5fpascal_36',['show_pascal',['../dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c',1,'pascal_triangle.cpp']]],
+  ['showarray_37',['showArray',['../d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10',1,'sorting::random_pivot_quick_sort']]],
+  ['shuffle_38',['shuffle',['../d5/d91/namespacesorting.html#a7bfe11bd4703eacd1dab93f25ec639c5',1,'sorting']]],
+  ['sieve_39',['Sieve',['../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c',1,'primes_up_to_billion.cpp']]],
+  ['sieve_40',['sieve',['../dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f',1,'math::sieve()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a22be949d160b26361f7e323310f7fa0c',1,'math::sieve_of_eratosthenes::sieve()']]],
+  ['sieveoferatosthenes_41',['SieveOfEratosthenes',['../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099',1,'prime_factorization.cpp']]],
+  ['sig2hex_42',['sig2hex',['../d5/d96/md5_8cpp.html#aaee69c6136a841043f956de32116e348',1,'hashing::md5::sig2hex()'],['../d8/d7a/sha1_8cpp.html#aada0803ef851d831b7a290a924e3c228',1,'hashing::sha1::sig2hex()']]],
+  ['sigmoid_43',['sigmoid',['../d2/d58/neural__network_8cpp.html#a23aa9d32bcbcd65cfc85f0a41e2afadc',1,'machine_learning::neural_network::activations']]],
+  ['single_5fpredict_44',['single_predict',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f',1,'machine_learning::neural_network::NeuralNetwork']]],
+  ['size_45',['size',['../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3',1,'binary_search_tree::size()'],['../d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54',1,'data_structures::Bitset::size()'],['../dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c',1,'dsu::size()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39',1,'data_structures::stack_using_queue::Stack::size()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1',1,'divide_and_conquer::strassens_multiplication::Matrix::size()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#adbfb2ef7358423fdf1f49d410f55f195',1,'others::Cache::LFUCache::size()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a1b709333874b4633ee02a3661cd042e1',1,'others::Cache::LRUCache::size()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865',1,'range_queries::perSegTree::size()']]],
+  ['skiplist_46',['SkipList',['../d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4',1,'data_structures::SkipList']]],
+  ['sleep_47',['SLEEP',['../dd/d92/memory__game_8cpp.html#a5bdc30951221eae9c33413ff9eb574f6',1,'memory_game.cpp']]],
+  ['slice_48',['slice',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17',1,'divide_and_conquer::strassens_multiplication::Matrix']]],
+  ['solution_49',['Solution',['../da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4',1,'machine_learning::aystar_search::AyStarSearch']]],
+  ['solve_50',['solve',['../d1/d2a/knight__tour_8cpp.html#aaa47356d98676cf5315d978f741e29c9',1,'backtracking::knight_tour']]],
+  ['solvemaze_51',['solveMaze',['../dc/d5a/rat__maze_8cpp.html#ab99107bfb4c6934cd4691868c66c0aa3',1,'backtracking::rat_maze']]],
+  ['solvenq_52',['solveNQ',['../d4/d3e/n__queens_8cpp.html#a0dbd7af47d87f0b956609fe9e3288ecb',1,'backtracking::n_queens']]],
+  ['solvesudoku_53',['solveSudoku',['../d3/d05/sudoku__solver_8cpp.html#ac911c8bca8556206ff64461b2424866b',1,'backtracking::sudoku_solver']]],
+  ['sort_54',['sort',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180',1,'data_structures::list_array::list']]],
+  ['sortcol_55',['sortcol',['../df/d47/fcfs__scheduling_8cpp.html#a18920aa331faf4476b251c8cdb2c2bec',1,'fcfs_scheduling.cpp']]],
+  ['sphere_5fsurface_5farea_56',['sphere_surface_area',['../dd/d47/namespacemath.html#ab7f29862d30df351c317eedd60a0c656',1,'math']]],
+  ['sphere_5fvolume_57',['sphere_volume',['../dd/d47/namespacemath.html#a34d66a77c19ce9b8b3a3d14352b34551',1,'math']]],
+  ['spiralprint_58',['spiralPrint',['../db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197',1,'spiral_print.cpp']]],
+  ['spirograph_59',['spirograph',['../da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac',1,'spirograph']]],
+  ['splitnode_60',['SplitNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9',1,'data_structures::tree_234::Tree234']]],
+  ['sqrt_61',['Sqrt',['../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc',1,'sqrt_double.cpp']]],
+  ['square_62',['square',['../d2/d58/neural__network_8cpp.html#a45d3e30406712ada3d9713ece3c1b153',1,'machine_learning::neural_network::util_functions']]],
+  ['square_5farea_63',['square_area',['../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049',1,'math']]],
+  ['square_5fperimeter_64',['square_perimeter',['../dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14',1,'math']]],
+  ['stack_65',['Stack',['../d2/dc8/classdata__structures_1_1_stack.html#a8cb0602c8a9c1603d0315938177ecc6a',1,'data_structures::Stack']]],
+  ['standard_5fdeviation_66',['standard_deviation',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2',1,'probability::geometric_dist::geometric_distribution']]],
+  ['standard_5finvsqrt_67',['Standard_InvSqrt',['../d6/db8/inv__sqrt_8cpp.html#aa2703e5cf3fecde8becd9066b9666b97',1,'inv_sqrt.cpp']]],
+  ['startwith_68',['startwith',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17',1,'data_structures::trie_using_hashmap::Trie']]],
+  ['std_69',['std',['../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1',1,'statistics::stats_computer1::std()'],['../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e',1,'statistics::stats_computer2::std()']]],
+  ['step_5fith_70',['step_ith',['../d8/d61/radix__sort2_8cpp.html#a98ead7d43b11505398daf9a894f122f9',1,'sorting::radix_sort']]],
+  ['stoogesort_71',['stoogeSort',['../d4/d4f/stooge__sort_8cpp.html#ac23852832437dc68327efe9b1da2d91b',1,'stooge_sort.cpp']]],
+  ['strand_5fsort_72',['strand_sort',['../dc/dd9/strand__sort_8cpp.html#a2bea2fe5dd38ed63610fdeaddf5785cd',1,'sorting::strand']]],
+  ['strassens_5fmultiplication_73',['strassens_multiplication',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a',1,'divide_and_conquer::strassens_multiplication::Matrix']]],
+  ['struzik_5fsearch_74',['struzik_search',['../d8/d8a/exponential__search_8cpp.html#af421bf4b7b95f20ac86c233adfdb9208',1,'exponential_search.cpp']]],
+  ['subarray_5fsum_75',['subarray_sum',['../df/d94/subarray__sum_8cpp.html#af5687bbd9faf927fbd363c71e0baba5e',1,'backtracking::subarray_sum']]],
+  ['sublistsearch_76',['sublistSearch',['../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c',1,'search::sublist_search']]],
+  ['subset_5fsum_5fproblem_77',['subset_sum_problem',['../dc/d67/subset__sum__dynamic_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50',1,'dynamic_programming::subset_sum']]],
+  ['subset_5fsum_5frecursion_78',['subset_sum_recursion',['../dc/d67/subset__sum__dynamic_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607',1,'dynamic_programming::subset_sum']]],
+  ['succ_79',['succ',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af6bbeb9bfde1683ba917071edeedd5c3',1,'data_structures::linked_list::link']]],
+  ['suggestautocomplete_80',['SuggestAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a097913c4badec2b60d50a171ecc299fe',1,'operations_on_datastructures::trie_operations::Tnode']]],
+  ['suggestfreqautocomplete_81',['SuggestFreqAutocomplete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a9e556f52c837190ecf4265b1f05cfe9c',1,'operations_on_datastructures::trie_operations::Tnode']]],
+  ['sum_82',['sum',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a1fa0559d987fde0044761b17b35f5abd',1,'range_queries::fenwick_tree::sum()'],['../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35',1,'machine_learning::sum()']]],
+  ['sum_5fof_5fdigits_83',['sum_of_digits',['../d4/d83/sum__of__digits_8cpp.html#a4619c78b6ad985713024f930f31c4395',1,'sum_of_digits.cpp']]],
+  ['sum_5fof_5fdivisor_84',['sum_of_divisor',['../dd/d47/namespacemath.html#af05567415a9ea36c254b54e3d5a2152a',1,'math']]],
+  ['sum_5frange_85',['sum_range',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a0914a4b1401a7c427de91c92885724fe',1,'range_queries::fenwick_tree']]],
+  ['summary_86',['summary',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a61d30113d13304c664057118b92a5931',1,'machine_learning::neural_network::NeuralNetwork']]]
 ];
diff --git a/search/functions_14.js b/search/functions_14.js
index 91da182f1..afff62521 100644
--- a/search/functions_14.js
+++ b/search/functions_14.js
@@ -1,129 +1,78 @@
 var searchData=
 [
-  ['t_0',['t',['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/params.html',0,'std::binomial_distribution']]],
-  ['tan_1',['tan',['http://en.cppreference.com/w/cpp/numeric/math/tan.html',0,'std']]],
-  ['tanh_2',['tanh',['http://en.cppreference.com/w/cpp/numeric/math/tanh.html',0,'std::tanh()'],['../d2/d58/neural__network_8cpp.html#a371aa7dd5d5add0143d1756bb0a1b32f',1,'machine_learning::neural_network::activations::tanh()']]],
-  ['target_3',['target',['http://en.cppreference.com/w/cpp/utility/functional/function/target.html',0,'std::function']]],
-  ['target_5ftype_4',['target_type',['http://en.cppreference.com/w/cpp/utility/functional/function/target_type.html',0,'std::function']]],
-  ['tellg_5',['tellg',['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::fstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_fstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::iostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wistream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::stringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wifstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_istream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::strstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_stringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istrstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wiostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_istringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_ifstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wfstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_iostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wstringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wistringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::ifstream::tellg()']]],
-  ['tellp_6',['tellp',['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_ofstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::fstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_ostringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ostringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_fstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::iostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::stringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::strstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_stringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wostringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_ostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wiostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ofstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ostrstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wfstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_iostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wofstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wstringstream::tellp()']]],
-  ['terminate_7',['terminate',['http://en.cppreference.com/w/cpp/error/terminate.html',0,'std']]],
-  ['ternary_5fsearch_8',['ternary_search',['../dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8',1,'ternary_search.cpp']]],
-  ['test_9',['test',['http://en.cppreference.com/w/cpp/utility/bitset/test.html',0,'std::bitset::test()'],['../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9',1,'large_number::test()'],['../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;generate_parentheses.cpp'],['../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;subarray_sum.cpp'],['../d2/d5a/subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;subset_sum.cpp'],['../dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;count_bits_flip.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;elliptic_curve_key_exchange.cpp'],['../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fcfs_scheduling.cpp'],['../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;list_array.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;segment_tree.cpp'],['../d8/dab/sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;treap.cpp'],['../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;abbreviation.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;house_robber.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;shortest_common_supersequence.cpp'],['../dc/d67/subset__sum__dynamic_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;subset_sum_dynamic.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;trapped_rainwater.cpp'],['../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;word_break.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;jarvis_algorithm.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;connected_components_with_dsu.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;is_graph_bipartite.cpp'],['../d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;topological_sort.cpp'],['../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99',1,'spirograph::test()'],['../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;kruskals_minimum_spanning_tree.cpp'],['../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;md5.cpp'],['../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sha1.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;k_nearest_neighbors.cpp'],['../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;neural_network.cpp'],['../de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;aliquot_sum.cpp'],['../dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;area.cpp'],['../d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981',1,'test(uint64_t n, uint64_t expected):&#160;double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;eulers_totient_function.cpp'],['../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fibonacci.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fibonacci_sum.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;gcd_of_n_numbers.cpp'],['../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;iterative_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;lcm_sum.cpp'],['../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;n_choose_r.cpp'],['../d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;perimeter.cpp'],['../d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;power_of_two.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;quadratic_equations_complex_numbers.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;babylonian_method.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters):&#160;composite_simpson_rule.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fast_fourier_transform.cpp'],['../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;inverse_fast_fourier_transform.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters):&#160;midpoint_integral_method.cpp'],['../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;rungekutta.cpp'],['../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;union_of_two_arrays.cpp'],['../de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;kadanes3.cpp'],['../d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;lfu_cache.cpp'],['../dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;lru_cache2.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;smallest_circle.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;ground_to_ground_projectile_motion.cpp'],['../d9/da2/exponential__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;exponential_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;geometric_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601',1,'test(const std::vector&lt; int &gt; &amp;vals, int windowSize):&#160;windowed_median.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;segtree.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;floyd_cycle_detection_algo.cpp'],['../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sublist_search.cpp'],['../dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bogo_sort.cpp'],['../d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;bubble_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;heap_sort.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;merge_insertion_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;pancake_sort.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;selection_sort_recursive.cpp'],['../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;wave_sort.cpp'],['../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;wiggle_sort.cpp'],['../db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;duval.cpp'],['../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;manacher_algorithm.cpp'],['../d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;z_function.cpp']]],
-  ['test1_10',['test1',['../d7/db9/hill__cipher_8cpp.html#a3147ad576f8a94a2a6b66948672b452b',1,'test1(const std::string &amp;text):&#160;hill_cipher.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1():&#160;dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1():&#160;dsu_union_rank.cpp'],['../db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1():&#160;tree_234.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1():&#160;hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499',1,'test1(double eta=0.01):&#160;adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8',1,'test1():&#160;large_factorial.cpp'],['../d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;sum_of_digits.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;brent_method_extrema.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;durand_kerner_roots.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;golden_search_extrema.cpp'],['../dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;lu_decompose.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;qr_eigen_values.cpp'],['../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5',1,'tests::test1()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a21d922dbb5905993960c6a7f0ba71ac0',1,'test1(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root):&#160;iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;recursive_tree_traversal.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;stooge_sort.cpp']]],
-  ['test2_11',['test2',['../d7/db9/hill__cipher_8cpp.html#a04391124480d2a49f2dec900237b0712',1,'test2(const std::string &amp;text):&#160;hill_cipher.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2():&#160;dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2():&#160;dsu_union_rank.cpp'],['../db/dbc/tree__234_8cpp.html#af1ac73779b0fcfbbdce3976c0ca57342',1,'test2(int64_t n):&#160;tree_234.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2():&#160;hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a379f7488a305f2571f2932b319931f82',1,'test2(double eta=0.01):&#160;adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa',1,'test2():&#160;large_factorial.cpp'],['../d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;sum_of_digits.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;brent_method_extrema.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;durand_kerner_roots.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;golden_search_extrema.cpp'],['../dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;lu_decompose.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;qr_eigen_values.cpp'],['../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669',1,'tests::test2()'],['../d8/d90/iterative__tree__traversals_8cpp.html#ac35ae2868441f8a11c965b87b2494f21',1,'test2(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root):&#160;iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;smallest_circle.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;stooge_sort.cpp']]],
-  ['test3_12',['test3',['../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299',1,'test3():&#160;hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9',1,'test3(double eta=0.01):&#160;adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;kohonen_som_trace.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;golden_search_extrema.cpp'],['../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76',1,'tests::test3()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a425c4c8520991999ee6dbe13d99b87f4',1,'test3(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root):&#160;iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;smallest_circle.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;stooge_sort.cpp']]],
-  ['test4_13',['test4',['../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d',1,'tests::test4()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2',1,'test4():&#160;iterative_tree_traversals.cpp']]],
-  ['test5_14',['test5',['../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86',1,'tests::test5()'],['../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8',1,'test5():&#160;iterative_tree_traversals.cpp']]],
-  ['test6_15',['test6',['../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2',1,'tests::test6()'],['../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89',1,'test6():&#160;iterative_tree_traversals.cpp']]],
-  ['test_5f1_16',['test_1',['../d3/db3/lru__cache_8cpp.html#a6401e8f2d41d8cc9cd0e52ab381608d4',1,'lru_tests::test_1()'],['../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817',1,'test_1():&#160;heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817',1,'test_1():&#160;pigeonhole_sort.cpp']]],
-  ['test_5f2_17',['test_2',['../d3/db3/lru__cache_8cpp.html#a4b02e288a407876a8d6024f98a2a25ec',1,'lru_tests::test_2()'],['../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d',1,'test_2():&#160;heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d',1,'test_2():&#160;pigeonhole_sort.cpp']]],
-  ['test_5f2d_5fclasses_18',['test_2d_classes',['../d4/def/kohonen__som__topology_8cpp.html#a48efb079040c7aaa3a4917a0e486cba9',1,'kohonen_som_topology.cpp']]],
-  ['test_5f3_19',['test_3',['../d3/db3/lru__cache_8cpp.html#a01ec21fc91ddafd964ae2035ba7892c0',1,'lru_tests::test_3()'],['../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a',1,'test_3():&#160;heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a',1,'test_3():&#160;pigeonhole_sort.cpp']]],
-  ['test_5f3d_5fclasses_20',['test_3d_classes',['../d9/d49/kohonen__som__trace_8cpp.html#a7154fe319e6033485a8a6cd6f0d8932d',1,'kohonen_som_trace.cpp']]],
-  ['test_5f3d_5fclasses1_21',['test_3d_classes1',['../d4/def/kohonen__som__topology_8cpp.html#a1302662a56ebf67a21249270b017297e',1,'kohonen_som_topology.cpp']]],
-  ['test_5f3d_5fclasses2_22',['test_3d_classes2',['../d4/def/kohonen__som__topology_8cpp.html#a4b7ab643f6a5002f991837de46f70653',1,'kohonen_som_topology.cpp']]],
-  ['test_5fand_5fset_23',['test_and_set',['http://en.cppreference.com/w/cpp/atomic/atomic_flag/test_and_set.html',0,'std::atomic_flag']]],
-  ['test_5fbitset_24',['test_bitset',['../d9/dab/bloom__filter_8cpp.html#a6e509afe40db07681f676ad8da4fb905',1,'bloom_filter.cpp']]],
-  ['test_5fbloom_5ffilter_5fint_25',['test_bloom_filter_int',['../d9/dab/bloom__filter_8cpp.html#a30edc0d2bb59c185baec81d69d20ed3b',1,'bloom_filter.cpp']]],
-  ['test_5fbloom_5ffilter_5fstring_26',['test_bloom_filter_string',['../d9/dab/bloom__filter_8cpp.html#a71f57bf262fe55db928b19dc124cc0d8',1,'bloom_filter.cpp']]],
-  ['test_5fcircle_27',['test_circle',['../d9/d49/kohonen__som__trace_8cpp.html#ae571600aa42a81bc14a4a602ea5ff00d',1,'kohonen_som_trace.cpp']]],
-  ['test_5fcompute_5fpadded_5fsize_28',['test_compute_padded_size',['../d4/d08/sha256_8cpp.html#af9b52eba85d23e309035354141259f27',1,'sha256.cpp']]],
-  ['test_5fcontains_29',['test_contains',['../df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3',1,'binary_search_tree2.cpp']]],
-  ['test_5fdouble_30',['test_double',['../d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792',1,'quick_sort_3.cpp']]],
-  ['test_5feval_31',['test_eval',['../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec',1,'math']]],
-  ['test_5ff_32',['test_f',['../d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d',1,'shell_sort2.cpp']]],
-  ['test_5ffind_5fmax_33',['test_find_max',['../df/d42/binary__search__tree2_8cpp.html#a9856b68e2cba50d2e26a1cbe374e0365',1,'binary_search_tree2.cpp']]],
-  ['test_5ffind_5fmin_34',['test_find_min',['../df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4',1,'binary_search_tree2.cpp']]],
-  ['test_5ffindgraphsum_35',['test_findGraphSum',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a2311b22324cf09926726e4ce1309af8b',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]],
-  ['test_5ffunction_36',['test_function',['../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.cpp']]],
-  ['test_5ffunction_5f1_37',['test_function_1',['../d7/d75/postfix__evaluation_8cpp.html#a6a8eeb7d346d5cd6335d9780fb7c0f15',1,'postfix_evaluation.cpp']]],
-  ['test_5ffunction_5f2_38',['test_function_2',['../d7/d75/postfix__evaluation_8cpp.html#a5b97d12e8b61484f756a8721992bfae1',1,'postfix_evaluation.cpp']]],
-  ['test_5fget_5felements_5finorder_39',['test_get_elements_inorder',['../df/d42/binary__search__tree2_8cpp.html#a06f35064850e891d6fda0093c0d9ee6e',1,'binary_search_tree2.cpp']]],
-  ['test_5fget_5felements_5fpostorder_40',['test_get_elements_postorder',['../df/d42/binary__search__tree2_8cpp.html#a94b76f781fcbe1ad0e3397ace6bb1965',1,'binary_search_tree2.cpp']]],
-  ['test_5fget_5felements_5fpreorder_41',['test_get_elements_preorder',['../df/d42/binary__search__tree2_8cpp.html#ab00b8d0f21aeb5fbddb6decf3bcb640a',1,'binary_search_tree2.cpp']]],
-  ['test_5finsert_42',['test_insert',['../df/d42/binary__search__tree2_8cpp.html#a8c882f43e1e52948a7841a8bfb091350',1,'binary_search_tree2.cpp']]],
-  ['test_5fint_43',['test_int',['../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda',1,'test_int():&#160;quick_sort_3.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e',1,'test_int(const int NUM_DATA):&#160;shell_sort2.cpp']]],
-  ['test_5flamniscate_44',['test_lamniscate',['../d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a',1,'kohonen_som_trace.cpp']]],
-  ['test_5flongest_5fcommon_5fstring_5flength_45',['test_longest_common_string_length',['../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561',1,'longest_common_string.cpp']]],
-  ['test_5flongest_5fcommon_5fstring_5flength_5ffor_5freversed_5finputs_46',['test_longest_common_string_length_for_reversed_inputs',['../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe',1,'longest_common_string.cpp']]],
-  ['test_5flongest_5fcommon_5fstring_5flength_5fis_5fsymmetric_47',['test_longest_common_string_length_is_symmetric',['../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155',1,'longest_common_string.cpp']]],
-  ['test_5fremove_48',['test_remove',['../df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e',1,'binary_search_tree2.cpp']]],
-  ['testcase_5f1_49',['testCase_1',['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()']]],
-  ['testcase_5f2_50',['testCase_2',['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()']]],
-  ['testcase_5f3_51',['testCase_3',['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()']]],
-  ['tests_52',['tests',['../d1/da7/armstrong__number__templated_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;armstrong_number_templated.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;longest_common_string.cpp'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;unbounded_0_1_knapsack.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;depth_first_search_with_stack.cpp'],['../d8/d68/dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;travelling_salesman_problem.cpp'],['../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;digit_separation.cpp'],['../da/de8/dijkstra__greedy_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;dijkstra_greedy.cpp'],['../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;gale_shapley.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;kelvin_to_celsius.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;longest_substring_without_repeating_characters.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;longest_increasing_subsequence_using_binary_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;insertion_sort_recursive.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;quick_sort.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;boyer_moore.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;knuth_morris_pratt.cpp']]],
-  ['tgamma_53',['tgamma',['http://en.cppreference.com/w/cpp/numeric/math/tgamma.html',0,'std']]],
-  ['th_54',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]],
-  ['thousands_5fsep_55',['thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::thousands_sep()']]],
-  ['thread_56',['thread',['http://en.cppreference.com/w/cpp/thread/thread/thread.html',0,'std::thread']]],
-  ['throw_5fwith_5fnested_57',['throw_with_nested',['http://en.cppreference.com/w/cpp/error/throw_with_nested.html',0,'std']]],
-  ['tie_58',['tie',['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::fstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ios::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_fstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::iostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wistream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::stringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wifstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_istream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::strstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_stringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istrstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wiostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_istringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ifstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostrstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wfstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_iostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wstringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wistringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ifstream::tie()'],['http://en.cppreference.com/w/cpp/utility/tuple/tie.html',0,'std::tie(T... args)']]],
-  ['time_59',['time',['http://en.cppreference.com/w/cpp/chrono/c/time.html',0,'std']]],
-  ['time_5fget_60',['time_get',['http://en.cppreference.com/w/cpp/locale/time_get/time_get.html',0,'std::time_get']]],
-  ['time_5fget_5fbyname_61',['time_get_byname',['http://en.cppreference.com/w/cpp/locale/time_get_byname.html',0,'std::time_get_byname']]],
-  ['time_5fof_5fflight_62',['time_of_flight',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a563e066975fed1b84750a0a47c3cbb37',1,'physics::ground_to_ground_projectile_motion']]],
-  ['time_5fpoint_63',['time_point',['http://en.cppreference.com/w/cpp/chrono/time_point/time_point.html',0,'std::chrono::time_point']]],
-  ['time_5fpoint_5fcast_64',['time_point_cast',['http://en.cppreference.com/w/cpp/chrono/time_point/time_point_cast.html',0,'std::chrono']]],
-  ['time_5fput_65',['time_put',['http://en.cppreference.com/w/cpp/locale/time_put/time_put.html',0,'std::time_put']]],
-  ['time_5fput_5fbyname_66',['time_put_byname',['http://en.cppreference.com/w/cpp/locale/time_put_byname.html',0,'std::time_put_byname']]],
-  ['time_5fsince_5fepoch_67',['time_since_epoch',['http://en.cppreference.com/w/cpp/chrono/time_point/time_since_epoch.html',0,'std::chrono::time_point']]],
-  ['timed_5fmutex_68',['timed_mutex',['http://en.cppreference.com/w/cpp/thread/timed_mutex/timed_mutex.html',0,'std::timed_mutex']]],
-  ['tmpfile_69',['tmpfile',['http://en.cppreference.com/w/cpp/io/c/tmpfile.html',0,'std']]],
-  ['tmpnam_70',['tmpnam',['http://en.cppreference.com/w/cpp/io/c/tmpnam.html',0,'std']]],
-  ['to_5fbytes_71',['to_bytes',['http://en.cppreference.com/w/cpp/locale/wstring_convert/to_bytes.html',0,'std::wstring_convert']]],
-  ['to_5fchar_5ftype_72',['to_char_type',['http://en.cppreference.com/w/cpp/string/char_traits/to_char_type.html',0,'std::char_traits']]],
-  ['to_5fint_5ftype_73',['to_int_type',['http://en.cppreference.com/w/cpp/string/char_traits/to_int_type.html',0,'std::char_traits']]],
-  ['to_5fstring_74',['to_string',['http://en.cppreference.com/w/cpp/utility/bitset/to_string.html',0,'std::bitset::to_string()'],['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08',1,'hashing::sha256::Hash::to_string()'],['http://en.cppreference.com/w/cpp/string/basic_string/to_string.html',0,'std::to_string()']]],
-  ['to_5ftime_5ft_75',['to_time_t',['http://en.cppreference.com/w/cpp/chrono/system_clock/to_time_t.html',0,'std::chrono::system_clock']]],
-  ['to_5fullong_76',['to_ullong',['http://en.cppreference.com/w/cpp/utility/bitset/to_ullong.html',0,'std::bitset']]],
-  ['to_5fulong_77',['to_ulong',['http://en.cppreference.com/w/cpp/utility/bitset/to_ulong.html',0,'std::bitset']]],
-  ['to_5fwstring_78',['to_wstring',['http://en.cppreference.com/w/cpp/string/basic_string/to_wstring.html',0,'std']]],
-  ['tolittleendian32_79',['toLittleEndian32',['../d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689',1,'hashing::md5']]],
-  ['tolittleendian64_80',['toLittleEndian64',['../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef',1,'hashing::md5']]],
-  ['tolower_81',['tolower',['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype_byname::tolower()'],['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype::tolower()'],['http://en.cppreference.com/w/cpp/string/byte/tolower.html',0,'std::tolower()']]],
-  ['tolowerroman_82',['tolowerRoman',['../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d',1,'decimal_to_roman_numeral.cpp']]],
-  ['top_83',['top',['http://en.cppreference.com/w/cpp/container/stack/top.html',0,'std::stack::top()'],['http://en.cppreference.com/w/cpp/container/priority_queue/top.html',0,'std::priority_queue::top()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6',1,'data_structures::linked_list::list::top()'],['../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709',1,'stack::top()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7',1,'data_structures::stack_using_queue::Stack::top()']]],
-  ['topmost_84',['topmost',['../d2/dc8/classdata__structures_1_1_stack.html#a61dc70e128ee64c9684f03a4c04818b0',1,'data_structures::Stack']]],
-  ['topologicalsort_85',['topologicalSort',['../d8/db9/topological__sort_8cpp.html#a54dc5d7914958dbd24dda2fd862dc41b',1,'graph::topological_sort']]],
-  ['toupper_86',['toupper',['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype_byname::toupper()'],['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype::toupper()'],['http://en.cppreference.com/w/cpp/string/byte/toupper.html',0,'std::toupper()']]],
-  ['toupperroman_87',['toupperRoman',['../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979',1,'decimal_to_roman_numeral.cpp']]],
-  ['tovector_88',['toVector',['../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d',1,'queue']]],
-  ['towctrans_89',['towctrans',['http://en.cppreference.com/w/cpp/string/wide/towctrans.html',0,'std']]],
-  ['towlower_90',['towlower',['http://en.cppreference.com/w/cpp/string/wide/towlower.html',0,'std']]],
-  ['towupper_91',['towupper',['http://en.cppreference.com/w/cpp/string/wide/towupper.html',0,'std']]],
-  ['transform_92',['transform',['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate_byname::transform()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/transform.html',0,'std::regex_traits::transform()'],['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate::transform()'],['http://en.cppreference.com/w/cpp/algorithm/transform.html',0,'std::transform()']]],
-  ['transform_5fprimary_93',['transform_primary',['http://en.cppreference.com/w/cpp/regex/regex_traits/transform_primary.html',0,'std::regex_traits']]],
-  ['translate_94',['translate',['http://en.cppreference.com/w/cpp/regex/regex_traits/translate.html',0,'std::regex_traits']]],
-  ['translate_5fnocase_95',['translate_nocase',['http://en.cppreference.com/w/cpp/regex/regex_traits/translate_nocase.html',0,'std::regex_traits']]],
-  ['transpose_96',['transpose',['../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a',1,'machine_learning']]],
-  ['trappedrainwater_97',['trappedRainwater',['../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8',1,'dynamic_programming']]],
-  ['travelling_5fsalesman_5fusing_5fbit_5fmanipulation_98',['travelling_salesman_using_bit_manipulation',['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1',1,'bit_manipulation::travelling_salesman_using_bit_manipulation']]],
-  ['travellingsalesmanproblem_99',['TravellingSalesmanProblem',['../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346',1,'graph']]],
-  ['traverse_100',['Traverse',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd',1,'data_structures::tree_234::Tree234::Traverse()'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a936bb546e6a94d8b9d35b30ee1bb291a',1,'data_structures::tree_234::Tree234::Traverse(Node *tree)']]],
-  ['traverse_101',['traverse',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69',1,'data_structures::linked_list::list']]],
-  ['traverse_5finorder_102',['traverse_inorder',['../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd',1,'binary_search_tree']]],
-  ['traverse_5fpostorder_103',['traverse_postorder',['../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362',1,'binary_search_tree']]],
-  ['traverse_5fpreorder_104',['traverse_preorder',['../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1',1,'binary_search_tree']]],
-  ['treap_105',['Treap',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683',1,'data_structures::treap::Treap']]],
-  ['tree_106',['Tree',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1',1,'range_queries::heavy_light_decomposition::Tree']]],
-  ['triangle_5farea_107',['triangle_area',['../dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc',1,'math']]],
-  ['triangle_5fperimeter_108',['triangle_perimeter',['../dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3',1,'math']]],
-  ['triangle_5fprism_5fvolume_109',['triangle_prism_volume',['../dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c',1,'math']]],
-  ['trianglearea_110',['TriangleArea',['../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc',1,'smallest_circle.cpp']]],
-  ['trie_111',['Trie',['../dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908',1,'Trie::Trie()'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a092d0805a9e647c2048777dbe67b35ab',1,'data_structures::trie_using_hashmap::Trie::Trie()']]],
-  ['trie_112',['trie',['../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8',1,'data_structures::trie']]],
-  ['truename_113',['truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::truename()']]],
-  ['trunc_114',['trunc',['http://en.cppreference.com/w/cpp/numeric/math/trunc.html',0,'std']]],
-  ['try_5flock_115',['try_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock.html',0,'std::unique_lock::try_lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/try_lock.html',0,'std::recursive_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock.html',0,'std::recursive_timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock.html',0,'std::shared_lock::try_lock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock.html',0,'std::timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/mutex/try_lock.html',0,'std::mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock.html',0,'std::shared_timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/try_lock.html',0,'std::try_lock()']]],
-  ['try_5flock_5ffor_116',['try_lock_for',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock_for.html',0,'std::unique_lock::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock_for.html',0,'std::recursive_timed_mutex::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock_for.html',0,'std::shared_lock::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock_for.html',0,'std::timed_mutex::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_for.html',0,'std::shared_timed_mutex::try_lock_for(T... args)']]],
-  ['try_5flock_5fshared_117',['try_lock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared.html',0,'std::shared_timed_mutex']]],
-  ['try_5flock_5fshared_5ffor_118',['try_lock_shared_for',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared_for.html',0,'std::shared_timed_mutex']]],
-  ['try_5flock_5fshared_5funtil_119',['try_lock_shared_until',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared_until.html',0,'std::shared_timed_mutex']]],
-  ['try_5flock_5funtil_120',['try_lock_until',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock_until.html',0,'std::unique_lock::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock_until.html',0,'std::recursive_timed_mutex::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock_until.html',0,'std::shared_lock::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock_until.html',0,'std::timed_mutex::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_until.html',0,'std::shared_timed_mutex::try_lock_until()']]],
-  ['tryleftrotate_121',['TryLeftRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9',1,'data_structures::tree_234::Tree234']]],
-  ['tryrightrotate_122',['TryRightRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3',1,'data_structures::tree_234::Tree234']]],
-  ['tuple_123',['tuple',['http://en.cppreference.com/w/cpp/utility/tuple/tuple.html',0,'std::tuple']]],
-  ['tuple_5fcat_124',['tuple_cat',['http://en.cppreference.com/w/cpp/utility/tuple/tuple_cat.html',0,'std']]],
-  ['type_5findex_125',['type_index',['http://en.cppreference.com/w/cpp/types/type_index/type_index.html',0,'std::type_index']]]
+  ['tanh_0',['tanh',['../d2/d58/neural__network_8cpp.html#a371aa7dd5d5add0143d1756bb0a1b32f',1,'machine_learning::neural_network::activations']]],
+  ['ternary_5fsearch_1',['ternary_search',['../dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8',1,'ternary_search.cpp']]],
+  ['test_2',['test',['../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9',1,'large_number::test()'],['../dd/d1e/generate__parentheses_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;generate_parentheses.cpp'],['../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;subarray_sum.cpp'],['../d2/d5a/subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;subset_sum.cpp'],['../dc/d14/wildcard__matching_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;count_bits_flip.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;elliptic_curve_key_exchange.cpp'],['../d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fcfs_scheduling.cpp'],['../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;list_array.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;segment_tree.cpp'],['../d8/dab/sparse__table_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;treap.cpp'],['../d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;abbreviation.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;house_robber.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;shortest_common_supersequence.cpp'],['../dc/d67/subset__sum__dynamic_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;subset_sum_dynamic.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;trapped_rainwater.cpp'],['../d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;word_break.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;jarvis_algorithm.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;connected_components_with_dsu.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;is_graph_bipartite.cpp'],['../d8/db9/topological__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;topological_sort.cpp'],['../da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99',1,'spirograph::test()'],['../d6/dba/jump__game_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;kruskals_minimum_spanning_tree.cpp'],['../d5/d96/md5_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;md5.cpp'],['../d8/d7a/sha1_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sha1.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;k_nearest_neighbors.cpp'],['../d2/d58/neural__network_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;neural_network.cpp'],['../de/d99/aliquot__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;aliquot_sum.cpp'],['../dc/d82/area_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;area.cpp'],['../d7/d89/double__factorial_8cpp.html#abbbcebf3a2d0c67f4c3cfb5511a97981',1,'test(uint64_t n, uint64_t expected):&#160;double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;eulers_totient_function.cpp'],['../d9/d89/fibonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fibonacci.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fibonacci_sum.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;gcd_of_n_numbers.cpp'],['../db/d40/integral__approximation2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;iterative_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;lcm_sum.cpp'],['../df/d72/modular__division_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;n_choose_r.cpp'],['../d3/dfe/perimeter_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;perimeter.cpp'],['../d4/d38/power__of__two_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;power_of_two.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;quadratic_equations_complex_numbers.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;babylonian_method.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters):&#160;composite_simpson_rule.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;fast_fourier_transform.cpp'],['../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;inverse_fast_fourier_transform.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a2ae48a41e43dc6ab11b962742349646e',1,'test(std::int32_t N, double h, double a, double b, bool used_argv_parameters):&#160;midpoint_integral_method.cpp'],['../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;rungekutta.cpp'],['../d9/d14/array__left__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;union_of_two_arrays.cpp'],['../de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;kadanes3.cpp'],['../d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;lfu_cache.cpp'],['../dc/daa/lru__cache2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;lru_cache2.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;smallest_circle.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;ground_to_ground_projectile_motion.cpp'],['../d9/da2/exponential__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;exponential_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;geometric_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601',1,'test(const std::vector&lt; int &gt; &amp;vals, int windowSize):&#160;windowed_median.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;segtree.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;floyd_cycle_detection_algo.cpp'],['../d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;sublist_search.cpp'],['../dc/db5/text__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;bogo_sort.cpp'],['../d8/d13/bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;bubble_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test():&#160;heap_sort.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;merge_insertion_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;pancake_sort.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;selection_sort_recursive.cpp'],['../dc/dd9/strand__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;wave_sort.cpp'],['../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;wiggle_sort.cpp'],['../db/d09/duval_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;duval.cpp'],['../d3/dfe/horspool_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;manacher_algorithm.cpp'],['../d3/d80/z__function_8cpp.html#aa8dca7b867074164d5f45b0f3851269d',1,'test():&#160;z_function.cpp']]],
+  ['test1_3',['test1',['../d7/db9/hill__cipher_8cpp.html#a3147ad576f8a94a2a6b66948672b452b',1,'test1(const std::string &amp;text):&#160;hill_cipher.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1():&#160;dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1():&#160;dsu_union_rank.cpp'],['../db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1():&#160;tree_234.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#ae7880ce913f3058a35ff106d5be9e243',1,'test1():&#160;hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499',1,'test1(double eta=0.01):&#160;adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8',1,'test1():&#160;large_factorial.cpp'],['../d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;sum_of_digits.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;brent_method_extrema.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;durand_kerner_roots.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;golden_search_extrema.cpp'],['../dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;lu_decompose.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;qr_eigen_values.cpp'],['../d9/df4/namespacetests.html#a167c24bd817469ae47358d12e034f2d5',1,'tests::test1()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a21d922dbb5905993960c6a7f0ba71ac0',1,'test1(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root):&#160;iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;recursive_tree_traversal.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1():&#160;stooge_sort.cpp']]],
+  ['test2_4',['test2',['../d7/db9/hill__cipher_8cpp.html#a04391124480d2a49f2dec900237b0712',1,'test2(const std::string &amp;text):&#160;hill_cipher.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2():&#160;dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2():&#160;dsu_union_rank.cpp'],['../db/dbc/tree__234_8cpp.html#af1ac73779b0fcfbbdce3976c0ca57342',1,'test2(int64_t n):&#160;tree_234.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae',1,'test2():&#160;hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a379f7488a305f2571f2932b319931f82',1,'test2(double eta=0.01):&#160;adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa',1,'test2():&#160;large_factorial.cpp'],['../d4/d83/sum__of__digits_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;sum_of_digits.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;brent_method_extrema.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;durand_kerner_roots.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;golden_search_extrema.cpp'],['../dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;lu_decompose.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;qr_eigen_values.cpp'],['../d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669',1,'tests::test2()'],['../d8/d90/iterative__tree__traversals_8cpp.html#ac35ae2868441f8a11c965b87b2494f21',1,'test2(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root):&#160;iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;smallest_circle.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2():&#160;stooge_sort.cpp']]],
+  ['test3_5',['test3',['../dd/d0c/hamiltons__cycle_8cpp.html#a0cc94918b6831f308d4fe4fa27f08299',1,'test3():&#160;hamiltons_cycle.cpp'],['../d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9',1,'test3(double eta=0.01):&#160;adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;kohonen_som_trace.cpp'],['../db/d01/brent__method__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;golden_search_extrema.cpp'],['../d9/df4/namespacetests.html#aa515639572647508b94986489aab6d76',1,'tests::test3()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a425c4c8520991999ee6dbe13d99b87f4',1,'test3(others::iterative_tree_traversals::BinaryTree binaryTree, others::iterative_tree_traversals::Node *root):&#160;iterative_tree_traversals.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;smallest_circle.cpp'],['../d4/d4f/stooge__sort_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3():&#160;stooge_sort.cpp']]],
+  ['test4_6',['test4',['../d9/df4/namespacetests.html#a2b9769e44683dcb67fe1083ad91e134d',1,'tests::test4()'],['../d8/d90/iterative__tree__traversals_8cpp.html#a038b236fe900f7bb7e57164f5bed66c2',1,'test4():&#160;iterative_tree_traversals.cpp']]],
+  ['test5_7',['test5',['../d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86',1,'tests::test5()'],['../d8/d90/iterative__tree__traversals_8cpp.html#aa9ef334cd7eb607f4eb8732566ea00b8',1,'test5():&#160;iterative_tree_traversals.cpp']]],
+  ['test6_8',['test6',['../d9/df4/namespacetests.html#aacafde185abd8670abee51157f273dc2',1,'tests::test6()'],['../d8/d90/iterative__tree__traversals_8cpp.html#af727f920064f2b8f484b589b60d49b89',1,'test6():&#160;iterative_tree_traversals.cpp']]],
+  ['test_5f1_9',['test_1',['../d3/db3/lru__cache_8cpp.html#a6401e8f2d41d8cc9cd0e52ab381608d4',1,'lru_tests::test_1()'],['../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817',1,'test_1():&#160;heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817',1,'test_1():&#160;pigeonhole_sort.cpp']]],
+  ['test_5f2_10',['test_2',['../d3/db3/lru__cache_8cpp.html#a4b02e288a407876a8d6024f98a2a25ec',1,'lru_tests::test_2()'],['../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d',1,'test_2():&#160;heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#a458410412185a5f09199deaff7157a8d',1,'test_2():&#160;pigeonhole_sort.cpp']]],
+  ['test_5f2d_5fclasses_11',['test_2d_classes',['../d4/def/kohonen__som__topology_8cpp.html#a48efb079040c7aaa3a4917a0e486cba9',1,'kohonen_som_topology.cpp']]],
+  ['test_5f3_12',['test_3',['../d3/db3/lru__cache_8cpp.html#a01ec21fc91ddafd964ae2035ba7892c0',1,'lru_tests::test_3()'],['../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a',1,'test_3():&#160;heavy_light_decomposition.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#af31ec5409537703d9c8a47350386b32a',1,'test_3():&#160;pigeonhole_sort.cpp']]],
+  ['test_5f3d_5fclasses_13',['test_3d_classes',['../d9/d49/kohonen__som__trace_8cpp.html#a7154fe319e6033485a8a6cd6f0d8932d',1,'kohonen_som_trace.cpp']]],
+  ['test_5f3d_5fclasses1_14',['test_3d_classes1',['../d4/def/kohonen__som__topology_8cpp.html#a1302662a56ebf67a21249270b017297e',1,'kohonen_som_topology.cpp']]],
+  ['test_5f3d_5fclasses2_15',['test_3d_classes2',['../d4/def/kohonen__som__topology_8cpp.html#a4b7ab643f6a5002f991837de46f70653',1,'kohonen_som_topology.cpp']]],
+  ['test_5fbitset_16',['test_bitset',['../d9/dab/bloom__filter_8cpp.html#a6e509afe40db07681f676ad8da4fb905',1,'bloom_filter.cpp']]],
+  ['test_5fbloom_5ffilter_5fint_17',['test_bloom_filter_int',['../d9/dab/bloom__filter_8cpp.html#a30edc0d2bb59c185baec81d69d20ed3b',1,'bloom_filter.cpp']]],
+  ['test_5fbloom_5ffilter_5fstring_18',['test_bloom_filter_string',['../d9/dab/bloom__filter_8cpp.html#a71f57bf262fe55db928b19dc124cc0d8',1,'bloom_filter.cpp']]],
+  ['test_5fcircle_19',['test_circle',['../d9/d49/kohonen__som__trace_8cpp.html#ae571600aa42a81bc14a4a602ea5ff00d',1,'kohonen_som_trace.cpp']]],
+  ['test_5fcompute_5fpadded_5fsize_20',['test_compute_padded_size',['../d4/d08/sha256_8cpp.html#af9b52eba85d23e309035354141259f27',1,'sha256.cpp']]],
+  ['test_5fcontains_21',['test_contains',['../df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3',1,'binary_search_tree2.cpp']]],
+  ['test_5fdouble_22',['test_double',['../d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792',1,'quick_sort_3.cpp']]],
+  ['test_5feval_23',['test_eval',['../dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec',1,'math']]],
+  ['test_5ff_24',['test_f',['../d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d',1,'shell_sort2.cpp']]],
+  ['test_5ffind_5fmax_25',['test_find_max',['../df/d42/binary__search__tree2_8cpp.html#a9856b68e2cba50d2e26a1cbe374e0365',1,'binary_search_tree2.cpp']]],
+  ['test_5ffind_5fmin_26',['test_find_min',['../df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4',1,'binary_search_tree2.cpp']]],
+  ['test_5ffindgraphsum_27',['test_findGraphSum',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a2311b22324cf09926726e4ce1309af8b',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]],
+  ['test_5ffunction_28',['test_function',['../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.cpp']]],
+  ['test_5ffunction_5f1_29',['test_function_1',['../d7/d75/postfix__evaluation_8cpp.html#a6a8eeb7d346d5cd6335d9780fb7c0f15',1,'postfix_evaluation.cpp']]],
+  ['test_5ffunction_5f2_30',['test_function_2',['../d7/d75/postfix__evaluation_8cpp.html#a5b97d12e8b61484f756a8721992bfae1',1,'postfix_evaluation.cpp']]],
+  ['test_5fget_5felements_5finorder_31',['test_get_elements_inorder',['../df/d42/binary__search__tree2_8cpp.html#a06f35064850e891d6fda0093c0d9ee6e',1,'binary_search_tree2.cpp']]],
+  ['test_5fget_5felements_5fpostorder_32',['test_get_elements_postorder',['../df/d42/binary__search__tree2_8cpp.html#a94b76f781fcbe1ad0e3397ace6bb1965',1,'binary_search_tree2.cpp']]],
+  ['test_5fget_5felements_5fpreorder_33',['test_get_elements_preorder',['../df/d42/binary__search__tree2_8cpp.html#ab00b8d0f21aeb5fbddb6decf3bcb640a',1,'binary_search_tree2.cpp']]],
+  ['test_5finsert_34',['test_insert',['../df/d42/binary__search__tree2_8cpp.html#a8c882f43e1e52948a7841a8bfb091350',1,'binary_search_tree2.cpp']]],
+  ['test_5fint_35',['test_int',['../d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda',1,'test_int():&#160;quick_sort_3.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e',1,'test_int(const int NUM_DATA):&#160;shell_sort2.cpp']]],
+  ['test_5flamniscate_36',['test_lamniscate',['../d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a',1,'kohonen_som_trace.cpp']]],
+  ['test_5flongest_5fcommon_5fstring_5flength_37',['test_longest_common_string_length',['../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561',1,'longest_common_string.cpp']]],
+  ['test_5flongest_5fcommon_5fstring_5flength_5ffor_5freversed_5finputs_38',['test_longest_common_string_length_for_reversed_inputs',['../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe',1,'longest_common_string.cpp']]],
+  ['test_5flongest_5fcommon_5fstring_5flength_5fis_5fsymmetric_39',['test_longest_common_string_length_is_symmetric',['../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155',1,'longest_common_string.cpp']]],
+  ['test_5fremove_40',['test_remove',['../df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e',1,'binary_search_tree2.cpp']]],
+  ['testcase_5f1_41',['testCase_1',['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()'],['../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008',1,'TestCases::testCase_1()']]],
+  ['testcase_5f2_42',['testCase_2',['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()'],['../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3',1,'TestCases::testCase_2()']]],
+  ['testcase_5f3_43',['testCase_3',['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()'],['../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5',1,'TestCases::testCase_3()']]],
+  ['tests_44',['tests',['../d1/da7/armstrong__number__templated_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;armstrong_number_templated.cpp'],['../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;longest_common_string.cpp'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;unbounded_0_1_knapsack.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;connected_components.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;depth_first_search_with_stack.cpp'],['../d8/d68/dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;dijkstra.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;hopcroft_karp.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;lowest_common_ancestor.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;travelling_salesman_problem.cpp'],['../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;digit_separation.cpp'],['../da/de8/dijkstra__greedy_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;dijkstra_greedy.cpp'],['../db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;gale_shapley.cpp'],['../d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;approximate_pi.cpp'],['../d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;double_factorial.cpp'],['../d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;miller_rabin.cpp'],['../de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;ncr_modulo_p.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;number_of_positive_divisors.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;sieve_of_eratosthenes.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;kelvin_to_celsius.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;longest_substring_without_repeating_characters.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;recursive_tree_traversal.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;fenwick_tree.cpp'],['../d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;longest_increasing_subsequence_using_binary_search.cpp'],['../d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;comb_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;insertion_sort_recursive.cpp'],['../d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;quick_sort.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'tests():&#160;quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;radix_sort2.cpp'],['../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;boyer_moore.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e',1,'tests():&#160;knuth_morris_pratt.cpp']]],
+  ['th_45',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]],
+  ['time_5fof_5fflight_46',['time_of_flight',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a563e066975fed1b84750a0a47c3cbb37',1,'physics::ground_to_ground_projectile_motion']]],
+  ['to_5fstring_47',['to_string',['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08',1,'hashing::sha256::Hash']]],
+  ['tolittleendian32_48',['toLittleEndian32',['../d5/d96/md5_8cpp.html#a694712c9665051ba52b686387b87a689',1,'hashing::md5']]],
+  ['tolittleendian64_49',['toLittleEndian64',['../d5/d96/md5_8cpp.html#a6be48c1e6e742f9bd329f501d61dcaef',1,'hashing::md5']]],
+  ['tolowerroman_50',['tolowerRoman',['../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d',1,'decimal_to_roman_numeral.cpp']]],
+  ['top_51',['top',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6',1,'data_structures::linked_list::list::top()'],['../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709',1,'stack::top()'],['../db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7',1,'data_structures::stack_using_queue::Stack::top()']]],
+  ['topmost_52',['topmost',['../d2/dc8/classdata__structures_1_1_stack.html#a61dc70e128ee64c9684f03a4c04818b0',1,'data_structures::Stack']]],
+  ['topologicalsort_53',['topologicalSort',['../d8/db9/topological__sort_8cpp.html#a54dc5d7914958dbd24dda2fd862dc41b',1,'graph::topological_sort']]],
+  ['toupperroman_54',['toupperRoman',['../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979',1,'decimal_to_roman_numeral.cpp']]],
+  ['tovector_55',['toVector',['../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d',1,'queue']]],
+  ['transpose_56',['transpose',['../d8/d77/namespacemachine__learning.html#a89fde571b38f9483576594f66572958a',1,'machine_learning']]],
+  ['trappedrainwater_57',['trappedRainwater',['../dd/d24/namespacedynamic__programming.html#a066e0e739e7c276eee6e61d5b4d37ce8',1,'dynamic_programming']]],
+  ['travelling_5fsalesman_5fusing_5fbit_5fmanipulation_58',['travelling_salesman_using_bit_manipulation',['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ad08f082be02c3437c2fe89cb035fcee1',1,'bit_manipulation::travelling_salesman_using_bit_manipulation']]],
+  ['travellingsalesmanproblem_59',['TravellingSalesmanProblem',['../df/dce/namespacegraph.html#ab7706341d006e20d1ae58274187a3346',1,'graph']]],
+  ['traverse_60',['Traverse',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd',1,'data_structures::tree_234::Tree234::Traverse()'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a936bb546e6a94d8b9d35b30ee1bb291a',1,'data_structures::tree_234::Tree234::Traverse(Node *tree)']]],
+  ['traverse_61',['traverse',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69',1,'data_structures::linked_list::list']]],
+  ['traverse_5finorder_62',['traverse_inorder',['../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd',1,'binary_search_tree']]],
+  ['traverse_5fpostorder_63',['traverse_postorder',['../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362',1,'binary_search_tree']]],
+  ['traverse_5fpreorder_64',['traverse_preorder',['../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1',1,'binary_search_tree']]],
+  ['treap_65',['Treap',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5d200493aeaa02a269f6b6deda39a683',1,'data_structures::treap::Treap']]],
+  ['tree_66',['Tree',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a835fb2bbb27307b8cacad9b287968bc1',1,'range_queries::heavy_light_decomposition::Tree']]],
+  ['triangle_5farea_67',['triangle_area',['../dd/d47/namespacemath.html#ab3b920cc56442abd92279ba23b50f4dc',1,'math']]],
+  ['triangle_5fperimeter_68',['triangle_perimeter',['../dd/d47/namespacemath.html#a3d1e4db743b189f309327572663415f3',1,'math']]],
+  ['triangle_5fprism_5fvolume_69',['triangle_prism_volume',['../dd/d47/namespacemath.html#a2d704a7b72a6b2db8b76c8581b577b2c',1,'math']]],
+  ['trianglearea_70',['TriangleArea',['../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc',1,'smallest_circle.cpp']]],
+  ['trie_71',['Trie',['../dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908',1,'Trie::Trie()'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a092d0805a9e647c2048777dbe67b35ab',1,'data_structures::trie_using_hashmap::Trie::Trie()']]],
+  ['trie_72',['trie',['../d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8',1,'data_structures::trie']]],
+  ['tryleftrotate_73',['TryLeftRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac5361479dd996eb331759f33808657d9',1,'data_structures::tree_234::Tree234']]],
+  ['tryrightrotate_74',['TryRightRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aec0642d1d151521ca7c70ea85cdb15d3',1,'data_structures::tree_234::Tree234']]]
 ];
diff --git a/search/functions_15.js b/search/functions_15.js
index bd847d05f..8ac1d9e76 100644
--- a/search/functions_15.js
+++ b/search/functions_15.js
@@ -1,55 +1,19 @@
 var searchData=
 [
-  ['u16string_0',['u16string',['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::u16string']]],
-  ['u32string_1',['u32string',['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::u32string']]],
-  ['uflow_2',['uflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_filebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wstringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::stringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wfilebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wstreambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::strstreambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_stringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_streambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::filebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::streambuf::uflow()']]],
-  ['uint128_5ft_3',['uint128_t',['../db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040',1,'uint128_t::uint128_t(T low)'],['../db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac',1,'uint128_t::uint128_t(const std::string &amp;str)'],['../db/d9a/classuint128__t.html#a95ac8be8f414fcbce09301b912f5079d',1,'uint128_t::uint128_t(const uint64_t high, const uint64_t low)'],['../db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b',1,'uint128_t::uint128_t(const uint128_t &amp;num)=default'],['../db/d9a/classuint128__t.html#a7d56143b2e291e8087188192533d2e3c',1,'uint128_t::uint128_t(uint128_t &amp;&amp;num) noexcept']]],
-  ['uint128_5ft_5ftests_4',['uint128_t_tests',['../df/d2c/elliptic__curve__key__exchange_8cpp.html#a8800c8a84d77dadadb05ad5e83b77ef4',1,'elliptic_curve_key_exchange.cpp']]],
-  ['uint256_5ft_5',['uint256_t',['../d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc',1,'uint256_t::uint256_t(T low)'],['../d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39',1,'uint256_t::uint256_t(const std::string &amp;str)'],['../d1/d83/classuint256__t.html#a42bf7490b31d8c750a67fd9bb6f2df2e',1,'uint256_t::uint256_t(const uint256_t &amp;num)=default'],['../d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa',1,'uint256_t::uint256_t(uint256_t &amp;&amp;num) noexcept'],['../d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3',1,'uint256_t::uint256_t(uint128_t high, uint128_t low)'],['../d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052',1,'uint256_t::uint256_t(const uint64_t high, const uint64_t low)']]],
-  ['uint256_5ft_5ftests_6',['uint256_t_tests',['../df/d2c/elliptic__curve__key__exchange_8cpp.html#a37775d1724ffe404c088dabbc8da91ae',1,'elliptic_curve_key_exchange.cpp']]],
-  ['unary_5fnegate_7',['unary_negate',['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate']]],
-  ['unboundedknapsack_8',['unboundedKnapsack',['../d9/dec/unbounded__0__1__knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef',1,'dynamic_programming::unbounded_knapsack']]],
-  ['uncaught_5fexception_9',['uncaught_exception',['http://en.cppreference.com/w/cpp/error/uncaught_exception.html',0,'std']]],
-  ['undeclare_5fno_5fpointers_10',['undeclare_no_pointers',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_no_pointers.html',0,'std']]],
-  ['undeclare_5freachable_11',['undeclare_reachable',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_reachable.html',0,'std']]],
-  ['underflow_12',['underflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wfilebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::strstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_streambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::streambuf::underflow()']]],
-  ['underflow_5ferror_13',['underflow_error',['http://en.cppreference.com/w/cpp/error/underflow_error.html',0,'std::underflow_error']]],
-  ['unexpected_14',['unexpected',['http://en.cppreference.com/w/cpp/error/unexpected.html',0,'std']]],
-  ['unget_15',['unget',['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::strstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istrstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wiostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_ifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wfstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wstringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::ifstream::unget()']]],
-  ['ungetc_16',['ungetc',['http://en.cppreference.com/w/cpp/io/c/ungetc.html',0,'std']]],
-  ['ungetwc_17',['ungetwc',['http://en.cppreference.com/w/cpp/io/c/ungetwc.html',0,'std']]],
-  ['uniform_5fint_5fdistribution_18',['uniform_int_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/uniform_int_distribution.html',0,'std::uniform_int_distribution']]],
-  ['uniform_5frandom_5finitialization_19',['uniform_random_initialization',['../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905',1,'machine_learning']]],
-  ['uniform_5freal_5fdistribution_20',['uniform_real_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/uniform_real_distribution.html',0,'std::uniform_real_distribution']]],
-  ['uninitialized_5fcopy_21',['uninitialized_copy',['http://en.cppreference.com/w/cpp/memory/uninitialized_copy.html',0,'std']]],
-  ['uninitialized_5fcopy_5fn_22',['uninitialized_copy_n',['http://en.cppreference.com/w/cpp/memory/uninitialized_copy_n.html',0,'std']]],
-  ['uninitialized_5ffill_23',['uninitialized_fill',['http://en.cppreference.com/w/cpp/memory/uninitialized_fill.html',0,'std']]],
-  ['uninitialized_5ffill_5fn_24',['uninitialized_fill_n',['http://en.cppreference.com/w/cpp/memory/uninitialized_fill_n.html',0,'std']]],
-  ['union_25',['Union',['../de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757',1,'disjoint_set.cpp']]],
-  ['union_5fsets_26',['union_sets',['../d8/d99/connected__components__with__dsu_8cpp.html#a67cb7472f310a798f555fe45cdf50145',1,'graph::disjoint_union']]],
-  ['unionset_27',['UnionSet',['../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559',1,'dsu']]],
-  ['unionset_28',['unionSet',['../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f',1,'dsu']]],
-  ['unique_29',['unique',['http://en.cppreference.com/w/cpp/memory/shared_ptr/unique.html',0,'std::shared_ptr::unique()'],['http://en.cppreference.com/w/cpp/container/forward_list/unique.html',0,'std::forward_list::unique()'],['http://en.cppreference.com/w/cpp/container/list/unique.html',0,'std::list::unique()'],['http://en.cppreference.com/w/cpp/algorithm/unique.html',0,'std::unique(T... args)']]],
-  ['unique_5fcopy_30',['unique_copy',['http://en.cppreference.com/w/cpp/algorithm/unique_copy.html',0,'std']]],
-  ['unique_5flock_31',['unique_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/unique_lock.html',0,'std::unique_lock']]],
-  ['unique_5fptr_32',['unique_ptr',['http://en.cppreference.com/w/cpp/memory/unique_ptr/unique_ptr.html',0,'std::unique_ptr']]],
-  ['unit_5fmatrix_5finitialization_33',['unit_matrix_initialization',['../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4',1,'machine_learning']]],
-  ['unitbuf_34',['unitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]],
-  ['unlock_35',['unlock',['http://en.cppreference.com/w/cpp/thread/unique_lock/unlock.html',0,'std::unique_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/unlock.html',0,'std::recursive_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/unlock.html',0,'std::recursive_timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/unlock.html',0,'std::shared_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/unlock.html',0,'std::timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/mutex/unlock.html',0,'std::mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock.html',0,'std::shared_timed_mutex::unlock(T... args)']]],
-  ['unlock_5fshared_36',['unlock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock_shared.html',0,'std::shared_timed_mutex']]],
-  ['unordered_5fmap_37',['unordered_map',['http://en.cppreference.com/w/cpp/container/unordered_map/unordered_map.html',0,'std::unordered_map']]],
-  ['unordered_5fmultimap_38',['unordered_multimap',['http://en.cppreference.com/w/cpp/container/unordered_multimap/unordered_multimap.html',0,'std::unordered_multimap']]],
-  ['unordered_5fmultiset_39',['unordered_multiset',['http://en.cppreference.com/w/cpp/container/unordered_multiset/unordered_multiset.html',0,'std::unordered_multiset']]],
-  ['unordered_5fset_40',['unordered_set',['http://en.cppreference.com/w/cpp/container/unordered_set/unordered_set.html',0,'std::unordered_set']]],
-  ['unsetf_41',['unsetf',['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ios::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ios_base::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::strstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wiostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wfstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wstringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ifstream::unsetf()']]],
-  ['unshift_42',['unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::unshift()']]],
-  ['update_43',['update',['../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1',1,'data_structures::SegmentTree::update(int i, int l, int r, int pos, T val)'],['../dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17',1,'data_structures::SegmentTree::update(int pos, T val)'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7',1,'data_structures::treap::Treap::update()'],['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3',1,'hashing::sha256::Hash::update()'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9',1,'range_queries::fenwick_tree::update()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c',1,'range_queries::heavy_light_decomposition::SG::update()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57',1,'range_queries::heavy_light_decomposition::HLD::update()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6',1,'range_queries::perSegTree::update(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value, std::shared_ptr&lt; Node &gt; const &amp;curr)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d',1,'range_queries::perSegTree::update(const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value)'],['../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0',1,'update(std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos):&#160;segtree.cpp']]],
-  ['update_5fstep_44',['update_step',['../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217',1,'extended_euclid_algorithm.cpp']]],
-  ['update_5fweights_45',['update_weights',['../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3',1,'machine_learning::update_weights(const std::valarray&lt; double &gt; &amp;X, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; *W, std::vector&lt; std::valarray&lt; double &gt; &gt; *D, double alpha, int R)'],['../d8/d77/namespacemachine__learning.html#aa6aac06ccf128b0a9c55c9ee1a8e5631',1,'machine_learning::update_weights(const std::valarray&lt; double &gt; &amp;x, std::vector&lt; std::valarray&lt; double &gt; &gt; *W, std::valarray&lt; double &gt; *D, double alpha, int R)']]],
-  ['upper_46',['upper',['../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705',1,'uint128_t::upper()'],['../d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5',1,'uint256_t::upper()']]],
-  ['upper_5fbound_47',['upper_bound',['http://en.cppreference.com/w/cpp/container/multiset/upper_bound.html',0,'std::multiset::upper_bound()'],['http://en.cppreference.com/w/cpp/container/set/upper_bound.html',0,'std::set::upper_bound()'],['http://en.cppreference.com/w/cpp/container/map/upper_bound.html',0,'std::map::upper_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/upper_bound.html',0,'std::multimap::upper_bound()'],['http://en.cppreference.com/w/cpp/algorithm/upper_bound.html',0,'std::upper_bound(T... args)']]],
-  ['uppercase_48',['uppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]],
-  ['use_5fcount_49',['use_count',['http://en.cppreference.com/w/cpp/memory/weak_ptr/use_count.html',0,'std::weak_ptr']]],
-  ['use_5ffacet_50',['use_facet',['http://en.cppreference.com/w/cpp/locale/use_facet.html',0,'std']]],
-  ['user_5finput_5ftest_51',['user_input_test',['../d4/d38/power__of__two_8cpp.html#adfd6be45be425ae28c62ce3bfb4b40dc',1,'power_of_two.cpp']]]
+  ['uint128_5ft_0',['uint128_t',['../db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040',1,'uint128_t::uint128_t(T low)'],['../db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac',1,'uint128_t::uint128_t(const std::string &amp;str)'],['../db/d9a/classuint128__t.html#a95ac8be8f414fcbce09301b912f5079d',1,'uint128_t::uint128_t(const uint64_t high, const uint64_t low)'],['../db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b',1,'uint128_t::uint128_t(const uint128_t &amp;num)=default'],['../db/d9a/classuint128__t.html#a7d56143b2e291e8087188192533d2e3c',1,'uint128_t::uint128_t(uint128_t &amp;&amp;num) noexcept']]],
+  ['uint128_5ft_5ftests_1',['uint128_t_tests',['../df/d2c/elliptic__curve__key__exchange_8cpp.html#a8800c8a84d77dadadb05ad5e83b77ef4',1,'elliptic_curve_key_exchange.cpp']]],
+  ['uint256_5ft_2',['uint256_t',['../d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc',1,'uint256_t::uint256_t(T low)'],['../d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39',1,'uint256_t::uint256_t(const std::string &amp;str)'],['../d1/d83/classuint256__t.html#a42bf7490b31d8c750a67fd9bb6f2df2e',1,'uint256_t::uint256_t(const uint256_t &amp;num)=default'],['../d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa',1,'uint256_t::uint256_t(uint256_t &amp;&amp;num) noexcept'],['../d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3',1,'uint256_t::uint256_t(uint128_t high, uint128_t low)'],['../d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052',1,'uint256_t::uint256_t(const uint64_t high, const uint64_t low)']]],
+  ['uint256_5ft_5ftests_3',['uint256_t_tests',['../df/d2c/elliptic__curve__key__exchange_8cpp.html#a37775d1724ffe404c088dabbc8da91ae',1,'elliptic_curve_key_exchange.cpp']]],
+  ['unboundedknapsack_4',['unboundedKnapsack',['../d9/dec/unbounded__0__1__knapsack_8cpp.html#a1bcff7f76de48fa7f629480f8f18b5ef',1,'dynamic_programming::unbounded_knapsack']]],
+  ['uniform_5frandom_5finitialization_5',['uniform_random_initialization',['../d8/d77/namespacemachine__learning.html#abee7b35403af3612222d3b7a53074905',1,'machine_learning']]],
+  ['union_6',['Union',['../de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757',1,'disjoint_set.cpp']]],
+  ['union_5fsets_7',['union_sets',['../d8/d99/connected__components__with__dsu_8cpp.html#a67cb7472f310a798f555fe45cdf50145',1,'graph::disjoint_union']]],
+  ['unionset_8',['UnionSet',['../dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559',1,'dsu']]],
+  ['unionset_9',['unionSet',['../dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f',1,'dsu']]],
+  ['unit_5fmatrix_5finitialization_10',['unit_matrix_initialization',['../d8/d77/namespacemachine__learning.html#a8dd3f1ffbc2f26a3c88da1b1f8b7e9c4',1,'machine_learning']]],
+  ['update_11',['update',['../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1',1,'data_structures::SegmentTree::update(int i, int l, int r, int pos, T val)'],['../dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17',1,'data_structures::SegmentTree::update(int pos, T val)'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#aae9facaede462ad924856c4d707646d7',1,'data_structures::treap::Treap::update()'],['../d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3',1,'hashing::sha256::Hash::update()'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#a19dea5e88bbd7683a719030623315de9',1,'range_queries::fenwick_tree::update()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c',1,'range_queries::heavy_light_decomposition::SG::update()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57',1,'range_queries::heavy_light_decomposition::HLD::update()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6',1,'range_queries::perSegTree::update(const uint32_t &amp;i, const uint32_t &amp;j, const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value, std::shared_ptr&lt; Node &gt; const &amp;curr)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d',1,'range_queries::perSegTree::update(const uint32_t &amp;l, const uint32_t &amp;r, const int64_t &amp;value)'],['../d2/d45/segtree_8cpp.html#abd3e818681fb2e29cf08f4f60f82c8e0',1,'update(std::vector&lt; int64_t &gt; *segtree, std::vector&lt; int64_t &gt; *lazy, int64_t start, int64_t end, int64_t delta, uint64_t low, uint64_t high, uint64_t pos):&#160;segtree.cpp']]],
+  ['update_5fstep_12',['update_step',['../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217',1,'extended_euclid_algorithm.cpp']]],
+  ['update_5fweights_13',['update_weights',['../d8/d77/namespacemachine__learning.html#ae868ad43698a1d69ba46ea3827d7d2c3',1,'machine_learning::update_weights(const std::valarray&lt; double &gt; &amp;X, std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; *W, std::vector&lt; std::valarray&lt; double &gt; &gt; *D, double alpha, int R)'],['../d8/d77/namespacemachine__learning.html#aa6aac06ccf128b0a9c55c9ee1a8e5631',1,'machine_learning::update_weights(const std::valarray&lt; double &gt; &amp;x, std::vector&lt; std::valarray&lt; double &gt; &gt; *W, std::valarray&lt; double &gt; *D, double alpha, int R)']]],
+  ['upper_14',['upper',['../db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705',1,'uint128_t::upper()'],['../d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5',1,'uint256_t::upper()']]],
+  ['user_5finput_5ftest_15',['user_input_test',['../d4/d38/power__of__two_8cpp.html#adfd6be45be425ae28c62ce3bfb4b40dc',1,'power_of_two.cpp']]]
 ];
diff --git a/search/functions_16.js b/search/functions_16.js
index e450ee097..d93c5b54b 100644
--- a/search/functions_16.js
+++ b/search/functions_16.js
@@ -2,27 +2,9 @@ var searchData=
 [
   ['v_5fstack_0',['v_stack',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af12ceffdc07cc87eca8a4a8ac87d60fe',1,'divide_and_conquer::strassens_multiplication::Matrix']]],
   ['val_1',['val',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#acf96f3a9a1d3b15268c38e8822300c11',1,'data_structures::linked_list::link']]],
-  ['valid_2',['valid',['http://en.cppreference.com/w/cpp/thread/shared_future/valid.html',0,'std::shared_future::valid()'],['http://en.cppreference.com/w/cpp/thread/future/valid.html',0,'std::future::valid()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/valid.html',0,'std::packaged_task::valid()']]],
-  ['value_3',['value',['http://en.cppreference.com/w/cpp/error/error_code/value.html',0,'std::error_code::value()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/value.html',0,'std::regex_traits::value()'],['http://en.cppreference.com/w/cpp/error/error_condition/value.html',0,'std::error_condition::value()'],['http://en.cppreference.com/w/cpp/experimental/optional/value.html',0,'std::experimental::optional::value()']]],
-  ['value_5fcomp_4',['value_comp',['http://en.cppreference.com/w/cpp/container/multiset/value_comp.html',0,'std::multiset::value_comp()'],['http://en.cppreference.com/w/cpp/container/set/value_comp.html',0,'std::set::value_comp()'],['http://en.cppreference.com/w/cpp/container/map/value_comp.html',0,'std::map::value_comp()'],['http://en.cppreference.com/w/cpp/container/multimap/value_comp.html',0,'std::multimap::value_comp()']]],
-  ['value_5for_5',['value_or',['http://en.cppreference.com/w/cpp/experimental/optional/value_or.html',0,'std::experimental::optional']]],
-  ['values_6',['values',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::values()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a03a896b34d27fda69049827e0c4dab42',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::values(Node *root)']]],
-  ['variance_7',['variance',['../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92',1,'statistics::stats_computer1::variance()'],['../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555',1,'statistics::stats_computer2::variance()'],['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960',1,'probability::geometric_dist::geometric_distribution::variance()']]],
-  ['vector_8',['vector',['http://en.cppreference.com/w/cpp/container/vector/vector.html',0,'std::vector']]],
-  ['vector_5fdot_9',['vector_dot',['../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec',1,'qr_algorithm']]],
-  ['vector_5fmag_10',['vector_mag',['../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f',1,'qr_algorithm']]],
-  ['vector_5fproj_11',['vector_proj',['../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc',1,'qr_algorithm']]],
-  ['vfprintf_12',['vfprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]],
-  ['vfscanf_13',['vfscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]],
-  ['vfwprintf_14',['vfwprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]],
-  ['vfwscanf_15',['vfwscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]],
-  ['vprintf_16',['vprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]],
-  ['vscanf_17',['vscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]],
-  ['vsnprintf_18',['vsnprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]],
-  ['vsprintf_19',['vsprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]],
-  ['vsscanf_20',['vsscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]],
-  ['vswprintf_21',['vswprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]],
-  ['vswscanf_22',['vswscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]],
-  ['vwprintf_23',['vwprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]],
-  ['vwscanf_24',['vwscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]]
+  ['values_2',['values',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a53611ec1fef92eeeb875aea1bde1e4de',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::values()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a03a896b34d27fda69049827e0c4dab42',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::values(Node *root)']]],
+  ['variance_3',['variance',['../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92',1,'statistics::stats_computer1::variance()'],['../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555',1,'statistics::stats_computer2::variance()'],['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aea8b0d649f0dc9a6f8baf3341a0b4960',1,'probability::geometric_dist::geometric_distribution::variance()']]],
+  ['vector_5fdot_4',['vector_dot',['../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec',1,'qr_algorithm']]],
+  ['vector_5fmag_5',['vector_mag',['../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f',1,'qr_algorithm']]],
+  ['vector_5fproj_6',['vector_proj',['../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc',1,'qr_algorithm']]]
 ];
diff --git a/search/functions_17.js b/search/functions_17.js
index 584020871..7e8b2f1ee 100644
--- a/search/functions_17.js
+++ b/search/functions_17.js
@@ -1,80 +1,7 @@
 var searchData=
 [
-  ['wait_0',['wait',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/wait.html',0,'std::condition_variable_any::wait()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/wait.html',0,'std::condition_variable::wait()'],['http://en.cppreference.com/w/cpp/thread/shared_future/wait.html',0,'std::shared_future::wait()'],['http://en.cppreference.com/w/cpp/thread/future/wait.html',0,'std::future::wait()']]],
-  ['wait_5ffor_1',['wait_for',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/wait_for.html',0,'std::condition_variable_any::wait_for()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/wait_for.html',0,'std::condition_variable::wait_for()'],['http://en.cppreference.com/w/cpp/thread/shared_future/wait_for.html',0,'std::shared_future::wait_for()'],['http://en.cppreference.com/w/cpp/thread/future/wait_for.html',0,'std::future::wait_for()']]],
-  ['wait_5funtil_2',['wait_until',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/wait_until.html',0,'std::condition_variable_any::wait_until()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/wait_until.html',0,'std::condition_variable::wait_until()'],['http://en.cppreference.com/w/cpp/thread/shared_future/wait_until.html',0,'std::shared_future::wait_until()'],['http://en.cppreference.com/w/cpp/thread/future/wait_until.html',0,'std::future::wait_until()']]],
-  ['wavesort_3',['waveSort',['../db/d3f/wave__sort_8cpp.html#a7d4f243b9dc13ace4ef77e30dbc56f12',1,'sorting::wave_sort']]],
-  ['wbuffer_5fconvert_4',['wbuffer_convert',['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/wbuffer_convert.html',0,'std::wbuffer_convert']]],
-  ['wcmatch_5',['wcmatch',['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::wcmatch']]],
-  ['wcregex_5fiterator_6',['wcregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::wcregex_iterator']]],
-  ['wcregex_5ftoken_5fiterator_7',['wcregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::wcregex_token_iterator']]],
-  ['wcrtomb_8',['wcrtomb',['http://en.cppreference.com/w/cpp/string/multibyte/wcrtomb.html',0,'std']]],
-  ['wcscat_9',['wcscat',['http://en.cppreference.com/w/cpp/string/wide/wcscat.html',0,'std']]],
-  ['wcschr_10',['wcschr',['http://en.cppreference.com/w/cpp/string/wide/wcschr.html',0,'std']]],
-  ['wcscmp_11',['wcscmp',['http://en.cppreference.com/w/cpp/string/wide/wcscmp.html',0,'std']]],
-  ['wcscoll_12',['wcscoll',['http://en.cppreference.com/w/cpp/string/wide/wcscoll.html',0,'std']]],
-  ['wcscpy_13',['wcscpy',['http://en.cppreference.com/w/cpp/string/wide/wcscpy.html',0,'std']]],
-  ['wcscspn_14',['wcscspn',['http://en.cppreference.com/w/cpp/string/wide/wcscspn.html',0,'std']]],
-  ['wcsftime_15',['wcsftime',['http://en.cppreference.com/w/cpp/chrono/c/wcsftime.html',0,'std']]],
-  ['wcslen_16',['wcslen',['http://en.cppreference.com/w/cpp/string/wide/wcslen.html',0,'std']]],
-  ['wcsncat_17',['wcsncat',['http://en.cppreference.com/w/cpp/string/wide/wcsncat.html',0,'std']]],
-  ['wcsncmp_18',['wcsncmp',['http://en.cppreference.com/w/cpp/string/wide/wcsncmp.html',0,'std']]],
-  ['wcsncpy_19',['wcsncpy',['http://en.cppreference.com/w/cpp/string/wide/wcsncpy.html',0,'std']]],
-  ['wcspbrk_20',['wcspbrk',['http://en.cppreference.com/w/cpp/string/wide/wcspbrk.html',0,'std']]],
-  ['wcsrchr_21',['wcsrchr',['http://en.cppreference.com/w/cpp/string/wide/wcsrchr.html',0,'std']]],
-  ['wcsspn_22',['wcsspn',['http://en.cppreference.com/w/cpp/string/wide/wcsspn.html',0,'std']]],
-  ['wcsstr_23',['wcsstr',['http://en.cppreference.com/w/cpp/string/wide/wcsstr.html',0,'std']]],
-  ['wcstod_24',['wcstod',['http://en.cppreference.com/w/cpp/string/wide/wcstof.html',0,'std']]],
-  ['wcstof_25',['wcstof',['http://en.cppreference.com/w/cpp/string/wide/wcstof.html',0,'std']]],
-  ['wcstoimax_26',['wcstoimax',['http://en.cppreference.com/w/cpp/string/wide/wcstoimax.html',0,'std']]],
-  ['wcstok_27',['wcstok',['http://en.cppreference.com/w/cpp/string/wide/wcstok.html',0,'std']]],
-  ['wcstol_28',['wcstol',['http://en.cppreference.com/w/cpp/string/wide/wcstol.html',0,'std']]],
-  ['wcstold_29',['wcstold',['http://en.cppreference.com/w/cpp/string/wide/wcstof.html',0,'std']]],
-  ['wcstoll_30',['wcstoll',['http://en.cppreference.com/w/cpp/string/wide/wcstol.html',0,'std']]],
-  ['wcstombs_31',['wcstombs',['http://en.cppreference.com/w/cpp/string/multibyte/wcstombs.html',0,'std']]],
-  ['wcstoul_32',['wcstoul',['http://en.cppreference.com/w/cpp/string/wide/wcstoul.html',0,'std']]],
-  ['wcstoull_33',['wcstoull',['http://en.cppreference.com/w/cpp/string/wide/wcstoul.html',0,'std']]],
-  ['wcstoumax_34',['wcstoumax',['http://en.cppreference.com/w/cpp/string/wide/wcstoimax.html',0,'std']]],
-  ['wcsub_5fmatch_35',['wcsub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::wcsub_match']]],
-  ['wcsxfrm_36',['wcsxfrm',['http://en.cppreference.com/w/cpp/string/wide/wcsxfrm.html',0,'std']]],
-  ['wctob_37',['wctob',['http://en.cppreference.com/w/cpp/string/multibyte/wctob.html',0,'std']]],
-  ['wctomb_38',['wctomb',['http://en.cppreference.com/w/cpp/string/multibyte/wctomb.html',0,'std']]],
-  ['wctrans_39',['wctrans',['http://en.cppreference.com/w/cpp/string/wide/wctrans.html',0,'std']]],
-  ['wctype_40',['wctype',['http://en.cppreference.com/w/cpp/string/wide/wctype.html',0,'std']]],
-  ['weak_5fptr_41',['weak_ptr',['http://en.cppreference.com/w/cpp/memory/weak_ptr/weak_ptr.html',0,'std::weak_ptr']]],
-  ['weibull_5fdistribution_42',['weibull_distribution',['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/weibull_distribution.html',0,'std::weibull_distribution']]],
-  ['wfilebuf_43',['wfilebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::wfilebuf']]],
-  ['wfstream_44',['wfstream',['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::wfstream']]],
-  ['what_45',['what',['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ofstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::fstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::runtime_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wostream::failure::what()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_array_new_length::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_typeid::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ios::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::logic_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_alloc::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_fstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_function_call::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::range_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::invalid_argument::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::iostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ios_base::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wistream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::out_of_range::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::stringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::domain_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::overflow_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_istream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::strstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_stringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::future_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istrstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_cast::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wiostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ofstream::failure::what()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_array_length::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_istringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::exception::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_optional_access::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostrstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_weak_ptr::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wfstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_iostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wofstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::underflow_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wstringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::regex_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::system_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wistringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::length_error::what()']]],
-  ['widen_46',['widen',['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ofstream::widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype_byname::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::fstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ios::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_fstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::iostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wistream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::stringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wifstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_istream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::strstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_stringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istrstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wiostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ofstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_istringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ifstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istringstream::widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostrstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wfstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_iostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wofstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wstringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wistringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ifstream::widen()']]],
-  ['width_47',['width',['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::fstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ios::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_fstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::iostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ios_base::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wistream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::stringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wifstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_istream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::strstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_stringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istrstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wiostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_istringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ifstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostrstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wfstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_iostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wstringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wistringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ifstream::width()']]],
-  ['wifstream_48',['wifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::wifstream']]],
-  ['wigglesort_49',['wiggleSort',['../d1/dcc/wiggle__sort_8cpp.html#a99eeded693ac073717282fae365957a1',1,'sorting::wiggle_sort']]],
-  ['windowedmedian_50',['WindowedMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d',1,'probability::windowed_median::WindowedMedian']]],
-  ['wiostream_51',['wiostream',['http://en.cppreference.com/w/cpp/io/basic_iostream/basic_iostream.html',0,'std::wiostream']]],
-  ['wistream_52',['wistream',['http://en.cppreference.com/w/cpp/io/basic_istream/basic_istream.html',0,'std::wistream']]],
-  ['wistringstream_53',['wistringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::wistringstream']]],
-  ['wmemchr_54',['wmemchr',['http://en.cppreference.com/w/cpp/string/wide/wmemchr.html',0,'std']]],
-  ['wmemcmp_55',['wmemcmp',['http://en.cppreference.com/w/cpp/string/wide/wmemcmp.html',0,'std']]],
-  ['wmemcpy_56',['wmemcpy',['http://en.cppreference.com/w/cpp/string/wide/wmemcpy.html',0,'std']]],
-  ['wmemmove_57',['wmemmove',['http://en.cppreference.com/w/cpp/string/wide/wmemmove.html',0,'std']]],
-  ['wmemset_58',['wmemset',['http://en.cppreference.com/w/cpp/string/wide/wmemset.html',0,'std']]],
-  ['wofstream_59',['wofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream/basic_ofstream.html',0,'std::wofstream']]],
-  ['wordbreak_60',['wordBreak',['../d3/d84/word__break_8cpp.html#afe4dcd6fd5282e535685361cba645d7c',1,'dynamic_programming::word_break']]],
-  ['wostream_61',['wostream',['http://en.cppreference.com/w/cpp/io/basic_ostream/basic_ostream.html',0,'std::wostream']]],
-  ['wostringstream_62',['wostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::wostringstream']]],
-  ['wprintf_63',['wprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]],
-  ['wregex_64',['wregex',['http://en.cppreference.com/w/cpp/regex/basic_regex/basic_regex.html',0,'std::wregex']]],
-  ['write_65',['write',['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::fstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_fstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::iostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::stringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::strstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_stringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wiostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostrstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wfstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_iostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wstringstream::write()']]],
-  ['ws_66',['ws',['http://en.cppreference.com/w/cpp/io/manip/ws.html',0,'std']]],
-  ['wscanf_67',['wscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]],
-  ['wsmatch_68',['wsmatch',['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::wsmatch']]],
-  ['wsregex_5fiterator_69',['wsregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::wsregex_iterator']]],
-  ['wsregex_5ftoken_5fiterator_70',['wsregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::wsregex_token_iterator']]],
-  ['wssub_5fmatch_71',['wssub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::wssub_match']]],
-  ['wstreambuf_72',['wstreambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/basic_streambuf.html',0,'std::wstreambuf']]],
-  ['wstring_73',['wstring',['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::wstring']]],
-  ['wstring_5fconvert_74',['wstring_convert',['http://en.cppreference.com/w/cpp/locale/wstring_convert/wstring_convert.html',0,'std::wstring_convert']]],
-  ['wstringbuf_75',['wstringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::wstringbuf']]],
-  ['wstringstream_76',['wstringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::wstringstream']]]
+  ['wavesort_0',['waveSort',['../db/d3f/wave__sort_8cpp.html#a7d4f243b9dc13ace4ef77e30dbc56f12',1,'sorting::wave_sort']]],
+  ['wigglesort_1',['wiggleSort',['../d1/dcc/wiggle__sort_8cpp.html#a99eeded693ac073717282fae365957a1',1,'sorting::wiggle_sort']]],
+  ['windowedmedian_2',['WindowedMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d',1,'probability::windowed_median::WindowedMedian']]],
+  ['wordbreak_3',['wordBreak',['../d3/d84/word__break_8cpp.html#afe4dcd6fd5282e535685361cba645d7c',1,'dynamic_programming::word_break']]]
 ];
diff --git a/search/functions_18.js b/search/functions_18.js
index b86214cb9..c691fff12 100644
--- a/search/functions_18.js
+++ b/search/functions_18.js
@@ -1,6 +1,5 @@
 var searchData=
 [
-  ['xalloc_0',['xalloc',['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ofstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::fstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ostringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ios::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ostringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_fstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::iostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ios_base::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wistream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::stringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wifstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_istream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::strstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_stringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wostringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::istrstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wiostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ofstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_istringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ifstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::istringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::istream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ostrstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wfstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_iostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wofstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wstringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wistringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ifstream::xalloc()']]],
-  ['xsgetn_1',['xsgetn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_filebuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstringbuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::stringbuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wfilebuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstreambuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::strstreambuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_stringbuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_streambuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::filebuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::streambuf::xsgetn()']]],
-  ['xsputn_2',['xsputn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_filebuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstringbuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::stringbuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wfilebuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstreambuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::strstreambuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_stringbuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_streambuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::filebuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::streambuf::xsputn()']]]
+  ['z_5ffunction_0',['Z_function',['../d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773',1,'z_function.cpp']]],
+  ['zeroes_5finitialization_1',['zeroes_initialization',['../d8/d77/namespacemachine__learning.html#ac1bdaa2a724b4ce6a6bb371a5dbe2e7e',1,'machine_learning']]]
 ];
diff --git a/search/functions_19.js b/search/functions_19.js
index 58ba673f3..de71404ed 100644
--- a/search/functions_19.js
+++ b/search/functions_19.js
@@ -1,4 +1,13 @@
 var searchData=
 [
-  ['yield_0',['yield',['http://en.cppreference.com/w/cpp/thread/yield.html',0,'std::this_thread']]]
+  ['_7ecircularlinkedlist_0',['~CircularLinkedList',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a46195fcf11b636064c7172cb74b55dd0',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList']]],
+  ['_7edenselayer_1',['~DenseLayer',['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ac9cda9453c4a0caf5bae7f9213b019a0',1,'machine_learning::neural_network::layers::DenseLayer']]],
+  ['_7eeightpuzzle_2',['~EightPuzzle',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a194c2973b51a5467fc17064a4ea4e6f9',1,'machine_learning::aystar_search::EightPuzzle']]],
+  ['_7einfo_3',['~Info',['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aa816af5a64b37c86be8acda89fdefba2',1,'machine_learning::aystar_search::AyStarSearch::Info']]],
+  ['_7eknn_4',['~Knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#afe732a33112b457b738f403622d226e5',1,'machine_learning::k_nearest_neighbors::Knn']]],
+  ['_7elfucache_5',['~LFUCache',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a8857531ecc8ed2e36868e267148eff36',1,'others::Cache::LFUCache']]],
+  ['_7elrucache_6',['~LRUCache',['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a6d855ff72ad6fe548eb564b7f87abe06',1,'others::Cache::LRUCache']]],
+  ['_7eneuralnetwork_7',['~NeuralNetwork',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a8973f687738ddd76f93b5562feae4027',1,'machine_learning::neural_network::NeuralNetwork']]],
+  ['_7euint128_5ft_8',['~uint128_t',['../db/d9a/classuint128__t.html#a4147188abcdcdb12c61bfbe4e4c0a363',1,'uint128_t']]],
+  ['_7euint256_5ft_9',['~uint256_t',['../d1/d83/classuint256__t.html#a3ff17ab14b2371eb3239107d10947067',1,'uint256_t']]]
 ];
diff --git a/search/functions_2.js b/search/functions_2.js
index 139772b73..1a2522a57 100644
--- a/search/functions_2.js
+++ b/search/functions_2.js
@@ -1,76 +1,32 @@
 var searchData=
 [
-  ['b_0',['b',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/params.html',0,'std::extreme_value_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/params.html',0,'std::uniform_real_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/params.html',0,'std::weibull_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/params.html',0,'std::uniform_int_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/params.html',0,'std::cauchy_distribution::b()']]],
-  ['babylonian_5fmethod_1',['babylonian_method',['../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309',1,'numerical_methods']]],
-  ['back_2',['back',['http://en.cppreference.com/w/cpp/container/dynarray/back.html',0,'std::dynarray::back()'],['http://en.cppreference.com/w/cpp/container/vector/back.html',0,'std::vector::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::string::back()'],['http://en.cppreference.com/w/cpp/container/deque/back.html',0,'std::deque::back()'],['http://en.cppreference.com/w/cpp/container/queue/back.html',0,'std::queue::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::basic_string::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::wstring::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::u16string::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::u32string::back()'],['http://en.cppreference.com/w/cpp/container/list/back.html',0,'std::list::back()'],['http://en.cppreference.com/w/cpp/container/array/back.html',0,'std::array::back()']]],
-  ['back_5finserter_3',['back_inserter',['http://en.cppreference.com/w/cpp/iterator/back_inserter.html',0,'std']]],
-  ['bad_4',['bad',['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::fstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ios::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_fstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::iostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wistream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::stringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wifstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_istream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::strstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_stringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istrstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wiostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_istringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ifstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostrstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wfstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_iostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wstringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wistringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ifstream::bad()']]],
-  ['bad_5falloc_5',['bad_alloc',['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_alloc']]],
-  ['bad_5farray_5flength_6',['bad_array_length',['http://en.cppreference.com/w/cpp/memory/new/bad_array_length.html',0,'std::bad_array_length']]],
-  ['bad_5farray_5fnew_5flength_7',['bad_array_new_length',['http://en.cppreference.com/w/cpp/memory/new/bad_array_new_length/bad_array_new_length.html',0,'std::bad_array_new_length']]],
-  ['bad_5fcast_8',['bad_cast',['http://en.cppreference.com/w/cpp/types/bad_cast/bad_cast.html',0,'std::bad_cast']]],
-  ['bad_5ffunction_5fcall_9',['bad_function_call',['http://en.cppreference.com/w/cpp/utility/functional/bad_function_call.html',0,'std::bad_function_call']]],
-  ['bad_5foptional_5faccess_10',['bad_optional_access',['http://en.cppreference.com/w/cpp/utility/bad_optional_access.html',0,'std::bad_optional_access']]],
-  ['bad_5ftypeid_11',['bad_typeid',['http://en.cppreference.com/w/cpp/types/bad_typeid/bad_typeid.html',0,'std::bad_typeid']]],
-  ['bad_5fweak_5fptr_12',['bad_weak_ptr',['http://en.cppreference.com/w/cpp/memory/bad_weak_ptr/bad_weak_ptr.html',0,'std::bad_weak_ptr']]],
-  ['base_13',['base',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::ranlux48::base()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::discard_block_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/base.html',0,'std::independent_bits_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/base.html',0,'std::shuffle_order_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::ranlux24::base()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/base.html',0,'std::knuth_b::base()']]],
-  ['basic_5ffilebuf_14',['basic_filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::basic_filebuf']]],
-  ['basic_5ffstream_15',['basic_fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::basic_fstream']]],
-  ['basic_5fifstream_16',['basic_ifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::basic_ifstream']]],
-  ['basic_5fios_17',['basic_ios',['http://en.cppreference.com/w/cpp/io/basic_ios/basic_ios.html',0,'std::basic_ios']]],
-  ['basic_5fiostream_18',['basic_iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream/basic_iostream.html',0,'std::basic_iostream']]],
-  ['basic_5fistream_19',['basic_istream',['http://en.cppreference.com/w/cpp/io/basic_istream/basic_istream.html',0,'std::basic_istream']]],
-  ['basic_5fistringstream_20',['basic_istringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::basic_istringstream']]],
-  ['basic_5fofstream_21',['basic_ofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream/basic_ofstream.html',0,'std::basic_ofstream']]],
-  ['basic_5fostream_22',['basic_ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream/basic_ostream.html',0,'std::basic_ostream']]],
-  ['basic_5fostringstream_23',['basic_ostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::basic_ostringstream']]],
-  ['basic_5fregex_24',['basic_regex',['http://en.cppreference.com/w/cpp/regex/basic_regex/basic_regex.html',0,'std::basic_regex']]],
-  ['basic_5fstreambuf_25',['basic_streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/basic_streambuf.html',0,'std::basic_streambuf']]],
-  ['basic_5fstring_26',['basic_string',['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::basic_string']]],
-  ['basic_5fstringbuf_27',['basic_stringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::basic_stringbuf']]],
-  ['basic_5fstringstream_28',['basic_stringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::basic_stringstream']]],
-  ['batch_5fpredict_29',['batch_predict',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a88bf9023ab3d4cdb61cf707c7cdfc86b',1,'machine_learning::neural_network::NeuralNetwork']]],
-  ['bayes_5fagivenb_30',['bayes_AgivenB',['../d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba',1,'bayes_theorem.cpp']]],
-  ['bayes_5fbgivena_31',['bayes_BgivenA',['../d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f',1,'bayes_theorem.cpp']]],
-  ['before_32',['before',['http://en.cppreference.com/w/cpp/types/type_info/before.html',0,'std::type_info']]],
-  ['before_5fbegin_33',['before_begin',['http://en.cppreference.com/w/cpp/container/forward_list/before_begin.html',0,'std::forward_list']]],
-  ['begin_34',['begin',['http://en.cppreference.com/w/cpp/container/dynarray/begin.html',0,'std::dynarray::begin()'],['http://en.cppreference.com/w/cpp/container/vector/begin.html',0,'std::vector::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::match_results::begin()'],['http://en.cppreference.com/w/cpp/container/multiset/begin.html',0,'std::multiset::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::string::begin()'],['http://en.cppreference.com/w/cpp/container/set/begin.html',0,'std::set::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_map/begin.html',0,'std::unordered_map::begin()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/begin.html',0,'std::initializer_list::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wsmatch::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::smatch::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin.html',0,'std::unordered_multimap::begin()'],['http://en.cppreference.com/w/cpp/container/forward_list/begin.html',0,'std::forward_list::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wcmatch::begin()'],['http://en.cppreference.com/w/cpp/container/deque/begin.html',0,'std::deque::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::basic_string::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::wstring::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin.html',0,'std::unordered_multiset::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u16string::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u32string::begin()'],['http://en.cppreference.com/w/cpp/container/list/begin.html',0,'std::list::begin()'],['http://en.cppreference.com/w/cpp/container/map/begin.html',0,'std::map::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::cmatch::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin.html',0,'std::unordered_set::begin()'],['http://en.cppreference.com/w/cpp/container/multimap/begin.html',0,'std::multimap::begin()'],['http://en.cppreference.com/w/cpp/container/array/begin.html',0,'std::array::begin()'],['http://en.cppreference.com/w/cpp/iterator/begin.html',0,'std::begin()']]],
-  ['begin_28int_29_35',['begin(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/begin2.html',0,'std::unordered_map::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin2.html',0,'std::unordered_multimap::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin2.html',0,'std::unordered_multiset::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin2.html',0,'std::unordered_set::begin(int)()']]],
-  ['bernoulli_5fdistribution_36',['bernoulli_distribution',['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/bernoulli_distribution.html',0,'std::bernoulli_distribution']]],
-  ['beta_37',['beta',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/params.html',0,'std::gamma_distribution']]],
-  ['bfs_38',['bfs',['../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93',1,'graph::HKGraph']]],
-  ['bidijkstra_39',['Bidijkstra',['../d7/d07/bidirectional__dijkstra_8cpp.html#a1b2df3d52a403ad46523ab90d3a723c1',1,'graph::bidirectional_dijkstra']]],
-  ['binary_5fnegate_40',['binary_negate',['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std::binary_negate']]],
-  ['binary_5fs_41',['binary_s',['../d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae',1,'exponential_search.cpp']]],
-  ['binary_5fsearch_42',['binary_search',['http://en.cppreference.com/w/cpp/algorithm/binary_search.html',0,'std::binary_search()'],['../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd',1,'sorting::binary_search()']]],
-  ['binary_5fsearch_5ftree_43',['binary_search_tree',['../d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6',1,'binary_search_tree']]],
-  ['binarysearch_44',['BinarySearch',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf',1,'data_structures::list_array::list']]],
-  ['binarytree_45',['BinaryTree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree(int64_t data)']]],
-  ['bind_46',['bind',['http://en.cppreference.com/w/cpp/utility/functional/bind.html',0,'std']]],
-  ['binexpo_47',['binExpo',['../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73',1,'binExpo():&#160;binary_exponent.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a1c62a87e79f29b98d8fe5b12eacdd928',1,'math::modular_inverse_fermat::binExpo()']]],
-  ['binexpo_5falt_48',['binExpo_alt',['../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f',1,'binary_exponent.cpp']]],
-  ['binomial_5fdistribution_49',['binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/binomial_distribution.html',0,'std::binomial_distribution']]],
-  ['binomial_5fexpected_50',['binomial_expected',['../d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813',1,'binomial_dist.cpp']]],
-  ['binomial_5frange_5fsuccesses_51',['binomial_range_successes',['../d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25',1,'binomial_dist.cpp']]],
-  ['binomial_5fstandard_5fdeviation_52',['binomial_standard_deviation',['../d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc',1,'binomial_dist.cpp']]],
-  ['binomial_5fvariance_53',['binomial_variance',['../d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861',1,'binomial_dist.cpp']]],
-  ['binomial_5fx_5fsuccesses_54',['binomial_x_successes',['../d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76',1,'binomial_dist.cpp']]],
-  ['binomialcoeffsum_55',['binomialCoeffSum',['../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea',1,'math']]],
-  ['bitcount_56',['bitCount',['../d4/d48/hamming__distance_8cpp.html#a65d845df3fecff7087a2126c7b72030b',1,'bit_manipulation::hamming_distance']]],
-  ['bitset_57',['Bitset',['../d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130',1,'data_structures::Bitset']]],
-  ['bitset_58',['bitset',['http://en.cppreference.com/w/cpp/utility/bitset/bitset.html',0,'std::bitset']]],
-  ['bloomfilter_59',['BloomFilter',['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a',1,'data_structures::BloomFilter']]],
-  ['boolalpha_60',['boolalpha',['http://en.cppreference.com/w/cpp/io/manip/boolalpha.html',0,'std']]],
-  ['boruvkas_61',['boruvkas',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]],
-  ['bottom_62',['bottom',['../d2/dc8/classdata__structures_1_1_stack.html#a2ac469fcc2229d273450e429139d90e6',1,'data_structures::Stack']]],
-  ['breadth_5ffirst_5fsearch_63',['breadth_first_search',['../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981',1,'graph::Graph']]],
-  ['brute_5fforce_64',['brute_force',['../d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8',1,'string_search']]],
-  ['bsearch_65',['bsearch',['http://en.cppreference.com/w/cpp/algorithm/bsearch.html',0,'std']]],
-  ['bst_5fnode_66',['bst_node',['../dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778',1,'binary_search_tree::bst_node']]],
-  ['btowc_67',['btowc',['http://en.cppreference.com/w/cpp/string/multibyte/btowc.html',0,'std']]],
-  ['bubble_5fsort_68',['bubble_sort',['../d8/d13/bubble__sort_8cpp.html#af3b12930a83915712461d53fe9659686',1,'sorting::bubble_sort']]],
-  ['bucket_69',['bucket',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket.html',0,'std::unordered_map::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket.html',0,'std::unordered_multimap::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket.html',0,'std::unordered_multiset::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket.html',0,'std::unordered_set::bucket()']]],
-  ['bucket_5fcount_70',['bucket_count',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket_count.html',0,'std::unordered_map::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket_count.html',0,'std::unordered_multimap::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket_count.html',0,'std::unordered_multiset::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket_count.html',0,'std::unordered_set::bucket_count()']]],
-  ['bucket_5fsize_71',['bucket_size',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket_size.html',0,'std::unordered_map::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket_size.html',0,'std::unordered_multimap::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket_size.html',0,'std::unordered_multiset::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket_size.html',0,'std::unordered_set::bucket_size()']]],
-  ['build_72',['build',['../d1/d9e/prefix__sum__array_8cpp.html#ab36151479ad37d53ef9fcb60a274b1d9',1,'range_queries::prefix_sum_array']]]
+  ['babylonian_5fmethod_0',['babylonian_method',['../d1/de0/namespacenumerical__methods.html#a28e67885f8606564cc8335f483f63309',1,'numerical_methods']]],
+  ['batch_5fpredict_1',['batch_predict',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a88bf9023ab3d4cdb61cf707c7cdfc86b',1,'machine_learning::neural_network::NeuralNetwork']]],
+  ['bayes_5fagivenb_2',['bayes_AgivenB',['../d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba',1,'bayes_theorem.cpp']]],
+  ['bayes_5fbgivena_3',['bayes_BgivenA',['../d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f',1,'bayes_theorem.cpp']]],
+  ['bfs_4',['bfs',['../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93',1,'graph::HKGraph']]],
+  ['bidijkstra_5',['Bidijkstra',['../d7/d07/bidirectional__dijkstra_8cpp.html#a1b2df3d52a403ad46523ab90d3a723c1',1,'graph::bidirectional_dijkstra']]],
+  ['binary_5fs_6',['binary_s',['../d8/d8a/exponential__search_8cpp.html#ab06cedad209456eae95d37b7cd66acae',1,'exponential_search.cpp']]],
+  ['binary_5fsearch_7',['binary_search',['../d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd',1,'sorting']]],
+  ['binary_5fsearch_5ftree_8',['binary_search_tree',['../d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6',1,'binary_search_tree']]],
+  ['binarysearch_9',['BinarySearch',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf',1,'data_structures::list_array::list']]],
+  ['binarytree_10',['BinaryTree',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree()'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree(int64_t data)']]],
+  ['binexpo_11',['binExpo',['../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73',1,'binExpo():&#160;binary_exponent.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a1c62a87e79f29b98d8fe5b12eacdd928',1,'math::modular_inverse_fermat::binExpo()']]],
+  ['binexpo_5falt_12',['binExpo_alt',['../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f',1,'binary_exponent.cpp']]],
+  ['binomial_5fexpected_13',['binomial_expected',['../d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813',1,'binomial_dist.cpp']]],
+  ['binomial_5frange_5fsuccesses_14',['binomial_range_successes',['../d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25',1,'binomial_dist.cpp']]],
+  ['binomial_5fstandard_5fdeviation_15',['binomial_standard_deviation',['../d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc',1,'binomial_dist.cpp']]],
+  ['binomial_5fvariance_16',['binomial_variance',['../d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861',1,'binomial_dist.cpp']]],
+  ['binomial_5fx_5fsuccesses_17',['binomial_x_successes',['../d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76',1,'binomial_dist.cpp']]],
+  ['binomialcoeffsum_18',['binomialCoeffSum',['../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea',1,'math']]],
+  ['bitcount_19',['bitCount',['../d4/d48/hamming__distance_8cpp.html#a65d845df3fecff7087a2126c7b72030b',1,'bit_manipulation::hamming_distance']]],
+  ['bitset_20',['Bitset',['../d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130',1,'data_structures::Bitset']]],
+  ['bloomfilter_21',['BloomFilter',['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a',1,'data_structures::BloomFilter']]],
+  ['boruvkas_22',['boruvkas',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a94c615fc66b72e0adbcbcb99aabb1a59',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]],
+  ['bottom_23',['bottom',['../d2/dc8/classdata__structures_1_1_stack.html#a2ac469fcc2229d273450e429139d90e6',1,'data_structures::Stack']]],
+  ['breadth_5ffirst_5fsearch_24',['breadth_first_search',['../dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981',1,'graph::Graph']]],
+  ['brute_5fforce_25',['brute_force',['../d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8',1,'string_search']]],
+  ['bst_5fnode_26',['bst_node',['../dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778',1,'binary_search_tree::bst_node']]],
+  ['bubble_5fsort_27',['bubble_sort',['../d8/d13/bubble__sort_8cpp.html#af3b12930a83915712461d53fe9659686',1,'sorting::bubble_sort']]],
+  ['build_28',['build',['../d1/d9e/prefix__sum__array_8cpp.html#ab36151479ad37d53ef9fcb60a274b1d9',1,'range_queries::prefix_sum_array']]]
 ];
diff --git a/search/functions_3.js b/search/functions_3.js
index 6a114246a..dfbc39480 100644
--- a/search/functions_3.js
+++ b/search/functions_3.js
@@ -1,112 +1,59 @@
 var searchData=
 [
-  ['c16rtomb_0',['c16rtomb',['http://en.cppreference.com/w/cpp/string/multibyte/c16rtomb.html',0,'std']]],
-  ['c32rtomb_1',['c32rtomb',['http://en.cppreference.com/w/cpp/string/multibyte/c32rtomb.html',0,'std']]],
-  ['c_5fstr_2',['c_str',['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::basic_string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::wstring::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::u16string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::u32string::c_str()']]],
-  ['calculate_3',['calculate',['../d8/db1/binomial__calculate_8cpp.html#aae407a2a13362c4c64fbe509ff325978',1,'math::binomial']]],
-  ['call_5fonce_4',['call_once',['http://en.cppreference.com/w/cpp/thread/call_once.html',0,'std']]],
-  ['calloc_5',['calloc',['http://en.cppreference.com/w/cpp/memory/c/calloc.html',0,'std']]],
-  ['can_5fjump_6',['can_jump',['../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502',1,'greedy_algorithms']]],
-  ['canimove_7',['CanIMove',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9',1,'backtracking::n_queens_optimized::CanIMove()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aea343d8a72a39c9a4c0fbcbc362f2648',1,'backtracking::n_queens_all_solutions::CanIMove()']]],
-  ['capacity_8',['capacity',['http://en.cppreference.com/w/cpp/container/vector/capacity.html',0,'std::vector::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::basic_string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::wstring::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u16string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u32string::capacity()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c',1,'others::Cache::LFUCache::capacity()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a',1,'others::Cache::LRUCache::capacity()']]],
-  ['category_9',['category',['http://en.cppreference.com/w/cpp/error/error_code/category.html',0,'std::error_code::category()'],['http://en.cppreference.com/w/cpp/error/error_condition/category.html',0,'std::error_condition::category()']]],
-  ['cauchy_5fdistribution_10',['cauchy_distribution',['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/cauchy_distribution.html',0,'std::cauchy_distribution']]],
-  ['cbefore_5fbegin_11',['cbefore_begin',['http://en.cppreference.com/w/cpp/container/forward_list/before_begin.html',0,'std::forward_list']]],
-  ['cbegin_12',['cbegin',['http://en.cppreference.com/w/cpp/container/dynarray/begin.html',0,'std::dynarray::cbegin()'],['http://en.cppreference.com/w/cpp/container/vector/begin.html',0,'std::vector::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::match_results::cbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/begin.html',0,'std::multiset::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::string::cbegin()'],['http://en.cppreference.com/w/cpp/container/set/begin.html',0,'std::set::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_map/begin.html',0,'std::unordered_map::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wsmatch::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::smatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin.html',0,'std::unordered_multimap::cbegin()'],['http://en.cppreference.com/w/cpp/container/forward_list/begin.html',0,'std::forward_list::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wcmatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/deque/begin.html',0,'std::deque::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::basic_string::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::wstring::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin.html',0,'std::unordered_multiset::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u16string::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u32string::cbegin()'],['http://en.cppreference.com/w/cpp/container/list/begin.html',0,'std::list::cbegin()'],['http://en.cppreference.com/w/cpp/container/map/begin.html',0,'std::map::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::cmatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin.html',0,'std::unordered_set::cbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/begin.html',0,'std::multimap::cbegin()'],['http://en.cppreference.com/w/cpp/container/array/begin.html',0,'std::array::cbegin()']]],
-  ['cbegin_28int_29_13',['cbegin(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/begin2.html',0,'std::unordered_map::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin2.html',0,'std::unordered_multimap::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin2.html',0,'std::unordered_multiset::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin2.html',0,'std::unordered_set::cbegin(int)()']]],
-  ['cbrt_14',['cbrt',['http://en.cppreference.com/w/cpp/numeric/math/cbrt.html',0,'std']]],
-  ['ceil_15',['ceil',['http://en.cppreference.com/w/cpp/numeric/math/ceil.html',0,'std']]],
-  ['cend_16',['cend',['http://en.cppreference.com/w/cpp/container/dynarray/end.html',0,'std::dynarray::cend()'],['http://en.cppreference.com/w/cpp/container/vector/end.html',0,'std::vector::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::match_results::cend()'],['http://en.cppreference.com/w/cpp/container/multiset/end.html',0,'std::multiset::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::string::cend()'],['http://en.cppreference.com/w/cpp/container/set/end.html',0,'std::set::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_map/end.html',0,'std::unordered_map::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wsmatch::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::smatch::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end.html',0,'std::unordered_multimap::cend()'],['http://en.cppreference.com/w/cpp/container/forward_list/end.html',0,'std::forward_list::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wcmatch::cend()'],['http://en.cppreference.com/w/cpp/container/deque/end.html',0,'std::deque::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::basic_string::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::wstring::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end.html',0,'std::unordered_multiset::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u16string::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u32string::cend()'],['http://en.cppreference.com/w/cpp/container/list/end.html',0,'std::list::cend()'],['http://en.cppreference.com/w/cpp/container/map/end.html',0,'std::map::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::cmatch::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end.html',0,'std::unordered_set::cend()'],['http://en.cppreference.com/w/cpp/container/multimap/end.html',0,'std::multimap::cend()'],['http://en.cppreference.com/w/cpp/container/array/end.html',0,'std::array::cend()']]],
-  ['cend_28int_29_17',['cend(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/end2.html',0,'std::unordered_map::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end2.html',0,'std::unordered_multimap::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end2.html',0,'std::unordered_multiset::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end2.html',0,'std::unordered_set::cend(int)()']]],
-  ['chain_5fquery_18',['chain_query',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24',1,'range_queries::heavy_light_decomposition::HLD']]],
-  ['change_19',['change',['../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579',1,'rungekutta.cpp']]],
-  ['change_5froot_20',['change_root',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0',1,'range_queries::heavy_light_decomposition::Tree']]],
-  ['char_5fto_5fint_21',['char_to_int',['../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988',1,'data_structures::trie']]],
-  ['char_5fto_5fmorse_22',['char_to_morse',['../d8/d76/morse__code_8cpp.html#ab31773fd11555d21f70d6914138d9535',1,'ciphers::morse']]],
-  ['check_23',['check',['../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a',1,'dynamic_programming::word_break']]],
-  ['check_5fall_5fzeros_24',['check_all_zeros',['../d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a',1,'math::gcd_of_n_numbers']]],
-  ['check_5fif_5fequal_25',['check_if_equal',['../d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd',1,'string_search']]],
-  ['check_5fsize_5fmatch_26',['check_size_match',['../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56',1,'machine_learning::adaline']]],
-  ['check_5ftermination_27',['check_termination',['../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377',1,'durand_kerner_roots.cpp']]],
-  ['checkbipartite_28',['checkBipartite',['../df/dce/namespacegraph.html#a8e1b547cd407c0774e63f0dc95cda9e7',1,'graph']]],
-  ['chi_5fsquared_5fdistribution_29',['chi_squared_distribution',['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/chi_squared_distribution.html',0,'std::chi_squared_distribution']]],
-  ['circle_30',['circle',['../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903',1,'smallest_circle.cpp']]],
-  ['circle_5farea_31',['circle_area',['../dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75',1,'math']]],
-  ['circle_5fperimeter_32',['circle_perimeter',['../dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953',1,'math']]],
-  ['circularlinkedlist_33',['CircularLinkedList',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a142fa439b102c6f86341f421ddcfe0a1',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList(const CircularLinkedList &amp;copy)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList(CircularLinkedList &amp;&amp;source) noexcept']]],
-  ['classic_34',['classic',['http://en.cppreference.com/w/cpp/locale/locale/classic.html',0,'std::locale']]],
-  ['clear_35',['clear',['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::fstream::clear()'],['http://en.cppreference.com/w/cpp/container/vector/clear.html',0,'std::vector::clear()'],['http://en.cppreference.com/w/cpp/container/multiset/clear.html',0,'std::multiset::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wostream::clear()'],['http://en.cppreference.com/w/cpp/container/set/clear.html',0,'std::set::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ostringstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_map/clear.html',0,'std::unordered_map::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ios::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_fstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::iostream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wistream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::stringstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/clear.html',0,'std::unordered_multimap::clear()'],['http://en.cppreference.com/w/cpp/container/forward_list/clear.html',0,'std::forward_list::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostream::clear()'],['http://en.cppreference.com/w/cpp/error/error_code/clear.html',0,'std::error_code::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wifstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_istream::clear()'],['http://en.cppreference.com/w/cpp/container/deque/clear.html',0,'std::deque::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::strstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_stringstream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::basic_string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wostringstream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::wstring::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istrstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/clear.html',0,'std::unordered_multiset::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ostream::clear()'],['http://en.cppreference.com/w/cpp/error/error_condition/clear.html',0,'std::error_condition::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::u16string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wiostream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::u32string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_istringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ifstream::clear()'],['http://en.cppreference.com/w/cpp/container/list/clear.html',0,'std::list::clear()'],['http://en.cppreference.com/w/cpp/container/map/clear.html',0,'std::map::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostrstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_set/clear.html',0,'std::unordered_set::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wfstream::clear()'],['http://en.cppreference.com/w/cpp/container/multimap/clear.html',0,'std::multimap::clear()'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/clear.html',0,'std::atomic_flag::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_iostream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wstringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wistringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ifstream::clear()'],['../db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375',1,'queue::clear()'],['../d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092',1,'stack::clear()']]],
-  ['clearerr_36',['clearerr',['http://en.cppreference.com/w/cpp/io/c/clearerr.html',0,'std']]],
-  ['clock_37',['clock',['http://en.cppreference.com/w/cpp/chrono/c/clock.html',0,'std']]],
-  ['close_38',['close',['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::basic_ofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::fstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::basic_filebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::basic_fstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::wfilebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::wifstream::close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages_byname::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::filebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::ofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::basic_ifstream::close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::wfstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::wofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::ifstream::close()']]],
-  ['cmatch_39',['cmatch',['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::cmatch']]],
-  ['code_40',['code',['http://en.cppreference.com/w/cpp/thread/future_error/code.html',0,'std::future_error::code()'],['http://en.cppreference.com/w/cpp/regex/regex_error/code.html',0,'std::regex_error::code()'],['http://en.cppreference.com/w/cpp/error/system_error/code.html',0,'std::system_error::code()']]],
-  ['codec_41',['codec',['../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa',1,'ciphers::HillCipher']]],
-  ['codecvt_42',['codecvt',['http://en.cppreference.com/w/cpp/locale/codecvt/codecvt.html',0,'std::codecvt']]],
-  ['codecvt_5fbyname_43',['codecvt_byname',['http://en.cppreference.com/w/cpp/locale/codecvt_byname.html',0,'std::codecvt_byname']]],
-  ['collate_44',['collate',['http://en.cppreference.com/w/cpp/locale/collate/collate.html',0,'std::collate']]],
-  ['collate_5fbyname_45',['collate_byname',['http://en.cppreference.com/w/cpp/locale/collate_byname.html',0,'std::collate_byname']]],
-  ['comb_46',['comb',['../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841',1,'data_structures::SegmentTree']]],
-  ['combine_47',['combine',['http://en.cppreference.com/w/cpp/locale/locale/combine.html',0,'std::locale::combine()'],['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74',1,'range_queries::heavy_light_decomposition::SG::combine()']]],
-  ['combsort_48',['CombSort',['../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f',1,'comb_sort.cpp']]],
-  ['compare_49',['compare',['http://en.cppreference.com/w/cpp/string/char_traits/compare.html',0,'std::char_traits::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::string::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::wcsub_match::compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate_byname::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::wssub_match::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::csub_match::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::ssub_match::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::basic_string::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::wstring::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::u16string::compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::u32string::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::sub_match::compare()'],['../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c',1,'compare():&#160;shell_sort2.cpp']]],
-  ['compare_5fexchange_5fstrong_50',['compare_exchange_strong',['http://en.cppreference.com/w/cpp/atomic/atomic/compare_exchange.html',0,'std::atomic']]],
-  ['compare_5fexchange_5fweak_51',['compare_exchange_weak',['http://en.cppreference.com/w/cpp/atomic/atomic/compare_exchange.html',0,'std::atomic']]],
-  ['complex_52',['Complex',['../da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867',1,'Complex::Complex(double x=0.f, double y=0.f, bool is_polar=false)'],['../da/d5a/class_complex.html#a466cd7b664cc6a864937ceb3dead1323',1,'Complex::Complex(const Complex &amp;other)']]],
-  ['complex_53',['complex',['http://en.cppreference.com/w/cpp/numeric/complex/complex.html',0,'std::complex']]],
-  ['complex_5fstr_54',['complex_str',['../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c',1,'durand_kerner_roots.cpp']]],
-  ['compute_5fpadded_5fsize_55',['compute_padded_size',['../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27',1,'hashing::sha256']]],
-  ['computefactorialsmod_56',['computeFactorialsMod',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#ab5744fa589f6a48f9fe7bca13dbe661f',1,'math::ncr_modulo_p::NCRModuloP']]],
-  ['condition_5fvariable_57',['condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable/condition_variable.html',0,'std::condition_variable']]],
-  ['condition_5fvariable_5fany_58',['condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/condition_variable_any.html',0,'std::condition_variable_any']]],
-  ['cone_5fvolume_59',['cone_volume',['../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7',1,'math']]],
-  ['const_5fpointer_5fcast_60',['const_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]],
-  ['constree_61',['ConsTree',['../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696',1,'segtree.cpp']]],
-  ['construct_62',['construct',['http://en.cppreference.com/w/cpp/memory/allocator_traits/construct.html',0,'std::allocator_traits::construct()'],['http://en.cppreference.com/w/cpp/memory/allocator/construct.html',0,'std::allocator::construct()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/construct.html',0,'std::scoped_allocator_adaptor::construct()'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4',1,'range_queries::perSegTree::construct(const uint32_t &amp;i, const uint32_t &amp;j)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3',1,'range_queries::perSegTree::construct(const std::vector&lt; int64_t &gt; &amp;vec)']]],
-  ['contains_63',['Contains',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f',1,'data_structures::tree_234::Node']]],
-  ['contains_64',['contains',['../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2',1,'binary_search_tree::contains(std::unique_ptr&lt; bst_node &gt; &amp;node, T value)'],['../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63',1,'binary_search_tree::contains(T value)'],['../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac',1,'data_structures::Bitset::contains()'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b',1,'data_structures::BloomFilter::contains()']]],
-  ['converted_65',['converted',['http://en.cppreference.com/w/cpp/locale/wstring_convert/converted.html',0,'std::wstring_convert']]],
-  ['convexhull_66',['Convexhull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870',1,'geometry::jarvis::Convexhull']]],
-  ['copy_67',['copy',['http://en.cppreference.com/w/cpp/string/char_traits/copy.html',0,'std::char_traits::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::basic_string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::wstring::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u16string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u32string::copy()'],['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std::copy()']]],
-  ['copy_5fall_5fnodes_68',['copy_all_nodes',['../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511',1,'data_structures::linked_list']]],
-  ['copy_5fbackward_69',['copy_backward',['http://en.cppreference.com/w/cpp/algorithm/copy_backward.html',0,'std']]],
-  ['copy_5fif_70',['copy_if',['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std']]],
-  ['copy_5fn_71',['copy_n',['http://en.cppreference.com/w/cpp/algorithm/copy_n.html',0,'std']]],
-  ['copyfmt_72',['copyfmt',['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ios::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::strstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wiostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wfstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wstringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ifstream::copyfmt()']]],
-  ['copysign_73',['copysign',['http://en.cppreference.com/w/cpp/numeric/math/copysign.html',0,'std']]],
-  ['cos_74',['cos',['http://en.cppreference.com/w/cpp/numeric/math/cos.html',0,'std']]],
-  ['cosh_75',['cosh',['http://en.cppreference.com/w/cpp/numeric/math/cosh.html',0,'std']]],
-  ['count_76',['count',['http://en.cppreference.com/w/cpp/container/multiset/count.html',0,'std::multiset::count()'],['http://en.cppreference.com/w/cpp/container/set/count.html',0,'std::set::count()'],['http://en.cppreference.com/w/cpp/container/unordered_map/count.html',0,'std::unordered_map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/count.html',0,'std::unordered_multimap::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::minutes::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::seconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::duration::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::milliseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::hours::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::microseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::nanoseconds::count()'],['http://en.cppreference.com/w/cpp/utility/bitset/count.html',0,'std::bitset::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/count.html',0,'std::unordered_multiset::count()'],['http://en.cppreference.com/w/cpp/container/map/count.html',0,'std::map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/count.html',0,'std::unordered_set::count()'],['http://en.cppreference.com/w/cpp/container/multimap/count.html',0,'std::multimap::count()'],['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std::count(T... args)']]],
-  ['count_5fif_77',['count_if',['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std']]],
-  ['countbitsflip_78',['countBitsFlip',['../d7/d56/count__bits__flip_8cpp.html#a2548486b6c3b80101e768562e687ef7b',1,'bit_manipulation::count_bits_flip']]],
-  ['countinversion_79',['countInversion',['../d2/d26/count__inversions_8cpp.html#a3332498eabf6579ef059c0d0e9f4ec80',1,'sorting::inversion']]],
-  ['countsetbits_80',['countSetBits',['../da/db8/count__of__set__bits_8cpp.html#a86c98dc299e4db28b73e08309d977e62',1,'bit_manipulation::count_of_set_bits']]],
-  ['crbegin_81',['crbegin',['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::crbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::crbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::crbegin()'],['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::crbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::crbegin()'],['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::crbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::crbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::crbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::crbegin()']]],
-  ['create_5fhash_82',['create_hash',['../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8',1,'string_search']]],
-  ['create_5flist_83',['create_list',['../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5',1,'hash_search.cpp']]],
-  ['create_5fmatrix_84',['create_matrix',['../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d',1,'qr_eigen_values.cpp']]],
-  ['create_5fmessage_5fschedule_5farray_85',['create_message_schedule_array',['../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a',1,'hashing::sha256']]],
-  ['create_5frandom_5farray_86',['create_random_array',['../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49',1,'create_random_array(T *arr, int N):&#160;insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49',1,'create_random_array(T *arr, int N):&#160;insertion_sort_recursive.cpp']]],
-  ['createnewnode_87',['createNewNode',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6',1,'others::iterative_tree_traversals::BinaryTree::createNewNode()'],['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114',1,'others::recursive_tree_traversals::BT::createNewNode()']]],
-  ['createnode_88',['createNode',['../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6',1,'avltree.cpp']]],
-  ['createset_89',['CreateSet',['../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec',1,'disjoint_set.cpp']]],
-  ['cref_90',['cref',['http://en.cppreference.com/w/cpp/utility/functional/ref.html',0,'std']]],
-  ['cregex_5fiterator_91',['cregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::cregex_iterator']]],
-  ['cregex_5ftoken_5fiterator_92',['cregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::cregex_token_iterator']]],
-  ['crend_93',['crend',['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::crend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::crend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::crend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::crend()'],['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::crend()'],['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::crend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::crend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::crend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::crend()']]],
-  ['cross_94',['cross',['../df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9',1,'math::vector_cross']]],
-  ['csub_5fmatch_95',['csub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::csub_match']]],
-  ['ctime_96',['ctime',['http://en.cppreference.com/w/cpp/chrono/c/ctime.html',0,'std']]],
-  ['ctype_97',['ctype',['http://en.cppreference.com/w/cpp/locale/ctype/ctype.html',0,'std::ctype']]],
-  ['ctype_5fbyname_98',['ctype_byname',['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname']]],
-  ['cube_5fsurface_5farea_99',['cube_surface_area',['../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c',1,'math']]],
-  ['cube_5fsurface_5fperimeter_100',['cube_surface_perimeter',['../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b',1,'math']]],
-  ['cube_5fvolume_101',['cube_volume',['../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725',1,'math']]],
-  ['cumulative_5fdistribution_102',['cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a',1,'probability::geometric_dist::geometric_distribution']]],
-  ['curr_5fsymbol_103',['curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::curr_symbol()']]],
-  ['current_5fexception_104',['current_exception',['http://en.cppreference.com/w/cpp/error/current_exception.html',0,'std']]],
-  ['cyclesort_105',['cycleSort',['../de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa',1,'sorting::cycle_sort']]],
-  ['cylinder_5fsurface_5farea_106',['cylinder_surface_area',['../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864',1,'math']]],
-  ['cylinder_5fsurface_5fperimeter_107',['cylinder_surface_perimeter',['../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73',1,'math']]],
-  ['cylinder_5fvolume_108',['cylinder_volume',['../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca',1,'math']]]
+  ['calculate_0',['calculate',['../d8/db1/binomial__calculate_8cpp.html#aae407a2a13362c4c64fbe509ff325978',1,'math::binomial']]],
+  ['can_5fjump_1',['can_jump',['../d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502',1,'greedy_algorithms']]],
+  ['canimove_2',['CanIMove',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a9e48455584a4faa33e83dd1891efd9b9',1,'backtracking::n_queens_optimized::CanIMove()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#aea343d8a72a39c9a4c0fbcbc362f2648',1,'backtracking::n_queens_all_solutions::CanIMove()']]],
+  ['capacity_3',['capacity',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#ac27c9076377cbed2a2acc45a189fed2c',1,'others::Cache::LFUCache::capacity()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#af8edfe5a7def5d5b846463041c33136a',1,'others::Cache::LRUCache::capacity()']]],
+  ['chain_5fquery_4',['chain_query',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a7d5b40c076347a6aabfb37a0590f2f24',1,'range_queries::heavy_light_decomposition::HLD']]],
+  ['change_5',['change',['../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579',1,'rungekutta.cpp']]],
+  ['change_5froot_6',['change_root',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0',1,'range_queries::heavy_light_decomposition::Tree']]],
+  ['char_5fto_5fint_7',['char_to_int',['../d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988',1,'data_structures::trie']]],
+  ['char_5fto_5fmorse_8',['char_to_morse',['../d8/d76/morse__code_8cpp.html#ab31773fd11555d21f70d6914138d9535',1,'ciphers::morse']]],
+  ['check_9',['check',['../d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a',1,'dynamic_programming::word_break']]],
+  ['check_5fall_5fzeros_10',['check_all_zeros',['../d1/d11/gcd__of__n__numbers_8cpp.html#a71b9357c7a722f8208499d9ba573297a',1,'math::gcd_of_n_numbers']]],
+  ['check_5fif_5fequal_11',['check_if_equal',['../d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd',1,'string_search']]],
+  ['check_5fsize_5fmatch_12',['check_size_match',['../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56',1,'machine_learning::adaline']]],
+  ['check_5ftermination_13',['check_termination',['../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377',1,'durand_kerner_roots.cpp']]],
+  ['checkbipartite_14',['checkBipartite',['../df/dce/namespacegraph.html#a8e1b547cd407c0774e63f0dc95cda9e7',1,'graph']]],
+  ['circle_15',['circle',['../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903',1,'smallest_circle.cpp']]],
+  ['circle_5farea_16',['circle_area',['../dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75',1,'math']]],
+  ['circle_5fperimeter_17',['circle_perimeter',['../dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953',1,'math']]],
+  ['circularlinkedlist_18',['CircularLinkedList',['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#aa704319924f97fedfb41caf193a00888',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a142fa439b102c6f86341f421ddcfe0a1',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList(const CircularLinkedList &amp;copy)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::CircularLinkedList(CircularLinkedList &amp;&amp;source) noexcept']]],
+  ['clear_19',['clear',['../db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375',1,'queue::clear()'],['../d1/dc2/classstack.html#a6f13157faa1a762c59e67da8b9516092',1,'stack::clear()']]],
+  ['codec_20',['codec',['../d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa',1,'ciphers::HillCipher']]],
+  ['comb_21',['comb',['../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841',1,'data_structures::SegmentTree']]],
+  ['combine_22',['combine',['../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a41c733f5f5e262b308f7cb95c88c1e74',1,'range_queries::heavy_light_decomposition::SG']]],
+  ['combsort_23',['CombSort',['../d9/dfd/comb__sort_8cpp.html#a0f4e7569090083fb53d5cdeaf0e2974f',1,'comb_sort.cpp']]],
+  ['compare_24',['compare',['../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c',1,'shell_sort2.cpp']]],
+  ['complex_25',['Complex',['../da/d5a/class_complex.html#a3cfc522c782726f49ee20af17b77f867',1,'Complex::Complex(double x=0.f, double y=0.f, bool is_polar=false)'],['../da/d5a/class_complex.html#a466cd7b664cc6a864937ceb3dead1323',1,'Complex::Complex(const Complex &amp;other)']]],
+  ['complex_5fstr_26',['complex_str',['../da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c',1,'durand_kerner_roots.cpp']]],
+  ['compute_5fpadded_5fsize_27',['compute_padded_size',['../d4/d08/sha256_8cpp.html#a28c1c6724dc6bcf91a39818699bbec27',1,'hashing::sha256']]],
+  ['computefactorialsmod_28',['computeFactorialsMod',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#ab5744fa589f6a48f9fe7bca13dbe661f',1,'math::ncr_modulo_p::NCRModuloP']]],
+  ['cone_5fvolume_29',['cone_volume',['../dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7',1,'math']]],
+  ['constree_30',['ConsTree',['../d2/d45/segtree_8cpp.html#ae752659b7c1719d68fdb2ca538a93696',1,'segtree.cpp']]],
+  ['construct_31',['construct',['../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4',1,'range_queries::perSegTree::construct(const uint32_t &amp;i, const uint32_t &amp;j)'],['../d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3',1,'range_queries::perSegTree::construct(const std::vector&lt; int64_t &gt; &amp;vec)']]],
+  ['contains_32',['Contains',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f',1,'data_structures::tree_234::Node']]],
+  ['contains_33',['contains',['../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2',1,'binary_search_tree::contains(std::unique_ptr&lt; bst_node &gt; &amp;node, T value)'],['../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63',1,'binary_search_tree::contains(T value)'],['../d9/dae/classdata__structures_1_1_bitset.html#a9ef54c7c3f6494b36ead3ae2e5cf43ac',1,'data_structures::Bitset::contains()'],['../dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b',1,'data_structures::BloomFilter::contains()']]],
+  ['convexhull_34',['Convexhull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a8306e48040a8570e164c58d1c530f870',1,'geometry::jarvis::Convexhull']]],
+  ['copy_5fall_5fnodes_35',['copy_all_nodes',['../d6/d05/reverse__a__linked__list_8cpp.html#a7f80d9712cc7d77399dcacb4c2917511',1,'data_structures::linked_list']]],
+  ['countbitsflip_36',['countBitsFlip',['../d7/d56/count__bits__flip_8cpp.html#a2548486b6c3b80101e768562e687ef7b',1,'bit_manipulation::count_bits_flip']]],
+  ['countinversion_37',['countInversion',['../d2/d26/count__inversions_8cpp.html#a3332498eabf6579ef059c0d0e9f4ec80',1,'sorting::inversion']]],
+  ['countsetbits_38',['countSetBits',['../da/db8/count__of__set__bits_8cpp.html#a86c98dc299e4db28b73e08309d977e62',1,'bit_manipulation::count_of_set_bits']]],
+  ['create_5fhash_39',['create_hash',['../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8',1,'string_search']]],
+  ['create_5flist_40',['create_list',['../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5',1,'hash_search.cpp']]],
+  ['create_5fmatrix_41',['create_matrix',['../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d',1,'qr_eigen_values.cpp']]],
+  ['create_5fmessage_5fschedule_5farray_42',['create_message_schedule_array',['../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a',1,'hashing::sha256']]],
+  ['create_5frandom_5farray_43',['create_random_array',['../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49',1,'create_random_array(T *arr, int N):&#160;insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#a59914553f24088342c139645a02a8a49',1,'create_random_array(T *arr, int N):&#160;insertion_sort_recursive.cpp']]],
+  ['createnewnode_44',['createNewNode',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6',1,'others::iterative_tree_traversals::BinaryTree::createNewNode()'],['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114',1,'others::recursive_tree_traversals::BT::createNewNode()']]],
+  ['createnode_45',['createNode',['../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6',1,'avltree.cpp']]],
+  ['createset_46',['CreateSet',['../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec',1,'disjoint_set.cpp']]],
+  ['cross_47',['cross',['../df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9',1,'math::vector_cross']]],
+  ['cube_5fsurface_5farea_48',['cube_surface_area',['../dd/d47/namespacemath.html#abc46c784a297fc1d2eb8b33a327fba4c',1,'math']]],
+  ['cube_5fsurface_5fperimeter_49',['cube_surface_perimeter',['../dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b',1,'math']]],
+  ['cube_5fvolume_50',['cube_volume',['../dd/d47/namespacemath.html#ae413098478fa38acaac887b7654f0725',1,'math']]],
+  ['cumulative_5fdistribution_51',['cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a08328dc7d62188427111f176b56a105a',1,'probability::geometric_dist::geometric_distribution']]],
+  ['cyclesort_52',['cycleSort',['../de/d07/cycle__sort_8cpp.html#ae79a9d247691fce0d655fce75f1c04fa',1,'sorting::cycle_sort']]],
+  ['cylinder_5fsurface_5farea_53',['cylinder_surface_area',['../dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864',1,'math']]],
+  ['cylinder_5fsurface_5fperimeter_54',['cylinder_surface_perimeter',['../dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73',1,'math']]],
+  ['cylinder_5fvolume_55',['cylinder_volume',['../dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca',1,'math']]]
 ];
diff --git a/search/functions_4.js b/search/functions_4.js
index 3fde5349c..2b695b514 100644
--- a/search/functions_4.js
+++ b/search/functions_4.js
@@ -1,115 +1,53 @@
 var searchData=
 [
-  ['data_0',['data',['http://en.cppreference.com/w/cpp/container/dynarray/data.html',0,'std::dynarray::data()'],['http://en.cppreference.com/w/cpp/container/vector/data.html',0,'std::vector::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::basic_string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::wstring::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u16string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u32string::data()'],['http://en.cppreference.com/w/cpp/container/array/data.html',0,'std::array::data()']]],
-  ['date_5forder_1',['date_order',['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get::date_order()'],['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get_byname::date_order()']]],
-  ['deallocate_2',['deallocate',['http://en.cppreference.com/w/cpp/memory/allocator_traits/deallocate.html',0,'std::allocator_traits::deallocate()'],['http://en.cppreference.com/w/cpp/memory/allocator/deallocate.html',0,'std::allocator::deallocate()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/deallocate.html',0,'std::scoped_allocator_adaptor::deallocate()'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589',1,'operations_on_datastructures::inorder_traversal_of_bst::deallocate()']]],
-  ['dec_3',['dec',['http://en.cppreference.com/w/cpp/io/manip/hex.html',0,'std']]],
-  ['decimal_5fpoint_4',['decimal_point',['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct_byname::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct_byname::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct::decimal_point()']]],
-  ['declare_5fno_5fpointers_5',['declare_no_pointers',['http://en.cppreference.com/w/cpp/memory/gc/declare_no_pointers.html',0,'std']]],
-  ['declare_5freachable_6',['declare_reachable',['http://en.cppreference.com/w/cpp/memory/gc/declare_reachable.html',0,'std']]],
-  ['declval_7',['declval',['http://en.cppreference.com/w/cpp/utility/declval.html',0,'std']]],
-  ['decreasekey_8',['decreaseKey',['../d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5',1,'MinHeap']]],
-  ['decrypt_9',['decrypt',['../de/db6/a1z26__cipher_8cpp.html#a0a78954e96c862430904ee3e64623c38',1,'ciphers::a1z26::decrypt()'],['../d6/d2c/caesar__cipher_8cpp.html#a355e69511cd2006b5c4c80ae95b71056',1,'ciphers::caesar::decrypt()'],['../d8/d76/morse__code_8cpp.html#a15c66ec8cf4cef0a35c50cbab86965dc',1,'ciphers::morse::decrypt()'],['../dd/d12/vigenere__cipher_8cpp.html#a3cfc3f9b20a0f230a2fcefd31dc6848e',1,'ciphers::vigenere::decrypt()'],['../d3/d4c/xor__cipher_8cpp.html#a6099b7e0f1793f418d2c1befca8355a4',1,'ciphers::XOR::decrypt()']]],
-  ['decrypt_5ftext_10',['decrypt_text',['../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b',1,'ciphers::HillCipher']]],
-  ['default_5fdelete_11',['default_delete',['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete']]],
-  ['default_5ferror_5fcondition_12',['default_error_condition',['http://en.cppreference.com/w/cpp/error/error_code/default_error_condition.html',0,'std::error_code::default_error_condition()'],['http://en.cppreference.com/w/cpp/error/error_category/default_error_condition.html',0,'std::error_category::default_error_condition()']]],
-  ['defaultfloat_13',['defaultfloat',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]],
-  ['degrees_5fto_5fradians_14',['degrees_to_radians',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c',1,'physics::ground_to_ground_projectile_motion']]],
-  ['delete_15',['Delete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aefd24626ac47277431c9b8604e064340',1,'operations_on_datastructures::trie_operations::Tnode']]],
-  ['delete_5fall_5fnodes_16',['delete_all_nodes',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac614ed8f1953f5486fab1cd6d7aa0500',1,'data_structures::linked_list::list']]],
-  ['delete_5fword_17',['delete_word',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75',1,'data_structures::trie_using_hashmap::Trie']]],
-  ['deleteallnodes_18',['deleteAllNodes',['../d8/dee/avltree_8cpp.html#a82659e9e223e520cf91d7e55c4a3f88c',1,'avltree.cpp']]],
-  ['deleteelement_19',['deleteElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0',1,'data_structures::SkipList']]],
-  ['deletefrom_20',['DeleteFrom',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169',1,'operations_on_datastructures::trie_operations::Tnode']]],
-  ['deletekey_21',['deleteKey',['../d2/d05/class_min_heap.html#a37ac126eabb0c3ce04047172abccca29',1,'MinHeap']]],
-  ['deletenode_22',['DeleteNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a273511e84a5243ffffe81be28bd24855',1,'data_structures::tree_234::Tree234']]],
-  ['deletenode_23',['deleteNode',['../d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5',1,'avltree.cpp']]],
-  ['deletestring_24',['deleteString',['../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab',1,'data_structures::trie']]],
-  ['denorm_5fmin_25',['denorm_min',['http://en.cppreference.com/w/cpp/types/numeric_limits/denorm_min.html',0,'std::numeric_limits']]],
-  ['denselayer_26',['DenseLayer',['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a11046825be0b6dbb73fbe834aa49200e',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &amp;neurons, const std::string &amp;activation, const std::pair&lt; size_t, size_t &gt; &amp;kernel_shape, const bool &amp;random_kernel)'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#af136ec31dbd35b1be2eb9a057677c704',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &amp;neurons, const std::string &amp;activation, const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;kernel)'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const DenseLayer &amp;layer)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6c859e3737aa88b29854df0347b29f4e',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(DenseLayer &amp;&amp;)=default']]],
-  ['densities_27',['densities',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/params.html',0,'std::piecewise_constant_distribution::densities()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/params.html',0,'std::piecewise_linear_distribution::densities()']]],
-  ['depth_5ffirst_5fsearch_28',['depth_first_search',['../df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae',1,'graph']]],
-  ['deque_29',['deque',['http://en.cppreference.com/w/cpp/container/deque/deque.html',0,'std::deque']]],
-  ['dequeue_30',['deQueue',['../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85',1,'queue']]],
-  ['dequeue_31',['dequeue',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622',1,'data_structures::queue_using_array::Queue_Array']]],
-  ['destroy_32',['destroy',['http://en.cppreference.com/w/cpp/memory/allocator_traits/destroy.html',0,'std::allocator_traits::destroy()'],['http://en.cppreference.com/w/cpp/memory/allocator/destroy.html',0,'std::allocator::destroy()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/destroy.html',0,'std::scoped_allocator_adaptor::destroy()']]],
-  ['detach_33',['detach',['http://en.cppreference.com/w/cpp/thread/thread/detach.html',0,'std::thread']]],
-  ['determinant_5flu_34',['determinant_lu',['../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f',1,'lu_decomposition.h']]],
-  ['dfs_35',['dfs',['../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0',1,'graph::HKGraph::dfs()'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9',1,'graph::depth_first_search::dfs()'],['../d8/db9/topological__sort_8cpp.html#abcbcaa2bb70af0a11d0c090ea1796aea',1,'graph::topological_sort::dfs()']]],
-  ['dfs_5fhc_36',['dfs_hc',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8',1,'range_queries::heavy_light_decomposition::HLD']]],
-  ['dfs_5flabels_37',['dfs_labels',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8',1,'range_queries::heavy_light_decomposition::HLD']]],
-  ['dfs_5flca_38',['dfs_lca',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4',1,'range_queries::heavy_light_decomposition::Tree']]],
-  ['dfs_5fpar_39',['dfs_par',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a',1,'range_queries::heavy_light_decomposition::HLD']]],
-  ['dfs_5fsize_40',['dfs_size',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460',1,'range_queries::heavy_light_decomposition::Tree']]],
-  ['difftime_41',['difftime',['http://en.cppreference.com/w/cpp/chrono/c/difftime.html',0,'std']]],
-  ['digit_5fchar_42',['digit_char',['../db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac',1,'large_number']]],
-  ['digitseparation_43',['DigitSeparation',['../da/d49/classgreedy__algorithms_1_1_digit_separation.html#afd54c969a6c9bab16b4a064fbc8ed40e',1,'greedy_algorithms::DigitSeparation']]],
-  ['digitseparationforwardorder_44',['digitSeparationForwardOrder',['../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8',1,'greedy_algorithms::DigitSeparation']]],
-  ['digitseparationreverseorder_45',['digitSeparationReverseOrder',['../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79',1,'greedy_algorithms::DigitSeparation']]],
-  ['dijkstra_46',['dijkstra',['../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84',1,'graph::dijkstra()'],['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af915876d0ca33cc71a6a6191a8cd3ccd',1,'greedy_algorithms::dijkstra::dijkstra()']]],
-  ['direction_47',['direction',['../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655',1,'SegmentIntersection']]],
-  ['discard_48',['discard',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937_64::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux24_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux48::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::discard_block_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mersenne_twister_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/discard.html',0,'std::independent_bits_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux48_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::shuffle_order_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux24::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::linear_congruential_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::knuth_b::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand0::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::subtract_with_carry_engine::discard()']]],
-  ['discard_5fblock_5fengine_49',['discard_block_engine',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::discard_block_engine']]],
-  ['discrete_5fdistribution_50',['discrete_distribution',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/discrete_distribution.html',0,'std::discrete_distribution']]],
-  ['display_51',['display',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a1313837c0e9ec67fd9fbd17987e2d615',1,'data_structures::linked_list::list::display()'],['../db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368',1,'queue::display()'],['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631',1,'data_structures::queue_using_array::Queue_Array::display()'],['../d1/dc2/classstack.html#a8bce109630118a34faae717f72986033',1,'stack::display()'],['../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed',1,'hash_chain::display()'],['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53',1,'others::lru_cache::LRUCache::display()'],['../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd',1,'double_hashing::display()'],['../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635',1,'linear_probing::display()'],['../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357',1,'quadratic_probing::display()'],['../d5/d33/gram__schmidt_8cpp.html#ae6b496dce691e04f7f95ba0f0d33a289',1,'numerical_methods::gram_schmidt::display()']]],
-  ['displayelements_52',['displayElements',['../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72',1,'wiggle_sort.cpp']]],
-  ['displaylist_53',['displayList',['../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c',1,'data_structures::SkipList']]],
-  ['distance_54',['distance',['http://en.cppreference.com/w/cpp/iterator/distance.html',0,'std']]],
-  ['div_55',['div',['http://en.cppreference.com/w/cpp/numeric/math/div.html',0,'std']]],
-  ['divide_56',['divide',['../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c',1,'uint128_t::divide()'],['../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1',1,'uint256_t::divide()']]],
-  ['dnfsort_57',['dnfSort',['../d6/d1a/dnf__sort_8cpp.html#a621767fe711db64fe57a2ac4987b11f0',1,'sorting::dnf_sort']]],
-  ['do_5falways_5fnoconv_58',['do_always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::do_always_noconv()']]],
-  ['do_5fclose_59',['do_close',['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages_byname::do_close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages::do_close()']]],
-  ['do_5fcompare_60',['do_compare',['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate_byname::do_compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate::do_compare()']]],
-  ['do_5fcurr_5fsymbol_61',['do_curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::do_curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::do_curr_symbol()']]],
-  ['do_5fdate_5forder_62',['do_date_order',['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get::do_date_order()'],['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get_byname::do_date_order()']]],
-  ['do_5fdecimal_5fpoint_63',['do_decimal_point',['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct_byname::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct_byname::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct::do_decimal_point()']]],
-  ['do_5fencoding_64',['do_encoding',['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_byname::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8_utf16::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf16::do_encoding()']]],
-  ['do_5ffalsename_65',['do_falsename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_falsename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_falsename()']]],
-  ['do_5ffrac_5fdigits_66',['do_frac_digits',['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct_byname::do_frac_digits()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct::do_frac_digits()']]],
-  ['do_5fget_67',['do_get',['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::do_get()']]],
-  ['do_5fget_5fdate_68',['do_get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::do_get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::do_get_date()']]],
-  ['do_5fget_5fmonthname_69',['do_get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::do_get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::do_get_monthname()']]],
-  ['do_5fget_5ftime_70',['do_get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::do_get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::do_get_time()']]],
-  ['do_5fget_5fweekday_71',['do_get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::do_get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::do_get_weekday()']]],
-  ['do_5fget_5fyear_72',['do_get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::do_get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::do_get_year()']]],
-  ['do_5fgrouping_73',['do_grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::do_grouping()']]],
-  ['do_5fhash_74',['do_hash',['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate_byname::do_hash()'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate::do_hash()']]],
-  ['do_5fin_75',['do_in',['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_byname::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8_utf16::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf16::do_in()']]],
-  ['do_5fis_76',['do_is',['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype_byname::do_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype::do_is()']]],
-  ['do_5flength_77',['do_length',['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_byname::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8_utf16::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf16::do_length()']]],
-  ['do_5fmax_5flength_78',['do_max_length',['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_byname::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8_utf16::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf16::do_max_length()']]],
-  ['do_5fnarrow_79',['do_narrow',['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype_byname::do_narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype::do_narrow()']]],
-  ['do_5fneg_5fformat_80',['do_neg_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_neg_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_neg_format()']]],
-  ['do_5fnegative_5fsign_81',['do_negative_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_negative_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_negative_sign()']]],
-  ['do_5fopen_82',['do_open',['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages_byname::do_open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages::do_open()']]],
-  ['do_5fout_83',['do_out',['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_byname::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8_utf16::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf16::do_out()']]],
-  ['do_5fpos_5fformat_84',['do_pos_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_pos_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_pos_format()']]],
-  ['do_5fpositive_5fsign_85',['do_positive_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_positive_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_positive_sign()']]],
-  ['do_5fput_86',['do_put',['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put_byname::do_put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/num_put/put.html',0,'std::num_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/money_put/put.html',0,'std::money_put::do_put()']]],
-  ['do_5fscan_5fis_87',['do_scan_is',['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype_byname::do_scan_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype::do_scan_is()']]],
-  ['do_5fthousands_5fsep_88',['do_thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::do_thousands_sep()']]],
-  ['do_5ftolower_89',['do_tolower',['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype_byname::do_tolower()'],['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype::do_tolower()']]],
-  ['do_5ftoupper_90',['do_toupper',['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype_byname::do_toupper()'],['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype::do_toupper()']]],
-  ['do_5ftransform_91',['do_transform',['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate_byname::do_transform()'],['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate::do_transform()']]],
-  ['do_5ftruename_92',['do_truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_truename()']]],
-  ['do_5funshift_93',['do_unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::do_unshift()']]],
-  ['do_5fwiden_94',['do_widen',['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype_byname::do_widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype::do_widen()']]],
-  ['domain_5ferror_95',['domain_error',['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std::domain_error']]],
-  ['dot_5fproduct_96',['dot_product',['../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d',1,'numerical_methods::gram_schmidt']]],
-  ['double_5ffactorial_5fiterative_97',['double_factorial_iterative',['../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26',1,'double_factorial.cpp']]],
-  ['double_5ffactorial_5frecursive_98',['double_factorial_recursive',['../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d',1,'double_factorial.cpp']]],
-  ['doublehash_99',['doubleHash',['../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200',1,'double_hashing']]],
-  ['draw_5fsample_100',['draw_sample',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3',1,'probability::geometric_dist::geometric_distribution']]],
-  ['drelu_101',['drelu',['../d2/d58/neural__network_8cpp.html#aa69e95a34054d7989bf446f96b2ffaf9',1,'machine_learning::neural_network::activations']]],
-  ['dsigmoid_102',['dsigmoid',['../d2/d58/neural__network_8cpp.html#a76eb66212d577f948a457b6e29d87c46',1,'machine_learning::neural_network::activations']]],
-  ['dsu_103',['dsu',['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)'],['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)']]],
-  ['dtanh_104',['dtanh',['../d2/d58/neural__network_8cpp.html#a2a5e874b9774aa5362dbcf288828b95c',1,'machine_learning::neural_network::activations']]],
-  ['duplicatenumber_105',['duplicateNumber',['../db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88',1,'search::cycle_detection']]],
-  ['durand_5fkerner_5falgo_106',['durand_kerner_algo',['../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd',1,'durand_kerner_roots.cpp']]],
-  ['duration_107',['duration',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::duration']]],
-  ['duration_5fcast_108',['duration_cast',['http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html',0,'std::chrono']]],
-  ['duval_109',['duval',['../d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632',1,'string']]],
-  ['dynamic_5fpointer_5fcast_110',['dynamic_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]],
-  ['dynarray_111',['dynarray',['http://en.cppreference.com/w/cpp/container/dynarray/dynarray.html',0,'std::dynarray']]]
+  ['deallocate_0',['deallocate',['../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
+  ['decreasekey_1',['decreaseKey',['../d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5',1,'MinHeap']]],
+  ['decrypt_2',['decrypt',['../de/db6/a1z26__cipher_8cpp.html#a0a78954e96c862430904ee3e64623c38',1,'ciphers::a1z26::decrypt()'],['../d6/d2c/caesar__cipher_8cpp.html#a355e69511cd2006b5c4c80ae95b71056',1,'ciphers::caesar::decrypt()'],['../d8/d76/morse__code_8cpp.html#a15c66ec8cf4cef0a35c50cbab86965dc',1,'ciphers::morse::decrypt()'],['../dd/d12/vigenere__cipher_8cpp.html#a3cfc3f9b20a0f230a2fcefd31dc6848e',1,'ciphers::vigenere::decrypt()'],['../d3/d4c/xor__cipher_8cpp.html#a6099b7e0f1793f418d2c1befca8355a4',1,'ciphers::XOR::decrypt()']]],
+  ['decrypt_5ftext_3',['decrypt_text',['../d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b',1,'ciphers::HillCipher']]],
+  ['degrees_5fto_5fradians_4',['degrees_to_radians',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ab00e9785fb2670f7af99d6f3d636f87c',1,'physics::ground_to_ground_projectile_motion']]],
+  ['delete_5',['Delete',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#aefd24626ac47277431c9b8604e064340',1,'operations_on_datastructures::trie_operations::Tnode']]],
+  ['delete_5fall_5fnodes_6',['delete_all_nodes',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#ac614ed8f1953f5486fab1cd6d7aa0500',1,'data_structures::linked_list::list']]],
+  ['delete_5fword_7',['delete_word',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ac0bf3d6791cba144b3f539835d835e75',1,'data_structures::trie_using_hashmap::Trie']]],
+  ['deleteallnodes_8',['deleteAllNodes',['../d8/dee/avltree_8cpp.html#a82659e9e223e520cf91d7e55c4a3f88c',1,'avltree.cpp']]],
+  ['deleteelement_9',['deleteElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0',1,'data_structures::SkipList']]],
+  ['deletefrom_10',['DeleteFrom',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#adef6940391f981ab86767775176b7169',1,'operations_on_datastructures::trie_operations::Tnode']]],
+  ['deletekey_11',['deleteKey',['../d2/d05/class_min_heap.html#a37ac126eabb0c3ce04047172abccca29',1,'MinHeap']]],
+  ['deletenode_12',['DeleteNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a273511e84a5243ffffe81be28bd24855',1,'data_structures::tree_234::Tree234']]],
+  ['deletenode_13',['deleteNode',['../d8/dee/avltree_8cpp.html#aa29a7fdc2db1784f5a6e25025ff7cbf5',1,'avltree.cpp']]],
+  ['deletestring_14',['deleteString',['../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab',1,'data_structures::trie']]],
+  ['denselayer_15',['DenseLayer',['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a11046825be0b6dbb73fbe834aa49200e',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &amp;neurons, const std::string &amp;activation, const std::pair&lt; size_t, size_t &gt; &amp;kernel_shape, const bool &amp;random_kernel)'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#af136ec31dbd35b1be2eb9a057677c704',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const int &amp;neurons, const std::string &amp;activation, const std::vector&lt; std::valarray&lt; double &gt; &gt; &amp;kernel)'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(const DenseLayer &amp;layer)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a6c859e3737aa88b29854df0347b29f4e',1,'machine_learning::neural_network::layers::DenseLayer::DenseLayer(DenseLayer &amp;&amp;)=default']]],
+  ['depth_5ffirst_5fsearch_16',['depth_first_search',['../df/dce/namespacegraph.html#ab5428a3519267a28bba4b4310cfbb6ae',1,'graph']]],
+  ['dequeue_17',['deQueue',['../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85',1,'queue']]],
+  ['dequeue_18',['dequeue',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622',1,'data_structures::queue_using_array::Queue_Array']]],
+  ['determinant_5flu_19',['determinant_lu',['../d1/dbe/lu__decomposition_8h.html#a3108d43bd32c6fb3b3c158476c51ba7f',1,'lu_decomposition.h']]],
+  ['dfs_20',['dfs',['../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0',1,'graph::HKGraph::dfs()'],['../da/d4b/depth__first__search__with__stack_8cpp.html#a5738da9f508f6a9e87f123c9fb6f2ea9',1,'graph::depth_first_search::dfs()'],['../d8/db9/topological__sort_8cpp.html#abcbcaa2bb70af0a11d0c090ea1796aea',1,'graph::topological_sort::dfs()']]],
+  ['dfs_5fhc_21',['dfs_hc',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#af64848d6630c39d0f09ce2359cc7c4f8',1,'range_queries::heavy_light_decomposition::HLD']]],
+  ['dfs_5flabels_22',['dfs_labels',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a0579062b384e54b611b80c6337c7f2c8',1,'range_queries::heavy_light_decomposition::HLD']]],
+  ['dfs_5flca_23',['dfs_lca',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae8de7aefcb6635d3dacdd174cd4890c4',1,'range_queries::heavy_light_decomposition::Tree']]],
+  ['dfs_5fpar_24',['dfs_par',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a',1,'range_queries::heavy_light_decomposition::HLD']]],
+  ['dfs_5fsize_25',['dfs_size',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460',1,'range_queries::heavy_light_decomposition::Tree']]],
+  ['digit_5fchar_26',['digit_char',['../db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac',1,'large_number']]],
+  ['digitseparation_27',['DigitSeparation',['../da/d49/classgreedy__algorithms_1_1_digit_separation.html#afd54c969a6c9bab16b4a064fbc8ed40e',1,'greedy_algorithms::DigitSeparation']]],
+  ['digitseparationforwardorder_28',['digitSeparationForwardOrder',['../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8',1,'greedy_algorithms::DigitSeparation']]],
+  ['digitseparationreverseorder_29',['digitSeparationReverseOrder',['../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79',1,'greedy_algorithms::DigitSeparation']]],
+  ['dijkstra_30',['dijkstra',['../df/dce/namespacegraph.html#adc68cbc8ba09eb1142265935c0d45b84',1,'graph::dijkstra()'],['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af915876d0ca33cc71a6a6191a8cd3ccd',1,'greedy_algorithms::dijkstra::dijkstra()']]],
+  ['direction_31',['direction',['../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655',1,'SegmentIntersection']]],
+  ['display_32',['display',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a1313837c0e9ec67fd9fbd17987e2d615',1,'data_structures::linked_list::list::display()'],['../db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368',1,'queue::display()'],['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631',1,'data_structures::queue_using_array::Queue_Array::display()'],['../d1/dc2/classstack.html#a8bce109630118a34faae717f72986033',1,'stack::display()'],['../dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed',1,'hash_chain::display()'],['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53',1,'others::lru_cache::LRUCache::display()'],['../d0/d65/namespacedouble__hashing.html#a1e901418c759627557eff359b8db38cd',1,'double_hashing::display()'],['../d8/d89/namespacelinear__probing.html#ad87b71d810901fab69c4ad9d4d0fa635',1,'linear_probing::display()'],['../d4/dd2/namespacequadratic__probing.html#a40d617ebf4d6ba21bcda8d8d1faa2357',1,'quadratic_probing::display()'],['../d5/d33/gram__schmidt_8cpp.html#ae6b496dce691e04f7f95ba0f0d33a289',1,'numerical_methods::gram_schmidt::display()']]],
+  ['displayelements_33',['displayElements',['../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72',1,'wiggle_sort.cpp']]],
+  ['displaylist_34',['displayList',['../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c',1,'data_structures::SkipList']]],
+  ['divide_35',['divide',['../db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c',1,'uint128_t::divide()'],['../d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1',1,'uint256_t::divide()']]],
+  ['dnfsort_36',['dnfSort',['../d6/d1a/dnf__sort_8cpp.html#a621767fe711db64fe57a2ac4987b11f0',1,'sorting::dnf_sort']]],
+  ['dot_5fproduct_37',['dot_product',['../d5/d33/gram__schmidt_8cpp.html#ac4a4504924ecc9f12a2ebd80788ec01d',1,'numerical_methods::gram_schmidt']]],
+  ['double_5ffactorial_5fiterative_38',['double_factorial_iterative',['../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26',1,'double_factorial.cpp']]],
+  ['double_5ffactorial_5frecursive_39',['double_factorial_recursive',['../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d',1,'double_factorial.cpp']]],
+  ['doublehash_40',['doubleHash',['../d0/d65/namespacedouble__hashing.html#a8f8ff4fb018e1bb32d67d8a1885d3200',1,'double_hashing']]],
+  ['dptable_41',['dpTable',['../dc/d14/wildcard__matching_8cpp.html#a1f8c260cf0d7e22c666b85f1f71ee4a7',1,'backtracking::wildcard_matching']]],
+  ['draw_5fsample_42',['draw_sample',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a8aae1cebcf42ed2332f1c7217c401aa3',1,'probability::geometric_dist::geometric_distribution']]],
+  ['drelu_43',['drelu',['../d2/d58/neural__network_8cpp.html#aa69e95a34054d7989bf446f96b2ffaf9',1,'machine_learning::neural_network::activations']]],
+  ['dsigmoid_44',['dsigmoid',['../d2/d58/neural__network_8cpp.html#a76eb66212d577f948a457b6e29d87c46',1,'machine_learning::neural_network::activations']]],
+  ['dsu_45',['dsu',['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)'],['../dd/d1f/classdsu.html#a126e3002a464e53cd54b07ba56482a72',1,'dsu::dsu(uint64_t n)']]],
+  ['dtanh_46',['dtanh',['../d2/d58/neural__network_8cpp.html#a2a5e874b9774aa5362dbcf288828b95c',1,'machine_learning::neural_network::activations']]],
+  ['duplicatenumber_47',['duplicateNumber',['../db/dc4/floyd__cycle__detection__algo_8cpp.html#a81ffc7a2c6bf530c8a496864e7a3ad88',1,'search::cycle_detection']]],
+  ['durand_5fkerner_5falgo_48',['durand_kerner_algo',['../da/df2/durand__kerner__roots_8cpp.html#a2c35b320ace8677f9b331faf94f8b2fd',1,'durand_kerner_roots.cpp']]],
+  ['duval_49',['duval',['../d6/dd6/namespacestring.html#ac2a35302e6bed93c4b2c6f55a21a5632',1,'string']]]
 ];
diff --git a/search/functions_5.js b/search/functions_5.js
index 8d5e2a28a..09a97567f 100644
--- a/search/functions_5.js
+++ b/search/functions_5.js
@@ -1,72 +1,36 @@
 var searchData=
 [
-  ['eback_0',['eback',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::eback()']]],
-  ['edge_1',['Edge',['../d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980',1,'Edge']]],
-  ['editdistdp_2',['editDistDP',['../da/d52/minimum__edit__distance_8cpp.html#ade2fcfe0359f3c7691bfaa04b14943e2',1,'dynamic_programming::minimum_edit_distance']]],
-  ['egptr_3',['egptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::egptr()']]],
-  ['eigen_5fvalues_4',['eigen_values',['../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc',1,'qr_algorithm']]],
-  ['eightpuzzle_5',['EightPuzzle',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const std::array&lt; std::array&lt; uint32_t, N &gt;, N &gt; &amp;init)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const EightPuzzle&lt; N &gt; &amp;A)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const EightPuzzle&lt; N &gt; &amp;&amp;A) noexcept']]],
-  ['emplace_6',['emplace',['http://en.cppreference.com/w/cpp/container/vector/emplace.html',0,'std::vector::emplace()'],['http://en.cppreference.com/w/cpp/container/multiset/emplace.html',0,'std::multiset::emplace()'],['http://en.cppreference.com/w/cpp/container/set/emplace.html',0,'std::set::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_map/emplace.html',0,'std::unordered_map::emplace()'],['http://en.cppreference.com/w/cpp/container/stack/emplace.html',0,'std::stack::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/emplace.html',0,'std::unordered_multimap::emplace()'],['http://en.cppreference.com/w/cpp/container/deque/emplace.html',0,'std::deque::emplace()'],['http://en.cppreference.com/w/cpp/container/queue/emplace.html',0,'std::queue::emplace()'],['http://en.cppreference.com/w/cpp/container/priority_queue/emplace.html',0,'std::priority_queue::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/emplace.html',0,'std::unordered_multiset::emplace()'],['http://en.cppreference.com/w/cpp/container/list/emplace.html',0,'std::list::emplace()'],['http://en.cppreference.com/w/cpp/container/map/emplace.html',0,'std::map::emplace()'],['http://en.cppreference.com/w/cpp/experimental/optional/emplace.html',0,'std::experimental::optional::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_set/emplace.html',0,'std::unordered_set::emplace()'],['http://en.cppreference.com/w/cpp/container/multimap/emplace.html',0,'std::multimap::emplace()']]],
-  ['emplace_5fafter_7',['emplace_after',['http://en.cppreference.com/w/cpp/container/forward_list/emplace_after.html',0,'std::forward_list']]],
-  ['emplace_5fback_8',['emplace_back',['http://en.cppreference.com/w/cpp/container/vector/emplace_back.html',0,'std::vector::emplace_back()'],['http://en.cppreference.com/w/cpp/container/deque/emplace_back.html',0,'std::deque::emplace_back()'],['http://en.cppreference.com/w/cpp/container/list/emplace_back.html',0,'std::list::emplace_back()']]],
-  ['emplace_5ffront_9',['emplace_front',['http://en.cppreference.com/w/cpp/container/forward_list/emplace_front.html',0,'std::forward_list::emplace_front()'],['http://en.cppreference.com/w/cpp/container/deque/emplace_front.html',0,'std::deque::emplace_front()'],['http://en.cppreference.com/w/cpp/container/list/emplace_front.html',0,'std::list::emplace_front()']]],
-  ['emplace_5fhint_10',['emplace_hint',['http://en.cppreference.com/w/cpp/container/multiset/emplace_hint.html',0,'std::multiset::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/set/emplace_hint.html',0,'std::set::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_map/emplace_hint.html',0,'std::unordered_map::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/emplace_hint.html',0,'std::unordered_multimap::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/emplace_hint.html',0,'std::unordered_multiset::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/map/emplace_hint.html',0,'std::map::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_set/emplace_hint.html',0,'std::unordered_set::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/multimap/emplace_hint.html',0,'std::multimap::emplace_hint()']]],
-  ['empty_11',['empty',['http://en.cppreference.com/w/cpp/container/dynarray/empty.html',0,'std::dynarray::empty()'],['http://en.cppreference.com/w/cpp/container/vector/empty.html',0,'std::vector::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::match_results::empty()'],['http://en.cppreference.com/w/cpp/container/multiset/empty.html',0,'std::multiset::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::string::empty()'],['http://en.cppreference.com/w/cpp/container/set/empty.html',0,'std::set::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_map/empty.html',0,'std::unordered_map::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::wsmatch::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::smatch::empty()'],['http://en.cppreference.com/w/cpp/container/stack/empty.html',0,'std::stack::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/empty.html',0,'std::unordered_multimap::empty()'],['http://en.cppreference.com/w/cpp/container/forward_list/empty.html',0,'std::forward_list::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::wcmatch::empty()'],['http://en.cppreference.com/w/cpp/container/deque/empty.html',0,'std::deque::empty()'],['http://en.cppreference.com/w/cpp/container/queue/empty.html',0,'std::queue::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::basic_string::empty()'],['http://en.cppreference.com/w/cpp/container/priority_queue/empty.html',0,'std::priority_queue::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::wstring::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/empty.html',0,'std::unordered_multiset::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::u16string::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::u32string::empty()'],['http://en.cppreference.com/w/cpp/container/list/empty.html',0,'std::list::empty()'],['http://en.cppreference.com/w/cpp/container/map/empty.html',0,'std::map::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::cmatch::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_set/empty.html',0,'std::unordered_set::empty()'],['http://en.cppreference.com/w/cpp/container/multimap/empty.html',0,'std::multimap::empty()'],['http://en.cppreference.com/w/cpp/container/array/empty.html',0,'std::array::empty()'],['../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080',1,'data_structures::Stack::empty()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0',1,'others::Cache::LFUCache::empty()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e',1,'others::Cache::LRUCache::empty()']]],
-  ['enable_5fshared_5ffrom_5fthis_12',['enable_shared_from_this',['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/enable_shared_from_this.html',0,'std::enable_shared_from_this']]],
-  ['encoding_13',['encoding',['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_byname::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8_utf16::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf16::encoding()']]],
-  ['encrypt_14',['encrypt',['../de/db6/a1z26__cipher_8cpp.html#a77a6b827a0b9c7aca2d705811459d744',1,'ciphers::a1z26::encrypt()'],['../d6/d2c/caesar__cipher_8cpp.html#ac3381121289548640b1c27a58a8524c3',1,'ciphers::caesar::encrypt()'],['../d8/d76/morse__code_8cpp.html#a0242e458904de8a242fcdaffe9e3ba1a',1,'ciphers::morse::encrypt()'],['../dd/d12/vigenere__cipher_8cpp.html#a6bd3880ea6820c232c1eddf47553c257',1,'ciphers::vigenere::encrypt()'],['../d3/d4c/xor__cipher_8cpp.html#aeff72a463ffc580c16cc849cbbdc58ef',1,'ciphers::XOR::encrypt()']]],
-  ['encrypt_5ftext_15',['encrypt_text',['../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917',1,'ciphers::HillCipher']]],
-  ['end_16',['end',['http://en.cppreference.com/w/cpp/container/dynarray/end.html',0,'std::dynarray::end()'],['http://en.cppreference.com/w/cpp/container/vector/end.html',0,'std::vector::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::match_results::end()'],['http://en.cppreference.com/w/cpp/container/multiset/end.html',0,'std::multiset::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::string::end()'],['http://en.cppreference.com/w/cpp/container/set/end.html',0,'std::set::end()'],['http://en.cppreference.com/w/cpp/container/unordered_map/end.html',0,'std::unordered_map::end()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/end.html',0,'std::initializer_list::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wsmatch::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::smatch::end()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end.html',0,'std::unordered_multimap::end()'],['http://en.cppreference.com/w/cpp/container/forward_list/end.html',0,'std::forward_list::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wcmatch::end()'],['http://en.cppreference.com/w/cpp/container/deque/end.html',0,'std::deque::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::basic_string::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::wstring::end()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end.html',0,'std::unordered_multiset::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u16string::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u32string::end()'],['http://en.cppreference.com/w/cpp/container/list/end.html',0,'std::list::end()'],['http://en.cppreference.com/w/cpp/container/map/end.html',0,'std::map::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::cmatch::end()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end.html',0,'std::unordered_set::end()'],['http://en.cppreference.com/w/cpp/container/multimap/end.html',0,'std::multimap::end()'],['http://en.cppreference.com/w/cpp/container/array/end.html',0,'std::array::end()'],['http://en.cppreference.com/w/cpp/iterator/end.html',0,'std::end()']]],
-  ['end_28int_29_17',['end(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/end2.html',0,'std::unordered_map::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end2.html',0,'std::unordered_multimap::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end2.html',0,'std::unordered_multiset::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end2.html',0,'std::unordered_set::end(int)()']]],
-  ['endl_18',['endl',['http://en.cppreference.com/w/cpp/io/manip/endl.html',0,'std']]],
-  ['ends_19',['ends',['http://en.cppreference.com/w/cpp/io/manip/ends.html',0,'std']]],
-  ['enqueue_20',['enQueue',['../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d',1,'queue']]],
-  ['enqueue_21',['enqueue',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663',1,'data_structures::queue_using_array::Queue_Array']]],
-  ['ensurenotempty_22',['ensureNotEmpty',['../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604',1,'queue']]],
-  ['entropy_23',['entropy',['http://en.cppreference.com/w/cpp/numeric/random/random_device/entropy.html',0,'std::random_device']]],
-  ['entry_24',['Entry',['../d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475',1,'double_hashing::Entry::Entry()'],['../db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77',1,'linear_probing::Entry::Entry()'],['../da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e',1,'quadratic_probing::Entry::Entry()']]],
-  ['eof_25',['eof',['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::fstream::eof()'],['http://en.cppreference.com/w/cpp/string/char_traits/eof.html',0,'std::char_traits::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ios::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_fstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::iostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wistream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::stringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wifstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_istream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::strstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_stringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istrstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wiostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_istringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ifstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostrstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wfstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_iostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wstringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wistringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ifstream::eof()']]],
-  ['epptr_26',['epptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::epptr()']]],
-  ['epsilon_27',['epsilon',['http://en.cppreference.com/w/cpp/types/numeric_limits/epsilon.html',0,'std::numeric_limits']]],
-  ['eq_28',['eq',['http://en.cppreference.com/w/cpp/string/char_traits/cmp.html',0,'std::char_traits::eq()'],['../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq():&#160;bisection_method.cpp'],['../dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713',1,'numerical_methods::false_position::eq()'],['../de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq(double i):&#160;newton_raphson_method.cpp'],['../df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389',1,'eq(float y):&#160;successive_approximation.cpp']]],
-  ['eq_5fder_29',['eq_der',['../de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386',1,'newton_raphson_method.cpp']]],
-  ['eq_5fint_5ftype_30',['eq_int_type',['http://en.cppreference.com/w/cpp/string/char_traits/eq_int_type.html',0,'std::char_traits']]],
-  ['eqd_31',['eqd',['../df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456',1,'successive_approximation.cpp']]],
-  ['equal_32',['equal',['http://en.cppreference.com/w/cpp/algorithm/equal.html',0,'std']]],
-  ['equal_5frange_33',['equal_range',['http://en.cppreference.com/w/cpp/container/multiset/equal_range.html',0,'std::multiset::equal_range()'],['http://en.cppreference.com/w/cpp/container/set/equal_range.html',0,'std::set::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_map/equal_range.html',0,'std::unordered_map::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/equal_range.html',0,'std::unordered_multimap::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/equal_range.html',0,'std::unordered_multiset::equal_range()'],['http://en.cppreference.com/w/cpp/container/map/equal_range.html',0,'std::map::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_set/equal_range.html',0,'std::unordered_set::equal_range()'],['http://en.cppreference.com/w/cpp/container/multimap/equal_range.html',0,'std::multimap::equal_range()'],['http://en.cppreference.com/w/cpp/algorithm/equal_range.html',0,'std::equal_range()']]],
-  ['equal_5fshuffle_34',['equal_shuffle',['../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f',1,'machine_learning']]],
-  ['equivalent_35',['equivalent',['http://en.cppreference.com/w/cpp/error/error_category/equivalent.html',0,'std::error_category']]],
-  ['erase_36',['erase',['http://en.cppreference.com/w/cpp/container/vector/erase.html',0,'std::vector::erase()'],['http://en.cppreference.com/w/cpp/container/multiset/erase.html',0,'std::multiset::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::string::erase()'],['http://en.cppreference.com/w/cpp/container/set/erase.html',0,'std::set::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_map/erase.html',0,'std::unordered_map::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/erase.html',0,'std::unordered_multimap::erase()'],['http://en.cppreference.com/w/cpp/container/deque/erase.html',0,'std::deque::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::basic_string::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::wstring::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/erase.html',0,'std::unordered_multiset::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::u16string::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::u32string::erase()'],['http://en.cppreference.com/w/cpp/container/list/erase.html',0,'std::list::erase()'],['http://en.cppreference.com/w/cpp/container/map/erase.html',0,'std::map::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_set/erase.html',0,'std::unordered_set::erase()'],['http://en.cppreference.com/w/cpp/container/multimap/erase.html',0,'std::multimap::erase()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a009b19ac8cca40f2e4daa2e5989fa4f3',1,'data_structures::linked_list::list::erase()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469',1,'data_structures::treap::Treap::erase()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::erase()']]],
-  ['erase_5fafter_37',['erase_after',['http://en.cppreference.com/w/cpp/container/forward_list/erase_after.html',0,'std::forward_list']]],
-  ['erasefromsorted_38',['eraseFromSorted',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e',1,'probability::windowed_median::WindowedMedian']]],
-  ['erf_39',['erf',['http://en.cppreference.com/w/cpp/numeric/math/erf.html',0,'std']]],
-  ['erfc_40',['erfc',['http://en.cppreference.com/w/cpp/numeric/math/erfc.html',0,'std']]],
-  ['error_5fcategory_41',['error_category',['http://en.cppreference.com/w/cpp/error/error_category/error_category.html',0,'std::error_category']]],
-  ['error_5fcode_42',['error_code',['http://en.cppreference.com/w/cpp/error/error_code/error_code.html',0,'std::error_code']]],
-  ['error_5fcondition_43',['error_condition',['http://en.cppreference.com/w/cpp/error/error_condition/error_condition.html',0,'std::error_condition']]],
-  ['euclidean_5fdistance_44',['euclidean_distance',['../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69',1,'machine_learning::k_nearest_neighbors']]],
-  ['evaluate_45',['evaluate',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e',1,'machine_learning::neural_network::NeuralNetwork::evaluate()'],['../d7/d75/postfix__evaluation_8cpp.html#a59fd597e0ea394abe027ced4d2ea3338',1,'others::postfix_expression::evaluate()']]],
-  ['evaluate_5ffrom_5fcsv_46',['evaluate_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a36494e26ff36d6e15c1022bb9a1ee848',1,'machine_learning::neural_network::NeuralNetwork']]],
-  ['exact_5fsolution_47',['exact_solution',['../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y):&#160;ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y):&#160;ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y):&#160;ode_semi_implicit_euler.cpp']]],
-  ['example_48',['example',['../de/dab/ncr__modulo__p_8cpp.html#afa2b50f4716fc3b42221a72e676e1422',1,'ncr_modulo_p.cpp']]],
-  ['exception_49',['exception',['http://en.cppreference.com/w/cpp/error/exception/exception.html',0,'std::exception']]],
-  ['exceptions_50',['exceptions',['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::fstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ios::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_fstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::iostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wistream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::stringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wifstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_istream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::strstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_stringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istrstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wiostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_istringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ifstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostrstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wfstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_iostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wstringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wistringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ifstream::exceptions()']]],
-  ['exchange_51',['exchange',['http://en.cppreference.com/w/cpp/atomic/atomic/exchange.html',0,'std::atomic']]],
-  ['exists_52',['exists',['../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81',1,'dynamic_programming::word_break']]],
-  ['exit_53',['exit',['http://en.cppreference.com/w/cpp/utility/program/exit.html',0,'std']]],
-  ['exp_54',['exp',['http://en.cppreference.com/w/cpp/numeric/math/exp.html',0,'std::exp()'],['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0',1,'ciphers::elliptic_curve_key_exchange::exp()']]],
-  ['exp2_55',['exp2',['http://en.cppreference.com/w/cpp/numeric/math/exp2.html',0,'std']]],
-  ['expected_5fvalue_56',['expected_value',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413',1,'probability::geometric_dist::geometric_distribution']]],
-  ['expired_57',['expired',['http://en.cppreference.com/w/cpp/memory/weak_ptr/expired.html',0,'std::weak_ptr']]],
-  ['explore_58',['explore',['../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8',1,'graph::explore(const std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, std::vector&lt; bool &gt; *visited)'],['../df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463',1,'graph::explore(const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;adj, size_t v, std::vector&lt; bool &gt; *visited)']]],
-  ['expm1_59',['expm1',['http://en.cppreference.com/w/cpp/numeric/math/expm1.html',0,'std']]],
-  ['exponential_5fdistribution_60',['exponential_distribution',['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/exponential_distribution.html',0,'std::exponential_distribution']]],
-  ['exponential_5fexpected_61',['exponential_expected',['../d9/da2/exponential__dist_8cpp.html#a1c8b6e787f72a209ef96c096eedf7afc',1,'probability::geometric_dist']]],
-  ['exponential_5fstd_62',['exponential_std',['../d9/da2/exponential__dist_8cpp.html#ac7b0091e17479d47438a281fefc2549a',1,'probability::geometric_dist']]],
-  ['exponential_5fvar_63',['exponential_var',['../d9/da2/exponential__dist_8cpp.html#af435dbeb43a05c8c7785f53bf4ce1df1',1,'probability::geometric_dist']]],
-  ['extendedeuclid_64',['extendedEuclid',['../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d',1,'extended_euclid_algorithm.cpp']]],
-  ['extendedeuclid_5f1_65',['extendedEuclid_1',['../d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25',1,'extended_euclid_algorithm.cpp']]],
-  ['extract_5fbyte_66',['extract_byte',['../d4/d08/sha256_8cpp.html#afea411191ec5281f43e91ea327984627',1,'hashing::sha256']]],
-  ['extractmin_67',['extractMin',['../d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980',1,'MinHeap']]],
-  ['extreme_5fvalue_5fdistribution_68',['extreme_value_distribution',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/extreme_value_distribution.html',0,'std::extreme_value_distribution']]]
+  ['edge_0',['Edge',['../d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980',1,'Edge']]],
+  ['editdistdp_1',['editDistDP',['../da/d52/minimum__edit__distance_8cpp.html#ade2fcfe0359f3c7691bfaa04b14943e2',1,'dynamic_programming::minimum_edit_distance']]],
+  ['eigen_5fvalues_2',['eigen_values',['../d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc',1,'qr_algorithm']]],
+  ['eightpuzzle_3',['EightPuzzle',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ab7fd890a7ccf756e4b3313087b76a8c2',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const std::array&lt; std::array&lt; uint32_t, N &gt;, N &gt; &amp;init)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ad45fde095ac00effe1fe00b1d85ff9c7',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const EightPuzzle&lt; N &gt; &amp;A)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af22395b8e9e04222aa93a329523faef9',1,'machine_learning::aystar_search::EightPuzzle::EightPuzzle(const EightPuzzle&lt; N &gt; &amp;&amp;A) noexcept']]],
+  ['empty_4',['empty',['../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080',1,'data_structures::Stack::empty()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a68e1be0a3e0a6478aa35f04000e0e9b0',1,'others::Cache::LFUCache::empty()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ab8b6a6aa95db678596bc2a49e864683e',1,'others::Cache::LRUCache::empty()']]],
+  ['encrypt_5',['encrypt',['../de/db6/a1z26__cipher_8cpp.html#a77a6b827a0b9c7aca2d705811459d744',1,'ciphers::a1z26::encrypt()'],['../d6/d2c/caesar__cipher_8cpp.html#ac3381121289548640b1c27a58a8524c3',1,'ciphers::caesar::encrypt()'],['../d8/d76/morse__code_8cpp.html#a0242e458904de8a242fcdaffe9e3ba1a',1,'ciphers::morse::encrypt()'],['../dd/d12/vigenere__cipher_8cpp.html#a6bd3880ea6820c232c1eddf47553c257',1,'ciphers::vigenere::encrypt()'],['../d3/d4c/xor__cipher_8cpp.html#aeff72a463ffc580c16cc849cbbdc58ef',1,'ciphers::XOR::encrypt()']]],
+  ['encrypt_5ftext_6',['encrypt_text',['../d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917',1,'ciphers::HillCipher']]],
+  ['enqueue_7',['enQueue',['../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d',1,'queue']]],
+  ['enqueue_8',['enqueue',['../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663',1,'data_structures::queue_using_array::Queue_Array']]],
+  ['ensurenotempty_9',['ensureNotEmpty',['../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604',1,'queue']]],
+  ['entry_10',['Entry',['../d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475',1,'double_hashing::Entry::Entry()'],['../db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77',1,'linear_probing::Entry::Entry()'],['../da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e',1,'quadratic_probing::Entry::Entry()']]],
+  ['eq_11',['eq',['../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq():&#160;bisection_method.cpp'],['../dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713',1,'numerical_methods::false_position::eq()'],['../de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq(double i):&#160;newton_raphson_method.cpp'],['../df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389',1,'eq(float y):&#160;successive_approximation.cpp']]],
+  ['eq_5fder_12',['eq_der',['../de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386',1,'newton_raphson_method.cpp']]],
+  ['eqd_13',['eqd',['../df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456',1,'successive_approximation.cpp']]],
+  ['equal_5fshuffle_14',['equal_shuffle',['../d8/d77/namespacemachine__learning.html#af801bf30591ca6b2c38ff4fed0ded23f',1,'machine_learning']]],
+  ['erase_15',['erase',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a009b19ac8cca40f2e4daa2e5989fa4f3',1,'data_structures::linked_list::list::erase()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469',1,'data_structures::treap::Treap::erase()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a398d6cc927a2c8e4a156ae2806f48986',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::erase()']]],
+  ['erasefromsorted_16',['eraseFromSorted',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e',1,'probability::windowed_median::WindowedMedian']]],
+  ['euclidean_5fdistance_17',['euclidean_distance',['../d4/d3e/k__nearest__neighbors_8cpp.html#ad6ae16e50bb153ebaa7251d0aaa97b69',1,'machine_learning::k_nearest_neighbors']]],
+  ['evaluate_18',['evaluate',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e',1,'machine_learning::neural_network::NeuralNetwork::evaluate()'],['../d7/d75/postfix__evaluation_8cpp.html#a59fd597e0ea394abe027ced4d2ea3338',1,'others::postfix_expression::evaluate()']]],
+  ['evaluate_5ffrom_5fcsv_19',['evaluate_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a36494e26ff36d6e15c1022bb9a1ee848',1,'machine_learning::neural_network::NeuralNetwork']]],
+  ['exact_5fsolution_20',['exact_solution',['../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y):&#160;ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y):&#160;ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &amp;x, std::valarray&lt; double &gt; *y):&#160;ode_semi_implicit_euler.cpp']]],
+  ['example_21',['example',['../de/dab/ncr__modulo__p_8cpp.html#afa2b50f4716fc3b42221a72e676e1422',1,'ncr_modulo_p.cpp']]],
+  ['exists_22',['exists',['../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81',1,'dynamic_programming::word_break']]],
+  ['exp_23',['exp',['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#ac00616a4e40d3cd5cfb4da87d9ff9af0',1,'ciphers::elliptic_curve_key_exchange']]],
+  ['expected_5fvalue_24',['expected_value',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a41051365f8ac7700f2ed5880a6760413',1,'probability::geometric_dist::geometric_distribution']]],
+  ['explore_25',['explore',['../df/dce/namespacegraph.html#a3ae80bc4c6a79d041b4f3a6589eb7fb8',1,'graph::explore(const std::vector&lt; std::vector&lt; int &gt; &gt; *adj, int u, std::vector&lt; bool &gt; *visited)'],['../df/dce/namespacegraph.html#a64c1db5aad7502c6f08e4652f6edd463',1,'graph::explore(const std::vector&lt; std::vector&lt; size_t &gt; &gt; &amp;adj, size_t v, std::vector&lt; bool &gt; *visited)']]],
+  ['exponential_5fexpected_26',['exponential_expected',['../d9/da2/exponential__dist_8cpp.html#a1c8b6e787f72a209ef96c096eedf7afc',1,'probability::geometric_dist']]],
+  ['exponential_5fstd_27',['exponential_std',['../d9/da2/exponential__dist_8cpp.html#ac7b0091e17479d47438a281fefc2549a',1,'probability::geometric_dist']]],
+  ['exponential_5fvar_28',['exponential_var',['../d9/da2/exponential__dist_8cpp.html#af435dbeb43a05c8c7785f53bf4ce1df1',1,'probability::geometric_dist']]],
+  ['extendedeuclid_29',['extendedEuclid',['../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d',1,'extended_euclid_algorithm.cpp']]],
+  ['extendedeuclid_5f1_30',['extendedEuclid_1',['../d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25',1,'extended_euclid_algorithm.cpp']]],
+  ['extract_5fbyte_31',['extract_byte',['../d4/d08/sha256_8cpp.html#afea411191ec5281f43e91ea327984627',1,'hashing::sha256']]],
+  ['extractmin_32',['extractMin',['../d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980',1,'MinHeap']]]
 ];
diff --git a/search/functions_6.js b/search/functions_6.js
index 2726f2736..5ba30c87b 100644
--- a/search/functions_6.js
+++ b/search/functions_6.js
@@ -1,128 +1,45 @@
 var searchData=
 [
   ['f_0',['f',['../d4/d18/composite__simpson__rule_8cpp.html#a4251b4df4748a0b9c43a48f61bdd2397',1,'numerical_methods::simpson_method::f()'],['../df/d11/midpoint__integral__method_8cpp.html#a7ee8e824ef3e138a9a21883b26d97226',1,'numerical_methods::midpoint_rule::f()']]],
-  ['fabs_1',['fabs',['http://en.cppreference.com/w/cpp/numeric/math/fabs.html',0,'std']]],
-  ['facet_2',['facet',['http://en.cppreference.com/w/cpp/locale/locale/facet/facet.html',0,'std::locale::facet']]],
-  ['fact_3',['fact',['../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a',1,'poisson_dist.cpp']]],
-  ['factorial_4',['factorial',['../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a',1,'math']]],
-  ['fail_5',['fail',['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::fstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ios::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_fstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::iostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wistream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::stringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wifstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_istream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::strstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_stringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istrstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wiostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_istringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ifstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostrstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wfstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_iostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wstringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wistringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ifstream::fail()']]],
-  ['failure_6',['failure',['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::fstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ios::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_fstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::iostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ios_base::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::stringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wifstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::strstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_stringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istrstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wiostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ifstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostrstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wfstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_iostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wstringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ifstream::failure::failure()']]],
-  ['falsename_7',['falsename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::falsename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::falsename()']]],
-  ['fast_5finvsqrt_8',['Fast_InvSqrt',['../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52',1,'inv_sqrt.cpp']]],
-  ['fast_5fpower_5flinear_9',['fast_power_linear',['../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d',1,'fast_power.cpp']]],
-  ['fast_5fpower_5frecursive_10',['fast_power_recursive',['../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445',1,'fast_power.cpp']]],
-  ['fastfouriertransform_11',['FastFourierTransform',['../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150',1,'numerical_methods']]],
-  ['fastinput_12',['fastinput',['../d9/df0/fast__integer__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82',1,'fast_integer_input.cpp']]],
-  ['fclose_13',['fclose',['http://en.cppreference.com/w/cpp/io/c/fclose.html',0,'std']]],
-  ['fdim_14',['fdim',['http://en.cppreference.com/w/cpp/numeric/math/fdim.html',0,'std']]],
-  ['feclearexcept_15',['feclearexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/feclearexcept.html',0,'std']]],
-  ['fegetenv_16',['fegetenv',['http://en.cppreference.com/w/cpp/numeric/fenv/feenv.html',0,'std']]],
-  ['fegetexceptflag_17',['fegetexceptflag',['http://en.cppreference.com/w/cpp/numeric/fenv/feexceptflag.html',0,'std']]],
-  ['fegetround_18',['fegetround',['http://en.cppreference.com/w/cpp/numeric/fenv/feround.html',0,'std']]],
-  ['feholdexcept_19',['feholdexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/feholdexcept.html',0,'std']]],
-  ['fenwick_5ftree_20',['fenwick_tree',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a5ea37183524553bbf2234a36a44a4b9a',1,'range_queries::fenwick_tree::fenwick_tree(const std::vector&lt; T &gt; &amp;arr)'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c',1,'range_queries::fenwick_tree::fenwick_tree(T x)']]],
-  ['feof_21',['feof',['http://en.cppreference.com/w/cpp/io/c/feof.html',0,'std']]],
-  ['feraiseexcept_22',['feraiseexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/feraiseexcept.html',0,'std']]],
-  ['ferror_23',['ferror',['http://en.cppreference.com/w/cpp/io/c/ferror.html',0,'std']]],
-  ['fesetenv_24',['fesetenv',['http://en.cppreference.com/w/cpp/numeric/fenv/feenv.html',0,'std']]],
-  ['fesetexceptflag_25',['fesetexceptflag',['http://en.cppreference.com/w/cpp/numeric/fenv/feexceptflag.html',0,'std']]],
-  ['fesetround_26',['fesetround',['http://en.cppreference.com/w/cpp/numeric/fenv/feround.html',0,'std']]],
-  ['fetch_5fadd_27',['fetch_add',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_add.html',0,'std::atomic']]],
-  ['fetch_5fand_28',['fetch_and',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_and.html',0,'std::atomic']]],
-  ['fetch_5for_29',['fetch_or',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_or.html',0,'std::atomic']]],
-  ['fetch_5fsub_30',['fetch_sub',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_sub.html',0,'std::atomic']]],
-  ['fetch_5fxor_31',['fetch_xor',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_xor.html',0,'std::atomic']]],
-  ['fetestexcept_32',['fetestexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/fetestexcept.html',0,'std']]],
-  ['feupdateenv_33',['feupdateenv',['http://en.cppreference.com/w/cpp/numeric/fenv/feupdateenv.html',0,'std']]],
-  ['fflush_34',['fflush',['http://en.cppreference.com/w/cpp/io/c/fflush.html',0,'std']]],
-  ['fgetc_35',['fgetc',['http://en.cppreference.com/w/cpp/io/c/fgetc.html',0,'std']]],
-  ['fgetpos_36',['fgetpos',['http://en.cppreference.com/w/cpp/io/c/fgetpos.html',0,'std']]],
-  ['fgets_37',['fgets',['http://en.cppreference.com/w/cpp/io/c/fgets.html',0,'std']]],
-  ['fgetwc_38',['fgetwc',['http://en.cppreference.com/w/cpp/io/c/fgetwc.html',0,'std']]],
-  ['fgetws_39',['fgetws',['http://en.cppreference.com/w/cpp/io/c/fgetws.html',0,'std']]],
-  ['fib_40',['fib',['../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f',1,'fib(uint64_t n):&#160;fibonacci_fast.cpp'],['../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db',1,'fib(uint64_t n):&#160;fibonacci_large.cpp']]],
-  ['fib_5faccurate_41',['fib_Accurate',['../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca',1,'string_fibonacci.cpp']]],
-  ['fibo_42',['fibo',['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f',1,'fibonacci_matrix_exponentiation.cpp']]],
-  ['fibonacci_43',['fibonacci',['../d9/d89/fibonacci_8cpp.html#aeaaf5439cb29de4630c7dff2fd914b28',1,'math::fibonacci']]],
-  ['fibonacci_5fsearch_44',['fibonacci_search',['../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61',1,'fibonacci_search.cpp']]],
-  ['fibosum_45',['fiboSum',['../de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742',1,'math::fibonacci_sum']]],
-  ['filebuf_46',['filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::filebuf']]],
-  ['fill_47',['fill',['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::fstream::fill()'],['http://en.cppreference.com/w/cpp/container/dynarray/fill.html',0,'std::dynarray::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ios::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_fstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::iostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wistream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::stringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wifstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_istream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::strstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_stringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istrstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wiostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_istringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ifstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostrstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wfstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_iostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wstringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wistringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ifstream::fill()'],['http://en.cppreference.com/w/cpp/container/array/fill.html',0,'std::array::fill()'],['http://en.cppreference.com/w/cpp/algorithm/fill.html',0,'std::fill()'],['../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780',1,'fill():&#160;decimal_to_roman_numeral.cpp']]],
-  ['fill_5fn_48',['fill_n',['http://en.cppreference.com/w/cpp/algorithm/fill_n.html',0,'std']]],
-  ['find_49',['Find',['../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8',1,'disjoint_set.cpp']]],
-  ['find_50',['find',['http://en.cppreference.com/w/cpp/string/char_traits/find.html',0,'std::char_traits::find()'],['http://en.cppreference.com/w/cpp/container/multiset/find.html',0,'std::multiset::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::string::find()'],['http://en.cppreference.com/w/cpp/container/set/find.html',0,'std::set::find()'],['http://en.cppreference.com/w/cpp/container/unordered_map/find.html',0,'std::unordered_map::find()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/find.html',0,'std::unordered_multimap::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::basic_string::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::wstring::find()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/find.html',0,'std::unordered_multiset::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::u16string::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::u32string::find()'],['http://en.cppreference.com/w/cpp/container/map/find.html',0,'std::map::find()'],['http://en.cppreference.com/w/cpp/container/unordered_set/find.html',0,'std::unordered_set::find()'],['http://en.cppreference.com/w/cpp/container/multimap/find.html',0,'std::multimap::find()'],['../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a',1,'hash_chain::find()'],['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std::find()'],['../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d',1,'quadratic_probing::find()']]],
-  ['find_5fend_51',['find_end',['http://en.cppreference.com/w/cpp/algorithm/find_end.html',0,'std']]],
-  ['find_5ffirst_5fnot_5fof_52',['find_first_not_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::basic_string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::wstring::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::u16string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::u32string::find_first_not_of()']]],
-  ['find_5ffirst_5fof_53',['find_first_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::basic_string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::wstring::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::u16string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::u32string::find_first_of()'],['http://en.cppreference.com/w/cpp/algorithm/find_first_of.html',0,'std::find_first_of(T... args)']]],
-  ['find_5fif_54',['find_if',['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std']]],
-  ['find_5fif_5fnot_55',['find_if_not',['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std']]],
-  ['find_5flast_5fnot_5fof_56',['find_last_not_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::basic_string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::wstring::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::u16string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::u32string::find_last_not_of()']]],
-  ['find_5flast_5fof_57',['find_last_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::basic_string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::wstring::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::u16string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::u32string::find_last_of()']]],
-  ['find_5fmax_58',['find_max',['../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb',1,'binary_search_tree::find_max(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)'],['../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0',1,'binary_search_tree::find_max(T &amp;ret_value)']]],
-  ['find_5fmin_59',['find_min',['../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153',1,'binary_search_tree::find_min(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)'],['../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03',1,'binary_search_tree::find_min(T &amp;ret_value)']]],
-  ['find_5fnon_5frepeating_5finteger_60',['find_non_repeating_integer',['../d6/d38/find__non__repeating__number_8cpp.html#ac5ca4c0be0967b4dd572507f50451ae3',1,'bit_manipulation::find_non_repeating_integer']]],
-  ['find_5fpat_5fin_5ftext_61',['find_pat_in_text',['../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8',1,'z_function.cpp']]],
-  ['find_5fset_62',['find_set',['../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e',1,'graph::disjoint_union']]],
-  ['find_5fzero_63',['find_zero',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3',1,'machine_learning::aystar_search::EightPuzzle']]],
-  ['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_64',['finding_number_of_digits_in_a_number',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1',1,'finding_number_of_digits_in_a_number.cpp']]],
-  ['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_5fusing_5flog_65',['finding_number_of_digits_in_a_number_using_log',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49',1,'finding_number_of_digits_in_a_number.cpp']]],
-  ['findminimumedge_66',['findMinimumEdge',['../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098',1,'greedy_algorithms']]],
-  ['findminindex_67',['findMinIndex',['../d4/d9f/selection__sort__recursive_8cpp.html#a5454eeb691725ccac0f59df1e133f834',1,'sorting::selection_sort_recursive']]],
-  ['findminnode_68',['findMinNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
-  ['findnextgap_69',['FindNextGap',['../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5',1,'comb_sort.cpp']]],
-  ['findparent_70',['findParent',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]],
-  ['findset_71',['findSet',['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)'],['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)']]],
-  ['findshifttable_72',['findShiftTable',['../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336',1,'strings::horspool']]],
-  ['first_5ftest_73',['first_test',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300',1,'finding_number_of_digits_in_a_number.cpp']]],
-  ['fisher_5ff_5fdistribution_74',['fisher_f_distribution',['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/fisher_f_distribution.html',0,'std::fisher_f_distribution']]],
-  ['fit_75',['fit',['../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5',1,'machine_learning::adaline::fit(const std::vector&lt; double &gt; &amp;x, const int &amp;y)'],['../d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91',1,'machine_learning::adaline::fit(std::array&lt; std::vector&lt; double &gt;, N &gt; const &amp;X, std::array&lt; int, N &gt; const &amp;Y)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0',1,'machine_learning::neural_network::NeuralNetwork::fit(const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;X_, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;Y_, const int &amp;epochs=100, const double &amp;learning_rate=0.01, const size_t &amp;batch_size=32, const bool &amp;shuffle=true)']]],
-  ['fit_5ffrom_5fcsv_76',['fit_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff',1,'machine_learning::neural_network::NeuralNetwork']]],
-  ['fit_5fols_5fregressor_77',['fit_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b',1,'ordinary_least_squares_regressor.cpp']]],
-  ['fixed_78',['fixed',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]],
-  ['flags_79',['flags',['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::fstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ostringstream::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::regex::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::basic_regex::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ios::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_fstream::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::wregex::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::iostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ios_base::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wistream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::stringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wifstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_istream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::strstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_stringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wostringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istrstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wiostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_istringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ifstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostrstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wfstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_iostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wstringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wistringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ifstream::flags()']]],
-  ['flip_80',['flip',['http://en.cppreference.com/w/cpp/utility/bitset/flip.html',0,'std::bitset']]],
-  ['floor_81',['floor',['http://en.cppreference.com/w/cpp/numeric/math/floor.html',0,'std']]],
-  ['flush_82',['flush',['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::fstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_fstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::iostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::stringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::strstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_stringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wiostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostrstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wfstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_iostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wstringstream::flush()'],['http://en.cppreference.com/w/cpp/io/manip/flush.html',0,'std::flush(T... args)']]],
-  ['fma_83',['fma',['http://en.cppreference.com/w/cpp/numeric/math/fma.html',0,'std']]],
-  ['fmax_84',['fmax',['http://en.cppreference.com/w/cpp/numeric/math/fmax.html',0,'std']]],
-  ['fmin_85',['fmin',['http://en.cppreference.com/w/cpp/numeric/math/fmin.html',0,'std']]],
-  ['fmod_86',['fmod',['http://en.cppreference.com/w/cpp/numeric/math/fmod.html',0,'std']]],
-  ['fopen_87',['fopen',['http://en.cppreference.com/w/cpp/io/c/fopen.html',0,'std']]],
-  ['for_5feach_88',['for_each',['http://en.cppreference.com/w/cpp/algorithm/for_each.html',0,'std']]],
-  ['format_89',['format',['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::match_results::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::wsmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::smatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::wcmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::cmatch::format()']]],
-  ['forward_90',['forward',['http://en.cppreference.com/w/cpp/utility/forward.html',0,'std']]],
-  ['forward_5fas_5ftuple_91',['forward_as_tuple',['http://en.cppreference.com/w/cpp/utility/tuple/forward_as_tuple.html',0,'std']]],
-  ['forward_5feuler_92',['forward_euler',['../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9',1,'ode_forward_euler.cpp']]],
-  ['forward_5feuler_5fstep_93',['forward_euler_step',['../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723',1,'ode_forward_euler.cpp']]],
-  ['forward_5flist_94',['forward_list',['http://en.cppreference.com/w/cpp/container/forward_list/forward_list.html',0,'std::forward_list']]],
-  ['fpclassify_95',['fpclassify',['http://en.cppreference.com/w/cpp/numeric/math/fpclassify.html',0,'std']]],
-  ['fprintf_96',['fprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]],
-  ['fputc_97',['fputc',['http://en.cppreference.com/w/cpp/io/c/fputc.html',0,'std']]],
-  ['fputs_98',['fputs',['http://en.cppreference.com/w/cpp/io/c/fputs.html',0,'std']]],
-  ['fputwc_99',['fputwc',['http://en.cppreference.com/w/cpp/io/c/fputwc.html',0,'std']]],
-  ['fputws_100',['fputws',['http://en.cppreference.com/w/cpp/io/c/fputws.html',0,'std']]],
-  ['frac_5fdigits_101',['frac_digits',['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct_byname::frac_digits()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct::frac_digits()']]],
-  ['fread_102',['fread',['http://en.cppreference.com/w/cpp/io/c/fread.html',0,'std']]],
-  ['free_103',['free',['http://en.cppreference.com/w/cpp/memory/c/free.html',0,'std']]],
-  ['freenode_104',['freeNode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02',1,'linkedlist_implentation_usingarray.cpp']]],
-  ['freeze_105',['freeze',['http://en.cppreference.com/w/cpp/io/strstreambuf/freeze.html',0,'std::strstreambuf::freeze()'],['http://en.cppreference.com/w/cpp/io/strstream/freeze.html',0,'std::strstream::freeze()'],['http://en.cppreference.com/w/cpp/io/ostrstream/freeze.html',0,'std::ostrstream::freeze()']]],
-  ['freopen_106',['freopen',['http://en.cppreference.com/w/cpp/io/c/freopen.html',0,'std']]],
-  ['frexp_107',['frexp',['http://en.cppreference.com/w/cpp/numeric/math/frexp.html',0,'std']]],
-  ['from_5fbytes_108',['from_bytes',['http://en.cppreference.com/w/cpp/locale/wstring_convert/from_bytes.html',0,'std::wstring_convert']]],
-  ['from_5ftime_5ft_109',['from_time_t',['http://en.cppreference.com/w/cpp/chrono/system_clock/from_time_t.html',0,'std::chrono::system_clock']]],
-  ['front_110',['front',['http://en.cppreference.com/w/cpp/container/dynarray/front.html',0,'std::dynarray::front()'],['http://en.cppreference.com/w/cpp/container/vector/front.html',0,'std::vector::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::string::front()'],['http://en.cppreference.com/w/cpp/container/forward_list/front.html',0,'std::forward_list::front()'],['http://en.cppreference.com/w/cpp/container/deque/front.html',0,'std::deque::front()'],['http://en.cppreference.com/w/cpp/container/queue/front.html',0,'std::queue::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::basic_string::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::wstring::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::u16string::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::u32string::front()'],['http://en.cppreference.com/w/cpp/container/list/front.html',0,'std::list::front()'],['http://en.cppreference.com/w/cpp/container/array/front.html',0,'std::array::front()'],['../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7',1,'queue::front()']]],
-  ['front_5finserter_111',['front_inserter',['http://en.cppreference.com/w/cpp/iterator/front_inserter.html',0,'std']]],
-  ['fscanf_112',['fscanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]],
-  ['fseek_113',['fseek',['http://en.cppreference.com/w/cpp/io/c/fseek.html',0,'std']]],
-  ['fsetpos_114',['fsetpos',['http://en.cppreference.com/w/cpp/io/c/fsetpos.html',0,'std']]],
-  ['fstream_115',['fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::fstream']]],
-  ['ftell_116',['ftell',['http://en.cppreference.com/w/cpp/io/c/ftell.html',0,'std']]],
-  ['full_117',['full',['../d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1',1,'data_structures::Stack']]],
-  ['function_118',['function',['http://en.cppreference.com/w/cpp/utility/functional/function/function.html',0,'std::function']]],
-  ['future_119',['future',['http://en.cppreference.com/w/cpp/thread/future/future.html',0,'std::future']]],
-  ['future_5fcategory_120',['future_category',['http://en.cppreference.com/w/cpp/thread/future/future_category.html',0,'std']]],
-  ['future_5ferror_121',['future_error',['http://en.cppreference.com/w/cpp/thread/future_error/future_error.html',0,'std::future_error']]],
-  ['fwprintf_122',['fwprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]],
-  ['fwrite_123',['fwrite',['http://en.cppreference.com/w/cpp/io/c/fwrite.html',0,'std']]],
-  ['fwscanf_124',['fwscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]]
+  ['fact_1',['fact',['../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a',1,'poisson_dist.cpp']]],
+  ['factorial_2',['factorial',['../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a',1,'math']]],
+  ['fast_5finvsqrt_3',['Fast_InvSqrt',['../d6/db8/inv__sqrt_8cpp.html#ad219034bf5fba657f5035ec5a1d50f52',1,'inv_sqrt.cpp']]],
+  ['fast_5fpower_5flinear_4',['fast_power_linear',['../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d',1,'fast_power.cpp']]],
+  ['fast_5fpower_5frecursive_5',['fast_power_recursive',['../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445',1,'fast_power.cpp']]],
+  ['fastfouriertransform_6',['FastFourierTransform',['../d1/de0/namespacenumerical__methods.html#a158fd271b9a53e8f3f60b08b18857150',1,'numerical_methods']]],
+  ['fastinput_7',['fastinput',['../d9/df0/fast__integer__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82',1,'fast_integer_input.cpp']]],
+  ['fenwick_5ftree_8',['fenwick_tree',['../de/d0d/classrange__queries_1_1fenwick__tree.html#a5ea37183524553bbf2234a36a44a4b9a',1,'range_queries::fenwick_tree::fenwick_tree(const std::vector&lt; T &gt; &amp;arr)'],['../de/d0d/classrange__queries_1_1fenwick__tree.html#aef7ba885b91af093e9e514358fa0f36c',1,'range_queries::fenwick_tree::fenwick_tree(T x)']]],
+  ['fib_9',['fib',['../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f',1,'fib(uint64_t n):&#160;fibonacci_fast.cpp'],['../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db',1,'fib(uint64_t n):&#160;fibonacci_large.cpp']]],
+  ['fib_5faccurate_10',['fib_Accurate',['../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca',1,'string_fibonacci.cpp']]],
+  ['fibo_11',['fibo',['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#abc3bc08249058d57cfc8f54a29d9cf9f',1,'fibonacci_matrix_exponentiation.cpp']]],
+  ['fibonacci_12',['fibonacci',['../d9/d89/fibonacci_8cpp.html#aeaaf5439cb29de4630c7dff2fd914b28',1,'math::fibonacci']]],
+  ['fibonacci_5fsearch_13',['fibonacci_search',['../de/d0d/fibonacci__search_8cpp.html#a0bc61b3903d9a53061bf31e5d110fe61',1,'fibonacci_search.cpp']]],
+  ['fibosum_14',['fiboSum',['../de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742',1,'math::fibonacci_sum']]],
+  ['fill_15',['fill',['../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780',1,'decimal_to_roman_numeral.cpp']]],
+  ['find_16',['Find',['../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8',1,'disjoint_set.cpp']]],
+  ['find_17',['find',['../dd/d1c/classhash__chain.html#a55aa5c6753cb8853152d469c375d946a',1,'hash_chain::find()'],['../d4/dd2/namespacequadratic__probing.html#a5ceee4128d92ca4412040b7104d1299d',1,'quadratic_probing::find()']]],
+  ['find_5fmax_18',['find_max',['../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb',1,'binary_search_tree::find_max(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)'],['../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0',1,'binary_search_tree::find_max(T &amp;ret_value)']]],
+  ['find_5fmin_19',['find_min',['../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153',1,'binary_search_tree::find_min(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)'],['../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03',1,'binary_search_tree::find_min(T &amp;ret_value)']]],
+  ['find_5fnon_5frepeating_5finteger_20',['find_non_repeating_integer',['../d6/d38/find__non__repeating__number_8cpp.html#ac5ca4c0be0967b4dd572507f50451ae3',1,'bit_manipulation::find_non_repeating_integer']]],
+  ['find_5fpat_5fin_5ftext_21',['find_pat_in_text',['../d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8',1,'z_function.cpp']]],
+  ['find_5fset_22',['find_set',['../d8/d99/connected__components__with__dsu_8cpp.html#a469384d8a4197a9b24482ce7c321a85e',1,'graph::disjoint_union']]],
+  ['find_5fzero_23',['find_zero',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a94f794bf44f424b1b0ca6ef9f4f6ebd3',1,'machine_learning::aystar_search::EightPuzzle']]],
+  ['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_24',['finding_number_of_digits_in_a_number',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1',1,'finding_number_of_digits_in_a_number.cpp']]],
+  ['finding_5fnumber_5fof_5fdigits_5fin_5fa_5fnumber_5fusing_5flog_25',['finding_number_of_digits_in_a_number_using_log',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ac0862b67cf73651707ece04673e1ae49',1,'finding_number_of_digits_in_a_number.cpp']]],
+  ['findminimumedge_26',['findMinimumEdge',['../d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098',1,'greedy_algorithms']]],
+  ['findminindex_27',['findMinIndex',['../d4/d9f/selection__sort__recursive_8cpp.html#a5454eeb691725ccac0f59df1e133f834',1,'sorting::selection_sort_recursive']]],
+  ['findminnode_28',['findMinNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a72483e3f6933e004a8d86371e8a990db',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
+  ['findnextgap_29',['FindNextGap',['../d9/dfd/comb__sort_8cpp.html#aede08143e63105faba10e9ee8e745fd5',1,'comb_sort.cpp']]],
+  ['findparent_30',['findParent',['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a95de0f5e70e83164dbd1b4c515565e84',1,'greedy_algorithms::boruvkas_minimum_spanning_tree']]],
+  ['findset_31',['findSet',['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)'],['../dd/d1f/classdsu.html#a16851f78fe390fc1430905c83d6a2f1c',1,'dsu::findSet(uint64_t i)']]],
+  ['findshifttable_32',['findShiftTable',['../d3/dfe/horspool_8cpp.html#a1a9c3aa55ccc79d0f47d50c580997336',1,'strings::horspool']]],
+  ['first_5ftest_33',['first_test',['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300',1,'finding_number_of_digits_in_a_number.cpp']]],
+  ['fit_34',['fit',['../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5',1,'machine_learning::adaline::fit(const std::vector&lt; double &gt; &amp;x, const int &amp;y)'],['../d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91',1,'machine_learning::adaline::fit(std::array&lt; std::vector&lt; double &gt;, N &gt; const &amp;X, std::array&lt; int, N &gt; const &amp;Y)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0',1,'machine_learning::neural_network::NeuralNetwork::fit(const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;X_, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;Y_, const int &amp;epochs=100, const double &amp;learning_rate=0.01, const size_t &amp;batch_size=32, const bool &amp;shuffle=true)']]],
+  ['fit_5ffrom_5fcsv_35',['fit_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff',1,'machine_learning::neural_network::NeuralNetwork']]],
+  ['fit_5fols_5fregressor_36',['fit_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#aaddc683af581b51351e1023d2a01ef3b',1,'ordinary_least_squares_regressor.cpp']]],
+  ['forward_5feuler_37',['forward_euler',['../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9',1,'ode_forward_euler.cpp']]],
+  ['forward_5feuler_5fstep_38',['forward_euler_step',['../d6/d60/group__ode.html#ga195d23bbdfcb80e83c9cda45c9ad5723',1,'ode_forward_euler.cpp']]],
+  ['freenode_39',['freeNode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02',1,'linkedlist_implentation_usingarray.cpp']]],
+  ['front_40',['front',['../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7',1,'queue']]],
+  ['full_41',['full',['../d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1',1,'data_structures::Stack']]]
 ];
diff --git a/search/functions_7.js b/search/functions_7.js
index fdd113653..add149a08 100644
--- a/search/functions_7.js
+++ b/search/functions_7.js
@@ -2,116 +2,83 @@ var searchData=
 [
   ['g_0',['g',['../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad',1,'numerical_methods::simpson_method::g()'],['../df/d11/midpoint__integral__method_8cpp.html#ae682ee71af44b1e9e884849cc6a6b040',1,'numerical_methods::midpoint_rule::g()']]],
   ['gale_5fshapley_1',['gale_shapley',['../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c',1,'greedy_algorithms::stable_matching']]],
-  ['gamma_5fdistribution_2',['gamma_distribution',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/gamma_distribution.html',0,'std::gamma_distribution']]],
-  ['gbump_3',['gbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wfilebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::strstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_streambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::streambuf::gbump()']]],
-  ['gcd_4',['gcd',['../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0',1,'ciphers::HillCipher::gcd()'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd():&#160;gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532',1,'math::gcd_of_n_numbers::gcd()'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2):&#160;gcd_recursive_euclidean.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563',1,'gcd(unsigned int x, unsigned int y):&#160;least_common_multiple.cpp']]],
-  ['gcd_5ftwo_5',['gcd_two',['../d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181',1,'math::gcd_of_n_numbers']]],
-  ['gcdextended_6',['gcdExtended',['../de/dab/ncr__modulo__p_8cpp.html#a9010ad5669d31449c3bf3271ab5ebc86',1,'math::ncr_modulo_p::utils']]],
-  ['gcount_7',['gcount',['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::strstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istrstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wiostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_ifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wfstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wstringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::ifstream::gcount()']]],
-  ['genarray_8',['genArray',['../db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5',1,'spiral_print.cpp']]],
-  ['generate_9',['generate',['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/generate.html',0,'std::seed_seq::generate()'],['../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160',1,'backtracking::generate_parentheses::generate()'],['http://en.cppreference.com/w/cpp/algorithm/generate.html',0,'std::generate(T... args)']]],
-  ['generate_5fcanonical_10',['generate_canonical',['http://en.cppreference.com/w/cpp/numeric/random/generate_canonical.html',0,'std']]],
-  ['generate_5fdecryption_5fkey_11',['generate_decryption_key',['../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706',1,'ciphers::HillCipher']]],
-  ['generate_5fencryption_5fkey_12',['generate_encryption_key',['../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e',1,'ciphers::HillCipher']]],
-  ['generate_5fkeys_13',['generate_keys',['../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5',1,'ciphers::HillCipher']]],
-  ['generate_5fn_14',['generate_n',['http://en.cppreference.com/w/cpp/algorithm/generate_n.html',0,'std']]],
-  ['generate_5fpossible_5fmoves_15',['generate_possible_moves',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658',1,'machine_learning::aystar_search::EightPuzzle']]],
-  ['generate_5fsamples_16',['generate_samples',['../db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf',1,'math::monte_carlo']]],
-  ['generate_5funiform_17',['generate_uniform',['../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba',1,'probability::geometric_dist']]],
-  ['generateunsortedarray_18',['generateUnsortedArray',['../d1/daa/random__pivot__quick__sort_8cpp.html#a40675d2eb960c71ca31ec475ba90120d',1,'sorting::random_pivot_quick_sort']]],
-  ['generic_5fcategory_19',['generic_category',['http://en.cppreference.com/w/cpp/error/generic_category.html',0,'std']]],
-  ['geometric_5fdistribution_20',['geometric_distribution',['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/geometric_distribution.html',0,'std::geometric_distribution::geometric_distribution()'],['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797',1,'probability::geometric_dist::geometric_distribution::geometric_distribution()']]],
-  ['get_21',['get',['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::fstream::get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::get()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html',0,'std::shared_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_fstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::iostream::get()'],['http://en.cppreference.com/w/cpp/thread/shared_future/get.html',0,'std::shared_future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::stringstream::get()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html',0,'std::unique_ptr::get()'],['http://en.cppreference.com/w/cpp/thread/future/get.html',0,'std::future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wifstream::get()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/get.html',0,'std::reference_wrapper::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::strstream::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_stringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istrstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wiostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_ifstream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istringstream::get()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/get.html',0,'std::auto_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wfstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_iostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wstringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::ifstream::get()'],['../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a',1,'dsu::get()'],['../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8',1,'catalan_numbers::get()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420',1,'machine_learning::aystar_search::EightPuzzle::get()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781',1,'others::Cache::LFUCache::get()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea',1,'others::Cache::LRUCache::get()']]],
-  ['get_5fall_5fwords_22',['get_all_words',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd',1,'data_structures::trie_using_hashmap::Trie']]],
-  ['get_5fallocator_23',['get_allocator',['http://en.cppreference.com/w/cpp/container/vector/get_allocator.html',0,'std::vector::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::match_results::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multiset/get_allocator.html',0,'std::multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/set/get_allocator.html',0,'std::set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_map/get_allocator.html',0,'std::unordered_map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wsmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::smatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/get_allocator.html',0,'std::unordered_multimap::get_allocator()'],['http://en.cppreference.com/w/cpp/container/forward_list/get_allocator.html',0,'std::forward_list::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wcmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/deque/get_allocator.html',0,'std::deque::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::basic_string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::wstring::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/get_allocator.html',0,'std::unordered_multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u16string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u32string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/list/get_allocator.html',0,'std::list::get_allocator()'],['http://en.cppreference.com/w/cpp/container/map/get_allocator.html',0,'std::map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::cmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_set/get_allocator.html',0,'std::unordered_set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multimap/get_allocator.html',0,'std::multimap::get_allocator()']]],
-  ['get_5fchar_24',['get_char',['../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da',1,'hashing::sha256']]],
-  ['get_5fchar_5fidx_25',['get_char_idx',['../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41',1,'ciphers::HillCipher']]],
-  ['get_5fclock_5fdiff_26',['get_clock_diff',['../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_trace.cpp']]],
-  ['get_5fdate_27',['get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::get_date()']]],
-  ['get_5fdeleter_28',['get_deleter',['http://en.cppreference.com/w/cpp/memory/unique_ptr/get_deleter.html',0,'std::unique_ptr']]],
-  ['get_5felements_5finorder_29',['get_elements_inorder',['../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a',1,'binary_search_tree']]],
-  ['get_5felements_5fpostorder_30',['get_elements_postorder',['../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff',1,'binary_search_tree']]],
-  ['get_5felements_5fpreorder_31',['get_elements_preorder',['../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13',1,'binary_search_tree']]],
-  ['get_5ffinal_5fstatus_32',['get_final_status',['../df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86',1,'fcfs_scheduling.cpp']]],
-  ['get_5ffuture_33',['get_future',['http://en.cppreference.com/w/cpp/thread/promise/get_future.html',0,'std::promise::get_future()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/get_future.html',0,'std::packaged_task::get_future()']]],
-  ['get_5fid_34',['get_id',['http://en.cppreference.com/w/cpp/thread/thread/get_id.html',0,'std::thread::get_id()'],['http://en.cppreference.com/w/cpp/thread/get_id.html',0,'std::this_thread::get_id()']]],
-  ['get_5fidx_5fchar_35',['get_idx_char',['../d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c',1,'ciphers::HillCipher']]],
-  ['get_5finput_36',['get_input',['../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1',1,'ternary_search.cpp']]],
-  ['get_5fintersection_37',['get_intersection',['../da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e',1,'operations_on_datastructures']]],
-  ['get_5finverse_38',['get_inverse',['../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7',1,'ciphers::HillCipher::get_inverse()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a',1,'get_inverse():&#160;ordinary_least_squares_regressor.cpp']]],
-  ['get_5fk_5fth_39',['get_k_th',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69',1,'data_structures::treap::Treap']]],
-  ['get_5flevel_5forder_40',['get_level_order',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree']]],
-  ['get_5fmax_41',['get_max',['../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde',1,'dsu']]],
-  ['get_5fmin_42',['get_min',['../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415',1,'dsu']]],
-  ['get_5fmin_5f2d_43',['get_min_2d',['../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e',1,'kohonen_som_topology.cpp']]],
-  ['get_5fminima_44',['get_minima',['../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b):&#160;brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b):&#160;golden_search_extrema.cpp']]],
-  ['get_5fmoney_45',['get_money',['http://en.cppreference.com/w/cpp/io/manip/get_money.html',0,'std']]],
-  ['get_5fmonthname_46',['get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::get_monthname()']]],
-  ['get_5fnew_5fhandler_47',['get_new_handler',['http://en.cppreference.com/w/cpp/memory/new/get_new_handler.html',0,'std']]],
-  ['get_5fnext_48',['get_next',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4',1,'data_structures::treap::Treap']]],
-  ['get_5fpointer_5fsafety_49',['get_pointer_safety',['http://en.cppreference.com/w/cpp/memory/gc/get_pointer_safety.html',0,'std']]],
-  ['get_5fpredecessor_50',['get_predecessor',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126',1,'data_structures::treap::Treap']]],
-  ['get_5frand_51',['get_rand',['../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0',1,'complex_numbers.cpp']]],
-  ['get_5frank_52',['get_rank',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039',1,'data_structures::treap::Treap']]],
-  ['get_5fshape_53',['get_shape',['../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078',1,'machine_learning']]],
-  ['get_5fsize_54',['get_size',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f',1,'machine_learning::aystar_search::EightPuzzle']]],
-  ['get_5fstate_55',['get_state',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99',1,'machine_learning::aystar_search::EightPuzzle']]],
-  ['get_5ftemporary_5fbuffer_56',['get_temporary_buffer',['http://en.cppreference.com/w/cpp/memory/get_temporary_buffer.html',0,'std']]],
-  ['get_5fterminate_57',['get_terminate',['http://en.cppreference.com/w/cpp/error/get_terminate.html',0,'std']]],
-  ['get_5ftest_5fcases_58',['get_test_cases',['../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c',1,'longest_common_string.cpp']]],
-  ['get_5ftime_59',['get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::get_time()'],['http://en.cppreference.com/w/cpp/io/manip/get_time.html',0,'std::get_time()']]],
-  ['get_5ftranspose_60',['get_transpose',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb',1,'ordinary_least_squares_regressor.cpp']]],
-  ['get_5funexpected_61',['get_unexpected',['http://en.cppreference.com/w/cpp/error/get_unexpected.html',0,'std']]],
-  ['get_5funion_62',['get_union',['../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74',1,'operations_on_datastructures']]],
-  ['get_5fweekday_63',['get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::get_weekday()']]],
-  ['get_5fxy_5ffrom_5fcsv_64',['get_XY_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d',1,'machine_learning::neural_network::NeuralNetwork']]],
-  ['get_5fyear_65',['get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::get_year()']]],
-  ['getadjacencylist_66',['getAdjacencyList',['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a5e84b175ef768ff58eaeededd43e8368',1,'graph::topological_sort::Graph']]],
-  ['getadjlist_67',['getAdjList',['../da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d',1,'Graph']]],
-  ['getbalance_68',['getBalance',['../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546',1,'avltree.cpp']]],
-  ['getc_69',['getc',['http://en.cppreference.com/w/cpp/io/c/fgetc.html',0,'std']]],
-  ['getchar_70',['getchar',['http://en.cppreference.com/w/cpp/io/c/getchar.html',0,'std']]],
-  ['getchild_71',['GetChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4',1,'data_structures::tree_234::Node']]],
-  ['getchildindex_72',['GetChildIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad632a0440295bc88ceadae7478fe0d37',1,'data_structures::tree_234::Node']]],
-  ['getconnectedcomponents_73',['getConnectedComponents',['../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b',1,'graph']]],
-  ['getconvexhull_74',['getConvexHull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1',1,'geometry::jarvis::Convexhull']]],
-  ['getcount_75',['GetCount',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06',1,'data_structures::tree_234::Node']]],
-  ['getenv_76',['getenv',['http://en.cppreference.com/w/cpp/utility/program/getenv.html',0,'std']]],
-  ['getfailurearray_77',['getFailureArray',['../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9',1,'string_search']]],
-  ['gethits_78',['getHits',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933',1,'others::lru_cache::LRUCache']]],
-  ['getinordersuccessor_79',['getInorderSuccessor',['../d4/d32/inorder__successor__of__bst_8cpp.html#a3923fb22b46e085376703cae0b44d690',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
-  ['getitem_80',['GetItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3',1,'data_structures::tree_234::Node']]],
-  ['getitemindex_81',['GetItemIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a650f0ef26b7450e1addb5d80bb0ed629',1,'data_structures::tree_234::Node']]],
-  ['getitemleftchild_82',['GetItemLeftChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab654d7376d3449fdc78edab0e7fed06e',1,'data_structures::tree_234::Node']]],
-  ['getitemrightchild_83',['GetItemRightChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a441cbee9896391f2b167d5aa7b4f8c95',1,'data_structures::tree_234::Node']]],
-  ['getleftmostchild_84',['GetLeftmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e',1,'data_structures::tree_234::Node']]],
-  ['getline_85',['getline',['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::strstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istrstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wiostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_ifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wfstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wstringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::ifstream::getline()'],['http://en.cppreference.com/w/cpp/string/basic_string/getline.html',0,'std::getline()']]],
-  ['getloc_86',['getloc',['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::regex::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::basic_regex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ios::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::wregex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wfilebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ios_base::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::strstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wifstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/getloc.html',0,'std::regex_traits::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::strstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wiostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ifstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wfstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wstringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ifstream::getloc()']]],
-  ['getmaxitem_87',['GetMaxItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57',1,'data_structures::tree_234::Node']]],
-  ['getmedian_88',['getMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d',1,'probability::windowed_median::WindowedMedian']]],
-  ['getmediannaive_89',['getMedianNaive',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6',1,'probability::windowed_median::WindowedMedian']]],
-  ['getmin_90',['getMin',['../d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130',1,'MinHeap']]],
-  ['getminitem_91',['GetMinItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71',1,'data_structures::tree_234::Node']]],
-  ['getnextpossiblechild_92',['GetNextPossibleChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46',1,'data_structures::tree_234::Node']]],
-  ['getnode_93',['getNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
-  ['getnode_94',['getnode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be',1,'linkedlist_implentation_usingarray.cpp']]],
-  ['getnumnodes_95',['getNumNodes',['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#ad22018e4f4f80aecb0538044bb83d096',1,'graph::topological_sort::Graph']]],
-  ['getpagefault_96',['getPageFault',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2',1,'others::lru_cache::LRUCache']]],
-  ['getparents_97',['getParents',['../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280',1,'dsu']]],
-  ['getrandomindex_98',['getRandomIndex',['../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5',1,'sorting::random_pivot_quick_sort']]],
-  ['getrightmostchild_99',['GetRightmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94',1,'data_structures::tree_234::Node']]],
-  ['gets_100',['gets',['http://en.cppreference.com/w/cpp/io/c/gets.html',0,'std']]],
-  ['gettreemaxitem_101',['GetTreeMaxItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657',1,'data_structures::tree_234::Tree234']]],
-  ['gettreeminitem_102',['GetTreeMinItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36',1,'data_structures::tree_234::Tree234']]],
-  ['getvertices_103',['getVertices',['../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1',1,'Graph']]],
-  ['getwchar_104',['getwchar',['http://en.cppreference.com/w/cpp/io/c/getwchar.html',0,'std']]],
-  ['global_105',['global',['http://en.cppreference.com/w/cpp/locale/locale/global.html',0,'std::locale']]],
-  ['gmtime_106',['gmtime',['http://en.cppreference.com/w/cpp/chrono/c/gmtime.html',0,'std']]],
-  ['gnomesort_107',['gnomeSort',['../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1',1,'sorting::gnomeSort(T *arr, int size)'],['../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935',1,'sorting::gnomeSort(std::array&lt; T, size &gt; arr)']]],
-  ['good_108',['good',['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ios::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::strstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wiostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wfstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wstringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ifstream::good()']]],
-  ['gptr_109',['gptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::gptr()']]],
-  ['gram_5fschmidt_110',['gram_schmidt',['../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5',1,'numerical_methods::gram_schmidt']]],
-  ['graph_111',['Graph',['../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d',1,'Graph::Graph(unsigned int vertices, AdjList adjList)'],['../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3',1,'Graph::Graph(unsigned int vertices, AdjList &amp;&amp;adjList)'],['../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1',1,'Graph::Graph(unsigned int vertices, std::vector&lt; Edge &gt; const &amp;edges)'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3',1,'graph::is_graph_bipartite::Graph::Graph()'],['../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5',1,'graph::Graph::Graph()'],['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a75a849f80a66304e7da39b3ccd6129d6',1,'graph::topological_sort::Graph::Graph()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc',1,'greedy_algorithms::dijkstra::Graph::Graph()']]],
-  ['graphcoloring_112',['graphColoring',['../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c',1,'backtracking::graph_coloring']]],
-  ['grouping_113',['grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::grouping()']]]
+  ['gcd_2',['gcd',['../d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0',1,'ciphers::HillCipher::gcd()'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd():&#160;gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#a1161713c662a14c2d5e33504f4324532',1,'math::gcd_of_n_numbers::gcd()'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2):&#160;gcd_recursive_euclidean.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563',1,'gcd(unsigned int x, unsigned int y):&#160;least_common_multiple.cpp']]],
+  ['gcd_5ftwo_3',['gcd_two',['../d1/d11/gcd__of__n__numbers_8cpp.html#a509a35e11ed1e17a9e00dd56320a4181',1,'math::gcd_of_n_numbers']]],
+  ['gcdextended_4',['gcdExtended',['../de/dab/ncr__modulo__p_8cpp.html#a9010ad5669d31449c3bf3271ab5ebc86',1,'math::ncr_modulo_p::utils']]],
+  ['genarray_5',['genArray',['../db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5',1,'spiral_print.cpp']]],
+  ['generate_6',['generate',['../df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160',1,'backtracking::generate_parentheses']]],
+  ['generate_5fdecryption_5fkey_7',['generate_decryption_key',['../d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706',1,'ciphers::HillCipher']]],
+  ['generate_5fencryption_5fkey_8',['generate_encryption_key',['../d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e',1,'ciphers::HillCipher']]],
+  ['generate_5fkeys_9',['generate_keys',['../d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5',1,'ciphers::HillCipher']]],
+  ['generate_5fpossible_5fmoves_10',['generate_possible_moves',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a26a976171392d257ca0f814ed73e0658',1,'machine_learning::aystar_search::EightPuzzle']]],
+  ['generate_5fsamples_11',['generate_samples',['../db/d40/integral__approximation2_8cpp.html#a71249ee535f16f8ed2e9cc8f0199a2cf',1,'math::monte_carlo']]],
+  ['generate_5funiform_12',['generate_uniform',['../de/d72/geometric__dist_8cpp.html#a82964ca6180507deb5fafc71050012ba',1,'probability::geometric_dist']]],
+  ['generateunsortedarray_13',['generateUnsortedArray',['../d1/daa/random__pivot__quick__sort_8cpp.html#a40675d2eb960c71ca31ec475ba90120d',1,'sorting::random_pivot_quick_sort']]],
+  ['geometric_5fdistribution_14',['geometric_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aa12088ba133dd0910103db0eb0ef2797',1,'probability::geometric_dist::geometric_distribution']]],
+  ['get_15',['get',['../dd/d1f/classdsu.html#a0ce2672c570f4235eafddb0c9a58115a',1,'dsu::get()'],['../dc/d1f/classcatalan__numbers.html#a54655c66cf89186d3d1fa90829b28ab8',1,'catalan_numbers::get()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa5c0486c7f29f323a2aced2ab33af420',1,'machine_learning::aystar_search::EightPuzzle::get()'],['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a58e37d3713f28d36abbb8cdf6c432781',1,'others::Cache::LFUCache::get()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ac1be0357ecc7c34144f3d9a63c6cb3ea',1,'others::Cache::LRUCache::get()']]],
+  ['get_5fall_5fwords_16',['get_all_words',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#a7bbe538c8015e8ce158e7ed43f605ebd',1,'data_structures::trie_using_hashmap::Trie']]],
+  ['get_5fchar_17',['get_char',['../d4/d08/sha256_8cpp.html#a9e98c180d32b04aab6f767cb0c13e1da',1,'hashing::sha256']]],
+  ['get_5fchar_5fidx_18',['get_char_idx',['../d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41',1,'ciphers::HillCipher']]],
+  ['get_5fclock_5fdiff_19',['get_clock_diff',['../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t):&#160;kohonen_som_trace.cpp']]],
+  ['get_5felements_5finorder_20',['get_elements_inorder',['../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a',1,'binary_search_tree']]],
+  ['get_5felements_5fpostorder_21',['get_elements_postorder',['../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff',1,'binary_search_tree']]],
+  ['get_5felements_5fpreorder_22',['get_elements_preorder',['../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13',1,'binary_search_tree']]],
+  ['get_5ffinal_5fstatus_23',['get_final_status',['../df/d47/fcfs__scheduling_8cpp.html#a8f2b90cb64d63a7080965e66a05ccf86',1,'fcfs_scheduling.cpp']]],
+  ['get_5fidx_5fchar_24',['get_idx_char',['../d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c',1,'ciphers::HillCipher']]],
+  ['get_5finput_25',['get_input',['../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1',1,'ternary_search.cpp']]],
+  ['get_5fintersection_26',['get_intersection',['../da/d6d/namespaceoperations__on__datastructures.html#adaf9a06f0c236c2d95c97e441ea2d12e',1,'operations_on_datastructures']]],
+  ['get_5finverse_27',['get_inverse',['../d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7',1,'ciphers::HillCipher::get_inverse()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#af7243bdc6ae3c7169f01b85bb226e66a',1,'get_inverse():&#160;ordinary_least_squares_regressor.cpp']]],
+  ['get_5fk_5fth_28',['get_k_th',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69',1,'data_structures::treap::Treap']]],
+  ['get_5flevel_5forder_29',['get_level_order',['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree']]],
+  ['get_5fmax_30',['get_max',['../dd/d1f/classdsu.html#a696141b8b092466767f4bfe1c5e46cde',1,'dsu']]],
+  ['get_5fmin_31',['get_min',['../dd/d1f/classdsu.html#ac713a5b496d0405c82e2808a85e58415',1,'dsu']]],
+  ['get_5fmin_5f2d_32',['get_min_2d',['../d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e',1,'kohonen_som_topology.cpp']]],
+  ['get_5fminima_33',['get_minima',['../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b):&#160;brent_method_extrema.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b',1,'get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b):&#160;golden_search_extrema.cpp']]],
+  ['get_5fnext_34',['get_next',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4',1,'data_structures::treap::Treap']]],
+  ['get_5fpredecessor_35',['get_predecessor',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126',1,'data_structures::treap::Treap']]],
+  ['get_5frand_36',['get_rand',['../d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0',1,'complex_numbers.cpp']]],
+  ['get_5frank_37',['get_rank',['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039',1,'data_structures::treap::Treap']]],
+  ['get_5fshape_38',['get_shape',['../d8/d77/namespacemachine__learning.html#aa4bbf61e65f8cd297255fa94b983d078',1,'machine_learning']]],
+  ['get_5fsize_39',['get_size',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ae145ac4a0d2ec58945b58fad3c04f00f',1,'machine_learning::aystar_search::EightPuzzle']]],
+  ['get_5fstate_40',['get_state',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#ade14b0e1a88543b91426e2008e4d0f99',1,'machine_learning::aystar_search::EightPuzzle']]],
+  ['get_5ftest_5fcases_41',['get_test_cases',['../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c',1,'longest_common_string.cpp']]],
+  ['get_5ftranspose_42',['get_transpose',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb',1,'ordinary_least_squares_regressor.cpp']]],
+  ['get_5funion_43',['get_union',['../da/d6d/namespaceoperations__on__datastructures.html#a2b8ff06a84b041457873840bf82e2d74',1,'operations_on_datastructures']]],
+  ['get_5fxy_5ffrom_5fcsv_44',['get_XY_from_csv',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a650c677fd6512665741ddd9b7983275d',1,'machine_learning::neural_network::NeuralNetwork']]],
+  ['getadjacencylist_45',['getAdjacencyList',['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a5e84b175ef768ff58eaeededd43e8368',1,'graph::topological_sort::Graph']]],
+  ['getadjlist_46',['getAdjList',['../da/d9a/class_graph.html#a5a090e1a63a5c47bdd1a539b21f7fd1d',1,'Graph']]],
+  ['getbalance_47',['getBalance',['../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546',1,'avltree.cpp']]],
+  ['getchild_48',['GetChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4',1,'data_structures::tree_234::Node']]],
+  ['getchildindex_49',['GetChildIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad632a0440295bc88ceadae7478fe0d37',1,'data_structures::tree_234::Node']]],
+  ['getconnectedcomponents_50',['getConnectedComponents',['../df/dce/namespacegraph.html#a83ab16e96cec644109a58dfc9329bc2b',1,'graph']]],
+  ['getconvexhull_51',['getConvexHull',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#aeec46e86786ddd461464b07a77c4d5f1',1,'geometry::jarvis::Convexhull']]],
+  ['getcount_52',['GetCount',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aac82e17daa088ede9ee00dc69c1e6f06',1,'data_structures::tree_234::Node']]],
+  ['getfailurearray_53',['getFailureArray',['../d9/d03/namespacestring__search.html#a83c72ff237cdf623e42d4295e0029bf9',1,'string_search']]],
+  ['gethits_54',['getHits',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aa24a141455b9fbcbec22392c28d04933',1,'others::lru_cache::LRUCache']]],
+  ['getinordersuccessor_55',['getInorderSuccessor',['../d4/d32/inorder__successor__of__bst_8cpp.html#a3923fb22b46e085376703cae0b44d690',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
+  ['getitem_56',['GetItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4808acb43668ff8cfd6f7cb44ceedad3',1,'data_structures::tree_234::Node']]],
+  ['getitemindex_57',['GetItemIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a650f0ef26b7450e1addb5d80bb0ed629',1,'data_structures::tree_234::Node']]],
+  ['getitemleftchild_58',['GetItemLeftChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ab654d7376d3449fdc78edab0e7fed06e',1,'data_structures::tree_234::Node']]],
+  ['getitemrightchild_59',['GetItemRightChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a441cbee9896391f2b167d5aa7b4f8c95',1,'data_structures::tree_234::Node']]],
+  ['getleftmostchild_60',['GetLeftmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e',1,'data_structures::tree_234::Node']]],
+  ['getmaxitem_61',['GetMaxItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57',1,'data_structures::tree_234::Node']]],
+  ['getmedian_62',['getMedian',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d',1,'probability::windowed_median::WindowedMedian']]],
+  ['getmediannaive_63',['getMedianNaive',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6',1,'probability::windowed_median::WindowedMedian']]],
+  ['getmin_64',['getMin',['../d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130',1,'MinHeap']]],
+  ['getminitem_65',['GetMinItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71',1,'data_structures::tree_234::Node']]],
+  ['getnextpossiblechild_66',['GetNextPossibleChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46',1,'data_structures::tree_234::Node']]],
+  ['getnode_67',['getNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a824cbf1814854824cf05f062eea07b95',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
+  ['getnode_68',['getnode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be',1,'linkedlist_implentation_usingarray.cpp']]],
+  ['getnumnodes_69',['getNumNodes',['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#ad22018e4f4f80aecb0538044bb83d096',1,'graph::topological_sort::Graph']]],
+  ['getpagefault_70',['getPageFault',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a78be932dac71c90f485a67d4fda877e2',1,'others::lru_cache::LRUCache']]],
+  ['getparents_71',['getParents',['../dd/d1f/classdsu.html#ab8ee27083a3c2e2df80755165a2ec280',1,'dsu']]],
+  ['getrandomindex_72',['getRandomIndex',['../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5',1,'sorting::random_pivot_quick_sort']]],
+  ['getrightmostchild_73',['GetRightmostChild',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a731f9ae385840cf0a06d55e7f9924a94',1,'data_structures::tree_234::Node']]],
+  ['gettreemaxitem_74',['GetTreeMaxItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657',1,'data_structures::tree_234::Tree234']]],
+  ['gettreeminitem_75',['GetTreeMinItem',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36',1,'data_structures::tree_234::Tree234']]],
+  ['getvertices_76',['getVertices',['../da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1',1,'Graph']]],
+  ['gnomesort_77',['gnomeSort',['../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1',1,'sorting::gnomeSort(T *arr, int size)'],['../d5/d91/namespacesorting.html#aa3677f87b5b4756bc77e9e34c5f27935',1,'sorting::gnomeSort(std::array&lt; T, size &gt; arr)']]],
+  ['gram_5fschmidt_78',['gram_schmidt',['../d5/d33/gram__schmidt_8cpp.html#a0837468e1a653ed056e2cce3c914afa5',1,'numerical_methods::gram_schmidt']]],
+  ['graph_79',['Graph',['../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d',1,'Graph::Graph(unsigned int vertices, AdjList adjList)'],['../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3',1,'Graph::Graph(unsigned int vertices, AdjList &amp;&amp;adjList)'],['../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1',1,'Graph::Graph(unsigned int vertices, std::vector&lt; Edge &gt; const &amp;edges)'],['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3',1,'graph::is_graph_bipartite::Graph::Graph()'],['../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5',1,'graph::Graph::Graph()'],['../d5/dec/classgraph_1_1topological__sort_1_1_graph.html#a75a849f80a66304e7da39b3ccd6129d6',1,'graph::topological_sort::Graph::Graph()'],['../d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#afefaeb247734a7c64bd04e68e3c1c4bc',1,'greedy_algorithms::dijkstra::Graph::Graph()']]],
+  ['graphcoloring_80',['graphColoring',['../d3/d40/graph__coloring_8cpp.html#a40337efc5dad761096489bf2c5b1c80c',1,'backtracking::graph_coloring']]]
 ];
diff --git a/search/functions_8.js b/search/functions_8.js
index fb30c8dae..3ce5e168e 100644
--- a/search/functions_8.js
+++ b/search/functions_8.js
@@ -5,31 +5,23 @@ var searchData=
   ['hadamard_5fproduct_2',['hadamard_product',['../d8/d77/namespacemachine__learning.html#acafa3e62b686aebdbad81c4f89913f43',1,'machine_learning']]],
   ['hamilton_5fcycle_3',['hamilton_cycle',['../dd/d0c/hamiltons__cycle_8cpp.html#abcf824e347eecfeeb69ea0280f34f3e4',1,'hamiltons_cycle.cpp']]],
   ['hamming_5fdistance_4',['hamming_distance',['../d4/d48/hamming__distance_8cpp.html#abfe6fbb2f3460a2623c96f283178a07a',1,'bit_manipulation::hamming_distance::hamming_distance(uint64_t a, uint64_t b)'],['../d4/d48/hamming__distance_8cpp.html#a40ba9fe8b5df5c268f0c7d677ff2fe80',1,'bit_manipulation::hamming_distance::hamming_distance(const std::string &amp;a, const std::string &amp;b)']]],
-  ['hardware_5fconcurrency_5',['hardware_concurrency',['http://en.cppreference.com/w/cpp/thread/thread/hardware_concurrency.html',0,'std::thread']]],
-  ['has_5ffacet_6',['has_facet',['http://en.cppreference.com/w/cpp/locale/has_facet.html',0,'std']]],
-  ['haschildren_7',['hasChildren',['../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb',1,'Trie']]],
-  ['hash_8',['hash',['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate_byname::hash()'],['http://en.cppreference.com/w/cpp/utility/hash/hash.html',0,'std::hash::hash()'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate::hash()'],['../dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64',1,'hash_chain::hash()'],['../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb',1,'hashing::md5::hash()'],['../d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c',1,'hashing::sha1::hash()']]],
-  ['hash_5fbs_9',['hash_bs',['../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425',1,'hashing::md5::hash_bs()'],['../d8/d7a/sha1_8cpp.html#a7be3471f7e489d7d0df42b97a48bf141',1,'hashing::sha1::hash_bs()']]],
-  ['hash_5fchain_10',['hash_chain',['../dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595',1,'hash_chain']]],
-  ['hash_5fcode_11',['hash_code',['http://en.cppreference.com/w/cpp/types/type_info/hash_code.html',0,'std::type_info::hash_code()'],['http://en.cppreference.com/w/cpp/types/type_index/hash_code.html',0,'std::type_index::hash_code()']]],
-  ['hash_5ffunction_12',['hash_function',['http://en.cppreference.com/w/cpp/container/unordered_map/hash_function.html',0,'std::unordered_map::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/hash_function.html',0,'std::unordered_multimap::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/hash_function.html',0,'std::unordered_multiset::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_set/hash_function.html',0,'std::unordered_set::hash_function()']]],
-  ['hash_5fsearch_13',['hash_search',['../d1/df3/hash__search_8cpp.html#a36ea13c16028f18ef2d5ff47f3fda7a2',1,'hash_search.cpp']]],
-  ['hashdjb2_14',['hashDJB2',['../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4',1,'data_structures']]],
-  ['hashfxn_15',['hashFxn',['../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003',1,'double_hashing::hashFxn()'],['../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527',1,'linear_probing::hashFxn()'],['../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7',1,'quadratic_probing::hashFxn()']]],
-  ['hashint_5f1_16',['hashInt_1',['../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677',1,'data_structures']]],
-  ['hashint_5f2_17',['hashInt_2',['../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c',1,'data_structures']]],
-  ['hashstr_18',['hashStr',['../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15',1,'data_structures']]],
-  ['heapsort_19',['heapSort',['../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f',1,'heap_sort.cpp']]],
-  ['height_20',['height',['../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83',1,'avltree.cpp']]],
-  ['hemi_5fsphere_5fsurface_5farea_21',['hemi_sphere_surface_area',['../dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb',1,'math']]],
-  ['hex_22',['hex',['http://en.cppreference.com/w/cpp/io/manip/hex.html',0,'std']]],
-  ['hexfloat_23',['hexfloat',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]],
-  ['hkgraph_24',['HKGraph',['../d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9',1,'graph::HKGraph::HKGraph()'],['../d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64',1,'graph::HKGraph::HKGraph(int m, int n)']]],
-  ['hld_25',['HLD',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a6e486767434e44076c1ac374a22da726',1,'range_queries::heavy_light_decomposition::HLD']]],
-  ['hopcroftkarpalgorithm_26',['hopcroftKarpAlgorithm',['../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d',1,'graph::HKGraph']]],
-  ['horizontal_5frange_27',['horizontal_range',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a10362eb607d7882bac3a0688504b00ff',1,'physics::ground_to_ground_projectile_motion']]],
-  ['horspool_28',['horspool',['../d3/dfe/horspool_8cpp.html#a9884bca75ce39c116697ea2574adb37d',1,'strings::horspool']]],
-  ['hours_29',['hours',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::hours']]],
-  ['houserobber_30',['houseRobber',['../d6/d26/house__robber_8cpp.html#a1e497c3e3f169afe5baaae6a5d40cbc8',1,'dynamic_programming::house_robber']]],
-  ['hypot_31',['hypot',['http://en.cppreference.com/w/cpp/numeric/math/hypot.html',0,'std']]]
+  ['haschildren_5',['hasChildren',['../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb',1,'Trie']]],
+  ['hash_6',['hash',['../dd/d1c/classhash__chain.html#a846a2f921f8fb7ea572e03901b671d64',1,'hash_chain::hash()'],['../d5/d96/md5_8cpp.html#a88705fab5f92adf3427b4cf76ff33edb',1,'hashing::md5::hash()'],['../d8/d7a/sha1_8cpp.html#a2397f2444a05e4d1487c67e215410d3c',1,'hashing::sha1::hash()']]],
+  ['hash_5fbs_7',['hash_bs',['../d5/d96/md5_8cpp.html#a5341431cef7fcfc33794326e1deb2425',1,'hashing::md5::hash_bs()'],['../d8/d7a/sha1_8cpp.html#a7be3471f7e489d7d0df42b97a48bf141',1,'hashing::sha1::hash_bs()']]],
+  ['hash_5fchain_8',['hash_chain',['../dd/d1c/classhash__chain.html#a80c8b902a15b4fd062ed727ecf8f3595',1,'hash_chain']]],
+  ['hash_5fsearch_9',['hash_search',['../d1/df3/hash__search_8cpp.html#a36ea13c16028f18ef2d5ff47f3fda7a2',1,'hash_search.cpp']]],
+  ['hashdjb2_10',['hashDJB2',['../d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4',1,'data_structures']]],
+  ['hashfxn_11',['hashFxn',['../d0/d65/namespacedouble__hashing.html#a0d90726ed1de7b3d2ae261baed048003',1,'double_hashing::hashFxn()'],['../d8/d89/namespacelinear__probing.html#a4bde7a47f98dd1ad24c84038e2608527',1,'linear_probing::hashFxn()'],['../d4/dd2/namespacequadratic__probing.html#a2093d91dd3d377cf0a5c939e45dcefc7',1,'quadratic_probing::hashFxn()']]],
+  ['hashint_5f1_12',['hashInt_1',['../d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677',1,'data_structures']]],
+  ['hashint_5f2_13',['hashInt_2',['../d5/d3c/namespacedata__structures.html#a9ed236419034917c5270c1dccd220b5c',1,'data_structures']]],
+  ['hashstr_14',['hashStr',['../d5/d3c/namespacedata__structures.html#a35eb2bc3edbb52f9c5f0b1e51046ef15',1,'data_structures']]],
+  ['heapsort_15',['heapSort',['../d5/d4c/group__sorting.html#ga29d28b140174dbdde7c9f5157758435f',1,'heap_sort.cpp']]],
+  ['height_16',['height',['../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83',1,'avltree.cpp']]],
+  ['hemi_5fsphere_5fsurface_5farea_17',['hemi_sphere_surface_area',['../dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb',1,'math']]],
+  ['hkgraph_18',['HKGraph',['../d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9',1,'graph::HKGraph::HKGraph()'],['../d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64',1,'graph::HKGraph::HKGraph(int m, int n)']]],
+  ['hld_19',['HLD',['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a6e486767434e44076c1ac374a22da726',1,'range_queries::heavy_light_decomposition::HLD']]],
+  ['hopcroftkarpalgorithm_20',['hopcroftKarpAlgorithm',['../d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d',1,'graph::HKGraph']]],
+  ['horizontal_5frange_21',['horizontal_range',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#a10362eb607d7882bac3a0688504b00ff',1,'physics::ground_to_ground_projectile_motion']]],
+  ['horspool_22',['horspool',['../d3/dfe/horspool_8cpp.html#a9884bca75ce39c116697ea2574adb37d',1,'strings::horspool']]],
+  ['houserobber_23',['houseRobber',['../d6/d26/house__robber_8cpp.html#a1e497c3e3f169afe5baaae6a5d40cbc8',1,'dynamic_programming::house_robber']]]
 ];
diff --git a/search/functions_9.js b/search/functions_9.js
index 7f71a4813..7b58d6a9b 100644
--- a/search/functions_9.js
+++ b/search/functions_9.js
@@ -1,133 +1,67 @@
 var searchData=
 [
-  ['id_0',['id',['http://en.cppreference.com/w/cpp/locale/locale/id/id.html',0,'std::locale::id::id()'],['http://en.cppreference.com/w/cpp/thread/thread/id/id.html',0,'std::thread::id::id()']]],
-  ['identity_5ffunction_1',['identity_function',['../d2/d58/neural__network_8cpp.html#a32c00da08f2cf641dd336270f6e3c407',1,'machine_learning::neural_network::util_functions']]],
-  ['ifstream_2',['ifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::ifstream']]],
-  ['ignore_3',['ignore',['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::fstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_fstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::iostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wistream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::stringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wifstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_istream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::strstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_stringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istrstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wiostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_istringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_ifstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wfstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_iostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wstringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wistringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::ifstream::ignore()']]],
-  ['ilogb_4',['ilogb',['http://en.cppreference.com/w/cpp/numeric/math/ilogb.html',0,'std']]],
-  ['imag_5',['imag',['http://en.cppreference.com/w/cpp/numeric/complex/imag.html',0,'std::complex::imag()'],['../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974',1,'Complex::imag()']]],
-  ['imbue_6',['imbue',['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::fstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ostringstream::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::regex::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::basic_regex::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_filebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstringbuf::imbue()'],['http://en.cppreference.com/w/cpp/io/ios_base/imbue.html',0,'std::basic_ios::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_fstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::stringbuf::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::wregex::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wfilebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::iostream::imbue()'],['http://en.cppreference.com/w/cpp/io/ios_base/imbue.html',0,'std::ios_base::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wistream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstreambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::stringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::strstreambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wifstream::imbue()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/imbue.html',0,'std::regex_traits::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_istream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_stringbuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::strstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_streambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_stringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wostringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istrstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::filebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wiostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_istringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ifstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::streambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostrstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wfstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_iostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wstringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wistringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ifstream::imbue()']]],
-  ['imod_7',['imod',['../d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6',1,'modular_inverse_simple.cpp']]],
-  ['in_8',['in',['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_byname::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8_utf16::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf16::in()']]],
-  ['in_5favail_9',['in_avail',['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_filebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wstringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::stringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wfilebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wstreambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::strstreambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_stringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_streambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::filebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::streambuf::in_avail()']]],
-  ['in_5frange_10',['in_range',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e',1,'machine_learning::aystar_search::EightPuzzle']]],
-  ['includes_11',['includes',['http://en.cppreference.com/w/cpp/algorithm/includes.html',0,'std']]],
-  ['increase_5ffrequency_12',['increase_frequency',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9',1,'others::Cache::LFUCache']]],
-  ['independent_5fbits_5fengine_13',['independent_bits_engine',['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/independent_bits_engine.html',0,'std::independent_bits_engine']]],
-  ['infinity_14',['infinity',['http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html',0,'std::numeric_limits']]],
-  ['info_15',['Info',['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7',1,'machine_learning::aystar_search::AyStarSearch::Info::Info()=default'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a695e4314ebc3ab58e13004dc63599fe8',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Puzzle &amp;A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3950824936488f66408313b1f8a8ca8',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Puzzle &amp;A, size_t h_value, size_t d)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a572de12115e39e34dde6e68b707d59f5',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Info &amp;A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a6abc89925ae7055a63b428e61525ad7a',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Info &amp;&amp;A) noexcept']]],
-  ['init_16',['init',['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ios::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::strstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wiostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wfstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wstringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ifstream::init()'],['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc',1,'range_queries::heavy_light_decomposition::Tree::init()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828',1,'range_queries::heavy_light_decomposition::HLD::init()'],['../d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214',1,'games::memory_game::init()']]],
-  ['init_5fbad_5fchar_17',['init_bad_char',['../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00',1,'strings::boyer_moore']]],
-  ['init_5fgood_5fsuffix_18',['init_good_suffix',['../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1',1,'strings::boyer_moore']]],
-  ['init_5fpattern_19',['init_pattern',['../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8',1,'strings::boyer_moore']]],
-  ['initializer_5flist_20',['initializer_list',['http://en.cppreference.com/w/cpp/utility/initializer_list/initializer_list.html',0,'std::initializer_list']]],
-  ['inner_5fallocator_21',['inner_allocator',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/inner_allocator.html',0,'std::scoped_allocator_adaptor']]],
-  ['inner_5fproduct_22',['inner_product',['http://en.cppreference.com/w/cpp/algorithm/inner_product.html',0,'std']]],
-  ['inorderiterative_23',['inOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499',1,'others::iterative_tree_traversals::BinaryTree']]],
-  ['inplace_5fmerge_24',['inplace_merge',['http://en.cppreference.com/w/cpp/algorithm/inplace_merge.html',0,'std']]],
-  ['insameunion_25',['InSameUnion',['../de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985',1,'disjoint_set.cpp']]],
-  ['insert_26',['Insert',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e',1,'data_structures::tree_234::Tree234::Insert(int64_t item)'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f',1,'data_structures::tree_234::Tree234::Insert(Node *tree, int64_t item)'],['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c',1,'operations_on_datastructures::trie_operations::Tnode::Insert()'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a3ae0bea4123fd2ce155108e88f2ef78c',1,'operations_on_datastructures::inorder_traversal_of_bst::Insert()']]],
-  ['insert_27',['insert',['http://en.cppreference.com/w/cpp/container/vector/insert.html',0,'std::vector::insert()'],['http://en.cppreference.com/w/cpp/container/multiset/insert.html',0,'std::multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::string::insert()'],['http://en.cppreference.com/w/cpp/container/set/insert.html',0,'std::set::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_map/insert.html',0,'std::unordered_map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/insert.html',0,'std::unordered_multimap::insert()'],['http://en.cppreference.com/w/cpp/container/deque/insert.html',0,'std::deque::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::basic_string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::wstring::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/insert.html',0,'std::unordered_multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u16string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u32string::insert()'],['http://en.cppreference.com/w/cpp/container/list/insert.html',0,'std::list::insert()'],['http://en.cppreference.com/w/cpp/container/map/insert.html',0,'std::map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_set/insert.html',0,'std::unordered_set::insert()'],['http://en.cppreference.com/w/cpp/container/multimap/insert.html',0,'std::multimap::insert()'],['../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778',1,'binary_search_tree::insert(std::unique_ptr&lt; bst_node &gt; &amp;node, T new_value)'],['../d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0',1,'binary_search_tree::insert(T new_value)'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1',1,'data_structures::list_array::list::insert()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1',1,'data_structures::linked_list::list::insert()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f',1,'data_structures::treap::Treap::insert()'],['../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2',1,'Trie::insert()'],['../d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546',1,'data_structures::trie::insert()'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2',1,'data_structures::trie_using_hashmap::Trie::insert()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(const std::vector&lt; int64_t &gt; &amp;values)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a3b7bbb0918c261bc216aef9e6dd39aa4',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(int64_t data)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(Node *node)'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::insert()'],['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7',1,'probability::windowed_median::WindowedMedian::insert()'],['../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b',1,'insert():&#160;avltree.cpp']]],
-  ['insert_5fafter_28',['insert_after',['http://en.cppreference.com/w/cpp/container/forward_list/insert_after.html',0,'std::forward_list']]],
-  ['insert_5felement_29',['insert_element',['../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd',1,'machine_learning']]],
-  ['insertatthebeginning_30',['insertAtTheBeginning',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df',1,'linkedlist_implentation_usingarray.cpp']]],
-  ['insertelement_31',['insertElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9',1,'data_structures::SkipList']]],
-  ['inserter_32',['inserter',['http://en.cppreference.com/w/cpp/iterator/inserter.html',0,'std']]],
-  ['insertionsort_33',['InsertionSort',['../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1',1,'sorting::merge_insertion']]],
-  ['insertionsort_34',['insertionSort',['../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9',1,'sorting::insertionSort(T *arr, int n)'],['../d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f',1,'sorting::insertionSort(std::vector&lt; T &gt; *arr)']]],
-  ['insertionsort_5fbinsrch_35',['insertionSort_binsrch',['../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68',1,'sorting']]],
-  ['insertitem_36',['InsertItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb',1,'data_structures::tree_234::Node']]],
-  ['insertitembyindex_37',['InsertItemByIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956',1,'data_structures::tree_234::Node']]],
-  ['insertkey_38',['insertKey',['../d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82',1,'MinHeap']]],
-  ['insertpostmerge_39',['InsertPostMerge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aa7e5e00033f38006a224f30bdbf3f703',1,'data_structures::tree_234::Tree234']]],
-  ['insertpresplit_40',['InsertPreSplit',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d',1,'data_structures::tree_234::Tree234']]],
-  ['inserttosorted_41',['insertToSorted',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24',1,'probability::windowed_median::WindowedMedian']]],
-  ['integral_5fapprox_42',['integral_approx',['../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11',1,'math']]],
-  ['integral_5fmonte_5fcarlo_43',['integral_monte_carlo',['../db/d40/integral__approximation2_8cpp.html#af7da9ba8932f1f48b9bbc2d80471af51',1,'math::monte_carlo']]],
-  ['interactive_44',['interactive',['../d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661',1,'interactive():&#160;md5.cpp'],['../d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661',1,'interactive():&#160;sha1.cpp']]],
-  ['internal_45',['internal',['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std']]],
-  ['interpolationsearch_46',['InterpolationSearch',['../df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629',1,'interpolation_search2.cpp']]],
-  ['intervals_47',['intervals',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/params.html',0,'std::piecewise_constant_distribution::intervals()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/params.html',0,'std::piecewise_linear_distribution::intervals()']]],
-  ['invalid_5fargument_48',['invalid_argument',['http://en.cppreference.com/w/cpp/error/invalid_argument.html',0,'std::invalid_argument']]],
-  ['inverse_5fcumulative_5fdistribution_49',['inverse_cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf',1,'probability::geometric_dist::geometric_distribution']]],
-  ['inversefastfouriertransform_50',['InverseFastFourierTransform',['../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93',1,'numerical_methods']]],
-  ['ios_5fbase_51',['ios_base',['http://en.cppreference.com/w/cpp/io/ios_base/ios_base.html',0,'std::ios_base']]],
-  ['iostream_52',['iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream/basic_iostream.html',0,'std::iostream']]],
-  ['iota_53',['iota',['http://en.cppreference.com/w/cpp/algorithm/iota.html',0,'std']]],
-  ['is_54',['is',['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype_byname::is()'],['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype::is()']]],
-  ['is2node_55',['Is2Node',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631',1,'data_structures::tree_234::Node']]],
-  ['is34node_56',['Is34Node',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18',1,'data_structures::tree_234::Node']]],
-  ['is_5farmstrong_57',['is_armstrong',['../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26',1,'dynamic_programming']]],
-  ['is_5fbipartite_58',['is_bipartite',['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad475f8b838693812f7569a490729f373',1,'graph::is_graph_bipartite::Graph']]],
-  ['is_5ffactorial_59',['is_factorial',['../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca',1,'math']]],
-  ['is_5fhappy_60',['is_happy',['../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7',1,'happy_number.cpp']]],
-  ['is_5fheap_61',['is_heap',['http://en.cppreference.com/w/cpp/algorithm/is_heap.html',0,'std']]],
-  ['is_5fheap_5funtil_62',['is_heap_until',['http://en.cppreference.com/w/cpp/algorithm/is_heap_until.html',0,'std']]],
-  ['is_5flock_5ffree_63',['is_lock_free',['http://en.cppreference.com/w/cpp/atomic/atomic/is_lock_free.html',0,'std::atomic']]],
-  ['is_5fnumber_64',['is_number',['../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59',1,'games::memory_game::is_number()'],['../d7/d75/postfix__evaluation_8cpp.html#a4c27f949c9d6659be9f5bd2ccbe1360a',1,'others::postfix_expression::is_number()']]],
-  ['is_5fopen_65',['is_open',['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::basic_ofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::fstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::basic_filebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::basic_fstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::wfilebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::wifstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::filebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::ofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::basic_ifstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::wfstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::wofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::ifstream::is_open()']]],
-  ['is_5fpartitioned_66',['is_partitioned',['http://en.cppreference.com/w/cpp/algorithm/is_partitioned.html',0,'std']]],
-  ['is_5fpermutation_67',['is_permutation',['http://en.cppreference.com/w/cpp/algorithm/is_permutation.html',0,'std']]],
-  ['is_5fprefix_68',['is_prefix',['../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a',1,'strings::boyer_moore']]],
-  ['is_5fprime_69',['is_prime',['../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444',1,'math']]],
-  ['is_5fsorted_70',['is_sorted',['http://en.cppreference.com/w/cpp/algorithm/is_sorted.html',0,'std']]],
-  ['is_5fsorted_5funtil_71',['is_sorted_until',['http://en.cppreference.com/w/cpp/algorithm/is_sorted_until.html',0,'std']]],
-  ['is_5fsquare_72',['is_square',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e',1,'ordinary_least_squares_regressor.cpp']]],
-  ['isalnum_73',['isalnum',['http://en.cppreference.com/w/cpp/string/byte/isalnum.html',0,'std']]],
-  ['isalpha_74',['isalpha',['http://en.cppreference.com/w/cpp/string/byte/isalpha.html',0,'std']]],
-  ['isbigendian_75',['isBigEndian',['../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446',1,'hashing::md5']]],
-  ['isbipartite_76',['isBipartite',['../df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b',1,'graph']]],
-  ['isblank_77',['isblank',['http://en.cppreference.com/w/cpp/string/byte/isblank.html',0,'std']]],
-  ['iscntrl_78',['iscntrl',['http://en.cppreference.com/w/cpp/string/byte/iscntrl.html',0,'std']]],
-  ['isctype_79',['isctype',['http://en.cppreference.com/w/cpp/regex/regex_traits/isctype.html',0,'std::regex_traits']]],
-  ['iscyclicbfs_80',['isCyclicBFS',['../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5',1,'CycleCheck']]],
-  ['iscyclicdfs_81',['isCyclicDFS',['../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474',1,'CycleCheck']]],
-  ['iscyclicdfshelper_82',['isCyclicDFSHelper',['../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b',1,'CycleCheck']]],
-  ['isdigit_83',['isDigit',['../da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180',1,'data_structures::linked_list']]],
-  ['isdigit_84',['isdigit',['http://en.cppreference.com/w/cpp/string/byte/isdigit.html',0,'std']]],
-  ['isempty_85',['isEmpty',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897',1,'data_structures::linked_list::list::isEmpty()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a73c52b2243a6c9501af65756123e7149',1,'data_structures::linked_list::list::isEmpty() const']]],
-  ['isemptyqueue_86',['isEmptyQueue',['../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec',1,'queue']]],
-  ['isemptystack_87',['isEmptyStack',['../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5',1,'stack']]],
-  ['isfinite_88',['isfinite',['http://en.cppreference.com/w/cpp/numeric/math/isfinite.html',0,'std']]],
-  ['isfull_89',['IsFull',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd',1,'data_structures::tree_234::Node']]],
-  ['isgraph_90',['isgraph',['http://en.cppreference.com/w/cpp/string/byte/isgraph.html',0,'std']]],
-  ['isinf_91',['isinf',['http://en.cppreference.com/w/cpp/numeric/math/isinf.html',0,'std']]],
-  ['isleaf_92',['IsLeaf',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8',1,'data_structures::tree_234::Node']]],
-  ['islower_93',['islower',['http://en.cppreference.com/w/cpp/string/byte/islower.html',0,'std']]],
-  ['isnan_94',['isnan',['http://en.cppreference.com/w/cpp/numeric/math/isnan.html',0,'std']]],
-  ['isnormal_95',['isnormal',['http://en.cppreference.com/w/cpp/numeric/math/isnormal.html',0,'std']]],
-  ['ispossible_96',['isPossible',['../d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0',1,'backtracking::sudoku_solver']]],
-  ['ispoweroftwo_97',['isPowerOfTwo',['../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f',1,'bit_manipulation']]],
-  ['isprime_98',['IsPrime',['../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf',1,'primality_test.cpp']]],
-  ['isprime_99',['isPrime',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aba4929409fee35c3cb559e962a544b3e',1,'math::modular_inverse_fermat']]],
-  ['isprint_100',['isprint',['http://en.cppreference.com/w/cpp/string/byte/isprint.html',0,'std']]],
-  ['ispunct_101',['ispunct',['http://en.cppreference.com/w/cpp/string/byte/ispunct.html',0,'std']]],
-  ['issafe_102',['isSafe',['../d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d',1,'backtracking::graph_coloring::isSafe()'],['../d4/d3e/n__queens_8cpp.html#a5730b6683f6adcf5c5ef75cf53dc7160',1,'backtracking::n_queens::isSafe()']]],
-  ['issafe_103',['issafe',['../d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2',1,'backtracking::knight_tour']]],
-  ['issame_104',['isSame',['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)'],['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)']]],
-  ['isspace_105',['isspace',['http://en.cppreference.com/w/cpp/string/byte/isspace.html',0,'std']]],
-  ['istream_106',['istream',['http://en.cppreference.com/w/cpp/io/basic_istream/basic_istream.html',0,'std::istream']]],
-  ['istringstream_107',['istringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::istringstream']]],
-  ['istrstream_108',['istrstream',['http://en.cppreference.com/w/cpp/io/istrstream/istrstream.html',0,'std::istrstream']]],
-  ['isupper_109',['isupper',['http://en.cppreference.com/w/cpp/string/byte/isupper.html',0,'std']]],
-  ['isvalidbinarystring_110',['isValidBinaryString',['../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2',1,'greedy_algorithms::BinaryAddition']]],
-  ['iswalnum_111',['iswalnum',['http://en.cppreference.com/w/cpp/string/wide/iswalnum.html',0,'std']]],
-  ['iswalpha_112',['iswalpha',['http://en.cppreference.com/w/cpp/string/wide/iswalpha.html',0,'std']]],
-  ['iswblank_113',['iswblank',['http://en.cppreference.com/w/cpp/string/wide/iswblank.html',0,'std']]],
-  ['iswcntrl_114',['iswcntrl',['http://en.cppreference.com/w/cpp/string/wide/iswcntrl.html',0,'std']]],
-  ['iswctype_115',['iswctype',['http://en.cppreference.com/w/cpp/string/wide/iswctype.html',0,'std']]],
-  ['iswdigit_116',['iswdigit',['http://en.cppreference.com/w/cpp/string/wide/iswdigit.html',0,'std']]],
-  ['iswgraph_117',['iswgraph',['http://en.cppreference.com/w/cpp/string/wide/iswgraph.html',0,'std']]],
-  ['iswlower_118',['iswlower',['http://en.cppreference.com/w/cpp/string/wide/iswlower.html',0,'std']]],
-  ['iswprint_119',['iswprint',['http://en.cppreference.com/w/cpp/string/wide/iswprint.html',0,'std']]],
-  ['iswpunct_120',['iswpunct',['http://en.cppreference.com/w/cpp/string/wide/iswpunct.html',0,'std']]],
-  ['iswspace_121',['iswspace',['http://en.cppreference.com/w/cpp/string/wide/iswspace.html',0,'std']]],
-  ['iswupper_122',['iswupper',['http://en.cppreference.com/w/cpp/string/wide/iswupper.html',0,'std']]],
-  ['iswxdigit_123',['iswxdigit',['http://en.cppreference.com/w/cpp/string/wide/iswxdigit.html',0,'std']]],
-  ['isxdigit_124',['isxdigit',['http://en.cppreference.com/w/cpp/string/byte/isxdigit.html',0,'std']]],
-  ['it_5fternary_5fsearch_125',['it_ternary_search',['../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0',1,'ternary_search.cpp']]],
-  ['iter_5fswap_126',['iter_swap',['http://en.cppreference.com/w/cpp/algorithm/iter_swap.html',0,'std']]],
-  ['iterativefactorial_127',['iterativeFactorial',['../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a',1,'math']]],
-  ['iterativequicksort_128',['iterativeQuickSort',['../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5',1,'sorting']]],
-  ['iword_129',['iword',['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::fstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ios::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_fstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::iostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ios_base::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wistream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::stringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wifstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_istream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::strstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_stringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istrstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wiostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_istringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ifstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostrstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wfstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_iostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wstringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wistringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ifstream::iword()']]]
+  ['identity_5ffunction_0',['identity_function',['../d2/d58/neural__network_8cpp.html#a32c00da08f2cf641dd336270f6e3c407',1,'machine_learning::neural_network::util_functions']]],
+  ['imag_1',['imag',['../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974',1,'Complex']]],
+  ['imod_2',['imod',['../d6/d2d/modular__inverse__simple_8cpp.html#a618b198f74a88ab0023355b3a05d9ad6',1,'modular_inverse_simple.cpp']]],
+  ['in_5frange_3',['in_range',['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a48d054230468b79037964f474d842b6e',1,'machine_learning::aystar_search::EightPuzzle']]],
+  ['increase_5ffrequency_4',['increase_frequency',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#a16a25c102554c5653721a5112ef676c9',1,'others::Cache::LFUCache']]],
+  ['info_5',['Info',['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#aaa7ea27346659f0abe2df82ca57fc5a7',1,'machine_learning::aystar_search::AyStarSearch::Info::Info()=default'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a695e4314ebc3ab58e13004dc63599fe8',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Puzzle &amp;A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3950824936488f66408313b1f8a8ca8',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Puzzle &amp;A, size_t h_value, size_t d)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a572de12115e39e34dde6e68b707d59f5',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Info &amp;A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a6abc89925ae7055a63b428e61525ad7a',1,'machine_learning::aystar_search::AyStarSearch::Info::Info(const Info &amp;&amp;A) noexcept']]],
+  ['init_6',['init',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc',1,'range_queries::heavy_light_decomposition::Tree::init()'],['../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828',1,'range_queries::heavy_light_decomposition::HLD::init()'],['../d8/d41/namespacegames_1_1memory__game.html#ad573c8ae66ab66156d03e5e81bbba214',1,'games::memory_game::init()']]],
+  ['init_5fbad_5fchar_7',['init_bad_char',['../d0/dbc/namespacestrings_1_1boyer__moore.html#a2f6688c9bb3e692297a3aa09cebc1c00',1,'strings::boyer_moore']]],
+  ['init_5fgood_5fsuffix_8',['init_good_suffix',['../d0/dbc/namespacestrings_1_1boyer__moore.html#aa709cf7fca02b7d3e1888423d5f739a1',1,'strings::boyer_moore']]],
+  ['init_5fpattern_9',['init_pattern',['../d0/dbc/namespacestrings_1_1boyer__moore.html#a0b165af1dc341289fd705be4c67728f8',1,'strings::boyer_moore']]],
+  ['inorderiterative_10',['inOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499',1,'others::iterative_tree_traversals::BinaryTree']]],
+  ['insameunion_11',['InSameUnion',['../de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985',1,'disjoint_set.cpp']]],
+  ['insert_12',['Insert',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e',1,'data_structures::tree_234::Tree234::Insert(int64_t item)'],['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f',1,'data_structures::tree_234::Tree234::Insert(Node *tree, int64_t item)'],['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c',1,'operations_on_datastructures::trie_operations::Tnode::Insert()'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a3ae0bea4123fd2ce155108e88f2ef78c',1,'operations_on_datastructures::inorder_traversal_of_bst::Insert()']]],
+  ['insert_13',['insert',['../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778',1,'binary_search_tree::insert(std::unique_ptr&lt; bst_node &gt; &amp;node, T new_value)'],['../d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0',1,'binary_search_tree::insert(T new_value)'],['../d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1',1,'data_structures::list_array::list::insert()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa69707af46eb6d410eb3a54ee58e1ed1',1,'data_structures::linked_list::list::insert()'],['../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f',1,'data_structures::treap::Treap::insert()'],['../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2',1,'Trie::insert()'],['../d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546',1,'data_structures::trie::insert()'],['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2',1,'data_structures::trie_using_hashmap::Trie::insert()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(const std::vector&lt; int64_t &gt; &amp;values)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a3b7bbb0918c261bc216aef9e6dd39aa4',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(int64_t data)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::insert(Node *node)'],['../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50',1,'operations_on_datastructures::reverse_binary_tree::BinaryTree::insert()'],['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7',1,'probability::windowed_median::WindowedMedian::insert()'],['../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b',1,'insert():&#160;avltree.cpp']]],
+  ['insert_5felement_14',['insert_element',['../d8/d77/namespacemachine__learning.html#a496302e3371aa7b478cb7d5917904bdd',1,'machine_learning']]],
+  ['insertatthebeginning_15',['insertAtTheBeginning',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df',1,'linkedlist_implentation_usingarray.cpp']]],
+  ['insertelement_16',['insertElement',['../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9',1,'data_structures::SkipList']]],
+  ['insertionsort_17',['InsertionSort',['../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1',1,'sorting::merge_insertion']]],
+  ['insertionsort_18',['insertionSort',['../d5/d91/namespacesorting.html#a78cb2f3b97b6db2c062b2a1df05c9ea9',1,'sorting::insertionSort(T *arr, int n)'],['../d5/d91/namespacesorting.html#a8fe6bac9e03f58abcc2ce26ef3de1b5f',1,'sorting::insertionSort(std::vector&lt; T &gt; *arr)']]],
+  ['insertionsort_5fbinsrch_19',['insertionSort_binsrch',['../d5/d91/namespacesorting.html#a5f4bc75cca6dd8294af2d0e328006c68',1,'sorting']]],
+  ['insertitem_20',['InsertItem',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb',1,'data_structures::tree_234::Node']]],
+  ['insertitembyindex_21',['InsertItemByIndex',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956',1,'data_structures::tree_234::Node']]],
+  ['insertkey_22',['insertKey',['../d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82',1,'MinHeap']]],
+  ['insertpostmerge_23',['InsertPostMerge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aa7e5e00033f38006a224f30bdbf3f703',1,'data_structures::tree_234::Tree234']]],
+  ['insertpresplit_24',['InsertPreSplit',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d',1,'data_structures::tree_234::Tree234']]],
+  ['inserttosorted_25',['insertToSorted',['../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24',1,'probability::windowed_median::WindowedMedian']]],
+  ['integral_5fapprox_26',['integral_approx',['../dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11',1,'math']]],
+  ['integral_5fmonte_5fcarlo_27',['integral_monte_carlo',['../db/d40/integral__approximation2_8cpp.html#af7da9ba8932f1f48b9bbc2d80471af51',1,'math::monte_carlo']]],
+  ['interactive_28',['interactive',['../d5/d96/md5_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661',1,'interactive():&#160;md5.cpp'],['../d8/d7a/sha1_8cpp.html#ac9e1a11f44135b890dd10a00e73b5661',1,'interactive():&#160;sha1.cpp']]],
+  ['interpolationsearch_29',['InterpolationSearch',['../df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629',1,'interpolation_search2.cpp']]],
+  ['inverse_5fcumulative_5fdistribution_30',['inverse_cumulative_distribution',['../da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aaf762e88c66918d7afda4234f28a7ddf',1,'probability::geometric_dist::geometric_distribution']]],
+  ['inversefastfouriertransform_31',['InverseFastFourierTransform',['../d1/de0/namespacenumerical__methods.html#aee56dc85997b8cd42bad71a5d6bd2d93',1,'numerical_methods']]],
+  ['is2node_32',['Is2Node',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631',1,'data_structures::tree_234::Node']]],
+  ['is34node_33',['Is34Node',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18',1,'data_structures::tree_234::Node']]],
+  ['is_5farmstrong_34',['is_armstrong',['../dd/d24/namespacedynamic__programming.html#af046365a8d77a1267acc082f86135a26',1,'dynamic_programming']]],
+  ['is_5fbipartite_35',['is_bipartite',['../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#ad475f8b838693812f7569a490729f373',1,'graph::is_graph_bipartite::Graph']]],
+  ['is_5ffactorial_36',['is_factorial',['../dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca',1,'math']]],
+  ['is_5fhappy_37',['is_happy',['../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7',1,'happy_number.cpp']]],
+  ['is_5fnumber_38',['is_number',['../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59',1,'games::memory_game::is_number()'],['../d7/d75/postfix__evaluation_8cpp.html#a4c27f949c9d6659be9f5bd2ccbe1360a',1,'others::postfix_expression::is_number()']]],
+  ['is_5fprefix_39',['is_prefix',['../d0/dbc/namespacestrings_1_1boyer__moore.html#a056122c8fe8fb0f5fca6428d3f7b5c3a',1,'strings::boyer_moore']]],
+  ['is_5fprime_40',['is_prime',['../dd/d47/namespacemath.html#abd8f794b2229b42876169ff841b6e444',1,'math']]],
+  ['is_5fsquare_41',['is_square',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e',1,'ordinary_least_squares_regressor.cpp']]],
+  ['isbigendian_42',['isBigEndian',['../d5/d96/md5_8cpp.html#af8e96bde0183c4b0a7ff04668f11e446',1,'hashing::md5']]],
+  ['isbipartite_43',['isBipartite',['../df/dce/namespacegraph.html#a84b0551489c613a681cc83b34450da4b',1,'graph']]],
+  ['iscyclicbfs_44',['isCyclicBFS',['../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5',1,'CycleCheck']]],
+  ['iscyclicdfs_45',['isCyclicDFS',['../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474',1,'CycleCheck']]],
+  ['iscyclicdfshelper_46',['isCyclicDFSHelper',['../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b',1,'CycleCheck']]],
+  ['isdigit_47',['isDigit',['../da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180',1,'data_structures::linked_list']]],
+  ['isempty_48',['isEmpty',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a454ab4918f579869dfed4bb420a3f897',1,'data_structures::linked_list::list::isEmpty()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a73c52b2243a6c9501af65756123e7149',1,'data_structures::linked_list::list::isEmpty() const']]],
+  ['isemptyqueue_49',['isEmptyQueue',['../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec',1,'queue']]],
+  ['isemptystack_50',['isEmptyStack',['../d1/dc2/classstack.html#a163eb9a6206c874c9bf98d032fca11c5',1,'stack']]],
+  ['isfull_51',['IsFull',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd',1,'data_structures::tree_234::Node']]],
+  ['isleaf_52',['IsLeaf',['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8',1,'data_structures::tree_234::Node']]],
+  ['ispossible_53',['isPossible',['../d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0',1,'backtracking::sudoku_solver']]],
+  ['ispoweroftwo_54',['isPowerOfTwo',['../d7/d81/namespacebit__manipulation.html#a5032470c9974bbd6ec254bf296530a5f',1,'bit_manipulation']]],
+  ['isprime_55',['IsPrime',['../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf',1,'primality_test.cpp']]],
+  ['isprime_56',['isPrime',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#aba4929409fee35c3cb559e962a544b3e',1,'math::modular_inverse_fermat']]],
+  ['issafe_57',['isSafe',['../d3/d40/graph__coloring_8cpp.html#a976efe049deb042bf1f02612e181ab1d',1,'backtracking::graph_coloring::isSafe()'],['../d4/d3e/n__queens_8cpp.html#a5730b6683f6adcf5c5ef75cf53dc7160',1,'backtracking::n_queens::isSafe()']]],
+  ['issafe_58',['issafe',['../d1/d2a/knight__tour_8cpp.html#af27031fbff093ffd625f64010d98aab2',1,'backtracking::knight_tour']]],
+  ['issame_59',['isSame',['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)'],['../dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303',1,'dsu::isSame(uint64_t i, uint64_t j)']]],
+  ['isvalidbinarystring_60',['isValidBinaryString',['../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2',1,'greedy_algorithms::BinaryAddition']]],
+  ['it_5fternary_5fsearch_61',['it_ternary_search',['../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0',1,'ternary_search.cpp']]],
+  ['iterativefactorial_62',['iterativeFactorial',['../dd/d47/namespacemath.html#a2565c745aac2f9561cc6fd9e56d9b77a',1,'math']]],
+  ['iterativequicksort_63',['iterativeQuickSort',['../d5/d91/namespacesorting.html#a263595fd9a0163b5b997b89fab3a0dc5',1,'sorting']]]
 ];
diff --git a/search/functions_a.js b/search/functions_a.js
index 659adc86b..fe876b46f 100644
--- a/search/functions_a.js
+++ b/search/functions_a.js
@@ -1,6 +1,4 @@
 var searchData=
 [
-  ['join_0',['join',['http://en.cppreference.com/w/cpp/thread/thread/join.html',0,'std::thread']]],
-  ['joinable_1',['joinable',['http://en.cppreference.com/w/cpp/thread/thread/joinable.html',0,'std::thread']]],
-  ['jumpsearch_2',['jumpSearch',['../d2/d22/jump__search_8cpp.html#ab49fd8f401bfc71f63b74711390cccf0',1,'jump_search.cpp']]]
+  ['jumpsearch_0',['jumpSearch',['../d2/d22/jump__search_8cpp.html#ab49fd8f401bfc71f63b74711390cccf0',1,'jump_search.cpp']]]
 ];
diff --git a/search/functions_b.js b/search/functions_b.js
index 3e486650b..01da54c1d 100644
--- a/search/functions_b.js
+++ b/search/functions_b.js
@@ -1,16 +1,12 @@
 var searchData=
 [
-  ['k_0',['k',['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/params.html',0,'std::negative_binomial_distribution::k()'],['../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442',1,'numerical_methods::simpson_method::k()'],['../df/d11/midpoint__integral__method_8cpp.html#ae9f66040f8e0ba73c1c741261c22a52a',1,'numerical_methods::midpoint_rule::k()']]],
+  ['k_0',['k',['../d4/d18/composite__simpson__rule_8cpp.html#a1b74d828b33760094906797042b89442',1,'numerical_methods::simpson_method::k()'],['../df/d11/midpoint__integral__method_8cpp.html#ae9f66040f8e0ba73c1c741261c22a52a',1,'numerical_methods::midpoint_rule::k()']]],
   ['karatsuba_5falgorithm_1',['karatsuba_algorithm',['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#a7a890d2f26855ada3b9f1d43aec70a86',1,'divide_and_conquer::karatsuba_algorithm']]],
   ['kelvin_5fto_5fcelsius_2',['kelvin_to_celsius',['../d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec',1,'others']]],
-  ['key_5fcomp_3',['key_comp',['http://en.cppreference.com/w/cpp/container/multiset/key_comp.html',0,'std::multiset::key_comp()'],['http://en.cppreference.com/w/cpp/container/set/key_comp.html',0,'std::set::key_comp()'],['http://en.cppreference.com/w/cpp/container/map/key_comp.html',0,'std::map::key_comp()'],['http://en.cppreference.com/w/cpp/container/multimap/key_comp.html',0,'std::multimap::key_comp()']]],
-  ['key_5feq_4',['key_eq',['http://en.cppreference.com/w/cpp/container/unordered_map/key_eq.html',0,'std::unordered_map::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/key_eq.html',0,'std::unordered_multimap::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/key_eq.html',0,'std::unordered_multiset::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_set/key_eq.html',0,'std::unordered_set::key_eq()']]],
-  ['kill_5fdependency_5',['kill_dependency',['http://en.cppreference.com/w/cpp/atomic/kill_dependency.html',0,'std']]],
-  ['kmp_6',['kmp',['../d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e',1,'string_search']]],
-  ['knapsackfilling_7',['KnapSackFilling',['../d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c',1,'dynamic_programming::unbounded_knapsack']]],
-  ['knn_8',['Knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200',1,'machine_learning::k_nearest_neighbors::Knn::Knn(std::vector&lt; std::vector&lt; double &gt; &gt; &amp;X, std::vector&lt; int &gt; &amp;Y)'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b',1,'machine_learning::k_nearest_neighbors::Knn::Knn(const Knn &amp;model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e',1,'machine_learning::k_nearest_neighbors::Knn::Knn(Knn &amp;&amp;)=default']]],
-  ['knuth_5fb_9',['knuth_b',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::knuth_b']]],
-  ['kohonen_5fsom_10',['kohonen_som',['../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576',1,'machine_learning']]],
-  ['kohonen_5fsom_5ftracer_11',['kohonen_som_tracer',['../d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3',1,'machine_learning']]],
-  ['kth_5fancestor_12',['kth_ancestor',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a8f7bca1746d40f21ad832fcea59aa6c6',1,'range_queries::heavy_light_decomposition::Tree']]]
+  ['kmp_3',['kmp',['../d9/d03/namespacestring__search.html#a1e37af2f023495129cb57338c801209e',1,'string_search']]],
+  ['knapsackfilling_4',['KnapSackFilling',['../d9/dec/unbounded__0__1__knapsack_8cpp.html#afe447a5979582174908695952c8a079c',1,'dynamic_programming::unbounded_knapsack']]],
+  ['knn_5',['Knn',['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a188d29ffcefdb5900a8cd41eccd89200',1,'machine_learning::k_nearest_neighbors::Knn::Knn(std::vector&lt; std::vector&lt; double &gt; &gt; &amp;X, std::vector&lt; int &gt; &amp;Y)'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a9f5885c40112481ae5b588fe81d7910b',1,'machine_learning::k_nearest_neighbors::Knn::Knn(const Knn &amp;model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a4b17dcf17c847f0295b60029512c120e',1,'machine_learning::k_nearest_neighbors::Knn::Knn(Knn &amp;&amp;)=default']]],
+  ['kohonen_5fsom_6',['kohonen_som',['../d8/d77/namespacemachine__learning.html#ac43d294e21a0c4fa33c53757df054576',1,'machine_learning']]],
+  ['kohonen_5fsom_5ftracer_7',['kohonen_som_tracer',['../d8/d77/namespacemachine__learning.html#a042f435bca0839e721fc1574a61e8da3',1,'machine_learning']]],
+  ['kth_5fancestor_8',['kth_ancestor',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a8f7bca1746d40f21ad832fcea59aa6c6',1,'range_queries::heavy_light_decomposition::Tree']]]
 ];
diff --git a/search/functions_c.js b/search/functions_c.js
index 9a9285179..1fe94b909 100644
--- a/search/functions_c.js
+++ b/search/functions_c.js
@@ -1,68 +1,35 @@
 var searchData=
 [
   ['l_0',['l',['../d4/d18/composite__simpson__rule_8cpp.html#a6d8df83a6f26ce24a75d3b358b7f5b8a',1,'numerical_methods::simpson_method::l()'],['../df/d11/midpoint__integral__method_8cpp.html#ad53616fb4fa6880ae876bcba53365c51',1,'numerical_methods::midpoint_rule::l()']]],
-  ['labs_1',['labs',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]],
-  ['lambda_2',['lambda',['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/lambda.html',0,'std::exponential_distribution']]],
-  ['large_5fnumber_3',['large_number',['../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337',1,'large_number::large_number()'],['../db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a',1,'large_number::large_number(int n)'],['../db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872',1,'large_number::large_number(const large_number &amp;a)'],['../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f',1,'large_number::large_number(std::vector&lt; unsigned char &gt; &amp;vec)']]],
-  ['largestpower_4',['largestPower',['../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f',1,'math']]],
-  ['lazy_5',['lazy',['../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79',1,'range_queries::perSegTree']]],
-  ['lca_6',['lca',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4',1,'range_queries::heavy_light_decomposition::Tree']]],
-  ['lcm_7',['lcm',['../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25',1,'least_common_multiple.cpp']]],
-  ['lcmsum_8',['lcmSum',['../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244',1,'math']]],
-  ['ldexp_9',['ldexp',['http://en.cppreference.com/w/cpp/numeric/math/ldexp.html',0,'std']]],
-  ['ldiv_10',['ldiv',['http://en.cppreference.com/w/cpp/numeric/math/div.html',0,'std']]],
-  ['left_11',['left',['../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca',1,'MinHeap::left()'],['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std::left()']]],
-  ['leftrotate_12',['LeftRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e',1,'data_structures::tree_234::Tree234']]],
-  ['leftrotate_13',['leftRotate',['../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6',1,'avltree.cpp']]],
-  ['leftrotate32bits_14',['leftRotate32bits',['../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d',1,'hashing::md5::leftRotate32bits()'],['../d8/d7a/sha1_8cpp.html#acf6bd970f29a68702bdbdfe8338e45e0',1,'hashing::sha1::leftRotate32bits()']]],
-  ['lenghtline_15',['LenghtLine',['../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a',1,'smallest_circle.cpp']]],
-  ['length_16',['length',['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::match_results::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt::length()'],['http://en.cppreference.com/w/cpp/string/char_traits/length.html',0,'std::char_traits::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::string::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_byname::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::wsmatch::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::wcsub_match::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::smatch::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8_utf16::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::wcmatch::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::wssub_match::length()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/length.html',0,'std::regex_traits::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::csub_match::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::ssub_match::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::basic_string::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::wstring::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u16string::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u32string::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf16::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::cmatch::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::sub_match::length()']]],
-  ['length_5ferror_17',['length_error',['http://en.cppreference.com/w/cpp/error/length_error.html',0,'std::length_error']]],
-  ['lengthoflongestsubstring_18',['lengthOfLongestSubstring',['../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d',1,'Longest_Substring']]],
-  ['levelorder_19',['levelOrder',['../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59',1,'avltree.cpp']]],
-  ['lexicographical_5fcompare_20',['lexicographical_compare',['http://en.cppreference.com/w/cpp/algorithm/lexicographical_compare.html',0,'std']]],
-  ['lfucache_21',['LFUCache',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#affd7776c246caa2d0f92fd8616f6e5dc',1,'others::Cache::LFUCache']]],
-  ['lgamma_22',['lgamma',['http://en.cppreference.com/w/cpp/numeric/math/lgamma.html',0,'std']]],
-  ['lift_23',['lift',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3',1,'range_queries::heavy_light_decomposition::Tree']]],
-  ['linear_5fcongruential_5fengine_24',['linear_congruential_engine',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::linear_congruential_engine']]],
-  ['linearprobe_25',['linearProbe',['../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746',1,'linear_probing']]],
-  ['linearsearch_26',['LinearSearch',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9',1,'data_structures::list_array::list::LinearSearch()'],['../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84',1,'LinearSearch():&#160;linear_search.cpp']]],
-  ['link_27',['link',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb',1,'data_structures::linked_list::link']]],
-  ['lis_28',['LIS',['../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079',1,'dynamic_programming']]],
-  ['list_29',['list',['http://en.cppreference.com/w/cpp/container/list/list.html',0,'std::list::list()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826',1,'data_structures::linked_list::list::list()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a326ac4f721f7b74d5ed4f418a67b8d38',1,'data_structures::linked_list::list::list(const list &amp;other)']]],
-  ['listnode_30',['ListNode',['../d7/da4/struct_list_node.html#a3cfee2eb667c332dc32595208164ef0a',1,'ListNode::ListNode()=default'],['../d7/da4/struct_list_node.html#aaad9b553e2f936726f5b35ff2734125d',1,'ListNode::ListNode(int x)'],['../d7/da4/struct_list_node.html#afc97c5b9d2e7cc82d0718245688f6ff9',1,'ListNode::ListNode(int x, ListNode *next)']]],
-  ['llabs_31',['llabs',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]],
-  ['llrint_32',['llrint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]],
-  ['llround_33',['llround',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]],
-  ['load_34',['load',['http://en.cppreference.com/w/cpp/atomic/atomic/load.html',0,'std::atomic']]],
-  ['load_5ffactor_35',['load_factor',['http://en.cppreference.com/w/cpp/container/unordered_map/load_factor.html',0,'std::unordered_map::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/load_factor.html',0,'std::unordered_multimap::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/load_factor.html',0,'std::unordered_multiset::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_set/load_factor.html',0,'std::unordered_set::load_factor()']]],
-  ['load_5fmodel_36',['load_model',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58ed20abf6ce3744535bd8b5bb9e741b',1,'machine_learning::neural_network::NeuralNetwork']]],
-  ['locale_37',['locale',['http://en.cppreference.com/w/cpp/locale/locale/locale.html',0,'std::locale']]],
-  ['localeconv_38',['localeconv',['http://en.cppreference.com/w/cpp/locale/localeconv.html',0,'std']]],
-  ['localtime_39',['localtime',['http://en.cppreference.com/w/cpp/chrono/c/localtime.html',0,'std']]],
-  ['lock_40',['lock',['http://en.cppreference.com/w/cpp/memory/weak_ptr/lock.html',0,'std::weak_ptr::lock()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/lock.html',0,'std::unique_lock::lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/lock.html',0,'std::recursive_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/lock.html',0,'std::recursive_timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/lock.html',0,'std::shared_lock::lock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/lock.html',0,'std::timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/mutex/lock.html',0,'std::mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/lock.html',0,'std::shared_timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/lock.html',0,'std::lock()']]],
-  ['lock_5fguard_41',['lock_guard',['http://en.cppreference.com/w/cpp/thread/lock_guard/lock_guard.html',0,'std::lock_guard']]],
-  ['lock_5fshared_42',['lock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/lock_shared.html',0,'std::shared_timed_mutex']]],
-  ['log_43',['log',['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['http://en.cppreference.com/w/cpp/numeric/math/log.html',0,'std::log()'],['../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058',1,'lru_tests::log()']]],
-  ['log10_44',['log10',['http://en.cppreference.com/w/cpp/numeric/math/log10.html',0,'std']]],
-  ['log1p_45',['log1p',['http://en.cppreference.com/w/cpp/numeric/math/log1p.html',0,'std']]],
-  ['logb_46',['logb',['http://en.cppreference.com/w/cpp/numeric/math/logb.html',0,'std']]],
-  ['logic_5ferror_47',['logic_error',['http://en.cppreference.com/w/cpp/error/logic_error.html',0,'std::logic_error']]],
-  ['lognormal_5fdistribution_48',['lognormal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/lognormal_distribution.html',0,'std::lognormal_distribution']]],
-  ['longest_5fcommon_5fstring_5flength_49',['longest_common_string_length',['../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5',1,'longest_common_string.cpp']]],
-  ['longest_5fincreasing_5fsubsequence_5fusing_5fbinary_5fsearch_50',['longest_increasing_subsequence_using_binary_search',['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e',1,'longest_increasing_subsequence_using_binary_search.cpp']]],
-  ['longjmp_51',['longjmp',['http://en.cppreference.com/w/cpp/utility/program/longjmp.html',0,'std']]],
-  ['lookup_5fclassname_52',['lookup_classname',['http://en.cppreference.com/w/cpp/regex/regex_traits/lookup_classname.html',0,'std::regex_traits']]],
-  ['lookup_5fcollatename_53',['lookup_collatename',['http://en.cppreference.com/w/cpp/regex/regex_traits/lookup_collatename.html',0,'std::regex_traits']]],
-  ['lower_54',['lower',['../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd',1,'uint128_t::lower()'],['../d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1',1,'uint256_t::lower()'],['../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9',1,'lower():&#160;text_search.cpp']]],
-  ['lower_5fbound_55',['lower_bound',['http://en.cppreference.com/w/cpp/container/multiset/lower_bound.html',0,'std::multiset::lower_bound()'],['http://en.cppreference.com/w/cpp/container/set/lower_bound.html',0,'std::set::lower_bound()'],['http://en.cppreference.com/w/cpp/container/map/lower_bound.html',0,'std::map::lower_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/lower_bound.html',0,'std::multimap::lower_bound()'],['http://en.cppreference.com/w/cpp/algorithm/lower_bound.html',0,'std::lower_bound()']]],
-  ['lowest_56',['lowest',['http://en.cppreference.com/w/cpp/types/numeric_limits/lowest.html',0,'std::numeric_limits']]],
-  ['lowest_5fcommon_5fancestor_57',['lowest_common_ancestor',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488',1,'graph::LowestCommonAncestor']]],
-  ['lowestcommonancestor_58',['LowestCommonAncestor',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93',1,'graph::LowestCommonAncestor']]],
-  ['lps_59',['lps',['../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412',1,'dynamic_programming']]],
-  ['lrint_60',['lrint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]],
-  ['lround_61',['lround',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]],
-  ['lrucache_62',['LRUCache',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4',1,'others::lru_cache::LRUCache::LRUCache()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f',1,'others::Cache::LRUCache::LRUCache()']]],
-  ['lt_63',['lt',['http://en.cppreference.com/w/cpp/string/char_traits/cmp.html',0,'std::char_traits']]],
-  ['lu_5fdecomposition_64',['lu_decomposition',['../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509',1,'lu_decomposition.h']]]
+  ['large_5fnumber_1',['large_number',['../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337',1,'large_number::large_number()'],['../db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a',1,'large_number::large_number(int n)'],['../db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872',1,'large_number::large_number(const large_number &amp;a)'],['../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f',1,'large_number::large_number(std::vector&lt; unsigned char &gt; &amp;vec)']]],
+  ['largestpower_2',['largestPower',['../dd/d47/namespacemath.html#afa39ec943a4836c878e1614fd89b146f',1,'math']]],
+  ['lazy_3',['lazy',['../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79',1,'range_queries::perSegTree']]],
+  ['lca_4',['lca',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ae2b407e64aaf9878fbee7ee6efe9c7d4',1,'range_queries::heavy_light_decomposition::Tree']]],
+  ['lcm_5',['lcm',['../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25',1,'least_common_multiple.cpp']]],
+  ['lcmsum_6',['lcmSum',['../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244',1,'math']]],
+  ['left_7',['left',['../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca',1,'MinHeap']]],
+  ['leftrotate_8',['LeftRotate',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ae58dca20f08eaf9313f6e7b0869c2d0e',1,'data_structures::tree_234::Tree234']]],
+  ['leftrotate_9',['leftRotate',['../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6',1,'avltree.cpp']]],
+  ['leftrotate32bits_10',['leftRotate32bits',['../d5/d96/md5_8cpp.html#add2bf982d5dd64a45d13cba52c2b371d',1,'hashing::md5::leftRotate32bits()'],['../d8/d7a/sha1_8cpp.html#acf6bd970f29a68702bdbdfe8338e45e0',1,'hashing::sha1::leftRotate32bits()']]],
+  ['lenghtline_11',['LenghtLine',['../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a',1,'smallest_circle.cpp']]],
+  ['lengthoflongestsubstring_12',['lengthOfLongestSubstring',['../da/d21/class_longest___substring.html#af8a3672bc8d95e7da4f9a45e5e2e387d',1,'Longest_Substring']]],
+  ['levelorder_13',['levelOrder',['../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59',1,'avltree.cpp']]],
+  ['lfucache_14',['LFUCache',['../df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html#affd7776c246caa2d0f92fd8616f6e5dc',1,'others::Cache::LFUCache']]],
+  ['lift_15',['lift',['../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3',1,'range_queries::heavy_light_decomposition::Tree']]],
+  ['linearprobe_16',['linearProbe',['../d8/d89/namespacelinear__probing.html#a6322209aaa91b7bbf16f96e1cc52b746',1,'linear_probing']]],
+  ['linearsearch_17',['LinearSearch',['../d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9',1,'data_structures::list_array::list::LinearSearch()'],['../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84',1,'LinearSearch():&#160;linear_search.cpp']]],
+  ['link_18',['link',['../de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb',1,'data_structures::linked_list::link']]],
+  ['lis_19',['LIS',['../dd/d24/namespacedynamic__programming.html#a0a2215194e58786c34db1ccaf8031079',1,'dynamic_programming']]],
+  ['list_20',['list',['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826',1,'data_structures::linked_list::list::list()'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#a326ac4f721f7b74d5ed4f418a67b8d38',1,'data_structures::linked_list::list::list(const list &amp;other)']]],
+  ['listnode_21',['ListNode',['../d7/da4/struct_list_node.html#a3cfee2eb667c332dc32595208164ef0a',1,'ListNode::ListNode()=default'],['../d7/da4/struct_list_node.html#aaad9b553e2f936726f5b35ff2734125d',1,'ListNode::ListNode(int x)'],['../d7/da4/struct_list_node.html#afc97c5b9d2e7cc82d0718245688f6ff9',1,'ListNode::ListNode(int x, ListNode *next)']]],
+  ['load_5fmodel_22',['load_model',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58ed20abf6ce3744535bd8b5bb9e741b',1,'machine_learning::neural_network::NeuralNetwork']]],
+  ['log_23',['log',['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e',1,'TestCases::log(T msg)'],['../d3/db3/lru__cache_8cpp.html#a24d21a345ed06f7fba6919718cf3e058',1,'lru_tests::log()']]],
+  ['longest_5fcommon_5fstring_5flength_24',['longest_common_string_length',['../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5',1,'longest_common_string.cpp']]],
+  ['longest_5fincreasing_5fsubsequence_5fusing_5fbinary_5fsearch_25',['longest_increasing_subsequence_using_binary_search',['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e',1,'longest_increasing_subsequence_using_binary_search.cpp']]],
+  ['lower_26',['lower',['../db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd',1,'uint128_t::lower()'],['../d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1',1,'uint256_t::lower()'],['../dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9',1,'lower():&#160;text_search.cpp']]],
+  ['lowest_5fcommon_5fancestor_27',['lowest_common_ancestor',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a60151e19512b48cc0b14ea121df00488',1,'graph::LowestCommonAncestor']]],
+  ['lowestcommonancestor_28',['LowestCommonAncestor',['../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a80825a4fd4c41860b689d253dd2c8e93',1,'graph::LowestCommonAncestor']]],
+  ['lps_29',['lps',['../dd/d24/namespacedynamic__programming.html#afe9f45b6e30ee187509da2d1d0093412',1,'dynamic_programming']]],
+  ['lrucache_30',['LRUCache',['../d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#a41c9b6f1693b8a316cc4a2d8c9149ba4',1,'others::lru_cache::LRUCache::LRUCache()'],['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#a8980cbbc9cf0a98a9592b40c4d6ec28f',1,'others::Cache::LRUCache::LRUCache()']]],
+  ['lu_5fdecomposition_31',['lu_decomposition',['../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509',1,'lu_decomposition.h']]]
 ];
diff --git a/search/functions_d.js b/search/functions_d.js
index b6557f32e..c79987aa7 100644
--- a/search/functions_d.js
+++ b/search/functions_d.js
@@ -1,114 +1,53 @@
 var searchData=
 [
-  ['m_0',['m',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/params.html',0,'std::lognormal_distribution::m()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/params.html',0,'std::fisher_f_distribution::m()']]],
-  ['mag_1',['mag',['../df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8',1,'math::vector_cross']]],
-  ['magic_5fnumber_2',['magic_number',['../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0',1,'math']]],
-  ['main_3',['main',['../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;generate_parentheses.cpp'],['../d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;graph_coloring.cpp'],['../d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;knight_tour.cpp'],['../df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;minimax.cpp'],['../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;n_queens.cpp'],['../da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;n_queens_all_solution_optimised.cpp'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;nqueen_print_all_solutions.cpp'],['../dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;subarray_sum.cpp'],['../d2/d5a/subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;subset_sum.cpp'],['../d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;sudoku_solver.cpp'],['../dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;count_bits_flip.cpp'],['../da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;count_of_set_bits.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;elliptic_curve_key_exchange.cpp'],['../d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;hill_cipher.cpp'],['../d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;fcfs_scheduling.cpp'],['../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;avltree.cpp'],['../d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;bloom_filter.cpp'],['../de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;disjoint_set.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;dsu_union_rank.cpp'],['../da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;linked_list.cpp'],['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;linkedlist_implentation_usingarray.cpp'],['../d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;list_array.cpp'],['../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;queue_using_array.cpp'],['../df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;queue_using_two_stacks.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;segment_tree.cpp'],['../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;skip_list.cpp'],['../d8/dab/sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;treap.cpp'],['../db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;tree_234.cpp'],['../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;trie_modern.cpp'],['../d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;abbreviation.cpp'],['../d1/da7/armstrong__number__templated_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;armstrong_number_templated.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;house_robber.cpp'],['../d4/da0/kadane_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;kadane.cpp'],['../da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;longest_common_string.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]):&#160;longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;shortest_common_supersequence.cpp'],['../dc/d67/subset__sum__dynamic_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;subset_sum_dynamic.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;trapped_rainwater.cpp'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;unbounded_0_1_knapsack.cpp'],['../d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;word_break.cpp'],['../dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;memory_game.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;jarvis_algorithm.cpp'],['../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;line_segment_intersection.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;connected_components.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;connected_components_with_dsu.cpp'],['../da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;depth_first_search.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;depth_first_search_with_stack.cpp'],['../d8/d68/dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;dijkstra.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;hamiltons_cycle.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;hopcroft_karp.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;is_graph_bipartite.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;lowest_common_ancestor.cpp'],['../d8/db9/topological__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;topological_sort.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;travelling_salesman_problem.cpp'],['../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;spirograph.cpp'],['../d9/d1f/binary__addition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;digit_separation.cpp'],['../da/de8/dijkstra__greedy_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;dijkstra_greedy.cpp'],['../db/d80/gale__shapley_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;gale_shapley.cpp'],['../d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;kruskals_minimum_spanning_tree.cpp'],['../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;chaining.cpp'],['../d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;double_hash_hash_table.cpp'],['../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;linear_probing_hash_table.cpp'],['../d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;md5.cpp'],['../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;quadratic_probing_hash_table.cpp'],['../d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;sha1.cpp'],['../d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;sha256.cpp'],['../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;adaline_learning.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;k_nearest_neighbors.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;kohonen_som_trace.cpp'],['../d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;neural_network.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;ordinary_least_squares_regressor.cpp'],['../de/d99/aliquot__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;aliquot_sum.cpp'],['../d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;approximate_pi.cpp'],['../dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;area.cpp'],['../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;binary_exponent.cpp'],['../d8/db1/binomial__calculate_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]):&#160;binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;eulers_totient_function.cpp'],['../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;extended_euclid_algorithm.cpp'],['../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;factorial.cpp'],['../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;fast_power.cpp'],['../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;fibonacci.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;fibonacci_fast.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;fibonacci_sum.cpp'],['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;finding_number_of_digits_in_a_number.cpp'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;gcd_recursive_euclidean.cpp'],['../d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;integral_approximation.cpp'],['../db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;iterative_factorial.cpp'],['../d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;large_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;lcm_sum.cpp'],['../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;miller_rabin.cpp'],['../df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;n_choose_r.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;number_of_positive_divisors.cpp'],['../d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;perimeter.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;power_for_huge_numbers.cpp'],['../d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;power_of_two.cpp'],['../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;prime_factorization.cpp'],['../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;prime_numbers.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;primes_up_to_billion.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;quadratic_equations_complex_numbers.cpp'],['../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;realtime_stats.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;sieve_of_eratosthenes.cpp'],['../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;sqrt_double.cpp'],['../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;string_fibonacci.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]):&#160;babylonian_method.cpp'],['../d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;bisection_method.cpp'],['../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;brent_method_extrema.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;composite_simpson_rule.cpp'],['../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;false_position.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]):&#160;fast_fourier_transform.cpp'],['../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;gaussian_elimination.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;golden_search_extrema.cpp'],['../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]):&#160;inverse_fast_fourier_transform.cpp'],['../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;lu_decompose.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;midpoint_integral_method.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;newton_raphson_method.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;ode_semi_implicit_euler.cpp'],['../d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void):&#160;qr_decomposition.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;qr_eigen_values.cpp'],['../d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;rungekutta.cpp'],['../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;successive_approximation.cpp'],['../d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]):&#160;trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;union_of_two_arrays.cpp'],['../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;buzz_number.cpp'],['../da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void):&#160;decimal_to_hexadecimal.cpp'],['../de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;decimal_to_roman_numeral.cpp'],['../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;fast_integer_input.cpp'],['../db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;happy_number.cpp'],['../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;iterative_tree_traversals.cpp'],['../de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;kadanes3.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;kelvin_to_celsius.cpp'],['../d9/d65/lfu__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;lfu_cache.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;longest_substring_without_repeating_characters.cpp'],['../d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;lru_cache.cpp'],['../dc/daa/lru__cache2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;lru_cache2.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;matrix_exponentiation.cpp'],['../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;palindrome_of_number.cpp'],['../dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;pascal_triangle.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;postfix_evaluation.cpp'],['../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;primality_test.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;smallest_circle.cpp'],['../d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;sparse_matrix.cpp'],['../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;spiral_print.cpp'],['../d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;stairs_pattern.cpp'],['../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;tower_of_hanoi.cpp'],['../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;vector_important_functions.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;ground_to_ground_projectile_motion.cpp'],['../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;addition_rule.cpp'],['../d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;bayes_theorem.cpp'],['../d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;binomial_dist.cpp'],['../d9/da2/exponential__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;exponential_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;geometric_dist.cpp'],['../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;poisson_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]):&#160;windowed_median.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;fenwick_tree.cpp'],['../d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;heavy_light_decomposition.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;segtree.cpp'],['../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;exponential_search.cpp'],['../de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;fibonacci_search.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;floyd_cycle_detection_algo.cpp'],['../d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;hash_search.cpp'],['../df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;interpolation_search2.cpp'],['../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;longest_increasing_subsequence_using_binary_search.cpp'],['../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;sublist_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;ternary_search.cpp'],['../dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;bogo_sort.cpp'],['../d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;bubble_sort.cpp'],['../d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;comb_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;heap_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;insertion_sort_recursive.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;merge_insertion_sort.cpp'],['../d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;merge_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;pancake_sort.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;pigeonhole_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;quick_sort.cpp'],['../d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;quick_sort_3.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;radix_sort2.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;selection_sort_recursive.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;shell_sort2.cpp'],['../d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;stooge_sort.cpp'],['../dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;wave_sort.cpp'],['../d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;boyer_moore.cpp'],['../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;brute_force_string_searching.cpp'],['../db/d09/duval_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;duval.cpp'],['../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;manacher_algorithm.cpp'],['../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void):&#160;rabin_karp.cpp'],['../d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;z_function.cpp']]],
-  ['make_5fexception_5fptr_4',['make_exception_ptr',['http://en.cppreference.com/w/cpp/error/make_exception_ptr.html',0,'std']]],
-  ['make_5fheap_5',['make_heap',['http://en.cppreference.com/w/cpp/algorithm/make_heap.html',0,'std']]],
-  ['make_5fmove_5fiterator_6',['make_move_iterator',['http://en.cppreference.com/w/cpp/iterator/make_move_iterator.html',0,'std']]],
-  ['make_5foptional_7',['make_optional',['http://en.cppreference.com/w/cpp/experimental/optional/make_optional.html',0,'std::experimental']]],
-  ['make_5fpair_8',['make_pair',['http://en.cppreference.com/w/cpp/utility/pair/make_pair.html',0,'std']]],
-  ['make_5fready_5fat_5fthread_5fexit_9',['make_ready_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/packaged_task/make_ready_at_thread_exit.html',0,'std::packaged_task']]],
-  ['make_5frecent_10',['make_recent',['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4',1,'others::Cache::LRUCache']]],
-  ['make_5fset_11',['make_set',['../d8/d99/connected__components__with__dsu_8cpp.html#ae91ed94113c56191b75fe45f688d6e62',1,'graph::disjoint_union']]],
-  ['make_5fshared_12',['make_shared',['http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html',0,'std']]],
-  ['make_5ftuple_13',['make_tuple',['http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html',0,'std']]],
-  ['makebst_14',['makeBST',['../d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
-  ['makelinkedlist_15',['makeLinkedList',['../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53',1,'search::sublist_search']]],
-  ['makenode_16',['makeNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a7f6f73a33beec448c27cc1d70b220702',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
-  ['makestrings_17',['makeStrings',['../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec',1,'backtracking::generate_parentheses']]],
-  ['malloc_18',['malloc',['http://en.cppreference.com/w/cpp/memory/c/malloc.html',0,'std']]],
-  ['manacher_19',['manacher',['../d3/d39/manacher__algorithm_8cpp.html#a95e6a2976bb2f332898f373941d52098',1,'strings::manacher']]],
-  ['map_20',['map',['http://en.cppreference.com/w/cpp/container/map/map.html',0,'std::map']]],
-  ['mark_5fcount_21',['mark_count',['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::regex::mark_count()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::basic_regex::mark_count()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::wregex::mark_count()']]],
-  ['mat_5fmul_22',['mat_mul',['../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590',1,'ciphers::HillCipher::mat_mul()'],['../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae',1,'mat_mul():&#160;qr_eigen_values.cpp']]],
-  ['match_23',['match',['../d8/d41/namespacegames_1_1memory__game.html#a370760f2b328ad341bcb77d82fa17b01',1,'games::memory_game']]],
-  ['match_5fresults_24',['match_results',['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::match_results']]],
-  ['matrix_25',['Matrix',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256',1,'divide_and_conquer::strassens_multiplication::Matrix::Matrix(const Integer size)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a4aa49765cce39ce48b9241e993e0cfb9',1,'divide_and_conquer::strassens_multiplication::Matrix::Matrix(const Integer rows, const Integer cols)']]],
-  ['max_26',['max',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/max.html',0,'std::student_t_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mt19937_64::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::ranlux24_base::max()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/max.html',0,'std::extreme_value_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/max.html',0,'std::lognormal_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/max.html',0,'std::discrete_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::ranlux48::max()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/max.html',0,'std::piecewise_constant_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/max.html',0,'std::poisson_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/max.html',0,'std::bernoulli_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::discard_block_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/max.html',0,'std::exponential_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/max.html',0,'std::uniform_real_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/max.html',0,'std::geometric_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mersenne_twister_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/max.html',0,'std::independent_bits_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/max.html',0,'std::normal_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::minstd_rand::max()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/max.html',0,'std::weibull_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::ranlux48_base::max()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/max.html',0,'std::negative_binomial_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mt19937::max()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/max.html',0,'std::chi_squared_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/max.html',0,'std::piecewise_linear_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/max.html',0,'std::shuffle_order_engine::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::minutes::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::seconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::duration::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::milliseconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::hours::max()'],['http://en.cppreference.com/w/cpp/chrono/time_point/max.html',0,'std::chrono::time_point::max()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/max.html',0,'std::chrono::duration_values::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::microseconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::nanoseconds::max()'],['http://en.cppreference.com/w/cpp/types/numeric_limits/max.html',0,'std::numeric_limits::max()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/max.html',0,'std::uniform_int_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/max.html',0,'std::fisher_f_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::ranlux24::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::linear_congruential_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/max.html',0,'std::knuth_b::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::minstd_rand0::max()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/max.html',0,'std::gamma_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/max.html',0,'std::binomial_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/max.html',0,'std::cauchy_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::subtract_with_carry_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/max.html',0,'std::random_device::max()'],['http://en.cppreference.com/w/cpp/algorithm/max.html',0,'std::max()']]],
-  ['max_5fbucket_5fcount_27',['max_bucket_count',['http://en.cppreference.com/w/cpp/container/unordered_map/max_bucket_count.html',0,'std::unordered_map::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_bucket_count.html',0,'std::unordered_multimap::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_bucket_count.html',0,'std::unordered_multiset::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_bucket_count.html',0,'std::unordered_set::max_bucket_count()']]],
-  ['max_5felement_28',['max_element',['http://en.cppreference.com/w/cpp/algorithm/max_element.html',0,'std']]],
-  ['max_5fheight_29',['max_height',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa554429def63077ab7a550c0affbfefa',1,'physics::ground_to_ground_projectile_motion']]],
-  ['max_5flength_30',['max_length',['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_byname::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8_utf16::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf16::max_length()']]],
-  ['max_5fload_5ffactor_31',['max_load_factor',['http://en.cppreference.com/w/cpp/container/unordered_map/max_load_factor.html',0,'std::unordered_map::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_load_factor.html',0,'std::unordered_multimap::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_load_factor.html',0,'std::unordered_multiset::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_load_factor.html',0,'std::unordered_set::max_load_factor()']]],
-  ['max_5fsize_32',['max_size',['http://en.cppreference.com/w/cpp/container/dynarray/max_size.html',0,'std::dynarray::max_size()'],['http://en.cppreference.com/w/cpp/container/vector/max_size.html',0,'std::vector::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::match_results::max_size()'],['http://en.cppreference.com/w/cpp/memory/allocator_traits/max_size.html',0,'std::allocator_traits::max_size()'],['http://en.cppreference.com/w/cpp/container/multiset/max_size.html',0,'std::multiset::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::string::max_size()'],['http://en.cppreference.com/w/cpp/container/set/max_size.html',0,'std::set::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/max_size.html',0,'std::unordered_map::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::wsmatch::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::smatch::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_size.html',0,'std::unordered_multimap::max_size()'],['http://en.cppreference.com/w/cpp/container/forward_list/max_size.html',0,'std::forward_list::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::wcmatch::max_size()'],['http://en.cppreference.com/w/cpp/container/deque/max_size.html',0,'std::deque::max_size()'],['http://en.cppreference.com/w/cpp/memory/allocator/max_size.html',0,'std::allocator::max_size()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/max_size.html',0,'std::scoped_allocator_adaptor::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::basic_string::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::wstring::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_size.html',0,'std::unordered_multiset::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::u16string::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::u32string::max_size()'],['http://en.cppreference.com/w/cpp/container/list/max_size.html',0,'std::list::max_size()'],['http://en.cppreference.com/w/cpp/container/map/max_size.html',0,'std::map::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::cmatch::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_size.html',0,'std::unordered_set::max_size()'],['http://en.cppreference.com/w/cpp/container/multimap/max_size.html',0,'std::multimap::max_size()'],['http://en.cppreference.com/w/cpp/container/array/max_size.html',0,'std::array::max_size()']]],
-  ['max_5fsubarray_5fsum_33',['max_subarray_sum',['../de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147',1,'kadanes3.cpp']]],
-  ['maxcircularsum_34',['maxCircularSum',['../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb',1,'dynamic_programming']]],
-  ['maxknapsackvalue_35',['maxKnapsackValue',['../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1',1,'dynamic_programming::knapsack']]],
-  ['maxprofitbycuttingrod_36',['maxProfitByCuttingRod',['../d6/d10/cut__rod_8cpp.html#a1cc523a30c18c63eac58220c3c494cfa',1,'dynamic_programming::cut_rod']]],
-  ['maxsubarray_37',['maxSubArray',['../d4/da0/kadane_8cpp.html#af3029007a422a914a85c0b0122f1c7b4',1,'dynamic_programming::kadane']]],
-  ['mblen_38',['mblen',['http://en.cppreference.com/w/cpp/string/multibyte/mblen.html',0,'std']]],
-  ['mbrlen_39',['mbrlen',['http://en.cppreference.com/w/cpp/string/multibyte/mbrlen.html',0,'std']]],
-  ['mbrtoc16_40',['mbrtoc16',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc16.html',0,'std']]],
-  ['mbrtoc32_41',['mbrtoc32',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc32.html',0,'std']]],
-  ['mbrtowc_42',['mbrtowc',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtowc.html',0,'std']]],
-  ['mbsinit_43',['mbsinit',['http://en.cppreference.com/w/cpp/string/multibyte/mbsinit.html',0,'std']]],
-  ['mbsrtowcs_44',['mbsrtowcs',['http://en.cppreference.com/w/cpp/string/multibyte/mbsrtowcs.html',0,'std']]],
-  ['mbstowcs_45',['mbstowcs',['http://en.cppreference.com/w/cpp/string/multibyte/mbstowcs.html',0,'std']]],
-  ['mbtowc_46',['mbtowc',['http://en.cppreference.com/w/cpp/string/multibyte/mbtowc.html',0,'std']]],
-  ['mean_47',['mean',['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/mean.html',0,'std::poisson_distribution::mean()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/params.html',0,'std::normal_distribution::mean()'],['../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b',1,'statistics::stats_computer1::mean()'],['../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e',1,'statistics::stats_computer2::mean()']]],
-  ['median_5fof_5fmedians_48',['median_of_medians',['../d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae',1,'search::median_search']]],
-  ['mem_5ffn_49',['mem_fn',['http://en.cppreference.com/w/cpp/utility/functional/mem_fn.html',0,'std']]],
-  ['memchr_50',['memchr',['http://en.cppreference.com/w/cpp/string/byte/memchr.html',0,'std']]],
-  ['memcmp_51',['memcmp',['http://en.cppreference.com/w/cpp/string/byte/memcmp.html',0,'std']]],
-  ['memcpy_52',['memcpy',['http://en.cppreference.com/w/cpp/string/byte/memcpy.html',0,'std']]],
-  ['memmove_53',['memmove',['http://en.cppreference.com/w/cpp/string/byte/memmove.html',0,'std']]],
-  ['memset_54',['memset',['http://en.cppreference.com/w/cpp/string/byte/memset.html',0,'std']]],
-  ['merge_55',['Merge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9',1,'data_structures::tree_234::Tree234']]],
-  ['merge_56',['merge',['http://en.cppreference.com/w/cpp/container/forward_list/merge.html',0,'std::forward_list::merge()'],['http://en.cppreference.com/w/cpp/container/list/merge.html',0,'std::list::merge()'],['http://en.cppreference.com/w/cpp/algorithm/merge.html',0,'std::merge()'],['../d2/d26/count__inversions_8cpp.html#aad643c14734394e784a75169cb58132f',1,'sorting::inversion::merge()'],['../de/d7b/merge__insertion__sort_8cpp.html#af4de4067a9a866ffd985c5b5055ccedf',1,'sorting::merge_insertion::merge()'],['../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73',1,'merge():&#160;merge_sort.cpp'],['../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079',1,'sorting::merge()']]],
-  ['mergenode_57',['MergeNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805',1,'data_structures::tree_234::Tree234']]],
-  ['mergenodenotfull_58',['MergeNodeNotFull',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95',1,'data_structures::tree_234::Tree234']]],
-  ['mergesort_59',['mergeSort',['../d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661',1,'sorting::inversion::mergeSort()'],['../de/d7b/merge__insertion__sort_8cpp.html#a7161278f18e83b671c6454b139cc5674',1,'sorting::merge_insertion::mergeSort()'],['../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7',1,'mergeSort():&#160;merge_sort.cpp']]],
-  ['mersenne_5ftwister_5fengine_60',['mersenne_twister_engine',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mersenne_twister_engine']]],
-  ['message_61',['message',['http://en.cppreference.com/w/cpp/error/error_code/message.html',0,'std::error_code::message()'],['http://en.cppreference.com/w/cpp/error/error_category/message.html',0,'std::error_category::message()'],['http://en.cppreference.com/w/cpp/error/error_condition/message.html',0,'std::error_condition::message()']]],
-  ['messages_62',['messages',['http://en.cppreference.com/w/cpp/locale/messages/messages.html',0,'std::messages']]],
-  ['messages_5fbyname_63',['messages_byname',['http://en.cppreference.com/w/cpp/locale/messages_byname.html',0,'std::messages_byname']]],
-  ['method1_64',['method1',['../df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11',1,'decimal_to_binary.cpp']]],
-  ['method2_65',['method2',['../df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7',1,'decimal_to_binary.cpp']]],
-  ['microseconds_66',['microseconds',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::microseconds']]],
-  ['mid_67',['mid',['../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141',1,'data_structures::SegmentTree']]],
-  ['middlenode_68',['middleNode',['../d8/dfa/median__search2_8cpp.html#a5fefe132a0c3ee780ebc703f37ebce6a',1,'search::median_search2']]],
-  ['midpoint_69',['midpoint',['../df/d11/midpoint__integral__method_8cpp.html#a7072493d1f0f8a91b2a71d4cc456c09c',1,'numerical_methods::midpoint_rule']]],
-  ['midpoint_5feuler_70',['midpoint_euler',['../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985',1,'ode_midpoint_euler.cpp']]],
-  ['midpoint_5feuler_5fstep_71',['midpoint_euler_step',['../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812',1,'ode_midpoint_euler.cpp']]],
-  ['miller_5frabin_5fprimality_5ftest_72',['miller_rabin_primality_test',['../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce',1,'miller_rabin.cpp']]],
-  ['miller_5ftest_73',['miller_test',['../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506',1,'miller_rabin.cpp']]],
-  ['milliseconds_74',['milliseconds',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::milliseconds']]],
-  ['min_75',['min',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/min.html',0,'std::student_t_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mt19937_64::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::ranlux24_base::min()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/min.html',0,'std::extreme_value_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/min.html',0,'std::lognormal_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/min.html',0,'std::discrete_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::ranlux48::min()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/min.html',0,'std::piecewise_constant_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/min.html',0,'std::poisson_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/min.html',0,'std::bernoulli_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::discard_block_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/min.html',0,'std::exponential_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/min.html',0,'std::uniform_real_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/min.html',0,'std::geometric_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mersenne_twister_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/min.html',0,'std::independent_bits_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/min.html',0,'std::normal_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::minstd_rand::min()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/min.html',0,'std::weibull_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::ranlux48_base::min()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/min.html',0,'std::negative_binomial_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mt19937::min()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/min.html',0,'std::chi_squared_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/min.html',0,'std::piecewise_linear_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/min.html',0,'std::shuffle_order_engine::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::minutes::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::seconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::duration::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::milliseconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::hours::min()'],['http://en.cppreference.com/w/cpp/chrono/time_point/min.html',0,'std::chrono::time_point::min()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/min.html',0,'std::chrono::duration_values::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::microseconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::nanoseconds::min()'],['http://en.cppreference.com/w/cpp/types/numeric_limits/min.html',0,'std::numeric_limits::min()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/min.html',0,'std::uniform_int_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/min.html',0,'std::fisher_f_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::ranlux24::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::linear_congruential_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/min.html',0,'std::knuth_b::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::minstd_rand0::min()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/min.html',0,'std::gamma_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/min.html',0,'std::binomial_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/min.html',0,'std::cauchy_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::subtract_with_carry_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/min.html',0,'std::random_device::min()'],['http://en.cppreference.com/w/cpp/algorithm/min.html',0,'std::min()'],['../da/d52/minimum__edit__distance_8cpp.html#a0138c226bd79ffe6d839c787cfc60347',1,'dynamic_programming::minimum_edit_distance::min()']]],
-  ['min_5felement_76',['min_element',['http://en.cppreference.com/w/cpp/algorithm/min_element.html',0,'std']]],
-  ['mincoins_77',['mincoins',['../d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a',1,'dynamic_programming::mincoins_topdown']]],
-  ['minheap_78',['MinHeap',['../d2/d05/class_min_heap.html#a078cb888e642bb1f95dd0e03f0a35820',1,'MinHeap']]],
-  ['minheapify_79',['MinHeapify',['../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad',1,'MinHeap']]],
-  ['minimax_80',['minimax',['../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50',1,'backtracking']]],
-  ['minimum_5fdistance_81',['minimum_distance',['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71',1,'greedy_algorithms::dijkstra']]],
-  ['minmax_82',['minmax',['http://en.cppreference.com/w/cpp/algorithm/minmax.html',0,'std']]],
-  ['minmax_5felement_83',['minmax_element',['http://en.cppreference.com/w/cpp/algorithm/minmax_element.html',0,'std']]],
-  ['minmax_5fscaler_84',['minmax_scaler',['../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26',1,'machine_learning']]],
-  ['minstd_5frand_85',['minstd_rand',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::minstd_rand']]],
-  ['minstd_5frand0_86',['minstd_rand0',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::minstd_rand0']]],
-  ['minutes_87',['minutes',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::minutes']]],
-  ['minvalue_88',['minValue',['../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e',1,'avltree.cpp']]],
-  ['mismatch_89',['mismatch',['http://en.cppreference.com/w/cpp/algorithm/mismatch.html',0,'std']]],
-  ['mktime_90',['mktime',['http://en.cppreference.com/w/cpp/chrono/c/mktime.html',0,'std']]],
-  ['mod_5fdivision_91',['mod_division',['../df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7',1,'math::modular_division']]],
-  ['modf_92',['modf',['http://en.cppreference.com/w/cpp/numeric/math/modf.html',0,'std']]],
-  ['modinverse_93',['modInverse',['../de/dab/ncr__modulo__p_8cpp.html#a6c7bfe3bdaa086d32261a5c5584d0fa9',1,'math::ncr_modulo_p::utils']]],
-  ['modular_5fexponentiation_94',['modular_exponentiation',['../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29',1,'miller_rabin.cpp']]],
-  ['modular_5finverse_95',['modular_inverse',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae7e807e02c65c6fffd6162b4c66290c2',1,'math::modular_inverse_fermat']]],
-  ['money_5fget_96',['money_get',['http://en.cppreference.com/w/cpp/locale/money_get/money_get.html',0,'std::money_get']]],
-  ['money_5fput_97',['money_put',['http://en.cppreference.com/w/cpp/locale/money_put/money_put.html',0,'std::money_put']]],
-  ['moneypunct_98',['moneypunct',['http://en.cppreference.com/w/cpp/locale/moneypunct/moneypunct.html',0,'std::moneypunct']]],
-  ['moneypunct_5fbyname_99',['moneypunct_byname',['http://en.cppreference.com/w/cpp/locale/moneypunct_byname.html',0,'std::moneypunct_byname']]],
-  ['morse_5fto_5fchar_100',['morse_to_char',['../d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829',1,'ciphers::morse']]],
-  ['mov_101',['mov',['../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d',1,'tower_of_hanoi.cpp']]],
-  ['move_102',['move',['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::fstream::move()'],['http://en.cppreference.com/w/cpp/string/char_traits/move.html',0,'std::char_traits::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ios::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_fstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::iostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wistream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::stringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wifstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_istream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::strstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_stringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istrstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wiostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_istringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ifstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostrstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wfstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_iostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wstringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wistringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ifstream::move()'],['http://en.cppreference.com/w/cpp/utility/move.html',0,'std::move(T... args)']]],
-  ['move_5fbackward_103',['move_backward',['http://en.cppreference.com/w/cpp/algorithm/move_backward.html',0,'std']]],
-  ['move_5fif_5fnoexcept_104',['move_if_noexcept',['http://en.cppreference.com/w/cpp/utility/move_if_noexcept.html',0,'std']]],
-  ['mt19937_105',['mt19937',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mt19937']]],
-  ['mt19937_5f64_106',['mt19937_64',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mt19937_64']]],
-  ['multimap_107',['multimap',['http://en.cppreference.com/w/cpp/container/multimap/multimap.html',0,'std::multimap']]],
-  ['multiply_108',['multiply',['../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc',1,'large_number::multiply()'],['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#a17f3d667241b88115a95282cdd719cb2',1,'ciphers::elliptic_curve_key_exchange::multiply()'],['../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9',1,'machine_learning::multiply()'],['../de/dc3/fibonacci__sum_8cpp.html#a9c83cca09a3e4ff2a25c816a9303448e',1,'math::fibonacci_sum::multiply()'],['../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9',1,'multiply(int x, int res[], int res_size):&#160;power_for_huge_numbers.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252',1,'multiply(const vector&lt; vector&lt; ll &gt; &gt; &amp;A, const vector&lt; vector&lt; ll &gt; &gt; &amp;B):&#160;matrix_exponentiation.cpp']]],
-  ['multiset_109',['multiset',['http://en.cppreference.com/w/cpp/container/multiset/multiset.html',0,'std::multiset']]],
-  ['mutex_110',['mutex',['http://en.cppreference.com/w/cpp/thread/unique_lock/mutex.html',0,'std::unique_lock::mutex()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/mutex.html',0,'std::shared_lock::mutex()'],['http://en.cppreference.com/w/cpp/thread/mutex/mutex.html',0,'std::mutex::mutex()']]]
+  ['mag_0',['mag',['../df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8',1,'math::vector_cross']]],
+  ['magic_5fnumber_1',['magic_number',['../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0',1,'math']]],
+  ['main_2',['main',['../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;generate_parentheses.cpp'],['../d3/d40/graph__coloring_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;graph_coloring.cpp'],['../d1/d2a/knight__tour_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;knight_tour.cpp'],['../df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;minimax.cpp'],['../d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;n_queens.cpp'],['../da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;n_queens_all_solution_optimised.cpp'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;nqueen_print_all_solutions.cpp'],['../dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;rat_maze.cpp'],['../df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;subarray_sum.cpp'],['../d2/d5a/subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;subset_sum.cpp'],['../d3/d05/sudoku__solver_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;sudoku_solver.cpp'],['../dc/d14/wildcard__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;wildcard_matching.cpp'],['../d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;count_bits_flip.cpp'],['../da/db8/count__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;count_of_set_bits.cpp'],['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;count_of_trailing_ciphers_in_factorial_n.cpp'],['../d6/d38/find__non__repeating__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;find_non_repeating_number.cpp'],['../d4/d48/hamming__distance_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;hamming_distance.cpp'],['../d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;next_higher_number_with_same_number_of_set_bits.cpp'],['../dc/d6d/power__of__2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;power_of_2.cpp'],['../d5/db5/set__kth__bit_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;set_kth_bit.cpp'],['../d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;travelling_salesman_using_bit_manipulation.cpp'],['../de/db6/a1z26__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;a1z26_cipher.cpp'],['../dc/dfb/atbash__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;atbash_cipher.cpp'],['../d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;caesar_cipher.cpp'],['../df/d2c/elliptic__curve__key__exchange_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;elliptic_curve_key_exchange.cpp'],['../d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;hill_cipher.cpp'],['../d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;morse_code.cpp'],['../dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;vigenere_cipher.cpp'],['../d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;xor_cipher.cpp'],['../df/d47/fcfs__scheduling_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;fcfs_scheduling.cpp'],['../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;avltree.cpp'],['../d9/dab/bloom__filter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;bloom_filter.cpp'],['../de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;disjoint_set.cpp'],['../d3/dae/dsu__path__compression_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;dsu_path_compression.cpp'],['../df/d28/dsu__union__rank_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;dsu_union_rank.cpp'],['../da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;linked_list.cpp'],['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;linkedlist_implentation_usingarray.cpp'],['../d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;list_array.cpp'],['../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;queue_using_array.cpp'],['../df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;queue_using_two_stacks.cpp'],['../d6/d05/reverse__a__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;reverse_a_linked_list.cpp'],['../de/dd1/segment__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;segment_tree.cpp'],['../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;skip_list.cpp'],['../d8/dab/sparse__table_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;sparse_table.cpp'],['../d0/dd2/treap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;treap.cpp'],['../db/dbc/tree__234_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;tree_234.cpp'],['../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;trie_modern.cpp'],['../d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;trie_tree.cpp'],['../d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;trie_using_hashmap.cpp'],['../da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;karatsuba_algorithm_for_fast_multiplication.cpp'],['../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;0_1_knapsack.cpp'],['../d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;abbreviation.cpp'],['../d1/da7/armstrong__number__templated_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;armstrong_number_templated.cpp'],['../d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;coin_change_topdown.cpp'],['../d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;cut_rod.cpp'],['../d6/d26/house__robber_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;house_robber.cpp'],['../d4/da0/kadane_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;kadane.cpp'],['../da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;longest_common_string.cpp'],['../d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]):&#160;longest_increasing_subsequence.cpp'],['../d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;longest_palindromic_subsequence.cpp'],['../db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;maximum_circular_subarray.cpp'],['../da/d52/minimum__edit__distance_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;minimum_edit_distance.cpp'],['../d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;palindrome_partitioning.cpp'],['../d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;shortest_common_supersequence.cpp'],['../dc/d67/subset__sum__dynamic_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;subset_sum_dynamic.cpp'],['../d9/d80/trapped__rainwater_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;trapped_rainwater.cpp'],['../d9/dec/unbounded__0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;unbounded_0_1_knapsack.cpp'],['../d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;word_break.cpp'],['../dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;memory_game.cpp'],['../d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;jarvis_algorithm.cpp'],['../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;line_segment_intersection.cpp'],['../d7/d07/bidirectional__dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;bidirectional_dijkstra.cpp'],['../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;breadth_first_search.cpp'],['../df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;connected_components.cpp'],['../d8/d99/connected__components__with__dsu_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;connected_components_with_dsu.cpp'],['../da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;depth_first_search.cpp'],['../da/d4b/depth__first__search__with__stack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;depth_first_search_with_stack.cpp'],['../d8/d68/dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;dijkstra.cpp'],['../dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;hamiltons_cycle.cpp'],['../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;hopcroft_karp.cpp'],['../d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;is_graph_bipartite.cpp'],['../de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;lowest_common_ancestor.cpp'],['../d8/db9/topological__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;topological_sort.cpp'],['../de/d88/travelling__salesman__problem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;travelling_salesman_problem.cpp'],['../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;spirograph.cpp'],['../d9/d1f/binary__addition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;binary_addition.cpp'],['../d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;boruvkas_minimum_spanning_tree.cpp'],['../d3/d36/digit__separation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;digit_separation.cpp'],['../da/de8/dijkstra__greedy_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;dijkstra_greedy.cpp'],['../db/d80/gale__shapley_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;gale_shapley.cpp'],['../d6/dba/jump__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;jump_game.cpp'],['../d8/d7d/kruskals__minimum__spanning__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;kruskals_minimum_spanning_tree.cpp'],['../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;chaining.cpp'],['../d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;double_hash_hash_table.cpp'],['../d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;linear_probing_hash_table.cpp'],['../d5/d96/md5_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;md5.cpp'],['../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;quadratic_probing_hash_table.cpp'],['../d8/d7a/sha1_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;sha1.cpp'],['../d4/d08/sha256_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;sha256.cpp'],['../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;adaline_learning.cpp'],['../d4/d3e/k__nearest__neighbors_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;k_nearest_neighbors.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;kohonen_som_trace.cpp'],['../d2/d58/neural__network_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;neural_network.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;ordinary_least_squares_regressor.cpp'],['../de/d99/aliquot__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;aliquot_sum.cpp'],['../d0/d51/approximate__pi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;approximate_pi.cpp'],['../dc/d82/area_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;area.cpp'],['../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;binary_exponent.cpp'],['../d8/db1/binomial__calculate_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]):&#160;binomial_calculate.cpp'],['../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;check_amicable_pair.cpp'],['../d8/dd5/check__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;check_factorial.cpp'],['../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;check_prime.cpp'],['../d5/d67/complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;complex_numbers.cpp'],['../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;double_factorial.cpp'],['../d7/da6/eratosthenes_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;eratosthenes.cpp'],['../da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;eulers_totient_function.cpp'],['../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;extended_euclid_algorithm.cpp'],['../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;factorial.cpp'],['../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;fast_power.cpp'],['../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;fibonacci.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;fibonacci_fast.cpp'],['../da/dc9/fibonacci__matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;fibonacci_matrix_exponentiation.cpp'],['../de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;fibonacci_sum.cpp'],['../d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;finding_number_of_digits_in_a_number.cpp'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;gcd_recursive_euclidean.cpp'],['../d1/de9/integral__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;integral_approximation.cpp'],['../db/d40/integral__approximation2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;integral_approximation2.cpp'],['../d6/db8/inv__sqrt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;inv_sqrt.cpp'],['../db/d9f/iterative__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;iterative_factorial.cpp'],['../d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;large_factorial.cpp'],['../d5/d7a/largest__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;largest_power.cpp'],['../d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;lcm_sum.cpp'],['../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;least_common_multiple.cpp'],['../d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;magic_number.cpp'],['../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;miller_rabin.cpp'],['../df/d72/modular__division_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;modular_division.cpp'],['../d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;modular_exponentiation.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;modular_inverse_fermat_little_theorem.cpp'],['../d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;modular_inverse_simple.cpp'],['../db/d27/n__bonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;n_bonacci.cpp'],['../d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;n_choose_r.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;number_of_positive_divisors.cpp'],['../d3/dfe/perimeter_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;perimeter.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;power_for_huge_numbers.cpp'],['../d4/d38/power__of__two_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;power_of_two.cpp'],['../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;prime_factorization.cpp'],['../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;prime_numbers.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;primes_up_to_billion.cpp'],['../da/d18/quadratic__equations__complex__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;quadratic_equations_complex_numbers.cpp'],['../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;realtime_stats.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;sieve_of_eratosthenes.cpp'],['../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;sqrt_double.cpp'],['../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;string_fibonacci.cpp'],['../d4/d9d/sum__of__binomial__coefficient_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;sum_of_binomial_coefficient.cpp'],['../d4/d83/sum__of__digits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;sum_of_digits.cpp'],['../df/d66/vector__cross__product_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;vector_cross_product.cpp'],['../da/d39/volume_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;volume.cpp'],['../dc/d9c/babylonian__method_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]):&#160;babylonian_method.cpp'],['../d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;bisection_method.cpp'],['../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;brent_method_extrema.cpp'],['../d4/d18/composite__simpson__rule_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;composite_simpson_rule.cpp'],['../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;false_position.cpp'],['../d8/d9a/fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]):&#160;fast_fourier_transform.cpp'],['../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;gaussian_elimination.cpp'],['../d6/d7a/golden__search__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;golden_search_extrema.cpp'],['../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;gram_schmidt.cpp'],['../d9/d37/inverse__fast__fourier__transform_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]):&#160;inverse_fast_fourier_transform.cpp'],['../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;lu_decompose.cpp'],['../df/d11/midpoint__integral__method_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;midpoint_integral_method.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;newton_raphson_method.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;ode_semi_implicit_euler.cpp'],['../d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void):&#160;qr_decomposition.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv):&#160;qr_eigen_values.cpp'],['../d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;rungekutta.cpp'],['../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;successive_approximation.cpp'],['../d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;array_left_rotation.cpp'],['../d6/d57/array__right__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;array_right_rotation.cpp'],['../de/d33/circular__linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;circular_linked_list.cpp'],['../d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;inorder_successor_of_bst.cpp'],['../de/dc5/intersection__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;intersection_of_two_arrays.cpp'],['../d4/db6/reverse__binary__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;reverse_binary_tree.cpp'],['../d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]):&#160;trie_multiple_search.cpp'],['../d8/d9c/union__of__two__arrays_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;union_of_two_arrays.cpp'],['../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;buzz_number.cpp'],['../da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void):&#160;decimal_to_hexadecimal.cpp'],['../de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;decimal_to_roman_numeral.cpp'],['../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;fast_integer_input.cpp'],['../db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;happy_number.cpp'],['../d8/d90/iterative__tree__traversals_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;iterative_tree_traversals.cpp'],['../de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;kadanes3.cpp'],['../db/d6b/kelvin__to__celsius_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;kelvin_to_celsius.cpp'],['../d9/d65/lfu__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;lfu_cache.cpp'],['../d4/db8/longest__substring__without__repeating__characters_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;longest_substring_without_repeating_characters.cpp'],['../d3/db3/lru__cache_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;lru_cache.cpp'],['../dc/daa/lru__cache2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;lru_cache2.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;matrix_exponentiation.cpp'],['../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;palindrome_of_number.cpp'],['../dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;pascal_triangle.cpp'],['../d7/d75/postfix__evaluation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;postfix_evaluation.cpp'],['../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;primality_test.cpp'],['../dc/de1/recursive__tree__traversal_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;recursive_tree_traversal.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;smallest_circle.cpp'],['../d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;sparse_matrix.cpp'],['../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;spiral_print.cpp'],['../d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;stairs_pattern.cpp'],['../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;tower_of_hanoi.cpp'],['../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;vector_important_functions.cpp'],['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;ground_to_ground_projectile_motion.cpp'],['../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;addition_rule.cpp'],['../d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;bayes_theorem.cpp'],['../d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;binomial_dist.cpp'],['../d9/da2/exponential__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;exponential_dist.cpp'],['../de/d72/geometric__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;geometric_dist.cpp'],['../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;poisson_dist.cpp'],['../d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c',1,'main(int argc, const char *argv[]):&#160;windowed_median.cpp'],['../d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;fenwick_tree.cpp'],['../d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;heavy_light_decomposition.cpp'],['../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;persistent_seg_tree_lazy_prop.cpp'],['../d1/d9e/prefix__sum__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;prefix_sum_array.cpp'],['../d2/d45/segtree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;segtree.cpp'],['../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;exponential_search.cpp'],['../de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;fibonacci_search.cpp'],['../db/dc4/floyd__cycle__detection__algo_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;floyd_cycle_detection_algo.cpp'],['../d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;hash_search.cpp'],['../df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;interpolation_search2.cpp'],['../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;linear_search.cpp'],['../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;longest_increasing_subsequence_using_binary_search.cpp'],['../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;median_search.cpp'],['../d8/dfa/median__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;median_search2.cpp'],['../d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;saddleback_search.cpp'],['../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;sublist_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;ternary_search.cpp'],['../dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;text_search.cpp'],['../d8/dcc/binary__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;binary_insertion_sort.cpp'],['../d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;bogo_sort.cpp'],['../d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;bubble_sort.cpp'],['../d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;comb_sort.cpp'],['../d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;count_inversions.cpp'],['../de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;cycle_sort.cpp'],['../d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;dnf_sort.cpp'],['../d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;gnome_sort.cpp'],['../d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;heap_sort.cpp'],['../dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;insertion_sort.cpp'],['../dd/d89/insertion__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;insertion_sort_recursive.cpp'],['../de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;merge_insertion_sort.cpp'],['../d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;merge_sort.cpp'],['../d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;pancake_sort.cpp'],['../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;pigeonhole_sort.cpp'],['../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;quick_sort.cpp'],['../d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;quick_sort_3.cpp'],['../d3/d22/quick__sort__iterative_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;quick_sort_iterative.cpp'],['../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;radix_sort2.cpp'],['../d1/daa/random__pivot__quick__sort_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;random_pivot_quick_sort.cpp'],['../d3/df9/recursive__bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;recursive_bubble_sort.cpp'],['../d4/d9f/selection__sort__recursive_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;selection_sort_recursive.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]):&#160;shell_sort2.cpp'],['../d4/d4f/stooge__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;stooge_sort.cpp'],['../dc/dd9/strand__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;strand_sort.cpp'],['../db/d3f/wave__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;wave_sort.cpp'],['../d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;boyer_moore.cpp'],['../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;brute_force_string_searching.cpp'],['../db/d09/duval_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;duval.cpp'],['../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;horspool.cpp'],['../d3/d39/manacher__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;manacher_algorithm.cpp'],['../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void):&#160;rabin_karp.cpp'],['../d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main():&#160;z_function.cpp']]],
+  ['make_5frecent_3',['make_recent',['../d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html#ad022d494b40f82417340b113445e79a4',1,'others::Cache::LRUCache']]],
+  ['make_5fset_4',['make_set',['../d8/d99/connected__components__with__dsu_8cpp.html#ae91ed94113c56191b75fe45f688d6e62',1,'graph::disjoint_union']]],
+  ['makebst_5',['makeBST',['../d4/d32/inorder__successor__of__bst_8cpp.html#a05fe8a029e155c43e4efa598d4d089d9',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
+  ['makelinkedlist_6',['makeLinkedList',['../d5/d45/sublist__search_8cpp.html#a70ca8d0267008e09cfa50b4e2ddfbe53',1,'search::sublist_search']]],
+  ['makenode_7',['makeNode',['../d4/d32/inorder__successor__of__bst_8cpp.html#a7f6f73a33beec448c27cc1d70b220702',1,'operations_on_datastructures::inorder_traversal_of_bst']]],
+  ['makestrings_8',['makeStrings',['../df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec',1,'backtracking::generate_parentheses']]],
+  ['manacher_9',['manacher',['../d3/d39/manacher__algorithm_8cpp.html#a95e6a2976bb2f332898f373941d52098',1,'strings::manacher']]],
+  ['mat_5fmul_10',['mat_mul',['../d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590',1,'ciphers::HillCipher::mat_mul()'],['../de/d75/qr__eigen__values_8cpp.html#abb8bf4c55e10685a5eb2ad3797fde1ae',1,'mat_mul():&#160;qr_eigen_values.cpp']]],
+  ['match_11',['match',['../d8/d41/namespacegames_1_1memory__game.html#a370760f2b328ad341bcb77d82fa17b01',1,'games::memory_game']]],
+  ['matrix_12',['Matrix',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256',1,'divide_and_conquer::strassens_multiplication::Matrix::Matrix(const Integer size)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a4aa49765cce39ce48b9241e993e0cfb9',1,'divide_and_conquer::strassens_multiplication::Matrix::Matrix(const Integer rows, const Integer cols)']]],
+  ['max_5fheight_13',['max_height',['../d9/d29/ground__to__ground__projectile__motion_8cpp.html#aa554429def63077ab7a550c0affbfefa',1,'physics::ground_to_ground_projectile_motion']]],
+  ['max_5fsubarray_5fsum_14',['max_subarray_sum',['../de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147',1,'kadanes3.cpp']]],
+  ['maxcircularsum_15',['maxCircularSum',['../dd/d24/namespacedynamic__programming.html#a5239174fa0d987f2c67edc1f2af82beb',1,'dynamic_programming']]],
+  ['maxknapsackvalue_16',['maxKnapsackValue',['../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1',1,'dynamic_programming::knapsack']]],
+  ['maxprofitbycuttingrod_17',['maxProfitByCuttingRod',['../d6/d10/cut__rod_8cpp.html#a1cc523a30c18c63eac58220c3c494cfa',1,'dynamic_programming::cut_rod']]],
+  ['maxsubarray_18',['maxSubArray',['../d4/da0/kadane_8cpp.html#af3029007a422a914a85c0b0122f1c7b4',1,'dynamic_programming::kadane']]],
+  ['mean_19',['mean',['../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b',1,'statistics::stats_computer1::mean()'],['../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e',1,'statistics::stats_computer2::mean()']]],
+  ['median_5fof_5fmedians_20',['median_of_medians',['../d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae',1,'search::median_search']]],
+  ['merge_21',['Merge',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a36f4d5f603f7edb7db7c73fb53ba14e9',1,'data_structures::tree_234::Tree234']]],
+  ['merge_22',['merge',['../d2/d26/count__inversions_8cpp.html#aad643c14734394e784a75169cb58132f',1,'sorting::inversion::merge()'],['../de/d7b/merge__insertion__sort_8cpp.html#af4de4067a9a866ffd985c5b5055ccedf',1,'sorting::merge_insertion::merge()'],['../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73',1,'merge():&#160;merge_sort.cpp'],['../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079',1,'sorting::merge()']]],
+  ['mergenode_23',['MergeNode',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a11f0d016dff7f7e62b3dddb9fdf47805',1,'data_structures::tree_234::Tree234']]],
+  ['mergenodenotfull_24',['MergeNodeNotFull',['../d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ad37e29e2a4a6cc0eb65cbd5595e1da95',1,'data_structures::tree_234::Tree234']]],
+  ['mergesort_25',['mergeSort',['../d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661',1,'sorting::inversion::mergeSort()'],['../de/d7b/merge__insertion__sort_8cpp.html#a7161278f18e83b671c6454b139cc5674',1,'sorting::merge_insertion::mergeSort()'],['../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7',1,'mergeSort(int *arr, int l, int r):&#160;merge_sort.cpp']]],
+  ['method1_26',['method1',['../df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11',1,'decimal_to_binary.cpp']]],
+  ['method2_27',['method2',['../df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7',1,'decimal_to_binary.cpp']]],
+  ['mid_28',['mid',['../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141',1,'data_structures::SegmentTree']]],
+  ['middlenode_29',['middleNode',['../d8/dfa/median__search2_8cpp.html#a5fefe132a0c3ee780ebc703f37ebce6a',1,'search::median_search2']]],
+  ['midpoint_30',['midpoint',['../df/d11/midpoint__integral__method_8cpp.html#a7072493d1f0f8a91b2a71d4cc456c09c',1,'numerical_methods::midpoint_rule']]],
+  ['midpoint_5feuler_31',['midpoint_euler',['../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985',1,'ode_midpoint_euler.cpp']]],
+  ['midpoint_5feuler_5fstep_32',['midpoint_euler_step',['../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812',1,'ode_midpoint_euler.cpp']]],
+  ['miller_5frabin_5fprimality_5ftest_33',['miller_rabin_primality_test',['../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce',1,'miller_rabin.cpp']]],
+  ['miller_5ftest_34',['miller_test',['../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506',1,'miller_rabin.cpp']]],
+  ['min_35',['min',['../da/d52/minimum__edit__distance_8cpp.html#a0138c226bd79ffe6d839c787cfc60347',1,'dynamic_programming::minimum_edit_distance']]],
+  ['mincoins_36',['mincoins',['../d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a',1,'dynamic_programming::mincoins_topdown']]],
+  ['minheap_37',['MinHeap',['../d2/d05/class_min_heap.html#a078cb888e642bb1f95dd0e03f0a35820',1,'MinHeap']]],
+  ['minheapify_38',['MinHeapify',['../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad',1,'MinHeap']]],
+  ['minimax_39',['minimax',['../db/dc0/namespacebacktracking.html#a78540bcb5ef3473b2348cbc34748ec50',1,'backtracking']]],
+  ['minimum_5fdistance_40',['minimum_distance',['../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html#af6cb29ca6dc5771439f6ea7262058a71',1,'greedy_algorithms::dijkstra']]],
+  ['minmax_5fscaler_41',['minmax_scaler',['../d8/d77/namespacemachine__learning.html#ac332d152078e96311e43ac5e7183ea26',1,'machine_learning']]],
+  ['minvalue_42',['minValue',['../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e',1,'avltree.cpp']]],
+  ['mod_5fdivision_43',['mod_division',['../df/d72/modular__division_8cpp.html#a905e368ae121beb7e7ea35349ddcdac7',1,'math::modular_division']]],
+  ['modinverse_44',['modInverse',['../de/dab/ncr__modulo__p_8cpp.html#a6c7bfe3bdaa086d32261a5c5584d0fa9',1,'math::ncr_modulo_p::utils']]],
+  ['modular_5fexponentiation_45',['modular_exponentiation',['../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29',1,'miller_rabin.cpp']]],
+  ['modular_5finverse_46',['modular_inverse',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae7e807e02c65c6fffd6162b4c66290c2',1,'math::modular_inverse_fermat']]],
+  ['morse_5fto_5fchar_47',['morse_to_char',['../d8/d76/morse__code_8cpp.html#ac9f294b0dec08a4a11d477a32f9bd829',1,'ciphers::morse']]],
+  ['mov_48',['mov',['../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d',1,'tower_of_hanoi.cpp']]],
+  ['multiply_49',['multiply',['../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc',1,'large_number::multiply()'],['../df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html#a17f3d667241b88115a95282cdd719cb2',1,'ciphers::elliptic_curve_key_exchange::multiply()'],['../d8/d77/namespacemachine__learning.html#a5342906d42b80fc6b6b3ad17bf00fcb9',1,'machine_learning::multiply()'],['../de/dc3/fibonacci__sum_8cpp.html#a9c83cca09a3e4ff2a25c816a9303448e',1,'math::fibonacci_sum::multiply()'],['../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9',1,'multiply(int x, int res[], int res_size):&#160;power_for_huge_numbers.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#a357cfbebfdc47a237a2862fe146af252',1,'multiply(const vector&lt; vector&lt; ll &gt; &gt; &amp;A, const vector&lt; vector&lt; ll &gt; &gt; &amp;B):&#160;matrix_exponentiation.cpp']]]
 ];
diff --git a/search/functions_e.js b/search/functions_e.js
index 6f7798018..0ba393a58 100644
--- a/search/functions_e.js
+++ b/search/functions_e.js
@@ -1,65 +1,25 @@
 var searchData=
 [
-  ['n_0',['n',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/n.html',0,'std::student_t_distribution::n()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/n.html',0,'std::chi_squared_distribution::n()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/params.html',0,'std::fisher_f_distribution::n()']]],
-  ['n_5fbonacci_1',['N_bonacci',['../db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d',1,'math::n_bonacci']]],
-  ['n_5fchoose_5fr_2',['n_choose_r',['../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967',1,'math']]],
-  ['n_5fpolygon_5fsurface_5fperimeter_3',['n_polygon_surface_perimeter',['../dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f',1,'math']]],
-  ['naive_5fmultiplication_4',['naive_multiplication',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50',1,'divide_and_conquer::strassens_multiplication::Matrix']]],
-  ['name_5',['name',['http://en.cppreference.com/w/cpp/locale/locale/name.html',0,'std::locale::name()'],['http://en.cppreference.com/w/cpp/error/error_category/name.html',0,'std::error_category::name()'],['http://en.cppreference.com/w/cpp/types/type_info/name.html',0,'std::type_info::name()'],['http://en.cppreference.com/w/cpp/types/type_index/name.html',0,'std::type_index::name()']]],
-  ['nan_6',['nan',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]],
-  ['nanf_7',['nanf',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]],
-  ['nanl_8',['nanl',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]],
-  ['nanoseconds_9',['nanoseconds',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::nanoseconds']]],
-  ['narrow_10',['narrow',['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ofstream::narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype_byname::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::fstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ios::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_fstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::iostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wistream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::stringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wifstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_istream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::strstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_stringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istrstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wiostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ofstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_istringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ifstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istringstream::narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostrstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wfstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_iostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wofstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wstringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wistringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ifstream::narrow()']]],
-  ['native_5fhandle_11',['native_handle',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/native_handle.html',0,'std::condition_variable_any::native_handle()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/native_handle.html',0,'std::condition_variable::native_handle()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/native_handle.html',0,'std::recursive_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/native_handle.html',0,'std::recursive_timed_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/thread/native_handle.html',0,'std::thread::native_handle()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/native_handle.html',0,'std::timed_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/mutex/native_handle.html',0,'std::mutex::native_handle()']]],
-  ['ncr_12',['nCr',['../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a',1,'binomial_dist.cpp']]],
-  ['ncr_13',['ncr',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a499df7a01bcd348345dc5a0ab79bb0e9',1,'math::ncr_modulo_p::NCRModuloP']]],
-  ['ncrmodulop_14',['NCRModuloP',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a94b07e7dc61d8d7a1e9c5a28988e72f9',1,'math::ncr_modulo_p::NCRModuloP']]],
-  ['nearbyint_15',['nearbyint',['http://en.cppreference.com/w/cpp/numeric/math/nearbyint.html',0,'std']]],
-  ['neg_5fformat_16',['neg_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::neg_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::neg_format()']]],
-  ['negative_5fbinomial_5fdistribution_17',['negative_binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/negative_binomial_distribution.html',0,'std::negative_binomial_distribution']]],
-  ['negative_5fsign_18',['negative_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::negative_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::negative_sign()']]],
-  ['nested_5fexception_19',['nested_exception',['http://en.cppreference.com/w/cpp/error/nested_exception/nested_exception.html',0,'std::nested_exception']]],
-  ['nested_5fptr_20',['nested_ptr',['http://en.cppreference.com/w/cpp/error/nested_exception/nested_ptr.html',0,'std::nested_exception']]],
-  ['neuralnetwork_21',['NeuralNetwork',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4c4c6f63ab965317f9471518ee931b89',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const std::vector&lt; std::pair&lt; int, std::string &gt; &gt; &amp;config, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;kernels)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ae7cf126a3a8f9d20c81b21584d061a08',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork()=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a62151b0398a2536be60d950e10ffe9a8',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const std::vector&lt; std::pair&lt; int, std::string &gt; &gt; &amp;config)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a176b955c90ae57d7dbc3c63f27c84c75',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const NeuralNetwork &amp;model)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a173bb71780af6953ec2e307a4c74b025',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(NeuralNetwork &amp;&amp;)=default']]],
-  ['new_5fval_22',['new_val',['../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2',1,'statistics::stats_computer1::new_val()'],['../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534',1,'statistics::stats_computer2::new_val()']]],
-  ['newkid_23',['newKid',['../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817',1,'range_queries::perSegTree']]],
-  ['next_24',['next',['http://en.cppreference.com/w/cpp/iterator/next.html',0,'std']]],
-  ['next_5fhigher_5fnumber_25',['next_higher_number',['../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e',1,'bit_manipulation']]],
-  ['next_5fpermutation_26',['next_permutation',['http://en.cppreference.com/w/cpp/algorithm/next_permutation.html',0,'std']]],
-  ['nextafter_27',['nextafter',['http://en.cppreference.com/w/cpp/numeric/math/nextafter.html',0,'std']]],
-  ['nexttoward_28',['nexttoward',['http://en.cppreference.com/w/cpp/numeric/math/nextafter.html',0,'std']]],
-  ['no_5foccurence_5ftests_29',['no_occurence_tests',['../de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d',1,'fibonacci_search.cpp']]],
-  ['no_5fof_5fconnected_5fcomponents_30',['no_of_connected_components',['../d8/d99/connected__components__with__dsu_8cpp.html#ac2d6698b71384a352ec4b81b31b13141',1,'graph::disjoint_union']]],
-  ['noboolalpha_31',['noboolalpha',['http://en.cppreference.com/w/cpp/io/manip/boolalpha.html',0,'std']]],
-  ['node_32',['Node',['../d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78',1,'data_structures::Node::Node()'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5219979ea9a8baa3a273a9ec0f0c670',1,'data_structures::tree_234::Node::Node()'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5',1,'operations_on_datastructures::circular_linked_list::Node::Node(int64_t _data)'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95',1,'operations_on_datastructures::circular_linked_list::Node::Node(int64_t _data, Node *_next)'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3',1,'operations_on_datastructures::reverse_binary_tree::Node::Node()']]],
-  ['non_5frecursive_5fmerge_5fsort_33',['non_recursive_merge_sort',['../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)'],['../d5/d91/namespacesorting.html#a27236b8d3df3832e1f1225576a122534',1,'sorting::non_recursive_merge_sort(const Iterator first, const size_t n)'],['../d5/d91/namespacesorting.html#ae97f4dd815654c4682f564afd718e824',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last)']]],
-  ['none_34',['none',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]],
-  ['none_5fof_35',['none_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]],
-  ['normal_5fdistribution_36',['normal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/normal_distribution.html',0,'std::normal_distribution']]],
-  ['noshowbase_37',['noshowbase',['http://en.cppreference.com/w/cpp/io/manip/showbase.html',0,'std']]],
-  ['noshowpoint_38',['noshowpoint',['http://en.cppreference.com/w/cpp/io/manip/showpoint.html',0,'std']]],
-  ['noshowpos_39',['noshowpos',['http://en.cppreference.com/w/cpp/io/manip/showpos.html',0,'std']]],
-  ['noskipws_40',['noskipws',['http://en.cppreference.com/w/cpp/io/manip/skipws.html',0,'std']]],
-  ['not1_41',['not1',['http://en.cppreference.com/w/cpp/utility/functional/not1.html',0,'std']]],
-  ['not2_42',['not2',['http://en.cppreference.com/w/cpp/utility/functional/not2.html',0,'std']]],
-  ['not_5feof_43',['not_eof',['http://en.cppreference.com/w/cpp/string/char_traits/not_eof.html',0,'std::char_traits']]],
-  ['notify_5fall_44',['notify_all',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/notify_all.html',0,'std::condition_variable_any::notify_all()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/notify_all.html',0,'std::condition_variable::notify_all()']]],
-  ['notify_5fall_5fat_5fthread_5fexit_45',['notify_all_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/notify_all_at_thread_exit.html',0,'std']]],
-  ['notify_5fone_46',['notify_one',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/notify_one.html',0,'std::condition_variable_any::notify_one()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/notify_one.html',0,'std::condition_variable::notify_one()']]],
-  ['nounitbuf_47',['nounitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]],
-  ['nouppercase_48',['nouppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]],
-  ['now_49',['now',['http://en.cppreference.com/w/cpp/chrono/steady_clock/now.html',0,'std::chrono::steady_clock::now()'],['http://en.cppreference.com/w/cpp/chrono/system_clock/now.html',0,'std::chrono::system_clock::now()'],['http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html',0,'std::chrono::high_resolution_clock::now()']]],
-  ['nqueensol_50',['NQueenSol',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f',1,'backtracking::n_queens_optimized::NQueenSol()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#acc809c055f335011de0d9030034c7108',1,'backtracking::n_queens_all_solutions::NQueenSol()']]],
-  ['nth_5felement_51',['nth_element',['http://en.cppreference.com/w/cpp/algorithm/nth_element.html',0,'std']]],
-  ['num_5fdigits_52',['num_digits',['../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93',1,'large_number']]],
-  ['num_5fget_53',['num_get',['http://en.cppreference.com/w/cpp/locale/num_get/num_get.html',0,'std::num_get']]],
-  ['num_5fput_54',['num_put',['http://en.cppreference.com/w/cpp/locale/num_put/num_put.html',0,'std::num_put']]],
-  ['number_5fof_5fpositive_5fdivisors_55',['number_of_positive_divisors',['../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb',1,'number_of_positive_divisors.cpp']]],
-  ['number_5fof_5fsubsets_56',['number_of_subsets',['../d2/d5a/subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99',1,'backtracking::subset_sum']]],
-  ['number_5fof_5fvertices_57',['number_of_vertices',['../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904',1,'graph::Graph']]],
-  ['numberofchildren_58',['numberOfChildren',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0',1,'operations_on_datastructures::trie_operations::Tnode']]],
-  ['numberofciphersinfactorialn_59',['numberOfCiphersInFactorialN',['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#a0d5e1d651d0d30bd682f176d8f2b83d0',1,'bit_manipulation::count_of_trailing_ciphers_in_factorial_n']]],
-  ['numpunct_60',['numpunct',['http://en.cppreference.com/w/cpp/locale/numpunct/numpunct.html',0,'std::numpunct']]],
-  ['numpunct_5fbyname_61',['numpunct_byname',['http://en.cppreference.com/w/cpp/locale/numpunct_byname.html',0,'std::numpunct_byname']]]
+  ['n_5fbonacci_0',['N_bonacci',['../db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d',1,'math::n_bonacci']]],
+  ['n_5fchoose_5fr_1',['n_choose_r',['../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967',1,'math']]],
+  ['n_5fpolygon_5fsurface_5fperimeter_2',['n_polygon_surface_perimeter',['../dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f',1,'math']]],
+  ['naive_5fmultiplication_3',['naive_multiplication',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50',1,'divide_and_conquer::strassens_multiplication::Matrix']]],
+  ['ncr_4',['nCr',['../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a',1,'binomial_dist.cpp']]],
+  ['ncr_5',['ncr',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a499df7a01bcd348345dc5a0ab79bb0e9',1,'math::ncr_modulo_p::NCRModuloP']]],
+  ['ncrmodulop_6',['NCRModuloP',['../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a94b07e7dc61d8d7a1e9c5a28988e72f9',1,'math::ncr_modulo_p::NCRModuloP']]],
+  ['neuralnetwork_7',['NeuralNetwork',['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a4c4c6f63ab965317f9471518ee931b89',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const std::vector&lt; std::pair&lt; int, std::string &gt; &gt; &amp;config, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt; &gt; &gt; &amp;kernels)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ae7cf126a3a8f9d20c81b21584d061a08',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork()=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a62151b0398a2536be60d950e10ffe9a8',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const std::vector&lt; std::pair&lt; int, std::string &gt; &gt; &amp;config)'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a176b955c90ae57d7dbc3c63f27c84c75',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(const NeuralNetwork &amp;model)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a173bb71780af6953ec2e307a4c74b025',1,'machine_learning::neural_network::NeuralNetwork::NeuralNetwork(NeuralNetwork &amp;&amp;)=default']]],
+  ['new_5fval_8',['new_val',['../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2',1,'statistics::stats_computer1::new_val()'],['../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534',1,'statistics::stats_computer2::new_val()']]],
+  ['newkid_9',['newKid',['../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817',1,'range_queries::perSegTree']]],
+  ['next_5fhigher_5fnumber_10',['next_higher_number',['../d7/d81/namespacebit__manipulation.html#a4b76571a2a04fa99c30a96eca9997f0e',1,'bit_manipulation']]],
+  ['no_5foccurence_5ftests_11',['no_occurence_tests',['../de/d0d/fibonacci__search_8cpp.html#a5e144326104e57a3808aed7eb098db0d',1,'fibonacci_search.cpp']]],
+  ['no_5fof_5fconnected_5fcomponents_12',['no_of_connected_components',['../d8/d99/connected__components__with__dsu_8cpp.html#ac2d6698b71384a352ec4b81b31b13141',1,'graph::disjoint_union']]],
+  ['node_13',['Node',['../d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78',1,'data_structures::Node::Node()'],['../dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ad5219979ea9a8baa3a273a9ec0f0c670',1,'data_structures::tree_234::Node::Node()'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5',1,'operations_on_datastructures::circular_linked_list::Node::Node(int64_t _data)'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95',1,'operations_on_datastructures::circular_linked_list::Node::Node(int64_t _data, Node *_next)'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3',1,'operations_on_datastructures::reverse_binary_tree::Node::Node()']]],
+  ['non_5frecursive_5fmerge_5fsort_14',['non_recursive_merge_sort',['../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)'],['../d5/d91/namespacesorting.html#a27236b8d3df3832e1f1225576a122534',1,'sorting::non_recursive_merge_sort(const Iterator first, const size_t n)'],['../d5/d91/namespacesorting.html#ae97f4dd815654c4682f564afd718e824',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last)']]],
+  ['nqueensol_15',['NQueenSol',['../da/dac/n__queens__all__solution__optimised_8cpp.html#a23c0547e4fd1708e6fb643b08327a60f',1,'backtracking::n_queens_optimized::NQueenSol()'],['../d7/d24/nqueen__print__all__solutions_8cpp.html#acc809c055f335011de0d9030034c7108',1,'backtracking::n_queens_all_solutions::NQueenSol()']]],
+  ['num_5fdigits_16',['num_digits',['../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93',1,'large_number']]],
+  ['number_5fof_5fpositive_5fdivisors_17',['number_of_positive_divisors',['../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb',1,'number_of_positive_divisors.cpp']]],
+  ['number_5fof_5fsubsets_18',['number_of_subsets',['../d2/d5a/subset__sum_8cpp.html#a7cb50d36a59427a33f64a266dac83d99',1,'backtracking::subset_sum']]],
+  ['number_5fof_5fvertices_19',['number_of_vertices',['../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904',1,'graph::Graph']]],
+  ['numberofchildren_20',['numberOfChildren',['../d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#afca808362c13273ca8c8ae7d58e8eee0',1,'operations_on_datastructures::trie_operations::Tnode']]],
+  ['numberofciphersinfactorialn_21',['numberOfCiphersInFactorialN',['../da/d50/count__of__trailing__ciphers__in__factorial__n_8cpp.html#a0d5e1d651d0d30bd682f176d8f2b83d0',1,'bit_manipulation::count_of_trailing_ciphers_in_factorial_n']]]
 ];
diff --git a/search/functions_f.js b/search/functions_f.js
index d87d2802b..f6bd55be6 100644
--- a/search/functions_f.js
+++ b/search/functions_f.js
@@ -1,68 +1,47 @@
 var searchData=
 [
-  ['oct_0',['oct',['http://en.cppreference.com/w/cpp/io/manip/hex.html',0,'std']]],
-  ['offset_1',['offset',['../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801',1,'range_queries::fenwick_tree']]],
-  ['ofstream_2',['ofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream/basic_ofstream.html',0,'std::ofstream']]],
-  ['ols_5ftest_3',['ols_test',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d',1,'ordinary_least_squares_regressor.cpp']]],
-  ['on_5fsegment_4',['on_segment',['../d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf',1,'SegmentIntersection']]],
-  ['once_5fflag_5',['once_flag',['http://en.cppreference.com/w/cpp/thread/once_flag.html',0,'std::once_flag']]],
-  ['open_6',['open',['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::basic_ofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::fstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::basic_filebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::basic_fstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::wfilebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::wifstream::open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages_byname::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::filebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::ofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::basic_ifstream::open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::wfstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::wofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::ifstream::open()']]],
-  ['opening_7',['opening',['../dc/dc5/paranthesis__matching_8cpp.html#ade525d33459755a32ba21e1b6910ff21',1,'paranthesis_matching.cpp']]],
-  ['operator_20auto_5fptr_3c_20y_20_3e_8',['operator auto_ptr&lt; Y &gt;',['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator_auto_ptr.html',0,'std::auto_ptr']]],
-  ['operator_20bool_9',['operator bool',['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::fstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::fstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/operator_bool.html',0,'std::unique_lock::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ios::operator bool()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator_bool.html',0,'std::shared_ptr::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_fstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_fstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::iostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::iostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wistream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::stringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::stringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator_bool.html',0,'std::unique_ptr::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/operator_bool.html',0,'std::shared_lock::operator bool()'],['http://en.cppreference.com/w/cpp/error/error_code/operator_bool.html',0,'std::error_code::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_istream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::strstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::strstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_stringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_stringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istrstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator_bool.html',0,'std::function::operator bool()'],['http://en.cppreference.com/w/cpp/error/error_condition/operator_bool.html',0,'std::error_condition::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wiostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wiostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_istringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator_bool.html',0,'std::experimental::optional::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostrstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wfstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wfstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_iostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_iostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wstringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wstringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wistringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry::operator bool()'],['../db/d9a/classuint128__t.html#a6d45302022ef7f5195458f41b8aedb6e',1,'uint128_t::operator bool()'],['../d1/d83/classuint256__t.html#a28aa5786bbfce1b00398a8d38691bdaa',1,'uint256_t::operator bool()']]],
-  ['operator_20string_5ftype_10',['operator string_type',['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wcsub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wssub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::csub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::ssub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::sub_match::operator string_type()']]],
-  ['operator_20t_11',['operator T',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_T.html',0,'std::atomic::operator T()'],['../db/d9a/classuint128__t.html#a75767cb2b6fd47ecb1f721755fdc7639',1,'uint128_t::operator T()'],['../d1/d83/classuint256__t.html#a9e1b39a46ea16bc6587e25e294c6c363',1,'uint256_t::operator T()']]],
-  ['operator_20t_26_12',['operator T&amp;',['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/get.html',0,'std::reference_wrapper']]],
-  ['operator_20uint128_5ft_13',['operator uint128_t',['../d1/d83/classuint256__t.html#ad5bd38b2d3becca998457af1124d6e8b',1,'uint256_t']]],
-  ['operator_21_14',['operator!',['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::fstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ios::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_fstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::iostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wistream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::stringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wifstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_istream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::strstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_stringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istrstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wiostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_istringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ifstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostrstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wfstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_iostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wstringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wistringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ifstream::operator!()'],['../db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d',1,'uint128_t::operator!()'],['../d1/d83/classuint256__t.html#a028c585069fa53b74c153667ff66352c',1,'uint256_t::operator!()']]],
-  ['operator_21_3d_15',['operator!=',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::regex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::sregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wcregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::cregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/locale/locale/operator_cmp.html',0,'std::locale::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wsregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator!=()'],['http://en.cppreference.com/w/cpp/types/type_info/operator_cmp.html',0,'std::type_info::operator!=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_cmp.html',0,'std::bitset::operator!=()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::cregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wsregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wcregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::regex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::sregex_token_iterator::operator!=()'],['../db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e',1,'uint128_t::operator!=(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696',1,'uint128_t::operator!=(const T other)'],['../d1/d83/classuint256__t.html#aae68a7bd17c14a926fb77758b5c8e547',1,'uint256_t::operator!=(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#a89cf7fa466458ee08edd9a809d072bcb',1,'uint256_t::operator!=(const T &amp;other)'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator!=()']]],
-  ['operator_25_16',['operator%',['../db/d9a/classuint128__t.html#abfc6a8765039cacc829a5cd386b5a066',1,'uint128_t::operator%(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#add9938b97fc66560cec2d32e8c83eaad',1,'uint128_t::operator%(const T &amp;p)'],['../d1/d83/classuint256__t.html#ad4928175eaaaa2b559bc945affe63ad2',1,'uint256_t::operator%(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#a7bd9693b88c4df08b1f8d1fd81c597cc',1,'uint256_t::operator%(const T &amp;p)']]],
-  ['operator_25_3d_17',['operator%=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator%=()'],['../db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2',1,'uint128_t::operator%=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40',1,'uint128_t::operator%=(const T &amp;p)'],['../d1/d83/classuint256__t.html#a2cd43a4a92dc825a010a17578b3bdedb',1,'uint256_t::operator%=(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#a76914bc727eab927a3941ef71275327d',1,'uint256_t::operator%=(const T &amp;p)']]],
-  ['operator_26_18',['operator&amp;',['../db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244',1,'uint128_t::operator&amp;(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4',1,'uint128_t::operator&amp;(const T p)'],['../d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8',1,'uint256_t::operator&amp;(const T &amp;p)'],['../d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839',1,'uint256_t::operator&amp;(const uint256_t &amp;p)']]],
-  ['operator_26_26_19',['operator&amp;&amp;',['../db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1',1,'uint128_t::operator&amp;&amp;(const uint128_t &amp;b)'],['../db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a',1,'uint128_t::operator&amp;&amp;(const T b)'],['../d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963',1,'uint256_t::operator&amp;&amp;(const uint256_t &amp;b)'],['../d1/d83/classuint256__t.html#a303287d7bc8686dcb47fcb04720ad409',1,'uint256_t::operator&amp;&amp;(const T &amp;b)']]],
-  ['operator_26_3d_20',['operator&amp;=',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator&amp;=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator&amp;=()'],['../db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050',1,'uint128_t::operator&amp;=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640',1,'uint128_t::operator&amp;=(const T p)'],['../d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d',1,'uint256_t::operator&amp;=(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#afa79020c27caea31236d04ecaa0e5ef5',1,'uint256_t::operator&amp;=(const T p)']]],
-  ['operator_28_29_21',['operator()',['http://en.cppreference.com/w/cpp/utility/functional/logical_and.html',0,'std::logical_and::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/modulus.html',0,'std::modulus::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/operator().html',0,'std::student_t_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mt19937_64::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::ranlux24_base::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/operator().html',0,'std::extreme_value_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/operator().html',0,'std::lognormal_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html',0,'std::greater_equal::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/operator().html',0,'std::discrete_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::ranlux48::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/operator().html',0,'std::piecewise_constant_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/less_equal.html',0,'std::less_equal::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/logical_or.html',0,'std::logical_or::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std::binary_negate::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::discard_block_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/operator().html',0,'std::exponential_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mersenne_twister_engine::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/negate.html',0,'std::negate::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/not_equal_to.html',0,'std::not_equal_to::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/operator().html',0,'std::independent_bits_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/operator().html',0,'std::normal_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::minstd_rand::operator()()'],['http://en.cppreference.com/w/cpp/locale/locale/operator().html',0,'std::locale::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/equal_to.html',0,'std::equal_to::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/divides.html',0,'std::divides::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/operator().html',0,'std::weibull_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/less.html',0,'std::less::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/multiplies.html',0,'std::multiplies::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/operator().html',0,'std::reference_wrapper::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::ranlux48_base::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_not.html',0,'std::bit_not::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mt19937::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/operator().html',0,'std::chi_squared_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/operator().html',0,'std::piecewise_linear_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/hash/operator().html',0,'std::hash::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/operator().html',0,'std::shuffle_order_engine::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/greater.html',0,'std::greater::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_and.html',0,'std::bit_and::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/operator().html',0,'std::uniform_int_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/operator().html',0,'std::fisher_f_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::ranlux24::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/plus.html',0,'std::plus::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_or.html',0,'std::bit_or::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator().html',0,'std::function::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/minus.html',0,'std::minus::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::linear_congruential_engine::operator()()'],['http://en.cppreference.com/w/cpp/memory/owner_less.html',0,'std::owner_less::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/operator().html',0,'std::knuth_b::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::minstd_rand0::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/logical_not.html',0,'std::logical_not::operator()()'],['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/operator().html',0,'std::gamma_distribution::operator()()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/operator().html',0,'std::packaged_task::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/operator().html',0,'std::cauchy_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::subtract_with_carry_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/operator().html',0,'std::random_device::operator()()'],['../db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733',1,'uint128_t::operator()()'],['../d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b',1,'uint256_t::operator()()'],['../de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c',1,'Compare::operator()()']]],
-  ['operator_2a_22',['operator*',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::regex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::sregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator*.html',0,'std::shared_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wcregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::cregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator*.html',0,'std::unique_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wsregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::cregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wsregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator*.html',0,'std::experimental::optional::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wcregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::regex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator*.html',0,'std::auto_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::sregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator*.html',0,'std::raw_storage_iterator::operator*()'],['../db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30',1,'uint128_t::operator*(const T p)'],['../db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860',1,'uint128_t::operator*(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616',1,'uint256_t::operator*(const T &amp;p)'],['../d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967',1,'uint256_t::operator*(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*(const Matrix&lt; Number &gt; &amp;other) const'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*(const Number other) const'],['../da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d',1,'Complex::operator*()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae2edd40354a1ca7aeaee3d1e3589e713',1,'operator*(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A, std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;B):&#160;ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a865e8d26a01962cc93aca66e71346f37',1,'operator*(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A, std::vector&lt; T &gt; const &amp;B):&#160;ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a207b3a99fd5974d3117e0b0ac0aad234',1,'operator*(float const scalar, std::vector&lt; T &gt; const &amp;A):&#160;ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a42535e20e97d85aa61271e0894cc0359',1,'operator*(std::vector&lt; T &gt; const &amp;A, float const scalar):&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a16f34574b7e0dd51bc3b3fda37446695',1,'machine_learning::operator*()']]],
-  ['operator_2a_3d_23',['operator*=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator*=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator*=()'],['../db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092',1,'uint128_t::operator*=(const T p)'],['../db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295',1,'uint128_t::operator*=(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028',1,'uint256_t::operator*=(const T &amp;p)'],['../d1/d83/classuint256__t.html#a4645040fe68ff01d83400f173fd2bb21',1,'uint256_t::operator*=(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*=()'],['../db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350',1,'large_number::operator*=()']]],
-  ['operator_2b_24',['operator+',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::minutes::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::seconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::duration::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::milliseconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::hours::operator+()'],['http://en.cppreference.com/w/cpp/chrono/time_point/operator_arith.html',0,'std::chrono::time_point::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::microseconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::nanoseconds::operator+()'],['../db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d',1,'uint128_t::operator+(const T p)'],['../db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606',1,'uint128_t::operator+(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f',1,'uint256_t::operator+(const T &amp;p)'],['../d1/d83/classuint256__t.html#af18e2e3d7ed635c4056062bc906fef75',1,'uint256_t::operator+(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211',1,'divide_and_conquer::strassens_multiplication::Matrix::operator+()'],['../da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c',1,'Complex::operator+()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a01e6c7bf2b09272578b9c5819ce0f36f',1,'operator+():&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a2466857dab977a49f117029835b3b6d2',1,'machine_learning::operator+()']]],
-  ['operator_2b_2b_25',['operator++',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::regex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::sregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wcregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::cregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wsregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator++()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::cregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wsregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wcregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::regex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::sregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator_arith.html',0,'std::raw_storage_iterator::operator++()'],['../db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e',1,'uint128_t::operator++()'],['../db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6',1,'uint128_t::operator++(int)'],['../d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9',1,'uint256_t::operator++()'],['../d1/d83/classuint256__t.html#a7bbe36e2ebd52df5efab118897b3050c',1,'uint256_t::operator++(int)'],['../db/d82/classlarge__number.html#a4757697b1f7584b69e779a72abc4ae2a',1,'large_number::operator++()'],['../db/d82/classlarge__number.html#a8d4364ee5a62964451d8cfee82649687',1,'large_number::operator++(int)']]],
-  ['operator_2b_2b_28int_29_26',['operator++(int)',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::regex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::sregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wcregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::cregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wsregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::cregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wsregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wcregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::regex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::sregex_token_iterator::operator++(int)()']]],
-  ['operator_2b_3d_27',['operator+=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator+=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator+=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator+=()'],['../db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004',1,'uint128_t::operator+=(const T p)'],['../db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb',1,'uint128_t::operator+=(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1',1,'uint256_t::operator+=(const T &amp;p)'],['../d1/d83/classuint256__t.html#ac75a46fe3625caf10e07db1eb75a1d6e',1,'uint256_t::operator+=(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae190115f8d4d31e47d7290e0b6871391',1,'divide_and_conquer::strassens_multiplication::Matrix::operator+=()'],['../db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf',1,'large_number::operator+=()']]],
-  ['operator_2d_28',['operator-',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::minutes::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::seconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::duration::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::milliseconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::hours::operator-()'],['http://en.cppreference.com/w/cpp/chrono/time_point/operator_arith.html',0,'std::chrono::time_point::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::microseconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::nanoseconds::operator-()'],['../db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec',1,'uint128_t::operator-(const T &amp;p)'],['../db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c',1,'uint128_t::operator-(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3',1,'uint128_t::operator-()'],['../d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4',1,'uint256_t::operator-(const T &amp;p)'],['../d1/d83/classuint256__t.html#ab909ef62a0c85121e7d743c016fb723d',1,'uint256_t::operator-(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#a406c951a07d8173685dbe384c6ab6a06',1,'uint256_t::operator-()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a678681c9f6266a8219bd6bee6972d70e',1,'divide_and_conquer::strassens_multiplication::Matrix::operator-()'],['../da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da',1,'Complex::operator-()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4a6a560dbdd0177633783b72db37dc19',1,'operator-():&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a0cc29566568e0383dd7d374068cbe6b3',1,'machine_learning::operator-()']]],
-  ['operator_2d_2d_29',['operator--',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator--()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator--()'],['../db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed',1,'uint128_t::operator--()'],['../db/d9a/classuint128__t.html#a2ecb71686e1c9ed0267124580c91c414',1,'uint128_t::operator--(int p)'],['../d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183',1,'uint256_t::operator--()'],['../d1/d83/classuint256__t.html#a28d26847f9b19a4f86c187791cb0db13',1,'uint256_t::operator--(int p)']]],
-  ['operator_2d_2d_28int_29_30',['operator--(int)',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator--(int)()']]],
-  ['operator_2d_3d_31',['operator-=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator-=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator-=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator-=()'],['../db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798',1,'uint128_t::operator-=(const T &amp;p)'],['../db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8',1,'uint128_t::operator-=(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7',1,'uint256_t::operator-=(const T p)'],['../d1/d83/classuint256__t.html#a5e84ed2a2f99cee81ede4a0107702a45',1,'uint256_t::operator-=(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a42c986fb57b74fe1b7c5953cb1922c3d',1,'divide_and_conquer::strassens_multiplication::Matrix::operator-=()']]],
-  ['operator_2d_3e_32',['operator-&gt;',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::regex_iterator::operator-&gt;()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::sregex_iterator::operator-&gt;()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator*.html',0,'std::shared_ptr::operator-&gt;()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wcregex_iterator::operator-&gt;()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::cregex_token_iterator::operator-&gt;()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator*.html',0,'std::unique_ptr::operator-&gt;()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wsregex_token_iterator::operator-&gt;()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::cregex_iterator::operator-&gt;()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wsregex_iterator::operator-&gt;()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator*.html',0,'std::experimental::optional::operator-&gt;()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wcregex_token_iterator::operator-&gt;()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::regex_token_iterator::operator-&gt;()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator*.html',0,'std::auto_ptr::operator-&gt;()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::sregex_token_iterator::operator-&gt;()']]],
-  ['operator_2f_33',['operator/',['../db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee',1,'uint128_t::operator/(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94',1,'uint128_t::operator/(const T p)'],['../d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6',1,'uint256_t::operator/(const T &amp;p)'],['../d1/d83/classuint256__t.html#a4fdeb4d4bf8cca4ee99b8487e59831df',1,'uint256_t::operator/(const uint256_t &amp;p)'],['../da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90',1,'Complex::operator/()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7a2d742b9a3ae7b85292e1f86428bb4f',1,'operator/():&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5',1,'machine_learning::operator/()']]],
-  ['operator_2f_3d_34',['operator/=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator/=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator/=()'],['../db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db',1,'uint128_t::operator/=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b',1,'uint128_t::operator/=(const T p)'],['../d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4',1,'uint256_t::operator/=(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#abc793979ec70bb8e5cf177d83649a259',1,'uint256_t::operator/=(const T &amp;p)']]],
-  ['operator_3c_35',['operator&lt;',['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator&lt;()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator&lt;()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator&lt;()'],['../db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4',1,'uint128_t::operator&lt;(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc',1,'uint128_t::operator&lt;(const T other)'],['../d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96',1,'uint256_t::operator&lt;(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#ac6bdcf64653af8173987bf7217e99056',1,'uint256_t::operator&lt;(const T &amp;other)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba',1,'machine_learning::aystar_search::EightPuzzle::operator&lt;()']]],
-  ['operator_3c_3c_36',['operator&lt;&lt;',['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ofstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::fstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wostream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ostringstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostringstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_fstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::iostream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::stringstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::strstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_stringstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_ltlt.html',0,'std::thread::id::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wostringstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ostream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wiostream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ofstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostrstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wfstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_iostream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wofstream::operator&lt;&lt;()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wstringstream::operator&lt;&lt;()'],['../db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190',1,'uint128_t::operator&lt;&lt;()'],['../d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5',1,'uint256_t::operator&lt;&lt;()'],['../d7/db9/hill__cipher_8cpp.html#a34bfcd756610834acac501f9eea1e2eb',1,'operator&lt;&lt;(std::ostream &amp;out, matrix&lt; T &gt; const &amp;v):&#160;hill_cipher.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4',1,'operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;v):&#160;ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ab1ad727903d7817c2758d25bcb52cbc8',1,'operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; T &gt; const &amp;v):&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7',1,'machine_learning::operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; std::valarray&lt; T &gt; &gt; const &amp;A)'],['../d8/d77/namespacemachine__learning.html#af4986b23760039711848155739c31b35',1,'machine_learning::operator&lt;&lt;(std::ostream &amp;out, const std::pair&lt; T, T &gt; &amp;A)'],['../d8/d77/namespacemachine__learning.html#a54bf1f3c43271a5fc93101f6ae2e6269',1,'machine_learning::operator&lt;&lt;(std::ostream &amp;out, const std::valarray&lt; T &gt; &amp;A)'],['../d5/d67/complex__numbers_8cpp.html#a44d5f25b573e870accdf26fd32b8484d',1,'operator&lt;&lt;(std::ostream &amp;os, const Complex &amp;num):&#160;complex_numbers.cpp'],['../dd/d65/lu__decompose_8cpp.html#a575c989afcc78e875031cd4273e62a3e',1,'operator&lt;&lt;(std::ostream &amp;out, matrix&lt; T &gt; const &amp;v):&#160;lu_decompose.cpp'],['../d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834',1,'qr_algorithm::operator&lt;&lt;(std::ostream &amp;out, std::valarray&lt; std::valarray&lt; T &gt; &gt; const &amp;v)'],['../d2/d3b/namespaceqr__algorithm.html#a257425cb2365359da51c6fe6741834d8',1,'qr_algorithm::operator&lt;&lt;(std::ostream &amp;out, std::valarray&lt; T &gt; const &amp;v)']]],
-  ['operator_3c_3c_3d_37',['operator&lt;&lt;=',['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator&lt;&lt;=()'],['../db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a',1,'uint128_t::operator&lt;&lt;=()'],['../d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5',1,'uint256_t::operator&lt;&lt;=()']]],
-  ['operator_3c_3d_38',['operator&lt;=',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator&lt;=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator&lt;=()'],['../db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a',1,'uint128_t::operator&lt;=(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c',1,'uint128_t::operator&lt;=(const T other)'],['../d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88',1,'uint256_t::operator&lt;=(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#a2029e9777f999bffef6004429b4f19f2',1,'uint256_t::operator&lt;=(const T &amp;other)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee',1,'machine_learning::aystar_search::EightPuzzle::operator&lt;=()'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator&lt;=()']]],
-  ['operator_3d_39',['operator=',['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::basic_ofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::fstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::regex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/container/vector/operator=.html',0,'std::vector::operator=()'],['http://en.cppreference.com/w/cpp/container/multiset/operator=.html',0,'std::multiset::operator=()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/operator=.html',0,'std::weak_ptr::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::string::operator=()'],['http://en.cppreference.com/w/cpp/container/set/operator=.html',0,'std::set::operator=()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/operator=.html',0,'std::unique_lock::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::basic_ostringstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::regex::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_map/operator=.html',0,'std::unordered_map::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::basic_regex::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::basic_filebuf::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::wstringbuf::operator=()'],['http://en.cppreference.com/w/cpp/utility/tuple/operator=.html',0,'std::tuple::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::sregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator=.html',0,'std::shared_ptr::operator=()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_alloc::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::ostringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::basic_fstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::stringbuf::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::wcregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::wregex::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::cregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::wfilebuf::operator=()'],['http://en.cppreference.com/w/cpp/container/stack/operator=.html',0,'std::stack::operator=()'],['http://en.cppreference.com/w/cpp/thread/shared_future/operator=.html',0,'std::shared_future::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::wstreambuf::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::stringstream::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/operator=.html',0,'std::unordered_multimap::operator=()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator=.html',0,'std::unique_ptr::operator=()'],['http://en.cppreference.com/w/cpp/container/forward_list/operator=.html',0,'std::forward_list::operator=()'],['http://en.cppreference.com/w/cpp/locale/locale/operator=.html',0,'std::locale::operator=()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/operator=.html',0,'std::shared_lock::operator=()'],['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/operator=.html',0,'std::enable_shared_from_this::operator=()'],['http://en.cppreference.com/w/cpp/thread/future/operator=.html',0,'std::future::operator=()'],['http://en.cppreference.com/w/cpp/utility/pair/operator=.html',0,'std::pair::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::wsregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/error/error_code/operator=.html',0,'std::error_code::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::wifstream::operator=()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/operator=.html',0,'std::reference_wrapper::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::minutes::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::seconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::duration::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::milliseconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::hours::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::microseconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::nanoseconds::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::basic_stringbuf::operator=()'],['http://en.cppreference.com/w/cpp/container/deque/operator=.html',0,'std::deque::operator=()'],['http://en.cppreference.com/w/cpp/thread/promise/operator=.html',0,'std::promise::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::basic_streambuf::operator=()'],['http://en.cppreference.com/w/cpp/container/queue/operator=.html',0,'std::queue::operator=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator=.html',0,'std::atomic::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::basic_stringstream::operator=()'],['http://en.cppreference.com/w/cpp/thread/thread/operator=.html',0,'std::thread::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::basic_string::operator=()'],['http://en.cppreference.com/w/cpp/container/priority_queue/operator=.html',0,'std::priority_queue::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::wostringstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::cregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::wstring::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/operator=.html',0,'std::unordered_multiset::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::wsregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator=.html',0,'std::function::operator=()'],['http://en.cppreference.com/w/cpp/error/error_condition/operator=.html',0,'std::error_condition::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::filebuf::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::u16string::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::u32string::operator=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator=.html',0,'std::complex::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::ofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::basic_istringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::basic_ifstream::operator=()'],['http://en.cppreference.com/w/cpp/container/list/operator=.html',0,'std::list::operator=()'],['http://en.cppreference.com/w/cpp/container/map/operator=.html',0,'std::map::operator=()'],['http://en.cppreference.com/w/cpp/error/exception/operator=.html',0,'std::exception::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::streambuf::operator=()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator=.html',0,'std::experimental::optional::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::wcregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::regex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::istringstream::operator=()'],['http://en.cppreference.com/w/cpp/error/nested_exception/operator=.html',0,'std::nested_exception::operator=()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator=.html',0,'std::auto_ptr::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::sregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/operator=.html',0,'std::packaged_task::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_set/operator=.html',0,'std::unordered_set::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::wfstream::operator=()'],['http://en.cppreference.com/w/cpp/container/multimap/operator=.html',0,'std::multimap::operator=()'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/operator=.html',0,'std::atomic_flag::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::wofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::wstringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::wistringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::ifstream::operator=()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator=.html',0,'std::raw_storage_iterator::operator=()'],['../db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544',1,'uint128_t::operator=(const T &amp;p)'],['../db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74',1,'uint128_t::operator=(const std::string &amp;p)'],['../db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5',1,'uint128_t::operator=(const uint128_t &amp;p)=default'],['../db/d9a/classuint128__t.html#a3c4a7e775a0820196fc08303bbeed44a',1,'uint128_t::operator=(uint128_t &amp;&amp;p)=default'],['../d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc',1,'uint256_t::operator=(const uint256_t &amp;p)=default'],['../d1/d83/classuint256__t.html#addff5645f6005e7b50a6ad0731e4f19c',1,'uint256_t::operator=(const T &amp;p)'],['../d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2',1,'uint256_t::operator=(const std::string &amp;p)'],['../d1/d83/classuint256__t.html#a6c5e025f901f6af4b748f98013350638',1,'uint256_t::operator=(uint256_t &amp;&amp;p)=default'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#adb04f732911fcfd30f7177b367c6af41',1,'data_structures::linked_list::list::operator=()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2',1,'machine_learning::aystar_search::EightPuzzle::operator=(const EightPuzzle &amp;A)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101',1,'machine_learning::aystar_search::EightPuzzle::operator=(EightPuzzle &amp;&amp;A) noexcept'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317',1,'machine_learning::aystar_search::AyStarSearch::Info::operator=(const Info &amp;A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3993dbca9c5b3ef9ac361dc7f62ce57',1,'machine_learning::aystar_search::AyStarSearch::Info::operator=(Info &amp;&amp;A) noexcept'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a080f5b1742832a03c1cbba596a48bd1a',1,'machine_learning::k_nearest_neighbors::Knn::operator=(const Knn &amp;model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#ac06986d5afddc767ddba4da738f75563',1,'machine_learning::k_nearest_neighbors::Knn::operator=(Knn &amp;&amp;)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ae077132526d2863e46aa77cb0f7d6aa2',1,'machine_learning::neural_network::layers::DenseLayer::operator=(const DenseLayer &amp;layer)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a19aaccad279b22dbbb6c55e5697b4114',1,'machine_learning::neural_network::layers::DenseLayer::operator=(DenseLayer &amp;&amp;)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58a9614e4c6d4ca672d3358e99a3404f',1,'machine_learning::neural_network::NeuralNetwork::operator=(const NeuralNetwork &amp;model)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2c49bfebf9b859d5ceb26035d3003601',1,'machine_learning::neural_network::NeuralNetwork::operator=(NeuralNetwork &amp;&amp;)=default'],['../da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac',1,'Complex::operator=()'],['../db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b',1,'large_number::operator=()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=(const CircularLinkedList &amp;other)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=(CircularLinkedList &amp;&amp;other) noexcept']]],
-  ['operator_3d_3d_40',['operator==',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::regex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::sregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wcregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::cregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/locale/locale/operator_cmp.html',0,'std::locale::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wsregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator==()'],['http://en.cppreference.com/w/cpp/types/type_info/operator_cmp.html',0,'std::type_info::operator==()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_cmp.html',0,'std::bitset::operator==()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::cregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wsregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wcregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::regex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::sregex_token_iterator::operator==()'],['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446',1,'ciphers::elliptic_curve_key_exchange::Point::operator==()'],['../db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e',1,'uint128_t::operator==(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896',1,'uint128_t::operator==(const T other)'],['../d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261',1,'uint256_t::operator==(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484',1,'uint256_t::operator==(const T &amp;other)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c',1,'divide_and_conquer::strassens_multiplication::Matrix::operator==()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915',1,'machine_learning::aystar_search::EightPuzzle::operator==()'],['../d5/d67/complex__numbers_8cpp.html#a5a73e9d4e68af8cedb95bd0864054b89',1,'operator==():&#160;complex_numbers.cpp']]],
-  ['operator_3e_41',['operator&gt;',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator&gt;()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator&gt;()'],['../db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440',1,'uint128_t::operator&gt;(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e',1,'uint128_t::operator&gt;(const T other)'],['../d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d',1,'uint256_t::operator&gt;(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#ad74d33215517459c2b33ace7a9c6bc13',1,'uint256_t::operator&gt;(const T &amp;other)'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator&gt;()']]],
-  ['operator_3e_3d_42',['operator&gt;=',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator&gt;=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator&gt;=()'],['../db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292',1,'uint128_t::operator&gt;=(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481',1,'uint128_t::operator&gt;=(const T other)'],['../d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad',1,'uint256_t::operator&gt;=(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#aff4d49cf84de64301b169ad974f00bad',1,'uint256_t::operator&gt;=(const T &amp;other)'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator&gt;=()']]],
-  ['operator_3e_3e_43',['operator&gt;&gt;',['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::fstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_fstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::iostream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wistream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::stringstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wifstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_istream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::strstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_stringstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istrstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wiostream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_istringstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_ifstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istringstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wfstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_iostream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wstringstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wistringstream::operator&gt;&gt;()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::ifstream::operator&gt;&gt;()'],['../db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848',1,'uint128_t::operator&gt;&gt;()'],['../d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51',1,'uint256_t::operator&gt;&gt;()']]],
-  ['operator_3e_3e_3d_44',['operator&gt;&gt;=',['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator&gt;&gt;=()'],['../db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9',1,'uint128_t::operator&gt;&gt;=()'],['../d1/d83/classuint256__t.html#ad9ce2370b1497efbcc426793048e1f78',1,'uint256_t::operator&gt;&gt;=()']]],
-  ['operator_5b_5d_45',['operator[]',['http://en.cppreference.com/w/cpp/container/dynarray/operator_at.html',0,'std::dynarray::operator[]()'],['http://en.cppreference.com/w/cpp/container/vector/operator_at.html',0,'std::vector::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::match_results::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::string::operator[]()'],['http://en.cppreference.com/w/cpp/container/unordered_map/operator_at.html',0,'std::unordered_map::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::wsmatch::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::smatch::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::wcmatch::operator[]()'],['http://en.cppreference.com/w/cpp/container/deque/operator_at.html',0,'std::deque::operator[]()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_at.html',0,'std::bitset::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::basic_string::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::wstring::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::u16string::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::u32string::operator[]()'],['http://en.cppreference.com/w/cpp/container/map/operator_at.html',0,'std::map::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::cmatch::operator[]()'],['http://en.cppreference.com/w/cpp/container/array/operator_at.html',0,'std::array::operator[]()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ac4c64e5723fa12a043fd0a7f5ed5bb37',1,'divide_and_conquer::strassens_multiplication::Matrix::operator[]()'],['../db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08',1,'large_number::operator[]()']]],
-  ['operator_5e_46',['operator^',['../db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37',1,'uint128_t::operator^(const T p)'],['../db/d9a/classuint128__t.html#a9487ed06019d846add5dc8874e41eb8b',1,'uint128_t::operator^(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e',1,'uint256_t::operator^(const T &amp;p)'],['../d1/d83/classuint256__t.html#a74d1e1dd8cd2b31e00813ed939943be7',1,'uint256_t::operator^(const uint256_t &amp;p)']]],
-  ['operator_5e_3d_47',['operator^=',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator^=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator^=()'],['../db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a',1,'uint128_t::operator^=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67',1,'uint128_t::operator^=(const T &amp;p)'],['../d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7',1,'uint256_t::operator^=(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#a3dc4d3ab175f5f2a3172eb8d99a60fc3',1,'uint256_t::operator^=(const T &amp;p)']]],
-  ['operator_7c_48',['operator|',['../db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304',1,'uint128_t::operator|(const T p)'],['../db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd',1,'uint128_t::operator|(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf',1,'uint256_t::operator|(const T &amp;p)'],['../d1/d83/classuint256__t.html#a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2',1,'uint256_t::operator|(const uint256_t &amp;p)']]],
-  ['operator_7c_3d_49',['operator|=',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator|=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator|=()'],['../db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d',1,'uint128_t::operator|=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee',1,'uint128_t::operator|=(const T p)'],['../d1/d83/classuint256__t.html#af0a6e09fcf1cbf234ed32df6d7265a0b',1,'uint256_t::operator|=(const T &amp;p)'],['../d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc',1,'uint256_t::operator|=(const uint256_t &amp;p)']]],
-  ['operator_7c_7c_50',['operator||',['../db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03',1,'uint128_t::operator||(const uint128_t &amp;b)'],['../db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503',1,'uint128_t::operator||(const T b)'],['../d1/d83/classuint256__t.html#a41f4bb928c4ee067732503395b65f9d7',1,'uint256_t::operator||(const uint256_t &amp;b)'],['../d1/d83/classuint256__t.html#a4886747ffff15cdeb6bc93712629f9e7',1,'uint256_t::operator||(const T &amp;b)']]],
-  ['operator_7e_51',['operator~',['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator~()'],['../db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f',1,'uint128_t::operator~()'],['../d1/d83/classuint256__t.html#a6eec1f632aebfc44fee8a74c395e10c2',1,'uint256_t::operator~()'],['../da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d',1,'Complex::operator~()']]],
-  ['optional_52',['optional',['http://en.cppreference.com/w/cpp/experimental/optional/optional.html',0,'std::experimental::optional']]],
-  ['orientation_53',['orientation',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c',1,'geometry::jarvis::Convexhull']]],
-  ['ostream_54',['ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream/basic_ostream.html',0,'std::ostream']]],
-  ['ostringstream_55',['ostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::ostringstream']]],
-  ['ostrstream_56',['ostrstream',['http://en.cppreference.com/w/cpp/io/ostrstream/ostrstream.html',0,'std::ostrstream']]],
-  ['otherhashfxn_57',['otherHashFxn',['../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082',1,'double_hashing']]],
-  ['out_58',['out',['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_byname::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8_utf16::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf16::out()']]],
-  ['out_5fof_5frange_59',['out_of_range',['http://en.cppreference.com/w/cpp/error/out_of_range.html',0,'std::out_of_range']]],
-  ['outer_5fallocator_60',['outer_allocator',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/outer_allocator.html',0,'std::scoped_allocator_adaptor']]],
-  ['overflow_61',['overflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_filebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wstringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::stringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wfilebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wstreambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::strstreambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_stringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_streambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::filebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::streambuf::overflow()']]],
-  ['overflow_5ferror_62',['overflow_error',['http://en.cppreference.com/w/cpp/error/overflow_error.html',0,'std::overflow_error']]],
-  ['owner_5fbefore_63',['owner_before',['http://en.cppreference.com/w/cpp/memory/weak_ptr/owner_before.html',0,'std::weak_ptr::owner_before()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/owner_before.html',0,'std::shared_ptr::owner_before()']]],
-  ['owns_5flock_64',['owns_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/owns_lock.html',0,'std::unique_lock::owns_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/owns_lock.html',0,'std::shared_lock::owns_lock()']]]
+  ['offset_0',['offset',['../de/d0d/classrange__queries_1_1fenwick__tree.html#ab492ebf07cab0e3c32d277ad986de801',1,'range_queries::fenwick_tree']]],
+  ['ols_5ftest_1',['ols_test',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d',1,'ordinary_least_squares_regressor.cpp']]],
+  ['on_5fsegment_2',['on_segment',['../d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf',1,'SegmentIntersection']]],
+  ['opening_3',['opening',['../dc/dc5/paranthesis__matching_8cpp.html#ade525d33459755a32ba21e1b6910ff21',1,'paranthesis_matching.cpp']]],
+  ['operator_20bool_4',['operator bool',['../db/d9a/classuint128__t.html#a6d45302022ef7f5195458f41b8aedb6e',1,'uint128_t::operator bool()'],['../d1/d83/classuint256__t.html#a28aa5786bbfce1b00398a8d38691bdaa',1,'uint256_t::operator bool()']]],
+  ['operator_20t_5',['operator T',['../db/d9a/classuint128__t.html#a75767cb2b6fd47ecb1f721755fdc7639',1,'uint128_t::operator T()'],['../d1/d83/classuint256__t.html#a9e1b39a46ea16bc6587e25e294c6c363',1,'uint256_t::operator T() const']]],
+  ['operator_20uint128_5ft_6',['operator uint128_t',['../d1/d83/classuint256__t.html#ad5bd38b2d3becca998457af1124d6e8b',1,'uint256_t']]],
+  ['operator_21_7',['operator!',['../db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d',1,'uint128_t::operator!()'],['../d1/d83/classuint256__t.html#a028c585069fa53b74c153667ff66352c',1,'uint256_t::operator!()']]],
+  ['operator_21_3d_8',['operator!=',['../db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e',1,'uint128_t::operator!=(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696',1,'uint128_t::operator!=(const T other)'],['../d1/d83/classuint256__t.html#aae68a7bd17c14a926fb77758b5c8e547',1,'uint256_t::operator!=(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#a89cf7fa466458ee08edd9a809d072bcb',1,'uint256_t::operator!=(const T &amp;other)']]],
+  ['operator_25_9',['operator%',['../db/d9a/classuint128__t.html#abfc6a8765039cacc829a5cd386b5a066',1,'uint128_t::operator%(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#add9938b97fc66560cec2d32e8c83eaad',1,'uint128_t::operator%(const T &amp;p)'],['../d1/d83/classuint256__t.html#ad4928175eaaaa2b559bc945affe63ad2',1,'uint256_t::operator%(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#a7bd9693b88c4df08b1f8d1fd81c597cc',1,'uint256_t::operator%(const T &amp;p)']]],
+  ['operator_25_3d_10',['operator%=',['../db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2',1,'uint128_t::operator%=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40',1,'uint128_t::operator%=(const T &amp;p)'],['../d1/d83/classuint256__t.html#a2cd43a4a92dc825a010a17578b3bdedb',1,'uint256_t::operator%=(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#a76914bc727eab927a3941ef71275327d',1,'uint256_t::operator%=(const T &amp;p)']]],
+  ['operator_26_11',['operator&amp;',['../db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244',1,'uint128_t::operator&amp;(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4',1,'uint128_t::operator&amp;(const T p)'],['../d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8',1,'uint256_t::operator&amp;(const T &amp;p)'],['../d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839',1,'uint256_t::operator&amp;(const uint256_t &amp;p)']]],
+  ['operator_26_26_12',['operator&amp;&amp;',['../db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1',1,'uint128_t::operator&amp;&amp;(const uint128_t &amp;b)'],['../db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a',1,'uint128_t::operator&amp;&amp;(const T b)'],['../d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963',1,'uint256_t::operator&amp;&amp;(const uint256_t &amp;b)'],['../d1/d83/classuint256__t.html#a303287d7bc8686dcb47fcb04720ad409',1,'uint256_t::operator&amp;&amp;(const T &amp;b)']]],
+  ['operator_26_3d_13',['operator&amp;=',['../db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050',1,'uint128_t::operator&amp;=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640',1,'uint128_t::operator&amp;=(const T p)'],['../d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d',1,'uint256_t::operator&amp;=(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#afa79020c27caea31236d04ecaa0e5ef5',1,'uint256_t::operator&amp;=(const T p)']]],
+  ['operator_28_29_14',['operator()',['../db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733',1,'uint128_t::operator()()'],['../d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b',1,'uint256_t::operator()()'],['../de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c',1,'Compare::operator()()']]],
+  ['operator_2a_15',['operator*',['../db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30',1,'uint128_t::operator*(const T p)'],['../db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860',1,'uint128_t::operator*(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616',1,'uint256_t::operator*(const T &amp;p)'],['../d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967',1,'uint256_t::operator*(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*(const Matrix&lt; Number &gt; &amp;other) const'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*(const Number other) const'],['../da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d',1,'Complex::operator*()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae2edd40354a1ca7aeaee3d1e3589e713',1,'operator*(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A, std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;B):&#160;ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a865e8d26a01962cc93aca66e71346f37',1,'operator*(std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;A, std::vector&lt; T &gt; const &amp;B):&#160;ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a207b3a99fd5974d3117e0b0ac0aad234',1,'operator*(float const scalar, std::vector&lt; T &gt; const &amp;A):&#160;ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a42535e20e97d85aa61271e0894cc0359',1,'operator*(std::vector&lt; T &gt; const &amp;A, float const scalar):&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a16f34574b7e0dd51bc3b3fda37446695',1,'machine_learning::operator*()']]],
+  ['operator_2a_3d_16',['operator*=',['../db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092',1,'uint128_t::operator*=(const T p)'],['../db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295',1,'uint128_t::operator*=(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028',1,'uint256_t::operator*=(const T &amp;p)'],['../d1/d83/classuint256__t.html#a4645040fe68ff01d83400f173fd2bb21',1,'uint256_t::operator*=(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12',1,'divide_and_conquer::strassens_multiplication::Matrix::operator*=()'],['../db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350',1,'large_number::operator*=()']]],
+  ['operator_2b_17',['operator+',['../db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d',1,'uint128_t::operator+(const T p)'],['../db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606',1,'uint128_t::operator+(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f',1,'uint256_t::operator+(const T &amp;p)'],['../d1/d83/classuint256__t.html#af18e2e3d7ed635c4056062bc906fef75',1,'uint256_t::operator+(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211',1,'divide_and_conquer::strassens_multiplication::Matrix::operator+()'],['../da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c',1,'Complex::operator+()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a01e6c7bf2b09272578b9c5819ce0f36f',1,'operator+():&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a2466857dab977a49f117029835b3b6d2',1,'machine_learning::operator+()']]],
+  ['operator_2b_2b_18',['operator++',['../db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e',1,'uint128_t::operator++()'],['../db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6',1,'uint128_t::operator++(int)'],['../d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9',1,'uint256_t::operator++()'],['../d1/d83/classuint256__t.html#a7bbe36e2ebd52df5efab118897b3050c',1,'uint256_t::operator++(int)'],['../db/d82/classlarge__number.html#a4757697b1f7584b69e779a72abc4ae2a',1,'large_number::operator++()'],['../db/d82/classlarge__number.html#a8d4364ee5a62964451d8cfee82649687',1,'large_number::operator++(int)']]],
+  ['operator_2b_3d_19',['operator+=',['../db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004',1,'uint128_t::operator+=(const T p)'],['../db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb',1,'uint128_t::operator+=(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1',1,'uint256_t::operator+=(const T &amp;p)'],['../d1/d83/classuint256__t.html#ac75a46fe3625caf10e07db1eb75a1d6e',1,'uint256_t::operator+=(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae190115f8d4d31e47d7290e0b6871391',1,'divide_and_conquer::strassens_multiplication::Matrix::operator+=()'],['../db/d82/classlarge__number.html#aab5644405094740e34983cedfecb36cf',1,'large_number::operator+=()']]],
+  ['operator_2d_20',['operator-',['../db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec',1,'uint128_t::operator-(const T &amp;p)'],['../db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c',1,'uint128_t::operator-(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3',1,'uint128_t::operator-()'],['../d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4',1,'uint256_t::operator-(const T &amp;p)'],['../d1/d83/classuint256__t.html#ab909ef62a0c85121e7d743c016fb723d',1,'uint256_t::operator-(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#a406c951a07d8173685dbe384c6ab6a06',1,'uint256_t::operator-()'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a678681c9f6266a8219bd6bee6972d70e',1,'divide_and_conquer::strassens_multiplication::Matrix::operator-()'],['../da/d5a/class_complex.html#a36739619a07b5478bcd8a28ad2f8b7da',1,'Complex::operator-()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4a6a560dbdd0177633783b72db37dc19',1,'operator-():&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a0cc29566568e0383dd7d374068cbe6b3',1,'machine_learning::operator-()']]],
+  ['operator_2d_2d_21',['operator--',['../db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed',1,'uint128_t::operator--()'],['../db/d9a/classuint128__t.html#a2ecb71686e1c9ed0267124580c91c414',1,'uint128_t::operator--(int p)'],['../d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183',1,'uint256_t::operator--()'],['../d1/d83/classuint256__t.html#a28d26847f9b19a4f86c187791cb0db13',1,'uint256_t::operator--(int p)']]],
+  ['operator_2d_3d_22',['operator-=',['../db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798',1,'uint128_t::operator-=(const T &amp;p)'],['../db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8',1,'uint128_t::operator-=(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7',1,'uint256_t::operator-=(const T p)'],['../d1/d83/classuint256__t.html#a5e84ed2a2f99cee81ede4a0107702a45',1,'uint256_t::operator-=(const uint256_t &amp;p)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a42c986fb57b74fe1b7c5953cb1922c3d',1,'divide_and_conquer::strassens_multiplication::Matrix::operator-=()']]],
+  ['operator_2f_23',['operator/',['../db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee',1,'uint128_t::operator/(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94',1,'uint128_t::operator/(const T p)'],['../d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6',1,'uint256_t::operator/(const T &amp;p)'],['../d1/d83/classuint256__t.html#a4fdeb4d4bf8cca4ee99b8487e59831df',1,'uint256_t::operator/(const uint256_t &amp;p)'],['../da/d5a/class_complex.html#ac38437c10eb798f176c384a695171b90',1,'Complex::operator/()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7a2d742b9a3ae7b85292e1f86428bb4f',1,'operator/():&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#ae6ec42318d172b97fbdf45638d09d7b5',1,'machine_learning::operator/()']]],
+  ['operator_2f_3d_24',['operator/=',['../db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db',1,'uint128_t::operator/=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b',1,'uint128_t::operator/=(const T p)'],['../d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4',1,'uint256_t::operator/=(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#abc793979ec70bb8e5cf177d83649a259',1,'uint256_t::operator/=(const T &amp;p)']]],
+  ['operator_3c_25',['operator&lt;',['../db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4',1,'uint128_t::operator&lt;(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc',1,'uint128_t::operator&lt;(const T other)'],['../d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96',1,'uint256_t::operator&lt;(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#ac6bdcf64653af8173987bf7217e99056',1,'uint256_t::operator&lt;(const T &amp;other)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a64815f10cf9fb9fdb4cc92731ccf10ba',1,'machine_learning::aystar_search::EightPuzzle::operator&lt;()']]],
+  ['operator_3c_3c_26',['operator&lt;&lt;',['../db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190',1,'uint128_t::operator&lt;&lt;()'],['../d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5',1,'uint256_t::operator&lt;&lt;()'],['../d7/db9/hill__cipher_8cpp.html#a34bfcd756610834acac501f9eea1e2eb',1,'operator&lt;&lt;(std::ostream &amp;out, matrix&lt; T &gt; const &amp;v):&#160;hill_cipher.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a7075a0fccad9b2d79be0275bfe8948d4',1,'operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; std::vector&lt; T &gt; &gt; const &amp;v):&#160;ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ab1ad727903d7817c2758d25bcb52cbc8',1,'operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; T &gt; const &amp;v):&#160;ordinary_least_squares_regressor.cpp'],['../d8/d77/namespacemachine__learning.html#a84260cb1be9b63d6e38107000ac4b7e7',1,'machine_learning::operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; std::valarray&lt; T &gt; &gt; const &amp;A)'],['../d8/d77/namespacemachine__learning.html#af4986b23760039711848155739c31b35',1,'machine_learning::operator&lt;&lt;(std::ostream &amp;out, const std::pair&lt; T, T &gt; &amp;A)'],['../d8/d77/namespacemachine__learning.html#a54bf1f3c43271a5fc93101f6ae2e6269',1,'machine_learning::operator&lt;&lt;(std::ostream &amp;out, const std::valarray&lt; T &gt; &amp;A)'],['../d5/d67/complex__numbers_8cpp.html#a44d5f25b573e870accdf26fd32b8484d',1,'operator&lt;&lt;(std::ostream &amp;os, const Complex &amp;num):&#160;complex_numbers.cpp'],['../dd/d65/lu__decompose_8cpp.html#a575c989afcc78e875031cd4273e62a3e',1,'operator&lt;&lt;(std::ostream &amp;out, matrix&lt; T &gt; const &amp;v):&#160;lu_decompose.cpp'],['../d2/d3b/namespaceqr__algorithm.html#adfbdf47277c8cfee229b05b72f1f7834',1,'qr_algorithm::operator&lt;&lt;(std::ostream &amp;out, std::valarray&lt; std::valarray&lt; T &gt; &gt; const &amp;v)'],['../d2/d3b/namespaceqr__algorithm.html#a257425cb2365359da51c6fe6741834d8',1,'qr_algorithm::operator&lt;&lt;(std::ostream &amp;out, std::valarray&lt; T &gt; const &amp;v)']]],
+  ['operator_3c_3c_3d_27',['operator&lt;&lt;=',['../db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a',1,'uint128_t::operator&lt;&lt;=()'],['../d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5',1,'uint256_t::operator&lt;&lt;=()']]],
+  ['operator_3c_3d_28',['operator&lt;=',['../db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a',1,'uint128_t::operator&lt;=(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c',1,'uint128_t::operator&lt;=(const T other)'],['../d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88',1,'uint256_t::operator&lt;=(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#a2029e9777f999bffef6004429b4f19f2',1,'uint256_t::operator&lt;=(const T &amp;other)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#af778034b2942ecac6df1e9ec8b5412ee',1,'machine_learning::aystar_search::EightPuzzle::operator&lt;=()']]],
+  ['operator_3d_29',['operator=',['../db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544',1,'uint128_t::operator=(const T &amp;p)'],['../db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74',1,'uint128_t::operator=(const std::string &amp;p)'],['../db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5',1,'uint128_t::operator=(const uint128_t &amp;p)=default'],['../db/d9a/classuint128__t.html#a3c4a7e775a0820196fc08303bbeed44a',1,'uint128_t::operator=(uint128_t &amp;&amp;p)=default'],['../d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc',1,'uint256_t::operator=(const uint256_t &amp;p)=default'],['../d1/d83/classuint256__t.html#addff5645f6005e7b50a6ad0731e4f19c',1,'uint256_t::operator=(const T &amp;p)'],['../d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2',1,'uint256_t::operator=(const std::string &amp;p)'],['../d1/d83/classuint256__t.html#a6c5e025f901f6af4b748f98013350638',1,'uint256_t::operator=(uint256_t &amp;&amp;p)=default'],['../d1/def/classdata__structures_1_1linked__list_1_1list.html#adb04f732911fcfd30f7177b367c6af41',1,'data_structures::linked_list::list::operator=()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a467e722dc1fcc82bfb4cef55744e04e2',1,'machine_learning::aystar_search::EightPuzzle::operator=(const EightPuzzle &amp;A)'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101',1,'machine_learning::aystar_search::EightPuzzle::operator=(EightPuzzle &amp;&amp;A) noexcept'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ac77d992953fa0de10a755e5a9aa06317',1,'machine_learning::aystar_search::AyStarSearch::Info::operator=(const Info &amp;A)'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#ad3993dbca9c5b3ef9ac361dc7f62ce57',1,'machine_learning::aystar_search::AyStarSearch::Info::operator=(Info &amp;&amp;A) noexcept'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#a080f5b1742832a03c1cbba596a48bd1a',1,'machine_learning::k_nearest_neighbors::Knn::operator=(const Knn &amp;model)=default'],['../da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html#ac06986d5afddc767ddba4da738f75563',1,'machine_learning::k_nearest_neighbors::Knn::operator=(Knn &amp;&amp;)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#ae077132526d2863e46aa77cb0f7d6aa2',1,'machine_learning::neural_network::layers::DenseLayer::operator=(const DenseLayer &amp;layer)=default'],['../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a19aaccad279b22dbbb6c55e5697b4114',1,'machine_learning::neural_network::layers::DenseLayer::operator=(DenseLayer &amp;&amp;)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a58a9614e4c6d4ca672d3358e99a3404f',1,'machine_learning::neural_network::NeuralNetwork::operator=(const NeuralNetwork &amp;model)=default'],['../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2c49bfebf9b859d5ceb26035d3003601',1,'machine_learning::neural_network::NeuralNetwork::operator=(NeuralNetwork &amp;&amp;)=default'],['../da/d5a/class_complex.html#a4ac9f529d54cacf2969f2c7179b4c4ac',1,'Complex::operator=()'],['../db/d82/classlarge__number.html#ab84f29685709cbb3b6fd29b7b4a7bc7b',1,'large_number::operator=()'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a9cc37166f2f73763df39894b675f89c9',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=(const CircularLinkedList &amp;other)'],['../d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a8f26dc32615abc5bab8ac458ef424bc5',1,'operations_on_datastructures::circular_linked_list::CircularLinkedList::operator=(CircularLinkedList &amp;&amp;other) noexcept']]],
+  ['operator_3d_3d_30',['operator==',['../d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446',1,'ciphers::elliptic_curve_key_exchange::Point::operator==()'],['../db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e',1,'uint128_t::operator==(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896',1,'uint128_t::operator==(const T other)'],['../d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261',1,'uint256_t::operator==(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484',1,'uint256_t::operator==(const T &amp;other)'],['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c',1,'divide_and_conquer::strassens_multiplication::Matrix::operator==()'],['../dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#aa17e0227321b109ed91e156ac1332915',1,'machine_learning::aystar_search::EightPuzzle::operator==()'],['../d5/d67/complex__numbers_8cpp.html#a5a73e9d4e68af8cedb95bd0864054b89',1,'operator==():&#160;complex_numbers.cpp']]],
+  ['operator_3e_31',['operator&gt;',['../db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440',1,'uint128_t::operator&gt;(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e',1,'uint128_t::operator&gt;(const T other)'],['../d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d',1,'uint256_t::operator&gt;(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#ad74d33215517459c2b33ace7a9c6bc13',1,'uint256_t::operator&gt;(const T &amp;other)']]],
+  ['operator_3e_3d_32',['operator&gt;=',['../db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292',1,'uint128_t::operator&gt;=(const uint128_t &amp;other)'],['../db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481',1,'uint128_t::operator&gt;=(const T other)'],['../d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad',1,'uint256_t::operator&gt;=(const uint256_t &amp;other)'],['../d1/d83/classuint256__t.html#aff4d49cf84de64301b169ad974f00bad',1,'uint256_t::operator&gt;=(const T &amp;other)']]],
+  ['operator_3e_3e_33',['operator&gt;&gt;',['../db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848',1,'uint128_t::operator&gt;&gt;()'],['../d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51',1,'uint256_t::operator&gt;&gt;()']]],
+  ['operator_3e_3e_3d_34',['operator&gt;&gt;=',['../db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9',1,'uint128_t::operator&gt;&gt;=()'],['../d1/d83/classuint256__t.html#ad9ce2370b1497efbcc426793048e1f78',1,'uint256_t::operator&gt;&gt;=()']]],
+  ['operator_5b_5d_35',['operator[]',['../dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ac4c64e5723fa12a043fd0a7f5ed5bb37',1,'divide_and_conquer::strassens_multiplication::Matrix::operator[]()'],['../db/d82/classlarge__number.html#a8c381aa1ecc960cefd82ec72f59e0e08',1,'large_number::operator[]()']]],
+  ['operator_5e_36',['operator^',['../db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37',1,'uint128_t::operator^(const T p)'],['../db/d9a/classuint128__t.html#a9487ed06019d846add5dc8874e41eb8b',1,'uint128_t::operator^(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e',1,'uint256_t::operator^(const T &amp;p)'],['../d1/d83/classuint256__t.html#a74d1e1dd8cd2b31e00813ed939943be7',1,'uint256_t::operator^(const uint256_t &amp;p)']]],
+  ['operator_5e_3d_37',['operator^=',['../db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a',1,'uint128_t::operator^=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67',1,'uint128_t::operator^=(const T &amp;p)'],['../d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7',1,'uint256_t::operator^=(const uint256_t &amp;p)'],['../d1/d83/classuint256__t.html#a3dc4d3ab175f5f2a3172eb8d99a60fc3',1,'uint256_t::operator^=(const T &amp;p)']]],
+  ['operator_7c_38',['operator|',['../db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304',1,'uint128_t::operator|(const T p)'],['../db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd',1,'uint128_t::operator|(const uint128_t &amp;p)'],['../d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf',1,'uint256_t::operator|(const T &amp;p)'],['../d1/d83/classuint256__t.html#a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2',1,'uint256_t::operator|(const uint256_t &amp;p)']]],
+  ['operator_7c_3d_39',['operator|=',['../db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d',1,'uint128_t::operator|=(const uint128_t &amp;p)'],['../db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee',1,'uint128_t::operator|=(const T p)'],['../d1/d83/classuint256__t.html#af0a6e09fcf1cbf234ed32df6d7265a0b',1,'uint256_t::operator|=(const T &amp;p)'],['../d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc',1,'uint256_t::operator|=(const uint256_t &amp;p)']]],
+  ['operator_7c_7c_40',['operator||',['../db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03',1,'uint128_t::operator||(const uint128_t &amp;b)'],['../db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503',1,'uint128_t::operator||(const T b)'],['../d1/d83/classuint256__t.html#a41f4bb928c4ee067732503395b65f9d7',1,'uint256_t::operator||(const uint256_t &amp;b)'],['../d1/d83/classuint256__t.html#a4886747ffff15cdeb6bc93712629f9e7',1,'uint256_t::operator||(const T &amp;b)']]],
+  ['operator_7e_41',['operator~',['../db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f',1,'uint128_t::operator~()'],['../d1/d83/classuint256__t.html#a6eec1f632aebfc44fee8a74c395e10c2',1,'uint256_t::operator~()'],['../da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d',1,'Complex::operator~()']]],
+  ['orientation_42',['orientation',['../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html#a54df5f9a8f37170bd97c91127664655c',1,'geometry::jarvis::Convexhull']]],
+  ['otherhashfxn_43',['otherHashFxn',['../d0/d65/namespacedouble__hashing.html#a33968a1178289ab61445dd4000df7082',1,'double_hashing']]]
 ];
diff --git a/search/namespaces_12.js b/search/namespaces_12.js
index 145688c48..bb5e1825e 100644
--- a/search/namespaces_12.js
+++ b/search/namespaces_12.js
@@ -13,21 +13,15 @@ var searchData=
   ['spirograph_10',['spirograph',['../da/dd3/namespacespirograph.html',1,'']]],
   ['stack_5fusing_5fqueue_11',['stack_using_queue',['../df/d1c/namespacestack__using__queue.html',1,'']]],
   ['statistics_12',['statistics',['../d2/dcf/namespacestatistics.html',1,'']]],
-  ['std_13',['std',['../d8/dcc/namespacestd.html',1,'']]],
-  ['std_3a_3achrono_14',['chrono',['http://en.cppreference.com/w/d4/d0c/namespacestd_1_1chrono.html',0,'std']]],
-  ['std_3a_3aexperimental_15',['experimental',['http://en.cppreference.com/w/de/d97/namespacestd_1_1experimental.html',0,'std']]],
-  ['std_3a_3aregex_5fconstants_16',['regex_constants',['http://en.cppreference.com/w/db/da4/namespacestd_1_1regex__constants.html',0,'std']]],
-  ['std_3a_3arel_5fops_17',['rel_ops',['http://en.cppreference.com/w/da/d42/namespacestd_1_1rel__ops.html',0,'std']]],
-  ['std_3a_3athis_5fthread_18',['this_thread',['http://en.cppreference.com/w/d7/dbf/namespacestd_1_1this__thread.html',0,'std']]],
-  ['strand_19',['strand',['../d8/d1d/namespacestrand.html',1,'']]],
-  ['strassens_5fmultiplication_20',['strassens_multiplication',['../d3/d91/namespacestrassens__multiplication.html',1,'']]],
-  ['string_21',['string',['../d6/dd6/namespacestring.html',1,'']]],
-  ['string_5fsearch_22',['string_search',['../d9/d03/namespacestring__search.html',1,'']]],
-  ['strings_23',['strings',['../df/dcb/namespacestrings.html',1,'']]],
-  ['strings_3a_3aboyer_5fmoore_24',['boyer_moore',['../d0/dbc/namespacestrings_1_1boyer__moore.html',1,'strings']]],
-  ['subarray_5fsum_25',['subarray_sum',['../df/d74/namespacesubarray__sum.html',1,'']]],
-  ['sublist_5fsearch_26',['sublist_search',['../d9/def/namespacesublist__search.html',1,'']]],
-  ['subset_5fsum_27',['subset_sum',['../dc/d3a/namespacesubset__sum.html',1,'']]],
-  ['subsets_28',['Subsets',['../de/d95/namespace_subsets.html',1,'']]],
-  ['sudoku_5fsolver_29',['sudoku_solver',['../d8/d9f/namespacesudoku__solver.html',1,'']]]
+  ['strand_13',['strand',['../d8/d1d/namespacestrand.html',1,'']]],
+  ['strassens_5fmultiplication_14',['strassens_multiplication',['../d3/d91/namespacestrassens__multiplication.html',1,'']]],
+  ['string_15',['string',['../d6/dd6/namespacestring.html',1,'']]],
+  ['string_5fsearch_16',['string_search',['../d9/d03/namespacestring__search.html',1,'']]],
+  ['strings_17',['strings',['../df/dcb/namespacestrings.html',1,'']]],
+  ['strings_3a_3aboyer_5fmoore_18',['boyer_moore',['../d0/dbc/namespacestrings_1_1boyer__moore.html',1,'strings']]],
+  ['subarray_5fsum_19',['subarray_sum',['../df/d74/namespacesubarray__sum.html',1,'']]],
+  ['sublist_5fsearch_20',['sublist_search',['../d9/def/namespacesublist__search.html',1,'']]],
+  ['subset_5fsum_21',['subset_sum',['../dc/d3a/namespacesubset__sum.html',1,'']]],
+  ['subsets_22',['Subsets',['../de/d95/namespace_subsets.html',1,'']]],
+  ['sudoku_5fsolver_23',['sudoku_solver',['../d8/d9f/namespacesudoku__solver.html',1,'']]]
 ];
diff --git a/search/search.css b/search/search.css
index 19f76f9d5..d7b0f90b7 100644
--- a/search/search.css
+++ b/search/search.css
@@ -25,9 +25,9 @@ dark-mode-toggle {
 #MSearchBox {
     display: inline-block;
     white-space : nowrap;
-    background: var(--search-background-color);
+    background: white;
     border-radius: 0.65em;
-    box-shadow: var(--search-box-shadow);
+    box-shadow: inset 0.5px 0.5px 3px 0px #555;
     z-index: 102;
 }
 
@@ -42,7 +42,7 @@ dark-mode-toggle {
     vertical-align: middle;
     width: 20px;
     height: 19px;
-    background-image: var(--search-magnification-select-image);
+    background-image: url('mag_sel.svg');
     margin: 0 0 0 0.3em;
     padding: 0;
 }
@@ -52,7 +52,7 @@ dark-mode-toggle {
     vertical-align: middle;
     width: 10px;
     height: 19px;
-    background-image: var(--search-magnification-image);
+    background-image: url('mag.svg');
     margin: 0 0 0 0.5em;
     padding: 0;
 }
@@ -67,9 +67,9 @@ dark-mode-toggle {
     padding: 0;
     line-height: 1em;
     border:none;
-    color: var(--search-foreground-color);
+    color: #909090;
     outline: none;
-    font-family: var(--font-family-search);
+    font-family: Arial,Verdana,sans-serif;
     -webkit-border-radius: 0px;
     border-radius: 0px;
     background: none;
@@ -106,7 +106,7 @@ dark-mode-toggle {
 }
 
 .MSearchBoxActive #MSearchField {
-    color: var(--search-active-color);
+    color: black;
 }
 
 
@@ -117,8 +117,8 @@ dark-mode-toggle {
     display: none;
     position: absolute;
     left: 0; top: 0;
-    border: 1px solid var(--search-filter-border-color);
-    background-color: var(--search-filter-background-color);
+    border: 1px solid #90A5CE;
+    background-color: #F9FAFC;
     z-index: 10001;
     padding-top: 4px;
     padding-bottom: 4px;
@@ -131,7 +131,7 @@ dark-mode-toggle {
 }
 
 .SelectItem {
-    font: 8pt var(--font-family-search);
+    font: 8pt Arial,Verdana,sans-serif;
     padding-left:  2px;
     padding-right: 12px;
     border: 0px;
@@ -139,7 +139,7 @@ dark-mode-toggle {
 
 span.SelectionMark {
     margin-right: 4px;
-    font-family: var(--font-family-monospace);
+    font-family: 'JetBrains Mono',Consolas,Monaco,'Andale Mono','Ubuntu Mono',monospace,fixed;
     outline-style: none;
     text-decoration: none;
 }
@@ -147,7 +147,7 @@ span.SelectionMark {
 a.SelectItem {
     display: block;
     outline-style: none;
-    color: var(--search-filter-foreground-color);
+    color: black;
     text-decoration: none;
     padding-left:   6px;
     padding-right: 12px;
@@ -155,14 +155,14 @@ a.SelectItem {
 
 a.SelectItem:focus,
 a.SelectItem:active {
-    color: var(--search-filter-foreground-color);
+    color: black;
     outline-style: none;
     text-decoration: none;
 }
 
 a.SelectItem:hover {
-    color: var(--search-filter-highlight-text-color);
-    background-color: var(--search-filter-highlight-bg-color);
+    color: white;
+    background-color: #3D578C;
     outline-style: none;
     text-decoration: none;
     cursor: pointer;
@@ -180,8 +180,8 @@ iframe#MSearchResults {
     display: none;
     position: absolute;
     left: 0; top: 0;
-    border: 1px solid var(--search-results-border-color);
-    background-color: var(--search-results-background-color);
+    border: 1px solid black;
+    background-color: #EEF1F7;
     z-index:10000;
     width: 300px;
     height: 400px;
@@ -207,7 +207,7 @@ iframe#MSearchResults {
 
 div.SRPage {
     margin: 5px 2px;
-    background-color: var(--search-results-background-color);
+    background-color: #EEF1F7;
 }
 
 .SRChildren {
@@ -220,16 +220,16 @@ div.SRPage {
 
 .SRSymbol {
     font-weight: bold;
-    color: var(--search-results-foreground-color);
-    font-family: var(--font-family-search);
+    color: #425E97;
+    font-family: Arial,Verdana,sans-serif;
     text-decoration: none;
     outline: none;
 }
 
 a.SRScope {
     display: block;
-    color: var(--search-results-foreground-color);
-    font-family: var(--font-family-search);
+    color: #425E97;
+    font-family: Arial,Verdana,sans-serif;
     font-size: 8pt;
     text-decoration: none;
     outline: none;
@@ -242,14 +242,14 @@ a.SRScope:focus, a.SRScope:active {
 
 span.SRScope {
     padding-left: 4px;
-    font-family: var(--font-family-search);
+    font-family: Arial,Verdana,sans-serif;
 }
 
 .SRPage .SRStatus {
     padding: 2px 5px;
     font-size: 8pt;
     font-style: italic;
-    font-family: var(--font-family-search);
+    font-family: Arial,Verdana,sans-serif;
 }
 
 .SRResult {
@@ -266,7 +266,7 @@ div.searchresults {
 .pages b {
    color: white;
    padding: 5px 5px 3px 5px;
-   background-image: var(--nav-gradient-active-image-parent);
+   background-image: url("../tab_a.png");
    background-repeat: repeat-x;
    text-shadow: 0 1px 1px #000000;
 }
diff --git a/search/searchdata.js b/search/searchdata.js
index a5d7736c5..6f52ec9bb 100644
--- a/search/searchdata.js
+++ b/search/searchdata.js
@@ -1,10 +1,10 @@
 var indexSectionsWithContent =
 {
   0: "01234_abcdefghijklmnopqrstuvwxyz~",
-  1: "abcdefghijklmnopqrstuvwyz",
+  1: "abcdefghiklmnpqrstuw",
   2: "abcdefghijklmnopqrstuvwx",
   3: "0abcdefghijklmnopqrstuvwxz",
-  4: "_abcdefghijklmnopqrstuvwxyz~",
+  4: "_abcdefghijklmnopqrstuvwz~",
   5: "_abcdefghiklmnpqrstuvwxy",
   6: "ilmnp",
   7: "o",
diff --git a/search/variables_4.js b/search/variables_4.js
index 5fd8049bc..d5e82da4c 100644
--- a/search/variables_4.js
+++ b/search/variables_4.js
@@ -3,6 +3,5 @@ var searchData=
   ['data_0',['data',['../d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73',1,'data_structures::Bitset::data'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1',1,'operations_on_datastructures::circular_linked_list::Node::data'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2',1,'operations_on_datastructures::inorder_traversal_of_bst::Node::data'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f',1,'operations_on_datastructures::reverse_binary_tree::Node::data'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f',1,'others::iterative_tree_traversals::Node::data'],['../de/d21/classothers_1_1_cache_1_1_d___node.html#a8902e7ff872fa3c80fe6ce5f5cf5cc75',1,'others::Cache::D_Node::data'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade',1,'others::recursive_tree_traversals::Node::data'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b',1,'search::sublist_search::Node::data'],['../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243',1,'data:&#160;hash_search.cpp']]],
   ['day_1',['day',['../d1/df6/class_easter_year_month_day.html#ade0b934e5b1af24e19ff959673b2ec51',1,'EasterYearMonthDay']]],
   ['depth_2',['depth',['../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429',1,'dsu::depth'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d',1,'machine_learning::aystar_search::AyStarSearch::Info::depth']]],
-  ['dist_3',['dist',['../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a',1,'graph::HKGraph']]],
-  ['dptable_4',['dpTable',['../dc/d14/wildcard__matching_8cpp.html#a4a5b107f93db24e424b12899fa692c5a',1,'backtracking::wildcard_matching']]]
+  ['dist_3',['dist',['../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a',1,'graph::HKGraph']]]
 ];
diff --git a/tabs.css b/tabs.css
index 7fa4268a4..edbb42414 100644
--- a/tabs.css
+++ b/tabs.css
@@ -1 +1 @@
-.sm{position:relative;z-index:9999}.sm,.sm ul,.sm li{display:block;list-style:none;margin:0;padding:0;line-height:normal;direction:ltr;text-align:left;-webkit-tap-highlight-color:rgba(0,0,0,0)}.sm-rtl,.sm-rtl ul,.sm-rtl li{direction:rtl;text-align:right}.sm>li>h1,.sm>li>h2,.sm>li>h3,.sm>li>h4,.sm>li>h5,.sm>li>h6{margin:0;padding:0}.sm ul{display:none}.sm li,.sm a{position:relative}.sm a{display:block}.sm a.disabled{cursor:not-allowed}.sm:after{content:"\00a0";display:block;height:0;font:0/0 serif;clear:both;visibility:hidden;overflow:hidden}.sm,.sm *,.sm *:before,.sm *:after{-moz-box-sizing:border-box;-webkit-box-sizing:border-box;box-sizing:border-box}.main-menu-btn{position:relative;display:inline-block;width:36px;height:36px;text-indent:36px;margin-left:8px;white-space:nowrap;overflow:hidden;cursor:pointer;-webkit-tap-highlight-color:rgba(0,0,0,0)}.main-menu-btn-icon,.main-menu-btn-icon:before,.main-menu-btn-icon:after{position:absolute;top:50%;left:2px;height:2px;width:24px;background:var(--nav-menu-button-color);-webkit-transition:all .25s;transition:all .25s}.main-menu-btn-icon:before{content:'';top:-7px;left:0}.main-menu-btn-icon:after{content:'';top:7px;left:0}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon{height:0}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon:before{top:0;-webkit-transform:rotate(-45deg);transform:rotate(-45deg)}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon:after{top:0;-webkit-transform:rotate(45deg);transform:rotate(45deg)}#main-menu-state{position:absolute;width:1px;height:1px;margin:-1px;border:0;padding:0;overflow:hidden;clip:rect(1px,1px,1px,1px)}#main-menu-state:not(:checked) ~ #main-menu{display:none}#main-menu-state:checked ~ #main-menu{display:block}@media(min-width:768px){.main-menu-btn{position:absolute;top:-99999px}#main-menu-state:not(:checked) ~ #main-menu{display:block}}.sm-dox{background-image:var(--nav-gradient-image)}.sm-dox a,.sm-dox a:focus,.sm-dox a:hover,.sm-dox a:active{padding:0 12px;padding-right:43px;font-family:var(--font-family-nav);font-size:13px;font-weight:bold;line-height:36px;text-decoration:none;text-shadow:var(--nav-text-normal-shadow);color:var(--nav-text-normal-color);outline:0}.sm-dox a:hover{background-image:var(--nav-gradient-active-image);background-repeat:repeat-x;color:var(--nav-text-hover-color);text-shadow:var(--nav-text-hover-shadow)}.sm-dox a.current{color:#d23600}.sm-dox a.disabled{color:#bbb}.sm-dox a span.sub-arrow{position:absolute;top:50%;margin-top:-14px;left:auto;right:3px;width:28px;height:28px;overflow:hidden;font:bold 12px/28px monospace !important;text-align:center;text-shadow:none;background:var(--nav-menu-toggle-color);-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox a span.sub-arrow:before{display:block;content:'+'}.sm-dox a.highlighted span.sub-arrow:before{display:block;content:'-'}.sm-dox>li:first-child>a,.sm-dox>li:first-child>:not(ul) a{-moz-border-radius:5px 5px 0 0;-webkit-border-radius:5px;border-radius:5px 5px 0 0}.sm-dox>li:last-child>a,.sm-dox>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul{-moz-border-radius:0 0 5px 5px;-webkit-border-radius:0;border-radius:0 0 5px 5px}.sm-dox>li:last-child>a.highlighted,.sm-dox>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted{-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox ul{background:var(--nav-menu-background-color)}.sm-dox ul a,.sm-dox ul a:focus,.sm-dox ul a:hover,.sm-dox ul a:active{font-size:12px;border-left:8px solid transparent;line-height:36px;text-shadow:none;background-color:var(--nav-menu-background-color);background-image:none}.sm-dox ul a:hover{background-image:var(--nav-gradient-active-image);background-repeat:repeat-x;color:var(--nav-text-hover-color);text-shadow:0 1px 1px black}.sm-dox ul ul a,.sm-dox ul ul a:hover,.sm-dox ul ul a:focus,.sm-dox ul ul a:active{border-left:16px solid transparent}.sm-dox ul ul ul a,.sm-dox ul ul ul a:hover,.sm-dox ul ul ul a:focus,.sm-dox ul ul ul a:active{border-left:24px solid transparent}.sm-dox ul ul ul ul a,.sm-dox ul ul ul ul a:hover,.sm-dox ul ul ul ul a:focus,.sm-dox ul ul ul ul a:active{border-left:32px solid transparent}.sm-dox ul ul ul ul ul a,.sm-dox ul ul ul ul ul a:hover,.sm-dox ul ul ul ul ul a:focus,.sm-dox ul ul ul ul ul a:active{border-left:40px solid transparent}@media(min-width:768px){.sm-dox ul{position:absolute;width:12em}.sm-dox li{float:left}.sm-dox.sm-rtl li{float:right}.sm-dox ul li,.sm-dox.sm-rtl ul li,.sm-dox.sm-vertical li{float:none}.sm-dox a{white-space:nowrap}.sm-dox ul a,.sm-dox.sm-vertical a{white-space:normal}.sm-dox .sm-nowrap>li>a,.sm-dox .sm-nowrap>li>:not(ul) a{white-space:nowrap}.sm-dox{padding:0 10px;background-image:var(--nav-gradient-image);line-height:36px}.sm-dox a span.sub-arrow{top:50%;margin-top:-2px;right:12px;width:0;height:0;border-width:4px;border-style:solid dashed dashed dashed;border-color:var(--nav-text-normal-color) transparent transparent transparent;background:transparent;-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox a,.sm-dox a:focus,.sm-dox a:active,.sm-dox a:hover,.sm-dox a.highlighted{padding:0 12px;background-image:var(--nav-separator-image);background-repeat:no-repeat;background-position:right;-moz-border-radius:0 !important;-webkit-border-radius:0;border-radius:0 !important}.sm-dox a:hover{background-image:var(--nav-gradient-active-image);background-repeat:repeat-x;color:var(--nav-text-hover-color);text-shadow:var(--nav-text-hover-shadow)}.sm-dox a:hover span.sub-arrow{border-color:var(--nav-text-hover-color) transparent transparent transparent}.sm-dox a.has-submenu{padding-right:24px}.sm-dox li{border-top:0}.sm-dox>li>ul:before,.sm-dox>li>ul:after{content:'';position:absolute;top:-18px;left:30px;width:0;height:0;overflow:hidden;border-width:9px;border-style:dashed dashed solid dashed;border-color:transparent transparent #bbb transparent}.sm-dox>li>ul:after{top:-16px;left:31px;border-width:8px;border-color:transparent transparent var(--nav-menu-background-color) transparent}.sm-dox ul{border:1px solid #bbb;padding:5px 0;background:var(--nav-menu-background-color);-moz-border-radius:5px !important;-webkit-border-radius:5px;border-radius:5px !important;-moz-box-shadow:0 5px 9px rgba(0,0,0,0.2);-webkit-box-shadow:0 5px 9px rgba(0,0,0,0.2);box-shadow:0 5px 9px rgba(0,0,0,0.2)}.sm-dox ul a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-color:transparent transparent transparent var(--nav-menu-foreground-color);border-style:dashed dashed dashed solid}.sm-dox ul a,.sm-dox ul a:hover,.sm-dox ul a:focus,.sm-dox ul a:active,.sm-dox ul a.highlighted{color:var(--nav-menu-foreground-color);background-image:none;border:0 !important}.sm-dox ul a:hover{background-image:var(--nav-gradient-active-image);background-repeat:repeat-x;color:var(--nav-text-hover-color);text-shadow:var(--nav-text-hover-shadow)}.sm-dox ul a:hover span.sub-arrow{border-color:transparent transparent transparent var(--nav-text-hover-color)}.sm-dox span.scroll-up,.sm-dox span.scroll-down{position:absolute;display:none;visibility:hidden;overflow:hidden;background:var(--nav-menu-background-color);height:36px}.sm-dox span.scroll-up:hover,.sm-dox span.scroll-down:hover{background:#eee}.sm-dox span.scroll-up:hover span.scroll-up-arrow,.sm-dox span.scroll-up:hover span.scroll-down-arrow{border-color:transparent transparent #d23600 transparent}.sm-dox span.scroll-down:hover span.scroll-down-arrow{border-color:#d23600 transparent transparent transparent}.sm-dox span.scroll-up-arrow,.sm-dox span.scroll-down-arrow{position:absolute;top:0;left:50%;margin-left:-6px;width:0;height:0;overflow:hidden;border-width:6px;border-style:dashed dashed solid dashed;border-color:transparent transparent var(--nav-menu-foreground-color) transparent}.sm-dox span.scroll-down-arrow{top:8px;border-style:solid dashed dashed dashed;border-color:var(--nav-menu-foreground-color) transparent transparent transparent}.sm-dox.sm-rtl a.has-submenu{padding-right:12px;padding-left:24px}.sm-dox.sm-rtl a span.sub-arrow{right:auto;left:12px}.sm-dox.sm-rtl.sm-vertical a.has-submenu{padding:10px 20px}.sm-dox.sm-rtl.sm-vertical a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-rtl>li>ul:before{left:auto;right:30px}.sm-dox.sm-rtl>li>ul:after{left:auto;right:31px}.sm-dox.sm-rtl ul a.has-submenu{padding:10px 20px !important}.sm-dox.sm-rtl ul a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-vertical{padding:10px 0;-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox.sm-vertical a{padding:10px 20px}.sm-dox.sm-vertical a:hover,.sm-dox.sm-vertical a:focus,.sm-dox.sm-vertical a:active,.sm-dox.sm-vertical a.highlighted{background:#fff}.sm-dox.sm-vertical a.disabled{background-image:var(--nav-gradient-image)}.sm-dox.sm-vertical a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-style:dashed dashed dashed solid;border-color:transparent transparent transparent #555}.sm-dox.sm-vertical>li>ul:before,.sm-dox.sm-vertical>li>ul:after{display:none}.sm-dox.sm-vertical ul a{padding:10px 20px}.sm-dox.sm-vertical ul a:hover,.sm-dox.sm-vertical ul a:focus,.sm-dox.sm-vertical ul a:active,.sm-dox.sm-vertical ul a.highlighted{background:#eee}.sm-dox.sm-vertical ul a.disabled{background:var(--nav-menu-background-color)}}
+.sm{position:relative;z-index:9999}.sm,.sm ul,.sm li{display:block;list-style:none;margin:0;padding:0;line-height:normal;direction:ltr;text-align:left;-webkit-tap-highlight-color:rgba(0,0,0,0)}.sm-rtl,.sm-rtl ul,.sm-rtl li{direction:rtl;text-align:right}.sm>li>h1,.sm>li>h2,.sm>li>h3,.sm>li>h4,.sm>li>h5,.sm>li>h6{margin:0;padding:0}.sm ul{display:none}.sm li,.sm a{position:relative}.sm a{display:block}.sm a.disabled{cursor:not-allowed}.sm:after{content:"\00a0";display:block;height:0;font:0/0 serif;clear:both;visibility:hidden;overflow:hidden}.sm,.sm *,.sm *:before,.sm *:after{-moz-box-sizing:border-box;-webkit-box-sizing:border-box;box-sizing:border-box}.main-menu-btn{position:relative;display:inline-block;width:36px;height:36px;text-indent:36px;margin-left:8px;white-space:nowrap;overflow:hidden;cursor:pointer;-webkit-tap-highlight-color:rgba(0,0,0,0)}.main-menu-btn-icon,.main-menu-btn-icon:before,.main-menu-btn-icon:after{position:absolute;top:50%;left:2px;height:2px;width:24px;background:#364D7C;-webkit-transition:all .25s;transition:all .25s}.main-menu-btn-icon:before{content:'';top:-7px;left:0}.main-menu-btn-icon:after{content:'';top:7px;left:0}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon{height:0}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon:before{top:0;-webkit-transform:rotate(-45deg);transform:rotate(-45deg)}#main-menu-state:checked ~ .main-menu-btn .main-menu-btn-icon:after{top:0;-webkit-transform:rotate(45deg);transform:rotate(45deg)}#main-menu-state{position:absolute;width:1px;height:1px;margin:-1px;border:0;padding:0;overflow:hidden;clip:rect(1px,1px,1px,1px)}#main-menu-state:not(:checked) ~ #main-menu{display:none}#main-menu-state:checked ~ #main-menu{display:block}@media(min-width:768px){.main-menu-btn{position:absolute;top:-99999px}#main-menu-state:not(:checked) ~ #main-menu{display:block}}.sm-dox{background-image:url('tab_b.png')}.sm-dox a,.sm-dox a:focus,.sm-dox a:hover,.sm-dox a:active{padding:0 12px;padding-right:43px;font-family:'Lucida Grande',Geneva,Helvetica,Arial,sans-serif;font-size:13px;font-weight:bold;line-height:36px;text-decoration:none;text-shadow:0px 1px 1px rgba(255, 255, 255, 0.9);color:#283A5D;outline:0}.sm-dox a:hover{background-image:url('tab_a.png');background-repeat:repeat-x;color:white;text-shadow:0px 1px 1px rgba(0, 0, 0, 1.0)}.sm-dox a.current{color:#d23600}.sm-dox a.disabled{color:#bbb}.sm-dox a span.sub-arrow{position:absolute;top:50%;margin-top:-14px;left:auto;right:3px;width:28px;height:28px;overflow:hidden;font:bold 12px/28px monospace !important;text-align:center;text-shadow:none;background:rgba(255, 255, 255, 0.5);-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox a span.sub-arrow:before{display:block;content:'+'}.sm-dox a.highlighted span.sub-arrow:before{display:block;content:'-'}.sm-dox>li:first-child>a,.sm-dox>li:first-child>:not(ul) a{-moz-border-radius:5px 5px 0 0;-webkit-border-radius:5px;border-radius:5px 5px 0 0}.sm-dox>li:last-child>a,.sm-dox>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul{-moz-border-radius:0 0 5px 5px;-webkit-border-radius:0;border-radius:0 0 5px 5px}.sm-dox>li:last-child>a.highlighted,.sm-dox>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted{-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox ul{background:white}.sm-dox ul a,.sm-dox ul a:focus,.sm-dox ul a:hover,.sm-dox ul a:active{font-size:12px;border-left:8px solid transparent;line-height:36px;text-shadow:none;background-color:white;background-image:none}.sm-dox ul a:hover{background-image:url('tab_a.png');background-repeat:repeat-x;color:white;text-shadow:0 1px 1px black}.sm-dox ul ul a,.sm-dox ul ul a:hover,.sm-dox ul ul a:focus,.sm-dox ul ul a:active{border-left:16px solid transparent}.sm-dox ul ul ul a,.sm-dox ul ul ul a:hover,.sm-dox ul ul ul a:focus,.sm-dox ul ul ul a:active{border-left:24px solid transparent}.sm-dox ul ul ul ul a,.sm-dox ul ul ul ul a:hover,.sm-dox ul ul ul ul a:focus,.sm-dox ul ul ul ul a:active{border-left:32px solid transparent}.sm-dox ul ul ul ul ul a,.sm-dox ul ul ul ul ul a:hover,.sm-dox ul ul ul ul ul a:focus,.sm-dox ul ul ul ul ul a:active{border-left:40px solid transparent}@media(min-width:768px){.sm-dox ul{position:absolute;width:12em}.sm-dox li{float:left}.sm-dox.sm-rtl li{float:right}.sm-dox ul li,.sm-dox.sm-rtl ul li,.sm-dox.sm-vertical li{float:none}.sm-dox a{white-space:nowrap}.sm-dox ul a,.sm-dox.sm-vertical a{white-space:normal}.sm-dox .sm-nowrap>li>a,.sm-dox .sm-nowrap>li>:not(ul) a{white-space:nowrap}.sm-dox{padding:0 10px;background-image:url('tab_b.png');line-height:36px}.sm-dox a span.sub-arrow{top:50%;margin-top:-2px;right:12px;width:0;height:0;border-width:4px;border-style:solid dashed dashed dashed;border-color:#283A5D transparent transparent transparent;background:transparent;-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox a,.sm-dox a:focus,.sm-dox a:active,.sm-dox a:hover,.sm-dox a.highlighted{padding:0 12px;background-image:url('tab_s.png');background-repeat:no-repeat;background-position:right;-moz-border-radius:0 !important;-webkit-border-radius:0;border-radius:0 !important}.sm-dox a:hover{background-image:url('tab_a.png');background-repeat:repeat-x;color:white;text-shadow:0px 1px 1px rgba(0, 0, 0, 1.0)}.sm-dox a:hover span.sub-arrow{border-color:white transparent transparent transparent}.sm-dox a.has-submenu{padding-right:24px}.sm-dox li{border-top:0}.sm-dox>li>ul:before,.sm-dox>li>ul:after{content:'';position:absolute;top:-18px;left:30px;width:0;height:0;overflow:hidden;border-width:9px;border-style:dashed dashed solid dashed;border-color:transparent transparent #bbb transparent}.sm-dox>li>ul:after{top:-16px;left:31px;border-width:8px;border-color:transparent transparent white transparent}.sm-dox ul{border:1px solid #bbb;padding:5px 0;background:white;-moz-border-radius:5px !important;-webkit-border-radius:5px;border-radius:5px !important;-moz-box-shadow:0 5px 9px rgba(0,0,0,0.2);-webkit-box-shadow:0 5px 9px rgba(0,0,0,0.2);box-shadow:0 5px 9px rgba(0,0,0,0.2)}.sm-dox ul a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-color:transparent transparent transparent #555555;border-style:dashed dashed dashed solid}.sm-dox ul a,.sm-dox ul a:hover,.sm-dox ul a:focus,.sm-dox ul a:active,.sm-dox ul a.highlighted{color:#555555;background-image:none;border:0 !important}.sm-dox ul a:hover{background-image:url('tab_a.png');background-repeat:repeat-x;color:white;text-shadow:0px 1px 1px rgba(0, 0, 0, 1.0)}.sm-dox ul a:hover span.sub-arrow{border-color:transparent transparent transparent white}.sm-dox span.scroll-up,.sm-dox span.scroll-down{position:absolute;display:none;visibility:hidden;overflow:hidden;background:white;height:36px}.sm-dox span.scroll-up:hover,.sm-dox span.scroll-down:hover{background:#eee}.sm-dox span.scroll-up:hover span.scroll-up-arrow,.sm-dox span.scroll-up:hover span.scroll-down-arrow{border-color:transparent transparent #d23600 transparent}.sm-dox span.scroll-down:hover span.scroll-down-arrow{border-color:#d23600 transparent transparent transparent}.sm-dox span.scroll-up-arrow,.sm-dox span.scroll-down-arrow{position:absolute;top:0;left:50%;margin-left:-6px;width:0;height:0;overflow:hidden;border-width:6px;border-style:dashed dashed solid dashed;border-color:transparent transparent #555555 transparent}.sm-dox span.scroll-down-arrow{top:8px;border-style:solid dashed dashed dashed;border-color:#555555 transparent transparent transparent}.sm-dox.sm-rtl a.has-submenu{padding-right:12px;padding-left:24px}.sm-dox.sm-rtl a span.sub-arrow{right:auto;left:12px}.sm-dox.sm-rtl.sm-vertical a.has-submenu{padding:10px 20px}.sm-dox.sm-rtl.sm-vertical a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-rtl>li>ul:before{left:auto;right:30px}.sm-dox.sm-rtl>li>ul:after{left:auto;right:31px}.sm-dox.sm-rtl ul a.has-submenu{padding:10px 20px !important}.sm-dox.sm-rtl ul a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-vertical{padding:10px 0;-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox.sm-vertical a{padding:10px 20px}.sm-dox.sm-vertical a:hover,.sm-dox.sm-vertical a:focus,.sm-dox.sm-vertical a:active,.sm-dox.sm-vertical a.highlighted{background:#fff}.sm-dox.sm-vertical a.disabled{background-image:url('tab_b.png')}.sm-dox.sm-vertical a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-style:dashed dashed dashed solid;border-color:transparent transparent transparent #555}.sm-dox.sm-vertical>li>ul:before,.sm-dox.sm-vertical>li>ul:after{display:none}.sm-dox.sm-vertical ul a{padding:10px 20px}.sm-dox.sm-vertical ul a:hover,.sm-dox.sm-vertical ul a:focus,.sm-dox.sm-vertical ul a:active,.sm-dox.sm-vertical ul a.highlighted{background:#eee}.sm-dox.sm-vertical ul a.disabled{background:white}}
diff --git a/topics.html b/topics.html
index 141053f9e..0654e7ed8 100644
--- a/topics.html
+++ b/topics.html
@@ -1,3 +1,4 @@
+<!-- HTML header for doxygen 1.12.0-->
 <!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>
@@ -5,10 +6,15 @@
 <meta http-equiv="X-UA-Compatible" content="IE=11"/>
 <meta name="generator" content="Doxygen 1.12.0"/>
 <meta name="viewport" content="width=device-width, initial-scale=1"/>
-<title>Algorithms_in_C++: Topics</title>
+<title>TheAlgorithms/C++: Topics</title>
+<link rel="icon" href="favicon.svg" type="image/x-icon" />
 <link href="tabs.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="jquery.js"></script>
 <script type="text/javascript" src="dynsections.js"></script>
+<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
+<script type="text/javascript">
+    DoxygenAwesomeDarkModeToggle.init()
+</script>
 <script type="text/javascript" src="clipboard.js"></script>
 <link href="navtree.css" rel="stylesheet" type="text/css"/>
 <script type="text/javascript" src="navtreedata.js"></script>
@@ -18,14 +24,24 @@
 <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 type="text/javascript">
+window.MathJax = {
+  options: {
+    ignoreHtmlClass: 'tex2jax_ignore',
+    processHtmlClass: 'tex2jax_process'
+  },
+  loader: {
+    load: ['[tex]/ams']
+  },
+  tex: {
+    macros: {},
+    packages: ['base','configmacros','ams']
+  }
+};
 </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>
+<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
 <link href="doxygen.css" rel="stylesheet" type="text/css" />
+<link href="doxygen-awesome.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
 <div id="top"><!-- do not remove this div, it is closed by doxygen! -->
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
 <table cellspacing="0" cellpadding="0">
  <tbody>
  <tr id="projectrow">
+  <td id="projectlogo"><img alt="Logo" src="project_logo.png"/></td>
   <td id="projectalign">
-   <div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
+   <div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
    </div>
-   <div id="projectbrief">Set of algorithms implemented in C++.</div>
+   <div id="projectbrief">All the algorithms implemented in C++</div>
   </td>
  </tr>
  </tbody>